diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/CMakeCache.txt b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeCache.txt
new file mode 100644
index 0000000..c1dc5d3
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeCache.txt
@@ -0,0 +1,414 @@
+# This is the CMakeCache file.
+# For build in directory: d:/DOKUMENTY/diplomovka-final/Scott-cpp-win
+# It was generated by CMake: C:/mingw64/bin/cmake.exe
+# You can edit this file to change values found and used by cmake.
+# If you do not want to change any of the values, simply exit the editor.
+# If you do want to change a value, simply edit, save, and exit the editor.
+# The syntax for the file is as follows:
+# KEY:TYPE=VALUE
+# KEY is the name of a variable in the cache.
+# TYPE is a hint to GUIs for the type of VALUE, DO NOT EDIT TYPE!.
+# VALUE is the current value for the KEY.
+
+########################
+# EXTERNAL cache entries
+########################
+
+//Path to a program.
+CMAKE_ADDR2LINE:FILEPATH=C:/mingw64/bin/addr2line.exe
+
+//Path to a program.
+CMAKE_AR:FILEPATH=C:/mingw64/bin/ar.exe
+
+//Choose the type of build, options are: None Debug Release RelWithDebInfo
+// MinSizeRel ...
+CMAKE_BUILD_TYPE:STRING=
+
+//Enable/Disable color output during build.
+CMAKE_COLOR_MAKEFILE:BOOL=ON
+
+//CXX compiler
+CMAKE_CXX_COMPILER:STRING=C:/mingw64/bin/gcc.exe
+
+//A wrapper around 'ar' adding the appropriate '--plugin' option
+// for the GCC compiler
+CMAKE_CXX_COMPILER_AR:FILEPATH=C:/mingw64/bin/gcc-ar.exe
+
+//A wrapper around 'ranlib' adding the appropriate '--plugin' option
+// for the GCC compiler
+CMAKE_CXX_COMPILER_RANLIB:FILEPATH=C:/mingw64/bin/gcc-ranlib.exe
+
+//Flags used by the CXX compiler during all build types.
+CMAKE_CXX_FLAGS:STRING=
+
+//Flags used by the CXX compiler during DEBUG builds.
+CMAKE_CXX_FLAGS_DEBUG:STRING=-g
+
+//Flags used by the CXX compiler during MINSIZEREL builds.
+CMAKE_CXX_FLAGS_MINSIZEREL:STRING=-Os -DNDEBUG
+
+//Flags used by the CXX compiler during RELEASE builds.
+CMAKE_CXX_FLAGS_RELEASE:STRING=-O3 -DNDEBUG
+
+//Flags used by the CXX compiler during RELWITHDEBINFO builds.
+CMAKE_CXX_FLAGS_RELWITHDEBINFO:STRING=-O2 -g -DNDEBUG
+
+//Libraries linked by default with all C++ applications.
+CMAKE_CXX_STANDARD_LIBRARIES:STRING=-lkernel32 -luser32 -lgdi32 -lwinspool -lshell32 -lole32 -loleaut32 -luuid -lcomdlg32 -ladvapi32
+
+//C compiler
+CMAKE_C_COMPILER:FILEPATH=C:/mingw64/bin/gcc.exe
+
+//A wrapper around 'ar' adding the appropriate '--plugin' option
+// for the GCC compiler
+CMAKE_C_COMPILER_AR:FILEPATH=C:/mingw64/bin/gcc-ar.exe
+
+//A wrapper around 'ranlib' adding the appropriate '--plugin' option
+// for the GCC compiler
+CMAKE_C_COMPILER_RANLIB:FILEPATH=C:/mingw64/bin/gcc-ranlib.exe
+
+//Flags used by the C compiler during all build types.
+CMAKE_C_FLAGS:STRING=
+
+//Flags used by the C compiler during DEBUG builds.
+CMAKE_C_FLAGS_DEBUG:STRING=-g
+
+//Flags used by the C compiler during MINSIZEREL builds.
+CMAKE_C_FLAGS_MINSIZEREL:STRING=-Os -DNDEBUG
+
+//Flags used by the C compiler during RELEASE builds.
+CMAKE_C_FLAGS_RELEASE:STRING=-O3 -DNDEBUG
+
+//Flags used by the C compiler during RELWITHDEBINFO builds.
+CMAKE_C_FLAGS_RELWITHDEBINFO:STRING=-O2 -g -DNDEBUG
+
+//Libraries linked by default with all C applications.
+CMAKE_C_STANDARD_LIBRARIES:STRING=-lkernel32 -luser32 -lgdi32 -lwinspool -lshell32 -lole32 -loleaut32 -luuid -lcomdlg32 -ladvapi32
+
+//Path to a program.
+CMAKE_DLLTOOL:FILEPATH=C:/mingw64/bin/dlltool.exe
+
+//Flags used by the linker during all build types.
+CMAKE_EXE_LINKER_FLAGS:STRING=
+
+//Flags used by the linker during DEBUG builds.
+CMAKE_EXE_LINKER_FLAGS_DEBUG:STRING=
+
+//Flags used by the linker during MINSIZEREL builds.
+CMAKE_EXE_LINKER_FLAGS_MINSIZEREL:STRING=
+
+//Flags used by the linker during RELEASE builds.
+CMAKE_EXE_LINKER_FLAGS_RELEASE:STRING=
+
+//Flags used by the linker during RELWITHDEBINFO builds.
+CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO:STRING=
+
+//Value Computed by CMake.
+CMAKE_FIND_PACKAGE_REDIRECTS_DIR:STATIC=D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/CMakeFiles/pkgRedirects
+
+//Convert GNU import libraries to MS format (requires Visual Studio)
+CMAKE_GNUtoMS:BOOL=OFF
+
+//Install path prefix, prepended onto install directories.
+CMAKE_INSTALL_PREFIX:PATH=C:/Program Files (x86)/tiitls1.3
+
+//Path to a program.
+CMAKE_LINKER:FILEPATH=C:/mingw64/bin/ld.exe
+
+//Path to a program.
+CMAKE_MAKE_PROGRAM:FILEPATH=C:/mingw64/bin/mingw32-make.exe
+
+//Flags used by the linker during the creation of modules during
+// all build types.
+CMAKE_MODULE_LINKER_FLAGS:STRING=
+
+//Flags used by the linker during the creation of modules during
+// DEBUG builds.
+CMAKE_MODULE_LINKER_FLAGS_DEBUG:STRING=
+
+//Flags used by the linker during the creation of modules during
+// MINSIZEREL builds.
+CMAKE_MODULE_LINKER_FLAGS_MINSIZEREL:STRING=
+
+//Flags used by the linker during the creation of modules during
+// RELEASE builds.
+CMAKE_MODULE_LINKER_FLAGS_RELEASE:STRING=
+
+//Flags used by the linker during the creation of modules during
+// RELWITHDEBINFO builds.
+CMAKE_MODULE_LINKER_FLAGS_RELWITHDEBINFO:STRING=
+
+//Path to a program.
+CMAKE_NM:FILEPATH=C:/mingw64/bin/nm.exe
+
+//Path to a program.
+CMAKE_OBJCOPY:FILEPATH=C:/mingw64/bin/objcopy.exe
+
+//Path to a program.
+CMAKE_OBJDUMP:FILEPATH=C:/mingw64/bin/objdump.exe
+
+//Value Computed by CMake
+CMAKE_PROJECT_DESCRIPTION:STATIC=
+
+//Value Computed by CMake
+CMAKE_PROJECT_HOMEPAGE_URL:STATIC=
+
+//Value Computed by CMake
+CMAKE_PROJECT_NAME:STATIC=tiitls1.3
+
+//Path to a program.
+CMAKE_RANLIB:FILEPATH=C:/mingw64/bin/ranlib.exe
+
+//RC compiler
+CMAKE_RC_COMPILER:FILEPATH=C:/mingw64/bin/windres.exe
+
+//Flags for Windows Resource Compiler during all build types.
+CMAKE_RC_FLAGS:STRING=
+
+//Flags for Windows Resource Compiler during DEBUG builds.
+CMAKE_RC_FLAGS_DEBUG:STRING=
+
+//Flags for Windows Resource Compiler during MINSIZEREL builds.
+CMAKE_RC_FLAGS_MINSIZEREL:STRING=
+
+//Flags for Windows Resource Compiler during RELEASE builds.
+CMAKE_RC_FLAGS_RELEASE:STRING=
+
+//Flags for Windows Resource Compiler during RELWITHDEBINFO builds.
+CMAKE_RC_FLAGS_RELWITHDEBINFO:STRING=
+
+//Path to a program.
+CMAKE_READELF:FILEPATH=C:/mingw64/bin/readelf.exe
+
+//Flags used by the linker during the creation of shared libraries
+// during all build types.
+CMAKE_SHARED_LINKER_FLAGS:STRING=
+
+//Flags used by the linker during the creation of shared libraries
+// during DEBUG builds.
+CMAKE_SHARED_LINKER_FLAGS_DEBUG:STRING=
+
+//Flags used by the linker during the creation of shared libraries
+// during MINSIZEREL builds.
+CMAKE_SHARED_LINKER_FLAGS_MINSIZEREL:STRING=
+
+//Flags used by the linker during the creation of shared libraries
+// during RELEASE builds.
+CMAKE_SHARED_LINKER_FLAGS_RELEASE:STRING=
+
+//Flags used by the linker during the creation of shared libraries
+// during RELWITHDEBINFO builds.
+CMAKE_SHARED_LINKER_FLAGS_RELWITHDEBINFO:STRING=
+
+//If set, runtime paths are not added when installing shared libraries,
+// but are added when building.
+CMAKE_SKIP_INSTALL_RPATH:BOOL=NO
+
+//If set, runtime paths are not added when using shared libraries.
+CMAKE_SKIP_RPATH:BOOL=NO
+
+//Flags used by the linker during the creation of static libraries
+// during all build types.
+CMAKE_STATIC_LINKER_FLAGS:STRING=
+
+//Flags used by the linker during the creation of static libraries
+// during DEBUG builds.
+CMAKE_STATIC_LINKER_FLAGS_DEBUG:STRING=
+
+//Flags used by the linker during the creation of static libraries
+// during MINSIZEREL builds.
+CMAKE_STATIC_LINKER_FLAGS_MINSIZEREL:STRING=
+
+//Flags used by the linker during the creation of static libraries
+// during RELEASE builds.
+CMAKE_STATIC_LINKER_FLAGS_RELEASE:STRING=
+
+//Flags used by the linker during the creation of static libraries
+// during RELWITHDEBINFO builds.
+CMAKE_STATIC_LINKER_FLAGS_RELWITHDEBINFO:STRING=
+
+//Path to a program.
+CMAKE_STRIP:FILEPATH=C:/mingw64/bin/strip.exe
+
+//Path to a program.
+CMAKE_TAPI:FILEPATH=CMAKE_TAPI-NOTFOUND
+
+//If this value is on, makefiles will be generated without the
+// .SILENT directive, and all commands will be echoed to the console
+// during the make.  This is useful for debugging only. With Visual
+// Studio IDE projects all commands are done without /nologo.
+CMAKE_VERBOSE_MAKEFILE:BOOL=FALSE
+
+//Value Computed by CMake
+tiitls1.3_BINARY_DIR:STATIC=D:/DOKUMENTY/diplomovka-final/Scott-cpp-win
+
+//Value Computed by CMake
+tiitls1.3_IS_TOP_LEVEL:STATIC=ON
+
+//Value Computed by CMake
+tiitls1.3_SOURCE_DIR:STATIC=D:/DOKUMENTY/diplomovka-final/Scott-cpp-win
+
+
+########################
+# INTERNAL cache entries
+########################
+
+//ADVANCED property for variable: CMAKE_ADDR2LINE
+CMAKE_ADDR2LINE-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_AR
+CMAKE_AR-ADVANCED:INTERNAL=1
+//This is the directory where this CMakeCache.txt was created
+CMAKE_CACHEFILE_DIR:INTERNAL=d:/DOKUMENTY/diplomovka-final/Scott-cpp-win
+//Major version of cmake used to create the current loaded cache
+CMAKE_CACHE_MAJOR_VERSION:INTERNAL=3
+//Minor version of cmake used to create the current loaded cache
+CMAKE_CACHE_MINOR_VERSION:INTERNAL=28
+//Patch version of cmake used to create the current loaded cache
+CMAKE_CACHE_PATCH_VERSION:INTERNAL=2
+//ADVANCED property for variable: CMAKE_COLOR_MAKEFILE
+CMAKE_COLOR_MAKEFILE-ADVANCED:INTERNAL=1
+//Path to CMake executable.
+CMAKE_COMMAND:INTERNAL=C:/mingw64/bin/cmake.exe
+//Path to cpack program executable.
+CMAKE_CPACK_COMMAND:INTERNAL=C:/mingw64/bin/cpack.exe
+//Path to ctest program executable.
+CMAKE_CTEST_COMMAND:INTERNAL=C:/mingw64/bin/ctest.exe
+//ADVANCED property for variable: CMAKE_CXX_COMPILER
+CMAKE_CXX_COMPILER-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_CXX_COMPILER_AR
+CMAKE_CXX_COMPILER_AR-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_CXX_COMPILER_RANLIB
+CMAKE_CXX_COMPILER_RANLIB-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_CXX_FLAGS
+CMAKE_CXX_FLAGS-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_CXX_FLAGS_DEBUG
+CMAKE_CXX_FLAGS_DEBUG-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_CXX_FLAGS_MINSIZEREL
+CMAKE_CXX_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_CXX_FLAGS_RELEASE
+CMAKE_CXX_FLAGS_RELEASE-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_CXX_FLAGS_RELWITHDEBINFO
+CMAKE_CXX_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_CXX_STANDARD_LIBRARIES
+CMAKE_CXX_STANDARD_LIBRARIES-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_C_COMPILER
+CMAKE_C_COMPILER-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_C_COMPILER_AR
+CMAKE_C_COMPILER_AR-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_C_COMPILER_RANLIB
+CMAKE_C_COMPILER_RANLIB-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_C_FLAGS
+CMAKE_C_FLAGS-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_C_FLAGS_DEBUG
+CMAKE_C_FLAGS_DEBUG-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_C_FLAGS_MINSIZEREL
+CMAKE_C_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_C_FLAGS_RELEASE
+CMAKE_C_FLAGS_RELEASE-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_C_FLAGS_RELWITHDEBINFO
+CMAKE_C_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_C_STANDARD_LIBRARIES
+CMAKE_C_STANDARD_LIBRARIES-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_DLLTOOL
+CMAKE_DLLTOOL-ADVANCED:INTERNAL=1
+//Executable file format
+CMAKE_EXECUTABLE_FORMAT:INTERNAL=Unknown
+//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS
+CMAKE_EXE_LINKER_FLAGS-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_DEBUG
+CMAKE_EXE_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_MINSIZEREL
+CMAKE_EXE_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_RELEASE
+CMAKE_EXE_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO
+CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
+//Name of external makefile project generator.
+CMAKE_EXTRA_GENERATOR:INTERNAL=
+//Name of generator.
+CMAKE_GENERATOR:INTERNAL=MinGW Makefiles
+//Generator instance identifier.
+CMAKE_GENERATOR_INSTANCE:INTERNAL=
+//Name of generator platform.
+CMAKE_GENERATOR_PLATFORM:INTERNAL=
+//Name of generator toolset.
+CMAKE_GENERATOR_TOOLSET:INTERNAL=
+//Source directory with the top level CMakeLists.txt file for this
+// project
+CMAKE_HOME_DIRECTORY:INTERNAL=D:/DOKUMENTY/diplomovka-final/Scott-cpp-win
+//ADVANCED property for variable: CMAKE_LINKER
+CMAKE_LINKER-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_MAKE_PROGRAM
+CMAKE_MAKE_PROGRAM-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS
+CMAKE_MODULE_LINKER_FLAGS-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_DEBUG
+CMAKE_MODULE_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_MINSIZEREL
+CMAKE_MODULE_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_RELEASE
+CMAKE_MODULE_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_RELWITHDEBINFO
+CMAKE_MODULE_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_NM
+CMAKE_NM-ADVANCED:INTERNAL=1
+//number of local generators
+CMAKE_NUMBER_OF_MAKEFILES:INTERNAL=1
+//ADVANCED property for variable: CMAKE_OBJCOPY
+CMAKE_OBJCOPY-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_OBJDUMP
+CMAKE_OBJDUMP-ADVANCED:INTERNAL=1
+//Platform information initialized
+CMAKE_PLATFORM_INFO_INITIALIZED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_RANLIB
+CMAKE_RANLIB-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_RC_COMPILER
+CMAKE_RC_COMPILER-ADVANCED:INTERNAL=1
+CMAKE_RC_COMPILER_WORKS:INTERNAL=1
+//ADVANCED property for variable: CMAKE_RC_FLAGS
+CMAKE_RC_FLAGS-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_RC_FLAGS_DEBUG
+CMAKE_RC_FLAGS_DEBUG-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_RC_FLAGS_MINSIZEREL
+CMAKE_RC_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_RC_FLAGS_RELEASE
+CMAKE_RC_FLAGS_RELEASE-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_RC_FLAGS_RELWITHDEBINFO
+CMAKE_RC_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_READELF
+CMAKE_READELF-ADVANCED:INTERNAL=1
+//Path to CMake installation.
+CMAKE_ROOT:INTERNAL=C:/mingw64/share/cmake-3.28
+//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS
+CMAKE_SHARED_LINKER_FLAGS-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_DEBUG
+CMAKE_SHARED_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_MINSIZEREL
+CMAKE_SHARED_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_RELEASE
+CMAKE_SHARED_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_RELWITHDEBINFO
+CMAKE_SHARED_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_SKIP_INSTALL_RPATH
+CMAKE_SKIP_INSTALL_RPATH-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_SKIP_RPATH
+CMAKE_SKIP_RPATH-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_STATIC_LINKER_FLAGS
+CMAKE_STATIC_LINKER_FLAGS-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_STATIC_LINKER_FLAGS_DEBUG
+CMAKE_STATIC_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_STATIC_LINKER_FLAGS_MINSIZEREL
+CMAKE_STATIC_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_STATIC_LINKER_FLAGS_RELEASE
+CMAKE_STATIC_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_STATIC_LINKER_FLAGS_RELWITHDEBINFO
+CMAKE_STATIC_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_STRIP
+CMAKE_STRIP-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_TAPI
+CMAKE_TAPI-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_VERBOSE_MAKEFILE
+CMAKE_VERBOSE_MAKEFILE-ADVANCED:INTERNAL=1
+//linker supports push/pop state
+_CMAKE_LINKER_PUSHPOP_STATE_SUPPORTED:INTERNAL=TRUE
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/3.28.2/CMakeCCompiler.cmake b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/3.28.2/CMakeCCompiler.cmake
new file mode 100644
index 0000000..3a7e3db
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/3.28.2/CMakeCCompiler.cmake
@@ -0,0 +1,74 @@
+set(CMAKE_C_COMPILER "C:/mingw64/bin/gcc.exe")
+set(CMAKE_C_COMPILER_ARG1 "")
+set(CMAKE_C_COMPILER_ID "GNU")
+set(CMAKE_C_COMPILER_VERSION "13.2.0")
+set(CMAKE_C_COMPILER_VERSION_INTERNAL "")
+set(CMAKE_C_COMPILER_WRAPPER "")
+set(CMAKE_C_STANDARD_COMPUTED_DEFAULT "17")
+set(CMAKE_C_EXTENSIONS_COMPUTED_DEFAULT "ON")
+set(CMAKE_C_COMPILE_FEATURES "c_std_90;c_function_prototypes;c_std_99;c_restrict;c_variadic_macros;c_std_11;c_static_assert;c_std_17;c_std_23")
+set(CMAKE_C90_COMPILE_FEATURES "c_std_90;c_function_prototypes")
+set(CMAKE_C99_COMPILE_FEATURES "c_std_99;c_restrict;c_variadic_macros")
+set(CMAKE_C11_COMPILE_FEATURES "c_std_11;c_static_assert")
+set(CMAKE_C17_COMPILE_FEATURES "c_std_17")
+set(CMAKE_C23_COMPILE_FEATURES "c_std_23")
+
+set(CMAKE_C_PLATFORM_ID "MinGW")
+set(CMAKE_C_SIMULATE_ID "")
+set(CMAKE_C_COMPILER_FRONTEND_VARIANT "GNU")
+set(CMAKE_C_SIMULATE_VERSION "")
+
+
+
+
+set(CMAKE_AR "C:/mingw64/bin/ar.exe")
+set(CMAKE_C_COMPILER_AR "C:/mingw64/bin/gcc-ar.exe")
+set(CMAKE_RANLIB "C:/mingw64/bin/ranlib.exe")
+set(CMAKE_C_COMPILER_RANLIB "C:/mingw64/bin/gcc-ranlib.exe")
+set(CMAKE_LINKER "C:/mingw64/bin/ld.exe")
+set(CMAKE_MT "")
+set(CMAKE_TAPI "CMAKE_TAPI-NOTFOUND")
+set(CMAKE_COMPILER_IS_GNUCC 1)
+set(CMAKE_C_COMPILER_LOADED 1)
+set(CMAKE_C_COMPILER_WORKS TRUE)
+set(CMAKE_C_ABI_COMPILED TRUE)
+
+set(CMAKE_C_COMPILER_ENV_VAR "CC")
+
+set(CMAKE_C_COMPILER_ID_RUN 1)
+set(CMAKE_C_SOURCE_FILE_EXTENSIONS c;m)
+set(CMAKE_C_IGNORE_EXTENSIONS h;H;o;O;obj;OBJ;def;DEF;rc;RC)
+set(CMAKE_C_LINKER_PREFERENCE 10)
+set(CMAKE_C_LINKER_DEPFILE_SUPPORTED TRUE)
+
+# Save compiler ABI information.
+set(CMAKE_C_SIZEOF_DATA_PTR "8")
+set(CMAKE_C_COMPILER_ABI "")
+set(CMAKE_C_BYTE_ORDER "LITTLE_ENDIAN")
+set(CMAKE_C_LIBRARY_ARCHITECTURE "")
+
+if(CMAKE_C_SIZEOF_DATA_PTR)
+  set(CMAKE_SIZEOF_VOID_P "${CMAKE_C_SIZEOF_DATA_PTR}")
+endif()
+
+if(CMAKE_C_COMPILER_ABI)
+  set(CMAKE_INTERNAL_PLATFORM_ABI "${CMAKE_C_COMPILER_ABI}")
+endif()
+
+if(CMAKE_C_LIBRARY_ARCHITECTURE)
+  set(CMAKE_LIBRARY_ARCHITECTURE "")
+endif()
+
+set(CMAKE_C_CL_SHOWINCLUDES_PREFIX "")
+if(CMAKE_C_CL_SHOWINCLUDES_PREFIX)
+  set(CMAKE_CL_SHOWINCLUDES_PREFIX "${CMAKE_C_CL_SHOWINCLUDES_PREFIX}")
+endif()
+
+
+
+
+
+set(CMAKE_C_IMPLICIT_INCLUDE_DIRECTORIES "C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include;C:/mingw64/include;C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include-fixed;C:/mingw64/x86_64-w64-mingw32/include")
+set(CMAKE_C_IMPLICIT_LINK_LIBRARIES "mingw32;gcc;moldname;mingwex;kernel32;pthread;advapi32;shell32;user32;kernel32;mingw32;gcc;moldname;mingwex;kernel32")
+set(CMAKE_C_IMPLICIT_LINK_DIRECTORIES "C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0;C:/mingw64/lib/gcc;C:/mingw64/x86_64-w64-mingw32/lib;C:/mingw64/lib")
+set(CMAKE_C_IMPLICIT_LINK_FRAMEWORK_DIRECTORIES "")
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/3.28.2/CMakeCXXCompiler.cmake b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/3.28.2/CMakeCXXCompiler.cmake
new file mode 100644
index 0000000..7a3e865
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/3.28.2/CMakeCXXCompiler.cmake
@@ -0,0 +1,85 @@
+set(CMAKE_CXX_COMPILER "C:/mingw64/bin/gcc.exe")
+set(CMAKE_CXX_COMPILER_ARG1 "")
+set(CMAKE_CXX_COMPILER_ID "GNU")
+set(CMAKE_CXX_COMPILER_VERSION "13.2.0")
+set(CMAKE_CXX_COMPILER_VERSION_INTERNAL "")
+set(CMAKE_CXX_COMPILER_WRAPPER "")
+set(CMAKE_CXX_STANDARD_COMPUTED_DEFAULT "17")
+set(CMAKE_CXX_EXTENSIONS_COMPUTED_DEFAULT "ON")
+set(CMAKE_CXX_COMPILE_FEATURES "cxx_std_98;cxx_template_template_parameters;cxx_std_11;cxx_alias_templates;cxx_alignas;cxx_alignof;cxx_attributes;cxx_auto_type;cxx_constexpr;cxx_decltype;cxx_decltype_incomplete_return_types;cxx_default_function_template_args;cxx_defaulted_functions;cxx_defaulted_move_initializers;cxx_delegating_constructors;cxx_deleted_functions;cxx_enum_forward_declarations;cxx_explicit_conversions;cxx_extended_friend_declarations;cxx_extern_templates;cxx_final;cxx_func_identifier;cxx_generalized_initializers;cxx_inheriting_constructors;cxx_inline_namespaces;cxx_lambdas;cxx_local_type_template_args;cxx_long_long_type;cxx_noexcept;cxx_nonstatic_member_init;cxx_nullptr;cxx_override;cxx_range_for;cxx_raw_string_literals;cxx_reference_qualified_functions;cxx_right_angle_brackets;cxx_rvalue_references;cxx_sizeof_member;cxx_static_assert;cxx_strong_enums;cxx_thread_local;cxx_trailing_return_types;cxx_unicode_literals;cxx_uniform_initialization;cxx_unrestricted_unions;cxx_user_literals;cxx_variadic_macros;cxx_variadic_templates;cxx_std_14;cxx_aggregate_default_initializers;cxx_attribute_deprecated;cxx_binary_literals;cxx_contextual_conversions;cxx_decltype_auto;cxx_digit_separators;cxx_generic_lambdas;cxx_lambda_init_captures;cxx_relaxed_constexpr;cxx_return_type_deduction;cxx_variable_templates;cxx_std_17;cxx_std_20;cxx_std_23")
+set(CMAKE_CXX98_COMPILE_FEATURES "cxx_std_98;cxx_template_template_parameters")
+set(CMAKE_CXX11_COMPILE_FEATURES "cxx_std_11;cxx_alias_templates;cxx_alignas;cxx_alignof;cxx_attributes;cxx_auto_type;cxx_constexpr;cxx_decltype;cxx_decltype_incomplete_return_types;cxx_default_function_template_args;cxx_defaulted_functions;cxx_defaulted_move_initializers;cxx_delegating_constructors;cxx_deleted_functions;cxx_enum_forward_declarations;cxx_explicit_conversions;cxx_extended_friend_declarations;cxx_extern_templates;cxx_final;cxx_func_identifier;cxx_generalized_initializers;cxx_inheriting_constructors;cxx_inline_namespaces;cxx_lambdas;cxx_local_type_template_args;cxx_long_long_type;cxx_noexcept;cxx_nonstatic_member_init;cxx_nullptr;cxx_override;cxx_range_for;cxx_raw_string_literals;cxx_reference_qualified_functions;cxx_right_angle_brackets;cxx_rvalue_references;cxx_sizeof_member;cxx_static_assert;cxx_strong_enums;cxx_thread_local;cxx_trailing_return_types;cxx_unicode_literals;cxx_uniform_initialization;cxx_unrestricted_unions;cxx_user_literals;cxx_variadic_macros;cxx_variadic_templates")
+set(CMAKE_CXX14_COMPILE_FEATURES "cxx_std_14;cxx_aggregate_default_initializers;cxx_attribute_deprecated;cxx_binary_literals;cxx_contextual_conversions;cxx_decltype_auto;cxx_digit_separators;cxx_generic_lambdas;cxx_lambda_init_captures;cxx_relaxed_constexpr;cxx_return_type_deduction;cxx_variable_templates")
+set(CMAKE_CXX17_COMPILE_FEATURES "cxx_std_17")
+set(CMAKE_CXX20_COMPILE_FEATURES "cxx_std_20")
+set(CMAKE_CXX23_COMPILE_FEATURES "cxx_std_23")
+
+set(CMAKE_CXX_PLATFORM_ID "MinGW")
+set(CMAKE_CXX_SIMULATE_ID "")
+set(CMAKE_CXX_COMPILER_FRONTEND_VARIANT "GNU")
+set(CMAKE_CXX_SIMULATE_VERSION "")
+
+
+
+
+set(CMAKE_AR "C:/mingw64/bin/ar.exe")
+set(CMAKE_CXX_COMPILER_AR "C:/mingw64/bin/gcc-ar.exe")
+set(CMAKE_RANLIB "C:/mingw64/bin/ranlib.exe")
+set(CMAKE_CXX_COMPILER_RANLIB "C:/mingw64/bin/gcc-ranlib.exe")
+set(CMAKE_LINKER "C:/mingw64/bin/ld.exe")
+set(CMAKE_MT "")
+set(CMAKE_TAPI "CMAKE_TAPI-NOTFOUND")
+set(CMAKE_COMPILER_IS_GNUCXX 1)
+set(CMAKE_CXX_COMPILER_LOADED 1)
+set(CMAKE_CXX_COMPILER_WORKS TRUE)
+set(CMAKE_CXX_ABI_COMPILED TRUE)
+
+set(CMAKE_CXX_COMPILER_ENV_VAR "CXX")
+
+set(CMAKE_CXX_COMPILER_ID_RUN 1)
+set(CMAKE_CXX_SOURCE_FILE_EXTENSIONS C;M;c++;cc;cpp;cxx;m;mm;mpp;CPP;ixx;cppm;ccm;cxxm;c++m)
+set(CMAKE_CXX_IGNORE_EXTENSIONS inl;h;hpp;HPP;H;o;O;obj;OBJ;def;DEF;rc;RC)
+
+foreach (lang C OBJC OBJCXX)
+  if (CMAKE_${lang}_COMPILER_ID_RUN)
+    foreach(extension IN LISTS CMAKE_${lang}_SOURCE_FILE_EXTENSIONS)
+      list(REMOVE_ITEM CMAKE_CXX_SOURCE_FILE_EXTENSIONS ${extension})
+    endforeach()
+  endif()
+endforeach()
+
+set(CMAKE_CXX_LINKER_PREFERENCE 30)
+set(CMAKE_CXX_LINKER_PREFERENCE_PROPAGATES 1)
+set(CMAKE_CXX_LINKER_DEPFILE_SUPPORTED TRUE)
+
+# Save compiler ABI information.
+set(CMAKE_CXX_SIZEOF_DATA_PTR "8")
+set(CMAKE_CXX_COMPILER_ABI "")
+set(CMAKE_CXX_BYTE_ORDER "LITTLE_ENDIAN")
+set(CMAKE_CXX_LIBRARY_ARCHITECTURE "")
+
+if(CMAKE_CXX_SIZEOF_DATA_PTR)
+  set(CMAKE_SIZEOF_VOID_P "${CMAKE_CXX_SIZEOF_DATA_PTR}")
+endif()
+
+if(CMAKE_CXX_COMPILER_ABI)
+  set(CMAKE_INTERNAL_PLATFORM_ABI "${CMAKE_CXX_COMPILER_ABI}")
+endif()
+
+if(CMAKE_CXX_LIBRARY_ARCHITECTURE)
+  set(CMAKE_LIBRARY_ARCHITECTURE "")
+endif()
+
+set(CMAKE_CXX_CL_SHOWINCLUDES_PREFIX "")
+if(CMAKE_CXX_CL_SHOWINCLUDES_PREFIX)
+  set(CMAKE_CL_SHOWINCLUDES_PREFIX "${CMAKE_CXX_CL_SHOWINCLUDES_PREFIX}")
+endif()
+
+
+
+
+
+set(CMAKE_CXX_IMPLICIT_INCLUDE_DIRECTORIES "C:/mingw64/include/c++/13.2.0;C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32;C:/mingw64/include/c++/13.2.0/backward;C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include;C:/mingw64/include;C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include-fixed;C:/mingw64/x86_64-w64-mingw32/include")
+set(CMAKE_CXX_IMPLICIT_LINK_LIBRARIES "mingw32;gcc;moldname;mingwex;kernel32;pthread;advapi32;shell32;user32;kernel32;mingw32;gcc;moldname;mingwex;kernel32")
+set(CMAKE_CXX_IMPLICIT_LINK_DIRECTORIES "C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0;C:/mingw64/lib/gcc;C:/mingw64/x86_64-w64-mingw32/lib;C:/mingw64/lib")
+set(CMAKE_CXX_IMPLICIT_LINK_FRAMEWORK_DIRECTORIES "")
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/3.28.2/CMakeDetermineCompilerABI_C.bin b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/3.28.2/CMakeDetermineCompilerABI_C.bin
new file mode 100644
index 0000000..d231954
Binary files /dev/null and b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/3.28.2/CMakeDetermineCompilerABI_C.bin differ
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/3.28.2/CMakeDetermineCompilerABI_CXX.bin b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/3.28.2/CMakeDetermineCompilerABI_CXX.bin
new file mode 100644
index 0000000..c0477e1
Binary files /dev/null and b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/3.28.2/CMakeDetermineCompilerABI_CXX.bin differ
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/3.28.2/CMakeRCCompiler.cmake b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/3.28.2/CMakeRCCompiler.cmake
new file mode 100644
index 0000000..6aea0a8
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/3.28.2/CMakeRCCompiler.cmake
@@ -0,0 +1,6 @@
+set(CMAKE_RC_COMPILER "C:/mingw64/bin/windres.exe")
+set(CMAKE_RC_COMPILER_ARG1 "")
+set(CMAKE_RC_COMPILER_LOADED 1)
+set(CMAKE_RC_SOURCE_FILE_EXTENSIONS rc;RC)
+set(CMAKE_RC_OUTPUT_EXTENSION .obj)
+set(CMAKE_RC_COMPILER_ENV_VAR "RC")
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/3.28.2/CMakeSystem.cmake b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/3.28.2/CMakeSystem.cmake
new file mode 100644
index 0000000..d3dc93f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/3.28.2/CMakeSystem.cmake
@@ -0,0 +1,15 @@
+set(CMAKE_HOST_SYSTEM "Windows-6.2.9200")
+set(CMAKE_HOST_SYSTEM_NAME "Windows")
+set(CMAKE_HOST_SYSTEM_VERSION "6.2.9200")
+set(CMAKE_HOST_SYSTEM_PROCESSOR "AMD64")
+
+
+
+set(CMAKE_SYSTEM "Windows-6.2.9200")
+set(CMAKE_SYSTEM_NAME "Windows")
+set(CMAKE_SYSTEM_VERSION "6.2.9200")
+set(CMAKE_SYSTEM_PROCESSOR "AMD64")
+
+set(CMAKE_CROSSCOMPILING "FALSE")
+
+set(CMAKE_SYSTEM_LOADED 1)
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/3.28.2/CompilerIdC/CMakeCCompilerId.c b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/3.28.2/CompilerIdC/CMakeCCompilerId.c
new file mode 100644
index 0000000..b0c5d2d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/3.28.2/CompilerIdC/CMakeCCompilerId.c
@@ -0,0 +1,880 @@
+#ifdef __cplusplus
+# error "A C++ compiler has been selected for C."
+#endif
+
+#if defined(__18CXX)
+# define ID_VOID_MAIN
+#endif
+#if defined(__CLASSIC_C__)
+/* cv-qualifiers did not exist in K&R C */
+# define const
+# define volatile
+#endif
+
+#if !defined(__has_include)
+/* If the compiler does not have __has_include, pretend the answer is
+   always no.  */
+#  define __has_include(x) 0
+#endif
+
+
+/* Version number components: V=Version, R=Revision, P=Patch
+   Version date components:   YYYY=Year, MM=Month,   DD=Day  */
+
+#if defined(__INTEL_COMPILER) || defined(__ICC)
+# define COMPILER_ID "Intel"
+# if defined(_MSC_VER)
+#  define SIMULATE_ID "MSVC"
+# endif
+# if defined(__GNUC__)
+#  define SIMULATE_ID "GNU"
+# endif
+  /* __INTEL_COMPILER = VRP prior to 2021, and then VVVV for 2021 and later,
+     except that a few beta releases use the old format with V=2021.  */
+# if __INTEL_COMPILER < 2021 || __INTEL_COMPILER == 202110 || __INTEL_COMPILER == 202111
+#  define COMPILER_VERSION_MAJOR DEC(__INTEL_COMPILER/100)
+#  define COMPILER_VERSION_MINOR DEC(__INTEL_COMPILER/10 % 10)
+#  if defined(__INTEL_COMPILER_UPDATE)
+#   define COMPILER_VERSION_PATCH DEC(__INTEL_COMPILER_UPDATE)
+#  else
+#   define COMPILER_VERSION_PATCH DEC(__INTEL_COMPILER   % 10)
+#  endif
+# else
+#  define COMPILER_VERSION_MAJOR DEC(__INTEL_COMPILER)
+#  define COMPILER_VERSION_MINOR DEC(__INTEL_COMPILER_UPDATE)
+   /* The third version component from --version is an update index,
+      but no macro is provided for it.  */
+#  define COMPILER_VERSION_PATCH DEC(0)
+# endif
+# if defined(__INTEL_COMPILER_BUILD_DATE)
+   /* __INTEL_COMPILER_BUILD_DATE = YYYYMMDD */
+#  define COMPILER_VERSION_TWEAK DEC(__INTEL_COMPILER_BUILD_DATE)
+# endif
+# if defined(_MSC_VER)
+   /* _MSC_VER = VVRR */
+#  define SIMULATE_VERSION_MAJOR DEC(_MSC_VER / 100)
+#  define SIMULATE_VERSION_MINOR DEC(_MSC_VER % 100)
+# endif
+# if defined(__GNUC__)
+#  define SIMULATE_VERSION_MAJOR DEC(__GNUC__)
+# elif defined(__GNUG__)
+#  define SIMULATE_VERSION_MAJOR DEC(__GNUG__)
+# endif
+# if defined(__GNUC_MINOR__)
+#  define SIMULATE_VERSION_MINOR DEC(__GNUC_MINOR__)
+# endif
+# if defined(__GNUC_PATCHLEVEL__)
+#  define SIMULATE_VERSION_PATCH DEC(__GNUC_PATCHLEVEL__)
+# endif
+
+#elif (defined(__clang__) && defined(__INTEL_CLANG_COMPILER)) || defined(__INTEL_LLVM_COMPILER)
+# define COMPILER_ID "IntelLLVM"
+#if defined(_MSC_VER)
+# define SIMULATE_ID "MSVC"
+#endif
+#if defined(__GNUC__)
+# define SIMULATE_ID "GNU"
+#endif
+/* __INTEL_LLVM_COMPILER = VVVVRP prior to 2021.2.0, VVVVRRPP for 2021.2.0 and
+ * later.  Look for 6 digit vs. 8 digit version number to decide encoding.
+ * VVVV is no smaller than the current year when a version is released.
+ */
+#if __INTEL_LLVM_COMPILER < 1000000L
+# define COMPILER_VERSION_MAJOR DEC(__INTEL_LLVM_COMPILER/100)
+# define COMPILER_VERSION_MINOR DEC(__INTEL_LLVM_COMPILER/10 % 10)
+# define COMPILER_VERSION_PATCH DEC(__INTEL_LLVM_COMPILER    % 10)
+#else
+# define COMPILER_VERSION_MAJOR DEC(__INTEL_LLVM_COMPILER/10000)
+# define COMPILER_VERSION_MINOR DEC(__INTEL_LLVM_COMPILER/100 % 100)
+# define COMPILER_VERSION_PATCH DEC(__INTEL_LLVM_COMPILER     % 100)
+#endif
+#if defined(_MSC_VER)
+  /* _MSC_VER = VVRR */
+# define SIMULATE_VERSION_MAJOR DEC(_MSC_VER / 100)
+# define SIMULATE_VERSION_MINOR DEC(_MSC_VER % 100)
+#endif
+#if defined(__GNUC__)
+# define SIMULATE_VERSION_MAJOR DEC(__GNUC__)
+#elif defined(__GNUG__)
+# define SIMULATE_VERSION_MAJOR DEC(__GNUG__)
+#endif
+#if defined(__GNUC_MINOR__)
+# define SIMULATE_VERSION_MINOR DEC(__GNUC_MINOR__)
+#endif
+#if defined(__GNUC_PATCHLEVEL__)
+# define SIMULATE_VERSION_PATCH DEC(__GNUC_PATCHLEVEL__)
+#endif
+
+#elif defined(__PATHCC__)
+# define COMPILER_ID "PathScale"
+# define COMPILER_VERSION_MAJOR DEC(__PATHCC__)
+# define COMPILER_VERSION_MINOR DEC(__PATHCC_MINOR__)
+# if defined(__PATHCC_PATCHLEVEL__)
+#  define COMPILER_VERSION_PATCH DEC(__PATHCC_PATCHLEVEL__)
+# endif
+
+#elif defined(__BORLANDC__) && defined(__CODEGEARC_VERSION__)
+# define COMPILER_ID "Embarcadero"
+# define COMPILER_VERSION_MAJOR HEX(__CODEGEARC_VERSION__>>24 & 0x00FF)
+# define COMPILER_VERSION_MINOR HEX(__CODEGEARC_VERSION__>>16 & 0x00FF)
+# define COMPILER_VERSION_PATCH DEC(__CODEGEARC_VERSION__     & 0xFFFF)
+
+#elif defined(__BORLANDC__)
+# define COMPILER_ID "Borland"
+  /* __BORLANDC__ = 0xVRR */
+# define COMPILER_VERSION_MAJOR HEX(__BORLANDC__>>8)
+# define COMPILER_VERSION_MINOR HEX(__BORLANDC__ & 0xFF)
+
+#elif defined(__WATCOMC__) && __WATCOMC__ < 1200
+# define COMPILER_ID "Watcom"
+   /* __WATCOMC__ = VVRR */
+# define COMPILER_VERSION_MAJOR DEC(__WATCOMC__ / 100)
+# define COMPILER_VERSION_MINOR DEC((__WATCOMC__ / 10) % 10)
+# if (__WATCOMC__ % 10) > 0
+#  define COMPILER_VERSION_PATCH DEC(__WATCOMC__ % 10)
+# endif
+
+#elif defined(__WATCOMC__)
+# define COMPILER_ID "OpenWatcom"
+   /* __WATCOMC__ = VVRP + 1100 */
+# define COMPILER_VERSION_MAJOR DEC((__WATCOMC__ - 1100) / 100)
+# define COMPILER_VERSION_MINOR DEC((__WATCOMC__ / 10) % 10)
+# if (__WATCOMC__ % 10) > 0
+#  define COMPILER_VERSION_PATCH DEC(__WATCOMC__ % 10)
+# endif
+
+#elif defined(__SUNPRO_C)
+# define COMPILER_ID "SunPro"
+# if __SUNPRO_C >= 0x5100
+   /* __SUNPRO_C = 0xVRRP */
+#  define COMPILER_VERSION_MAJOR HEX(__SUNPRO_C>>12)
+#  define COMPILER_VERSION_MINOR HEX(__SUNPRO_C>>4 & 0xFF)
+#  define COMPILER_VERSION_PATCH HEX(__SUNPRO_C    & 0xF)
+# else
+   /* __SUNPRO_CC = 0xVRP */
+#  define COMPILER_VERSION_MAJOR HEX(__SUNPRO_C>>8)
+#  define COMPILER_VERSION_MINOR HEX(__SUNPRO_C>>4 & 0xF)
+#  define COMPILER_VERSION_PATCH HEX(__SUNPRO_C    & 0xF)
+# endif
+
+#elif defined(__HP_cc)
+# define COMPILER_ID "HP"
+  /* __HP_cc = VVRRPP */
+# define COMPILER_VERSION_MAJOR DEC(__HP_cc/10000)
+# define COMPILER_VERSION_MINOR DEC(__HP_cc/100 % 100)
+# define COMPILER_VERSION_PATCH DEC(__HP_cc     % 100)
+
+#elif defined(__DECC)
+# define COMPILER_ID "Compaq"
+  /* __DECC_VER = VVRRTPPPP */
+# define COMPILER_VERSION_MAJOR DEC(__DECC_VER/10000000)
+# define COMPILER_VERSION_MINOR DEC(__DECC_VER/100000  % 100)
+# define COMPILER_VERSION_PATCH DEC(__DECC_VER         % 10000)
+
+#elif defined(__IBMC__) && defined(__COMPILER_VER__)
+# define COMPILER_ID "zOS"
+  /* __IBMC__ = VRP */
+# define COMPILER_VERSION_MAJOR DEC(__IBMC__/100)
+# define COMPILER_VERSION_MINOR DEC(__IBMC__/10 % 10)
+# define COMPILER_VERSION_PATCH DEC(__IBMC__    % 10)
+
+#elif defined(__open_xl__) && defined(__clang__)
+# define COMPILER_ID "IBMClang"
+# define COMPILER_VERSION_MAJOR DEC(__open_xl_version__)
+# define COMPILER_VERSION_MINOR DEC(__open_xl_release__)
+# define COMPILER_VERSION_PATCH DEC(__open_xl_modification__)
+# define COMPILER_VERSION_TWEAK DEC(__open_xl_ptf_fix_level__)
+
+
+#elif defined(__ibmxl__) && defined(__clang__)
+# define COMPILER_ID "XLClang"
+# define COMPILER_VERSION_MAJOR DEC(__ibmxl_version__)
+# define COMPILER_VERSION_MINOR DEC(__ibmxl_release__)
+# define COMPILER_VERSION_PATCH DEC(__ibmxl_modification__)
+# define COMPILER_VERSION_TWEAK DEC(__ibmxl_ptf_fix_level__)
+
+
+#elif defined(__IBMC__) && !defined(__COMPILER_VER__) && __IBMC__ >= 800
+# define COMPILER_ID "XL"
+  /* __IBMC__ = VRP */
+# define COMPILER_VERSION_MAJOR DEC(__IBMC__/100)
+# define COMPILER_VERSION_MINOR DEC(__IBMC__/10 % 10)
+# define COMPILER_VERSION_PATCH DEC(__IBMC__    % 10)
+
+#elif defined(__IBMC__) && !defined(__COMPILER_VER__) && __IBMC__ < 800
+# define COMPILER_ID "VisualAge"
+  /* __IBMC__ = VRP */
+# define COMPILER_VERSION_MAJOR DEC(__IBMC__/100)
+# define COMPILER_VERSION_MINOR DEC(__IBMC__/10 % 10)
+# define COMPILER_VERSION_PATCH DEC(__IBMC__    % 10)
+
+#elif defined(__NVCOMPILER)
+# define COMPILER_ID "NVHPC"
+# define COMPILER_VERSION_MAJOR DEC(__NVCOMPILER_MAJOR__)
+# define COMPILER_VERSION_MINOR DEC(__NVCOMPILER_MINOR__)
+# if defined(__NVCOMPILER_PATCHLEVEL__)
+#  define COMPILER_VERSION_PATCH DEC(__NVCOMPILER_PATCHLEVEL__)
+# endif
+
+#elif defined(__PGI)
+# define COMPILER_ID "PGI"
+# define COMPILER_VERSION_MAJOR DEC(__PGIC__)
+# define COMPILER_VERSION_MINOR DEC(__PGIC_MINOR__)
+# if defined(__PGIC_PATCHLEVEL__)
+#  define COMPILER_VERSION_PATCH DEC(__PGIC_PATCHLEVEL__)
+# endif
+
+#elif defined(__clang__) && defined(__cray__)
+# define COMPILER_ID "CrayClang"
+# define COMPILER_VERSION_MAJOR DEC(__cray_major__)
+# define COMPILER_VERSION_MINOR DEC(__cray_minor__)
+# define COMPILER_VERSION_PATCH DEC(__cray_patchlevel__)
+# define COMPILER_VERSION_INTERNAL_STR __clang_version__
+
+
+#elif defined(_CRAYC)
+# define COMPILER_ID "Cray"
+# define COMPILER_VERSION_MAJOR DEC(_RELEASE_MAJOR)
+# define COMPILER_VERSION_MINOR DEC(_RELEASE_MINOR)
+
+#elif defined(__TI_COMPILER_VERSION__)
+# define COMPILER_ID "TI"
+  /* __TI_COMPILER_VERSION__ = VVVRRRPPP */
+# define COMPILER_VERSION_MAJOR DEC(__TI_COMPILER_VERSION__/1000000)
+# define COMPILER_VERSION_MINOR DEC(__TI_COMPILER_VERSION__/1000   % 1000)
+# define COMPILER_VERSION_PATCH DEC(__TI_COMPILER_VERSION__        % 1000)
+
+#elif defined(__CLANG_FUJITSU)
+# define COMPILER_ID "FujitsuClang"
+# define COMPILER_VERSION_MAJOR DEC(__FCC_major__)
+# define COMPILER_VERSION_MINOR DEC(__FCC_minor__)
+# define COMPILER_VERSION_PATCH DEC(__FCC_patchlevel__)
+# define COMPILER_VERSION_INTERNAL_STR __clang_version__
+
+
+#elif defined(__FUJITSU)
+# define COMPILER_ID "Fujitsu"
+# if defined(__FCC_version__)
+#   define COMPILER_VERSION __FCC_version__
+# elif defined(__FCC_major__)
+#   define COMPILER_VERSION_MAJOR DEC(__FCC_major__)
+#   define COMPILER_VERSION_MINOR DEC(__FCC_minor__)
+#   define COMPILER_VERSION_PATCH DEC(__FCC_patchlevel__)
+# endif
+# if defined(__fcc_version)
+#   define COMPILER_VERSION_INTERNAL DEC(__fcc_version)
+# elif defined(__FCC_VERSION)
+#   define COMPILER_VERSION_INTERNAL DEC(__FCC_VERSION)
+# endif
+
+
+#elif defined(__ghs__)
+# define COMPILER_ID "GHS"
+/* __GHS_VERSION_NUMBER = VVVVRP */
+# ifdef __GHS_VERSION_NUMBER
+# define COMPILER_VERSION_MAJOR DEC(__GHS_VERSION_NUMBER / 100)
+# define COMPILER_VERSION_MINOR DEC(__GHS_VERSION_NUMBER / 10 % 10)
+# define COMPILER_VERSION_PATCH DEC(__GHS_VERSION_NUMBER      % 10)
+# endif
+
+#elif defined(__TASKING__)
+# define COMPILER_ID "Tasking"
+  # define COMPILER_VERSION_MAJOR DEC(__VERSION__/1000)
+  # define COMPILER_VERSION_MINOR DEC(__VERSION__ % 100)
+# define COMPILER_VERSION_INTERNAL DEC(__VERSION__)
+
+#elif defined(__ORANGEC__)
+# define COMPILER_ID "OrangeC"
+# define COMPILER_VERSION_MAJOR DEC(__ORANGEC_MAJOR__)
+# define COMPILER_VERSION_MINOR DEC(__ORANGEC_MINOR__)
+# define COMPILER_VERSION_PATCH DEC(__ORANGEC_PATCHLEVEL__)
+
+#elif defined(__TINYC__)
+# define COMPILER_ID "TinyCC"
+
+#elif defined(__BCC__)
+# define COMPILER_ID "Bruce"
+
+#elif defined(__SCO_VERSION__)
+# define COMPILER_ID "SCO"
+
+#elif defined(__ARMCC_VERSION) && !defined(__clang__)
+# define COMPILER_ID "ARMCC"
+#if __ARMCC_VERSION >= 1000000
+  /* __ARMCC_VERSION = VRRPPPP */
+  # define COMPILER_VERSION_MAJOR DEC(__ARMCC_VERSION/1000000)
+  # define COMPILER_VERSION_MINOR DEC(__ARMCC_VERSION/10000 % 100)
+  # define COMPILER_VERSION_PATCH DEC(__ARMCC_VERSION     % 10000)
+#else
+  /* __ARMCC_VERSION = VRPPPP */
+  # define COMPILER_VERSION_MAJOR DEC(__ARMCC_VERSION/100000)
+  # define COMPILER_VERSION_MINOR DEC(__ARMCC_VERSION/10000 % 10)
+  # define COMPILER_VERSION_PATCH DEC(__ARMCC_VERSION    % 10000)
+#endif
+
+
+#elif defined(__clang__) && defined(__apple_build_version__)
+# define COMPILER_ID "AppleClang"
+# if defined(_MSC_VER)
+#  define SIMULATE_ID "MSVC"
+# endif
+# define COMPILER_VERSION_MAJOR DEC(__clang_major__)
+# define COMPILER_VERSION_MINOR DEC(__clang_minor__)
+# define COMPILER_VERSION_PATCH DEC(__clang_patchlevel__)
+# if defined(_MSC_VER)
+   /* _MSC_VER = VVRR */
+#  define SIMULATE_VERSION_MAJOR DEC(_MSC_VER / 100)
+#  define SIMULATE_VERSION_MINOR DEC(_MSC_VER % 100)
+# endif
+# define COMPILER_VERSION_TWEAK DEC(__apple_build_version__)
+
+#elif defined(__clang__) && defined(__ARMCOMPILER_VERSION)
+# define COMPILER_ID "ARMClang"
+  # define COMPILER_VERSION_MAJOR DEC(__ARMCOMPILER_VERSION/1000000)
+  # define COMPILER_VERSION_MINOR DEC(__ARMCOMPILER_VERSION/10000 % 100)
+  # define COMPILER_VERSION_PATCH DEC(__ARMCOMPILER_VERSION/100   % 100)
+# define COMPILER_VERSION_INTERNAL DEC(__ARMCOMPILER_VERSION)
+
+#elif defined(__clang__)
+# define COMPILER_ID "Clang"
+# if defined(_MSC_VER)
+#  define SIMULATE_ID "MSVC"
+# endif
+# define COMPILER_VERSION_MAJOR DEC(__clang_major__)
+# define COMPILER_VERSION_MINOR DEC(__clang_minor__)
+# define COMPILER_VERSION_PATCH DEC(__clang_patchlevel__)
+# if defined(_MSC_VER)
+   /* _MSC_VER = VVRR */
+#  define SIMULATE_VERSION_MAJOR DEC(_MSC_VER / 100)
+#  define SIMULATE_VERSION_MINOR DEC(_MSC_VER % 100)
+# endif
+
+#elif defined(__LCC__) && (defined(__GNUC__) || defined(__GNUG__) || defined(__MCST__))
+# define COMPILER_ID "LCC"
+# define COMPILER_VERSION_MAJOR DEC(__LCC__ / 100)
+# define COMPILER_VERSION_MINOR DEC(__LCC__ % 100)
+# if defined(__LCC_MINOR__)
+#  define COMPILER_VERSION_PATCH DEC(__LCC_MINOR__)
+# endif
+# if defined(__GNUC__) && defined(__GNUC_MINOR__)
+#  define SIMULATE_ID "GNU"
+#  define SIMULATE_VERSION_MAJOR DEC(__GNUC__)
+#  define SIMULATE_VERSION_MINOR DEC(__GNUC_MINOR__)
+#  if defined(__GNUC_PATCHLEVEL__)
+#   define SIMULATE_VERSION_PATCH DEC(__GNUC_PATCHLEVEL__)
+#  endif
+# endif
+
+#elif defined(__GNUC__)
+# define COMPILER_ID "GNU"
+# define COMPILER_VERSION_MAJOR DEC(__GNUC__)
+# if defined(__GNUC_MINOR__)
+#  define COMPILER_VERSION_MINOR DEC(__GNUC_MINOR__)
+# endif
+# if defined(__GNUC_PATCHLEVEL__)
+#  define COMPILER_VERSION_PATCH DEC(__GNUC_PATCHLEVEL__)
+# endif
+
+#elif defined(_MSC_VER)
+# define COMPILER_ID "MSVC"
+  /* _MSC_VER = VVRR */
+# define COMPILER_VERSION_MAJOR DEC(_MSC_VER / 100)
+# define COMPILER_VERSION_MINOR DEC(_MSC_VER % 100)
+# if defined(_MSC_FULL_VER)
+#  if _MSC_VER >= 1400
+    /* _MSC_FULL_VER = VVRRPPPPP */
+#   define COMPILER_VERSION_PATCH DEC(_MSC_FULL_VER % 100000)
+#  else
+    /* _MSC_FULL_VER = VVRRPPPP */
+#   define COMPILER_VERSION_PATCH DEC(_MSC_FULL_VER % 10000)
+#  endif
+# endif
+# if defined(_MSC_BUILD)
+#  define COMPILER_VERSION_TWEAK DEC(_MSC_BUILD)
+# endif
+
+#elif defined(_ADI_COMPILER)
+# define COMPILER_ID "ADSP"
+#if defined(__VERSIONNUM__)
+  /* __VERSIONNUM__ = 0xVVRRPPTT */
+#  define COMPILER_VERSION_MAJOR DEC(__VERSIONNUM__ >> 24 & 0xFF)
+#  define COMPILER_VERSION_MINOR DEC(__VERSIONNUM__ >> 16 & 0xFF)
+#  define COMPILER_VERSION_PATCH DEC(__VERSIONNUM__ >> 8 & 0xFF)
+#  define COMPILER_VERSION_TWEAK DEC(__VERSIONNUM__ & 0xFF)
+#endif
+
+#elif defined(__IAR_SYSTEMS_ICC__) || defined(__IAR_SYSTEMS_ICC)
+# define COMPILER_ID "IAR"
+# if defined(__VER__) && defined(__ICCARM__)
+#  define COMPILER_VERSION_MAJOR DEC((__VER__) / 1000000)
+#  define COMPILER_VERSION_MINOR DEC(((__VER__) / 1000) % 1000)
+#  define COMPILER_VERSION_PATCH DEC((__VER__) % 1000)
+#  define COMPILER_VERSION_INTERNAL DEC(__IAR_SYSTEMS_ICC__)
+# elif defined(__VER__) && (defined(__ICCAVR__) || defined(__ICCRX__) || defined(__ICCRH850__) || defined(__ICCRL78__) || defined(__ICC430__) || defined(__ICCRISCV__) || defined(__ICCV850__) || defined(__ICC8051__) || defined(__ICCSTM8__))
+#  define COMPILER_VERSION_MAJOR DEC((__VER__) / 100)
+#  define COMPILER_VERSION_MINOR DEC((__VER__) - (((__VER__) / 100)*100))
+#  define COMPILER_VERSION_PATCH DEC(__SUBVERSION__)
+#  define COMPILER_VERSION_INTERNAL DEC(__IAR_SYSTEMS_ICC__)
+# endif
+
+#elif defined(__SDCC_VERSION_MAJOR) || defined(SDCC)
+# define COMPILER_ID "SDCC"
+# if defined(__SDCC_VERSION_MAJOR)
+#  define COMPILER_VERSION_MAJOR DEC(__SDCC_VERSION_MAJOR)
+#  define COMPILER_VERSION_MINOR DEC(__SDCC_VERSION_MINOR)
+#  define COMPILER_VERSION_PATCH DEC(__SDCC_VERSION_PATCH)
+# else
+  /* SDCC = VRP */
+#  define COMPILER_VERSION_MAJOR DEC(SDCC/100)
+#  define COMPILER_VERSION_MINOR DEC(SDCC/10 % 10)
+#  define COMPILER_VERSION_PATCH DEC(SDCC    % 10)
+# endif
+
+
+/* These compilers are either not known or too old to define an
+  identification macro.  Try to identify the platform and guess that
+  it is the native compiler.  */
+#elif defined(__hpux) || defined(__hpua)
+# define COMPILER_ID "HP"
+
+#else /* unknown compiler */
+# define COMPILER_ID ""
+#endif
+
+/* Construct the string literal in pieces to prevent the source from
+   getting matched.  Store it in a pointer rather than an array
+   because some compilers will just produce instructions to fill the
+   array rather than assigning a pointer to a static array.  */
+char const* info_compiler = "INFO" ":" "compiler[" COMPILER_ID "]";
+#ifdef SIMULATE_ID
+char const* info_simulate = "INFO" ":" "simulate[" SIMULATE_ID "]";
+#endif
+
+#ifdef __QNXNTO__
+char const* qnxnto = "INFO" ":" "qnxnto[]";
+#endif
+
+#if defined(__CRAYXT_COMPUTE_LINUX_TARGET)
+char const *info_cray = "INFO" ":" "compiler_wrapper[CrayPrgEnv]";
+#endif
+
+#define STRINGIFY_HELPER(X) #X
+#define STRINGIFY(X) STRINGIFY_HELPER(X)
+
+/* Identify known platforms by name.  */
+#if defined(__linux) || defined(__linux__) || defined(linux)
+# define PLATFORM_ID "Linux"
+
+#elif defined(__MSYS__)
+# define PLATFORM_ID "MSYS"
+
+#elif defined(__CYGWIN__)
+# define PLATFORM_ID "Cygwin"
+
+#elif defined(__MINGW32__)
+# define PLATFORM_ID "MinGW"
+
+#elif defined(__APPLE__)
+# define PLATFORM_ID "Darwin"
+
+#elif defined(_WIN32) || defined(__WIN32__) || defined(WIN32)
+# define PLATFORM_ID "Windows"
+
+#elif defined(__FreeBSD__) || defined(__FreeBSD)
+# define PLATFORM_ID "FreeBSD"
+
+#elif defined(__NetBSD__) || defined(__NetBSD)
+# define PLATFORM_ID "NetBSD"
+
+#elif defined(__OpenBSD__) || defined(__OPENBSD)
+# define PLATFORM_ID "OpenBSD"
+
+#elif defined(__sun) || defined(sun)
+# define PLATFORM_ID "SunOS"
+
+#elif defined(_AIX) || defined(__AIX) || defined(__AIX__) || defined(__aix) || defined(__aix__)
+# define PLATFORM_ID "AIX"
+
+#elif defined(__hpux) || defined(__hpux__)
+# define PLATFORM_ID "HP-UX"
+
+#elif defined(__HAIKU__)
+# define PLATFORM_ID "Haiku"
+
+#elif defined(__BeOS) || defined(__BEOS__) || defined(_BEOS)
+# define PLATFORM_ID "BeOS"
+
+#elif defined(__QNX__) || defined(__QNXNTO__)
+# define PLATFORM_ID "QNX"
+
+#elif defined(__tru64) || defined(_tru64) || defined(__TRU64__)
+# define PLATFORM_ID "Tru64"
+
+#elif defined(__riscos) || defined(__riscos__)
+# define PLATFORM_ID "RISCos"
+
+#elif defined(__sinix) || defined(__sinix__) || defined(__SINIX__)
+# define PLATFORM_ID "SINIX"
+
+#elif defined(__UNIX_SV__)
+# define PLATFORM_ID "UNIX_SV"
+
+#elif defined(__bsdos__)
+# define PLATFORM_ID "BSDOS"
+
+#elif defined(_MPRAS) || defined(MPRAS)
+# define PLATFORM_ID "MP-RAS"
+
+#elif defined(__osf) || defined(__osf__)
+# define PLATFORM_ID "OSF1"
+
+#elif defined(_SCO_SV) || defined(SCO_SV) || defined(sco_sv)
+# define PLATFORM_ID "SCO_SV"
+
+#elif defined(__ultrix) || defined(__ultrix__) || defined(_ULTRIX)
+# define PLATFORM_ID "ULTRIX"
+
+#elif defined(__XENIX__) || defined(_XENIX) || defined(XENIX)
+# define PLATFORM_ID "Xenix"
+
+#elif defined(__WATCOMC__)
+# if defined(__LINUX__)
+#  define PLATFORM_ID "Linux"
+
+# elif defined(__DOS__)
+#  define PLATFORM_ID "DOS"
+
+# elif defined(__OS2__)
+#  define PLATFORM_ID "OS2"
+
+# elif defined(__WINDOWS__)
+#  define PLATFORM_ID "Windows3x"
+
+# elif defined(__VXWORKS__)
+#  define PLATFORM_ID "VxWorks"
+
+# else /* unknown platform */
+#  define PLATFORM_ID
+# endif
+
+#elif defined(__INTEGRITY)
+# if defined(INT_178B)
+#  define PLATFORM_ID "Integrity178"
+
+# else /* regular Integrity */
+#  define PLATFORM_ID "Integrity"
+# endif
+
+# elif defined(_ADI_COMPILER)
+#  define PLATFORM_ID "ADSP"
+
+#else /* unknown platform */
+# define PLATFORM_ID
+
+#endif
+
+/* For windows compilers MSVC and Intel we can determine
+   the architecture of the compiler being used.  This is because
+   the compilers do not have flags that can change the architecture,
+   but rather depend on which compiler is being used
+*/
+#if defined(_WIN32) && defined(_MSC_VER)
+# if defined(_M_IA64)
+#  define ARCHITECTURE_ID "IA64"
+
+# elif defined(_M_ARM64EC)
+#  define ARCHITECTURE_ID "ARM64EC"
+
+# elif defined(_M_X64) || defined(_M_AMD64)
+#  define ARCHITECTURE_ID "x64"
+
+# elif defined(_M_IX86)
+#  define ARCHITECTURE_ID "X86"
+
+# elif defined(_M_ARM64)
+#  define ARCHITECTURE_ID "ARM64"
+
+# elif defined(_M_ARM)
+#  if _M_ARM == 4
+#   define ARCHITECTURE_ID "ARMV4I"
+#  elif _M_ARM == 5
+#   define ARCHITECTURE_ID "ARMV5I"
+#  else
+#   define ARCHITECTURE_ID "ARMV" STRINGIFY(_M_ARM)
+#  endif
+
+# elif defined(_M_MIPS)
+#  define ARCHITECTURE_ID "MIPS"
+
+# elif defined(_M_SH)
+#  define ARCHITECTURE_ID "SHx"
+
+# else /* unknown architecture */
+#  define ARCHITECTURE_ID ""
+# endif
+
+#elif defined(__WATCOMC__)
+# if defined(_M_I86)
+#  define ARCHITECTURE_ID "I86"
+
+# elif defined(_M_IX86)
+#  define ARCHITECTURE_ID "X86"
+
+# else /* unknown architecture */
+#  define ARCHITECTURE_ID ""
+# endif
+
+#elif defined(__IAR_SYSTEMS_ICC__) || defined(__IAR_SYSTEMS_ICC)
+# if defined(__ICCARM__)
+#  define ARCHITECTURE_ID "ARM"
+
+# elif defined(__ICCRX__)
+#  define ARCHITECTURE_ID "RX"
+
+# elif defined(__ICCRH850__)
+#  define ARCHITECTURE_ID "RH850"
+
+# elif defined(__ICCRL78__)
+#  define ARCHITECTURE_ID "RL78"
+
+# elif defined(__ICCRISCV__)
+#  define ARCHITECTURE_ID "RISCV"
+
+# elif defined(__ICCAVR__)
+#  define ARCHITECTURE_ID "AVR"
+
+# elif defined(__ICC430__)
+#  define ARCHITECTURE_ID "MSP430"
+
+# elif defined(__ICCV850__)
+#  define ARCHITECTURE_ID "V850"
+
+# elif defined(__ICC8051__)
+#  define ARCHITECTURE_ID "8051"
+
+# elif defined(__ICCSTM8__)
+#  define ARCHITECTURE_ID "STM8"
+
+# else /* unknown architecture */
+#  define ARCHITECTURE_ID ""
+# endif
+
+#elif defined(__ghs__)
+# if defined(__PPC64__)
+#  define ARCHITECTURE_ID "PPC64"
+
+# elif defined(__ppc__)
+#  define ARCHITECTURE_ID "PPC"
+
+# elif defined(__ARM__)
+#  define ARCHITECTURE_ID "ARM"
+
+# elif defined(__x86_64__)
+#  define ARCHITECTURE_ID "x64"
+
+# elif defined(__i386__)
+#  define ARCHITECTURE_ID "X86"
+
+# else /* unknown architecture */
+#  define ARCHITECTURE_ID ""
+# endif
+
+#elif defined(__TI_COMPILER_VERSION__)
+# if defined(__TI_ARM__)
+#  define ARCHITECTURE_ID "ARM"
+
+# elif defined(__MSP430__)
+#  define ARCHITECTURE_ID "MSP430"
+
+# elif defined(__TMS320C28XX__)
+#  define ARCHITECTURE_ID "TMS320C28x"
+
+# elif defined(__TMS320C6X__) || defined(_TMS320C6X)
+#  define ARCHITECTURE_ID "TMS320C6x"
+
+# else /* unknown architecture */
+#  define ARCHITECTURE_ID ""
+# endif
+
+# elif defined(__ADSPSHARC__)
+#  define ARCHITECTURE_ID "SHARC"
+
+# elif defined(__ADSPBLACKFIN__)
+#  define ARCHITECTURE_ID "Blackfin"
+
+#elif defined(__TASKING__)
+
+# if defined(__CTC__) || defined(__CPTC__)
+#  define ARCHITECTURE_ID "TriCore"
+
+# elif defined(__CMCS__)
+#  define ARCHITECTURE_ID "MCS"
+
+# elif defined(__CARM__)
+#  define ARCHITECTURE_ID "ARM"
+
+# elif defined(__CARC__)
+#  define ARCHITECTURE_ID "ARC"
+
+# elif defined(__C51__)
+#  define ARCHITECTURE_ID "8051"
+
+# elif defined(__CPCP__)
+#  define ARCHITECTURE_ID "PCP"
+
+# else
+#  define ARCHITECTURE_ID ""
+# endif
+
+#else
+#  define ARCHITECTURE_ID
+#endif
+
+/* Convert integer to decimal digit literals.  */
+#define DEC(n)                   \
+  ('0' + (((n) / 10000000)%10)), \
+  ('0' + (((n) / 1000000)%10)),  \
+  ('0' + (((n) / 100000)%10)),   \
+  ('0' + (((n) / 10000)%10)),    \
+  ('0' + (((n) / 1000)%10)),     \
+  ('0' + (((n) / 100)%10)),      \
+  ('0' + (((n) / 10)%10)),       \
+  ('0' +  ((n) % 10))
+
+/* Convert integer to hex digit literals.  */
+#define HEX(n)             \
+  ('0' + ((n)>>28 & 0xF)), \
+  ('0' + ((n)>>24 & 0xF)), \
+  ('0' + ((n)>>20 & 0xF)), \
+  ('0' + ((n)>>16 & 0xF)), \
+  ('0' + ((n)>>12 & 0xF)), \
+  ('0' + ((n)>>8  & 0xF)), \
+  ('0' + ((n)>>4  & 0xF)), \
+  ('0' + ((n)     & 0xF))
+
+/* Construct a string literal encoding the version number. */
+#ifdef COMPILER_VERSION
+char const* info_version = "INFO" ":" "compiler_version[" COMPILER_VERSION "]";
+
+/* Construct a string literal encoding the version number components. */
+#elif defined(COMPILER_VERSION_MAJOR)
+char const info_version[] = {
+  'I', 'N', 'F', 'O', ':',
+  'c','o','m','p','i','l','e','r','_','v','e','r','s','i','o','n','[',
+  COMPILER_VERSION_MAJOR,
+# ifdef COMPILER_VERSION_MINOR
+  '.', COMPILER_VERSION_MINOR,
+#  ifdef COMPILER_VERSION_PATCH
+   '.', COMPILER_VERSION_PATCH,
+#   ifdef COMPILER_VERSION_TWEAK
+    '.', COMPILER_VERSION_TWEAK,
+#   endif
+#  endif
+# endif
+  ']','\0'};
+#endif
+
+/* Construct a string literal encoding the internal version number. */
+#ifdef COMPILER_VERSION_INTERNAL
+char const info_version_internal[] = {
+  'I', 'N', 'F', 'O', ':',
+  'c','o','m','p','i','l','e','r','_','v','e','r','s','i','o','n','_',
+  'i','n','t','e','r','n','a','l','[',
+  COMPILER_VERSION_INTERNAL,']','\0'};
+#elif defined(COMPILER_VERSION_INTERNAL_STR)
+char const* info_version_internal = "INFO" ":" "compiler_version_internal[" COMPILER_VERSION_INTERNAL_STR "]";
+#endif
+
+/* Construct a string literal encoding the version number components. */
+#ifdef SIMULATE_VERSION_MAJOR
+char const info_simulate_version[] = {
+  'I', 'N', 'F', 'O', ':',
+  's','i','m','u','l','a','t','e','_','v','e','r','s','i','o','n','[',
+  SIMULATE_VERSION_MAJOR,
+# ifdef SIMULATE_VERSION_MINOR
+  '.', SIMULATE_VERSION_MINOR,
+#  ifdef SIMULATE_VERSION_PATCH
+   '.', SIMULATE_VERSION_PATCH,
+#   ifdef SIMULATE_VERSION_TWEAK
+    '.', SIMULATE_VERSION_TWEAK,
+#   endif
+#  endif
+# endif
+  ']','\0'};
+#endif
+
+/* Construct the string literal in pieces to prevent the source from
+   getting matched.  Store it in a pointer rather than an array
+   because some compilers will just produce instructions to fill the
+   array rather than assigning a pointer to a static array.  */
+char const* info_platform = "INFO" ":" "platform[" PLATFORM_ID "]";
+char const* info_arch = "INFO" ":" "arch[" ARCHITECTURE_ID "]";
+
+
+
+#if !defined(__STDC__) && !defined(__clang__)
+# if defined(_MSC_VER) || defined(__ibmxl__) || defined(__IBMC__)
+#  define C_VERSION "90"
+# else
+#  define C_VERSION
+# endif
+#elif __STDC_VERSION__ > 201710L
+# define C_VERSION "23"
+#elif __STDC_VERSION__ >= 201710L
+# define C_VERSION "17"
+#elif __STDC_VERSION__ >= 201000L
+# define C_VERSION "11"
+#elif __STDC_VERSION__ >= 199901L
+# define C_VERSION "99"
+#else
+# define C_VERSION "90"
+#endif
+const char* info_language_standard_default =
+  "INFO" ":" "standard_default[" C_VERSION "]";
+
+const char* info_language_extensions_default = "INFO" ":" "extensions_default["
+#if (defined(__clang__) || defined(__GNUC__) || defined(__xlC__) ||           \
+     defined(__TI_COMPILER_VERSION__)) &&                                     \
+  !defined(__STRICT_ANSI__)
+  "ON"
+#else
+  "OFF"
+#endif
+"]";
+
+/*--------------------------------------------------------------------------*/
+
+#ifdef ID_VOID_MAIN
+void main() {}
+#else
+# if defined(__CLASSIC_C__)
+int main(argc, argv) int argc; char *argv[];
+# else
+int main(int argc, char* argv[])
+# endif
+{
+  int require = 0;
+  require += info_compiler[argc];
+  require += info_platform[argc];
+  require += info_arch[argc];
+#ifdef COMPILER_VERSION_MAJOR
+  require += info_version[argc];
+#endif
+#ifdef COMPILER_VERSION_INTERNAL
+  require += info_version_internal[argc];
+#endif
+#ifdef SIMULATE_ID
+  require += info_simulate[argc];
+#endif
+#ifdef SIMULATE_VERSION_MAJOR
+  require += info_simulate_version[argc];
+#endif
+#if defined(__CRAYXT_COMPUTE_LINUX_TARGET)
+  require += info_cray[argc];
+#endif
+  require += info_language_standard_default[argc];
+  require += info_language_extensions_default[argc];
+  (void)argv;
+  return require;
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/3.28.2/CompilerIdC/a.exe b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/3.28.2/CompilerIdC/a.exe
new file mode 100644
index 0000000..f50e503
Binary files /dev/null and b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/3.28.2/CompilerIdC/a.exe differ
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/3.28.2/CompilerIdCXX/CMakeCXXCompilerId.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/3.28.2/CompilerIdCXX/CMakeCXXCompilerId.cpp
new file mode 100644
index 0000000..cd19514
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/3.28.2/CompilerIdCXX/CMakeCXXCompilerId.cpp
@@ -0,0 +1,869 @@
+/* This source file must have a .cpp extension so that all C++ compilers
+   recognize the extension without flags.  Borland does not know .cxx for
+   example.  */
+#ifndef __cplusplus
+# error "A C compiler has been selected for C++."
+#endif
+
+#if !defined(__has_include)
+/* If the compiler does not have __has_include, pretend the answer is
+   always no.  */
+#  define __has_include(x) 0
+#endif
+
+
+/* Version number components: V=Version, R=Revision, P=Patch
+   Version date components:   YYYY=Year, MM=Month,   DD=Day  */
+
+#if defined(__COMO__)
+# define COMPILER_ID "Comeau"
+  /* __COMO_VERSION__ = VRR */
+# define COMPILER_VERSION_MAJOR DEC(__COMO_VERSION__ / 100)
+# define COMPILER_VERSION_MINOR DEC(__COMO_VERSION__ % 100)
+
+#elif defined(__INTEL_COMPILER) || defined(__ICC)
+# define COMPILER_ID "Intel"
+# if defined(_MSC_VER)
+#  define SIMULATE_ID "MSVC"
+# endif
+# if defined(__GNUC__)
+#  define SIMULATE_ID "GNU"
+# endif
+  /* __INTEL_COMPILER = VRP prior to 2021, and then VVVV for 2021 and later,
+     except that a few beta releases use the old format with V=2021.  */
+# if __INTEL_COMPILER < 2021 || __INTEL_COMPILER == 202110 || __INTEL_COMPILER == 202111
+#  define COMPILER_VERSION_MAJOR DEC(__INTEL_COMPILER/100)
+#  define COMPILER_VERSION_MINOR DEC(__INTEL_COMPILER/10 % 10)
+#  if defined(__INTEL_COMPILER_UPDATE)
+#   define COMPILER_VERSION_PATCH DEC(__INTEL_COMPILER_UPDATE)
+#  else
+#   define COMPILER_VERSION_PATCH DEC(__INTEL_COMPILER   % 10)
+#  endif
+# else
+#  define COMPILER_VERSION_MAJOR DEC(__INTEL_COMPILER)
+#  define COMPILER_VERSION_MINOR DEC(__INTEL_COMPILER_UPDATE)
+   /* The third version component from --version is an update index,
+      but no macro is provided for it.  */
+#  define COMPILER_VERSION_PATCH DEC(0)
+# endif
+# if defined(__INTEL_COMPILER_BUILD_DATE)
+   /* __INTEL_COMPILER_BUILD_DATE = YYYYMMDD */
+#  define COMPILER_VERSION_TWEAK DEC(__INTEL_COMPILER_BUILD_DATE)
+# endif
+# if defined(_MSC_VER)
+   /* _MSC_VER = VVRR */
+#  define SIMULATE_VERSION_MAJOR DEC(_MSC_VER / 100)
+#  define SIMULATE_VERSION_MINOR DEC(_MSC_VER % 100)
+# endif
+# if defined(__GNUC__)
+#  define SIMULATE_VERSION_MAJOR DEC(__GNUC__)
+# elif defined(__GNUG__)
+#  define SIMULATE_VERSION_MAJOR DEC(__GNUG__)
+# endif
+# if defined(__GNUC_MINOR__)
+#  define SIMULATE_VERSION_MINOR DEC(__GNUC_MINOR__)
+# endif
+# if defined(__GNUC_PATCHLEVEL__)
+#  define SIMULATE_VERSION_PATCH DEC(__GNUC_PATCHLEVEL__)
+# endif
+
+#elif (defined(__clang__) && defined(__INTEL_CLANG_COMPILER)) || defined(__INTEL_LLVM_COMPILER)
+# define COMPILER_ID "IntelLLVM"
+#if defined(_MSC_VER)
+# define SIMULATE_ID "MSVC"
+#endif
+#if defined(__GNUC__)
+# define SIMULATE_ID "GNU"
+#endif
+/* __INTEL_LLVM_COMPILER = VVVVRP prior to 2021.2.0, VVVVRRPP for 2021.2.0 and
+ * later.  Look for 6 digit vs. 8 digit version number to decide encoding.
+ * VVVV is no smaller than the current year when a version is released.
+ */
+#if __INTEL_LLVM_COMPILER < 1000000L
+# define COMPILER_VERSION_MAJOR DEC(__INTEL_LLVM_COMPILER/100)
+# define COMPILER_VERSION_MINOR DEC(__INTEL_LLVM_COMPILER/10 % 10)
+# define COMPILER_VERSION_PATCH DEC(__INTEL_LLVM_COMPILER    % 10)
+#else
+# define COMPILER_VERSION_MAJOR DEC(__INTEL_LLVM_COMPILER/10000)
+# define COMPILER_VERSION_MINOR DEC(__INTEL_LLVM_COMPILER/100 % 100)
+# define COMPILER_VERSION_PATCH DEC(__INTEL_LLVM_COMPILER     % 100)
+#endif
+#if defined(_MSC_VER)
+  /* _MSC_VER = VVRR */
+# define SIMULATE_VERSION_MAJOR DEC(_MSC_VER / 100)
+# define SIMULATE_VERSION_MINOR DEC(_MSC_VER % 100)
+#endif
+#if defined(__GNUC__)
+# define SIMULATE_VERSION_MAJOR DEC(__GNUC__)
+#elif defined(__GNUG__)
+# define SIMULATE_VERSION_MAJOR DEC(__GNUG__)
+#endif
+#if defined(__GNUC_MINOR__)
+# define SIMULATE_VERSION_MINOR DEC(__GNUC_MINOR__)
+#endif
+#if defined(__GNUC_PATCHLEVEL__)
+# define SIMULATE_VERSION_PATCH DEC(__GNUC_PATCHLEVEL__)
+#endif
+
+#elif defined(__PATHCC__)
+# define COMPILER_ID "PathScale"
+# define COMPILER_VERSION_MAJOR DEC(__PATHCC__)
+# define COMPILER_VERSION_MINOR DEC(__PATHCC_MINOR__)
+# if defined(__PATHCC_PATCHLEVEL__)
+#  define COMPILER_VERSION_PATCH DEC(__PATHCC_PATCHLEVEL__)
+# endif
+
+#elif defined(__BORLANDC__) && defined(__CODEGEARC_VERSION__)
+# define COMPILER_ID "Embarcadero"
+# define COMPILER_VERSION_MAJOR HEX(__CODEGEARC_VERSION__>>24 & 0x00FF)
+# define COMPILER_VERSION_MINOR HEX(__CODEGEARC_VERSION__>>16 & 0x00FF)
+# define COMPILER_VERSION_PATCH DEC(__CODEGEARC_VERSION__     & 0xFFFF)
+
+#elif defined(__BORLANDC__)
+# define COMPILER_ID "Borland"
+  /* __BORLANDC__ = 0xVRR */
+# define COMPILER_VERSION_MAJOR HEX(__BORLANDC__>>8)
+# define COMPILER_VERSION_MINOR HEX(__BORLANDC__ & 0xFF)
+
+#elif defined(__WATCOMC__) && __WATCOMC__ < 1200
+# define COMPILER_ID "Watcom"
+   /* __WATCOMC__ = VVRR */
+# define COMPILER_VERSION_MAJOR DEC(__WATCOMC__ / 100)
+# define COMPILER_VERSION_MINOR DEC((__WATCOMC__ / 10) % 10)
+# if (__WATCOMC__ % 10) > 0
+#  define COMPILER_VERSION_PATCH DEC(__WATCOMC__ % 10)
+# endif
+
+#elif defined(__WATCOMC__)
+# define COMPILER_ID "OpenWatcom"
+   /* __WATCOMC__ = VVRP + 1100 */
+# define COMPILER_VERSION_MAJOR DEC((__WATCOMC__ - 1100) / 100)
+# define COMPILER_VERSION_MINOR DEC((__WATCOMC__ / 10) % 10)
+# if (__WATCOMC__ % 10) > 0
+#  define COMPILER_VERSION_PATCH DEC(__WATCOMC__ % 10)
+# endif
+
+#elif defined(__SUNPRO_CC)
+# define COMPILER_ID "SunPro"
+# if __SUNPRO_CC >= 0x5100
+   /* __SUNPRO_CC = 0xVRRP */
+#  define COMPILER_VERSION_MAJOR HEX(__SUNPRO_CC>>12)
+#  define COMPILER_VERSION_MINOR HEX(__SUNPRO_CC>>4 & 0xFF)
+#  define COMPILER_VERSION_PATCH HEX(__SUNPRO_CC    & 0xF)
+# else
+   /* __SUNPRO_CC = 0xVRP */
+#  define COMPILER_VERSION_MAJOR HEX(__SUNPRO_CC>>8)
+#  define COMPILER_VERSION_MINOR HEX(__SUNPRO_CC>>4 & 0xF)
+#  define COMPILER_VERSION_PATCH HEX(__SUNPRO_CC    & 0xF)
+# endif
+
+#elif defined(__HP_aCC)
+# define COMPILER_ID "HP"
+  /* __HP_aCC = VVRRPP */
+# define COMPILER_VERSION_MAJOR DEC(__HP_aCC/10000)
+# define COMPILER_VERSION_MINOR DEC(__HP_aCC/100 % 100)
+# define COMPILER_VERSION_PATCH DEC(__HP_aCC     % 100)
+
+#elif defined(__DECCXX)
+# define COMPILER_ID "Compaq"
+  /* __DECCXX_VER = VVRRTPPPP */
+# define COMPILER_VERSION_MAJOR DEC(__DECCXX_VER/10000000)
+# define COMPILER_VERSION_MINOR DEC(__DECCXX_VER/100000  % 100)
+# define COMPILER_VERSION_PATCH DEC(__DECCXX_VER         % 10000)
+
+#elif defined(__IBMCPP__) && defined(__COMPILER_VER__)
+# define COMPILER_ID "zOS"
+  /* __IBMCPP__ = VRP */
+# define COMPILER_VERSION_MAJOR DEC(__IBMCPP__/100)
+# define COMPILER_VERSION_MINOR DEC(__IBMCPP__/10 % 10)
+# define COMPILER_VERSION_PATCH DEC(__IBMCPP__    % 10)
+
+#elif defined(__open_xl__) && defined(__clang__)
+# define COMPILER_ID "IBMClang"
+# define COMPILER_VERSION_MAJOR DEC(__open_xl_version__)
+# define COMPILER_VERSION_MINOR DEC(__open_xl_release__)
+# define COMPILER_VERSION_PATCH DEC(__open_xl_modification__)
+# define COMPILER_VERSION_TWEAK DEC(__open_xl_ptf_fix_level__)
+
+
+#elif defined(__ibmxl__) && defined(__clang__)
+# define COMPILER_ID "XLClang"
+# define COMPILER_VERSION_MAJOR DEC(__ibmxl_version__)
+# define COMPILER_VERSION_MINOR DEC(__ibmxl_release__)
+# define COMPILER_VERSION_PATCH DEC(__ibmxl_modification__)
+# define COMPILER_VERSION_TWEAK DEC(__ibmxl_ptf_fix_level__)
+
+
+#elif defined(__IBMCPP__) && !defined(__COMPILER_VER__) && __IBMCPP__ >= 800
+# define COMPILER_ID "XL"
+  /* __IBMCPP__ = VRP */
+# define COMPILER_VERSION_MAJOR DEC(__IBMCPP__/100)
+# define COMPILER_VERSION_MINOR DEC(__IBMCPP__/10 % 10)
+# define COMPILER_VERSION_PATCH DEC(__IBMCPP__    % 10)
+
+#elif defined(__IBMCPP__) && !defined(__COMPILER_VER__) && __IBMCPP__ < 800
+# define COMPILER_ID "VisualAge"
+  /* __IBMCPP__ = VRP */
+# define COMPILER_VERSION_MAJOR DEC(__IBMCPP__/100)
+# define COMPILER_VERSION_MINOR DEC(__IBMCPP__/10 % 10)
+# define COMPILER_VERSION_PATCH DEC(__IBMCPP__    % 10)
+
+#elif defined(__NVCOMPILER)
+# define COMPILER_ID "NVHPC"
+# define COMPILER_VERSION_MAJOR DEC(__NVCOMPILER_MAJOR__)
+# define COMPILER_VERSION_MINOR DEC(__NVCOMPILER_MINOR__)
+# if defined(__NVCOMPILER_PATCHLEVEL__)
+#  define COMPILER_VERSION_PATCH DEC(__NVCOMPILER_PATCHLEVEL__)
+# endif
+
+#elif defined(__PGI)
+# define COMPILER_ID "PGI"
+# define COMPILER_VERSION_MAJOR DEC(__PGIC__)
+# define COMPILER_VERSION_MINOR DEC(__PGIC_MINOR__)
+# if defined(__PGIC_PATCHLEVEL__)
+#  define COMPILER_VERSION_PATCH DEC(__PGIC_PATCHLEVEL__)
+# endif
+
+#elif defined(__clang__) && defined(__cray__)
+# define COMPILER_ID "CrayClang"
+# define COMPILER_VERSION_MAJOR DEC(__cray_major__)
+# define COMPILER_VERSION_MINOR DEC(__cray_minor__)
+# define COMPILER_VERSION_PATCH DEC(__cray_patchlevel__)
+# define COMPILER_VERSION_INTERNAL_STR __clang_version__
+
+
+#elif defined(_CRAYC)
+# define COMPILER_ID "Cray"
+# define COMPILER_VERSION_MAJOR DEC(_RELEASE_MAJOR)
+# define COMPILER_VERSION_MINOR DEC(_RELEASE_MINOR)
+
+#elif defined(__TI_COMPILER_VERSION__)
+# define COMPILER_ID "TI"
+  /* __TI_COMPILER_VERSION__ = VVVRRRPPP */
+# define COMPILER_VERSION_MAJOR DEC(__TI_COMPILER_VERSION__/1000000)
+# define COMPILER_VERSION_MINOR DEC(__TI_COMPILER_VERSION__/1000   % 1000)
+# define COMPILER_VERSION_PATCH DEC(__TI_COMPILER_VERSION__        % 1000)
+
+#elif defined(__CLANG_FUJITSU)
+# define COMPILER_ID "FujitsuClang"
+# define COMPILER_VERSION_MAJOR DEC(__FCC_major__)
+# define COMPILER_VERSION_MINOR DEC(__FCC_minor__)
+# define COMPILER_VERSION_PATCH DEC(__FCC_patchlevel__)
+# define COMPILER_VERSION_INTERNAL_STR __clang_version__
+
+
+#elif defined(__FUJITSU)
+# define COMPILER_ID "Fujitsu"
+# if defined(__FCC_version__)
+#   define COMPILER_VERSION __FCC_version__
+# elif defined(__FCC_major__)
+#   define COMPILER_VERSION_MAJOR DEC(__FCC_major__)
+#   define COMPILER_VERSION_MINOR DEC(__FCC_minor__)
+#   define COMPILER_VERSION_PATCH DEC(__FCC_patchlevel__)
+# endif
+# if defined(__fcc_version)
+#   define COMPILER_VERSION_INTERNAL DEC(__fcc_version)
+# elif defined(__FCC_VERSION)
+#   define COMPILER_VERSION_INTERNAL DEC(__FCC_VERSION)
+# endif
+
+
+#elif defined(__ghs__)
+# define COMPILER_ID "GHS"
+/* __GHS_VERSION_NUMBER = VVVVRP */
+# ifdef __GHS_VERSION_NUMBER
+# define COMPILER_VERSION_MAJOR DEC(__GHS_VERSION_NUMBER / 100)
+# define COMPILER_VERSION_MINOR DEC(__GHS_VERSION_NUMBER / 10 % 10)
+# define COMPILER_VERSION_PATCH DEC(__GHS_VERSION_NUMBER      % 10)
+# endif
+
+#elif defined(__TASKING__)
+# define COMPILER_ID "Tasking"
+  # define COMPILER_VERSION_MAJOR DEC(__VERSION__/1000)
+  # define COMPILER_VERSION_MINOR DEC(__VERSION__ % 100)
+# define COMPILER_VERSION_INTERNAL DEC(__VERSION__)
+
+#elif defined(__ORANGEC__)
+# define COMPILER_ID "OrangeC"
+# define COMPILER_VERSION_MAJOR DEC(__ORANGEC_MAJOR__)
+# define COMPILER_VERSION_MINOR DEC(__ORANGEC_MINOR__)
+# define COMPILER_VERSION_PATCH DEC(__ORANGEC_PATCHLEVEL__)
+
+#elif defined(__SCO_VERSION__)
+# define COMPILER_ID "SCO"
+
+#elif defined(__ARMCC_VERSION) && !defined(__clang__)
+# define COMPILER_ID "ARMCC"
+#if __ARMCC_VERSION >= 1000000
+  /* __ARMCC_VERSION = VRRPPPP */
+  # define COMPILER_VERSION_MAJOR DEC(__ARMCC_VERSION/1000000)
+  # define COMPILER_VERSION_MINOR DEC(__ARMCC_VERSION/10000 % 100)
+  # define COMPILER_VERSION_PATCH DEC(__ARMCC_VERSION     % 10000)
+#else
+  /* __ARMCC_VERSION = VRPPPP */
+  # define COMPILER_VERSION_MAJOR DEC(__ARMCC_VERSION/100000)
+  # define COMPILER_VERSION_MINOR DEC(__ARMCC_VERSION/10000 % 10)
+  # define COMPILER_VERSION_PATCH DEC(__ARMCC_VERSION    % 10000)
+#endif
+
+
+#elif defined(__clang__) && defined(__apple_build_version__)
+# define COMPILER_ID "AppleClang"
+# if defined(_MSC_VER)
+#  define SIMULATE_ID "MSVC"
+# endif
+# define COMPILER_VERSION_MAJOR DEC(__clang_major__)
+# define COMPILER_VERSION_MINOR DEC(__clang_minor__)
+# define COMPILER_VERSION_PATCH DEC(__clang_patchlevel__)
+# if defined(_MSC_VER)
+   /* _MSC_VER = VVRR */
+#  define SIMULATE_VERSION_MAJOR DEC(_MSC_VER / 100)
+#  define SIMULATE_VERSION_MINOR DEC(_MSC_VER % 100)
+# endif
+# define COMPILER_VERSION_TWEAK DEC(__apple_build_version__)
+
+#elif defined(__clang__) && defined(__ARMCOMPILER_VERSION)
+# define COMPILER_ID "ARMClang"
+  # define COMPILER_VERSION_MAJOR DEC(__ARMCOMPILER_VERSION/1000000)
+  # define COMPILER_VERSION_MINOR DEC(__ARMCOMPILER_VERSION/10000 % 100)
+  # define COMPILER_VERSION_PATCH DEC(__ARMCOMPILER_VERSION/100   % 100)
+# define COMPILER_VERSION_INTERNAL DEC(__ARMCOMPILER_VERSION)
+
+#elif defined(__clang__)
+# define COMPILER_ID "Clang"
+# if defined(_MSC_VER)
+#  define SIMULATE_ID "MSVC"
+# endif
+# define COMPILER_VERSION_MAJOR DEC(__clang_major__)
+# define COMPILER_VERSION_MINOR DEC(__clang_minor__)
+# define COMPILER_VERSION_PATCH DEC(__clang_patchlevel__)
+# if defined(_MSC_VER)
+   /* _MSC_VER = VVRR */
+#  define SIMULATE_VERSION_MAJOR DEC(_MSC_VER / 100)
+#  define SIMULATE_VERSION_MINOR DEC(_MSC_VER % 100)
+# endif
+
+#elif defined(__LCC__) && (defined(__GNUC__) || defined(__GNUG__) || defined(__MCST__))
+# define COMPILER_ID "LCC"
+# define COMPILER_VERSION_MAJOR DEC(__LCC__ / 100)
+# define COMPILER_VERSION_MINOR DEC(__LCC__ % 100)
+# if defined(__LCC_MINOR__)
+#  define COMPILER_VERSION_PATCH DEC(__LCC_MINOR__)
+# endif
+# if defined(__GNUC__) && defined(__GNUC_MINOR__)
+#  define SIMULATE_ID "GNU"
+#  define SIMULATE_VERSION_MAJOR DEC(__GNUC__)
+#  define SIMULATE_VERSION_MINOR DEC(__GNUC_MINOR__)
+#  if defined(__GNUC_PATCHLEVEL__)
+#   define SIMULATE_VERSION_PATCH DEC(__GNUC_PATCHLEVEL__)
+#  endif
+# endif
+
+#elif defined(__GNUC__) || defined(__GNUG__)
+# define COMPILER_ID "GNU"
+# if defined(__GNUC__)
+#  define COMPILER_VERSION_MAJOR DEC(__GNUC__)
+# else
+#  define COMPILER_VERSION_MAJOR DEC(__GNUG__)
+# endif
+# if defined(__GNUC_MINOR__)
+#  define COMPILER_VERSION_MINOR DEC(__GNUC_MINOR__)
+# endif
+# if defined(__GNUC_PATCHLEVEL__)
+#  define COMPILER_VERSION_PATCH DEC(__GNUC_PATCHLEVEL__)
+# endif
+
+#elif defined(_MSC_VER)
+# define COMPILER_ID "MSVC"
+  /* _MSC_VER = VVRR */
+# define COMPILER_VERSION_MAJOR DEC(_MSC_VER / 100)
+# define COMPILER_VERSION_MINOR DEC(_MSC_VER % 100)
+# if defined(_MSC_FULL_VER)
+#  if _MSC_VER >= 1400
+    /* _MSC_FULL_VER = VVRRPPPPP */
+#   define COMPILER_VERSION_PATCH DEC(_MSC_FULL_VER % 100000)
+#  else
+    /* _MSC_FULL_VER = VVRRPPPP */
+#   define COMPILER_VERSION_PATCH DEC(_MSC_FULL_VER % 10000)
+#  endif
+# endif
+# if defined(_MSC_BUILD)
+#  define COMPILER_VERSION_TWEAK DEC(_MSC_BUILD)
+# endif
+
+#elif defined(_ADI_COMPILER)
+# define COMPILER_ID "ADSP"
+#if defined(__VERSIONNUM__)
+  /* __VERSIONNUM__ = 0xVVRRPPTT */
+#  define COMPILER_VERSION_MAJOR DEC(__VERSIONNUM__ >> 24 & 0xFF)
+#  define COMPILER_VERSION_MINOR DEC(__VERSIONNUM__ >> 16 & 0xFF)
+#  define COMPILER_VERSION_PATCH DEC(__VERSIONNUM__ >> 8 & 0xFF)
+#  define COMPILER_VERSION_TWEAK DEC(__VERSIONNUM__ & 0xFF)
+#endif
+
+#elif defined(__IAR_SYSTEMS_ICC__) || defined(__IAR_SYSTEMS_ICC)
+# define COMPILER_ID "IAR"
+# if defined(__VER__) && defined(__ICCARM__)
+#  define COMPILER_VERSION_MAJOR DEC((__VER__) / 1000000)
+#  define COMPILER_VERSION_MINOR DEC(((__VER__) / 1000) % 1000)
+#  define COMPILER_VERSION_PATCH DEC((__VER__) % 1000)
+#  define COMPILER_VERSION_INTERNAL DEC(__IAR_SYSTEMS_ICC__)
+# elif defined(__VER__) && (defined(__ICCAVR__) || defined(__ICCRX__) || defined(__ICCRH850__) || defined(__ICCRL78__) || defined(__ICC430__) || defined(__ICCRISCV__) || defined(__ICCV850__) || defined(__ICC8051__) || defined(__ICCSTM8__))
+#  define COMPILER_VERSION_MAJOR DEC((__VER__) / 100)
+#  define COMPILER_VERSION_MINOR DEC((__VER__) - (((__VER__) / 100)*100))
+#  define COMPILER_VERSION_PATCH DEC(__SUBVERSION__)
+#  define COMPILER_VERSION_INTERNAL DEC(__IAR_SYSTEMS_ICC__)
+# endif
+
+
+/* These compilers are either not known or too old to define an
+  identification macro.  Try to identify the platform and guess that
+  it is the native compiler.  */
+#elif defined(__hpux) || defined(__hpua)
+# define COMPILER_ID "HP"
+
+#else /* unknown compiler */
+# define COMPILER_ID ""
+#endif
+
+/* Construct the string literal in pieces to prevent the source from
+   getting matched.  Store it in a pointer rather than an array
+   because some compilers will just produce instructions to fill the
+   array rather than assigning a pointer to a static array.  */
+char const* info_compiler = "INFO" ":" "compiler[" COMPILER_ID "]";
+#ifdef SIMULATE_ID
+char const* info_simulate = "INFO" ":" "simulate[" SIMULATE_ID "]";
+#endif
+
+#ifdef __QNXNTO__
+char const* qnxnto = "INFO" ":" "qnxnto[]";
+#endif
+
+#if defined(__CRAYXT_COMPUTE_LINUX_TARGET)
+char const *info_cray = "INFO" ":" "compiler_wrapper[CrayPrgEnv]";
+#endif
+
+#define STRINGIFY_HELPER(X) #X
+#define STRINGIFY(X) STRINGIFY_HELPER(X)
+
+/* Identify known platforms by name.  */
+#if defined(__linux) || defined(__linux__) || defined(linux)
+# define PLATFORM_ID "Linux"
+
+#elif defined(__MSYS__)
+# define PLATFORM_ID "MSYS"
+
+#elif defined(__CYGWIN__)
+# define PLATFORM_ID "Cygwin"
+
+#elif defined(__MINGW32__)
+# define PLATFORM_ID "MinGW"
+
+#elif defined(__APPLE__)
+# define PLATFORM_ID "Darwin"
+
+#elif defined(_WIN32) || defined(__WIN32__) || defined(WIN32)
+# define PLATFORM_ID "Windows"
+
+#elif defined(__FreeBSD__) || defined(__FreeBSD)
+# define PLATFORM_ID "FreeBSD"
+
+#elif defined(__NetBSD__) || defined(__NetBSD)
+# define PLATFORM_ID "NetBSD"
+
+#elif defined(__OpenBSD__) || defined(__OPENBSD)
+# define PLATFORM_ID "OpenBSD"
+
+#elif defined(__sun) || defined(sun)
+# define PLATFORM_ID "SunOS"
+
+#elif defined(_AIX) || defined(__AIX) || defined(__AIX__) || defined(__aix) || defined(__aix__)
+# define PLATFORM_ID "AIX"
+
+#elif defined(__hpux) || defined(__hpux__)
+# define PLATFORM_ID "HP-UX"
+
+#elif defined(__HAIKU__)
+# define PLATFORM_ID "Haiku"
+
+#elif defined(__BeOS) || defined(__BEOS__) || defined(_BEOS)
+# define PLATFORM_ID "BeOS"
+
+#elif defined(__QNX__) || defined(__QNXNTO__)
+# define PLATFORM_ID "QNX"
+
+#elif defined(__tru64) || defined(_tru64) || defined(__TRU64__)
+# define PLATFORM_ID "Tru64"
+
+#elif defined(__riscos) || defined(__riscos__)
+# define PLATFORM_ID "RISCos"
+
+#elif defined(__sinix) || defined(__sinix__) || defined(__SINIX__)
+# define PLATFORM_ID "SINIX"
+
+#elif defined(__UNIX_SV__)
+# define PLATFORM_ID "UNIX_SV"
+
+#elif defined(__bsdos__)
+# define PLATFORM_ID "BSDOS"
+
+#elif defined(_MPRAS) || defined(MPRAS)
+# define PLATFORM_ID "MP-RAS"
+
+#elif defined(__osf) || defined(__osf__)
+# define PLATFORM_ID "OSF1"
+
+#elif defined(_SCO_SV) || defined(SCO_SV) || defined(sco_sv)
+# define PLATFORM_ID "SCO_SV"
+
+#elif defined(__ultrix) || defined(__ultrix__) || defined(_ULTRIX)
+# define PLATFORM_ID "ULTRIX"
+
+#elif defined(__XENIX__) || defined(_XENIX) || defined(XENIX)
+# define PLATFORM_ID "Xenix"
+
+#elif defined(__WATCOMC__)
+# if defined(__LINUX__)
+#  define PLATFORM_ID "Linux"
+
+# elif defined(__DOS__)
+#  define PLATFORM_ID "DOS"
+
+# elif defined(__OS2__)
+#  define PLATFORM_ID "OS2"
+
+# elif defined(__WINDOWS__)
+#  define PLATFORM_ID "Windows3x"
+
+# elif defined(__VXWORKS__)
+#  define PLATFORM_ID "VxWorks"
+
+# else /* unknown platform */
+#  define PLATFORM_ID
+# endif
+
+#elif defined(__INTEGRITY)
+# if defined(INT_178B)
+#  define PLATFORM_ID "Integrity178"
+
+# else /* regular Integrity */
+#  define PLATFORM_ID "Integrity"
+# endif
+
+# elif defined(_ADI_COMPILER)
+#  define PLATFORM_ID "ADSP"
+
+#else /* unknown platform */
+# define PLATFORM_ID
+
+#endif
+
+/* For windows compilers MSVC and Intel we can determine
+   the architecture of the compiler being used.  This is because
+   the compilers do not have flags that can change the architecture,
+   but rather depend on which compiler is being used
+*/
+#if defined(_WIN32) && defined(_MSC_VER)
+# if defined(_M_IA64)
+#  define ARCHITECTURE_ID "IA64"
+
+# elif defined(_M_ARM64EC)
+#  define ARCHITECTURE_ID "ARM64EC"
+
+# elif defined(_M_X64) || defined(_M_AMD64)
+#  define ARCHITECTURE_ID "x64"
+
+# elif defined(_M_IX86)
+#  define ARCHITECTURE_ID "X86"
+
+# elif defined(_M_ARM64)
+#  define ARCHITECTURE_ID "ARM64"
+
+# elif defined(_M_ARM)
+#  if _M_ARM == 4
+#   define ARCHITECTURE_ID "ARMV4I"
+#  elif _M_ARM == 5
+#   define ARCHITECTURE_ID "ARMV5I"
+#  else
+#   define ARCHITECTURE_ID "ARMV" STRINGIFY(_M_ARM)
+#  endif
+
+# elif defined(_M_MIPS)
+#  define ARCHITECTURE_ID "MIPS"
+
+# elif defined(_M_SH)
+#  define ARCHITECTURE_ID "SHx"
+
+# else /* unknown architecture */
+#  define ARCHITECTURE_ID ""
+# endif
+
+#elif defined(__WATCOMC__)
+# if defined(_M_I86)
+#  define ARCHITECTURE_ID "I86"
+
+# elif defined(_M_IX86)
+#  define ARCHITECTURE_ID "X86"
+
+# else /* unknown architecture */
+#  define ARCHITECTURE_ID ""
+# endif
+
+#elif defined(__IAR_SYSTEMS_ICC__) || defined(__IAR_SYSTEMS_ICC)
+# if defined(__ICCARM__)
+#  define ARCHITECTURE_ID "ARM"
+
+# elif defined(__ICCRX__)
+#  define ARCHITECTURE_ID "RX"
+
+# elif defined(__ICCRH850__)
+#  define ARCHITECTURE_ID "RH850"
+
+# elif defined(__ICCRL78__)
+#  define ARCHITECTURE_ID "RL78"
+
+# elif defined(__ICCRISCV__)
+#  define ARCHITECTURE_ID "RISCV"
+
+# elif defined(__ICCAVR__)
+#  define ARCHITECTURE_ID "AVR"
+
+# elif defined(__ICC430__)
+#  define ARCHITECTURE_ID "MSP430"
+
+# elif defined(__ICCV850__)
+#  define ARCHITECTURE_ID "V850"
+
+# elif defined(__ICC8051__)
+#  define ARCHITECTURE_ID "8051"
+
+# elif defined(__ICCSTM8__)
+#  define ARCHITECTURE_ID "STM8"
+
+# else /* unknown architecture */
+#  define ARCHITECTURE_ID ""
+# endif
+
+#elif defined(__ghs__)
+# if defined(__PPC64__)
+#  define ARCHITECTURE_ID "PPC64"
+
+# elif defined(__ppc__)
+#  define ARCHITECTURE_ID "PPC"
+
+# elif defined(__ARM__)
+#  define ARCHITECTURE_ID "ARM"
+
+# elif defined(__x86_64__)
+#  define ARCHITECTURE_ID "x64"
+
+# elif defined(__i386__)
+#  define ARCHITECTURE_ID "X86"
+
+# else /* unknown architecture */
+#  define ARCHITECTURE_ID ""
+# endif
+
+#elif defined(__TI_COMPILER_VERSION__)
+# if defined(__TI_ARM__)
+#  define ARCHITECTURE_ID "ARM"
+
+# elif defined(__MSP430__)
+#  define ARCHITECTURE_ID "MSP430"
+
+# elif defined(__TMS320C28XX__)
+#  define ARCHITECTURE_ID "TMS320C28x"
+
+# elif defined(__TMS320C6X__) || defined(_TMS320C6X)
+#  define ARCHITECTURE_ID "TMS320C6x"
+
+# else /* unknown architecture */
+#  define ARCHITECTURE_ID ""
+# endif
+
+# elif defined(__ADSPSHARC__)
+#  define ARCHITECTURE_ID "SHARC"
+
+# elif defined(__ADSPBLACKFIN__)
+#  define ARCHITECTURE_ID "Blackfin"
+
+#elif defined(__TASKING__)
+
+# if defined(__CTC__) || defined(__CPTC__)
+#  define ARCHITECTURE_ID "TriCore"
+
+# elif defined(__CMCS__)
+#  define ARCHITECTURE_ID "MCS"
+
+# elif defined(__CARM__)
+#  define ARCHITECTURE_ID "ARM"
+
+# elif defined(__CARC__)
+#  define ARCHITECTURE_ID "ARC"
+
+# elif defined(__C51__)
+#  define ARCHITECTURE_ID "8051"
+
+# elif defined(__CPCP__)
+#  define ARCHITECTURE_ID "PCP"
+
+# else
+#  define ARCHITECTURE_ID ""
+# endif
+
+#else
+#  define ARCHITECTURE_ID
+#endif
+
+/* Convert integer to decimal digit literals.  */
+#define DEC(n)                   \
+  ('0' + (((n) / 10000000)%10)), \
+  ('0' + (((n) / 1000000)%10)),  \
+  ('0' + (((n) / 100000)%10)),   \
+  ('0' + (((n) / 10000)%10)),    \
+  ('0' + (((n) / 1000)%10)),     \
+  ('0' + (((n) / 100)%10)),      \
+  ('0' + (((n) / 10)%10)),       \
+  ('0' +  ((n) % 10))
+
+/* Convert integer to hex digit literals.  */
+#define HEX(n)             \
+  ('0' + ((n)>>28 & 0xF)), \
+  ('0' + ((n)>>24 & 0xF)), \
+  ('0' + ((n)>>20 & 0xF)), \
+  ('0' + ((n)>>16 & 0xF)), \
+  ('0' + ((n)>>12 & 0xF)), \
+  ('0' + ((n)>>8  & 0xF)), \
+  ('0' + ((n)>>4  & 0xF)), \
+  ('0' + ((n)     & 0xF))
+
+/* Construct a string literal encoding the version number. */
+#ifdef COMPILER_VERSION
+char const* info_version = "INFO" ":" "compiler_version[" COMPILER_VERSION "]";
+
+/* Construct a string literal encoding the version number components. */
+#elif defined(COMPILER_VERSION_MAJOR)
+char const info_version[] = {
+  'I', 'N', 'F', 'O', ':',
+  'c','o','m','p','i','l','e','r','_','v','e','r','s','i','o','n','[',
+  COMPILER_VERSION_MAJOR,
+# ifdef COMPILER_VERSION_MINOR
+  '.', COMPILER_VERSION_MINOR,
+#  ifdef COMPILER_VERSION_PATCH
+   '.', COMPILER_VERSION_PATCH,
+#   ifdef COMPILER_VERSION_TWEAK
+    '.', COMPILER_VERSION_TWEAK,
+#   endif
+#  endif
+# endif
+  ']','\0'};
+#endif
+
+/* Construct a string literal encoding the internal version number. */
+#ifdef COMPILER_VERSION_INTERNAL
+char const info_version_internal[] = {
+  'I', 'N', 'F', 'O', ':',
+  'c','o','m','p','i','l','e','r','_','v','e','r','s','i','o','n','_',
+  'i','n','t','e','r','n','a','l','[',
+  COMPILER_VERSION_INTERNAL,']','\0'};
+#elif defined(COMPILER_VERSION_INTERNAL_STR)
+char const* info_version_internal = "INFO" ":" "compiler_version_internal[" COMPILER_VERSION_INTERNAL_STR "]";
+#endif
+
+/* Construct a string literal encoding the version number components. */
+#ifdef SIMULATE_VERSION_MAJOR
+char const info_simulate_version[] = {
+  'I', 'N', 'F', 'O', ':',
+  's','i','m','u','l','a','t','e','_','v','e','r','s','i','o','n','[',
+  SIMULATE_VERSION_MAJOR,
+# ifdef SIMULATE_VERSION_MINOR
+  '.', SIMULATE_VERSION_MINOR,
+#  ifdef SIMULATE_VERSION_PATCH
+   '.', SIMULATE_VERSION_PATCH,
+#   ifdef SIMULATE_VERSION_TWEAK
+    '.', SIMULATE_VERSION_TWEAK,
+#   endif
+#  endif
+# endif
+  ']','\0'};
+#endif
+
+/* Construct the string literal in pieces to prevent the source from
+   getting matched.  Store it in a pointer rather than an array
+   because some compilers will just produce instructions to fill the
+   array rather than assigning a pointer to a static array.  */
+char const* info_platform = "INFO" ":" "platform[" PLATFORM_ID "]";
+char const* info_arch = "INFO" ":" "arch[" ARCHITECTURE_ID "]";
+
+
+
+#if defined(__INTEL_COMPILER) && defined(_MSVC_LANG) && _MSVC_LANG < 201403L
+#  if defined(__INTEL_CXX11_MODE__)
+#    if defined(__cpp_aggregate_nsdmi)
+#      define CXX_STD 201402L
+#    else
+#      define CXX_STD 201103L
+#    endif
+#  else
+#    define CXX_STD 199711L
+#  endif
+#elif defined(_MSC_VER) && defined(_MSVC_LANG)
+#  define CXX_STD _MSVC_LANG
+#else
+#  define CXX_STD __cplusplus
+#endif
+
+const char* info_language_standard_default = "INFO" ":" "standard_default["
+#if CXX_STD > 202002L
+  "23"
+#elif CXX_STD > 201703L
+  "20"
+#elif CXX_STD >= 201703L
+  "17"
+#elif CXX_STD >= 201402L
+  "14"
+#elif CXX_STD >= 201103L
+  "11"
+#else
+  "98"
+#endif
+"]";
+
+const char* info_language_extensions_default = "INFO" ":" "extensions_default["
+#if (defined(__clang__) || defined(__GNUC__) || defined(__xlC__) ||           \
+     defined(__TI_COMPILER_VERSION__)) &&                                     \
+  !defined(__STRICT_ANSI__)
+  "ON"
+#else
+  "OFF"
+#endif
+"]";
+
+/*--------------------------------------------------------------------------*/
+
+int main(int argc, char* argv[])
+{
+  int require = 0;
+  require += info_compiler[argc];
+  require += info_platform[argc];
+  require += info_arch[argc];
+#ifdef COMPILER_VERSION_MAJOR
+  require += info_version[argc];
+#endif
+#ifdef COMPILER_VERSION_INTERNAL
+  require += info_version_internal[argc];
+#endif
+#ifdef SIMULATE_ID
+  require += info_simulate[argc];
+#endif
+#ifdef SIMULATE_VERSION_MAJOR
+  require += info_simulate_version[argc];
+#endif
+#if defined(__CRAYXT_COMPUTE_LINUX_TARGET)
+  require += info_cray[argc];
+#endif
+  require += info_language_standard_default[argc];
+  require += info_language_extensions_default[argc];
+  (void)argv;
+  return require;
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/3.28.2/CompilerIdCXX/a.exe b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/3.28.2/CompilerIdCXX/a.exe
new file mode 100644
index 0000000..95e0d14
Binary files /dev/null and b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/3.28.2/CompilerIdCXX/a.exe differ
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/CMakeConfigureLog.yaml b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/CMakeConfigureLog.yaml
new file mode 100644
index 0000000..d401519
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/CMakeConfigureLog.yaml
@@ -0,0 +1,615 @@
+
+---
+events:
+  -
+    kind: "message-v1"
+    backtrace:
+      - "C:/mingw64/share/cmake-3.28/Modules/CMakeDetermineSystem.cmake:233 (message)"
+      - "CMakeLists.txt:9 (project)"
+    message: |
+      The system is: Windows - 6.2.9200 - AMD64
+  -
+    kind: "message-v1"
+    backtrace:
+      - "C:/mingw64/share/cmake-3.28/Modules/CMakeDetermineCompilerId.cmake:17 (message)"
+      - "C:/mingw64/share/cmake-3.28/Modules/CMakeDetermineCompilerId.cmake:64 (__determine_compiler_id_test)"
+      - "C:/mingw64/share/cmake-3.28/Modules/CMakeDetermineCCompiler.cmake:123 (CMAKE_DETERMINE_COMPILER_ID)"
+      - "CMakeLists.txt:9 (project)"
+    message: |
+      Compiling the C compiler identification source file "CMakeCCompilerId.c" succeeded.
+      Compiler: C:/mingw64/bin/gcc.exe 
+      Build flags: 
+      Id flags:  
+      
+      The output was:
+      0
+      
+      
+      Compilation of the C compiler identification source "CMakeCCompilerId.c" produced "a.exe"
+      
+      The C compiler identification is GNU, found in:
+        D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/CMakeFiles/3.28.2/CompilerIdC/a.exe
+      
+  -
+    kind: "message-v1"
+    backtrace:
+      - "C:/mingw64/share/cmake-3.28/Modules/CMakeDetermineCompilerId.cmake:17 (message)"
+      - "C:/mingw64/share/cmake-3.28/Modules/CMakeDetermineCompilerId.cmake:64 (__determine_compiler_id_test)"
+      - "C:/mingw64/share/cmake-3.28/Modules/CMakeDetermineCXXCompiler.cmake:126 (CMAKE_DETERMINE_COMPILER_ID)"
+      - "CMakeLists.txt:9 (project)"
+    message: |
+      Compiling the CXX compiler identification source file "CMakeCXXCompilerId.cpp" succeeded.
+      Compiler: C:/mingw64/bin/gcc.exe 
+      Build flags: 
+      Id flags:  
+      
+      The output was:
+      0
+      
+      
+      Compilation of the CXX compiler identification source "CMakeCXXCompilerId.cpp" produced "a.exe"
+      
+      The CXX compiler identification is GNU, found in:
+        D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/CMakeFiles/3.28.2/CompilerIdCXX/a.exe
+      
+  -
+    kind: "try_compile-v1"
+    backtrace:
+      - "C:/mingw64/share/cmake-3.28/Modules/CMakeDetermineCompilerABI.cmake:57 (try_compile)"
+      - "C:/mingw64/share/cmake-3.28/Modules/CMakeTestCCompiler.cmake:26 (CMAKE_DETERMINE_COMPILER_ABI)"
+      - "CMakeLists.txt:9 (project)"
+    checks:
+      - "Detecting C compiler ABI info"
+    directories:
+      source: "D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/CMakeFiles/CMakeScratch/TryCompile-731u3b"
+      binary: "D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/CMakeFiles/CMakeScratch/TryCompile-731u3b"
+    cmakeVariables:
+      CMAKE_C_FLAGS: ""
+      CMAKE_C_FLAGS_DEBUG: "-g"
+      CMAKE_EXE_LINKER_FLAGS: ""
+    buildResult:
+      variable: "CMAKE_C_ABI_COMPILED"
+      cached: true
+      stdout: |
+        Change Dir: 'D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/CMakeFiles/CMakeScratch/TryCompile-731u3b'
+        
+        Run Build Command(s): C:/mingw64/bin/cmake.exe -E env VERBOSE=1 C:/mingw64/bin/mingw32-make.exe -f Makefile cmTC_e8c03/fast
+        C:/mingw64/bin/mingw32-make.exe  -f CMakeFiles\\cmTC_e8c03.dir\\build.make CMakeFiles/cmTC_e8c03.dir/build
+        mingw32-make[1]: Entering directory 'D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/CMakeFiles/CMakeScratch/TryCompile-731u3b'
+        Building C object CMakeFiles/cmTC_e8c03.dir/CMakeCCompilerABI.c.obj
+        C:\\mingw64\\bin\\gcc.exe   -v -o CMakeFiles\\cmTC_e8c03.dir\\CMakeCCompilerABI.c.obj -c C:\\mingw64\\share\\cmake-3.28\\Modules\\CMakeCCompilerABI.c
+        Using built-in specs.
+        COLLECT_GCC=C:\\mingw64\\bin\\gcc.exe
+        OFFLOAD_TARGET_NAMES=nvptx-none
+        Target: x86_64-w64-mingw32
+        Configured with: ../configure --prefix=/R/winlibs64ucrt_stage/inst_gcc-13.2.0/share/gcc --build=x86_64-w64-mingw32 --host=x86_64-w64-mingw32 --enable-offload-targets=nvptx-none --with-pkgversion='MinGW-W64 x86_64-ucrt-posix-seh, built by Brecht Sanders, r5' --with-tune=generic --enable-checking=release --enable-threads=posix --disable-sjlj-exceptions --disable-libunwind-exceptions --disable-serial-configure --disable-bootstrap --enable-host-shared --enable-plugin --disable-default-ssp --disable-rpath --disable-libstdcxx-debug --disable-version-specific-runtime-libs --with-stabs --disable-symvers --enable-languages=c,c++,fortran,lto,objc,obj-c++ --disable-gold --disable-nls --disable-stage1-checking --disable-win32-registry --disable-multilib --enable-ld --enable-libquadmath --enable-libada --enable-libssp --enable-libstdcxx --enable-lto --enable-fully-dynamic-string --enable-libgomp --enable-graphite --enable-mingw-wildcard --enable-libstdcxx-time --enable-libstdcxx-pch --with-mpc=/d/Prog/winlibs64ucrt_stage/custombuilt --with-mpfr=/d/Prog/winlibs64ucrt_stage/custombuilt --with-gmp=/d/Prog/winlibs64ucrt_stage/custombuilt --with-isl=/d/Prog/winlibs64ucrt_stage/custombuilt --disable-libstdcxx-backtrace --enable-install-libiberty --enable-__cxa_atexit --without-included-gettext --with-diagnostics-color=auto --enable-clocale=generic --with-libiconv --with-system-zlib --with-build-sysroot=/R/winlibs64ucrt_stage/gcc-13.2.0/build_mingw/mingw-w64 CFLAGS='-I/d/Prog/winlibs64ucrt_stage/custombuilt/include/libdl-win32   -march=nocona -msahf -mtune=generic -O2' CXXFLAGS='-Wno-int-conversion  -march=nocona -msahf -mtune=generic -O2' LDFLAGS='-pthread -Wl,--no-insert-timestamp -Wl,--dynamicbase -Wl,--high-entropy-va -Wl,--nxcompat -Wl,--tsaware' LD=/d/Prog/winlibs64ucrt_stage/custombuilt/share/binutils/bin/ld.exe
+        Thread model: posix
+        Supported LTO compression algorithms: zlib zstd
+        gcc version 13.2.0 (MinGW-W64 x86_64-ucrt-posix-seh, built by Brecht Sanders, r5) 
+        COLLECT_GCC_OPTIONS='-v' '-o' 'CMakeFiles\\cmTC_e8c03.dir\\CMakeCCompilerABI.c.obj' '-c' '-mtune=generic' '-march=x86-64' '-dumpdir' 'CMakeFiles\\cmTC_e8c03.dir\\'
+         C:/mingw64/bin/../libexec/gcc/x86_64-w64-mingw32/13.2.0/cc1.exe -quiet -v -iprefix C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/ -D_REENTRANT C:\\mingw64\\share\\cmake-3.28\\Modules\\CMakeCCompilerABI.c -quiet -dumpdir CMakeFiles\\cmTC_e8c03.dir\\ -dumpbase CMakeCCompilerABI.c.c -dumpbase-ext .c -mtune=generic -march=x86-64 -version -o C:\\Users\\simko\\AppData\\Local\\Temp\\cc717B8l.s
+        GNU C17 (MinGW-W64 x86_64-ucrt-posix-seh, built by Brecht Sanders, r5) version 13.2.0 (x86_64-w64-mingw32)
+        	compiled by GNU C version 13.2.0, GMP version 6.3.0, MPFR version 4.2.1, MPC version 1.3.1, isl version isl-0.26-GMP
+        
+        GGC heuristics: --param ggc-min-expand=100 --param ggc-min-heapsize=131072
+        ignoring duplicate directory "C:/mingw64/lib/gcc/../../lib/gcc/x86_64-w64-mingw32/13.2.0/include"
+        ignoring nonexistent directory "R:/winlibs64ucrt_stage/inst_gcc-13.2.0/share/gcc/include"
+        ignoring nonexistent directory "/R/winlibs64ucrt_stage/inst_gcc-13.2.0/share/gcc/include"
+        ignoring duplicate directory "C:/mingw64/lib/gcc/../../lib/gcc/x86_64-w64-mingw32/13.2.0/include-fixed"
+        ignoring duplicate directory "C:/mingw64/lib/gcc/../../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../x86_64-w64-mingw32/include"
+        ignoring nonexistent directory "/mingw/include"
+        #include "..." search starts here:
+        #include <...> search starts here:
+         C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/include
+         C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../include
+         C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/include-fixed
+         C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../x86_64-w64-mingw32/include
+        End of search list.
+        Compiler executable checksum: 7a441bbadf19345f9c279b4b244f7757
+        COLLECT_GCC_OPTIONS='-v' '-o' 'CMakeFiles\\cmTC_e8c03.dir\\CMakeCCompilerABI.c.obj' '-c' '-mtune=generic' '-march=x86-64' '-dumpdir' 'CMakeFiles\\cmTC_e8c03.dir\\'
+         C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../x86_64-w64-mingw32/bin/as.exe -v -o CMakeFiles\\cmTC_e8c03.dir\\CMakeCCompilerABI.c.obj C:\\Users\\simko\\AppData\\Local\\Temp\\cc717B8l.s
+        GNU assembler version 2.42 (x86_64-w64-mingw32) using BFD version (Binutils for MinGW-W64 x86_64, built by Brecht Sanders, r5) 2.42
+        COMPILER_PATH=C:/mingw64/bin/../libexec/gcc/x86_64-w64-mingw32/13.2.0/;C:/mingw64/bin/../libexec/gcc/;C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../x86_64-w64-mingw32/bin/
+        LIBRARY_PATH=C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/;C:/mingw64/bin/../lib/gcc/;C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../x86_64-w64-mingw32/lib/../lib/;C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../lib/;C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../x86_64-w64-mingw32/lib/;C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../
+        COLLECT_GCC_OPTIONS='-v' '-o' 'CMakeFiles\\cmTC_e8c03.dir\\CMakeCCompilerABI.c.obj' '-c' '-mtune=generic' '-march=x86-64' '-dumpdir' 'CMakeFiles\\cmTC_e8c03.dir\\CMakeCCompilerABI.c.'
+        Linking C executable cmTC_e8c03.exe
+        C:\\mingw64\\bin\\cmake.exe -E cmake_link_script CMakeFiles\\cmTC_e8c03.dir\\link.txt --verbose=1
+        C:\\mingw64\\bin\\cmake.exe -E rm -f CMakeFiles\\cmTC_e8c03.dir/objects.a
+        C:\\mingw64\\bin\\ar.exe qc CMakeFiles\\cmTC_e8c03.dir/objects.a @CMakeFiles\\cmTC_e8c03.dir\\objects1.rsp
+        C:\\mingw64\\bin\\gcc.exe  -v -Wl,--whole-archive CMakeFiles\\cmTC_e8c03.dir/objects.a -Wl,--no-whole-archive -o cmTC_e8c03.exe -Wl,--out-implib,libcmTC_e8c03.dll.a -Wl,--major-image-version,0,--minor-image-version,0 
+        Using built-in specs.
+        COLLECT_GCC=C:\\mingw64\\bin\\gcc.exe
+        COLLECT_LTO_WRAPPER=C:/mingw64/bin/../libexec/gcc/x86_64-w64-mingw32/13.2.0/lto-wrapper.exe
+        OFFLOAD_TARGET_NAMES=nvptx-none
+        Target: x86_64-w64-mingw32
+        Configured with: ../configure --prefix=/R/winlibs64ucrt_stage/inst_gcc-13.2.0/share/gcc --build=x86_64-w64-mingw32 --host=x86_64-w64-mingw32 --enable-offload-targets=nvptx-none --with-pkgversion='MinGW-W64 x86_64-ucrt-posix-seh, built by Brecht Sanders, r5' --with-tune=generic --enable-checking=release --enable-threads=posix --disable-sjlj-exceptions --disable-libunwind-exceptions --disable-serial-configure --disable-bootstrap --enable-host-shared --enable-plugin --disable-default-ssp --disable-rpath --disable-libstdcxx-debug --disable-version-specific-runtime-libs --with-stabs --disable-symvers --enable-languages=c,c++,fortran,lto,objc,obj-c++ --disable-gold --disable-nls --disable-stage1-checking --disable-win32-registry --disable-multilib --enable-ld --enable-libquadmath --enable-libada --enable-libssp --enable-libstdcxx --enable-lto --enable-fully-dynamic-string --enable-libgomp --enable-graphite --enable-mingw-wildcard --enable-libstdcxx-time --enable-libstdcxx-pch --with-mpc=/d/Prog/winlibs64ucrt_stage/custombuilt --with-mpfr=/d/Prog/winlibs64ucrt_stage/custombuilt --with-gmp=/d/Prog/winlibs64ucrt_stage/custombuilt --with-isl=/d/Prog/winlibs64ucrt_stage/custombuilt --disable-libstdcxx-backtrace --enable-install-libiberty --enable-__cxa_atexit --without-included-gettext --with-diagnostics-color=auto --enable-clocale=generic --with-libiconv --with-system-zlib --with-build-sysroot=/R/winlibs64ucrt_stage/gcc-13.2.0/build_mingw/mingw-w64 CFLAGS='-I/d/Prog/winlibs64ucrt_stage/custombuilt/include/libdl-win32   -march=nocona -msahf -mtune=generic -O2' CXXFLAGS='-Wno-int-conversion  -march=nocona -msahf -mtune=generic -O2' LDFLAGS='-pthread -Wl,--no-insert-timestamp -Wl,--dynamicbase -Wl,--high-entropy-va -Wl,--nxcompat -Wl,--tsaware' LD=/d/Prog/winlibs64ucrt_stage/custombuilt/share/binutils/bin/ld.exe
+        Thread model: posix
+        Supported LTO compression algorithms: zlib zstd
+        gcc version 13.2.0 (MinGW-W64 x86_64-ucrt-posix-seh, built by Brecht Sanders, r5) 
+        COMPILER_PATH=C:/mingw64/bin/../libexec/gcc/x86_64-w64-mingw32/13.2.0/;C:/mingw64/bin/../libexec/gcc/;C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../x86_64-w64-mingw32/bin/
+        LIBRARY_PATH=C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/;C:/mingw64/bin/../lib/gcc/;C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../x86_64-w64-mingw32/lib/../lib/;C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../lib/;C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../x86_64-w64-mingw32/lib/;C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../
+        COLLECT_GCC_OPTIONS='-v' '-o' 'cmTC_e8c03.exe' '-mtune=generic' '-march=x86-64' '-dumpdir' 'cmTC_e8c03.'
+         C:/mingw64/bin/../libexec/gcc/x86_64-w64-mingw32/13.2.0/collect2.exe -plugin C:/mingw64/bin/../libexec/gcc/x86_64-w64-mingw32/13.2.0/liblto_plugin.dll -plugin-opt=C:/mingw64/bin/../libexec/gcc/x86_64-w64-mingw32/13.2.0/lto-wrapper.exe -plugin-opt=-fresolution=C:\\Users\\simko\\AppData\\Local\\Temp\\ccvQWfYs.res -plugin-opt=-pass-through=-lmingw32 -plugin-opt=-pass-through=-lgcc -plugin-opt=-pass-through=-lgcc_eh -plugin-opt=-pass-through=-lmoldname -plugin-opt=-pass-through=-lmingwex -plugin-opt=-pass-through=-lmsvcrt -plugin-opt=-pass-through=-lkernel32 -plugin-opt=-pass-through=-lpthread -plugin-opt=-pass-through=-ladvapi32 -plugin-opt=-pass-through=-lshell32 -plugin-opt=-pass-through=-luser32 -plugin-opt=-pass-through=-lkernel32 -plugin-opt=-pass-through=-lmingw32 -plugin-opt=-pass-through=-lgcc -plugin-opt=-pass-through=-lgcc_eh -plugin-opt=-pass-through=-lmoldname -plugin-opt=-pass-through=-lmingwex -plugin-opt=-pass-through=-lmsvcrt -plugin-opt=-pass-through=-lkernel32 -m i386pep -Bdynamic -o cmTC_e8c03.exe C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../x86_64-w64-mingw32/lib/../lib/crt2.o C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/crtbegin.o -LC:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0 -LC:/mingw64/bin/../lib/gcc -LC:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../x86_64-w64-mingw32/lib/../lib -LC:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../lib -LC:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../x86_64-w64-mingw32/lib -LC:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../.. --whole-archive CMakeFiles\\cmTC_e8c03.dir/objects.a --no-whole-archive --out-implib libcmTC_e8c03.dll.a --major-image-version 0 --minor-image-version 0 -lmingw32 -lgcc -lgcc_eh -lmoldname -lmingwex -lmsvcrt -lkernel32 -lpthread -ladvapi32 -lshell32 -luser32 -lkernel32 -lmingw32 -lgcc -lgcc_eh -lmoldname -lmingwex -lmsvcrt -lkernel32 C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/crtend.o
+        COLLECT_GCC_OPTIONS='-v' '-o' 'cmTC_e8c03.exe' '-mtune=generic' '-march=x86-64' '-dumpdir' 'cmTC_e8c03.'
+        mingw32-make[1]: Leaving directory 'D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/CMakeFiles/CMakeScratch/TryCompile-731u3b'
+        
+      exitCode: 0
+  -
+    kind: "message-v1"
+    backtrace:
+      - "C:/mingw64/share/cmake-3.28/Modules/CMakeDetermineCompilerABI.cmake:127 (message)"
+      - "C:/mingw64/share/cmake-3.28/Modules/CMakeTestCCompiler.cmake:26 (CMAKE_DETERMINE_COMPILER_ABI)"
+      - "CMakeLists.txt:9 (project)"
+    message: |
+      Parsed C implicit include dir info: rv=done
+        found start of include info
+        found start of implicit include info
+          add: [C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/include]
+          add: [C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../include]
+          add: [C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/include-fixed]
+          add: [C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../x86_64-w64-mingw32/include]
+        end of search list found
+        collapse include dir [C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/include] ==> [C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include]
+        collapse include dir [C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../include] ==> [C:/mingw64/include]
+        collapse include dir [C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/include-fixed] ==> [C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include-fixed]
+        collapse include dir [C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../x86_64-w64-mingw32/include] ==> [C:/mingw64/x86_64-w64-mingw32/include]
+        implicit include dirs: [C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include;C:/mingw64/include;C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include-fixed;C:/mingw64/x86_64-w64-mingw32/include]
+      
+      
+  -
+    kind: "message-v1"
+    backtrace:
+      - "C:/mingw64/share/cmake-3.28/Modules/CMakeDetermineCompilerABI.cmake:159 (message)"
+      - "C:/mingw64/share/cmake-3.28/Modules/CMakeTestCCompiler.cmake:26 (CMAKE_DETERMINE_COMPILER_ABI)"
+      - "CMakeLists.txt:9 (project)"
+    message: |
+      Parsed C implicit link information:
+        link line regex: [^( *|.*[/\\])(ld\\.exe|CMAKE_LINK_STARTFILE-NOTFOUND|([^/\\]+-)?ld|collect2)[^/\\]*( |$)]
+        ignore line: [Change Dir: 'D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/CMakeFiles/CMakeScratch/TryCompile-731u3b']
+        ignore line: []
+        ignore line: [Run Build Command(s): C:/mingw64/bin/cmake.exe -E env VERBOSE=1 C:/mingw64/bin/mingw32-make.exe -f Makefile cmTC_e8c03/fast]
+        ignore line: [C:/mingw64/bin/mingw32-make.exe  -f CMakeFiles\\cmTC_e8c03.dir\\build.make CMakeFiles/cmTC_e8c03.dir/build]
+        ignore line: [mingw32-make[1]: Entering directory 'D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/CMakeFiles/CMakeScratch/TryCompile-731u3b']
+        ignore line: [Building C object CMakeFiles/cmTC_e8c03.dir/CMakeCCompilerABI.c.obj]
+        ignore line: [C:\\mingw64\\bin\\gcc.exe   -v -o CMakeFiles\\cmTC_e8c03.dir\\CMakeCCompilerABI.c.obj -c C:\\mingw64\\share\\cmake-3.28\\Modules\\CMakeCCompilerABI.c]
+        ignore line: [Using built-in specs.]
+        ignore line: [COLLECT_GCC=C:\\mingw64\\bin\\gcc.exe]
+        ignore line: [OFFLOAD_TARGET_NAMES=nvptx-none]
+        ignore line: [Target: x86_64-w64-mingw32]
+        ignore line: [Configured with: ../configure --prefix=/R/winlibs64ucrt_stage/inst_gcc-13.2.0/share/gcc --build=x86_64-w64-mingw32 --host=x86_64-w64-mingw32 --enable-offload-targets=nvptx-none --with-pkgversion='MinGW-W64 x86_64-ucrt-posix-seh, built by Brecht Sanders, r5' --with-tune=generic --enable-checking=release --enable-threads=posix --disable-sjlj-exceptions --disable-libunwind-exceptions --disable-serial-configure --disable-bootstrap --enable-host-shared --enable-plugin --disable-default-ssp --disable-rpath --disable-libstdcxx-debug --disable-version-specific-runtime-libs --with-stabs --disable-symvers --enable-languages=c,c++,fortran,lto,objc,obj-c++ --disable-gold --disable-nls --disable-stage1-checking --disable-win32-registry --disable-multilib --enable-ld --enable-libquadmath --enable-libada --enable-libssp --enable-libstdcxx --enable-lto --enable-fully-dynamic-string --enable-libgomp --enable-graphite --enable-mingw-wildcard --enable-libstdcxx-time --enable-libstdcxx-pch --with-mpc=/d/Prog/winlibs64ucrt_stage/custombuilt --with-mpfr=/d/Prog/winlibs64ucrt_stage/custombuilt --with-gmp=/d/Prog/winlibs64ucrt_stage/custombuilt --with-isl=/d/Prog/winlibs64ucrt_stage/custombuilt --disable-libstdcxx-backtrace --enable-install-libiberty --enable-__cxa_atexit --without-included-gettext --with-diagnostics-color=auto --enable-clocale=generic --with-libiconv --with-system-zlib --with-build-sysroot=/R/winlibs64ucrt_stage/gcc-13.2.0/build_mingw/mingw-w64 CFLAGS='-I/d/Prog/winlibs64ucrt_stage/custombuilt/include/libdl-win32   -march=nocona -msahf -mtune=generic -O2' CXXFLAGS='-Wno-int-conversion  -march=nocona -msahf -mtune=generic -O2' LDFLAGS='-pthread -Wl,--no-insert-timestamp -Wl,--dynamicbase -Wl,--high-entropy-va -Wl,--nxcompat -Wl,--tsaware' LD=/d/Prog/winlibs64ucrt_stage/custombuilt/share/binutils/bin/ld.exe]
+        ignore line: [Thread model: posix]
+        ignore line: [Supported LTO compression algorithms: zlib zstd]
+        ignore line: [gcc version 13.2.0 (MinGW-W64 x86_64-ucrt-posix-seh  built by Brecht Sanders  r5) ]
+        ignore line: [COLLECT_GCC_OPTIONS='-v' '-o' 'CMakeFiles\\cmTC_e8c03.dir\\CMakeCCompilerABI.c.obj' '-c' '-mtune=generic' '-march=x86-64' '-dumpdir' 'CMakeFiles\\cmTC_e8c03.dir\\']
+        ignore line: [ C:/mingw64/bin/../libexec/gcc/x86_64-w64-mingw32/13.2.0/cc1.exe -quiet -v -iprefix C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/ -D_REENTRANT C:\\mingw64\\share\\cmake-3.28\\Modules\\CMakeCCompilerABI.c -quiet -dumpdir CMakeFiles\\cmTC_e8c03.dir\\ -dumpbase CMakeCCompilerABI.c.c -dumpbase-ext .c -mtune=generic -march=x86-64 -version -o C:\\Users\\simko\\AppData\\Local\\Temp\\cc717B8l.s]
+        ignore line: [GNU C17 (MinGW-W64 x86_64-ucrt-posix-seh  built by Brecht Sanders  r5) version 13.2.0 (x86_64-w64-mingw32)]
+        ignore line: [	compiled by GNU C version 13.2.0  GMP version 6.3.0  MPFR version 4.2.1  MPC version 1.3.1  isl version isl-0.26-GMP]
+        ignore line: []
+        ignore line: [GGC heuristics: --param ggc-min-expand=100 --param ggc-min-heapsize=131072]
+        ignore line: [ignoring duplicate directory "C:/mingw64/lib/gcc/../../lib/gcc/x86_64-w64-mingw32/13.2.0/include"]
+        ignore line: [ignoring nonexistent directory "R:/winlibs64ucrt_stage/inst_gcc-13.2.0/share/gcc/include"]
+        ignore line: [ignoring nonexistent directory "/R/winlibs64ucrt_stage/inst_gcc-13.2.0/share/gcc/include"]
+        ignore line: [ignoring duplicate directory "C:/mingw64/lib/gcc/../../lib/gcc/x86_64-w64-mingw32/13.2.0/include-fixed"]
+        ignore line: [ignoring duplicate directory "C:/mingw64/lib/gcc/../../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../x86_64-w64-mingw32/include"]
+        ignore line: [ignoring nonexistent directory "/mingw/include"]
+        ignore line: [#include "..." search starts here:]
+        ignore line: [#include <...> search starts here:]
+        ignore line: [ C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/include]
+        ignore line: [ C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../include]
+        ignore line: [ C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/include-fixed]
+        ignore line: [ C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../x86_64-w64-mingw32/include]
+        ignore line: [End of search list.]
+        ignore line: [Compiler executable checksum: 7a441bbadf19345f9c279b4b244f7757]
+        ignore line: [COLLECT_GCC_OPTIONS='-v' '-o' 'CMakeFiles\\cmTC_e8c03.dir\\CMakeCCompilerABI.c.obj' '-c' '-mtune=generic' '-march=x86-64' '-dumpdir' 'CMakeFiles\\cmTC_e8c03.dir\\']
+        ignore line: [ C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../x86_64-w64-mingw32/bin/as.exe -v -o CMakeFiles\\cmTC_e8c03.dir\\CMakeCCompilerABI.c.obj C:\\Users\\simko\\AppData\\Local\\Temp\\cc717B8l.s]
+        ignore line: [GNU assembler version 2.42 (x86_64-w64-mingw32) using BFD version (Binutils for MinGW-W64 x86_64  built by Brecht Sanders  r5) 2.42]
+        ignore line: [COMPILER_PATH=C:/mingw64/bin/../libexec/gcc/x86_64-w64-mingw32/13.2.0/]
+        ignore line: [C:/mingw64/bin/../libexec/gcc/]
+        ignore line: [C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../x86_64-w64-mingw32/bin/]
+        ignore line: [LIBRARY_PATH=C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/]
+        ignore line: [C:/mingw64/bin/../lib/gcc/]
+        ignore line: [C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../x86_64-w64-mingw32/lib/../lib/]
+        ignore line: [C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../lib/]
+        ignore line: [C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../x86_64-w64-mingw32/lib/]
+        ignore line: [C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../]
+        ignore line: [COLLECT_GCC_OPTIONS='-v' '-o' 'CMakeFiles\\cmTC_e8c03.dir\\CMakeCCompilerABI.c.obj' '-c' '-mtune=generic' '-march=x86-64' '-dumpdir' 'CMakeFiles\\cmTC_e8c03.dir\\CMakeCCompilerABI.c.']
+        ignore line: [Linking C executable cmTC_e8c03.exe]
+        ignore line: [C:\\mingw64\\bin\\cmake.exe -E cmake_link_script CMakeFiles\\cmTC_e8c03.dir\\link.txt --verbose=1]
+        ignore line: [C:\\mingw64\\bin\\cmake.exe -E rm -f CMakeFiles\\cmTC_e8c03.dir/objects.a]
+        ignore line: [C:\\mingw64\\bin\\ar.exe qc CMakeFiles\\cmTC_e8c03.dir/objects.a @CMakeFiles\\cmTC_e8c03.dir\\objects1.rsp]
+        ignore line: [C:\\mingw64\\bin\\gcc.exe  -v -Wl --whole-archive CMakeFiles\\cmTC_e8c03.dir/objects.a -Wl --no-whole-archive -o cmTC_e8c03.exe -Wl --out-implib libcmTC_e8c03.dll.a -Wl --major-image-version 0 --minor-image-version 0 ]
+        ignore line: [Using built-in specs.]
+        ignore line: [COLLECT_GCC=C:\\mingw64\\bin\\gcc.exe]
+        ignore line: [COLLECT_LTO_WRAPPER=C:/mingw64/bin/../libexec/gcc/x86_64-w64-mingw32/13.2.0/lto-wrapper.exe]
+        ignore line: [OFFLOAD_TARGET_NAMES=nvptx-none]
+        ignore line: [Target: x86_64-w64-mingw32]
+        ignore line: [Configured with: ../configure --prefix=/R/winlibs64ucrt_stage/inst_gcc-13.2.0/share/gcc --build=x86_64-w64-mingw32 --host=x86_64-w64-mingw32 --enable-offload-targets=nvptx-none --with-pkgversion='MinGW-W64 x86_64-ucrt-posix-seh, built by Brecht Sanders, r5' --with-tune=generic --enable-checking=release --enable-threads=posix --disable-sjlj-exceptions --disable-libunwind-exceptions --disable-serial-configure --disable-bootstrap --enable-host-shared --enable-plugin --disable-default-ssp --disable-rpath --disable-libstdcxx-debug --disable-version-specific-runtime-libs --with-stabs --disable-symvers --enable-languages=c,c++,fortran,lto,objc,obj-c++ --disable-gold --disable-nls --disable-stage1-checking --disable-win32-registry --disable-multilib --enable-ld --enable-libquadmath --enable-libada --enable-libssp --enable-libstdcxx --enable-lto --enable-fully-dynamic-string --enable-libgomp --enable-graphite --enable-mingw-wildcard --enable-libstdcxx-time --enable-libstdcxx-pch --with-mpc=/d/Prog/winlibs64ucrt_stage/custombuilt --with-mpfr=/d/Prog/winlibs64ucrt_stage/custombuilt --with-gmp=/d/Prog/winlibs64ucrt_stage/custombuilt --with-isl=/d/Prog/winlibs64ucrt_stage/custombuilt --disable-libstdcxx-backtrace --enable-install-libiberty --enable-__cxa_atexit --without-included-gettext --with-diagnostics-color=auto --enable-clocale=generic --with-libiconv --with-system-zlib --with-build-sysroot=/R/winlibs64ucrt_stage/gcc-13.2.0/build_mingw/mingw-w64 CFLAGS='-I/d/Prog/winlibs64ucrt_stage/custombuilt/include/libdl-win32   -march=nocona -msahf -mtune=generic -O2' CXXFLAGS='-Wno-int-conversion  -march=nocona -msahf -mtune=generic -O2' LDFLAGS='-pthread -Wl,--no-insert-timestamp -Wl,--dynamicbase -Wl,--high-entropy-va -Wl,--nxcompat -Wl,--tsaware' LD=/d/Prog/winlibs64ucrt_stage/custombuilt/share/binutils/bin/ld.exe]
+        ignore line: [Thread model: posix]
+        ignore line: [Supported LTO compression algorithms: zlib zstd]
+        ignore line: [gcc version 13.2.0 (MinGW-W64 x86_64-ucrt-posix-seh  built by Brecht Sanders  r5) ]
+        ignore line: [COMPILER_PATH=C:/mingw64/bin/../libexec/gcc/x86_64-w64-mingw32/13.2.0/]
+        ignore line: [C:/mingw64/bin/../libexec/gcc/]
+        ignore line: [C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../x86_64-w64-mingw32/bin/]
+        ignore line: [LIBRARY_PATH=C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/]
+        ignore line: [C:/mingw64/bin/../lib/gcc/]
+        ignore line: [C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../x86_64-w64-mingw32/lib/../lib/]
+        ignore line: [C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../lib/]
+        ignore line: [C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../x86_64-w64-mingw32/lib/]
+        ignore line: [C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../]
+        ignore line: [COLLECT_GCC_OPTIONS='-v' '-o' 'cmTC_e8c03.exe' '-mtune=generic' '-march=x86-64' '-dumpdir' 'cmTC_e8c03.']
+        link line: [ C:/mingw64/bin/../libexec/gcc/x86_64-w64-mingw32/13.2.0/collect2.exe -plugin C:/mingw64/bin/../libexec/gcc/x86_64-w64-mingw32/13.2.0/liblto_plugin.dll -plugin-opt=C:/mingw64/bin/../libexec/gcc/x86_64-w64-mingw32/13.2.0/lto-wrapper.exe -plugin-opt=-fresolution=C:\\Users\\simko\\AppData\\Local\\Temp\\ccvQWfYs.res -plugin-opt=-pass-through=-lmingw32 -plugin-opt=-pass-through=-lgcc -plugin-opt=-pass-through=-lgcc_eh -plugin-opt=-pass-through=-lmoldname -plugin-opt=-pass-through=-lmingwex -plugin-opt=-pass-through=-lmsvcrt -plugin-opt=-pass-through=-lkernel32 -plugin-opt=-pass-through=-lpthread -plugin-opt=-pass-through=-ladvapi32 -plugin-opt=-pass-through=-lshell32 -plugin-opt=-pass-through=-luser32 -plugin-opt=-pass-through=-lkernel32 -plugin-opt=-pass-through=-lmingw32 -plugin-opt=-pass-through=-lgcc -plugin-opt=-pass-through=-lgcc_eh -plugin-opt=-pass-through=-lmoldname -plugin-opt=-pass-through=-lmingwex -plugin-opt=-pass-through=-lmsvcrt -plugin-opt=-pass-through=-lkernel32 -m i386pep -Bdynamic -o cmTC_e8c03.exe C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../x86_64-w64-mingw32/lib/../lib/crt2.o C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/crtbegin.o -LC:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0 -LC:/mingw64/bin/../lib/gcc -LC:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../x86_64-w64-mingw32/lib/../lib -LC:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../lib -LC:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../x86_64-w64-mingw32/lib -LC:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../.. --whole-archive CMakeFiles\\cmTC_e8c03.dir/objects.a --no-whole-archive --out-implib libcmTC_e8c03.dll.a --major-image-version 0 --minor-image-version 0 -lmingw32 -lgcc -lgcc_eh -lmoldname -lmingwex -lmsvcrt -lkernel32 -lpthread -ladvapi32 -lshell32 -luser32 -lkernel32 -lmingw32 -lgcc -lgcc_eh -lmoldname -lmingwex -lmsvcrt -lkernel32 C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/crtend.o]
+          arg [C:/mingw64/bin/../libexec/gcc/x86_64-w64-mingw32/13.2.0/collect2.exe] ==> ignore
+          arg [-plugin] ==> ignore
+          arg [C:/mingw64/bin/../libexec/gcc/x86_64-w64-mingw32/13.2.0/liblto_plugin.dll] ==> ignore
+          arg [-plugin-opt=C:/mingw64/bin/../libexec/gcc/x86_64-w64-mingw32/13.2.0/lto-wrapper.exe] ==> ignore
+          arg [-plugin-opt=-fresolution=C:\\Users\\simko\\AppData\\Local\\Temp\\ccvQWfYs.res] ==> ignore
+          arg [-plugin-opt=-pass-through=-lmingw32] ==> ignore
+          arg [-plugin-opt=-pass-through=-lgcc] ==> ignore
+          arg [-plugin-opt=-pass-through=-lgcc_eh] ==> ignore
+          arg [-plugin-opt=-pass-through=-lmoldname] ==> ignore
+          arg [-plugin-opt=-pass-through=-lmingwex] ==> ignore
+          arg [-plugin-opt=-pass-through=-lmsvcrt] ==> ignore
+          arg [-plugin-opt=-pass-through=-lkernel32] ==> ignore
+          arg [-plugin-opt=-pass-through=-lpthread] ==> ignore
+          arg [-plugin-opt=-pass-through=-ladvapi32] ==> ignore
+          arg [-plugin-opt=-pass-through=-lshell32] ==> ignore
+          arg [-plugin-opt=-pass-through=-luser32] ==> ignore
+          arg [-plugin-opt=-pass-through=-lkernel32] ==> ignore
+          arg [-plugin-opt=-pass-through=-lmingw32] ==> ignore
+          arg [-plugin-opt=-pass-through=-lgcc] ==> ignore
+          arg [-plugin-opt=-pass-through=-lgcc_eh] ==> ignore
+          arg [-plugin-opt=-pass-through=-lmoldname] ==> ignore
+          arg [-plugin-opt=-pass-through=-lmingwex] ==> ignore
+          arg [-plugin-opt=-pass-through=-lmsvcrt] ==> ignore
+          arg [-plugin-opt=-pass-through=-lkernel32] ==> ignore
+          arg [-m] ==> ignore
+          arg [i386pep] ==> ignore
+          arg [-Bdynamic] ==> search dynamic
+          arg [-o] ==> ignore
+          arg [cmTC_e8c03.exe] ==> ignore
+          arg [C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../x86_64-w64-mingw32/lib/../lib/crt2.o] ==> obj [C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../x86_64-w64-mingw32/lib/../lib/crt2.o]
+          arg [C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/crtbegin.o] ==> obj [C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/crtbegin.o]
+          arg [-LC:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0] ==> dir [C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0]
+          arg [-LC:/mingw64/bin/../lib/gcc] ==> dir [C:/mingw64/bin/../lib/gcc]
+          arg [-LC:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../x86_64-w64-mingw32/lib/../lib] ==> dir [C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../x86_64-w64-mingw32/lib/../lib]
+          arg [-LC:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../lib] ==> dir [C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../lib]
+          arg [-LC:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../x86_64-w64-mingw32/lib] ==> dir [C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../x86_64-w64-mingw32/lib]
+          arg [-LC:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../..] ==> dir [C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../..]
+          arg [--whole-archive] ==> ignore
+          arg [CMakeFiles\\cmTC_e8c03.dir/objects.a] ==> ignore
+          arg [--no-whole-archive] ==> ignore
+          arg [--out-implib] ==> ignore
+          arg [libcmTC_e8c03.dll.a] ==> ignore
+          arg [--major-image-version] ==> ignore
+          arg [0] ==> ignore
+          arg [--minor-image-version] ==> ignore
+          arg [0] ==> ignore
+          arg [-lmingw32] ==> lib [mingw32]
+          arg [-lgcc] ==> lib [gcc]
+          arg [-lgcc_eh] ==> lib [gcc_eh]
+          arg [-lmoldname] ==> lib [moldname]
+          arg [-lmingwex] ==> lib [mingwex]
+          arg [-lmsvcrt] ==> lib [msvcrt]
+          arg [-lkernel32] ==> lib [kernel32]
+          arg [-lpthread] ==> lib [pthread]
+          arg [-ladvapi32] ==> lib [advapi32]
+          arg [-lshell32] ==> lib [shell32]
+          arg [-luser32] ==> lib [user32]
+          arg [-lkernel32] ==> lib [kernel32]
+          arg [-lmingw32] ==> lib [mingw32]
+          arg [-lgcc] ==> lib [gcc]
+          arg [-lgcc_eh] ==> lib [gcc_eh]
+          arg [-lmoldname] ==> lib [moldname]
+          arg [-lmingwex] ==> lib [mingwex]
+          arg [-lmsvcrt] ==> lib [msvcrt]
+          arg [-lkernel32] ==> lib [kernel32]
+          arg [C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/crtend.o] ==> obj [C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/crtend.o]
+        remove lib [gcc_eh]
+        remove lib [msvcrt]
+        remove lib [gcc_eh]
+        remove lib [msvcrt]
+        collapse obj [C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../x86_64-w64-mingw32/lib/../lib/crt2.o] ==> [C:/mingw64/x86_64-w64-mingw32/lib/crt2.o]
+        collapse obj [C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/crtbegin.o] ==> [C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/crtbegin.o]
+        collapse obj [C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/crtend.o] ==> [C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/crtend.o]
+        collapse library dir [C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0] ==> [C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0]
+        collapse library dir [C:/mingw64/bin/../lib/gcc] ==> [C:/mingw64/lib/gcc]
+        collapse library dir [C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../x86_64-w64-mingw32/lib/../lib] ==> [C:/mingw64/x86_64-w64-mingw32/lib]
+        collapse library dir [C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../lib] ==> [C:/mingw64/lib]
+        collapse library dir [C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../x86_64-w64-mingw32/lib] ==> [C:/mingw64/x86_64-w64-mingw32/lib]
+        collapse library dir [C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../..] ==> [C:/mingw64/lib]
+        implicit libs: [mingw32;gcc;moldname;mingwex;kernel32;pthread;advapi32;shell32;user32;kernel32;mingw32;gcc;moldname;mingwex;kernel32]
+        implicit objs: [C:/mingw64/x86_64-w64-mingw32/lib/crt2.o;C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/crtbegin.o;C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/crtend.o]
+        implicit dirs: [C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0;C:/mingw64/lib/gcc;C:/mingw64/x86_64-w64-mingw32/lib;C:/mingw64/lib]
+        implicit fwks: []
+      
+      
+  -
+    kind: "try_compile-v1"
+    backtrace:
+      - "C:/mingw64/share/cmake-3.28/Modules/CMakeDetermineCompilerABI.cmake:57 (try_compile)"
+      - "C:/mingw64/share/cmake-3.28/Modules/CMakeTestCXXCompiler.cmake:26 (CMAKE_DETERMINE_COMPILER_ABI)"
+      - "CMakeLists.txt:9 (project)"
+    checks:
+      - "Detecting CXX compiler ABI info"
+    directories:
+      source: "D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/CMakeFiles/CMakeScratch/TryCompile-mcbgwq"
+      binary: "D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/CMakeFiles/CMakeScratch/TryCompile-mcbgwq"
+    cmakeVariables:
+      CMAKE_CXX_FLAGS: ""
+      CMAKE_CXX_FLAGS_DEBUG: "-g"
+      CMAKE_EXE_LINKER_FLAGS: ""
+    buildResult:
+      variable: "CMAKE_CXX_ABI_COMPILED"
+      cached: true
+      stdout: |
+        Change Dir: 'D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/CMakeFiles/CMakeScratch/TryCompile-mcbgwq'
+        
+        Run Build Command(s): C:/mingw64/bin/cmake.exe -E env VERBOSE=1 C:/mingw64/bin/mingw32-make.exe -f Makefile cmTC_d3ce1/fast
+        C:/mingw64/bin/mingw32-make.exe  -f CMakeFiles\\cmTC_d3ce1.dir\\build.make CMakeFiles/cmTC_d3ce1.dir/build
+        mingw32-make[1]: Entering directory 'D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/CMakeFiles/CMakeScratch/TryCompile-mcbgwq'
+        Building CXX object CMakeFiles/cmTC_d3ce1.dir/CMakeCXXCompilerABI.cpp.obj
+        C:\\mingw64\\bin\\gcc.exe   -v -o CMakeFiles\\cmTC_d3ce1.dir\\CMakeCXXCompilerABI.cpp.obj -c C:\\mingw64\\share\\cmake-3.28\\Modules\\CMakeCXXCompilerABI.cpp
+        Using built-in specs.
+        COLLECT_GCC=C:\\mingw64\\bin\\gcc.exe
+        OFFLOAD_TARGET_NAMES=nvptx-none
+        Target: x86_64-w64-mingw32
+        Configured with: ../configure --prefix=/R/winlibs64ucrt_stage/inst_gcc-13.2.0/share/gcc --build=x86_64-w64-mingw32 --host=x86_64-w64-mingw32 --enable-offload-targets=nvptx-none --with-pkgversion='MinGW-W64 x86_64-ucrt-posix-seh, built by Brecht Sanders, r5' --with-tune=generic --enable-checking=release --enable-threads=posix --disable-sjlj-exceptions --disable-libunwind-exceptions --disable-serial-configure --disable-bootstrap --enable-host-shared --enable-plugin --disable-default-ssp --disable-rpath --disable-libstdcxx-debug --disable-version-specific-runtime-libs --with-stabs --disable-symvers --enable-languages=c,c++,fortran,lto,objc,obj-c++ --disable-gold --disable-nls --disable-stage1-checking --disable-win32-registry --disable-multilib --enable-ld --enable-libquadmath --enable-libada --enable-libssp --enable-libstdcxx --enable-lto --enable-fully-dynamic-string --enable-libgomp --enable-graphite --enable-mingw-wildcard --enable-libstdcxx-time --enable-libstdcxx-pch --with-mpc=/d/Prog/winlibs64ucrt_stage/custombuilt --with-mpfr=/d/Prog/winlibs64ucrt_stage/custombuilt --with-gmp=/d/Prog/winlibs64ucrt_stage/custombuilt --with-isl=/d/Prog/winlibs64ucrt_stage/custombuilt --disable-libstdcxx-backtrace --enable-install-libiberty --enable-__cxa_atexit --without-included-gettext --with-diagnostics-color=auto --enable-clocale=generic --with-libiconv --with-system-zlib --with-build-sysroot=/R/winlibs64ucrt_stage/gcc-13.2.0/build_mingw/mingw-w64 CFLAGS='-I/d/Prog/winlibs64ucrt_stage/custombuilt/include/libdl-win32   -march=nocona -msahf -mtune=generic -O2' CXXFLAGS='-Wno-int-conversion  -march=nocona -msahf -mtune=generic -O2' LDFLAGS='-pthread -Wl,--no-insert-timestamp -Wl,--dynamicbase -Wl,--high-entropy-va -Wl,--nxcompat -Wl,--tsaware' LD=/d/Prog/winlibs64ucrt_stage/custombuilt/share/binutils/bin/ld.exe
+        Thread model: posix
+        Supported LTO compression algorithms: zlib zstd
+        gcc version 13.2.0 (MinGW-W64 x86_64-ucrt-posix-seh, built by Brecht Sanders, r5) 
+        COLLECT_GCC_OPTIONS='-v' '-o' 'CMakeFiles\\cmTC_d3ce1.dir\\CMakeCXXCompilerABI.cpp.obj' '-c' '-mtune=generic' '-march=x86-64' '-dumpdir' 'CMakeFiles\\cmTC_d3ce1.dir\\'
+         C:/mingw64/bin/../libexec/gcc/x86_64-w64-mingw32/13.2.0/cc1plus.exe -quiet -v -iprefix C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/ -D_REENTRANT C:\\mingw64\\share\\cmake-3.28\\Modules\\CMakeCXXCompilerABI.cpp -quiet -dumpdir CMakeFiles\\cmTC_d3ce1.dir\\ -dumpbase CMakeCXXCompilerABI.cpp.cpp -dumpbase-ext .cpp -mtune=generic -march=x86-64 -version -o C:\\Users\\simko\\AppData\\Local\\Temp\\ccX2dQ6R.s
+        GNU C++17 (MinGW-W64 x86_64-ucrt-posix-seh, built by Brecht Sanders, r5) version 13.2.0 (x86_64-w64-mingw32)
+        	compiled by GNU C version 13.2.0, GMP version 6.3.0, MPFR version 4.2.1, MPC version 1.3.1, isl version isl-0.26-GMP
+        
+        GGC heuristics: --param ggc-min-expand=100 --param ggc-min-heapsize=131072
+        ignoring duplicate directory "C:/mingw64/lib/gcc/../../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../include/c++/13.2.0"
+        ignoring duplicate directory "C:/mingw64/lib/gcc/../../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../include/c++/13.2.0/x86_64-w64-mingw32"
+        ignoring duplicate directory "C:/mingw64/lib/gcc/../../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../include/c++/13.2.0/backward"
+        ignoring duplicate directory "C:/mingw64/lib/gcc/../../lib/gcc/x86_64-w64-mingw32/13.2.0/include"
+        ignoring nonexistent directory "R:/winlibs64ucrt_stage/inst_gcc-13.2.0/share/gcc/include"
+        ignoring nonexistent directory "/R/winlibs64ucrt_stage/inst_gcc-13.2.0/share/gcc/include"
+        ignoring duplicate directory "C:/mingw64/lib/gcc/../../lib/gcc/x86_64-w64-mingw32/13.2.0/include-fixed"
+        ignoring duplicate directory "C:/mingw64/lib/gcc/../../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../x86_64-w64-mingw32/include"
+        ignoring nonexistent directory "/mingw/include"
+        #include "..." search starts here:
+        #include <...> search starts here:
+         C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../include/c++/13.2.0
+         C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../include/c++/13.2.0/x86_64-w64-mingw32
+         C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../include/c++/13.2.0/backward
+         C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/include
+         C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../include
+         C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/include-fixed
+         C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../x86_64-w64-mingw32/include
+        End of search list.
+        Compiler executable checksum: 6327a8e4b2efaceec00a9874ea909a3f
+        COLLECT_GCC_OPTIONS='-v' '-o' 'CMakeFiles\\cmTC_d3ce1.dir\\CMakeCXXCompilerABI.cpp.obj' '-c' '-mtune=generic' '-march=x86-64' '-dumpdir' 'CMakeFiles\\cmTC_d3ce1.dir\\'
+         C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../x86_64-w64-mingw32/bin/as.exe -v -o CMakeFiles\\cmTC_d3ce1.dir\\CMakeCXXCompilerABI.cpp.obj C:\\Users\\simko\\AppData\\Local\\Temp\\ccX2dQ6R.s
+        GNU assembler version 2.42 (x86_64-w64-mingw32) using BFD version (Binutils for MinGW-W64 x86_64, built by Brecht Sanders, r5) 2.42
+        COMPILER_PATH=C:/mingw64/bin/../libexec/gcc/x86_64-w64-mingw32/13.2.0/;C:/mingw64/bin/../libexec/gcc/;C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../x86_64-w64-mingw32/bin/
+        LIBRARY_PATH=C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/;C:/mingw64/bin/../lib/gcc/;C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../x86_64-w64-mingw32/lib/../lib/;C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../lib/;C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../x86_64-w64-mingw32/lib/;C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../
+        COLLECT_GCC_OPTIONS='-v' '-o' 'CMakeFiles\\cmTC_d3ce1.dir\\CMakeCXXCompilerABI.cpp.obj' '-c' '-mtune=generic' '-march=x86-64' '-dumpdir' 'CMakeFiles\\cmTC_d3ce1.dir\\CMakeCXXCompilerABI.cpp.'
+        Linking CXX executable cmTC_d3ce1.exe
+        C:\\mingw64\\bin\\cmake.exe -E cmake_link_script CMakeFiles\\cmTC_d3ce1.dir\\link.txt --verbose=1
+        C:\\mingw64\\bin\\cmake.exe -E rm -f CMakeFiles\\cmTC_d3ce1.dir/objects.a
+        C:\\mingw64\\bin\\ar.exe qc CMakeFiles\\cmTC_d3ce1.dir/objects.a @CMakeFiles\\cmTC_d3ce1.dir\\objects1.rsp
+        C:\\mingw64\\bin\\gcc.exe  -v -Wl,--whole-archive CMakeFiles\\cmTC_d3ce1.dir/objects.a -Wl,--no-whole-archive -o cmTC_d3ce1.exe -Wl,--out-implib,libcmTC_d3ce1.dll.a -Wl,--major-image-version,0,--minor-image-version,0 
+        Using built-in specs.
+        COLLECT_GCC=C:\\mingw64\\bin\\gcc.exe
+        COLLECT_LTO_WRAPPER=C:/mingw64/bin/../libexec/gcc/x86_64-w64-mingw32/13.2.0/lto-wrapper.exe
+        OFFLOAD_TARGET_NAMES=nvptx-none
+        Target: x86_64-w64-mingw32
+        Configured with: ../configure --prefix=/R/winlibs64ucrt_stage/inst_gcc-13.2.0/share/gcc --build=x86_64-w64-mingw32 --host=x86_64-w64-mingw32 --enable-offload-targets=nvptx-none --with-pkgversion='MinGW-W64 x86_64-ucrt-posix-seh, built by Brecht Sanders, r5' --with-tune=generic --enable-checking=release --enable-threads=posix --disable-sjlj-exceptions --disable-libunwind-exceptions --disable-serial-configure --disable-bootstrap --enable-host-shared --enable-plugin --disable-default-ssp --disable-rpath --disable-libstdcxx-debug --disable-version-specific-runtime-libs --with-stabs --disable-symvers --enable-languages=c,c++,fortran,lto,objc,obj-c++ --disable-gold --disable-nls --disable-stage1-checking --disable-win32-registry --disable-multilib --enable-ld --enable-libquadmath --enable-libada --enable-libssp --enable-libstdcxx --enable-lto --enable-fully-dynamic-string --enable-libgomp --enable-graphite --enable-mingw-wildcard --enable-libstdcxx-time --enable-libstdcxx-pch --with-mpc=/d/Prog/winlibs64ucrt_stage/custombuilt --with-mpfr=/d/Prog/winlibs64ucrt_stage/custombuilt --with-gmp=/d/Prog/winlibs64ucrt_stage/custombuilt --with-isl=/d/Prog/winlibs64ucrt_stage/custombuilt --disable-libstdcxx-backtrace --enable-install-libiberty --enable-__cxa_atexit --without-included-gettext --with-diagnostics-color=auto --enable-clocale=generic --with-libiconv --with-system-zlib --with-build-sysroot=/R/winlibs64ucrt_stage/gcc-13.2.0/build_mingw/mingw-w64 CFLAGS='-I/d/Prog/winlibs64ucrt_stage/custombuilt/include/libdl-win32   -march=nocona -msahf -mtune=generic -O2' CXXFLAGS='-Wno-int-conversion  -march=nocona -msahf -mtune=generic -O2' LDFLAGS='-pthread -Wl,--no-insert-timestamp -Wl,--dynamicbase -Wl,--high-entropy-va -Wl,--nxcompat -Wl,--tsaware' LD=/d/Prog/winlibs64ucrt_stage/custombuilt/share/binutils/bin/ld.exe
+        Thread model: posix
+        Supported LTO compression algorithms: zlib zstd
+        gcc version 13.2.0 (MinGW-W64 x86_64-ucrt-posix-seh, built by Brecht Sanders, r5) 
+        COMPILER_PATH=C:/mingw64/bin/../libexec/gcc/x86_64-w64-mingw32/13.2.0/;C:/mingw64/bin/../libexec/gcc/;C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../x86_64-w64-mingw32/bin/
+        LIBRARY_PATH=C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/;C:/mingw64/bin/../lib/gcc/;C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../x86_64-w64-mingw32/lib/../lib/;C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../lib/;C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../x86_64-w64-mingw32/lib/;C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../
+        COLLECT_GCC_OPTIONS='-v' '-o' 'cmTC_d3ce1.exe' '-mtune=generic' '-march=x86-64' '-dumpdir' 'cmTC_d3ce1.'
+         C:/mingw64/bin/../libexec/gcc/x86_64-w64-mingw32/13.2.0/collect2.exe -plugin C:/mingw64/bin/../libexec/gcc/x86_64-w64-mingw32/13.2.0/liblto_plugin.dll -plugin-opt=C:/mingw64/bin/../libexec/gcc/x86_64-w64-mingw32/13.2.0/lto-wrapper.exe -plugin-opt=-fresolution=C:\\Users\\simko\\AppData\\Local\\Temp\\ccra7b3X.res -plugin-opt=-pass-through=-lmingw32 -plugin-opt=-pass-through=-lgcc -plugin-opt=-pass-through=-lgcc_eh -plugin-opt=-pass-through=-lmoldname -plugin-opt=-pass-through=-lmingwex -plugin-opt=-pass-through=-lmsvcrt -plugin-opt=-pass-through=-lkernel32 -plugin-opt=-pass-through=-lpthread -plugin-opt=-pass-through=-ladvapi32 -plugin-opt=-pass-through=-lshell32 -plugin-opt=-pass-through=-luser32 -plugin-opt=-pass-through=-lkernel32 -plugin-opt=-pass-through=-lmingw32 -plugin-opt=-pass-through=-lgcc -plugin-opt=-pass-through=-lgcc_eh -plugin-opt=-pass-through=-lmoldname -plugin-opt=-pass-through=-lmingwex -plugin-opt=-pass-through=-lmsvcrt -plugin-opt=-pass-through=-lkernel32 -m i386pep -Bdynamic -o cmTC_d3ce1.exe C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../x86_64-w64-mingw32/lib/../lib/crt2.o C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/crtbegin.o -LC:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0 -LC:/mingw64/bin/../lib/gcc -LC:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../x86_64-w64-mingw32/lib/../lib -LC:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../lib -LC:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../x86_64-w64-mingw32/lib -LC:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../.. --whole-archive CMakeFiles\\cmTC_d3ce1.dir/objects.a --no-whole-archive --out-implib libcmTC_d3ce1.dll.a --major-image-version 0 --minor-image-version 0 -lmingw32 -lgcc -lgcc_eh -lmoldname -lmingwex -lmsvcrt -lkernel32 -lpthread -ladvapi32 -lshell32 -luser32 -lkernel32 -lmingw32 -lgcc -lgcc_eh -lmoldname -lmingwex -lmsvcrt -lkernel32 C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/crtend.o
+        COLLECT_GCC_OPTIONS='-v' '-o' 'cmTC_d3ce1.exe' '-mtune=generic' '-march=x86-64' '-dumpdir' 'cmTC_d3ce1.'
+        mingw32-make[1]: Leaving directory 'D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/CMakeFiles/CMakeScratch/TryCompile-mcbgwq'
+        
+      exitCode: 0
+  -
+    kind: "message-v1"
+    backtrace:
+      - "C:/mingw64/share/cmake-3.28/Modules/CMakeDetermineCompilerABI.cmake:127 (message)"
+      - "C:/mingw64/share/cmake-3.28/Modules/CMakeTestCXXCompiler.cmake:26 (CMAKE_DETERMINE_COMPILER_ABI)"
+      - "CMakeLists.txt:9 (project)"
+    message: |
+      Parsed CXX implicit include dir info: rv=done
+        found start of include info
+        found start of implicit include info
+          add: [C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../include/c++/13.2.0]
+          add: [C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../include/c++/13.2.0/x86_64-w64-mingw32]
+          add: [C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../include/c++/13.2.0/backward]
+          add: [C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/include]
+          add: [C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../include]
+          add: [C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/include-fixed]
+          add: [C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../x86_64-w64-mingw32/include]
+        end of search list found
+        collapse include dir [C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../include/c++/13.2.0] ==> [C:/mingw64/include/c++/13.2.0]
+        collapse include dir [C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../include/c++/13.2.0/x86_64-w64-mingw32] ==> [C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32]
+        collapse include dir [C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../include/c++/13.2.0/backward] ==> [C:/mingw64/include/c++/13.2.0/backward]
+        collapse include dir [C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/include] ==> [C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include]
+        collapse include dir [C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../include] ==> [C:/mingw64/include]
+        collapse include dir [C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/include-fixed] ==> [C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include-fixed]
+        collapse include dir [C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../x86_64-w64-mingw32/include] ==> [C:/mingw64/x86_64-w64-mingw32/include]
+        implicit include dirs: [C:/mingw64/include/c++/13.2.0;C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32;C:/mingw64/include/c++/13.2.0/backward;C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include;C:/mingw64/include;C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include-fixed;C:/mingw64/x86_64-w64-mingw32/include]
+      
+      
+  -
+    kind: "message-v1"
+    backtrace:
+      - "C:/mingw64/share/cmake-3.28/Modules/CMakeDetermineCompilerABI.cmake:159 (message)"
+      - "C:/mingw64/share/cmake-3.28/Modules/CMakeTestCXXCompiler.cmake:26 (CMAKE_DETERMINE_COMPILER_ABI)"
+      - "CMakeLists.txt:9 (project)"
+    message: |
+      Parsed CXX implicit link information:
+        link line regex: [^( *|.*[/\\])(ld\\.exe|CMAKE_LINK_STARTFILE-NOTFOUND|([^/\\]+-)?ld|collect2)[^/\\]*( |$)]
+        ignore line: [Change Dir: 'D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/CMakeFiles/CMakeScratch/TryCompile-mcbgwq']
+        ignore line: []
+        ignore line: [Run Build Command(s): C:/mingw64/bin/cmake.exe -E env VERBOSE=1 C:/mingw64/bin/mingw32-make.exe -f Makefile cmTC_d3ce1/fast]
+        ignore line: [C:/mingw64/bin/mingw32-make.exe  -f CMakeFiles\\cmTC_d3ce1.dir\\build.make CMakeFiles/cmTC_d3ce1.dir/build]
+        ignore line: [mingw32-make[1]: Entering directory 'D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/CMakeFiles/CMakeScratch/TryCompile-mcbgwq']
+        ignore line: [Building CXX object CMakeFiles/cmTC_d3ce1.dir/CMakeCXXCompilerABI.cpp.obj]
+        ignore line: [C:\\mingw64\\bin\\gcc.exe   -v -o CMakeFiles\\cmTC_d3ce1.dir\\CMakeCXXCompilerABI.cpp.obj -c C:\\mingw64\\share\\cmake-3.28\\Modules\\CMakeCXXCompilerABI.cpp]
+        ignore line: [Using built-in specs.]
+        ignore line: [COLLECT_GCC=C:\\mingw64\\bin\\gcc.exe]
+        ignore line: [OFFLOAD_TARGET_NAMES=nvptx-none]
+        ignore line: [Target: x86_64-w64-mingw32]
+        ignore line: [Configured with: ../configure --prefix=/R/winlibs64ucrt_stage/inst_gcc-13.2.0/share/gcc --build=x86_64-w64-mingw32 --host=x86_64-w64-mingw32 --enable-offload-targets=nvptx-none --with-pkgversion='MinGW-W64 x86_64-ucrt-posix-seh, built by Brecht Sanders, r5' --with-tune=generic --enable-checking=release --enable-threads=posix --disable-sjlj-exceptions --disable-libunwind-exceptions --disable-serial-configure --disable-bootstrap --enable-host-shared --enable-plugin --disable-default-ssp --disable-rpath --disable-libstdcxx-debug --disable-version-specific-runtime-libs --with-stabs --disable-symvers --enable-languages=c,c++,fortran,lto,objc,obj-c++ --disable-gold --disable-nls --disable-stage1-checking --disable-win32-registry --disable-multilib --enable-ld --enable-libquadmath --enable-libada --enable-libssp --enable-libstdcxx --enable-lto --enable-fully-dynamic-string --enable-libgomp --enable-graphite --enable-mingw-wildcard --enable-libstdcxx-time --enable-libstdcxx-pch --with-mpc=/d/Prog/winlibs64ucrt_stage/custombuilt --with-mpfr=/d/Prog/winlibs64ucrt_stage/custombuilt --with-gmp=/d/Prog/winlibs64ucrt_stage/custombuilt --with-isl=/d/Prog/winlibs64ucrt_stage/custombuilt --disable-libstdcxx-backtrace --enable-install-libiberty --enable-__cxa_atexit --without-included-gettext --with-diagnostics-color=auto --enable-clocale=generic --with-libiconv --with-system-zlib --with-build-sysroot=/R/winlibs64ucrt_stage/gcc-13.2.0/build_mingw/mingw-w64 CFLAGS='-I/d/Prog/winlibs64ucrt_stage/custombuilt/include/libdl-win32   -march=nocona -msahf -mtune=generic -O2' CXXFLAGS='-Wno-int-conversion  -march=nocona -msahf -mtune=generic -O2' LDFLAGS='-pthread -Wl,--no-insert-timestamp -Wl,--dynamicbase -Wl,--high-entropy-va -Wl,--nxcompat -Wl,--tsaware' LD=/d/Prog/winlibs64ucrt_stage/custombuilt/share/binutils/bin/ld.exe]
+        ignore line: [Thread model: posix]
+        ignore line: [Supported LTO compression algorithms: zlib zstd]
+        ignore line: [gcc version 13.2.0 (MinGW-W64 x86_64-ucrt-posix-seh  built by Brecht Sanders  r5) ]
+        ignore line: [COLLECT_GCC_OPTIONS='-v' '-o' 'CMakeFiles\\cmTC_d3ce1.dir\\CMakeCXXCompilerABI.cpp.obj' '-c' '-mtune=generic' '-march=x86-64' '-dumpdir' 'CMakeFiles\\cmTC_d3ce1.dir\\']
+        ignore line: [ C:/mingw64/bin/../libexec/gcc/x86_64-w64-mingw32/13.2.0/cc1plus.exe -quiet -v -iprefix C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/ -D_REENTRANT C:\\mingw64\\share\\cmake-3.28\\Modules\\CMakeCXXCompilerABI.cpp -quiet -dumpdir CMakeFiles\\cmTC_d3ce1.dir\\ -dumpbase CMakeCXXCompilerABI.cpp.cpp -dumpbase-ext .cpp -mtune=generic -march=x86-64 -version -o C:\\Users\\simko\\AppData\\Local\\Temp\\ccX2dQ6R.s]
+        ignore line: [GNU C++17 (MinGW-W64 x86_64-ucrt-posix-seh  built by Brecht Sanders  r5) version 13.2.0 (x86_64-w64-mingw32)]
+        ignore line: [	compiled by GNU C version 13.2.0  GMP version 6.3.0  MPFR version 4.2.1  MPC version 1.3.1  isl version isl-0.26-GMP]
+        ignore line: []
+        ignore line: [GGC heuristics: --param ggc-min-expand=100 --param ggc-min-heapsize=131072]
+        ignore line: [ignoring duplicate directory "C:/mingw64/lib/gcc/../../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../include/c++/13.2.0"]
+        ignore line: [ignoring duplicate directory "C:/mingw64/lib/gcc/../../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../include/c++/13.2.0/x86_64-w64-mingw32"]
+        ignore line: [ignoring duplicate directory "C:/mingw64/lib/gcc/../../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../include/c++/13.2.0/backward"]
+        ignore line: [ignoring duplicate directory "C:/mingw64/lib/gcc/../../lib/gcc/x86_64-w64-mingw32/13.2.0/include"]
+        ignore line: [ignoring nonexistent directory "R:/winlibs64ucrt_stage/inst_gcc-13.2.0/share/gcc/include"]
+        ignore line: [ignoring nonexistent directory "/R/winlibs64ucrt_stage/inst_gcc-13.2.0/share/gcc/include"]
+        ignore line: [ignoring duplicate directory "C:/mingw64/lib/gcc/../../lib/gcc/x86_64-w64-mingw32/13.2.0/include-fixed"]
+        ignore line: [ignoring duplicate directory "C:/mingw64/lib/gcc/../../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../x86_64-w64-mingw32/include"]
+        ignore line: [ignoring nonexistent directory "/mingw/include"]
+        ignore line: [#include "..." search starts here:]
+        ignore line: [#include <...> search starts here:]
+        ignore line: [ C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../include/c++/13.2.0]
+        ignore line: [ C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../include/c++/13.2.0/x86_64-w64-mingw32]
+        ignore line: [ C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../include/c++/13.2.0/backward]
+        ignore line: [ C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/include]
+        ignore line: [ C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../include]
+        ignore line: [ C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/include-fixed]
+        ignore line: [ C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../x86_64-w64-mingw32/include]
+        ignore line: [End of search list.]
+        ignore line: [Compiler executable checksum: 6327a8e4b2efaceec00a9874ea909a3f]
+        ignore line: [COLLECT_GCC_OPTIONS='-v' '-o' 'CMakeFiles\\cmTC_d3ce1.dir\\CMakeCXXCompilerABI.cpp.obj' '-c' '-mtune=generic' '-march=x86-64' '-dumpdir' 'CMakeFiles\\cmTC_d3ce1.dir\\']
+        ignore line: [ C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../x86_64-w64-mingw32/bin/as.exe -v -o CMakeFiles\\cmTC_d3ce1.dir\\CMakeCXXCompilerABI.cpp.obj C:\\Users\\simko\\AppData\\Local\\Temp\\ccX2dQ6R.s]
+        ignore line: [GNU assembler version 2.42 (x86_64-w64-mingw32) using BFD version (Binutils for MinGW-W64 x86_64  built by Brecht Sanders  r5) 2.42]
+        ignore line: [COMPILER_PATH=C:/mingw64/bin/../libexec/gcc/x86_64-w64-mingw32/13.2.0/]
+        ignore line: [C:/mingw64/bin/../libexec/gcc/]
+        ignore line: [C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../x86_64-w64-mingw32/bin/]
+        ignore line: [LIBRARY_PATH=C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/]
+        ignore line: [C:/mingw64/bin/../lib/gcc/]
+        ignore line: [C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../x86_64-w64-mingw32/lib/../lib/]
+        ignore line: [C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../lib/]
+        ignore line: [C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../x86_64-w64-mingw32/lib/]
+        ignore line: [C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../]
+        ignore line: [COLLECT_GCC_OPTIONS='-v' '-o' 'CMakeFiles\\cmTC_d3ce1.dir\\CMakeCXXCompilerABI.cpp.obj' '-c' '-mtune=generic' '-march=x86-64' '-dumpdir' 'CMakeFiles\\cmTC_d3ce1.dir\\CMakeCXXCompilerABI.cpp.']
+        ignore line: [Linking CXX executable cmTC_d3ce1.exe]
+        ignore line: [C:\\mingw64\\bin\\cmake.exe -E cmake_link_script CMakeFiles\\cmTC_d3ce1.dir\\link.txt --verbose=1]
+        ignore line: [C:\\mingw64\\bin\\cmake.exe -E rm -f CMakeFiles\\cmTC_d3ce1.dir/objects.a]
+        ignore line: [C:\\mingw64\\bin\\ar.exe qc CMakeFiles\\cmTC_d3ce1.dir/objects.a @CMakeFiles\\cmTC_d3ce1.dir\\objects1.rsp]
+        ignore line: [C:\\mingw64\\bin\\gcc.exe  -v -Wl --whole-archive CMakeFiles\\cmTC_d3ce1.dir/objects.a -Wl --no-whole-archive -o cmTC_d3ce1.exe -Wl --out-implib libcmTC_d3ce1.dll.a -Wl --major-image-version 0 --minor-image-version 0 ]
+        ignore line: [Using built-in specs.]
+        ignore line: [COLLECT_GCC=C:\\mingw64\\bin\\gcc.exe]
+        ignore line: [COLLECT_LTO_WRAPPER=C:/mingw64/bin/../libexec/gcc/x86_64-w64-mingw32/13.2.0/lto-wrapper.exe]
+        ignore line: [OFFLOAD_TARGET_NAMES=nvptx-none]
+        ignore line: [Target: x86_64-w64-mingw32]
+        ignore line: [Configured with: ../configure --prefix=/R/winlibs64ucrt_stage/inst_gcc-13.2.0/share/gcc --build=x86_64-w64-mingw32 --host=x86_64-w64-mingw32 --enable-offload-targets=nvptx-none --with-pkgversion='MinGW-W64 x86_64-ucrt-posix-seh, built by Brecht Sanders, r5' --with-tune=generic --enable-checking=release --enable-threads=posix --disable-sjlj-exceptions --disable-libunwind-exceptions --disable-serial-configure --disable-bootstrap --enable-host-shared --enable-plugin --disable-default-ssp --disable-rpath --disable-libstdcxx-debug --disable-version-specific-runtime-libs --with-stabs --disable-symvers --enable-languages=c,c++,fortran,lto,objc,obj-c++ --disable-gold --disable-nls --disable-stage1-checking --disable-win32-registry --disable-multilib --enable-ld --enable-libquadmath --enable-libada --enable-libssp --enable-libstdcxx --enable-lto --enable-fully-dynamic-string --enable-libgomp --enable-graphite --enable-mingw-wildcard --enable-libstdcxx-time --enable-libstdcxx-pch --with-mpc=/d/Prog/winlibs64ucrt_stage/custombuilt --with-mpfr=/d/Prog/winlibs64ucrt_stage/custombuilt --with-gmp=/d/Prog/winlibs64ucrt_stage/custombuilt --with-isl=/d/Prog/winlibs64ucrt_stage/custombuilt --disable-libstdcxx-backtrace --enable-install-libiberty --enable-__cxa_atexit --without-included-gettext --with-diagnostics-color=auto --enable-clocale=generic --with-libiconv --with-system-zlib --with-build-sysroot=/R/winlibs64ucrt_stage/gcc-13.2.0/build_mingw/mingw-w64 CFLAGS='-I/d/Prog/winlibs64ucrt_stage/custombuilt/include/libdl-win32   -march=nocona -msahf -mtune=generic -O2' CXXFLAGS='-Wno-int-conversion  -march=nocona -msahf -mtune=generic -O2' LDFLAGS='-pthread -Wl,--no-insert-timestamp -Wl,--dynamicbase -Wl,--high-entropy-va -Wl,--nxcompat -Wl,--tsaware' LD=/d/Prog/winlibs64ucrt_stage/custombuilt/share/binutils/bin/ld.exe]
+        ignore line: [Thread model: posix]
+        ignore line: [Supported LTO compression algorithms: zlib zstd]
+        ignore line: [gcc version 13.2.0 (MinGW-W64 x86_64-ucrt-posix-seh  built by Brecht Sanders  r5) ]
+        ignore line: [COMPILER_PATH=C:/mingw64/bin/../libexec/gcc/x86_64-w64-mingw32/13.2.0/]
+        ignore line: [C:/mingw64/bin/../libexec/gcc/]
+        ignore line: [C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../x86_64-w64-mingw32/bin/]
+        ignore line: [LIBRARY_PATH=C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/]
+        ignore line: [C:/mingw64/bin/../lib/gcc/]
+        ignore line: [C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../x86_64-w64-mingw32/lib/../lib/]
+        ignore line: [C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../lib/]
+        ignore line: [C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../x86_64-w64-mingw32/lib/]
+        ignore line: [C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../]
+        ignore line: [COLLECT_GCC_OPTIONS='-v' '-o' 'cmTC_d3ce1.exe' '-mtune=generic' '-march=x86-64' '-dumpdir' 'cmTC_d3ce1.']
+        link line: [ C:/mingw64/bin/../libexec/gcc/x86_64-w64-mingw32/13.2.0/collect2.exe -plugin C:/mingw64/bin/../libexec/gcc/x86_64-w64-mingw32/13.2.0/liblto_plugin.dll -plugin-opt=C:/mingw64/bin/../libexec/gcc/x86_64-w64-mingw32/13.2.0/lto-wrapper.exe -plugin-opt=-fresolution=C:\\Users\\simko\\AppData\\Local\\Temp\\ccra7b3X.res -plugin-opt=-pass-through=-lmingw32 -plugin-opt=-pass-through=-lgcc -plugin-opt=-pass-through=-lgcc_eh -plugin-opt=-pass-through=-lmoldname -plugin-opt=-pass-through=-lmingwex -plugin-opt=-pass-through=-lmsvcrt -plugin-opt=-pass-through=-lkernel32 -plugin-opt=-pass-through=-lpthread -plugin-opt=-pass-through=-ladvapi32 -plugin-opt=-pass-through=-lshell32 -plugin-opt=-pass-through=-luser32 -plugin-opt=-pass-through=-lkernel32 -plugin-opt=-pass-through=-lmingw32 -plugin-opt=-pass-through=-lgcc -plugin-opt=-pass-through=-lgcc_eh -plugin-opt=-pass-through=-lmoldname -plugin-opt=-pass-through=-lmingwex -plugin-opt=-pass-through=-lmsvcrt -plugin-opt=-pass-through=-lkernel32 -m i386pep -Bdynamic -o cmTC_d3ce1.exe C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../x86_64-w64-mingw32/lib/../lib/crt2.o C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/crtbegin.o -LC:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0 -LC:/mingw64/bin/../lib/gcc -LC:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../x86_64-w64-mingw32/lib/../lib -LC:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../lib -LC:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../x86_64-w64-mingw32/lib -LC:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../.. --whole-archive CMakeFiles\\cmTC_d3ce1.dir/objects.a --no-whole-archive --out-implib libcmTC_d3ce1.dll.a --major-image-version 0 --minor-image-version 0 -lmingw32 -lgcc -lgcc_eh -lmoldname -lmingwex -lmsvcrt -lkernel32 -lpthread -ladvapi32 -lshell32 -luser32 -lkernel32 -lmingw32 -lgcc -lgcc_eh -lmoldname -lmingwex -lmsvcrt -lkernel32 C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/crtend.o]
+          arg [C:/mingw64/bin/../libexec/gcc/x86_64-w64-mingw32/13.2.0/collect2.exe] ==> ignore
+          arg [-plugin] ==> ignore
+          arg [C:/mingw64/bin/../libexec/gcc/x86_64-w64-mingw32/13.2.0/liblto_plugin.dll] ==> ignore
+          arg [-plugin-opt=C:/mingw64/bin/../libexec/gcc/x86_64-w64-mingw32/13.2.0/lto-wrapper.exe] ==> ignore
+          arg [-plugin-opt=-fresolution=C:\\Users\\simko\\AppData\\Local\\Temp\\ccra7b3X.res] ==> ignore
+          arg [-plugin-opt=-pass-through=-lmingw32] ==> ignore
+          arg [-plugin-opt=-pass-through=-lgcc] ==> ignore
+          arg [-plugin-opt=-pass-through=-lgcc_eh] ==> ignore
+          arg [-plugin-opt=-pass-through=-lmoldname] ==> ignore
+          arg [-plugin-opt=-pass-through=-lmingwex] ==> ignore
+          arg [-plugin-opt=-pass-through=-lmsvcrt] ==> ignore
+          arg [-plugin-opt=-pass-through=-lkernel32] ==> ignore
+          arg [-plugin-opt=-pass-through=-lpthread] ==> ignore
+          arg [-plugin-opt=-pass-through=-ladvapi32] ==> ignore
+          arg [-plugin-opt=-pass-through=-lshell32] ==> ignore
+          arg [-plugin-opt=-pass-through=-luser32] ==> ignore
+          arg [-plugin-opt=-pass-through=-lkernel32] ==> ignore
+          arg [-plugin-opt=-pass-through=-lmingw32] ==> ignore
+          arg [-plugin-opt=-pass-through=-lgcc] ==> ignore
+          arg [-plugin-opt=-pass-through=-lgcc_eh] ==> ignore
+          arg [-plugin-opt=-pass-through=-lmoldname] ==> ignore
+          arg [-plugin-opt=-pass-through=-lmingwex] ==> ignore
+          arg [-plugin-opt=-pass-through=-lmsvcrt] ==> ignore
+          arg [-plugin-opt=-pass-through=-lkernel32] ==> ignore
+          arg [-m] ==> ignore
+          arg [i386pep] ==> ignore
+          arg [-Bdynamic] ==> search dynamic
+          arg [-o] ==> ignore
+          arg [cmTC_d3ce1.exe] ==> ignore
+          arg [C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../x86_64-w64-mingw32/lib/../lib/crt2.o] ==> obj [C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../x86_64-w64-mingw32/lib/../lib/crt2.o]
+          arg [C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/crtbegin.o] ==> obj [C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/crtbegin.o]
+          arg [-LC:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0] ==> dir [C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0]
+          arg [-LC:/mingw64/bin/../lib/gcc] ==> dir [C:/mingw64/bin/../lib/gcc]
+          arg [-LC:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../x86_64-w64-mingw32/lib/../lib] ==> dir [C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../x86_64-w64-mingw32/lib/../lib]
+          arg [-LC:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../lib] ==> dir [C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../lib]
+          arg [-LC:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../x86_64-w64-mingw32/lib] ==> dir [C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../x86_64-w64-mingw32/lib]
+          arg [-LC:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../..] ==> dir [C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../..]
+          arg [--whole-archive] ==> ignore
+          arg [CMakeFiles\\cmTC_d3ce1.dir/objects.a] ==> ignore
+          arg [--no-whole-archive] ==> ignore
+          arg [--out-implib] ==> ignore
+          arg [libcmTC_d3ce1.dll.a] ==> ignore
+          arg [--major-image-version] ==> ignore
+          arg [0] ==> ignore
+          arg [--minor-image-version] ==> ignore
+          arg [0] ==> ignore
+          arg [-lmingw32] ==> lib [mingw32]
+          arg [-lgcc] ==> lib [gcc]
+          arg [-lgcc_eh] ==> lib [gcc_eh]
+          arg [-lmoldname] ==> lib [moldname]
+          arg [-lmingwex] ==> lib [mingwex]
+          arg [-lmsvcrt] ==> lib [msvcrt]
+          arg [-lkernel32] ==> lib [kernel32]
+          arg [-lpthread] ==> lib [pthread]
+          arg [-ladvapi32] ==> lib [advapi32]
+          arg [-lshell32] ==> lib [shell32]
+          arg [-luser32] ==> lib [user32]
+          arg [-lkernel32] ==> lib [kernel32]
+          arg [-lmingw32] ==> lib [mingw32]
+          arg [-lgcc] ==> lib [gcc]
+          arg [-lgcc_eh] ==> lib [gcc_eh]
+          arg [-lmoldname] ==> lib [moldname]
+          arg [-lmingwex] ==> lib [mingwex]
+          arg [-lmsvcrt] ==> lib [msvcrt]
+          arg [-lkernel32] ==> lib [kernel32]
+          arg [C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/crtend.o] ==> obj [C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/crtend.o]
+        remove lib [gcc_eh]
+        remove lib [msvcrt]
+        remove lib [gcc_eh]
+        remove lib [msvcrt]
+        collapse obj [C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../x86_64-w64-mingw32/lib/../lib/crt2.o] ==> [C:/mingw64/x86_64-w64-mingw32/lib/crt2.o]
+        collapse obj [C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/crtbegin.o] ==> [C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/crtbegin.o]
+        collapse obj [C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/crtend.o] ==> [C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/crtend.o]
+        collapse library dir [C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0] ==> [C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0]
+        collapse library dir [C:/mingw64/bin/../lib/gcc] ==> [C:/mingw64/lib/gcc]
+        collapse library dir [C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../x86_64-w64-mingw32/lib/../lib] ==> [C:/mingw64/x86_64-w64-mingw32/lib]
+        collapse library dir [C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../lib] ==> [C:/mingw64/lib]
+        collapse library dir [C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../../../x86_64-w64-mingw32/lib] ==> [C:/mingw64/x86_64-w64-mingw32/lib]
+        collapse library dir [C:/mingw64/bin/../lib/gcc/x86_64-w64-mingw32/13.2.0/../../..] ==> [C:/mingw64/lib]
+        implicit libs: [mingw32;gcc;moldname;mingwex;kernel32;pthread;advapi32;shell32;user32;kernel32;mingw32;gcc;moldname;mingwex;kernel32]
+        implicit objs: [C:/mingw64/x86_64-w64-mingw32/lib/crt2.o;C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/crtbegin.o;C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/crtend.o]
+        implicit dirs: [C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0;C:/mingw64/lib/gcc;C:/mingw64/x86_64-w64-mingw32/lib;C:/mingw64/lib]
+        implicit fwks: []
+      
+      
+...
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/CMakeDirectoryInformation.cmake b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/CMakeDirectoryInformation.cmake
new file mode 100644
index 0000000..af27e04
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/CMakeDirectoryInformation.cmake
@@ -0,0 +1,16 @@
+# CMAKE generated file: DO NOT EDIT!
+# Generated by "MinGW Makefiles" Generator, CMake Version 3.28
+
+# Relative path conversion top directories.
+set(CMAKE_RELATIVE_PATH_TOP_SOURCE "D:/DOKUMENTY/diplomovka-final/Scott-cpp-win")
+set(CMAKE_RELATIVE_PATH_TOP_BINARY "D:/DOKUMENTY/diplomovka-final/Scott-cpp-win")
+
+# Force unix paths in dependencies.
+set(CMAKE_FORCE_UNIX_PATHS 1)
+
+
+# The C and CXX include file regular expressions for this directory.
+set(CMAKE_C_INCLUDE_REGEX_SCAN "^.*$")
+set(CMAKE_C_INCLUDE_REGEX_COMPLAIN "^$")
+set(CMAKE_CXX_INCLUDE_REGEX_SCAN ${CMAKE_C_INCLUDE_REGEX_SCAN})
+set(CMAKE_CXX_INCLUDE_REGEX_COMPLAIN ${CMAKE_C_INCLUDE_REGEX_COMPLAIN})
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/Makefile.cmake b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/Makefile.cmake
new file mode 100644
index 0000000..af1a75c
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/Makefile.cmake
@@ -0,0 +1,56 @@
+# CMAKE generated file: DO NOT EDIT!
+# Generated by "MinGW Makefiles" Generator, CMake Version 3.28
+
+# The generator used is:
+set(CMAKE_DEPENDS_GENERATOR "MinGW Makefiles")
+
+# The top level Makefile was generated from the following files:
+set(CMAKE_MAKEFILE_DEPENDS
+  "CMakeCache.txt"
+  "C:/mingw64/share/cmake-3.28/Modules/CMakeCInformation.cmake"
+  "C:/mingw64/share/cmake-3.28/Modules/CMakeCXXInformation.cmake"
+  "C:/mingw64/share/cmake-3.28/Modules/CMakeCommonLanguageInclude.cmake"
+  "C:/mingw64/share/cmake-3.28/Modules/CMakeGenericSystem.cmake"
+  "C:/mingw64/share/cmake-3.28/Modules/CMakeInitializeConfigs.cmake"
+  "C:/mingw64/share/cmake-3.28/Modules/CMakeLanguageInformation.cmake"
+  "C:/mingw64/share/cmake-3.28/Modules/CMakeRCInformation.cmake"
+  "C:/mingw64/share/cmake-3.28/Modules/CMakeSystemSpecificInformation.cmake"
+  "C:/mingw64/share/cmake-3.28/Modules/CMakeSystemSpecificInitialize.cmake"
+  "C:/mingw64/share/cmake-3.28/Modules/Compiler/CMakeCommonCompilerMacros.cmake"
+  "C:/mingw64/share/cmake-3.28/Modules/Compiler/GNU-C.cmake"
+  "C:/mingw64/share/cmake-3.28/Modules/Compiler/GNU-CXX.cmake"
+  "C:/mingw64/share/cmake-3.28/Modules/Compiler/GNU.cmake"
+  "C:/mingw64/share/cmake-3.28/Modules/Platform/Windows-GNU-C-ABI.cmake"
+  "C:/mingw64/share/cmake-3.28/Modules/Platform/Windows-GNU-C.cmake"
+  "C:/mingw64/share/cmake-3.28/Modules/Platform/Windows-GNU-CXX-ABI.cmake"
+  "C:/mingw64/share/cmake-3.28/Modules/Platform/Windows-GNU-CXX.cmake"
+  "C:/mingw64/share/cmake-3.28/Modules/Platform/Windows-GNU.cmake"
+  "C:/mingw64/share/cmake-3.28/Modules/Platform/Windows-Initialize.cmake"
+  "C:/mingw64/share/cmake-3.28/Modules/Platform/Windows-windres.cmake"
+  "C:/mingw64/share/cmake-3.28/Modules/Platform/Windows.cmake"
+  "C:/mingw64/share/cmake-3.28/Modules/Platform/WindowsPaths.cmake"
+  "CMakeFiles/3.28.2/CMakeCCompiler.cmake"
+  "CMakeFiles/3.28.2/CMakeCXXCompiler.cmake"
+  "CMakeFiles/3.28.2/CMakeRCCompiler.cmake"
+  "CMakeFiles/3.28.2/CMakeSystem.cmake"
+  "CMakeLists.txt"
+  "sal/tls_sal_m.xpp"
+  )
+
+# The corresponding makefile is:
+set(CMAKE_MAKEFILE_OUTPUTS
+  "Makefile"
+  "CMakeFiles/cmake.check_cache"
+  )
+
+# Byproducts of CMake generate step:
+set(CMAKE_MAKEFILE_PRODUCTS
+  "lib/tls_sal.cpp"
+  "CMakeFiles/CMakeDirectoryInformation.cmake"
+  )
+
+# Dependency information for all targets:
+set(CMAKE_DEPEND_INFO_FILES
+  "CMakeFiles/tiitls.dir/DependInfo.cmake"
+  "CMakeFiles/client.dir/DependInfo.cmake"
+  )
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/Makefile2 b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/Makefile2
new file mode 100644
index 0000000..5131c47
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/Makefile2
@@ -0,0 +1,139 @@
+# CMAKE generated file: DO NOT EDIT!
+# Generated by "MinGW Makefiles" Generator, CMake Version 3.28
+
+# Default target executed when no arguments are given to make.
+default_target: all
+.PHONY : default_target
+
+#=============================================================================
+# Special targets provided by cmake.
+
+# Disable implicit rules so canonical targets will work.
+.SUFFIXES:
+
+# Disable VCS-based implicit rules.
+% : %,v
+
+# Disable VCS-based implicit rules.
+% : RCS/%
+
+# Disable VCS-based implicit rules.
+% : RCS/%,v
+
+# Disable VCS-based implicit rules.
+% : SCCS/s.%
+
+# Disable VCS-based implicit rules.
+% : s.%
+
+.SUFFIXES: .hpux_make_needs_suffix_list
+
+# Command-line flag to silence nested $(MAKE).
+$(VERBOSE)MAKESILENT = -s
+
+#Suppress display of executed commands.
+$(VERBOSE).SILENT:
+
+# A target that is always out of date.
+cmake_force:
+.PHONY : cmake_force
+
+#=============================================================================
+# Set environment variables for the build.
+
+SHELL = cmd.exe
+
+# The CMake executable.
+CMAKE_COMMAND = C:\mingw64\bin\cmake.exe
+
+# The command to remove a file.
+RM = C:\mingw64\bin\cmake.exe -E rm -f
+
+# Escaping for special characters.
+EQUALS = =
+
+# The top-level source directory on which CMake was run.
+CMAKE_SOURCE_DIR = D:\DOKUMENTY\diplomovka-final\Scott-cpp-win
+
+# The top-level build directory on which CMake was run.
+CMAKE_BINARY_DIR = D:\DOKUMENTY\diplomovka-final\Scott-cpp-win
+
+#=============================================================================
+# Directory level rules for the build root directory
+
+# The main recursive "all" target.
+all: CMakeFiles/tiitls.dir/all
+all: CMakeFiles/client.dir/all
+.PHONY : all
+
+# The main recursive "preinstall" target.
+preinstall:
+.PHONY : preinstall
+
+# The main recursive "clean" target.
+clean: CMakeFiles/tiitls.dir/clean
+clean: CMakeFiles/client.dir/clean
+.PHONY : clean
+
+#=============================================================================
+# Target rules for target CMakeFiles/tiitls.dir
+
+# All Build rule for target.
+CMakeFiles/tiitls.dir/all:
+	$(MAKE) $(MAKESILENT) -f CMakeFiles\tiitls.dir\build.make CMakeFiles/tiitls.dir/depend
+	$(MAKE) $(MAKESILENT) -f CMakeFiles\tiitls.dir\build.make CMakeFiles/tiitls.dir/build
+	@$(CMAKE_COMMAND) -E cmake_echo_color "--switch=$(COLOR)" --progress-dir=D:\DOKUMENTY\diplomovka-final\Scott-cpp-win\CMakeFiles --progress-num=3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18 "Built target tiitls"
+.PHONY : CMakeFiles/tiitls.dir/all
+
+# Build rule for subdir invocation for target.
+CMakeFiles/tiitls.dir/rule: cmake_check_build_system
+	$(CMAKE_COMMAND) -E cmake_progress_start D:\DOKUMENTY\diplomovka-final\Scott-cpp-win\CMakeFiles 16
+	$(MAKE) $(MAKESILENT) -f CMakeFiles\Makefile2 CMakeFiles/tiitls.dir/all
+	$(CMAKE_COMMAND) -E cmake_progress_start D:\DOKUMENTY\diplomovka-final\Scott-cpp-win\CMakeFiles 0
+.PHONY : CMakeFiles/tiitls.dir/rule
+
+# Convenience name for target.
+tiitls: CMakeFiles/tiitls.dir/rule
+.PHONY : tiitls
+
+# clean rule for target.
+CMakeFiles/tiitls.dir/clean:
+	$(MAKE) $(MAKESILENT) -f CMakeFiles\tiitls.dir\build.make CMakeFiles/tiitls.dir/clean
+.PHONY : CMakeFiles/tiitls.dir/clean
+
+#=============================================================================
+# Target rules for target CMakeFiles/client.dir
+
+# All Build rule for target.
+CMakeFiles/client.dir/all: CMakeFiles/tiitls.dir/all
+	$(MAKE) $(MAKESILENT) -f CMakeFiles\client.dir\build.make CMakeFiles/client.dir/depend
+	$(MAKE) $(MAKESILENT) -f CMakeFiles\client.dir\build.make CMakeFiles/client.dir/build
+	@$(CMAKE_COMMAND) -E cmake_echo_color "--switch=$(COLOR)" --progress-dir=D:\DOKUMENTY\diplomovka-final\Scott-cpp-win\CMakeFiles --progress-num=1,2 "Built target client"
+.PHONY : CMakeFiles/client.dir/all
+
+# Build rule for subdir invocation for target.
+CMakeFiles/client.dir/rule: cmake_check_build_system
+	$(CMAKE_COMMAND) -E cmake_progress_start D:\DOKUMENTY\diplomovka-final\Scott-cpp-win\CMakeFiles 18
+	$(MAKE) $(MAKESILENT) -f CMakeFiles\Makefile2 CMakeFiles/client.dir/all
+	$(CMAKE_COMMAND) -E cmake_progress_start D:\DOKUMENTY\diplomovka-final\Scott-cpp-win\CMakeFiles 0
+.PHONY : CMakeFiles/client.dir/rule
+
+# Convenience name for target.
+client: CMakeFiles/client.dir/rule
+.PHONY : client
+
+# clean rule for target.
+CMakeFiles/client.dir/clean:
+	$(MAKE) $(MAKESILENT) -f CMakeFiles\client.dir\build.make CMakeFiles/client.dir/clean
+.PHONY : CMakeFiles/client.dir/clean
+
+#=============================================================================
+# Special targets to cleanup operation of make.
+
+# Special rule to run CMake to check the build system integrity.
+# No rule that depends on this can have commands that come from listfiles
+# because they might be regenerated.
+cmake_check_build_system:
+	$(CMAKE_COMMAND) -S$(CMAKE_SOURCE_DIR) -B$(CMAKE_BINARY_DIR) --check-build-system CMakeFiles\Makefile.cmake 0
+.PHONY : cmake_check_build_system
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/TargetDirectories.txt b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/TargetDirectories.txt
new file mode 100644
index 0000000..ed11258
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/TargetDirectories.txt
@@ -0,0 +1,4 @@
+D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/CMakeFiles/tiitls.dir
+D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/CMakeFiles/client.dir
+D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/CMakeFiles/edit_cache.dir
+D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/CMakeFiles/rebuild_cache.dir
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/client.dir/DependInfo.cmake b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/client.dir/DependInfo.cmake
new file mode 100644
index 0000000..406360b
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/client.dir/DependInfo.cmake
@@ -0,0 +1,23 @@
+
+# Consider dependencies only in project.
+set(CMAKE_DEPENDS_IN_PROJECT_ONLY OFF)
+
+# The set of languages for which implicit dependencies are needed:
+set(CMAKE_DEPENDS_LANGUAGES
+  )
+
+# The set of dependency files which are needed:
+set(CMAKE_DEPENDS_DEPENDENCY_FILES
+  "D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/src/client.cpp" "CMakeFiles/client.dir/src/client.cpp.obj" "gcc" "CMakeFiles/client.dir/src/client.cpp.obj.d"
+  )
+
+# Targets to which this target links which contain Fortran sources.
+set(CMAKE_Fortran_TARGET_LINKED_INFO_FILES
+  )
+
+# Targets to which this target links which contain Fortran sources.
+set(CMAKE_Fortran_TARGET_FORWARD_LINKED_INFO_FILES
+  )
+
+# Fortran module output directory.
+set(CMAKE_Fortran_TARGET_MODULE_DIR "")
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/client.dir/build.make b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/client.dir/build.make
new file mode 100644
index 0000000..af8cbf1
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/client.dir/build.make
@@ -0,0 +1,114 @@
+# CMAKE generated file: DO NOT EDIT!
+# Generated by "MinGW Makefiles" Generator, CMake Version 3.28
+
+# Delete rule output on recipe failure.
+.DELETE_ON_ERROR:
+
+#=============================================================================
+# Special targets provided by cmake.
+
+# Disable implicit rules so canonical targets will work.
+.SUFFIXES:
+
+# Disable VCS-based implicit rules.
+% : %,v
+
+# Disable VCS-based implicit rules.
+% : RCS/%
+
+# Disable VCS-based implicit rules.
+% : RCS/%,v
+
+# Disable VCS-based implicit rules.
+% : SCCS/s.%
+
+# Disable VCS-based implicit rules.
+% : s.%
+
+.SUFFIXES: .hpux_make_needs_suffix_list
+
+# Command-line flag to silence nested $(MAKE).
+$(VERBOSE)MAKESILENT = -s
+
+#Suppress display of executed commands.
+$(VERBOSE).SILENT:
+
+# A target that is always out of date.
+cmake_force:
+.PHONY : cmake_force
+
+#=============================================================================
+# Set environment variables for the build.
+
+SHELL = cmd.exe
+
+# The CMake executable.
+CMAKE_COMMAND = C:\mingw64\bin\cmake.exe
+
+# The command to remove a file.
+RM = C:\mingw64\bin\cmake.exe -E rm -f
+
+# Escaping for special characters.
+EQUALS = =
+
+# The top-level source directory on which CMake was run.
+CMAKE_SOURCE_DIR = D:\DOKUMENTY\diplomovka-final\Scott-cpp-win
+
+# The top-level build directory on which CMake was run.
+CMAKE_BINARY_DIR = D:\DOKUMENTY\diplomovka-final\Scott-cpp-win
+
+# Include any dependencies generated for this target.
+include CMakeFiles/client.dir/depend.make
+# Include any dependencies generated by the compiler for this target.
+include CMakeFiles/client.dir/compiler_depend.make
+
+# Include the progress variables for this target.
+include CMakeFiles/client.dir/progress.make
+
+# Include the compile flags for this target's objects.
+include CMakeFiles/client.dir/flags.make
+
+CMakeFiles/client.dir/src/client.cpp.obj: CMakeFiles/client.dir/flags.make
+CMakeFiles/client.dir/src/client.cpp.obj: CMakeFiles/client.dir/includes_CXX.rsp
+CMakeFiles/client.dir/src/client.cpp.obj: src/client.cpp
+CMakeFiles/client.dir/src/client.cpp.obj: CMakeFiles/client.dir/compiler_depend.ts
+	@$(CMAKE_COMMAND) -E cmake_echo_color "--switch=$(COLOR)" --green --progress-dir=D:\DOKUMENTY\diplomovka-final\Scott-cpp-win\CMakeFiles --progress-num=$(CMAKE_PROGRESS_1) "Building CXX object CMakeFiles/client.dir/src/client.cpp.obj"
+	C:\mingw64\bin\gcc.exe $(CXX_DEFINES) $(CXX_INCLUDES) $(CXX_FLAGS) -MD -MT CMakeFiles/client.dir/src/client.cpp.obj -MF CMakeFiles\client.dir\src\client.cpp.obj.d -o CMakeFiles\client.dir\src\client.cpp.obj -c D:\DOKUMENTY\diplomovka-final\Scott-cpp-win\src\client.cpp
+
+CMakeFiles/client.dir/src/client.cpp.i: cmake_force
+	@$(CMAKE_COMMAND) -E cmake_echo_color "--switch=$(COLOR)" --green "Preprocessing CXX source to CMakeFiles/client.dir/src/client.cpp.i"
+	C:\mingw64\bin\gcc.exe $(CXX_DEFINES) $(CXX_INCLUDES) $(CXX_FLAGS) -E D:\DOKUMENTY\diplomovka-final\Scott-cpp-win\src\client.cpp > CMakeFiles\client.dir\src\client.cpp.i
+
+CMakeFiles/client.dir/src/client.cpp.s: cmake_force
+	@$(CMAKE_COMMAND) -E cmake_echo_color "--switch=$(COLOR)" --green "Compiling CXX source to assembly CMakeFiles/client.dir/src/client.cpp.s"
+	C:\mingw64\bin\gcc.exe $(CXX_DEFINES) $(CXX_INCLUDES) $(CXX_FLAGS) -S D:\DOKUMENTY\diplomovka-final\Scott-cpp-win\src\client.cpp -o CMakeFiles\client.dir\src\client.cpp.s
+
+# Object files for target client
+client_OBJECTS = \
+"CMakeFiles/client.dir/src/client.cpp.obj"
+
+# External object files for target client
+client_EXTERNAL_OBJECTS =
+
+client.exe: CMakeFiles/client.dir/src/client.cpp.obj
+client.exe: CMakeFiles/client.dir/build.make
+client.exe: libtiitls.a
+client.exe: sal/miracl/core.a
+client.exe: CMakeFiles/client.dir/linkLibs.rsp
+client.exe: CMakeFiles/client.dir/objects1.rsp
+client.exe: CMakeFiles/client.dir/link.txt
+	@$(CMAKE_COMMAND) -E cmake_echo_color "--switch=$(COLOR)" --green --bold --progress-dir=D:\DOKUMENTY\diplomovka-final\Scott-cpp-win\CMakeFiles --progress-num=$(CMAKE_PROGRESS_2) "Linking CXX executable client.exe"
+	$(CMAKE_COMMAND) -E cmake_link_script CMakeFiles\client.dir\link.txt --verbose=$(VERBOSE)
+
+# Rule to build all files generated by this target.
+CMakeFiles/client.dir/build: client.exe
+.PHONY : CMakeFiles/client.dir/build
+
+CMakeFiles/client.dir/clean:
+	$(CMAKE_COMMAND) -P CMakeFiles\client.dir\cmake_clean.cmake
+.PHONY : CMakeFiles/client.dir/clean
+
+CMakeFiles/client.dir/depend:
+	$(CMAKE_COMMAND) -E cmake_depends "MinGW Makefiles" D:\DOKUMENTY\diplomovka-final\Scott-cpp-win D:\DOKUMENTY\diplomovka-final\Scott-cpp-win D:\DOKUMENTY\diplomovka-final\Scott-cpp-win D:\DOKUMENTY\diplomovka-final\Scott-cpp-win D:\DOKUMENTY\diplomovka-final\Scott-cpp-win\CMakeFiles\client.dir\DependInfo.cmake "--color=$(COLOR)"
+.PHONY : CMakeFiles/client.dir/depend
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/client.dir/cmake_clean.cmake b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/client.dir/cmake_clean.cmake
new file mode 100644
index 0000000..64ea35e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/client.dir/cmake_clean.cmake
@@ -0,0 +1,13 @@
+file(REMOVE_RECURSE
+  "CMakeFiles/client.dir/src/client.cpp.obj"
+  "CMakeFiles/client.dir/src/client.cpp.obj.d"
+  "client.exe"
+  "client.exe.manifest"
+  "client.pdb"
+  "libclient.dll.a"
+)
+
+# Per-language clean rules from dependency scanning.
+foreach(lang CXX)
+  include(CMakeFiles/client.dir/cmake_clean_${lang}.cmake OPTIONAL)
+endforeach()
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/client.dir/compiler_depend.internal b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/client.dir/compiler_depend.internal
new file mode 100644
index 0000000..f1671be
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/client.dir/compiler_depend.internal
@@ -0,0 +1,330 @@
+# CMAKE generated file: DO NOT EDIT!
+# Generated by "MinGW Makefiles" Generator, CMake Version 3.28
+
+CMakeFiles/client.dir/src/client.cpp.obj
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/src/client.cpp
+ C:/mingw64/include/c++/13.2.0/bits/std_abs.h
+ C:/mingw64/include/c++/13.2.0/cstdlib
+ C:/mingw64/include/c++/13.2.0/pstl/pstl_config.h
+ C:/mingw64/include/c++/13.2.0/stdlib.h
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/c++config.h
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/cpu_defines.h
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/os_defines.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/adxintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/ammintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxbf16intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxcomplexintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxfp16intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxint8intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxtileintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx2intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx5124fmapsintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx5124vnniwintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bf16intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bf16vlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bitalgintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bwintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512cdintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512dqintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512erintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fp16intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fp16vlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512ifmaintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512ifmavlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512pfintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmi2intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmi2vlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmiintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmivlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vlbwintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vldqintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vnniintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vnnivlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vp2intersectintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vp2intersectvlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vpopcntdqintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vpopcntdqvlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxifmaintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxneconvertintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxvnniint8intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxvnniintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/bmi2intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/bmiintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cetintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cldemoteintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clflushoptintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clwbintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clzerointrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cmpccxaddintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/emmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/enqcmdintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/f16cintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fma4intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fmaintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fxsrintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/gfniintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/hresetintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/ia32intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/immintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/keylockerintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/limits.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/lwpintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/lzcntintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mm3dnow.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mm_malloc.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/movdirintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mwaitintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mwaitxintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pconfigintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pkuintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pmmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/popcntintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/prfchiintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/prfchwintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/raointintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/rdseedintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/rtmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/serializeintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/sgxintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/shaintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/smmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stdarg.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stdbool.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stddef.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stdint.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/syslimits.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tbmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tmmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tsxldtrkintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/uintrintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/vaesintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/vpclmulqdqintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/waitpkgintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/wbnoinvdintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/wmmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/x86gprintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/x86intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xmmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xopintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsavecintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsaveintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsaveoptintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsavesintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xtestintrin.h
+ C:/mingw64/x86_64-w64-mingw32/include/_bsd_types.h
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw.h
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_mac.h
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_off_t.h
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_secapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_stdarg.h
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_unicode.h
+ C:/mingw64/x86_64-w64-mingw32/include/_timeval.h
+ C:/mingw64/x86_64-w64-mingw32/include/afunix.h
+ C:/mingw64/x86_64-w64-mingw32/include/apiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/apisetcconv.h
+ C:/mingw64/x86_64-w64-mingw32/include/basetsd.h
+ C:/mingw64/x86_64-w64-mingw32/include/bcrypt.h
+ C:/mingw64/x86_64-w64-mingw32/include/bemapiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/cderr.h
+ C:/mingw64/x86_64-w64-mingw32/include/cguid.h
+ C:/mingw64/x86_64-w64-mingw32/include/combaseapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/commdlg.h
+ C:/mingw64/x86_64-w64-mingw32/include/concurrencysal.h
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt.h
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt_startup.h
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt_stdio_config.h
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt_wstdlib.h
+ C:/mingw64/x86_64-w64-mingw32/include/crtdefs.h
+ C:/mingw64/x86_64-w64-mingw32/include/ctype.h
+ C:/mingw64/x86_64-w64-mingw32/include/datetimeapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/dde.h
+ C:/mingw64/x86_64-w64-mingw32/include/ddeml.h
+ C:/mingw64/x86_64-w64-mingw32/include/debugapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/dlgs.h
+ C:/mingw64/x86_64-w64-mingw32/include/dpapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/driverspecs.h
+ C:/mingw64/x86_64-w64-mingw32/include/errhandlingapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/errno.h
+ C:/mingw64/x86_64-w64-mingw32/include/excpt.h
+ C:/mingw64/x86_64-w64-mingw32/include/fibersapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/fileapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/fltwinerror.h
+ C:/mingw64/x86_64-w64-mingw32/include/getopt.h
+ C:/mingw64/x86_64-w64-mingw32/include/guiddef.h
+ C:/mingw64/x86_64-w64-mingw32/include/handleapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/heapapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/imm.h
+ C:/mingw64/x86_64-w64-mingw32/include/in6addr.h
+ C:/mingw64/x86_64-w64-mingw32/include/inaddr.h
+ C:/mingw64/x86_64-w64-mingw32/include/interlockedapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/inttypes.h
+ C:/mingw64/x86_64-w64-mingw32/include/io.h
+ C:/mingw64/x86_64-w64-mingw32/include/ioapiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/jobapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/joystickapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/ktmtypes.h
+ C:/mingw64/x86_64-w64-mingw32/include/libloaderapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/limits.h
+ C:/mingw64/x86_64-w64-mingw32/include/lzexpand.h
+ C:/mingw64/x86_64-w64-mingw32/include/malloc.h
+ C:/mingw64/x86_64-w64-mingw32/include/mciapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/mcx.h
+ C:/mingw64/x86_64-w64-mingw32/include/memoryapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/minwinbase.h
+ C:/mingw64/x86_64-w64-mingw32/include/minwindef.h
+ C:/mingw64/x86_64-w64-mingw32/include/mmeapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/mmiscapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/mmiscapi2.h
+ C:/mingw64/x86_64-w64-mingw32/include/mmsyscom.h
+ C:/mingw64/x86_64-w64-mingw32/include/mmsystem.h
+ C:/mingw64/x86_64-w64-mingw32/include/mstcpip.h
+ C:/mingw64/x86_64-w64-mingw32/include/msxml.h
+ C:/mingw64/x86_64-w64-mingw32/include/namedpipeapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/namespaceapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/nb30.h
+ C:/mingw64/x86_64-w64-mingw32/include/ncrypt.h
+ C:/mingw64/x86_64-w64-mingw32/include/oaidl.h
+ C:/mingw64/x86_64-w64-mingw32/include/objbase.h
+ C:/mingw64/x86_64-w64-mingw32/include/objidl.h
+ C:/mingw64/x86_64-w64-mingw32/include/objidlbase.h
+ C:/mingw64/x86_64-w64-mingw32/include/ole2.h
+ C:/mingw64/x86_64-w64-mingw32/include/oleauto.h
+ C:/mingw64/x86_64-w64-mingw32/include/oleidl.h
+ C:/mingw64/x86_64-w64-mingw32/include/playsoundapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/poppack.h
+ C:/mingw64/x86_64-w64-mingw32/include/process.h
+ C:/mingw64/x86_64-w64-mingw32/include/processenv.h
+ C:/mingw64/x86_64-w64-mingw32/include/processthreadsapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/processtopologyapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/profileapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/propidl.h
+ C:/mingw64/x86_64-w64-mingw32/include/prsht.h
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_fd_types.h
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ip_mreq1.h
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ip_types.h
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_socket_types.h
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ws1_undef.h
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_wsa_errnos.h
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_wsadata.h
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/intrin-impl.h
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack1.h
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack2.h
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack4.h
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack8.h
+ C:/mingw64/x86_64-w64-mingw32/include/pthread_time.h
+ C:/mingw64/x86_64-w64-mingw32/include/pthread_unistd.h
+ C:/mingw64/x86_64-w64-mingw32/include/qos.h
+ C:/mingw64/x86_64-w64-mingw32/include/realtimeapiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/reason.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpc.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpcasync.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpcdce.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpcdcep.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpcndr.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpcnsi.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpcnsip.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpcnterr.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpcsal.h
+ C:/mingw64/x86_64-w64-mingw32/include/sal.h
+ C:/mingw64/x86_64-w64-mingw32/include/sdkddkver.h
+ C:/mingw64/x86_64-w64-mingw32/include/sdks/_mingw_ddk.h
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/stdio_s.h
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/stdlib_s.h
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/stralign_s.h
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/string_s.h
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/sys/timeb_s.h
+ C:/mingw64/x86_64-w64-mingw32/include/securityappcontainer.h
+ C:/mingw64/x86_64-w64-mingw32/include/securitybaseapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/servprov.h
+ C:/mingw64/x86_64-w64-mingw32/include/shellapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/specstrings.h
+ C:/mingw64/x86_64-w64-mingw32/include/stdarg.h
+ C:/mingw64/x86_64-w64-mingw32/include/stddef.h
+ C:/mingw64/x86_64-w64-mingw32/include/stdint.h
+ C:/mingw64/x86_64-w64-mingw32/include/stdio.h
+ C:/mingw64/x86_64-w64-mingw32/include/stdlib.h
+ C:/mingw64/x86_64-w64-mingw32/include/stralign.h
+ C:/mingw64/x86_64-w64-mingw32/include/string.h
+ C:/mingw64/x86_64-w64-mingw32/include/stringapiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/swprintf.inl
+ C:/mingw64/x86_64-w64-mingw32/include/synchapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/sys/timeb.h
+ C:/mingw64/x86_64-w64-mingw32/include/sys/types.h
+ C:/mingw64/x86_64-w64-mingw32/include/sysinfoapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/systemtopologyapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/threadpoolapiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/threadpoollegacyapiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/time.h
+ C:/mingw64/x86_64-w64-mingw32/include/timeapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/timezoneapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/tvout.h
+ C:/mingw64/x86_64-w64-mingw32/include/unistd.h
+ C:/mingw64/x86_64-w64-mingw32/include/unknwn.h
+ C:/mingw64/x86_64-w64-mingw32/include/unknwnbase.h
+ C:/mingw64/x86_64-w64-mingw32/include/urlmon.h
+ C:/mingw64/x86_64-w64-mingw32/include/utilapiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/vadefs.h
+ C:/mingw64/x86_64-w64-mingw32/include/virtdisk.h
+ C:/mingw64/x86_64-w64-mingw32/include/winapifamily.h
+ C:/mingw64/x86_64-w64-mingw32/include/winbase.h
+ C:/mingw64/x86_64-w64-mingw32/include/wincon.h
+ C:/mingw64/x86_64-w64-mingw32/include/wincrypt.h
+ C:/mingw64/x86_64-w64-mingw32/include/windef.h
+ C:/mingw64/x86_64-w64-mingw32/include/windows.h
+ C:/mingw64/x86_64-w64-mingw32/include/winefs.h
+ C:/mingw64/x86_64-w64-mingw32/include/winerror.h
+ C:/mingw64/x86_64-w64-mingw32/include/wingdi.h
+ C:/mingw64/x86_64-w64-mingw32/include/winioctl.h
+ C:/mingw64/x86_64-w64-mingw32/include/winnetwk.h
+ C:/mingw64/x86_64-w64-mingw32/include/winnls.h
+ C:/mingw64/x86_64-w64-mingw32/include/winnt.h
+ C:/mingw64/x86_64-w64-mingw32/include/winperf.h
+ C:/mingw64/x86_64-w64-mingw32/include/winreg.h
+ C:/mingw64/x86_64-w64-mingw32/include/winscard.h
+ C:/mingw64/x86_64-w64-mingw32/include/winsmcrd.h
+ C:/mingw64/x86_64-w64-mingw32/include/winsock.h
+ C:/mingw64/x86_64-w64-mingw32/include/winsock2.h
+ C:/mingw64/x86_64-w64-mingw32/include/winspool.h
+ C:/mingw64/x86_64-w64-mingw32/include/winsvc.h
+ C:/mingw64/x86_64-w64-mingw32/include/winuser.h
+ C:/mingw64/x86_64-w64-mingw32/include/winver.h
+ C:/mingw64/x86_64-w64-mingw32/include/wnnc.h
+ C:/mingw64/x86_64-w64-mingw32/include/wow64apiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/ws2def.h
+ C:/mingw64/x86_64-w64-mingw32/include/ws2ipdef.h
+ C:/mingw64/x86_64-w64-mingw32/include/ws2tcpip.h
+ C:/mingw64/x86_64-w64-mingw32/include/wtypes.h
+ C:/mingw64/x86_64-w64-mingw32/include/wtypesbase.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls1_3.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_bfibe.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_cert_chain.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_certs.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_client_recv.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_client_send.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_keys_calc.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_logger.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_octads.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_pqibe.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_protocol.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_sal.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_sockets.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_tickets.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_x509.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/arch.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/big_B384_58.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/config_big_B384_58.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/config_curve_BLS12381.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/config_field_BLS12381.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/core.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/ecp2_BLS12381.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/ecp_BLS12381.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/fp12_BLS12381.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/fp2_BLS12381.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/fp4_BLS12381.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/fp_BLS12381.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/pair_BLS12381.h
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/client.dir/compiler_depend.make b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/client.dir/compiler_depend.make
new file mode 100644
index 0000000..adf4316
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/client.dir/compiler_depend.make
@@ -0,0 +1,979 @@
+# CMAKE generated file: DO NOT EDIT!
+# Generated by "MinGW Makefiles" Generator, CMake Version 3.28
+
+CMakeFiles/client.dir/src/client.cpp.obj: src/client.cpp \
+  C:/mingw64/include/c++/13.2.0/bits/std_abs.h \
+  C:/mingw64/include/c++/13.2.0/cstdlib \
+  C:/mingw64/include/c++/13.2.0/pstl/pstl_config.h \
+  C:/mingw64/include/c++/13.2.0/stdlib.h \
+  C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/c++config.h \
+  C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/cpu_defines.h \
+  C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/os_defines.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/adxintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/ammintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxbf16intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxcomplexintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxfp16intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxint8intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxtileintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx2intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx5124fmapsintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx5124vnniwintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bf16intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bf16vlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bitalgintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bwintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512cdintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512dqintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512erintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fp16intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fp16vlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512ifmaintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512ifmavlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512pfintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmi2intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmi2vlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmiintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmivlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vlbwintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vldqintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vnniintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vnnivlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vp2intersectintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vp2intersectvlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vpopcntdqintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vpopcntdqvlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxifmaintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxneconvertintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxvnniint8intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxvnniintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/bmi2intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/bmiintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cetintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cldemoteintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clflushoptintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clwbintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clzerointrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cmpccxaddintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/emmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/enqcmdintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/f16cintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fma4intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fmaintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fxsrintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/gfniintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/hresetintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/ia32intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/immintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/keylockerintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/limits.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/lwpintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/lzcntintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mm3dnow.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mm_malloc.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/movdirintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mwaitintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mwaitxintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pconfigintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pkuintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pmmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/popcntintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/prfchiintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/prfchwintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/raointintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/rdseedintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/rtmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/serializeintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/sgxintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/shaintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/smmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stdarg.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stdbool.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stddef.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stdint.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/syslimits.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tbmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tmmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tsxldtrkintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/uintrintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/vaesintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/vpclmulqdqintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/waitpkgintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/wbnoinvdintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/wmmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/x86gprintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/x86intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xmmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xopintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsavecintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsaveintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsaveoptintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsavesintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xtestintrin.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_bsd_types.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_mingw.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_mingw_mac.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_mingw_off_t.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_mingw_secapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_mingw_stdarg.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_mingw_unicode.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_timeval.h \
+  C:/mingw64/x86_64-w64-mingw32/include/afunix.h \
+  C:/mingw64/x86_64-w64-mingw32/include/apiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/apisetcconv.h \
+  C:/mingw64/x86_64-w64-mingw32/include/basetsd.h \
+  C:/mingw64/x86_64-w64-mingw32/include/bcrypt.h \
+  C:/mingw64/x86_64-w64-mingw32/include/bemapiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/cderr.h \
+  C:/mingw64/x86_64-w64-mingw32/include/cguid.h \
+  C:/mingw64/x86_64-w64-mingw32/include/combaseapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/commdlg.h \
+  C:/mingw64/x86_64-w64-mingw32/include/concurrencysal.h \
+  C:/mingw64/x86_64-w64-mingw32/include/corecrt.h \
+  C:/mingw64/x86_64-w64-mingw32/include/corecrt_startup.h \
+  C:/mingw64/x86_64-w64-mingw32/include/corecrt_stdio_config.h \
+  C:/mingw64/x86_64-w64-mingw32/include/corecrt_wstdlib.h \
+  C:/mingw64/x86_64-w64-mingw32/include/crtdefs.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ctype.h \
+  C:/mingw64/x86_64-w64-mingw32/include/datetimeapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/dde.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ddeml.h \
+  C:/mingw64/x86_64-w64-mingw32/include/debugapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/dlgs.h \
+  C:/mingw64/x86_64-w64-mingw32/include/dpapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/driverspecs.h \
+  C:/mingw64/x86_64-w64-mingw32/include/errhandlingapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/errno.h \
+  C:/mingw64/x86_64-w64-mingw32/include/excpt.h \
+  C:/mingw64/x86_64-w64-mingw32/include/fibersapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/fileapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/fltwinerror.h \
+  C:/mingw64/x86_64-w64-mingw32/include/getopt.h \
+  C:/mingw64/x86_64-w64-mingw32/include/guiddef.h \
+  C:/mingw64/x86_64-w64-mingw32/include/handleapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/heapapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/imm.h \
+  C:/mingw64/x86_64-w64-mingw32/include/in6addr.h \
+  C:/mingw64/x86_64-w64-mingw32/include/inaddr.h \
+  C:/mingw64/x86_64-w64-mingw32/include/interlockedapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/inttypes.h \
+  C:/mingw64/x86_64-w64-mingw32/include/io.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ioapiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/jobapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/joystickapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ktmtypes.h \
+  C:/mingw64/x86_64-w64-mingw32/include/libloaderapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/limits.h \
+  C:/mingw64/x86_64-w64-mingw32/include/lzexpand.h \
+  C:/mingw64/x86_64-w64-mingw32/include/malloc.h \
+  C:/mingw64/x86_64-w64-mingw32/include/mciapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/mcx.h \
+  C:/mingw64/x86_64-w64-mingw32/include/memoryapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/minwinbase.h \
+  C:/mingw64/x86_64-w64-mingw32/include/minwindef.h \
+  C:/mingw64/x86_64-w64-mingw32/include/mmeapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/mmiscapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/mmiscapi2.h \
+  C:/mingw64/x86_64-w64-mingw32/include/mmsyscom.h \
+  C:/mingw64/x86_64-w64-mingw32/include/mmsystem.h \
+  C:/mingw64/x86_64-w64-mingw32/include/mstcpip.h \
+  C:/mingw64/x86_64-w64-mingw32/include/msxml.h \
+  C:/mingw64/x86_64-w64-mingw32/include/namedpipeapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/namespaceapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/nb30.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ncrypt.h \
+  C:/mingw64/x86_64-w64-mingw32/include/oaidl.h \
+  C:/mingw64/x86_64-w64-mingw32/include/objbase.h \
+  C:/mingw64/x86_64-w64-mingw32/include/objidl.h \
+  C:/mingw64/x86_64-w64-mingw32/include/objidlbase.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ole2.h \
+  C:/mingw64/x86_64-w64-mingw32/include/oleauto.h \
+  C:/mingw64/x86_64-w64-mingw32/include/oleidl.h \
+  C:/mingw64/x86_64-w64-mingw32/include/playsoundapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/poppack.h \
+  C:/mingw64/x86_64-w64-mingw32/include/process.h \
+  C:/mingw64/x86_64-w64-mingw32/include/processenv.h \
+  C:/mingw64/x86_64-w64-mingw32/include/processthreadsapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/processtopologyapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/profileapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/propidl.h \
+  C:/mingw64/x86_64-w64-mingw32/include/prsht.h \
+  C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_fd_types.h \
+  C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ip_mreq1.h \
+  C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ip_types.h \
+  C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_socket_types.h \
+  C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ws1_undef.h \
+  C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_wsa_errnos.h \
+  C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_wsadata.h \
+  C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/intrin-impl.h \
+  C:/mingw64/x86_64-w64-mingw32/include/pshpack1.h \
+  C:/mingw64/x86_64-w64-mingw32/include/pshpack2.h \
+  C:/mingw64/x86_64-w64-mingw32/include/pshpack4.h \
+  C:/mingw64/x86_64-w64-mingw32/include/pshpack8.h \
+  C:/mingw64/x86_64-w64-mingw32/include/pthread_time.h \
+  C:/mingw64/x86_64-w64-mingw32/include/pthread_unistd.h \
+  C:/mingw64/x86_64-w64-mingw32/include/qos.h \
+  C:/mingw64/x86_64-w64-mingw32/include/realtimeapiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/reason.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpc.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpcasync.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpcdce.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpcdcep.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpcndr.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpcnsi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpcnsip.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpcnterr.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpcsal.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sal.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sdkddkver.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sdks/_mingw_ddk.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sec_api/stdio_s.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sec_api/stdlib_s.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sec_api/stralign_s.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sec_api/string_s.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sec_api/sys/timeb_s.h \
+  C:/mingw64/x86_64-w64-mingw32/include/securityappcontainer.h \
+  C:/mingw64/x86_64-w64-mingw32/include/securitybaseapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/servprov.h \
+  C:/mingw64/x86_64-w64-mingw32/include/shellapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/specstrings.h \
+  C:/mingw64/x86_64-w64-mingw32/include/stdarg.h \
+  C:/mingw64/x86_64-w64-mingw32/include/stddef.h \
+  C:/mingw64/x86_64-w64-mingw32/include/stdint.h \
+  C:/mingw64/x86_64-w64-mingw32/include/stdio.h \
+  C:/mingw64/x86_64-w64-mingw32/include/stdlib.h \
+  C:/mingw64/x86_64-w64-mingw32/include/stralign.h \
+  C:/mingw64/x86_64-w64-mingw32/include/string.h \
+  C:/mingw64/x86_64-w64-mingw32/include/stringapiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/swprintf.inl \
+  C:/mingw64/x86_64-w64-mingw32/include/synchapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sys/timeb.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sys/types.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sysinfoapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/systemtopologyapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/threadpoolapiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/threadpoollegacyapiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/time.h \
+  C:/mingw64/x86_64-w64-mingw32/include/timeapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/timezoneapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/tvout.h \
+  C:/mingw64/x86_64-w64-mingw32/include/unistd.h \
+  C:/mingw64/x86_64-w64-mingw32/include/unknwn.h \
+  C:/mingw64/x86_64-w64-mingw32/include/unknwnbase.h \
+  C:/mingw64/x86_64-w64-mingw32/include/urlmon.h \
+  C:/mingw64/x86_64-w64-mingw32/include/utilapiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/vadefs.h \
+  C:/mingw64/x86_64-w64-mingw32/include/virtdisk.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winapifamily.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winbase.h \
+  C:/mingw64/x86_64-w64-mingw32/include/wincon.h \
+  C:/mingw64/x86_64-w64-mingw32/include/wincrypt.h \
+  C:/mingw64/x86_64-w64-mingw32/include/windef.h \
+  C:/mingw64/x86_64-w64-mingw32/include/windows.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winefs.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winerror.h \
+  C:/mingw64/x86_64-w64-mingw32/include/wingdi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winioctl.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winnetwk.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winnls.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winnt.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winperf.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winreg.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winscard.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winsmcrd.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winsock.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winsock2.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winspool.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winsvc.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winuser.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winver.h \
+  C:/mingw64/x86_64-w64-mingw32/include/wnnc.h \
+  C:/mingw64/x86_64-w64-mingw32/include/wow64apiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ws2def.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ws2ipdef.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ws2tcpip.h \
+  C:/mingw64/x86_64-w64-mingw32/include/wtypes.h \
+  C:/mingw64/x86_64-w64-mingw32/include/wtypesbase.h \
+  include/tls1_3.h \
+  include/tls_bfibe.h \
+  include/tls_cert_chain.h \
+  include/tls_certs.h \
+  include/tls_client_recv.h \
+  include/tls_client_send.h \
+  include/tls_keys_calc.h \
+  include/tls_logger.h \
+  include/tls_octads.h \
+  include/tls_pqibe.h \
+  include/tls_protocol.h \
+  include/tls_sal.h \
+  include/tls_sockets.h \
+  include/tls_tickets.h \
+  include/tls_x509.h \
+  sal/miracl/includes/arch.h \
+  sal/miracl/includes/big_B384_58.h \
+  sal/miracl/includes/config_big_B384_58.h \
+  sal/miracl/includes/config_curve_BLS12381.h \
+  sal/miracl/includes/config_field_BLS12381.h \
+  sal/miracl/includes/core.h \
+  sal/miracl/includes/ecp2_BLS12381.h \
+  sal/miracl/includes/ecp_BLS12381.h \
+  sal/miracl/includes/fp12_BLS12381.h \
+  sal/miracl/includes/fp2_BLS12381.h \
+  sal/miracl/includes/fp4_BLS12381.h \
+  sal/miracl/includes/fp_BLS12381.h \
+  sal/miracl/includes/pair_BLS12381.h
+
+
+sal/miracl/includes/pair_BLS12381.h:
+
+sal/miracl/includes/fp_BLS12381.h:
+
+sal/miracl/includes/fp4_BLS12381.h:
+
+sal/miracl/includes/fp2_BLS12381.h:
+
+sal/miracl/includes/ecp2_BLS12381.h:
+
+sal/miracl/includes/core.h:
+
+sal/miracl/includes/config_field_BLS12381.h:
+
+include/tls_x509.h:
+
+include/tls_tickets.h:
+
+sal/miracl/includes/config_big_B384_58.h:
+
+include/tls_sal.h:
+
+include/tls_protocol.h:
+
+include/tls_logger.h:
+
+include/tls_keys_calc.h:
+
+include/tls_client_send.h:
+
+include/tls_client_recv.h:
+
+include/tls_cert_chain.h:
+
+include/tls_bfibe.h:
+
+include/tls1_3.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/wtypesbase.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/wtypes.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/ws2def.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/wow64apiset.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/winsvc.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/winsock2.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/winsock.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/winnt.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/winnetwk.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/winioctl.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/wingdi.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/winerror.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/winefs.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/windows.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/winapifamily.h:
+
+include/tls_certs.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/virtdisk.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/vadefs.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/utilapiset.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/urlmon.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/unknwnbase.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/unknwn.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/unistd.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/_timeval.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/_mingw_off_t.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/handleapi.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xtestintrin.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/timezoneapi.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/rpcnsi.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsavesintrin.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/dde.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/namespaceapi.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xmmintrin.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx5124fmapsintrin.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cmpccxaddintrin.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/x86gprintrin.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fma4intrin.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/stdarg.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/wbnoinvdintrin.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsaveoptintrin.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/waitpkgintrin.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/timeapi.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/_mingw_stdarg.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/cguid.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/vpclmulqdqintrin.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/vaesintrin.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tmmintrin.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/apisetcconv.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/corecrt_startup.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/smmintrin.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pkuintrin.h:
+
+sal/miracl/includes/ecp_BLS12381.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/shellapi.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/wmmintrin.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/shaintrin.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/rtmintrin.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx2intrin.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/rdseedintrin.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/winspool.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/poppack.h:
+
+include/tls_octads.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pmmintrin.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/x86intrin.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fp16vlintrin.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mwaitxintrin.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/windef.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/raointintrin.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mwaitintrin.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/winnls.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stdarg.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/swprintf.inl:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mm_malloc.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mm3dnow.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/lzcntintrin.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/wincrypt.h:
+
+C:/mingw64/include/c++/13.2.0/stdlib.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/popcntintrin.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/bemapiset.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/lwpintrin.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/limits.h:
+
+C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/cpu_defines.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/keylockerintrin.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxvnniint8intrin.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/mmsyscom.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxfp16intrin.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fmaintrin.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/lzexpand.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/_mingw_mac.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/_mingw_secapi.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/sal.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/processenv.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/winscard.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/bcrypt.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fxsrintrin.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/pshpack2.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/dlgs.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fintrin.h:
+
+sal/miracl/includes/arch.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bf16intrin.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/libloaderapi.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/_mingw_unicode.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxneconvertintrin.h:
+
+C:/mingw64/include/c++/13.2.0/pstl/pstl_config.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/oaidl.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vlintrin.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/winperf.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/gfniintrin.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/rpcnterr.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512cdintrin.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stddef.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/stralign.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxtileintrin.h:
+
+src/client.cpp:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pconfigintrin.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/objidl.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/adxintrin.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/enqcmdintrin.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxvnniintrin.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/threadpoollegacyapiset.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stdbool.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cetintrin.h:
+
+C:/mingw64/include/c++/13.2.0/bits/std_abs.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/winuser.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxint8intrin.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxintrin.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/mmsystem.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vnnivlintrin.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_fd_types.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/stdint.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxcomplexintrin.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/mcx.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/objidlbase.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512dqintrin.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/datetimeapi.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/objbase.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bitalgintrin.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/afunix.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx5124vnniwintrin.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/uintrintrin.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vldqintrin.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/sgxintrin.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clflushoptintrin.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/rpc.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/memoryapi.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/specstrings.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/_mingw.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxifmaintrin.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/threadpoolapiset.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512ifmaintrin.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/securitybaseapi.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512pfintrin.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsaveintrin.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/_bsd_types.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/imm.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/pthread_unistd.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mmintrin.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bwintrin.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vnniintrin.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/movdirintrin.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/sec_api/stdio_s.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/wincon.h:
+
+C:/mingw64/include/c++/13.2.0/cstdlib:
+
+C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/c++config.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/ia32intrin.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmivlintrin.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmi2vlintrin.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/winbase.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/reason.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/corecrt_wstdlib.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmiintrin.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vlbwintrin.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/prfchwintrin.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/pshpack8.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxbf16intrin.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vp2intersectintrin.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/corecrt.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vpopcntdqvlintrin.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fp16intrin.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/crtdefs.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vp2intersectvlintrin.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/apiset.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/bmi2intrin.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/ws2tcpip.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tbmintrin.h:
+
+C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/os_defines.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512erintrin.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512ifmavlintrin.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/basetsd.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clzerointrin.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vpopcntdqintrin.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/tvout.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/inttypes.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/pthread_time.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/cderr.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/combaseapi.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/f16cintrin.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/pshpack4.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/serializeintrin.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/commdlg.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/concurrencysal.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/corecrt_stdio_config.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/ddeml.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/stringapiset.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bf16vlintrin.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/dpapi.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/errhandlingapi.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/ws2ipdef.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/errno.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/winver.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/fibersapi.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/fileapi.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/excpt.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/fltwinerror.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/driverspecs.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/getopt.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/guiddef.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/stddef.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/debugapi.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/heapapi.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/in6addr.h:
+
+sal/miracl/includes/fp12_BLS12381.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/inaddr.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/hresetintrin.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/sysinfoapi.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/interlockedapi.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/io.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/emmintrin.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/ioapiset.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/immintrin.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/bmiintrin.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clwbintrin.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/jobapi.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/joystickapi.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_wsadata.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/winsmcrd.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/mmeapi.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/limits.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/malloc.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stdint.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ip_mreq1.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/minwinbase.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/mstcpip.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/wnnc.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/minwindef.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/time.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/mmiscapi.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/msxml.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/namedpipeapi.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/rpcasync.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/nb30.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/ncrypt.h:
+
+include/tls_sockets.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/processthreadsapi.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/rpcnsip.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/oleauto.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tsxldtrkintrin.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/servprov.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/realtimeapiset.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/oleidl.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/ktmtypes.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/playsoundapi.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/winreg.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/process.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cldemoteintrin.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/prsht.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ip_types.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/prfchiintrin.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_socket_types.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/rpcsal.h:
+
+sal/miracl/includes/config_curve_BLS12381.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ws1_undef.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_wsa_errnos.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/processtopologyapi.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/stdio.h:
+
+sal/miracl/includes/big_B384_58.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xopintrin.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/profileapi.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/propidl.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/intrin-impl.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/pshpack1.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/qos.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/synchapi.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsavecintrin.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/mmiscapi2.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/rpcdce.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/rpcdcep.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/rpcndr.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/sdkddkver.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/sdks/_mingw_ddk.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/ole2.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/sec_api/stdlib_s.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/sec_api/stralign_s.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/sec_api/string_s.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/ammintrin.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/securityappcontainer.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/stdlib.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/ctype.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/mciapi.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/sec_api/sys/timeb_s.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/string.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/sys/timeb.h:
+
+include/tls_pqibe.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/sys/types.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/syslimits.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmi2intrin.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/systemtopologyapi.h:
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/client.dir/compiler_depend.ts b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/client.dir/compiler_depend.ts
new file mode 100644
index 0000000..427e6bd
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/client.dir/compiler_depend.ts
@@ -0,0 +1,2 @@
+# CMAKE generated file: DO NOT EDIT!
+# Timestamp file for compiler generated dependencies management for client.
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/client.dir/depend.make b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/client.dir/depend.make
new file mode 100644
index 0000000..4139ff3
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/client.dir/depend.make
@@ -0,0 +1,2 @@
+# Empty dependencies file for client.
+# This may be replaced when dependencies are built.
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/client.dir/flags.make b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/client.dir/flags.make
new file mode 100644
index 0000000..64beddd
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/client.dir/flags.make
@@ -0,0 +1,10 @@
+# CMAKE generated file: DO NOT EDIT!
+# Generated by "MinGW Makefiles" Generator, CMake Version 3.28
+
+# compile CXX with C:/mingw64/bin/gcc.exe
+CXX_DEFINES = 
+
+CXX_INCLUDES = @CMakeFiles/client.dir/includes_CXX.rsp
+
+CXX_FLAGS = 
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/client.dir/includes_CXX.rsp b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/client.dir/includes_CXX.rsp
new file mode 100644
index 0000000..75b7757
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/client.dir/includes_CXX.rsp
@@ -0,0 +1 @@
+-I"D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include" -I"D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl" -I"D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes"
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/client.dir/link.txt b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/client.dir/link.txt
new file mode 100644
index 0000000..4b505b0
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/client.dir/link.txt
@@ -0,0 +1,3 @@
+C:\mingw64\bin\cmake.exe -E rm -f CMakeFiles\client.dir/objects.a
+C:\mingw64\bin\ar.exe qc CMakeFiles\client.dir/objects.a @CMakeFiles\client.dir\objects1.rsp
+C:\mingw64\bin\gcc.exe -Wl,--whole-archive CMakeFiles\client.dir/objects.a -Wl,--no-whole-archive -o client.exe -Wl,--out-implib,libclient.dll.a -Wl,--major-image-version,0,--minor-image-version,0 @CMakeFiles\client.dir\linkLibs.rsp
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/client.dir/linkLibs.rsp b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/client.dir/linkLibs.rsp
new file mode 100644
index 0000000..08d77c7
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/client.dir/linkLibs.rsp
@@ -0,0 +1 @@
+ libtiitls.a sal/miracl/core.a -loqs -lstdc++ -lws2_32 -lkernel32 -luser32 -lgdi32 -lwinspool -lshell32 -lole32 -loleaut32 -luuid -lcomdlg32 -ladvapi32 
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/client.dir/objects.a b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/client.dir/objects.a
new file mode 100644
index 0000000..9ceae7d
Binary files /dev/null and b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/client.dir/objects.a differ
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/client.dir/objects1.rsp b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/client.dir/objects1.rsp
new file mode 100644
index 0000000..cf86f30
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/client.dir/objects1.rsp
@@ -0,0 +1 @@
+CMakeFiles/client.dir/src/client.cpp.obj
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/client.dir/progress.make b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/client.dir/progress.make
new file mode 100644
index 0000000..7173dd1
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/client.dir/progress.make
@@ -0,0 +1,3 @@
+CMAKE_PROGRESS_1 = 1
+CMAKE_PROGRESS_2 = 2
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/client.dir/src/client.cpp.obj b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/client.dir/src/client.cpp.obj
new file mode 100644
index 0000000..7b3cebb
Binary files /dev/null and b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/client.dir/src/client.cpp.obj differ
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/client.dir/src/client.cpp.obj.d b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/client.dir/src/client.cpp.obj.d
new file mode 100644
index 0000000..641b1bc
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/client.dir/src/client.cpp.obj.d
@@ -0,0 +1,332 @@
+CMakeFiles/client.dir/src/client.cpp.obj: \
+ D:\DOKUMENTY\diplomovka-final\Scott-cpp-win\src\client.cpp \
+ C:/mingw64/x86_64-w64-mingw32/include/time.h \
+ C:/mingw64/x86_64-w64-mingw32/include/crtdefs.h \
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_mac.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_secapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/vadefs.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sdks/_mingw_ddk.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sys/timeb.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/sys/timeb_s.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_timeval.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pthread_time.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_sal.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls1_3.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stdint.h \
+ C:/mingw64/x86_64-w64-mingw32/include/stdint.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stddef.h \
+ C:/mingw64/x86_64-w64-mingw32/include/stddef.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_octads.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_sockets.h \
+ C:/mingw64/x86_64-w64-mingw32/include/string.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/string_s.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winsock2.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_unicode.h \
+ C:/mingw64/x86_64-w64-mingw32/include/windows.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sdkddkver.h \
+ C:/mingw64/x86_64-w64-mingw32/include/excpt.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stdarg.h \
+ C:/mingw64/x86_64-w64-mingw32/include/stdarg.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_stdarg.h \
+ C:/mingw64/x86_64-w64-mingw32/include/windef.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winapifamily.h \
+ C:/mingw64/x86_64-w64-mingw32/include/minwindef.h \
+ C:/mingw64/x86_64-w64-mingw32/include/specstrings.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sal.h \
+ C:/mingw64/x86_64-w64-mingw32/include/concurrencysal.h \
+ C:/mingw64/x86_64-w64-mingw32/include/driverspecs.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winnt.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ctype.h \
+ C:/mingw64/x86_64-w64-mingw32/include/apiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/intrin-impl.h \
+ C:/mingw64/x86_64-w64-mingw32/include/basetsd.h \
+ C:/mingw64/x86_64-w64-mingw32/include/guiddef.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/x86intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/x86gprintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/ia32intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/adxintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/bmiintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/bmi2intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cetintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cldemoteintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clflushoptintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clwbintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clzerointrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cmpccxaddintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/enqcmdintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fxsrintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/lzcntintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/lwpintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/movdirintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mwaitintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mwaitxintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pconfigintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/popcntintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pkuintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/prfchiintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/raointintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/rdseedintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/rtmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/serializeintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/sgxintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tbmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tsxldtrkintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/uintrintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/waitpkgintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/wbnoinvdintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsaveintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsavecintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsaveoptintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsavesintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xtestintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/hresetintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/immintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xmmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mm_malloc.h \
+ C:/mingw64/include/c++/13.2.0/stdlib.h \
+ C:/mingw64/include/c++/13.2.0/cstdlib \
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/c++config.h \
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/os_defines.h \
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/cpu_defines.h \
+ C:/mingw64/include/c++/13.2.0/pstl/pstl_config.h \
+ C:/mingw64/x86_64-w64-mingw32/include/stdlib.h \
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt_wstdlib.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/limits.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/syslimits.h \
+ C:/mingw64/x86_64-w64-mingw32/include/limits.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/stdlib_s.h \
+ C:/mingw64/x86_64-w64-mingw32/include/malloc.h \
+ C:/mingw64/include/c++/13.2.0/bits/std_abs.h \
+ C:/mingw64/x86_64-w64-mingw32/include/errno.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/emmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pmmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tmmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/smmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/wmmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxvnniintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxifmaintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxvnniint8intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx2intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512erintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512pfintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512cdintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bwintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512dqintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vlbwintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vldqintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512ifmaintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512ifmavlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmiintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmivlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx5124fmapsintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx5124vnniwintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vpopcntdqintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmi2intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmi2vlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vnniintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vnnivlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vpopcntdqvlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bitalgintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vp2intersectintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vp2intersectvlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fp16intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fp16vlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/shaintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fmaintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/f16cintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/gfniintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/vaesintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/vpclmulqdqintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bf16vlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bf16intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxneconvertintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxtileintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxint8intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxbf16intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxcomplexintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/prfchwintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/keylockerintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxfp16intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mm3dnow.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fma4intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/ammintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xopintrin.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack4.h \
+ C:/mingw64/x86_64-w64-mingw32/include/poppack.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack4.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack2.h \
+ C:/mingw64/x86_64-w64-mingw32/include/poppack.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack2.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack8.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack8.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ktmtypes.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winbase.h \
+ C:/mingw64/x86_64-w64-mingw32/include/apisetcconv.h \
+ C:/mingw64/x86_64-w64-mingw32/include/minwinbase.h \
+ C:/mingw64/x86_64-w64-mingw32/include/bemapiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/debugapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/errhandlingapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/fibersapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/fileapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/handleapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/heapapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ioapiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/interlockedapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/jobapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/libloaderapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/memoryapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/namedpipeapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/namespaceapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/processenv.h \
+ C:/mingw64/x86_64-w64-mingw32/include/processthreadsapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/processtopologyapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/profileapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/realtimeapiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/securityappcontainer.h \
+ C:/mingw64/x86_64-w64-mingw32/include/securitybaseapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/synchapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sysinfoapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/systemtopologyapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/threadpoolapiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/threadpoollegacyapiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/utilapiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/wow64apiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winerror.h \
+ C:/mingw64/x86_64-w64-mingw32/include/fltwinerror.h \
+ C:/mingw64/x86_64-w64-mingw32/include/timezoneapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/wingdi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack1.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winuser.h \
+ C:/mingw64/x86_64-w64-mingw32/include/tvout.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winnls.h \
+ C:/mingw64/x86_64-w64-mingw32/include/datetimeapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/stringapiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/wincon.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winver.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winreg.h \
+ C:/mingw64/x86_64-w64-mingw32/include/reason.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winnetwk.h \
+ C:/mingw64/x86_64-w64-mingw32/include/wnnc.h \
+ C:/mingw64/x86_64-w64-mingw32/include/virtdisk.h \
+ C:/mingw64/x86_64-w64-mingw32/include/cderr.h \
+ C:/mingw64/x86_64-w64-mingw32/include/dde.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ddeml.h \
+ C:/mingw64/x86_64-w64-mingw32/include/dlgs.h \
+ C:/mingw64/x86_64-w64-mingw32/include/lzexpand.h \
+ C:/mingw64/x86_64-w64-mingw32/include/mmsystem.h \
+ C:/mingw64/x86_64-w64-mingw32/include/mmsyscom.h \
+ C:/mingw64/x86_64-w64-mingw32/include/mciapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/mmiscapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/mmiscapi2.h \
+ C:/mingw64/x86_64-w64-mingw32/include/playsoundapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/mmeapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/timeapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/joystickapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/nb30.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpc.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpcdce.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpcdcep.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpcnsi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpcnterr.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpcasync.h \
+ C:/mingw64/x86_64-w64-mingw32/include/shellapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winperf.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winsock.h \
+ C:/mingw64/x86_64-w64-mingw32/include/wincrypt.h \
+ C:/mingw64/x86_64-w64-mingw32/include/bcrypt.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ncrypt.h \
+ C:/mingw64/x86_64-w64-mingw32/include/dpapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winefs.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winscard.h \
+ C:/mingw64/x86_64-w64-mingw32/include/wtypes.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpcndr.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpcnsip.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpcsal.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ole2.h \
+ C:/mingw64/x86_64-w64-mingw32/include/objbase.h \
+ C:/mingw64/x86_64-w64-mingw32/include/combaseapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/wtypesbase.h \
+ C:/mingw64/x86_64-w64-mingw32/include/unknwnbase.h \
+ C:/mingw64/x86_64-w64-mingw32/include/objidlbase.h \
+ C:/mingw64/x86_64-w64-mingw32/include/cguid.h \
+ C:/mingw64/x86_64-w64-mingw32/include/objidl.h \
+ C:/mingw64/x86_64-w64-mingw32/include/unknwn.h \
+ C:/mingw64/x86_64-w64-mingw32/include/urlmon.h \
+ C:/mingw64/x86_64-w64-mingw32/include/oleidl.h \
+ C:/mingw64/x86_64-w64-mingw32/include/servprov.h \
+ C:/mingw64/x86_64-w64-mingw32/include/msxml.h \
+ C:/mingw64/x86_64-w64-mingw32/include/oaidl.h \
+ C:/mingw64/x86_64-w64-mingw32/include/propidl.h \
+ C:/mingw64/x86_64-w64-mingw32/include/oleauto.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winioctl.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winsmcrd.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winspool.h \
+ C:/mingw64/x86_64-w64-mingw32/include/prsht.h \
+ C:/mingw64/x86_64-w64-mingw32/include/commdlg.h \
+ C:/mingw64/x86_64-w64-mingw32/include/stralign.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/stralign_s.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winsvc.h \
+ C:/mingw64/x86_64-w64-mingw32/include/mcx.h \
+ C:/mingw64/x86_64-w64-mingw32/include/imm.h \
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ws1_undef.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_bsd_types.h \
+ C:/mingw64/x86_64-w64-mingw32/include/inaddr.h \
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_socket_types.h \
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_fd_types.h \
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ip_types.h \
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_wsadata.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ws2def.h \
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_wsa_errnos.h \
+ C:/mingw64/x86_64-w64-mingw32/include/qos.h \
+ C:/mingw64/x86_64-w64-mingw32/include/afunix.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ws2tcpip.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ws2ipdef.h \
+ C:/mingw64/x86_64-w64-mingw32/include/in6addr.h \
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ip_mreq1.h \
+ C:/mingw64/x86_64-w64-mingw32/include/mstcpip.h \
+ C:/mingw64/x86_64-w64-mingw32/include/unistd.h \
+ C:/mingw64/x86_64-w64-mingw32/include/io.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_off_t.h \
+ C:/mingw64/x86_64-w64-mingw32/include/process.h \
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt_startup.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sys/types.h \
+ C:/mingw64/x86_64-w64-mingw32/include/getopt.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pthread_unistd.h \
+ C:/mingw64/x86_64-w64-mingw32/include/stdio.h \
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt_stdio_config.h \
+ C:/mingw64/x86_64-w64-mingw32/include/swprintf.inl \
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/stdio_s.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_protocol.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_keys_calc.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_sal.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_client_recv.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_client_send.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_cert_chain.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_x509.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_logger.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_certs.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_tickets.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_bfibe.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/pair_BLS12381.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/fp12_BLS12381.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/fp4_BLS12381.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/fp2_BLS12381.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/fp_BLS12381.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/big_B384_58.h \
+ C:/mingw64/x86_64-w64-mingw32/include/inttypes.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/arch.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/core.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stdbool.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/config_big_B384_58.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/config_field_BLS12381.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/config_curve_BLS12381.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/ecp2_BLS12381.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/ecp_BLS12381.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_pqibe.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/core.h
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/cmake.check_cache b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/cmake.check_cache
new file mode 100644
index 0000000..56c437b
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/cmake.check_cache
@@ -0,0 +1 @@
+# This file is generated by cmake for dependency checking of the CMakeCache.txt file
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/progress.marks b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/progress.marks
new file mode 100644
index 0000000..0cee939
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/progress.marks
@@ -0,0 +1 @@
+18
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/DependInfo.cmake b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/DependInfo.cmake
new file mode 100644
index 0000000..a9814f5
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/DependInfo.cmake
@@ -0,0 +1,37 @@
+
+# Consider dependencies only in project.
+set(CMAKE_DEPENDS_IN_PROJECT_ONLY OFF)
+
+# The set of languages for which implicit dependencies are needed:
+set(CMAKE_DEPENDS_LANGUAGES
+  )
+
+# The set of dependency files which are needed:
+set(CMAKE_DEPENDS_DEPENDENCY_FILES
+  "D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/lib/ibe/tls_bfibe.cpp" "CMakeFiles/tiitls.dir/lib/ibe/tls_bfibe.cpp.obj" "gcc" "CMakeFiles/tiitls.dir/lib/ibe/tls_bfibe.cpp.obj.d"
+  "D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/lib/ibe/tls_pqibe.cpp" "CMakeFiles/tiitls.dir/lib/ibe/tls_pqibe.cpp.obj" "gcc" "CMakeFiles/tiitls.dir/lib/ibe/tls_pqibe.cpp.obj.d"
+  "D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/lib/tls_cacerts.cpp" "CMakeFiles/tiitls.dir/lib/tls_cacerts.cpp.obj" "gcc" "CMakeFiles/tiitls.dir/lib/tls_cacerts.cpp.obj.d"
+  "D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/lib/tls_cert_chain.cpp" "CMakeFiles/tiitls.dir/lib/tls_cert_chain.cpp.obj" "gcc" "CMakeFiles/tiitls.dir/lib/tls_cert_chain.cpp.obj.d"
+  "D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/lib/tls_client_cert.cpp" "CMakeFiles/tiitls.dir/lib/tls_client_cert.cpp.obj" "gcc" "CMakeFiles/tiitls.dir/lib/tls_client_cert.cpp.obj.d"
+  "D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/lib/tls_client_recv.cpp" "CMakeFiles/tiitls.dir/lib/tls_client_recv.cpp.obj" "gcc" "CMakeFiles/tiitls.dir/lib/tls_client_recv.cpp.obj.d"
+  "D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/lib/tls_client_send.cpp" "CMakeFiles/tiitls.dir/lib/tls_client_send.cpp.obj" "gcc" "CMakeFiles/tiitls.dir/lib/tls_client_send.cpp.obj.d"
+  "D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/lib/tls_keys_calc.cpp" "CMakeFiles/tiitls.dir/lib/tls_keys_calc.cpp.obj" "gcc" "CMakeFiles/tiitls.dir/lib/tls_keys_calc.cpp.obj.d"
+  "D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/lib/tls_logger.cpp" "CMakeFiles/tiitls.dir/lib/tls_logger.cpp.obj" "gcc" "CMakeFiles/tiitls.dir/lib/tls_logger.cpp.obj.d"
+  "D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/lib/tls_octads.cpp" "CMakeFiles/tiitls.dir/lib/tls_octads.cpp.obj" "gcc" "CMakeFiles/tiitls.dir/lib/tls_octads.cpp.obj.d"
+  "D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/lib/tls_protocol.cpp" "CMakeFiles/tiitls.dir/lib/tls_protocol.cpp.obj" "gcc" "CMakeFiles/tiitls.dir/lib/tls_protocol.cpp.obj.d"
+  "D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/lib/tls_sal.cpp" "CMakeFiles/tiitls.dir/lib/tls_sal.cpp.obj" "gcc" "CMakeFiles/tiitls.dir/lib/tls_sal.cpp.obj.d"
+  "D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/lib/tls_sockets.cpp" "CMakeFiles/tiitls.dir/lib/tls_sockets.cpp.obj" "gcc" "CMakeFiles/tiitls.dir/lib/tls_sockets.cpp.obj.d"
+  "D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/lib/tls_tickets.cpp" "CMakeFiles/tiitls.dir/lib/tls_tickets.cpp.obj" "gcc" "CMakeFiles/tiitls.dir/lib/tls_tickets.cpp.obj.d"
+  "D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/lib/tls_x509.cpp" "CMakeFiles/tiitls.dir/lib/tls_x509.cpp.obj" "gcc" "CMakeFiles/tiitls.dir/lib/tls_x509.cpp.obj.d"
+  )
+
+# Targets to which this target links which contain Fortran sources.
+set(CMAKE_Fortran_TARGET_LINKED_INFO_FILES
+  )
+
+# Targets to which this target links which contain Fortran sources.
+set(CMAKE_Fortran_TARGET_FORWARD_LINKED_INFO_FILES
+  )
+
+# Fortran module output directory.
+set(CMAKE_Fortran_TARGET_MODULE_DIR "")
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/build.make b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/build.make
new file mode 100644
index 0000000..c9bcb3e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/build.make
@@ -0,0 +1,349 @@
+# CMAKE generated file: DO NOT EDIT!
+# Generated by "MinGW Makefiles" Generator, CMake Version 3.28
+
+# Delete rule output on recipe failure.
+.DELETE_ON_ERROR:
+
+#=============================================================================
+# Special targets provided by cmake.
+
+# Disable implicit rules so canonical targets will work.
+.SUFFIXES:
+
+# Disable VCS-based implicit rules.
+% : %,v
+
+# Disable VCS-based implicit rules.
+% : RCS/%
+
+# Disable VCS-based implicit rules.
+% : RCS/%,v
+
+# Disable VCS-based implicit rules.
+% : SCCS/s.%
+
+# Disable VCS-based implicit rules.
+% : s.%
+
+.SUFFIXES: .hpux_make_needs_suffix_list
+
+# Command-line flag to silence nested $(MAKE).
+$(VERBOSE)MAKESILENT = -s
+
+#Suppress display of executed commands.
+$(VERBOSE).SILENT:
+
+# A target that is always out of date.
+cmake_force:
+.PHONY : cmake_force
+
+#=============================================================================
+# Set environment variables for the build.
+
+SHELL = cmd.exe
+
+# The CMake executable.
+CMAKE_COMMAND = C:\mingw64\bin\cmake.exe
+
+# The command to remove a file.
+RM = C:\mingw64\bin\cmake.exe -E rm -f
+
+# Escaping for special characters.
+EQUALS = =
+
+# The top-level source directory on which CMake was run.
+CMAKE_SOURCE_DIR = D:\DOKUMENTY\diplomovka-final\Scott-cpp-win
+
+# The top-level build directory on which CMake was run.
+CMAKE_BINARY_DIR = D:\DOKUMENTY\diplomovka-final\Scott-cpp-win
+
+# Include any dependencies generated for this target.
+include CMakeFiles/tiitls.dir/depend.make
+# Include any dependencies generated by the compiler for this target.
+include CMakeFiles/tiitls.dir/compiler_depend.make
+
+# Include the progress variables for this target.
+include CMakeFiles/tiitls.dir/progress.make
+
+# Include the compile flags for this target's objects.
+include CMakeFiles/tiitls.dir/flags.make
+
+CMakeFiles/tiitls.dir/lib/tls_cert_chain.cpp.obj: CMakeFiles/tiitls.dir/flags.make
+CMakeFiles/tiitls.dir/lib/tls_cert_chain.cpp.obj: CMakeFiles/tiitls.dir/includes_CXX.rsp
+CMakeFiles/tiitls.dir/lib/tls_cert_chain.cpp.obj: lib/tls_cert_chain.cpp
+CMakeFiles/tiitls.dir/lib/tls_cert_chain.cpp.obj: CMakeFiles/tiitls.dir/compiler_depend.ts
+	@$(CMAKE_COMMAND) -E cmake_echo_color "--switch=$(COLOR)" --green --progress-dir=D:\DOKUMENTY\diplomovka-final\Scott-cpp-win\CMakeFiles --progress-num=$(CMAKE_PROGRESS_1) "Building CXX object CMakeFiles/tiitls.dir/lib/tls_cert_chain.cpp.obj"
+	C:\mingw64\bin\gcc.exe $(CXX_DEFINES) $(CXX_INCLUDES) $(CXX_FLAGS) -MD -MT CMakeFiles/tiitls.dir/lib/tls_cert_chain.cpp.obj -MF CMakeFiles\tiitls.dir\lib\tls_cert_chain.cpp.obj.d -o CMakeFiles\tiitls.dir\lib\tls_cert_chain.cpp.obj -c D:\DOKUMENTY\diplomovka-final\Scott-cpp-win\lib\tls_cert_chain.cpp
+
+CMakeFiles/tiitls.dir/lib/tls_cert_chain.cpp.i: cmake_force
+	@$(CMAKE_COMMAND) -E cmake_echo_color "--switch=$(COLOR)" --green "Preprocessing CXX source to CMakeFiles/tiitls.dir/lib/tls_cert_chain.cpp.i"
+	C:\mingw64\bin\gcc.exe $(CXX_DEFINES) $(CXX_INCLUDES) $(CXX_FLAGS) -E D:\DOKUMENTY\diplomovka-final\Scott-cpp-win\lib\tls_cert_chain.cpp > CMakeFiles\tiitls.dir\lib\tls_cert_chain.cpp.i
+
+CMakeFiles/tiitls.dir/lib/tls_cert_chain.cpp.s: cmake_force
+	@$(CMAKE_COMMAND) -E cmake_echo_color "--switch=$(COLOR)" --green "Compiling CXX source to assembly CMakeFiles/tiitls.dir/lib/tls_cert_chain.cpp.s"
+	C:\mingw64\bin\gcc.exe $(CXX_DEFINES) $(CXX_INCLUDES) $(CXX_FLAGS) -S D:\DOKUMENTY\diplomovka-final\Scott-cpp-win\lib\tls_cert_chain.cpp -o CMakeFiles\tiitls.dir\lib\tls_cert_chain.cpp.s
+
+CMakeFiles/tiitls.dir/lib/tls_client_recv.cpp.obj: CMakeFiles/tiitls.dir/flags.make
+CMakeFiles/tiitls.dir/lib/tls_client_recv.cpp.obj: CMakeFiles/tiitls.dir/includes_CXX.rsp
+CMakeFiles/tiitls.dir/lib/tls_client_recv.cpp.obj: lib/tls_client_recv.cpp
+CMakeFiles/tiitls.dir/lib/tls_client_recv.cpp.obj: CMakeFiles/tiitls.dir/compiler_depend.ts
+	@$(CMAKE_COMMAND) -E cmake_echo_color "--switch=$(COLOR)" --green --progress-dir=D:\DOKUMENTY\diplomovka-final\Scott-cpp-win\CMakeFiles --progress-num=$(CMAKE_PROGRESS_2) "Building CXX object CMakeFiles/tiitls.dir/lib/tls_client_recv.cpp.obj"
+	C:\mingw64\bin\gcc.exe $(CXX_DEFINES) $(CXX_INCLUDES) $(CXX_FLAGS) -MD -MT CMakeFiles/tiitls.dir/lib/tls_client_recv.cpp.obj -MF CMakeFiles\tiitls.dir\lib\tls_client_recv.cpp.obj.d -o CMakeFiles\tiitls.dir\lib\tls_client_recv.cpp.obj -c D:\DOKUMENTY\diplomovka-final\Scott-cpp-win\lib\tls_client_recv.cpp
+
+CMakeFiles/tiitls.dir/lib/tls_client_recv.cpp.i: cmake_force
+	@$(CMAKE_COMMAND) -E cmake_echo_color "--switch=$(COLOR)" --green "Preprocessing CXX source to CMakeFiles/tiitls.dir/lib/tls_client_recv.cpp.i"
+	C:\mingw64\bin\gcc.exe $(CXX_DEFINES) $(CXX_INCLUDES) $(CXX_FLAGS) -E D:\DOKUMENTY\diplomovka-final\Scott-cpp-win\lib\tls_client_recv.cpp > CMakeFiles\tiitls.dir\lib\tls_client_recv.cpp.i
+
+CMakeFiles/tiitls.dir/lib/tls_client_recv.cpp.s: cmake_force
+	@$(CMAKE_COMMAND) -E cmake_echo_color "--switch=$(COLOR)" --green "Compiling CXX source to assembly CMakeFiles/tiitls.dir/lib/tls_client_recv.cpp.s"
+	C:\mingw64\bin\gcc.exe $(CXX_DEFINES) $(CXX_INCLUDES) $(CXX_FLAGS) -S D:\DOKUMENTY\diplomovka-final\Scott-cpp-win\lib\tls_client_recv.cpp -o CMakeFiles\tiitls.dir\lib\tls_client_recv.cpp.s
+
+CMakeFiles/tiitls.dir/lib/tls_client_send.cpp.obj: CMakeFiles/tiitls.dir/flags.make
+CMakeFiles/tiitls.dir/lib/tls_client_send.cpp.obj: CMakeFiles/tiitls.dir/includes_CXX.rsp
+CMakeFiles/tiitls.dir/lib/tls_client_send.cpp.obj: lib/tls_client_send.cpp
+CMakeFiles/tiitls.dir/lib/tls_client_send.cpp.obj: CMakeFiles/tiitls.dir/compiler_depend.ts
+	@$(CMAKE_COMMAND) -E cmake_echo_color "--switch=$(COLOR)" --green --progress-dir=D:\DOKUMENTY\diplomovka-final\Scott-cpp-win\CMakeFiles --progress-num=$(CMAKE_PROGRESS_3) "Building CXX object CMakeFiles/tiitls.dir/lib/tls_client_send.cpp.obj"
+	C:\mingw64\bin\gcc.exe $(CXX_DEFINES) $(CXX_INCLUDES) $(CXX_FLAGS) -MD -MT CMakeFiles/tiitls.dir/lib/tls_client_send.cpp.obj -MF CMakeFiles\tiitls.dir\lib\tls_client_send.cpp.obj.d -o CMakeFiles\tiitls.dir\lib\tls_client_send.cpp.obj -c D:\DOKUMENTY\diplomovka-final\Scott-cpp-win\lib\tls_client_send.cpp
+
+CMakeFiles/tiitls.dir/lib/tls_client_send.cpp.i: cmake_force
+	@$(CMAKE_COMMAND) -E cmake_echo_color "--switch=$(COLOR)" --green "Preprocessing CXX source to CMakeFiles/tiitls.dir/lib/tls_client_send.cpp.i"
+	C:\mingw64\bin\gcc.exe $(CXX_DEFINES) $(CXX_INCLUDES) $(CXX_FLAGS) -E D:\DOKUMENTY\diplomovka-final\Scott-cpp-win\lib\tls_client_send.cpp > CMakeFiles\tiitls.dir\lib\tls_client_send.cpp.i
+
+CMakeFiles/tiitls.dir/lib/tls_client_send.cpp.s: cmake_force
+	@$(CMAKE_COMMAND) -E cmake_echo_color "--switch=$(COLOR)" --green "Compiling CXX source to assembly CMakeFiles/tiitls.dir/lib/tls_client_send.cpp.s"
+	C:\mingw64\bin\gcc.exe $(CXX_DEFINES) $(CXX_INCLUDES) $(CXX_FLAGS) -S D:\DOKUMENTY\diplomovka-final\Scott-cpp-win\lib\tls_client_send.cpp -o CMakeFiles\tiitls.dir\lib\tls_client_send.cpp.s
+
+CMakeFiles/tiitls.dir/lib/tls_keys_calc.cpp.obj: CMakeFiles/tiitls.dir/flags.make
+CMakeFiles/tiitls.dir/lib/tls_keys_calc.cpp.obj: CMakeFiles/tiitls.dir/includes_CXX.rsp
+CMakeFiles/tiitls.dir/lib/tls_keys_calc.cpp.obj: lib/tls_keys_calc.cpp
+CMakeFiles/tiitls.dir/lib/tls_keys_calc.cpp.obj: CMakeFiles/tiitls.dir/compiler_depend.ts
+	@$(CMAKE_COMMAND) -E cmake_echo_color "--switch=$(COLOR)" --green --progress-dir=D:\DOKUMENTY\diplomovka-final\Scott-cpp-win\CMakeFiles --progress-num=$(CMAKE_PROGRESS_4) "Building CXX object CMakeFiles/tiitls.dir/lib/tls_keys_calc.cpp.obj"
+	C:\mingw64\bin\gcc.exe $(CXX_DEFINES) $(CXX_INCLUDES) $(CXX_FLAGS) -MD -MT CMakeFiles/tiitls.dir/lib/tls_keys_calc.cpp.obj -MF CMakeFiles\tiitls.dir\lib\tls_keys_calc.cpp.obj.d -o CMakeFiles\tiitls.dir\lib\tls_keys_calc.cpp.obj -c D:\DOKUMENTY\diplomovka-final\Scott-cpp-win\lib\tls_keys_calc.cpp
+
+CMakeFiles/tiitls.dir/lib/tls_keys_calc.cpp.i: cmake_force
+	@$(CMAKE_COMMAND) -E cmake_echo_color "--switch=$(COLOR)" --green "Preprocessing CXX source to CMakeFiles/tiitls.dir/lib/tls_keys_calc.cpp.i"
+	C:\mingw64\bin\gcc.exe $(CXX_DEFINES) $(CXX_INCLUDES) $(CXX_FLAGS) -E D:\DOKUMENTY\diplomovka-final\Scott-cpp-win\lib\tls_keys_calc.cpp > CMakeFiles\tiitls.dir\lib\tls_keys_calc.cpp.i
+
+CMakeFiles/tiitls.dir/lib/tls_keys_calc.cpp.s: cmake_force
+	@$(CMAKE_COMMAND) -E cmake_echo_color "--switch=$(COLOR)" --green "Compiling CXX source to assembly CMakeFiles/tiitls.dir/lib/tls_keys_calc.cpp.s"
+	C:\mingw64\bin\gcc.exe $(CXX_DEFINES) $(CXX_INCLUDES) $(CXX_FLAGS) -S D:\DOKUMENTY\diplomovka-final\Scott-cpp-win\lib\tls_keys_calc.cpp -o CMakeFiles\tiitls.dir\lib\tls_keys_calc.cpp.s
+
+CMakeFiles/tiitls.dir/lib/tls_sockets.cpp.obj: CMakeFiles/tiitls.dir/flags.make
+CMakeFiles/tiitls.dir/lib/tls_sockets.cpp.obj: CMakeFiles/tiitls.dir/includes_CXX.rsp
+CMakeFiles/tiitls.dir/lib/tls_sockets.cpp.obj: lib/tls_sockets.cpp
+CMakeFiles/tiitls.dir/lib/tls_sockets.cpp.obj: CMakeFiles/tiitls.dir/compiler_depend.ts
+	@$(CMAKE_COMMAND) -E cmake_echo_color "--switch=$(COLOR)" --green --progress-dir=D:\DOKUMENTY\diplomovka-final\Scott-cpp-win\CMakeFiles --progress-num=$(CMAKE_PROGRESS_5) "Building CXX object CMakeFiles/tiitls.dir/lib/tls_sockets.cpp.obj"
+	C:\mingw64\bin\gcc.exe $(CXX_DEFINES) $(CXX_INCLUDES) $(CXX_FLAGS) -MD -MT CMakeFiles/tiitls.dir/lib/tls_sockets.cpp.obj -MF CMakeFiles\tiitls.dir\lib\tls_sockets.cpp.obj.d -o CMakeFiles\tiitls.dir\lib\tls_sockets.cpp.obj -c D:\DOKUMENTY\diplomovka-final\Scott-cpp-win\lib\tls_sockets.cpp
+
+CMakeFiles/tiitls.dir/lib/tls_sockets.cpp.i: cmake_force
+	@$(CMAKE_COMMAND) -E cmake_echo_color "--switch=$(COLOR)" --green "Preprocessing CXX source to CMakeFiles/tiitls.dir/lib/tls_sockets.cpp.i"
+	C:\mingw64\bin\gcc.exe $(CXX_DEFINES) $(CXX_INCLUDES) $(CXX_FLAGS) -E D:\DOKUMENTY\diplomovka-final\Scott-cpp-win\lib\tls_sockets.cpp > CMakeFiles\tiitls.dir\lib\tls_sockets.cpp.i
+
+CMakeFiles/tiitls.dir/lib/tls_sockets.cpp.s: cmake_force
+	@$(CMAKE_COMMAND) -E cmake_echo_color "--switch=$(COLOR)" --green "Compiling CXX source to assembly CMakeFiles/tiitls.dir/lib/tls_sockets.cpp.s"
+	C:\mingw64\bin\gcc.exe $(CXX_DEFINES) $(CXX_INCLUDES) $(CXX_FLAGS) -S D:\DOKUMENTY\diplomovka-final\Scott-cpp-win\lib\tls_sockets.cpp -o CMakeFiles\tiitls.dir\lib\tls_sockets.cpp.s
+
+CMakeFiles/tiitls.dir/lib/tls_octads.cpp.obj: CMakeFiles/tiitls.dir/flags.make
+CMakeFiles/tiitls.dir/lib/tls_octads.cpp.obj: CMakeFiles/tiitls.dir/includes_CXX.rsp
+CMakeFiles/tiitls.dir/lib/tls_octads.cpp.obj: lib/tls_octads.cpp
+CMakeFiles/tiitls.dir/lib/tls_octads.cpp.obj: CMakeFiles/tiitls.dir/compiler_depend.ts
+	@$(CMAKE_COMMAND) -E cmake_echo_color "--switch=$(COLOR)" --green --progress-dir=D:\DOKUMENTY\diplomovka-final\Scott-cpp-win\CMakeFiles --progress-num=$(CMAKE_PROGRESS_6) "Building CXX object CMakeFiles/tiitls.dir/lib/tls_octads.cpp.obj"
+	C:\mingw64\bin\gcc.exe $(CXX_DEFINES) $(CXX_INCLUDES) $(CXX_FLAGS) -MD -MT CMakeFiles/tiitls.dir/lib/tls_octads.cpp.obj -MF CMakeFiles\tiitls.dir\lib\tls_octads.cpp.obj.d -o CMakeFiles\tiitls.dir\lib\tls_octads.cpp.obj -c D:\DOKUMENTY\diplomovka-final\Scott-cpp-win\lib\tls_octads.cpp
+
+CMakeFiles/tiitls.dir/lib/tls_octads.cpp.i: cmake_force
+	@$(CMAKE_COMMAND) -E cmake_echo_color "--switch=$(COLOR)" --green "Preprocessing CXX source to CMakeFiles/tiitls.dir/lib/tls_octads.cpp.i"
+	C:\mingw64\bin\gcc.exe $(CXX_DEFINES) $(CXX_INCLUDES) $(CXX_FLAGS) -E D:\DOKUMENTY\diplomovka-final\Scott-cpp-win\lib\tls_octads.cpp > CMakeFiles\tiitls.dir\lib\tls_octads.cpp.i
+
+CMakeFiles/tiitls.dir/lib/tls_octads.cpp.s: cmake_force
+	@$(CMAKE_COMMAND) -E cmake_echo_color "--switch=$(COLOR)" --green "Compiling CXX source to assembly CMakeFiles/tiitls.dir/lib/tls_octads.cpp.s"
+	C:\mingw64\bin\gcc.exe $(CXX_DEFINES) $(CXX_INCLUDES) $(CXX_FLAGS) -S D:\DOKUMENTY\diplomovka-final\Scott-cpp-win\lib\tls_octads.cpp -o CMakeFiles\tiitls.dir\lib\tls_octads.cpp.s
+
+CMakeFiles/tiitls.dir/lib/tls_logger.cpp.obj: CMakeFiles/tiitls.dir/flags.make
+CMakeFiles/tiitls.dir/lib/tls_logger.cpp.obj: CMakeFiles/tiitls.dir/includes_CXX.rsp
+CMakeFiles/tiitls.dir/lib/tls_logger.cpp.obj: lib/tls_logger.cpp
+CMakeFiles/tiitls.dir/lib/tls_logger.cpp.obj: CMakeFiles/tiitls.dir/compiler_depend.ts
+	@$(CMAKE_COMMAND) -E cmake_echo_color "--switch=$(COLOR)" --green --progress-dir=D:\DOKUMENTY\diplomovka-final\Scott-cpp-win\CMakeFiles --progress-num=$(CMAKE_PROGRESS_7) "Building CXX object CMakeFiles/tiitls.dir/lib/tls_logger.cpp.obj"
+	C:\mingw64\bin\gcc.exe $(CXX_DEFINES) $(CXX_INCLUDES) $(CXX_FLAGS) -MD -MT CMakeFiles/tiitls.dir/lib/tls_logger.cpp.obj -MF CMakeFiles\tiitls.dir\lib\tls_logger.cpp.obj.d -o CMakeFiles\tiitls.dir\lib\tls_logger.cpp.obj -c D:\DOKUMENTY\diplomovka-final\Scott-cpp-win\lib\tls_logger.cpp
+
+CMakeFiles/tiitls.dir/lib/tls_logger.cpp.i: cmake_force
+	@$(CMAKE_COMMAND) -E cmake_echo_color "--switch=$(COLOR)" --green "Preprocessing CXX source to CMakeFiles/tiitls.dir/lib/tls_logger.cpp.i"
+	C:\mingw64\bin\gcc.exe $(CXX_DEFINES) $(CXX_INCLUDES) $(CXX_FLAGS) -E D:\DOKUMENTY\diplomovka-final\Scott-cpp-win\lib\tls_logger.cpp > CMakeFiles\tiitls.dir\lib\tls_logger.cpp.i
+
+CMakeFiles/tiitls.dir/lib/tls_logger.cpp.s: cmake_force
+	@$(CMAKE_COMMAND) -E cmake_echo_color "--switch=$(COLOR)" --green "Compiling CXX source to assembly CMakeFiles/tiitls.dir/lib/tls_logger.cpp.s"
+	C:\mingw64\bin\gcc.exe $(CXX_DEFINES) $(CXX_INCLUDES) $(CXX_FLAGS) -S D:\DOKUMENTY\diplomovka-final\Scott-cpp-win\lib\tls_logger.cpp -o CMakeFiles\tiitls.dir\lib\tls_logger.cpp.s
+
+CMakeFiles/tiitls.dir/lib/tls_protocol.cpp.obj: CMakeFiles/tiitls.dir/flags.make
+CMakeFiles/tiitls.dir/lib/tls_protocol.cpp.obj: CMakeFiles/tiitls.dir/includes_CXX.rsp
+CMakeFiles/tiitls.dir/lib/tls_protocol.cpp.obj: lib/tls_protocol.cpp
+CMakeFiles/tiitls.dir/lib/tls_protocol.cpp.obj: CMakeFiles/tiitls.dir/compiler_depend.ts
+	@$(CMAKE_COMMAND) -E cmake_echo_color "--switch=$(COLOR)" --green --progress-dir=D:\DOKUMENTY\diplomovka-final\Scott-cpp-win\CMakeFiles --progress-num=$(CMAKE_PROGRESS_8) "Building CXX object CMakeFiles/tiitls.dir/lib/tls_protocol.cpp.obj"
+	C:\mingw64\bin\gcc.exe $(CXX_DEFINES) $(CXX_INCLUDES) $(CXX_FLAGS) -MD -MT CMakeFiles/tiitls.dir/lib/tls_protocol.cpp.obj -MF CMakeFiles\tiitls.dir\lib\tls_protocol.cpp.obj.d -o CMakeFiles\tiitls.dir\lib\tls_protocol.cpp.obj -c D:\DOKUMENTY\diplomovka-final\Scott-cpp-win\lib\tls_protocol.cpp
+
+CMakeFiles/tiitls.dir/lib/tls_protocol.cpp.i: cmake_force
+	@$(CMAKE_COMMAND) -E cmake_echo_color "--switch=$(COLOR)" --green "Preprocessing CXX source to CMakeFiles/tiitls.dir/lib/tls_protocol.cpp.i"
+	C:\mingw64\bin\gcc.exe $(CXX_DEFINES) $(CXX_INCLUDES) $(CXX_FLAGS) -E D:\DOKUMENTY\diplomovka-final\Scott-cpp-win\lib\tls_protocol.cpp > CMakeFiles\tiitls.dir\lib\tls_protocol.cpp.i
+
+CMakeFiles/tiitls.dir/lib/tls_protocol.cpp.s: cmake_force
+	@$(CMAKE_COMMAND) -E cmake_echo_color "--switch=$(COLOR)" --green "Compiling CXX source to assembly CMakeFiles/tiitls.dir/lib/tls_protocol.cpp.s"
+	C:\mingw64\bin\gcc.exe $(CXX_DEFINES) $(CXX_INCLUDES) $(CXX_FLAGS) -S D:\DOKUMENTY\diplomovka-final\Scott-cpp-win\lib\tls_protocol.cpp -o CMakeFiles\tiitls.dir\lib\tls_protocol.cpp.s
+
+CMakeFiles/tiitls.dir/lib/tls_cacerts.cpp.obj: CMakeFiles/tiitls.dir/flags.make
+CMakeFiles/tiitls.dir/lib/tls_cacerts.cpp.obj: CMakeFiles/tiitls.dir/includes_CXX.rsp
+CMakeFiles/tiitls.dir/lib/tls_cacerts.cpp.obj: lib/tls_cacerts.cpp
+CMakeFiles/tiitls.dir/lib/tls_cacerts.cpp.obj: CMakeFiles/tiitls.dir/compiler_depend.ts
+	@$(CMAKE_COMMAND) -E cmake_echo_color "--switch=$(COLOR)" --green --progress-dir=D:\DOKUMENTY\diplomovka-final\Scott-cpp-win\CMakeFiles --progress-num=$(CMAKE_PROGRESS_9) "Building CXX object CMakeFiles/tiitls.dir/lib/tls_cacerts.cpp.obj"
+	C:\mingw64\bin\gcc.exe $(CXX_DEFINES) $(CXX_INCLUDES) $(CXX_FLAGS) -MD -MT CMakeFiles/tiitls.dir/lib/tls_cacerts.cpp.obj -MF CMakeFiles\tiitls.dir\lib\tls_cacerts.cpp.obj.d -o CMakeFiles\tiitls.dir\lib\tls_cacerts.cpp.obj -c D:\DOKUMENTY\diplomovka-final\Scott-cpp-win\lib\tls_cacerts.cpp
+
+CMakeFiles/tiitls.dir/lib/tls_cacerts.cpp.i: cmake_force
+	@$(CMAKE_COMMAND) -E cmake_echo_color "--switch=$(COLOR)" --green "Preprocessing CXX source to CMakeFiles/tiitls.dir/lib/tls_cacerts.cpp.i"
+	C:\mingw64\bin\gcc.exe $(CXX_DEFINES) $(CXX_INCLUDES) $(CXX_FLAGS) -E D:\DOKUMENTY\diplomovka-final\Scott-cpp-win\lib\tls_cacerts.cpp > CMakeFiles\tiitls.dir\lib\tls_cacerts.cpp.i
+
+CMakeFiles/tiitls.dir/lib/tls_cacerts.cpp.s: cmake_force
+	@$(CMAKE_COMMAND) -E cmake_echo_color "--switch=$(COLOR)" --green "Compiling CXX source to assembly CMakeFiles/tiitls.dir/lib/tls_cacerts.cpp.s"
+	C:\mingw64\bin\gcc.exe $(CXX_DEFINES) $(CXX_INCLUDES) $(CXX_FLAGS) -S D:\DOKUMENTY\diplomovka-final\Scott-cpp-win\lib\tls_cacerts.cpp -o CMakeFiles\tiitls.dir\lib\tls_cacerts.cpp.s
+
+CMakeFiles/tiitls.dir/lib/tls_client_cert.cpp.obj: CMakeFiles/tiitls.dir/flags.make
+CMakeFiles/tiitls.dir/lib/tls_client_cert.cpp.obj: CMakeFiles/tiitls.dir/includes_CXX.rsp
+CMakeFiles/tiitls.dir/lib/tls_client_cert.cpp.obj: lib/tls_client_cert.cpp
+CMakeFiles/tiitls.dir/lib/tls_client_cert.cpp.obj: CMakeFiles/tiitls.dir/compiler_depend.ts
+	@$(CMAKE_COMMAND) -E cmake_echo_color "--switch=$(COLOR)" --green --progress-dir=D:\DOKUMENTY\diplomovka-final\Scott-cpp-win\CMakeFiles --progress-num=$(CMAKE_PROGRESS_10) "Building CXX object CMakeFiles/tiitls.dir/lib/tls_client_cert.cpp.obj"
+	C:\mingw64\bin\gcc.exe $(CXX_DEFINES) $(CXX_INCLUDES) $(CXX_FLAGS) -MD -MT CMakeFiles/tiitls.dir/lib/tls_client_cert.cpp.obj -MF CMakeFiles\tiitls.dir\lib\tls_client_cert.cpp.obj.d -o CMakeFiles\tiitls.dir\lib\tls_client_cert.cpp.obj -c D:\DOKUMENTY\diplomovka-final\Scott-cpp-win\lib\tls_client_cert.cpp
+
+CMakeFiles/tiitls.dir/lib/tls_client_cert.cpp.i: cmake_force
+	@$(CMAKE_COMMAND) -E cmake_echo_color "--switch=$(COLOR)" --green "Preprocessing CXX source to CMakeFiles/tiitls.dir/lib/tls_client_cert.cpp.i"
+	C:\mingw64\bin\gcc.exe $(CXX_DEFINES) $(CXX_INCLUDES) $(CXX_FLAGS) -E D:\DOKUMENTY\diplomovka-final\Scott-cpp-win\lib\tls_client_cert.cpp > CMakeFiles\tiitls.dir\lib\tls_client_cert.cpp.i
+
+CMakeFiles/tiitls.dir/lib/tls_client_cert.cpp.s: cmake_force
+	@$(CMAKE_COMMAND) -E cmake_echo_color "--switch=$(COLOR)" --green "Compiling CXX source to assembly CMakeFiles/tiitls.dir/lib/tls_client_cert.cpp.s"
+	C:\mingw64\bin\gcc.exe $(CXX_DEFINES) $(CXX_INCLUDES) $(CXX_FLAGS) -S D:\DOKUMENTY\diplomovka-final\Scott-cpp-win\lib\tls_client_cert.cpp -o CMakeFiles\tiitls.dir\lib\tls_client_cert.cpp.s
+
+CMakeFiles/tiitls.dir/lib/tls_tickets.cpp.obj: CMakeFiles/tiitls.dir/flags.make
+CMakeFiles/tiitls.dir/lib/tls_tickets.cpp.obj: CMakeFiles/tiitls.dir/includes_CXX.rsp
+CMakeFiles/tiitls.dir/lib/tls_tickets.cpp.obj: lib/tls_tickets.cpp
+CMakeFiles/tiitls.dir/lib/tls_tickets.cpp.obj: CMakeFiles/tiitls.dir/compiler_depend.ts
+	@$(CMAKE_COMMAND) -E cmake_echo_color "--switch=$(COLOR)" --green --progress-dir=D:\DOKUMENTY\diplomovka-final\Scott-cpp-win\CMakeFiles --progress-num=$(CMAKE_PROGRESS_11) "Building CXX object CMakeFiles/tiitls.dir/lib/tls_tickets.cpp.obj"
+	C:\mingw64\bin\gcc.exe $(CXX_DEFINES) $(CXX_INCLUDES) $(CXX_FLAGS) -MD -MT CMakeFiles/tiitls.dir/lib/tls_tickets.cpp.obj -MF CMakeFiles\tiitls.dir\lib\tls_tickets.cpp.obj.d -o CMakeFiles\tiitls.dir\lib\tls_tickets.cpp.obj -c D:\DOKUMENTY\diplomovka-final\Scott-cpp-win\lib\tls_tickets.cpp
+
+CMakeFiles/tiitls.dir/lib/tls_tickets.cpp.i: cmake_force
+	@$(CMAKE_COMMAND) -E cmake_echo_color "--switch=$(COLOR)" --green "Preprocessing CXX source to CMakeFiles/tiitls.dir/lib/tls_tickets.cpp.i"
+	C:\mingw64\bin\gcc.exe $(CXX_DEFINES) $(CXX_INCLUDES) $(CXX_FLAGS) -E D:\DOKUMENTY\diplomovka-final\Scott-cpp-win\lib\tls_tickets.cpp > CMakeFiles\tiitls.dir\lib\tls_tickets.cpp.i
+
+CMakeFiles/tiitls.dir/lib/tls_tickets.cpp.s: cmake_force
+	@$(CMAKE_COMMAND) -E cmake_echo_color "--switch=$(COLOR)" --green "Compiling CXX source to assembly CMakeFiles/tiitls.dir/lib/tls_tickets.cpp.s"
+	C:\mingw64\bin\gcc.exe $(CXX_DEFINES) $(CXX_INCLUDES) $(CXX_FLAGS) -S D:\DOKUMENTY\diplomovka-final\Scott-cpp-win\lib\tls_tickets.cpp -o CMakeFiles\tiitls.dir\lib\tls_tickets.cpp.s
+
+CMakeFiles/tiitls.dir/lib/tls_x509.cpp.obj: CMakeFiles/tiitls.dir/flags.make
+CMakeFiles/tiitls.dir/lib/tls_x509.cpp.obj: CMakeFiles/tiitls.dir/includes_CXX.rsp
+CMakeFiles/tiitls.dir/lib/tls_x509.cpp.obj: lib/tls_x509.cpp
+CMakeFiles/tiitls.dir/lib/tls_x509.cpp.obj: CMakeFiles/tiitls.dir/compiler_depend.ts
+	@$(CMAKE_COMMAND) -E cmake_echo_color "--switch=$(COLOR)" --green --progress-dir=D:\DOKUMENTY\diplomovka-final\Scott-cpp-win\CMakeFiles --progress-num=$(CMAKE_PROGRESS_12) "Building CXX object CMakeFiles/tiitls.dir/lib/tls_x509.cpp.obj"
+	C:\mingw64\bin\gcc.exe $(CXX_DEFINES) $(CXX_INCLUDES) $(CXX_FLAGS) -MD -MT CMakeFiles/tiitls.dir/lib/tls_x509.cpp.obj -MF CMakeFiles\tiitls.dir\lib\tls_x509.cpp.obj.d -o CMakeFiles\tiitls.dir\lib\tls_x509.cpp.obj -c D:\DOKUMENTY\diplomovka-final\Scott-cpp-win\lib\tls_x509.cpp
+
+CMakeFiles/tiitls.dir/lib/tls_x509.cpp.i: cmake_force
+	@$(CMAKE_COMMAND) -E cmake_echo_color "--switch=$(COLOR)" --green "Preprocessing CXX source to CMakeFiles/tiitls.dir/lib/tls_x509.cpp.i"
+	C:\mingw64\bin\gcc.exe $(CXX_DEFINES) $(CXX_INCLUDES) $(CXX_FLAGS) -E D:\DOKUMENTY\diplomovka-final\Scott-cpp-win\lib\tls_x509.cpp > CMakeFiles\tiitls.dir\lib\tls_x509.cpp.i
+
+CMakeFiles/tiitls.dir/lib/tls_x509.cpp.s: cmake_force
+	@$(CMAKE_COMMAND) -E cmake_echo_color "--switch=$(COLOR)" --green "Compiling CXX source to assembly CMakeFiles/tiitls.dir/lib/tls_x509.cpp.s"
+	C:\mingw64\bin\gcc.exe $(CXX_DEFINES) $(CXX_INCLUDES) $(CXX_FLAGS) -S D:\DOKUMENTY\diplomovka-final\Scott-cpp-win\lib\tls_x509.cpp -o CMakeFiles\tiitls.dir\lib\tls_x509.cpp.s
+
+CMakeFiles/tiitls.dir/lib/tls_sal.cpp.obj: CMakeFiles/tiitls.dir/flags.make
+CMakeFiles/tiitls.dir/lib/tls_sal.cpp.obj: CMakeFiles/tiitls.dir/includes_CXX.rsp
+CMakeFiles/tiitls.dir/lib/tls_sal.cpp.obj: lib/tls_sal.cpp
+CMakeFiles/tiitls.dir/lib/tls_sal.cpp.obj: CMakeFiles/tiitls.dir/compiler_depend.ts
+	@$(CMAKE_COMMAND) -E cmake_echo_color "--switch=$(COLOR)" --green --progress-dir=D:\DOKUMENTY\diplomovka-final\Scott-cpp-win\CMakeFiles --progress-num=$(CMAKE_PROGRESS_13) "Building CXX object CMakeFiles/tiitls.dir/lib/tls_sal.cpp.obj"
+	C:\mingw64\bin\gcc.exe $(CXX_DEFINES) $(CXX_INCLUDES) $(CXX_FLAGS) -MD -MT CMakeFiles/tiitls.dir/lib/tls_sal.cpp.obj -MF CMakeFiles\tiitls.dir\lib\tls_sal.cpp.obj.d -o CMakeFiles\tiitls.dir\lib\tls_sal.cpp.obj -c D:\DOKUMENTY\diplomovka-final\Scott-cpp-win\lib\tls_sal.cpp
+
+CMakeFiles/tiitls.dir/lib/tls_sal.cpp.i: cmake_force
+	@$(CMAKE_COMMAND) -E cmake_echo_color "--switch=$(COLOR)" --green "Preprocessing CXX source to CMakeFiles/tiitls.dir/lib/tls_sal.cpp.i"
+	C:\mingw64\bin\gcc.exe $(CXX_DEFINES) $(CXX_INCLUDES) $(CXX_FLAGS) -E D:\DOKUMENTY\diplomovka-final\Scott-cpp-win\lib\tls_sal.cpp > CMakeFiles\tiitls.dir\lib\tls_sal.cpp.i
+
+CMakeFiles/tiitls.dir/lib/tls_sal.cpp.s: cmake_force
+	@$(CMAKE_COMMAND) -E cmake_echo_color "--switch=$(COLOR)" --green "Compiling CXX source to assembly CMakeFiles/tiitls.dir/lib/tls_sal.cpp.s"
+	C:\mingw64\bin\gcc.exe $(CXX_DEFINES) $(CXX_INCLUDES) $(CXX_FLAGS) -S D:\DOKUMENTY\diplomovka-final\Scott-cpp-win\lib\tls_sal.cpp -o CMakeFiles\tiitls.dir\lib\tls_sal.cpp.s
+
+CMakeFiles/tiitls.dir/lib/ibe/tls_bfibe.cpp.obj: CMakeFiles/tiitls.dir/flags.make
+CMakeFiles/tiitls.dir/lib/ibe/tls_bfibe.cpp.obj: CMakeFiles/tiitls.dir/includes_CXX.rsp
+CMakeFiles/tiitls.dir/lib/ibe/tls_bfibe.cpp.obj: lib/ibe/tls_bfibe.cpp
+CMakeFiles/tiitls.dir/lib/ibe/tls_bfibe.cpp.obj: CMakeFiles/tiitls.dir/compiler_depend.ts
+	@$(CMAKE_COMMAND) -E cmake_echo_color "--switch=$(COLOR)" --green --progress-dir=D:\DOKUMENTY\diplomovka-final\Scott-cpp-win\CMakeFiles --progress-num=$(CMAKE_PROGRESS_14) "Building CXX object CMakeFiles/tiitls.dir/lib/ibe/tls_bfibe.cpp.obj"
+	C:\mingw64\bin\gcc.exe $(CXX_DEFINES) $(CXX_INCLUDES) $(CXX_FLAGS) -MD -MT CMakeFiles/tiitls.dir/lib/ibe/tls_bfibe.cpp.obj -MF CMakeFiles\tiitls.dir\lib\ibe\tls_bfibe.cpp.obj.d -o CMakeFiles\tiitls.dir\lib\ibe\tls_bfibe.cpp.obj -c D:\DOKUMENTY\diplomovka-final\Scott-cpp-win\lib\ibe\tls_bfibe.cpp
+
+CMakeFiles/tiitls.dir/lib/ibe/tls_bfibe.cpp.i: cmake_force
+	@$(CMAKE_COMMAND) -E cmake_echo_color "--switch=$(COLOR)" --green "Preprocessing CXX source to CMakeFiles/tiitls.dir/lib/ibe/tls_bfibe.cpp.i"
+	C:\mingw64\bin\gcc.exe $(CXX_DEFINES) $(CXX_INCLUDES) $(CXX_FLAGS) -E D:\DOKUMENTY\diplomovka-final\Scott-cpp-win\lib\ibe\tls_bfibe.cpp > CMakeFiles\tiitls.dir\lib\ibe\tls_bfibe.cpp.i
+
+CMakeFiles/tiitls.dir/lib/ibe/tls_bfibe.cpp.s: cmake_force
+	@$(CMAKE_COMMAND) -E cmake_echo_color "--switch=$(COLOR)" --green "Compiling CXX source to assembly CMakeFiles/tiitls.dir/lib/ibe/tls_bfibe.cpp.s"
+	C:\mingw64\bin\gcc.exe $(CXX_DEFINES) $(CXX_INCLUDES) $(CXX_FLAGS) -S D:\DOKUMENTY\diplomovka-final\Scott-cpp-win\lib\ibe\tls_bfibe.cpp -o CMakeFiles\tiitls.dir\lib\ibe\tls_bfibe.cpp.s
+
+CMakeFiles/tiitls.dir/lib/ibe/tls_pqibe.cpp.obj: CMakeFiles/tiitls.dir/flags.make
+CMakeFiles/tiitls.dir/lib/ibe/tls_pqibe.cpp.obj: CMakeFiles/tiitls.dir/includes_CXX.rsp
+CMakeFiles/tiitls.dir/lib/ibe/tls_pqibe.cpp.obj: lib/ibe/tls_pqibe.cpp
+CMakeFiles/tiitls.dir/lib/ibe/tls_pqibe.cpp.obj: CMakeFiles/tiitls.dir/compiler_depend.ts
+	@$(CMAKE_COMMAND) -E cmake_echo_color "--switch=$(COLOR)" --green --progress-dir=D:\DOKUMENTY\diplomovka-final\Scott-cpp-win\CMakeFiles --progress-num=$(CMAKE_PROGRESS_15) "Building CXX object CMakeFiles/tiitls.dir/lib/ibe/tls_pqibe.cpp.obj"
+	C:\mingw64\bin\gcc.exe $(CXX_DEFINES) $(CXX_INCLUDES) $(CXX_FLAGS) -MD -MT CMakeFiles/tiitls.dir/lib/ibe/tls_pqibe.cpp.obj -MF CMakeFiles\tiitls.dir\lib\ibe\tls_pqibe.cpp.obj.d -o CMakeFiles\tiitls.dir\lib\ibe\tls_pqibe.cpp.obj -c D:\DOKUMENTY\diplomovka-final\Scott-cpp-win\lib\ibe\tls_pqibe.cpp
+
+CMakeFiles/tiitls.dir/lib/ibe/tls_pqibe.cpp.i: cmake_force
+	@$(CMAKE_COMMAND) -E cmake_echo_color "--switch=$(COLOR)" --green "Preprocessing CXX source to CMakeFiles/tiitls.dir/lib/ibe/tls_pqibe.cpp.i"
+	C:\mingw64\bin\gcc.exe $(CXX_DEFINES) $(CXX_INCLUDES) $(CXX_FLAGS) -E D:\DOKUMENTY\diplomovka-final\Scott-cpp-win\lib\ibe\tls_pqibe.cpp > CMakeFiles\tiitls.dir\lib\ibe\tls_pqibe.cpp.i
+
+CMakeFiles/tiitls.dir/lib/ibe/tls_pqibe.cpp.s: cmake_force
+	@$(CMAKE_COMMAND) -E cmake_echo_color "--switch=$(COLOR)" --green "Compiling CXX source to assembly CMakeFiles/tiitls.dir/lib/ibe/tls_pqibe.cpp.s"
+	C:\mingw64\bin\gcc.exe $(CXX_DEFINES) $(CXX_INCLUDES) $(CXX_FLAGS) -S D:\DOKUMENTY\diplomovka-final\Scott-cpp-win\lib\ibe\tls_pqibe.cpp -o CMakeFiles\tiitls.dir\lib\ibe\tls_pqibe.cpp.s
+
+# Object files for target tiitls
+tiitls_OBJECTS = \
+"CMakeFiles/tiitls.dir/lib/tls_cert_chain.cpp.obj" \
+"CMakeFiles/tiitls.dir/lib/tls_client_recv.cpp.obj" \
+"CMakeFiles/tiitls.dir/lib/tls_client_send.cpp.obj" \
+"CMakeFiles/tiitls.dir/lib/tls_keys_calc.cpp.obj" \
+"CMakeFiles/tiitls.dir/lib/tls_sockets.cpp.obj" \
+"CMakeFiles/tiitls.dir/lib/tls_octads.cpp.obj" \
+"CMakeFiles/tiitls.dir/lib/tls_logger.cpp.obj" \
+"CMakeFiles/tiitls.dir/lib/tls_protocol.cpp.obj" \
+"CMakeFiles/tiitls.dir/lib/tls_cacerts.cpp.obj" \
+"CMakeFiles/tiitls.dir/lib/tls_client_cert.cpp.obj" \
+"CMakeFiles/tiitls.dir/lib/tls_tickets.cpp.obj" \
+"CMakeFiles/tiitls.dir/lib/tls_x509.cpp.obj" \
+"CMakeFiles/tiitls.dir/lib/tls_sal.cpp.obj" \
+"CMakeFiles/tiitls.dir/lib/ibe/tls_bfibe.cpp.obj" \
+"CMakeFiles/tiitls.dir/lib/ibe/tls_pqibe.cpp.obj"
+
+# External object files for target tiitls
+tiitls_EXTERNAL_OBJECTS =
+
+libtiitls.a: CMakeFiles/tiitls.dir/lib/tls_cert_chain.cpp.obj
+libtiitls.a: CMakeFiles/tiitls.dir/lib/tls_client_recv.cpp.obj
+libtiitls.a: CMakeFiles/tiitls.dir/lib/tls_client_send.cpp.obj
+libtiitls.a: CMakeFiles/tiitls.dir/lib/tls_keys_calc.cpp.obj
+libtiitls.a: CMakeFiles/tiitls.dir/lib/tls_sockets.cpp.obj
+libtiitls.a: CMakeFiles/tiitls.dir/lib/tls_octads.cpp.obj
+libtiitls.a: CMakeFiles/tiitls.dir/lib/tls_logger.cpp.obj
+libtiitls.a: CMakeFiles/tiitls.dir/lib/tls_protocol.cpp.obj
+libtiitls.a: CMakeFiles/tiitls.dir/lib/tls_cacerts.cpp.obj
+libtiitls.a: CMakeFiles/tiitls.dir/lib/tls_client_cert.cpp.obj
+libtiitls.a: CMakeFiles/tiitls.dir/lib/tls_tickets.cpp.obj
+libtiitls.a: CMakeFiles/tiitls.dir/lib/tls_x509.cpp.obj
+libtiitls.a: CMakeFiles/tiitls.dir/lib/tls_sal.cpp.obj
+libtiitls.a: CMakeFiles/tiitls.dir/lib/ibe/tls_bfibe.cpp.obj
+libtiitls.a: CMakeFiles/tiitls.dir/lib/ibe/tls_pqibe.cpp.obj
+libtiitls.a: CMakeFiles/tiitls.dir/build.make
+libtiitls.a: CMakeFiles/tiitls.dir/link.txt
+	@$(CMAKE_COMMAND) -E cmake_echo_color "--switch=$(COLOR)" --green --bold --progress-dir=D:\DOKUMENTY\diplomovka-final\Scott-cpp-win\CMakeFiles --progress-num=$(CMAKE_PROGRESS_16) "Linking CXX static library libtiitls.a"
+	$(CMAKE_COMMAND) -P CMakeFiles\tiitls.dir\cmake_clean_target.cmake
+	$(CMAKE_COMMAND) -E cmake_link_script CMakeFiles\tiitls.dir\link.txt --verbose=$(VERBOSE)
+
+# Rule to build all files generated by this target.
+CMakeFiles/tiitls.dir/build: libtiitls.a
+.PHONY : CMakeFiles/tiitls.dir/build
+
+CMakeFiles/tiitls.dir/clean:
+	$(CMAKE_COMMAND) -P CMakeFiles\tiitls.dir\cmake_clean.cmake
+.PHONY : CMakeFiles/tiitls.dir/clean
+
+CMakeFiles/tiitls.dir/depend:
+	$(CMAKE_COMMAND) -E cmake_depends "MinGW Makefiles" D:\DOKUMENTY\diplomovka-final\Scott-cpp-win D:\DOKUMENTY\diplomovka-final\Scott-cpp-win D:\DOKUMENTY\diplomovka-final\Scott-cpp-win D:\DOKUMENTY\diplomovka-final\Scott-cpp-win D:\DOKUMENTY\diplomovka-final\Scott-cpp-win\CMakeFiles\tiitls.dir\DependInfo.cmake "--color=$(COLOR)"
+.PHONY : CMakeFiles/tiitls.dir/depend
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/cmake_clean.cmake b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/cmake_clean.cmake
new file mode 100644
index 0000000..737d32e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/cmake_clean.cmake
@@ -0,0 +1,39 @@
+file(REMOVE_RECURSE
+  "CMakeFiles/tiitls.dir/lib/ibe/tls_bfibe.cpp.obj"
+  "CMakeFiles/tiitls.dir/lib/ibe/tls_bfibe.cpp.obj.d"
+  "CMakeFiles/tiitls.dir/lib/ibe/tls_pqibe.cpp.obj"
+  "CMakeFiles/tiitls.dir/lib/ibe/tls_pqibe.cpp.obj.d"
+  "CMakeFiles/tiitls.dir/lib/tls_cacerts.cpp.obj"
+  "CMakeFiles/tiitls.dir/lib/tls_cacerts.cpp.obj.d"
+  "CMakeFiles/tiitls.dir/lib/tls_cert_chain.cpp.obj"
+  "CMakeFiles/tiitls.dir/lib/tls_cert_chain.cpp.obj.d"
+  "CMakeFiles/tiitls.dir/lib/tls_client_cert.cpp.obj"
+  "CMakeFiles/tiitls.dir/lib/tls_client_cert.cpp.obj.d"
+  "CMakeFiles/tiitls.dir/lib/tls_client_recv.cpp.obj"
+  "CMakeFiles/tiitls.dir/lib/tls_client_recv.cpp.obj.d"
+  "CMakeFiles/tiitls.dir/lib/tls_client_send.cpp.obj"
+  "CMakeFiles/tiitls.dir/lib/tls_client_send.cpp.obj.d"
+  "CMakeFiles/tiitls.dir/lib/tls_keys_calc.cpp.obj"
+  "CMakeFiles/tiitls.dir/lib/tls_keys_calc.cpp.obj.d"
+  "CMakeFiles/tiitls.dir/lib/tls_logger.cpp.obj"
+  "CMakeFiles/tiitls.dir/lib/tls_logger.cpp.obj.d"
+  "CMakeFiles/tiitls.dir/lib/tls_octads.cpp.obj"
+  "CMakeFiles/tiitls.dir/lib/tls_octads.cpp.obj.d"
+  "CMakeFiles/tiitls.dir/lib/tls_protocol.cpp.obj"
+  "CMakeFiles/tiitls.dir/lib/tls_protocol.cpp.obj.d"
+  "CMakeFiles/tiitls.dir/lib/tls_sal.cpp.obj"
+  "CMakeFiles/tiitls.dir/lib/tls_sal.cpp.obj.d"
+  "CMakeFiles/tiitls.dir/lib/tls_sockets.cpp.obj"
+  "CMakeFiles/tiitls.dir/lib/tls_sockets.cpp.obj.d"
+  "CMakeFiles/tiitls.dir/lib/tls_tickets.cpp.obj"
+  "CMakeFiles/tiitls.dir/lib/tls_tickets.cpp.obj.d"
+  "CMakeFiles/tiitls.dir/lib/tls_x509.cpp.obj"
+  "CMakeFiles/tiitls.dir/lib/tls_x509.cpp.obj.d"
+  "libtiitls.a"
+  "libtiitls.pdb"
+)
+
+# Per-language clean rules from dependency scanning.
+foreach(lang CXX)
+  include(CMakeFiles/tiitls.dir/cmake_clean_${lang}.cmake OPTIONAL)
+endforeach()
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/cmake_clean_target.cmake b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/cmake_clean_target.cmake
new file mode 100644
index 0000000..d834c8d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/cmake_clean_target.cmake
@@ -0,0 +1,3 @@
+file(REMOVE_RECURSE
+  "libtiitls.a"
+)
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/compiler_depend.internal b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/compiler_depend.internal
new file mode 100644
index 0000000..1ebb5e7
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/compiler_depend.internal
@@ -0,0 +1,3660 @@
+# CMAKE generated file: DO NOT EDIT!
+# Generated by "MinGW Makefiles" Generator, CMake Version 3.28
+
+CMakeFiles/tiitls.dir/lib/ibe/tls_bfibe.cpp.obj
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/lib/ibe/tls_bfibe.cpp
+ C:/mingw64/include/c++/13.2.0/bits/std_abs.h
+ C:/mingw64/include/c++/13.2.0/cstdlib
+ C:/mingw64/include/c++/13.2.0/pstl/pstl_config.h
+ C:/mingw64/include/c++/13.2.0/stdlib.h
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/c++config.h
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/cpu_defines.h
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/os_defines.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/limits.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mm_malloc.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stdbool.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stddef.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stdint.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/syslimits.h
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw.h
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_mac.h
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_off_t.h
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_secapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/_timeval.h
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt.h
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt_stdio_config.h
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt_wstdlib.h
+ C:/mingw64/x86_64-w64-mingw32/include/crtdefs.h
+ C:/mingw64/x86_64-w64-mingw32/include/errno.h
+ C:/mingw64/x86_64-w64-mingw32/include/inttypes.h
+ C:/mingw64/x86_64-w64-mingw32/include/limits.h
+ C:/mingw64/x86_64-w64-mingw32/include/malloc.h
+ C:/mingw64/x86_64-w64-mingw32/include/pthread_time.h
+ C:/mingw64/x86_64-w64-mingw32/include/sdks/_mingw_ddk.h
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/stdio_s.h
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/stdlib_s.h
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/string_s.h
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/sys/timeb_s.h
+ C:/mingw64/x86_64-w64-mingw32/include/stddef.h
+ C:/mingw64/x86_64-w64-mingw32/include/stdint.h
+ C:/mingw64/x86_64-w64-mingw32/include/stdio.h
+ C:/mingw64/x86_64-w64-mingw32/include/stdlib.h
+ C:/mingw64/x86_64-w64-mingw32/include/string.h
+ C:/mingw64/x86_64-w64-mingw32/include/swprintf.inl
+ C:/mingw64/x86_64-w64-mingw32/include/sys/timeb.h
+ C:/mingw64/x86_64-w64-mingw32/include/time.h
+ C:/mingw64/x86_64-w64-mingw32/include/vadefs.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_bfibe.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/arch.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/big_B384_58.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/config_big_B384_58.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/config_curve_BLS12381.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/config_field_BLS12381.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/core.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/ecp2_BLS12381.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/ecp_BLS12381.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/fp12_BLS12381.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/fp2_BLS12381.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/fp4_BLS12381.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/fp_BLS12381.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/pair_BLS12381.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/randapi.h
+
+CMakeFiles/tiitls.dir/lib/ibe/tls_pqibe.cpp.obj
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/lib/ibe/tls_pqibe.cpp
+ C:/mingw64/include/c++/13.2.0/backward/binders.h
+ C:/mingw64/include/c++/13.2.0/bit
+ C:/mingw64/include/c++/13.2.0/bits/alloc_traits.h
+ C:/mingw64/include/c++/13.2.0/bits/allocator.h
+ C:/mingw64/include/c++/13.2.0/bits/basic_ios.h
+ C:/mingw64/include/c++/13.2.0/bits/basic_ios.tcc
+ C:/mingw64/include/c++/13.2.0/bits/basic_string.h
+ C:/mingw64/include/c++/13.2.0/bits/basic_string.tcc
+ C:/mingw64/include/c++/13.2.0/bits/char_traits.h
+ C:/mingw64/include/c++/13.2.0/bits/charconv.h
+ C:/mingw64/include/c++/13.2.0/bits/concept_check.h
+ C:/mingw64/include/c++/13.2.0/bits/cpp_type_traits.h
+ C:/mingw64/include/c++/13.2.0/bits/cxxabi_forced.h
+ C:/mingw64/include/c++/13.2.0/bits/cxxabi_init_exception.h
+ C:/mingw64/include/c++/13.2.0/bits/exception.h
+ C:/mingw64/include/c++/13.2.0/bits/exception_defines.h
+ C:/mingw64/include/c++/13.2.0/bits/exception_ptr.h
+ C:/mingw64/include/c++/13.2.0/bits/functexcept.h
+ C:/mingw64/include/c++/13.2.0/bits/functional_hash.h
+ C:/mingw64/include/c++/13.2.0/bits/hash_bytes.h
+ C:/mingw64/include/c++/13.2.0/bits/invoke.h
+ C:/mingw64/include/c++/13.2.0/bits/ios_base.h
+ C:/mingw64/include/c++/13.2.0/bits/istream.tcc
+ C:/mingw64/include/c++/13.2.0/bits/locale_classes.h
+ C:/mingw64/include/c++/13.2.0/bits/locale_classes.tcc
+ C:/mingw64/include/c++/13.2.0/bits/locale_facets.h
+ C:/mingw64/include/c++/13.2.0/bits/locale_facets.tcc
+ C:/mingw64/include/c++/13.2.0/bits/localefwd.h
+ C:/mingw64/include/c++/13.2.0/bits/memory_resource.h
+ C:/mingw64/include/c++/13.2.0/bits/memoryfwd.h
+ C:/mingw64/include/c++/13.2.0/bits/move.h
+ C:/mingw64/include/c++/13.2.0/bits/nested_exception.h
+ C:/mingw64/include/c++/13.2.0/bits/new_allocator.h
+ C:/mingw64/include/c++/13.2.0/bits/ostream.tcc
+ C:/mingw64/include/c++/13.2.0/bits/ostream_insert.h
+ C:/mingw64/include/c++/13.2.0/bits/postypes.h
+ C:/mingw64/include/c++/13.2.0/bits/predefined_ops.h
+ C:/mingw64/include/c++/13.2.0/bits/ptr_traits.h
+ C:/mingw64/include/c++/13.2.0/bits/range_access.h
+ C:/mingw64/include/c++/13.2.0/bits/refwrap.h
+ C:/mingw64/include/c++/13.2.0/bits/requires_hosted.h
+ C:/mingw64/include/c++/13.2.0/bits/std_abs.h
+ C:/mingw64/include/c++/13.2.0/bits/stl_algobase.h
+ C:/mingw64/include/c++/13.2.0/bits/stl_construct.h
+ C:/mingw64/include/c++/13.2.0/bits/stl_function.h
+ C:/mingw64/include/c++/13.2.0/bits/stl_iterator.h
+ C:/mingw64/include/c++/13.2.0/bits/stl_iterator_base_funcs.h
+ C:/mingw64/include/c++/13.2.0/bits/stl_iterator_base_types.h
+ C:/mingw64/include/c++/13.2.0/bits/stl_pair.h
+ C:/mingw64/include/c++/13.2.0/bits/streambuf.tcc
+ C:/mingw64/include/c++/13.2.0/bits/streambuf_iterator.h
+ C:/mingw64/include/c++/13.2.0/bits/string_view.tcc
+ C:/mingw64/include/c++/13.2.0/bits/stringfwd.h
+ C:/mingw64/include/c++/13.2.0/bits/uses_allocator.h
+ C:/mingw64/include/c++/13.2.0/bits/uses_allocator_args.h
+ C:/mingw64/include/c++/13.2.0/bits/utility.h
+ C:/mingw64/include/c++/13.2.0/cctype
+ C:/mingw64/include/c++/13.2.0/cerrno
+ C:/mingw64/include/c++/13.2.0/clocale
+ C:/mingw64/include/c++/13.2.0/cstddef
+ C:/mingw64/include/c++/13.2.0/cstdint
+ C:/mingw64/include/c++/13.2.0/cstdio
+ C:/mingw64/include/c++/13.2.0/cstdlib
+ C:/mingw64/include/c++/13.2.0/cwchar
+ C:/mingw64/include/c++/13.2.0/cwctype
+ C:/mingw64/include/c++/13.2.0/debug/assertions.h
+ C:/mingw64/include/c++/13.2.0/debug/debug.h
+ C:/mingw64/include/c++/13.2.0/exception
+ C:/mingw64/include/c++/13.2.0/ext/alloc_traits.h
+ C:/mingw64/include/c++/13.2.0/ext/atomicity.h
+ C:/mingw64/include/c++/13.2.0/ext/numeric_traits.h
+ C:/mingw64/include/c++/13.2.0/ext/string_conversions.h
+ C:/mingw64/include/c++/13.2.0/ext/type_traits.h
+ C:/mingw64/include/c++/13.2.0/initializer_list
+ C:/mingw64/include/c++/13.2.0/ios
+ C:/mingw64/include/c++/13.2.0/iosfwd
+ C:/mingw64/include/c++/13.2.0/iostream
+ C:/mingw64/include/c++/13.2.0/istream
+ C:/mingw64/include/c++/13.2.0/new
+ C:/mingw64/include/c++/13.2.0/ostream
+ C:/mingw64/include/c++/13.2.0/pstl/pstl_config.h
+ C:/mingw64/include/c++/13.2.0/stdexcept
+ C:/mingw64/include/c++/13.2.0/stdlib.h
+ C:/mingw64/include/c++/13.2.0/streambuf
+ C:/mingw64/include/c++/13.2.0/string
+ C:/mingw64/include/c++/13.2.0/string_view
+ C:/mingw64/include/c++/13.2.0/system_error
+ C:/mingw64/include/c++/13.2.0/tuple
+ C:/mingw64/include/c++/13.2.0/type_traits
+ C:/mingw64/include/c++/13.2.0/typeinfo
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/atomic_word.h
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/c++allocator.h
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/c++config.h
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/c++locale.h
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/cpu_defines.h
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/ctype_base.h
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/ctype_inline.h
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/error_constants.h
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/gthr-default.h
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/gthr.h
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/os_defines.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/limits.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mm_malloc.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stdbool.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stddef.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stdint.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/syslimits.h
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw.h
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_mac.h
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_off_t.h
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_secapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_stat64.h
+ C:/mingw64/x86_64-w64-mingw32/include/_timeval.h
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt.h
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt_startup.h
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt_stdio_config.h
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt_wstdlib.h
+ C:/mingw64/x86_64-w64-mingw32/include/crtdefs.h
+ C:/mingw64/x86_64-w64-mingw32/include/ctype.h
+ C:/mingw64/x86_64-w64-mingw32/include/errno.h
+ C:/mingw64/x86_64-w64-mingw32/include/limits.h
+ C:/mingw64/x86_64-w64-mingw32/include/locale.h
+ C:/mingw64/x86_64-w64-mingw32/include/malloc.h
+ C:/mingw64/x86_64-w64-mingw32/include/process.h
+ C:/mingw64/x86_64-w64-mingw32/include/pthread.h
+ C:/mingw64/x86_64-w64-mingw32/include/pthread_compat.h
+ C:/mingw64/x86_64-w64-mingw32/include/pthread_signal.h
+ C:/mingw64/x86_64-w64-mingw32/include/pthread_time.h
+ C:/mingw64/x86_64-w64-mingw32/include/pthread_unistd.h
+ C:/mingw64/x86_64-w64-mingw32/include/sdks/_mingw_ddk.h
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/stdio_s.h
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/stdlib_s.h
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/sys/timeb_s.h
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/wchar_s.h
+ C:/mingw64/x86_64-w64-mingw32/include/signal.h
+ C:/mingw64/x86_64-w64-mingw32/include/stddef.h
+ C:/mingw64/x86_64-w64-mingw32/include/stdint.h
+ C:/mingw64/x86_64-w64-mingw32/include/stdio.h
+ C:/mingw64/x86_64-w64-mingw32/include/stdlib.h
+ C:/mingw64/x86_64-w64-mingw32/include/swprintf.inl
+ C:/mingw64/x86_64-w64-mingw32/include/sys/timeb.h
+ C:/mingw64/x86_64-w64-mingw32/include/sys/types.h
+ C:/mingw64/x86_64-w64-mingw32/include/time.h
+ C:/mingw64/x86_64-w64-mingw32/include/vadefs.h
+ C:/mingw64/x86_64-w64-mingw32/include/wchar.h
+ C:/mingw64/x86_64-w64-mingw32/include/wctype.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_pqibe.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/arch.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/core.h
+
+CMakeFiles/tiitls.dir/lib/tls_cacerts.cpp.obj
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/lib/tls_cacerts.cpp
+ C:/mingw64/include/c++/13.2.0/bits/std_abs.h
+ C:/mingw64/include/c++/13.2.0/cstdlib
+ C:/mingw64/include/c++/13.2.0/pstl/pstl_config.h
+ C:/mingw64/include/c++/13.2.0/stdlib.h
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/c++config.h
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/cpu_defines.h
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/os_defines.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/adxintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/ammintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxbf16intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxcomplexintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxfp16intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxint8intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxtileintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx2intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx5124fmapsintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx5124vnniwintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bf16intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bf16vlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bitalgintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bwintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512cdintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512dqintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512erintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fp16intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fp16vlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512ifmaintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512ifmavlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512pfintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmi2intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmi2vlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmiintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmivlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vlbwintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vldqintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vnniintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vnnivlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vp2intersectintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vp2intersectvlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vpopcntdqintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vpopcntdqvlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxifmaintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxneconvertintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxvnniint8intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxvnniintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/bmi2intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/bmiintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cetintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cldemoteintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clflushoptintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clwbintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clzerointrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cmpccxaddintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/emmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/enqcmdintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/f16cintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fma4intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fmaintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fxsrintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/gfniintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/hresetintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/ia32intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/immintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/keylockerintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/limits.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/lwpintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/lzcntintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mm3dnow.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mm_malloc.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/movdirintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mwaitintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mwaitxintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pconfigintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pkuintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pmmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/popcntintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/prfchiintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/prfchwintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/raointintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/rdseedintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/rtmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/serializeintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/sgxintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/shaintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/smmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stdarg.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stddef.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stdint.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/syslimits.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tbmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tmmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tsxldtrkintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/uintrintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/vaesintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/vpclmulqdqintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/waitpkgintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/wbnoinvdintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/wmmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/x86gprintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/x86intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xmmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xopintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsavecintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsaveintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsaveoptintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsavesintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xtestintrin.h
+ C:/mingw64/x86_64-w64-mingw32/include/_bsd_types.h
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw.h
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_mac.h
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_off_t.h
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_secapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_stdarg.h
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_unicode.h
+ C:/mingw64/x86_64-w64-mingw32/include/_timeval.h
+ C:/mingw64/x86_64-w64-mingw32/include/afunix.h
+ C:/mingw64/x86_64-w64-mingw32/include/apiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/apisetcconv.h
+ C:/mingw64/x86_64-w64-mingw32/include/basetsd.h
+ C:/mingw64/x86_64-w64-mingw32/include/bcrypt.h
+ C:/mingw64/x86_64-w64-mingw32/include/bemapiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/cderr.h
+ C:/mingw64/x86_64-w64-mingw32/include/cguid.h
+ C:/mingw64/x86_64-w64-mingw32/include/combaseapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/commdlg.h
+ C:/mingw64/x86_64-w64-mingw32/include/concurrencysal.h
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt.h
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt_startup.h
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt_stdio_config.h
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt_wstdlib.h
+ C:/mingw64/x86_64-w64-mingw32/include/crtdefs.h
+ C:/mingw64/x86_64-w64-mingw32/include/ctype.h
+ C:/mingw64/x86_64-w64-mingw32/include/datetimeapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/dde.h
+ C:/mingw64/x86_64-w64-mingw32/include/ddeml.h
+ C:/mingw64/x86_64-w64-mingw32/include/debugapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/dlgs.h
+ C:/mingw64/x86_64-w64-mingw32/include/dpapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/driverspecs.h
+ C:/mingw64/x86_64-w64-mingw32/include/errhandlingapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/errno.h
+ C:/mingw64/x86_64-w64-mingw32/include/excpt.h
+ C:/mingw64/x86_64-w64-mingw32/include/fibersapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/fileapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/fltwinerror.h
+ C:/mingw64/x86_64-w64-mingw32/include/getopt.h
+ C:/mingw64/x86_64-w64-mingw32/include/guiddef.h
+ C:/mingw64/x86_64-w64-mingw32/include/handleapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/heapapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/imm.h
+ C:/mingw64/x86_64-w64-mingw32/include/in6addr.h
+ C:/mingw64/x86_64-w64-mingw32/include/inaddr.h
+ C:/mingw64/x86_64-w64-mingw32/include/interlockedapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/io.h
+ C:/mingw64/x86_64-w64-mingw32/include/ioapiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/jobapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/joystickapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/ktmtypes.h
+ C:/mingw64/x86_64-w64-mingw32/include/libloaderapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/limits.h
+ C:/mingw64/x86_64-w64-mingw32/include/lzexpand.h
+ C:/mingw64/x86_64-w64-mingw32/include/malloc.h
+ C:/mingw64/x86_64-w64-mingw32/include/mciapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/mcx.h
+ C:/mingw64/x86_64-w64-mingw32/include/memoryapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/minwinbase.h
+ C:/mingw64/x86_64-w64-mingw32/include/minwindef.h
+ C:/mingw64/x86_64-w64-mingw32/include/mmeapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/mmiscapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/mmiscapi2.h
+ C:/mingw64/x86_64-w64-mingw32/include/mmsyscom.h
+ C:/mingw64/x86_64-w64-mingw32/include/mmsystem.h
+ C:/mingw64/x86_64-w64-mingw32/include/mstcpip.h
+ C:/mingw64/x86_64-w64-mingw32/include/msxml.h
+ C:/mingw64/x86_64-w64-mingw32/include/namedpipeapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/namespaceapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/nb30.h
+ C:/mingw64/x86_64-w64-mingw32/include/ncrypt.h
+ C:/mingw64/x86_64-w64-mingw32/include/oaidl.h
+ C:/mingw64/x86_64-w64-mingw32/include/objbase.h
+ C:/mingw64/x86_64-w64-mingw32/include/objidl.h
+ C:/mingw64/x86_64-w64-mingw32/include/objidlbase.h
+ C:/mingw64/x86_64-w64-mingw32/include/ole2.h
+ C:/mingw64/x86_64-w64-mingw32/include/oleauto.h
+ C:/mingw64/x86_64-w64-mingw32/include/oleidl.h
+ C:/mingw64/x86_64-w64-mingw32/include/playsoundapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/poppack.h
+ C:/mingw64/x86_64-w64-mingw32/include/process.h
+ C:/mingw64/x86_64-w64-mingw32/include/processenv.h
+ C:/mingw64/x86_64-w64-mingw32/include/processthreadsapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/processtopologyapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/profileapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/propidl.h
+ C:/mingw64/x86_64-w64-mingw32/include/prsht.h
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_fd_types.h
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ip_mreq1.h
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ip_types.h
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_socket_types.h
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ws1_undef.h
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_wsa_errnos.h
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_wsadata.h
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/intrin-impl.h
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack1.h
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack2.h
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack4.h
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack8.h
+ C:/mingw64/x86_64-w64-mingw32/include/pthread_time.h
+ C:/mingw64/x86_64-w64-mingw32/include/pthread_unistd.h
+ C:/mingw64/x86_64-w64-mingw32/include/qos.h
+ C:/mingw64/x86_64-w64-mingw32/include/realtimeapiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/reason.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpc.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpcasync.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpcdce.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpcdcep.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpcndr.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpcnsi.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpcnsip.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpcnterr.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpcsal.h
+ C:/mingw64/x86_64-w64-mingw32/include/sal.h
+ C:/mingw64/x86_64-w64-mingw32/include/sdkddkver.h
+ C:/mingw64/x86_64-w64-mingw32/include/sdks/_mingw_ddk.h
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/stdio_s.h
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/stdlib_s.h
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/stralign_s.h
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/string_s.h
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/sys/timeb_s.h
+ C:/mingw64/x86_64-w64-mingw32/include/securityappcontainer.h
+ C:/mingw64/x86_64-w64-mingw32/include/securitybaseapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/servprov.h
+ C:/mingw64/x86_64-w64-mingw32/include/shellapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/specstrings.h
+ C:/mingw64/x86_64-w64-mingw32/include/stdarg.h
+ C:/mingw64/x86_64-w64-mingw32/include/stddef.h
+ C:/mingw64/x86_64-w64-mingw32/include/stdint.h
+ C:/mingw64/x86_64-w64-mingw32/include/stdio.h
+ C:/mingw64/x86_64-w64-mingw32/include/stdlib.h
+ C:/mingw64/x86_64-w64-mingw32/include/stralign.h
+ C:/mingw64/x86_64-w64-mingw32/include/string.h
+ C:/mingw64/x86_64-w64-mingw32/include/stringapiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/swprintf.inl
+ C:/mingw64/x86_64-w64-mingw32/include/synchapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/sys/timeb.h
+ C:/mingw64/x86_64-w64-mingw32/include/sys/types.h
+ C:/mingw64/x86_64-w64-mingw32/include/sysinfoapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/systemtopologyapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/threadpoolapiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/threadpoollegacyapiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/time.h
+ C:/mingw64/x86_64-w64-mingw32/include/timeapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/timezoneapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/tvout.h
+ C:/mingw64/x86_64-w64-mingw32/include/unistd.h
+ C:/mingw64/x86_64-w64-mingw32/include/unknwn.h
+ C:/mingw64/x86_64-w64-mingw32/include/unknwnbase.h
+ C:/mingw64/x86_64-w64-mingw32/include/urlmon.h
+ C:/mingw64/x86_64-w64-mingw32/include/utilapiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/vadefs.h
+ C:/mingw64/x86_64-w64-mingw32/include/virtdisk.h
+ C:/mingw64/x86_64-w64-mingw32/include/winapifamily.h
+ C:/mingw64/x86_64-w64-mingw32/include/winbase.h
+ C:/mingw64/x86_64-w64-mingw32/include/wincon.h
+ C:/mingw64/x86_64-w64-mingw32/include/wincrypt.h
+ C:/mingw64/x86_64-w64-mingw32/include/windef.h
+ C:/mingw64/x86_64-w64-mingw32/include/windows.h
+ C:/mingw64/x86_64-w64-mingw32/include/winefs.h
+ C:/mingw64/x86_64-w64-mingw32/include/winerror.h
+ C:/mingw64/x86_64-w64-mingw32/include/wingdi.h
+ C:/mingw64/x86_64-w64-mingw32/include/winioctl.h
+ C:/mingw64/x86_64-w64-mingw32/include/winnetwk.h
+ C:/mingw64/x86_64-w64-mingw32/include/winnls.h
+ C:/mingw64/x86_64-w64-mingw32/include/winnt.h
+ C:/mingw64/x86_64-w64-mingw32/include/winperf.h
+ C:/mingw64/x86_64-w64-mingw32/include/winreg.h
+ C:/mingw64/x86_64-w64-mingw32/include/winscard.h
+ C:/mingw64/x86_64-w64-mingw32/include/winsmcrd.h
+ C:/mingw64/x86_64-w64-mingw32/include/winsock.h
+ C:/mingw64/x86_64-w64-mingw32/include/winsock2.h
+ C:/mingw64/x86_64-w64-mingw32/include/winspool.h
+ C:/mingw64/x86_64-w64-mingw32/include/winsvc.h
+ C:/mingw64/x86_64-w64-mingw32/include/winuser.h
+ C:/mingw64/x86_64-w64-mingw32/include/winver.h
+ C:/mingw64/x86_64-w64-mingw32/include/wnnc.h
+ C:/mingw64/x86_64-w64-mingw32/include/wow64apiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/ws2def.h
+ C:/mingw64/x86_64-w64-mingw32/include/ws2ipdef.h
+ C:/mingw64/x86_64-w64-mingw32/include/ws2tcpip.h
+ C:/mingw64/x86_64-w64-mingw32/include/wtypes.h
+ C:/mingw64/x86_64-w64-mingw32/include/wtypesbase.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls1_3.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_certs.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_octads.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_sockets.h
+
+CMakeFiles/tiitls.dir/lib/tls_cert_chain.cpp.obj
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/lib/tls_cert_chain.cpp
+ C:/mingw64/include/c++/13.2.0/bits/std_abs.h
+ C:/mingw64/include/c++/13.2.0/cstdlib
+ C:/mingw64/include/c++/13.2.0/pstl/pstl_config.h
+ C:/mingw64/include/c++/13.2.0/stdlib.h
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/c++config.h
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/cpu_defines.h
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/os_defines.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/adxintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/ammintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxbf16intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxcomplexintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxfp16intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxint8intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxtileintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx2intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx5124fmapsintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx5124vnniwintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bf16intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bf16vlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bitalgintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bwintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512cdintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512dqintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512erintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fp16intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fp16vlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512ifmaintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512ifmavlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512pfintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmi2intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmi2vlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmiintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmivlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vlbwintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vldqintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vnniintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vnnivlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vp2intersectintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vp2intersectvlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vpopcntdqintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vpopcntdqvlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxifmaintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxneconvertintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxvnniint8intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxvnniintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/bmi2intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/bmiintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cetintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cldemoteintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clflushoptintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clwbintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clzerointrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cmpccxaddintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/emmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/enqcmdintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/f16cintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fma4intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fmaintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fxsrintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/gfniintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/hresetintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/ia32intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/immintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/keylockerintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/limits.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/lwpintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/lzcntintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mm3dnow.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mm_malloc.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/movdirintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mwaitintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mwaitxintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pconfigintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pkuintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pmmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/popcntintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/prfchiintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/prfchwintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/raointintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/rdseedintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/rtmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/serializeintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/sgxintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/shaintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/smmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stdarg.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stddef.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stdint.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/syslimits.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tbmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tmmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tsxldtrkintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/uintrintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/vaesintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/vpclmulqdqintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/waitpkgintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/wbnoinvdintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/wmmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/x86gprintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/x86intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xmmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xopintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsavecintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsaveintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsaveoptintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsavesintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xtestintrin.h
+ C:/mingw64/x86_64-w64-mingw32/include/_bsd_types.h
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw.h
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_mac.h
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_off_t.h
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_secapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_stdarg.h
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_unicode.h
+ C:/mingw64/x86_64-w64-mingw32/include/_timeval.h
+ C:/mingw64/x86_64-w64-mingw32/include/afunix.h
+ C:/mingw64/x86_64-w64-mingw32/include/apiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/apisetcconv.h
+ C:/mingw64/x86_64-w64-mingw32/include/basetsd.h
+ C:/mingw64/x86_64-w64-mingw32/include/bcrypt.h
+ C:/mingw64/x86_64-w64-mingw32/include/bemapiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/cderr.h
+ C:/mingw64/x86_64-w64-mingw32/include/cguid.h
+ C:/mingw64/x86_64-w64-mingw32/include/combaseapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/commdlg.h
+ C:/mingw64/x86_64-w64-mingw32/include/concurrencysal.h
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt.h
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt_startup.h
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt_stdio_config.h
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt_wstdlib.h
+ C:/mingw64/x86_64-w64-mingw32/include/crtdefs.h
+ C:/mingw64/x86_64-w64-mingw32/include/ctype.h
+ C:/mingw64/x86_64-w64-mingw32/include/datetimeapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/dde.h
+ C:/mingw64/x86_64-w64-mingw32/include/ddeml.h
+ C:/mingw64/x86_64-w64-mingw32/include/debugapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/dlgs.h
+ C:/mingw64/x86_64-w64-mingw32/include/dpapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/driverspecs.h
+ C:/mingw64/x86_64-w64-mingw32/include/errhandlingapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/errno.h
+ C:/mingw64/x86_64-w64-mingw32/include/excpt.h
+ C:/mingw64/x86_64-w64-mingw32/include/fibersapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/fileapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/fltwinerror.h
+ C:/mingw64/x86_64-w64-mingw32/include/getopt.h
+ C:/mingw64/x86_64-w64-mingw32/include/guiddef.h
+ C:/mingw64/x86_64-w64-mingw32/include/handleapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/heapapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/imm.h
+ C:/mingw64/x86_64-w64-mingw32/include/in6addr.h
+ C:/mingw64/x86_64-w64-mingw32/include/inaddr.h
+ C:/mingw64/x86_64-w64-mingw32/include/interlockedapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/io.h
+ C:/mingw64/x86_64-w64-mingw32/include/ioapiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/jobapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/joystickapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/ktmtypes.h
+ C:/mingw64/x86_64-w64-mingw32/include/libloaderapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/limits.h
+ C:/mingw64/x86_64-w64-mingw32/include/lzexpand.h
+ C:/mingw64/x86_64-w64-mingw32/include/malloc.h
+ C:/mingw64/x86_64-w64-mingw32/include/mciapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/mcx.h
+ C:/mingw64/x86_64-w64-mingw32/include/memoryapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/minwinbase.h
+ C:/mingw64/x86_64-w64-mingw32/include/minwindef.h
+ C:/mingw64/x86_64-w64-mingw32/include/mmeapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/mmiscapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/mmiscapi2.h
+ C:/mingw64/x86_64-w64-mingw32/include/mmsyscom.h
+ C:/mingw64/x86_64-w64-mingw32/include/mmsystem.h
+ C:/mingw64/x86_64-w64-mingw32/include/mstcpip.h
+ C:/mingw64/x86_64-w64-mingw32/include/msxml.h
+ C:/mingw64/x86_64-w64-mingw32/include/namedpipeapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/namespaceapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/nb30.h
+ C:/mingw64/x86_64-w64-mingw32/include/ncrypt.h
+ C:/mingw64/x86_64-w64-mingw32/include/oaidl.h
+ C:/mingw64/x86_64-w64-mingw32/include/objbase.h
+ C:/mingw64/x86_64-w64-mingw32/include/objidl.h
+ C:/mingw64/x86_64-w64-mingw32/include/objidlbase.h
+ C:/mingw64/x86_64-w64-mingw32/include/ole2.h
+ C:/mingw64/x86_64-w64-mingw32/include/oleauto.h
+ C:/mingw64/x86_64-w64-mingw32/include/oleidl.h
+ C:/mingw64/x86_64-w64-mingw32/include/playsoundapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/poppack.h
+ C:/mingw64/x86_64-w64-mingw32/include/process.h
+ C:/mingw64/x86_64-w64-mingw32/include/processenv.h
+ C:/mingw64/x86_64-w64-mingw32/include/processthreadsapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/processtopologyapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/profileapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/propidl.h
+ C:/mingw64/x86_64-w64-mingw32/include/prsht.h
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_fd_types.h
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ip_mreq1.h
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ip_types.h
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_socket_types.h
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ws1_undef.h
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_wsa_errnos.h
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_wsadata.h
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/intrin-impl.h
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack1.h
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack2.h
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack4.h
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack8.h
+ C:/mingw64/x86_64-w64-mingw32/include/pthread_time.h
+ C:/mingw64/x86_64-w64-mingw32/include/pthread_unistd.h
+ C:/mingw64/x86_64-w64-mingw32/include/qos.h
+ C:/mingw64/x86_64-w64-mingw32/include/realtimeapiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/reason.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpc.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpcasync.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpcdce.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpcdcep.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpcndr.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpcnsi.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpcnsip.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpcnterr.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpcsal.h
+ C:/mingw64/x86_64-w64-mingw32/include/sal.h
+ C:/mingw64/x86_64-w64-mingw32/include/sdkddkver.h
+ C:/mingw64/x86_64-w64-mingw32/include/sdks/_mingw_ddk.h
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/stdio_s.h
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/stdlib_s.h
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/stralign_s.h
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/string_s.h
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/sys/timeb_s.h
+ C:/mingw64/x86_64-w64-mingw32/include/securityappcontainer.h
+ C:/mingw64/x86_64-w64-mingw32/include/securitybaseapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/servprov.h
+ C:/mingw64/x86_64-w64-mingw32/include/shellapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/specstrings.h
+ C:/mingw64/x86_64-w64-mingw32/include/stdarg.h
+ C:/mingw64/x86_64-w64-mingw32/include/stddef.h
+ C:/mingw64/x86_64-w64-mingw32/include/stdint.h
+ C:/mingw64/x86_64-w64-mingw32/include/stdio.h
+ C:/mingw64/x86_64-w64-mingw32/include/stdlib.h
+ C:/mingw64/x86_64-w64-mingw32/include/stralign.h
+ C:/mingw64/x86_64-w64-mingw32/include/string.h
+ C:/mingw64/x86_64-w64-mingw32/include/stringapiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/swprintf.inl
+ C:/mingw64/x86_64-w64-mingw32/include/synchapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/sys/timeb.h
+ C:/mingw64/x86_64-w64-mingw32/include/sys/types.h
+ C:/mingw64/x86_64-w64-mingw32/include/sysinfoapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/systemtopologyapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/threadpoolapiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/threadpoollegacyapiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/time.h
+ C:/mingw64/x86_64-w64-mingw32/include/timeapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/timezoneapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/tvout.h
+ C:/mingw64/x86_64-w64-mingw32/include/unistd.h
+ C:/mingw64/x86_64-w64-mingw32/include/unknwn.h
+ C:/mingw64/x86_64-w64-mingw32/include/unknwnbase.h
+ C:/mingw64/x86_64-w64-mingw32/include/urlmon.h
+ C:/mingw64/x86_64-w64-mingw32/include/utilapiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/vadefs.h
+ C:/mingw64/x86_64-w64-mingw32/include/virtdisk.h
+ C:/mingw64/x86_64-w64-mingw32/include/winapifamily.h
+ C:/mingw64/x86_64-w64-mingw32/include/winbase.h
+ C:/mingw64/x86_64-w64-mingw32/include/wincon.h
+ C:/mingw64/x86_64-w64-mingw32/include/wincrypt.h
+ C:/mingw64/x86_64-w64-mingw32/include/windef.h
+ C:/mingw64/x86_64-w64-mingw32/include/windows.h
+ C:/mingw64/x86_64-w64-mingw32/include/winefs.h
+ C:/mingw64/x86_64-w64-mingw32/include/winerror.h
+ C:/mingw64/x86_64-w64-mingw32/include/wingdi.h
+ C:/mingw64/x86_64-w64-mingw32/include/winioctl.h
+ C:/mingw64/x86_64-w64-mingw32/include/winnetwk.h
+ C:/mingw64/x86_64-w64-mingw32/include/winnls.h
+ C:/mingw64/x86_64-w64-mingw32/include/winnt.h
+ C:/mingw64/x86_64-w64-mingw32/include/winperf.h
+ C:/mingw64/x86_64-w64-mingw32/include/winreg.h
+ C:/mingw64/x86_64-w64-mingw32/include/winscard.h
+ C:/mingw64/x86_64-w64-mingw32/include/winsmcrd.h
+ C:/mingw64/x86_64-w64-mingw32/include/winsock.h
+ C:/mingw64/x86_64-w64-mingw32/include/winsock2.h
+ C:/mingw64/x86_64-w64-mingw32/include/winspool.h
+ C:/mingw64/x86_64-w64-mingw32/include/winsvc.h
+ C:/mingw64/x86_64-w64-mingw32/include/winuser.h
+ C:/mingw64/x86_64-w64-mingw32/include/winver.h
+ C:/mingw64/x86_64-w64-mingw32/include/wnnc.h
+ C:/mingw64/x86_64-w64-mingw32/include/wow64apiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/ws2def.h
+ C:/mingw64/x86_64-w64-mingw32/include/ws2ipdef.h
+ C:/mingw64/x86_64-w64-mingw32/include/ws2tcpip.h
+ C:/mingw64/x86_64-w64-mingw32/include/wtypes.h
+ C:/mingw64/x86_64-w64-mingw32/include/wtypesbase.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls1_3.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_cert_chain.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_certs.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_client_recv.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_client_send.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_keys_calc.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_logger.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_octads.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_sal.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_sockets.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_x509.h
+
+CMakeFiles/tiitls.dir/lib/tls_client_cert.cpp.obj
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/lib/tls_client_cert.cpp
+ C:/mingw64/include/c++/13.2.0/bits/std_abs.h
+ C:/mingw64/include/c++/13.2.0/cstdlib
+ C:/mingw64/include/c++/13.2.0/pstl/pstl_config.h
+ C:/mingw64/include/c++/13.2.0/stdlib.h
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/c++config.h
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/cpu_defines.h
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/os_defines.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/adxintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/ammintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxbf16intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxcomplexintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxfp16intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxint8intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxtileintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx2intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx5124fmapsintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx5124vnniwintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bf16intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bf16vlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bitalgintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bwintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512cdintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512dqintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512erintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fp16intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fp16vlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512ifmaintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512ifmavlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512pfintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmi2intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmi2vlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmiintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmivlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vlbwintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vldqintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vnniintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vnnivlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vp2intersectintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vp2intersectvlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vpopcntdqintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vpopcntdqvlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxifmaintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxneconvertintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxvnniint8intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxvnniintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/bmi2intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/bmiintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cetintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cldemoteintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clflushoptintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clwbintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clzerointrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cmpccxaddintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/emmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/enqcmdintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/f16cintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fma4intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fmaintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fxsrintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/gfniintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/hresetintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/ia32intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/immintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/keylockerintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/limits.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/lwpintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/lzcntintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mm3dnow.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mm_malloc.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/movdirintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mwaitintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mwaitxintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pconfigintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pkuintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pmmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/popcntintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/prfchiintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/prfchwintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/raointintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/rdseedintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/rtmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/serializeintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/sgxintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/shaintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/smmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stdarg.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stddef.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stdint.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/syslimits.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tbmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tmmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tsxldtrkintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/uintrintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/vaesintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/vpclmulqdqintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/waitpkgintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/wbnoinvdintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/wmmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/x86gprintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/x86intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xmmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xopintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsavecintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsaveintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsaveoptintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsavesintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xtestintrin.h
+ C:/mingw64/x86_64-w64-mingw32/include/_bsd_types.h
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw.h
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_mac.h
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_off_t.h
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_secapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_stdarg.h
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_unicode.h
+ C:/mingw64/x86_64-w64-mingw32/include/_timeval.h
+ C:/mingw64/x86_64-w64-mingw32/include/afunix.h
+ C:/mingw64/x86_64-w64-mingw32/include/apiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/apisetcconv.h
+ C:/mingw64/x86_64-w64-mingw32/include/basetsd.h
+ C:/mingw64/x86_64-w64-mingw32/include/bcrypt.h
+ C:/mingw64/x86_64-w64-mingw32/include/bemapiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/cderr.h
+ C:/mingw64/x86_64-w64-mingw32/include/cguid.h
+ C:/mingw64/x86_64-w64-mingw32/include/combaseapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/commdlg.h
+ C:/mingw64/x86_64-w64-mingw32/include/concurrencysal.h
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt.h
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt_startup.h
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt_stdio_config.h
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt_wstdlib.h
+ C:/mingw64/x86_64-w64-mingw32/include/crtdefs.h
+ C:/mingw64/x86_64-w64-mingw32/include/ctype.h
+ C:/mingw64/x86_64-w64-mingw32/include/datetimeapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/dde.h
+ C:/mingw64/x86_64-w64-mingw32/include/ddeml.h
+ C:/mingw64/x86_64-w64-mingw32/include/debugapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/dlgs.h
+ C:/mingw64/x86_64-w64-mingw32/include/dpapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/driverspecs.h
+ C:/mingw64/x86_64-w64-mingw32/include/errhandlingapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/errno.h
+ C:/mingw64/x86_64-w64-mingw32/include/excpt.h
+ C:/mingw64/x86_64-w64-mingw32/include/fibersapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/fileapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/fltwinerror.h
+ C:/mingw64/x86_64-w64-mingw32/include/getopt.h
+ C:/mingw64/x86_64-w64-mingw32/include/guiddef.h
+ C:/mingw64/x86_64-w64-mingw32/include/handleapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/heapapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/imm.h
+ C:/mingw64/x86_64-w64-mingw32/include/in6addr.h
+ C:/mingw64/x86_64-w64-mingw32/include/inaddr.h
+ C:/mingw64/x86_64-w64-mingw32/include/interlockedapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/io.h
+ C:/mingw64/x86_64-w64-mingw32/include/ioapiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/jobapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/joystickapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/ktmtypes.h
+ C:/mingw64/x86_64-w64-mingw32/include/libloaderapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/limits.h
+ C:/mingw64/x86_64-w64-mingw32/include/lzexpand.h
+ C:/mingw64/x86_64-w64-mingw32/include/malloc.h
+ C:/mingw64/x86_64-w64-mingw32/include/mciapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/mcx.h
+ C:/mingw64/x86_64-w64-mingw32/include/memoryapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/minwinbase.h
+ C:/mingw64/x86_64-w64-mingw32/include/minwindef.h
+ C:/mingw64/x86_64-w64-mingw32/include/mmeapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/mmiscapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/mmiscapi2.h
+ C:/mingw64/x86_64-w64-mingw32/include/mmsyscom.h
+ C:/mingw64/x86_64-w64-mingw32/include/mmsystem.h
+ C:/mingw64/x86_64-w64-mingw32/include/mstcpip.h
+ C:/mingw64/x86_64-w64-mingw32/include/msxml.h
+ C:/mingw64/x86_64-w64-mingw32/include/namedpipeapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/namespaceapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/nb30.h
+ C:/mingw64/x86_64-w64-mingw32/include/ncrypt.h
+ C:/mingw64/x86_64-w64-mingw32/include/oaidl.h
+ C:/mingw64/x86_64-w64-mingw32/include/objbase.h
+ C:/mingw64/x86_64-w64-mingw32/include/objidl.h
+ C:/mingw64/x86_64-w64-mingw32/include/objidlbase.h
+ C:/mingw64/x86_64-w64-mingw32/include/ole2.h
+ C:/mingw64/x86_64-w64-mingw32/include/oleauto.h
+ C:/mingw64/x86_64-w64-mingw32/include/oleidl.h
+ C:/mingw64/x86_64-w64-mingw32/include/playsoundapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/poppack.h
+ C:/mingw64/x86_64-w64-mingw32/include/process.h
+ C:/mingw64/x86_64-w64-mingw32/include/processenv.h
+ C:/mingw64/x86_64-w64-mingw32/include/processthreadsapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/processtopologyapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/profileapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/propidl.h
+ C:/mingw64/x86_64-w64-mingw32/include/prsht.h
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_fd_types.h
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ip_mreq1.h
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ip_types.h
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_socket_types.h
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ws1_undef.h
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_wsa_errnos.h
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_wsadata.h
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/intrin-impl.h
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack1.h
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack2.h
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack4.h
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack8.h
+ C:/mingw64/x86_64-w64-mingw32/include/pthread_time.h
+ C:/mingw64/x86_64-w64-mingw32/include/pthread_unistd.h
+ C:/mingw64/x86_64-w64-mingw32/include/qos.h
+ C:/mingw64/x86_64-w64-mingw32/include/realtimeapiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/reason.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpc.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpcasync.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpcdce.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpcdcep.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpcndr.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpcnsi.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpcnsip.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpcnterr.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpcsal.h
+ C:/mingw64/x86_64-w64-mingw32/include/sal.h
+ C:/mingw64/x86_64-w64-mingw32/include/sdkddkver.h
+ C:/mingw64/x86_64-w64-mingw32/include/sdks/_mingw_ddk.h
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/stdio_s.h
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/stdlib_s.h
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/stralign_s.h
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/string_s.h
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/sys/timeb_s.h
+ C:/mingw64/x86_64-w64-mingw32/include/securityappcontainer.h
+ C:/mingw64/x86_64-w64-mingw32/include/securitybaseapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/servprov.h
+ C:/mingw64/x86_64-w64-mingw32/include/shellapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/specstrings.h
+ C:/mingw64/x86_64-w64-mingw32/include/stdarg.h
+ C:/mingw64/x86_64-w64-mingw32/include/stddef.h
+ C:/mingw64/x86_64-w64-mingw32/include/stdint.h
+ C:/mingw64/x86_64-w64-mingw32/include/stdio.h
+ C:/mingw64/x86_64-w64-mingw32/include/stdlib.h
+ C:/mingw64/x86_64-w64-mingw32/include/stralign.h
+ C:/mingw64/x86_64-w64-mingw32/include/string.h
+ C:/mingw64/x86_64-w64-mingw32/include/stringapiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/swprintf.inl
+ C:/mingw64/x86_64-w64-mingw32/include/synchapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/sys/timeb.h
+ C:/mingw64/x86_64-w64-mingw32/include/sys/types.h
+ C:/mingw64/x86_64-w64-mingw32/include/sysinfoapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/systemtopologyapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/threadpoolapiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/threadpoollegacyapiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/time.h
+ C:/mingw64/x86_64-w64-mingw32/include/timeapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/timezoneapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/tvout.h
+ C:/mingw64/x86_64-w64-mingw32/include/unistd.h
+ C:/mingw64/x86_64-w64-mingw32/include/unknwn.h
+ C:/mingw64/x86_64-w64-mingw32/include/unknwnbase.h
+ C:/mingw64/x86_64-w64-mingw32/include/urlmon.h
+ C:/mingw64/x86_64-w64-mingw32/include/utilapiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/vadefs.h
+ C:/mingw64/x86_64-w64-mingw32/include/virtdisk.h
+ C:/mingw64/x86_64-w64-mingw32/include/winapifamily.h
+ C:/mingw64/x86_64-w64-mingw32/include/winbase.h
+ C:/mingw64/x86_64-w64-mingw32/include/wincon.h
+ C:/mingw64/x86_64-w64-mingw32/include/wincrypt.h
+ C:/mingw64/x86_64-w64-mingw32/include/windef.h
+ C:/mingw64/x86_64-w64-mingw32/include/windows.h
+ C:/mingw64/x86_64-w64-mingw32/include/winefs.h
+ C:/mingw64/x86_64-w64-mingw32/include/winerror.h
+ C:/mingw64/x86_64-w64-mingw32/include/wingdi.h
+ C:/mingw64/x86_64-w64-mingw32/include/winioctl.h
+ C:/mingw64/x86_64-w64-mingw32/include/winnetwk.h
+ C:/mingw64/x86_64-w64-mingw32/include/winnls.h
+ C:/mingw64/x86_64-w64-mingw32/include/winnt.h
+ C:/mingw64/x86_64-w64-mingw32/include/winperf.h
+ C:/mingw64/x86_64-w64-mingw32/include/winreg.h
+ C:/mingw64/x86_64-w64-mingw32/include/winscard.h
+ C:/mingw64/x86_64-w64-mingw32/include/winsmcrd.h
+ C:/mingw64/x86_64-w64-mingw32/include/winsock.h
+ C:/mingw64/x86_64-w64-mingw32/include/winsock2.h
+ C:/mingw64/x86_64-w64-mingw32/include/winspool.h
+ C:/mingw64/x86_64-w64-mingw32/include/winsvc.h
+ C:/mingw64/x86_64-w64-mingw32/include/winuser.h
+ C:/mingw64/x86_64-w64-mingw32/include/winver.h
+ C:/mingw64/x86_64-w64-mingw32/include/wnnc.h
+ C:/mingw64/x86_64-w64-mingw32/include/wow64apiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/ws2def.h
+ C:/mingw64/x86_64-w64-mingw32/include/ws2ipdef.h
+ C:/mingw64/x86_64-w64-mingw32/include/ws2tcpip.h
+ C:/mingw64/x86_64-w64-mingw32/include/wtypes.h
+ C:/mingw64/x86_64-w64-mingw32/include/wtypesbase.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls1_3.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_certs.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_octads.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_sockets.h
+
+CMakeFiles/tiitls.dir/lib/tls_client_recv.cpp.obj
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/lib/tls_client_recv.cpp
+ C:/mingw64/include/c++/13.2.0/bits/std_abs.h
+ C:/mingw64/include/c++/13.2.0/cstdlib
+ C:/mingw64/include/c++/13.2.0/pstl/pstl_config.h
+ C:/mingw64/include/c++/13.2.0/stdlib.h
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/c++config.h
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/cpu_defines.h
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/os_defines.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/adxintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/ammintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxbf16intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxcomplexintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxfp16intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxint8intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxtileintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx2intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx5124fmapsintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx5124vnniwintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bf16intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bf16vlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bitalgintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bwintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512cdintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512dqintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512erintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fp16intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fp16vlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512ifmaintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512ifmavlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512pfintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmi2intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmi2vlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmiintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmivlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vlbwintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vldqintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vnniintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vnnivlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vp2intersectintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vp2intersectvlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vpopcntdqintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vpopcntdqvlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxifmaintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxneconvertintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxvnniint8intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxvnniintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/bmi2intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/bmiintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cetintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cldemoteintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clflushoptintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clwbintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clzerointrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cmpccxaddintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/emmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/enqcmdintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/f16cintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fma4intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fmaintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fxsrintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/gfniintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/hresetintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/ia32intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/immintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/keylockerintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/limits.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/lwpintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/lzcntintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mm3dnow.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mm_malloc.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/movdirintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mwaitintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mwaitxintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pconfigintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pkuintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pmmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/popcntintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/prfchiintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/prfchwintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/raointintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/rdseedintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/rtmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/serializeintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/sgxintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/shaintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/smmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stdarg.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stddef.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stdint.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/syslimits.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tbmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tmmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tsxldtrkintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/uintrintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/vaesintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/vpclmulqdqintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/waitpkgintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/wbnoinvdintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/wmmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/x86gprintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/x86intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xmmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xopintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsavecintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsaveintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsaveoptintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsavesintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xtestintrin.h
+ C:/mingw64/x86_64-w64-mingw32/include/_bsd_types.h
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw.h
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_mac.h
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_off_t.h
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_secapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_stdarg.h
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_unicode.h
+ C:/mingw64/x86_64-w64-mingw32/include/_timeval.h
+ C:/mingw64/x86_64-w64-mingw32/include/afunix.h
+ C:/mingw64/x86_64-w64-mingw32/include/apiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/apisetcconv.h
+ C:/mingw64/x86_64-w64-mingw32/include/basetsd.h
+ C:/mingw64/x86_64-w64-mingw32/include/bcrypt.h
+ C:/mingw64/x86_64-w64-mingw32/include/bemapiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/cderr.h
+ C:/mingw64/x86_64-w64-mingw32/include/cguid.h
+ C:/mingw64/x86_64-w64-mingw32/include/combaseapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/commdlg.h
+ C:/mingw64/x86_64-w64-mingw32/include/concurrencysal.h
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt.h
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt_startup.h
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt_stdio_config.h
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt_wstdlib.h
+ C:/mingw64/x86_64-w64-mingw32/include/crtdefs.h
+ C:/mingw64/x86_64-w64-mingw32/include/ctype.h
+ C:/mingw64/x86_64-w64-mingw32/include/datetimeapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/dde.h
+ C:/mingw64/x86_64-w64-mingw32/include/ddeml.h
+ C:/mingw64/x86_64-w64-mingw32/include/debugapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/dlgs.h
+ C:/mingw64/x86_64-w64-mingw32/include/dpapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/driverspecs.h
+ C:/mingw64/x86_64-w64-mingw32/include/errhandlingapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/errno.h
+ C:/mingw64/x86_64-w64-mingw32/include/excpt.h
+ C:/mingw64/x86_64-w64-mingw32/include/fibersapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/fileapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/fltwinerror.h
+ C:/mingw64/x86_64-w64-mingw32/include/getopt.h
+ C:/mingw64/x86_64-w64-mingw32/include/guiddef.h
+ C:/mingw64/x86_64-w64-mingw32/include/handleapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/heapapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/imm.h
+ C:/mingw64/x86_64-w64-mingw32/include/in6addr.h
+ C:/mingw64/x86_64-w64-mingw32/include/inaddr.h
+ C:/mingw64/x86_64-w64-mingw32/include/interlockedapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/io.h
+ C:/mingw64/x86_64-w64-mingw32/include/ioapiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/jobapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/joystickapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/ktmtypes.h
+ C:/mingw64/x86_64-w64-mingw32/include/libloaderapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/limits.h
+ C:/mingw64/x86_64-w64-mingw32/include/lzexpand.h
+ C:/mingw64/x86_64-w64-mingw32/include/malloc.h
+ C:/mingw64/x86_64-w64-mingw32/include/mciapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/mcx.h
+ C:/mingw64/x86_64-w64-mingw32/include/memoryapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/minwinbase.h
+ C:/mingw64/x86_64-w64-mingw32/include/minwindef.h
+ C:/mingw64/x86_64-w64-mingw32/include/mmeapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/mmiscapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/mmiscapi2.h
+ C:/mingw64/x86_64-w64-mingw32/include/mmsyscom.h
+ C:/mingw64/x86_64-w64-mingw32/include/mmsystem.h
+ C:/mingw64/x86_64-w64-mingw32/include/mstcpip.h
+ C:/mingw64/x86_64-w64-mingw32/include/msxml.h
+ C:/mingw64/x86_64-w64-mingw32/include/namedpipeapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/namespaceapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/nb30.h
+ C:/mingw64/x86_64-w64-mingw32/include/ncrypt.h
+ C:/mingw64/x86_64-w64-mingw32/include/oaidl.h
+ C:/mingw64/x86_64-w64-mingw32/include/objbase.h
+ C:/mingw64/x86_64-w64-mingw32/include/objidl.h
+ C:/mingw64/x86_64-w64-mingw32/include/objidlbase.h
+ C:/mingw64/x86_64-w64-mingw32/include/ole2.h
+ C:/mingw64/x86_64-w64-mingw32/include/oleauto.h
+ C:/mingw64/x86_64-w64-mingw32/include/oleidl.h
+ C:/mingw64/x86_64-w64-mingw32/include/playsoundapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/poppack.h
+ C:/mingw64/x86_64-w64-mingw32/include/process.h
+ C:/mingw64/x86_64-w64-mingw32/include/processenv.h
+ C:/mingw64/x86_64-w64-mingw32/include/processthreadsapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/processtopologyapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/profileapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/propidl.h
+ C:/mingw64/x86_64-w64-mingw32/include/prsht.h
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_fd_types.h
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ip_mreq1.h
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ip_types.h
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_socket_types.h
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ws1_undef.h
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_wsa_errnos.h
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_wsadata.h
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/intrin-impl.h
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack1.h
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack2.h
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack4.h
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack8.h
+ C:/mingw64/x86_64-w64-mingw32/include/pthread_time.h
+ C:/mingw64/x86_64-w64-mingw32/include/pthread_unistd.h
+ C:/mingw64/x86_64-w64-mingw32/include/qos.h
+ C:/mingw64/x86_64-w64-mingw32/include/realtimeapiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/reason.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpc.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpcasync.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpcdce.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpcdcep.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpcndr.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpcnsi.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpcnsip.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpcnterr.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpcsal.h
+ C:/mingw64/x86_64-w64-mingw32/include/sal.h
+ C:/mingw64/x86_64-w64-mingw32/include/sdkddkver.h
+ C:/mingw64/x86_64-w64-mingw32/include/sdks/_mingw_ddk.h
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/stdio_s.h
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/stdlib_s.h
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/stralign_s.h
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/string_s.h
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/sys/timeb_s.h
+ C:/mingw64/x86_64-w64-mingw32/include/securityappcontainer.h
+ C:/mingw64/x86_64-w64-mingw32/include/securitybaseapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/servprov.h
+ C:/mingw64/x86_64-w64-mingw32/include/shellapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/specstrings.h
+ C:/mingw64/x86_64-w64-mingw32/include/stdarg.h
+ C:/mingw64/x86_64-w64-mingw32/include/stddef.h
+ C:/mingw64/x86_64-w64-mingw32/include/stdint.h
+ C:/mingw64/x86_64-w64-mingw32/include/stdio.h
+ C:/mingw64/x86_64-w64-mingw32/include/stdlib.h
+ C:/mingw64/x86_64-w64-mingw32/include/stralign.h
+ C:/mingw64/x86_64-w64-mingw32/include/string.h
+ C:/mingw64/x86_64-w64-mingw32/include/stringapiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/swprintf.inl
+ C:/mingw64/x86_64-w64-mingw32/include/synchapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/sys/timeb.h
+ C:/mingw64/x86_64-w64-mingw32/include/sys/types.h
+ C:/mingw64/x86_64-w64-mingw32/include/sysinfoapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/systemtopologyapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/threadpoolapiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/threadpoollegacyapiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/time.h
+ C:/mingw64/x86_64-w64-mingw32/include/timeapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/timezoneapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/tvout.h
+ C:/mingw64/x86_64-w64-mingw32/include/unistd.h
+ C:/mingw64/x86_64-w64-mingw32/include/unknwn.h
+ C:/mingw64/x86_64-w64-mingw32/include/unknwnbase.h
+ C:/mingw64/x86_64-w64-mingw32/include/urlmon.h
+ C:/mingw64/x86_64-w64-mingw32/include/utilapiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/vadefs.h
+ C:/mingw64/x86_64-w64-mingw32/include/virtdisk.h
+ C:/mingw64/x86_64-w64-mingw32/include/winapifamily.h
+ C:/mingw64/x86_64-w64-mingw32/include/winbase.h
+ C:/mingw64/x86_64-w64-mingw32/include/wincon.h
+ C:/mingw64/x86_64-w64-mingw32/include/wincrypt.h
+ C:/mingw64/x86_64-w64-mingw32/include/windef.h
+ C:/mingw64/x86_64-w64-mingw32/include/windows.h
+ C:/mingw64/x86_64-w64-mingw32/include/winefs.h
+ C:/mingw64/x86_64-w64-mingw32/include/winerror.h
+ C:/mingw64/x86_64-w64-mingw32/include/wingdi.h
+ C:/mingw64/x86_64-w64-mingw32/include/winioctl.h
+ C:/mingw64/x86_64-w64-mingw32/include/winnetwk.h
+ C:/mingw64/x86_64-w64-mingw32/include/winnls.h
+ C:/mingw64/x86_64-w64-mingw32/include/winnt.h
+ C:/mingw64/x86_64-w64-mingw32/include/winperf.h
+ C:/mingw64/x86_64-w64-mingw32/include/winreg.h
+ C:/mingw64/x86_64-w64-mingw32/include/winscard.h
+ C:/mingw64/x86_64-w64-mingw32/include/winsmcrd.h
+ C:/mingw64/x86_64-w64-mingw32/include/winsock.h
+ C:/mingw64/x86_64-w64-mingw32/include/winsock2.h
+ C:/mingw64/x86_64-w64-mingw32/include/winspool.h
+ C:/mingw64/x86_64-w64-mingw32/include/winsvc.h
+ C:/mingw64/x86_64-w64-mingw32/include/winuser.h
+ C:/mingw64/x86_64-w64-mingw32/include/winver.h
+ C:/mingw64/x86_64-w64-mingw32/include/wnnc.h
+ C:/mingw64/x86_64-w64-mingw32/include/wow64apiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/ws2def.h
+ C:/mingw64/x86_64-w64-mingw32/include/ws2ipdef.h
+ C:/mingw64/x86_64-w64-mingw32/include/ws2tcpip.h
+ C:/mingw64/x86_64-w64-mingw32/include/wtypes.h
+ C:/mingw64/x86_64-w64-mingw32/include/wtypesbase.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls1_3.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_cert_chain.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_certs.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_client_recv.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_client_send.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_keys_calc.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_logger.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_octads.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_sal.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_sockets.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_x509.h
+
+CMakeFiles/tiitls.dir/lib/tls_client_send.cpp.obj
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/lib/tls_client_send.cpp
+ C:/mingw64/include/c++/13.2.0/bits/std_abs.h
+ C:/mingw64/include/c++/13.2.0/cstdlib
+ C:/mingw64/include/c++/13.2.0/pstl/pstl_config.h
+ C:/mingw64/include/c++/13.2.0/stdlib.h
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/c++config.h
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/cpu_defines.h
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/os_defines.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/adxintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/ammintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxbf16intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxcomplexintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxfp16intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxint8intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxtileintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx2intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx5124fmapsintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx5124vnniwintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bf16intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bf16vlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bitalgintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bwintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512cdintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512dqintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512erintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fp16intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fp16vlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512ifmaintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512ifmavlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512pfintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmi2intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmi2vlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmiintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmivlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vlbwintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vldqintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vnniintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vnnivlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vp2intersectintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vp2intersectvlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vpopcntdqintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vpopcntdqvlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxifmaintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxneconvertintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxvnniint8intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxvnniintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/bmi2intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/bmiintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cetintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cldemoteintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clflushoptintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clwbintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clzerointrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cmpccxaddintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/emmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/enqcmdintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/f16cintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fma4intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fmaintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fxsrintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/gfniintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/hresetintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/ia32intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/immintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/keylockerintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/limits.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/lwpintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/lzcntintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mm3dnow.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mm_malloc.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/movdirintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mwaitintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mwaitxintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pconfigintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pkuintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pmmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/popcntintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/prfchiintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/prfchwintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/raointintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/rdseedintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/rtmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/serializeintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/sgxintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/shaintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/smmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stdarg.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stddef.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stdint.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/syslimits.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tbmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tmmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tsxldtrkintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/uintrintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/vaesintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/vpclmulqdqintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/waitpkgintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/wbnoinvdintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/wmmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/x86gprintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/x86intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xmmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xopintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsavecintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsaveintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsaveoptintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsavesintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xtestintrin.h
+ C:/mingw64/x86_64-w64-mingw32/include/_bsd_types.h
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw.h
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_mac.h
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_off_t.h
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_secapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_stdarg.h
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_unicode.h
+ C:/mingw64/x86_64-w64-mingw32/include/_timeval.h
+ C:/mingw64/x86_64-w64-mingw32/include/afunix.h
+ C:/mingw64/x86_64-w64-mingw32/include/apiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/apisetcconv.h
+ C:/mingw64/x86_64-w64-mingw32/include/basetsd.h
+ C:/mingw64/x86_64-w64-mingw32/include/bcrypt.h
+ C:/mingw64/x86_64-w64-mingw32/include/bemapiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/cderr.h
+ C:/mingw64/x86_64-w64-mingw32/include/cguid.h
+ C:/mingw64/x86_64-w64-mingw32/include/combaseapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/commdlg.h
+ C:/mingw64/x86_64-w64-mingw32/include/concurrencysal.h
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt.h
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt_startup.h
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt_stdio_config.h
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt_wstdlib.h
+ C:/mingw64/x86_64-w64-mingw32/include/crtdefs.h
+ C:/mingw64/x86_64-w64-mingw32/include/ctype.h
+ C:/mingw64/x86_64-w64-mingw32/include/datetimeapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/dde.h
+ C:/mingw64/x86_64-w64-mingw32/include/ddeml.h
+ C:/mingw64/x86_64-w64-mingw32/include/debugapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/dlgs.h
+ C:/mingw64/x86_64-w64-mingw32/include/dpapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/driverspecs.h
+ C:/mingw64/x86_64-w64-mingw32/include/errhandlingapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/errno.h
+ C:/mingw64/x86_64-w64-mingw32/include/excpt.h
+ C:/mingw64/x86_64-w64-mingw32/include/fibersapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/fileapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/fltwinerror.h
+ C:/mingw64/x86_64-w64-mingw32/include/getopt.h
+ C:/mingw64/x86_64-w64-mingw32/include/guiddef.h
+ C:/mingw64/x86_64-w64-mingw32/include/handleapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/heapapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/imm.h
+ C:/mingw64/x86_64-w64-mingw32/include/in6addr.h
+ C:/mingw64/x86_64-w64-mingw32/include/inaddr.h
+ C:/mingw64/x86_64-w64-mingw32/include/interlockedapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/io.h
+ C:/mingw64/x86_64-w64-mingw32/include/ioapiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/jobapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/joystickapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/ktmtypes.h
+ C:/mingw64/x86_64-w64-mingw32/include/libloaderapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/limits.h
+ C:/mingw64/x86_64-w64-mingw32/include/lzexpand.h
+ C:/mingw64/x86_64-w64-mingw32/include/malloc.h
+ C:/mingw64/x86_64-w64-mingw32/include/mciapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/mcx.h
+ C:/mingw64/x86_64-w64-mingw32/include/memoryapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/minwinbase.h
+ C:/mingw64/x86_64-w64-mingw32/include/minwindef.h
+ C:/mingw64/x86_64-w64-mingw32/include/mmeapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/mmiscapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/mmiscapi2.h
+ C:/mingw64/x86_64-w64-mingw32/include/mmsyscom.h
+ C:/mingw64/x86_64-w64-mingw32/include/mmsystem.h
+ C:/mingw64/x86_64-w64-mingw32/include/mstcpip.h
+ C:/mingw64/x86_64-w64-mingw32/include/msxml.h
+ C:/mingw64/x86_64-w64-mingw32/include/namedpipeapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/namespaceapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/nb30.h
+ C:/mingw64/x86_64-w64-mingw32/include/ncrypt.h
+ C:/mingw64/x86_64-w64-mingw32/include/oaidl.h
+ C:/mingw64/x86_64-w64-mingw32/include/objbase.h
+ C:/mingw64/x86_64-w64-mingw32/include/objidl.h
+ C:/mingw64/x86_64-w64-mingw32/include/objidlbase.h
+ C:/mingw64/x86_64-w64-mingw32/include/ole2.h
+ C:/mingw64/x86_64-w64-mingw32/include/oleauto.h
+ C:/mingw64/x86_64-w64-mingw32/include/oleidl.h
+ C:/mingw64/x86_64-w64-mingw32/include/playsoundapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/poppack.h
+ C:/mingw64/x86_64-w64-mingw32/include/process.h
+ C:/mingw64/x86_64-w64-mingw32/include/processenv.h
+ C:/mingw64/x86_64-w64-mingw32/include/processthreadsapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/processtopologyapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/profileapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/propidl.h
+ C:/mingw64/x86_64-w64-mingw32/include/prsht.h
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_fd_types.h
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ip_mreq1.h
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ip_types.h
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_socket_types.h
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ws1_undef.h
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_wsa_errnos.h
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_wsadata.h
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/intrin-impl.h
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack1.h
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack2.h
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack4.h
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack8.h
+ C:/mingw64/x86_64-w64-mingw32/include/pthread_time.h
+ C:/mingw64/x86_64-w64-mingw32/include/pthread_unistd.h
+ C:/mingw64/x86_64-w64-mingw32/include/qos.h
+ C:/mingw64/x86_64-w64-mingw32/include/realtimeapiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/reason.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpc.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpcasync.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpcdce.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpcdcep.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpcndr.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpcnsi.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpcnsip.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpcnterr.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpcsal.h
+ C:/mingw64/x86_64-w64-mingw32/include/sal.h
+ C:/mingw64/x86_64-w64-mingw32/include/sdkddkver.h
+ C:/mingw64/x86_64-w64-mingw32/include/sdks/_mingw_ddk.h
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/stdio_s.h
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/stdlib_s.h
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/stralign_s.h
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/string_s.h
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/sys/timeb_s.h
+ C:/mingw64/x86_64-w64-mingw32/include/securityappcontainer.h
+ C:/mingw64/x86_64-w64-mingw32/include/securitybaseapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/servprov.h
+ C:/mingw64/x86_64-w64-mingw32/include/shellapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/specstrings.h
+ C:/mingw64/x86_64-w64-mingw32/include/stdarg.h
+ C:/mingw64/x86_64-w64-mingw32/include/stddef.h
+ C:/mingw64/x86_64-w64-mingw32/include/stdint.h
+ C:/mingw64/x86_64-w64-mingw32/include/stdio.h
+ C:/mingw64/x86_64-w64-mingw32/include/stdlib.h
+ C:/mingw64/x86_64-w64-mingw32/include/stralign.h
+ C:/mingw64/x86_64-w64-mingw32/include/string.h
+ C:/mingw64/x86_64-w64-mingw32/include/stringapiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/swprintf.inl
+ C:/mingw64/x86_64-w64-mingw32/include/synchapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/sys/timeb.h
+ C:/mingw64/x86_64-w64-mingw32/include/sys/types.h
+ C:/mingw64/x86_64-w64-mingw32/include/sysinfoapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/systemtopologyapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/threadpoolapiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/threadpoollegacyapiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/time.h
+ C:/mingw64/x86_64-w64-mingw32/include/timeapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/timezoneapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/tvout.h
+ C:/mingw64/x86_64-w64-mingw32/include/unistd.h
+ C:/mingw64/x86_64-w64-mingw32/include/unknwn.h
+ C:/mingw64/x86_64-w64-mingw32/include/unknwnbase.h
+ C:/mingw64/x86_64-w64-mingw32/include/urlmon.h
+ C:/mingw64/x86_64-w64-mingw32/include/utilapiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/vadefs.h
+ C:/mingw64/x86_64-w64-mingw32/include/virtdisk.h
+ C:/mingw64/x86_64-w64-mingw32/include/winapifamily.h
+ C:/mingw64/x86_64-w64-mingw32/include/winbase.h
+ C:/mingw64/x86_64-w64-mingw32/include/wincon.h
+ C:/mingw64/x86_64-w64-mingw32/include/wincrypt.h
+ C:/mingw64/x86_64-w64-mingw32/include/windef.h
+ C:/mingw64/x86_64-w64-mingw32/include/windows.h
+ C:/mingw64/x86_64-w64-mingw32/include/winefs.h
+ C:/mingw64/x86_64-w64-mingw32/include/winerror.h
+ C:/mingw64/x86_64-w64-mingw32/include/wingdi.h
+ C:/mingw64/x86_64-w64-mingw32/include/winioctl.h
+ C:/mingw64/x86_64-w64-mingw32/include/winnetwk.h
+ C:/mingw64/x86_64-w64-mingw32/include/winnls.h
+ C:/mingw64/x86_64-w64-mingw32/include/winnt.h
+ C:/mingw64/x86_64-w64-mingw32/include/winperf.h
+ C:/mingw64/x86_64-w64-mingw32/include/winreg.h
+ C:/mingw64/x86_64-w64-mingw32/include/winscard.h
+ C:/mingw64/x86_64-w64-mingw32/include/winsmcrd.h
+ C:/mingw64/x86_64-w64-mingw32/include/winsock.h
+ C:/mingw64/x86_64-w64-mingw32/include/winsock2.h
+ C:/mingw64/x86_64-w64-mingw32/include/winspool.h
+ C:/mingw64/x86_64-w64-mingw32/include/winsvc.h
+ C:/mingw64/x86_64-w64-mingw32/include/winuser.h
+ C:/mingw64/x86_64-w64-mingw32/include/winver.h
+ C:/mingw64/x86_64-w64-mingw32/include/wnnc.h
+ C:/mingw64/x86_64-w64-mingw32/include/wow64apiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/ws2def.h
+ C:/mingw64/x86_64-w64-mingw32/include/ws2ipdef.h
+ C:/mingw64/x86_64-w64-mingw32/include/ws2tcpip.h
+ C:/mingw64/x86_64-w64-mingw32/include/wtypes.h
+ C:/mingw64/x86_64-w64-mingw32/include/wtypesbase.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls1_3.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_certs.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_client_recv.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_client_send.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_keys_calc.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_logger.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_octads.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_sal.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_sockets.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_x509.h
+
+CMakeFiles/tiitls.dir/lib/tls_keys_calc.cpp.obj
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/lib/tls_keys_calc.cpp
+ C:/mingw64/include/c++/13.2.0/bits/std_abs.h
+ C:/mingw64/include/c++/13.2.0/cstdlib
+ C:/mingw64/include/c++/13.2.0/pstl/pstl_config.h
+ C:/mingw64/include/c++/13.2.0/stdlib.h
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/c++config.h
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/cpu_defines.h
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/os_defines.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/adxintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/ammintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxbf16intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxcomplexintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxfp16intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxint8intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxtileintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx2intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx5124fmapsintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx5124vnniwintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bf16intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bf16vlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bitalgintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bwintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512cdintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512dqintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512erintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fp16intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fp16vlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512ifmaintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512ifmavlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512pfintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmi2intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmi2vlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmiintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmivlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vlbwintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vldqintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vnniintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vnnivlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vp2intersectintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vp2intersectvlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vpopcntdqintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vpopcntdqvlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxifmaintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxneconvertintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxvnniint8intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxvnniintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/bmi2intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/bmiintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cetintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cldemoteintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clflushoptintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clwbintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clzerointrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cmpccxaddintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/emmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/enqcmdintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/f16cintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fma4intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fmaintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fxsrintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/gfniintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/hresetintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/ia32intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/immintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/keylockerintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/limits.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/lwpintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/lzcntintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mm3dnow.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mm_malloc.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/movdirintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mwaitintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mwaitxintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pconfigintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pkuintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pmmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/popcntintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/prfchiintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/prfchwintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/raointintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/rdseedintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/rtmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/serializeintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/sgxintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/shaintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/smmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stdarg.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stddef.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stdint.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/syslimits.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tbmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tmmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tsxldtrkintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/uintrintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/vaesintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/vpclmulqdqintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/waitpkgintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/wbnoinvdintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/wmmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/x86gprintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/x86intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xmmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xopintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsavecintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsaveintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsaveoptintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsavesintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xtestintrin.h
+ C:/mingw64/x86_64-w64-mingw32/include/_bsd_types.h
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw.h
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_mac.h
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_off_t.h
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_secapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_stdarg.h
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_unicode.h
+ C:/mingw64/x86_64-w64-mingw32/include/_timeval.h
+ C:/mingw64/x86_64-w64-mingw32/include/afunix.h
+ C:/mingw64/x86_64-w64-mingw32/include/apiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/apisetcconv.h
+ C:/mingw64/x86_64-w64-mingw32/include/basetsd.h
+ C:/mingw64/x86_64-w64-mingw32/include/bcrypt.h
+ C:/mingw64/x86_64-w64-mingw32/include/bemapiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/cderr.h
+ C:/mingw64/x86_64-w64-mingw32/include/cguid.h
+ C:/mingw64/x86_64-w64-mingw32/include/combaseapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/commdlg.h
+ C:/mingw64/x86_64-w64-mingw32/include/concurrencysal.h
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt.h
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt_startup.h
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt_stdio_config.h
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt_wstdlib.h
+ C:/mingw64/x86_64-w64-mingw32/include/crtdefs.h
+ C:/mingw64/x86_64-w64-mingw32/include/ctype.h
+ C:/mingw64/x86_64-w64-mingw32/include/datetimeapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/dde.h
+ C:/mingw64/x86_64-w64-mingw32/include/ddeml.h
+ C:/mingw64/x86_64-w64-mingw32/include/debugapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/dlgs.h
+ C:/mingw64/x86_64-w64-mingw32/include/dpapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/driverspecs.h
+ C:/mingw64/x86_64-w64-mingw32/include/errhandlingapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/errno.h
+ C:/mingw64/x86_64-w64-mingw32/include/excpt.h
+ C:/mingw64/x86_64-w64-mingw32/include/fibersapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/fileapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/fltwinerror.h
+ C:/mingw64/x86_64-w64-mingw32/include/getopt.h
+ C:/mingw64/x86_64-w64-mingw32/include/guiddef.h
+ C:/mingw64/x86_64-w64-mingw32/include/handleapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/heapapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/imm.h
+ C:/mingw64/x86_64-w64-mingw32/include/in6addr.h
+ C:/mingw64/x86_64-w64-mingw32/include/inaddr.h
+ C:/mingw64/x86_64-w64-mingw32/include/interlockedapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/io.h
+ C:/mingw64/x86_64-w64-mingw32/include/ioapiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/jobapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/joystickapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/ktmtypes.h
+ C:/mingw64/x86_64-w64-mingw32/include/libloaderapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/limits.h
+ C:/mingw64/x86_64-w64-mingw32/include/lzexpand.h
+ C:/mingw64/x86_64-w64-mingw32/include/malloc.h
+ C:/mingw64/x86_64-w64-mingw32/include/mciapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/mcx.h
+ C:/mingw64/x86_64-w64-mingw32/include/memoryapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/minwinbase.h
+ C:/mingw64/x86_64-w64-mingw32/include/minwindef.h
+ C:/mingw64/x86_64-w64-mingw32/include/mmeapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/mmiscapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/mmiscapi2.h
+ C:/mingw64/x86_64-w64-mingw32/include/mmsyscom.h
+ C:/mingw64/x86_64-w64-mingw32/include/mmsystem.h
+ C:/mingw64/x86_64-w64-mingw32/include/mstcpip.h
+ C:/mingw64/x86_64-w64-mingw32/include/msxml.h
+ C:/mingw64/x86_64-w64-mingw32/include/namedpipeapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/namespaceapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/nb30.h
+ C:/mingw64/x86_64-w64-mingw32/include/ncrypt.h
+ C:/mingw64/x86_64-w64-mingw32/include/oaidl.h
+ C:/mingw64/x86_64-w64-mingw32/include/objbase.h
+ C:/mingw64/x86_64-w64-mingw32/include/objidl.h
+ C:/mingw64/x86_64-w64-mingw32/include/objidlbase.h
+ C:/mingw64/x86_64-w64-mingw32/include/ole2.h
+ C:/mingw64/x86_64-w64-mingw32/include/oleauto.h
+ C:/mingw64/x86_64-w64-mingw32/include/oleidl.h
+ C:/mingw64/x86_64-w64-mingw32/include/playsoundapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/poppack.h
+ C:/mingw64/x86_64-w64-mingw32/include/process.h
+ C:/mingw64/x86_64-w64-mingw32/include/processenv.h
+ C:/mingw64/x86_64-w64-mingw32/include/processthreadsapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/processtopologyapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/profileapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/propidl.h
+ C:/mingw64/x86_64-w64-mingw32/include/prsht.h
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_fd_types.h
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ip_mreq1.h
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ip_types.h
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_socket_types.h
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ws1_undef.h
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_wsa_errnos.h
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_wsadata.h
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/intrin-impl.h
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack1.h
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack2.h
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack4.h
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack8.h
+ C:/mingw64/x86_64-w64-mingw32/include/pthread_time.h
+ C:/mingw64/x86_64-w64-mingw32/include/pthread_unistd.h
+ C:/mingw64/x86_64-w64-mingw32/include/qos.h
+ C:/mingw64/x86_64-w64-mingw32/include/realtimeapiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/reason.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpc.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpcasync.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpcdce.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpcdcep.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpcndr.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpcnsi.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpcnsip.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpcnterr.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpcsal.h
+ C:/mingw64/x86_64-w64-mingw32/include/sal.h
+ C:/mingw64/x86_64-w64-mingw32/include/sdkddkver.h
+ C:/mingw64/x86_64-w64-mingw32/include/sdks/_mingw_ddk.h
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/stdio_s.h
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/stdlib_s.h
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/stralign_s.h
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/string_s.h
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/sys/timeb_s.h
+ C:/mingw64/x86_64-w64-mingw32/include/securityappcontainer.h
+ C:/mingw64/x86_64-w64-mingw32/include/securitybaseapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/servprov.h
+ C:/mingw64/x86_64-w64-mingw32/include/shellapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/specstrings.h
+ C:/mingw64/x86_64-w64-mingw32/include/stdarg.h
+ C:/mingw64/x86_64-w64-mingw32/include/stddef.h
+ C:/mingw64/x86_64-w64-mingw32/include/stdint.h
+ C:/mingw64/x86_64-w64-mingw32/include/stdio.h
+ C:/mingw64/x86_64-w64-mingw32/include/stdlib.h
+ C:/mingw64/x86_64-w64-mingw32/include/stralign.h
+ C:/mingw64/x86_64-w64-mingw32/include/string.h
+ C:/mingw64/x86_64-w64-mingw32/include/stringapiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/swprintf.inl
+ C:/mingw64/x86_64-w64-mingw32/include/synchapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/sys/timeb.h
+ C:/mingw64/x86_64-w64-mingw32/include/sys/types.h
+ C:/mingw64/x86_64-w64-mingw32/include/sysinfoapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/systemtopologyapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/threadpoolapiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/threadpoollegacyapiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/time.h
+ C:/mingw64/x86_64-w64-mingw32/include/timeapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/timezoneapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/tvout.h
+ C:/mingw64/x86_64-w64-mingw32/include/unistd.h
+ C:/mingw64/x86_64-w64-mingw32/include/unknwn.h
+ C:/mingw64/x86_64-w64-mingw32/include/unknwnbase.h
+ C:/mingw64/x86_64-w64-mingw32/include/urlmon.h
+ C:/mingw64/x86_64-w64-mingw32/include/utilapiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/vadefs.h
+ C:/mingw64/x86_64-w64-mingw32/include/virtdisk.h
+ C:/mingw64/x86_64-w64-mingw32/include/winapifamily.h
+ C:/mingw64/x86_64-w64-mingw32/include/winbase.h
+ C:/mingw64/x86_64-w64-mingw32/include/wincon.h
+ C:/mingw64/x86_64-w64-mingw32/include/wincrypt.h
+ C:/mingw64/x86_64-w64-mingw32/include/windef.h
+ C:/mingw64/x86_64-w64-mingw32/include/windows.h
+ C:/mingw64/x86_64-w64-mingw32/include/winefs.h
+ C:/mingw64/x86_64-w64-mingw32/include/winerror.h
+ C:/mingw64/x86_64-w64-mingw32/include/wingdi.h
+ C:/mingw64/x86_64-w64-mingw32/include/winioctl.h
+ C:/mingw64/x86_64-w64-mingw32/include/winnetwk.h
+ C:/mingw64/x86_64-w64-mingw32/include/winnls.h
+ C:/mingw64/x86_64-w64-mingw32/include/winnt.h
+ C:/mingw64/x86_64-w64-mingw32/include/winperf.h
+ C:/mingw64/x86_64-w64-mingw32/include/winreg.h
+ C:/mingw64/x86_64-w64-mingw32/include/winscard.h
+ C:/mingw64/x86_64-w64-mingw32/include/winsmcrd.h
+ C:/mingw64/x86_64-w64-mingw32/include/winsock.h
+ C:/mingw64/x86_64-w64-mingw32/include/winsock2.h
+ C:/mingw64/x86_64-w64-mingw32/include/winspool.h
+ C:/mingw64/x86_64-w64-mingw32/include/winsvc.h
+ C:/mingw64/x86_64-w64-mingw32/include/winuser.h
+ C:/mingw64/x86_64-w64-mingw32/include/winver.h
+ C:/mingw64/x86_64-w64-mingw32/include/wnnc.h
+ C:/mingw64/x86_64-w64-mingw32/include/wow64apiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/ws2def.h
+ C:/mingw64/x86_64-w64-mingw32/include/ws2ipdef.h
+ C:/mingw64/x86_64-w64-mingw32/include/ws2tcpip.h
+ C:/mingw64/x86_64-w64-mingw32/include/wtypes.h
+ C:/mingw64/x86_64-w64-mingw32/include/wtypesbase.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls1_3.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_client_recv.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_client_send.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_keys_calc.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_logger.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_octads.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_sal.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_sockets.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_x509.h
+
+CMakeFiles/tiitls.dir/lib/tls_logger.cpp.obj
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/lib/tls_logger.cpp
+ C:/mingw64/include/c++/13.2.0/bits/std_abs.h
+ C:/mingw64/include/c++/13.2.0/cstdlib
+ C:/mingw64/include/c++/13.2.0/pstl/pstl_config.h
+ C:/mingw64/include/c++/13.2.0/stdlib.h
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/c++config.h
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/cpu_defines.h
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/os_defines.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/adxintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/ammintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxbf16intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxcomplexintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxfp16intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxint8intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxtileintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx2intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx5124fmapsintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx5124vnniwintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bf16intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bf16vlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bitalgintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bwintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512cdintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512dqintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512erintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fp16intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fp16vlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512ifmaintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512ifmavlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512pfintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmi2intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmi2vlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmiintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmivlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vlbwintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vldqintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vnniintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vnnivlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vp2intersectintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vp2intersectvlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vpopcntdqintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vpopcntdqvlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxifmaintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxneconvertintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxvnniint8intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxvnniintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/bmi2intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/bmiintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cetintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cldemoteintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clflushoptintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clwbintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clzerointrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cmpccxaddintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/emmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/enqcmdintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/f16cintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fma4intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fmaintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fxsrintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/gfniintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/hresetintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/ia32intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/immintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/keylockerintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/limits.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/lwpintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/lzcntintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mm3dnow.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mm_malloc.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/movdirintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mwaitintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mwaitxintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pconfigintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pkuintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pmmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/popcntintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/prfchiintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/prfchwintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/raointintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/rdseedintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/rtmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/serializeintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/sgxintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/shaintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/smmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stdarg.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stddef.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stdint.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/syslimits.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tbmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tmmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tsxldtrkintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/uintrintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/vaesintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/vpclmulqdqintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/waitpkgintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/wbnoinvdintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/wmmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/x86gprintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/x86intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xmmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xopintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsavecintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsaveintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsaveoptintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsavesintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xtestintrin.h
+ C:/mingw64/x86_64-w64-mingw32/include/_bsd_types.h
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw.h
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_mac.h
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_off_t.h
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_secapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_stdarg.h
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_unicode.h
+ C:/mingw64/x86_64-w64-mingw32/include/_timeval.h
+ C:/mingw64/x86_64-w64-mingw32/include/afunix.h
+ C:/mingw64/x86_64-w64-mingw32/include/apiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/apisetcconv.h
+ C:/mingw64/x86_64-w64-mingw32/include/basetsd.h
+ C:/mingw64/x86_64-w64-mingw32/include/bcrypt.h
+ C:/mingw64/x86_64-w64-mingw32/include/bemapiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/cderr.h
+ C:/mingw64/x86_64-w64-mingw32/include/cguid.h
+ C:/mingw64/x86_64-w64-mingw32/include/combaseapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/commdlg.h
+ C:/mingw64/x86_64-w64-mingw32/include/concurrencysal.h
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt.h
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt_startup.h
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt_stdio_config.h
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt_wstdlib.h
+ C:/mingw64/x86_64-w64-mingw32/include/crtdefs.h
+ C:/mingw64/x86_64-w64-mingw32/include/ctype.h
+ C:/mingw64/x86_64-w64-mingw32/include/datetimeapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/dde.h
+ C:/mingw64/x86_64-w64-mingw32/include/ddeml.h
+ C:/mingw64/x86_64-w64-mingw32/include/debugapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/dlgs.h
+ C:/mingw64/x86_64-w64-mingw32/include/dpapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/driverspecs.h
+ C:/mingw64/x86_64-w64-mingw32/include/errhandlingapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/errno.h
+ C:/mingw64/x86_64-w64-mingw32/include/excpt.h
+ C:/mingw64/x86_64-w64-mingw32/include/fibersapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/fileapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/fltwinerror.h
+ C:/mingw64/x86_64-w64-mingw32/include/getopt.h
+ C:/mingw64/x86_64-w64-mingw32/include/guiddef.h
+ C:/mingw64/x86_64-w64-mingw32/include/handleapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/heapapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/imm.h
+ C:/mingw64/x86_64-w64-mingw32/include/in6addr.h
+ C:/mingw64/x86_64-w64-mingw32/include/inaddr.h
+ C:/mingw64/x86_64-w64-mingw32/include/interlockedapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/io.h
+ C:/mingw64/x86_64-w64-mingw32/include/ioapiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/jobapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/joystickapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/ktmtypes.h
+ C:/mingw64/x86_64-w64-mingw32/include/libloaderapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/limits.h
+ C:/mingw64/x86_64-w64-mingw32/include/lzexpand.h
+ C:/mingw64/x86_64-w64-mingw32/include/malloc.h
+ C:/mingw64/x86_64-w64-mingw32/include/mciapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/mcx.h
+ C:/mingw64/x86_64-w64-mingw32/include/memoryapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/minwinbase.h
+ C:/mingw64/x86_64-w64-mingw32/include/minwindef.h
+ C:/mingw64/x86_64-w64-mingw32/include/mmeapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/mmiscapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/mmiscapi2.h
+ C:/mingw64/x86_64-w64-mingw32/include/mmsyscom.h
+ C:/mingw64/x86_64-w64-mingw32/include/mmsystem.h
+ C:/mingw64/x86_64-w64-mingw32/include/mstcpip.h
+ C:/mingw64/x86_64-w64-mingw32/include/msxml.h
+ C:/mingw64/x86_64-w64-mingw32/include/namedpipeapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/namespaceapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/nb30.h
+ C:/mingw64/x86_64-w64-mingw32/include/ncrypt.h
+ C:/mingw64/x86_64-w64-mingw32/include/oaidl.h
+ C:/mingw64/x86_64-w64-mingw32/include/objbase.h
+ C:/mingw64/x86_64-w64-mingw32/include/objidl.h
+ C:/mingw64/x86_64-w64-mingw32/include/objidlbase.h
+ C:/mingw64/x86_64-w64-mingw32/include/ole2.h
+ C:/mingw64/x86_64-w64-mingw32/include/oleauto.h
+ C:/mingw64/x86_64-w64-mingw32/include/oleidl.h
+ C:/mingw64/x86_64-w64-mingw32/include/playsoundapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/poppack.h
+ C:/mingw64/x86_64-w64-mingw32/include/process.h
+ C:/mingw64/x86_64-w64-mingw32/include/processenv.h
+ C:/mingw64/x86_64-w64-mingw32/include/processthreadsapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/processtopologyapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/profileapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/propidl.h
+ C:/mingw64/x86_64-w64-mingw32/include/prsht.h
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_fd_types.h
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ip_mreq1.h
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ip_types.h
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_socket_types.h
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ws1_undef.h
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_wsa_errnos.h
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_wsadata.h
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/intrin-impl.h
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack1.h
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack2.h
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack4.h
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack8.h
+ C:/mingw64/x86_64-w64-mingw32/include/pthread_time.h
+ C:/mingw64/x86_64-w64-mingw32/include/pthread_unistd.h
+ C:/mingw64/x86_64-w64-mingw32/include/qos.h
+ C:/mingw64/x86_64-w64-mingw32/include/realtimeapiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/reason.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpc.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpcasync.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpcdce.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpcdcep.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpcndr.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpcnsi.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpcnsip.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpcnterr.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpcsal.h
+ C:/mingw64/x86_64-w64-mingw32/include/sal.h
+ C:/mingw64/x86_64-w64-mingw32/include/sdkddkver.h
+ C:/mingw64/x86_64-w64-mingw32/include/sdks/_mingw_ddk.h
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/stdio_s.h
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/stdlib_s.h
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/stralign_s.h
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/string_s.h
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/sys/timeb_s.h
+ C:/mingw64/x86_64-w64-mingw32/include/securityappcontainer.h
+ C:/mingw64/x86_64-w64-mingw32/include/securitybaseapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/servprov.h
+ C:/mingw64/x86_64-w64-mingw32/include/shellapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/specstrings.h
+ C:/mingw64/x86_64-w64-mingw32/include/stdarg.h
+ C:/mingw64/x86_64-w64-mingw32/include/stddef.h
+ C:/mingw64/x86_64-w64-mingw32/include/stdint.h
+ C:/mingw64/x86_64-w64-mingw32/include/stdio.h
+ C:/mingw64/x86_64-w64-mingw32/include/stdlib.h
+ C:/mingw64/x86_64-w64-mingw32/include/stralign.h
+ C:/mingw64/x86_64-w64-mingw32/include/string.h
+ C:/mingw64/x86_64-w64-mingw32/include/stringapiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/swprintf.inl
+ C:/mingw64/x86_64-w64-mingw32/include/synchapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/sys/timeb.h
+ C:/mingw64/x86_64-w64-mingw32/include/sys/types.h
+ C:/mingw64/x86_64-w64-mingw32/include/sysinfoapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/systemtopologyapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/threadpoolapiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/threadpoollegacyapiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/time.h
+ C:/mingw64/x86_64-w64-mingw32/include/timeapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/timezoneapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/tvout.h
+ C:/mingw64/x86_64-w64-mingw32/include/unistd.h
+ C:/mingw64/x86_64-w64-mingw32/include/unknwn.h
+ C:/mingw64/x86_64-w64-mingw32/include/unknwnbase.h
+ C:/mingw64/x86_64-w64-mingw32/include/urlmon.h
+ C:/mingw64/x86_64-w64-mingw32/include/utilapiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/vadefs.h
+ C:/mingw64/x86_64-w64-mingw32/include/virtdisk.h
+ C:/mingw64/x86_64-w64-mingw32/include/winapifamily.h
+ C:/mingw64/x86_64-w64-mingw32/include/winbase.h
+ C:/mingw64/x86_64-w64-mingw32/include/wincon.h
+ C:/mingw64/x86_64-w64-mingw32/include/wincrypt.h
+ C:/mingw64/x86_64-w64-mingw32/include/windef.h
+ C:/mingw64/x86_64-w64-mingw32/include/windows.h
+ C:/mingw64/x86_64-w64-mingw32/include/winefs.h
+ C:/mingw64/x86_64-w64-mingw32/include/winerror.h
+ C:/mingw64/x86_64-w64-mingw32/include/wingdi.h
+ C:/mingw64/x86_64-w64-mingw32/include/winioctl.h
+ C:/mingw64/x86_64-w64-mingw32/include/winnetwk.h
+ C:/mingw64/x86_64-w64-mingw32/include/winnls.h
+ C:/mingw64/x86_64-w64-mingw32/include/winnt.h
+ C:/mingw64/x86_64-w64-mingw32/include/winperf.h
+ C:/mingw64/x86_64-w64-mingw32/include/winreg.h
+ C:/mingw64/x86_64-w64-mingw32/include/winscard.h
+ C:/mingw64/x86_64-w64-mingw32/include/winsmcrd.h
+ C:/mingw64/x86_64-w64-mingw32/include/winsock.h
+ C:/mingw64/x86_64-w64-mingw32/include/winsock2.h
+ C:/mingw64/x86_64-w64-mingw32/include/winspool.h
+ C:/mingw64/x86_64-w64-mingw32/include/winsvc.h
+ C:/mingw64/x86_64-w64-mingw32/include/winuser.h
+ C:/mingw64/x86_64-w64-mingw32/include/winver.h
+ C:/mingw64/x86_64-w64-mingw32/include/wnnc.h
+ C:/mingw64/x86_64-w64-mingw32/include/wow64apiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/ws2def.h
+ C:/mingw64/x86_64-w64-mingw32/include/ws2ipdef.h
+ C:/mingw64/x86_64-w64-mingw32/include/ws2tcpip.h
+ C:/mingw64/x86_64-w64-mingw32/include/wtypes.h
+ C:/mingw64/x86_64-w64-mingw32/include/wtypesbase.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls1_3.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_logger.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_octads.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_sockets.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_x509.h
+
+CMakeFiles/tiitls.dir/lib/tls_octads.cpp.obj
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/lib/tls_octads.cpp
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stddef.h
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw.h
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_mac.h
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_secapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/_timeval.h
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt.h
+ C:/mingw64/x86_64-w64-mingw32/include/crtdefs.h
+ C:/mingw64/x86_64-w64-mingw32/include/pthread_time.h
+ C:/mingw64/x86_64-w64-mingw32/include/sdks/_mingw_ddk.h
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/sys/timeb_s.h
+ C:/mingw64/x86_64-w64-mingw32/include/stddef.h
+ C:/mingw64/x86_64-w64-mingw32/include/sys/time.h
+ C:/mingw64/x86_64-w64-mingw32/include/sys/timeb.h
+ C:/mingw64/x86_64-w64-mingw32/include/time.h
+ C:/mingw64/x86_64-w64-mingw32/include/vadefs.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_octads.h
+
+CMakeFiles/tiitls.dir/lib/tls_protocol.cpp.obj
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/lib/tls_protocol.cpp
+ C:/mingw64/include/c++/13.2.0/bits/std_abs.h
+ C:/mingw64/include/c++/13.2.0/cstdlib
+ C:/mingw64/include/c++/13.2.0/pstl/pstl_config.h
+ C:/mingw64/include/c++/13.2.0/stdlib.h
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/c++config.h
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/cpu_defines.h
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/os_defines.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/adxintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/ammintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxbf16intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxcomplexintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxfp16intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxint8intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxtileintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx2intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx5124fmapsintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx5124vnniwintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bf16intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bf16vlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bitalgintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bwintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512cdintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512dqintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512erintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fp16intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fp16vlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512ifmaintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512ifmavlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512pfintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmi2intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmi2vlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmiintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmivlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vlbwintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vldqintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vnniintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vnnivlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vp2intersectintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vp2intersectvlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vpopcntdqintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vpopcntdqvlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxifmaintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxneconvertintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxvnniint8intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxvnniintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/bmi2intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/bmiintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cetintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cldemoteintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clflushoptintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clwbintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clzerointrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cmpccxaddintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/emmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/enqcmdintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/f16cintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fma4intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fmaintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fxsrintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/gfniintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/hresetintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/ia32intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/immintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/keylockerintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/limits.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/lwpintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/lzcntintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mm3dnow.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mm_malloc.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/movdirintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mwaitintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mwaitxintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pconfigintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pkuintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pmmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/popcntintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/prfchiintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/prfchwintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/raointintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/rdseedintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/rtmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/serializeintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/sgxintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/shaintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/smmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stdarg.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stddef.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stdint.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/syslimits.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tbmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tmmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tsxldtrkintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/uintrintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/vaesintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/vpclmulqdqintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/waitpkgintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/wbnoinvdintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/wmmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/x86gprintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/x86intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xmmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xopintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsavecintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsaveintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsaveoptintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsavesintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xtestintrin.h
+ C:/mingw64/x86_64-w64-mingw32/include/_bsd_types.h
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw.h
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_mac.h
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_off_t.h
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_secapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_stdarg.h
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_unicode.h
+ C:/mingw64/x86_64-w64-mingw32/include/_timeval.h
+ C:/mingw64/x86_64-w64-mingw32/include/afunix.h
+ C:/mingw64/x86_64-w64-mingw32/include/apiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/apisetcconv.h
+ C:/mingw64/x86_64-w64-mingw32/include/basetsd.h
+ C:/mingw64/x86_64-w64-mingw32/include/bcrypt.h
+ C:/mingw64/x86_64-w64-mingw32/include/bemapiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/cderr.h
+ C:/mingw64/x86_64-w64-mingw32/include/cguid.h
+ C:/mingw64/x86_64-w64-mingw32/include/combaseapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/commdlg.h
+ C:/mingw64/x86_64-w64-mingw32/include/concurrencysal.h
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt.h
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt_startup.h
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt_stdio_config.h
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt_wstdlib.h
+ C:/mingw64/x86_64-w64-mingw32/include/crtdefs.h
+ C:/mingw64/x86_64-w64-mingw32/include/ctype.h
+ C:/mingw64/x86_64-w64-mingw32/include/datetimeapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/dde.h
+ C:/mingw64/x86_64-w64-mingw32/include/ddeml.h
+ C:/mingw64/x86_64-w64-mingw32/include/debugapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/dlgs.h
+ C:/mingw64/x86_64-w64-mingw32/include/dpapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/driverspecs.h
+ C:/mingw64/x86_64-w64-mingw32/include/errhandlingapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/errno.h
+ C:/mingw64/x86_64-w64-mingw32/include/excpt.h
+ C:/mingw64/x86_64-w64-mingw32/include/fibersapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/fileapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/fltwinerror.h
+ C:/mingw64/x86_64-w64-mingw32/include/getopt.h
+ C:/mingw64/x86_64-w64-mingw32/include/guiddef.h
+ C:/mingw64/x86_64-w64-mingw32/include/handleapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/heapapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/imm.h
+ C:/mingw64/x86_64-w64-mingw32/include/in6addr.h
+ C:/mingw64/x86_64-w64-mingw32/include/inaddr.h
+ C:/mingw64/x86_64-w64-mingw32/include/interlockedapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/io.h
+ C:/mingw64/x86_64-w64-mingw32/include/ioapiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/jobapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/joystickapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/ktmtypes.h
+ C:/mingw64/x86_64-w64-mingw32/include/libloaderapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/limits.h
+ C:/mingw64/x86_64-w64-mingw32/include/lzexpand.h
+ C:/mingw64/x86_64-w64-mingw32/include/malloc.h
+ C:/mingw64/x86_64-w64-mingw32/include/mciapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/mcx.h
+ C:/mingw64/x86_64-w64-mingw32/include/memoryapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/minwinbase.h
+ C:/mingw64/x86_64-w64-mingw32/include/minwindef.h
+ C:/mingw64/x86_64-w64-mingw32/include/mmeapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/mmiscapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/mmiscapi2.h
+ C:/mingw64/x86_64-w64-mingw32/include/mmsyscom.h
+ C:/mingw64/x86_64-w64-mingw32/include/mmsystem.h
+ C:/mingw64/x86_64-w64-mingw32/include/mstcpip.h
+ C:/mingw64/x86_64-w64-mingw32/include/msxml.h
+ C:/mingw64/x86_64-w64-mingw32/include/namedpipeapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/namespaceapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/nb30.h
+ C:/mingw64/x86_64-w64-mingw32/include/ncrypt.h
+ C:/mingw64/x86_64-w64-mingw32/include/oaidl.h
+ C:/mingw64/x86_64-w64-mingw32/include/objbase.h
+ C:/mingw64/x86_64-w64-mingw32/include/objidl.h
+ C:/mingw64/x86_64-w64-mingw32/include/objidlbase.h
+ C:/mingw64/x86_64-w64-mingw32/include/ole2.h
+ C:/mingw64/x86_64-w64-mingw32/include/oleauto.h
+ C:/mingw64/x86_64-w64-mingw32/include/oleidl.h
+ C:/mingw64/x86_64-w64-mingw32/include/playsoundapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/poppack.h
+ C:/mingw64/x86_64-w64-mingw32/include/process.h
+ C:/mingw64/x86_64-w64-mingw32/include/processenv.h
+ C:/mingw64/x86_64-w64-mingw32/include/processthreadsapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/processtopologyapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/profileapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/propidl.h
+ C:/mingw64/x86_64-w64-mingw32/include/prsht.h
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_fd_types.h
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ip_mreq1.h
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ip_types.h
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_socket_types.h
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ws1_undef.h
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_wsa_errnos.h
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_wsadata.h
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/intrin-impl.h
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack1.h
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack2.h
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack4.h
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack8.h
+ C:/mingw64/x86_64-w64-mingw32/include/pthread_time.h
+ C:/mingw64/x86_64-w64-mingw32/include/pthread_unistd.h
+ C:/mingw64/x86_64-w64-mingw32/include/qos.h
+ C:/mingw64/x86_64-w64-mingw32/include/realtimeapiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/reason.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpc.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpcasync.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpcdce.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpcdcep.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpcndr.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpcnsi.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpcnsip.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpcnterr.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpcsal.h
+ C:/mingw64/x86_64-w64-mingw32/include/sal.h
+ C:/mingw64/x86_64-w64-mingw32/include/sdkddkver.h
+ C:/mingw64/x86_64-w64-mingw32/include/sdks/_mingw_ddk.h
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/stdio_s.h
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/stdlib_s.h
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/stralign_s.h
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/string_s.h
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/sys/timeb_s.h
+ C:/mingw64/x86_64-w64-mingw32/include/securityappcontainer.h
+ C:/mingw64/x86_64-w64-mingw32/include/securitybaseapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/servprov.h
+ C:/mingw64/x86_64-w64-mingw32/include/shellapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/specstrings.h
+ C:/mingw64/x86_64-w64-mingw32/include/stdarg.h
+ C:/mingw64/x86_64-w64-mingw32/include/stddef.h
+ C:/mingw64/x86_64-w64-mingw32/include/stdint.h
+ C:/mingw64/x86_64-w64-mingw32/include/stdio.h
+ C:/mingw64/x86_64-w64-mingw32/include/stdlib.h
+ C:/mingw64/x86_64-w64-mingw32/include/stralign.h
+ C:/mingw64/x86_64-w64-mingw32/include/string.h
+ C:/mingw64/x86_64-w64-mingw32/include/stringapiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/swprintf.inl
+ C:/mingw64/x86_64-w64-mingw32/include/synchapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/sys/timeb.h
+ C:/mingw64/x86_64-w64-mingw32/include/sys/types.h
+ C:/mingw64/x86_64-w64-mingw32/include/sysinfoapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/systemtopologyapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/threadpoolapiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/threadpoollegacyapiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/time.h
+ C:/mingw64/x86_64-w64-mingw32/include/timeapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/timezoneapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/tvout.h
+ C:/mingw64/x86_64-w64-mingw32/include/unistd.h
+ C:/mingw64/x86_64-w64-mingw32/include/unknwn.h
+ C:/mingw64/x86_64-w64-mingw32/include/unknwnbase.h
+ C:/mingw64/x86_64-w64-mingw32/include/urlmon.h
+ C:/mingw64/x86_64-w64-mingw32/include/utilapiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/vadefs.h
+ C:/mingw64/x86_64-w64-mingw32/include/virtdisk.h
+ C:/mingw64/x86_64-w64-mingw32/include/winapifamily.h
+ C:/mingw64/x86_64-w64-mingw32/include/winbase.h
+ C:/mingw64/x86_64-w64-mingw32/include/wincon.h
+ C:/mingw64/x86_64-w64-mingw32/include/wincrypt.h
+ C:/mingw64/x86_64-w64-mingw32/include/windef.h
+ C:/mingw64/x86_64-w64-mingw32/include/windows.h
+ C:/mingw64/x86_64-w64-mingw32/include/winefs.h
+ C:/mingw64/x86_64-w64-mingw32/include/winerror.h
+ C:/mingw64/x86_64-w64-mingw32/include/wingdi.h
+ C:/mingw64/x86_64-w64-mingw32/include/winioctl.h
+ C:/mingw64/x86_64-w64-mingw32/include/winnetwk.h
+ C:/mingw64/x86_64-w64-mingw32/include/winnls.h
+ C:/mingw64/x86_64-w64-mingw32/include/winnt.h
+ C:/mingw64/x86_64-w64-mingw32/include/winperf.h
+ C:/mingw64/x86_64-w64-mingw32/include/winreg.h
+ C:/mingw64/x86_64-w64-mingw32/include/winscard.h
+ C:/mingw64/x86_64-w64-mingw32/include/winsmcrd.h
+ C:/mingw64/x86_64-w64-mingw32/include/winsock.h
+ C:/mingw64/x86_64-w64-mingw32/include/winsock2.h
+ C:/mingw64/x86_64-w64-mingw32/include/winspool.h
+ C:/mingw64/x86_64-w64-mingw32/include/winsvc.h
+ C:/mingw64/x86_64-w64-mingw32/include/winuser.h
+ C:/mingw64/x86_64-w64-mingw32/include/winver.h
+ C:/mingw64/x86_64-w64-mingw32/include/wnnc.h
+ C:/mingw64/x86_64-w64-mingw32/include/wow64apiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/ws2def.h
+ C:/mingw64/x86_64-w64-mingw32/include/ws2ipdef.h
+ C:/mingw64/x86_64-w64-mingw32/include/ws2tcpip.h
+ C:/mingw64/x86_64-w64-mingw32/include/wtypes.h
+ C:/mingw64/x86_64-w64-mingw32/include/wtypesbase.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls1_3.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_cert_chain.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_certs.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_client_recv.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_client_send.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_keys_calc.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_logger.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_octads.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_protocol.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_sal.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_sockets.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_tickets.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_x509.h
+
+CMakeFiles/tiitls.dir/lib/tls_sal.cpp.obj
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/lib/tls_sal.cpp
+ C:/mingw64/include/c++/13.2.0/bits/std_abs.h
+ C:/mingw64/include/c++/13.2.0/cstdlib
+ C:/mingw64/include/c++/13.2.0/pstl/pstl_config.h
+ C:/mingw64/include/c++/13.2.0/stdlib.h
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/c++config.h
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/cpu_defines.h
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/os_defines.h
+ C:/mingw64/include/oqs/common.h
+ C:/mingw64/include/oqs/kem.h
+ C:/mingw64/include/oqs/kem_classic_mceliece.h
+ C:/mingw64/include/oqs/kem_frodokem.h
+ C:/mingw64/include/oqs/kem_hqc.h
+ C:/mingw64/include/oqs/kem_kyber.h
+ C:/mingw64/include/oqs/kem_ml_kem.h
+ C:/mingw64/include/oqs/kem_ntruprime.h
+ C:/mingw64/include/oqs/oqs.h
+ C:/mingw64/include/oqs/oqsconfig.h
+ C:/mingw64/include/oqs/rand.h
+ C:/mingw64/include/oqs/sig.h
+ C:/mingw64/include/oqs/sig_dilithium.h
+ C:/mingw64/include/oqs/sig_falcon.h
+ C:/mingw64/include/oqs/sig_ml_dsa.h
+ C:/mingw64/include/oqs/sig_sphincs.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/adxintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/ammintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxbf16intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxcomplexintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxfp16intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxint8intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxtileintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx2intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx5124fmapsintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx5124vnniwintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bf16intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bf16vlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bitalgintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bwintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512cdintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512dqintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512erintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fp16intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fp16vlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512ifmaintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512ifmavlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512pfintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmi2intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmi2vlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmiintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmivlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vlbwintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vldqintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vnniintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vnnivlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vp2intersectintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vp2intersectvlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vpopcntdqintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vpopcntdqvlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxifmaintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxneconvertintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxvnniint8intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxvnniintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/bmi2intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/bmiintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cetintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cldemoteintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clflushoptintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clwbintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clzerointrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cmpccxaddintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/emmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/enqcmdintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/f16cintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fma4intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fmaintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fxsrintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/gfniintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/hresetintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/ia32intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/immintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/keylockerintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/limits.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/lwpintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/lzcntintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mm3dnow.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mm_malloc.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/movdirintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mwaitintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mwaitxintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pconfigintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pkuintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pmmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/popcntintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/prfchiintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/prfchwintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/raointintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/rdseedintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/rtmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/serializeintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/sgxintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/shaintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/smmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stdarg.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stdbool.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stddef.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stdint.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/syslimits.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tbmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tmmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tsxldtrkintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/uintrintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/vaesintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/vpclmulqdqintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/waitpkgintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/wbnoinvdintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/wmmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/x86gprintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/x86intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xmmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xopintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsavecintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsaveintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsaveoptintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsavesintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xtestintrin.h
+ C:/mingw64/x86_64-w64-mingw32/include/_bsd_types.h
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw.h
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_mac.h
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_off_t.h
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_secapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_stdarg.h
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_unicode.h
+ C:/mingw64/x86_64-w64-mingw32/include/_timeval.h
+ C:/mingw64/x86_64-w64-mingw32/include/afunix.h
+ C:/mingw64/x86_64-w64-mingw32/include/apiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/apisetcconv.h
+ C:/mingw64/x86_64-w64-mingw32/include/basetsd.h
+ C:/mingw64/x86_64-w64-mingw32/include/bcrypt.h
+ C:/mingw64/x86_64-w64-mingw32/include/bemapiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/cderr.h
+ C:/mingw64/x86_64-w64-mingw32/include/cguid.h
+ C:/mingw64/x86_64-w64-mingw32/include/combaseapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/commdlg.h
+ C:/mingw64/x86_64-w64-mingw32/include/concurrencysal.h
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt.h
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt_startup.h
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt_stdio_config.h
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt_wstdlib.h
+ C:/mingw64/x86_64-w64-mingw32/include/crtdefs.h
+ C:/mingw64/x86_64-w64-mingw32/include/ctype.h
+ C:/mingw64/x86_64-w64-mingw32/include/datetimeapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/dde.h
+ C:/mingw64/x86_64-w64-mingw32/include/ddeml.h
+ C:/mingw64/x86_64-w64-mingw32/include/debugapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/dlgs.h
+ C:/mingw64/x86_64-w64-mingw32/include/dpapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/driverspecs.h
+ C:/mingw64/x86_64-w64-mingw32/include/errhandlingapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/errno.h
+ C:/mingw64/x86_64-w64-mingw32/include/excpt.h
+ C:/mingw64/x86_64-w64-mingw32/include/fibersapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/fileapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/fltwinerror.h
+ C:/mingw64/x86_64-w64-mingw32/include/getopt.h
+ C:/mingw64/x86_64-w64-mingw32/include/guiddef.h
+ C:/mingw64/x86_64-w64-mingw32/include/handleapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/heapapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/imm.h
+ C:/mingw64/x86_64-w64-mingw32/include/in6addr.h
+ C:/mingw64/x86_64-w64-mingw32/include/inaddr.h
+ C:/mingw64/x86_64-w64-mingw32/include/interlockedapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/inttypes.h
+ C:/mingw64/x86_64-w64-mingw32/include/io.h
+ C:/mingw64/x86_64-w64-mingw32/include/ioapiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/jobapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/joystickapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/ktmtypes.h
+ C:/mingw64/x86_64-w64-mingw32/include/libloaderapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/limits.h
+ C:/mingw64/x86_64-w64-mingw32/include/lzexpand.h
+ C:/mingw64/x86_64-w64-mingw32/include/malloc.h
+ C:/mingw64/x86_64-w64-mingw32/include/mciapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/mcx.h
+ C:/mingw64/x86_64-w64-mingw32/include/memoryapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/minwinbase.h
+ C:/mingw64/x86_64-w64-mingw32/include/minwindef.h
+ C:/mingw64/x86_64-w64-mingw32/include/mmeapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/mmiscapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/mmiscapi2.h
+ C:/mingw64/x86_64-w64-mingw32/include/mmsyscom.h
+ C:/mingw64/x86_64-w64-mingw32/include/mmsystem.h
+ C:/mingw64/x86_64-w64-mingw32/include/mstcpip.h
+ C:/mingw64/x86_64-w64-mingw32/include/msxml.h
+ C:/mingw64/x86_64-w64-mingw32/include/namedpipeapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/namespaceapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/nb30.h
+ C:/mingw64/x86_64-w64-mingw32/include/ncrypt.h
+ C:/mingw64/x86_64-w64-mingw32/include/oaidl.h
+ C:/mingw64/x86_64-w64-mingw32/include/objbase.h
+ C:/mingw64/x86_64-w64-mingw32/include/objidl.h
+ C:/mingw64/x86_64-w64-mingw32/include/objidlbase.h
+ C:/mingw64/x86_64-w64-mingw32/include/ole2.h
+ C:/mingw64/x86_64-w64-mingw32/include/oleauto.h
+ C:/mingw64/x86_64-w64-mingw32/include/oleidl.h
+ C:/mingw64/x86_64-w64-mingw32/include/playsoundapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/poppack.h
+ C:/mingw64/x86_64-w64-mingw32/include/process.h
+ C:/mingw64/x86_64-w64-mingw32/include/processenv.h
+ C:/mingw64/x86_64-w64-mingw32/include/processthreadsapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/processtopologyapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/profileapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/propidl.h
+ C:/mingw64/x86_64-w64-mingw32/include/prsht.h
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_fd_types.h
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ip_mreq1.h
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ip_types.h
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_socket_types.h
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ws1_undef.h
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_wsa_errnos.h
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_wsadata.h
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/intrin-impl.h
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack1.h
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack2.h
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack4.h
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack8.h
+ C:/mingw64/x86_64-w64-mingw32/include/pthread_time.h
+ C:/mingw64/x86_64-w64-mingw32/include/pthread_unistd.h
+ C:/mingw64/x86_64-w64-mingw32/include/qos.h
+ C:/mingw64/x86_64-w64-mingw32/include/realtimeapiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/reason.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpc.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpcasync.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpcdce.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpcdcep.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpcndr.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpcnsi.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpcnsip.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpcnterr.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpcsal.h
+ C:/mingw64/x86_64-w64-mingw32/include/sal.h
+ C:/mingw64/x86_64-w64-mingw32/include/sdkddkver.h
+ C:/mingw64/x86_64-w64-mingw32/include/sdks/_mingw_ddk.h
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/stdio_s.h
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/stdlib_s.h
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/stralign_s.h
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/string_s.h
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/sys/timeb_s.h
+ C:/mingw64/x86_64-w64-mingw32/include/securityappcontainer.h
+ C:/mingw64/x86_64-w64-mingw32/include/securitybaseapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/servprov.h
+ C:/mingw64/x86_64-w64-mingw32/include/shellapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/specstrings.h
+ C:/mingw64/x86_64-w64-mingw32/include/stdarg.h
+ C:/mingw64/x86_64-w64-mingw32/include/stddef.h
+ C:/mingw64/x86_64-w64-mingw32/include/stdint.h
+ C:/mingw64/x86_64-w64-mingw32/include/stdio.h
+ C:/mingw64/x86_64-w64-mingw32/include/stdlib.h
+ C:/mingw64/x86_64-w64-mingw32/include/stralign.h
+ C:/mingw64/x86_64-w64-mingw32/include/string.h
+ C:/mingw64/x86_64-w64-mingw32/include/stringapiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/swprintf.inl
+ C:/mingw64/x86_64-w64-mingw32/include/synchapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/sys/timeb.h
+ C:/mingw64/x86_64-w64-mingw32/include/sys/types.h
+ C:/mingw64/x86_64-w64-mingw32/include/sysinfoapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/systemtopologyapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/threadpoolapiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/threadpoollegacyapiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/time.h
+ C:/mingw64/x86_64-w64-mingw32/include/timeapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/timezoneapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/tvout.h
+ C:/mingw64/x86_64-w64-mingw32/include/unistd.h
+ C:/mingw64/x86_64-w64-mingw32/include/unknwn.h
+ C:/mingw64/x86_64-w64-mingw32/include/unknwnbase.h
+ C:/mingw64/x86_64-w64-mingw32/include/urlmon.h
+ C:/mingw64/x86_64-w64-mingw32/include/utilapiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/vadefs.h
+ C:/mingw64/x86_64-w64-mingw32/include/virtdisk.h
+ C:/mingw64/x86_64-w64-mingw32/include/winapifamily.h
+ C:/mingw64/x86_64-w64-mingw32/include/winbase.h
+ C:/mingw64/x86_64-w64-mingw32/include/wincon.h
+ C:/mingw64/x86_64-w64-mingw32/include/wincrypt.h
+ C:/mingw64/x86_64-w64-mingw32/include/windef.h
+ C:/mingw64/x86_64-w64-mingw32/include/windows.h
+ C:/mingw64/x86_64-w64-mingw32/include/winefs.h
+ C:/mingw64/x86_64-w64-mingw32/include/winerror.h
+ C:/mingw64/x86_64-w64-mingw32/include/wingdi.h
+ C:/mingw64/x86_64-w64-mingw32/include/winioctl.h
+ C:/mingw64/x86_64-w64-mingw32/include/winnetwk.h
+ C:/mingw64/x86_64-w64-mingw32/include/winnls.h
+ C:/mingw64/x86_64-w64-mingw32/include/winnt.h
+ C:/mingw64/x86_64-w64-mingw32/include/winperf.h
+ C:/mingw64/x86_64-w64-mingw32/include/winreg.h
+ C:/mingw64/x86_64-w64-mingw32/include/winscard.h
+ C:/mingw64/x86_64-w64-mingw32/include/winsmcrd.h
+ C:/mingw64/x86_64-w64-mingw32/include/winsock.h
+ C:/mingw64/x86_64-w64-mingw32/include/winsock2.h
+ C:/mingw64/x86_64-w64-mingw32/include/winspool.h
+ C:/mingw64/x86_64-w64-mingw32/include/winsvc.h
+ C:/mingw64/x86_64-w64-mingw32/include/winuser.h
+ C:/mingw64/x86_64-w64-mingw32/include/winver.h
+ C:/mingw64/x86_64-w64-mingw32/include/wnnc.h
+ C:/mingw64/x86_64-w64-mingw32/include/wow64apiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/ws2def.h
+ C:/mingw64/x86_64-w64-mingw32/include/ws2ipdef.h
+ C:/mingw64/x86_64-w64-mingw32/include/ws2tcpip.h
+ C:/mingw64/x86_64-w64-mingw32/include/wtypes.h
+ C:/mingw64/x86_64-w64-mingw32/include/wtypesbase.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls1_3.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_octads.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_sal.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_sockets.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/arch.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/big_B256_56.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/big_B384_56.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/big_B448_58.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/big_B512_60.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/config_big_B256_56.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/config_big_B384_56.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/config_big_B448_58.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/config_big_B512_60.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/config_curve_C25519.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/config_curve_Ed25519.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/config_curve_Ed448.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/config_curve_NIST256.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/config_curve_NIST384.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/config_ff_RSA2048.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/config_ff_RSA4096.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/config_field_F25519.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/config_field_F448.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/config_field_NIST256.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/config_field_NIST384.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/core.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/ecdh_C25519.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/ecdh_NIST256.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/ecdh_NIST384.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/ecp_C25519.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/ecp_Ed25519.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/ecp_Ed448.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/ecp_NIST256.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/ecp_NIST384.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/eddsa_Ed25519.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/eddsa_Ed448.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/ff_RSA2048.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/ff_RSA4096.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/fp_F25519.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/fp_F448.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/fp_NIST256.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/fp_NIST384.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/rsa_RSA2048.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/rsa_RSA4096.h
+
+CMakeFiles/tiitls.dir/lib/tls_sockets.cpp.obj
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/lib/tls_sockets.cpp
+ C:/mingw64/include/c++/13.2.0/bits/std_abs.h
+ C:/mingw64/include/c++/13.2.0/cstdlib
+ C:/mingw64/include/c++/13.2.0/pstl/pstl_config.h
+ C:/mingw64/include/c++/13.2.0/stdlib.h
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/c++config.h
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/cpu_defines.h
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/os_defines.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/adxintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/ammintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxbf16intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxcomplexintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxfp16intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxint8intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxtileintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx2intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx5124fmapsintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx5124vnniwintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bf16intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bf16vlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bitalgintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bwintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512cdintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512dqintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512erintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fp16intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fp16vlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512ifmaintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512ifmavlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512pfintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmi2intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmi2vlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmiintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmivlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vlbwintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vldqintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vnniintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vnnivlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vp2intersectintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vp2intersectvlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vpopcntdqintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vpopcntdqvlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxifmaintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxneconvertintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxvnniint8intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxvnniintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/bmi2intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/bmiintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cetintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cldemoteintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clflushoptintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clwbintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clzerointrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cmpccxaddintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/emmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/enqcmdintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/f16cintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fma4intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fmaintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fxsrintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/gfniintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/hresetintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/ia32intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/immintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/keylockerintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/limits.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/lwpintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/lzcntintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mm3dnow.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mm_malloc.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/movdirintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mwaitintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mwaitxintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pconfigintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pkuintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pmmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/popcntintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/prfchiintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/prfchwintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/raointintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/rdseedintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/rtmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/serializeintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/sgxintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/shaintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/smmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stdarg.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stddef.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stdint.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/syslimits.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tbmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tmmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tsxldtrkintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/uintrintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/vaesintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/vpclmulqdqintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/waitpkgintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/wbnoinvdintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/wmmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/x86gprintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/x86intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xmmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xopintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsavecintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsaveintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsaveoptintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsavesintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xtestintrin.h
+ C:/mingw64/x86_64-w64-mingw32/include/_bsd_types.h
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw.h
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_mac.h
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_off_t.h
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_secapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_stdarg.h
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_unicode.h
+ C:/mingw64/x86_64-w64-mingw32/include/_timeval.h
+ C:/mingw64/x86_64-w64-mingw32/include/afunix.h
+ C:/mingw64/x86_64-w64-mingw32/include/apiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/apisetcconv.h
+ C:/mingw64/x86_64-w64-mingw32/include/basetsd.h
+ C:/mingw64/x86_64-w64-mingw32/include/bcrypt.h
+ C:/mingw64/x86_64-w64-mingw32/include/bemapiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/cderr.h
+ C:/mingw64/x86_64-w64-mingw32/include/cguid.h
+ C:/mingw64/x86_64-w64-mingw32/include/combaseapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/commdlg.h
+ C:/mingw64/x86_64-w64-mingw32/include/concurrencysal.h
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt.h
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt_startup.h
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt_stdio_config.h
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt_wstdlib.h
+ C:/mingw64/x86_64-w64-mingw32/include/crtdefs.h
+ C:/mingw64/x86_64-w64-mingw32/include/ctype.h
+ C:/mingw64/x86_64-w64-mingw32/include/datetimeapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/dde.h
+ C:/mingw64/x86_64-w64-mingw32/include/ddeml.h
+ C:/mingw64/x86_64-w64-mingw32/include/debugapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/dlgs.h
+ C:/mingw64/x86_64-w64-mingw32/include/dpapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/driverspecs.h
+ C:/mingw64/x86_64-w64-mingw32/include/errhandlingapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/errno.h
+ C:/mingw64/x86_64-w64-mingw32/include/excpt.h
+ C:/mingw64/x86_64-w64-mingw32/include/fibersapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/fileapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/fltwinerror.h
+ C:/mingw64/x86_64-w64-mingw32/include/getopt.h
+ C:/mingw64/x86_64-w64-mingw32/include/guiddef.h
+ C:/mingw64/x86_64-w64-mingw32/include/handleapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/heapapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/imm.h
+ C:/mingw64/x86_64-w64-mingw32/include/in6addr.h
+ C:/mingw64/x86_64-w64-mingw32/include/inaddr.h
+ C:/mingw64/x86_64-w64-mingw32/include/interlockedapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/io.h
+ C:/mingw64/x86_64-w64-mingw32/include/ioapiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/jobapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/joystickapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/ktmtypes.h
+ C:/mingw64/x86_64-w64-mingw32/include/libloaderapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/limits.h
+ C:/mingw64/x86_64-w64-mingw32/include/lzexpand.h
+ C:/mingw64/x86_64-w64-mingw32/include/malloc.h
+ C:/mingw64/x86_64-w64-mingw32/include/mciapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/mcx.h
+ C:/mingw64/x86_64-w64-mingw32/include/memoryapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/minwinbase.h
+ C:/mingw64/x86_64-w64-mingw32/include/minwindef.h
+ C:/mingw64/x86_64-w64-mingw32/include/mmeapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/mmiscapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/mmiscapi2.h
+ C:/mingw64/x86_64-w64-mingw32/include/mmsyscom.h
+ C:/mingw64/x86_64-w64-mingw32/include/mmsystem.h
+ C:/mingw64/x86_64-w64-mingw32/include/mstcpip.h
+ C:/mingw64/x86_64-w64-mingw32/include/msxml.h
+ C:/mingw64/x86_64-w64-mingw32/include/namedpipeapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/namespaceapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/nb30.h
+ C:/mingw64/x86_64-w64-mingw32/include/ncrypt.h
+ C:/mingw64/x86_64-w64-mingw32/include/oaidl.h
+ C:/mingw64/x86_64-w64-mingw32/include/objbase.h
+ C:/mingw64/x86_64-w64-mingw32/include/objidl.h
+ C:/mingw64/x86_64-w64-mingw32/include/objidlbase.h
+ C:/mingw64/x86_64-w64-mingw32/include/ole2.h
+ C:/mingw64/x86_64-w64-mingw32/include/oleauto.h
+ C:/mingw64/x86_64-w64-mingw32/include/oleidl.h
+ C:/mingw64/x86_64-w64-mingw32/include/playsoundapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/poppack.h
+ C:/mingw64/x86_64-w64-mingw32/include/process.h
+ C:/mingw64/x86_64-w64-mingw32/include/processenv.h
+ C:/mingw64/x86_64-w64-mingw32/include/processthreadsapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/processtopologyapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/profileapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/propidl.h
+ C:/mingw64/x86_64-w64-mingw32/include/prsht.h
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_fd_types.h
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ip_mreq1.h
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ip_types.h
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_socket_types.h
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ws1_undef.h
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_wsa_errnos.h
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_wsadata.h
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/intrin-impl.h
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack1.h
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack2.h
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack4.h
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack8.h
+ C:/mingw64/x86_64-w64-mingw32/include/pthread_time.h
+ C:/mingw64/x86_64-w64-mingw32/include/pthread_unistd.h
+ C:/mingw64/x86_64-w64-mingw32/include/qos.h
+ C:/mingw64/x86_64-w64-mingw32/include/realtimeapiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/reason.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpc.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpcasync.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpcdce.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpcdcep.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpcndr.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpcnsi.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpcnsip.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpcnterr.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpcsal.h
+ C:/mingw64/x86_64-w64-mingw32/include/sal.h
+ C:/mingw64/x86_64-w64-mingw32/include/sdkddkver.h
+ C:/mingw64/x86_64-w64-mingw32/include/sdks/_mingw_ddk.h
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/stdio_s.h
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/stdlib_s.h
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/stralign_s.h
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/string_s.h
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/sys/timeb_s.h
+ C:/mingw64/x86_64-w64-mingw32/include/securityappcontainer.h
+ C:/mingw64/x86_64-w64-mingw32/include/securitybaseapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/servprov.h
+ C:/mingw64/x86_64-w64-mingw32/include/shellapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/specstrings.h
+ C:/mingw64/x86_64-w64-mingw32/include/stdarg.h
+ C:/mingw64/x86_64-w64-mingw32/include/stddef.h
+ C:/mingw64/x86_64-w64-mingw32/include/stdint.h
+ C:/mingw64/x86_64-w64-mingw32/include/stdio.h
+ C:/mingw64/x86_64-w64-mingw32/include/stdlib.h
+ C:/mingw64/x86_64-w64-mingw32/include/stralign.h
+ C:/mingw64/x86_64-w64-mingw32/include/string.h
+ C:/mingw64/x86_64-w64-mingw32/include/stringapiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/swprintf.inl
+ C:/mingw64/x86_64-w64-mingw32/include/synchapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/sys/timeb.h
+ C:/mingw64/x86_64-w64-mingw32/include/sys/types.h
+ C:/mingw64/x86_64-w64-mingw32/include/sysinfoapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/systemtopologyapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/threadpoolapiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/threadpoollegacyapiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/time.h
+ C:/mingw64/x86_64-w64-mingw32/include/timeapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/timezoneapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/tvout.h
+ C:/mingw64/x86_64-w64-mingw32/include/unistd.h
+ C:/mingw64/x86_64-w64-mingw32/include/unknwn.h
+ C:/mingw64/x86_64-w64-mingw32/include/unknwnbase.h
+ C:/mingw64/x86_64-w64-mingw32/include/urlmon.h
+ C:/mingw64/x86_64-w64-mingw32/include/utilapiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/vadefs.h
+ C:/mingw64/x86_64-w64-mingw32/include/virtdisk.h
+ C:/mingw64/x86_64-w64-mingw32/include/winapifamily.h
+ C:/mingw64/x86_64-w64-mingw32/include/winbase.h
+ C:/mingw64/x86_64-w64-mingw32/include/wincon.h
+ C:/mingw64/x86_64-w64-mingw32/include/wincrypt.h
+ C:/mingw64/x86_64-w64-mingw32/include/windef.h
+ C:/mingw64/x86_64-w64-mingw32/include/windows.h
+ C:/mingw64/x86_64-w64-mingw32/include/winefs.h
+ C:/mingw64/x86_64-w64-mingw32/include/winerror.h
+ C:/mingw64/x86_64-w64-mingw32/include/wingdi.h
+ C:/mingw64/x86_64-w64-mingw32/include/winioctl.h
+ C:/mingw64/x86_64-w64-mingw32/include/winnetwk.h
+ C:/mingw64/x86_64-w64-mingw32/include/winnls.h
+ C:/mingw64/x86_64-w64-mingw32/include/winnt.h
+ C:/mingw64/x86_64-w64-mingw32/include/winperf.h
+ C:/mingw64/x86_64-w64-mingw32/include/winreg.h
+ C:/mingw64/x86_64-w64-mingw32/include/winscard.h
+ C:/mingw64/x86_64-w64-mingw32/include/winsmcrd.h
+ C:/mingw64/x86_64-w64-mingw32/include/winsock.h
+ C:/mingw64/x86_64-w64-mingw32/include/winsock2.h
+ C:/mingw64/x86_64-w64-mingw32/include/winspool.h
+ C:/mingw64/x86_64-w64-mingw32/include/winsvc.h
+ C:/mingw64/x86_64-w64-mingw32/include/winuser.h
+ C:/mingw64/x86_64-w64-mingw32/include/winver.h
+ C:/mingw64/x86_64-w64-mingw32/include/wnnc.h
+ C:/mingw64/x86_64-w64-mingw32/include/wow64apiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/ws2def.h
+ C:/mingw64/x86_64-w64-mingw32/include/ws2ipdef.h
+ C:/mingw64/x86_64-w64-mingw32/include/ws2tcpip.h
+ C:/mingw64/x86_64-w64-mingw32/include/wtypes.h
+ C:/mingw64/x86_64-w64-mingw32/include/wtypesbase.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls1_3.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_logger.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_octads.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_sockets.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_x509.h
+
+CMakeFiles/tiitls.dir/lib/tls_tickets.cpp.obj
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/lib/tls_tickets.cpp
+ C:/mingw64/include/c++/13.2.0/bits/std_abs.h
+ C:/mingw64/include/c++/13.2.0/cstdlib
+ C:/mingw64/include/c++/13.2.0/pstl/pstl_config.h
+ C:/mingw64/include/c++/13.2.0/stdlib.h
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/c++config.h
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/cpu_defines.h
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/os_defines.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/adxintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/ammintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxbf16intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxcomplexintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxfp16intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxint8intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxtileintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx2intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx5124fmapsintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx5124vnniwintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bf16intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bf16vlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bitalgintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bwintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512cdintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512dqintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512erintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fp16intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fp16vlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512ifmaintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512ifmavlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512pfintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmi2intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmi2vlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmiintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmivlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vlbwintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vldqintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vnniintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vnnivlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vp2intersectintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vp2intersectvlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vpopcntdqintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vpopcntdqvlintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxifmaintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxneconvertintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxvnniint8intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxvnniintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/bmi2intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/bmiintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cetintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cldemoteintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clflushoptintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clwbintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clzerointrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cmpccxaddintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/emmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/enqcmdintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/f16cintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fma4intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fmaintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fxsrintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/gfniintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/hresetintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/ia32intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/immintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/keylockerintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/limits.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/lwpintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/lzcntintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mm3dnow.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mm_malloc.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/movdirintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mwaitintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mwaitxintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pconfigintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pkuintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pmmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/popcntintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/prfchiintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/prfchwintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/raointintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/rdseedintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/rtmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/serializeintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/sgxintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/shaintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/smmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stdarg.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stddef.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stdint.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/syslimits.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tbmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tmmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tsxldtrkintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/uintrintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/vaesintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/vpclmulqdqintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/waitpkgintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/wbnoinvdintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/wmmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/x86gprintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/x86intrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xmmintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xopintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsavecintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsaveintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsaveoptintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsavesintrin.h
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xtestintrin.h
+ C:/mingw64/x86_64-w64-mingw32/include/_bsd_types.h
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw.h
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_mac.h
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_off_t.h
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_secapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_stdarg.h
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_unicode.h
+ C:/mingw64/x86_64-w64-mingw32/include/_timeval.h
+ C:/mingw64/x86_64-w64-mingw32/include/afunix.h
+ C:/mingw64/x86_64-w64-mingw32/include/apiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/apisetcconv.h
+ C:/mingw64/x86_64-w64-mingw32/include/basetsd.h
+ C:/mingw64/x86_64-w64-mingw32/include/bcrypt.h
+ C:/mingw64/x86_64-w64-mingw32/include/bemapiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/cderr.h
+ C:/mingw64/x86_64-w64-mingw32/include/cguid.h
+ C:/mingw64/x86_64-w64-mingw32/include/combaseapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/commdlg.h
+ C:/mingw64/x86_64-w64-mingw32/include/concurrencysal.h
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt.h
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt_startup.h
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt_stdio_config.h
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt_wstdlib.h
+ C:/mingw64/x86_64-w64-mingw32/include/crtdefs.h
+ C:/mingw64/x86_64-w64-mingw32/include/ctype.h
+ C:/mingw64/x86_64-w64-mingw32/include/datetimeapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/dde.h
+ C:/mingw64/x86_64-w64-mingw32/include/ddeml.h
+ C:/mingw64/x86_64-w64-mingw32/include/debugapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/dlgs.h
+ C:/mingw64/x86_64-w64-mingw32/include/dpapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/driverspecs.h
+ C:/mingw64/x86_64-w64-mingw32/include/errhandlingapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/errno.h
+ C:/mingw64/x86_64-w64-mingw32/include/excpt.h
+ C:/mingw64/x86_64-w64-mingw32/include/fibersapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/fileapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/fltwinerror.h
+ C:/mingw64/x86_64-w64-mingw32/include/getopt.h
+ C:/mingw64/x86_64-w64-mingw32/include/guiddef.h
+ C:/mingw64/x86_64-w64-mingw32/include/handleapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/heapapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/imm.h
+ C:/mingw64/x86_64-w64-mingw32/include/in6addr.h
+ C:/mingw64/x86_64-w64-mingw32/include/inaddr.h
+ C:/mingw64/x86_64-w64-mingw32/include/interlockedapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/io.h
+ C:/mingw64/x86_64-w64-mingw32/include/ioapiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/jobapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/joystickapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/ktmtypes.h
+ C:/mingw64/x86_64-w64-mingw32/include/libloaderapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/limits.h
+ C:/mingw64/x86_64-w64-mingw32/include/lzexpand.h
+ C:/mingw64/x86_64-w64-mingw32/include/malloc.h
+ C:/mingw64/x86_64-w64-mingw32/include/mciapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/mcx.h
+ C:/mingw64/x86_64-w64-mingw32/include/memoryapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/minwinbase.h
+ C:/mingw64/x86_64-w64-mingw32/include/minwindef.h
+ C:/mingw64/x86_64-w64-mingw32/include/mmeapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/mmiscapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/mmiscapi2.h
+ C:/mingw64/x86_64-w64-mingw32/include/mmsyscom.h
+ C:/mingw64/x86_64-w64-mingw32/include/mmsystem.h
+ C:/mingw64/x86_64-w64-mingw32/include/mstcpip.h
+ C:/mingw64/x86_64-w64-mingw32/include/msxml.h
+ C:/mingw64/x86_64-w64-mingw32/include/namedpipeapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/namespaceapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/nb30.h
+ C:/mingw64/x86_64-w64-mingw32/include/ncrypt.h
+ C:/mingw64/x86_64-w64-mingw32/include/oaidl.h
+ C:/mingw64/x86_64-w64-mingw32/include/objbase.h
+ C:/mingw64/x86_64-w64-mingw32/include/objidl.h
+ C:/mingw64/x86_64-w64-mingw32/include/objidlbase.h
+ C:/mingw64/x86_64-w64-mingw32/include/ole2.h
+ C:/mingw64/x86_64-w64-mingw32/include/oleauto.h
+ C:/mingw64/x86_64-w64-mingw32/include/oleidl.h
+ C:/mingw64/x86_64-w64-mingw32/include/playsoundapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/poppack.h
+ C:/mingw64/x86_64-w64-mingw32/include/process.h
+ C:/mingw64/x86_64-w64-mingw32/include/processenv.h
+ C:/mingw64/x86_64-w64-mingw32/include/processthreadsapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/processtopologyapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/profileapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/propidl.h
+ C:/mingw64/x86_64-w64-mingw32/include/prsht.h
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_fd_types.h
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ip_mreq1.h
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ip_types.h
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_socket_types.h
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ws1_undef.h
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_wsa_errnos.h
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_wsadata.h
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/intrin-impl.h
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack1.h
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack2.h
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack4.h
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack8.h
+ C:/mingw64/x86_64-w64-mingw32/include/pthread_time.h
+ C:/mingw64/x86_64-w64-mingw32/include/pthread_unistd.h
+ C:/mingw64/x86_64-w64-mingw32/include/qos.h
+ C:/mingw64/x86_64-w64-mingw32/include/realtimeapiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/reason.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpc.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpcasync.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpcdce.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpcdcep.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpcndr.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpcnsi.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpcnsip.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpcnterr.h
+ C:/mingw64/x86_64-w64-mingw32/include/rpcsal.h
+ C:/mingw64/x86_64-w64-mingw32/include/sal.h
+ C:/mingw64/x86_64-w64-mingw32/include/sdkddkver.h
+ C:/mingw64/x86_64-w64-mingw32/include/sdks/_mingw_ddk.h
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/stdio_s.h
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/stdlib_s.h
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/stralign_s.h
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/string_s.h
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/sys/timeb_s.h
+ C:/mingw64/x86_64-w64-mingw32/include/securityappcontainer.h
+ C:/mingw64/x86_64-w64-mingw32/include/securitybaseapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/servprov.h
+ C:/mingw64/x86_64-w64-mingw32/include/shellapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/specstrings.h
+ C:/mingw64/x86_64-w64-mingw32/include/stdarg.h
+ C:/mingw64/x86_64-w64-mingw32/include/stddef.h
+ C:/mingw64/x86_64-w64-mingw32/include/stdint.h
+ C:/mingw64/x86_64-w64-mingw32/include/stdio.h
+ C:/mingw64/x86_64-w64-mingw32/include/stdlib.h
+ C:/mingw64/x86_64-w64-mingw32/include/stralign.h
+ C:/mingw64/x86_64-w64-mingw32/include/string.h
+ C:/mingw64/x86_64-w64-mingw32/include/stringapiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/swprintf.inl
+ C:/mingw64/x86_64-w64-mingw32/include/synchapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/sys/timeb.h
+ C:/mingw64/x86_64-w64-mingw32/include/sys/types.h
+ C:/mingw64/x86_64-w64-mingw32/include/sysinfoapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/systemtopologyapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/threadpoolapiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/threadpoollegacyapiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/time.h
+ C:/mingw64/x86_64-w64-mingw32/include/timeapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/timezoneapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/tvout.h
+ C:/mingw64/x86_64-w64-mingw32/include/unistd.h
+ C:/mingw64/x86_64-w64-mingw32/include/unknwn.h
+ C:/mingw64/x86_64-w64-mingw32/include/unknwnbase.h
+ C:/mingw64/x86_64-w64-mingw32/include/urlmon.h
+ C:/mingw64/x86_64-w64-mingw32/include/utilapiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/vadefs.h
+ C:/mingw64/x86_64-w64-mingw32/include/virtdisk.h
+ C:/mingw64/x86_64-w64-mingw32/include/winapifamily.h
+ C:/mingw64/x86_64-w64-mingw32/include/winbase.h
+ C:/mingw64/x86_64-w64-mingw32/include/wincon.h
+ C:/mingw64/x86_64-w64-mingw32/include/wincrypt.h
+ C:/mingw64/x86_64-w64-mingw32/include/windef.h
+ C:/mingw64/x86_64-w64-mingw32/include/windows.h
+ C:/mingw64/x86_64-w64-mingw32/include/winefs.h
+ C:/mingw64/x86_64-w64-mingw32/include/winerror.h
+ C:/mingw64/x86_64-w64-mingw32/include/wingdi.h
+ C:/mingw64/x86_64-w64-mingw32/include/winioctl.h
+ C:/mingw64/x86_64-w64-mingw32/include/winnetwk.h
+ C:/mingw64/x86_64-w64-mingw32/include/winnls.h
+ C:/mingw64/x86_64-w64-mingw32/include/winnt.h
+ C:/mingw64/x86_64-w64-mingw32/include/winperf.h
+ C:/mingw64/x86_64-w64-mingw32/include/winreg.h
+ C:/mingw64/x86_64-w64-mingw32/include/winscard.h
+ C:/mingw64/x86_64-w64-mingw32/include/winsmcrd.h
+ C:/mingw64/x86_64-w64-mingw32/include/winsock.h
+ C:/mingw64/x86_64-w64-mingw32/include/winsock2.h
+ C:/mingw64/x86_64-w64-mingw32/include/winspool.h
+ C:/mingw64/x86_64-w64-mingw32/include/winsvc.h
+ C:/mingw64/x86_64-w64-mingw32/include/winuser.h
+ C:/mingw64/x86_64-w64-mingw32/include/winver.h
+ C:/mingw64/x86_64-w64-mingw32/include/wnnc.h
+ C:/mingw64/x86_64-w64-mingw32/include/wow64apiset.h
+ C:/mingw64/x86_64-w64-mingw32/include/ws2def.h
+ C:/mingw64/x86_64-w64-mingw32/include/ws2ipdef.h
+ C:/mingw64/x86_64-w64-mingw32/include/ws2tcpip.h
+ C:/mingw64/x86_64-w64-mingw32/include/wtypes.h
+ C:/mingw64/x86_64-w64-mingw32/include/wtypesbase.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls1_3.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_client_recv.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_client_send.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_keys_calc.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_octads.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_sal.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_sockets.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_tickets.h
+
+CMakeFiles/tiitls.dir/lib/tls_x509.cpp.obj
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/lib/tls_x509.cpp
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stddef.h
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw.h
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_mac.h
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_off_t.h
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_secapi.h
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt.h
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt_stdio_config.h
+ C:/mingw64/x86_64-w64-mingw32/include/crtdefs.h
+ C:/mingw64/x86_64-w64-mingw32/include/sdks/_mingw_ddk.h
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/stdio_s.h
+ C:/mingw64/x86_64-w64-mingw32/include/stddef.h
+ C:/mingw64/x86_64-w64-mingw32/include/stdio.h
+ C:/mingw64/x86_64-w64-mingw32/include/swprintf.inl
+ C:/mingw64/x86_64-w64-mingw32/include/vadefs.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_octads.h
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_x509.h
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/compiler_depend.make b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/compiler_depend.make
new file mode 100644
index 0000000..5299f90
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/compiler_depend.make
@@ -0,0 +1,4639 @@
+# CMAKE generated file: DO NOT EDIT!
+# Generated by "MinGW Makefiles" Generator, CMake Version 3.28
+
+CMakeFiles/tiitls.dir/lib/ibe/tls_bfibe.cpp.obj: lib/ibe/tls_bfibe.cpp \
+  C:/mingw64/include/c++/13.2.0/bits/std_abs.h \
+  C:/mingw64/include/c++/13.2.0/cstdlib \
+  C:/mingw64/include/c++/13.2.0/pstl/pstl_config.h \
+  C:/mingw64/include/c++/13.2.0/stdlib.h \
+  C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/c++config.h \
+  C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/cpu_defines.h \
+  C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/os_defines.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/limits.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mm_malloc.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stdbool.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stddef.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stdint.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/syslimits.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_mingw.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_mingw_mac.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_mingw_off_t.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_mingw_secapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_timeval.h \
+  C:/mingw64/x86_64-w64-mingw32/include/corecrt.h \
+  C:/mingw64/x86_64-w64-mingw32/include/corecrt_stdio_config.h \
+  C:/mingw64/x86_64-w64-mingw32/include/corecrt_wstdlib.h \
+  C:/mingw64/x86_64-w64-mingw32/include/crtdefs.h \
+  C:/mingw64/x86_64-w64-mingw32/include/errno.h \
+  C:/mingw64/x86_64-w64-mingw32/include/inttypes.h \
+  C:/mingw64/x86_64-w64-mingw32/include/limits.h \
+  C:/mingw64/x86_64-w64-mingw32/include/malloc.h \
+  C:/mingw64/x86_64-w64-mingw32/include/pthread_time.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sdks/_mingw_ddk.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sec_api/stdio_s.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sec_api/stdlib_s.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sec_api/string_s.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sec_api/sys/timeb_s.h \
+  C:/mingw64/x86_64-w64-mingw32/include/stddef.h \
+  C:/mingw64/x86_64-w64-mingw32/include/stdint.h \
+  C:/mingw64/x86_64-w64-mingw32/include/stdio.h \
+  C:/mingw64/x86_64-w64-mingw32/include/stdlib.h \
+  C:/mingw64/x86_64-w64-mingw32/include/string.h \
+  C:/mingw64/x86_64-w64-mingw32/include/swprintf.inl \
+  C:/mingw64/x86_64-w64-mingw32/include/sys/timeb.h \
+  C:/mingw64/x86_64-w64-mingw32/include/time.h \
+  C:/mingw64/x86_64-w64-mingw32/include/vadefs.h \
+  include/tls_bfibe.h \
+  sal/miracl/includes/arch.h \
+  sal/miracl/includes/big_B384_58.h \
+  sal/miracl/includes/config_big_B384_58.h \
+  sal/miracl/includes/config_curve_BLS12381.h \
+  sal/miracl/includes/config_field_BLS12381.h \
+  sal/miracl/includes/core.h \
+  sal/miracl/includes/ecp2_BLS12381.h \
+  sal/miracl/includes/ecp_BLS12381.h \
+  sal/miracl/includes/fp12_BLS12381.h \
+  sal/miracl/includes/fp2_BLS12381.h \
+  sal/miracl/includes/fp4_BLS12381.h \
+  sal/miracl/includes/fp_BLS12381.h \
+  sal/miracl/includes/pair_BLS12381.h \
+  sal/miracl/includes/randapi.h
+
+CMakeFiles/tiitls.dir/lib/ibe/tls_pqibe.cpp.obj: lib/ibe/tls_pqibe.cpp \
+  C:/mingw64/include/c++/13.2.0/backward/binders.h \
+  C:/mingw64/include/c++/13.2.0/bit \
+  C:/mingw64/include/c++/13.2.0/bits/alloc_traits.h \
+  C:/mingw64/include/c++/13.2.0/bits/allocator.h \
+  C:/mingw64/include/c++/13.2.0/bits/basic_ios.h \
+  C:/mingw64/include/c++/13.2.0/bits/basic_ios.tcc \
+  C:/mingw64/include/c++/13.2.0/bits/basic_string.h \
+  C:/mingw64/include/c++/13.2.0/bits/basic_string.tcc \
+  C:/mingw64/include/c++/13.2.0/bits/char_traits.h \
+  C:/mingw64/include/c++/13.2.0/bits/charconv.h \
+  C:/mingw64/include/c++/13.2.0/bits/concept_check.h \
+  C:/mingw64/include/c++/13.2.0/bits/cpp_type_traits.h \
+  C:/mingw64/include/c++/13.2.0/bits/cxxabi_forced.h \
+  C:/mingw64/include/c++/13.2.0/bits/cxxabi_init_exception.h \
+  C:/mingw64/include/c++/13.2.0/bits/exception.h \
+  C:/mingw64/include/c++/13.2.0/bits/exception_defines.h \
+  C:/mingw64/include/c++/13.2.0/bits/exception_ptr.h \
+  C:/mingw64/include/c++/13.2.0/bits/functexcept.h \
+  C:/mingw64/include/c++/13.2.0/bits/functional_hash.h \
+  C:/mingw64/include/c++/13.2.0/bits/hash_bytes.h \
+  C:/mingw64/include/c++/13.2.0/bits/invoke.h \
+  C:/mingw64/include/c++/13.2.0/bits/ios_base.h \
+  C:/mingw64/include/c++/13.2.0/bits/istream.tcc \
+  C:/mingw64/include/c++/13.2.0/bits/locale_classes.h \
+  C:/mingw64/include/c++/13.2.0/bits/locale_classes.tcc \
+  C:/mingw64/include/c++/13.2.0/bits/locale_facets.h \
+  C:/mingw64/include/c++/13.2.0/bits/locale_facets.tcc \
+  C:/mingw64/include/c++/13.2.0/bits/localefwd.h \
+  C:/mingw64/include/c++/13.2.0/bits/memory_resource.h \
+  C:/mingw64/include/c++/13.2.0/bits/memoryfwd.h \
+  C:/mingw64/include/c++/13.2.0/bits/move.h \
+  C:/mingw64/include/c++/13.2.0/bits/nested_exception.h \
+  C:/mingw64/include/c++/13.2.0/bits/new_allocator.h \
+  C:/mingw64/include/c++/13.2.0/bits/ostream.tcc \
+  C:/mingw64/include/c++/13.2.0/bits/ostream_insert.h \
+  C:/mingw64/include/c++/13.2.0/bits/postypes.h \
+  C:/mingw64/include/c++/13.2.0/bits/predefined_ops.h \
+  C:/mingw64/include/c++/13.2.0/bits/ptr_traits.h \
+  C:/mingw64/include/c++/13.2.0/bits/range_access.h \
+  C:/mingw64/include/c++/13.2.0/bits/refwrap.h \
+  C:/mingw64/include/c++/13.2.0/bits/requires_hosted.h \
+  C:/mingw64/include/c++/13.2.0/bits/std_abs.h \
+  C:/mingw64/include/c++/13.2.0/bits/stl_algobase.h \
+  C:/mingw64/include/c++/13.2.0/bits/stl_construct.h \
+  C:/mingw64/include/c++/13.2.0/bits/stl_function.h \
+  C:/mingw64/include/c++/13.2.0/bits/stl_iterator.h \
+  C:/mingw64/include/c++/13.2.0/bits/stl_iterator_base_funcs.h \
+  C:/mingw64/include/c++/13.2.0/bits/stl_iterator_base_types.h \
+  C:/mingw64/include/c++/13.2.0/bits/stl_pair.h \
+  C:/mingw64/include/c++/13.2.0/bits/streambuf.tcc \
+  C:/mingw64/include/c++/13.2.0/bits/streambuf_iterator.h \
+  C:/mingw64/include/c++/13.2.0/bits/string_view.tcc \
+  C:/mingw64/include/c++/13.2.0/bits/stringfwd.h \
+  C:/mingw64/include/c++/13.2.0/bits/uses_allocator.h \
+  C:/mingw64/include/c++/13.2.0/bits/uses_allocator_args.h \
+  C:/mingw64/include/c++/13.2.0/bits/utility.h \
+  C:/mingw64/include/c++/13.2.0/cctype \
+  C:/mingw64/include/c++/13.2.0/cerrno \
+  C:/mingw64/include/c++/13.2.0/clocale \
+  C:/mingw64/include/c++/13.2.0/cstddef \
+  C:/mingw64/include/c++/13.2.0/cstdint \
+  C:/mingw64/include/c++/13.2.0/cstdio \
+  C:/mingw64/include/c++/13.2.0/cstdlib \
+  C:/mingw64/include/c++/13.2.0/cwchar \
+  C:/mingw64/include/c++/13.2.0/cwctype \
+  C:/mingw64/include/c++/13.2.0/debug/assertions.h \
+  C:/mingw64/include/c++/13.2.0/debug/debug.h \
+  C:/mingw64/include/c++/13.2.0/exception \
+  C:/mingw64/include/c++/13.2.0/ext/alloc_traits.h \
+  C:/mingw64/include/c++/13.2.0/ext/atomicity.h \
+  C:/mingw64/include/c++/13.2.0/ext/numeric_traits.h \
+  C:/mingw64/include/c++/13.2.0/ext/string_conversions.h \
+  C:/mingw64/include/c++/13.2.0/ext/type_traits.h \
+  C:/mingw64/include/c++/13.2.0/initializer_list \
+  C:/mingw64/include/c++/13.2.0/ios \
+  C:/mingw64/include/c++/13.2.0/iosfwd \
+  C:/mingw64/include/c++/13.2.0/iostream \
+  C:/mingw64/include/c++/13.2.0/istream \
+  C:/mingw64/include/c++/13.2.0/new \
+  C:/mingw64/include/c++/13.2.0/ostream \
+  C:/mingw64/include/c++/13.2.0/pstl/pstl_config.h \
+  C:/mingw64/include/c++/13.2.0/stdexcept \
+  C:/mingw64/include/c++/13.2.0/stdlib.h \
+  C:/mingw64/include/c++/13.2.0/streambuf \
+  C:/mingw64/include/c++/13.2.0/string \
+  C:/mingw64/include/c++/13.2.0/string_view \
+  C:/mingw64/include/c++/13.2.0/system_error \
+  C:/mingw64/include/c++/13.2.0/tuple \
+  C:/mingw64/include/c++/13.2.0/type_traits \
+  C:/mingw64/include/c++/13.2.0/typeinfo \
+  C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/atomic_word.h \
+  C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/c++allocator.h \
+  C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/c++config.h \
+  C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/c++locale.h \
+  C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/cpu_defines.h \
+  C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/ctype_base.h \
+  C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/ctype_inline.h \
+  C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/error_constants.h \
+  C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/gthr-default.h \
+  C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/gthr.h \
+  C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/os_defines.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/limits.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mm_malloc.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stdbool.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stddef.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stdint.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/syslimits.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_mingw.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_mingw_mac.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_mingw_off_t.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_mingw_secapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_mingw_stat64.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_timeval.h \
+  C:/mingw64/x86_64-w64-mingw32/include/corecrt.h \
+  C:/mingw64/x86_64-w64-mingw32/include/corecrt_startup.h \
+  C:/mingw64/x86_64-w64-mingw32/include/corecrt_stdio_config.h \
+  C:/mingw64/x86_64-w64-mingw32/include/corecrt_wstdlib.h \
+  C:/mingw64/x86_64-w64-mingw32/include/crtdefs.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ctype.h \
+  C:/mingw64/x86_64-w64-mingw32/include/errno.h \
+  C:/mingw64/x86_64-w64-mingw32/include/limits.h \
+  C:/mingw64/x86_64-w64-mingw32/include/locale.h \
+  C:/mingw64/x86_64-w64-mingw32/include/malloc.h \
+  C:/mingw64/x86_64-w64-mingw32/include/process.h \
+  C:/mingw64/x86_64-w64-mingw32/include/pthread.h \
+  C:/mingw64/x86_64-w64-mingw32/include/pthread_compat.h \
+  C:/mingw64/x86_64-w64-mingw32/include/pthread_signal.h \
+  C:/mingw64/x86_64-w64-mingw32/include/pthread_time.h \
+  C:/mingw64/x86_64-w64-mingw32/include/pthread_unistd.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sdks/_mingw_ddk.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sec_api/stdio_s.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sec_api/stdlib_s.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sec_api/sys/timeb_s.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sec_api/wchar_s.h \
+  C:/mingw64/x86_64-w64-mingw32/include/signal.h \
+  C:/mingw64/x86_64-w64-mingw32/include/stddef.h \
+  C:/mingw64/x86_64-w64-mingw32/include/stdint.h \
+  C:/mingw64/x86_64-w64-mingw32/include/stdio.h \
+  C:/mingw64/x86_64-w64-mingw32/include/stdlib.h \
+  C:/mingw64/x86_64-w64-mingw32/include/swprintf.inl \
+  C:/mingw64/x86_64-w64-mingw32/include/sys/timeb.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sys/types.h \
+  C:/mingw64/x86_64-w64-mingw32/include/time.h \
+  C:/mingw64/x86_64-w64-mingw32/include/vadefs.h \
+  C:/mingw64/x86_64-w64-mingw32/include/wchar.h \
+  C:/mingw64/x86_64-w64-mingw32/include/wctype.h \
+  include/tls_pqibe.h \
+  sal/miracl/includes/arch.h \
+  sal/miracl/includes/core.h
+
+CMakeFiles/tiitls.dir/lib/tls_cacerts.cpp.obj: lib/tls_cacerts.cpp \
+  C:/mingw64/include/c++/13.2.0/bits/std_abs.h \
+  C:/mingw64/include/c++/13.2.0/cstdlib \
+  C:/mingw64/include/c++/13.2.0/pstl/pstl_config.h \
+  C:/mingw64/include/c++/13.2.0/stdlib.h \
+  C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/c++config.h \
+  C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/cpu_defines.h \
+  C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/os_defines.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/adxintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/ammintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxbf16intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxcomplexintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxfp16intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxint8intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxtileintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx2intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx5124fmapsintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx5124vnniwintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bf16intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bf16vlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bitalgintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bwintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512cdintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512dqintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512erintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fp16intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fp16vlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512ifmaintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512ifmavlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512pfintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmi2intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmi2vlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmiintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmivlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vlbwintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vldqintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vnniintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vnnivlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vp2intersectintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vp2intersectvlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vpopcntdqintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vpopcntdqvlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxifmaintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxneconvertintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxvnniint8intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxvnniintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/bmi2intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/bmiintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cetintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cldemoteintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clflushoptintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clwbintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clzerointrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cmpccxaddintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/emmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/enqcmdintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/f16cintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fma4intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fmaintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fxsrintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/gfniintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/hresetintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/ia32intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/immintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/keylockerintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/limits.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/lwpintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/lzcntintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mm3dnow.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mm_malloc.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/movdirintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mwaitintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mwaitxintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pconfigintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pkuintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pmmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/popcntintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/prfchiintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/prfchwintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/raointintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/rdseedintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/rtmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/serializeintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/sgxintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/shaintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/smmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stdarg.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stddef.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stdint.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/syslimits.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tbmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tmmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tsxldtrkintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/uintrintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/vaesintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/vpclmulqdqintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/waitpkgintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/wbnoinvdintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/wmmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/x86gprintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/x86intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xmmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xopintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsavecintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsaveintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsaveoptintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsavesintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xtestintrin.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_bsd_types.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_mingw.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_mingw_mac.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_mingw_off_t.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_mingw_secapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_mingw_stdarg.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_mingw_unicode.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_timeval.h \
+  C:/mingw64/x86_64-w64-mingw32/include/afunix.h \
+  C:/mingw64/x86_64-w64-mingw32/include/apiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/apisetcconv.h \
+  C:/mingw64/x86_64-w64-mingw32/include/basetsd.h \
+  C:/mingw64/x86_64-w64-mingw32/include/bcrypt.h \
+  C:/mingw64/x86_64-w64-mingw32/include/bemapiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/cderr.h \
+  C:/mingw64/x86_64-w64-mingw32/include/cguid.h \
+  C:/mingw64/x86_64-w64-mingw32/include/combaseapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/commdlg.h \
+  C:/mingw64/x86_64-w64-mingw32/include/concurrencysal.h \
+  C:/mingw64/x86_64-w64-mingw32/include/corecrt.h \
+  C:/mingw64/x86_64-w64-mingw32/include/corecrt_startup.h \
+  C:/mingw64/x86_64-w64-mingw32/include/corecrt_stdio_config.h \
+  C:/mingw64/x86_64-w64-mingw32/include/corecrt_wstdlib.h \
+  C:/mingw64/x86_64-w64-mingw32/include/crtdefs.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ctype.h \
+  C:/mingw64/x86_64-w64-mingw32/include/datetimeapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/dde.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ddeml.h \
+  C:/mingw64/x86_64-w64-mingw32/include/debugapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/dlgs.h \
+  C:/mingw64/x86_64-w64-mingw32/include/dpapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/driverspecs.h \
+  C:/mingw64/x86_64-w64-mingw32/include/errhandlingapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/errno.h \
+  C:/mingw64/x86_64-w64-mingw32/include/excpt.h \
+  C:/mingw64/x86_64-w64-mingw32/include/fibersapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/fileapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/fltwinerror.h \
+  C:/mingw64/x86_64-w64-mingw32/include/getopt.h \
+  C:/mingw64/x86_64-w64-mingw32/include/guiddef.h \
+  C:/mingw64/x86_64-w64-mingw32/include/handleapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/heapapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/imm.h \
+  C:/mingw64/x86_64-w64-mingw32/include/in6addr.h \
+  C:/mingw64/x86_64-w64-mingw32/include/inaddr.h \
+  C:/mingw64/x86_64-w64-mingw32/include/interlockedapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/io.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ioapiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/jobapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/joystickapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ktmtypes.h \
+  C:/mingw64/x86_64-w64-mingw32/include/libloaderapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/limits.h \
+  C:/mingw64/x86_64-w64-mingw32/include/lzexpand.h \
+  C:/mingw64/x86_64-w64-mingw32/include/malloc.h \
+  C:/mingw64/x86_64-w64-mingw32/include/mciapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/mcx.h \
+  C:/mingw64/x86_64-w64-mingw32/include/memoryapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/minwinbase.h \
+  C:/mingw64/x86_64-w64-mingw32/include/minwindef.h \
+  C:/mingw64/x86_64-w64-mingw32/include/mmeapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/mmiscapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/mmiscapi2.h \
+  C:/mingw64/x86_64-w64-mingw32/include/mmsyscom.h \
+  C:/mingw64/x86_64-w64-mingw32/include/mmsystem.h \
+  C:/mingw64/x86_64-w64-mingw32/include/mstcpip.h \
+  C:/mingw64/x86_64-w64-mingw32/include/msxml.h \
+  C:/mingw64/x86_64-w64-mingw32/include/namedpipeapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/namespaceapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/nb30.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ncrypt.h \
+  C:/mingw64/x86_64-w64-mingw32/include/oaidl.h \
+  C:/mingw64/x86_64-w64-mingw32/include/objbase.h \
+  C:/mingw64/x86_64-w64-mingw32/include/objidl.h \
+  C:/mingw64/x86_64-w64-mingw32/include/objidlbase.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ole2.h \
+  C:/mingw64/x86_64-w64-mingw32/include/oleauto.h \
+  C:/mingw64/x86_64-w64-mingw32/include/oleidl.h \
+  C:/mingw64/x86_64-w64-mingw32/include/playsoundapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/poppack.h \
+  C:/mingw64/x86_64-w64-mingw32/include/process.h \
+  C:/mingw64/x86_64-w64-mingw32/include/processenv.h \
+  C:/mingw64/x86_64-w64-mingw32/include/processthreadsapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/processtopologyapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/profileapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/propidl.h \
+  C:/mingw64/x86_64-w64-mingw32/include/prsht.h \
+  C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_fd_types.h \
+  C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ip_mreq1.h \
+  C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ip_types.h \
+  C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_socket_types.h \
+  C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ws1_undef.h \
+  C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_wsa_errnos.h \
+  C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_wsadata.h \
+  C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/intrin-impl.h \
+  C:/mingw64/x86_64-w64-mingw32/include/pshpack1.h \
+  C:/mingw64/x86_64-w64-mingw32/include/pshpack2.h \
+  C:/mingw64/x86_64-w64-mingw32/include/pshpack4.h \
+  C:/mingw64/x86_64-w64-mingw32/include/pshpack8.h \
+  C:/mingw64/x86_64-w64-mingw32/include/pthread_time.h \
+  C:/mingw64/x86_64-w64-mingw32/include/pthread_unistd.h \
+  C:/mingw64/x86_64-w64-mingw32/include/qos.h \
+  C:/mingw64/x86_64-w64-mingw32/include/realtimeapiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/reason.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpc.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpcasync.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpcdce.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpcdcep.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpcndr.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpcnsi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpcnsip.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpcnterr.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpcsal.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sal.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sdkddkver.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sdks/_mingw_ddk.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sec_api/stdio_s.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sec_api/stdlib_s.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sec_api/stralign_s.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sec_api/string_s.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sec_api/sys/timeb_s.h \
+  C:/mingw64/x86_64-w64-mingw32/include/securityappcontainer.h \
+  C:/mingw64/x86_64-w64-mingw32/include/securitybaseapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/servprov.h \
+  C:/mingw64/x86_64-w64-mingw32/include/shellapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/specstrings.h \
+  C:/mingw64/x86_64-w64-mingw32/include/stdarg.h \
+  C:/mingw64/x86_64-w64-mingw32/include/stddef.h \
+  C:/mingw64/x86_64-w64-mingw32/include/stdint.h \
+  C:/mingw64/x86_64-w64-mingw32/include/stdio.h \
+  C:/mingw64/x86_64-w64-mingw32/include/stdlib.h \
+  C:/mingw64/x86_64-w64-mingw32/include/stralign.h \
+  C:/mingw64/x86_64-w64-mingw32/include/string.h \
+  C:/mingw64/x86_64-w64-mingw32/include/stringapiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/swprintf.inl \
+  C:/mingw64/x86_64-w64-mingw32/include/synchapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sys/timeb.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sys/types.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sysinfoapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/systemtopologyapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/threadpoolapiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/threadpoollegacyapiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/time.h \
+  C:/mingw64/x86_64-w64-mingw32/include/timeapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/timezoneapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/tvout.h \
+  C:/mingw64/x86_64-w64-mingw32/include/unistd.h \
+  C:/mingw64/x86_64-w64-mingw32/include/unknwn.h \
+  C:/mingw64/x86_64-w64-mingw32/include/unknwnbase.h \
+  C:/mingw64/x86_64-w64-mingw32/include/urlmon.h \
+  C:/mingw64/x86_64-w64-mingw32/include/utilapiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/vadefs.h \
+  C:/mingw64/x86_64-w64-mingw32/include/virtdisk.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winapifamily.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winbase.h \
+  C:/mingw64/x86_64-w64-mingw32/include/wincon.h \
+  C:/mingw64/x86_64-w64-mingw32/include/wincrypt.h \
+  C:/mingw64/x86_64-w64-mingw32/include/windef.h \
+  C:/mingw64/x86_64-w64-mingw32/include/windows.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winefs.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winerror.h \
+  C:/mingw64/x86_64-w64-mingw32/include/wingdi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winioctl.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winnetwk.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winnls.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winnt.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winperf.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winreg.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winscard.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winsmcrd.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winsock.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winsock2.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winspool.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winsvc.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winuser.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winver.h \
+  C:/mingw64/x86_64-w64-mingw32/include/wnnc.h \
+  C:/mingw64/x86_64-w64-mingw32/include/wow64apiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ws2def.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ws2ipdef.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ws2tcpip.h \
+  C:/mingw64/x86_64-w64-mingw32/include/wtypes.h \
+  C:/mingw64/x86_64-w64-mingw32/include/wtypesbase.h \
+  include/tls1_3.h \
+  include/tls_certs.h \
+  include/tls_octads.h \
+  include/tls_sockets.h
+
+CMakeFiles/tiitls.dir/lib/tls_cert_chain.cpp.obj: lib/tls_cert_chain.cpp \
+  C:/mingw64/include/c++/13.2.0/bits/std_abs.h \
+  C:/mingw64/include/c++/13.2.0/cstdlib \
+  C:/mingw64/include/c++/13.2.0/pstl/pstl_config.h \
+  C:/mingw64/include/c++/13.2.0/stdlib.h \
+  C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/c++config.h \
+  C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/cpu_defines.h \
+  C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/os_defines.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/adxintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/ammintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxbf16intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxcomplexintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxfp16intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxint8intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxtileintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx2intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx5124fmapsintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx5124vnniwintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bf16intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bf16vlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bitalgintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bwintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512cdintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512dqintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512erintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fp16intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fp16vlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512ifmaintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512ifmavlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512pfintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmi2intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmi2vlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmiintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmivlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vlbwintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vldqintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vnniintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vnnivlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vp2intersectintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vp2intersectvlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vpopcntdqintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vpopcntdqvlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxifmaintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxneconvertintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxvnniint8intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxvnniintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/bmi2intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/bmiintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cetintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cldemoteintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clflushoptintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clwbintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clzerointrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cmpccxaddintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/emmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/enqcmdintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/f16cintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fma4intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fmaintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fxsrintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/gfniintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/hresetintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/ia32intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/immintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/keylockerintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/limits.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/lwpintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/lzcntintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mm3dnow.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mm_malloc.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/movdirintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mwaitintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mwaitxintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pconfigintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pkuintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pmmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/popcntintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/prfchiintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/prfchwintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/raointintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/rdseedintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/rtmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/serializeintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/sgxintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/shaintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/smmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stdarg.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stddef.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stdint.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/syslimits.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tbmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tmmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tsxldtrkintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/uintrintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/vaesintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/vpclmulqdqintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/waitpkgintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/wbnoinvdintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/wmmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/x86gprintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/x86intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xmmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xopintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsavecintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsaveintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsaveoptintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsavesintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xtestintrin.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_bsd_types.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_mingw.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_mingw_mac.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_mingw_off_t.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_mingw_secapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_mingw_stdarg.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_mingw_unicode.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_timeval.h \
+  C:/mingw64/x86_64-w64-mingw32/include/afunix.h \
+  C:/mingw64/x86_64-w64-mingw32/include/apiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/apisetcconv.h \
+  C:/mingw64/x86_64-w64-mingw32/include/basetsd.h \
+  C:/mingw64/x86_64-w64-mingw32/include/bcrypt.h \
+  C:/mingw64/x86_64-w64-mingw32/include/bemapiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/cderr.h \
+  C:/mingw64/x86_64-w64-mingw32/include/cguid.h \
+  C:/mingw64/x86_64-w64-mingw32/include/combaseapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/commdlg.h \
+  C:/mingw64/x86_64-w64-mingw32/include/concurrencysal.h \
+  C:/mingw64/x86_64-w64-mingw32/include/corecrt.h \
+  C:/mingw64/x86_64-w64-mingw32/include/corecrt_startup.h \
+  C:/mingw64/x86_64-w64-mingw32/include/corecrt_stdio_config.h \
+  C:/mingw64/x86_64-w64-mingw32/include/corecrt_wstdlib.h \
+  C:/mingw64/x86_64-w64-mingw32/include/crtdefs.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ctype.h \
+  C:/mingw64/x86_64-w64-mingw32/include/datetimeapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/dde.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ddeml.h \
+  C:/mingw64/x86_64-w64-mingw32/include/debugapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/dlgs.h \
+  C:/mingw64/x86_64-w64-mingw32/include/dpapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/driverspecs.h \
+  C:/mingw64/x86_64-w64-mingw32/include/errhandlingapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/errno.h \
+  C:/mingw64/x86_64-w64-mingw32/include/excpt.h \
+  C:/mingw64/x86_64-w64-mingw32/include/fibersapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/fileapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/fltwinerror.h \
+  C:/mingw64/x86_64-w64-mingw32/include/getopt.h \
+  C:/mingw64/x86_64-w64-mingw32/include/guiddef.h \
+  C:/mingw64/x86_64-w64-mingw32/include/handleapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/heapapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/imm.h \
+  C:/mingw64/x86_64-w64-mingw32/include/in6addr.h \
+  C:/mingw64/x86_64-w64-mingw32/include/inaddr.h \
+  C:/mingw64/x86_64-w64-mingw32/include/interlockedapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/io.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ioapiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/jobapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/joystickapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ktmtypes.h \
+  C:/mingw64/x86_64-w64-mingw32/include/libloaderapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/limits.h \
+  C:/mingw64/x86_64-w64-mingw32/include/lzexpand.h \
+  C:/mingw64/x86_64-w64-mingw32/include/malloc.h \
+  C:/mingw64/x86_64-w64-mingw32/include/mciapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/mcx.h \
+  C:/mingw64/x86_64-w64-mingw32/include/memoryapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/minwinbase.h \
+  C:/mingw64/x86_64-w64-mingw32/include/minwindef.h \
+  C:/mingw64/x86_64-w64-mingw32/include/mmeapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/mmiscapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/mmiscapi2.h \
+  C:/mingw64/x86_64-w64-mingw32/include/mmsyscom.h \
+  C:/mingw64/x86_64-w64-mingw32/include/mmsystem.h \
+  C:/mingw64/x86_64-w64-mingw32/include/mstcpip.h \
+  C:/mingw64/x86_64-w64-mingw32/include/msxml.h \
+  C:/mingw64/x86_64-w64-mingw32/include/namedpipeapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/namespaceapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/nb30.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ncrypt.h \
+  C:/mingw64/x86_64-w64-mingw32/include/oaidl.h \
+  C:/mingw64/x86_64-w64-mingw32/include/objbase.h \
+  C:/mingw64/x86_64-w64-mingw32/include/objidl.h \
+  C:/mingw64/x86_64-w64-mingw32/include/objidlbase.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ole2.h \
+  C:/mingw64/x86_64-w64-mingw32/include/oleauto.h \
+  C:/mingw64/x86_64-w64-mingw32/include/oleidl.h \
+  C:/mingw64/x86_64-w64-mingw32/include/playsoundapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/poppack.h \
+  C:/mingw64/x86_64-w64-mingw32/include/process.h \
+  C:/mingw64/x86_64-w64-mingw32/include/processenv.h \
+  C:/mingw64/x86_64-w64-mingw32/include/processthreadsapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/processtopologyapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/profileapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/propidl.h \
+  C:/mingw64/x86_64-w64-mingw32/include/prsht.h \
+  C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_fd_types.h \
+  C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ip_mreq1.h \
+  C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ip_types.h \
+  C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_socket_types.h \
+  C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ws1_undef.h \
+  C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_wsa_errnos.h \
+  C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_wsadata.h \
+  C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/intrin-impl.h \
+  C:/mingw64/x86_64-w64-mingw32/include/pshpack1.h \
+  C:/mingw64/x86_64-w64-mingw32/include/pshpack2.h \
+  C:/mingw64/x86_64-w64-mingw32/include/pshpack4.h \
+  C:/mingw64/x86_64-w64-mingw32/include/pshpack8.h \
+  C:/mingw64/x86_64-w64-mingw32/include/pthread_time.h \
+  C:/mingw64/x86_64-w64-mingw32/include/pthread_unistd.h \
+  C:/mingw64/x86_64-w64-mingw32/include/qos.h \
+  C:/mingw64/x86_64-w64-mingw32/include/realtimeapiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/reason.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpc.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpcasync.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpcdce.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpcdcep.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpcndr.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpcnsi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpcnsip.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpcnterr.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpcsal.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sal.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sdkddkver.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sdks/_mingw_ddk.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sec_api/stdio_s.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sec_api/stdlib_s.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sec_api/stralign_s.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sec_api/string_s.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sec_api/sys/timeb_s.h \
+  C:/mingw64/x86_64-w64-mingw32/include/securityappcontainer.h \
+  C:/mingw64/x86_64-w64-mingw32/include/securitybaseapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/servprov.h \
+  C:/mingw64/x86_64-w64-mingw32/include/shellapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/specstrings.h \
+  C:/mingw64/x86_64-w64-mingw32/include/stdarg.h \
+  C:/mingw64/x86_64-w64-mingw32/include/stddef.h \
+  C:/mingw64/x86_64-w64-mingw32/include/stdint.h \
+  C:/mingw64/x86_64-w64-mingw32/include/stdio.h \
+  C:/mingw64/x86_64-w64-mingw32/include/stdlib.h \
+  C:/mingw64/x86_64-w64-mingw32/include/stralign.h \
+  C:/mingw64/x86_64-w64-mingw32/include/string.h \
+  C:/mingw64/x86_64-w64-mingw32/include/stringapiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/swprintf.inl \
+  C:/mingw64/x86_64-w64-mingw32/include/synchapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sys/timeb.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sys/types.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sysinfoapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/systemtopologyapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/threadpoolapiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/threadpoollegacyapiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/time.h \
+  C:/mingw64/x86_64-w64-mingw32/include/timeapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/timezoneapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/tvout.h \
+  C:/mingw64/x86_64-w64-mingw32/include/unistd.h \
+  C:/mingw64/x86_64-w64-mingw32/include/unknwn.h \
+  C:/mingw64/x86_64-w64-mingw32/include/unknwnbase.h \
+  C:/mingw64/x86_64-w64-mingw32/include/urlmon.h \
+  C:/mingw64/x86_64-w64-mingw32/include/utilapiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/vadefs.h \
+  C:/mingw64/x86_64-w64-mingw32/include/virtdisk.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winapifamily.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winbase.h \
+  C:/mingw64/x86_64-w64-mingw32/include/wincon.h \
+  C:/mingw64/x86_64-w64-mingw32/include/wincrypt.h \
+  C:/mingw64/x86_64-w64-mingw32/include/windef.h \
+  C:/mingw64/x86_64-w64-mingw32/include/windows.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winefs.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winerror.h \
+  C:/mingw64/x86_64-w64-mingw32/include/wingdi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winioctl.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winnetwk.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winnls.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winnt.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winperf.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winreg.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winscard.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winsmcrd.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winsock.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winsock2.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winspool.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winsvc.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winuser.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winver.h \
+  C:/mingw64/x86_64-w64-mingw32/include/wnnc.h \
+  C:/mingw64/x86_64-w64-mingw32/include/wow64apiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ws2def.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ws2ipdef.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ws2tcpip.h \
+  C:/mingw64/x86_64-w64-mingw32/include/wtypes.h \
+  C:/mingw64/x86_64-w64-mingw32/include/wtypesbase.h \
+  include/tls1_3.h \
+  include/tls_cert_chain.h \
+  include/tls_certs.h \
+  include/tls_client_recv.h \
+  include/tls_client_send.h \
+  include/tls_keys_calc.h \
+  include/tls_logger.h \
+  include/tls_octads.h \
+  include/tls_sal.h \
+  include/tls_sockets.h \
+  include/tls_x509.h
+
+CMakeFiles/tiitls.dir/lib/tls_client_cert.cpp.obj: lib/tls_client_cert.cpp \
+  C:/mingw64/include/c++/13.2.0/bits/std_abs.h \
+  C:/mingw64/include/c++/13.2.0/cstdlib \
+  C:/mingw64/include/c++/13.2.0/pstl/pstl_config.h \
+  C:/mingw64/include/c++/13.2.0/stdlib.h \
+  C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/c++config.h \
+  C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/cpu_defines.h \
+  C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/os_defines.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/adxintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/ammintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxbf16intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxcomplexintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxfp16intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxint8intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxtileintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx2intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx5124fmapsintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx5124vnniwintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bf16intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bf16vlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bitalgintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bwintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512cdintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512dqintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512erintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fp16intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fp16vlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512ifmaintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512ifmavlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512pfintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmi2intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmi2vlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmiintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmivlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vlbwintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vldqintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vnniintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vnnivlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vp2intersectintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vp2intersectvlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vpopcntdqintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vpopcntdqvlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxifmaintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxneconvertintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxvnniint8intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxvnniintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/bmi2intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/bmiintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cetintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cldemoteintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clflushoptintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clwbintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clzerointrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cmpccxaddintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/emmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/enqcmdintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/f16cintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fma4intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fmaintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fxsrintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/gfniintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/hresetintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/ia32intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/immintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/keylockerintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/limits.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/lwpintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/lzcntintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mm3dnow.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mm_malloc.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/movdirintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mwaitintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mwaitxintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pconfigintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pkuintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pmmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/popcntintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/prfchiintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/prfchwintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/raointintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/rdseedintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/rtmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/serializeintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/sgxintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/shaintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/smmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stdarg.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stddef.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stdint.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/syslimits.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tbmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tmmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tsxldtrkintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/uintrintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/vaesintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/vpclmulqdqintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/waitpkgintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/wbnoinvdintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/wmmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/x86gprintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/x86intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xmmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xopintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsavecintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsaveintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsaveoptintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsavesintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xtestintrin.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_bsd_types.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_mingw.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_mingw_mac.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_mingw_off_t.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_mingw_secapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_mingw_stdarg.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_mingw_unicode.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_timeval.h \
+  C:/mingw64/x86_64-w64-mingw32/include/afunix.h \
+  C:/mingw64/x86_64-w64-mingw32/include/apiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/apisetcconv.h \
+  C:/mingw64/x86_64-w64-mingw32/include/basetsd.h \
+  C:/mingw64/x86_64-w64-mingw32/include/bcrypt.h \
+  C:/mingw64/x86_64-w64-mingw32/include/bemapiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/cderr.h \
+  C:/mingw64/x86_64-w64-mingw32/include/cguid.h \
+  C:/mingw64/x86_64-w64-mingw32/include/combaseapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/commdlg.h \
+  C:/mingw64/x86_64-w64-mingw32/include/concurrencysal.h \
+  C:/mingw64/x86_64-w64-mingw32/include/corecrt.h \
+  C:/mingw64/x86_64-w64-mingw32/include/corecrt_startup.h \
+  C:/mingw64/x86_64-w64-mingw32/include/corecrt_stdio_config.h \
+  C:/mingw64/x86_64-w64-mingw32/include/corecrt_wstdlib.h \
+  C:/mingw64/x86_64-w64-mingw32/include/crtdefs.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ctype.h \
+  C:/mingw64/x86_64-w64-mingw32/include/datetimeapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/dde.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ddeml.h \
+  C:/mingw64/x86_64-w64-mingw32/include/debugapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/dlgs.h \
+  C:/mingw64/x86_64-w64-mingw32/include/dpapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/driverspecs.h \
+  C:/mingw64/x86_64-w64-mingw32/include/errhandlingapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/errno.h \
+  C:/mingw64/x86_64-w64-mingw32/include/excpt.h \
+  C:/mingw64/x86_64-w64-mingw32/include/fibersapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/fileapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/fltwinerror.h \
+  C:/mingw64/x86_64-w64-mingw32/include/getopt.h \
+  C:/mingw64/x86_64-w64-mingw32/include/guiddef.h \
+  C:/mingw64/x86_64-w64-mingw32/include/handleapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/heapapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/imm.h \
+  C:/mingw64/x86_64-w64-mingw32/include/in6addr.h \
+  C:/mingw64/x86_64-w64-mingw32/include/inaddr.h \
+  C:/mingw64/x86_64-w64-mingw32/include/interlockedapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/io.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ioapiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/jobapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/joystickapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ktmtypes.h \
+  C:/mingw64/x86_64-w64-mingw32/include/libloaderapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/limits.h \
+  C:/mingw64/x86_64-w64-mingw32/include/lzexpand.h \
+  C:/mingw64/x86_64-w64-mingw32/include/malloc.h \
+  C:/mingw64/x86_64-w64-mingw32/include/mciapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/mcx.h \
+  C:/mingw64/x86_64-w64-mingw32/include/memoryapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/minwinbase.h \
+  C:/mingw64/x86_64-w64-mingw32/include/minwindef.h \
+  C:/mingw64/x86_64-w64-mingw32/include/mmeapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/mmiscapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/mmiscapi2.h \
+  C:/mingw64/x86_64-w64-mingw32/include/mmsyscom.h \
+  C:/mingw64/x86_64-w64-mingw32/include/mmsystem.h \
+  C:/mingw64/x86_64-w64-mingw32/include/mstcpip.h \
+  C:/mingw64/x86_64-w64-mingw32/include/msxml.h \
+  C:/mingw64/x86_64-w64-mingw32/include/namedpipeapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/namespaceapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/nb30.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ncrypt.h \
+  C:/mingw64/x86_64-w64-mingw32/include/oaidl.h \
+  C:/mingw64/x86_64-w64-mingw32/include/objbase.h \
+  C:/mingw64/x86_64-w64-mingw32/include/objidl.h \
+  C:/mingw64/x86_64-w64-mingw32/include/objidlbase.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ole2.h \
+  C:/mingw64/x86_64-w64-mingw32/include/oleauto.h \
+  C:/mingw64/x86_64-w64-mingw32/include/oleidl.h \
+  C:/mingw64/x86_64-w64-mingw32/include/playsoundapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/poppack.h \
+  C:/mingw64/x86_64-w64-mingw32/include/process.h \
+  C:/mingw64/x86_64-w64-mingw32/include/processenv.h \
+  C:/mingw64/x86_64-w64-mingw32/include/processthreadsapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/processtopologyapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/profileapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/propidl.h \
+  C:/mingw64/x86_64-w64-mingw32/include/prsht.h \
+  C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_fd_types.h \
+  C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ip_mreq1.h \
+  C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ip_types.h \
+  C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_socket_types.h \
+  C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ws1_undef.h \
+  C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_wsa_errnos.h \
+  C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_wsadata.h \
+  C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/intrin-impl.h \
+  C:/mingw64/x86_64-w64-mingw32/include/pshpack1.h \
+  C:/mingw64/x86_64-w64-mingw32/include/pshpack2.h \
+  C:/mingw64/x86_64-w64-mingw32/include/pshpack4.h \
+  C:/mingw64/x86_64-w64-mingw32/include/pshpack8.h \
+  C:/mingw64/x86_64-w64-mingw32/include/pthread_time.h \
+  C:/mingw64/x86_64-w64-mingw32/include/pthread_unistd.h \
+  C:/mingw64/x86_64-w64-mingw32/include/qos.h \
+  C:/mingw64/x86_64-w64-mingw32/include/realtimeapiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/reason.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpc.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpcasync.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpcdce.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpcdcep.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpcndr.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpcnsi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpcnsip.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpcnterr.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpcsal.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sal.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sdkddkver.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sdks/_mingw_ddk.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sec_api/stdio_s.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sec_api/stdlib_s.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sec_api/stralign_s.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sec_api/string_s.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sec_api/sys/timeb_s.h \
+  C:/mingw64/x86_64-w64-mingw32/include/securityappcontainer.h \
+  C:/mingw64/x86_64-w64-mingw32/include/securitybaseapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/servprov.h \
+  C:/mingw64/x86_64-w64-mingw32/include/shellapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/specstrings.h \
+  C:/mingw64/x86_64-w64-mingw32/include/stdarg.h \
+  C:/mingw64/x86_64-w64-mingw32/include/stddef.h \
+  C:/mingw64/x86_64-w64-mingw32/include/stdint.h \
+  C:/mingw64/x86_64-w64-mingw32/include/stdio.h \
+  C:/mingw64/x86_64-w64-mingw32/include/stdlib.h \
+  C:/mingw64/x86_64-w64-mingw32/include/stralign.h \
+  C:/mingw64/x86_64-w64-mingw32/include/string.h \
+  C:/mingw64/x86_64-w64-mingw32/include/stringapiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/swprintf.inl \
+  C:/mingw64/x86_64-w64-mingw32/include/synchapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sys/timeb.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sys/types.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sysinfoapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/systemtopologyapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/threadpoolapiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/threadpoollegacyapiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/time.h \
+  C:/mingw64/x86_64-w64-mingw32/include/timeapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/timezoneapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/tvout.h \
+  C:/mingw64/x86_64-w64-mingw32/include/unistd.h \
+  C:/mingw64/x86_64-w64-mingw32/include/unknwn.h \
+  C:/mingw64/x86_64-w64-mingw32/include/unknwnbase.h \
+  C:/mingw64/x86_64-w64-mingw32/include/urlmon.h \
+  C:/mingw64/x86_64-w64-mingw32/include/utilapiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/vadefs.h \
+  C:/mingw64/x86_64-w64-mingw32/include/virtdisk.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winapifamily.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winbase.h \
+  C:/mingw64/x86_64-w64-mingw32/include/wincon.h \
+  C:/mingw64/x86_64-w64-mingw32/include/wincrypt.h \
+  C:/mingw64/x86_64-w64-mingw32/include/windef.h \
+  C:/mingw64/x86_64-w64-mingw32/include/windows.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winefs.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winerror.h \
+  C:/mingw64/x86_64-w64-mingw32/include/wingdi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winioctl.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winnetwk.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winnls.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winnt.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winperf.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winreg.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winscard.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winsmcrd.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winsock.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winsock2.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winspool.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winsvc.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winuser.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winver.h \
+  C:/mingw64/x86_64-w64-mingw32/include/wnnc.h \
+  C:/mingw64/x86_64-w64-mingw32/include/wow64apiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ws2def.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ws2ipdef.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ws2tcpip.h \
+  C:/mingw64/x86_64-w64-mingw32/include/wtypes.h \
+  C:/mingw64/x86_64-w64-mingw32/include/wtypesbase.h \
+  include/tls1_3.h \
+  include/tls_certs.h \
+  include/tls_octads.h \
+  include/tls_sockets.h
+
+CMakeFiles/tiitls.dir/lib/tls_client_recv.cpp.obj: lib/tls_client_recv.cpp \
+  C:/mingw64/include/c++/13.2.0/bits/std_abs.h \
+  C:/mingw64/include/c++/13.2.0/cstdlib \
+  C:/mingw64/include/c++/13.2.0/pstl/pstl_config.h \
+  C:/mingw64/include/c++/13.2.0/stdlib.h \
+  C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/c++config.h \
+  C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/cpu_defines.h \
+  C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/os_defines.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/adxintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/ammintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxbf16intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxcomplexintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxfp16intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxint8intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxtileintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx2intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx5124fmapsintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx5124vnniwintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bf16intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bf16vlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bitalgintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bwintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512cdintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512dqintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512erintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fp16intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fp16vlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512ifmaintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512ifmavlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512pfintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmi2intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmi2vlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmiintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmivlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vlbwintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vldqintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vnniintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vnnivlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vp2intersectintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vp2intersectvlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vpopcntdqintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vpopcntdqvlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxifmaintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxneconvertintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxvnniint8intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxvnniintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/bmi2intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/bmiintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cetintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cldemoteintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clflushoptintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clwbintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clzerointrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cmpccxaddintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/emmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/enqcmdintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/f16cintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fma4intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fmaintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fxsrintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/gfniintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/hresetintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/ia32intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/immintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/keylockerintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/limits.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/lwpintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/lzcntintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mm3dnow.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mm_malloc.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/movdirintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mwaitintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mwaitxintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pconfigintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pkuintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pmmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/popcntintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/prfchiintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/prfchwintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/raointintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/rdseedintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/rtmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/serializeintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/sgxintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/shaintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/smmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stdarg.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stddef.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stdint.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/syslimits.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tbmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tmmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tsxldtrkintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/uintrintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/vaesintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/vpclmulqdqintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/waitpkgintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/wbnoinvdintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/wmmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/x86gprintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/x86intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xmmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xopintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsavecintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsaveintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsaveoptintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsavesintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xtestintrin.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_bsd_types.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_mingw.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_mingw_mac.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_mingw_off_t.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_mingw_secapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_mingw_stdarg.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_mingw_unicode.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_timeval.h \
+  C:/mingw64/x86_64-w64-mingw32/include/afunix.h \
+  C:/mingw64/x86_64-w64-mingw32/include/apiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/apisetcconv.h \
+  C:/mingw64/x86_64-w64-mingw32/include/basetsd.h \
+  C:/mingw64/x86_64-w64-mingw32/include/bcrypt.h \
+  C:/mingw64/x86_64-w64-mingw32/include/bemapiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/cderr.h \
+  C:/mingw64/x86_64-w64-mingw32/include/cguid.h \
+  C:/mingw64/x86_64-w64-mingw32/include/combaseapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/commdlg.h \
+  C:/mingw64/x86_64-w64-mingw32/include/concurrencysal.h \
+  C:/mingw64/x86_64-w64-mingw32/include/corecrt.h \
+  C:/mingw64/x86_64-w64-mingw32/include/corecrt_startup.h \
+  C:/mingw64/x86_64-w64-mingw32/include/corecrt_stdio_config.h \
+  C:/mingw64/x86_64-w64-mingw32/include/corecrt_wstdlib.h \
+  C:/mingw64/x86_64-w64-mingw32/include/crtdefs.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ctype.h \
+  C:/mingw64/x86_64-w64-mingw32/include/datetimeapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/dde.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ddeml.h \
+  C:/mingw64/x86_64-w64-mingw32/include/debugapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/dlgs.h \
+  C:/mingw64/x86_64-w64-mingw32/include/dpapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/driverspecs.h \
+  C:/mingw64/x86_64-w64-mingw32/include/errhandlingapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/errno.h \
+  C:/mingw64/x86_64-w64-mingw32/include/excpt.h \
+  C:/mingw64/x86_64-w64-mingw32/include/fibersapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/fileapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/fltwinerror.h \
+  C:/mingw64/x86_64-w64-mingw32/include/getopt.h \
+  C:/mingw64/x86_64-w64-mingw32/include/guiddef.h \
+  C:/mingw64/x86_64-w64-mingw32/include/handleapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/heapapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/imm.h \
+  C:/mingw64/x86_64-w64-mingw32/include/in6addr.h \
+  C:/mingw64/x86_64-w64-mingw32/include/inaddr.h \
+  C:/mingw64/x86_64-w64-mingw32/include/interlockedapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/io.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ioapiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/jobapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/joystickapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ktmtypes.h \
+  C:/mingw64/x86_64-w64-mingw32/include/libloaderapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/limits.h \
+  C:/mingw64/x86_64-w64-mingw32/include/lzexpand.h \
+  C:/mingw64/x86_64-w64-mingw32/include/malloc.h \
+  C:/mingw64/x86_64-w64-mingw32/include/mciapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/mcx.h \
+  C:/mingw64/x86_64-w64-mingw32/include/memoryapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/minwinbase.h \
+  C:/mingw64/x86_64-w64-mingw32/include/minwindef.h \
+  C:/mingw64/x86_64-w64-mingw32/include/mmeapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/mmiscapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/mmiscapi2.h \
+  C:/mingw64/x86_64-w64-mingw32/include/mmsyscom.h \
+  C:/mingw64/x86_64-w64-mingw32/include/mmsystem.h \
+  C:/mingw64/x86_64-w64-mingw32/include/mstcpip.h \
+  C:/mingw64/x86_64-w64-mingw32/include/msxml.h \
+  C:/mingw64/x86_64-w64-mingw32/include/namedpipeapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/namespaceapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/nb30.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ncrypt.h \
+  C:/mingw64/x86_64-w64-mingw32/include/oaidl.h \
+  C:/mingw64/x86_64-w64-mingw32/include/objbase.h \
+  C:/mingw64/x86_64-w64-mingw32/include/objidl.h \
+  C:/mingw64/x86_64-w64-mingw32/include/objidlbase.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ole2.h \
+  C:/mingw64/x86_64-w64-mingw32/include/oleauto.h \
+  C:/mingw64/x86_64-w64-mingw32/include/oleidl.h \
+  C:/mingw64/x86_64-w64-mingw32/include/playsoundapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/poppack.h \
+  C:/mingw64/x86_64-w64-mingw32/include/process.h \
+  C:/mingw64/x86_64-w64-mingw32/include/processenv.h \
+  C:/mingw64/x86_64-w64-mingw32/include/processthreadsapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/processtopologyapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/profileapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/propidl.h \
+  C:/mingw64/x86_64-w64-mingw32/include/prsht.h \
+  C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_fd_types.h \
+  C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ip_mreq1.h \
+  C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ip_types.h \
+  C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_socket_types.h \
+  C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ws1_undef.h \
+  C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_wsa_errnos.h \
+  C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_wsadata.h \
+  C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/intrin-impl.h \
+  C:/mingw64/x86_64-w64-mingw32/include/pshpack1.h \
+  C:/mingw64/x86_64-w64-mingw32/include/pshpack2.h \
+  C:/mingw64/x86_64-w64-mingw32/include/pshpack4.h \
+  C:/mingw64/x86_64-w64-mingw32/include/pshpack8.h \
+  C:/mingw64/x86_64-w64-mingw32/include/pthread_time.h \
+  C:/mingw64/x86_64-w64-mingw32/include/pthread_unistd.h \
+  C:/mingw64/x86_64-w64-mingw32/include/qos.h \
+  C:/mingw64/x86_64-w64-mingw32/include/realtimeapiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/reason.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpc.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpcasync.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpcdce.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpcdcep.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpcndr.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpcnsi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpcnsip.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpcnterr.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpcsal.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sal.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sdkddkver.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sdks/_mingw_ddk.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sec_api/stdio_s.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sec_api/stdlib_s.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sec_api/stralign_s.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sec_api/string_s.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sec_api/sys/timeb_s.h \
+  C:/mingw64/x86_64-w64-mingw32/include/securityappcontainer.h \
+  C:/mingw64/x86_64-w64-mingw32/include/securitybaseapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/servprov.h \
+  C:/mingw64/x86_64-w64-mingw32/include/shellapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/specstrings.h \
+  C:/mingw64/x86_64-w64-mingw32/include/stdarg.h \
+  C:/mingw64/x86_64-w64-mingw32/include/stddef.h \
+  C:/mingw64/x86_64-w64-mingw32/include/stdint.h \
+  C:/mingw64/x86_64-w64-mingw32/include/stdio.h \
+  C:/mingw64/x86_64-w64-mingw32/include/stdlib.h \
+  C:/mingw64/x86_64-w64-mingw32/include/stralign.h \
+  C:/mingw64/x86_64-w64-mingw32/include/string.h \
+  C:/mingw64/x86_64-w64-mingw32/include/stringapiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/swprintf.inl \
+  C:/mingw64/x86_64-w64-mingw32/include/synchapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sys/timeb.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sys/types.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sysinfoapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/systemtopologyapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/threadpoolapiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/threadpoollegacyapiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/time.h \
+  C:/mingw64/x86_64-w64-mingw32/include/timeapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/timezoneapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/tvout.h \
+  C:/mingw64/x86_64-w64-mingw32/include/unistd.h \
+  C:/mingw64/x86_64-w64-mingw32/include/unknwn.h \
+  C:/mingw64/x86_64-w64-mingw32/include/unknwnbase.h \
+  C:/mingw64/x86_64-w64-mingw32/include/urlmon.h \
+  C:/mingw64/x86_64-w64-mingw32/include/utilapiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/vadefs.h \
+  C:/mingw64/x86_64-w64-mingw32/include/virtdisk.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winapifamily.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winbase.h \
+  C:/mingw64/x86_64-w64-mingw32/include/wincon.h \
+  C:/mingw64/x86_64-w64-mingw32/include/wincrypt.h \
+  C:/mingw64/x86_64-w64-mingw32/include/windef.h \
+  C:/mingw64/x86_64-w64-mingw32/include/windows.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winefs.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winerror.h \
+  C:/mingw64/x86_64-w64-mingw32/include/wingdi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winioctl.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winnetwk.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winnls.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winnt.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winperf.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winreg.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winscard.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winsmcrd.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winsock.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winsock2.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winspool.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winsvc.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winuser.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winver.h \
+  C:/mingw64/x86_64-w64-mingw32/include/wnnc.h \
+  C:/mingw64/x86_64-w64-mingw32/include/wow64apiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ws2def.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ws2ipdef.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ws2tcpip.h \
+  C:/mingw64/x86_64-w64-mingw32/include/wtypes.h \
+  C:/mingw64/x86_64-w64-mingw32/include/wtypesbase.h \
+  include/tls1_3.h \
+  include/tls_cert_chain.h \
+  include/tls_certs.h \
+  include/tls_client_recv.h \
+  include/tls_client_send.h \
+  include/tls_keys_calc.h \
+  include/tls_logger.h \
+  include/tls_octads.h \
+  include/tls_sal.h \
+  include/tls_sockets.h \
+  include/tls_x509.h
+
+CMakeFiles/tiitls.dir/lib/tls_client_send.cpp.obj: lib/tls_client_send.cpp \
+  C:/mingw64/include/c++/13.2.0/bits/std_abs.h \
+  C:/mingw64/include/c++/13.2.0/cstdlib \
+  C:/mingw64/include/c++/13.2.0/pstl/pstl_config.h \
+  C:/mingw64/include/c++/13.2.0/stdlib.h \
+  C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/c++config.h \
+  C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/cpu_defines.h \
+  C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/os_defines.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/adxintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/ammintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxbf16intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxcomplexintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxfp16intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxint8intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxtileintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx2intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx5124fmapsintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx5124vnniwintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bf16intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bf16vlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bitalgintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bwintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512cdintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512dqintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512erintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fp16intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fp16vlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512ifmaintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512ifmavlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512pfintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmi2intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmi2vlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmiintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmivlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vlbwintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vldqintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vnniintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vnnivlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vp2intersectintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vp2intersectvlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vpopcntdqintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vpopcntdqvlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxifmaintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxneconvertintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxvnniint8intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxvnniintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/bmi2intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/bmiintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cetintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cldemoteintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clflushoptintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clwbintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clzerointrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cmpccxaddintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/emmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/enqcmdintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/f16cintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fma4intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fmaintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fxsrintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/gfniintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/hresetintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/ia32intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/immintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/keylockerintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/limits.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/lwpintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/lzcntintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mm3dnow.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mm_malloc.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/movdirintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mwaitintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mwaitxintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pconfigintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pkuintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pmmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/popcntintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/prfchiintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/prfchwintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/raointintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/rdseedintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/rtmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/serializeintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/sgxintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/shaintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/smmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stdarg.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stddef.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stdint.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/syslimits.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tbmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tmmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tsxldtrkintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/uintrintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/vaesintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/vpclmulqdqintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/waitpkgintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/wbnoinvdintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/wmmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/x86gprintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/x86intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xmmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xopintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsavecintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsaveintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsaveoptintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsavesintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xtestintrin.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_bsd_types.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_mingw.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_mingw_mac.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_mingw_off_t.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_mingw_secapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_mingw_stdarg.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_mingw_unicode.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_timeval.h \
+  C:/mingw64/x86_64-w64-mingw32/include/afunix.h \
+  C:/mingw64/x86_64-w64-mingw32/include/apiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/apisetcconv.h \
+  C:/mingw64/x86_64-w64-mingw32/include/basetsd.h \
+  C:/mingw64/x86_64-w64-mingw32/include/bcrypt.h \
+  C:/mingw64/x86_64-w64-mingw32/include/bemapiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/cderr.h \
+  C:/mingw64/x86_64-w64-mingw32/include/cguid.h \
+  C:/mingw64/x86_64-w64-mingw32/include/combaseapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/commdlg.h \
+  C:/mingw64/x86_64-w64-mingw32/include/concurrencysal.h \
+  C:/mingw64/x86_64-w64-mingw32/include/corecrt.h \
+  C:/mingw64/x86_64-w64-mingw32/include/corecrt_startup.h \
+  C:/mingw64/x86_64-w64-mingw32/include/corecrt_stdio_config.h \
+  C:/mingw64/x86_64-w64-mingw32/include/corecrt_wstdlib.h \
+  C:/mingw64/x86_64-w64-mingw32/include/crtdefs.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ctype.h \
+  C:/mingw64/x86_64-w64-mingw32/include/datetimeapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/dde.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ddeml.h \
+  C:/mingw64/x86_64-w64-mingw32/include/debugapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/dlgs.h \
+  C:/mingw64/x86_64-w64-mingw32/include/dpapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/driverspecs.h \
+  C:/mingw64/x86_64-w64-mingw32/include/errhandlingapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/errno.h \
+  C:/mingw64/x86_64-w64-mingw32/include/excpt.h \
+  C:/mingw64/x86_64-w64-mingw32/include/fibersapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/fileapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/fltwinerror.h \
+  C:/mingw64/x86_64-w64-mingw32/include/getopt.h \
+  C:/mingw64/x86_64-w64-mingw32/include/guiddef.h \
+  C:/mingw64/x86_64-w64-mingw32/include/handleapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/heapapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/imm.h \
+  C:/mingw64/x86_64-w64-mingw32/include/in6addr.h \
+  C:/mingw64/x86_64-w64-mingw32/include/inaddr.h \
+  C:/mingw64/x86_64-w64-mingw32/include/interlockedapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/io.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ioapiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/jobapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/joystickapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ktmtypes.h \
+  C:/mingw64/x86_64-w64-mingw32/include/libloaderapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/limits.h \
+  C:/mingw64/x86_64-w64-mingw32/include/lzexpand.h \
+  C:/mingw64/x86_64-w64-mingw32/include/malloc.h \
+  C:/mingw64/x86_64-w64-mingw32/include/mciapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/mcx.h \
+  C:/mingw64/x86_64-w64-mingw32/include/memoryapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/minwinbase.h \
+  C:/mingw64/x86_64-w64-mingw32/include/minwindef.h \
+  C:/mingw64/x86_64-w64-mingw32/include/mmeapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/mmiscapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/mmiscapi2.h \
+  C:/mingw64/x86_64-w64-mingw32/include/mmsyscom.h \
+  C:/mingw64/x86_64-w64-mingw32/include/mmsystem.h \
+  C:/mingw64/x86_64-w64-mingw32/include/mstcpip.h \
+  C:/mingw64/x86_64-w64-mingw32/include/msxml.h \
+  C:/mingw64/x86_64-w64-mingw32/include/namedpipeapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/namespaceapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/nb30.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ncrypt.h \
+  C:/mingw64/x86_64-w64-mingw32/include/oaidl.h \
+  C:/mingw64/x86_64-w64-mingw32/include/objbase.h \
+  C:/mingw64/x86_64-w64-mingw32/include/objidl.h \
+  C:/mingw64/x86_64-w64-mingw32/include/objidlbase.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ole2.h \
+  C:/mingw64/x86_64-w64-mingw32/include/oleauto.h \
+  C:/mingw64/x86_64-w64-mingw32/include/oleidl.h \
+  C:/mingw64/x86_64-w64-mingw32/include/playsoundapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/poppack.h \
+  C:/mingw64/x86_64-w64-mingw32/include/process.h \
+  C:/mingw64/x86_64-w64-mingw32/include/processenv.h \
+  C:/mingw64/x86_64-w64-mingw32/include/processthreadsapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/processtopologyapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/profileapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/propidl.h \
+  C:/mingw64/x86_64-w64-mingw32/include/prsht.h \
+  C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_fd_types.h \
+  C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ip_mreq1.h \
+  C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ip_types.h \
+  C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_socket_types.h \
+  C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ws1_undef.h \
+  C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_wsa_errnos.h \
+  C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_wsadata.h \
+  C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/intrin-impl.h \
+  C:/mingw64/x86_64-w64-mingw32/include/pshpack1.h \
+  C:/mingw64/x86_64-w64-mingw32/include/pshpack2.h \
+  C:/mingw64/x86_64-w64-mingw32/include/pshpack4.h \
+  C:/mingw64/x86_64-w64-mingw32/include/pshpack8.h \
+  C:/mingw64/x86_64-w64-mingw32/include/pthread_time.h \
+  C:/mingw64/x86_64-w64-mingw32/include/pthread_unistd.h \
+  C:/mingw64/x86_64-w64-mingw32/include/qos.h \
+  C:/mingw64/x86_64-w64-mingw32/include/realtimeapiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/reason.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpc.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpcasync.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpcdce.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpcdcep.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpcndr.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpcnsi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpcnsip.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpcnterr.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpcsal.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sal.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sdkddkver.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sdks/_mingw_ddk.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sec_api/stdio_s.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sec_api/stdlib_s.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sec_api/stralign_s.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sec_api/string_s.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sec_api/sys/timeb_s.h \
+  C:/mingw64/x86_64-w64-mingw32/include/securityappcontainer.h \
+  C:/mingw64/x86_64-w64-mingw32/include/securitybaseapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/servprov.h \
+  C:/mingw64/x86_64-w64-mingw32/include/shellapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/specstrings.h \
+  C:/mingw64/x86_64-w64-mingw32/include/stdarg.h \
+  C:/mingw64/x86_64-w64-mingw32/include/stddef.h \
+  C:/mingw64/x86_64-w64-mingw32/include/stdint.h \
+  C:/mingw64/x86_64-w64-mingw32/include/stdio.h \
+  C:/mingw64/x86_64-w64-mingw32/include/stdlib.h \
+  C:/mingw64/x86_64-w64-mingw32/include/stralign.h \
+  C:/mingw64/x86_64-w64-mingw32/include/string.h \
+  C:/mingw64/x86_64-w64-mingw32/include/stringapiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/swprintf.inl \
+  C:/mingw64/x86_64-w64-mingw32/include/synchapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sys/timeb.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sys/types.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sysinfoapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/systemtopologyapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/threadpoolapiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/threadpoollegacyapiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/time.h \
+  C:/mingw64/x86_64-w64-mingw32/include/timeapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/timezoneapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/tvout.h \
+  C:/mingw64/x86_64-w64-mingw32/include/unistd.h \
+  C:/mingw64/x86_64-w64-mingw32/include/unknwn.h \
+  C:/mingw64/x86_64-w64-mingw32/include/unknwnbase.h \
+  C:/mingw64/x86_64-w64-mingw32/include/urlmon.h \
+  C:/mingw64/x86_64-w64-mingw32/include/utilapiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/vadefs.h \
+  C:/mingw64/x86_64-w64-mingw32/include/virtdisk.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winapifamily.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winbase.h \
+  C:/mingw64/x86_64-w64-mingw32/include/wincon.h \
+  C:/mingw64/x86_64-w64-mingw32/include/wincrypt.h \
+  C:/mingw64/x86_64-w64-mingw32/include/windef.h \
+  C:/mingw64/x86_64-w64-mingw32/include/windows.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winefs.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winerror.h \
+  C:/mingw64/x86_64-w64-mingw32/include/wingdi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winioctl.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winnetwk.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winnls.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winnt.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winperf.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winreg.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winscard.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winsmcrd.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winsock.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winsock2.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winspool.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winsvc.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winuser.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winver.h \
+  C:/mingw64/x86_64-w64-mingw32/include/wnnc.h \
+  C:/mingw64/x86_64-w64-mingw32/include/wow64apiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ws2def.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ws2ipdef.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ws2tcpip.h \
+  C:/mingw64/x86_64-w64-mingw32/include/wtypes.h \
+  C:/mingw64/x86_64-w64-mingw32/include/wtypesbase.h \
+  include/tls1_3.h \
+  include/tls_certs.h \
+  include/tls_client_recv.h \
+  include/tls_client_send.h \
+  include/tls_keys_calc.h \
+  include/tls_logger.h \
+  include/tls_octads.h \
+  include/tls_sal.h \
+  include/tls_sockets.h \
+  include/tls_x509.h
+
+CMakeFiles/tiitls.dir/lib/tls_keys_calc.cpp.obj: lib/tls_keys_calc.cpp \
+  C:/mingw64/include/c++/13.2.0/bits/std_abs.h \
+  C:/mingw64/include/c++/13.2.0/cstdlib \
+  C:/mingw64/include/c++/13.2.0/pstl/pstl_config.h \
+  C:/mingw64/include/c++/13.2.0/stdlib.h \
+  C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/c++config.h \
+  C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/cpu_defines.h \
+  C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/os_defines.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/adxintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/ammintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxbf16intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxcomplexintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxfp16intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxint8intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxtileintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx2intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx5124fmapsintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx5124vnniwintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bf16intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bf16vlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bitalgintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bwintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512cdintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512dqintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512erintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fp16intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fp16vlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512ifmaintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512ifmavlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512pfintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmi2intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmi2vlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmiintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmivlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vlbwintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vldqintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vnniintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vnnivlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vp2intersectintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vp2intersectvlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vpopcntdqintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vpopcntdqvlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxifmaintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxneconvertintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxvnniint8intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxvnniintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/bmi2intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/bmiintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cetintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cldemoteintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clflushoptintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clwbintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clzerointrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cmpccxaddintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/emmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/enqcmdintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/f16cintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fma4intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fmaintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fxsrintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/gfniintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/hresetintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/ia32intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/immintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/keylockerintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/limits.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/lwpintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/lzcntintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mm3dnow.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mm_malloc.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/movdirintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mwaitintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mwaitxintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pconfigintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pkuintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pmmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/popcntintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/prfchiintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/prfchwintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/raointintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/rdseedintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/rtmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/serializeintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/sgxintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/shaintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/smmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stdarg.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stddef.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stdint.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/syslimits.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tbmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tmmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tsxldtrkintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/uintrintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/vaesintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/vpclmulqdqintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/waitpkgintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/wbnoinvdintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/wmmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/x86gprintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/x86intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xmmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xopintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsavecintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsaveintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsaveoptintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsavesintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xtestintrin.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_bsd_types.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_mingw.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_mingw_mac.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_mingw_off_t.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_mingw_secapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_mingw_stdarg.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_mingw_unicode.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_timeval.h \
+  C:/mingw64/x86_64-w64-mingw32/include/afunix.h \
+  C:/mingw64/x86_64-w64-mingw32/include/apiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/apisetcconv.h \
+  C:/mingw64/x86_64-w64-mingw32/include/basetsd.h \
+  C:/mingw64/x86_64-w64-mingw32/include/bcrypt.h \
+  C:/mingw64/x86_64-w64-mingw32/include/bemapiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/cderr.h \
+  C:/mingw64/x86_64-w64-mingw32/include/cguid.h \
+  C:/mingw64/x86_64-w64-mingw32/include/combaseapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/commdlg.h \
+  C:/mingw64/x86_64-w64-mingw32/include/concurrencysal.h \
+  C:/mingw64/x86_64-w64-mingw32/include/corecrt.h \
+  C:/mingw64/x86_64-w64-mingw32/include/corecrt_startup.h \
+  C:/mingw64/x86_64-w64-mingw32/include/corecrt_stdio_config.h \
+  C:/mingw64/x86_64-w64-mingw32/include/corecrt_wstdlib.h \
+  C:/mingw64/x86_64-w64-mingw32/include/crtdefs.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ctype.h \
+  C:/mingw64/x86_64-w64-mingw32/include/datetimeapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/dde.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ddeml.h \
+  C:/mingw64/x86_64-w64-mingw32/include/debugapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/dlgs.h \
+  C:/mingw64/x86_64-w64-mingw32/include/dpapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/driverspecs.h \
+  C:/mingw64/x86_64-w64-mingw32/include/errhandlingapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/errno.h \
+  C:/mingw64/x86_64-w64-mingw32/include/excpt.h \
+  C:/mingw64/x86_64-w64-mingw32/include/fibersapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/fileapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/fltwinerror.h \
+  C:/mingw64/x86_64-w64-mingw32/include/getopt.h \
+  C:/mingw64/x86_64-w64-mingw32/include/guiddef.h \
+  C:/mingw64/x86_64-w64-mingw32/include/handleapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/heapapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/imm.h \
+  C:/mingw64/x86_64-w64-mingw32/include/in6addr.h \
+  C:/mingw64/x86_64-w64-mingw32/include/inaddr.h \
+  C:/mingw64/x86_64-w64-mingw32/include/interlockedapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/io.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ioapiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/jobapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/joystickapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ktmtypes.h \
+  C:/mingw64/x86_64-w64-mingw32/include/libloaderapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/limits.h \
+  C:/mingw64/x86_64-w64-mingw32/include/lzexpand.h \
+  C:/mingw64/x86_64-w64-mingw32/include/malloc.h \
+  C:/mingw64/x86_64-w64-mingw32/include/mciapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/mcx.h \
+  C:/mingw64/x86_64-w64-mingw32/include/memoryapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/minwinbase.h \
+  C:/mingw64/x86_64-w64-mingw32/include/minwindef.h \
+  C:/mingw64/x86_64-w64-mingw32/include/mmeapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/mmiscapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/mmiscapi2.h \
+  C:/mingw64/x86_64-w64-mingw32/include/mmsyscom.h \
+  C:/mingw64/x86_64-w64-mingw32/include/mmsystem.h \
+  C:/mingw64/x86_64-w64-mingw32/include/mstcpip.h \
+  C:/mingw64/x86_64-w64-mingw32/include/msxml.h \
+  C:/mingw64/x86_64-w64-mingw32/include/namedpipeapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/namespaceapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/nb30.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ncrypt.h \
+  C:/mingw64/x86_64-w64-mingw32/include/oaidl.h \
+  C:/mingw64/x86_64-w64-mingw32/include/objbase.h \
+  C:/mingw64/x86_64-w64-mingw32/include/objidl.h \
+  C:/mingw64/x86_64-w64-mingw32/include/objidlbase.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ole2.h \
+  C:/mingw64/x86_64-w64-mingw32/include/oleauto.h \
+  C:/mingw64/x86_64-w64-mingw32/include/oleidl.h \
+  C:/mingw64/x86_64-w64-mingw32/include/playsoundapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/poppack.h \
+  C:/mingw64/x86_64-w64-mingw32/include/process.h \
+  C:/mingw64/x86_64-w64-mingw32/include/processenv.h \
+  C:/mingw64/x86_64-w64-mingw32/include/processthreadsapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/processtopologyapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/profileapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/propidl.h \
+  C:/mingw64/x86_64-w64-mingw32/include/prsht.h \
+  C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_fd_types.h \
+  C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ip_mreq1.h \
+  C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ip_types.h \
+  C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_socket_types.h \
+  C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ws1_undef.h \
+  C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_wsa_errnos.h \
+  C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_wsadata.h \
+  C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/intrin-impl.h \
+  C:/mingw64/x86_64-w64-mingw32/include/pshpack1.h \
+  C:/mingw64/x86_64-w64-mingw32/include/pshpack2.h \
+  C:/mingw64/x86_64-w64-mingw32/include/pshpack4.h \
+  C:/mingw64/x86_64-w64-mingw32/include/pshpack8.h \
+  C:/mingw64/x86_64-w64-mingw32/include/pthread_time.h \
+  C:/mingw64/x86_64-w64-mingw32/include/pthread_unistd.h \
+  C:/mingw64/x86_64-w64-mingw32/include/qos.h \
+  C:/mingw64/x86_64-w64-mingw32/include/realtimeapiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/reason.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpc.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpcasync.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpcdce.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpcdcep.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpcndr.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpcnsi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpcnsip.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpcnterr.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpcsal.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sal.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sdkddkver.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sdks/_mingw_ddk.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sec_api/stdio_s.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sec_api/stdlib_s.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sec_api/stralign_s.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sec_api/string_s.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sec_api/sys/timeb_s.h \
+  C:/mingw64/x86_64-w64-mingw32/include/securityappcontainer.h \
+  C:/mingw64/x86_64-w64-mingw32/include/securitybaseapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/servprov.h \
+  C:/mingw64/x86_64-w64-mingw32/include/shellapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/specstrings.h \
+  C:/mingw64/x86_64-w64-mingw32/include/stdarg.h \
+  C:/mingw64/x86_64-w64-mingw32/include/stddef.h \
+  C:/mingw64/x86_64-w64-mingw32/include/stdint.h \
+  C:/mingw64/x86_64-w64-mingw32/include/stdio.h \
+  C:/mingw64/x86_64-w64-mingw32/include/stdlib.h \
+  C:/mingw64/x86_64-w64-mingw32/include/stralign.h \
+  C:/mingw64/x86_64-w64-mingw32/include/string.h \
+  C:/mingw64/x86_64-w64-mingw32/include/stringapiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/swprintf.inl \
+  C:/mingw64/x86_64-w64-mingw32/include/synchapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sys/timeb.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sys/types.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sysinfoapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/systemtopologyapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/threadpoolapiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/threadpoollegacyapiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/time.h \
+  C:/mingw64/x86_64-w64-mingw32/include/timeapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/timezoneapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/tvout.h \
+  C:/mingw64/x86_64-w64-mingw32/include/unistd.h \
+  C:/mingw64/x86_64-w64-mingw32/include/unknwn.h \
+  C:/mingw64/x86_64-w64-mingw32/include/unknwnbase.h \
+  C:/mingw64/x86_64-w64-mingw32/include/urlmon.h \
+  C:/mingw64/x86_64-w64-mingw32/include/utilapiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/vadefs.h \
+  C:/mingw64/x86_64-w64-mingw32/include/virtdisk.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winapifamily.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winbase.h \
+  C:/mingw64/x86_64-w64-mingw32/include/wincon.h \
+  C:/mingw64/x86_64-w64-mingw32/include/wincrypt.h \
+  C:/mingw64/x86_64-w64-mingw32/include/windef.h \
+  C:/mingw64/x86_64-w64-mingw32/include/windows.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winefs.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winerror.h \
+  C:/mingw64/x86_64-w64-mingw32/include/wingdi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winioctl.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winnetwk.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winnls.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winnt.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winperf.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winreg.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winscard.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winsmcrd.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winsock.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winsock2.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winspool.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winsvc.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winuser.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winver.h \
+  C:/mingw64/x86_64-w64-mingw32/include/wnnc.h \
+  C:/mingw64/x86_64-w64-mingw32/include/wow64apiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ws2def.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ws2ipdef.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ws2tcpip.h \
+  C:/mingw64/x86_64-w64-mingw32/include/wtypes.h \
+  C:/mingw64/x86_64-w64-mingw32/include/wtypesbase.h \
+  include/tls1_3.h \
+  include/tls_client_recv.h \
+  include/tls_client_send.h \
+  include/tls_keys_calc.h \
+  include/tls_logger.h \
+  include/tls_octads.h \
+  include/tls_sal.h \
+  include/tls_sockets.h \
+  include/tls_x509.h
+
+CMakeFiles/tiitls.dir/lib/tls_logger.cpp.obj: lib/tls_logger.cpp \
+  C:/mingw64/include/c++/13.2.0/bits/std_abs.h \
+  C:/mingw64/include/c++/13.2.0/cstdlib \
+  C:/mingw64/include/c++/13.2.0/pstl/pstl_config.h \
+  C:/mingw64/include/c++/13.2.0/stdlib.h \
+  C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/c++config.h \
+  C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/cpu_defines.h \
+  C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/os_defines.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/adxintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/ammintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxbf16intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxcomplexintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxfp16intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxint8intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxtileintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx2intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx5124fmapsintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx5124vnniwintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bf16intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bf16vlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bitalgintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bwintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512cdintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512dqintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512erintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fp16intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fp16vlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512ifmaintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512ifmavlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512pfintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmi2intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmi2vlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmiintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmivlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vlbwintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vldqintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vnniintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vnnivlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vp2intersectintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vp2intersectvlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vpopcntdqintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vpopcntdqvlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxifmaintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxneconvertintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxvnniint8intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxvnniintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/bmi2intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/bmiintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cetintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cldemoteintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clflushoptintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clwbintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clzerointrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cmpccxaddintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/emmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/enqcmdintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/f16cintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fma4intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fmaintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fxsrintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/gfniintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/hresetintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/ia32intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/immintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/keylockerintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/limits.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/lwpintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/lzcntintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mm3dnow.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mm_malloc.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/movdirintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mwaitintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mwaitxintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pconfigintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pkuintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pmmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/popcntintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/prfchiintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/prfchwintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/raointintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/rdseedintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/rtmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/serializeintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/sgxintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/shaintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/smmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stdarg.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stddef.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stdint.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/syslimits.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tbmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tmmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tsxldtrkintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/uintrintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/vaesintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/vpclmulqdqintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/waitpkgintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/wbnoinvdintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/wmmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/x86gprintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/x86intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xmmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xopintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsavecintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsaveintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsaveoptintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsavesintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xtestintrin.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_bsd_types.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_mingw.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_mingw_mac.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_mingw_off_t.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_mingw_secapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_mingw_stdarg.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_mingw_unicode.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_timeval.h \
+  C:/mingw64/x86_64-w64-mingw32/include/afunix.h \
+  C:/mingw64/x86_64-w64-mingw32/include/apiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/apisetcconv.h \
+  C:/mingw64/x86_64-w64-mingw32/include/basetsd.h \
+  C:/mingw64/x86_64-w64-mingw32/include/bcrypt.h \
+  C:/mingw64/x86_64-w64-mingw32/include/bemapiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/cderr.h \
+  C:/mingw64/x86_64-w64-mingw32/include/cguid.h \
+  C:/mingw64/x86_64-w64-mingw32/include/combaseapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/commdlg.h \
+  C:/mingw64/x86_64-w64-mingw32/include/concurrencysal.h \
+  C:/mingw64/x86_64-w64-mingw32/include/corecrt.h \
+  C:/mingw64/x86_64-w64-mingw32/include/corecrt_startup.h \
+  C:/mingw64/x86_64-w64-mingw32/include/corecrt_stdio_config.h \
+  C:/mingw64/x86_64-w64-mingw32/include/corecrt_wstdlib.h \
+  C:/mingw64/x86_64-w64-mingw32/include/crtdefs.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ctype.h \
+  C:/mingw64/x86_64-w64-mingw32/include/datetimeapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/dde.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ddeml.h \
+  C:/mingw64/x86_64-w64-mingw32/include/debugapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/dlgs.h \
+  C:/mingw64/x86_64-w64-mingw32/include/dpapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/driverspecs.h \
+  C:/mingw64/x86_64-w64-mingw32/include/errhandlingapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/errno.h \
+  C:/mingw64/x86_64-w64-mingw32/include/excpt.h \
+  C:/mingw64/x86_64-w64-mingw32/include/fibersapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/fileapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/fltwinerror.h \
+  C:/mingw64/x86_64-w64-mingw32/include/getopt.h \
+  C:/mingw64/x86_64-w64-mingw32/include/guiddef.h \
+  C:/mingw64/x86_64-w64-mingw32/include/handleapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/heapapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/imm.h \
+  C:/mingw64/x86_64-w64-mingw32/include/in6addr.h \
+  C:/mingw64/x86_64-w64-mingw32/include/inaddr.h \
+  C:/mingw64/x86_64-w64-mingw32/include/interlockedapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/io.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ioapiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/jobapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/joystickapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ktmtypes.h \
+  C:/mingw64/x86_64-w64-mingw32/include/libloaderapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/limits.h \
+  C:/mingw64/x86_64-w64-mingw32/include/lzexpand.h \
+  C:/mingw64/x86_64-w64-mingw32/include/malloc.h \
+  C:/mingw64/x86_64-w64-mingw32/include/mciapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/mcx.h \
+  C:/mingw64/x86_64-w64-mingw32/include/memoryapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/minwinbase.h \
+  C:/mingw64/x86_64-w64-mingw32/include/minwindef.h \
+  C:/mingw64/x86_64-w64-mingw32/include/mmeapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/mmiscapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/mmiscapi2.h \
+  C:/mingw64/x86_64-w64-mingw32/include/mmsyscom.h \
+  C:/mingw64/x86_64-w64-mingw32/include/mmsystem.h \
+  C:/mingw64/x86_64-w64-mingw32/include/mstcpip.h \
+  C:/mingw64/x86_64-w64-mingw32/include/msxml.h \
+  C:/mingw64/x86_64-w64-mingw32/include/namedpipeapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/namespaceapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/nb30.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ncrypt.h \
+  C:/mingw64/x86_64-w64-mingw32/include/oaidl.h \
+  C:/mingw64/x86_64-w64-mingw32/include/objbase.h \
+  C:/mingw64/x86_64-w64-mingw32/include/objidl.h \
+  C:/mingw64/x86_64-w64-mingw32/include/objidlbase.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ole2.h \
+  C:/mingw64/x86_64-w64-mingw32/include/oleauto.h \
+  C:/mingw64/x86_64-w64-mingw32/include/oleidl.h \
+  C:/mingw64/x86_64-w64-mingw32/include/playsoundapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/poppack.h \
+  C:/mingw64/x86_64-w64-mingw32/include/process.h \
+  C:/mingw64/x86_64-w64-mingw32/include/processenv.h \
+  C:/mingw64/x86_64-w64-mingw32/include/processthreadsapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/processtopologyapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/profileapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/propidl.h \
+  C:/mingw64/x86_64-w64-mingw32/include/prsht.h \
+  C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_fd_types.h \
+  C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ip_mreq1.h \
+  C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ip_types.h \
+  C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_socket_types.h \
+  C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ws1_undef.h \
+  C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_wsa_errnos.h \
+  C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_wsadata.h \
+  C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/intrin-impl.h \
+  C:/mingw64/x86_64-w64-mingw32/include/pshpack1.h \
+  C:/mingw64/x86_64-w64-mingw32/include/pshpack2.h \
+  C:/mingw64/x86_64-w64-mingw32/include/pshpack4.h \
+  C:/mingw64/x86_64-w64-mingw32/include/pshpack8.h \
+  C:/mingw64/x86_64-w64-mingw32/include/pthread_time.h \
+  C:/mingw64/x86_64-w64-mingw32/include/pthread_unistd.h \
+  C:/mingw64/x86_64-w64-mingw32/include/qos.h \
+  C:/mingw64/x86_64-w64-mingw32/include/realtimeapiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/reason.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpc.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpcasync.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpcdce.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpcdcep.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpcndr.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpcnsi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpcnsip.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpcnterr.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpcsal.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sal.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sdkddkver.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sdks/_mingw_ddk.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sec_api/stdio_s.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sec_api/stdlib_s.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sec_api/stralign_s.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sec_api/string_s.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sec_api/sys/timeb_s.h \
+  C:/mingw64/x86_64-w64-mingw32/include/securityappcontainer.h \
+  C:/mingw64/x86_64-w64-mingw32/include/securitybaseapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/servprov.h \
+  C:/mingw64/x86_64-w64-mingw32/include/shellapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/specstrings.h \
+  C:/mingw64/x86_64-w64-mingw32/include/stdarg.h \
+  C:/mingw64/x86_64-w64-mingw32/include/stddef.h \
+  C:/mingw64/x86_64-w64-mingw32/include/stdint.h \
+  C:/mingw64/x86_64-w64-mingw32/include/stdio.h \
+  C:/mingw64/x86_64-w64-mingw32/include/stdlib.h \
+  C:/mingw64/x86_64-w64-mingw32/include/stralign.h \
+  C:/mingw64/x86_64-w64-mingw32/include/string.h \
+  C:/mingw64/x86_64-w64-mingw32/include/stringapiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/swprintf.inl \
+  C:/mingw64/x86_64-w64-mingw32/include/synchapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sys/timeb.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sys/types.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sysinfoapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/systemtopologyapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/threadpoolapiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/threadpoollegacyapiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/time.h \
+  C:/mingw64/x86_64-w64-mingw32/include/timeapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/timezoneapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/tvout.h \
+  C:/mingw64/x86_64-w64-mingw32/include/unistd.h \
+  C:/mingw64/x86_64-w64-mingw32/include/unknwn.h \
+  C:/mingw64/x86_64-w64-mingw32/include/unknwnbase.h \
+  C:/mingw64/x86_64-w64-mingw32/include/urlmon.h \
+  C:/mingw64/x86_64-w64-mingw32/include/utilapiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/vadefs.h \
+  C:/mingw64/x86_64-w64-mingw32/include/virtdisk.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winapifamily.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winbase.h \
+  C:/mingw64/x86_64-w64-mingw32/include/wincon.h \
+  C:/mingw64/x86_64-w64-mingw32/include/wincrypt.h \
+  C:/mingw64/x86_64-w64-mingw32/include/windef.h \
+  C:/mingw64/x86_64-w64-mingw32/include/windows.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winefs.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winerror.h \
+  C:/mingw64/x86_64-w64-mingw32/include/wingdi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winioctl.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winnetwk.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winnls.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winnt.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winperf.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winreg.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winscard.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winsmcrd.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winsock.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winsock2.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winspool.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winsvc.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winuser.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winver.h \
+  C:/mingw64/x86_64-w64-mingw32/include/wnnc.h \
+  C:/mingw64/x86_64-w64-mingw32/include/wow64apiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ws2def.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ws2ipdef.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ws2tcpip.h \
+  C:/mingw64/x86_64-w64-mingw32/include/wtypes.h \
+  C:/mingw64/x86_64-w64-mingw32/include/wtypesbase.h \
+  include/tls1_3.h \
+  include/tls_logger.h \
+  include/tls_octads.h \
+  include/tls_sockets.h \
+  include/tls_x509.h
+
+CMakeFiles/tiitls.dir/lib/tls_octads.cpp.obj: lib/tls_octads.cpp \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stddef.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_mingw.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_mingw_mac.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_mingw_secapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_timeval.h \
+  C:/mingw64/x86_64-w64-mingw32/include/corecrt.h \
+  C:/mingw64/x86_64-w64-mingw32/include/crtdefs.h \
+  C:/mingw64/x86_64-w64-mingw32/include/pthread_time.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sdks/_mingw_ddk.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sec_api/sys/timeb_s.h \
+  C:/mingw64/x86_64-w64-mingw32/include/stddef.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sys/time.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sys/timeb.h \
+  C:/mingw64/x86_64-w64-mingw32/include/time.h \
+  C:/mingw64/x86_64-w64-mingw32/include/vadefs.h \
+  include/tls_octads.h
+
+CMakeFiles/tiitls.dir/lib/tls_protocol.cpp.obj: lib/tls_protocol.cpp \
+  C:/mingw64/include/c++/13.2.0/bits/std_abs.h \
+  C:/mingw64/include/c++/13.2.0/cstdlib \
+  C:/mingw64/include/c++/13.2.0/pstl/pstl_config.h \
+  C:/mingw64/include/c++/13.2.0/stdlib.h \
+  C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/c++config.h \
+  C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/cpu_defines.h \
+  C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/os_defines.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/adxintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/ammintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxbf16intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxcomplexintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxfp16intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxint8intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxtileintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx2intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx5124fmapsintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx5124vnniwintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bf16intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bf16vlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bitalgintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bwintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512cdintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512dqintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512erintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fp16intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fp16vlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512ifmaintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512ifmavlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512pfintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmi2intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmi2vlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmiintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmivlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vlbwintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vldqintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vnniintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vnnivlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vp2intersectintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vp2intersectvlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vpopcntdqintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vpopcntdqvlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxifmaintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxneconvertintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxvnniint8intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxvnniintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/bmi2intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/bmiintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cetintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cldemoteintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clflushoptintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clwbintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clzerointrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cmpccxaddintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/emmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/enqcmdintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/f16cintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fma4intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fmaintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fxsrintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/gfniintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/hresetintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/ia32intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/immintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/keylockerintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/limits.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/lwpintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/lzcntintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mm3dnow.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mm_malloc.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/movdirintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mwaitintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mwaitxintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pconfigintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pkuintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pmmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/popcntintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/prfchiintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/prfchwintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/raointintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/rdseedintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/rtmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/serializeintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/sgxintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/shaintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/smmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stdarg.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stddef.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stdint.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/syslimits.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tbmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tmmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tsxldtrkintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/uintrintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/vaesintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/vpclmulqdqintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/waitpkgintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/wbnoinvdintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/wmmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/x86gprintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/x86intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xmmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xopintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsavecintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsaveintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsaveoptintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsavesintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xtestintrin.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_bsd_types.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_mingw.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_mingw_mac.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_mingw_off_t.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_mingw_secapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_mingw_stdarg.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_mingw_unicode.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_timeval.h \
+  C:/mingw64/x86_64-w64-mingw32/include/afunix.h \
+  C:/mingw64/x86_64-w64-mingw32/include/apiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/apisetcconv.h \
+  C:/mingw64/x86_64-w64-mingw32/include/basetsd.h \
+  C:/mingw64/x86_64-w64-mingw32/include/bcrypt.h \
+  C:/mingw64/x86_64-w64-mingw32/include/bemapiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/cderr.h \
+  C:/mingw64/x86_64-w64-mingw32/include/cguid.h \
+  C:/mingw64/x86_64-w64-mingw32/include/combaseapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/commdlg.h \
+  C:/mingw64/x86_64-w64-mingw32/include/concurrencysal.h \
+  C:/mingw64/x86_64-w64-mingw32/include/corecrt.h \
+  C:/mingw64/x86_64-w64-mingw32/include/corecrt_startup.h \
+  C:/mingw64/x86_64-w64-mingw32/include/corecrt_stdio_config.h \
+  C:/mingw64/x86_64-w64-mingw32/include/corecrt_wstdlib.h \
+  C:/mingw64/x86_64-w64-mingw32/include/crtdefs.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ctype.h \
+  C:/mingw64/x86_64-w64-mingw32/include/datetimeapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/dde.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ddeml.h \
+  C:/mingw64/x86_64-w64-mingw32/include/debugapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/dlgs.h \
+  C:/mingw64/x86_64-w64-mingw32/include/dpapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/driverspecs.h \
+  C:/mingw64/x86_64-w64-mingw32/include/errhandlingapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/errno.h \
+  C:/mingw64/x86_64-w64-mingw32/include/excpt.h \
+  C:/mingw64/x86_64-w64-mingw32/include/fibersapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/fileapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/fltwinerror.h \
+  C:/mingw64/x86_64-w64-mingw32/include/getopt.h \
+  C:/mingw64/x86_64-w64-mingw32/include/guiddef.h \
+  C:/mingw64/x86_64-w64-mingw32/include/handleapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/heapapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/imm.h \
+  C:/mingw64/x86_64-w64-mingw32/include/in6addr.h \
+  C:/mingw64/x86_64-w64-mingw32/include/inaddr.h \
+  C:/mingw64/x86_64-w64-mingw32/include/interlockedapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/io.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ioapiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/jobapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/joystickapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ktmtypes.h \
+  C:/mingw64/x86_64-w64-mingw32/include/libloaderapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/limits.h \
+  C:/mingw64/x86_64-w64-mingw32/include/lzexpand.h \
+  C:/mingw64/x86_64-w64-mingw32/include/malloc.h \
+  C:/mingw64/x86_64-w64-mingw32/include/mciapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/mcx.h \
+  C:/mingw64/x86_64-w64-mingw32/include/memoryapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/minwinbase.h \
+  C:/mingw64/x86_64-w64-mingw32/include/minwindef.h \
+  C:/mingw64/x86_64-w64-mingw32/include/mmeapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/mmiscapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/mmiscapi2.h \
+  C:/mingw64/x86_64-w64-mingw32/include/mmsyscom.h \
+  C:/mingw64/x86_64-w64-mingw32/include/mmsystem.h \
+  C:/mingw64/x86_64-w64-mingw32/include/mstcpip.h \
+  C:/mingw64/x86_64-w64-mingw32/include/msxml.h \
+  C:/mingw64/x86_64-w64-mingw32/include/namedpipeapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/namespaceapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/nb30.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ncrypt.h \
+  C:/mingw64/x86_64-w64-mingw32/include/oaidl.h \
+  C:/mingw64/x86_64-w64-mingw32/include/objbase.h \
+  C:/mingw64/x86_64-w64-mingw32/include/objidl.h \
+  C:/mingw64/x86_64-w64-mingw32/include/objidlbase.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ole2.h \
+  C:/mingw64/x86_64-w64-mingw32/include/oleauto.h \
+  C:/mingw64/x86_64-w64-mingw32/include/oleidl.h \
+  C:/mingw64/x86_64-w64-mingw32/include/playsoundapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/poppack.h \
+  C:/mingw64/x86_64-w64-mingw32/include/process.h \
+  C:/mingw64/x86_64-w64-mingw32/include/processenv.h \
+  C:/mingw64/x86_64-w64-mingw32/include/processthreadsapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/processtopologyapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/profileapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/propidl.h \
+  C:/mingw64/x86_64-w64-mingw32/include/prsht.h \
+  C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_fd_types.h \
+  C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ip_mreq1.h \
+  C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ip_types.h \
+  C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_socket_types.h \
+  C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ws1_undef.h \
+  C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_wsa_errnos.h \
+  C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_wsadata.h \
+  C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/intrin-impl.h \
+  C:/mingw64/x86_64-w64-mingw32/include/pshpack1.h \
+  C:/mingw64/x86_64-w64-mingw32/include/pshpack2.h \
+  C:/mingw64/x86_64-w64-mingw32/include/pshpack4.h \
+  C:/mingw64/x86_64-w64-mingw32/include/pshpack8.h \
+  C:/mingw64/x86_64-w64-mingw32/include/pthread_time.h \
+  C:/mingw64/x86_64-w64-mingw32/include/pthread_unistd.h \
+  C:/mingw64/x86_64-w64-mingw32/include/qos.h \
+  C:/mingw64/x86_64-w64-mingw32/include/realtimeapiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/reason.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpc.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpcasync.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpcdce.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpcdcep.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpcndr.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpcnsi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpcnsip.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpcnterr.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpcsal.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sal.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sdkddkver.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sdks/_mingw_ddk.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sec_api/stdio_s.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sec_api/stdlib_s.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sec_api/stralign_s.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sec_api/string_s.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sec_api/sys/timeb_s.h \
+  C:/mingw64/x86_64-w64-mingw32/include/securityappcontainer.h \
+  C:/mingw64/x86_64-w64-mingw32/include/securitybaseapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/servprov.h \
+  C:/mingw64/x86_64-w64-mingw32/include/shellapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/specstrings.h \
+  C:/mingw64/x86_64-w64-mingw32/include/stdarg.h \
+  C:/mingw64/x86_64-w64-mingw32/include/stddef.h \
+  C:/mingw64/x86_64-w64-mingw32/include/stdint.h \
+  C:/mingw64/x86_64-w64-mingw32/include/stdio.h \
+  C:/mingw64/x86_64-w64-mingw32/include/stdlib.h \
+  C:/mingw64/x86_64-w64-mingw32/include/stralign.h \
+  C:/mingw64/x86_64-w64-mingw32/include/string.h \
+  C:/mingw64/x86_64-w64-mingw32/include/stringapiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/swprintf.inl \
+  C:/mingw64/x86_64-w64-mingw32/include/synchapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sys/timeb.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sys/types.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sysinfoapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/systemtopologyapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/threadpoolapiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/threadpoollegacyapiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/time.h \
+  C:/mingw64/x86_64-w64-mingw32/include/timeapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/timezoneapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/tvout.h \
+  C:/mingw64/x86_64-w64-mingw32/include/unistd.h \
+  C:/mingw64/x86_64-w64-mingw32/include/unknwn.h \
+  C:/mingw64/x86_64-w64-mingw32/include/unknwnbase.h \
+  C:/mingw64/x86_64-w64-mingw32/include/urlmon.h \
+  C:/mingw64/x86_64-w64-mingw32/include/utilapiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/vadefs.h \
+  C:/mingw64/x86_64-w64-mingw32/include/virtdisk.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winapifamily.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winbase.h \
+  C:/mingw64/x86_64-w64-mingw32/include/wincon.h \
+  C:/mingw64/x86_64-w64-mingw32/include/wincrypt.h \
+  C:/mingw64/x86_64-w64-mingw32/include/windef.h \
+  C:/mingw64/x86_64-w64-mingw32/include/windows.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winefs.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winerror.h \
+  C:/mingw64/x86_64-w64-mingw32/include/wingdi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winioctl.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winnetwk.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winnls.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winnt.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winperf.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winreg.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winscard.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winsmcrd.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winsock.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winsock2.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winspool.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winsvc.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winuser.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winver.h \
+  C:/mingw64/x86_64-w64-mingw32/include/wnnc.h \
+  C:/mingw64/x86_64-w64-mingw32/include/wow64apiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ws2def.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ws2ipdef.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ws2tcpip.h \
+  C:/mingw64/x86_64-w64-mingw32/include/wtypes.h \
+  C:/mingw64/x86_64-w64-mingw32/include/wtypesbase.h \
+  include/tls1_3.h \
+  include/tls_cert_chain.h \
+  include/tls_certs.h \
+  include/tls_client_recv.h \
+  include/tls_client_send.h \
+  include/tls_keys_calc.h \
+  include/tls_logger.h \
+  include/tls_octads.h \
+  include/tls_protocol.h \
+  include/tls_sal.h \
+  include/tls_sockets.h \
+  include/tls_tickets.h \
+  include/tls_x509.h
+
+CMakeFiles/tiitls.dir/lib/tls_sal.cpp.obj: lib/tls_sal.cpp \
+  C:/mingw64/include/c++/13.2.0/bits/std_abs.h \
+  C:/mingw64/include/c++/13.2.0/cstdlib \
+  C:/mingw64/include/c++/13.2.0/pstl/pstl_config.h \
+  C:/mingw64/include/c++/13.2.0/stdlib.h \
+  C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/c++config.h \
+  C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/cpu_defines.h \
+  C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/os_defines.h \
+  C:/mingw64/include/oqs/common.h \
+  C:/mingw64/include/oqs/kem.h \
+  C:/mingw64/include/oqs/kem_classic_mceliece.h \
+  C:/mingw64/include/oqs/kem_frodokem.h \
+  C:/mingw64/include/oqs/kem_hqc.h \
+  C:/mingw64/include/oqs/kem_kyber.h \
+  C:/mingw64/include/oqs/kem_ml_kem.h \
+  C:/mingw64/include/oqs/kem_ntruprime.h \
+  C:/mingw64/include/oqs/oqs.h \
+  C:/mingw64/include/oqs/oqsconfig.h \
+  C:/mingw64/include/oqs/rand.h \
+  C:/mingw64/include/oqs/sig.h \
+  C:/mingw64/include/oqs/sig_dilithium.h \
+  C:/mingw64/include/oqs/sig_falcon.h \
+  C:/mingw64/include/oqs/sig_ml_dsa.h \
+  C:/mingw64/include/oqs/sig_sphincs.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/adxintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/ammintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxbf16intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxcomplexintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxfp16intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxint8intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxtileintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx2intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx5124fmapsintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx5124vnniwintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bf16intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bf16vlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bitalgintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bwintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512cdintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512dqintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512erintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fp16intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fp16vlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512ifmaintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512ifmavlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512pfintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmi2intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmi2vlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmiintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmivlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vlbwintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vldqintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vnniintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vnnivlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vp2intersectintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vp2intersectvlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vpopcntdqintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vpopcntdqvlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxifmaintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxneconvertintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxvnniint8intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxvnniintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/bmi2intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/bmiintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cetintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cldemoteintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clflushoptintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clwbintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clzerointrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cmpccxaddintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/emmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/enqcmdintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/f16cintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fma4intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fmaintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fxsrintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/gfniintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/hresetintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/ia32intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/immintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/keylockerintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/limits.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/lwpintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/lzcntintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mm3dnow.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mm_malloc.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/movdirintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mwaitintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mwaitxintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pconfigintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pkuintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pmmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/popcntintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/prfchiintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/prfchwintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/raointintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/rdseedintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/rtmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/serializeintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/sgxintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/shaintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/smmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stdarg.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stdbool.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stddef.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stdint.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/syslimits.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tbmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tmmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tsxldtrkintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/uintrintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/vaesintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/vpclmulqdqintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/waitpkgintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/wbnoinvdintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/wmmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/x86gprintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/x86intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xmmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xopintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsavecintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsaveintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsaveoptintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsavesintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xtestintrin.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_bsd_types.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_mingw.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_mingw_mac.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_mingw_off_t.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_mingw_secapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_mingw_stdarg.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_mingw_unicode.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_timeval.h \
+  C:/mingw64/x86_64-w64-mingw32/include/afunix.h \
+  C:/mingw64/x86_64-w64-mingw32/include/apiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/apisetcconv.h \
+  C:/mingw64/x86_64-w64-mingw32/include/basetsd.h \
+  C:/mingw64/x86_64-w64-mingw32/include/bcrypt.h \
+  C:/mingw64/x86_64-w64-mingw32/include/bemapiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/cderr.h \
+  C:/mingw64/x86_64-w64-mingw32/include/cguid.h \
+  C:/mingw64/x86_64-w64-mingw32/include/combaseapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/commdlg.h \
+  C:/mingw64/x86_64-w64-mingw32/include/concurrencysal.h \
+  C:/mingw64/x86_64-w64-mingw32/include/corecrt.h \
+  C:/mingw64/x86_64-w64-mingw32/include/corecrt_startup.h \
+  C:/mingw64/x86_64-w64-mingw32/include/corecrt_stdio_config.h \
+  C:/mingw64/x86_64-w64-mingw32/include/corecrt_wstdlib.h \
+  C:/mingw64/x86_64-w64-mingw32/include/crtdefs.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ctype.h \
+  C:/mingw64/x86_64-w64-mingw32/include/datetimeapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/dde.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ddeml.h \
+  C:/mingw64/x86_64-w64-mingw32/include/debugapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/dlgs.h \
+  C:/mingw64/x86_64-w64-mingw32/include/dpapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/driverspecs.h \
+  C:/mingw64/x86_64-w64-mingw32/include/errhandlingapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/errno.h \
+  C:/mingw64/x86_64-w64-mingw32/include/excpt.h \
+  C:/mingw64/x86_64-w64-mingw32/include/fibersapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/fileapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/fltwinerror.h \
+  C:/mingw64/x86_64-w64-mingw32/include/getopt.h \
+  C:/mingw64/x86_64-w64-mingw32/include/guiddef.h \
+  C:/mingw64/x86_64-w64-mingw32/include/handleapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/heapapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/imm.h \
+  C:/mingw64/x86_64-w64-mingw32/include/in6addr.h \
+  C:/mingw64/x86_64-w64-mingw32/include/inaddr.h \
+  C:/mingw64/x86_64-w64-mingw32/include/interlockedapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/inttypes.h \
+  C:/mingw64/x86_64-w64-mingw32/include/io.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ioapiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/jobapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/joystickapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ktmtypes.h \
+  C:/mingw64/x86_64-w64-mingw32/include/libloaderapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/limits.h \
+  C:/mingw64/x86_64-w64-mingw32/include/lzexpand.h \
+  C:/mingw64/x86_64-w64-mingw32/include/malloc.h \
+  C:/mingw64/x86_64-w64-mingw32/include/mciapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/mcx.h \
+  C:/mingw64/x86_64-w64-mingw32/include/memoryapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/minwinbase.h \
+  C:/mingw64/x86_64-w64-mingw32/include/minwindef.h \
+  C:/mingw64/x86_64-w64-mingw32/include/mmeapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/mmiscapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/mmiscapi2.h \
+  C:/mingw64/x86_64-w64-mingw32/include/mmsyscom.h \
+  C:/mingw64/x86_64-w64-mingw32/include/mmsystem.h \
+  C:/mingw64/x86_64-w64-mingw32/include/mstcpip.h \
+  C:/mingw64/x86_64-w64-mingw32/include/msxml.h \
+  C:/mingw64/x86_64-w64-mingw32/include/namedpipeapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/namespaceapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/nb30.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ncrypt.h \
+  C:/mingw64/x86_64-w64-mingw32/include/oaidl.h \
+  C:/mingw64/x86_64-w64-mingw32/include/objbase.h \
+  C:/mingw64/x86_64-w64-mingw32/include/objidl.h \
+  C:/mingw64/x86_64-w64-mingw32/include/objidlbase.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ole2.h \
+  C:/mingw64/x86_64-w64-mingw32/include/oleauto.h \
+  C:/mingw64/x86_64-w64-mingw32/include/oleidl.h \
+  C:/mingw64/x86_64-w64-mingw32/include/playsoundapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/poppack.h \
+  C:/mingw64/x86_64-w64-mingw32/include/process.h \
+  C:/mingw64/x86_64-w64-mingw32/include/processenv.h \
+  C:/mingw64/x86_64-w64-mingw32/include/processthreadsapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/processtopologyapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/profileapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/propidl.h \
+  C:/mingw64/x86_64-w64-mingw32/include/prsht.h \
+  C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_fd_types.h \
+  C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ip_mreq1.h \
+  C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ip_types.h \
+  C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_socket_types.h \
+  C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ws1_undef.h \
+  C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_wsa_errnos.h \
+  C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_wsadata.h \
+  C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/intrin-impl.h \
+  C:/mingw64/x86_64-w64-mingw32/include/pshpack1.h \
+  C:/mingw64/x86_64-w64-mingw32/include/pshpack2.h \
+  C:/mingw64/x86_64-w64-mingw32/include/pshpack4.h \
+  C:/mingw64/x86_64-w64-mingw32/include/pshpack8.h \
+  C:/mingw64/x86_64-w64-mingw32/include/pthread_time.h \
+  C:/mingw64/x86_64-w64-mingw32/include/pthread_unistd.h \
+  C:/mingw64/x86_64-w64-mingw32/include/qos.h \
+  C:/mingw64/x86_64-w64-mingw32/include/realtimeapiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/reason.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpc.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpcasync.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpcdce.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpcdcep.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpcndr.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpcnsi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpcnsip.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpcnterr.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpcsal.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sal.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sdkddkver.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sdks/_mingw_ddk.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sec_api/stdio_s.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sec_api/stdlib_s.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sec_api/stralign_s.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sec_api/string_s.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sec_api/sys/timeb_s.h \
+  C:/mingw64/x86_64-w64-mingw32/include/securityappcontainer.h \
+  C:/mingw64/x86_64-w64-mingw32/include/securitybaseapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/servprov.h \
+  C:/mingw64/x86_64-w64-mingw32/include/shellapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/specstrings.h \
+  C:/mingw64/x86_64-w64-mingw32/include/stdarg.h \
+  C:/mingw64/x86_64-w64-mingw32/include/stddef.h \
+  C:/mingw64/x86_64-w64-mingw32/include/stdint.h \
+  C:/mingw64/x86_64-w64-mingw32/include/stdio.h \
+  C:/mingw64/x86_64-w64-mingw32/include/stdlib.h \
+  C:/mingw64/x86_64-w64-mingw32/include/stralign.h \
+  C:/mingw64/x86_64-w64-mingw32/include/string.h \
+  C:/mingw64/x86_64-w64-mingw32/include/stringapiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/swprintf.inl \
+  C:/mingw64/x86_64-w64-mingw32/include/synchapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sys/timeb.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sys/types.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sysinfoapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/systemtopologyapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/threadpoolapiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/threadpoollegacyapiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/time.h \
+  C:/mingw64/x86_64-w64-mingw32/include/timeapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/timezoneapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/tvout.h \
+  C:/mingw64/x86_64-w64-mingw32/include/unistd.h \
+  C:/mingw64/x86_64-w64-mingw32/include/unknwn.h \
+  C:/mingw64/x86_64-w64-mingw32/include/unknwnbase.h \
+  C:/mingw64/x86_64-w64-mingw32/include/urlmon.h \
+  C:/mingw64/x86_64-w64-mingw32/include/utilapiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/vadefs.h \
+  C:/mingw64/x86_64-w64-mingw32/include/virtdisk.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winapifamily.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winbase.h \
+  C:/mingw64/x86_64-w64-mingw32/include/wincon.h \
+  C:/mingw64/x86_64-w64-mingw32/include/wincrypt.h \
+  C:/mingw64/x86_64-w64-mingw32/include/windef.h \
+  C:/mingw64/x86_64-w64-mingw32/include/windows.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winefs.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winerror.h \
+  C:/mingw64/x86_64-w64-mingw32/include/wingdi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winioctl.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winnetwk.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winnls.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winnt.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winperf.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winreg.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winscard.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winsmcrd.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winsock.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winsock2.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winspool.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winsvc.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winuser.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winver.h \
+  C:/mingw64/x86_64-w64-mingw32/include/wnnc.h \
+  C:/mingw64/x86_64-w64-mingw32/include/wow64apiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ws2def.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ws2ipdef.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ws2tcpip.h \
+  C:/mingw64/x86_64-w64-mingw32/include/wtypes.h \
+  C:/mingw64/x86_64-w64-mingw32/include/wtypesbase.h \
+  include/tls1_3.h \
+  include/tls_octads.h \
+  include/tls_sal.h \
+  include/tls_sockets.h \
+  sal/miracl/includes/arch.h \
+  sal/miracl/includes/big_B256_56.h \
+  sal/miracl/includes/big_B384_56.h \
+  sal/miracl/includes/big_B448_58.h \
+  sal/miracl/includes/big_B512_60.h \
+  sal/miracl/includes/config_big_B256_56.h \
+  sal/miracl/includes/config_big_B384_56.h \
+  sal/miracl/includes/config_big_B448_58.h \
+  sal/miracl/includes/config_big_B512_60.h \
+  sal/miracl/includes/config_curve_C25519.h \
+  sal/miracl/includes/config_curve_Ed25519.h \
+  sal/miracl/includes/config_curve_Ed448.h \
+  sal/miracl/includes/config_curve_NIST256.h \
+  sal/miracl/includes/config_curve_NIST384.h \
+  sal/miracl/includes/config_ff_RSA2048.h \
+  sal/miracl/includes/config_ff_RSA4096.h \
+  sal/miracl/includes/config_field_F25519.h \
+  sal/miracl/includes/config_field_F448.h \
+  sal/miracl/includes/config_field_NIST256.h \
+  sal/miracl/includes/config_field_NIST384.h \
+  sal/miracl/includes/core.h \
+  sal/miracl/includes/ecdh_C25519.h \
+  sal/miracl/includes/ecdh_NIST256.h \
+  sal/miracl/includes/ecdh_NIST384.h \
+  sal/miracl/includes/ecp_C25519.h \
+  sal/miracl/includes/ecp_Ed25519.h \
+  sal/miracl/includes/ecp_Ed448.h \
+  sal/miracl/includes/ecp_NIST256.h \
+  sal/miracl/includes/ecp_NIST384.h \
+  sal/miracl/includes/eddsa_Ed25519.h \
+  sal/miracl/includes/eddsa_Ed448.h \
+  sal/miracl/includes/ff_RSA2048.h \
+  sal/miracl/includes/ff_RSA4096.h \
+  sal/miracl/includes/fp_F25519.h \
+  sal/miracl/includes/fp_F448.h \
+  sal/miracl/includes/fp_NIST256.h \
+  sal/miracl/includes/fp_NIST384.h \
+  sal/miracl/includes/rsa_RSA2048.h \
+  sal/miracl/includes/rsa_RSA4096.h
+
+CMakeFiles/tiitls.dir/lib/tls_sockets.cpp.obj: lib/tls_sockets.cpp \
+  C:/mingw64/include/c++/13.2.0/bits/std_abs.h \
+  C:/mingw64/include/c++/13.2.0/cstdlib \
+  C:/mingw64/include/c++/13.2.0/pstl/pstl_config.h \
+  C:/mingw64/include/c++/13.2.0/stdlib.h \
+  C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/c++config.h \
+  C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/cpu_defines.h \
+  C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/os_defines.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/adxintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/ammintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxbf16intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxcomplexintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxfp16intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxint8intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxtileintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx2intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx5124fmapsintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx5124vnniwintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bf16intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bf16vlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bitalgintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bwintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512cdintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512dqintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512erintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fp16intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fp16vlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512ifmaintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512ifmavlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512pfintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmi2intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmi2vlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmiintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmivlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vlbwintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vldqintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vnniintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vnnivlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vp2intersectintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vp2intersectvlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vpopcntdqintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vpopcntdqvlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxifmaintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxneconvertintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxvnniint8intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxvnniintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/bmi2intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/bmiintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cetintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cldemoteintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clflushoptintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clwbintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clzerointrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cmpccxaddintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/emmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/enqcmdintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/f16cintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fma4intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fmaintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fxsrintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/gfniintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/hresetintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/ia32intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/immintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/keylockerintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/limits.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/lwpintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/lzcntintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mm3dnow.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mm_malloc.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/movdirintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mwaitintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mwaitxintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pconfigintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pkuintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pmmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/popcntintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/prfchiintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/prfchwintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/raointintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/rdseedintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/rtmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/serializeintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/sgxintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/shaintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/smmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stdarg.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stddef.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stdint.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/syslimits.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tbmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tmmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tsxldtrkintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/uintrintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/vaesintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/vpclmulqdqintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/waitpkgintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/wbnoinvdintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/wmmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/x86gprintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/x86intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xmmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xopintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsavecintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsaveintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsaveoptintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsavesintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xtestintrin.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_bsd_types.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_mingw.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_mingw_mac.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_mingw_off_t.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_mingw_secapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_mingw_stdarg.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_mingw_unicode.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_timeval.h \
+  C:/mingw64/x86_64-w64-mingw32/include/afunix.h \
+  C:/mingw64/x86_64-w64-mingw32/include/apiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/apisetcconv.h \
+  C:/mingw64/x86_64-w64-mingw32/include/basetsd.h \
+  C:/mingw64/x86_64-w64-mingw32/include/bcrypt.h \
+  C:/mingw64/x86_64-w64-mingw32/include/bemapiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/cderr.h \
+  C:/mingw64/x86_64-w64-mingw32/include/cguid.h \
+  C:/mingw64/x86_64-w64-mingw32/include/combaseapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/commdlg.h \
+  C:/mingw64/x86_64-w64-mingw32/include/concurrencysal.h \
+  C:/mingw64/x86_64-w64-mingw32/include/corecrt.h \
+  C:/mingw64/x86_64-w64-mingw32/include/corecrt_startup.h \
+  C:/mingw64/x86_64-w64-mingw32/include/corecrt_stdio_config.h \
+  C:/mingw64/x86_64-w64-mingw32/include/corecrt_wstdlib.h \
+  C:/mingw64/x86_64-w64-mingw32/include/crtdefs.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ctype.h \
+  C:/mingw64/x86_64-w64-mingw32/include/datetimeapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/dde.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ddeml.h \
+  C:/mingw64/x86_64-w64-mingw32/include/debugapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/dlgs.h \
+  C:/mingw64/x86_64-w64-mingw32/include/dpapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/driverspecs.h \
+  C:/mingw64/x86_64-w64-mingw32/include/errhandlingapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/errno.h \
+  C:/mingw64/x86_64-w64-mingw32/include/excpt.h \
+  C:/mingw64/x86_64-w64-mingw32/include/fibersapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/fileapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/fltwinerror.h \
+  C:/mingw64/x86_64-w64-mingw32/include/getopt.h \
+  C:/mingw64/x86_64-w64-mingw32/include/guiddef.h \
+  C:/mingw64/x86_64-w64-mingw32/include/handleapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/heapapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/imm.h \
+  C:/mingw64/x86_64-w64-mingw32/include/in6addr.h \
+  C:/mingw64/x86_64-w64-mingw32/include/inaddr.h \
+  C:/mingw64/x86_64-w64-mingw32/include/interlockedapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/io.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ioapiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/jobapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/joystickapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ktmtypes.h \
+  C:/mingw64/x86_64-w64-mingw32/include/libloaderapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/limits.h \
+  C:/mingw64/x86_64-w64-mingw32/include/lzexpand.h \
+  C:/mingw64/x86_64-w64-mingw32/include/malloc.h \
+  C:/mingw64/x86_64-w64-mingw32/include/mciapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/mcx.h \
+  C:/mingw64/x86_64-w64-mingw32/include/memoryapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/minwinbase.h \
+  C:/mingw64/x86_64-w64-mingw32/include/minwindef.h \
+  C:/mingw64/x86_64-w64-mingw32/include/mmeapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/mmiscapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/mmiscapi2.h \
+  C:/mingw64/x86_64-w64-mingw32/include/mmsyscom.h \
+  C:/mingw64/x86_64-w64-mingw32/include/mmsystem.h \
+  C:/mingw64/x86_64-w64-mingw32/include/mstcpip.h \
+  C:/mingw64/x86_64-w64-mingw32/include/msxml.h \
+  C:/mingw64/x86_64-w64-mingw32/include/namedpipeapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/namespaceapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/nb30.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ncrypt.h \
+  C:/mingw64/x86_64-w64-mingw32/include/oaidl.h \
+  C:/mingw64/x86_64-w64-mingw32/include/objbase.h \
+  C:/mingw64/x86_64-w64-mingw32/include/objidl.h \
+  C:/mingw64/x86_64-w64-mingw32/include/objidlbase.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ole2.h \
+  C:/mingw64/x86_64-w64-mingw32/include/oleauto.h \
+  C:/mingw64/x86_64-w64-mingw32/include/oleidl.h \
+  C:/mingw64/x86_64-w64-mingw32/include/playsoundapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/poppack.h \
+  C:/mingw64/x86_64-w64-mingw32/include/process.h \
+  C:/mingw64/x86_64-w64-mingw32/include/processenv.h \
+  C:/mingw64/x86_64-w64-mingw32/include/processthreadsapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/processtopologyapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/profileapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/propidl.h \
+  C:/mingw64/x86_64-w64-mingw32/include/prsht.h \
+  C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_fd_types.h \
+  C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ip_mreq1.h \
+  C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ip_types.h \
+  C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_socket_types.h \
+  C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ws1_undef.h \
+  C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_wsa_errnos.h \
+  C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_wsadata.h \
+  C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/intrin-impl.h \
+  C:/mingw64/x86_64-w64-mingw32/include/pshpack1.h \
+  C:/mingw64/x86_64-w64-mingw32/include/pshpack2.h \
+  C:/mingw64/x86_64-w64-mingw32/include/pshpack4.h \
+  C:/mingw64/x86_64-w64-mingw32/include/pshpack8.h \
+  C:/mingw64/x86_64-w64-mingw32/include/pthread_time.h \
+  C:/mingw64/x86_64-w64-mingw32/include/pthread_unistd.h \
+  C:/mingw64/x86_64-w64-mingw32/include/qos.h \
+  C:/mingw64/x86_64-w64-mingw32/include/realtimeapiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/reason.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpc.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpcasync.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpcdce.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpcdcep.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpcndr.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpcnsi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpcnsip.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpcnterr.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpcsal.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sal.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sdkddkver.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sdks/_mingw_ddk.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sec_api/stdio_s.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sec_api/stdlib_s.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sec_api/stralign_s.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sec_api/string_s.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sec_api/sys/timeb_s.h \
+  C:/mingw64/x86_64-w64-mingw32/include/securityappcontainer.h \
+  C:/mingw64/x86_64-w64-mingw32/include/securitybaseapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/servprov.h \
+  C:/mingw64/x86_64-w64-mingw32/include/shellapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/specstrings.h \
+  C:/mingw64/x86_64-w64-mingw32/include/stdarg.h \
+  C:/mingw64/x86_64-w64-mingw32/include/stddef.h \
+  C:/mingw64/x86_64-w64-mingw32/include/stdint.h \
+  C:/mingw64/x86_64-w64-mingw32/include/stdio.h \
+  C:/mingw64/x86_64-w64-mingw32/include/stdlib.h \
+  C:/mingw64/x86_64-w64-mingw32/include/stralign.h \
+  C:/mingw64/x86_64-w64-mingw32/include/string.h \
+  C:/mingw64/x86_64-w64-mingw32/include/stringapiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/swprintf.inl \
+  C:/mingw64/x86_64-w64-mingw32/include/synchapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sys/timeb.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sys/types.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sysinfoapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/systemtopologyapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/threadpoolapiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/threadpoollegacyapiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/time.h \
+  C:/mingw64/x86_64-w64-mingw32/include/timeapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/timezoneapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/tvout.h \
+  C:/mingw64/x86_64-w64-mingw32/include/unistd.h \
+  C:/mingw64/x86_64-w64-mingw32/include/unknwn.h \
+  C:/mingw64/x86_64-w64-mingw32/include/unknwnbase.h \
+  C:/mingw64/x86_64-w64-mingw32/include/urlmon.h \
+  C:/mingw64/x86_64-w64-mingw32/include/utilapiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/vadefs.h \
+  C:/mingw64/x86_64-w64-mingw32/include/virtdisk.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winapifamily.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winbase.h \
+  C:/mingw64/x86_64-w64-mingw32/include/wincon.h \
+  C:/mingw64/x86_64-w64-mingw32/include/wincrypt.h \
+  C:/mingw64/x86_64-w64-mingw32/include/windef.h \
+  C:/mingw64/x86_64-w64-mingw32/include/windows.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winefs.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winerror.h \
+  C:/mingw64/x86_64-w64-mingw32/include/wingdi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winioctl.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winnetwk.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winnls.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winnt.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winperf.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winreg.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winscard.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winsmcrd.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winsock.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winsock2.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winspool.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winsvc.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winuser.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winver.h \
+  C:/mingw64/x86_64-w64-mingw32/include/wnnc.h \
+  C:/mingw64/x86_64-w64-mingw32/include/wow64apiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ws2def.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ws2ipdef.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ws2tcpip.h \
+  C:/mingw64/x86_64-w64-mingw32/include/wtypes.h \
+  C:/mingw64/x86_64-w64-mingw32/include/wtypesbase.h \
+  include/tls1_3.h \
+  include/tls_logger.h \
+  include/tls_octads.h \
+  include/tls_sockets.h \
+  include/tls_x509.h
+
+CMakeFiles/tiitls.dir/lib/tls_tickets.cpp.obj: lib/tls_tickets.cpp \
+  C:/mingw64/include/c++/13.2.0/bits/std_abs.h \
+  C:/mingw64/include/c++/13.2.0/cstdlib \
+  C:/mingw64/include/c++/13.2.0/pstl/pstl_config.h \
+  C:/mingw64/include/c++/13.2.0/stdlib.h \
+  C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/c++config.h \
+  C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/cpu_defines.h \
+  C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/os_defines.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/adxintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/ammintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxbf16intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxcomplexintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxfp16intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxint8intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxtileintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx2intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx5124fmapsintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx5124vnniwintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bf16intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bf16vlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bitalgintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bwintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512cdintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512dqintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512erintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fp16intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fp16vlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512ifmaintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512ifmavlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512pfintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmi2intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmi2vlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmiintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmivlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vlbwintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vldqintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vnniintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vnnivlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vp2intersectintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vp2intersectvlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vpopcntdqintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vpopcntdqvlintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxifmaintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxneconvertintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxvnniint8intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxvnniintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/bmi2intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/bmiintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cetintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cldemoteintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clflushoptintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clwbintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clzerointrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cmpccxaddintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/emmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/enqcmdintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/f16cintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fma4intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fmaintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fxsrintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/gfniintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/hresetintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/ia32intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/immintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/keylockerintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/limits.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/lwpintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/lzcntintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mm3dnow.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mm_malloc.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/movdirintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mwaitintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mwaitxintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pconfigintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pkuintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pmmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/popcntintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/prfchiintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/prfchwintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/raointintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/rdseedintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/rtmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/serializeintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/sgxintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/shaintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/smmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stdarg.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stddef.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stdint.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/syslimits.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tbmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tmmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tsxldtrkintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/uintrintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/vaesintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/vpclmulqdqintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/waitpkgintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/wbnoinvdintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/wmmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/x86gprintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/x86intrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xmmintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xopintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsavecintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsaveintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsaveoptintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsavesintrin.h \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xtestintrin.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_bsd_types.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_mingw.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_mingw_mac.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_mingw_off_t.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_mingw_secapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_mingw_stdarg.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_mingw_unicode.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_timeval.h \
+  C:/mingw64/x86_64-w64-mingw32/include/afunix.h \
+  C:/mingw64/x86_64-w64-mingw32/include/apiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/apisetcconv.h \
+  C:/mingw64/x86_64-w64-mingw32/include/basetsd.h \
+  C:/mingw64/x86_64-w64-mingw32/include/bcrypt.h \
+  C:/mingw64/x86_64-w64-mingw32/include/bemapiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/cderr.h \
+  C:/mingw64/x86_64-w64-mingw32/include/cguid.h \
+  C:/mingw64/x86_64-w64-mingw32/include/combaseapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/commdlg.h \
+  C:/mingw64/x86_64-w64-mingw32/include/concurrencysal.h \
+  C:/mingw64/x86_64-w64-mingw32/include/corecrt.h \
+  C:/mingw64/x86_64-w64-mingw32/include/corecrt_startup.h \
+  C:/mingw64/x86_64-w64-mingw32/include/corecrt_stdio_config.h \
+  C:/mingw64/x86_64-w64-mingw32/include/corecrt_wstdlib.h \
+  C:/mingw64/x86_64-w64-mingw32/include/crtdefs.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ctype.h \
+  C:/mingw64/x86_64-w64-mingw32/include/datetimeapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/dde.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ddeml.h \
+  C:/mingw64/x86_64-w64-mingw32/include/debugapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/dlgs.h \
+  C:/mingw64/x86_64-w64-mingw32/include/dpapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/driverspecs.h \
+  C:/mingw64/x86_64-w64-mingw32/include/errhandlingapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/errno.h \
+  C:/mingw64/x86_64-w64-mingw32/include/excpt.h \
+  C:/mingw64/x86_64-w64-mingw32/include/fibersapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/fileapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/fltwinerror.h \
+  C:/mingw64/x86_64-w64-mingw32/include/getopt.h \
+  C:/mingw64/x86_64-w64-mingw32/include/guiddef.h \
+  C:/mingw64/x86_64-w64-mingw32/include/handleapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/heapapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/imm.h \
+  C:/mingw64/x86_64-w64-mingw32/include/in6addr.h \
+  C:/mingw64/x86_64-w64-mingw32/include/inaddr.h \
+  C:/mingw64/x86_64-w64-mingw32/include/interlockedapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/io.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ioapiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/jobapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/joystickapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ktmtypes.h \
+  C:/mingw64/x86_64-w64-mingw32/include/libloaderapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/limits.h \
+  C:/mingw64/x86_64-w64-mingw32/include/lzexpand.h \
+  C:/mingw64/x86_64-w64-mingw32/include/malloc.h \
+  C:/mingw64/x86_64-w64-mingw32/include/mciapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/mcx.h \
+  C:/mingw64/x86_64-w64-mingw32/include/memoryapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/minwinbase.h \
+  C:/mingw64/x86_64-w64-mingw32/include/minwindef.h \
+  C:/mingw64/x86_64-w64-mingw32/include/mmeapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/mmiscapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/mmiscapi2.h \
+  C:/mingw64/x86_64-w64-mingw32/include/mmsyscom.h \
+  C:/mingw64/x86_64-w64-mingw32/include/mmsystem.h \
+  C:/mingw64/x86_64-w64-mingw32/include/mstcpip.h \
+  C:/mingw64/x86_64-w64-mingw32/include/msxml.h \
+  C:/mingw64/x86_64-w64-mingw32/include/namedpipeapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/namespaceapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/nb30.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ncrypt.h \
+  C:/mingw64/x86_64-w64-mingw32/include/oaidl.h \
+  C:/mingw64/x86_64-w64-mingw32/include/objbase.h \
+  C:/mingw64/x86_64-w64-mingw32/include/objidl.h \
+  C:/mingw64/x86_64-w64-mingw32/include/objidlbase.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ole2.h \
+  C:/mingw64/x86_64-w64-mingw32/include/oleauto.h \
+  C:/mingw64/x86_64-w64-mingw32/include/oleidl.h \
+  C:/mingw64/x86_64-w64-mingw32/include/playsoundapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/poppack.h \
+  C:/mingw64/x86_64-w64-mingw32/include/process.h \
+  C:/mingw64/x86_64-w64-mingw32/include/processenv.h \
+  C:/mingw64/x86_64-w64-mingw32/include/processthreadsapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/processtopologyapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/profileapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/propidl.h \
+  C:/mingw64/x86_64-w64-mingw32/include/prsht.h \
+  C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_fd_types.h \
+  C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ip_mreq1.h \
+  C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ip_types.h \
+  C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_socket_types.h \
+  C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ws1_undef.h \
+  C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_wsa_errnos.h \
+  C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_wsadata.h \
+  C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/intrin-impl.h \
+  C:/mingw64/x86_64-w64-mingw32/include/pshpack1.h \
+  C:/mingw64/x86_64-w64-mingw32/include/pshpack2.h \
+  C:/mingw64/x86_64-w64-mingw32/include/pshpack4.h \
+  C:/mingw64/x86_64-w64-mingw32/include/pshpack8.h \
+  C:/mingw64/x86_64-w64-mingw32/include/pthread_time.h \
+  C:/mingw64/x86_64-w64-mingw32/include/pthread_unistd.h \
+  C:/mingw64/x86_64-w64-mingw32/include/qos.h \
+  C:/mingw64/x86_64-w64-mingw32/include/realtimeapiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/reason.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpc.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpcasync.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpcdce.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpcdcep.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpcndr.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpcnsi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpcnsip.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpcnterr.h \
+  C:/mingw64/x86_64-w64-mingw32/include/rpcsal.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sal.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sdkddkver.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sdks/_mingw_ddk.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sec_api/stdio_s.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sec_api/stdlib_s.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sec_api/stralign_s.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sec_api/string_s.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sec_api/sys/timeb_s.h \
+  C:/mingw64/x86_64-w64-mingw32/include/securityappcontainer.h \
+  C:/mingw64/x86_64-w64-mingw32/include/securitybaseapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/servprov.h \
+  C:/mingw64/x86_64-w64-mingw32/include/shellapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/specstrings.h \
+  C:/mingw64/x86_64-w64-mingw32/include/stdarg.h \
+  C:/mingw64/x86_64-w64-mingw32/include/stddef.h \
+  C:/mingw64/x86_64-w64-mingw32/include/stdint.h \
+  C:/mingw64/x86_64-w64-mingw32/include/stdio.h \
+  C:/mingw64/x86_64-w64-mingw32/include/stdlib.h \
+  C:/mingw64/x86_64-w64-mingw32/include/stralign.h \
+  C:/mingw64/x86_64-w64-mingw32/include/string.h \
+  C:/mingw64/x86_64-w64-mingw32/include/stringapiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/swprintf.inl \
+  C:/mingw64/x86_64-w64-mingw32/include/synchapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sys/timeb.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sys/types.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sysinfoapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/systemtopologyapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/threadpoolapiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/threadpoollegacyapiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/time.h \
+  C:/mingw64/x86_64-w64-mingw32/include/timeapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/timezoneapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/tvout.h \
+  C:/mingw64/x86_64-w64-mingw32/include/unistd.h \
+  C:/mingw64/x86_64-w64-mingw32/include/unknwn.h \
+  C:/mingw64/x86_64-w64-mingw32/include/unknwnbase.h \
+  C:/mingw64/x86_64-w64-mingw32/include/urlmon.h \
+  C:/mingw64/x86_64-w64-mingw32/include/utilapiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/vadefs.h \
+  C:/mingw64/x86_64-w64-mingw32/include/virtdisk.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winapifamily.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winbase.h \
+  C:/mingw64/x86_64-w64-mingw32/include/wincon.h \
+  C:/mingw64/x86_64-w64-mingw32/include/wincrypt.h \
+  C:/mingw64/x86_64-w64-mingw32/include/windef.h \
+  C:/mingw64/x86_64-w64-mingw32/include/windows.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winefs.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winerror.h \
+  C:/mingw64/x86_64-w64-mingw32/include/wingdi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winioctl.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winnetwk.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winnls.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winnt.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winperf.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winreg.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winscard.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winsmcrd.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winsock.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winsock2.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winspool.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winsvc.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winuser.h \
+  C:/mingw64/x86_64-w64-mingw32/include/winver.h \
+  C:/mingw64/x86_64-w64-mingw32/include/wnnc.h \
+  C:/mingw64/x86_64-w64-mingw32/include/wow64apiset.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ws2def.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ws2ipdef.h \
+  C:/mingw64/x86_64-w64-mingw32/include/ws2tcpip.h \
+  C:/mingw64/x86_64-w64-mingw32/include/wtypes.h \
+  C:/mingw64/x86_64-w64-mingw32/include/wtypesbase.h \
+  include/tls1_3.h \
+  include/tls_client_recv.h \
+  include/tls_client_send.h \
+  include/tls_keys_calc.h \
+  include/tls_octads.h \
+  include/tls_sal.h \
+  include/tls_sockets.h \
+  include/tls_tickets.h
+
+CMakeFiles/tiitls.dir/lib/tls_x509.cpp.obj: lib/tls_x509.cpp \
+  C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stddef.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_mingw.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_mingw_mac.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_mingw_off_t.h \
+  C:/mingw64/x86_64-w64-mingw32/include/_mingw_secapi.h \
+  C:/mingw64/x86_64-w64-mingw32/include/corecrt.h \
+  C:/mingw64/x86_64-w64-mingw32/include/corecrt_stdio_config.h \
+  C:/mingw64/x86_64-w64-mingw32/include/crtdefs.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sdks/_mingw_ddk.h \
+  C:/mingw64/x86_64-w64-mingw32/include/sec_api/stdio_s.h \
+  C:/mingw64/x86_64-w64-mingw32/include/stddef.h \
+  C:/mingw64/x86_64-w64-mingw32/include/stdio.h \
+  C:/mingw64/x86_64-w64-mingw32/include/swprintf.inl \
+  C:/mingw64/x86_64-w64-mingw32/include/vadefs.h \
+  include/tls_octads.h \
+  include/tls_x509.h
+
+
+lib/tls_sockets.cpp:
+
+sal/miracl/includes/fp_NIST384.h:
+
+sal/miracl/includes/fp_NIST256.h:
+
+sal/miracl/includes/fp_F448.h:
+
+sal/miracl/includes/fp_F25519.h:
+
+sal/miracl/includes/ff_RSA4096.h:
+
+sal/miracl/includes/ecp_NIST384.h:
+
+sal/miracl/includes/ecp_NIST256.h:
+
+sal/miracl/includes/ecp_Ed448.h:
+
+sal/miracl/includes/ecdh_NIST256.h:
+
+sal/miracl/includes/config_field_F448.h:
+
+sal/miracl/includes/config_field_F25519.h:
+
+sal/miracl/includes/rsa_RSA4096.h:
+
+sal/miracl/includes/config_ff_RSA4096.h:
+
+sal/miracl/includes/config_curve_NIST384.h:
+
+sal/miracl/includes/config_curve_NIST256.h:
+
+sal/miracl/includes/config_curve_C25519.h:
+
+sal/miracl/includes/big_B512_60.h:
+
+sal/miracl/includes/big_B448_58.h:
+
+C:/mingw64/include/oqs/sig_sphincs.h:
+
+C:/mingw64/include/oqs/sig_dilithium.h:
+
+C:/mingw64/include/oqs/kem_ml_kem.h:
+
+C:/mingw64/include/oqs/kem_frodokem.h:
+
+C:/mingw64/include/oqs/common.h:
+
+include/tls_protocol.h:
+
+lib/tls_protocol.cpp:
+
+lib/tls_logger.cpp:
+
+lib/tls_keys_calc.cpp:
+
+lib/tls_client_recv.cpp:
+
+lib/tls_client_cert.cpp:
+
+include/tls_x509.h:
+
+include/tls_logger.h:
+
+lib/tls_x509.cpp:
+
+include/tls_keys_calc.h:
+
+include/tls_client_send.h:
+
+C:/mingw64/include/oqs/sig_ml_dsa.h:
+
+include/tls_client_recv.h:
+
+lib/tls_cert_chain.cpp:
+
+C:/mingw64/x86_64-w64-mingw32/include/wtypes.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/ws2def.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/wow64apiset.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/sys/time.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/winsvc.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/winsock2.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/winnetwk.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/wingdi.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/winerror.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/winefs.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/windows.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/winapifamily.h:
+
+include/tls_certs.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/virtdisk.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/utilapiset.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/urlmon.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/unknwnbase.h:
+
+sal/miracl/includes/ecdh_NIST384.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/unistd.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/threadpoolapiset.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/synchapi.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/stringapiset.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/sec_api/stralign_s.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/sdkddkver.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/rpcsal.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/rpcnterr.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/rpcndr.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/rpcdcep.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/rpcasync.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/rpc.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/qos.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/pshpack1.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_wsadata.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_wsa_errnos.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ip_types.h:
+
+include/tls_sockets.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/rpcnsip.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/processthreadsapi.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/realtimeapiset.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/oleidl.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/oleauto.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/objidlbase.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/objbase.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/nb30.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/namespaceapi.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/namedpipeapi.h:
+
+sal/miracl/includes/big_B256_56.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/msxml.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/mstcpip.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/mmsyscom.h:
+
+C:/mingw64/include/oqs/oqsconfig.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/minwinbase.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/specstrings.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/memoryapi.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/mcx.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/lzexpand.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/libloaderapi.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/playsoundapi.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/ktmtypes.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/interlockedapi.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/in6addr.h:
+
+C:/mingw64/include/oqs/kem_hqc.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/handleapi.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/guiddef.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/fileapi.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/winver.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/fibersapi.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/errhandlingapi.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/getopt.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/driverspecs.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/pshpack2.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/dlgs.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/heapapi.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/debugapi.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/ddeml.h:
+
+lib/tls_sal.cpp:
+
+C:/mingw64/x86_64-w64-mingw32/include/dde.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/datetimeapi.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/concurrencysal.h:
+
+lib/tls_octads.cpp:
+
+C:/mingw64/x86_64-w64-mingw32/include/combaseapi.h:
+
+C:/mingw64/include/oqs/kem_ntruprime.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/apiset.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/_mingw_unicode.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/timeapi.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/_mingw_stdarg.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/imm.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/_bsd_types.h:
+
+sal/miracl/includes/config_field_NIST384.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xtestintrin.h:
+
+C:/mingw64/include/oqs/sig.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsavesintrin.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsaveoptintrin.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsaveintrin.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/rpcdce.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/mmiscapi2.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsavecintrin.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xmmintrin.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/x86gprintrin.h:
+
+include/tls1_3.h:
+
+C:/mingw64/include/c++/13.2.0/debug/assertions.h:
+
+C:/mingw64/include/c++/13.2.0/cstdio:
+
+C:/mingw64/include/c++/13.2.0/cstdint:
+
+C:/mingw64/x86_64-w64-mingw32/include/sys/types.h:
+
+include/tls_pqibe.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/ncrypt.h:
+
+C:/mingw64/include/c++/13.2.0/cstddef:
+
+C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/c++allocator.h:
+
+C:/mingw64/include/c++/13.2.0/bits/utility.h:
+
+C:/mingw64/include/c++/13.2.0/bits/uses_allocator_args.h:
+
+C:/mingw64/include/c++/13.2.0/cerrno:
+
+C:/mingw64/include/c++/13.2.0/bits/stringfwd.h:
+
+sal/miracl/includes/big_B384_56.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512cdintrin.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/locale.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/_mingw_mac.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/wbnoinvdintrin.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/winscard.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/bcrypt.h:
+
+C:/mingw64/include/c++/13.2.0/bits/stl_iterator.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/cguid.h:
+
+C:/mingw64/include/c++/13.2.0/bits/refwrap.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/timezoneapi.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/rpcnsi.h:
+
+C:/mingw64/include/c++/13.2.0/bits/locale_classes.h:
+
+C:/mingw64/include/c++/13.2.0/bits/ostream.tcc:
+
+C:/mingw64/x86_64-w64-mingw32/include/sdks/_mingw_ddk.h:
+
+C:/mingw64/include/c++/13.2.0/bits/range_access.h:
+
+C:/mingw64/include/c++/13.2.0/bits/move.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/sec_api/string_s.h:
+
+include/tls_tickets.h:
+
+C:/mingw64/include/c++/13.2.0/string_view:
+
+sal/miracl/includes/eddsa_Ed448.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/winnt.h:
+
+C:/mingw64/include/c++/13.2.0/bits/stl_iterator_base_funcs.h:
+
+C:/mingw64/include/c++/13.2.0/pstl/pstl_config.h:
+
+C:/mingw64/include/c++/13.2.0/bits/localefwd.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/winsmcrd.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/mmeapi.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/limits.h:
+
+C:/mingw64/include/c++/13.2.0/bits/locale_facets.tcc:
+
+C:/mingw64/x86_64-w64-mingw32/include/winioctl.h:
+
+C:/mingw64/include/c++/13.2.0/bits/locale_facets.h:
+
+sal/miracl/includes/ecp_Ed25519.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/vadefs.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/x86intrin.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fp16vlintrin.h:
+
+sal/miracl/includes/config_ff_RSA2048.h:
+
+include/tls_octads.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pmmintrin.h:
+
+C:/mingw64/include/c++/13.2.0/bits/streambuf_iterator.h:
+
+C:/mingw64/include/c++/13.2.0/bits/string_view.tcc:
+
+C:/mingw64/include/c++/13.2.0/bits/istream.tcc:
+
+C:/mingw64/include/c++/13.2.0/bits/ios_base.h:
+
+C:/mingw64/include/c++/13.2.0/bits/stl_function.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/lzcntintrin.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/io.h:
+
+C:/mingw64/include/c++/13.2.0/bits/invoke.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/joystickapi.h:
+
+C:/mingw64/include/c++/13.2.0/bits/cxxabi_init_exception.h:
+
+C:/mingw64/include/c++/13.2.0/bits/cxxabi_forced.h:
+
+C:/mingw64/include/c++/13.2.0/cctype:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxcomplexintrin.h:
+
+C:/mingw64/include/c++/13.2.0/ext/atomicity.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/vaesintrin.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/commdlg.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/serializeintrin.h:
+
+C:/mingw64/include/c++/13.2.0/bits/charconv.h:
+
+C:/mingw64/include/c++/13.2.0/bits/char_traits.h:
+
+C:/mingw64/include/c++/13.2.0/bits/basic_string.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/threadpoollegacyapiset.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stdbool.h:
+
+C:/mingw64/include/c++/13.2.0/bits/basic_ios.tcc:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512dqintrin.h:
+
+C:/mingw64/include/c++/13.2.0/bits/basic_ios.h:
+
+C:/mingw64/include/c++/13.2.0/bits/allocator.h:
+
+C:/mingw64/include/c++/13.2.0/ios:
+
+C:/mingw64/include/c++/13.2.0/bits/locale_classes.tcc:
+
+C:/mingw64/include/c++/13.2.0/bits/alloc_traits.h:
+
+C:/mingw64/include/c++/13.2.0/initializer_list:
+
+C:/mingw64/x86_64-w64-mingw32/include/windef.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/raointintrin.h:
+
+sal/miracl/includes/eddsa_Ed25519.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/oaidl.h:
+
+C:/mingw64/include/c++/13.2.0/bits/new_allocator.h:
+
+C:/mingw64/include/c++/13.2.0/bit:
+
+C:/mingw64/x86_64-w64-mingw32/include/stddef.h:
+
+sal/miracl/includes/fp4_BLS12381.h:
+
+C:/mingw64/include/c++/13.2.0/bits/stl_algobase.h:
+
+include/tls_cert_chain.h:
+
+C:/mingw64/include/c++/13.2.0/bits/nested_exception.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/sec_api/wchar_s.h:
+
+C:/mingw64/include/oqs/oqs.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/corecrt_stdio_config.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/securitybaseapi.h:
+
+C:/mingw64/include/c++/13.2.0/ext/numeric_traits.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/stralign.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stddef.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/wincrypt.h:
+
+C:/mingw64/include/c++/13.2.0/stdlib.h:
+
+C:/mingw64/include/c++/13.2.0/clocale:
+
+C:/mingw64/include/c++/13.2.0/bits/hash_bytes.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/winreg.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/process.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/sal.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/processenv.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/_mingw_secapi.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/tvout.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/inttypes.h:
+
+C:/mingw64/include/c++/13.2.0/bits/functexcept.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vpopcntdqintrin.h:
+
+C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/cpu_defines.h:
+
+C:/mingw64/include/oqs/sig_falcon.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/cderr.h:
+
+C:/mingw64/include/c++/13.2.0/bits/concept_check.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/pthread_time.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/limits.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/pthread.h:
+
+C:/mingw64/include/c++/13.2.0/ext/alloc_traits.h:
+
+C:/mingw64/include/c++/13.2.0/debug/debug.h:
+
+sal/miracl/includes/fp_BLS12381.h:
+
+sal/miracl/includes/core.h:
+
+C:/mingw64/include/oqs/kem.h:
+
+C:/mingw64/include/c++/13.2.0/bits/predefined_ops.h:
+
+C:/mingw64/include/oqs/kem_classic_mceliece.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmivlintrin.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/mmsystem.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxintrin.h:
+
+C:/mingw64/include/c++/13.2.0/bits/ostream_insert.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxvnniintrin.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/winbase.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/reason.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/corecrt_wstdlib.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/shellapi.h:
+
+sal/miracl/includes/ecp_BLS12381.h:
+
+C:/mingw64/include/c++/13.2.0/bits/stl_iterator_base_types.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmi2vlintrin.h:
+
+sal/miracl/includes/config_big_B384_56.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mm_malloc.h:
+
+sal/miracl/includes/ff_RSA2048.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/winspool.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/poppack.h:
+
+C:/mingw64/include/c++/13.2.0/bits/memory_resource.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/stdint.h:
+
+lib/ibe/tls_bfibe.cpp:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vnnivlintrin.h:
+
+include/tls_bfibe.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_fd_types.h:
+
+C:/mingw64/include/c++/13.2.0/bits/exception_defines.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/wincon.h:
+
+C:/mingw64/include/c++/13.2.0/cstdlib:
+
+C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/c++config.h:
+
+C:/mingw64/include/c++/13.2.0/bits/ptr_traits.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vldqintrin.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/ioapiset.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/emmintrin.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/swprintf.inl:
+
+C:/mingw64/include/c++/13.2.0/bits/memoryfwd.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/inaddr.h:
+
+sal/miracl/includes/fp12_BLS12381.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/winnls.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stdarg.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/pthread_signal.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/corecrt.h:
+
+C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/os_defines.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ip_mreq1.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stdint.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/apisetcconv.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/corecrt_startup.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ws1_undef.h:
+
+sal/miracl/includes/config_curve_BLS12381.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/malloc.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/ole2.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/sec_api/stdlib_s.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/wchar.h:
+
+C:/mingw64/include/c++/13.2.0/bits/std_abs.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/dpapi.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bf16vlintrin.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/mmiscapi.h:
+
+C:/mingw64/include/c++/13.2.0/bits/exception.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/time.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/stdlib.h:
+
+C:/mingw64/include/c++/13.2.0/tuple:
+
+C:/mingw64/include/c++/13.2.0/bits/postypes.h:
+
+C:/mingw64/include/c++/13.2.0/bits/cpp_type_traits.h:
+
+sal/miracl/includes/ecp_C25519.h:
+
+C:/mingw64/include/c++/13.2.0/istream:
+
+C:/mingw64/x86_64-w64-mingw32/include/mciapi.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/sec_api/sys/timeb_s.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/string.h:
+
+C:/mingw64/include/c++/13.2.0/bits/stl_construct.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/ctype.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/sys/timeb.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/stdarg.h:
+
+C:/mingw64/include/c++/13.2.0/system_error:
+
+C:/mingw64/include/c++/13.2.0/bits/requires_hosted.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/keylockerintrin.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxneconvertintrin.h:
+
+C:/mingw64/include/c++/13.2.0/bits/stl_pair.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/fltwinerror.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/excpt.h:
+
+C:/mingw64/include/c++/13.2.0/bits/streambuf.tcc:
+
+sal/miracl/includes/fp2_BLS12381.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vnniintrin.h:
+
+C:/mingw64/include/c++/13.2.0/exception:
+
+C:/mingw64/x86_64-w64-mingw32/include/ws2ipdef.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/errno.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/_mingw_off_t.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/intrin-impl.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/propidl.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/profileapi.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xopintrin.h:
+
+sal/miracl/includes/big_B384_58.h:
+
+C:/mingw64/include/c++/13.2.0/iostream:
+
+C:/mingw64/include/c++/13.2.0/ostream:
+
+sal/miracl/includes/pair_BLS12381.h:
+
+sal/miracl/includes/config_field_BLS12381.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxifmaintrin.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/_mingw.h:
+
+sal/miracl/includes/ecp2_BLS12381.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/wnnc.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/minwindef.h:
+
+C:/mingw64/include/c++/13.2.0/backward/binders.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/_timeval.h:
+
+sal/miracl/includes/randapi.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/waitpkgintrin.h:
+
+include/tls_sal.h:
+
+sal/miracl/includes/config_big_B384_58.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/wtypesbase.h:
+
+lib/ibe/tls_pqibe.cpp:
+
+C:/mingw64/include/c++/13.2.0/ext/string_conversions.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/bmi2intrin.h:
+
+C:/mingw64/include/c++/13.2.0/ext/type_traits.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/prsht.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cldemoteintrin.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clflushoptintrin.h:
+
+C:/mingw64/include/c++/13.2.0/new:
+
+C:/mingw64/x86_64-w64-mingw32/include/winsock.h:
+
+C:/mingw64/include/c++/13.2.0/stdexcept:
+
+C:/mingw64/include/c++/13.2.0/streambuf:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vlintrin.h:
+
+C:/mingw64/include/c++/13.2.0/bits/functional_hash.h:
+
+C:/mingw64/include/c++/13.2.0/typeinfo:
+
+C:/mingw64/x86_64-w64-mingw32/include/processtopologyapi.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/stdio.h:
+
+C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/atomic_word.h:
+
+C:/mingw64/include/oqs/rand.h:
+
+C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/ctype_base.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/unknwn.h:
+
+C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/ctype_inline.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fma4intrin.h:
+
+C:/mingw64/include/c++/13.2.0/bits/basic_string.tcc:
+
+C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/error_constants.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/sgxintrin.h:
+
+C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/gthr.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/_mingw_stat64.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/vpclmulqdqintrin.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/pthread_unistd.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/signal.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/wctype.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/pthread_compat.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmiintrin.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/jobapi.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/immintrin.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clwbintrin.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/bmiintrin.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/adxintrin.h:
+
+sal/miracl/includes/config_big_B512_60.h:
+
+C:/mingw64/include/c++/13.2.0/iosfwd:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/enqcmdintrin.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/securityappcontainer.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/ammintrin.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/pshpack8.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vp2intersectintrin.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxbf16intrin.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_socket_types.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/prfchiintrin.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/winuser.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxint8intrin.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxtileintrin.h:
+
+lib/tls_cacerts.cpp:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx5124fmapsintrin.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cmpccxaddintrin.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/uintrintrin.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx5124vnniwintrin.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/sec_api/stdio_s.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/movdirintrin.h:
+
+sal/miracl/includes/config_big_B448_58.h:
+
+sal/miracl/includes/arch.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bf16intrin.h:
+
+sal/miracl/includes/config_curve_Ed25519.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/afunix.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bitalgintrin.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bwintrin.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fintrin.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vpopcntdqvlintrin.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fp16intrin.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512ifmaintrin.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/basetsd.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512erintrin.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512ifmavlintrin.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512pfintrin.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/systemtopologyapi.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/syslimits.h:
+
+C:/mingw64/include/c++/13.2.0/cwctype:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmi2intrin.h:
+
+sal/miracl/includes/ecdh_C25519.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vlbwintrin.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/crtdefs.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vp2intersectvlintrin.h:
+
+sal/miracl/includes/config_big_B256_56.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxvnniint8intrin.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/sysinfoapi.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/hresetintrin.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cetintrin.h:
+
+C:/mingw64/include/oqs/kem_kyber.h:
+
+C:/mingw64/include/c++/13.2.0/bits/uses_allocator.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clzerointrin.h:
+
+sal/miracl/includes/rsa_RSA2048.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/pshpack4.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/f16cintrin.h:
+
+lib/tls_client_send.cpp:
+
+C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/gthr-default.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxfp16intrin.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fmaintrin.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fxsrintrin.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/winperf.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/gfniintrin.h:
+
+sal/miracl/includes/config_field_NIST256.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/ia32intrin.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/lwpintrin.h:
+
+C:/mingw64/include/c++/13.2.0/type_traits:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mm3dnow.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mmintrin.h:
+
+sal/miracl/includes/config_curve_Ed448.h:
+
+C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/c++locale.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mwaitintrin.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mwaitxintrin.h:
+
+lib/tls_tickets.cpp:
+
+C:/mingw64/x86_64-w64-mingw32/include/objidl.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pconfigintrin.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/smmintrin.h:
+
+C:/mingw64/include/c++/13.2.0/bits/exception_ptr.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pkuintrin.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/bemapiset.h:
+
+C:/mingw64/include/c++/13.2.0/cwchar:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/popcntintrin.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/prfchwintrin.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx2intrin.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/rdseedintrin.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/wmmintrin.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/shaintrin.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/rtmintrin.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/ws2tcpip.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tbmintrin.h:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tmmintrin.h:
+
+C:/mingw64/x86_64-w64-mingw32/include/servprov.h:
+
+C:/mingw64/include/c++/13.2.0/string:
+
+C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tsxldtrkintrin.h:
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/compiler_depend.ts b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/compiler_depend.ts
new file mode 100644
index 0000000..0bbd565
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/compiler_depend.ts
@@ -0,0 +1,2 @@
+# CMAKE generated file: DO NOT EDIT!
+# Timestamp file for compiler generated dependencies management for tiitls.
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/depend.make b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/depend.make
new file mode 100644
index 0000000..7d2f63d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/depend.make
@@ -0,0 +1,2 @@
+# Empty dependencies file for tiitls.
+# This may be replaced when dependencies are built.
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/flags.make b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/flags.make
new file mode 100644
index 0000000..8f0e988
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/flags.make
@@ -0,0 +1,10 @@
+# CMAKE generated file: DO NOT EDIT!
+# Generated by "MinGW Makefiles" Generator, CMake Version 3.28
+
+# compile CXX with C:/mingw64/bin/gcc.exe
+CXX_DEFINES = 
+
+CXX_INCLUDES = @CMakeFiles/tiitls.dir/includes_CXX.rsp
+
+CXX_FLAGS = 
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/includes_CXX.rsp b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/includes_CXX.rsp
new file mode 100644
index 0000000..75b7757
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/includes_CXX.rsp
@@ -0,0 +1 @@
+-I"D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include" -I"D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl" -I"D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes"
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/lib/ibe/tls_bfibe.cpp.obj b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/lib/ibe/tls_bfibe.cpp.obj
new file mode 100644
index 0000000..c42d03a
Binary files /dev/null and b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/lib/ibe/tls_bfibe.cpp.obj differ
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/lib/ibe/tls_bfibe.cpp.obj.d b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/lib/ibe/tls_bfibe.cpp.obj.d
new file mode 100644
index 0000000..f9fbb49
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/lib/ibe/tls_bfibe.cpp.obj.d
@@ -0,0 +1,58 @@
+CMakeFiles/tiitls.dir/lib/ibe/tls_bfibe.cpp.obj: \
+ D:\DOKUMENTY\diplomovka-final\Scott-cpp-win\lib\ibe\tls_bfibe.cpp \
+ C:/mingw64/x86_64-w64-mingw32/include/stdio.h \
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt_stdio_config.h \
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_mac.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_secapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/vadefs.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sdks/_mingw_ddk.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_off_t.h \
+ C:/mingw64/x86_64-w64-mingw32/include/swprintf.inl \
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/stdio_s.h \
+ C:/mingw64/include/c++/13.2.0/stdlib.h \
+ C:/mingw64/include/c++/13.2.0/cstdlib \
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/c++config.h \
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/os_defines.h \
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/cpu_defines.h \
+ C:/mingw64/include/c++/13.2.0/pstl/pstl_config.h \
+ C:/mingw64/x86_64-w64-mingw32/include/stdlib.h \
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt_wstdlib.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/limits.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/syslimits.h \
+ C:/mingw64/x86_64-w64-mingw32/include/limits.h \
+ C:/mingw64/x86_64-w64-mingw32/include/crtdefs.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/stdlib_s.h \
+ C:/mingw64/x86_64-w64-mingw32/include/malloc.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mm_malloc.h \
+ C:/mingw64/x86_64-w64-mingw32/include/errno.h \
+ C:/mingw64/include/c++/13.2.0/bits/std_abs.h \
+ C:/mingw64/x86_64-w64-mingw32/include/string.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/string_s.h \
+ C:/mingw64/x86_64-w64-mingw32/include/time.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sys/timeb.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/sys/timeb_s.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_timeval.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pthread_time.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/randapi.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/core.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stdbool.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stdint.h \
+ C:/mingw64/x86_64-w64-mingw32/include/stdint.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stddef.h \
+ C:/mingw64/x86_64-w64-mingw32/include/stddef.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/arch.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_bfibe.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/pair_BLS12381.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/fp12_BLS12381.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/fp4_BLS12381.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/fp2_BLS12381.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/fp_BLS12381.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/big_B384_58.h \
+ C:/mingw64/x86_64-w64-mingw32/include/inttypes.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/config_big_B384_58.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/config_field_BLS12381.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/config_curve_BLS12381.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/ecp2_BLS12381.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/ecp_BLS12381.h
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/lib/ibe/tls_pqibe.cpp.obj b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/lib/ibe/tls_pqibe.cpp.obj
new file mode 100644
index 0000000..094f5f8
Binary files /dev/null and b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/lib/ibe/tls_pqibe.cpp.obj differ
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/lib/ibe/tls_pqibe.cpp.obj.d b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/lib/ibe/tls_pqibe.cpp.obj.d
new file mode 100644
index 0000000..ea019db
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/lib/ibe/tls_pqibe.cpp.obj.d
@@ -0,0 +1,150 @@
+CMakeFiles/tiitls.dir/lib/ibe/tls_pqibe.cpp.obj: \
+ D:\DOKUMENTY\diplomovka-final\Scott-cpp-win\lib\ibe\tls_pqibe.cpp \
+ C:/mingw64/include/c++/13.2.0/iostream \
+ C:/mingw64/include/c++/13.2.0/bits/requires_hosted.h \
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/c++config.h \
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/os_defines.h \
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/cpu_defines.h \
+ C:/mingw64/include/c++/13.2.0/pstl/pstl_config.h \
+ C:/mingw64/include/c++/13.2.0/ostream C:/mingw64/include/c++/13.2.0/ios \
+ C:/mingw64/include/c++/13.2.0/iosfwd \
+ C:/mingw64/include/c++/13.2.0/bits/stringfwd.h \
+ C:/mingw64/include/c++/13.2.0/bits/memoryfwd.h \
+ C:/mingw64/include/c++/13.2.0/bits/postypes.h \
+ C:/mingw64/include/c++/13.2.0/cwchar \
+ C:/mingw64/x86_64-w64-mingw32/include/wchar.h \
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_mac.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_secapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/vadefs.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sdks/_mingw_ddk.h \
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt_stdio_config.h \
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt_wstdlib.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_off_t.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_stat64.h \
+ C:/mingw64/x86_64-w64-mingw32/include/swprintf.inl \
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/wchar_s.h \
+ C:/mingw64/include/c++/13.2.0/exception \
+ C:/mingw64/include/c++/13.2.0/bits/exception.h \
+ C:/mingw64/include/c++/13.2.0/bits/exception_ptr.h \
+ C:/mingw64/include/c++/13.2.0/bits/exception_defines.h \
+ C:/mingw64/include/c++/13.2.0/bits/cxxabi_init_exception.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stddef.h \
+ C:/mingw64/x86_64-w64-mingw32/include/stddef.h \
+ C:/mingw64/x86_64-w64-mingw32/include/crtdefs.h \
+ C:/mingw64/include/c++/13.2.0/typeinfo \
+ C:/mingw64/include/c++/13.2.0/bits/hash_bytes.h \
+ C:/mingw64/include/c++/13.2.0/new \
+ C:/mingw64/include/c++/13.2.0/bits/move.h \
+ C:/mingw64/include/c++/13.2.0/type_traits \
+ C:/mingw64/include/c++/13.2.0/bits/nested_exception.h \
+ C:/mingw64/include/c++/13.2.0/bits/char_traits.h \
+ C:/mingw64/include/c++/13.2.0/bits/localefwd.h \
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/c++locale.h \
+ C:/mingw64/include/c++/13.2.0/clocale \
+ C:/mingw64/x86_64-w64-mingw32/include/locale.h \
+ C:/mingw64/x86_64-w64-mingw32/include/stdio.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/stdio_s.h \
+ C:/mingw64/include/c++/13.2.0/cctype \
+ C:/mingw64/x86_64-w64-mingw32/include/ctype.h \
+ C:/mingw64/include/c++/13.2.0/bits/ios_base.h \
+ C:/mingw64/include/c++/13.2.0/ext/atomicity.h \
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/gthr.h \
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/gthr-default.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pthread.h \
+ C:/mingw64/x86_64-w64-mingw32/include/errno.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sys/types.h \
+ C:/mingw64/x86_64-w64-mingw32/include/process.h \
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt_startup.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/limits.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/syslimits.h \
+ C:/mingw64/x86_64-w64-mingw32/include/limits.h \
+ C:/mingw64/x86_64-w64-mingw32/include/signal.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pthread_signal.h \
+ C:/mingw64/x86_64-w64-mingw32/include/time.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sys/timeb.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/sys/timeb_s.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_timeval.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pthread_time.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pthread_compat.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pthread_unistd.h \
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/atomic_word.h \
+ C:/mingw64/include/c++/13.2.0/bits/locale_classes.h \
+ C:/mingw64/include/c++/13.2.0/string \
+ C:/mingw64/include/c++/13.2.0/bits/allocator.h \
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/c++allocator.h \
+ C:/mingw64/include/c++/13.2.0/bits/new_allocator.h \
+ C:/mingw64/include/c++/13.2.0/bits/functexcept.h \
+ C:/mingw64/include/c++/13.2.0/bits/cpp_type_traits.h \
+ C:/mingw64/include/c++/13.2.0/bits/ostream_insert.h \
+ C:/mingw64/include/c++/13.2.0/bits/cxxabi_forced.h \
+ C:/mingw64/include/c++/13.2.0/bits/stl_iterator_base_funcs.h \
+ C:/mingw64/include/c++/13.2.0/bits/concept_check.h \
+ C:/mingw64/include/c++/13.2.0/debug/assertions.h \
+ C:/mingw64/include/c++/13.2.0/bits/stl_iterator_base_types.h \
+ C:/mingw64/include/c++/13.2.0/bits/stl_iterator.h \
+ C:/mingw64/include/c++/13.2.0/ext/type_traits.h \
+ C:/mingw64/include/c++/13.2.0/bits/ptr_traits.h \
+ C:/mingw64/include/c++/13.2.0/bits/stl_function.h \
+ C:/mingw64/include/c++/13.2.0/backward/binders.h \
+ C:/mingw64/include/c++/13.2.0/ext/numeric_traits.h \
+ C:/mingw64/include/c++/13.2.0/bits/stl_algobase.h \
+ C:/mingw64/include/c++/13.2.0/bits/stl_pair.h \
+ C:/mingw64/include/c++/13.2.0/bits/utility.h \
+ C:/mingw64/include/c++/13.2.0/debug/debug.h \
+ C:/mingw64/include/c++/13.2.0/bits/predefined_ops.h \
+ C:/mingw64/include/c++/13.2.0/bit \
+ C:/mingw64/include/c++/13.2.0/bits/refwrap.h \
+ C:/mingw64/include/c++/13.2.0/bits/invoke.h \
+ C:/mingw64/include/c++/13.2.0/bits/range_access.h \
+ C:/mingw64/include/c++/13.2.0/initializer_list \
+ C:/mingw64/include/c++/13.2.0/bits/basic_string.h \
+ C:/mingw64/include/c++/13.2.0/ext/alloc_traits.h \
+ C:/mingw64/include/c++/13.2.0/bits/alloc_traits.h \
+ C:/mingw64/include/c++/13.2.0/bits/stl_construct.h \
+ C:/mingw64/include/c++/13.2.0/string_view \
+ C:/mingw64/include/c++/13.2.0/bits/functional_hash.h \
+ C:/mingw64/include/c++/13.2.0/bits/string_view.tcc \
+ C:/mingw64/include/c++/13.2.0/ext/string_conversions.h \
+ C:/mingw64/include/c++/13.2.0/cstdlib \
+ C:/mingw64/x86_64-w64-mingw32/include/stdlib.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/stdlib_s.h \
+ C:/mingw64/include/c++/13.2.0/stdlib.h \
+ C:/mingw64/x86_64-w64-mingw32/include/malloc.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mm_malloc.h \
+ C:/mingw64/include/c++/13.2.0/bits/std_abs.h \
+ C:/mingw64/include/c++/13.2.0/cstdio \
+ C:/mingw64/include/c++/13.2.0/cerrno \
+ C:/mingw64/include/c++/13.2.0/bits/charconv.h \
+ C:/mingw64/include/c++/13.2.0/bits/basic_string.tcc \
+ C:/mingw64/include/c++/13.2.0/bits/memory_resource.h \
+ C:/mingw64/include/c++/13.2.0/cstddef \
+ C:/mingw64/include/c++/13.2.0/bits/uses_allocator.h \
+ C:/mingw64/include/c++/13.2.0/bits/uses_allocator_args.h \
+ C:/mingw64/include/c++/13.2.0/tuple \
+ C:/mingw64/include/c++/13.2.0/bits/locale_classes.tcc \
+ C:/mingw64/include/c++/13.2.0/system_error \
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/error_constants.h \
+ C:/mingw64/include/c++/13.2.0/stdexcept \
+ C:/mingw64/include/c++/13.2.0/streambuf \
+ C:/mingw64/include/c++/13.2.0/bits/streambuf.tcc \
+ C:/mingw64/include/c++/13.2.0/bits/basic_ios.h \
+ C:/mingw64/include/c++/13.2.0/bits/locale_facets.h \
+ C:/mingw64/include/c++/13.2.0/cwctype \
+ C:/mingw64/x86_64-w64-mingw32/include/wctype.h \
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/ctype_base.h \
+ C:/mingw64/include/c++/13.2.0/bits/streambuf_iterator.h \
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/ctype_inline.h \
+ C:/mingw64/include/c++/13.2.0/bits/locale_facets.tcc \
+ C:/mingw64/include/c++/13.2.0/bits/basic_ios.tcc \
+ C:/mingw64/include/c++/13.2.0/bits/ostream.tcc \
+ C:/mingw64/include/c++/13.2.0/istream \
+ C:/mingw64/include/c++/13.2.0/bits/istream.tcc \
+ C:/mingw64/include/c++/13.2.0/cstdint \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stdint.h \
+ C:/mingw64/x86_64-w64-mingw32/include/stdint.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_pqibe.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/core.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stdbool.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/arch.h
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/lib/tls_cacerts.cpp.obj b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/lib/tls_cacerts.cpp.obj
new file mode 100644
index 0000000..9141ef9
Binary files /dev/null and b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/lib/tls_cacerts.cpp.obj differ
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/lib/tls_cacerts.cpp.obj.d b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/lib/tls_cacerts.cpp.obj.d
new file mode 100644
index 0000000..d569482
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/lib/tls_cacerts.cpp.obj.d
@@ -0,0 +1,304 @@
+CMakeFiles/tiitls.dir/lib/tls_cacerts.cpp.obj: \
+ D:\DOKUMENTY\diplomovka-final\Scott-cpp-win\lib\tls_cacerts.cpp \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_certs.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls1_3.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stdint.h \
+ C:/mingw64/x86_64-w64-mingw32/include/stdint.h \
+ C:/mingw64/x86_64-w64-mingw32/include/crtdefs.h \
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_mac.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_secapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/vadefs.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sdks/_mingw_ddk.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stddef.h \
+ C:/mingw64/x86_64-w64-mingw32/include/stddef.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_octads.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_sockets.h \
+ C:/mingw64/x86_64-w64-mingw32/include/string.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/string_s.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winsock2.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_unicode.h \
+ C:/mingw64/x86_64-w64-mingw32/include/windows.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sdkddkver.h \
+ C:/mingw64/x86_64-w64-mingw32/include/excpt.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stdarg.h \
+ C:/mingw64/x86_64-w64-mingw32/include/stdarg.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_stdarg.h \
+ C:/mingw64/x86_64-w64-mingw32/include/windef.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winapifamily.h \
+ C:/mingw64/x86_64-w64-mingw32/include/minwindef.h \
+ C:/mingw64/x86_64-w64-mingw32/include/specstrings.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sal.h \
+ C:/mingw64/x86_64-w64-mingw32/include/concurrencysal.h \
+ C:/mingw64/x86_64-w64-mingw32/include/driverspecs.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winnt.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ctype.h \
+ C:/mingw64/x86_64-w64-mingw32/include/apiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/intrin-impl.h \
+ C:/mingw64/x86_64-w64-mingw32/include/basetsd.h \
+ C:/mingw64/x86_64-w64-mingw32/include/guiddef.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/x86intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/x86gprintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/ia32intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/adxintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/bmiintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/bmi2intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cetintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cldemoteintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clflushoptintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clwbintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clzerointrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cmpccxaddintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/enqcmdintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fxsrintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/lzcntintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/lwpintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/movdirintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mwaitintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mwaitxintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pconfigintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/popcntintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pkuintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/prfchiintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/raointintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/rdseedintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/rtmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/serializeintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/sgxintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tbmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tsxldtrkintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/uintrintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/waitpkgintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/wbnoinvdintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsaveintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsavecintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsaveoptintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsavesintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xtestintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/hresetintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/immintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xmmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mm_malloc.h \
+ C:/mingw64/include/c++/13.2.0/stdlib.h \
+ C:/mingw64/include/c++/13.2.0/cstdlib \
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/c++config.h \
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/os_defines.h \
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/cpu_defines.h \
+ C:/mingw64/include/c++/13.2.0/pstl/pstl_config.h \
+ C:/mingw64/x86_64-w64-mingw32/include/stdlib.h \
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt_wstdlib.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/limits.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/syslimits.h \
+ C:/mingw64/x86_64-w64-mingw32/include/limits.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/stdlib_s.h \
+ C:/mingw64/x86_64-w64-mingw32/include/malloc.h \
+ C:/mingw64/include/c++/13.2.0/bits/std_abs.h \
+ C:/mingw64/x86_64-w64-mingw32/include/errno.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/emmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pmmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tmmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/smmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/wmmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxvnniintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxifmaintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxvnniint8intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx2intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512erintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512pfintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512cdintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bwintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512dqintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vlbwintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vldqintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512ifmaintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512ifmavlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmiintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmivlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx5124fmapsintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx5124vnniwintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vpopcntdqintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmi2intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmi2vlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vnniintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vnnivlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vpopcntdqvlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bitalgintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vp2intersectintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vp2intersectvlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fp16intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fp16vlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/shaintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fmaintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/f16cintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/gfniintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/vaesintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/vpclmulqdqintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bf16vlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bf16intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxneconvertintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxtileintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxint8intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxbf16intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxcomplexintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/prfchwintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/keylockerintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxfp16intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mm3dnow.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fma4intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/ammintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xopintrin.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack4.h \
+ C:/mingw64/x86_64-w64-mingw32/include/poppack.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack4.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack2.h \
+ C:/mingw64/x86_64-w64-mingw32/include/poppack.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack2.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack8.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack8.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ktmtypes.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winbase.h \
+ C:/mingw64/x86_64-w64-mingw32/include/apisetcconv.h \
+ C:/mingw64/x86_64-w64-mingw32/include/minwinbase.h \
+ C:/mingw64/x86_64-w64-mingw32/include/bemapiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/debugapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/errhandlingapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/fibersapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/fileapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/handleapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/heapapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ioapiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/interlockedapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/jobapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/libloaderapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/memoryapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/namedpipeapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/namespaceapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/processenv.h \
+ C:/mingw64/x86_64-w64-mingw32/include/processthreadsapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/processtopologyapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/profileapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/realtimeapiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/securityappcontainer.h \
+ C:/mingw64/x86_64-w64-mingw32/include/securitybaseapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/synchapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sysinfoapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/systemtopologyapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/threadpoolapiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/threadpoollegacyapiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/utilapiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/wow64apiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winerror.h \
+ C:/mingw64/x86_64-w64-mingw32/include/fltwinerror.h \
+ C:/mingw64/x86_64-w64-mingw32/include/timezoneapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/wingdi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack1.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winuser.h \
+ C:/mingw64/x86_64-w64-mingw32/include/tvout.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winnls.h \
+ C:/mingw64/x86_64-w64-mingw32/include/datetimeapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/stringapiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/wincon.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winver.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winreg.h \
+ C:/mingw64/x86_64-w64-mingw32/include/reason.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winnetwk.h \
+ C:/mingw64/x86_64-w64-mingw32/include/wnnc.h \
+ C:/mingw64/x86_64-w64-mingw32/include/virtdisk.h \
+ C:/mingw64/x86_64-w64-mingw32/include/cderr.h \
+ C:/mingw64/x86_64-w64-mingw32/include/dde.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ddeml.h \
+ C:/mingw64/x86_64-w64-mingw32/include/dlgs.h \
+ C:/mingw64/x86_64-w64-mingw32/include/lzexpand.h \
+ C:/mingw64/x86_64-w64-mingw32/include/mmsystem.h \
+ C:/mingw64/x86_64-w64-mingw32/include/mmsyscom.h \
+ C:/mingw64/x86_64-w64-mingw32/include/mciapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/mmiscapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/mmiscapi2.h \
+ C:/mingw64/x86_64-w64-mingw32/include/playsoundapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/mmeapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/timeapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/joystickapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/nb30.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpc.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpcdce.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpcdcep.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpcnsi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpcnterr.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpcasync.h \
+ C:/mingw64/x86_64-w64-mingw32/include/shellapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winperf.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winsock.h \
+ C:/mingw64/x86_64-w64-mingw32/include/wincrypt.h \
+ C:/mingw64/x86_64-w64-mingw32/include/bcrypt.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ncrypt.h \
+ C:/mingw64/x86_64-w64-mingw32/include/dpapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winefs.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winscard.h \
+ C:/mingw64/x86_64-w64-mingw32/include/wtypes.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpcndr.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpcnsip.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpcsal.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ole2.h \
+ C:/mingw64/x86_64-w64-mingw32/include/objbase.h \
+ C:/mingw64/x86_64-w64-mingw32/include/combaseapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/wtypesbase.h \
+ C:/mingw64/x86_64-w64-mingw32/include/unknwnbase.h \
+ C:/mingw64/x86_64-w64-mingw32/include/objidlbase.h \
+ C:/mingw64/x86_64-w64-mingw32/include/cguid.h \
+ C:/mingw64/x86_64-w64-mingw32/include/objidl.h \
+ C:/mingw64/x86_64-w64-mingw32/include/unknwn.h \
+ C:/mingw64/x86_64-w64-mingw32/include/urlmon.h \
+ C:/mingw64/x86_64-w64-mingw32/include/oleidl.h \
+ C:/mingw64/x86_64-w64-mingw32/include/servprov.h \
+ C:/mingw64/x86_64-w64-mingw32/include/msxml.h \
+ C:/mingw64/x86_64-w64-mingw32/include/oaidl.h \
+ C:/mingw64/x86_64-w64-mingw32/include/propidl.h \
+ C:/mingw64/x86_64-w64-mingw32/include/oleauto.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winioctl.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winsmcrd.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winspool.h \
+ C:/mingw64/x86_64-w64-mingw32/include/prsht.h \
+ C:/mingw64/x86_64-w64-mingw32/include/commdlg.h \
+ C:/mingw64/x86_64-w64-mingw32/include/stralign.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/stralign_s.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winsvc.h \
+ C:/mingw64/x86_64-w64-mingw32/include/mcx.h \
+ C:/mingw64/x86_64-w64-mingw32/include/imm.h \
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ws1_undef.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_timeval.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_bsd_types.h \
+ C:/mingw64/x86_64-w64-mingw32/include/inaddr.h \
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_socket_types.h \
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_fd_types.h \
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ip_types.h \
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_wsadata.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ws2def.h \
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_wsa_errnos.h \
+ C:/mingw64/x86_64-w64-mingw32/include/qos.h \
+ C:/mingw64/x86_64-w64-mingw32/include/afunix.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ws2tcpip.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ws2ipdef.h \
+ C:/mingw64/x86_64-w64-mingw32/include/in6addr.h \
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ip_mreq1.h \
+ C:/mingw64/x86_64-w64-mingw32/include/mstcpip.h \
+ C:/mingw64/x86_64-w64-mingw32/include/time.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sys/timeb.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/sys/timeb_s.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pthread_time.h \
+ C:/mingw64/x86_64-w64-mingw32/include/unistd.h \
+ C:/mingw64/x86_64-w64-mingw32/include/io.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_off_t.h \
+ C:/mingw64/x86_64-w64-mingw32/include/process.h \
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt_startup.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sys/types.h \
+ C:/mingw64/x86_64-w64-mingw32/include/getopt.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pthread_unistd.h \
+ C:/mingw64/x86_64-w64-mingw32/include/stdio.h \
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt_stdio_config.h \
+ C:/mingw64/x86_64-w64-mingw32/include/swprintf.inl \
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/stdio_s.h
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/lib/tls_cert_chain.cpp.obj b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/lib/tls_cert_chain.cpp.obj
new file mode 100644
index 0000000..03535a4
Binary files /dev/null and b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/lib/tls_cert_chain.cpp.obj differ
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/lib/tls_cert_chain.cpp.obj.d b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/lib/tls_cert_chain.cpp.obj.d
new file mode 100644
index 0000000..1429d5e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/lib/tls_cert_chain.cpp.obj.d
@@ -0,0 +1,311 @@
+CMakeFiles/tiitls.dir/lib/tls_cert_chain.cpp.obj: \
+ D:\DOKUMENTY\diplomovka-final\Scott-cpp-win\lib\tls_cert_chain.cpp \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_cert_chain.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls1_3.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stdint.h \
+ C:/mingw64/x86_64-w64-mingw32/include/stdint.h \
+ C:/mingw64/x86_64-w64-mingw32/include/crtdefs.h \
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_mac.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_secapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/vadefs.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sdks/_mingw_ddk.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stddef.h \
+ C:/mingw64/x86_64-w64-mingw32/include/stddef.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_octads.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_sockets.h \
+ C:/mingw64/x86_64-w64-mingw32/include/string.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/string_s.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winsock2.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_unicode.h \
+ C:/mingw64/x86_64-w64-mingw32/include/windows.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sdkddkver.h \
+ C:/mingw64/x86_64-w64-mingw32/include/excpt.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stdarg.h \
+ C:/mingw64/x86_64-w64-mingw32/include/stdarg.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_stdarg.h \
+ C:/mingw64/x86_64-w64-mingw32/include/windef.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winapifamily.h \
+ C:/mingw64/x86_64-w64-mingw32/include/minwindef.h \
+ C:/mingw64/x86_64-w64-mingw32/include/specstrings.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sal.h \
+ C:/mingw64/x86_64-w64-mingw32/include/concurrencysal.h \
+ C:/mingw64/x86_64-w64-mingw32/include/driverspecs.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winnt.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ctype.h \
+ C:/mingw64/x86_64-w64-mingw32/include/apiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/intrin-impl.h \
+ C:/mingw64/x86_64-w64-mingw32/include/basetsd.h \
+ C:/mingw64/x86_64-w64-mingw32/include/guiddef.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/x86intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/x86gprintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/ia32intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/adxintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/bmiintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/bmi2intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cetintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cldemoteintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clflushoptintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clwbintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clzerointrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cmpccxaddintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/enqcmdintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fxsrintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/lzcntintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/lwpintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/movdirintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mwaitintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mwaitxintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pconfigintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/popcntintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pkuintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/prfchiintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/raointintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/rdseedintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/rtmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/serializeintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/sgxintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tbmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tsxldtrkintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/uintrintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/waitpkgintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/wbnoinvdintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsaveintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsavecintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsaveoptintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsavesintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xtestintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/hresetintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/immintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xmmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mm_malloc.h \
+ C:/mingw64/include/c++/13.2.0/stdlib.h \
+ C:/mingw64/include/c++/13.2.0/cstdlib \
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/c++config.h \
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/os_defines.h \
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/cpu_defines.h \
+ C:/mingw64/include/c++/13.2.0/pstl/pstl_config.h \
+ C:/mingw64/x86_64-w64-mingw32/include/stdlib.h \
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt_wstdlib.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/limits.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/syslimits.h \
+ C:/mingw64/x86_64-w64-mingw32/include/limits.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/stdlib_s.h \
+ C:/mingw64/x86_64-w64-mingw32/include/malloc.h \
+ C:/mingw64/include/c++/13.2.0/bits/std_abs.h \
+ C:/mingw64/x86_64-w64-mingw32/include/errno.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/emmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pmmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tmmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/smmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/wmmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxvnniintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxifmaintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxvnniint8intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx2intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512erintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512pfintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512cdintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bwintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512dqintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vlbwintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vldqintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512ifmaintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512ifmavlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmiintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmivlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx5124fmapsintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx5124vnniwintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vpopcntdqintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmi2intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmi2vlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vnniintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vnnivlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vpopcntdqvlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bitalgintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vp2intersectintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vp2intersectvlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fp16intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fp16vlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/shaintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fmaintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/f16cintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/gfniintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/vaesintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/vpclmulqdqintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bf16vlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bf16intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxneconvertintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxtileintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxint8intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxbf16intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxcomplexintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/prfchwintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/keylockerintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxfp16intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mm3dnow.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fma4intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/ammintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xopintrin.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack4.h \
+ C:/mingw64/x86_64-w64-mingw32/include/poppack.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack4.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack2.h \
+ C:/mingw64/x86_64-w64-mingw32/include/poppack.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack2.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack8.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack8.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ktmtypes.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winbase.h \
+ C:/mingw64/x86_64-w64-mingw32/include/apisetcconv.h \
+ C:/mingw64/x86_64-w64-mingw32/include/minwinbase.h \
+ C:/mingw64/x86_64-w64-mingw32/include/bemapiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/debugapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/errhandlingapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/fibersapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/fileapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/handleapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/heapapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ioapiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/interlockedapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/jobapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/libloaderapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/memoryapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/namedpipeapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/namespaceapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/processenv.h \
+ C:/mingw64/x86_64-w64-mingw32/include/processthreadsapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/processtopologyapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/profileapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/realtimeapiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/securityappcontainer.h \
+ C:/mingw64/x86_64-w64-mingw32/include/securitybaseapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/synchapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sysinfoapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/systemtopologyapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/threadpoolapiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/threadpoollegacyapiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/utilapiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/wow64apiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winerror.h \
+ C:/mingw64/x86_64-w64-mingw32/include/fltwinerror.h \
+ C:/mingw64/x86_64-w64-mingw32/include/timezoneapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/wingdi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack1.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winuser.h \
+ C:/mingw64/x86_64-w64-mingw32/include/tvout.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winnls.h \
+ C:/mingw64/x86_64-w64-mingw32/include/datetimeapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/stringapiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/wincon.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winver.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winreg.h \
+ C:/mingw64/x86_64-w64-mingw32/include/reason.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winnetwk.h \
+ C:/mingw64/x86_64-w64-mingw32/include/wnnc.h \
+ C:/mingw64/x86_64-w64-mingw32/include/virtdisk.h \
+ C:/mingw64/x86_64-w64-mingw32/include/cderr.h \
+ C:/mingw64/x86_64-w64-mingw32/include/dde.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ddeml.h \
+ C:/mingw64/x86_64-w64-mingw32/include/dlgs.h \
+ C:/mingw64/x86_64-w64-mingw32/include/lzexpand.h \
+ C:/mingw64/x86_64-w64-mingw32/include/mmsystem.h \
+ C:/mingw64/x86_64-w64-mingw32/include/mmsyscom.h \
+ C:/mingw64/x86_64-w64-mingw32/include/mciapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/mmiscapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/mmiscapi2.h \
+ C:/mingw64/x86_64-w64-mingw32/include/playsoundapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/mmeapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/timeapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/joystickapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/nb30.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpc.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpcdce.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpcdcep.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpcnsi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpcnterr.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpcasync.h \
+ C:/mingw64/x86_64-w64-mingw32/include/shellapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winperf.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winsock.h \
+ C:/mingw64/x86_64-w64-mingw32/include/wincrypt.h \
+ C:/mingw64/x86_64-w64-mingw32/include/bcrypt.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ncrypt.h \
+ C:/mingw64/x86_64-w64-mingw32/include/dpapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winefs.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winscard.h \
+ C:/mingw64/x86_64-w64-mingw32/include/wtypes.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpcndr.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpcnsip.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpcsal.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ole2.h \
+ C:/mingw64/x86_64-w64-mingw32/include/objbase.h \
+ C:/mingw64/x86_64-w64-mingw32/include/combaseapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/wtypesbase.h \
+ C:/mingw64/x86_64-w64-mingw32/include/unknwnbase.h \
+ C:/mingw64/x86_64-w64-mingw32/include/objidlbase.h \
+ C:/mingw64/x86_64-w64-mingw32/include/cguid.h \
+ C:/mingw64/x86_64-w64-mingw32/include/objidl.h \
+ C:/mingw64/x86_64-w64-mingw32/include/unknwn.h \
+ C:/mingw64/x86_64-w64-mingw32/include/urlmon.h \
+ C:/mingw64/x86_64-w64-mingw32/include/oleidl.h \
+ C:/mingw64/x86_64-w64-mingw32/include/servprov.h \
+ C:/mingw64/x86_64-w64-mingw32/include/msxml.h \
+ C:/mingw64/x86_64-w64-mingw32/include/oaidl.h \
+ C:/mingw64/x86_64-w64-mingw32/include/propidl.h \
+ C:/mingw64/x86_64-w64-mingw32/include/oleauto.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winioctl.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winsmcrd.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winspool.h \
+ C:/mingw64/x86_64-w64-mingw32/include/prsht.h \
+ C:/mingw64/x86_64-w64-mingw32/include/commdlg.h \
+ C:/mingw64/x86_64-w64-mingw32/include/stralign.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/stralign_s.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winsvc.h \
+ C:/mingw64/x86_64-w64-mingw32/include/mcx.h \
+ C:/mingw64/x86_64-w64-mingw32/include/imm.h \
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ws1_undef.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_timeval.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_bsd_types.h \
+ C:/mingw64/x86_64-w64-mingw32/include/inaddr.h \
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_socket_types.h \
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_fd_types.h \
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ip_types.h \
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_wsadata.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ws2def.h \
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_wsa_errnos.h \
+ C:/mingw64/x86_64-w64-mingw32/include/qos.h \
+ C:/mingw64/x86_64-w64-mingw32/include/afunix.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ws2tcpip.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ws2ipdef.h \
+ C:/mingw64/x86_64-w64-mingw32/include/in6addr.h \
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ip_mreq1.h \
+ C:/mingw64/x86_64-w64-mingw32/include/mstcpip.h \
+ C:/mingw64/x86_64-w64-mingw32/include/time.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sys/timeb.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/sys/timeb_s.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pthread_time.h \
+ C:/mingw64/x86_64-w64-mingw32/include/unistd.h \
+ C:/mingw64/x86_64-w64-mingw32/include/io.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_off_t.h \
+ C:/mingw64/x86_64-w64-mingw32/include/process.h \
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt_startup.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sys/types.h \
+ C:/mingw64/x86_64-w64-mingw32/include/getopt.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pthread_unistd.h \
+ C:/mingw64/x86_64-w64-mingw32/include/stdio.h \
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt_stdio_config.h \
+ C:/mingw64/x86_64-w64-mingw32/include/swprintf.inl \
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/stdio_s.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_x509.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_sal.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_client_recv.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_keys_calc.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_client_send.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_logger.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_certs.h
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/lib/tls_client_cert.cpp.obj b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/lib/tls_client_cert.cpp.obj
new file mode 100644
index 0000000..a3d3e5c
Binary files /dev/null and b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/lib/tls_client_cert.cpp.obj differ
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/lib/tls_client_cert.cpp.obj.d b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/lib/tls_client_cert.cpp.obj.d
new file mode 100644
index 0000000..d85ea1a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/lib/tls_client_cert.cpp.obj.d
@@ -0,0 +1,304 @@
+CMakeFiles/tiitls.dir/lib/tls_client_cert.cpp.obj: \
+ D:\DOKUMENTY\diplomovka-final\Scott-cpp-win\lib\tls_client_cert.cpp \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_certs.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls1_3.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stdint.h \
+ C:/mingw64/x86_64-w64-mingw32/include/stdint.h \
+ C:/mingw64/x86_64-w64-mingw32/include/crtdefs.h \
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_mac.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_secapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/vadefs.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sdks/_mingw_ddk.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stddef.h \
+ C:/mingw64/x86_64-w64-mingw32/include/stddef.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_octads.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_sockets.h \
+ C:/mingw64/x86_64-w64-mingw32/include/string.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/string_s.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winsock2.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_unicode.h \
+ C:/mingw64/x86_64-w64-mingw32/include/windows.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sdkddkver.h \
+ C:/mingw64/x86_64-w64-mingw32/include/excpt.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stdarg.h \
+ C:/mingw64/x86_64-w64-mingw32/include/stdarg.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_stdarg.h \
+ C:/mingw64/x86_64-w64-mingw32/include/windef.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winapifamily.h \
+ C:/mingw64/x86_64-w64-mingw32/include/minwindef.h \
+ C:/mingw64/x86_64-w64-mingw32/include/specstrings.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sal.h \
+ C:/mingw64/x86_64-w64-mingw32/include/concurrencysal.h \
+ C:/mingw64/x86_64-w64-mingw32/include/driverspecs.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winnt.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ctype.h \
+ C:/mingw64/x86_64-w64-mingw32/include/apiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/intrin-impl.h \
+ C:/mingw64/x86_64-w64-mingw32/include/basetsd.h \
+ C:/mingw64/x86_64-w64-mingw32/include/guiddef.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/x86intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/x86gprintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/ia32intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/adxintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/bmiintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/bmi2intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cetintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cldemoteintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clflushoptintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clwbintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clzerointrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cmpccxaddintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/enqcmdintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fxsrintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/lzcntintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/lwpintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/movdirintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mwaitintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mwaitxintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pconfigintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/popcntintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pkuintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/prfchiintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/raointintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/rdseedintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/rtmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/serializeintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/sgxintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tbmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tsxldtrkintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/uintrintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/waitpkgintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/wbnoinvdintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsaveintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsavecintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsaveoptintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsavesintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xtestintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/hresetintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/immintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xmmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mm_malloc.h \
+ C:/mingw64/include/c++/13.2.0/stdlib.h \
+ C:/mingw64/include/c++/13.2.0/cstdlib \
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/c++config.h \
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/os_defines.h \
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/cpu_defines.h \
+ C:/mingw64/include/c++/13.2.0/pstl/pstl_config.h \
+ C:/mingw64/x86_64-w64-mingw32/include/stdlib.h \
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt_wstdlib.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/limits.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/syslimits.h \
+ C:/mingw64/x86_64-w64-mingw32/include/limits.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/stdlib_s.h \
+ C:/mingw64/x86_64-w64-mingw32/include/malloc.h \
+ C:/mingw64/include/c++/13.2.0/bits/std_abs.h \
+ C:/mingw64/x86_64-w64-mingw32/include/errno.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/emmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pmmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tmmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/smmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/wmmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxvnniintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxifmaintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxvnniint8intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx2intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512erintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512pfintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512cdintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bwintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512dqintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vlbwintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vldqintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512ifmaintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512ifmavlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmiintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmivlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx5124fmapsintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx5124vnniwintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vpopcntdqintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmi2intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmi2vlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vnniintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vnnivlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vpopcntdqvlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bitalgintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vp2intersectintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vp2intersectvlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fp16intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fp16vlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/shaintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fmaintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/f16cintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/gfniintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/vaesintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/vpclmulqdqintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bf16vlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bf16intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxneconvertintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxtileintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxint8intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxbf16intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxcomplexintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/prfchwintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/keylockerintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxfp16intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mm3dnow.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fma4intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/ammintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xopintrin.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack4.h \
+ C:/mingw64/x86_64-w64-mingw32/include/poppack.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack4.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack2.h \
+ C:/mingw64/x86_64-w64-mingw32/include/poppack.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack2.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack8.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack8.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ktmtypes.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winbase.h \
+ C:/mingw64/x86_64-w64-mingw32/include/apisetcconv.h \
+ C:/mingw64/x86_64-w64-mingw32/include/minwinbase.h \
+ C:/mingw64/x86_64-w64-mingw32/include/bemapiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/debugapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/errhandlingapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/fibersapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/fileapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/handleapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/heapapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ioapiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/interlockedapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/jobapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/libloaderapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/memoryapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/namedpipeapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/namespaceapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/processenv.h \
+ C:/mingw64/x86_64-w64-mingw32/include/processthreadsapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/processtopologyapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/profileapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/realtimeapiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/securityappcontainer.h \
+ C:/mingw64/x86_64-w64-mingw32/include/securitybaseapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/synchapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sysinfoapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/systemtopologyapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/threadpoolapiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/threadpoollegacyapiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/utilapiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/wow64apiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winerror.h \
+ C:/mingw64/x86_64-w64-mingw32/include/fltwinerror.h \
+ C:/mingw64/x86_64-w64-mingw32/include/timezoneapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/wingdi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack1.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winuser.h \
+ C:/mingw64/x86_64-w64-mingw32/include/tvout.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winnls.h \
+ C:/mingw64/x86_64-w64-mingw32/include/datetimeapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/stringapiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/wincon.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winver.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winreg.h \
+ C:/mingw64/x86_64-w64-mingw32/include/reason.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winnetwk.h \
+ C:/mingw64/x86_64-w64-mingw32/include/wnnc.h \
+ C:/mingw64/x86_64-w64-mingw32/include/virtdisk.h \
+ C:/mingw64/x86_64-w64-mingw32/include/cderr.h \
+ C:/mingw64/x86_64-w64-mingw32/include/dde.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ddeml.h \
+ C:/mingw64/x86_64-w64-mingw32/include/dlgs.h \
+ C:/mingw64/x86_64-w64-mingw32/include/lzexpand.h \
+ C:/mingw64/x86_64-w64-mingw32/include/mmsystem.h \
+ C:/mingw64/x86_64-w64-mingw32/include/mmsyscom.h \
+ C:/mingw64/x86_64-w64-mingw32/include/mciapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/mmiscapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/mmiscapi2.h \
+ C:/mingw64/x86_64-w64-mingw32/include/playsoundapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/mmeapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/timeapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/joystickapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/nb30.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpc.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpcdce.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpcdcep.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpcnsi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpcnterr.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpcasync.h \
+ C:/mingw64/x86_64-w64-mingw32/include/shellapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winperf.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winsock.h \
+ C:/mingw64/x86_64-w64-mingw32/include/wincrypt.h \
+ C:/mingw64/x86_64-w64-mingw32/include/bcrypt.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ncrypt.h \
+ C:/mingw64/x86_64-w64-mingw32/include/dpapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winefs.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winscard.h \
+ C:/mingw64/x86_64-w64-mingw32/include/wtypes.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpcndr.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpcnsip.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpcsal.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ole2.h \
+ C:/mingw64/x86_64-w64-mingw32/include/objbase.h \
+ C:/mingw64/x86_64-w64-mingw32/include/combaseapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/wtypesbase.h \
+ C:/mingw64/x86_64-w64-mingw32/include/unknwnbase.h \
+ C:/mingw64/x86_64-w64-mingw32/include/objidlbase.h \
+ C:/mingw64/x86_64-w64-mingw32/include/cguid.h \
+ C:/mingw64/x86_64-w64-mingw32/include/objidl.h \
+ C:/mingw64/x86_64-w64-mingw32/include/unknwn.h \
+ C:/mingw64/x86_64-w64-mingw32/include/urlmon.h \
+ C:/mingw64/x86_64-w64-mingw32/include/oleidl.h \
+ C:/mingw64/x86_64-w64-mingw32/include/servprov.h \
+ C:/mingw64/x86_64-w64-mingw32/include/msxml.h \
+ C:/mingw64/x86_64-w64-mingw32/include/oaidl.h \
+ C:/mingw64/x86_64-w64-mingw32/include/propidl.h \
+ C:/mingw64/x86_64-w64-mingw32/include/oleauto.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winioctl.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winsmcrd.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winspool.h \
+ C:/mingw64/x86_64-w64-mingw32/include/prsht.h \
+ C:/mingw64/x86_64-w64-mingw32/include/commdlg.h \
+ C:/mingw64/x86_64-w64-mingw32/include/stralign.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/stralign_s.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winsvc.h \
+ C:/mingw64/x86_64-w64-mingw32/include/mcx.h \
+ C:/mingw64/x86_64-w64-mingw32/include/imm.h \
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ws1_undef.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_timeval.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_bsd_types.h \
+ C:/mingw64/x86_64-w64-mingw32/include/inaddr.h \
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_socket_types.h \
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_fd_types.h \
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ip_types.h \
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_wsadata.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ws2def.h \
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_wsa_errnos.h \
+ C:/mingw64/x86_64-w64-mingw32/include/qos.h \
+ C:/mingw64/x86_64-w64-mingw32/include/afunix.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ws2tcpip.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ws2ipdef.h \
+ C:/mingw64/x86_64-w64-mingw32/include/in6addr.h \
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ip_mreq1.h \
+ C:/mingw64/x86_64-w64-mingw32/include/mstcpip.h \
+ C:/mingw64/x86_64-w64-mingw32/include/time.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sys/timeb.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/sys/timeb_s.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pthread_time.h \
+ C:/mingw64/x86_64-w64-mingw32/include/unistd.h \
+ C:/mingw64/x86_64-w64-mingw32/include/io.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_off_t.h \
+ C:/mingw64/x86_64-w64-mingw32/include/process.h \
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt_startup.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sys/types.h \
+ C:/mingw64/x86_64-w64-mingw32/include/getopt.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pthread_unistd.h \
+ C:/mingw64/x86_64-w64-mingw32/include/stdio.h \
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt_stdio_config.h \
+ C:/mingw64/x86_64-w64-mingw32/include/swprintf.inl \
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/stdio_s.h
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/lib/tls_client_recv.cpp.obj b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/lib/tls_client_recv.cpp.obj
new file mode 100644
index 0000000..686bab1
Binary files /dev/null and b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/lib/tls_client_recv.cpp.obj differ
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/lib/tls_client_recv.cpp.obj.d b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/lib/tls_client_recv.cpp.obj.d
new file mode 100644
index 0000000..b7ae333
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/lib/tls_client_recv.cpp.obj.d
@@ -0,0 +1,313 @@
+CMakeFiles/tiitls.dir/lib/tls_client_recv.cpp.obj: \
+ D:\DOKUMENTY\diplomovka-final\Scott-cpp-win\lib\tls_client_recv.cpp \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_client_recv.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_sal.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls1_3.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stdint.h \
+ C:/mingw64/x86_64-w64-mingw32/include/stdint.h \
+ C:/mingw64/x86_64-w64-mingw32/include/crtdefs.h \
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_mac.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_secapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/vadefs.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sdks/_mingw_ddk.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stddef.h \
+ C:/mingw64/x86_64-w64-mingw32/include/stddef.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_octads.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_sockets.h \
+ C:/mingw64/x86_64-w64-mingw32/include/string.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/string_s.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winsock2.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_unicode.h \
+ C:/mingw64/x86_64-w64-mingw32/include/windows.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sdkddkver.h \
+ C:/mingw64/x86_64-w64-mingw32/include/excpt.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stdarg.h \
+ C:/mingw64/x86_64-w64-mingw32/include/stdarg.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_stdarg.h \
+ C:/mingw64/x86_64-w64-mingw32/include/windef.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winapifamily.h \
+ C:/mingw64/x86_64-w64-mingw32/include/minwindef.h \
+ C:/mingw64/x86_64-w64-mingw32/include/specstrings.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sal.h \
+ C:/mingw64/x86_64-w64-mingw32/include/concurrencysal.h \
+ C:/mingw64/x86_64-w64-mingw32/include/driverspecs.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winnt.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ctype.h \
+ C:/mingw64/x86_64-w64-mingw32/include/apiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/intrin-impl.h \
+ C:/mingw64/x86_64-w64-mingw32/include/basetsd.h \
+ C:/mingw64/x86_64-w64-mingw32/include/guiddef.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/x86intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/x86gprintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/ia32intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/adxintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/bmiintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/bmi2intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cetintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cldemoteintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clflushoptintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clwbintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clzerointrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cmpccxaddintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/enqcmdintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fxsrintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/lzcntintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/lwpintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/movdirintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mwaitintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mwaitxintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pconfigintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/popcntintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pkuintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/prfchiintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/raointintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/rdseedintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/rtmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/serializeintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/sgxintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tbmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tsxldtrkintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/uintrintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/waitpkgintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/wbnoinvdintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsaveintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsavecintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsaveoptintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsavesintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xtestintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/hresetintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/immintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xmmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mm_malloc.h \
+ C:/mingw64/include/c++/13.2.0/stdlib.h \
+ C:/mingw64/include/c++/13.2.0/cstdlib \
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/c++config.h \
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/os_defines.h \
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/cpu_defines.h \
+ C:/mingw64/include/c++/13.2.0/pstl/pstl_config.h \
+ C:/mingw64/x86_64-w64-mingw32/include/stdlib.h \
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt_wstdlib.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/limits.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/syslimits.h \
+ C:/mingw64/x86_64-w64-mingw32/include/limits.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/stdlib_s.h \
+ C:/mingw64/x86_64-w64-mingw32/include/malloc.h \
+ C:/mingw64/include/c++/13.2.0/bits/std_abs.h \
+ C:/mingw64/x86_64-w64-mingw32/include/errno.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/emmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pmmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tmmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/smmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/wmmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxvnniintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxifmaintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxvnniint8intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx2intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512erintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512pfintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512cdintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bwintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512dqintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vlbwintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vldqintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512ifmaintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512ifmavlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmiintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmivlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx5124fmapsintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx5124vnniwintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vpopcntdqintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmi2intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmi2vlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vnniintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vnnivlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vpopcntdqvlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bitalgintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vp2intersectintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vp2intersectvlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fp16intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fp16vlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/shaintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fmaintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/f16cintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/gfniintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/vaesintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/vpclmulqdqintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bf16vlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bf16intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxneconvertintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxtileintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxint8intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxbf16intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxcomplexintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/prfchwintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/keylockerintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxfp16intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mm3dnow.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fma4intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/ammintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xopintrin.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack4.h \
+ C:/mingw64/x86_64-w64-mingw32/include/poppack.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack4.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack2.h \
+ C:/mingw64/x86_64-w64-mingw32/include/poppack.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack2.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack8.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack8.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ktmtypes.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winbase.h \
+ C:/mingw64/x86_64-w64-mingw32/include/apisetcconv.h \
+ C:/mingw64/x86_64-w64-mingw32/include/minwinbase.h \
+ C:/mingw64/x86_64-w64-mingw32/include/bemapiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/debugapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/errhandlingapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/fibersapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/fileapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/handleapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/heapapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ioapiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/interlockedapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/jobapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/libloaderapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/memoryapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/namedpipeapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/namespaceapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/processenv.h \
+ C:/mingw64/x86_64-w64-mingw32/include/processthreadsapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/processtopologyapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/profileapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/realtimeapiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/securityappcontainer.h \
+ C:/mingw64/x86_64-w64-mingw32/include/securitybaseapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/synchapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sysinfoapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/systemtopologyapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/threadpoolapiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/threadpoollegacyapiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/utilapiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/wow64apiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winerror.h \
+ C:/mingw64/x86_64-w64-mingw32/include/fltwinerror.h \
+ C:/mingw64/x86_64-w64-mingw32/include/timezoneapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/wingdi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack1.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winuser.h \
+ C:/mingw64/x86_64-w64-mingw32/include/tvout.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winnls.h \
+ C:/mingw64/x86_64-w64-mingw32/include/datetimeapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/stringapiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/wincon.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winver.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winreg.h \
+ C:/mingw64/x86_64-w64-mingw32/include/reason.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winnetwk.h \
+ C:/mingw64/x86_64-w64-mingw32/include/wnnc.h \
+ C:/mingw64/x86_64-w64-mingw32/include/virtdisk.h \
+ C:/mingw64/x86_64-w64-mingw32/include/cderr.h \
+ C:/mingw64/x86_64-w64-mingw32/include/dde.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ddeml.h \
+ C:/mingw64/x86_64-w64-mingw32/include/dlgs.h \
+ C:/mingw64/x86_64-w64-mingw32/include/lzexpand.h \
+ C:/mingw64/x86_64-w64-mingw32/include/mmsystem.h \
+ C:/mingw64/x86_64-w64-mingw32/include/mmsyscom.h \
+ C:/mingw64/x86_64-w64-mingw32/include/mciapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/mmiscapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/mmiscapi2.h \
+ C:/mingw64/x86_64-w64-mingw32/include/playsoundapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/mmeapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/timeapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/joystickapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/nb30.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpc.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpcdce.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpcdcep.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpcnsi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpcnterr.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpcasync.h \
+ C:/mingw64/x86_64-w64-mingw32/include/shellapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winperf.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winsock.h \
+ C:/mingw64/x86_64-w64-mingw32/include/wincrypt.h \
+ C:/mingw64/x86_64-w64-mingw32/include/bcrypt.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ncrypt.h \
+ C:/mingw64/x86_64-w64-mingw32/include/dpapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winefs.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winscard.h \
+ C:/mingw64/x86_64-w64-mingw32/include/wtypes.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpcndr.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpcnsip.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpcsal.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ole2.h \
+ C:/mingw64/x86_64-w64-mingw32/include/objbase.h \
+ C:/mingw64/x86_64-w64-mingw32/include/combaseapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/wtypesbase.h \
+ C:/mingw64/x86_64-w64-mingw32/include/unknwnbase.h \
+ C:/mingw64/x86_64-w64-mingw32/include/objidlbase.h \
+ C:/mingw64/x86_64-w64-mingw32/include/cguid.h \
+ C:/mingw64/x86_64-w64-mingw32/include/objidl.h \
+ C:/mingw64/x86_64-w64-mingw32/include/unknwn.h \
+ C:/mingw64/x86_64-w64-mingw32/include/urlmon.h \
+ C:/mingw64/x86_64-w64-mingw32/include/oleidl.h \
+ C:/mingw64/x86_64-w64-mingw32/include/servprov.h \
+ C:/mingw64/x86_64-w64-mingw32/include/msxml.h \
+ C:/mingw64/x86_64-w64-mingw32/include/oaidl.h \
+ C:/mingw64/x86_64-w64-mingw32/include/propidl.h \
+ C:/mingw64/x86_64-w64-mingw32/include/oleauto.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winioctl.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winsmcrd.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winspool.h \
+ C:/mingw64/x86_64-w64-mingw32/include/prsht.h \
+ C:/mingw64/x86_64-w64-mingw32/include/commdlg.h \
+ C:/mingw64/x86_64-w64-mingw32/include/stralign.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/stralign_s.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winsvc.h \
+ C:/mingw64/x86_64-w64-mingw32/include/mcx.h \
+ C:/mingw64/x86_64-w64-mingw32/include/imm.h \
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ws1_undef.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_timeval.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_bsd_types.h \
+ C:/mingw64/x86_64-w64-mingw32/include/inaddr.h \
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_socket_types.h \
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_fd_types.h \
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ip_types.h \
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_wsadata.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ws2def.h \
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_wsa_errnos.h \
+ C:/mingw64/x86_64-w64-mingw32/include/qos.h \
+ C:/mingw64/x86_64-w64-mingw32/include/afunix.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ws2tcpip.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ws2ipdef.h \
+ C:/mingw64/x86_64-w64-mingw32/include/in6addr.h \
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ip_mreq1.h \
+ C:/mingw64/x86_64-w64-mingw32/include/mstcpip.h \
+ C:/mingw64/x86_64-w64-mingw32/include/time.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sys/timeb.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/sys/timeb_s.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pthread_time.h \
+ C:/mingw64/x86_64-w64-mingw32/include/unistd.h \
+ C:/mingw64/x86_64-w64-mingw32/include/io.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_off_t.h \
+ C:/mingw64/x86_64-w64-mingw32/include/process.h \
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt_startup.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sys/types.h \
+ C:/mingw64/x86_64-w64-mingw32/include/getopt.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pthread_unistd.h \
+ C:/mingw64/x86_64-w64-mingw32/include/stdio.h \
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt_stdio_config.h \
+ C:/mingw64/x86_64-w64-mingw32/include/swprintf.inl \
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/stdio_s.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_keys_calc.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_client_recv.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_client_send.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_cert_chain.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_x509.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_logger.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_certs.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_logger.h
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/lib/tls_client_send.cpp.obj b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/lib/tls_client_send.cpp.obj
new file mode 100644
index 0000000..f46a181
Binary files /dev/null and b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/lib/tls_client_send.cpp.obj differ
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/lib/tls_client_send.cpp.obj.d b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/lib/tls_client_send.cpp.obj.d
new file mode 100644
index 0000000..6926b73
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/lib/tls_client_send.cpp.obj.d
@@ -0,0 +1,311 @@
+CMakeFiles/tiitls.dir/lib/tls_client_send.cpp.obj: \
+ D:\DOKUMENTY\diplomovka-final\Scott-cpp-win\lib\tls_client_send.cpp \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_client_send.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_sal.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls1_3.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stdint.h \
+ C:/mingw64/x86_64-w64-mingw32/include/stdint.h \
+ C:/mingw64/x86_64-w64-mingw32/include/crtdefs.h \
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_mac.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_secapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/vadefs.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sdks/_mingw_ddk.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stddef.h \
+ C:/mingw64/x86_64-w64-mingw32/include/stddef.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_octads.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_sockets.h \
+ C:/mingw64/x86_64-w64-mingw32/include/string.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/string_s.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winsock2.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_unicode.h \
+ C:/mingw64/x86_64-w64-mingw32/include/windows.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sdkddkver.h \
+ C:/mingw64/x86_64-w64-mingw32/include/excpt.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stdarg.h \
+ C:/mingw64/x86_64-w64-mingw32/include/stdarg.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_stdarg.h \
+ C:/mingw64/x86_64-w64-mingw32/include/windef.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winapifamily.h \
+ C:/mingw64/x86_64-w64-mingw32/include/minwindef.h \
+ C:/mingw64/x86_64-w64-mingw32/include/specstrings.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sal.h \
+ C:/mingw64/x86_64-w64-mingw32/include/concurrencysal.h \
+ C:/mingw64/x86_64-w64-mingw32/include/driverspecs.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winnt.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ctype.h \
+ C:/mingw64/x86_64-w64-mingw32/include/apiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/intrin-impl.h \
+ C:/mingw64/x86_64-w64-mingw32/include/basetsd.h \
+ C:/mingw64/x86_64-w64-mingw32/include/guiddef.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/x86intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/x86gprintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/ia32intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/adxintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/bmiintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/bmi2intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cetintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cldemoteintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clflushoptintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clwbintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clzerointrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cmpccxaddintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/enqcmdintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fxsrintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/lzcntintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/lwpintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/movdirintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mwaitintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mwaitxintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pconfigintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/popcntintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pkuintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/prfchiintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/raointintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/rdseedintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/rtmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/serializeintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/sgxintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tbmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tsxldtrkintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/uintrintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/waitpkgintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/wbnoinvdintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsaveintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsavecintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsaveoptintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsavesintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xtestintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/hresetintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/immintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xmmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mm_malloc.h \
+ C:/mingw64/include/c++/13.2.0/stdlib.h \
+ C:/mingw64/include/c++/13.2.0/cstdlib \
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/c++config.h \
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/os_defines.h \
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/cpu_defines.h \
+ C:/mingw64/include/c++/13.2.0/pstl/pstl_config.h \
+ C:/mingw64/x86_64-w64-mingw32/include/stdlib.h \
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt_wstdlib.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/limits.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/syslimits.h \
+ C:/mingw64/x86_64-w64-mingw32/include/limits.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/stdlib_s.h \
+ C:/mingw64/x86_64-w64-mingw32/include/malloc.h \
+ C:/mingw64/include/c++/13.2.0/bits/std_abs.h \
+ C:/mingw64/x86_64-w64-mingw32/include/errno.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/emmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pmmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tmmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/smmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/wmmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxvnniintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxifmaintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxvnniint8intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx2intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512erintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512pfintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512cdintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bwintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512dqintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vlbwintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vldqintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512ifmaintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512ifmavlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmiintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmivlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx5124fmapsintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx5124vnniwintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vpopcntdqintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmi2intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmi2vlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vnniintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vnnivlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vpopcntdqvlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bitalgintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vp2intersectintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vp2intersectvlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fp16intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fp16vlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/shaintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fmaintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/f16cintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/gfniintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/vaesintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/vpclmulqdqintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bf16vlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bf16intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxneconvertintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxtileintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxint8intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxbf16intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxcomplexintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/prfchwintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/keylockerintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxfp16intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mm3dnow.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fma4intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/ammintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xopintrin.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack4.h \
+ C:/mingw64/x86_64-w64-mingw32/include/poppack.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack4.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack2.h \
+ C:/mingw64/x86_64-w64-mingw32/include/poppack.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack2.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack8.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack8.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ktmtypes.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winbase.h \
+ C:/mingw64/x86_64-w64-mingw32/include/apisetcconv.h \
+ C:/mingw64/x86_64-w64-mingw32/include/minwinbase.h \
+ C:/mingw64/x86_64-w64-mingw32/include/bemapiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/debugapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/errhandlingapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/fibersapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/fileapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/handleapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/heapapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ioapiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/interlockedapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/jobapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/libloaderapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/memoryapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/namedpipeapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/namespaceapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/processenv.h \
+ C:/mingw64/x86_64-w64-mingw32/include/processthreadsapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/processtopologyapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/profileapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/realtimeapiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/securityappcontainer.h \
+ C:/mingw64/x86_64-w64-mingw32/include/securitybaseapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/synchapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sysinfoapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/systemtopologyapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/threadpoolapiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/threadpoollegacyapiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/utilapiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/wow64apiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winerror.h \
+ C:/mingw64/x86_64-w64-mingw32/include/fltwinerror.h \
+ C:/mingw64/x86_64-w64-mingw32/include/timezoneapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/wingdi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack1.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winuser.h \
+ C:/mingw64/x86_64-w64-mingw32/include/tvout.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winnls.h \
+ C:/mingw64/x86_64-w64-mingw32/include/datetimeapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/stringapiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/wincon.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winver.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winreg.h \
+ C:/mingw64/x86_64-w64-mingw32/include/reason.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winnetwk.h \
+ C:/mingw64/x86_64-w64-mingw32/include/wnnc.h \
+ C:/mingw64/x86_64-w64-mingw32/include/virtdisk.h \
+ C:/mingw64/x86_64-w64-mingw32/include/cderr.h \
+ C:/mingw64/x86_64-w64-mingw32/include/dde.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ddeml.h \
+ C:/mingw64/x86_64-w64-mingw32/include/dlgs.h \
+ C:/mingw64/x86_64-w64-mingw32/include/lzexpand.h \
+ C:/mingw64/x86_64-w64-mingw32/include/mmsystem.h \
+ C:/mingw64/x86_64-w64-mingw32/include/mmsyscom.h \
+ C:/mingw64/x86_64-w64-mingw32/include/mciapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/mmiscapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/mmiscapi2.h \
+ C:/mingw64/x86_64-w64-mingw32/include/playsoundapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/mmeapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/timeapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/joystickapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/nb30.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpc.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpcdce.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpcdcep.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpcnsi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpcnterr.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpcasync.h \
+ C:/mingw64/x86_64-w64-mingw32/include/shellapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winperf.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winsock.h \
+ C:/mingw64/x86_64-w64-mingw32/include/wincrypt.h \
+ C:/mingw64/x86_64-w64-mingw32/include/bcrypt.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ncrypt.h \
+ C:/mingw64/x86_64-w64-mingw32/include/dpapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winefs.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winscard.h \
+ C:/mingw64/x86_64-w64-mingw32/include/wtypes.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpcndr.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpcnsip.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpcsal.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ole2.h \
+ C:/mingw64/x86_64-w64-mingw32/include/objbase.h \
+ C:/mingw64/x86_64-w64-mingw32/include/combaseapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/wtypesbase.h \
+ C:/mingw64/x86_64-w64-mingw32/include/unknwnbase.h \
+ C:/mingw64/x86_64-w64-mingw32/include/objidlbase.h \
+ C:/mingw64/x86_64-w64-mingw32/include/cguid.h \
+ C:/mingw64/x86_64-w64-mingw32/include/objidl.h \
+ C:/mingw64/x86_64-w64-mingw32/include/unknwn.h \
+ C:/mingw64/x86_64-w64-mingw32/include/urlmon.h \
+ C:/mingw64/x86_64-w64-mingw32/include/oleidl.h \
+ C:/mingw64/x86_64-w64-mingw32/include/servprov.h \
+ C:/mingw64/x86_64-w64-mingw32/include/msxml.h \
+ C:/mingw64/x86_64-w64-mingw32/include/oaidl.h \
+ C:/mingw64/x86_64-w64-mingw32/include/propidl.h \
+ C:/mingw64/x86_64-w64-mingw32/include/oleauto.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winioctl.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winsmcrd.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winspool.h \
+ C:/mingw64/x86_64-w64-mingw32/include/prsht.h \
+ C:/mingw64/x86_64-w64-mingw32/include/commdlg.h \
+ C:/mingw64/x86_64-w64-mingw32/include/stralign.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/stralign_s.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winsvc.h \
+ C:/mingw64/x86_64-w64-mingw32/include/mcx.h \
+ C:/mingw64/x86_64-w64-mingw32/include/imm.h \
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ws1_undef.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_timeval.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_bsd_types.h \
+ C:/mingw64/x86_64-w64-mingw32/include/inaddr.h \
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_socket_types.h \
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_fd_types.h \
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ip_types.h \
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_wsadata.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ws2def.h \
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_wsa_errnos.h \
+ C:/mingw64/x86_64-w64-mingw32/include/qos.h \
+ C:/mingw64/x86_64-w64-mingw32/include/afunix.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ws2tcpip.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ws2ipdef.h \
+ C:/mingw64/x86_64-w64-mingw32/include/in6addr.h \
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ip_mreq1.h \
+ C:/mingw64/x86_64-w64-mingw32/include/mstcpip.h \
+ C:/mingw64/x86_64-w64-mingw32/include/time.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sys/timeb.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/sys/timeb_s.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pthread_time.h \
+ C:/mingw64/x86_64-w64-mingw32/include/unistd.h \
+ C:/mingw64/x86_64-w64-mingw32/include/io.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_off_t.h \
+ C:/mingw64/x86_64-w64-mingw32/include/process.h \
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt_startup.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sys/types.h \
+ C:/mingw64/x86_64-w64-mingw32/include/getopt.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pthread_unistd.h \
+ C:/mingw64/x86_64-w64-mingw32/include/stdio.h \
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt_stdio_config.h \
+ C:/mingw64/x86_64-w64-mingw32/include/swprintf.inl \
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/stdio_s.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_keys_calc.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_client_recv.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_client_send.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_logger.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_x509.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_certs.h
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/lib/tls_keys_calc.cpp.obj b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/lib/tls_keys_calc.cpp.obj
new file mode 100644
index 0000000..03e3b62
Binary files /dev/null and b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/lib/tls_keys_calc.cpp.obj differ
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/lib/tls_keys_calc.cpp.obj.d b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/lib/tls_keys_calc.cpp.obj.d
new file mode 100644
index 0000000..23d7a74
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/lib/tls_keys_calc.cpp.obj.d
@@ -0,0 +1,311 @@
+CMakeFiles/tiitls.dir/lib/tls_keys_calc.cpp.obj: \
+ D:\DOKUMENTY\diplomovka-final\Scott-cpp-win\lib\tls_keys_calc.cpp \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_keys_calc.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls1_3.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stdint.h \
+ C:/mingw64/x86_64-w64-mingw32/include/stdint.h \
+ C:/mingw64/x86_64-w64-mingw32/include/crtdefs.h \
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_mac.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_secapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/vadefs.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sdks/_mingw_ddk.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stddef.h \
+ C:/mingw64/x86_64-w64-mingw32/include/stddef.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_octads.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_sockets.h \
+ C:/mingw64/x86_64-w64-mingw32/include/string.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/string_s.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winsock2.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_unicode.h \
+ C:/mingw64/x86_64-w64-mingw32/include/windows.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sdkddkver.h \
+ C:/mingw64/x86_64-w64-mingw32/include/excpt.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stdarg.h \
+ C:/mingw64/x86_64-w64-mingw32/include/stdarg.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_stdarg.h \
+ C:/mingw64/x86_64-w64-mingw32/include/windef.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winapifamily.h \
+ C:/mingw64/x86_64-w64-mingw32/include/minwindef.h \
+ C:/mingw64/x86_64-w64-mingw32/include/specstrings.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sal.h \
+ C:/mingw64/x86_64-w64-mingw32/include/concurrencysal.h \
+ C:/mingw64/x86_64-w64-mingw32/include/driverspecs.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winnt.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ctype.h \
+ C:/mingw64/x86_64-w64-mingw32/include/apiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/intrin-impl.h \
+ C:/mingw64/x86_64-w64-mingw32/include/basetsd.h \
+ C:/mingw64/x86_64-w64-mingw32/include/guiddef.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/x86intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/x86gprintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/ia32intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/adxintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/bmiintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/bmi2intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cetintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cldemoteintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clflushoptintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clwbintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clzerointrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cmpccxaddintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/enqcmdintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fxsrintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/lzcntintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/lwpintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/movdirintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mwaitintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mwaitxintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pconfigintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/popcntintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pkuintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/prfchiintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/raointintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/rdseedintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/rtmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/serializeintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/sgxintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tbmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tsxldtrkintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/uintrintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/waitpkgintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/wbnoinvdintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsaveintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsavecintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsaveoptintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsavesintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xtestintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/hresetintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/immintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xmmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mm_malloc.h \
+ C:/mingw64/include/c++/13.2.0/stdlib.h \
+ C:/mingw64/include/c++/13.2.0/cstdlib \
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/c++config.h \
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/os_defines.h \
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/cpu_defines.h \
+ C:/mingw64/include/c++/13.2.0/pstl/pstl_config.h \
+ C:/mingw64/x86_64-w64-mingw32/include/stdlib.h \
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt_wstdlib.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/limits.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/syslimits.h \
+ C:/mingw64/x86_64-w64-mingw32/include/limits.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/stdlib_s.h \
+ C:/mingw64/x86_64-w64-mingw32/include/malloc.h \
+ C:/mingw64/include/c++/13.2.0/bits/std_abs.h \
+ C:/mingw64/x86_64-w64-mingw32/include/errno.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/emmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pmmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tmmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/smmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/wmmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxvnniintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxifmaintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxvnniint8intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx2intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512erintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512pfintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512cdintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bwintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512dqintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vlbwintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vldqintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512ifmaintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512ifmavlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmiintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmivlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx5124fmapsintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx5124vnniwintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vpopcntdqintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmi2intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmi2vlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vnniintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vnnivlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vpopcntdqvlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bitalgintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vp2intersectintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vp2intersectvlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fp16intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fp16vlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/shaintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fmaintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/f16cintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/gfniintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/vaesintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/vpclmulqdqintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bf16vlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bf16intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxneconvertintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxtileintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxint8intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxbf16intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxcomplexintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/prfchwintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/keylockerintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxfp16intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mm3dnow.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fma4intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/ammintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xopintrin.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack4.h \
+ C:/mingw64/x86_64-w64-mingw32/include/poppack.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack4.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack2.h \
+ C:/mingw64/x86_64-w64-mingw32/include/poppack.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack2.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack8.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack8.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ktmtypes.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winbase.h \
+ C:/mingw64/x86_64-w64-mingw32/include/apisetcconv.h \
+ C:/mingw64/x86_64-w64-mingw32/include/minwinbase.h \
+ C:/mingw64/x86_64-w64-mingw32/include/bemapiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/debugapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/errhandlingapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/fibersapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/fileapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/handleapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/heapapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ioapiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/interlockedapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/jobapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/libloaderapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/memoryapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/namedpipeapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/namespaceapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/processenv.h \
+ C:/mingw64/x86_64-w64-mingw32/include/processthreadsapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/processtopologyapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/profileapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/realtimeapiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/securityappcontainer.h \
+ C:/mingw64/x86_64-w64-mingw32/include/securitybaseapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/synchapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sysinfoapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/systemtopologyapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/threadpoolapiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/threadpoollegacyapiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/utilapiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/wow64apiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winerror.h \
+ C:/mingw64/x86_64-w64-mingw32/include/fltwinerror.h \
+ C:/mingw64/x86_64-w64-mingw32/include/timezoneapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/wingdi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack1.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winuser.h \
+ C:/mingw64/x86_64-w64-mingw32/include/tvout.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winnls.h \
+ C:/mingw64/x86_64-w64-mingw32/include/datetimeapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/stringapiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/wincon.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winver.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winreg.h \
+ C:/mingw64/x86_64-w64-mingw32/include/reason.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winnetwk.h \
+ C:/mingw64/x86_64-w64-mingw32/include/wnnc.h \
+ C:/mingw64/x86_64-w64-mingw32/include/virtdisk.h \
+ C:/mingw64/x86_64-w64-mingw32/include/cderr.h \
+ C:/mingw64/x86_64-w64-mingw32/include/dde.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ddeml.h \
+ C:/mingw64/x86_64-w64-mingw32/include/dlgs.h \
+ C:/mingw64/x86_64-w64-mingw32/include/lzexpand.h \
+ C:/mingw64/x86_64-w64-mingw32/include/mmsystem.h \
+ C:/mingw64/x86_64-w64-mingw32/include/mmsyscom.h \
+ C:/mingw64/x86_64-w64-mingw32/include/mciapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/mmiscapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/mmiscapi2.h \
+ C:/mingw64/x86_64-w64-mingw32/include/playsoundapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/mmeapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/timeapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/joystickapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/nb30.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpc.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpcdce.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpcdcep.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpcnsi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpcnterr.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpcasync.h \
+ C:/mingw64/x86_64-w64-mingw32/include/shellapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winperf.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winsock.h \
+ C:/mingw64/x86_64-w64-mingw32/include/wincrypt.h \
+ C:/mingw64/x86_64-w64-mingw32/include/bcrypt.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ncrypt.h \
+ C:/mingw64/x86_64-w64-mingw32/include/dpapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winefs.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winscard.h \
+ C:/mingw64/x86_64-w64-mingw32/include/wtypes.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpcndr.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpcnsip.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpcsal.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ole2.h \
+ C:/mingw64/x86_64-w64-mingw32/include/objbase.h \
+ C:/mingw64/x86_64-w64-mingw32/include/combaseapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/wtypesbase.h \
+ C:/mingw64/x86_64-w64-mingw32/include/unknwnbase.h \
+ C:/mingw64/x86_64-w64-mingw32/include/objidlbase.h \
+ C:/mingw64/x86_64-w64-mingw32/include/cguid.h \
+ C:/mingw64/x86_64-w64-mingw32/include/objidl.h \
+ C:/mingw64/x86_64-w64-mingw32/include/unknwn.h \
+ C:/mingw64/x86_64-w64-mingw32/include/urlmon.h \
+ C:/mingw64/x86_64-w64-mingw32/include/oleidl.h \
+ C:/mingw64/x86_64-w64-mingw32/include/servprov.h \
+ C:/mingw64/x86_64-w64-mingw32/include/msxml.h \
+ C:/mingw64/x86_64-w64-mingw32/include/oaidl.h \
+ C:/mingw64/x86_64-w64-mingw32/include/propidl.h \
+ C:/mingw64/x86_64-w64-mingw32/include/oleauto.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winioctl.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winsmcrd.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winspool.h \
+ C:/mingw64/x86_64-w64-mingw32/include/prsht.h \
+ C:/mingw64/x86_64-w64-mingw32/include/commdlg.h \
+ C:/mingw64/x86_64-w64-mingw32/include/stralign.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/stralign_s.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winsvc.h \
+ C:/mingw64/x86_64-w64-mingw32/include/mcx.h \
+ C:/mingw64/x86_64-w64-mingw32/include/imm.h \
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ws1_undef.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_timeval.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_bsd_types.h \
+ C:/mingw64/x86_64-w64-mingw32/include/inaddr.h \
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_socket_types.h \
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_fd_types.h \
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ip_types.h \
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_wsadata.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ws2def.h \
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_wsa_errnos.h \
+ C:/mingw64/x86_64-w64-mingw32/include/qos.h \
+ C:/mingw64/x86_64-w64-mingw32/include/afunix.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ws2tcpip.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ws2ipdef.h \
+ C:/mingw64/x86_64-w64-mingw32/include/in6addr.h \
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ip_mreq1.h \
+ C:/mingw64/x86_64-w64-mingw32/include/mstcpip.h \
+ C:/mingw64/x86_64-w64-mingw32/include/time.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sys/timeb.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/sys/timeb_s.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pthread_time.h \
+ C:/mingw64/x86_64-w64-mingw32/include/unistd.h \
+ C:/mingw64/x86_64-w64-mingw32/include/io.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_off_t.h \
+ C:/mingw64/x86_64-w64-mingw32/include/process.h \
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt_startup.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sys/types.h \
+ C:/mingw64/x86_64-w64-mingw32/include/getopt.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pthread_unistd.h \
+ C:/mingw64/x86_64-w64-mingw32/include/stdio.h \
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt_stdio_config.h \
+ C:/mingw64/x86_64-w64-mingw32/include/swprintf.inl \
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/stdio_s.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_sal.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_client_recv.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_keys_calc.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_client_send.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_logger.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_x509.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_x509.h
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/lib/tls_logger.cpp.obj b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/lib/tls_logger.cpp.obj
new file mode 100644
index 0000000..c418b82
Binary files /dev/null and b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/lib/tls_logger.cpp.obj differ
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/lib/tls_logger.cpp.obj.d b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/lib/tls_logger.cpp.obj.d
new file mode 100644
index 0000000..aad188c
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/lib/tls_logger.cpp.obj.d
@@ -0,0 +1,305 @@
+CMakeFiles/tiitls.dir/lib/tls_logger.cpp.obj: \
+ D:\DOKUMENTY\diplomovka-final\Scott-cpp-win\lib\tls_logger.cpp \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_logger.h \
+ C:/mingw64/x86_64-w64-mingw32/include/string.h \
+ C:/mingw64/x86_64-w64-mingw32/include/crtdefs.h \
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_mac.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_secapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/vadefs.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sdks/_mingw_ddk.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/string_s.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls1_3.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stdint.h \
+ C:/mingw64/x86_64-w64-mingw32/include/stdint.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stddef.h \
+ C:/mingw64/x86_64-w64-mingw32/include/stddef.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_octads.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_sockets.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winsock2.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_unicode.h \
+ C:/mingw64/x86_64-w64-mingw32/include/windows.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sdkddkver.h \
+ C:/mingw64/x86_64-w64-mingw32/include/excpt.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stdarg.h \
+ C:/mingw64/x86_64-w64-mingw32/include/stdarg.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_stdarg.h \
+ C:/mingw64/x86_64-w64-mingw32/include/windef.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winapifamily.h \
+ C:/mingw64/x86_64-w64-mingw32/include/minwindef.h \
+ C:/mingw64/x86_64-w64-mingw32/include/specstrings.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sal.h \
+ C:/mingw64/x86_64-w64-mingw32/include/concurrencysal.h \
+ C:/mingw64/x86_64-w64-mingw32/include/driverspecs.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winnt.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ctype.h \
+ C:/mingw64/x86_64-w64-mingw32/include/apiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/intrin-impl.h \
+ C:/mingw64/x86_64-w64-mingw32/include/basetsd.h \
+ C:/mingw64/x86_64-w64-mingw32/include/guiddef.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/x86intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/x86gprintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/ia32intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/adxintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/bmiintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/bmi2intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cetintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cldemoteintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clflushoptintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clwbintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clzerointrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cmpccxaddintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/enqcmdintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fxsrintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/lzcntintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/lwpintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/movdirintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mwaitintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mwaitxintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pconfigintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/popcntintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pkuintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/prfchiintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/raointintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/rdseedintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/rtmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/serializeintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/sgxintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tbmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tsxldtrkintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/uintrintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/waitpkgintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/wbnoinvdintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsaveintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsavecintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsaveoptintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsavesintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xtestintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/hresetintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/immintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xmmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mm_malloc.h \
+ C:/mingw64/include/c++/13.2.0/stdlib.h \
+ C:/mingw64/include/c++/13.2.0/cstdlib \
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/c++config.h \
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/os_defines.h \
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/cpu_defines.h \
+ C:/mingw64/include/c++/13.2.0/pstl/pstl_config.h \
+ C:/mingw64/x86_64-w64-mingw32/include/stdlib.h \
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt_wstdlib.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/limits.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/syslimits.h \
+ C:/mingw64/x86_64-w64-mingw32/include/limits.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/stdlib_s.h \
+ C:/mingw64/x86_64-w64-mingw32/include/malloc.h \
+ C:/mingw64/include/c++/13.2.0/bits/std_abs.h \
+ C:/mingw64/x86_64-w64-mingw32/include/errno.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/emmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pmmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tmmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/smmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/wmmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxvnniintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxifmaintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxvnniint8intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx2intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512erintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512pfintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512cdintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bwintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512dqintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vlbwintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vldqintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512ifmaintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512ifmavlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmiintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmivlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx5124fmapsintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx5124vnniwintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vpopcntdqintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmi2intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmi2vlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vnniintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vnnivlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vpopcntdqvlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bitalgintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vp2intersectintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vp2intersectvlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fp16intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fp16vlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/shaintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fmaintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/f16cintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/gfniintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/vaesintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/vpclmulqdqintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bf16vlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bf16intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxneconvertintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxtileintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxint8intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxbf16intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxcomplexintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/prfchwintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/keylockerintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxfp16intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mm3dnow.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fma4intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/ammintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xopintrin.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack4.h \
+ C:/mingw64/x86_64-w64-mingw32/include/poppack.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack4.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack2.h \
+ C:/mingw64/x86_64-w64-mingw32/include/poppack.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack2.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack8.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack8.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ktmtypes.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winbase.h \
+ C:/mingw64/x86_64-w64-mingw32/include/apisetcconv.h \
+ C:/mingw64/x86_64-w64-mingw32/include/minwinbase.h \
+ C:/mingw64/x86_64-w64-mingw32/include/bemapiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/debugapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/errhandlingapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/fibersapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/fileapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/handleapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/heapapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ioapiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/interlockedapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/jobapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/libloaderapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/memoryapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/namedpipeapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/namespaceapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/processenv.h \
+ C:/mingw64/x86_64-w64-mingw32/include/processthreadsapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/processtopologyapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/profileapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/realtimeapiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/securityappcontainer.h \
+ C:/mingw64/x86_64-w64-mingw32/include/securitybaseapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/synchapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sysinfoapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/systemtopologyapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/threadpoolapiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/threadpoollegacyapiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/utilapiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/wow64apiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winerror.h \
+ C:/mingw64/x86_64-w64-mingw32/include/fltwinerror.h \
+ C:/mingw64/x86_64-w64-mingw32/include/timezoneapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/wingdi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack1.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winuser.h \
+ C:/mingw64/x86_64-w64-mingw32/include/tvout.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winnls.h \
+ C:/mingw64/x86_64-w64-mingw32/include/datetimeapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/stringapiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/wincon.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winver.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winreg.h \
+ C:/mingw64/x86_64-w64-mingw32/include/reason.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winnetwk.h \
+ C:/mingw64/x86_64-w64-mingw32/include/wnnc.h \
+ C:/mingw64/x86_64-w64-mingw32/include/virtdisk.h \
+ C:/mingw64/x86_64-w64-mingw32/include/cderr.h \
+ C:/mingw64/x86_64-w64-mingw32/include/dde.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ddeml.h \
+ C:/mingw64/x86_64-w64-mingw32/include/dlgs.h \
+ C:/mingw64/x86_64-w64-mingw32/include/lzexpand.h \
+ C:/mingw64/x86_64-w64-mingw32/include/mmsystem.h \
+ C:/mingw64/x86_64-w64-mingw32/include/mmsyscom.h \
+ C:/mingw64/x86_64-w64-mingw32/include/mciapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/mmiscapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/mmiscapi2.h \
+ C:/mingw64/x86_64-w64-mingw32/include/playsoundapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/mmeapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/timeapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/joystickapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/nb30.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpc.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpcdce.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpcdcep.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpcnsi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpcnterr.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpcasync.h \
+ C:/mingw64/x86_64-w64-mingw32/include/shellapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winperf.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winsock.h \
+ C:/mingw64/x86_64-w64-mingw32/include/wincrypt.h \
+ C:/mingw64/x86_64-w64-mingw32/include/bcrypt.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ncrypt.h \
+ C:/mingw64/x86_64-w64-mingw32/include/dpapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winefs.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winscard.h \
+ C:/mingw64/x86_64-w64-mingw32/include/wtypes.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpcndr.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpcnsip.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpcsal.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ole2.h \
+ C:/mingw64/x86_64-w64-mingw32/include/objbase.h \
+ C:/mingw64/x86_64-w64-mingw32/include/combaseapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/wtypesbase.h \
+ C:/mingw64/x86_64-w64-mingw32/include/unknwnbase.h \
+ C:/mingw64/x86_64-w64-mingw32/include/objidlbase.h \
+ C:/mingw64/x86_64-w64-mingw32/include/cguid.h \
+ C:/mingw64/x86_64-w64-mingw32/include/objidl.h \
+ C:/mingw64/x86_64-w64-mingw32/include/unknwn.h \
+ C:/mingw64/x86_64-w64-mingw32/include/urlmon.h \
+ C:/mingw64/x86_64-w64-mingw32/include/oleidl.h \
+ C:/mingw64/x86_64-w64-mingw32/include/servprov.h \
+ C:/mingw64/x86_64-w64-mingw32/include/msxml.h \
+ C:/mingw64/x86_64-w64-mingw32/include/oaidl.h \
+ C:/mingw64/x86_64-w64-mingw32/include/propidl.h \
+ C:/mingw64/x86_64-w64-mingw32/include/oleauto.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winioctl.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winsmcrd.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winspool.h \
+ C:/mingw64/x86_64-w64-mingw32/include/prsht.h \
+ C:/mingw64/x86_64-w64-mingw32/include/commdlg.h \
+ C:/mingw64/x86_64-w64-mingw32/include/stralign.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/stralign_s.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winsvc.h \
+ C:/mingw64/x86_64-w64-mingw32/include/mcx.h \
+ C:/mingw64/x86_64-w64-mingw32/include/imm.h \
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ws1_undef.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_timeval.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_bsd_types.h \
+ C:/mingw64/x86_64-w64-mingw32/include/inaddr.h \
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_socket_types.h \
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_fd_types.h \
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ip_types.h \
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_wsadata.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ws2def.h \
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_wsa_errnos.h \
+ C:/mingw64/x86_64-w64-mingw32/include/qos.h \
+ C:/mingw64/x86_64-w64-mingw32/include/afunix.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ws2tcpip.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ws2ipdef.h \
+ C:/mingw64/x86_64-w64-mingw32/include/in6addr.h \
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ip_mreq1.h \
+ C:/mingw64/x86_64-w64-mingw32/include/mstcpip.h \
+ C:/mingw64/x86_64-w64-mingw32/include/time.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sys/timeb.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/sys/timeb_s.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pthread_time.h \
+ C:/mingw64/x86_64-w64-mingw32/include/unistd.h \
+ C:/mingw64/x86_64-w64-mingw32/include/io.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_off_t.h \
+ C:/mingw64/x86_64-w64-mingw32/include/process.h \
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt_startup.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sys/types.h \
+ C:/mingw64/x86_64-w64-mingw32/include/getopt.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pthread_unistd.h \
+ C:/mingw64/x86_64-w64-mingw32/include/stdio.h \
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt_stdio_config.h \
+ C:/mingw64/x86_64-w64-mingw32/include/swprintf.inl \
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/stdio_s.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_x509.h
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/lib/tls_octads.cpp.obj b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/lib/tls_octads.cpp.obj
new file mode 100644
index 0000000..5fb2dbc
Binary files /dev/null and b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/lib/tls_octads.cpp.obj differ
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/lib/tls_octads.cpp.obj.d b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/lib/tls_octads.cpp.obj.d
new file mode 100644
index 0000000..efe58d2
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/lib/tls_octads.cpp.obj.d
@@ -0,0 +1,18 @@
+CMakeFiles/tiitls.dir/lib/tls_octads.cpp.obj: \
+ D:\DOKUMENTY\diplomovka-final\Scott-cpp-win\lib\tls_octads.cpp \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_octads.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stddef.h \
+ C:/mingw64/x86_64-w64-mingw32/include/stddef.h \
+ C:/mingw64/x86_64-w64-mingw32/include/crtdefs.h \
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_mac.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_secapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/vadefs.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sdks/_mingw_ddk.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sys/time.h \
+ C:/mingw64/x86_64-w64-mingw32/include/time.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sys/timeb.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/sys/timeb_s.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_timeval.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pthread_time.h
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/lib/tls_protocol.cpp.obj b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/lib/tls_protocol.cpp.obj
new file mode 100644
index 0000000..afe44e3
Binary files /dev/null and b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/lib/tls_protocol.cpp.obj differ
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/lib/tls_protocol.cpp.obj.d b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/lib/tls_protocol.cpp.obj.d
new file mode 100644
index 0000000..c142968
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/lib/tls_protocol.cpp.obj.d
@@ -0,0 +1,313 @@
+CMakeFiles/tiitls.dir/lib/tls_protocol.cpp.obj: \
+ D:\DOKUMENTY\diplomovka-final\Scott-cpp-win\lib\tls_protocol.cpp \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_protocol.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_keys_calc.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls1_3.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stdint.h \
+ C:/mingw64/x86_64-w64-mingw32/include/stdint.h \
+ C:/mingw64/x86_64-w64-mingw32/include/crtdefs.h \
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_mac.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_secapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/vadefs.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sdks/_mingw_ddk.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stddef.h \
+ C:/mingw64/x86_64-w64-mingw32/include/stddef.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_octads.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_sockets.h \
+ C:/mingw64/x86_64-w64-mingw32/include/string.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/string_s.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winsock2.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_unicode.h \
+ C:/mingw64/x86_64-w64-mingw32/include/windows.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sdkddkver.h \
+ C:/mingw64/x86_64-w64-mingw32/include/excpt.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stdarg.h \
+ C:/mingw64/x86_64-w64-mingw32/include/stdarg.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_stdarg.h \
+ C:/mingw64/x86_64-w64-mingw32/include/windef.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winapifamily.h \
+ C:/mingw64/x86_64-w64-mingw32/include/minwindef.h \
+ C:/mingw64/x86_64-w64-mingw32/include/specstrings.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sal.h \
+ C:/mingw64/x86_64-w64-mingw32/include/concurrencysal.h \
+ C:/mingw64/x86_64-w64-mingw32/include/driverspecs.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winnt.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ctype.h \
+ C:/mingw64/x86_64-w64-mingw32/include/apiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/intrin-impl.h \
+ C:/mingw64/x86_64-w64-mingw32/include/basetsd.h \
+ C:/mingw64/x86_64-w64-mingw32/include/guiddef.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/x86intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/x86gprintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/ia32intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/adxintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/bmiintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/bmi2intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cetintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cldemoteintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clflushoptintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clwbintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clzerointrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cmpccxaddintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/enqcmdintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fxsrintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/lzcntintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/lwpintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/movdirintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mwaitintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mwaitxintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pconfigintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/popcntintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pkuintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/prfchiintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/raointintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/rdseedintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/rtmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/serializeintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/sgxintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tbmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tsxldtrkintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/uintrintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/waitpkgintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/wbnoinvdintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsaveintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsavecintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsaveoptintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsavesintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xtestintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/hresetintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/immintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xmmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mm_malloc.h \
+ C:/mingw64/include/c++/13.2.0/stdlib.h \
+ C:/mingw64/include/c++/13.2.0/cstdlib \
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/c++config.h \
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/os_defines.h \
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/cpu_defines.h \
+ C:/mingw64/include/c++/13.2.0/pstl/pstl_config.h \
+ C:/mingw64/x86_64-w64-mingw32/include/stdlib.h \
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt_wstdlib.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/limits.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/syslimits.h \
+ C:/mingw64/x86_64-w64-mingw32/include/limits.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/stdlib_s.h \
+ C:/mingw64/x86_64-w64-mingw32/include/malloc.h \
+ C:/mingw64/include/c++/13.2.0/bits/std_abs.h \
+ C:/mingw64/x86_64-w64-mingw32/include/errno.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/emmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pmmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tmmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/smmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/wmmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxvnniintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxifmaintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxvnniint8intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx2intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512erintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512pfintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512cdintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bwintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512dqintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vlbwintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vldqintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512ifmaintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512ifmavlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmiintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmivlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx5124fmapsintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx5124vnniwintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vpopcntdqintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmi2intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmi2vlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vnniintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vnnivlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vpopcntdqvlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bitalgintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vp2intersectintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vp2intersectvlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fp16intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fp16vlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/shaintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fmaintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/f16cintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/gfniintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/vaesintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/vpclmulqdqintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bf16vlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bf16intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxneconvertintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxtileintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxint8intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxbf16intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxcomplexintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/prfchwintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/keylockerintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxfp16intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mm3dnow.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fma4intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/ammintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xopintrin.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack4.h \
+ C:/mingw64/x86_64-w64-mingw32/include/poppack.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack4.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack2.h \
+ C:/mingw64/x86_64-w64-mingw32/include/poppack.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack2.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack8.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack8.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ktmtypes.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winbase.h \
+ C:/mingw64/x86_64-w64-mingw32/include/apisetcconv.h \
+ C:/mingw64/x86_64-w64-mingw32/include/minwinbase.h \
+ C:/mingw64/x86_64-w64-mingw32/include/bemapiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/debugapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/errhandlingapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/fibersapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/fileapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/handleapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/heapapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ioapiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/interlockedapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/jobapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/libloaderapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/memoryapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/namedpipeapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/namespaceapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/processenv.h \
+ C:/mingw64/x86_64-w64-mingw32/include/processthreadsapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/processtopologyapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/profileapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/realtimeapiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/securityappcontainer.h \
+ C:/mingw64/x86_64-w64-mingw32/include/securitybaseapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/synchapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sysinfoapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/systemtopologyapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/threadpoolapiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/threadpoollegacyapiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/utilapiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/wow64apiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winerror.h \
+ C:/mingw64/x86_64-w64-mingw32/include/fltwinerror.h \
+ C:/mingw64/x86_64-w64-mingw32/include/timezoneapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/wingdi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack1.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winuser.h \
+ C:/mingw64/x86_64-w64-mingw32/include/tvout.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winnls.h \
+ C:/mingw64/x86_64-w64-mingw32/include/datetimeapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/stringapiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/wincon.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winver.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winreg.h \
+ C:/mingw64/x86_64-w64-mingw32/include/reason.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winnetwk.h \
+ C:/mingw64/x86_64-w64-mingw32/include/wnnc.h \
+ C:/mingw64/x86_64-w64-mingw32/include/virtdisk.h \
+ C:/mingw64/x86_64-w64-mingw32/include/cderr.h \
+ C:/mingw64/x86_64-w64-mingw32/include/dde.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ddeml.h \
+ C:/mingw64/x86_64-w64-mingw32/include/dlgs.h \
+ C:/mingw64/x86_64-w64-mingw32/include/lzexpand.h \
+ C:/mingw64/x86_64-w64-mingw32/include/mmsystem.h \
+ C:/mingw64/x86_64-w64-mingw32/include/mmsyscom.h \
+ C:/mingw64/x86_64-w64-mingw32/include/mciapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/mmiscapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/mmiscapi2.h \
+ C:/mingw64/x86_64-w64-mingw32/include/playsoundapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/mmeapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/timeapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/joystickapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/nb30.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpc.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpcdce.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpcdcep.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpcnsi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpcnterr.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpcasync.h \
+ C:/mingw64/x86_64-w64-mingw32/include/shellapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winperf.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winsock.h \
+ C:/mingw64/x86_64-w64-mingw32/include/wincrypt.h \
+ C:/mingw64/x86_64-w64-mingw32/include/bcrypt.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ncrypt.h \
+ C:/mingw64/x86_64-w64-mingw32/include/dpapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winefs.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winscard.h \
+ C:/mingw64/x86_64-w64-mingw32/include/wtypes.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpcndr.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpcnsip.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpcsal.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ole2.h \
+ C:/mingw64/x86_64-w64-mingw32/include/objbase.h \
+ C:/mingw64/x86_64-w64-mingw32/include/combaseapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/wtypesbase.h \
+ C:/mingw64/x86_64-w64-mingw32/include/unknwnbase.h \
+ C:/mingw64/x86_64-w64-mingw32/include/objidlbase.h \
+ C:/mingw64/x86_64-w64-mingw32/include/cguid.h \
+ C:/mingw64/x86_64-w64-mingw32/include/objidl.h \
+ C:/mingw64/x86_64-w64-mingw32/include/unknwn.h \
+ C:/mingw64/x86_64-w64-mingw32/include/urlmon.h \
+ C:/mingw64/x86_64-w64-mingw32/include/oleidl.h \
+ C:/mingw64/x86_64-w64-mingw32/include/servprov.h \
+ C:/mingw64/x86_64-w64-mingw32/include/msxml.h \
+ C:/mingw64/x86_64-w64-mingw32/include/oaidl.h \
+ C:/mingw64/x86_64-w64-mingw32/include/propidl.h \
+ C:/mingw64/x86_64-w64-mingw32/include/oleauto.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winioctl.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winsmcrd.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winspool.h \
+ C:/mingw64/x86_64-w64-mingw32/include/prsht.h \
+ C:/mingw64/x86_64-w64-mingw32/include/commdlg.h \
+ C:/mingw64/x86_64-w64-mingw32/include/stralign.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/stralign_s.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winsvc.h \
+ C:/mingw64/x86_64-w64-mingw32/include/mcx.h \
+ C:/mingw64/x86_64-w64-mingw32/include/imm.h \
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ws1_undef.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_timeval.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_bsd_types.h \
+ C:/mingw64/x86_64-w64-mingw32/include/inaddr.h \
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_socket_types.h \
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_fd_types.h \
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ip_types.h \
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_wsadata.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ws2def.h \
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_wsa_errnos.h \
+ C:/mingw64/x86_64-w64-mingw32/include/qos.h \
+ C:/mingw64/x86_64-w64-mingw32/include/afunix.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ws2tcpip.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ws2ipdef.h \
+ C:/mingw64/x86_64-w64-mingw32/include/in6addr.h \
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ip_mreq1.h \
+ C:/mingw64/x86_64-w64-mingw32/include/mstcpip.h \
+ C:/mingw64/x86_64-w64-mingw32/include/time.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sys/timeb.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/sys/timeb_s.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pthread_time.h \
+ C:/mingw64/x86_64-w64-mingw32/include/unistd.h \
+ C:/mingw64/x86_64-w64-mingw32/include/io.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_off_t.h \
+ C:/mingw64/x86_64-w64-mingw32/include/process.h \
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt_startup.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sys/types.h \
+ C:/mingw64/x86_64-w64-mingw32/include/getopt.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pthread_unistd.h \
+ C:/mingw64/x86_64-w64-mingw32/include/stdio.h \
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt_stdio_config.h \
+ C:/mingw64/x86_64-w64-mingw32/include/swprintf.inl \
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/stdio_s.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_sal.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_client_recv.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_client_send.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_cert_chain.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_x509.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_logger.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_certs.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_tickets.h
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/lib/tls_sal.cpp.obj b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/lib/tls_sal.cpp.obj
new file mode 100644
index 0000000..1a32f00
Binary files /dev/null and b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/lib/tls_sal.cpp.obj differ
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/lib/tls_sal.cpp.obj.d b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/lib/tls_sal.cpp.obj.d
new file mode 100644
index 0000000..3328cd4
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/lib/tls_sal.cpp.obj.d
@@ -0,0 +1,357 @@
+CMakeFiles/tiitls.dir/lib/tls_sal.cpp.obj: \
+ D:\DOKUMENTY\diplomovka-final\Scott-cpp-win\lib\tls_sal.cpp \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_sal.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls1_3.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stdint.h \
+ C:/mingw64/x86_64-w64-mingw32/include/stdint.h \
+ C:/mingw64/x86_64-w64-mingw32/include/crtdefs.h \
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_mac.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_secapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/vadefs.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sdks/_mingw_ddk.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stddef.h \
+ C:/mingw64/x86_64-w64-mingw32/include/stddef.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_octads.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_sockets.h \
+ C:/mingw64/x86_64-w64-mingw32/include/string.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/string_s.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winsock2.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_unicode.h \
+ C:/mingw64/x86_64-w64-mingw32/include/windows.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sdkddkver.h \
+ C:/mingw64/x86_64-w64-mingw32/include/excpt.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stdarg.h \
+ C:/mingw64/x86_64-w64-mingw32/include/stdarg.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_stdarg.h \
+ C:/mingw64/x86_64-w64-mingw32/include/windef.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winapifamily.h \
+ C:/mingw64/x86_64-w64-mingw32/include/minwindef.h \
+ C:/mingw64/x86_64-w64-mingw32/include/specstrings.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sal.h \
+ C:/mingw64/x86_64-w64-mingw32/include/concurrencysal.h \
+ C:/mingw64/x86_64-w64-mingw32/include/driverspecs.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winnt.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ctype.h \
+ C:/mingw64/x86_64-w64-mingw32/include/apiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/intrin-impl.h \
+ C:/mingw64/x86_64-w64-mingw32/include/basetsd.h \
+ C:/mingw64/x86_64-w64-mingw32/include/guiddef.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/x86intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/x86gprintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/ia32intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/adxintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/bmiintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/bmi2intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cetintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cldemoteintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clflushoptintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clwbintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clzerointrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cmpccxaddintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/enqcmdintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fxsrintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/lzcntintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/lwpintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/movdirintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mwaitintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mwaitxintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pconfigintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/popcntintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pkuintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/prfchiintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/raointintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/rdseedintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/rtmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/serializeintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/sgxintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tbmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tsxldtrkintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/uintrintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/waitpkgintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/wbnoinvdintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsaveintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsavecintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsaveoptintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsavesintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xtestintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/hresetintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/immintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xmmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mm_malloc.h \
+ C:/mingw64/include/c++/13.2.0/stdlib.h \
+ C:/mingw64/include/c++/13.2.0/cstdlib \
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/c++config.h \
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/os_defines.h \
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/cpu_defines.h \
+ C:/mingw64/include/c++/13.2.0/pstl/pstl_config.h \
+ C:/mingw64/x86_64-w64-mingw32/include/stdlib.h \
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt_wstdlib.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/limits.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/syslimits.h \
+ C:/mingw64/x86_64-w64-mingw32/include/limits.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/stdlib_s.h \
+ C:/mingw64/x86_64-w64-mingw32/include/malloc.h \
+ C:/mingw64/include/c++/13.2.0/bits/std_abs.h \
+ C:/mingw64/x86_64-w64-mingw32/include/errno.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/emmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pmmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tmmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/smmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/wmmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxvnniintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxifmaintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxvnniint8intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx2intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512erintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512pfintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512cdintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bwintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512dqintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vlbwintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vldqintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512ifmaintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512ifmavlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmiintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmivlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx5124fmapsintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx5124vnniwintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vpopcntdqintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmi2intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmi2vlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vnniintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vnnivlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vpopcntdqvlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bitalgintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vp2intersectintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vp2intersectvlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fp16intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fp16vlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/shaintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fmaintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/f16cintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/gfniintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/vaesintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/vpclmulqdqintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bf16vlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bf16intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxneconvertintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxtileintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxint8intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxbf16intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxcomplexintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/prfchwintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/keylockerintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxfp16intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mm3dnow.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fma4intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/ammintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xopintrin.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack4.h \
+ C:/mingw64/x86_64-w64-mingw32/include/poppack.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack4.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack2.h \
+ C:/mingw64/x86_64-w64-mingw32/include/poppack.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack2.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack8.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack8.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ktmtypes.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winbase.h \
+ C:/mingw64/x86_64-w64-mingw32/include/apisetcconv.h \
+ C:/mingw64/x86_64-w64-mingw32/include/minwinbase.h \
+ C:/mingw64/x86_64-w64-mingw32/include/bemapiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/debugapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/errhandlingapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/fibersapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/fileapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/handleapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/heapapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ioapiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/interlockedapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/jobapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/libloaderapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/memoryapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/namedpipeapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/namespaceapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/processenv.h \
+ C:/mingw64/x86_64-w64-mingw32/include/processthreadsapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/processtopologyapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/profileapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/realtimeapiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/securityappcontainer.h \
+ C:/mingw64/x86_64-w64-mingw32/include/securitybaseapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/synchapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sysinfoapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/systemtopologyapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/threadpoolapiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/threadpoollegacyapiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/utilapiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/wow64apiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winerror.h \
+ C:/mingw64/x86_64-w64-mingw32/include/fltwinerror.h \
+ C:/mingw64/x86_64-w64-mingw32/include/timezoneapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/wingdi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack1.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winuser.h \
+ C:/mingw64/x86_64-w64-mingw32/include/tvout.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winnls.h \
+ C:/mingw64/x86_64-w64-mingw32/include/datetimeapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/stringapiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/wincon.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winver.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winreg.h \
+ C:/mingw64/x86_64-w64-mingw32/include/reason.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winnetwk.h \
+ C:/mingw64/x86_64-w64-mingw32/include/wnnc.h \
+ C:/mingw64/x86_64-w64-mingw32/include/virtdisk.h \
+ C:/mingw64/x86_64-w64-mingw32/include/cderr.h \
+ C:/mingw64/x86_64-w64-mingw32/include/dde.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ddeml.h \
+ C:/mingw64/x86_64-w64-mingw32/include/dlgs.h \
+ C:/mingw64/x86_64-w64-mingw32/include/lzexpand.h \
+ C:/mingw64/x86_64-w64-mingw32/include/mmsystem.h \
+ C:/mingw64/x86_64-w64-mingw32/include/mmsyscom.h \
+ C:/mingw64/x86_64-w64-mingw32/include/mciapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/mmiscapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/mmiscapi2.h \
+ C:/mingw64/x86_64-w64-mingw32/include/playsoundapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/mmeapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/timeapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/joystickapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/nb30.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpc.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpcdce.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpcdcep.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpcnsi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpcnterr.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpcasync.h \
+ C:/mingw64/x86_64-w64-mingw32/include/shellapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winperf.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winsock.h \
+ C:/mingw64/x86_64-w64-mingw32/include/wincrypt.h \
+ C:/mingw64/x86_64-w64-mingw32/include/bcrypt.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ncrypt.h \
+ C:/mingw64/x86_64-w64-mingw32/include/dpapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winefs.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winscard.h \
+ C:/mingw64/x86_64-w64-mingw32/include/wtypes.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpcndr.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpcnsip.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpcsal.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ole2.h \
+ C:/mingw64/x86_64-w64-mingw32/include/objbase.h \
+ C:/mingw64/x86_64-w64-mingw32/include/combaseapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/wtypesbase.h \
+ C:/mingw64/x86_64-w64-mingw32/include/unknwnbase.h \
+ C:/mingw64/x86_64-w64-mingw32/include/objidlbase.h \
+ C:/mingw64/x86_64-w64-mingw32/include/cguid.h \
+ C:/mingw64/x86_64-w64-mingw32/include/objidl.h \
+ C:/mingw64/x86_64-w64-mingw32/include/unknwn.h \
+ C:/mingw64/x86_64-w64-mingw32/include/urlmon.h \
+ C:/mingw64/x86_64-w64-mingw32/include/oleidl.h \
+ C:/mingw64/x86_64-w64-mingw32/include/servprov.h \
+ C:/mingw64/x86_64-w64-mingw32/include/msxml.h \
+ C:/mingw64/x86_64-w64-mingw32/include/oaidl.h \
+ C:/mingw64/x86_64-w64-mingw32/include/propidl.h \
+ C:/mingw64/x86_64-w64-mingw32/include/oleauto.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winioctl.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winsmcrd.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winspool.h \
+ C:/mingw64/x86_64-w64-mingw32/include/prsht.h \
+ C:/mingw64/x86_64-w64-mingw32/include/commdlg.h \
+ C:/mingw64/x86_64-w64-mingw32/include/stralign.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/stralign_s.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winsvc.h \
+ C:/mingw64/x86_64-w64-mingw32/include/mcx.h \
+ C:/mingw64/x86_64-w64-mingw32/include/imm.h \
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ws1_undef.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_timeval.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_bsd_types.h \
+ C:/mingw64/x86_64-w64-mingw32/include/inaddr.h \
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_socket_types.h \
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_fd_types.h \
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ip_types.h \
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_wsadata.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ws2def.h \
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_wsa_errnos.h \
+ C:/mingw64/x86_64-w64-mingw32/include/qos.h \
+ C:/mingw64/x86_64-w64-mingw32/include/afunix.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ws2tcpip.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ws2ipdef.h \
+ C:/mingw64/x86_64-w64-mingw32/include/in6addr.h \
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ip_mreq1.h \
+ C:/mingw64/x86_64-w64-mingw32/include/mstcpip.h \
+ C:/mingw64/x86_64-w64-mingw32/include/time.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sys/timeb.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/sys/timeb_s.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pthread_time.h \
+ C:/mingw64/x86_64-w64-mingw32/include/unistd.h \
+ C:/mingw64/x86_64-w64-mingw32/include/io.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_off_t.h \
+ C:/mingw64/x86_64-w64-mingw32/include/process.h \
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt_startup.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sys/types.h \
+ C:/mingw64/x86_64-w64-mingw32/include/getopt.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pthread_unistd.h \
+ C:/mingw64/x86_64-w64-mingw32/include/stdio.h \
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt_stdio_config.h \
+ C:/mingw64/x86_64-w64-mingw32/include/swprintf.inl \
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/stdio_s.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/core.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stdbool.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/arch.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/ecdh_NIST256.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/ecp_NIST256.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/fp_NIST256.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/big_B256_56.h \
+ C:/mingw64/x86_64-w64-mingw32/include/inttypes.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/core.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/config_big_B256_56.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/config_field_NIST256.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/config_curve_NIST256.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/ecdh_NIST384.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/ecp_NIST384.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/fp_NIST384.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/big_B384_56.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/config_big_B384_56.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/config_field_NIST384.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/config_curve_NIST384.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/ecdh_C25519.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/ecp_C25519.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/fp_F25519.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/config_field_F25519.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/config_curve_C25519.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/rsa_RSA2048.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/ff_RSA2048.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/big_B512_60.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/config_big_B512_60.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/config_ff_RSA2048.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/rsa_RSA4096.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/ff_RSA4096.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/config_ff_RSA4096.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/eddsa_Ed25519.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/ecp_Ed25519.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/config_curve_Ed25519.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/eddsa_Ed448.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/ecp_Ed448.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/fp_F448.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/big_B448_58.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/config_big_B448_58.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/config_field_F448.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/sal/miracl/includes/config_curve_Ed448.h \
+ C:/mingw64/include/oqs/oqs.h C:/mingw64/include/oqs/oqsconfig.h \
+ C:/mingw64/include/oqs/common.h C:/mingw64/include/oqs/rand.h \
+ C:/mingw64/include/oqs/kem.h \
+ C:/mingw64/include/oqs/kem_classic_mceliece.h \
+ C:/mingw64/include/oqs/kem_hqc.h C:/mingw64/include/oqs/kem_kyber.h \
+ C:/mingw64/include/oqs/kem_ml_kem.h \
+ C:/mingw64/include/oqs/kem_ntruprime.h \
+ C:/mingw64/include/oqs/kem_frodokem.h C:/mingw64/include/oqs/sig.h \
+ C:/mingw64/include/oqs/sig_dilithium.h \
+ C:/mingw64/include/oqs/sig_ml_dsa.h C:/mingw64/include/oqs/sig_falcon.h \
+ C:/mingw64/include/oqs/sig_sphincs.h
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/lib/tls_sockets.cpp.obj b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/lib/tls_sockets.cpp.obj
new file mode 100644
index 0000000..5663e4b
Binary files /dev/null and b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/lib/tls_sockets.cpp.obj differ
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/lib/tls_sockets.cpp.obj.d b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/lib/tls_sockets.cpp.obj.d
new file mode 100644
index 0000000..a4b8920
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/lib/tls_sockets.cpp.obj.d
@@ -0,0 +1,305 @@
+CMakeFiles/tiitls.dir/lib/tls_sockets.cpp.obj: \
+ D:\DOKUMENTY\diplomovka-final\Scott-cpp-win\lib\tls_sockets.cpp \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_logger.h \
+ C:/mingw64/x86_64-w64-mingw32/include/string.h \
+ C:/mingw64/x86_64-w64-mingw32/include/crtdefs.h \
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_mac.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_secapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/vadefs.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sdks/_mingw_ddk.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/string_s.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls1_3.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stdint.h \
+ C:/mingw64/x86_64-w64-mingw32/include/stdint.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stddef.h \
+ C:/mingw64/x86_64-w64-mingw32/include/stddef.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_octads.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_sockets.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winsock2.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_unicode.h \
+ C:/mingw64/x86_64-w64-mingw32/include/windows.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sdkddkver.h \
+ C:/mingw64/x86_64-w64-mingw32/include/excpt.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stdarg.h \
+ C:/mingw64/x86_64-w64-mingw32/include/stdarg.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_stdarg.h \
+ C:/mingw64/x86_64-w64-mingw32/include/windef.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winapifamily.h \
+ C:/mingw64/x86_64-w64-mingw32/include/minwindef.h \
+ C:/mingw64/x86_64-w64-mingw32/include/specstrings.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sal.h \
+ C:/mingw64/x86_64-w64-mingw32/include/concurrencysal.h \
+ C:/mingw64/x86_64-w64-mingw32/include/driverspecs.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winnt.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ctype.h \
+ C:/mingw64/x86_64-w64-mingw32/include/apiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/intrin-impl.h \
+ C:/mingw64/x86_64-w64-mingw32/include/basetsd.h \
+ C:/mingw64/x86_64-w64-mingw32/include/guiddef.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/x86intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/x86gprintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/ia32intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/adxintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/bmiintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/bmi2intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cetintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cldemoteintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clflushoptintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clwbintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clzerointrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cmpccxaddintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/enqcmdintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fxsrintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/lzcntintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/lwpintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/movdirintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mwaitintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mwaitxintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pconfigintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/popcntintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pkuintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/prfchiintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/raointintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/rdseedintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/rtmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/serializeintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/sgxintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tbmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tsxldtrkintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/uintrintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/waitpkgintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/wbnoinvdintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsaveintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsavecintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsaveoptintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsavesintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xtestintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/hresetintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/immintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xmmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mm_malloc.h \
+ C:/mingw64/include/c++/13.2.0/stdlib.h \
+ C:/mingw64/include/c++/13.2.0/cstdlib \
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/c++config.h \
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/os_defines.h \
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/cpu_defines.h \
+ C:/mingw64/include/c++/13.2.0/pstl/pstl_config.h \
+ C:/mingw64/x86_64-w64-mingw32/include/stdlib.h \
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt_wstdlib.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/limits.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/syslimits.h \
+ C:/mingw64/x86_64-w64-mingw32/include/limits.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/stdlib_s.h \
+ C:/mingw64/x86_64-w64-mingw32/include/malloc.h \
+ C:/mingw64/include/c++/13.2.0/bits/std_abs.h \
+ C:/mingw64/x86_64-w64-mingw32/include/errno.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/emmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pmmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tmmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/smmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/wmmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxvnniintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxifmaintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxvnniint8intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx2intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512erintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512pfintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512cdintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bwintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512dqintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vlbwintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vldqintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512ifmaintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512ifmavlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmiintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmivlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx5124fmapsintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx5124vnniwintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vpopcntdqintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmi2intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmi2vlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vnniintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vnnivlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vpopcntdqvlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bitalgintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vp2intersectintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vp2intersectvlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fp16intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fp16vlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/shaintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fmaintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/f16cintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/gfniintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/vaesintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/vpclmulqdqintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bf16vlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bf16intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxneconvertintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxtileintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxint8intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxbf16intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxcomplexintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/prfchwintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/keylockerintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxfp16intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mm3dnow.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fma4intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/ammintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xopintrin.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack4.h \
+ C:/mingw64/x86_64-w64-mingw32/include/poppack.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack4.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack2.h \
+ C:/mingw64/x86_64-w64-mingw32/include/poppack.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack2.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack8.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack8.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ktmtypes.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winbase.h \
+ C:/mingw64/x86_64-w64-mingw32/include/apisetcconv.h \
+ C:/mingw64/x86_64-w64-mingw32/include/minwinbase.h \
+ C:/mingw64/x86_64-w64-mingw32/include/bemapiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/debugapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/errhandlingapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/fibersapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/fileapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/handleapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/heapapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ioapiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/interlockedapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/jobapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/libloaderapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/memoryapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/namedpipeapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/namespaceapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/processenv.h \
+ C:/mingw64/x86_64-w64-mingw32/include/processthreadsapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/processtopologyapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/profileapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/realtimeapiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/securityappcontainer.h \
+ C:/mingw64/x86_64-w64-mingw32/include/securitybaseapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/synchapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sysinfoapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/systemtopologyapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/threadpoolapiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/threadpoollegacyapiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/utilapiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/wow64apiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winerror.h \
+ C:/mingw64/x86_64-w64-mingw32/include/fltwinerror.h \
+ C:/mingw64/x86_64-w64-mingw32/include/timezoneapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/wingdi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack1.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winuser.h \
+ C:/mingw64/x86_64-w64-mingw32/include/tvout.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winnls.h \
+ C:/mingw64/x86_64-w64-mingw32/include/datetimeapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/stringapiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/wincon.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winver.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winreg.h \
+ C:/mingw64/x86_64-w64-mingw32/include/reason.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winnetwk.h \
+ C:/mingw64/x86_64-w64-mingw32/include/wnnc.h \
+ C:/mingw64/x86_64-w64-mingw32/include/virtdisk.h \
+ C:/mingw64/x86_64-w64-mingw32/include/cderr.h \
+ C:/mingw64/x86_64-w64-mingw32/include/dde.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ddeml.h \
+ C:/mingw64/x86_64-w64-mingw32/include/dlgs.h \
+ C:/mingw64/x86_64-w64-mingw32/include/lzexpand.h \
+ C:/mingw64/x86_64-w64-mingw32/include/mmsystem.h \
+ C:/mingw64/x86_64-w64-mingw32/include/mmsyscom.h \
+ C:/mingw64/x86_64-w64-mingw32/include/mciapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/mmiscapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/mmiscapi2.h \
+ C:/mingw64/x86_64-w64-mingw32/include/playsoundapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/mmeapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/timeapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/joystickapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/nb30.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpc.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpcdce.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpcdcep.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpcnsi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpcnterr.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpcasync.h \
+ C:/mingw64/x86_64-w64-mingw32/include/shellapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winperf.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winsock.h \
+ C:/mingw64/x86_64-w64-mingw32/include/wincrypt.h \
+ C:/mingw64/x86_64-w64-mingw32/include/bcrypt.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ncrypt.h \
+ C:/mingw64/x86_64-w64-mingw32/include/dpapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winefs.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winscard.h \
+ C:/mingw64/x86_64-w64-mingw32/include/wtypes.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpcndr.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpcnsip.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpcsal.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ole2.h \
+ C:/mingw64/x86_64-w64-mingw32/include/objbase.h \
+ C:/mingw64/x86_64-w64-mingw32/include/combaseapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/wtypesbase.h \
+ C:/mingw64/x86_64-w64-mingw32/include/unknwnbase.h \
+ C:/mingw64/x86_64-w64-mingw32/include/objidlbase.h \
+ C:/mingw64/x86_64-w64-mingw32/include/cguid.h \
+ C:/mingw64/x86_64-w64-mingw32/include/objidl.h \
+ C:/mingw64/x86_64-w64-mingw32/include/unknwn.h \
+ C:/mingw64/x86_64-w64-mingw32/include/urlmon.h \
+ C:/mingw64/x86_64-w64-mingw32/include/oleidl.h \
+ C:/mingw64/x86_64-w64-mingw32/include/servprov.h \
+ C:/mingw64/x86_64-w64-mingw32/include/msxml.h \
+ C:/mingw64/x86_64-w64-mingw32/include/oaidl.h \
+ C:/mingw64/x86_64-w64-mingw32/include/propidl.h \
+ C:/mingw64/x86_64-w64-mingw32/include/oleauto.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winioctl.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winsmcrd.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winspool.h \
+ C:/mingw64/x86_64-w64-mingw32/include/prsht.h \
+ C:/mingw64/x86_64-w64-mingw32/include/commdlg.h \
+ C:/mingw64/x86_64-w64-mingw32/include/stralign.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/stralign_s.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winsvc.h \
+ C:/mingw64/x86_64-w64-mingw32/include/mcx.h \
+ C:/mingw64/x86_64-w64-mingw32/include/imm.h \
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ws1_undef.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_timeval.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_bsd_types.h \
+ C:/mingw64/x86_64-w64-mingw32/include/inaddr.h \
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_socket_types.h \
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_fd_types.h \
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ip_types.h \
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_wsadata.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ws2def.h \
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_wsa_errnos.h \
+ C:/mingw64/x86_64-w64-mingw32/include/qos.h \
+ C:/mingw64/x86_64-w64-mingw32/include/afunix.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ws2tcpip.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ws2ipdef.h \
+ C:/mingw64/x86_64-w64-mingw32/include/in6addr.h \
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ip_mreq1.h \
+ C:/mingw64/x86_64-w64-mingw32/include/mstcpip.h \
+ C:/mingw64/x86_64-w64-mingw32/include/time.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sys/timeb.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/sys/timeb_s.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pthread_time.h \
+ C:/mingw64/x86_64-w64-mingw32/include/unistd.h \
+ C:/mingw64/x86_64-w64-mingw32/include/io.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_off_t.h \
+ C:/mingw64/x86_64-w64-mingw32/include/process.h \
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt_startup.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sys/types.h \
+ C:/mingw64/x86_64-w64-mingw32/include/getopt.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pthread_unistd.h \
+ C:/mingw64/x86_64-w64-mingw32/include/stdio.h \
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt_stdio_config.h \
+ C:/mingw64/x86_64-w64-mingw32/include/swprintf.inl \
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/stdio_s.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_x509.h
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/lib/tls_tickets.cpp.obj b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/lib/tls_tickets.cpp.obj
new file mode 100644
index 0000000..0a92702
Binary files /dev/null and b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/lib/tls_tickets.cpp.obj differ
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/lib/tls_tickets.cpp.obj.d b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/lib/tls_tickets.cpp.obj.d
new file mode 100644
index 0000000..c7d7303
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/lib/tls_tickets.cpp.obj.d
@@ -0,0 +1,308 @@
+CMakeFiles/tiitls.dir/lib/tls_tickets.cpp.obj: \
+ D:\DOKUMENTY\diplomovka-final\Scott-cpp-win\lib\tls_tickets.cpp \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_tickets.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls1_3.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stdint.h \
+ C:/mingw64/x86_64-w64-mingw32/include/stdint.h \
+ C:/mingw64/x86_64-w64-mingw32/include/crtdefs.h \
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_mac.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_secapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/vadefs.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sdks/_mingw_ddk.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stddef.h \
+ C:/mingw64/x86_64-w64-mingw32/include/stddef.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_octads.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_sockets.h \
+ C:/mingw64/x86_64-w64-mingw32/include/string.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/string_s.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winsock2.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_unicode.h \
+ C:/mingw64/x86_64-w64-mingw32/include/windows.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sdkddkver.h \
+ C:/mingw64/x86_64-w64-mingw32/include/excpt.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stdarg.h \
+ C:/mingw64/x86_64-w64-mingw32/include/stdarg.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_stdarg.h \
+ C:/mingw64/x86_64-w64-mingw32/include/windef.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winapifamily.h \
+ C:/mingw64/x86_64-w64-mingw32/include/minwindef.h \
+ C:/mingw64/x86_64-w64-mingw32/include/specstrings.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sal.h \
+ C:/mingw64/x86_64-w64-mingw32/include/concurrencysal.h \
+ C:/mingw64/x86_64-w64-mingw32/include/driverspecs.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winnt.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ctype.h \
+ C:/mingw64/x86_64-w64-mingw32/include/apiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/intrin-impl.h \
+ C:/mingw64/x86_64-w64-mingw32/include/basetsd.h \
+ C:/mingw64/x86_64-w64-mingw32/include/guiddef.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/x86intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/x86gprintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/ia32intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/adxintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/bmiintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/bmi2intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cetintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cldemoteintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clflushoptintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clwbintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/clzerointrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/cmpccxaddintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/enqcmdintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fxsrintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/lzcntintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/lwpintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/movdirintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mwaitintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mwaitxintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pconfigintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/popcntintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pkuintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/prfchiintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/raointintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/rdseedintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/rtmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/serializeintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/sgxintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tbmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tsxldtrkintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/uintrintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/waitpkgintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/wbnoinvdintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsaveintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsavecintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsaveoptintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xsavesintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xtestintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/hresetintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/immintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xmmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mm_malloc.h \
+ C:/mingw64/include/c++/13.2.0/stdlib.h \
+ C:/mingw64/include/c++/13.2.0/cstdlib \
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/c++config.h \
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/os_defines.h \
+ C:/mingw64/include/c++/13.2.0/x86_64-w64-mingw32/bits/cpu_defines.h \
+ C:/mingw64/include/c++/13.2.0/pstl/pstl_config.h \
+ C:/mingw64/x86_64-w64-mingw32/include/stdlib.h \
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt_wstdlib.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/limits.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/syslimits.h \
+ C:/mingw64/x86_64-w64-mingw32/include/limits.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/stdlib_s.h \
+ C:/mingw64/x86_64-w64-mingw32/include/malloc.h \
+ C:/mingw64/include/c++/13.2.0/bits/std_abs.h \
+ C:/mingw64/x86_64-w64-mingw32/include/errno.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/emmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/pmmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/tmmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/smmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/wmmintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxvnniintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxifmaintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxvnniint8intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx2intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512erintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512pfintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512cdintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bwintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512dqintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vlbwintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vldqintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512ifmaintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512ifmavlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmiintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmivlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx5124fmapsintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx5124vnniwintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vpopcntdqintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmi2intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vbmi2vlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vnniintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vnnivlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vpopcntdqvlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bitalgintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vp2intersectintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512vp2intersectvlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fp16intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512fp16vlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/shaintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fmaintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/f16cintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/gfniintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/vaesintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/vpclmulqdqintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bf16vlintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avx512bf16intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/avxneconvertintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxtileintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxint8intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxbf16intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxcomplexintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/prfchwintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/keylockerintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/amxfp16intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/mm3dnow.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/fma4intrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/ammintrin.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/xopintrin.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack4.h \
+ C:/mingw64/x86_64-w64-mingw32/include/poppack.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack4.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack2.h \
+ C:/mingw64/x86_64-w64-mingw32/include/poppack.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack2.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack8.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack8.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ktmtypes.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winbase.h \
+ C:/mingw64/x86_64-w64-mingw32/include/apisetcconv.h \
+ C:/mingw64/x86_64-w64-mingw32/include/minwinbase.h \
+ C:/mingw64/x86_64-w64-mingw32/include/bemapiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/debugapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/errhandlingapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/fibersapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/fileapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/handleapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/heapapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ioapiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/interlockedapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/jobapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/libloaderapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/memoryapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/namedpipeapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/namespaceapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/processenv.h \
+ C:/mingw64/x86_64-w64-mingw32/include/processthreadsapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/processtopologyapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/profileapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/realtimeapiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/securityappcontainer.h \
+ C:/mingw64/x86_64-w64-mingw32/include/securitybaseapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/synchapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sysinfoapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/systemtopologyapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/threadpoolapiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/threadpoollegacyapiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/utilapiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/wow64apiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winerror.h \
+ C:/mingw64/x86_64-w64-mingw32/include/fltwinerror.h \
+ C:/mingw64/x86_64-w64-mingw32/include/timezoneapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/wingdi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pshpack1.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winuser.h \
+ C:/mingw64/x86_64-w64-mingw32/include/tvout.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winnls.h \
+ C:/mingw64/x86_64-w64-mingw32/include/datetimeapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/stringapiset.h \
+ C:/mingw64/x86_64-w64-mingw32/include/wincon.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winver.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winreg.h \
+ C:/mingw64/x86_64-w64-mingw32/include/reason.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winnetwk.h \
+ C:/mingw64/x86_64-w64-mingw32/include/wnnc.h \
+ C:/mingw64/x86_64-w64-mingw32/include/virtdisk.h \
+ C:/mingw64/x86_64-w64-mingw32/include/cderr.h \
+ C:/mingw64/x86_64-w64-mingw32/include/dde.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ddeml.h \
+ C:/mingw64/x86_64-w64-mingw32/include/dlgs.h \
+ C:/mingw64/x86_64-w64-mingw32/include/lzexpand.h \
+ C:/mingw64/x86_64-w64-mingw32/include/mmsystem.h \
+ C:/mingw64/x86_64-w64-mingw32/include/mmsyscom.h \
+ C:/mingw64/x86_64-w64-mingw32/include/mciapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/mmiscapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/mmiscapi2.h \
+ C:/mingw64/x86_64-w64-mingw32/include/playsoundapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/mmeapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/timeapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/joystickapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/nb30.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpc.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpcdce.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpcdcep.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpcnsi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpcnterr.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpcasync.h \
+ C:/mingw64/x86_64-w64-mingw32/include/shellapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winperf.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winsock.h \
+ C:/mingw64/x86_64-w64-mingw32/include/wincrypt.h \
+ C:/mingw64/x86_64-w64-mingw32/include/bcrypt.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ncrypt.h \
+ C:/mingw64/x86_64-w64-mingw32/include/dpapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winefs.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winscard.h \
+ C:/mingw64/x86_64-w64-mingw32/include/wtypes.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpcndr.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpcnsip.h \
+ C:/mingw64/x86_64-w64-mingw32/include/rpcsal.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ole2.h \
+ C:/mingw64/x86_64-w64-mingw32/include/objbase.h \
+ C:/mingw64/x86_64-w64-mingw32/include/combaseapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/wtypesbase.h \
+ C:/mingw64/x86_64-w64-mingw32/include/unknwnbase.h \
+ C:/mingw64/x86_64-w64-mingw32/include/objidlbase.h \
+ C:/mingw64/x86_64-w64-mingw32/include/cguid.h \
+ C:/mingw64/x86_64-w64-mingw32/include/objidl.h \
+ C:/mingw64/x86_64-w64-mingw32/include/unknwn.h \
+ C:/mingw64/x86_64-w64-mingw32/include/urlmon.h \
+ C:/mingw64/x86_64-w64-mingw32/include/oleidl.h \
+ C:/mingw64/x86_64-w64-mingw32/include/servprov.h \
+ C:/mingw64/x86_64-w64-mingw32/include/msxml.h \
+ C:/mingw64/x86_64-w64-mingw32/include/oaidl.h \
+ C:/mingw64/x86_64-w64-mingw32/include/propidl.h \
+ C:/mingw64/x86_64-w64-mingw32/include/oleauto.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winioctl.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winsmcrd.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winspool.h \
+ C:/mingw64/x86_64-w64-mingw32/include/prsht.h \
+ C:/mingw64/x86_64-w64-mingw32/include/commdlg.h \
+ C:/mingw64/x86_64-w64-mingw32/include/stralign.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/stralign_s.h \
+ C:/mingw64/x86_64-w64-mingw32/include/winsvc.h \
+ C:/mingw64/x86_64-w64-mingw32/include/mcx.h \
+ C:/mingw64/x86_64-w64-mingw32/include/imm.h \
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ws1_undef.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_timeval.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_bsd_types.h \
+ C:/mingw64/x86_64-w64-mingw32/include/inaddr.h \
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_socket_types.h \
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_fd_types.h \
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ip_types.h \
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_wsadata.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ws2def.h \
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_wsa_errnos.h \
+ C:/mingw64/x86_64-w64-mingw32/include/qos.h \
+ C:/mingw64/x86_64-w64-mingw32/include/afunix.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ws2tcpip.h \
+ C:/mingw64/x86_64-w64-mingw32/include/ws2ipdef.h \
+ C:/mingw64/x86_64-w64-mingw32/include/in6addr.h \
+ C:/mingw64/x86_64-w64-mingw32/include/psdk_inc/_ip_mreq1.h \
+ C:/mingw64/x86_64-w64-mingw32/include/mstcpip.h \
+ C:/mingw64/x86_64-w64-mingw32/include/time.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sys/timeb.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/sys/timeb_s.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pthread_time.h \
+ C:/mingw64/x86_64-w64-mingw32/include/unistd.h \
+ C:/mingw64/x86_64-w64-mingw32/include/io.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_off_t.h \
+ C:/mingw64/x86_64-w64-mingw32/include/process.h \
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt_startup.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sys/types.h \
+ C:/mingw64/x86_64-w64-mingw32/include/getopt.h \
+ C:/mingw64/x86_64-w64-mingw32/include/pthread_unistd.h \
+ C:/mingw64/x86_64-w64-mingw32/include/stdio.h \
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt_stdio_config.h \
+ C:/mingw64/x86_64-w64-mingw32/include/swprintf.inl \
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/stdio_s.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_client_recv.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_sal.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_keys_calc.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_client_send.h
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/lib/tls_x509.cpp.obj b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/lib/tls_x509.cpp.obj
new file mode 100644
index 0000000..bfa934a
Binary files /dev/null and b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/lib/tls_x509.cpp.obj differ
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/lib/tls_x509.cpp.obj.d b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/lib/tls_x509.cpp.obj.d
new file mode 100644
index 0000000..fb1d191
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/lib/tls_x509.cpp.obj.d
@@ -0,0 +1,18 @@
+CMakeFiles/tiitls.dir/lib/tls_x509.cpp.obj: \
+ D:\DOKUMENTY\diplomovka-final\Scott-cpp-win\lib\tls_x509.cpp \
+ C:/mingw64/x86_64-w64-mingw32/include/stdio.h \
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt_stdio_config.h \
+ C:/mingw64/x86_64-w64-mingw32/include/corecrt.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_mac.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_secapi.h \
+ C:/mingw64/x86_64-w64-mingw32/include/vadefs.h \
+ C:/mingw64/x86_64-w64-mingw32/include/sdks/_mingw_ddk.h \
+ C:/mingw64/x86_64-w64-mingw32/include/_mingw_off_t.h \
+ C:/mingw64/x86_64-w64-mingw32/include/swprintf.inl \
+ C:/mingw64/x86_64-w64-mingw32/include/sec_api/stdio_s.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_octads.h \
+ C:/mingw64/lib/gcc/x86_64-w64-mingw32/13.2.0/include/stddef.h \
+ C:/mingw64/x86_64-w64-mingw32/include/stddef.h \
+ C:/mingw64/x86_64-w64-mingw32/include/crtdefs.h \
+ D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/include/tls_x509.h
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/link.txt b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/link.txt
new file mode 100644
index 0000000..5525aa7
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/link.txt
@@ -0,0 +1,2 @@
+C:\mingw64\bin\ar.exe qc libtiitls.a CMakeFiles/tiitls.dir/lib/tls_cert_chain.cpp.obj CMakeFiles/tiitls.dir/lib/tls_client_recv.cpp.obj CMakeFiles/tiitls.dir/lib/tls_client_send.cpp.obj CMakeFiles/tiitls.dir/lib/tls_keys_calc.cpp.obj CMakeFiles/tiitls.dir/lib/tls_sockets.cpp.obj CMakeFiles/tiitls.dir/lib/tls_octads.cpp.obj CMakeFiles/tiitls.dir/lib/tls_logger.cpp.obj CMakeFiles/tiitls.dir/lib/tls_protocol.cpp.obj CMakeFiles/tiitls.dir/lib/tls_cacerts.cpp.obj CMakeFiles/tiitls.dir/lib/tls_client_cert.cpp.obj CMakeFiles/tiitls.dir/lib/tls_tickets.cpp.obj CMakeFiles/tiitls.dir/lib/tls_x509.cpp.obj CMakeFiles/tiitls.dir/lib/tls_sal.cpp.obj CMakeFiles/tiitls.dir/lib/ibe/tls_bfibe.cpp.obj CMakeFiles/tiitls.dir/lib/ibe/tls_pqibe.cpp.obj
+C:\mingw64\bin\ranlib.exe libtiitls.a
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/progress.make b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/progress.make
new file mode 100644
index 0000000..7813925
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeFiles/tiitls.dir/progress.make
@@ -0,0 +1,17 @@
+CMAKE_PROGRESS_1 = 3
+CMAKE_PROGRESS_2 = 4
+CMAKE_PROGRESS_3 = 5
+CMAKE_PROGRESS_4 = 6
+CMAKE_PROGRESS_5 = 7
+CMAKE_PROGRESS_6 = 8
+CMAKE_PROGRESS_7 = 9
+CMAKE_PROGRESS_8 = 10
+CMAKE_PROGRESS_9 = 11
+CMAKE_PROGRESS_10 = 12
+CMAKE_PROGRESS_11 = 13
+CMAKE_PROGRESS_12 = 14
+CMAKE_PROGRESS_13 = 15
+CMAKE_PROGRESS_14 = 16
+CMAKE_PROGRESS_15 = 17
+CMAKE_PROGRESS_16 = 18
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/CMakeLists.txt b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeLists.txt
new file mode 100644
index 0000000..dd23d41
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/CMakeLists.txt
@@ -0,0 +1,45 @@
+# JS update 29.02.2024
+# Odstranene nepotrebne podmienky a funkcie
+
+cmake_minimum_required(VERSION 3.7)
+
+# CMake instructions to build tiitls library
+
+# Set the project name
+project(tiitls1.3)
+
+configure_file(./sal/tls_sal_m.xpp ./lib/tls_sal.cpp COPYONLY)
+
+set(SRC
+       ./lib/tls_cert_chain.cpp
+       ./lib/tls_client_recv.cpp
+       ./lib/tls_client_send.cpp
+       ./lib/tls_keys_calc.cpp
+       ./lib/tls_sockets.cpp
+       ./lib/tls_octads.cpp
+       ./lib/tls_logger.cpp
+       ./lib/tls_protocol.cpp
+       ./lib/tls_cacerts.cpp
+       ./lib/tls_client_cert.cpp
+       ./lib/tls_tickets.cpp
+       ./lib/tls_x509.cpp
+       ./lib/tls_sal.cpp
+       ./lib/ibe/tls_bfibe.cpp
+       ./lib/ibe/tls_pqibe.cpp
+        )
+
+# Add a library
+add_library(tiitls STATIC ${SRC})
+
+target_include_directories(tiitls PUBLIC include)
+target_include_directories(tiitls PUBLIC sal/miracl)
+target_include_directories(tiitls PUBLIC sal/miracl/includes)
+
+# CMake instructions to build client app
+
+add_executable( client src/client.cpp ) 
+
+target_link_libraries(client tiitls )
+
+target_link_libraries(client ${PROJECT_SOURCE_DIR}/sal/miracl/core.a -loqs -lstdc++ -lws2_32)
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/Makefile b/TIIGER_TLS/PQ_TIIGER_TLS/Makefile
new file mode 100644
index 0000000..79d9e95
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/Makefile
@@ -0,0 +1,599 @@
+# CMAKE generated file: DO NOT EDIT!
+# Generated by "MinGW Makefiles" Generator, CMake Version 3.28
+
+# Default target executed when no arguments are given to make.
+default_target: all
+.PHONY : default_target
+
+# Allow only one "make -f Makefile2" at a time, but pass parallelism.
+.NOTPARALLEL:
+
+#=============================================================================
+# Special targets provided by cmake.
+
+# Disable implicit rules so canonical targets will work.
+.SUFFIXES:
+
+# Disable VCS-based implicit rules.
+% : %,v
+
+# Disable VCS-based implicit rules.
+% : RCS/%
+
+# Disable VCS-based implicit rules.
+% : RCS/%,v
+
+# Disable VCS-based implicit rules.
+% : SCCS/s.%
+
+# Disable VCS-based implicit rules.
+% : s.%
+
+.SUFFIXES: .hpux_make_needs_suffix_list
+
+# Command-line flag to silence nested $(MAKE).
+$(VERBOSE)MAKESILENT = -s
+
+#Suppress display of executed commands.
+$(VERBOSE).SILENT:
+
+# A target that is always out of date.
+cmake_force:
+.PHONY : cmake_force
+
+#=============================================================================
+# Set environment variables for the build.
+
+SHELL = cmd.exe
+
+# The CMake executable.
+CMAKE_COMMAND = C:\mingw64\bin\cmake.exe
+
+# The command to remove a file.
+RM = C:\mingw64\bin\cmake.exe -E rm -f
+
+# Escaping for special characters.
+EQUALS = =
+
+# The top-level source directory on which CMake was run.
+CMAKE_SOURCE_DIR = D:\DOKUMENTY\diplomovka-final\Scott-cpp-win
+
+# The top-level build directory on which CMake was run.
+CMAKE_BINARY_DIR = D:\DOKUMENTY\diplomovka-final\Scott-cpp-win
+
+#=============================================================================
+# Targets provided globally by CMake.
+
+# Special rule for the target edit_cache
+edit_cache:
+	@$(CMAKE_COMMAND) -E cmake_echo_color "--switch=$(COLOR)" --cyan "No interactive CMake dialog available..."
+	C:\mingw64\bin\cmake.exe -E echo "No interactive CMake dialog available."
+.PHONY : edit_cache
+
+# Special rule for the target edit_cache
+edit_cache/fast: edit_cache
+.PHONY : edit_cache/fast
+
+# Special rule for the target rebuild_cache
+rebuild_cache:
+	@$(CMAKE_COMMAND) -E cmake_echo_color "--switch=$(COLOR)" --cyan "Running CMake to regenerate build system..."
+	C:\mingw64\bin\cmake.exe --regenerate-during-build -S$(CMAKE_SOURCE_DIR) -B$(CMAKE_BINARY_DIR)
+.PHONY : rebuild_cache
+
+# Special rule for the target rebuild_cache
+rebuild_cache/fast: rebuild_cache
+.PHONY : rebuild_cache/fast
+
+# The main all target
+all: cmake_check_build_system
+	$(CMAKE_COMMAND) -E cmake_progress_start D:\DOKUMENTY\diplomovka-final\Scott-cpp-win\CMakeFiles D:\DOKUMENTY\diplomovka-final\Scott-cpp-win\\CMakeFiles\progress.marks
+	$(MAKE) $(MAKESILENT) -f CMakeFiles\Makefile2 all
+	$(CMAKE_COMMAND) -E cmake_progress_start D:\DOKUMENTY\diplomovka-final\Scott-cpp-win\CMakeFiles 0
+.PHONY : all
+
+# The main clean target
+clean:
+	$(MAKE) $(MAKESILENT) -f CMakeFiles\Makefile2 clean
+.PHONY : clean
+
+# The main clean target
+clean/fast: clean
+.PHONY : clean/fast
+
+# Prepare targets for installation.
+preinstall: all
+	$(MAKE) $(MAKESILENT) -f CMakeFiles\Makefile2 preinstall
+.PHONY : preinstall
+
+# Prepare targets for installation.
+preinstall/fast:
+	$(MAKE) $(MAKESILENT) -f CMakeFiles\Makefile2 preinstall
+.PHONY : preinstall/fast
+
+# clear depends
+depend:
+	$(CMAKE_COMMAND) -S$(CMAKE_SOURCE_DIR) -B$(CMAKE_BINARY_DIR) --check-build-system CMakeFiles\Makefile.cmake 1
+.PHONY : depend
+
+#=============================================================================
+# Target rules for targets named tiitls
+
+# Build rule for target.
+tiitls: cmake_check_build_system
+	$(MAKE) $(MAKESILENT) -f CMakeFiles\Makefile2 tiitls
+.PHONY : tiitls
+
+# fast build rule for target.
+tiitls/fast:
+	$(MAKE) $(MAKESILENT) -f CMakeFiles\tiitls.dir\build.make CMakeFiles/tiitls.dir/build
+.PHONY : tiitls/fast
+
+#=============================================================================
+# Target rules for targets named client
+
+# Build rule for target.
+client: cmake_check_build_system
+	$(MAKE) $(MAKESILENT) -f CMakeFiles\Makefile2 client
+.PHONY : client
+
+# fast build rule for target.
+client/fast:
+	$(MAKE) $(MAKESILENT) -f CMakeFiles\client.dir\build.make CMakeFiles/client.dir/build
+.PHONY : client/fast
+
+lib/ibe/tls_bfibe.obj: lib/ibe/tls_bfibe.cpp.obj
+.PHONY : lib/ibe/tls_bfibe.obj
+
+# target to build an object file
+lib/ibe/tls_bfibe.cpp.obj:
+	$(MAKE) $(MAKESILENT) -f CMakeFiles\tiitls.dir\build.make CMakeFiles/tiitls.dir/lib/ibe/tls_bfibe.cpp.obj
+.PHONY : lib/ibe/tls_bfibe.cpp.obj
+
+lib/ibe/tls_bfibe.i: lib/ibe/tls_bfibe.cpp.i
+.PHONY : lib/ibe/tls_bfibe.i
+
+# target to preprocess a source file
+lib/ibe/tls_bfibe.cpp.i:
+	$(MAKE) $(MAKESILENT) -f CMakeFiles\tiitls.dir\build.make CMakeFiles/tiitls.dir/lib/ibe/tls_bfibe.cpp.i
+.PHONY : lib/ibe/tls_bfibe.cpp.i
+
+lib/ibe/tls_bfibe.s: lib/ibe/tls_bfibe.cpp.s
+.PHONY : lib/ibe/tls_bfibe.s
+
+# target to generate assembly for a file
+lib/ibe/tls_bfibe.cpp.s:
+	$(MAKE) $(MAKESILENT) -f CMakeFiles\tiitls.dir\build.make CMakeFiles/tiitls.dir/lib/ibe/tls_bfibe.cpp.s
+.PHONY : lib/ibe/tls_bfibe.cpp.s
+
+lib/ibe/tls_pqibe.obj: lib/ibe/tls_pqibe.cpp.obj
+.PHONY : lib/ibe/tls_pqibe.obj
+
+# target to build an object file
+lib/ibe/tls_pqibe.cpp.obj:
+	$(MAKE) $(MAKESILENT) -f CMakeFiles\tiitls.dir\build.make CMakeFiles/tiitls.dir/lib/ibe/tls_pqibe.cpp.obj
+.PHONY : lib/ibe/tls_pqibe.cpp.obj
+
+lib/ibe/tls_pqibe.i: lib/ibe/tls_pqibe.cpp.i
+.PHONY : lib/ibe/tls_pqibe.i
+
+# target to preprocess a source file
+lib/ibe/tls_pqibe.cpp.i:
+	$(MAKE) $(MAKESILENT) -f CMakeFiles\tiitls.dir\build.make CMakeFiles/tiitls.dir/lib/ibe/tls_pqibe.cpp.i
+.PHONY : lib/ibe/tls_pqibe.cpp.i
+
+lib/ibe/tls_pqibe.s: lib/ibe/tls_pqibe.cpp.s
+.PHONY : lib/ibe/tls_pqibe.s
+
+# target to generate assembly for a file
+lib/ibe/tls_pqibe.cpp.s:
+	$(MAKE) $(MAKESILENT) -f CMakeFiles\tiitls.dir\build.make CMakeFiles/tiitls.dir/lib/ibe/tls_pqibe.cpp.s
+.PHONY : lib/ibe/tls_pqibe.cpp.s
+
+lib/tls_cacerts.obj: lib/tls_cacerts.cpp.obj
+.PHONY : lib/tls_cacerts.obj
+
+# target to build an object file
+lib/tls_cacerts.cpp.obj:
+	$(MAKE) $(MAKESILENT) -f CMakeFiles\tiitls.dir\build.make CMakeFiles/tiitls.dir/lib/tls_cacerts.cpp.obj
+.PHONY : lib/tls_cacerts.cpp.obj
+
+lib/tls_cacerts.i: lib/tls_cacerts.cpp.i
+.PHONY : lib/tls_cacerts.i
+
+# target to preprocess a source file
+lib/tls_cacerts.cpp.i:
+	$(MAKE) $(MAKESILENT) -f CMakeFiles\tiitls.dir\build.make CMakeFiles/tiitls.dir/lib/tls_cacerts.cpp.i
+.PHONY : lib/tls_cacerts.cpp.i
+
+lib/tls_cacerts.s: lib/tls_cacerts.cpp.s
+.PHONY : lib/tls_cacerts.s
+
+# target to generate assembly for a file
+lib/tls_cacerts.cpp.s:
+	$(MAKE) $(MAKESILENT) -f CMakeFiles\tiitls.dir\build.make CMakeFiles/tiitls.dir/lib/tls_cacerts.cpp.s
+.PHONY : lib/tls_cacerts.cpp.s
+
+lib/tls_cert_chain.obj: lib/tls_cert_chain.cpp.obj
+.PHONY : lib/tls_cert_chain.obj
+
+# target to build an object file
+lib/tls_cert_chain.cpp.obj:
+	$(MAKE) $(MAKESILENT) -f CMakeFiles\tiitls.dir\build.make CMakeFiles/tiitls.dir/lib/tls_cert_chain.cpp.obj
+.PHONY : lib/tls_cert_chain.cpp.obj
+
+lib/tls_cert_chain.i: lib/tls_cert_chain.cpp.i
+.PHONY : lib/tls_cert_chain.i
+
+# target to preprocess a source file
+lib/tls_cert_chain.cpp.i:
+	$(MAKE) $(MAKESILENT) -f CMakeFiles\tiitls.dir\build.make CMakeFiles/tiitls.dir/lib/tls_cert_chain.cpp.i
+.PHONY : lib/tls_cert_chain.cpp.i
+
+lib/tls_cert_chain.s: lib/tls_cert_chain.cpp.s
+.PHONY : lib/tls_cert_chain.s
+
+# target to generate assembly for a file
+lib/tls_cert_chain.cpp.s:
+	$(MAKE) $(MAKESILENT) -f CMakeFiles\tiitls.dir\build.make CMakeFiles/tiitls.dir/lib/tls_cert_chain.cpp.s
+.PHONY : lib/tls_cert_chain.cpp.s
+
+lib/tls_client_cert.obj: lib/tls_client_cert.cpp.obj
+.PHONY : lib/tls_client_cert.obj
+
+# target to build an object file
+lib/tls_client_cert.cpp.obj:
+	$(MAKE) $(MAKESILENT) -f CMakeFiles\tiitls.dir\build.make CMakeFiles/tiitls.dir/lib/tls_client_cert.cpp.obj
+.PHONY : lib/tls_client_cert.cpp.obj
+
+lib/tls_client_cert.i: lib/tls_client_cert.cpp.i
+.PHONY : lib/tls_client_cert.i
+
+# target to preprocess a source file
+lib/tls_client_cert.cpp.i:
+	$(MAKE) $(MAKESILENT) -f CMakeFiles\tiitls.dir\build.make CMakeFiles/tiitls.dir/lib/tls_client_cert.cpp.i
+.PHONY : lib/tls_client_cert.cpp.i
+
+lib/tls_client_cert.s: lib/tls_client_cert.cpp.s
+.PHONY : lib/tls_client_cert.s
+
+# target to generate assembly for a file
+lib/tls_client_cert.cpp.s:
+	$(MAKE) $(MAKESILENT) -f CMakeFiles\tiitls.dir\build.make CMakeFiles/tiitls.dir/lib/tls_client_cert.cpp.s
+.PHONY : lib/tls_client_cert.cpp.s
+
+lib/tls_client_recv.obj: lib/tls_client_recv.cpp.obj
+.PHONY : lib/tls_client_recv.obj
+
+# target to build an object file
+lib/tls_client_recv.cpp.obj:
+	$(MAKE) $(MAKESILENT) -f CMakeFiles\tiitls.dir\build.make CMakeFiles/tiitls.dir/lib/tls_client_recv.cpp.obj
+.PHONY : lib/tls_client_recv.cpp.obj
+
+lib/tls_client_recv.i: lib/tls_client_recv.cpp.i
+.PHONY : lib/tls_client_recv.i
+
+# target to preprocess a source file
+lib/tls_client_recv.cpp.i:
+	$(MAKE) $(MAKESILENT) -f CMakeFiles\tiitls.dir\build.make CMakeFiles/tiitls.dir/lib/tls_client_recv.cpp.i
+.PHONY : lib/tls_client_recv.cpp.i
+
+lib/tls_client_recv.s: lib/tls_client_recv.cpp.s
+.PHONY : lib/tls_client_recv.s
+
+# target to generate assembly for a file
+lib/tls_client_recv.cpp.s:
+	$(MAKE) $(MAKESILENT) -f CMakeFiles\tiitls.dir\build.make CMakeFiles/tiitls.dir/lib/tls_client_recv.cpp.s
+.PHONY : lib/tls_client_recv.cpp.s
+
+lib/tls_client_send.obj: lib/tls_client_send.cpp.obj
+.PHONY : lib/tls_client_send.obj
+
+# target to build an object file
+lib/tls_client_send.cpp.obj:
+	$(MAKE) $(MAKESILENT) -f CMakeFiles\tiitls.dir\build.make CMakeFiles/tiitls.dir/lib/tls_client_send.cpp.obj
+.PHONY : lib/tls_client_send.cpp.obj
+
+lib/tls_client_send.i: lib/tls_client_send.cpp.i
+.PHONY : lib/tls_client_send.i
+
+# target to preprocess a source file
+lib/tls_client_send.cpp.i:
+	$(MAKE) $(MAKESILENT) -f CMakeFiles\tiitls.dir\build.make CMakeFiles/tiitls.dir/lib/tls_client_send.cpp.i
+.PHONY : lib/tls_client_send.cpp.i
+
+lib/tls_client_send.s: lib/tls_client_send.cpp.s
+.PHONY : lib/tls_client_send.s
+
+# target to generate assembly for a file
+lib/tls_client_send.cpp.s:
+	$(MAKE) $(MAKESILENT) -f CMakeFiles\tiitls.dir\build.make CMakeFiles/tiitls.dir/lib/tls_client_send.cpp.s
+.PHONY : lib/tls_client_send.cpp.s
+
+lib/tls_keys_calc.obj: lib/tls_keys_calc.cpp.obj
+.PHONY : lib/tls_keys_calc.obj
+
+# target to build an object file
+lib/tls_keys_calc.cpp.obj:
+	$(MAKE) $(MAKESILENT) -f CMakeFiles\tiitls.dir\build.make CMakeFiles/tiitls.dir/lib/tls_keys_calc.cpp.obj
+.PHONY : lib/tls_keys_calc.cpp.obj
+
+lib/tls_keys_calc.i: lib/tls_keys_calc.cpp.i
+.PHONY : lib/tls_keys_calc.i
+
+# target to preprocess a source file
+lib/tls_keys_calc.cpp.i:
+	$(MAKE) $(MAKESILENT) -f CMakeFiles\tiitls.dir\build.make CMakeFiles/tiitls.dir/lib/tls_keys_calc.cpp.i
+.PHONY : lib/tls_keys_calc.cpp.i
+
+lib/tls_keys_calc.s: lib/tls_keys_calc.cpp.s
+.PHONY : lib/tls_keys_calc.s
+
+# target to generate assembly for a file
+lib/tls_keys_calc.cpp.s:
+	$(MAKE) $(MAKESILENT) -f CMakeFiles\tiitls.dir\build.make CMakeFiles/tiitls.dir/lib/tls_keys_calc.cpp.s
+.PHONY : lib/tls_keys_calc.cpp.s
+
+lib/tls_logger.obj: lib/tls_logger.cpp.obj
+.PHONY : lib/tls_logger.obj
+
+# target to build an object file
+lib/tls_logger.cpp.obj:
+	$(MAKE) $(MAKESILENT) -f CMakeFiles\tiitls.dir\build.make CMakeFiles/tiitls.dir/lib/tls_logger.cpp.obj
+.PHONY : lib/tls_logger.cpp.obj
+
+lib/tls_logger.i: lib/tls_logger.cpp.i
+.PHONY : lib/tls_logger.i
+
+# target to preprocess a source file
+lib/tls_logger.cpp.i:
+	$(MAKE) $(MAKESILENT) -f CMakeFiles\tiitls.dir\build.make CMakeFiles/tiitls.dir/lib/tls_logger.cpp.i
+.PHONY : lib/tls_logger.cpp.i
+
+lib/tls_logger.s: lib/tls_logger.cpp.s
+.PHONY : lib/tls_logger.s
+
+# target to generate assembly for a file
+lib/tls_logger.cpp.s:
+	$(MAKE) $(MAKESILENT) -f CMakeFiles\tiitls.dir\build.make CMakeFiles/tiitls.dir/lib/tls_logger.cpp.s
+.PHONY : lib/tls_logger.cpp.s
+
+lib/tls_octads.obj: lib/tls_octads.cpp.obj
+.PHONY : lib/tls_octads.obj
+
+# target to build an object file
+lib/tls_octads.cpp.obj:
+	$(MAKE) $(MAKESILENT) -f CMakeFiles\tiitls.dir\build.make CMakeFiles/tiitls.dir/lib/tls_octads.cpp.obj
+.PHONY : lib/tls_octads.cpp.obj
+
+lib/tls_octads.i: lib/tls_octads.cpp.i
+.PHONY : lib/tls_octads.i
+
+# target to preprocess a source file
+lib/tls_octads.cpp.i:
+	$(MAKE) $(MAKESILENT) -f CMakeFiles\tiitls.dir\build.make CMakeFiles/tiitls.dir/lib/tls_octads.cpp.i
+.PHONY : lib/tls_octads.cpp.i
+
+lib/tls_octads.s: lib/tls_octads.cpp.s
+.PHONY : lib/tls_octads.s
+
+# target to generate assembly for a file
+lib/tls_octads.cpp.s:
+	$(MAKE) $(MAKESILENT) -f CMakeFiles\tiitls.dir\build.make CMakeFiles/tiitls.dir/lib/tls_octads.cpp.s
+.PHONY : lib/tls_octads.cpp.s
+
+lib/tls_protocol.obj: lib/tls_protocol.cpp.obj
+.PHONY : lib/tls_protocol.obj
+
+# target to build an object file
+lib/tls_protocol.cpp.obj:
+	$(MAKE) $(MAKESILENT) -f CMakeFiles\tiitls.dir\build.make CMakeFiles/tiitls.dir/lib/tls_protocol.cpp.obj
+.PHONY : lib/tls_protocol.cpp.obj
+
+lib/tls_protocol.i: lib/tls_protocol.cpp.i
+.PHONY : lib/tls_protocol.i
+
+# target to preprocess a source file
+lib/tls_protocol.cpp.i:
+	$(MAKE) $(MAKESILENT) -f CMakeFiles\tiitls.dir\build.make CMakeFiles/tiitls.dir/lib/tls_protocol.cpp.i
+.PHONY : lib/tls_protocol.cpp.i
+
+lib/tls_protocol.s: lib/tls_protocol.cpp.s
+.PHONY : lib/tls_protocol.s
+
+# target to generate assembly for a file
+lib/tls_protocol.cpp.s:
+	$(MAKE) $(MAKESILENT) -f CMakeFiles\tiitls.dir\build.make CMakeFiles/tiitls.dir/lib/tls_protocol.cpp.s
+.PHONY : lib/tls_protocol.cpp.s
+
+lib/tls_sal.obj: lib/tls_sal.cpp.obj
+.PHONY : lib/tls_sal.obj
+
+# target to build an object file
+lib/tls_sal.cpp.obj:
+	$(MAKE) $(MAKESILENT) -f CMakeFiles\tiitls.dir\build.make CMakeFiles/tiitls.dir/lib/tls_sal.cpp.obj
+.PHONY : lib/tls_sal.cpp.obj
+
+lib/tls_sal.i: lib/tls_sal.cpp.i
+.PHONY : lib/tls_sal.i
+
+# target to preprocess a source file
+lib/tls_sal.cpp.i:
+	$(MAKE) $(MAKESILENT) -f CMakeFiles\tiitls.dir\build.make CMakeFiles/tiitls.dir/lib/tls_sal.cpp.i
+.PHONY : lib/tls_sal.cpp.i
+
+lib/tls_sal.s: lib/tls_sal.cpp.s
+.PHONY : lib/tls_sal.s
+
+# target to generate assembly for a file
+lib/tls_sal.cpp.s:
+	$(MAKE) $(MAKESILENT) -f CMakeFiles\tiitls.dir\build.make CMakeFiles/tiitls.dir/lib/tls_sal.cpp.s
+.PHONY : lib/tls_sal.cpp.s
+
+lib/tls_sockets.obj: lib/tls_sockets.cpp.obj
+.PHONY : lib/tls_sockets.obj
+
+# target to build an object file
+lib/tls_sockets.cpp.obj:
+	$(MAKE) $(MAKESILENT) -f CMakeFiles\tiitls.dir\build.make CMakeFiles/tiitls.dir/lib/tls_sockets.cpp.obj
+.PHONY : lib/tls_sockets.cpp.obj
+
+lib/tls_sockets.i: lib/tls_sockets.cpp.i
+.PHONY : lib/tls_sockets.i
+
+# target to preprocess a source file
+lib/tls_sockets.cpp.i:
+	$(MAKE) $(MAKESILENT) -f CMakeFiles\tiitls.dir\build.make CMakeFiles/tiitls.dir/lib/tls_sockets.cpp.i
+.PHONY : lib/tls_sockets.cpp.i
+
+lib/tls_sockets.s: lib/tls_sockets.cpp.s
+.PHONY : lib/tls_sockets.s
+
+# target to generate assembly for a file
+lib/tls_sockets.cpp.s:
+	$(MAKE) $(MAKESILENT) -f CMakeFiles\tiitls.dir\build.make CMakeFiles/tiitls.dir/lib/tls_sockets.cpp.s
+.PHONY : lib/tls_sockets.cpp.s
+
+lib/tls_tickets.obj: lib/tls_tickets.cpp.obj
+.PHONY : lib/tls_tickets.obj
+
+# target to build an object file
+lib/tls_tickets.cpp.obj:
+	$(MAKE) $(MAKESILENT) -f CMakeFiles\tiitls.dir\build.make CMakeFiles/tiitls.dir/lib/tls_tickets.cpp.obj
+.PHONY : lib/tls_tickets.cpp.obj
+
+lib/tls_tickets.i: lib/tls_tickets.cpp.i
+.PHONY : lib/tls_tickets.i
+
+# target to preprocess a source file
+lib/tls_tickets.cpp.i:
+	$(MAKE) $(MAKESILENT) -f CMakeFiles\tiitls.dir\build.make CMakeFiles/tiitls.dir/lib/tls_tickets.cpp.i
+.PHONY : lib/tls_tickets.cpp.i
+
+lib/tls_tickets.s: lib/tls_tickets.cpp.s
+.PHONY : lib/tls_tickets.s
+
+# target to generate assembly for a file
+lib/tls_tickets.cpp.s:
+	$(MAKE) $(MAKESILENT) -f CMakeFiles\tiitls.dir\build.make CMakeFiles/tiitls.dir/lib/tls_tickets.cpp.s
+.PHONY : lib/tls_tickets.cpp.s
+
+lib/tls_x509.obj: lib/tls_x509.cpp.obj
+.PHONY : lib/tls_x509.obj
+
+# target to build an object file
+lib/tls_x509.cpp.obj:
+	$(MAKE) $(MAKESILENT) -f CMakeFiles\tiitls.dir\build.make CMakeFiles/tiitls.dir/lib/tls_x509.cpp.obj
+.PHONY : lib/tls_x509.cpp.obj
+
+lib/tls_x509.i: lib/tls_x509.cpp.i
+.PHONY : lib/tls_x509.i
+
+# target to preprocess a source file
+lib/tls_x509.cpp.i:
+	$(MAKE) $(MAKESILENT) -f CMakeFiles\tiitls.dir\build.make CMakeFiles/tiitls.dir/lib/tls_x509.cpp.i
+.PHONY : lib/tls_x509.cpp.i
+
+lib/tls_x509.s: lib/tls_x509.cpp.s
+.PHONY : lib/tls_x509.s
+
+# target to generate assembly for a file
+lib/tls_x509.cpp.s:
+	$(MAKE) $(MAKESILENT) -f CMakeFiles\tiitls.dir\build.make CMakeFiles/tiitls.dir/lib/tls_x509.cpp.s
+.PHONY : lib/tls_x509.cpp.s
+
+src/client.obj: src/client.cpp.obj
+.PHONY : src/client.obj
+
+# target to build an object file
+src/client.cpp.obj:
+	$(MAKE) $(MAKESILENT) -f CMakeFiles\client.dir\build.make CMakeFiles/client.dir/src/client.cpp.obj
+.PHONY : src/client.cpp.obj
+
+src/client.i: src/client.cpp.i
+.PHONY : src/client.i
+
+# target to preprocess a source file
+src/client.cpp.i:
+	$(MAKE) $(MAKESILENT) -f CMakeFiles\client.dir\build.make CMakeFiles/client.dir/src/client.cpp.i
+.PHONY : src/client.cpp.i
+
+src/client.s: src/client.cpp.s
+.PHONY : src/client.s
+
+# target to generate assembly for a file
+src/client.cpp.s:
+	$(MAKE) $(MAKESILENT) -f CMakeFiles\client.dir\build.make CMakeFiles/client.dir/src/client.cpp.s
+.PHONY : src/client.cpp.s
+
+# Help Target
+help:
+	@echo The following are some of the valid targets for this Makefile:
+	@echo ... all (the default if no target is provided)
+	@echo ... clean
+	@echo ... depend
+	@echo ... edit_cache
+	@echo ... rebuild_cache
+	@echo ... client
+	@echo ... tiitls
+	@echo ... lib/ibe/tls_bfibe.obj
+	@echo ... lib/ibe/tls_bfibe.i
+	@echo ... lib/ibe/tls_bfibe.s
+	@echo ... lib/ibe/tls_pqibe.obj
+	@echo ... lib/ibe/tls_pqibe.i
+	@echo ... lib/ibe/tls_pqibe.s
+	@echo ... lib/tls_cacerts.obj
+	@echo ... lib/tls_cacerts.i
+	@echo ... lib/tls_cacerts.s
+	@echo ... lib/tls_cert_chain.obj
+	@echo ... lib/tls_cert_chain.i
+	@echo ... lib/tls_cert_chain.s
+	@echo ... lib/tls_client_cert.obj
+	@echo ... lib/tls_client_cert.i
+	@echo ... lib/tls_client_cert.s
+	@echo ... lib/tls_client_recv.obj
+	@echo ... lib/tls_client_recv.i
+	@echo ... lib/tls_client_recv.s
+	@echo ... lib/tls_client_send.obj
+	@echo ... lib/tls_client_send.i
+	@echo ... lib/tls_client_send.s
+	@echo ... lib/tls_keys_calc.obj
+	@echo ... lib/tls_keys_calc.i
+	@echo ... lib/tls_keys_calc.s
+	@echo ... lib/tls_logger.obj
+	@echo ... lib/tls_logger.i
+	@echo ... lib/tls_logger.s
+	@echo ... lib/tls_octads.obj
+	@echo ... lib/tls_octads.i
+	@echo ... lib/tls_octads.s
+	@echo ... lib/tls_protocol.obj
+	@echo ... lib/tls_protocol.i
+	@echo ... lib/tls_protocol.s
+	@echo ... lib/tls_sal.obj
+	@echo ... lib/tls_sal.i
+	@echo ... lib/tls_sal.s
+	@echo ... lib/tls_sockets.obj
+	@echo ... lib/tls_sockets.i
+	@echo ... lib/tls_sockets.s
+	@echo ... lib/tls_tickets.obj
+	@echo ... lib/tls_tickets.i
+	@echo ... lib/tls_tickets.s
+	@echo ... lib/tls_x509.obj
+	@echo ... lib/tls_x509.i
+	@echo ... lib/tls_x509.s
+	@echo ... src/client.obj
+	@echo ... src/client.i
+	@echo ... src/client.s
+.PHONY : help
+
+
+
+#=============================================================================
+# Special targets to cleanup operation of make.
+
+# Special rule to run CMake to check the build system integrity.
+# No rule that depends on this can have commands that come from listfiles
+# because they might be regenerated.
+cmake_check_build_system:
+	$(CMAKE_COMMAND) -S$(CMAKE_SOURCE_DIR) -B$(CMAKE_BINARY_DIR) --check-build-system CMakeFiles\Makefile.cmake 0
+.PHONY : cmake_check_build_system
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/OQS_TEST_results.txt b/TIIGER_TLS/PQ_TIIGER_TLS/OQS_TEST_results.txt
new file mode 100644
index 0000000..3cfe433
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/OQS_TEST_results.txt
@@ -0,0 +1,56 @@
+Test server https://test.openquantumsafe.org/
+Root CA in file tls_cacerts.cpp
+
+Tested on Ubuntu 22.04.3
+liboqs 0.9.2, oqs-provider 0.5.3
+1.3.2024
+
+KEM + CERT				PORT		STATUS
+
+dilithium2 + bikel1 			6087		- OK
+dilithium2 + frodo640aes		6088		- OK
+dilithium2 + frodo640shake 		6089		- OK
+dilithium2 + hqc128			6090		- KEX error (kex=-1)
+dilithium2 + kyber512 			6091		- OK
+
+dilithium3 + bikel3			6105		- OK
+dilithium3 + frodo976aes		6106		- OK
+dilithium3 + frodo976shake		6107		- OK
+dilithium3 + hqc192			6108		- KEX error (kex=-1)
+dilithium3 + kyber768			6109		- OK
+	
+dilithium5	bikel5			6121		- OK
+dilithium5	frodo1344aes		6122		- OK
+dilithium5	frodo1344shake		6123		- OK
+dilithium5	hqc256			6124		- KEX error (kex=-1)
+dilithium5	kyber1024		6125		- OK
+
+falcon1024	bikel5			6132		- Server Certificate sig is NOT OK
+falcon1024	frodo1344aes		6133		- Server Certificate sig is NOT OK
+falcon1024	frodo1344shake		6134		- Server Certificate sig is NOT OK
+falcon1024	hqc256			6135		- KEX error (kex=-1)
+falcon1024	kyber1024		6136		- Server Certificate sig is NOT OK
+	
+falcon512	bikel1			6143		- Server Certificate sig is NOT OK
+falcon512	frodo640aes		6144		- Server Certificate sig is NOT OK
+falcon512	frodo640shake		6145		- Server Certificate sig is NOT OK
+falcon512	hqc128			6146		- KEX error (kex=-1)
+falcon512	kyber512		6147		- Server Certificate sig is NOT OK
+
+sphincssha2128fsimple	bikel1		6161		- OK
+sphincssha2128fsimple	frodo640aes	6162		- OK
+sphincssha2128fsimple	frodo640shake	6163		- OK
+sphincssha2128fsimple	hqc128		6164		- KEX error (kex=-1)
+sphincssha2128fsimple	kyber512	6165		- OK
+
+sphincssha2128ssimple	bikel1		6179		- OK
+sphincssha2128ssimple	frodo640aes	6180		- OK
+sphincssha2128ssimple	frodo640shake	6181		- OK
+sphincssha2128ssimple	hqc128		6182		- KEX error (kex=-1)
+sphincssha2128ssimple	kyber512	6183		- OK
+
+sphincsshake128fsimple	bikel1		6213		- OK
+sphincsshake128fsimple	frodo640aes	6214		- OK
+sphincsshake128fsimple	frodo640shake	6215		- OK
+sphincsshake128fsimple	hqc128		6216		- KEX error (kex=-1)
+sphincsshake128fsimple	kyber512	6217		- OK
\ No newline at end of file
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/README.txt b/TIIGER_TLS/PQ_TIIGER_TLS/README.txt
new file mode 100644
index 0000000..6466b67
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/README.txt
@@ -0,0 +1,98 @@
+TLS 1.3 KLIENT S PODPOROU PRE PQ ALGORITMY
+Originalna verzia klienta od Michaela Scotta:
+https://github.com/Crypto-TII/TLS1.3
+
+Upravena verzia pre Windows platformu v ramci Diplomovej prace
+Bc. Jozef Å imko
+
+Navod na kompilaciu originalnej verzie:
+https://git.kemt.fei.tuke.sk/js331zc/MastersThesis/src/branch/master/TIIGER_TLS
+
+Prikazy na kompilaciu (Windows):
+cmake -G "MinGW Makefiles"
+mingw32-make
+
+Priklad pouzitia:
+./client.exe -r test.openquantumsafe.org:6109
+
+11.04.2024
+---------------------------
+- testovane s OpenSSL nativnym serverom s podporou pre PQ algoritmy
+(OpenSSL 3.3.0, liboqs 0.10.0, oqsprovider 0.5.3)
+
+
+29.02.2024
+---------------------------
+- vymazanie nadbytocnych suborov: blogy, wifi.h, arduino/client.cpp,
+nevyuzite .xpp subory
+- uprava CMakelistu:
+	- doplnenie prepinacov pre Windows platformu -lws2_32
+	- pridany prepinac pre linkovanie .cpp suborov s gcc prekladacom -lstdc++
+	- pridany prepinac pre linkovanie liboqs kniznice -loqs
+	- odstranenie nepotrebnych podmienok a funkcii
+
+tls_octads.h
+tls_sockets.h
+tls_logger.cpp
+tls_octads.cpp
+tls_sockets.cpp
+- odstranenie funkcii pre ARDUINO
+
+tls_sockets.h
+- pridana podpora pre Windows
+
+tls_x509.h
+- definovanie novych premennych pouzitych pre PQ algoritmy
+
+tls1_3.h
+- zmenene hodnoty vybranych premennych, prisposobene pre potreby vybranych PQ 
+algoritmov
+- pridanie ID pre nove PQ algoritmy
+
+tls_cacerts.cpp
+- pridany root CA pre lokalny openssl server
+- pridany root CA pre test server - https://test.openquantumsafe.org/
+
+tls_cert_chain.cpp
+- pridane funkcie na overenie podpisu vybranych PQ algoritmov
+
+tls_logger.cpp
+- doplnene vypisy pre PQ algoritmy
+
+tls_sal.cpp
+- pridana kniznica liboqs
+- modifikacia (pseudo)nahodneho generatora cisel - vymena miracl core funkcie za 
+liboqs funkciu
+- pridane funkcie pre generovanie sukromneho a verejneho kluca pre KEM
+protokoly
+- pridane funkcie na decapsulaciu pre KEM protokoly
+- pridane funkcii na overenie a podpis novymi PQ algoritmami
+
+tls_sockets.cpp
+- uprava funkcie setsockopt(), aby fungovala aj na Windows platforme
+
+tls_x509.cpp
+- pridane OID pre vybrane PQ algoritmy
+- pridane funkcie pre ziskanie verejneho a sukromneho kluca z PQ certifikatov
+
+TESTOVANIE
+Prostredie a nastroje:
+- testovane na Windows 10.0.22631 x64
+- cmake 3.28.2 , GNU Make 4.4.1 , gcc version 13.2.0 - sucast WinLibs 13.2.0
+- miracl core 4.1
+- liboqs 0.9.2
+
+Testy:
+- testovane s OpenSSL nativnym serverom s podporou pre PQ algoritmy
+(OpenSSL 3.2.1, oqsprovider 0.5.3)
+
+- testovane na test serveroch https://test.openquantumsafe.org/
+- vysledky testov v prilozenom subore OQS_TEST_results.txt
+
+
+
+
+
+
+
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/README_SCOTT.md b/TIIGER_TLS/PQ_TIIGER_TLS/README_SCOTT.md
new file mode 100644
index 0000000..80fef30
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/README_SCOTT.md
@@ -0,0 +1,253 @@
+# TIIGER TLS C++
+
+This C++ project implements a TLS1.3 client. There is also a Rust version available from this site. This C++ version is really just C plus namespaces plus pass-by-reference. These are the only features 
+of C++ that are used. Documentation can be found in the doxygen generated file doc/refman.pdf
+
+<img src="https://img.shields.io/badge/language-c++-blue.svg"/>
+<img src="https://img.shields.io/badge/platform-mac | linux | win | arduino-lightgrey.svg?style=flat"/>
+
+# Building
+
+The TLS library is designed to support crypto agility by allowing a mix of cryptographic providers. This functionality is provided by the SAL (Security Abstraction Layer). 
+Below are two examples to choose from. The SAL API documentation is provided in sal/sal.pdf, and guided by this it should be possible to create your own SAL.
+To build the client on an IoT node like the Arduino RP2040, see the readme file in the src/arduino directory.
+
+Private keys, server/client certificate chains, and CA root stores are all fixed in the code.
+
+Ideally keys, chains and key stores should be kept in external files, but in an IoT setting there may not be a file system. 
+In this C++ code the client private key and certificate (only required for client-side authentication) are stored in the source code file *tls_client_cert.cpp*. The root certificate store is 
+stored in the file *tls_cacert.cpp*.
+When using secure hardware, the client private key may not be embedded in the source code, rather it exists in secure on-board memory.
+
+The installation process requires the *cmake* utility to be installed. Copy all files and subdirectories from this directory to a working directory.
+
+## Miracl
+
+This build gets all of it cryptography from the MIRACL core library https://github.com/miracl/core/cpp
+
+	bash ./scripts/build.sh -1
+
+## Miracl + LibSodium
+
+To use a SAL which includes some functionality from the well known sodium crypto library https://libsodium.gitbook.io/doc/, install sodium, then
+
+	bash ./scripts/build.sh -2
+
+# Try it out
+
+After the build complete successfully, the example executable *client* and the TiigerTLS library *libtiitls.a* are generated in the build directory
+
+To see the Security Abstraction Layer (SAL) capabilities, navigate to the build directory
+	
+	./client -s
+
+To connect to a Website
+
+	./client swifttls.org
+
+The output should (if VERBOSITY has been set to IO\_DEBUG in *tls1_3.h*) look something like this
+
+	Hostname= swifttls.org
+	Private key= 0373AF7D060E0E80959254DC071A068FCBEDA5F0C1B6FFFC02C7EB56AE6B00CD
+	Client Public key= 93CDD4247C90CBC1920E53C4333BE444C0F13E96A077D8D1EF485FE0F9D9D703
+	Client Hello sent
+	Cipher Suite is TLS_AES_128_GCM_SHA256
+	Server HelloRetryRequest= 020000540303CF21AD74E59A6111BE1D8C021E65B891C2A211167ABB8C5E079E09E2C8A8339C20557742FB051C8ADC0A421E53E1B1B86268B4A1A6CC (truncated)
+	Client Hello re-sent
+	Server Hello= 020000970303268C697006F0AC66287680A88C6DB34C2804CD9884B2B0BD087A0F3DE2495F5120A0E658C6A5BB912768E0F844E81E4C3AD7497548DB (truncated)
+	Parsing serverHello
+	Cipher Suite is TLS_AES_128_GCM_SHA256
+	Key Exchange Group is SECP256R1
+	Server Public Key= 04F87B11F808F92B9D4DAE8AE83389257F04B3697181F3CD1479B7214E7D76B108B650A57494D15C5F673EDB05D1C6E05C49B161B7056173AF454257 (truncated)
+
+	Shared Secret= 99A5F3B6F8BE0938AB6D74A99E8FD42DEFD71F25445BD703F0D429DA6CC4AA12
+	Handshake Secret= 093388E25C3F8468DF3A0544683036CBACF5157874CE995C080807559834CBCA
+	Client handshake traffic secret= 5B383ED973C7324E267B16A1A7507C380846FFB5397B41E3199C305C23A2C430
+	Server handshake traffic secret= 71A23E7184F1AA8F228504D3FA735EC8E70FFEC54E0922D553A64800A32C2853
+	Warning - ALPN extension NOT acknowledged by server
+	Server Name NOT acknowledged
+	Max frag length request NOT acknowledged
+	Encrypted Extensions Processed
+	Certificate Chain Length= 2458
+	Parsing Server certificate
+	Signature is 0A5C155DB6DD9F7F6ABE005D351D6E3FF9DEBA799F7479BD33E1C784B63CB4CA695A76815C9B666C24B6E989EE85009A6E35D68B9E190ED6444248E4 (truncated)
+	RSA signature of length 2048
+	Public key= E2AB76AE1A676E3268E39BB9B8AE9CA19DD8BC0BFED0A4275E13C191D716794B48F47766A6B6AD17F19764F48D459E8271721BCAE2D0D2AB34706381 (truncated)
+	RSA public key of length 2048
+	Issuer is  R3/Let's Encrypt/
+	Subject is swifttls.org//
+	Parsing Intermediate certificate
+	Signature is D94CE0C9F584883731DBBB13E2B3FC8B6B62126C58B7497E3C02B7A81F2861EBCEE02E73EF49077A35841F1DAD68F0D8FE56812F6D7F58A66E353610 (truncated)
+	RSA signature of length 2048
+	Public key= BB021528CCF6A094D30F12EC8D5592C3F882F199A67A4288A75D26AAB52BB9C54CB1AF8E6BF975C8A3D70F4794145535578C9EA8A23919F5823C42A9 (truncated)
+	RSA public key of length 2048
+	Issuer is  DST Root CA X3/Digital Signature Trust Co./
+	Subject is R3/Let's Encrypt/
+	Signature  = 0A5C155DB6DD9F7F6ABE005D351D6E3FF9DEBA799F7479BD33E1C784B63CB4CA695A76815C9B666C24B6E989EE85009A6E35D68B9E190ED6444248E4 (truncated)
+	Public key = BB021528CCF6A094D30F12EC8D5592C3F882F199A67A4288A75D26AAB52BB9C54CB1AF8E6BF975C8A3D70F4794145535578C9EA8A23919F5823C42A9 (truncated)
+	Checking Signature on Cert
+	Signature Algorithm is RSA_PKCS1_SHA256
+	Cert Signature Verification succeeded
+	Intermediate Certificate Chain sig is OK
+
+	Public Key from root cert= DFAFE99750088357B4CC6265F69082ECC7D32C6B30CA5BECD9C37DC740C118148BE0E83376492AE33F214993AC4E0EAF3E48CB65EEFCD3210F65D22A (truncated)
+	Signature  = D94CE0C9F584883731DBBB13E2B3FC8B6B62126C58B7497E3C02B7A81F2861EBCEE02E73EF49077A35841F1DAD68F0D8FE56812F6D7F58A66E353610 (truncated)
+	Public key = DFAFE99750088357B4CC6265F69082ECC7D32C6B30CA5BECD9C37DC740C118148BE0E83376492AE33F214993AC4E0EAF3E48CB65EEFCD3210F65D22A (truncated)
+	Checking Signature on Cert
+	Signature Algorithm is RSA_PKCS1_SHA256
+	Cert Signature Verification succeeded
+	Root Certificate sig is OK
+	Certificate Chain is valid
+	Transcript Hash (CH+SH+EE+CT) = 7CECF69D794C20FB7551BA5C4B986E1F501011328225CDD740A8EB54B728E31B
+	Transcript Hash (CH+SH+EE+SCT+SCV) = 8EC0EE587717BAEB401992622E3F31CBE151CC6C489104E68B5A83E96284E1E7
+	Server Certificate Signature= B5B74CF6026CF16FA866BA7E7562C53F67A74949FF040319B0BD2149CF4EF97CAD482463F1746D202B1EE0FF0137A737FAD757FB606F809A949F95DC (truncated)
+	Signature Algorithm is RSA_PSS_RSAE_SHA256
+	Server Cert Verification OK
+
+	Server Data is verified
+	Transcript Hash (CH+SH+EE+SCT+SCV+SF+[CCT+CSV]) = 299C505CBD66E8CCCF1934AC5398EFAB7DCF239D9A9C95CF0A5384B5902E6A12
+	Client Verify Data= 9D20AD7C24238C5B77B72D40EC355C41C5859B6851639EA9920986EDF50DF032
+	Transcript Hash (CH+SH+EE+SCT+SCV+SF+[CCT+CSV]+CF) = 50AC5EA2A163FD5A3CE92D7D98E8CB56D763514148A30213784612F9B87C991B
+	Client application traffic secret= 7DE3D4B470FBCA72FEECBA1A1B938F4AF85F0E4D84C8E06E4218A92DF3EE67CF
+	Server application traffic secret= 11FFA6345BE788BBF8C1948E4F499D852A07A77B74C74F560BC9E399AB41ABC8
+	Full Handshake concluded
+	... after handshake resumption
+	Sending Application Message
+
+	GET / HTTP/1.1
+	Host: swifttls.org
+
+
+	Waiting for Server input
+	Got a ticket
+	Waiting for Server input
+	Receiving application data (truncated HTML) = 485454502F312E3120323030204F4B0D0A5365727665723A205377696674544C530D0A5374726963
+	Alert sent to Server - Close notify
+	Connection closed
+
+To attempt a fast resumption, based on a resumption ticket (generated and stored in a file cookie.txt), connect again
+
+	./client swifttls.org
+
+The output should look something like
+
+	Attempting resumption
+	Hostname= swifttls.org
+
+	Parsing Ticket
+	Ticket = 6CE7CD561F03F6E3CDD9A0DD4A7F37181861F51A17E8FF6930AAA02C6C5DAFD9
+	life time in minutes = 3600
+	Pre-Shared Key = 41301AAD7DAADCF43D700CD71E1198DD2C8DFF5C61B91BEA35116B96762C8B7E
+	max_early_data = 40960
+
+	PSK= 41301AAD7DAADCF43D700CD71E1198DD2C8DFF5C61B91BEA35116B96762C8B7E
+	Binder Key= 3CC796B38A7FEB226D9B0CD6B6BB4994253298DDF9FF43060C5C30834D75EE79
+	Early Secret= 610B9D95E512F6E199046C93E600D5CE10BB98517F9A81096E653C13B2D0F17D
+	Private key= 7373AF7D060E0E80959254DC071A06905E067B07367C49D86B48A10F3923CC49
+	Client Public key= 04EA04CDA74C1A1942BB8C56C0BD8AE1A4CB9D9B76B5AC64C24CFE7C367B46FA6F06037D945835019D3F1220803BE0A55ADAAAD2EABBDF69A6BA6EA4 (truncated)
+	Ticket age= feff
+	obfuscated age = 447e2e62
+	Client Hello sent
+	BND= 258FA2CE9D69253C83646641266B2A81FCEED47348D60E0C7BBB27D2557D1BD2
+	Sending Binders
+	Client Early Traffic Secret= CF7D980E8213205CFD35C2194FB75F6D1E98215860BB1F7FA5CFDC8DAE48E9F5
+	Sending some early data
+	Sending Application Message
+
+	GET / HTTP/1.1
+	Host: swifttls.org
+
+
+	Parsing serverHello
+	Cipher Suite is TLS_AES_128_GCM_SHA256
+	Key Exchange Group is SECP256R1
+	PSK Identity= 0
+	Server Public Key= 0401D908F018811AF140E2D417EB2713492C146C2B73F78A81DEC6C3F6E2A31D5114207D93EC92AEB03D64DAD11728AAE3A9764DF2473F8CBBB7476C (truncated)
+
+	serverHello= 0200009D0303268C69B38026464DFFE72A496662627EC35798DA3F98437042E39CAF404C888520557742FB051C8ADC0A421E53E1B1B86268B4A1A6CC (truncated)
+	Shared Secret= 8C7784C539C0144B8FADCBF065637418F190C49995E79660919E204F05287C2D
+	Handshake Secret= 4025A7EE2C1B634C9FC83FDF5CFB2FCB5498EA3F5D019EEDC6D3C1D751C87C47
+	Client handshake traffic secret= 5FC1307F4E7ED84B4196B83EA19D69724812C25A571061FB53B5B6E9FD7FCABE
+	Server handshake traffic secret= 1E84FEBA7F8D75F756408906C608925F9A6445292BA614BB398E634CF5854B2A
+	Early Data Accepted
+	Warning - ALPN extension NOT acknowledged by server
+	Server Name NOT acknowledged
+	Max frag length request NOT acknowledged
+	Transcript Hash (CH+SH+EE) = DCB73D7B5416D91546EF7D625FBB6A84105CCCE5F054D753275325A822D394E9
+	Send End of Early Data
+	Transcript Hash (CH+SH+EE+SF+ED) = FE1FADC8085B3B41A9146647FC9A40F6F2A303533B237112564A2F51F82B64C4
+	Server Data is verified
+	Client Verify Data= 350E968A15D36F16BC20D80789E9DB2792A2975765F9BE537407165F7E7366B8
+	Client application traffic secret= 536F912C98CF4C2D9672DEA57AC8136519607014EFEBBA289FCED97929EA9633
+	Server application traffic secret= 6B797DBC7FB2D9F75A877F1D34EE7CACC6D65C847C085331F8941C81F2884E83
+	Resumption Handshake concluded
+	Early data was accepted
+	Waiting for Server input
+	Receiving application data (truncated HTML) = 485454502F312E3120323030204F4B0D0A5365727665723A205377696674544C530D0A5374726963
+	Alert sent to Server - Close notify
+	Connection closed
+	
+Try it out on your favourite websites. It will abort if TLS1.3 is not supported. 
+In a small number of cases it will fail due to receiving a malformed certificate chain from the Server. It is not forgiving of badly 
+formed certificate chains, and makes no attempt to fix them.
+
+Also try
+
+	./client tls13.1d.pw
+	
+Try it a few times - it randomly asks for a HelloRetryRequest and a Key Update, testing this code (but it does not allow resumption). This site also requires that
+short records are not padded (that is PAD\_SHORT\_RECORDS is not defined in *tls1_3.h*).
+
+A resumption ticket can be deleted by
+
+	./client -r
+
+
+See doc/list.txt for some websites that work OK and test different functionality.
+
+## Client side Authentication
+
+A self-signed client certificate and private key can be generated by
+
+	openssl req -x509 -nodes -days 365 -newkey ec:<(openssl ecparam -name secp256r1) -keyout mykey.pem -out mycert.pem
+
+and inserted into the file *tls_client_cert.cpp*
+
+A way to test less common options is to set up a local openssl server. First generate a self-signed server certificate using something like
+
+	openssl req -x509 -nodes -newkey rsa:2048 -keyout key.pem -out cert.pem -days 365
+
+then for example
+
+	openssl s_server -tls1_3 -key key.pem -cert cert.pem -accept 4433 -www
+
+acts as a normal Website, while
+
+	openssl s_server -tls1_3 -verify 0 -key key.pem -cert cert.pem -accept 4433 -www
+
+looks for client side certificate authentication - and the server makes a Certificate Request to the client. We can't control the openssl
+debug output, but its better than nothing! The client connects to this local server via
+
+	./client localhost
+
+## Testing Pre-shared keys
+
+Again we will use OpenSSL to mimic a TLS1.3 server
+
+	openssl s_server -tls1_3 -cipher PSK-AES128-GCM-SHA256 -psk_identity 42 -psk 0102030405060708090a0b0c0d0e0f10 -nocert -accept 4433 -www
+
+and connect via
+
+	./client -p 42 localhost
+
+An important setting in *tls1_3.h* is CRYPTO\_SETTING. For the above tests is is assumed that this is set to the default TYPICAL, which allows 
+interaction with standard websites. However it may also be set to TINY\_ECC, POST\_QUANTUM and HYBRID. These last three support interaction 
+with our own rust server. This setting impacts code size and memory resource allocation. It also controls the type of the self-signed 
+certificate provided by the client if it is asked to authenticate.
+
+The client choice of key exchange algorithms, and their preferred ordering, is set in the sal (*tls_sal.cpp*). The chosen CRYPTO\_SETTING
+impacts on this ordering. With the default setting the X25519 elliptic curve is preferred.
+
+To test our IBE version of TLS, simply run the TiigerTLS rust server, and then
+
+	./client -i localhost
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/client.exe b/TIIGER_TLS/PQ_TIIGER_TLS/client.exe
new file mode 100644
index 0000000..b7bb9af
Binary files /dev/null and b/TIIGER_TLS/PQ_TIIGER_TLS/client.exe differ
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/cmake_install.cmake b/TIIGER_TLS/PQ_TIIGER_TLS/cmake_install.cmake
new file mode 100644
index 0000000..dba6ba7
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/cmake_install.cmake
@@ -0,0 +1,49 @@
+# Install script for directory: D:/DOKUMENTY/diplomovka-final/Scott-cpp-win
+
+# Set the install prefix
+if(NOT DEFINED CMAKE_INSTALL_PREFIX)
+  set(CMAKE_INSTALL_PREFIX "C:/Program Files (x86)/tiitls1.3")
+endif()
+string(REGEX REPLACE "/$" "" CMAKE_INSTALL_PREFIX "${CMAKE_INSTALL_PREFIX}")
+
+# Set the install configuration name.
+if(NOT DEFINED CMAKE_INSTALL_CONFIG_NAME)
+  if(BUILD_TYPE)
+    string(REGEX REPLACE "^[^A-Za-z0-9_]+" ""
+           CMAKE_INSTALL_CONFIG_NAME "${BUILD_TYPE}")
+  else()
+    set(CMAKE_INSTALL_CONFIG_NAME "")
+  endif()
+  message(STATUS "Install configuration: \"${CMAKE_INSTALL_CONFIG_NAME}\"")
+endif()
+
+# Set the component getting installed.
+if(NOT CMAKE_INSTALL_COMPONENT)
+  if(COMPONENT)
+    message(STATUS "Install component: \"${COMPONENT}\"")
+    set(CMAKE_INSTALL_COMPONENT "${COMPONENT}")
+  else()
+    set(CMAKE_INSTALL_COMPONENT)
+  endif()
+endif()
+
+# Is this installation the result of a crosscompile?
+if(NOT DEFINED CMAKE_CROSSCOMPILING)
+  set(CMAKE_CROSSCOMPILING "FALSE")
+endif()
+
+# Set default install directory permissions.
+if(NOT DEFINED CMAKE_OBJDUMP)
+  set(CMAKE_OBJDUMP "C:/mingw64/bin/objdump.exe")
+endif()
+
+if(CMAKE_INSTALL_COMPONENT)
+  set(CMAKE_INSTALL_MANIFEST "install_manifest_${CMAKE_INSTALL_COMPONENT}.txt")
+else()
+  set(CMAKE_INSTALL_MANIFEST "install_manifest.txt")
+endif()
+
+string(REPLACE ";" "\n" CMAKE_INSTALL_MANIFEST_CONTENT
+       "${CMAKE_INSTALL_MANIFEST_FILES}")
+file(WRITE "D:/DOKUMENTY/diplomovka-final/Scott-cpp-win/${CMAKE_INSTALL_MANIFEST}"
+     "${CMAKE_INSTALL_MANIFEST_CONTENT}")
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/cookie.txt b/TIIGER_TLS/PQ_TIIGER_TLS/cookie.txt
new file mode 100644
index 0000000..f6fe981
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/cookie.txt
@@ -0,0 +1,10 @@
+test.openquantumsafe.org
+0CFA9EC2D2A8EC2FEC3E5191755ED454696382A602CEBDB6B98CAEBAE8F9DA504886BBBBB9011E6727D69456674EEE1D7920B7D0C5AEB0F776FB33CA6FCCCE8496A02AB6C02F895E0ECB3CDA7E7BA1AC2788AE2CF38B5E9AF12220A4825EA8736159DC5B8D4EB618DDE5D5EFF67B04B8D91BE1341CD1674E9638D93012E6D80A61DBE75D904FB595BD5E295AFB121E0A8AC38F98420C618DC1414F4067441AF8EA949F3168BDBCF5150B3D00F43B880149E9CDF096735031E4BC883275D3764F0E762F97FAA9C3043749E4007370A28EE03DFD827248F3FE6B6FEF6A7076CB6A29CABADC760859C9505633A878CA93352EA684D1ACE0BC64D568B25716D694E9
+76BF0BFF6F94BC1F3DBBF63401B588A8AC39DFE5B54BFE441F0D3BD37DFFCE50
+1c159932
+0
+e12b1512
+12c
+1301
+247
+1
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/doc/Doxyfile b/TIIGER_TLS/PQ_TIIGER_TLS/doc/Doxyfile
new file mode 100644
index 0000000..9430d65
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/doc/Doxyfile
@@ -0,0 +1,2754 @@
+# Doxyfile 1.9.5
+
+# This file describes the settings to be used by the documentation system
+# doxygen (www.doxygen.org) for a project.
+#
+# All text after a double hash (##) is considered a comment and is placed in
+# front of the TAG it is preceding.
+#
+# All text after a single hash (#) is considered a comment and will be ignored.
+# The format is:
+# TAG = value [value, ...]
+# For lists, items can also be appended using:
+# TAG += value [value, ...]
+# Values that contain spaces should be placed between quotes (\" \").
+#
+# Note:
+#
+# Use doxygen to compare the used configuration file with the template
+# configuration file:
+# doxygen -x [configFile]
+# Use doxygen to compare the used configuration file with the template
+# configuration file without replacing the environment variables or CMake type
+# replacement variables:
+# doxygen -x_noenv [configFile]
+
+#---------------------------------------------------------------------------
+# Project related configuration options
+#---------------------------------------------------------------------------
+
+# This tag specifies the encoding used for all characters in the configuration
+# file that follow. The default is UTF-8 which is also the encoding used for all
+# text before the first occurrence of this tag. Doxygen uses libiconv (or the
+# iconv built into libc) for the transcoding. See
+# https://www.gnu.org/software/libiconv/ for the list of possible encodings.
+# The default value is: UTF-8.
+
+DOXYFILE_ENCODING      = UTF-8
+
+# The PROJECT_NAME tag is a single word (or a sequence of words surrounded by
+# double-quotes, unless you are using Doxywizard) that should identify the
+# project for which the documentation is generated. This name is used in the
+# title of most generated pages and in a few other places.
+# The default value is: My Project.
+
+PROJECT_NAME           = "TII TLS1.3"
+
+# The PROJECT_NUMBER tag can be used to enter a project or revision number. This
+# could be handy for archiving the generated documentation or if some version
+# control system is used.
+
+PROJECT_NUMBER         = 1.1
+
+# Using the PROJECT_BRIEF tag one can provide an optional one line description
+# for a project that appears at the top of each page and should give viewer a
+# quick idea about the purpose of the project. Keep the description short.
+
+PROJECT_BRIEF          = "TLS 1.3"
+
+# With the PROJECT_LOGO tag one can specify a logo or an icon that is included
+# in the documentation. The maximum height of the logo should not exceed 55
+# pixels and the maximum width should not exceed 200 pixels. Doxygen will copy
+# the logo to the output directory.
+
+PROJECT_LOGO           =
+
+# The OUTPUT_DIRECTORY tag is used to specify the (relative or absolute) path
+# into which the generated documentation will be written. If a relative path is
+# entered, it will be relative to the location where doxygen was started. If
+# left blank the current directory will be used.
+
+OUTPUT_DIRECTORY       =
+
+# If the CREATE_SUBDIRS tag is set to YES then doxygen will create up to 4096
+# sub-directories (in 2 levels) under the output directory of each output format
+# and will distribute the generated files over these directories. Enabling this
+# option can be useful when feeding doxygen a huge amount of source files, where
+# putting all generated files in the same directory would otherwise causes
+# performance problems for the file system. Adapt CREATE_SUBDIRS_LEVEL to
+# control the number of sub-directories.
+# The default value is: NO.
+
+CREATE_SUBDIRS         = NO
+
+# Controls the number of sub-directories that will be created when
+# CREATE_SUBDIRS tag is set to YES. Level 0 represents 16 directories, and every
+# level increment doubles the number of directories, resulting in 4096
+# directories at level 8 which is the default and also the maximum value. The
+# sub-directories are organized in 2 levels, the first level always has a fixed
+# numer of 16 directories.
+# Minimum value: 0, maximum value: 8, default value: 8.
+# This tag requires that the tag CREATE_SUBDIRS is set to YES.
+
+CREATE_SUBDIRS_LEVEL   = 8
+
+# If the ALLOW_UNICODE_NAMES tag is set to YES, doxygen will allow non-ASCII
+# characters to appear in the names of generated files. If set to NO, non-ASCII
+# characters will be escaped, for example _xE3_x81_x84 will be used for Unicode
+# U+3044.
+# The default value is: NO.
+
+ALLOW_UNICODE_NAMES    = NO
+
+# The OUTPUT_LANGUAGE tag is used to specify the language in which all
+# documentation generated by doxygen is written. Doxygen will use this
+# information to generate all constant output in the proper language.
+# Possible values are: Afrikaans, Arabic, Armenian, Brazilian, Bulgarian,
+# Catalan, Chinese, Chinese-Traditional, Croatian, Czech, Danish, Dutch, English
+# (United States), Esperanto, Farsi (Persian), Finnish, French, German, Greek,
+# Hindi, Hungarian, Indonesian, Italian, Japanese, Japanese-en (Japanese with
+# English messages), Korean, Korean-en (Korean with English messages), Latvian,
+# Lithuanian, Macedonian, Norwegian, Persian (Farsi), Polish, Portuguese,
+# Romanian, Russian, Serbian, Serbian-Cyrillic, Slovak, Slovene, Spanish,
+# Swedish, Turkish, Ukrainian and Vietnamese.
+# The default value is: English.
+
+OUTPUT_LANGUAGE        = English
+
+# If the BRIEF_MEMBER_DESC tag is set to YES, doxygen will include brief member
+# descriptions after the members that are listed in the file and class
+# documentation (similar to Javadoc). Set to NO to disable this.
+# The default value is: YES.
+
+BRIEF_MEMBER_DESC      = YES
+
+# If the REPEAT_BRIEF tag is set to YES, doxygen will prepend the brief
+# description of a member or function before the detailed description
+#
+# Note: If both HIDE_UNDOC_MEMBERS and BRIEF_MEMBER_DESC are set to NO, the
+# brief descriptions will be completely suppressed.
+# The default value is: YES.
+
+REPEAT_BRIEF           = YES
+
+# This tag implements a quasi-intelligent brief description abbreviator that is
+# used to form the text in various listings. Each string in this list, if found
+# as the leading text of the brief description, will be stripped from the text
+# and the result, after processing the whole list, is used as the annotated
+# text. Otherwise, the brief description is used as-is. If left blank, the
+# following values are used ($name is automatically replaced with the name of
+# the entity):The $name class, The $name widget, The $name file, is, provides,
+# specifies, contains, represents, a, an and the.
+
+ABBREVIATE_BRIEF       =
+
+# If the ALWAYS_DETAILED_SEC and REPEAT_BRIEF tags are both set to YES then
+# doxygen will generate a detailed section even if there is only a brief
+# description.
+# The default value is: NO.
+
+ALWAYS_DETAILED_SEC    = NO
+
+# If the INLINE_INHERITED_MEMB tag is set to YES, doxygen will show all
+# inherited members of a class in the documentation of that class as if those
+# members were ordinary class members. Constructors, destructors and assignment
+# operators of the base classes will not be shown.
+# The default value is: NO.
+
+INLINE_INHERITED_MEMB  = NO
+
+# If the FULL_PATH_NAMES tag is set to YES, doxygen will prepend the full path
+# before files name in the file list and in the header files. If set to NO the
+# shortest path that makes the file name unique will be used
+# The default value is: YES.
+
+FULL_PATH_NAMES        = NO
+
+# The STRIP_FROM_PATH tag can be used to strip a user-defined part of the path.
+# Stripping is only done if one of the specified strings matches the left-hand
+# part of the path. The tag can be used to show relative paths in the file list.
+# If left blank the directory from which doxygen is run is used as the path to
+# strip.
+#
+# Note that you can specify absolute paths here, but also relative paths, which
+# will be relative from the directory where doxygen is started.
+# This tag requires that the tag FULL_PATH_NAMES is set to YES.
+
+STRIP_FROM_PATH        =
+
+# The STRIP_FROM_INC_PATH tag can be used to strip a user-defined part of the
+# path mentioned in the documentation of a class, which tells the reader which
+# header file to include in order to use a class. If left blank only the name of
+# the header file containing the class definition is used. Otherwise one should
+# specify the list of include paths that are normally passed to the compiler
+# using the -I flag.
+
+STRIP_FROM_INC_PATH    =
+
+# If the SHORT_NAMES tag is set to YES, doxygen will generate much shorter (but
+# less readable) file names. This can be useful is your file systems doesn't
+# support long names like on DOS, Mac, or CD-ROM.
+# The default value is: NO.
+
+SHORT_NAMES            = NO
+
+# If the JAVADOC_AUTOBRIEF tag is set to YES then doxygen will interpret the
+# first line (until the first dot) of a Javadoc-style comment as the brief
+# description. If set to NO, the Javadoc-style will behave just like regular Qt-
+# style comments (thus requiring an explicit @brief command for a brief
+# description.)
+# The default value is: NO.
+
+JAVADOC_AUTOBRIEF      = NO
+
+# If the JAVADOC_BANNER tag is set to YES then doxygen will interpret a line
+# such as
+# /***************
+# as being the beginning of a Javadoc-style comment "banner". If set to NO, the
+# Javadoc-style will behave just like regular comments and it will not be
+# interpreted by doxygen.
+# The default value is: NO.
+
+JAVADOC_BANNER         = NO
+
+# If the QT_AUTOBRIEF tag is set to YES then doxygen will interpret the first
+# line (until the first dot) of a Qt-style comment as the brief description. If
+# set to NO, the Qt-style will behave just like regular Qt-style comments (thus
+# requiring an explicit \brief command for a brief description.)
+# The default value is: NO.
+
+QT_AUTOBRIEF           = NO
+
+# The MULTILINE_CPP_IS_BRIEF tag can be set to YES to make doxygen treat a
+# multi-line C++ special comment block (i.e. a block of //! or /// comments) as
+# a brief description. This used to be the default behavior. The new default is
+# to treat a multi-line C++ comment block as a detailed description. Set this
+# tag to YES if you prefer the old behavior instead.
+#
+# Note that setting this tag to YES also means that rational rose comments are
+# not recognized any more.
+# The default value is: NO.
+
+MULTILINE_CPP_IS_BRIEF = NO
+
+# By default Python docstrings are displayed as preformatted text and doxygen's
+# special commands cannot be used. By setting PYTHON_DOCSTRING to NO the
+# doxygen's special commands can be used and the contents of the docstring
+# documentation blocks is shown as doxygen documentation.
+# The default value is: YES.
+
+PYTHON_DOCSTRING       = YES
+
+# If the INHERIT_DOCS tag is set to YES then an undocumented member inherits the
+# documentation from any documented member that it re-implements.
+# The default value is: YES.
+
+INHERIT_DOCS           = YES
+
+# If the SEPARATE_MEMBER_PAGES tag is set to YES then doxygen will produce a new
+# page for each member. If set to NO, the documentation of a member will be part
+# of the file/class/namespace that contains it.
+# The default value is: NO.
+
+SEPARATE_MEMBER_PAGES  = NO
+
+# The TAB_SIZE tag can be used to set the number of spaces in a tab. Doxygen
+# uses this value to replace tabs by spaces in code fragments.
+# Minimum value: 1, maximum value: 16, default value: 4.
+
+TAB_SIZE               = 4
+
+# This tag can be used to specify a number of aliases that act as commands in
+# the documentation. An alias has the form:
+# name=value
+# For example adding
+# "sideeffect=@par Side Effects:^^"
+# will allow you to put the command \sideeffect (or @sideeffect) in the
+# documentation, which will result in a user-defined paragraph with heading
+# "Side Effects:". Note that you cannot put \n's in the value part of an alias
+# to insert newlines (in the resulting output). You can put ^^ in the value part
+# of an alias to insert a newline as if a physical newline was in the original
+# file. When you need a literal { or } or , in the value part of an alias you
+# have to escape them by means of a backslash (\), this can lead to conflicts
+# with the commands \{ and \} for these it is advised to use the version @{ and
+# @} or use a double escape (\\{ and \\})
+
+ALIASES                =
+
+# Set the OPTIMIZE_OUTPUT_FOR_C tag to YES if your project consists of C sources
+# only. Doxygen will then generate output that is more tailored for C. For
+# instance, some of the names that are used will be different. The list of all
+# members will be omitted, etc.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_FOR_C  = YES
+
+# Set the OPTIMIZE_OUTPUT_JAVA tag to YES if your project consists of Java or
+# Python sources only. Doxygen will then generate output that is more tailored
+# for that language. For instance, namespaces will be presented as packages,
+# qualified scopes will look different, etc.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_JAVA   = NO
+
+# Set the OPTIMIZE_FOR_FORTRAN tag to YES if your project consists of Fortran
+# sources. Doxygen will then generate output that is tailored for Fortran.
+# The default value is: NO.
+
+OPTIMIZE_FOR_FORTRAN   = NO
+
+# Set the OPTIMIZE_OUTPUT_VHDL tag to YES if your project consists of VHDL
+# sources. Doxygen will then generate output that is tailored for VHDL.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_VHDL   = NO
+
+# Set the OPTIMIZE_OUTPUT_SLICE tag to YES if your project consists of Slice
+# sources only. Doxygen will then generate output that is more tailored for that
+# language. For instance, namespaces will be presented as modules, types will be
+# separated into more groups, etc.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_SLICE  = NO
+
+# Doxygen selects the parser to use depending on the extension of the files it
+# parses. With this tag you can assign which parser to use for a given
+# extension. Doxygen has a built-in mapping, but you can override or extend it
+# using this tag. The format is ext=language, where ext is a file extension, and
+# language is one of the parsers supported by doxygen: IDL, Java, JavaScript,
+# Csharp (C#), C, C++, Lex, D, PHP, md (Markdown), Objective-C, Python, Slice,
+# VHDL, Fortran (fixed format Fortran: FortranFixed, free formatted Fortran:
+# FortranFree, unknown formatted Fortran: Fortran. In the later case the parser
+# tries to guess whether the code is fixed or free formatted code, this is the
+# default for Fortran type files). For instance to make doxygen treat .inc files
+# as Fortran files (default is PHP), and .f files as C (default is Fortran),
+# use: inc=Fortran f=C.
+#
+# Note: For files without extension you can use no_extension as a placeholder.
+#
+# Note that for custom extensions you also need to set FILE_PATTERNS otherwise
+# the files are not read by doxygen. When specifying no_extension you should add
+# * to the FILE_PATTERNS.
+#
+# Note see also the list of default file extension mappings.
+
+EXTENSION_MAPPING      =
+
+# If the MARKDOWN_SUPPORT tag is enabled then doxygen pre-processes all comments
+# according to the Markdown format, which allows for more readable
+# documentation. See https://daringfireball.net/projects/markdown/ for details.
+# The output of markdown processing is further processed by doxygen, so you can
+# mix doxygen, HTML, and XML commands with Markdown formatting. Disable only in
+# case of backward compatibilities issues.
+# The default value is: YES.
+
+MARKDOWN_SUPPORT       = YES
+
+# When the TOC_INCLUDE_HEADINGS tag is set to a non-zero value, all headings up
+# to that level are automatically included in the table of contents, even if
+# they do not have an id attribute.
+# Note: This feature currently applies only to Markdown headings.
+# Minimum value: 0, maximum value: 99, default value: 5.
+# This tag requires that the tag MARKDOWN_SUPPORT is set to YES.
+
+TOC_INCLUDE_HEADINGS   = 5
+
+# When enabled doxygen tries to link words that correspond to documented
+# classes, or namespaces to their corresponding documentation. Such a link can
+# be prevented in individual cases by putting a % sign in front of the word or
+# globally by setting AUTOLINK_SUPPORT to NO.
+# The default value is: YES.
+
+AUTOLINK_SUPPORT       = YES
+
+# If you use STL classes (i.e. std::string, std::vector, etc.) but do not want
+# to include (a tag file for) the STL sources as input, then you should set this
+# tag to YES in order to let doxygen match functions declarations and
+# definitions whose arguments contain STL classes (e.g. func(std::string);
+# versus func(std::string) {}). This also make the inheritance and collaboration
+# diagrams that involve STL classes more complete and accurate.
+# The default value is: NO.
+
+BUILTIN_STL_SUPPORT    = NO
+
+# If you use Microsoft's C++/CLI language, you should set this option to YES to
+# enable parsing support.
+# The default value is: NO.
+
+CPP_CLI_SUPPORT        = NO
+
+# Set the SIP_SUPPORT tag to YES if your project consists of sip (see:
+# https://www.riverbankcomputing.com/software/sip/intro) sources only. Doxygen
+# will parse them like normal C++ but will assume all classes use public instead
+# of private inheritance when no explicit protection keyword is present.
+# The default value is: NO.
+
+SIP_SUPPORT            = NO
+
+# For Microsoft's IDL there are propget and propput attributes to indicate
+# getter and setter methods for a property. Setting this option to YES will make
+# doxygen to replace the get and set methods by a property in the documentation.
+# This will only work if the methods are indeed getting or setting a simple
+# type. If this is not the case, or you want to show the methods anyway, you
+# should set this option to NO.
+# The default value is: YES.
+
+IDL_PROPERTY_SUPPORT   = YES
+
+# If member grouping is used in the documentation and the DISTRIBUTE_GROUP_DOC
+# tag is set to YES then doxygen will reuse the documentation of the first
+# member in the group (if any) for the other members of the group. By default
+# all members of a group must be documented explicitly.
+# The default value is: NO.
+
+DISTRIBUTE_GROUP_DOC   = NO
+
+# If one adds a struct or class to a group and this option is enabled, then also
+# any nested class or struct is added to the same group. By default this option
+# is disabled and one has to add nested compounds explicitly via \ingroup.
+# The default value is: NO.
+
+GROUP_NESTED_COMPOUNDS = NO
+
+# Set the SUBGROUPING tag to YES to allow class member groups of the same type
+# (for instance a group of public functions) to be put as a subgroup of that
+# type (e.g. under the Public Functions section). Set it to NO to prevent
+# subgrouping. Alternatively, this can be done per class using the
+# \nosubgrouping command.
+# The default value is: YES.
+
+SUBGROUPING            = YES
+
+# When the INLINE_GROUPED_CLASSES tag is set to YES, classes, structs and unions
+# are shown inside the group in which they are included (e.g. using \ingroup)
+# instead of on a separate page (for HTML and Man pages) or section (for LaTeX
+# and RTF).
+#
+# Note that this feature does not work in combination with
+# SEPARATE_MEMBER_PAGES.
+# The default value is: NO.
+
+INLINE_GROUPED_CLASSES = NO
+
+# When the INLINE_SIMPLE_STRUCTS tag is set to YES, structs, classes, and unions
+# with only public data fields or simple typedef fields will be shown inline in
+# the documentation of the scope in which they are defined (i.e. file,
+# namespace, or group documentation), provided this scope is documented. If set
+# to NO, structs, classes, and unions are shown on a separate page (for HTML and
+# Man pages) or section (for LaTeX and RTF).
+# The default value is: NO.
+
+INLINE_SIMPLE_STRUCTS  = NO
+
+# When TYPEDEF_HIDES_STRUCT tag is enabled, a typedef of a struct, union, or
+# enum is documented as struct, union, or enum with the name of the typedef. So
+# typedef struct TypeS {} TypeT, will appear in the documentation as a struct
+# with name TypeT. When disabled the typedef will appear as a member of a file,
+# namespace, or class. And the struct will be named TypeS. This can typically be
+# useful for C code in case the coding convention dictates that all compound
+# types are typedef'ed and only the typedef is referenced, never the tag name.
+# The default value is: NO.
+
+TYPEDEF_HIDES_STRUCT   = NO
+
+# The size of the symbol lookup cache can be set using LOOKUP_CACHE_SIZE. This
+# cache is used to resolve symbols given their name and scope. Since this can be
+# an expensive process and often the same symbol appears multiple times in the
+# code, doxygen keeps a cache of pre-resolved symbols. If the cache is too small
+# doxygen will become slower. If the cache is too large, memory is wasted. The
+# cache size is given by this formula: 2^(16+LOOKUP_CACHE_SIZE). The valid range
+# is 0..9, the default is 0, corresponding to a cache size of 2^16=65536
+# symbols. At the end of a run doxygen will report the cache usage and suggest
+# the optimal cache size from a speed point of view.
+# Minimum value: 0, maximum value: 9, default value: 0.
+
+LOOKUP_CACHE_SIZE      = 0
+
+# The NUM_PROC_THREADS specifies the number of threads doxygen is allowed to use
+# during processing. When set to 0 doxygen will based this on the number of
+# cores available in the system. You can set it explicitly to a value larger
+# than 0 to get more control over the balance between CPU load and processing
+# speed. At this moment only the input processing can be done using multiple
+# threads. Since this is still an experimental feature the default is set to 1,
+# which effectively disables parallel processing. Please report any issues you
+# encounter. Generating dot graphs in parallel is controlled by the
+# DOT_NUM_THREADS setting.
+# Minimum value: 0, maximum value: 32, default value: 1.
+
+NUM_PROC_THREADS       = 1
+
+#---------------------------------------------------------------------------
+# Build related configuration options
+#---------------------------------------------------------------------------
+
+# If the EXTRACT_ALL tag is set to YES, doxygen will assume all entities in
+# documentation are documented, even if no documentation was available. Private
+# class members and static file members will be hidden unless the
+# EXTRACT_PRIVATE respectively EXTRACT_STATIC tags are set to YES.
+# Note: This will also disable the warnings about undocumented members that are
+# normally produced when WARNINGS is set to YES.
+# The default value is: NO.
+
+EXTRACT_ALL            = NO
+
+# If the EXTRACT_PRIVATE tag is set to YES, all private members of a class will
+# be included in the documentation.
+# The default value is: NO.
+
+EXTRACT_PRIVATE        = NO
+
+# If the EXTRACT_PRIV_VIRTUAL tag is set to YES, documented private virtual
+# methods of a class will be included in the documentation.
+# The default value is: NO.
+
+EXTRACT_PRIV_VIRTUAL   = NO
+
+# If the EXTRACT_PACKAGE tag is set to YES, all members with package or internal
+# scope will be included in the documentation.
+# The default value is: NO.
+
+EXTRACT_PACKAGE        = NO
+
+# If the EXTRACT_STATIC tag is set to YES, all static members of a file will be
+# included in the documentation.
+# The default value is: NO.
+
+EXTRACT_STATIC         = NO
+
+# If the EXTRACT_LOCAL_CLASSES tag is set to YES, classes (and structs) defined
+# locally in source files will be included in the documentation. If set to NO,
+# only classes defined in header files are included. Does not have any effect
+# for Java sources.
+# The default value is: YES.
+
+EXTRACT_LOCAL_CLASSES  = YES
+
+# This flag is only useful for Objective-C code. If set to YES, local methods,
+# which are defined in the implementation section but not in the interface are
+# included in the documentation. If set to NO, only methods in the interface are
+# included.
+# The default value is: NO.
+
+EXTRACT_LOCAL_METHODS  = NO
+
+# If this flag is set to YES, the members of anonymous namespaces will be
+# extracted and appear in the documentation as a namespace called
+# 'anonymous_namespace{file}', where file will be replaced with the base name of
+# the file that contains the anonymous namespace. By default anonymous namespace
+# are hidden.
+# The default value is: NO.
+
+EXTRACT_ANON_NSPACES   = NO
+
+# If this flag is set to YES, the name of an unnamed parameter in a declaration
+# will be determined by the corresponding definition. By default unnamed
+# parameters remain unnamed in the output.
+# The default value is: YES.
+
+RESOLVE_UNNAMED_PARAMS = YES
+
+# If the HIDE_UNDOC_MEMBERS tag is set to YES, doxygen will hide all
+# undocumented members inside documented classes or files. If set to NO these
+# members will be included in the various overviews, but no documentation
+# section is generated. This option has no effect if EXTRACT_ALL is enabled.
+# The default value is: NO.
+
+HIDE_UNDOC_MEMBERS     = NO
+
+# If the HIDE_UNDOC_CLASSES tag is set to YES, doxygen will hide all
+# undocumented classes that are normally visible in the class hierarchy. If set
+# to NO, these classes will be included in the various overviews. This option
+# has no effect if EXTRACT_ALL is enabled.
+# The default value is: NO.
+
+HIDE_UNDOC_CLASSES     = NO
+
+# If the HIDE_FRIEND_COMPOUNDS tag is set to YES, doxygen will hide all friend
+# declarations. If set to NO, these declarations will be included in the
+# documentation.
+# The default value is: NO.
+
+HIDE_FRIEND_COMPOUNDS  = NO
+
+# If the HIDE_IN_BODY_DOCS tag is set to YES, doxygen will hide any
+# documentation blocks found inside the body of a function. If set to NO, these
+# blocks will be appended to the function's detailed documentation block.
+# The default value is: NO.
+
+HIDE_IN_BODY_DOCS      = NO
+
+# The INTERNAL_DOCS tag determines if documentation that is typed after a
+# \internal command is included. If the tag is set to NO then the documentation
+# will be excluded. Set it to YES to include the internal documentation.
+# The default value is: NO.
+
+INTERNAL_DOCS          = NO
+
+# With the correct setting of option CASE_SENSE_NAMES doxygen will better be
+# able to match the capabilities of the underlying filesystem. In case the
+# filesystem is case sensitive (i.e. it supports files in the same directory
+# whose names only differ in casing), the option must be set to YES to properly
+# deal with such files in case they appear in the input. For filesystems that
+# are not case sensitive the option should be set to NO to properly deal with
+# output files written for symbols that only differ in casing, such as for two
+# classes, one named CLASS and the other named Class, and to also support
+# references to files without having to specify the exact matching casing. On
+# Windows (including Cygwin) and MacOS, users should typically set this option
+# to NO, whereas on Linux or other Unix flavors it should typically be set to
+# YES.
+# Possible values are: SYSTEM, NO and YES.
+# The default value is: SYSTEM.
+
+CASE_SENSE_NAMES       = NO
+
+# If the HIDE_SCOPE_NAMES tag is set to NO then doxygen will show members with
+# their full class and namespace scopes in the documentation. If set to YES, the
+# scope will be hidden.
+# The default value is: NO.
+
+HIDE_SCOPE_NAMES       = NO
+
+# If the HIDE_COMPOUND_REFERENCE tag is set to NO (default) then doxygen will
+# append additional text to a page's title, such as Class Reference. If set to
+# YES the compound reference will be hidden.
+# The default value is: NO.
+
+HIDE_COMPOUND_REFERENCE= NO
+
+# If the SHOW_HEADERFILE tag is set to YES then the documentation for a class
+# will show which file needs to be included to use the class.
+# The default value is: YES.
+
+SHOW_HEADERFILE        = YES
+
+# If the SHOW_INCLUDE_FILES tag is set to YES then doxygen will put a list of
+# the files that are included by a file in the documentation of that file.
+# The default value is: YES.
+
+SHOW_INCLUDE_FILES     = YES
+
+# If the SHOW_GROUPED_MEMB_INC tag is set to YES then Doxygen will add for each
+# grouped member an include statement to the documentation, telling the reader
+# which file to include in order to use the member.
+# The default value is: NO.
+
+SHOW_GROUPED_MEMB_INC  = NO
+
+# If the FORCE_LOCAL_INCLUDES tag is set to YES then doxygen will list include
+# files with double quotes in the documentation rather than with sharp brackets.
+# The default value is: NO.
+
+FORCE_LOCAL_INCLUDES   = NO
+
+# If the INLINE_INFO tag is set to YES then a tag [inline] is inserted in the
+# documentation for inline members.
+# The default value is: YES.
+
+INLINE_INFO            = YES
+
+# If the SORT_MEMBER_DOCS tag is set to YES then doxygen will sort the
+# (detailed) documentation of file and class members alphabetically by member
+# name. If set to NO, the members will appear in declaration order.
+# The default value is: YES.
+
+SORT_MEMBER_DOCS       = NO
+
+# If the SORT_BRIEF_DOCS tag is set to YES then doxygen will sort the brief
+# descriptions of file, namespace and class members alphabetically by member
+# name. If set to NO, the members will appear in declaration order. Note that
+# this will also influence the order of the classes in the class list.
+# The default value is: NO.
+
+SORT_BRIEF_DOCS        = NO
+
+# If the SORT_MEMBERS_CTORS_1ST tag is set to YES then doxygen will sort the
+# (brief and detailed) documentation of class members so that constructors and
+# destructors are listed first. If set to NO the constructors will appear in the
+# respective orders defined by SORT_BRIEF_DOCS and SORT_MEMBER_DOCS.
+# Note: If SORT_BRIEF_DOCS is set to NO this option is ignored for sorting brief
+# member documentation.
+# Note: If SORT_MEMBER_DOCS is set to NO this option is ignored for sorting
+# detailed member documentation.
+# The default value is: NO.
+
+SORT_MEMBERS_CTORS_1ST = NO
+
+# If the SORT_GROUP_NAMES tag is set to YES then doxygen will sort the hierarchy
+# of group names into alphabetical order. If set to NO the group names will
+# appear in their defined order.
+# The default value is: NO.
+
+SORT_GROUP_NAMES       = NO
+
+# If the SORT_BY_SCOPE_NAME tag is set to YES, the class list will be sorted by
+# fully-qualified names, including namespaces. If set to NO, the class list will
+# be sorted only by class name, not including the namespace part.
+# Note: This option is not very useful if HIDE_SCOPE_NAMES is set to YES.
+# Note: This option applies only to the class list, not to the alphabetical
+# list.
+# The default value is: NO.
+
+SORT_BY_SCOPE_NAME     = NO
+
+# If the STRICT_PROTO_MATCHING option is enabled and doxygen fails to do proper
+# type resolution of all parameters of a function it will reject a match between
+# the prototype and the implementation of a member function even if there is
+# only one candidate or it is obvious which candidate to choose by doing a
+# simple string match. By disabling STRICT_PROTO_MATCHING doxygen will still
+# accept a match between prototype and implementation in such cases.
+# The default value is: NO.
+
+STRICT_PROTO_MATCHING  = NO
+
+# The GENERATE_TODOLIST tag can be used to enable (YES) or disable (NO) the todo
+# list. This list is created by putting \todo commands in the documentation.
+# The default value is: YES.
+
+GENERATE_TODOLIST      = YES
+
+# The GENERATE_TESTLIST tag can be used to enable (YES) or disable (NO) the test
+# list. This list is created by putting \test commands in the documentation.
+# The default value is: YES.
+
+GENERATE_TESTLIST      = YES
+
+# The GENERATE_BUGLIST tag can be used to enable (YES) or disable (NO) the bug
+# list. This list is created by putting \bug commands in the documentation.
+# The default value is: YES.
+
+GENERATE_BUGLIST       = YES
+
+# The GENERATE_DEPRECATEDLIST tag can be used to enable (YES) or disable (NO)
+# the deprecated list. This list is created by putting \deprecated commands in
+# the documentation.
+# The default value is: YES.
+
+GENERATE_DEPRECATEDLIST= YES
+
+# The ENABLED_SECTIONS tag can be used to enable conditional documentation
+# sections, marked by \if <section_label> ... \endif and \cond <section_label>
+# ... \endcond blocks.
+
+ENABLED_SECTIONS       =
+
+# The MAX_INITIALIZER_LINES tag determines the maximum number of lines that the
+# initial value of a variable or macro / define can have for it to appear in the
+# documentation. If the initializer consists of more lines than specified here
+# it will be hidden. Use a value of 0 to hide initializers completely. The
+# appearance of the value of individual variables and macros / defines can be
+# controlled using \showinitializer or \hideinitializer command in the
+# documentation regardless of this setting.
+# Minimum value: 0, maximum value: 10000, default value: 30.
+
+MAX_INITIALIZER_LINES  = 30
+
+# Set the SHOW_USED_FILES tag to NO to disable the list of files generated at
+# the bottom of the documentation of classes and structs. If set to YES, the
+# list will mention the files that were used to generate the documentation.
+# The default value is: YES.
+
+SHOW_USED_FILES        = YES
+
+# Set the SHOW_FILES tag to NO to disable the generation of the Files page. This
+# will remove the Files entry from the Quick Index and from the Folder Tree View
+# (if specified).
+# The default value is: YES.
+
+SHOW_FILES             = YES
+
+# Set the SHOW_NAMESPACES tag to NO to disable the generation of the Namespaces
+# page. This will remove the Namespaces entry from the Quick Index and from the
+# Folder Tree View (if specified).
+# The default value is: YES.
+
+SHOW_NAMESPACES        = YES
+
+# The FILE_VERSION_FILTER tag can be used to specify a program or script that
+# doxygen should invoke to get the current version for each file (typically from
+# the version control system). Doxygen will invoke the program by executing (via
+# popen()) the command command input-file, where command is the value of the
+# FILE_VERSION_FILTER tag, and input-file is the name of an input file provided
+# by doxygen. Whatever the program writes to standard output is used as the file
+# version. For an example see the documentation.
+
+FILE_VERSION_FILTER    =
+
+# The LAYOUT_FILE tag can be used to specify a layout file which will be parsed
+# by doxygen. The layout file controls the global structure of the generated
+# output files in an output format independent way. To create the layout file
+# that represents doxygen's defaults, run doxygen with the -l option. You can
+# optionally specify a file name after the option, if omitted DoxygenLayout.xml
+# will be used as the name of the layout file. See also section "Changing the
+# layout of pages" for information.
+#
+# Note that if you run doxygen from a directory containing a file called
+# DoxygenLayout.xml, doxygen will parse it automatically even if the LAYOUT_FILE
+# tag is left empty.
+
+LAYOUT_FILE            =
+
+# The CITE_BIB_FILES tag can be used to specify one or more bib files containing
+# the reference definitions. This must be a list of .bib files. The .bib
+# extension is automatically appended if omitted. This requires the bibtex tool
+# to be installed. See also https://en.wikipedia.org/wiki/BibTeX for more info.
+# For LaTeX the style of the bibliography can be controlled using
+# LATEX_BIB_STYLE. To use this feature you need bibtex and perl available in the
+# search path. See also \cite for info how to create references.
+
+CITE_BIB_FILES         =
+
+#---------------------------------------------------------------------------
+# Configuration options related to warning and progress messages
+#---------------------------------------------------------------------------
+
+# The QUIET tag can be used to turn on/off the messages that are generated to
+# standard output by doxygen. If QUIET is set to YES this implies that the
+# messages are off.
+# The default value is: NO.
+
+QUIET                  = NO
+
+# The WARNINGS tag can be used to turn on/off the warning messages that are
+# generated to standard error (stderr) by doxygen. If WARNINGS is set to YES
+# this implies that the warnings are on.
+#
+# Tip: Turn warnings on while writing the documentation.
+# The default value is: YES.
+
+WARNINGS               = YES
+
+# If the WARN_IF_UNDOCUMENTED tag is set to YES then doxygen will generate
+# warnings for undocumented members. If EXTRACT_ALL is set to YES then this flag
+# will automatically be disabled.
+# The default value is: YES.
+
+WARN_IF_UNDOCUMENTED   = YES
+
+# If the WARN_IF_DOC_ERROR tag is set to YES, doxygen will generate warnings for
+# potential errors in the documentation, such as documenting some parameters in
+# a documented function twice, or documenting parameters that don't exist or
+# using markup commands wrongly.
+# The default value is: YES.
+
+WARN_IF_DOC_ERROR      = YES
+
+# If WARN_IF_INCOMPLETE_DOC is set to YES, doxygen will warn about incomplete
+# function parameter documentation. If set to NO, doxygen will accept that some
+# parameters have no documentation without warning.
+# The default value is: YES.
+
+WARN_IF_INCOMPLETE_DOC = YES
+
+# This WARN_NO_PARAMDOC option can be enabled to get warnings for functions that
+# are documented, but have no documentation for their parameters or return
+# value. If set to NO, doxygen will only warn about wrong parameter
+# documentation, but not about the absence of documentation. If EXTRACT_ALL is
+# set to YES then this flag will automatically be disabled. See also
+# WARN_IF_INCOMPLETE_DOC
+# The default value is: NO.
+
+WARN_NO_PARAMDOC       = NO
+
+# If the WARN_AS_ERROR tag is set to YES then doxygen will immediately stop when
+# a warning is encountered. If the WARN_AS_ERROR tag is set to FAIL_ON_WARNINGS
+# then doxygen will continue running as if WARN_AS_ERROR tag is set to NO, but
+# at the end of the doxygen process doxygen will return with a non-zero status.
+# Possible values are: NO, YES and FAIL_ON_WARNINGS.
+# The default value is: NO.
+
+WARN_AS_ERROR          = NO
+
+# The WARN_FORMAT tag determines the format of the warning messages that doxygen
+# can produce. The string should contain the $file, $line, and $text tags, which
+# will be replaced by the file and line number from which the warning originated
+# and the warning text. Optionally the format may contain $version, which will
+# be replaced by the version of the file (if it could be obtained via
+# FILE_VERSION_FILTER)
+# See also: WARN_LINE_FORMAT
+# The default value is: $file:$line: $text.
+
+WARN_FORMAT            = "$file:$line: $text"
+
+# In the $text part of the WARN_FORMAT command it is possible that a reference
+# to a more specific place is given. To make it easier to jump to this place
+# (outside of doxygen) the user can define a custom "cut" / "paste" string.
+# Example:
+# WARN_LINE_FORMAT = "'vi $file +$line'"
+# See also: WARN_FORMAT
+# The default value is: at line $line of file $file.
+
+WARN_LINE_FORMAT       = "at line $line of file $file"
+
+# The WARN_LOGFILE tag can be used to specify a file to which warning and error
+# messages should be written. If left blank the output is written to standard
+# error (stderr). In case the file specified cannot be opened for writing the
+# warning and error messages are written to standard error. When as file - is
+# specified the warning and error messages are written to standard output
+# (stdout).
+
+WARN_LOGFILE           =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the input files
+#---------------------------------------------------------------------------
+
+# The INPUT tag is used to specify the files and/or directories that contain
+# documented source files. You may enter file names like myfile.cpp or
+# directories like /usr/src/myproject. Separate the files or directories with
+# spaces. See also FILE_PATTERNS and EXTENSION_MAPPING
+# Note: If this tag is empty the current directory is searched.
+
+INPUT                  =
+
+# This tag can be used to specify the character encoding of the source files
+# that doxygen parses. Internally doxygen uses the UTF-8 encoding. Doxygen uses
+# libiconv (or the iconv built into libc) for the transcoding. See the libiconv
+# documentation (see:
+# https://www.gnu.org/software/libiconv/) for the list of possible encodings.
+# See also: INPUT_FILE_ENCODING
+# The default value is: UTF-8.
+
+INPUT_ENCODING         = UTF-8
+
+# This tag can be used to specify the character encoding of the source files
+# that doxygen parses The INPUT_FILE_ENCODING tag can be used to specify
+# character encoding on a per file pattern basis. Doxygen will compare the file
+# name with each pattern and apply the encoding instead of the default
+# INPUT_ENCODING) if there is a match. The character encodings are a list of the
+# form: pattern=encoding (like *.php=ISO-8859-1). See cfg_input_encoding
+# "INPUT_ENCODING" for further information on supported encodings.
+
+INPUT_FILE_ENCODING    =
+
+# If the value of the INPUT tag contains directories, you can use the
+# FILE_PATTERNS tag to specify one or more wildcard patterns (like *.cpp and
+# *.h) to filter out the source-files in the directories.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# read by doxygen.
+#
+# Note the list of default checked file patterns might differ from the list of
+# default file extension mappings.
+#
+# If left blank the following patterns are tested:*.c, *.cc, *.cxx, *.cpp,
+# *.c++, *.java, *.ii, *.ixx, *.ipp, *.i++, *.inl, *.idl, *.ddl, *.odl, *.h,
+# *.hh, *.hxx, *.hpp, *.h++, *.l, *.cs, *.d, *.php, *.php4, *.php5, *.phtml,
+# *.inc, *.m, *.markdown, *.md, *.mm, *.dox (to be provided as doxygen C
+# comment), *.py, *.pyw, *.f90, *.f95, *.f03, *.f08, *.f18, *.f, *.for, *.vhd,
+# *.vhdl, *.ucf, *.qsf and *.ice.
+
+FILE_PATTERNS          = *.c \
+                         *.cc \
+                         *.cxx \
+                         *.cpp \
+                         *.c++ \
+                         *.java \
+                         *.ii \
+                         *.ixx \
+                         *.ipp \
+                         *.i++ \
+                         *.inl \
+                         *.idl \
+                         *.ddl \
+                         *.odl \
+                         *.h \
+                         *.hh \
+                         *.hxx \
+                         *.hpp \
+                         *.h++ \
+                         *.cs \
+                         *.d \
+                         *.php \
+                         *.php4 \
+                         *.php5 \
+                         *.phtml \
+                         *.inc \
+                         *.m \
+                         *.markdown \
+                         *.md \
+                         *.mm \
+                         *.dox \
+                         *.py \
+                         *.pyw \
+                         *.f90 \
+                         *.f95 \
+                         *.f03 \
+                         *.f08 \
+                         *.f18 \
+                         *.f \
+                         *.for \
+                         *.vhd \
+                         *.vhdl \
+                         *.ucf \
+                         *.qsf \
+                         *.ice
+
+# The RECURSIVE tag can be used to specify whether or not subdirectories should
+# be searched for input files as well.
+# The default value is: NO.
+
+RECURSIVE              = YES
+
+# The EXCLUDE tag can be used to specify files and/or directories that should be
+# excluded from the INPUT source files. This way you can easily exclude a
+# subdirectory from a directory tree whose root is specified with the INPUT tag.
+#
+# Note that relative paths are relative to the directory from which doxygen is
+# run.
+
+EXCLUDE                =
+
+# The EXCLUDE_SYMLINKS tag can be used to select whether or not files or
+# directories that are symbolic links (a Unix file system feature) are excluded
+# from the input.
+# The default value is: NO.
+
+EXCLUDE_SYMLINKS       = NO
+
+# If the value of the INPUT tag contains directories, you can use the
+# EXCLUDE_PATTERNS tag to specify one or more wildcard patterns to exclude
+# certain files from those directories.
+#
+# Note that the wildcards are matched against the file with absolute path, so to
+# exclude all test directories for example use the pattern */test/*
+
+EXCLUDE_PATTERNS       =
+
+# The EXCLUDE_SYMBOLS tag can be used to specify one or more symbol names
+# (namespaces, classes, functions, etc.) that should be excluded from the
+# output. The symbol name can be a fully qualified name, a word, or if the
+# wildcard * is used, a substring. Examples: ANamespace, AClass,
+# ANamespace::AClass, ANamespace::*Test
+#
+# Note that the wildcards are matched against the file with absolute path, so to
+# exclude all test directories use the pattern */test/*
+
+EXCLUDE_SYMBOLS        =
+
+# The EXAMPLE_PATH tag can be used to specify one or more files or directories
+# that contain example code fragments that are included (see the \include
+# command).
+
+EXAMPLE_PATH           =
+
+# If the value of the EXAMPLE_PATH tag contains directories, you can use the
+# EXAMPLE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp and
+# *.h) to filter out the source-files in the directories. If left blank all
+# files are included.
+
+EXAMPLE_PATTERNS       = *
+
+# If the EXAMPLE_RECURSIVE tag is set to YES then subdirectories will be
+# searched for input files to be used with the \include or \dontinclude commands
+# irrespective of the value of the RECURSIVE tag.
+# The default value is: NO.
+
+EXAMPLE_RECURSIVE      = NO
+
+# The IMAGE_PATH tag can be used to specify one or more files or directories
+# that contain images that are to be included in the documentation (see the
+# \image command).
+
+IMAGE_PATH             =
+
+# The INPUT_FILTER tag can be used to specify a program that doxygen should
+# invoke to filter for each input file. Doxygen will invoke the filter program
+# by executing (via popen()) the command:
+#
+# <filter> <input-file>
+#
+# where <filter> is the value of the INPUT_FILTER tag, and <input-file> is the
+# name of an input file. Doxygen will then use the output that the filter
+# program writes to standard output. If FILTER_PATTERNS is specified, this tag
+# will be ignored.
+#
+# Note that the filter must not add or remove lines; it is applied before the
+# code is scanned, but not when the output code is generated. If lines are added
+# or removed, the anchors will not be placed correctly.
+#
+# Note that doxygen will use the data processed and written to standard output
+# for further processing, therefore nothing else, like debug statements or used
+# commands (so in case of a Windows batch file always use @echo OFF), should be
+# written to standard output.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# properly processed by doxygen.
+
+INPUT_FILTER           =
+
+# The FILTER_PATTERNS tag can be used to specify filters on a per file pattern
+# basis. Doxygen will compare the file name with each pattern and apply the
+# filter if there is a match. The filters are a list of the form: pattern=filter
+# (like *.cpp=my_cpp_filter). See INPUT_FILTER for further information on how
+# filters are used. If the FILTER_PATTERNS tag is empty or if none of the
+# patterns match the file name, INPUT_FILTER is applied.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# properly processed by doxygen.
+
+FILTER_PATTERNS        =
+
+# If the FILTER_SOURCE_FILES tag is set to YES, the input filter (if set using
+# INPUT_FILTER) will also be used to filter the input files that are used for
+# producing the source files to browse (i.e. when SOURCE_BROWSER is set to YES).
+# The default value is: NO.
+
+FILTER_SOURCE_FILES    = NO
+
+# The FILTER_SOURCE_PATTERNS tag can be used to specify source filters per file
+# pattern. A pattern will override the setting for FILTER_PATTERN (if any) and
+# it is also possible to disable source filtering for a specific pattern using
+# *.ext= (so without naming a filter).
+# This tag requires that the tag FILTER_SOURCE_FILES is set to YES.
+
+FILTER_SOURCE_PATTERNS =
+
+# If the USE_MDFILE_AS_MAINPAGE tag refers to the name of a markdown file that
+# is part of the input, its contents will be placed on the main page
+# (index.html). This can be useful if you have a project on for instance GitHub
+# and want to reuse the introduction page also for the doxygen output.
+
+USE_MDFILE_AS_MAINPAGE =
+
+# The Fortran standard specifies that for fixed formatted Fortran code all
+# characters from position 72 are to be considered as comment. A common
+# extension is to allow longer lines before the automatic comment starts. The
+# setting FORTRAN_COMMENT_AFTER will also make it possible that longer lines can
+# be processed before the automatic comment starts.
+# Minimum value: 7, maximum value: 10000, default value: 72.
+
+FORTRAN_COMMENT_AFTER  = 72
+
+#---------------------------------------------------------------------------
+# Configuration options related to source browsing
+#---------------------------------------------------------------------------
+
+# If the SOURCE_BROWSER tag is set to YES then a list of source files will be
+# generated. Documented entities will be cross-referenced with these sources.
+#
+# Note: To get rid of all source code in the generated output, make sure that
+# also VERBATIM_HEADERS is set to NO.
+# The default value is: NO.
+
+SOURCE_BROWSER         = NO
+
+# Setting the INLINE_SOURCES tag to YES will include the body of functions,
+# classes and enums directly into the documentation.
+# The default value is: NO.
+
+INLINE_SOURCES         = NO
+
+# Setting the STRIP_CODE_COMMENTS tag to YES will instruct doxygen to hide any
+# special comment blocks from generated source code fragments. Normal C, C++ and
+# Fortran comments will always remain visible.
+# The default value is: YES.
+
+STRIP_CODE_COMMENTS    = YES
+
+# If the REFERENCED_BY_RELATION tag is set to YES then for each documented
+# entity all documented functions referencing it will be listed.
+# The default value is: NO.
+
+REFERENCED_BY_RELATION = NO
+
+# If the REFERENCES_RELATION tag is set to YES then for each documented function
+# all documented entities called/used by that function will be listed.
+# The default value is: NO.
+
+REFERENCES_RELATION    = NO
+
+# If the REFERENCES_LINK_SOURCE tag is set to YES and SOURCE_BROWSER tag is set
+# to YES then the hyperlinks from functions in REFERENCES_RELATION and
+# REFERENCED_BY_RELATION lists will link to the source code. Otherwise they will
+# link to the documentation.
+# The default value is: YES.
+
+REFERENCES_LINK_SOURCE = YES
+
+# If SOURCE_TOOLTIPS is enabled (the default) then hovering a hyperlink in the
+# source code will show a tooltip with additional information such as prototype,
+# brief description and links to the definition and documentation. Since this
+# will make the HTML file larger and loading of large files a bit slower, you
+# can opt to disable this feature.
+# The default value is: YES.
+# This tag requires that the tag SOURCE_BROWSER is set to YES.
+
+SOURCE_TOOLTIPS        = YES
+
+# If the USE_HTAGS tag is set to YES then the references to source code will
+# point to the HTML generated by the htags(1) tool instead of doxygen built-in
+# source browser. The htags tool is part of GNU's global source tagging system
+# (see https://www.gnu.org/software/global/global.html). You will need version
+# 4.8.6 or higher.
+#
+# To use it do the following:
+# - Install the latest version of global
+# - Enable SOURCE_BROWSER and USE_HTAGS in the configuration file
+# - Make sure the INPUT points to the root of the source tree
+# - Run doxygen as normal
+#
+# Doxygen will invoke htags (and that will in turn invoke gtags), so these
+# tools must be available from the command line (i.e. in the search path).
+#
+# The result: instead of the source browser generated by doxygen, the links to
+# source code will now point to the output of htags.
+# The default value is: NO.
+# This tag requires that the tag SOURCE_BROWSER is set to YES.
+
+USE_HTAGS              = NO
+
+# If the VERBATIM_HEADERS tag is set the YES then doxygen will generate a
+# verbatim copy of the header file for each class for which an include is
+# specified. Set to NO to disable this.
+# See also: Section \class.
+# The default value is: YES.
+
+VERBATIM_HEADERS       = YES
+
+# If the CLANG_ASSISTED_PARSING tag is set to YES then doxygen will use the
+# clang parser (see:
+# http://clang.llvm.org/) for more accurate parsing at the cost of reduced
+# performance. This can be particularly helpful with template rich C++ code for
+# which doxygen's built-in parser lacks the necessary type information.
+# Note: The availability of this option depends on whether or not doxygen was
+# generated with the -Duse_libclang=ON option for CMake.
+# The default value is: NO.
+
+CLANG_ASSISTED_PARSING = NO
+
+# If the CLANG_ASSISTED_PARSING tag is set to YES and the CLANG_ADD_INC_PATHS
+# tag is set to YES then doxygen will add the directory of each input to the
+# include path.
+# The default value is: YES.
+# This tag requires that the tag CLANG_ASSISTED_PARSING is set to YES.
+
+CLANG_ADD_INC_PATHS    = YES
+
+# If clang assisted parsing is enabled you can provide the compiler with command
+# line options that you would normally use when invoking the compiler. Note that
+# the include paths will already be set by doxygen for the files and directories
+# specified with INPUT and INCLUDE_PATH.
+# This tag requires that the tag CLANG_ASSISTED_PARSING is set to YES.
+
+CLANG_OPTIONS          =
+
+# If clang assisted parsing is enabled you can provide the clang parser with the
+# path to the directory containing a file called compile_commands.json. This
+# file is the compilation database (see:
+# http://clang.llvm.org/docs/HowToSetupToolingForLLVM.html) containing the
+# options used when the source files were built. This is equivalent to
+# specifying the -p option to a clang tool, such as clang-check. These options
+# will then be passed to the parser. Any options specified with CLANG_OPTIONS
+# will be added as well.
+# Note: The availability of this option depends on whether or not doxygen was
+# generated with the -Duse_libclang=ON option for CMake.
+
+CLANG_DATABASE_PATH    =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the alphabetical class index
+#---------------------------------------------------------------------------
+
+# If the ALPHABETICAL_INDEX tag is set to YES, an alphabetical index of all
+# compounds will be generated. Enable this if the project contains a lot of
+# classes, structs, unions or interfaces.
+# The default value is: YES.
+
+ALPHABETICAL_INDEX     = YES
+
+# In case all classes in a project start with a common prefix, all classes will
+# be put under the same header in the alphabetical index. The IGNORE_PREFIX tag
+# can be used to specify a prefix (or a list of prefixes) that should be ignored
+# while generating the index headers.
+# This tag requires that the tag ALPHABETICAL_INDEX is set to YES.
+
+IGNORE_PREFIX          =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the HTML output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_HTML tag is set to YES, doxygen will generate HTML output
+# The default value is: YES.
+
+GENERATE_HTML          = YES
+
+# The HTML_OUTPUT tag is used to specify where the HTML docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: html.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_OUTPUT            = html
+
+# The HTML_FILE_EXTENSION tag can be used to specify the file extension for each
+# generated HTML page (for example: .htm, .php, .asp).
+# The default value is: .html.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_FILE_EXTENSION    = .html
+
+# The HTML_HEADER tag can be used to specify a user-defined HTML header file for
+# each generated HTML page. If the tag is left blank doxygen will generate a
+# standard header.
+#
+# To get valid HTML the header file that includes any scripts and style sheets
+# that doxygen needs, which is dependent on the configuration options used (e.g.
+# the setting GENERATE_TREEVIEW). It is highly recommended to start with a
+# default header using
+# doxygen -w html new_header.html new_footer.html new_stylesheet.css
+# YourConfigFile
+# and then modify the file new_header.html. See also section "Doxygen usage"
+# for information on how to generate the default header that doxygen normally
+# uses.
+# Note: The header is subject to change so you typically have to regenerate the
+# default header when upgrading to a newer version of doxygen. For a description
+# of the possible markers and block names see the documentation.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_HEADER            =
+
+# The HTML_FOOTER tag can be used to specify a user-defined HTML footer for each
+# generated HTML page. If the tag is left blank doxygen will generate a standard
+# footer. See HTML_HEADER for more information on how to generate a default
+# footer and what special commands can be used inside the footer. See also
+# section "Doxygen usage" for information on how to generate the default footer
+# that doxygen normally uses.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_FOOTER            =
+
+# The HTML_STYLESHEET tag can be used to specify a user-defined cascading style
+# sheet that is used by each HTML page. It can be used to fine-tune the look of
+# the HTML output. If left blank doxygen will generate a default style sheet.
+# See also section "Doxygen usage" for information on how to generate the style
+# sheet that doxygen normally uses.
+# Note: It is recommended to use HTML_EXTRA_STYLESHEET instead of this tag, as
+# it is more robust and this tag (HTML_STYLESHEET) will in the future become
+# obsolete.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_STYLESHEET        =
+
+# The HTML_EXTRA_STYLESHEET tag can be used to specify additional user-defined
+# cascading style sheets that are included after the standard style sheets
+# created by doxygen. Using this option one can overrule certain style aspects.
+# This is preferred over using HTML_STYLESHEET since it does not replace the
+# standard style sheet and is therefore more robust against future updates.
+# Doxygen will copy the style sheet files to the output directory.
+# Note: The order of the extra style sheet files is of importance (e.g. the last
+# style sheet in the list overrules the setting of the previous ones in the
+# list). For an example see the documentation.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_EXTRA_STYLESHEET  =
+
+# The HTML_EXTRA_FILES tag can be used to specify one or more extra images or
+# other source files which should be copied to the HTML output directory. Note
+# that these files will be copied to the base HTML output directory. Use the
+# $relpath^ marker in the HTML_HEADER and/or HTML_FOOTER files to load these
+# files. In the HTML_STYLESHEET file, use the file name only. Also note that the
+# files will be copied as-is; there are no commands or markers available.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_EXTRA_FILES       =
+
+# The HTML_COLORSTYLE tag can be used to specify if the generated HTML output
+# should be rendered with a dark or light theme. Default setting AUTO_LIGHT
+# enables light output unless the user preference is dark output. Other options
+# are DARK to always use dark mode, LIGHT to always use light mode, AUTO_DARK to
+# default to dark mode unless the user prefers light mode, and TOGGLE to let the
+# user toggle between dark and light mode via a button.
+# Possible values are: LIGHT Always generate light output., DARK Always generate
+# dark output., AUTO_LIGHT Automatically set the mode according to the user
+# preference, use light mode if no preference is set (the default)., AUTO_DARK
+# Automatically set the mode according to the user preference, use dark mode if
+# no preference is set. and TOGGLE Allow to user to switch between light and
+# dark mode via a button..
+# The default value is: AUTO_LIGHT.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE        = AUTO_LIGHT
+
+# The HTML_COLORSTYLE_HUE tag controls the color of the HTML output. Doxygen
+# will adjust the colors in the style sheet and background images according to
+# this color. Hue is specified as an angle on a color-wheel, see
+# https://en.wikipedia.org/wiki/Hue for more information. For instance the value
+# 0 represents red, 60 is yellow, 120 is green, 180 is cyan, 240 is blue, 300
+# purple, and 360 is red again.
+# Minimum value: 0, maximum value: 359, default value: 220.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_HUE    = 220
+
+# The HTML_COLORSTYLE_SAT tag controls the purity (or saturation) of the colors
+# in the HTML output. For a value of 0 the output will use gray-scales only. A
+# value of 255 will produce the most vivid colors.
+# Minimum value: 0, maximum value: 255, default value: 100.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_SAT    = 100
+
+# The HTML_COLORSTYLE_GAMMA tag controls the gamma correction applied to the
+# luminance component of the colors in the HTML output. Values below 100
+# gradually make the output lighter, whereas values above 100 make the output
+# darker. The value divided by 100 is the actual gamma applied, so 80 represents
+# a gamma of 0.8, The value 220 represents a gamma of 2.2, and 100 does not
+# change the gamma.
+# Minimum value: 40, maximum value: 240, default value: 80.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_GAMMA  = 80
+
+# If the HTML_TIMESTAMP tag is set to YES then the footer of each generated HTML
+# page will contain the date and time when the page was generated. Setting this
+# to YES can help to show when doxygen was last run and thus if the
+# documentation is up to date.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_TIMESTAMP         = NO
+
+# If the HTML_DYNAMIC_MENUS tag is set to YES then the generated HTML
+# documentation will contain a main index with vertical navigation menus that
+# are dynamically created via JavaScript. If disabled, the navigation index will
+# consists of multiple levels of tabs that are statically embedded in every HTML
+# page. Disable this option to support browsers that do not have JavaScript,
+# like the Qt help browser.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_DYNAMIC_MENUS     = YES
+
+# If the HTML_DYNAMIC_SECTIONS tag is set to YES then the generated HTML
+# documentation will contain sections that can be hidden and shown after the
+# page has loaded.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_DYNAMIC_SECTIONS  = NO
+
+# With HTML_INDEX_NUM_ENTRIES one can control the preferred number of entries
+# shown in the various tree structured indices initially; the user can expand
+# and collapse entries dynamically later on. Doxygen will expand the tree to
+# such a level that at most the specified number of entries are visible (unless
+# a fully collapsed tree already exceeds this amount). So setting the number of
+# entries 1 will produce a full collapsed tree by default. 0 is a special value
+# representing an infinite number of entries and will result in a full expanded
+# tree by default.
+# Minimum value: 0, maximum value: 9999, default value: 100.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_INDEX_NUM_ENTRIES = 100
+
+# If the GENERATE_DOCSET tag is set to YES, additional index files will be
+# generated that can be used as input for Apple's Xcode 3 integrated development
+# environment (see:
+# https://developer.apple.com/xcode/), introduced with OSX 10.5 (Leopard). To
+# create a documentation set, doxygen will generate a Makefile in the HTML
+# output directory. Running make will produce the docset in that directory and
+# running make install will install the docset in
+# ~/Library/Developer/Shared/Documentation/DocSets so that Xcode will find it at
+# startup. See https://developer.apple.com/library/archive/featuredarticles/Doxy
+# genXcode/_index.html for more information.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_DOCSET        = NO
+
+# This tag determines the name of the docset feed. A documentation feed provides
+# an umbrella under which multiple documentation sets from a single provider
+# (such as a company or product suite) can be grouped.
+# The default value is: Doxygen generated docs.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_FEEDNAME        = "Doxygen generated docs"
+
+# This tag determines the URL of the docset feed. A documentation feed provides
+# an umbrella under which multiple documentation sets from a single provider
+# (such as a company or product suite) can be grouped.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_FEEDURL         =
+
+# This tag specifies a string that should uniquely identify the documentation
+# set bundle. This should be a reverse domain-name style string, e.g.
+# com.mycompany.MyDocSet. Doxygen will append .docset to the name.
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_BUNDLE_ID       = org.doxygen.Project
+
+# The DOCSET_PUBLISHER_ID tag specifies a string that should uniquely identify
+# the documentation publisher. This should be a reverse domain-name style
+# string, e.g. com.mycompany.MyDocSet.documentation.
+# The default value is: org.doxygen.Publisher.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_PUBLISHER_ID    = org.doxygen.Publisher
+
+# The DOCSET_PUBLISHER_NAME tag identifies the documentation publisher.
+# The default value is: Publisher.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_PUBLISHER_NAME  = Publisher
+
+# If the GENERATE_HTMLHELP tag is set to YES then doxygen generates three
+# additional HTML index files: index.hhp, index.hhc, and index.hhk. The
+# index.hhp is a project file that can be read by Microsoft's HTML Help Workshop
+# on Windows. In the beginning of 2021 Microsoft took the original page, with
+# a.o. the download links, offline the HTML help workshop was already many years
+# in maintenance mode). You can download the HTML help workshop from the web
+# archives at Installation executable (see:
+# http://web.archive.org/web/20160201063255/http://download.microsoft.com/downlo
+# ad/0/A/9/0A939EF6-E31C-430F-A3DF-DFAE7960D564/htmlhelp.exe).
+#
+# The HTML Help Workshop contains a compiler that can convert all HTML output
+# generated by doxygen into a single compiled HTML file (.chm). Compiled HTML
+# files are now used as the Windows 98 help format, and will replace the old
+# Windows help format (.hlp) on all Windows platforms in the future. Compressed
+# HTML files also contain an index, a table of contents, and you can search for
+# words in the documentation. The HTML workshop also contains a viewer for
+# compressed HTML files.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_HTMLHELP      = NO
+
+# The CHM_FILE tag can be used to specify the file name of the resulting .chm
+# file. You can add a path in front of the file if the result should not be
+# written to the html output directory.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+CHM_FILE               =
+
+# The HHC_LOCATION tag can be used to specify the location (absolute path
+# including file name) of the HTML help compiler (hhc.exe). If non-empty,
+# doxygen will try to run the HTML help compiler on the generated index.hhp.
+# The file has to be specified with full path.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+HHC_LOCATION           =
+
+# The GENERATE_CHI flag controls if a separate .chi index file is generated
+# (YES) or that it should be included in the main .chm file (NO).
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+GENERATE_CHI           = NO
+
+# The CHM_INDEX_ENCODING is used to encode HtmlHelp index (hhk), content (hhc)
+# and project file content.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+CHM_INDEX_ENCODING     =
+
+# The BINARY_TOC flag controls whether a binary table of contents is generated
+# (YES) or a normal table of contents (NO) in the .chm file. Furthermore it
+# enables the Previous and Next buttons.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+BINARY_TOC             = NO
+
+# The TOC_EXPAND flag can be set to YES to add extra items for group members to
+# the table of contents of the HTML help documentation and to the tree view.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+TOC_EXPAND             = NO
+
+# If the GENERATE_QHP tag is set to YES and both QHP_NAMESPACE and
+# QHP_VIRTUAL_FOLDER are set, an additional index file will be generated that
+# can be used as input for Qt's qhelpgenerator to generate a Qt Compressed Help
+# (.qch) of the generated HTML documentation.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_QHP           = NO
+
+# If the QHG_LOCATION tag is specified, the QCH_FILE tag can be used to specify
+# the file name of the resulting .qch file. The path specified is relative to
+# the HTML output folder.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QCH_FILE               =
+
+# The QHP_NAMESPACE tag specifies the namespace to use when generating Qt Help
+# Project output. For more information please see Qt Help Project / Namespace
+# (see:
+# https://doc.qt.io/archives/qt-4.8/qthelpproject.html#namespace).
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_NAMESPACE          = org.doxygen.Project
+
+# The QHP_VIRTUAL_FOLDER tag specifies the namespace to use when generating Qt
+# Help Project output. For more information please see Qt Help Project / Virtual
+# Folders (see:
+# https://doc.qt.io/archives/qt-4.8/qthelpproject.html#virtual-folders).
+# The default value is: doc.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_VIRTUAL_FOLDER     = doc
+
+# If the QHP_CUST_FILTER_NAME tag is set, it specifies the name of a custom
+# filter to add. For more information please see Qt Help Project / Custom
+# Filters (see:
+# https://doc.qt.io/archives/qt-4.8/qthelpproject.html#custom-filters).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_CUST_FILTER_NAME   =
+
+# The QHP_CUST_FILTER_ATTRS tag specifies the list of the attributes of the
+# custom filter to add. For more information please see Qt Help Project / Custom
+# Filters (see:
+# https://doc.qt.io/archives/qt-4.8/qthelpproject.html#custom-filters).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_CUST_FILTER_ATTRS  =
+
+# The QHP_SECT_FILTER_ATTRS tag specifies the list of the attributes this
+# project's filter section matches. Qt Help Project / Filter Attributes (see:
+# https://doc.qt.io/archives/qt-4.8/qthelpproject.html#filter-attributes).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_SECT_FILTER_ATTRS  =
+
+# The QHG_LOCATION tag can be used to specify the location (absolute path
+# including file name) of Qt's qhelpgenerator. If non-empty doxygen will try to
+# run qhelpgenerator on the generated .qhp file.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHG_LOCATION           =
+
+# If the GENERATE_ECLIPSEHELP tag is set to YES, additional index files will be
+# generated, together with the HTML files, they form an Eclipse help plugin. To
+# install this plugin and make it available under the help contents menu in
+# Eclipse, the contents of the directory containing the HTML and XML files needs
+# to be copied into the plugins directory of eclipse. The name of the directory
+# within the plugins directory should be the same as the ECLIPSE_DOC_ID value.
+# After copying Eclipse needs to be restarted before the help appears.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_ECLIPSEHELP   = NO
+
+# A unique identifier for the Eclipse help plugin. When installing the plugin
+# the directory name containing the HTML and XML files should also have this
+# name. Each documentation set should have its own identifier.
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_ECLIPSEHELP is set to YES.
+
+ECLIPSE_DOC_ID         = org.doxygen.Project
+
+# If you want full control over the layout of the generated HTML pages it might
+# be necessary to disable the index and replace it with your own. The
+# DISABLE_INDEX tag can be used to turn on/off the condensed index (tabs) at top
+# of each HTML page. A value of NO enables the index and the value YES disables
+# it. Since the tabs in the index contain the same information as the navigation
+# tree, you can set this option to YES if you also set GENERATE_TREEVIEW to YES.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+DISABLE_INDEX          = NO
+
+# The GENERATE_TREEVIEW tag is used to specify whether a tree-like index
+# structure should be generated to display hierarchical information. If the tag
+# value is set to YES, a side panel will be generated containing a tree-like
+# index structure (just like the one that is generated for HTML Help). For this
+# to work a browser that supports JavaScript, DHTML, CSS and frames is required
+# (i.e. any modern browser). Windows users are probably better off using the
+# HTML help feature. Via custom style sheets (see HTML_EXTRA_STYLESHEET) one can
+# further fine tune the look of the index (see "Fine-tuning the output"). As an
+# example, the default style sheet generated by doxygen has an example that
+# shows how to put an image at the root of the tree instead of the PROJECT_NAME.
+# Since the tree basically has the same information as the tab index, you could
+# consider setting DISABLE_INDEX to YES when enabling this option.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_TREEVIEW      = NO
+
+# When both GENERATE_TREEVIEW and DISABLE_INDEX are set to YES, then the
+# FULL_SIDEBAR option determines if the side bar is limited to only the treeview
+# area (value NO) or if it should extend to the full height of the window (value
+# YES). Setting this to YES gives a layout similar to
+# https://docs.readthedocs.io with more room for contents, but less room for the
+# project logo, title, and description. If either GENERATE_TREEVIEW or
+# DISABLE_INDEX is set to NO, this option has no effect.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+FULL_SIDEBAR           = NO
+
+# The ENUM_VALUES_PER_LINE tag can be used to set the number of enum values that
+# doxygen will group on one line in the generated HTML documentation.
+#
+# Note that a value of 0 will completely suppress the enum values from appearing
+# in the overview section.
+# Minimum value: 0, maximum value: 20, default value: 4.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+ENUM_VALUES_PER_LINE   = 4
+
+# If the treeview is enabled (see GENERATE_TREEVIEW) then this tag can be used
+# to set the initial width (in pixels) of the frame in which the tree is shown.
+# Minimum value: 0, maximum value: 1500, default value: 250.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+TREEVIEW_WIDTH         = 250
+
+# If the EXT_LINKS_IN_WINDOW option is set to YES, doxygen will open links to
+# external symbols imported via tag files in a separate window.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+EXT_LINKS_IN_WINDOW    = NO
+
+# If the OBFUSCATE_EMAILS tag is set to YES, doxygen will obfuscate email
+# addresses.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+OBFUSCATE_EMAILS       = YES
+
+# If the HTML_FORMULA_FORMAT option is set to svg, doxygen will use the pdf2svg
+# tool (see https://github.com/dawbarton/pdf2svg) or inkscape (see
+# https://inkscape.org) to generate formulas as SVG images instead of PNGs for
+# the HTML output. These images will generally look nicer at scaled resolutions.
+# Possible values are: png (the default) and svg (looks nicer but requires the
+# pdf2svg or inkscape tool).
+# The default value is: png.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_FORMULA_FORMAT    = png
+
+# Use this tag to change the font size of LaTeX formulas included as images in
+# the HTML documentation. When you change the font size after a successful
+# doxygen run you need to manually remove any form_*.png images from the HTML
+# output directory to force them to be regenerated.
+# Minimum value: 8, maximum value: 50, default value: 10.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+FORMULA_FONTSIZE       = 10
+
+# The FORMULA_MACROFILE can contain LaTeX \newcommand and \renewcommand commands
+# to create new LaTeX commands to be used in formulas as building blocks. See
+# the section "Including formulas" for details.
+
+FORMULA_MACROFILE      =
+
+# Enable the USE_MATHJAX option to render LaTeX formulas using MathJax (see
+# https://www.mathjax.org) which uses client side JavaScript for the rendering
+# instead of using pre-rendered bitmaps. Use this if you do not have LaTeX
+# installed or if you want to formulas look prettier in the HTML output. When
+# enabled you may also need to install MathJax separately and configure the path
+# to it using the MATHJAX_RELPATH option.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+USE_MATHJAX            = NO
+
+# With MATHJAX_VERSION it is possible to specify the MathJax version to be used.
+# Note that the different versions of MathJax have different requirements with
+# regards to the different settings, so it is possible that also other MathJax
+# settings have to be changed when switching between the different MathJax
+# versions.
+# Possible values are: MathJax_2 and MathJax_3.
+# The default value is: MathJax_2.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_VERSION        = MathJax_2
+
+# When MathJax is enabled you can set the default output format to be used for
+# the MathJax output. For more details about the output format see MathJax
+# version 2 (see:
+# http://docs.mathjax.org/en/v2.7-latest/output.html) and MathJax version 3
+# (see:
+# http://docs.mathjax.org/en/latest/web/components/output.html).
+# Possible values are: HTML-CSS (which is slower, but has the best
+# compatibility. This is the name for Mathjax version 2, for MathJax version 3
+# this will be translated into chtml), NativeMML (i.e. MathML. Only supported
+# for NathJax 2. For MathJax version 3 chtml will be used instead.), chtml (This
+# is the name for Mathjax version 3, for MathJax version 2 this will be
+# translated into HTML-CSS) and SVG.
+# The default value is: HTML-CSS.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_FORMAT         = HTML-CSS
+
+# When MathJax is enabled you need to specify the location relative to the HTML
+# output directory using the MATHJAX_RELPATH option. The destination directory
+# should contain the MathJax.js script. For instance, if the mathjax directory
+# is located at the same level as the HTML output directory, then
+# MATHJAX_RELPATH should be ../mathjax. The default value points to the MathJax
+# Content Delivery Network so you can quickly see the result without installing
+# MathJax. However, it is strongly recommended to install a local copy of
+# MathJax from https://www.mathjax.org before deployment. The default value is:
+# - in case of MathJax version 2: https://cdn.jsdelivr.net/npm/mathjax@2
+# - in case of MathJax version 3: https://cdn.jsdelivr.net/npm/mathjax@3
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_RELPATH        = https://cdn.jsdelivr.net/npm/mathjax@2
+
+# The MATHJAX_EXTENSIONS tag can be used to specify one or more MathJax
+# extension names that should be enabled during MathJax rendering. For example
+# for MathJax version 2 (see
+# https://docs.mathjax.org/en/v2.7-latest/tex.html#tex-and-latex-extensions):
+# MATHJAX_EXTENSIONS = TeX/AMSmath TeX/AMSsymbols
+# For example for MathJax version 3 (see
+# http://docs.mathjax.org/en/latest/input/tex/extensions/index.html):
+# MATHJAX_EXTENSIONS = ams
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_EXTENSIONS     =
+
+# The MATHJAX_CODEFILE tag can be used to specify a file with javascript pieces
+# of code that will be used on startup of the MathJax code. See the MathJax site
+# (see:
+# http://docs.mathjax.org/en/v2.7-latest/output.html) for more details. For an
+# example see the documentation.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_CODEFILE       =
+
+# When the SEARCHENGINE tag is enabled doxygen will generate a search box for
+# the HTML output. The underlying search engine uses javascript and DHTML and
+# should work on any modern browser. Note that when using HTML help
+# (GENERATE_HTMLHELP), Qt help (GENERATE_QHP), or docsets (GENERATE_DOCSET)
+# there is already a search function so this one should typically be disabled.
+# For large projects the javascript based search engine can be slow, then
+# enabling SERVER_BASED_SEARCH may provide a better solution. It is possible to
+# search using the keyboard; to jump to the search box use <access key> + S
+# (what the <access key> is depends on the OS and browser, but it is typically
+# <CTRL>, <ALT>/<option>, or both). Inside the search box use the <cursor down
+# key> to jump into the search results window, the results can be navigated
+# using the <cursor keys>. Press <Enter> to select an item or <escape> to cancel
+# the search. The filter options can be selected when the cursor is inside the
+# search box by pressing <Shift>+<cursor down>. Also here use the <cursor keys>
+# to select a filter and <Enter> or <escape> to activate or cancel the filter
+# option.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+SEARCHENGINE           = YES
+
+# When the SERVER_BASED_SEARCH tag is enabled the search engine will be
+# implemented using a web server instead of a web client using JavaScript. There
+# are two flavors of web server based searching depending on the EXTERNAL_SEARCH
+# setting. When disabled, doxygen will generate a PHP script for searching and
+# an index file used by the script. When EXTERNAL_SEARCH is enabled the indexing
+# and searching needs to be provided by external tools. See the section
+# "External Indexing and Searching" for details.
+# The default value is: NO.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SERVER_BASED_SEARCH    = NO
+
+# When EXTERNAL_SEARCH tag is enabled doxygen will no longer generate the PHP
+# script for searching. Instead the search results are written to an XML file
+# which needs to be processed by an external indexer. Doxygen will invoke an
+# external search engine pointed to by the SEARCHENGINE_URL option to obtain the
+# search results.
+#
+# Doxygen ships with an example indexer (doxyindexer) and search engine
+# (doxysearch.cgi) which are based on the open source search engine library
+# Xapian (see:
+# https://xapian.org/).
+#
+# See the section "External Indexing and Searching" for details.
+# The default value is: NO.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTERNAL_SEARCH        = NO
+
+# The SEARCHENGINE_URL should point to a search engine hosted by a web server
+# which will return the search results when EXTERNAL_SEARCH is enabled.
+#
+# Doxygen ships with an example indexer (doxyindexer) and search engine
+# (doxysearch.cgi) which are based on the open source search engine library
+# Xapian (see:
+# https://xapian.org/). See the section "External Indexing and Searching" for
+# details.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SEARCHENGINE_URL       =
+
+# When SERVER_BASED_SEARCH and EXTERNAL_SEARCH are both enabled the unindexed
+# search data is written to a file for indexing by an external tool. With the
+# SEARCHDATA_FILE tag the name of this file can be specified.
+# The default file is: searchdata.xml.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SEARCHDATA_FILE        = searchdata.xml
+
+# When SERVER_BASED_SEARCH and EXTERNAL_SEARCH are both enabled the
+# EXTERNAL_SEARCH_ID tag can be used as an identifier for the project. This is
+# useful in combination with EXTRA_SEARCH_MAPPINGS to search through multiple
+# projects and redirect the results back to the right project.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTERNAL_SEARCH_ID     =
+
+# The EXTRA_SEARCH_MAPPINGS tag can be used to enable searching through doxygen
+# projects other than the one defined by this configuration file, but that are
+# all added to the same external search index. Each project needs to have a
+# unique id set via EXTERNAL_SEARCH_ID. The search mapping then maps the id of
+# to a relative location where the documentation can be found. The format is:
+# EXTRA_SEARCH_MAPPINGS = tagname1=loc1 tagname2=loc2 ...
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTRA_SEARCH_MAPPINGS  =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the LaTeX output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_LATEX tag is set to YES, doxygen will generate LaTeX output.
+# The default value is: YES.
+
+GENERATE_LATEX         = YES
+
+# The LATEX_OUTPUT tag is used to specify where the LaTeX docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: latex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_OUTPUT           = latex
+
+# The LATEX_CMD_NAME tag can be used to specify the LaTeX command name to be
+# invoked.
+#
+# Note that when not enabling USE_PDFLATEX the default is latex when enabling
+# USE_PDFLATEX the default is pdflatex and when in the later case latex is
+# chosen this is overwritten by pdflatex. For specific output languages the
+# default can have been set differently, this depends on the implementation of
+# the output language.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_CMD_NAME         =
+
+# The MAKEINDEX_CMD_NAME tag can be used to specify the command name to generate
+# index for LaTeX.
+# Note: This tag is used in the Makefile / make.bat.
+# See also: LATEX_MAKEINDEX_CMD for the part in the generated output file
+# (.tex).
+# The default file is: makeindex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+MAKEINDEX_CMD_NAME     = makeindex
+
+# The LATEX_MAKEINDEX_CMD tag can be used to specify the command name to
+# generate index for LaTeX. In case there is no backslash (\) as first character
+# it will be automatically added in the LaTeX code.
+# Note: This tag is used in the generated output file (.tex).
+# See also: MAKEINDEX_CMD_NAME for the part in the Makefile / make.bat.
+# The default value is: makeindex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_MAKEINDEX_CMD    = makeindex
+
+# If the COMPACT_LATEX tag is set to YES, doxygen generates more compact LaTeX
+# documents. This may be useful for small projects and may help to save some
+# trees in general.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+COMPACT_LATEX          = NO
+
+# The PAPER_TYPE tag can be used to set the paper type that is used by the
+# printer.
+# Possible values are: a4 (210 x 297 mm), letter (8.5 x 11 inches), legal (8.5 x
+# 14 inches) and executive (7.25 x 10.5 inches).
+# The default value is: a4.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+PAPER_TYPE             = a4
+
+# The EXTRA_PACKAGES tag can be used to specify one or more LaTeX package names
+# that should be included in the LaTeX output. The package can be specified just
+# by its name or with the correct syntax as to be used with the LaTeX
+# \usepackage command. To get the times font for instance you can specify :
+# EXTRA_PACKAGES=times or EXTRA_PACKAGES={times}
+# To use the option intlimits with the amsmath package you can specify:
+# EXTRA_PACKAGES=[intlimits]{amsmath}
+# If left blank no extra packages will be included.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+EXTRA_PACKAGES         =
+
+# The LATEX_HEADER tag can be used to specify a user-defined LaTeX header for
+# the generated LaTeX document. The header should contain everything until the
+# first chapter. If it is left blank doxygen will generate a standard header. It
+# is highly recommended to start with a default header using
+# doxygen -w latex new_header.tex new_footer.tex new_stylesheet.sty
+# and then modify the file new_header.tex. See also section "Doxygen usage" for
+# information on how to generate the default header that doxygen normally uses.
+#
+# Note: Only use a user-defined header if you know what you are doing!
+# Note: The header is subject to change so you typically have to regenerate the
+# default header when upgrading to a newer version of doxygen. The following
+# commands have a special meaning inside the header (and footer): For a
+# description of the possible markers and block names see the documentation.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_HEADER           =
+
+# The LATEX_FOOTER tag can be used to specify a user-defined LaTeX footer for
+# the generated LaTeX document. The footer should contain everything after the
+# last chapter. If it is left blank doxygen will generate a standard footer. See
+# LATEX_HEADER for more information on how to generate a default footer and what
+# special commands can be used inside the footer. See also section "Doxygen
+# usage" for information on how to generate the default footer that doxygen
+# normally uses. Note: Only use a user-defined footer if you know what you are
+# doing!
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_FOOTER           =
+
+# The LATEX_EXTRA_STYLESHEET tag can be used to specify additional user-defined
+# LaTeX style sheets that are included after the standard style sheets created
+# by doxygen. Using this option one can overrule certain style aspects. Doxygen
+# will copy the style sheet files to the output directory.
+# Note: The order of the extra style sheet files is of importance (e.g. the last
+# style sheet in the list overrules the setting of the previous ones in the
+# list).
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_EXTRA_STYLESHEET =
+
+# The LATEX_EXTRA_FILES tag can be used to specify one or more extra images or
+# other source files which should be copied to the LATEX_OUTPUT output
+# directory. Note that the files will be copied as-is; there are no commands or
+# markers available.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_EXTRA_FILES      =
+
+# If the PDF_HYPERLINKS tag is set to YES, the LaTeX that is generated is
+# prepared for conversion to PDF (using ps2pdf or pdflatex). The PDF file will
+# contain links (just like the HTML output) instead of page references. This
+# makes the output suitable for online browsing using a PDF viewer.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+PDF_HYPERLINKS         = YES
+
+# If the USE_PDFLATEX tag is set to YES, doxygen will use the engine as
+# specified with LATEX_CMD_NAME to generate the PDF file directly from the LaTeX
+# files. Set this option to YES, to get a higher quality PDF documentation.
+#
+# See also section LATEX_CMD_NAME for selecting the engine.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+USE_PDFLATEX           = YES
+
+# If the LATEX_BATCHMODE tag is set to YES, doxygen will add the \batchmode
+# command to the generated LaTeX files. This will instruct LaTeX to keep running
+# if errors occur, instead of asking the user for help.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_BATCHMODE        = NO
+
+# If the LATEX_HIDE_INDICES tag is set to YES then doxygen will not include the
+# index chapters (such as File Index, Compound Index, etc.) in the output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_HIDE_INDICES     = NO
+
+# The LATEX_BIB_STYLE tag can be used to specify the style to use for the
+# bibliography, e.g. plainnat, or ieeetr. See
+# https://en.wikipedia.org/wiki/BibTeX and \cite for more info.
+# The default value is: plain.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_BIB_STYLE        = plain
+
+# If the LATEX_TIMESTAMP tag is set to YES then the footer of each generated
+# page will contain the date and time when the page was generated. Setting this
+# to NO can help when comparing the output of multiple runs.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_TIMESTAMP        = NO
+
+# The LATEX_EMOJI_DIRECTORY tag is used to specify the (relative or absolute)
+# path from which the emoji images will be read. If a relative path is entered,
+# it will be relative to the LATEX_OUTPUT directory. If left blank the
+# LATEX_OUTPUT directory will be used.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_EMOJI_DIRECTORY  =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the RTF output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_RTF tag is set to YES, doxygen will generate RTF output. The
+# RTF output is optimized for Word 97 and may not look too pretty with other RTF
+# readers/editors.
+# The default value is: NO.
+
+GENERATE_RTF           = NO
+
+# The RTF_OUTPUT tag is used to specify where the RTF docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: rtf.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_OUTPUT             = rtf
+
+# If the COMPACT_RTF tag is set to YES, doxygen generates more compact RTF
+# documents. This may be useful for small projects and may help to save some
+# trees in general.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+COMPACT_RTF            = NO
+
+# If the RTF_HYPERLINKS tag is set to YES, the RTF that is generated will
+# contain hyperlink fields. The RTF file will contain links (just like the HTML
+# output) instead of page references. This makes the output suitable for online
+# browsing using Word or some other Word compatible readers that support those
+# fields.
+#
+# Note: WordPad (write) and others do not support links.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_HYPERLINKS         = NO
+
+# Load stylesheet definitions from file. Syntax is similar to doxygen's
+# configuration file, i.e. a series of assignments. You only have to provide
+# replacements, missing definitions are set to their default value.
+#
+# See also section "Doxygen usage" for information on how to generate the
+# default style sheet that doxygen normally uses.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_STYLESHEET_FILE    =
+
+# Set optional variables used in the generation of an RTF document. Syntax is
+# similar to doxygen's configuration file. A template extensions file can be
+# generated using doxygen -e rtf extensionFile.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_EXTENSIONS_FILE    =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the man page output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_MAN tag is set to YES, doxygen will generate man pages for
+# classes and files.
+# The default value is: NO.
+
+GENERATE_MAN           = NO
+
+# The MAN_OUTPUT tag is used to specify where the man pages will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it. A directory man3 will be created inside the directory specified by
+# MAN_OUTPUT.
+# The default directory is: man.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_OUTPUT             = man
+
+# The MAN_EXTENSION tag determines the extension that is added to the generated
+# man pages. In case the manual section does not start with a number, the number
+# 3 is prepended. The dot (.) at the beginning of the MAN_EXTENSION tag is
+# optional.
+# The default value is: .3.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_EXTENSION          = .3
+
+# The MAN_SUBDIR tag determines the name of the directory created within
+# MAN_OUTPUT in which the man pages are placed. If defaults to man followed by
+# MAN_EXTENSION with the initial . removed.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_SUBDIR             =
+
+# If the MAN_LINKS tag is set to YES and doxygen generates man output, then it
+# will generate one additional man file for each entity documented in the real
+# man page(s). These additional files only source the real man page, but without
+# them the man command would be unable to find the correct page.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_LINKS              = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the XML output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_XML tag is set to YES, doxygen will generate an XML file that
+# captures the structure of the code including all documentation.
+# The default value is: NO.
+
+GENERATE_XML           = NO
+
+# The XML_OUTPUT tag is used to specify where the XML pages will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: xml.
+# This tag requires that the tag GENERATE_XML is set to YES.
+
+XML_OUTPUT             = xml
+
+# If the XML_PROGRAMLISTING tag is set to YES, doxygen will dump the program
+# listings (including syntax highlighting and cross-referencing information) to
+# the XML output. Note that enabling this will significantly increase the size
+# of the XML output.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_XML is set to YES.
+
+XML_PROGRAMLISTING     = YES
+
+# If the XML_NS_MEMB_FILE_SCOPE tag is set to YES, doxygen will include
+# namespace members in file scope as well, matching the HTML output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_XML is set to YES.
+
+XML_NS_MEMB_FILE_SCOPE = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the DOCBOOK output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_DOCBOOK tag is set to YES, doxygen will generate Docbook files
+# that can be used to generate PDF.
+# The default value is: NO.
+
+GENERATE_DOCBOOK       = NO
+
+# The DOCBOOK_OUTPUT tag is used to specify where the Docbook pages will be put.
+# If a relative path is entered the value of OUTPUT_DIRECTORY will be put in
+# front of it.
+# The default directory is: docbook.
+# This tag requires that the tag GENERATE_DOCBOOK is set to YES.
+
+DOCBOOK_OUTPUT         = docbook
+
+#---------------------------------------------------------------------------
+# Configuration options for the AutoGen Definitions output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_AUTOGEN_DEF tag is set to YES, doxygen will generate an
+# AutoGen Definitions (see http://autogen.sourceforge.net/) file that captures
+# the structure of the code including all documentation. Note that this feature
+# is still experimental and incomplete at the moment.
+# The default value is: NO.
+
+GENERATE_AUTOGEN_DEF   = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the Perl module output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_PERLMOD tag is set to YES, doxygen will generate a Perl module
+# file that captures the structure of the code including all documentation.
+#
+# Note that this feature is still experimental and incomplete at the moment.
+# The default value is: NO.
+
+GENERATE_PERLMOD       = NO
+
+# If the PERLMOD_LATEX tag is set to YES, doxygen will generate the necessary
+# Makefile rules, Perl scripts and LaTeX code to be able to generate PDF and DVI
+# output from the Perl module output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
+
+PERLMOD_LATEX          = NO
+
+# If the PERLMOD_PRETTY tag is set to YES, the Perl module output will be nicely
+# formatted so it can be parsed by a human reader. This is useful if you want to
+# understand what is going on. On the other hand, if this tag is set to NO, the
+# size of the Perl module output will be much smaller and Perl will parse it
+# just the same.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
+
+PERLMOD_PRETTY         = YES
+
+# The names of the make variables in the generated doxyrules.make file are
+# prefixed with the string contained in PERLMOD_MAKEVAR_PREFIX. This is useful
+# so different doxyrules.make files included by the same Makefile don't
+# overwrite each other's variables.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
+
+PERLMOD_MAKEVAR_PREFIX =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the preprocessor
+#---------------------------------------------------------------------------
+
+# If the ENABLE_PREPROCESSING tag is set to YES, doxygen will evaluate all
+# C-preprocessor directives found in the sources and include files.
+# The default value is: YES.
+
+ENABLE_PREPROCESSING   = YES
+
+# If the MACRO_EXPANSION tag is set to YES, doxygen will expand all macro names
+# in the source code. If set to NO, only conditional compilation will be
+# performed. Macro expansion can be done in a controlled way by setting
+# EXPAND_ONLY_PREDEF to YES.
+# The default value is: NO.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+MACRO_EXPANSION        = NO
+
+# If the EXPAND_ONLY_PREDEF and MACRO_EXPANSION tags are both set to YES then
+# the macro expansion is limited to the macros specified with the PREDEFINED and
+# EXPAND_AS_DEFINED tags.
+# The default value is: NO.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+EXPAND_ONLY_PREDEF     = NO
+
+# If the SEARCH_INCLUDES tag is set to YES, the include files in the
+# INCLUDE_PATH will be searched if a #include is found.
+# The default value is: YES.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+SEARCH_INCLUDES        = YES
+
+# The INCLUDE_PATH tag can be used to specify one or more directories that
+# contain include files that are not input files but should be processed by the
+# preprocessor. Note that the INCLUDE_PATH is not recursive, so the setting of
+# RECURSIVE has no effect here.
+# This tag requires that the tag SEARCH_INCLUDES is set to YES.
+
+INCLUDE_PATH           =
+
+# You can use the INCLUDE_FILE_PATTERNS tag to specify one or more wildcard
+# patterns (like *.h and *.hpp) to filter out the header-files in the
+# directories. If left blank, the patterns specified with FILE_PATTERNS will be
+# used.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+INCLUDE_FILE_PATTERNS  =
+
+# The PREDEFINED tag can be used to specify one or more macro names that are
+# defined before the preprocessor is started (similar to the -D option of e.g.
+# gcc). The argument of the tag is a list of macros of the form: name or
+# name=definition (no spaces). If the definition and the "=" are omitted, "=1"
+# is assumed. To prevent a macro definition from being undefined via #undef or
+# recursively expanded use the := operator instead of the = operator.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+PREDEFINED             =
+
+# If the MACRO_EXPANSION and EXPAND_ONLY_PREDEF tags are set to YES then this
+# tag can be used to specify a list of macro names that should be expanded. The
+# macro definition that is found in the sources will be used. Use the PREDEFINED
+# tag if you want to use a different macro definition that overrules the
+# definition found in the source code.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+EXPAND_AS_DEFINED      =
+
+# If the SKIP_FUNCTION_MACROS tag is set to YES then doxygen's preprocessor will
+# remove all references to function-like macros that are alone on a line, have
+# an all uppercase name, and do not end with a semicolon. Such function macros
+# are typically used for boiler-plate code, and will confuse the parser if not
+# removed.
+# The default value is: YES.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+SKIP_FUNCTION_MACROS   = YES
+
+#---------------------------------------------------------------------------
+# Configuration options related to external references
+#---------------------------------------------------------------------------
+
+# The TAGFILES tag can be used to specify one or more tag files. For each tag
+# file the location of the external documentation should be added. The format of
+# a tag file without this location is as follows:
+# TAGFILES = file1 file2 ...
+# Adding location for the tag files is done as follows:
+# TAGFILES = file1=loc1 "file2 = loc2" ...
+# where loc1 and loc2 can be relative or absolute paths or URLs. See the
+# section "Linking to external documentation" for more information about the use
+# of tag files.
+# Note: Each tag file must have a unique name (where the name does NOT include
+# the path). If a tag file is not located in the directory in which doxygen is
+# run, you must also specify the path to the tagfile here.
+
+TAGFILES               =
+
+# When a file name is specified after GENERATE_TAGFILE, doxygen will create a
+# tag file that is based on the input files it reads. See section "Linking to
+# external documentation" for more information about the usage of tag files.
+
+GENERATE_TAGFILE       =
+
+# If the ALLEXTERNALS tag is set to YES, all external class will be listed in
+# the class index. If set to NO, only the inherited external classes will be
+# listed.
+# The default value is: NO.
+
+ALLEXTERNALS           = NO
+
+# If the EXTERNAL_GROUPS tag is set to YES, all external groups will be listed
+# in the modules index. If set to NO, only the current project's groups will be
+# listed.
+# The default value is: YES.
+
+EXTERNAL_GROUPS        = YES
+
+# If the EXTERNAL_PAGES tag is set to YES, all external pages will be listed in
+# the related pages index. If set to NO, only the current project's pages will
+# be listed.
+# The default value is: YES.
+
+EXTERNAL_PAGES         = YES
+
+#---------------------------------------------------------------------------
+# Configuration options related to the dot tool
+#---------------------------------------------------------------------------
+
+# You can include diagrams made with dia in doxygen documentation. Doxygen will
+# then run dia to produce the diagram and insert it in the documentation. The
+# DIA_PATH tag allows you to specify the directory where the dia binary resides.
+# If left empty dia is assumed to be found in the default search path.
+
+DIA_PATH               =
+
+# If set to YES the inheritance and collaboration graphs will hide inheritance
+# and usage relations if the target is undocumented or is not a class.
+# The default value is: YES.
+
+HIDE_UNDOC_RELATIONS   = YES
+
+# If you set the HAVE_DOT tag to YES then doxygen will assume the dot tool is
+# available from the path. This tool is part of Graphviz (see:
+# http://www.graphviz.org/), a graph visualization toolkit from AT&T and Lucent
+# Bell Labs. The other options in this section have no effect if this option is
+# set to NO
+# The default value is: NO.
+
+HAVE_DOT               = NO
+
+# The DOT_NUM_THREADS specifies the number of dot invocations doxygen is allowed
+# to run in parallel. When set to 0 doxygen will base this on the number of
+# processors available in the system. You can set it explicitly to a value
+# larger than 0 to get control over the balance between CPU load and processing
+# speed.
+# Minimum value: 0, maximum value: 32, default value: 0.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_NUM_THREADS        = 0
+
+# DOT_COMMON_ATTR is common attributes for nodes, edges and labels of
+# subgraphs. When you want a differently looking font in the dot files that
+# doxygen generates you can specify fontname, fontcolor and fontsize attributes.
+# For details please see <a href=https://graphviz.org/doc/info/attrs.html>Node,
+# Edge and Graph Attributes specification</a> You need to make sure dot is able
+# to find the font, which can be done by putting it in a standard location or by
+# setting the DOTFONTPATH environment variable or by setting DOT_FONTPATH to the
+# directory containing the font. Default graphviz fontsize is 14.
+# The default value is: fontname=Helvetica,fontsize=10.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_COMMON_ATTR        = "fontname=Helvetica,fontsize=10"
+
+# DOT_EDGE_ATTR is concatenated with DOT_COMMON_ATTR. For elegant style you can
+# add 'arrowhead=open, arrowtail=open, arrowsize=0.5'. <a
+# href=https://graphviz.org/doc/info/arrows.html>Complete documentation about
+# arrows shapes.</a>
+# The default value is: labelfontname=Helvetica,labelfontsize=10.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_EDGE_ATTR          = "labelfontname=Helvetica,labelfontsize=10"
+
+# DOT_NODE_ATTR is concatenated with DOT_COMMON_ATTR. For view without boxes
+# around nodes set 'shape=plain' or 'shape=plaintext' <a
+# href=https://www.graphviz.org/doc/info/shapes.html>Shapes specification</a>
+# The default value is: shape=box,height=0.2,width=0.4.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_NODE_ATTR          = "shape=box,height=0.2,width=0.4"
+
+# You can set the path where dot can find font specified with fontname in
+# DOT_COMMON_ATTR and others dot attributes.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTPATH           =
+
+# If the CLASS_GRAPH tag is set to YES (or GRAPH) then doxygen will generate a
+# graph for each documented class showing the direct and indirect inheritance
+# relations. In case HAVE_DOT is set as well dot will be used to draw the graph,
+# otherwise the built-in generator will be used. If the CLASS_GRAPH tag is set
+# to TEXT the direct and indirect inheritance relations will be shown as texts /
+# links.
+# Possible values are: NO, YES, TEXT and GRAPH.
+# The default value is: YES.
+
+CLASS_GRAPH            = YES
+
+# If the COLLABORATION_GRAPH tag is set to YES then doxygen will generate a
+# graph for each documented class showing the direct and indirect implementation
+# dependencies (inheritance, containment, and class references variables) of the
+# class with other documented classes.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+COLLABORATION_GRAPH    = YES
+
+# If the GROUP_GRAPHS tag is set to YES then doxygen will generate a graph for
+# groups, showing the direct groups dependencies. See also the chapter Grouping
+# in the manual.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GROUP_GRAPHS           = YES
+
+# If the UML_LOOK tag is set to YES, doxygen will generate inheritance and
+# collaboration diagrams in a style similar to the OMG's Unified Modeling
+# Language.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+UML_LOOK               = NO
+
+# If the UML_LOOK tag is enabled, the fields and methods are shown inside the
+# class node. If there are many fields or methods and many nodes the graph may
+# become too big to be useful. The UML_LIMIT_NUM_FIELDS threshold limits the
+# number of items for each type to make the size more manageable. Set this to 0
+# for no limit. Note that the threshold may be exceeded by 50% before the limit
+# is enforced. So when you set the threshold to 10, up to 15 fields may appear,
+# but if the number exceeds 15, the total amount of fields shown is limited to
+# 10.
+# Minimum value: 0, maximum value: 100, default value: 10.
+# This tag requires that the tag UML_LOOK is set to YES.
+
+UML_LIMIT_NUM_FIELDS   = 10
+
+# If the DOT_UML_DETAILS tag is set to NO, doxygen will show attributes and
+# methods without types and arguments in the UML graphs. If the DOT_UML_DETAILS
+# tag is set to YES, doxygen will add type and arguments for attributes and
+# methods in the UML graphs. If the DOT_UML_DETAILS tag is set to NONE, doxygen
+# will not generate fields with class member information in the UML graphs. The
+# class diagrams will look similar to the default class diagrams but using UML
+# notation for the relationships.
+# Possible values are: NO, YES and NONE.
+# The default value is: NO.
+# This tag requires that the tag UML_LOOK is set to YES.
+
+DOT_UML_DETAILS        = NO
+
+# The DOT_WRAP_THRESHOLD tag can be used to set the maximum number of characters
+# to display on a single line. If the actual line length exceeds this threshold
+# significantly it will wrapped across multiple lines. Some heuristics are apply
+# to avoid ugly line breaks.
+# Minimum value: 0, maximum value: 1000, default value: 17.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_WRAP_THRESHOLD     = 17
+
+# If the TEMPLATE_RELATIONS tag is set to YES then the inheritance and
+# collaboration graphs will show the relations between templates and their
+# instances.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+TEMPLATE_RELATIONS     = NO
+
+# If the INCLUDE_GRAPH, ENABLE_PREPROCESSING and SEARCH_INCLUDES tags are set to
+# YES then doxygen will generate a graph for each documented file showing the
+# direct and indirect include dependencies of the file with other documented
+# files.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INCLUDE_GRAPH          = YES
+
+# If the INCLUDED_BY_GRAPH, ENABLE_PREPROCESSING and SEARCH_INCLUDES tags are
+# set to YES then doxygen will generate a graph for each documented file showing
+# the direct and indirect include dependencies of the file with other documented
+# files.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INCLUDED_BY_GRAPH      = YES
+
+# If the CALL_GRAPH tag is set to YES then doxygen will generate a call
+# dependency graph for every global function or class method.
+#
+# Note that enabling this option will significantly increase the time of a run.
+# So in most cases it will be better to enable call graphs for selected
+# functions only using the \callgraph command. Disabling a call graph can be
+# accomplished by means of the command \hidecallgraph.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CALL_GRAPH             = NO
+
+# If the CALLER_GRAPH tag is set to YES then doxygen will generate a caller
+# dependency graph for every global function or class method.
+#
+# Note that enabling this option will significantly increase the time of a run.
+# So in most cases it will be better to enable caller graphs for selected
+# functions only using the \callergraph command. Disabling a caller graph can be
+# accomplished by means of the command \hidecallergraph.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CALLER_GRAPH           = NO
+
+# If the GRAPHICAL_HIERARCHY tag is set to YES then doxygen will graphical
+# hierarchy of all classes instead of a textual one.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GRAPHICAL_HIERARCHY    = YES
+
+# If the DIRECTORY_GRAPH tag is set to YES then doxygen will show the
+# dependencies a directory has on other directories in a graphical way. The
+# dependency relations are determined by the #include relations between the
+# files in the directories.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DIRECTORY_GRAPH        = YES
+
+# The DIR_GRAPH_MAX_DEPTH tag can be used to limit the maximum number of levels
+# of child directories generated in directory dependency graphs by dot.
+# Minimum value: 1, maximum value: 25, default value: 1.
+# This tag requires that the tag DIRECTORY_GRAPH is set to YES.
+
+DIR_GRAPH_MAX_DEPTH    = 1
+
+# The DOT_IMAGE_FORMAT tag can be used to set the image format of the images
+# generated by dot. For an explanation of the image formats see the section
+# output formats in the documentation of the dot tool (Graphviz (see:
+# http://www.graphviz.org/)).
+# Note: If you choose svg you need to set HTML_FILE_EXTENSION to xhtml in order
+# to make the SVG files visible in IE 9+ (other browsers do not have this
+# requirement).
+# Possible values are: png, jpg, gif, svg, png:gd, png:gd:gd, png:cairo,
+# png:cairo:gd, png:cairo:cairo, png:cairo:gdiplus, png:gdiplus and
+# png:gdiplus:gdiplus.
+# The default value is: png.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_IMAGE_FORMAT       = png
+
+# If DOT_IMAGE_FORMAT is set to svg, then this option can be set to YES to
+# enable generation of interactive SVG images that allow zooming and panning.
+#
+# Note that this requires a modern browser other than Internet Explorer. Tested
+# and working are Firefox, Chrome, Safari, and Opera.
+# Note: For IE 9+ you need to set HTML_FILE_EXTENSION to xhtml in order to make
+# the SVG files visible. Older versions of IE do not have SVG support.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INTERACTIVE_SVG        = NO
+
+# The DOT_PATH tag can be used to specify the path where the dot tool can be
+# found. If left blank, it is assumed the dot tool can be found in the path.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_PATH               =
+
+# The DOTFILE_DIRS tag can be used to specify one or more directories that
+# contain dot files that are included in the documentation (see the \dotfile
+# command).
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOTFILE_DIRS           =
+
+# The MSCFILE_DIRS tag can be used to specify one or more directories that
+# contain msc files that are included in the documentation (see the \mscfile
+# command).
+
+MSCFILE_DIRS           =
+
+# The DIAFILE_DIRS tag can be used to specify one or more directories that
+# contain dia files that are included in the documentation (see the \diafile
+# command).
+
+DIAFILE_DIRS           =
+
+# When using plantuml, the PLANTUML_JAR_PATH tag should be used to specify the
+# path where java can find the plantuml.jar file or to the filename of jar file
+# to be used. If left blank, it is assumed PlantUML is not used or called during
+# a preprocessing step. Doxygen will generate a warning when it encounters a
+# \startuml command in this case and will not generate output for the diagram.
+
+PLANTUML_JAR_PATH      =
+
+# When using plantuml, the PLANTUML_CFG_FILE tag can be used to specify a
+# configuration file for plantuml.
+
+PLANTUML_CFG_FILE      =
+
+# When using plantuml, the specified paths are searched for files specified by
+# the !include statement in a plantuml block.
+
+PLANTUML_INCLUDE_PATH  =
+
+# The DOT_GRAPH_MAX_NODES tag can be used to set the maximum number of nodes
+# that will be shown in the graph. If the number of nodes in a graph becomes
+# larger than this value, doxygen will truncate the graph, which is visualized
+# by representing a node as a red box. Note that doxygen if the number of direct
+# children of the root node in a graph is already larger than
+# DOT_GRAPH_MAX_NODES then the graph will not be shown at all. Also note that
+# the size of a graph can be further restricted by MAX_DOT_GRAPH_DEPTH.
+# Minimum value: 0, maximum value: 10000, default value: 50.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_GRAPH_MAX_NODES    = 50
+
+# The MAX_DOT_GRAPH_DEPTH tag can be used to set the maximum depth of the graphs
+# generated by dot. A depth value of 3 means that only nodes reachable from the
+# root by following a path via at most 3 edges will be shown. Nodes that lay
+# further from the root node will be omitted. Note that setting this option to 1
+# or 2 may greatly reduce the computation time needed for large code bases. Also
+# note that the size of a graph can be further restricted by
+# DOT_GRAPH_MAX_NODES. Using a depth of 0 means no depth restriction.
+# Minimum value: 0, maximum value: 1000, default value: 0.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+MAX_DOT_GRAPH_DEPTH    = 0
+
+# Set the DOT_MULTI_TARGETS tag to YES to allow dot to generate multiple output
+# files in one run (i.e. multiple -o and -T options on the command line). This
+# makes dot run faster, but since only newer versions of dot (>1.8.10) support
+# this, this feature is disabled by default.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_MULTI_TARGETS      = NO
+
+# If the GENERATE_LEGEND tag is set to YES doxygen will generate a legend page
+# explaining the meaning of the various boxes and arrows in the dot generated
+# graphs.
+# Note: This tag requires that UML_LOOK isn't set, i.e. the doxygen internal
+# graphical representation for inheritance and collaboration diagrams is used.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GENERATE_LEGEND        = YES
+
+# If the DOT_CLEANUP tag is set to YES, doxygen will remove the intermediate
+# files that are used to generate the various graphs.
+#
+# Note: This setting is not only used for dot files but also for msc temporary
+# files.
+# The default value is: YES.
+
+DOT_CLEANUP            = YES
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/doc/list.txt b/TIIGER_TLS/PQ_TIIGER_TLS/doc/list.txt
new file mode 100644
index 0000000..f659232
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/doc/list.txt
@@ -0,0 +1,27 @@
+
+			Allow early data	Extra Certs in Chain	Resumes Server SSL Labs Report  Arduino RP2040
+www.bbc.co.uk			No			Yes		  Yes		B		OK
+www.protonmail.com		No			Yes		  Yes 		A+		OK
+www.miracl.com			No			Yes               Yes		A+		OK
+www.facebook.com		No			No		  Yes		B		OK
+tls13.ulfheim.net		No			Yes		  Yes		A+		OK
+tls13.cloudfare.com		No			No		  Yes		B		Rare fails on ECC608?
+www.google.com			No			Yes		  No	 (?)	B		OK
+slack.com			No			No                Yes		A+		OK
+owasp.org			No			No                Sometimes	A+		OK
+mozilla.org			No			Yes		  Sometimes	A		OK
+swifttls.org			Yes			Yes		  Yes		A		OK	
+tls13.1d.pw			No			Yes		  No		A		OK
+realpython.com                  Yes			No		  Yes		B		OK
+www.padok.fr                    Yes			No		  Yes		B		OK
+
+www.fitbit.com			No			Yes		  No		A		OK
+st.com				No			Yes		  Yes		A		OK
+www.academia.edu		Terrible Cert Chain! X+X+W+Y+Z-> ca ? Yes No		A+		No
+www.rsaconference.com		Yes			No		  Yes		B		OK
+blog.knowbe4.com		Yes			No		  Yes		B		OK
+ec.europa.eu			No			Yes		  No		B		OK
+www.crowdsupply.com		No			No		  Yes		A+		OK
+iscc2021.unipi.gr               Misconfigured cert chain ?		  No		B		No
+www.kinvaraskincare.com		Yes			Yes		  Yes		A		OK
+www.bundledocs.com		No			Yes		  No		A		OK
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/doc/refman.pdf b/TIIGER_TLS/PQ_TIIGER_TLS/doc/refman.pdf
new file mode 100644
index 0000000..8248d84
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/doc/refman.pdf
@@ -0,0 +1,61926 @@
+%PDF-1.5
+%ÐÔÅØ
+1 0 obj
+<< /S /GoTo /D (chapter.1) >>
+endobj
+4 0 obj
+(\376\377\0001\000\040\000T\000I\000I\000G\000E\000R\000\040\000T\000L\000S\000\040\000C\000+\000+)
+endobj
+5 0 obj
+<< /S /GoTo /D (section.1.1) >>
+endobj
+8 0 obj
+(\376\377\0001\000.\0001\000\040\000B\000u\000i\000l\000d\000i\000n\000g)
+endobj
+9 0 obj
+<< /S /GoTo /D (subsection.1.1.1) >>
+endobj
+12 0 obj
+(\376\377\0001\000.\0001\000.\0001\000\040\000M\000i\000r\000a\000c\000l)
+endobj
+13 0 obj
+<< /S /GoTo /D (subsection.1.1.2) >>
+endobj
+16 0 obj
+(\376\377\0001\000.\0001\000.\0002\000\040\000M\000i\000r\000a\000c\000l\000\040\000+\000\040\000L\000i\000b\000S\000o\000d\000i\000u\000m)
+endobj
+17 0 obj
+<< /S /GoTo /D (section.1.2) >>
+endobj
+20 0 obj
+(\376\377\0001\000.\0002\000\040\000T\000r\000y\000\040\000i\000t\000\040\000o\000u\000t)
+endobj
+21 0 obj
+<< /S /GoTo /D (subsection.1.2.1) >>
+endobj
+24 0 obj
+(\376\377\0001\000.\0002\000.\0001\000\040\000C\000l\000i\000e\000n\000t\000\040\000s\000i\000d\000e\000\040\000A\000u\000t\000h\000e\000n\000t\000i\000c\000a\000t\000i\000o\000n)
+endobj
+25 0 obj
+<< /S /GoTo /D (subsection.1.2.2) >>
+endobj
+28 0 obj
+(\376\377\0001\000.\0002\000.\0002\000\040\000T\000e\000s\000t\000i\000n\000g\000\040\000P\000r\000e\000-\000s\000h\000a\000r\000e\000d\000\040\000k\000e\000y\000s)
+endobj
+29 0 obj
+<< /S /GoTo /D (chapter.2) >>
+endobj
+32 0 obj
+(\376\377\0002\000\040\000C\000o\000n\000f\000i\000g\000u\000r\000e\000\040\000t\000h\000e\000\040\000A\000r\000d\000u\000i\000n\000o\000\040\000N\000a\000n\000o\000\040\000R\000P\0002\0000\0004\0000)
+endobj
+33 0 obj
+<< /S /GoTo /D (section.2.1) >>
+endobj
+36 0 obj
+(\376\377\0002\000.\0001\000\040\000B\000u\000i\000l\000d\000i\000n\000g\000\040\000t\000h\000e\000\040\000c\000l\000i\000e\000n\000t\000\040\000a\000p\000p\000l\000i\000c\000a\000t\000i\000o\000n\000\040\000o\000n\000\040\000t\000h\000e\000\040\000A\000r\000d\000u\000i\000n\000o\000\040\000N\000a\000n\000o\000\040\000R\000P\0002\0000\0004\0000\000\040\000b\000o\000a\000r\000d\000.)
+endobj
+37 0 obj
+<< /S /GoTo /D (chapter.3) >>
+endobj
+40 0 obj
+(\376\377\0003\000\040\000D\000a\000t\000a\000\040\000S\000t\000r\000u\000c\000t\000u\000r\000e\000\040\000I\000n\000d\000e\000x)
+endobj
+41 0 obj
+<< /S /GoTo /D (section.3.1) >>
+endobj
+44 0 obj
+(\376\377\0003\000.\0001\000\040\000D\000a\000t\000a\000\040\000S\000t\000r\000u\000c\000t\000u\000r\000e\000s)
+endobj
+45 0 obj
+<< /S /GoTo /D (chapter.4) >>
+endobj
+48 0 obj
+(\376\377\0004\000\040\000F\000i\000l\000e\000\040\000I\000n\000d\000e\000x)
+endobj
+49 0 obj
+<< /S /GoTo /D (section.4.1) >>
+endobj
+52 0 obj
+(\376\377\0004\000.\0001\000\040\000F\000i\000l\000e\000\040\000L\000i\000s\000t)
+endobj
+53 0 obj
+<< /S /GoTo /D (chapter.5) >>
+endobj
+56 0 obj
+(\376\377\0005\000\040\000D\000a\000t\000a\000\040\000S\000t\000r\000u\000c\000t\000u\000r\000e\000\040\000D\000o\000c\000u\000m\000e\000n\000t\000a\000t\000i\000o\000n)
+endobj
+57 0 obj
+<< /S /GoTo /D (section.5.1) >>
+endobj
+60 0 obj
+(\376\377\0005\000.\0001\000\040\000c\000r\000y\000p\000t\000o\000\040\000S\000t\000r\000u\000c\000t\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+61 0 obj
+<< /S /GoTo /D (subsection.5.1.1) >>
+endobj
+64 0 obj
+(\376\377\0005\000.\0001\000.\0001\000\040\000D\000e\000t\000a\000i\000l\000e\000d\000\040\000D\000e\000s\000c\000r\000i\000p\000t\000i\000o\000n)
+endobj
+65 0 obj
+<< /S /GoTo /D (subsection.5.1.2) >>
+endobj
+68 0 obj
+(\376\377\0005\000.\0001\000.\0002\000\040\000F\000i\000e\000l\000d\000\040\000D\000o\000c\000u\000m\000e\000n\000t\000a\000t\000i\000o\000n)
+endobj
+69 0 obj
+<< /S /GoTo /D (subsubsection.5.1.2.1) >>
+endobj
+72 0 obj
+(\376\377\0005\000.\0001\000.\0002\000.\0001\000\040\000a\000c\000t\000i\000v\000e)
+endobj
+73 0 obj
+<< /S /GoTo /D (subsubsection.5.1.2.2) >>
+endobj
+76 0 obj
+(\376\377\0005\000.\0001\000.\0002\000.\0002\000\040\000k)
+endobj
+77 0 obj
+<< /S /GoTo /D (subsubsection.5.1.2.3) >>
+endobj
+80 0 obj
+(\376\377\0005\000.\0001\000.\0002\000.\0003\000\040\000i\000v)
+endobj
+81 0 obj
+<< /S /GoTo /D (subsubsection.5.1.2.4) >>
+endobj
+84 0 obj
+(\376\377\0005\000.\0001\000.\0002\000.\0004\000\040\000K)
+endobj
+85 0 obj
+<< /S /GoTo /D (subsubsection.5.1.2.5) >>
+endobj
+88 0 obj
+(\376\377\0005\000.\0001\000.\0002\000.\0005\000\040\000I\000V)
+endobj
+89 0 obj
+<< /S /GoTo /D (subsubsection.5.1.2.6) >>
+endobj
+92 0 obj
+(\376\377\0005\000.\0001\000.\0002\000.\0006\000\040\000r\000e\000c\000o\000r\000d)
+endobj
+93 0 obj
+<< /S /GoTo /D (subsubsection.5.1.2.7) >>
+endobj
+96 0 obj
+(\376\377\0005\000.\0001\000.\0002\000.\0007\000\040\000s\000u\000i\000t\000e)
+endobj
+97 0 obj
+<< /S /GoTo /D (subsubsection.5.1.2.8) >>
+endobj
+100 0 obj
+(\376\377\0005\000.\0001\000.\0002\000.\0008\000\040\000t\000a\000g\000l\000e\000n)
+endobj
+101 0 obj
+<< /S /GoTo /D (section.5.2) >>
+endobj
+104 0 obj
+(\376\377\0005\000.\0002\000\040\000E\000C\000C\000X\0000\0008\000C\000l\000a\000s\000s\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+105 0 obj
+<< /S /GoTo /D (section.5.3) >>
+endobj
+108 0 obj
+(\376\377\0005\000.\0003\000\040\000e\000e\000\137\000s\000t\000a\000t\000u\000s\000\040\000S\000t\000r\000u\000c\000t\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+109 0 obj
+<< /S /GoTo /D (subsection.5.3.1) >>
+endobj
+112 0 obj
+(\376\377\0005\000.\0003\000.\0001\000\040\000D\000e\000t\000a\000i\000l\000e\000d\000\040\000D\000e\000s\000c\000r\000i\000p\000t\000i\000o\000n)
+endobj
+113 0 obj
+<< /S /GoTo /D (subsection.5.3.2) >>
+endobj
+116 0 obj
+(\376\377\0005\000.\0003\000.\0002\000\040\000F\000i\000e\000l\000d\000\040\000D\000o\000c\000u\000m\000e\000n\000t\000a\000t\000i\000o\000n)
+endobj
+117 0 obj
+<< /S /GoTo /D (subsubsection.5.3.2.1) >>
+endobj
+120 0 obj
+(\376\377\0005\000.\0003\000.\0002\000.\0001\000\040\000e\000a\000r\000l\000y\000\137\000d\000a\000t\000a)
+endobj
+121 0 obj
+<< /S /GoTo /D (subsubsection.5.3.2.2) >>
+endobj
+124 0 obj
+(\376\377\0005\000.\0003\000.\0002\000.\0002\000\040\000a\000l\000p\000n)
+endobj
+125 0 obj
+<< /S /GoTo /D (subsubsection.5.3.2.3) >>
+endobj
+128 0 obj
+(\376\377\0005\000.\0003\000.\0002\000.\0003\000\040\000s\000e\000r\000v\000e\000r\000\137\000n\000a\000m\000e)
+endobj
+129 0 obj
+<< /S /GoTo /D (subsubsection.5.3.2.4) >>
+endobj
+132 0 obj
+(\376\377\0005\000.\0003\000.\0002\000.\0004\000\040\000m\000a\000x\000\137\000f\000r\000a\000g\000\137\000l\000e\000n\000g\000t\000h)
+endobj
+133 0 obj
+<< /S /GoTo /D (section.5.4) >>
+endobj
+136 0 obj
+(\376\377\0005\000.\0004\000\040\000o\000c\000t\000a\000d\000\040\000S\000t\000r\000u\000c\000t\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+137 0 obj
+<< /S /GoTo /D (subsection.5.4.1) >>
+endobj
+140 0 obj
+(\376\377\0005\000.\0004\000.\0001\000\040\000D\000e\000t\000a\000i\000l\000e\000d\000\040\000D\000e\000s\000c\000r\000i\000p\000t\000i\000o\000n)
+endobj
+141 0 obj
+<< /S /GoTo /D (subsection.5.4.2) >>
+endobj
+144 0 obj
+(\376\377\0005\000.\0004\000.\0002\000\040\000F\000i\000e\000l\000d\000\040\000D\000o\000c\000u\000m\000e\000n\000t\000a\000t\000i\000o\000n)
+endobj
+145 0 obj
+<< /S /GoTo /D (subsubsection.5.4.2.1) >>
+endobj
+148 0 obj
+(\376\377\0005\000.\0004\000.\0002\000.\0001\000\040\000l\000e\000n)
+endobj
+149 0 obj
+<< /S /GoTo /D (subsubsection.5.4.2.2) >>
+endobj
+152 0 obj
+(\376\377\0005\000.\0004\000.\0002\000.\0002\000\040\000m\000a\000x)
+endobj
+153 0 obj
+<< /S /GoTo /D (subsubsection.5.4.2.3) >>
+endobj
+156 0 obj
+(\376\377\0005\000.\0004\000.\0002\000.\0003\000\040\000v\000a\000l)
+endobj
+157 0 obj
+<< /S /GoTo /D (section.5.5) >>
+endobj
+160 0 obj
+(\376\377\0005\000.\0005\000\040\000p\000k\000t\000y\000p\000e\000\040\000S\000t\000r\000u\000c\000t\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+161 0 obj
+<< /S /GoTo /D (subsection.5.5.1) >>
+endobj
+164 0 obj
+(\376\377\0005\000.\0005\000.\0001\000\040\000D\000e\000t\000a\000i\000l\000e\000d\000\040\000D\000e\000s\000c\000r\000i\000p\000t\000i\000o\000n)
+endobj
+165 0 obj
+<< /S /GoTo /D (subsection.5.5.2) >>
+endobj
+168 0 obj
+(\376\377\0005\000.\0005\000.\0002\000\040\000F\000i\000e\000l\000d\000\040\000D\000o\000c\000u\000m\000e\000n\000t\000a\000t\000i\000o\000n)
+endobj
+169 0 obj
+<< /S /GoTo /D (subsubsection.5.5.2.1) >>
+endobj
+172 0 obj
+(\376\377\0005\000.\0005\000.\0002\000.\0001\000\040\000t\000y\000p\000e)
+endobj
+173 0 obj
+<< /S /GoTo /D (subsubsection.5.5.2.2) >>
+endobj
+176 0 obj
+(\376\377\0005\000.\0005\000.\0002\000.\0002\000\040\000h\000a\000s\000h)
+endobj
+177 0 obj
+<< /S /GoTo /D (subsubsection.5.5.2.3) >>
+endobj
+180 0 obj
+(\376\377\0005\000.\0005\000.\0002\000.\0003\000\040\000c\000u\000r\000v\000e)
+endobj
+181 0 obj
+<< /S /GoTo /D (section.5.6) >>
+endobj
+184 0 obj
+(\376\377\0005\000.\0006\000\040\000r\000e\000t\000\040\000S\000t\000r\000u\000c\000t\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+185 0 obj
+<< /S /GoTo /D (subsection.5.6.1) >>
+endobj
+188 0 obj
+(\376\377\0005\000.\0006\000.\0001\000\040\000D\000e\000t\000a\000i\000l\000e\000d\000\040\000D\000e\000s\000c\000r\000i\000p\000t\000i\000o\000n)
+endobj
+189 0 obj
+<< /S /GoTo /D (subsection.5.6.2) >>
+endobj
+192 0 obj
+(\376\377\0005\000.\0006\000.\0002\000\040\000F\000i\000e\000l\000d\000\040\000D\000o\000c\000u\000m\000e\000n\000t\000a\000t\000i\000o\000n)
+endobj
+193 0 obj
+<< /S /GoTo /D (subsubsection.5.6.2.1) >>
+endobj
+196 0 obj
+(\376\377\0005\000.\0006\000.\0002\000.\0001\000\040\000v\000a\000l)
+endobj
+197 0 obj
+<< /S /GoTo /D (subsubsection.5.6.2.2) >>
+endobj
+200 0 obj
+(\376\377\0005\000.\0006\000.\0002\000.\0002\000\040\000e\000r\000r)
+endobj
+201 0 obj
+<< /S /GoTo /D (section.5.7) >>
+endobj
+204 0 obj
+(\376\377\0005\000.\0007\000\040\000S\000o\000c\000k\000e\000t\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+205 0 obj
+<< /S /GoTo /D (subsection.5.7.1) >>
+endobj
+208 0 obj
+(\376\377\0005\000.\0007\000.\0001\000\040\000D\000e\000t\000a\000i\000l\000e\000d\000\040\000D\000e\000s\000c\000r\000i\000p\000t\000i\000o\000n)
+endobj
+209 0 obj
+<< /S /GoTo /D (section.5.8) >>
+endobj
+212 0 obj
+(\376\377\0005\000.\0008\000\040\000t\000i\000c\000k\000e\000t\000\040\000S\000t\000r\000u\000c\000t\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+213 0 obj
+<< /S /GoTo /D (subsection.5.8.1) >>
+endobj
+216 0 obj
+(\376\377\0005\000.\0008\000.\0001\000\040\000D\000e\000t\000a\000i\000l\000e\000d\000\040\000D\000e\000s\000c\000r\000i\000p\000t\000i\000o\000n)
+endobj
+217 0 obj
+<< /S /GoTo /D (subsection.5.8.2) >>
+endobj
+220 0 obj
+(\376\377\0005\000.\0008\000.\0002\000\040\000F\000i\000e\000l\000d\000\040\000D\000o\000c\000u\000m\000e\000n\000t\000a\000t\000i\000o\000n)
+endobj
+221 0 obj
+<< /S /GoTo /D (subsubsection.5.8.2.1) >>
+endobj
+224 0 obj
+(\376\377\0005\000.\0008\000.\0002\000.\0001\000\040\000v\000a\000l\000i\000d)
+endobj
+225 0 obj
+<< /S /GoTo /D (subsubsection.5.8.2.2) >>
+endobj
+228 0 obj
+(\376\377\0005\000.\0008\000.\0002\000.\0002\000\040\000t\000i\000c\000k)
+endobj
+229 0 obj
+<< /S /GoTo /D (subsubsection.5.8.2.3) >>
+endobj
+232 0 obj
+(\376\377\0005\000.\0008\000.\0002\000.\0003\000\040\000n\000o\000n\000c\000e)
+endobj
+233 0 obj
+<< /S /GoTo /D (subsubsection.5.8.2.4) >>
+endobj
+236 0 obj
+(\376\377\0005\000.\0008\000.\0002\000.\0004\000\040\000p\000s\000k)
+endobj
+237 0 obj
+<< /S /GoTo /D (subsubsection.5.8.2.5) >>
+endobj
+240 0 obj
+(\376\377\0005\000.\0008\000.\0002\000.\0005\000\040\000T\000I\000C\000K)
+endobj
+241 0 obj
+<< /S /GoTo /D (subsubsection.5.8.2.6) >>
+endobj
+244 0 obj
+(\376\377\0005\000.\0008\000.\0002\000.\0006\000\040\000N\000O\000N\000C\000E)
+endobj
+245 0 obj
+<< /S /GoTo /D (subsubsection.5.8.2.7) >>
+endobj
+248 0 obj
+(\376\377\0005\000.\0008\000.\0002\000.\0007\000\040\000P\000S\000K)
+endobj
+249 0 obj
+<< /S /GoTo /D (subsubsection.5.8.2.8) >>
+endobj
+252 0 obj
+(\376\377\0005\000.\0008\000.\0002\000.\0008\000\040\000a\000g\000e\000\137\000o\000b\000f\000u\000s\000c\000a\000t\000o\000r)
+endobj
+253 0 obj
+<< /S /GoTo /D (subsubsection.5.8.2.9) >>
+endobj
+256 0 obj
+(\376\377\0005\000.\0008\000.\0002\000.\0009\000\040\000m\000a\000x\000\137\000e\000a\000r\000l\000y\000\137\000d\000a\000t\000a)
+endobj
+257 0 obj
+<< /S /GoTo /D (subsubsection.5.8.2.10) >>
+endobj
+260 0 obj
+(\376\377\0005\000.\0008\000.\0002\000.\0001\0000\000\040\000b\000i\000r\000t\000h)
+endobj
+261 0 obj
+<< /S /GoTo /D (subsubsection.5.8.2.11) >>
+endobj
+264 0 obj
+(\376\377\0005\000.\0008\000.\0002\000.\0001\0001\000\040\000l\000i\000f\000e\000t\000i\000m\000e)
+endobj
+265 0 obj
+<< /S /GoTo /D (subsubsection.5.8.2.12) >>
+endobj
+268 0 obj
+(\376\377\0005\000.\0008\000.\0002\000.\0001\0002\000\040\000c\000i\000p\000h\000e\000r\000\137\000s\000u\000i\000t\000e)
+endobj
+269 0 obj
+<< /S /GoTo /D (subsubsection.5.8.2.13) >>
+endobj
+272 0 obj
+(\376\377\0005\000.\0008\000.\0002\000.\0001\0003\000\040\000f\000a\000v\000o\000u\000r\000i\000t\000e\000\137\000g\000r\000o\000u\000p)
+endobj
+273 0 obj
+<< /S /GoTo /D (subsubsection.5.8.2.14) >>
+endobj
+276 0 obj
+(\376\377\0005\000.\0008\000.\0002\000.\0001\0004\000\040\000o\000r\000i\000g\000i\000n)
+endobj
+277 0 obj
+<< /S /GoTo /D (section.5.9) >>
+endobj
+280 0 obj
+(\376\377\0005\000.\0009\000\040\000T\000L\000S\000\137\000s\000e\000s\000s\000i\000o\000n\000\040\000S\000t\000r\000u\000c\000t\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+281 0 obj
+<< /S /GoTo /D (subsection.5.9.1) >>
+endobj
+284 0 obj
+(\376\377\0005\000.\0009\000.\0001\000\040\000D\000e\000t\000a\000i\000l\000e\000d\000\040\000D\000e\000s\000c\000r\000i\000p\000t\000i\000o\000n)
+endobj
+285 0 obj
+<< /S /GoTo /D (subsection.5.9.2) >>
+endobj
+288 0 obj
+(\376\377\0005\000.\0009\000.\0002\000\040\000F\000i\000e\000l\000d\000\040\000D\000o\000c\000u\000m\000e\000n\000t\000a\000t\000i\000o\000n)
+endobj
+289 0 obj
+<< /S /GoTo /D (subsubsection.5.9.2.1) >>
+endobj
+292 0 obj
+(\376\377\0005\000.\0009\000.\0002\000.\0001\000\040\000s\000t\000a\000t\000u\000s)
+endobj
+293 0 obj
+<< /S /GoTo /D (subsubsection.5.9.2.2) >>
+endobj
+296 0 obj
+(\376\377\0005\000.\0009\000.\0002\000.\0002\000\040\000m\000a\000x\000\137\000r\000e\000c\000o\000r\000d)
+endobj
+297 0 obj
+<< /S /GoTo /D (subsubsection.5.9.2.3) >>
+endobj
+300 0 obj
+(\376\377\0005\000.\0009\000.\0002\000.\0003\000\040\000s\000o\000c\000k\000p\000t\000r)
+endobj
+301 0 obj
+<< /S /GoTo /D (subsubsection.5.9.2.4) >>
+endobj
+304 0 obj
+(\376\377\0005\000.\0009\000.\0002\000.\0004\000\040\000i\000d)
+endobj
+305 0 obj
+<< /S /GoTo /D (subsubsection.5.9.2.5) >>
+endobj
+308 0 obj
+(\376\377\0005\000.\0009\000.\0002\000.\0005\000\040\000h\000o\000s\000t\000n\000a\000m\000e)
+endobj
+309 0 obj
+<< /S /GoTo /D (subsubsection.5.9.2.6) >>
+endobj
+312 0 obj
+(\376\377\0005\000.\0009\000.\0002\000.\0006\000\040\000c\000i\000p\000h\000e\000r\000\137\000s\000u\000i\000t\000e)
+endobj
+313 0 obj
+<< /S /GoTo /D (subsubsection.5.9.2.7) >>
+endobj
+316 0 obj
+(\376\377\0005\000.\0009\000.\0002\000.\0007\000\040\000f\000a\000v\000o\000u\000r\000i\000t\000e\000\137\000g\000r\000o\000u\000p)
+endobj
+317 0 obj
+<< /S /GoTo /D (subsubsection.5.9.2.8) >>
+endobj
+320 0 obj
+(\376\377\0005\000.\0009\000.\0002\000.\0008\000\040\000s\000e\000r\000v\000e\000r\000\137\000c\000e\000r\000t\000\137\000t\000y\000p\000e)
+endobj
+321 0 obj
+<< /S /GoTo /D (subsubsection.5.9.2.9) >>
+endobj
+324 0 obj
+(\376\377\0005\000.\0009\000.\0002\000.\0009\000\040\000c\000l\000i\000e\000n\000t\000\137\000c\000e\000r\000t\000\137\000t\000y\000p\000e)
+endobj
+325 0 obj
+<< /S /GoTo /D (subsubsection.5.9.2.10) >>
+endobj
+328 0 obj
+(\376\377\0005\000.\0009\000.\0002\000.\0001\0000\000\040\000K\000\137\000s\000e\000n\000d)
+endobj
+329 0 obj
+<< /S /GoTo /D (subsubsection.5.9.2.11) >>
+endobj
+332 0 obj
+(\376\377\0005\000.\0009\000.\0002\000.\0001\0001\000\040\000K\000\137\000r\000e\000c\000v)
+endobj
+333 0 obj
+<< /S /GoTo /D (subsubsection.5.9.2.12) >>
+endobj
+336 0 obj
+(\376\377\0005\000.\0009\000.\0002\000.\0001\0002\000\040\000H\000S)
+endobj
+337 0 obj
+<< /S /GoTo /D (subsubsection.5.9.2.13) >>
+endobj
+340 0 obj
+(\376\377\0005\000.\0009\000.\0002\000.\0001\0003\000\040\000h\000s)
+endobj
+341 0 obj
+<< /S /GoTo /D (subsubsection.5.9.2.14) >>
+endobj
+344 0 obj
+(\376\377\0005\000.\0009\000.\0002\000.\0001\0004\000\040\000R\000M\000S)
+endobj
+345 0 obj
+<< /S /GoTo /D (subsubsection.5.9.2.15) >>
+endobj
+348 0 obj
+(\376\377\0005\000.\0009\000.\0002\000.\0001\0005\000\040\000r\000m\000s)
+endobj
+349 0 obj
+<< /S /GoTo /D (subsubsection.5.9.2.16) >>
+endobj
+352 0 obj
+(\376\377\0005\000.\0009\000.\0002\000.\0001\0006\000\040\000S\000T\000S)
+endobj
+353 0 obj
+<< /S /GoTo /D (subsubsection.5.9.2.17) >>
+endobj
+356 0 obj
+(\376\377\0005\000.\0009\000.\0002\000.\0001\0007\000\040\000s\000t\000s)
+endobj
+357 0 obj
+<< /S /GoTo /D (subsubsection.5.9.2.18) >>
+endobj
+360 0 obj
+(\376\377\0005\000.\0009\000.\0002\000.\0001\0008\000\040\000C\000T\000S)
+endobj
+361 0 obj
+<< /S /GoTo /D (subsubsection.5.9.2.19) >>
+endobj
+364 0 obj
+(\376\377\0005\000.\0009\000.\0002\000.\0001\0009\000\040\000c\000t\000s)
+endobj
+365 0 obj
+<< /S /GoTo /D (subsubsection.5.9.2.20) >>
+endobj
+368 0 obj
+(\376\377\0005\000.\0009\000.\0002\000.\0002\0000\000\040\000C\000T\000X)
+endobj
+369 0 obj
+<< /S /GoTo /D (subsubsection.5.9.2.21) >>
+endobj
+372 0 obj
+(\376\377\0005\000.\0009\000.\0002\000.\0002\0001\000\040\000c\000t\000x)
+endobj
+373 0 obj
+<< /S /GoTo /D (subsubsection.5.9.2.22) >>
+endobj
+376 0 obj
+(\376\377\0005\000.\0009\000.\0002\000.\0002\0002\000\040\000I\000B\000U\000F\000F)
+endobj
+377 0 obj
+<< /S /GoTo /D (subsubsection.5.9.2.23) >>
+endobj
+380 0 obj
+(\376\377\0005\000.\0009\000.\0002\000.\0002\0003\000\040\000O\000B\000U\000F\000F)
+endobj
+381 0 obj
+<< /S /GoTo /D (subsubsection.5.9.2.24) >>
+endobj
+384 0 obj
+(\376\377\0005\000.\0009\000.\0002\000.\0002\0004\000\040\000i\000b\000u\000f\000f)
+endobj
+385 0 obj
+<< /S /GoTo /D (subsubsection.5.9.2.25) >>
+endobj
+388 0 obj
+(\376\377\0005\000.\0009\000.\0002\000.\0002\0005\000\040\000o\000b\000u\000f\000f)
+endobj
+389 0 obj
+<< /S /GoTo /D (subsubsection.5.9.2.26) >>
+endobj
+392 0 obj
+(\376\377\0005\000.\0009\000.\0002\000.\0002\0006\000\040\000p\000t\000r)
+endobj
+393 0 obj
+<< /S /GoTo /D (subsubsection.5.9.2.27) >>
+endobj
+396 0 obj
+(\376\377\0005\000.\0009\000.\0002\000.\0002\0007\000\040\000t\000l\000s\000h\000a\000s\000h)
+endobj
+397 0 obj
+<< /S /GoTo /D (subsubsection.5.9.2.28) >>
+endobj
+400 0 obj
+(\376\377\0005\000.\0009\000.\0002\000.\0002\0008\000\040\000T)
+endobj
+401 0 obj
+<< /S /GoTo /D (section.5.10) >>
+endobj
+404 0 obj
+(\376\377\0005\000.\0001\0000\000\040\000u\000n\000i\000h\000a\000s\000h\000\040\000S\000t\000r\000u\000c\000t\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+405 0 obj
+<< /S /GoTo /D (subsection.5.10.1) >>
+endobj
+408 0 obj
+(\376\377\0005\000.\0001\0000\000.\0001\000\040\000D\000e\000t\000a\000i\000l\000e\000d\000\040\000D\000e\000s\000c\000r\000i\000p\000t\000i\000o\000n)
+endobj
+409 0 obj
+<< /S /GoTo /D (subsection.5.10.2) >>
+endobj
+412 0 obj
+(\376\377\0005\000.\0001\0000\000.\0002\000\040\000F\000i\000e\000l\000d\000\040\000D\000o\000c\000u\000m\000e\000n\000t\000a\000t\000i\000o\000n)
+endobj
+413 0 obj
+<< /S /GoTo /D (subsubsection.5.10.2.1) >>
+endobj
+416 0 obj
+(\376\377\0005\000.\0001\0000\000.\0002\000.\0001\000\040\000s\000t\000a\000t\000e)
+endobj
+417 0 obj
+<< /S /GoTo /D (subsubsection.5.10.2.2) >>
+endobj
+420 0 obj
+(\376\377\0005\000.\0001\0000\000.\0002\000.\0002\000\040\000h\000t\000y\000p\000e)
+endobj
+421 0 obj
+<< /S /GoTo /D (chapter.6) >>
+endobj
+424 0 obj
+(\376\377\0006\000\040\000F\000i\000l\000e\000\040\000D\000o\000c\000u\000m\000e\000n\000t\000a\000t\000i\000o\000n)
+endobj
+425 0 obj
+<< /S /GoTo /D (section.6.1) >>
+endobj
+428 0 obj
+(\376\377\0006\000.\0001\000\040\000t\000l\000s\0001\000\137\0003\000.\000h\000\040\000F\000i\000l\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+429 0 obj
+<< /S /GoTo /D (subsection.6.1.1) >>
+endobj
+432 0 obj
+(\376\377\0006\000.\0001\000.\0001\000\040\000D\000e\000t\000a\000i\000l\000e\000d\000\040\000D\000e\000s\000c\000r\000i\000p\000t\000i\000o\000n)
+endobj
+433 0 obj
+<< /S /GoTo /D (subsection.6.1.2) >>
+endobj
+436 0 obj
+(\376\377\0006\000.\0001\000.\0002\000\040\000M\000a\000c\000r\000o\000\040\000D\000e\000f\000i\000n\000i\000t\000i\000o\000n\000\040\000D\000o\000c\000u\000m\000e\000n\000t\000a\000t\000i\000o\000n)
+endobj
+437 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.1) >>
+endobj
+440 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0001\000\040\000I\000O\000\137\000N\000O\000N\000E)
+endobj
+441 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.2) >>
+endobj
+444 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0002\000\040\000I\000O\000\137\000A\000P\000P\000L\000I\000C\000A\000T\000I\000O\000N)
+endobj
+445 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.3) >>
+endobj
+448 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0003\000\040\000I\000O\000\137\000P\000R\000O\000T\000O\000C\000O\000L)
+endobj
+449 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.4) >>
+endobj
+452 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0004\000\040\000I\000O\000\137\000D\000E\000B\000U\000G)
+endobj
+453 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.5) >>
+endobj
+456 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0005\000\040\000I\000O\000\137\000W\000I\000R\000E)
+endobj
+457 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.6) >>
+endobj
+460 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0006\000\040\000T\000I\000N\000Y\000\137\000E\000C\000C)
+endobj
+461 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.7) >>
+endobj
+464 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0007\000\040\000T\000Y\000P\000I\000C\000A\000L)
+endobj
+465 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.8) >>
+endobj
+468 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0008\000\040\000P\000O\000S\000T\000\137\000Q\000U\000A\000N\000T\000U\000M)
+endobj
+469 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.9) >>
+endobj
+472 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0009\000\040\000H\000Y\000B\000R\000I\000D)
+endobj
+473 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.10) >>
+endobj
+476 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0001\0000\000\040\000N\000O\000C\000E\000R\000T)
+endobj
+477 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.11) >>
+endobj
+480 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0001\0001\000\040\000R\000S\000A\000\137\000S\000S)
+endobj
+481 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.12) >>
+endobj
+484 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0001\0002\000\040\000E\000C\000C\000\137\000S\000S)
+endobj
+485 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.13) >>
+endobj
+488 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0001\0003\000\040\000D\000L\000T\000\137\000S\000S)
+endobj
+489 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.14) >>
+endobj
+492 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0001\0004\000\040\000H\000Y\000B\000\137\000S\000S)
+endobj
+493 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.15) >>
+endobj
+496 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0001\0005\000\040\000H\000W\000\137\0001)
+endobj
+497 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.16) >>
+endobj
+500 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0001\0006\000\040\000H\000W\000\137\0002)
+endobj
+501 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.17) >>
+endobj
+504 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0001\0007\000\040\000V\000E\000R\000B\000O\000S\000I\000T\000Y)
+endobj
+505 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.18) >>
+endobj
+508 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0001\0008\000\040\000T\000H\000I\000S\000\137\000Y\000E\000A\000R)
+endobj
+509 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.19) >>
+endobj
+512 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0001\0009\000\040\000P\000O\000S\000T\000\137\000H\000S\000\137\000A\000U\000T\000H)
+endobj
+513 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.20) >>
+endobj
+516 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0002\0000\000\040\000C\000L\000I\000E\000N\000T\000\137\000C\000E\000R\000T)
+endobj
+517 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.21) >>
+endobj
+520 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0002\0001\000\040\000C\000R\000Y\000P\000T\000O\000\137\000S\000E\000T\000T\000I\000N\000G)
+endobj
+521 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.22) >>
+endobj
+524 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0002\0002\000\040\000T\000L\000S\000\137\000A\000P\000P\000L\000I\000C\000A\000T\000I\000O\000N\000\137\000P\000R\000O\000T\000O\000C\000O\000L)
+endobj
+525 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.23) >>
+endobj
+528 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0002\0003\000\040\000A\000L\000L\000O\000W\000\137\000S\000E\000L\000F\000\137\000S\000I\000G\000N\000E\000D)
+endobj
+529 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.24) >>
+endobj
+532 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0002\0004\000\040\000T\000R\000Y\000\137\000E\000A\000R\000L\000Y\000\137\000D\000A\000T\000A)
+endobj
+533 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.25) >>
+endobj
+536 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0002\0005\000\040\000T\000L\000S\000\137\000S\000H\000A\0002\0005\0006\000\137\000T)
+endobj
+537 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.26) >>
+endobj
+540 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0002\0006\000\040\000T\000L\000S\000\137\000S\000H\000A\0003\0008\0004\000\137\000T)
+endobj
+541 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.27) >>
+endobj
+544 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0002\0007\000\040\000T\000L\000S\000\137\000S\000H\000A\0005\0001\0002\000\137\000T)
+endobj
+545 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.28) >>
+endobj
+548 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0002\0008\000\040\000T\000L\000S\000\137\000M\000A\000X\000\137\000H\000A\000S\000H\000\137\000S\000T\000A\000T\000E)
+endobj
+549 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.29) >>
+endobj
+552 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0002\0009\000\040\000T\000L\000S\000\137\000M\000A\000X\000\137\000H\000A\000S\000H)
+endobj
+553 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.30) >>
+endobj
+556 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0003\0000\000\040\000T\000L\000S\000\137\000M\000A\000X\000\137\000K\000E\000Y)
+endobj
+557 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.31) >>
+endobj
+560 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0003\0001\000\040\000T\000L\000S\000\137\000X\0005\0000\0009\000\137\000M\000A\000X\000\137\000F\000I\000E\000L\000D)
+endobj
+561 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.32) >>
+endobj
+564 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0003\0002\000\040\000T\000L\000S\000\137\000M\000A\000X\000\137\000E\000X\000T\000\137\000L\000A\000B\000E\000L)
+endobj
+565 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.33) >>
+endobj
+568 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0003\0003\000\040\000T\000L\000S\000\137\000M\000A\000X\000\137\000F\000R\000A\000G)
+endobj
+569 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.34) >>
+endobj
+572 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0003\0004\000\040\000T\000L\000S\000\137\000M\000A\000X\000\137\000I\000B\000U\000F\000F\000\137\000S\000I\000Z\000E)
+endobj
+573 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.35) >>
+endobj
+576 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0003\0005\000\040\000T\000L\000S\000\137\000M\000A\000X\000\137\000P\000L\000A\000I\000N\000\137\000F\000R\000A\000G)
+endobj
+577 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.36) >>
+endobj
+580 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0003\0006\000\040\000T\000L\000S\000\137\000M\000A\000X\000\137\000C\000I\000P\000H\000E\000R\000\137\000F\000R\000A\000G)
+endobj
+581 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.37) >>
+endobj
+584 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0003\0007\000\040\000T\000L\000S\000\137\000M\000A\000X\000\137\000C\000E\000R\000T\000\137\000S\000I\000Z\000E)
+endobj
+585 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.38) >>
+endobj
+588 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0003\0008\000\040\000T\000L\000S\000\137\000M\000A\000X\000\137\000C\000E\000R\000T\000\137\000B\0006\0004)
+endobj
+589 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.39) >>
+endobj
+592 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0003\0009\000\040\000T\000L\000S\000\137\000M\000A\000X\000\137\000H\000E\000L\000L\000O)
+endobj
+593 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.40) >>
+endobj
+596 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0004\0000\000\040\000T\000L\000S\000\137\000M\000A\000X\000\137\000S\000I\000G\000\137\000P\000U\000B\000\137\000K\000E\000Y\000\137\000S\000I\000Z\000E)
+endobj
+597 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.41) >>
+endobj
+600 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0004\0001\000\040\000T\000L\000S\000\137\000M\000A\000X\000\137\000S\000I\000G\000\137\000S\000E\000C\000R\000E\000T\000\137\000K\000E\000Y\000\137\000S\000I\000Z\000E)
+endobj
+601 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.42) >>
+endobj
+604 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0004\0002\000\040\000T\000L\000S\000\137\000M\000A\000X\000\137\000S\000I\000G\000N\000A\000T\000U\000R\000E\000\137\000S\000I\000Z\000E)
+endobj
+605 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.43) >>
+endobj
+608 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0004\0003\000\040\000T\000L\000S\000\137\000M\000A\000X\000\137\000K\000E\000X\000\137\000P\000U\000B\000\137\000K\000E\000Y\000\137\000S\000I\000Z\000E)
+endobj
+609 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.44) >>
+endobj
+612 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0004\0004\000\040\000T\000L\000S\000\137\000M\000A\000X\000\137\000K\000E\000X\000\137\000C\000I\000P\000H\000E\000R\000T\000E\000X\000T\000\137\000S\000I\000Z\000E)
+endobj
+613 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.45) >>
+endobj
+616 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0004\0005\000\040\000T\000L\000S\000\137\000M\000A\000X\000\137\000K\000E\000X\000\137\000S\000E\000C\000R\000E\000T\000\137\000K\000E\000Y\000\137\000S\000I\000Z\000E)
+endobj
+617 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.46) >>
+endobj
+620 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0004\0006\000\040\000T\000L\000S\000\137\000M\000A\000X\000\137\000S\000E\000R\000V\000E\000R\000\137\000C\000H\000A\000I\000N\000\137\000L\000E\000N)
+endobj
+621 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.47) >>
+endobj
+624 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0004\0007\000\040\000T\000L\000S\000\137\000M\000A\000X\000\137\000S\000E\000R\000V\000E\000R\000\137\000C\000H\000A\000I\000N\000\137\000S\000I\000Z\000E)
+endobj
+625 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.48) >>
+endobj
+628 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0004\0008\000\040\000T\000L\000S\000\137\000M\000A\000X\000\137\000C\000L\000I\000E\000N\000T\000\137\000C\000H\000A\000I\000N\000\137\000L\000E\000N)
+endobj
+629 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.49) >>
+endobj
+632 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0004\0009\000\040\000T\000L\000S\000\137\000M\000A\000X\000\137\000C\000L\000I\000E\000N\000T\000\137\000C\000H\000A\000I\000N\000\137\000S\000I\000Z\000E)
+endobj
+633 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.50) >>
+endobj
+636 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0005\0000\000\040\000T\000L\000S\000\137\000M\000A\000X\000\137\000S\000H\000A\000R\000E\000D\000\137\000S\000E\000C\000R\000E\000T\000\137\000S\000I\000Z\000E)
+endobj
+637 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.51) >>
+endobj
+640 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0005\0001\000\040\000T\000L\000S\000\137\000M\000A\000X\000\137\000T\000I\000C\000K\000E\000T\000\137\000S\000I\000Z\000E)
+endobj
+641 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.52) >>
+endobj
+644 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0005\0002\000\040\000T\000L\000S\000\137\000M\000A\000X\000\137\000E\000X\000T\000E\000N\000S\000I\000O\000N\000S)
+endobj
+645 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.53) >>
+endobj
+648 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0005\0003\000\040\000T\000L\000S\000\137\000M\000A\000X\000\137\000E\000C\000C\000\137\000F\000I\000E\000L\000D)
+endobj
+649 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.54) >>
+endobj
+652 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0005\0004\000\040\000T\000L\000S\000\137\000M\000A\000X\000\137\000I\000V\000\137\000S\000I\000Z\000E)
+endobj
+653 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.55) >>
+endobj
+656 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0005\0005\000\040\000T\000L\000S\000\137\000M\000A\000X\000\137\000T\000A\000G\000\137\000S\000I\000Z\000E)
+endobj
+657 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.56) >>
+endobj
+660 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0005\0006\000\040\000T\000L\000S\000\137\000M\000A\000X\000\137\000C\000O\000O\000K\000I\000E)
+endobj
+661 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.57) >>
+endobj
+664 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0005\0007\000\040\000T\000L\000S\000\137\000M\000A\000X\000\137\000O\000U\000T\000P\000U\000T\000\137\000R\000E\000C\000O\000R\000D\000\137\000S\000I\000Z\000E)
+endobj
+665 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.58) >>
+endobj
+668 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0005\0008\000\040\000T\000L\000S\000\137\000M\000A\000X\000\137\000O\000B\000U\000F\000F\000\137\000S\000I\000Z\000E)
+endobj
+669 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.59) >>
+endobj
+672 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0005\0009\000\040\000T\000L\000S\000\137\000M\000A\000X\000\137\000S\000E\000R\000V\000E\000R\000\137\000N\000A\000M\000E)
+endobj
+673 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.60) >>
+endobj
+676 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0006\0000\000\040\000T\000L\000S\000\137\000M\000A\000X\000\137\000S\000U\000P\000P\000O\000R\000T\000E\000D\000\137\000G\000R\000O\000U\000P\000S)
+endobj
+677 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.61) >>
+endobj
+680 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0006\0001\000\040\000T\000L\000S\000\137\000M\000A\000X\000\137\000S\000U\000P\000P\000O\000R\000T\000E\000D\000\137\000S\000I\000G\000S)
+endobj
+681 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.62) >>
+endobj
+684 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0006\0002\000\040\000T\000L\000S\000\137\000M\000A\000X\000\137\000P\000S\000K\000\137\000M\000O\000D\000E\000S)
+endobj
+685 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.63) >>
+endobj
+688 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0006\0003\000\040\000T\000L\000S\000\137\000M\000A\000X\000\137\000C\000I\000P\000H\000E\000R\000\137\000S\000U\000I\000T\000E\000S)
+endobj
+689 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.64) >>
+endobj
+692 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0006\0004\000\040\000T\000L\000S\000\137\000A\000E\000S\000\137\0001\0002\0008\000\137\000G\000C\000M\000\137\000S\000H\000A\0002\0005\0006)
+endobj
+693 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.65) >>
+endobj
+696 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0006\0005\000\040\000T\000L\000S\000\137\000A\000E\000S\000\137\0002\0005\0006\000\137\000G\000C\000M\000\137\000S\000H\000A\0003\0008\0004)
+endobj
+697 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.66) >>
+endobj
+700 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0006\0006\000\040\000T\000L\000S\000\137\000C\000H\000A\000C\000H\000A\0002\0000\000\137\000P\000O\000L\000Y\0001\0003\0000\0005\000\137\000S\000H\000A\0002\0005\0006)
+endobj
+701 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.67) >>
+endobj
+704 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0006\0007\000\040\000T\000L\000S\000\137\000A\000E\000S\000\137\0001\0002\0008\000\137\000C\000C\000M\000\137\000S\000H\000A\0002\0005\0006)
+endobj
+705 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.68) >>
+endobj
+708 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0006\0008\000\040\000T\000L\000S\000\137\000A\000E\000S\000\137\0001\0002\0008\000\137\000C\000C\000M\000\137\0008\000\137\000S\000H\000A\0002\0005\0006)
+endobj
+709 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.69) >>
+endobj
+712 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0006\0009\000\040\000X\0002\0005\0005\0001\0009)
+endobj
+713 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.70) >>
+endobj
+716 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0007\0000\000\040\000S\000E\000C\000P\0002\0005\0006\000R\0001)
+endobj
+717 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.71) >>
+endobj
+720 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0007\0001\000\040\000S\000E\000C\000P\0003\0008\0004\000R\0001)
+endobj
+721 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.72) >>
+endobj
+724 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0007\0002\000\040\000S\000E\000C\000P\0005\0002\0001\000R\0001)
+endobj
+725 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.73) >>
+endobj
+728 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0007\0003\000\040\000X\0004\0004\0008)
+endobj
+729 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.74) >>
+endobj
+732 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0007\0004\000\040\000K\000Y\000B\000E\000R\0007\0006\0008)
+endobj
+733 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.75) >>
+endobj
+736 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0007\0005\000\040\000H\000Y\000B\000R\000I\000D\000\137\000K\000X)
+endobj
+737 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.76) >>
+endobj
+740 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0007\0006\000\040\000E\000C\000D\000S\000A\000\137\000S\000E\000C\000P\0002\0005\0006\000R\0001\000\137\000S\000H\000A\0002\0005\0006)
+endobj
+741 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.77) >>
+endobj
+744 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0007\0007\000\040\000E\000C\000D\000S\000A\000\137\000S\000E\000C\000P\0002\0005\0006\000R\0001\000\137\000S\000H\000A\0003\0008\0004)
+endobj
+745 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.78) >>
+endobj
+748 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0007\0008\000\040\000E\000C\000D\000S\000A\000\137\000S\000E\000C\000P\0003\0008\0004\000R\0001\000\137\000S\000H\000A\0003\0008\0004)
+endobj
+749 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.79) >>
+endobj
+752 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0007\0009\000\040\000R\000S\000A\000\137\000P\000S\000S\000\137\000R\000S\000A\000E\000\137\000S\000H\000A\0002\0005\0006)
+endobj
+753 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.80) >>
+endobj
+756 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0008\0000\000\040\000R\000S\000A\000\137\000P\000S\000S\000\137\000R\000S\000A\000E\000\137\000S\000H\000A\0003\0008\0004)
+endobj
+757 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.81) >>
+endobj
+760 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0008\0001\000\040\000R\000S\000A\000\137\000P\000S\000S\000\137\000R\000S\000A\000E\000\137\000S\000H\000A\0005\0001\0002)
+endobj
+761 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.82) >>
+endobj
+764 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0008\0002\000\040\000R\000S\000A\000\137\000P\000K\000C\000S\0001\000\137\000S\000H\000A\0002\0005\0006)
+endobj
+765 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.83) >>
+endobj
+768 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0008\0003\000\040\000R\000S\000A\000\137\000P\000K\000C\000S\0001\000\137\000S\000H\000A\0003\0008\0004)
+endobj
+769 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.84) >>
+endobj
+772 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0008\0004\000\040\000R\000S\000A\000\137\000P\000K\000C\000S\0001\000\137\000S\000H\000A\0005\0001\0002)
+endobj
+773 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.85) >>
+endobj
+776 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0008\0005\000\040\000E\000D\0002\0005\0005\0001\0009)
+endobj
+777 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.86) >>
+endobj
+780 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0008\0006\000\040\000D\000I\000L\000I\000T\000H\000I\000U\000M\0002)
+endobj
+781 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.87) >>
+endobj
+784 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0008\0007\000\040\000D\000I\000L\000I\000T\000H\000I\000U\000M\0003)
+endobj
+785 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.88) >>
+endobj
+788 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0008\0008\000\040\000D\000I\000L\000I\000T\000H\000I\000U\000M\0002\000\137\000P\0002\0005\0006)
+endobj
+789 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.89) >>
+endobj
+792 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0008\0009\000\040\000P\000S\000K\000O\000K)
+endobj
+793 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.90) >>
+endobj
+796 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0009\0000\000\040\000P\000S\000K\000W\000E\000C\000D\000H\000E)
+endobj
+797 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.91) >>
+endobj
+800 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0009\0001\000\040\000T\000L\000S\000\137\000F\000U\000L\000L\000\137\000H\000A\000N\000D\000S\000H\000A\000K\000E)
+endobj
+801 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.92) >>
+endobj
+804 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0009\0002\000\040\000T\000L\000S\000\137\000E\000X\000T\000E\000R\000N\000A\000L\000\137\000P\000S\000K)
+endobj
+805 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.93) >>
+endobj
+808 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0009\0003\000\040\000T\000L\000S\0001\000\137\0000)
+endobj
+809 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.94) >>
+endobj
+812 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0009\0004\000\040\000T\000L\000S\0001\000\137\0002)
+endobj
+813 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.95) >>
+endobj
+816 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0009\0005\000\040\000T\000L\000S\0001\000\137\0003)
+endobj
+817 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.96) >>
+endobj
+820 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0009\0006\000\040\000T\000L\000S\0001\0003\000\137\000U\000P\000D\000A\000T\000E\000\137\000N\000O\000T\000\137\000R\000E\000Q\000U\000E\000S\000T\000E\000D)
+endobj
+821 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.97) >>
+endobj
+824 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0009\0007\000\040\000T\000L\000S\0001\0003\000\137\000U\000P\000D\000A\000T\000E\000\137\000R\000E\000Q\000U\000E\000S\000T\000E\000D)
+endobj
+825 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.98) >>
+endobj
+828 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0009\0008\000\040\000S\000E\000R\000V\000E\000R\000\137\000N\000A\000M\000E)
+endobj
+829 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.99) >>
+endobj
+832 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0009\0009\000\040\000S\000U\000P\000P\000O\000R\000T\000E\000D\000\137\000G\000R\000O\000U\000P\000S)
+endobj
+833 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.100) >>
+endobj
+836 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0001\0000\0000\000\040\000S\000I\000G\000\137\000A\000L\000G\000S)
+endobj
+837 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.101) >>
+endobj
+840 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0001\0000\0001\000\040\000P\000O\000S\000T\000\137\000H\000A\000N\000D\000S\000H\000A\000K\000E\000\137\000A\000U\000T\000H)
+endobj
+841 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.102) >>
+endobj
+844 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0001\0000\0002\000\040\000S\000I\000G\000\137\000A\000L\000G\000S\000\137\000C\000E\000R\000T)
+endobj
+845 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.103) >>
+endobj
+848 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0001\0000\0003\000\040\000K\000E\000Y\000\137\000S\000H\000A\000R\000E)
+endobj
+849 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.104) >>
+endobj
+852 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0001\0000\0004\000\040\000P\000S\000K\000\137\000M\000O\000D\000E)
+endobj
+853 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.105) >>
+endobj
+856 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0001\0000\0005\000\040\000P\000R\000E\000S\000H\000A\000R\000E\000D\000\137\000K\000E\000Y)
+endobj
+857 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.106) >>
+endobj
+860 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0001\0000\0006\000\040\000T\000L\000S\000\137\000V\000E\000R)
+endobj
+861 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.107) >>
+endobj
+864 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0001\0000\0007\000\040\000C\000O\000O\000K\000I\000E)
+endobj
+865 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.108) >>
+endobj
+868 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0001\0000\0008\000\040\000E\000A\000R\000L\000Y\000\137\000D\000A\000T\000A)
+endobj
+869 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.109) >>
+endobj
+872 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0001\0000\0009\000\040\000M\000A\000X\000\137\000F\000R\000A\000G\000\137\000L\000E\000N\000G\000T\000H)
+endobj
+873 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.110) >>
+endobj
+876 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0001\0001\0000\000\040\000P\000A\000D\000D\000I\000N\000G)
+endobj
+877 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.111) >>
+endobj
+880 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0001\0001\0001\000\040\000A\000P\000P\000\137\000P\000R\000O\000T\000O\000C\000O\000L)
+endobj
+881 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.112) >>
+endobj
+884 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0001\0001\0002\000\040\000R\000E\000C\000O\000R\000D\000\137\000S\000I\000Z\000E\000\137\000L\000I\000M\000I\000T)
+endobj
+885 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.113) >>
+endobj
+888 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0001\0001\0003\000\040\000C\000L\000I\000E\000N\000T\000\137\000C\000E\000R\000T\000\137\000T\000Y\000P\000E)
+endobj
+889 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.114) >>
+endobj
+892 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0001\0001\0004\000\040\000S\000E\000R\000V\000E\000R\000\137\000C\000E\000R\000T\000\137\000T\000Y\000P\000E)
+endobj
+893 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.115) >>
+endobj
+896 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0001\0001\0005\000\040\000H\000S\000H\000A\000K\000E)
+endobj
+897 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.116) >>
+endobj
+900 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0001\0001\0006\000\040\000A\000P\000P\000L\000I\000C\000A\000T\000I\000O\000N)
+endobj
+901 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.117) >>
+endobj
+904 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0001\0001\0007\000\040\000A\000L\000E\000R\000T)
+endobj
+905 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.118) >>
+endobj
+908 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0001\0001\0008\000\040\000C\000H\000A\000N\000G\000E\000\137\000C\000I\000P\000H\000E\000R)
+endobj
+909 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.119) >>
+endobj
+912 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0001\0001\0009\000\040\000T\000I\000M\000E\000D\000\137\000O\000U\000T)
+endobj
+913 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.120) >>
+endobj
+916 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0001\0002\0000\000\040\000C\000L\000I\000E\000N\000T\000\137\000H\000E\000L\000L\000O)
+endobj
+917 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.121) >>
+endobj
+920 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0001\0002\0001\000\040\000S\000E\000R\000V\000E\000R\000\137\000H\000E\000L\000L\000O)
+endobj
+921 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.122) >>
+endobj
+924 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0001\0002\0002\000\040\000C\000E\000R\000T\000I\000F\000I\000C\000A\000T\000E)
+endobj
+925 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.123) >>
+endobj
+928 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0001\0002\0003\000\040\000C\000E\000R\000T\000\137\000R\000E\000Q\000U\000E\000S\000T)
+endobj
+929 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.124) >>
+endobj
+932 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0001\0002\0004\000\040\000C\000E\000R\000T\000\137\000V\000E\000R\000I\000F\000Y)
+endobj
+933 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.125) >>
+endobj
+936 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0001\0002\0005\000\040\000F\000I\000N\000I\000S\000H\000E\000D)
+endobj
+937 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.126) >>
+endobj
+940 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0001\0002\0006\000\040\000E\000N\000C\000R\000Y\000P\000T\000E\000D\000\137\000E\000X\000T\000E\000N\000S\000I\000O\000N\000S)
+endobj
+941 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.127) >>
+endobj
+944 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0001\0002\0007\000\040\000T\000I\000C\000K\000E\000T)
+endobj
+945 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.128) >>
+endobj
+948 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0001\0002\0008\000\040\000K\000E\000Y\000\137\000U\000P\000D\000A\000T\000E)
+endobj
+949 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.129) >>
+endobj
+952 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0001\0002\0009\000\040\000M\000E\000S\000S\000A\000G\000E\000\137\000H\000A\000S\000H)
+endobj
+953 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.130) >>
+endobj
+956 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0001\0003\0000\000\040\000E\000N\000D\000\137\000O\000F\000\137\000E\000A\000R\000L\000Y\000\137\000D\000A\000T\000A)
+endobj
+957 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.131) >>
+endobj
+960 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0001\0003\0001\000\040\000H\000A\000N\000D\000S\000H\000A\000K\000E\000\137\000R\000E\000T\000R\000Y)
+endobj
+961 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.132) >>
+endobj
+964 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0001\0003\0002\000\040\000N\000O\000T\000\137\000T\000L\000S\0001\000\137\0003)
+endobj
+965 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.133) >>
+endobj
+968 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0001\0003\0003\000\040\000B\000A\000D\000\137\000C\000E\000R\000T\000\137\000C\000H\000A\000I\000N)
+endobj
+969 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.134) >>
+endobj
+972 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0001\0003\0004\000\040\000I\000D\000\137\000M\000I\000S\000M\000A\000T\000C\000H)
+endobj
+973 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.135) >>
+endobj
+976 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0001\0003\0005\000\040\000U\000N\000R\000E\000C\000O\000G\000N\000I\000Z\000E\000D\000\137\000E\000X\000T)
+endobj
+977 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.136) >>
+endobj
+980 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0001\0003\0006\000\040\000B\000A\000D\000\137\000H\000E\000L\000L\000O)
+endobj
+981 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.137) >>
+endobj
+984 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0001\0003\0007\000\040\000W\000R\000O\000N\000G\000\137\000M\000E\000S\000S\000A\000G\000E)
+endobj
+985 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.138) >>
+endobj
+988 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0001\0003\0008\000\040\000M\000I\000S\000S\000I\000N\000G\000\137\000R\000E\000Q\000U\000E\000S\000T\000\137\000C\000O\000N\000T\000E\000X\000T)
+endobj
+989 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.139) >>
+endobj
+992 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0001\0003\0009\000\040\000A\000U\000T\000H\000E\000N\000T\000I\000C\000A\000T\000I\000O\000N\000\137\000F\000A\000I\000L\000U\000R\000E)
+endobj
+993 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.140) >>
+endobj
+996 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0001\0004\0000\000\040\000B\000A\000D\000\137\000R\000E\000C\000O\000R\000D)
+endobj
+997 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.141) >>
+endobj
+1000 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0001\0004\0001\000\040\000B\000A\000D\000\137\000T\000I\000C\000K\000E\000T)
+endobj
+1001 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.142) >>
+endobj
+1004 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0001\0004\0002\000\040\000N\000O\000T\000\137\000E\000X\000P\000E\000C\000T\000E\000D)
+endobj
+1005 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.143) >>
+endobj
+1008 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0001\0004\0003\000\040\000C\000A\000\137\000N\000O\000T\000\137\000F\000O\000U\000N\000D)
+endobj
+1009 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.144) >>
+endobj
+1012 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0001\0004\0004\000\040\000C\000E\000R\000T\000\137\000O\000U\000T\000O\000F\000D\000A\000T\000E)
+endobj
+1013 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.145) >>
+endobj
+1016 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0001\0004\0005\000\040\000M\000E\000M\000\137\000O\000V\000E\000R\000F\000L\000O\000W)
+endobj
+1017 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.146) >>
+endobj
+1020 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0001\0004\0006\000\040\000F\000O\000R\000B\000I\000D\000D\000E\000N\000\137\000E\000X\000T\000E\000N\000S\000I\000O\000N)
+endobj
+1021 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.147) >>
+endobj
+1024 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0001\0004\0007\000\040\000M\000A\000X\000\137\000E\000X\000C\000E\000E\000D\000E\000D)
+endobj
+1025 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.148) >>
+endobj
+1028 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0001\0004\0008\000\040\000E\000M\000P\000T\000Y\000\137\000C\000E\000R\000T\000\137\000C\000H\000A\000I\000N)
+endobj
+1029 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.149) >>
+endobj
+1032 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0001\0004\0009\000\040\000S\000E\000L\000F\000\137\000S\000I\000G\000N\000E\000D\000\137\000C\000E\000R\000T)
+endobj
+1033 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.150) >>
+endobj
+1036 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0001\0005\0000\000\040\000E\000R\000R\000O\000R\000\137\000A\000L\000E\000R\000T\000\137\000R\000E\000C\000E\000I\000V\000E\000D)
+endobj
+1037 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.151) >>
+endobj
+1040 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0001\0005\0001\000\040\000B\000A\000D\000\137\000M\000E\000S\000S\000A\000G\000E)
+endobj
+1041 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.152) >>
+endobj
+1044 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0001\0005\0002\000\040\000C\000E\000R\000T\000\137\000V\000E\000R\000I\000F\000Y\000\137\000F\000A\000I\000L)
+endobj
+1045 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.153) >>
+endobj
+1048 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0001\0005\0003\000\040\000B\000A\000D\000\137\000H\000A\000N\000D\000S\000H\000A\000K\000E)
+endobj
+1049 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.154) >>
+endobj
+1052 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0001\0005\0004\000\040\000B\000A\000D\000\137\000R\000E\000Q\000U\000E\000S\000T\000\137\000U\000P\000D\000A\000T\000E)
+endobj
+1053 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.155) >>
+endobj
+1056 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0001\0005\0005\000\040\000C\000L\000O\000S\000U\000R\000E\000\137\000A\000L\000E\000R\000T\000\137\000R\000E\000C\000E\000I\000V\000E\000D)
+endobj
+1057 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.156) >>
+endobj
+1060 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0001\0005\0006\000\040\000M\000I\000S\000S\000I\000N\000G\000\137\000E\000X\000T\000E\000N\000S\000I\000O\000N\000S)
+endobj
+1061 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.157) >>
+endobj
+1064 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0001\0005\0007\000\040\000I\000L\000L\000E\000G\000A\000L\000\137\000P\000A\000R\000A\000M\000E\000T\000E\000R)
+endobj
+1065 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.158) >>
+endobj
+1068 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0001\0005\0008\000\040\000U\000N\000E\000X\000P\000E\000C\000T\000E\000D\000\137\000M\000E\000S\000S\000A\000G\000E)
+endobj
+1069 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.159) >>
+endobj
+1072 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0001\0005\0009\000\040\000D\000E\000C\000R\000Y\000P\000T\000\137\000E\000R\000R\000O\000R)
+endobj
+1073 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.160) >>
+endobj
+1076 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0001\0006\0000\000\040\000B\000A\000D\000\137\000C\000E\000R\000T\000I\000F\000I\000C\000A\000T\000E)
+endobj
+1077 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.161) >>
+endobj
+1080 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0001\0006\0001\000\040\000U\000N\000S\000U\000P\000P\000O\000R\000T\000E\000D\000\137\000E\000X\000T\000E\000N\000S\000I\000O\000N)
+endobj
+1081 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.162) >>
+endobj
+1084 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0001\0006\0002\000\040\000U\000N\000K\000N\000O\000W\000N\000\137\000C\000A)
+endobj
+1085 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.163) >>
+endobj
+1088 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0001\0006\0003\000\040\000C\000E\000R\000T\000I\000F\000I\000C\000A\000T\000E\000\137\000E\000X\000P\000I\000R\000E\000D)
+endobj
+1089 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.164) >>
+endobj
+1092 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0001\0006\0004\000\040\000P\000R\000O\000T\000O\000C\000O\000L\000\137\000V\000E\000R\000S\000I\000O\000N)
+endobj
+1093 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.165) >>
+endobj
+1096 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0001\0006\0005\000\040\000D\000E\000C\000O\000D\000E\000\137\000E\000R\000R\000O\000R)
+endobj
+1097 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.166) >>
+endobj
+1100 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0001\0006\0006\000\040\000R\000E\000C\000O\000R\000D\000\137\000O\000V\000E\000R\000F\000L\000O\000W)
+endobj
+1101 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.167) >>
+endobj
+1104 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0001\0006\0007\000\040\000B\000A\000D\000\137\000R\000E\000C\000O\000R\000D\000\137\000M\000A\000C)
+endobj
+1105 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.168) >>
+endobj
+1108 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0001\0006\0008\000\040\000H\000A\000N\000D\000S\000H\000A\000K\000E\000\137\000F\000A\000I\000L\000U\000R\000E)
+endobj
+1109 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.169) >>
+endobj
+1112 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0001\0006\0009\000\040\000C\000L\000O\000S\000E\000\137\000N\000O\000T\000I\000F\000Y)
+endobj
+1113 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.170) >>
+endobj
+1116 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0001\0007\0000\000\040\000M\000I\000S\000S\000I\000N\000G\000\137\000E\000X\000T\000E\000N\000S\000I\000O\000N)
+endobj
+1117 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.171) >>
+endobj
+1120 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0001\0007\0001\000\040\000L\000O\000G\000\137\000O\000U\000T\000P\000U\000T\000\137\000T\000R\000U\000N\000C\000A\000T\000I\000O\000N)
+endobj
+1121 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.172) >>
+endobj
+1124 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0001\0007\0002\000\040\000T\000L\000S\0001\0003\000\137\000D\000I\000S\000C\000O\000N\000N\000E\000C\000T\000E\000D)
+endobj
+1125 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.173) >>
+endobj
+1128 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0001\0007\0003\000\040\000T\000L\000S\0001\0003\000\137\000C\000O\000N\000N\000E\000C\000T\000E\000D)
+endobj
+1129 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.174) >>
+endobj
+1132 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0001\0007\0004\000\040\000T\000L\000S\0001\0003\000\137\000H\000A\000N\000D\000S\000H\000A\000K\000I\000N\000G)
+endobj
+1133 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.175) >>
+endobj
+1136 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0001\0007\0005\000\040\000T\000L\000S\000\137\000F\000A\000I\000L\000U\000R\000E)
+endobj
+1137 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.176) >>
+endobj
+1140 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0001\0007\0006\000\040\000T\000L\000S\000\137\000S\000U\000C\000C\000E\000S\000S)
+endobj
+1141 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.177) >>
+endobj
+1144 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0001\0007\0007\000\040\000T\000L\000S\000\137\000R\000E\000S\000U\000M\000P\000T\000I\000O\000N\000\137\000R\000E\000Q\000U\000I\000R\000E\000D)
+endobj
+1145 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.178) >>
+endobj
+1148 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0001\0007\0008\000\040\000T\000L\000S\000\137\000E\000A\000R\000L\000Y\000\137\000D\000A\000T\000A\000\137\000A\000C\000C\000E\000P\000T\000E\000D)
+endobj
+1149 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.179) >>
+endobj
+1152 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0001\0007\0009\000\040\000P\000S\000K\000\137\000N\000O\000T)
+endobj
+1153 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.180) >>
+endobj
+1156 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0001\0008\0000\000\040\000P\000S\000K\000\137\000K\000E\000Y)
+endobj
+1157 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.181) >>
+endobj
+1160 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0001\0008\0001\000\040\000P\000S\000K\000\137\000I\000B\000E)
+endobj
+1161 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.182) >>
+endobj
+1164 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0001\0008\0002\000\040\000X\0005\0000\0009\000\137\000C\000E\000R\000T)
+endobj
+1165 0 obj
+<< /S /GoTo /D (subsubsection.6.1.2.183) >>
+endobj
+1168 0 obj
+(\376\377\0006\000.\0001\000.\0002\000.\0001\0008\0003\000\040\000R\000A\000W\000\137\000P\000U\000B\000L\000I\000C\000\137\000K\000E\000Y)
+endobj
+1169 0 obj
+<< /S /GoTo /D (subsection.6.1.3) >>
+endobj
+1172 0 obj
+(\376\377\0006\000.\0001\000.\0003\000\040\000T\000y\000p\000e\000d\000e\000f\000\040\000D\000o\000c\000u\000m\000e\000n\000t\000a\000t\000i\000o\000n)
+endobj
+1173 0 obj
+<< /S /GoTo /D (subsubsection.6.1.3.1) >>
+endobj
+1176 0 obj
+(\376\377\0006\000.\0001\000.\0003\000.\0001\000\040\000b\000y\000t\000e)
+endobj
+1177 0 obj
+<< /S /GoTo /D (subsubsection.6.1.3.2) >>
+endobj
+1180 0 obj
+(\376\377\0006\000.\0001\000.\0003\000.\0002\000\040\000s\000i\000g\000n\0008)
+endobj
+1181 0 obj
+<< /S /GoTo /D (subsubsection.6.1.3.3) >>
+endobj
+1184 0 obj
+(\376\377\0006\000.\0001\000.\0003\000.\0003\000\040\000s\000i\000g\000n\0001\0006)
+endobj
+1185 0 obj
+<< /S /GoTo /D (subsubsection.6.1.3.4) >>
+endobj
+1188 0 obj
+(\376\377\0006\000.\0001\000.\0003\000.\0004\000\040\000s\000i\000g\000n\0003\0002)
+endobj
+1189 0 obj
+<< /S /GoTo /D (subsubsection.6.1.3.5) >>
+endobj
+1192 0 obj
+(\376\377\0006\000.\0001\000.\0003\000.\0005\000\040\000s\000i\000g\000n\0006\0004)
+endobj
+1193 0 obj
+<< /S /GoTo /D (subsubsection.6.1.3.6) >>
+endobj
+1196 0 obj
+(\376\377\0006\000.\0001\000.\0003\000.\0006\000\040\000u\000n\000s\000i\000g\000n\0003\0002)
+endobj
+1197 0 obj
+<< /S /GoTo /D (subsubsection.6.1.3.7) >>
+endobj
+1200 0 obj
+(\376\377\0006\000.\0001\000.\0003\000.\0007\000\040\000u\000n\000s\000i\000g\000n\0006\0004)
+endobj
+1201 0 obj
+<< /S /GoTo /D (section.6.2) >>
+endobj
+1204 0 obj
+(\376\377\0006\000.\0002\000\040\000t\000l\000s\0001\000\137\0003\000.\000h)
+endobj
+1205 0 obj
+<< /S /GoTo /D (section.6.3) >>
+endobj
+1208 0 obj
+(\376\377\0006\000.\0003\000\040\000t\000l\000s\000\137\000b\000f\000i\000b\000e\000.\000h\000\040\000F\000i\000l\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+1209 0 obj
+<< /S /GoTo /D (subsection.6.3.1) >>
+endobj
+1212 0 obj
+(\376\377\0006\000.\0003\000.\0001\000\040\000D\000e\000t\000a\000i\000l\000e\000d\000\040\000D\000e\000s\000c\000r\000i\000p\000t\000i\000o\000n)
+endobj
+1213 0 obj
+<< /S /GoTo /D (subsection.6.3.2) >>
+endobj
+1216 0 obj
+(\376\377\0006\000.\0003\000.\0002\000\040\000M\000a\000c\000r\000o\000\040\000D\000e\000f\000i\000n\000i\000t\000i\000o\000n\000\040\000D\000o\000c\000u\000m\000e\000n\000t\000a\000t\000i\000o\000n)
+endobj
+1217 0 obj
+<< /S /GoTo /D (subsubsection.6.3.2.1) >>
+endobj
+1220 0 obj
+(\376\377\0006\000.\0003\000.\0002\000.\0001\000\040\000P\000G\000S\000\137\000B\000L\000S\0001\0002\0003\0008\0001)
+endobj
+1221 0 obj
+<< /S /GoTo /D (subsubsection.6.3.2.2) >>
+endobj
+1224 0 obj
+(\376\377\0006\000.\0003\000.\0002\000.\0002\000\040\000P\000F\000S\000\137\000B\000L\000S\0001\0002\0003\0008\0001)
+endobj
+1225 0 obj
+<< /S /GoTo /D (subsection.6.3.3) >>
+endobj
+1228 0 obj
+(\376\377\0006\000.\0003\000.\0003\000\040\000F\000u\000n\000c\000t\000i\000o\000n\000\040\000D\000o\000c\000u\000m\000e\000n\000t\000a\000t\000i\000o\000n)
+endobj
+1229 0 obj
+<< /S /GoTo /D (subsubsection.6.3.3.1) >>
+endobj
+1232 0 obj
+(\376\377\0006\000.\0003\000.\0003\000.\0001\000\040\000B\000F\000I\000B\000E\000\137\000C\000C\000A\000\137\000E\000N\000C\000R\000Y\000P\000T\000\050\000\051)
+endobj
+1233 0 obj
+<< /S /GoTo /D (subsubsection.6.3.3.2) >>
+endobj
+1236 0 obj
+(\376\377\0006\000.\0003\000.\0003\000.\0002\000\040\000B\000F\000I\000B\000E\000\137\000C\000C\000A\000\137\000D\000E\000C\000R\000Y\000P\000T\000\050\000\051)
+endobj
+1237 0 obj
+<< /S /GoTo /D (section.6.4) >>
+endobj
+1240 0 obj
+(\376\377\0006\000.\0004\000\040\000t\000l\000s\000\137\000b\000f\000i\000b\000e\000.\000h)
+endobj
+1241 0 obj
+<< /S /GoTo /D (section.6.5) >>
+endobj
+1244 0 obj
+(\376\377\0006\000.\0005\000\040\000t\000l\000s\000\137\000c\000e\000r\000t\000\137\000c\000h\000a\000i\000n\000.\000h\000\040\000F\000i\000l\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+1245 0 obj
+<< /S /GoTo /D (subsection.6.5.1) >>
+endobj
+1248 0 obj
+(\376\377\0006\000.\0005\000.\0001\000\040\000D\000e\000t\000a\000i\000l\000e\000d\000\040\000D\000e\000s\000c\000r\000i\000p\000t\000i\000o\000n)
+endobj
+1249 0 obj
+<< /S /GoTo /D (subsection.6.5.2) >>
+endobj
+1252 0 obj
+(\376\377\0006\000.\0005\000.\0002\000\040\000F\000u\000n\000c\000t\000i\000o\000n\000\040\000D\000o\000c\000u\000m\000e\000n\000t\000a\000t\000i\000o\000n)
+endobj
+1253 0 obj
+<< /S /GoTo /D (subsubsection.6.5.2.1) >>
+endobj
+1256 0 obj
+(\376\377\0006\000.\0005\000.\0002\000.\0001\000\040\000c\000h\000e\000c\000k\000S\000e\000r\000v\000e\000r\000C\000e\000r\000t\000C\000h\000a\000i\000n\000\050\000\051)
+endobj
+1257 0 obj
+<< /S /GoTo /D (subsubsection.6.5.2.2) >>
+endobj
+1260 0 obj
+(\376\377\0006\000.\0005\000.\0002\000.\0002\000\040\000g\000e\000t\000C\000l\000i\000e\000n\000t\000P\000r\000i\000v\000a\000t\000e\000K\000e\000y\000a\000n\000d\000C\000e\000r\000t\000C\000h\000a\000i\000n\000\050\000\051)
+endobj
+1261 0 obj
+<< /S /GoTo /D (section.6.6) >>
+endobj
+1264 0 obj
+(\376\377\0006\000.\0006\000\040\000t\000l\000s\000\137\000c\000e\000r\000t\000\137\000c\000h\000a\000i\000n\000.\000h)
+endobj
+1265 0 obj
+<< /S /GoTo /D (section.6.7) >>
+endobj
+1268 0 obj
+(\376\377\0006\000.\0007\000\040\000t\000l\000s\000\137\000c\000e\000r\000t\000s\000.\000h\000\040\000F\000i\000l\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+1269 0 obj
+<< /S /GoTo /D (subsection.6.7.1) >>
+endobj
+1272 0 obj
+(\376\377\0006\000.\0007\000.\0001\000\040\000D\000e\000t\000a\000i\000l\000e\000d\000\040\000D\000e\000s\000c\000r\000i\000p\000t\000i\000o\000n)
+endobj
+1273 0 obj
+<< /S /GoTo /D (subsection.6.7.2) >>
+endobj
+1276 0 obj
+(\376\377\0006\000.\0007\000.\0002\000\040\000F\000u\000n\000c\000t\000i\000o\000n\000\040\000D\000o\000c\000u\000m\000e\000n\000t\000a\000t\000i\000o\000n)
+endobj
+1277 0 obj
+<< /S /GoTo /D (subsubsection.6.7.2.1) >>
+endobj
+1280 0 obj
+(\376\377\0006\000.\0007\000.\0002\000.\0001\000\040\000g\000e\000t\000S\000i\000g\000R\000e\000q\000u\000i\000r\000e\000m\000e\000n\000t\000s\000\050\000\051)
+endobj
+1281 0 obj
+<< /S /GoTo /D (subsection.6.7.3) >>
+endobj
+1284 0 obj
+(\376\377\0006\000.\0007\000.\0003\000\040\000V\000a\000r\000i\000a\000b\000l\000e\000\040\000D\000o\000c\000u\000m\000e\000n\000t\000a\000t\000i\000o\000n)
+endobj
+1285 0 obj
+<< /S /GoTo /D (subsubsection.6.7.3.1) >>
+endobj
+1288 0 obj
+(\376\377\0006\000.\0007\000.\0003\000.\0001\000\040\000m\000y\000p\000r\000i\000v\000a\000t\000e)
+endobj
+1289 0 obj
+<< /S /GoTo /D (subsubsection.6.7.3.2) >>
+endobj
+1292 0 obj
+(\376\377\0006\000.\0007\000.\0003\000.\0002\000\040\000m\000y\000c\000e\000r\000t)
+endobj
+1293 0 obj
+<< /S /GoTo /D (subsubsection.6.7.3.3) >>
+endobj
+1296 0 obj
+(\376\377\0006\000.\0007\000.\0003\000.\0003\000\040\000c\000a\000c\000e\000r\000t\000s)
+endobj
+1297 0 obj
+<< /S /GoTo /D (section.6.8) >>
+endobj
+1300 0 obj
+(\376\377\0006\000.\0008\000\040\000t\000l\000s\000\137\000c\000e\000r\000t\000s\000.\000h)
+endobj
+1301 0 obj
+<< /S /GoTo /D (section.6.9) >>
+endobj
+1304 0 obj
+(\376\377\0006\000.\0009\000\040\000t\000l\000s\000\137\000c\000l\000i\000e\000n\000t\000\137\000r\000e\000c\000v\000.\000h\000\040\000F\000i\000l\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+1305 0 obj
+<< /S /GoTo /D (subsection.6.9.1) >>
+endobj
+1308 0 obj
+(\376\377\0006\000.\0009\000.\0001\000\040\000D\000e\000t\000a\000i\000l\000e\000d\000\040\000D\000e\000s\000c\000r\000i\000p\000t\000i\000o\000n)
+endobj
+1309 0 obj
+<< /S /GoTo /D (subsection.6.9.2) >>
+endobj
+1312 0 obj
+(\376\377\0006\000.\0009\000.\0002\000\040\000F\000u\000n\000c\000t\000i\000o\000n\000\040\000D\000o\000c\000u\000m\000e\000n\000t\000a\000t\000i\000o\000n)
+endobj
+1313 0 obj
+<< /S /GoTo /D (subsubsection.6.9.2.1) >>
+endobj
+1316 0 obj
+(\376\377\0006\000.\0009\000.\0002\000.\0001\000\040\000p\000a\000r\000s\000e\000o\000c\000t\000a\000d\000\050\000\051)
+endobj
+1317 0 obj
+<< /S /GoTo /D (subsubsection.6.9.2.2) >>
+endobj
+1320 0 obj
+(\376\377\0006\000.\0009\000.\0002\000.\0002\000\040\000p\000a\000r\000s\000e\000b\000y\000t\000e\000s\000\050\000\051)
+endobj
+1321 0 obj
+<< /S /GoTo /D (subsubsection.6.9.2.3) >>
+endobj
+1324 0 obj
+(\376\377\0006\000.\0009\000.\0002\000.\0003\000\040\000p\000a\000r\000s\000e\000I\000n\000t\000\050\000\051)
+endobj
+1325 0 obj
+<< /S /GoTo /D (subsubsection.6.9.2.4) >>
+endobj
+1328 0 obj
+(\376\377\0006\000.\0009\000.\0002\000.\0004\000\040\000p\000a\000r\000s\000e\000o\000c\000t\000a\000d\000p\000t\000r\000\050\000\051)
+endobj
+1329 0 obj
+<< /S /GoTo /D (subsubsection.6.9.2.5) >>
+endobj
+1332 0 obj
+(\376\377\0006\000.\0009\000.\0002\000.\0005\000\040\000g\000e\000t\000S\000e\000r\000v\000e\000r\000R\000e\000c\000o\000r\000d\000\050\000\051)
+endobj
+1333 0 obj
+<< /S /GoTo /D (subsubsection.6.9.2.6) >>
+endobj
+1336 0 obj
+(\376\377\0006\000.\0009\000.\0002\000.\0006\000\040\000p\000a\000r\000s\000e\000I\000n\000t\000o\000r\000P\000u\000l\000l\000\050\000\051)
+endobj
+1337 0 obj
+<< /S /GoTo /D (subsubsection.6.9.2.7) >>
+endobj
+1340 0 obj
+(\376\377\0006\000.\0009\000.\0002\000.\0007\000\040\000p\000a\000r\000s\000e\000o\000c\000t\000a\000d\000o\000r\000P\000u\000l\000l\000\050\000\051)
+endobj
+1341 0 obj
+<< /S /GoTo /D (subsubsection.6.9.2.8) >>
+endobj
+1344 0 obj
+(\376\377\0006\000.\0009\000.\0002\000.\0008\000\040\000p\000a\000r\000s\000e\000b\000y\000t\000e\000s\000o\000r\000P\000u\000l\000l\000\050\000\051)
+endobj
+1345 0 obj
+<< /S /GoTo /D (subsubsection.6.9.2.9) >>
+endobj
+1348 0 obj
+(\376\377\0006\000.\0009\000.\0002\000.\0009\000\040\000p\000a\000r\000s\000e\000o\000c\000t\000a\000d\000o\000r\000P\000u\000l\000l\000p\000t\000r\000X\000\050\000\051)
+endobj
+1349 0 obj
+<< /S /GoTo /D (subsubsection.6.9.2.10) >>
+endobj
+1352 0 obj
+(\376\377\0006\000.\0009\000.\0002\000.\0001\0000\000\040\000b\000a\000d\000R\000e\000s\000p\000o\000n\000s\000e\000\050\000\051)
+endobj
+1353 0 obj
+<< /S /GoTo /D (subsubsection.6.9.2.11) >>
+endobj
+1356 0 obj
+(\376\377\0006\000.\0009\000.\0002\000.\0001\0001\000\040\000s\000e\000e\000W\000h\000a\000t\000s\000N\000e\000x\000t\000\050\000\051)
+endobj
+1357 0 obj
+<< /S /GoTo /D (subsubsection.6.9.2.12) >>
+endobj
+1360 0 obj
+(\376\377\0006\000.\0009\000.\0002\000.\0001\0002\000\040\000g\000e\000t\000S\000e\000r\000v\000e\000r\000E\000n\000c\000r\000y\000p\000t\000e\000d\000E\000x\000t\000e\000n\000s\000i\000o\000n\000s\000\050\000\051)
+endobj
+1361 0 obj
+<< /S /GoTo /D (subsubsection.6.9.2.13) >>
+endobj
+1364 0 obj
+(\376\377\0006\000.\0009\000.\0002\000.\0001\0003\000\040\000g\000e\000t\000S\000e\000r\000v\000e\000r\000C\000e\000r\000t\000V\000e\000r\000i\000f\000y\000\050\000\051)
+endobj
+1365 0 obj
+<< /S /GoTo /D (subsubsection.6.9.2.14) >>
+endobj
+1368 0 obj
+(\376\377\0006\000.\0009\000.\0002\000.\0001\0004\000\040\000g\000e\000t\000S\000e\000r\000v\000e\000r\000F\000i\000n\000i\000s\000h\000e\000d\000\050\000\051)
+endobj
+1369 0 obj
+<< /S /GoTo /D (subsubsection.6.9.2.15) >>
+endobj
+1372 0 obj
+(\376\377\0006\000.\0009\000.\0002\000.\0001\0005\000\040\000g\000e\000t\000S\000e\000r\000v\000e\000r\000H\000e\000l\000l\000o\000\050\000\051)
+endobj
+1373 0 obj
+<< /S /GoTo /D (subsubsection.6.9.2.16) >>
+endobj
+1376 0 obj
+(\376\377\0006\000.\0009\000.\0002\000.\0001\0006\000\040\000g\000e\000t\000C\000h\000e\000c\000k\000S\000e\000r\000v\000e\000r\000C\000e\000r\000t\000i\000f\000i\000c\000a\000t\000e\000C\000h\000a\000i\000n\000\050\000\051)
+endobj
+1377 0 obj
+<< /S /GoTo /D (subsubsection.6.9.2.17) >>
+endobj
+1380 0 obj
+(\376\377\0006\000.\0009\000.\0002\000.\0001\0007\000\040\000g\000e\000t\000C\000e\000r\000t\000i\000f\000i\000c\000a\000t\000e\000R\000e\000q\000u\000e\000s\000t\000\050\000\051)
+endobj
+1381 0 obj
+<< /S /GoTo /D (section.6.10) >>
+endobj
+1384 0 obj
+(\376\377\0006\000.\0001\0000\000\040\000t\000l\000s\000\137\000c\000l\000i\000e\000n\000t\000\137\000r\000e\000c\000v\000.\000h)
+endobj
+1385 0 obj
+<< /S /GoTo /D (section.6.11) >>
+endobj
+1388 0 obj
+(\376\377\0006\000.\0001\0001\000\040\000t\000l\000s\000\137\000c\000l\000i\000e\000n\000t\000\137\000s\000e\000n\000d\000.\000h\000\040\000F\000i\000l\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+1389 0 obj
+<< /S /GoTo /D (subsection.6.11.1) >>
+endobj
+1392 0 obj
+(\376\377\0006\000.\0001\0001\000.\0001\000\040\000D\000e\000t\000a\000i\000l\000e\000d\000\040\000D\000e\000s\000c\000r\000i\000p\000t\000i\000o\000n)
+endobj
+1393 0 obj
+<< /S /GoTo /D (subsection.6.11.2) >>
+endobj
+1396 0 obj
+(\376\377\0006\000.\0001\0001\000.\0002\000\040\000F\000u\000n\000c\000t\000i\000o\000n\000\040\000D\000o\000c\000u\000m\000e\000n\000t\000a\000t\000i\000o\000n)
+endobj
+1397 0 obj
+<< /S /GoTo /D (subsubsection.6.11.2.1) >>
+endobj
+1400 0 obj
+(\376\377\0006\000.\0001\0001\000.\0002\000.\0001\000\040\000s\000e\000n\000d\000C\000C\000C\000S\000\050\000\051)
+endobj
+1401 0 obj
+<< /S /GoTo /D (subsubsection.6.11.2.2) >>
+endobj
+1404 0 obj
+(\376\377\0006\000.\0001\0001\000.\0002\000.\0002\000\040\000a\000d\000d\000P\000r\000e\000S\000h\000a\000r\000e\000d\000K\000e\000y\000E\000x\000t\000\050\000\051)
+endobj
+1405 0 obj
+<< /S /GoTo /D (subsubsection.6.11.2.3) >>
+endobj
+1408 0 obj
+(\376\377\0006\000.\0001\0001\000.\0002\000.\0003\000\040\000a\000d\000d\000S\000e\000r\000v\000e\000r\000N\000a\000m\000e\000E\000x\000t\000\050\000\051)
+endobj
+1409 0 obj
+<< /S /GoTo /D (subsubsection.6.11.2.4) >>
+endobj
+1412 0 obj
+(\376\377\0006\000.\0001\0001\000.\0002\000.\0004\000\040\000a\000d\000d\000S\000u\000p\000p\000o\000r\000t\000e\000d\000G\000r\000o\000u\000p\000s\000E\000x\000t\000\050\000\051)
+endobj
+1413 0 obj
+<< /S /GoTo /D (subsubsection.6.11.2.5) >>
+endobj
+1416 0 obj
+(\376\377\0006\000.\0001\0001\000.\0002\000.\0005\000\040\000a\000d\000d\000S\000e\000r\000v\000e\000r\000R\000a\000w\000P\000u\000b\000l\000i\000c\000K\000e\000y\000\050\000\051)
+endobj
+1417 0 obj
+<< /S /GoTo /D (subsubsection.6.11.2.6) >>
+endobj
+1420 0 obj
+(\376\377\0006\000.\0001\0001\000.\0002\000.\0006\000\040\000a\000d\000d\000C\000l\000i\000e\000n\000t\000R\000a\000w\000P\000u\000b\000l\000i\000c\000K\000e\000y\000\050\000\051)
+endobj
+1421 0 obj
+<< /S /GoTo /D (subsubsection.6.11.2.7) >>
+endobj
+1424 0 obj
+(\376\377\0006\000.\0001\0001\000.\0002\000.\0007\000\040\000a\000d\000d\000S\000i\000g\000A\000l\000g\000s\000E\000x\000t\000\050\000\051)
+endobj
+1425 0 obj
+<< /S /GoTo /D (subsubsection.6.11.2.8) >>
+endobj
+1428 0 obj
+(\376\377\0006\000.\0001\0001\000.\0002\000.\0008\000\040\000a\000d\000d\000S\000i\000g\000A\000l\000g\000s\000C\000e\000r\000t\000E\000x\000t\000\050\000\051)
+endobj
+1429 0 obj
+<< /S /GoTo /D (subsubsection.6.11.2.9) >>
+endobj
+1432 0 obj
+(\376\377\0006\000.\0001\0001\000.\0002\000.\0009\000\040\000a\000d\000d\000K\000e\000y\000S\000h\000a\000r\000e\000E\000x\000t\000\050\000\051)
+endobj
+1433 0 obj
+<< /S /GoTo /D (subsubsection.6.11.2.10) >>
+endobj
+1436 0 obj
+(\376\377\0006\000.\0001\0001\000.\0002\000.\0001\0000\000\040\000a\000d\000d\000A\000L\000P\000N\000E\000x\000t\000\050\000\051)
+endobj
+1437 0 obj
+<< /S /GoTo /D (subsubsection.6.11.2.11) >>
+endobj
+1440 0 obj
+(\376\377\0006\000.\0001\0001\000.\0002\000.\0001\0001\000\040\000a\000d\000d\000M\000F\000L\000E\000x\000t\000\050\000\051)
+endobj
+1441 0 obj
+<< /S /GoTo /D (subsubsection.6.11.2.12) >>
+endobj
+1444 0 obj
+(\376\377\0006\000.\0001\0001\000.\0002\000.\0001\0002\000\040\000a\000d\000d\000R\000S\000L\000E\000x\000t\000\050\000\051)
+endobj
+1445 0 obj
+<< /S /GoTo /D (subsubsection.6.11.2.13) >>
+endobj
+1448 0 obj
+(\376\377\0006\000.\0001\0001\000.\0002\000.\0001\0003\000\040\000a\000d\000d\000P\000S\000K\000M\000o\000d\000e\000s\000E\000x\000t\000\050\000\051)
+endobj
+1449 0 obj
+<< /S /GoTo /D (subsubsection.6.11.2.14) >>
+endobj
+1452 0 obj
+(\376\377\0006\000.\0001\0001\000.\0002\000.\0001\0004\000\040\000a\000d\000d\000V\000e\000r\000s\000i\000o\000n\000E\000x\000t\000\050\000\051)
+endobj
+1453 0 obj
+<< /S /GoTo /D (subsubsection.6.11.2.15) >>
+endobj
+1456 0 obj
+(\376\377\0006\000.\0001\0001\000.\0002\000.\0001\0005\000\040\000a\000d\000d\000P\000a\000d\000d\000i\000n\000g\000\050\000\051)
+endobj
+1457 0 obj
+<< /S /GoTo /D (subsubsection.6.11.2.16) >>
+endobj
+1460 0 obj
+(\376\377\0006\000.\0001\0001\000.\0002\000.\0001\0006\000\040\000a\000d\000d\000C\000o\000o\000k\000i\000e\000E\000x\000t\000\050\000\051)
+endobj
+1461 0 obj
+<< /S /GoTo /D (subsubsection.6.11.2.17) >>
+endobj
+1464 0 obj
+(\376\377\0006\000.\0001\0001\000.\0002\000.\0001\0007\000\040\000a\000d\000d\000E\000a\000r\000l\000y\000D\000a\000t\000a\000E\000x\000t\000\050\000\051)
+endobj
+1465 0 obj
+<< /S /GoTo /D (subsubsection.6.11.2.18) >>
+endobj
+1468 0 obj
+(\376\377\0006\000.\0001\0001\000.\0002\000.\0001\0008\000\040\000a\000d\000d\000P\000o\000s\000t\000H\000S\000A\000u\000t\000h\000\050\000\051)
+endobj
+1469 0 obj
+<< /S /GoTo /D (subsubsection.6.11.2.19) >>
+endobj
+1472 0 obj
+(\376\377\0006\000.\0001\0001\000.\0002\000.\0001\0009\000\040\000c\000l\000i\000e\000n\000t\000R\000a\000n\000d\000o\000m\000\050\000\051)
+endobj
+1473 0 obj
+<< /S /GoTo /D (subsubsection.6.11.2.20) >>
+endobj
+1476 0 obj
+(\376\377\0006\000.\0001\0001\000.\0002\000.\0002\0000\000\040\000c\000i\000p\000h\000e\000r\000S\000u\000i\000t\000e\000s\000\050\000\051)
+endobj
+1477 0 obj
+<< /S /GoTo /D (subsubsection.6.11.2.21) >>
+endobj
+1480 0 obj
+(\376\377\0006\000.\0001\0001\000.\0002\000.\0002\0001\000\040\000s\000e\000n\000d\000C\000l\000i\000e\000n\000t\000M\000e\000s\000s\000a\000g\000e\000\050\000\051)
+endobj
+1481 0 obj
+<< /S /GoTo /D (subsubsection.6.11.2.22) >>
+endobj
+1484 0 obj
+(\376\377\0006\000.\0001\0001\000.\0002\000.\0002\0002\000\040\000s\000e\000n\000d\000B\000i\000n\000d\000e\000r\000\050\000\051)
+endobj
+1485 0 obj
+<< /S /GoTo /D (subsubsection.6.11.2.23) >>
+endobj
+1488 0 obj
+(\376\377\0006\000.\0001\0001\000.\0002\000.\0002\0003\000\040\000s\000e\000n\000d\000C\000l\000i\000e\000n\000t\000H\000e\000l\000l\000o\000\050\000\051)
+endobj
+1489 0 obj
+<< /S /GoTo /D (subsubsection.6.11.2.24) >>
+endobj
+1492 0 obj
+(\376\377\0006\000.\0001\0001\000.\0002\000.\0002\0004\000\040\000s\000e\000n\000d\000A\000l\000e\000r\000t\000\050\000\051)
+endobj
+1493 0 obj
+<< /S /GoTo /D (subsubsection.6.11.2.25) >>
+endobj
+1496 0 obj
+(\376\377\0006\000.\0001\0001\000.\0002\000.\0002\0005\000\040\000s\000e\000n\000d\000K\000e\000y\000U\000p\000d\000a\000t\000e\000\050\000\051)
+endobj
+1497 0 obj
+<< /S /GoTo /D (subsubsection.6.11.2.26) >>
+endobj
+1500 0 obj
+(\376\377\0006\000.\0001\0001\000.\0002\000.\0002\0006\000\040\000s\000e\000n\000d\000C\000l\000i\000e\000n\000t\000F\000i\000n\000i\000s\000h\000\050\000\051)
+endobj
+1501 0 obj
+<< /S /GoTo /D (subsubsection.6.11.2.27) >>
+endobj
+1504 0 obj
+(\376\377\0006\000.\0001\0001\000.\0002\000.\0002\0007\000\040\000s\000e\000n\000d\000C\000l\000i\000e\000n\000t\000C\000e\000r\000t\000i\000f\000i\000c\000a\000t\000e\000C\000h\000a\000i\000n\000\050\000\051)
+endobj
+1505 0 obj
+<< /S /GoTo /D (subsubsection.6.11.2.28) >>
+endobj
+1508 0 obj
+(\376\377\0006\000.\0001\0001\000.\0002\000.\0002\0008\000\040\000s\000e\000n\000d\000C\000l\000i\000e\000n\000t\000C\000e\000r\000t\000V\000e\000r\000i\000f\000y\000\050\000\051)
+endobj
+1509 0 obj
+<< /S /GoTo /D (subsubsection.6.11.2.29) >>
+endobj
+1512 0 obj
+(\376\377\0006\000.\0001\0001\000.\0002\000.\0002\0009\000\040\000s\000e\000n\000d\000E\000n\000d\000O\000f\000E\000a\000r\000l\000y\000D\000a\000t\000a\000\050\000\051)
+endobj
+1513 0 obj
+<< /S /GoTo /D (subsubsection.6.11.2.30) >>
+endobj
+1516 0 obj
+(\376\377\0006\000.\0001\0001\000.\0002\000.\0003\0000\000\040\000a\000l\000e\000r\000t\000\137\000f\000r\000o\000m\000\137\000c\000a\000u\000s\000e\000\050\000\051)
+endobj
+1517 0 obj
+<< /S /GoTo /D (section.6.12) >>
+endobj
+1520 0 obj
+(\376\377\0006\000.\0001\0002\000\040\000t\000l\000s\000\137\000c\000l\000i\000e\000n\000t\000\137\000s\000e\000n\000d\000.\000h)
+endobj
+1521 0 obj
+<< /S /GoTo /D (section.6.13) >>
+endobj
+1524 0 obj
+(\376\377\0006\000.\0001\0003\000\040\000t\000l\000s\000\137\000k\000e\000y\000s\000\137\000c\000a\000l\000c\000.\000h\000\040\000F\000i\000l\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+1525 0 obj
+<< /S /GoTo /D (subsection.6.13.1) >>
+endobj
+1528 0 obj
+(\376\377\0006\000.\0001\0003\000.\0001\000\040\000D\000e\000t\000a\000i\000l\000e\000d\000\040\000D\000e\000s\000c\000r\000i\000p\000t\000i\000o\000n)
+endobj
+1529 0 obj
+<< /S /GoTo /D (subsection.6.13.2) >>
+endobj
+1532 0 obj
+(\376\377\0006\000.\0001\0003\000.\0002\000\040\000F\000u\000n\000c\000t\000i\000o\000n\000\040\000D\000o\000c\000u\000m\000e\000n\000t\000a\000t\000i\000o\000n)
+endobj
+1533 0 obj
+<< /S /GoTo /D (subsubsection.6.13.2.1) >>
+endobj
+1536 0 obj
+(\376\377\0006\000.\0001\0003\000.\0002\000.\0001\000\040\000i\000n\000i\000t\000T\000r\000a\000n\000s\000c\000r\000i\000p\000t\000H\000a\000s\000h\000\050\000\051)
+endobj
+1537 0 obj
+<< /S /GoTo /D (subsubsection.6.13.2.2) >>
+endobj
+1540 0 obj
+(\376\377\0006\000.\0001\0003\000.\0002\000.\0002\000\040\000r\000u\000n\000n\000i\000n\000g\000H\000a\000s\000h\000\050\000\051)
+endobj
+1541 0 obj
+<< /S /GoTo /D (subsubsection.6.13.2.3) >>
+endobj
+1544 0 obj
+(\376\377\0006\000.\0001\0003\000.\0002\000.\0003\000\040\000r\000u\000n\000n\000i\000n\000g\000H\000a\000s\000h\000I\000O\000\050\000\051)
+endobj
+1545 0 obj
+<< /S /GoTo /D (subsubsection.6.13.2.4) >>
+endobj
+1548 0 obj
+(\376\377\0006\000.\0001\0003\000.\0002\000.\0004\000\040\000r\000e\000w\000i\000n\000d\000I\000O\000\050\000\051)
+endobj
+1549 0 obj
+<< /S /GoTo /D (subsubsection.6.13.2.5) >>
+endobj
+1552 0 obj
+(\376\377\0006\000.\0001\0003\000.\0002\000.\0005\000\040\000r\000u\000n\000n\000i\000n\000g\000H\000a\000s\000h\000I\000O\000r\000e\000w\000i\000n\000d\000\050\000\051)
+endobj
+1553 0 obj
+<< /S /GoTo /D (subsubsection.6.13.2.6) >>
+endobj
+1556 0 obj
+(\376\377\0006\000.\0001\0003\000.\0002\000.\0006\000\040\000t\000r\000a\000n\000s\000c\000r\000i\000p\000t\000H\000a\000s\000h\000\050\000\051)
+endobj
+1557 0 obj
+<< /S /GoTo /D (subsubsection.6.13.2.7) >>
+endobj
+1560 0 obj
+(\376\377\0006\000.\0001\0003\000.\0002\000.\0007\000\040\000r\000u\000n\000n\000i\000n\000g\000S\000y\000n\000t\000h\000e\000t\000i\000c\000H\000a\000s\000h\000\050\000\051)
+endobj
+1561 0 obj
+<< /S /GoTo /D (subsubsection.6.13.2.8) >>
+endobj
+1564 0 obj
+(\376\377\0006\000.\0001\0003\000.\0002\000.\0008\000\040\000i\000n\000i\000t\000C\000r\000y\000p\000t\000o\000C\000o\000n\000t\000e\000x\000t\000\050\000\051)
+endobj
+1565 0 obj
+<< /S /GoTo /D (subsubsection.6.13.2.9) >>
+endobj
+1568 0 obj
+(\376\377\0006\000.\0001\0003\000.\0002\000.\0009\000\040\000u\000p\000d\000a\000t\000e\000C\000r\000y\000p\000t\000o\000C\000o\000n\000t\000e\000x\000t\000\050\000\051)
+endobj
+1569 0 obj
+<< /S /GoTo /D (subsubsection.6.13.2.10) >>
+endobj
+1572 0 obj
+(\376\377\0006\000.\0001\0003\000.\0002\000.\0001\0000\000\040\000i\000n\000c\000r\000e\000m\000e\000n\000t\000C\000r\000y\000p\000t\000o\000C\000o\000n\000t\000e\000x\000t\000\050\000\051)
+endobj
+1573 0 obj
+<< /S /GoTo /D (subsubsection.6.13.2.11) >>
+endobj
+1576 0 obj
+(\376\377\0006\000.\0001\0003\000.\0002\000.\0001\0001\000\040\000c\000r\000e\000a\000t\000e\000C\000r\000y\000p\000t\000o\000C\000o\000n\000t\000e\000x\000t\000\050\000\051)
+endobj
+1577 0 obj
+<< /S /GoTo /D (subsubsection.6.13.2.12) >>
+endobj
+1580 0 obj
+(\376\377\0006\000.\0001\0003\000.\0002\000.\0001\0002\000\040\000c\000r\000e\000a\000t\000e\000S\000e\000n\000d\000C\000r\000y\000p\000t\000o\000C\000o\000n\000t\000e\000x\000t\000\050\000\051)
+endobj
+1581 0 obj
+<< /S /GoTo /D (subsubsection.6.13.2.13) >>
+endobj
+1584 0 obj
+(\376\377\0006\000.\0001\0003\000.\0002\000.\0001\0003\000\040\000c\000r\000e\000a\000t\000e\000R\000e\000c\000v\000C\000r\000y\000p\000t\000o\000C\000o\000n\000t\000e\000x\000t\000\050\000\051)
+endobj
+1585 0 obj
+<< /S /GoTo /D (subsubsection.6.13.2.14) >>
+endobj
+1588 0 obj
+(\376\377\0006\000.\0001\0003\000.\0002\000.\0001\0004\000\040\000r\000e\000c\000o\000v\000e\000r\000P\000S\000K\000\050\000\051)
+endobj
+1589 0 obj
+<< /S /GoTo /D (subsubsection.6.13.2.15) >>
+endobj
+1592 0 obj
+(\376\377\0006\000.\0001\0003\000.\0002\000.\0001\0005\000\040\000d\000e\000r\000i\000v\000e\000E\000a\000r\000l\000y\000S\000e\000c\000r\000e\000t\000s\000\050\000\051)
+endobj
+1593 0 obj
+<< /S /GoTo /D (subsubsection.6.13.2.16) >>
+endobj
+1596 0 obj
+(\376\377\0006\000.\0001\0003\000.\0002\000.\0001\0006\000\040\000d\000e\000r\000i\000v\000e\000L\000a\000t\000e\000r\000S\000e\000c\000r\000e\000t\000s\000\050\000\051)
+endobj
+1597 0 obj
+<< /S /GoTo /D (subsubsection.6.13.2.17) >>
+endobj
+1600 0 obj
+(\376\377\0006\000.\0001\0003\000.\0002\000.\0001\0007\000\040\000d\000e\000r\000i\000v\000e\000H\000a\000n\000d\000s\000h\000a\000k\000e\000S\000e\000c\000r\000e\000t\000s\000\050\000\051)
+endobj
+1601 0 obj
+<< /S /GoTo /D (subsubsection.6.13.2.18) >>
+endobj
+1604 0 obj
+(\376\377\0006\000.\0001\0003\000.\0002\000.\0001\0008\000\040\000d\000e\000r\000i\000v\000e\000A\000p\000p\000l\000i\000c\000a\000t\000i\000o\000n\000S\000e\000c\000r\000e\000t\000s\000\050\000\051)
+endobj
+1605 0 obj
+<< /S /GoTo /D (subsubsection.6.13.2.19) >>
+endobj
+1608 0 obj
+(\376\377\0006\000.\0001\0003\000.\0002\000.\0001\0009\000\040\000d\000e\000r\000i\000v\000e\000U\000p\000d\000a\000t\000e\000d\000K\000e\000y\000s\000\050\000\051)
+endobj
+1609 0 obj
+<< /S /GoTo /D (subsubsection.6.13.2.20) >>
+endobj
+1612 0 obj
+(\376\377\0006\000.\0001\0003\000.\0002\000.\0002\0000\000\040\000c\000h\000e\000c\000k\000V\000e\000r\000i\000f\000e\000r\000D\000a\000t\000a\000\050\000\051)
+endobj
+1613 0 obj
+<< /S /GoTo /D (subsubsection.6.13.2.21) >>
+endobj
+1616 0 obj
+(\376\377\0006\000.\0001\0003\000.\0002\000.\0002\0001\000\040\000d\000e\000r\000i\000v\000e\000V\000e\000r\000i\000f\000e\000r\000D\000a\000t\000a\000\050\000\051)
+endobj
+1617 0 obj
+<< /S /GoTo /D (subsubsection.6.13.2.22) >>
+endobj
+1620 0 obj
+(\376\377\0006\000.\0001\0003\000.\0002\000.\0002\0002\000\040\000c\000h\000e\000c\000k\000S\000e\000r\000v\000e\000r\000C\000e\000r\000t\000V\000e\000r\000i\000f\000i\000e\000r\000\050\000\051)
+endobj
+1621 0 obj
+<< /S /GoTo /D (subsubsection.6.13.2.23) >>
+endobj
+1624 0 obj
+(\376\377\0006\000.\0001\0003\000.\0002\000.\0002\0003\000\040\000c\000r\000e\000a\000t\000e\000C\000l\000i\000e\000n\000t\000C\000e\000r\000t\000V\000e\000r\000i\000f\000i\000e\000r\000\050\000\051)
+endobj
+1625 0 obj
+<< /S /GoTo /D (section.6.14) >>
+endobj
+1628 0 obj
+(\376\377\0006\000.\0001\0004\000\040\000t\000l\000s\000\137\000k\000e\000y\000s\000\137\000c\000a\000l\000c\000.\000h)
+endobj
+1629 0 obj
+<< /S /GoTo /D (section.6.15) >>
+endobj
+1632 0 obj
+(\376\377\0006\000.\0001\0005\000\040\000t\000l\000s\000\137\000l\000o\000g\000g\000e\000r\000.\000h\000\040\000F\000i\000l\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+1633 0 obj
+<< /S /GoTo /D (subsection.6.15.1) >>
+endobj
+1636 0 obj
+(\376\377\0006\000.\0001\0005\000.\0001\000\040\000D\000e\000t\000a\000i\000l\000e\000d\000\040\000D\000e\000s\000c\000r\000i\000p\000t\000i\000o\000n)
+endobj
+1637 0 obj
+<< /S /GoTo /D (subsection.6.15.2) >>
+endobj
+1640 0 obj
+(\376\377\0006\000.\0001\0005\000.\0002\000\040\000F\000u\000n\000c\000t\000i\000o\000n\000\040\000D\000o\000c\000u\000m\000e\000n\000t\000a\000t\000i\000o\000n)
+endobj
+1641 0 obj
+<< /S /GoTo /D (subsubsection.6.15.2.1) >>
+endobj
+1644 0 obj
+(\376\377\0006\000.\0001\0005\000.\0002\000.\0001\000\040\000m\000y\000p\000r\000i\000n\000t\000f\000\050\000\051)
+endobj
+1645 0 obj
+<< /S /GoTo /D (subsubsection.6.15.2.2) >>
+endobj
+1648 0 obj
+(\376\377\0006\000.\0001\0005\000.\0002\000.\0002\000\040\000l\000o\000g\000\050\000\051)
+endobj
+1649 0 obj
+<< /S /GoTo /D (subsubsection.6.15.2.3) >>
+endobj
+1652 0 obj
+(\376\377\0006\000.\0001\0005\000.\0002\000.\0003\000\040\000l\000o\000g\000S\000e\000r\000v\000e\000r\000H\000e\000l\000l\000o\000\050\000\051)
+endobj
+1653 0 obj
+<< /S /GoTo /D (subsubsection.6.15.2.4) >>
+endobj
+1656 0 obj
+(\376\377\0006\000.\0001\0005\000.\0002\000.\0004\000\040\000l\000o\000g\000T\000i\000c\000k\000e\000t\000\050\000\051)
+endobj
+1657 0 obj
+<< /S /GoTo /D (subsubsection.6.15.2.5) >>
+endobj
+1660 0 obj
+(\376\377\0006\000.\0001\0005\000.\0002\000.\0005\000\040\000l\000o\000g\000E\000n\000c\000E\000x\000t\000\050\000\051)
+endobj
+1661 0 obj
+<< /S /GoTo /D (subsubsection.6.15.2.6) >>
+endobj
+1664 0 obj
+(\376\377\0006\000.\0001\0005\000.\0002\000.\0006\000\040\000l\000o\000g\000C\000e\000r\000t\000\050\000\051)
+endobj
+1665 0 obj
+<< /S /GoTo /D (subsubsection.6.15.2.7) >>
+endobj
+1668 0 obj
+(\376\377\0006\000.\0001\0005\000.\0002\000.\0007\000\040\000l\000o\000g\000C\000e\000r\000t\000D\000e\000t\000a\000i\000l\000s\000\050\000\051)
+endobj
+1669 0 obj
+<< /S /GoTo /D (subsubsection.6.15.2.8) >>
+endobj
+1672 0 obj
+(\376\377\0006\000.\0001\0005\000.\0002\000.\0008\000\040\000l\000o\000g\000S\000e\000r\000v\000e\000r\000R\000e\000s\000p\000o\000n\000s\000e\000\050\000\051)
+endobj
+1673 0 obj
+<< /S /GoTo /D (subsubsection.6.15.2.9) >>
+endobj
+1676 0 obj
+(\376\377\0006\000.\0001\0005\000.\0002\000.\0009\000\040\000l\000o\000g\000A\000l\000e\000r\000t\000\050\000\051)
+endobj
+1677 0 obj
+<< /S /GoTo /D (subsubsection.6.15.2.10) >>
+endobj
+1680 0 obj
+(\376\377\0006\000.\0001\0005\000.\0002\000.\0001\0000\000\040\000l\000o\000g\000C\000i\000p\000h\000e\000r\000S\000u\000i\000t\000e\000\050\000\051)
+endobj
+1681 0 obj
+<< /S /GoTo /D (subsubsection.6.15.2.11) >>
+endobj
+1684 0 obj
+(\376\377\0006\000.\0001\0005\000.\0002\000.\0001\0001\000\040\000l\000o\000g\000K\000e\000y\000E\000x\000c\000h\000a\000n\000g\000e\000\050\000\051)
+endobj
+1685 0 obj
+<< /S /GoTo /D (subsubsection.6.15.2.12) >>
+endobj
+1688 0 obj
+(\376\377\0006\000.\0001\0005\000.\0002\000.\0001\0002\000\040\000l\000o\000g\000S\000i\000g\000A\000l\000g\000\050\000\051)
+endobj
+1689 0 obj
+<< /S /GoTo /D (section.6.16) >>
+endobj
+1692 0 obj
+(\376\377\0006\000.\0001\0006\000\040\000t\000l\000s\000\137\000l\000o\000g\000g\000e\000r\000.\000h)
+endobj
+1693 0 obj
+<< /S /GoTo /D (section.6.17) >>
+endobj
+1696 0 obj
+(\376\377\0006\000.\0001\0007\000\040\000t\000l\000s\000\137\000o\000c\000t\000a\000d\000s\000.\000h\000\040\000F\000i\000l\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+1697 0 obj
+<< /S /GoTo /D (subsection.6.17.1) >>
+endobj
+1700 0 obj
+(\376\377\0006\000.\0001\0007\000.\0001\000\040\000D\000e\000t\000a\000i\000l\000e\000d\000\040\000D\000e\000s\000c\000r\000i\000p\000t\000i\000o\000n)
+endobj
+1701 0 obj
+<< /S /GoTo /D (subsection.6.17.2) >>
+endobj
+1704 0 obj
+(\376\377\0006\000.\0001\0007\000.\0002\000\040\000F\000u\000n\000c\000t\000i\000o\000n\000\040\000D\000o\000c\000u\000m\000e\000n\000t\000a\000t\000i\000o\000n)
+endobj
+1705 0 obj
+<< /S /GoTo /D (subsubsection.6.17.2.1) >>
+endobj
+1708 0 obj
+(\376\377\0006\000.\0001\0007\000.\0002\000.\0001\000\040\000m\000i\000l\000l\000i\000s\000\050\000\051)
+endobj
+1709 0 obj
+<< /S /GoTo /D (subsubsection.6.17.2.2) >>
+endobj
+1712 0 obj
+(\376\377\0006\000.\0001\0007\000.\0002\000.\0002\000\040\000O\000C\000T\000\137\000a\000p\000p\000e\000n\000d\000\137\000i\000n\000t\000\050\000\051)
+endobj
+1713 0 obj
+<< /S /GoTo /D (subsubsection.6.17.2.3) >>
+endobj
+1716 0 obj
+(\376\377\0006\000.\0001\0007\000.\0002\000.\0003\000\040\000O\000C\000T\000\137\000a\000p\000p\000e\000n\000d\000\137\000o\000c\000t\000a\000d\000\050\000\051)
+endobj
+1717 0 obj
+<< /S /GoTo /D (subsubsection.6.17.2.4) >>
+endobj
+1720 0 obj
+(\376\377\0006\000.\0001\0007\000.\0002\000.\0004\000\040\000O\000C\000T\000\137\000c\000o\000m\000p\000a\000r\000e\000\050\000\051)
+endobj
+1721 0 obj
+<< /S /GoTo /D (subsubsection.6.17.2.5) >>
+endobj
+1724 0 obj
+(\376\377\0006\000.\0001\0007\000.\0002\000.\0005\000\040\000O\000C\000T\000\137\000s\000h\000i\000f\000t\000\137\000l\000e\000f\000t\000\050\000\051)
+endobj
+1725 0 obj
+<< /S /GoTo /D (subsubsection.6.17.2.6) >>
+endobj
+1728 0 obj
+(\376\377\0006\000.\0001\0007\000.\0002\000.\0006\000\040\000O\000C\000T\000\137\000k\000i\000l\000l\000\050\000\051)
+endobj
+1729 0 obj
+<< /S /GoTo /D (subsubsection.6.17.2.7) >>
+endobj
+1732 0 obj
+(\376\377\0006\000.\0001\0007\000.\0002\000.\0007\000\040\000O\000C\000T\000\137\000f\000r\000o\000m\000\137\000h\000e\000x\000\050\000\051)
+endobj
+1733 0 obj
+<< /S /GoTo /D (subsubsection.6.17.2.8) >>
+endobj
+1736 0 obj
+(\376\377\0006\000.\0001\0007\000.\0002\000.\0008\000\040\000O\000C\000T\000\137\000a\000p\000p\000e\000n\000d\000\137\000s\000t\000r\000i\000n\000g\000\050\000\051)
+endobj
+1737 0 obj
+<< /S /GoTo /D (subsubsection.6.17.2.9) >>
+endobj
+1740 0 obj
+(\376\377\0006\000.\0001\0007\000.\0002\000.\0009\000\040\000O\000C\000T\000\137\000a\000p\000p\000e\000n\000d\000\137\000b\000y\000t\000e\000\050\000\051)
+endobj
+1741 0 obj
+<< /S /GoTo /D (subsubsection.6.17.2.10) >>
+endobj
+1744 0 obj
+(\376\377\0006\000.\0001\0007\000.\0002\000.\0001\0000\000\040\000O\000C\000T\000\137\000a\000p\000p\000e\000n\000d\000\137\000b\000y\000t\000e\000s\000\050\000\051)
+endobj
+1745 0 obj
+<< /S /GoTo /D (subsubsection.6.17.2.11) >>
+endobj
+1748 0 obj
+(\376\377\0006\000.\0001\0007\000.\0002\000.\0001\0001\000\040\000O\000C\000T\000\137\000f\000r\000o\000m\000\137\000b\000a\000s\000e\0006\0004\000\050\000\051)
+endobj
+1749 0 obj
+<< /S /GoTo /D (subsubsection.6.17.2.12) >>
+endobj
+1752 0 obj
+(\376\377\0006\000.\0001\0007\000.\0002\000.\0001\0002\000\040\000O\000C\000T\000\137\000r\000e\000v\000e\000r\000s\000e\000\050\000\051)
+endobj
+1753 0 obj
+<< /S /GoTo /D (subsubsection.6.17.2.13) >>
+endobj
+1756 0 obj
+(\376\377\0006\000.\0001\0007\000.\0002\000.\0001\0003\000\040\000O\000C\000T\000\137\000t\000r\000u\000n\000c\000a\000t\000e\000\050\000\051)
+endobj
+1757 0 obj
+<< /S /GoTo /D (subsubsection.6.17.2.14) >>
+endobj
+1760 0 obj
+(\376\377\0006\000.\0001\0007\000.\0002\000.\0001\0004\000\040\000O\000C\000T\000\137\000c\000o\000p\000y\000\050\000\051)
+endobj
+1761 0 obj
+<< /S /GoTo /D (subsubsection.6.17.2.15) >>
+endobj
+1764 0 obj
+(\376\377\0006\000.\0001\0007\000.\0002\000.\0001\0005\000\040\000O\000C\000T\000\137\000o\000u\000t\000p\000u\000t\000\137\000h\000e\000x\000\050\000\051)
+endobj
+1765 0 obj
+<< /S /GoTo /D (subsubsection.6.17.2.16) >>
+endobj
+1768 0 obj
+(\376\377\0006\000.\0001\0007\000.\0002\000.\0001\0006\000\040\000O\000C\000T\000\137\000o\000u\000t\000p\000u\000t\000\137\000s\000t\000r\000i\000n\000g\000\050\000\051)
+endobj
+1769 0 obj
+<< /S /GoTo /D (subsubsection.6.17.2.17) >>
+endobj
+1772 0 obj
+(\376\377\0006\000.\0001\0007\000.\0002\000.\0001\0007\000\040\000O\000C\000T\000\137\000o\000u\000t\000p\000u\000t\000\137\000b\000a\000s\000e\0006\0004\000\050\000\051)
+endobj
+1773 0 obj
+<< /S /GoTo /D (section.6.18) >>
+endobj
+1776 0 obj
+(\376\377\0006\000.\0001\0008\000\040\000t\000l\000s\000\137\000o\000c\000t\000a\000d\000s\000.\000h)
+endobj
+1777 0 obj
+<< /S /GoTo /D (section.6.19) >>
+endobj
+1780 0 obj
+(\376\377\0006\000.\0001\0009\000\040\000t\000l\000s\000\137\000p\000q\000i\000b\000e\000.\000h\000\040\000F\000i\000l\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+1781 0 obj
+<< /S /GoTo /D (subsection.6.19.1) >>
+endobj
+1784 0 obj
+(\376\377\0006\000.\0001\0009\000.\0001\000\040\000D\000e\000t\000a\000i\000l\000e\000d\000\040\000D\000e\000s\000c\000r\000i\000p\000t\000i\000o\000n)
+endobj
+1785 0 obj
+<< /S /GoTo /D (subsection.6.19.2) >>
+endobj
+1788 0 obj
+(\376\377\0006\000.\0001\0009\000.\0002\000\040\000F\000u\000n\000c\000t\000i\000o\000n\000\040\000D\000o\000c\000u\000m\000e\000n\000t\000a\000t\000i\000o\000n)
+endobj
+1789 0 obj
+<< /S /GoTo /D (subsubsection.6.19.2.1) >>
+endobj
+1792 0 obj
+(\376\377\0006\000.\0001\0009\000.\0002\000.\0001\000\040\000P\000Q\000I\000B\000E\000\137\000C\000C\000A\000\137\000E\000N\000C\000R\000Y\000P\000T\000\050\000\051)
+endobj
+1793 0 obj
+<< /S /GoTo /D (subsubsection.6.19.2.2) >>
+endobj
+1796 0 obj
+(\376\377\0006\000.\0001\0009\000.\0002\000.\0002\000\040\000P\000Q\000I\000B\000E\000\137\000C\000C\000A\000\137\000D\000E\000C\000R\000Y\000P\000T\000\050\000\051)
+endobj
+1797 0 obj
+<< /S /GoTo /D (section.6.20) >>
+endobj
+1800 0 obj
+(\376\377\0006\000.\0002\0000\000\040\000t\000l\000s\000\137\000p\000q\000i\000b\000e\000.\000h)
+endobj
+1801 0 obj
+<< /S /GoTo /D (section.6.21) >>
+endobj
+1804 0 obj
+(\376\377\0006\000.\0002\0001\000\040\000t\000l\000s\000\137\000p\000r\000o\000t\000o\000c\000o\000l\000.\000h\000\040\000F\000i\000l\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+1805 0 obj
+<< /S /GoTo /D (subsection.6.21.1) >>
+endobj
+1808 0 obj
+(\376\377\0006\000.\0002\0001\000.\0001\000\040\000D\000e\000t\000a\000i\000l\000e\000d\000\040\000D\000e\000s\000c\000r\000i\000p\000t\000i\000o\000n)
+endobj
+1809 0 obj
+<< /S /GoTo /D (subsection.6.21.2) >>
+endobj
+1812 0 obj
+(\376\377\0006\000.\0002\0001\000.\0002\000\040\000F\000u\000n\000c\000t\000i\000o\000n\000\040\000D\000o\000c\000u\000m\000e\000n\000t\000a\000t\000i\000o\000n)
+endobj
+1813 0 obj
+<< /S /GoTo /D (subsubsection.6.21.2.1) >>
+endobj
+1816 0 obj
+(\376\377\0006\000.\0002\0001\000.\0002\000.\0001\000\040\000T\000L\000S\0001\0003\000\137\000s\000t\000a\000r\000t\000\050\000\051)
+endobj
+1817 0 obj
+<< /S /GoTo /D (subsubsection.6.21.2.2) >>
+endobj
+1820 0 obj
+(\376\377\0006\000.\0002\0001\000.\0002\000.\0002\000\040\000T\000L\000S\0001\0003\000\137\000e\000n\000d\000\050\000\051)
+endobj
+1821 0 obj
+<< /S /GoTo /D (subsubsection.6.21.2.3) >>
+endobj
+1824 0 obj
+(\376\377\0006\000.\0002\0001\000.\0002\000.\0003\000\040\000T\000L\000S\0001\0003\000\137\000s\000t\000o\000p\000\050\000\051)
+endobj
+1825 0 obj
+<< /S /GoTo /D (subsubsection.6.21.2.4) >>
+endobj
+1828 0 obj
+(\376\377\0006\000.\0002\0001\000.\0002\000.\0004\000\040\000T\000L\000S\0001\0003\000\137\000c\000o\000n\000n\000e\000c\000t\000\050\000\051)
+endobj
+1829 0 obj
+<< /S /GoTo /D (subsubsection.6.21.2.5) >>
+endobj
+1832 0 obj
+(\376\377\0006\000.\0002\0001\000.\0002\000.\0005\000\040\000T\000L\000S\0001\0003\000\137\000s\000e\000n\000d\000\050\000\051)
+endobj
+1833 0 obj
+<< /S /GoTo /D (subsubsection.6.21.2.6) >>
+endobj
+1836 0 obj
+(\376\377\0006\000.\0002\0001\000.\0002\000.\0006\000\040\000T\000L\000S\0001\0003\000\137\000r\000e\000c\000v\000\050\000\051)
+endobj
+1837 0 obj
+<< /S /GoTo /D (subsubsection.6.21.2.7) >>
+endobj
+1840 0 obj
+(\376\377\0006\000.\0002\0001\000.\0002\000.\0007\000\040\000T\000L\000S\0001\0003\000\137\000c\000l\000e\000a\000n\000\050\000\051)
+endobj
+1841 0 obj
+<< /S /GoTo /D (section.6.22) >>
+endobj
+1844 0 obj
+(\376\377\0006\000.\0002\0002\000\040\000t\000l\000s\000\137\000p\000r\000o\000t\000o\000c\000o\000l\000.\000h)
+endobj
+1845 0 obj
+<< /S /GoTo /D (section.6.23) >>
+endobj
+1848 0 obj
+(\376\377\0006\000.\0002\0003\000\040\000t\000l\000s\000\137\000s\000a\000l\000.\000h\000\040\000F\000i\000l\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+1849 0 obj
+<< /S /GoTo /D (subsection.6.23.1) >>
+endobj
+1852 0 obj
+(\376\377\0006\000.\0002\0003\000.\0001\000\040\000D\000e\000t\000a\000i\000l\000e\000d\000\040\000D\000e\000s\000c\000r\000i\000p\000t\000i\000o\000n)
+endobj
+1853 0 obj
+<< /S /GoTo /D (subsection.6.23.2) >>
+endobj
+1856 0 obj
+(\376\377\0006\000.\0002\0003\000.\0002\000\040\000F\000u\000n\000c\000t\000i\000o\000n\000\040\000D\000o\000c\000u\000m\000e\000n\000t\000a\000t\000i\000o\000n)
+endobj
+1857 0 obj
+<< /S /GoTo /D (subsubsection.6.23.2.1) >>
+endobj
+1860 0 obj
+(\376\377\0006\000.\0002\0003\000.\0002\000.\0001\000\040\000S\000A\000L\000\137\000n\000a\000m\000e\000\050\000\051)
+endobj
+1861 0 obj
+<< /S /GoTo /D (subsubsection.6.23.2.2) >>
+endobj
+1864 0 obj
+(\376\377\0006\000.\0002\0003\000.\0002\000.\0002\000\040\000S\000A\000L\000\137\000c\000i\000p\000h\000e\000r\000s\000\050\000\051)
+endobj
+1865 0 obj
+<< /S /GoTo /D (subsubsection.6.23.2.3) >>
+endobj
+1868 0 obj
+(\376\377\0006\000.\0002\0003\000.\0002\000.\0003\000\040\000S\000A\000L\000\137\000g\000r\000o\000u\000p\000s\000\050\000\051)
+endobj
+1869 0 obj
+<< /S /GoTo /D (subsubsection.6.23.2.4) >>
+endobj
+1872 0 obj
+(\376\377\0006\000.\0002\0003\000.\0002\000.\0004\000\040\000S\000A\000L\000\137\000s\000i\000g\000s\000\050\000\051)
+endobj
+1873 0 obj
+<< /S /GoTo /D (subsubsection.6.23.2.5) >>
+endobj
+1876 0 obj
+(\376\377\0006\000.\0002\0003\000.\0002\000.\0005\000\040\000S\000A\000L\000\137\000s\000i\000g\000C\000e\000r\000t\000s\000\050\000\051)
+endobj
+1877 0 obj
+<< /S /GoTo /D (subsubsection.6.23.2.6) >>
+endobj
+1880 0 obj
+(\376\377\0006\000.\0002\0003\000.\0002\000.\0006\000\040\000S\000A\000L\000\137\000i\000n\000i\000t\000L\000i\000b\000\050\000\051)
+endobj
+1881 0 obj
+<< /S /GoTo /D (subsubsection.6.23.2.7) >>
+endobj
+1884 0 obj
+(\376\377\0006\000.\0002\0003\000.\0002\000.\0007\000\040\000S\000A\000L\000\137\000e\000n\000d\000L\000i\000b\000\050\000\051)
+endobj
+1885 0 obj
+<< /S /GoTo /D (subsubsection.6.23.2.8) >>
+endobj
+1888 0 obj
+(\376\377\0006\000.\0002\0003\000.\0002\000.\0008\000\040\000S\000A\000L\000\137\000h\000a\000s\000h\000T\000y\000p\000e\000\050\000\051)
+endobj
+1889 0 obj
+<< /S /GoTo /D (subsubsection.6.23.2.9) >>
+endobj
+1892 0 obj
+(\376\377\0006\000.\0002\0003\000.\0002\000.\0009\000\040\000S\000A\000L\000\137\000h\000a\000s\000h\000L\000e\000n\000\050\000\051)
+endobj
+1893 0 obj
+<< /S /GoTo /D (subsubsection.6.23.2.10) >>
+endobj
+1896 0 obj
+(\376\377\0006\000.\0002\0003\000.\0002\000.\0001\0000\000\040\000S\000A\000L\000\137\000a\000e\000a\000d\000K\000e\000y\000l\000e\000n\000\050\000\051)
+endobj
+1897 0 obj
+<< /S /GoTo /D (subsubsection.6.23.2.11) >>
+endobj
+1900 0 obj
+(\376\377\0006\000.\0002\0003\000.\0002\000.\0001\0001\000\040\000S\000A\000L\000\137\000a\000e\000a\000d\000T\000a\000g\000l\000e\000n\000\050\000\051)
+endobj
+1901 0 obj
+<< /S /GoTo /D (subsubsection.6.23.2.12) >>
+endobj
+1904 0 obj
+(\376\377\0006\000.\0002\0003\000.\0002\000.\0001\0002\000\040\000S\000A\000L\000\137\000r\000a\000n\000d\000o\000m\000B\000y\000t\000e\000\050\000\051)
+endobj
+1905 0 obj
+<< /S /GoTo /D (subsubsection.6.23.2.13) >>
+endobj
+1908 0 obj
+(\376\377\0006\000.\0002\0003\000.\0002\000.\0001\0003\000\040\000S\000A\000L\000\137\000r\000a\000n\000d\000o\000m\000O\000c\000t\000a\000d\000\050\000\051)
+endobj
+1909 0 obj
+<< /S /GoTo /D (subsubsection.6.23.2.14) >>
+endobj
+1912 0 obj
+(\376\377\0006\000.\0002\0003\000.\0002\000.\0001\0004\000\040\000S\000A\000L\000\137\000h\000k\000d\000f\000E\000x\000t\000r\000a\000c\000t\000\050\000\051)
+endobj
+1913 0 obj
+<< /S /GoTo /D (subsubsection.6.23.2.15) >>
+endobj
+1916 0 obj
+(\376\377\0006\000.\0002\0003\000.\0002\000.\0001\0005\000\040\000S\000A\000L\000\137\000h\000k\000d\000f\000E\000x\000p\000a\000n\000d\000\050\000\051)
+endobj
+1917 0 obj
+<< /S /GoTo /D (subsubsection.6.23.2.16) >>
+endobj
+1920 0 obj
+(\376\377\0006\000.\0002\0003\000.\0002\000.\0001\0006\000\040\000S\000A\000L\000\137\000h\000m\000a\000c\000\050\000\051)
+endobj
+1921 0 obj
+<< /S /GoTo /D (subsubsection.6.23.2.17) >>
+endobj
+1924 0 obj
+(\376\377\0006\000.\0002\0003\000.\0002\000.\0001\0007\000\040\000S\000A\000L\000\137\000h\000a\000s\000h\000N\000u\000l\000l\000\050\000\051)
+endobj
+1925 0 obj
+<< /S /GoTo /D (subsubsection.6.23.2.18) >>
+endobj
+1928 0 obj
+(\376\377\0006\000.\0002\0003\000.\0002\000.\0001\0008\000\040\000S\000A\000L\000\137\000h\000a\000s\000h\000I\000n\000i\000t\000\050\000\051)
+endobj
+1929 0 obj
+<< /S /GoTo /D (subsubsection.6.23.2.19) >>
+endobj
+1932 0 obj
+(\376\377\0006\000.\0002\0003\000.\0002\000.\0001\0009\000\040\000S\000A\000L\000\137\000h\000a\000s\000h\000P\000r\000o\000c\000e\000s\000s\000A\000r\000r\000a\000y\000\050\000\051)
+endobj
+1933 0 obj
+<< /S /GoTo /D (subsubsection.6.23.2.20) >>
+endobj
+1936 0 obj
+(\376\377\0006\000.\0002\0003\000.\0002\000.\0002\0000\000\040\000S\000A\000L\000\137\000h\000a\000s\000h\000O\000u\000t\000p\000u\000t\000\050\000\051)
+endobj
+1937 0 obj
+<< /S /GoTo /D (subsubsection.6.23.2.21) >>
+endobj
+1940 0 obj
+(\376\377\0006\000.\0002\0003\000.\0002\000.\0002\0001\000\040\000S\000A\000L\000\137\000a\000e\000a\000d\000E\000n\000c\000r\000y\000p\000t\000\050\000\051)
+endobj
+1941 0 obj
+<< /S /GoTo /D (subsubsection.6.23.2.22) >>
+endobj
+1944 0 obj
+(\376\377\0006\000.\0002\0003\000.\0002\000.\0002\0002\000\040\000S\000A\000L\000\137\000a\000e\000a\000d\000D\000e\000c\000r\000y\000p\000t\000\050\000\051)
+endobj
+1945 0 obj
+<< /S /GoTo /D (subsubsection.6.23.2.23) >>
+endobj
+1948 0 obj
+(\376\377\0006\000.\0002\0003\000.\0002\000.\0002\0003\000\040\000S\000A\000L\000\137\000g\000e\000n\000e\000r\000a\000t\000e\000K\000e\000y\000P\000a\000i\000r\000\050\000\051)
+endobj
+1949 0 obj
+<< /S /GoTo /D (subsubsection.6.23.2.24) >>
+endobj
+1952 0 obj
+(\376\377\0006\000.\0002\0003\000.\0002\000.\0002\0004\000\040\000S\000A\000L\000\137\000g\000e\000n\000e\000r\000a\000t\000e\000S\000h\000a\000r\000e\000d\000S\000e\000c\000r\000e\000t\000\050\000\051)
+endobj
+1953 0 obj
+<< /S /GoTo /D (subsubsection.6.23.2.25) >>
+endobj
+1956 0 obj
+(\376\377\0006\000.\0002\0003\000.\0002\000.\0002\0005\000\040\000S\000A\000L\000\137\000t\000l\000s\000S\000i\000g\000n\000a\000t\000u\000r\000e\000V\000e\000r\000i\000f\000y\000\050\000\051)
+endobj
+1957 0 obj
+<< /S /GoTo /D (subsubsection.6.23.2.26) >>
+endobj
+1960 0 obj
+(\376\377\0006\000.\0002\0003\000.\0002\000.\0002\0006\000\040\000S\000A\000L\000\137\000t\000l\000s\000S\000i\000g\000n\000a\000t\000u\000r\000e\000\050\000\051)
+endobj
+1961 0 obj
+<< /S /GoTo /D (section.6.24) >>
+endobj
+1964 0 obj
+(\376\377\0006\000.\0002\0004\000\040\000t\000l\000s\000\137\000s\000a\000l\000.\000h)
+endobj
+1965 0 obj
+<< /S /GoTo /D (section.6.25) >>
+endobj
+1968 0 obj
+(\376\377\0006\000.\0002\0005\000\040\000t\000l\000s\000\137\000s\000o\000c\000k\000e\000t\000s\000.\000h\000\040\000F\000i\000l\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+1969 0 obj
+<< /S /GoTo /D (subsection.6.25.1) >>
+endobj
+1972 0 obj
+(\376\377\0006\000.\0002\0005\000.\0001\000\040\000D\000e\000t\000a\000i\000l\000e\000d\000\040\000D\000e\000s\000c\000r\000i\000p\000t\000i\000o\000n)
+endobj
+1973 0 obj
+<< /S /GoTo /D (subsection.6.25.2) >>
+endobj
+1976 0 obj
+(\376\377\0006\000.\0002\0005\000.\0002\000\040\000F\000u\000n\000c\000t\000i\000o\000n\000\040\000D\000o\000c\000u\000m\000e\000n\000t\000a\000t\000i\000o\000n)
+endobj
+1977 0 obj
+<< /S /GoTo /D (subsubsection.6.25.2.1) >>
+endobj
+1980 0 obj
+(\376\377\0006\000.\0002\0005\000.\0002\000.\0001\000\040\000s\000e\000t\000c\000l\000i\000e\000n\000t\000s\000o\000c\000k\000\050\000\051)
+endobj
+1981 0 obj
+<< /S /GoTo /D (subsubsection.6.25.2.2) >>
+endobj
+1984 0 obj
+(\376\377\0006\000.\0002\0005\000.\0002\000.\0002\000\040\000g\000e\000t\000I\000P\000a\000d\000d\000r\000e\000s\000s\000\050\000\051)
+endobj
+1985 0 obj
+<< /S /GoTo /D (subsubsection.6.25.2.3) >>
+endobj
+1988 0 obj
+(\376\377\0006\000.\0002\0005\000.\0002\000.\0003\000\040\000s\000e\000n\000d\000O\000c\000t\000a\000d\000\050\000\051)
+endobj
+1989 0 obj
+<< /S /GoTo /D (subsubsection.6.25.2.4) >>
+endobj
+1992 0 obj
+(\376\377\0006\000.\0002\0005\000.\0002\000.\0004\000\040\000s\000e\000n\000d\000L\000e\000n\000\050\000\051)
+endobj
+1993 0 obj
+<< /S /GoTo /D (subsubsection.6.25.2.5) >>
+endobj
+1996 0 obj
+(\376\377\0006\000.\0002\0005\000.\0002\000.\0005\000\040\000g\000e\000t\000B\000y\000t\000e\000s\000\050\000\051)
+endobj
+1997 0 obj
+<< /S /GoTo /D (subsubsection.6.25.2.6) >>
+endobj
+2000 0 obj
+(\376\377\0006\000.\0002\0005\000.\0002\000.\0006\000\040\000g\000e\000t\000I\000n\000t\0001\0006\000\050\000\051)
+endobj
+2001 0 obj
+<< /S /GoTo /D (subsubsection.6.25.2.7) >>
+endobj
+2004 0 obj
+(\376\377\0006\000.\0002\0005\000.\0002\000.\0007\000\040\000g\000e\000t\000I\000n\000t\0002\0004\000\050\000\051)
+endobj
+2005 0 obj
+<< /S /GoTo /D (subsubsection.6.25.2.8) >>
+endobj
+2008 0 obj
+(\376\377\0006\000.\0002\0005\000.\0002\000.\0008\000\040\000g\000e\000t\000B\000y\000t\000e\000\050\000\051)
+endobj
+2009 0 obj
+<< /S /GoTo /D (subsubsection.6.25.2.9) >>
+endobj
+2012 0 obj
+(\376\377\0006\000.\0002\0005\000.\0002\000.\0009\000\040\000g\000e\000t\000O\000c\000t\000a\000d\000\050\000\051)
+endobj
+2013 0 obj
+<< /S /GoTo /D (section.6.26) >>
+endobj
+2016 0 obj
+(\376\377\0006\000.\0002\0006\000\040\000t\000l\000s\000\137\000s\000o\000c\000k\000e\000t\000s\000.\000h)
+endobj
+2017 0 obj
+<< /S /GoTo /D (section.6.27) >>
+endobj
+2020 0 obj
+(\376\377\0006\000.\0002\0007\000\040\000t\000l\000s\000\137\000t\000i\000c\000k\000e\000t\000s\000.\000h\000\040\000F\000i\000l\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+2021 0 obj
+<< /S /GoTo /D (subsection.6.27.1) >>
+endobj
+2024 0 obj
+(\376\377\0006\000.\0002\0007\000.\0001\000\040\000D\000e\000t\000a\000i\000l\000e\000d\000\040\000D\000e\000s\000c\000r\000i\000p\000t\000i\000o\000n)
+endobj
+2025 0 obj
+<< /S /GoTo /D (subsection.6.27.2) >>
+endobj
+2028 0 obj
+(\376\377\0006\000.\0002\0007\000.\0002\000\040\000F\000u\000n\000c\000t\000i\000o\000n\000\040\000D\000o\000c\000u\000m\000e\000n\000t\000a\000t\000i\000o\000n)
+endobj
+2029 0 obj
+<< /S /GoTo /D (subsubsection.6.27.2.1) >>
+endobj
+2032 0 obj
+(\376\377\0006\000.\0002\0007\000.\0002\000.\0001\000\040\000p\000a\000r\000s\000e\000T\000i\000c\000k\000e\000t\000\050\000\051)
+endobj
+2033 0 obj
+<< /S /GoTo /D (subsubsection.6.27.2.2) >>
+endobj
+2036 0 obj
+(\376\377\0006\000.\0002\0007\000.\0002\000.\0002\000\040\000i\000n\000i\000t\000T\000i\000c\000k\000e\000t\000C\000o\000n\000t\000e\000x\000t\000\050\000\051)
+endobj
+2037 0 obj
+<< /S /GoTo /D (subsubsection.6.27.2.3) >>
+endobj
+2040 0 obj
+(\376\377\0006\000.\0002\0007\000.\0002\000.\0003\000\040\000e\000n\000d\000T\000i\000c\000k\000e\000t\000C\000o\000n\000t\000e\000x\000t\000\050\000\051)
+endobj
+2041 0 obj
+<< /S /GoTo /D (subsubsection.6.27.2.4) >>
+endobj
+2044 0 obj
+(\376\377\0006\000.\0002\0007\000.\0002\000.\0004\000\040\000t\000i\000c\000k\000e\000t\000\137\000s\000t\000i\000l\000l\000\137\000g\000o\000o\000d\000\050\000\051)
+endobj
+2045 0 obj
+<< /S /GoTo /D (section.6.28) >>
+endobj
+2048 0 obj
+(\376\377\0006\000.\0002\0008\000\040\000t\000l\000s\000\137\000t\000i\000c\000k\000e\000t\000s\000.\000h)
+endobj
+2049 0 obj
+<< /S /GoTo /D (section.6.29) >>
+endobj
+2052 0 obj
+(\376\377\0006\000.\0002\0009\000\040\000t\000l\000s\000\137\000w\000i\000f\000i\000.\000h\000\040\000F\000i\000l\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+2053 0 obj
+<< /S /GoTo /D (subsection.6.29.1) >>
+endobj
+2056 0 obj
+(\376\377\0006\000.\0002\0009\000.\0001\000\040\000D\000e\000t\000a\000i\000l\000e\000d\000\040\000D\000e\000s\000c\000r\000i\000p\000t\000i\000o\000n)
+endobj
+2057 0 obj
+<< /S /GoTo /D (section.6.30) >>
+endobj
+2060 0 obj
+(\376\377\0006\000.\0003\0000\000\040\000t\000l\000s\000\137\000w\000i\000f\000i\000.\000h)
+endobj
+2061 0 obj
+<< /S /GoTo /D (section.6.31) >>
+endobj
+2064 0 obj
+(\376\377\0006\000.\0003\0001\000\040\000t\000l\000s\000\137\000x\0005\0000\0009\000.\000h\000\040\000F\000i\000l\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+2065 0 obj
+<< /S /GoTo /D (subsection.6.31.1) >>
+endobj
+2068 0 obj
+(\376\377\0006\000.\0003\0001\000.\0001\000\040\000D\000e\000t\000a\000i\000l\000e\000d\000\040\000D\000e\000s\000c\000r\000i\000p\000t\000i\000o\000n)
+endobj
+2069 0 obj
+<< /S /GoTo /D (subsection.6.31.2) >>
+endobj
+2072 0 obj
+(\376\377\0006\000.\0003\0001\000.\0002\000\040\000M\000a\000c\000r\000o\000\040\000D\000e\000f\000i\000n\000i\000t\000i\000o\000n\000\040\000D\000o\000c\000u\000m\000e\000n\000t\000a\000t\000i\000o\000n)
+endobj
+2073 0 obj
+<< /S /GoTo /D (subsubsection.6.31.2.1) >>
+endobj
+2076 0 obj
+(\376\377\0006\000.\0003\0001\000.\0002\000.\0001\000\040\000X\0005\0000\0009\000\137\000E\000C\000C)
+endobj
+2077 0 obj
+<< /S /GoTo /D (subsubsection.6.31.2.2) >>
+endobj
+2080 0 obj
+(\376\377\0006\000.\0003\0001\000.\0002\000.\0002\000\040\000X\0005\0000\0009\000\137\000R\000S\000A)
+endobj
+2081 0 obj
+<< /S /GoTo /D (subsubsection.6.31.2.3) >>
+endobj
+2084 0 obj
+(\376\377\0006\000.\0003\0001\000.\0002\000.\0003\000\040\000X\0005\0000\0009\000\137\000E\000C\000D)
+endobj
+2085 0 obj
+<< /S /GoTo /D (subsubsection.6.31.2.4) >>
+endobj
+2088 0 obj
+(\376\377\0006\000.\0003\0001\000.\0002\000.\0004\000\040\000X\0005\0000\0009\000\137\000P\000Q)
+endobj
+2089 0 obj
+<< /S /GoTo /D (subsubsection.6.31.2.5) >>
+endobj
+2092 0 obj
+(\376\377\0006\000.\0003\0001\000.\0002\000.\0005\000\040\000X\0005\0000\0009\000\137\000H\000Y)
+endobj
+2093 0 obj
+<< /S /GoTo /D (subsubsection.6.31.2.6) >>
+endobj
+2096 0 obj
+(\376\377\0006\000.\0003\0001\000.\0002\000.\0006\000\040\000X\0005\0000\0009\000\137\000H\0002\0005\0006)
+endobj
+2097 0 obj
+<< /S /GoTo /D (subsubsection.6.31.2.7) >>
+endobj
+2100 0 obj
+(\376\377\0006\000.\0003\0001\000.\0002\000.\0007\000\040\000X\0005\0000\0009\000\137\000H\0003\0008\0004)
+endobj
+2101 0 obj
+<< /S /GoTo /D (subsubsection.6.31.2.8) >>
+endobj
+2104 0 obj
+(\376\377\0006\000.\0003\0001\000.\0002\000.\0008\000\040\000X\0005\0000\0009\000\137\000H\0005\0001\0002)
+endobj
+2105 0 obj
+<< /S /GoTo /D (subsubsection.6.31.2.9) >>
+endobj
+2108 0 obj
+(\376\377\0006\000.\0003\0001\000.\0002\000.\0009\000\040\000U\000S\000E\000\137\000N\000I\000S\000T\0002\0005\0006)
+endobj
+2109 0 obj
+<< /S /GoTo /D (subsubsection.6.31.2.10) >>
+endobj
+2112 0 obj
+(\376\377\0006\000.\0003\0001\000.\0002\000.\0001\0000\000\040\000U\000S\000E\000\137\000C\0002\0005\0005\0001\0009)
+endobj
+2113 0 obj
+<< /S /GoTo /D (subsubsection.6.31.2.11) >>
+endobj
+2116 0 obj
+(\376\377\0006\000.\0003\0001\000.\0002\000.\0001\0001\000\040\000U\000S\000E\000\137\000N\000I\000S\000T\0003\0008\0004)
+endobj
+2117 0 obj
+<< /S /GoTo /D (subsubsection.6.31.2.12) >>
+endobj
+2120 0 obj
+(\376\377\0006\000.\0003\0001\000.\0002\000.\0001\0002\000\040\000U\000S\000E\000\137\000N\000I\000S\000T\0005\0002\0001)
+endobj
+2121 0 obj
+<< /S /GoTo /D (subsection.6.31.3) >>
+endobj
+2124 0 obj
+(\376\377\0006\000.\0003\0001\000.\0003\000\040\000F\000u\000n\000c\000t\000i\000o\000n\000\040\000D\000o\000c\000u\000m\000e\000n\000t\000a\000t\000i\000o\000n)
+endobj
+2125 0 obj
+<< /S /GoTo /D (subsubsection.6.31.3.1) >>
+endobj
+2128 0 obj
+(\376\377\0006\000.\0003\0001\000.\0003\000.\0001\000\040\000e\000c\000d\000s\000a\000\137\000s\000i\000g\000\137\000e\000n\000c\000o\000d\000e\000\050\000\051)
+endobj
+2129 0 obj
+<< /S /GoTo /D (subsubsection.6.31.3.2) >>
+endobj
+2132 0 obj
+(\376\377\0006\000.\0003\0001\000.\0003\000.\0002\000\040\000e\000c\000d\000s\000a\000\137\000s\000i\000g\000\137\000d\000e\000c\000o\000d\000e\000\050\000\051)
+endobj
+2133 0 obj
+<< /S /GoTo /D (subsubsection.6.31.3.3) >>
+endobj
+2136 0 obj
+(\376\377\0006\000.\0003\0001\000.\0003\000.\0003\000\040\000X\0005\0000\0009\000\137\000e\000x\000t\000r\000a\000c\000t\000\137\000p\000r\000i\000v\000a\000t\000e\000\137\000k\000e\000y\000\050\000\051)
+endobj
+2137 0 obj
+<< /S /GoTo /D (subsubsection.6.31.3.4) >>
+endobj
+2140 0 obj
+(\376\377\0006\000.\0003\0001\000.\0003\000.\0004\000\040\000X\0005\0000\0009\000\137\000e\000x\000t\000r\000a\000c\000t\000\137\000c\000e\000r\000t\000\137\000s\000i\000g\000\050\000\051)
+endobj
+2141 0 obj
+<< /S /GoTo /D (subsubsection.6.31.3.5) >>
+endobj
+2144 0 obj
+(\376\377\0006\000.\0003\0001\000.\0003\000.\0005\000\040\000X\0005\0000\0009\000\137\000e\000x\000t\000r\000a\000c\000t\000\137\000c\000e\000r\000t\000\050\000\051)
+endobj
+2145 0 obj
+<< /S /GoTo /D (subsubsection.6.31.3.6) >>
+endobj
+2148 0 obj
+(\376\377\0006\000.\0003\0001\000.\0003\000.\0006\000\040\000X\0005\0000\0009\000\137\000f\000i\000n\000d\000\137\000p\000u\000b\000l\000i\000c\000\137\000k\000e\000y\000\050\000\051)
+endobj
+2149 0 obj
+<< /S /GoTo /D (subsubsection.6.31.3.7) >>
+endobj
+2152 0 obj
+(\376\377\0006\000.\0003\0001\000.\0003\000.\0007\000\040\000X\0005\0000\0009\000\137\000g\000e\000t\000\137\000p\000u\000b\000l\000i\000c\000\137\000k\000e\000y\000\050\000\051)
+endobj
+2153 0 obj
+<< /S /GoTo /D (subsubsection.6.31.3.8) >>
+endobj
+2156 0 obj
+(\376\377\0006\000.\0003\0001\000.\0003\000.\0008\000\040\000X\0005\0000\0009\000\137\000e\000x\000t\000r\000a\000c\000t\000\137\000p\000u\000b\000l\000i\000c\000\137\000k\000e\000y\000\050\000\051)
+endobj
+2157 0 obj
+<< /S /GoTo /D (subsubsection.6.31.3.9) >>
+endobj
+2160 0 obj
+(\376\377\0006\000.\0003\0001\000.\0003\000.\0009\000\040\000X\0005\0000\0009\000\137\000f\000i\000n\000d\000\137\000i\000s\000s\000u\000e\000r\000\050\000\051)
+endobj
+2161 0 obj
+<< /S /GoTo /D (subsubsection.6.31.3.10) >>
+endobj
+2164 0 obj
+(\376\377\0006\000.\0003\0001\000.\0003\000.\0001\0000\000\040\000X\0005\0000\0009\000\137\000f\000i\000n\000d\000\137\000v\000a\000l\000i\000d\000i\000t\000y\000\050\000\051)
+endobj
+2165 0 obj
+<< /S /GoTo /D (subsubsection.6.31.3.11) >>
+endobj
+2168 0 obj
+(\376\377\0006\000.\0003\0001\000.\0003\000.\0001\0001\000\040\000X\0005\0000\0009\000\137\000f\000i\000n\000d\000\137\000s\000u\000b\000j\000e\000c\000t\000\050\000\051)
+endobj
+2169 0 obj
+<< /S /GoTo /D (subsubsection.6.31.3.12) >>
+endobj
+2172 0 obj
+(\376\377\0006\000.\0003\0001\000.\0003\000.\0001\0002\000\040\000X\0005\0000\0009\000\137\000s\000e\000l\000f\000\137\000s\000i\000g\000n\000e\000d\000\050\000\051)
+endobj
+2173 0 obj
+<< /S /GoTo /D (subsubsection.6.31.3.13) >>
+endobj
+2176 0 obj
+(\376\377\0006\000.\0003\0001\000.\0003\000.\0001\0003\000\040\000X\0005\0000\0009\000\137\000f\000i\000n\000d\000\137\000e\000n\000t\000i\000t\000y\000\137\000p\000r\000o\000p\000e\000r\000t\000y\000\050\000\051)
+endobj
+2177 0 obj
+<< /S /GoTo /D (subsubsection.6.31.3.14) >>
+endobj
+2180 0 obj
+(\376\377\0006\000.\0003\0001\000.\0003\000.\0001\0004\000\040\000X\0005\0000\0009\000\137\000f\000i\000n\000d\000\137\000s\000t\000a\000r\000t\000\137\000d\000a\000t\000e\000\050\000\051)
+endobj
+2181 0 obj
+<< /S /GoTo /D (subsubsection.6.31.3.15) >>
+endobj
+2184 0 obj
+(\376\377\0006\000.\0003\0001\000.\0003\000.\0001\0005\000\040\000X\0005\0000\0009\000\137\000f\000i\000n\000d\000\137\000e\000x\000p\000i\000r\000y\000\137\000d\000a\000t\000e\000\050\000\051)
+endobj
+2185 0 obj
+<< /S /GoTo /D (subsubsection.6.31.3.16) >>
+endobj
+2188 0 obj
+(\376\377\0006\000.\0003\0001\000.\0003\000.\0001\0006\000\040\000X\0005\0000\0009\000\137\000f\000i\000n\000d\000\137\000e\000x\000t\000e\000n\000s\000i\000o\000n\000s\000\050\000\051)
+endobj
+2189 0 obj
+<< /S /GoTo /D (subsubsection.6.31.3.17) >>
+endobj
+2192 0 obj
+(\376\377\0006\000.\0003\0001\000.\0003\000.\0001\0007\000\040\000X\0005\0000\0009\000\137\000f\000i\000n\000d\000\137\000e\000x\000t\000e\000n\000s\000i\000o\000n\000\050\000\051)
+endobj
+2193 0 obj
+<< /S /GoTo /D (subsubsection.6.31.3.18) >>
+endobj
+2196 0 obj
+(\376\377\0006\000.\0003\0001\000.\0003\000.\0001\0008\000\040\000X\0005\0000\0009\000\137\000f\000i\000n\000d\000\137\000a\000l\000t\000\137\000n\000a\000m\000e\000\050\000\051)
+endobj
+2197 0 obj
+<< /S /GoTo /D (subsection.6.31.4) >>
+endobj
+2200 0 obj
+(\376\377\0006\000.\0003\0001\000.\0004\000\040\000V\000a\000r\000i\000a\000b\000l\000e\000\040\000D\000o\000c\000u\000m\000e\000n\000t\000a\000t\000i\000o\000n)
+endobj
+2201 0 obj
+<< /S /GoTo /D (subsubsection.6.31.4.1) >>
+endobj
+2204 0 obj
+(\376\377\0006\000.\0003\0001\000.\0004\000.\0001\000\040\000X\0005\0000\0009\000\137\000C\000N)
+endobj
+2205 0 obj
+<< /S /GoTo /D (subsubsection.6.31.4.2) >>
+endobj
+2208 0 obj
+(\376\377\0006\000.\0003\0001\000.\0004\000.\0002\000\040\000X\0005\0000\0009\000\137\000O\000N)
+endobj
+2209 0 obj
+<< /S /GoTo /D (subsubsection.6.31.4.3) >>
+endobj
+2212 0 obj
+(\376\377\0006\000.\0003\0001\000.\0004\000.\0003\000\040\000X\0005\0000\0009\000\137\000E\000N)
+endobj
+2213 0 obj
+<< /S /GoTo /D (subsubsection.6.31.4.4) >>
+endobj
+2216 0 obj
+(\376\377\0006\000.\0003\0001\000.\0004\000.\0004\000\040\000X\0005\0000\0009\000\137\000L\000N)
+endobj
+2217 0 obj
+<< /S /GoTo /D (subsubsection.6.31.4.5) >>
+endobj
+2220 0 obj
+(\376\377\0006\000.\0003\0001\000.\0004\000.\0005\000\040\000X\0005\0000\0009\000\137\000U\000N)
+endobj
+2221 0 obj
+<< /S /GoTo /D (subsubsection.6.31.4.6) >>
+endobj
+2224 0 obj
+(\376\377\0006\000.\0003\0001\000.\0004\000.\0006\000\040\000X\0005\0000\0009\000\137\000M\000N)
+endobj
+2225 0 obj
+<< /S /GoTo /D (subsubsection.6.31.4.7) >>
+endobj
+2228 0 obj
+(\376\377\0006\000.\0003\0001\000.\0004\000.\0007\000\040\000X\0005\0000\0009\000\137\000S\000N)
+endobj
+2229 0 obj
+<< /S /GoTo /D (subsubsection.6.31.4.8) >>
+endobj
+2232 0 obj
+(\376\377\0006\000.\0003\0001\000.\0004\000.\0008\000\040\000X\0005\0000\0009\000\137\000A\000N)
+endobj
+2233 0 obj
+<< /S /GoTo /D (subsubsection.6.31.4.9) >>
+endobj
+2236 0 obj
+(\376\377\0006\000.\0003\0001\000.\0004\000.\0009\000\040\000X\0005\0000\0009\000\137\000K\000U)
+endobj
+2237 0 obj
+<< /S /GoTo /D (subsubsection.6.31.4.10) >>
+endobj
+2240 0 obj
+(\376\377\0006\000.\0003\0001\000.\0004\000.\0001\0000\000\040\000X\0005\0000\0009\000\137\000B\000C)
+endobj
+2241 0 obj
+<< /S /GoTo /D (section.6.32) >>
+endobj
+2244 0 obj
+(\376\377\0006\000.\0003\0002\000\040\000t\000l\000s\000\137\000x\0005\0000\0009\000.\000h)
+endobj
+2245 0 obj
+<< /S /GoTo /D (section.6.33) >>
+endobj
+2248 0 obj
+(\376\377\0006\000.\0003\0003\000\040\000E\000C\000C\000X\0000\0008\000.\000h)
+endobj
+2249 0 obj
+<< /S /GoTo /D (section*.36) >>
+endobj
+2252 0 obj
+(\376\377\000I\000n\000d\000e\000x)
+endobj
+2253 0 obj
+<< /S /GoTo /D [2254 0 R /Fit] >>
+endobj
+2256 0 obj
+<<
+/Length 159       
+/Filter /FlateDecode
+>>
+stream
+xÚ…�½Â0„÷>…Çdˆ±�¿fE@UÄF6ÄjÚ­Hˆ�¾=T˜ÎòÝwÒL@Ð5ôG·¹ÙœLÌò"ºÀKÄÖ[È\Tî{m$¶*ŸÎŒV_ó±r„ÑÃ+'‚Ã-+ÆÈkL L1�q‚’\5»2—§fR·Wjû]©¥Þ»‡¶¤ÞËTæú`LÖºŸûÜ|4º
+endstream
+endobj
+2254 0 obj
+<<
+/Type /Page
+/Contents 2256 0 R
+/Resources 2255 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2259 0 R
+>>
+endobj
+2257 0 obj
+<<
+/D [2254 0 R /XYZ 70.866 771.024 null]
+>>
+endobj
+2255 0 obj
+<<
+/Font << /F43 2258 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+2262 0 obj
+<<
+/Length 19        
+/Filter /FlateDecode
+>>
+stream
+xÚ3PHW0Ppç2ÀAc(á
+endstream
+endobj
+2261 0 obj
+<<
+/Type /Page
+/Contents 2262 0 R
+/Resources 2260 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2259 0 R
+>>
+endobj
+2260 0 obj
+<<
+/ProcSet [ /PDF ]
+>>
+endobj
+2306 0 obj
+<<
+/Length 1183      
+/Filter /FlateDecode
+>>
+stream
+xÚí[]oâ8}çWøTáñgb?ÎÐu¶»šmÑj¥Î¨J“”F
�MÂNù÷k°
N!PÐJ»~!N Øœsîõñ5A`¸ê|v>]r”žGÁð	p‚¡Ä>ð%�ÃÜw“Þ�á×ÎÅ°óW«ÛÀÀGPxð…€‚0Ž;÷?ˆÔ{_
‚T
+ðsùÉ1`œBΨj§à®ó{™®õ÷ä#ó…·Mƒ©zñ0DÕ`p¯O|Ñ^__]ÜšöÍ�nÎΖC­úŒ	ȹP'æ^ýîfÏŸ.Õ×Ýö¥êÇÐÇô77CÓõ—Y’FI6ªwußBta¯Ï¹§¼vÖxñ8gÿí¯ÆÒCï2�IÃ[1Uqõk’÷0êaºÉ–DØsBb�=�Xœ,ÏÏôá&y¼›DÉllÅ•Oðí�ï7‡„
ØÃuó^Ÿ¢î\_JJ}œÌÊMè}.¥�ˆ@Ò*¥­Â‡T)m�&qf(+’(Ö­Ï=Eè¬|Vo%aP&“Ìâ’Êÿ7àlWªZÇJ=Zâ¢\L÷Ë+ßò¸_<yéó—Þâ‹—y±‰8Ä)]
Ïßµ]5·×§>L	Ÿ(2�¾!b0ɾ#DF³Üè])Ý?_€Í’l¢/üT­Ûo1d±‚%¥]¿�ÄJV—±|`}@á›ø¦Ó´
+G�c3køÛ†¾l?N‚<‚–¡Þ¿Í«ß’Wâ[Z©þiçAèÖ]™ÏÂrEïu¦æÝ×­~^~ÄÏÓŠÇÚ ÔOã]=+žnÆû€^ä
z1AÇ4A—IºK jµéÓÕ‚¯õŠ�èQZW«²îö&),“„BÎ%�@3±mîL2|G’9Ÿ„³±ÊÕ
viSGô ñòJG¡ñÝÓrb%“÷㧅‘‹ó8ãM¡qÉ�^vé…îc«ùºRp—�
+ó¨:+BMM2m2ÓŒ"þà#+"*‹}™Äi´3YÖaÝkŠ¡ð©-ô•q
Â2ù»Gx×Ê0>“n
+;ªÈ+™¿XËêä|þ¬eÉQãoVJð›(æ;ä�Œ|MùƳÿÒà—‰Cþ”š7Æ÷ú+¿æ�?¥æ=�|‡“<²ü{³îÞ‡+Ý7uðYRZf†J·,?�Ê…)b£4¶÷°Sùáx÷9ƒ¾ ›Z7.òb0ø‰AEµ´jn-0,ݪi
<o-tcãø¡P+ÒYqHÅÆó¥+ìABs�†ºÍÁ÷ZO°ÔÕhN…u­FÃÞ^I=´´ÓùC´¨_Û›˜nZý ¶+uéô}ã¼ãÇA¯éÛL«E¬÷Bt2È‚±5{
+ŠÂûËÚÔ]ÆÁëÓþ§ÝèAùôQùl
,¥ƒt«
_I×€:	Ë :Ä	JDÜÞÝÁ¤4ûBæ|áÁ÷[§qæ|á©°nÞ»ck_ØPpYí$¹¢îI´^©]M¨¶M¤óca^“»±‰K{¤v9Ëíšþw�ÙCš¾”ói|ˆãaÎñ´gE£ÖôˆçQ¼ÏvÕst$¾ÇÞ<GÇ8ôÔaIðUœÅyPVžéqùöj*_�ú:©A*r³Í!þvmÍ
+endstream
+endobj
+2305 0 obj
+<<
+/Type /Page
+/Contents 2306 0 R
+/Resources 2304 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2259 0 R
+/Annots [ 2263 0 R 2264 0 R 2265 0 R 2266 0 R 2267 0 R 2268 0 R 2269 0 R 2270 0 R 2271 0 R 2272 0 R 2273 0 R 2274 0 R 2275 0 R 2276 0 R 2277 0 R 2278 0 R 2279 0 R 2280 0 R 2281 0 R 2282 0 R 2283 0 R 2284 0 R 2285 0 R 2286 0 R 2287 0 R 2288 0 R 2289 0 R 2290 0 R 2291 0 R 2292 0 R 2293 0 R 2294 0 R 2295 0 R 2296 0 R 2297 0 R 2298 0 R 2299 0 R 2300 0 R 2301 0 R 2302 0 R ]
+>>
+endobj
+2263 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [69.87 759.953 148.102 768.598]
+/A << /S /GoTo /D (chapter.1) >>
+>>
+endobj
+2264 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [84.81 741.425 133.651 751.801]
+/A << /S /GoTo /D (section.1.1) >>
+>>
+endobj
+2265 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [107.719 726.673 155.959 735.157]
+/A << /S /GoTo /D (subsection.1.1.1) >>
+>>
+endobj
+2266 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [107.719 709.947 208.537 718.718]
+/A << /S /GoTo /D (subsection.1.1.2) >>
+>>
+endobj
+2267 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [84.81 691.599 135.83 701.868]
+/A << /S /GoTo /D (section.1.2) >>
+>>
+endobj
+2268 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [107.719 676.658 233.041 685.429]
+/A << /S /GoTo /D (subsection.1.2.1) >>
+>>
+endobj
+2269 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [107.719 658.203 227.877 668.579]
+/A << /S /GoTo /D (subsection.1.2.2) >>
+>>
+endobj
+2270 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [69.87 631.598 234.097 642.126]
+/A << /S /GoTo /D (chapter.2) >>
+>>
+endobj
+2271 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [84.81 614.953 364.907 625.329]
+/A << /S /GoTo /D (section.2.1) >>
+>>
+endobj
+2272 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [69.87 590.232 166.895 598.877]
+/A << /S /GoTo /D (chapter.3) >>
+>>
+endobj
+2273 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [84.81 573.515 164.181 582.286]
+/A << /S /GoTo /D (section.3.1) >>
+>>
+endobj
+2274 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [69.87 546.982 120.567 555.628]
+/A << /S /GoTo /D (chapter.4) >>
+>>
+endobj
+2275 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [84.81 530.347 132.647 538.831]
+/A << /S /GoTo /D (section.4.1) >>
+>>
+endobj
+2276 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [69.87 503.733 208.866 512.379]
+/A << /S /GoTo /D (chapter.5) >>
+>>
+endobj
+2277 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [84.81 485.313 196.074 495.788]
+/A << /S /GoTo /D (section.5.1) >>
+>>
+endobj
+2278 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [107.719 468.669 212.5 478.937]
+/A << /S /GoTo /D (subsection.5.1.1) >>
+>>
+endobj
+2279 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [107.719 453.728 214.365 462.292]
+/A << /S /GoTo /D (subsection.5.1.2) >>
+>>
+endobj
+2280 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 437.083 194.69 445.648]
+/A << /S /GoTo /D (subsubsection.5.1.2.1) >>
+>>
+endobj
+2281 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 420.439 175.978 429.003]
+/A << /S /GoTo /D (subsubsection.5.1.2.2) >>
+>>
+endobj
+2282 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 403.794 177.969 412.359]
+/A << /S /GoTo /D (subsubsection.5.1.2.3) >>
+>>
+endobj
+2283 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 387.15 177.475 395.714]
+/A << /S /GoTo /D (subsubsection.5.1.2.4) >>
+>>
+endobj
+2284 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 370.505 179.968 379.07]
+/A << /S /GoTo /D (subsubsection.5.1.2.5) >>
+>>
+endobj
+2285 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 353.861 196.905 362.425]
+/A << /S /GoTo /D (subsubsection.5.1.2.6) >>
+>>
+endobj
+2286 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 337.216 190.431 345.781]
+/A << /S /GoTo /D (subsubsection.5.1.2.7) >>
+>>
+endobj
+2287 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 318.76 195.919 329.136]
+/A << /S /GoTo /D (subsubsection.5.1.2.8) >>
+>>
+endobj
+2288 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [84.81 303.927 227.545 312.698]
+/A << /S /GoTo /D (section.5.2) >>
+>>
+endobj
+2289 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [84.81 286.39 210.267 296.054]
+/A << /S /GoTo /D (section.5.3) >>
+>>
+endobj
+2290 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [107.719 268.934 212.5 279.203]
+/A << /S /GoTo /D (subsection.5.3.1) >>
+>>
+endobj
+2291 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [107.719 253.993 214.365 262.558]
+/A << /S /GoTo /D (subsection.5.3.2) >>
+>>
+endobj
+2292 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 235.645 213.492 245.914]
+/A << /S /GoTo /D (subsubsection.5.3.2.1) >>
+>>
+endobj
+2293 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 219.001 188.441 229.269]
+/A << /S /GoTo /D (subsubsection.5.3.2.2) >>
+>>
+endobj
+2294 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 203.168 223.858 212.625]
+/A << /S /GoTo /D (subsubsection.5.3.2.3) >>
+>>
+endobj
+2295 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 185.604 238.185 196.186]
+/A << /S /GoTo /D (subsubsection.5.3.2.4) >>
+>>
+endobj
+2296 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [84.81 170.771 193.321 179.542]
+/A << /S /GoTo /D (section.5.4) >>
+>>
+endobj
+2297 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [107.719 152.423 212.5 162.691]
+/A << /S /GoTo /D (subsection.5.4.1) >>
+>>
+endobj
+2298 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [107.719 137.482 214.365 146.047]
+/A << /S /GoTo /D (subsection.5.4.2) >>
+>>
+endobj
+2299 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 120.837 183.456 129.402]
+/A << /S /GoTo /D (subsubsection.5.4.2.1) >>
+>>
+endobj
+2300 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 104.193 188.432 112.758]
+/A << /S /GoTo /D (subsubsection.5.4.2.2) >>
+>>
+endobj
+2301 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 87.548 182.73 96.113]
+/A << /S /GoTo /D (subsubsection.5.4.2.3) >>
+>>
+endobj
+2302 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [84.81 69.2 197.804 79.675]
+/A << /S /GoTo /D (section.5.5) >>
+>>
+endobj
+2308 0 obj
+<<
+/D [2305 0 R /XYZ 70.866 771.024 null]
+>>
+endobj
+2304 0 obj
+<<
+/Font << /F50 2307 0 R /F43 2258 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+2353 0 obj
+<<
+/Length 1022      
+/Filter /FlateDecode
+>>
+stream
+xÚí›ËrÚ0†÷<…–f�*ɺyÛô2m:é%ì2�câ)`j›¶yû,“€œÄ&¦3Î&†Äͧ_:ç?'"hŠz?x=¼z'Ò8�ÒGã¤ÖR"0,)OЕ—$Ãïã�ƒ·ãÁÏ
-?FÝÞ¦5ÖŒ£x>¸úNФüÛGD°hô{sçqácÁýòõ]¾ˆýêê9ÙÔ>ð›Lyçý`(ÑXQ�”¤˜ÔÃX`:1¥½7¦ˆ’™™Ôïò8Ž¨ð’e‘¤‹Í¨ë¯CW#îGBˆê"Ÿ'»~à¿z4å„{T[NûÓQ^GTbÉÅ=wV‘~—˜Y
=�Ws³(¢&â”ëv¬}Šµò-pþx-õâniöñJÊN–çQU^ëü6Êo÷¡û>è}AßQº_A�Wå&^nÕ¿†LxŽæµî‡s	Ž•fû’—ùÌÕ‹Ë¢Š£«Øþ⛹–Sb2³ˆ�)”Ÿ,ï¾ãc8 Áþê��ðô?h
+$$<ÇbÝœðÈû„g³ýG3GÓôäÉUïµâM–9è¹ô=¡ß
Ä[ý+ÓxȈ÷cý£ŽÉg³(Ï[Dc.4Ä߃çe'þn×…‚øÛ|F]ÍÙ�¶8qE·DµŒÎÖÆÁÓÓ¼64¬�
ßqÌrÓc±ÞÉM}?7M&Žª…ܨ%~ÚEêµØ·AÀ7ƒZhoäw4oËr‹´!¢n+Ѐ»/¡ó
+÷2w4p	?ŠÄEÅ|üáì¼!jjÀݯÄm¹ùâóÅÙ[§˜\ãÎ/–µ­&|¹tT-ä)ÇanÍj45az}³Êã¨H37lR€ÚaÃ*¨óèOh¢ÊUÎîÂITDNwV‰'Ë:É•’
+íuRbåÄ+œ~·
+ì/†¾#gjmä,©ŠUE2w˸Jï¾DnÍcœ,oM櫤px+æÚ¤lÝáFÈÑÚšoj#éÊÖþ
+N‡”xYºZ:~†ø¹•~­'L-Ôiâ÷|F`—>˜ú#Ý8›vŒ?]†¹ÉóuMõ€®C@Ô[ŸÄßÜX ±Ð#|¿õ¶@cáX¬›Á}c!/	¯rÇ.J(Aõ+ðZâkG™™8Í&�Ö¡o;¼;r¶Yanÿ�eY8%�@‚¿yœ6ï$f›ºíHÐSß‘{'¿£sÛ8¸MóbÍ;ÐÆ­Ô-Ÿ7ïœàÃE¬·ð’
ê.Z¶Ý�Ü<<â’…±±Õװ阗æ@·•�­_�gIiUž�Ê%åvPnÝ(8s³˜4X@È&ž`\�j:A-&>ír€º>³-1S’¯�IsÁ±¼¼bY>r3kïÍÂdQQWM®×ûú]mæ×;ýŸ»i9Jâ™Åþÿ”(#�
+endstream
+endobj
+2352 0 obj
+<<
+/Type /Page
+/Contents 2353 0 R
+/Resources 2351 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2259 0 R
+/Annots [ 2303 0 R 2309 0 R 2310 0 R 2311 0 R 2312 0 R 2313 0 R 2314 0 R 2315 0 R 2316 0 R 2317 0 R 2318 0 R 2319 0 R 2320 0 R 2321 0 R 2322 0 R 2323 0 R 2324 0 R 2325 0 R 2326 0 R 2327 0 R 2328 0 R 2329 0 R 2330 0 R 2331 0 R 2332 0 R 2333 0 R 2334 0 R 2335 0 R 2336 0 R 2337 0 R 2338 0 R 2339 0 R 2340 0 R 2341 0 R 2342 0 R 2343 0 R 2344 0 R 2345 0 R 2346 0 R 2347 0 R 2348 0 R 2349 0 R ]
+>>
+endobj
+2303 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [107.719 758.177 212.5 768.446]
+/A << /S /GoTo /D (subsection.5.5.1) >>
+>>
+endobj
+2309 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [107.719 743.236 214.365 751.801]
+/A << /S /GoTo /D (subsection.5.5.2) >>
+>>
+endobj
+2310 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 724.888 188.441 735.157]
+/A << /S /GoTo /D (subsubsection.5.5.2.1) >>
+>>
+endobj
+2311 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 709.947 190.934 718.512]
+/A << /S /GoTo /D (subsubsection.5.5.2.2) >>
+>>
+endobj
+2312 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 693.303 193.462 701.868]
+/A << /S /GoTo /D (subsubsection.5.5.2.3) >>
+>>
+endobj
+2313 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [84.81 676.658 181.853 685.429]
+/A << /S /GoTo /D (section.5.6) >>
+>>
+endobj
+2314 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [107.719 658.31 212.5 668.579]
+/A << /S /GoTo /D (subsection.5.6.1) >>
+>>
+endobj
+2315 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [107.719 643.369 214.365 651.934]
+/A << /S /GoTo /D (subsection.5.6.2) >>
+>>
+endobj
+2316 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 626.725 182.73 635.29]
+/A << /S /GoTo /D (subsubsection.5.6.2.1) >>
+>>
+endobj
+2317 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 610.08 182.452 618.645]
+/A << /S /GoTo /D (subsubsection.5.6.2.2) >>
+>>
+endobj
+2318 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [84.81 593.436 197.302 602.207]
+/A << /S /GoTo /D (section.5.7) >>
+>>
+endobj
+2319 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [107.719 575.088 212.5 585.356]
+/A << /S /GoTo /D (subsection.5.7.1) >>
+>>
+endobj
+2320 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [84.81 560.147 191.958 568.918]
+/A << /S /GoTo /D (section.5.8) >>
+>>
+endobj
+2321 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [107.719 541.799 212.5 552.067]
+/A << /S /GoTo /D (subsection.5.8.1) >>
+>>
+endobj
+2322 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [107.719 526.858 214.365 535.422]
+/A << /S /GoTo /D (subsection.5.8.2) >>
+>>
+endobj
+2323 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 510.213 189.705 518.778]
+/A << /S /GoTo /D (subsubsection.5.8.2.1) >>
+>>
+endobj
+2324 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 493.569 184.765 502.133]
+/A << /S /GoTo /D (subsubsection.5.8.2.2) >>
+>>
+endobj
+2325 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 476.924 195.919 485.489]
+/A << /S /GoTo /D (subsubsection.5.8.2.3) >>
+>>
+endobj
+2326 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 458.576 185.446 468.844]
+/A << /S /GoTo /D (subsubsection.5.8.2.4) >>
+>>
+endobj
+2327 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 443.635 191.92 452.406]
+/A << /S /GoTo /D (subsubsection.5.8.2.5) >>
+>>
+endobj
+2328 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 426.991 203.872 435.761]
+/A << /S /GoTo /D (subsubsection.5.8.2.6) >>
+>>
+endobj
+2329 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 410.346 189.436 419.117]
+/A << /S /GoTo /D (subsubsection.5.8.2.7) >>
+>>
+endobj
+2330 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 391.89 233.299 402.472]
+/A << /S /GoTo /D (subsubsection.5.8.2.8) >>
+>>
+endobj
+2331 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 375.353 235.415 385.622]
+/A << /S /GoTo /D (subsubsection.5.8.2.9) >>
+>>
+endobj
+2332 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 360.412 194.278 368.977]
+/A << /S /GoTo /D (subsubsection.5.8.2.10) >>
+>>
+endobj
+2333 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 343.768 204.607 352.539]
+/A << /S /GoTo /D (subsubsection.5.8.2.11) >>
+>>
+endobj
+2334 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 325.42 224.817 335.688]
+/A << /S /GoTo /D (subsubsection.5.8.2.12) >>
+>>
+endobj
+2335 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 308.668 238.15 319.25]
+/A << /S /GoTo /D (subsubsection.5.8.2.13) >>
+>>
+endobj
+2336 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 292.023 198.537 302.399]
+/A << /S /GoTo /D (subsubsection.5.8.2.14) >>
+>>
+endobj
+2337 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [84.81 276.298 223.214 285.961]
+/A << /S /GoTo /D (section.5.9) >>
+>>
+endobj
+2338 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [107.719 258.842 212.5 269.11]
+/A << /S /GoTo /D (subsection.5.9.1) >>
+>>
+endobj
+2339 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [107.719 243.901 214.365 252.465]
+/A << /S /GoTo /D (subsection.5.9.2) >>
+>>
+endobj
+2340 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 227.256 195.417 235.821]
+/A << /S /GoTo /D (subsubsection.5.9.2.1) >>
+>>
+endobj
+2341 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 209.72 218.828 219.176]
+/A << /S /GoTo /D (subsubsection.5.9.2.2) >>
+>>
+endobj
+2342 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 192.264 200.214 202.532]
+/A << /S /GoTo /D (subsubsection.5.9.2.3) >>
+>>
+endobj
+2343 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 177.323 178.471 185.887]
+/A << /S /GoTo /D (subsubsection.5.9.2.4) >>
+>>
+endobj
+2344 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 160.678 210.866 169.243]
+/A << /S /GoTo /D (subsubsection.5.9.2.5) >>
+>>
+endobj
+2345 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 142.33 219.832 152.598]
+/A << /S /GoTo /D (subsubsection.5.9.2.6) >>
+>>
+endobj
+2346 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 125.578 233.164 136.16]
+/A << /S /GoTo /D (subsubsection.5.9.2.7) >>
+>>
+endobj
+2347 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 109.041 238.67 119.309]
+/A << /S /GoTo /D (subsubsection.5.9.2.8) >>
+>>
+endobj
+2348 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 92.396 234.644 102.665]
+/A << /S /GoTo /D (subsubsection.5.9.2.9) >>
+>>
+endobj
+2349 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 76.563 206.885 86.02]
+/A << /S /GoTo /D (subsubsection.5.9.2.10) >>
+>>
+endobj
+2351 0 obj
+<<
+/Font << /F50 2307 0 R /F43 2258 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+2397 0 obj
+<<
+/Length 1051      
+/Filter /FlateDecode
+>>
+stream
+xÚí›[sÚ8€ßùz´Ðê~yLIiLÁ�ÝL¶ÃPâÏ’§Ûüû¶ÌLM;Mô‡
„æÓçstd	�[€ÀYã8lüqÊPPAAx8PS¤&P`^ƒ+/Žcÿsø¾Ñÿ4°ù"H•@*a`|׸úŒÀµyï=@�jþM?y§�3jþŸ‚AãcÙÏÚ™ßÚû¶;æ“ÿw3¹R@
+QÞ5$c¿I¤ò>çÑøkÚÁ¼epÕä{Ðor.Ö.ü¯~«¦
PænqÀ\›FÁøi’‘~7(Qæòµ€ùõÌÙsš1Ÿ,ŠÌ•FŽùa<góþÅÑ•£]³á<£=7îÝ•<ÇHiǼfÃEÆ|–W”;Ú5.3Ú‹¤$·ÊñÃ(®2è­²âR!G»fÅuF{ìÿ袒âåŠÿå?í5Å	ÎÿæÿiŠÛ’³sìcä}:=-‰N™ƒ]—á¶Ö¶ÁÆèYÑæÝœ¶åeüÅ'È{¼¹)bÖØïºÕ¶Eæý6æ\ºØ]·ç¶È|H楨-µK˜‡ÝÖšÉt1-&EðŒ9ÔÛQËj~Û
+3,?s ¯ϯ#ßäJEŠªc[ú<ÎâTól5Ëš&æÞã8±¸Ñ�O‘Í£Ù8*eÙü™Å+[¹éF‚¨‘.ÞA[�DÉ(žF×ù«Å8�ø!‰ïg¥€¤Ã^%ô|§>´EÑiMsÜ÷ãÇ»h–Œ6±fZ;Ö»°¦*I7(NrɆp)’L\„¯/·¦¼­â“äé¡Ä›æ5¿ã]�waŸGSh(‰É¯ÄŒ
²AFäñe½^£�Ë宎ô«Doýݵ
MF´p³‰ü>3ÓW<¤pRìȳ]	ò††yÏà§wÊïl5û¥wF‘ƒ_‚OéŽApÉÝFÀ‹Ñx~ŸCÿ!2‹Sà/§}ŒzËLײùwB¯’y'vƒn{kùæÊÞîæöÄG½Þy§uäc‚¼°t7,*;˜Û¦ûLº‚Ùë/×/Ÿ–Ë?A+8/M�z㪲Jª²Ý“vöäã¬4×ÚÅ‚*€×ôå+Àvúí­�ª]¸Ýßa;c;ÝËa»Õ*ï%îÞþÚ%õð²gòØùÖ
sÎßýýµKé½`?¦1x™ÝŽºá§‹o%ÌgaÚ½Xï.�û�“Òì@»u†ü)D7hµûËu‰p×ÍËðN&çg{úƒ£á`ðÒÙ‡8EÌ«9l+53kØ€˜1&öA¼n±­ßNÎ}lR[¸�³”ncÕ�«ÌV‰ÏE‹ªˆ3N›ŽvrÅUNvæÇI$R°år¿mŠq(Ì%³³hÍGI¾¢œnÌzÊ—5—ÉôÛÓ­é$ò¢Y±‹ÿ
ÂU�
+endstream
+endobj
+2396 0 obj
+<<
+/Type /Page
+/Contents 2397 0 R
+/Resources 2395 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2259 0 R
+/Annots [ 2350 0 R 2354 0 R 2355 0 R 2356 0 R 2357 0 R 2358 0 R 2359 0 R 2360 0 R 2361 0 R 2362 0 R 2363 0 R 2364 0 R 2365 0 R 2366 0 R 2367 0 R 2368 0 R 2369 0 R 2370 0 R 2371 0 R 2372 0 R 2373 0 R 2374 0 R 2375 0 R 2376 0 R 2377 0 R 2378 0 R 2379 0 R 2380 0 R 2381 0 R 2382 0 R 2383 0 R 2384 0 R 2385 0 R 2386 0 R 2387 0 R 2388 0 R 2389 0 R 2390 0 R 2391 0 R 2392 0 R 2393 0 R ]
+>>
+endobj
+2350 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 758.989 204.383 768.446]
+/A << /S /GoTo /D (subsubsection.5.9.2.11) >>
+>>
+endobj
+2354 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 743.236 188.934 752.007]
+/A << /S /GoTo /D (subsubsection.5.9.2.12) >>
+>>
+endobj
+2355 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 726.592 185.948 735.157]
+/A << /S /GoTo /D (subsubsection.5.9.2.13) >>
+>>
+endobj
+2356 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 709.947 196.403 718.718]
+/A << /S /GoTo /D (subsubsection.5.9.2.14) >>
+>>
+endobj
+2357 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 693.303 191.642 701.868]
+/A << /S /GoTo /D (subsubsection.5.9.2.15) >>
+>>
+endobj
+2358 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 676.658 193.919 685.429]
+/A << /S /GoTo /D (subsubsection.5.9.2.16) >>
+>>
+endobj
+2359 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 660.014 187.939 668.579]
+/A << /S /GoTo /D (subsubsection.5.9.2.17) >>
+>>
+endobj
+2360 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 643.369 194.413 652.14]
+/A << /S /GoTo /D (subsubsection.5.9.2.18) >>
+>>
+endobj
+2361 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 626.725 187.939 635.29]
+/A << /S /GoTo /D (subsubsection.5.9.2.19) >>
+>>
+endobj
+2362 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 610.08 194.413 618.851]
+/A << /S /GoTo /D (subsubsection.5.9.2.20) >>
+>>
+endobj
+2363 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 593.436 187.939 602]
+/A << /S /GoTo /D (subsubsection.5.9.2.21) >>
+>>
+endobj
+2364 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 576.791 202.294 585.356]
+/A << /S /GoTo /D (subsubsection.5.9.2.22) >>
+>>
+endobj
+2365 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 560.147 206.777 568.918]
+/A << /S /GoTo /D (subsubsection.5.9.2.23) >>
+>>
+endobj
+2366 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 543.502 193.247 552.273]
+/A << /S /GoTo /D (subsubsection.5.9.2.24) >>
+>>
+endobj
+2367 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 526.858 196.242 535.629]
+/A << /S /GoTo /D (subsubsection.5.9.2.25) >>
+>>
+endobj
+2368 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 508.51 186.944 518.778]
+/A << /S /GoTo /D (subsubsection.5.9.2.26) >>
+>>
+endobj
+2369 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 493.569 204.885 502.133]
+/A << /S /GoTo /D (subsubsection.5.9.2.27) >>
+>>
+endobj
+2370 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 476.924 181.958 485.489]
+/A << /S /GoTo /D (subsubsection.5.9.2.28) >>
+>>
+endobj
+2371 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [84.81 460.28 207.774 469.051]
+/A << /S /GoTo /D (section.5.10) >>
+>>
+endobj
+2372 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [107.719 441.931 217.485 452.2]
+/A << /S /GoTo /D (subsection.5.10.1) >>
+>>
+endobj
+2373 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [107.719 426.991 219.35 435.555]
+/A << /S /GoTo /D (subsection.5.10.2) >>
+>>
+endobj
+2374 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 410.346 195.919 418.911]
+/A << /S /GoTo /D (subsubsection.5.10.2.1) >>
+>>
+endobj
+2375 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 391.998 198.411 402.266]
+/A << /S /GoTo /D (subsubsection.5.10.2.2) >>
+>>
+endobj
+2376 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [69.87 367.168 162.538 375.814]
+/A << /S /GoTo /D (chapter.6) >>
+>>
+endobj
+2377 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [84.81 349.56 193.68 359.223]
+/A << /S /GoTo /D (section.6.1) >>
+>>
+endobj
+2378 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [107.719 332.104 212.5 342.372]
+/A << /S /GoTo /D (subsection.6.1.1) >>
+>>
+endobj
+2379 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [107.719 317.163 259.707 325.934]
+/A << /S /GoTo /D (subsection.6.1.2) >>
+>>
+endobj
+2380 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 299.626 211.852 309.29]
+/A << /S /GoTo /D (subsubsection.6.1.2.1) >>
+>>
+endobj
+2381 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 282.982 244.166 292.645]
+/A << /S /GoTo /D (subsubsection.6.1.2.2) >>
+>>
+endobj
+2382 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 266.337 235.37 276.001]
+/A << /S /GoTo /D (subsubsection.6.1.2.3) >>
+>>
+endobj
+2383 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 249.693 217.743 259.356]
+/A << /S /GoTo /D (subsubsection.6.1.2.4) >>
+>>
+endobj
+2384 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 233.048 209.359 242.712]
+/A << /S /GoTo /D (subsubsection.6.1.2.5) >>
+>>
+endobj
+2385 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 216.404 215.833 226.067]
+/A << /S /GoTo /D (subsubsection.6.1.2.6) >>
+>>
+endobj
+2386 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 200.652 208.866 209.422]
+/A << /S /GoTo /D (subsubsection.6.1.2.7) >>
+>>
+endobj
+2387 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 183.115 245.771 192.778]
+/A << /S /GoTo /D (subsubsection.6.1.2.8) >>
+>>
+endobj
+2388 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 167.362 205.369 175.927]
+/A << /S /GoTo /D (subsubsection.6.1.2.9) >>
+>>
+endobj
+2389 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 150.718 214.067 159.489]
+/A << /S /GoTo /D (subsubsection.6.1.2.10) >>
+>>
+endobj
+2390 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 133.181 211.861 142.844]
+/A << /S /GoTo /D (subsubsection.6.1.2.11) >>
+>>
+endobj
+2391 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 116.537 212.354 126.2]
+/A << /S /GoTo /D (subsubsection.6.1.2.12) >>
+>>
+endobj
+2392 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 99.892 209.377 109.555]
+/A << /S /GoTo /D (subsubsection.6.1.2.13) >>
+>>
+endobj
+2393 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 83.248 211.861 92.911]
+/A << /S /GoTo /D (subsubsection.6.1.2.14) >>
+>>
+endobj
+2395 0 obj
+<<
+/Font << /F50 2307 0 R /F43 2258 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+2442 0 obj
+<<
+/Length 1012      
+/Filter /FlateDecode
+>>
+stream
+xÚí›Ïo¤6€ïóWp„C\ÿ¶92Ä3°¡0’M6Z¡ÝMUênÕUÕvÿûš�™)6dCÔÈ!…8Ö7ß³ß{tžèlWërõÆAGŸsâ”?;ɹ#|8rÊçÞýåOï}ùf¥ÊÕï+¤ÿ:èx™”@bê|ú¼º�ý»7Ä—Î_û+?;”À(Ñç¿:Åê§lÿu3ÎקvÀ¼�Œ¾ò4D!`R:‚#Óá
ó.°�nô¶BûéÆuî/$a.ð.ã�û~:«¡5NêÖâ2ñëãâ€SÖáÌ�œñÂù?åL;œEÃùFå묈Ë;6ñáÂõþʆkÅEu§‚ÜäʘX¸¾ÂW¿áºËŠ²ŠŠ*ðt¯ËÈÄ+�?;’|”¡6$Ã$ViY…*÷tK¤/Ä\Íä£ÌĨå™×JÞíJ�B7«
+U–qº5±R‰�bâvéLtxïvIÂZÍ8K«]îéÓ¬fÛ³ÄÚ²ž‹s¤A$IVGï[­[²©Šx›ªK‚-z
L[½š8­ôÞœxz }zYÕʶÿX©'‡KظÈNa[D
f¼²6á²™¼HRÞ�I$]`þ¦g¦èÀd/0ÇÀìš)O0n«((¢ª8,—û¥SYp_’ŒO_Cß&g•-˜.þ=ë�]ŠWÊjYp.–X~‰‘�XÞ2èï�nb•Ø¹£þZäwåS·e•ke— R.š©‘.µMÔÅŠU6¿ÅOŽó�vIÆkA÷zS—|ï¬m—P:kt]	YÝ.	âtPENñ¢ ¼Ë,Œw‘Ê¡1)fMK´ÚŽjol2‚–Ø<’“äÖœÚýèe?8�3K
+U7­¾ß«'=yó¨QMñ¶Ú]¯ëª¢7l©ïŸ-”ZÙd
+檄ƒà¡‰ræ ºŠ`DÚ6:®sÕBRrîa4Rbå·Ï†‘^’Ø™t½¡6“&�ÚïmuéØ�æ%wiÎNfÃøÎj"0ž FF]¨ý]¨�U‡Q]�$*µ@:ùõC|Kÿ^Ì'¿†˜‰qû¬Æ�*”žíŽ£3±QÆøÏ�HNð¡ttaf6¹º<,´}T°ð'«32Ø2¯008ÉîöX}ìî¶J‹8K‹Á‡BçÆ«+˜‘õª0ì¿{rÔ‹/–
fö°ozC’£ù< 7Ö;#™>Ü|¯{²ý™’¤DSC³·�eW±MŽÎç^í¾ÐÒ÷Þ
c@—§c^»9¼éÃ
œÖ/×PFµÁT
×Cî?’íã—ǯþx|h>“�õ3žßšóËßj¯ÿþö¤g	ÝÇ/æÿ
;D
+endstream
+endobj
+2441 0 obj
+<<
+/Type /Page
+/Contents 2442 0 R
+/Resources 2440 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2259 0 R
+/Annots [ 2394 0 R 2398 0 R 2399 0 R 2400 0 R 2401 0 R 2402 0 R 2403 0 R 2404 0 R 2405 0 R 2406 0 R 2407 0 R 2408 0 R 2409 0 R 2410 0 R 2411 0 R 2412 0 R 2413 0 R 2414 0 R 2415 0 R 2416 0 R 2417 0 R 2418 0 R 2419 0 R 2420 0 R 2421 0 R 2422 0 R 2423 0 R 2424 0 R 2425 0 R 2426 0 R 2427 0 R 2428 0 R 2429 0 R 2430 0 R 2431 0 R 2432 0 R 2433 0 R 2434 0 R 2435 0 R 2436 0 R 2437 0 R 2438 0 R ]
+>>
+endobj
+2394 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 758.989 201.388 768.446]
+/A << /S /GoTo /D (subsubsection.6.1.2.15) >>
+>>
+endobj
+2398 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 742.344 201.388 751.801]
+/A << /S /GoTo /D (subsubsection.6.1.2.16) >>
+>>
+endobj
+2399 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 726.592 227.803 735.363]
+/A << /S /GoTo /D (subsubsection.6.1.2.17) >>
+>>
+endobj
+2400 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 709.055 226.305 718.718]
+/A << /S /GoTo /D (subsubsection.6.1.2.18) >>
+>>
+endobj
+2401 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 692.411 247.277 702.074]
+/A << /S /GoTo /D (subsubsection.6.1.2.19) >>
+>>
+endobj
+2402 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 675.766 237.486 685.429]
+/A << /S /GoTo /D (subsubsection.6.1.2.20) >>
+>>
+endobj
+2403 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 659.122 256.88 668.785]
+/A << /S /GoTo /D (subsubsection.6.1.2.21) >>
+>>
+endobj
+2404 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 642.477 310.534 652.14]
+/A << /S /GoTo /D (subsubsection.6.1.2.22) >>
+>>
+endobj
+2405 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 625.833 274.373 635.496]
+/A << /S /GoTo /D (subsubsection.6.1.2.23) >>
+>>
+endobj
+2406 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 609.188 253.482 618.645]
+/A << /S /GoTo /D (subsubsection.6.1.2.24) >>
+>>
+endobj
+2407 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 592.544 241.763 602.207]
+/A << /S /GoTo /D (subsubsection.6.1.2.25) >>
+>>
+endobj
+2408 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 575.899 241.763 585.562]
+/A << /S /GoTo /D (subsubsection.6.1.2.26) >>
+>>
+endobj
+2409 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 559.255 241.763 568.918]
+/A << /S /GoTo /D (subsubsection.6.1.2.27) >>
+>>
+endobj
+2410 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 542.61 278.964 552.273]
+/A << /S /GoTo /D (subsubsection.6.1.2.28) >>
+>>
+endobj
+2411 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 525.965 247.233 535.629]
+/A << /S /GoTo /D (subsubsection.6.1.2.29) >>
+>>
+endobj
+2412 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 509.321 240.266 518.984]
+/A << /S /GoTo /D (subsubsection.6.1.2.30) >>
+>>
+endobj
+2413 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 492.676 273.656 502.34]
+/A << /S /GoTo /D (subsubsection.6.1.2.31) >>
+>>
+endobj
+2414 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 476.032 272.661 485.695]
+/A << /S /GoTo /D (subsubsection.6.1.2.32) >>
+>>
+endobj
+2415 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 459.387 246.964 469.051]
+/A << /S /GoTo /D (subsubsection.6.1.2.33) >>
+>>
+endobj
+2416 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 442.743 273.055 452.406]
+/A << /S /GoTo /D (subsubsection.6.1.2.34) >>
+>>
+endobj
+2417 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 426.098 277.861 435.761]
+/A << /S /GoTo /D (subsubsection.6.1.2.35) >>
+>>
+endobj
+2418 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 409.454 285.823 419.117]
+/A << /S /GoTo /D (subsubsection.6.1.2.36) >>
+>>
+endobj
+2419 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 392.809 271.379 402.472]
+/A << /S /GoTo /D (subsubsection.6.1.2.37) >>
+>>
+endobj
+2420 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 376.165 267.398 385.828]
+/A << /S /GoTo /D (subsubsection.6.1.2.38) >>
+>>
+endobj
+2421 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 359.52 251.725 369.183]
+/A << /S /GoTo /D (subsubsection.6.1.2.39) >>
+>>
+endobj
+2422 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 342.876 309.037 352.539]
+/A << /S /GoTo /D (subsubsection.6.1.2.40) >>
+>>
+endobj
+2423 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 326.231 326.969 335.894]
+/A << /S /GoTo /D (subsubsection.6.1.2.41) >>
+>>
+endobj
+2424 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 309.587 298.475 319.25]
+/A << /S /GoTo /D (subsubsection.6.1.2.42) >>
+>>
+endobj
+2425 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 292.942 311.529 302.605]
+/A << /S /GoTo /D (subsubsection.6.1.2.43) >>
+>>
+endobj
+2426 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 276.298 326.691 285.961]
+/A << /S /GoTo /D (subsubsection.6.1.2.44) >>
+>>
+endobj
+2427 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 259.653 329.462 269.316]
+/A << /S /GoTo /D (subsubsection.6.1.2.45) >>
+>>
+endobj
+2428 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 243.009 314.049 252.672]
+/A << /S /GoTo /D (subsubsection.6.1.2.46) >>
+>>
+endobj
+2429 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 226.364 316.541 236.027]
+/A << /S /GoTo /D (subsubsection.6.1.2.47) >>
+>>
+endobj
+2430 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 209.72 309.512 219.383]
+/A << /S /GoTo /D (subsubsection.6.1.2.48) >>
+>>
+endobj
+2431 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 193.075 312.005 202.738]
+/A << /S /GoTo /D (subsubsection.6.1.2.49) >>
+>>
+endobj
+2432 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 176.431 325.956 186.094]
+/A << /S /GoTo /D (subsubsection.6.1.2.50) >>
+>>
+endobj
+2433 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 159.786 279.125 169.449]
+/A << /S /GoTo /D (subsubsection.6.1.2.51) >>
+>>
+endobj
+2434 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 143.141 280.121 152.805]
+/A << /S /GoTo /D (subsubsection.6.1.2.52) >>
+>>
+endobj
+2435 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 126.497 271.648 136.16]
+/A << /S /GoTo /D (subsubsection.6.1.2.53) >>
+>>
+endobj
+2436 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 109.852 255.714 119.516]
+/A << /S /GoTo /D (subsubsection.6.1.2.54) >>
+>>
+endobj
+2437 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 93.208 264.331 102.871]
+/A << /S /GoTo /D (subsubsection.6.1.2.55) >>
+>>
+endobj
+2438 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 76.563 257.203 86.227]
+/A << /S /GoTo /D (subsubsection.6.1.2.56) >>
+>>
+endobj
+2440 0 obj
+<<
+/Font << /F50 2307 0 R /F43 2258 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+2487 0 obj
+<<
+/Length 965       
+/Filter /FlateDecode
+>>
+stream
+xÚí›Msâ6€ïü
+íCT}K>:X
^Ëî’fv4m“æÒÝNw:m÷ßW&"`lg–$;i°Nƒ‘ÅÃ#ù}Í+î“Ñy9úá‚# `"åo€ã2€L”7à:ú;þX¾érôç»�!€�DP	
¤RP¹³ý4ºþˆÀ�{ï@�&
+ü³9ó`œBΨ{ý;0£÷#ä/}ßÏ—;ßaáãÎÜ
3¹R@
+Ñv4bH —ñ‘**Æ.Óµ]Ue^•¶ÐãU‘Y3ûIo½½¸>S	‰`|Æ9¿oÄóŽÄKv¶9rß–EûqÒqíP0ÞÀ 0œÇEÕÅE'áÎ|…/öúÌXƒYÒdftsý¨{™.[Ð’d0˜j	t€©ÊóUS•:³“"&(ZU¹9ä%%;Yu~Œ‰™MZ40¢x(Â�&œÜÌír•é�IX†  M\ãY>uK�©feçr˜‹ÛAJµ±˜(;/­™¦„‹–XâÍã!Ç9Ä›x“-ªØñ4í;<ãiZ¯Ó®!Èæ«Eì:Œ®0E¼G&ŽÈ	
+#ÛóiÜ;Ÿ$ÁFuãQ=€£CYi|м&Ü¥ˆí(¡7âfŸô·ÑãÜÉVà¶n�ëÜ•xÇÕÝ×—ò•ì¸r‚×^®ô8_}f°fLõ"}ÃL^wScŸc̯Îu!…jßܾËxO_cŸœL¯Î‹Yfçë¶Ë�ëS|õY�g&µÁB_ˆš$ÓNöâéȉ‡€§i�:ij	‰�Çç9…ƒ“c]«ûž6a4äå]¡nR]žN�;Ê)…»IqL©¦Sd�Ô|lúnj	c§©í€Ö1‡­ië€Ö1!ƒiûÐ|D¯³Î§€d[^²Ñgˆé£ûl¶˜•ÓYµ$íÿUûyå
XÀ¾Œ±êÐX›wܳ1Bx8ùqnú¬#7óºi5ïx…ÃÚúÌ
Sô€ùƒË§ºýŸ/
@�ð6Ù«‡º¨;M/3HÍ[d)åA@˜ì•Héu©‹ËtQ×IµjUU${€¶+”µtÆg{Éö“€ø{XÌ÷Ó€ø›‹ã,Þ•{aj«<‹ŠÒ“º<×^®êÃz‹ÀûM�¼6¥ÎÚÅÞè$¸4Õ“�qy”Qd`©mMã›0Fj°³ñžB×~ Î!¢ø˜í@ÛH)X½éÇwÅ8®Ùü4“ÛÏ·_~þëöæþ·ù¥ÞzðÕ'�ÔU�ÿ~½sƒDÑíçÃ!þpsL/
+endstream
+endobj
+2486 0 obj
+<<
+/Type /Page
+/Contents 2487 0 R
+/Resources 2485 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2488 0 R
+/Annots [ 2439 0 R 2443 0 R 2444 0 R 2445 0 R 2446 0 R 2447 0 R 2448 0 R 2449 0 R 2450 0 R 2451 0 R 2452 0 R 2453 0 R 2454 0 R 2455 0 R 2456 0 R 2457 0 R 2458 0 R 2459 0 R 2460 0 R 2461 0 R 2462 0 R 2463 0 R 2464 0 R 2465 0 R 2466 0 R 2467 0 R 2468 0 R 2469 0 R 2470 0 R 2471 0 R 2472 0 R 2473 0 R 2474 0 R 2475 0 R 2476 0 R 2477 0 R 2478 0 R 2479 0 R 2480 0 R 2481 0 R 2482 0 R 2483 0 R ]
+>>
+endobj
+2439 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 758.989 327.938 768.652]
+/A << /S /GoTo /D (subsubsection.6.1.2.57) >>
+>>
+endobj
+2443 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 742.344 277.538 752.007]
+/A << /S /GoTo /D (subsubsection.6.1.2.58) >>
+>>
+endobj
+2444 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 725.7 289.634 735.363]
+/A << /S /GoTo /D (subsubsection.6.1.2.59) >>
+>>
+endobj
+2445 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 709.055 321.518 718.718]
+/A << /S /GoTo /D (subsubsection.6.1.2.60) >>
+>>
+endobj
+2446 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 692.411 304.267 702.074]
+/A << /S /GoTo /D (subsubsection.6.1.2.61) >>
+>>
+endobj
+2447 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 675.766 278.13 685.429]
+/A << /S /GoTo /D (subsubsection.6.1.2.62) >>
+>>
+endobj
+2448 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 659.122 293.57 668.785]
+/A << /S /GoTo /D (subsubsection.6.1.2.63) >>
+>>
+endobj
+2449 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 642.477 300.07 652.14]
+/A << /S /GoTo /D (subsubsection.6.1.2.64) >>
+>>
+endobj
+2450 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 625.833 300.07 635.496]
+/A << /S /GoTo /D (subsubsection.6.1.2.65) >>
+>>
+endobj
+2451 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 609.188 331.434 618.851]
+/A << /S /GoTo /D (subsubsection.6.1.2.66) >>
+>>
+endobj
+2452 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 592.544 299.568 602.207]
+/A << /S /GoTo /D (subsubsection.6.1.2.67) >>
+>>
+endobj
+2453 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 575.899 309.539 585.562]
+/A << /S /GoTo /D (subsubsection.6.1.2.68) >>
+>>
+endobj
+2454 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 560.147 207.387 568.711]
+/A << /S /GoTo /D (subsubsection.6.1.2.69) >>
+>>
+endobj
+2455 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 543.502 227.31 552.273]
+/A << /S /GoTo /D (subsubsection.6.1.2.70) >>
+>>
+endobj
+2456 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 526.858 227.31 535.629]
+/A << /S /GoTo /D (subsubsection.6.1.2.71) >>
+>>
+endobj
+2457 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 510.213 227.31 518.984]
+/A << /S /GoTo /D (subsubsection.6.1.2.72) >>
+>>
+endobj
+2458 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 493.569 197.416 502.133]
+/A << /S /GoTo /D (subsubsection.6.1.2.73) >>
+>>
+endobj
+2459 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 476.924 221.831 485.489]
+/A << /S /GoTo /D (subsubsection.6.1.2.74) >>
+>>
+endobj
+2460 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 459.387 227.301 468.844]
+/A << /S /GoTo /D (subsubsection.6.1.2.75) >>
+>>
+endobj
+2461 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 442.743 301.559 452.406]
+/A << /S /GoTo /D (subsubsection.6.1.2.76) >>
+>>
+endobj
+2462 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 426.098 301.559 435.761]
+/A << /S /GoTo /D (subsubsection.6.1.2.77) >>
+>>
+endobj
+2463 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 409.454 301.559 419.117]
+/A << /S /GoTo /D (subsubsection.6.1.2.78) >>
+>>
+endobj
+2464 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 392.809 285.617 402.472]
+/A << /S /GoTo /D (subsubsection.6.1.2.79) >>
+>>
+endobj
+2465 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 376.165 285.617 385.828]
+/A << /S /GoTo /D (subsubsection.6.1.2.80) >>
+>>
+endobj
+2466 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 359.52 285.617 369.183]
+/A << /S /GoTo /D (subsubsection.6.1.2.81) >>
+>>
+endobj
+2467 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 342.876 267.676 352.539]
+/A << /S /GoTo /D (subsubsection.6.1.2.82) >>
+>>
+endobj
+2468 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 326.231 267.676 335.894]
+/A << /S /GoTo /D (subsubsection.6.1.2.83) >>
+>>
+endobj
+2469 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 309.587 267.676 319.25]
+/A << /S /GoTo /D (subsubsection.6.1.2.84) >>
+>>
+endobj
+2470 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 293.834 213.86 302.399]
+/A << /S /GoTo /D (subsubsection.6.1.2.85) >>
+>>
+endobj
+2471 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 277.19 226.296 285.755]
+/A << /S /GoTo /D (subsubsection.6.1.2.86) >>
+>>
+endobj
+2472 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 260.545 226.296 269.11]
+/A << /S /GoTo /D (subsubsection.6.1.2.87) >>
+>>
+endobj
+2473 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 243.009 252.218 252.465]
+/A << /S /GoTo /D (subsubsection.6.1.2.88) >>
+>>
+endobj
+2474 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 227.256 206.929 236.027]
+/A << /S /GoTo /D (subsubsection.6.1.2.89) >>
+>>
+endobj
+2475 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 210.612 234.267 219.383]
+/A << /S /GoTo /D (subsubsection.6.1.2.90) >>
+>>
+endobj
+2476 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 193.075 280.614 202.738]
+/A << /S /GoTo /D (subsubsection.6.1.2.91) >>
+>>
+endobj
+2477 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 176.431 268.169 186.094]
+/A << /S /GoTo /D (subsubsection.6.1.2.92) >>
+>>
+endobj
+2478 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 159.786 207.88 169.449]
+/A << /S /GoTo /D (subsubsection.6.1.2.93) >>
+>>
+endobj
+2479 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 143.141 207.88 152.805]
+/A << /S /GoTo /D (subsubsection.6.1.2.94) >>
+>>
+endobj
+2480 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 126.497 207.88 136.16]
+/A << /S /GoTo /D (subsubsection.6.1.2.95) >>
+>>
+endobj
+2481 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 109.852 327.059 119.516]
+/A << /S /GoTo /D (subsubsection.6.1.2.96) >>
+>>
+endobj
+2482 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 93.208 303.505 102.871]
+/A << /S /GoTo /D (subsubsection.6.1.2.97) >>
+>>
+endobj
+2483 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 76.563 243.79 86.227]
+/A << /S /GoTo /D (subsubsection.6.1.2.98) >>
+>>
+endobj
+2485 0 obj
+<<
+/Font << /F50 2307 0 R /F43 2258 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+2533 0 obj
+<<
+/Length 1092      
+/Filter /FlateDecode
+>>
+stream
+xÚí›M“›6†ïþá°TIˆ#
c  7Ùìd4mw»Ó™&�f:mòï+Œü±ÈNL6�fƒ.Æc,?~ôñJ8÷pòÅ3±øa‰�Cý˜�п:ð)!N>�Ž¸unÜ¿óÞˆç&. úpàþ4J} ç—·‹›7À¹Uï=w€ÆÔùg{æ[áÐÇ(TÏwºÅ‹Ð_=\çý½¾`«£Î<"àcJ�ˆ@ìŠC|è~{WADÝnÓ4uë…À,“yëÀ­7M·-ò›+J‰ë{WãápòÕ§|髯i¹ˆè:†©ŽW�øácj��ç2)s�ðIüøÿŸ+zÈ\›º²Hª¬+’“‰‡�»Ås¨|�§ÁCÿdʆÊkˆGV¶s²…Ä»–ʳ–zÅ`æÕ7š¨%ÒÕ·[Éu�@iˆ-ÐIŠb
´e[C3©dS�‘%gªHr¢ìä�ªq1¢ø)!ø漌ºi]¯ø]Íg§.ತ-=u÷Zfž:$ú.¾LŒ¾
+Ú¾jšÂ:ù¬“WrÙ&ýè)—%«rs˜‰"bõ܃ƒ:û4ƒˆYÆ«Üh^©m^á&Ô1(iÙY¼oDÿP§ui4¸A8–t¢®:*µ,­ÛLvü5“%_sa†Éyc)¨ÃQZrV‰}¾”âº1ú{L#+Ü�œA�B†�«ŸŸ¦Cl…SØtÔ)¶S>æ„Zh;”G8IöJÉS=�äu5Æ…�%z™®:
%åÙ™7úY|sâê,”I•3™ò¦8æ)°ÏyªcŽàk–Ézcz
+ÑÌ•Œ§)€#£‚•em@%ÔbüFh“N¢ŒcËð\åt¶Ù�/ùrß¹›“r0¶ü23ÇTeË^x¸Ö	3yËñœ�hÄQÕq¾4–/Bb{žÅÔiÉ+Þ,3dŒí®ƒ/U§#V¥Û¾èºé7Á°W‚U�
+IÆîŽ(BOœÍ‹v£ÈtÅ5s6?Ïxd!=lGØ4Ç+>Ì0°P/w·ÊúnXãa²H:c‰‡ À2<#fvÍ£
+�K9iY’ıÕP!Ôaç°¥­ebèkŒÅF­{p:áTØee8fALlƒx™‰:Ü<K²Ã²DZ$ÜœÆØâ3|Ô™†grÍ»µnûRsËž­�p¢�:Ôlª~…6¯øëaìmèHá<q�$‡ú{r¾8óq÷T
u¶y9l´¨ry4X¼pÇùÌ�ÔÉEµˆWüŽæËdZWâDm&
úþÅÒÙcw÷«ÄñÚ«\zT�˜y¹iOì¨ 3s�C»6lÕùz«|ßM}Xœºƒc„pÊ
d»{ÖˆDõ·‰!Œ|Œ‘:úD]rûïäwïîÞÿô×ÝíðïüÜ7‘‡çÙ}ùáã½*%pïÞ�Ëø/xeª
+endstream
+endobj
+2532 0 obj
+<<
+/Type /Page
+/Contents 2533 0 R
+/Resources 2531 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2488 0 R
+/Annots [ 2484 0 R 2489 0 R 2490 0 R 2491 0 R 2492 0 R 2493 0 R 2494 0 R 2495 0 R 2496 0 R 2497 0 R 2498 0 R 2499 0 R 2500 0 R 2501 0 R 2502 0 R 2503 0 R 2504 0 R 2505 0 R 2506 0 R 2507 0 R 2508 0 R 2509 0 R 2510 0 R 2511 0 R 2512 0 R 2513 0 R 2514 0 R 2515 0 R 2516 0 R 2517 0 R 2518 0 R 2519 0 R 2520 0 R 2521 0 R 2522 0 R 2523 0 R 2524 0 R 2525 0 R 2526 0 R 2527 0 R 2528 0 R 2529 0 R ]
+>>
+endobj
+2484 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 758.989 275.674 768.652]
+/A << /S /GoTo /D (subsubsection.6.1.2.99) >>
+>>
+endobj
+2489 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 742.344 225.821 752.007]
+/A << /S /GoTo /D (subsubsection.6.1.2.100) >>
+>>
+endobj
+2490 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 725.7 295.605 735.363]
+/A << /S /GoTo /D (subsubsection.6.1.2.101) >>
+>>
+endobj
+2491 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 709.055 254.943 718.718]
+/A << /S /GoTo /D (subsubsection.6.1.2.102) >>
+>>
+endobj
+2492 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 692.411 235.281 702.074]
+/A << /S /GoTo /D (subsubsection.6.1.2.103) >>
+>>
+endobj
+2493 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 675.766 231.291 685.429]
+/A << /S /GoTo /D (subsubsection.6.1.2.104) >>
+>>
+endobj
+2494 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 659.122 260.189 668.785]
+/A << /S /GoTo /D (subsubsection.6.1.2.105) >>
+>>
+endobj
+2495 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 642.477 221.329 652.14]
+/A << /S /GoTo /D (subsubsection.6.1.2.106) >>
+>>
+endobj
+2496 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 626.725 216.344 635.496]
+/A << /S /GoTo /D (subsubsection.6.1.2.107) >>
+>>
+endobj
+2497 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 609.188 235.998 618.645]
+/A << /S /GoTo /D (subsubsection.6.1.2.108) >>
+>>
+endobj
+2498 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 592.544 271.872 602.207]
+/A << /S /GoTo /D (subsubsection.6.1.2.109) >>
+>>
+endobj
+2499 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 576.791 221.239 585.562]
+/A << /S /GoTo /D (subsubsection.6.1.2.110) >>
+>>
+endobj
+2500 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 559.255 253.814 568.918]
+/A << /S /GoTo /D (subsubsection.6.1.2.111) >>
+>>
+endobj
+2501 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 542.61 273.136 552.273]
+/A << /S /GoTo /D (subsubsection.6.1.2.112) >>
+>>
+endobj
+2502 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 525.965 270.877 535.629]
+/A << /S /GoTo /D (subsubsection.6.1.2.113) >>
+>>
+endobj
+2503 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 509.321 275.414 518.984]
+/A << /S /GoTo /D (subsubsection.6.1.2.114) >>
+>>
+endobj
+2504 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 493.569 218.334 502.34]
+/A << /S /GoTo /D (subsubsection.6.1.2.115) >>
+>>
+endobj
+2505 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 476.924 239.683 485.695]
+/A << /S /GoTo /D (subsubsection.6.1.2.116) >>
+>>
+endobj
+2506 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 460.28 210.095 468.844]
+/A << /S /GoTo /D (subsubsection.6.1.2.117) >>
+>>
+endobj
+2507 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 442.743 258.682 452.406]
+/A << /S /GoTo /D (subsubsection.6.1.2.118) >>
+>>
+endobj
+2508 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 426.098 233.272 435.761]
+/A << /S /GoTo /D (subsubsection.6.1.2.119) >>
+>>
+endobj
+2509 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 409.454 247.735 419.117]
+/A << /S /GoTo /D (subsubsection.6.1.2.120) >>
+>>
+endobj
+2510 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 392.809 252.272 402.472]
+/A << /S /GoTo /D (subsubsection.6.1.2.121) >>
+>>
+endobj
+2511 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 377.057 238.903 385.828]
+/A << /S /GoTo /D (subsubsection.6.1.2.122) >>
+>>
+endobj
+2512 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 359.52 253.841 369.183]
+/A << /S /GoTo /D (subsubsection.6.1.2.123) >>
+>>
+endobj
+2513 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 342.876 242.974 352.539]
+/A << /S /GoTo /D (subsubsection.6.1.2.124) >>
+>>
+endobj
+2514 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 327.123 223.311 335.894]
+/A << /S /GoTo /D (subsubsection.6.1.2.125) >>
+>>
+endobj
+2515 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 309.587 299.093 319.25]
+/A << /S /GoTo /D (subsubsection.6.1.2.126) >>
+>>
+endobj
+2516 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 293.834 213.349 302.605]
+/A << /S /GoTo /D (subsubsection.6.1.2.127) >>
+>>
+endobj
+2517 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 276.298 239.324 285.755]
+/A << /S /GoTo /D (subsubsection.6.1.2.128) >>
+>>
+endobj
+2518 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 259.653 255.437 269.316]
+/A << /S /GoTo /D (subsubsection.6.1.2.129) >>
+>>
+endobj
+2519 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 243.009 277.35 252.672]
+/A << /S /GoTo /D (subsubsection.6.1.2.130) >>
+>>
+endobj
+2520 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 226.364 272.186 236.027]
+/A << /S /GoTo /D (subsubsection.6.1.2.131) >>
+>>
+endobj
+2521 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 209.72 236.419 219.383]
+/A << /S /GoTo /D (subsubsection.6.1.2.132) >>
+>>
+endobj
+2522 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 193.075 261.901 202.738]
+/A << /S /GoTo /D (subsubsection.6.1.2.133) >>
+>>
+endobj
+2523 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 176.431 242.158 186.094]
+/A << /S /GoTo /D (subsubsection.6.1.2.134) >>
+>>
+endobj
+2524 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 159.786 276.615 169.449]
+/A << /S /GoTo /D (subsubsection.6.1.2.135) >>
+>>
+endobj
+2525 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 143.141 234.285 152.805]
+/A << /S /GoTo /D (subsubsection.6.1.2.136) >>
+>>
+endobj
+2526 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 126.497 265.712 136.16]
+/A << /S /GoTo /D (subsubsection.6.1.2.137) >>
+>>
+endobj
+2527 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 109.852 315.394 119.516]
+/A << /S /GoTo /D (subsubsection.6.1.2.138) >>
+>>
+endobj
+2528 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 93.208 300.779 102.871]
+/A << /S /GoTo /D (subsubsection.6.1.2.139) >>
+>>
+endobj
+2529 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 76.563 243.736 86.227]
+/A << /S /GoTo /D (subsubsection.6.1.2.140) >>
+>>
+endobj
+2531 0 obj
+<<
+/Font << /F50 2307 0 R /F43 2258 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+2578 0 obj
+<<
+/Length 1101      
+/Filter /FlateDecode
+>>
+stream
+xÚí›]s›8†ïý+ti.ÂJè“K¡Æ@tãÉt˜Ý&ÍtfÛ�v:»Û¿Âã€�–tv'1\‘¬(¯tÎ{Ž€à@°Z\‹_B
+�°]Æ0(ÞŠˆM°¸ëØ�âÜ,ÿúðÁz[¼ZÈbñy�ô!@€C[0¸¶px÷qqó‚[ý»WÚØàïÝ�
¡Ø¦ë¯ÿjñz
ÍoÆùroÌÍtô�Ýt�6p†lØ·ÙÈvlD�uáp±¼ô‚ªˆüµ,v³l‡7R¾´­JYs¡Oüî'?þÿ­™‘%EFŸ±¾^ f3BÂt˜Ij¸,*y�I¿�A©àbè|�!yÈ7}¯j1†i™r63<©CbÊÜÂ5Á´,j”iÔÏBŽþ©ì#¥Í,z¤
Ë�ÜT©Eáò�ÌÃ8­¹þÚˆœ5yJ“¬á¦ùe2Ñ»c!¥É`{ÄSÕ7Zó®5_Ê`;³ÆNiL4üä&+¶Õ~÷ó¯¼(¦5Ïû›fæ6Ì”ŒÃJE«D{r}fÄ�³Úöä(4jËsKƒIóÊ‹[ÉåÒ—Ñ›#™Ÿxñ”ð8}у±‘Jy5 Õ0÷Àhrî�Ô›ÓËêt&…Û*´„Î颸�´¾w†Ø—#îäxå%�ºòÖ1
+Íäò#¹\¾¶\–RU™=j*0Óœñ~œª2—?#ŸŽ¦Œ)ØDJEɪ³j˜®A4moű\yq•íÖ›—{YhEõ]Ÿ÷¬š1eÒ–âËA8%g‚‰ŒÔ–ñ�ôóºÄ±ÍŠjŸÕ‚#�Bp$ã„Æ`Ûü,
+#ÿTTäPÌû2d¨]­ªÌ²´¡¨—ìÉBÿOh<O�9-›uÒ“J««¿6Ÿœ‹?tQ‡«´nØDù±~
™öÂ4©Ö„„]Wf×OðÓ¸v¡G‹¸™å¦ÑÑ}hMy:ªÆç%{J~Æ%hÔæÁw»0‚¡³¤FG*�úõ¹Í.ñõ‡ÀØ9«�ŽT›ñûêоÀ¦íûЫÏZ«™¹]‘C¶}û(Üp‰é�!)?O”D†]R:KOó2¦!NWõ1‡¬,ª"¯õW&m^wžëòÉÊ8‡"VWA¤ü4IŽK♶”ð!©'bšÜ~E¡µASï\ƒågÉ‹�Ýóz,±`®3ÕC—l¤YT•¾/•zR¨œ¸,yG1—ªÜduØÜ7úŽUE˜€ç/.Ña‘^[z”å¶:ìx6}˜ª±V¾ÌŽDG�ÉèÈ8�L­[0Ƚ0|ÿÿsÓ¢€ÚµÜé�Î\Ÿ"Y�:®ÑåðdÒËBðìTkìÇ5…îɃ…º§Ê 9ö’¥6ÄhÌ;Bí‹IÌv8#õ›@f(Bm¦/»Ç´ºût÷å·¯w·Ícú½.O35ë?ë‡õÏ·{=I¸¼ûÔŸâ¿�S‡
+endstream
+endobj
+2577 0 obj
+<<
+/Type /Page
+/Contents 2578 0 R
+/Resources 2576 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2488 0 R
+/Annots [ 2530 0 R 2534 0 R 2535 0 R 2536 0 R 2537 0 R 2538 0 R 2539 0 R 2540 0 R 2541 0 R 2542 0 R 2543 0 R 2544 0 R 2545 0 R 2546 0 R 2547 0 R 2548 0 R 2549 0 R 2550 0 R 2551 0 R 2552 0 R 2553 0 R 2554 0 R 2555 0 R 2556 0 R 2557 0 R 2558 0 R 2559 0 R 2560 0 R 2561 0 R 2562 0 R 2563 0 R 2564 0 R 2565 0 R 2566 0 R 2567 0 R 2568 0 R 2569 0 R 2570 0 R 2571 0 R 2572 0 R 2573 0 R 2574 0 R ]
+>>
+endobj
+2530 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 758.989 236.769 768.652]
+/A << /S /GoTo /D (subsubsection.6.1.2.141) >>
+>>
+endobj
+2534 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 742.344 253.348 752.007]
+/A << /S /GoTo /D (subsubsection.6.1.2.142) >>
+>>
+endobj
+2535 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 725.7 254.334 735.363]
+/A << /S /GoTo /D (subsubsection.6.1.2.143) >>
+>>
+endobj
+2536 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 709.055 264.089 718.718]
+/A << /S /GoTo /D (subsubsection.6.1.2.144) >>
+>>
+endobj
+2537 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 692.411 257.965 702.074]
+/A << /S /GoTo /D (subsubsection.6.1.2.145) >>
+>>
+endobj
+2538 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 675.766 291.068 685.429]
+/A << /S /GoTo /D (subsubsection.6.1.2.146) >>
+>>
+endobj
+2539 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 659.122 255.204 668.785]
+/A << /S /GoTo /D (subsubsection.6.1.2.147) >>
+>>
+endobj
+2540 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 642.477 274.356 652.14]
+/A << /S /GoTo /D (subsubsection.6.1.2.148) >>
+>>
+endobj
+2541 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 625.833 272.374 635.496]
+/A << /S /GoTo /D (subsubsection.6.1.2.149) >>
+>>
+endobj
+2542 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 609.188 298.098 618.851]
+/A << /S /GoTo /D (subsubsection.6.1.2.150) >>
+>>
+endobj
+2543 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 592.544 248.963 602.207]
+/A << /S /GoTo /D (subsubsection.6.1.2.151) >>
+>>
+endobj
+2544 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 575.899 266.178 585.562]
+/A << /S /GoTo /D (subsubsection.6.1.2.152) >>
+>>
+endobj
+2545 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 559.255 260.682 568.918]
+/A << /S /GoTo /D (subsubsection.6.1.2.153) >>
+>>
+endobj
+2546 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 542.61 288.056 552.273]
+/A << /S /GoTo /D (subsubsection.6.1.2.154) >>
+>>
+endobj
+2547 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 525.965 309.243 535.629]
+/A << /S /GoTo /D (subsubsection.6.1.2.155) >>
+>>
+endobj
+2548 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 509.321 282.111 518.984]
+/A << /S /GoTo /D (subsubsection.6.1.2.156) >>
+>>
+endobj
+2549 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 492.676 277.556 502.34]
+/A << /S /GoTo /D (subsubsection.6.1.2.157) >>
+>>
+endobj
+2550 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 476.032 291.804 485.695]
+/A << /S /GoTo /D (subsubsection.6.1.2.158) >>
+>>
+endobj
+2551 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 459.387 261.041 469.051]
+/A << /S /GoTo /D (subsubsection.6.1.2.159) >>
+>>
+endobj
+2552 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 442.743 262.323 452.406]
+/A << /S /GoTo /D (subsubsection.6.1.2.160) >>
+>>
+endobj
+2553 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 426.098 306.742 435.761]
+/A << /S /GoTo /D (subsubsection.6.1.2.161) >>
+>>
+endobj
+2554 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 409.454 245.951 419.117]
+/A << /S /GoTo /D (subsubsection.6.1.2.162) >>
+>>
+endobj
+2555 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 392.809 283.25 402.472]
+/A << /S /GoTo /D (subsubsection.6.1.2.163) >>
+>>
+endobj
+2556 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 376.165 276.229 385.828]
+/A << /S /GoTo /D (subsubsection.6.1.2.164) >>
+>>
+endobj
+2557 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 359.52 257.006 369.183]
+/A << /S /GoTo /D (subsubsection.6.1.2.165) >>
+>>
+endobj
+2558 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 342.876 275.898 352.539]
+/A << /S /GoTo /D (subsubsection.6.1.2.166) >>
+>>
+endobj
+2559 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 326.231 268.375 335.894]
+/A << /S /GoTo /D (subsubsection.6.1.2.167) >>
+>>
+endobj
+2560 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 309.587 279.395 319.25]
+/A << /S /GoTo /D (subsubsection.6.1.2.168) >>
+>>
+endobj
+2561 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 292.942 249.367 302.605]
+/A << /S /GoTo /D (subsubsection.6.1.2.169) >>
+>>
+endobj
+2562 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 276.298 276.131 285.961]
+/A << /S /GoTo /D (subsubsection.6.1.2.170) >>
+>>
+endobj
+2563 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 259.653 304.572 269.316]
+/A << /S /GoTo /D (subsubsection.6.1.2.171) >>
+>>
+endobj
+2564 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 243.009 284.595 252.672]
+/A << /S /GoTo /D (subsubsection.6.1.2.172) >>
+>>
+endobj
+2565 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 226.364 269.648 236.027]
+/A << /S /GoTo /D (subsubsection.6.1.2.173) >>
+>>
+endobj
+2566 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 209.72 278.623 219.383]
+/A << /S /GoTo /D (subsubsection.6.1.2.174) >>
+>>
+endobj
+2567 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 193.075 240.042 202.738]
+/A << /S /GoTo /D (subsubsection.6.1.2.175) >>
+>>
+endobj
+2568 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 176.431 246.237 186.094]
+/A << /S /GoTo /D (subsubsection.6.1.2.176) >>
+>>
+endobj
+2569 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 159.786 314.892 169.449]
+/A << /S /GoTo /D (subsubsection.6.1.2.177) >>
+>>
+endobj
+2570 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 143.141 310.965 152.805]
+/A << /S /GoTo /D (subsubsection.6.1.2.178) >>
+>>
+endobj
+2571 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 126.497 222.961 136.16]
+/A << /S /GoTo /D (subsubsection.6.1.2.179) >>
+>>
+endobj
+2572 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 109.852 222.333 119.516]
+/A << /S /GoTo /D (subsubsection.6.1.2.180) >>
+>>
+endobj
+2573 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 93.208 218.845 102.871]
+/A << /S /GoTo /D (subsubsection.6.1.2.181) >>
+>>
+endobj
+2574 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 76.563 231.524 86.227]
+/A << /S /GoTo /D (subsubsection.6.1.2.182) >>
+>>
+endobj
+2576 0 obj
+<<
+/Font << /F50 2307 0 R /F43 2258 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+2623 0 obj
+<<
+/Length 1127      
+/Filter /FlateDecode
+>>
+stream
+xÚí›]sâ6†ïùºÄ¨ú–}¹ÈdwÛ¡@ÛÙÉî0ŽÑOÃ'mþ}elcð±’Nƒ.>b„òèÕ9ï9¶X.;ýYç§GÀ†Ž̾‰ -��ƒÙ\w}ß·¾Í>v†³Î�ÖDï´mh¼ûÎõ7úo
‚Ô±Á_Û#ï
ãrFõó;0íüÚAé—'ã„ËtÀI:}d>Ìä¶
¤ÀeC±M­‘vwòÁâ¨ûÇ|ü[ÿóÕ`þiøe;ÛìkÀuOb»­ç<yÏ¿m?ð_­)±.—é¿]¤
+zC[RÐÃ
+Æsˆ)À™…	ê>­ÕB}OÞ¹Xy÷*ˆÜÈ_Eš\ÐwƯõÐÏ?àÍöxCœð½±bà‘*¢”œ-Ó“ÑGB‡$
¿ñ—�]¤î0ƒûå¸tNsÜXySÞ§•7ËySbx¿º¾yÎ[0ÃûÕõ-ÞAµÂÆ
ã2c»•¦å>㲪
ãvŒ{œAi“¢šS#ÝmðœÂÛ2ejàköæû�îVi~ó!r£,¬ºMÞùw*­=uÅDQW…*ðÊnž3³u‹!hÝbä÷Í®vºP‘«ù/²W/ÔCò®¿®*VE~øå��E¬Ÿ]/\eÐã=ø[àÏ70B蜙V·_hÜÃJè�/§óþç)&ÔÆ¥„à8gšZÛ‰4“éxTÏ’RzÞn¥i¯N¤i&=^ãí~4ï	
+ÊòÝe·þèª?œæÃ_“¸±ýe<ûŠ8Ò?±Á>Ï�¿¯Ïlãçä.†gKŽ5«FvÊcu>·x…šzäôa‚5Ö9Ï×ÉSÚï2Ô�æÞ­ë­knØÇìy£òc·Q¸)?Þ~YøYx7ä$€«mÏkïVyñÙÉ?§qœÑò}´×Ád�…�Aujó*!ïÙ>óÆ	Ï+’¥Šw¾ë8�[¢n¤>Yš§Úž
+Ž¹Á¢dŒ‘üÿ±-¥âXÊ+ÙiœÈKâ…h,lY±,›ÓÅf=ê×C¶kŽJãNÞ~y3wrRÀÕîDæîDçÒ©¿œ¨~¨bÄ›º$I¤s>m½†—þíé6mëýnIm<Òán/KË¢÷Q3s
`BÞn+å]§ï>NšOë‚',¥I‡™VKì!z×!Lˆï\KéìƦÇõbðRO£ŒçîYÅbň„ÁÝwM?×>âÎK‘E¹¿]>(ígo©¶í�y¨¼GËF­+)äöGÙW·tS4�¾Ó\ø¦h:)àj‹ïäEÓÚ
7jåE£ˆ¸4	WS–¨�Œ3!o
g÷ôÔV¤ô�_urÔZ¦{¨¯‚¨²$¦^z±¬Y1n¬£ðYàgË·Ò1ÏY‡'Ø&Ê[…µÚaälÁ&ªî>æ"ŠÛÜ|œÝñ, ‘‚Å·3]IqÎô#zÈíR]ª@…n”YÂ$´g6%vâ?-õ,µ#ŠsüUÂ.
+endstream
+endobj
+2622 0 obj
+<<
+/Type /Page
+/Contents 2623 0 R
+/Resources 2621 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2488 0 R
+/Annots [ 2575 0 R 2579 0 R 2580 0 R 2581 0 R 2582 0 R 2583 0 R 2584 0 R 2585 0 R 2586 0 R 2587 0 R 2588 0 R 2589 0 R 2590 0 R 2591 0 R 2592 0 R 2593 0 R 2594 0 R 2595 0 R 2596 0 R 2597 0 R 2598 0 R 2599 0 R 2600 0 R 2601 0 R 2602 0 R 2603 0 R 2604 0 R 2605 0 R 2606 0 R 2607 0 R 2608 0 R 2609 0 R 2610 0 R 2611 0 R 2612 0 R 2613 0 R 2614 0 R 2615 0 R 2616 0 R 2617 0 R 2618 0 R 2619 0 R ]
+>>
+endobj
+2575 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 758.989 262.233 768.652]
+/A << /S /GoTo /D (subsubsection.6.1.2.183) >>
+>>
+endobj
+2579 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [107.719 741.533 226.254 752.007]
+/A << /S /GoTo /D (subsection.6.1.3) >>
+>>
+endobj
+2580 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 724.888 188.262 735.157]
+/A << /S /GoTo /D (subsubsection.6.1.3.1) >>
+>>
+endobj
+2581 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 708.136 192.924 718.512]
+/A << /S /GoTo /D (subsubsection.6.1.3.2) >>
+>>
+endobj
+2582 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 691.492 197.909 701.868]
+/A << /S /GoTo /D (subsubsection.6.1.3.3) >>
+>>
+endobj
+2583 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 674.847 197.909 685.223]
+/A << /S /GoTo /D (subsubsection.6.1.3.4) >>
+>>
+endobj
+2584 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 658.203 197.909 668.579]
+/A << /S /GoTo /D (subsubsection.6.1.3.5) >>
+>>
+endobj
+2585 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 641.558 207.88 651.934]
+/A << /S /GoTo /D (subsubsection.6.1.3.6) >>
+>>
+endobj
+2586 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 624.914 207.88 635.29]
+/A << /S /GoTo /D (subsubsection.6.1.3.7) >>
+>>
+endobj
+2587 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [84.81 609.188 133.158 618.645]
+/A << /S /GoTo /D (section.6.2) >>
+>>
+endobj
+2588 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [84.81 592.544 203.014 602.207]
+/A << /S /GoTo /D (section.6.3) >>
+>>
+endobj
+2589 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [107.719 575.088 212.5 585.356]
+/A << /S /GoTo /D (subsection.6.3.1) >>
+>>
+endobj
+2590 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [107.719 560.147 259.707 568.918]
+/A << /S /GoTo /D (subsection.6.3.2) >>
+>>
+endobj
+2591 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 542.61 237.289 552.273]
+/A << /S /GoTo /D (subsubsection.6.3.2.1) >>
+>>
+endobj
+2592 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 525.965 235.792 535.629]
+/A << /S /GoTo /D (subsubsection.6.3.2.2) >>
+>>
+endobj
+2593 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [107.719 510.213 229.32 518.778]
+/A << /S /GoTo /D (subsection.6.3.3) >>
+>>
+endobj
+2594 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 491.865 274.669 502.34]
+/A << /S /GoTo /D (subsubsection.6.3.3.1) >>
+>>
+endobj
+2595 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 475.221 274.669 485.695]
+/A << /S /GoTo /D (subsubsection.6.3.3.2) >>
+>>
+endobj
+2596 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [84.81 459.387 142.492 469.051]
+/A << /S /GoTo /D (section.6.4) >>
+>>
+endobj
+2597 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [84.81 442.743 225.429 452.406]
+/A << /S /GoTo /D (section.6.5) >>
+>>
+endobj
+2598 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [107.719 425.287 212.5 435.555]
+/A << /S /GoTo /D (subsection.6.5.1) >>
+>>
+endobj
+2599 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [107.719 410.346 229.32 418.911]
+/A << /S /GoTo /D (subsection.6.5.2) >>
+>>
+endobj
+2600 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 391.998 267.873 402.472]
+/A << /S /GoTo /D (subsubsection.6.5.2.1) >>
+>>
+endobj
+2601 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 375.246 311.063 385.828]
+/A << /S /GoTo /D (subsubsection.6.5.2.2) >>
+>>
+endobj
+2602 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [84.81 359.52 164.907 368.977]
+/A << /S /GoTo /D (section.6.6) >>
+>>
+endobj
+2603 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [84.81 342.876 203.363 352.539]
+/A << /S /GoTo /D (section.6.7) >>
+>>
+endobj
+2604 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [107.719 325.42 212.5 335.688]
+/A << /S /GoTo /D (subsection.6.7.1) >>
+>>
+endobj
+2605 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [107.719 310.479 229.32 319.044]
+/A << /S /GoTo /D (subsection.6.7.2) >>
+>>
+endobj
+2606 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 292.023 258.691 302.605]
+/A << /S /GoTo /D (subsubsection.6.7.2.1) >>
+>>
+endobj
+2607 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [107.719 277.19 227.15 285.755]
+/A << /S /GoTo /D (subsection.6.7.3) >>
+>>
+endobj
+2608 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 258.842 210.13 269.11]
+/A << /S /GoTo /D (subsubsection.6.7.3.1) >>
+>>
+endobj
+2609 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 242.197 198.618 252.465]
+/A << /S /GoTo /D (subsubsection.6.7.3.2) >>
+>>
+endobj
+2610 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 227.256 200.752 235.821]
+/A << /S /GoTo /D (subsubsection.6.7.3.3) >>
+>>
+endobj
+2611 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [84.81 209.72 142.841 219.176]
+/A << /S /GoTo /D (section.6.8) >>
+>>
+endobj
+2612 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [84.81 193.075 225.842 202.738]
+/A << /S /GoTo /D (section.6.9) >>
+>>
+endobj
+2613 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [107.719 175.619 212.5 185.887]
+/A << /S /GoTo /D (subsection.6.9.1) >>
+>>
+endobj
+2614 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [107.719 160.678 229.32 169.243]
+/A << /S /GoTo /D (subsection.6.9.2) >>
+>>
+endobj
+2615 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 142.33 221.822 152.805]
+/A << /S /GoTo /D (subsubsection.6.9.2.1) >>
+>>
+endobj
+2616 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 125.686 221.141 136.16]
+/A << /S /GoTo /D (subsubsection.6.9.2.2) >>
+>>
+endobj
+2617 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 109.041 209.861 119.516]
+/A << /S /GoTo /D (subsubsection.6.9.2.3) >>
+>>
+endobj
+2618 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 92.396 232.286 102.871]
+/A << /S /GoTo /D (subsubsection.6.9.2.4) >>
+>>
+endobj
+2619 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 75.644 245.278 86.227]
+/A << /S /GoTo /D (subsubsection.6.9.2.5) >>
+>>
+endobj
+2621 0 obj
+<<
+/Font << /F50 2307 0 R /F43 2258 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+2668 0 obj
+<<
+/Length 1190      
+/Filter /FlateDecode
+>>
+stream
+xÚí›[s›8@ßý+x´Ì
+ÝyLÝ8ݶÉxíìe&ít((6S.à6þ÷+n†—ìîÌ6â!ƒIlY9Iߧ0Ö0®F¯nG¿Ì	0¸iSŠŒÛ{ƒXÔ´4˜
Mj·žq7ö&oߎ.oG_G–ü0,ƒ
“Sj0ÎM±ánGw�áÉ¿½5€‰ln|Ïß¹50A&ÁH¾ŒÕè·(¿»('^—.ËÚÈwÖµ±00	磖	ªêÈ
+š²r“)d|¼sâDü¦Q¼ØÁ@€ü±òúV_dÜM)µÇædJ).ôŸÝѳ°ÿºhÉ�,‘´™ËëT>rŠI.kÀ�ÜÔñºñZÀ�h›(nå
¢Ÿ'Œ©HÎQ•Ð�*êå©}ÚÓ]ÿ¥¢Ê0¶ä´@Áñ³ã-E²‹ÂD¨ðÙXÛ.´Ÿš–U0M„øsã¤É�˜ 0~H•CFº‚Åýd…صHW"žL%ÕoHÆ"¾Ýâþ°K…wù�Š0ñ¥ÌÊ®€à—Ë챌HÅl–Ýb0Nÿ˜p0În,2öïjf:Iú‰Utç~è'á©ãR¤O3'ý”%*¨oDD*¢Øfºv£=¥¥G¾³�p³�ô‹ªoð?ÈßuR1Û8~¨B�,ðÓ²£ýÜd5»'Œ–âë^$ÊqžÙø%K¨9%Ød¶U¬BÏ4H>¹�/ÂôS,ÜoÙ`dnžŸ”ÿ(þOE�…ý°ßUÜÚx ‰=ù0ò_Ïý@¯–â>‹hE,BW´Ÿ�l ~š8”i+°Ÿ´Ë,Á¿©#!{Õ]â–AÙ.•Áì“î°Aôv»‡èf™IÌ÷¡›³-ˆGî~+µwNáÆ6ŸŒ,“3tÂkhSáЛÍf+e솙îÝûs$®4v<o‹ÕƉ…÷n"c‘Ï3^ªç¸�´ÆøØRtÄØŠƒoœ­è¢È5p’ƒ~Nâæ~·‹Ê YxWq´ß%4-À€fäkHT.�¬=_ìóõƒÀw�\�“Ùƒ�ÇÅBÉt–‡´ÏAÉ,ô"QZýP²ZO}¬»Ú2µ ¦Cøyª�=oS=Î+tàE@šÚG �¦�ÇF@	 Ú‰
+û‰ZÍ×H°ï7]aº6~ØÏÕjÊE2½ž¿ïìO‘Þ™Qo[ëÔh¹ê$K¹ædQOgëli±zwy¢+8îÐaKÎ:G*_³Õê.ŠUf4h©Ô²ÎžÙ¸/¯~¸VN8AÍ·rÜSÙF"E_ü®`
+é;þãžÒÖ9Õ¥SLö‡×NêtÐe€<U–òF' s¤(I߬.²Åª}ºQ'S|ðôŒ§eRå–s(¡mÕsùT×ÖOúÙ
+ËŒÊõw¯ö~*õä(aÖ[i.:åÂ^‹$qÖÊ�­�ÙP¤=å„5ÅW~è‰xÈ ž�¶%(jÚ¹±
ÙÖ@ôŒ¬¸&zT¨Ja!V›3ʬ§·¤¦Ü˜[ý}ç9©P'|àzÆ^ÚîŠÝÃg²èIJøïO�D$ÄÈês±:üHMÈ(ÎŽ–EabRyÉΕE,Å.·cG·ª�Bù‰ŽÃZVR¶‚°]Å¿
ó,wñ
+endstream
+endobj
+2667 0 obj
+<<
+/Type /Page
+/Contents 2668 0 R
+/Resources 2666 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2488 0 R
+/Annots [ 2620 0 R 2624 0 R 2625 0 R 2626 0 R 2627 0 R 2628 0 R 2629 0 R 2630 0 R 2631 0 R 2632 0 R 2633 0 R 2634 0 R 2635 0 R 2636 0 R 2637 0 R 2638 0 R 2639 0 R 2640 0 R 2641 0 R 2642 0 R 2643 0 R 2644 0 R 2645 0 R 2646 0 R 2647 0 R 2648 0 R 2649 0 R 2650 0 R 2651 0 R 2652 0 R 2653 0 R 2654 0 R 2655 0 R 2656 0 R 2657 0 R 2658 0 R 2659 0 R 2660 0 R 2661 0 R 2662 0 R 2663 0 R 2664 0 R ]
+>>
+endobj
+2620 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 758.177 232.779 768.652]
+/A << /S /GoTo /D (subsubsection.6.9.2.6) >>
+>>
+endobj
+2624 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 741.533 244.74 752.007]
+/A << /S /GoTo /D (subsubsection.6.9.2.7) >>
+>>
+endobj
+2625 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 724.888 244.058 735.363]
+/A << /S /GoTo /D (subsubsection.6.9.2.8) >>
+>>
+endobj
+2626 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 708.244 261.184 718.718]
+/A << /S /GoTo /D (subsubsection.6.9.2.9) >>
+>>
+endobj
+2627 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 691.599 237.773 702.074]
+/A << /S /GoTo /D (subsubsection.6.9.2.10) >>
+>>
+endobj
+2628 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 674.955 240.481 685.429]
+/A << /S /GoTo /D (subsubsection.6.9.2.11) >>
+>>
+endobj
+2629 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 658.203 305.853 668.785]
+/A << /S /GoTo /D (subsubsection.6.9.2.12) >>
+>>
+endobj
+2630 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 641.558 260.995 652.14]
+/A << /S /GoTo /D (subsubsection.6.9.2.13) >>
+>>
+endobj
+2631 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 624.914 255.248 635.496]
+/A << /S /GoTo /D (subsubsection.6.9.2.14) >>
+>>
+endobj
+2632 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 608.269 241.79 618.851]
+/A << /S /GoTo /D (subsubsection.6.9.2.15) >>
+>>
+endobj
+2633 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 591.625 310.731 602.207]
+/A << /S /GoTo /D (subsubsection.6.9.2.16) >>
+>>
+endobj
+2634 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 574.98 269.02 585.562]
+/A << /S /GoTo /D (subsubsection.6.9.2.17) >>
+>>
+endobj
+2635 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [84.81 559.255 170.305 568.711]
+/A << /S /GoTo /D (section.6.10) >>
+>>
+endobj
+2636 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [84.81 542.61 234.046 552.273]
+/A << /S /GoTo /D (section.6.11) >>
+>>
+endobj
+2637 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [107.719 525.154 217.485 535.422]
+/A << /S /GoTo /D (subsection.6.11.1) >>
+>>
+endobj
+2638 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [107.719 510.213 234.305 518.778]
+/A << /S /GoTo /D (subsection.6.11.2) >>
+>>
+endobj
+2639 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 491.865 227.292 502.34]
+/A << /S /GoTo /D (subsubsection.6.11.2.1) >>
+>>
+endobj
+2640 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 475.221 268.133 485.695]
+/A << /S /GoTo /D (subsubsection.6.11.2.2) >>
+>>
+endobj
+2641 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 458.576 260.727 469.051]
+/A << /S /GoTo /D (subsubsection.6.11.2.3) >>
+>>
+endobj
+2642 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 441.931 281.492 452.406]
+/A << /S /GoTo /D (subsubsection.6.11.2.4) >>
+>>
+endobj
+2643 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 425.287 280.757 435.761]
+/A << /S /GoTo /D (subsubsection.6.11.2.5) >>
+>>
+endobj
+2644 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 408.642 277.225 419.117]
+/A << /S /GoTo /D (subsubsection.6.11.2.6) >>
+>>
+endobj
+2645 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 391.89 240.759 402.472]
+/A << /S /GoTo /D (subsubsection.6.11.2.7) >>
+>>
+endobj
+2646 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 375.246 258.055 385.828]
+/A << /S /GoTo /D (subsubsection.6.11.2.8) >>
+>>
+endobj
+2647 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 358.709 249.196 369.183]
+/A << /S /GoTo /D (subsubsection.6.11.2.9) >>
+>>
+endobj
+2648 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 342.064 238.768 352.539]
+/A << /S /GoTo /D (subsubsection.6.11.2.10) >>
+>>
+endobj
+2649 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 325.42 233.281 335.894]
+/A << /S /GoTo /D (subsubsection.6.11.2.11) >>
+>>
+endobj
+2650 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 308.775 232.788 319.25]
+/A << /S /GoTo /D (subsubsection.6.11.2.12) >>
+>>
+endobj
+2651 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 292.131 260.198 302.605]
+/A << /S /GoTo /D (subsubsection.6.11.2.13) >>
+>>
+endobj
+2652 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 275.486 245.027 285.961]
+/A << /S /GoTo /D (subsubsection.6.11.2.14) >>
+>>
+endobj
+2653 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 258.734 234.931 269.316]
+/A << /S /GoTo /D (subsubsection.6.11.2.15) >>
+>>
+endobj
+2654 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 242.197 243.252 252.672]
+/A << /S /GoTo /D (subsubsection.6.11.2.16) >>
+>>
+endobj
+2655 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 225.553 254.845 236.027]
+/A << /S /GoTo /D (subsubsection.6.11.2.17) >>
+>>
+endobj
+2656 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 208.908 250.514 219.383]
+/A << /S /GoTo /D (subsubsection.6.11.2.18) >>
+>>
+endobj
+2657 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 192.264 242.247 202.738]
+/A << /S /GoTo /D (subsubsection.6.11.2.19) >>
+>>
+endobj
+2658 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 175.619 236.769 186.094]
+/A << /S /GoTo /D (subsubsection.6.11.2.20) >>
+>>
+endobj
+2659 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 158.867 266.169 169.449]
+/A << /S /GoTo /D (subsubsection.6.11.2.21) >>
+>>
+endobj
+2660 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 142.33 232.788 152.805]
+/A << /S /GoTo /D (subsubsection.6.11.2.22) >>
+>>
+endobj
+2661 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 125.686 250.218 136.16]
+/A << /S /GoTo /D (subsubsection.6.11.2.23) >>
+>>
+endobj
+2662 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 109.041 225.669 119.516]
+/A << /S /GoTo /D (subsubsection.6.11.2.24) >>
+>>
+endobj
+2663 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 92.396 250.694 102.871]
+/A << /S /GoTo /D (subsubsection.6.11.2.25) >>
+>>
+endobj
+2664 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 75.752 253.706 86.227]
+/A << /S /GoTo /D (subsubsection.6.11.2.26) >>
+>>
+endobj
+2666 0 obj
+<<
+/Font << /F50 2307 0 R /F43 2258 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+2713 0 obj
+<<
+/Length 1172      
+/Filter /FlateDecode
+>>
+stream
+xÚí›M“Ú6€ïü
+íª¾%[Âf›t&ÍB{Ùdv\[€'ÆP0Iø÷•¿`
V;»“û°k<€±=–ÞWz
�©�·½ßƽ_nt$ð9'Îxâ$çŽð1àÈGνûÝû<~׎{ÿö�þtÐîSR‰©Î{÷Ÿ¡é÷Þ9_:ߊOÎÊ`”è׉3ê}ìÁê—Ë㬦Õ
ïªsÑŸÜŸ¢0)Á€õÙp€À¯�…t×*�I¬Òl V^ŸB7‹?AˆÃ SƒY§Ÿ ƒúQÿºsßgH¸Àë3ÆÊ
?Ø°WØ{ùCk@Ô•²º´c zÛGpÊÉI#¹¿=	Ý|17žlMèõàEÿxžô�§¿ç9L£“aPL¶o‚,0A¤’µâ¡”–ƒ¤vña²ZÌÂ`³VF„ý4WýÚ@}hÚg‰OÜÄ%Ñ,Y?„Åmþ�
+fÇ9ôÿ~¦C_h’SÇɾ1¾xXw²ù¿­n™ 	u“oÞĉ*_Ý©‰GòžX¥¡:±âŽ™ðc|èŸÜ ï•šuTï­ÃjÈ[fñ"=í è¬„[XªNèf“†Û’ø"ÜÌu‡4ᦾì7&HA¼ÆµÙqgcé¾eå!èé#µoƒõÌ4’J=â¶f$µ¸V¸ä¸IÓ8�žCÉj[8Ž–|ÉÓãçœ/iæûûa":´OS—Vh‹hã[œFf¨œÐ«îZ_Ybf’xÏÞ˜MKzÍ ©�²¼
+”íÆ/Îi[E¥v¢ŠSQGÛ4›©,Ïf¸³tGQîí�F©sµí2[i¦òÄí{fˆ%ì=oh5�¶YFù®]!¼f’ÌÎRkMÕÊ.;šBø-Ãw”SUI•†gm¢À¤qO?&9ʬhJé_	8n© yîN…_íÀù”·Ü‘q»Ô'\x:ÒùêaæªÕŸ£÷ÆÅ‚ZžòØ"®rž¨^0,ïW¿FJk›­/ÆìW
UXÞð¼êúî_]â)dÇóDRÑÈó6H£õ,(—b.p¥Èo·’²á¯Ëe‡Åþ€Œóë(-ô
þU$8Ñ{�î–�
+Â6t•ÒÎK\e7áL…9¾/‡Õ+åê¹
+.p{wßrÑ5:k‹˜1Ô!6ù‹�ü©2¶¯bÕ檬¼¶M­Œñ¾íÖö _:WÝvž#áèÊ•TºZÑóu+'5mÝ"Ò3}¡}Nugû–IÓ©öšAײ”ˆt­ÐÔ
+¶…E¬+,z	ìu¬+,zIÀ†Â"¶/,šç“hÛe¥sšMÌK0ÌïÆ€g[]{­»ts½lŸÀ/NýÐr²£~„ߪ$Y˜³ÒV¾ÄÎjºã;ŽËd§&3sµAHZá>Ô™ípÓpø„塶ó¥v:óß]ri~ÌLvýó3€
+-N�—±¶qÊTø¼ílKMÏm2 A6�mÖŠr€§ùÙ”QÀÕ[Àõ!‹Öz«RµÊ'µËæú§˜,¨Cób¥z;Õ¤îùÓãsüu¾m
+endstream
+endobj
+2712 0 obj
+<<
+/Type /Page
+/Contents 2713 0 R
+/Resources 2711 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2488 0 R
+/Annots [ 2665 0 R 2669 0 R 2670 0 R 2671 0 R 2672 0 R 2673 0 R 2674 0 R 2675 0 R 2676 0 R 2677 0 R 2678 0 R 2679 0 R 2680 0 R 2681 0 R 2682 0 R 2683 0 R 2684 0 R 2685 0 R 2686 0 R 2687 0 R 2688 0 R 2689 0 R 2690 0 R 2691 0 R 2692 0 R 2693 0 R 2694 0 R 2695 0 R 2696 0 R 2697 0 R 2698 0 R 2699 0 R 2700 0 R 2701 0 R 2702 0 R 2703 0 R 2704 0 R 2705 0 R 2706 0 R 2707 0 R 2708 0 R 2709 0 R ]
+>>
+endobj
+2665 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 758.177 293.928 768.652]
+/A << /S /GoTo /D (subsubsection.6.11.2.27) >>
+>>
+endobj
+2669 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 741.533 269.424 752.007]
+/A << /S /GoTo /D (subsubsection.6.11.2.28) >>
+>>
+endobj
+2670 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 724.888 271.791 735.363]
+/A << /S /GoTo /D (subsubsection.6.11.2.29) >>
+>>
+endobj
+2671 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 708.244 257.059 718.718]
+/A << /S /GoTo /D (subsubsection.6.11.2.30) >>
+>>
+endobj
+2672 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [84.81 692.411 173.524 701.868]
+/A << /S /GoTo /D (section.6.12) >>
+>>
+endobj
+2673 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [84.81 674.955 227.698 685.429]
+/A << /S /GoTo /D (section.6.13) >>
+>>
+endobj
+2674 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [107.719 658.31 217.485 668.579]
+/A << /S /GoTo /D (subsection.6.13.1) >>
+>>
+endobj
+2675 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [107.719 643.369 234.305 651.934]
+/A << /S /GoTo /D (subsection.6.13.2) >>
+>>
+endobj
+2676 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 625.021 253.661 635.496]
+/A << /S /GoTo /D (subsubsection.6.13.2.1) >>
+>>
+endobj
+2677 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 608.269 233.415 618.851]
+/A << /S /GoTo /D (subsubsection.6.13.2.2) >>
+>>
+endobj
+2678 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 591.625 242.884 602.207]
+/A << /S /GoTo /D (subsubsection.6.13.2.3) >>
+>>
+endobj
+2679 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 575.088 218.146 585.562]
+/A << /S /GoTo /D (subsubsection.6.13.2.4) >>
+>>
+endobj
+2680 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 558.335 269.11 568.918]
+/A << /S /GoTo /D (subsubsection.6.13.2.5) >>
+>>
+endobj
+2681 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 541.799 240.293 552.273]
+/A << /S /GoTo /D (subsubsection.6.13.2.6) >>
+>>
+endobj
+2682 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 525.046 270.293 535.629]
+/A << /S /GoTo /D (subsubsection.6.13.2.7) >>
+>>
+endobj
+2683 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 508.51 251.213 518.984]
+/A << /S /GoTo /D (subsubsection.6.13.2.8) >>
+>>
+endobj
+2684 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 491.865 267.173 502.34]
+/A << /S /GoTo /D (subsubsection.6.13.2.9) >>
+>>
+endobj
+2685 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 475.221 284.101 485.695]
+/A << /S /GoTo /D (subsubsection.6.13.2.10) >>
+>>
+endobj
+2686 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 458.576 269.657 469.051]
+/A << /S /GoTo /D (subsubsection.6.13.2.11) >>
+>>
+endobj
+2687 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 441.931 290.593 452.406]
+/A << /S /GoTo /D (subsubsection.6.13.2.12) >>
+>>
+endobj
+2688 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 425.287 290.082 435.761]
+/A << /S /GoTo /D (subsubsection.6.13.2.13) >>
+>>
+endobj
+2689 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 408.642 234.913 419.117]
+/A << /S /GoTo /D (subsubsection.6.13.2.14) >>
+>>
+endobj
+2690 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 391.998 262.717 402.472]
+/A << /S /GoTo /D (subsubsection.6.13.2.15) >>
+>>
+endobj
+2691 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 375.353 262.591 385.828]
+/A << /S /GoTo /D (subsubsection.6.13.2.16) >>
+>>
+endobj
+2692 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 358.709 287.329 369.183]
+/A << /S /GoTo /D (subsubsection.6.13.2.17) >>
+>>
+endobj
+2693 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 342.064 286.011 352.539]
+/A << /S /GoTo /D (subsubsection.6.13.2.18) >>
+>>
+endobj
+2694 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 325.42 265.048 335.894]
+/A << /S /GoTo /D (subsubsection.6.13.2.19) >>
+>>
+endobj
+2695 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 308.775 255.168 319.25]
+/A << /S /GoTo /D (subsubsection.6.13.2.20) >>
+>>
+endobj
+2696 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 292.131 256.252 302.605]
+/A << /S /GoTo /D (subsubsection.6.13.2.21) >>
+>>
+endobj
+2697 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 275.486 282.237 285.961]
+/A << /S /GoTo /D (subsubsection.6.13.2.22) >>
+>>
+endobj
+2698 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 258.842 280.38 269.316]
+/A << /S /GoTo /D (subsubsection.6.13.2.23) >>
+>>
+endobj
+2699 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [84.81 242.197 167.176 252.465]
+/A << /S /GoTo /D (section.6.14) >>
+>>
+endobj
+2700 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [84.81 225.445 213.163 236.027]
+/A << /S /GoTo /D (section.6.15) >>
+>>
+endobj
+2701 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [107.719 208.908 217.485 219.176]
+/A << /S /GoTo /D (subsection.6.15.1) >>
+>>
+endobj
+2702 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [107.719 193.967 234.305 202.532]
+/A << /S /GoTo /D (subsection.6.15.2) >>
+>>
+endobj
+2703 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 175.619 214.335 186.094]
+/A << /S /GoTo /D (subsubsection.6.15.2.1) >>
+>>
+endobj
+2704 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 158.867 194.412 169.449]
+/A << /S /GoTo /D (subsubsection.6.15.2.2) >>
+>>
+endobj
+2705 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 142.222 241.288 152.805]
+/A << /S /GoTo /D (subsubsection.6.15.2.3) >>
+>>
+endobj
+2706 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 125.578 217.967 136.16]
+/A << /S /GoTo /D (subsubsection.6.15.2.4) >>
+>>
+endobj
+2707 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 108.933 222.817 119.516]
+/A << /S /GoTo /D (subsubsection.6.15.2.5) >>
+>>
+endobj
+2708 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 92.289 211.708 102.871]
+/A << /S /GoTo /D (subsubsection.6.15.2.6) >>
+>>
+endobj
+2709 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 75.644 239.109 86.227]
+/A << /S /GoTo /D (subsubsection.6.15.2.7) >>
+>>
+endobj
+2711 0 obj
+<<
+/Font << /F50 2307 0 R /F43 2258 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+2758 0 obj
+<<
+/Length 1088      
+/Filter /FlateDecode
+>>
+stream
+xÚí›MsÚ8Çï|
+á€W²Þ�-%�íîì¶	—�l‡qŒ žÛµM7ùö+;ŒeÓiStÈ#”ßó×ó¢Ç‚`
 xß{;éýrE!ždƒÉPÄ<‰}À¥ï1&3pÛˆŸ'zãIïKéÏA€‡ž`p!<á®z·Ÿ!˜é¿}ÐÃR€«;W€PìQ‚õë%¸é}êÁú»7ãd‹zÀëz6úÎv6ˆ@�
+
8Cl¦Ã<D=߃¡ÏE™,nT6bØÿ:ði_e×*O“8WC
+õª&ß|+¸
+}«7RJ7vú³ýÀ÷ZÑG�Öÿö>d}j3BwhÊ'šo–%Nû…	 ¦èbùþÄÉqŸ��¢ô^e7ë¨8"Zꀗ0BO@hýª�û�ã‡ð>ˆF°\øŽ¨I¢~ëc#í&ˆŒ	çJÀÌxH‰§¥Ö.Û.–ùTS^h×KutºßL0½h~¤¡O˜©»xk $,‚Y>@´4PõÛ«h©6¯®Õ| ó
+•©8TûÖ“‚;üçà÷u"eg‘p¯víïThä³æ]êTEÛ#J‹(‰;®:ìÛع…ê½Úõ_­ã°b»!ž„ë•Š‹àn"Å…&Ày‚ãºöe¯¢å2Ê�IŠÏœû·Ç~P×�²ÿM¦Ašªx6�bs­ƒ‰ãiλKž¸Ã³
+”Æ\!Çp_“¤e&«4ÈŒõ
+¥âR×¹´Ó%m™æ÷Ѽ˜.Õ¼0{Xâ°ž%UÖbýG­“uµRÏ/o)ϳd5½Weyñ`S^(Xíä+:Ñ*/ê""6îoPÉÉ}‰ÊÉ»jÇͼ‰‰)vº4è²Ù>€ÓXHF~f‚ÈN�Íþï“ϼrň9‘º„5�,U¸UeUÈ©›jævCøRC�­@·*¥:æ¬ã00ûK�5õÔ�Ò)-%ûhô—œ_vª—·�;ت¡’u‘®‹S‰(#ÈÑ4I•uhºÜó™Âä”Ç£=³(�^!>lÛw†¶V'1鶜ÿkÀl ®¾ekšôKt§žÑpd”8#t�@,ûŽÒõ¿)öÚw}Ç—lè;ʶïøñÓ¯oÇÓÑèÍtüÇèº|øä¯�c=‚ ø¹â¦�4q¶ÐÞ�/µL6|x8¢í»ML]“ûåœÂùÏúùhË>YR$a²´L80Cþ9ðg>r™ÆK`gšw™ÆK>œi””eO~¿AxšÁ‰Ó\Òߤ³Sq£ã
_¼)or­xÍ—Ÿ½mWñÅ»úMRã
	Yå’m²aÇ*4ºI¨Ãy\¨tG¨G<
Cþ…UØ	•m“ÍTøÕì�#»…äЙQJ=ˆ‘Í‘Ñ昪¶g¤<ZE¨Çô¥2Õ{«,(šÔyóðD“ÔU=«Ç…N¥uïOñ?ê³³F
+endstream
+endobj
+2757 0 obj
+<<
+/Type /Page
+/Contents 2758 0 R
+/Resources 2756 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2759 0 R
+/Annots [ 2710 0 R 2714 0 R 2715 0 R 2716 0 R 2717 0 R 2718 0 R 2719 0 R 2720 0 R 2721 0 R 2722 0 R 2723 0 R 2724 0 R 2725 0 R 2726 0 R 2727 0 R 2728 0 R 2729 0 R 2730 0 R 2731 0 R 2732 0 R 2733 0 R 2734 0 R 2735 0 R 2736 0 R 2737 0 R 2738 0 R 2739 0 R 2740 0 R 2741 0 R 2742 0 R 2743 0 R 2744 0 R 2745 0 R 2746 0 R 2747 0 R 2748 0 R 2749 0 R 2750 0 R 2751 0 R 2752 0 R 2753 0 R 2754 0 R ]
+>>
+endobj
+2710 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 758.07 261.229 768.652]
+/A << /S /GoTo /D (subsubsection.6.15.2.8) >>
+>>
+endobj
+2714 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 741.425 213.205 752.007]
+/A << /S /GoTo /D (subsubsection.6.15.2.9) >>
+>>
+endobj
+2715 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 724.781 246.237 735.363]
+/A << /S /GoTo /D (subsubsection.6.15.2.10) >>
+>>
+endobj
+2716 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 708.136 254.181 718.718]
+/A << /S /GoTo /D (subsubsection.6.15.2.11) >>
+>>
+endobj
+2717 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 691.492 225.31 702.074]
+/A << /S /GoTo /D (subsubsection.6.15.2.12) >>
+>>
+endobj
+2718 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [84.81 674.847 152.641 685.223]
+/A << /S /GoTo /D (section.6.16) >>
+>>
+endobj
+2719 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [84.81 659.122 214.975 668.785]
+/A << /S /GoTo /D (section.6.17) >>
+>>
+endobj
+2720 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [107.719 641.666 217.485 651.934]
+/A << /S /GoTo /D (subsection.6.17.1) >>
+>>
+endobj
+2721 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [107.719 626.725 234.305 635.29]
+/A << /S /GoTo /D (subsection.6.17.2) >>
+>>
+endobj
+2722 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 608.377 202.366 618.851]
+/A << /S /GoTo /D (subsubsection.6.17.2.1) >>
+>>
+endobj
+2723 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 591.732 250.729 602.207]
+/A << /S /GoTo /D (subsubsection.6.17.2.2) >>
+>>
+endobj
+2724 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 575.088 263.192 585.562]
+/A << /S /GoTo /D (subsubsection.6.17.2.3) >>
+>>
+endobj
+2725 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 558.443 241.243 568.918]
+/A << /S /GoTo /D (subsubsection.6.17.2.4) >>
+>>
+endobj
+2726 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 541.799 239.754 552.273]
+/A << /S /GoTo /D (subsubsection.6.17.2.5) >>
+>>
+endobj
+2727 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 525.154 216.819 535.629]
+/A << /S /GoTo /D (subsubsection.6.17.2.6) >>
+>>
+endobj
+2728 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 508.51 243.467 518.984]
+/A << /S /GoTo /D (subsubsection.6.17.2.7) >>
+>>
+endobj
+2729 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 491.757 263.318 502.34]
+/A << /S /GoTo /D (subsubsection.6.17.2.8) >>
+>>
+endobj
+2730 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 475.221 258.028 485.695]
+/A << /S /GoTo /D (subsubsection.6.17.2.9) >>
+>>
+endobj
+2731 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 458.576 267.496 469.051]
+/A << /S /GoTo /D (subsubsection.6.17.2.10) >>
+>>
+endobj
+2732 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 441.931 263.677 452.406]
+/A << /S /GoTo /D (subsubsection.6.17.2.11) >>
+>>
+endobj
+2733 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 425.287 240.75 435.761]
+/A << /S /GoTo /D (subsubsection.6.17.2.12) >>
+>>
+endobj
+2734 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 408.642 243.879 419.117]
+/A << /S /GoTo /D (subsubsection.6.17.2.13) >>
+>>
+endobj
+2735 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 391.998 230.018 402.472]
+/A << /S /GoTo /D (subsubsection.6.17.2.14) >>
+>>
+endobj
+2736 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 375.353 255.446 385.828]
+/A << /S /GoTo /D (subsubsection.6.17.2.15) >>
+>>
+endobj
+2737 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 358.601 263.318 369.183]
+/A << /S /GoTo /D (subsubsection.6.17.2.16) >>
+>>
+endobj
+2738 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 342.064 270.67 352.539]
+/A << /S /GoTo /D (subsubsection.6.17.2.17) >>
+>>
+endobj
+2739 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [84.81 326.231 154.453 335.688]
+/A << /S /GoTo /D (section.6.18) >>
+>>
+endobj
+2740 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [84.81 308.775 210.491 319.25]
+/A << /S /GoTo /D (section.6.19) >>
+>>
+endobj
+2741 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [107.719 292.131 217.485 302.399]
+/A << /S /GoTo /D (subsection.6.19.1) >>
+>>
+endobj
+2742 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [107.719 277.19 234.305 285.755]
+/A << /S /GoTo /D (subsection.6.19.2) >>
+>>
+endobj
+2743 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 258.842 281.152 269.316]
+/A << /S /GoTo /D (subsubsection.6.19.2.1) >>
+>>
+endobj
+2744 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 242.197 281.152 252.672]
+/A << /S /GoTo /D (subsubsection.6.19.2.2) >>
+>>
+endobj
+2745 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [84.81 225.553 149.97 235.821]
+/A << /S /GoTo /D (section.6.20) >>
+>>
+endobj
+2746 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [84.81 208.908 220.587 219.383]
+/A << /S /GoTo /D (section.6.21) >>
+>>
+endobj
+2747 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [107.719 192.264 217.485 202.532]
+/A << /S /GoTo /D (subsection.6.21.1) >>
+>>
+endobj
+2748 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [107.719 177.323 234.305 185.887]
+/A << /S /GoTo /D (subsection.6.21.2) >>
+>>
+endobj
+2749 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 158.975 231.649 169.449]
+/A << /S /GoTo /D (subsubsection.6.21.2.1) >>
+>>
+endobj
+2750 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 142.33 228.807 152.805]
+/A << /S /GoTo /D (subsubsection.6.21.2.2) >>
+>>
+endobj
+2751 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 125.686 230.797 136.16]
+/A << /S /GoTo /D (subsubsection.6.21.2.3) >>
+>>
+endobj
+2752 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 109.041 245.251 119.516]
+/A << /S /GoTo /D (subsubsection.6.21.2.4) >>
+>>
+endobj
+2753 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 92.396 233.29 102.871]
+/A << /S /GoTo /D (subsubsection.6.21.2.5) >>
+>>
+endobj
+2754 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 75.752 230.789 86.227]
+/A << /S /GoTo /D (subsubsection.6.21.2.6) >>
+>>
+endobj
+2756 0 obj
+<<
+/Font << /F50 2307 0 R /F43 2258 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+2804 0 obj
+<<
+/Length 1115      
+/Filter /FlateDecode
+>>
+stream
+xÚí›Ms›8€ïþ:šƒµúäØn“N»™m·öì%íd((6SŒ½ Ï&ÿ¾`ŒùˆåZÝtf[tH"3Ïû é•^X^O^.&¿]3$8'`q‚’s r1¸�>$‰÷iñvrµ˜ü3Áåÿ!€�×I	¥OA´žÜ~B .ÿö H	þÝ_¹”È()�S0Ÿü5A‡ï®ÛÉ—‡?²½LdRÁ1DÍýpècèCáÍ|!§‹›9&wQªÂì#b¨üÁû»m¾ÜÎH€¦Ð›1ÆêþßÎøs6ö£›–TN1–$Câ`Æ(Ò3Ì!§ìدáê´¸Û潉6)\
¹RJ~B"ÿ§¦ëè¦è C\è1.¤�KV!ÙŸ^'©ª�>¨{� ©ÊU©a¼A\ì£àû0@Á“G„@\3¥tX nΊ(÷f˜M“­N6Ù0	‡½Åî#ùá¡[ºÞeÑžmM|íÖ*Óá)Ü4�ðiÀC)È	¯ýÆìù‹›»,\+ÓÀÊ{—_3ÆV7Wx£d»Rya"Ì1qhÏ£í›KZ´K£i¾Ùm�t…]qiK·H–…yÂ�ÝŒ°CÙ·s˜õ(ÿ®ÊéESmÄpß‘½È_Þ’M²Dß$Ÿ¿™3:w­Ü-a•ÅgKBGN–ع+[²«°X-¼rj7}Ü*³ÁÒ‘½ÈÙ OöFefi‰cz‘­µPCÆx妼JÙÔÌ—±À5XŠqŸhÝ
„Ë389Nj)h'	Ë«L!ÌâÍúå£>Ó¡:šF9É)šï"ÆÆg�;ŽO­ìdX«/ñýÕƒ®qFÚœÄÊñhÉ,µdCœÛRLI:¦œYŠÙI�Vë02Ï�ØȧõÜRQÑŸ}þ¹KS\Œ˜p<¿Ás�'½)ó|óü;K/{ü9Òû|©¢x‘×£Sµçøh\ž’¿;ag¤�úìÞíôvwÆI4…å¾É ºÊª­Öʽ­‘g �ùDI¿ò•º$f#)-�ìî7©LÕÝ¡V�åŽ÷Õa˜äF®”Œ“ä@Izšä|æ*ž—‚*s
+DÐÏN+°ô®“Øè´˜'Ë,Ô»\ýíɪú§®?¹7É£_Ò¹ÀÒ9~š¢¹Þa<c3A—Õ¶^ÒamÚÓì…�¯çG×÷t¹ó¬¡MT�N_ª_J^5¸ÛU2I\:qÀÕ¶�sõƒÏ�Ýbš¹úÁçÜ«ìz}¬,”ŽÒ¤DÛô6Æ�UÈq¯Zj܈¼TúM�_Äq®
+c…%#‚Xl_³¶Œ°PY|v‹cß•	]Ä·ï/mùž)·"psÃï—˜;‰j[Û\ëSG¹C™Ú©ÌÛ®8Ó˜›÷n�+ŠµÂÜ—Yt1ûÔa¶Ä\:õ'cló
+góÚhÁiõ¢&e2FËOÈË&÷�{]­â…ºIl>ïWC›)w•W><.ËD§Ì/³á=~9~š}
+endstream
+endobj
+2803 0 obj
+<<
+/Type /Page
+/Contents 2804 0 R
+/Resources 2802 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2759 0 R
+/Annots [ 2755 0 R 2760 0 R 2761 0 R 2762 0 R 2763 0 R 2764 0 R 2765 0 R 2766 0 R 2767 0 R 2768 0 R 2769 0 R 2770 0 R 2771 0 R 2772 0 R 2773 0 R 2774 0 R 2775 0 R 2776 0 R 2777 0 R 2778 0 R 2779 0 R 2780 0 R 2781 0 R 2782 0 R 2783 0 R 2784 0 R 2785 0 R 2786 0 R 2787 0 R 2788 0 R 2789 0 R 2790 0 R 2791 0 R 2792 0 R 2793 0 R 2794 0 R 2795 0 R 2796 0 R 2797 0 R 2798 0 R 2799 0 R 2800 0 R ]
+>>
+endobj
+2755 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 758.177 235.281 768.652]
+/A << /S /GoTo /D (subsubsection.6.21.2.7) >>
+>>
+endobj
+2760 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [84.81 741.533 160.065 751.801]
+/A << /S /GoTo /D (section.6.22) >>
+>>
+endobj
+2761 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [84.81 725.7 200.153 735.363]
+/A << /S /GoTo /D (section.6.23) >>
+>>
+endobj
+2762 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [107.719 708.244 217.485 718.512]
+/A << /S /GoTo /D (subsection.6.23.1) >>
+>>
+endobj
+2763 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [107.719 693.303 234.305 701.868]
+/A << /S /GoTo /D (subsection.6.23.2) >>
+>>
+endobj
+2764 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 674.955 226.807 685.429]
+/A << /S /GoTo /D (subsubsection.6.23.2.1) >>
+>>
+endobj
+2765 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 658.31 233.281 668.785]
+/A << /S /GoTo /D (subsubsection.6.23.2.2) >>
+>>
+endobj
+2766 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 641.558 231.703 652.14]
+/A << /S /GoTo /D (subsubsection.6.23.2.3) >>
+>>
+endobj
+2767 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 624.914 220.325 635.496]
+/A << /S /GoTo /D (subsubsection.6.23.2.4) >>
+>>
+endobj
+2768 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 608.269 237.621 618.851]
+/A << /S /GoTo /D (subsubsection.6.23.2.5) >>
+>>
+endobj
+2769 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 591.732 227.803 602.207]
+/A << /S /GoTo /D (subsubsection.6.23.2.6) >>
+>>
+endobj
+2770 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 575.088 231.299 585.562]
+/A << /S /GoTo /D (subsubsection.6.23.2.7) >>
+>>
+endobj
+2771 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 558.443 242.678 568.918]
+/A << /S /GoTo /D (subsubsection.6.23.2.8) >>
+>>
+endobj
+2772 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 541.799 238.777 552.273]
+/A << /S /GoTo /D (subsubsection.6.23.2.9) >>
+>>
+endobj
+2773 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 525.154 256.181 535.629]
+/A << /S /GoTo /D (subsubsection.6.23.2.10) >>
+>>
+endobj
+2774 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 508.402 255.643 518.984]
+/A << /S /GoTo /D (subsubsection.6.23.2.11) >>
+>>
+endobj
+2775 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 491.865 257.615 502.34]
+/A << /S /GoTo /D (subsubsection.6.23.2.12) >>
+>>
+endobj
+2776 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 475.221 263.596 485.695]
+/A << /S /GoTo /D (subsubsection.6.23.2.13) >>
+>>
+endobj
+2777 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 458.576 254.127 469.051]
+/A << /S /GoTo /D (subsubsection.6.23.2.14) >>
+>>
+endobj
+2778 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 441.931 256.719 452.406]
+/A << /S /GoTo /D (subsubsection.6.23.2.15) >>
+>>
+endobj
+2779 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 425.287 231.291 435.761]
+/A << /S /GoTo /D (subsubsection.6.23.2.16) >>
+>>
+endobj
+2780 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 408.642 244.247 419.117]
+/A << /S /GoTo /D (subsubsection.6.23.2.17) >>
+>>
+endobj
+2781 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 391.998 240.768 402.472]
+/A << /S /GoTo /D (subsubsection.6.23.2.18) >>
+>>
+endobj
+2782 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 375.353 282.255 385.828]
+/A << /S /GoTo /D (subsubsection.6.23.2.19) >>
+>>
+endobj
+2783 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 358.709 255.723 369.183]
+/A << /S /GoTo /D (subsubsection.6.23.2.20) >>
+>>
+endobj
+2784 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 342.064 259.973 352.539]
+/A << /S /GoTo /D (subsubsection.6.23.2.21) >>
+>>
+endobj
+2785 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 325.42 260.467 335.894]
+/A << /S /GoTo /D (subsubsection.6.23.2.22) >>
+>>
+endobj
+2786 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 308.668 275.162 319.25]
+/A << /S /GoTo /D (subsubsection.6.23.2.23) >>
+>>
+endobj
+2787 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 292.023 299.487 302.605]
+/A << /S /GoTo /D (subsubsection.6.23.2.24) >>
+>>
+endobj
+2788 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 275.379 279.044 285.961]
+/A << /S /GoTo /D (subsubsection.6.23.2.25) >>
+>>
+endobj
+2789 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 258.734 256.71 269.316]
+/A << /S /GoTo /D (subsubsection.6.23.2.26) >>
+>>
+endobj
+2790 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [84.81 243.009 139.631 252.465]
+/A << /S /GoTo /D (section.6.24) >>
+>>
+endobj
+2791 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [84.81 226.364 218.597 236.027]
+/A << /S /GoTo /D (section.6.25) >>
+>>
+endobj
+2792 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [107.719 208.908 217.485 219.176]
+/A << /S /GoTo /D (subsection.6.25.1) >>
+>>
+endobj
+2793 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [107.719 193.967 234.305 202.532]
+/A << /S /GoTo /D (subsection.6.25.2) >>
+>>
+endobj
+2794 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 175.619 233.595 186.094]
+/A << /S /GoTo /D (subsubsection.6.25.2.1) >>
+>>
+endobj
+2795 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 158.867 234.922 169.449]
+/A << /S /GoTo /D (subsubsection.6.25.2.2) >>
+>>
+endobj
+2796 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 142.33 225.812 152.805]
+/A << /S /GoTo /D (subsubsection.6.25.2.3) >>
+>>
+endobj
+2797 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 125.686 216.846 136.16]
+/A << /S /GoTo /D (subsubsection.6.25.2.4) >>
+>>
+endobj
+2798 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 108.933 217.339 119.516]
+/A << /S /GoTo /D (subsubsection.6.25.2.5) >>
+>>
+endobj
+2799 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 92.289 214.855 102.871]
+/A << /S /GoTo /D (subsubsection.6.25.2.6) >>
+>>
+endobj
+2800 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 75.644 214.855 86.227]
+/A << /S /GoTo /D (subsubsection.6.25.2.7) >>
+>>
+endobj
+2802 0 obj
+<<
+/Font << /F50 2307 0 R /F43 2258 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+2849 0 obj
+<<
+/Length 1081      
+/Filter /FlateDecode
+>>
+stream
+xÚí›[sÚFÇßùûl÷~yl'mfz‰MgÚq2"­©Z,\$ûÛwu	I6KñCÌzÆ,¼,¿ó?—=Z!°¼½™�¾{ÇPPAÁìpŒ¡fHM À`�›ñCǓϳ£ËÙ蟶ÿ‰A%�JAEïF7Ÿˆì¹AªøZ¼ó0N!gÔ>_‚ëÑǪ>½g½¨¼ªæcß¹›fr¥€¢zB	T“)‘j¼0Ù›ÇÌ|BÙ_\Ì´þp3¥�ádʹ(ü^}SC+¦Æ˜òŠÓ¾	ìqŠŒ·Xë-ë_Âl
Áæ\zʇPžr¥"k¶e-JÎÙ2
ÒU8!hüwþ`²t‚í¸î‚{uÿ¯¡�ÝAîL”Å}&*N¿‹—¦|ven'Ôž_›$4�脼9zÌ!‡ÌAl(Bºã6âö[“Í-ù¨~•†ëÉÔš%¾ÏâU²O_"鱂½Ç ©„¾I‚mI|nîL’Íûp3­<à~ÀC%i�®I­ìûù:5³VÀ,yòé7Ç­œô\+:Nâ¬
úb•d&âƒÌQï>Þ¶�i‰×$‘3]Œ$ö\d˪‚¤5H³x¹«Õ`±®$?;Éjׂ\=WííÇ^%Ï(«½xÂÔ‡»‚ÞYêkü	!âXŠ+‡bÐ⹊\ûŠüE±O[Ü·^@Q�ì]éóÃùÒ–bèàbˆâ��8ÒŽqJcéù;ðpìÔ)°cÙ׬ŸæázUãÎc”]pØA`윙¶ºM)o»¿Ûx\^\ìƒ#RûðÞ@Lœd[· {uý}§è§ÌÓu¡ÛÖ.mi÷­×îIµËtýØ©&÷p�—.oÀýá�nÛ
+aO÷xº¢I—pÑYÉPê¹d“+UÌs=�^U“+ÇÄs=�^«ÖÞo×—ÁÏ?^Ïz"Áv—ÏÙ"¥nRÅhÇô‚pŽu'yÙó }bÜhOHBz˜‡)“´ar‚=ÌçaNû·Ø¿R¿Qãt˜[0´nÁ˜0JçA/“„«hpc궗åcÀ¾`ë~Ëed<ÊcÂ)m5Wª]ë	Fãy˜÷U§ûß	áãyf‚òÚvþð8¸Ñ…½2žÜMšì	ž¡±@g¹f÷H#ôšåÉÝäÉÁ9¨E!ÏÇï…›N›½“âKÜo¾ä®½ŒÃC]qÖ8Û:m¶L&sd©™òÒܲTO¥$'®=™ù¿A”ÒM–ºëåqšnÌz˜ØÑßà5Òl³nŠ4q–µÑ2Žâlؽ%ò0;Ë!Ü…™n¾üeÂÁ|¾í�¾jŽÊQ”Í‹Ï©YÞæÅeb·õîúvgA±üÞ}·¦rÅ.w¦Ö÷Ãæ«Ëï?­†b
+{(ÌòÞ$fmKÕ†¡"]=ÖM•"›=.ì²Ê¦®dŠÿ
{ù½d
+endstream
+endobj
+2848 0 obj
+<<
+/Type /Page
+/Contents 2849 0 R
+/Resources 2847 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2759 0 R
+/Annots [ 2801 0 R 2805 0 R 2806 0 R 2807 0 R 2808 0 R 2809 0 R 2810 0 R 2811 0 R 2812 0 R 2813 0 R 2814 0 R 2815 0 R 2816 0 R 2817 0 R 2818 0 R 2819 0 R 2820 0 R 2821 0 R 2822 0 R 2823 0 R 2824 0 R 2825 0 R 2826 0 R 2827 0 R 2828 0 R 2829 0 R 2830 0 R 2831 0 R 2832 0 R 2833 0 R 2834 0 R 2835 0 R 2836 0 R 2837 0 R 2838 0 R 2839 0 R 2840 0 R 2841 0 R 2842 0 R 2843 0 R 2844 0 R 2845 0 R ]
+>>
+endobj
+2801 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 758.07 212.856 768.652]
+/A << /S /GoTo /D (subsubsection.6.25.2.8) >>
+>>
+endobj
+2805 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 741.425 218.836 752.007]
+/A << /S /GoTo /D (subsubsection.6.25.2.9) >>
+>>
+endobj
+2806 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [84.81 725.7 158.075 735.157]
+/A << /S /GoTo /D (section.6.26) >>
+>>
+endobj
+2807 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [84.81 709.055 213.612 718.718]
+/A << /S /GoTo /D (section.6.27) >>
+>>
+endobj
+2808 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [107.719 691.599 217.485 701.868]
+/A << /S /GoTo /D (subsection.6.27.1) >>
+>>
+endobj
+2809 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [107.719 676.658 234.305 685.223]
+/A << /S /GoTo /D (subsection.6.27.2) >>
+>>
+endobj
+2810 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 658.31 228.43 668.785]
+/A << /S /GoTo /D (subsubsection.6.27.2.1) >>
+>>
+endobj
+2811 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 641.666 248.093 652.14]
+/A << /S /GoTo /D (subsubsection.6.27.2.2) >>
+>>
+endobj
+2812 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 625.021 251.59 635.496]
+/A << /S /GoTo /D (subsubsection.6.27.2.3) >>
+>>
+endobj
+2813 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 608.269 245.879 618.851]
+/A << /S /GoTo /D (subsubsection.6.27.2.4) >>
+>>
+endobj
+2814 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [84.81 592.544 153.09 602]
+/A << /S /GoTo /D (section.6.28) >>
+>>
+endobj
+2815 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [84.81 575.899 201.642 585.562]
+/A << /S /GoTo /D (section.6.29) >>
+>>
+endobj
+2816 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [107.719 558.443 217.485 568.711]
+/A << /S /GoTo /D (subsection.6.29.1) >>
+>>
+endobj
+2817 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [84.81 542.61 141.12 552.273]
+/A << /S /GoTo /D (section.6.30) >>
+>>
+endobj
+2818 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [84.81 525.965 208.133 535.629]
+/A << /S /GoTo /D (section.6.31) >>
+>>
+endobj
+2819 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [107.719 508.51 217.485 518.778]
+/A << /S /GoTo /D (subsection.6.31.1) >>
+>>
+endobj
+2820 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [107.719 493.569 264.692 502.34]
+/A << /S /GoTo /D (subsection.6.31.2) >>
+>>
+endobj
+2821 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 476.032 221.329 485.695]
+/A << /S /GoTo /D (subsubsection.6.31.2.1) >>
+>>
+endobj
+2822 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 459.387 220.836 469.051]
+/A << /S /GoTo /D (subsubsection.6.31.2.2) >>
+>>
+endobj
+2823 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 442.743 221.329 452.406]
+/A << /S /GoTo /D (subsubsection.6.31.2.3) >>
+>>
+endobj
+2824 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 426.098 215.358 435.761]
+/A << /S /GoTo /D (subsubsection.6.31.2.4) >>
+>>
+endobj
+2825 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 409.454 214.856 418.911]
+/A << /S /GoTo /D (subsubsection.6.31.2.5) >>
+>>
+endobj
+2826 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 392.809 223.831 402.266]
+/A << /S /GoTo /D (subsubsection.6.31.2.6) >>
+>>
+endobj
+2827 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 376.165 223.831 385.622]
+/A << /S /GoTo /D (subsubsection.6.31.2.7) >>
+>>
+endobj
+2828 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 359.52 223.831 368.977]
+/A << /S /GoTo /D (subsubsection.6.31.2.8) >>
+>>
+endobj
+2829 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 342.876 235.281 352.539]
+/A << /S /GoTo /D (subsubsection.6.31.2.9) >>
+>>
+endobj
+2830 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 326.231 236.285 335.894]
+/A << /S /GoTo /D (subsubsection.6.31.2.10) >>
+>>
+endobj
+2831 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 309.587 240.266 319.25]
+/A << /S /GoTo /D (subsubsection.6.31.2.11) >>
+>>
+endobj
+2832 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 292.942 240.266 302.605]
+/A << /S /GoTo /D (subsubsection.6.31.2.12) >>
+>>
+endobj
+2833 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [107.719 277.19 234.305 285.755]
+/A << /S /GoTo /D (subsection.6.31.3) >>
+>>
+endobj
+2834 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 258.734 257.212 269.316]
+/A << /S /GoTo /D (subsubsection.6.31.3.1) >>
+>>
+endobj
+2835 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 242.09 257.212 252.672]
+/A << /S /GoTo /D (subsubsection.6.31.3.2) >>
+>>
+endobj
+2836 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 225.553 285.303 236.027]
+/A << /S /GoTo /D (subsubsection.6.31.3.3) >>
+>>
+endobj
+2837 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 208.8 271.656 219.383]
+/A << /S /GoTo /D (subsubsection.6.31.3.4) >>
+>>
+endobj
+2838 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 192.264 255.212 202.738]
+/A << /S /GoTo /D (subsubsection.6.31.3.5) >>
+>>
+endobj
+2839 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 175.619 269.63 186.094]
+/A << /S /GoTo /D (subsubsection.6.31.3.6) >>
+>>
+endobj
+2840 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 158.867 267.64 169.449]
+/A << /S /GoTo /D (subsubsection.6.31.3.7) >>
+>>
+endobj
+2841 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 142.33 281.726 152.805]
+/A << /S /GoTo /D (subsubsection.6.31.3.8) >>
+>>
+endobj
+2842 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 125.686 251.725 136.16]
+/A << /S /GoTo /D (subsubsection.6.31.3.9) >>
+>>
+endobj
+2843 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 109.041 259.973 119.516]
+/A << /S /GoTo /D (subsubsection.6.31.3.10) >>
+>>
+endobj
+2844 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 92.396 261.202 102.871]
+/A << /S /GoTo /D (subsubsection.6.31.3.11) >>
+>>
+endobj
+2845 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 75.644 258.709 86.227]
+/A << /S /GoTo /D (subsubsection.6.31.3.12) >>
+>>
+endobj
+2847 0 obj
+<<
+/Font << /F50 2307 0 R /F43 2258 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+2871 0 obj
+<<
+/Length 667       
+/Filter /FlateDecode
+>>
+stream
+xÚí™[oÚ0Çßó)ü˜<Ä;¾Çy\YW­»i+�*Ñ*ÊšŒ!A`�mðíg l	&c©@“ ‘Ùñåwþ>ö±�ô	�+ç¢ë<{‰@4
•¤û…@µR$9UŒtÒsçƒÞC÷Ú¹ì:ßfþÂ~—Óšj.ÉãÈé=ILÞ5
*BM~®JŽˆDAQ
+ó>$7Ί¶×õLûE…‹Þ˜’zÃ$PÔšŠQØôGQÁ¨ Lx>´{‡F÷<K¢4Ëù"šLÇ“têùÜ|qæa«1l'=_iæRÏGÄu¢*	áëðUk©]&u1´mž&õ™¢Jbœ´ÁÍò¸à%qžÖ12ø�£=:ÈpHY‰;è	pç“�¡i^¥)Ãð<1néQÕaÌÓl6g³:€!Ó­
À`À:~¨å	Og„†:Ô6Æx˜GY<ª�Â
ggIÐ7Ät vȱX\>y
¸Ë5…¡;ˆ?{ÜaºÎz1~ü>2+uœiZ@Ít"W½‡yyYº’²’r;ï,7)O›[S¬‰{•”—ྷàêZ¸MàV•[ÞÄ_Zpké>]ºå�þ‹î2ëÜê‘\n[ß{X
—Cƒ·¶ïØÂ}ºrËaÃMë{,Ýr4ñ¼¥{`í†%º¯o[º{èòfÚePÂ{ѱ®dëwÿ‰®�ÆËjn)¸)òá,šÄô«µmõ¾G�©È¿H.;�;жa´à­agQc˜­[)Ÿ�/‰Ï�­ ˜F¯²$õºóª‰¤Ð«+#X—bˆ•ü]—Xˆkr‡µ¹7S”J.{(ÍLG”&¥ÊT¹jû*ÍÒiœ§ÉZR«C°Åælu>»è{f­rÓl»�¿|Vh#
+endstream
+endobj
+2870 0 obj
+<<
+/Type /Page
+/Contents 2871 0 R
+/Resources 2869 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2759 0 R
+/Annots [ 2846 0 R 2850 0 R 2851 0 R 2852 0 R 2853 0 R 2854 0 R 2855 0 R 2856 0 R 2857 0 R 2858 0 R 2859 0 R 2860 0 R 2861 0 R 2862 0 R 2863 0 R 2864 0 R 2865 0 R 2866 0 R 2867 0 R 2868 0 R ]
+>>
+endobj
+2846 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 758.177 292.458 768.652]
+/A << /S /GoTo /D (subsubsection.6.31.3.13) >>
+>>
+endobj
+2850 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 741.533 273.028 752.007]
+/A << /S /GoTo /D (subsubsection.6.31.3.14) >>
+>>
+endobj
+2851 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 724.888 279.143 735.363]
+/A << /S /GoTo /D (subsubsection.6.31.3.15) >>
+>>
+endobj
+2852 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 708.244 275.387 718.718]
+/A << /S /GoTo /D (subsubsection.6.31.3.16) >>
+>>
+endobj
+2853 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 691.599 270.903 702.074]
+/A << /S /GoTo /D (subsubsection.6.31.3.17) >>
+>>
+endobj
+2854 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 674.955 269.675 685.429]
+/A << /S /GoTo /D (subsubsection.6.31.3.18) >>
+>>
+endobj
+2855 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [107.719 660.014 232.136 668.579]
+/A << /S /GoTo /D (subsection.6.31.4) >>
+>>
+endobj
+2856 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 642.477 215.349 652.14]
+/A << /S /GoTo /D (subsubsection.6.31.4.1) >>
+>>
+endobj
+2857 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 625.833 215.851 635.496]
+/A << /S /GoTo /D (subsubsection.6.31.4.2) >>
+>>
+endobj
+2858 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 609.188 214.856 618.645]
+/A << /S /GoTo /D (subsubsection.6.31.4.3) >>
+>>
+endobj
+2859 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 592.544 213.86 602]
+/A << /S /GoTo /D (subsubsection.6.31.4.4) >>
+>>
+endobj
+2860 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 575.899 215.349 585.356]
+/A << /S /GoTo /D (subsubsection.6.31.4.5) >>
+>>
+endobj
+2861 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 559.255 216.344 568.711]
+/A << /S /GoTo /D (subsubsection.6.31.4.6) >>
+>>
+endobj
+2862 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 542.61 214.856 552.273]
+/A << /S /GoTo /D (subsubsection.6.31.4.7) >>
+>>
+endobj
+2863 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 525.965 214.856 535.422]
+/A << /S /GoTo /D (subsubsection.6.31.4.8) >>
+>>
+endobj
+2864 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 509.321 214.856 518.778]
+/A << /S /GoTo /D (subsubsection.6.31.4.9) >>
+>>
+endobj
+2865 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.591 492.676 219.841 502.34]
+/A << /S /GoTo /D (subsubsection.6.31.4.10) >>
+>>
+endobj
+2866 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [84.81 476.032 147.611 485.489]
+/A << /S /GoTo /D (section.6.32) >>
+>>
+endobj
+2867 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [84.81 460.28 149.1 469.051]
+/A << /S /GoTo /D (section.6.33) >>
+>>
+endobj
+2868 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [69.87 433.747 95.148 442.199]
+/A << /S /GoTo /D (section*.36) >>
+>>
+endobj
+2869 0 obj
+<<
+/Font << /F50 2307 0 R /F43 2258 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+2876 0 obj
+<<
+/Length 1899      
+/Filter /FlateDecode
+>>
+stream
+xÚ�X[sã¶~ϯУ=]Ó¤îî[6íîäœtf»ñLº�Ž,1¶ITMi³ù÷P±§í9B$âò
-ƒ} ƒ�WÒ�"L�ÄáãÕûíÕúCš*É&UÁö!ȤÈÓ4H³D¨$ØVÁ¯‹›CÑú¸\…a¾PË߶ÿ9ãd„¡ˆd¢¬R%¤äýÛÛÛ�?~¦íÛ»{"n¾ûî‚$¯æúC¹Ø¤iä†b³ÉXࡶËU*'ÅýÑü¡Ë
?ÂEÝö�nu70WAœ­DDtÙÔ°.–«,‹Až>jš÷‚‹ÆšÙæÏ£eé_—a²ÐG[›Îs„’f‹º)vøÕ°¸‡£i‰&�m=è¥JÓá§Æ€KÐZ¥Ä&IÉÚÙya–;q<ê¢iž‘Þ,þpêáì

}32[W´ÚöE©í|e³èkWNßçÕQ?,#	çè®ôêE±ó�ÕÄ^5IL˜ŽÎÏ´¹Æ£?Æ<Ð."ÚU°Š“ ÑêJÌlfÈü`ÊX“ÕeÁÄNŸiÆ®b¯tgÊU¾=ï5¯
(VrQš7}‘2l&þr
^h‹NôÕjµþ�È@
𦂃aœˆ(‰II%Ôr¥¤”‹÷cÝTu·§MçÐ�"±‰B]<-9€hê)	ú>Ó¬‹1Œ•¶õ¾sêÂ×`h´cßà�åb ™’w÷ž¥Ø×M=°4Š1/4�Áø>¡¾4CC[CBQäæ2÷¨!©Ùê’Ö!çPÐ׺tzÈ$)#9Æ®ÄN•qvÐ�²SQÎä“ʸêBŠÄýõ_d"ïu9‚†°ÍÙ‰Ó×;;�–%
%ÝKç×Ñ
¨™Cº½×ìbs t§=¡CÚa¨À‚b‰oX*ZHŒ±¼3Ý	)Æ3u¯?Ý^²¾š£<’©sŽs‡¸æ°E³†ŸÃ(èöfU´(:fÛ�/[¼‘¦úÉ¼Å‚fl<§æc�µõTÁÜ>Cc	Õfà9çK3é‹œÈÚ�É‚¨íR…Î�“&˜$—
+Ü”±T”}iáZÁã­Ùr93³7õ£êYÞ_«±î}|þÊX¾£«ÏyÁ¨ªÕ¯kÁ«bb�åº8\ÕG¸oŒOZ(‹©’…‘P1÷‰!J÷ÃÀâXq�ËœIA’Ç%}ê�RsÂרh9‰*EÝ�
+)|E¼¹f#�aöõy*ÂP^ðÍÕñ·Jj‰¾w‰~j)ßÊ·ßGQ&/mb¯¬c!ÈÎyqBMjââ„R Ja�6ôͺÄÈ$§*5*	Üz
1SX_”ˆŒ³ÝÊá¿ÎÜÁz\‰ÄÕ�:œo¹œ¸�ÎÄ°ãÕ‚ÆÒ…œ·ÏvÐX)²@�%
+ãæ@¥ÜÐá\í(ª~8Åh@º+œ�y;»½ЃóXHéǯ£þs\óº`�§‡¯lMj�è놺tÕë*1"®.Ù�1u¸JW™Ç”"(&¥¦É’ó;=qâúC&OîT¥2!£Ž úÑØßI½ß'3EÙ÷nã,x—óF×âD|'ÃÑ>QÒ7’-#+Ø{2õ–ao›�mDæ3ŠÒ>IDš©™öñâ8K-:çsh#c‘$j^_GK8Ž°ÀÀ�©‰>@={´Àˆqv$éŽënH¿†ÎÎ&^r#Ê97"jØpÔíNWt9ET\pœÎó pgs¡a�¸k;¸òˆ{Y2¥|m±Ñ?•Éf^€¡éV;†S=kuûÏœà
·8T®
*œïI�[´Õ––9y,-¡YÂÇ"Ýø–mÁ.|ë0‡FsBê8ønCGìæza+
ÖÃ;Âô\¥òåS!¤YwIaÇÝËU†!öÐÓÅ�Gý\ôêÒs�SY$dœœ]é|K4PGE<Rßù7W(µÝRdð&õm·j“Nm÷ÔxÿT‹Òµ+o´Þ°/W§¯ÆP…'݈ûÜë�ÈW@¸FŽoµÂÞÏÀÂþŠ²ˆŸn?_#ÇÍK¡â¡.4ýî)`nËà1ðÔá!œ…ÁL
+�+ÂT
+	$Ãâ0½ý~½Þ×Ãa܉Ҵë=Ò¬ñ¨5W‘—ÇÿÙè„gb“I÷ô_yé«p#R­ï
+{X®RÎږǺìz‡Î~~¥þeÔÂ×Qs@àâ]½»7U=¶ÿ"–¾¹Lá½1bŽD�CBm7~?ÁSå@dݕ͈5eaiš–wÍ)4åb‰”‹%
+uÖˆœ~즮—„9µ={‰áÎÿ7Ö±ŠE&óY¬É3a¤µ(w�؈<ŸîÂ/Ðí2Sx”Š$=ÏŠÓéað°…eÙ¼Z´@{²NÈvÆ<ŠÚ¬ñ©<CÖY´Tš‰(›|çÛIW§¸uBßM
fw©çõ‚ÿW„†3é?n¯þ¼"¯+ÿ‡Ü­2RAÙ^ýú›*X‚‹@D›<xrŒm'‘HÀL4ÁýÕÏôç`>pÓÇ'ÿ�ÅpM§û�øŸÃËÿ
ÓCèüÿ˜‹3€Š
°t
+endstream
+endobj
+2875 0 obj
+<<
+/Type /Page
+/Contents 2876 0 R
+/Resources 2874 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2759 0 R
+/Annots [ 2872 0 R 2873 0 R 2887 0 R ]
+>>
+endobj
+2872 0 obj
+<<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [323.918 209.501 535.126 220.083]
+/Subtype/Link/A<</Type/Action/S/URI/URI(https://github.com/miracl/core/cpp)>>
+>>
+endobj
+2873 0 obj
+<<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [478.6 109.584 525.406 120.059]
+/Subtype/Link/A<</Type/Action/S/URI/URI(https://libsodium.gitbook.io/doc/)>>
+>>
+endobj
+2887 0 obj
+<<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [69.87 97.982 239.235 107.897]
+/Subtype/Link/A<</Type/Action/S/URI/URI(https://libsodium.gitbook.io/doc/)>>
+>>
+endobj
+2877 0 obj
+<<
+/D [2875 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+2 0 obj
+<<
+/D [2875 0 R /XYZ 70.866 771.024 null]
+>>
+endobj
+2879 0 obj
+<<
+/D [2875 0 R /XYZ 70.866 574.016 null]
+>>
+endobj
+2880 0 obj
+<<
+/D [2875 0 R /XYZ 70.866 525.242 null]
+>>
+endobj
+6 0 obj
+<<
+/D [2875 0 R /XYZ 70.866 509.013 null]
+>>
+endobj
+2882 0 obj
+<<
+/D [2875 0 R /XYZ 157.981 282.869 null]
+>>
+endobj
+10 0 obj
+<<
+/D [2875 0 R /XYZ 70.866 265.817 null]
+>>
+endobj
+2884 0 obj
+<<
+/D [2875 0 R /XYZ 70.866 172.627 null]
+>>
+endobj
+14 0 obj
+<<
+/D [2875 0 R /XYZ 70.866 166.561 null]
+>>
+endobj
+2888 0 obj
+<<
+/D [2875 0 R /XYZ 70.866 60.648 null]
+>>
+endobj
+2874 0 obj
+<<
+/Font << /F67 2878 0 R /F43 2258 0 R /F50 2307 0 R /F70 2881 0 R /F72 2883 0 R /F25 2885 0 R /F22 2886 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+2892 0 obj
+<<
+/Length 2284      
+/Filter /FlateDecode
+>>
+stream
+xÚÝYYoãF~÷¯ÐÛJHL÷}<ä¡O�3ÎŒ×Ò&»È-ÓײèPÔÌøßoñ²%Y>f‚&ÕìúªšDƒÙ
Žìäà(r4P‰‚&׉%Ä@j’<˜\
~’Ñ“ŸT±D*ËšÁÉÉÉq8©†“Óq{ã~ø¡ž{&`˜ŠøaG¥EØ`z{ðûhpÏ~ „j5øÜ̼0NÎ(Ü/ヿ -1I4Æ|SM�Ôë‰2:Ä¡ád¤Ð°¬ï[Íòª½ëªÖð(‚˜G£Ñà�²„rÞnd®«VʆÕ<ko.G
×ùâªþɇÓâön‘UÝÃÕz:ÍV«ëõbq?
†?Â8£�«³EÃ/i½fs þ—M×UÚìÏÕäf<#`aïõé"Ï–û, 4ADöÓÒåÕ–ú|8ÉóÙ³²�Œ,òËt¦`)­ýôT¶Ö	¼ßTy^-V#̇IºG	Jõ0=-;SgÙ2k%UÙU¥CzBbœèÞëù²
Q«3Ülº~^åe6­Š
uë¸�á\è“#+Švú*Ëvöƒ«kPp@Cs¹ªZݦU^t
+œ¦£FìÕÀ†þ�8›S¸àv`šÞ¥—ù"¯ò¬ñÇ�íð2­W}ÊgiÕK/¾ÖªØ÷Wˆ
+ÈDK„{°BÞàÎmÉQŠC
À;\=o’(Ä÷¸iZ,— À¶²i{ù­Áçå*¯²¿¬Øês~]
x’¢œ½AÅÞ[�¯wëN»Õ¼X÷n«’_·÷¿†sûq|2ùWûsž®:OgÙ²ÇÂŽ�'/|°uàÿqÜIJ3±¦¬rÖq×ycäV>
+” þ€r°_Ðd¾åŸÝ´À	ëç?"hQ7�vÅmVÍóå¬{�ß4Ðëq“¯ÞâüC¢A(¶ƒwŪZ¦·ÙOûƒP»]'L°vöY™j€[ϽÉî»UˆJj¢ôH €‚Bšk™wHbƒ„ŠÎoxD[ctˆ8,&‹�ó›’:½Ü2ÎÖ—‹|º+TSç=#L:�œuX8uŒRjcÌ¡ˆiР)½ò8D¦x(j¯½Dt�y›Bße‹EÑ9¥cÔ]ó»y�þõ”ñ:ïÝÑh®À£&Œ/0QÇî—‹ñ;C¸Ø#uœ•Ÿú}©çYUÞŸg®³UÕ{˜@ÕBœ!Š¨‹/YàÚŒ±
Ø+ð)‚[¥±#†À°�ÆZåx@R¤qÊ(Jµ#€N)‰ ƒ'Ã`5§
[l• BYf°εÒë\ªÊõrZtЗ¶á»2;|Æ}OÌÞ2P¦‚&NÀ-'QR(dŒzK™#
+1çµRÌ‹¬GJ©„i9°˜Aà˜n¸µXPŒ…s´ö£–œ)oß`jŸi¹j’±GmFkñÿ#ï³ûvEø2�§ËY·ÏqY¬ï¶·w{œãW\¾™Tï3™E%-ÆQ!5±Ú3o‚‚?J$µŒˆY
+!Á
+GH@̤¶’`¤—Âb¤¬àÈpð*ó˜;…¤ÁÒ<v" X`+¸f
ÆlûŠó1p%éjøx�ÃUgl6-³>G´Ž¡À0ÊÞ©2V@t�ÖAE 
+¢—811nkˆFµ¯aÎŒÁd�ÛßAŸ´š§7Ùq ‚*w%”�Ô@†ÂW8k�K%™Zs‡À¥Hr®×:óJÍ·EWez}ÝÇkµ©·T�‹µ¤NRÂ@
é+9’Ž‚T¤k9ÕÒ2(ÖÚQ¡†[¢WéÍz×,bcT$DqÄ<�FRœ
+ÅgB<çÔ¦2”@sºÇ¿¥åò!ÑÛ‹9=ûÐÞe_ªl¹jš²úç‡�“ö&�Þ,‹Ï‹ìjÖÃäò~3W_1øT×v|ªæ/é—vÞu™vÊ.²å¬š÷Ø0ù÷ì4
+ËiyWõ„ÞÖ.ËÏÊ¢>OìUÇee•CŒ
+µ›§yç¤ÓF¯.b„qõ½mzfº±ñrÉgË´Z—;dà0ç’Ñë(£0��@”c/�PŽƒ5RóšK<…*ä$º Î2g„æX¸D[!„#ð$h¥Cx!¨€�rK¬Qð*?a*°·ÓùùØtðض ¸~K‚˜Úcûþ%c%49PI%¨	Å,P
eÈŸjg°ö^Y‡l¾®À’L¡�Á@SBjf™ŠLJ!Œ°Âx,#ÖR0hc<ã@jDb`^`’@<ò ‹2‰UøL¿Û6à«p²Z­{˜Ô‘‡Ê‹†çôè4«þÖ
¡CôѾô[_þ§9blg³=:ÚçôMœž,áD~›]娭ìE´z
l�œŽ\1¥ ­ÅÞZ}$±4:(nVL„ãÊÖ�C ÐwYi %p°.D”¼È4ô�†Â>8bo¢PoT°L"T&aD�^*0z{ŸõWÐÊ^B«µÐBr¢œƒEP¾)4Ј¨Z“ºÈ)„Œ“V¥ ¾x"Œ±œ¦�×�Å&*hé#tTÐWR(²`Í0œ:(ôœÊé`T	�khÖ‰Ñß`ú7£•½€V?î˜ù¼(:(ºNÞ?é‘Ïgy•.:RÜvý¤\÷ôîŠdT÷üíéñ(®Ñô§ïžY÷Ób{óýí?
γéÍc!ÜI·® ÖÅöõbh³¢Ì«ùíÆæâì½ãçÿfÿ}
+üš•-»=4@Í;ÆìjoOð”_ê€Z¶ýø~_'¾s„è{ ¢³²|È£šŠ»°ûh"´ÃЛ"àW-©spà„s‚F
+Â龜~PXŠÙî•ÞI††3«{ûú0…P(…Ã0Óš}e0‘¦œABˆvÂ(
+À
1oû3ÙöýW†—²íûwûÿS¶mT�Ý,{&µ^Úíû0Ây‚(þšï"ý÷‘YÛv
3XÂ9ƒk\ߪy\¿woÞ¹?¾wî^{û¢ùüp?k>‘dË]ÿZ�
+endstream
+endobj
+2891 0 obj
+<<
+/Type /Page
+/Contents 2892 0 R
+/Resources 2890 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2759 0 R
+/Annots [ 2889 0 R ]
+>>
+endobj
+2889 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [329.925 562.87 363.317 572.326]
+/A << /S /GoTo /D (tls1__3_8h) >>
+>>
+endobj
+2893 0 obj
+<<
+/D [2891 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+18 0 obj
+<<
+/D [2891 0 R /XYZ 70.866 771.024 null]
+>>
+endobj
+2890 0 obj
+<<
+/Font << /F50 2307 0 R /F43 2258 0 R /F70 2881 0 R /F72 2883 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+2897 0 obj
+<<
+/Length 2143      
+/Filter /FlateDecode
+>>
+stream
+xÚÍX[SãÈ~çWøŠ Nß»S•‡¾Bvv²ìØ5y˜�¢<¶*ŒElyvø÷9²$#cí²³Iª…Ôôõô¹|ç;‚ÑÝFW'nrr™Œtf¤d£Éb¤ ÓRŽ”¡™$£É|ôé”dôì‚*}:9Ópº>» púÜôUó.·ÕÙçÉ#Îu&„ƽw+YÝy''ÿ:!Ø#²ß_ëLS>š=ž|ú£9Žý0‚Œ=úu7óqÄËgØ^ŽÆ'?Ÿ@_fEG*3
+H_fI2è„öùº*ÅlZågàÔßO‹UÓ,6ÍûëtYÌwrÃèÂd\Šfíd=]mfëâ©jæ]O7÷Mëà¯ÏÇ×ç1žû	þKš�¿5/å£OÒe¸§�œ‚8+<wFËHPÕaTS*|ŠƒÕÑ	îՑ׆—0c?Á¿�Géè!F¡•"ÊÙè8c¨¤4²Äˆw‘â½ô\<Jí„Õ,I5�$ª
õŒóõ×|ÝjõµšÇÅÝjZm×y{¾NqÔ	Pé‘É¢¥œUQ	I½`I*«¸á&%àÀˆqà%ÜøÄc2ÊÛÀÑO$KDq(PGbœM®d*Ù „JN‚LŒ­·2"øUëíª–o¾Óͱ‚÷7Kìò®\Õý㡯|ÛÛ›ñøßñv|m©�@5Mëc¾ntT”­þô®[L0ô¨9^¦Õô•·îvÉçÿ±�œ�Óù'�m?þøùÈa¨1^€ð.Hµ÷h5øE[“u*øD™	¨jo„O`ÓÜ	4JKè€Vü²ÈW}]<¿Ü±=Õ iÑ’žrÊ´GŸQ�CôL`ø/´0NjA$3Ñ¢CQ
#*$`ô¿«”sŸŽô"u-µ(A
+Â2

* V´wB%™ œpmPôNÍ%¡É8­¼1‡¡= —éÓÓòÀEªõt�NÓü³Égë¼ê@&D¸ã
+
Æ[ESŒÞYb‰3L'n“	"š{AFN‰¶(kb1JåÓPô<ï;$!$%+." ;—´'†ëÈ7&hA-`�ª
OB‚ó&2c¬ãÄ:¯t’¶Ëeg¯Õ|s?}hãrV®fËí|Ðÿ³,ke_TÝ5î—¯óÍöñiw©¡°]Í‹Õ]¯ïÿ>ßl¦wùPÄ^ÅI3粕y2¹¹$ÙÌ\—›ê¯­-UµÜdåú®›I5&¿vê?§EµgQ¶êÛ¨X=µ÷ð�«²s§ÖtÅì!¯nüç�ø�Ïòâë~í‘·Ì÷Àu¾�~ÞÿxY\Ž¿@1!aZ"ã™
 95ÂH¡¨’õ“Y
+‚)%‘±(\Ç™š9Š+Š½làºv¹ãÍ>äªòøÖ-v/ËMë8«²ª
ëX¾\­òÙËÅgõš�w^&¤-/”
+—1ž!Š¶¸t†7<ų© §ÓªÊk„¢‚ÕF«ûgõºi;_÷/u‡:ý2­�Ù�ÕGïvy=µéFëŸáQõ#o·«�r—¯ð¾ÈâÃìvXµ�MU®»í‹Ãí
 Ë¼éš•åC‘ŸqšUߪڤ;ét¦µVÚ…w5çª9`GÞº÷+W«ˆd
+hÏ—³4¾—ßPo»vrŸï9iíÁ»öæ¾Ü.çM{‰¢·½åc^Ýï\y7P4šúÛÆŒû¨ø]´©‘`5}ìÒô1æfºÞì7žt—íš�~\I•BL�IF†„ÓX�[•˜"šh˜7TÔ	Y+k-P$ƒ"ØÌ€èËb‘wÈò˜w@Ѽ‹Õ¶Ê7"0|{³Î/Æ÷ÓuïòçCD ˆE>ð�L�àƒ"‘£C ^‡”„—˜òˆ‹/‘ÎH…œR;$œ~»Í§ëåóí@u§�‘0¨ùñ»ÿ�@­\±šw¨ƒ÷ïæ½2Ò1�6ŠŽR�û �ts*Ç8¤õ�		3g ÁÏ@3Ž,8F5d³XߺCº^ò–Ò8Ò,NŒ
.½aƒð‡±jD%c5AE)˜'ÌÑÈÆà]‹¯ûJàa)¤éÌ&PÜYº0TðàAÒ€@–¢(†ì„#o�I�ÄE}póuºÙ~YvôäåP,f,p°¼ðèã¨:ç�YJ�†¶‘Xîëë;%±âñë5,S0`PDZN‘	ÅeÈï¸Ðë6°¡401Ý‹¾`�Ö¹€Ñc±¬‘Ñò?^xôCùE+÷"_,.\~Yl7½LZ’'æ*§¹"Â}]]çËeÙK„ǹ„®:YŠ47H´óšI.%'+8Š.‘|Œ�+Æu¨
ë•sŽª@…P�`7È3{D«‰€ÍÖí¹ï¤OD|Ù§šˆ£o!ñFzàS`ÂS4z]‚'H48$42PG�õŒY‘­š$ÞµÎM+g$ÿ÷dò }lvT§q‚
G)žî;Ho‹.�»tòãøÖÆñ-¡úöÊ¿ÿí*xçñÛixç©Wërût¸å8úÜãÃÐ}›IŸ£3Õ>°ß¨»ûpð®@‚
�€hMˆM‹K¬01ù¡ÓÆ
õñ�:Å’ÒèÞ!b&¬'µŒtN
½ŒEo¨�X�<Ø@ˆ¢ÚÚȬQØ‘(FÖAÈGå[ß!úö栗þ˜€d˜Q©½4˜€bâAVÔrdA’JªêBYaf°,Í™ŽTÚx›8‚ ÖX‹
Æ¥â49<ÞkLc`±2Œ‚EâˆÓ¸‹vËHéOè=!úª'DŒ|ÏG½î¤Ì�ÞóÞÇ<.2¼Y5_m¹*ò´/5Kk?@†²&Ëßžïv_%óÕkÿ
êER
+endstream
+endobj
+2896 0 obj
+<<
+/Type /Page
+/Contents 2897 0 R
+/Resources 2895 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2899 0 R
+>>
+endobj
+2898 0 obj
+<<
+/D [2896 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+2895 0 obj
+<<
+/Font << /F50 2307 0 R /F72 2883 0 R /F43 2258 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+2903 0 obj
+<<
+/Length 2383      
+/Filter /FlateDecode
+>>
+stream
+xÚÅYYsÛF~ׯྑ¥̉Ií>à´œ8vVân’”
+‡"J À ŽŸž$$aíh][[.ysuO÷×_÷Hhv;C³÷gÑêì]ÆÐ,ð$çd¶ÚÌòÎgBb�û³Õzöëœ.~_ý0#
õD€a›\}øð>½\,±æ«�W¶ŸŸëµgéêì�3–¢™<1¼ÓY±;ûõw4[ÃÜ3äÌÌÊÝŒ2â1J _Í®Îþy†ÆZ
+<žÈkÉ}
j^móV­KŽÐüJ­êÿa?‚Xˆ€ÆŒÈù”FA&q”!Î8Ô2_¢˜J)Y*ÀHú2ňfˆá@Ä81×G³¥ô(gVÖE^¯»m~§&ÄQ„Y(ÒÇ~Ä	�e$K2gÎâˆQ¤!ÉX‚@PšÄ<!±ŸæÇ ŽŠ±8jÅÅU©êÞ¿}.ºoóͦ,ìG7Öƒe±O�Èh*Ò$ õ%�’†¾L¸˜>ŽAU&|°a1±ˆ§2KD‡Q:qí+ÕÞ«ö�zøi@³4
+EÀ%3Á8E�D<æÐ`–É�SÊ°ÄQÈ}E€ˆTÛ-c
£'ì‘æmõdOOò>·½°(Ô¾¼Öû—¼­ËúÖ®[ºåþd{ê±WuW6µýüôye;yqW7•Zß°ºyîgìðZ±±�>å;õ¥_«ùSþh×mÚÜ)[©ú¶ßÚ~«þ8¨®ÿ‹g:�Vm^wE[îݾ‹¼sÇý†Š/ί.ÎÓú¾uNƒ$VŸ'Òg”§™H8¸+ŠxP±8ŽSABÁ«ë'DÒTN‚§vfL‡N³q/üùß^ãü*;O“W—ÉR_‡|€ˆƒPú”s
+0—!EÏpHa„D˜ßÇ€ÐgÌÏqÓ¯DÂ	‚eg[˜*7å¤?Æ¡üo½lto§.a(•<}–žù<Š1J$™Ê$Â@Í!–‚	±¥8	>D*‡ŸPw,5ß﫲Èû#à¿@! _KÈ Î(0¡ä')0F>á
#Óâ;
+qT—&”i(9!_‰�7hÂ#!EÅ84‘@"a Dæ'„¦©ˆÃH”³8 "'®“øÔÏpÐ4 6¹TÝa·?	ÁéESÕa=éÄ^×Gç?äÝ‘_ ¢²?Ѧi‡ôq²IYïý„ÈKU¨òþ¸÷•éNzè€èÛC
³o]¬~úø**(Ð+üC8#>Náa€tê£JPîg®ÿ'!F5Á!C
+اó©]#¨À0:eâ°Rm?xsÀ_ß¼¾µãä¸j:gþºéulLPSת8]¼Ð{Œ­ßeP;œ*؆‰W¬pÃ9È#h¾Æš—½nù¼9�ÚN<-`ishíèf
[r=t¿ÀÌŽûv+»úaáC¹é` [À„·XÒ@Î?ônº¬*{P~£=NÁNþÆŽCýä{Ä�uvîoºÃ~?lSëál§hnw»ÜÊóZ+sØÝ(§|³±ãEÞ)wtùJ1{òÌíûždÜÚm}€kbiý¦Ûö„Dý™Û40§hUÁH;
==^(§{ùBXcÒ�oó²¶ÝMÛ윈­›½RÖQÆàÐgH[•ÈXU¯Ðv±v2§Xé·#ÕôÝu{“¯u¸ŽV½AGãÒïžYÆ¡;×iL—½»üN£CÛWÖ�mó¾W;�°ôG﵄G7´U;ïx°ð ¦s«û
¯ºªÊá¡}Qk¼Œ¨Ã»÷®‘~_u>ñüµ·x{¨j1C˜
|3*}é;З;/è.íJ»ƒÂ1H0U³«ÜYyw×Ù5Go˜aÛ\¨ªj.ÕpóË¡è1K´ÅGjü¸ N
wô¿ökí=ã±%¡B¦³„k”Ü–NÇ¢Y+ÛÓly£O8ôÏõ^7Ã…4ĦÜzjIL:,†t¢™Ö³‡­ŒDŠt†.ôÂÜz—Ù‚®l
l˜ÞÛ^·=ñ„]W4íÚ-ƒGŽíXäCgŸ¯×ÊÌ‘ÿñ AøÏÆ¡ar}uñùRÛ|u}™ÆŸ/“«Ñ:wäÄM×J£¶Vî·Žúu×ÞºgÞ¥
äø)I
�bx/j^oûÉ/`H|�ë­µ2K�=!\„!V“v”ÂM¸@íµÑè¯ÈÝä�²íZUªîrcÁó†ðšŠ®eûõ ºRƒü¦xW•]ïõ�NÅ)ÁG×ìÜÂgyÅ1FÞ�曈îìÐçí´Ô›¸1"Ë��ØÖ¨ldB� 
—Weÿ‡i‚5w`àLä	&¹»¡á�½„ïaªXŽŽ5¥Qº\;¥C-çÔV÷C}2mêIÌŸy³SÕfÙ•·G #	“=¾íÞee“2ŽÓ
+Ž!&áp«je9ê@á|Üìá!ÙUÇçšCÇ#CÒuk W&.×ù“ëB�5Ì«‡;åJKU|ÿwÏÏNUÅ>oóÝ°üøÆ„jy—Ö?ÕyK8É”6úc÷_Þ^
;G`ÚÞÌ|ÃGcCZTÇšdRœÍâ.×UÊûŒdà!ÊFÔpm]}}ô²Wì÷ú,ÝÎWdÀ¥	�lÎÒV4Ä
ŒTªël¯hv;ÃÐoƒtvqÙ�6CÛ)·÷°·mn×UM‘WÃ~ç»~²r¡þ<+ÛA�1æìqù°{ÇYå_ÇÂk:[9N�ä7|V¥‹7ÓÞÛ>sÛåßÃË"˜€ææ–SÑòU¨jš`W¥?óݾRßßÝu7~ÁØwºÞÔÝŠãsèÅåì“ѽË(ŽyxøÕZ^ô.=äC;Ô¡®Î5@…�_L0	Å•H&•lËÿ­1îG¿æ@ÿUMc
+N,G'|éE÷m3£‰†èçÑ1©-ü¹-9ôðÒ)tù™_F®½Ì.ÛÄS"aüTûbKHZàQ€U_?¥p®u9” DL–rES÷mS½ ꃙúÈÖÃŽ, ÷‡þ»Qf<¸”\¸»QðÒi�%J=ÀÏPÎß4ûQ¨„ÕDR·oùîùɖ醨É
+1A„0_æßü222¶M×?;iê/Œy0õ†?`^áú÷P3ê1F¡õ8wåÏ{�
^U¦Ÿ4†¯žnuÍ5WõKÿ	ž
+endstream
+endobj
+2902 0 obj
+<<
+/Type /Page
+/Contents 2903 0 R
+/Resources 2901 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2899 0 R
+/Annots [ 2900 0 R ]
+>>
+endobj
+2900 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [111.24 434.983 144.632 444.439]
+/A << /S /GoTo /D (tls1__3_8h) >>
+>>
+endobj
+2904 0 obj
+<<
+/D [2902 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+2905 0 obj
+<<
+/D [2902 0 R /XYZ 378.361 373.991 null]
+>>
+endobj
+22 0 obj
+<<
+/D [2902 0 R /XYZ 70.866 357.62 null]
+>>
+endobj
+2906 0 obj
+<<
+/D [2902 0 R /XYZ 70.866 64.298 null]
+>>
+endobj
+2901 0 obj
+<<
+/Font << /F50 2307 0 R /F72 2883 0 R /F43 2258 0 R /F70 2881 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+2910 0 obj
+<<
+/Length 1209      
+/Filter /FlateDecode
+>>
+stream
+xÚ•VÛrÛ8}÷WèQš©J"uytÓܺi“ÆêìfÚŽG‘‹SYÒŠt¼Þ¯_� âËfg§O
êà@RoåQïjò¾˜œ]rêe$O’Ø+ž½”’,I¼4�HzÅÒûæ‡$
+¦QšùE�Q¦!õw¨‘¿ÝF?Š�cá<lû'7ÊÉE1ùs‚Žzá+~–‘,b^µž|ûA½%Ø>z”ÄyæmíεÇxL8‹An¼ùäË„žp)Iyž’NBBXÞ!¥ˆ'ÔJËv…|ï1Uu9ˆ%®Š äþN¾g—àtŸêMã�dœ!ìlUÊÚ�ádÙ4(m”SÝõ¢�Ïoq¡;ü®åZV(–.©·ó�Ä(+
Ù�©ÿDÜÙdo{üž]¦‘—’<¥áHÍc¤×�S¥€Ja«¾L³šêF…‹Ø-*Ù×£å~þÛtv1£lzuþi:¿žE<qûzõs!—¢ÕRïPÅ¢½	%҈ƔQNšÒŒæ´¤O´¢K*èsHÝþ¶«Ä Ý¢¬*Ñ»cñHk»ÝþÇ0’f.ȲuÇVum+*Wƒ/²ü•„EˆEΪFBxcLÇ16]U6u§ôÿ“šAUÄóåºï ¯Œúº4°F§„ÆÚ³ZGӴðr}ñ`‰vbΡ¨ã±•ððH}â	# “±×?¤Bç
§þã}§»Åü¢(n>_4^Pn†¯YèZ P>u¦°�ŠûÚÇ
Ê“o©Ôfm:	1J=J§!
¬Û;4ccÆÐÌ4
!$9O0€¥x6ìÊM¿±˜ûÅãýÍùìö�Y1[˪FCÙ4–ðVáZ¶jº³¬´ìZTn¥®ñO'³,‡¥ÓÛ6~RB4 �™,dþ5"b�ô$:pŒÖ¥1í¶lT‡ê'�_°1ig€Ì?..ÎÏÍ_ïlèÔÅÌ1æû»y±øbœ~5Ç5û\|ýå�0Wô \?¾¸ù¤Ô0�­…�9`kJ¥QÒõ œRmú×’DÍ¿òc`0?ÆÜm'Ø´¸0ƒŸÃxs§³Š[>18)ìÁãW÷Öéºwê­¨«niÊ ”üÛøt+sÌr-ÖºÛ¡e
+XVã¾Æ4ª	(pžû7z4˜#1Œ
+=t�ÂVºv½@Ýó‰I‰æyªäªµ¥m „K¢üNiþÜÆ~Àn�1éè>Ñ+Ó±ÆOCvSÇÞ¢ÏÇ·©MŸ¹!`ÀÐxI�wH¹
LÈ–�-X‡AÿGîú+LQœî¹îdeõ‰�×èÐ…#l¶Úÿªê²]9ˆ²YuxúP"kÛ$Ѓã®(a0’÷ö­ðzk7,…hWîW$Øl�Á^«…@ªlPó.ÀG2æ	‰’ì`B.àRõýÓšE$æé¸CS­1=HÌyÑâ<‚wI"~|doRwd®¸ñ5ä8
­æ0
¶M˜ÿ;ö›ÝçžGzÿhyÝöGÄy˜£,šFöz|ST›Ã¦<®¦ý¹!ôÏ’]%o=Ò8'4å�6¾Íà`Ò„<Í'Iâæú•hŵëÊzl#èlñíVö‘)ÚSŠÿ鈷\
+endstream
+endobj
+2909 0 obj
+<<
+/Type /Page
+/Contents 2910 0 R
+/Resources 2908 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2899 0 R
+/Annots [ 2907 0 R ]
+>>
+endobj
+2907 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [165.732 592.983 199.124 602.44]
+/A << /S /GoTo /D (tls1__3_8h) >>
+>>
+endobj
+2911 0 obj
+<<
+/D [2909 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+26 0 obj
+<<
+/D [2909 0 R /XYZ 70.866 771.024 null]
+>>
+endobj
+2908 0 obj
+<<
+/Font << /F50 2307 0 R /F43 2258 0 R /F72 2883 0 R /F70 2881 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+2914 0 obj
+<<
+/Length 212       
+/Filter /FlateDecode
+>>
+stream
+xÚ•�;oA„ûý.w…0Þ—××ò:�Ò$l‡(î á¡DH	ÿ>Ë].MªTÙãÑ|G ¨Õ4«É2VÌò
¡0Cª²…ÜÀV³Ùå5x	˜Ä•·n™W«zñbÆ.‰ÎO›^ÌF£‡W-²zW¶X	ìo¢Š°?«íŽ )·5úJà³sž!D�1ø¢O°QÏŠ~ZóOfŒHÞþ'rft‰Ã8Ä€1†2‘KdW·—öãõÖ6=Ö›q¤ï½ž_�'ýu?š±%Ý^:Þ¡`áþ•
JÀ
+endstream
+endobj
+2913 0 obj
+<<
+/Type /Page
+/Contents 2914 0 R
+/Resources 2912 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2899 0 R
+>>
+endobj
+2915 0 obj
+<<
+/D [2913 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+2912 0 obj
+<<
+/Font << /F50 2307 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+2922 0 obj
+<<
+/Length 1743      
+/Filter /FlateDecode
+>>
+stream
+xÚ­XÛrÛ8}ÏWèQž®eêní[â¤i¶Û$»;í´�Œ"16§²¤Õ¥iþ~
´eÇî^_"$@àð„#¬¥%¬Ëa¾Ž¢ˆŸË“³ÅÉäu[îÔ	“ȵ�V,œiYQì;AY‹ÜúdÏViÝÉf4ö¼©í�¾,~Ùó£�xžã‹©‡N„5Ž<'Š¶¯ÊÏBx˾‘ä£[±pÚŒÜÐÎ{UV¤¸N�twë‰@Ø̤2yøÖÔI¢È7{°§K{.VªGÓØ~yÂîU‘ÓШÛZf
+ÃÊÒ¢x&ÝãÈvÕЀ‚á´1
€éÛÈmÙ´ª*IQ=îÞ¥mý ðny‹[…ß¾ûù,BAÉ‚ä:°8víÛB¦-»é�ðbGÏùî|Gˆ0{×u’0¤ìu(±
:žr€ÁÕù…c¬¼ÀÁ3C£×ªi»Ñ8ˆ8… šÚUÚä¤+¥Ì[ž®xVÒX•ªSi¡Z™ÓDZ²QQeÿWü#sH.q={1raXÑŠœ}uúÀÈ[ÛÁ™ìEÂ\ÌfÄ”�«à�°Ó
¨彧6h�\}¹ut)ò7—Åã\-K™Ï�ç�°;‚J"#¾§ëº` ë¦Zâž´ñzGæž(ñ/p÷\n²ï‚V¥u-Ó¦¥O+Y²š¿ïÞÞ¹Bš6‡z³IÛ/—²ídþŒÃ€A€‰u:bhÀ°¬ºán$oH�+n×\?çdo*¼´O½Î�iIø(΀ßÒ/ZÉjöÉ9dÿKZ’¾_‡J;E[±‰ÞÃ
aàøÀ?
Ž±}ØÚ.e)Éw'Ù>%ëø1n5AHÿÁ	EBbfÃÕ¤“oõ¤º{*ÉUÚ¶U¦`Un’ÒH)�"k-]üó¼s\‘W*Ï%èø;/*Æ^`	¨»5þÜ;É â@Z¯qÒ¤/ÒL*;®&]ÑÞg…’ew¿qäduM³@åƘ–¹Êtâ®}è ¯+�ýÔ‡PÓÎHZà=�Äô”´ÙJÕ$å•>)�RúhÐKàÀƒo¯dŠx~{f\4jÌC[ªÇN•K¼@Èlý>ÐÓ€³jß]+³Ú£Æ¥í²žüÑe`­×u%s×ܪc‡€•v½
qsÙ�3¼ÞƒƒuhA—9Øa“VPMÊVi¹ä%�N#uuð¹¨;÷!'•*éKdC	_¬8tš„—²Ê¥A¥ñM¥	ì7ïNQ?£¼ÆY_pNàسçRîY.@1¯²~
TÔ±í£ƒue€Ìe—ªBã6y
+ËõœÄuCn%‚Øñ\†ÑsàŒ±úÚgØFGö.”®8úð½©ëBeƒ^T<è{Àdð$s[±)†$cÑÒêƒw>yL­±:‘àáîZXŸÆaÙ³î€kjé^—¾nÒÊU#³®Úv-GtTÚP*Ó5{씂r°»5žPâ$^hÐ<Ù TÅ›’¦»}†MµÞÝT˜C±Áå§M\ØDX_-#½ðbÏ‚x"/ÒàEÀž �)*¬]W·?O&KH®p²j=Y«&ÍŠI†ÌF~ä4ÆÆãNÖþÿ”u:ìãþcæqìøÉôÿÌœ=îdÌ_Þ«GÊûe‘¶Ü0röœ¯î;xá—ÀÍ[µí3
+ó£bɶ)”ÿ|ïYû‘?Õé¾à “ùŽ…u¦¡ 3…êHg
+‚îÌáK'
+Ââ×¹ëø$Ï^½"!«rI˜Ch{'˜l†¢zØä"‰²¢Ï¥YЦń#ÐYƒÐ6ÙdK#ØbK#ßS\¦{#ýÓ©#…nQÐ!aíÅÂ&»¸íöý½r¼±%:çENG¼½|ÆT�›°�³Ú¥J.‡çìæîâþôîüýÕõ�ñŠB™yß=~Ø]ü££Åxùš¥EÂ�63-S•u)üž¢Ø÷\ÏØò£D\ÓE¥íôx&GƒöÃvïýÁB+7§‰}¾‰ÿ~qwv3¿Z|„a
DKê«›ûó‹3|vÞ_ÒÌæuÆiz�Q�KâÞ’&ª¾«ûn³S¦rÞ_V\?»
“?Þ.FÐBÝÜÏ/‹«ëKç(Mç]Ê?Lù�†>žxS5L»°·¬.zþ=Õ®yh;ƒØÉ¿"¶î'¶}´¡C+¹ÉxƸª¾1�1sÐó«óý~u Ðüâç[î”úw Ž,
+Å‹ûp±8ùãÄeRð?‰Âоkeë“O_„•ÃôcúxÒ×VúN�„°
+k~òýÃ	š­Èñâ(ü¿)€Þ%b‚^bÛI-§n‚¸oEù¼Ò�ëó2~
í…ø'rÍÇÔ
+endstream
+endobj
+2921 0 obj
+<<
+/Type /Page
+/Contents 2922 0 R
+/Resources 2920 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2899 0 R
+/Annots [ 2916 0 R 2917 0 R 2918 0 R 2919 0 R ]
+>>
+endobj
+2916 0 obj
+<<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [238.289 244.668 425.587 255.142]
+/Subtype/Link/A<</Type/Action/S/URI/URI(https://github.com/miracl/core)>>
+>>
+endobj
+2917 0 obj
+<<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [253.738 224.742 441.035 235.217]
+/Subtype/Link/A<</Type/Action/S/URI/URI(https://github.com/miracl/core)>>
+>>
+endobj
+2918 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [141.625 133.898 191.326 143.354]
+/A << /S /GoTo /D (tls__octads_8h) >>
+>>
+endobj
+2919 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.449 113.972 146.841 123.429]
+/A << /S /GoTo /D (tls1__3_8h) >>
+>>
+endobj
+2923 0 obj
+<<
+/D [2921 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+30 0 obj
+<<
+/D [2921 0 R /XYZ 70.866 771.024 null]
+>>
+endobj
+2924 0 obj
+<<
+/D [2921 0 R /XYZ 70.866 565.984 null]
+>>
+endobj
+2925 0 obj
+<<
+/D [2921 0 R /XYZ 191.694 350.293 null]
+>>
+endobj
+34 0 obj
+<<
+/D [2921 0 R /XYZ 70.866 333.777 null]
+>>
+endobj
+2926 0 obj
+<<
+/D [2921 0 R /XYZ 70.866 280.544 null]
+>>
+endobj
+2927 0 obj
+<<
+/D [2921 0 R /XYZ 70.866 261.496 null]
+>>
+endobj
+2928 0 obj
+<<
+/D [2921 0 R /XYZ 70.866 241.679 null]
+>>
+endobj
+2929 0 obj
+<<
+/D [2921 0 R /XYZ 70.866 221.754 null]
+>>
+endobj
+2930 0 obj
+<<
+/D [2921 0 R /XYZ 70.866 201.721 null]
+>>
+endobj
+2931 0 obj
+<<
+/D [2921 0 R /XYZ 70.866 169.948 null]
+>>
+endobj
+2932 0 obj
+<<
+/D [2921 0 R /XYZ 70.866 150.023 null]
+>>
+endobj
+2933 0 obj
+<<
+/D [2921 0 R /XYZ 70.866 130.097 null]
+>>
+endobj
+2934 0 obj
+<<
+/D [2921 0 R /XYZ 70.866 98.217 null]
+>>
+endobj
+2920 0 obj
+<<
+/Font << /F67 2878 0 R /F43 2258 0 R /F50 2307 0 R /F72 2883 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+2939 0 obj
+<<
+/Length 2265      
+/Filter /FlateDecode
+>>
+stream
+xÚ­]�ÛFî}…P܃ŒÆ³’FŸ}8 ·»Ém›4{kí!)²=¶u+Kª>êì¿/9äÈ’¢ErÀ=‰âpH¿†Ç:XŽõöêë«ë7�cÅ"	Ci­÷Väˆ8­(ñDèZë�õÑŽKéEadß”Å'Çñ]­K/ŠíöÈÀëzá9ö®ËŠ’?§z|ðßYü¾þñên}õÇ•‚Ëíűˆ=ßÚž®>þîX;XûÑr„Lbë¬)O–HøàÜZ]ýëÊaå�á!`}pˆXH/¶¢ÐŽ9…ë­„Ùe}\Ah?v/ˆíj!û™à-T0Òuû,E‰�;¢iT®¶-‰]Víµ³²hèßÓıó&é2Âw‰ çâK±Xq`¯�YÃÂk•¶Š9i#v§ö¨KÚå,sõú­|r'ãC´Ì%±·iÃ;»&+xtË�„ïÖÒuEd–SVÃñìt›“»¾§ÏÝÍMèįéç˜Ö»óÂ
ì´V Í�rÙóMDâ1_×�5÷m]V“Ø9£ü²^,AÀªª±;4h
Æò¢³¢å¸:ÕLBðþöŽ…†û\
¯†™´ÝÖ=dݽYÝÑÐ÷ÅDd/ÅăEö›,WKdqýÆ“p‘õÞr�P¸2¦ZÎ߉dº"òCðP“×á¤ÅV±ö:vÀ5p¯Ïê	3QµÛã¦,Ÿ——Û´…褿¥1B3ÙšgŠòEfîfüPî÷fwÚ
+ŠiL¸RÄq4	
+9kØ•*^ödd§äa€8:Þ0ãí/Ú=’Â%¾b÷Þ1wŸÓS•«fŽ—ï	é»Û,kó“çeõµ�Ѿ#PØjEñÝ6ÏTÑ~7±´'‘L
íÏú—*/S1åDÞ¦L!çêÝDM
+†®¸¤ÎRúþÀgë…W–ù¬¹ÜÄŽüvÓ¯G_Êé}YdmoœÒ$Û4õË®­ºö‹Ê”óXNÒ;˜5Î]Ñ¢l	Vÿåk«tuÊ+tž8`�v<û|>/BÇÌ”ÍVlË…¿Ý“Î
½	*SA|ªº<U­Ú½"›QÕŠªVMC`­ÚØKxM{÷]žÉúÝÊ’à#ðhŽ)%9¡(zò¼D=u1U;b±Aªg¢J_¼
@—´ìëCfêLÛ*­ý7•ûpÖ¦7y¶E%8Ð�ˆ›\¥ìÑÚoœç&æVª˜Di­*¸gÒ%55jßWJ&ÓN¤:8†|;Vè"(=¤¦Š|dúªÕ»Ó*ÝdyÖBmì/Bk	ö=\¬cMÛC˃Ëw£X[Eÿ”ÔZÓm×Òm·uÓªŠ\ëDè�ô´Þ	y91üü�³,fY‹0é“n9“h¾HbÏÐ̱A‚à˜¸_cþ?˜|M“HxP÷˜F;o¦uÓHŒ€´.;íl0wžʘÛs(sñ�€SŸaš'dÝA߆غ5„ÌŠ]×*¦$Xdßï)Ü$q2É1êÁ–ž+Ç
ü§yY(s?x¡}ÎÚc©3‡�b ,ºªÂH€¢ÓòŽÒ$/l�,Et
sÙ(úR‹‚ÕAnèK%#Ïñž‡çÐè�ÊiÓ¨“.&ù3i‘ƒAºôÀ|·åŽ!¨h	gl‚ß¼ p­r;z÷·ÏzI¬èoE“k	Í
+O–�~‚F?ò†qï¹"èÃþضUóÃõõ
LØm 4Ÿ®ÁVEV\“„åöä\oòrs}‚d¿nêí`ApV×)4iÀ^Â�ºî%i�
*o@‚
+=
ß�#-—~‹Pd¾†V£‚9‰m`œAlë’×ÎL¯Ø/43aàb­Núføs
vW„ë#`OÇoÌbú
Ä3b©`æ
„ÛË&=oà8€Å:üOŸËp
?£×DgnLbûa˜:hƒ[?92jh…üH5r# 0N.Í?w'¸H=XÃT#¨*›vùG—mwbŒÙÅžLgš8é`Ò6%Ñõm?ÀdV­Qbû
!Éø!o¾TsÀÞâurÌŒX¤žIžŸðàÏÅ·Ø°Cïù0HùZ;-'=$Ž™ÜKà"µ“S
+VϺéÑEÁs,é(lkØŸ!ðrÝÊàr¡ÚQ|b®ÇÆ°žîuƒER–�µ´Ø@ÑËw#©LZ2AŒ VFæáT¢¶i²vì%¨°ìqƒÁPo„®š“ÖÉL:”|¶f2íÈu�”MQÎ.¼0¹\$)a©·cAŒ»ÁLø�pšÚð$Ú˜3¡¥@eê— |SžAÿ\¿G�®°ü¼€dŠª…z�ᆧ‡û`MÝ,аÿ4HÛ©åB•Ï†
øn×ûÀ…~�ª¦FW#ѽ€©ª%î|ýQKŠÿ­iÚôhk83;îS›9c¤¦{·¸_ûÅ$’p!™<ÑpZ@¡�&“ƒA	±ÁÿíŠ-ŸTt*±ñGàQßÔ½à?²ß_z~ÝÔQ&Ĩ›GÜ÷ï‡5N&þ³º[¯ï~KkUʱª¦áé”ñ\BÜ$ˆJO£A£&ô¦ÔÇtoœ2hÂyé 
¸ë¾ Š²Ãi“à™"�òðÓ¨vÙ™ñ_ú&d¥kì­M7#qH£ßå¤g~…ö�¦>X�7Žä”9ƒã΄(~ðsh°Áï Œà¯ïK]D¤äwFÀe•iQéë~Š7qNBGù@ˆt·ãy%íGTñ̹{}¢>
åΔi‰†8f8n Å);[³¯|š³–¸¶´­B|:ê£3Œl7ñ„ÆÂnsá2„ìà2�–4ãK
Ì~.÷Bˆ½¿½{Eh
+¸06C7,š¡›ðŠ§úp0E!Õ°–Ïœot„Ø�8ï̓C{â}l./€žÃ‰¨¿Éæ^\f“dØÎ=˜�p¤û¿¼—›GþPxQèëé*ðEøðaȉÿVªNi:À× s?|[jc=ƒ³ñž-¦:þ�)'ý
+endstream
+endobj
+2938 0 obj
+<<
+/Type /Page
+/Contents 2939 0 R
+/Resources 2937 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2899 0 R
+/Annots [ 2936 0 R 2950 0 R ]
+>>
+endobj
+2936 0 obj
+<<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [185.472 556.022 525.406 566.497]
+/Subtype/Link/A<</Type/Action/S/URI/URI(https://github.com/pornin/x25519-cm0/blob/main/src/x25519-cm0.S)>>
+>>
+endobj
+2950 0 obj
+<<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [69.87 543.959 77.84 554.541]
+/Subtype/Link/A<</Type/Action/S/URI/URI(https://github.com/pornin/x25519-cm0/blob/main/src/x25519-cm0.S)>>
+>>
+endobj
+2940 0 obj
+<<
+/D [2938 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+2941 0 obj
+<<
+/D [2938 0 R /XYZ 70.866 771.024 null]
+>>
+endobj
+2942 0 obj
+<<
+/D [2938 0 R /XYZ 70.866 743.233 null]
+>>
+endobj
+2943 0 obj
+<<
+/D [2938 0 R /XYZ 70.866 723.201 null]
+>>
+endobj
+2945 0 obj
+<<
+/D [2938 0 R /XYZ 70.866 703.383 null]
+>>
+endobj
+2946 0 obj
+<<
+/D [2938 0 R /XYZ 70.866 683.458 null]
+>>
+endobj
+2947 0 obj
+<<
+/D [2938 0 R /XYZ 70.866 663.532 null]
+>>
+endobj
+2948 0 obj
+<<
+/D [2938 0 R /XYZ 70.866 631.652 null]
+>>
+endobj
+2937 0 obj
+<<
+/Font << /F50 2307 0 R /F43 2258 0 R /F23 2944 0 R /F26 2949 0 R /F72 2883 0 R /F25 2885 0 R /F22 2886 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+2974 0 obj
+<<
+/Length 759       
+/Filter /FlateDecode
+>>
+stream
+xÚí˜]o›0†ïù¾„`v¹´IWõb[2iRTU”¸
j
+,8ëòïgc§MZRR5“¶)7øŸ—c?:Ç6܆Z—�0S5ÅÐû8öz.Ž!K8ã Œ9\P	ÆS0ñû³´Rr„„Ä>
.ÇçÏtB E11"„œ@.k’ªÔ�Ôb™©åBÚæ§b*Œý_-šk�{†&0Á˜9mí#�b«M!BŒZEl|¥6º½ADAΩ³§räæv&g´Uº®¨™«Lk¥g�™¿–m:r5³µkû6—7ÎPÖ™ëªT^õ;Áç0ôƒ…i˜Êסp±  $Œ	¶.)ŠüU¥Ê-@Œ£„Ä1ÇjcpãKVJºë—j›‹®ù0c¶àÝ-þVƒ¿[Ú®ê“G	ò1ÝAo'Å°�Ìi¿ÿÅýyZ×Û'hòÿ¤ý[8Ù[q¢m�R^Õ*U˺;GÒ†ãÏ€0¿É :eñÑrêúl„Ê¢6éb³¯’™þ˜éíéÌSéÒ䟄‹2”ØAB©ÔK2}eõ]n¥7f	]6_ÈJ/ ,ìjÚ¾Ò%ìtÝn„CL;¦=~VÕ�ZU²;T>/¯‚üyžYw¦%Ícå¶e#£·zŽ�¹ò�dÅAÈ.¤êÆ:XÙS¼i“¥É‚Ì/Ú#Éšî];ºø èFef"ËƘz&ùB¢5·îVо´y¡wÉ"ÓPÇ�}'÷ä ÜU¾›ZÛøñöøý.B÷‘v"%è HÇ£+}$4çÆ=x^Œ0¤›3rS
5Œãä”û$!¸,òYZϺϳߊÜ]$êtn¹�æö´ÑbDÄ‘ÛkÜÚÏ?§cÝp÷Œ1ˆ(Ù½7¹D`ª_�iƒ‡fà=ˆ…,¢º>#ï‹ý§Æà�müR‹äÜ‘ÊB.ÒÇÛßõÆ1÷¤lrëêÖ€ÔwÅ-Wµ‹¿

®>
+endstream
+endobj
+2973 0 obj
+<<
+/Type /Page
+/Contents 2974 0 R
+/Resources 2972 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2976 0 R
+/Annots [ 2951 0 R 2952 0 R 2953 0 R 2954 0 R 2955 0 R 2956 0 R 2957 0 R 2958 0 R 2959 0 R 2960 0 R 2961 0 R 2962 0 R 2963 0 R 2964 0 R 2965 0 R 2966 0 R 2967 0 R 2968 0 R 2969 0 R 2970 0 R 2971 0 R ]
+>>
+endobj
+2951 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [84.043 476.839 110.72 486.802]
+/A << /S /GoTo /D (structcrypto) >>
+>>
+endobj
+2952 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [513.443 466.587 525.406 475.152]
+/A << /S /GoTo /D (section.5.1) >>
+>>
+endobj
+2953 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [84.043 454.632 143.33 463.403]
+/A << /S /GoTo /D (class_e_c_c_x08_class) >>
+>>
+endobj
+2954 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [513.443 454.632 525.406 463.197]
+/A << /S /GoTo /D (section.5.2) >>
+>>
+endobj
+2955 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [84.043 441.785 124.913 450.937]
+/A << /S /GoTo /D (structee__status) >>
+>>
+endobj
+2956 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [513.443 430.722 525.406 439.286]
+/A << /S /GoTo /D (section.5.3) >>
+>>
+endobj
+2957 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [84.043 418.847 107.967 427.331]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+2958 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [513.443 406.811 525.406 415.376]
+/A << /S /GoTo /D (section.5.4) >>
+>>
+endobj
+2959 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [84.043 393.153 112.45 403.421]
+/A << /S /GoTo /D (structpktype) >>
+>>
+endobj
+2960 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [513.443 383.085 525.406 391.466]
+/A << /S /GoTo /D (section.5.5) >>
+>>
+endobj
+2961 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [84.043 371.027 96.499 379.206]
+/A << /S /GoTo /D (structret) >>
+>>
+endobj
+2962 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [513.443 358.991 525.406 367.555]
+/A << /S /GoTo /D (section.5.6) >>
+>>
+endobj
+2963 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [84.043 347.036 113.087 355.807]
+/A << /S /GoTo /D (class_socket) >>
+>>
+endobj
+2964 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [121.892 335.08 150.936 343.851]
+/A << /S /GoTo /D (class_socket) >>
+>>
+endobj
+2965 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [513.443 335.08 525.406 343.645]
+/A << /S /GoTo /D (section.5.7) >>
+>>
+endobj
+2966 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [84.043 323.206 106.604 331.69]
+/A << /S /GoTo /D (structticket) >>
+>>
+endobj
+2967 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [513.443 311.17 525.406 319.735]
+/A << /S /GoTo /D (section.5.8) >>
+>>
+endobj
+2968 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [84.043 298.323 137.86 307.986]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+2969 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [513.443 287.444 525.406 295.824]
+/A << /S /GoTo /D (section.5.9) >>
+>>
+endobj
+2970 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [84.043 275.385 117.435 283.869]
+/A << /S /GoTo /D (structunihash) >>
+>>
+endobj
+2971 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [513.443 263.533 525.406 271.914]
+/A << /S /GoTo /D (section.5.10) >>
+>>
+endobj
+2975 0 obj
+<<
+/D [2973 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+38 0 obj
+<<
+/D [2973 0 R /XYZ 70.866 771.024 null]
+>>
+endobj
+42 0 obj
+<<
+/D [2973 0 R /XYZ 70.866 570.668 null]
+>>
+endobj
+2972 0 obj
+<<
+/Font << /F67 2878 0 R /F50 2307 0 R /F43 2258 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+2989 0 obj
+<<
+/Length 218       
+/Filter /FlateDecode
+>>
+stream
+xÚ•�»rÂ0E{}Å–RÁfõصÜfH˜ÐePÇP8XÐ3xÌþ>ÂŽÓ¤JµÏ{ç‚#¬ÔsRO¯L±ñ�PF¨j‡b!µ°Õ–Ì.­ÁccÑ�Ûe34f᪨7CÝ×>Oã[×fcYß*õ’ÔEÙ""°¿æ1bt
ö'µÝ´å¶B_Gø?OØ#_úOبwE?�çúÇ“ÉÛÿXÎì‚®’ð`�9”ŠR,GÌUîrß¹�à>Œ#}ŸúåÙxÒ·ûÑ,,éÜ�¼sÀÂý
~Oœ
+endstream
+endobj
+2988 0 obj
+<<
+/Type /Page
+/Contents 2989 0 R
+/Resources 2987 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2976 0 R
+>>
+endobj
+2990 0 obj
+<<
+/D [2988 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+2987 0 obj
+<<
+/Font << /F50 2307 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+3028 0 obj
+<<
+/Length 1137      
+/Filter /FlateDecode
+>>
+stream
+xÚí™KoÛ8€ïþ<JÀšá[Roͳ)ºèîƇn(•%U¢šäß/)Rqü
+ÜT‹vã\,R"Çä|œá‰À
@àl„ú'$ÜÍãlt8œŠàòH`0¹
‚¡@²@€I
+¦ÞÑ,®”¬ý1!¡Çü/“÷+r:!„@ŠBb„ 0Š ²ýO³\ÚÎçE*}Œ½»
Bú!œr0�ÆÜ	Óƒ,´ÂÄþ#„z±Aè}Èe$œ2
+B	A]OÊ¡@nïdíÚg�}Æö‘›î]©¼vòÜÒ2iç²P2µõÏ‘\ºî·™šÙÒ•Væ^&]ÿT6‰{U©¬,š7v«4ô/µ©˜Â?g#€õü
+Æ„Á�`;p•7ø’ÂÙ’@²Œ1†ç¶åŸqVØL>\؆ÔÞÉ8í êòBu×>E^é^'z¤*.T¯žÂͺQv2m¢ÚÚÌÊ=è�9ö±\Ûør˜ÚÖ&V7kúœŽ1‹�G¢-¶‚oÒ¯&qyeÖÀ•^Æú_w@rXr¶¢ÏSŸq¯ö1Ò¯¾æ=²óíY†ƒéä?T÷/#)è`$cyê2™iÃÙ…æ_u™ÈÆÙÇQß?3K"‰•³©£Yg†< ¯$Ÿ"ÉŽ¤Ø@²ÙÕ,·±{küa«f¥sßêÞ¾¯ËÒíÉ–ž�*Íþ`ºô‚áì0Ïô{YËä»"ï‡íð¼¨ZGË�ÙwŸp¯ß±¯ërnKjæH]‚³mg@FöZ84´Féûتbªt!ToFZêò—íÜ¢h?°Á`žò«O�'ÍϽfçÉ.ðÖƒÉÄ’¸¯zHM[U¥sŒÎðÚ"éb_íÙûÝ.ƒ™^^ÞÜèåÏws•ëðLÿ¬¸Ñ\ÈK±Ÿ_�5¢ÌÃh8¬e¢âtçæ£imyÎtb‘w@m¤Òª¬èsÔ±Kl­l—ÓŸ
ú”×ü¡ó¨: ¡]ýÖÈûcá~�»p5—	6ð	ùmɈÁœfõ-Û=á;n“ØiZªþ8A�™2Ö§x„½ÚÛ3©b6˜½Uu©Ê¤ÌŸçDçG-67Yêâ”^ðÚ>¸Hî_>—&~‰3Ì™´+IÚÛ+sReŽU:�»ÃÁؤt÷]ÜSo8ôêÐF(Üc›îp¬)£heîž�_ôž²­\8¹"g[-ãôaÏ{8Y»íWD÷	#Îö	$.QÙ³@®ûÉêqâW˦�WÛ\ýí!q¸‡H‡;L¹íŽ¥vq ÇÒ´,äö±uI÷’%.K�n¸è/@*Y,ì³çíãûDj£¾Sæ‡ÿZÃùË;Ž¢]ìê“n·Nl»ÔÁXˆ×Ðq6†Ávrtô	…«Ð¦&¸‹^–:ÑO3å›oƒN&£o#ìš»+mÎ!¢$óÑô©þô H£Üv
ç€q
+9£ºœƒ‹Ñßözœ#  	{t;Î8ÂyÑ3YÈ:~¸ ¾z”+—�o»ï"OKCÕCü!ì­
+endstream
+endobj
+3027 0 obj
+<<
+/Type /Page
+/Contents 3028 0 R
+/Resources 3026 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2976 0 R
+/Annots [ 2991 0 R 2992 0 R 2993 0 R 2994 0 R 2995 0 R 2996 0 R 2997 0 R 2998 0 R 2999 0 R 3000 0 R 3001 0 R 3002 0 R 3003 0 R 3004 0 R 3005 0 R 3006 0 R 3007 0 R 3008 0 R 3009 0 R 3010 0 R 3011 0 R 3012 0 R 3013 0 R 3014 0 R 3015 0 R 3016 0 R 3017 0 R 3018 0 R 3019 0 R 3020 0 R 3021 0 R 3022 0 R 3023 0 R 3024 0 R 3025 0 R ]
+>>
+endobj
+2991 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [84.043 477.65 117.435 487.107]
+/A << /S /GoTo /D (tls1__3_8h) >>
+>>
+endobj
+2992 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [513.443 466.587 525.406 475.152]
+/A << /S /GoTo /D (section.6.1) >>
+>>
+endobj
+2993 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [84.043 453.74 126.769 463.403]
+/A << /S /GoTo /D (tls__bfibe_8h) >>
+>>
+endobj
+2994 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [513.443 442.677 525.406 451.242]
+/A << /S /GoTo /D (section.6.3) >>
+>>
+endobj
+2995 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [84.043 429.83 149.184 439.286]
+/A << /S /GoTo /D (tls__cert__chain_8h) >>
+>>
+endobj
+2996 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [513.443 418.767 525.406 427.331]
+/A << /S /GoTo /D (section.6.5) >>
+>>
+endobj
+2997 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [84.043 405.919 127.119 415.376]
+/A << /S /GoTo /D (tls__certs_8h) >>
+>>
+endobj
+2998 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [513.443 394.856 525.406 403.421]
+/A << /S /GoTo /D (section.6.7) >>
+>>
+endobj
+2999 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [84.043 382.009 149.597 391.466]
+/A << /S /GoTo /D (tls__client__recv_8h) >>
+>>
+endobj
+3000 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [513.443 370.946 525.406 379.511]
+/A << /S /GoTo /D (section.6.9) >>
+>>
+endobj
+3001 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [84.043 358.099 152.816 367.555]
+/A << /S /GoTo /D (tls__client__send_8h) >>
+>>
+endobj
+3002 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [513.443 347.219 525.406 355.295]
+/A << /S /GoTo /D (section.6.11) >>
+>>
+endobj
+3003 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [84.043 333.377 146.468 343.645]
+/A << /S /GoTo /D (tls__keys__calc_8h) >>
+>>
+endobj
+3004 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [513.443 323.125 525.406 331.69]
+/A << /S /GoTo /D (section.6.13) >>
+>>
+endobj
+3005 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [84.043 309.359 131.934 319.735]
+/A << /S /GoTo /D (tls__logger_8h) >>
+>>
+endobj
+3006 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [508.458 299.215 525.406 307.78]
+/A << /S /GoTo /D (section.6.15) >>
+>>
+endobj
+3007 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [84.043 286.368 133.745 295.824]
+/A << /S /GoTo /D (tls__octads_8h) >>
+>>
+endobj
+3008 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [508.458 275.305 525.406 283.869]
+/A << /S /GoTo /D (section.6.17) >>
+>>
+endobj
+3009 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [84.043 261.646 129.262 271.914]
+/A << /S /GoTo /D (tls__pqibe_8h) >>
+>>
+endobj
+3010 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [508.458 251.578 525.406 259.959]
+/A << /S /GoTo /D (section.6.19) >>
+>>
+endobj
+3011 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [84.043 237.736 139.358 248.004]
+/A << /S /GoTo /D (tls__protocol_8h) >>
+>>
+endobj
+3012 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [508.458 227.484 525.406 236.049]
+/A << /S /GoTo /D (section.6.21) >>
+>>
+endobj
+3013 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [84.043 214.637 118.924 224.093]
+/A << /S /GoTo /D (tls__sal_8h) >>
+>>
+endobj
+3014 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [508.458 203.574 525.406 212.138]
+/A << /S /GoTo /D (section.6.23) >>
+>>
+endobj
+3015 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [84.043 190.726 137.367 200.183]
+/A << /S /GoTo /D (tls__sockets_8h) >>
+>>
+endobj
+3016 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [508.458 179.663 525.406 188.228]
+/A << /S /GoTo /D (section.6.25) >>
+>>
+endobj
+3017 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [84.043 166.816 132.382 176.273]
+/A << /S /GoTo /D (tls__tickets_8h) >>
+>>
+endobj
+3018 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [508.458 155.753 525.406 164.318]
+/A << /S /GoTo /D (section.6.27) >>
+>>
+endobj
+3019 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [84.043 142.906 120.412 152.569]
+/A << /S /GoTo /D (tls__wifi_8h) >>
+>>
+endobj
+3020 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [150.297 131.843 179.341 140.614]
+/A << /S /GoTo /D (class_socket) >>
+>>
+endobj
+3021 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [508.458 131.843 525.406 140.407]
+/A << /S /GoTo /D (section.6.29) >>
+>>
+endobj
+3022 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [84.043 118.995 126.904 128.452]
+/A << /S /GoTo /D (tls__x509_8h) >>
+>>
+endobj
+3023 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [508.458 107.932 525.406 116.497]
+/A << /S /GoTo /D (section.6.31) >>
+>>
+endobj
+3024 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [84.043 95.977 128.392 104.748]
+/A << /S /GoTo /D (_e_c_c_x08_8h_source) >>
+>>
+endobj
+3025 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [508.458 95.977 525.406 104.542]
+/A << /S /GoTo /D (section.6.33) >>
+>>
+endobj
+3029 0 obj
+<<
+/D [3027 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+46 0 obj
+<<
+/D [3027 0 R /XYZ 70.866 771.024 null]
+>>
+endobj
+50 0 obj
+<<
+/D [3027 0 R /XYZ 70.866 570.668 null]
+>>
+endobj
+3026 0 obj
+<<
+/Font << /F67 2878 0 R /F50 2307 0 R /F43 2258 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+3047 0 obj
+<<
+/Length 209       
+/Filter /FlateDecode
+>>
+stream
+xÚ•�1o1…÷ü
+�É€±“8É­ÁV‘
1”^Š*Á¡"$àß7S'?ÙÏOï#ØÁL½e5ž
+AÂ&ù"a
+
bc10äVš­Yçx¶è8Ö¿~;ýÙ3²1éy×â/7›zÏêWquð3-%LÖÃ×^­Öm½-€Ð5	νs^ŠwUï`©>=ó%SÉñ"Ø€6ƒõâQÄ׉¡Fö\³Ò•ãç©´w¸�±¤¯w=9GúrÝš“.]Ï;¬Ü(‚JŸ
+endstream
+endobj
+3046 0 obj
+<<
+/Type /Page
+/Contents 3047 0 R
+/Resources 3045 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2976 0 R
+>>
+endobj
+3048 0 obj
+<<
+/D [3046 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+3045 0 obj
+<<
+/Font << /F50 2307 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+3064 0 obj
+<<
+/Length 704       
+/Filter /FlateDecode
+>>
+stream
+xÚµVMoœ0½ó+,õ‡ulƒmˆªJm7%iMVU«mpvQ	¤àM›_AJ>”´'X3óÞ›ö
¬
‡ê®�P}«/‡Þ»¥··`àÒ„a°¼Á˜1Àx#ÎÀ2+ÿý&½‘¢	f„Ä>
ΗÇ#BQL43F ã‰ÍŸ§2µÉg²ÙfrÛûs^gÛkQÉTu5�Û©Þ[P0�	ÆÔá+�,Š->…8˜a„�Ÿ5úÆ¿»‘µbࡽ?W�z(QeB³í-¢Ä0a,t¨!…¹ª5V¸‹•Õ•�:úå[©é¨ïJ2ˆœ€D!æIc‚-â«¢ÊÊmî"I¸ICÈ“X%˜À×Xò(édÙâ‹n&�"n]à¡Û‡ WCÖ!ªE	Yf�ˆ†ƒ)©º…(óÖΣŸÀ U˜AsW�MÿF¤€ÕŒRæ_ÖuéΕÐè‡úæÔDhº4“Åm@¨/ù=Žê¢ž=}„(Û¤ÍÃDßÇiúpuoŽ¿üpvññí—‹“û_GÉþùð S‰_ªRõbJ&&÷Þ×–I-¡Îdš?ªYOžþ�ÔGŸÿ1÷¶j‹u’§Ñ7"«›üE/dQɇ'Ýn)žWåS)dº.E5ú+�ÝÀý™�D½¥ö¦:2-J‘[s˜‹6kŠ›Î±'<øƒyž‡õ¡¿•§Ì•“5^%f Œcµ@èJ_¡q ?Îaž(ÇxÙŒ™E£kÚßßÍ7b×ú�ª¼ÈR)Z«¶¸²Wµ‰úiÝæp“º¨K!ÜQo‘
+bøR,½vswË›RˆB²kouŽ@®«�ªýòÓ^ƒHíªô"P‚3ï“ýPýb�pí|Dj!2·E%#ÀªˆÒÝußÌônmÖïè…S
þ¥
+endstream
+endobj
+3063 0 obj
+<<
+/Type /Page
+/Contents 3064 0 R
+/Resources 3062 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2976 0 R
+/Annots [ 3049 0 R 3050 0 R 3051 0 R 3052 0 R 3053 0 R 3054 0 R 3055 0 R 3056 0 R 3057 0 R 3058 0 R 3059 0 R 3060 0 R ]
+>>
+endobj
+3049 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [114.215 411.749 139.403 420.233]
+/A << /S /GoTo /D (structcrypto_a6da27ddf35821286af88c12267678a37) >>
+>>
+endobj
+3050 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [114.708 398.901 121.184 407.282]
+/A << /S /GoTo /D (structcrypto_a835f82f1bfdf28071da4f1ca521c532c) >>
+>>
+endobj
+3051 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [124.177 397.825 189.955 407.488]
+/A << /S /GoTo /D (tls1__3_8h_adf01762e375d30f644666e9fe3be27c1) >>
+>>
+endobj
+3052 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [114.708 385.95 123.175 394.331]
+/A << /S /GoTo /D (structcrypto_aee54e28a2fe73a7f1bafd7c946430a22) >>
+>>
+endobj
+3053 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [94.777 372.895 118.7 381.379]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+3054 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.2 372.998 127.173 381.379]
+/A << /S /GoTo /D (structcrypto_a1f0f21608efdefa091958c6abe36bf1b) >>
+>>
+endobj
+3055 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [94.777 359.944 118.7 368.428]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+3056 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.2 360.047 129.666 368.428]
+/A << /S /GoTo /D (structcrypto_a3189c7dd2fe6c3cbc1ffd41720977175) >>
+>>
+endobj
+3057 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [94.777 345.1 133.154 355.476]
+/A << /S /GoTo /D (tls1__3_8h_a42d4f54d23f86205a1fa590480181e0f) >>
+>>
+endobj
+3058 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.654 346.992 161.057 355.476]
+/A << /S /GoTo /D (structcrypto_aabf86e64107fd26ecb2862fc6bb7ad00) >>
+>>
+endobj
+3059 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.737 334.041 127.666 342.525]
+/A << /S /GoTo /D (structcrypto_a0bc6e38c10da4705f3a21596e66b6ceb) >>
+>>
+endobj
+3060 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.737 319.197 133.154 329.573]
+/A << /S /GoTo /D (structcrypto_a6f2d937a4ddb574df6aebadd72af0102) >>
+>>
+endobj
+3065 0 obj
+<<
+/D [3063 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+54 0 obj
+<<
+/D [3063 0 R /XYZ 70.866 771.024 null]
+>>
+endobj
+2977 0 obj
+<<
+/D [3063 0 R /XYZ 70.866 570.668 null]
+>>
+endobj
+58 0 obj
+<<
+/D [3063 0 R /XYZ 70.866 570.668 null]
+>>
+endobj
+3066 0 obj
+<<
+/D [3063 0 R /XYZ 70.866 451.617 null]
+>>
+endobj
+62 0 obj
+<<
+/D [3063 0 R /XYZ 70.866 304.953 null]
+>>
+endobj
+66 0 obj
+<<
+/D [3063 0 R /XYZ 70.866 231.153 null]
+>>
+endobj
+3067 0 obj
+<<
+/D [3063 0 R /XYZ 70.866 186.328 null]
+>>
+endobj
+70 0 obj
+<<
+/D [3063 0 R /XYZ 70.866 159.133 null]
+>>
+endobj
+3068 0 obj
+<<
+/D [3063 0 R /XYZ 237.87 89.592 null]
+>>
+endobj
+3062 0 obj
+<<
+/Font << /F67 2878 0 R /F50 2307 0 R /F43 2258 0 R /F72 2883 0 R /F23 2944 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+3089 0 obj
+<<
+/Length 669       
+/Filter /FlateDecode
+>>
+stream
+xÚµUMSÛ0½ûWèh"$Y’�ÜhL	=´ñtÚ	ca{HlêÈ|üû®,…8Ò™^"KÚÕ¾÷v³KPŽ:ó>%ÞÑ© (ÆC)C”Ü¢ˆàXJ
–%s4ó)®’s2Ž	�À¯;§:
,Šý©nÚL·�²Ûq�µKUéT—ue<½“ÄûíQp$ˆ¾ˆc3Ž²¥7»"hwçˆàp£ÇÎr‰¸±à!|/ÐÔû摽 %Åd�Z`ŠfÁ€Bü;äè4b(ÂÈPãEÐ ¤ü:û¬H›` Á6kžïu=ÝÍ:ôv“;üßÏ<°N.¦×_�^ON~9#‹
®®l(¾
¡@=É„�u|r<¶be3$¾	˜”ø�ùIï‹2³÷“€_LìÁM÷­ÕÊFÙ’Á☋¾¡S |x_1|OƒòaFÙ.FòPF_~ü#îˆLÞÉÊnju¦Óù«Tm1�ì'ùW2Ò•]_ÿáx€ÿ…ˆ}w7“u>J€÷	HG QYÝ5æqÚjUæUÈvQé"Ì÷ÓÉÚ¦�Žc¹8§î»2Å×.oTc÷»èÚÕ kYe•5Êô,õa"'ª-µÚÛ\J®Ï¬ç¶«Q|.ï‹5öéÆe‘ÅôhP _¨êpŒ:Ýø홊 Í-ÌUåºè&Æ«,%…“{¾5!º£ÛzFí˜ê¢tu¹ÒpD…óÅ<°[Wm®*eÛ‹Iœ}§©—ëGTÿéÅ¢6®�eåp^Âj´]~Tâ(Ž@ø›Gï’1±eõÖ@!}½XÑ믬íúÖ“�2׳ObIn’ÁÇBpX!“Né3#ÌF”›^Ë×FŽ§ç܈oÓÛÇøò°ôI
+endstream
+endobj
+3088 0 obj
+<<
+/Type /Page
+/Contents 3089 0 R
+/Resources 3087 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2976 0 R
+/Annots [ 3061 0 R 3077 0 R 3078 0 R 3079 0 R 3080 0 R ]
+>>
+endobj
+3061 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [141.601 727.357 196.196 735.144]
+/A << /S /GoTo /D (tls1__3_8h_adf01762e375d30f644666e9fe3be27c1) >>
+>>
+endobj
+3077 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [69.87 536.022 95.773 543.235]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+3078 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [69.87 439.892 95.773 447.105]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+3079 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [69.87 342.658 110.119 350.975]
+/A << /S /GoTo /D (tls1__3_8h_a42d4f54d23f86205a1fa590480181e0f) >>
+>>
+endobj
+3080 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [94.777 68.794 128.169 78.251]
+/A << /S /GoTo /D (tls1__3_8h) >>
+>>
+endobj
+3090 0 obj
+<<
+/D [3088 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+74 0 obj
+<<
+/D [3088 0 R /XYZ 70.866 771.024 null]
+>>
+endobj
+3070 0 obj
+<<
+/D [3088 0 R /XYZ 195.317 716.731 null]
+>>
+endobj
+78 0 obj
+<<
+/D [3088 0 R /XYZ 70.866 687.562 null]
+>>
+endobj
+3071 0 obj
+<<
+/D [3088 0 R /XYZ 188.879 620.601 null]
+>>
+endobj
+82 0 obj
+<<
+/D [3088 0 R /XYZ 70.866 591.432 null]
+>>
+endobj
+3072 0 obj
+<<
+/D [3088 0 R /XYZ 124.654 524.471 null]
+>>
+endobj
+86 0 obj
+<<
+/D [3088 0 R /XYZ 70.866 495.41 null]
+>>
+endobj
+3074 0 obj
+<<
+/D [3088 0 R /XYZ 118.216 428.342 null]
+>>
+endobj
+90 0 obj
+<<
+/D [3088 0 R /XYZ 70.866 401.064 null]
+>>
+endobj
+3075 0 obj
+<<
+/D [3088 0 R /XYZ 241.699 332.212 null]
+>>
+endobj
+94 0 obj
+<<
+/D [3088 0 R /XYZ 70.866 304.934 null]
+>>
+endobj
+3076 0 obj
+<<
+/D [3088 0 R /XYZ 122.691 236.082 null]
+>>
+endobj
+98 0 obj
+<<
+/D [3088 0 R /XYZ 70.866 207.02 null]
+>>
+endobj
+2978 0 obj
+<<
+/D [3088 0 R /XYZ 70.866 61.911 null]
+>>
+endobj
+3087 0 obj
+<<
+/Font << /F50 2307 0 R /F72 2883 0 R /F43 2258 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+3116 0 obj
+<<
+/Length 1529      
+/Filter /FlateDecode
+>>
+stream
+xÚÍYYoÛF~ׯ P �€h³÷.‹¢@êÄ	¸Hc¡-àM®e"©’T÷×w–‡,)«ÃѪè‹Mñ˜�ï›Ù9vp0
pðzðëdðü\à@£PJLn…‘–2P!E’“$¸
+DGcªôðÕÙÙ_XŸeQUµ7V.?˜ÛÁCSš<6£O“·
ç	Å`�F
+öîàÕdð÷€ÀM�åbZ#MyÏWŸp�À³·
F,ÔÁ}óæ,à„q+,.¿ðBQHˆXE 	ÂkÆøiZÑ)J+c&@ÚJ}¿¸±ïgiÜ~af7¦l¯Ïy\§E^5¨{uŸŸ†G²‰DJ«`L)R’·B?R*6¾Y3¨#	íY]…Ó(¼&( áÒ±À“¡xxoÕ.þLKÓ*ûã½½$bø¬ý½HóZ_×í�(IJSUð5YÓ++‚B,‚1�¯Ý¢~p5ÖŒAâ’ÑG
øŠ‹Ü˜iš;`P‰8–«0Êpx_…�2l·2_FT‹4qi"FE¿–ɇ>D#Îø>}”uäT¦L£ì·Eãbßê$B¤Â5Žº…ì>+§Ý†û`—ÞŒÀj³©Šµv•_ÁNÑbøÉ�ISÄä�_Ö°À¥Ò|êÀÆ$’Àΰ‰=|‡à$‚ÆwV¸•Âäöë”Qž3‡:˜¢«ê4òúfÑW‡nR NÙa¼�P·4ïö÷“ôõà»OP÷û¼6‰ê¨÷Ûc•þc#šéÃXfòi}ç+
+¹8Ì8‡€�ÚL‘ÔQmÞ—é«7\¾kÔ±Lh�´Xc®Õ"ÉŠúÙV^šWvq3_4O!K½qP¬yuÇ&'ÂõÖ×	YæÌ=|@BçêÿÁ¤|z"ÿ¸¼‹J“ì¡BÂúü?§â¹U‡ê0zC„Cå�_'UôÇHØB.½u* �éU>c¨Óêï‡;ƒò(šš�t¤Ð*�æQ½(=‹“¶�÷ÚEq
+�9ÀÄ—€È•ÒëEê†{û€ý�‰üÙÅ•R8âЂxsé؆̻(³9¬�¡ÝÒ‚ŸÎ­]uÔ\Tùó‘ÈT¯ò¸l >Ìk×ÖÅÐç…ÇmÜ+bûïó®]À=@øúüµTBÄCý^CVñàæov¹w¹™{îû.ß¼ BºšXŒ¨÷TÿP.héÑN�Jo.^ØvæN!!Û^ž¸<	ªâ�³Å<±åÃVÒRRyŽ
+{‰Â’Ë$1î1­çÉV´6¡}üæ)MµÈêÝIQ‡­ø4P§5!tGGÄ‹§QçÁJíàúJÂŽw`0<üºšBZK^q_¦;¶6ô«Ÿ›Û+\ˆC¤•ôlLˆ›®ÄaDÊSt?û÷ƒ«ä�„…þ�·¶vCç1¡N\6ýùsø¾3®ÓV†a½'ÿ†¨ÏèҘ嬀¼†ét
�zZäîS
+²Þ»x´†³Yæ�×=†»ñ€	%˜��³ òVz¿rÍ’pž)7õ­$"Cg*XGòä®›•$E¼˜™¼n¹jnÝÚ(ZtƒŸú.íÆIñãdéÞžíDÝ�©=û±pI'¡,fýçfUh–öÓû´?°µ–ÊLõÓ:%ËARêíÄ	!»‘º[†÷ûÔÊÇñ|þ8{½�{=8·ñ¡½±nôf̵íN
—u¹ˆë­“·5kÙÁ›†ËyÁhô4sœ~âfšÎ‘5�cÏk—ßL^5£¸•{s·&¬žCé2‡ÿ¦› )@#i?ñ[Îý�æq¶H:)[y"�
+—aêg‡,…_ö1uV‘kÖZaC‡r‚.[Á_\ƒÈæÔŒI
´X‹wF{	Û«›>¦&K=²ÝF¿)ŠlwH3Q;ìÉ®a��È0Z“ó�—½`”ÍóÝKÐc—Øp²ë<š™£šE_¯oÛÐ0½Îðhó¯sQת^ÌÈSÆèýø\"ÚøørzÎ’ð¯Áóº;«îöTàÛë—E³™ú3í5UAÅ
›t¨Ú
+endstream
+endobj
+3115 0 obj
+<<
+/Type /Page
+/Contents 3116 0 R
+/Resources 3114 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3149 0 R
+/Annots [ 3081 0 R 3082 0 R 3083 0 R 3084 0 R 3085 0 R 3086 0 R 3091 0 R 3092 0 R 3093 0 R 3094 0 R 3095 0 R 3096 0 R 3097 0 R 3098 0 R 3099 0 R 3100 0 R 3101 0 R 3102 0 R 3103 0 R 3104 0 R 3105 0 R 3106 0 R 3107 0 R 3108 0 R 3109 0 R 3110 0 R 3111 0 R 3112 0 R 3113 0 R ]
+>>
+endobj
+3081 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [172.011 661.734 190.77 672.002]
+/A << /S /GoTo /D (tls1__3_8h_ab8ef12fab634c171394422d0ee8baf94) >>
+>>
+endobj
+3082 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [147.587 610.884 166.347 621.152]
+/A << /S /GoTo /D (tls1__3_8h_ab8ef12fab634c171394422d0ee8baf94) >>
+>>
+endobj
+3083 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [228.964 598.171 247.724 608.44]
+/A << /S /GoTo /D (tls1__3_8h_ab8ef12fab634c171394422d0ee8baf94) >>
+>>
+endobj
+3084 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [226.059 585.459 244.819 595.727]
+/A << /S /GoTo /D (tls1__3_8h_ab8ef12fab634c171394422d0ee8baf94) >>
+>>
+endobj
+3085 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [229.637 572.746 248.396 583.015]
+/A << /S /GoTo /D (tls1__3_8h_ab8ef12fab634c171394422d0ee8baf94) >>
+>>
+endobj
+3086 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [298.678 572.746 317.438 583.015]
+/A << /S /GoTo /D (tls1__3_8h_ab8ef12fab634c171394422d0ee8baf94) >>
+>>
+endobj
+3091 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [188.518 560.034 207.277 570.302]
+/A << /S /GoTo /D (tls1__3_8h_ab8ef12fab634c171394422d0ee8baf94) >>
+>>
+endobj
+3092 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [279.706 560.034 298.465 570.302]
+/A << /S /GoTo /D (tls1__3_8h_ab8ef12fab634c171394422d0ee8baf94) >>
+>>
+endobj
+3093 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [371.395 560.034 390.155 570.302]
+/A << /S /GoTo /D (tls1__3_8h_ab8ef12fab634c171394422d0ee8baf94) >>
+>>
+endobj
+3094 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [198.927 547.321 217.687 557.59]
+/A << /S /GoTo /D (tls1__3_8h_ab8ef12fab634c171394422d0ee8baf94) >>
+>>
+endobj
+3095 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [266.193 547.321 284.953 557.59]
+/A << /S /GoTo /D (tls1__3_8h_ab8ef12fab634c171394422d0ee8baf94) >>
+>>
+endobj
+3096 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [179.991 534.609 198.75 544.877]
+/A << /S /GoTo /D (tls1__3_8h_ab8ef12fab634c171394422d0ee8baf94) >>
+>>
+endobj
+3097 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [163.135 521.896 181.894 532.165]
+/A << /S /GoTo /D (tls1__3_8h_ab8ef12fab634c171394422d0ee8baf94) >>
+>>
+endobj
+3098 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [149.587 509.184 168.346 519.452]
+/A << /S /GoTo /D (tls1__3_8h_ab8ef12fab634c171394422d0ee8baf94) >>
+>>
+endobj
+3099 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [199.915 509.184 218.675 519.452]
+/A << /S /GoTo /D (tls1__3_8h_ab8ef12fab634c171394422d0ee8baf94) >>
+>>
+endobj
+3100 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [201.905 471.046 220.664 481.314]
+/A << /S /GoTo /D (tls1__3_8h_ab8ef12fab634c171394422d0ee8baf94) >>
+>>
+endobj
+3101 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [164.534 458.334 183.293 468.602]
+/A << /S /GoTo /D (tls1__3_8h_ab8ef12fab634c171394422d0ee8baf94) >>
+>>
+endobj
+3102 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [188.455 445.621 207.215 455.889]
+/A << /S /GoTo /D (tls1__3_8h_ab8ef12fab634c171394422d0ee8baf94) >>
+>>
+endobj
+3103 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [278.163 445.621 296.923 455.889]
+/A << /S /GoTo /D (tls1__3_8h_ab8ef12fab634c171394422d0ee8baf94) >>
+>>
+endobj
+3104 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [167.528 432.909 186.288 443.177]
+/A << /S /GoTo /D (tls1__3_8h_ab8ef12fab634c171394422d0ee8baf94) >>
+>>
+endobj
+3105 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [169.519 420.196 188.278 430.464]
+/A << /S /GoTo /D (tls1__3_8h_ab8ef12fab634c171394422d0ee8baf94) >>
+>>
+endobj
+3106 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [181.479 407.483 200.239 417.752]
+/A << /S /GoTo /D (tls1__3_8h_ab8ef12fab634c171394422d0ee8baf94) >>
+>>
+endobj
+3107 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [207.391 394.771 226.151 405.039]
+/A << /S /GoTo /D (tls1__3_8h_ab8ef12fab634c171394422d0ee8baf94) >>
+>>
+endobj
+3108 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [218.331 369.346 237.09 379.614]
+/A << /S /GoTo /D (tls1__3_8h_ab8ef12fab634c171394422d0ee8baf94) >>
+>>
+endobj
+3109 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [192.419 356.633 211.178 366.902]
+/A << /S /GoTo /D (tls1__3_8h_ab8ef12fab634c171394422d0ee8baf94) >>
+>>
+endobj
+3110 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [114.215 106.12 158.205 116.388]
+/A << /S /GoTo /D (structee__status_af739e2a3db47b5289fc682ede5f6ab7b) >>
+>>
+endobj
+3111 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [114.215 93.408 133.154 103.676]
+/A << /S /GoTo /D (structee__status_abddddbbc0d2fe27635c66bbadde390b9) >>
+>>
+endobj
+3112 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [114.215 81.506 168.57 89.363]
+/A << /S /GoTo /D (structee__status_af4d9d88c2dda22baed16d27b7c4b42fb) >>
+>>
+endobj
+3113 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [114.215 67.875 182.898 78.457]
+/A << /S /GoTo /D (structee__status_abbd2cf161b15371a36fbe760588b2b2b) >>
+>>
+endobj
+3117 0 obj
+<<
+/D [3115 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+102 0 obj
+<<
+/D [3115 0 R /XYZ 70.866 771.024 null]
+>>
+endobj
+3118 0 obj
+<<
+/D [3115 0 R /XYZ 70.866 739.467 null]
+>>
+endobj
+3119 0 obj
+<<
+/D [3115 0 R /XYZ 95.773 714.711 null]
+>>
+endobj
+3120 0 obj
+<<
+/D [3115 0 R /XYZ 95.773 701.998 null]
+>>
+endobj
+3121 0 obj
+<<
+/D [3115 0 R /XYZ 95.773 689.285 null]
+>>
+endobj
+3122 0 obj
+<<
+/D [3115 0 R /XYZ 95.773 676.573 null]
+>>
+endobj
+3123 0 obj
+<<
+/D [3115 0 R /XYZ 95.773 663.86 null]
+>>
+endobj
+3124 0 obj
+<<
+/D [3115 0 R /XYZ 95.773 651.148 null]
+>>
+endobj
+3125 0 obj
+<<
+/D [3115 0 R /XYZ 95.773 638.435 null]
+>>
+endobj
+3126 0 obj
+<<
+/D [3115 0 R /XYZ 95.773 625.723 null]
+>>
+endobj
+3127 0 obj
+<<
+/D [3115 0 R /XYZ 95.773 613.01 null]
+>>
+endobj
+3128 0 obj
+<<
+/D [3115 0 R /XYZ 95.773 600.298 null]
+>>
+endobj
+3129 0 obj
+<<
+/D [3115 0 R /XYZ 95.773 587.585 null]
+>>
+endobj
+3130 0 obj
+<<
+/D [3115 0 R /XYZ 95.773 574.873 null]
+>>
+endobj
+3131 0 obj
+<<
+/D [3115 0 R /XYZ 95.773 562.16 null]
+>>
+endobj
+3132 0 obj
+<<
+/D [3115 0 R /XYZ 95.773 549.448 null]
+>>
+endobj
+3133 0 obj
+<<
+/D [3115 0 R /XYZ 95.773 536.735 null]
+>>
+endobj
+3134 0 obj
+<<
+/D [3115 0 R /XYZ 95.773 524.023 null]
+>>
+endobj
+3135 0 obj
+<<
+/D [3115 0 R /XYZ 95.773 511.31 null]
+>>
+endobj
+3136 0 obj
+<<
+/D [3115 0 R /XYZ 95.773 498.597 null]
+>>
+endobj
+3137 0 obj
+<<
+/D [3115 0 R /XYZ 95.773 485.885 null]
+>>
+endobj
+3138 0 obj
+<<
+/D [3115 0 R /XYZ 95.773 473.172 null]
+>>
+endobj
+3139 0 obj
+<<
+/D [3115 0 R /XYZ 95.773 460.46 null]
+>>
+endobj
+3140 0 obj
+<<
+/D [3115 0 R /XYZ 95.773 447.747 null]
+>>
+endobj
+3141 0 obj
+<<
+/D [3115 0 R /XYZ 95.773 435.035 null]
+>>
+endobj
+3142 0 obj
+<<
+/D [3115 0 R /XYZ 95.773 422.322 null]
+>>
+endobj
+3143 0 obj
+<<
+/D [3115 0 R /XYZ 95.773 409.61 null]
+>>
+endobj
+3144 0 obj
+<<
+/D [3115 0 R /XYZ 95.773 396.897 null]
+>>
+endobj
+3145 0 obj
+<<
+/D [3115 0 R /XYZ 95.773 384.185 null]
+>>
+endobj
+3146 0 obj
+<<
+/D [3115 0 R /XYZ 95.773 371.472 null]
+>>
+endobj
+3147 0 obj
+<<
+/D [3115 0 R /XYZ 95.773 358.76 null]
+>>
+endobj
+2979 0 obj
+<<
+/D [3115 0 R /XYZ 70.866 263.88 null]
+>>
+endobj
+106 0 obj
+<<
+/D [3115 0 R /XYZ 70.866 254.706 null]
+>>
+endobj
+3148 0 obj
+<<
+/D [3115 0 R /XYZ 70.866 145.715 null]
+>>
+endobj
+3114 0 obj
+<<
+/Font << /F50 2307 0 R /F43 2258 0 R /F72 2883 0 R /F23 2944 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+3161 0 obj
+<<
+/Length 751       
+/Filter /FlateDecode
+>>
+stream
+xÚ�Ußo›0~篰´—ðÇ6þ
Õ4iS×JÕ4mmÞÚ*rÁI�d@Öæ¿ß›²´Ró„m|ßÝ÷ÝùŽ "è:ø6fW‚ 'RFh¾DŠàXJ¤†%EóÝO¨ç7(bªÀ®;½Ô­§LÅ“»¶Þ¥í®6n{Y¥»�)[ÝæUi-ƒïóàO@Á� zpÇ8f¥›àþ‘ þÝ ‚£$FÏÝÍ
â"‚G°.Ð]ð; GAS‚•Hä0jI1éÃ8Â4œRBÈäÒ´:/Læ#4MZçÛ>¾Ù8yU€ iDq,¸ƒiLN#2ù21±k‹`ÊÔ�î·m�jBØ¿´¦l·žmMêÔhfµi¶ð5�s<f
ž9ä÷l	0Oà*7Eö†¾GEqBÅå „ÑuR1Ù/2›¿ÎZ1¤p¢²÷ÖOUU„Si-Í¢
Ÿ»æâ‚
ŽåƒB‰™³oA&p·óµ‘/½.Ú�{·ÏŤÓÔtšž$ÆÉ8¿ì �.¶å;tø;t^MO¡ï2ùúã×Ïó"�|ä]�Q(0S/J½1g²˜1Âdzr²Ô;À³rOp£_ËZ‡Àqµ(L¹j×gžG£|œ'À¸Å²¶Aé•ÛyÐnmß)¼ZGö¸æk˜�ž¢ƒ´/¾òÚµëÜ7‚¦%mÝÁ³}…Úÿ]™Ò¸PÝdYW›Ä¡‹¢²¦ÏyéÃ~ „æ¢ë´}‹DTb+�”a•¸¨£K®×+ߘoÁì~*„œ´EC^�n»fÅ ±ØβDÓÞW˜ÑCâû¤WÐò²á|pë[³´<M
ô�:�–D:¼;Ý‘6}R¶�—±Þ•Ï©î÷Ö/>ÔWÈLþ_Ÿò2-v™�Eƒ‹0uL!?æ>Ÿ€RXñ¤¿b-:§
^Ÿ@ƒV¬"Ú_þ2’ôÔ\¸ÿ�±Ø�C‰™’Üúä‚c
Í‚ƒ’Ò+ymKìµ¼žBë(ݔگº6dÊãÿ
jmœ
+endstream
+endobj
+3160 0 obj
+<<
+/Type /Page
+/Contents 3161 0 R
+/Resources 3159 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3149 0 R
+/Annots [ 3155 0 R ]
+>>
+endobj
+3155 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [94.777 208.673 128.169 218.129]
+/A << /S /GoTo /D (tls1__3_8h) >>
+>>
+endobj
+3162 0 obj
+<<
+/D [3160 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+110 0 obj
+<<
+/D [3160 0 R /XYZ 70.866 771.024 null]
+>>
+endobj
+114 0 obj
+<<
+/D [3160 0 R /XYZ 70.866 712.079 null]
+>>
+endobj
+3151 0 obj
+<<
+/D [3160 0 R /XYZ 70.866 667.254 null]
+>>
+endobj
+118 0 obj
+<<
+/D [3160 0 R /XYZ 70.866 640.058 null]
+>>
+endobj
+3152 0 obj
+<<
+/D [3160 0 R /XYZ 176.792 570.518 null]
+>>
+endobj
+122 0 obj
+<<
+/D [3160 0 R /XYZ 70.866 541.435 null]
+>>
+endobj
+3153 0 obj
+<<
+/D [3160 0 R /XYZ 160.707 473.782 null]
+>>
+endobj
+126 0 obj
+<<
+/D [3160 0 R /XYZ 70.866 444.699 null]
+>>
+endobj
+3154 0 obj
+<<
+/D [3160 0 R /XYZ 187.157 377.047 null]
+>>
+endobj
+130 0 obj
+<<
+/D [3160 0 R /XYZ 70.866 347.964 null]
+>>
+endobj
+2980 0 obj
+<<
+/D [3160 0 R /XYZ 70.866 201.699 null]
+>>
+endobj
+134 0 obj
+<<
+/D [3160 0 R /XYZ 70.866 193.256 null]
+>>
+endobj
+3159 0 obj
+<<
+/Font << /F50 2307 0 R /F43 2258 0 R /F72 2883 0 R /F23 2944 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+3169 0 obj
+<<
+/Length 803       
+/Filter /FlateDecode
+>>
+stream
+xÚ¥UËn›@Ýû+FêŒg†y@TuQ¹Ž”U›x—DÁccpßyb@ÄjÔ0Üǹ瞹�-@àzö}5›/	L9�Áj‚	ç@¤rVkp0Ȉˆ$8>·ïGißïÚú”·öýVnBŒYË*—áãêPC&b•ÃDÀBŸÎ~¬ffX"€»DIBA¾ŸÝ?"°Vÿn‚qš€Wc¹”©`T+ÁÝì×�ÀcKy=Çyø‹¬Í,Îe!Ëuc øó¥
+|®s(
"B(ëþ@¸€ûˆ1UëŽu5õÖ•ukt¶RV¿Î�˜²ÿM°ÏÞ.'À—们Öçó%á UÃ!I RØ\ëŠ?€1âN@*¨w{		²rÄõ°Y#0Æ1ˆ(Q©…8Œ0B(XÈ6+J¹¶Ý[È&¯‹c[*‹z�]Õc˜ø0wÙ&Œ•$­k-�µldÕfÆÛœ6ö™ùï¼ÍÖÐFâDa|FHB£(ï�Ÿö]
+fP`˜bÞ‹ÒUê´2_
+¢xLÂ5iAD\Y¨WW�Ó˜£^×|e´mwbáJ}
+	
+Þ[ÙLÃTmAC˜¾\§¸ÏÁìœ.ÁÔFþÖtx³²<„˜¯fº8ž#û�•ið¡Î]�ÛZ�dÁ©Ê/t€"5ú•Å®²M‰ÕëÕ1ëv¾4"íYáb’Œ/Í(TªxÞƱóâ“؉Ô%Ä”
‘ïšã¦®5+™&áÝÌ\
T�/áê[íœåz Lsä¨sÄíŠÆ¾5žC?Ø_5û™û»••´9[ß‹M}Øû ²Ú7®¨¶öX1BJy5C~ÚÆ*2§gÕäôÓÓ«-›ß†ÃFg‚»‰Q£f ÆÌðéSQ
	îï5Óý^lC‡Aî%õódzT¹uÖ_Ҵͱ¤³h´�8Îcwt!¾U^žÖ.+‰{–jŠ´ÓÚ׉X
+šzMÔC©¥h+5Šq¦ß$N­kÆ Šñg¶µßÒÁioISÅwÌ]km�uõÔãlqЊz{ßê^£�ª þà�
+endstream
+endobj
+3168 0 obj
+<<
+/Type /Page
+/Contents 3169 0 R
+/Resources 3167 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3149 0 R
+/Annots [ 3156 0 R 3157 0 R 3158 0 R 3163 0 R ]
+>>
+endobj
+3156 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.737 735.141 120.691 743.625]
+/A << /S /GoTo /D (structoctad_a43389422956a84b8bafbd9e710d35053) >>
+>>
+endobj
+3157 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.737 722.19 125.667 729.073]
+/A << /S /GoTo /D (structoctad_aac9fd4aac8548b45f1d8653a4e194366) >>
+>>
+endobj
+3158 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [122.182 709.238 135.409 717.722]
+/A << /S /GoTo /D (structoctad_af7369ba76f648fb2c39e081239874371) >>
+>>
+endobj
+3163 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [94.777 188.721 144.478 198.178]
+/A << /S /GoTo /D (tls__octads_8h) >>
+>>
+endobj
+3170 0 obj
+<<
+/D [3168 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+3171 0 obj
+<<
+/D [3168 0 R /XYZ 70.866 775.009 null]
+>>
+endobj
+138 0 obj
+<<
+/D [3168 0 R /XYZ 70.866 694.994 null]
+>>
+endobj
+142 0 obj
+<<
+/D [3168 0 R /XYZ 70.866 619.302 null]
+>>
+endobj
+3172 0 obj
+<<
+/D [3168 0 R /XYZ 70.866 574.477 null]
+>>
+endobj
+146 0 obj
+<<
+/D [3168 0 R /XYZ 70.866 547.282 null]
+>>
+endobj
+3173 0 obj
+<<
+/D [3168 0 R /XYZ 70.866 465.786 null]
+>>
+endobj
+150 0 obj
+<<
+/D [3168 0 R /XYZ 70.866 438.591 null]
+>>
+endobj
+3174 0 obj
+<<
+/D [3168 0 R /XYZ 229.478 369.051 null]
+>>
+endobj
+154 0 obj
+<<
+/D [3168 0 R /XYZ 70.866 339.86 null]
+>>
+endobj
+2981 0 obj
+<<
+/D [3168 0 R /XYZ 70.866 181.747 null]
+>>
+endobj
+158 0 obj
+<<
+/D [3168 0 R /XYZ 70.866 173.305 null]
+>>
+endobj
+3167 0 obj
+<<
+/Font << /F50 2307 0 R /F43 2258 0 R /F26 2949 0 R /F72 2883 0 R /F79 3175 0 R /F23 2944 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+3183 0 obj
+<<
+/Length 754       
+/Filter /FlateDecode
+>>
+stream
+xÚ¥U]o›0}çWXÚ<àÚÛPM“¶¦©Ô§­Í[[U”8	*!˜~üûÙÆ�’N[_8÷ãÜsϽF`
¸ð~,¼“9E �)cX¬G0að”@†Áb	n|œw‹K‘"Ì•Ÿ9�e2BÂÿZÖm.ÛZtŸ³]ÞnE%3Yì*íé�/¼ßVŽà}‚$�	‰A¾õnîXªÿ.
‚Qš€c¹1� �#õ^‚kï—‡@c9MÙ5Ã9Ø=Ày!Êec ¸'s¸¯3ÈBUbB:÷[BèÈÜ„”2¿¨¤=ÖÕÔk[Ö•1ÐÙäÛ“9î bSúÙ›¬Ù|œ
2CÞÖA!ÿ9 ÔÌ�©w1�ˆÆ]b
+)ÄAˆBþLȬ(ÅÒªC4y]<9môAá�0L\˜ŸíC@�_yçü¨¿„þyz®1õakŒYLQ�‰XLFGäz0*
+Ç0Åle_›ëõÉœÀaÊž(CÓ2eþô¨NO{·Ãê�m÷šb]eý\'óv‹(:?;ë>vu÷¼ºþ®Îñt1Rs1,Àá¤t¤z¤€Þm²€ÎË�Fâ0<DYdF‚XIPü>åü,þ
+P”¥V¢×�æÍYÛ8Ýh>¢ÅRTki.ªîùPH³w`5'Ü6a±±	–#õ™£U @¸trS4Ý[#5ÔW«¶;xÑÂÏì¿kQ‰:PteÒ!^Õ»­"†¡Ër§]_Šjíô„H)NÇ›Â�uD O�¬“Éý¡Œ,›ûWŠR¸™ØjAaLÇ»ƒC‚÷2`Vµ�ÃÆ6@¬t�¢U~¤Å‘
+áä¾j«¼çVEÔ]V
®Þ±ªÍ)-Uá{¯˜/E•—íÒ’h`¨.+®./{;~�Å!�Sg Â÷ÜLDRdè`
¿�œºJ)…(Âÿr“º”AÂYlrÒRµ¯bE³Ô]hMõzzh}¶ÓJz}[›Õ!Æ?{tt
+endstream
+endobj
+3182 0 obj
+<<
+/Type /Page
+/Contents 3183 0 R
+/Resources 3181 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3149 0 R
+/Annots [ 3164 0 R 3165 0 R 3166 0 R 3176 0 R ]
+>>
+endobj
+3164 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.737 733.357 125.676 743.32]
+/A << /S /GoTo /D (structpktype_ae3d2dbf17869cb218ea7f4ea10ccbc03) >>
+>>
+endobj
+3165 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.737 722.19 128.169 730.674]
+/A << /S /GoTo /D (structpktype_a81908ce09cfe1c183b5c1d44708ab9a2) >>
+>>
+endobj
+3166 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.737 709.238 130.697 716.122]
+/A << /S /GoTo /D (structpktype_aa8fa37d88b74366bd16a3f46d1a36293) >>
+>>
+endobj
+3176 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [94.777 200.676 137.637 210.133]
+/A << /S /GoTo /D (tls__x509_8h) >>
+>>
+endobj
+3184 0 obj
+<<
+/D [3182 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+3185 0 obj
+<<
+/D [3182 0 R /XYZ 70.866 775.009 null]
+>>
+endobj
+162 0 obj
+<<
+/D [3182 0 R /XYZ 70.866 694.994 null]
+>>
+endobj
+166 0 obj
+<<
+/D [3182 0 R /XYZ 70.866 619.302 null]
+>>
+endobj
+3186 0 obj
+<<
+/D [3182 0 R /XYZ 70.866 574.477 null]
+>>
+endobj
+170 0 obj
+<<
+/D [3182 0 R /XYZ 70.866 547.282 null]
+>>
+endobj
+3187 0 obj
+<<
+/D [3182 0 R /XYZ 188.458 477.741 null]
+>>
+endobj
+174 0 obj
+<<
+/D [3182 0 R /XYZ 70.866 448.551 null]
+>>
+endobj
+3188 0 obj
+<<
+/D [3182 0 R /XYZ 112.236 381.006 null]
+>>
+endobj
+178 0 obj
+<<
+/D [3182 0 R /XYZ 70.866 351.923 null]
+>>
+endobj
+2982 0 obj
+<<
+/D [3182 0 R /XYZ 70.866 193.703 null]
+>>
+endobj
+182 0 obj
+<<
+/D [3182 0 R /XYZ 70.866 185.26 null]
+>>
+endobj
+3181 0 obj
+<<
+/Font << /F50 2307 0 R /F43 2258 0 R /F72 2883 0 R /F23 2944 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+3197 0 obj
+<<
+/Length 926       
+/Filter /FlateDecode
+>>
+stream
+xÚµV]oÛ6}÷¯ °	¨~ˆ¤{Ø2(P`ký–…"Ó¶0YJ%*iÿý.EJ–e%uPôE¶¨ËÃsî'	Ú!‚n®W+APŒ)9Zo‘"8–©„aIÑzƒî�U¸d*>UYÈHðŸ6îý¯"m÷÷£Þ†”ºÖe¦ÃÏë÷(Š8ŠÃ1Mìêâïõâë‚Â"At8+ŽqÌ"”wŸ	ÚÀ·÷ˆ`žÄè¹³< HXdÁ
+ôiñï‚LøS‚•HäX€¤˜ô
+nR“:ž«\›¦£Òc\­øè*±ŠZ²H¹í÷Œ‰“-Ž~½ó:>Þ.ÐÝR´e“ïJÎ~lmÉ<…Li11v¿ðXR†ñb^¿üÂ!º®'rOýµìGÁû�KLÃ%%„7Ú¤y¡7Î�7ºÉêüÑäUia'ÎÒœâX³mˬ³ì¶ÖÚ´5ü�_h¼R´|Ðî”9§Å<­.’žS•µ]šôÈê$§
EQœP1Bä=Ù”‚0uâÕJ1¤p¢�Ñ7nð»\P{}ýä€Ï½4Ê®3·ø´hõ¼”ˆÛIé]âCý:g›0G‚ÖW‚MUŸ‡Ðù©áz¯�Ùæ$ ÝÒ6ä$èaÌ>oÎRÀ-<‡ð–ú¯;]êÚö•Ôôù·­«C¢ÇÐEQÙ­Ïy¹sË÷„°B_ŸÆ¦OvΰJè[ËÛ
ýÂñ~¦  T©M°qA)Ì踇vAzK�Mȳ‚ƒ$ ÒÓƒÛ‡6Ó´´gäecR¾ÂC¶$ÈäyèËˬh7>BGVС}{ÿ}Ja%½
¸îKSe »qþ›À)°&ƒõsÍ`Iy‚™�¾'DÎôŸöÁ:­È3çÄúð }ž­|ÿùé†΋y<TU1S”*RО{V•¥ÎÌLYq	£iÐxOÉö©¯?ðÂÑÌfS|4$|-ÂI<º¯ó.ôö™õhË-"��“è©œebiâG}]u×�ª|3£œ%˜3Ñ“h´Yç]µsâLô±&A¢¦ša¨,
à‡CÐ2ôCpJŽ�/ Ïunô/ÆqÄ.�‰º &؃­Â¶ëNÓкœ“Ìqœ°Ë‚r‰äZ§›9Åÿš4|»d˜Ë0¦.ŠòåyhªÇ—t�eŸñ™»�
+�	§o¹œö—RÍJF£;i�ZúN}kGÛq¬uŽûÞ_g¬ÿ¾}ßÙ‰èrJñ‚ËÇ£
+endstream
+endobj
+3196 0 obj
+<<
+/Type /Page
+/Contents 3197 0 R
+/Resources 3195 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3149 0 R
+/Annots [ 3177 0 R 3178 0 R 3179 0 R 3180 0 R 3189 0 R 3190 0 R ]
+>>
+endobj
+3177 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [94.777 733.249 133.154 743.625]
+/A << /S /GoTo /D (tls1__3_8h_a42d4f54d23f86205a1fa590480181e0f) >>
+>>
+endobj
+3178 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.654 735.141 146.881 743.625]
+/A << /S /GoTo /D (structret_a4e027b19a827d55f0d0e38c50515f752) >>
+>>
+endobj
+3179 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.737 722.19 119.687 729.073]
+/A << /S /GoTo /D (structret_a5f2cd96fef0fd36bdd38cd72f85981f9) >>
+>>
+endobj
+3180 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [69.87 501.335 110.119 509.651]
+/A << /S /GoTo /D (tls1__3_8h_a42d4f54d23f86205a1fa590480181e0f) >>
+>>
+endobj
+3189 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [94.777 322.319 128.169 331.776]
+/A << /S /GoTo /D (tls1__3_8h) >>
+>>
+endobj
+3190 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [69.87 240.394 98.914 249.165]
+/A << /S /GoTo /D (class_socket) >>
+>>
+endobj
+3198 0 obj
+<<
+/D [3196 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+3199 0 obj
+<<
+/D [3196 0 R /XYZ 70.866 775.009 null]
+>>
+endobj
+186 0 obj
+<<
+/D [3196 0 R /XYZ 70.866 707.946 null]
+>>
+endobj
+190 0 obj
+<<
+/D [3196 0 R /XYZ 70.866 634.038 null]
+>>
+endobj
+3200 0 obj
+<<
+/D [3196 0 R /XYZ 70.866 587.429 null]
+>>
+endobj
+194 0 obj
+<<
+/D [3196 0 R /XYZ 70.866 560.233 null]
+>>
+endobj
+3201 0 obj
+<<
+/D [3196 0 R /XYZ 120.7 490.693 null]
+>>
+endobj
+198 0 obj
+<<
+/D [3196 0 R /XYZ 70.866 463.394 null]
+>>
+endobj
+2983 0 obj
+<<
+/D [3196 0 R /XYZ 70.866 315.345 null]
+>>
+endobj
+202 0 obj
+<<
+/D [3196 0 R /XYZ 70.866 306.902 null]
+>>
+endobj
+3202 0 obj
+<<
+/D [3196 0 R /XYZ 70.866 188.648 null]
+>>
+endobj
+3203 0 obj
+<<
+/D [3196 0 R /XYZ 95.773 161.835 null]
+>>
+endobj
+3204 0 obj
+<<
+/D [3196 0 R /XYZ 95.773 148.884 null]
+>>
+endobj
+3205 0 obj
+<<
+/D [3196 0 R /XYZ 95.773 135.932 null]
+>>
+endobj
+3206 0 obj
+<<
+/D [3196 0 R /XYZ 95.773 122.981 null]
+>>
+endobj
+3207 0 obj
+<<
+/D [3196 0 R /XYZ 95.773 110.029 null]
+>>
+endobj
+3195 0 obj
+<<
+/Font << /F50 2307 0 R /F43 2258 0 R /F72 2883 0 R /F23 2944 0 R /F26 2949 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+3233 0 obj
+<<
+/Length 970       
+/Filter /FlateDecode
+>>
+stream
+xÚÅWMoÜ6½ï¯ ЋtX†¤DJ*Šil'N›4ͪ@QÛ´­%ª•\‰ªí_’¢ì•ö#NÖF6(.9óæÍãpˆ@
x;û%ž½:£„0bÌñ5AD à ÎÁ…C�{¿ñ!Â�ÚgfOR™ºs„ÎB6]&»†÷Ÿ'uÖ­y%S)êJïœ�ƳgXmD?8CdëÙŹúí=@ЋBpkV®�O=H}O�K°˜ý1CÐÁ€Fl5Ã
°AÖcúÔ-]ŒœrøþÀ×KÞôã³®Ê4ÔÖ`œ¼:SžiÁa抃�ôö/	¡£-àbz¾Óö~û_tÄMaCÿlÖÊêÌ%ÈùGÿãrâx”¦8Ø@úyÅå°·ß7Áé�Q:,¿D©?<†9ÇCâa5 0¢ß1œ?+qw0Š!6
+Ø
+gª€9ö0¤ˆ�¹O ¢^¿ƒÂbwŽBÎ	—©(ynUÊÛ¬7ÝŽm�¹ò*r{uíÙ’"*E]•qSš„Fú‰WöÀä£c¦®]9µ¨\‰¶eeÚÚá­6›Ú�‚WJÍJà©â»nêõ°�o-ËZo½UÑO_"DJþã8„Aï�A„÷(d§(eŽ,Û¤ÔVÛÒÐĘö)´N•ˆ	ÚôiZ�lT�~ü™_ëèyÃ5ßÛ2Ò¹£�)u£ƒ)›»žÚº’\tg'Z©èW mi3F"e”0kÔdÓ"ýATYÙåv%ñ6Vª:¨ºfUüÓ[
ühX ØÉד5±¤˜ÑíŸwA�…ãƒðX­Ï/ó§×:¼¿:èL/ëº<\þs‰j)ò‰t¬d«Ðüd«´9ìç!©;ŽâÅÞ­NüÛ"ùðú¯ÄÅN|þæ×Ó8Yœÿ}:1â\�'ž
tU[Án!&”íqJŽuzÓAһ׋wG²³·lÔ™Ló//Õ`u®Š¼ ÷�¿|súmz~÷ŸÏ{Wµ¢¨<ò4ÿiÁ“z©J®ÓµY*ë晩ø:4ëô.ái_¬K…é>Éu±ûž-…‚ã«;kuTÑ•<|’Kaît.Åš¿¬§Lܬx“´��üÛ¨}ª'QªK¹¹9ê®Ï¬ò›ú’oj­»›—
·¶NQíhY6/Û¡eÑw­ÿг<­éÜÓaúGv)cˆhÚ‡�Xp¦Ø÷hBÞõx£"õ~øŠ·Ûðfc�Ì7­õ!U±úª1c¶1{«ûØÇv©C¿š°ï�Ýá[ÿæÕr-
+endstream
+endobj
+3232 0 obj
+<<
+/Type /Page
+/Contents 3233 0 R
+/Resources 3231 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3149 0 R
+/Annots [ 3191 0 R 3192 0 R 3193 0 R 3194 0 R 3208 0 R 3209 0 R 3210 0 R 3211 0 R 3212 0 R 3213 0 R 3214 0 R 3215 0 R 3216 0 R 3217 0 R 3218 0 R 3219 0 R 3220 0 R 3221 0 R 3222 0 R 3223 0 R 3224 0 R 3225 0 R 3226 0 R 3227 0 R 3228 0 R 3229 0 R ]
+>>
+endobj
+3191 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [120.689 735.061 149.732 743.832]
+/A << /S /GoTo /D (class_socket) >>
+>>
+endobj
+3192 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [120.689 722.109 149.732 730.88]
+/A << /S /GoTo /D (class_socket) >>
+>>
+endobj
+3193 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [69.87 648.201 98.914 656.972]
+/A << /S /GoTo /D (class_socket) >>
+>>
+endobj
+3194 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [94.777 589.698 148.101 599.155]
+/A << /S /GoTo /D (tls__sockets_8h) >>
+>>
+endobj
+3208 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [114.215 416.16 134.418 424.644]
+/A << /S /GoTo /D (structticket_a869300f7efe0bba46232714f0613b550) >>
+>>
+endobj
+3209 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [114.708 403.209 129.971 411.693]
+/A << /S /GoTo /D (structticket_ae600b67c9b83f30822d2d722e69110d6) >>
+>>
+endobj
+3210 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [132.964 402.236 237.601 411.899]
+/A << /S /GoTo /D (tls1__3_8h_a73d8ba16d80d060c50c69ea830d953a9) >>
+>>
+endobj
+3211 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [114.708 390.257 141.125 397.141]
+/A << /S /GoTo /D (structticket_aaa058ee224e94dfda2ad19d2a8e2bc30) >>
+>>
+endobj
+3212 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [114.708 375.521 130.652 385.79]
+/A << /S /GoTo /D (structticket_a5a8f9c9d4a534c06f733a2cc1bfe0253) >>
+>>
+endobj
+3213 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.645 376.333 206.39 385.996]
+/A << /S /GoTo /D (tls1__3_8h_a42ed9bb2d8c709a8901a509340eb9625) >>
+>>
+endobj
+3214 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [94.777 364.354 118.7 372.838]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+3215 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.2 364.274 141.618 373.045]
+/A << /S /GoTo /D (structticket_a0f21883e83fa71ca8bcf0099c44be3fb) >>
+>>
+endobj
+3216 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [94.777 351.403 118.7 359.887]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+3217 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.2 351.322 153.57 360.093]
+/A << /S /GoTo /D (structticket_a7c66b0d388e88a0671aa70088e1d4e1f) >>
+>>
+endobj
+3218 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [94.777 338.451 118.7 346.935]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+3219 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.2 338.371 139.134 347.142]
+/A << /S /GoTo /D (structticket_af5feccff050166d2869c1f77e0bd9e37) >>
+>>
+endobj
+3220 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [94.777 323.608 133.154 333.984]
+/A << /S /GoTo /D (tls1__3_8h_a42d4f54d23f86205a1fa590480181e0f) >>
+>>
+endobj
+3221 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.654 323.608 197.451 334.19]
+/A << /S /GoTo /D (structticket_ab49a7b1bd72975477eaaa8c5cf1fdbb1) >>
+>>
+endobj
+3222 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [94.777 310.657 133.154 321.033]
+/A << /S /GoTo /D (tls1__3_8h_a42d4f54d23f86205a1fa590480181e0f) >>
+>>
+endobj
+3223 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.654 310.764 199.567 321.033]
+/A << /S /GoTo /D (structticket_a52c459e527403a39f4a189ac6a380e5e) >>
+>>
+endobj
+3224 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [94.777 297.705 133.154 308.081]
+/A << /S /GoTo /D (tls1__3_8h_a42d4f54d23f86205a1fa590480181e0f) >>
+>>
+endobj
+3225 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.654 299.597 153.444 308.081]
+/A << /S /GoTo /D (structticket_a0afa2495687dbd787aa04b82ef8de7cb) >>
+>>
+endobj
+3226 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.737 286.646 136.857 295.336]
+/A << /S /GoTo /D (structticket_a91cbb645c8d90f0a4846e29764772335) >>
+>>
+endobj
+3227 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.737 271.91 157.067 282.178]
+/A << /S /GoTo /D (structticket_a8f26e9c77f54bc5cf1329b4a7fdb276d) >>
+>>
+endobj
+3228 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.737 258.851 170.399 269.433]
+/A << /S /GoTo /D (structticket_a6e3531a00554984c2e3d14aa2997609c) >>
+>>
+endobj
+3229 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.737 245.899 130.787 256.275]
+/A << /S /GoTo /D (structticket_aefff163e6e665c6affa39084c0e298f3) >>
+>>
+endobj
+3234 0 obj
+<<
+/D [3232 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+3235 0 obj
+<<
+/D [3232 0 R /XYZ 70.866 775.009 null]
+>>
+endobj
+3236 0 obj
+<<
+/D [3232 0 R /XYZ 95.773 748.196 null]
+>>
+endobj
+3237 0 obj
+<<
+/D [3232 0 R /XYZ 95.773 735.244 null]
+>>
+endobj
+206 0 obj
+<<
+/D [3232 0 R /XYZ 70.866 706.161 null]
+>>
+endobj
+2984 0 obj
+<<
+/D [3232 0 R /XYZ 70.866 582.724 null]
+>>
+endobj
+210 0 obj
+<<
+/D [3232 0 R /XYZ 70.866 574.282 null]
+>>
+endobj
+3238 0 obj
+<<
+/D [3232 0 R /XYZ 70.866 456.027 null]
+>>
+endobj
+214 0 obj
+<<
+/D [3232 0 R /XYZ 70.866 231.655 null]
+>>
+endobj
+218 0 obj
+<<
+/D [3232 0 R /XYZ 70.866 159.639 null]
+>>
+endobj
+3239 0 obj
+<<
+/D [3232 0 R /XYZ 70.866 113.03 null]
+>>
+endobj
+3231 0 obj
+<<
+/Font << /F50 2307 0 R /F43 2258 0 R /F72 2883 0 R /F23 2944 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+3264 0 obj
+<<
+/Length 597       
+/Filter /FlateDecode
+>>
+stream
+xÚµUÍ“š0¿óWä²!�öÒÙn]×Ý®m�:Žƒ­S¶€Ûîß„DDG�éÅ|˜÷Þïã‘ °ô��‘quG`0 ÔÑø2J�`HÍÀÈ$�Y6ö™Y.#ó/Õ:,óu¢çÏ|n9Èä9On�£ày.$¾+êTY°#w�^dü6±‰€Sc2ì�äÅ�˜‰ÿ‚nÀÀŸêäðˆHæÉd+ßt’u j0€:–í „Ì7I"^-gÐÕ���92
ÛE9�
+œfÙʲ©Üïëë·m €³-+1†
óTà Ø•LþldõIUÿƒÊ³_`a¯‰käu¶“À“Ÿq¾\Ž£Ê¥}¾Ð&<÷
}'O7ß'Ñàö±MÂÁ�ž>¬„GÆ-´‰* ;•‹÷’]ÙºšmšéV:B•£ZŽ0¡7ŠœFæid¯ÅEˆ°Üß„÷çH¯¾æÜ.DI>S²+*í[è‘&=¢éÉ8‚³ÝŠ,)ãÙö6™Ïï¢,W#·\dþ-¹\3�Wjûkø¨&«xÊõ^¬¿ÁU‹©Ö`øexÛ;O„ £uêvC‡Ug^ÎÄ×L¤4ÿ…‡NÜîemÌE˜æË·e!&ŸdÓùºHâR´Ä%MºN‹å"uqµx±_¦�å¡k^äÐŒ·‰ªµ­¤†¹lèÝÝD{è%"×9ç
ݼ�bŸz�·Ó#�Š¡bÖç)Ïãrs«¨Ë\Í?eÚwíKºñ£O
é
+endstream
+endobj
+3263 0 obj
+<<
+/Type /Page
+/Contents 3264 0 R
+/Resources 3262 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3266 0 R
+/Annots [ 3230 0 R 3255 0 R 3256 0 R 3257 0 R 3258 0 R 3259 0 R ]
+>>
+endobj
+3230 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [155.947 637.971 248.799 645.757]
+/A << /S /GoTo /D (tls1__3_8h_a73d8ba16d80d060c50c69ea830d953a9) >>
+>>
+endobj
+3255 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [151.165 455.916 210.542 463.703]
+/A << /S /GoTo /D (tls1__3_8h_a42ed9bb2d8c709a8901a509340eb9625) >>
+>>
+endobj
+3256 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [69.87 365.813 95.773 373.026]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+3257 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [69.87 274.786 95.773 281.999]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+3258 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [69.87 183.758 95.773 190.971]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+3259 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [69.87 91.627 110.119 99.944]
+/A << /S /GoTo /D (tls1__3_8h_a42d4f54d23f86205a1fa590480181e0f) >>
+>>
+endobj
+3265 0 obj
+<<
+/D [3263 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+222 0 obj
+<<
+/D [3263 0 R /XYZ 70.866 771.024 null]
+>>
+endobj
+3240 0 obj
+<<
+/D [3263 0 R /XYZ 129.675 720.013 null]
+>>
+endobj
+226 0 obj
+<<
+/D [3263 0 R /XYZ 70.866 692.915 null]
+>>
+endobj
+3242 0 obj
+<<
+/D [3263 0 R /XYZ 120.656 628.986 null]
+>>
+endobj
+230 0 obj
+<<
+/D [3263 0 R /XYZ 70.866 600.103 null]
+>>
+endobj
+3243 0 obj
+<<
+/D [3263 0 R /XYZ 97.783 537.958 null]
+>>
+endobj
+234 0 obj
+<<
+/D [3263 0 R /XYZ 70.866 510.86 null]
+>>
+endobj
+3245 0 obj
+<<
+/D [3263 0 R /XYZ 132.796 446.931 null]
+>>
+endobj
+238 0 obj
+<<
+/D [3263 0 R /XYZ 70.866 418.049 null]
+>>
+endobj
+3246 0 obj
+<<
+/D [3263 0 R /XYZ 219.965 355.903 null]
+>>
+endobj
+242 0 obj
+<<
+/D [3263 0 R /XYZ 70.866 328.725 null]
+>>
+endobj
+3247 0 obj
+<<
+/D [3263 0 R /XYZ 135.656 264.876 null]
+>>
+endobj
+246 0 obj
+<<
+/D [3263 0 R /XYZ 70.866 237.778 null]
+>>
+endobj
+3248 0 obj
+<<
+/D [3263 0 R /XYZ 127.685 173.849 null]
+>>
+endobj
+250 0 obj
+<<
+/D [3263 0 R /XYZ 70.866 146.67 null]
+>>
+endobj
+3249 0 obj
+<<
+/D [3263 0 R /XYZ 236.149 82.821 null]
+>>
+endobj
+3262 0 obj
+<<
+/Font << /F50 2307 0 R /F72 2883 0 R /F43 2258 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+3289 0 obj
+<<
+/Length 810       
+/Filter /FlateDecode
+>>
+stream
+xÚµVÙn›@}ç+Fê<x2ÃU­”¦‰”¦jû-‰,�Â’²$ñßw608®›Fí‹
ýçž{832€À¹u²°ŽÎ
=�‚Å
+øžü�@ƒE®mBœÛÅ Ä…û"O­žFmä̈Øó¶îⶫS}{ZÅ]‘–mÔòª”™Öç…õÓÂ"
<Ä…u}‹@"ž]i€'Y—QÈ\*®s0·~Xè�¤=QÏšÁ:3Œ²‹èy™Fuî`fo–‰ä.™iJuf¸]�dŸ†>Â�Å�íʆg%%&Yó
×3O”hy|Ÿ¶ÇÇ}©m™£3ÑÅ–­ÀRbæj̯Ñ3/Œì®ÐŠdÁšÙùFß'ƒÒQžW²ƒ'ž&zqåPdWµ¾i×¼1W<v²ïåOÚjÑdk!¤„ŒõÂÈvÇ%¢èjýß„%4úa}N$W11�ÆiÕê5�MÓ9_)eU	•|¨G^¶Î¤!‘>J=ÔÓOÅ]§“â{™Oì�‰aó‡uZ/›Ž·oaþ2}/{¦Ó?©hÍZ§¨Ë®–|-qjˆ¯"ièGåá®Xˬ–ªTÝÃúXE�Ê€pðE¬
ùF6$H<:„Ùi}ƒ¨ßŒöW$9©g_íΡíLZf[ívsMïUÍ3^¾¡Íqâ¡î¾ª2x²cxÉ[åúf•I³Ž´õÒLÿ�u¹‰éÏ—ïó/Õ4Ø©´èuL&§ÿ¡ªi5;1;ô“tBdžfi)ÞˆP6j‡ƒ®®Š$C÷§"/3½|ƒÉÓãéáƒ=è¾R6ÀÆÉ7„°IÔËsNZŒyv›7xIáz­Þ6SKÀ˜õ5\ºþ`ø~-.çË&mšA=9õõUªÏž:-ãßìAê°×ûrŽ!í­;‚l„ò©T¾
+ñöØã/ã¼KL5BG‘bôúb›Yÿ~–}7ìÆêì ¹¾˜ó¸ü0Ño߇
cQü7ßý÷€‰ï¹ª&s!]ºzRU>—†ÚšéNº}Ó±H=o2ùžì´ÜåøñHK
+endstream
+endobj
+3288 0 obj
+<<
+/Type /Page
+/Contents 3289 0 R
+/Resources 3287 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3266 0 R
+/Annots [ 3260 0 R 3261 0 R 3267 0 R ]
+>>
+endobj
+3260 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [69.87 727.649 110.119 735.966]
+/A << /S /GoTo /D (tls1__3_8h_a42d4f54d23f86205a1fa590480181e0f) >>
+>>
+endobj
+3261 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [69.87 632.986 110.119 641.302]
+/A << /S /GoTo /D (tls1__3_8h_a42d4f54d23f86205a1fa590480181e0f) >>
+>>
+endobj
+3267 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [94.777 174.359 128.169 183.816]
+/A << /S /GoTo /D (tls1__3_8h) >>
+>>
+endobj
+3290 0 obj
+<<
+/D [3288 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+254 0 obj
+<<
+/D [3288 0 R /XYZ 70.866 771.024 null]
+>>
+endobj
+3250 0 obj
+<<
+/D [3288 0 R /XYZ 238.973 717.674 null]
+>>
+endobj
+258 0 obj
+<<
+/D [3288 0 R /XYZ 70.866 688.664 null]
+>>
+endobj
+3251 0 obj
+<<
+/D [3288 0 R /XYZ 161.057 623.01 null]
+>>
+endobj
+262 0 obj
+<<
+/D [3288 0 R /XYZ 70.866 595.784 null]
+>>
+endobj
+3252 0 obj
+<<
+/D [3288 0 R /XYZ 124.547 528.346 null]
+>>
+endobj
+266 0 obj
+<<
+/D [3288 0 R /XYZ 70.866 501.121 null]
+>>
+endobj
+3253 0 obj
+<<
+/D [3288 0 R /XYZ 143.125 433.683 null]
+>>
+endobj
+270 0 obj
+<<
+/D [3288 0 R /XYZ 70.866 404.673 null]
+>>
+endobj
+3254 0 obj
+<<
+/D [3288 0 R /XYZ 181.132 339.019 null]
+>>
+endobj
+274 0 obj
+<<
+/D [3288 0 R /XYZ 70.866 309.901 null]
+>>
+endobj
+2985 0 obj
+<<
+/D [3288 0 R /XYZ 70.866 167.695 null]
+>>
+endobj
+278 0 obj
+<<
+/D [3288 0 R /XYZ 70.866 159.016 null]
+>>
+endobj
+3287 0 obj
+<<
+/Font << /F50 2307 0 R /F72 2883 0 R /F43 2258 0 R /F23 2944 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+3323 0 obj
+<<
+/Length 911       
+/Filter /FlateDecode
+>>
+stream
+xÚÝXÛrÚ0}ç+ôh? èb[&o¹@.mš)¦�L“ŒÇ5<›Úrúõ•|!à@B0´“¾pÞ=g�V‹vÎǽÆAÇDÀ†-Ë¢ 7AÛ²khaÐëƒ[Í„-½I˜­õ>:n“$ˆÂ|Áqê‹üs—tŒ4óÐçú}ï…&£(sC¨Zm´{�Ÿ
,Às4Û†61€?iÜÞ#З¿]iË¿²''À0¥3C9§ñ¹�*`™Ù²C°0De§žðrž�€�ûIF¥ôqБŽŸ$Àd6MB¥½‘Ûßb.Ù€Û¦iZZŠbY…‹¸ºÙ
+.žH—áæ.hb™ÁjbL¼G7æ~÷_Ʊ×à¬t¬��È×	Ò~¨.*š´¤f$Óœ2¨Ô+¶ú!º†rEk
f”fI
7ñê@š†	1e›Éæ�¼øeÝ‚~ÕN­ÞRr¿¼Žv8Šz¾v­©:w:ÖÜ«£×iwui_Û]÷ÓÑU»âH[CÜ®™`~0ñØMÒ@ðý¦ò@§HóT<èÄÔ¢4Ö›ØÔ$®;Tå%ŽR)Åt¿$.QiAAÆí«ïÒ„+±ÅlÊ·;f«=x(P…„}•½õpûy�³©ˆ^7P¼>ÈâîºÄlÁB–º‡kùÂëo†îÔJ¾
ŠDòöò�Õ™%çGÎyÍš°�ºWûIf�<›“¿#Õ>ÓÉé9µªÉëR%âý«t²w•üÿB¥›=;_<¾ûâtq¬._:�÷r]�ÂæÜïê&•ÛmšºtÎÕr�‹o;ºo¾N<ªOüzâuoŽk;—­;
ƒ‘—Œ6Ë+1NV<\7±E°¶\ˤWi—;ôfÙbbdÎÇËÛ>BH;åÂƼŸ·ì§<ñã`*ÔÜAº­´�2.Š jqÉÀ�êÅE~aX¡:q®ËfæN–)¡çdHA&›L"?�È˹÷Äeiz"½X6$xÁÉ<¦§IÀA‡Ùù¶‹
¹¡’¬iIƒ…qËáá¢u5ülPAsë“(¹/–¢.íªT©
1&‹\Ë�çµçým9/Ï%Öð.,òÙœpa�“~«
ãù·‹bq¥å~<kHVM—L"Šß2\*‡J$LœÏ”Zò-c|ÆCË”*¨dkV¦‰jcgC%§ÆÃ*Å?"Ëj{
+endstream
+endobj
+3322 0 obj
+<<
+/Type /Page
+/Contents 3323 0 R
+/Resources 3321 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3266 0 R
+/Annots [ 3268 0 R 3269 0 R 3270 0 R 3271 0 R 3272 0 R 3273 0 R 3274 0 R 3275 0 R 3276 0 R 3277 0 R 3278 0 R 3279 0 R 3280 0 R 3281 0 R 3282 0 R 3283 0 R 3284 0 R 3285 0 R 3286 0 R 3291 0 R 3292 0 R 3293 0 R 3294 0 R 3295 0 R 3296 0 R 3297 0 R 3298 0 R 3299 0 R 3300 0 R 3301 0 R 3302 0 R 3303 0 R 3304 0 R 3305 0 R 3306 0 R 3307 0 R 3308 0 R 3309 0 R 3310 0 R 3311 0 R 3312 0 R 3313 0 R 3314 0 R 3315 0 R 3316 0 R 3317 0 R 3318 0 R 3319 0 R ]
+>>
+endobj
+3268 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.737 736.898 132.652 745.077]
+/A << /S /GoTo /D (struct_t_l_s__session_a785098bf569661d0f5103f5f0f01eb93) >>
+>>
+endobj
+3269 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.737 723.178 156.063 732.635]
+/A << /S /GoTo /D (struct_t_l_s__session_a04ec050580401dd1d386e329e43b4e58) >>
+>>
+endobj
+3270 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [94.777 711.322 123.82 720.093]
+/A << /S /GoTo /D (class_socket) >>
+>>
+endobj
+3271 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.794 709.619 162.506 719.887]
+/A << /S /GoTo /D (struct_t_l_s__session_a801b2cd7e838f621976301da6c72b0df) >>
+>>
+endobj
+3272 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [114.708 698.656 123.677 707.14]
+/A << /S /GoTo /D (struct_t_l_s__session_a5005b3b16963dc348f94c3f81c1f5e13) >>
+>>
+endobj
+3273 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [114.708 685.908 156.072 694.392]
+/A << /S /GoTo /D (struct_t_l_s__session_a25f8656ac2eb46c98015a8251a01011c) >>
+>>
+endobj
+3274 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [159.064 684.936 274.21 694.599]
+/A << /S /GoTo /D (tls1__3_8h_a6ebccf75bb3d8609bc1f41333f2ea07b) >>
+>>
+endobj
+3275 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.737 671.377 157.067 681.645]
+/A << /S /GoTo /D (struct_t_l_s__session_a1f1da4c8ae7fb1055a0e2a2e2f212725) >>
+>>
+endobj
+3276 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.737 658.522 170.399 669.104]
+/A << /S /GoTo /D (struct_t_l_s__session_a1add0b39f1e49f34b3eb4164f3b3b759) >>
+>>
+endobj
+3277 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.737 645.882 175.905 655.845]
+/A << /S /GoTo /D (struct_t_l_s__session_a024f4141e00823f6d0c8367405d25793) >>
+>>
+endobj
+3278 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.737 633.135 171.879 643.403]
+/A << /S /GoTo /D (struct_t_l_s__session_a17bfd7bac99455c6aec56288bb406268) >>
+>>
+endobj
+3279 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [94.777 620.387 121.453 630.351]
+/A << /S /GoTo /D (structcrypto) >>
+>>
+endobj
+3280 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [121.953 621.199 154.35 630.656]
+/A << /S /GoTo /D (struct_t_l_s__session_af0c486630787d7b0519b8613674558d0) >>
+>>
+endobj
+3281 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [94.777 607.64 121.453 617.603]
+/A << /S /GoTo /D (structcrypto) >>
+>>
+endobj
+3282 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [121.953 608.451 151.848 617.908]
+/A << /S /GoTo /D (struct_t_l_s__session_a358daf4ad97c5933268851250fb90083) >>
+>>
+endobj
+3283 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [94.777 596.677 118.7 605.161]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+3284 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.2 596.596 133.647 605.367]
+/A << /S /GoTo /D (struct_t_l_s__session_a4635560f5d28a4e470e9d9daf00d0721) >>
+>>
+endobj
+3285 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [114.708 583.929 126.169 592.413]
+/A << /S /GoTo /D (struct_t_l_s__session_a2340601e94fb9dba59416570fe21a715) >>
+>>
+endobj
+3286 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [129.162 582.957 201.907 592.62]
+/A << /S /GoTo /D (tls1__3_8h_a42ed9bb2d8c709a8901a509340eb9625) >>
+>>
+endobj
+3291 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [94.777 571.182 118.7 579.666]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+3292 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.2 571.101 141.116 579.872]
+/A << /S /GoTo /D (struct_t_l_s__session_a64578d777eacea6f53eef13676039ed8) >>
+>>
+endobj
+3293 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [114.708 558.435 131.863 565.318]
+/A << /S /GoTo /D (struct_t_l_s__session_a3762b005bae063072f8bfe78711592ce) >>
+>>
+endobj
+3294 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.855 557.462 207.6 567.125]
+/A << /S /GoTo /D (tls1__3_8h_a42ed9bb2d8c709a8901a509340eb9625) >>
+>>
+endobj
+3295 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [94.777 545.687 118.7 554.171]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+3296 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.2 545.607 138.632 554.378]
+/A << /S /GoTo /D (struct_t_l_s__session_ae59f0c1cfe873359679fafac2154c447) >>
+>>
+endobj
+3297 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [114.708 532.94 128.16 541.119]
+/A << /S /GoTo /D (struct_t_l_s__session_a14f1ce0291842ad4763979c27e985f6b) >>
+>>
+endobj
+3298 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.152 531.967 203.897 541.63]
+/A << /S /GoTo /D (tls1__3_8h_a42ed9bb2d8c709a8901a509340eb9625) >>
+>>
+endobj
+3299 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [94.777 520.192 118.7 528.676]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+3300 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.2 520.112 139.125 528.883]
+/A << /S /GoTo /D (struct_t_l_s__session_ab8376d0fb045c5dc1a3306a4d149f337) >>
+>>
+endobj
+3301 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [114.708 507.445 128.16 515.624]
+/A << /S /GoTo /D (struct_t_l_s__session_ab64e16663d54fbba6a28cfbae608f8b6) >>
+>>
+endobj
+3302 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.152 506.472 203.897 516.135]
+/A << /S /GoTo /D (tls1__3_8h_a42ed9bb2d8c709a8901a509340eb9625) >>
+>>
+endobj
+3303 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [94.777 494.698 118.7 503.182]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+3304 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.2 494.617 139.125 503.388]
+/A << /S /GoTo /D (struct_t_l_s__session_a78c0bddb1e9a270a14a217659b3eaad5) >>
+>>
+endobj
+3305 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [114.708 481.95 128.16 490.129]
+/A << /S /GoTo /D (struct_t_l_s__session_addd71624b9f19d693eab2ab6743c9c9c) >>
+>>
+endobj
+3306 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.152 480.977 203.897 490.641]
+/A << /S /GoTo /D (tls1__3_8h_a42ed9bb2d8c709a8901a509340eb9625) >>
+>>
+endobj
+3307 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [94.777 469.203 118.7 477.687]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+3308 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.2 469.122 147.007 477.687]
+/A << /S /GoTo /D (struct_t_l_s__session_a12b8b2922dd9e37546592a618c721f41) >>
+>>
+endobj
+3309 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [94.777 456.456 118.7 464.94]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+3310 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.2 456.375 151.49 465.146]
+/A << /S /GoTo /D (struct_t_l_s__session_aaf5941fece001e3797b6dd399ae51292) >>
+>>
+endobj
+3311 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [114.708 443.708 133.468 452.398]
+/A << /S /GoTo /D (struct_t_l_s__session_ab7b62f1fc800cd7bbe0eb13599045e92) >>
+>>
+endobj
+3312 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [136.46 442.735 235.028 452.398]
+/A << /S /GoTo /D (tls1__3_8h_a98c94c5986465343f350d9851e7fe594) >>
+>>
+endobj
+3313 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [114.708 430.961 136.462 439.651]
+/A << /S /GoTo /D (struct_t_l_s__session_a4ee4f5c25f51c1c87ff63b5d3cf93a1c) >>
+>>
+endobj
+3314 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.455 429.988 242.506 439.651]
+/A << /S /GoTo /D (tls1__3_8h_a2cd5d60f1aad92bfe845b7a4d3ab2cd9) >>
+>>
+endobj
+3315 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.737 416.429 119.193 426.393]
+/A << /S /GoTo /D (struct_t_l_s__session_a128fa451adfee0d939300fd130cbe185) >>
+>>
+endobj
+3316 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [94.777 405.466 128.169 413.95]
+/A << /S /GoTo /D (structunihash) >>
+>>
+endobj
+3317 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.669 405.466 159.066 413.95]
+/A << /S /GoTo /D (struct_t_l_s__session_ab0aff1dadec8c32fd7544e5c47d8d050) >>
+>>
+endobj
+3318 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [94.777 392.719 117.338 401.203]
+/A << /S /GoTo /D (structticket) >>
+>>
+endobj
+3319 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [117.838 392.822 125.309 401.203]
+/A << /S /GoTo /D (struct_t_l_s__session_aa94c2e7b78ab19e9098e81c554f90b8a) >>
+>>
+endobj
+3324 0 obj
+<<
+/D [3322 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+3325 0 obj
+<<
+/D [3322 0 R /XYZ 70.866 775.009 null]
+>>
+endobj
+282 0 obj
+<<
+/D [3322 0 R /XYZ 70.866 378.667 null]
+>>
+endobj
+286 0 obj
+<<
+/D [3322 0 R /XYZ 70.866 308.384 null]
+>>
+endobj
+3326 0 obj
+<<
+/D [3322 0 R /XYZ 70.866 265.368 null]
+>>
+endobj
+290 0 obj
+<<
+/D [3322 0 R /XYZ 70.866 238.365 null]
+>>
+endobj
+3327 0 obj
+<<
+/D [3322 0 R /XYZ 145.124 174.095 null]
+>>
+endobj
+294 0 obj
+<<
+/D [3322 0 R /XYZ 70.866 146.908 null]
+>>
+endobj
+3328 0 obj
+<<
+/D [3322 0 R /XYZ 192.322 82.821 null]
+>>
+endobj
+3321 0 obj
+<<
+/Font << /F50 2307 0 R /F43 2258 0 R /F26 2949 0 R /F72 2883 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+3364 0 obj
+<<
+/Length 737       
+/Filter /FlateDecode
+>>
+stream
+xÚ­UMsÚ0½ûWèhPdÙòGné@2MšN˜Ngh†ql
ž›Ú"
ÿ¾«/ ÄÒÉcYûö½·»A3DЕóiäœ]2‚œFQ€FSœDŠSŠ#�
+4vièÝ�®Q@CLüâÔj?™×£qâE³ÊŪáúµ_端D&ʺ’‘Î`äüv|$Èß$HœÐåg|OP
ß®ÁAš ?jç…,À,àÿ:ßr”täcbY3œbŠ¯çBܶÎ=JÜÇ¥h%Í¥™RwWSã4&¾„$¨Лj´a�?raB5
Hwh‚£4°îü"$�»÷PS@ŒìžÑ—á¤åm6�ŸAKîìDoÅõ‚Ç$E=Jqš„:ö›Çˆ[—•à�v]Ôúi…ÊMxÏ+),Á„†»6…Ʀ²è ½gE>Ï g»_	(‹q@ï;øÃœ'u€fû¹*CfÎëVTÙ‚à™äi
ÆÿèS˜Û‹Ÿ“áàîÇànòõâvðªò°å$¡�> î³G™kˤ¨«S¾Õf9¯«Šçv`Nñ#2~äårΛI»*?^;h˜KÞbtê2ù³™ç·á¼0ÜU´é¾-D§¶+!6¦™ç3°Iú±j`2kdûÖ«åñ*w+šfϨ
Ì¡b©jd2«*9æJ5J˜ž'ù³Ö\¼@�U3³EÛ"³©×ž~,2¹Ñ=˜­:Ìøgg
ÖŠvž™Lj©áB÷ÐúÔ¶Hìy'+|ž¡®¹ªqÅD¬—ÿÝ$€hÀvq5JÛ5ŠLdJ8"ižYƒ·�ÇE¦¶÷¥UO%Ü5¤1߀ÕhúFG|œ4Ÿm7Àª*ÞwWÙƒ¯Y/á:x}b½»Ípì«Š²ši-7^¸™ƒÝ]W<c˜þ{nx{³G˜ÆQ(¹„,ÄŒ…ðÄ@*BW¼â
¸kæçag*ûµËõL5?¯ö9þ´OB‚
+endstream
+endobj
+3363 0 obj
+<<
+/Type /Page
+/Contents 3364 0 R
+/Resources 3362 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3266 0 R
+/Annots [ 3320 0 R 3357 0 R 3358 0 R ]
+>>
+endobj
+3320 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [69.87 729.923 100.555 737.136]
+/A << /S /GoTo /D (class_socket) >>
+>>
+endobj
+3357 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [198.986 546.943 291.838 554.73]
+/A << /S /GoTo /D (tls1__3_8h_a6ebccf75bb3d8609bc1f41333f2ea07b) >>
+>>
+endobj
+3358 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [69.87 91.627 100.555 99.29]
+/A << /S /GoTo /D (structcrypto) >>
+>>
+endobj
+3365 0 obj
+<<
+/D [3363 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+298 0 obj
+<<
+/D [3363 0 R /XYZ 70.866 771.024 null]
+>>
+endobj
+3329 0 obj
+<<
+/D [3363 0 R /XYZ 139.332 720.013 null]
+>>
+endobj
+302 0 obj
+<<
+/D [3363 0 R /XYZ 70.866 692.915 null]
+>>
+endobj
+3330 0 obj
+<<
+/D [3363 0 R /XYZ 116.71 628.986 null]
+>>
+endobj
+306 0 obj
+<<
+/D [3363 0 R /XYZ 70.866 601.807 null]
+>>
+endobj
+3332 0 obj
+<<
+/D [3363 0 R /XYZ 183.266 537.958 null]
+>>
+endobj
+310 0 obj
+<<
+/D [3363 0 R /XYZ 70.866 510.78 null]
+>>
+endobj
+3333 0 obj
+<<
+/D [3363 0 R /XYZ 149.518 446.931 null]
+>>
+endobj
+314 0 obj
+<<
+/D [3363 0 R /XYZ 70.866 417.941 null]
+>>
+endobj
+3334 0 obj
+<<
+/D [3363 0 R /XYZ 343.044 355.903 null]
+>>
+endobj
+318 0 obj
+<<
+/D [3363 0 R /XYZ 70.866 326.914 null]
+>>
+endobj
+3335 0 obj
+<<
+/D [3363 0 R /XYZ 158.968 264.876 null]
+>>
+endobj
+322 0 obj
+<<
+/D [3363 0 R /XYZ 70.866 235.994 null]
+>>
+endobj
+3336 0 obj
+<<
+/D [3363 0 R /XYZ 154.942 173.849 null]
+>>
+endobj
+326 0 obj
+<<
+/D [3363 0 R /XYZ 70.866 144.967 null]
+>>
+endobj
+3337 0 obj
+<<
+/D [3363 0 R /XYZ 123.659 82.821 null]
+>>
+endobj
+3362 0 obj
+<<
+/Font << /F50 2307 0 R /F72 2883 0 R /F79 3175 0 R /F43 2258 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+3376 0 obj
+<<
+/Length 549       
+/Filter /FlateDecode
+>>
+stream
+xÚµ•ÍrÚ0…÷~
+-íÊ•,Ùrv)m`’²(ö¢3”a\[üLƒIe‡–·�l)ÒVh„ïÑùî±|
Í žó)q®n9 �£ ðQ2E!`(Œ(Jr4r9Ž¼
…›|�'¥,ËŪ0q¥ž²Ê¬‡rêp¥’E&½qr‡ó1}}P#Cy½ë|IœßÑ›€Èö4!° eKg4”ëÿî`?èOóä1®ÅX-ö€bç›G	‚a
SLˆ×!àÞO”ÌÖ�ãCͬ¡aOË……8
+�Ôr€:>` ‘QÊÔæ±ZÙRc
�:�ÝéÎõõë	W·Úõ«;-G)Ž3rC™ÉÅzQÌLï=¦[èQp7¦v�¬¶"0P¶E-T?>h•Ui~”LjÀÂ�R?-òržþªíKÃSÊLɪ5ŠoQæ¥)y×·°AÌSåýkt^Ž>hƒ®©ŸÜ|Ÿôoâþdwü?€Í:O«´5*³¨ÃÁ%c³êÇÞÁòiùXmoõ -+©ì
? ߣâ–J-ÏOP×^.¬§gXê8¹d–Výp–q
・ö(w_À�è7VÕŸçtú€fgÝÎÐb–Õ¡p£ƒáêÚË…{üéiÛ†î©i‹SÒî&-¾¸Ý‡…,ª¶!oÏ{osŽÁ'§Là—É`lgò2ŽýÓ8ìÉBª´’¹1óÓŒ¶fýyåé¬þnfu?]Y¼µøƒ$À
+endstream
+endobj
+3375 0 obj
+<<
+/Type /Page
+/Contents 3376 0 R
+/Resources 3374 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3266 0 R
+/Annots [ 3359 0 R 3360 0 R 3361 0 R 3366 0 R 3367 0 R 3368 0 R 3369 0 R 3370 0 R ]
+>>
+endobj
+3359 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [69.87 728.819 100.555 736.482]
+/A << /S /GoTo /D (structcrypto) >>
+>>
+endobj
+3360 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [69.87 638.895 95.773 646.108]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+3361 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [170.293 546.943 229.671 554.73]
+/A << /S /GoTo /D (tls1__3_8h_a42ed9bb2d8c709a8901a509340eb9625) >>
+>>
+endobj
+3366 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [69.87 456.84 95.773 464.053]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+3367 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [175.075 364.889 234.453 372.675]
+/A << /S /GoTo /D (tls1__3_8h_a42ed9bb2d8c709a8901a509340eb9625) >>
+>>
+endobj
+3368 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [69.87 274.786 95.773 281.999]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+3369 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [175.075 182.834 234.453 190.621]
+/A << /S /GoTo /D (tls1__3_8h_a42ed9bb2d8c709a8901a509340eb9625) >>
+>>
+endobj
+3370 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [69.87 92.731 95.773 99.944]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+3377 0 obj
+<<
+/D [3375 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+330 0 obj
+<<
+/D [3375 0 R /XYZ 70.866 771.024 null]
+>>
+endobj
+3338 0 obj
+<<
+/D [3375 0 R /XYZ 130.124 720.013 null]
+>>
+endobj
+334 0 obj
+<<
+/D [3375 0 R /XYZ 70.866 691.023 null]
+>>
+endobj
+3339 0 obj
+<<
+/D [3375 0 R /XYZ 145.438 628.986 null]
+>>
+endobj
+338 0 obj
+<<
+/D [3375 0 R /XYZ 70.866 601.888 null]
+>>
+endobj
+3340 0 obj
+<<
+/D [3375 0 R /XYZ 165.379 537.958 null]
+>>
+endobj
+342 0 obj
+<<
+/D [3375 0 R /XYZ 70.866 510.86 null]
+>>
+endobj
+3341 0 obj
+<<
+/D [3375 0 R /XYZ 179.492 446.931 null]
+>>
+endobj
+346 0 obj
+<<
+/D [3375 0 R /XYZ 70.866 418.049 null]
+>>
+endobj
+3342 0 obj
+<<
+/D [3375 0 R /XYZ 199.432 355.903 null]
+>>
+endobj
+350 0 obj
+<<
+/D [3375 0 R /XYZ 70.866 327.021 null]
+>>
+endobj
+3343 0 obj
+<<
+/D [3375 0 R /XYZ 152.952 264.876 null]
+>>
+endobj
+354 0 obj
+<<
+/D [3375 0 R /XYZ 70.866 237.698 null]
+>>
+endobj
+3344 0 obj
+<<
+/D [3375 0 R /XYZ 172.892 173.849 null]
+>>
+endobj
+358 0 obj
+<<
+/D [3375 0 R /XYZ 70.866 146.67 null]
+>>
+endobj
+3345 0 obj
+<<
+/D [3375 0 R /XYZ 149.419 82.821 null]
+>>
+endobj
+3374 0 obj
+<<
+/Font << /F50 2307 0 R /F72 2883 0 R /F43 2258 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+3387 0 obj
+<<
+/Length 619       
+/Filter /FlateDecode
+>>
+stream
+xÚ½–Moâ0†ïù>&܉ã|õVh¡T[¡-Y©Z¡4©$4q´ðï׎
+-ß+zÂq<öû>3hŠu´f ]µm@öÇBÁ¹€=ÇA®O°c¢`Œ:qŒað€,B1˜.�«foC
âzzŸåeÄÊ<–�·YTÎâ”…,ÉR©ÝÚ»fò@@æêÏá(šiƒ! 1÷€[¾‡þV+gˆÚ¶©ÅÇo¨¯ýÔà hÇÄP«¶±�	6}£a€±Bh¹j»¹ØwÁ�€pW¾Œ‰^ÃÜh8|yð£?*â¢à®¯yì 2"äSeå©£ñ ±ôñæytÓ¿W«¤Nþn(Ïä&>Äò3	Á¾Gå™­·„Ã’èÃ$ ç†	z8ù@"9_ÄQ«5cÁ½Úu�pâa tÝ=
å¾<ï0°H±püÉÔW>j÷>må3æh)è,©Œ…L•ËSü^Æ…2×ÊR>o�¾`G{4W^ìÉ°w Ëdø\ç§ç™(ݦ¨�_íö³Ýmªý÷×õc˜¤ÒI’ÎKeêÅàõ]N&¨ "檇L=°×¤�£(KÓ8ª{È
+öKQè�GÁ;…Bï¥,+ÙÅÌo–Uæ“Õ1綻ä…Gñ9T…0êwß�ÑöšËú3sÙð‰å*³ï(¤M–¶b™ý7ËìH–½³X~{‘9
+Ìœå‡{m"þÖ¾Y…îs4Ïxp-Ÿ39úhoÛ¼®ƒÛvå°m–yÊ�£¾i8˜¸:©M±mSþ‹¾e%¶§qλúxMÕ²¾U-}9Üô8ý¬ñ­XW¾
+endstream
+endobj
+3386 0 obj
+<<
+/Type /Page
+/Contents 3387 0 R
+/Resources 3385 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3266 0 R
+/Annots [ 3371 0 R 3372 0 R 3373 0 R 3378 0 R 3379 0 R 3380 0 R 3381 0 R ]
+>>
+endobj
+3371 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [175.075 728.998 234.453 736.785]
+/A << /S /GoTo /D (tls1__3_8h_a42ed9bb2d8c709a8901a509340eb9625) >>
+>>
+endobj
+3372 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [69.87 638.895 95.773 646.108]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+3373 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [175.075 546.943 234.453 554.73]
+/A << /S /GoTo /D (tls1__3_8h_a42ed9bb2d8c709a8901a509340eb9625) >>
+>>
+endobj
+3378 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [69.87 456.84 95.773 464.053]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+3379 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [69.87 365.813 95.773 373.026]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+3380 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [184.64 273.861 272.709 281.648]
+/A << /S /GoTo /D (tls1__3_8h_a98c94c5986465343f350d9851e7fe594) >>
+>>
+endobj
+3381 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [184.64 182.834 272.709 190.621]
+/A << /S /GoTo /D (tls1__3_8h_a2cd5d60f1aad92bfe845b7a4d3ab2cd9) >>
+>>
+endobj
+3388 0 obj
+<<
+/D [3386 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+362 0 obj
+<<
+/D [3386 0 R /XYZ 70.866 771.024 null]
+>>
+endobj
+3346 0 obj
+<<
+/D [3386 0 R /XYZ 169.36 720.013 null]
+>>
+endobj
+366 0 obj
+<<
+/D [3386 0 R /XYZ 70.866 692.834 null]
+>>
+endobj
+3347 0 obj
+<<
+/D [3386 0 R /XYZ 183.078 628.986 null]
+>>
+endobj
+370 0 obj
+<<
+/D [3386 0 R /XYZ 70.866 600.103 null]
+>>
+endobj
+3348 0 obj
+<<
+/D [3386 0 R /XYZ 203.019 537.958 null]
+>>
+endobj
+374 0 obj
+<<
+/D [3386 0 R /XYZ 70.866 509.076 null]
+>>
+endobj
+3349 0 obj
+<<
+/D [3386 0 R /XYZ 214.675 446.931 null]
+>>
+endobj
+378 0 obj
+<<
+/D [3386 0 R /XYZ 70.866 418.049 null]
+>>
+endobj
+3350 0 obj
+<<
+/D [3386 0 R /XYZ 198.24 355.903 null]
+>>
+endobj
+382 0 obj
+<<
+/D [3386 0 R /XYZ 70.866 327.021 null]
+>>
+endobj
+3352 0 obj
+<<
+/D [3386 0 R /XYZ 270.355 264.876 null]
+>>
+endobj
+386 0 obj
+<<
+/D [3386 0 R /XYZ 70.866 235.994 null]
+>>
+endobj
+3354 0 obj
+<<
+/D [3386 0 R /XYZ 198.24 173.849 null]
+>>
+endobj
+390 0 obj
+<<
+/D [3386 0 R /XYZ 70.866 144.967 null]
+>>
+endobj
+3355 0 obj
+<<
+/D [3386 0 R /XYZ 170.992 82.821 null]
+>>
+endobj
+3385 0 obj
+<<
+/Font << /F50 2307 0 R /F72 2883 0 R /F43 2258 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+3396 0 obj
+<<
+/Length 836       
+/Filter /FlateDecode
+>>
+stream
+xÚíVËŽ›0Ýç+,u‹xl6DU¥TóRÕ.:¡R¥Ì(¢ÄIÐ2Òiþ¾×ؼòìtÝ
ûúøÜs6AKDÐÝàc8¸ºõòqÀ¹ƒÂûœ#0Ì)
+çhjy˜{È„om³d+ý3)óm\êï¹°)±d.³XÚOá'äºö„»TL¨ÑÁM8ø9 0Hm¶ò}ì3ÅëÁô‰ 9Ì}B;��^+Ë5r=sXŠ&ƒ¯r‘>§˜´üÌ00RBˆU¦Eå„⣉äKÃèáðC‚P…Gø‡]« j
ôZMM‡`ÃÏ“Y!‹"Ùd£Qg�«[ ÞT€»Ž¯
C›2båJ¼(+â8zVòbdmÅÎe¼Éç2׈=—
Ñ�~Ï[ßxþ“Ÿe?Ëò¢›áesYl×/%˜kGÙ�ŸÕCïp ÉJjÓù&Þ®eVFíê…ík“¨UR询ÔÂ5ùøjÃ_df—2“ZáRÎ
N¾Y× ²�¦µô5É–zø‘–ÊQ_
+ʱðÐæØ&ËózV‡šƒ„žÇUÒ™ƒûYT•2Pê)‡õ.ÃŽt+±Šëß—âa|Šs4ä·,ùe3ì‹(Õ÷
îí6‹•øXã@v€Ãø‘8¿K²8ÝÎÍŽ€ÞZBñ
+ÈNÓ	ÞÁX€‹Æ +Ï’+ SÐÚðCS”`á\ëFìp¼P&8×Q—™Î‹=é{5Áíxw\Êxå'
+,tjBÖí/Uӓ몳©õeü}v?žÜÏ&ºKŒ«gx³‡f=õ 0�GÐÏSO²ò<óU¹{‘Gr´«µ‘ª+µÊQLM–^Ë2JÒºê®%t¸D7ƒã�£Ó‚Þ’˜}Zä!fUá7lzíåh_åpŠLãY×ó�´J�ªqš‚�ª•¢ß	ýøDÀO´]¡÷m{ÃÂHe÷ÓñÄ!ôœ­UkRá¼³*¥ú¾vž=ë&ÜÒ®šìøKâ(Mw¦ßÝ�™Ça‚þ?@Zký>vÅò<Lú–V}³âpoânçfåz˜Ã«b|§ti5ù¡Îô]]\J�ß»¥Ê Kf=ª@ñ
+p�w
+endstream
+endobj
+3395 0 obj
+<<
+/Type /Page
+/Contents 3396 0 R
+/Resources 3394 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3401 0 R
+/Annots [ 3382 0 R 3383 0 R 3384 0 R 3389 0 R 3390 0 R 3391 0 R 3392 0 R 3393 0 R ]
+>>
+endobj
+3382 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [69.87 732.469 105.337 739.682]
+/A << /S /GoTo /D (structunihash) >>
+>>
+endobj
+3383 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [69.87 649.361 100.555 656.574]
+/A << /S /GoTo /D (structticket) >>
+>>
+endobj
+3384 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [94.777 581.162 128.169 590.618]
+/A << /S /GoTo /D (tls1__3_8h) >>
+>>
+endobj
+3389 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [114.708 430.495 136.14 438.675]
+/A << /S /GoTo /D (structunihash_aabe87d5ccd83b6b85f3078ba01911d64) >>
+>>
+endobj
+3390 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.132 429.523 243.609 439.186]
+/A << /S /GoTo /D (tls1__3_8h_aa9207c7fe4e471b0c83cd033dc023a49) >>
+>>
+endobj
+3391 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.737 416.269 130.661 426.537]
+/A << /S /GoTo /D (structunihash_a3187081af2ca6caf003ce75d3c53d30a) >>
+>>
+endobj
+3392 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [165.511 225.111 253.581 232.898]
+/A << /S /GoTo /D (tls1__3_8h_aa9207c7fe4e471b0c83cd033dc023a49) >>
+>>
+endobj
+3393 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [94.777 74.728 128.169 84.185]
+/A << /S /GoTo /D (tls1__3_8h) >>
+>>
+endobj
+3397 0 obj
+<<
+/D [3395 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+394 0 obj
+<<
+/D [3395 0 R /XYZ 70.866 771.024 null]
+>>
+endobj
+3356 0 obj
+<<
+/D [3395 0 R /XYZ 169.987 725.107 null]
+>>
+endobj
+398 0 obj
+<<
+/D [3395 0 R /XYZ 70.866 696.503 null]
+>>
+endobj
+2986 0 obj
+<<
+/D [3395 0 R /XYZ 70.866 576.224 null]
+>>
+endobj
+402 0 obj
+<<
+/D [3395 0 R /XYZ 70.866 566.224 null]
+>>
+endobj
+3398 0 obj
+<<
+/D [3395 0 R /XYZ 70.866 465.98 null]
+>>
+endobj
+406 0 obj
+<<
+/D [3395 0 R /XYZ 70.866 402.504 null]
+>>
+endobj
+410 0 obj
+<<
+/D [3395 0 R /XYZ 70.866 339.544 null]
+>>
+endobj
+3399 0 obj
+<<
+/D [3395 0 R /XYZ 70.866 301.781 null]
+>>
+endobj
+414 0 obj
+<<
+/D [3395 0 R /XYZ 70.866 275.065 null]
+>>
+endobj
+3400 0 obj
+<<
+/D [3395 0 R /XYZ 148.621 218.673 null]
+>>
+endobj
+418 0 obj
+<<
+/D [3395 0 R /XYZ 70.866 191.853 null]
+>>
+endobj
+3394 0 obj
+<<
+/Font << /F50 2307 0 R /F72 2883 0 R /F43 2258 0 R /F23 2944 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+3405 0 obj
+<<
+/Length 219       
+/Filter /FlateDecode
+>>
+stream
+xÚ•�=oÂ0†wÿŠí�ëùÛY+Z$6„7Ä�&Uj‚9þ=&iºtêtŸï{÷œ�`Ã^#{y·
+ç4ÄxÂàøJ¡“[8pÄ1nA+ƒ$}ÑMÝu�k±R>ð}Æ&�CšËõ¥»Ôç:^ú§’½EöÍdÈß!`PšŽŽm™m�PW
®ÓfÆj´F—üölÇèçé%þñ´IËÿX.ü•wæÉo¬AkM‰èŠå„ºI}êœÚðC(â÷Vhâ·ûY¬$ñ4ó.î‡yR:
+endstream
+endobj
+3404 0 obj
+<<
+/Type /Page
+/Contents 3405 0 R
+/Resources 3403 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3401 0 R
+>>
+endobj
+3406 0 obj
+<<
+/D [3404 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+3403 0 obj
+<<
+/Font << /F50 2307 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+3431 0 obj
+<<
+/Length 882       
+/Filter /FlateDecode
+>>
+stream
+xÚÍWmoÚ0þί°Ö/É\¿ÄN"M“:ú2¦(¤š¦vBYpM:b¶õßï;hÔU£­ö%>ÂùñÝsw¾AßA'-R¯˜	#šå¤õ>iíËÑ‹XR”\£�àHJ$CŽã˜¡d‚.½Î4½Õjá·‹<éI>náT ŒaN"f@jK†©tû�gse7ÙòFå:Õ³"oªÍÜ?Q†cJ…Ã(çPbê·)!ÄÓó’Ž9ž|Õ�4T×>%žZ¨<Sæ ý〣ÇRrÈ&Ql
ÏÒYn7&§#+PÌ­ðA¥“Êù�®}N¼Â½ÎŠ¼Ôi®Kû3Í'V(5(Pá-3½\¨Ò[cB†b0†Ig€<a�Ù›åÙ|9qf3¾¦)8ã6TŠo°Bq­PêÉ,×ÀÎC¤ Ä£µâ»$ 8Æ\F P‹mãÚèü�‹L§“OßãÌ_ôË"û®t½Á†šà2Б
^\Úý‡©N-™#½¨y¬g•*�¥‡Qè
,Æcbcºl!×ÃãþKÐÂèaX)š£Joìß^�96‡Æ¨sà!ÀQäl¸^æY•ô5àÒäŽðò¦LyÌÁö
+�ᨮÐ�=Tj¬—>õÊ]]-Mµ@uüôÁ¿ºr íÛ;¸J\y(SC¿µÊK ¦\w«2{G”ûï[X�ú&)ô™H¹·¸Ø•“u¨úÊÐÎÿÿ#ô,óñ¾›Çîé¾…ö¼.?W|—ùlš–Ó]}½Èg.ÕËtîz†�µÃÕ=~ýˆB+CÝ”«Vûï.ÔªÖ�.„)Äô¾¯mÞåmC�Eí€â ª;-”$Eñô[\<ÎÇÞD]Ârõ8Ýþ¸×ïm#°0ôÈæKò´4{ú¹ƒÁinÖÎ�OÁõ¤Ûï=4&Žf3Øs™1âû~&˜G¿Ó?m¢ƒ½0‡GïÍlvqÒt8áÃ?u‡�9¼$ùI·÷y|Ôé4EýE“/ù<èvN_=ÛýQ2>¯¢l2í —\œý=ÕŽ’Ö�u`îCDÀ”Î)ÊnZ—_šÀ_0bbCð¯Jñ0.
+¸=š£QëÜ~ÔÀ=$1e°öM,¥+OT®éjùj*ãÎʇEգO˜[¶Mü*dË
+endstream
+endobj
+3430 0 obj
+<<
+/Type /Page
+/Contents 3431 0 R
+/Resources 3429 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3401 0 R
+/Annots [ 3407 0 R 3408 0 R 3409 0 R 3410 0 R 3411 0 R 3412 0 R 3413 0 R 3414 0 R 3415 0 R 3416 0 R 3417 0 R 3418 0 R 3419 0 R 3420 0 R ]
+>>
+endobj
+3407 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.326 379.554 131.782 387.733]
+/A << /S /GoTo /D (structret) >>
+>>
+endobj
+3408 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.326 350.805 160.196 359.957]
+/A << /S /GoTo /D (structee__status) >>
+>>
+endobj
+3409 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.326 322.218 146.002 332.182]
+/A << /S /GoTo /D (structcrypto) >>
+>>
+endobj
+3410 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.326 296.227 141.887 304.711]
+/A << /S /GoTo /D (structticket) >>
+>>
+endobj
+3411 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.326 268.452 152.718 276.936]
+/A << /S /GoTo /D (structunihash) >>
+>>
+endobj
+3412 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.326 239.703 173.143 249.366]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+3413 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 159.034 169.028 168.697]
+/A << /S /GoTo /D (tls1__3_8h_a4b5c95f51c533c0244b705634b2c35b8) >>
+>>
+endobj
+3414 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 146.143 201.342 155.806]
+/A << /S /GoTo /D (tls1__3_8h_afb40225335cfd9cfc043af5c42a32ffa) >>
+>>
+endobj
+3415 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 133.251 192.546 142.914]
+/A << /S /GoTo /D (tls1__3_8h_a5285f40796ab54428826d61d50c616ed) >>
+>>
+endobj
+3416 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 120.36 174.919 130.023]
+/A << /S /GoTo /D (tls1__3_8h_a3421319257516c96f3fff9442c7a10ae) >>
+>>
+endobj
+3417 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 107.468 166.535 117.132]
+/A << /S /GoTo /D (tls1__3_8h_aaa704b6b56f5f74fdaad5b877e9ff5e0) >>
+>>
+endobj
+3418 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 94.577 173.009 104.24]
+/A << /S /GoTo /D (tls1__3_8h_a1f9984d3424408116f870aa3ffbd8c82) >>
+>>
+endobj
+3419 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 82.578 166.042 91.349]
+/A << /S /GoTo /D (tls1__3_8h_a049edff83685de08215c79860380f46f) >>
+>>
+endobj
+3420 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 68.794 202.947 78.457]
+/A << /S /GoTo /D (tls1__3_8h_ab8cf2ea30c61636731a446049a93181a) >>
+>>
+endobj
+3432 0 obj
+<<
+/D [3430 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+422 0 obj
+<<
+/D [3430 0 R /XYZ 70.866 771.024 null]
+>>
+endobj
+2894 0 obj
+<<
+/D [3430 0 R /XYZ 70.866 571.701 null]
+>>
+endobj
+426 0 obj
+<<
+/D [3430 0 R /XYZ 70.866 571.701 null]
+>>
+endobj
+3433 0 obj
+<<
+/D [3430 0 R /XYZ 70.866 418.905 null]
+>>
+endobj
+3434 0 obj
+<<
+/D [3430 0 R /XYZ 70.866 199.358 null]
+>>
+endobj
+3429 0 obj
+<<
+/Font << /F67 2878 0 R /F50 2307 0 R /F43 2258 0 R /F72 2883 0 R /F23 2944 0 R /F70 2881 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+3505 0 obj
+<<
+/Length 1158      
+/Filter /FlateDecode
+>>
+stream
+xÚÅZQsÚ8~çWhz/f:q$Ù–íGc¨ql×)\Òñä.íL“ö2ÜÜõßweLÀ&É/ÀX²öÓ·ŸvWBÝ!ŒÆ½�ê�Ž<Œ;dÌAêOäc;`ù!µAê]ZîTï�MŽËà½êéèó—Eÿ„ú�5üzó÷ýâay½üüõAwíqÕû«G 'FäçˆA`ÔE7÷½Ë�ÝBÛ;#†
ú§êy�\ϱ=×�ß_�ì½ïá%~ŠÚ¡
|›yò±ñî¥^…býº<ñ<fýv»¸Â˜>,êF�íñ®YTÝôl&óA!†Ûègó!F'„Ú~p³ió¢ï`K5™ÆͦéAL2*¥l2Kºœ1�ã³´ËÙ“>!@s‹íN�Új1Ë:5û¡$MFÝ.y£´É¨×åL/x1ȤPó�1Zºû–ÈʼèSle}W¯<øÈâ,Ùz¹zÔDÈrΣb—#ߢ˜vªÃ<“ªœÈ2ê{ØšªÉþ	Æfœžª²1Êí�}bm­™Ž\šŽy¾ÒA)¹R"¿LIjž‹8JL©p\ž'"f¢>
ù*‘¥Ï+¹~ÿ
+{øæÓõ£n;Q†BH§ð锄¡í?S< qV½6’®k‡
ùÕÇ#zÄ7Ÿ–Ëo§Ä&oô“M»'»¶ËüƒÒ%I¦•ô
•Œ*•ˆqʇFïJ)%,_È&®þ9Ô”×Þ¨>#SZ�“ˆzL ^‘Ãé!í;�ÛjŸvÈjû¡­ö�®íŸG³rI°?)åÚ÷•xŸ]{ä	¢ÆZÃ5AÉûóF�Ю	˜y8`VŽOËyX4&xà3­Ì2‰<9"ŒQéh9n,7LR î¶¦£Q)Åï¼-1±ä-p²›Eºá%O´LDº‡ ˆ¡•	4±ÈõªåÅ^8/$ê°þ[n¥Ž+-„<¡i�4µÎj(
ÆFâ,¬jbA)Ò$L�¨F
+€0.óé¢î¼u}A–4ˆFò¸àê¿
¢Jë¤<-ø±ªRãìY…¾	vj0y&õªâ3õjL�ô	™‰7Rã©jþÍñ$‚|‘ðÔøÙÕ><û²jë¨OF|fz[;E‡:6q¶7Š
6öíwSËí¤C›ÒMjIt´¨N*ö¹ÙLÊÝÂòÿ\¼>€y‘{‰kc�Ë¿$´±ãw³”'ºÞ+øp]ÚH5T—+Ÿi'·qIÈL¨mµQá©YÚ|FM\#åL}è׺qcF#.C«SÌT.ëÓ½ØWw#ŒÄYÎD!FŽ5²©Ò;¤©*gÅ°ÝA†jïìEÛÚ磳žØÞYYoŸdS/McÛWo–(it~LÕÈ©MžÕõí°¯ÎʧyóßžØCÛ ¤Ë׬îÃr”ëørVžgC.�rŽ»yþ!§B5Ù´ÓtÕÀó | ¯¹i°¾Álê3·*d<×ö<¾mCV“/�×ËÅíêÞÃZCß×w ´ÿý~×?!ØZ<lcü
Æ{õ
+endstream
+endobj
+3504 0 obj
+<<
+/Type /Page
+/Contents 3505 0 R
+/Resources 3503 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3401 0 R
+/Annots [ 3421 0 R 3422 0 R 3423 0 R 3424 0 R 3425 0 R 3426 0 R 3427 0 R 3428 0 R 3443 0 R 3444 0 R 3445 0 R 3446 0 R 3447 0 R 3448 0 R 3449 0 R 3450 0 R 3451 0 R 3452 0 R 3453 0 R 3454 0 R 3455 0 R 3456 0 R 3457 0 R 3458 0 R 3459 0 R 3460 0 R 3461 0 R 3462 0 R 3463 0 R 3464 0 R 3465 0 R 3466 0 R 3467 0 R 3468 0 R 3469 0 R 3470 0 R 3471 0 R 3472 0 R 3473 0 R 3474 0 R 3475 0 R 3476 0 R 3477 0 R 3478 0 R 3479 0 R 3480 0 R 3481 0 R 3482 0 R 3483 0 R 3484 0 R 3485 0 R 3486 0 R 3487 0 R 3488 0 R 3489 0 R 3490 0 R 3491 0 R 3492 0 R 3493 0 R 3494 0 R 3495 0 R 3496 0 R 3497 0 R 3498 0 R ]
+>>
+endobj
+3421 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 760.065 162.545 768.446]
+/A << /S /GoTo /D (tls1__3_8h_a3c848b937dc1157faba5f472dc7db882) >>
+>>
+endobj
+3422 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 747.1 166.257 755.871]
+/A << /S /GoTo /D (tls1__3_8h_ac9878986a7bbcc614ed54916bec7805d) >>
+>>
+endobj
+3423 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 733.426 164.051 743.089]
+/A << /S /GoTo /D (tls1__3_8h_add4dcdeac40e0b135f1cb39761bfaba0) >>
+>>
+endobj
+3424 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 720.645 164.545 730.308]
+/A << /S /GoTo /D (tls1__3_8h_ade5e8b3c09f907dfea533f4e63927998) >>
+>>
+endobj
+3425 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 707.863 161.568 717.526]
+/A << /S /GoTo /D (tls1__3_8h_a60660b382346187ab8f42fb9c6bb9431) >>
+>>
+endobj
+3426 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 695.082 164.051 704.745]
+/A << /S /GoTo /D (tls1__3_8h_a3a54ac117bb30599d5df5f4ff08a0fda) >>
+>>
+endobj
+3427 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 682.301 153.579 691.757]
+/A << /S /GoTo /D (tls1__3_8h_a5a8bc0678d19bace9ec042d79a98bf25) >>
+>>
+endobj
+3428 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 669.519 153.579 678.976]
+/A << /S /GoTo /D (tls1__3_8h_a6b1381fd0d59dde7504bb25677c05034) >>
+>>
+endobj
+3443 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 657.63 179.993 666.401]
+/A << /S /GoTo /D (tls1__3_8h_a066901ffac09dc72c1f6a76d29b1c575) >>
+>>
+endobj
+3444 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [180.493 656.738 246.361 666.401]
+/A << /S /GoTo /D (tls1__3_8h_a5285f40796ab54428826d61d50c616ed) >>
+>>
+endobj
+3445 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 643.956 178.496 653.619]
+/A << /S /GoTo /D (tls1__3_8h_a167e5f8ab01015ba2b24bf9467b8a835) >>
+>>
+endobj
+3446 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 631.175 199.468 640.838]
+/A << /S /GoTo /D (tls1__3_8h_aa09cb16a1c0c65587c7b35f635b1bee5) >>
+>>
+endobj
+3447 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 618.394 189.677 628.057]
+/A << /S /GoTo /D (tls1__3_8h_a79e3c0e2a67a84f1df4ce57b575c3a87) >>
+>>
+endobj
+3448 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [190.177 618.394 228.044 628.057]
+/A << /S /GoTo /D (tls1__3_8h_ade5e8b3c09f907dfea533f4e63927998) >>
+>>
+endobj
+3449 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 605.612 209.071 615.275]
+/A << /S /GoTo /D (tls1__3_8h_afca50ec5894e2701729585222f4a7334) >>
+>>
+endobj
+3450 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [209.571 606.504 248.935 615.275]
+/A << /S /GoTo /D (tls1__3_8h_a049edff83685de08215c79860380f46f) >>
+>>
+endobj
+3451 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 592.831 262.725 602.494]
+/A << /S /GoTo /D (tls1__3_8h_abb32cd9141ad1aa4bf07b0abe6374ad1) >>
+>>
+endobj
+3452 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 580.049 226.564 589.713]
+/A << /S /GoTo /D (tls1__3_8h_a72d3239eb2ab8dcbda07d02d79ebc63c) >>
+>>
+endobj
+3453 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 567.268 205.673 576.725]
+/A << /S /GoTo /D (tls1__3_8h_a3690b60b2a57b35be9bd056794433f2a) >>
+>>
+endobj
+3454 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 554.487 193.954 564.15]
+/A << /S /GoTo /D (tls1__3_8h_ac12ec152c87531d806610734b2fd181f) >>
+>>
+endobj
+3455 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 541.705 193.954 551.368]
+/A << /S /GoTo /D (tls1__3_8h_ae482545ce00b782ff5222bd4e4d815d5) >>
+>>
+endobj
+3456 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 528.924 193.954 538.587]
+/A << /S /GoTo /D (tls1__3_8h_ac5909a9a61a8f148a5fca14f45e96a51) >>
+>>
+endobj
+3457 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 516.142 231.155 525.806]
+/A << /S /GoTo /D (tls1__3_8h_aa9207c7fe4e471b0c83cd033dc023a49) >>
+>>
+endobj
+3458 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 503.361 199.423 513.024]
+/A << /S /GoTo /D (tls1__3_8h_a42ed9bb2d8c709a8901a509340eb9625) >>
+>>
+endobj
+3459 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 490.58 192.456 500.243]
+/A << /S /GoTo /D (tls1__3_8h_adf01762e375d30f644666e9fe3be27c1) >>
+>>
+endobj
+3460 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 477.798 225.847 487.461]
+/A << /S /GoTo /D (tls1__3_8h_a4112a74ab8350a9235a89999be0c5031) >>
+>>
+endobj
+3461 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 465.017 224.851 474.68]
+/A << /S /GoTo /D (tls1__3_8h_aaaff359295e4b584c446f7d4fd27be25) >>
+>>
+endobj
+3462 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 452.236 199.154 461.899]
+/A << /S /GoTo /D (tls1__3_8h_a6c61024505208107a3b5010f70640761) >>
+>>
+endobj
+3463 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 439.454 225.246 449.117]
+/A << /S /GoTo /D (tls1__3_8h_a98c94c5986465343f350d9851e7fe594) >>
+>>
+endobj
+3464 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 426.673 230.052 436.336]
+/A << /S /GoTo /D (tls1__3_8h_af4b172387ab1e36244119578e9a1bb2a) >>
+>>
+endobj
+3465 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 413.891 238.014 423.555]
+/A << /S /GoTo /D (tls1__3_8h_a195baf7c0a79fcc73992de601a924249) >>
+>>
+endobj
+3466 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 401.11 223.569 410.773]
+/A << /S /GoTo /D (tls1__3_8h_a67c5a0f262db5cd2a04c62a779cc2d4b) >>
+>>
+endobj
+3467 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 388.329 219.588 397.992]
+/A << /S /GoTo /D (tls1__3_8h_a180698b245499ea37cbd0db4177539f9) >>
+>>
+endobj
+3468 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 375.547 203.915 385.21]
+/A << /S /GoTo /D (tls1__3_8h_a5ce95d1c789558704c065f9f3ae81f96) >>
+>>
+endobj
+3469 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 362.766 261.227 372.429]
+/A << /S /GoTo /D (tls1__3_8h_aa2f489c72d9cc424aea5765fde328c28) >>
+>>
+endobj
+3470 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 349.984 279.16 359.648]
+/A << /S /GoTo /D (tls1__3_8h_abec1420658f3a4247bcb5aa14154b6e6) >>
+>>
+endobj
+3471 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 337.203 250.665 346.866]
+/A << /S /GoTo /D (tls1__3_8h_a8f6dc1d52e683902482d52744ac0a996) >>
+>>
+endobj
+3472 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 324.422 263.72 334.085]
+/A << /S /GoTo /D (tls1__3_8h_a4c85c11a6ec5c8302e25ffec8b87c173) >>
+>>
+endobj
+3473 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 311.64 278.882 321.303]
+/A << /S /GoTo /D (tls1__3_8h_a53cbdcdf0624fb62fa2f42aa21f8f4ac) >>
+>>
+endobj
+3474 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 298.859 281.652 308.522]
+/A << /S /GoTo /D (tls1__3_8h_ad5806394d68a0686c653c2898812f310) >>
+>>
+endobj
+3475 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 286.078 266.24 295.741]
+/A << /S /GoTo /D (tls1__3_8h_a82554141e636ee8308756de7a6797c12) >>
+>>
+endobj
+3476 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 273.296 268.732 282.959]
+/A << /S /GoTo /D (tls1__3_8h_a22d9f24915e2fb809959c6479508bfe8) >>
+>>
+endobj
+3477 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [272.218 273.296 411.779 282.959]
+/A << /S /GoTo /D (tls1__3_8h_a82554141e636ee8308756de7a6797c12) >>
+>>
+endobj
+3478 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [414.768 273.296 511.659 282.959]
+/A << /S /GoTo /D (tls1__3_8h_a67c5a0f262db5cd2a04c62a779cc2d4b) >>
+>>
+endobj
+3479 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 260.515 261.703 270.178]
+/A << /S /GoTo /D (tls1__3_8h_a2716011f133618b6340c7172ba3fdf11) >>
+>>
+endobj
+3480 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 247.733 264.195 257.397]
+/A << /S /GoTo /D (tls1__3_8h_a18f2498943999661836821eebb57e028) >>
+>>
+endobj
+3481 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [267.681 247.733 402.705 257.397]
+/A << /S /GoTo /D (tls1__3_8h_a2716011f133618b6340c7172ba3fdf11) >>
+>>
+endobj
+3482 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [405.694 247.733 502.585 257.397]
+/A << /S /GoTo /D (tls1__3_8h_a67c5a0f262db5cd2a04c62a779cc2d4b) >>
+>>
+endobj
+3483 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 234.952 278.147 244.615]
+/A << /S /GoTo /D (tls1__3_8h_a29dec32cb8bb66baf1c850df2c876499) >>
+>>
+endobj
+3484 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 222.171 231.316 231.834]
+/A << /S /GoTo /D (tls1__3_8h_a73d8ba16d80d060c50c69ea830d953a9) >>
+>>
+endobj
+3485 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 209.389 232.311 219.052]
+/A << /S /GoTo /D (tls1__3_8h_a6e383f8f299532a58fa8b88767f18daf) >>
+>>
+endobj
+3486 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 196.608 223.838 206.271]
+/A << /S /GoTo /D (tls1__3_8h_ae154ece6999205b2a3ff49fa15ec3eaf) >>
+>>
+endobj
+3487 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 183.826 207.905 193.49]
+/A << /S /GoTo /D (tls1__3_8h_a61e226bbacb67ab860103722e75b66e8) >>
+>>
+endobj
+3488 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 171.045 216.522 180.708]
+/A << /S /GoTo /D (tls1__3_8h_a22c1533a4932e7a5b3647ccbe3cbde95) >>
+>>
+endobj
+3489 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 158.264 209.394 167.927]
+/A << /S /GoTo /D (tls1__3_8h_addc28cf3340526efbb1bed511d798e91) >>
+>>
+endobj
+3490 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 145.482 280.128 155.145]
+/A << /S /GoTo /D (tls1__3_8h_a51e1cfe6d71ad92d7503c207cf9be105) >>
+>>
+endobj
+3491 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 132.701 229.729 142.364]
+/A << /S /GoTo /D (tls1__3_8h_a2cd5d60f1aad92bfe845b7a4d3ab2cd9) >>
+>>
+endobj
+3492 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [233.215 132.701 386.665 142.364]
+/A << /S /GoTo /D (tls1__3_8h_a51e1cfe6d71ad92d7503c207cf9be105) >>
+>>
+endobj
+3493 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [389.909 132.701 479.752 142.364]
+/A << /S /GoTo /D (tls1__3_8h_a22c1533a4932e7a5b3647ccbe3cbde95) >>
+>>
+endobj
+3494 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 119.92 241.825 129.583]
+/A << /S /GoTo /D (tls1__3_8h_a6ebccf75bb3d8609bc1f41333f2ea07b) >>
+>>
+endobj
+3495 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 107.138 273.709 116.801]
+/A << /S /GoTo /D (tls1__3_8h_a32abf56070a1d443df8f6748e8d8e534) >>
+>>
+endobj
+3496 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 94.357 256.457 104.02]
+/A << /S /GoTo /D (tls1__3_8h_a967027b262594c98eebfbb882a762dd7) >>
+>>
+endobj
+3497 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 81.575 230.321 91.238]
+/A << /S /GoTo /D (tls1__3_8h_a11e5ff8f28ac9380b39562a9db75fa77) >>
+>>
+endobj
+3498 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 68.794 245.761 78.457]
+/A << /S /GoTo /D (tls1__3_8h_a91ddc107caabf6c6629bb5157f27649e) >>
+>>
+endobj
+3506 0 obj
+<<
+/D [3504 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+3503 0 obj
+<<
+/Font << /F50 2307 0 R /F43 2258 0 R /F26 2949 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+3612 0 obj
+<<
+/Length 1050      
+/Filter /FlateDecode
+>>
+stream
+xÚ½YMoÛF½ëW,Ðy0»\’:ÒäJdD‰Ì’J¥:Á"±·€ã¢N€:ÿ¾³”ì*Ž–B
�}ÐiΛ7³ovf)¹!”Ì'—Ýä×™¤$	¦Q$H÷™Ä4H¢ˆÄSDŒt;råE
ó/xœxßn¿2#‚?ößfÞöûOºÿì3êõ÷ýÝuïèÞ�0�ŒØž ˜ýu¢ºÉß?Rž%I�ð�\™\} d×ÞˆiBþîüBB	íÃnI;y;¡ðôØ	¸þŸIDR�8b
}ôâ=çr@ñøoäêBÊÈûe׿§”ßõ‡‹ÛýÍ
¤n³>vUkRÕÆ}æ%fž-M[¤\FÏŸio¦LPöãJ.âäeáÀC˜=ÂIè„ÃOÃá/'+R_PÞ85
Àª+Ÿ…ÔÛ‚qyŽ,ñdb—��]ˆMÖ38É9@“Ÿ
—’MOÛ¦@²¦ùVe
ø®ÙÏâ

‹1ÃaÍÃÂ1Ÿ`{/91?Åô~†‰+ò¬Çt|±½T:Ž’Ó~‡<ä˜Ö‹í¥.s³Ø¸Ì»rþehWYÞ¦fÈ|X_6ùG€†¸
+yŽ³œÐ�½a%2<GºØy™`iÓ´­Ñ- IÕx¤Wñ`XXܼ$®º�Æ‹d܉%Bçe‘µÌ–3K‰½&�±¬eèÑ9âM„ˈÊÇöv�SÔŸ—UÙåzÉ%vJQKÍ“}á´/^Å>¶åî•1�¡6	M»ð%õê…;(&`ÿ7¨,…r„
½a›­«Êé*·zY¤uŠ†Ýz¨M§ô*…æÌ36$'0pd&˜¡ŽC»�L
3|̼@÷^Œ™±Í³nr:óÔgœz�2«Ú~íŒV`ÿ­�å¬UÛ©ü$LìàüO+ÀÄF01ÜM[Ùz§´Y¥K—xÀj“ºnšZÛù
+P`æÚfjÖºi]ÝýˆÊJ97i5o�t ŽšºíöJZ@–xeR£uW¸Ø¨¢òÄhj¦öqr"AU×…ÚÚ}¸væ©È5Þ,ëÜi�㦅VƒïÐ×C$ÔÖ>Å.õ #ó4þ	3Y]/JuZ»™gÝ¿FÝî§ú0ø5Ç2>¼¦Îˆ ŠÕ2ݘ™ÆÓsS©ÕxpKn[Öì‰Èó`ŒŒ\Q'¾iÓ˜æPDlå·/uVWÎ$jqÓ*«unÚòwe{Õª\–Nõd¨¹›U¥ZuOnºmã”2ÜØÑ®ã
°Ó('5¨§EëêXè‹�“µ*³ƒŒ”v׳rÀ@#¤ÕhaÇ]°lvæÊdeSØ=º£¸<Ë€Sç­R°ú?Ç­�gÄQÀã(<:#eÁÛàÞ¼¿ëï?~ëwûáOVZ¾ï?çYÖ¾ßøö�øî9Ä
§ó½“
+endstream
+endobj
+3611 0 obj
+<<
+/Type /Page
+/Contents 3612 0 R
+/Resources 3610 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3401 0 R
+/Annots [ 3499 0 R 3500 0 R 3501 0 R 3502 0 R 3555 0 R 3556 0 R 3557 0 R 3558 0 R 3559 0 R 3560 0 R 3561 0 R 3562 0 R 3563 0 R 3564 0 R 3565 0 R 3566 0 R 3567 0 R 3568 0 R 3569 0 R 3570 0 R 3571 0 R 3572 0 R 3573 0 R 3574 0 R 3575 0 R 3576 0 R 3577 0 R 3578 0 R 3579 0 R 3580 0 R 3581 0 R 3582 0 R 3583 0 R 3584 0 R 3585 0 R 3586 0 R 3587 0 R 3588 0 R 3589 0 R 3590 0 R 3591 0 R 3592 0 R 3593 0 R 3594 0 R 3595 0 R 3596 0 R 3597 0 R 3598 0 R 3599 0 R 3600 0 R 3601 0 R 3602 0 R 3603 0 R 3604 0 R 3605 0 R ]
+>>
+endobj
+3499 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 758.989 252.261 768.652]
+/A << /S /GoTo /D (tls1__3_8h_ad99d010ce10246c2f28dd95d82aacae2) >>
+>>
+endobj
+3500 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 746.207 252.261 755.871]
+/A << /S /GoTo /D (tls1__3_8h_a113044f98597022ad8f8bc35aa06f9c5) >>
+>>
+endobj
+3501 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 733.426 283.625 743.089]
+/A << /S /GoTo /D (tls1__3_8h_a1fd998a580e8d1967290fd852d061254) >>
+>>
+endobj
+3502 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 720.645 251.759 730.308]
+/A << /S /GoTo /D (tls1__3_8h_a8ea3efe20abf6ad015aa261fc70eb028) >>
+>>
+endobj
+3555 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 707.863 261.73 717.526]
+/A << /S /GoTo /D (tls1__3_8h_ab1d7f8d913b1fa59531259ec86f55e9f) >>
+>>
+endobj
+3556 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 695.974 159.577 704.539]
+/A << /S /GoTo /D (tls1__3_8h_ad8c5b4de72ef653ee9b32ffd15d247a5) >>
+>>
+endobj
+3557 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 683.193 179.5 691.964]
+/A << /S /GoTo /D (tls1__3_8h_a28919a9959f0147a4bb0284a2060cf20) >>
+>>
+endobj
+3558 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 670.411 179.5 679.182]
+/A << /S /GoTo /D (tls1__3_8h_af4c06a7b9ea8f5fdf71a5a5c2674ace3) >>
+>>
+endobj
+3559 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 657.63 179.5 666.401]
+/A << /S /GoTo /D (tls1__3_8h_a188be171b89d59fe6f907a86687013a2) >>
+>>
+endobj
+3560 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 644.848 149.607 653.413]
+/A << /S /GoTo /D (tls1__3_8h_afacb94b91c071b8332028b5807b083c8) >>
+>>
+endobj
+3561 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 632.067 174.022 640.632]
+/A << /S /GoTo /D (tls1__3_8h_a45167996bc287391d11954085deece97) >>
+>>
+endobj
+3562 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 618.394 179.491 627.85]
+/A << /S /GoTo /D (tls1__3_8h_a0a1f060193ab58a3c90b82988479d5b5) >>
+>>
+endobj
+3563 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 605.612 253.75 615.275]
+/A << /S /GoTo /D (tls1__3_8h_a36987d5e686aa8d5a5752fad188fc972) >>
+>>
+endobj
+3564 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 592.831 253.75 602.494]
+/A << /S /GoTo /D (tls1__3_8h_a7cb9531118755e07150f13a13e0586ff) >>
+>>
+endobj
+3565 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 580.049 253.75 589.713]
+/A << /S /GoTo /D (tls1__3_8h_a85f8537a722e3f7833a467fb9fecf211) >>
+>>
+endobj
+3566 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 567.268 237.808 576.931]
+/A << /S /GoTo /D (tls1__3_8h_a842a772cc913a9329c2605ac1c726cee) >>
+>>
+endobj
+3567 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 554.487 237.808 564.15]
+/A << /S /GoTo /D (tls1__3_8h_a3bdac7e874fc054099ed13e2a11e9a0a) >>
+>>
+endobj
+3568 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 541.705 237.808 551.368]
+/A << /S /GoTo /D (tls1__3_8h_aa19413c3cb45e1f92b296849b6b17a15) >>
+>>
+endobj
+3569 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 528.924 219.866 538.587]
+/A << /S /GoTo /D (tls1__3_8h_ab51d51d7876ee5c968ea17cba18d05bd) >>
+>>
+endobj
+3570 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 516.142 219.866 525.806]
+/A << /S /GoTo /D (tls1__3_8h_a85ec2b846bed1bc0c03afcb993181e9b) >>
+>>
+endobj
+3571 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 503.361 219.866 513.024]
+/A << /S /GoTo /D (tls1__3_8h_ac8954b72bcbbc464c28389c5747773bf) >>
+>>
+endobj
+3572 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 491.472 166.051 500.037]
+/A << /S /GoTo /D (tls1__3_8h_acfb97ea44efc04325334d1a273df53e2) >>
+>>
+endobj
+3573 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 478.69 178.487 487.255]
+/A << /S /GoTo /D (tls1__3_8h_a8b48566d29d02563199fd2e1d4795afd) >>
+>>
+endobj
+3574 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 465.909 178.487 474.474]
+/A << /S /GoTo /D (tls1__3_8h_ada0646eb6ae96c28f6732940012c9f2b) >>
+>>
+endobj
+3575 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 452.236 204.408 461.692]
+/A << /S /GoTo /D (tls1__3_8h_ac86ed785ce39c6020955310031a657a1) >>
+>>
+endobj
+3576 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 440.346 159.12 449.117]
+/A << /S /GoTo /D (tls1__3_8h_a35d45aeb44dc1ea7d0ee616ce4fa71d0) >>
+>>
+endobj
+3577 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 427.565 186.458 436.336]
+/A << /S /GoTo /D (tls1__3_8h_a705424dcab1cd0d9b75ea9a3e7dc6a31) >>
+>>
+endobj
+3578 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 413.891 232.805 423.555]
+/A << /S /GoTo /D (tls1__3_8h_a80fd9475005bfe22a8ba827f92d2d792) >>
+>>
+endobj
+3579 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 401.11 220.359 410.773]
+/A << /S /GoTo /D (tls1__3_8h_a104cb3663af17a0a687b0cd725341b7a) >>
+>>
+endobj
+3580 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 388.329 160.07 397.992]
+/A << /S /GoTo /D (tls1__3_8h_a5bddff8a4478c3fa9e4b6485d48a0a0c) >>
+>>
+endobj
+3581 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 375.547 160.07 385.21]
+/A << /S /GoTo /D (tls1__3_8h_a3ac18852b5f71d1499f5e1536311b12a) >>
+>>
+endobj
+3582 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 362.766 160.07 372.429]
+/A << /S /GoTo /D (tls1__3_8h_a77304588f23598f8a1a70c214642e6e6) >>
+>>
+endobj
+3583 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 349.984 279.25 359.648]
+/A << /S /GoTo /D (tls1__3_8h_ab78f7bb814bfba2dee9ce08b0ea1a85c) >>
+>>
+endobj
+3584 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 337.203 255.695 346.866]
+/A << /S /GoTo /D (tls1__3_8h_a499ed5d3f8ea8654bb19ef0e7c82a93c) >>
+>>
+endobj
+3585 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 324.422 195.98 334.085]
+/A << /S /GoTo /D (tls1__3_8h_af00aa3c79fe31d435739c34e4c989835) >>
+>>
+endobj
+3586 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 311.64 227.864 321.303]
+/A << /S /GoTo /D (tls1__3_8h_ac6862054ffa24641798cd70bae3a7ae3) >>
+>>
+endobj
+3587 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 298.859 173.027 308.522]
+/A << /S /GoTo /D (tls1__3_8h_a645a56d77daf4a5df13383d7123b96b2) >>
+>>
+endobj
+3588 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 286.078 242.811 295.741]
+/A << /S /GoTo /D (tls1__3_8h_a120e75c22f78b1ed453126173a3a135b) >>
+>>
+endobj
+3589 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 273.296 202.149 282.959]
+/A << /S /GoTo /D (tls1__3_8h_a4217616afae0660885777b6ab586c3a7) >>
+>>
+endobj
+3590 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 260.515 182.486 270.178]
+/A << /S /GoTo /D (tls1__3_8h_a67f92f94d0d69f03e4f43fa9a0462c03) >>
+>>
+endobj
+3591 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 247.733 178.496 257.397]
+/A << /S /GoTo /D (tls1__3_8h_a48c56124c4f5ee1c5eeb4b509218ad90) >>
+>>
+endobj
+3592 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 234.952 207.394 244.615]
+/A << /S /GoTo /D (tls1__3_8h_afd58bdc9a1a5abec5cb8b6861b0901c4) >>
+>>
+endobj
+3593 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 222.171 168.535 231.834]
+/A << /S /GoTo /D (tls1__3_8h_a60fb8e077f876e00793b8d7c63219e08) >>
+>>
+endobj
+3594 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 210.281 163.549 219.052]
+/A << /S /GoTo /D (tls1__3_8h_a324017af35e723864b7074e43ecb1623) >>
+>>
+endobj
+3595 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 196.608 183.204 206.065]
+/A << /S /GoTo /D (tls1__3_8h_acde772ee66a2f66efeaf3be1b7f77283) >>
+>>
+endobj
+3596 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 183.826 219.077 193.49]
+/A << /S /GoTo /D (tls1__3_8h_a17a27683a309d3bfe24ca6ed5c945c96) >>
+>>
+endobj
+3597 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 171.937 168.445 180.708]
+/A << /S /GoTo /D (tls1__3_8h_a3eebd09a9a94c914de17855816e6ac45) >>
+>>
+endobj
+3598 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 158.264 201.019 167.927]
+/A << /S /GoTo /D (tls1__3_8h_a0b18b7af6e4667ed600f1a9e18b3702e) >>
+>>
+endobj
+3599 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 145.482 220.341 155.145]
+/A << /S /GoTo /D (tls1__3_8h_a94eb0868bd96c94f6335175ebee6522c) >>
+>>
+endobj
+3600 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 132.701 218.082 142.364]
+/A << /S /GoTo /D (tls1__3_8h_a347fed99b27daf3cd0d2cc6bce4ee14d) >>
+>>
+endobj
+3601 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 119.92 222.619 129.583]
+/A << /S /GoTo /D (tls1__3_8h_aac0f8b417bb22e204b8f167d80054c8e) >>
+>>
+endobj
+3602 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 108.03 165.54 116.801]
+/A << /S /GoTo /D (tls1__3_8h_a6c3df225e23ad8a213f3e2fd8b027d71) >>
+>>
+endobj
+3603 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 95.249 186.888 104.02]
+/A << /S /GoTo /D (tls1__3_8h_a796bd7c6ba2e59281760fb155c6287e8) >>
+>>
+endobj
+3604 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 82.651 157.3 91.032]
+/A << /S /GoTo /D (tls1__3_8h_ada3f1f3fa9b684d837200490fbb07c26) >>
+>>
+endobj
+3605 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 68.794 205.888 78.457]
+/A << /S /GoTo /D (tls1__3_8h_ae62b03ae6897545150d9d761d135cd86) >>
+>>
+endobj
+3613 0 obj
+<<
+/D [3611 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+3610 0 obj
+<<
+/Font << /F50 2307 0 R /F43 2258 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+3726 0 obj
+<<
+/Length 1138      
+/Filter /FlateDecode
+>>
+stream
+xÚ½YÛnÛ8}÷WØéAZê.cŸ‰²ÙÈ”«KkoZmí[d±éßïPò-Y2í¿8F$‹Gg†gÎ)¹%”Ì&WÝä÷2¢$u§q�î3I¨›Æ1I¦¾{¤Û�+ðí÷Ý+À¥ ŒáwÃË/_·¶ã'©U|ûô÷ÝvwÿáþË·�ºuºÉ_î¤Ä;>1MÝÔɧ»ÉÍ{J6pí�'NSòÏpç	£À�¾%íäõ„îQÒs´pý„6MÜ8
+H{.=À}çûÑ€âð3rãDQlý¶Ù¾£Ôßm÷¶ï·{�Íp›z›Ž/X!ë¾{úu‘>PÛ³¼Ç—(q<ßMÒ—Y?¯8�œ³ªªÿ!Qëû/²~Ë;¢ÖÖàuk>*
# �’ç™íùð•p|Ĥã€C6ìµíQ«g­>3€¨º¹%bÃ˵ÅgL%¼�³B„˜ñ`"òs½ì`›²¬×1ÑòZ´†ôH1Ùèx~ÍLR�JÄ5[Ë~YØ!µžß*$¨,XÛf*3gLÎ
‹ÕÎõHJ†	ƒ	�íR²¬
ÑVÖòœœá33j„¨y&Švž]3�•­cúb…+ª¢VŒt²«ZO:êúWY!�*–Ï3.t
qÌpðB.x»Ø§E®MUǬb/CD/–×3ÁÿƒÅØJ«!jbªhm†c¾ÿÛÆök1“'ñP4hIHPÅ‹·-ÃÞ<Vx™×¢3%ÅJ¦Ô¡ïæà
�ÆŠ›J’ÒN¦JÎ,^õ�žª)öîUiÛ¦=ãQì|5Õ[HXÏ»„t²Õ’å�Îþ(¸–8“eÝ}¼à"nXõG€¤.j@/Ä5Yï–¤нÕÇ&BuÅusÅ‹‚‰G–TÏGŒ¡E¶9ƒ=5䪢²Å²[?.óÅÀEŠÛÊV¥lùL(m?9½ï¡¨œ4cÁkdV�Ê\áâoQòÑ­Ø/Ô^ÿ2r2v´²´S•.•MˆMÉÁ¬›	‰±KÜÙ AUý_èñàw"U·`8Têž³ì5§nz	˦Ьžkþ�Õ�ðªb³¬’K�geM¶`$´¶±óKÜvâ`K`O«üÐ�&-;NhäQ÷ô�w\ªÛ|~Œ¨°øn„Ú~¹¬G0OWú Å3H½¸£Y2Ïô€H/=ãU[UÅÆ4aôLHË1_—=ܼ®TujUQ2…*Œ‘÷S]°Ÿn%T·0¶}G£­šQ£×æX¨’¢Å t¹žÜÎã4×;³-†ÆÒ6Å.ÑìÐjφ9'j9Ô•eƒ´`’QÕ3ÕŸ.ûNv�b¤ÇIŠqûjʪ‰k Þæµj†„a†�â
+îˆ"¯ÇõUS¤ƒðxŽ¢;Ë�"—Þÿ9Ê=4Ç®ŸÄ¡:º
£Ð�¢þº1<rx½Ùv·ýþá~»–?*Áûq8dVýáÇ­í€9ÞîžbüÙ%ÏÊ
+endstream
+endobj
+3725 0 obj
+<<
+/Type /Page
+/Contents 3726 0 R
+/Resources 3724 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3401 0 R
+/Annots [ 3606 0 R 3607 0 R 3608 0 R 3609 0 R 3669 0 R 3670 0 R 3671 0 R 3672 0 R 3673 0 R 3674 0 R 3675 0 R 3676 0 R 3677 0 R 3678 0 R 3679 0 R 3680 0 R 3681 0 R 3682 0 R 3683 0 R 3684 0 R 3685 0 R 3686 0 R 3687 0 R 3688 0 R 3689 0 R 3690 0 R 3691 0 R 3692 0 R 3693 0 R 3694 0 R 3695 0 R 3696 0 R 3697 0 R 3698 0 R 3699 0 R 3700 0 R 3701 0 R 3702 0 R 3703 0 R 3704 0 R 3705 0 R 3706 0 R 3707 0 R 3708 0 R 3709 0 R 3710 0 R 3711 0 R 3712 0 R 3713 0 R 3714 0 R 3715 0 R 3716 0 R 3717 0 R 3718 0 R 3719 0 R ]
+>>
+endobj
+3606 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 758.989 180.478 768.652]
+/A << /S /GoTo /D (tls1__3_8h_a643edcb536f268f003f2f276ddfa6e48) >>
+>>
+endobj
+3607 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 746.207 194.94 755.871]
+/A << /S /GoTo /D (tls1__3_8h_a233c0ef2a9d642fb9ca1c254e8b37be3) >>
+>>
+endobj
+3608 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 733.426 199.477 743.089]
+/A << /S /GoTo /D (tls1__3_8h_a86410f6c0cc635f1052231a20086da1f) >>
+>>
+endobj
+3609 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 721.537 186.109 730.308]
+/A << /S /GoTo /D (tls1__3_8h_adb7bc59d1dcf6fffb0d265a92966fd39) >>
+>>
+endobj
+3669 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 707.863 201.046 717.526]
+/A << /S /GoTo /D (tls1__3_8h_a8b65f1298c73f2ec423860f06a35747a) >>
+>>
+endobj
+3670 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 695.082 190.179 704.745]
+/A << /S /GoTo /D (tls1__3_8h_a93e41fd4d610ea125a2fa25479b0bdc2) >>
+>>
+endobj
+3671 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 683.193 170.516 691.964]
+/A << /S /GoTo /D (tls1__3_8h_a6a1e3fd193b6dd39939b3c436d1014ce) >>
+>>
+endobj
+3672 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 669.519 246.299 679.182]
+/A << /S /GoTo /D (tls1__3_8h_aa662dca60df65badddc1e0e856c4cde7) >>
+>>
+endobj
+3673 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 657.63 160.555 666.401]
+/A << /S /GoTo /D (tls1__3_8h_aea87c42356a133dfbb72ab79806bac48) >>
+>>
+endobj
+3674 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 643.956 186.53 653.413]
+/A << /S /GoTo /D (tls1__3_8h_a6540b63c26c948173ce46e589f8a1e3f) >>
+>>
+endobj
+3675 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 631.175 202.642 640.838]
+/A << /S /GoTo /D (tls1__3_8h_a14a099c64e2db7a86755e723a6fc003f) >>
+>>
+endobj
+3676 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 618.394 224.556 628.057]
+/A << /S /GoTo /D (tls1__3_8h_aa65588fd0832b6a5a7db60707ffa1cc0) >>
+>>
+endobj
+3677 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 605.612 219.391 615.275]
+/A << /S /GoTo /D (tls1__3_8h_aeb4652eafac81aeec104d8a76ad860a2) >>
+>>
+endobj
+3678 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 592.831 183.625 602.494]
+/A << /S /GoTo /D (tls1__3_8h_a9dfa578e14a4c779938817cf715c9849) >>
+>>
+endobj
+3679 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 580.049 209.107 589.713]
+/A << /S /GoTo /D (tls1__3_8h_a83f3e5758c4a1683890c77de91879c0f) >>
+>>
+endobj
+3680 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 567.268 189.363 576.931]
+/A << /S /GoTo /D (tls1__3_8h_ad72217ba6e6cae3ddc4454bb640223a8) >>
+>>
+endobj
+3681 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 554.487 223.82 564.15]
+/A << /S /GoTo /D (tls1__3_8h_a24e4e8fe9ff4014dcb28bcc0779e382a) >>
+>>
+endobj
+3682 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 541.705 181.491 551.368]
+/A << /S /GoTo /D (tls1__3_8h_ace1fc9dae6e7200dfd0a662eaf67079b) >>
+>>
+endobj
+3683 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 528.924 212.918 538.587]
+/A << /S /GoTo /D (tls1__3_8h_ac7422f87d3e725f29bcafd8f98dba18a) >>
+>>
+endobj
+3684 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 516.142 262.599 525.806]
+/A << /S /GoTo /D (tls1__3_8h_ae96bab0a93d664a56710709bcb65ef51) >>
+>>
+endobj
+3685 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 503.361 247.984 513.024]
+/A << /S /GoTo /D (tls1__3_8h_a5ae99a5912cb34dc0f8148d8ea4ea521) >>
+>>
+endobj
+3686 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 490.58 190.941 500.243]
+/A << /S /GoTo /D (tls1__3_8h_a948d48005d539a1185e50354a37978e4) >>
+>>
+endobj
+3687 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 477.798 183.974 487.461]
+/A << /S /GoTo /D (tls1__3_8h_ab46f0386d8f98d1db2ced0dcf90b1182) >>
+>>
+endobj
+3688 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 465.017 200.553 474.68]
+/A << /S /GoTo /D (tls1__3_8h_a20ad80e7d257a94588bc229b730f7945) >>
+>>
+endobj
+3689 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 452.236 201.54 461.899]
+/A << /S /GoTo /D (tls1__3_8h_ae8d85100657628f3fce48fe9e0d4db89) >>
+>>
+endobj
+3690 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 439.454 211.295 449.117]
+/A << /S /GoTo /D (tls1__3_8h_a0ae654442f7cd9609c67a9d01d5b76f2) >>
+>>
+endobj
+3691 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 426.673 205.171 436.336]
+/A << /S /GoTo /D (tls1__3_8h_acc31fbf250dc76d537fce47379361657) >>
+>>
+endobj
+3692 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 413.891 238.274 423.555]
+/A << /S /GoTo /D (tls1__3_8h_aa17d9eeaf23453804379e08c107c1959) >>
+>>
+endobj
+3693 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 401.11 202.409 410.773]
+/A << /S /GoTo /D (tls1__3_8h_a79ce7495682b605f0cc796372a8ba6e2) >>
+>>
+endobj
+3694 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 388.329 221.561 397.992]
+/A << /S /GoTo /D (tls1__3_8h_a28ab9d8782c4995a341d940183914a36) >>
+>>
+endobj
+3695 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 375.547 219.579 385.21]
+/A << /S /GoTo /D (tls1__3_8h_a305aa71b6075a2f23d36cb792c519011) >>
+>>
+endobj
+3696 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 362.766 245.304 372.429]
+/A << /S /GoTo /D (tls1__3_8h_a34141cc5b18dc3b9a5c78301e67d8699) >>
+>>
+endobj
+3697 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 349.984 196.169 359.648]
+/A << /S /GoTo /D (tls1__3_8h_a9e16bc460df3efd20261c1b80b0a00ba) >>
+>>
+endobj
+3698 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 337.203 213.384 346.866]
+/A << /S /GoTo /D (tls1__3_8h_aa0a98c02a15b7eb8e6cb2ebb420f345a) >>
+>>
+endobj
+3699 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 324.422 207.887 334.085]
+/A << /S /GoTo /D (tls1__3_8h_ab53d544cdcc2ed9a2d48419aa85c9537) >>
+>>
+endobj
+3700 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 311.64 235.261 321.303]
+/A << /S /GoTo /D (tls1__3_8h_aac7a8c406b156ca887c6888b34682dbb) >>
+>>
+endobj
+3701 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 298.859 256.449 308.522]
+/A << /S /GoTo /D (tls1__3_8h_a202c333d977b3e487ce2772d696fddd4) >>
+>>
+endobj
+3702 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 286.078 229.316 295.741]
+/A << /S /GoTo /D (tls1__3_8h_a9416b52c3bb6bace012901478d20a272) >>
+>>
+endobj
+3703 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 273.296 224.762 282.959]
+/A << /S /GoTo /D (tls1__3_8h_a13500a8813b145def6df450cd5dea0c4) >>
+>>
+endobj
+3704 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 260.515 239.009 270.178]
+/A << /S /GoTo /D (tls1__3_8h_ae2e1a44a10d4219f4645a4e99fee009c) >>
+>>
+endobj
+3705 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 247.733 208.246 257.397]
+/A << /S /GoTo /D (tls1__3_8h_af4c988184090ef4782044fa78a69045e) >>
+>>
+endobj
+3706 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 234.952 209.528 244.615]
+/A << /S /GoTo /D (tls1__3_8h_ad88b87de987d71d6f44f9c652be4f4d1) >>
+>>
+endobj
+3707 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 222.171 253.947 231.834]
+/A << /S /GoTo /D (tls1__3_8h_a6985d26f5a1ab79682d11f3fb20e1e10) >>
+>>
+endobj
+3708 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 209.389 193.156 219.052]
+/A << /S /GoTo /D (tls1__3_8h_a3a8d62bba8785e2dda80d42b6e96bc32) >>
+>>
+endobj
+3709 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 196.608 230.455 206.271]
+/A << /S /GoTo /D (tls1__3_8h_af80869aa9586d1b074f01111780e4ddb) >>
+>>
+endobj
+3710 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 183.826 223.435 193.49]
+/A << /S /GoTo /D (tls1__3_8h_a277f7abca2044f354abe265252cb9252) >>
+>>
+endobj
+3711 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 171.045 204.211 180.708]
+/A << /S /GoTo /D (tls1__3_8h_ad21cc58ec3fb3407eee2c3729bf6dec2) >>
+>>
+endobj
+3712 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 158.264 223.103 167.927]
+/A << /S /GoTo /D (tls1__3_8h_af3fd066a8822f6b8d8c0bab20e908910) >>
+>>
+endobj
+3713 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 145.482 215.581 155.145]
+/A << /S /GoTo /D (tls1__3_8h_aea87eed84ae0db3008863f1b05c0440c) >>
+>>
+endobj
+3714 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 132.701 226.6 142.364]
+/A << /S /GoTo /D (tls1__3_8h_aefe64fcd97c1648ae7f188013f50c163) >>
+>>
+endobj
+3715 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 119.92 196.572 129.583]
+/A << /S /GoTo /D (tls1__3_8h_a54f228e1944ee10c77cac7e9c6ac05a5) >>
+>>
+endobj
+3716 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 107.138 223.336 116.801]
+/A << /S /GoTo /D (tls1__3_8h_a9cea33bd124bea9c85bd4c49218bcf18) >>
+>>
+endobj
+3717 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 94.357 251.777 104.02]
+/A << /S /GoTo /D (tls1__3_8h_a9670987cc01bf2c10ea3acc14ae8f04c) >>
+>>
+endobj
+3718 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 81.575 231.8 91.238]
+/A << /S /GoTo /D (tls1__3_8h_a3a1ace7afbc094bac9a6cf5496351461) >>
+>>
+endobj
+3719 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 68.794 216.854 78.457]
+/A << /S /GoTo /D (tls1__3_8h_a22e28c40511845ea7f8421bfb140b1b3) >>
+>>
+endobj
+3727 0 obj
+<<
+/D [3725 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+3724 0 obj
+<<
+/Font << /F50 2307 0 R /F43 2258 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+3798 0 obj
+<<
+/Length 886       
+/Filter /FlateDecode
+>>
+stream
+xÚ½W[s›8}÷¯ÐL_ăµ’@IL7‰ãžn'í0,–Svì1mþýJâK™Ô™qòbK}çœï&�ÁÀàrp–þº`xÈçÜɸyœקˆ�ÌÁ=äˆXCêzP.+’Úè»™]KaF‘XXC±e.¬oÉGà86b®­0¶­Wa2ø1 jòäyÈ£È÷ß0˜«g
F¶ï�ŸÍ›�Àaʘ£�-A<ø4À-y¼+B=ߊð\Ä™
\NîT|¥”5,ºmà~ȇæâ+Æ´íCÍmóÐ’Œš×´Æä&&vzLFñU`x=ž\šÓïÑýE†„"Ÿ�ŒDzayã›Yöáã~|z2üxv~ÆñïØ.$o­=
+ãÙí4+ÿßMÔì“N»Ù8
+G¯Åé\Ñ�E¿¤#Ký©¼ &Ío�–�¡òÕT±MúÚoé°i|�Nî4¯äÝEc_‡_Þ=I4îø,ìÃ}ÓÂü›a?=#ò÷÷vXÃÏétvv3>Ouwêó}[MÃ'¹ÌçºY	G®ç‚¡CV]³a”X絘‹Eµgé Óv{©£ºø|)�=sfÔE)½T¾$Ì…ÿXª’ž¤Ø³öÚîÁƒZ¥÷2$}$áÇ`~R�6=Ô¦'åÎ1 Ü9�{룤Öå©ÅÖG©5¸z_®@çùÖ¥ï]cGBfê¶57È#Qå›b-‹Uiêy¯"•› ¯3s›¥Õ�Xf@�mW"›‹Íámn¡›Øª]ÎWe%³RVfš•-‡Jªƒu.ë�¨,5Dû¾E”é¡þÓŠ¹{ÀQÝñ7‹:°–ßh_xRŠÔ|H<„ÖŠ,þÓ�¢ç+){;]»u·Ñi7ÓÖÍ·Y¾ÑvV�Ÿ›æ[4Ž6+«¼~¥Ì¶¾ß»<+].A>á;¶Ÿƒ8¾SÇñ$4Û\
+\付ô„LuýE¡zþ�ïìj&¸?ÞMó5{£º¥Z©x–rùÔÏÒÁÛ‹±aI·,ƒéT#�嫳l|7y�0ë'Üh67kä�¼ÿ­+iˆ¯Mb©êjSn½^y¶
‚Ê<uëË:8ù^Âô}_0†°M^óyÑ}qD]îì|9qÞ†öR”b“É®$ÍAÕ%‰. _OÚ£P”‡ÿ³$ñ
+endstream
+endobj
+3797 0 obj
+<<
+/Type /Page
+/Contents 3798 0 R
+/Resources 3796 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3801 0 R
+/Annots [ 3720 0 R 3721 0 R 3722 0 R 3723 0 R 3783 0 R 3784 0 R 3785 0 R 3786 0 R 3787 0 R 3788 0 R 3789 0 R 3790 0 R 3791 0 R 3792 0 R 3793 0 R 3794 0 R 3795 0 R ]
+>>
+endobj
+3720 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 758.989 225.829 768.652]
+/A << /S /GoTo /D (tls1__3_8h_a62ba10db01e1e9eb6fb886968d86b74a) >>
+>>
+endobj
+3721 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 746.037 187.247 755.701]
+/A << /S /GoTo /D (tls1__3_8h_ab3076eb7d6a67fe36ae77a96571138eb) >>
+>>
+endobj
+3722 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 733.086 193.443 742.749]
+/A << /S /GoTo /D (tls1__3_8h_a39edb87bab9b619fd9cba6c5cfb4b5ee) >>
+>>
+endobj
+3723 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 720.135 262.097 729.798]
+/A << /S /GoTo /D (tls1__3_8h_a7fcf03244d689b8873bfe8564d521226) >>
+>>
+endobj
+3783 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 707.183 258.17 716.846]
+/A << /S /GoTo /D (tls1__3_8h_a95a1089062b5112c013afaacf690a71a) >>
+>>
+endobj
+3784 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 694.232 170.167 703.895]
+/A << /S /GoTo /D (tls1__3_8h_a1f87fa495b0a9cf6ff14664bac6c0ead) >>
+>>
+endobj
+3785 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 681.28 169.539 690.943]
+/A << /S /GoTo /D (tls1__3_8h_ae0f7fbd53cd8b03aa1db0c0b4c72ef88) >>
+>>
+endobj
+3786 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 668.329 166.051 677.992]
+/A << /S /GoTo /D (tls1__3_8h_a6cbd210f38401c7e3fa5991504a2bbca) >>
+>>
+endobj
+3787 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 655.377 178.729 665.04]
+/A << /S /GoTo /D (tls1__3_8h_a3fa4adf91c076826330222025d8affa5) >>
+>>
+endobj
+3788 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 642.426 209.438 652.089]
+/A << /S /GoTo /D (tls1__3_8h_a44757eea433a0c13e613e4a8b6b7e668) >>
+>>
+endobj
+3789 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [156.087 574.741 174.846 585.009]
+/A << /S /GoTo /D (tls1__3_8h_ab8ef12fab634c171394422d0ee8baf94) >>
+>>
+endobj
+3790 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [151.102 561.682 174.524 572.058]
+/A << /S /GoTo /D (tls1__3_8h_abddf8683546c89361c4a6e50bdff0b28) >>
+>>
+endobj
+3791 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [156.087 548.73 184.494 559.106]
+/A << /S /GoTo /D (tls1__3_8h_aa601c4712c56caa0b20a73cc5c7d6cf6) >>
+>>
+endobj
+3792 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [156.087 535.779 184.494 546.155]
+/A << /S /GoTo /D (tls1__3_8h_a474e9fd9b8bfb496452ffc6d022f3cb3) >>
+>>
+endobj
+3793 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [156.087 522.827 184.494 533.203]
+/A << /S /GoTo /D (tls1__3_8h_a72c8bfdadfaf9ba1c9e1a34c6ac78708) >>
+>>
+endobj
+3794 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [161.072 509.876 199.45 520.252]
+/A << /S /GoTo /D (tls1__3_8h_a42d4f54d23f86205a1fa590480181e0f) >>
+>>
+endobj
+3795 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [161.072 496.924 199.45 507.3]
+/A << /S /GoTo /D (tls1__3_8h_a52cadf7f83ff343c727f32c36998758b) >>
+>>
+endobj
+3799 0 obj
+<<
+/D [3797 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+3800 0 obj
+<<
+/D [3797 0 R /XYZ 70.866 616.392 null]
+>>
+endobj
+430 0 obj
+<<
+/D [3797 0 R /XYZ 70.866 482.68 null]
+>>
+endobj
+434 0 obj
+<<
+/D [3797 0 R /XYZ 70.866 362.183 null]
+>>
+endobj
+3435 0 obj
+<<
+/D [3797 0 R /XYZ 70.866 315.654 null]
+>>
+endobj
+438 0 obj
+<<
+/D [3797 0 R /XYZ 70.866 288.459 null]
+>>
+endobj
+3436 0 obj
+<<
+/D [3797 0 R /XYZ 119.696 218.919 null]
+>>
+endobj
+442 0 obj
+<<
+/D [3797 0 R /XYZ 70.866 189.836 null]
+>>
+endobj
+3437 0 obj
+<<
+/D [3797 0 R /XYZ 177.052 122.183 null]
+>>
+endobj
+3796 0 obj
+<<
+/Font << /F50 2307 0 R /F43 2258 0 R /F67 2878 0 R /F72 2883 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+3819 0 obj
+<<
+/Length 731       
+/Filter /FlateDecode
+>>
+stream
+xÚÕV[OÛ0~ϯ°´—D¬æ8‰syš -P¤” 

B¥qK´\JšúïçK’¶¢­ö´—8Ç>çó÷_Í Sí8ÔO( ûŽc¡pŠ\Àžã ×7±CP¡{ݲ�ÇðY|Ȳ'{Oâ„Óõô^>©R–•ã2Î3áªõCíU#Üi={¦�&©vÿ(âcçˆ#úz“ž)²©…©mñÿÝh×leé
MlbËèÐÁÓpd˜ †
z(>A7¸ôO\¹Øw�,@0_Á|‰Ø4θ4§A	B);LÀI®ÈpÓľg+€yÁ)P=ÎJ•žy‘—ù$OZkfжX¨žÕŒçó$ž¨ÊŽ²~ãé€9QÓnä@ðö0˜öº|{%¿×?·§ûkæ¡<LZÖ'‚éÇ‚“¼¬¥åSÕFìY,E5SfœM
ôœÇ™TO×4ü[Ê6<wÌ]eìÇ`Ôÿ$YÞÇÉ’QÒ°ÿÛ\­{Êé—%kx5åøRo÷·¸`»&ש“®îžúÝ؆I¶ï=é+Hþ"˜TÒêH–ŸÐ¦ë´Ý†öÝpÐ=ºØ³&š(i�í5q¿—UÁ6Ë`tsT/\©ŸV[G5«ºàFµhW§|Qi¾¨‹lQr�qQ㼉UçE¦†à8¿
^]¬Øy×xu††ÁMøt-σ‚~tÞ^î¹È
+âV…îzÈÅl­À×jœ•UªŒ Ð‹ž‡¸J¾Çå3+¾ñ~²«<¿–wvw<ôöTíz|ž-ŸëC!úª´œ[;ô§I)ñwÕB stûòJ÷,hnß„µ ^ž=€åÖkó2Sªúª+Z5Ý$fÍ1ØeȯèR>š{ÿ£g¥,²Ï+¢y=8Øt[ðµ©�)µy‹)IŸ²Œã’Eë‡`ó¾;í}9yÔYö7Ç?ÊRAÛ
+endstream
+endobj
+3818 0 obj
+<<
+/Type /Page
+/Contents 3819 0 R
+/Resources 3817 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3801 0 R
+>>
+endobj
+3820 0 obj
+<<
+/D [3818 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+446 0 obj
+<<
+/D [3818 0 R /XYZ 70.866 771.024 null]
+>>
+endobj
+3438 0 obj
+<<
+/D [3818 0 R /XYZ 240.004 720.013 null]
+>>
+endobj
+450 0 obj
+<<
+/D [3818 0 R /XYZ 70.866 691.023 null]
+>>
+endobj
+3439 0 obj
+<<
+/D [3818 0 R /XYZ 361.137 628.986 null]
+>>
+endobj
+454 0 obj
+<<
+/D [3818 0 R /XYZ 70.866 599.996 null]
+>>
+endobj
+3440 0 obj
+<<
+/D [3818 0 R /XYZ 438.955 537.958 null]
+>>
+endobj
+458 0 obj
+<<
+/D [3818 0 R /XYZ 70.866 508.968 null]
+>>
+endobj
+3441 0 obj
+<<
+/D [3818 0 R /XYZ 131.792 446.931 null]
+>>
+endobj
+462 0 obj
+<<
+/D [3818 0 R /XYZ 70.866 418.049 null]
+>>
+endobj
+3442 0 obj
+<<
+/D [3818 0 R /XYZ 336.14 355.903 null]
+>>
+endobj
+466 0 obj
+<<
+/D [3818 0 R /XYZ 70.866 328.725 null]
+>>
+endobj
+3507 0 obj
+<<
+/D [3818 0 R /XYZ 204.848 264.876 null]
+>>
+endobj
+470 0 obj
+<<
+/D [3818 0 R /XYZ 70.866 235.994 null]
+>>
+endobj
+3508 0 obj
+<<
+/D [3818 0 R /XYZ 205.341 173.849 null]
+>>
+endobj
+474 0 obj
+<<
+/D [3818 0 R /XYZ 70.866 144.967 null]
+>>
+endobj
+3509 0 obj
+<<
+/D [3818 0 R /XYZ 168.212 82.821 null]
+>>
+endobj
+3817 0 obj
+<<
+/Font << /F50 2307 0 R /F72 2883 0 R /F43 2258 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+3826 0 obj
+<<
+/Length 650       
+/Filter /FlateDecode
+>>
+stream
+xÚ­UMOã0½çWXÚK¢UÍر�ä´PRÙ$ÚT•Æ-‘Ò„MÒ…þûub—~,*¤ÚS&ö¼ñ{3ã1 9ti�ÅÖÉäã@Å3ä
ö…@^@± (Nн-0qzÔóí:«ÈØÅÏúï"ͤ¶B9sز”ùT:�ñ5bÌÅÜsÕm—7«Ö ¶~[D-"ïù>ö)CÓ…uÿ(Q{×°øèµõ\ ÆU0ÖËPdý°àSò‚`Øb�)&J
;ŒNÇQÔÐ9¹ð(òpà
i°€z.` �†}Kä,Í•@±
µ6ÑXÅgs®ÂRŠŸil%³™ÎL•Îs™˜,E§Ú˜ÊÒé1°kiGAÃÂÇ@ÙyjÈÎÏ»“7 Ö¦ÈóCäU�cÉ»†|ÿÆ	ÀŽð?п‰ß¸Ç
+è§YZ?§Ëű2˜‘1¼;ë^jmql
WOŠ4ávšì‹h€Ã»Ìïªbj�ÐÇwôñµ¾_cÒ±@-¤µØçå	o)0ÐŒÍ\NÊäÕQÂ&¥<¶<bCŸv-Ni-þyi¶éÓÿGß3ô³QtßuÔ°ƒ³ô„-çfÔ†—ºoÝ®FãÛp�ÎG7ÆQ�ÒÃ%‹¤é°ºÐ_5ø]°ÿ8”Û2ÓK…iØbY¿,�{šÏ¿B%Cy.&uZäz'‘UZ®ûºgZ]šìMžŠ&›:ü—3è›Æëh|78
;6ñ§'%Ð/Ìš2£î^¥­•CÕ“8)w4Nõ^&2[é•eµNÃ:D"_J9�Ô&E¶ÛÓÚ8T;5üèuåƒKº<®ëGU`ê	¶õ¨2Ž…ú´²/e.KEÀ0{j¤=ý¢)ùÛjޔÖù>Å¿BìÄ
+endstream
+endobj
+3825 0 obj
+<<
+/Type /Page
+/Contents 3826 0 R
+/Resources 3824 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3801 0 R
+/Annots [ 3821 0 R ]
+>>
+endobj
+3821 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [155.947 182.834 210.542 190.621]
+/A << /S /GoTo /D (tls1__3_8h_a5285f40796ab54428826d61d50c616ed) >>
+>>
+endobj
+3827 0 obj
+<<
+/D [3825 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+478 0 obj
+<<
+/D [3825 0 R /XYZ 70.866 771.024 null]
+>>
+endobj
+3510 0 obj
+<<
+/D [3825 0 R /XYZ 154.942 720.013 null]
+>>
+endobj
+482 0 obj
+<<
+/D [3825 0 R /XYZ 70.866 691.023 null]
+>>
+endobj
+3511 0 obj
+<<
+/D [3825 0 R /XYZ 155.435 628.986 null]
+>>
+endobj
+486 0 obj
+<<
+/D [3825 0 R /XYZ 70.866 599.996 null]
+>>
+endobj
+3512 0 obj
+<<
+/D [3825 0 R /XYZ 170.875 537.958 null]
+>>
+endobj
+490 0 obj
+<<
+/D [3825 0 R /XYZ 70.866 508.968 null]
+>>
+endobj
+3513 0 obj
+<<
+/D [3825 0 R /XYZ 229.541 446.931 null]
+>>
+endobj
+494 0 obj
+<<
+/D [3825 0 R /XYZ 70.866 417.941 null]
+>>
+endobj
+3514 0 obj
+<<
+/D [3825 0 R /XYZ 172.247 355.903 null]
+>>
+endobj
+498 0 obj
+<<
+/D [3825 0 R /XYZ 70.866 328.725 null]
+>>
+endobj
+3515 0 obj
+<<
+/D [3825 0 R /XYZ 172.247 264.876 null]
+>>
+endobj
+502 0 obj
+<<
+/D [3825 0 R /XYZ 70.866 237.698 null]
+>>
+endobj
+3516 0 obj
+<<
+/D [3825 0 R /XYZ 282.28 173.849 null]
+>>
+endobj
+506 0 obj
+<<
+/D [3825 0 R /XYZ 70.866 144.967 null]
+>>
+endobj
+3517 0 obj
+<<
+/D [3825 0 R /XYZ 304.408 82.821 null]
+>>
+endobj
+3824 0 obj
+<<
+/Font << /F50 2307 0 R /F72 2883 0 R /F43 2258 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+3830 0 obj
+<<
+/Length 788       
+/Filter /FlateDecode
+>>
+stream
+xÚ�VÑr¢0}ç+2Ýx0M€xdÕZ;Œº’�N§í0TP˜E`·Û¿ß‚Õ®ku_“{OrNν�@`¤|eÊõ
AÀ†¥`K`!hS
+,G‡�GÕ Ú3»Ÿ2LÊóšÑ›4‹µžnÙê Xl×q^‡uZä"T2姂y$x‡hÛÐÖM°X+�ÏD|îpDǯMä˜Ä€Ä4øw|囂>Ý%ÅuÛ¤CbGëa„�:›ú,¸õW#HýÎnÅÆ®o,Xб(ômb¶_¢x™æœÝOߥò�½o€§ê&ç#×¾O³,ÍW­uѾ#ù.‹ªn¿’0�ª$ü¡éH•â…Û:áÚ¥‹�z¨ò•Lô‘¥Ž$˾7NXÐÎ&»�ä{v“©´¶YÉ“›�ðØûýÀ÷eL{(§ç‘ $I.Â2|I³´~kË¿Éw꽦u"ger¼Ñ¸ªÔ°Ì¶UûU¥«|—&5å�·"hˆ;
çÂ"3¦ñU¦�?dl<��’“rÎ
’ÿ­&{˜�û®wŽœíJƒ¸"èD]7
+Â}>`p¶e]¬4ŒÔ�x„e¢‰A)P\]«³]¥KE˜Ç�?›y|—šÃŽ§“`Ö8l*4j…êO½5Úƒ•�SÖÀ4³Oˆ En$¨³Šm
+	Â]ëyBÈ8²´	uÃ|�!X ^%u]^cˆ¯ÄÈ‘JîaAË ‚ûÛ²,lçz³‰4ন‹E‘�­ª!Uu=o*œvÏ]âÝþx4.¬X�q$ÿT)†YVh˜¨¯�)²eO”Nu­“~iÜ_�ÍŠî\–fç�¶š‚¡;÷4¬‹Ï�ðKë$ñp/äÌæ-r™û9aÖ,+Ëã°%Wq.YÇÜh=®J&#¢°–ý†wá潉«íº]¹:·£�½úño]�ЀýG�ìR›|‚±tkß]1UrÐXŽÝÅ„@dàK®âî
+¦P·¨ÙT1!áçeH©”açñ†w}©ñKÛŽåŸј~¿­„DjœÜãž
Q
+endstream
+endobj
+3829 0 obj
+<<
+/Type /Page
+/Contents 3830 0 R
+/Resources 3828 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3801 0 R
+/Annots [ 3822 0 R 3823 0 R ]
+>>
+endobj
+3822 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [165.511 630.427 196.196 638.213]
+/A << /S /GoTo /D (tls1__3_8h_ade5e8b3c09f907dfea533f4e63927998) >>
+>>
+endobj
+3823 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [179.857 534.615 215.325 541.477]
+/A << /S /GoTo /D (tls1__3_8h_a049edff83685de08215c79860380f46f) >>
+>>
+endobj
+3831 0 obj
+<<
+/D [3829 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+510 0 obj
+<<
+/D [3829 0 R /XYZ 70.866 771.024 null]
+>>
+endobj
+3518 0 obj
+<<
+/D [3829 0 R /XYZ 246.119 716.341 null]
+>>
+endobj
+514 0 obj
+<<
+/D [3829 0 R /XYZ 70.866 687.151 null]
+>>
+endobj
+3519 0 obj
+<<
+/D [3829 0 R /XYZ 322.538 619.606 null]
+>>
+endobj
+518 0 obj
+<<
+/D [3829 0 R /XYZ 70.866 590.415 null]
+>>
+endobj
+3520 0 obj
+<<
+/D [3829 0 R /XYZ 204.454 522.87 null]
+>>
+endobj
+522 0 obj
+<<
+/D [3829 0 R /XYZ 70.866 493.679 null]
+>>
+endobj
+3521 0 obj
+<<
+/D [3829 0 R /XYZ 165.414 426.134 null]
+>>
+endobj
+526 0 obj
+<<
+/D [3829 0 R /XYZ 70.866 397.051 null]
+>>
+endobj
+3522 0 obj
+<<
+/D [3829 0 R /XYZ 184.737 329.398 null]
+>>
+endobj
+530 0 obj
+<<
+/D [3829 0 R /XYZ 70.866 300.208 null]
+>>
+endobj
+3523 0 obj
+<<
+/D [3829 0 R /XYZ 223.184 232.663 null]
+>>
+endobj
+534 0 obj
+<<
+/D [3829 0 R /XYZ 70.866 203.58 null]
+>>
+endobj
+3524 0 obj
+<<
+/D [3829 0 R /XYZ 70.866 123.972 null]
+>>
+endobj
+3828 0 obj
+<<
+/Font << /F50 2307 0 R /F72 2883 0 R /F43 2258 0 R /F79 3175 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+3834 0 obj
+<<
+/Length 575       
+/Filter /FlateDecode
+>>
+stream
+xÚ­UMs›0½ó+4Ó¬¬$$àH&8nêZsp'Í0Ž-ÛLøHO“üú
+Db츉M{�eá=½·Z´€VÐ¥qgCÈÅž…Käv…@ŽG± (\ S`b
¨ãšUR’ˆáµ~ƉÔѹ´˜²�Ù\Z·á²m†¹ÃÔ
sꬄƣATy[Èu±Km4O�›[@õî
+
fž‹~7_¦ÈæŠÌ®É41¾ð©xA0tÔcŠ©°Ìp<‰&#Ÿ¹v֢ΆEö 5 
#Øå¶YÈeœ)›bÚd¨fPÚ¶µ•¥vy
ÐuZÏʵFì¨VN1±#ØÙÌ	í+XC›;J°ôìv_ûÓhäOFÑ$´<0ýú=äwˆ|EÐäá~nãzö§uWnRí%•i^Xæ³NòqrÑöv®ïe•²ã¾‰–›l^Åyöúɬ’‡ËbûÆó”å
+¡3Âþ )ÀÖN¾©6•Ž™­ª6·ï,ªªTÉòX“öL~~~à‘à±FêV¥§[¼¯…ËFýÿtG:Fèðk0¾è±‘{úá¢GGO±¢Òá/*“¶•ËøÅ"Ü<ºEU¥ww/˜†ÑØ?Æ=ût‹?É�V/-õ‹>URý«”›Ù,Ñé‡ò¾ÝÒÙ�LÞ}›
+‡†ç9eƼΡbawf‹Í±íÁw)3Y¨³`Ñm,_ä��çU]ZSfûÿÔËÍ1
+endstream
+endobj
+3833 0 obj
+<<
+/Type /Page
+/Contents 3834 0 R
+/Resources 3832 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3801 0 R
+>>
+endobj
+3835 0 obj
+<<
+/D [3833 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+538 0 obj
+<<
+/D [3833 0 R /XYZ 70.866 771.024 null]
+>>
+endobj
+3525 0 obj
+<<
+/D [3833 0 R /XYZ 70.866 704.386 null]
+>>
+endobj
+542 0 obj
+<<
+/D [3833 0 R /XYZ 70.866 677.191 null]
+>>
+endobj
+3402 0 obj
+<<
+/D [3833 0 R /XYZ 70.866 595.695 null]
+>>
+endobj
+546 0 obj
+<<
+/D [3833 0 R /XYZ 70.866 568.5 null]
+>>
+endobj
+3244 0 obj
+<<
+/D [3833 0 R /XYZ 292.788 498.959 null]
+>>
+endobj
+550 0 obj
+<<
+/D [3833 0 R /XYZ 70.866 469.877 null]
+>>
+endobj
+3069 0 obj
+<<
+/D [3833 0 R /XYZ 221.597 402.224 null]
+>>
+endobj
+554 0 obj
+<<
+/D [3833 0 R /XYZ 70.866 373.033 null]
+>>
+endobj
+3526 0 obj
+<<
+/D [3833 0 R /XYZ 188.332 305.488 null]
+>>
+endobj
+558 0 obj
+<<
+/D [3833 0 R /XYZ 70.866 276.297 null]
+>>
+endobj
+3527 0 obj
+<<
+/D [3833 0 R /XYZ 175.278 208.752 null]
+>>
+endobj
+562 0 obj
+<<
+/D [3833 0 R /XYZ 70.866 181.373 null]
+>>
+endobj
+3528 0 obj
+<<
+/D [3833 0 R /XYZ 180.81 112.016 null]
+>>
+endobj
+3832 0 obj
+<<
+/Font << /F50 2307 0 R /F72 2883 0 R /F43 2258 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+3838 0 obj
+<<
+/Length 825       
+/Filter /FlateDecode
+>>
+stream
+xÚ­VMSÛ0½ûW¨Ó‹=m„dK²s$�ÓPhp§L�aŒ£$ž:vê�
úë+YJÀn �rIV»Òê½'íZÌC£{Š€»Œ9 ˜A�1àvmÈ0&àÒt<ë:8Ž9„‰uµw'ÜêØ®gfQµài–q–Ê©F?0~XÌD¯3zôl¢…qy�ÀDÄŽ�ÈØõÀ]=s
u %Ž°pn|3ÐV”C´‚É †6t«ƒBf0:¿9Ù¿¸Œ÷-ŠÌ¡¶7pm஋°Ì‚@ÇÁУD%ø8áÓ8¤XsùPyl•Aà{Ä!2ØDÐÒNÂ{%ÉÀ"ÔÌ-ŒÌp&¥QÞ„§³r®ì	/âœOÔ £þ°ú›Z2³\
(¶?+ËÞÅÈ&:ìlÛˆx:L6„	ê2F›’3Ç#ŠtC|Aš t'-Ýýž¤ÿ}0¸9÷öߨ¾ß['¨ýWˆ¢Ö'›21À;�I¼�Pª…%6´M?]Våž…ÍÓª–rÞZ¶˜1­ùó\ùŠø�…©Éå´:„óGWá»8I¤…Í;9#Luª2S^qºU¤ç–ó¸PÞ°P)š7½Ë¬(âKÂ?È-©ÙS±^Q¬såMÂ|¦7áiVÍtB
BÖ¬ÐcØ¥TiQ†¿dn]·ÓJ�V$)d–ñBv–zF4ãtç@[7àl´ïýßú['ÑUøäRîT‰g‰  øˆs»/_*Îõi?O·Á–µØøgGýñ.tét³_ã[Ôâå|u°ï#@ó¼Ý¶ý±¼]Á¶‚‘<©wÙÀ¶öW—•GruÅ›�5ªò|Mt±¨Ñíò,ÓñƒýBq±j£˜í¬Š÷œ*=FÞXµ(r¹ÒÄCh{
ø©Â~œ‘÷ƒyÞÎbt[bõG£Ó7ª Öª& >{»×A”Äkºsž$Yë¾×#Yg	/4I].<-Ä“¦¨Ë®öé_(cY©.Gj¬ûªøyhÊU÷çBïe‹e–J0ò•´zÞlz-Q
+‘ƒ_óXZ=’´]F¤„H…¤„BÆtóò”碿ëò¸}‚ø0«I?Ì䙉�Iã_SŠx©
+endstream
+endobj
+3837 0 obj
+<<
+/Type /Page
+/Contents 3838 0 R
+/Resources 3836 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3801 0 R
+>>
+endobj
+3839 0 obj
+<<
+/D [3837 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+566 0 obj
+<<
+/D [3837 0 R /XYZ 70.866 771.024 null]
+>>
+endobj
+3351 0 obj
+<<
+/D [3837 0 R /XYZ 417.911 716.341 null]
+>>
+endobj
+570 0 obj
+<<
+/D [3837 0 R /XYZ 70.866 687.151 null]
+>>
+endobj
+3529 0 obj
+<<
+/D [3837 0 R /XYZ 169.216 607.65 null]
+>>
+endobj
+574 0 obj
+<<
+/D [3837 0 R /XYZ 70.866 580.352 null]
+>>
+endobj
+3530 0 obj
+<<
+/D [3837 0 R /XYZ 185.571 510.915 null]
+>>
+endobj
+578 0 obj
+<<
+/D [3837 0 R /XYZ 70.866 481.724 null]
+>>
+endobj
+3531 0 obj
+<<
+/D [3837 0 R /XYZ 192.403 414.179 null]
+>>
+endobj
+582 0 obj
+<<
+/D [3837 0 R /XYZ 70.866 384.988 null]
+>>
+endobj
+3532 0 obj
+<<
+/D [3837 0 R /XYZ 248.137 317.443 null]
+>>
+endobj
+586 0 obj
+<<
+/D [3837 0 R /XYZ 70.866 290.064 null]
+>>
+endobj
+3533 0 obj
+<<
+/D [3837 0 R /XYZ 249.499 220.707 null]
+>>
+endobj
+590 0 obj
+<<
+/D [3837 0 R /XYZ 70.866 193.328 null]
+>>
+endobj
+3534 0 obj
+<<
+/D [3837 0 R /XYZ 370.4 123.972 null]
+>>
+endobj
+3836 0 obj
+<<
+/Font << /F50 2307 0 R /F72 2883 0 R /F43 2258 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+3846 0 obj
+<<
+/Length 719       
+/Filter /FlateDecode
+>>
+stream
+xÚ½–KSÛ0ÇïþšéÅ>DH²$ÛÇàšðÌPÇth�ñ¤‰0ž&
†B?}%ËÎÓ$<\¢÷_«Ÿw7‹@èû‘±wÀp¡Ç¹
¢[à èr�@ŽA4W&‡ØjÇ5óÑŽmx§GéHè^(n-ŒL1Ù@X7Ñ1 Ô†Ì±å…‚í©Y#ˆŒ?–“àÙE®]BÁ`l\Ý 0”kÇAÛsÁßbçP&Ũ�žñÍ@[�ç¢ë!�Y-Œ2£Ó^|Ö¾Œ{G�øüb?>	~ÈþÏ@¸wàà@ÏAX©!вDØÓB_†â6Íä“ù&™b•a¢õ¤Õsë¤!Ðs©Ö;ë?k|i’õóÇiIóþñ—E�9Jzü[�„úy©öÿ³03Ëíi¦ÛâÐK.ÊoÒkk–©'¹ºÄ×°é~DMàYUz!¶…ÐTÌÌôÉ"Ììçâ³8‘uNݶåɉ‹0؆ÉÝŒ©Ûž‹¼ƒÐ0MÒ¼?ªÅÕ8{…ÃIpÙD,­É«ž³C(­ù€°ld>îúYÒhx¾¿
[ÂEkpùGç‡A¨4£à2úˆïÌÕæJÛÁ±ÝÁ]#†N‚3Ù”ƒôþNÈP¤ÈÌõö¼ŽàfTËžÅjP5“‰ê”Š
ÔmØ¿LN» ã«ÉIºCæ÷ ŒýÃöQ7>
ºïÍâA¸,S¬¾-=¥cU<ŽõƒzÊ_$±Žê«I¿r¢ô!2˜1“T+.#‘%yYw´t3§yžf‰M'“Òùü·ç1g²�¤ôEfsoSATÔBºš&e5v©ô*p}B—=ÒoÁâˆ)©J-‰Ð~å‚•WPHlZ«nöe™={ve¡+Ã~ýƒ·ˆË¡íðOøîë1²hb]mÉD6Þ¥´¬JJ‰ÃéBIIä²)^×™˜Jk‡‹öèþ×I‘^åY¦ÈVMüý_Ò®
+endstream
+endobj
+3845 0 obj
+<<
+/Type /Page
+/Contents 3846 0 R
+/Resources 3844 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3848 0 R
+/Annots [ 3840 0 R 3841 0 R ]
+>>
+endobj
+3840 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [237.242 91.806 354.005 99.593]
+/A << /S /GoTo /D (tls1__3_8h_a82554141e636ee8308756de7a6797c12) >>
+>>
+endobj
+3841 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [356.246 91.806 439.534 99.593]
+/A << /S /GoTo /D (tls1__3_8h_a67c5a0f262db5cd2a04c62a779cc2d4b) >>
+>>
+endobj
+3847 0 obj
+<<
+/D [3845 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+594 0 obj
+<<
+/D [3845 0 R /XYZ 70.866 771.024 null]
+>>
+endobj
+3535 0 obj
+<<
+/D [3845 0 R /XYZ 243.923 720.013 null]
+>>
+endobj
+598 0 obj
+<<
+/D [3845 0 R /XYZ 70.866 691.023 null]
+>>
+endobj
+3536 0 obj
+<<
+/D [3845 0 R /XYZ 247.5 628.986 null]
+>>
+endobj
+602 0 obj
+<<
+/D [3845 0 R /XYZ 70.866 599.996 null]
+>>
+endobj
+3537 0 obj
+<<
+/D [3845 0 R /XYZ 228.017 537.958 null]
+>>
+endobj
+606 0 obj
+<<
+/D [3845 0 R /XYZ 70.866 508.968 null]
+>>
+endobj
+3538 0 obj
+<<
+/D [3845 0 R /XYZ 262.232 446.931 null]
+>>
+endobj
+610 0 obj
+<<
+/D [3845 0 R /XYZ 70.866 417.941 null]
+>>
+endobj
+3539 0 obj
+<<
+/D [3845 0 R /XYZ 256.548 355.903 null]
+>>
+endobj
+614 0 obj
+<<
+/D [3845 0 R /XYZ 70.866 326.914 null]
+>>
+endobj
+3540 0 obj
+<<
+/D [3845 0 R /XYZ 265.81 264.876 null]
+>>
+endobj
+618 0 obj
+<<
+/D [3845 0 R /XYZ 70.866 235.886 null]
+>>
+endobj
+3541 0 obj
+<<
+/D [3845 0 R /XYZ 307.358 173.849 null]
+>>
+endobj
+622 0 obj
+<<
+/D [3845 0 R /XYZ 70.866 144.859 null]
+>>
+endobj
+3542 0 obj
+<<
+/D [3845 0 R /XYZ 268.32 82.821 null]
+>>
+endobj
+3844 0 obj
+<<
+/Font << /F50 2307 0 R /F72 2883 0 R /F43 2258 0 R /F79 3175 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+3853 0 obj
+<<
+/Length 757       
+/Filter /FlateDecode
+>>
+stream
+xÚ­VMs›0½ó+ÔéV$!]‚ZÇ�&“i’ñ8¶‚™Üi’þú
+	›ºþJN^kµ�Ý·O+!úÚ§H;ëY8ÐeÌÑ°t¶K à š��"ã.úLá2)qrµ—,¸Ñ!¶£Ÿ/§�)ÏÊI™,³j«æGÚ/
‹�à¢ã@‡P0Mµ›;fÂ÷D×
Org
+¨eB‹šÂ^€Pû¦¡½Y2Q“&ƒH£ƒBz4Ç—Ýë±7üa4ö.ºÁp<ð‡U‚g=›º6ÂA„]ôqÆ’LÇvÁH/Vh"ç×Ü!Ðu¨B»œ<'©�‘þ˜*º¼E"ȪmžŠô2¹EˆL'eMét>I2e.x—sewÔÏ2«·|ñP[Iœñ™²ç<ç*¯
Ϊ*ˆÝ ËÝEW|÷߃/‰#Ý·È’jÒ”6ò¸ɨ¯	¤]=[©A$ã®%C1%�,�æ>Ъ‚BbÒ&lõe­Ê^}RâZÛšÝ!ƒ¦Íêž[ïßófíÞ H)yqhkÑ›­
/º#ÿ|úÞÈ�öõÖÙÑÛ-@ÒO,¶ã<¼r£
+úQÄeUj�&ÒŸ
Y\SÎ'y£ê‚Os^6jÿc`K?Xå¢u›TD�÷e?»ô½Ž »lÿ4HÛÊÈyñ˜þ”“Sþ/“iE‰"§]îú¸—Ô=UAR½q™®&ƒ™ ó·AD`^4«YͦÊaZkì>‰ã*àߊ;8¶68&-ŽýëȆÁ×ax¢ÌÖä:Ô¡/%§’g… ·8Q8f»(Ï÷p~¢l^ãUIì D%/b•QÍ
¾˜mÇéÓ‚¶*
®Þr<šhuK’#Ú\½o]Vûè.Ò»†…ôþ[f`Ôí¯WxÌ໸ìVÒ¬›YNâ‡þê:Úö¼²,ˆL|ÌëªyU1HlFå�hQÁ¿�	H™uŸg<wÔl=¡æÝ'OØK\1¬ó¬�ã_è+Œˆ
+endstream
+endobj
+3852 0 obj
+<<
+/Type /Page
+/Contents 3853 0 R
+/Resources 3851 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3848 0 R
+/Annots [ 3842 0 R 3843 0 R ]
+>>
+endobj
+3842 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [237.242 637.971 354.005 645.757]
+/A << /S /GoTo /D (tls1__3_8h_a2716011f133618b6340c7172ba3fdf11) >>
+>>
+endobj
+3843 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [356.246 637.971 439.534 645.757]
+/A << /S /GoTo /D (tls1__3_8h_a67c5a0f262db5cd2a04c62a779cc2d4b) >>
+>>
+endobj
+3854 0 obj
+<<
+/D [3852 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+626 0 obj
+<<
+/D [3852 0 R /XYZ 70.866 771.024 null]
+>>
+endobj
+3543 0 obj
+<<
+/D [3852 0 R /XYZ 320.288 720.013 null]
+>>
+endobj
+630 0 obj
+<<
+/D [3852 0 R /XYZ 70.866 691.023 null]
+>>
+endobj
+3544 0 obj
+<<
+/D [3852 0 R /XYZ 264.787 628.986 null]
+>>
+endobj
+634 0 obj
+<<
+/D [3852 0 R /XYZ 70.866 599.996 null]
+>>
+endobj
+3241 0 obj
+<<
+/D [3852 0 R /XYZ 224.09 537.958 null]
+>>
+endobj
+638 0 obj
+<<
+/D [3852 0 R /XYZ 70.866 508.968 null]
+>>
+endobj
+3545 0 obj
+<<
+/D [3852 0 R /XYZ 398.016 446.931 null]
+>>
+endobj
+642 0 obj
+<<
+/D [3852 0 R /XYZ 70.866 417.941 null]
+>>
+endobj
+3546 0 obj
+<<
+/D [3852 0 R /XYZ 153.678 355.903 null]
+>>
+endobj
+646 0 obj
+<<
+/D [3852 0 R /XYZ 70.866 328.806 null]
+>>
+endobj
+3547 0 obj
+<<
+/D [3852 0 R /XYZ 182.164 264.876 null]
+>>
+endobj
+650 0 obj
+<<
+/D [3852 0 R /XYZ 70.866 235.994 null]
+>>
+endobj
+3548 0 obj
+<<
+/D [3852 0 R /XYZ 152.772 173.849 null]
+>>
+endobj
+654 0 obj
+<<
+/D [3852 0 R /XYZ 70.866 144.967 null]
+>>
+endobj
+3549 0 obj
+<<
+/D [3852 0 R /XYZ 193.999 82.821 null]
+>>
+endobj
+3851 0 obj
+<<
+/Font << /F50 2307 0 R /F72 2883 0 R /F43 2258 0 R /F79 3175 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+3857 0 obj
+<<
+/Length 674       
+/Filter /FlateDecode
+>>
+stream
+xÚµV]o›0}çWXÚhªklà±mH–v)�iZW¡4qÔ2>¶v¿~6Nhʪ´AÚSàÂ=œs|®c–��vi§}Š€]ÆL-€� Ã°]ÑÜèbã„ØŽ^>86áJÝõ“®®¾00ÒyÎÓ7n£K`Y&¤¶)¾Q#XXV5/Ò~jXÀ͇:ijµvs‹À\<»š®~×o®�E˜%Á@¨}ÑЛä†h�=$�2ã#„ôès�ξž5ô$­Ó¾M€
]a‰�À‰‰ ®jÿ0ç‹$BÙ¿Íu
G¡†ÏL
+!Ðu,…2š>*«.²ì>ÙÚV$Lu®Ú_‘$ˆˆõBƒÝÒàO¢ñ$ŠïÂzq8üÞUÏ+@J›`p@m‰ËªrS•ê:ç³,Ÿwê´…žË|Múý·D:‡Dž7uý¢¨Ž¥Êc¾Ü3hâ°ÇMś߉ί·2AwtøÎ H¯Ô£×Ñi·åtèEúW/ˆ¯ÏF]ó$P„CRH9BÕ/ƒÐFZ:]·ç¦¾KÒ=;žJ^ÐN÷µ3ÔÖ>�ý@ÂD^/ÔWþdvÌ›‚SP5Ìv¤ŽXîTƾZßí<È[ªÍ&5é%ßÙLyö´)3UXÊæ<«6Å{ÓÀðAGÂá ìˆÆ‹D9ÁŽˆÄ1NÉ2�–U¾‹ËlÅ×üý&�–	ãð*ù=¯«öçþºLŽXÿM΋Õ4ß	»—+Á뜫Â:›!ÌlÿÇŸÄ”†“aäu
ùKŒúý_
O6«fŸ«’í¤7Ûék‡J!2ñ1g‹Ý™‚Ab3kïLaQÈÄOMÀSžObw{+ÒËävüø´”^ë<mSüÖS·
+endstream
+endobj
+3856 0 obj
+<<
+/Type /Page
+/Contents 3857 0 R
+/Resources 3855 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3848 0 R
+/Annots [ 3849 0 R 3850 0 R ]
+>>
+endobj
+3849 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [203.768 546.943 330.094 554.73]
+/A << /S /GoTo /D (tls1__3_8h_a51e1cfe6d71ad92d7503c207cf9be105) >>
+>>
+endobj
+3850 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [332.884 546.943 411.389 554.73]
+/A << /S /GoTo /D (tls1__3_8h_a22c1533a4932e7a5b3647ccbe3cbde95) >>
+>>
+endobj
+3858 0 obj
+<<
+/D [3856 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+658 0 obj
+<<
+/D [3856 0 R /XYZ 70.866 771.024 null]
+>>
+endobj
+3550 0 obj
+<<
+/D [3856 0 R /XYZ 138.992 720.013 null]
+>>
+endobj
+662 0 obj
+<<
+/D [3856 0 R /XYZ 70.866 692.834 null]
+>>
+endobj
+3353 0 obj
+<<
+/D [3856 0 R /XYZ 163.917 628.986 null]
+>>
+endobj
+666 0 obj
+<<
+/D [3856 0 R /XYZ 70.866 600.103 null]
+>>
+endobj
+3331 0 obj
+<<
+/D [3856 0 R /XYZ 160.985 537.958 null]
+>>
+endobj
+670 0 obj
+<<
+/D [3856 0 R /XYZ 70.866 509.076 null]
+>>
+endobj
+3551 0 obj
+<<
+/D [3856 0 R /XYZ 194.169 446.931 null]
+>>
+endobj
+674 0 obj
+<<
+/D [3856 0 R /XYZ 70.866 418.049 null]
+>>
+endobj
+3552 0 obj
+<<
+/D [3856 0 R /XYZ 232.778 355.903 null]
+>>
+endobj
+678 0 obj
+<<
+/D [3856 0 R /XYZ 70.866 326.914 null]
+>>
+endobj
+3553 0 obj
+<<
+/D [3856 0 R /XYZ 253.526 264.876 null]
+>>
+endobj
+682 0 obj
+<<
+/D [3856 0 R /XYZ 70.866 235.886 null]
+>>
+endobj
+3554 0 obj
+<<
+/D [3856 0 R /XYZ 178.64 173.849 null]
+>>
+endobj
+686 0 obj
+<<
+/D [3856 0 R /XYZ 70.866 144.967 null]
+>>
+endobj
+3614 0 obj
+<<
+/D [3856 0 R /XYZ 228.608 82.821 null]
+>>
+endobj
+3855 0 obj
+<<
+/Font << /F50 2307 0 R /F72 2883 0 R /F43 2258 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+3861 0 obj
+<<
+/Length 619       
+/Filter /FlateDecode
+>>
+stream
+xÚ½–]oÚ0†ïó+,í&¹À;¶ã\2
+íªvëF&mª*Ä -ÑB`-¬í¿ß1v0>;´laŸWïóú+@�sï}âÕÛˆ¦±R!IîIT+E¢˜SÅH2 ·¾àÁ]rIB
+…ºù¿í,Oƒ�´6îÏFi1íM³qa¦z­Äûå1œ	„-µ¦šÒy·w@8vIP1Öäy>sD„©!ösÒñ>{°×¥bJ›Š2Š¦EPcà'W�n£Õé2®»çÍënç¢Á¥2öê툓ˆÆ0£¤[™wƒô>+Mm™�Á�YA4]™CAÎi¬…Äz,¯ÛÒ:ªØÔúÙd˜>ÚþÓ,›º0k¶™³'Û+Ûq‘¿–=7÷y˜õ‡¶{ýµ“ØÞ7˜�&yj–%X�+
hM�‹•ìäZvh¸Äµxcvk"Uv|Gvr‘�	Í–îÊîPBµDؼh|l8to>]Œƒÿ�Éý›Eo
F±…ÞŠT…îÇ6ÎBç¬Ü8sƒÂü×¢
‡¤yŠCÒÜtHÄA‡¤mvBÆsÝôòÌr…YoaÖo_í�2·<hƒÿÅ­O„¿ºä±ÃÿÆ¥dñ‘KìŠì_ҲƸMó<CÃ}G6C,Üß¿.}‡õ3ÀךwË¥æ¼ô‡½âáà}�ƒì´š7˜év$gUW¡FûWñã‡òö]øŸÜl‰oÊ�Üz·­«¸õ±ÜNàDÜ‹×ÓÇ„”BvÌ·Dù
¡(�”0,B
+*¥ÀŸe�ÎÓ"}ì™'Ó¾¥KþÎÆsƒ¯&j?-Ö=þ
÷t:Ñ
+endstream
+endobj
+3860 0 obj
+<<
+/Type /Page
+/Contents 3861 0 R
+/Resources 3859 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3848 0 R
+>>
+endobj
+3862 0 obj
+<<
+/D [3860 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+690 0 obj
+<<
+/D [3860 0 R /XYZ 70.866 771.024 null]
+>>
+endobj
+3615 0 obj
+<<
+/D [3860 0 R /XYZ 400.741 720.013 null]
+>>
+endobj
+694 0 obj
+<<
+/D [3860 0 R /XYZ 70.866 691.131 null]
+>>
+endobj
+3616 0 obj
+<<
+/D [3860 0 R /XYZ 213.886 628.986 null]
+>>
+endobj
+698 0 obj
+<<
+/D [3860 0 R /XYZ 70.866 600.103 null]
+>>
+endobj
+3617 0 obj
+<<
+/D [3860 0 R /XYZ 250.235 537.958 null]
+>>
+endobj
+702 0 obj
+<<
+/D [3860 0 R /XYZ 70.866 509.076 null]
+>>
+endobj
+3618 0 obj
+<<
+/D [3860 0 R /XYZ 237.799 446.931 null]
+>>
+endobj
+706 0 obj
+<<
+/D [3860 0 R /XYZ 70.866 418.049 null]
+>>
+endobj
+3619 0 obj
+<<
+/D [3860 0 R /XYZ 245.276 355.903 null]
+>>
+endobj
+710 0 obj
+<<
+/D [3860 0 R /XYZ 70.866 327.021 null]
+>>
+endobj
+3620 0 obj
+<<
+/D [3860 0 R /XYZ 213.312 264.876 null]
+>>
+endobj
+714 0 obj
+<<
+/D [3860 0 R /XYZ 70.866 235.886 null]
+>>
+endobj
+3621 0 obj
+<<
+/D [3860 0 R /XYZ 256.153 173.849 null]
+>>
+endobj
+718 0 obj
+<<
+/D [3860 0 R /XYZ 70.866 144.859 null]
+>>
+endobj
+3622 0 obj
+<<
+/D [3860 0 R /XYZ 256.153 82.821 null]
+>>
+endobj
+3859 0 obj
+<<
+/Font << /F50 2307 0 R /F72 2883 0 R /F43 2258 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+3865 0 obj
+<<
+/Length 659       
+/Filter /FlateDecode
+>>
+stream
+xÚÍ–[oÚ0†ïó+\í&цk;¶ã\ö@OHMrAUU(7d�AØÚ?'6
6Z Ó¦Ýàþ>¿ÏëCŒ@
+¸´N#ëø‚!  Ï¹¢'à!(8žO Ç JÀƒÍ!vZÄv™Ïqß…#ݺÈr©k�|r0²åLCé<F7€R2ÏUsÔ¨[õZíÈúfaÕ‰n&
+BÁpl=<"�¨ÿn‚®/À�zäP¦’Ñ*YBëÎB;ÅsÑšzH GœFÙaû¬Ëp¥èøÂ#Àƒ¾‡pŽ@ËEa_G~HäSV(F¾W7Ñ3Rãt%m%Aå ú‚ê·×a¤MZKP5ežgÓ2êÖp1sÔÜöw‡0Û¸úÕ!ÊÓêçÅ„8jÄóp©Ô3oÀWêD„np»†»G©8¹YÑÊ7h™×ÿ�¼Îýi;ðø[ˆbbf0)¡d7fÇaJõ@δðîÝ>DuOK·ŸŠì¨­[׺ø²˜—º6Ž3¾es][L�”…”Ú·3*•…R Î]œçf™NÒ"›Ëäho™qðêþ4¸>ïwzî’U\ã!NvŒ«—�²3;KöqO
ü¤»ó?öcË3¸”m€rÚ>;OúÕq$Œ¸^�¨Ê�ç•$ËÓB‘»{…‹ét¢LP[¡”Æ…:¯¹0²´ˆËÅÌl…8O'Ʊr4Þ{y½×©]A\ëW’4ÔØÝãFœ­yI<û[Ìâ7f¥òÏ™7’,™Ù³Ò¾¡”ÜnöUÙ~ßæÞ–aÉ+}o°7mó�ßö^`"ò\X>8$§kÏÊ WE­ø²ºLãFì`í:ŸÔÑKZùkËâW‰?
Þ[<¥
+endstream
+endobj
+3864 0 obj
+<<
+/Type /Page
+/Contents 3865 0 R
+/Resources 3863 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3848 0 R
+>>
+endobj
+3866 0 obj
+<<
+/D [3864 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+722 0 obj
+<<
+/D [3864 0 R /XYZ 70.866 771.024 null]
+>>
+endobj
+3623 0 obj
+<<
+/D [3864 0 R /XYZ 256.153 720.013 null]
+>>
+endobj
+726 0 obj
+<<
+/D [3864 0 R /XYZ 70.866 691.023 null]
+>>
+endobj
+3624 0 obj
+<<
+/D [3864 0 R /XYZ 203.342 628.986 null]
+>>
+endobj
+730 0 obj
+<<
+/D [3864 0 R /XYZ 70.866 599.996 null]
+>>
+endobj
+3625 0 obj
+<<
+/D [3864 0 R /XYZ 384.477 537.958 null]
+>>
+endobj
+734 0 obj
+<<
+/D [3864 0 R /XYZ 70.866 508.968 null]
+>>
+endobj
+3626 0 obj
+<<
+/D [3864 0 R /XYZ 220.548 446.931 null]
+>>
+endobj
+738 0 obj
+<<
+/D [3864 0 R /XYZ 70.866 417.941 null]
+>>
+endobj
+3627 0 obj
+<<
+/D [3864 0 R /XYZ 228.832 355.903 null]
+>>
+endobj
+742 0 obj
+<<
+/D [3864 0 R /XYZ 70.866 326.914 null]
+>>
+endobj
+3628 0 obj
+<<
+/D [3864 0 R /XYZ 241.421 264.876 null]
+>>
+endobj
+746 0 obj
+<<
+/D [3864 0 R /XYZ 70.866 235.886 null]
+>>
+endobj
+3629 0 obj
+<<
+/D [3864 0 R /XYZ 228.832 173.849 null]
+>>
+endobj
+750 0 obj
+<<
+/D [3864 0 R /XYZ 70.866 144.859 null]
+>>
+endobj
+3630 0 obj
+<<
+/D [3864 0 R /XYZ 216.378 82.821 null]
+>>
+endobj
+3863 0 obj
+<<
+/Font << /F50 2307 0 R /F72 2883 0 R /F43 2258 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+3869 0 obj
+<<
+/Length 496       
+/Filter /FlateDecode
+>>
+stream
+xÚÍ•Mo›@†ïüŠ‘z�ƒ7³Ÿ,Ç4àÄi+µ…ž¢Èrq�N,¬&ÿ¾»`lù#¤i•Ó®Ø™Wï³3Ë L
áÜùœ8'C‰ I ‡ä|$Z)ðF…$…+Wï:¹nŽ¸P&¯þ:Ìg™7`¾vÃùí²ÈÊjRåóÒ†:Qâ<:ÔD"е¢ÖD3
·…su��š³K0Š�†ßud
Br"7ûÄÎ�ºT”`kSJÑè
("º?ãÓñ÷8›5ǧ\×'CŸ�O©Bp$HƒFãSšÝå¥áR{ê|B�²Q3v7¶Œc$ТQ‹—ó…7èVYÚ\–k6q>-'Õr±ºÄÉljC©tóê¾h´·�­SM�‰-Zº‡VRö—´VaC«ÐÊÿF˺´_Îbj�2© ê}¨Ýô–S ýœ|縛Þrʃœÿ²{å§ØÅy¸u�Ö³Û·êƒÔS®8£�IIƒžel³6¯Ñ?^½(]%YÛQ¾/�Z
…£¯£äbôë[ß¿M'±Å
+�/V˜ÏŒÑ|Y°÷Äñ_âðžØIÜàð8ü•8뙸kÄJI�Ó>¶�¬Š0_	kPHA¤f%ÊHÖ.ϳ2[LÖ�ãÆcè>·³ßãè>=Oí
ºYùÒã—N
v
+endstream
+endobj
+3868 0 obj
+<<
+/Type /Page
+/Contents 3869 0 R
+/Resources 3867 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3848 0 R
+>>
+endobj
+3870 0 obj
+<<
+/D [3868 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+754 0 obj
+<<
+/D [3868 0 R /XYZ 70.866 771.024 null]
+>>
+endobj
+3631 0 obj
+<<
+/D [3868 0 R /XYZ 216.378 720.013 null]
+>>
+endobj
+758 0 obj
+<<
+/D [3868 0 R /XYZ 70.866 691.023 null]
+>>
+endobj
+3632 0 obj
+<<
+/D [3868 0 R /XYZ 216.378 628.986 null]
+>>
+endobj
+762 0 obj
+<<
+/D [3868 0 R /XYZ 70.866 599.996 null]
+>>
+endobj
+3633 0 obj
+<<
+/D [3868 0 R /XYZ 216.378 537.958 null]
+>>
+endobj
+766 0 obj
+<<
+/D [3868 0 R /XYZ 70.866 508.968 null]
+>>
+endobj
+3634 0 obj
+<<
+/D [3868 0 R /XYZ 216.378 446.931 null]
+>>
+endobj
+770 0 obj
+<<
+/D [3868 0 R /XYZ 70.866 417.941 null]
+>>
+endobj
+3635 0 obj
+<<
+/D [3868 0 R /XYZ 216.378 355.903 null]
+>>
+endobj
+774 0 obj
+<<
+/D [3868 0 R /XYZ 70.866 326.914 null]
+>>
+endobj
+3636 0 obj
+<<
+/D [3868 0 R /XYZ 221.507 264.876 null]
+>>
+endobj
+778 0 obj
+<<
+/D [3868 0 R /XYZ 70.866 235.886 null]
+>>
+endobj
+3637 0 obj
+<<
+/D [3868 0 R /XYZ 193.075 173.849 null]
+>>
+endobj
+782 0 obj
+<<
+/D [3868 0 R /XYZ 70.866 144.859 null]
+>>
+endobj
+3638 0 obj
+<<
+/D [3868 0 R /XYZ 193.075 82.821 null]
+>>
+endobj
+3867 0 obj
+<<
+/Font << /F50 2307 0 R /F72 2883 0 R /F43 2258 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+3873 0 obj
+<<
+/Length 682       
+/Filter /FlateDecode
+>>
+stream
+xÚ¥U]oÚ0}ϯ°´—D[\Û‰óñÈJ(¬ëšT›ÔU(ÑòÑ…°–¿ëØ´©Ê
+lO8ß“sνŽ	Z ‚ÎŒ�‰q2à8ô<%säxòC†=Š’º1=L-›ù�Ùä+:qðR=
²\¨Õ•˜[”˜¢åTX·É'äºæ¾ïh\.Q#JŒ_� úô¢ À
sÑ´0nn	šÁŸÁN ‡vg�\d®$ËQl|5È^ñŤ£3–M	!fÿ||žϯ?³É%ãžÔu2ðòqè*I²Šîªúw31ÏJpêí¨nAòHÂ
SL óY01Üi%ý,Ïše¶.Øû8:•õW2Ø�›q¶(Óf]õ˜æ‹ª½Ü„ýÅJ�¶ú

4›{½š–jq§�R,ª&K1û �м³1×Í–þÁîÔrˆ¹ÑdYqŸ‹B”P¢€•¸µì*°äM/Y6mƒÁ¥8ä\Y‹{cåÿE;`“K^u"Ô�¸ŒGRÁ—Ñ‘=€:¨Ù&Oöç~Y‹Õ2­[g0­#Ë…YUVZ *s½*ª™8ÔGHž}|‹NûÃèxºnë…þ¿—˜µêgó„0aEží„úSîíÙƒÇé2-â ^d@uÉ8ž®ÇãÉ°wÑ�‡½Ñ[aðaì hñ·"Q4§i¡…ÏëªÐŸ¦už«Õ0-g˜¶}hkYÇVô=‰®.z㉜×ãM½(oQ¶×RôØÀÙ³äTû€¾Ûñ_¨+çÙ��#§UmGÕ9dX¡F©…ϱZü¶À”¨WYU,ÛíÊfÿ"›ud;{Óï¨f;U?]@»î3Î1qè1×Ùöó0ó=·s�¹{ž>og¢uÚlÛ×9Áýª=›…Ìɯ$þ
œÛçó
+endstream
+endobj
+3872 0 obj
+<<
+/Type /Page
+/Contents 3873 0 R
+/Resources 3871 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3875 0 R
+>>
+endobj
+3874 0 obj
+<<
+/D [3872 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+786 0 obj
+<<
+/D [3872 0 R /XYZ 70.866 771.024 null]
+>>
+endobj
+3639 0 obj
+<<
+/D [3872 0 R /XYZ 90.305 704.386 null]
+>>
+endobj
+790 0 obj
+<<
+/D [3872 0 R /XYZ 70.866 677.007 null]
+>>
+endobj
+3640 0 obj
+<<
+/D [3872 0 R /XYZ 175.977 607.65 null]
+>>
+endobj
+794 0 obj
+<<
+/D [3872 0 R /XYZ 70.866 578.567 null]
+>>
+endobj
+3641 0 obj
+<<
+/D [3872 0 R /XYZ 291.444 510.915 null]
+>>
+endobj
+798 0 obj
+<<
+/D [3872 0 R /XYZ 70.866 481.724 null]
+>>
+endobj
+3642 0 obj
+<<
+/D [3872 0 R /XYZ 182.298 414.179 null]
+>>
+endobj
+802 0 obj
+<<
+/D [3872 0 R /XYZ 70.866 386.8 null]
+>>
+endobj
+3643 0 obj
+<<
+/D [3872 0 R /XYZ 172.211 317.443 null]
+>>
+endobj
+806 0 obj
+<<
+/D [3872 0 R /XYZ 70.866 288.36 null]
+>>
+endobj
+3644 0 obj
+<<
+/D [3872 0 R /XYZ 135.925 220.707 null]
+>>
+endobj
+810 0 obj
+<<
+/D [3872 0 R /XYZ 70.866 193.328 null]
+>>
+endobj
+3645 0 obj
+<<
+/D [3872 0 R /XYZ 135.925 123.972 null]
+>>
+endobj
+3871 0 obj
+<<
+/Font << /F50 2307 0 R /F72 2883 0 R /F43 2258 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+3878 0 obj
+<<
+/Length 672       
+/Filter /FlateDecode
+>>
+stream
+xÚ­–Qwš0Çßù9g/ðÐ4
à‘Uªë:µ‚{éz8LSË™¢Sèê·ß

¬v§Â6äšäþs÷Þ	Z ‚úÚÇH»¼f¹ØãÜBÑ#rv9GŽgbNQ4G÷ºÍ�‡èY0eÙüÊÑët)ŒÓqõÞzV¬D–'yºÎäR-ˆ´Ÿ…•ÑFÑu±kÚh¶ÒîšÃÜ
EÏE¿Ê•+d33Û{‰BíN#g£ä“:LŽ)6±ÇŒJÑ£Û�Æ–çòÚ1‘ƒ=‡PéKÐ…E0¡žrû0�i(üàTÚä…XÄVÔas0a#×Và£ò@±¥ŒgÃdºØîªtœÄ.÷w11í£°ù«°­x:î6Ñ}Ñ Žä¯(žw%ú4£ ÷h¥°_
+–b•�Â}‡”)½éf5ΊreP¦ï•ýÃ0‰.ä×~×Ùy¹-ª{õ“þ7Ìr$ÉæÊÈÅrÙøìå’uQͬճ�²âhÁ¶}²Ü*Ya01Ñ¿“xè	:6
x7žu“Ãç|“‡bk€lÝÚŠb˜¬*aÀÜK.²3=ÏŽ˜¼ši:�&2%P¦¸_Z£é8ìXv%£$J÷ar¾êa±Ù¬
z0UQûÛu±éFxT5 «?õcÿ¶v­Wív@™·(VºÈ’¼ØVÅI–	mœæO«Ý?ñЊg<
+£xà{áÀÿľìÉi4èˆwª"R«ÅQË}×»\1
à4îž’ê”–C¾Ä,ò'¸žÒYsAµc5Oj_ªI»öå+ÿèŸÙ¢)[TòJT]›~#Äœ5ï˜7nîÓ?]ÏŒaÈx—Û¹¾•96nËàmfcÆlxb’%A_db›4'ê{ùò¬ÿ7”î2ϺxãoûoO
+endstream
+endobj
+3877 0 obj
+<<
+/Type /Page
+/Contents 3878 0 R
+/Resources 3876 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3875 0 R
+>>
+endobj
+3879 0 obj
+<<
+/D [3877 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+814 0 obj
+<<
+/D [3877 0 R /XYZ 70.866 771.024 null]
+>>
+endobj
+3646 0 obj
+<<
+/D [3877 0 R /XYZ 135.925 720.013 null]
+>>
+endobj
+818 0 obj
+<<
+/D [3877 0 R /XYZ 70.866 692.834 null]
+>>
+endobj
+3647 0 obj
+<<
+/D [3877 0 R /XYZ 144.12 628.986 null]
+>>
+endobj
+822 0 obj
+<<
+/D [3877 0 R /XYZ 70.866 599.996 null]
+>>
+endobj
+3648 0 obj
+<<
+/D [3877 0 R /XYZ 268.365 537.958 null]
+>>
+endobj
+826 0 obj
+<<
+/D [3877 0 R /XYZ 70.866 508.968 null]
+>>
+endobj
+3649 0 obj
+<<
+/D [3877 0 R /XYZ 166.813 446.931 null]
+>>
+endobj
+830 0 obj
+<<
+/D [3877 0 R /XYZ 70.866 419.752 null]
+>>
+endobj
+3650 0 obj
+<<
+/D [3877 0 R /XYZ 183.096 355.903 null]
+>>
+endobj
+834 0 obj
+<<
+/D [3877 0 R /XYZ 70.866 327.021 null]
+>>
+endobj
+3651 0 obj
+<<
+/D [3877 0 R /XYZ 196.312 264.876 null]
+>>
+endobj
+838 0 obj
+<<
+/D [3877 0 R /XYZ 70.866 235.886 null]
+>>
+endobj
+3652 0 obj
+<<
+/D [3877 0 R /XYZ 197.559 173.849 null]
+>>
+endobj
+842 0 obj
+<<
+/D [3877 0 R /XYZ 70.866 146.751 null]
+>>
+endobj
+3653 0 obj
+<<
+/D [3877 0 R /XYZ 239.52 82.821 null]
+>>
+endobj
+3876 0 obj
+<<
+/Font << /F50 2307 0 R /F72 2883 0 R /F43 2258 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+3882 0 obj
+<<
+/Length 593       
+/Filter /FlateDecode
+>>
+stream
+xÚ¥•Mo›@†ïüŠ•z�ƒ7³ËîG°“8‰SŒªFQ„ˆY(6V1jœß]ÀØVÓ¸Ôc°çÝ÷™fÍ �ñ56.ú�‹=!lO‘Ø9Å‚ 8CO¦ÀÄêQÇ5Ëå†$6ž×wýÅRÖß"9µ˜²�ùDZÏñ
bÌÆܱÕ•sôS#Œ�ŸQ
‘ö ×Å.eh²2žž
eê·Øö\ôVýs…WbL‹-ÑØøfÀIó‚`8p�)&`[=æ0|LÆW~jK}‡"{¨gâÕ¡_29]ä
+RÅU·°°íZCyÛ{P”bÏeµÆÐb*3ó½NÖxžMÞ¤eƒ¹-e¾Y¬óZêGÛq1PvLÂ’‡ñ0¹]AÚ°–ƒfŸpðZâ¡�í<«­¿j¢C¬Õ:;�Šï¨¢°Js�¨Œ‚æ~„v»çóÎçûO*ÑPÅ·ãä{u,Õ.jOòrºãTPmù—E¹z)+Ã�ø1ƒÓ0\ŽFÃë°cIš =Áät-.×ë×ÅyÝä6žC?ºµˆ*ãcè7Ñ·<•Výáw¬…VR"~ìÀ¤§Ë¦…òÂÍeÓHAZ¦g¡y
Ú�ÿ#éG¾ÅÁ$·áý ¾êˆÔ(´Ñ-�ÓEZ¥ÛcZèáŸÎV2/Ó²m¶¥ÌgåüR»‘ P‚ëûA׉ÐDµh„ÿÃ,Ð�’fÙ"ŸýÅ»ƒ>Ziœc°I—�¶ÛdSG°ƒMÆ8êR¹È\i¹›P/Ã)XWßg:a¦üÃâoG˜äý
+endstream
+endobj
+3881 0 obj
+<<
+/Type /Page
+/Contents 3882 0 R
+/Resources 3880 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3875 0 R
+>>
+endobj
+3883 0 obj
+<<
+/D [3881 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+846 0 obj
+<<
+/D [3881 0 R /XYZ 70.866 771.024 null]
+>>
+endobj
+3654 0 obj
+<<
+/D [3881 0 R /XYZ 155.283 720.013 null]
+>>
+endobj
+850 0 obj
+<<
+/D [3881 0 R /XYZ 70.866 691.131 null]
+>>
+endobj
+3655 0 obj
+<<
+/D [3881 0 R /XYZ 196.321 628.986 null]
+>>
+endobj
+854 0 obj
+<<
+/D [3881 0 R /XYZ 70.866 600.103 null]
+>>
+endobj
+3656 0 obj
+<<
+/D [3881 0 R /XYZ 171.404 537.958 null]
+>>
+endobj
+858 0 obj
+<<
+/D [3881 0 R /XYZ 70.866 509.076 null]
+>>
+endobj
+3657 0 obj
+<<
+/D [3881 0 R /XYZ 161.568 446.931 null]
+>>
+endobj
+862 0 obj
+<<
+/D [3881 0 R /XYZ 70.866 419.752 null]
+>>
+endobj
+3658 0 obj
+<<
+/D [3881 0 R /XYZ 141.861 355.903 null]
+>>
+endobj
+866 0 obj
+<<
+/D [3881 0 R /XYZ 70.866 328.725 null]
+>>
+endobj
+3659 0 obj
+<<
+/D [3881 0 R /XYZ 155.946 264.876 null]
+>>
+endobj
+870 0 obj
+<<
+/D [3881 0 R /XYZ 70.866 235.994 null]
+>>
+endobj
+3660 0 obj
+<<
+/D [3881 0 R /XYZ 215.034 173.849 null]
+>>
+endobj
+874 0 obj
+<<
+/D [3881 0 R /XYZ 70.866 144.859 null]
+>>
+endobj
+3661 0 obj
+<<
+/D [3881 0 R /XYZ 146.496 82.821 null]
+>>
+endobj
+3880 0 obj
+<<
+/Font << /F50 2307 0 R /F72 2883 0 R /F43 2258 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+3886 0 obj
+<<
+/Length 633       
+/Filter /FlateDecode
+>>
+stream
+xÚ�•]sš@†ïù;Ó¸Èæì²»À%%¨¤T©2�i“Œc•¦
+Ö’6ö×w­M&JnD—=¯ïs>v
- ¾ñ>5.{�‹=!l”Þ#°+r<ŠAéݘ̵îÒkdËW62®^íå«Ìº Žk^•óÇuVT³*/µÕSã‡AäN@d¯èºØ¥Í×ÆÍ …|w�¤¢ç¢ßõÎ5bÜÆœÙòû
+MŒOœt)†Ö¦ÀSL±.˜~’L“±EÁYÌT}Œ‚Q¬^öŠì9@” 0¯Qz·ÈîóBÒ‰½Ì(­Cëx ÐÈH·WR†R칬‘ñ7›U>o²R'*žY6˜;e)Û6Kɶ¬Êy¹j~
³eYåÿDÜ?N†òIš?<Jƒòíb ì8Tg`£ñÕt}
§qô1J;¢?�?ðÏ_áç�Ö8›—ÛE2ÉÿX„›ºcâ|�WçóØš'ˆ£p˜Nƒ°®j:M¿$á+HîH	~ ²O«\öyèʖªò[*ˬ٪Ý&;�i´‰dâ`~Çgã½T1)£%žá±Ó
;QH²CY”ï;ô�œü˜“kÎÁdàèZ4¤Yˆ8]¨Á¬Xü|˜}¯G­ñ»mºñìʈÃ1G�oy²$ÑhØýôPÑudëßyÃÑÑÕ½Óº�u7uõ-ãöã.«w2ãþªí“·vÛøÃ~8
¢d �wî£ØÖ<;c®fÅR÷I�oÚÞ?@ì®6Î1ؤËÍÖÞhSG0åˆq†9gò‰…”¬mõ³"ÛÊ�Ógè7UÈ]{窫äi·Ti3³â�
\²ãÑ
+endstream
+endobj
+3885 0 obj
+<<
+/Type /Page
+/Contents 3886 0 R
+/Resources 3884 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3875 0 R
+>>
+endobj
+3887 0 obj
+<<
+/D [3885 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+878 0 obj
+<<
+/D [3885 0 R /XYZ 70.866 771.024 null]
+>>
+endobj
+3662 0 obj
+<<
+/D [3885 0 R /XYZ 256.789 720.013 null]
+>>
+endobj
+882 0 obj
+<<
+/D [3885 0 R /XYZ 70.866 691.023 null]
+>>
+endobj
+3663 0 obj
+<<
+/D [3885 0 R /XYZ 143.474 628.986 null]
+>>
+endobj
+886 0 obj
+<<
+/D [3885 0 R /XYZ 70.866 601.807 null]
+>>
+endobj
+3664 0 obj
+<<
+/D [3885 0 R /XYZ 158.923 537.958 null]
+>>
+endobj
+890 0 obj
+<<
+/D [3885 0 R /XYZ 70.866 509.076 null]
+>>
+endobj
+3665 0 obj
+<<
+/D [3885 0 R /XYZ 162.456 446.931 null]
+>>
+endobj
+894 0 obj
+<<
+/D [3885 0 R /XYZ 70.866 418.049 null]
+>>
+endobj
+3666 0 obj
+<<
+/D [3885 0 R /XYZ 146.433 355.903 null]
+>>
+endobj
+898 0 obj
+<<
+/D [3885 0 R /XYZ 70.866 328.806 null]
+>>
+endobj
+3667 0 obj
+<<
+/D [3885 0 R /XYZ 145.115 264.876 null]
+>>
+endobj
+902 0 obj
+<<
+/D [3885 0 R /XYZ 70.866 235.994 null]
+>>
+endobj
+3668 0 obj
+<<
+/D [3885 0 R /XYZ 120.054 173.849 null]
+>>
+endobj
+906 0 obj
+<<
+/D [3885 0 R /XYZ 70.866 146.751 null]
+>>
+endobj
+3728 0 obj
+<<
+/D [3885 0 R /XYZ 161.559 82.821 null]
+>>
+endobj
+3884 0 obj
+<<
+/Font << /F50 2307 0 R /F72 2883 0 R /F43 2258 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+3890 0 obj
+<<
+/Length 548       
+/Filter /FlateDecode
+>>
+stream
+xÚ�”Mo£0†ïü
+K{�Cܱ±
wh¨²­Jh¥U·ŠÒà$h	Qݶÿ~m>Ò&Í6%7üŽßgÆ3€йñ#6ÎÈÅž6ŠçÈ
ì
+��bAPœ ;S`bõ¨ãšeV�‰�—õ.H3Y¯"9·˜r#ó™´îãĘ�¹c«;ªÌÓ_
?6
¢>"Û‹\»”¡Ùʸ»”¨°í¹è¹:¹BŒ«`LËÐظ6à¨yA0¼s�)&ijzÌ8üé&W7±¶t89Øs€h= žM°ËY-ý–Èyš+H±£«¶ð¤Ž œ½9P(S@Íåqº’½õSYŸÜñªNrŠ�ˆ››ýQè_Æ“¡?]utº#í`¶Ÿ¥2/ë’e–­ëåJÅt!#0ø�iJ„±YÌ[?:	CÉߤ-=Ž1–«gƒù×¢ÜÔëÎ<»8´­ˆÂ¡úaÿ»å©•ÿ	?T?ªÕJÙ=|Ô”E300Ëô7�MKyb]ì=�Iä_ë¾½ñÇñ	$Z^I[”äd”H>>É¢ü:
+ÛGQ/%~umMÑ([ˆùúä?·–Õƒ#ÜLç¯'V‰7hAxŽ‡þ #ÓVÖv´*ÃižËé�IÙÎö<-–2ùÀ°¾‡f9çlÒe”·#\`êön„3Ž…hñ\ær£²Ü¸yÐ>›ìÖ–êô—×…Nš)ó}‹ÿ­5¥

+endstream
+endobj
+3889 0 obj
+<<
+/Type /Page
+/Contents 3890 0 R
+/Resources 3888 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3875 0 R
+>>
+endobj
+3891 0 obj
+<<
+/D [3889 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+910 0 obj
+<<
+/D [3889 0 R /XYZ 70.866 771.024 null]
+>>
+endobj
+3729 0 obj
+<<
+/D [3889 0 R /XYZ 70.866 704.386 null]
+>>
+endobj
+914 0 obj
+<<
+/D [3889 0 R /XYZ 70.866 677.191 null]
+>>
+endobj
+3730 0 obj
+<<
+/D [3889 0 R /XYZ 158.062 607.65 null]
+>>
+endobj
+918 0 obj
+<<
+/D [3889 0 R /XYZ 70.866 578.46 null]
+>>
+endobj
+3731 0 obj
+<<
+/D [3889 0 R /XYZ 161.595 510.915 null]
+>>
+endobj
+922 0 obj
+<<
+/D [3889 0 R /XYZ 70.866 481.724 null]
+>>
+endobj
+3732 0 obj
+<<
+/D [3889 0 R /XYZ 152.943 414.179 null]
+>>
+endobj
+926 0 obj
+<<
+/D [3889 0 R /XYZ 70.866 384.988 null]
+>>
+endobj
+3733 0 obj
+<<
+/D [3889 0 R /XYZ 149.957 317.443 null]
+>>
+endobj
+930 0 obj
+<<
+/D [3889 0 R /XYZ 70.866 288.36 null]
+>>
+endobj
+3734 0 obj
+<<
+/D [3889 0 R /XYZ 177.77 220.707 null]
+>>
+endobj
+934 0 obj
+<<
+/D [3889 0 R /XYZ 70.866 191.517 null]
+>>
+endobj
+3735 0 obj
+<<
+/D [3889 0 R /XYZ 193.775 123.972 null]
+>>
+endobj
+3888 0 obj
+<<
+/Font << /F50 2307 0 R /F72 2883 0 R /F43 2258 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+3894 0 obj
+<<
+/Length 695       
+/Filter /FlateDecode
+>>
+stream
+xÚ�•]oÚ0†ïó+,í&‘†k;q>.1¥¥…Ž¸ÚPWE¸€¡K²­üûÙØde«šÒ›€cŸ7ïsŽíƒÀ pnu¹uÖ§„0ò}ð ú>"}øÜÙ9÷ü¸rÊõ|·Û_­…Ó!Ah'ÛÙÏ�(ê¼^mµÔbÜúaa¹
Ü(†!‰fëî�¹œ»R1
+ÁïýÊ
ð¨©çÊÿk�ZŸ,ÔêÒÇlúC1ñ�FÙlÔ›8ÙÓÎ’Œ}ál”^ŒG©rxÖ` ¬äè¸"i¥sñ°*$�odþ“ØÏ 'j1éù¯7)FŒBO‹±bV:RÞÞ=Öb®3ÆžjQT2[•oDUå¡ÅŽ@•³"â3†‘_ô†ŒŸHd‚Þ+T‡óÕÌ!Èþ®¢~§çÐx²iv{“8²c'’vØ+þÃü�X¶3Õ…"Øi€ÛÇy^‹wÂD暥i¬vÙ9Ëq:8±ûðC¨�é³öM•>ŠÙ*_kóÕ®¨—¢–5:bÙ–yµ|+"=BtQsŽ’lÜÏX<¹r°Lß4{V;õˆO¬ß3A©ó¸ÙŠ´½Œ¬0ghû`ÎR.�¦öÚ”5Éëü}Eu±!Ä£$ÄC–M×wȉu=V˜6û‘öÚòb^-s}Ø4I)js‡¼†˜ÑXU‹gü*Å™{"ÇhÜîÇÒ^¡Ïå¶Xhß¿BmQª›N¿e¹-UB?êq±5·‰útßN纮#³'Y�MT¾xÖÄ£7dW‚5©ÛNÚÍÍ^ì	Y™åzõ!2k®•Þ2_‘«æxèj/5IJ!rñ)=òÐ}HßS&=êAJ=ù})¹wz.
+QæMÿùöìL¶*…O»…ʨ-Š=þ
�õä
+endstream
+endobj
+3893 0 obj
+<<
+/Type /Page
+/Contents 3894 0 R
+/Resources 3892 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3875 0 R
+>>
+endobj
+3895 0 obj
+<<
+/D [3893 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+938 0 obj
+<<
+/D [3893 0 R /XYZ 70.866 771.024 null]
+>>
+endobj
+3736 0 obj
+<<
+/D [3893 0 R /XYZ 199.208 720.013 null]
+>>
+endobj
+942 0 obj
+<<
+/D [3893 0 R /XYZ 70.866 691.023 null]
+>>
+endobj
+3737 0 obj
+<<
+/D [3893 0 R /XYZ 135.782 628.986 null]
+>>
+endobj
+946 0 obj
+<<
+/D [3893 0 R /XYZ 70.866 599.996 null]
+>>
+endobj
+3738 0 obj
+<<
+/D [3893 0 R /XYZ 158.538 537.958 null]
+>>
+endobj
+950 0 obj
+<<
+/D [3893 0 R /XYZ 70.866 508.968 null]
+>>
+endobj
+3739 0 obj
+<<
+/D [3893 0 R /XYZ 240.301 446.931 null]
+>>
+endobj
+954 0 obj
+<<
+/D [3893 0 R /XYZ 70.866 417.941 null]
+>>
+endobj
+3740 0 obj
+<<
+/D [3893 0 R /XYZ 182.63 355.903 null]
+>>
+endobj
+958 0 obj
+<<
+/D [3893 0 R /XYZ 70.866 326.914 null]
+>>
+endobj
+3741 0 obj
+<<
+/D [3893 0 R /XYZ 139.224 264.876 null]
+>>
+endobj
+962 0 obj
+<<
+/D [3893 0 R /XYZ 70.866 235.994 null]
+>>
+endobj
+3742 0 obj
+<<
+/D [3893 0 R /XYZ 200.75 173.849 null]
+>>
+endobj
+966 0 obj
+<<
+/D [3893 0 R /XYZ 70.866 144.859 null]
+>>
+endobj
+3743 0 obj
+<<
+/D [3893 0 R /XYZ 179.85 82.821 null]
+>>
+endobj
+3892 0 obj
+<<
+/Font << /F50 2307 0 R /F72 2883 0 R /F43 2258 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+3898 0 obj
+<<
+/Length 690       
+/Filter /FlateDecode
+>>
+stream
+xÚ¥•]s¢0†ïù™Ù¸ Møæ•nÕ)ÄéÎv:ŒÅh™U˜ínÿý&$µê:E»7ÏËûääœ °Œ”Q®†6ôÇd\=Ç
®o@²÷ª±¦®§6›§&|oÃ|CÅ(¦+
#•V´È¨ö@®�e™ÐvMö�VÁÆ|V	‰ò¬`6‰Þ}Èó gX Û*÷,ÙÚ5@Ðô=ð»ýçX6³¸Ø$Ê­‚:Í;¢=÷Ѐش4#„Ôh�N¢dh>RIÌ�]
]¸Ðwæ*è&‚ûBàÛ’®ò‚¡:{Ñ<²�Ð-¡Àü}ø`
+†
}Ï
+	­ë¼,ÄfEñÜæõvÑdr3iU••P: â^<ˆëÆ–0óiög£iô3¤ár!Í?áÉþÉ2ó¢¢Y¹.òš.%�f"õOC‹Ô¡	ÕãJÁ ‡77³Oˆ¼D½]œ@qºQËÍ›0¼â_f–uÃV·ï`cºÙ”2g,‘‹5ý�+éîbÍ@êl:J'a’š�ÔQxaÞîâ]<‹¤n÷9œìÛ/_½\éeµ¤Õy@ö!�'�X=$³‡·¼ÌĤýÙ”|~O%oOé@EzÝ©Œéó­�“•E#å®âê¼X){¾„mó5'ãpJ¢¾è!Ñlš5�­E7óøÒT;1!$E²ß�Ó€¾4O´hòlÑÕ^;ÔÅ#Ùzˆ†Ù\È�È‹¬¬X57gŽ*•w‘xp!yï#PÐbÔ�á^G±Æ¬+Ur̘hþª±e¶z6>bc©ù’/´!(Ùðÿ³‘<ã­ãÿ¡ÍiÆÝåxꮵmˆL|ÉUû~Å:Ðpklè°Gë{DZ-šw›�ÜŸä”m
¾­ù¦ª´8¶øq
+endstream
+endobj
+3897 0 obj
+<<
+/Type /Page
+/Contents 3898 0 R
+/Resources 3896 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3900 0 R
+>>
+endobj
+3899 0 obj
+<<
+/D [3897 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+970 0 obj
+<<
+/D [3897 0 R /XYZ 70.866 771.024 null]
+>>
+endobj
+3744 0 obj
+<<
+/D [3897 0 R /XYZ 178.981 720.013 null]
+>>
+endobj
+974 0 obj
+<<
+/D [3897 0 R /XYZ 70.866 692.834 null]
+>>
+endobj
+3745 0 obj
+<<
+/D [3897 0 R /XYZ 190.691 628.986 null]
+>>
+endobj
+978 0 obj
+<<
+/D [3897 0 R /XYZ 70.866 599.996 null]
+>>
+endobj
+3746 0 obj
+<<
+/D [3897 0 R /XYZ 208.345 537.958 null]
+>>
+endobj
+982 0 obj
+<<
+/D [3897 0 R /XYZ 70.866 508.968 null]
+>>
+endobj
+3747 0 obj
+<<
+/D [3897 0 R /XYZ 180.487 446.931 null]
+>>
+endobj
+986 0 obj
+<<
+/D [3897 0 R /XYZ 70.866 417.941 null]
+>>
+endobj
+3748 0 obj
+<<
+/D [3897 0 R /XYZ 192.179 355.903 null]
+>>
+endobj
+990 0 obj
+<<
+/D [3897 0 R /XYZ 70.866 326.914 null]
+>>
+endobj
+3749 0 obj
+<<
+/D [3897 0 R /XYZ 237.449 264.876 null]
+>>
+endobj
+994 0 obj
+<<
+/D [3897 0 R /XYZ 70.866 235.886 null]
+>>
+endobj
+3750 0 obj
+<<
+/D [3897 0 R /XYZ 193.676 173.849 null]
+>>
+endobj
+998 0 obj
+<<
+/D [3897 0 R /XYZ 70.866 144.967 null]
+>>
+endobj
+3751 0 obj
+<<
+/D [3897 0 R /XYZ 188.332 82.821 null]
+>>
+endobj
+3896 0 obj
+<<
+/Font << /F50 2307 0 R /F72 2883 0 R /F43 2258 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+3903 0 obj
+<<
+/Length 698       
+/Filter /FlateDecode
+>>
+stream
+xÚ�•_W›0Æïù9g7pÑBŸËZ‚«Ç×âtÇyz*¤•3
m©Ö}ú%�t«sVvEyÞ_ž÷MXNŒãÄ8Š(>\×
Éxú®¼C×I®MŠ­›ä8â“C\×ÌFù=·zØóÍ°J7/ëy�W¥\j°Äx4l±
{§èûÐǤ…q}ƒ@&¾�¡øà¹YYBH‰#Æ÷`j|1ÐÁ,]"�¦mˆ¡M°Õ³Bæ8¶2“»:gƒ„…2³£ÈÃÀƒ�‡l)ƒ@ÏAÙA«ð)㋼TnþGh3Ó³q«!Rü�ŠÐÀ>i5&<åù“…©É³v{æ©…‘ù£}YX2«Uû²®
+^ßåå²}-«º¬øㆯk!Ðün�\¦ìC„É>´£ ý™æŽâ‹qWè&\‡*hçhÚj¸ ?­óïát^«ÊèKÚM}'�mjæõË+Òv;6eR¢IÙDîk2‹/	G¡|ô­@L²w¸ý·¸Ù¤"}¬ÈÉÿ“³íC¾êb UX#6šÅEæW6‰ÎšÑeG‰6üR£ÐÕ;â…ôI¢\ŠÛ2^	2§²„ÏïàÐ}WáDñäx†l,z)aãé0w´æ-åö'jûí6Ï2^*kÊTa>ÔºGÙ¶æåZ_3ÌÓ†õ¯DfÆÂÎGÌ^¨bò>`Ô|›–-:«ÐçEZ­É:ÿ)­ReÈ%þ6å<ëR‹¾Bc£óäÛl×hƒÏýá¸#âNB‡+Lÿ°u¬xÐçÅ¿ºlÄ×ëù’œ,PdSvͦÓ1w|ëò•D¢È0:L6å÷íÖ²Ô5˜þ
)ïR}	¾u§R
+‘cw¹RõUêBì¹DæF(�”ñ„®�l<á%_ÍwÝq+÷çE_öMI½,åNš¼|�ã/œ…ø
+endstream
+endobj
+3902 0 obj
+<<
+/Type /Page
+/Contents 3903 0 R
+/Resources 3901 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3900 0 R
+>>
+endobj
+3904 0 obj
+<<
+/D [3902 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+1002 0 obj
+<<
+/D [3902 0 R /XYZ 70.866 771.024 null]
+>>
+endobj
+3752 0 obj
+<<
+/D [3902 0 R /XYZ 240.632 720.013 null]
+>>
+endobj
+1006 0 obj
+<<
+/D [3902 0 R /XYZ 70.866 691.023 null]
+>>
+endobj
+3753 0 obj
+<<
+/D [3902 0 R /XYZ 191.425 628.986 null]
+>>
+endobj
+1010 0 obj
+<<
+/D [3902 0 R /XYZ 70.866 600.103 null]
+>>
+endobj
+3754 0 obj
+<<
+/D [3902 0 R /XYZ 146.962 537.958 null]
+>>
+endobj
+1014 0 obj
+<<
+/D [3902 0 R /XYZ 70.866 509.076 null]
+>>
+endobj
+3755 0 obj
+<<
+/D [3902 0 R /XYZ 143.51 446.931 null]
+>>
+endobj
+1018 0 obj
+<<
+/D [3902 0 R /XYZ 70.866 418.049 null]
+>>
+endobj
+3756 0 obj
+<<
+/D [3902 0 R /XYZ 198.446 355.903 null]
+>>
+endobj
+1022 0 obj
+<<
+/D [3902 0 R /XYZ 70.866 327.021 null]
+>>
+endobj
+3757 0 obj
+<<
+/D [3902 0 R /XYZ 199.424 264.876 null]
+>>
+endobj
+1026 0 obj
+<<
+/D [3902 0 R /XYZ 70.866 237.778 null]
+>>
+endobj
+3758 0 obj
+<<
+/D [3902 0 R /XYZ 180.846 173.849 null]
+>>
+endobj
+1030 0 obj
+<<
+/D [3902 0 R /XYZ 70.866 144.859 null]
+>>
+endobj
+3759 0 obj
+<<
+/D [3902 0 R /XYZ 158.932 82.821 null]
+>>
+endobj
+3901 0 obj
+<<
+/Font << /F50 2307 0 R /F72 2883 0 R /F43 2258 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+3907 0 obj
+<<
+/Length 714       
+/Filter /FlateDecode
+>>
+stream
+xÚÅ•MSâ0Çïý™ÙK{ &éû±@ÀºˆÚgw\§S!`gJÑvõÛoÒ¤ˆ®#v÷°'BBþ<¿üŸV�±ÖO´“‘�€}Ç1A².‚žã×'ÐÁ Y€Ý�Øè×Ó·E�SÞËo£¼`r±¥�‘Î*VΙq›œ
Ë2¡íšü?Û»M´G
óMðþ�<zÄóµvs‹À‚Ÿ�
Mß¿š_®�es1Kˆ Ö®4t4xCt=$ÛÈèa„�N£È H¿ˆÒ`B›e’Ft@Ãk:QžŒ\\è»Iz&‚ûRíË‚-ó’s;RJÉH4'=B¤û%<®Eô=Kj«Œž…ô­|Æû¬–‹;ÆJ¹ªØœå?
bël!_ñŠà<ˆˆõ+Ô¾a"=¦ç4ŽÃFú˜v$ì··ùMf~fK‰~¶(ž%ÀR„°á˜aÍšÍ5«ëlÅ>DР5ìšFáè{:2<N> òÞ¡ÃZ	q]¡YÇÑ­eù„È<Ûª¸‘ˆ3lëíQ¾)!Ë‹]Õ�Ù|câi0ƧÁ׿±ðå®"uŽgç`³+”_åFeh¶u^±�0ì×ÖŒˆ^	��“tv94ø[†Ï=¥MìK±V(Höpî§2´m]�;V+¼ÙÃbohStY±ëà˜Ýféä"žEôßûˡПÆû�ÆQ¨ça‡ÓqJ¿%t‡Ó¸#â;ÏDÇ]Œ7kåÖ:+¹u¢Ïð,S­‡‰Œ{Ú²²æ…¨¸³ª½�×u^®>Oì*âp2¡ã`’^ò,æ©ç4á6wËݽÈþ~³�žÈè8uXl•’ã!«D9ek¶V7Œ/¦‹¡ÛNË÷†¯mCdâ.³·�¹$®cÌ\ˆÿh"³’U¼’T�݉"P¦7�+Ï+ñœ:OÂ7!þ6«
+endstream
+endobj
+3906 0 obj
+<<
+/Type /Page
+/Contents 3907 0 R
+/Resources 3905 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3900 0 R
+>>
+endobj
+3908 0 obj
+<<
+/D [3906 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+1034 0 obj
+<<
+/D [3906 0 R /XYZ 70.866 771.024 null]
+>>
+endobj
+3760 0 obj
+<<
+/D [3906 0 R /XYZ 167.683 720.013 null]
+>>
+endobj
+1038 0 obj
+<<
+/D [3906 0 R /XYZ 70.866 692.915 null]
+>>
+endobj
+3761 0 obj
+<<
+/D [3906 0 R /XYZ 165.002 628.986 null]
+>>
+endobj
+1042 0 obj
+<<
+/D [3906 0 R /XYZ 70.866 599.996 null]
+>>
+endobj
+3762 0 obj
+<<
+/D [3906 0 R /XYZ 186.969 537.958 null]
+>>
+endobj
+1046 0 obj
+<<
+/D [3906 0 R /XYZ 70.866 510.78 null]
+>>
+endobj
+3763 0 obj
+<<
+/D [3906 0 R /XYZ 137.063 446.931 null]
+>>
+endobj
+1050 0 obj
+<<
+/D [3906 0 R /XYZ 70.866 417.941 null]
+>>
+endobj
+3764 0 obj
+<<
+/D [3906 0 R /XYZ 180.29 355.903 null]
+>>
+endobj
+1054 0 obj
+<<
+/D [3906 0 R /XYZ 70.866 327.021 null]
+>>
+endobj
+3765 0 obj
+<<
+/D [3906 0 R /XYZ 167.683 264.876 null]
+>>
+endobj
+1058 0 obj
+<<
+/D [3906 0 R /XYZ 70.866 237.778 null]
+>>
+endobj
+3766 0 obj
+<<
+/D [3906 0 R /XYZ 235.306 173.849 null]
+>>
+endobj
+1062 0 obj
+<<
+/D [3906 0 R /XYZ 70.866 144.859 null]
+>>
+endobj
+3767 0 obj
+<<
+/D [3906 0 R /XYZ 160.33 82.821 null]
+>>
+endobj
+3905 0 obj
+<<
+/Font << /F50 2307 0 R /F72 2883 0 R /F43 2258 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+3911 0 obj
+<<
+/Length 663       
+/Filter /FlateDecode
+>>
+stream
+xÚ�•Qo›0…ßù–öq�Á	8Uº.0BÖN]eÄÍ�’º5ÿ~6ÚLiCú’ ð=ºß=G׬—Ú0Õ.F
z”Z }‚.¥Àñ0¤&H—àN'¶qŸ^
K|²l*êê·£ü‘ì¸z¸ÉžÖ¼¨U¾)äQ�¥ÚoÍ'0;E×….¶A¶ÖîîXŠoW@(z.ø[Ÿ\›X�Ø–x~Sí«†NvIMˆÚ6)4!†&q��‰Ògv³ eáü›N}ƒ ý’Éþ.FôdJ1‚Èô”Χ%ÈÁF�ˆ�ú=zF¾’ý¾ô%¤0†žk+©™�±�þ¼åYÅ—jZk¾Û-VÍè�¼46Ò+%v)ûr!Âö!Ÿ×ð…,H$Ó÷8�³$10Ò£äL<©Ñԋچ̲Þ!#J%ä™h\°í·µë5
/ËMùa0Š°¡œ™ÎVC¥ãÑ8ð
O<½çž{o¨T”BÚY‡ýÓ€ÃEãWÖ‚ä?ÂÙ¢ú¸uÔì¢9�Åq¤ðD´ØmÊ&Óq49;�JçP£¡¤¬O@wOÛí¦
i#ªB[ñb×YÛ‹–ÒâŽöó$’I½™ÌÿLëbUØÆ�voV”<Û¬Š|×2oØèK֧ꗜ�Iô¼Ú÷·Ój�UØ�žiè«°v
+mhÃÓv¾Éž·y)&Ñ›ÌnÈbµV¡™ÊŸ(ˆ®çßXò�¬ÆI””7\6=mçM¹)V
+%½žª‡?&bãìš;§yÙ�QÈz­M÷øÚlÊ_mMÜkkn–üIJ쮽c·(!Yæ9—h{yRˆj˦lbCBlñ©�¬;»ä/Ýø)Dzo¯÷zìWrv:/þïñ¥Æ®
+endstream
+endobj
+3910 0 obj
+<<
+/Type /Page
+/Contents 3911 0 R
+/Resources 3909 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3900 0 R
+>>
+endobj
+3912 0 obj
+<<
+/D [3910 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+1066 0 obj
+<<
+/D [3910 0 R /XYZ 70.866 771.024 null]
+>>
+endobj
+3768 0 obj
+<<
+/D [3910 0 R /XYZ 180.092 720.013 null]
+>>
+endobj
+1070 0 obj
+<<
+/D [3910 0 R /XYZ 70.866 691.023 null]
+>>
+endobj
+3769 0 obj
+<<
+/D [3910 0 R /XYZ 158.188 628.986 null]
+>>
+endobj
+1074 0 obj
+<<
+/D [3910 0 R /XYZ 70.866 600.103 null]
+>>
+endobj
+3770 0 obj
+<<
+/D [3910 0 R /XYZ 150.817 537.958 null]
+>>
+endobj
+1078 0 obj
+<<
+/D [3910 0 R /XYZ 70.866 510.86 null]
+>>
+endobj
+3771 0 obj
+<<
+/D [3910 0 R /XYZ 185.938 446.931 null]
+>>
+endobj
+1082 0 obj
+<<
+/D [3910 0 R /XYZ 70.866 418.049 null]
+>>
+endobj
+3772 0 obj
+<<
+/D [3910 0 R /XYZ 209.618 355.903 null]
+>>
+endobj
+1086 0 obj
+<<
+/D [3910 0 R /XYZ 70.866 326.914 null]
+>>
+endobj
+3773 0 obj
+<<
+/D [3910 0 R /XYZ 146.962 264.876 null]
+>>
+endobj
+1090 0 obj
+<<
+/D [3910 0 R /XYZ 70.866 235.994 null]
+>>
+endobj
+3774 0 obj
+<<
+/D [3910 0 R /XYZ 149.867 173.849 null]
+>>
+endobj
+1094 0 obj
+<<
+/D [3910 0 R /XYZ 70.866 144.859 null]
+>>
+endobj
+3775 0 obj
+<<
+/D [3910 0 R /XYZ 145.967 82.821 null]
+>>
+endobj
+3909 0 obj
+<<
+/Font << /F50 2307 0 R /F72 2883 0 R /F43 2258 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+3915 0 obj
+<<
+/Length 688       
+/Filter /FlateDecode
+>>
+stream
+xÚ­•Ms›0†ïü
+Íô‡(+@¦'cÇ©
­ÁM;i†qŒì0u Å¸Iþ}
É_­ë�™ž�„÷eŸ}×+@s¨§´#åºK
ÙØaÌ@ÑY€mÆ�åè˜%è^e˜hWºe«åbIb?‰]7]p±ñ™F@åϦ\{ˆn‘i˜ZFõ�F�ÒúTñ"å§BªC@dó!Ûƶn¢é³rÿ(©ÞÝ"À†c£—æ—ÏȤ•˜Y‹-P¨|RàdòŒ`ØÉë˜0¦]PGžŒ:q QP?{£î YÝÕ	^w-Yر€Ôj€®À@!ô.á³4«�ÙŽŠP¸‡ðJ˜Ð©²ÝfUéè:vlSèŒø4/Q¹à—¦Óªpߌ\#T}ñ{Tu6Ýܲ$P[3@mub™Ò°¥™ ºò´wÜ
Žy‡
+™ö$YwÁ–k8™žbK�›–ß	oZ¼¸«ÙR0yG8ì;2^¢èöi7_-$@–—b1™×­]p~>�#yÜAz±Ô~Dýî×-Y‡7¡’àtE‹*ª.ÞÃòi%iÑd™Øå3ñœæYƧešgG é¤rØþߋ½/‘ç‡ýÀ¿Ð°¿ã%*ë¼?íØ0].Ól.0xýGx-y¶<N²o—E$É èÅÁ8ú8Žâh¤é Ž}·¥9µwG©y·§UëD2�ž1#‚UùcíÙ�à’¦ó´\Šõc5v«7y!Çp)\_eÓIyQtY�h#îôC7ð}Ï�¼Î…Ø„›§�¬C±!@Üm?6ût
\äßkcølÆÛ9`ö?Áþ "ÿ‡êy’4Ães¯º&)Å`�KnÉõíÈ°n1sçv4)fգɯÇ3^LJ.§Þc]]94:yÓvo󺀲ä»)þEÚü"
+endstream
+endobj
+3914 0 obj
+<<
+/Type /Page
+/Contents 3915 0 R
+/Resources 3913 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3900 0 R
+>>
+endobj
+3916 0 obj
+<<
+/D [3914 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+1098 0 obj
+<<
+/D [3914 0 R /XYZ 70.866 771.024 null]
+>>
+endobj
+3776 0 obj
+<<
+/D [3914 0 R /XYZ 139.763 720.013 null]
+>>
+endobj
+1102 0 obj
+<<
+/D [3914 0 R /XYZ 70.866 692.834 null]
+>>
+endobj
+3777 0 obj
+<<
+/D [3914 0 R /XYZ 140.13 628.986 null]
+>>
+endobj
+1106 0 obj
+<<
+/D [3914 0 R /XYZ 70.866 601.888 null]
+>>
+endobj
+3778 0 obj
+<<
+/D [3914 0 R /XYZ 137.063 537.958 null]
+>>
+endobj
+1110 0 obj
+<<
+/D [3914 0 R /XYZ 70.866 508.968 null]
+>>
+endobj
+3779 0 obj
+<<
+/D [3914 0 R /XYZ 201.934 446.931 null]
+>>
+endobj
+1114 0 obj
+<<
+/D [3914 0 R /XYZ 70.866 418.049 null]
+>>
+endobj
+3780 0 obj
+<<
+/D [3914 0 R /XYZ 144.344 355.903 null]
+>>
+endobj
+1118 0 obj
+<<
+/D [3914 0 R /XYZ 70.866 326.914 null]
+>>
+endobj
+3781 0 obj
+<<
+/D [3914 0 R /XYZ 211.501 264.876 null]
+>>
+endobj
+1122 0 obj
+<<
+/D [3914 0 R /XYZ 70.866 235.886 null]
+>>
+endobj
+3782 0 obj
+<<
+/D [3914 0 R /XYZ 188.799 173.849 null]
+>>
+endobj
+1126 0 obj
+<<
+/D [3914 0 R /XYZ 70.866 146.67 null]
+>>
+endobj
+3802 0 obj
+<<
+/D [3914 0 R /XYZ 183.993 82.821 null]
+>>
+endobj
+3913 0 obj
+<<
+/Font << /F50 2307 0 R /F72 2883 0 R /F43 2258 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+3919 0 obj
+<<
+/Length 657       
+/Filter /FlateDecode
+>>
+stream
+xÚ­U]S£0}çWdf_ÈÌ !<¢¥µV«úà8N
kÇ–î¶8®ÿ~oXêöÓÙ’ÜÃ9çÞK(#Š:ÆYdœ¶9E’xBØ(zF.%RäzE)z0¹À�Ñ%²aËvÄ•«íÉ4Ã'–+ÍÖ<y›ey“y®ŽAdü6œ¤ˆ}"JI¤å df<<R”ÂÞ%DO¢÷òä9Ü&ܱa>E¡qgн,#´¦)#a®ƒO¥ÔŒ®Bf�.ü~+¼ð{Ý~GQ;m»r‰çR¦p(:±)¡ÌÓ?Òìy’ƒ,±1¾\¶4Ð\Ñ
Ë"žt4ŒŠ$¶6g²ÔãKœ§Ë—øu’�5ÀšÅCj9ëRøJʨ�%5ýîÕp/dÔ®"˺C¯²‹95cHqªés=&³ø[Ô¬RßTšÌó<Kê8L h‡ççAî'·ˆ«#˶_\ø–$Y–ÖÚ&¹g:;ÿE˜Û6ÂáõmÔ½éÃô3j»ƒ õ�,®#i”C‹ò|¥¢Tµ¬Mø©ßŸTZߊõjm¤z‘ôÌýþŽ7㪺smçv{øº=²aOà®0ƒÝ�ZØ�Çl¨‡?òÕ$÷6Úé׶ÂPЀêG€T£”›öþ"Ùç8¤'Y¾€Óʘ4.â
Åþ«ØiÒ—ò*“nÃÞ¨£œˆŽ¬íïúêËýªË!î`š’6hö‚ûoPTQ‡öîpùÙ£Še9y^Ìg+ïŸâev8{Ö`ß=Ž,²:joþ˾+ø¦k¾^|›îQÎ	µÙ1×h}}
+b¹ÂQ¬îΉȒZ'˳E\ÔTÊßÁG}Ácèû?cå•™å_9þ;
;
+endstream
+endobj
+3918 0 obj
+<<
+/Type /Page
+/Contents 3919 0 R
+/Resources 3917 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3900 0 R
+>>
+endobj
+3920 0 obj
+<<
+/D [3918 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+1130 0 obj
+<<
+/D [3918 0 R /XYZ 70.866 771.024 null]
+>>
+endobj
+3803 0 obj
+<<
+/D [3918 0 R /XYZ 164.563 720.013 null]
+>>
+endobj
+1134 0 obj
+<<
+/D [3918 0 R /XYZ 70.866 691.023 null]
+>>
+endobj
+3804 0 obj
+<<
+/D [3918 0 R /XYZ 213.267 628.986 null]
+>>
+endobj
+1138 0 obj
+<<
+/D [3918 0 R /XYZ 70.866 601.807 null]
+>>
+endobj
+3805 0 obj
+<<
+/D [3918 0 R /XYZ 236.328 537.958 null]
+>>
+endobj
+1142 0 obj
+<<
+/D [3918 0 R /XYZ 70.866 508.968 null]
+>>
+endobj
+3806 0 obj
+<<
+/D [3918 0 R /XYZ 299.406 446.931 null]
+>>
+endobj
+1146 0 obj
+<<
+/D [3918 0 R /XYZ 70.866 418.049 null]
+>>
+endobj
+3807 0 obj
+<<
+/D [3918 0 R /XYZ 283.679 355.903 null]
+>>
+endobj
+1150 0 obj
+<<
+/D [3918 0 R /XYZ 70.866 327.021 null]
+>>
+endobj
+3808 0 obj
+<<
+/D [3918 0 R /XYZ 105.251 264.876 null]
+>>
+endobj
+1154 0 obj
+<<
+/D [3918 0 R /XYZ 70.866 237.698 null]
+>>
+endobj
+3809 0 obj
+<<
+/D [3918 0 R /XYZ 176.515 173.849 null]
+>>
+endobj
+1158 0 obj
+<<
+/D [3918 0 R /XYZ 70.866 144.859 null]
+>>
+endobj
+3810 0 obj
+<<
+/D [3918 0 R /XYZ 160.573 82.821 null]
+>>
+endobj
+3917 0 obj
+<<
+/Font << /F50 2307 0 R /F72 2883 0 R /F43 2258 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+3931 0 obj
+<<
+/Length 575       
+/Filter /FlateDecode
+>>
+stream
+xÚ­•MoÚ@†ïþ+õb¼™ýð~¨I©ëª­h„øXˆ%0-¥üûîz
1m
+FÍÍ;ö¼ó>³# 9Ôn²àª—RXÁP6C°IM± (›¢A(0‰b*UX.6dÈð“?õò…ñO©™EB³6ÅÄD�ÙâœáD2[£RH¤‹Ý,øD…”Šr4YƒG@Sûî
fZ¡çêË%â‰ãNl�>8k^
÷˜b¢h¿& ‡�nQ3gëª')’XK NPÌk^§¿›šY^XPÑÈÍü|ºµöbÁ¦S†5Ÿî2|“:fÅÂ2ÿ@'£ÒÄãÑÆLýÛѶ|2E™Ûx¾*¼îš³¥1puLÅjªô:~>|¾ùð¾3¼ï~;�ö
+Yz}”[Åè	<é5Ò‘kã³gxØŽÝi‘Oüù>²¸Æ…v>pž—–‰u%n¯‘¿ðîY3‡ºûa¬/v»šl—VíDï„ÆZɆ–›éJ­ò¼+ÍùQ(÷5]s¶yQªaY͵èõ¼žì´ AõѸÖ=Œìénªxœ—i[lòy±ï–­eæv~þ=GhûQwêB®6XÝs\â/®ÿ b
*".Ç"¢
—WnyaD¼	o�1z9£mȼrË+côMÈ’™à—“	Þ†Ì+·¼3ÁÏ’”^[XI‚�‘KöÕ~O	L¥à�=Å,DÝð¾)ÌÚ.…Ú͸ñÛ¼]EÂ_»¹kfhŠ?-þõZàJ
+endstream
+endobj
+3930 0 obj
+<<
+/Type /Page
+/Contents 3931 0 R
+/Resources 3929 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3933 0 R
+/Annots [ 3921 0 R 3922 0 R 3923 0 R 3924 0 R 3925 0 R ]
+>>
+endobj
+3921 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.383 468.127 167.504 476.444]
+/A << /S /GoTo /D (tls1__3_8h_ab8ef12fab634c171394422d0ee8baf94) >>
+>>
+endobj
+3922 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [141.601 374.233 167.504 382.549]
+/A << /S /GoTo /D (tls1__3_8h_abddf8683546c89361c4a6e50bdff0b28) >>
+>>
+endobj
+3923 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.383 280.338 177.068 288.655]
+/A << /S /GoTo /D (tls1__3_8h_aa601c4712c56caa0b20a73cc5c7d6cf6) >>
+>>
+endobj
+3924 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.383 186.444 177.068 194.76]
+/A << /S /GoTo /D (tls1__3_8h_a474e9fd9b8bfb496452ffc6d022f3cb3) >>
+>>
+endobj
+3925 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.383 92.549 177.068 100.866]
+/A << /S /GoTo /D (tls1__3_8h_a72c8bfdadfaf9ba1c9e1a34c6ac78708) >>
+>>
+endobj
+3932 0 obj
+<<
+/D [3930 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+1162 0 obj
+<<
+/D [3930 0 R /XYZ 70.866 771.024 null]
+>>
+endobj
+3811 0 obj
+<<
+/D [3930 0 R /XYZ 223.229 718.169 null]
+>>
+endobj
+1166 0 obj
+<<
+/D [3930 0 R /XYZ 70.866 690.889 null]
+>>
+endobj
+1170 0 obj
+<<
+/D [3930 0 R /XYZ 70.866 595.291 null]
+>>
+endobj
+3150 0 obj
+<<
+/D [3930 0 R /XYZ 70.866 552.294 null]
+>>
+endobj
+1174 0 obj
+<<
+/D [3930 0 R /XYZ 70.866 525.198 null]
+>>
+endobj
+3812 0 obj
+<<
+/D [3930 0 R /XYZ 159.578 458.399 null]
+>>
+endobj
+1178 0 obj
+<<
+/D [3930 0 R /XYZ 70.866 429.309 null]
+>>
+endobj
+3813 0 obj
+<<
+/D [3930 0 R /XYZ 149.607 364.505 null]
+>>
+endobj
+1182 0 obj
+<<
+/D [3930 0 R /XYZ 70.866 335.414 null]
+>>
+endobj
+3814 0 obj
+<<
+/D [3930 0 R /XYZ 154.592 270.61 null]
+>>
+endobj
+1186 0 obj
+<<
+/D [3930 0 R /XYZ 70.866 241.52 null]
+>>
+endobj
+3815 0 obj
+<<
+/D [3930 0 R /XYZ 154.592 176.716 null]
+>>
+endobj
+1190 0 obj
+<<
+/D [3930 0 R /XYZ 70.866 147.625 null]
+>>
+endobj
+3073 0 obj
+<<
+/D [3930 0 R /XYZ 154.592 82.821 null]
+>>
+endobj
+3929 0 obj
+<<
+/Font << /F50 2307 0 R /F72 2883 0 R /F43 2258 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+3945 0 obj
+<<
+/Length 1747      
+/Filter /FlateDecode
+>>
+stream
+xÚµY[sÚ8~çWxºKv‹bù"ÛÓÎÎ�–BŠ�ífÒŽÇ1<!6µEZþýÊ–„�lêÝ<Y–ô}çèÜdÉÒ\’¥›Æ•Ó¸ìé²d!Urf’!!É°€ äL¥‡¦n^|s>H*}¥jˆÎËz{Á_´Ãl^Gþú‡Ä#A¦C]§ñ½
éHY‚ÛM˜Š&ùÏ�‡o²4¥ï>HtEË”~d#Ÿ%MW�®©´½”ìÆç†\ÊA š@ tÑ‚²,7×aÌCUIù\öE2€eÈ0�,K-U†¬³yd³ÂS<»h¡tZUqI&ãϹ “›†ôÀFí,¾eyÙ£ÔsŠE¡tÎNUZ�
a
+cÓñ”=QD<Ç1#º'eJÔ†©ï
+hì	ˆ´_iÕd‹WiU„
+° Ôùš,u+¡Â¥#˺*X¡ùšŠª
MGl™›ˆ
ñ»à–:ݳԬ+š‰1AÂZ_eY¡¦
õ&8Ÿ*Q%«&ÇL5Î)ef^»aÞo²U€žZ»IÿAEÏ„ÙïÉ•ÿ[0·ûåmª·¿Gå5¸u6EB|”w%Ì»áù†þr=åàï2¥&•À+õpÞ5ùÔÚÜÈ'Þ4W	d»ä1ÆêÿÊ8‰ü'LþcÊZñë‚Jº&'“5sî"Ìì­ÿ°
:fYÌyÜ|0¹ù®˜
ªÅ¦
+™4~™E“ß{94êR‚¨
+§­èe*2ëò)Ï‚9ð8«.Ÿò¤U�²ŽòQäÚý‹eB‘å´`mZ¿˜Ü�kj'ˆqJ¼™¯xyÉ󎟃Ð[²§ñš¬Öät¼Q´Z‰k0vGãQ—=È%Pz]¨öíípÐi;ƒñˆõÁBÄ<*(¨.äídìŒ;ã!ëPJ$4êÂ]w¯înØ“Z‚eÖÅú2˜ð�ÓNC©ruìÄ›‰æ±·Z>ëê†/A…iÝW‚ëQƒÑ½Ûít*£ªÔú¿¥†8<e…9”Zêvl;îç»öȹûTÉ
+Õz.Ý¿¿š®+Ù ŠÎ0Œe�k㘳À÷Çì,¼ dÍ?ÙÏG¼)ñmµž³�Æ�îÄ©f+õ\mb·]Û®f*õŽÔø·H%F¢Éµ�®‡Î©ÄH4X×·H¨©žO÷¿¸°R<ÔÔº8
+ké%8ú™¿ßµy4o‹°>øt;ž84p°Ç;»;á»×í
F]îãvס‘óÆΊª@“Z(
+÷´?Êÿö¥hñ504+—×íšQ]ÆQ$âYx<”̼—hâÅ<ŽÖ+Öü*ë²—ð�.Iú-„²ì×ß	G¼\Ft8ßý€Ošb’•SbêãF€s0[$€(žâ8çì©Å~Œ™Jue´»µÙÙÑ[µ:TÝ«±©ŠÌê*Ìxü‚c.G„¹DaÄ%NÖ«U󇀼e
�ëÿ\aZ¢¾{õÂi²ðžD8Ã$æšø,y©ùÈ_Æøû:ˆ©ÆN¶U]";	çKxÏjéùÖã=Ñj½ôâBSHÖþ‚æÚøGÑuhåûîm×çÓ"®Ìe  …õ¤;RB½øS�^/þÝ�\�í�sÿº<=ͦf±ÓØî}·Í£‡²=’ÅÓêW<}Ûmß9%_ÄôzGŠÎpÐ9n^ðzºðÐë�Éý­3vyØÝ/'O{F°™ƒ‹ÐµŠ#ùÑ2)A¨ýs÷ˆvpvJ�Ð_xÙgh	š&P,žix¢É^hšš”÷¦î™Î|³ du	
|sxjþʽŠ®e)@3Ì¡P½J§=Ž¿ÐÝö\{p“fÍ“*D°Ê&T¢™º�~·ó‘V:º–ŽajBP
eOMLO&P‘µ£§÷<³GáïD„}Õy´öØâ±/
+_ç	ŸVåÉ^
+£is¶æ~ñamzœã}„Æä4í1íë2@ª.µ,-X¼§¼ûò0íYÔY3fMèY°=Þ»×m§]²gZ½äê®×{ûêd“õsô³“1k?á
틤+2(ÍŸ�¦²9~{°­>bL7ƒ�yö6bæ#&Dì%¡é:<R~Ìâèù ’Y`ïT)’Ç>tFIºµ±MBðs"J²ØËÙ´² Õ×þ@<ÿ	pSÞÙMv9´›ü©iÈJ6fedœí³vŸÇ§ÝùH»PnqYóµËÞ`²³Ý\7qì	É·+•�›^
+ù3•E.Œ©‡î§ê:@è°ìDûŸß‹®”é<Y…çÜ(‹›dié5ž¦k”µF3ìþ‡8öˆ¸¿|¼PäæFÜu_¨róçfžÞS6™�ïrü*H<û
+endstream
+endobj
+3944 0 obj
+<<
+/Type /Page
+/Contents 3945 0 R
+/Resources 3943 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3933 0 R
+/Annots [ 3926 0 R 3927 0 R 3928 0 R 3934 0 R 3935 0 R 3936 0 R 3937 0 R 3938 0 R 3939 0 R 3940 0 R 3941 0 R 3942 0 R ]
+>>
+endobj
+3926 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [151.165 728.133 191.414 736.449]
+/A << /S /GoTo /D (tls1__3_8h_a42d4f54d23f86205a1fa590480181e0f) >>
+>>
+endobj
+3927 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [151.165 634.972 191.414 643.288]
+/A << /S /GoTo /D (tls1__3_8h_a52cadf7f83ff343c727f32c36998758b) >>
+>>
+endobj
+3928 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [69.87 531.953 212.775 540.724]
+/A << /S /GoTo /D (tls1__3_8h) >>
+>>
+endobj
+3934 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [136.819 483.399 189.023 490.768]
+/A << /S /GoTo /D (tls__octads_8h) >>
+>>
+endobj
+3935 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [136.819 475.429 193.207 482.798]
+/A << /S /GoTo /D (tls__sockets_8h) >>
+>>
+endobj
+3936 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [161.925 459.331 180.654 466.858]
+/A << /S /GoTo /D (tls1__3_8h_ab8ef12fab634c171394422d0ee8baf94) >>
+>>
+endobj
+3937 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.74 451.361 180.654 458.888]
+/A << /S /GoTo /D (tls1__3_8h_abddf8683546c89361c4a6e50bdff0b28) >>
+>>
+endobj
+3938 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [161.925 443.391 189.023 450.917]
+/A << /S /GoTo /D (tls1__3_8h_aa601c4712c56caa0b20a73cc5c7d6cf6) >>
+>>
+endobj
+3939 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [161.925 435.421 189.023 442.947]
+/A << /S /GoTo /D (tls1__3_8h_a474e9fd9b8bfb496452ffc6d022f3cb3) >>
+>>
+endobj
+3940 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [161.925 427.451 189.023 434.977]
+/A << /S /GoTo /D (tls1__3_8h_a72c8bfdadfaf9ba1c9e1a34c6ac78708) >>
+>>
+endobj
+3941 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [166.109 419.481 201.576 427.007]
+/A << /S /GoTo /D (tls1__3_8h_a42d4f54d23f86205a1fa590480181e0f) >>
+>>
+endobj
+3942 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [166.109 411.511 201.576 419.037]
+/A << /S /GoTo /D (tls1__3_8h_a52cadf7f83ff343c727f32c36998758b) >>
+>>
+endobj
+3946 0 obj
+<<
+/D [3944 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+1194 0 obj
+<<
+/D [3944 0 R /XYZ 70.866 771.024 null]
+>>
+endobj
+3816 0 obj
+<<
+/D [3944 0 R /XYZ 164.563 718.641 null]
+>>
+endobj
+1198 0 obj
+<<
+/D [3944 0 R /XYZ 70.866 689.576 null]
+>>
+endobj
+3947 0 obj
+<<
+/D [3944 0 R /XYZ 167.055 613.524 null]
+>>
+endobj
+1202 0 obj
+<<
+/D [3944 0 R /XYZ 70.866 595.242 null]
+>>
+endobj
+3943 0 obj
+<<
+/Font << /F50 2307 0 R /F72 2883 0 R /F43 2258 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+3950 0 obj
+<<
+/Length 1708      
+/Filter /FlateDecode
+>>
+stream
+xÚÍZmwšHþî¯`Ï~ØØT2ïçl>C¢­MR%Ûd»=¢9U°ˆM²¿~@-ÝBR¿0¼ÝçÞ;÷ÞçÎPî œ×NÌÚÑ
+WuÆ°bŽ
¨œ1EÓ‘Ê b•ÏLEõÒøA8™C«ãúó�BV©†…˜åCT�®Ö³ö­ÅE ÀTç*GDLkŸ¿e(î½S€Šu®<,Ÿœ*„
+a$6Qúµ�5°ªŸ†¦êæ«ú1¨‚DA‹á�J—ñºöÎkÊçàà訾<üéÔñÂøÄ_È�;Š�ž§öc<œ�ãñÜý×QãaÇ‹�³À„î܉ÏÌnª8}gîý!ÅÏg�B	0_Ìf~ o‡cw¾t+¢*LihÂâغߊ ­‰;uåÎcèxs×÷ÞJqRì"QåÁ
ÇÒ`{ŠcIÏ*�‘„5°»:#דhš7VÏh]öNãs©70ˆž_©®@”T’÷æÍòW1ãÊÊõ?¥LûÑ�.¦ùÓ M›¸éT
+JÃ'×»_÷¶xÝq¿Ë·RÌØ_L¤È;ykâÌã‰h@‚TÄÖŽm/�g+2¹sr}vfõ;‰˜‰ÿÛ+üK‘¾noœ9*ädÕÜ£�™�”¨ê›SwŸš?t’À²7|jkóü0��áÛ4ü­Q`ßG™beþN£n]B¸Žt¤ëÍCÇNĈ°_wØY¯y¾áªÌr›œ¥µ†–›®À»»b5H3Ó“lÉÜcO&ÒDo<ÍÂÄž8îäkv %Íìá0y"K40_ºÑ":q¼ûpœkmfùŸ¹wÕ<µúíËž)3°_ož%ž¦«:¢q þ�wº’]–iweÓü²29K*eâ‘¥pˆ„	lMøF�çÇ8T%”lº€æÏ7ÛÅ3ë>égFÏê5?Y}£÷—^]Ÿt;-ë½q[o@¾âËO?V�±=›=mÎn`?ÈÉ_ÜMÜA<þêÈçF�?Mb>øîs­ýŒE­nǸ0w²h8#¡Ìªbk!jÎ,ÜÏ@Yt·Èógr7žŽ^ÅšÊèFý,ó·�Ž©ÑS}9X5#+LæšÇÑî)Ümoh'”Ö¶ç2Ì̧™3ßî\ŽóÑW
+ˆ*Ú% 
+J•È®dº¬XT¢ûí&¢Ì2%‰¨AËÀÃœ$x¨�•�G!Jðp
ßc6ý©“2gÖµDÌ)Iaä'iÚƒ¯)éø;åš©3õƒ'5‰o8Û_�¬«‘‚lw²IéNÒõ­¦då<GÐÕoæê¹Q¥ƒŸözDüíf¿mõͦ);%�ñò×aiÀñF¶;@G¥.ëñ2¼
+âYÇ?�wC�÷U£+[o‘À¸¤;�Óê6OŒî®°l÷tú�¬¾ÎDºÖBʼn²˜‡9}{ÒÒ=ߤoWP+Å/Y‹[4ÿúÞxIÆ·z·Wæ¥hmL³sq~|lÞ^uZÍîV<öÊdˆž3psÑó 2QÇEˆX ,G�«n³s±âí¥
+ÛkŠX•–ƒÝê\µE3–�ïëR’†èú³™@€ð`Z"ð‰¨¨1.ObëY\VnÛèv/W¶¶ƒòr@û�ó¨ÙŽ*ûŠ³E#Q¯—ß7Z=ÃÜWJÓà¢i^÷Œ½ÀKÊó÷ÆMŽ÷“býlªCT|œîfÄx…d
+àòÈ�þ¢\‡ûó¼ã
Ål—š»F‡�•Dfñµãc¹ê½ì›ÖÇëæ…yý¡@/-_/þK�Ô_šôRh^•ó²ŒD¨Òc�yWAzê‘ÒI¯˜áÑm¶™-ÓýÏ»h[6ÞžÉí ?鶿-l/kÛí
+hU².Ôi‘×yÅ´K@Q·ƒôêx#}ûBbP%ñŠŠZ�nV̼0Ýšy¶Ö`T1ù"RWA¿˜äÒ¦•Ðoûö¤×9-Јåk¤ýÄ‹ù«/Ö�Å&�/Ë»Yô:ÄKð+/¡¯L¼„UJ¼¢CFTÐ*æ^D?DE¥—ðêøa¡zÕ|X°½)x
.Ö¾?§EV‰(ª‚Œiîq�æs4¥åí÷v.n-£Õ*P�UGÁèl7ú¡Z5L@Q#Ly…¼»x¥Í^_t³7Ë6†^a·—‘jéoýßâä˜÷Å#¥*ÀpŸ“1™Š4FV>t$Teâ°´ñÜñœ þ·8úó®ŽÀÁS<>õë<>Ý×0ú„iMU¡âfŸ©d
+endstream
+endobj
+3949 0 obj
+<<
+/Type /Page
+/Contents 3950 0 R
+/Resources 3948 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3933 0 R
+>>
+endobj
+3951 0 obj
+<<
+/D [3949 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+3948 0 obj
+<<
+/Font << /F50 2307 0 R /F72 2883 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+3954 0 obj
+<<
+/Length 1670      
+/Filter /FlateDecode
+>>
+stream
+xÚ­šms›8ÇßûS0so’ë„JBð’ØئvÜK®×a›$Ì%vÎv®É}ú6ø¡Yg¤I'ìê·+´ÿÝ í^CZ¯u·>wÒ,ÝæÜÐâ;ÍDºÅ¹fÚDçX‹gÚ÷3ŽÎÄ_4C|dP.þ_qµ›=¦çÄ´Î:‹éËS:_OÖÙbžµåÆ­ZX|ix;¢eé¡Úô©õýÒfâ³/šѶ´ŸÅ7Ÿ4Ê�QCœ?jQëk5­4‰ÆuÛ4¬¦•ëhc&B˜³�t–�l‰_˜0m)FÙ½öZÚ÷L:ûm–Þesá	ÄÃ(¹r®“Èë%‘ÛÝ8¸7âÏ?Ýòœ—€Ê0ñëÂFÕpeŒœxº
667ÕÀîuŒ/÷\·M€n©£·½ ï†±{Ä[�
Go>µŽP/?}Ä‚|ÈßÒù,»{ß/áwp™Ô0ñ³¡ˆŸzøÏŸKËÛér�ÝeÓɺòu•ýW�=fOÙzX`|د£‹Ú
¿¹aÒî;Þ(º£òS`Q›T=»¾¥!†~i^>ëÄĺP¨¬RÚô{q�êØ¢Z}u3H[,Ûb|12ÞõLh%×1§û2%¶‡ž;Š÷'“ËÕ³�Oî�yû“‹�Ï.–ž^KÍúé;¡ÛÙèBí#a@F°Ðéaz¹X?”g‹»ò¸~HW•%“eurûòôœÎÊó—çêÚ[y¾–Gï²²o2¯¾Ù»]f3@À,¬d²b¯=Ø™%Šmhšˆ²Èî(òüQTåkL)V£/n»�t=wØ9­N°Ô½÷­YJj©	öØé5¡�£¦…ñý�·õÓ˜¶¦?Žƒqœ„nÛ;M—
Ö”�Ôp9îv¡§‡Æ}Ú¿AŸø¡HXJTfבsÜ£ZjlE5Å8|Q)v’^è�ƒhs‹·©b¸¨×£ÓÂVùA4H®üŽ�TDÙŠò|Q–·½xfØú@‘š=?¤Ëò<zÉÖ)P•Úòaî¸Q"–jÒk_å>OæÅgèèýÐ탼`nð†ÈE5žxùT-Š1ñ� $ð‡7‚ÈçÀŒ ÊnAûØ- ï‹A†R¾uh
&€�¾¾iU¤¥¯Ó‡Éü¾2â~¹xy^
¹ø½&Œa{ã•�€“KÚ¢HÄ,†¸A4
¢%MѳC´¢-Mdïí÷‰XN0®)µ°€ÉÉÃàæÒ
M¾RB
=ÂrRп¹½N2¸®‰èV¦§_”ÝÏ'ë—M5y¼_,³õÃÓªüûn±ÜJÖ�½Þ)ß>Ym²Éº<ûY
5�ÌËÓ³Gè¶Èe·Ý‰œd_{r…(¤×˜«Æ7r¢›ŠðE¬ïã轜ȄDQ"ŽîþÌ[ˆl[)»é·%)‚”²™õšÍ
6–gÚÑ‘¥Ž
u Dyw™
…!1Ô�›sÍA°\WãvvË
I›È‰YÇzqß_Õ.ÚPÕK¸¤Ñ@ªALE^&As
Û]ÈUûôìö¼L/V“åf[p[jæ[¢U,6ŠO‹ÐWCN.ÎÔ…
+À²¬?DVè»[¤
+†qú¬®³éßi•íEµpŸÍ
gäwºãá0é;£Žˆý�ðªxJ„½!¿£�o›†#g˜o+TP`uæéó(åÉ¿ér•-æÐú“Þ±Ç	Ú.°�7lyià9¡Hg4p@ÝA¥;tl$ã ãÄn2òó
ǯc7ŠÝjŸoj¨£ï‘¡@§èÌÝ×u:?aeR.Ù3îí’æú)$•ìÅ�î�à	–lɽ^â{M °ë@å1𣸖ÎÄÇýšm"À�g‹ç“
* ¢L²IÏßNÈŸK6ˆ€ú0"›o‹]çH€›Êä ÝêÉ«p¶Aµ�ègò©X„jx¸)—ƒ›�·
+ÜÀIöñN8¼I„ª:
$ LN‡òÇÝÐéåÏþ{ÍÈ„Ò3““¡Àét¼Q¯±q4ËLN…œ H‚Ð�ý¶?l@
‘ç’zý0zW^C‚0°’¸œm^ëÈ_ˈo‚Ɔö‚8Q‘K��¡‡ü•Á2�.–USµ~{†Z'.—ýªê¯ž>ìn­lŽÇÞ­dL)î#¯Vn^üä:19Í_©¤ŒêŒQqÔ¹²p©—ÎÓåd�·•ù‹ž·ç�½m^ú<7ÐÙëÛ½èÐYºÛ	ÿ°®�
+endstream
+endobj
+3953 0 obj
+<<
+/Type /Page
+/Contents 3954 0 R
+/Resources 3952 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3933 0 R
+>>
+endobj
+3955 0 obj
+<<
+/D [3953 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+3952 0 obj
+<<
+/Font << /F50 2307 0 R /F72 2883 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+3966 0 obj
+<<
+/Length 1602      
+/Filter /FlateDecode
+>>
+stream
+xÚÅš[o›HÇßý)�ö%y0f¸ªOÆ6p“lT�\›\$Çîb§m´Úﾃ¹ÙnêC:®V–!x~s;ÿs
$ÝKHö.ÒÞ»�†$S¶t�Hé�d ÙÔuÉ°°¬+R:—nÏtŸ÷±ažmk…ùáüSú§¤ªDÖ›)oRŠ«=šöþî)ü"’”¦-Ó”M¬J³§Þí'$Íùÿþ”�L,Sú¶½óIR5Þ˜Z4¶�’Þ‡ÚíŸ�%]¶bîöOWdTw!¬[<’µ¢e“)X“rÞÊþ•xØ“nû:Bg̳»Çev¾ýÃŽ"ßsìÔƒòú®T-V=á_}ƒ÷¢%šbDŸÆiÃÒ–%ÄrFv0¤Ìñ¢�¦zœi –É?5ŒZÊ»wek_ÖÙó|UžçÙl•ÏËóÍË—l
`¡¡¥Þ˜º,œ4S‰”WyíN1H÷q=eëõô>ë>Ul�|�)Qß�ñ´HM™Ðø#��@êb£äßÖFâg€hYL?LhÒî“9€4Å‘|f½ÁMC¼ˆbF>ð/Q·«}›HG'¾‰Rn|ô:¥A•3iFjhQ›w.i»�*`ð&¢]Ò6‰Ü�ݪ@Ã#BÀ1M›ËõÈNF5r@
¤*¸˜\CŒÚ±ÃøPífr
Çdj¿æ$Þ*¬¦˜äpÿç&#û’rHãÆ"HéL³ûðœéóšc{¾º+�ë,ÿšååy–ç«ê´_¾=<ΪVÏ‹ÊiÞgË,Ÿnª®OËÃlñ˜-7Õ¥E–o€Ž‹iI¦,õìUæÉÓ’Ûe[Áä�ŠW`} Å4ÄsÙØKÆvêT6Ö‡dÄ“‘IS'Þ_¥dVTÀ¾,"<±;®½¯41¹ŠÃ`È*ùªˆ@m‰E/|	�3+ßÎœ0HÛ¹dÚÓ{’Žx´Ve
l`{þ$®‡m
hCxY‹ÝWξ¯ €g
+óv�n_
‚RK\~èuD�”6#<®@‰)�c³:'AC$Ç� E<Bä‰K8hc‹>´„C‹1yT:ð뚨
D1„ñ…çº4hÃĬ`11Û×éPê¶{ȈbbDÇQzó£¢E‚tÁΰĴô¡µÃFUL�h‡1ÛÖ0
+%¢ÞÇf–1d©âZ´ïb0h¨Ö©R¹­Ê×XÀTñ˜¨	[k$`2Šr·RzÒÝŒ§�
ÃQ°`Ù#L¸ëüÉvÌG!'‰ “Ø>
HQ»§?ïk m1!ò|ŸmŸEvl�iÚ–üðàê‚!ní´÷-”§‘6S#—nkl«J5“@² ˜'IZJYª%8ÇÉ$ŠÂx¯ðR³õãU‚‘ û2¯æ4å
ÈH°rªJazq[ÝÂ.@“¤(ÓÐ	ýB÷wgXÑ�ºô`þ‹ÅIeq¢ïPt†µe0ll;K–Ÿª
+´—¬ñÍdR�
aG‹c·™ŽyZ¿Öh„ûþ8˜ˆ‰„‹¬&š¤,�'Áî35¬
›ŠˆmQ±"Ìõ'‚�ä˜iBN@=@*R=
²ÞÎ|™«ù újµùj³š­õ#½Ís¾\Ë20DGu`˜ÎÆ%Çá‘ʱ5kE€X¼˜&ž%õ¢"Ðn°t*F·µ}fóAGÍV%wß5QrY•÷Ws ¢OT1«ã¨BP;mUF]Ò›N†­jÂ(ï‚vÛÆžMðœãñîqÖ<U€¹U̼®5dí$ %³­Ø¾bÑäÂ÷œv¥0`ÎZ½ñËi+XÕi)¦‰söZ:úƒõ&ž6C4µìà?Û×h~øo]�+^ )ü¤$Äö¼\?Þ/¢ÂWo/ _§‹ýÞÜž½�[{‡í\cmw	ö/íôåq¹éÖ�,Ï;vÃ('çߟÏBå‘:¶g¾zYWþ§Å×ñ±Å×É/,ÂçÕjÑq¦ùâ…ͧ›éÑÉkmDWk¦‹/Ën˨k¿µ#åsZ¶œ>e¯ö§¹ðÚëmš&ó´þ-o·ÕoÝé26tuç­6U“u~ØŽzX=ž—ïÞ}>Çèì¥<wWç�}¹?ï+|U—‡]üÜÁã=
+endstream
+endobj
+3965 0 obj
+<<
+/Type /Page
+/Contents 3966 0 R
+/Resources 3964 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3933 0 R
+/Annots [ 3956 0 R 3957 0 R 3958 0 R 3959 0 R 3960 0 R 3961 0 R 3962 0 R ]
+>>
+endobj
+3956 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [111.713 137.322 147.18 144.848]
+/A << /S /GoTo /D (tls1__3_8h_a42d4f54d23f86205a1fa590480181e0f) >>
+>>
+endobj
+3957 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [149.372 138.288 163.917 144.848]
+/A << /S /GoTo /D (structret_a4e027b19a827d55f0d0e38c50515f752) >>
+>>
+endobj
+3958 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.45 130.318 142.996 135.459]
+/A << /S /GoTo /D (structret_a5f2cd96fef0fd36bdd38cd72f85981f9) >>
+>>
+endobj
+3959 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.344 122.348 117.89 128.336]
+/A << /S /GoTo /D (structret) >>
+>>
+endobj
+3960 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [132.634 89.501 176.47 97.028]
+/A << /S /GoTo /D (structee__status_af739e2a3db47b5289fc682ede5f6ab7b) >>
+>>
+endobj
+3961 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [132.634 81.531 151.364 89.057]
+/A << /S /GoTo /D (structee__status_abddddbbc0d2fe27635c66bbadde390b9) >>
+>>
+endobj
+3962 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [132.634 73.718 180.654 79.668]
+/A << /S /GoTo /D (structee__status_af4d9d88c2dda22baed16d27b7c4b42fb) >>
+>>
+endobj
+3967 0 obj
+<<
+/D [3965 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+3964 0 obj
+<<
+/Font << /F50 2307 0 R /F72 2883 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+4045 0 obj
+<<
+/Length 1306      
+/Filter /FlateDecode
+>>
+stream
+xÚÍZm�â6þίˆÔ/KU²vlçE•*ímÙ—Û·v¡×ké*
+Á@Ô�p‰Ã-ªúßë$°a�,ÃÉéÀIì™Ç3“ÇãÁH›hH»l½ë·N/ÒlÝ1M¢õÇš…tÛ45Ë1tký‘681�öSÿ½Fä#BM9®¸{„¼Ý1,ûäçØÏf<žâ(ïÚêö[ŸZXöD~‘hÛºmPÍŸµOHÉgï5)ѱµÏEÏ™FÑ%²j½Ö¯-´‰Ò24Sw,bo¢4±ŽÖ0"¦Y¨—Rm)Ú`òËïd¢mßz¼liƒA�ã8,‡­Ô•°óAE£ìjÊž3ïÙ'ÞÄ
y4ÓWƒ$€3!­cIœ&«]þwÕ½F6çn*-˜¥@©öÞÛ^kÑåLWzŠf¥I,ç|ÄÇÛS®�Š$óÅk\;Š�r–ÿlªc‘Fãù"Xp˜å,úPü©—l‰/ÿ=¨õêIÿ¶çÞ�}toºl#{ª�ÆBlÔ)2냱ûÂÁl4»¥Nåõ Nû€Î,JƒID˜Ú„ûq2ªv¾À•A$`HÒ,Àp·Q“@„7‘\D‚ADè'˹ˆßYñŠmìWž
Ú欞Z�²àÂ`xÚ¶B¦�áÁþõùM·ïö®ÿìùÐv¢ŒâÈ烙5ʤPÙ<…Xäê¬w4…ƒÕÑgîX˜8†:­÷÷ç]àkíuzéA'K•®Þ„»ñpœ¥¾'â�)…�ç«ÜKÂ¥;ò„„`*…0h¢ìXM®Ta0æ"˜
WMÇn‹̧<q�XÅ�FÓ‰±·ˆ³D‚q'IœÍA�(j4±ˆ“`D@$°Ä"_¦¸€1EÆ~U_)± è­Ä‚"KáÚ•oC9põr{ý³>p9§¨Ñ—jšÛ0(`²(˜z)Œ½(Fûo“ÿ7`ªÆô­ˆÁ¬Ñý	¼’A±Ù$’|	<bßFñ¡mj/Þe똭ƒuÃ(%}_'…êØfZÕ1•âæ¢&=èXL'ØÞ†¨$w/j	;Ö�šÚÅ*“öiœŠÈ›Aè¨×}üÐ}tïÏî |d oj‘§þæyÃh”&x²�&òy"܃ì]1›Aõ[ðHAU˜mö”5êKjnÊ# aL©bÉ• b…5Ä«P§Ê<gš*Ý¢SÃVg�Ç;¨ET²m2Sl‚Ô™¤×š„`¥É°“TìEÖTÎÁ6!
+mâÕaBUšä#Ð$L©Iž›D!»^¿ûíâh…ÿÒ<¡v�Ò²µñ_\ñêN%ü»`å{¦’®Îno~Ï7£Û•ÍM*ù2fã1Àï…Ž(|Sª²Q>QVTFñÑn“yM0~ÛE´Ñœ³v³µƒ,„î–ê‹Oa
+¯%ÐC|¸§”U_íêd šH,)OÓõI�ÃrÍý·­*tVeŽU³ÒuzÚÞ௲œ,C™'âdž‹~®ÿ,ë?ô;pý�Í�Íê⧪YÌ_y´~t òÃÀ›“`>‰ÏSµ_^®ÒOÜ�g<-/ø§Ì˦܈T.ͧôÃj`®z+Q^¹noþó^´ÿByÑêbæ-‡¼lŽx±ÓYI²>0Åý%^F�ÚúwßA(ÆtDð1ç Ö§´LÝ°LšŸ¢ŒêŒQù«›Rd�ý’G<ñ•§²†m�,×'´ÚDûrÒî`é�ׯ®Äø°ÈŽ
+endstream
+endobj
+4044 0 obj
+<<
+/Type /Page
+/Contents 4045 0 R
+/Resources 4043 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3933 0 R
+/Annots [ 3963 0 R 3968 0 R 3969 0 R 3970 0 R 3971 0 R 3972 0 R 3973 0 R 3974 0 R 3975 0 R 3976 0 R 3977 0 R 3978 0 R 3979 0 R 3980 0 R 3981 0 R 3982 0 R 3983 0 R 3984 0 R 3985 0 R 3986 0 R 3987 0 R 3988 0 R 3989 0 R 3990 0 R 3991 0 R 3992 0 R 3993 0 R 3994 0 R 3995 0 R 3996 0 R 3997 0 R 3998 0 R 3999 0 R 4000 0 R 4001 0 R 4002 0 R 4003 0 R 4004 0 R 4005 0 R 4006 0 R 4007 0 R 4008 0 R 4009 0 R 4010 0 R 4011 0 R 4012 0 R 4013 0 R 4014 0 R 4015 0 R 4016 0 R 4017 0 R 4018 0 R 4019 0 R 4020 0 R 4021 0 R 4022 0 R 4023 0 R 4024 0 R 4025 0 R 4026 0 R 4027 0 R 4028 0 R 4029 0 R 4030 0 R 4031 0 R 4032 0 R 4033 0 R 4034 0 R 4035 0 R 4036 0 R 4037 0 R 4038 0 R 4039 0 R 4040 0 R 4041 0 R 4042 0 R ]
+>>
+endobj
+3963 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [132.634 758.991 197.392 766.517]
+/A << /S /GoTo /D (structee__status_abbd2cf161b15371a36fbe760588b2b2b) >>
+>>
+endobj
+3968 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.344 751.178 142.996 757.975]
+/A << /S /GoTo /D (structee__status) >>
+>>
+endobj
+3969 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [132.634 720.106 159.733 726.666]
+/A << /S /GoTo /D (structcrypto_a6da27ddf35821286af88c12267678a37) >>
+>>
+endobj
+3970 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [141.003 711.327 189.023 718.389]
+/A << /S /GoTo /D (tls1__3_8h_adf01762e375d30f644666e9fe3be27c1) >>
+>>
+endobj
+3971 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [111.713 696.196 134.627 702.756]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+3972 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [136.819 696.304 142.996 702.184]
+/A << /S /GoTo /D (structcrypto_a1f0f21608efdefa091958c6abe36bf1b) >>
+>>
+endobj
+3973 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [111.713 688.226 134.627 694.786]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+3974 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [136.819 688.226 147.18 694.214]
+/A << /S /GoTo /D (structcrypto_a3189c7dd2fe6c3cbc1ffd41720977175) >>
+>>
+endobj
+3975 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [111.713 679.29 147.18 686.816]
+/A << /S /GoTo /D (tls1__3_8h_a42d4f54d23f86205a1fa590480181e0f) >>
+>>
+endobj
+3976 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [149.372 680.256 176.47 686.816]
+/A << /S /GoTo /D (structcrypto_aabf86e64107fd26ecb2862fc6bb7ad00) >>
+>>
+endobj
+3977 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.45 672.285 151.364 678.846]
+/A << /S /GoTo /D (structcrypto_a0bc6e38c10da4705f3a21596e66b6ceb) >>
+>>
+endobj
+3978 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.45 663.349 155.549 670.876]
+/A << /S /GoTo /D (structcrypto_a6f2d937a4ddb574df6aebadd72af0102) >>
+>>
+endobj
+3979 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.344 655.379 130.443 662.334]
+/A << /S /GoTo /D (structcrypto) >>
+>>
+endobj
+3980 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [132.634 624.465 155.549 631.025]
+/A << /S /GoTo /D (structticket_a869300f7efe0bba46232714f0613b550) >>
+>>
+endobj
+3981 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [153.556 615.686 235.05 622.748]
+/A << /S /GoTo /D (tls1__3_8h_a73d8ba16d80d060c50c69ea830d953a9) >>
+>>
+endobj
+3982 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [149.372 599.745 201.576 606.808]
+/A << /S /GoTo /D (tls1__3_8h_a42ed9bb2d8c709a8901a509340eb9625) >>
+>>
+endobj
+3983 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [111.713 592.584 134.627 599.145]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+3984 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [136.819 592.584 155.549 598.838]
+/A << /S /GoTo /D (structticket_a0f21883e83fa71ca8bcf0099c44be3fb) >>
+>>
+endobj
+3985 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [111.713 584.614 134.627 591.175]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+3986 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [136.819 584.614 159.733 590.868]
+/A << /S /GoTo /D (structticket_a7c66b0d388e88a0671aa70088e1d4e1f) >>
+>>
+endobj
+3987 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [111.713 576.644 134.627 583.204]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+3988 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [136.819 576.644 151.364 582.898]
+/A << /S /GoTo /D (structticket_af5feccff050166d2869c1f77e0bd9e37) >>
+>>
+endobj
+3989 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [111.713 567.708 147.18 575.234]
+/A << /S /GoTo /D (tls1__3_8h_a42d4f54d23f86205a1fa590480181e0f) >>
+>>
+endobj
+3990 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [149.372 567.708 209.944 575.234]
+/A << /S /GoTo /D (structticket_ab49a7b1bd72975477eaaa8c5cf1fdbb1) >>
+>>
+endobj
+3991 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [111.713 559.738 147.18 567.264]
+/A << /S /GoTo /D (tls1__3_8h_a42d4f54d23f86205a1fa590480181e0f) >>
+>>
+endobj
+3992 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [149.372 559.738 209.944 567.264]
+/A << /S /GoTo /D (structticket_a52c459e527403a39f4a189ac6a380e5e) >>
+>>
+endobj
+3993 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [111.713 551.768 147.18 559.294]
+/A << /S /GoTo /D (tls1__3_8h_a42d4f54d23f86205a1fa590480181e0f) >>
+>>
+endobj
+3994 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [149.372 552.734 172.286 559.294]
+/A << /S /GoTo /D (structticket_a0afa2495687dbd787aa04b82ef8de7cb) >>
+>>
+endobj
+3995 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.45 544.764 163.917 551.324]
+/A << /S /GoTo /D (structticket_a91cbb645c8d90f0a4846e29764772335) >>
+>>
+endobj
+3996 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.45 535.828 180.654 543.354]
+/A << /S /GoTo /D (structticket_a8f26e9c77f54bc5cf1329b4a7fdb276d) >>
+>>
+endobj
+3997 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.45 527.858 193.207 535.384]
+/A << /S /GoTo /D (structticket_a6e3531a00554984c2e3d14aa2997609c) >>
+>>
+endobj
+3998 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.45 519.887 155.549 527.414]
+/A << /S /GoTo /D (structticket_aefff163e6e665c6affa39084c0e298f3) >>
+>>
+endobj
+3999 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.344 512.883 130.443 519.444]
+/A << /S /GoTo /D (structticket) >>
+>>
+endobj
+4000 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.74 480.194 235.05 487.256]
+/A << /S /GoTo /D (tls1__3_8h_aa9207c7fe4e471b0c83cd033dc023a49) >>
+>>
+endobj
+4001 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.45 472.067 151.364 479.593]
+/A << /S /GoTo /D (structunihash_a3187081af2ca6caf003ce75d3c53d30a) >>
+>>
+endobj
+4002 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.344 465.063 134.627 471.623]
+/A << /S /GoTo /D (structunihash) >>
+>>
+endobj
+4003 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.45 433.182 155.549 439.171]
+/A << /S /GoTo /D (struct_t_l_s__session_a785098bf569661d0f5103f5f0f01eb93) >>
+>>
+endobj
+4004 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.45 424.403 172.286 431.772]
+/A << /S /GoTo /D (struct_t_l_s__session_a04ec050580401dd1d386e329e43b4e58) >>
+>>
+endobj
+4005 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [111.713 417.242 138.811 423.802]
+/A << /S /GoTo /D (class_socket) >>
+>>
+endobj
+4006 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 416.276 176.47 423.802]
+/A << /S /GoTo /D (struct_t_l_s__session_a801b2cd7e838f621976301da6c72b0df) >>
+>>
+endobj
+4007 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [170.293 400.493 251.788 407.555]
+/A << /S /GoTo /D (tls1__3_8h_a6ebccf75bb3d8609bc1f41333f2ea07b) >>
+>>
+endobj
+4008 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.45 392.366 180.654 399.892]
+/A << /S /GoTo /D (struct_t_l_s__session_a1f1da4c8ae7fb1055a0e2a2e2f212725) >>
+>>
+endobj
+4009 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.45 384.396 193.207 391.922]
+/A << /S /GoTo /D (struct_t_l_s__session_a1add0b39f1e49f34b3eb4164f3b3b759) >>
+>>
+endobj
+4010 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.45 376.425 197.392 383.38]
+/A << /S /GoTo /D (struct_t_l_s__session_a024f4141e00823f6d0c8367405d25793) >>
+>>
+endobj
+4011 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.45 368.455 197.392 375.982]
+/A << /S /GoTo /D (struct_t_l_s__session_a17bfd7bac99455c6aec56288bb406268) >>
+>>
+endobj
+4012 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [111.713 360.485 138.811 367.44]
+/A << /S /GoTo /D (structcrypto) >>
+>>
+endobj
+4013 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [141.003 360.642 168.101 368.011]
+/A << /S /GoTo /D (struct_t_l_s__session_af0c486630787d7b0519b8613674558d0) >>
+>>
+endobj
+4014 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [111.713 352.515 138.811 359.469]
+/A << /S /GoTo /D (structcrypto) >>
+>>
+endobj
+4015 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [141.003 352.672 168.101 359.469]
+/A << /S /GoTo /D (struct_t_l_s__session_a358daf4ad97c5933268851250fb90083) >>
+>>
+endobj
+4016 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [111.713 345.511 134.627 352.071]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4017 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [136.819 345.511 147.18 351.764]
+/A << /S /GoTo /D (struct_t_l_s__session_a4635560f5d28a4e470e9d9daf00d0721) >>
+>>
+endobj
+4018 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 336.732 197.392 343.794]
+/A << /S /GoTo /D (tls1__3_8h_a42ed9bb2d8c709a8901a509340eb9625) >>
+>>
+endobj
+4019 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [111.713 329.571 134.627 336.131]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4020 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [136.819 329.571 151.364 335.824]
+/A << /S /GoTo /D (struct_t_l_s__session_a64578d777eacea6f53eef13676039ed8) >>
+>>
+endobj
+4021 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [149.372 320.792 201.576 327.854]
+/A << /S /GoTo /D (tls1__3_8h_a42ed9bb2d8c709a8901a509340eb9625) >>
+>>
+endobj
+4022 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [111.713 313.63 134.627 320.191]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4023 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [136.819 313.63 151.364 319.884]
+/A << /S /GoTo /D (struct_t_l_s__session_ae59f0c1cfe873359679fafac2154c447) >>
+>>
+endobj
+4024 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [149.372 304.851 201.576 311.914]
+/A << /S /GoTo /D (tls1__3_8h_a42ed9bb2d8c709a8901a509340eb9625) >>
+>>
+endobj
+4025 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [111.713 297.69 134.627 304.25]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4026 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [136.819 297.69 151.364 303.944]
+/A << /S /GoTo /D (struct_t_l_s__session_ab8376d0fb045c5dc1a3306a4d149f337) >>
+>>
+endobj
+4027 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [149.372 288.911 201.576 295.974]
+/A << /S /GoTo /D (tls1__3_8h_a42ed9bb2d8c709a8901a509340eb9625) >>
+>>
+endobj
+4028 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [111.713 281.75 134.627 288.31]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4029 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [136.819 281.75 151.364 288.003]
+/A << /S /GoTo /D (struct_t_l_s__session_a78c0bddb1e9a270a14a217659b3eaad5) >>
+>>
+endobj
+4030 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [149.372 272.971 201.576 280.033]
+/A << /S /GoTo /D (tls1__3_8h_a42ed9bb2d8c709a8901a509340eb9625) >>
+>>
+endobj
+4031 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [111.713 265.81 134.627 272.37]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4032 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [136.819 265.81 159.733 271.798]
+/A << /S /GoTo /D (struct_t_l_s__session_a12b8b2922dd9e37546592a618c721f41) >>
+>>
+endobj
+4033 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [111.713 257.84 134.627 264.4]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4034 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [136.819 257.84 159.733 264.093]
+/A << /S /GoTo /D (struct_t_l_s__session_aaf5941fece001e3797b6dd399ae51292) >>
+>>
+endobj
+4035 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.74 241.09 235.05 248.153]
+/A << /S /GoTo /D (tls1__3_8h_a98c94c5986465343f350d9851e7fe594) >>
+>>
+endobj
+4036 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.74 233.12 235.05 240.183]
+/A << /S /GoTo /D (tls1__3_8h_a2cd5d60f1aad92bfe845b7a4d3ab2cd9) >>
+>>
+endobj
+4037 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.45 217.023 142.996 223.978]
+/A << /S /GoTo /D (struct_t_l_s__session_a128fa451adfee0d939300fd130cbe185) >>
+>>
+endobj
+4038 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [111.713 210.019 142.996 216.579]
+/A << /S /GoTo /D (structunihash) >>
+>>
+endobj
+4039 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 210.019 176.47 216.579]
+/A << /S /GoTo /D (struct_t_l_s__session_ab0aff1dadec8c32fd7544e5c47d8d050) >>
+>>
+endobj
+4040 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [111.713 202.049 138.811 208.609]
+/A << /S /GoTo /D (structticket) >>
+>>
+endobj
+4041 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [141.003 202.157 147.18 208.037]
+/A << /S /GoTo /D (struct_t_l_s__session_aa94c2e7b78ab19e9098e81c554f90b8a) >>
+>>
+endobj
+4042 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.344 193.27 151.364 200.639]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4046 0 obj
+<<
+/D [4044 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+3030 0 obj
+<<
+/D [4044 0 R /XYZ 70.866 131.199 null]
+>>
+endobj
+4043 0 obj
+<<
+/Font << /F50 2307 0 R /F72 2883 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+4053 0 obj
+<<
+/Length 1062      
+/Filter /FlateDecode
+>>
+stream
+xÚÍWÛnÛ8}÷Wí‹Ô,ï”ë[Ðv³ÛÆ~)’°e&êH^YÆn÷ëw(R–åÊ· úb53çÌðÌ{Oön:½IçíH`/D‘”Ì›<z
+£PJOEIâMÞ½/ºT…~±ÚLçÓ¹†죥]%+mŸîôc@°¯s�Æ:ø:ùàqÎ�P¼Y[̬v†“Îß‹Ø#;—aˆBʽø¹sÿ{x÷ÁÈE¡÷O¹óÙãŒqclå�;Ÿ;ø¡("Dìã�á‚1~	’·#p\ó„=؆¤Öt/Kµ³1KÎXÀ…Ÿ+³ôÛ*IíêûÞY{ŠzØ£ÒÙ#…*²ö^'i¼Ú. 	á¾ZÏ’|ÚûcL(	Z¾²bŒ”ˆ*\ j¿¿�ÅyÀ²MÉwEÔ
ð¨BÕôü@©h|ãÝw…�þë…6„¥Ú½4™ËŸ\
+ïÊmÞ§›qh@|ë¡%³åö¯AïËdûXȧ"lî1DP„éO
+g4v¼A@—‡sÈm·bŠ1D9·¡�¶i\$Yz1ÅáiHó,[�FÓAõLûýwÓៀ§ìù4iƒõ€Ž—³ÜÂ�"«k�Œˆ"Õ™YK…s…´Úó~(쿱%œÅ….Zì2(?!.0»s}Çè› L^éxüñœIŽB¡®±ÙŸ›Íâ©Ó­Œ|b©²P¨"ˆ*“pE섧ŸëYá„å›9–Úü|·°}¥™­7Ûlu
+RiFœ¬—:º”KûÿöEâ”9³ÿsçd£Ó¢ùÆ&�*Õ.¥ˆFì²ówM±†}¨ÖsÅz,]DЫu·çl	0h5êÊ=‚ÎyU¨ã�—×%ˆGÄÕýkëádÂaS7¡
#âñ@3è¹.¦�ÞÄy²6¢z¤å2hðì¥-·&tÊ<š?C³TM7ÒH�›w
åþ¶Xfù‘5b„#ÄÍ	‚¬q7Ü&.-6#qV­L¹O™¢Ž©]G¯¨*Û_RreW²xû¹™Õô5&;À%"ÕÄRÚÞå¡jÛUÏ.§…"…IõÐ|“Ô
'�OË•öŽz˜Ë½ŽØY7y¶];ž’ÿ"|Ý„�È
+²¤¢©nø'�ð6 £—©¦§
+É(Ñ«Å$Í™í0ßÕˆZM/Nn}ÈödžÝÌ`$·RžÓ$•R_òÑ4d´¼\6¦Êa†m®0BP$\(õÕ>J?
+%ÐRï
é ªž@Þ´„Úe0òSÕt¹§ÎMŸ!’mê|Üi9Ÿ´y�ÀѯòZŽ0ç¼ÊŸíµ?iñ	�†ñ½ù«ª—æà@ÜËXó$ü¦3OÛÍNfäš‹guá”0ëI¾wß„˜”.57:Õy
l¾‡�•ˆ¾?™
+$†ø??Þ­[
+endstream
+endobj
+4052 0 obj
+<<
+/Type /Page
+/Contents 4053 0 R
+/Resources 4051 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 4061 0 R
+/Annots [ 4047 0 R 4048 0 R 4049 0 R 4050 0 R ]
+>>
+endobj
+4047 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 652.366 194.465 662.029]
+/A << /S /GoTo /D (tls__bfibe_8h_a90b472dac9b76fbde7ea27f7a0b8cf78) >>
+>>
+endobj
+4048 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 640.337 192.968 650]
+/A << /S /GoTo /D (tls__bfibe_8h_acb237b5ae4bd92b8f6ca90a8b849eb62) >>
+>>
+endobj
+4049 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [114.215 590.213 213.411 599.876]
+/A << /S /GoTo /D (tls__bfibe_8h_af190453673d997151a7237eba4ecccfe) >>
+>>
+endobj
+4050 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [114.215 564.162 213.411 573.826]
+/A << /S /GoTo /D (tls__bfibe_8h_aba94d3909b10b680eb3aaf77d93ca1da) >>
+>>
+endobj
+4054 0 obj
+<<
+/D [4052 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+1206 0 obj
+<<
+/D [4052 0 R /XYZ 70.866 771.024 null]
+>>
+endobj
+4055 0 obj
+<<
+/D [4052 0 R /XYZ 70.866 685.265 null]
+>>
+endobj
+4056 0 obj
+<<
+/D [4052 0 R /XYZ 70.866 623.112 null]
+>>
+endobj
+1210 0 obj
+<<
+/D [4052 0 R /XYZ 70.866 536.142 null]
+>>
+endobj
+1214 0 obj
+<<
+/D [4052 0 R /XYZ 70.866 444.733 null]
+>>
+endobj
+4057 0 obj
+<<
+/D [4052 0 R /XYZ 70.866 414.086 null]
+>>
+endobj
+1218 0 obj
+<<
+/D [4052 0 R /XYZ 70.866 387.759 null]
+>>
+endobj
+4058 0 obj
+<<
+/D [4052 0 R /XYZ 132.025 342.041 null]
+>>
+endobj
+1222 0 obj
+<<
+/D [4052 0 R /XYZ 70.866 313.827 null]
+>>
+endobj
+1226 0 obj
+<<
+/D [4052 0 R /XYZ 70.866 243.486 null]
+>>
+endobj
+4059 0 obj
+<<
+/D [4052 0 R /XYZ 70.866 212.839 null]
+>>
+endobj
+1230 0 obj
+<<
+/D [4052 0 R /XYZ 70.866 186.512 null]
+>>
+endobj
+4051 0 obj
+<<
+/Font << /F50 2307 0 R /F43 2258 0 R /F72 2883 0 R /F26 2949 0 R /F70 2881 0 R /F67 2878 0 R /F79 3175 0 R /F96 4060 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+4067 0 obj
+<<
+/Length 1468      
+/Filter /FlateDecode
+>>
+stream
+xÚÅY]oÛ6}÷¯:`°‡™á7E}hœ¸MÛ­Yâ>iøƒ‰…9RjÉݺ_¿+‘¶,KŽ#ÉÅÒuÏÕ=÷^ÙØ»÷°÷ºs:êœö|¤¥dÞèÎSùRzJS$‰7šy7]É{_Fo=——p_¶:¦×§ÊïžEÓÕƒ	“qDaºµs>ê|í؉=²±èûȧܛ>tn¾`o×Þz`QûÞßÙÎ�†g0_x×�?;Øy‰é4œÏRUø,	ò¹sú²Gyw¼?˜Ä,{„tã̳µÉJ
žÁø„‡•¿ñðÈ6ÂRxŠiD)yÊìfHsáLd!Q¢œzŠ§Û˜
ÉÅY™‚	øÛ,ç�+$˜*b&s—$�AòÝΓȎK35Á·Ýͦéø1^-Ɖ™Ù•¿zÃUø÷½ì<•Þ$`eÞÀ¦´÷­l8î)G>l8÷T#iY¸bt?õÍ«©Ï!
ÑrÜ#¸;gуý<ɸLLü�µ=*S
&¤ÒíèleÃÑIàzèQ8"‚¤“„…
îõõ»ý|6ƒ¬æs3ˆ]ñÎ[kmÿÊÌ€	B[²ÛʆeWj�”:»#èÁh/·

«¹ÍKÔNƒÇ9œš}Ž»‰é1Üý'ÙOh}§Jd¤&DËrm`£¦¾�¸R.fW&Y-â¨X�;§€Ê¼>ñæîî‚KDwåâÜÙñCVÖ;Š¬ïîWÐ9w’�Ì@Ðb	Ƹ{:¼8=¿^Ýž�®zw?]Ž>c�á�X‹
+Ri…Ij{}RI8c“(Zôú²dŒØåÔT&
A`q@Ÿ¤…kôÑ41‰Ñ[ ÔGR³µZüŒ1³›´ÜÚ&Ù(Êëw¿V8Ûg
+)¬¨86è`ô?€ºþ½J4t$?·³æ®�Là‘�¡��Ô=ÄÒ@.7ál!ÛÓ°ƒp½g ÛÄ�Ä çŠW@\*ÜE¶
+õ´SL�|”�N’�u:g鋈x²ÒTˆ/öw‹v6lûçp:j-ŽÑþ9ÅHµ®ƒ½@CÈÊ €¹iý±™.M²'•¢»
ÙåãÌbA¸X&L(Ý’àV6ÁtÎ�C0–ˆHuð„oYMð6fÃ3~Mjm·Ê„€	Êe;R[Ù°¤2_"ÿ8UË4ArSµO”mCÌJV %Vg¦ž(wüÖw°ÄMjBêvü6°QSÃ1æ#Å[I8þ\	G(Ò„ˆm

+2ý†Ài8îô[²ˆo' hv¼Â):w>¥¡YÞ»]•¼Juœ»î(}�ä<)
+_Ð:y2_§PŠ¿0=x$TˆH&R$ˆæ;ÌT±XDpg"¥¼¬œ™÷éC¸)<†w“ÉÊ““PÙ†ÿ,Ùx9–AxߟŒã4ñ31ûóÐN@ÓÚ	¨«þ$Hì‡W—v2\…Ó40ñ
oôó½ù›ØÎ~¿¸z5xÿ´e‚ÛÇŠ�ÜÔ‡—¾ÜŠ�©|%·øSpÎÌݶð?}Í|rûæ­
8Ah@±íä"ù:¯ÿ´át±š9^<Bº¤>
+^ ù‹nˆÊ'r]¦]¶P³iŽ»Š!+-h7~OMÌî›FKó[5Šª^~NqdwR�hú&ƒÖ�ç—lÞ"¤öòÕa`®râà_¨À¥ñ8Ž¡ƒ¸ËiIljÛtŸ½},ÝÅù8´³È­˜¯«ñ¢xçý2Z=naenJ•	¶’£pê@¿ÏWw*¡Ï°F’éÝøèÊ°QÜ N¬§ƒ7ÿxg§/_ÚÑ}­º7q(iU*—¯¯7IêÚɇ³ÓO£sXf>¿¥ú|»J½6‚ÏË”²Úøf›ÅhL…^üИ„—õCÎ …«DNÕ˵3RçWºõoˆQ%yª¸àH#’r-NLh–¹*�l½UžEÙëÇ÷ûTuM¸ûÀÂ�IÙ
+endstream
+endobj
+4066 0 obj
+<<
+/Type /Page
+/Contents 4067 0 R
+/Resources 4065 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 4061 0 R
+/Annots [ 4063 0 R ]
+>>
+endobj
+4063 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [69.87 237.058 212.775 245.829]
+/A << /S /GoTo /D (tls__bfibe_8h) >>
+>>
+endobj
+4068 0 obj
+<<
+/D [4066 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+4069 0 obj
+<<
+/D [4066 0 R /XYZ 70.866 771.024 null]
+>>
+endobj
+4062 0 obj
+<<
+/D [4066 0 R /XYZ 70.866 606.402 null]
+>>
+endobj
+1234 0 obj
+<<
+/D [4066 0 R /XYZ 70.866 579.207 null]
+>>
+endobj
+4070 0 obj
+<<
+/D [4066 0 R /XYZ 70.866 448.003 null]
+>>
+endobj
+4071 0 obj
+<<
+/D [4066 0 R /XYZ 70.866 310.648 null]
+>>
+endobj
+1238 0 obj
+<<
+/D [4066 0 R /XYZ 70.866 304.118 null]
+>>
+endobj
+4065 0 obj
+<<
+/Font << /F50 2307 0 R /F67 2878 0 R /F70 2881 0 R /F43 2258 0 R /F72 2883 0 R /F79 3175 0 R /F96 4060 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+4085 0 obj
+<<
+/Length 1365      
+/Filter /FlateDecode
+>>
+stream
+xÚÍX[OÛH~ϯ°Ú{Õs�ö©„ËR´Ù•*¨¢Ô`5ĬcØößñ¥$ ®ö%±Ççú�«�£ëG‡£Ýéhç@à(EZJM¯"…Q*e¤4E’DÓËè<–H$cªÒ¸Z¬f™)áÇÕ,KŽoæùÝøÇùÂø«SsešÒ,3“|ž~ˆ8gH(J½HaOGûÓÑß#‡8"�šÓ¥”GÙíèü3Ž.áÙ‡#¦ÓèGyq
¸¶ˆÎFŒpÛE#‰´biÛI®ÝÁSåŒÂÑX
isœ:«0NQ	RÃåéá(:KŒãÇI5¢:Di�ú‹;O“:jíî'Žï®Ìoó*0+G()R’Hàˆ¤¢-aÇÛ\Ì‘Äißt=è«=80¢à"ðë<ë5~)ŠEG§�åq
åî
¸7›LÞÏö?NN?�L»¦žÇXà­ˆ³›yÙ•B8ETª5PñØ{2•{Ê’BoÂvÊh‹�”BnmÀwvv¼)_'¢“)àB~uÇ4 ¸îÇ­Î&q¹úoâ¹·¿6ž�Ç„KÄñ.#€:^—§˜&Ó0AHÚØ2Ž ÞÅ–§ƒ¥ÂuSüËGd;'
\oÍò2¿êbÔ—êóßõXB‘&DضT\ ÌÛ
–õ+:ìÎ
$_ÓÆAc€YÐpR™Y­<ïÄ*à  ¿€Æ‘Í« sâTyaÐE5£2£)÷ÂÞæËlqi|c{6“C7ojX	AZÈu´³oë>µXK½š/6'ιYV³Òd›3-ŠëkSn¡Ä”Õ*�ûÀb¤„®‘ИöÜ÷ˬʋ媓$½P‰TªÄAí¥¢W|c!dœ/«p<P”0èŸ&K y¾žÙ 3?$T@š<Æܹ/Úr6½z@v¥8¿ìy
ÉÑäa)’\Ô2‹
¤%G:%5Ídÿ4
§“ßÞ}|—û}ÿïIW0ÚD8­inŠUµœßš„ˆØʦ<¯¤cV}¿ëQÎ罧Ém|?ùs÷xÿSBÀŠwOGôYÝ’ÁÒ¡¶Q~vth»do(Ô•]±´Mì
+ºˆ–»]‡#EBc›ÔY¶ACñ—W6ÒEéoú±�£ùòÒ_Kø­*mw›g•?¼»ÿbÕ-òÌßµwÆþ|:£§êËÕv2ÃÎEùk
+T_›jâºÌ	8öç®Àæ	‰+sœðG³à|z¦ì@ÞkË.µ{µÞ*õN�þjrÏá+.¶«`Ø 2`õVäÅ}aãD¥ðÆÂH/QMpÌÇ,dS'ru²¶sª›’ëÒ;k¥wYÜú+tg•%^ÀºªÐЬ€ÒBv�‡¿4å�›"aØ3Õæ}0bϬ²2¿³ÓdxÜÃ+Iªõ‹Æ}ƒ­Ý¯ýi†¶ÒÕ¡`#ê}By|_Ýåšðt„tË1Œ_ÏäΚ³¬¨ªA˜k&`ªgl€©Èîo!Òó¨Îë-8!Rº%çp¿nµç'Ü?„ÙIë"¶['¥Û“쾇É@\UÙµÁe+ÐË
+½À=yªúá�•+Ñ]G†Ê
œiL 0…5û±ÚˆòŽÈVµÕøG�Æ°x+¬»;]3£»ªì·hVý=¬¶eªºÞ‡æÜ“I4ìåi-Ông®y­k\}E�ýgÃìþ¦Fu`ÿyFÁ"0€}Ð&×»S•@-3B»{ëÿ{1úÜ$à=Œ‘m¾6ÕßÌ$¢öNó•	^餔õàYšü
ÆiÍ•½ÂyòýÚõ³ì›ø/A-¢�
+endstream
+endobj
+4084 0 obj
+<<
+/Type /Page
+/Contents 4085 0 R
+/Resources 4083 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 4061 0 R
+/Annots [ 4064 0 R 4072 0 R 4073 0 R 4074 0 R 4075 0 R 4076 0 R 4077 0 R 4078 0 R 4079 0 R 4080 0 R 4081 0 R 4082 0 R ]
+>>
+endobj
+4064 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [115.897 735.237 189.023 742.3]
+/A << /S /GoTo /D (tls__bfibe_8h_af190453673d997151a7237eba4ecccfe) >>
+>>
+endobj
+4072 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [115.897 719.297 189.023 726.36]
+/A << /S /GoTo /D (tls__bfibe_8h_aba94d3909b10b680eb3aaf77d93ca1da) >>
+>>
+endobj
+4073 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.156 460.084 198.555 468.855]
+/A << /S /GoTo /D (tls__cert__chain_8h_abc0e5fc4c7a025e94eeb2aaa54c5f370) >>
+>>
+endobj
+4074 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [201.459 460.165 225.383 468.649]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4075 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [407.807 460.165 431.731 468.649]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4076 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [476.155 460.165 500.079 468.649]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4077 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.737 430.831 242.326 441.414]
+/A << /S /GoTo /D (tls__cert__chain_8h_aa840f940fbe383f05413a414a5086cea) >>
+>>
+endobj
+4078 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [245.812 432.723 269.736 441.207]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4079 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [371.864 432.723 395.787 441.207]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4080 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 153.366 157.248 160.579]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4081 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 117.5 157.248 124.713]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4082 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 105.545 157.248 112.758]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4086 0 obj
+<<
+/D [4084 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+3031 0 obj
+<<
+/D [4084 0 R /XYZ 70.866 697.192 null]
+>>
+endobj
+1242 0 obj
+<<
+/D [4084 0 R /XYZ 70.866 680.993 null]
+>>
+endobj
+4087 0 obj
+<<
+/D [4084 0 R /XYZ 70.866 498.076 null]
+>>
+endobj
+1246 0 obj
+<<
+/D [4084 0 R /XYZ 70.866 402.381 null]
+>>
+endobj
+1250 0 obj
+<<
+/D [4084 0 R /XYZ 70.866 288.803 null]
+>>
+endobj
+4088 0 obj
+<<
+/D [4084 0 R /XYZ 70.866 246.186 null]
+>>
+endobj
+1254 0 obj
+<<
+/D [4084 0 R /XYZ 70.866 219.204 null]
+>>
+endobj
+4083 0 obj
+<<
+/Font << /F50 2307 0 R /F72 2883 0 R /F43 2258 0 R /F26 2949 0 R /F70 2881 0 R /F67 2878 0 R /F79 3175 0 R /F96 4060 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+4108 0 obj
+<<
+/Length 1772      
+/Filter /FlateDecode
+>>
+stream
+xÚÍZÛrÛ6}×WpÚ©!¸ƒœ>%Šã8î´®­v¦ãd4
+EɜȔ+Òqü÷]àM¤.åiü`Á´{{°8;;ç½·ãÞë÷;.ò¤dÎxî(Œ\)åQ$‰3ž9·})ŸÇo1.áséÓ÷á2©rûïVþã}%Ó$\EzjïlÜû·G`&vHnÑu‘K¹ãß÷n?cgï}tÀ¢ç:OéÌ{‡†g0^:7½?{آĈ
+=Ô/³T
˜%A.· ¯”÷§ëé}�ë
!ý8E–™lDî¼î@ÈATÒá‰m„¥pó&b—
˜ÍÄšH—DUÒ¨åÔQœ!Å”Y’ÑÙõ€áþxôáÍÅïõ<&?Ú;¤­ðN8A’ªªûäÎò%Œ3ô!7CŽûIø	cêO;Å¿›†
Tb.AõŽÀXO:’ŽÉîdÃ&›rÄåi’M=D\»Úw«8‰€ýÛó|œãæ<—=7åùFç¸÷m@E_�õÃ^:šÆñÊ!û3ó÷S˜Ü™Qnlt$SZGYÏ2˜ ]ËB'–)ØCÞn¶Ì˜&™kò•ïÁIòü°ƒ/ǹoæKÙžâmÅ …•Ž>a�§»'¯,¹ì4(ýÆ÷ŸÌƒ¯zè_Ï`�ì`NëxëYªk�édÃ0Gzbß¡t0s0Fص™»úëíåÙ?[s¤ÛfÆ”ýæŒÙ(+Ÿ0S±yçáñ‹Îñ2ôki7}~O?ü¼òÌ׫ûÓTžöÑ×r¯MP:]øÓ͆å�‹‘ÂîÞP¨ðöñGº‰lçß\œo'Ïq>ÉSq‡‹hš<®K%%~|xX†¦–BOšºœÑÿ?Lý`wÁh�¸ž,0!°×-áím´ÔÙ’QD±0ËyÀZFUq�½n¤ƒR‰‹0·ŸÆV)Ì‘ƒfªÍΗ¯ìF^ÆvÖZC�¡èGvR, )1ÕÁîo½í§á2Ïÿ:˜Æ¦kÙh„†®âÐTpÛ	!� v Ƹ¿Ð¯ý 
w¢äj­�ñ$¸í~=§î¢YZCàÍd¤#ќ˸Ûª*ò&Ú+v†ºa†(©}•ÝhÁ³1k,šIÚ®M„&Äza™q}Þs 7âJÀêY…]ý•ŸLg•Ì
¯„†ºHz,ëø 'Ì@ödi’–âyWxu}ñ7œ	¯B2ûód`Ý$
9IÝÌ&°Âh“W[‚Ûtd?~D¬ô€XU6ú©¢—ÚÀÀ4»…±,וý0$0cTãzv:÷<°’Ù¤Ûžf¦
+&绢v¦
#9²6:ôÜgµÓekâ"³T•‚°Q
€ª”!LåÑ
7'°�ÔNqN…@’¸ÛË]7æ|ã .<z’ŒcðÅUe3l=ãŽôÛxÆUÚ%%QYíeRý|£Q÷´õd�	Ee·„w²aÎ\‰˜:I™&=Õª•:Ò}cÞ+þ´VÊ2§}¼µ¬kDucN7–9ŠB
+ÈžPXz$îcŽ9Á[ÝÍé½™8e÷ÛFÛº,å­‘ÖÓ&ÔnûSÞÞFK1Ì(¨NO!†‹Í¹šZ­Aˆö­>�ªûöúæM®k	¤ƒQ¶(m‹¶ÒŠÚdOüL­N|½çu¦ÑÝVíU	KëW«]ÏW¶æ¬6êYåû‚JÀÉ]¦ï�)I‘BµA	:K÷s©?-ºl7
?iª?v­ž)r€jm|›ªçׯ�ŠÿvC3ã›`ýM/†k±ÎC³Ò…ò­fAf�׌à‚�0(W‘ã+ž0çÑ,˜çX'Z†NÒº1ù°!­��§0
+ŽrFÛGùËÇ™õöÓ¶NæVs”LXFɃä涡e/‰vò:òSà%`þ¢€ãéò´ë+^®Ÿ[“uà;-lù¢°—«Å"XŸ±zÙ…†"Ÿ°Û\½HZ¨
”tX ŒÃha`ëï’Ò;ºª33/Nf¿6:¡¸ñ1Ãû}ß¡Í�ª'½‰œŠò‚TŸ·%™P_ñt¢ø_Í9T\÷TƒÜyñÓtõáÔ6
ù�(µ5å—t)à±Ë�Òãü’Ã^¾£Ö‡ëªO©¥ßâS”}fß]¶t¹¹¤Ùî»>Ú²DT‡¬‘ù¤�ù!ÓºäÐCÄÛmÿæâ\7X†ÃCê!�mÇ
kÖ=Ìû�˜¼ï³+©)hL™Œ5/hý’ò£QˆH²l¾
KȹSI6o®f¼½ê¢Y8oìbš®ñð¯Í?ödÿv½¢.	ú¾Tp$‡×40{ë⟾”n:ß­Ò¯ïží|´yÕø3íAá
+endstream
+endobj
+4107 0 obj
+<<
+/Type /Page
+/Contents 4108 0 R
+/Resources 4106 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 4061 0 R
+/Annots [ 4090 0 R 4091 0 R 4092 0 R 4093 0 R 4094 0 R 4095 0 R 4096 0 R 4097 0 R 4098 0 R 4099 0 R 4100 0 R 4101 0 R 4102 0 R 4103 0 R 4104 0 R 4105 0 R ]
+>>
+endobj
+4090 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 494.387 157.248 501.6]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4091 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 470.476 157.248 477.689]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4092 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [69.87 229.088 212.775 237.859]
+/A << /S /GoTo /D (tls__cert__chain_8h) >>
+>>
+endobj
+4093 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [136.819 180.534 172.286 187.904]
+/A << /S /GoTo /D (tls1__3_8h) >>
+>>
+endobj
+4094 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [136.819 172.564 180.654 179.934]
+/A << /S /GoTo /D (tls__x509_8h) >>
+>>
+endobj
+4095 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [136.819 164.594 176.47 171.963]
+/A << /S /GoTo /D (tls__sal_8h) >>
+>>
+endobj
+4096 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [136.819 156.624 209.944 163.993]
+/A << /S /GoTo /D (tls__client__recv_8h) >>
+>>
+endobj
+4097 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [136.819 148.497 189.023 156.023]
+/A << /S /GoTo /D (tls__logger_8h) >>
+>>
+endobj
+4098 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [136.819 140.684 184.839 148.053]
+/A << /S /GoTo /D (tls__certs_8h) >>
+>>
+endobj
+4099 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [141.003 109.612 226.682 116.173]
+/A << /S /GoTo /D (tls__cert__chain_8h_abc0e5fc4c7a025e94eeb2aaa54c5f370) >>
+>>
+endobj
+4100 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [228.873 109.612 251.788 116.173]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4101 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [421.352 109.612 444.266 116.173]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4102 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [479.932 109.612 502.846 116.173]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4103 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [141.003 84.736 272.709 92.262]
+/A << /S /GoTo /D (tls__cert__chain_8h_aa840f940fbe383f05413a414a5086cea) >>
+>>
+endobj
+4104 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [274.901 85.702 297.815 92.262]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4105 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [396.246 85.702 419.16 92.262]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4109 0 obj
+<<
+/D [4107 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+4110 0 obj
+<<
+/D [4107 0 R /XYZ 70.866 771.024 null]
+>>
+endobj
+4089 0 obj
+<<
+/D [4107 0 R /XYZ 70.866 591.332 null]
+>>
+endobj
+1258 0 obj
+<<
+/D [4107 0 R /XYZ 70.866 564.137 null]
+>>
+endobj
+4111 0 obj
+<<
+/D [4107 0 R /XYZ 70.866 432.933 null]
+>>
+endobj
+4112 0 obj
+<<
+/D [4107 0 R /XYZ 70.866 298.78 null]
+>>
+endobj
+1262 0 obj
+<<
+/D [4107 0 R /XYZ 70.866 291.573 null]
+>>
+endobj
+3032 0 obj
+<<
+/D [4107 0 R /XYZ 70.866 70.643 null]
+>>
+endobj
+4106 0 obj
+<<
+/Font << /F50 2307 0 R /F67 2878 0 R /F70 2881 0 R /F43 2258 0 R /F72 2883 0 R /F79 3175 0 R /F96 4060 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+4119 0 obj
+<<
+/Length 988       
+/Filter /FlateDecode
+>>
+stream
+xÚÍWMsÓH½ûWLÁE:x2=ŸÒa|™*
+(6ñî%¡(E™Ø*lä1�¿=ÒH²%l€Ýâdy4Óݯ_Ïë#+ÂÈËÙÓåìd¡Ihªµ ËkbM´&&åTY^‘óHSϹI"·ÙÈm…Xäötݬ.Š�mžNíu,²•-s¿_¾"R
+ªŒ@_�%ãWg/–³Ï3ÀEF s˜$4á’äÛÙù{F®ðÝ+¨HòµÞ¹%R¡1é�mÈÙìÏ�NSuŒBeÀ{8Ž“ºísÄÈ\(ª™n?ó¦$š*.ãyæ‚™'±`ÑÁ­wøTT¸›f½Úí\ó”ßqrïv•�ñm¼NRôÎuðÎ%æªqþ¸(óÍá
+jDö¡ÁA×�šƒ>+Œ•¶'•¤Œ¥ÍÑÅ¡Ì]±+÷5)m6GX
Ó–˜�ËÎÕà9Ÿ+¥£¢taÙóZ­Á§õkeÝY±:µŸEe·1D¶tû±%¿ñ‚)¬�,u ¡Fʶ 0mb‚ IS6ìÙ×.÷h¾zÀÆ_¦SãÏb‰•BàšAWµ‘—6PölS`ÔáùúòuV”�ë¶FÚ:äe.RÊ2—œ2þkeU‘]úRÜØ_ERŽ|».Ìj"Å
+hÚ_Ù6쎂0TšŽ˜­{ó)Tþ—˜«È§g‚ë?ÞþõúõðÅ\¥TJÄão´ú�uv²’F�ÃoxžuA�khT…FS.d(Cщ&… ›Ï­ËP#¯š˜ŸÛ}^Ÿ¼€Ü!‘@¥þ‰ì© \ùGÿã!j3
+Êcú÷$æ28ŸÖ…
"ÎQ�YT
+P½)>ÆØBBDgùιÉëŽ_oŸWòÚêpÈë.?x¹ÈúÌ4‚0X Žu­üo4�Y¯<^O[ý«»‰ÁÂbpLTˆË«nÝIV·Œ4ëÞTÝÚ±µJ£0!LKs§Ù&=r
)žÜ–lÌN¿	ÌH²'Â	2«{[-¦
UxýMŒ‚ÿ�„·Ð¸ Œ‡´¼ó…–UÙÖ:t
/âÔ8F!æ{Ç!08¢uÃÐ/µà§&…]¨Â:»Çî–˜�4˜¨'13'±:%GSšŠöÚ±;ÄŽÃMØ;¶Dõ0ð¼)ZÅÝ])Veæ•�àúV|§YŽD?<¾Ûì 	
úgø}¨…i‰¬37(ÞÖ>`Ch¾§s4ÿ½N–~„9l/ë‘û8ù‡|}GÞï»JQ&à!_
+í68£åH‰c¼Ö­>”¶B
ýíÒKûM«É¾O}»	òZŽCü„$_
+endstream
+endobj
+4118 0 obj
+<<
+/Type /Page
+/Contents 4119 0 R
+/Resources 4117 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 4061 0 R
+/Annots [ 4113 0 R 4114 0 R 4115 0 R 4116 0 R ]
+>>
+endobj
+4113 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.737 618.814 189.955 629.397]
+/A << /S /GoTo /D (tls__certs_8h_ad9d8b74186c6a2ac0fd7a16fd36d1481) >>
+>>
+endobj
+4114 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.104 537.104 186.732 547.373]
+/A << /S /GoTo /D (tls__certs_8h_ab893fde7f330deb4d550d1a63997f55a) >>
+>>
+endobj
+4115 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.104 524.153 175.219 534.116]
+/A << /S /GoTo /D (tls__certs_8h_a05314a602c0ce93a32732d5ea754de92) >>
+>>
+endobj
+4116 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.104 512.986 177.353 521.165]
+/A << /S /GoTo /D (tls__certs_8h_adf42bd5d56522c904033fb0717be6ee1) >>
+>>
+endobj
+4120 0 obj
+<<
+/D [4118 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+1266 0 obj
+<<
+/D [4118 0 R /XYZ 70.866 771.024 null]
+>>
+endobj
+4121 0 obj
+<<
+/D [4118 0 R /XYZ 70.866 660.574 null]
+>>
+endobj
+4122 0 obj
+<<
+/D [4118 0 R /XYZ 70.866 578.756 null]
+>>
+endobj
+1270 0 obj
+<<
+/D [4118 0 R /XYZ 70.866 498.742 null]
+>>
+endobj
+1274 0 obj
+<<
+/D [4118 0 R /XYZ 70.866 374.649 null]
+>>
+endobj
+4123 0 obj
+<<
+/D [4118 0 R /XYZ 70.866 328.12 null]
+>>
+endobj
+1278 0 obj
+<<
+/D [4118 0 R /XYZ 70.866 300.925 null]
+>>
+endobj
+4124 0 obj
+<<
+/D [4118 0 R /XYZ 70.866 193.632 null]
+>>
+endobj
+4117 0 obj
+<<
+/Font << /F50 2307 0 R /F43 2258 0 R /F72 2883 0 R /F26 2949 0 R /F70 2881 0 R /F67 2878 0 R /F79 3175 0 R /F96 4060 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+4143 0 obj
+<<
+/Length 1467      
+/Filter /FlateDecode
+>>
+stream
+xÚåXksâ6ýίð¤_ I¶ühg?؈SL6à¦	Ù†5‚˜€MŒ	�_ßëC6a§;Í´™á!Ý{ÏÑãC
õ‚aÎj*ÒdYì� `¤Ê² hÉD°ûÂ}QVK_íKA„ŸDI†qqkÍóR™*jñÜwæî…½Ðõ½¨k¡jž
+zb�¬#ª*R©$8“ÂýW,ôá·K
"jª°ˆ{N‰‰ˆI"|íÂu
çª$)L“·Ë”	Âë:‘‚ÄR™`Œ‹7%{�ÛûV"¸øj¥9ðX(ËIÛ
+ˆHrRqq5
Üç…Ø!O(TP�¦`’ 0FN8¾7KeF;½  m
`@33N¿`,ˆª!LÖ¼Oâ¢ôqÜOÍ?�¨BY)ÞóeÈïkˆÜ +Q2Ñ < \L	«Œ] #¡f@VŒÀ±\ÜúAåÑÛê0]"CXÝf‹î°åp£Ã‹+( <ÈÎ�]v’±¦ç†noœð�LùxÎ[§”!¥¨¦@¢ü)©Ÿ¾`†ã]±TXá”Á�÷`(ä›ZõB=Å»^ðÕ…r¢4‰úk¼%DT&lZ!I&ñâÐQžíÿ£$eQD’Â’J“Á'åèϨÖÍfB{¥Ú²ÍšYÑíjüSl ¢ "“Œ_ï,ºîp²ƒëí2	t°r·ë´LÓøã¥bàž~®«x–î×+•§zÛ’4C·*–�—õ½c›7ð¿]éKkdáæÈÄ×#sa�î­ó~í&‘RD4úó0‰TFT‘v0µl�×x•.-{/}a�½¨­9Úm{ÛGÁ”qܲ�ŽeXuc•ÌÌ×z®ôEõBǦnœ_ÕFgmOOaNgvöív:Øs}9´^Œ�‚©)6Ú’º¼h?Mãïùêù¯§ÕCU}>íÜJ—/c_éh�úU�‰J•�û¯�îÜ‘>Òõüý(˜tü¨[Õ»Šy]Ñ®ÈXew·äT{îàð¬}q-¾Ô.Wnõ6:§;´¸óAoœµùcÔÅ
+¾\˜&¾¹aÓ´ÝÒZ-o¾ðU‚'*ù,µ™|69t†a	tDý‰gV‘¬íµÕæùûZˆ¡ü8‰yõ'„"5¢ì5ù�…Z¡vAW©³v7oê}f¸œÞZëgÿ„ØK
+¸ErŒØÇ@ò·½“‘**»dØ©åiù~ÊIeŸ“¸}úÁ†`V#„¥ %Š¨˜ñ£¦Ü„ãYwÃzÈ$Ìq²€àKkoÒ"¶	"0W÷“ìaö™Üß1µq“?Èú¸³ä[„\08<”[(ß±2P;ŽýEÖ¾iVS‡Ã2K³68;-±¿‰§ùwàõù ™s»ÑîVôn´ÚÝ‹]ë³—J;:äq=~|*‚‚%äx°ž3ž÷ÓN^™oˆ+ƒtÅlE¼+Añä
ô0qm!fvpE_7e'[fï´{µ²‹wº¿Óòîìü
Ø-H‚ý_²å|±·1Ã$ÿd´ô¾ø{ÌH9;øsÄHÿbâÇ £XaÿyV2½x-›ó�Òãå ®æIÝ;9âŽC¶Ýa‹?ÍÝ€G°æøgÑ|r�È Û o>ŒÎâRfÑ3iÆ¡BcJniQñà
E¥£OYîõÝANξ¯ÈÚ¶"GÏô±êÜy.©¸q¬–›»­H�)
¸çð^"'ÒŸßá³TsMo:O­$àÉÕ
+ï'-ƒÀŸä„¼Y“~A‰áD¬c�Ö %•3+µe\rZ!›õÆèá$c™¤1öZçX~ÞÙ·;ó�G9˜Ý
ò«ù
+ˆî��÷çp’)™Á䦃ֳ{èZ‘�!*Ž¸UÌn£‡YŠ½&“`�Jð‰d9³[Üã
hI:]ß’;°ô1ºÛZ®†Ñb*r/_ãßP½
á
+endstream
+endobj
+4142 0 obj
+<<
+/Type /Page
+/Contents 4143 0 R
+/Resources 4141 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 4061 0 R
+/Annots [ 4128 0 R 4129 0 R 4130 0 R 4131 0 R 4132 0 R 4133 0 R ]
+>>
+endobj
+4128 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [69.87 318.781 212.775 327.552]
+/A << /S /GoTo /D (tls__certs_8h) >>
+>>
+endobj
+4129 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [136.819 278.197 172.286 285.566]
+/A << /S /GoTo /D (tls1__3_8h) >>
+>>
+endobj
+4130 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [174.478 262.1 214.129 269.626]
+/A << /S /GoTo /D (tls__certs_8h_ab893fde7f330deb4d550d1a63997f55a) >>
+>>
+endobj
+4131 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [174.478 254.129 201.576 261.084]
+/A << /S /GoTo /D (tls__certs_8h_a05314a602c0ce93a32732d5ea754de92) >>
+>>
+endobj
+4132 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [174.478 247.125 205.76 253.114]
+/A << /S /GoTo /D (tls__certs_8h_adf42bd5d56522c904033fb0717be6ee1) >>
+>>
+endobj
+4133 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [141.003 238.189 218.313 245.715]
+/A << /S /GoTo /D (tls__certs_8h_ad9d8b74186c6a2ac0fd7a16fd36d1481) >>
+>>
+endobj
+4144 0 obj
+<<
+/D [4142 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+1282 0 obj
+<<
+/D [4142 0 R /XYZ 70.866 771.024 null]
+>>
+endobj
+4125 0 obj
+<<
+/D [4142 0 R /XYZ 70.866 745.651 null]
+>>
+endobj
+1286 0 obj
+<<
+/D [4142 0 R /XYZ 70.866 718.947 null]
+>>
+endobj
+4126 0 obj
+<<
+/D [4142 0 R /XYZ 141.672 662.876 null]
+>>
+endobj
+1290 0 obj
+<<
+/D [4142 0 R /XYZ 70.866 634.284 null]
+>>
+endobj
+4127 0 obj
+<<
+/D [4142 0 R /XYZ 137.494 488.038 null]
+>>
+endobj
+1294 0 obj
+<<
+/D [4142 0 R /XYZ 70.866 461.15 null]
+>>
+endobj
+4145 0 obj
+<<
+/D [4142 0 R /XYZ 178.362 393.307 null]
+>>
+endobj
+1298 0 obj
+<<
+/D [4142 0 R /XYZ 70.866 377.201 null]
+>>
+endobj
+3033 0 obj
+<<
+/D [4142 0 R /XYZ 70.866 224.096 null]
+>>
+endobj
+1302 0 obj
+<<
+/D [4142 0 R /XYZ 70.866 208.174 null]
+>>
+endobj
+4141 0 obj
+<<
+/Font << /F50 2307 0 R /F72 2883 0 R /F79 3175 0 R /F43 2258 0 R /F25 2885 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+4206 0 obj
+<<
+/Length 1751      
+/Filter /FlateDecode
+>>
+stream
+xÚåZ[s›8~÷¯à©ƒgUHÀc›ÆiÚM7›d»»Óv2+6S\�›ößïHŽ
Û1¾ÅÝ}2IœË§s¾s¶¶N;¯®;/z[>
+8w¬ë[ËÃÈçÜòŠ8±®ûÖG›£ {D=ß–£ü&êRl�b‘È›LDß»>¶Ñ°|Ü‹G¢¼º·]‚m‘‰$ÝÏ×o-×uóxi¹d îvN®;ß:nb‹Lßìûȧ®Ýu>~ÆVž½µ0rߺ/FÞY.ƒÅ\µØȺêüÑÁ5mFø¬:œ lôéM’HÆi’2˜É/z°âƒGžïYGÔE Q9ñ¥¬2§<h
.O;ÖÇ#Ƹ�	ùø@e©q˜å"�dدŒ×O?a†õýæ|;í»1óE�r+5h¡À�ã¸ÆìŸ0vÔèš®.
+|bÆœ</}'²¼‰äùB!ŠécRp0"øãq)¨s^—âÙXf`R3«y�§0Œyà©•Žˆë!Gý ß×N¿èºØVÆ.—K'zÝ0éÎèP\Þfé�~XþŒSCdS‰Ò9SÑ20Q
+PQ�hÇhú¢vèO)òEˆŠ†aVÚ¿
+ŒH+‰.aö.І{EF
\¯„c]
�,S�.ì:pó?�ž³D®‰"	±h¹W}9	`•Ht>[8šó"	´Š“$�‰èOß+Æ—»öt°‡¬ækºÛ{ÜÝË}M0C½Å~Ò´C¶H˜‡<nO¹â¥�…f'‹±2)O2
©x8a ä•’à÷.h)²K)f’­Áh®»ºÉEž9[
+/HïܱzÕÕ]éåôx5V\
+ãí`ÀiÖp”ê`R3L—a“.C3§Èƒ;að–ÞVLF#íö,•i”êw N8+9ø ²Gš]L@0�{gîw8"¾»†ûçĘÕA .ñèÓf£€FI"T	 °PMS�1 &Nf¥Ê[`
+˜û&þD…¦{€‘ë#â²µ`´Y^b
òq«ÿ®p¶z¡ä$ØoMÔ@ëR¨z»€j°§ZKÁuV½íe<—oòÔ|Œ!‡´"åéæHÄÈuùŠHÜeÑuðÜW$©P
+TöïÝES Û¶Ûÿ"šRpæN�>
Ó¯`Ø{Ã{e±_Òt´ÜÃ_Âþ¥ÈÇi’‹µà	Ø^-†RÄ=¾}„Ö÷¤¹½zH¤†!ºWCb–*_šBCÛ§†”¼Vah�'‡‘#s!þ†2/T¬þ!wê^ôÃd§E!%EŒ«øé¬Û%¾Õ›Mþ‹j%'Qz7ÝeávU›ƒÉœòý$‰tøKÑ?ù!E’7>–èÙ[Ƀ5»ûÒÁž-ÄM.C9É—½Ýó%A«¶wÝh<ë߱܆$A�¯)‰ævÌâ(ð_
u"ÎÌ~p±DgqôtÌÑœ¹”#ªšãŒ•oT<ZuÛÀf!^#WF".
g’šÎ‚ãx5/¸Uá©ï=€ôPº!Í}u\ü
lùA}3U@V7vÆÈ€¹„µ
Ô6Y«båêøÃÕÙi£ùšÇƒp4X�–a^¤³
+ÔN…\§q–š@-!S•W¦—*8Ý'y­­Wx¤ŒA5…röCXYªLÛƒ€òiìŸb|*A‰àdˆµîR¿Mõ� bdFÍÛdÉÑ’<ÒÓÇFæ0DÎo"¿'q>TÍʶ„™ƒ8÷‰òãMïì}LCwéL+&áÈ@ éçÃð«B ¨Ò�m|´1ýæü¥Ê+Ç5ð™°-î3þ¾#U§;ì'b [èJ?ÓT‰}St�¼W:ÿ1Í
Çï6}§K�Ï[5•.Þ5¿»å_ãþê»ÄÃÀNü5HÄ&›47E(à]¯C
öñP§°¾6†úìVKMÇÃ0Nv†yŠDù%ÂîÅŸ¯Þ�üÓ%EïgãˬÀ�ܬŒe7qøªXŽôß&91
à89‚Ð`PŠ\Šo‘Ëv(=änÐB/Y¥-ÓD꺫ÅÙŒõ+gƳ-žp!¹ÔG*§Ö©Ÿq„ªaXâ®ËèôÌ&"�›1Æök!ÃxdŠ¥×²6$lm­šþV#È!óšPgª¯4Ël8¶úü] äK¦.Õ�²÷’P¬zÙ¥®=‘Ã4[`îŠeW!àêšõ<ž%FWQ*çSO-ŒùpQmLsxT3�&ª]Ê:øæmea¨È[œl5'ZU	ÎÝ™­.ºË
LDN«áÙ
+äuZÀôç@Io‹†ˆÿ“˜{=
+endstream
+endobj
+4205 0 obj
+<<
+/Type /Page
+/Contents 4206 0 R
+/Resources 4204 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 4210 0 R
+/Annots [ 4134 0 R 4135 0 R 4136 0 R 4137 0 R 4138 0 R 4139 0 R 4140 0 R 4146 0 R 4147 0 R 4148 0 R 4149 0 R 4150 0 R 4151 0 R 4152 0 R 4153 0 R 4154 0 R 4155 0 R 4156 0 R 4157 0 R 4158 0 R 4159 0 R 4160 0 R 4161 0 R 4162 0 R 4163 0 R 4164 0 R 4165 0 R 4166 0 R 4167 0 R 4168 0 R 4169 0 R 4170 0 R 4171 0 R 4172 0 R 4173 0 R 4174 0 R 4175 0 R 4176 0 R 4177 0 R 4178 0 R 4179 0 R 4180 0 R 4181 0 R 4182 0 R 4183 0 R 4184 0 R 4185 0 R 4186 0 R 4187 0 R 4188 0 R 4189 0 R 4190 0 R 4191 0 R 4192 0 R 4193 0 R 4194 0 R 4195 0 R 4196 0 R 4197 0 R 4198 0 R 4199 0 R 4200 0 R ]
+>>
+endobj
+4134 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [94.777 735.684 107.233 743.863]
+/A << /S /GoTo /D (structret) >>
+>>
+endobj
+4135 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [107.733 733.9 154.081 744.168]
+/A << /S /GoTo /D (tls__client__recv_8h_a63b1b91f645ec84e1a16ffa74abb44df) >>
+>>
+endobj
+4136 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.567 735.684 181.491 744.168]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4137 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [226.844 735.684 250.768 744.168]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4138 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [94.777 707.915 107.233 716.094]
+/A << /S /GoTo /D (structret) >>
+>>
+endobj
+4139 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [107.733 706.13 153.4 716.399]
+/A << /S /GoTo /D (tls__client__recv_8h_a9fbde1f9d42348a7d60fdc326c705048) >>
+>>
+endobj
+4140 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [220.541 707.915 244.465 716.399]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4146 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [94.777 680.145 107.233 688.325]
+/A << /S /GoTo /D (structret) >>
+>>
+endobj
+4147 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [107.733 678.361 142.12 688.629]
+/A << /S /GoTo /D (tls__client__recv_8h_a8c5a39e3322ed3abda8fdac275bd8f0d) >>
+>>
+endobj
+4148 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.606 680.145 169.53 688.629]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4149 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [94.777 652.376 107.233 660.555]
+/A << /S /GoTo /D (structret) >>
+>>
+endobj
+4150 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [107.733 650.592 164.544 660.86]
+/A << /S /GoTo /D (tls__client__recv_8h_ab1edcc5afbc6ebc5e2f2e6af324be1ba) >>
+>>
+endobj
+4151 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [168.03 652.376 191.954 660.86]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4152 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [237.308 652.376 261.232 660.86]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4153 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.737 622.715 176.541 633.297]
+/A << /S /GoTo /D (tls__client__recv_8h_a9a3b463b2438583501ecb4330e49e864) >>
+>>
+endobj
+4154 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [180.027 623.634 233.844 633.297]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4155 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [94.777 596.838 107.233 605.017]
+/A << /S /GoTo /D (structret) >>
+>>
+endobj
+4156 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [107.733 595.053 165.037 605.322]
+/A << /S /GoTo /D (tls__client__recv_8h_a869e9cb9bcd3628093b074ee3a9c5606) >>
+>>
+endobj
+4157 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [168.523 595.865 222.341 605.528]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4158 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [94.777 569.068 107.233 577.247]
+/A << /S /GoTo /D (structret) >>
+>>
+endobj
+4159 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [107.733 567.284 176.999 577.552]
+/A << /S /GoTo /D (tls__client__recv_8h_a7251fea497927ca661f1c838826369bf) >>
+>>
+endobj
+4160 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [180.484 568.095 234.302 577.758]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4161 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [275.164 569.068 299.088 577.552]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4162 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [94.777 541.299 107.233 549.478]
+/A << /S /GoTo /D (structret) >>
+>>
+endobj
+4163 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [107.733 539.515 176.317 549.783]
+/A << /S /GoTo /D (tls__client__recv_8h_a24caae65e02803e80ae173895fd334bf) >>
+>>
+endobj
+4164 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [179.803 540.326 233.62 549.989]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4165 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [94.777 513.53 107.233 521.709]
+/A << /S /GoTo /D (structret) >>
+>>
+endobj
+4166 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [107.733 511.745 193.442 522.014]
+/A << /S /GoTo /D (tls__client__recv_8h_a05f53888e8be7930e631aaa658cd3e3a) >>
+>>
+endobj
+4167 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [196.928 512.557 250.746 522.22]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4168 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [291.608 513.53 315.532 522.014]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4169 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [114.215 483.976 171.529 494.244]
+/A << /S /GoTo /D (tls__client__recv_8h_a9caaa2d33c4bd794b44eba99554e6005) >>
+>>
+endobj
+4170 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [175.015 484.787 228.833 494.451]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4171 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [269.695 485.76 282.151 493.939]
+/A << /S /GoTo /D (structret) >>
+>>
+endobj
+4172 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [94.777 457.991 107.233 466.17]
+/A << /S /GoTo /D (structret) >>
+>>
+endobj
+4173 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [107.733 457.991 167.755 466.475]
+/A << /S /GoTo /D (tls__client__recv_8h_a94d98e1c8189a87072c2358bdf106ac7) >>
+>>
+endobj
+4174 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.24 457.018 225.058 466.681]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4175 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [94.777 430.222 107.233 438.401]
+/A << /S /GoTo /D (structret) >>
+>>
+endobj
+4176 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [107.941 428.33 233.335 438.912]
+/A << /S /GoTo /D (tls__client__recv_8h_afd248c035d3fc30804461c6509776a68) >>
+>>
+endobj
+4177 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [237.029 429.249 290.846 438.912]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4178 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [332.177 429.249 373.047 438.401]
+/A << /S /GoTo /D (structee__status) >>
+>>
+endobj
+4179 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [436.775 429.249 477.645 438.401]
+/A << /S /GoTo /D (structee__status) >>
+>>
+endobj
+4180 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [94.777 390.497 107.233 398.676]
+/A << /S /GoTo /D (structret) >>
+>>
+endobj
+4181 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [107.733 388.605 188.269 399.187]
+/A << /S /GoTo /D (tls__client__recv_8h_ae098040b054f38e7658c29dfc71a7841) >>
+>>
+endobj
+4182 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.755 389.524 245.572 399.187]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4183 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [286.434 390.497 310.358 398.981]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4184 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [94.777 362.728 107.233 370.907]
+/A << /S /GoTo /D (structret) >>
+>>
+endobj
+4185 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [107.733 360.836 182.522 371.418]
+/A << /S /GoTo /D (tls__client__recv_8h_a6ea7cf6c689380612ee6369a53a3e496) >>
+>>
+endobj
+4186 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [186.007 361.755 239.825 371.418]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4187 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [280.687 362.728 304.611 371.212]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4188 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [94.777 334.959 107.233 343.138]
+/A << /S /GoTo /D (structret) >>
+>>
+endobj
+4189 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [107.733 333.067 169.063 343.649]
+/A << /S /GoTo /D (tls__client__recv_8h_abc61bbc8d5f16a3646531c5d829ab4e9) >>
+>>
+endobj
+4190 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [172.549 333.986 226.367 343.649]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4191 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [303.658 334.959 327.582 343.443]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4192 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [350.503 334.959 374.426 343.443]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4193 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [94.777 307.189 107.233 315.368]
+/A << /S /GoTo /D (structret) >>
+>>
+endobj
+4194 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [107.733 305.297 238.005 315.88]
+/A << /S /GoTo /D (tls__client__recv_8h_a18fb5d996e783d4d5caca2fd3472c0b3) >>
+>>
+endobj
+4195 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [241.49 306.216 295.308 315.88]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4196 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [336.17 307.189 360.094 315.673]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4197 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [405.681 307.189 429.605 315.673]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4198 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [94.777 279.42 107.233 287.599]
+/A << /S /GoTo /D (structret) >>
+>>
+endobj
+4199 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [107.733 277.528 196.294 288.11]
+/A << /S /GoTo /D (tls__client__recv_8h_ac4016a17dac06d44cf54422a0b6553b2) >>
+>>
+endobj
+4200 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [199.779 278.447 253.597 288.11]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4207 0 obj
+<<
+/D [4205 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+4208 0 obj
+<<
+/D [4205 0 R /XYZ 70.866 775.009 null]
+>>
+endobj
+1306 0 obj
+<<
+/D [4205 0 R /XYZ 70.866 248.759 null]
+>>
+endobj
+1310 0 obj
+<<
+/D [4205 0 R /XYZ 70.866 128.264 null]
+>>
+endobj
+4209 0 obj
+<<
+/D [4205 0 R /XYZ 70.866 82.821 null]
+>>
+endobj
+4204 0 obj
+<<
+/Font << /F50 2307 0 R /F43 2258 0 R /F26 2949 0 R /F70 2881 0 R /F25 2885 0 R /F22 2886 0 R /F67 2878 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+4233 0 obj
+<<
+/Length 1197      
+/Filter /FlateDecode
+>>
+stream
+xÚåYËnã6Ýû+¸*l fø~l‹:Á �z—™…Æfñce¦ùû^‰”,Y²INP ‹@ŽÍ{î%Ï!yDÐ
+t;ú}>º¾‘l•âhþ€4ÁF)¤-Ê¢ùÝ�5™|›F~âBA\öíÍúÉM¦L›ñ»ÅËÆm“(Yï¶éÐÑl>ú1¢0’ Z ƒ
h±Ý#h	¿}F€h
ú•�Ü !9–‚Ãç'ô÷è¯i­RQLò2¶˜a:™RBÈxÅ*ÇÏn·H¢åW"	üѬ:_V¼
+õ}¹tÍ�ÆVš¢4å)<pì’çËA÷Så3ôIöšã>‚:…–hJ)¶RyXZ†2l©f°²<_﯄ðtôõ�U¥AZp2»ò#*³™r�5±!¹ô#×Û¤
ŒZL™ÉÑžÜöêm6
�•o›{Ãüt>æ®Óü2V~kÀ¬&Þ'qj6#{(Îkçúäy�!H
4ØS&@ÜAˆN§âðÛc÷’øÑ6|á5“~|ˆw›ð£ìwP¹‹ý?ðq׊ý¢b&ÓuMéÒ*]*Ì8&Læ1
E—bS:~®ðÒ´]“°µä¹íʨ,¶êãi§(Ášž=.`´ÀTÒ‘�ºrJhÌ(‰»nV? ¬ÄÜôMXÑ%K©«“ǃö¹JXìök·<ÒÊA‡ðCÈ]}ÌH¬”î1�:u!éê{Ç{ê¥U˜À*¶M�IÛJ=�’Œ.γSä÷LÙL~9gÁž›p2þgïIÎ5”³J·Çd7kevšøîS¨'a1Œ4½‰ïˆ7´Ë[¦À±²�xiìÀpüÝ�¤½_ÂFÚ+×Û#Oó×¹–úú„<¿÷Ïó×;>ð§4¦ê"g¶HcTå†nd°_ÊfË9ÏßÇЈdÏ_�ëEØÂÑòç„I¸©î9|óPD¾@3pšùÎs¨3§ ûU˜ïŸ7Õ$[ÙJ’£Sh¸Âº~qÉK¼­ö‡þ°Âc°¡ Ç2˜ˆã}-’—èéôA:+Ÿº JÒ·¼Êû©eµ±rq¼\¥�h´òÝ^ÅtLCAz=!ʦƒ›ŽïFƯ‰{~7ãñ=E¯�ªË+¶xŒòö¶Ò{ÃAB»´Þ®¹õfØ2ýqÖBý_­Åyg‘Ë-h:özOµÿú_÷ÌX¬õùfTÆí™Ók†¿»˜†–�ÉKÜ]ÌLEhÝ©›«gÂÆ›«’±±‡lUÈe\' ÅzL®N*@0¦†	cF†C¥.âF˜’XÚv7Ò3e³4Ê9;ºw†àÎ%ÖÉ
©Ì0‚a‚4îL\Âu0Iaª×Ñ3a3½åŒ\GÁcçZêcOðA�Ç´uÒqŒ+Ø4íî£gÊf&Ë9?À}
+è<‡:{¡†ÞáÝ1:ºj¡‰³öCmˆ{G¢8¹^¼
áÇ6äÓ6él@˜ÆŠëvò)oƒßüÞC¾Û{�»«Ö>SJL8íòö)ë'“k9…°U<ÁΆ•¿u[GÅ5êû¬ü½XFûë*¥e®ûR�ÿNYÎ
+endstream
+endobj
+4232 0 obj
+<<
+/Type /Page
+/Contents 4233 0 R
+/Resources 4231 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 4210 0 R
+/Annots [ 4201 0 R 4202 0 R 4203 0 R 4227 0 R 4228 0 R 4229 0 R 4230 0 R ]
+>>
+endobj
+4201 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [69.87 728.087 86.209 734.646]
+/A << /S /GoTo /D (structret) >>
+>>
+endobj
+4202 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 716.132 157.248 723.344]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4203 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 692.221 157.248 699.434]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4227 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [69.87 392.797 86.209 399.357]
+/A << /S /GoTo /D (structret) >>
+>>
+endobj
+4228 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 356.932 157.248 364.145]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4229 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [69.87 81.702 86.209 88.261]
+/A << /S /GoTo /D (structret) >>
+>>
+endobj
+4230 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 69.746 157.248 76.959]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4234 0 obj
+<<
+/D [4232 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+1314 0 obj
+<<
+/D [4232 0 R /XYZ 70.866 771.024 null]
+>>
+endobj
+4235 0 obj
+<<
+/D [4232 0 R /XYZ 70.866 642.723 null]
+>>
+endobj
+4211 0 obj
+<<
+/D [4232 0 R /XYZ 70.866 477.787 null]
+>>
+endobj
+1318 0 obj
+<<
+/D [4232 0 R /XYZ 70.866 450.592 null]
+>>
+endobj
+4236 0 obj
+<<
+/D [4232 0 R /XYZ 70.866 307.433 null]
+>>
+endobj
+4212 0 obj
+<<
+/D [4232 0 R /XYZ 70.866 157.794 null]
+>>
+endobj
+1322 0 obj
+<<
+/D [4232 0 R /XYZ 70.866 131.06 null]
+>>
+endobj
+4231 0 obj
+<<
+/Font << /F50 2307 0 R /F72 2883 0 R /F79 3175 0 R /F96 4060 0 R /F43 2258 0 R /F67 2878 0 R /F70 2881 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+4243 0 obj
+<<
+/Length 1267      
+/Filter /FlateDecode
+>>
+stream
+xÚ½YMo£H½ûWpZa)îéï†ëh“H£�´›ø–Eî8–lðbœìüû­†n
›ÖœÛ�W]õª«^ì­=ìÝξ.g_nöJɼ峧0
+¤ôTH‘$Þrå=ú…óU�ŸoOñœb»ÑIþ”éøu`½”?ßl¶º|º×Ïs‚}�é$ÖóËoç	ÅÀh
©ˆùvv½œý;#ð%öHe9P@¹ïf�?°·‚ß¾y±0ðÞŠ�;�ãlë=Ìþ™áº7Šz
+…
+ã
a1Ø’ ìüÙ$¹±þå&”õ­!"4pÜêäªÜÔÀ[Ø]BP(Ä;ÞBbìÿÑ
K$ÃÊï}žu 6MÇ‚”›ÀÅwb‡ˆö‚r�õåï9Ç~”làÓc^>DI¹“Ãf�èUù	Nª×:+?<géÎn.—}j~Ϫ­i*�óh…
+Þ0¢ÂÄÜ,·s©jÅpB† òî„”Ã	£�6Ø„ø‡ÂrÖ•Ò$ŸRçR€bŽ Sª¸0†ÉáI ÁØ9ØÍPÈ……(3°qŸ¢œz2`,›0wíäbÁXƒ�<!˜ !TÓbþ¢­{—"Ÿí“P%cœosŒñi<N°<J†%{\á®°—G …EU$N29Îd7“u›“‰©°ÇÝOwaÓçrýi
+ô¯\áÍ«šïÁ'nsò<D?ß“0,ß<DŒö»Béå[p„yШÞ�|�3ÙÍwÝæùÚ|wU®o/›Øváhõ:§ªvìR z®þòxÐg2`°mö¸ie+÷p×Lš}©ˆp£59VjûÓ½Î�YÒlJný@¥>/Hô´k­µ–l�zN„åÚèªÙOu–¥vÿwŒY´.›~C�-¬I-V'Ç|;AšceÆÈAå2ävbV6[Ûßß~HЬA�ë™Î�ða³7
+Ã(µŽ1s„b‹+ÑIïÝæ=¸*<)”LD:ÔTˆ0‘nÏu§Bc
+ŠeØVhŸU|ý1ë�Ÿó�~Â?åöÜõû'?«@é'h8L�Ö®d±ð“Ób²SJþŠ©­Bt“Jû¹:ãç§KÙ$ˆ²—1
|‡Ñ LR$ˆ
Èõ©N6Ò`g'kX˜qšäѦ]Þ6ù‹Ó2»;$5Ã0…`5¡6�!B>)¦@ØTàf¬ºˆŒeî¾ì—±#Mv'CÝfÕ7õœaÿ¿½ŽsÇ4g�¿4Emµ½FùõʻͧpuÕ$ʧ@XÊ¡x+(Þ—¸ýŒÁ]ä=èHƒÝ„×-˜@+Ÿ¥M
@ˆów¿—Å)–E“jœ]ba$x¿Dgæ‘‘&»y¬Ûü
óHÅÿ`Úä3JMã0ÄÀi„J�/:�Dq~Œ¶§ëéõņ^J„JÖfõuþ`x†§W�Ýë€)öWõ
åÄ4Â?ÈÚu
åPVã&�å_O}8lÒäœN‡>Í1d©�~ð‡À½ê•ÕRB·bÍ»÷Úõ9{ã2ëzS4WŒ¡†VZ\6x¸<ÝߘFÑz§“¼™nÃqk3fŸ¥y§öÓÜ‹ÖÅ(‹zE³32äå½û„DTI^»\ )í€s«�E•D(ßq•Ï¦…‚øes.ùxÄÿ
Äæ—
+endstream
+endobj
+4242 0 obj
+<<
+/Type /Page
+/Contents 4243 0 R
+/Resources 4241 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 4210 0 R
+/Annots [ 4237 0 R 4238 0 R 4239 0 R 4240 0 R ]
+>>
+endobj
+4237 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [69.87 474.959 86.209 481.519]
+/A << /S /GoTo /D (structret) >>
+>>
+endobj
+4238 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 463.004 157.248 470.217]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4239 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 439.094 157.248 446.307]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4240 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 126.996 185.94 135.134]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4244 0 obj
+<<
+/D [4242 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+4245 0 obj
+<<
+/D [4242 0 R /XYZ 70.866 710.335 null]
+>>
+endobj
+4213 0 obj
+<<
+/D [4242 0 R /XYZ 70.866 559.95 null]
+>>
+endobj
+1326 0 obj
+<<
+/D [4242 0 R /XYZ 70.866 532.754 null]
+>>
+endobj
+4246 0 obj
+<<
+/D [4242 0 R /XYZ 70.866 389.596 null]
+>>
+endobj
+4214 0 obj
+<<
+/D [4242 0 R /XYZ 70.866 224.866 null]
+>>
+endobj
+1330 0 obj
+<<
+/D [4242 0 R /XYZ 70.866 197.671 null]
+>>
+endobj
+4241 0 obj
+<<
+/Font << /F50 2307 0 R /F72 2883 0 R /F96 4060 0 R /F43 2258 0 R /F67 2878 0 R /F70 2881 0 R /F79 3175 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+4256 0 obj
+<<
+/Length 1159      
+/Filter /FlateDecode
+>>
+stream
+xÚåX]�›F}÷¯˜G�âé|óZµ‰UÚ4ñÛ&ªˆ=K�lp1nºÿ¾w``ÁÆx1®Z©+°={î™{îÜ{€ ônñãjñÃ[IP„�R­ž�&8R
+ið¢hµA��fá—Õ{Äá'.ü_õíÛtkÃ%ÓQðS¾>îlVÆešgnéâçÕâ�…•Ñ1ŠpÄZï�_ÚÀoï š}¯Vî��KÁá~‹>-~[Ï’`&Ý­»xÎJpVG“þ2ÄE¼³¥-BJƒCŬ�dá9\GR©13²exgŠ‰’H‚©¤c°šcB•‡¨R¢{2BÁŠcÍu�’ƒ=¢Ñ›ƒb/�)5ØÚ�\~ó¥²úõS}Óp©?”E¸¤28®ËcaÏù1¦
ŸÝÀï\ôÆ!®k<cb%+C±>y-d%ë—os=I>c>/i„‰�õÇuŠ÷ù!-Ó?C&/EšmÒu}d«ÏùS}mµ*ì:/6þËç½
A¡7~mQ_=xf“¸n‹¢YS8úp+ƒªòNÚÍÒSÖŽ®¨)+l0t(	BH°�ù`ÉʼøpÜn?Ià�úŒ8eŠÄKôÑåDC©`£	uZrèÒƒ�^&ÑãRÕQ:Âê;çB­Fh	©¦P
+>ÕPÜ¿wÏØ‹HÚtAiðH6mô3!¼Î‹Q�E¦*bÒ;¸oêu½Ý-•Ân{DÒ¬€„ƒIYÔ`nm6W­1/Üê$ŸTÙÒ8Ú´ÑXÛo	\}…K_"¾¼ŽÙ!M2»iŠ¯´‰õòTä»^=ís÷{Ñ.ÍûPùºŒ7¾Ó§¦×�$(•%'Á³‡
%Ó,i`NJ6d$øÞ)�OÜõt½szrH¡¢Ç”ó›'�ˆ–ÐéÇ:ˆ†ž\MÛ]hF=i,àòƒFh8µ\½rÐÜwpÎôÏ�3B`Iùtzçâ•Iu]àY^`aeØ•­(ssUa挱^÷¸ îmA‡åíFmåÍÜy=î¾6=¢™]_Ý¡~.í¡æ›nsYðÉŒÏÕaø<ŧcL4‚‚ƒŠÌ=ŒE+Æpg—¤1q¶é÷ïŽ9pÓ/N&ù}êªqð;ƒNŒÿ°7¸¾å¾]ð]³ÚÜ+VŸŽë¬t³æaЫp�51ÿ¢Wy�U©óñ?µ&Ô¸©3Ú
+d^³‘>6£ž\TÀçÇ;x¹Â_éMn<8½z‘çšãHðø�ë£Mõl>KãY^c%¡Ýé«c×¹ k-Jü`{Q÷¶�Ãêvc¶êB;Ù7女K9™Ì¹A£hž”³0¼”’Às£I¥ÄRšW̓‹Ù�ÚŠiCèÙííºlü
JÊo^™œk_Ý>Œ”Àä-œË’Ï«€É}'…-p.ïê;ch”ñö²*]	ËzŽ:'ÙÒÑY	%C8�òF»yß®0ÓJ¸
+	� `A…ÄJyCöÎf¶ˆÛ’«ŸjšwíÕvžç‚›�rü´üf(
+endstream
+endobj
+4255 0 obj
+<<
+/Type /Page
+/Contents 4256 0 R
+/Resources 4254 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 4210 0 R
+/Annots [ 4247 0 R 4248 0 R 4249 0 R 4250 0 R 4251 0 R ]
+>>
+endobj
+4247 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [69.87 565.784 86.209 572.343]
+/A << /S /GoTo /D (structret) >>
+>>
+endobj
+4248 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 552.904 185.94 561.042]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4249 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [69.87 284.326 86.209 290.885]
+/A << /S /GoTo /D (structret) >>
+>>
+endobj
+4250 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 271.446 185.94 279.584]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4251 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 260.416 157.248 267.629]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4257 0 obj
+<<
+/D [4255 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+4258 0 obj
+<<
+/D [4255 0 R /XYZ 70.866 771.024 null]
+>>
+endobj
+4215 0 obj
+<<
+/D [4255 0 R /XYZ 70.866 650.774 null]
+>>
+endobj
+1334 0 obj
+<<
+/D [4255 0 R /XYZ 70.866 623.579 null]
+>>
+endobj
+4259 0 obj
+<<
+/D [4255 0 R /XYZ 70.866 504.223 null]
+>>
+endobj
+4216 0 obj
+<<
+/D [4255 0 R /XYZ 70.866 369.316 null]
+>>
+endobj
+1338 0 obj
+<<
+/D [4255 0 R /XYZ 70.866 342.121 null]
+>>
+endobj
+4260 0 obj
+<<
+/D [4255 0 R /XYZ 70.866 210.81 null]
+>>
+endobj
+4217 0 obj
+<<
+/D [4255 0 R /XYZ 70.866 82.821 null]
+>>
+endobj
+4254 0 obj
+<<
+/Font << /F50 2307 0 R /F67 2878 0 R /F70 2881 0 R /F43 2258 0 R /F72 2883 0 R /F79 3175 0 R /F96 4060 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+4268 0 obj
+<<
+/Length 1246      
+/Filter /FlateDecode
+>>
+stream
+xÚÝXMoã6½ûWð(
ÃoŠ×¢MÐE�¤YÈ.ÅfŽäÊʦûï;%[²)–³iу¡/ê½!ßpæY-A—“_¦“óIPŒ�RM�&8V
+ið¢h:G·�Â&Œ˜Žƒbµ¹›…Œ«¥M‹»Üξ‡1	ð£|±\YvcBJ›ÛtfÃoÓOHŽ¥æ@ZBjîîN~›NþšP¸IÝ2Ç1Ž™@³§Éí7‚æðì"˜›½”#Ÿ��&Ø
+}žü9!ƒ³Q“Æt0ÃqQBH°Nò�Ê`cïÝÄ~v“å×Ï«ÕW"	üh§0_T‘Þ\�fHc£	u<EœâX
+O‘Û¢zφn#å¹€gÇ–wÓ+,âZ¢ˆRl¤òàÓ?>ßmìf³ÌÒ	„d!I�y,ëÿJH¹äçF5L¨ªÇT g~\k~‘RXÀ©Dúñ³GX;?¶IÌ86ô
¼º“u2r†
ÓmÆeZt€Qƒ)‹k´•M;àÊ1f•öü²h—-‘1Xs†"& ýÐëP�Àéæ3;{.üIâuÖT7óÜå}r¸éo=äÙSë�u³°¹¿€Ó¬zšV³"™ŸUOü1µ3�;Úá®!–领iQ¤ÖEõRP†´x‚-‹}Â`&]θƒK¥k™RÎëé3
ÓJž¬‹™Ò`Óʹ®
¬8ì0Êû60�%Ž¹ØnàwÆp›]"óPF÷aÀh^îQÖݪ3Á
+Ž±hm“ÃF
,¦£‰[©H!a
l£sñXå”RÇâ/
+Ȩeϳâ9·‡ñ1©°$tD|‡ú„€ñ'i|F¥11˜K18#ä ÆT`¢«›õ¨;Ž²[Ý&çV]¨1ëºÌl»R�œGt(@P(²'Éy†—S
™©¦" p™!9%ÔrÉT«'t:’´SÐëVPëúÁßk;+ìÜß�€Ee›²ªÊïëÿªàÇ| –ƒý%`PðuÛhw r9[M¨f
+SSu¢U-m·Ÿ�õi©Á†ëˆÆ˜¹§EÅ1Y½®BÖ”¬ð½ÓévV·éy»_Û<Ϫfî¼N²ð¾¢åB£* 
¶Bˆ¦5û.´lÿÞ®‹üËOs¡{<G:Qù�NtxÚmsZWp7Á¾¨X›ˆãS¯º}ªÆš˜ݧ–ÛòPéëv³Ólþ÷|jHƒ�±ªœ¹žÕ[I™„ÿŠº§ž†áû§Ú3}«Ê©ë@ú�Vu$qgïk1ŸhU9sÿðéˆøõ
Ý1¬ñI•Æ„Ât°kSI5&Ði•öW=ꎣìV·Éydm™ei‘,ÓÚü¼,‹Çm%8ýûUO>=£C-
‚šóá$Ÿ,VPÄù{x]f(–Š¿ÁëŽ$í̈ëh¯»Ó½GöãÃ>�ÌAH.N’}Æ‘Ž—	Ð	à>Òñ^ýDÇ«œõ3MÇKIeyï“ù�ݬ³tc›.÷ÐÒB%q•f÷YV}5m¼þÿ3¯ûν×HæË�X‰AI0…$tZQ‰t�gÎÃyyóí·âÆz‹÷=»¹³ˆð§Z.)1áô˜¯ûõW}…™†Ií6‹�X©jÅ.mjód[sügþkVfö�…K¼À¦û!þ姴-
+endstream
+endobj
+4267 0 obj
+<<
+/Type /Page
+/Contents 4268 0 R
+/Resources 4266 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 4210 0 R
+/Annots [ 4252 0 R 4253 0 R 4261 0 R 4262 0 R 4263 0 R 4264 0 R 4265 0 R ]
+>>
+endobj
+4252 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [69.87 728.087 86.209 734.646]
+/A << /S /GoTo /D (structret) >>
+>>
+endobj
+4253 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 715.207 185.94 723.344]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4261 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [69.87 420.33 86.209 426.889]
+/A << /S /GoTo /D (structret) >>
+>>
+endobj
+4262 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 407.45 185.94 415.588]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4263 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 396.42 157.248 403.632]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4264 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 115.381 185.94 123.519]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4265 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 104.351 147.684 110.91]
+/A << /S /GoTo /D (structret) >>
+>>
+endobj
+4269 0 obj
+<<
+/D [4267 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+1342 0 obj
+<<
+/D [4267 0 R /XYZ 70.866 771.024 null]
+>>
+endobj
+4270 0 obj
+<<
+/D [4267 0 R /XYZ 70.866 654.57 null]
+>>
+endobj
+4218 0 obj
+<<
+/D [4267 0 R /XYZ 70.866 505.32 null]
+>>
+endobj
+1346 0 obj
+<<
+/D [4267 0 R /XYZ 70.866 478.125 null]
+>>
+endobj
+4271 0 obj
+<<
+/D [4267 0 R /XYZ 70.866 346.814 null]
+>>
+endobj
+4219 0 obj
+<<
+/D [4267 0 R /XYZ 70.866 207.406 null]
+>>
+endobj
+1350 0 obj
+<<
+/D [4267 0 R /XYZ 70.866 180.513 null]
+>>
+endobj
+4266 0 obj
+<<
+/Font << /F50 2307 0 R /F72 2883 0 R /F79 3175 0 R /F96 4060 0 R /F43 2258 0 R /F67 2878 0 R /F70 2881 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+4283 0 obj
+<<
+/Length 1208      
+/Filter /FlateDecode
+>>
+stream
+xÚÍXMoÛ8½ûWðh
5—ߤ®‹¦Åvû‘ØCZŠÍ¸bÉ•än²¿~‡"åX¶"G’ìÁ%Ó3�ó†o†"h…ú8ùy>ùéƒ$ÈàX)ŽæHl”B:fXQ4_¢Û©Ñ—ù'Äá'.ü¯zúaýh£Ófú>[ì66-“r�¥nêäj>ù6¡0“ º·h6L Åfrû… %üö	�ÅØ ª™$$ÇRp?¢›É_P̤ºKÀ¬tfE±
ôŸÓ$O6¶´yDé´¨�Õ&[‚{ׄTÅXK³Gxa%‘SI»lÀlŽ	UÁDÝ Qc&˜âXsíCRØ¢heˆ‚1C;Æ^Sã8¦MÏå×�*óßn(æ~\Ãñ7eͨœîå.·§@�=ý!žRÄ
a·‰ó4�²hf¢Ï.%ò,Íœ`Éb켃àa.Û	nø´@0)§�ÏÇ]à½Ìüõ>Üoól
ôÛeÓ½±ž²&1ã˜îo£§l) ‘îyí™6µª¾Á†û5˜öYØD6‚ïw>Ôë‡p-?HÉÒr[l³´°õÝ·ÝÚ›Y§«ð�@jrŸÁ/‚LK‡ï¨pÌ-@„…cÌ0¥`Ž;Þþý5)‹ß+|Oåg"	|hX­‹z¾
+á¿vëÕ�Ú8Ö„:Í8¼”û”kD	ÝÎTÃÇSUOœ—W< ¨BK"…íƒFÝJåKøu|GkFÖÕð3!Ü%V“âJˆÈ‰þ-�ÈýbˇäˆïU
+S!fbæçþ²„»~xÛìyhÌjÖÓE¶Ù¹
ɪŠ>ökk¤èQ~BÀ¯<­¨ÂLuç¦GË×7à8^jØŠÕE*ª€ü–¼±¢tÜ*¸
χuH9e�|Š
ÀwÊ\5˜Åq=EV8u’f”È}Hí
+:ݪÀlžƒ0JRKî¿nƒÙ<Ô¼‡ˆ“©NwóǯaNý`›릵ÆüzǾlï^ÊË‚ò®ÜujË›W£ï6¿J~ü¼-íòê©´©ËŸb˜(‹NQ^UžƒÓ#ÿO‘~÷¶åÏ@’=6åMX{WÀahWt!4œöAfÓÅ5øl˷“
+h¡ûÁð\;ÑRâd£:_â4ä°Ä]Û…ml�$
�Ë6É붥JlØ7~^Ø<>ÅyHñðì%ñúTAÂäà*Ȉ„N¹³…d’bÆ:rœ
_)œé9å—¨‚4–8>W9ˆ�CÝ6k œ&ݱïÀïÈ
+ÈÈVL ;áÆ™ TŒâwœ�À/�cº«(̘H~–_ðŠÙÁÎvEɉOuÝ–tCÑNw†‡ÐJoõl‘¥e²N÷ÝnѦ	a
vá_W™Ñ{!§¬‚	·¤Q™1ÊFÈű ô"™¡à¬R¿d;ÌŒZ÷_ÉŠaÚ³¢
á"YQŸ�»Ò¡÷
+N©Œ²qéÐßFÏVÙ�7Œ—h•›¯Z$¹«lJ‰	§}Þ×o³fÚ-Ú	g&hN…„=Ú³�6µy²oî#
Bý&»Ê¦çÐ.§ÇÿWXB)
+endstream
+endobj
+4282 0 obj
+<<
+/Type /Page
+/Contents 4283 0 R
+/Resources 4281 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 4210 0 R
+/Annots [ 4272 0 R 4273 0 R 4274 0 R 4275 0 R 4276 0 R 4277 0 R ]
+>>
+endobj
+4272 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [69.87 551.441 86.209 558]
+/A << /S /GoTo /D (structret) >>
+>>
+endobj
+4273 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 538.561 185.94 546.698]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4274 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [69.87 296.595 86.209 303.154]
+/A << /S /GoTo /D (structret) >>
+>>
+endobj
+4275 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 283.715 185.94 291.853]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4276 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 271.76 176.376 279.244]
+/A << /S /GoTo /D (structee__status) >>
+>>
+endobj
+4277 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 259.805 176.376 267.289]
+/A << /S /GoTo /D (structee__status) >>
+>>
+endobj
+4284 0 obj
+<<
+/D [4282 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+4285 0 obj
+<<
+/D [4282 0 R /XYZ 70.866 771.024 null]
+>>
+endobj
+4220 0 obj
+<<
+/D [4282 0 R /XYZ 70.866 636.431 null]
+>>
+endobj
+1354 0 obj
+<<
+/D [4282 0 R /XYZ 70.866 609.235 null]
+>>
+endobj
+4286 0 obj
+<<
+/D [4282 0 R /XYZ 70.866 501.835 null]
+>>
+endobj
+4221 0 obj
+<<
+/D [4282 0 R /XYZ 70.866 381.585 null]
+>>
+endobj
+1358 0 obj
+<<
+/D [4282 0 R /XYZ 70.866 354.39 null]
+>>
+endobj
+4287 0 obj
+<<
+/D [4282 0 R /XYZ 70.866 223.186 null]
+>>
+endobj
+4222 0 obj
+<<
+/D [4282 0 R /XYZ 70.866 82.821 null]
+>>
+endobj
+4281 0 obj
+<<
+/Font << /F50 2307 0 R /F67 2878 0 R /F70 2881 0 R /F43 2258 0 R /F72 2883 0 R /F79 3175 0 R /F96 4060 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+4297 0 obj
+<<
+/Length 1271      
+/Filter /FlateDecode
+>>
+stream
+xÚÍX]sâ6}çWè©cÏEß²Û´$»Ûíl&/Ù�Œ<!†ÚNvóï{eÙƒù0N:ûÀ`°|ï•Î9WÇ"hŠºìý6ì�$A
6Jq4œ Mp Ò†aEÑpŒî<…�ßg:ðòyv?òñæq”ä÷i4zöâá™»=ˆç‘»ºŽ&>%^”FÉ(ò¿
?"!8–šCÒ"¤–ößÞÃÞ¿=
+DW™ƒL ÑcïîAc¸÷ÌM€¾#‘�LØ`stÓû»GÎFQLÖ¦ƒ¦ÜïSBˆ7µß^”ßDiqõ¥ö¦™ßúÒÎ"ž¼|%’À‡e»zÓiYøõ%¤Õil4¡6-A}Nq …˘Fyùœ«Ýõ•Í\$uùòÛ"�_Ü°Év$B0¡%êSŠ�T.þðÏ›û,ʲx‘Ôò@Uf­*©1dÁWB¸}>0jm�Á„ªjLôì¸Y÷•Â.]mÒ…XŒòp¼¯*`eØUéjÌÍÅí͇Ë37¬^
×XS¯ Nr·¬¿4®gÏâi8Ÿ6æ¼XõU‘Žç á+Ùú”q¬C}&€Ânì%`_h¢à~ùLzÁàÏeºXLJqÍÂrä¬TѧÒûždÕýòï‚�ØÃb±Q˜GvÜ™»ù�•ç‹»}FñsœLÝÏ0»‹Uðpn5 ÎËT°I˜?¥UIYAjE&Ù¨|vY¬½Y˜Í°Ã3ia¶_i¥×ÖT
D9w+óÅgÂÓð1Ê¡J½¬F“¦Þ 8ˆ—ò}½�q‰õkkxÛ¶‹H¤,ÌFï
£y!$¢hLºÖ˜4fÀÅà;5µmwFJA¹„�š¸FRËQ
¬e^q:II�²÷#w€?�
+RlÕlj‚"ô	õmÃc˃ñ]î¢D˜@Ãæ!€äæ À0Ý@¯÷­=𞔵ݵ´+p]?(Ä?Þ/ôꉊ
+ÅïáAÛ‰lcHÀÚ‰]B8H#`ÇdoÁiÀtP¶¹Í4áļ�L¨%~öeYa>ÙÀ|Kv"Þ¾â-¼ltêííCT›M}ß*V³¶uU	„Y·˜×¬IRß´^=N
Æ0üîÓd!+O˜-Iíê°F¶_†Ðà,„¨Y±ÛÈâ$ÎfÑø]Ýk•¤¥w•?±wUïæ]¯þjð— VC�±—Ĉf{i½`ΫöœŒ³Yø`Í`É°GXŽpZþ˜¤‹ÇfW
+ï;¥“Ý×Õç_}¸qÊñ¿xB.ÖûM‡ýˆ™Ý}£S·Up°Sò`<ÊrUÁAO;<=9q}¯ à_-sWO¨M!¤öõmÃìøy'„»„(¦ö&¦�Ã>¯«öZu„ðž–µÞõ´a‰£ëqÅåh‘ä!4óê}p‡ôw)>,ßGá|ô4‡×Òñö+éf»ÙM›ÖóÞÆBhè9]hÓ:DKCÁ4Ã
×�…èd(ÇZËš¡�»
ÅU4Ÿ/Z»	Ÿ>ÒL	~b'qÌ‘W‹§‡èDZ¥|ð½×.>[PÓYÛ;ôåÓá“>Õzá—ÙC<n2bv?èÄ@x�LÀ7Y©wõÞ´qÞ¶ÓJ–Ð]ó¸ri�'‚N‚xø ó‘NÛ”Wä
+3­ÄZ‚÷¥Te)“(mnß¿/ì†ðã¥ìÉf‰ÿ
KÀŒ»
+endstream
+endobj
+4296 0 obj
+<<
+/Type /Page
+/Contents 4297 0 R
+/Resources 4295 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 4301 0 R
+/Annots [ 4278 0 R 4279 0 R 4280 0 R 4288 0 R 4289 0 R 4290 0 R 4291 0 R 4292 0 R 4293 0 R 4294 0 R ]
+>>
+endobj
+4278 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [69.87 728.087 86.209 734.646]
+/A << /S /GoTo /D (structret) >>
+>>
+endobj
+4279 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 715.207 185.94 723.344]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4280 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 704.176 157.248 711.389]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4288 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [69.87 420.016 86.209 426.575]
+/A << /S /GoTo /D (structret) >>
+>>
+endobj
+4289 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 407.136 185.94 415.274]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4290 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 396.106 157.248 403.319]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4291 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [69.87 162.158 86.209 168.718]
+/A << /S /GoTo /D (structret) >>
+>>
+endobj
+4292 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 149.279 185.94 157.416]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4293 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 126.293 157.248 133.506]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4294 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 114.338 157.248 121.551]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4298 0 obj
+<<
+/D [4296 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+1362 0 obj
+<<
+/D [4296 0 R /XYZ 70.866 771.024 null]
+>>
+endobj
+4299 0 obj
+<<
+/D [4296 0 R /XYZ 70.866 654.57 null]
+>>
+endobj
+4223 0 obj
+<<
+/D [4296 0 R /XYZ 70.866 505.006 null]
+>>
+endobj
+1366 0 obj
+<<
+/D [4296 0 R /XYZ 70.866 477.811 null]
+>>
+endobj
+4300 0 obj
+<<
+/D [4296 0 R /XYZ 70.866 358.455 null]
+>>
+endobj
+4224 0 obj
+<<
+/D [4296 0 R /XYZ 70.866 238.469 null]
+>>
+endobj
+1370 0 obj
+<<
+/D [4296 0 R /XYZ 70.866 211.724 null]
+>>
+endobj
+4295 0 obj
+<<
+/Font << /F50 2307 0 R /F72 2883 0 R /F79 3175 0 R /F96 4060 0 R /F43 2258 0 R /F67 2878 0 R /F70 2881 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+4310 0 obj
+<<
+/Length 1406      
+/Filter /FlateDecode
+>>
+stream
+xÚÍY]s›8}÷¯àÑž©µúz­Ûf¶Ý‡lã}ØI;;+“\ÀMûï÷‚„cÆÜ™>$|‰s¯tŽ®Ž0öÖö®&o—“?>ìùHKɼ彧0ò¥ô”¦Ho¹òn§Jξ.?z1.á½òî‡èÉÌæTùÓwI¸}6qäQM'ï—“o-±Gvˆ¾�|ʽðyrû{+xöÑDí{/eËg�†gpþäÝLþž`—%FT§ÅÁå,UKÎ’ Ÿ»¤¯g”Oƒ4x6¹Ig„L³2³
+²5CÏàØ‘!t’ðw^ƒ ,…§8FD�.hÍ&ÒA”C¢j4*D9(†SvH2“e­óÉàÀÀØk`B4ÒšÔ#çN*Ë¿nìI•‹½ÈÓÙœˆé6Ì·©iæÇ8àÓ!ù5ùa�^7ÄiŽGa8Ž©@Rë]áv’c†‘ ÚŽôãŒâ©™1<ýÑÁó°àí<·D‡?-³6“ð!ˆ×N
« :î�Y“€ãø�àØ%„z²…–O‘KòµÃ»øÔÁé �í”îÇÜM¶ùf›ÛóE’<F]ó´o.M
+†)6ŽÅ1–F©%âšžìú$�˜ Fݘ^wð80f;‘ûAw5øŒIºÙÞÏŸ¢Ð^ŸQ1
ž¶îq¶Ýlž"³²Ww{P» 7°èÎ
¶|Î�j¥LT³Qj‡áäâ¤9½Ä´—¾DRrËÜ&{ŒVŠ¶U1µ¸Q¼ŠÂ 7™¥4º·ÇÀi$5óì!H+4dõ2ƒ%=p/ah6¹Y½qÕ„’¾D™SËœt¤w÷šäø‘qé�ÑÓ¾JÆgn%ýlÀ
+ÅuÏZ¸£^óæÄG˜ûvj²MW£Û´Wžî ÿìÈ—H#Šˆ„71ÆÓuqœš|ñ`‚ãÇr‚íï&]§p/�¾`LÅ,‚(þ‚†?âúPŒeºvƒú¹è,1
+i(REØ›3°ï‚W=Èk}÷nç²HÃfPD·�óè>ÚEœ•mŠ¸Gbz°CàJÀ`�¦„´¡À“þ·o�_‡Yé½…BÌÕîzÊìHj¹×H—Þ×üö›ó`.¡©ÍÍ™„y°êÊŠúà—èY©ªÍõ?o?½ÿ÷ܤ˜B
+ë_žÔÍŸW¶I-:%BýW«¥ùCj>b„‚ŠA¾´š>¡‰ìÚãêOìÊTX	Ø]ÚåûÚ­š�ž�ídmúÌ]�-%P²‡ï:9¤Ou羘J¸.uu¤8�ð«Çaå_b×É1@Š“»N�”¸¾~�e×ê òØ]'ìl´Ïä×äƒ4•Çñ(Ë1Óv³v
‡Â´€	AökÊqŠÆm¥¸xGñ¡c=br�rX³‚0¯\Ë}š<Ÿ°®ÇêÄQÁôïmƒì‚Ñq‚‡á£Š­ ¹Äˆù•u}¯ÞQË° íjÙ�šEë8('{Éiaê[™Ê­¾*IlyxÌ6AhvF¦�ñÞ7Ù©è8Æûcôô¨Œ‚’þïåQÕ¡GmøÑÏæÛÖdù¯r¤¯6Ôú��è9®ó.IžZ0)CšT˜açæGÞÉŠ]�:éÚMòºkÛ¤I©Ö¶™‹#­é³,ÎTvh¤Çº¿
 …jq|jŽÃ°Å˜`ð×qh„P¤ÎphöÃÀÀ­_j‘G:4
+ÕHK: ¿&?`u·»:Íñ(˱æ`.²Þj�˜Ø›«Öÿ'yXäVŽ÷BWšú7$›ÍÆ„y¯kó½3׊ðÞ¹6¸Ö�p’îþU‘i@	Øa0Òç§Ñê‡[‰¨*¾×ÝCX¬8xéV”+›4ÈÛ¾Ô¾KÊAþéÍø°
+þSù¯
+endstream
+endobj
+4309 0 obj
+<<
+/Type /Page
+/Contents 4310 0 R
+/Resources 4308 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 4301 0 R
+/Annots [ 4302 0 R 4303 0 R 4304 0 R 4305 0 R 4306 0 R 4307 0 R ]
+>>
+endobj
+4302 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [69.87 507.576 86.209 514.135]
+/A << /S /GoTo /D (structret) >>
+>>
+endobj
+4303 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 494.696 185.94 502.834]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4304 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 483.666 157.248 490.878]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4305 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 471.71 157.248 478.923]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4306 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [69.87 201.505 86.209 208.064]
+/A << /S /GoTo /D (structret) >>
+>>
+endobj
+4307 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 188.625 185.94 196.762]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4311 0 obj
+<<
+/D [4309 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+4312 0 obj
+<<
+/D [4309 0 R /XYZ 70.866 771.024 null]
+>>
+endobj
+4225 0 obj
+<<
+/D [4309 0 R /XYZ 70.866 592.566 null]
+>>
+endobj
+1374 0 obj
+<<
+/D [4309 0 R /XYZ 70.866 565.371 null]
+>>
+endobj
+4313 0 obj
+<<
+/D [4309 0 R /XYZ 70.866 435.952 null]
+>>
+endobj
+4226 0 obj
+<<
+/D [4309 0 R /XYZ 70.866 286.495 null]
+>>
+endobj
+1378 0 obj
+<<
+/D [4309 0 R /XYZ 70.866 259.299 null]
+>>
+endobj
+4314 0 obj
+<<
+/D [4309 0 R /XYZ 70.866 140.051 null]
+>>
+endobj
+4308 0 obj
+<<
+/Font << /F50 2307 0 R /F67 2878 0 R /F70 2881 0 R /F43 2258 0 R /F72 2883 0 R /F79 3175 0 R /F96 4060 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+4391 0 obj
+<<
+/Length 1606      
+/Filter /FlateDecode
+>>
+stream
+xÚíZ[oÛ6~÷¯: °‡š&)‘±·zN›¶k³$ë6d…áÈt,D‘\IΚ¿£›mÉt"¥ò´‡=–‘çãùÎU>ظ1°ñ¦÷ú²7:aØ°‘äÜ4.†ÀÈæÜ’"NŒË¹qÕçˆàÁ�
+»{ÑÔPÜ÷\åÇÓP9÷÷Ñrðåò�aY&b„�ÓeB$w{“ËÞ×�›Ø ›ÝmÙÔ2œ»ÞÕlÌáïŒLi§Oރͬd3ϸèýÚÃ9âÍ'¢,¹L>òsp¡9·<Ct®âuèG)¬ê~£¶]N)‚ïCb#l±lu¨¢UàG*SE‡ƒ!aýµ{ªdËT‘„"IK¶æ{XQRR%Á?®Ë^¦®ð&×Ûù@lM†8Î�ö&È*>—9Îyà¬ï@À,v?»,ŠgÜ(»úcê©
•”3:ÔàH
+ÓÎe
+ø’I„3`’ò¾w;##–¢O‘_Â1Œ«!‡Ó�Fƒôó,EÙ×_­ãìÔ¡Ü{5Ͼ-Âà.»ºPá½
+K ÷åÛzXrÁ�0"`;ºí�-ÈÜ…?W‹Lò凋éøÃéäãåô|2þ<}«A6â€è¦â@–ë«&â¶ÒôTÚü̾ã­ç9ŠŒvOì7šy…½Ö’°ÙïÐ)ÌcÂ%S³]´Öq•8·*ŽÚ…ÌŽ
+ùV=@P›yN» ùQA;YŽ”?o¶Ðº$åœ4(f€ÒË-~õ-V¡_ÉSûðóH×{p5#8ñl^Æ}áŸáÃ:Ò,!EÒí� Jó�÷cV b[ÆÎíÉ«\¥©ò(ÛÕiùV&Íõã
+¼¼§üW� rH[–¬ƒð—v¾\Å!(’ü”JR"A•¬@õFavj×±ŠE]Å8ËY%3ê'›f,TI`Æö®êÒJì§ñËFLdU-Ao ëÒ@N÷ŽóŒ˜ašÈ–tmµ¯ë­-´KÚƦËüp-mŒuì
ý÷sÇ,d“CÑ”ýïÁ—MXcŠ*ÿz³àôyfQrÞLÕ4•g]Õ¹r‚°aq�´)4pIsY6hñ©´ê’¯ßõ1	­³°«Z3w•¹Í©wƒðlíy­)Dž“ùâÖÜmWýw%õ}‹)dç!®]ý¶÷TMP& f˜b6T…O“ûé´R&‘E«!ÊÆZZm=Û¶ì¼P=Û�g¶ç9Ü~Q¹Ô”¬ŽÄà8VÀMÞK–x•z+�öĹ!ÙþÑåKD	kNys<ïÇÉG„Wc·”ÚÔI0?~!r^=Ò¯góóâ%{Kî-Vãlª“Q5Ý¢wó¦�HÂÙKº'XÛÑ‘â]ç¿îZ‘R¿/gqôvïHÍOê,{µº§3J;ÒÙ¦FžøNø°ŠÕ|büä,Q[aÉ¢ˆË6,U©iÏâupd’µ‡ò�)(þVqs)CÃVPdHDäãñ¯”ü°¶Á <Ë*ñ¦ÖLÒµ=ŒUV¡»xh-;1„MÒ ozFvªµýÅøóÅé›–šåȽ™y7¥<E�´«|R}š2e×<Ÿ¸¾-UkݱäˆsÚm“ñöäôã.#ÜD<é<K”XÚÂ�0Ü5#o•çÝöÜúß·û£t­)g5âyâ1™�8îj©Âtsƒ�gúôêѳ것nz«¾=ÿµÛc8Çï›í[W{gï¿7@
M
- .5D/WÑ­;/5Mj媽kt¬ÆKåÜn3“»p�Y¬Æ˙뷕ŸA˜Éãæ§:»Ÿýöúýäφ›'­7¯ÓùAæÛ¡ß„¦ŠÙÕlÅõ¡‘‹ùß’~®¾®UÔV…ŸÿTÕ”ôº^¹×#æGr?]ú]u«s[_8p©¥H虤ñ �òçî¢23UÃ{`D?
– ¤Y'®—Ïo�«Å€€Á„P-çcf�Í�mæ©’µŸÖq:Pµ;v]̯)?>02ñce|ÿ~@0œ�…¥Ó`ЭqÊsÉÔBvˆ+#›é …¦	Ô{Œz8�Í©ùìv2¦¼€\°3—RÚÐ
'²¬o0›XLQrh|¸µ3}h
3¼˜ÐS¾
+Á/ç9	ñÙõÏÁÔýíá&1h‹ªÿ
œÕ›A
+endstream
+endobj
+4390 0 obj
+<<
+/Type /Page
+/Contents 4391 0 R
+/Resources 4389 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 4301 0 R
+/Annots [ 4315 0 R 4316 0 R 4317 0 R 4318 0 R 4319 0 R 4320 0 R 4321 0 R 4322 0 R 4323 0 R 4324 0 R 4325 0 R 4326 0 R 4327 0 R 4328 0 R 4329 0 R 4330 0 R 4331 0 R 4332 0 R 4333 0 R 4334 0 R 4335 0 R 4336 0 R 4337 0 R 4338 0 R 4339 0 R 4340 0 R 4341 0 R 4342 0 R 4343 0 R 4344 0 R 4345 0 R 4346 0 R 4347 0 R 4348 0 R 4349 0 R 4350 0 R 4351 0 R 4352 0 R 4353 0 R 4354 0 R 4355 0 R 4356 0 R 4357 0 R 4358 0 R 4359 0 R 4360 0 R 4361 0 R 4362 0 R 4363 0 R 4364 0 R 4365 0 R 4366 0 R 4367 0 R 4368 0 R 4369 0 R 4370 0 R 4371 0 R 4372 0 R 4373 0 R 4374 0 R 4375 0 R 4376 0 R 4377 0 R 4378 0 R 4379 0 R 4380 0 R 4381 0 R 4382 0 R ]
+>>
+endobj
+4315 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [69.87 662.634 212.775 671.405]
+/A << /S /GoTo /D (tls__client__recv_8h) >>
+>>
+endobj
+4316 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [136.819 606.11 176.47 613.479]
+/A << /S /GoTo /D (tls__sal_8h) >>
+>>
+endobj
+4317 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [136.819 598.14 172.286 605.509]
+/A << /S /GoTo /D (tls1__3_8h) >>
+>>
+endobj
+4318 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [136.819 590.17 193.207 597.539]
+/A << /S /GoTo /D (tls__sockets_8h) >>
+>>
+endobj
+4319 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [136.819 582.043 201.576 589.569]
+/A << /S /GoTo /D (tls__keys__calc_8h) >>
+>>
+endobj
+4320 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [136.819 574.23 209.944 581.599]
+/A << /S /GoTo /D (tls__client__send_8h) >>
+>>
+endobj
+4321 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [124.266 559.098 138.811 565.087]
+/A << /S /GoTo /D (structret) >>
+>>
+endobj
+4322 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [141.003 558.132 184.839 565.659]
+/A << /S /GoTo /D (tls__client__recv_8h_a63b1b91f645ec84e1a16ffa74abb44df) >>
+>>
+endobj
+4323 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [187.03 559.098 209.944 565.659]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4324 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [258.164 559.098 281.078 565.659]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4325 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [124.266 543.158 138.811 549.146]
+/A << /S /GoTo /D (structret) >>
+>>
+endobj
+4326 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [141.003 542.192 184.839 549.718]
+/A << /S /GoTo /D (tls__client__recv_8h_a9fbde1f9d42348a7d60fdc326c705048) >>
+>>
+endobj
+4327 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [253.979 543.158 276.893 549.718]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4328 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [124.266 527.218 138.811 533.206]
+/A << /S /GoTo /D (structret) >>
+>>
+endobj
+4329 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [141.003 526.252 176.47 533.206]
+/A << /S /GoTo /D (tls__client__recv_8h_a8c5a39e3322ed3abda8fdac275bd8f0d) >>
+>>
+endobj
+4330 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [178.662 527.218 201.576 533.778]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4331 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [124.266 511.278 138.811 517.266]
+/A << /S /GoTo /D (structret) >>
+>>
+endobj
+4332 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [141.003 510.312 197.392 517.838]
+/A << /S /GoTo /D (tls__client__recv_8h_ab1edcc5afbc6ebc5e2f2e6af324be1ba) >>
+>>
+endobj
+4333 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [199.583 511.278 222.497 517.838]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4334 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [270.717 511.278 293.631 517.838]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4335 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [141.003 494.371 205.76 501.898]
+/A << /S /GoTo /D (tls__client__recv_8h_a9a3b463b2438583501ecb4330e49e864) >>
+>>
+endobj
+4336 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [207.952 494.528 255.972 501.898]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4337 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [124.266 479.397 138.811 485.386]
+/A << /S /GoTo /D (structret) >>
+>>
+endobj
+4338 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [141.003 478.431 201.576 485.957]
+/A << /S /GoTo /D (tls__client__recv_8h_a869e9cb9bcd3628093b074ee3a9c5606) >>
+>>
+endobj
+4339 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [203.768 478.588 251.788 485.957]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4340 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [124.266 463.457 138.811 469.445]
+/A << /S /GoTo /D (structret) >>
+>>
+endobj
+4341 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [141.003 462.491 209.944 470.017]
+/A << /S /GoTo /D (tls__client__recv_8h_a7251fea497927ca661f1c838826369bf) >>
+>>
+endobj
+4342 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [212.136 462.648 260.156 470.017]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4343 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [300.007 463.457 322.921 470.017]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4344 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [124.266 439.547 138.811 445.535]
+/A << /S /GoTo /D (structret) >>
+>>
+endobj
+4345 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [141.003 438.581 209.944 446.107]
+/A << /S /GoTo /D (tls__client__recv_8h_a24caae65e02803e80ae173895fd334bf) >>
+>>
+endobj
+4346 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [212.136 438.738 260.156 446.107]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4347 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [124.266 423.606 138.811 429.595]
+/A << /S /GoTo /D (structret) >>
+>>
+endobj
+4348 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [141.003 422.64 226.682 430.167]
+/A << /S /GoTo /D (tls__client__recv_8h_a05f53888e8be7930e631aaa658cd3e3a) >>
+>>
+endobj
+4349 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [228.873 422.797 276.893 430.167]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4350 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [316.744 423.606 339.658 430.167]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4351 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 406.7 193.207 414.226]
+/A << /S /GoTo /D (tls__client__recv_8h_a9caaa2d33c4bd794b44eba99554e6005) >>
+>>
+endobj
+4352 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [195.399 406.857 243.419 414.226]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4353 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [283.269 407.666 297.815 413.655]
+/A << /S /GoTo /D (structret) >>
+>>
+endobj
+4354 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [124.266 391.726 138.811 397.714]
+/A << /S /GoTo /D (structret) >>
+>>
+endobj
+4355 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [141.003 391.726 193.207 398.286]
+/A << /S /GoTo /D (tls__client__recv_8h_a94d98e1c8189a87072c2358bdf106ac7) >>
+>>
+endobj
+4356 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [195.399 390.917 243.419 398.286]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4357 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [124.266 375.786 138.811 381.774]
+/A << /S /GoTo /D (structret) >>
+>>
+endobj
+4358 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [141.003 374.82 260.156 382.346]
+/A << /S /GoTo /D (tls__client__recv_8h_afd248c035d3fc30804461c6509776a68) >>
+>>
+endobj
+4359 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [262.348 374.977 310.368 382.346]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4360 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [350.218 374.977 389.87 381.774]
+/A << /S /GoTo /D (structee__status) >>
+>>
+endobj
+4361 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [450.642 374.977 490.293 381.774]
+/A << /S /GoTo /D (structee__status) >>
+>>
+endobj
+4362 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [124.266 351.875 138.811 357.864]
+/A << /S /GoTo /D (structret) >>
+>>
+endobj
+4363 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [141.003 350.909 222.497 358.436]
+/A << /S /GoTo /D (tls__client__recv_8h_ae098040b054f38e7658c29dfc71a7841) >>
+>>
+endobj
+4364 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [224.689 351.066 272.709 358.436]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4365 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [312.56 351.875 335.474 358.436]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4366 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [124.266 335.935 138.811 341.924]
+/A << /S /GoTo /D (structret) >>
+>>
+endobj
+4367 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [141.003 334.969 214.129 342.495]
+/A << /S /GoTo /D (tls__client__recv_8h_a6ea7cf6c689380612ee6369a53a3e496) >>
+>>
+endobj
+4368 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [216.321 335.126 264.34 342.495]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4369 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [304.191 335.935 327.105 342.495]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4370 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [124.266 319.995 138.811 325.983]
+/A << /S /GoTo /D (structret) >>
+>>
+endobj
+4371 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [141.003 319.029 201.576 326.555]
+/A << /S /GoTo /D (tls__client__recv_8h_abc61bbc8d5f16a3646531c5d829ab4e9) >>
+>>
+endobj
+4372 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [203.768 319.186 251.788 326.555]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4373 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [396.246 319.995 419.16 326.555]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4374 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [438.089 319.995 461.003 326.555]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4375 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [124.266 296.085 138.811 302.073]
+/A << /S /GoTo /D (structret) >>
+>>
+endobj
+4376 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [141.003 295.119 268.525 302.645]
+/A << /S /GoTo /D (tls__client__recv_8h_a18fb5d996e783d4d5caca2fd3472c0b3) >>
+>>
+endobj
+4377 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [270.717 295.276 318.736 302.645]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4378 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [358.587 296.085 381.501 302.645]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4379 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [417.167 296.085 440.081 302.645]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4380 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [124.266 280.144 138.811 286.133]
+/A << /S /GoTo /D (structret) >>
+>>
+endobj
+4381 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [141.003 279.178 230.866 286.705]
+/A << /S /GoTo /D (tls__client__recv_8h_ac4016a17dac06d44cf54422a0b6553b2) >>
+>>
+endobj
+4382 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [233.058 279.335 281.078 286.705]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4392 0 obj
+<<
+/D [4390 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+4393 0 obj
+<<
+/D [4390 0 R /XYZ 70.866 734.781 null]
+>>
+endobj
+1382 0 obj
+<<
+/D [4390 0 R /XYZ 70.866 728.331 null]
+>>
+endobj
+3034 0 obj
+<<
+/D [4390 0 R /XYZ 70.866 249.145 null]
+>>
+endobj
+1386 0 obj
+<<
+/D [4390 0 R /XYZ 70.866 232.732 null]
+>>
+endobj
+4389 0 obj
+<<
+/Font << /F50 2307 0 R /F67 2878 0 R /F43 2258 0 R /F72 2883 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+4454 0 obj
+<<
+/Length 2047      
+/Filter /FlateDecode
+>>
+stream
+xÚÝ[ÛrÛ8}÷WðQªaˆ;ùèÈv’‰íÑZ®­©J¦¦’‘Y#‘Z’ÚÄûõÛ¸P¢d]HY´=yoݧº�ëL×yöîþì×+î:ò… Îý7GºÈ‘>A;÷‘ó¹'½þŸ÷¿9^Q& �~z•Lãþ€H¯w‘…‹Yœ–A™d©úôìòþì?g¾t¼ìÑó�G˜ÎÎ>ÿé:¼ûÍ�}Ïù®¿œ9ŒSÄ…ë©3>û×™»!%v‘侨‹)0r+9¯i¨D(´Uã_¯ ÇÕü°@ғ΀0hhÚ}!„¯5q>8½ÿö	ïeIdß©¹ä;©;ý•š}§Ñp8oö Þ}q¹»³uïþzüWE’õq/ݚǡ‰ž-¦1áUªÿâºT}¾15†|WߘŽS�¯õ¼A*³»Â—ªíc†0pÁ�ǹéds36>éÄÚ{˜ÌâÜ\�IiÏ`ľÁ¼‡öY`@">…‘Ø�î·A’–ûÕDÑ(�ÇAG ÆO}æöâ>q{�—?Êö6ÉÂ2ˆö›‚#!XS\þqßÇ Ñ/ûg²H‹d’R²Mh«×=ÞeˆqÑ@xR}óñbÜײë”9ê‚ÆÐ"D"é[dYŸ;�,°VÆÓ·5û™qŸº½eœ*4›GeÖ·
+‹â|‚×€FPÏB»¿yyYµ)Ìýïa[Ù²YR–€—$�˜‡_ÕÛ“9=»Íø<VÞÓÔ
âü6˜Å— [gøu]¿
VøÕ„`.Ód­c†iÉPk³†Îy/…©7§,A‘Ïw
kü¤{x¨úïWè0³˜Ï3ÜEá8ŽÞçÙb^tDzœ#)ùq¤·Ni1©=z
+#Á�lÏŽjš¨ÔÐœ›\–=º¾ì­0´Öµyfè‚œp½:÷ÜŠ{¿�_ÕïT1dXçän°å¶]O›s…µxi�#€ê“0¨â– ãy¤¡½Ï¾™ß¼�ÝžQ‡]ó¶1ÊÜj*	Íýßên‹²^ĘÃiqø†
P>߀qW¶\QZXS_œÄ‚¡ÖÏ4Ü8™œO'ÛÙûùÂÊÃÈiØ;85{›™·Xô%‚¹4çkȲ0¢ö=ØA¹È+ÜL'™!ç¤|˜m\‡go#0
+Æ«` «Ì‡ Jå3"Ç:ŒB“ÏìÃ’�\.�ÀÒRÍAåÁX�Ôíˆ$· ê <ߦÃÕp	ÈHV¬tØÀzo9ꬭ$:k눰ELú§ ,Ðús“fÉ��­¦Ñ§ÈãÈÛŒO–È{’
k¥ÿ	Ìùõèö¢ÂMÊJâƒÍÁ¡™J”h›‘ÏGÍÁÂT¤åíXüÎçó©
+Š––¾Du\“WÕ–¬ÌÂljînãIV&µJñÊ.Z¢–(coe7W×G¯†ÀÅ`F?
MͲ¨yÝ(ƒ¹ƒ2n‚ÉLŽ‹™ypÕgÜF“Ù2ú½ŽÓIùpz&
�½†™ïÆG›$šÙõø)âž"ùŸ
+{Z˜âi¹+.¹‹Ã,¯bÛ³µn2KÊŸc™�?Ý€st•1ÿ$¶måÂt„=¶ƒÉGy\®‰‡µ-5øékRª®ø6ÿwßSK–æ8¯Á'ÅQÂNay[jµÝæKäbºÃ±kóÿIœX!~ÕnKGÍi´ýp87mNÎùXîðá¹�î«Ú��ª®˜e'q‡¾�óÿñú°Er½û>Þ�£ÔŸÃÁ/#Ûôñ"Ð�sG%(ÂnTÉ<®Ôì
+äQ¼ÎÊ×JÍ°Ì&U^Y¨Xž’X©ÁžŒQÊ°ôòÏZ‚G}îö²¢ü0>WÐ\@®ÐEaÚG&�íý¨ülÝùÖ÷
¾'Ó)ptå¸ÈþÎAæ
+b­b2»I`´J�|ªJ¹_ìÄKh7yÒ(›uÄÇ°šJŸ¶q³»Ûæ˦DÌ#ëNö>Nc“£V¶¡d ÷g«浞ôŠÚ_ð Q¨O=éóNE7j÷}Dq«MöáÖ³9iX,®s¸ôZíºšù·Ø¨a‰�Êæ»E2µ\i‰Ñt;(Œ^k‹¶¾ü–Wæ.¶á­H§=qÖ€"…0§þ´#ÞØco›�²ññ¿ýgÿG.÷�8û§ |‹'�ÃòqWب¿ª¥0û"*hÒh;Øõ[%VÛ½ƒÊaEøè,øšéš¨¶™KŸkc¤S˜±Ïù®£“èMqzÿ'|º]ž\RIP¬µ.`�ªÎÛæºî³ªÑV«,GÛ�>ÁRþÒ!„ò�wúHÝQçbAý�|ƒ‚æåq¾ñ¼¼
øÓs[qõ»Û‹æÜ)}ÄøFyà	¢æëe¢ú
†Ú‘Æ-øzk€a”ÖõC<�f›1ÊND§œ"ᶊmVtÊ$5œ©ÄiÆ™ªIƒ@#ÙŽÀ†ö
+â5I}1o•K
ïn1s7|©®‚iÑã_ÁDÅgyG;åP,
6ê(�!LÝéA9!çc¤í
±ËÛñÇßo·†G6×6ñ¤}iù_“k±˜ÅµøiõÊ.
ͽ˜#B7ÝQÏ—[¸AåЫrX[Œ#ç¾Vø`>‡®—u¨¹]ÝRwxù@ÊNý|º<¼Òåb
@òÄ‘qT@*ˆj‘„JÄ™×�-Ôs
+ßö·uú’â6ÿÊ©þ�#‘ªÂ¨˜„!Ιb!ê]°Õ¿ÖÖ¥‹L£î@	.§›2þž²¡W
+endstream
+endobj
+4453 0 obj
+<<
+/Type /Page
+/Contents 4454 0 R
+/Resources 4452 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 4301 0 R
+/Annots [ 4383 0 R 4384 0 R 4385 0 R 4386 0 R 4387 0 R 4388 0 R 4394 0 R 4395 0 R 4396 0 R 4397 0 R 4398 0 R 4399 0 R 4400 0 R 4401 0 R 4402 0 R 4403 0 R 4404 0 R 4405 0 R 4406 0 R 4407 0 R 4408 0 R 4409 0 R 4410 0 R 4411 0 R 4412 0 R 4413 0 R 4414 0 R 4415 0 R 4416 0 R 4417 0 R 4418 0 R 4419 0 R 4420 0 R 4421 0 R 4422 0 R 4423 0 R 4424 0 R 4425 0 R 4426 0 R 4427 0 R 4428 0 R 4429 0 R 4430 0 R 4431 0 R 4432 0 R 4433 0 R 4434 0 R 4435 0 R 4436 0 R 4437 0 R 4438 0 R 4439 0 R 4440 0 R 4441 0 R 4442 0 R 4443 0 R 4444 0 R 4445 0 R 4446 0 R ]
+>>
+endobj
+4383 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.489 735.821 160.322 744.592]
+/A << /S /GoTo /D (tls__client__send_8h_ae6b7732d127485cfde84999ddfda0822) >>
+>>
+endobj
+4384 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [163.807 734.929 217.625 744.592]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4385 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.737 706.399 194.411 716.874]
+/A << /S /GoTo /D (tls__client__send_8h_aee3012ea76db9592b6f2e3fbacab3cc1) >>
+>>
+endobj
+4386 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [197.897 708.183 221.821 716.667]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4387 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [248.65 706.291 287.028 716.667]
+/A << /S /GoTo /D (tls1__3_8h_a42d4f54d23f86205a1fa590480181e0f) >>
+>>
+endobj
+4388 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [307.334 708.183 331.258 716.667]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4394 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.489 680.384 193.757 689.155]
+/A << /S /GoTo /D (tls__client__send_8h_a69bcfb300064b7f15307350e7d0124a5) >>
+>>
+endobj
+4395 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [197.242 680.465 221.166 688.949]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4396 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.489 650.962 214.522 661.436]
+/A << /S /GoTo /D (tls__client__send_8h_a3f2dea2ce7289f8bce2f6dfaac14f6c4) >>
+>>
+endobj
+4397 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [218.008 652.746 241.932 661.23]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4398 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.489 623.243 213.787 633.718]
+/A << /S /GoTo /D (tls__client__send_8h_abee16589c78e98f01d9132aa5ced2c84) >>
+>>
+endobj
+4399 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [217.273 625.027 241.197 633.511]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4400 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.489 595.524 210.255 605.999]
+/A << /S /GoTo /D (tls__client__send_8h_a1f55fbb70c8d9bb96502cbd91d1cdce6) >>
+>>
+endobj
+4401 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [213.74 597.309 237.664 605.793]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4402 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.489 567.698 173.789 578.28]
+/A << /S /GoTo /D (tls__client__send_8h_a1553ec144ff983a19fbac15287b5650e) >>
+>>
+endobj
+4403 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [177.275 569.59 201.198 578.074]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4404 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.489 539.98 191.084 550.562]
+/A << /S /GoTo /D (tls__client__send_8h_a75405e425d1a8734b4d448fa843f75ab) >>
+>>
+endobj
+4405 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [194.57 541.871 218.494 550.355]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4406 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.489 512.369 182.226 522.843]
+/A << /S /GoTo /D (tls__client__send_8h_a58576f34a1a3600c77e60d9831ac7174) >>
+>>
+endobj
+4407 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [185.712 514.153 209.636 522.637]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4408 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [265.372 514.153 289.296 522.637]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4409 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.489 486.434 166.813 494.918]
+/A << /S /GoTo /D (tls__client__send_8h_a2ae6b9eef1b8fa44f42aeede03d166c3) >>
+>>
+endobj
+4410 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [170.299 486.434 194.223 494.918]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4411 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [221.053 486.434 244.976 494.918]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4412 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.489 458.716 161.326 467.2]
+/A << /S /GoTo /D (tls__client__send_8h_ac3814152151d8ad90f5cf22869a7c5ed) >>
+>>
+endobj
+4413 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [164.812 458.716 188.735 467.2]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4414 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.489 430.916 160.833 439.687]
+/A << /S /GoTo /D (tls__client__send_8h_aeeee21f81f578cdfdbd7434f1f5ba619) >>
+>>
+endobj
+4415 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [164.318 430.997 188.242 439.481]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4416 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.489 403.198 188.242 411.969]
+/A << /S /GoTo /D (tls__client__send_8h_a5809bb963eb76b8aa7002bae244837aa) >>
+>>
+endobj
+4417 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.728 403.278 215.652 411.762]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4418 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.489 375.56 173.072 384.044]
+/A << /S /GoTo /D (tls__client__send_8h_a98a0f43e9052f8230efaee151d650195) >>
+>>
+endobj
+4419 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [176.557 375.56 200.481 384.044]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4420 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.489 345.949 162.976 356.325]
+/A << /S /GoTo /D (tls__client__send_8h_a001b7d8bce6fea3da1d821e89b102e36) >>
+>>
+endobj
+4421 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [166.461 347.841 190.385 356.325]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4422 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.489 320.042 171.296 328.813]
+/A << /S /GoTo /D (tls__client__send_8h_a9c81ed54086d15ab4982b68ef57af9de) >>
+>>
+endobj
+4423 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [174.782 320.122 198.706 328.606]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4424 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [225.536 320.122 249.46 328.606]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4425 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.489 290.619 182.889 300.888]
+/A << /S /GoTo /D (tls__client__send_8h_a1b05bed69596b34f80fc460710bd1af3) >>
+>>
+endobj
+4426 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [186.375 292.404 210.299 300.888]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4427 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.489 264.604 178.559 273.375]
+/A << /S /GoTo /D (tls__client__send_8h_ae9f1efa7bf9cc9f1d167289728e114aa) >>
+>>
+endobj
+4428 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [182.045 264.685 205.968 273.169]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4429 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.737 236.966 163.54 245.45]
+/A << /S /GoTo /D (tls__client__send_8h_a08dee8d5bd3df471b1da1ed77a4b9371) >>
+>>
+endobj
+4430 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [167.026 236.966 190.95 245.45]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4431 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.737 207.463 158.062 217.938]
+/A << /S /GoTo /D (tls__client__send_8h_a3426e5597c2646607d74ba45881331a1) >>
+>>
+endobj
+4432 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [161.548 209.248 185.472 217.732]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4433 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.389 179.637 194.114 190.219]
+/A << /S /GoTo /D (tls__client__send_8h_a5abfbe6d2e0753c1e9aee4c3731a75cf) >>
+>>
+endobj
+4434 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [197.499 180.556 251.316 190.219]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4435 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [383.468 181.529 407.391 190.013]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4436 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [431.6 181.529 455.523 190.013]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4437 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.489 153.81 160.833 162.294]
+/A << /S /GoTo /D (tls__client__send_8h_a83d64f2525fe60c359db5f2e6502136f) >>
+>>
+endobj
+4438 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [164.318 152.838 218.136 162.501]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4439 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [258.998 153.81 282.922 162.294]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4440 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [114.887 126.011 179.661 134.782]
+/A << /S /GoTo /D (tls__client__send_8h_ae7c449e4c9fd2eae231da36b4fdaed4d) >>
+>>
+endobj
+4441 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [184.545 125.119 238.362 134.782]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4442 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [331.135 126.092 355.059 134.576]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4443 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [381.269 126.092 405.193 134.576]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4444 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [94.777 114.137 118.7 122.621]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4445 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.489 86.418 153.713 94.902]
+/A << /S /GoTo /D (tls__client__send_8h_a47426f5d0addf1b5276403d20cb57f43) >>
+>>
+endobj
+4446 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.199 85.445 211.016 95.108]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4455 0 obj
+<<
+/D [4453 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+4456 0 obj
+<<
+/D [4453 0 R /XYZ 70.866 775.009 null]
+>>
+endobj
+4452 0 obj
+<<
+/Font << /F50 2307 0 R /F43 2258 0 R /F26 2949 0 R /F70 2881 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+4496 0 obj
+<<
+/Length 1399      
+/Filter /FlateDecode
+>>
+stream
+xÚÕXß“Ú6~ç¯ð£=I–,ëñÊqÉ%MÒšéL’¹ñÙ<›‘†ÿ¾+K66�»vòä_Òj÷û¾]­Œ�©ƒ�W½_ƽ—7;!’Aà;ã‰#0
+ƒÀ’¢€8ãÄù숯OEèªùê.ö(vçYš«»Uš'hf>ÝdóÔÜ}L'ÁnZ¦y¯|Š™t…ô¾Žßô†ãÞß=Kc‡4K…!
+)sâEïóWì$ðí�ƒ‘/CçŸjäÂaÜGœùp?wF½ß{غ�ÛaÀ÷m¡@
÷„ë8¾PÊ+/êiÎç>ç�ûÍ£Ü-²Ä~Ó®•SëãÇj”KûÖc˜`óÇ2‰TºkNü‚9>hÊÿ:òˆЭVY‘w濼¡�#!¸@„I†>ï1öõð�@’!©ÇX«/Y®,m›e
+^‘ÎjÛU…æRh{}âSÄ…7`š1cø·2]F¥%8ʯ�ľ2—¿44óbmPªîà\4µª°×™}1JKÐ
+6dÀ=Ç.ÚA§wŸRD¥v“"ÉŸŒáA¥ì›,ÏV³KÈnG'‘Ë)
+
ñÇÉ¥È=D«(9¶2Uav΃×7'«‡bÈ\A/RøBóhnf0n5‹¬¢ªWŸ¼P—¯O¸›éÁq¤4ÌÏ®.ú´êhg �(KG:˜EY~Q99InÒG„^TJþsµ
?zÀÔxðúêöýéºcqÉÎÓ]\ÑaïkRF~ºªÕèÊ$
+¨ËæÊdó|Â
+Bèžb“ZeÓ«ùôGõF0AšŠ3ü>�n_�®4.ã]¡�öJjp@R�:6ÙüDõk˜'&ÃH»ÎÜùæ:RÑó)ÚÃVY8CY§·:ÐV¢Kåmžd[ª†5¯ÅľˆosK[�òÿ^0t.å0š×’¼›”Åâ.Ž H¬WÛØ&9í¬“¡m¼n!û.Z®ŒµeYÜW§ˆta³&ÒNt»j\E†v8¥Œ—•:ú¾D8túŒ"}~sNApR!c÷:UI,}×é*.³¥²šÛ
ƒ9‚BÎëm£ˆ�D3óÃZ-תëÛ}Úì$êRž1¢\ßꋆtØuH&�CWeîZÍŠòö�h{¦¡6˜�è]Öî£Fq¡Ô^PíÔ
+TÖ•ZPoÖy¼m¹®‹x½¢-¬�£$D!’„·-5UûÖ`0Ò:«e*¢Ž@R`ÒæźòMר~КkžŽ•8ÿ1¡«58Ró{¸	ÙZ꼿ïøXm�
+I°SöDâ‡Às«Û¯Ãíæ:l\ˆø¾îfàDLv÷hóº°²åLK¬âs�ív+P¡¬Ü‘õ«�îµÌ¢2Z¤
+Lâ®:ðì;»SØþxzäìNG*ysvbú|ÏÊ9¢88fFûYÆDõË@tþ|ÀŒ‚©	I0Ú�Ÿ€±�\¼p‡wB`ד¤»rSIô[mŒ/æA™}h«u™>ô�R¡wÒü{ȘÀXüÇçÛ8økŠ„pe¤STêÍ!Án�ÿh�òVgB•›áwu¼ÔP�!	�Ùjã*ƒ-c©6rYÍÙ׸vª
¬Hÿœj3üs|¨[Þ	®ï$°ìz´Î¡ãÎ}ºãTg=Âðe½ –S´Ÿ‚ÛëÑ‹=dî�×6G;æ õ
›>‹ö˜«ÆÈÇŠ·”HødD`Û°;ÖUbKw£!óØú�h^¤úÈû]¥ù6Ãë–b�'iÙ�‹¼•òÍ a=§îVb•*¯éߊE¦T–OmÛ’iSZ¸}u]§«OÎù%[§k€¨X+]G
\*<^¥yZBsma¸o!p]Tl¦:“Ý4ßuñ_U]'
+endstream
+endobj
+4495 0 obj
+<<
+/Type /Page
+/Contents 4496 0 R
+/Resources 4494 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 4301 0 R
+/Annots [ 4447 0 R 4448 0 R 4449 0 R 4450 0 R 4451 0 R 4481 0 R 4482 0 R 4483 0 R 4484 0 R 4485 0 R 4486 0 R 4487 0 R 4488 0 R 4489 0 R 4490 0 R 4491 0 R 4492 0 R 4493 0 R ]
+>>
+endobj
+4447 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.489 758.177 178.738 768.446]
+/A << /S /GoTo /D (tls__client__send_8h_a1970aa3fae4d5a9d0166f9975420c8be) >>
+>>
+endobj
+4448 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [182.224 758.989 236.041 768.652]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4449 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.489 731.986 181.751 740.757]
+/A << /S /GoTo /D (tls__client__send_8h_a9cab659f1afb869e0553aec979dbef57) >>
+>>
+endobj
+4450 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [185.237 731.093 239.054 740.757]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4451 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [279.916 732.066 303.84 740.55]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4481 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.489 704.09 221.973 712.861]
+/A << /S /GoTo /D (tls__client__send_8h_a7c39ce6582f79fc4db8995020c582ea2) >>
+>>
+endobj
+4482 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [225.459 703.198 279.276 712.861]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4483 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [320.138 704.171 344.062 712.655]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4484 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.489 674.491 197.468 684.966]
+/A << /S /GoTo /D (tls__client__send_8h_ab206e386ec23f927c695b39cb165bd33) >>
+>>
+endobj
+4485 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [200.954 675.303 254.771 684.966]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4486 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [336.994 676.276 360.918 684.76]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4487 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.489 646.596 199.835 657.07]
+/A << /S /GoTo /D (tls__client__send_8h_a6c68dc8d23117860735e6d2a37733f1b) >>
+>>
+endobj
+4488 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [203.321 647.407 257.139 657.07]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4489 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.737 619.512 178.352 629.175]
+/A << /S /GoTo /D (tls__client__send_8h_acbe3332ca8c08818211e307c5ddb48c0) >>
+>>
+endobj
+4490 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 322.805 185.94 330.943]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4491 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 139.348 157.248 146.561]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4492 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 126.289 171.594 134.606]
+/A << /S /GoTo /D (tls1__3_8h_a42d4f54d23f86205a1fa590480181e0f) >>
+>>
+endobj
+4493 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 115.438 157.248 122.651]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4497 0 obj
+<<
+/D [4495 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+1390 0 obj
+<<
+/D [4495 0 R /XYZ 70.866 589.701 null]
+>>
+endobj
+1394 0 obj
+<<
+/D [4495 0 R /XYZ 70.866 467.204 null]
+>>
+endobj
+4457 0 obj
+<<
+/D [4495 0 R /XYZ 70.866 420.675 null]
+>>
+endobj
+1398 0 obj
+<<
+/D [4495 0 R /XYZ 70.866 393.48 null]
+>>
+endobj
+4498 0 obj
+<<
+/D [4495 0 R /XYZ 70.866 286.079 null]
+>>
+endobj
+4458 0 obj
+<<
+/D [4495 0 R /XYZ 70.866 229.044 null]
+>>
+endobj
+1402 0 obj
+<<
+/D [4495 0 R /XYZ 70.866 202.224 null]
+>>
+endobj
+4494 0 obj
+<<
+/Font << /F50 2307 0 R /F43 2258 0 R /F26 2949 0 R /F70 2881 0 R /F67 2878 0 R /F72 2883 0 R /F79 3175 0 R /F96 4060 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+4510 0 obj
+<<
+/Length 1399      
+/Filter /FlateDecode
+>>
+stream
+xÚÕYËr£FÝë+XJUQ§ßM/'±ÇÉ$™Ll¥*U3³@KT$p²ÇŸÛÐ �@I*­soßs„�µƒ�»Éw‹É·ov\¤¥dÎâÑQ¹R:JS$‰³X9§.ž}^¼sÜb\Â÷²«oÃm0›SåNobÿ°¢ÔKÃ82K'·‹É_+±CJD×E.县›|üŒ�Ü{ç¢v�—låÎá‚!Áœo�‡Éol½Äˆ
+sjÖg©Z|–¹Ü:ýaFùÔÛ{» 
ö3B¦IæY
Ùê!˜gpìñ�
+…ˆ–¥‡WÆ Ká(¦!½‘‚ÕaÁ,DU£Q!Ê©£8C"š…äö�E“‚Áqá5
+ØG£+„™¨[M76M‚ÃÓ/i%�&I~-öSo•Ÿ¾lB“Ÿ†öî2£µ=�Q<=„Û´¹F„ž
ØA“=›!b\ŒÂ°@9âBžÝ
+úlP�¨+s.¼uГ
ÃŒ¶g@Õj™
ñòñ�ø^XÊ�;ù�ÇüX®|ÚÉÆÛÿ4ìæßkÿûß䎚Ûjÿ£0,ÿX#�ÕÙ­AÎòË$Õ9?Þ<ôð?Ìh;ÿU«Vã§8)Híá8ï+˜)aÚÇøÅ7Ù…G2>
+#g\j
té«T<ð‰•�=D¸›ñ�FÛ¯Z-ßx‰íéÞvïgs"¦aºÙå×e.¤q~ô½­ØB‡8é?üòÆL�ïí0£õμ¸|_
N
7.‡¸PïH.‘â¶ÉÞéaÕENq<¡ŒRŸçÄE˜‹üÛÛ Z§›z3¶Q®ñ³´|$Pšù™!+£âDGέÅA“ñÜŠ„ùŒ(b�ã)L~‚§«cNžƒý{�k·_ÒOX`ø#9¬‚”FZab`±3g ò„õû9!ƒdf€ŽùUƒdCb˜Ù¯-E÷wÔ"Wâ@�.ðr=R�!Ø×ûÔER³B˜åN‹ÇEaRêdP]ß´ldÎ4
]7ïC?´kkFAN‘¯°©Š5I‰"ÑbY€²ÇôWĹ–#s¡®1�@š¯}³²åšQõø<£bZäHf®©ôê	t095÷A¦y78øi¹èöDþê§AŠr:j%qR�” Fé`éÏA±šdè+VFe¼»ÞÇaäc€ÝDÙ5¤?gfí“þPI˜’¡Fëc€™VæÖ­þóÒSCvÐd pÿãéù…a3À('Å®!ý8Ñð=Q¶„“’Ó¢At¤Å0OÚÓ¢êÊqªÇIzÚ;LÇþýþç¬-µ?œ6Ÿî¬¸xMFá6W#³ârŒÎ×2¸áÅ{;NùÉ8=<=¥EZw{S=ñá)1W3ÄÌý/‡k¥-p�˜„º^”¬[ñìªv¼Úêx_5¬ëám1¯$„��Ø‚1;±ÉéȶiÁ³´È¯YƒÿÙÌfÐgÄà™Máɺ\¯¾�/{JsDÞ¯‰fˆH÷›h \«¾‰- dЭ­·faf¦ª[ý^Öq¤Ù�4È#Ú¼Ô£`†ÍåBy^ãÉ�¸1^v¢þ™l§¿bóýa·,Ô|1v“–¾±6ƒ¦lV_êb“@`„Œãw†åW2Œì*K˜p.«öý"²wñ,)æE;çU7<ÛȽýÞÐê™Â½R\ìs“@€�‚�K‚Ë1:˜–Ù/TUý%:_gÜ{3˜–/Ksgú?™Ï�ù÷گŨåª:ßqÜ{Ô¯
-Ö=1…@˜‘K~�+â UpŽC¤“ƒ‡Ò¾{º¢`|­¿¬¼Ä½‰³AòºÎbD§>þ
fái¸
+endstream
+endobj
+4509 0 obj
+<<
+/Type /Page
+/Contents 4510 0 R
+/Resources 4508 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 4301 0 R
+/Annots [ 4505 0 R 4506 0 R ]
+>>
+endobj
+4505 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 508.927 157.248 516.14]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4506 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 286.531 157.248 293.744]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4511 0 obj
+<<
+/D [4509 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+4512 0 obj
+<<
+/D [4509 0 R /XYZ 70.866 771.024 null]
+>>
+endobj
+4459 0 obj
+<<
+/D [4509 0 R /XYZ 70.866 605.873 null]
+>>
+endobj
+1406 0 obj
+<<
+/D [4509 0 R /XYZ 70.866 578.677 null]
+>>
+endobj
+4513 0 obj
+<<
+/D [4509 0 R /XYZ 70.866 461.133 null]
+>>
+endobj
+4460 0 obj
+<<
+/D [4509 0 R /XYZ 70.866 383.477 null]
+>>
+endobj
+1410 0 obj
+<<
+/D [4509 0 R /XYZ 70.866 356.281 null]
+>>
+endobj
+4514 0 obj
+<<
+/D [4509 0 R /XYZ 70.866 225.078 null]
+>>
+endobj
+4461 0 obj
+<<
+/D [4509 0 R /XYZ 70.866 141.705 null]
+>>
+endobj
+1414 0 obj
+<<
+/D [4509 0 R /XYZ 70.866 115.185 null]
+>>
+endobj
+4508 0 obj
+<<
+/Font << /F50 2307 0 R /F67 2878 0 R /F70 2881 0 R /F43 2258 0 R /F72 2883 0 R /F79 3175 0 R /F96 4060 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+4520 0 obj
+<<
+/Length 1121      
+/Filter /FlateDecode
+>>
+stream
+xÚÝXÛrÛ6}×Wà‘š©Ü/�ijg&í´©­‡Ì¤™MÁ2§2åŠPÿ}d‰%E”“fò"^�ÅîÙ=X� )"èõà×ñàŹ$È`«Gãk¤	6J!mV�'è}¦0¥ÃÓ&ó³úc1d$›•®òkWMðM:/g.Þ]¸ë!%™[¸ª€Wœa3C‡ÆogãÁ
+¦	¢�¦ŒÁ†	TÜÞ hcoÁÜtß̼EBr,‡ûºü= iùg1M€É!Í�ÆV¢œa.Àš¢˜¬\š>Ÿ4+ZAÁ¿ìÆ¿˜ÁʃÍôáaö‹s«6&YL¨ZÍ9{7ŽSÚÖ-¦Ì¬q$�“À™uÌG”Ì)C#& qnYMÊ"÷)¨yQ¸;Ÿ7
Ïóëx]„Pç�’ûø¢vˆ9É>
™ÌÂ}xy·¼Š¬ñùßðäÂÏCf2Ä!\B(”ÞX�eqL˜Šëz;d"Ëù­óOiV·âØÉ0Xï%˜†	nEðóBâ%R–`aÌ>˜-0‘<AÄdjU‡ÆL0€’À—ißöœX·4}�¶Òƒ�	—m«þ&e‚ÛŸ½«êr^Õ);šônnïoÊ"•h™F¯\YMÓmÈ�e9óÛ0Ͱ涇[äfìI	Ðc§¸)(Ój­nÄn8Π–&¡¢&¯…»È‡Tf÷o¡|hS>¿‡g~ –ɺž[EÃ)Ð/£…OóÈP
ø#p
€î!¸THO5
�r	-ƒL`»ýy¬h"ôC—„D¡Bž”¸§aDé° ó¤KX�5ã_!]=�vJWËêw“®ã=Øb/@({ÚÞÕc§t	b±2´%]º-]—åôålZŸ}ö=%j
ð#IÓ/^Œ8¤±móeå;àÚ2VÕy'^šÕ�×òá©,îôA¯æÔ1¬f¹
ýR%–il`׊›Ràå$Ëåòîníž ™wéÝø�KŠy/§Uî—‹•Ϧa6ld¥¿¹MÕåçñº¬&n1* &}œ³,<Th<{R°ÞyüµjL9ï­ÆÌH,9Û[GŒa©õîZ<
#ª1ƒ+{–>š(á}ZLáð)ÔÏd[Ša‡ B›6¿½[ŽŠã׿M\>ßI䟄‘È—
++vxOaÒd?ˆ§ä�Š´‡þ~F»ùß´úçòöjuH\5du‡’ÔûÕc7ïG/|›4€û?&þ$ŒD¼€=AÉg!^(¬­ÜÚv�ßÏp7ù›–ó¤èù"õà<´Õß.Žöc›G€Ðp=)ŽÇØÙ�QvnÝêÆLg7öª©2ˆâÁ¶š#ªøî¶�üOÞšÿWobÛaZjÌ�8ØŸ	8ë
ÒÆüáþì–ÄÆÛ&?ÂX	ËeëSówiÛö�€%œßè1ßfWÅ¢Â'±yt‘X©tí*·ÈqOôÍýoó¦y˜†:Ê\õt‰_´é2
+endstream
+endobj
+4519 0 obj
+<<
+/Type /Page
+/Contents 4520 0 R
+/Resources 4518 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 4525 0 R
+/Annots [ 4507 0 R 4515 0 R 4516 0 R 4517 0 R ]
+>>
+endobj
+4507 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 759.941 157.248 767.154]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4515 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 562.346 157.248 569.559]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4516 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 364.751 157.248 371.964]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4517 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 127.02 157.248 134.232]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4521 0 obj
+<<
+/D [4519 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+4522 0 obj
+<<
+/D [4519 0 R /XYZ 70.866 722.398 null]
+>>
+endobj
+4462 0 obj
+<<
+/D [4519 0 R /XYZ 70.866 659.292 null]
+>>
+endobj
+1418 0 obj
+<<
+/D [4519 0 R /XYZ 70.866 632.096 null]
+>>
+endobj
+4523 0 obj
+<<
+/D [4519 0 R /XYZ 70.866 524.803 null]
+>>
+endobj
+4463 0 obj
+<<
+/D [4519 0 R /XYZ 70.866 461.697 null]
+>>
+endobj
+1422 0 obj
+<<
+/D [4519 0 R /XYZ 70.866 434.501 null]
+>>
+endobj
+4524 0 obj
+<<
+/D [4519 0 R /XYZ 70.866 303.19 null]
+>>
+endobj
+4464 0 obj
+<<
+/D [4519 0 R /XYZ 70.866 216.177 null]
+>>
+endobj
+1426 0 obj
+<<
+/D [4519 0 R /XYZ 70.866 189.385 null]
+>>
+endobj
+4518 0 obj
+<<
+/Font << /F50 2307 0 R /F72 2883 0 R /F79 3175 0 R /F96 4060 0 R /F43 2258 0 R /F67 2878 0 R /F70 2881 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+4533 0 obj
+<<
+/Length 1330      
+/Filter /FlateDecode
+>>
+stream
+xÚÝYMs›H½ëWp”ªâÙù8j7¶kcÇñ®uت$Œ&ˆZ	�ûßoÃ$„,�k·ö`ƒaèîé×Ýï�±:عý:ýr%°ã"OJæ̾9
+#WJGyIâÌæÎç±K'_g·—ð\qõ*ZêÉUîø}lW:Îü,Jâ|éèr6ú>"°;¤²èºÈ¥Ü	V£Ï_±3‡{°è¹ÎÏbåÊá‚!Áœ/�‡Ñ#l£ÄˆŠü4?ؘ¥j‰Yärôý„ò±¿ñW:Ó›	!ã´ˆ¬4Ù!¸gpìˆ�2¹ê%Â3Û Ká(X@Hg¦`5GX0k¢H‰jÀ¨åÔQœ!2Z¤äò¯Ù>:„z4ëël¿8%L å5�f[%zÂðø)Óq
+U’škI�ùssússÙ»�:ŠC{:¡x¼�–ÙþÁP4=âßÇŽÁVˆ†ÿ ÊòèV¨ðŽâèRW(âÔ:
+ Ÿ×Ö¨{½Û®¡
ÞßÌ1Ý®×	\ãxœi[iÆ~¶ÝØrñ—a¾‚ˆq”-VéaÜO{3šßVÃpdÃâŽ=ÈžwÜa™¤žA2;]†éoÚf¼£úEÐZõüØ‚º�QŒÇ~>
+žß®$NÞÅ>œ`b œjá K*‘(»IÂ�Cy�Œ!“ó<Ÿó›	$Eç¿žþF_>e_°ÀðCò,A�@I Oa’ÛÅΦ„L&$ä[Öæ7º²`®åv,sæ»Û„v›^�à[®„s
!yBkf¤×©¼{5ïÔEÒc¥Šø‚13!z²¶ÈC˜TJxë]Ë6.˜B�å¦û(ÎZÌàê–ö ŽÞØÒ®û q!OÙ!}ÅU¹æþ¦eP¡5¹õ‚e£Û 2ÐL̹€ùãR³t:·ýs3�nÒ9uÚf+ m¡cs)KÌqÏõæ"–ÎL»mƒ¬Zt¹CែLgȤ£!Óv4eSÑ[ž	L¡»»{J¨B}ìÊa6̘æ d©wyÆ=õÕ)Ï0.ܾN›“+„™hz}{}í€뱃=ôr¸ÛÄÑ
+fÃV€bð¢AÏR

+†…¢Õ`ꨀ~NÛ+ îµª€t†:­Ø÷ïÓúô0,ü8leäìOŽ}70!a3ƒ°dÃb/€\q‘Æ%예:€¾ŸÏvèëN+è_�õz[4ù2
+Ìß?&T@
lu“<ËbÒÀÄ�;•³‡\ˆ‚ùÂœ.›“÷½¹€¸ÃH£‡�ƒbŽ)
ObŽà¦š›ÞÞßõWpöéÿœz{…ÚjtoÑôþ<j‹ìÈ­éz
Ýá¿h¥[û¢“÷–}¾ß$Y$Kó×�“,ª=‘ã•Xøÿua¬·N£’!¥:_¿(SÁ:Þž†Ù0“šr	ªÎÁÒT@uÀÛýq�ÖÓië¨nx}{�Æ)¢=âßÇLÀ†ÿ &€=Ž	ÎüS¥8Š?¼«{XÖÇÇ
øûùl‡¿î´‚ÿ÷éÝ´dØï[¥KÓ$€QRª·Ÿ Èvx×TÎZÕ¢u9�UÃÉÛÙG’q O1¬N·q�€	�¹Ëv˜4	øãÕíQþ¥¹4ñZø×<ü¿ýx²JæºÅp†GÈQúÄ	Â!{�ôÒkÅŸý§h•°]™W.Ææ‹a¸ªô䭎ò¶ß‚»>AèLrÊ¿°Ê:”ˆ*Éó$p˜ê”HJÛÝ×:Ö›—Þ}¬	ñ÷I±Åç0/ѱŽwcüÝçAø
+endstream
+endobj
+4532 0 obj
+<<
+/Type /Page
+/Contents 4533 0 R
+/Resources 4531 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 4525 0 R
+/Annots [ 4526 0 R 4527 0 R 4528 0 R 4529 0 R 4530 0 R ]
+>>
+endobj
+4526 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 581.657 157.248 588.87]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4527 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 557.747 157.248 564.96]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4528 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 331.043 157.248 338.256]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4529 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 319.088 157.248 326.301]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4530 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 116.568 157.248 123.781]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4534 0 obj
+<<
+/D [4532 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+4535 0 obj
+<<
+/D [4532 0 R /XYZ 70.866 771.024 null]
+>>
+endobj
+4465 0 obj
+<<
+/D [4532 0 R /XYZ 70.866 678.602 null]
+>>
+endobj
+1430 0 obj
+<<
+/D [4532 0 R /XYZ 70.866 651.407 null]
+>>
+endobj
+4536 0 obj
+<<
+/D [4532 0 R /XYZ 70.866 520.203 null]
+>>
+endobj
+4466 0 obj
+<<
+/D [4532 0 R /XYZ 70.866 427.988 null]
+>>
+endobj
+1434 0 obj
+<<
+/D [4532 0 R /XYZ 70.866 400.793 null]
+>>
+endobj
+4537 0 obj
+<<
+/D [4532 0 R /XYZ 70.866 281.437 null]
+>>
+endobj
+4467 0 obj
+<<
+/D [4532 0 R /XYZ 70.866 207.891 null]
+>>
+endobj
+1438 0 obj
+<<
+/D [4532 0 R /XYZ 70.866 180.987 null]
+>>
+endobj
+4531 0 obj
+<<
+/Font << /F50 2307 0 R /F67 2878 0 R /F70 2881 0 R /F43 2258 0 R /F72 2883 0 R /F79 3175 0 R /F96 4060 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+4543 0 obj
+<<
+/Length 1214      
+/Filter /FlateDecode
+>>
+stream
+xÚÝY]oÛ6}÷¯à£Ì¿)>nX Í°,6‚
mQ¸c‹åLRÚt¿~—eK¶lW’×}(DKʹçÞ{H• "èzôëtôó+IP„�RM�&8R
+ið¢h£·�”†c¦£ xÌ?ÌCF‚ÇĦŇܦ1^–�^%�¶\ÝÙ‡�’Àf6�Ã-Έ0AÄÃ÷Ó×£«éèŸÓÑ­©(Âh¾½}OPÏ^#‚¹‰ÐçÍ›+$$ÇRpX?¢ÉèÏñî̤[º‹Fé–`Å‘ðÑ܆L³l¶²…ÍBJƒ|ãYÙê!˜çp=á!#©·^ƒb¢$ÒÜ'3oáb“ÝàWc&Ò‚cݤäê¯é!;”HHšèk°wF)e˜ì-–¾^lÈIðRØ4OÖi^Þ[Ï‹Y\.?/“¹¯±Ä?ýh“tá—®Ÿ“Çâ0¡jÖ'€Cò8ÄBå°„á€	,¤:
+“æl
0ƒY¤J.VëØž¨€~V[+ nu[
OÙúi�[Oøjö’¬Üy^•72÷k¶XÁÌ)ïäÉ¿!•�=AzgŸ	cî±FzwŒ£#Y	
+̉ÝLÆSŽ)!��Øå(¾›Ü\½ïˆ$ð�ºôû�vl4¡‹ 1‡a(e	ói�@ÖÕÀÿqùÓAø¹èÂÉ>®»ë‚i*´DcðÀT@eÃÖ)65Ã,Âʸ	¾yý!¼ôΨÚKªªw`*ýÔÁ˜ÃÄ4Í'iÑG¡ñYTáAÑØ<3‰Ò�cUÚåIX¡+ßý%Ž+Å›¯3¿žT¥¹ùu“¬’¢eÌy9]—×ç4¶ÙxӯȀO<Ï‹íKW{£ñ�ya\¦º!{ÚL3Š9c½eOrwe§‹ÚÒy´
†a”SORåö"P=	ÜœT=ðWF=m6Gžkl.›F¿�ê1Š×=€CêAP:ŒþAž~â�]Bô$QXWí{\D¶EÐÏr{ÔMo« ¶«4ÿe”ÏßÙéCÖö«Ã˜ïŽqTù�°Þ>Þ¾ÛÉ›ßa“÷W¿Â+�Õ>ïòx›Ù|9˪J~
+8
º)õ¥>îæËYºð¥ï|É¿Ÿ4r(!Þ[9t³Ãö†Ã0ÊÙÈà˜ÎŒ¼„62£¡TÄWœ{m;4Œ~³a÷ÈsÄ;Ãð!yNçݱ[ž-€ˆa¥ùל{Zm­€ºÕ#'§æpùÛ1\.íÎnÙîìì!SJ²alwÇ8*ˆÔˆ�Ö7Q4ñ>”î#œÛ-¸6ê/Œ÷6ó?¬.~*Cl�äÑæü~Naƒ)¯ŒtOïÃȱӶïuìÿ
4˜Ÿþ˜Â �@ÐŽ—ÿ ÿõ‹`@—ùú‰
?)un8AMö3¹7ç „tÃäÿ/tŒ3ÝÃýÚ”Áæ4ÂYæAø# ÄRž�ƒÂ”?ü‚ÑÚw}Èd°ëüö
+ègº­ꦷ�??=­¡Õa»\Tú6½™”‹“Vwvðð¨&¡5‡qÜ¢7mP„Ó.ÿTɤ‚ü*Q?7J¬”ÿØ|mS›Í¶9þXÛ>ü¶Þ´á—…ÐÀ¦ûãð?ZÇâ
+endstream
+endobj
+4542 0 obj
+<<
+/Type /Page
+/Contents 4543 0 R
+/Resources 4541 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 4525 0 R
+/Annots [ 4538 0 R 4539 0 R 4540 0 R ]
+>>
+endobj
+4538 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 596.314 157.248 603.527]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4539 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 373.81 157.248 381.023]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4540 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 149.809 157.248 157.022]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4544 0 obj
+<<
+/D [4542 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+4545 0 obj
+<<
+/D [4542 0 R /XYZ 70.866 771.024 null]
+>>
+endobj
+4468 0 obj
+<<
+/D [4542 0 R /XYZ 70.866 693.26 null]
+>>
+endobj
+1442 0 obj
+<<
+/D [4542 0 R /XYZ 70.866 666.064 null]
+>>
+endobj
+4546 0 obj
+<<
+/D [4542 0 R /XYZ 70.866 548.52 null]
+>>
+endobj
+4469 0 obj
+<<
+/D [4542 0 R /XYZ 70.866 470.756 null]
+>>
+endobj
+1446 0 obj
+<<
+/D [4542 0 R /XYZ 70.866 443.56 null]
+>>
+endobj
+4547 0 obj
+<<
+/D [4542 0 R /XYZ 70.866 324.204 null]
+>>
+endobj
+4470 0 obj
+<<
+/D [4542 0 R /XYZ 70.866 246.755 null]
+>>
+endobj
+1450 0 obj
+<<
+/D [4542 0 R /XYZ 70.866 219.559 null]
+>>
+endobj
+4548 0 obj
+<<
+/D [4542 0 R /XYZ 70.866 102.014 null]
+>>
+endobj
+4541 0 obj
+<<
+/Font << /F50 2307 0 R /F67 2878 0 R /F70 2881 0 R /F43 2258 0 R /F72 2883 0 R /F79 3175 0 R /F96 4060 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+4556 0 obj
+<<
+/Length 1015      
+/Filter /FlateDecode
+>>
+stream
+xÚÍXË’›FÝë+z	UÖu¿KÇž™ØYdk‘*Û�hK”5K(Îäës¡A†ÒŒ`üX¨Ñœû:÷žJ–„’«É/³ÉóKE‰§µ ³�ÄP°Zã8hFf	yY˜½!o	©ñ¹êßËtíã)76z•/v·>+æEšgåÒÉÅlòyÂp%%l�h-X.Éâvòî%	Þ{CÑYò¥ZyK¤ ¤Àó5y;ùcBô’×.j`80O¥4š'1£Qr‹ýyš-ßSEñÇJŸ_N8CY	HÉT0°J¼ò4‰§ºBJ®ñ‡O‡ë£Š1·YÖQþy5!š�4ŠLѧT@Ê:Ñ eײÌ-h'š¬¾§T÷œn-r@Ù>óÍžõ„0uµyÖ¦YÑÇ0n¼¬Ì�Òê«SMΰ8_‹0u˜¶dÊ%V6,}‘$�7I+/|Y‡ŸmK†Ty8î²Äo¦‹<Û,žŠv‹b¿è¢yf®_¾€�MàªLhy(sªMË3¬&À„N]Ç\FóÍüÖ~3m;éc«¦ÈVjN±•S“Ö°õ‰1P¬€rré®–@•¨!ªf1�f1À%G(ª=‡;[[À5Ú!£¨P]«ÅÊ÷¢.nè”êôË*]¬ÂiZß½ñ{6ÝÄœF»t]FÀ
#Ü€ªWBl£1‡Q3Àb—Qù$°\ÓÙ‰ú3Ù_ÿ¶Í}ýÿ‹±Óý&ï™kŸ-‹Õ‰ÒžíÜaYŒwâáÒž�qTƤÓ`Ý=)Ó]){™çŸR�q ˆíŸÿéd¬Ç…Ç(Û7ðèåo=IE*µv=Ǥ�1ܺˆ~)©ÿqJÈ@p>X	…Õ 0ùcšeF˜ƒûŸ+ósPà‘Zó%h´wv¬~7%<?‚Ãê!ÅdŒbÀ(Œš

+÷S˜ÚÓ¡ˆª£b€æ ¹k·ý³ÙO€¶Ñ=
­éÐ*|3nê[8Â}r¢ÌgûyX"„Ðrœ*À8ªŠÜ(Т+Š¦+ŠóͺÜIܽšóáÚXÂ4?“<ö©QçÍí¸YŒ×rTo,^gIº˜5Ÿ¿M7¾Ëµ­ÏjöaF*	ZßÕ¯ø˜œz
+eßü½�r5X­’F�¢ð„0§2„KûJÅ´F[�Qª�F{UÇêwSªó#8¬BP9n¯2ãès
+,“Ýf4ʷůo_”ùÝ«ÓC;Úa’z¾R8aÇÛE),8;ç›\«n´,�’ª|×–x­ëÍù•ÏügMÒª~3JòŠGwË2‘Ïîûø?¾Á¥X
+endstream
+endobj
+4555 0 obj
+<<
+/Type /Page
+/Contents 4556 0 R
+/Resources 4554 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 4525 0 R
+/Annots [ 4549 0 R 4550 0 R 4551 0 R 4552 0 R ]
+>>
+endobj
+4549 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 676.071 157.248 683.284]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4550 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 451.962 157.248 459.175]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4551 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 440.007 157.248 447.22]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4552 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 230.701 157.248 237.914]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4557 0 obj
+<<
+/D [4555 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+4471 0 obj
+<<
+/D [4555 0 R /XYZ 70.866 773.016 null]
+>>
+endobj
+1454 0 obj
+<<
+/D [4555 0 R /XYZ 70.866 745.821 null]
+>>
+endobj
+4558 0 obj
+<<
+/D [4555 0 R /XYZ 70.866 626.465 null]
+>>
+endobj
+4472 0 obj
+<<
+/D [4555 0 R /XYZ 70.866 548.907 null]
+>>
+endobj
+1458 0 obj
+<<
+/D [4555 0 R /XYZ 70.866 521.712 null]
+>>
+endobj
+4559 0 obj
+<<
+/D [4555 0 R /XYZ 70.866 404.167 null]
+>>
+endobj
+4473 0 obj
+<<
+/D [4555 0 R /XYZ 70.866 327.646 null]
+>>
+endobj
+1462 0 obj
+<<
+/D [4555 0 R /XYZ 70.866 300.451 null]
+>>
+endobj
+4560 0 obj
+<<
+/D [4555 0 R /XYZ 70.866 193.158 null]
+>>
+endobj
+4474 0 obj
+<<
+/D [4555 0 R /XYZ 70.866 140.167 null]
+>>
+endobj
+1466 0 obj
+<<
+/D [4555 0 R /XYZ 70.866 113.727 null]
+>>
+endobj
+4554 0 obj
+<<
+/Font << /F50 2307 0 R /F72 2883 0 R /F79 3175 0 R /F96 4060 0 R /F43 2258 0 R /F67 2878 0 R /F70 2881 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+4568 0 obj
+<<
+/Length 1117      
+/Filter /FlateDecode
+>>
+stream
+xÚÍXËŽÛ6Ýû+¸”€Šáû±M›	�EÑÎxQ 
ÅÖØBmyjÉHçï{iR¶hÉv-O€®¤±ÈsçÞÃË!h�ú8y?�¼{�l•âhúŒ4ÁF)¤-Ê¢é}N¦4͘6I³ª¿ÎRF’UYTÍ׺¨æxé?=”«Â¿=Ï)%I±-ªüÄ612ý2ý4ù0�ü=¡`š z0e6L ÙzòùAsøö	Ì­Aß÷+×HHŽ¥àð¾BO“ß'$¸ïq¶‹øÒil5¡. Êæ¬)ŠIÒfÖäó½G-ì²�]Ì`e�Áýò?	ánõ»«:‹,&Tµk>ü1õKbëSfŽ8’úEÌ1ç¥sÊPƤ¯-«y9Ë›�ÔïåjUV‹ª¨ë@ÅÆ?çáù²©ÿ¶Ì«y½Ìÿr<…Ýù®Ya¯ÜT>n̤Ý=\ôJw"à	Ç”sïÊo)I¾Í×ESlSJ“:JÝ ©D`ÅÙ%Ra˜@²ZRßñ-‘²°ÁÐK°Z`"y€ðµ„ÆL0€’˜Ñˆì8tJÀoiÆÚŒJ‚�	—‘QàÐÓY¤œ$ÿ4EU›¡|EûZY–³Ð•eøú­€â	¯®.våªéÀ4ÚÛ
ô¸sô2ÄUþG`œÕ3ù¤Ê
3Lmš
g$9JÚ#ôÎf
mJŽ­õ3t§À²h›šN9ˆÎvÿ‹	mr*R¤Hhéú[©~˜$=þ:¤HäP]W$P\	ÒÇ¢rÝO’ƒ(q–í«éµýÁö98%þ¯zCàÓX½‘û~1—j…r�¥çëí>¯7ÎM,]nŽ­�×ôFX
G°ìR‡næàöH“'rÃöldó 7›]ó²kÎp~¬ÛXK»·{×ãÅA(+îâvÆaȈ*wŸ»¨x[˶Šf·­âª=vu”yÆ0ü�Á@DÈûª¨MðÍsŸ‚CÆO¤.XzVˆHêi¥®|YÛ§]Ùõ™ëlÿßÈÜÏO?
„�q�5±Áº<ÒG‹‡´jVâ…UÃxQ§CßÙt»Æçµ0Ë
ÔÝu¹f­"½~‡|˜rÿðV²:Ðw26<o[Ù®w//›mš	’4ż»·N©Lnt5ZÐDÇÔųFóó=„—sÊD¯BTÒkjÎ(0ÄY[±Ó#…{
+TÄ8“±šƒš»Èæ šw+Ⲝk‰-ÈÛÍÞõY�8-½�Ø{ <±Ô,Õ›K8fmÏ�vœgvœÍaf»FÌVnüÚ­¿A�E‡Çù~nµà,ß7ûÜ#Ë!puá÷aÆ
\XÞ¤•©1pMb=å>Ãú(»ƒ¬G†ó*hûÖOÝîNøúv¼ßêuŸ3ñ¡wò~;Æ�SåÃÜÿ£Æ¶AÑí�@ƒ7	—zËÅÚ˯‚„(ÑM%VJunqù¡ü,ïßÙìÿ¯ðºp³bRT§.þºä‹K
+endstream
+endobj
+4567 0 obj
+<<
+/Type /Page
+/Contents 4568 0 R
+/Resources 4566 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 4525 0 R
+/Annots [ 4553 0 R 4561 0 R 4562 0 R ]
+>>
+endobj
+4553 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 759.941 157.248 767.154]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4561 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 562.239 157.248 569.452]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4562 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 306.572 157.248 313.785]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4569 0 obj
+<<
+/D [4567 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+4570 0 obj
+<<
+/D [4567 0 R /XYZ 70.866 722.29 null]
+>>
+endobj
+4475 0 obj
+<<
+/D [4567 0 R /XYZ 70.866 659.184 null]
+>>
+endobj
+1470 0 obj
+<<
+/D [4567 0 R /XYZ 70.866 631.988 null]
+>>
+endobj
+4571 0 obj
+<<
+/D [4567 0 R /XYZ 70.866 524.695 null]
+>>
+endobj
+4476 0 obj
+<<
+/D [4567 0 R /XYZ 70.866 403.517 null]
+>>
+endobj
+1474 0 obj
+<<
+/D [4567 0 R /XYZ 70.866 376.321 null]
+>>
+endobj
+4572 0 obj
+<<
+/D [4567 0 R /XYZ 70.866 245.118 null]
+>>
+endobj
+4477 0 obj
+<<
+/D [4567 0 R /XYZ 70.866 94.634 null]
+>>
+endobj
+4566 0 obj
+<<
+/Font << /F50 2307 0 R /F72 2883 0 R /F79 3175 0 R /F96 4060 0 R /F43 2258 0 R /F67 2878 0 R /F70 2881 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+4581 0 obj
+<<
+/Length 1386      
+/Filter /FlateDecode
+>>
+stream
+xÚåY[oÛ6~÷¯Ð£
4,ï"—ûŠ$ëjÐ…b1Ž0[ò$'kþýŽLJ‘bÉ)Í
+ì!±,Sß9äwîÂÞÌÃÞÅàx2x.°§�–’y“;ÏÇHIéùš"I¼Iè}*9ú:ùà1ø‰q	Ï­ïžGs3:¢¾ž&Ó‡…‰WÁ*Jâ|éàl2ø{@`%öH‰¨R”{ÓÅàóWì…ðÛµòþY¯\x\0$8ƒë¹7ü>À;µ”áBM‰AQ2:"ãafâðd�b×&Ë‚ÁÃYþÓÐ|ÁÃÉu}îSÏGÚÇ$ÆÞ#H	n1“(ÉM´™±·s¨õ–í^Ó™Ûô§‹�Êq_xG –ÒN®Æß2(NªØ"¨¡+j1%Š£þ‚1³ºjYY¤&%ô]ÞŽ¤D.­"®�âU$шPU`¦fºzZšFL·ò`ÌG“–z6Ú>b’é*·�UHjºÇéùÅš“ë}b>ò±þá
+�ý9i<öšxgS·I2oÀ£iRàÝͲûÀµfìY³Â)ÀŸ½
¤q„} �rða»vaý?°3›L£©½3]û‹½^^“ɽ&ÈjOgQ<+
+Ø]’†keÖßW‰û¼wƹ †‡�#*†p-ðÙóGTää9Ò¯l|΄0f7ðqDù0Hƒ…Y
!ìFaS“â
÷·Å0
+®+|ZÆ°WÆÈã�ð„ò‘bt¬fëø`!Ö!Ô¯…PQN=¡!JU"›1œ˜"�׬‰€Ok°Ìšä’Z�Î œ.öËÊZÖÃtõ�šMýØ1eºƒ~üäl¤Çý0Ç>C\©�[Ñ\ìä؇Ó!µ˜¾…ânr›)®.¶Þí<ºQ•’̓UÙd ¨ÒýØì…áØ”"(�•Iú]Üá´Ýd73Z^ºjU‹õ�(£iK9X’{°V›Ä�TX½Èí…áÈå"™Ü±IIï$W@îⲨJ¶�ÚMf3©U¡¥Ÿ¶fï"ßš"RÛº¯…çƒÝä (é—vûa8žYŽåïÜ
+d'ÏL 
1¥(ö¶ÝMh3ÑU©fÔ÷•‰s¿Íš©
ÂЄÏ5[’Úë›?®®œ§ß•¥YZ<S\ÄIlŠŠ²Å6ÞÛ&¯!eOÛè…álƒHÄÈëØH¦Ÿ›Wº·ØG7ÁÍöQ•%4ËAœ-"¢Å„Q°2ó§ì»êl[.?XÍMšHÞâ«~TŽÑ:}àº	ÌëÓZ™>C4i×iƒ}úÀ1ƒxÃ1ÃÝrÓäátËÇ7§
§[<´÷¶
+“ºÞ–´4·ËÔd÷ÙÜÝ¿FC…ÎnY­Éò?ï]ÅH²ÕòáçíÞÓÃJ†¡7Òò5*a–»\1�ØÙ»vÜ(k’{ö®T�I:è·É@pí÷㸆å˜jP“©×(ˆ©†Ž^ªšŸ7óÛQh#¿5©¹oGñ̲yyýK^7�ØoÉ‹C×SĈ2NÝTléÒè}ДÏ38|RM‘bº—tÀhM””B�¥X=Q²�1ý¥™Ï“íÙ$bIÛgókˆÿÁdþ'�¢_þdSô“O7»§èbÿ)z0OM>}f©1á¾›µoðÆàìfüëo7ã½_ìciæû*
ö~´Ï!B%õ°h~©ÔpRoørƒøSó?¦fY6²AQfeYxRŽ¸ Ó©ô{ç$,—¦’d–Vº“õ¢Q‡T‚vV{’	#‡¼l-¢·DÔ—<?.8Лp
ݱ3™‹ü%ÏsŽ»­”À§ÉZÏ'÷’5~©ã¿«Þ[
+endstream
+endobj
+4580 0 obj
+<<
+/Type /Page
+/Contents 4581 0 R
+/Resources 4579 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 4525 0 R
+/Annots [ 4563 0 R 4564 0 R 4565 0 R 4573 0 R 4574 0 R 4575 0 R 4576 0 R 4577 0 R 4578 0 R ]
+>>
+endobj
+4563 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 715.207 185.94 723.344]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4564 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 680.266 157.248 687.479]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4565 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 668.311 157.248 675.524]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4573 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 387.25 185.94 395.388]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4574 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 376.22 157.248 383.433]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4575 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 191.821 185.94 199.958]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4576 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 168.835 157.248 176.048]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4577 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 156.88 157.248 164.093]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4578 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 132.97 157.248 140.183]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4582 0 obj
+<<
+/D [4580 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+1478 0 obj
+<<
+/D [4580 0 R /XYZ 70.866 771.024 null]
+>>
+endobj
+4583 0 obj
+<<
+/D [4580 0 R /XYZ 70.866 618.705 null]
+>>
+endobj
+4478 0 obj
+<<
+/D [4580 0 R /XYZ 70.866 485.12 null]
+>>
+endobj
+1482 0 obj
+<<
+/D [4580 0 R /XYZ 70.866 457.925 null]
+>>
+endobj
+4584 0 obj
+<<
+/D [4580 0 R /XYZ 70.866 338.569 null]
+>>
+endobj
+4479 0 obj
+<<
+/D [4580 0 R /XYZ 70.866 273.255 null]
+>>
+endobj
+1486 0 obj
+<<
+/D [4580 0 R /XYZ 70.866 246.911 null]
+>>
+endobj
+4579 0 obj
+<<
+/Font << /F50 2307 0 R /F72 2883 0 R /F79 3175 0 R /F96 4060 0 R /F43 2258 0 R /F67 2878 0 R /F70 2881 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+4591 0 obj
+<<
+/Length 1509      
+/Filter /FlateDecode
+>>
+stream
+xÚíZÉ’Û6½ë+x”ª,±ÇKì”�Ì(U©²]SŒ„‘X–(E¤<™¿Oƒ5¤¹hHê�CR\^wãu÷ ÁÁ:ÀÁ›ÉO‹É¯9ÒB°`qHŒ”�Ô	,VÁ§©@„ÌæTªi¶Mï–3Š§ÛØ$Ù]j’Ú¸[¯ã­qg7æ~FðÔM²„KŒâPO•œ}Y¼›¼ZLþž0�r6¥R4–»É§/8XÁ½w
FL«à!r„œ!28ß·“ß'Ø»�åöÔ|0B6#R¡�æ·
§Ñ1Ú™Ìg„LÓܳ²ÑC0ÏàØá!UÉ’‡WÆ È#ÂI<Í&ÂCäC"+üJDC
+PI&Ý�¤&Mã}Rgˆ„	*‡†XžÃûHaVµœm|Ò,~½u'…/îKvœÍ	Ÿž–Ùéhêþ1®ðÚß½:=L#Ý
q™âQžb*`tÄU(fðen ¿Í(‡’¼@ó0ãÍ4—­ŸÙ-»‘_ˆ“U¼Œ²F·
+v{{Ug 8äÜ(vGaxv	ED]
+%Ì“ù»D �•ß—o;Hf³™Ô²ÑÛå÷®@¿¦‡héKy¿Ì¢UÁ®;>lâ¥×‰lïŽY9Å[ÿä2WwþÖl·ûötèO�JB�V#Óa†K¡%Ý)õìtÀÁùt¸ùО�6çCÙêM”¬ö»»�™I[iìïF�Ž¬êqžFE‘–úb(”ëK4
+°¥°vm�&Z=ÞEk[iGcV¬ó¡‘ÕŠ…ûâŽï}½Æ‡
LŸœJŸâÌß>€J3<ýïOéöÑ]KÌzŸÅQfV/ܳMýã÷öáÈ~mM“ÞqÕ)©ÆeÉŸ$â¡úµ.$ËËùyõçâÕ‡Û_>~¸íHŽa¶›“£lèžÃç�ïã9ýÿd&±ßQý½=ªs0¿EëO+L륤W©}�ýÈúq<ÚÊ�:˜f¾™Ù²ý­IÖ™—ìýý¹¸ÓÍÕ_m�7y£÷M&sEO8˼)¦õ…ºo#»îjMŒÞ
ÕYµ‹E923FaøÔ€å¥ô*k&†Ž`á´391ÌnsN”
·HA¶‰Sw¶É'nîfZêð{Ÿ˜!@ù÷ó8�Sÿþ¡Ô™<¶OŒÂðÙ@C$äu²�jxÏ“òcvJ7é0Ìps:”-û攤»Ø—v¼Û™•Uz�þVJ{»S§ ±Þ£u¯Œ‡…âi¯Q 	JclûÞêÇmÞñ4ûŒ9†±£Ü´&7¶åÞƒ•9ƒAæܯ×÷1´YQBÈÜWá7¬l8ǵ�ëæÍ$à‡äÁÜ.M
+ Xzß•÷wŠ}.0¯Kæ¹DLq¸sN*磥‡t¾ÆÆ•M£
±Ì…@!œV‰Aê�D#BU�™=L…&DÈ“sÅVrÆ;Dœ„Á¨UÔoö¹É‰KOè>g1Z—ÜÑQEîû‚‹Ö¦ªeçͪ[û°�æºÝŒÇSä·²ùÝf$0�ÆïCÂŒ	Ñî=DDRÍÛ†ëe!_g2„L]Ú‡0E®ö2°¨5©Z¹I)$« ü«óC8t
:ŽãQžcLÇäzb
*Ϊ%ÞBð0«ÍWÌçö+ÓÚó­Rhg¸·ƒuv‚á‘÷Çh•/F`¤tU¿xI¿ÞÏ õ�ýóøÇaòþ›dì½ñ=¥Lü/eÏ�²–UÙÉ�øWÖ(*Öãdm†kyDS¤ÔUd�hH!Ÿ)k
7v½Šå+ÉZÿjüXÑ
q‘ãqžc©cW‘5¢ bþ,Yhµ™àŠÙgÈšoíìöv®Î@6’Ýþ­’Ò…¸fUI%I{™ÿÜô:NâtÓ­f0]–T6©Y£&híÝŽs„»Ãüþ¿Š0a:#EX
+Ó®ð…Ç7&1G»É^þ
Æ�ÿ¼Ï7×v¦&ùÞÅ
ü_„Ù
+endstream
+endobj
+4590 0 obj
+<<
+/Type /Page
+/Contents 4591 0 R
+/Resources 4589 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 4596 0 R
+/Annots [ 4585 0 R 4586 0 R ]
+>>
+endobj
+4585 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 495.606 185.94 503.743]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4586 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 272.435 185.94 280.572]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4592 0 obj
+<<
+/D [4590 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+4593 0 obj
+<<
+/D [4590 0 R /XYZ 70.866 771.024 null]
+>>
+endobj
+4480 0 obj
+<<
+/D [4590 0 R /XYZ 70.866 593.476 null]
+>>
+endobj
+1490 0 obj
+<<
+/D [4590 0 R /XYZ 70.866 566.28 null]
+>>
+endobj
+4594 0 obj
+<<
+/D [4590 0 R /XYZ 70.866 446.924 null]
+>>
+endobj
+4499 0 obj
+<<
+/D [4590 0 R /XYZ 70.866 370.305 null]
+>>
+endobj
+1494 0 obj
+<<
+/D [4590 0 R /XYZ 70.866 343.109 null]
+>>
+endobj
+4595 0 obj
+<<
+/D [4590 0 R /XYZ 70.866 223.754 null]
+>>
+endobj
+4500 0 obj
+<<
+/D [4590 0 R /XYZ 70.866 150.25 null]
+>>
+endobj
+1498 0 obj
+<<
+/D [4590 0 R /XYZ 70.866 123.287 null]
+>>
+endobj
+4589 0 obj
+<<
+/Font << /F50 2307 0 R /F67 2878 0 R /F70 2881 0 R /F43 2258 0 R /F72 2883 0 R /F79 3175 0 R /F96 4060 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+4604 0 obj
+<<
+/Length 1223      
+/Filter /FlateDecode
+>>
+stream
+xÚÕYÉ’ÚH½óu„ˆ¡\ûrìÁ½Ø1«!úb;2PË¨íé¿Ÿ,U	’X¤vDÏ	�R/³òeåËÍA÷�ŸG�7w’ ƒ­R�¦Hl”BÚ2¬(MÐÇ®1½Ï£÷ˆÃ-.<—ýz—,â^ŸiÓ}»?-ãU¥ÉzåL;·£Î?
+–Ñ¢1Ø0�ÆËÎÇÏMàÞ{ˆÖ ï™å	ɱ®hØù³CB”g3€BÜš!�­&ÔÅM9ƒèÀ›¢˜ä‘�~~ÙÆÛmWÏÚƒg¥ÆÜÈ|aŸáÎúÍ�UFº[|ý) ‡w[_),à²O)¶Rzˆõ8�&§¢b+˯‰jðpçMŠ™±˜2³Ç‘ÔA¢÷´ChsÊPŸ	 )äï�Müw´	4G«‰¿ØÆùUä? 6¶ŠþËì¶óè¯#ÝðäcÏÀõ¦×§²›8ã±/•ìæRÍ‚eºŸóðÃÐ=ÆI÷[�I!Iû¤a&]Þ܇K�Ò«!°Ž¡$Â2zLt£M´ŒS€ ´»-佪Z•«­OU+UkevÕú®Œ%RÚb¡Ø)°æYx¿5
+[Zc&RÌ„-py·R3´±ãBQQ(=kiÑóŽZØœy=ùXü—Ô×ÉÓ8}‚Ê+ÅǸÀ‚7‰¯Ì@0ˆ´Ç­0ÇJ`KÏ-E`*éYŽ•ÅŠ‹B;¨á·™Ój~½îø/�o߬LŸý�“(

äá×›lòÁ	º¯·L@hÚ’îë1j%VŠµÏ™Â 3
	"„dv�¥oà’�4Íûf<˜GÉ
+º8ÙwòB»‡ÞÇ)6¹Ì|['ЬÕ1hšL“š¿ï0kô�¨
+-‹öÿWvATz'®·Fƒ‡›w¿Uä\hÐ̳
+V„ˆ °—	ìá»R‡¥ðã”7P
=A’Óâ§Á!¯ßl­ |kRaêäSH‹�6çä“K,û-vWA±bºè¸­z
+H©Õ
â+³IJV·�ÉÑ/B°€F¢Än·;EÚïøjš›y¯¦ùÐ}¥ˆÖ5€qÖÃë¹¾:È2QÂM²¦×WCÔ
+'‡
¡òLåÒiê¥óÑ5½xsDz)NËæc†óŠóuL ¢Ê�Åsâ6™Ý,f—jpxÖ{Q?Nƒ�Ãw÷ËäÒ-Î*0‡”¦ ÀÃJ­ÔlµÂI6Ÿc_§3hQjäĆcDaÎmý¦m‡á;4csò"̘ÄÆè³'X�5ÔPCÇÅæ$X}ä¹­k76‰¯Ì@PÂÚqÜ
+#pL åæ‚Ó;K1uïÙa:Áp#·Õú=RßO„ëm8²&³$ÍßtAx«(ãØ�ï‹Ù:t†t¾<ÁûµQ—)ix;Ú[axÚ©…ÝëÜJ˜´çx§Vïõißæ«yoè·’ø‚ãzâ÷\×òz}T%R¨eزv=»
Fí¤å^qÁ‹“–=˜´nW“ߧ·Ñfу²~¥Ñ™‹`ÉXÕˆµCÊP^ç€U5xàS'…YJL8½æ�œ8³i7÷NÁB`	³ª�0	‡yë>^ŘTÂ8óÕ½€Îÿ¡q‡™ŸgŽºn¼:Žñ?ЖÞ[
+endstream
+endobj
+4603 0 obj
+<<
+/Type /Page
+/Contents 4604 0 R
+/Resources 4602 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 4596 0 R
+/Annots [ 4587 0 R 4588 0 R 4597 0 R 4598 0 R 4599 0 R 4600 0 R 4601 0 R ]
+>>
+endobj
+4587 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 759.017 185.94 767.154]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4588 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 747.986 157.248 755.199]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4597 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 535.846 185.94 543.983]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4598 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 524.815 157.248 532.028]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4599 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 313.811 185.94 321.948]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4600 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 290.825 157.248 298.038]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4601 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 68.822 185.94 76.959]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4605 0 obj
+<<
+/D [4603 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+4606 0 obj
+<<
+/D [4603 0 R /XYZ 70.866 710.335 null]
+>>
+endobj
+4501 0 obj
+<<
+/D [4603 0 R /XYZ 70.866 633.716 null]
+>>
+endobj
+1502 0 obj
+<<
+/D [4603 0 R /XYZ 70.866 606.52 null]
+>>
+endobj
+4607 0 obj
+<<
+/D [4603 0 R /XYZ 70.866 487.164 null]
+>>
+endobj
+4502 0 obj
+<<
+/D [4603 0 R /XYZ 70.866 411.68 null]
+>>
+endobj
+1506 0 obj
+<<
+/D [4603 0 R /XYZ 70.866 384.485 null]
+>>
+endobj
+4608 0 obj
+<<
+/D [4603 0 R /XYZ 70.866 253.174 null]
+>>
+endobj
+4503 0 obj
+<<
+/D [4603 0 R /XYZ 70.866 163.88 null]
+>>
+endobj
+1510 0 obj
+<<
+/D [4603 0 R /XYZ 70.866 136.831 null]
+>>
+endobj
+4602 0 obj
+<<
+/Font << /F50 2307 0 R /F72 2883 0 R /F79 3175 0 R /F96 4060 0 R /F43 2258 0 R /F67 2878 0 R /F70 2881 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+4611 0 obj
+<<
+/Length 288       
+/Filter /FlateDecode
+>>
+stream
+xÚ•‘1OÃ0…wÿŠí¡ÇÙŽgE´Ý Ùªª
+‰ÓFJ]ÑD@ÿ=¦IP,L÷üΧ{ŸŽ`KvŸ³»…!p˜Y«!¯!%tÖBš)´ò
+6Ü¢”b¦RÇû¶Û•Boú]çC…‡¡µhZ?¨g_IÜŸ}(£¥%w™Øæ+6ÏÙ+“q5�ü^å:•@yd›-A{+ Ô™ƒ÷ëÏ#$F£ItÔ-¬Ù£ÛøÑÿßJ¤)ÿc¨š²èÇxóP
âT�Fq3ix{ÞE_ª	C=ú®+öã|ëa4Ö>ÎkâoB™H-q¼ÂN)ÿ‚6IËÿ0O§²¨R›Ü°&m,WÔ¥þQGÄ—¯[MX'C~\ö6^'üŒø	2ö{Ö
+endstream
+endobj
+4610 0 obj
+<<
+/Type /Page
+/Contents 4611 0 R
+/Resources 4609 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 4596 0 R
+>>
+endobj
+4612 0 obj
+<<
+/D [4610 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+4609 0 obj
+<<
+/Font << /F50 2307 0 R /F43 2258 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+4657 0 obj
+<<
+/Length 1643      
+/Filter /FlateDecode
+>>
+stream
+xÚÕZ]sÚF}çWhÚè„Í~¯vúä:ŽÛÄñPÃt:ãfÉÀK®$œ¸¿¾wµHB°eyðHÒ½gÏ={î.;S;ç�ßF�·ïv\¤¥dÎèÆQ¹R:JS$‰3ò�ë®Æ½Ï£ƒ�—ð\võý|ôúT¹ÝwÑdy„©—ΣÐÜÚ9uþí¸;dÑu‘K¹3¹í\ÆŽŸ}p ¢v�oÙ�·	Îà|á;vpŽ#*Ì©9䘥jÀ,	ryzУ¼ëÅÞm�q��n’!+B6"„ôŽ� $B!ªÅ
+aË1ÂR8ŠcDy,ÜÍ&2‘Q¢*e„œB(†S–’$H’Æ
+æ’''†Š­¢‘Ö¤š9�åR]íI�Åþ“ƽ>Ýå$]ÆÁ&>JħOÀ·Yð±»Æ‡ÇØ:Ϥ�H3×Ò$!ˆ"†�
Œq×[€tûwÓñM܃ct;žxË$øÄP…f�V˜˜¸Øé3˜‚Û�ó0íõeË„)BØ«&P6¹aêp%œ>ÐB®ŸÍhYJõ%Ô-\ NÃÙ=º¸g�´¢”¾Ö êô)c°·~ò»8úb†¼ní…µ9M#{<ÉøáÀ²“»â5“b(H>zª?¨•‹ÝÇêN©ážl×ÎóbXœ".ÔŽiÀ³©²ÃWˆ(�×ÒrÙ`šÃÝ䩉«þ€1âÄ­f^ùC©ÈÑ�=z[ô`¤›v³'éÊM‚8Žb{`(p*ºa!š³@›D=ad›•…T<S‡Ç8°Gr
&£™¥ýÊÐV…_ke£À{pæùJîj¥ZÏÇ|žÎ¼ü,™EË…oÏ¿EÓê|šÇîÞ÷ bpžy¸&¡HèOÆ4r \@—‘+Û¤¹c¦‹d<Éd2‡ècHá£Y>>Ãs<Í	¿Ú¡1NbÈ×çQÛJ¢~eµS:›'…81…åô4Ta7óIp|e,?ËiLÓfü8“èæe7·7‘¡7ƒÈOaÎuæäoßZGÄÑz«ý'Z¦w˼
XºÍ™’9Ý÷–å¾"5YçÖëÜPC…ÖWÖH~žß„~pcs@ß^üqv9Ï.ß�oL·ÊFðÁÙ Õ<ž–­™nPÓÁC'‹¥Ÿ£øi‹àÌœ
}&Þ¢Ðä^Vñ¶�‚½$\2fí¢å/Kn4ù¤I»�Å‹Bþ<€iy‹I» e£¶))Àdbád§kôÁwX…Õ®`³SQU½´~þ>šûµž²9ô“üÓÓÓau(׫ei3if–—÷2«‰dˆ¸.´)mÒŽù—ŒèÜ.wJ—óçͪà×ìŽ>‘
+1pçšÿQÚÈ#{óõ÷n=ßÄÁpæÅ�ÿ1x8ûžFh4I=¿F¥HÁ’/£²™I{õìïћ푗a2Ÿ†ŒÖðXÔÓàÍA˜`éB™n†$J�þx7ÌïÉöÓ…<g^I Ô5ß躶èÃ=¦y±Íþö;íȃ 
ëåä±o-& ãj2¦�zw®$bC,W�($à¶ZytcÕ¸<¶ª-ïî¢8
üó8ZÞ%­”¶<\íe’‡oËD
+“ésIX5s½µ¨X{•³²ÀâìjEW�Zô(gð•÷m°ü²˜OÀè_Yåf	^,åF³êÈ8;Íö�/ÇÙëÛÆØš0·Y{Íö$�ΞæÓ“Å´[Á\|‰Ž²Õ”¼6MéÑÎdy*[ãˆÁܪ¸ÙŠ?κŸqÚúbóÕZ’7yn$XÆöêIkÂÊ"QómVµÚ¢YÍ:—™6Àc³�H+ÂØCך0¼Åô°m	ˆ—‘½0>–‹Ï%r¯·P—7—¹YšYõO.—­TØáâÙûφÈܼ$f»Ÿvvoݼ÷Ó¬ù²>²Z}zÑN©(¢Rîcƒ­MÒÛÈ/oòVj)N0nªÁǶŠºþ°uHæÿíQ‡Êªfeu„[ë?~a%­·®WYÏÖçDùûÌ5ç�í…P|d¥ø+ˆÍ÷³?æÎâÞ‚¯#WC•u²Çofä�M?5‘ˆ*ÉÍ[F.8‚ÃzXþÎô<ƒØKƒâ�¬ygúPüœ«Çp÷ûÃÔ¼Síaãÿ€œn
+endstream
+endobj
+4656 0 obj
+<<
+/Type /Page
+/Contents 4657 0 R
+/Resources 4655 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 4596 0 R
+/Annots [ 4613 0 R 4614 0 R 4615 0 R 4616 0 R 4617 0 R 4618 0 R 4619 0 R 4620 0 R 4621 0 R 4622 0 R 4623 0 R 4624 0 R 4625 0 R 4626 0 R 4627 0 R 4628 0 R 4629 0 R 4630 0 R 4631 0 R 4632 0 R 4633 0 R 4634 0 R 4635 0 R 4636 0 R 4637 0 R 4638 0 R 4639 0 R 4640 0 R 4641 0 R 4642 0 R 4643 0 R 4644 0 R 4645 0 R 4646 0 R 4647 0 R 4648 0 R 4649 0 R ]
+>>
+endobj
+4613 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [69.87 396.461 212.775 405.232]
+/A << /S /GoTo /D (tls__client__send_8h) >>
+>>
+endobj
+4614 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [136.819 347.907 176.47 355.276]
+/A << /S /GoTo /D (tls__sal_8h) >>
+>>
+endobj
+4615 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [136.819 339.937 172.286 347.306]
+/A << /S /GoTo /D (tls1__3_8h) >>
+>>
+endobj
+4616 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [136.819 331.967 193.207 339.336]
+/A << /S /GoTo /D (tls__sockets_8h) >>
+>>
+endobj
+4617 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [136.819 323.84 201.576 331.366]
+/A << /S /GoTo /D (tls__keys__calc_8h) >>
+>>
+endobj
+4618 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 308.865 180.654 315.426]
+/A << /S /GoTo /D (tls__client__send_8h_ae6b7732d127485cfde84999ddfda0822) >>
+>>
+endobj
+4619 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [182.846 308.056 230.866 315.426]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4620 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [141.003 291.959 218.313 299.485]
+/A << /S /GoTo /D (tls__client__send_8h_aee3012ea76db9592b6f2e3fbacab3cc1) >>
+>>
+endobj
+4621 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [220.505 292.925 243.419 299.485]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4622 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [266.532 291.959 301.999 299.485]
+/A << /S /GoTo /D (tls1__3_8h_a42d4f54d23f86205a1fa590480181e0f) >>
+>>
+endobj
+4623 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [320.928 292.925 343.842 299.485]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4624 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 276.985 214.129 283.545]
+/A << /S /GoTo /D (tls__client__send_8h_a69bcfb300064b7f15307350e7d0124a5) >>
+>>
+endobj
+4625 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [216.321 276.985 239.235 283.545]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4626 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 260.079 235.05 267.605]
+/A << /S /GoTo /D (tls__client__send_8h_a3f2dea2ce7289f8bce2f6dfaac14f6c4) >>
+>>
+endobj
+4627 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [237.242 261.044 260.156 267.605]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4628 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 244.138 235.05 251.665]
+/A << /S /GoTo /D (tls__client__send_8h_abee16589c78e98f01d9132aa5ced2c84) >>
+>>
+endobj
+4629 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [237.242 245.104 260.156 251.665]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4630 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 236.168 235.05 243.694]
+/A << /S /GoTo /D (tls__client__send_8h_a1f55fbb70c8d9bb96502cbd91d1cdce6) >>
+>>
+endobj
+4631 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [237.242 237.134 260.156 243.694]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4632 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 212.258 201.576 219.784]
+/A << /S /GoTo /D (tls__client__send_8h_a1553ec144ff983a19fbac15287b5650e) >>
+>>
+endobj
+4633 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [203.768 213.224 226.682 219.784]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4634 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 196.318 218.313 203.844]
+/A << /S /GoTo /D (tls__client__send_8h_a75405e425d1a8734b4d448fa843f75ab) >>
+>>
+endobj
+4635 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [220.505 197.284 243.419 203.844]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4636 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 172.407 205.76 179.934]
+/A << /S /GoTo /D (tls__client__send_8h_a58576f34a1a3600c77e60d9831ac7174) >>
+>>
+endobj
+4637 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [207.952 173.373 230.866 179.934]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4638 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [287.454 173.373 310.368 179.934]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4639 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 149.463 189.023 156.023]
+/A << /S /GoTo /D (tls__client__send_8h_a2ae6b9eef1b8fa44f42aeede03d166c3) >>
+>>
+endobj
+4640 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.215 149.463 214.129 156.023]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4641 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [237.242 149.463 260.156 156.023]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4642 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 125.553 184.839 132.113]
+/A << /S /GoTo /D (tls__client__send_8h_ac3814152151d8ad90f5cf22869a7c5ed) >>
+>>
+endobj
+4643 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [187.03 125.553 209.944 132.113]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4644 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 109.612 184.839 116.173]
+/A << /S /GoTo /D (tls__client__send_8h_aeeee21f81f578cdfdbd7434f1f5ba619) >>
+>>
+endobj
+4645 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [187.03 109.612 209.944 116.173]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4646 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 93.672 205.76 100.232]
+/A << /S /GoTo /D (tls__client__send_8h_a5809bb963eb76b8aa7002bae244837aa) >>
+>>
+endobj
+4647 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [207.952 93.672 230.866 100.232]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4648 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 77.732 201.576 84.292]
+/A << /S /GoTo /D (tls__client__send_8h_a98a0f43e9052f8230efaee151d650195) >>
+>>
+endobj
+4649 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [203.768 77.732 226.682 84.292]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4658 0 obj
+<<
+/D [4656 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+4659 0 obj
+<<
+/D [4656 0 R /XYZ 70.866 771.024 null]
+>>
+endobj
+4504 0 obj
+<<
+/D [4656 0 R /XYZ 70.866 708.954 null]
+>>
+endobj
+1514 0 obj
+<<
+/D [4656 0 R /XYZ 70.866 681.758 null]
+>>
+endobj
+4660 0 obj
+<<
+/D [4656 0 R /XYZ 70.866 574.465 null]
+>>
+endobj
+4661 0 obj
+<<
+/D [4656 0 R /XYZ 70.866 466.934 null]
+>>
+endobj
+1518 0 obj
+<<
+/D [4656 0 R /XYZ 70.866 459.968 null]
+>>
+endobj
+4655 0 obj
+<<
+/Font << /F50 2307 0 R /F67 2878 0 R /F70 2881 0 R /F43 2258 0 R /F72 2883 0 R /F96 4060 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+4726 0 obj
+<<
+/Length 1874      
+/Filter /FlateDecode
+>>
+stream
+xÚÝZßs›8~÷_Á´/öM£JB0÷”ºv’öšÜžÎÍ´Ų͔€Ë�´þïo8LbœàÆwM±@ÚÕ~»ßî
+°6×°vÖy3î¼r¬™ÈB×Æ3ÍÀÈB3,ŠÑÆSíSW ¢÷N¨avc/š|“=»«hâØžƒÙ�¡ëÉìêZÎzwe(}Gö¾ŒßiŒéˆ:ÈKW³ˆíÆ�ïƒX#wBM™”iÎMçÓ¬MáÞ;
#Ý2µé“7ã°S‹yÚ¨óW7bPM ËÐÍâFAx½Œ	5Rñ°â03TÓ³Ë볎öéD`Pþg,C?.[´0á9
+"Õ¼ÊÐfþmàN˳Ó]f²àbó¤=�þ	ÿ\^zTýŒ9^kº5·8±]¡&ãD;!ˆÒl»¿eöGÄdÚftðÏøU6µážº®WÔK•÷AGò{*ã„pŒ„εØÛLïâÊ°ÎŽƒ~|såàgüt8C&±2H®†784\›d‚ë×/ÍŠK÷ß ¡˜#¬“*¼†�š�z«·vl·‚Ž0�,Ñ�¢{qndÆÚ�	#õFÇÆ1AŸ�N“xÑ‚ƒ[cÖˆfŠ:Ü7«†2jíÇõÃÛ¯Êi÷šÏñ\éÇ׶?
nZ°^N“»¬w}Y"לTÊVbµÆô˜Œç.2%n,£v�·ƒG-¥8'zêB‚"C4R:3VT¤nJ`r5j„^¼¡ëDÒŸöÓÐù £ÈžËýàÿ1šD0Ñ
ÊÚjC]ÇŒ&öÌç·ã	¡tâÕR¶³Ø-À¼Ñì1Ì»Ãý?ì·´n Á­&+ï_<~
¯,íD7²¸(úïÌK¢EÑó9"XTó­QOy&>6ÏãúS¶äòwÅÇ®¤Qvø†Øsq³~m^XûÍåÛ"<:Ì¢ŠC}9d±ã$¦séyA[A¿Ìs_Œž…G°‰ ½ß
yÿü,ÒÀ•ú×—-pPÊ—<ÐöBiOW{J9ÝOwÓ@¦±[u ¿Áåèâê²¥úÜ>´ŸlŒu†Š’ÙÒbU>&Ä@DT›H«¶‰¤˜[ÀŸz2ŒÛ
+õæMd«Á®Ê�ûZÒ�éi="¥’‘lÆ­cCê½\ý½œÚq[õ"°/"äór*ÓDÔbL®…Š�úaã8“èÐõÝhÑZHˆ©©íJ‡•ÒÞ°Xé	BªhÔlRz¤•NØÏ�¹„Ua»~[½Øº
+Ü·Û°ýÎàzÜ??½(šè˜#Æ«AGë3–N�¸�2tg«¶ #:bkžk‡Ö›rç§Þü~Hª+W	¤D“tÛï]œ}@gÈ`¼
+ö=ÉPgõ¾qt9ràO¯fwã­¬ä¯	fÊÒQR53«Ïo¿âp¼ñù¤­êÂÉ,n&Ž�DO=>ŠÛ2IžÛ•²EïD”F6z¿/pg%Aé{\+�Ï”&�IEñ%.Áª:yÄ[Ü×C¦ÞÃâ:‡­[ÙâàTÙ<‚ò7ÅNØî®–q�
DÉrÀ ùÙÈ,ñ�)Rš L”ÕQJ§B(ƒ®šeB^º¾ã%SÐPYàì‚Lt´x±6)!Èâü¾g'‘í58;ôŸ„Ò¹Í'eæÅÈàÖZ9•
Í•Þm¦ŒIÉjD Cu™Å]}ÎSRÑa8ÝÛåÝ
+Ôø¯²!_ñ¸G(8˜ÂËö#ex°§»ŒÏíén•fé´ÇQÄë!à²�‡p處oæÁY“QÙ3C–IÖϨ£Ÿk	†ú
3@‰APÅý°Î-v
{vmÏ�r_½oÿÙÝ…-ÐC œP
+Źz­šÆN¨d*$¾ïúós»£%tq‹>‚Wï`;W$s™˜ï#øª9ê&d"QAýÔq’…qâ©æ° ek¢	üy ¾§¸C~<·\\Θ
Æ:hRŠ(3‡C¿Žø¡Ì92mv&IÿÿÚƒàMf³ž®ÒM�ãî`ÑVÀ’J…®?­ƒ©	Y*žm€¨®Ó&ÁJ
•ªáÒÓŽT›ýå0-äƒ<s¨€1¯
+*,{:¢¦8(œC•ÇwóXƒÀ±×è5‰ W•9Uh%öZA?®+[™0”^Âú¿%LªÙôË°‚£]%ñ2ÉýÈIB¨ä·œ*ÅÈöyW�?Sà�V é.dì:õø·õªôþoÀßc*’Ÿ&VÓ½ªƒAc¯£|�“²×õ¡�,0[´”Ôêù@9…¸ê‡N>I�—‘œb$Õ-fÀcFkO.¼¹ÍHnËpMsqÞuöRÆå÷D®'*÷¹ö³&c"×I:±àˆlíÿð¡ º¸þ¦aîi4He„­�ÄB±÷~°1e{qaË8uŸqóì i�¯¸×Ÿ¡D
Á
+_o3Ž„ÈO0Τ/Cð¬i!y­²ë·Aj«Õ\�pt¥_Uñ_4ß}
+endstream
+endobj
+4725 0 obj
+<<
+/Type /Page
+/Contents 4726 0 R
+/Resources 4724 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 4596 0 R
+/Annots [ 4650 0 R 4651 0 R 4652 0 R 4653 0 R 4654 0 R 4662 0 R 4663 0 R 4664 0 R 4665 0 R 4666 0 R 4667 0 R 4668 0 R 4669 0 R 4670 0 R 4671 0 R 4672 0 R 4673 0 R 4674 0 R 4675 0 R 4676 0 R 4677 0 R 4678 0 R 4679 0 R 4680 0 R 4681 0 R 4682 0 R 4683 0 R 4684 0 R 4685 0 R 4686 0 R 4687 0 R 4688 0 R 4689 0 R 4690 0 R 4691 0 R 4692 0 R 4693 0 R 4694 0 R 4695 0 R 4696 0 R 4697 0 R 4698 0 R 4699 0 R 4700 0 R 4701 0 R 4702 0 R 4703 0 R 4704 0 R 4705 0 R 4706 0 R 4707 0 R 4708 0 R 4709 0 R 4710 0 R 4711 0 R 4712 0 R 4713 0 R 4714 0 R 4715 0 R 4716 0 R 4717 0 R ]
+>>
+endobj
+4650 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 758.991 189.023 766.517]
+/A << /S /GoTo /D (tls__client__send_8h_a001b7d8bce6fea3da1d821e89b102e36) >>
+>>
+endobj
+4651 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.215 759.957 214.129 766.517]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4652 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 744.016 197.392 750.577]
+/A << /S /GoTo /D (tls__client__send_8h_a9c81ed54086d15ab4982b68ef57af9de) >>
+>>
+endobj
+4653 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [199.583 744.016 222.497 750.577]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4654 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [245.611 744.016 268.525 750.577]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4662 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 727.11 209.944 734.637]
+/A << /S /GoTo /D (tls__client__send_8h_a1b05bed69596b34f80fc460710bd1af3) >>
+>>
+endobj
+4663 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [212.136 728.076 235.05 734.637]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4664 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 712.136 201.576 718.696]
+/A << /S /GoTo /D (tls__client__send_8h_ae9f1efa7bf9cc9f1d167289728e114aa) >>
+>>
+endobj
+4665 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [203.768 712.136 226.682 718.696]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4666 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [141.003 696.196 193.207 702.756]
+/A << /S /GoTo /D (tls__client__send_8h_a08dee8d5bd3df471b1da1ed77a4b9371) >>
+>>
+endobj
+4667 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [195.399 696.196 218.313 702.756]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4668 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [141.003 679.29 193.207 686.816]
+/A << /S /GoTo /D (tls__client__send_8h_a3426e5597c2646607d74ba45881331a1) >>
+>>
+endobj
+4669 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [195.399 680.256 218.313 686.816]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4670 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 663.349 218.313 670.876]
+/A << /S /GoTo /D (tls__client__send_8h_a5abfbe6d2e0753c1e9aee4c3731a75cf) >>
+>>
+endobj
+4671 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [220.505 663.506 268.525 670.876]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4672 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [408.799 664.315 431.713 670.876]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4673 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [450.642 664.315 473.556 670.876]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4674 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 640.405 189.023 646.965]
+/A << /S /GoTo /D (tls__client__send_8h_a83d64f2525fe60c359db5f2e6502136f) >>
+>>
+endobj
+4675 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.215 639.596 239.235 646.965]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4676 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [279.085 640.405 301.999 646.965]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4677 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 624.465 209.944 631.025]
+/A << /S /GoTo /D (tls__client__send_8h_ae7c449e4c9fd2eae231da36b4fdaed4d) >>
+>>
+endobj
+4678 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [212.136 623.656 260.156 631.025]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4679 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [350.218 624.465 373.132 631.025]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4680 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [392.061 624.465 414.975 631.025]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4681 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.74 616.495 180.654 623.055]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4682 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 600.554 184.839 607.115]
+/A << /S /GoTo /D (tls__client__send_8h_a47426f5d0addf1b5276403d20cb57f43) >>
+>>
+endobj
+4683 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [187.03 599.745 235.05 607.115]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4684 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 575.678 201.576 583.204]
+/A << /S /GoTo /D (tls__client__send_8h_a1970aa3fae4d5a9d0166f9975420c8be) >>
+>>
+endobj
+4685 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [203.768 575.835 251.788 583.204]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4686 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 552.734 214.129 559.294]
+/A << /S /GoTo /D (tls__client__send_8h_a9cab659f1afb869e0553aec979dbef57) >>
+>>
+endobj
+4687 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [216.321 551.925 264.34 559.294]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4688 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [304.191 552.734 327.105 559.294]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4689 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 536.794 255.972 543.354]
+/A << /S /GoTo /D (tls__client__send_8h_a7c39ce6582f79fc4db8995020c582ea2) >>
+>>
+endobj
+4690 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [258.164 535.985 306.184 543.354]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4691 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [346.034 536.794 368.948 543.354]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4692 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 519.887 230.866 527.414]
+/A << /S /GoTo /D (tls__client__send_8h_ab206e386ec23f927c695b39cb165bd33) >>
+>>
+endobj
+4693 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [233.058 520.044 281.078 527.414]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4694 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [375.324 520.853 398.238 527.414]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4695 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 495.977 222.497 503.503]
+/A << /S /GoTo /D (tls__client__send_8h_a6c68dc8d23117860735e6d2a37733f1b) >>
+>>
+endobj
+4696 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [224.689 496.134 272.709 503.503]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4697 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [141.003 480.194 209.944 487.563]
+/A << /S /GoTo /D (tls__client__send_8h_acbe3332ca8c08818211e307c5ddb48c0) >>
+>>
+endobj
+4698 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.489 262.686 186.691 272.955]
+/A << /S /GoTo /D (tls__keys__calc_8h_a725431b0b8841d5799e2e305a95a24f8) >>
+>>
+endobj
+4699 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [190.177 263.498 243.994 273.161]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4700 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.489 234.764 166.445 245.14]
+/A << /S /GoTo /D (tls__keys__calc_8h_a4577af1f5021f2b06b2f9331641a0d1e) >>
+>>
+endobj
+4701 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [169.931 235.683 223.749 245.346]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4702 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [264.611 236.656 288.534 245.14]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4703 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.489 206.949 175.914 217.531]
+/A << /S /GoTo /D (tls__keys__calc_8h_ab4626ca7ee28b8311899148e788712c3) >>
+>>
+endobj
+4704 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [179.399 207.868 233.217 217.531]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4705 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.489 180.945 151.176 189.716]
+/A << /S /GoTo /D (tls__keys__calc_8h_add8404a61a7878b2263a0f646a4ff621) >>
+>>
+endobj
+4706 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [154.662 180.053 208.479 189.716]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4707 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.489 151.319 202.14 161.902]
+/A << /S /GoTo /D (tls__keys__calc_8h_ac637f846d7e27564dcbb7fb60c48d195) >>
+>>
+endobj
+4708 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [205.626 152.238 259.443 161.902]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4709 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.489 123.612 173.322 133.881]
+/A << /S /GoTo /D (tls__keys__calc_8h_a78bfe1942bb3e34bc537e89f8f23ad87) >>
+>>
+endobj
+4710 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [176.808 124.424 230.626 134.087]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4711 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [271.488 125.397 295.412 133.881]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4712 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.489 95.69 203.323 106.272]
+/A << /S /GoTo /D (tls__keys__calc_8h_a1ebed486a752d2d46461470742670741) >>
+>>
+endobj
+4713 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [206.809 96.609 260.627 106.272]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4714 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [301.489 97.582 325.412 106.066]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4715 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [342.496 97.582 366.42 106.066]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4716 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.489 67.983 184.243 78.457]
+/A << /S /GoTo /D (tls__keys__calc_8h_a039d437970a1f493377a08cb31d96dec) >>
+>>
+endobj
+4717 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [187.729 67.983 214.405 77.946]
+/A << /S /GoTo /D (structcrypto) >>
+>>
+endobj
+4727 0 obj
+<<
+/D [4725 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+3035 0 obj
+<<
+/D [4725 0 R /XYZ 70.866 473.914 null]
+>>
+endobj
+1522 0 obj
+<<
+/D [4725 0 R /XYZ 70.866 457.539 null]
+>>
+endobj
+4728 0 obj
+<<
+/D [4725 0 R /XYZ 70.866 303.991 null]
+>>
+endobj
+4724 0 obj
+<<
+/Font << /F50 2307 0 R /F72 2883 0 R /F43 2258 0 R /F26 2949 0 R /F70 2881 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+4790 0 obj
+<<
+/Length 2015      
+/Filter /FlateDecode
+>>
+stream
+xÚÕZßs£6~Ï_Á#ž6ª~ïç’ænæ»7Ó¹ët(&6S\ÀwÍß0Žá‚“ö%EÒ®v¿oµZ�­……­wog?]l9È•’Y³KaäHi)—"I¬ÙÜúl»tôûìg‹Á¿—0.o½WÁè’*ǾŠýí:ˆ2/ãHw½˜Ì.þ¾ Ð[d7£ã ‡rË__|þ[søßÏÌè:Ö·¼çÚâ‚!Áü^YÓ‹_.p¡eó™k­´ÖXºJkM°‹\ÐMIm…Þ·Q˜…^Vhé™Ç8]2l?n²¸hˆ#èMÿd(W¾”òÓ5¨²7Ì%¥ˆºÌº$1Â�ˆ/”ŠÚ ëó¥Òþ:¢ÂŽÃyñ?m†dQØã>ï¥Eo7sP¯¢ÑxDì½:͉õ�/X࣓Ú~eqõ¥Pi�…$<´µ8G»¥'¿`Ìt÷Æ‚9rRök•~|z9±Ÿyó§ä2
˜â}ÄÞ
 ’9]VJË>·ŸÀƤ6ç~îè.)Vm
	Ž–füÛm¸šŸrlÈ…‘Ÿš¬U¥HU£ó¡NHD텺ή ¢¯{â¶\kgo˜†ý'æ%[ñ#ªõI?Næ?Žö<£…y»ý4"àŠ—&°ÖF0�`LìSn
Kóøáf$#ñ|šå-TGϦ#zRpGœq†8ï3�€îÜ'¹Ê©#nœû 7¿	7ÿnI¼.†D£‚¤›m‰³Á0ç›i˜àèÑѼ>Ð[èîIÌ«>ý`�nC�J^–Ó šï¡©w¹gEœÙûéi�¦e¾qˆŽ‹”ÓkÃ)f}.0‹~è=¦Ωm§òj�Î@-Jס1ìàà··ãó{ÀɆç}àp;ì
NªXŸÔdHpò³�S"ÅU
N58a»
6Ùð¨TÇBæ«AR'ZnÞ;H>Nï¾�:êŸ!ãˆàï‰�Ý33€pi=ZÝ×WiL¿I‚Ëté%¥+þÒ>ôŸÇ¦ÛwYÙ}�n×d|ðÒ¬œ¯Õïi'ÅØoa¶,¦}-Æ|ñcà\+Æ�5&žy]=NÁ…ùÒ“ÙÛ2{Üäx}~ò†‘ªOXŒ>W*WˆõÚ.']ÆÓb	".é#÷íÝd�µözß™nÃÙ†Öè6ù§ØÝý.{ŒRånÄë´ÛqçmÍKrôÚ“ócTi|ÐS4Êgvä­Lsë
¥õÑ¥-̼8ßC†�¼%ëu�¹ \â8ìÿ@Äñd6ˆdÁáýV<ùÐ#rÄ�l\ﶤ´YƒQít}éÔ¤AŒˆÀs³iž&È	³D‚’ÿÅin:+úìÄ“×{Ó}w¢1æ>Éb×�¥›heƒ";^@ën›!µÅŽEÄ!;â\2Ní_Ó “<sD
|›ãIUWj�WaQa¬ˆ�æxS¦·úúâ1r…[ج)Ó±g#/fú°;õëAáª7
Ê¿ÙlV¡¯ïy€îÑô섈bú_>!ïO¯o†Èy¿=p¡NÏÌ»ÇîÇLOÄtg’Û{TE¦¡$Ÿþ
d¬­ÍKƒ4;9ÿô�*í÷�€öCû³iÚëç
íucIûRlÛA wHm­Ã“þûü¯ù-å¼PÉäÓó]
f°ë~gýþÙÌôru¦Úqh…Em죾r	’}¹KØëZ©ìàüdRš¢Îeµá`ôg¯NV—�©¨|9Ø.ñ”¯1H®¼Ì;„�:×1J2䲞ÁpÝíB¾Úkûšs¦áIÙ‹AÝ38Ê)RJÕCº	bAZøm‰vtã(ÓÃâijkÔhÑÁ°¬!lÓÝõjÚ6Av,€6«¾�»ÍÂípS¢ÎK—¯œcµ3F—C¼¬=Hž/³Ï‘g@Òô<ˆ4
+IÏsì¡œ!IÝã—ÅËÃÓÀ
ªYC…YÕk’ýaıË 
Jð—-­Ü3Ô‡ItzŸ
@-q.jõØ‚ËëWØQõ-t�ky¼INr,
Þjñl‚éïë¨ìE°ñ§éí»ç
+†Ý°'±_¡¨8žÜkXÏ>Þu§˜Ã�k¦‡[áÿ3•î\yÙ6iäV›$Îb?^økÜZ®€æ7C ™ ÌÜÿ8ªî&¿�$½Â®è³SŒsêvDz�À=ñmÑÞëùk=e(`¾ÒÔ[Ù€‰Ði-RÏÃE˜•—/G ŸÆë²8õ~J+Z7�Vöƒµ¹ki?œÿù÷ÆD_2ºÒ	\„a­àO0°Y«D„!`Œí« óÂU™	^0u¸)?5nXkã!&ž�ÒfÔNõƒRºÝlâš5¶‘¯§o9{cD…þ©ÚmR5d3ÄTqü3¢ÜÞfË89âóšâ%¸úø)ÌÂj:0õã,kµ_1ôÀ~´°ßu±ž#k7¾ÿ†UHŒ«Í´óE…ÙL£-É]~¸
¿êˆR‚°L-…\…I‹C¾êàŠ™j³˜ö§j’ ®ôñ™ WÈ�‹�ÔÁ{=„BÌiá,Øpß	€Hd£”ز&æ€ÿ+5‚ráõ¸O¤¶�ö©‹u«Ÿ¤¯Â´¥äÛ%ejû°^ˆ½¤ÏwõåWÿQ%y­GBpxBà),û.ˆ‚$¯üäÊüY©@\ÅyIáq¡aaQSÇ
u›}µ
+endstream
+endobj
+4789 0 obj
+<<
+/Type /Page
+/Contents 4790 0 R
+/Resources 4788 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 4596 0 R
+/Annots [ 4718 0 R 4719 0 R 4720 0 R 4721 0 R 4722 0 R 4723 0 R 4737 0 R 4738 0 R 4739 0 R 4740 0 R 4741 0 R 4742 0 R 4743 0 R 4744 0 R 4745 0 R 4746 0 R 4747 0 R 4748 0 R 4749 0 R 4750 0 R 4751 0 R 4752 0 R 4753 0 R 4754 0 R 4755 0 R 4756 0 R 4757 0 R 4758 0 R 4759 0 R 4760 0 R 4761 0 R 4762 0 R 4763 0 R 4764 0 R 4765 0 R 4766 0 R 4767 0 R 4768 0 R 4769 0 R 4770 0 R 4771 0 R 4772 0 R 4773 0 R 4774 0 R 4775 0 R 4776 0 R 4777 0 R 4778 0 R 4779 0 R 4780 0 R 4781 0 R 4782 0 R 4783 0 R 4784 0 R 4785 0 R 4786 0 R 4787 0 R ]
+>>
+endobj
+4718 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.489 745.864 200.203 756.338]
+/A << /S /GoTo /D (tls__keys__calc_8h_a7c80470edcd5c41df2776758a8f73bf7) >>
+>>
+endobj
+4719 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [203.689 745.864 230.365 755.827]
+/A << /S /GoTo /D (structcrypto) >>
+>>
+endobj
+4720 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [247.036 747.648 270.96 756.132]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4721 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [287.407 747.648 311.331 756.132]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4722 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.489 719.244 212.146 729.719]
+/A << /S /GoTo /D (tls__keys__calc_8h_ac1ec60c7aa252ae5b0f77a7373996efa) >>
+>>
+endobj
+4723 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [215.632 719.244 242.308 729.208]
+/A << /S /GoTo /D (structcrypto) >>
+>>
+endobj
+4737 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.489 692.624 197.702 703.099]
+/A << /S /GoTo /D (tls__keys__calc_8h_a51906ad75db829ff0f4d9185498c07bc) >>
+>>
+endobj
+4738 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [242.1 694.409 266.024 702.893]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4739 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [287.77 692.624 314.446 702.588]
+/A << /S /GoTo /D (structcrypto) >>
+>>
+endobj
+4740 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.489 666.005 218.638 676.479]
+/A << /S /GoTo /D (tls__keys__calc_8h_a8f0a6b45ba2baf667a3f3db7f2c45817) >>
+>>
+endobj
+4741 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [222.123 666.816 275.941 676.479]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4742 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [316.803 667.789 340.727 676.273]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4743 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.489 639.385 218.127 649.86]
+/A << /S /GoTo /D (tls__keys__calc_8h_ae5bb549f97d541ccc349f71498003fc3) >>
+>>
+endobj
+4744 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [221.613 640.196 275.43 649.86]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4745 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [316.292 641.169 340.216 649.653]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4746 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.489 614.469 162.958 623.24]
+/A << /S /GoTo /D (tls__keys__calc_8h_a8806c3d2593fca6f70e1765af93bbbc6) >>
+>>
+endobj
+4747 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [166.443 613.577 220.261 623.24]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4748 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.489 586.146 190.762 596.62]
+/A << /S /GoTo /D (tls__keys__calc_8h_a2f62f573a6b6cabe93ec2147d4823c6a) >>
+>>
+endobj
+4749 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [232.99 587.93 256.914 596.414]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4750 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [285.322 587.93 309.246 596.414]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4751 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [331.494 587.93 355.418 596.414]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4752 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [383.826 587.93 407.749 596.414]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4753 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.489 561.229 190.636 570]
+/A << /S /GoTo /D (tls__keys__calc_8h_a657bc15591cfddc543c9908e454cefb1) >>
+>>
+endobj
+4754 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [232.865 561.31 256.789 569.794]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4755 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [273.729 561.31 297.653 569.794]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4756 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [319.901 561.31 343.824 569.794]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4757 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [378.025 561.31 401.948 569.794]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4758 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.489 534.61 215.374 543.381]
+/A << /S /GoTo /D (tls__keys__calc_8h_a6c05578c90c439bd0ff35fdcdc02b39b) >>
+>>
+endobj
+4759 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [218.86 533.718 272.677 543.381]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4760 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [313.539 534.691 337.463 543.175]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4761 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [359.711 534.691 383.635 543.175]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4762 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [405.883 534.691 429.807 543.175]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4763 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.489 495.328 214.056 505.802]
+/A << /S /GoTo /D (tls__keys__calc_8h_acbeac5740057ccd837c02450d4922d71) >>
+>>
+endobj
+4764 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [217.542 496.139 271.359 505.802]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4765 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [312.221 497.112 336.145 505.596]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4766 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [364.544 497.112 388.468 505.596]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4767 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [417.36 497.112 441.284 505.596]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4768 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.489 457.749 193.093 468.017]
+/A << /S /GoTo /D (tls__keys__calc_8h_ab53120ef3350624efa158b055849babb) >>
+>>
+endobj
+4769 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [196.579 457.749 223.255 467.712]
+/A << /S /GoTo /D (structcrypto) >>
+>>
+endobj
+4770 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [262.36 459.533 286.284 468.017]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4771 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [114.215 432.914 183.939 441.604]
+/A << /S /GoTo /D (tls__keys__calc_8h_aaa92ece79610e718653811665708f83f) >>
+>>
+endobj
+4772 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [226.167 432.914 250.091 441.398]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4773 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [270.671 432.914 294.595 441.398]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4774 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [322.322 432.914 346.246 441.398]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4775 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.489 406.294 184.297 414.984]
+/A << /S /GoTo /D (tls__keys__calc_8h_a8be08a8f8802cf8a4c21deb5db506394) >>
+>>
+endobj
+4776 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [226.526 406.294 250.449 414.778]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4777 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [271.03 406.294 294.954 414.778]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4778 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [323.173 406.294 347.097 414.778]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4779 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [114.215 379.594 211.007 388.364]
+/A << /S /GoTo /D (tls__keys__calc_8h_a024aaf0b72dbcf480a7d9107d286f716) >>
+>>
+endobj
+4780 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [254.859 379.674 278.783 388.158]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4781 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [323.132 379.674 347.056 388.158]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4782 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [363.996 379.674 387.92 388.158]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4783 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.489 352.974 208.425 361.745]
+/A << /S /GoTo /D (tls__keys__calc_8h_a5f4c6740b2154c2414a0984653bb2356) >>
+>>
+endobj
+4784 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [253.272 353.055 277.196 361.539]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4785 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [294.136 353.055 318.059 361.539]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4786 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.212 353.055 369.136 361.539]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4787 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 99.442 185.94 107.58]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4791 0 obj
+<<
+/D [4789 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+1526 0 obj
+<<
+/D [4789 0 R /XYZ 70.866 323.412 null]
+>>
+endobj
+1530 0 obj
+<<
+/D [4789 0 R /XYZ 70.866 221.275 null]
+>>
+endobj
+4729 0 obj
+<<
+/D [4789 0 R /XYZ 70.866 185.729 null]
+>>
+endobj
+1534 0 obj
+<<
+/D [4789 0 R /XYZ 70.866 159.134 null]
+>>
+endobj
+4788 0 obj
+<<
+/Font << /F50 2307 0 R /F70 2881 0 R /F43 2258 0 R /F26 2949 0 R /F67 2878 0 R /F72 2883 0 R /F79 3175 0 R /F96 4060 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+4814 0 obj
+<<
+/Length 971       
+/Filter /FlateDecode
+>>
+stream
+xÚÝXKoÓ@¾ûWìіȲ³ï=‚ „T¹AUÇI#è¿gìµÛ¸NÒØŽ8p¨²Þ8ß<¾™ovËÈœ0r¼Ï/#–:­ψaÔjMŒãTOÉ—PSшæËÍÍ÷$ÞmnâÉ2¦·þ‹‹Å2ñ«OÉ,&Y’ÆIt=~G¤T�öJ4'ŠÝàõ8øn2÷F­¥–K¯‚/׌Lñ»w„Qá,ù]¾¹"R!˜,À–äsð1`U ŒrU,‹�*,mö„¥�ZYÅõ!â2œd“U’'YnJÏjȽ¢y�ŸG<e(wêÞÃ3ceZ#Ç0ðmAè
+¢L‰i0�6$G(A�0>%›d³Y¬Ó6C€`zFÆ8ê4-ç·U
�ßö‹Úÿ�gÑënçÛ,iûǹA|Þÿ6?Ý;ñ4ÇÝ1¶¢Vš:az‘rÊ1Œ±0Û¦é"�¿™ln¿2ÅðŠÜ Ó˜
+êƒˆ‘‘ÀºWÒcüZ/¦ÑH7î7
+�ª	Šh²y֧ˀ`ëH£ÈCÓ
+ɺ٭™ºwÐ
·ã†*¬ªà+cÂ{éôÎK®$…5
+ñÙ
g8ÒšJ\zß”‡XÇùdzÌ+n©vü¯LýÎÕžä:ª´|©	hT<’e©‘–Œ¸D…óﾈãíªÐÊír’WÅï}.—‹4_W›é|�,ù‡[ä
+¨¬¡z�$YçËEôV;%%z­ŽV±q8'àp'Ãðj§°z•8‡Ø)¡(€>QìúÙÝ«u
ÃCµN!áÆvw¯M"1Œß!½`17ê,ür †ñ�n=Àl?“û©Ýµ9I[�\·ñ·¤nìx¹�&÷mþÐ×G¨îìo›(@Í=ŒìîÇš’:&cM´ÇÚÛ«›:2ØÞ^umêߌ¶=á‹Bnžœ%Z—ªþÔ,AÁ�Iº‰½œ,~ä;¥V®fÙzåWE–Ê"�8‚Ìf‘(Îð‘báÉ“†qÝ{Ò,ƒ¹ræ†á¥H`/+¤àR$8*¾”'Žšž†÷
+RÃò™ÎÕÝýkóƒBÙawÇ8(@ÛMÔiªHÖT^r/ÒéIúÓ>X'þ·ÿµôT×hÌjFo¥;uÅД“äiæý¯éP\¿`X©
Ãðr\—Gƒ3È	L–u'ÊIOÃ{å¤aùLrÒÝ¿6?¡˜ÆqwŒºìÚg#E™€.ÿ»ª•Iã¯�;G#Eµ®†ée’&ÎôéN/Ýùõ«uÑQîæ…h…Iú¸-þKho"
+endstream
+endobj
+4813 0 obj
+<<
+/Type /Page
+/Contents 4814 0 R
+/Resources 4812 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 4820 0 R
+/Annots [ 4807 0 R 4808 0 R 4809 0 R 4810 0 R ]
+>>
+endobj
+4807 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 611.084 185.94 619.221]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4808 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 600.053 157.248 607.266]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4809 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 389.049 185.94 397.186]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4810 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 192.491 185.94 200.628]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4815 0 obj
+<<
+/D [4813 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+4816 0 obj
+<<
+/D [4813 0 R /XYZ 70.866 771.024 null]
+>>
+endobj
+4730 0 obj
+<<
+/D [4813 0 R /XYZ 70.866 708.954 null]
+>>
+endobj
+1538 0 obj
+<<
+/D [4813 0 R /XYZ 70.866 681.758 null]
+>>
+endobj
+4817 0 obj
+<<
+/D [4813 0 R /XYZ 70.866 562.403 null]
+>>
+endobj
+4731 0 obj
+<<
+/D [4813 0 R /XYZ 70.866 486.919 null]
+>>
+endobj
+1542 0 obj
+<<
+/D [4813 0 R /XYZ 70.866 459.723 null]
+>>
+endobj
+4818 0 obj
+<<
+/D [4813 0 R /XYZ 70.866 352.43 null]
+>>
+endobj
+4732 0 obj
+<<
+/D [4813 0 R /XYZ 70.866 290.36 null]
+>>
+endobj
+1546 0 obj
+<<
+/D [4813 0 R /XYZ 70.866 263.165 null]
+>>
+endobj
+4819 0 obj
+<<
+/D [4813 0 R /XYZ 70.866 157.575 null]
+>>
+endobj
+4733 0 obj
+<<
+/D [4813 0 R /XYZ 70.866 95.506 null]
+>>
+endobj
+4812 0 obj
+<<
+/Font << /F50 2307 0 R /F67 2878 0 R /F70 2881 0 R /F43 2258 0 R /F72 2883 0 R /F79 3175 0 R /F96 4060 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+4829 0 obj
+<<
+/Length 1194      
+/Filter /FlateDecode
+>>
+stream
+xÚÍXI�ÚH¾ó+êhK¡RûrœaÒ�D#õLš[�<Æt#�é“tÿûyå²i°
›Œr@x©úÞò½­LÐ"èvôûtôöFd°UŠ£éi‚�RH[†EÓúX~�~D^q¡`_ñôf±LÂ1Ó&øcoWIšGùb�º¥£wÓÑ·…•Ñ¢1Ø0�âÕèóW‚fðî#DkÐ�bå
+	ɱ®—è~ô÷ˆœÔRQL*5¦3,Ã1%„Ù6MéÃûhóøá.KB*ƒ‹tö…H?êô|{£ÒØjB(AcN±‘Âã}_/fáXB9ÿÂ�{K³‡ÒäO·#ª	-јRl¥ò�Ó?ïÿÙ$›Må§Ê@PÄÖ‘s#+G!„{m­ª-²˜Ð5Ð=£¸ÁLêW¬Êrpó«;ÇT9ïq4fHòk‹�Ö�’`»Œò’ê<s¢tgàf,žrÿâ|ã¯"çw1ÏÖ+õáÎÿÿ2@›ÏCN‚$%	Þìí
ž`‰wp÷NìÆ9º?çF¥kV
ŸŒc¯
+{þ
+™¢,Z%9@Pl‹Y¥¶œvÅ,²˜•»˜½2†‹o‰”ÐXSÙ…
«y¢HÝH�!R’bNØAØ4í§fhoÁ�à¢ÔbkiSrþXF¤„¿¨tñ7¹�¯mœo!&ôc"\±úò^âørŒÖš&•À’ðFMSeM˳"õ ë\-:£”ÉýRÖD¸°ŠÉÿ§Š½iQfÏÆ1Ô,
—
ÝÖqͺ´b+ËÎÐjW3ïŽø×b édQ%kaEõn›?mËšo³Úæ~
ý2DËmѲ.(sªw™’a
w„/sIDh{
+ÃðeNp‹Tˆ+”9!ÖÆžYæz
+>Zæ’‡–9ñR¦‡~‡üû0Ža”C2Hqªbˆt{’cf1×¢–¥-ìöyœÝºÌ¨¤q]Kj_€|~¯a&^¸É±-ßÛ	¿XåC²‚wCœ&ürŒÖ¾Æ´Î}M7gõû—&_Ägv·¶A½�ókNê¿Z�;Wó±?]Ÿw×칓h×Î0›§$^DËò¦
+•ý.—›vµº8{¬36°lSõñåÒú}²\®ËãÌܵÞò@ãJ<ì|©î¿m“j£ÊO7c„PU‹ˆ_Å
+,0­¬ýÙƒ£nHí<«0Æ05¼½fÃðM‚�‰V×ѸxrÖ ÐSðÑVÑ�<t°ê]õé!`©ÖÃ(„á)¦Æ¼h¯1PË çOÍ
=E%·!s7tôþZ�hc÷rý˜q¬â$»Ã0Jvµ—铦ÉO²«-ÖV×úB»ýDg·.óBv‹‰kÏy’ºß´3~±Î‡l
„†‰qã—c´Žy®
3Õü|aÊ1<–O\¡ƒvø”¯'àÅâ�ûœw{Lb8Uí{môœ÷ûš]ãçÅ®†¼É¹ãKg7–“î‡ûÌ+Vf„�T!á 
ƒ²�ЋÊÁà6I“Æ¡YíÛêKõ)¿Ü—‡‚¤$Ý×ñ?)š÷
+endstream
+endobj
+4828 0 obj
+<<
+/Type /Page
+/Contents 4829 0 R
+/Resources 4827 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 4820 0 R
+/Annots [ 4811 0 R 4821 0 R 4822 0 R 4823 0 R 4824 0 R 4825 0 R 4826 0 R ]
+>>
+endobj
+4811 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 715.207 185.94 723.344]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4821 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 518.649 185.94 526.786]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4822 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 507.618 157.248 514.831]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4823 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 295.478 185.94 303.616]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4824 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 284.447 157.248 291.66]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4825 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 272.492 157.248 279.705]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4826 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 68.643 162.03 76.306]
+/A << /S /GoTo /D (structcrypto) >>
+>>
+endobj
+4830 0 obj
+<<
+/D [4828 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+1550 0 obj
+<<
+/D [4828 0 R /XYZ 70.866 771.024 null]
+>>
+endobj
+4831 0 obj
+<<
+/D [4828 0 R /XYZ 70.866 678.588 null]
+>>
+endobj
+4734 0 obj
+<<
+/D [4828 0 R /XYZ 70.866 616.519 null]
+>>
+endobj
+1554 0 obj
+<<
+/D [4828 0 R /XYZ 70.866 589.323 null]
+>>
+endobj
+4832 0 obj
+<<
+/D [4828 0 R /XYZ 70.866 470.075 null]
+>>
+endobj
+4735 0 obj
+<<
+/D [4828 0 R /XYZ 70.866 393.348 null]
+>>
+endobj
+1558 0 obj
+<<
+/D [4828 0 R /XYZ 70.866 366.152 null]
+>>
+endobj
+4833 0 obj
+<<
+/D [4828 0 R /XYZ 70.866 234.949 null]
+>>
+endobj
+4736 0 obj
+<<
+/D [4828 0 R /XYZ 70.866 153.164 null]
+>>
+endobj
+1562 0 obj
+<<
+/D [4828 0 R /XYZ 70.866 126.67 null]
+>>
+endobj
+4827 0 obj
+<<
+/Font << /F50 2307 0 R /F72 2883 0 R /F79 3175 0 R /F96 4060 0 R /F43 2258 0 R /F67 2878 0 R /F70 2881 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+4842 0 obj
+<<
+/Length 1072      
+/Filter /FlateDecode
+>>
+stream
+xÚÍXËr›JÝë+f)ª¢É¼ËÄI\N6÷Æ*o’”‹ ,S‘�ƒðMü÷·aB(UYØBÃpúq¦Ý"h‰ºœ¼�O^�l•âh~‡4ÁF)¤-Ê¢ù}™*Ly0cÚLóÕööGP9}ÚÞFá*Â÷îƇd»«Ïñ]@É4Îâ4Šƒoó�HŽ¥æ`¯D³²X�¼ŸO~N(,DwF�Á†	­'_¾´€{ÁÜô«Ü¹FB˜(ÀVèzòï„Ô�õv ŠbREr•&yæÞÕÐ}\dÁŒ“éÓC¾ñ›¶ÀÒï—¾Ìda§ø¸;J×ì4c¸Ušø'`bfá:Îã, tºuÞÏΰ™Å\ì	›B5¥»°ÏŒQ¤H‡Ĭ6L%õeÒuãôhÌ$‹-g.#m¾�ÅÆò�,[…‰nÚSGã›÷oÞ¹+8Š;Ž“�¿=³Üv��Y®Í鶉
BG’{:ÆÞÂVœbî*3lƒ%„LPE=PW® Üç_‰$ðG‹\
éÀ1¶šP_
j¤¯€ÿ6É"˜©Þ
+R]Þ(À|YafKïçË	‚zZ¢?+Ȩ„hø`k>p^>å5æ+!Ü9jUm“…,ªjÏÅ«=¼ˆn&–6ÚDy¸èó‡¬,?ÅŸOÇúÃ5ÖÄþq®n:¨.ÊB¨g˜ê<4j<‘æ ‹äÜKïÛÇdµø»tWLêÞ²RòÖSšã0œî
+˱"êÂ+¬Áœ™½Âk¡N-j±©¼œ·M‹g‘^.1—f€�-r
+AÆ<ì-f�µþP8¶B$ØÀ6ãÏü§ý³ØIpÝbEp'­?�_ñ漢֓=kS¤â0­£0<­°ÁR{Z•ÅJкòvó:Ìd'¯u“½¼º®y•lÃçµ›À×Q¾Éz¨>ÙÙ6M
/ QLŸ±·wâ†Â«W7z'J|ó”@êâuœæçëŸj�gÕL1†ˆ!
ÂUìÑM‚[¸+¾À1t꽟íÒÆž,Ž6Ùâ•ûRv¥Iºô‡û& LN�n8h5fh8œ¡Ì¨Y`†.¦4¦Ôœ£á`iÄ¡Ao ÁŽI¯nÞ鶙Qê�Üf÷tŒ½jE‹7‘Mµ¢^­ ÖÆŒzâ¥TUx{uªS”’4ïÐæ)t”^C¢äá>ÎŽŽü³†#v„òéjÏüzд¦þœG>émθ
9;<³Á˜Ëóšìº$µ¡ÇÑK=ŽZzœmÖþ_€IúðX	qñÛ`X´ˆ¿ÜÂu'§’ütÑ|0\Û³8öëî(ÜnwTñáObÂé)?(Vå¤0Óð"{.'!±RžÀË8�3H�÷ë»ëyËëw›2O˲²âô¥‹ÿ?*ÕÀ
+endstream
+endobj
+4841 0 obj
+<<
+/Type /Page
+/Contents 4842 0 R
+/Resources 4840 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 4820 0 R
+/Annots [ 4834 0 R 4835 0 R 4836 0 R 4837 0 R 4838 0 R 4839 0 R ]
+>>
+endobj
+4834 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 585.964 162.03 593.627]
+/A << /S /GoTo /D (structcrypto) >>
+>>
+endobj
+4835 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 575.113 157.248 582.326]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4836 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 563.158 157.248 570.371]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4837 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 335.673 162.03 343.336]
+/A << /S /GoTo /D (structcrypto) >>
+>>
+endobj
+4838 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 127.021 157.248 134.234]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4839 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 113.962 162.03 121.625]
+/A << /S /GoTo /D (structcrypto) >>
+>>
+endobj
+4843 0 obj
+<<
+/D [4841 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+4844 0 obj
+<<
+/D [4841 0 R /XYZ 70.866 747.218 null]
+>>
+endobj
+4792 0 obj
+<<
+/D [4841 0 R /XYZ 70.866 684.014 null]
+>>
+endobj
+1566 0 obj
+<<
+/D [4841 0 R /XYZ 70.866 656.818 null]
+>>
+endobj
+4845 0 obj
+<<
+/D [4841 0 R /XYZ 70.866 525.615 null]
+>>
+endobj
+4793 0 obj
+<<
+/D [4841 0 R /XYZ 70.866 433.723 null]
+>>
+endobj
+1570 0 obj
+<<
+/D [4841 0 R /XYZ 70.866 406.527 null]
+>>
+endobj
+4846 0 obj
+<<
+/D [4841 0 R /XYZ 70.866 299.126 null]
+>>
+endobj
+4794 0 obj
+<<
+/D [4841 0 R /XYZ 70.866 235.921 null]
+>>
+endobj
+1574 0 obj
+<<
+/D [4841 0 R /XYZ 70.866 208.726 null]
+>>
+endobj
+4840 0 obj
+<<
+/Font << /F50 2307 0 R /F43 2258 0 R /F67 2878 0 R /F70 2881 0 R /F72 2883 0 R /F79 3175 0 R /F96 4060 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+4854 0 obj
+<<
+/Length 1216      
+/Filter /FlateDecode
+>>
+stream
+xÚíYMoÛF½ëWìQªí~ïòš¤1�¶@jé–�Jm,¡–è’”]ÿûÎr—)R$…(z°ESË7Ãy;ï
i‚Aw“7ËÉ�ï%AGJq´ü†4ÁF)¤#†EË5ú4�ÔìËòâð
+®+ξß>ÚÙœi3}—ć�Ýç«|›ìÝÒÉOËÉŸ
++	¢¢1Ø0�âÝäÓ‚Öð݈‘A/ÅÊ’c)8?¢Åä·		Y̤;t!g¥;rV’þ8cbºJW;›ÛtFé4+2+!;3„ð>ÏdH¥Â5U†7Æ ˜(‰4�0cô¬æ82@%Ñ
5f‚!-Ü2îKoŸ6P‹A”2L¤à¿Ç¥Ô`ÆE3p¾	;%Þ$™Ý‡cŸMqœmsÛ΋1�¥R�6-AGí(Œ@-XiváV¦’^¤–Ep�ð^.ÎÐ:,f7­õ ­ÛýÓ!÷‡Ðjdºš12}	ÔÚ8µùr{g×& „Iî(Œ@.…˜¹IßR	Ü…¶MöÐœLÿÊÏ�<,v7ɵàÇÉ!¯HŽ¡m!Ÿ×§<	'’½=�cEuïÛ4
eÑ8ªûcœ´I·F©òµR’g€=›SB”É®r»°ûõÛÔ�*
+ö¶`“J¨Ôg"	üPW1ØÀ:Ž4¡ž 93“�…çd»žÍÕfE/¾t€ÁåÜý¦áÆïï&¼Qh‰æ”⨄]þ²øšÙ,+m»4GH&ª%#5æ@_ðýÏ„pŸq¤j‹@i5ÐN$st³s¥°€ÃFnIœ¯Öç²b«ˆ]‘•.×x‘<
+ÒRj¾ÓÑèÈ&Žæ †…	ãÍaû¸öûuº/ª¶(N|s$Áõr/–ûl·õø%i²¨ûËòºðòÖ¯›®ÜòÔÚuÝr¿f‡­ß‚Ø×·1]�V°‡}ÍOU*]°MÁ0çÑé–‡áÕYŠ5ÑÕÇmãê,‰Ä¬tÁzI3dž|$ÍŽ"ÚŒí[zlmÿd¹9=Äù!횪\(¢¤Õ¦ $1㨅á©TXê[LU"Ù�93UyVÆìdµtÜTÈíŸ]‹aÀå8r`œ´ZAüdаZÞ°Ú{?ßÚj=æÿVûïXí�œ6µ±}Êÿ³Ë@?´¤£Zu†×a(P§na±Ì¸Aš_i±wŠq#ò8‹íŸV›€à\�£vF V�úš›X,SsÙbÆìfµô&Û?»61¡ÍHrûcœ´XjÖZ4-V‹
M\yžmúqñó†*Ž
Õ!ø«{z¨úg<´ã^¸
ÉÖ-K©B¿ëžuïÊñ<crZ¾ç|Jí<Û¬ÒÒ-þpµî×ë±3U{ôÞf‡]ͼ~]ey‰×iMYž¤áÚ—m¾	pÛØ…ñ
ó«]‰09Ø•`3)!οf
EˆäéÍ=
+—ÒX\ñÎé
+Kr€T^éHÃÂvJW=nµ+ƒ­­XÿìZÌ»ôí¹ý!ÊÝÖ~ˆ”˜pÚç_K¥*Ì´®ÜB
+,A´„ÄJŹ³{›ÂC@è¬ßk�ú.)¦ÍׇâqÃî�Ûáoù»$l
+endstream
+endobj
+4853 0 obj
+<<
+/Type /Page
+/Contents 4854 0 R
+/Resources 4852 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 4820 0 R
+/Annots [ 4847 0 R 4848 0 R 4849 0 R 4850 0 R 4851 0 R ]
+>>
+endobj
+4847 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 581.262 185.94 589.399]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4848 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 570.231 157.248 577.444]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4849 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 358.091 185.94 366.228]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4850 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 347.06 157.248 354.273]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4851 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 134.92 185.94 143.057]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4855 0 obj
+<<
+/D [4853 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+4856 0 obj
+<<
+/D [4853 0 R /XYZ 70.866 771.024 null]
+>>
+endobj
+4795 0 obj
+<<
+/D [4853 0 R /XYZ 70.866 679.132 null]
+>>
+endobj
+1578 0 obj
+<<
+/D [4853 0 R /XYZ 70.866 651.936 null]
+>>
+endobj
+4857 0 obj
+<<
+/D [4853 0 R /XYZ 70.866 532.58 null]
+>>
+endobj
+4796 0 obj
+<<
+/D [4853 0 R /XYZ 70.866 455.961 null]
+>>
+endobj
+1582 0 obj
+<<
+/D [4853 0 R /XYZ 70.866 428.765 null]
+>>
+endobj
+4858 0 obj
+<<
+/D [4853 0 R /XYZ 70.866 309.409 null]
+>>
+endobj
+4797 0 obj
+<<
+/D [4853 0 R /XYZ 70.866 232.79 null]
+>>
+endobj
+1586 0 obj
+<<
+/D [4853 0 R /XYZ 70.866 205.594 null]
+>>
+endobj
+4859 0 obj
+<<
+/D [4853 0 R /XYZ 70.866 98.301 null]
+>>
+endobj
+4852 0 obj
+<<
+/Font << /F50 2307 0 R /F67 2878 0 R /F70 2881 0 R /F43 2258 0 R /F72 2883 0 R /F79 3175 0 R /F96 4060 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+4874 0 obj
+<<
+/Length 1376      
+/Filter /FlateDecode
+>>
+stream
+xÚåY]sÚ8}çWøÑž	ª¾e½¦K’iÒ�n`ŸÚNÆ
%0
Cm’mþ}¯°Lml¾l²›™}ÈÄû\IçÜ«{ö=ì]vÎ�{!ÒR2oðà)ŒB)=¥)’ÄŒ¼¯¾D„]ªB9MïžL@„ÿšÞ
£é�³/.&S“]Ýš‡€`ß$&šàûà“Ç9CB1ˆ·BÓÊÞíô�7±GÖAÃ…”{ÃYçëwì�à»OFL‡Þ?«'gÆ-ØÔëwþêཡ…Y Šˆºcì�L2y1½(™®æÓ7ÃÄ,ÓoX`ø#vŒ.õÒ
+ˆ½.#(<Ã{™OFAW–�r”ì¾ÅZ­€$ˆ+áu	AZˆìõI¼ÌbhYˆA4"4Ì—j¼|]˜³Õreë”<º»½ìlŒ®ë^Í‚È`>\F#÷~¶Nð–.¼EC$5Íã}ØÕJ#LTþÌ—þõ¡#b
+)¬ËÓ~ƒõúïl@ç×½w7¢ÛA—Åö[õ�^¿Ó†"F¨×¥’Ó%Sïç2±i
—YÚƒú!¯„?}Í>g‰�]_
+B@±ï¾ŒâQvq>‰!y¶<õ�ÌgÙ՗Ĥã(1£-OÚDƒ­�„GÓìö<ÉKRú<[,'ó8Ÿc#*ìâÚv}¥*L�2„©ããK@¹%ÑÌØ„øi‰œºBåa®w2ª$âd]ÇNA–Â"DJ«]ð4GX0±ª¢ªTE¢œzB2$©*”¥j'X Ö8jItòA@¸rØ(u»M4}œgr›,dzêHW+Õ`(UBÀóm˜lá˜ähØ?"È^&¹½¥×Å|;�ÍbÖóXº»Va/ž]‰X$¦[Lñ'›Ý.Åa·öÏÊýçß77ã!ûÏRd_z	 D“ito?M͉=Ë*¿�y;‰´�p¡v…ÓH„q¥óÝu»Bš…¬WH1æZ!óçåZ"fc‡I;LQ.Û©>z¸Už‚·¬m ÕD ²[-S
=@¨ÖmËvª›…¬§º³žé€a¿º�ßš…"áëà€ê�˜Ï¨2ëF ^)G϶J3|­[…6N)ïÛzVŠ-µ“õJi²^)…˜µJIÖ�Ý¿.‘£§YåÛçÛ5‰GClõÉœ(ÄBQöʲä•o"ÈÉÖ>¹ˆòŸûä·³\W�, üÿ¸ä�½Á{R¯÷¹_#h0ƒšìµÉÖ2jîlò—<›'¦Ø½¤›N·ÞF£Ã=«lìY©„Æ„í<|cX!ÉôözÔ#Û³¨€ÍVð®•JôÒ=®Õž9ê¦a7ö-�0–q·­*D̾~ôPªDèBÖŽÌVŽLXLï™
+ä{Éä‰üHúj‘ÍBÖYŒ9«jS”c9ÉS—äq:tì.\º¯¨ßNóÑ­R²eʶ�p$S‰h¨OÑeRè0!»¬§c¹YÌz–‹AëN'š[Ïœê£G[å	 °nGuG5ìÀŠ�†j�iž[¶ØAv³¨õdÃÖšŠ�Ó‰‰·kLgùþ-V�»Oã3rå=õ*íÖMµ,m 2å­`S;�r0´�ë"áz¶zå4ŒZ¯œbØZålª¥÷s1w›EîJ?GéúúÍDsü¬+Œ-‘nWnŽ‡ØjN	–‡eoªJÞô*ŠGé8z2‡úS)t½?ÝD*{Ô³Rk[7ý»Ô¤©=šØáQDfº÷{™?ã@Ïöÿªeä˜ßÒó函JAKP8HJç,.Ml°ðî þ¾pÀòÇ|up÷úh™ñM¼9Ä_Û!;á
+endstream
+endobj
+4873 0 obj
+<<
+/Type /Page
+/Contents 4874 0 R
+/Resources 4872 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 4820 0 R
+/Annots [ 4860 0 R 4861 0 R 4862 0 R 4863 0 R 4864 0 R 4865 0 R 4866 0 R 4867 0 R 4868 0 R ]
+>>
+endobj
+4860 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 664.116 157.248 671.328]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4861 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 652.16 157.248 659.373]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4862 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 640.205 157.248 647.418]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4863 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 628.25 157.248 635.463]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4864 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 360.501 157.248 367.714]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4865 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 348.546 157.248 355.759]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4866 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 336.59 157.248 343.803]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4867 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 324.635 157.248 331.848]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4868 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 68.822 185.94 76.959]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4875 0 obj
+<<
+/D [4873 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+4798 0 obj
+<<
+/D [4873 0 R /XYZ 70.866 773.016 null]
+>>
+endobj
+1590 0 obj
+<<
+/D [4873 0 R /XYZ 70.866 745.821 null]
+>>
+endobj
+4876 0 obj
+<<
+/D [4873 0 R /XYZ 70.866 590.707 null]
+>>
+endobj
+4799 0 obj
+<<
+/D [4873 0 R /XYZ 70.866 469.401 null]
+>>
+endobj
+1594 0 obj
+<<
+/D [4873 0 R /XYZ 70.866 442.206 null]
+>>
+endobj
+4877 0 obj
+<<
+/D [4873 0 R /XYZ 70.866 287.092 null]
+>>
+endobj
+4800 0 obj
+<<
+/D [4873 0 R /XYZ 70.866 166.279 null]
+>>
+endobj
+1598 0 obj
+<<
+/D [4873 0 R /XYZ 70.866 139.105 null]
+>>
+endobj
+4872 0 obj
+<<
+/Font << /F50 2307 0 R /F72 2883 0 R /F96 4060 0 R /F79 3175 0 R /F43 2258 0 R /F67 2878 0 R /F70 2881 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+4886 0 obj
+<<
+/Length 1507      
+/Filter /FlateDecode
+>>
+stream
+xÚÍZMs›H½ëWp„ªÕd¾?ŽÞXŽ+q¶²+ù”Mm±¶UkK
+BÞèߧ‡
	Bä­½<¯{æMw¿ÆÆÞ£‡½ƒ_'ƒw7{)™7yðFZJOŠ$ñ&3ï«otðmòÑcðˆq	北7óç(R¥ýëåtó-’0™/vê`4|˜‰=²CÔiʽéËàë7ìÍàÙG�öþMg¾x\0$8ƒûgo<ø}€3/Nü˜
þ‘ù­¨§�Q˜X¿	£àX“áÜóå4	g©G9¼e
+oQ�¤aù’þĘÙÙïnŒ,L2“ݲÇã_2ÀCŸ2…6Þ�d„x3‡Fÿ7‡nÝ„’mƒ„ä{AÜàzò†k¤¸ö†”ÃIÉ(ýHâ€`?œ&Á�é߆‹Ùú)ü' Ø�ÜÐ8šÆQúXùñò%}
+ãhv8Cúð¾»…q0$ÂÞ'¡`¨„ñï×ÑYö’¥‹†ýC_ß?Ï!.öfmá2
㜀W_*|{o#êÀ¦š~qð@�ºñuêË:€u Ç#¢ÂRi/–M©
+{Æ)AŒRgüK@¹ÆáK”€iBüué(Ô…±„«Pº)Œ‰Pˆ±ãcØøž„	Õ€
³Yz0„Ë¥\68õ¤ÄÀ‡Û‘u´^×f1Xšt¶[:é„d)Nžr¢ïÆ9³Î÷KâÎêfšlâ¨ê¥l’vp¯Ê@Éû1Ü#c˜SØñSKáˆr’a®�`yÄ�Øíf³žÝ¢ÑùbµI•y^Jï]&9NgkªTp[É{ÒÙ#£*	•—¡j½Ñ"¯
tv³YOgÑè.Z¼F…r²ÏÌî>ËäðcÛ@vko«D
02²�COf!ÃÅI®	NÒâÕ�,Ö3]4:W–\Žýd>»‘¬Ô/ÖSGû|•qý®ŸHnëg•x¬@õâ¸=ÆÑVA0ºR¹í’�)"öcìÏ¢xþ]­VÏóiÚ¸Œ·
ˆ÷:°¤A£0‚´àñu9‡d)°ÜS‹xDÃrW¢,¼ ÎþU¬öGô¯­§Z´Ñ¿蹪\JÄᶃ*§gx¥v}ËÍm§>A¾™Gï;zôv{4ú<®9��Õ'›HŒÐ¬y©é]Ñ~áìº�¼“°÷®s±wòŸSš˜60ö¦ØÀìÑ �á’»ƾZA+›µ
Œ½V;˜70¹Ùs˜ÒB/Û¾€v¥²sûÂ4E
+uCâ£Z#^ø
+qaW ™€ãÂts€£D‰9U!™bé
=¯éh¸¶P–,÷l`˜€0#Ü«Ò„™~÷ÂÈ(æPcµ¾„àe\#Av‰¼�Ýn6ëÙ-
¹Û[匷v¹Ê@Ý“ñ^ãÔ Ê.Ã8
(w…²�ñn6ë/}KÆ[»\e pßï…‘1nÊÅ8�ÀIIˆa¼›ÍzÆFw	|¹Ivœƒ„Ikºð9éŸÃu’×ùq¡Çµ|™�ÿvw—�Ÿw],³iqô}3�£Y.¤ê�Hë5Vé…ǼoRh�q´M¢Ì6!²Ü&™R›t¿š…I4ûdÕPdlÏé“D}Ÿ”ƒEÛŽ
Ò4Þ®@6(lHö­½Ñt¹H¢ɹºŸSÄ
yó¿XLje?/þµë¸ì‡²ÁJªÿK @hÇVO/]켸£Ÿ}KøðÝÇ tÀQ•ߢ4wêÄuÊ„°;è¤ú"˜m¦hN’D
+¤UÃdž^.Ï, IÊK|P"RŸÔ…óèv³.áR„…êjü áj¨y¼l=¯±W£«ëìâbOøN:7:I™D"]V['«<
æª×½0ÙCËKÔT# ºéb�×3ÜÍb-ÁE“»Šºq¹øœVø8í�¬�Üôã·=Dž\*PN
+#mþ ¯­Q%¹Ýu.8‚ÃI™%¹Ñ"Š÷Ûýw!Ñ^/Ó0Ú>Ú²Áv˜ý~ópc®
+endstream
+endobj
+4885 0 obj
+<<
+/Type /Page
+/Contents 4886 0 R
+/Resources 4884 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 4820 0 R
+/Annots [ 4869 0 R 4870 0 R 4871 0 R 4878 0 R 4879 0 R 4880 0 R 4881 0 R 4882 0 R 4883 0 R ]
+>>
+endobj
+4869 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 759.941 157.248 767.154]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4870 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 747.986 157.248 755.199]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4871 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 736.031 157.248 743.244]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4878 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 484.853 185.94 492.991]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4879 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 473.823 157.248 481.036]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4880 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 461.868 157.248 469.081]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4881 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 449.912 157.248 457.125]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4882 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 185.443 162.03 193.106]
+/A << /S /GoTo /D (structcrypto) >>
+>>
+endobj
+4883 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 174.591 157.248 181.804]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4887 0 obj
+<<
+/D [4885 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+4888 0 obj
+<<
+/D [4885 0 R /XYZ 70.866 688.236 null]
+>>
+endobj
+4801 0 obj
+<<
+/D [4885 0 R /XYZ 70.866 582.723 null]
+>>
+endobj
+1602 0 obj
+<<
+/D [4885 0 R /XYZ 70.866 555.528 null]
+>>
+endobj
+4889 0 obj
+<<
+/D [4885 0 R /XYZ 70.866 400.414 null]
+>>
+endobj
+4802 0 obj
+<<
+/D [4885 0 R /XYZ 70.866 283.492 null]
+>>
+endobj
+1606 0 obj
+<<
+/D [4885 0 R /XYZ 70.866 256.296 null]
+>>
+endobj
+4890 0 obj
+<<
+/D [4885 0 R /XYZ 70.866 137.048 null]
+>>
+endobj
+4884 0 obj
+<<
+/Font << /F50 2307 0 R /F72 2883 0 R /F79 3175 0 R /F96 4060 0 R /F43 2258 0 R /F67 2878 0 R /F70 2881 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+4902 0 obj
+<<
+/Length 1268      
+/Filter /FlateDecode
+>>
+stream
+xÚíYMsœ8½Ï¯àUEú@×8koå´kOå’¤R„‘g(�ÁØ»þ÷ÛBÂÃ̘Ôn¥rpÁ€ôºÕ¯¥îg°·ñ°w¹x¿Z¼»àØ‹�"ôV7žÄ(“Š"A¼ÕÚûìDÂ`IeäW»òÛ­÷ŸÊoI¼KÐÖ¾¸HwÚÞ]雀`_:KtðuõÑc,D\†`¯FSÊ<]ü¶Züµ ð{äÙh¡ˆ2/¹[|þŠ½5¼ûèaªÈû»yç1`Ì€í¼ëÅŸ|t!´µ
+DÅÁ’`Œýĸ¹ÕI@±û)àÆçÔùþ!®â/˜cø#ÆÛw’z)‰‰�ÆÞ2$(âÌ"Ïó]°ðn?‹aŸ¤:‚ &¹·$)Îíä4«¬%ZˆB„FMȶÕÓ½>«ÃfãUl\à®.¯|[º©Öˆ°yRÅk7ßÆf©Ö,!¡hcïÆá€S
+a"›1×ou(”HbÕ]õ�phuý?óè÷�ÔQˆöÒ¤dôKæB~FH2à�2Øvì* �¨º¬ì6ƒL­¯ë:ËÌÝM‘ßÙ»k]Ëû�
å¾¹¯'”öúü6q
+« zm_<”i¶±·å@U˜½ߘ9I3.)´s(ÎNÜž•‰³uïnãr‹l å&ÖæbÂ-d+°Çh[6´Ëÿ# Ì�‹øNWà!~Ùájè4áDOÉC§	Q©šT{šœƒ ,¸Ç
K0~F3„yè êÃLv3‰(£Åáa­S¡–ÌQ8Ùj'	lNå+³ÀŸcz·É¹Õö®ï		®&¸Òç
®ì0Äq.ga8.¹@X_
+áä(—Ü‚ÃÂ�¦û‰œfr˜È¶ÍjëJvšÝ?T{N‡$®Ò<{ûY³?	F/£O ç°ż$˜…á’€A4Ùi’€	D…|®`û³`šÍá,hÊ‚ÁbP¿\Û"°ŸøÑž÷Iˆ�Í$~†#žkPÇ/%D
+–{Œxh 
[�Â0íÓ,ÓÞ69Dû}T3ìWi¼{C?@ùh¯ût
äØ<ÊÇc4ýD·5©cÚéNœ&MSÙ�^éê¡Èº}ÉK/Ù¡„R¿—$B˜¹þ³²~ÐÝvíåÌ=ÐÀ�Ù7zWºÙ7
ìÞØü¬»ËŽ.Z:ã:ƺڈ8m´	ó¨g‰¢Ç<][ùãÀ~©¢ÿBƒœÿܪè¼Ðq¥›3)[—ÛøÖz=®�1Û%wuî|—êÌsUÞ�FÝ4OKäK[”´Aæ'6Q8a*&'Êt‰áÁs†b¨O{ÏÞy¶ÜÒ�C^�S'ÊÌ<òá4Ñê`Éíš}»p‚i
+×xWú<D(è<.ga8.)\	=EÏL)G2dG…ÓD“ÃD¶m>÷NùC5B9í§y´£}Š¨v3iž…áhÆ1qš!ô$bÏel?ÏÓlóÜ6:Ô#·«ÃhEÔð=Úá>WØH¸™|Ï°|E!Ñ)Q5‘ß/ˆ&$»mñÇè!Gøx§{d]Q³Ÿ€±÷³
+
w±xõi…}Z©;%øý¨‹óºQ‚€6Ê¢–/ÅQ
mÎð‡@¶ U-.Rƒ~eQ¦(ÑgÇÿÃÌ!XdÌçª&ž°ó$t¼-%É‘®e»Ô™. ­u}áwÆ'{ÿ!7­ê?O›:¤:{íâ¿°73
+endstream
+endobj
+4901 0 obj
+<<
+/Type /Page
+/Contents 4902 0 R
+/Resources 4900 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 4906 0 R
+/Annots [ 4891 0 R 4892 0 R 4893 0 R 4894 0 R 4895 0 R 4896 0 R ]
+>>
+endobj
+4891 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 664.116 157.248 671.328]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4892 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 652.16 157.248 659.373]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4893 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 640.205 157.248 647.418]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4894 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 328.925 157.248 336.138]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4895 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 316.97 157.248 324.182]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4896 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 305.014 157.248 312.227]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4903 0 obj
+<<
+/D [4901 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+4803 0 obj
+<<
+/D [4901 0 R /XYZ 70.866 773.016 null]
+>>
+endobj
+1610 0 obj
+<<
+/D [4901 0 R /XYZ 70.866 745.821 null]
+>>
+endobj
+4904 0 obj
+<<
+/D [4901 0 R /XYZ 70.866 602.554 null]
+>>
+endobj
+4804 0 obj
+<<
+/D [4901 0 R /XYZ 70.866 437.825 null]
+>>
+endobj
+1614 0 obj
+<<
+/D [4901 0 R /XYZ 70.866 410.63 null]
+>>
+endobj
+4905 0 obj
+<<
+/D [4901 0 R /XYZ 70.866 267.471 null]
+>>
+endobj
+4805 0 obj
+<<
+/D [4901 0 R /XYZ 70.866 163.286 null]
+>>
+endobj
+1618 0 obj
+<<
+/D [4901 0 R /XYZ 70.866 136.267 null]
+>>
+endobj
+4900 0 obj
+<<
+/Font << /F50 2307 0 R /F72 2883 0 R /F96 4060 0 R /F79 3175 0 R /F43 2258 0 R /F67 2878 0 R /F70 2881 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+4925 0 obj
+<<
+/Length 1693      
+/Filter /FlateDecode
+>>
+stream
+xÚÍZ[“›6~÷¯`Ú»�µº¦O©›ds™išõìLg“ñŒ½L0v
N³ÿ¾GH`0_ÓÉË„8瓾#�ïˆÅÎÜÁΫÞïãÞÍK�yR2g<sF®”Žò(’ÄO�‡>ÁxðiüÆaðŒq	/æÍ/£8©rû,ƒÍ"L2?‹–‰îÚ{1îýÓ#Ð;¤4éºÈ¥Ü	½‡Oؙ³7Xô\çß¼çÂá‚!Á\ÇÎ]ﯶ0��õÜü`�+ê(ä)L4pÂ( o’ \@_™?ͦà-¯òu‘ôX1¤�3Ýûæ¥'+�<„I9ì»ÑýÝëWϬÑ]\; †L!…=gHò„øn n0<£Æïßš^5Œ!®øÖ” ¦�¾�Á¡æR
+×R!c¹ü: ¢®C"úÑìÉ„Þ�n`¸xø3•š'i4Oül³¶1
+�™ÿ®ÖËl,cs—­÷ý$
¬ÝUf&Q¡çBÿèé�ª.†c×û
å}í/ÂÀÒOksÙ¶¤‹‘¢´k)P Œy¹®lC¯áH)•�Kzs˜Ïš0뮶a(D9u¤6éq3%0÷~<oî„xHu®ßZ�* *yÝqöhé÷KKiö¸0m›4œš«ÙBF?×7Óhe~¼5
ðÔeH1rø&w`BÏÿEü_dÃò/’X]…!g²ºGvðžßvþ«ŽKþ£dµÉ:7‚²ë¾= �ü“‘7‰¼ÛÄaò/²aɇ\@a.»‡Â�ÇÅAò9¤צ“ÛÞÏsÙÎ{Õg'™ùƒG?}ì õd`MJÀîÞÓz‘
K+¥Hv0B‰ i¥
+––(SºÞ5mZßÃïy¾Ûù­:/ùÝŸïW›ÏŠûq˜û/ú.Ôž:x?p“30!È…¼Ÿn£”Æ5¥’OgM¬XBÁžd…Ô‡vä®R¶Ê¯Fà‚û!qæfamŠ�vÖºËF–•šhåHÃé3ó$ŒSÛw­ñÀ¥è'i%?ûºC.kÊÐb‚
¹Ü¦}	jQDøÁ÷ƒuègá(Ž (iïÙý@@@¬
+ˆ�·ò³¦QAß1‚\a�]F dÓlvÖf‘¶¯Ÿj‹y�WÂjl›˜¢$kÑÌ°lu5Sø<ž«äí»g(yz„’Wÿceqž·/þþÁ�J±s½Zg”GšYys`s{?pq£Z„iêÏÃ
´ÙååÛ¥äwŠÜš"J—Û2~wG³­«0È×LPsõkg¦EÇWQôì*Šq
{Z§"�Éì\{wÞËl˜ŒË†Q‰ƒIv(ã2&�òDu?h˶Ø�gúÝɶ jÔŽã2ÛîÊNQÕ̪\!—Ð3€5y

+~/âö"–["e棹¥°¦ŠŒuÛAëy.Ûi­úô�‘ȦËÒü~®ÄA8í üdÈM²À#â2Â/²a	Ç�-Ž¨î��ÏK$]Yæ­ÊÏsÚNyÕk¹’�h©ÊeK~.ÐÊ\Ó-š¶OFÛd
+L(y!ÛÙ0lSW!v�êQÈfjW´~¦ßVÂkŽK—›¬<
9ú„Ë|:º9ÚÁîEŸa£øžA(òìÛˆR-E½Àm©�ÅéäK.œžÒIàÇ
zÜ+/kÓ¯«¨T±]i¯–õ­³$bZû8b¸™}Š2Ië«8G�vÅ)”á@3s­O-/�G@�sEÙlv­ü9z={	ÃpòjåæÆT-…Ô3õÍÓJã××éfµZ®3s3Û$�†_×dM¿ÞÖ/Ä*Qºß¶lQüÍ’i8+¡L`›¼›Œž¿Mn»}|²/p%áñ¾ÈÖYû<zúx“ ÞL-ˆŸöDš^ÇqJ&¬ˆÅ£”æöÍûžh'©_.ÿ®pƒ<!NÖaðõº°E{¨Èã—d¶ÎÅY®Ëô½ÑeÕEÙ‰€’W•/ªy£™™ür$ü5XR?2Ó@EuvêMÛ÷ó“úéR“…¼g”DÙ¸îmqF[Ží¡<UigR/ã
+Òâ»sù"ÅaF ¼F´(ªÉ™
]âr§Òlß×õùoy�!Å…bw^i+³Ô+àýºÞ$I”̯8“DAeÈO™Égû½4�_á"áeþÏ*Eœ"éíîÓ<4&.Nø'„BSHD¨^HÃ\p$‡_$e‘ÿÃ$\ƒŽ¶_?
mÿ=Bg~{škÉÑ“]Œÿ
÷;~×
+endstream
+endobj
+4924 0 obj
+<<
+/Type /Page
+/Contents 4925 0 R
+/Resources 4923 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 4906 0 R
+/Annots [ 4897 0 R 4898 0 R 4899 0 R 4907 0 R 4908 0 R 4909 0 R 4910 0 R 4911 0 R 4912 0 R 4913 0 R 4914 0 R 4915 0 R 4916 0 R 4917 0 R 4918 0 R ]
+>>
+endobj
+4897 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 759.941 157.248 767.154]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4898 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 747.986 157.248 755.199]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4899 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 736.031 157.248 743.244]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4907 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 424.436 157.248 431.649]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4908 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 412.481 157.248 419.694]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4909 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 400.526 157.248 407.739]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4910 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [69.87 184.979 212.775 193.75]
+/A << /S /GoTo /D (tls__keys__calc_8h) >>
+>>
+endobj
+4911 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [136.819 136.425 172.286 143.794]
+/A << /S /GoTo /D (tls1__3_8h) >>
+>>
+endobj
+4912 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [136.819 128.455 176.47 135.824]
+/A << /S /GoTo /D (tls__sal_8h) >>
+>>
+endobj
+4913 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [136.819 120.485 209.944 127.854]
+/A << /S /GoTo /D (tls__client__recv_8h) >>
+>>
+endobj
+4914 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 96.418 222.497 103.944]
+/A << /S /GoTo /D (tls__keys__calc_8h_a725431b0b8841d5799e2e305a95a24f8) >>
+>>
+endobj
+4915 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [224.689 96.575 272.709 103.944]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4916 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 80.477 193.207 88.004]
+/A << /S /GoTo /D (tls__keys__calc_8h_a4577af1f5021f2b06b2f9331641a0d1e) >>
+>>
+endobj
+4917 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [195.399 80.634 243.419 88.004]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4918 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [283.269 81.443 306.184 88.004]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4926 0 obj
+<<
+/D [4924 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+4927 0 obj
+<<
+/D [4924 0 R /XYZ 70.866 698.38 null]
+>>
+endobj
+4806 0 obj
+<<
+/D [4924 0 R /XYZ 70.866 533.337 null]
+>>
+endobj
+1622 0 obj
+<<
+/D [4924 0 R /XYZ 70.866 506.141 null]
+>>
+endobj
+4928 0 obj
+<<
+/D [4924 0 R /XYZ 70.866 362.875 null]
+>>
+endobj
+4929 0 obj
+<<
+/D [4924 0 R /XYZ 70.866 268.976 null]
+>>
+endobj
+1626 0 obj
+<<
+/D [4924 0 R /XYZ 70.866 252.563 null]
+>>
+endobj
+4923 0 obj
+<<
+/Font << /F50 2307 0 R /F72 2883 0 R /F79 3175 0 R /F96 4060 0 R /F43 2258 0 R /F67 2878 0 R /F70 2881 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+5020 0 obj
+<<
+/Length 1979      
+/Filter /FlateDecode
+>>
+stream
+xÚÍ[[�ÚF}çWXÍTa2ÏŒG­*5”ͦ¤Jº¦‘ª¤Z9f¬°†Úf›ý÷ý|a±g
ØHüÆžë9ç»ÌxÀÖÜÂÖ«ÞËiïÅÇ–ƒ”ÌšÞX#GK*Š±¦3ëC_ ÂC*�~²Œ¯—«ù€àþ|0„O
î£Eþø"XêüêJß²Ç:ôõàŸéï–ÍÄzÍÚ$˜¤·{ãiïß�»Ø"};r¨mù·½ÿ`kÏ~·0bʱþËJÞZ6gˆÛ®—–Ûû³‡Ëó‘ÔHIæ”ç#ÂÛ	aŒ™Èº‡Ö‡šQZ=¿¼zÕ³>†ÑItåòöa0D¡ "ð™Ö3níêß­‚Yµv6˼/¸Ø•Œ6a„óK/^¼~[©£ýˆ9ÞöQõþô�{ë8VÕ‘Zı!Ö� Jóiÿ˜�à‰µ»[T†^ÈOY�!
ü©²­¡wˆÉì)6nÛ¬S@êÿ‚pv:´œDR�"Ù£�ˆ�
¼ìzyùöN§œtV§9Ö'Bšb…(áõrååJ	C¦X9­E™³úÛªK '‘Æ~¬“ç“yƒÂ¦ºƒçûûXù‰gÐÎSß~œ»·eÖ8G<x•	�k	N­À½“…Nÿ„4ZnìnžL©ç©¸ý¶]»-
{\R#ÂXšT«ZH»K
+ E÷ëd5Z…	ôÛŽ~?«j¨THQÞ„�Q%VçQ¾
+Öž`âÐ.�¸YϼDŸƦ~nô‰óãÍNžn9‡<çë÷e×	‰…T ݩ�mŽÓ-Ãñ#}«ÃS[Å�æÛ²
íe1G˜™ÆãÔ; U™”ì¼ns“j8àÌl$ï+X/tÔNî”AÃL6‰S÷y;	ØÀšøO?G¦¬¦n+“[§Žr‚íîQîêpö&µ?¡)ξF2uËt)Š¦&/õQ�Ò=¾®´wv¾¾Wšß€+R»>#Dvk3Á_Ýéè�;9Õ"LĹ|ÒžŒäHÚÄÄ«ÞCÑNÁ8ÓQp§Ç^´¼w5È?‰Ï“ÉýZ·I” )¨dЮår@:DöØm™3J$¸:ÞîËÉø<~9¹*/ã¸B”¡Àza²
+ó
¸ã¨ëÂ</϶\ÿ
+iny4ž¶lÛÓF[±ãñnE 	!L)Ö+ÔÝSè¥Îâ…÷YUiË\¡±ÀNžÛUørϦ²CúÍ>â�˜]YdRd¯·ŒÜÓ®}iB8ïžÊ~]¯—�ï%Àó‰uV^ô�''mðšË½¸<O4�²árÂax1G!ò(
ä¢V_‚vO_eÛ}³‰¾�O¼[zÄb­²uŽ½w�ñÉ‘¶IDí¦‘߀ŸO«Õ²á’t¡ýÏï�¤ýæ%^§² ¦/DÜ‹s·u¦r(‚Ø{#æÈ榀d½€Ò=fl$XówÖÐè¤ÚŸ…`…S¦XhýƘ"�óB®Žît4ÒQ’©)ÐÑÙ¤so9o©¥­“?šmŒÞ»¯_µŒ:6bé[�c!íòt¯˜*yÌøjúnR“-UÆûY¢jwî(Æ|²Ò7MßHL¿¶'7ÙO=á“ñßOðIM””‰¿¬$æ@¶¦LÉ�z%¹Q*žœ‚B*wvl?Óá,¸©Œ5;ÔH(R„ðô tbs¤À£–N4œž¶yò‘ÆÐÜîà$N-ÙÂ.’Ã7n^� –_@/ó œ£¼®¤¤°‚Š¢.eHÈ…gAè/7³¢ÊJ%9CR=œ¢ü¹¦-‰¤­¶â$J»\Ô´ÖíP²-øKMK€†B,Û! Hqa.ÃþÀ�\3´øaKfV–ï+{ý…C£yéœ$Œ$W[8Ív¹³Ê›ÐOW£±Álu"�td¾�”rÓH9ý»
åý�©ñ)M·Âû÷ëÄÀSs¿1›J¥ŽÃ_xQ�«(¡–È€«×�³±ØH9ØÇwÇü¶Žm;Y™žÍÅ"µ D@ø!©Úð]X$;„©…Þ2WZyðÙ�›Êü×0ÿò–EñÕ&Yo’‡’¡^ÆÅqßE´ÚÌÛA\jm@úæJߘã�RˆiCa´Î)¸I
u©c~(cƒ%_ösK
+’BÅÚ°´†˜rûi@q< {¸}
V y+$[ÖÄ‘¬ËMá&d´Š ¼0Ü_
lÜ?ÒÌcoÌ!5+’ã“ Û2oK™BL²ª–?yqàW¼¥¡ßo.77µ-4« £K½\®ã.«Ì�F\Ç› )Kåáù:þ̾–J�0m#±w“¯íÔNIk#ˆÑ¤¹" "	F«Š¨È Y±Ø`%¿¹xÄÍ7QÈNású¡“}îi¢•ì¯oú,ŒG¶!|Ú|ÉÏη¥Ø“ì½ü+Òñæv½‹%G}u"ôÇ¡?þòÔÁ.ûú:N¼dô�¶EÉ&päºIß°> ¸U&5æ›@¦¥(=@x\gc:
.°Œgzf܉³Tm+’5üÐÅÏ»¸\t­ÁÉ<ÎëêþÄóóy-þ´ý?“@T¦™øÃÿìü`6ÍW:ÔQº�+‹é÷ùõo«lŒ÷ÅR 4‡ø?UÏAà
+endstream
+endobj
+5019 0 obj
+<<
+/Type /Page
+/Contents 5020 0 R
+/Resources 5018 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 4906 0 R
+/Annots [ 4919 0 R 4920 0 R 4921 0 R 4922 0 R 4930 0 R 4931 0 R 4932 0 R 4933 0 R 4934 0 R 4935 0 R 4936 0 R 4937 0 R 4938 0 R 4939 0 R 4940 0 R 4941 0 R 4942 0 R 4943 0 R 4944 0 R 4945 0 R 4946 0 R 4947 0 R 4948 0 R 4949 0 R 4950 0 R 4951 0 R 4952 0 R 4953 0 R 4954 0 R 4955 0 R 4956 0 R 4957 0 R 4958 0 R 4959 0 R 4960 0 R 4961 0 R 4962 0 R 4963 0 R 4964 0 R 4965 0 R 4966 0 R 4967 0 R 4968 0 R 4969 0 R 4970 0 R 4971 0 R 4972 0 R 4973 0 R 4974 0 R 4975 0 R 4976 0 R 4977 0 R 4978 0 R 4979 0 R 4980 0 R 4981 0 R 4982 0 R 4983 0 R 4984 0 R 4985 0 R 4986 0 R 4987 0 R 4988 0 R 4989 0 R 4990 0 R 4991 0 R 4992 0 R 4993 0 R 4994 0 R 4995 0 R 4996 0 R 4997 0 R 4998 0 R 4999 0 R 5000 0 R 5001 0 R 5002 0 R 5003 0 R 5004 0 R 5005 0 R 5006 0 R 5007 0 R 5008 0 R ]
+>>
+endobj
+4919 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 758.991 201.576 766.517]
+/A << /S /GoTo /D (tls__keys__calc_8h_ab4626ca7ee28b8311899148e788712c3) >>
+>>
+endobj
+4920 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [203.768 759.148 251.788 766.517]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4921 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 744.016 180.654 750.577]
+/A << /S /GoTo /D (tls__keys__calc_8h_add8404a61a7878b2263a0f646a4ff621) >>
+>>
+endobj
+4922 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [182.846 743.207 230.866 750.577]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4930 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 719.14 226.682 726.666]
+/A << /S /GoTo /D (tls__keys__calc_8h_ac637f846d7e27564dcbb7fb60c48d195) >>
+>>
+endobj
+4931 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [228.873 719.297 276.893 726.666]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4932 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 695.23 205.76 702.756]
+/A << /S /GoTo /D (tls__keys__calc_8h_a78bfe1942bb3e34bc537e89f8f23ad87) >>
+>>
+endobj
+4933 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [207.952 695.387 255.972 702.756]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4934 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [295.822 696.196 318.736 702.756]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4935 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 679.29 230.866 686.816]
+/A << /S /GoTo /D (tls__keys__calc_8h_a1ebed486a752d2d46461470742670741) >>
+>>
+endobj
+4936 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [233.058 679.447 281.078 686.816]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4937 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [320.928 680.256 343.842 686.816]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4938 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [358.587 680.256 381.501 686.816]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4939 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 663.349 218.313 670.876]
+/A << /S /GoTo /D (tls__keys__calc_8h_a039d437970a1f493377a08cb31d96dec) >>
+>>
+endobj
+4940 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [220.505 663.349 247.603 670.304]
+/A << /S /GoTo /D (structcrypto) >>
+>>
+endobj
+4941 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 647.409 226.682 654.935]
+/A << /S /GoTo /D (tls__keys__calc_8h_a7c80470edcd5c41df2776758a8f73bf7) >>
+>>
+endobj
+4942 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [228.873 647.409 255.972 654.364]
+/A << /S /GoTo /D (structcrypto) >>
+>>
+endobj
+4943 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [270.717 648.375 293.631 654.935]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4944 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [308.375 648.375 331.289 654.935]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4945 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 631.469 239.235 638.995]
+/A << /S /GoTo /D (tls__keys__calc_8h_ac1ec60c7aa252ae5b0f77a7373996efa) >>
+>>
+endobj
+4946 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [241.426 631.469 268.525 638.423]
+/A << /S /GoTo /D (structcrypto) >>
+>>
+endobj
+4947 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 607.559 226.682 614.778]
+/A << /S /GoTo /D (tls__keys__calc_8h_a51906ad75db829ff0f4d9185498c07bc) >>
+>>
+endobj
+4948 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [274.901 608.525 297.815 615.085]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4949 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [316.744 607.559 343.842 614.513]
+/A << /S /GoTo /D (structcrypto) >>
+>>
+endobj
+4950 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 591.618 243.419 599.145]
+/A << /S /GoTo /D (tls__keys__calc_8h_a8f0a6b45ba2baf667a3f3db7f2c45817) >>
+>>
+endobj
+4951 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [245.611 591.775 293.631 599.145]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4952 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [333.481 592.584 356.395 599.145]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4953 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 575.678 243.419 582.898]
+/A << /S /GoTo /D (tls__keys__calc_8h_ae5bb549f97d541ccc349f71498003fc3) >>
+>>
+endobj
+4954 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [245.611 575.835 293.631 583.204]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4955 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [333.481 576.644 356.395 583.204]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4956 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 560.704 189.023 566.957]
+/A << /S /GoTo /D (tls__keys__calc_8h_a8806c3d2593fca6f70e1765af93bbbc6) >>
+>>
+endobj
+4957 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.215 559.895 239.235 567.264]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4958 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 543.798 222.497 551.324]
+/A << /S /GoTo /D (tls__keys__calc_8h_a2f62f573a6b6cabe93ec2147d4823c6a) >>
+>>
+endobj
+4959 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [266.532 544.764 289.446 551.324]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4960 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [312.56 544.764 335.474 551.324]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4961 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [354.403 544.764 377.317 551.324]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4962 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [400.43 544.764 423.344 551.324]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4963 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 528.823 222.497 535.384]
+/A << /S /GoTo /D (tls__keys__calc_8h_a657bc15591cfddc543c9908e454cefb1) >>
+>>
+endobj
+4964 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [266.532 528.823 289.446 535.384]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4965 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [304.191 528.823 327.105 535.384]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4966 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [346.034 528.823 368.948 535.384]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4967 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [396.246 528.823 419.16 535.384]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4968 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 512.883 239.235 519.444]
+/A << /S /GoTo /D (tls__keys__calc_8h_a6c05578c90c439bd0ff35fdcdc02b39b) >>
+>>
+endobj
+4969 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [241.426 512.074 289.446 519.444]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4970 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [329.297 512.883 352.211 519.444]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4971 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [371.14 512.883 394.054 519.444]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4972 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [417.167 512.883 440.081 519.444]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4973 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 495.977 247.603 503.503]
+/A << /S /GoTo /D (tls__keys__calc_8h_acbeac5740057ccd837c02450d4922d71) >>
+>>
+endobj
+4974 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [249.795 496.134 297.815 503.503]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+4975 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [337.665 496.943 360.579 503.503]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4976 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [383.693 496.943 406.607 503.503]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4977 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [429.72 496.943 452.634 503.503]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4978 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 480.037 218.313 487.563]
+/A << /S /GoTo /D (tls__keys__calc_8h_ab53120ef3350624efa158b055849babb) >>
+>>
+endobj
+4979 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [220.505 480.037 247.603 486.991]
+/A << /S /GoTo /D (structcrypto) >>
+>>
+endobj
+4980 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [287.454 481.003 310.368 487.563]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4981 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 465.063 214.129 471.623]
+/A << /S /GoTo /D (tls__keys__calc_8h_aaa92ece79610e718653811665708f83f) >>
+>>
+endobj
+4982 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [258.164 465.063 281.078 471.623]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4983 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [300.007 465.063 322.921 471.623]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4984 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [346.034 465.063 368.948 471.623]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4985 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 449.122 218.313 455.683]
+/A << /S /GoTo /D (tls__keys__calc_8h_a8be08a8f8802cf8a4c21deb5db506394) >>
+>>
+endobj
+4986 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [262.348 449.122 285.262 455.683]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4987 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [304.191 449.122 327.105 455.683]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4988 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [350.218 449.122 373.132 455.683]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4989 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 433.182 243.419 439.742]
+/A << /S /GoTo /D (tls__keys__calc_8h_a024aaf0b72dbcf480a7d9107d286f716) >>
+>>
+endobj
+4990 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [291.638 433.182 314.552 439.742]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4991 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [350.218 433.182 373.132 439.742]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4992 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [387.877 433.182 410.791 439.742]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4993 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 417.242 247.603 423.802]
+/A << /S /GoTo /D (tls__keys__calc_8h_a5f4c6740b2154c2414a0984653bb2356) >>
+>>
+endobj
+4994 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [295.822 417.242 318.736 423.802]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4995 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [333.481 417.242 356.395 423.802]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4996 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [379.508 417.242 402.423 423.802]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+4997 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.489 195.109 147.365 205.584]
+/A << /S /GoTo /D (tls__logger_8h_ae2132d5a0dc6fe9904607b60d73cd4dd) >>
+>>
+endobj
+4998 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.489 167.371 127.442 177.747]
+/A << /S /GoTo /D (tls__logger_8h_aa044d181bcf7e7b069c765f0f61666c3) >>
+>>
+endobj
+4999 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [283.229 167.371 321.606 177.747]
+/A << /S /GoTo /D (tls1__3_8h_a42d4f54d23f86205a1fa590480181e0f) >>
+>>
+endobj
+5000 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [340.917 169.263 364.841 177.747]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5001 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.489 139.741 174.318 150.324]
+/A << /S /GoTo /D (tls__logger_8h_afa1794a7a7edf39877bf04448eb73322) >>
+>>
+endobj
+5002 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [280.825 141.633 304.749 150.117]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5003 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [327.176 141.633 351.1 150.117]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5004 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.489 112.112 150.997 122.487]
+/A << /S /GoTo /D (tls__logger_8h_a9c5a0178dbefc32b05346ed2cb72fb8d) >>
+>>
+endobj
+5005 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [154.483 114.003 177.044 122.487]
+/A << /S /GoTo /D (structticket) >>
+>>
+endobj
+5006 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.489 84.482 155.847 94.858]
+/A << /S /GoTo /D (tls__logger_8h_a2b301f7e69e5ce3e02c33aad08173456) >>
+>>
+endobj
+5007 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [159.333 85.401 200.203 94.553]
+/A << /S /GoTo /D (structee__status) >>
+>>
+endobj
+5008 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [215.52 85.401 256.39 94.553]
+/A << /S /GoTo /D (structee__status) >>
+>>
+endobj
+5021 0 obj
+<<
+/D [5019 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+3036 0 obj
+<<
+/D [5019 0 R /XYZ 70.866 402.183 null]
+>>
+endobj
+1630 0 obj
+<<
+/D [5019 0 R /XYZ 70.866 385.895 null]
+>>
+endobj
+5022 0 obj
+<<
+/D [5019 0 R /XYZ 70.866 235.618 null]
+>>
+endobj
+5018 0 obj
+<<
+/Font << /F50 2307 0 R /F72 2883 0 R /F43 2258 0 R /F23 2944 0 R /F26 2949 0 R /F70 2881 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+5038 0 obj
+<<
+/Length 1200      
+/Filter /FlateDecode
+>>
+stream
+xÚ½X[sÚ:~çWèÑÌU’u±›„dšž3sÈÙ¤ÓqA1ž€MmÓÓüû³²eƒ��Ð<[«Õ·ß^´A"èªw6î}¼XKé£ñRR"¥–�§èΣ„õ¿�¯‘k>—°±ü|ÏMÀTà]¤“ÕÂ$EXÄibE{Ãqïg�‚$A´Q8`M½»oMaí�F ÿJÉâÂÇ‚ûð{ŽF½¯=â`’u¸°þ7PX
+)I1©ñÞ3&Jõ6t7Bz¿úLxi<ukZ9Œ7¥”5fžFç&ë8ñŠM-výž²Sƒ—NŠ°O½ikçÇK&‘Ìð°˜ÖšÖ4Þâ[é
Ã8ÖA#s>¼éûÄÃÙ´¥ùùe�H¤Vvó@X*�Ôp^)
â8‰*—…Õ£±4lΣqR=ó"L¦a6­Þ~„¹[—¼z>XX)èfa±auË 
c˜i01¬ÅÉ]uaŠ0žçÛS/ðØ^wQêC�²cüõÏíÙ—á¿}
+À>ì7aùX<-MWœ-l=œ(èànl}¾z5Þ<z+^¨ŒÇðüy4ºÞ¼õ\É°:Ž¦Û³ëáù˳їpó÷¤ã®<œvDõÞ¼b'Ê«‘¹]n0Ù�É—i’›ãÓ+3�U4{)y�umê*z&ó®�ê÷2K'&ÏJÓ‡V¥Û0¨ú˜u™õ.uëÓüÐW†)'á«“„PÞ%ÌÎãåÌd£U\ì­¸vð¤”ýž[á“°Qî˜Ù‚ð.a𥼛>#ÞÓð÷d&‘9�VÜØ‹÷÷IhXÃP}h�”oWYºZ¾?3£r$:HF^Š�&9â(	‹Ufê´ˆlcC…³Eu%@§L	VB˪®kL4àá´IL¦°�âU=‰qÝÓ…É'Y¼¬{ä
	¨£8¨õŒÿU»(öû5'ö¾Àm;1ö§}Xk¥ÚPÉ0…o¥ÊO}ƽU1«º©já
ª¸e
+Èã¢RðwìB¯¢k’E'-në-ÌÑr¹J&%ÝÃÃÆ@V(Š5뚊6ž–ă
Œ:Àñ)¬¡ìþ²8�v¿Û[½ÕW‚q‚+
æÃÉÂ�I‘9ÕzM5óqW3\<Ë@œPUËäø4’?+©mhç%¾}
‚9R.Ѽ©úï$œ×7a¶¥Ye—Þ"|àîŹOWÅrU4’‰�~£|)f�úѬ~‰ó
me@`‡ú¾ëŠm†Y¸02¥^»¯éš'˜CO¸gf¤_Õ3ã‰uعR@6@Ü�®=:@šCÀûNE9ªªÖd­0ãâ…Àø'×b¡m9L´š°×žØŠ
Ë«­Ãz°«ƒÄU¿"u3žiEÅ<ª4–ü5ø¶Ã`†€y“s�×±ó?ÊíÖªXMÍ‚êû‚ò"6ËKy¹¬,ö6Û.TcÊšq4ÅŇŽ³Nî�ÔªefÂÅ�¹é<.ÍÔ*’”åf¢Ü] „ÀħÇü§T»_b¦ æÚÙNp,Àï\`)]š\™Äd0†Õÿ|¬µGiÙ{=E64<“lbüˆ5¼
+endstream
+endobj
+5037 0 obj
+<<
+/Type /Page
+/Contents 5038 0 R
+/Resources 5036 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 4906 0 R
+/Annots [ 5009 0 R 5010 0 R 5011 0 R 5012 0 R 5013 0 R 5014 0 R 5015 0 R 5016 0 R 5017 0 R 5028 0 R 5029 0 R 5030 0 R 5031 0 R 5032 0 R 5033 0 R ]
+>>
+endobj
+5009 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.489 758.07 144.738 768.652]
+/A << /S /GoTo /D (tls__logger_8h_a6b30aace4c91e3ec0e218f8cbc952e89) >>
+>>
+endobj
+5010 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [148.224 759.962 172.148 768.446]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5011 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.489 730.174 172.139 740.757]
+/A << /S /GoTo /D (tls__logger_8h_a651d4f36081a25b3faef1650dd09e146) >>
+>>
+endobj
+5012 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [175.625 732.066 199.548 740.55]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5013 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [245.136 730.282 273.543 740.55]
+/A << /S /GoTo /D (structpktype) >>
+>>
+endobj
+5014 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [288.496 732.066 312.42 740.55]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5015 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [338.335 730.282 366.742 740.55]
+/A << /S /GoTo /D (structpktype) >>
+>>
+endobj
+5016 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [381.696 732.066 405.62 740.55]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5017 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [449.467 732.066 473.391 740.55]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5028 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.489 702.279 194.259 712.861]
+/A << /S /GoTo /D (tls__logger_8h_a995bd949a028c783b2d017bb0a90d1d6) >>
+>>
+endobj
+5029 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [197.744 704.171 210.2 712.35]
+/A << /S /GoTo /D (structret) >>
+>>
+endobj
+5030 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.489 674.384 146.235 684.76]
+/A << /S /GoTo /D (tls__logger_8h_af93c1a98069834a92f0e5e950a26a5d2) >>
+>>
+endobj
+5031 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.489 646.488 174.282 657.07]
+/A << /S /GoTo /D (tls__logger_8h_a39ed4d1104d3236eabf2645f694cb835) >>
+>>
+endobj
+5032 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.489 618.593 182.226 628.969]
+/A << /S /GoTo /D (tls__logger_8h_a8d27a3c69395afe39b1a0eef660ead80) >>
+>>
+endobj
+5033 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.489 590.697 153.355 601.28]
+/A << /S /GoTo /D (tls__logger_8h_abd169a995e32ba3382dc2ac1e845ce7e) >>
+>>
+endobj
+5039 0 obj
+<<
+/D [5037 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+1634 0 obj
+<<
+/D [5037 0 R /XYZ 70.866 561.709 null]
+>>
+endobj
+1638 0 obj
+<<
+/D [5037 0 R /XYZ 70.866 439.201 null]
+>>
+endobj
+5023 0 obj
+<<
+/D [5037 0 R /XYZ 70.866 392.672 null]
+>>
+endobj
+1642 0 obj
+<<
+/D [5037 0 R /XYZ 70.866 365.477 null]
+>>
+endobj
+5040 0 obj
+<<
+/D [5037 0 R /XYZ 70.866 258.076 null]
+>>
+endobj
+5024 0 obj
+<<
+/D [5037 0 R /XYZ 70.866 194.97 null]
+>>
+endobj
+1646 0 obj
+<<
+/D [5037 0 R /XYZ 70.866 167.774 null]
+>>
+endobj
+5036 0 obj
+<<
+/Font << /F50 2307 0 R /F43 2258 0 R /F26 2949 0 R /F70 2881 0 R /F67 2878 0 R /F72 2883 0 R /F79 3175 0 R /F96 4060 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+5055 0 obj
+<<
+/Length 1390      
+/Filter /FlateDecode
+>>
+stream
+xÚ½YÛ’ÚF}ç+ôUËxî—×8Y§¼®xc“'ÇåÒ²T
±Éþ}ZšHè’H^¸itº§OwÏi�½¥‡½£Ÿf£w÷{)™7[x
+#-¥§E’x³gïÛX""&Sªô8Yï¬ãå„àñr2…×`7‘xŒVöò}¸ì§/Áb’]¢y0ù>ûèq¦‘Ьf˜³ôçÑ/³Ñ_#¿b�mk�4åÞ|3úö{Ïpí£‡3Úû;[¹ñ¸`HpŸ×Þ×Ñï#ìöcqvKøÅíPQO!£0IwHEŒƒ5IÎ÷xˆöá2b4s*G{wodáFÎf&ßA-â;·üÜè™Å©»sJ2BØûãyâ?Ÿ™S¦pÕH–›ûÛˆ�ùd&2_óÙ.(Ù6HH~Ä®�Ø�8&5R\{SÊ!ò.$Oþ>œ[:�óe-í—Å!š'aYß©ûé[º©
+¸‚x[ÀÇ	åcço‚ò†�ñ¾´ýºT�i*Õ–
+T‚ïÚSáÆiŽO*�8l±Vs„s6ïJ•¥åÔ“šA°\@`äZ„b¨>Ò×l‰\B%ìMWìž…¢exü:¡b¬«Î0f²‡3U*‚R9ŒÎAŽNÉ @øMè[sÖí.ð7OŠÓ˜6³ÚÏz=«Eó¾åsŸì 9‹ñ‘à$¶ïO®;LJd{HZ˜îì`•%€PJcz†cšĈº¸*ÌE¦G„KêbŒ›‰îg¼žè¢u?Š“ôÐsºï¿îŠË‡EZÞÙob¼ñw×6˜‡p¨Ðæ´
+¾Àá–}�p<>ýí�OŸZR§ó–«´!zXêÂp©Ã8’àæ-R'�ØÊ…ƒ�msÞô³\Ÿ7EÓ~”ӛ˜øÎÝ¡³wUz‚<†@8‚!ÜíKû ‚\ä7ÕM¹ÌùÜBl/‹õ¼Mæ¼ZMÙÆjöd .–s.øîêt•+b�!ÃèîÑ8Ú&‘6ê4Û ˜ÒiãT}Mëf—×`÷k°^Çi°Nº¹¤­Aß2‚´pÇïkBðå&G°¿¥8Ù$c‡SÍ2ï	I�¸‡=z™æázþ�ý!L‚»o¦nyiʸx»	Ÿ¯eêŒ\7ÊÐ+F•¯y|¸Ö!¦�Âæ?wèýCMÈ!í—§+Ã*+W%
g¹ý�åÞQ‹»
+]e9ô?[c¤`âl+2˜�…PÍu:Ãöe¦%‚üBÇ
‰ÊÅ¥ÆÌAL‘j
Õôh(eõØÓz¹ICRÆÊæ�,ÏWñ>pÛúä$Y½cÃàFyÇ*ì¤\"x„ãWQ„�¹ÅÁË”<ÕTÖÇZˆíg¶žØ¢ÝZbaܯü]àŽã—t(Ò—·ê<%N–-ì{GAÙœçBç½T‰6Ì°T€à2A(Xp“D�ѼÒZ² —Éú$(Úlïá�ûT  ö�V.šIîêj•!@`ë}„c™³›PÌᤧ´x7PÜÝ^=¿Eƒn–~Ç/ap*á¼dA�Ãþv¡j;9V¥‚S¤‡‘Ù¡QDÃpj»,¢ùIDÏ Ñ!¹_‚¤§|¸¹¬œkÄ`YL;õ—Ø{[äcÙ]­Ïz?Z¿$þ\bÁqqØl³çêVºfçFr½üc½å
JE»¾ X@àšók„m„Ãu,n!þˆ€Á•ª�å}§3ÁØÓb‰f#V¼lñzbË]¤t nUéŠå F;Cä)V�#Fºü«—w	Ç,TÚ©û€SRºÑùC;?É…ÖSAcý§ÚþysÿUFç%ð/ÂZ�
+endstream
+endobj
+5054 0 obj
+<<
+/Type /Page
+/Contents 5055 0 R
+/Resources 5053 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 4906 0 R
+/Annots [ 5034 0 R 5035 0 R 5048 0 R 5049 0 R 5050 0 R ]
+>>
+endobj
+5034 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 758.837 171.594 767.154]
+/A << /S /GoTo /D (tls1__3_8h_a42d4f54d23f86205a1fa590480181e0f) >>
+>>
+endobj
+5035 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 747.986 157.248 755.199]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5048 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 468.057 157.248 475.27]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5049 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 456.102 157.248 463.315]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5050 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 214.858 162.03 222.071]
+/A << /S /GoTo /D (structticket) >>
+>>
+endobj
+5056 0 obj
+<<
+/D [5054 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+5057 0 obj
+<<
+/D [5054 0 R /XYZ 70.866 710.335 null]
+>>
+endobj
+5025 0 obj
+<<
+/D [5054 0 R /XYZ 70.866 588.913 null]
+>>
+endobj
+1650 0 obj
+<<
+/D [5054 0 R /XYZ 70.866 561.717 null]
+>>
+endobj
+5058 0 obj
+<<
+/D [5054 0 R /XYZ 70.866 418.451 null]
+>>
+endobj
+5026 0 obj
+<<
+/D [5054 0 R /XYZ 70.866 311.803 null]
+>>
+endobj
+1654 0 obj
+<<
+/D [5054 0 R /XYZ 70.866 284.608 null]
+>>
+endobj
+5059 0 obj
+<<
+/D [5054 0 R /XYZ 70.866 177.207 null]
+>>
+endobj
+5027 0 obj
+<<
+/D [5054 0 R /XYZ 70.866 114.208 null]
+>>
+endobj
+5053 0 obj
+<<
+/Font << /F50 2307 0 R /F72 2883 0 R /F96 4060 0 R /F79 3175 0 R /F43 2258 0 R /F67 2878 0 R /F70 2881 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+5069 0 obj
+<<
+/Length 1303      
+/Filter /FlateDecode
+>>
+stream
+xÚÍ™Ms£8†ïþ:ÚUk�¾…®IœÔd/³‰sØš™Úrl�—�¼ggþý4 l8©=$o·úiuK˜ 5"èft1}¸–yØ(ÅÑüÒ{J!mVÍWèó˜1ù:¿E¾ãBÁƒéåkÿÉN¦L{ã«p¹ßØ ^Ä~$·ŽfóÑ¿#
+wD’ž‡=&Ðr3úü• |w‹@Ñxè¿ôÎ
’c)8|~B÷£?F¤ÕME1ÉýT˜JÌ°œL)!dü®gÁrö#þB$�?šxöáZ3¤±Ñ„&2M9Åž™Âsè¯&SU|8;M$Ò�e#Ú­ÝÐînF\Z¢)¥ØH•	YûWáØGî¡l`ÜŒ
ñ y8¿Â3�*Üd0¡‡�ÛßN8ñbXS©°ÇµóI¾©O»š°,•8Šä¡²G‚SÊÀ–VhÊØÌî…°¯ý`�¥Udw“)'ãç	“ãäsrÑNàÊ�Ø+»zq%‚싲k;máĺÓç¨xëÖ.³Tu‘ÀL&ÁHI<”.x		Â8¦œgþ}š01^ìƒC”ŽËÁ¬K{% í•×”öf†Ð‡¬?¯D2A$R\À|VMp·ÀDr'‘Î9]šs3Á@Ê`!ò¤ªN÷Ä"úZ,åˆXz´l1Š!¨ï—ñ~ç
+Ð2„âã¯ÉœðKž3iµîázHªQ"á¨3‚)ÏAf©1¢0çë©÷³XK½h±7õc%8�»³ÏUVÔ€ûrîÎ'»¢ä
+Ê>+uEu슗ilȸoc„ç{¶ÅæÞª©ý0+û´ŸËÙݼÆ(Ú†¶w Ž	dØÉ´ÈiÀÌ�Ør»ô—xñ"X-v®=."÷½Ùñ[RyÂ$èr¼YÄïÑu¤€¦�‹-*ÖJ�ÎÈaYŒÁÛK)ÌŶ
+$`½@<yÀžu^�Õ”h,ÁbOË¥¡”c
J¦ã¿óús"-âÐ%‚;ORÊ®jê“X¤ê]=­¢	Ò,ÑŽ»»ÆÉ
+Ä¡cÁKH×T +ü)PˆœBÇz$߬}z¸ø}öçk×é\cML¹Hn¿Ç?·ö…W%ƒœ§C!ùý¯¶Æß%÷oz�_ö´þŸ�ÿãýýÃìnHÞÊÃÅíì²®Ur/­>m½üy«¤5½òT“\¹	úM�j23�Ì(&
Ë°aYÓ£
+öÚ´t*i[Ó£
+¶>„kKMË(L™¾vË-�à¬Ê†[[Þvÿ8�zþä/³óïÉ™MþýÌ.3ºÜ!ê’‰žWÁ�„ÐáÒpð%<ÀÛv°<…
m|)¡#ë¼,6€ïg³|Ñè
|+àCÍ®çÛÙÁ*� \
ã;HÃñåRÕ;ÇŠ–
+ˆч®Ù¸ŸÑzÀE«À‘¿ǽuè¶6M3ÿ4íÎÞVI�„h–h§=HÃÑf3¦Ïñ…2•®¯Ý¢¥
v?›õ°‹FOÁn™»�Ý©’	Ò,ÑNs�†£I$¦>Kc†õ7¦¸âk ÚÏn=Ñ¢áÑdç³7Û0òc›®áûµE{»k`ÞÙá*/�<ƒidÌ
Ô�¹Qئ²œ®GÞÏl-ñ¢Ý¾À£ýã?vŸ&ÞÙß
+,6Œww‰|;P‘JV1œvù±1™¡0ÓJ¤?†I�¥pÄJ¹zc»ƒ°æ/û
+K «0ý…áç:yÑ1¶ÁËýÊ/¨¹„á
+endstream
+endobj
+5068 0 obj
+<<
+/Type /Page
+/Contents 5069 0 R
+/Resources 5067 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 4906 0 R
+/Annots [ 5051 0 R 5052 0 R 5060 0 R 5061 0 R 5062 0 R 5063 0 R 5064 0 R 5065 0 R 5066 0 R ]
+>>
+endobj
+5051 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 715.207 176.376 722.691]
+/A << /S /GoTo /D (structee__status) >>
+>>
+endobj
+5052 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 703.252 176.376 710.736]
+/A << /S /GoTo /D (structee__status) >>
+>>
+endobj
+5060 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 492.023 157.248 499.236]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5061 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 294.114 157.248 301.327]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5062 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 281.055 162.03 289.372]
+/A << /S /GoTo /D (structpktype) >>
+>>
+endobj
+5063 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 270.203 157.248 277.416]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5064 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 257.144 162.03 265.461]
+/A << /S /GoTo /D (structpktype) >>
+>>
+endobj
+5065 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 246.293 157.248 253.506]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5066 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 234.338 157.248 241.551]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5070 0 obj
+<<
+/D [5068 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+1658 0 obj
+<<
+/D [5068 0 R /XYZ 70.866 771.024 null]
+>>
+endobj
+5071 0 obj
+<<
+/D [5068 0 R /XYZ 70.866 666.526 null]
+>>
+endobj
+5041 0 obj
+<<
+/D [5068 0 R /XYZ 70.866 588.968 null]
+>>
+endobj
+1662 0 obj
+<<
+/D [5068 0 R /XYZ 70.866 561.772 null]
+>>
+endobj
+5072 0 obj
+<<
+/D [5068 0 R /XYZ 70.866 454.372 null]
+>>
+endobj
+5042 0 obj
+<<
+/D [5068 0 R /XYZ 70.866 391.059 null]
+>>
+endobj
+1666 0 obj
+<<
+/D [5068 0 R /XYZ 70.866 363.864 null]
+>>
+endobj
+5073 0 obj
+<<
+/D [5068 0 R /XYZ 70.866 196.687 null]
+>>
+endobj
+5067 0 obj
+<<
+/Font << /F50 2307 0 R /F72 2883 0 R /F79 3175 0 R /F96 4060 0 R /F43 2258 0 R /F67 2878 0 R /F70 2881 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+5077 0 obj
+<<
+/Length 932       
+/Filter /FlateDecode
+>>
+stream
+xÚ½WÉrÛ8¼ë+pzÆÃŽc6»*¾Ìغ%©”"Á²jdÑC2ûïç� J”hË™9HÜPý–n4Î挳«ÁûñàâRsæÀ#ÙøŽYÎf½ƒl<c_†Pg#aÝ°Z–ß—ù<C>œg#úEføîÓçËÅ2¤»›p—ÕŸÃj²oãÏLIÚ9ŠZc"×ñõàÓxð÷é-g¸‰í8¡Øôaðåg3úö™q�Þ±ê‘Li	ZIº_²ÛÁŸÞ[�Ø)¸˜>çCªæ–Šˆµü
+ÅM(óU¾rÍé‡1Å‹K+˜o9F<ÎFÁi•à~å‹Y62¤�ô:BÕ•¦‹ySëÍÕ€e5!‚×:
¡j†§Š..½Ù	�PlºXt$èA½°-‚šµmÊÈs@ãØH(êtÓ™HlMÞt¹«*Ý?ù4”åbÕ|ËïÒu’.uï$õ.:Š¡~Y¬P×
BÇRâ%VcìNÔL!
¥Lü‘	5œ“‡Pâ°lµ¢K+Fp°FœÒ
+r’“q­üfNý6Ü€B<…A£‰ˆZª¶%UB	Rn[RÎG‘øÙ[: I®Ý^Äê>¼”ÛVZhIyòœ¼	!�o$õõGÍCG‘zß2¿5�w˺;|X½À7t‡oD€ªm�Þ°XU	ù„%ÌB5Y,;�²ì1$f¸];Þ1t*"U¯¨úÿc¾+A­7'Õ…’R7x\oÃHó]qÎé•Ó:cmß|W™Á}úöf§„”;7n‹d$Mq¢§x3íË6É_¹´eãù[¦Ó:‘Ï:|@p
Zœ“é!QaNCô“ýzŒ£> …
cEË�o�àÃâñ>·?Õ¹;ˆ„S~`^îÓñ{YC&c¨š¢}® M�¦�Rnb忶
AL(yr‹ˆŽÖ#+�+ãmÉD¤ÃšÞÅNhßg
8®»YÛ3Ò�%œ½m’Ä@L´ÂoÌà�ÜtÈÓõGóLb˜‡Y‡€ôg$zÈAXÒà›=ÆQ/@… ­l{
n½à:C²Ïø÷üéiC÷“Ush:m$ËÍo™ÃuˆP&ü¦ÍÂ_á©#‡zŒï=Bx°RPL^ì›ÂuFËDÈhOôœ^l�OWEþó±w’k
\âkŽ�k¶hëg�ÚaKi0¦ééUX…bR‘^“†w²ü˜g´ò==7<­öSüµÕp¿
+endstream
+endobj
+5076 0 obj
+<<
+/Type /Page
+/Contents 5077 0 R
+/Resources 5075 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 5082 0 R
+/Annots [ 5074 0 R ]
+>>
+endobj
+5074 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 676.071 147.684 682.63]
+/A << /S /GoTo /D (structret) >>
+>>
+endobj
+5078 0 obj
+<<
+/D [5076 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+5043 0 obj
+<<
+/D [5076 0 R /XYZ 70.866 773.016 null]
+>>
+endobj
+1670 0 obj
+<<
+/D [5076 0 R /XYZ 70.866 745.821 null]
+>>
+endobj
+5079 0 obj
+<<
+/D [5076 0 R /XYZ 70.866 638.42 null]
+>>
+endobj
+5044 0 obj
+<<
+/D [5076 0 R /XYZ 70.866 575.215 null]
+>>
+endobj
+1674 0 obj
+<<
+/D [5076 0 R /XYZ 70.866 548.019 null]
+>>
+endobj
+5080 0 obj
+<<
+/D [5076 0 R /XYZ 70.866 440.619 null]
+>>
+endobj
+5045 0 obj
+<<
+/D [5076 0 R /XYZ 70.866 378.688 null]
+>>
+endobj
+1678 0 obj
+<<
+/D [5076 0 R /XYZ 70.866 351.493 null]
+>>
+endobj
+5081 0 obj
+<<
+/D [5076 0 R /XYZ 70.866 244.092 null]
+>>
+endobj
+5046 0 obj
+<<
+/D [5076 0 R /XYZ 70.866 187.954 null]
+>>
+endobj
+1682 0 obj
+<<
+/D [5076 0 R /XYZ 70.866 161.294 null]
+>>
+endobj
+5075 0 obj
+<<
+/Font << /F50 2307 0 R /F72 2883 0 R /F96 4060 0 R /F43 2258 0 R /F67 2878 0 R /F70 2881 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+5116 0 obj
+<<
+/Length 1630      
+/Filter /FlateDecode
+>>
+stream
+xÚÍZ[oÚJ~çWXç¼ÀQØî}½:U¥6¥i›Jí	ôá(©…¬€MmÓ&ÿþŒoø‚¹84G<DØëõÌì73ߎgƒ­™…­«Ö›AëÅ;�-i)™5˜Z
+#[JKiŠ$±ë¶M°ì||´<c\‹ñð;ga:]ªìö[o¼^7…ŽçFS[½AëG‹ÀLl‘�HÛF6åÖxÙºý†­	<ûh�Dm[¿â™K‹†gp½°ú­Z85#*¢Ëè'5Zª£%A6O­þÒ¡¼=òGK¿CH;ˆ-ËDÖZêüî±�hŒ°Î-üÍ2ÂRXŠÁÒ°½OÌ怆NEÄ�¨’¢œZŠ3¤˜J ¹ïPÜ6†ÛÛ^ÒiJŸªœ–ë&˜ÁuYy8O£åºÃ#+À”Çd ÷0ž�ÜYúøÊ÷Ö«ä2ô’ßï飅7›™É¶éTb¤äLßöˆPûEŽ€æ2v¦¡I-%"QDh§K0Æ}göz1»ÃÉ��0'"­0‰ä`«Ë )ODüôœI§+‹/'·‘ˆ8É!…¸V—¤…LÞrÜ0­eA4Ñ`Š�±A�Û¶€±X`:-7³1 Ž#¬l«K9�D2LLü†º£pí§az<0m'œ/“¬.D…ÊaìÉÄ À
\¨ý.ˆØbwXœ&#!Á1Ò�X¿�´]u^yù+d3þT½eRˆ<LHYñ†ö»¸!€AŸ`ô¶Ï@„Ú/â°ß›ËÈè€P¤	>à6¤'“>�)„‹`¥ÁíY4ԆȖ¸�æihGöø³Ô°›«ªoR–À©à+¯ŒøÆK“ÒFyÓlŽ$WwS¨Àw¨”X1/À&ü˜êŒH"Ý­a8&†l<Vi†‹Øühé%¬Ãº�ÙëÅ‹„Å>y)�­|/ôÆÞbs7óMPÎómEv®��èMlôå#¹Ú?�©;1ÓDÉàSøéóÕUïføþ€"ÝXhq\ÓTÁµˆÒ|¡îx±ž¤¼Bßqghþê€zzšž?voÄ‹€YÞG)؈Ûe-{Nk‡ëßaož/„×{Wg†Äi’˜_æ–›ØúÜ’üT=E«ÊCùûqQz»fÙñÌåã
+b%œ–×r»©7ŽÖÛ†Ñ/K�Ù@£]‚hZ2üCÂ�M¹•�QÕñwü¨K :ÃPa”A£õ™BÏ
+ˈàO†1­å
+B2ÙNxq²GToD×{D<²òÍhù}aNÖ(l$¶#àX‰[�[ä‹Ý™½v¡tr­ƒÔq§ÞžW½q8šTà‹6|¥ôçB@³è«‡êJä²ú€fö™tßø?�ÿÞ,Þ³ÅöØYÍ�?ÖNØ4àvH\÷Τ™o©ŠÊ5žø–ÔçFÖ¹¸n&š)$³$Ø/ùòº8¾%u•	™®
ÎÏ,pÎøÞ„»c¦v®y‡p	Ÿedz¼ˆÞ ¸�Œ$U”D¼|«äÌÐë¹ãÞCCôŒPù¯ƒ*çk+?LZ梱l™zX´_ð%
+¶^ñŒ µa-Ô™9æÒø
ÝR·�[]önk#a×B'í3„î­	GÎ"8Aɪ#üòõÍuïß=‘½ºW¦v¹oFóZ"ÊŽ¨­ú®ždO0kf�Í�´åaˆ>ôû_{7ÍdCÉô²û_ß|ì]c˜G.«ÁZ¿«)~–åÐ�	Vž˜faì›ÚZ¥À�[˵Ã6>3T^/ö²â‰ÅÜ$æŒ-”òÝÛ®oLÙòÜ0®sûQ™û¿ÔÒ»ËVµÃšžb×æqsøô\ˆÝ›‡Ý@iV?|vŸiù
Ás`dÇX»`ª¥o‚qã–�q'δҖ.wÚA	‡»L
|µ©B“=Þ«4OZÝùø�™vⶻqǦ怫ÒaO¶¼øMˆ¾É"ê:Äw¾·פ­ônÚc�•f-x÷3¦O¢6ûÏ ù>Þâû_Qëÿ"oÝç'­ar¦²vÇ£ÐlÎê4XIevRFÎv×Mƒ3žIYa¦`HéÍáßËY
+)®7§ƒádb¦Iÿ³"‰+dS’M|uÄYÂŒ4ù/‚ì8ê'_à‘N¨/„àð‹¤Ì=Œk|€%uË÷lo½øÌü1=Zq«6þ¢Y€�
+endstream
+endobj
+5115 0 obj
+<<
+/Type /Page
+/Contents 5116 0 R
+/Resources 5114 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 5082 0 R
+/Annots [ 5083 0 R 5084 0 R 5085 0 R 5086 0 R 5087 0 R 5088 0 R 5089 0 R 5090 0 R 5091 0 R 5092 0 R 5093 0 R 5094 0 R 5095 0 R 5096 0 R 5097 0 R 5098 0 R 5099 0 R 5100 0 R 5101 0 R 5102 0 R 5103 0 R 5104 0 R 5105 0 R 5106 0 R 5107 0 R 5108 0 R 5109 0 R 5110 0 R 5111 0 R 5112 0 R ]
+>>
+endobj
+5083 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [69.87 448.449 212.775 457.22]
+/A << /S /GoTo /D (tls__logger_8h) >>
+>>
+endobj
+5084 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [136.819 391.925 172.286 399.295]
+/A << /S /GoTo /D (tls1__3_8h) >>
+>>
+endobj
+5085 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [136.819 383.955 180.654 391.325]
+/A << /S /GoTo /D (tls__x509_8h) >>
+>>
+endobj
+5086 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 367.858 180.654 375.384]
+/A << /S /GoTo /D (tls__logger_8h_ae2132d5a0dc6fe9904607b60d73cd4dd) >>
+>>
+endobj
+5087 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 351.918 159.733 359.444]
+/A << /S /GoTo /D (tls__logger_8h_aa044d181bcf7e7b069c765f0f61666c3) >>
+>>
+endobj
+5088 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [320.928 351.918 356.395 359.444]
+/A << /S /GoTo /D (tls1__3_8h_a42d4f54d23f86205a1fa590480181e0f) >>
+>>
+endobj
+5089 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [379.508 352.884 402.423 359.444]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5090 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 335.978 205.76 343.504]
+/A << /S /GoTo /D (tls__logger_8h_afa1794a7a7edf39877bf04448eb73322) >>
+>>
+endobj
+5091 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [320.928 336.944 343.842 343.504]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5092 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [362.771 336.944 385.685 343.504]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5093 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 320.038 184.839 327.564]
+/A << /S /GoTo /D (tls__logger_8h_a9c5a0178dbefc32b05346ed2cb72fb8d) >>
+>>
+endobj
+5094 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [187.03 321.003 214.129 327.564]
+/A << /S /GoTo /D (structticket) >>
+>>
+endobj
+5095 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 304.097 184.839 311.624]
+/A << /S /GoTo /D (tls__logger_8h_a2b301f7e69e5ce3e02c33aad08173456) >>
+>>
+endobj
+5096 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [187.03 304.254 226.682 311.052]
+/A << /S /GoTo /D (structee__status) >>
+>>
+endobj
+5097 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [241.426 304.254 281.078 311.052]
+/A << /S /GoTo /D (structee__status) >>
+>>
+endobj
+5098 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 288.157 176.47 295.683]
+/A << /S /GoTo /D (tls__logger_8h_a6b30aace4c91e3ec0e218f8cbc952e89) >>
+>>
+endobj
+5099 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [178.662 289.123 201.576 295.683]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5100 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 272.217 205.76 279.743]
+/A << /S /GoTo /D (tls__logger_8h_a651d4f36081a25b3faef1650dd09e146) >>
+>>
+endobj
+5101 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [207.952 273.183 230.866 279.743]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5102 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [266.532 272.217 293.631 279.743]
+/A << /S /GoTo /D (structpktype) >>
+>>
+endobj
+5103 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [308.375 273.183 331.289 279.743]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5104 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [354.403 272.217 381.501 279.743]
+/A << /S /GoTo /D (structpktype) >>
+>>
+endobj
+5105 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [396.246 273.183 419.16 279.743]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5106 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [454.826 273.183 477.74 279.743]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5107 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 256.277 218.313 263.803]
+/A << /S /GoTo /D (tls__logger_8h_a995bd949a028c783b2d017bb0a90d1d6) >>
+>>
+endobj
+5108 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [220.505 257.242 235.05 263.231]
+/A << /S /GoTo /D (structret) >>
+>>
+endobj
+5109 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 240.336 180.654 247.863]
+/A << /S /GoTo /D (tls__logger_8h_af93c1a98069834a92f0e5e950a26a5d2) >>
+>>
+endobj
+5110 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 224.396 205.76 231.922]
+/A << /S /GoTo /D (tls__logger_8h_a39ed4d1104d3236eabf2645f694cb835) >>
+>>
+endobj
+5111 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 208.456 205.76 215.982]
+/A << /S /GoTo /D (tls__logger_8h_a8d27a3c69395afe39b1a0eef660ead80) >>
+>>
+endobj
+5112 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 192.516 184.839 200.042]
+/A << /S /GoTo /D (tls__logger_8h_abd169a995e32ba3382dc2ac1e845ce7e) >>
+>>
+endobj
+5117 0 obj
+<<
+/D [5115 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+5118 0 obj
+<<
+/D [5115 0 R /XYZ 70.866 771.024 null]
+>>
+endobj
+5047 0 obj
+<<
+/D [5115 0 R /XYZ 70.866 707.711 null]
+>>
+endobj
+1686 0 obj
+<<
+/D [5115 0 R /XYZ 70.866 680.515 null]
+>>
+endobj
+5119 0 obj
+<<
+/D [5115 0 R /XYZ 70.866 573.115 null]
+>>
+endobj
+5120 0 obj
+<<
+/D [5115 0 R /XYZ 70.866 524.433 null]
+>>
+endobj
+1690 0 obj
+<<
+/D [5115 0 R /XYZ 70.866 508.435 null]
+>>
+endobj
+2935 0 obj
+<<
+/D [5115 0 R /XYZ 70.866 178.423 null]
+>>
+endobj
+1694 0 obj
+<<
+/D [5115 0 R /XYZ 70.866 162.425 null]
+>>
+endobj
+5114 0 obj
+<<
+/Font << /F50 2307 0 R /F67 2878 0 R /F70 2881 0 R /F43 2258 0 R /F72 2883 0 R /F96 4060 0 R /F23 2944 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+5159 0 obj
+<<
+/Length 1426      
+/Filter /FlateDecode
+>>
+stream
+xÚÝZ]oâ8}çWä1‘Šk;±?îÒíH•VÝm‘æ¡¡D	›„mûï÷:”„�H¦3û€‚±¯Ï¹¾÷\'ؘØøÒû}Ø»¾eØp‘äÜ6†SC`ärnI'Æpb<™aõ©pÍt‘Œ"?õ&	šçwnƒ…ʯÔÔ"ØT±
+}e}ÞŽí"æº0Q6ÁBßîý1ìýÓ#pd3�ë"—:†¿ì=}ÃÆ~»30²¥k¼d=—†ÃlÄ®Æcïï®-�`$˜äÛkàár7^êå†>¦ñÚO×±J2sÊq®oaðwGÂFŸ:ˆ³|ˆgJYå/ÆSŸ1n&ilõ	3aÔâg½²xV,ñ!ë¨gΠ«ŒPo¯o…&s)´”"*m£O$
�ÌŠGojÙ€s¾˜X­`!*L½4ˆÂü^4Í[¯ü®§EzÞ:P}["ì}‡`Åø·ëÐ×cµ…Î:L‚Y¨&¹-‹(œi,AR‰
+a>c†áCö"xr±ò
++ò9”…“$¿3�£e�ZÞ$i´ê¿X@«—úócXô7sQ$mz�-ÊÌ(˜Çà~0y«•
+'£ LaqpŒ=Žv}K¹!ÁfšO(C˜Ðrk>clçþQY`璲Ͻå`ó*§Ê©61»x½ªÝX¨ðTÂú�¨váf üblQl¾¥*©º:̨f*.Ì(‚U”·€bµsŽNtÞh4ÇÁlÓ?ðvíþ¡¬ƒ‰1kÝ.¥ÞÈìêƶڼ6G˜Š&Óþuºï@¤'‚òž(T;Ì—Þ‘ÎÕ
7ñÂ~Œ-†Mtº'�ãž0Ž¢ÅÇ^àGË•«3دùÐ
 xSvÊÞ§í;ïÈ
 ‘IÇ- ÈHƒÅœç­N¢-?Htpo�ÙÓ÷x2¦éh¡¦�Dv@Ûâv«¡ûôÀ-AÀÜU‘¢—˜ìlºlÍ[q¼˜ªÚ›ñÒZìýª ƒ€+!6áf©ödì…�„¬Bÿ5X.ï/T)
w¥àÆVë«„ZP®¯ga¼›wô;WÑøs/ÎûWcAÌvššÄ~ƒ¨Å‘d5•:!ƒV+°1­(ÓÅbï@T[/Ç¥ö)ÓÚ¹„“–…L^9WfiŽÉç“~:åŒ#;ÕDõ®TvÊ�AY�ä%¦†ñ¸¸ýYˆ/£y)ΦÈ&g³¾IqãËòžÎ´RÊC¢3
®Ê³‘

¸»ÚøÊKËR«è�ËÏK“5‚“NM!�ÏÚ×›d�a|�‡0âò�Z-Ûú–n7y�½Dq§£í,E'd7’ã¼R(7k¼b½O÷0v ²xÖ³x³j³5ŠãLT¢#Q]äj‚vÜnt°¤Hص䡶¤}{.’¬Y!‡¾×MÎ$6¸¬¸8g6(r9«
+�_Š?Zikߺ(	%˜ÿÙµ&¤^Ë<†ÇŠ.9n£m·EëtµNGs¨1/¨P?>qw¸¼ø\fé½O|æ!¢£êE¸`­’|Ÿ¡·Ã¬—ì)W·ê˜O"9Ñ'	ïÅT5©�l‡üâD»9ÔmDô üêÁ%l·ÀÆÇ0¾_»¶@¶¾v/N«í‘MÏ [BèfµTý
ÙÛêµNó)O™õ;ˆÀß0Ææ�J½`QÖ¸7*ñã`•=ÏÞ]#†áân1Ζis/œ,6$1°„¥¨èWÎý³ëIZÆåu¥W�nöýÅâªôs¢÷#ëÃr
#@.u£¡æbÇxWã®�ÿÍ¢Ž¹NçQ|€§ÊÊa“8z�sNAÒŸÁwmT‘Vý(­>RØ÷ªÔ¤öXƒ7-Ê7,8¢Bó·yÁÂaˆC“™òE…*~?¨Ø>ß¿‰²ð6ÓtCy[7ñ?ÅBü
+endstream
+endobj
+5158 0 obj
+<<
+/Type /Page
+/Contents 5159 0 R
+/Resources 5157 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 5082 0 R
+/Annots [ 5113 0 R 5121 0 R 5122 0 R 5123 0 R 5124 0 R 5125 0 R 5126 0 R 5127 0 R 5128 0 R 5129 0 R 5130 0 R 5131 0 R 5132 0 R 5133 0 R 5134 0 R 5135 0 R 5136 0 R 5137 0 R 5138 0 R 5139 0 R 5140 0 R 5141 0 R 5142 0 R 5143 0 R 5144 0 R 5145 0 R 5146 0 R 5147 0 R 5148 0 R 5149 0 R 5150 0 R 5151 0 R 5152 0 R 5153 0 R 5154 0 R 5155 0 R 5156 0 R ]
+>>
+endobj
+5113 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.326 735.312 143.25 743.796]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5121 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [153.093 653.874 174.999 662.358]
+/A << /S /GoTo /D (tls__octads_8h_a6ff7f2532a22366f0013bc41397129fd) >>
+>>
+endobj
+5122 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.489 624.234 183.759 634.708]
+/A << /S /GoTo /D (tls__octads_8h_ac32bd2227bddd61a17b0de38d3023762) >>
+>>
+endobj
+5123 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [187.245 626.018 211.169 634.502]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5124 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.489 596.378 196.222 606.852]
+/A << /S /GoTo /D (tls__octads_8h_a0f21c9f01a4618b2ba2fa35696091b15) >>
+>>
+endobj
+5125 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [199.708 598.162 223.632 606.646]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5126 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [240.715 598.162 264.639 606.646]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5127 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [114.215 568.522 174.999 578.997]
+/A << /S /GoTo /D (tls__octads_8h_acdb901eb60607373df25e808e9f0c03a) >>
+>>
+endobj
+5128 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [178.485 570.306 202.409 578.79]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5129 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [219.492 570.306 243.416 578.79]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5130 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.489 541.478 172.784 551.141]
+/A << /S /GoTo /D (tls__octads_8h_acee64048f5c24fde7b69662b64fd05df) >>
+>>
+endobj
+5131 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [176.27 542.451 200.194 550.935]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5132 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.489 513.622 149.849 523.285]
+/A << /S /GoTo /D (tls__octads_8h_a74598758cc17201ad6b6dc9c9fb66191) >>
+>>
+endobj
+5133 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [153.335 514.595 177.259 523.079]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5134 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.489 485.766 176.497 495.429]
+/A << /S /GoTo /D (tls__octads_8h_a3efcd968dd7f10d5c1657a3459572313) >>
+>>
+endobj
+5135 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [179.982 486.739 203.906 495.223]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5136 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.489 456.991 196.348 467.574]
+/A << /S /GoTo /D (tls__octads_8h_a0efa0fde372b7c30c52f2a5bb87b53d8) >>
+>>
+endobj
+5137 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [199.833 458.883 223.757 467.367]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5138 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.489 429.243 191.058 439.718]
+/A << /S /GoTo /D (tls__octads_8h_aeb68aaff5654f79b11bf1489c6621d32) >>
+>>
+endobj
+5139 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [194.544 431.028 218.467 439.512]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5140 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.489 401.387 195.541 411.862]
+/A << /S /GoTo /D (tls__octads_8h_a33dec0d7edc1aee475b06eaf181422d9) >>
+>>
+endobj
+5141 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [199.027 403.172 222.951 411.656]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5142 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.489 374.343 191.721 384.006]
+/A << /S /GoTo /D (tls__octads_8h_a24550ec574b05d7c2757427e513f7f0d) >>
+>>
+endobj
+5143 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [195.207 375.316 219.131 383.8]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5144 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.489 346.487 168.795 356.151]
+/A << /S /GoTo /D (tls__octads_8h_a10136983b6ac2a3a8c83db12b30684b7) >>
+>>
+endobj
+5145 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [172.281 347.46 196.204 355.944]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5146 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.489 318.632 171.924 328.295]
+/A << /S /GoTo /D (tls__octads_8h_a45b0fd64bac9cb68498ba9780645eef0) >>
+>>
+endobj
+5147 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [175.409 319.604 199.333 328.088]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5148 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.489 289.964 158.062 300.439]
+/A << /S /GoTo /D (tls__octads_8h_ac4412f87c137a3bc3be78ff34b0330db) >>
+>>
+endobj
+5149 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [161.548 291.749 185.472 300.233]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5150 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [202.555 291.749 226.479 300.233]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5151 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [114.215 262.109 184.216 272.583]
+/A << /S /GoTo /D (tls__octads_8h_a87568e9d7e93086c6236b574ab1b1cb3) >>
+>>
+endobj
+5152 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [187.702 263.893 211.626 272.377]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5153 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [114.215 234.145 192.089 244.727]
+/A << /S /GoTo /D (tls__octads_8h_a3a80e4927697fcac5933d578387fbf5f) >>
+>>
+endobj
+5154 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [195.574 236.037 219.498 244.521]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5155 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.489 206.397 198.715 216.872]
+/A << /S /GoTo /D (tls__octads_8h_a6b30111fa707d3dca3a1e3c8f8cc89de) >>
+>>
+endobj
+5156 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [202.201 208.181 226.124 216.665]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5160 0 obj
+<<
+/D [5158 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+5161 0 obj
+<<
+/D [5158 0 R /XYZ 70.866 775.009 null]
+>>
+endobj
+5162 0 obj
+<<
+/D [5158 0 R /XYZ 70.866 693.571 null]
+>>
+endobj
+1698 0 obj
+<<
+/D [5158 0 R /XYZ 70.866 177.339 null]
+>>
+endobj
+5157 0 obj
+<<
+/Font << /F50 2307 0 R /F43 2258 0 R /F70 2881 0 R /F26 2949 0 R /F67 2878 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+5187 0 obj
+<<
+/Length 1037      
+/Filter /FlateDecode
+>>
+stream
+xÚÍXK“£6¾ó+t„ªÐÑ[èšÇLÕ\¼Ùø¶»µÅØŒ—”
ggÿ}KØ`ð“IU.ÉFúúk}Ý­Æ”,%�Á/ÓàçEIVkA¦/ÄPH´&ÆrÐŒLçäSÈh}™>�Ï„Ô¸q÷óC¾Ì¢˜›$ü­œmWYQ¥U^õÒà÷iðwÀp%%l™$�pIf«àÓJæøì‰ ¢MÈ÷ÝÊ‘J€’çKògðG@�h2
+FYÝæ©І¨f€G1£”†Ûb¶ã3LñÈmJbÃÀ2ÕFæ±Vùr™o>SEñÃÜvÉ
k(óÛƒDùíÛb“/ŠlÅw/ËbáfÇÍk´ýÌc¢ëJ\â‰9Èu–Î�+$›•Å|ã~yY—+7KÝ°©Ê×ø{ÄT˜V³o;Eš£¤ÀU=­‡G<Umº&Çót&?fÕv]lºÛýxÄ•sÀï1K€J}š„ûL�„‰=´Á£�²£N£ôä×é×ôõ5+æ_ó¢ºB%óO™{…º-}œëu¯>š?>ƒN…þbÈ4š—³
+ÝkŸZ·-ë<
mE“=Ÿ)Ž"Æóa‘Êö6ùiÀ‰X0Ôv�w®ö¡­1žQm�ý6ˆí×t°‡Ñ˜Æ“m™p»5öàñ`˜ÇÖ‚Ü»Ïä§2÷‰[#ï&ϧá�*óÁT¾¸Ùe‹lí¾¼¹¡*݈zv;�vÓ‰j•ŸóÅ~}ž
Ï‹©Â0!á—aºNWY…d»i3TE"@˜³õ�ÉçûzøÎuéTDh:.Îaàj	L1±+Ǧsk`>JŽ7„Ó€Iÿ&°
+Dr¯ÁNÔ0Ê@)ӵؒ·	�gE¹ìÎO{Ü8F«Hììúªè‹7ÝeeGaxe•�X—\áÊ^TVa.[1¼�Tö>ƒÃʶ-v²ü¢¶>ÁOK|3;<QWÊQ�Âð	Óï’¼R‚BÛ}PäûL‹Ü¶YDŒ†ÛÕs£sSµ�*s3¬Î|3ž8¡ÙH�oÇ8Ù�s¥AÓn$ú
Ю^ߨ¶@¾Œþ¯š 
×ôEÿ
Ÿ§jAiy©ÏÁ×(¼ª’S�NYd½&¥©eÕ·ìDG“%>\GŠ†p]ÓÂ@4ÆïhZ˜ÔÀ1^Ï…´– �8�ã0\Ýcuöu�	
ÊŠÓMK
{·ÅNX´dŽ,ŽkZ–dy·¾(¡ÍHaGaxa±²Õ
úÂâ«#•¢•¶ÃÂÞgqPضÅ3Âþ…YŸ]�ã“ÓºßL½¯B°±	};FSczXJ
ì–?‰š+‹ŠÁ*ŒjHl¬¾åKZûò1+²uZ5§îzŠæ¿¡HÐðíÇ¢¾NCßø´Šà¿Ú(KG
+endstream
+endobj
+5186 0 obj
+<<
+/Type /Page
+/Contents 5187 0 R
+/Resources 5185 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 5082 0 R
+/Annots [ 5180 0 R 5181 0 R 5182 0 R ]
+>>
+endobj
+5180 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 462.593 157.248 469.806]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5181 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 211.674 157.248 218.887]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5182 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 199.719 157.248 206.932]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5188 0 obj
+<<
+/D [5186 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+1702 0 obj
+<<
+/D [5186 0 R /XYZ 70.866 771.024 null]
+>>
+endobj
+5163 0 obj
+<<
+/D [5186 0 R /XYZ 70.866 741.162 null]
+>>
+endobj
+1706 0 obj
+<<
+/D [5186 0 R /XYZ 70.866 713.966 null]
+>>
+endobj
+5164 0 obj
+<<
+/D [5186 0 R /XYZ 70.866 559.538 null]
+>>
+endobj
+1710 0 obj
+<<
+/D [5186 0 R /XYZ 70.866 532.343 null]
+>>
+endobj
+5189 0 obj
+<<
+/D [5186 0 R /XYZ 70.866 401.032 null]
+>>
+endobj
+5165 0 obj
+<<
+/D [5186 0 R /XYZ 70.866 308.62 null]
+>>
+endobj
+1714 0 obj
+<<
+/D [5186 0 R /XYZ 70.866 281.424 null]
+>>
+endobj
+5190 0 obj
+<<
+/D [5186 0 R /XYZ 70.866 163.88 null]
+>>
+endobj
+5166 0 obj
+<<
+/D [5186 0 R /XYZ 70.866 86.125 null]
+>>
+endobj
+5185 0 obj
+<<
+/Font << /F50 2307 0 R /F72 2883 0 R /F43 2258 0 R /F67 2878 0 R /F79 3175 0 R /F96 4060 0 R /F70 2881 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+5196 0 obj
+<<
+/Length 1021      
+/Filter /FlateDecode
+>>
+stream
+xÚÍXÛnÛF}çWì#	D›½_^›Ô‚n
}Hƒ–(G(%:$Ý4ßYîÒ"MJŠD%ȃÁ‹È3³sfÎYš DÐuôÛ<z}%	2Ø*ÅÑ|…4ÁF)¤-Ê¢ù}ˆ¦:™1mâ:¯îŠE�.+üÙß¹Zç™?»ÍV	%qVfÛE–|š¿C‚,��@
%ÖÝŽ~ŸG_"
+w	¢ÏáŒÁ†	´ØD>´„ßÞ!‚¹5èkóä	ɱÎsô>ú+"G— (&Ý5`†E2£„�øæÍünQlÓ2ûH$�?êr{}¥ÒØjBA3N±‘ÂcÜEžÌTÿuÃ�4‹ó«*Âòn¯#i-ÑŒRl¥òPMÃ~ÚvB3ƒ•åmé>Â}~Vu²˜PÕ>sójO/5ãkbC>ò‡åóçHA-–Jì@Ú¢«;ö€ ƒµ0hÆô„öM[즿ºF+ü…oÇ„Êûü1“n	îàV¡te&Û™ˆÓ2ÝduV&”ÆU¯c�ª 
›•JNØs£^Ã5µDŠ¬ØAxZ`*i€hæD÷æ&B0€²˜ºh8¢ÖÁž±Ç­UXê¡—XYÕ6Ë�àûÀz˜·å0AÆ\]í©
ÁÔ4z'azaIÌÐ#KáØ
+y”^&1Œkg(Çé=/â(½ÝˆU¶(¶ËK°{r‚Cf‚€¤Lb÷tŒVOúÒÔ”¯§N!‚„ÐÚøòÝfõS¹íëÒN¢{Õg`oäÓ`"‚ÀÕ%ø�ŒŸB‘×+̾<¥ù«pžWá×UÂIœºËF”{–:à$Yˆž¥ÊŽ¥VŸ×«ú.ÏVõ÷»ê¿Åz¹sÕÂ/f¬ßã¢ëm=F-¦ìy´Ýc‹ò˜-ÂœRÕwÅ÷®XÕ`¶|õšéJ‰¿ùóm÷V�í,³qE¶JÀ뛢ª_>ß\.×Uúø˜¥åÏ0[. ¸†œµFkôþy�†áÕ˜CÓh¨ý1éqMsD�9g˜·­¿ßlÏŒ8¦Æ½ˆ¸™¼1
¦Vb¥Å9
É	Z>‰ÐI�PØ0j.±{â ·Vtf{œÏóŽòÙá§Í=”�ÕèжT7 øä$‡äÀÏ„N$øtŒ½ß€œ†Ù3,Õ1¬Öy~®U¹wO4©÷µus™¯­`
¯Û}Yž¥Á9Úc“ýOùØ¢ŽG>” }Îíþnš†áå‚Bß(u	ù§ŒÂQ“ÿóŽ©E/à¡ý7ð<ºý¦úŒ¨ÓS2
BÑilžŽÑ6ØK‚†pzÊ¿œZ™Q˜i˜¬�ÌPŠ|�m³2uN:Ø‚½-Üû¿oN�âlûrþ£ÄQô
+endstream
+endobj
+5195 0 obj
+<<
+/Type /Page
+/Contents 5196 0 R
+/Resources 5194 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 5082 0 R
+/Annots [ 5183 0 R 5184 0 R 5191 0 R 5192 0 R ]
+>>
+endobj
+5183 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 716.132 157.248 723.344]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5184 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 704.176 157.248 711.389]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5191 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 433.96 157.248 441.173]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5192 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 186.076 157.248 193.289]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5197 0 obj
+<<
+/D [5195 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+1718 0 obj
+<<
+/D [5195 0 R /XYZ 70.866 771.024 null]
+>>
+endobj
+5198 0 obj
+<<
+/D [5195 0 R /XYZ 70.866 666.633 null]
+>>
+endobj
+5167 0 obj
+<<
+/D [5195 0 R /XYZ 70.866 530.905 null]
+>>
+endobj
+1722 0 obj
+<<
+/D [5195 0 R /XYZ 70.866 503.709 null]
+>>
+endobj
+5199 0 obj
+<<
+/D [5195 0 R /XYZ 70.866 359.641 null]
+>>
+endobj
+5168 0 obj
+<<
+/D [5195 0 R /XYZ 70.866 283.021 null]
+>>
+endobj
+1726 0 obj
+<<
+/D [5195 0 R /XYZ 70.866 255.826 null]
+>>
+endobj
+5200 0 obj
+<<
+/D [5195 0 R /XYZ 70.866 148.533 null]
+>>
+endobj
+5169 0 obj
+<<
+/D [5195 0 R /XYZ 70.866 86.463 null]
+>>
+endobj
+5194 0 obj
+<<
+/Font << /F50 2307 0 R /F72 2883 0 R /F79 3175 0 R /F96 4060 0 R /F43 2258 0 R /F67 2878 0 R /F70 2881 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+5206 0 obj
+<<
+/Length 1116      
+/Filter /FlateDecode
+>>
+stream
+xÚåXKsÛ6¾ëWàHÎDOâZ·vÇ÷¡[’ñèA;ìD”+1‰Ó_ß
J¢I‘&éCgzÐPèÛÅ~ûí’‘GÂÈÍì§Åìýµb$¡VkAÄ0šhMŒåTYlȇ€ÅŸ·DàoBjücùõuö%�çÜ$ÑÏ»õ×mšË"Ûånéì—ÅìïàJFà™$4á’¬·³ŸÙào·mB¾—+·D*A•øþùsöûŒõ¦©�²*OMÁPNM<ÆXtwµ¸ØÇœE»íýç4=dŠá\’ï¯
'†ZÃÀ!22@%=Ø·]¶‰çúˆSb<ûoJ¹M¿¿ýcØè73‚	I£È€Z¥=Ön],7á~CÛžÅæ	ÕVT…ýȘð	Z}¶ÈRÇâß½kÙÂ\j˜
Á•_¹þ¼Ü‡µµ�‚ZxEDS­9ì×-!ÁRàÉ	§*-’x"óA^™s‰à—^a§ 5ßb®¢tÏ%‹
+ßMKAÆ‹žý‡<}Ý®ÜJ÷¹Ø…µ¹¿–¦¾Ä”+Wewq…Öæ,$™<$ñ[Ìe´Ü/·i�ÈÑ¡ÆR[kŨÆJvt1HÀÝòc¿1†ëxE4r-u§špµ({ÆC”"25¡\$'c±Ð-wMùZE…�±
k�w%“ZÄ“8jQ9p
+ÖŽÛ,7Bðnˆ~Ê&aʸKSôlEbeD/eÜÐDòš2ÛY³�µó ¿žËóP .q¾fùc]Ÿ«à뵧]¬N»Éç4é†èg}8ÆE«RÂÒ¤fTÉ™Q-ŸžÒ|s�…ÄŽu©ÈÿÙªZZªP¾}>Å„ûP3ªÛ]LÆjuÕÓýHF°§‡ñv%(1Ú®$jV3ÓÕÁœq—U0
ÃÏ>‰b–¿…]Ip¬&—ýÊÁŽŽXk«©2/"z…´N¹ï¡Š"Í�+š3Îpìg3"Á&3
ÝýìNÂðì
+k©•oal’IjÌ™Œ[¹¯•Ú³xÿ¸[„tH-ʳ¦Š¶Y¾t^õ:£û§Eú¢=.�pBÞLƒB‡`$Ljƒ­N€¦†×ÍÎ6ÍnåŽ?Šôv§:ìn…ÍNýÌ.Ë‹°úýÔª-¬Œ–�µET /yW„—¶x@1TO*J‡øà;ÿ~Ÿ>¥'¡Uó3Û¦'Ë
f9þÞÇ …îû2ì#¥;ŽŒÓ0ü8c©x›{;HPz
+úÌrdĶ‰Z‹8Ý,ÎnG$Ød!«;‰ÝI�]�2‚þ�XÄ>v5êW„£ûê2»ã"¶²[�ئö.+lL‚KÞXÑ>8ó&e¡a"í“0í
+ÇVw뼚v%©MÌÙTo§}\ÄVÚëëã*.ý°>P^²Cgk\¦}pæMÊ‚MUûpŒÊ^XJQ&`ÈÃïêx¥)78ù�‰,(¼õ—Šj4x“æéþä›^’ÕcùòÍ�GwôBé½ô¿

+rJå
+endstream
+endobj
+5205 0 obj
+<<
+/Type /Page
+/Contents 5206 0 R
+/Resources 5204 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 5082 0 R
+/Annots [ 5193 0 R 5201 0 R 5202 0 R ]
+>>
+endobj
+5193 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 716.132 157.248 723.344]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5201 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 494.871 157.248 502.084]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5202 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 271.798 157.248 279.011]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5207 0 obj
+<<
+/D [5205 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+1730 0 obj
+<<
+/D [5205 0 R /XYZ 70.866 771.024 null]
+>>
+endobj
+5208 0 obj
+<<
+/D [5205 0 R /XYZ 70.866 668.337 null]
+>>
+endobj
+5170 0 obj
+<<
+/D [5205 0 R /XYZ 70.866 591.816 null]
+>>
+endobj
+1734 0 obj
+<<
+/D [5205 0 R /XYZ 70.866 564.62 null]
+>>
+endobj
+5209 0 obj
+<<
+/D [5205 0 R /XYZ 70.866 445.265 null]
+>>
+endobj
+5171 0 obj
+<<
+/D [5205 0 R /XYZ 70.866 368.744 null]
+>>
+endobj
+1738 0 obj
+<<
+/D [5205 0 R /XYZ 70.866 341.548 null]
+>>
+endobj
+5210 0 obj
+<<
+/D [5205 0 R /XYZ 70.866 210.237 null]
+>>
+endobj
+5172 0 obj
+<<
+/D [5205 0 R /XYZ 70.866 119.068 null]
+>>
+endobj
+5204 0 obj
+<<
+/Font << /F50 2307 0 R /F72 2883 0 R /F79 3175 0 R /F96 4060 0 R /F43 2258 0 R /F67 2878 0 R /F70 2881 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+5216 0 obj
+<<
+/Length 1098      
+/Filter /FlateDecode
+>>
+stream
+xÚÝXKsÛ6¾ëWàHÎT\<®MjÏøâÖÕ-Éxô€u,Ê%i§é¯ï‚€dÒ"%‹ô¡“ƒ‡0}»‹ïÛÄÈ=aäròëlòá1Ô*%ÉìŽhF�RD[A'³ùœ(Êu:Ú$ÕCy»]VóUI¿…7ëV7î.å,q…Ë—.ý:»"™4ŒAC5çÜ¿žü6›ü=áø–¾7g5"#ËÍäóWFVøÙaTZC¾×;7$I!“¸~ Nþ˜°“!(NY3*(gé”3Æ’ë�³Ûùã£ËW·‹T°äGåÊ/þÕ^~¸Ð‚hj5ã’‘©äÔ@О·ëU:U¯p<Fxë‘êXC�Å}ŒöærBЫL™rN-¨€WŸiüBˆ
+íÛ†}a¨²rw’_“ÁI«›,e\íö\ÿÒÆTjª™�Æ!ì\~›qoˤ¤–¿Á¢Þí)»-
+j…n[\çU·”‹½Zò0KAÁ‹K;¦P/äO-£\2**l½Ú®ó Ò=×QÏÛðDúÂb{žó¸¿&†f¨OŽx~”nXE}ày1ùü=Y2/æW¹"å<)[äve€Bj˜8–ÜÔ³Ù'ÀûBø\
¢0
+Ãàî–µÐD�~º•~˜h™@(�ß‹\f¾õ°ƒ-¶8·Š‚~e1¤T‹åE¬Tß,�¬«Êåûþ	TË!ƒŠ©qäŽÂˆì2‹ê=JF9ð“ìbÄVë˜ùýì³ØÉnÓâ.�c¶…o=óTâËnÎÿÂàV'²þ¥w+áì`YD#•0
+#(
l†�à]”ÖÒLèFÕîTÂ@‹]Jxe™Ú,°Î¶¸ì©ô^ýŸïä
;FæúŒÞ)°ñf8:´¦ Þ˜‚î
+RÛÍíb^:•½a‚®!è®ØCœ9ÁO4-z¦–ìÔÔ™ôÿ´Æ–�…›ïK\s 	KâñÃ(ùxú~ÝH`É'N¥ƒ'˜ŒqT?ªZ`á@{„?
+"T6iÕê=
+›´¨Rsr€f°«®µ™_·�O¨Œ®V…6ɳ�: Â#€Åæ(ˆÈ¦Tb²ž
+„�<I'>¹´�<í¦s˜ÅN>›ÿMqätE¤²ªÛ$›u^y�¿e‡ÔüþËgûzÈ‘öí`Ëç"ô¶*a°–ZÝnU¢Ñª
+çñÙ$HJ7´U!J÷ÿiSÛ†¡:ÛÝuã/7Î�ÁÏ©ðr+]ç4´»½æÂà&ÁM�vT.8èK‘õ+nF(,\ÕÀßã¢Ëµ¥RêS}b Å®ÂÒ²x¤Qm)tônpìÀÜ<ß¹CV@Œcö|ŒÞj‚—£E»˜ÈF1©Š§|‰Å÷x˜©LuU‘Ý÷ÊH¿ø
(“üœ9wÑ)*4Öƒ—è2 JE¿.]îŠF©s=¬?m½þùqïÇïkÿá*Ý
+endstream
+endobj
+5215 0 obj
+<<
+/Type /Page
+/Contents 5216 0 R
+/Resources 5214 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 5221 0 R
+/Annots [ 5203 0 R 5211 0 R 5212 0 R ]
+>>
+endobj
+5203 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 716.132 157.248 723.344]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5211 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 466.563 157.248 473.776]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5212 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 244.167 157.248 251.38]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5217 0 obj
+<<
+/D [5215 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+1742 0 obj
+<<
+/D [5215 0 R /XYZ 70.866 771.024 null]
+>>
+endobj
+5218 0 obj
+<<
+/D [5215 0 R /XYZ 70.866 654.678 null]
+>>
+endobj
+5173 0 obj
+<<
+/D [5215 0 R /XYZ 70.866 563.509 null]
+>>
+endobj
+1746 0 obj
+<<
+/D [5215 0 R /XYZ 70.866 536.313 null]
+>>
+endobj
+5219 0 obj
+<<
+/D [5215 0 R /XYZ 70.866 418.769 null]
+>>
+endobj
+5174 0 obj
+<<
+/D [5215 0 R /XYZ 70.866 341.113 null]
+>>
+endobj
+1750 0 obj
+<<
+/D [5215 0 R /XYZ 70.866 313.917 null]
+>>
+endobj
+5220 0 obj
+<<
+/D [5215 0 R /XYZ 70.866 206.624 null]
+>>
+endobj
+5175 0 obj
+<<
+/D [5215 0 R /XYZ 70.866 148.727 null]
+>>
+endobj
+1754 0 obj
+<<
+/D [5215 0 R /XYZ 70.866 121.843 null]
+>>
+endobj
+5214 0 obj
+<<
+/Font << /F50 2307 0 R /F72 2883 0 R /F79 3175 0 R /F96 4060 0 R /F43 2258 0 R /F67 2878 0 R /F70 2881 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+5228 0 obj
+<<
+/Length 1148      
+/Filter /FlateDecode
+>>
+stream
+xÚÕXM“›8½ûWèUkE­OtÝìNªr™lÖ·l*E<ÄvÕ²˜Ifþý6HØ0`°a’Êž0¦yÝÒëîׂ‘
aäÍâ÷ÕâÕ�b$¢VkAV_ˆa4Қ˩²º#~\½%Ÿ	©ñÅêï›Ý}.¹‰‚?²õÃ>I‹¸Øeiiºøsµøw
hÉ!£ˆF\’õ~ñá##wøì-AD‘ï•åžH%¨’ß“¿-˜ÓáäøÞn81Ôeà 8F‡Þ4PV‡ž­‹ø®Š¨†Â·lã-QmE½¤¥õ««F–28.ûö7gÑr¾†fÉ€Z¥œå.-zÀÀRàQ�–ö€Yª´:…¤ÀÙྜhZZFAGdÉ%nª_íû$,ør$ùÁ“ó9ä,x*’ƒ»Ý¥îûkµCÔmåªÜ¥òRn”6
‡]	ʸ_Û»�Ë Îã}R$yZ»ÜÇ¿Æ”2‘â8Ã]àGþ_£LE´Á
6Ch,*Ê‚˵V‘Ê%':”öyÑM|[ÂNuØ¢ÛjDxæÐåvEb‘y®=çE.Aé:.’»n``�ja¯�¬K"óH�…áIÕŠØ‘¥HÊ”eU[jeÔ¨Ï~V§y쥵é±ØzÓ¤¬Üïîæ°Í�SÉ‚²Üªî“tSl¸½:¾.1ZR;1NîõgEIEØ]™OM
ù¢ 1ÕcÁíëÕ§uö5ļ¦ÉN�³Õ\±�	 ‘’å[¶ÃÒ§÷ŸÜ]‰à;Úsé!(0Ò(ßëõšž.ўϻ3R%Ǥ
+XD�¬µÊÙ¾F¦P«ž¼¥IC�j¡ª»ZœfXy¨XðS„Jb9bœƒ«¨1Ñù¬Ÿá:šT
+Ól´|AÁXC“gËÇdjšÃ¾~Ör8 SXn»äô¬§•i*å„Ⱥ| “˜1NgaxR%¶:þ"¤JEµä�Òì'u’Ã^R›/$õKžíh½6¶.%ˆ`øLZ¯Ç8+PB•­8j”jTöP|}(>¡Ä£L=^ S¾‹}βû“LQ¯+õ?9íãÇ^<oÕÂ[oãÜÛ¶– pì¸`¦¶9L—7QÞ´�b·EQ‹ý)l[�ÔýlçÇõ]º¹Xß@ˆÉúÆž²ÕðH†Ã£RcÝ<×9ÒÉ™}‰nÈKºœ•8,@*pV›è²E80lˆ¸ý-Ÿ
ÑUk7&.4Åx&ÄÔe!›Éè,Ï(“Ô(ó§0ܪ"sìœNsÚÏiÓëñ$†îwûXð°oQ:x;Ò{ux]jB©h½³0½€C…9ú½À¢¸�ÐO§B7Zo?¹]ö’Ûòy$·Òלó¼$9nLêZΓu²sÖ.+êëãî0VBpP³XŸ€qv¸
àX²=Üèîpƒr†J6<ÛpK�³�ùÅÆ›AUÅÓ
pÍ×íz§1cŽèSª²H%)GmíõM’&yõ¯ñ9·þî^MO›’„ IŸÇø4ò?�
+endstream
+endobj
+5227 0 obj
+<<
+/Type /Page
+/Contents 5228 0 R
+/Resources 5226 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 5221 0 R
+/Annots [ 5213 0 R 5222 0 R 5223 0 R 5224 0 R 5225 0 R ]
+>>
+endobj
+5213 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 759.941 157.248 767.154]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5222 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 536.977 157.248 544.19]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5223 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 525.022 157.248 532.234]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5224 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 312.778 157.248 319.991]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5225 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 69.746 157.248 76.959]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5229 0 obj
+<<
+/D [5227 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+5230 0 obj
+<<
+/D [5227 0 R /XYZ 70.866 710.443 null]
+>>
+endobj
+5176 0 obj
+<<
+/D [5227 0 R /XYZ 70.866 633.922 null]
+>>
+endobj
+1758 0 obj
+<<
+/D [5227 0 R /XYZ 70.866 606.727 null]
+>>
+endobj
+5231 0 obj
+<<
+/D [5227 0 R /XYZ 70.866 487.478 null]
+>>
+endobj
+5177 0 obj
+<<
+/D [5227 0 R /XYZ 70.866 409.724 null]
+>>
+endobj
+1762 0 obj
+<<
+/D [5227 0 R /XYZ 70.866 382.528 null]
+>>
+endobj
+5232 0 obj
+<<
+/D [5227 0 R /XYZ 70.866 251.217 null]
+>>
+endobj
+5178 0 obj
+<<
+/D [5227 0 R /XYZ 70.866 162.28 null]
+>>
+endobj
+1766 0 obj
+<<
+/D [5227 0 R /XYZ 70.866 135.313 null]
+>>
+endobj
+5226 0 obj
+<<
+/Font << /F50 2307 0 R /F72 2883 0 R /F79 3175 0 R /F96 4060 0 R /F43 2258 0 R /F67 2878 0 R /F70 2881 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+5256 0 obj
+<<
+/Length 1570      
+/Filter /FlateDecode
+>>
+stream
+xÚíZßoâF~篰®/P•Íþ^[wª”^ziOUs½£Oé	9`ÀØÔ˜k¢ªÿ{g½k°±Á`'Õ=T‘bgæ›�owæÛU°3w°sÛûaÔ»z'°ã"OJæŒfŽÂÈ•ÒQE’8£©sß—ˆ¸ƒ!Un?]nÆñ$õ§´|½w8s‘p]ð•YÂôpïÇQïÏ�Qì��G×E.åÎdÕ»ÿŒ�)|öÞÁˆy®óWf¹r¸`HpïKçSï·.F©¨£�§0ÑQFãà[„ó8Ã(ÕèWï<Y4õ¡»Wþãwƨäoh­†„ Oc;Yø‰µõ
+¶”!�äþþÀ˜Õ€z•Ûlj=$$ß;ÄØÀä÷T	fúgH9¤ÎÎòn›®·©á#ã¼úó|›ÿ9	CóºI“Á�HÏeì`D…ά~ÜBf¥*€b@còkÐ>(ïû‰¿
+Ò b&³c¦Žh©—ŽR§ˆ&R !èŽègö¡×„p¤r£'}€5GD묳ÒnPˆrêH—!Ì=K@u‰~…lYb�`‰ceÌÑilž�]f=Tb¢L"J¼1UÙzwtb´“˨dÈU²q*X°FF¥‹»¢p‚Óv õœQÓ…eàÃÕ€àþvU¢4{_Ñ<]œ ÷âðªÔ€yÚE3½�|Xz9TE(<§§%‘‹Fz‡êÆõ÷¹í ëÉ-bîÈÍšˆ)ÉI¢Iö÷ŸÊ{9	&Aøe@EÿÜM}qÜUÆÀƒ°;±~¹�£ŠCH‰ò®Šx„_и0Æý»·£±IÉøÁß’CÇÄû®Yê¬ÐÀAnÞÄ¿Ä!NYçÄkW¶§é™%s;Å�·=ÔW¢¬
+L).6ÁC}à"é±3‚Ìmîj%	SP+¼2øÿGw>Ë^{qÃZ‹Îõ²$�vM7¦Vrª²|=ƒ¸á ¥§�â¦%dm­,av7—ÇTe\HÚ‘ÑN>,£P®™ôžCÜpZËóÎ7-Aë9-¢>�¸¹<¼*5à‚t;ŒtraÈe”K*ŸCÚp¨˜Š»�Ò¦%d=µEÌ–6—Ç]!l¡*t#½…�\Ú
+Ý“ˆ‚¶
�„¸Ë‹×)™®9¼O©Ñ Œhu#�ÄÒøº�ËÙÞq3�'ÛU¥~Æ‘Mü,·	m#…ÎN—ÁÚ':4 ¡¡‘3×bê®n!lœuòê°k°Ðy9rCds)�hauŸI¯oÂY4
fF‡�~ù4‰v}óiüS)š*�w1 „Qp&Ù!\;SBö
ÀOŽ?{È«+ƒv™§mrúuh¯|óœ'ñvm�óÜ©°É	Âù"}UúúÝã,N¬Çi8Ñ<ûÉÓéÌZ?vÎ|*I¼þxóûÏ¿Þ
†ŠjƒÌ5‘
+1X=C‚¨mïß~›}âf•|?üÆ8º)8�åó¿N¦Û0Š‡ZéÙ)†«õ2دèK	¨J¤„en%a‡ñÔU9+°ƒ`iÑYίOŽ¸|YG“åvj'õf“N!shñ}7²ž’λ*çé$<¥y
ʨ7%({Ý{A'G%?6*Š�•‡ößßF›pÓö–q4/»zh3–«p¹ËzÞC²sãëb®÷û�²‹“DÓpÖ�ZÕœÚôihÒævüpðÙNÒ`×,‚¿ëWV^FÏÌ?ÓË@›óÒî0ù¯kÃ`ø%ÃÈÕos¤Eùñyï^R¤¤0%‰jR]„û2e-¿øËú`‡º1÷C¦†ÞŽ
Ü:ÏyI`õû‚“—/ÙEÍYœê‹½†�7>\v‹MH]2ˆyïºÍmÄ\Óü×%¯:Ålø±E0G\ÁVÝ×Äᮃ—V¯WÜýJFí¢¿|iÀñMuþÒ¸`2…¤ðš](pC‰B>= Á«åFÈ—çæ!Ž—çs3‰Wk?	ºÓ"0’L|5´O‚ž<Ü2BÕÒ"Å׶e6‹p–Ž—Áì™k)©Ïi_M�°æò%eãÍ.œ	@\òï	ùy_"ª$/÷¹9^˜z‰Ÿö‚óa@wW$7±¾/y|šëÛ€þ�^‚ÿYs
+endstream
+endobj
+5255 0 obj
+<<
+/Type /Page
+/Contents 5256 0 R
+/Resources 5254 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 5221 0 R
+/Annots [ 5233 0 R 5234 0 R 5235 0 R 5236 0 R 5237 0 R 5238 0 R 5239 0 R 5240 0 R 5241 0 R 5242 0 R 5243 0 R 5244 0 R 5245 0 R 5246 0 R 5247 0 R 5248 0 R 5249 0 R ]
+>>
+endobj
+5233 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 521.39 157.248 528.603]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5234 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [69.87 296.698 212.775 305.469]
+/A << /S /GoTo /D (tls__octads_8h) >>
+>>
+endobj
+5235 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [182.846 201.132 209.944 207.692]
+/A << /S /GoTo /D (tls__octads_8h_a6ff7f2532a22366f0013bc41397129fd) >>
+>>
+endobj
+5236 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.45 169.252 142.996 175.812]
+/A << /S /GoTo /D (structoctad_a43389422956a84b8bafbd9e710d35053) >>
+>>
+endobj
+5237 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.45 161.282 142.996 166.423]
+/A << /S /GoTo /D (structoctad_aac9fd4aac8548b45f1d8653a4e194366) >>
+>>
+endobj
+5238 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [136.819 153.311 151.364 159.872]
+/A << /S /GoTo /D (structoctad_af7369ba76f648fb2c39e081239874371) >>
+>>
+endobj
+5239 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.344 145.341 126.258 151.902]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5240 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 128.435 205.76 135.961]
+/A << /S /GoTo /D (tls__octads_8h_ac32bd2227bddd61a17b0de38d3023762) >>
+>>
+endobj
+5241 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [207.952 129.401 230.866 135.961]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5242 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 112.495 214.129 120.021]
+/A << /S /GoTo /D (tls__octads_8h_a0f21c9f01a4618b2ba2fa35696091b15) >>
+>>
+endobj
+5243 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [216.321 113.461 239.235 120.021]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5244 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [258.164 113.461 281.078 120.021]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5245 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 96.555 193.207 103.774]
+/A << /S /GoTo /D (tls__octads_8h_acdb901eb60607373df25e808e9f0c03a) >>
+>>
+endobj
+5246 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [195.399 97.521 218.313 104.081]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5247 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [237.242 97.521 260.156 104.081]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5248 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 80.772 205.76 88.141]
+/A << /S /GoTo /D (tls__octads_8h_acee64048f5c24fde7b69662b64fd05df) >>
+>>
+endobj
+5249 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [207.952 81.58 230.866 88.141]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5257 0 obj
+<<
+/D [5255 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+5258 0 obj
+<<
+/D [5255 0 R /XYZ 70.866 710.335 null]
+>>
+endobj
+5179 0 obj
+<<
+/D [5255 0 R /XYZ 70.866 618.336 null]
+>>
+endobj
+1770 0 obj
+<<
+/D [5255 0 R /XYZ 70.866 591.14 null]
+>>
+endobj
+5259 0 obj
+<<
+/D [5255 0 R /XYZ 70.866 459.829 null]
+>>
+endobj
+5260 0 obj
+<<
+/D [5255 0 R /XYZ 70.866 380.695 null]
+>>
+endobj
+1774 0 obj
+<<
+/D [5255 0 R /XYZ 70.866 364.282 null]
+>>
+endobj
+5254 0 obj
+<<
+/Font << /F50 2307 0 R /F72 2883 0 R /F96 4060 0 R /F79 3175 0 R /F43 2258 0 R /F67 2878 0 R /F70 2881 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+5286 0 obj
+<<
+/Length 1431      
+/Filter /FlateDecode
+>>
+stream
+xÚåY[OÛJ~ϯ°Úûˆ{_¯ÎS j«(ÍKU”8"B’:þý™õ%¾à�¤„6Òy�h½;3;ß7—Ý%εCœ­÷ÝÖá‰$ŽF)ît¯MÀWÊц�¢Nwè\¸”
+ïG÷“Ãñ
+&Ã'£qèµ™öÝ£i°¸'q?M'vjë¸ÛúÙ¢8“8t)Ò÷ÁgÂ	îZ?ˆ3ÄoŸ”h|çßdæ�#$)8þ;ßZ_[¤l¦fŽ£¹_6SQ ¹�„Mõ(
$®Œìòôçù‡–sÑV„¸áCF“l^*­ðqÉ@ñ¯]W*ÖßOGÃêêd—©.üQÌ<ít{·£ñ¸2
½$’äv>YéNƒ¸_UàPîñ™Ó¦ÀXºÙ¿HP_:Åè)Š¦'ŸÚT0`J;m�^+<Ä’¯¤>ìï›ã®¢é]ï&|x¹ó¤ŸšÔy´Ù{ÙðéAºt›]7ý¨ª�sZ¬Ð'ÊúæQPÌ(PŠÕ‘1�€ùrßëÏfádØ›ÇÑhrýrÔ´-è&^Ü!jr#ÔJ˜1ªAâçœ"ùª4Ã÷´Ác¾2¥�ëM²Ô/6šÄ5“áÁîDMÊ¡¨)HYÏ�F4¡J	ÝcTç;ˆÄÌM°ŠÂú|ö|ŽDó×AžQÔ_˜5ãnö²fúóP‰ÝFó~•ÍA/b€QYƒ†’FÄèÞÍ(¼£ùr¯$ øFå«Ò#æ½QÕM•êµ¬j”±}s_-&Aµ«Ü$î°vmTl¤
BêI‡ñF
+s²oÓÙãëžpšŠÌ*‹ds
JníY¿Òºïi3$¿¡¦Óñæ�Lñlïæô¤8ºÉßyõ_wý‡-=­$Š�Vr½É•Fž଎¸h®#ÂßSÄ÷þðõ»`ßâ'øºž}Eã©›J½oÙ7~WMßÿø¢É‘Yl[TSýKk*#oñ¬5ºª˜”\ªR[N{]‰<„Q©ÔxmŠGJ7Ï{³Ÿ£�½J%.ܤ7ªÅÝêyxåQ$UN‚¤Í9<¼t_‹’9
!e*ùhôçéÊ0Nÿ÷Ç൹îÇ÷Ç�JÀ¶Þ ¦2	Ô€ÊHþv4	Æ‹!j·[{L£nÞ¤ËìžhiòuÂfDvŒ�˜½ÿ�×Q±–*о®(¼dLÖ‰!¥rï=&Ý"BÀnîì+îª×é¼ëyÔ=þ§sîIâ~?ëÖ%Ú¹6ròžàæØöÙ–_m_Â|-ÀøË9�<M܃ÔÇJaÜ —Kd¯Ü@,Íçœs¶F¦àÀÕ6–~>þîa%s×ËUd+tº6œj¹*Ç]ÛW¢lò¼Â`ÓHÃí­4p‘‘¡KMú|ü%ý�@fä�²–¸�³žcT›1ä Ì€K¾[NYRý)NKYcךRØÛŠmtóÛuDÀ,§ävDð([)À¶dîæ3I£*’Wªu†5†Õó[›ã±åqœ›"qÍR÷Q÷1O³G°pD£Yþö4M3Ì}Dlž¦KÝ–›ë´Ú}cæ¬
+f@yÆüwî"¾™F+œV±
+W
+:èF‘Yöetë!”YõùLã¸Ñ9ÙRëQò
Ë|“Wƒ„µGGÜ„}È“eAK7áXÊï6îrj$õÌqBË®Î<’´SI1«
+²
�çM’ƒ&¤/ŒÌTĶ6%ŒciÊdôM1ÙCuÙ
¦¶9¶Lg*³í—§ªÓÕ>«•&µ¤I+"1¯¥ƒöhíttf©`)&çKµ‚PÊAòJSòK•©éÑ[J œnóæ�?É+`Z‰$%J
“¼� TÆËá$Œúqž|6fó`óк‡Çk?hnÝÆÿɾ4(
+endstream
+endobj
+5285 0 obj
+<<
+/Type /Page
+/Contents 5286 0 R
+/Resources 5284 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 5221 0 R
+/Annots [ 5250 0 R 5251 0 R 5252 0 R 5253 0 R 5261 0 R 5262 0 R 5263 0 R 5264 0 R 5265 0 R 5266 0 R 5267 0 R 5268 0 R 5269 0 R 5270 0 R 5271 0 R 5272 0 R 5273 0 R 5274 0 R 5275 0 R 5276 0 R 5277 0 R 5278 0 R 5279 0 R 5280 0 R 5281 0 R 5282 0 R 5283 0 R ]
+>>
+endobj
+5250 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 759.148 180.654 766.517]
+/A << /S /GoTo /D (tls__octads_8h_a74598758cc17201ad6b6dc9c9fb66191) >>
+>>
+endobj
+5251 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [182.846 759.957 205.76 766.517]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5252 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 743.207 197.392 750.577]
+/A << /S /GoTo /D (tls__octads_8h_a3efcd968dd7f10d5c1657a3459572313) >>
+>>
+endobj
+5253 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [199.583 744.016 222.497 750.577]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5261 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 727.11 218.313 734.637]
+/A << /S /GoTo /D (tls__octads_8h_a0efa0fde372b7c30c52f2a5bb87b53d8) >>
+>>
+endobj
+5262 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [220.505 728.076 243.419 734.637]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5263 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 711.17 209.944 718.696]
+/A << /S /GoTo /D (tls__octads_8h_aeb68aaff5654f79b11bf1489c6621d32) >>
+>>
+endobj
+5264 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [212.136 712.136 235.05 718.696]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5265 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 695.23 214.129 702.756]
+/A << /S /GoTo /D (tls__octads_8h_a33dec0d7edc1aee475b06eaf181422d9) >>
+>>
+endobj
+5266 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [216.321 696.196 239.235 702.756]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5267 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 679.447 209.944 686.816]
+/A << /S /GoTo /D (tls__octads_8h_a24550ec574b05d7c2757427e513f7f0d) >>
+>>
+endobj
+5268 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [212.136 680.256 235.05 686.816]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5269 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 663.506 193.207 670.569]
+/A << /S /GoTo /D (tls__octads_8h_a10136983b6ac2a3a8c83db12b30684b7) >>
+>>
+endobj
+5270 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [195.399 664.315 218.313 670.876]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5271 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 647.566 197.392 654.629]
+/A << /S /GoTo /D (tls__octads_8h_a45b0fd64bac9cb68498ba9780645eef0) >>
+>>
+endobj
+5272 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [199.583 648.375 222.497 654.935]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5273 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 631.469 180.654 638.688]
+/A << /S /GoTo /D (tls__octads_8h_ac4412f87c137a3bc3be78ff34b0330db) >>
+>>
+endobj
+5274 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [182.846 632.435 205.76 638.995]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5275 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [224.689 632.435 247.603 638.995]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5276 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 615.529 205.76 623.055]
+/A << /S /GoTo /D (tls__octads_8h_a87568e9d7e93086c6236b574ab1b1cb3) >>
+>>
+endobj
+5277 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [207.952 616.495 230.866 623.055]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5278 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 599.589 218.313 607.115]
+/A << /S /GoTo /D (tls__octads_8h_a3a80e4927697fcac5933d578387fbf5f) >>
+>>
+endobj
+5279 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [220.505 600.554 243.419 607.115]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5280 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 583.648 218.313 591.175]
+/A << /S /GoTo /D (tls__octads_8h_a6b30111fa707d3dca3a1e3c8f8cc89de) >>
+>>
+endobj
+5281 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [220.505 584.614 243.419 591.175]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5282 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.489 416.091 214.182 425.754]
+/A << /S /GoTo /D (tls__pqibe_8h_a08f71b6a3ad349575d16e29e7b923a94) >>
+>>
+endobj
+5283 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.489 389.392 214.182 399.056]
+/A << /S /GoTo /D (tls__pqibe_8h_a850e9c87016ac49ff175a53dd945a94e) >>
+>>
+endobj
+5287 0 obj
+<<
+/D [5285 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+3037 0 obj
+<<
+/D [5285 0 R /XYZ 70.866 577.525 null]
+>>
+endobj
+1778 0 obj
+<<
+/D [5285 0 R /XYZ 70.866 561.676 null]
+>>
+endobj
+5288 0 obj
+<<
+/D [5285 0 R /XYZ 70.866 451.781 null]
+>>
+endobj
+1782 0 obj
+<<
+/D [5285 0 R /XYZ 70.866 360.743 null]
+>>
+endobj
+1786 0 obj
+<<
+/D [5285 0 R /XYZ 70.866 259.038 null]
+>>
+endobj
+5289 0 obj
+<<
+/D [5285 0 R /XYZ 70.866 222.811 null]
+>>
+endobj
+1790 0 obj
+<<
+/D [5285 0 R /XYZ 70.866 196.179 null]
+>>
+endobj
+5284 0 obj
+<<
+/Font << /F50 2307 0 R /F72 2883 0 R /F43 2258 0 R /F26 2949 0 R /F70 2881 0 R /F67 2878 0 R /F79 3175 0 R /F96 4060 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+5296 0 obj
+<<
+/Length 1587      
+/Filter /FlateDecode
+>>
+stream
+xÚÍY[oÛ6~÷¯6`°‡™å�"öÔ:I—^†4õKÑ�#3‰PGr-ykþýEÊ–-Ù²­ØC š!Ïwx>^¾Câà>ÀÁëÞ«qïÅ…ÀAˆ´”,ß
+£PÊ@iŠ$	ÆÓàs_"ŠCªÂ~>Ënæßã[?q=¾Žßœ…H„!Ø+Z"luï|ÜûÞ#P‹²²†(¤<ˆ{Ÿ¿â`
+ÿ{`Ätü[´|¸`HpåYð±÷¡‡½§Qa‹öãý–ªÁoIPȽãWÊû“ÅäÑäf1 ¤Ÿž•&=xß=)Á|åá3Û K(¦¥dŸ
hÍ�æ›(B¢6¨Tˆr(n›1’˳:9ð÷TH°¼†$X!ÁÔæÔ$yœ?Õ‘)H)rt=è`SÚ�¸N6<q”£P…ÏBÕHº^3º›·Ó›y[Cb±æaáàþ$™¦�î÷í–þSn²=tíQ�
+0!•îFg'žN‚§ªe(aÁZé$6/Ý·çŸvzf3¡UÐm*3“eqš¸ß,¯¦ ×Uܛĸ¹™î!ûhoëD�	ºßD;Ù�l8²¥†!IÝ:*t+Ù#¡µ‹ûh¼“ë!›¹®bš$šÌ³ål’Çɽ#4ŠçÀè�ã~n÷ä»i=Þ±%Ö„èÆêñ&v*I(`ËK'‚-Ž`ŒûW._�ߌF/oÎÎG×�ûŸ®Æ_°ÀðGlŒ€dài…‰5‰ƒ!�!„³öOOCY3F\µ5Uh%P'\‰`HÒeïèa²ðº‚Aa$¥¨ú‚1sm´¬´�㊨²ÍåÙ
®EÖÅ&dšd¹s-Nr"oò¤„
Zà�,ÛDÙ·F”2¶F�F¹iB¥!’š3îѸyÜ
+)¬¨ß¿·@aR®í”“gc¹‚G!b„C{LR¯UaÞ¸Uúöü½+À,r…©‰`ÕÂz}šçÈ)Ø
1¼¥„arÂÜÁTœ,‚¹’HȽrŒ;;Ôî•Û͆Û�¹¤ˆùZŠK…[Eð‰��ûñ&æNLB©?
ºt0A‰êF\'ž8"¬Ø³'(RZ¬6˜ÝÌ�†ÙÌ\4ƒå»FM$í&òhOê$p
+šw#²“
O$ƒlœ²V@i%’…ð­ŠèDÈf«˜ÉŸ‡G{Q�?˜`´#‡�lxí©ô,	)·šÓöæ4Èf
+«˜é2Ÿ/ó–äe7§ÇzU§Nnvcôh¥¢ýª	IËC²<`Ü-]!g›®éz΋ŽwçúõvÄ­¨HbŸ,¾Ný�_ù}0^Ž¤Ñò3È,Êð§we›8s%ÐPtfDôцÜ(ŒOY·L«ž"¸ŽÁTV“u½òºGîÛQø"Œ#ø\(Ù/6�ê¶Ãƒlßw“<�#3¼�dÆKûW¿]¸B¡Ôl
¤Þð6ö:úåÕ¥+\,“ÈF&kñFîÍÙ2šd®h<Üd†\á½ÉÒé~,‚Ǻ|œÏL…^[wûä±ÐÇ(Íó0Ò�*B«Ó`]ÍÖ¦L j[¬Ö5k _ã»djîªÉÙ_-Ðühˆs†hžåD?¾$š-§ü—(]ôðKºjnXn]n£(Šk¸eV\&Øb	E6ŸDf̵³~üÙŒ¢«©j7? �I6à|L¨¨†j³jÝ¿ÈÒ7z×vDßr�ÅŸÿí²øÍ1®òùƒX%ùk+Žg{1$ˆúãíw÷ž‡Öµ�ׯòÖ²Z)t{§kF+½¸}aí½àL?°—¨ôÙ«âø†4UÙ¤·ù
igòÿI{yyó³i'Íd����áñ×8
ë¯r©cU aì<{}³Å>?¤ßh¼c‚îï“­:o@ªkº=oXó^Å£7J“Lã»-)²)ª2&JÖ¯ž¤ª§V]¦y¥3PT…ȹˆg^]ÃC`®.LâvÄýÚjüî£ëjÙ'±×RÑ,†Ów˜ÅSo{¾p¨î×ÝJ^Ô´UÓUŽ3r̃k)7aüJòŠÚä0YŠCû6P¼TÞ„\ù,-r«§{¼¾I¶]üµ¯I
+endstream
+endobj
+5295 0 obj
+<<
+/Type /Page
+/Contents 5296 0 R
+/Resources 5294 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 5221 0 R
+/Annots [ 5291 0 R 5292 0 R 5293 0 R ]
+>>
+endobj
+5291 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [69.87 316.852 212.775 325.623]
+/A << /S /GoTo /D (tls__pqibe_8h) >>
+>>
+endobj
+5292 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 196.567 218.313 203.629]
+/A << /S /GoTo /D (tls__pqibe_8h_a08f71b6a3ad349575d16e29e7b923a94) >>
+>>
+endobj
+5293 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 180.626 218.313 187.689]
+/A << /S /GoTo /D (tls__pqibe_8h_a850e9c87016ac49ff175a53dd945a94e) >>
+>>
+endobj
+5297 0 obj
+<<
+/D [5295 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+5298 0 obj
+<<
+/D [5295 0 R /XYZ 70.866 771.024 null]
+>>
+endobj
+5290 0 obj
+<<
+/D [5295 0 R /XYZ 70.866 664.573 null]
+>>
+endobj
+1794 0 obj
+<<
+/D [5295 0 R /XYZ 70.866 637.377 null]
+>>
+endobj
+5299 0 obj
+<<
+/D [5295 0 R /XYZ 70.866 494.219 null]
+>>
+endobj
+5300 0 obj
+<<
+/D [5295 0 R /XYZ 70.866 400.848 null]
+>>
+endobj
+1798 0 obj
+<<
+/D [5295 0 R /XYZ 70.866 384.436 null]
+>>
+endobj
+3038 0 obj
+<<
+/D [5295 0 R /XYZ 70.866 166.376 null]
+>>
+endobj
+1802 0 obj
+<<
+/D [5295 0 R /XYZ 70.866 149.964 null]
+>>
+endobj
+5294 0 obj
+<<
+/Font << /F50 2307 0 R /F67 2878 0 R /F70 2881 0 R /F43 2258 0 R /F72 2883 0 R /F79 3175 0 R /F96 4060 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+5323 0 obj
+<<
+/Length 1367      
+/Filter /FlateDecode
+>>
+stream
+xÚÍXKsâF¾ó+T›‹¨Zfç=££ãWí–c'†¶ì-J+d¬2–iØ�ÿ}z¤ ñÆ8É$˜îéî¯ßØ{Ø»ìü:è|ºØÓ(�’yƒOa¤¥ôT@‘$Þ`äÝù„Èî·Á�ÁŒK ,¾H&q·G•öϲhú§&4I–Ú£�óAç¯�“Ø#3–Z#M¹=wî¾aoÿ}ñ€c ½ŸåÉg�†gð<ñú�?:xQLE½Ä¤rQLI®åü%I£ÉtBIŒýfRŸâ×b…“=~(uÀ^�±–$Šs3ŒÃ$݃f’€úÃ<Ž~´‰ä6¢"NG»ßd’è)6Åî“l<Žsw¾Äš`¤DPZÈGk‡è4�,„E‰amüO€ÈÜAˆDJ+¯G9 é,O©hÐTÀçcç
·—ï®'„ôW}и(jGÙH`}&Ì»=ø¦AåÎÜc�ÝïË\ü~u)öŸìGlZª�7Í�Šp‰¤PµƒßcÌ*«5ÀQ I}¦ñcà5yEÐ`ËÒœïÃõ1+L>Ç i™©\Ù Å2P–¸G4F@!À®*™$ib’p’.JÃnmÐê� V=ÔxT/M„?�Ì4�79B�RD—RðÀužàpÿÑ¥ÂÏ’ÑZ˜À†€Øe«ñWúVeòj¶´>ã¸îHB¾jàab°,Xá9ICÓÄä(Ðã!P˜ìå}!»¨½Bb’²A©—³x:JÒqõÒ›ÿV=�^Ýôχ×7]ŽýÁ狯¬úï³ÏýÓ›ëëóÓÁÑâã{–MvA&ÊÒ4ŽVdAµœ���HÄ!È|Ü,~™p´éf �ù>Qy~r{Õ%Ñ×ݽ"¯ ºéËñ¡Ë°Ÿåc¥Îè $úObñîQ!.å
ñßýÌÆäI—@1”Ÿ'{I:Ùþ<
ŒB¢£%à$5»€m›ÈƒÀÚ»€M5¢„ýŸÁ&Ç[A	ÖjØ`í8)c1>ó#Fy4‰Ãô}Ã<@|¿övïªÆ!\l³ú,ÂfžUÙ>žÄugTµëöãµèB7T·Ø¥‘ÊÇ©+åßí¡éC™³ã¼<ŒV
;0> ˜tzœ",œhB
h·0ÌKg±	a¦­‹|\DyòR�´-+ÁäÄÒb­ŠÏ0@Ö"Û¡W$#§ÚKž™,‚z_ÕšÙÐU>·2¢Â>Ú/kk©Z€&n¾<éRîOÍc–¯Á©!= Ä­r5H¿%Îâ¥Pý(3f¥é’©3b=C®Ù´¶
 „‚ù•ˆEN3@g?�ÍØ@XpÅv0”+�%&«!Z$d²q—©¦çMQ'	âJ4'|3Ÿ–ÆK,ÄXIµ~`Ùù!ðQ"ÛÓey¬¡œ€¤9þÏçÏƽ”�…w¸VµÇÏ÷r†0ÓsfíY6ÜíŽ=�n	
+ð FÝ¥¿Û¨sPÅ_êcŸU[ª€ ¥Ô¦%Å)¬gKªã²°û,á)�/XÀaVºJÅ¡Ú�5y
+QN=m²^t§å�ÍÚÖcº´¹¢öY5n5�ò¢¹ˆiµÖÕ»ÉÜwMÔ·S3döªFçËÂS(ôL`²JÄ@�·@ÿ&ô’ƒŒÛôà0¤‘mÐK�ãË!½üî]	þâ½3­ÕS)Ƭ±ùóöªÌ"UùÐB¿Øý½Å_‚N2¤ÉÛÐߟE�‰–X	
y–ì³+¯WùPC•äÕÞ‘#
å�C',]•ºŒÓ8MÝ䔽Ók]«mõ÷ëØV_hÑÚ©ò‡¤—
+endstream
+endobj
+5322 0 obj
+<<
+/Type /Page
+/Contents 5323 0 R
+/Resources 5321 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 5221 0 R
+/Annots [ 5301 0 R 5302 0 R 5303 0 R 5304 0 R 5305 0 R 5306 0 R 5307 0 R 5308 0 R 5309 0 R 5310 0 R 5311 0 R 5312 0 R 5313 0 R 5314 0 R 5315 0 R 5316 0 R 5317 0 R 5318 0 R 5319 0 R 5320 0 R ]
+>>
+endobj
+5301 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [94.777 620.384 148.594 630.047]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+5302 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [149.094 620.384 200.284 630.047]
+/A << /S /GoTo /D (tls__protocol_8h_a1e67c183344f2c6b2c06df64dbbf763b) >>
+>>
+endobj
+5303 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [203.77 621.276 232.813 630.047]
+/A << /S /GoTo /D (class_socket) >>
+>>
+endobj
+5304 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.489 592.489 161.837 602.152]
+/A << /S /GoTo /D (tls__protocol_8h_a46e777beb241ab49e05f1af9d2c1c303) >>
+>>
+endobj
+5305 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [165.323 592.489 219.14 602.152]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+5306 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.489 563.782 163.827 574.256]
+/A << /S /GoTo /D (tls__protocol_8h_a30ba7a0e9d9e20e131c092775962fadc) >>
+>>
+endobj
+5307 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [167.313 564.593 221.13 574.256]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+5308 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [114.215 536.698 179.007 546.361]
+/A << /S /GoTo /D (tls__protocol_8h_aef9cfbd06be159bf12ad0d119fa6d55c) >>
+>>
+endobj
+5309 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [182.493 536.698 236.31 546.361]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+5310 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [277.172 537.671 301.096 546.155]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5311 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.489 508.802 166.32 518.466]
+/A << /S /GoTo /D (tls__protocol_8h_ab104ed5e5a9bab2c1387314c5ac3317c) >>
+>>
+endobj
+5312 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [169.806 508.802 223.623 518.466]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+5313 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [264.485 509.775 288.409 518.259]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5314 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.737 480.907 157.067 490.57]
+/A << /S /GoTo /D (tls__protocol_8h_a0cb98cf50652da571def63ff5a5b713e) >>
+>>
+endobj
+5315 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.553 480.907 214.37 490.57]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+5316 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [255.232 481.88 279.156 490.364]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5317 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.489 453.012 168.31 462.675]
+/A << /S /GoTo /D (tls__protocol_8h_a4b5ab8c9441bfd0cacccb79816e85f95) >>
+>>
+endobj
+5318 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.796 453.012 225.614 462.675]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+5319 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [69.87 168.26 124.465 176.398]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+5320 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 157.23 162.03 164.442]
+/A << /S /GoTo /D (class_socket) >>
+>>
+endobj
+5324 0 obj
+<<
+/D [5322 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+5325 0 obj
+<<
+/D [5322 0 R /XYZ 70.866 661.224 null]
+>>
+endobj
+1806 0 obj
+<<
+/D [5322 0 R /XYZ 70.866 423.201 null]
+>>
+endobj
+1810 0 obj
+<<
+/D [5322 0 R /XYZ 70.866 300.704 null]
+>>
+endobj
+5326 0 obj
+<<
+/D [5322 0 R /XYZ 70.866 254.175 null]
+>>
+endobj
+1814 0 obj
+<<
+/D [5322 0 R /XYZ 70.866 226.979 null]
+>>
+endobj
+5327 0 obj
+<<
+/D [5322 0 R /XYZ 70.866 109.435 null]
+>>
+endobj
+5321 0 obj
+<<
+/Font << /F50 2307 0 R /F72 2883 0 R /F43 2258 0 R /F26 2949 0 R /F70 2881 0 R /F67 2878 0 R /F79 3175 0 R /F96 4060 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+5340 0 obj
+<<
+/Length 1015      
+/Filter /FlateDecode
+>>
+stream
+xÚÝXKoÛ8¾ûWðhõ”÷ŽÛ4	ZÉnâKÐ�b+®[êZÊîößw$Òùm9‡b
%šüæñÍ|!ÅÙ˜qvÝù0輿Ҝ9ˆŒ‘lðÂ,g³‘ƒl0b_ºöúºn9)ž~Ìz‚wó2æøîç¯ÒIâŸî“—òn2K²aÒû6øÌ”t �#s5¢­¦;—ƒÎߤYÎpaÔ9pB±á´óåg#úí3ã #Çþ­WN™Ò´’ô<a�¿:<²Aèê±BxÆn	Ï(0Öx—î“òu–µ[ëxï¯ÈØr»@ï}tÀ•ö»ãÌGžfi™Æ“´HF~bpó€ ýs‘Eš‡•E9ëõQw_‡d·NÒý`Æ*pJ-I
‚vrÎkpù”d£¯\súCc³YŽg}‰àtpôŸ<%ÏÌêfÿZA„à+2fãÀÊýu‡e5EŒÍ�hûÓ< Õœ‘ùhż¶ �žóþ•sé}ŒÌÊ¢8šùšеP¨†„¶K¬y¼
rúh ¤Ä	JœðkË„’-twšfqŠ4>Š”µZZ+$JnEˆ
+=ògO¨n<‹§Ie±Û,§mÕ®­Eû÷T;RÜR»Eµ¿17šiéÚÄ>Z-Àa@¨»Ê6DÃR&!)¢Óm�ÙQV[»
Æ#ˆ"l.¿'ÇñÛðJp*EÑ«MNAPžÅëé;¥\Uì`Ô�Ù�‘¢Ì¡#j»ŽT»ÿ×BZÜÇé+¥ÙØ¿ô—sþéâæîáòéö®§(CŸ®ƒæÌþøéáâîööòbpœÈÈÚ“¶"#­�È�'2çax‘‘Fo!2ÒXÐ::RdÚÙÝ*2
Ãç‰ÌÉ^mrBÖž'2-0vŠŒpæç© 1ª¡1Ã<Ë’ayüqå9Ï'«2~O¥y·Ã™µû¤+Š¾åÃ2íóJ80‘8«…®]þqó¸%ÅëH;ÔOXpDfCý(ƒ¾ÆgÚ—ž¤{Àl!ðCÉ€ã…M´64t­ q_ñF
+ШÝ
p†6Ôš:´²¬k怲¡¦)yìñ©¥á­ÒÖ°¼ïBÓFóèlæ$¶ðw“/‚@-Îãü,ŒÀ¹¢‘»ƒ¡DtG<ĹÒ`å²k{H§†Ç=¬·3½�õÛE>
}œÄžÏÉOÿ>ŠËp_*s?>‡•D<]õ㬘¦e™ŒöP²Ó›´)÷C¦þtŒ?+D4WoñU¡×xR$
­]y‰ÓIÕnDÔ»unÛQ¼‡Ô³‡¯¤¸ÄS¾¿Ìô?ßRÞVnŒ	‚ë$Kfq9בçêR¨®�yåç?ÇÕa¡›dë.þ'ç3×
+endstream
+endobj
+5339 0 obj
+<<
+/Type /Page
+/Contents 5340 0 R
+/Resources 5338 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 5345 0 R
+/Annots [ 5334 0 R 5335 0 R 5336 0 R 5337 0 R ]
+>>
+endobj
+5334 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 625.933 185.94 634.07]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+5335 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 431.365 185.94 439.503]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+5336 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 234.906 185.94 243.043]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+5337 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 223.875 157.248 231.088]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5341 0 obj
+<<
+/D [5339 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+5328 0 obj
+<<
+/D [5339 0 R /XYZ 70.866 723.803 null]
+>>
+endobj
+1818 0 obj
+<<
+/D [5339 0 R /XYZ 70.866 696.607 null]
+>>
+endobj
+5342 0 obj
+<<
+/D [5339 0 R /XYZ 70.866 591.099 null]
+>>
+endobj
+5329 0 obj
+<<
+/D [5339 0 R /XYZ 70.866 529.235 null]
+>>
+endobj
+1822 0 obj
+<<
+/D [5339 0 R /XYZ 70.866 502.04 null]
+>>
+endobj
+5343 0 obj
+<<
+/D [5339 0 R /XYZ 70.866 394.639 null]
+>>
+endobj
+5330 0 obj
+<<
+/D [5339 0 R /XYZ 70.866 332.776 null]
+>>
+endobj
+1826 0 obj
+<<
+/D [5339 0 R /XYZ 70.866 305.58 null]
+>>
+endobj
+5344 0 obj
+<<
+/D [5339 0 R /XYZ 70.866 186.224 null]
+>>
+endobj
+5338 0 obj
+<<
+/Font << /F50 2307 0 R /F67 2878 0 R /F43 2258 0 R /F72 2883 0 R /F79 3175 0 R /F96 4060 0 R /F70 2881 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+5354 0 obj
+<<
+/Length 1010      
+/Filter /FlateDecode
+>>
+stream
+xÚíXKsÛ6¾ëWàH΄oÝqí™Lyè–d:¬ÛœHTKRNýï» HYŒ½ètrÈÁHß>¾ÝýL1rO¹�ü6�¼¾QŒXê´dzG£Vkb§ÈtN>&6ý<}C>RãÁööM±ðiÆ�M®W³õÒ—MÞ«2l�ü>�ü3
ÜÉl ­¥–K2[N>~fdŽÏÞDt–|mw.‰T‚*)p½ &ï&쨛¼óQS”S•fÀK¦|ñgíËù'¦þApëõ�áÄPgF2
Ô*!WÅ<Íôàt¼mX1žê¾ìýí„h Ò(’
P§TDÂóxº®ûlôa }·e_*¬êÓù‰1�tzk“£6)ï@_}Ç™oâË´¦—Ñ7!V³&ŸòŠ[ª?Á+Óï¹¾š^íI/ÔÁ3NO
ÒûLc¸‹9I2.±86é‹uTÄE¤"¬æy“Óè>å*D¾BÚlá"µX‚wˆoS.“¼Ê—¾ñU
+�Ôƒì«V
ÀªVp’‚–›j}a L+¢œAÅ!Ü-Ú*‰m³˜A³Ê%'XÊÔY7(¥Ýn³p±á
½Ž:,‚�弌TeÑù¢¨}Çí†÷Þ·xÑTØÔ*YÏšuåwýå+GÀþîð 8“£8‡ÑqnqƒSGBáHÓ1Ê•5ÔØnF^§’%W)pœpíçÕ
ö/ra/ùêÕÒ?wr\5«øýW÷	†eR/‹¦ñó”Ÿëä.[‡N¶QŒŸ�ñ]=Sm£ð�¦é�¦U~öxº¦e³-iáð/Iû)$
©ðÅcÊUâÿgeUiTÅ�AˆN˜X(/ jÂbË~¢ª]hxï`XþAªv¾¿»l!Ø‘Œ�Âè8Ç�À˜P5¡QQÂ�sUí2ö“¿íCó�7‘ׇ¼îÅÌ—;�~@ËÎvm—#�ÓÉŒû�õŒ~Ô§V›¸Áàê-€¢Úty{ï±úËáÈzžáƒ¼sNñ:K™ì4‰ÅüÞ¥‚%«jë"/¡©°½^Å»«æÁW_±'»æ[ÏfØŒqxd8ëÌ$EŠ�›�ÏR¬´…ÏË´Xí¿œ…ã?§ï	FX$ÖÕ>ÔgâˆömÞæ6âÐ/PÅâúKȯOõ‘]ÎÂrýw×haÓú®%ÞWíæe§&×Ë(`©h5îeaF«À–¬{	)
cr“’£Rz¡á½Ót`ùIéùþîò…|$ågCôE¸ûâ¡(øÎø=­ïÀ‘fÐ •¤
++PâTÖ]þo}髼é³Þ6ØSÿK_h³ŸîÃ0Ä>þ¶KþE/†Ä
+endstream
+endobj
+5353 0 obj
+<<
+/Type /Page
+/Contents 5354 0 R
+/Resources 5352 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 5345 0 R
+/Annots [ 5346 0 R 5347 0 R 5348 0 R 5349 0 R 5350 0 R ]
+>>
+endobj
+5346 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 675.146 185.94 683.284]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+5347 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 664.116 157.248 671.328]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5348 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 455.128 185.94 463.266]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+5349 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 444.098 157.248 451.311]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5350 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 176.931 185.94 185.068]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+5355 0 obj
+<<
+/D [5353 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+5331 0 obj
+<<
+/D [5353 0 R /XYZ 70.866 773.016 null]
+>>
+endobj
+1830 0 obj
+<<
+/D [5353 0 R /XYZ 70.866 745.821 null]
+>>
+endobj
+5356 0 obj
+<<
+/D [5353 0 R /XYZ 70.866 628.276 null]
+>>
+endobj
+5332 0 obj
+<<
+/D [5353 0 R /XYZ 70.866 552.998 null]
+>>
+endobj
+1834 0 obj
+<<
+/D [5353 0 R /XYZ 70.866 525.803 null]
+>>
+endobj
+5357 0 obj
+<<
+/D [5353 0 R /XYZ 70.866 408.258 null]
+>>
+endobj
+5333 0 obj
+<<
+/D [5353 0 R /XYZ 70.866 274.801 null]
+>>
+endobj
+1838 0 obj
+<<
+/D [5353 0 R /XYZ 70.866 247.605 null]
+>>
+endobj
+5358 0 obj
+<<
+/D [5353 0 R /XYZ 70.866 140.312 null]
+>>
+endobj
+5359 0 obj
+<<
+/D [5353 0 R /XYZ 70.866 91.108 null]
+>>
+endobj
+5352 0 obj
+<<
+/Font << /F50 2307 0 R /F72 2883 0 R /F79 3175 0 R /F96 4060 0 R /F43 2258 0 R /F67 2878 0 R /F70 2881 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+5398 0 obj
+<<
+/Length 1522      
+/Filter /FlateDecode
+>>
+stream
+xÚÍYßsÚ8~ç¯ðô^à¦(’lÉöÜS®mrס“^ÂËMÚa#@SÇæl“6ÿý­,ùg�Ú>!dk÷ÛoW«Õ[K[—ƒ?§ƒ³†-ùœÛÖta¹yœ[®O'ÖtnÝ9¢t4¦®7Ì£l¶NG“<	“­FŸ§ï-Çöó<�X¼Oˆ¯¦旅ÿf±E*¹ž‡<êXáýàö3¶æðì½…‘í{Ö×âÍ{Ëa6bŽ
ãȺü3À¬„"ŸÖË	Âm´c¼î@J—Ùõ%È}5ØÛQ¦^&Æøòw%ô`ž„›{çA.“XO%‹ò™éÑ'Œi$F„
‘Q®­9»p©Å‘ïÚžQéÂc€Ç¤ ÖÌ×Ó®–‚X�^a†`†u;æ`öÙÙ¨øýÈX�¦“= ÈÖƒ�©¦¤…é©6¯„_ƒ@€#d•Xê™ÒorÏÅ¢B3ûx}5½zs5™ýµ
Á«=2/PÕÏ8¡‡‡Ñfn ¼Ús ]Åçñ˜Í 
+ËàÜKO%u›-öIA‡"Ígá
+â븨�Ó¢Ž$ìÖY*‡cÀ®÷*a?w&âùqéæ'…�Ëð‹È³ãBvO
+9J–K‘q
+¥¬DR¤o�¥ÖÐÅ·\¤qK|ò*Ñe"ËÔI´ïbϲ<Hó¶
·pd1¼�§›D¹µ½†x"Ä8{µ‰¿ëÂÁ«žÕ‘üÚÐ[IY“ßö”Vy&m«cð¡Ï«[%Y÷"oŒ©u�ßuïõ‘M^æ£=
+Ö?$r~ˆÃ æ®m�aî"Û5,’.�ÌjL›õ
‰Kcn—0Úϣݜ®Ó¦íýzüfy²>Á%GÏ…i½¹éòè÷Òëàþi÷ôìÞ%�
+òvÃ$ŽE˜‹à=³ŽYüz»Š$̃ξbêJÓ/›5d¿;¿žüÛÌ/®"¬›`œþC€9¿à8b†inÒï!ríÎ_oϧçM©ë*æ]g°^qzzÉ8?ÄEª€ýi‡Àñ\äìt‘ƒlÚM€|ËAÂÁƒ$ŒDm#™ãà%'‰�|0¤CäáxHrÑé`´›1à‡#�ðªc7ú0Y Ú/EKäBF¦ƒr-#¾IE
+%|g#æF„›D²¡Ìµ€ó»,O•ˆ ¬›0“`dãá£êûˆTO-ÔLbþ¨n<CZ!D?PÄ)7
+©ƒn4v.`™ÙhõJ¯Tæcä2¿\Êlĉ£—^lâRÖá¬eáÈõܶÎO´º”q3fŒWeðÙ@­SÎZ¶Þ>A•°_�ËEŽë”ËnÎ'3U(wõêÃ* :Á_u±TóÊUBÇįÛðë ÛZøµÈ•Û(ÿšZí2Яë4Q­²9Ï1ü¤gÖ2aL)¢¾Ò¦‚p7{uŠíÙµÂ,”ë•H³m,x²¿ë€T Ã«œdÔìM*£P+?Cj¶Y¯U€;°ÝÄ\Ï•öô4OKäRmÉ4Ù¬wp9"Ã^:aK¸d:«wje{3Ê}ä¨"í`F†ÿe\Æ­(RŒHÓòÕ$ý)1œÉå�
‡‹íÛ‡0:ΣåþtC€=bè¦Ð]ô­‹‡r°Àä� Z&åI°º?�/ŽäŒ7ÂØÔãw‡WÔ÷Ï�W*…ûç×=µ{ZGpRªï#a�‹çœèž`C5®¯;œ(c™OäÝ6÷íKs…«‘sþÑ2ˆdfˆ‹ä�®f€�¢„yÊÜ&GÍç#ðq]Ûîà
*À^¼ï¦AÅ@,³Uma«:xÂÊ�̧« [MGêÅǵxæ4kº³l#sñ=¤¤Ý¨�˜¯‹
+ŠÞiY¶ePíȯ°áÌ“&šr¤NÞDÄ»2_eÚLYõ"ÂèÂ’M¾Þ
‘ˆ—%5e\Õ„.L±^‘šì$µã‰&Þ¾oÞŒAýFùä]~ê†;”Ë�Æ—n‡!ÎÍëRÄ"­QÞ©;�Éo•2¾=.ÕlØq@ü`qÿ
+endstream
+endobj
+5397 0 obj
+<<
+/Type /Page
+/Contents 5398 0 R
+/Resources 5396 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 5345 0 R
+/Annots [ 5351 0 R 5360 0 R 5361 0 R 5362 0 R 5363 0 R 5364 0 R 5365 0 R 5366 0 R 5367 0 R 5368 0 R 5369 0 R 5370 0 R 5371 0 R 5372 0 R 5373 0 R 5374 0 R 5375 0 R 5376 0 R 5377 0 R 5378 0 R 5379 0 R 5380 0 R 5381 0 R 5382 0 R 5383 0 R 5384 0 R 5385 0 R 5386 0 R 5387 0 R 5388 0 R 5389 0 R 5390 0 R 5391 0 R 5392 0 R ]
+>>
+endobj
+5351 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [69.87 724.631 212.775 733.402]
+/A << /S /GoTo /D (tls__protocol_8h) >>
+>>
+endobj
+5360 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [136.819 667.95 201.576 675.476]
+/A << /S /GoTo /D (tls__keys__calc_8h) >>
+>>
+endobj
+5361 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [136.819 660.136 205.76 667.506]
+/A << /S /GoTo /D (tls__cert__chain_8h) >>
+>>
+endobj
+5362 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [136.819 652.166 209.944 659.536]
+/A << /S /GoTo /D (tls__client__recv_8h) >>
+>>
+endobj
+5363 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [136.819 644.196 209.944 651.565]
+/A << /S /GoTo /D (tls__client__send_8h) >>
+>>
+endobj
+5364 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [136.819 636.226 193.207 643.595]
+/A << /S /GoTo /D (tls__tickets_8h) >>
+>>
+endobj
+5365 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [136.819 628.099 189.023 635.625]
+/A << /S /GoTo /D (tls__logger_8h) >>
+>>
+endobj
+5366 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [124.266 612.316 172.286 619.685]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+5367 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [174.478 612.316 222.497 619.685]
+/A << /S /GoTo /D (tls__protocol_8h_a1e67c183344f2c6b2c06df64dbbf763b) >>
+>>
+endobj
+5368 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [224.689 613.125 251.788 619.685]
+/A << /S /GoTo /D (class_socket) >>
+>>
+endobj
+5369 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 596.375 184.839 603.745]
+/A << /S /GoTo /D (tls__protocol_8h_a46e777beb241ab49e05f1af9d2c1c303) >>
+>>
+endobj
+5370 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [187.03 596.375 235.05 603.745]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+5371 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 572.308 189.023 579.834]
+/A << /S /GoTo /D (tls__protocol_8h_a30ba7a0e9d9e20e131c092775962fadc) >>
+>>
+endobj
+5372 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.215 572.465 239.235 579.834]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+5373 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 548.555 201.576 555.924]
+/A << /S /GoTo /D (tls__protocol_8h_aef9cfbd06be159bf12ad0d119fa6d55c) >>
+>>
+endobj
+5374 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [203.768 548.555 251.788 555.924]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+5375 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [291.638 549.364 314.552 555.924]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5376 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 532.615 189.023 539.984]
+/A << /S /GoTo /D (tls__protocol_8h_ab104ed5e5a9bab2c1387314c5ac3317c) >>
+>>
+endobj
+5377 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.215 532.615 239.235 539.984]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+5378 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [279.085 533.424 301.999 539.984]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5379 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [141.003 516.674 184.839 524.044]
+/A << /S /GoTo /D (tls__protocol_8h_a0cb98cf50652da571def63ff5a5b713e) >>
+>>
+endobj
+5380 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [187.03 516.674 235.05 524.044]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+5381 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [274.901 517.483 297.815 524.044]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5382 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 500.734 193.207 508.103]
+/A << /S /GoTo /D (tls__protocol_8h_a4b5ab8c9441bfd0cacccb79816e85f95) >>
+>>
+endobj
+5383 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [195.399 500.734 243.419 508.103]
+/A << /S /GoTo /D (struct_t_l_s__session) >>
+>>
+endobj
+5384 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [122.182 307.994 168.531 317.658]
+/A << /S /GoTo /D (tls__sal_8h_a62fb33997562fa9f4f3b29c02b47a77f) >>
+>>
+endobj
+5385 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.737 279.37 159.559 289.845]
+/A << /S /GoTo /D (tls__sal_8h_a808235992932012ef83baa255cbc5dd6) >>
+>>
+endobj
+5386 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.737 251.45 157.981 262.032]
+/A << /S /GoTo /D (tls__sal_8h_a29234294cedf38c4bcde0628d60eb574) >>
+>>
+endobj
+5387 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.737 223.637 146.603 234.219]
+/A << /S /GoTo /D (tls__sal_8h_a4825a14218af99362d0183f71d9cbaf2) >>
+>>
+endobj
+5388 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.737 195.824 163.899 206.406]
+/A << /S /GoTo /D (tls__sal_8h_aeff2ed65094d7367f61fde67c57f1a3f) >>
+>>
+endobj
+5389 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [114.215 168.93 161.559 178.594]
+/A << /S /GoTo /D (tls__sal_8h_ab76e7d66aad85296057c6b5e0a730e87) >>
+>>
+endobj
+5390 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.489 141.118 164.329 150.781]
+/A << /S /GoTo /D (tls__sal_8h_af0a45e41d3656ef9c63525b04ce9128a) >>
+>>
+endobj
+5391 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.737 112.493 168.956 122.968]
+/A << /S /GoTo /D (tls__sal_8h_a0793a30d3c3866ab32b753b92fb0a07d) >>
+>>
+endobj
+5392 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.737 85.492 165.056 95.155]
+/A << /S /GoTo /D (tls__sal_8h_a8d303dcc6bf5b5bf5edd51e38c477f2d) >>
+>>
+endobj
+5399 0 obj
+<<
+/D [5397 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+1842 0 obj
+<<
+/D [5397 0 R /XYZ 70.866 771.024 null]
+>>
+endobj
+3039 0 obj
+<<
+/D [5397 0 R /XYZ 70.866 494.454 null]
+>>
+endobj
+1846 0 obj
+<<
+/D [5397 0 R /XYZ 70.866 478.08 null]
+>>
+endobj
+5400 0 obj
+<<
+/D [5397 0 R /XYZ 70.866 348.479 null]
+>>
+endobj
+5396 0 obj
+<<
+/Font << /F50 2307 0 R /F43 2258 0 R /F72 2883 0 R /F26 2949 0 R /F70 2881 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+5455 0 obj
+<<
+/Length 1664      
+/Filter /FlateDecode
+>>
+stream
+xÚÍZ[s›8~÷¯àf6Š.HÀ£»Î­i›lìÝ™�¶Ó!X±™:ÀÚ¢mþ}�¸ÅÆuŒbšì“1ˆ££ï|ç¢#°5³°u6x3Ÿrlù(‚Y“;ËÃÈÂòŠ±&Së£M(v>OÞZž1WÀ‹ÅíÓx!�#êùö(�ò{™¨PÅi¢‡N&ƒÿFb‹4"}ùÔµ¢ûÁÇÏؚ³·H|ë{1òÞr9CÜep½°Æƒ¿¸R¯«ÏÕõ=$8³<A®õýD)/´¨_³>q.ì8QÕm­ÕrV©wSÐëß}	e8½t\lK‡bûa!“¶(êyö'̱W¼ÅÙ\.¿¬òXIx@6^¨�O=
3�§õ¦Ñ€YGÄE�ë–z/¥Ê— ’ÛI)ø«V¡Ô£¼
ÚÌÔ¼¼W«4ŠC%§åÿïqód]­òºÐmC¯ŽG�B¼/ 'pÇg¯Šb˜«9�3ŽJz÷T8{YDiˆ.`&Óôþ̓rˆ-·1õL�o&ÕÆš'-ÿßtì‘Lß0UOMÖéõ‡Ó]4¤óþñ´à4R-9ǧTX
,~`1B‹_ǼO3=¸µ`ÀÏ'õ˜›®ðî.r}ßÌ¿RøùÄëŽþüëôîä‡*Õ
ô#µýÕ<<}îIc?þ´s}sy謮‡ü"
užr SF¼ƒç�çÒ]\¾ïL;êr„ƒMÖ�_ŽNK£56Ž*+ÞåI¤#'z—/I—
ý÷æ�¹zȤC8€_üo¤}�À‡:ÃÈ"W—ï{ �ÏþÿÜ¿øpzÕ�|P­�7Î$äÝEi®u&†ß ¡ÓD™;‡a;­²ñäÝxKƒbè}í	„Þ:7ä!cF<ì'"1†|BMæ=˜ˆŒÃÞÀdFƒˆ	"~«òYÅ÷Y½£9?Ôôú³E¾WȺájþ!_,vSRq�éÖ-
1@ý¼{¹Ca³Æè¨ÇçU̾+“TÍãdö\3�>Íp‘ÄjÚŸlò$Öâž®zr©01ü»˜@„¸›fЋÓ[ŸÊ _{”&p¼á‡B¯ä
×Ë4’«Õ
+“ªÖú<ìrŠ�B;a¯[	Ô(ÄΫ’#š‡Ërì†D
+—˜šdÔ[Ý€h×1À¬î6ö|ÄÛ[;mÕRTVâYí3ê}òrÚ
7¬7}+�ÃÐËö´½®r•�ésõ{,qÉcþkX¼85Ø4B^Ü*ßÓÂd4‰ëMý”‚¹z�^÷�N’Hj�ý�=Äú]ÍÉL¥O×F×(w­d2m»Ù|
+Ó
Í‹@þ”‘}�gF¬
Ñ|Û±3µw.O—_&SeêàòK ß÷Ì+Í¢p:ëLgFò0ߤóðd8*ñ�É£õÍö {Ðmš.º‘w$ŠZë÷ñ—!êj)£oŽ¿Í¨îfˆ0Þ‡£NfØ3IƒQ$f¾Ñú™$f@bº‹ÄSù\÷…g2‘ezWríxãZ_†ñro];Óï.Ó<sX»X ]@�övãÃû1£pv}Ù}?©�%¶¹��ott³¼¨§qtœ•~†lÆm�ûdÚD•ÃµŠ¶j9]•ê“‹Gk•§õVI¸cŽ²ÄßMfò…£ìRÄCü�Ó18�ÜßcÍ)“¾o/¼�Q“ïå}a<6hð¹ œtô…Q|§+Vyt.‹ûšÕ«‚
Õõ6	™Ý©«q<KB}Ì”/å?:ÉÊÊWïö|ijábvxÓ#×,LNn†ÆNý> AÌ(rqv0-]äs£}Øõßo.Oþ5ই8oµ>ÚÆ]§gÉÛâIÔtš?€ý§ô†£¹îŠÈ—"¥ð ^	,ä·‡S1�p ^Ï„Qb¸è^>RÁ‘ÇZ!s˜e‹Îd¬Žì’UT
ÈÔ.–ßûŒ<ˆ²x
†ÒÅ…Ý3¯æ
+Z’0ÆöHª0^Ôáx$aŽ8«û°-0ˆ#àÄõÁŽŒòJ!U­ex»jΛóœwUÓ‰–Ž¸U³èu³M/Èr}©4¦Âk)–uí\ÍÓå{l,ÜÕÕÞ
+ryu´WõRé}QªÔ/±¬^-°dkXÒ
+ËÓ�c¬íï¦j�~õýçI>Ÿª¿î<áån]Ž„¨À9Ó´züêåv­&¥EQø0ÓêÛrKÇŸ³í(
+endstream
+endobj
+5454 0 obj
+<<
+/Type /Page
+/Contents 5455 0 R
+/Resources 5453 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 5345 0 R
+/Annots [ 5393 0 R 5394 0 R 5395 0 R 5410 0 R 5411 0 R 5412 0 R 5413 0 R 5414 0 R 5415 0 R 5416 0 R 5417 0 R 5418 0 R 5419 0 R 5420 0 R 5421 0 R 5422 0 R 5423 0 R 5424 0 R 5425 0 R 5426 0 R 5427 0 R 5428 0 R 5429 0 R 5430 0 R 5431 0 R 5432 0 R 5433 0 R 5434 0 R 5435 0 R 5436 0 R 5437 0 R 5438 0 R 5439 0 R 5440 0 R 5441 0 R 5442 0 R 5443 0 R 5444 0 R 5445 0 R 5446 0 R 5447 0 R 5448 0 R 5449 0 R 5450 0 R 5451 0 R 5452 0 R ]
+>>
+endobj
+5393 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.737 758.177 177.474 768.652]
+/A << /S /GoTo /D (tls__sal_8h_aab75c91cf197022f100d94374f45a881) >>
+>>
+endobj
+5394 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.737 730.174 176.936 740.757]
+/A << /S /GoTo /D (tls__sal_8h_a13449a33ffd970e78387f523d44d131b) >>
+>>
+endobj
+5395 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.737 702.387 178.908 712.861]
+/A << /S /GoTo /D (tls__sal_8h_ac77eb18d9c8ce4ed73d35849a324710c) >>
+>>
+endobj
+5410 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.489 675.303 191.64 684.966]
+/A << /S /GoTo /D (tls__sal_8h_a2895671c64db7244ca7de9fe1bf143e8) >>
+>>
+endobj
+5411 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [224.033 676.276 247.957 684.76]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5412 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.489 647.407 182.172 657.07]
+/A << /S /GoTo /D (tls__sal_8h_a1905f28ad597708f1a8bd5e93f8bc51c) >>
+>>
+endobj
+5413 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [217.057 648.38 240.981 656.864]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5414 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [269.882 648.38 293.806 656.864]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5415 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [324.635 648.38 348.559 656.864]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5416 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.489 618.7 184.763 629.175]
+/A << /S /GoTo /D (tls__sal_8h_abb77bcf10cb38c7312a7a07b0b951732) >>
+>>
+endobj
+5417 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [260.884 620.485 284.808 628.969]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5418 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [315.699 620.485 339.623 628.969]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5419 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [368.524 620.485 392.448 628.969]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5420 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.489 591.616 159.335 601.28]
+/A << /S /GoTo /D (tls__sal_8h_a72c6f91ca8ee5f1cace7b1e49556f344) >>
+>>
+endobj
+5421 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [201.564 592.589 225.488 601.073]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5422 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [240.357 592.589 264.281 601.073]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5423 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [280.727 592.589 304.651 601.073]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5424 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.489 563.721 172.291 573.384]
+/A << /S /GoTo /D (tls__sal_8h_a06f2be86c6a75520db79ffabfc420b6c) >>
+>>
+endobj
+5425 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [207.177 564.694 231.101 573.178]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5426 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.489 535.826 168.812 545.489]
+/A << /S /GoTo /D (tls__sal_8h_a9e7208079886cace1d02513ea7fe6a26) >>
+>>
+endobj
+5427 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [206.19 536.799 239.582 545.283]
+/A << /S /GoTo /D (structunihash) >>
+>>
+endobj
+5428 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.489 507.119 210.299 517.593]
+/A << /S /GoTo /D (tls__sal_8h_a23a7cc46d32b4f319aaf18d65527d309) >>
+>>
+endobj
+5429 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [213.785 508.903 247.177 517.387]
+/A << /S /GoTo /D (structunihash) >>
+>>
+endobj
+5430 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.737 479.223 177.016 489.698]
+/A << /S /GoTo /D (tls__sal_8h_a8182a146d9381e90b2bdd98a00d71981) >>
+>>
+endobj
+5431 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [180.502 481.008 213.894 489.492]
+/A << /S /GoTo /D (structunihash) >>
+>>
+endobj
+5432 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.489 451.328 188.018 461.803]
+/A << /S /GoTo /D (tls__sal_8h_aaaf5555a4ac9a916b0ef075246536c15) >>
+>>
+endobj
+5433 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.504 451.328 218.18 461.291]
+/A << /S /GoTo /D (structcrypto) >>
+>>
+endobj
+5434 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [406.25 453.112 430.173 461.596]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5435 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [114.215 423.433 189.237 433.907]
+/A << /S /GoTo /D (tls__sal_8h_aa19daa6fb66babf69e7803cebd799822) >>
+>>
+endobj
+5436 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [192.723 423.433 219.4 433.396]
+/A << /S /GoTo /D (structcrypto) >>
+>>
+endobj
+5437 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [403.246 425.217 427.17 433.701]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5438 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.489 395.43 203.207 406.012]
+/A << /S /GoTo /D (tls__sal_8h_af3c6cdb6ef9337ef5da8a9a7eaf499fe) >>
+>>
+endobj
+5439 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [246.162 397.322 270.086 405.806]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5440 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [292.513 397.322 316.437 405.806]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5441 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [114.215 367.534 228.258 378.116]
+/A << /S /GoTo /D (tls__sal_8h_aace924671f2ab6d930506ac1b5a369e4) >>
+>>
+endobj
+5442 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [271.213 369.426 295.137 377.91]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5443 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [317.564 369.426 341.488 377.91]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5444 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [363.915 369.426 387.839 377.91]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5445 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [114.215 339.639 207.815 350.221]
+/A << /S /GoTo /D (tls__sal_8h_a94dad73db6a55397ab0b94f804255c27) >>
+>>
+endobj
+5446 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [252.662 341.531 276.586 350.015]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5447 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [317.26 341.531 341.183 350.015]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5448 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [367.099 341.531 391.022 350.015]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5449 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.489 311.743 184.754 322.326]
+/A << /S /GoTo /D (tls__sal_8h_ac019b5b53dd056f21d22ecc8d2e83d3e) >>
+>>
+endobj
+5450 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [229.601 313.635 253.525 322.119]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5451 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [280.677 313.635 304.601 322.119]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5452 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.275 313.635 369.199 322.119]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5456 0 obj
+<<
+/D [5454 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+1850 0 obj
+<<
+/D [5454 0 R /XYZ 70.866 282.755 null]
+>>
+endobj
+1854 0 obj
+<<
+/D [5454 0 R /XYZ 70.866 160.354 null]
+>>
+endobj
+5401 0 obj
+<<
+/D [5454 0 R /XYZ 70.866 113.826 null]
+>>
+endobj
+5453 0 obj
+<<
+/Font << /F50 2307 0 R /F43 2258 0 R /F70 2881 0 R /F26 2949 0 R /F67 2878 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+5476 0 obj
+<<
+/Length 819       
+/Filter /FlateDecode
+>>
+stream
+xÚ½WMoÚ@½ó+öh˜ÌÎ~y�­ÚDŠzhnMpjHÛüûÎú#Ø@ø¬r@^›Ý÷fæÍ<Š‘@qÕùÜë\\	xk•è=	‡�X+œ'°Rô†âgd�TÜ%—DËÉâaÑŸÀsy{9ž¤åê&}Š%Fižfƒ4¾ï]­0IÂ,†$w¾ö:¿:’Ÿ¢�o\I	i1˜v~Þ£òw×AùDü)vN…6
+ŒV¼žˆÛÎ�î�ßJÀf@ ã®DÄèöÓ·‡¬?MïÐ ŠÀ..	Þ¡((ºJBbt	0xîçÕ.ßØŨ^ÖÞ!ª-HPºzOÍw-ÇøßVUœã*—®"ðäD—4¨Jæ&]¾ä\ueeíKÀ°š=•W¦)ó|KýÓ<6A¡A]<2a.W\GëÜX°£m�f‹öñêº4ð}W&€º*ß¡h©Ù­Ð F«Ô¤†šƒñü™Ï3ÐâQM‰3ΖeõW‹†0¡‰¹‰´3œŒß<¶Ù
+Òƒ¤d³¼}¯jÆÍ8yrÈØÖöÞ�ä q¶jŽwzcñ2ŸÏø‰Æh™Ëg51W«ê‡=}ÀåFª²ÿ“Žú9º—Q»'¶�·vº]ãMäÁ6Æû?c+0B[Í*îÄàݤ‘Dá.®å.HC1ë¿.d;)	~"qKnÉó¤½n3÷ó<¸n?V½¶l—ðÅÍ8«�­[ëÎë}³¼Æv:
+9fyB6›j2„3Éyq<Ævß+jÝjùšAZà÷ÎYXMMdz™>¦ùá*í1CÕ2CÕ0ÃQF³—ù©^8ÊÃá´ÂŠp‹*&Õû��
Šgc÷kr[­GA—*Ûƒ†bõÝï™RÑÉžI|^‘ÝÕÝÒðzÿþ„œ‡Qz&!ÿ4³ÉÞa'ã÷y&I–Ï•Š¯
+¿Å6œò§r¯Ù¦åŸh¶M~¤mȀ
µ>:ÖM¹ÂZžäÇciŠÒ2œ5mŠkìcù5uÄŸ‰úO{©³ºù(Å-¢½J³4ï¿ô<¶jž/³ÐI_GÁ„£4[ñØĬ
+endstream
+endobj
+5475 0 obj
+<<
+/Type /Page
+/Contents 5476 0 R
+/Resources 5474 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 5345 0 R
+>>
+endobj
+5477 0 obj
+<<
+/D [5475 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+1858 0 obj
+<<
+/D [5475 0 R /XYZ 70.866 771.024 null]
+>>
+endobj
+5402 0 obj
+<<
+/D [5475 0 R /XYZ 70.866 631.454 null]
+>>
+endobj
+1862 0 obj
+<<
+/D [5475 0 R /XYZ 70.866 604.258 null]
+>>
+endobj
+5478 0 obj
+<<
+/D [5475 0 R /XYZ 70.866 496.965 null]
+>>
+endobj
+5403 0 obj
+<<
+/D [5475 0 R /XYZ 70.866 375.581 null]
+>>
+endobj
+1866 0 obj
+<<
+/D [5475 0 R /XYZ 70.866 348.385 null]
+>>
+endobj
+5479 0 obj
+<<
+/D [5475 0 R /XYZ 70.866 240.984 null]
+>>
+endobj
+5404 0 obj
+<<
+/D [5475 0 R /XYZ 70.866 119.492 null]
+>>
+endobj
+5474 0 obj
+<<
+/Font << /F50 2307 0 R /F72 2883 0 R /F79 3175 0 R /F43 2258 0 R /F67 2878 0 R /F96 4060 0 R /F70 2881 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+5482 0 obj
+<<
+/Length 874       
+/Filter /FlateDecode
+>>
+stream
+xÚÕWMoÛF½ëW쑪ÉÌ~ó˜6µÑÀ‡¶Ö-	J¦UéRÚüûÎ’KI´)–íC¥åì›�÷ö‘B±(®'?Ï'ï®
+©µJÌï…CðÖ
+—J°$æwâSBRN¿Ì?
+Å÷”¶¼±[¾*Ê|:“Î'êåv�WmÖuB'¿Î'Oˆ#QÐÒ{ðR‹åzòéŠ;¾÷Q0bêÅ?]äZh£ÀhÅßKq;ùc‚gË´8ÔiA*� §3BÄäöýÍ×M±Ú|Fƒü¡PØ»+'…ƒÔ!3Eà�î
Šª�ÎìÁÖþWèÀÉ´3bF©±û==pzL)�ôä>#ª>(µA) ¹!†Ó½/9ãq‘ʃ4v�5tÂsÚÏcFÒ�wV̤æ)÷±æí¶aŠLRõDm¶5¯hLÚü®_›ßÜƛŪÊxC$5+W!”LR´­7ýb�šü~ª0É›fÀ©›»¼™L SrÑ�½p¹fö¬;¨–çÎT‘R}�¿O¥N²&[ç-C%›"²ÿ”˜¬å«T§Ä$	�HïÄôÊAxFXmAñõGkžB!:-»‘–H-…5”ê#9Œû'’ X6&‰†ÈƒæŒ£ÌYÃ`’z¿Ejï¿/Ÿ3ª9ª_zçé‚ú�ùc:
q^ÏÇd9Vx7Ý‘Èc“òÁ,ª;‘ÕXÞÃõ9’�Lñ¹ö€Úô»«@Ìv½È›ó¼¬BlSo¢¥ŒÜsÁ{…Ö#÷4c÷ü¥ËŸ/°QÆhOZ©y+
iŸ(Ö8P^ŸµSíQG;¥·òÓÎDëHg7ëUp—r™µùÛ¸®¼Øu5jpêä#\zÇçÛÿĽ£w]•r‡ü°{×U©
BûX9=OدLù½H]ZÁØ~•
–ú¨‚×ußÓØQ“ÊðsÁ\2æ#¶:÷"Å\€ñL�VšÀ9õñh{àÑEU´7ÅâÜ9¸¨ëroÏqû�;ßž²E½^þÆ{‹¬,6Q}e±èÅËmîå;’ß–cY�0îÓR†ãq!7q|Ícÿnûò�
;®–Ë|³¹ß–?õy9ôØu“…Ÿç¼Ò@EÏù·3ü˱áÐéЃ6?Vµ
kã®ó*o²�†S¹õ‡:T÷ï·UÐG’W�küÔ?w
+endstream
+endobj
+5481 0 obj
+<<
+/Type /Page
+/Contents 5482 0 R
+/Resources 5480 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 5345 0 R
+>>
+endobj
+5483 0 obj
+<<
+/D [5481 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+1870 0 obj
+<<
+/D [5481 0 R /XYZ 70.866 771.024 null]
+>>
+endobj
+5484 0 obj
+<<
+/D [5481 0 R /XYZ 70.866 678.481 null]
+>>
+endobj
+5405 0 obj
+<<
+/D [5481 0 R /XYZ 70.866 556.988 null]
+>>
+endobj
+1874 0 obj
+<<
+/D [5481 0 R /XYZ 70.866 529.793 null]
+>>
+endobj
+5485 0 obj
+<<
+/D [5481 0 R /XYZ 70.866 422.392 null]
+>>
+endobj
+5406 0 obj
+<<
+/D [5481 0 R /XYZ 70.866 300.9 null]
+>>
+endobj
+1878 0 obj
+<<
+/D [5481 0 R /XYZ 70.866 273.704 null]
+>>
+endobj
+5407 0 obj
+<<
+/D [5481 0 R /XYZ 70.866 119.277 null]
+>>
+endobj
+5480 0 obj
+<<
+/Font << /F50 2307 0 R /F72 2883 0 R /F79 3175 0 R /F96 4060 0 R /F43 2258 0 R /F67 2878 0 R /F70 2881 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+5488 0 obj
+<<
+/Length 859       
+/Filter /FlateDecode
+>>
+stream
+xÚÅWËrÚ0Ýû+´´Võ–¼l§MfRmÂ.É0(‰§Ä¤Ø4åï{e°xÈLX’‘ŽîãÜ#™ 'DÐeô¥}º�œ)ÅQÿi‚�RHg+Šú#t+Ìx’2mâz\
ª|ŒŸÛáE1¶mïÚ>&”ÄvjË¡MîûWHpƒ¥1°KƒA
^GßúÑïˆÂ[‚èr/c°a
_¢Û{‚Fðß"˜g½53_��KÁ¡?F7Ñψ´_QLº`†u’RBH|ó¹7°å¨W<ÜIàG�iŸ.4CgšP‡CPÊ)6R´&Å(IU°º;ŒeÏ#�¥+‹‰	pÐsG+‹Ê‡pVùNÛv\<L](ói’rÏ[ÀÀEThBïLÇ»ç¼zî'
+–¿Úwø([ ¢¬W.6°¼ã¤K+„Uh‰RJqÖ]×€gªN3LÙ2ÿÃâõÙNÕ¬¨íKÃTéÅä�L©€$jÎvêÔÖ3ˆ“qÙÆÏÙíÉÚXïzyU½‹¼¶£vüVÔ~NÞ6­umibD0“Žg®¹ž��aV9&ÌÇàGÂä,±5QW-„çé6ÚKža®÷Òž
+‰]„´ÿ`W"I&Á�½0[`*©‡hªNU§1 2¬…Úžò0˜§¥:u÷€”“8·÷©í÷nöå8°‰Q…¹2'Ø´™˜†£ò¼ä�±à[HÝ&b
{ýB+,}%]»J*CÚ.Úµx3†aœRƒ‰ðü_•Ýã¬ÖÅÄ—ãdV¿Îj/m¶|‚ÂÛ´ÔjðÚ®ªekªÖ³å‚«?HÏÚ Q˜M+„nÔþ�˜1ƒ�,86älKü‚ãbWÜAò&{%oM'ß©w”³“õŽÜå{éìDA™Ý%qF«wLeÀ[þzÇ4‡½äJ¬‰äX›ìÔ­×ÄŽ¸~¸÷ºØmÉn¨tÄUÜ)±ØL‰‚Û›ç¥õxŒ#•Ž1(Jøã©(uJbFt u”t´.·ùè{BelÝc>>${ &LÓ-²×Y°OùÔÿºÉQð]ïо_	ƒO
+÷˜o
+àA�Ûq§Ûw!ƒSŸÓc>CŸ�A­D÷`•X)ÔK[ÚéÊЇŽC_'	ÜñÿΟ\æcHÑš‰ÿ¼ -Ú
+endstream
+endobj
+5487 0 obj
+<<
+/Type /Page
+/Contents 5488 0 R
+/Resources 5486 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 5492 0 R
+>>
+endobj
+5489 0 obj
+<<
+/D [5487 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+1882 0 obj
+<<
+/D [5487 0 R /XYZ 70.866 771.024 null]
+>>
+endobj
+5408 0 obj
+<<
+/D [5487 0 R /XYZ 70.866 691.521 null]
+>>
+endobj
+1886 0 obj
+<<
+/D [5487 0 R /XYZ 70.866 664.325 null]
+>>
+endobj
+5490 0 obj
+<<
+/D [5487 0 R /XYZ 70.866 557.032 null]
+>>
+endobj
+5409 0 obj
+<<
+/D [5487 0 R /XYZ 70.866 435.648 null]
+>>
+endobj
+1890 0 obj
+<<
+/D [5487 0 R /XYZ 70.866 408.452 null]
+>>
+endobj
+5491 0 obj
+<<
+/D [5487 0 R /XYZ 70.866 301.051 null]
+>>
+endobj
+5457 0 obj
+<<
+/D [5487 0 R /XYZ 70.866 192.658 null]
+>>
+endobj
+1894 0 obj
+<<
+/D [5487 0 R /XYZ 70.866 165.854 null]
+>>
+endobj
+5486 0 obj
+<<
+/Font << /F50 2307 0 R /F72 2883 0 R /F43 2258 0 R /F96 4060 0 R /F67 2878 0 R /F70 2881 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+5496 0 obj
+<<
+/Length 815       
+/Filter /FlateDecode
+>>
+stream
+xÚ­WMOÛ@½ûWìÑ–êíÎ~ûXDABHm!7@È$K°JœÖqJù÷{�;nÀ	ðÚÞyûöÍÌ[‡‘)aä<8ŸÏ#–&Z2z$†Q«51	§ÈhBnBà2º]�ï„ÔX?>Ëž]scÃÓùx9sy™–Ù<¯¦_GÁïp&#°†´–Z.ÉxÜÜ12ÁwK^ê™3"• J
+?“ëàGÀšŒrU
«KCZ›Ò¨•
ëï—aZ¤3Wº"5³d/C\^àuC�Šk†Œ
”iEŒH(µgK
+
+ˆZÓÊ£¡\rb¤ F/É8ûõäŠûÅ2+Ýnš@5Jº:¦m³:C!Ú˧¾ZF—×~àéøñ8qШ¦=€Ónb–™ÜáKX'Œ*à^°+W.‹¼]·«kGpÎ)ÞÇ`)“ÊGÿŒ8]õïÕküìòiùT¡uz>n¢�Äö‘>ZS.(§QŒ±ðúËå}êÒÉ(²3	,œ"Þ-SÿÀƒ¬7šT»GPFb,(«¼,/£Xo¥€VÁÔƒ
,�Â}M°ב5|¢·à!¡ÀíÊ‹º•Ýá¢q#¨v3yC¸%a’ScP
”¡É@QeÕSaî5L—å:]6ö^W?+ÓiK`?q±˜�³´tÿ’­ßì«þv™tj%ŤöÕ¡'C…UG5ÁqÞᤔ	ù'­©mk€Ã¸z¯Ãµ–?Âá†sÚMŒåÔŠ#“;c ÃI¡pÃò(‡k¢»�·ÇÙð’¶íl|ËÙŠ4ŸÌg'¯¥{ÓѤ4=Ž¶
Ør´Õ¨ÏmXí3š^žº²åEå°5¦¿¨}|e½Šïš²U\|„Òï`5@y±£ü·q™NÞ/ýŸy6éj_Cì;NÔû�¬§O�RUoÓ¦I®*­ZÄâ&°µÄ¼¦²­4F%[QÜR�ðÍyÄD¥ê‹g}f]õˆ’P…}ôÖ¡Æl�€AÕ¶»�¾ÃD)t,ò=¿ú¹�…`*xÄ’*üF@OѺqÑs—»bsr>l}ÂœÎ#Á¿¯Óª‚B—w9þrëí
+endstream
+endobj
+5495 0 obj
+<<
+/Type /Page
+/Contents 5496 0 R
+/Resources 5494 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 5492 0 R
+/Annots [ 5493 0 R ]
+>>
+endobj
+5493 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 107.92 157.248 115.133]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5497 0 obj
+<<
+/D [5495 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+5498 0 obj
+<<
+/D [5495 0 R /XYZ 70.866 771.024 null]
+>>
+endobj
+5458 0 obj
+<<
+/D [5495 0 R /XYZ 70.866 649.639 null]
+>>
+endobj
+1898 0 obj
+<<
+/D [5495 0 R /XYZ 70.866 622.443 null]
+>>
+endobj
+5499 0 obj
+<<
+/D [5495 0 R /XYZ 70.866 515.043 null]
+>>
+endobj
+5459 0 obj
+<<
+/D [5495 0 R /XYZ 70.866 395.136 null]
+>>
+endobj
+1902 0 obj
+<<
+/D [5495 0 R /XYZ 70.866 367.985 null]
+>>
+endobj
+5460 0 obj
+<<
+/D [5495 0 R /XYZ 70.866 215.961 null]
+>>
+endobj
+1906 0 obj
+<<
+/D [5495 0 R /XYZ 70.866 188.81 null]
+>>
+endobj
+5494 0 obj
+<<
+/Font << /F50 2307 0 R /F67 2878 0 R /F70 2881 0 R /F43 2258 0 R /F72 2883 0 R /F96 4060 0 R /F79 3175 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+5511 0 obj
+<<
+/Length 1380      
+/Filter /FlateDecode
+>>
+stream
+xÚÍYÛr›H}×Wðˆª¢Ù¹_w+±7q²ÉÚzKR),¡K!¯„×ñßo´U~pIÂpº™Ó}æ4`oéaïzôÇtôÛ•ÀžFFJæMžÂHKé)C‘$Þtî}õ%¢l<¡JûI´ÿ±"´Ê~^­£0ûv.Æûá.ŒgáøûôƒÇ™FBkˆ’b*ìáÑ»éèŸ�£Ø#‡XZ#M¹7ÛŒ¾~ÇÞþ÷ÁÈí=¥gn<.œÁ÷È»ý=Â.Œ¨°_퇻©jîF¤¹»�/cÊý`lÂ$Ü�	ñ÷if9dm†žÁgC†D)Ä?dxa‚°žba"š0àlŽˆ "]U"X!Ê©§8CŠ©lI¢0®²cbºoHàê’`‚„P嘱-˜ÇÍ=p�–Ðv‘}îìñ žo7Ùïû1Åþsî«R®ƤGŽUv \5Èð Ç0åˆËË0L
"Ú­öíI~û¬ç·q;K‚¹“�­£Ò©Å7Œi…î¿OëdÕŸúÎéWi:´¹»cœ”^É	È;j/¢ˆðñ„`Œý»ß?þXýœ/ÞýJvÁ,ù††?bªHGFÁ²ö&TOˆèßíÖ[V!²ƒ(ÕmPJ®„7!™üÚuœd
Œ, @6=ü~¼q:j×e·tt{=z‘ØÄ]X
+‘UKQ‡á*S¸Šj$
Í£A±š”¬¨üœ/·7çfÄRØüïÁÊO_YJïo>ÕÔN™Úc�•ºRÓˆêM ø5u»ëŸ7o¯²îµõ•6´­1{`ñÏ’õ6FÙ-”¶îû6/….°e¬†ë›:R`�«†®†‘	:#¥´i(ß"èÜ(ðdæÐoUU$˜!î´,êPyôªuì�VÑr;7>È÷¦F )¬!ˆn÷T*4Xa19©4â\¶ÜC†‹V"5CDêƒL5Ù/h=‘ŨAì\×còðèúófÌÁ§{nŸ�3ª’
´¢�ÐAŽQÉ�6ò^‹KP^¢2…ýi¯ýB×óZŒý𘚦h=Ë8]ÇzapKxíœQ•€�F
ãu†ã•(QqÉàë/í•'í´žÑbÔlµ¤>9ÃÙ.tœþ´Ç³–]ÇËìØ&°›dªÌAÔ@xç„«d
m†h'¼;ÆIçã5ØeZv΢âœ`Ä8Ã8óÓÆÙ"\È7¯’ç‡ðMMe›,ÏGÜÂ4ÿʬøç›O¯Ì÷¾¾áàý_WŸkÊŠØ�V'gaÃËNüî!œYHE¡h˳ê-:ò|,x1fØߺG2Ó�wyÄv»PÑÛ®S˜%¨n´ÚØ¡N+É ˆlç  æ˜^ĬS¬ACL¡Éëö�X凞­CPõ"ìùn]ãô	N÷Tª4`0l‘2‰6ˆAµÝ…•já‘8
“£´ž¤±gÐZKQ×{÷m垟ÍÃýz—?>ƒ”–ù´üêáÌжsÚðùéÇpººßJ…DAš!Úê`„+e‘^Ââe�àü°¡�®ƒ~1ëë 4ŸÙª¤ž?ÅåwαÊ@H:¨ÑA8‚%xCÉ/Òé’#cxãTžÜ/f=ÁÅ •F·ÊY¶ëš½0Ú�×Ô�Ó®&Ü�ÄùÇ90ð^ä‰-XþF*w`õ¤÷ZOz1jNúËÉ=
+îÃ(gúhË„�ï¬e;ÍsçL«$
'Ãxî‘ÛÃêcX
S1éòz8ŸaTPñÇ	Ñ.�t³Ôu‡;˜•çÅ—MÙ÷·ÛTbŸ—vvôÝž_°¯ÿ
�(Ë8
+endstream
+endobj
+5510 0 obj
+<<
+/Type /Page
+/Contents 5511 0 R
+/Resources 5509 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 5492 0 R
+/Annots [ 5500 0 R 5501 0 R 5502 0 R 5503 0 R 5504 0 R 5505 0 R ]
+>>
+endobj
+5500 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 584.368 157.248 591.581]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5501 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 572.413 157.248 579.626]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5502 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 560.458 157.248 567.671]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5503 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 297.392 157.248 304.605]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5504 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 285.437 157.248 292.65]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5505 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 273.482 157.248 280.695]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5512 0 obj
+<<
+/D [5510 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+5513 0 obj
+<<
+/D [5510 0 R /XYZ 70.866 771.024 null]
+>>
+endobj
+5461 0 obj
+<<
+/D [5510 0 R /XYZ 70.866 693.269 null]
+>>
+endobj
+1910 0 obj
+<<
+/D [5510 0 R /XYZ 70.866 666.073 null]
+>>
+endobj
+5514 0 obj
+<<
+/D [5510 0 R /XYZ 70.866 524.699 null]
+>>
+endobj
+5462 0 obj
+<<
+/D [5510 0 R /XYZ 70.866 418.248 null]
+>>
+endobj
+1914 0 obj
+<<
+/D [5510 0 R /XYZ 70.866 391.053 null]
+>>
+endobj
+5515 0 obj
+<<
+/D [5510 0 R /XYZ 70.866 235.939 null]
+>>
+endobj
+5463 0 obj
+<<
+/D [5510 0 R /XYZ 70.866 114.418 null]
+>>
+endobj
+5509 0 obj
+<<
+/Font << /F50 2307 0 R /F67 2878 0 R /F70 2881 0 R /F43 2258 0 R /F72 2883 0 R /F96 4060 0 R /F79 3175 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+5521 0 obj
+<<
+/Length 1172      
+/Filter /FlateDecode
+>>
+stream
+xÚÍYÛr£F}×WÌ#ª²fç~yt.¶³É¦’Xo»[)"cAEBŽ„’õߧaB´Uû`£sº§OwŸDÐt?ùn>yw'	2Ø*ÅÑüi‚�RH[†Eó'ô1 LM?Ïß#ßq¡`aññ]²Š¦3¦MðÃf±_GifÉ&Ío�ü8Ÿü3¡p'Aôi6L Åzòñ3AOðÝ{ˆÖ ÿŠ;×HHŽ¥àðz…'¿OÈY7ŤôSaÆ1ÃTMg”<Þþòg¼Ÿˆ$ðGsÏÞÝi†4¶šÐ† §ØHáþÝ$OÓ™ª¬uïr„"`Nh‰f”b+•[”¤™C¶ª‚L-¦Ì”±Š³×—è¦�‹ÉvéƒóÇýäȧ™_êŒH°Ydá“_ïb«le3XYVÚûDoqÊbBuyÏüR¸ÆšØ¯îÏÏߘ?ZòÅb©ÄH™S�²o©	Ég°@ �ð>9wÉú¥¬—‡·SN‚ïÝ»ç}º8ÁLæÈ/ù”® C¶B†æ÷üÛ”‰ ܆ë(‹¶SJƒ]-m5¨˜„z‘]5HÁ„,2×Õà•1h±VQÀ¢¼î˜Hî!Š k-@c&@I¬€€·:kv J$惭ÖØ¥�u’é#³á.vd†«åfýGI¯[<±S;Ä•&¡¨Çå(Ç¥´
+sÅ®Â%¡_1ó“<´ØÎcÕd˜:7ûìeŸ¹×Y¸<McOäTñQ4ŽÃð4ÝÏœÙ
+ÇVÈs4J£ 
ú®~šÅa[Y¬Z,ILÒ‡O	¢üßëFƒàÆÓ¼u×]¸Ê:8îíg“Cµã8…á9VL_£T¥f°NW¤²�äaÛI®šlayívá2ê`²·3M‚+3ŽÉþ'`a„YÖ`]€Aš~ݯVÁ²uöë»ayù ¼‹Ãol~øzcÞíãƒo4Ïîšn²8I—Ãæ>ÊÙà¹�ëü\D»RŽA¼­Q§Óv†k@\æ³ûù±‡I{®
�ìbÉù!­šeo56šµYoAº‚°u£Yì‰~|¸eGœ6ƈU”.3?$æUÄÙ�0uR¢Lµú>˜…!MÙH“C€�DŒËƒQ>‡x�Yƒƒ‰a•ZnO‚AÛs jñ�U®‹ãÀiûºÒd¨Gboˆ“ÄÁT躙#	ú)M²ÁÏaüúk=‹�R£Aû49|B…¸�"Ô¨ÐáaZ<X…¨Áœ2¯BîÞ<XI˜•2ÎDg±IásN‚/¾\xø`á�Ä€Èu0áðb:Æ¥Q®ÝÀ°°ê²C�[^>�ÉS©môèáV�šŽÂòØlUK¯5§›,ÚÕ'Ž7iŠ«ià»U³Gå2Ôr×›´
ë†8ËüÏ<T0â'ž|&7å!3î }˜ÉvÚ«6Ã"+õÜÁfo�šT@›1BŽb³7DÙXš'(‰	§}~I(ÕôICS…)°„¶"$VÊËÇ}”F[hœOÕš*ã(¢üºÌ…-ðe_é|ÿƉC
+endstream
+endobj
+5520 0 obj
+<<
+/Type /Page
+/Contents 5521 0 R
+/Resources 5519 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 5492 0 R
+/Annots [ 5506 0 R 5507 0 R 5508 0 R 5516 0 R 5517 0 R ]
+>>
+endobj
+5506 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 704.176 157.248 711.389]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5507 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 692.221 157.248 699.434]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5508 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 680.266 157.248 687.479]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5516 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 427.47 157.248 434.683]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5517 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 203.263 166.812 210.475]
+/A << /S /GoTo /D (structunihash) >>
+>>
+endobj
+5522 0 obj
+<<
+/D [5520 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+1918 0 obj
+<<
+/D [5520 0 R /XYZ 70.866 771.024 null]
+>>
+endobj
+5523 0 obj
+<<
+/D [5520 0 R /XYZ 70.866 642.723 null]
+>>
+endobj
+5464 0 obj
+<<
+/D [5520 0 R /XYZ 70.866 536.371 null]
+>>
+endobj
+1922 0 obj
+<<
+/D [5520 0 R /XYZ 70.866 509.175 null]
+>>
+endobj
+5524 0 obj
+<<
+/D [5520 0 R /XYZ 70.866 389.819 null]
+>>
+endobj
+5465 0 obj
+<<
+/D [5520 0 R /XYZ 70.866 312.163 null]
+>>
+endobj
+1926 0 obj
+<<
+/D [5520 0 R /XYZ 70.866 284.968 null]
+>>
+endobj
+5525 0 obj
+<<
+/D [5520 0 R /XYZ 70.866 165.612 null]
+>>
+endobj
+5466 0 obj
+<<
+/D [5520 0 R /XYZ 70.866 87.848 null]
+>>
+endobj
+5519 0 obj
+<<
+/Font << /F50 2307 0 R /F72 2883 0 R /F96 4060 0 R /F79 3175 0 R /F43 2258 0 R /F67 2878 0 R /F70 2881 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+5531 0 obj
+<<
+/Length 1138      
+/Filter /FlateDecode
+>>
+stream
+xÚåX[�ÚF~çWÌ#Ha2÷Ë#Uv·Š*5Ýð–D‘ƒg
‰µ©1m÷ß÷ŒÇ;}ê²ÇŒ¿sf¾ï\Æ-AO£_æ£÷�’ ƒ­RÍ_�&Ø(…´eXQ4�Ñ—±ÂŒO¦L›q¾Ù}ßE¼
+ÃÇõÆ…»g÷2¡dì2—,ÜäÛü#Ü`iX)0(Óþñèa>úsDá)Aô`Ël˜@‹×Ñ—oÅðßGD0·ý]Ì|EBr,‡û
ú<úcDzýW“ú0ÃÔN¦”2þ<ûíû*Ú­>eFÆéÂív³,‹üàí+‘~Ô{ûþQ3¤±Õ„zh‚¦œb#E@ý+]Ç“©jà°ÞÂ?­XwXp¶,Wþü4Bà¡ÐM)ÅVª€¹OÖ¨|%¬¼°5/`_™ÔÕ¾~%„W­ªM²˜PUÍY½kYÌThÌ4/ÍË0s±Š²rnÝ$장X<xõ£Õ"gØ2Ý´¸Nò0j1eíl\ÒW̱G¯*Ê@%G5L­Åš34e$¦þê7¸Pí6ðQR^³ÌK9špPCx”¾„ë�B!¹ÛM¨ã@�áyòO•Ò5ë Ø:ÂJr?M˜øèÕålÐñ®Ás[h(®áý®È Æ]"ã¾þ‰cX+Ó…
³&’—E\êF\‚Ü(�%¼„yš¬ÄÜ\k°A=%K”†Å(écl�,Ã`‘&¹ólÿ“ŸúÃ$
Ñ+<:% ¤²·‘yFÉ&1X€\»—!/d/›0�
+]ýY6¯3ØÎfÝb¾rÍÀ<ÁyZN,§¬“Åf»¸eÑ!�ÁË8¥ X7D¿nÂ�ÜÔâ

¡…
á�LÝ&‚+M¶Š aó ‚ÚÁŸeÞAép§Nè𺢗Ò+0Î6>’HTÍƇ‘ŸŸß÷ùvŸ_Þêø*ÝètÀÿºÇ‰[ZH΢¯%¡„ûÁ™žL³d]�¢¤LQi±ázyuÏ
²ÃJw& 3#Ï+ú6Œ�¤¸�où=’76‹Ÿí:à"ˆ¸Öbƒ^+àØC›wz+Ù�2
¬ûpÕÏæM%›
+:qÀê[
+“¶—M
{lU-ÛÙ¼Îb+›u‹‡‚³ØgpÞÍë
îãõÒíòæÙ¡:^¤É2=ˆ ¡ˆtëB
Ë×iÒ¡‰ÁË:åSùD¥oÓÄpŒ*é4óW±é�VY`3U&Èg—ﳤ™¼ŽÅ£Á´ÈÂç|ƒ‰(ë×ê�^ë4»ƒŸJé´„ÖMQ•RZ+¥‘‹â‡d‘ùGã·í%U¶};¨pb`I­jš5í¬¨¼xk@Eݹ$n/ª°9P*ãWq;Þ
+YNüOê4˜½ë׈m~Ñ*Ô}W±Íß�Ä%ëJywɃA¹¶lˆCóÙÓ¹�2¦·‚Øä´ùUfö0ûÂÒÅ‹ˆ‚Lˆ{)1�f~Àçê{† ÖаsŽ�X©’º'—¸,Ê«Cb8c†ûiQ¹ß–Eä—‡žš‹ÿ
^ɽ
+endstream
+endobj
+5530 0 obj
+<<
+/Type /Page
+/Contents 5531 0 R
+/Resources 5529 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 5492 0 R
+/Annots [ 5518 0 R 5526 0 R 5527 0 R 5528 0 R ]
+>>
+endobj
+5518 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 716.132 166.812 723.344]
+/A << /S /GoTo /D (structunihash) >>
+>>
+endobj
+5526 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 465.832 166.812 473.044]
+/A << /S /GoTo /D (structunihash) >>
+>>
+endobj
+5527 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 182.341 162.03 190.004]
+/A << /S /GoTo /D (structcrypto) >>
+>>
+endobj
+5528 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 123.669 157.248 130.881]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5532 0 obj
+<<
+/D [5530 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+1930 0 obj
+<<
+/D [5530 0 R /XYZ 70.866 771.024 null]
+>>
+endobj
+5533 0 obj
+<<
+/D [5530 0 R /XYZ 70.866 654.678 null]
+>>
+endobj
+5467 0 obj
+<<
+/D [5530 0 R /XYZ 70.866 562.777 null]
+>>
+endobj
+1934 0 obj
+<<
+/D [5530 0 R /XYZ 70.866 535.581 null]
+>>
+endobj
+5534 0 obj
+<<
+/D [5530 0 R /XYZ 70.866 416.333 null]
+>>
+endobj
+5468 0 obj
+<<
+/D [5530 0 R /XYZ 70.866 280.39 null]
+>>
+endobj
+1938 0 obj
+<<
+/D [5530 0 R /XYZ 70.866 253.194 null]
+>>
+endobj
+5529 0 obj
+<<
+/Font << /F50 2307 0 R /F72 2883 0 R /F79 3175 0 R /F96 4060 0 R /F43 2258 0 R /F67 2878 0 R /F70 2881 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+5541 0 obj
+<<
+/Length 1466      
+/Filter /FlateDecode
+>>
+stream
+xÚÅZ]s›8}÷¯àÑÌĪ¾‘³“4³Í>dO_ÚÎÅÄö¬c¼§›¿$0pgç\é\I÷ÈÁÞÒÃÞÝä·ùäÃG�=…´”Ì›?y
FJJ/ÐIâÍÞ×)¡Êÿ>ÿä1øŒq	/�?®7±?£�šÞ$Ñþ9Þfa¶N¶yÓÉí|òÏ„@Kì‘
+R)¤(÷¢çÉ×ïØ[ÀgŸ<@ÔÊûY´|ö¸`Hp÷ïqòçÛ01¢"¿Í/6h8‚–)n£~ð)Ÿ†iøgqê2})"+!�=ƒkG„KÄ­"¼0AX
+/`a"º0 5GDQIÐÐ1@”S/à,0CòomyVˆd(+Èu`%ð¹äA“6[Ù<¹¾}47ûOãü×›yB`ÅÍï_Ú
Rèáz@€muä ©ð(«0åˆ	u²+Tè“
+S�ˆ²C½Z¤þŒˆé&Þv=ŒÜ-t�½è—ÙÊÜ'OæZ}¸ŠÃÌÈã2÷¯-ͳ@�“y†•™`ÈX~¢+i.NÊ=˜<È|\Þa¤nyë¬ï,î³8‹_:íP[¬aΉq‚ŽÂ0‚J-�€!:•›X°“‚âü=f†v—uÎØ�´nI뼕¤»M¸Þf±Ïðô߬1‰�ÊÚ?¨–$9“|”¬ã0¬¬Š Jô%æ©Tš‘RÖM‡q:5m�Vš®·»}vTÞjËMöYÕ.ZïVùÌæxZµ>ž½{Ð 0§ÿ+¿”�Éô»±H¦©QbîX¯óq¼ëH„aìîD¨ÓW‰PW8ÜÃãm¶ŽL±n¶æpÙ¡rïðÚ
ë^)NËÜ㨹
+jtaI"ÊE”BÝ„1ž>^ÿñWûÛMå¥ìm»ì~H>H ;¬ÝH˜äˆØ›10¢ýH’�?“ïpÂ<Ì�¬É»–.m?ßM<ð.<ÞŒ¤K¸âÕ¤á[€_×ø+Þ²–ìÆÌ©e­Q^6W¶-�£×+GOfœ"®I3X4xj>ªJ@(F`«pBÚ†Í>­ÂÔ¶­wTÐäŒ~5Z''£HÓÀrÊó»eÿG/¢ìêHBtöËF‘DY¸èJª�Ô´O@óë;Ç4‡ê0‹„¦#Ô›Aé¬ì"t}{}cV™E1£X1£`éA&gëarÁ€b*;zïs>nå‡avµ'Ö쎞Κ—±Õd>¾³duî,
ÚK9úþ
¶Õ�¾*=RáQFa¦9âL\¢†`Z#*EG?�Ü)tƒý2Ž¾x-‰rÊÆ܌ð2+ð²š^Â)0«$ØâÓŽ~ ©[Þ:ëPGß? ¶
¸q=®ô‡a•I~	CŸ�ó VLt:ˆÔ­g�µ’ÓeãÎòô½kk¬è(]GaX]˜S\d¢
+	’.•í�u§[×:©ËÒÕØiì›Çõï݃¶x�õ¸³×q6
˜<'•ÏÙ�9X3©ûxúaäîD¨³W‰`”ÜÅQ/ûÞ1¶e>îô®?DÏï©Rˆ”'ØŸãlŸn›¶áàœÃOÁ
3°4
+an‹¡§|ÌÃÍK9Ÿƒl¼˜ëÏ4Ù.¯¬NUóÌÔqûØ8§Æ¹Ä̲°7sÞ<˜`µƒ‰eq"oã4Ìâ{àâü×ÛCÙ:=ã Â¢¿&ëÅá bYBÆoÓ<¬pžLœã¨—i²ß�ko]&ûØÛÇû³ýv€¬›ç¿  ‡{—Ýæõ/Ú�Ûm†`#®»íBHrÄ´Ë‚]ÿ÷EY·YGv&ׯ>‡v-·+Ál:åÆb¯»]šäyW ”ëÏ2§Í7“%IA´8Ì*­Âí2>éå…@˜‘>ÿ>PÂT
+`¥ƒ1ã‚#
s€C™#­¨w6ùõò·üdž"À·rÞ½�ñ?„„M¡
+endstream
+endobj
+5540 0 obj
+<<
+/Type /Page
+/Contents 5541 0 R
+/Resources 5539 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 5492 0 R
+/Annots [ 5535 0 R 5536 0 R 5537 0 R 5538 0 R ]
+>>
+endobj
+5535 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 537.316 162.03 544.979]
+/A << /S /GoTo /D (structcrypto) >>
+>>
+endobj
+5536 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 478.644 157.248 485.857]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5537 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 138.363 157.248 145.576]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5538 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 126.408 157.248 133.62]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5542 0 obj
+<<
+/D [5540 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+5543 0 obj
+<<
+/D [5540 0 R /XYZ 70.866 771.024 null]
+>>
+endobj
+5469 0 obj
+<<
+/D [5540 0 R /XYZ 70.866 635.366 null]
+>>
+endobj
+1942 0 obj
+<<
+/D [5540 0 R /XYZ 70.866 608.17 null]
+>>
+endobj
+5544 0 obj
+<<
+/D [5540 0 R /XYZ 70.866 441.101 null]
+>>
+endobj
+5470 0 obj
+<<
+/D [5540 0 R /XYZ 70.866 247.263 null]
+>>
+endobj
+1946 0 obj
+<<
+/D [5540 0 R /XYZ 70.866 220.068 null]
+>>
+endobj
+5539 0 obj
+<<
+/Font << /F50 2307 0 R /F67 2878 0 R /F70 2881 0 R /F43 2258 0 R /F72 2883 0 R /F79 3175 0 R /F96 4060 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+5553 0 obj
+<<
+/Length 1442      
+/Filter /FlateDecode
+>>
+stream
+xÚÍY[�›F~÷¯àÑHñtîÌ<n”dÛlTm×n¤*‰"Ö‹½VYÛ5¸­ûë{†0|
ÜjvÁ`¾sf¾sùŽÁÞÜÃÞíàídðÃ�=…´”̛̼#%¥hŠ$ñ&OÞ—¡D”ù#¨a'ß“0FÏöã‡EÙ³‡hæ<Œ6Ñrùß&=ÎJ�•ƒPm.ÞO\Å)l)…åÞôeðåöžàÞG#¦•÷WöÍ�†gp{ãÁ/ìüLj
+sjn52hX�$Hq·œ{Ÿòa¸	_¢4Úø„“̳²ÑC0ÏàxÂC*á3
+¯ŒA–˜F„œÜ)ø6GX0‘mIP!8@”S/àiØÑlK憼Íj»®sD0Ð/dWÓ`aošŠ8cUÛ鳋¡éÆ1<Ü­Ó•õÇü×Ï‹©½¿w2û¸M¢'•+÷…hÙ‡RY`ÿîSˆNóog/¬ÃŦ¾XÆ0Ò
ï°Ø:Ýÿšˆ~!ÓÃ…åHÈóK!‚œ
ªUÒÒ6¾;+Ýl6ÇJÙhÁçj›®·©=¿‡¸!b¸øÓ§bOý�ÏÆ�óÜÚÑ:GÁdOž{a8ž	Azf%&íÄYšaÁŽ¶Xž¢¹“Éf–Ë6›YÞ>2ã¼\Æo[ëÔ¦¤½í1ŽöeI„±Ú7fD�4HŒñp|óéûÜœM%„T?‡›èiM7QúÄì<Ãab°±7bÐ …°°�«Uì�dØ€eïĬ×Cwå�ðF„ �ƒ,–©µ¤eÉ�ºJQ07Õü�ë¾fÃ6s·s·ƒGîÑŠ‘Õ4
Ÿ*ÝžÒ¥§¨BRÓÜÞWŒYƒSaäßß]êP€õîÐýksh<n!È_Æå&�³J¶ƒg ã˜7‚z§¨“cõ®ÚûÅÜ¡ÑèÇ(Ž_Â¥½šdaèÎm0f««Áñ
‰Bë,¹†‚‚O6
+ª`mÙN)ý0l•ç�DRÐk@® k½Xv4ÝXî+¶ÿ
x$lª]CpX©î°Ò:×
3K¿xé…áâERD0»†úãRBÒŠóꯣÍæ@)-È\,Y0�ÑÒ�¯…`Yú§¼µÏuº jÜ“ò^Žrm–t%È° Èy%ØÑf3åe£M”'‘­Íæ<㾕<ÌYoív�1€²é} çt ÖWIsPš‘r«?Ây7›Íœ—�6ÊÿVõ»µguN“~´¶†hù£Sôž›Œ¢t»YV…Ì^ñU6�š=-¦殲Î|ȧ0NÜÆgW.³Â8¶'ÿøÄäÛ*1Ç7öZT<“Úâ»�¬î«Ì.#g2ÙÇyuv¥Ù%�“ñb¾a)Ñg_˜ß³Ýƒo\*hÒ©±E^>¶$‹ùM<esËäáæçñk›~º}mÃÔ¯oïÞÿÖI�¬<àgçFAªêóÙW8ëCF{Ìv•Æ*ÒìŽkL“OcWÅòØ4é„.bhç!†�rZ]P�áÇ«Z?Û­‡Ä“äCáPG4)çeCÇ‚tg»ÕŽ‹ÓÁ�áý”QpjkânÕÝ¡Zf§½;u6‚JÚ�Ñ^ŽQ
+2ŸÿÕtçsŒBA—Œ—ŠÚ	B»™m&´l·Bh.;J4µSæ2™ºä^»Ïaò|‚ñÖþÖÙ‰E?Æ{a8ÆA¹\…q"�
Y´Œ|w3ÚÌwÙjã˜Qäòq>[ûSçÂ4¼Óçùì…aùÔ
¬H_…NL#ú°ß63ÚÍl3¡e»¡‡saíE`ýW¤b®,÷ó†4,Z/ªÆ( PÝ+&Z#䡆
3Òæå|þò:d yibáIéRîÖ½Vp›ÿX¢äÝÊÌïòW‡Âæ_Yr4›
+endstream
+endobj
+5552 0 obj
+<<
+/Type /Page
+/Contents 5553 0 R
+/Resources 5551 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 5558 0 R
+/Annots [ 5545 0 R 5546 0 R 5547 0 R 5548 0 R 5549 0 R 5550 0 R ]
+>>
+endobj
+5545 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 570.123 157.248 577.336]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5546 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 558.168 157.248 565.381]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5547 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 546.213 157.248 553.426]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5548 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 234.932 157.248 242.145]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5549 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 222.977 157.248 230.19]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5550 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 211.022 157.248 218.235]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5554 0 obj
+<<
+/D [5552 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+5555 0 obj
+<<
+/D [5552 0 R /XYZ 70.866 771.024 null]
+>>
+endobj
+5471 0 obj
+<<
+/D [5552 0 R /XYZ 70.866 679.024 null]
+>>
+endobj
+1950 0 obj
+<<
+/D [5552 0 R /XYZ 70.866 651.828 null]
+>>
+endobj
+5556 0 obj
+<<
+/D [5552 0 R /XYZ 70.866 508.562 null]
+>>
+endobj
+5472 0 obj
+<<
+/D [5552 0 R /XYZ 70.866 343.833 null]
+>>
+endobj
+1954 0 obj
+<<
+/D [5552 0 R /XYZ 70.866 316.637 null]
+>>
+endobj
+5557 0 obj
+<<
+/D [5552 0 R /XYZ 70.866 173.371 null]
+>>
+endobj
+5551 0 obj
+<<
+/Font << /F50 2307 0 R /F67 2878 0 R /F70 2881 0 R /F43 2258 0 R /F72 2883 0 R /F96 4060 0 R /F79 3175 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+5592 0 obj
+<<
+/Length 1605      
+/Filter /FlateDecode
+>>
+stream
+xÚÍZ[sÚF~çWhÚè„õÞw5}r®Mì´©M:IÆ#ƒM@¢’pãß#í
+$´Ø`LÊC,±Z�Ëw¾söì*Ø›xØ{×y9蜽ØÓÈ—’yƒ±§0ÒRzʧHo0ò>w	ý¯ƒƒgŒKx±~ÍÂ^Ÿ*Ý}�—ó0΃<JâbjçÍ óO‡ÀLì‘•H­‘¦ÜÎ;Ÿ¿boÏ>x Ñ×Þ¿å̹ÇC‚3¸Ÿy×�?;Øš¹º"*ŠÛâb�—Êa¼äH*i̼
+óeg¥Y›òÎÞ‚²õë”"øÝ'a.ÌÛyÚëÑ]ZO£±¹fÑ$@n5œ™ë]�Šn0‹F/Ìïp–ÙãÃð~‚�÷­^Å‘æÜ蕈2D• cܽ>¿¼ÉgÙu¥÷þ#NQO!_aRˆÃ^Ÿ¤…õà.‰F½¾tÈ0£…¤2¼’ ®¸O�_½ŹÑàËšâ#BuÅÀâ|6ya
.žNlä¯
+ˆÆõí»
-É0F�Á[~í-ª‘ôi¥ðÆÌa•�0QÕœ‹7ïjSHaÿè
®Î¿>1›®ß¿s¨Þ5˹¦iÄöm©-ç‹ÅìÞ0>0—I‡&‡¢¡\^›È-IgC;a‘ofŒ"ãr#ó7ÒÙB3F|êQÞ
Ò`æ š�n3ù]µI0�¤fÕ&
+°øÂ_Õ¦g–A–Â’�‘‡dÀlŽ°`VDYU£‚+D9QPCªnr´]š	aHcùT½
F�Â9½¡8Ÿ†ÎŠ™ß/¶9ÔÇHÒ§˜ÓŽˆ Œуd؈b‰”â�ºBAÈc…j 1[¸Âù4¥îpÖµ®Â¹°)kV¼ÜŽ~ëQÜ
‹?¶,³pdžÔÂÞ†÷æöQ›#Û™±·gí¨‚
ÝAÌ8H†a‡‹ùÌà¾D>—µ…f;7ž¨ÖÉ�†ÞU£x±Ì)ñÓ ›6‰q[#A8Ú΀ýíoE�û°¬Â*x“aáã0á9 ¡YÔ~cYßÿ§)uÇ¿®uÿd™¯°CJïoP;
+ò°xî-¢Ú;
+D ¢¶ÿàÄp£êä¹mâ¡ù¾É‚šní(�<´Øæ×»¤™0+¼G�í—	Á¸šSmM ¤³zCµî!©Y¬˜¶:‹FÐh›qÙûµ‡•íÊDi}ᄽ7¼ÏåÆâìÌl0>¥É0Ì2óÃÖ†â6
‡atÚÍÉ8Mæv›¦wзÕ�lë×n³üµYÂÐÈŠ•u둵‘?GãxŽ�fèLoŠMÒoNåd¥†à½Õ€Ž(wQ³Ö↞ÐÝ¡ÿ+³*?¾¿:uiî‡Iµõ›E·i�Þ?bs›Á÷‡:Ζ#«û§-9P’YFnX•%;)X‰Ûæ„p:AqeE	¡±£¼]›~‡]DÜ<>0Ú©¨ÕZ¿?œdV6NÅÑjßôË648"š{µ™qbØÚ4E–Û´ò@à×ÒѾò‘ÀtÓ]7£¨:>
+ö ¡vÓüê�b-¦aš¹\´œØMsK«G˜F®ö%Т´5¢†)áÅ�ŒÚ¬Ô]‹?1T'i²\Tè,|KèML
yͨ± ŽhŽ&rîdåäÄ…Þæ(pR�õÝpŠœfSßÀ“úH¾	uã©OÏWašÓ*u�yß(°ÕÂ’FîKhRÉ&„¾YñRÿ6If»CÅQ~Ý>¼h´Ühäáºà	ÿøÖ;»Æ£½½“Ø=,O,+Š�ò :-{Þ¬°
J¹ÐÝdË(€K9‡;A¸.ÃøhhòoŠÓËíP)îÖû°¿ëAŒ.ÂûÙ½ß�+ÚÝgjõ“ÿ
€u‰ÔîžÐ?µlIƒx”Ì_Þçá~ÅÓwRœ`|j+ƒqð�Ö§³çäðíÅÖÝl9£ýéΣX ÌÈãMóU­¡ØG”ˆMÔ‰;'·LO¿�Æo¾çi0Ì�Œll†;i¾Skøéêb?Ùœ€h¶‹h€g°§l‰0Õ»È~ñ±Æ!†á‘ÚàJu¢õÐ'RÃ×=þ÷Fu@*AŸäÅé"	Áኤ¬Ž5‹ÄA^}'º­}=z�‹¾ßOŠóÓîFUÿ™jǼ
+endstream
+endobj
+5591 0 obj
+<<
+/Type /Page
+/Contents 5592 0 R
+/Resources 5590 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 5558 0 R
+/Annots [ 5559 0 R 5560 0 R 5561 0 R 5562 0 R 5563 0 R 5564 0 R 5565 0 R 5566 0 R 5567 0 R 5568 0 R 5569 0 R 5570 0 R 5571 0 R 5572 0 R 5573 0 R 5574 0 R 5575 0 R 5576 0 R 5577 0 R 5578 0 R 5579 0 R 5580 0 R 5581 0 R ]
+>>
+endobj
+5559 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 614.902 157.248 622.115]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5560 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 602.947 157.248 610.16]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5561 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 590.992 157.248 598.205]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5562 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [69.87 375.131 212.775 383.902]
+/A << /S /GoTo /D (tls__sal_8h) >>
+>>
+endobj
+5563 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [136.819 302.667 172.286 310.036]
+/A << /S /GoTo /D (tls1__3_8h) >>
+>>
+endobj
+5564 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [149.372 286.726 184.839 293.789]
+/A << /S /GoTo /D (tls__sal_8h_a62fb33997562fa9f4f3b29c02b47a77f) >>
+>>
+endobj
+5565 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [141.003 270.629 189.023 278.156]
+/A << /S /GoTo /D (tls__sal_8h_a808235992932012ef83baa255cbc5dd6) >>
+>>
+endobj
+5566 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [141.003 254.689 184.839 261.908]
+/A << /S /GoTo /D (tls__sal_8h_a29234294cedf38c4bcde0628d60eb574) >>
+>>
+endobj
+5567 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [141.003 238.749 176.47 246.275]
+/A << /S /GoTo /D (tls__sal_8h_a4825a14218af99362d0183f71d9cbaf2) >>
+>>
+endobj
+5568 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [141.003 222.809 193.207 230.335]
+/A << /S /GoTo /D (tls__sal_8h_aeff2ed65094d7367f61fde67c57f1a3f) >>
+>>
+endobj
+5569 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 207.025 193.207 214.395]
+/A << /S /GoTo /D (tls__sal_8h_ab76e7d66aad85296057c6b5e0a730e87) >>
+>>
+endobj
+5570 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 191.085 189.023 198.454]
+/A << /S /GoTo /D (tls__sal_8h_af0a45e41d3656ef9c63525b04ce9128a) >>
+>>
+endobj
+5571 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [141.003 174.988 193.207 182.514]
+/A << /S /GoTo /D (tls__sal_8h_a0793a30d3c3866ab32b753b92fb0a07d) >>
+>>
+endobj
+5572 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [141.003 159.205 189.023 166.574]
+/A << /S /GoTo /D (tls__sal_8h_a8d303dcc6bf5b5bf5edd51e38c477f2d) >>
+>>
+endobj
+5573 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [111.713 143.108 172.286 150.634]
+/A << /S /GoTo /D (tls__sal_8h_aab75c91cf197022f100d94374f45a881) >>
+>>
+endobj
+5574 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [111.713 127.167 172.286 134.694]
+/A << /S /GoTo /D (tls__sal_8h_a13449a33ffd970e78387f523d44d131b) >>
+>>
+endobj
+5575 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [141.003 111.227 201.576 118.753]
+/A << /S /GoTo /D (tls__sal_8h_ac77eb18d9c8ce4ed73d35849a324710c) >>
+>>
+endobj
+5576 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 95.444 209.944 102.813]
+/A << /S /GoTo /D (tls__sal_8h_a2895671c64db7244ca7de9fe1bf143e8) >>
+>>
+endobj
+5577 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [249.795 96.253 272.709 102.813]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5578 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 79.504 209.944 86.873]
+/A << /S /GoTo /D (tls__sal_8h_a1905f28ad597708f1a8bd5e93f8bc51c) >>
+>>
+endobj
+5579 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [245.611 80.313 268.525 86.873]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5580 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [291.638 80.313 314.552 86.873]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5581 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [341.85 80.313 364.764 86.873]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5593 0 obj
+<<
+/D [5591 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+5473 0 obj
+<<
+/D [5591 0 R /XYZ 70.866 723.803 null]
+>>
+endobj
+1958 0 obj
+<<
+/D [5591 0 R /XYZ 70.866 696.607 null]
+>>
+endobj
+5594 0 obj
+<<
+/D [5591 0 R /XYZ 70.866 553.341 null]
+>>
+endobj
+5595 0 obj
+<<
+/D [5591 0 R /XYZ 70.866 459.128 null]
+>>
+endobj
+1962 0 obj
+<<
+/D [5591 0 R /XYZ 70.866 442.715 null]
+>>
+endobj
+5590 0 obj
+<<
+/Font << /F50 2307 0 R /F67 2878 0 R /F43 2258 0 R /F72 2883 0 R /F96 4060 0 R /F79 3175 0 R /F70 2881 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+5640 0 obj
+<<
+/Length 1756      
+/Filter /FlateDecode
+>>
+stream
+xÚåZmoÛ6þî_!¬_ì!aøN¤h’¥n›,NmQ(’lu$O’Ûúßïôb[R%[ÊìÌÀ¾Ø%�÷<Ç»…�‰��«ÞËûÞÙ¥À†‰´”̸
+#SJCiŠ$1îãC_"*§T™ýx}Ž{@qÿ‹Ghšu_z37kݹã
Á}7t}Û|ºmpf"aš0[*‹0’t÷.î{÷ôbƒ¬ç4MdRnØ�½Ÿ°áÀ½×FL›Æ·ôÉGƒ†gО£Þ=\\‡¢†DZ1³¸I^-cBt:=HCF†Éð¬ywÕ3>œJÚ�ÝÐÏŸË䃰°üøMÆUº6ã¿žS�®2››'Gço>O¿8ã‹ïsË/�
u?b�³¾–³÷=?®I§™Æ˹{ÒIT:®A\0sý“•ëرUY€„0�S‚(Íðø9c"¦06½7÷ÍÒë$s‚LàD­`^|{7ì®6—Ss·ðëw—7ù%½{Ê`µÜ¤Æ©F®ÙGS<Ap¥Û<:R>Zö³Ð±%ÄDi¤An
+©gOÞ}ßM2cˆ+Þ ˜Ÿ X´ü¶À*4âTU	¢kyÃÄÑñÆŠ¦ï³ÙÁ¸M­ŽÌ� Bu+€/à@ þqefß„&ë�PùâDªNº¨¬¹1ÏÙÙ c?˜(k�¾{�•5þA¸Y;'çÇþµïŇÛ8¶žþÂ÷Rã–ÆD€«Ýø´è…X ÌHÕâ¢A�ˆÛ0°Ý(:CkÙHk3-‘”´Í<í–iôí©V0Óà²m<öád/¼ZÁg1Z_°zðym·$‡çDu1;)q³ˆç‹xd�
+1uldpšx³}KZ‹–::¶\˹ðíp9ïˆW:$¨&O	ÑbŒ\ßÙ�GM�p³W?{S!Sí®`¶ý¨=�÷¡5äªÓÝæžÇ3J…¤Ð»åÞŸ_+Í`;UÊ×ogæ3$A0ëæ	¯Üçö„е¿þ¯=Á~VO°ÿCO0ë³:}t1aâúnhÅîÐ]ÞZ^x°,{‹y7<(HÖ&J�†O‡z»äÛa1
O×fÓÚM�bzl›Þ
+êx”ëŒ`ûsã£Â›KØŽx›ðIx›m$ßLòhTÜ5 P\T9S¢Ùô×Ö”°c£X<‹FÞÄ·âEèþé†Þxy¸w6Þä|6éÊ0Šd›þîüݨ›h
z“Ait}µ¿÷ÐÅ }ûþåðâ¯"Ÿ‚Ǭr¦žJôèS‘JÇE"¢�0ùn¨
ŽÃ@ýTz’Ý¢�žE
+QŠ g©r¥>àÑf‰Í[Ìš5P¥ž
ú/ `ôÆ%ýÓãDB‘&D$çp0IÂnR:K$w?L<»›oŽ*qrÌ‚$–«ê5ÎÆ-æÙÿJxòd�ã
Ãý Ì.B(.<’]$'piãÜ%¢ïÅÉ­tZE

ÓR™OK92s^x¾=[8¹~”)½>ùüµF”‚È¢WDq¢i�$° IÉêÁßj$�I5b2	o�øYQ.Eë§Äâ)ãÀØ?­(�>/ö½˜Ø{tk—ˆ%ç²Û–¢â„J³…ïE±³3‹ýsÀñ‚zݲg»nPß胩¶ŒÎÀ£ÀUkõƒ|[±¶cQu0ÛYáÜ:óüý¤@JðíúQ…&
.´lgÞÑÌ–˜ìw¤è‚rÎÃñzÆÂol 1°QW�a¬³G_Y±•E£Q.ì$µŠ*q¶‰D*yATˆL×
}“I	!ûöÌŠ¢æï Ò9K‘³’	Vÿ«2ÀTÉEX&©Å؀Ąêd7çHsžç.Íòs
<?Š­$ìC Fµfca0Ô	X°Lìeí�ê6K‘í¦Úä¢
†‚œÃžy®¯s�šµ¤90I…¥×ó$ýà��d׫÷fÀYà¡ÀÐ4'ÏGœÕœ•å€UÍ5Á¼ù€‰~.v=_<FIªX‹c-p0húÝB
/¥8ÏÊrZfË®K´¶ÿtÍÈÅ¿µþÄ�¯o`IËq ô ý(j²ƒ�!ÕÐ’<ÙÄ
RABé.R§AûÖ£Û
&Hª±.Ã4YeÀñ4Ì“�–(Z¥ÀaðXÂòýÝ›ö íØ]¾¨èoÊÇF¿ñ�›kŸä¦Úñ^´�leÂ
+чŒÕ'Û•ÿ±h«L%c²Ë¼/ÛÏYR–pO¬¹ªa³f²…¦¨¸a	õ-^[÷u¦ÈNT;|œ¹ú¸j>%yá£LU›Ìó««üUg®íC¢Í2k¿
+’Zíûr’Œ}ׯªøŠÙÃv
+endstream
+endobj
+5639 0 obj
+<<
+/Type /Page
+/Contents 5640 0 R
+/Resources 5638 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 5558 0 R
+/Annots [ 5582 0 R 5583 0 R 5584 0 R 5585 0 R 5586 0 R 5587 0 R 5588 0 R 5589 0 R 5596 0 R 5597 0 R 5598 0 R 5599 0 R 5600 0 R 5601 0 R 5602 0 R 5603 0 R 5604 0 R 5605 0 R 5606 0 R 5607 0 R 5608 0 R 5609 0 R 5610 0 R 5611 0 R 5612 0 R 5613 0 R 5614 0 R 5615 0 R 5616 0 R 5617 0 R 5618 0 R 5619 0 R 5620 0 R 5621 0 R 5622 0 R 5623 0 R 5624 0 R 5625 0 R 5626 0 R 5627 0 R 5628 0 R 5629 0 R 5630 0 R 5631 0 R ]
+>>
+endobj
+5582 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 758.991 205.76 766.517]
+/A << /S /GoTo /D (tls__sal_8h_abb77bcf10cb38c7312a7a07b0b951732) >>
+>>
+endobj
+5583 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [295.822 759.957 318.736 766.517]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5584 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [341.85 759.957 364.764 766.517]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5585 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [392.061 759.957 414.975 766.517]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5586 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 743.207 180.654 750.577]
+/A << /S /GoTo /D (tls__sal_8h_a72c6f91ca8ee5f1cace7b1e49556f344) >>
+>>
+endobj
+5587 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [224.689 744.016 247.603 750.577]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5588 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [262.348 744.016 285.262 750.577]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5589 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [300.007 744.016 322.921 750.577]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5596 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 727.267 197.392 734.637]
+/A << /S /GoTo /D (tls__sal_8h_a06f2be86c6a75520db79ffabfc420b6c) >>
+>>
+endobj
+5597 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [233.058 728.076 255.972 734.637]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5598 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 695.387 197.392 702.756]
+/A << /S /GoTo /D (tls__sal_8h_a9e7208079886cace1d02513ea7fe6a26) >>
+>>
+endobj
+5599 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [237.242 696.196 268.525 702.756]
+/A << /S /GoTo /D (structunihash) >>
+>>
+endobj
+5600 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 679.29 230.866 686.816]
+/A << /S /GoTo /D (tls__sal_8h_a23a7cc46d32b4f319aaf18d65527d309) >>
+>>
+endobj
+5601 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [233.058 680.256 264.34 686.816]
+/A << /S /GoTo /D (structunihash) >>
+>>
+endobj
+5602 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [141.003 655.379 201.576 662.906]
+/A << /S /GoTo /D (tls__sal_8h_a8182a146d9381e90b2bdd98a00d71981) >>
+>>
+endobj
+5603 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [203.768 656.345 235.05 662.906]
+/A << /S /GoTo /D (structunihash) >>
+>>
+endobj
+5604 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 639.439 209.944 646.965]
+/A << /S /GoTo /D (tls__sal_8h_aaaf5555a4ac9a916b0ef075246536c15) >>
+>>
+endobj
+5605 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [212.136 639.439 239.235 646.393]
+/A << /S /GoTo /D (structcrypto) >>
+>>
+endobj
+5606 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [433.904 640.405 456.819 646.965]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5607 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 623.499 209.944 631.025]
+/A << /S /GoTo /D (tls__sal_8h_aa19daa6fb66babf69e7803cebd799822) >>
+>>
+endobj
+5608 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [212.136 623.499 239.235 630.453]
+/A << /S /GoTo /D (structcrypto) >>
+>>
+endobj
+5609 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [433.904 624.465 456.819 631.025]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5610 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 607.559 226.682 615.085]
+/A << /S /GoTo /D (tls__sal_8h_af3c6cdb6ef9337ef5da8a9a7eaf499fe) >>
+>>
+endobj
+5611 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [270.717 608.525 293.631 615.085]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5612 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [312.56 608.525 335.474 615.085]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5613 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 591.618 247.603 599.145]
+/A << /S /GoTo /D (tls__sal_8h_aace924671f2ab6d930506ac1b5a369e4) >>
+>>
+endobj
+5614 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [291.638 592.584 314.552 599.145]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5615 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [333.481 592.584 356.395 599.145]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5616 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [375.324 592.584 398.238 599.145]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5617 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 567.708 239.235 575.234]
+/A << /S /GoTo /D (tls__sal_8h_a94dad73db6a55397ab0b94f804255c27) >>
+>>
+endobj
+5618 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [287.454 568.674 310.368 575.234]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5619 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [341.85 568.674 364.764 575.234]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5620 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [387.877 568.674 410.791 575.234]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5621 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 551.768 214.129 559.294]
+/A << /S /GoTo /D (tls__sal_8h_ac019b5b53dd056f21d22ecc8d2e83d3e) >>
+>>
+endobj
+5622 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [262.348 552.734 285.262 559.294]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5623 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [308.375 552.734 331.289 559.294]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5624 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [362.771 552.734 385.685 559.294]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5625 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [117.694 222.73 146.738 231.501]
+/A << /S /GoTo /D (class_socket) >>
+>>
+endobj
+5626 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [108.95 207.804 135.288 215.897]
+/A << /S /GoTo /D (class_socket) >>
+>>
+endobj
+5627 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.737 140.993 159.873 149.477]
+/A << /S /GoTo /D (tls__sockets_8h_a5013aef55fe502aeb151cb0afb1eb9c1) >>
+>>
+endobj
+5628 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.737 111.206 161.2 121.581]
+/A << /S /GoTo /D (tls__sockets_8h_a7541b8517df33c37c33a18e704e160cf) >>
+>>
+endobj
+5629 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.489 85.121 158.842 93.892]
+/A << /S /GoTo /D (tls__sockets_8h_a1a1abbec5212c04c6e6bc6b148a1c52b) >>
+>>
+endobj
+5630 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [162.328 85.121 191.372 93.892]
+/A << /S /GoTo /D (class_socket) >>
+>>
+endobj
+5631 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [222.765 85.202 246.689 93.686]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5641 0 obj
+<<
+/D [5639 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+3040 0 obj
+<<
+/D [5639 0 R /XYZ 70.866 529.705 null]
+>>
+endobj
+1966 0 obj
+<<
+/D [5639 0 R /XYZ 70.866 513.292 null]
+>>
+endobj
+5642 0 obj
+<<
+/D [5639 0 R /XYZ 70.866 262.678 null]
+>>
+endobj
+5643 0 obj
+<<
+/D [5639 0 R /XYZ 70.866 180.86 null]
+>>
+endobj
+5638 0 obj
+<<
+/Font << /F50 2307 0 R /F72 2883 0 R /F43 2258 0 R /F23 2944 0 R /F70 2881 0 R /F26 2949 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+5656 0 obj
+<<
+/Length 1271      
+/Filter /FlateDecode
+>>
+stream
+xÚåXÝsâ6ç¯Ð£=sV$YÖcÓ47wÓNÓoÉ=£€çÀ¦Æizÿ}W–`Èu:Ó—ØAÒo?~»«]4A}\W·‚ k)S4|FŠàLJ¤4Ã’¢á=D4eñ×ág”ÂZÊ%l¾-f&N˜Ê¢›*™›²5EUÚ­ƒ_†ƒ?vDW�Y†3ÆQ><|%hkŸ ê½¶;爋žÂûÝþ¯&ÙTÖ×êf
+K‘"%)&AßGÆD«E8†!dôWÌDTc¿fU«'^Ç/í.kÌÒ”ã_M¹
`—‰ oŽî«<f$úfÿ˜¦sþê–I¤Aix€ÒZbÆuðã#!©Ý½eÇ:£aO>+À¿œ»‹²q/3S‚J´#j-RYZ‰ÔÊ¢%
+�S…
+¸œ;TkªC¹•ÉSѬ¤˜‰©ýúÒ?K÷¬òfä�6•{ÞÛ½)q^†÷®ýÓÆ0Ó)(ðGX³Ö$lbšëï�YþHÆ2x=Ÿ°|:ªÝ�(8*Ž£²°ç)æ$ÚŽƒ×ÿ^˜¼1ã“Ã�2È4»ñP›ÜŽ?ýd=ÓúÖ±S±âw3n–]GúßÊt
+á¤P`—‡Â§²¡²w(Ð>± Às²m.NOU‚©G¨y3UŸëj~ˆœ3/�Æÿd0þ£É`ïS$Ï©‘1�ò˜ê“ØÀ†ê_'OfCf'°\]”“ÙV!ûï¥ÈïíMÚŸ`%(
Üø÷pËA1ÏTÿ<ùpØ€jGû-¹¼Tö‰ˆkkÔ;Ýq󖫃ѲÛÒœm×L	VB·v&©Æ$C	g˜@?ÚŠ‚.O`'”ݘf
³—pc–y],Âí¸åpgB„6Í{áe±O9?[U¾îÔf4†ðz©¯°
+7xÑØ¥ŽASûjÖ�RmiÃ0…ßZm~Š�^šiU¿ABÇHnZ¸7ç·Â)îÛƼjö{ÔÝñ(ó½})]{±ÙškÀ
+E±¦biŸ¸uióÁ½6C°Al1¤°V„îa¨�SéqÆ7÷SÈc#
+W¶v�›[t°y�N5¦,	±¨j—†[:$~[pÝj*½±º=Mw³°#˜®*D±Ø+A3Õ߆¦š/÷àµjmè|Ý-¹”p,(ôªŒÃékn!Þt¾óüÛýH�3
+S™G¿³A>ªGsÓÀUNiÔ�.ö�·ŒCLÁÝt`¼¥š@,«ÕxûÎvàSÚV»°›c
+·—ƒh§jÕù À $– VÃ8�ñ£Ùð)a0ÉèsEwئâìfê™þ|wõéν¯rõÛ‚×i‘O»£iîF‘]Å™„zÃøŠïRŠ_HÿEž~ª°„ì:l
+äÈ9F?Tà”¥¡ àý<™ûyߺâ=p>�k³ô7ÞkÑL/༷һ|
'ì2Î/Â𜓊šzΉ­Îº[µß`ý<©ûYïˆ
¬7ÅÜ$Õ‹Oð…ñíK5Ý¡{΋٬X`|¼<Àwouw¹"²Ëøî�±¿Kk�ٹü*84Q¾Ýýbš—º\žÙª­˜Ø÷�g
+}å̽…À$¥}¾ú†�Òp*ÉÝ—2èÀ$.ÖwÂGSšZ€ñæ„zÁv\ø>±Ý]´õ-tü‰=BZ
+endstream
+endobj
+5655 0 obj
+<<
+/Type /Page
+/Contents 5656 0 R
+/Resources 5654 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 5558 0 R
+/Annots [ 5632 0 R 5633 0 R 5634 0 R 5635 0 R 5636 0 R 5637 0 R 5647 0 R 5648 0 R 5649 0 R 5650 0 R 5651 0 R 5652 0 R 5653 0 R ]
+>>
+endobj
+5632 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.489 759.962 149.876 768.446]
+/A << /S /GoTo /D (tls__sockets_8h_ad4cecfe2f93ed49bda489b41e1673b5f) >>
+>>
+endobj
+5633 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [153.362 759.881 182.405 768.652]
+/A << /S /GoTo /D (class_socket) >>
+>>
+endobj
+5634 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.737 730.174 143.617 740.55]
+/A << /S /GoTo /D (tls__sockets_8h_adb86bfbca7563c85fa80130b8e9ca3c1) >>
+>>
+endobj
+5635 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [147.103 731.986 176.147 740.757]
+/A << /S /GoTo /D (class_socket) >>
+>>
+endobj
+5636 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.737 702.279 141.134 712.655]
+/A << /S /GoTo /D (tls__sockets_8h_a9e377d7cf9f9307fa2335b3b6aaa92a4) >>
+>>
+endobj
+5637 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [144.619 704.09 173.663 712.861]
+/A << /S /GoTo /D (class_socket) >>
+>>
+endobj
+5647 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.737 674.384 141.134 684.76]
+/A << /S /GoTo /D (tls__sockets_8h_ac0c18423ccde1870aebe4a0746a2de5b) >>
+>>
+endobj
+5648 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [144.619 676.195 173.663 684.966]
+/A << /S /GoTo /D (class_socket) >>
+>>
+endobj
+5649 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.737 646.488 139.134 656.864]
+/A << /S /GoTo /D (tls__sockets_8h_aa6e4a0ba6948d599480de3449b0166ad) >>
+>>
+endobj
+5650 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [142.62 648.299 171.664 657.07]
+/A << /S /GoTo /D (class_socket) >>
+>>
+endobj
+5651 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.737 618.593 145.115 629.175]
+/A << /S /GoTo /D (tls__sockets_8h_acc32c3ae0be546ae354fdfddba021640) >>
+>>
+endobj
+5652 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [148.6 620.404 177.644 629.175]
+/A << /S /GoTo /D (class_socket) >>
+>>
+endobj
+5653 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [209.038 620.485 232.961 628.969]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5657 0 obj
+<<
+/D [5655 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+1970 0 obj
+<<
+/D [5655 0 R /XYZ 70.866 591.307 null]
+>>
+endobj
+1974 0 obj
+<<
+/D [5655 0 R /XYZ 70.866 467.096 null]
+>>
+endobj
+5644 0 obj
+<<
+/D [5655 0 R /XYZ 70.866 420.568 null]
+>>
+endobj
+1978 0 obj
+<<
+/D [5655 0 R /XYZ 70.866 393.372 null]
+>>
+endobj
+5658 0 obj
+<<
+/D [5655 0 R /XYZ 70.866 263.953 null]
+>>
+endobj
+5645 0 obj
+<<
+/D [5655 0 R /XYZ 70.866 113.881 null]
+>>
+endobj
+5654 0 obj
+<<
+/Font << /F50 2307 0 R /F43 2258 0 R /F26 2949 0 R /F70 2881 0 R /F67 2878 0 R /F72 2883 0 R /F96 4060 0 R /F79 3175 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+5671 0 obj
+<<
+/Length 1214      
+/Filter /FlateDecode
+>>
+stream
+xÚÍXMsÛ6½ëWàH͘¾?®™Öžf2ÓÔvNI¦#“°­©L¦$�6ÿ¾¤I‘#Ê™éÁ�oûv÷
"è
tµz{»zs)	2Ø*ÅÑí=Ò¥�¶+ŠnSô)R˜ÉuÌ´‰ª]ùg™'kF¢¿\UâÇfúr»sÍÓµ»_S¹Âe‰[¹}‡7XÖj,ʹŸ^ýz»ú{Ea– ÚÙ4&Pò´úô… ¾{‡æÖ ê•OHHŽ¥àð¼C7«?VdvŠbÒßf˜­cJ‰ü¹ê·kN¢Mê=OW–Ÿ‰$ðG½§o.5C[M¨‡%(æ)ÄmV­cå±<Ì&­_of<H
ð@h‰bJ±•ªy/yÜ
ÝöÐÇ–¶¡úLoÖXÕ[c1¡º]³ýz1ád̶L“òuM>æe•mžÜ„]Á1áæ¬� öBLL¹ÆB ˜	`»Y
+Ñ	ö	8©Ç.¤þÃ}‘?…éføxý¾Î&ÄúLðÃd‚Ò=ƒ@l¯±õaÍD´)`•+Ö”Fe2i*1•€ÄTæXbRm1eºKÌWÆðI,‘âkÆ�aÀj TÈQ×…Ô…ÆL0€²@‚l³h\“”1‰²Ðä€qÊü³Ú<ÈôÈ&,x"¸2&
 äñ3OäY�HF0Õbf+SIg‰ôedÕ¸6§é\fxšÎ¾åŽÎmöõ9ó
ÔW�õÛšÉÈ?ûÉÚ½úÉ7H(à¶M ýd‡Ç„QêLÒOÇhÊ°7Õá´§`ABjÀ|ÌkW=Ù°/µã@+|Ž©Á¤­,š¥µ<D½|N_\TFÍ™XUØlwÏEèîE�ƒ-
´1PTµtYú{RmÒWÐoù6m³{y¨Ÿ«†ˆâ!0r}µJjØöMžÀ™d³=©ã¼~k^ëT»&Ùm]V]pc_uÄ´tàU^oèˆSPLÊòSœz;T‹¥³ÂKÖÂå
g"õЀ³fl\n}ÂÊ7o{ôÿÚ Ïi0…~Ek0W‹ãòi ë((â³ šÆÍ%¤;ŒsäéšiÜ\Â�@Ò~¢M´m"0j©Ýaߦ„‹
w}{�Ñz.ɳÌ%Õ6™Qå{§´ý?nãRaËéÿÇì
�ñ¬8#¤”9‘zf+›YéæBb%x¯ª�¿Èâ4÷}“�½Šo)¾_U…¿m²òi[U.=Âð©NŽÉ^ôyŸŽqðêÈ|�ì	�è	Ý{—-•9xõ)rGM½\yLjÔ~º«ßö7†«×Ø9•²pðãlp=ìiT3Pßm«öÀY¹‡NžÊƒZÖföTÏúÉ÷G*VÐq�d%Ó3jgöyMë¢>9¸z
õò—xÂØ�©×B»“l`ø'«³$ncú‚‡˜O�³0B
+ÀMÁ9{Ÿ"’ϦT…¡bPñø_ftšÿ¾ÕŽÊƒ
a_Ï\–ä©K‡Ý¢×%6m§™¾.9NÞܘX€ÐÇ!æ“ãtŒ¶e�°ü)‰ÓS~‡mEdRƒ¶¾ˆ¨?o¨ W.sŦj£ç‹õ{óüKÿ~?Éfû-õ?ø¶
+
+endstream
+endobj
+5670 0 obj
+<<
+/Type /Page
+/Contents 5671 0 R
+/Resources 5669 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 5558 0 R
+/Annots [ 5665 0 R 5666 0 R 5667 0 R ]
+>>
+endobj
+5665 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 433.852 162.03 441.065]
+/A << /S /GoTo /D (class_socket) >>
+>>
+endobj
+5666 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 421.897 157.248 429.11]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5667 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 213.915 162.03 221.128]
+/A << /S /GoTo /D (class_socket) >>
+>>
+endobj
+5672 0 obj
+<<
+/D [5670 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+1982 0 obj
+<<
+/D [5670 0 R /XYZ 70.866 771.024 null]
+>>
+endobj
+5673 0 obj
+<<
+/D [5670 0 R /XYZ 70.866 666.526 null]
+>>
+endobj
+5646 0 obj
+<<
+/D [5670 0 R /XYZ 70.866 530.797 null]
+>>
+endobj
+1986 0 obj
+<<
+/D [5670 0 R /XYZ 70.866 503.602 null]
+>>
+endobj
+5674 0 obj
+<<
+/D [5670 0 R /XYZ 70.866 386.138 null]
+>>
+endobj
+5659 0 obj
+<<
+/D [5670 0 R /XYZ 70.866 310.86 null]
+>>
+endobj
+1990 0 obj
+<<
+/D [5670 0 R /XYZ 70.866 283.665 null]
+>>
+endobj
+5675 0 obj
+<<
+/D [5670 0 R /XYZ 70.866 164.309 null]
+>>
+endobj
+5660 0 obj
+<<
+/D [5670 0 R /XYZ 70.866 87.788 null]
+>>
+endobj
+5669 0 obj
+<<
+/Font << /F50 2307 0 R /F72 2883 0 R /F79 3175 0 R /F96 4060 0 R /F43 2258 0 R /F67 2878 0 R /F70 2881 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+5680 0 obj
+<<
+/Length 1025      
+/Filter /FlateDecode
+>>
+stream
+xÚÍXMsÛ6½ëWà(΄ŸÄ5ÓÚÓœÚX·$™†M,ª•¨¶ù÷] Dš”d’r¦"	¼]àí¾]’‘'ÂÈíìÃböþF1’Q«µ ‹GbÍ´&Ærª�,Èç9™|]|$Ÿ	©qauûfõì’”›lþË&߯]Q.ËÕ¦ðSg¿.fÍg2È,£—$_Ï>eä
Ÿ}$ˆh3òO5sM¤TI�¿ŸÉÝì�»è¦Êj?5åŠrª’có'?Î]ùáGév_˜bøÞ»÷7†C­aà¡IÐLÉ€²*Ê$Õ~}\®<@µµ°§íSÜܧÛA'¤Q$ Vés·É¿»2®»@»¶aWˆjU<Í/Œ‰àœÕ�I–28œxþ¼ÂS~׳‡Tr*-DTœþm¹�s›v¹ ^aÖÔsî{-
+N-7m‹þìº``)ð¬FsÿþéòÒ=ô`JA™°G×jº0"ŽÌ§€Ð’“”KŒ§0wër·ú;ájCò>álØó—›Ô<<߆;Ë0ì6¹ŸùÝÿCºâ½¢@ëXfVžA?xµixƒÁƒî0Yÿ=ár¾Ü.×®DCó]+úÒBƒëÏeg_ê˜×…ð	¤ˆÆ]dL�ÃÀÙ¢ŠÆQå¤i夡yÑÜà:ÞÙ®&…£í¶"0í
¼0\~s§Î�W×å&Žõ¢;&‚B¦ã?7œV&‡ºß%χ3ÓÓ`FŒf©D)½´+ÕÅI!Q=Î�?Îd?ùM›ºððRNr:Ø«.ÁõĤž„8UV¢Öó[ÁƒSp‰Se-Õ"ÖH—`n4t¼ŸÞ‘Ö{ém™?Ð[$Xá÷ëûZÔ7�½êÞÝHûpo;”yÓh�QW—v¡ªÎ²U«jRSɲp”Ÿ\¹ßí*uìWZTpl1–ߌ2ë}
+ñÜ£Ž>úƒ^®ž÷[çî»p—µ'íöyîv»PÚ[M]M,ìR¶š:ý¢©û­(A�kꪥ›:õÖM]Ï*(y±ÂÚ�gš!8Ñ
�NïW±öáQ¸§:a·›õ¹~è•ý>ºÿØóóì¬ÜB†Q å餙†´RH†£¾F$°‘ÕJ\耘¬Þ¦FÚm«$0ª¸h~ëHijŒð¿KŸ°8ši!0c nrTiq
Ý\žNËAªhºªÈåhUäòÿöª{U<!Š\¾µ(ŠÑ¢h3¤\OJˆIA3Œ1×PDÿ釙×	â8«½zØ4û“äp°÷â�ñiõp8DŒÝ~¡ùhW¬C-øï:JR…¢#Õ:ŠÆ­+ÜvY¶_ËêωU¿þ#ªZñ2[þÑ�Ü
+endstream
+endobj
+5679 0 obj
+<<
+/Type /Page
+/Contents 5680 0 R
+/Resources 5678 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 5558 0 R
+/Annots [ 5668 0 R 5676 0 R 5677 0 R ]
+>>
+endobj
+5668 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 716.132 162.03 723.344]
+/A << /S /GoTo /D (class_socket) >>
+>>
+endobj
+5676 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 408.59 162.03 415.803]
+/A << /S /GoTo /D (class_socket) >>
+>>
+endobj
+5677 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 153.745 162.03 160.957]
+/A << /S /GoTo /D (class_socket) >>
+>>
+endobj
+5681 0 obj
+<<
+/D [5679 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+1994 0 obj
+<<
+/D [5679 0 R /XYZ 70.866 771.024 null]
+>>
+endobj
+5682 0 obj
+<<
+/D [5679 0 R /XYZ 70.866 654.678 null]
+>>
+endobj
+5661 0 obj
+<<
+/D [5679 0 R /XYZ 70.866 505.535 null]
+>>
+endobj
+1998 0 obj
+<<
+/D [5679 0 R /XYZ 70.866 478.34 null]
+>>
+endobj
+5683 0 obj
+<<
+/D [5679 0 R /XYZ 70.866 370.939 null]
+>>
+endobj
+5662 0 obj
+<<
+/D [5679 0 R /XYZ 70.866 250.69 null]
+>>
+endobj
+2002 0 obj
+<<
+/D [5679 0 R /XYZ 70.866 223.494 null]
+>>
+endobj
+5684 0 obj
+<<
+/D [5679 0 R /XYZ 70.866 116.094 null]
+>>
+endobj
+5678 0 obj
+<<
+/Font << /F50 2307 0 R /F72 2883 0 R /F79 3175 0 R /F96 4060 0 R /F43 2258 0 R /F67 2878 0 R /F70 2881 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+5692 0 obj
+<<
+/Length 1115      
+/Filter /FlateDecode
+>>
+stream
+xÚÍX[�â6~çWXêK�&Æ÷Ëë´»Sm+m»ð6»1ÁÌ B2
¡Ûý÷=Ž `¹¬Ô‡ÁŽÇ>·ïœÏ'!èôлõï%A[¥8M‘&Ø(…´eXQ4š ÇDa¦ú)Ó&©æ˧e‘õIþrÕ¿ö¿Œ> Á
–Æ€Àz;åÒ/÷Þ�z÷(¬D×b�Á†	”-z�_šÀÿ> ‚¹5èk½s�„äX
+ó9öþì‘hêzÄLú©¢Jw8 VZ“>¹jUæËÚ¬]yƒ÷ lsœ1Ï)5˜N�ƒóL¤Ï³*Ìgyå^\éîÄ/�´ÀFˆu%fØôSJI^ü˜¸êþ[å>Ià�Iš!�­&ÔK"(å­•ýTùãádxðç£[>ÌåKŒ÷§‡R-ÁŠm#eXd€\+ Ön©å¼>ÁüL¶YµµÉbBU³'›Ï\^uxP‹Q�›­€§”k‘JDŒ…­¥ËÜìŸ>“‰ñŽ,gùË<.=û,¬ãàŸ¦e±ho�iê‡[™³“6mÆ1å<XðGŸ‰d\Ž®˜)MÚÉÓ•ÛRSH\{,·©ñµ$Ö¹}c%‘”s~´Æ`7¯"ê"Ò-И	†$¤�e»(·½§D`.Ô¥j[¹@)Á’ñ–ÞêÕu"Z¯eEž»¬šy$¨"ŽÍ¡! —r’„d*÷ÍgRaËéæïƒ"èq§à|g£$~C^\âYdhwÈðcV�'ßÁ†bŸ
ë£ÿ7:¼;`ÆŽ[©€YÚ¶ª¨:b3XY~ŽQ÷w1M�y5±Q¹ÚDv_µ˜²õïþ}ƒªs“™J„Û“œ\«€`Ž“~,êŽÛÑ<n£Ó<³ÐXy¬B�T“üp•_'#Ð<3>ŸoÁòÌHLøÒ<d€ä—ªm³<€¦;z4Ík†k•gZ¿H`ú:ô¯ÁWÜQ'±ÀէБF˜HG€¿Le7òÛ:× «êmUm×üA϶e÷þµ@^%#")–ú”+SIO")a´1ª®å°EÓ@½L{7¨Ûê× æ}¸ÞW‹g_ 5°Óv×°�ÇÍm`?ÛÚ}È@×WÂ~¾Œ3{4=5Ñ7iÒRã©sê=žÍW¥ëS™Ü…UÒÞ´\e™[.×…~�R¹ÝÒ	›¶>Ôí\ç‚Î6¨e¸ïî$V$^Å
žŸÙj
÷Óxs4	U½Îb.A?Äæµwx·‰b*Vsuú¶%hÛIÝ©ì/›ØUÈÚzïDœú¦ò±n;ƒÐ~]ìJWoaç±1-Ýx2øZΚ÷öeÝx¶AÝWm;-¢dc_Ô†\¶YÙØ÷ÓlšOÜ4¨ý>|~üù·w£áÓ¯�YÕùvw5¼&�ñá¦ù¶Ù¡áue“Ý�V
Ò.wåØý+„ù/EÍ	ßâB¾Û™ýGŸ0%
+endstream
+endobj
+5691 0 obj
+<<
+/Type /Page
+/Contents 5692 0 R
+/Resources 5690 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 5697 0 R
+/Annots [ 5685 0 R 5686 0 R 5687 0 R 5688 0 R ]
+>>
+endobj
+5685 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 626.857 162.03 634.07]
+/A << /S /GoTo /D (class_socket) >>
+>>
+endobj
+5686 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 372.012 162.03 379.225]
+/A << /S /GoTo /D (class_socket) >>
+>>
+endobj
+5687 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 360.057 157.248 367.27]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5688 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [69.87 102.031 212.775 110.802]
+/A << /S /GoTo /D (tls__sockets_8h) >>
+>>
+endobj
+5693 0 obj
+<<
+/D [5691 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+5663 0 obj
+<<
+/D [5691 0 R /XYZ 70.866 723.803 null]
+>>
+endobj
+2006 0 obj
+<<
+/D [5691 0 R /XYZ 70.866 696.607 null]
+>>
+endobj
+5694 0 obj
+<<
+/D [5691 0 R /XYZ 70.866 589.207 null]
+>>
+endobj
+5664 0 obj
+<<
+/D [5691 0 R /XYZ 70.866 468.957 null]
+>>
+endobj
+2010 0 obj
+<<
+/D [5691 0 R /XYZ 70.866 441.762 null]
+>>
+endobj
+5695 0 obj
+<<
+/D [5691 0 R /XYZ 70.866 312.343 null]
+>>
+endobj
+5696 0 obj
+<<
+/D [5691 0 R /XYZ 70.866 174.738 null]
+>>
+endobj
+2014 0 obj
+<<
+/D [5691 0 R /XYZ 70.866 168.288 null]
+>>
+endobj
+5690 0 obj
+<<
+/Font << /F50 2307 0 R /F67 2878 0 R /F43 2258 0 R /F72 2883 0 R /F79 3175 0 R /F96 4060 0 R /F70 2881 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+5711 0 obj
+<<
+/Length 1630      
+/Filter /FlateDecode
+>>
+stream
+xÚÍZí�›6ÿž¿‚mÒ”LÎlÌ][鶾캭ݚTšt«"œ;´2 moSÿ÷Ù†Hl^­úábðó{üüž7ûÚ�´£ç£óçhDw06µùR³�N0ÖlÇÐ1Ôæ¾v3†&ž¼›¿ÔLvÏ´0›(†Ÿ+:™6?�¼íš†©›QÈ=›�þAö$Ðà^$!:1,Í[�nÞ
Íg÷^jL¢C´âɵf!SG–É®WÚlôǔմ

ëŽm’²šê`§'B
tÄ%ö

¤ÅLJuäÍ‹‘v3ÅŒ¿óé2ÙBø�ù¯³ÅìõO¿<›Ï?g’r
ØÇÔfè’!lr4lvV ½ÕÖÏ5x”¤qÞé÷Oà­~8ßæâ9?|–¸�ÓU²ˆ¼Ôõý¾È^¤JcT6X‰2Ü}%KFZÁØÕ›§o¯_½n€·?«Á>Ë`Xs‘ÎúÒUB„:=½3
Ö´Ñ7
ÐeIê7ãÀÞ±æQ3ŒÑæ!9O"ïoš6cõMn¼qÏY>k
eõ·Þ*¸Uá
n ž@l5|ElYÍ‹Âý±üÛfû.‰à~Û8Ýs
ý`Y/ÕÒ2ižºË°{Ö7åUÚ»lÎáò|..@ú1¥qXŸ+f ²¾Õ¡b~¦ÕÉ’Ò!Lhê­Ö>ñQ]ÎÍø/€vÙ´önŽ²‰âô¬“$1Í»wãª8È:CË&ÚꆑGùÂÊ–‰¥•†ƒÍ	ˆ
+ýÓh�0cÀK
5…Ö16s�å|“¯ˆï;š^ÿîú~L“¤?Ý‚,¬[fÉù9�	–i2_@ÍP÷Q’†îš–dÛ
ñ™r¤¢RK‘˜_v=?Ï’Ã,XoVyòËÊnví­Ü$9Ë®×Á:ð’ìú*ö·AÕ'dÖ(P¢\í_¾�‡Ì2­ë²2íÿ“Ûu<¨#�ÛðRŽ‚‡Cáñ­@±O@¹�¢•&HîrÁÌ�—òíršSÅ&Þ»)=Þ©ú(w™ª2¶OÉÍKæÑWç5˜ÝE'ã>H¦OD=�?ξ€œ lT¦q&+Ó{F1Ó¬Ì,4­ÌWpVHa¡ ,ùI~ɇq=ÑBbÂÏ4¼áŠB>ì.ùj•Ê_®ÐhìEa’ž®Ëqöf…Z·±¤”«tài•+ü±J¥¤AÓÅÆMï…׉”oHw�yrØÎùSx%éÿ¡:ç2Ü÷Bj’Æ[O)˜×tæ¦yå¡ñû‘ÃÙ»à&¤„Xü*/e)äîÂÿŽ‚4³<¿uõ|ñöÕõŸyÉãçZ‹Ùüͳ«ßò>9áQiT®3l£³M˜�˜¦Ûƒf*×{j("ïÔí]†ØÛSO¶áb鮃ÕCeÝùjÒ­ÉžAoó WÈõl"s]…@Åi–�àõâ‚ÅUH½tGp®YsŠhvP¡¶
YßÖܵñå¿·ÓYsaL‚i´”•²½”Ÿ›ÐÖ9lm{×SqIäÃNk*Õ˜ê„C@mÕ"ò$F‹öd{»:(ZÊòakÀž«ä̽÷6Ì; †m6Ÿ|Ëq6ØÖù°ušBV;MÆ?A§Ç¿”o[¡¦¦�tlÂE�[6ïW67x§pXV¦Åä¶}!!­ƒV�¿QŸ»7m¤ùþVÈá®°Ï;RM[…:†<Ök£qéËߌås€ÄÂÊÍC«³£ìØ'ç6¿¨¥)
`­XÀ£ÇMm…c|Æ7û”˜Z-XQ®W¢ÈήQùÔFqnu¼Âšlá ²ECb§þ�¯ö°D¡(VeÕæiå
+yögtë:ƒ“Iî»Ý­ÕÅ{�Ü\Òn0@ÿ´_À¥–]÷ø¶!ëw`qß”O³Nܦw9\Ëî\‡4�íwO
ÄB€ú´‡ÝÔkÑùK}Eàºî[>L¾oYŒw ÃùªÈ�¥95ÔG„òiÆ	=úû(ð¥ûšÎƒ5�¶é`ÿqJ£k¼çxœF—rwÛ¿53ÀAò‡8Hé {
`é�æmòív9ÌFcEÃ’ÉrG?..úûãŽÈ>qqù©"KöêB:0a—7¯v/†aÝ°±Å߸²�¥#d±o3‘bå/hHcW”4þØíÄã‡Ý;aŒ?>Üñò7¦á¡Žÿ¡ÃÏ‚
+endstream
+endobj
+5710 0 obj
+<<
+/Type /Page
+/Contents 5711 0 R
+/Resources 5709 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 5697 0 R
+/Annots [ 5689 0 R 5698 0 R 5699 0 R 5700 0 R 5701 0 R 5702 0 R 5703 0 R 5704 0 R 5705 0 R 5706 0 R 5707 0 R 5708 0 R ]
+>>
+endobj
+5689 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [136.819 735.237 189.023 742.607]
+/A << /S /GoTo /D (tls__octads_8h) >>
+>>
+endobj
+5698 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [136.819 711.327 180.654 718.696]
+/A << /S /GoTo /D (tls__wifi_8h) >>
+>>
+endobj
+5699 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [141.003 584.614 197.392 591.175]
+/A << /S /GoTo /D (tls__sockets_8h_a5013aef55fe502aeb151cb0afb1eb9c1) >>
+>>
+endobj
+5700 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [141.003 567.708 193.207 575.234]
+/A << /S /GoTo /D (tls__sockets_8h_a7541b8517df33c37c33a18e704e160cf) >>
+>>
+endobj
+5701 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [120.082 544.764 147.18 551.324]
+/A << /S /GoTo /D (class_socket) >>
+>>
+endobj
+5702 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [111.713 496.943 138.811 503.503]
+/A << /S /GoTo /D (class_socket) >>
+>>
+endobj
+5703 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [166.109 272.814 218.313 280.34]
+/A << /S /GoTo /D (tls__sockets_8h_a7541b8517df33c37c33a18e704e160cf) >>
+>>
+endobj
+5704 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [174.478 257.84 230.866 264.4]
+/A << /S /GoTo /D (tls__sockets_8h_a5013aef55fe502aeb151cb0afb1eb9c1) >>
+>>
+endobj
+5705 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [141.003 146.258 168.101 152.818]
+/A << /S /GoTo /D (class_socket) >>
+>>
+endobj
+5706 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.74 138.288 184.839 144.848]
+/A << /S /GoTo /D (class_socket) >>
+>>
+endobj
+5707 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [141.003 114.378 168.101 120.938]
+/A << /S /GoTo /D (class_socket) >>
+>>
+endobj
+5708 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.74 106.407 184.839 112.968]
+/A << /S /GoTo /D (class_socket) >>
+>>
+endobj
+5712 0 obj
+<<
+/D [5710 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+5709 0 obj
+<<
+/Font << /F50 2307 0 R /F72 2883 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+5747 0 obj
+<<
+/Length 1399      
+/Filter /FlateDecode
+>>
+stream
+xÚÍY]oÛ6}÷¯Z`�›á·¨ôiI—"]‡b�ß’"pdƪH™Dwí†î·ïR”bI–�8p–¼4MÞ{xÎåå%�½¹‡½wƒ£ÉààD`O¡PJæM®½#%¥„IâMfÞ¹/
†c(ß$Å¥‰£!Åþm
+´pÝ'q¢]듾ìë\§‘~ž¼÷8SH(ÞJ[„¶{ðëdðç€@/öÈ�O¥�¢Ü‹n矱7ƒßÞ{±Py•#o<.œA;ñÎps
õ$
+¦šë�áz!ÂK÷` !*àƒÀg>÷º]ŸÞ
¼ó1ÃûqjܬÊôKèÎõtv�ÞÉ¢-¦yÛÁqʼ1A”:¤?;îQÂ[õ^-¯G»9Û€<Ñ)'ÃòË?¹6Ë<u_s}µ«*²èËÈz„Á#l‡¿ùQ¢Ì‘ÄÊÀöŠYñf¿fñ¬`a²[¢�òð0J²B×Ѐp‰ìï*O6ä,¬²ÑóïØÕ]ÂüÇãPnÊ�7ÍŸ±VŒ‰š¢;ÂZ=Ÿîhy­“B·ñu�RÜ‹…ÊzñÖvµü²¹²®¿
qÐ4ÿ`5å1£DOsàjµWz$ð{É/çÿ%±NÍhóÜ,2ÓŽk
+›Jñ SñƦ:ýXJèB›b�0#]ò‚~NÕîú¥³øú
Ã^gL<ƒ€½{¥ÜŸ°��뤻Ͳ›Æ„KÄqB‘~¥ªîÇÄ�àp€È‡X?jÅAˆ(]
ú§/Mš:݃0prcE7P'6
+³Ÿ³©ÈETÝÔÉY¯�¤Ÿ\‰.ì�B̵9únt±g%¶�Òa½ 0†�ûSçÕ~×ßnudô¬){(‘”´+/íW]½,ÕOSCäÿ®ú¦M³¢©ÿ`‘âűGù3d¯{ù“ýÙ? //çìƒ>†\¼|*7é«©oóÄú«`õÂrö¾Êšm»—oÊÙ�(j¶e†£'KÐwåuKcÕŸ ÛC¡\¾SŠB¸iÚ>8�ÊQ1Ö|¤ ö·û+ÅÁ	g�70ÍdáLO>œ¹y1׸ͳH…û’ëbyskâ,­I*×ö܉ð‘sP/'TVN(G\9¯ã4J–3ínŒ¯`	ä’¡Å«šOBP(Ħ±—.ˆ.íݽšäèÂ(aíN0$YµñN–id!Ž[<‰´p^P*º!"„lDNÏÎ*)ƒ+ ž´¨éڱöo´õ­ppl®H
…mÖ�M³y9
+©ÇLN�m‡¾L‹xž2Ú‡÷*·c1·¸ÇˆÙ¼ôΨFyÀ"î:)ß'Ú®¶Ø×=,ív¼¶…C�´oM`s7½ÔÆï´ŽéHÇ_‡TøzÖÕ®ÏÉQ6Aÿ¬e¡o|a€,ØËÈ,s½-òÆNàдžn�½çê~´A€8�M;þŽ³ŽJ†ýo�E3$þÃ%¥Áõñ‰$Å )¦mIíjãiÿmÓ�~ÙÊ@®>a8d§|±ƒ.
"e	eu©r7Ô1À¸ðoâtjžM—«,KvIW—…‰“ärže³uA‚ûÙ!ó…HØ’äiä‚H'ó/tέz15÷jµ6À‰kZbFÕĴʈiVgÉ¥g×ã™Õ{U´Oç1‘}QçÉ@®*Dªšæ­6S¨_*Ûou屫9úËaÍöZ¾4*o�hîŠGK3\”Ö|×è/CÊý¥Ydù�ZÀ!„¹Tã•@¿ÇˆÃveÆôòWM]ã�VüÕõNÅ_-o `šÖÞ!êû_J¸7áþ–ªÿV³$oüÅ’²Â÷N§:‡ ¨4½²ëü^ã+³ß÷¹Eïë5ˆÿ
ÐbÎ
+endstream
+endobj
+5746 0 obj
+<<
+/Type /Page
+/Contents 5747 0 R
+/Resources 5745 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 5697 0 R
+/Annots [ 5713 0 R 5714 0 R 5715 0 R 5716 0 R 5717 0 R 5718 0 R 5719 0 R 5720 0 R 5721 0 R 5722 0 R 5723 0 R 5724 0 R 5725 0 R 5726 0 R 5727 0 R 5728 0 R 5729 0 R 5730 0 R 5731 0 R 5732 0 R 5733 0 R 5734 0 R 5735 0 R 5736 0 R 5737 0 R 5738 0 R 5739 0 R 5740 0 R 5741 0 R ]
+>>
+endobj
+5713 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [111.713 736.046 142.996 742.607]
+/A << /S /GoTo /D (class_socket) >>
+>>
+endobj
+5714 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [182.846 704.166 209.944 710.726]
+/A << /S /GoTo /D (class_socket) >>
+>>
+endobj
+5715 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [245.611 704.166 268.525 710.726]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5716 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 672.285 184.839 678.846]
+/A << /S /GoTo /D (tls__sockets_8h_a1a1abbec5212c04c6e6bc6b148a1c52b) >>
+>>
+endobj
+5717 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [187.03 672.285 214.129 678.846]
+/A << /S /GoTo /D (class_socket) >>
+>>
+endobj
+5718 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [249.795 672.285 272.709 678.846]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5719 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 656.345 176.47 662.906]
+/A << /S /GoTo /D (tls__sockets_8h_ad4cecfe2f93ed49bda489b41e1673b5f) >>
+>>
+endobj
+5720 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [178.662 656.345 205.76 662.906]
+/A << /S /GoTo /D (class_socket) >>
+>>
+endobj
+5721 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [141.003 639.439 176.47 646.393]
+/A << /S /GoTo /D (tls__sockets_8h_adb86bfbca7563c85fa80130b8e9ca3c1) >>
+>>
+endobj
+5722 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [178.662 640.405 205.76 646.965]
+/A << /S /GoTo /D (class_socket) >>
+>>
+endobj
+5723 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [141.003 623.499 176.47 631.025]
+/A << /S /GoTo /D (tls__sockets_8h_a9e377d7cf9f9307fa2335b3b6aaa92a4) >>
+>>
+endobj
+5724 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [178.662 624.465 205.76 631.025]
+/A << /S /GoTo /D (class_socket) >>
+>>
+endobj
+5725 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [141.003 607.559 176.47 615.085]
+/A << /S /GoTo /D (tls__sockets_8h_ac0c18423ccde1870aebe4a0746a2de5b) >>
+>>
+endobj
+5726 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [178.662 608.525 205.76 615.085]
+/A << /S /GoTo /D (class_socket) >>
+>>
+endobj
+5727 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [141.003 591.618 172.286 598.573]
+/A << /S /GoTo /D (tls__sockets_8h_aa6e4a0ba6948d599480de3449b0166ad) >>
+>>
+endobj
+5728 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [174.478 592.584 201.576 599.145]
+/A << /S /GoTo /D (class_socket) >>
+>>
+endobj
+5729 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [141.003 575.678 176.47 583.204]
+/A << /S /GoTo /D (tls__sockets_8h_acc32c3ae0be546ae354fdfddba021640) >>
+>>
+endobj
+5730 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [178.662 576.644 205.76 583.204]
+/A << /S /GoTo /D (class_socket) >>
+>>
+endobj
+5731 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [241.426 576.644 264.34 583.204]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5732 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.737 362.281 154.709 372.549]
+/A << /S /GoTo /D (tls__tickets_8h_a4cc21b3e154a0337557dc9baa1cdde5a) >>
+>>
+endobj
+5733 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [158.194 364.065 182.118 372.549]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5734 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [213.01 362.173 251.387 372.549]
+/A << /S /GoTo /D (tls1__3_8h_a42d4f54d23f86205a1fa590480181e0f) >>
+>>
+endobj
+5735 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [274.67 364.065 297.231 372.549]
+/A << /S /GoTo /D (structticket) >>
+>>
+endobj
+5736 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.489 336.168 181.123 344.939]
+/A << /S /GoTo /D (tls__tickets_8h_a3a234d8d5c97ca669c759362ce10da54) >>
+>>
+endobj
+5737 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [184.609 336.249 207.17 344.733]
+/A << /S /GoTo /D (structticket) >>
+>>
+endobj
+5738 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.489 308.352 184.62 317.123]
+/A << /S /GoTo /D (tls__tickets_8h_a026e3569450bc98105cb58239c05e771) >>
+>>
+endobj
+5739 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [188.106 308.432 210.667 316.916]
+/A << /S /GoTo /D (structticket) >>
+>>
+endobj
+5740 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [114.215 278.724 179.635 289.1]
+/A << /S /GoTo /D (tls__tickets_8h_abb28b61694dab27674754d8c974975c2) >>
+>>
+endobj
+5741 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [183.12 280.616 205.681 289.1]
+/A << /S /GoTo /D (structticket) >>
+>>
+endobj
+5748 0 obj
+<<
+/D [5746 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+3041 0 obj
+<<
+/D [5746 0 R /XYZ 70.866 561.585 null]
+>>
+endobj
+2018 0 obj
+<<
+/D [5746 0 R /XYZ 70.866 545.21 null]
+>>
+endobj
+5749 0 obj
+<<
+/D [5746 0 R /XYZ 70.866 403.592 null]
+>>
+endobj
+2022 0 obj
+<<
+/D [5746 0 R /XYZ 70.866 249.812 null]
+>>
+endobj
+2026 0 obj
+<<
+/D [5746 0 R /XYZ 70.866 128.669 null]
+>>
+endobj
+5750 0 obj
+<<
+/D [5746 0 R /XYZ 70.866 82.821 null]
+>>
+endobj
+5745 0 obj
+<<
+/Font << /F50 2307 0 R /F72 2883 0 R /F43 2258 0 R /F26 2949 0 R /F70 2881 0 R /F67 2878 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+5759 0 obj
+<<
+/Length 1040      
+/Filter /FlateDecode
+>>
+stream
+xÚÝXM“Û6½ûWð(ÍÄÁOñš´»ÓôÒ¦¾%9hm®£éZJe9Ýô×)Ûògdmg2=ØòÐäˆ<‚bdI¹Ÿ¼™M^ß)F2jµdöH£™ÖÄXN5�Ù‚|H@dé§Ù;"ð?!5.l‡ïŠ'—N¹É’ŸªùfåÊ&oŠªôS'?Ï&Mg2[È,£—d¾š|øÄÈÿ{GÑfäïvæŠH%¨’?‘?&¿OØU75PÖù©)7”SH§ÀK¾äu
+*Y»Y1O9KþtÍG¦~ÀûøúÎpb¨5< #S
4S2`e“Nu@ipuðíÃæêeÜåûû	Ao¤Qd
+@­Ò
©š7ù".»AËvÏ2Ϩ¶¢‹êGÆDpÏê½I–2ØF~öËÛ__�ñá`[Sa¨a6º¤ÂúM¹.–¥à^õJA™°�Ň¢n>¯É¸´g²	¼!ÚØ
	Ã	-UZî@:ª1§v¹ƒŽaš	2å2LmiÙœ‡Gíæ®øšr•¸Eibù/Ÿ
~,°ÛþÄ”©z§æ¯›ÓS%›y³©]ˆåʇÄ?|T´ÙóÓ’c8yL¦ßR.“¼ÎW®q˜Ý�¬{!=Uv3€ñKURaüì¶ê^¨"š£ž˜K8YRPÚ’7½’Çâ–‘®ã»J8`‚fRÞh´—+·}«Íg×QþeÓ\KŽ#÷8hªQG»wL"H3ŽÛ1‘[–Q�zy#‚Z©®’‹Ó˜Ìöêû³·™<Mí¾Í-µÕ¦¹Èí‰B>Mò`O�)Bà#i…xVVRüêV¼D_áYÙŒJ›m—t*Æþ<á7Ú>IxÏø–ð=/"é«.ãH7õ Îr?Üé#Þ<„�qò}Fw ôϦ6¤½ã©³ 5•,Fô½ÃŠ(ûÓîÌï1âµÏaÈ°c£ð�_8m]]WuªXò*2S‡'‹rüx~i±ÏeU-BOÐë'§Ñ#ÛtÛï'yì'‹²hv­äÛªlœï/Ÿt•_«bºÈÖ
=m.ø¶
+º>ºhŠü©øLJÊý'í ¢ÀÍí‘PŠ‚‹5Hƒ<_`ã0‚¸
+‰7-¯h§ÙÕI`-gÏP
³æFƒ=Æ­¢ÌȾÁs"ù]‡&`ùq48Ø·cJ$V	†u­Ã1Î^T¹Â!Å{Â"¢°¸rq«®¨C]	Xÿ_Y‰þ9/ü*YeÞüˆªšQÍô¨ô‡T¤¡ÊšP¼…PÈÄ5U¹Íà)Ué|UìÛ1%ÒßÍ8Z‡ct™vÜÙa¨y£Ö	”— ,=ÿ¢GIª°AA×:¾f¸w¥«±²b+öà£ý­{×—
+–<[zñB¹9,…
¸õ‡Ó
+endstream
+endobj
+5758 0 obj
+<<
+/Type /Page
+/Contents 5759 0 R
+/Resources 5757 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 5697 0 R
+/Annots [ 5742 0 R 5743 0 R 5744 0 R 5754 0 R 5755 0 R ]
+>>
+endobj
+5742 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 716.132 157.248 723.344]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5743 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 703.073 171.594 711.389]
+/A << /S /GoTo /D (tls1__3_8h_a42d4f54d23f86205a1fa590480181e0f) >>
+>>
+endobj
+5744 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 692.221 162.03 699.434]
+/A << /S /GoTo /D (structticket) >>
+>>
+endobj
+5754 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 408.59 162.03 415.803]
+/A << /S /GoTo /D (structticket) >>
+>>
+endobj
+5755 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 214.022 162.03 221.235]
+/A << /S /GoTo /D (structticket) >>
+>>
+endobj
+5760 0 obj
+<<
+/D [5758 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+2030 0 obj
+<<
+/D [5758 0 R /XYZ 70.866 771.024 null]
+>>
+endobj
+5761 0 obj
+<<
+/D [5758 0 R /XYZ 70.866 654.678 null]
+>>
+endobj
+5751 0 obj
+<<
+/D [5758 0 R /XYZ 70.866 505.535 null]
+>>
+endobj
+2034 0 obj
+<<
+/D [5758 0 R /XYZ 70.866 478.34 null]
+>>
+endobj
+5762 0 obj
+<<
+/D [5758 0 R /XYZ 70.866 372.831 null]
+>>
+endobj
+5752 0 obj
+<<
+/D [5758 0 R /XYZ 70.866 310.968 null]
+>>
+endobj
+2038 0 obj
+<<
+/D [5758 0 R /XYZ 70.866 283.772 null]
+>>
+endobj
+5763 0 obj
+<<
+/D [5758 0 R /XYZ 70.866 178.264 null]
+>>
+endobj
+5753 0 obj
+<<
+/D [5758 0 R /XYZ 70.866 116.4 null]
+>>
+endobj
+5757 0 obj
+<<
+/Font << /F50 2307 0 R /F72 2883 0 R /F79 3175 0 R /F96 4060 0 R /F43 2258 0 R /F67 2878 0 R /F70 2881 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+5783 0 obj
+<<
+/Length 1234      
+/Filter /FlateDecode
+>>
+stream
+xÚÍXMoÛF½ëW,Ò‹TDëý&‰žZ'v›¶@jéæ‚L®$¢é’«¤ù÷�ý IJ”c¥6�ƒ-jµœyóföq†­A×£_棋+IPŒ¥8š¯PDp¬Š†EóÝŽfñdÊ¢xl¶õÂäé„‘ñßÚÔx3ù8‡�±Œc0è¶SžØåÑÛù蟅U‚èƒÙ8Æ1(Ý�n?”ÁoïÁ<‰Ñg·s‡„äX
+×[4ý5"_…ª(&¬fXL¦”2nÁ.j“o·‹uYfˆ$ðG-Ê‹«ˆ¡'¡Ö$ASNq,…·vW–ÛÉTyC}#~ÙšrÁú(«u÷æz„–ˆ$šRŠ©¼Ao&ÜáãI
çî®ÀåB¸‡™¨Î¦ªš=ó�8,•h�4±­-}˜æhÊäÄo½ÜhOXÈ÷fiüÕ2,>í?~Êkÿé¸ñ—– ×áÆ"óEö—{3-WÓliô„Ê1öl`&-!öÃr¢¢RÈ
+ã˜rîA¾Ÿ01^VË�6ºšP:®{„Õ�RðÉøcuG	‡Šu÷Ì6l�J¤D„cúhýÃn{‚WõQ¯ê¡¾CJByÚ)�~àö %Ñ7:ìÕI"1‰Dß¡ÙèÓQ›
+ŽŸïS³¯ô14	Pz>¶ã”€EåÿKëù6šJë­c®W·ÁƒLÌq78)úÛ*A�w2§“Ƙˆ G
±�ü|uö©ô: ¯	…°­O@£=Í÷:$ú‚wßJ©ÄŠå».Ö泩 ¬L÷;]˜¥ÉË"(Dצ‰t�m»rÑŠ'�=ŸV½GÀNœî/GAs¤Coƒ—V·o�²_\x…_•©®kÿåF×ûݽj¿Ï�œ÷³yì-‘´ 0À'˜B5XÚ•ÒùªÈô*¸þc¶˜ÿvùûÛùlñë úàŠ’³]�Ÿ¼ÐOuÕz&œ²óc-Òí>^�zÆÞÚê¤Þå“<˜;I´‹t›C¹/*�~z^Øb�{Æ8®Æ= wÙâ×ÿ“´è‹’÷ÎdT©½?/Ì�¢Çî6Þ/«ZÏ�› ߥ�ÓÄ•©Yfý[¨PXH
+
+‰Åþ£oH1�ê,Ûê}}Úø¾¨óuÁÙ
$‡ø.¯Ìæ‘{::D­¸Fê2ÙCf›³ŸÜoS¦"AŸw�?>œÖøåÓú©Ì³§å5/rãÓzYüž—ÝA£'LžK"dÃCì@
Y2H"߉ºÈž�C‰#ŽÈð	`°!¾O•dPЗgÐMaObðxJ{Þ2®ÂÇ‹°¥Š
3xþÓ
+Z¿~ÔoéÈQ7—tº¹Ï¹í§àáãz««|Z±h.(ä«ÒEª&ƃ–.ÓÖL¡OêŒÎÊ^sz ±ó‚ï
+õ½�²X‡Ž0t†÷¾++ÿ5µeÂÉØ×
BºSÍØØŽ¶Ïè¦oxÕvÄG2iî”C‹ÖÒ‡i ð�6K`,Lµot�V¹o	‡	ë¼Nøî;1É�ßœaªbÅÏvüÞ›
Øü¶)æÏÜÇæ!ÍÒÒ˜¯ð†P˜¡ÎxoÔ¼/²o„”èŒcJX5S‰.tµ4M6ï,®/!³¥ãéËÚæ´ùâëfn2
+endstream
+endobj
+5782 0 obj
+<<
+/Type /Page
+/Contents 5783 0 R
+/Resources 5781 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 5697 0 R
+/Annots [ 5756 0 R 5764 0 R 5765 0 R 5766 0 R 5767 0 R 5768 0 R 5769 0 R 5770 0 R 5771 0 R 5772 0 R 5773 0 R 5774 0 R 5775 0 R 5776 0 R 5777 0 R 5778 0 R ]
+>>
+endobj
+5756 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 716.132 162.03 723.344]
+/A << /S /GoTo /D (structticket) >>
+>>
+endobj
+5764 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [69.87 497.269 212.775 506.04]
+/A << /S /GoTo /D (tls__tickets_8h) >>
+>>
+endobj
+5765 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [136.819 440.745 172.286 448.114]
+/A << /S /GoTo /D (tls1__3_8h) >>
+>>
+endobj
+5766 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [136.819 432.775 209.944 440.144]
+/A << /S /GoTo /D (tls__client__recv_8h) >>
+>>
+endobj
+5767 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [141.003 416.678 189.023 424.204]
+/A << /S /GoTo /D (tls__tickets_8h_a4cc21b3e154a0337557dc9baa1cdde5a) >>
+>>
+endobj
+5768 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.215 417.643 214.129 424.204]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5769 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [241.426 416.678 276.893 424.204]
+/A << /S /GoTo /D (tls1__3_8h_a42d4f54d23f86205a1fa590480181e0f) >>
+>>
+endobj
+5770 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [304.191 417.643 331.289 424.204]
+/A << /S /GoTo /D (structticket) >>
+>>
+endobj
+5771 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 401.703 218.313 408.264]
+/A << /S /GoTo /D (tls__tickets_8h_a3a234d8d5c97ca669c759362ce10da54) >>
+>>
+endobj
+5772 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [220.505 401.703 247.603 408.264]
+/A << /S /GoTo /D (structticket) >>
+>>
+endobj
+5773 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 385.763 214.129 392.323]
+/A << /S /GoTo /D (tls__tickets_8h_a026e3569450bc98105cb58239c05e771) >>
+>>
+endobj
+5774 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [216.321 385.763 243.419 392.323]
+/A << /S /GoTo /D (structticket) >>
+>>
+endobj
+5775 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 368.857 218.313 376.383]
+/A << /S /GoTo /D (tls__tickets_8h_abb28b61694dab27674754d8c974975c2) >>
+>>
+endobj
+5776 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [220.505 369.823 247.603 376.383]
+/A << /S /GoTo /D (structticket) >>
+>>
+endobj
+5777 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [96.786 270.99 125.83 279.761]
+/A << /S /GoTo /D (class_socket) >>
+>>
+endobj
+5778 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [96.786 160.307 125.83 169.078]
+/A << /S /GoTo /D (class_socket) >>
+>>
+endobj
+5784 0 obj
+<<
+/D [5782 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+2042 0 obj
+<<
+/D [5782 0 R /XYZ 70.866 771.024 null]
+>>
+endobj
+5785 0 obj
+<<
+/D [5782 0 R /XYZ 70.866 678.481 null]
+>>
+endobj
+5786 0 obj
+<<
+/D [5782 0 R /XYZ 70.866 569.308 null]
+>>
+endobj
+2046 0 obj
+<<
+/D [5782 0 R /XYZ 70.866 562.858 null]
+>>
+endobj
+3042 0 obj
+<<
+/D [5782 0 R /XYZ 70.866 354.764 null]
+>>
+endobj
+2050 0 obj
+<<
+/D [5782 0 R /XYZ 70.866 338.351 null]
+>>
+endobj
+2054 0 obj
+<<
+/D [5782 0 R /XYZ 70.866 220.154 null]
+>>
+endobj
+5787 0 obj
+<<
+/D [5782 0 R /XYZ 70.866 101.128 null]
+>>
+endobj
+5781 0 obj
+<<
+/Font << /F50 2307 0 R /F72 2883 0 R /F79 3175 0 R /F96 4060 0 R /F43 2258 0 R /F67 2878 0 R /F70 2881 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+5808 0 obj
+<<
+/Length 1072      
+/Filter /FlateDecode
+>>
+stream
+xÚÍX]“¢8}÷W¤v^ðÁt>H€š­­rüh�šu±kv«gÊ¢[ªmèEÜ™þ÷›?PtÑÞ}‘áœssÏ%\xÜÖ>Œk7]†€	-Î)Ï€� É90,9cÜkXGõïã�€Šÿ¨ÎÅ�Ét×_xõ1L­NWÏ^;±òÒZg\û«†Å•à5¤iB“è`ú\»ÿŽ€+þû¢e‚É•Ï@g2�Šñص/5´#haÌ6urQ&”CŠê
ŒÒâÅròÃÿ†�óD‘’=¦šF·Q0å�#Р"ÆÖm¨b‹³ã<
ÖÝ
+6™
+gÙ5þR�$±XÌ4˜²«@nº
Z5SNCœ(F!ád¡÷¦
Y¢^‘Eà¾ÁEÀ77õäh{±¬^Ôñ«ßõÕÈþö£0�âÕÄ,ŒÔ ¹+?ÕÉCèDîrKö¾"³X¨•…"D1ak½ùL.û�?\o¦˜ÇŸìÉ×~·?é²ã5Fgó?ðNâÉiŠÓ�ÉùQÓÅÊMé9`H�.l‹'4³ìIk¸CAÐâ ô‘ª­L5Gí»þàs	;+fçUØ»}»'˜'Ãþ¨9è5KœQ<]9_×ÁÐ�œ`îlE	‘YÉ”ÃæhÜoÝ}jŽ&>‹µ-+
«š	Mc…óߎ‡EPE"{Ø/'ÁYM$¹QU‘sØøõœغßÌ[káËgÛ¡êRÏÇpúäÅ; ÚûB—R)£ù“7óÕñ5 •ØÒ¢(áЋegS{�ëÏJÈx1™Q¥ö;ö�’’Ú æé%¯ðN­qb]¿Æ×d´jåI––­Vz’ãÒu§¼?M¯áRZ\”Uz•93ÓütÃ:Á«„â•4*sn^Ô¸€›ýA³ÜQæÿÏQVá´Ž®á(_µ¸(ôKÅns%Ht]Ü›÷Ux£¯úÉ�%^Q“F'oG"›X4‘L=‰~¼¿úC€¨g«`š÷R=Ïq¥­×àY¥4"h0‹gx$¢¡LðÚN쨻ì8ZMãUä-wbÜ’ƒ94L4�„[
+ãÉ6ÂÜ‘ŒqmAB‡€=lIIýò$}½±{ l·—9œ
IoQÐÀ:亩dWu‚´…?U
=É3Oþ¼¦}¦$9´.rU�™.Uˆ¿;ÓHÞž¼$Æñ»šlqïøzÈ$O:­Ö.„üïÙ]�gö¸ñÈnî¹:q§Õ.Š˜^�xø¥(`ýê¼½?‹âe×ç%Œÿ7)îQS/b¾~Ž{“7Ïò�Ý™úöøÀz£bn~1îa,ëx·©ñ[„} Ù½9#¸�|ÛE_\ƒâõþœ®Ù‡V.v®ËMAg:dLGÈyšÐ[/ð"'ö\µ=llMí°N‘öóõQ¾/h^°«ñêv
+endstream
+endobj
+5807 0 obj
+<<
+/Type /Page
+/Contents 5808 0 R
+/Resources 5806 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 5697 0 R
+/Annots [ 5779 0 R 5780 0 R 5788 0 R 5789 0 R 5790 0 R 5791 0 R 5792 0 R 5793 0 R 5794 0 R 5795 0 R 5796 0 R 5797 0 R 5798 0 R 5799 0 R 5800 0 R 5801 0 R 5802 0 R 5803 0 R ]
+>>
+endobj
+5779 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [69.87 726.826 212.775 735.597]
+/A << /S /GoTo /D (tls__wifi_8h) >>
+>>
+endobj
+5780 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [136.819 670.302 172.286 677.671]
+/A << /S /GoTo /D (tls1__3_8h) >>
+>>
+endobj
+5788 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [187.03 599.38 214.129 605.94]
+/A << /S /GoTo /D (class_socket) >>
+>>
+endobj
+5789 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [174.478 519.679 201.576 526.239]
+/A << /S /GoTo /D (class_socket) >>
+>>
+endobj
+5790 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [174.478 463.888 201.576 470.448]
+/A << /S /GoTo /D (class_socket) >>
+>>
+endobj
+5791 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.326 283.329 147.733 293.598]
+/A << /S /GoTo /D (structpktype) >>
+>>
+endobj
+5792 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 208 173.52 217.663]
+/A << /S /GoTo /D (tls__x509_8h_a2763d07a5f34925fb4a99817d4140573) >>
+>>
+endobj
+5793 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 195.345 173.027 205.008]
+/A << /S /GoTo /D (tls__x509_8h_ab394bd87c3a26068186a0152dbcbd202) >>
+>>
+endobj
+5794 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 182.69 173.52 192.353]
+/A << /S /GoTo /D (tls__x509_8h_adb2680da06573ec6cd27305f778a6609) >>
+>>
+endobj
+5795 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 170.035 167.548 179.698]
+/A << /S /GoTo /D (tls__x509_8h_ac4d3fa6ca7b0008cd109057f3620344b) >>
+>>
+endobj
+5796 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 157.38 167.046 166.837]
+/A << /S /GoTo /D (tls__x509_8h_a30e204cf860fbe7790d3ffa14e45878e) >>
+>>
+endobj
+5797 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 144.725 176.021 154.182]
+/A << /S /GoTo /D (tls__x509_8h_aaaea4c5d93fd7ec8cceb7f632cb9b5d6) >>
+>>
+endobj
+5798 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 132.07 176.021 141.526]
+/A << /S /GoTo /D (tls__x509_8h_a5ee39c05f4370aae62248dbf2b6ff542) >>
+>>
+endobj
+5799 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 119.414 176.021 128.871]
+/A << /S /GoTo /D (tls__x509_8h_af9600e0331e171fd6f06598cff2a9ee5) >>
+>>
+endobj
+5800 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 106.759 187.471 116.422]
+/A << /S /GoTo /D (tls__x509_8h_a5d088c99b89447f5acabcd147c303f09) >>
+>>
+endobj
+5801 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 94.104 183.49 103.767]
+/A << /S /GoTo /D (tls__x509_8h_a7a49b7fe3b98b5bdee0ea00cda616b3f) >>
+>>
+endobj
+5802 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 81.449 187.471 91.112]
+/A << /S /GoTo /D (tls__x509_8h_a7e4c63b8a91d9debc4337994b1fc2b95) >>
+>>
+endobj
+5803 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.678 68.794 187.471 78.457]
+/A << /S /GoTo /D (tls__x509_8h_a7e7e2672eddbe00a3ded84a2d65046d0) >>
+>>
+endobj
+5809 0 obj
+<<
+/D [5807 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+2058 0 obj
+<<
+/D [5807 0 R /XYZ 70.866 771.024 null]
+>>
+endobj
+3043 0 obj
+<<
+/D [5807 0 R /XYZ 70.866 424.919 null]
+>>
+endobj
+2062 0 obj
+<<
+/D [5807 0 R /XYZ 70.866 408.785 null]
+>>
+endobj
+5810 0 obj
+<<
+/D [5807 0 R /XYZ 70.866 322.43 null]
+>>
+endobj
+5811 0 obj
+<<
+/D [5807 0 R /XYZ 70.866 246.29 null]
+>>
+endobj
+5806 0 obj
+<<
+/Font << /F50 2307 0 R /F43 2258 0 R /F72 2883 0 R /F70 2881 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+5891 0 obj
+<<
+/Length 1322      
+/Filter /FlateDecode
+>>
+stream
+xÚÕZms£6þî_ÁG˜©uzú˜ËËu®M;½ä:�In<ä„ÆÁ.àöòï»ø��ÄŽá<ùbcŒ´»Ï®žÝ•ÀÞ­‡½Oƒ�—ƒg{!ÒR2ïrì)ŒB)=¥)’Ä»L¼+_"F‚!U¡_NŠÑw�5º«~Ÿ¥S]}1ã€`ßä&‹Mðíò³ÇYˆD‚7	áÄÞœ^þ¸‹=²†(¤Ü‹Wß°—ÀŸ=Œ˜½ÿÜ“	Îàzâ]þà†
#%´\·@„&œÍ³¸L§YátXþp3®L'©PyCJ‘â¼xM©Øã]
…�þ¿
þ4Mêÿ¬1ùmmÕ÷”EÅÄI�Šôv°LÓœ‰*å_c�Ÿ�ÅŸÆe”4”¦ÒÓ 4uÖF×b
ó5ÆÌ>Þ0�#’Å31ˆ$s®æV6°ÔÊŽÂ	\p¤0«†§Ùp6‰âÚñ§Ç'GÕ%Ø™Eå<¯ÿq&§ÙíK�[¬©¶sò2äiVn‹vbúB›.û@+ÄyÚÎä.Ðn…×â?»/gæõg­6
IŒLÀ°ÿ½Ì-1Dq9
+ˆ?˃!~ê–OTšÑ}@�5ìÇãSw…{»KjXÒ[x‹.½€z?½g¯ŠeÈHí"vv¿}”h‚(7£ätsM «»ëhŒ}´}´$\bfpì—vU÷B"ÂøN˹³	w[lJ!!,BŸ‰�%²)H§ñ2BV¬fvÛrwk8%™öË>\ï²<Ûe‘Ýø>D”“ý2ˆõ2Fš«n§ßÆA–ŒfóË“4~™›;(\"’¼�œ�εQ�I)p£æ;1o™·Á+CĉþQ™òÖ”£ðÝ–ØwÀ{¢Þ
ï­áÐæ&-PÈÔ!šæ2)!í³÷à²GQè5í4YÔ|•ÅÒDüD4¢BîMÔÐ1PÖQW•Ý$MÒâð±§)€waèV  Á¤{ŠùÍß&.{ió êy¸¿ïC¤¨î2ê3Ûb8ƒÍOzq:¤P!ö7èŠÉî�n2îiù8šåÓÙ¢Ší'I
+„ñ{h.lÒY«‹ªJþÕb‰s„9ÝEи�Ú¹‚µÒÁeT—ÿ£Äö'=x˜	$Ô[<Ü€ºm
pŒ¬£î€+Bf©ÅJ
[„ô'H†º'x$’ª‡z ®ÑL¸Ov|»Š…4£{'FN‘&¼¯YaÐq®ßÁÖÚ>ä¸SwÚJŽ�IWûÛë.Ž&®ýÈ¢‡~ˆ‘"JÉþ+íf|å-8 I¹ÌÖäÒÍ£×g»…Î4ܬüHh×ò4º±}ÛÄl$ví(Ÿû²3�kÝÒƒ�·u´»ÊÿýÀòO_‘ß»¿€¯–~`ù‡€£ðË×ÃÊÿxÜ`á.øÐñéÚûˆC‚1öOL¥“T$bŠ8Oge]t4ÈŒ¢0�
+«y¬Õ°q}<_ýúÙD‰mì–o<9ŠÀТÚKûe•†JrSŠBXÕ'øG
åþ¼¼›æÏŸl¨¼Ïmº!û×ôžÖ;{N¡‹xZº<ír„}À°ÛîÙĸü9¦Êeu7�í‘J±<©�DË_ãõ7šðã�Dæp§5îçQœ[µ¦à�àt…âÉ4ž?@·•Í
+°íÛëBÞÜá
ŒÅ›Ðç+É×^¼àIør*2™É¡;©Ãã¦Ú­õsUêã­5È7OTüŠÞÇ
+endstream
+endobj
+5890 0 obj
+<<
+/Type /Page
+/Contents 5891 0 R
+/Resources 5889 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 5895 0 R
+/Annots [ 5804 0 R 5805 0 R 5824 0 R 5825 0 R 5826 0 R 5827 0 R 5828 0 R 5829 0 R 5830 0 R 5831 0 R 5832 0 R 5833 0 R 5834 0 R 5835 0 R 5836 0 R 5837 0 R 5838 0 R 5839 0 R 5840 0 R 5841 0 R 5842 0 R 5843 0 R 5844 0 R 5845 0 R 5846 0 R 5847 0 R 5848 0 R 5849 0 R 5850 0 R 5851 0 R 5852 0 R 5853 0 R 5854 0 R 5855 0 R 5856 0 R 5857 0 R 5858 0 R 5859 0 R 5860 0 R 5861 0 R 5862 0 R 5863 0 R 5864 0 R 5865 0 R 5866 0 R 5867 0 R 5868 0 R 5869 0 R 5870 0 R 5871 0 R 5872 0 R 5873 0 R 5874 0 R 5875 0 R 5876 0 R 5877 0 R 5878 0 R 5879 0 R 5880 0 R 5881 0 R 5882 0 R 5883 0 R 5884 0 R 5885 0 R 5886 0 R 5887 0 R 5888 0 R ]
+>>
+endobj
+5804 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.489 735.325 190.242 745.701]
+/A << /S /GoTo /D (tls__x509_8h_af15f220eebf42393d74cd0338e4a6471) >>
+>>
+endobj
+5805 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [193.728 737.217 217.652 745.701]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5824 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.737 707.912 183.49 718.288]
+/A << /S /GoTo /D (tls__x509_8h_a29762ed96ca7d3ccf89be8c496cb9ebb) >>
+>>
+endobj
+5825 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [186.976 709.804 210.9 718.288]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5826 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [94.777 680.607 123.184 690.875]
+/A << /S /GoTo /D (structpktype) >>
+>>
+endobj
+5827 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [123.684 680.607 228.528 690.875]
+/A << /S /GoTo /D (tls__x509_8h_a032e98c7594a00ff27e6e71be783bf1d) >>
+>>
+endobj
+5828 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [232.013 682.391 255.937 690.875]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5829 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [270.752 682.391 294.676 690.875]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5830 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [94.777 653.194 123.184 663.462]
+/A << /S /GoTo /D (structpktype) >>
+>>
+endobj
+5831 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [123.684 653.086 214.881 663.462]
+/A << /S /GoTo /D (tls__x509_8h_a5e369d22599c01a332492a07d08a0f47) >>
+>>
+endobj
+5832 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [218.367 654.978 242.29 663.462]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5833 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [257.106 654.978 281.03 663.462]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5834 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.737 626.592 181.491 636.049]
+/A << /S /GoTo /D (tls__x509_8h_a782bd259401c3866aab10943cadab704) >>
+>>
+endobj
+5835 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [184.976 627.565 208.9 636.049]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5836 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [228.198 627.565 252.122 636.049]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5837 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.737 613.07 195.909 623.545]
+/A << /S /GoTo /D (tls__x509_8h_a66695c60281f55b5dc7c4ef8032cbdea) >>
+>>
+endobj
+5838 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [199.394 614.855 223.318 623.339]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5839 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [94.777 600.36 123.184 610.628]
+/A << /S /GoTo /D (structpktype) >>
+>>
+endobj
+5840 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [123.684 600.253 210.864 610.628]
+/A << /S /GoTo /D (tls__x509_8h_aa4f3b44079b42b4abe5e0699a9f3781a) >>
+>>
+endobj
+5841 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [214.35 602.144 238.274 610.628]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5842 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [253.089 602.144 277.013 610.628]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5843 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [94.777 587.65 123.184 597.918]
+/A << /S /GoTo /D (structpktype) >>
+>>
+endobj
+5844 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [123.684 587.65 224.95 597.918]
+/A << /S /GoTo /D (tls__x509_8h_ae95cc4b48cfce918f4410032436b0953) >>
+>>
+endobj
+5845 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [228.436 589.434 252.36 597.918]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5846 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [267.175 589.434 291.099 597.918]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5847 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.737 575.751 178.003 585.414]
+/A << /S /GoTo /D (tls__x509_8h_a4ea66d8861556e4cb5494fedcae31e09) >>
+>>
+endobj
+5848 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [181.489 576.724 205.413 585.208]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5849 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.737 562.229 181.267 572.704]
+/A << /S /GoTo /D (tls__x509_8h_a63098f816389dc75a1f6a65ee054a622) >>
+>>
+endobj
+5850 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [184.752 564.014 208.676 572.498]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5851 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.737 549.519 182.495 559.994]
+/A << /S /GoTo /D (tls__x509_8h_abf031319593095cab51fce85367b5c84) >>
+>>
+endobj
+5852 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [185.981 551.303 209.905 559.787]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5853 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.737 536.701 180.002 547.283]
+/A << /S /GoTo /D (tls__x509_8h_a18ffa7f3ffe42d28ef6e9264fae10f69) >>
+>>
+endobj
+5854 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [183.488 538.593 207.412 547.077]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5855 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.737 524.098 213.751 534.573]
+/A << /S /GoTo /D (tls__x509_8h_a30c58503b1c92df4b7164ae795b56d1b) >>
+>>
+endobj
+5856 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [217.237 525.883 241.16 534.367]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5857 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [255.976 525.883 279.9 534.367]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5858 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.737 512.2 194.321 521.863]
+/A << /S /GoTo /D (tls__x509_8h_a3a434044d9c3a7c32547906e7deea086) >>
+>>
+endobj
+5859 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [197.807 513.172 221.731 521.656]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5860 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.737 498.678 200.436 509.152]
+/A << /S /GoTo /D (tls__x509_8h_a3ae4aa6c7903bd00fc86312f4676d675) >>
+>>
+endobj
+5861 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [203.922 500.462 227.846 508.946]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5862 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.737 486.779 196.68 496.442]
+/A << /S /GoTo /D (tls__x509_8h_ae05d7020ae2dac500d00452e36bc4b8d) >>
+>>
+endobj
+5863 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [200.165 487.752 224.089 496.236]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5864 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.737 474.069 192.196 483.732]
+/A << /S /GoTo /D (tls__x509_8h_a08072852023e718409b709916f4478cd) >>
+>>
+endobj
+5865 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [195.682 475.042 219.606 483.526]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5866 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [234.421 475.042 258.345 483.526]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5867 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.737 461.358 190.968 471.022]
+/A << /S /GoTo /D (tls__x509_8h_a57a0487efa9bf85e480c13eb64e3a0d9) >>
+>>
+endobj
+5868 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [194.454 462.331 218.378 470.815]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5869 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [94.777 399.837 118.7 408.321]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5870 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.2 398.864 160.062 408.527]
+/A << /S /GoTo /D (tls__x509_8h_a26ebd69b7048f0ec457aed53cd2ab4b2) >>
+>>
+endobj
+5871 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [94.777 387.126 118.7 395.611]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5872 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.2 386.154 160.564 395.817]
+/A << /S /GoTo /D (tls__x509_8h_a99dcbac6d2b5bed887178a19ebe012fc) >>
+>>
+endobj
+5873 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [94.777 374.416 118.7 382.9]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5874 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.2 373.443 159.568 382.9]
+/A << /S /GoTo /D (tls__x509_8h_a4a71fcb7d2942084a57e335d27b98f3a) >>
+>>
+endobj
+5875 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [94.777 361.706 118.7 370.19]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5876 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.2 360.733 158.573 370.19]
+/A << /S /GoTo /D (tls__x509_8h_a319fe0afe56c81a5571f22690a68921d) >>
+>>
+endobj
+5877 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [94.777 348.996 118.7 357.48]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5878 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.2 348.023 160.062 357.48]
+/A << /S /GoTo /D (tls__x509_8h_a4cfd7b1ce0abf2a824f8264a8b889884) >>
+>>
+endobj
+5879 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [94.777 336.285 118.7 344.769]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5880 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.2 335.313 161.057 344.769]
+/A << /S /GoTo /D (tls__x509_8h_a27885f5e775115282ef665fcf7fc486a) >>
+>>
+endobj
+5881 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [94.777 323.575 118.7 332.059]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5882 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.2 322.602 159.568 332.265]
+/A << /S /GoTo /D (tls__x509_8h_a56c084dad2b13fc39219718e2c9ea08b) >>
+>>
+endobj
+5883 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [94.777 310.865 118.7 319.349]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5884 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.2 309.892 159.568 319.349]
+/A << /S /GoTo /D (tls__x509_8h_afac5896b24f8e6d2427daa60dddae297) >>
+>>
+endobj
+5885 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [94.777 298.155 118.7 306.639]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5886 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.2 297.182 159.568 306.639]
+/A << /S /GoTo /D (tls__x509_8h_a63727d4ec7bf088c3e114441725dd3c8) >>
+>>
+endobj
+5887 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [94.777 285.444 118.7 293.928]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5888 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.2 284.471 159.568 294.135]
+/A << /S /GoTo /D (tls__x509_8h_a8b27e013d3e6af063bb660fd41529a71) >>
+>>
+endobj
+5892 0 obj
+<<
+/D [5890 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+5893 0 obj
+<<
+/D [5890 0 R /XYZ 70.866 775.009 null]
+>>
+endobj
+5894 0 obj
+<<
+/D [5890 0 R /XYZ 70.866 437.628 null]
+>>
+endobj
+2066 0 obj
+<<
+/D [5890 0 R /XYZ 70.866 270.454 null]
+>>
+endobj
+2070 0 obj
+<<
+/D [5890 0 R /XYZ 70.866 125.278 null]
+>>
+endobj
+5812 0 obj
+<<
+/D [5890 0 R /XYZ 70.866 82.821 null]
+>>
+endobj
+5889 0 obj
+<<
+/Font << /F50 2307 0 R /F43 2258 0 R /F26 2949 0 R /F70 2881 0 R /F67 2878 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+5926 0 obj
+<<
+/Length 530       
+/Filter /FlateDecode
+>>
+stream
+xÚ­•Ën›@†÷<ÅHÝÀ“3W†eêK¬¬âÚ‹ViCl$i<në·ï\LbªÄ8(+æÀùß?g.€VÐUðu\L …)Z<¢°’Å	Å’ E†nCÂit·¸FÌ|c\¡{=)6y4 ±
+GõrWæ•NuQW65/‚_
1™€ÈKI¥°¢-ËàöPf¾]#S1Qè�Ë,ÎÌxƒæÁ,€NLI04œ3‚)&Ñ€@ø]@r?-ÐÅ$¦(ÆIĪ

` ‰~ÉòÇ¢2fä±ÌEÄ«
Óë¿�šRœ(îÕãͦxÒÅÒÏÅp÷™âáð0?YªS?Òû§æ]®ó¥Î3_¿åÍÒ)”·lÑc[ßæ—}lY™‹è	[«]î§Ñ³vSF'èÕûMùˆuÓw7å'gT’˜!éé‹ûº™õiŠQ¹€w/µ›H@Xoµ‡�íÒJïJ”¹^ק¸E‹[sOôi‡Q¹@twcº0
 ",2OÛ¹o<œ;ß²ÅM…ì3ãN×¹?žO/]ºÅ^§Ûµ¥›U}°¤×‡ì¶X8qËS¼—«;wK#.ý“�¨–Ah¯µdu�»àÕˆK?ßÈËEòÖ½$F>r-5בÄ4–ÜrÁ±Ü<±4%æU^åÏ©=LËCD!Ü7fdN£¿û•�»0¯þgüGfËØ
+endstream
+endobj
+5925 0 obj
+<<
+/Type /Page
+/Contents 5926 0 R
+/Resources 5924 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 5895 0 R
+>>
+endobj
+5927 0 obj
+<<
+/D [5925 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+2074 0 obj
+<<
+/D [5925 0 R /XYZ 70.866 771.024 null]
+>>
+endobj
+5813 0 obj
+<<
+/D [5925 0 R /XYZ 201.979 720.013 null]
+>>
+endobj
+2078 0 obj
+<<
+/D [5925 0 R /XYZ 70.866 691.131 null]
+>>
+endobj
+5814 0 obj
+<<
+/D [5925 0 R /XYZ 168.059 628.986 null]
+>>
+endobj
+2082 0 obj
+<<
+/D [5925 0 R /XYZ 70.866 600.103 null]
+>>
+endobj
+5815 0 obj
+<<
+/D [5925 0 R /XYZ 206.955 537.958 null]
+>>
+endobj
+2086 0 obj
+<<
+/D [5925 0 R /XYZ 70.866 509.076 null]
+>>
+endobj
+5816 0 obj
+<<
+/D [5925 0 R /XYZ 162.617 446.931 null]
+>>
+endobj
+2090 0 obj
+<<
+/D [5925 0 R /XYZ 70.866 419.434 null]
+>>
+endobj
+5817 0 obj
+<<
+/D [5925 0 R /XYZ 161.245 355.903 null]
+>>
+endobj
+2094 0 obj
+<<
+/D [5925 0 R /XYZ 70.866 327.021 null]
+>>
+endobj
+5818 0 obj
+<<
+/D [5925 0 R /XYZ 190.108 264.876 null]
+>>
+endobj
+2098 0 obj
+<<
+/D [5925 0 R /XYZ 70.866 235.886 null]
+>>
+endobj
+5819 0 obj
+<<
+/D [5925 0 R /XYZ 190.108 173.849 null]
+>>
+endobj
+2102 0 obj
+<<
+/D [5925 0 R /XYZ 70.866 144.859 null]
+>>
+endobj
+5820 0 obj
+<<
+/D [5925 0 R /XYZ 190.108 82.821 null]
+>>
+endobj
+5924 0 obj
+<<
+/Font << /F50 2307 0 R /F72 2883 0 R /F43 2258 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+5932 0 obj
+<<
+/Length 928       
+/Filter /FlateDecode
+>>
+stream
+xÚÕVMoÛF½ëW,Ðyàf¿?ŽN,	`§•TEœ4I),$²¥¨$þ÷�å.%QVäÄ	
+ô �»Úy;ófæ
	Z"‚®F/ç£I�ÁV)Žæ¤	6J!mVÍsô>R˜Ó8aÚDíjs÷E‹?úõ¤\þmZ,bJ¢¢)ª¬ˆ?Ìß Á
–ÆÀ5Üm�ÆóÑ?#
+»ÑÝeÆ`ÃÊÖ£÷Êá¿7ˆ`n
úÜ�\#!9–‚Ãû
+ÍF¿�È“
(ŠÉa˜a'”ý>ßݼžÍ™TΧÍ�ÆVêJà´‘ÂÛþ’‹²‚0Õ‘e·A<x¶÷˜€€Â哘“¨nƒaÅ¿
Vr_¶~±iÓ*O›Ü¯²-˜�õ§˜É(&þñnüz<�ͧ³™ß¨«Õƒwf@8#È#&(9 â“’Úg0»5}šˆ—…#AFÕ¦-Êê–p½ñ®_×ùvµ
�D
+áÆ
A}P¡‡’TëÏ×IH¼—÷§À¿Ä9xÀÛø2$zK]L/{îBv®ßÞ̯Þ^�§îï?ÎòšX�	�Ý!¹ô¨Î¸gØ•gêÌYzzÏÚ·Õ`ý÷uÆŽ¨�Œ>“
+gé©`?L`ýt*(ÁZZÕsÁ0‘ü€ˆ˜l«¬-ëÊ#\ÖÙv]TmÚm�dUSléa�qÜ×W‘å›ônS.ï@u뼸%’À�>ÝÊŸê2÷lcø]‡Ôɵ×éf{z5B ¬BK”Pp¬ÏX�µi¼0Ãýöà~f°²¼·„pï$¶?d¡£T&;…ÅR‰=ˆ<%:@�ÁZ˜¡ö”Uò÷*ÍBBǯ.g!ûå²JÛmþéH(«¥�ƒ
+A8îá"uV¤‚‡$ÿ3¥Mº.Z�9J£Í€ŽSc�Z‘±sc�
Ù’ÈÝØûÉnDJD�y¥ç0à´ÄŠ³ÑM]=˜º3ÁÊb¡ÔA‡‘È%aϽq�g§¿PbƒÓÐV]QŸÌo[ûç}XgÐv¬ïvè|˜
m¤`ÑÔkÿÖ„™¤ ­b]“S%¡1ûbüëD%2¬Õîû'L·ÅN™d´ºt1»Áô1eœƒŒêçpö¸XÇVü`Á}?ÆW¿Ñ(h¦av m쑶åÅÓÚòBˆé[½=–6ñÿ“¶³ò!%&œ~ÏGsŸ…™†Ëö‰P6}]UѤ»&¸wíñÐO+W½_–.G •Ç.þ9Üݵ
+endstream
+endobj
+5931 0 obj
+<<
+/Type /Page
+/Contents 5932 0 R
+/Resources 5930 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 5895 0 R
+/Annots [ 5928 0 R 5929 0 R ]
+>>
+endobj
+5928 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 255.281 157.248 262.494]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5929 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 69.746 157.248 76.959]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5933 0 obj
+<<
+/D [5931 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+2106 0 obj
+<<
+/D [5931 0 R /XYZ 70.866 771.024 null]
+>>
+endobj
+5821 0 obj
+<<
+/D [5931 0 R /XYZ 308.327 716.341 null]
+>>
+endobj
+2110 0 obj
+<<
+/D [5931 0 R /XYZ 70.866 687.258 null]
+>>
+endobj
+5822 0 obj
+<<
+/D [5931 0 R /XYZ 345.97 619.606 null]
+>>
+endobj
+2114 0 obj
+<<
+/D [5931 0 R /XYZ 70.866 590.523 null]
+>>
+endobj
+5823 0 obj
+<<
+/D [5931 0 R /XYZ 308.327 522.87 null]
+>>
+endobj
+2118 0 obj
+<<
+/D [5931 0 R /XYZ 70.866 493.787 null]
+>>
+endobj
+2122 0 obj
+<<
+/D [5931 0 R /XYZ 70.866 397.051 null]
+>>
+endobj
+5896 0 obj
+<<
+/D [5931 0 R /XYZ 70.866 352.226 null]
+>>
+endobj
+2126 0 obj
+<<
+/D [5931 0 R /XYZ 70.866 325.031 null]
+>>
+endobj
+5934 0 obj
+<<
+/D [5931 0 R /XYZ 70.866 217.63 null]
+>>
+endobj
+5897 0 obj
+<<
+/D [5931 0 R /XYZ 70.866 158.578 null]
+>>
+endobj
+2130 0 obj
+<<
+/D [5931 0 R /XYZ 70.866 131.803 null]
+>>
+endobj
+5930 0 obj
+<<
+/Font << /F50 2307 0 R /F72 2883 0 R /F43 2258 0 R /F25 2885 0 R /F79 3175 0 R /F96 4060 0 R /F67 2878 0 R /F70 2881 0 R /F26 2949 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+5937 0 obj
+<<
+/Length 251       
+/Filter /FlateDecode
+>>
+stream
+xÚ•�=OÃ0†wÿŠí!æügú!uCÍVu‰‰,%”TÐ�›6
K§;ÝûÞ{�¡„5y(ÉÝÊ 8^X« |�¹³òBr+ l`G…Öl_n@%Mi›§ñ*tže2wt1ÔÇÞDZÃÏV²,Éɉ ¾#�ãNj¨{²Û#4IÛ@J,|LδQÜh•ú¶ä‰àOÌ4ÿ‹iÇ™3Ä쵫ê+Ôòq±½¿´ï¡�Õx<\•Æ×Cb;‘Î'þ#6†£·Ïÿ´\æVŸAµÑÜ�*·)r]ûèÕè›Ï3“HOó+™BúyjY&�úø›ñÉ4f6
+endstream
+endobj
+5936 0 obj
+<<
+/Type /Page
+/Contents 5937 0 R
+/Resources 5935 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 5895 0 R
+>>
+endobj
+5938 0 obj
+<<
+/D [5936 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+5935 0 obj
+<<
+/Font << /F50 2307 0 R /F43 2258 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+5949 0 obj
+<<
+/Length 1213      
+/Filter /FlateDecode
+>>
+stream
+xÚíXÉrÛF½ó+æT™ãÙ—CŽ#¹Ê‡T"ñà*ÙÅ‚AHB(.[ú{÷`$A‚A*·$v÷ô{Ýý‚AŸ¿�ï¯%A[¥8Ý#M°Q
+iË°¢h4Aw‘ÂœÆC¦MT>­Æ/’Xüèϯó§Ì¯n²û˜’(+²yšÅßFŸ‘àKcÀMe„
+é.®Fƒç
…«ѵ3c°a¥³ÁÝ7‚&pï3"˜[ƒ~VOÎ��KÁaý„nHØÁLº¥;„í(ݲE±a?ÅLDI‘̲2+bJ£UYm²5BpÏáx$Bf,¶„®#|c%‘æK.�Ù€§%VœUJta�™`HaùŒ¤ûÐ
‘°sR‡V`¢mÃa2÷´ÉÒÉ*ñËUþ0OÊ‹@¨rá�ßÃyº˜ÇŒD?b&�eñP�¨Ì&þÞ}±˜ùÕ‡Û?1mXå³eÍÒÂíóý5Sò¬àÑ1L7´æé?þ‘ÆÖjMäUðs- ˆg¶Ÿ>®–ð£þùÛç
˜àÇMts¯¿�ž¦à焇
+»ÉÈy³¬êãnn†ó!5˜é�Ï'™Ëî‹Ït>¯¡LýáçcV´²b•/j^�‰‰G²Ñ݆Á�ÐĦ½a(ÍxH	!Ñèoã,¦2z)‹$-ÇË"ÿáœ$e6žV7^¿Ià�†
ºD!ã7n‹*[
é§
Áƒ‘ÁßrZ¾.³FnÐÝP­]o¹õ._ãê®szÀ!‚ö&´„4RleHã"-“IÃ
Äe·âb+Ëk^%„ûŒYµõ JUýLúî´�nšØÿ<žåÔ?ÑpNæBmÌx˜vh‘Á@
&0`´½‚Ô»)é÷4ZB}ÞyÅ/Ã_�:6dîß+<M"ì7Õ¨“�"

+0Ž	“gO a ‹J}¬‚9SÐÙ�t�Ëlø	$´	Ê:Ǫ¹c	¨BÅÅÁÄ}®ÇæÚ(ÑôXÏ /ÊîT¼÷½UÐ6ÍQîÃ&4å—A|‘�1cØ[ˆ!-fDoWk;Æç¹lÅxÛeù0ôe]Þµr輺0Ü�ùNñÞ~ðßתåoÁj‹Ì ZbiE—ÌÐõÏ-6¶F�laÒ¬ôÉRgò|©…Ô�Ëw-Ù»úøñPö¦GŠ¬7MöL(sa‘õ·ÑSM	"1×æ"5Ú	yžo¡�äONho°©a
镧IYŸ.î{•I¥kª•Ó*ˆ7³™Æ§Ê2qH–¥î-|—cxs8O�É^‚V¾þWcâYµˆ1oA¢S‹ƒµ0AŒÐbiýÖ—C,,]³póÞÜ8YŠQÎÏ–bŒ€e{TFQF€Ðâp¹Ì†ŸÓÞÑ	¼¹vIQÇœ¦–`¥L××€3=¶}
hxl‘b-pïEE-ÅxÖ?¬=<¨Q]“¥ÓËlL5ƒéÕ±§ây'¤pj«2Û=Ë_+ [þºdצfcÚ7°}8´*ô2HûÛè9é)ô<Êô[|7y‹I¿ûîä‰~´cJY}êñ}·þ0
*JÃÙRF îT Ù§lžÉšUß·¤È‹Šy¯N>DÙ|7Ä_Ò Ò
+endstream
+endobj
+5948 0 obj
+<<
+/Type /Page
+/Contents 5949 0 R
+/Resources 5947 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 5895 0 R
+/Annots [ 5939 0 R 5940 0 R 5941 0 R 5942 0 R 5943 0 R 5944 0 R ]
+>>
+endobj
+5939 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [69.87 562.064 100.555 570.381]
+/A << /S /GoTo /D (structpktype) >>
+>>
+endobj
+5940 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 551.213 157.248 558.426]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5941 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 539.258 157.248 546.471]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5942 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [69.87 278.412 100.555 286.728]
+/A << /S /GoTo /D (structpktype) >>
+>>
+endobj
+5943 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 267.56 157.248 274.773]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5944 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 255.605 157.248 262.818]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5950 0 obj
+<<
+/D [5948 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+5951 0 obj
+<<
+/D [5948 0 R /XYZ 70.866 771.024 null]
+>>
+endobj
+5898 0 obj
+<<
+/D [5948 0 R /XYZ 70.866 648.158 null]
+>>
+endobj
+2134 0 obj
+<<
+/D [5948 0 R /XYZ 70.866 620.963 null]
+>>
+endobj
+5952 0 obj
+<<
+/D [5948 0 R /XYZ 70.866 501.715 null]
+>>
+endobj
+5899 0 obj
+<<
+/D [5948 0 R /XYZ 70.866 364.506 null]
+>>
+endobj
+2138 0 obj
+<<
+/D [5948 0 R /XYZ 70.866 337.31 null]
+>>
+endobj
+5953 0 obj
+<<
+/D [5948 0 R /XYZ 70.866 217.954 null]
+>>
+endobj
+5900 0 obj
+<<
+/D [5948 0 R /XYZ 70.866 83.254 null]
+>>
+endobj
+5947 0 obj
+<<
+/Font << /F50 2307 0 R /F67 2878 0 R /F70 2881 0 R /F43 2258 0 R /F26 2949 0 R /F72 2883 0 R /F79 3175 0 R /F96 4060 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+5960 0 obj
+<<
+/Length 1121      
+/Filter /FlateDecode
+>>
+stream
+xÚÍXKoÚLÝûW̤2�÷cÙW"uQõKXTJ«È5E!&%ŽZþýwÇ3Žm"u‘`sî�{î=Çc‚戠Ëèý4z{!	2Ø*ÅÑôi‚�RH[†EÓºQ¡Æ?¦Ÿ‡ï¸PðÃâòÅb™Ž'L›ÑÇUòü�fyœ/V™»5ú4�~Gî$ˆn!�Á†	”<D7?šÁwŸ Zƒþw> !9–‚Ãñ]GÿE¤5ME1)óT˜Sã	%„Œ¾IboÓ1•£¿ù:NòÛ$]C¾d”'’Àu©¾½Ðil5¡— 	€)<ä"ËǵÛ
…Ë©X°_éz–|u!HMh‰&”b+•Ç[%y<?ðKƒø¶Ÿ¬,/Kü�î“´ªr“Å„nixJÞÉ`oi®±&6$$_-¡¤¡¬K%v ¾ôÁLº¨îÃVºÂ0�h°Mø@È×1£x?¤9°Iéè©–|Sß)-°!êTßQ¦°VrÛwgÆp=*‘Rn|Ì)¸[@1l€(Ú^×Ú^c&@ILµ)àpä`z¹é&pÒàn/dìçþi1ÏÒ™?.†KÀp- GXçéaVÔj,8í‘Ö!!A…Fê Œ@ªPØrѲ^ÌG©’`É*3ÔLi¿€�”Væ¿‚–§cNœ`Ž)�Öõ¢·sŠ‡Ô„ær½Ý1J©SQÀš6…
+	…-
+x•æÏ묮F;I­•ôÎ'Ô`"‚_epÏâóΑ/–ÏëÔ‹iÍû&
ÀiR>xŸªzŸc*›Ý>>ÿtd.Éí}a‡›øŸlò¿»…‡óP›ŽøŠŽó¦a%�vçÖão­F¤Sf^Q—÷<€†ÜÇéls\ÉÞ6' Ÿ,?mQÒBÇÐã#3Ã+¢ kFÏ¡ˆ‚X̉9.‰ÃûF¬Í$L
&`7µ�qÇoºÿå:È8è*`tÏë�€�Œ
#u†'•[
+îO[›JÚF*·ËksÔHkϘ�´Öƒ®@Š½š¯üç»ë/˜úCï}cØ)üñœ‚²BAýù½;KÝ¿Íqö»§À·´eû=0:º °UTæ6¸L³yþ+xá]?6N™¥¨™¥®šåÜ�ŒÒ¼Å.Û·Y{;ÈÇû|ó˜Öê�nv–:÷ÿMGíº§|½M®«Í¹üŽS6Øo©â0ßâô`�
˜ã³9Â3î¥
+?‡0Óâå‹<î¶a}#îÉ2,ÜØzÈÒm+JœfÉjVnAº©0<Ù¡zd{È@(6Œè!�h.pë–™cÕlã™[ÌHØ÷�,bÉx¯ÐÍ„Wc·í9ûÞ5ÙC²�:ˆïÎ=×ÀJÏa¹°¥[Àcìj]wÝSµ÷ÏMÎÕŠ#gWŸ>|¿8W×ï*–y\E¡
+„Ó.ï„ËwÁ
+3­„[•�Kð[!á9$xÐeš¥ëxÛJ?+™\í¶	ŽŸíçø?‹ã
+endstream
+endobj
+5959 0 obj
+<<
+/Type /Page
+/Contents 5960 0 R
+/Resources 5958 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 5895 0 R
+/Annots [ 5945 0 R 5946 0 R 5954 0 R 5955 0 R 5956 0 R 5957 0 R ]
+>>
+endobj
+5945 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 716.132 157.248 723.344]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5946 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 704.176 157.248 711.389]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5954 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 460.612 157.248 467.825]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5955 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [69.87 215.701 100.555 224.018]
+/A << /S /GoTo /D (structpktype) >>
+>>
+endobj
+5956 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 204.85 157.248 212.063]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5957 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 192.895 157.248 200.108]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5961 0 obj
+<<
+/D [5959 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+2142 0 obj
+<<
+/D [5959 0 R /XYZ 70.866 771.024 null]
+>>
+endobj
+5962 0 obj
+<<
+/D [5959 0 R /XYZ 70.866 692.464 null]
+>>
+endobj
+5901 0 obj
+<<
+/D [5959 0 R /XYZ 70.866 557.558 null]
+>>
+endobj
+2146 0 obj
+<<
+/D [5959 0 R /XYZ 70.866 530.362 null]
+>>
+endobj
+5963 0 obj
+<<
+/D [5959 0 R /XYZ 70.866 436.594 null]
+>>
+endobj
+5902 0 obj
+<<
+/D [5959 0 R /XYZ 70.866 301.795 null]
+>>
+endobj
+2150 0 obj
+<<
+/D [5959 0 R /XYZ 70.866 274.6 null]
+>>
+endobj
+5964 0 obj
+<<
+/D [5959 0 R /XYZ 70.866 180.832 null]
+>>
+endobj
+5958 0 obj
+<<
+/Font << /F50 2307 0 R /F72 2883 0 R /F79 3175 0 R /F96 4060 0 R /F67 2878 0 R /F70 2881 0 R /F43 2258 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+5973 0 obj
+<<
+/Length 941       
+/Filter /FlateDecode
+>>
+stream
+xÚÝXËnÓ@Ýç+fiKx˜÷cÉ«•XAÉ¢RA‘I&Åjš×ò÷ÜñŒ»		±‹@,ÛãÉ9wî�{Ž‚®A磗ãÑó3I�ÁV)ŽÆs¤	6J!mV�gè*Q˜Ó4cÚ$Õâ~òC‹¿„ë³báÂÙ…›§”$®tË©K?�ß"Á
–ÆM
B…öã7ãÑ×…Q‚è†Ìl˜@ÓÛÑÕ'‚fpï-"˜[ƒ¾×3o‘�KÁá|�>ŒÞ�ÈÑ°Vô˜c“f”’\Bø—R™ü¨Ê|ZMî>ûÈÅtrS�¯?IàCëxC åuŒøâø4C[M¨ç#(#E »»©Öw.þ4Ĉ®2µaÞ²ÆuZßôœ¿àCŠb¡%Ê(ÅVÊ@³šVù¬ÃaÙVXÌ`ey“ý�„p?ûù™U­Iªš9Óg¿·àŒk¬‰�ñ¨?ÏM˜Ðá¶X*±ij„™ô¬þà‰•ní(»ÁZ”1ð±LïR&’¼Ìo]åÊ”Òä¾ü¾]ª¸uh—R¢`•f³KŸƒb¢$RŒbÉAÀd^g2 Ô=¢;=¢1�$¦TÇòﶧ�ÄÖ“šuKh&°:„ù2HÇ%†Æ§S¨E&HR°AØ4¯ÜnP‚ç}Ò°[@àœ+è ŒXP¢15úèR¬�G+ê{zsÛ@û+Ú�qoIی՗h.åĬWV�;7Ã7)�ð_ë…=9¸Ýª@Ê-xÏ ÊžŽÑ¨GW�êÔu$)2H	šhxHÝ…«ÊeW…¶RÚÉ<è\gÔ`"¢œ‘�ßUl©¹O^,ÊÚўŻe8ËY
½Õ\®æáè��ÕF¸[¬àþÞØê3ïVo^½êÂ^|xÑ(ò#KÎbÄZ`ÓDmÙ¶mÙ7ýr6)îï\Ùvá_XnôÂbY¥[‡�ˆÇZÿˆ•ÉÞVÆ-¬ÛÊAý1#(×3óVÆ
luÔÊúîÓ½á@+;9ªÝb1ì¬Ɖ‚Ç™ÅZëA‚'{ÞÝ
+$ÂÅ‹jU0JDÐ3ÂÜbÖÈã£
+ž¦h”ì‘´o^FóE1+ªõ aûAþsiëÿ”Nƒ×N;¨†ai£Âb®Ÿä1�JCǤ­'á>mk”¶Ó£Ú­@P-†UôtŒµ�Â"t#[Û@nd²QŠßS¸ƒ]%%&‡ßrÿAÓü1£0Ó ÛD	‰•Š›ëÜ-]™o^>·6_¯êWˆõµWÓÄ-‡ø…Í'K
+endstream
+endobj
+5972 0 obj
+<<
+/Type /Page
+/Contents 5973 0 R
+/Resources 5971 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 5978 0 R
+/Annots [ 5965 0 R 5966 0 R 5967 0 R 5968 0 R 5969 0 R ]
+>>
+endobj
+5965 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [69.87 686.922 100.555 695.239]
+/A << /S /GoTo /D (structpktype) >>
+>>
+endobj
+5966 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 676.071 157.248 683.284]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5967 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 664.116 157.248 671.328]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5968 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 420.865 157.248 428.078]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5969 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 191.958 157.248 199.171]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5974 0 obj
+<<
+/D [5972 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+5903 0 obj
+<<
+/D [5972 0 R /XYZ 70.866 773.016 null]
+>>
+endobj
+2154 0 obj
+<<
+/D [5972 0 R /XYZ 70.866 745.821 null]
+>>
+endobj
+5975 0 obj
+<<
+/D [5972 0 R /XYZ 70.866 652.403 null]
+>>
+endobj
+5904 0 obj
+<<
+/D [5972 0 R /XYZ 70.866 517.811 null]
+>>
+endobj
+2158 0 obj
+<<
+/D [5972 0 R /XYZ 70.866 490.615 null]
+>>
+endobj
+5976 0 obj
+<<
+/D [5972 0 R /XYZ 70.866 409.153 null]
+>>
+endobj
+5905 0 obj
+<<
+/D [5972 0 R /XYZ 70.866 288.904 null]
+>>
+endobj
+2162 0 obj
+<<
+/D [5972 0 R /XYZ 70.866 261.708 null]
+>>
+endobj
+5977 0 obj
+<<
+/D [5972 0 R /XYZ 70.866 180.246 null]
+>>
+endobj
+5906 0 obj
+<<
+/D [5972 0 R /XYZ 70.866 82.821 null]
+>>
+endobj
+5971 0 obj
+<<
+/Font << /F50 2307 0 R /F72 2883 0 R /F79 3175 0 R /F96 4060 0 R /F67 2878 0 R /F70 2881 0 R /F43 2258 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+5984 0 obj
+<<
+/Length 1101      
+/Filter /FlateDecode
+>>
+stream
+xÚÕX]�Ú8}ϯðc"M\Ûy­º3j_v·ÃC¥¶Q04[&ÌBP—¿7Ø�xAIX©û€BûÜ�s}|c‚–ˆ ‡èí$zs/	28SŠ£Éi‚�RHg+Š&sô9¦Â$_'‡w\(˜xx|Ÿ¯l’2mâwëÙîÙå´Ì×E54úmýQI=Bƒ
hö}þJÐÞ}@€˜ôó0ò	ɱþ¯ÐcôgD®º©(&µŸ
+sŠ9¦4I)!$þ$Iöô…VÌŸ¶»oÙYù…H?Z9ùæ^3¤q¦	­	Jaº‘Â�åE™¤ªFYä'÷¸B:„êbÜ,}°"N	-QJ)ΤrxëY9�û	.(°Ÿ5ì3ƒUÆëä‚ÛÜ9™©Æ z$`ÖE†¥'iD0“•ÕêRVº‘JH–ÁZ”2ð>þ?&âéfúlK»I(�·�óm+£°V¬‹`JDiŽß£*‰”®ªHuaÀh~H¥ƒ8Ô—êKc&@iL9oä;ŒÜ@æ	j*ýd1˜@A§…[`Ÿ0¡û;6RAâ2¯*{6-í¹W0ø Dœó
\èqœöǨË,,ÜCÒ‚Ú­-0‰‰ðIûhËݦËõ´æ‚œCÁÃ}J
Ì–n6qi^ûÌ/Nâi¾ÚmlBe|çßnÜõe
2aýM¹v×£LT7Iv5w7yñŠC·€aK½OZ`#D(l¬)l[»Z<móeaçCU­
ÑSÔäÿLÔä`QRCúä¨0Éš+qMÂ`ÆÔ5Mf°MÒƒ#%­·Wçd‚ãøì
ÑSÏx¦`P·Ð³rµó­Z¾ð"K?uKßkš]mmSóªÛ~òÄ[ú.è
+órÿô²I‰×/­¦÷£±#hXîíº»àÀ«S®±&ÙîÏã]KzCãê”äs0šÁžcj´m+š„rDüÑ:ü×õ˜Å�ö‚,1º¿¥‹éìM­ÖE‡tŒÃp[
Õ`é[ìÔp,ê•Ö¶dXµnK­B{·f‹IÃ9¡”Çè(Ϩ’˜Ñ+‘(îì*¡àñù}¼Äç k­t6¬å[Gáïïßù&Ùo5N¦­{÷ègBIìw›éÆÿY­×?òbÙ؃ Í¾Ì~ß Î‰Bé8òGaxò%�º	•ô*ùRbââäúûƒÌµ²ß4WÓ?íø2*¿Ûºû˜ŽŠ‚:9L°Û2üV:Î	>š.ÔDßÐÎù¡FÖÄ(_\aØ o¢Ü⬱£¶Å0{­UÑ´WWEw9¬l±,¿‡Õp|ÊÇeî{GpN—ØtC\'¿?FÏoO(ý5Ž::Hêj¤@7§}‚ë`…™†öâ�.Kè$„„%ï»Ø[Ø
ôþ¸å[õͱ¯�¨«èþÙ/«o”د}ü±
+endstream
+endobj
+5983 0 obj
+<<
+/Type /Page
+/Contents 5984 0 R
+/Resources 5982 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 5978 0 R
+/Annots [ 5970 0 R 5979 0 R 5980 0 R 5981 0 R ]
+>>
+endobj
+5970 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 716.132 157.248 723.344]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5979 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 487.225 157.248 494.438]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5980 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 258.318 157.248 265.531]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5981 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 246.363 157.248 253.576]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5985 0 obj
+<<
+/D [5983 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+2166 0 obj
+<<
+/D [5983 0 R /XYZ 70.866 771.024 null]
+>>
+endobj
+5986 0 obj
+<<
+/D [5983 0 R /XYZ 70.866 704.419 null]
+>>
+endobj
+5907 0 obj
+<<
+/D [5983 0 R /XYZ 70.866 584.17 null]
+>>
+endobj
+2170 0 obj
+<<
+/D [5983 0 R /XYZ 70.866 556.975 null]
+>>
+endobj
+5987 0 obj
+<<
+/D [5983 0 R /XYZ 70.866 475.513 null]
+>>
+endobj
+5908 0 obj
+<<
+/D [5983 0 R /XYZ 70.866 355.263 null]
+>>
+endobj
+2174 0 obj
+<<
+/D [5983 0 R /XYZ 70.866 328.068 null]
+>>
+endobj
+5988 0 obj
+<<
+/D [5983 0 R /XYZ 70.866 210.74 null]
+>>
+endobj
+5982 0 obj
+<<
+/Font << /F50 2307 0 R /F72 2883 0 R /F79 3175 0 R /F96 4060 0 R /F67 2878 0 R /F70 2881 0 R /F43 2258 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+5994 0 obj
+<<
+/Length 943       
+/Filter /FlateDecode
+>>
+stream
+xÚÕXK�›H¾ó+úRètõ»¯ÑÓ’hÄ<Aòà,&»ñ¿ß‚n¿Æ^ÀR²‹G7_=¾ªú0Œ<Fî£w‹èí�bÄR§µ ‹1ŒZ­‰qœj ‹œ|Œ5�¤ÜظYo¿+æè}W®öP¬`qQÕ²H>/Þ),UÖ¢™¤koG¿.¢¿"À»ŒÀÁ˜µÔrI–ÏÑÇÏŒä¸öž0*œ%ÿt;Ÿ‰T‚*)ð|Mþˆ~�ØÕø‰÷TP�I
+Œ±øúÿø‰1^å�Û&«Ñ7�yÖŸ˜bøƒÖÑ·w†C�aТ2’"ŒUÒƒ–U“¤z�¶*–‡ñ+-X±µ~
+1?ÜGD•F‘€:¥<äfÙdyxÀdž.¸¸¥Ú‰}>1áýtúd“£ô~ÏòÍ@$©0Ô0Œëc<}0pø�Á혣J«£K>u£\µ1´‡6mNøI£ -I9G_C>K¸Œ³:{.š¢N¼±C&†ŠFI�Ô—Š°ˆÁjæ¶@†®9P%.!àfё⺂5gk(—‘0�¹~¯XÌ:ã
bç
:IVÖ™Á¬ò}ü�bAûÓ%2‘Jì�²í–e[Ø=§¸æØf¼W}.A˜Eçˆ@'ÓÔY¸ˆ¤ à*ŸØ_†‰“ÞæsšÅABO-–[Ïbæ_7Øâ-¡Ýß„ã—0½ýl¹ö×›Õ‹
'\ÅÙºÌËfçï´5Q¬ó%1:°>¡a켚
±Ÿ9çC¬KúÙ”²8ËC=Í·º:Ÿ]Çi~ÆN?¼NÁR&ƒ°�üЊ«D°8+×ßê"
¿	«õBóн/´2
^I­”çz©ô²säûײn×âÝ|Ñ,Z°ÝÿN5ÕVM5Y5…q8#圖šáǬÐ¥ÇÝB6…vHŒº&›-�Ù3‹3us¼[}:´¢î2ÄUFç@F¾hwáJSîàšpN´8Èè©Å.œãëŠÂÌ*‰±#eS0ÑÕÍÙ”7—Í¢}Öëžì&k§~U;›¢Ú–›jûTS]PÍ=ÌÏ#š¯Èœ)sÀ,þ%›¯s µær
ã«¡vöõ˜‡áç"`Zó[(pœRÒ]Sº‰‡æâ™Å‰J轘”ˆ>mÇi1�Óñû2ëa)EÙå¿›/¿Zí¿VaZ
¶ÆqJ…É	ßb¨1—¹OòŸ	?Œ¢_6Ý€Ú=uïßEõ²
þ‡3bà
+endstream
+endobj
+5993 0 obj
+<<
+/Type /Page
+/Contents 5994 0 R
+/Resources 5992 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 5978 0 R
+/Annots [ 5989 0 R 5990 0 R 5991 0 R ]
+>>
+endobj
+5989 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 676.071 157.248 683.284]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5990 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 420.659 157.248 427.872]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5991 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 165.247 157.248 172.46]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+5995 0 obj
+<<
+/D [5993 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+5909 0 obj
+<<
+/D [5993 0 R /XYZ 70.866 773.016 null]
+>>
+endobj
+2178 0 obj
+<<
+/D [5993 0 R /XYZ 70.866 745.821 null]
+>>
+endobj
+5996 0 obj
+<<
+/D [5993 0 R /XYZ 70.866 652.403 null]
+>>
+endobj
+5910 0 obj
+<<
+/D [5993 0 R /XYZ 70.866 517.604 null]
+>>
+endobj
+2182 0 obj
+<<
+/D [5993 0 R /XYZ 70.866 490.409 null]
+>>
+endobj
+5997 0 obj
+<<
+/D [5993 0 R /XYZ 70.866 396.992 null]
+>>
+endobj
+5911 0 obj
+<<
+/D [5993 0 R /XYZ 70.866 262.193 null]
+>>
+endobj
+2186 0 obj
+<<
+/D [5993 0 R /XYZ 70.866 234.997 null]
+>>
+endobj
+5998 0 obj
+<<
+/D [5993 0 R /XYZ 70.866 153.535 null]
+>>
+endobj
+5992 0 obj
+<<
+/Font << /F50 2307 0 R /F72 2883 0 R /F79 3175 0 R /F96 4060 0 R /F67 2878 0 R /F70 2881 0 R /F43 2258 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+6005 0 obj
+<<
+/Length 1187      
+/Filter /FlateDecode
+>>
+stream
+xÚÍYÛŽ£F}÷Wô#HãÞ¾_mf”U”ËŒ­´Y�{HœØX»û÷©†Æì
fWyC÷©ª®ÓÕ§0ADÐÍìûÅì͵$È`«G‹5Ò¥�¶+Š+ô! ’„ï‡w\(˜X<¾NÒ8œ3m‚·Ûåá)Îò(O¶™:ûa1ûwFa$Aôi6L åÓìÃG‚VðîDkЧbä’c)8ܧènöÛŒx7�W̤»uï¼ÒÎ+�•V¥›·q~Øeû­S¼7×`ìy:c~Ï©ÁDÈr6)#„°Šë:ä$ˆ’ô°ó¡ÿI$ÙîÊûl[^c7èsg{XŽ=Œ WÅüg›dyìä�³*tÂâtUþH¼K7S� w!�doîCÐ!ÊæsLu8§„�à½$öÞ!g«û8¤òhÔÅâ¼-q5C[M¨Ã%h FúU
÷ùª°Ö‰CªPÊË/¹£Ànã¹p{3CŠb¡%¬3ŶBÜ.óhÕÈx`k0ƒ•å÷À}^ºiUm�Å„ù¹¼êqà$¶9×XûÕý¹»êXØNãnyÛ`ÔbÊL…¶ïDócºÑþ7ÑÎø¯«1ëƒK%žAJîœlÓ“=:·`Ùˆ‚ª„z
™¢]ô»}AiÐܯ]åD�cçÊ	sABÔU9yeŠ‰’H
+ƒÑç0`4/˜PBuK7Š®ÆL0$%¤
HUÒ·]H�Åb¬½F¡³K¨�
{‘//ï1ìé“J“¸r±Œò¸í§
+ÃÝjg 1Ó2:	Ãg”s¬…½ŠvÛ‹åVÚúЗÑqö:3Z·—øSä—ßúógíÏŸ¨Êëò�F»Žó§|ô)¤$ð]T�xévûw’mjç!ký´[;¥
µl+¦@xRÀv1*éEJ0Ž-óÒjßG‰1Ö:	Q·V":#CòGŸç}¼Ì�L¨˜SLˆ÷yS‘ç4¤I!FÖÎ%µÓ¸0z¾' QÙ«Tb1‡óôùxí¢Â8{�d¨Û«ÈpžiœmòÇ&	Ž/›%£?åƒ#h'
 8„4)ñÃ1öB*L¸ýÊ}(ö—ôýYÐ3˜Žž!Jóû”Ú¤v¡ùŸuß^�/£]‡<we›QçÅb¶mžà¼H S "§l²BgІ۳ý>“ð¡wÏN‚(ë5‘«™|
}Τ,¦OŸS"‹-4Òd£&P
+‹br¤DçLbbÙ·ÚùÉÔ´œNÂðI…�Iµ|
=ÆT*«{õØ1©ãLv&µnò%¢¬#Ë}šýîðð(·ïÒügØ«û3lO;“\A¡™È†Iž
®Ê©K½'Ãæ2˜†FA4KjFí¤CÝè	~¿ýéL
+‡ºÐ^}@ÐÊLËàpŒ�º
+hŠ…ßLWQßÞ¬ŸsP>Ø7ûž4©:¡Jƒ¬ñß‚«ÍWˆ-J°–pv×Ô–€Ô˺Ú^jý*pi—D®ûîÿÄ~öÛðƒÓ!_Ú«?fÚ­ôFˆ‚•Bb¥ü·ô›8‹wP}üé‡�‘àKå`Q‹¾l\AÜòñ?Jn
+endstream
+endobj
+6004 0 obj
+<<
+/Type /Page
+/Contents 6005 0 R
+/Resources 6003 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 5978 0 R
+/Annots [ 5999 0 R 6000 0 R 6001 0 R ]
+>>
+endobj
+5999 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 626.857 157.248 634.07]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+6000 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 614.902 157.248 622.115]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+6001 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.345 318.22 157.248 325.433]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+6006 0 obj
+<<
+/D [6004 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+5912 0 obj
+<<
+/D [6004 0 R /XYZ 70.866 723.803 null]
+>>
+endobj
+2190 0 obj
+<<
+/D [6004 0 R /XYZ 70.866 696.607 null]
+>>
+endobj
+6007 0 obj
+<<
+/D [6004 0 R /XYZ 70.866 579.28 null]
+>>
+endobj
+5913 0 obj
+<<
+/D [6004 0 R /XYZ 70.866 415.166 null]
+>>
+endobj
+2194 0 obj
+<<
+/D [6004 0 R /XYZ 70.866 387.97 null]
+>>
+endobj
+6008 0 obj
+<<
+/D [6004 0 R /XYZ 70.866 282.598 null]
+>>
+endobj
+2198 0 obj
+<<
+/D [6004 0 R /XYZ 70.866 140.851 null]
+>>
+endobj
+5914 0 obj
+<<
+/D [6004 0 R /XYZ 70.866 95.466 null]
+>>
+endobj
+6003 0 obj
+<<
+/Font << /F50 2307 0 R /F67 2878 0 R /F43 2258 0 R /F72 2883 0 R /F79 3175 0 R /F96 4060 0 R /F70 2881 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+6021 0 obj
+<<
+/Length 500       
+/Filter /FlateDecode
+>>
+stream
+xÚµ•]oÚ0†ïó+Îer�{ìØŽsÉ U¥h%H“ª2pZ>´4Óè¿Ÿ3jÚ©%•rDZÏy¿'>;@˜zŸïj"‰¥!y€‰’¢˜I!ÙÂÊ—$¤Á€Eʯ³ÇûƒÀ˜ü°ï“}¦íèN?}]éb£ƒur
<TD(eÒ´A¨ Í´7N¼_5³ô”L)¢‡Mî­Ö[óí�„±‚?íʸ‰à¡g°ð¾xø.€¤]‰¡ ˆè5÷£ÛV�R펊î¦&^Ä "q„´‰‡0‘ �m¨rS§ÛãN+
Vé5)dä¯ô¡ÖU±nV^MŒðg�& c$VÜ•¿‹º
+LÿÉžåmšk»ï¬¢2~ÆÄ\¦yLóLâ°Ú¥Åþ1­÷eñ
¦ÐewdR—0�»3é<Ýg#pá¦[nº—ZVnÒÌúQ¼í‡8ƒ.̲?–ÝýXûÚaiGßP`ú3µ/óWEø¼e¾4KéÅnJ÷f}¸9ëîæ̽.^ã�Ê<wÿ¾NÀ‘¼èxÑÝñE�Öú׉ra†}”ï°;Ì03
Œ0åû’ê”ãÍR‚!íÒ+ÿõHIX$¹Ó#¹ Ò<Z=S]èÊ(ÙZ)ßvêGŸËÀ4§ÃÓ®�ôuñRâ_ö•ñ
+endstream
+endobj
+6020 0 obj
+<<
+/Type /Page
+/Contents 6021 0 R
+/Resources 6019 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 5978 0 R
+/Annots [ 6002 0 R 6009 0 R 6010 0 R 6011 0 R 6012 0 R 6013 0 R 6014 0 R 6015 0 R ]
+>>
+endobj
+6002 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [69.87 729.923 95.773 737.136]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+6009 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [69.87 638.895 95.773 646.108]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+6010 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [69.87 547.868 95.773 555.081]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+6011 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [69.87 456.84 95.773 464.053]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+6012 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [69.87 365.813 95.773 373.026]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+6013 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [69.87 274.786 95.773 281.999]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+6014 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [69.87 183.758 95.773 190.971]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+6015 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [69.87 92.731 95.773 99.944]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+6022 0 obj
+<<
+/D [6020 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+2202 0 obj
+<<
+/D [6020 0 R /XYZ 70.866 771.024 null]
+>>
+endobj
+5915 0 obj
+<<
+/D [6020 0 R /XYZ 131.424 720.013 null]
+>>
+endobj
+2206 0 obj
+<<
+/D [6020 0 R /XYZ 70.866 691.131 null]
+>>
+endobj
+5916 0 obj
+<<
+/D [6020 0 R /XYZ 148.603 628.986 null]
+>>
+endobj
+2210 0 obj
+<<
+/D [6020 0 R /XYZ 70.866 599.996 null]
+>>
+endobj
+5917 0 obj
+<<
+/D [6020 0 R /XYZ 94.779 537.958 null]
+>>
+endobj
+2214 0 obj
+<<
+/D [6020 0 R /XYZ 70.866 510.86 null]
+>>
+endobj
+5918 0 obj
+<<
+/D [6020 0 R /XYZ 116.71 446.931 null]
+>>
+endobj
+2218 0 obj
+<<
+/D [6020 0 R /XYZ 70.866 419.833 null]
+>>
+endobj
+5919 0 obj
+<<
+/D [6020 0 R /XYZ 224.834 355.903 null]
+>>
+endobj
+2222 0 obj
+<<
+/D [6020 0 R /XYZ 70.866 326.914 null]
+>>
+endobj
+5920 0 obj
+<<
+/D [6020 0 R /XYZ 199.899 264.876 null]
+>>
+endobj
+2226 0 obj
+<<
+/D [6020 0 R /XYZ 70.866 235.994 null]
+>>
+endobj
+5921 0 obj
+<<
+/D [6020 0 R /XYZ 120.7 173.849 null]
+>>
+endobj
+2230 0 obj
+<<
+/D [6020 0 R /XYZ 70.866 146.67 null]
+>>
+endobj
+5922 0 obj
+<<
+/D [6020 0 R /XYZ 135.871 82.821 null]
+>>
+endobj
+6019 0 obj
+<<
+/Font << /F50 2307 0 R /F72 2883 0 R /F43 2258 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+6082 0 obj
+<<
+/Length 1440      
+/Filter /FlateDecode
+>>
+stream
+xÚÍZmo£8þž_�t_’ÕÆõ»�î¾´iú²Ûmw›T·§n¥@[Ô.d�ôZ�î¿ŸÁ$
By饪Ô`cÏ<óÌŒ= qo@ã¸qÐoì1hH`rNŒþ�! �œÂÄ€#£o×MÄpë¦ÿÉ ê¡\MLº�Ü'§ÕÆB6}küÓñ¢aäú^<´Ñí7~5�	
4)%�˜ÖÏÆõ
4luï“¡$šÒø;ùÓ ŒF‰º~2z�o
X	“#'89 P`¶ÚBØüΠ9ø|•àÑ@‚ûÑå±’'°!€) ŠåA£M �iQ¾
ít¦†`\·yF¨RÁEóÚy‰œÀ»‰Gî)à3€J &€‹Ûç…M§…aóUsvï=/gXD!YÎ&³FtÞÀ(%tU£†¡kis:¾FAÁæÐõ¢pjÂÀDˆ¥“)&™Y†S£¢§pð¢0€‡…va
+(ãZÒ±¯1D“߇4.í\\&]þÝdŒê«bȈ5AŽ›„K®¸$2Õ«5*Ð%9‘v£i?BZ
+`qlKõa–“﹜²ÿ›{çÙŽÂ7úg½A⎓¼£Šê^Y�ÒázΊjHÖÊY7�iWµêo¦ooO«ê�G#?ˆ[7»ž¼Ž´Câö'zðí°+‡Á7"!! Ûé誀 6×uÙÛ×-\¡KnîCÝ"ºÌÍu}ý¦´TÕ,70Ü\×É_ºÁ–›…ñÚz2ôÕÝسâH­ˆN\ž$˜nÁZÌx­�Álʈ¤µbo!ïN˜Z–DÍL™\Û“�qðìT9Ï,_ÇÉf±zÕëÎO{ý©ÿàrm¬®ƒSÙ\g1#µ²cNÃÁåþéù׋‹³IH¶ŽG&"Š
æÂh#€±ÖôáCrGÂ¥1ëþCO?ò}q¨šaäûO©XÆÛ·n¤VìB}ÙÖ?vO»—½þå~¯§;|ïé5у!ŠÈ‚䆪Ÿ$ÍØ˳Ó&̪à*pDÖâhÿ¼×;�dQ›ð-ðs8žõPBN
={ØkP¥êBDÄTIU`«Â«ÀÝJ²L×T•-l+úF©¾ŠÕ•ˆIaš„€.M“Ë™]5çä̲éØùJ|áÐd±ìœÊöæï¥[‘»ÅyQ§¹[œÝå8g»…»zV“PŠv‹óª.N¼[œ_êâ$»ÅÙ«‹“íç~]œ|·8§Ç@U8w¼ÐOOv*p²y½Žœø\¡ }ñ„0
+ÆV´|'dDï˜ÿ”¯—lR$[0fÙ�9ߥՒøøÇõ¢zÅÕ䇽%Ž‡ø	±þ–8tÅWˆÐ~ûwÁ	[*qô¸Dz¼Û,íæt½ÌªË\<ÿÙwk&›cÙápº÷UZûöœÅ? ƒ™*;HE
ÆÒ‚•WÔi·¥„#Mi	EE®Ê�»z{
+kÇÞŒAÛÙƒ\"ðÙbSâó‘ÀåÖy¨ÓOH&ÀæüóQü¬ffž�¾µl—œœ“š«?`!(�0q7-5Gn¹ì+Iÿåû•­h0
+Üçaä�×�
#h5qÖÇ•¤%T,Ë2bG�™àÂŒ
LI‘õòØ2á;q†åQœ™›{B i½Eíãò�¥Ì#pfÖf]B9�±#óÜ‹w´4Î9ãÿÜ]Â5<A‘r3YuïR�@pYôDiU€ {oºs={0ß>¹ÖV–-Å@h•\©iÛœ]fA^GÕ(
+²C0I{¥Uê2Dv¼žÝ;ÑVdbµÈê-`‹;KvÃR6d}A( 9§å®È¿í*ûº‚é³ï>®˜|TÁ
œÆï¸)£j™¡êp>y¹îxN0L^©ÄoËo3Ÿ0ú-›/¯÷ñkü¦ã1þƒö¶]
+endstream
+endobj
+6081 0 obj
+<<
+/Type /Page
+/Contents 6082 0 R
+/Resources 6080 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 5978 0 R
+/Annots [ 6016 0 R 6017 0 R 6018 0 R 6023 0 R 6024 0 R 6025 0 R 6026 0 R 6027 0 R 6028 0 R 6029 0 R 6030 0 R 6031 0 R 6032 0 R 6033 0 R 6034 0 R 6035 0 R 6036 0 R 6037 0 R 6038 0 R 6039 0 R 6040 0 R 6041 0 R 6042 0 R 6043 0 R 6044 0 R 6045 0 R 6046 0 R 6047 0 R 6048 0 R 6049 0 R 6050 0 R 6051 0 R 6052 0 R 6053 0 R 6054 0 R 6055 0 R 6056 0 R 6057 0 R 6058 0 R 6059 0 R 6060 0 R 6061 0 R 6062 0 R 6063 0 R 6064 0 R 6065 0 R 6066 0 R 6067 0 R ]
+>>
+endobj
+6016 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [69.87 729.236 95.773 736.449]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+6017 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [69.87 636.075 95.773 643.288]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+6018 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [69.87 531.953 212.775 540.724]
+/A << /S /GoTo /D (tls__x509_8h) >>
+>>
+endobj
+6023 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [124.266 332.775 147.18 339.336]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+6024 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [149.372 331.967 180.654 339.336]
+/A << /S /GoTo /D (tls__x509_8h_a26ebd69b7048f0ec457aed53cd2ab4b2) >>
+>>
+endobj
+6025 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [124.266 324.805 147.18 331.366]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+6026 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [149.372 323.996 180.654 331.366]
+/A << /S /GoTo /D (tls__x509_8h_a99dcbac6d2b5bed887178a19ebe012fc) >>
+>>
+endobj
+6027 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [124.266 316.835 147.18 323.396]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+6028 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [149.372 316.026 180.654 323.396]
+/A << /S /GoTo /D (tls__x509_8h_a4a71fcb7d2942084a57e335d27b98f3a) >>
+>>
+endobj
+6029 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [124.266 308.865 147.18 315.426]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+6030 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [149.372 308.056 180.654 315.426]
+/A << /S /GoTo /D (tls__x509_8h_a319fe0afe56c81a5571f22690a68921d) >>
+>>
+endobj
+6031 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [124.266 300.895 147.18 307.455]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+6032 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [149.372 300.086 180.654 307.455]
+/A << /S /GoTo /D (tls__x509_8h_a4cfd7b1ce0abf2a824f8264a8b889884) >>
+>>
+endobj
+6033 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [124.266 292.925 147.18 299.485]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+6034 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [149.372 292.116 180.654 299.485]
+/A << /S /GoTo /D (tls__x509_8h_a27885f5e775115282ef665fcf7fc486a) >>
+>>
+endobj
+6035 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [124.266 284.955 147.18 291.515]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+6036 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [149.372 284.146 180.654 291.515]
+/A << /S /GoTo /D (tls__x509_8h_a56c084dad2b13fc39219718e2c9ea08b) >>
+>>
+endobj
+6037 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [124.266 276.985 147.18 283.545]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+6038 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [149.372 276.176 180.654 283.545]
+/A << /S /GoTo /D (tls__x509_8h_afac5896b24f8e6d2427daa60dddae297) >>
+>>
+endobj
+6039 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [124.266 269.015 147.18 275.575]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+6040 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [149.372 268.206 180.654 275.575]
+/A << /S /GoTo /D (tls__x509_8h_a63727d4ec7bf088c3e114441725dd3c8) >>
+>>
+endobj
+6041 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [124.266 261.044 147.18 267.605]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+6042 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [149.372 260.236 180.654 267.605]
+/A << /S /GoTo /D (tls__x509_8h_a8b27e013d3e6af063bb660fd41529a71) >>
+>>
+endobj
+6043 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.45 236.168 147.18 243.123]
+/A << /S /GoTo /D (structpktype_ae3d2dbf17869cb218ea7f4ea10ccbc03) >>
+>>
+endobj
+6044 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.45 229.164 147.18 235.724]
+/A << /S /GoTo /D (structpktype_a81908ce09cfe1c183b5c1d44708ab9a2) >>
+>>
+endobj
+6045 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.45 221.194 151.364 226.335]
+/A << /S /GoTo /D (structpktype_aa8fa37d88b74366bd16a3f46d1a36293) >>
+>>
+endobj
+6046 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.344 212.258 130.443 219.784]
+/A << /S /GoTo /D (structpktype) >>
+>>
+endobj
+6047 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.187 188.348 214.129 195.874]
+/A << /S /GoTo /D (tls__x509_8h_af15f220eebf42393d74cd0338e4a6471) >>
+>>
+endobj
+6048 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [216.321 189.313 239.235 195.874]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+6049 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [141.003 172.407 209.944 179.934]
+/A << /S /GoTo /D (tls__x509_8h_a29762ed96ca7d3ccf89be8c496cb9ebb) >>
+>>
+endobj
+6050 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [212.136 173.373 235.05 179.934]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+6051 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [124.266 140.527 151.364 148.053]
+/A << /S /GoTo /D (structpktype) >>
+>>
+endobj
+6052 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [153.556 140.527 255.972 148.053]
+/A << /S /GoTo /D (tls__x509_8h_a032e98c7594a00ff27e6e71be783bf1d) >>
+>>
+endobj
+6053 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [258.164 141.493 281.078 148.053]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+6054 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [295.822 141.493 318.736 148.053]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+6055 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [124.266 124.587 151.364 132.113]
+/A << /S /GoTo /D (structpktype) >>
+>>
+endobj
+6056 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [153.556 124.587 243.419 132.113]
+/A << /S /GoTo /D (tls__x509_8h_a5e369d22599c01a332492a07d08a0f47) >>
+>>
+endobj
+6057 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [245.611 125.553 268.525 132.113]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+6058 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [287.454 125.553 310.368 132.113]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+6059 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [141.003 116.774 214.129 124.143]
+/A << /S /GoTo /D (tls__x509_8h_a782bd259401c3866aab10943cadab704) >>
+>>
+endobj
+6060 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [216.321 117.582 239.235 124.143]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+6061 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [262.348 117.582 285.262 124.143]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+6062 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [141.003 100.676 226.682 108.203]
+/A << /S /GoTo /D (tls__x509_8h_a66695c60281f55b5dc7c4ef8032cbdea) >>
+>>
+endobj
+6063 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [228.873 101.642 251.788 108.203]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+6064 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [124.266 84.736 151.364 92.262]
+/A << /S /GoTo /D (structpktype) >>
+>>
+endobj
+6065 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [153.556 84.736 235.05 92.262]
+/A << /S /GoTo /D (tls__x509_8h_aa4f3b44079b42b4abe5e0699a9f3781a) >>
+>>
+endobj
+6066 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [237.242 85.702 260.156 92.262]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+6067 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [274.901 85.702 297.815 92.262]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+6083 0 obj
+<<
+/D [6081 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+2234 0 obj
+<<
+/D [6081 0 R /XYZ 70.866 771.024 null]
+>>
+endobj
+5923 0 obj
+<<
+/D [6081 0 R /XYZ 116.675 718.641 null]
+>>
+endobj
+2238 0 obj
+<<
+/D [6081 0 R /XYZ 70.866 689.576 null]
+>>
+endobj
+6084 0 obj
+<<
+/D [6081 0 R /XYZ 145.519 613.524 null]
+>>
+endobj
+2242 0 obj
+<<
+/D [6081 0 R /XYZ 70.866 597.054 null]
+>>
+endobj
+6080 0 obj
+<<
+/Font << /F50 2307 0 R /F72 2883 0 R /F43 2258 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+6104 0 obj
+<<
+/Length 2149      
+/Filter /FlateDecode
+>>
+stream
+xÚÕ[ko£Êþî_�T©JªÍd†;ݪ’7Íít7»��ž³JW†q<
ÆNÜJýí}�ÁØ„›Òx¿$0ffž÷yïcƒ¥	K—½OÃÞé…†%Yº®HÉd`dêºdX2Ò‰4t¥û#)Êñ‰l˜Gçgg¿aM�‘TÅDšiÂ:ÉSDSâáÞù°÷¯�Q,‘õj¦‰LY•œYïþ–\øì	#Å2¥§äÉ™¤j
+ÒT®=iÐû[o"4dIG–¡˜›u‚pc"ËÉö°Ò`fOO/o/{Òý‰Žñ}æ4ôÅséú)Îôi¸ÈŸ�?òÕœ¶{ö7
[#X<´>š/ÆsF�tµ5Pþk8ùb¡£Àᶻ=EÆ’‰&�$Ë©¤H¹GÄÔ¤|ÔùP¹n°dmÅ@ºf6/ý¨ÉÇä£YÓ�J:1@9óæ~Ì#Ð'F2<ˆü�ç†òùÌç;¨bÂ|wÄ¢hAÃWë€èRÀ¢H9SbØÙ ŠišQ JQ’ª¥í1—ñ×,14d¨¤‚,µš,Y Ä6Y*>H²¢ÅøŸÔáp%,dW®ÅÛ\‘äSœçQQ5�Èz“QÄ|êv뛵ñ±Ñ3Us“Àõ°f¤
RŸƒ»Žæa0§!ï"Ñh+¤œHµƒDc5/=K¿†:1u±”—7-(™lØ–B(tŠ	R?̨q;ä#×æôõŽh+;˜O:Þti¨/eK-Ðn�ÃôÝç9W]ñ./â¡MP
³H¼\K
ó@õÁ©±À�:uƒ2z©õšÆa³ÕAý#Š¾…õëÚ›úÅ2ï´±¡ÍÄ#ƒ
¤XÔ˜fyUhéi[¶ÇG¾=£Ý¶!†ÅŽô~äLíBcª©H±ôæB6¦gSíñÖj·ŒÒøk‰ø+:…µ¹5’«æwÔwÙdir\Ddd¢Å§1°‰j ™l�“7‹
+G88zÈд Ë±	‹—9šÓD*Ù‚`ùÒ=r*OÄ:˜€•o ×o@LØa8eÑq²×„y4½ÊFæP,¥WÁ$ýϧâ‘~è.˜¤§C‡v¸BÛÐ
+ÁXi
ê,˜¯Bö0»ÇÎ�d�ôV/ßB‘ÞúHŒz^z‘,!d	iDÃ%uËá‘ŸZƒ¯Z*m'ªUÛlOB*È�‚	²Cú1½]‹ô±ýL—E<dãÏT&¨²}÷4T ·;À
VÛ‹/|—†C€ˆ9‹*Œäòæ.½øL£(›yI}ÚBCß’ƒÃ¸F¸Ÿ™9Zìkgö¯M¡ëNnÇ«¾‹5ãÁ¸@R›CÆ æ4±j¶€¹¤aRH¤vŒHqBšâã0w›¯mBŒóhî¶/Äô Úψm›\ÓÚÇô	~½éçÖ,TÅü#Sèú³¡ŒƒÌ,ŸXæðcñÌ"¢“…÷¡^\BZLé’¿^¯¾Þ
E„¹ù.Fû··ý›á÷�>
²tI‹R°ÙÜc™Œ`o¡íóÕÚêѶ	æ_ÎoÏ®OÿÓõçëá÷mó¹¸Þœâæë­E8bÿvx}v÷¹/†¿ÝÝ~û:8‡ˆJäØ?(-ñíúHJÚDú¦È°é"LfòÌ‚Ì_]ÊmæE
æMöŠì¤MdÿžEèÔï	ýNí%͵CÙ2Ó»-‚9ä¸7�›Dß9nz�ÿ�[r†ªàºÂÖ™@í\Ä©§�eéˆÍ¡¶|› ŸÇi�àÚw�¸ÌÂáøØ£—Å“
Þ6É„¼ð‚ ß‚ˆ¯WüÒ€¡ÞÃ'D�ª-¸ôD¨M²†ÖÛô<§åµÞö^VYù‹e¼sùË&�ä…jGiy7ºÕK*“�·�=˜O[m“GY.—RÙ]Jßñ®ØÿO¢ŒDÓ?7È©¾r£_YH›wÑÊ¥lÑÀ:žEíZДó³^îk¤àÿSŽªÅ
×¼$XÝý±|=«úØ#ñùJÜiÏ<|
+b’ŸE±0+¢@ÁÜeU²ëB?°qª÷ÂÔ”†/âÒjŽ…|
!¹áÿm@þLŽ…”Ë»�¼$�+ºù1}`~
+e�í–
sËöƒ&»a7µ|XëNfȬÌön³1
óã–¶çãÕ‹³ìtUÿþG�XúqŠ	ËrmHÍt£|Ø܃•$×—ùÒ
f»RµÞÌ~®ó3ë�¡3�ÓÍ]ˆXó âî{_ªLJ,ûþÇLDìßtT
+Ñ£þŸÖÐQòÔCÞCROsú-dKø÷WºÚ�±ªÈâÅ5ñÎtUñŸæOXYTå
¨É6þ¹™Q»gf0…Æý9˜épÕ({ƒïš-n“NOE#…NÀEýEäSãT^÷
U¥§Z^	«zw
+¥ŽÙ‡<Ym~åRZôAËîG|ÿ¯‡ªX�A)j?е¦j+ü·�ÿ8Éæ‹ð]A€Í>6¸²Ñ¥æ ô[øï;PW4¡Žm¢¦€+ÿV­î4åLm/.èû{hµijp6�Î}'\ÍywEÜØœÇZ
H§\^|é°©â�sw5îÊÕ®ji(?cÒ”Ž›íÁU_ÖôúvOS;ÞôêKÿ¬ÓˆWƒ½ÃN}1�9–3ö.1`Ÿ.¨J ˆf-ê'}£|ZÚ!³Ç^é¹Öeeä»EÆ_ëx!�¯M'šñ¦ü6S÷c«´mî0ÇWj$WˆÙáÁµ;·)ЧÏõ"tX‹$ßq½™�E—ÚדŽ5�懃l�ßÆ1k(—»6Á7"÷z—ÿ».”­Ye/ojé«!;¼»™½Uª#ÙÐÕ�w6U
éð/ÙüRœ¹é«¥ãc­Òë¿Ç
+>z^=Ä¿$„ÌU„ø?ÆZpý
+endstream
+endobj
+6103 0 obj
+<<
+/Type /Page
+/Contents 6104 0 R
+/Resources 6102 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 6106 0 R
+/Annots [ 6068 0 R 6069 0 R 6070 0 R 6071 0 R 6072 0 R 6073 0 R 6074 0 R 6075 0 R 6076 0 R 6077 0 R 6078 0 R 6079 0 R 6085 0 R 6086 0 R 6087 0 R 6088 0 R 6089 0 R 6090 0 R 6091 0 R 6092 0 R 6093 0 R 6094 0 R 6095 0 R 6096 0 R 6097 0 R 6098 0 R 6099 0 R 6100 0 R 6101 0 R ]
+>>
+endobj
+6068 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [124.266 758.991 151.364 766.517]
+/A << /S /GoTo /D (structpktype) >>
+>>
+endobj
+6069 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [153.556 758.991 251.788 766.517]
+/A << /S /GoTo /D (tls__x509_8h_ae95cc4b48cfce918f4410032436b0953) >>
+>>
+endobj
+6070 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [253.979 759.957 276.893 766.517]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+6071 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [295.822 759.957 318.736 766.517]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+6072 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [141.003 751.178 209.944 758.547]
+/A << /S /GoTo /D (tls__x509_8h_a4ea66d8861556e4cb5494fedcae31e09) >>
+>>
+endobj
+6073 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [212.136 751.987 235.05 758.547]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+6074 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [141.003 743.051 218.313 750.577]
+/A << /S /GoTo /D (tls__x509_8h_a63098f816389dc75a1f6a65ee054a622) >>
+>>
+endobj
+6075 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [220.505 744.016 243.419 750.577]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+6076 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [141.003 735.08 214.129 742.607]
+/A << /S /GoTo /D (tls__x509_8h_abf031319593095cab51fce85367b5c84) >>
+>>
+endobj
+6077 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [216.321 736.046 239.235 742.607]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+6078 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [141.003 719.14 209.944 726.666]
+/A << /S /GoTo /D (tls__x509_8h_a18ffa7f3ffe42d28ef6e9264fae10f69) >>
+>>
+endobj
+6079 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [212.136 720.106 235.05 726.666]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+6085 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [141.003 703.2 247.603 710.726]
+/A << /S /GoTo /D (tls__x509_8h_a30c58503b1c92df4b7164ae795b56d1b) >>
+>>
+endobj
+6086 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [249.795 704.166 272.709 710.726]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+6087 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [291.638 704.166 314.552 710.726]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+6088 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [141.003 695.387 226.682 702.756]
+/A << /S /GoTo /D (tls__x509_8h_a3a434044d9c3a7c32547906e7deea086) >>
+>>
+endobj
+6089 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [228.873 696.196 251.788 702.756]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+6090 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [141.003 687.26 230.866 694.786]
+/A << /S /GoTo /D (tls__x509_8h_a3ae4aa6c7903bd00fc86312f4676d675) >>
+>>
+endobj
+6091 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [233.058 688.226 255.972 694.786]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+6092 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [141.003 671.476 226.682 678.846]
+/A << /S /GoTo /D (tls__x509_8h_ae05d7020ae2dac500d00452e36bc4b8d) >>
+>>
+endobj
+6093 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [228.873 672.285 251.788 678.846]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+6094 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [141.003 663.506 222.497 670.876]
+/A << /S /GoTo /D (tls__x509_8h_a08072852023e718409b709916f4478cd) >>
+>>
+endobj
+6095 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [224.689 664.315 247.603 670.876]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+6096 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [266.532 664.315 289.446 670.876]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+6097 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [141.003 647.566 218.313 654.935]
+/A << /S /GoTo /D (tls__x509_8h_a57a0487efa9bf85e480c13eb64e3a0d9) >>
+>>
+endobj
+6098 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [220.505 648.375 243.419 654.935]
+/A << /S /GoTo /D (structoctad) >>
+>>
+endobj
+6099 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [120.082 367.216 168.101 373.776]
+/A << /S /GoTo /D (class_e_c_c_x08_class) >>
+>>
+endobj
+6100 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.344 343.305 151.364 349.866]
+/A << /S /GoTo /D (class_e_c_c_x08_class) >>
+>>
+endobj
+6101 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [136.819 335.335 189.023 341.896]
+/A << /S /GoTo /D (class_e_c_c_x08_class) >>
+>>
+endobj
+6105 0 obj
+<<
+/D [6103 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+3044 0 obj
+<<
+/D [6103 0 R /XYZ 70.866 633.316 null]
+>>
+endobj
+2246 0 obj
+<<
+/D [6103 0 R /XYZ 70.866 616.903 null]
+>>
+endobj
+6102 0 obj
+<<
+/Font << /F50 2307 0 R /F72 2883 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+6110 0 obj
+<<
+/Length 939       
+/Filter /FlateDecode
+>>
+stream
+xÚÕX[oÛ6~ׯ °{¨9’/Z±—eM€"è°ÖÃxA H´'D–\JNêýï¥.¶%‡’ƒ­ÑKò!yÎw®$€À•óûÔùå’"  Ï˜¦sÀŒ
îÈ0˜F`6ÂÔßLßW�¹Ó+òeœÈñ„p1ú#×K™Agi9Õy3u>:XÏDïX
+
ñ@¸tf7Dzì-Ð}
«™KàQRÏÕß	øàüå 6LNƒ>wE&Ãmq"„X…ÔÑ\…fM¨~`ýTpHzå€Ù„FqZÔ«išÎ49ÉÂ{ý‡(Ò?üº2
®1ìåQ{òU\È‹,�Ç‹µªLYÊnf"¨U|›ÏŠß(ÌÒ¼ËìÙPJ‘w›Bš DAÌnÔföÔV2ˆz´~&ûÓÕàv£åH¬ˆ6¹³þ �+î+?O”ýjÄ‘Å îåz5¬Çöä剔ÇÄ{ââ(‘G¤¹fò)…&ÉÒ…	ŃTyø@,–-0žoÎV^òx‘ÅZÉÙÍ«ã±ÿ�@¬Öw÷r3T¸Å*WªüòÂÖ›$YñêeØžéŽ
cpsõâÂîV`ÍHŸ³Tž`¤nA)™ç­~·žÏ¥Úe€Œ‰LÅÿ.ô-V~_�¡´|×
+dÿ$cͳ°±™lq‡o‚á2StÕüs>ÏeqîBÜÃ-Û‚ë³–ù(",Þyr™êÃør¤U!^ëiâ¶×ðVaé4­þtFV�
+–¸5‚Ygˆœ/ë+@�å·úõîïë뜖ǟåí�Ñ…±¶?Jy×U²vd¶Îu“§‹J'R›Ûh(ãù^æ+mÔªôCG]ÆØu¡Ðõ	†„4›ÿÏ•:ºÌ-²jÄZ2±¹þM°G aüð4"Ø�cF³»FìÓx¯0×JtÓ.T!fgn|ÓxR…™lûní£ÆÞÓÇìŸXU«#�3jöªhyõöQ¯hÜÉ1ÔÑpÈ·¼¹+¯·ÍfÖÜ'f²;¬y%&/[va7^V¤›�¯Kv€ë®Á¥’×2
7=À½3"L3µ3Â}9ñi=ýK�ÌLæǃN~*¤Jõ¸™­?ösß\\ü‹ÄEä¹I³z¸¡9-üíM€n“q—šÊÃOú`ÏðÖoS¯—Rˆ\ü’Vï¶Í áÌ+[¼õ ¥ž~C¦YVدd*•NÖ¨n<ß�	m¶M豋FŸ6�BÚ¾]ÛjŒ_
½¨E`
+endstream
+endobj
+6109 0 obj
+<<
+/Type /Page
+/Contents 6110 0 R
+/Resources 6108 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 6106 0 R
+/Annots [ 6107 0 R ]
+>>
+endobj
+6107 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [124.266 488.973 172.286 495.533]
+/A << /S /GoTo /D (class_e_c_c_x08_class) >>
+>>
+endobj
+6111 0 obj
+<<
+/D [6109 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+6108 0 obj
+<<
+/Font << /F50 2307 0 R /F72 2883 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+6163 0 obj
+<<
+/Length 986       
+/Filter /FlateDecode
+>>
+stream
+xÚÅY]s¢H}÷Wô£T­Ló
�eb�
œÝ©ÌTBÇXcÄœ‰ÿ~ºÅ$®›hÏ€æÅÆúœ{îíÓ·‚€`Ð�‡£(kì’
ƒÎUÜùàê�eQ�¦â;`@ÑÔu:h¢*é ÎÀm×[fD�¤î£ð-þø¿)?¸ªLÑÒu…MAOƒ"´äúÙ$­æ?Yëö0�,Ñ¢Ð=I-M«oI¡§ÀîfUåí �@Á¦gá n{²av%å?è4¯L—d™=
+|ôX½‰X-Jœ.ædYá’,3ñþ®)óá:Û9ÃD�a÷g°ž²q1O¯Òøé—M{”¤c”ôJyþ}NZCå%4¯’Ö]lúI•¼ƒ=Ý£û¤x]ý¼%qãŽÞ£:çËÙÅe
vó²F¶@×õººoOu^
+Ùf|¿ÚLƒaqòˆ®oòŒ”­–§	†Ñ¨Õ‚ç„�Hmçµé~òЮûÀ?¢qOæå6ŸÙ‹Yé0Š”EÕjš¤ßâÐjjx¡×«U¾�dƒ"_¯ÊË•ÈËÖøY0i	å<_^~}ÎΧwë2M*ªÅ›Øó”•èwöAªÀ2�þö…Ì•ãcñJX9¦jò¨¼xªq|Wä8MÖ%iMir<³€ÿƹ8ò>ê7
^Ñyr¼X-ß"—UR­ËS-¯Î!³8Y‘Œ™­ÅìcìŒG�slð#ϱ‰ÂÇÞØõ�dMuÚ¡ˆ¦j¶XjO4X×1‰‡È�÷Ù`—­rÛMBÔTí­&Ó¹¤]LWv;»5†�¡íù�ayÊ|ÖsŸ@Ç6.p•|hûýhh_7WYáEDliŸ+§‡h7(ªûÙAsMy#‘3û±†Ã7Û0�Æ°7ì'A¢kE1ž}f^­U/¯ÒÔ3®Q|¥§I’r•/ùv‚¤?˜…�>“(;Å•ë]!ì86î#'d–ù%86ž~…Pž�žäORйÌâ™òÏ@�'ãÓù®+¹o©ó’9¤ßž<6i\dÇ.DÕõë^»ã‰ßÜCxþwH“ô©Ý+�—öËm\9åÙÿŸ÷Üñ¤îÜNÒ¦ú
‡=Kk܃Y¿ügzî—÷À|n´Î»ÿ(}¼Õ9cÔûÀýxaóSW¯E[J@ýÓ†”Êþý(îüÛ‘v³îþÇ×4*H:·ß ÈèO
Ë?·7>USDMUèõD�Oõ;

]”
]Ý{% j¢®ïä�%)zz¶Äkk«¯û9Óçq3zt�å!Å_ÞË7
+endstream
+endobj
+6162 0 obj
+<<
+/Type /Page
+/Contents 6163 0 R
+/Resources 6161 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 6106 0 R
+/Annots [ 6112 0 R 6113 0 R 6114 0 R 6115 0 R 6116 0 R 6117 0 R 6118 0 R 6119 0 R 6120 0 R 6121 0 R 6122 0 R 6123 0 R 6124 0 R 6125 0 R 6126 0 R 6127 0 R 6128 0 R 6129 0 R 6130 0 R 6131 0 R 6132 0 R 6133 0 R 6134 0 R 6135 0 R 6136 0 R 6137 0 R 6138 0 R 6139 0 R 6140 0 R 6141 0 R 6142 0 R 6143 0 R 6144 0 R 6145 0 R 6146 0 R 6147 0 R 6148 0 R 6149 0 R 6150 0 R 6151 0 R 6152 0 R 6153 0 R 6154 0 R 6155 0 R 6156 0 R 6157 0 R 6158 0 R 6159 0 R ]
+>>
+endobj
+6112 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.464 640.486 131.427 650.754]
+/A << /S /GoTo /D (page.13) >>
+>>
+endobj
+6113 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [161.561 617.136 173.523 626.844]
+/A << /S /GoTo /D (page.82) >>
+>>
+endobj
+6114 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [161.561 593.225 173.523 602.933]
+/A << /S /GoTo /D (page.81) >>
+>>
+endobj
+6115 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [161.561 569.315 173.523 579.023]
+/A << /S /GoTo /D (page.84) >>
+>>
+endobj
+6116 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [161.561 545.405 173.523 555.113]
+/A << /S /GoTo /D (page.84) >>
+>>
+endobj
+6117 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [161.561 521.494 173.523 531.202]
+/A << /S /GoTo /D (page.82) >>
+>>
+endobj
+6118 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [161.561 497.584 173.523 507.292]
+/A << /S /GoTo /D (page.82) >>
+>>
+endobj
+6119 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [161.561 473.674 173.523 483.382]
+/A << /S /GoTo /D (page.84) >>
+>>
+endobj
+6120 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [161.561 449.763 173.523 459.471]
+/A << /S /GoTo /D (page.84) >>
+>>
+endobj
+6121 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [161.561 425.853 173.523 435.561]
+/A << /S /GoTo /D (page.79) >>
+>>
+endobj
+6122 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [161.561 401.943 173.523 411.651]
+/A << /S /GoTo /D (page.83) >>
+>>
+endobj
+6123 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [161.561 378.032 173.523 387.74]
+/A << /S /GoTo /D (page.83) >>
+>>
+endobj
+6124 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [161.561 354.122 173.523 363.83]
+/A << /S /GoTo /D (page.80) >>
+>>
+endobj
+6125 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [161.561 330.212 173.523 339.92]
+/A << /S /GoTo /D (page.80) >>
+>>
+endobj
+6126 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [161.561 306.301 173.523 316.009]
+/A << /S /GoTo /D (page.81) >>
+>>
+endobj
+6127 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [161.561 282.391 173.523 292.099]
+/A << /S /GoTo /D (page.81) >>
+>>
+endobj
+6128 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [161.561 258.481 173.523 268.189]
+/A << /S /GoTo /D (page.80) >>
+>>
+endobj
+6129 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [161.561 234.57 173.523 244.278]
+/A << /S /GoTo /D (page.83) >>
+>>
+endobj
+6130 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [115.349 210.66 127.312 220.368]
+/A << /S /GoTo /D (page.21) >>
+>>
+endobj
+6131 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.18 186.75 138.143 196.458]
+/A << /S /GoTo /D (page.48) >>
+>>
+endobj
+6132 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [161.561 162.839 173.523 172.547]
+/A << /S /GoTo /D (page.90) >>
+>>
+endobj
+6133 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.18 138.929 138.143 148.637]
+/A << /S /GoTo /D (page.36) >>
+>>
+endobj
+6134 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.658 115.019 145.621 124.727]
+/A << /S /GoTo /D (page.16) >>
+>>
+endobj
+6135 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.18 91.108 138.143 100.816]
+/A << /S /GoTo /D (page.47) >>
+>>
+endobj
+6136 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 653.001 369.896 662.709]
+/A << /S /GoTo /D (page.48) >>
+>>
+endobj
+6137 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 629.091 369.896 638.799]
+/A << /S /GoTo /D (page.51) >>
+>>
+endobj
+6138 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 595.218 369.896 604.926]
+/A << /S /GoTo /D (page.50) >>
+>>
+endobj
+6139 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 571.308 369.896 581.015]
+/A << /S /GoTo /D (page.54) >>
+>>
+endobj
+6140 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 547.397 369.896 557.105]
+/A << /S /GoTo /D (page.53) >>
+>>
+endobj
+6141 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 523.487 369.896 533.195]
+/A << /S /GoTo /D (page.51) >>
+>>
+endobj
+6142 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 499.577 369.896 509.284]
+/A << /S /GoTo /D (page.53) >>
+>>
+endobj
+6143 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 475.666 369.896 485.374]
+/A << /S /GoTo /D (page.51) >>
+>>
+endobj
+6144 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 451.756 369.896 461.464]
+/A << /S /GoTo /D (page.55) >>
+>>
+endobj
+6145 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 427.846 369.896 437.553]
+/A << /S /GoTo /D (page.53) >>
+>>
+endobj
+6146 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 403.935 369.896 413.643]
+/A << /S /GoTo /D (page.51) >>
+>>
+endobj
+6147 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [390.095 380.025 402.058 389.733]
+/A << /S /GoTo /D (page.73) >>
+>>
+endobj
+6148 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [367.267 356.114 379.23 366.029]
+/A << /S /GoTo /D (page.64) >>
+>>
+endobj
+6149 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [367.267 332.204 379.23 342.118]
+/A << /S /GoTo /D (page.63) >>
+>>
+endobj
+6150 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [347.102 308.294 359.065 318.002]
+/A << /S /GoTo /D (page.22) >>
+>>
+endobj
+6151 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 284.383 369.896 294.091]
+/A << /S /GoTo /D (page.57) >>
+>>
+endobj
+6152 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 250.511 369.896 260.218]
+/A << /S /GoTo /D (page.52) >>
+>>
+endobj
+6153 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [367.616 226.6 379.579 236.308]
+/A << /S /GoTo /D (page.68) >>
+>>
+endobj
+6154 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 202.69 369.896 212.398]
+/A << /S /GoTo /D (page.52) >>
+>>
+endobj
+6155 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 178.779 369.896 188.487]
+/A << /S /GoTo /D (page.49) >>
+>>
+endobj
+6156 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 154.869 369.896 164.577]
+/A << /S /GoTo /D (page.49) >>
+>>
+endobj
+6157 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 130.959 369.896 140.667]
+/A << /S /GoTo /D (page.53) >>
+>>
+endobj
+6158 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 107.048 369.896 116.756]
+/A << /S /GoTo /D (page.49) >>
+>>
+endobj
+6159 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 83.138 369.896 92.846]
+/A << /S /GoTo /D (page.54) >>
+>>
+endobj
+6164 0 obj
+<<
+/D [6162 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+2250 0 obj
+<<
+/D [6162 0 R /XYZ 70.866 665.287 null]
+>>
+endobj
+6161 0 obj
+<<
+/Font << /F67 2878 0 R /F43 2258 0 R /F50 2307 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+6233 0 obj
+<<
+/Length 1159      
+/Filter /FlateDecode
+>>
+stream
+xÚÍY[s¢H~÷Wð(U¶¹4£�„‰£Y ©XÙ©.:JÅ $ÿý6MÌ(4Aœ¼ˆ\ú|_Ÿ>×nÀÍ8À]ôþr{žCÀi‚®ª2ç>p hªÊ
tIPEÎ
¸û¾Uþ‡û�S$U™Ì[cÝe/zÈíý×ésÀ‰[
š&h’ÂùO½û€è»od]ã~æ_>q
+”˜Ë[pNïïxOŠ>#¥a SѪ(€
«t‘ˆXæä
+ìxV’°/zÜý™4ÐúŠV¾/dsg¢.è¤WQÐ!,dùsâóè?:$æÏdÐá%Ø'±‘Ý* Ÿs/Œr%ìN©`ó)ö³oky©°Š—ÊÈë–×@?»a?ü‰þ¯bù˜I#ÙÏšRö~-O]o¢¿>¼œÝ˜^êýRájNbœ<‡)9ŒÄs
+i
¬$í‚ÝÕrGNH’„˨N�ÂÌßÉè'Õ¦·I”Rè(¨Õœ��‘…Æ.6��­ [Î₲Ú»Ókô+°Ú�ïÚ{óßt½:l/G^ãrÖ—h4š´U³¢3ÏÖö¢`ùT¥Þ.Œjâ <žðTÉ®u>m;]È
+zc#<mìÊF²n‘Ù^fˆßÆdre¡Ö;`Yؘx)1òU;az
`'Wä°õ*]ˈezóš;50åÕœ�Mü—ÓpR™uäPûJœ¶Lêìàƒ;ì“æùiX0
…}ȳÖmÝxeÿø’GøÒnüU»á�Ÿœ}9<&þ2ÚQÈk¢OŠØäo¶ QCûc´ÍCП^»Yf˜`¹®5¾8MÑá:ÇÈôL!'M:‡ÚÎêîPL
"}íj£Àç÷-ÐAÔÕcV¿ÕÙå¡ÂP¢�&(%™È˜˜#ÛÎâêÄÞ²*AQP§ÒUÔÖ,îAild—K›Ê˜	9ØT…ʇ«Õ"ô½”®§Ch¶J“c§$­9)ä·‹uGœ¦ù�Ó%­®“¹W€ýZûU5¢åEüuèܬJ(¸Ê¢~	vR{Ú¿v_iôF–{iÝ|—ZwJ#8|-•[~�aª0åÓLqÄ‹bÖ:NëúV¥�rzhhSDjàSlfv>äE)ÛPÉ~‡'iÉ6>â ÊŒ	ÁIê¥ÏI]æd©
+�at©á÷D¡î€VߦÂꢺc,¼¤V
°F�éi
kd.d‹Ø¹×d&­ÿ-kJë=´fбºƒY?H<œ„3ÐÆ( •�ú½ÞVâ’h?®Ú	.2%Eý$á’9(@†æ±ŠÆPÊ>)¬\•'ï?Ä<MÞÓFv–ÎÛ±KvOhpä=‘£ÄÒï×îôm[ܸZãÖ{—ðxÛw £;�k2vºÝ¦Þ„õ±‰'ç¸Óü	Yv.I¸;GD¬;r»K	O
·>È,‰ãƒÁ&®=Ãõ½}ì¾#\ ‹MNp7Çɪ 
T%;¹U "@¨Ð« ª%É‘8«ýùœÑ¿yá\ü7—¹j×3êéToÑWÊñ

$
+endstream
+endobj
+6232 0 obj
+<<
+/Type /Page
+/Contents 6233 0 R
+/Resources 6231 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 6106 0 R
+/Annots [ 6160 0 R 6165 0 R 6166 0 R 6167 0 R 6168 0 R 6169 0 R 6170 0 R 6171 0 R 6172 0 R 6173 0 R 6174 0 R 6175 0 R 6176 0 R 6177 0 R 6178 0 R 6179 0 R 6180 0 R 6181 0 R 6182 0 R 6183 0 R 6184 0 R 6185 0 R 6186 0 R 6187 0 R 6188 0 R 6189 0 R 6190 0 R 6191 0 R 6192 0 R 6193 0 R 6194 0 R 6195 0 R 6196 0 R 6197 0 R 6198 0 R 6199 0 R 6200 0 R 6201 0 R 6202 0 R 6203 0 R 6204 0 R 6205 0 R 6206 0 R 6207 0 R 6208 0 R 6209 0 R 6210 0 R 6211 0 R 6212 0 R 6213 0 R 6214 0 R 6215 0 R 6216 0 R 6217 0 R 6218 0 R 6219 0 R 6220 0 R 6221 0 R 6222 0 R 6223 0 R 6224 0 R 6225 0 R 6226 0 R 6227 0 R 6228 0 R 6229 0 R 6230 0 R ]
+>>
+endobj
+6160 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.18 758.738 138.143 768.446]
+/A << /S /GoTo /D (page.48) >>
+>>
+endobj
+6165 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.929 734.827 169.892 744.535]
+/A << /S /GoTo /D (page.65) >>
+>>
+endobj
+6166 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [155.213 710.357 167.176 720.625]
+/A << /S /GoTo /D (page.99) >>
+>>
+endobj
+6167 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [155.213 686.446 167.176 696.715]
+/A << /S /GoTo /D (page.99) >>
+>>
+endobj
+6168 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [115.349 663.096 127.312 672.804]
+/A << /S /GoTo /D (page.22) >>
+>>
+endobj
+6169 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.605 651.141 158.568 661.055]
+/A << /S /GoTo /D (page.24) >>
+>>
+endobj
+6170 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [161.561 627.231 173.523 636.939]
+/A << /S /GoTo /D (page.85) >>
+>>
+endobj
+6171 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.18 603.321 138.143 613.029]
+/A << /S /GoTo /D (page.36) >>
+>>
+endobj
+6172 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.18 579.41 138.143 589.118]
+/A << /S /GoTo /D (page.48) >>
+>>
+endobj
+6173 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.605 555.5 158.568 565.414]
+/A << /S /GoTo /D (page.24) >>
+>>
+endobj
+6174 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.18 531.59 138.143 541.297]
+/A << /S /GoTo /D (page.49) >>
+>>
+endobj
+6175 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [161.561 507.679 173.523 517.387]
+/A << /S /GoTo /D (page.85) >>
+>>
+endobj
+6176 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.18 483.769 138.143 493.477]
+/A << /S /GoTo /D (page.55) >>
+>>
+endobj
+6177 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.18 459.859 138.143 469.566]
+/A << /S /GoTo /D (page.53) >>
+>>
+endobj
+6178 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.18 435.948 138.143 445.656]
+/A << /S /GoTo /D (page.47) >>
+>>
+endobj
+6179 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [155.213 411.478 172.161 421.746]
+/A << /S /GoTo /D (page.100) >>
+>>
+endobj
+6180 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [155.213 387.567 167.176 397.835]
+/A << /S /GoTo /D (page.95) >>
+>>
+endobj
+6181 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [155.213 363.657 167.176 373.925]
+/A << /S /GoTo /D (page.96) >>
+>>
+endobj
+6182 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [155.213 339.747 167.176 350.015]
+/A << /S /GoTo /D (page.96) >>
+>>
+endobj
+6183 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [99.539 327.791 111.502 338.06]
+/A << /S /GoTo /D (page.13) >>
+>>
+endobj
+6184 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [117.976 316.397 129.939 326.104]
+/A << /S /GoTo /D (page.13) >>
+>>
+endobj
+6185 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.253 304.441 115.216 314.149]
+/A << /S /GoTo /D (page.14) >>
+>>
+endobj
+6186 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [101.254 292.486 113.217 302.194]
+/A << /S /GoTo /D (page.14) >>
+>>
+endobj
+6187 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [100.761 280.531 112.724 290.239]
+/A << /S /GoTo /D (page.14) >>
+>>
+endobj
+6188 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [99.263 268.576 111.226 278.284]
+/A << /S /GoTo /D (page.13) >>
+>>
+endobj
+6189 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [120.191 256.621 132.153 266.329]
+/A << /S /GoTo /D (page.14) >>
+>>
+endobj
+6190 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.717 244.665 125.68 254.373]
+/A << /S /GoTo /D (page.14) >>
+>>
+endobj
+6191 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.204 232.042 131.167 242.418]
+/A << /S /GoTo /D (page.14) >>
+>>
+endobj
+6192 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.18 208.8 138.143 218.508]
+/A << /S /GoTo /D (page.36) >>
+>>
+endobj
+6193 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.605 184.89 158.568 194.804]
+/A << /S /GoTo /D (page.25) >>
+>>
+endobj
+6194 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.605 160.979 158.568 170.894]
+/A << /S /GoTo /D (page.25) >>
+>>
+endobj
+6195 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.605 137.069 158.568 146.983]
+/A << /S /GoTo /D (page.26) >>
+>>
+endobj
+6196 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.605 113.159 158.568 123.073]
+/A << /S /GoTo /D (page.26) >>
+>>
+endobj
+6197 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [121.195 88.688 133.158 98.956]
+/A << /S /GoTo /D (page.18) >>
+>>
+endobj
+6198 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 758.738 369.896 768.446]
+/A << /S /GoTo /D (page.54) >>
+>>
+endobj
+6199 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 734.827 369.896 744.535]
+/A << /S /GoTo /D (page.54) >>
+>>
+endobj
+6200 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [386.966 710.357 398.929 720.625]
+/A << /S /GoTo /D (page.98) >>
+>>
+endobj
+6201 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [386.966 686.446 398.929 696.715]
+/A << /S /GoTo /D (page.97) >>
+>>
+endobj
+6202 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [386.966 662.536 398.929 672.804]
+/A << /S /GoTo /D (page.97) >>
+>>
+endobj
+6203 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [386.966 638.626 398.929 648.894]
+/A << /S /GoTo /D (page.97) >>
+>>
+endobj
+6204 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [386.966 614.715 398.929 624.984]
+/A << /S /GoTo /D (page.98) >>
+>>
+endobj
+6205 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [386.966 590.805 398.929 601.073]
+/A << /S /GoTo /D (page.99) >>
+>>
+endobj
+6206 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 567.455 369.896 577.163]
+/A << /S /GoTo /D (page.44) >>
+>>
+endobj
+6207 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 543.545 369.896 553.253]
+/A << /S /GoTo /D (page.44) >>
+>>
+endobj
+6208 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 519.634 369.896 529.342]
+/A << /S /GoTo /D (page.44) >>
+>>
+endobj
+6209 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 495.724 369.896 505.432]
+/A << /S /GoTo /D (page.35) >>
+>>
+endobj
+6210 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 463.063 369.896 472.771]
+/A << /S /GoTo /D (page.47) >>
+>>
+endobj
+6211 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [365.411 439.153 377.374 448.861]
+/A << /S /GoTo /D (page.16) >>
+>>
+endobj
+6212 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 415.243 369.896 424.951]
+/A << /S /GoTo /D (page.35) >>
+>>
+endobj
+6213 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [348.964 403.288 365.912 413.202]
+/A << /S /GoTo /D (page.153) >>
+>>
+endobj
+6214 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [363.902 391.332 375.865 401.247]
+/A << /S /GoTo /D (page.15) >>
+>>
+endobj
+6215 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 367.422 369.896 377.13]
+/A << /S /GoTo /D (page.43) >>
+>>
+endobj
+6216 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 343.512 369.896 353.22]
+/A << /S /GoTo /D (page.43) >>
+>>
+endobj
+6217 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 319.601 369.896 329.309]
+/A << /S /GoTo /D (page.43) >>
+>>
+endobj
+6218 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [367.401 295.691 384.349 305.399]
+/A << /S /GoTo /D (page.143) >>
+>>
+endobj
+6219 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [367.401 271.781 384.349 281.489]
+/A << /S /GoTo /D (page.143) >>
+>>
+endobj
+6220 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 247.87 369.896 257.578]
+/A << /S /GoTo /D (page.44) >>
+>>
+endobj
+6221 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.485 235.915 357.448 245.623]
+/A << /S /GoTo /D (page.15) >>
+>>
+endobj
+6222 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [343.479 223.4 355.442 233.668]
+/A << /S /GoTo /D (page.16) >>
+>>
+endobj
+6223 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [368.531 211.445 380.494 221.713]
+/A << /S /GoTo /D (page.16) >>
+>>
+endobj
+6224 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [393.224 199.382 405.187 209.964]
+/A << /S /GoTo /D (page.16) >>
+>>
+endobj
+6225 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [378.896 188.095 390.859 197.803]
+/A << /S /GoTo /D (page.16) >>
+>>
+endobj
+6226 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 164.184 369.896 173.892]
+/A << /S /GoTo /D (page.52) >>
+>>
+endobj
+6227 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 140.274 369.896 149.982]
+/A << /S /GoTo /D (page.49) >>
+>>
+endobj
+6228 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 116.364 369.896 126.072]
+/A << /S /GoTo /D (page.50) >>
+>>
+endobj
+6229 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [372.88 92.453 389.828 102.161]
+/A << /S /GoTo /D (page.138) >>
+>>
+endobj
+6230 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [336.997 68.543 348.96 78.251]
+/A << /S /GoTo /D (page.19) >>
+>>
+endobj
+6234 0 obj
+<<
+/D [6232 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+6231 0 obj
+<<
+/Font << /F50 2307 0 R /F43 2258 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+6294 0 obj
+<<
+/Length 1087      
+/Filter /FlateDecode
+>>
+stream
+xÚÍY[s¢H~÷Wô£TmØæÖࣗV�º@2Ie§(Z¥bÀ
ÌŽÿ~»�$ºµ' ÙJ¡9ß×ç~‚A£ã4þìkb!8s CÑ@è-YDpðÐ4'=|'|s¾U1DÍ0è«ùIÓÙív?½�ô*À0DCV�ÿÔxøA@Ÿ}
PTZø'_ùTM5U¡¿WÀnüÕ€»¤èý÷¤�$ÂVز6§–ÛcKP`Óq-ÜÅæ-îåd¥–Ø’5p%IbKÓŠ—²U*¹Š¸ü#ç]N%skÐW²n45¹|^¢2JY2•%…¬9Ãô‡gAÖšñ&®$­fÄ]l&ñf}˜Hè³7Ù…d'èÈÿ¡÷e9cÛMIš†qtJ�z`_¹8Tˆë›ÓVW¢Ú:VÊêO­ŽÙëቋï<±Íéä"Æ[�¬³ÍÈ1,7�wm”
+Ô¸'Á%EãØu‰žž
^á°0…ïê­*¤~ø7„²ïeÄ"?6$ÍŽRòW!‰27!þ³`ÀÓttħŒî’{µ-¥Œ(’¼gÙ]zaô9s¹³2Ès‚”ÏH ôã¾e/
+^9sP}YêúlíIªñ׌2	�Á·T>MQø"Ñ|üŒÙÄ‚„æÄ3Ð�ùŒ0õ3/ø¼ür(’nYP�Ò‹çÛzCIý7ùÅÿí:#
þ™‘ˆÕ²_Ø]œ[?ŒÂtI‚zõô1ÉjÿˆXÄ�“ ^óHœLÂ+TaBž¨ü”/½ò…Ò9ú†a{Ò³‡ívûl_ms|cáÊ�Þ�-ìX‚›÷•q!îÒK—M½~̶kr*g<0qšEÞÓᎬ®.÷E�vH<†[Nd5#
sÿ¨Ü·s™‹Ùý Ò&
+™ÛœÚ“ÎQI‡_ÝýÔðº\Ö$é@†.ª²ò[{<^Eß åªÊä*×ÃûŽkÛ—‚²ÌÊ£�Â3GPî讲C*‰Ùì°™û¦ß¯#¬yF‚ð;ëÛ6óùŃ³çÆÒrÔjצ}Ý$ºC§;¼H�1Çc<h�ÝYŽÚ¶Ú×ØÁVeh…G³´
Íû‰îkwã(#ì„ççñ‘¸èÞó
�vÞÊ?I©Å“{hÛy!6*—‚ÂÌÙ;±â%´ÎÅ;㼜r_IXä{Qê—SÍ:ëY>¨'™Ç‡§n{6›Ý2tj8ÍR>Ü.à༹ý
p2�àc:®ss³â¨—Íõ»L»Óñ¥ûÕ¬Þàóéôö :ßæãøTìp…óóÁ
Õ€´[•GçÚ÷X�GŒŠ™¶†Ž^åBKI\j&á{—ŽÕý]å9¨dh7³‹ç2]â‹4£û¶td\¤-]‘hoÕ¯>•išéw¾”½|¶C¢¬#u癪‰•ú�ˆ$^F!§û½8¤Î÷â¼to´`Ò:øŽâ¿ìS’k
+endstream
+endobj
+6293 0 obj
+<<
+/Type /Page
+/Contents 6294 0 R
+/Resources 6292 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 6106 0 R
+/Annots [ 6235 0 R 6236 0 R 6237 0 R 6238 0 R 6239 0 R 6240 0 R 6241 0 R 6242 0 R 6243 0 R 6244 0 R 6245 0 R 6246 0 R 6247 0 R 6248 0 R 6249 0 R 6250 0 R 6251 0 R 6252 0 R 6253 0 R 6254 0 R 6255 0 R 6256 0 R 6257 0 R 6258 0 R 6259 0 R 6260 0 R 6261 0 R 6262 0 R 6263 0 R 6264 0 R 6265 0 R 6266 0 R 6267 0 R 6268 0 R 6269 0 R 6270 0 R 6271 0 R 6272 0 R 6273 0 R 6274 0 R 6275 0 R 6276 0 R 6277 0 R 6278 0 R 6279 0 R 6280 0 R 6281 0 R 6282 0 R 6283 0 R 6284 0 R 6285 0 R 6286 0 R 6287 0 R 6288 0 R 6289 0 R 6290 0 R ]
+>>
+endobj
+6235 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.18 746.783 138.143 756.491]
+/A << /S /GoTo /D (page.52) >>
+>>
+endobj
+6236 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [115.349 712.91 127.312 722.618]
+/A << /S /GoTo /D (page.22) >>
+>>
+endobj
+6237 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.605 700.954 158.568 710.869]
+/A << /S /GoTo /D (page.24) >>
+>>
+endobj
+6238 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.18 677.044 138.143 686.752]
+/A << /S /GoTo /D (page.49) >>
+>>
+endobj
+6239 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.18 653.134 138.143 662.842]
+/A << /S /GoTo /D (page.52) >>
+>>
+endobj
+6240 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.112 619.261 163.06 628.969]
+/A << /S /GoTo /D (page.135) >>
+>>
+endobj
+6241 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.112 595.35 163.06 605.058]
+/A << /S /GoTo /D (page.133) >>
+>>
+endobj
+6242 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [158.342 571.44 170.305 581.148]
+/A << /S /GoTo /D (page.76) >>
+>>
+endobj
+6243 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [158.342 547.53 170.305 557.238]
+/A << /S /GoTo /D (page.76) >>
+>>
+endobj
+6244 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.929 523.619 169.892 533.327]
+/A << /S /GoTo /D (page.66) >>
+>>
+endobj
+6245 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.112 499.709 163.06 509.417]
+/A << /S /GoTo /D (page.134) >>
+>>
+endobj
+6246 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.112 475.799 163.06 485.507]
+/A << /S /GoTo /D (page.134) >>
+>>
+endobj
+6247 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.112 451.888 163.06 461.596]
+/A << /S /GoTo /D (page.132) >>
+>>
+endobj
+6248 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.112 427.978 163.06 437.686]
+/A << /S /GoTo /D (page.135) >>
+>>
+endobj
+6249 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [158.342 404.068 170.305 413.776]
+/A << /S /GoTo /D (page.74) >>
+>>
+endobj
+6250 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [158.342 380.157 170.305 389.865]
+/A << /S /GoTo /D (page.74) >>
+>>
+endobj
+6251 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [158.342 356.247 170.305 365.955]
+/A << /S /GoTo /D (page.75) >>
+>>
+endobj
+6252 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [158.342 332.337 170.305 342.045]
+/A << /S /GoTo /D (page.75) >>
+>>
+endobj
+6253 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [158.342 308.426 170.305 318.134]
+/A << /S /GoTo /D (page.71) >>
+>>
+endobj
+6254 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.863 284.516 147.826 294.224]
+/A << /S /GoTo /D (page.67) >>
+>>
+endobj
+6255 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.18 250.643 138.143 260.351]
+/A << /S /GoTo /D (page.55) >>
+>>
+endobj
+6256 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.18 226.733 138.143 236.441]
+/A << /S /GoTo /D (page.50) >>
+>>
+endobj
+6257 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [121.195 202.262 133.158 212.53]
+/A << /S /GoTo /D (page.18) >>
+>>
+endobj
+6258 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.605 178.912 158.568 188.826]
+/A << /S /GoTo /D (page.24) >>
+>>
+endobj
+6259 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.605 155.002 158.568 164.916]
+/A << /S /GoTo /D (page.25) >>
+>>
+endobj
+6260 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.605 131.091 158.568 141.006]
+/A << /S /GoTo /D (page.25) >>
+>>
+endobj
+6261 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.18 107.181 138.143 116.889]
+/A << /S /GoTo /D (page.48) >>
+>>
+endobj
+6262 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.18 83.271 138.143 92.979]
+/A << /S /GoTo /D (page.27) >>
+>>
+endobj
+6263 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 758.738 369.896 768.446]
+/A << /S /GoTo /D (page.35) >>
+>>
+endobj
+6264 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 734.827 369.896 744.535]
+/A << /S /GoTo /D (page.35) >>
+>>
+endobj
+6265 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 710.917 369.896 720.625]
+/A << /S /GoTo /D (page.35) >>
+>>
+endobj
+6266 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 687.007 369.896 696.715]
+/A << /S /GoTo /D (page.34) >>
+>>
+endobj
+6267 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 663.096 369.896 672.804]
+/A << /S /GoTo /D (page.43) >>
+>>
+endobj
+6268 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [378.358 629.223 390.321 639.138]
+/A << /S /GoTo /D (page.26) >>
+>>
+endobj
+6269 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [378.358 605.313 390.321 615.227]
+/A << /S /GoTo /D (page.26) >>
+>>
+endobj
+6270 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [378.358 581.403 390.321 591.317]
+/A << /S /GoTo /D (page.24) >>
+>>
+endobj
+6271 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 557.492 369.896 567.2]
+/A << /S /GoTo /D (page.50) >>
+>>
+endobj
+6272 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 533.582 369.896 543.29]
+/A << /S /GoTo /D (page.53) >>
+>>
+endobj
+6273 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [386.966 509.111 398.929 519.38]
+/A << /S /GoTo /D (page.95) >>
+>>
+endobj
+6274 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [386.966 485.201 398.929 495.469]
+/A << /S /GoTo /D (page.94) >>
+>>
+endobj
+6275 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [372.88 461.851 389.828 471.559]
+/A << /S /GoTo /D (page.138) >>
+>>
+endobj
+6276 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [386.966 437.38 398.929 447.649]
+/A << /S /GoTo /D (page.92) >>
+>>
+endobj
+6277 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 414.03 369.896 423.738]
+/A << /S /GoTo /D (page.33) >>
+>>
+endobj
+6278 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 390.12 369.896 399.828]
+/A << /S /GoTo /D (page.34) >>
+>>
+endobj
+6279 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 366.21 369.896 375.918]
+/A << /S /GoTo /D (page.33) >>
+>>
+endobj
+6280 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 342.299 369.896 352.007]
+/A << /S /GoTo /D (page.33) >>
+>>
+endobj
+6281 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 318.389 369.896 328.097]
+/A << /S /GoTo /D (page.34) >>
+>>
+endobj
+6282 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [351.217 293.918 363.18 304.187]
+/A << /S /GoTo /D (page.14) >>
+>>
+endobj
+6283 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [351.217 270.008 363.18 280.276]
+/A << /S /GoTo /D (page.14) >>
+>>
+endobj
+6284 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [351.217 236.135 363.18 246.403]
+/A << /S /GoTo /D (page.14) >>
+>>
+endobj
+6285 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [351.217 212.225 363.18 222.493]
+/A << /S /GoTo /D (page.13) >>
+>>
+endobj
+6286 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [378.358 188.875 390.321 198.789]
+/A << /S /GoTo /D (page.24) >>
+>>
+endobj
+6287 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [378.358 164.964 390.321 174.879]
+/A << /S /GoTo /D (page.24) >>
+>>
+endobj
+6288 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 141.054 369.896 150.762]
+/A << /S /GoTo /D (page.46) >>
+>>
+endobj
+6289 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 117.144 369.896 126.852]
+/A << /S /GoTo /D (page.50) >>
+>>
+endobj
+6290 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 93.233 369.896 102.941]
+/A << /S /GoTo /D (page.43) >>
+>>
+endobj
+6295 0 obj
+<<
+/D [6293 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+6292 0 obj
+<<
+/Font << /F50 2307 0 R /F43 2258 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+6357 0 obj
+<<
+/Length 1054      
+/Filter /FlateDecode
+>>
+stream
+xÚÅY]sšL¾÷Wì¥Ì4¼»À.piu5iH…´™ÉtŠ2E°€mü÷ï&M�k!ô&dÏsÎs>9A ˜
Þ»ƒÿ¦C6	Q�Ê!@7™ à.ÀÝaCúê~šBd¤©ü‡õíkBo«ê~¿
z`²¡h X
î¾B°àÏ>(«¦
~Õo®€†U×òà>
àS¥øýßJ™PÖM.š >h•¥¿xWã7Ày´Ó`>€»3E7†Hß=oƒ3dʦ‚ùÉ&Æ� $%Y¯Xmç¾—Ê8�8ü^ýaåXEy
–ì`³è0ZRxüyÄr	á¼<f&Tì¼´gž}ã^߸ž;—48¼±Æ#	qƒÜÛzMä©GuÀX„ê,%ܨ3Ž^vg=£{Ü=²&fô#ò„•~œý+¯—,w6qÉz§�¦
½ï�sUÌä�Uˆ³*_·ô>XúiÔ—é¿up*¿óÚòSRð�åç,I²žˆ ‡”˜³b�¥Å? #æÉßaÍ#b°î•û%<é˜}…Ez#tåßì¬q�ùÜÇ“­·ðK¿£6†ЯF·½S:¡“Ö=DœÎGUËžy—Ôš¹ç¯9UW¥9Ì%‡~ä%,�ÊåA{óŠÒ/7Å1ÿAàœY¾8ˆç^:^ÁŠ"ÎÒc>©žWôʳ«4øLçÓK»¢úK[ŽÅ|K§ñ,õÎGÎy뀂"üÆI¿Þ’ë\-$ž`…Á1ôÂq.¬Ï—ZÎÞñ‹t?~½@uZ¬ž;§Ÿªô¹¡Žë�mËåj´ÆG=pU9nM�o‰y›ˆ8»Á_7:NË°ß¹ÿOøz
+ð�Œ�íXx~
+—o( º)kXip,{LçU®·U˶ƴǾ˜fiÀzijìjÞuyn_Ó±»¯“3ë(ï?\æ›Uëz¤2Yöûº†L§]4C‘ö›}«œ´	þí±ëùë5K^
½Ý—¬äïš‚§@wíñT
x½ì·5?Á®ewÆý©èEùÐ1¢þÙ²ÕÚÏYÿÔÙºj
+ÛîB^Dólå}óF´îøF§€/Yeú}w¤›�±BÿÎGàžPŸØœmÊõ¦ìœrõ4ø®IGŠ é;ü7IsјÏkãw›¡‚õ÷Å2Kþ9–ýGýŽøM›‡;7]hùólXØ»ßbé‰+$øb¹ÐN@ó=‘´Zd=lÄv‰ÅéŸÃ<(¯ë#�ÑdÂ?QÛN°B‹$ÞW&6XIÌÒ²Úþü”�BžŒŸå×›¦ø?þlßqÆ2TÑ)§yG‹DVt¢U§xÖdŒ5~•	Ùù|ÆR–óô[Hµ
�ZÍÿ“¬.ÌÛˆGwvú\Çÿ
×z¿
+endstream
+endobj
+6356 0 obj
+<<
+/Type /Page
+/Contents 6357 0 R
+/Resources 6355 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 6106 0 R
+/Annots [ 6291 0 R 6296 0 R 6297 0 R 6298 0 R 6299 0 R 6300 0 R 6301 0 R 6302 0 R 6303 0 R 6304 0 R 6305 0 R 6306 0 R 6307 0 R 6308 0 R 6309 0 R 6310 0 R 6311 0 R 6312 0 R 6313 0 R 6314 0 R 6315 0 R 6316 0 R 6317 0 R 6318 0 R 6319 0 R 6320 0 R 6321 0 R 6322 0 R 6323 0 R 6324 0 R 6325 0 R 6326 0 R 6327 0 R 6328 0 R 6329 0 R 6330 0 R 6331 0 R 6332 0 R 6333 0 R 6334 0 R 6335 0 R 6336 0 R 6337 0 R 6338 0 R 6339 0 R 6340 0 R 6341 0 R 6342 0 R 6343 0 R 6344 0 R 6345 0 R 6346 0 R 6347 0 R 6348 0 R 6349 0 R 6350 0 R 6351 0 R 6352 0 R 6353 0 R ]
+>>
+endobj
+6291 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [116.712 758.738 128.675 768.446]
+/A << /S /GoTo /D (page.17) >>
+>>
+endobj
+6296 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [115.349 734.827 127.312 744.535]
+/A << /S /GoTo /D (page.22) >>
+>>
+endobj
+6297 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [140.678 710.249 157.626 720.625]
+/A << /S /GoTo /D (page.102) >>
+>>
+endobj
+6298 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.18 687.007 138.143 696.715]
+/A << /S /GoTo /D (page.55) >>
+>>
+endobj
+6299 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [140.678 662.428 157.626 672.804]
+/A << /S /GoTo /D (page.105) >>
+>>
+endobj
+6300 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [140.678 638.518 157.626 648.894]
+/A << /S /GoTo /D (page.104) >>
+>>
+endobj
+6301 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [140.678 614.608 157.626 624.984]
+/A << /S /GoTo /D (page.104) >>
+>>
+endobj
+6302 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [140.678 590.697 157.626 601.073]
+/A << /S /GoTo /D (page.105) >>
+>>
+endobj
+6303 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [140.678 566.787 157.626 577.163]
+/A << /S /GoTo /D (page.103) >>
+>>
+endobj
+6304 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [140.678 542.877 157.626 553.253]
+/A << /S /GoTo /D (page.105) >>
+>>
+endobj
+6305 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [140.678 518.966 157.626 529.342]
+/A << /S /GoTo /D (page.103) >>
+>>
+endobj
+6306 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [140.678 495.056 157.626 505.432]
+/A << /S /GoTo /D (page.105) >>
+>>
+endobj
+6307 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [140.678 471.146 157.626 481.522]
+/A << /S /GoTo /D (page.106) >>
+>>
+endobj
+6308 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [140.678 447.235 157.626 457.611]
+/A << /S /GoTo /D (page.103) >>
+>>
+endobj
+6309 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [116.712 414.03 128.675 423.738]
+/A << /S /GoTo /D (page.17) >>
+>>
+endobj
+6310 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [115.349 390.12 127.312 399.828]
+/A << /S /GoTo /D (page.21) >>
+>>
+endobj
+6311 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.18 366.21 138.143 375.918]
+/A << /S /GoTo /D (page.52) >>
+>>
+endobj
+6312 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.18 342.299 138.143 352.007]
+/A << /S /GoTo /D (page.47) >>
+>>
+endobj
+6313 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.658 318.389 145.621 328.097]
+/A << /S /GoTo /D (page.16) >>
+>>
+endobj
+6314 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.605 294.479 158.568 304.393]
+/A << /S /GoTo /D (page.23) >>
+>>
+endobj
+6315 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.18 270.568 138.143 280.276]
+/A << /S /GoTo /D (page.52) >>
+>>
+endobj
+6316 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.18 246.658 138.143 256.366]
+/A << /S /GoTo /D (page.50) >>
+>>
+endobj
+6317 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [142.489 222.748 159.438 232.456]
+/A << /S /GoTo /D (page.108) >>
+>>
+endobj
+6318 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.18 198.837 138.143 208.545]
+/A << /S /GoTo /D (page.55) >>
+>>
+endobj
+6319 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.18 174.927 138.143 184.635]
+/A << /S /GoTo /D (page.53) >>
+>>
+endobj
+6320 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.18 151.017 138.143 160.725]
+/A << /S /GoTo /D (page.51) >>
+>>
+endobj
+6321 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.863 127.106 147.826 136.814]
+/A << /S /GoTo /D (page.68) >>
+>>
+endobj
+6322 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [140.678 102.528 157.626 112.904]
+/A << /S /GoTo /D (page.102) >>
+>>
+endobj
+6323 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.863 79.286 147.826 88.994]
+/A << /S /GoTo /D (page.68) >>
+>>
+endobj
+6324 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 746.783 369.896 756.491]
+/A << /S /GoTo /D (page.34) >>
+>>
+endobj
+6325 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [347.102 722.872 359.065 732.58]
+/A << /S /GoTo /D (page.21) >>
+>>
+endobj
+6326 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [347.102 698.962 359.065 708.67]
+/A << /S /GoTo /D (page.21) >>
+>>
+endobj
+6327 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 675.052 369.896 684.76]
+/A << /S /GoTo /D (page.51) >>
+>>
+endobj
+6328 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 651.141 369.896 660.849]
+/A << /S /GoTo /D (page.50) >>
+>>
+endobj
+6329 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [378.358 617.268 390.321 627.182]
+/A << /S /GoTo /D (page.26) >>
+>>
+endobj
+6330 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [378.358 593.358 390.321 603.272]
+/A << /S /GoTo /D (page.26) >>
+>>
+endobj
+6331 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [374.242 569.448 391.191 579.156]
+/A << /S /GoTo /D (page.110) >>
+>>
+endobj
+6332 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [374.242 545.537 391.191 555.245]
+/A << /S /GoTo /D (page.110) >>
+>>
+endobj
+6333 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [374.242 521.627 391.191 531.335]
+/A << /S /GoTo /D (page.108) >>
+>>
+endobj
+6334 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [374.242 497.717 391.191 507.425]
+/A << /S /GoTo /D (page.108) >>
+>>
+endobj
+6335 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [374.242 473.806 391.191 483.514]
+/A << /S /GoTo /D (page.110) >>
+>>
+endobj
+6336 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [374.242 449.896 391.191 459.604]
+/A << /S /GoTo /D (page.108) >>
+>>
+endobj
+6337 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [374.242 425.986 391.191 435.694]
+/A << /S /GoTo /D (page.112) >>
+>>
+endobj
+6338 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [374.242 402.075 391.191 411.783]
+/A << /S /GoTo /D (page.111) >>
+>>
+endobj
+6339 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [374.242 378.165 391.191 387.873]
+/A << /S /GoTo /D (page.109) >>
+>>
+endobj
+6340 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [374.242 354.255 391.191 363.963]
+/A << /S /GoTo /D (page.109) >>
+>>
+endobj
+6341 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [374.242 330.344 391.191 340.052]
+/A << /S /GoTo /D (page.113) >>
+>>
+endobj
+6342 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [374.242 306.434 391.191 316.142]
+/A << /S /GoTo /D (page.112) >>
+>>
+endobj
+6343 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [374.242 282.524 391.191 292.231]
+/A << /S /GoTo /D (page.112) >>
+>>
+endobj
+6344 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [374.242 258.613 391.191 268.321]
+/A << /S /GoTo /D (page.111) >>
+>>
+endobj
+6345 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [374.242 234.703 391.191 244.411]
+/A << /S /GoTo /D (page.109) >>
+>>
+endobj
+6346 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [374.242 210.793 391.191 220.5]
+/A << /S /GoTo /D (page.111) >>
+>>
+endobj
+6347 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [328.539 198.837 340.502 208.545]
+/A << /S /GoTo /D (page.16) >>
+>>
+endobj
+6348 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [338.494 186.882 350.457 196.59]
+/A << /S /GoTo /D (page.17) >>
+>>
+endobj
+6349 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [343.47 174.927 355.433 184.635]
+/A << /S /GoTo /D (page.17) >>
+>>
+endobj
+6350 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [337.768 162.972 349.731 172.68]
+/A << /S /GoTo /D (page.17) >>
+>>
+endobj
+6351 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [347.102 139.062 359.065 148.769]
+/A << /S /GoTo /D (page.22) >>
+>>
+endobj
+6352 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 105.189 369.896 114.897]
+/A << /S /GoTo /D (page.47) >>
+>>
+endobj
+6353 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [390.095 81.278 402.058 90.986]
+/A << /S /GoTo /D (page.70) >>
+>>
+endobj
+6358 0 obj
+<<
+/D [6356 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+6355 0 obj
+<<
+/Font << /F50 2307 0 R /F43 2258 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+6422 0 obj
+<<
+/Length 1065      
+/Filter /FlateDecode
+>>
+stream
+xÚÅY]s¢H}÷Wô£TmØn [x4J"£C“ÍÌf§ºˆö*ƒ�™ñßoãG¢Y…F‰yQ
+ðžsÏýà^�` ¸®]úµ?¯0¦j¢ÿ_ЀªIhXšJðGà¡îôÛöWå»ÿº©bÓ?]^@ØÊN×l¿ö£†ÄYЫ
ÓTMÍÃçÚÃwFâÚUÝ2Á¯å�ÏÀÀºŠ
]O
­ÝÖà6)qþ�”Õ†%L¤Â
«tš°á4äQÊb>ü©˜°®NþXòY‰ÇkFÞu
<\h
³ÞÐÖ×W@àYª¥añ�Tã•áy'܉ҥÇûn8
+æ!“]äY<x™N«Å—ö|6LƒQ¥ØÄ*…}vïÉ~ó4þZ-½”¿Zx$ï‡CEƒõ§ìƒç×Aºsk¢ \Lé
‰p®(»ìQ¤é&Ê¥ðø„Ú#—‚&2!\òü)]Ìy‘|ïÔÛghø+:¬ÿT4\/4hî„»�˜ÉäH­$œ2eãRŸušý6í4»6k*ÖïüN^ŒÓCcilšJJ�êXôVAQ1`½Ù÷ïnNõV7d€o�K›µZMÖ¶[^æò·�Ÿ[ó¡d% „K1°û9Èq¤4ðl‘gžÝf]ûÛÉ9Ö�BÌÚ¨›…ÚÏ>Ü–ÛcÙuÜþ©°”Ë´{Xâ�N_€¦I=k’§Ã^UŽ&|c"¥NÖ‘HbíMò1X7nÛ>O†
+°þ:A?THò–�¢ôÝîÉÞa9ïîíV»cŸ-o¾ó{”%<IÂYT”û‡dÔÄÎ×2z˧Ö=Ü]öœVýËd‹MgñhçÆ×h©¤a"v;dmÆ–ÕÔ²˜§³¢.ÓÎ<»åzmæf΋6zÕsaýþä²,�M�¿mÖsnœ“ëÅ0%Ï�«¹/ÞÛÏ·Ú«öš},Ä>L‡…,,™ª�;öûqoAÇEV¬Ü±s)B0-i䀮™H¿Âhä¸U+*³x7ô`Ö–è2mI” �í9©¢7Éày´ÉÝELL[Úê©pR�eAuÓ8µ%”ÅH;Ÿ§”2ñmW¥°~n"ƒ{N�)ýØ匼V¨hñ/QFãŽXÎ?£!½çð9mñÿ,ÞõYùì‰]Dé„‹=æ#Bdä
}kÓ´Ùc
Fmþ6VåòH‚iñ꬙:l í¨Rh™™sÝÍ–”•¨SU®—÷$€ƒq5Ȇ¤âÃp>áqR
"’ô•G£^øX
 &	8æ�³ÿ”oEx�a|ÆôÞfB'AÌGTÔ¯"Í-Y12øxö2?gȳƒ�(¬ÂO²w3Ü÷2cê¨Ì»ÄÍ‹M¢j
bl½Ø4°JÈ:Ž×YEüFÊ’Ñã2—VÇíY¶*þ^ŒEGYíPÿÁϦ
+endstream
+endobj
+6421 0 obj
+<<
+/Type /Page
+/Contents 6422 0 R
+/Resources 6420 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 6424 0 R
+/Annots [ 6354 0 R 6359 0 R 6360 0 R 6361 0 R 6362 0 R 6363 0 R 6364 0 R 6365 0 R 6366 0 R 6367 0 R 6368 0 R 6369 0 R 6370 0 R 6371 0 R 6372 0 R 6373 0 R 6374 0 R 6375 0 R 6376 0 R 6377 0 R 6378 0 R 6379 0 R 6380 0 R 6381 0 R 6382 0 R 6383 0 R 6384 0 R 6385 0 R 6386 0 R 6387 0 R 6388 0 R 6389 0 R 6390 0 R 6391 0 R 6392 0 R 6393 0 R 6394 0 R 6395 0 R 6396 0 R 6397 0 R 6398 0 R 6399 0 R 6400 0 R 6401 0 R 6402 0 R 6403 0 R 6404 0 R 6405 0 R 6406 0 R 6407 0 R 6408 0 R 6409 0 R 6410 0 R 6411 0 R 6412 0 R 6413 0 R 6414 0 R 6415 0 R 6416 0 R 6417 0 R 6418 0 R 6419 0 R ]
+>>
+endobj
+6354 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [158.342 758.738 170.305 768.446]
+/A << /S /GoTo /D (page.72) >>
+>>
+endobj
+6359 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [158.342 734.827 170.305 744.535]
+/A << /S /GoTo /D (page.70) >>
+>>
+endobj
+6360 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [158.342 710.917 170.305 720.625]
+/A << /S /GoTo /D (page.72) >>
+>>
+endobj
+6361 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [158.342 687.007 170.305 696.715]
+/A << /S /GoTo /D (page.69) >>
+>>
+endobj
+6362 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [158.342 663.096 170.305 672.804]
+/A << /S /GoTo /D (page.72) >>
+>>
+endobj
+6363 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [158.342 639.186 170.305 648.894]
+/A << /S /GoTo /D (page.73) >>
+>>
+endobj
+6364 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [158.342 615.276 170.305 624.984]
+/A << /S /GoTo /D (page.71) >>
+>>
+endobj
+6365 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [141.127 591.365 158.075 601.073]
+/A << /S /GoTo /D (page.137) >>
+>>
+endobj
+6366 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.514 567.455 147.477 577.369]
+/A << /S /GoTo /D (page.63) >>
+>>
+endobj
+6367 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.514 543.545 147.477 553.459]
+/A << /S /GoTo /D (page.63) >>
+>>
+endobj
+6368 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [101.269 531.029 113.232 541.297]
+/A << /S /GoTo /D (page.17) >>
+>>
+endobj
+6369 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [116.747 519.634 128.71 529.342]
+/A << /S /GoTo /D (page.18) >>
+>>
+endobj
+6370 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [114.219 507.679 126.182 517.387]
+/A << /S /GoTo /D (page.18) >>
+>>
+endobj
+6371 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [111.726 495.164 123.689 505.432]
+/A << /S /GoTo /D (page.18) >>
+>>
+endobj
+6372 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.18 471.814 138.143 481.522]
+/A << /S /GoTo /D (page.46) >>
+>>
+endobj
+6373 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.18 447.903 138.143 457.611]
+/A << /S /GoTo /D (page.35) >>
+>>
+endobj
+6374 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.18 423.993 138.143 433.701]
+/A << /S /GoTo /D (page.34) >>
+>>
+endobj
+6375 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.006 399.522 154.954 409.791]
+/A << /S /GoTo /D (page.115) >>
+>>
+endobj
+6376 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.006 375.612 154.954 385.88]
+/A << /S /GoTo /D (page.114) >>
+>>
+endobj
+6377 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.18 352.262 138.143 361.97]
+/A << /S /GoTo /D (page.47) >>
+>>
+endobj
+6378 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.18 328.352 138.143 338.06]
+/A << /S /GoTo /D (page.54) >>
+>>
+endobj
+6379 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [115.349 304.441 127.312 314.149]
+/A << /S /GoTo /D (page.21) >>
+>>
+endobj
+6380 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [115.349 280.531 127.312 290.239]
+/A << /S /GoTo /D (page.21) >>
+>>
+endobj
+6381 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.18 256.621 138.143 266.329]
+/A << /S /GoTo /D (page.56) >>
+>>
+endobj
+6382 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.18 232.71 138.143 242.418]
+/A << /S /GoTo /D (page.56) >>
+>>
+endobj
+6383 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.18 208.8 138.143 218.508]
+/A << /S /GoTo /D (page.47) >>
+>>
+endobj
+6384 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.18 184.89 138.143 194.598]
+/A << /S /GoTo /D (page.56) >>
+>>
+endobj
+6385 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.18 160.979 138.143 170.687]
+/A << /S /GoTo /D (page.45) >>
+>>
+endobj
+6386 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.18 137.069 138.143 146.777]
+/A << /S /GoTo /D (page.45) >>
+>>
+endobj
+6387 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.605 113.159 158.568 123.073]
+/A << /S /GoTo /D (page.26) >>
+>>
+endobj
+6388 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.18 80.498 138.143 90.206]
+/A << /S /GoTo /D (page.57) >>
+>>
+endobj
+6389 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [351.217 758.177 363.18 768.446]
+/A << /S /GoTo /D (page.14) >>
+>>
+endobj
+6390 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 734.827 369.896 744.535]
+/A << /S /GoTo /D (page.54) >>
+>>
+endobj
+6391 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 710.917 369.896 720.625]
+/A << /S /GoTo /D (page.48) >>
+>>
+endobj
+6392 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [386.966 686.446 398.929 696.715]
+/A << /S /GoTo /D (page.96) >>
+>>
+endobj
+6393 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [317.071 675.052 329.034 684.76]
+/A << /S /GoTo /D (page.18) >>
+>>
+endobj
+6394 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [337.49 663.096 349.453 672.804]
+/A << /S /GoTo /D (page.19) >>
+>>
+endobj
+6395 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [337.768 651.141 349.731 660.849]
+/A << /S /GoTo /D (page.19) >>
+>>
+endobj
+6396 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [386.966 626.671 398.929 636.939]
+/A << /S /GoTo /D (page.93) >>
+>>
+endobj
+6397 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [378.358 603.321 390.321 613.235]
+/A << /S /GoTo /D (page.25) >>
+>>
+endobj
+6398 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [378.358 579.41 390.321 589.324]
+/A << /S /GoTo /D (page.25) >>
+>>
+endobj
+6399 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 555.5 369.896 565.208]
+/A << /S /GoTo /D (page.44) >>
+>>
+endobj
+6400 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 531.59 369.896 541.297]
+/A << /S /GoTo /D (page.44) >>
+>>
+endobj
+6401 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 507.679 369.896 517.387]
+/A << /S /GoTo /D (page.44) >>
+>>
+endobj
+6402 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 483.769 369.896 493.477]
+/A << /S /GoTo /D (page.43) >>
+>>
+endobj
+6403 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 459.859 369.896 469.566]
+/A << /S /GoTo /D (page.43) >>
+>>
+endobj
+6404 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 435.948 369.896 445.656]
+/A << /S /GoTo /D (page.44) >>
+>>
+endobj
+6405 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 412.038 369.896 421.746]
+/A << /S /GoTo /D (page.34) >>
+>>
+endobj
+6406 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [386.966 387.567 398.929 397.835]
+/A << /S /GoTo /D (page.93) >>
+>>
+endobj
+6407 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [386.966 363.657 398.929 373.925]
+/A << /S /GoTo /D (page.93) >>
+>>
+endobj
+6408 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [386.966 339.747 398.929 350.015]
+/A << /S /GoTo /D (page.93) >>
+>>
+endobj
+6409 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [386.966 315.836 398.929 326.104]
+/A << /S /GoTo /D (page.94) >>
+>>
+endobj
+6410 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [359.421 283.736 376.369 293.444]
+/A << /S /GoTo /D (page.128) >>
+>>
+endobj
+6411 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [359.421 259.826 376.369 269.534]
+/A << /S /GoTo /D (page.127) >>
+>>
+endobj
+6412 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [359.421 235.915 376.369 245.623]
+/A << /S /GoTo /D (page.123) >>
+>>
+endobj
+6413 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [359.421 212.005 376.369 221.713]
+/A << /S /GoTo /D (page.124) >>
+>>
+endobj
+6414 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [359.421 188.095 376.369 197.803]
+/A << /S /GoTo /D (page.121) >>
+>>
+endobj
+6415 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [359.421 164.184 376.369 173.892]
+/A << /S /GoTo /D (page.122) >>
+>>
+endobj
+6416 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [359.421 140.274 376.369 149.982]
+/A << /S /GoTo /D (page.128) >>
+>>
+endobj
+6417 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [359.421 116.364 376.369 126.072]
+/A << /S /GoTo /D (page.129) >>
+>>
+endobj
+6418 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [359.421 92.453 376.369 102.161]
+/A << /S /GoTo /D (page.121) >>
+>>
+endobj
+6419 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [359.421 68.543 376.369 78.251]
+/A << /S /GoTo /D (page.126) >>
+>>
+endobj
+6423 0 obj
+<<
+/D [6421 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+6420 0 obj
+<<
+/Font << /F50 2307 0 R /F43 2258 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+6486 0 obj
+<<
+/Length 996       
+/Filter /FlateDecode
+>>
+stream
+xÚ½™ß—š:Çßý+ò(çti$À£ë²®­U+lïíÙÛÃI!«œ"ZˆmýïoµûSÃyQÂ|f¾3L&Á@Ðk]­÷×Gw	1Apl¨;„Û5t‚@ƒ»6"Pû|–Atd™âÂÍáþðÊû·ü£å­Ÿ-$ŽC€öGwDóÖÝ7bñßuÓuÀïÍ™s`aSÇ{)ð[Ÿ[ð¡Sâøs§ÒáÎ+¿3g´˜
X¶ñ¹ºk`p��îb\�ÃÓ",hªÏÞmü¬̧[O'½¸»0l§�s{Bå�°ò‚µq¸JÓçHRIj G+¾\qqÚ5 ã|±¢è乆`›j&l¯¸P'î@C† .™½¥Sü#¾÷þ,i+ׂòJéˆ7IžÓH�º²¸$Kø ù® @C’˜Ñ9S€ƒ’¸*…Y¼˜_®¹ŠºµjƒG§*ŠW–\$Ó.˵¶yqîÌ’G\8$¦°è'ÓŒòU®  LøìÍ�íRj„ÛɽŠnìÊhíuÇ&tˆ‡Bó(Î’ºgÍt¬iØ@ç¦m•,ûgFy1dåjúçpŸ�Ò„e<ÌYô«LûQl©ûÕ\‡~¿7ô®Â®7)ÝN
Ë]°,6!xyÅQ¶cKɞŗIº2.‘Œ¹Ûíúʨ¶+KÝÝwåä?�ˆrÖ�Ñ$;¸(ÕÁy›;uÚØý¹ÃH1k¨ŸÑoXš.Ô¥‚Ô‚ƒ=�2u±?žÿž~Cwé–õÀ/‹G÷­j!]_QN›/Ï�š¨J¦•[�ÛeL9k¾&ŽncQéß�òƒ‰)K¨%1c˜’ôW&FÒß«†í/Þd¿ …Á×±wò‚,—}QyùK3°èHa´kQ!q×¹½,ø"ÿE‘,²#^È
Ñ%¸ñƒÑ¡LH…îÖƒ;ŸN—›¼Aîƒ{3Æ‚‹±·8Vfrd^Ý·ûBV_íRóf¿v=¿¹w0e“ÞaênÚ»•*''
•R�S *ÙA뼨:�å?ªócþ¤«À'mm-y®¢oJ-]œxIJʒòâ1�-	ZM…å¾
+–
+¬xU?Õ¨Ur`°Šª…a½ä‹ce(µ¢ÞŽÇ£ªç‰�noRVæèv|¾¶k@݆;áTdO¦,9�¦æFÅš7}?üêu&§Ž'¦L¹ýîÇ׳•Ôè[Røö@’¿zÁ£_z“†±MTçEÚî­Ñ
›Xå4[:Æ–øÖ	Ùâ{,c¹èŸ±¶qùûfûSý¾ZlO­§bW&¢Ížúø?Áæ«<
+endstream
+endobj
+6485 0 obj
+<<
+/Type /Page
+/Contents 6486 0 R
+/Resources 6484 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 6424 0 R
+/Annots [ 6425 0 R 6426 0 R 6427 0 R 6428 0 R 6429 0 R 6430 0 R 6431 0 R 6432 0 R 6433 0 R 6434 0 R 6435 0 R 6436 0 R 6437 0 R 6438 0 R 6439 0 R 6440 0 R 6441 0 R 6442 0 R 6443 0 R 6444 0 R 6445 0 R 6446 0 R 6447 0 R 6448 0 R 6449 0 R 6450 0 R 6451 0 R 6452 0 R 6453 0 R 6454 0 R 6455 0 R 6456 0 R 6457 0 R 6458 0 R 6459 0 R 6460 0 R 6461 0 R 6462 0 R 6463 0 R 6464 0 R 6465 0 R 6466 0 R 6467 0 R 6468 0 R 6469 0 R 6470 0 R 6471 0 R 6472 0 R 6473 0 R 6474 0 R 6475 0 R 6476 0 R 6477 0 R 6478 0 R 6479 0 R 6480 0 R 6481 0 R 6482 0 R ]
+>>
+endobj
+6425 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [127.668 746.783 144.616 756.491]
+/A << /S /GoTo /D (page.123) >>
+>>
+endobj
+6426 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [127.668 722.872 144.616 732.58]
+/A << /S /GoTo /D (page.126) >>
+>>
+endobj
+6427 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [127.668 698.962 144.616 708.67]
+/A << /S /GoTo /D (page.127) >>
+>>
+endobj
+6428 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [127.668 675.052 144.616 684.76]
+/A << /S /GoTo /D (page.126) >>
+>>
+endobj
+6429 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [127.668 651.141 144.616 660.849]
+/A << /S /GoTo /D (page.123) >>
+>>
+endobj
+6430 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [127.668 627.231 144.616 636.939]
+/A << /S /GoTo /D (page.125) >>
+>>
+endobj
+6431 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [127.668 603.321 144.616 613.029]
+/A << /S /GoTo /D (page.125) >>
+>>
+endobj
+6432 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [127.668 579.41 144.616 589.118]
+/A << /S /GoTo /D (page.125) >>
+>>
+endobj
+6433 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [127.668 555.5 144.616 565.208]
+/A << /S /GoTo /D (page.122) >>
+>>
+endobj
+6434 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [127.668 531.59 144.616 541.297]
+/A << /S /GoTo /D (page.120) >>
+>>
+endobj
+6435 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [127.668 507.679 144.616 517.387]
+/A << /S /GoTo /D (page.124) >>
+>>
+endobj
+6436 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [127.668 483.769 144.616 493.477]
+/A << /S /GoTo /D (page.124) >>
+>>
+endobj
+6437 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [127.668 459.859 144.616 469.566]
+/A << /S /GoTo /D (page.122) >>
+>>
+endobj
+6438 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [127.668 435.948 144.616 445.656]
+/A << /S /GoTo /D (page.121) >>
+>>
+endobj
+6439 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [127.668 412.038 144.616 421.746]
+/A << /S /GoTo /D (page.130) >>
+>>
+endobj
+6440 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [127.668 388.128 144.616 397.835]
+/A << /S /GoTo /D (page.129) >>
+>>
+endobj
+6441 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.18 364.217 138.143 373.925]
+/A << /S /GoTo /D (page.42) >>
+>>
+endobj
+6442 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.18 340.307 138.143 350.015]
+/A << /S /GoTo /D (page.42) >>
+>>
+endobj
+6443 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.18 316.397 138.143 326.104]
+/A << /S /GoTo /D (page.42) >>
+>>
+endobj
+6444 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [158.342 292.486 170.305 302.194]
+/A << /S /GoTo /D (page.74) >>
+>>
+endobj
+6445 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.18 268.576 138.143 278.284]
+/A << /S /GoTo /D (page.52) >>
+>>
+endobj
+6446 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [161.561 244.665 173.523 254.373]
+/A << /S /GoTo /D (page.87) >>
+>>
+endobj
+6447 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [161.561 220.755 173.523 230.463]
+/A << /S /GoTo /D (page.86) >>
+>>
+endobj
+6448 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [161.561 196.845 173.523 206.553]
+/A << /S /GoTo /D (page.79) >>
+>>
+endobj
+6449 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [161.561 172.934 173.523 182.642]
+/A << /S /GoTo /D (page.88) >>
+>>
+endobj
+6450 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [161.561 149.024 173.523 158.732]
+/A << /S /GoTo /D (page.88) >>
+>>
+endobj
+6451 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [161.561 125.114 173.523 134.822]
+/A << /S /GoTo /D (page.87) >>
+>>
+endobj
+6452 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [161.561 101.203 173.523 110.911]
+/A << /S /GoTo /D (page.86) >>
+>>
+endobj
+6453 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [161.561 77.293 173.523 87.001]
+/A << /S /GoTo /D (page.85) >>
+>>
+endobj
+6454 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [393.313 746.783 405.276 756.491]
+/A << /S /GoTo /D (page.88) >>
+>>
+endobj
+6455 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [393.313 722.872 405.276 732.58]
+/A << /S /GoTo /D (page.87) >>
+>>
+endobj
+6456 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [377.865 698.962 394.813 708.67]
+/A << /S /GoTo /D (page.133) >>
+>>
+endobj
+6457 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [377.865 675.052 394.813 684.76]
+/A << /S /GoTo /D (page.133) >>
+>>
+endobj
+6458 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 651.141 369.896 660.849]
+/A << /S /GoTo /D (page.48) >>
+>>
+endobj
+6459 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [378.358 627.231 390.321 637.145]
+/A << /S /GoTo /D (page.24) >>
+>>
+endobj
+6460 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 603.321 369.896 613.029]
+/A << /S /GoTo /D (page.49) >>
+>>
+endobj
+6461 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 579.41 369.896 589.118]
+/A << /S /GoTo /D (page.46) >>
+>>
+endobj
+6462 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [365.411 555.5 377.374 565.208]
+/A << /S /GoTo /D (page.16) >>
+>>
+endobj
+6463 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [377.865 531.59 394.813 541.297]
+/A << /S /GoTo /D (page.132) >>
+>>
+endobj
+6464 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 507.679 369.896 517.387]
+/A << /S /GoTo /D (page.46) >>
+>>
+endobj
+6465 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 483.769 369.896 493.477]
+/A << /S /GoTo /D (page.46) >>
+>>
+endobj
+6466 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 459.859 369.896 469.566]
+/A << /S /GoTo /D (page.57) >>
+>>
+endobj
+6467 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 435.948 369.896 445.656]
+/A << /S /GoTo /D (page.57) >>
+>>
+endobj
+6468 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 412.038 369.896 421.746]
+/A << /S /GoTo /D (page.57) >>
+>>
+endobj
+6469 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 388.128 369.896 397.835]
+/A << /S /GoTo /D (page.57) >>
+>>
+endobj
+6470 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [333.659 376.172 345.622 386.087]
+/A << /S /GoTo /D (page.19) >>
+>>
+endobj
+6471 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [378.358 352.262 390.321 362.176]
+/A << /S /GoTo /D (page.23) >>
+>>
+endobj
+6472 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 328.352 369.896 338.06]
+/A << /S /GoTo /D (page.27) >>
+>>
+endobj
+6473 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [378.358 304.441 390.321 314.356]
+/A << /S /GoTo /D (page.23) >>
+>>
+endobj
+6474 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [378.358 280.531 390.321 290.445]
+/A << /S /GoTo /D (page.25) >>
+>>
+endobj
+6475 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [378.358 256.621 390.321 266.535]
+/A << /S /GoTo /D (page.25) >>
+>>
+endobj
+6476 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [351.217 232.15 363.18 242.418]
+/A << /S /GoTo /D (page.14) >>
+>>
+endobj
+6477 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 208.8 369.896 218.508]
+/A << /S /GoTo /D (page.46) >>
+>>
+endobj
+6478 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [378.358 176.139 390.321 186.054]
+/A << /S /GoTo /D (page.27) >>
+>>
+endobj
+6479 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [351.217 151.669 363.18 161.937]
+/A << /S /GoTo /D (page.14) >>
+>>
+endobj
+6480 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 128.319 369.896 138.027]
+/A << /S /GoTo /D (page.35) >>
+>>
+endobj
+6481 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [347.102 104.408 359.065 114.116]
+/A << /S /GoTo /D (page.21) >>
+>>
+endobj
+6482 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [347.102 80.498 359.065 90.206]
+/A << /S /GoTo /D (page.21) >>
+>>
+endobj
+6487 0 obj
+<<
+/D [6485 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+6484 0 obj
+<<
+/Font << /F50 2307 0 R /F43 2258 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+6589 0 obj
+<<
+/Length 1325      
+/Filter /FlateDecode
+>>
+stream
+xÚÅZ]s¢H}÷Wð(U–ñ¡Õž 0€“X©©.£Ä±ÆHVÉÌäßo#ȨëÐ`[î‹ŸáÜÓ÷ãÜ{
²°daÐêE­¿ûP©«ëª½Y2t]ètIB4žÚصѣø5ú$hª!Aà—î¾:È>n¡¨õOÐOe
”†!Š&Ì^[O_eaN¿û$È’Ú5„Ÿ»¿|4¨JPSé땶>·äCRôóߤº²ÔéRhHòžUºÚ¢JßþÚQÈmo‰`Оцrñ}Ž-Ü�®ÔU }RÂk9¹ý={ˆS¢r‚xpºˆIòüò¾�MÓdÃÇ€r�¥çXÏË�x§Éí”uTE9�Spš-߾Ų}_¦1Ò‹¨Êíi欢ÛÉ;%`›â’…äö&yã³°ZîlÄéò•“ëëô‰§9ÁÕ™OÓé…á(]ϵ_D×Ézó±H
+—/–k>ÿøá=“·íw>€[œöåË•].OWËyÃú¯¡(d›.W+²H’ùNGÏ^±Ú’㫶"�0Sà€jÔàᲉ7Žªì×ÑS­ž5wB�eýטÞȘªÕ1æ„@%³U<]W:÷m“¤É,Y±=
+Œúf“õ:ž¥×2Ü©2¬¶<×EV„lÞ€BXû°6ÿ³ñz~{ÿMׇæ=v7<ê&žý¸}o¯èa£¶‡·é´l®e[¯â4y»INYû¶HÏkŠ€ê{„ˆëeo# ÏÙØ4Fá
+KÓkGà”Ï
yø…ÈܦêQx;R}SêMNUKéc=µYše°—ÓAA6¥G
GùÆñ2˜"§OB<p‘ÍôÊQÎô}âÙ•WXöàYžÃ"Ú©&êû¶ŠjÁžËylÒR‹†È�AI_4hIbg°¶x<Ïž>Š
+¤TÝ’¦f{¦M¬"nÄšØm¸@Ÿ¸ú÷Ë“0¹k•ÎÉP÷˜	¥²¡ͱfÞ<3Bahf'\�S€,/°ùIå8d´#f5EÎó 	œ6þCg»ŠøýœÕõó7X]Ì–Y¶ß¾7v™�¨Þ¢ËŠÊ6¬Llú�Wü 4,íéVƹDü‚ÜŸ\Ï‚•Æ—-hJMž‡ˆ=ú8`¶†ZQuˆXØ¢€¯+X¦
¡TT¾6xF¢‰�®B¯Žž²¢áxa9
³sðOÂu€F&)G’LþÂŽ,#=ï£dž}‚¬ÓOü\è�Et©¼0²/›Š¾M³7ȇœ€/)ÚžãÕ ±ƒ£!�–óêâ_�ú•ÀÔqŠˆÚŽ@–daÈ
+cuÚ"3 P4-&ä°_ìM¾aY?=ËMš°Væú:�Õˆ�ÚS5´kaR(^Ì"ÆÈV ]¾„C#?š4·«g
ä–¥ŠlÚ½"ä†tkùĹ6ñú„'ÿ´&ì-ìe剮öH»82QQßzض‘ûÛ§|´Êí¥ÉBkB(ʳ€/(Ã:ëc">p¡Êè%‚§SÃI�[ë(F€í†ÿ�8‹AîùäŒBŒp8*ªÏò;˜ñó2ÌŠ˜S*¬G쑆?†¨Œ#{ÄF½Ýr3à‹
Er=qÓ¹àç#6èfjÀÉñöÏçn±€P’UÐä‹ýíº¤ttíàv
Jº^w¯ãÍ4�çâŽP¾nç¯í$Sî_ñŽ†*^Q¥ÿÕšG
+endstream
+endobj
+6588 0 obj
+<<
+/Type /Page
+/Contents 6589 0 R
+/Resources 6587 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 6424 0 R
+/Annots [ 6483 0 R 6488 0 R 6489 0 R 6490 0 R 6491 0 R 6492 0 R 6493 0 R 6494 0 R 6495 0 R 6496 0 R 6497 0 R 6498 0 R 6499 0 R 6500 0 R 6501 0 R 6502 0 R 6503 0 R 6504 0 R 6505 0 R 6506 0 R 6507 0 R 6508 0 R 6509 0 R 6510 0 R 6511 0 R 6512 0 R 6513 0 R 6514 0 R 6515 0 R 6516 0 R 6517 0 R 6518 0 R 6519 0 R 6520 0 R 6521 0 R 6522 0 R 6523 0 R 6524 0 R 6525 0 R 6526 0 R 6527 0 R 6528 0 R 6529 0 R 6530 0 R 6531 0 R 6532 0 R 6533 0 R 6534 0 R 6535 0 R 6536 0 R 6537 0 R 6538 0 R 6539 0 R 6540 0 R 6541 0 R 6542 0 R 6543 0 R 6544 0 R 6545 0 R 6546 0 R 6547 0 R 6548 0 R 6549 0 R 6550 0 R 6551 0 R 6552 0 R 6553 0 R 6554 0 R 6555 0 R 6556 0 R 6557 0 R 6558 0 R 6559 0 R 6560 0 R 6561 0 R 6562 0 R 6563 0 R 6564 0 R 6565 0 R 6566 0 R 6567 0 R 6568 0 R 6569 0 R 6570 0 R 6571 0 R 6572 0 R 6573 0 R 6574 0 R 6575 0 R 6576 0 R 6577 0 R 6578 0 R 6579 0 R 6580 0 R 6581 0 R 6582 0 R 6583 0 R 6584 0 R 6585 0 R ]
+>>
+endobj
+6483 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.18 758.738 138.143 768.446]
+/A << /S /GoTo /D (page.50) >>
+>>
+endobj
+6488 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [95.423 746.783 107.386 756.491]
+/A << /S /GoTo /D (page.20) >>
+>>
+endobj
+6489 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [156.584 734.159 168.547 744.742]
+/A << /S /GoTo /D (page.21) >>
+>>
+endobj
+6490 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [112.578 722.872 124.541 732.58]
+/A << /S /GoTo /D (page.22) >>
+>>
+endobj
+6491 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [143.117 710.357 155.08 720.625]
+/A << /S /GoTo /D (page.22) >>
+>>
+endobj
+6492 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [156.45 698.294 168.413 708.876]
+/A << /S /GoTo /D (page.22) >>
+>>
+endobj
+6493 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [122.907 687.007 134.87 696.921]
+/A << /S /GoTo /D (page.22) >>
+>>
+endobj
+6494 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [158.7 674.491 170.663 684.76]
+/A << /S /GoTo /D (page.21) >>
+>>
+endobj
+6495 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [127.157 663.096 139.12 673.011]
+/A << /S /GoTo /D (page.21) >>
+>>
+endobj
+6496 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.204 651.141 131.167 660.849]
+/A << /S /GoTo /D (page.21) >>
+>>
+endobj
+6497 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [116.837 638.518 128.8 648.894]
+/A << /S /GoTo /D (page.22) >>
+>>
+endobj
+6498 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [112.722 627.231 124.685 637.145]
+/A << /S /GoTo /D (page.21) >>
+>>
+endobj
+6499 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [108.732 614.715 120.695 624.984]
+/A << /S /GoTo /D (page.21) >>
+>>
+endobj
+6500 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [115.205 603.321 127.168 613.235]
+/A << /S /GoTo /D (page.21) >>
+>>
+endobj
+6501 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [108.05 591.365 120.013 601.073]
+/A << /S /GoTo /D (page.21) >>
+>>
+endobj
+6502 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [112.991 579.41 124.954 589.118]
+/A << /S /GoTo /D (page.20) >>
+>>
+endobj
+6503 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [141.127 555.5 158.075 565.208]
+/A << /S /GoTo /D (page.138) >>
+>>
+endobj
+6504 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.18 531.59 138.143 541.297]
+/A << /S /GoTo /D (page.48) >>
+>>
+endobj
+6505 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.18 507.679 138.143 517.387]
+/A << /S /GoTo /D (page.34) >>
+>>
+endobj
+6506 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [148.102 483.209 165.05 493.477]
+/A << /S /GoTo /D (page.118) >>
+>>
+endobj
+6507 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [148.102 459.298 165.05 469.566]
+/A << /S /GoTo /D (page.117) >>
+>>
+endobj
+6508 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.18 435.948 138.143 445.656]
+/A << /S /GoTo /D (page.55) >>
+>>
+endobj
+6509 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.18 412.038 138.143 421.746]
+/A << /S /GoTo /D (page.55) >>
+>>
+endobj
+6510 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [148.102 387.567 165.05 397.835]
+/A << /S /GoTo /D (page.117) >>
+>>
+endobj
+6511 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.18 364.217 138.143 373.925]
+/A << /S /GoTo /D (page.55) >>
+>>
+endobj
+6512 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [148.102 339.747 165.05 350.015]
+/A << /S /GoTo /D (page.118) >>
+>>
+endobj
+6513 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [148.102 315.836 165.05 326.104]
+/A << /S /GoTo /D (page.118) >>
+>>
+endobj
+6514 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [148.102 291.926 165.05 302.194]
+/A << /S /GoTo /D (page.116) >>
+>>
+endobj
+6515 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [148.102 268.015 165.05 278.284]
+/A << /S /GoTo /D (page.117) >>
+>>
+endobj
+6516 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.18 244.665 138.143 254.373]
+/A << /S /GoTo /D (page.46) >>
+>>
+endobj
+6517 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.18 220.755 138.143 230.463]
+/A << /S /GoTo /D (page.46) >>
+>>
+endobj
+6518 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.18 196.845 138.143 206.553]
+/A << /S /GoTo /D (page.45) >>
+>>
+endobj
+6519 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.18 172.934 138.143 182.642]
+/A << /S /GoTo /D (page.45) >>
+>>
+endobj
+6520 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.18 149.024 138.143 158.732]
+/A << /S /GoTo /D (page.45) >>
+>>
+endobj
+6521 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.255 137.069 118.217 146.777]
+/A << /S /GoTo /D (page.29) >>
+>>
+endobj
+6522 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [121.21 137.069 133.173 146.777]
+/A << /S /GoTo /D (page.58) >>
+>>
+endobj
+6523 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [123.409 125.114 135.372 134.822]
+/A << /S /GoTo /D (page.48) >>
+>>
+endobj
+6524 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [192.673 113.159 204.636 123.073]
+/A << /S /GoTo /D (page.36) >>
+>>
+endobj
+6525 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [167.129 101.203 179.092 111.118]
+/A << /S /GoTo /D (page.47) >>
+>>
+endobj
+6526 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [152.998 89.248 164.961 99.163]
+/A << /S /GoTo /D (page.48) >>
+>>
+endobj
+6527 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [214.094 77.293 226.057 87.207]
+/A << /S /GoTo /D (page.51) >>
+>>
+endobj
+6528 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [406.969 758.738 418.932 768.652]
+/A << /S /GoTo /D (page.50) >>
+>>
+endobj
+6529 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [407.391 746.783 419.354 756.697]
+/A << /S /GoTo /D (page.54) >>
+>>
+endobj
+6530 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [405.75 734.827 417.713 744.742]
+/A << /S /GoTo /D (page.53) >>
+>>
+endobj
+6531 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [379.353 722.872 391.316 732.786]
+/A << /S /GoTo /D (page.51) >>
+>>
+endobj
+6532 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [394.031 710.917 405.994 720.831]
+/A << /S /GoTo /D (page.53) >>
+>>
+endobj
+6533 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [388.804 698.962 400.767 708.876]
+/A << /S /GoTo /D (page.51) >>
+>>
+endobj
+6534 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [413.443 687.007 425.406 696.921]
+/A << /S /GoTo /D (page.55) >>
+>>
+endobj
+6535 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [433.124 675.052 445.087 684.966]
+/A << /S /GoTo /D (page.53) >>
+>>
+endobj
+6536 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [381.837 663.096 393.8 673.011]
+/A << /S /GoTo /D (page.51) >>
+>>
+endobj
+6537 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [343.3 650.581 355.263 660.849]
+/A << /S /GoTo /D (page.57) >>
+>>
+endobj
+6538 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [399.402 639.186 411.365 649.1]
+/A << /S /GoTo /D (page.52) >>
+>>
+endobj
+6539 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [409.157 627.231 421.12 637.145]
+/A << /S /GoTo /D (page.52) >>
+>>
+endobj
+6540 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [398.909 615.276 410.872 625.19]
+/A << /S /GoTo /D (page.49) >>
+>>
+endobj
+6541 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [388.042 603.321 400.005 613.235]
+/A << /S /GoTo /D (page.49) >>
+>>
+endobj
+6542 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [411.246 591.365 423.209 601.28]
+/A << /S /GoTo /D (page.53) >>
+>>
+endobj
+6543 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [383.971 579.41 395.934 589.324]
+/A << /S /GoTo /D (page.49) >>
+>>
+endobj
+6544 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [428.318 567.455 440.281 577.369]
+/A << /S /GoTo /D (page.54) >>
+>>
+endobj
+6545 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [403.75 555.5 415.713 565.414]
+/A << /S /GoTo /D (page.48) >>
+>>
+endobj
+6546 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [387.54 543.545 399.503 553.459]
+/A << /S /GoTo /D (page.36) >>
+>>
+endobj
+6547 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [415.945 531.59 427.908 541.504]
+/A << /S /GoTo /D (page.48) >>
+>>
+endobj
+6548 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [392.803 519.634 404.766 529.549]
+/A << /S /GoTo /D (page.49) >>
+>>
+endobj
+6549 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [394.434 507.679 406.397 517.593]
+/A << /S /GoTo /D (page.55) >>
+>>
+endobj
+6550 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [454.311 495.724 466.274 505.638]
+/A << /S /GoTo /D (page.53) >>
+>>
+endobj
+6551 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [361.412 483.769 373.375 493.683]
+/A << /S /GoTo /D (page.47) >>
+>>
+endobj
+6552 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [406.933 471.814 418.896 481.728]
+/A << /S /GoTo /D (page.36) >>
+>>
+endobj
+6553 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [402.074 459.859 414.037 469.773]
+/A << /S /GoTo /D (page.54) >>
+>>
+endobj
+6554 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [406.109 447.903 418.072 457.818]
+/A << /S /GoTo /D (page.54) >>
+>>
+endobj
+6555 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [376.35 435.948 388.312 445.656]
+/A << /S /GoTo /D (page.44) >>
+>>
+endobj
+6556 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [402.271 423.993 414.234 433.701]
+/A << /S /GoTo /D (page.44) >>
+>>
+endobj
+6557 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [376.35 412.038 388.312 421.746]
+/A << /S /GoTo /D (page.44) >>
+>>
+endobj
+6558 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [359.43 400.083 371.393 409.997]
+/A << /S /GoTo /D (page.35) >>
+>>
+endobj
+6559 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [381.066 388.128 393.029 397.835]
+/A << /S /GoTo /D (page.47) >>
+>>
+endobj
+6560 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [362.407 376.172 374.37 386.087]
+/A << /S /GoTo /D (page.35) >>
+>>
+endobj
+6561 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [451.612 364.217 463.575 374.131]
+/A << /S /GoTo /D (page.43) >>
+>>
+endobj
+6562 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [451.612 352.262 463.575 362.176]
+/A << /S /GoTo /D (page.43) >>
+>>
+endobj
+6563 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [451.612 340.307 463.575 350.221]
+/A << /S /GoTo /D (page.43) >>
+>>
+endobj
+6564 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [363.913 328.352 375.876 338.06]
+/A << /S /GoTo /D (page.44) >>
+>>
+endobj
+6565 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [419.423 316.397 431.386 326.311]
+/A << /S /GoTo /D (page.52) >>
+>>
+endobj
+6566 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [444.161 304.441 456.124 314.356]
+/A << /S /GoTo /D (page.49) >>
+>>
+endobj
+6567 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [422.418 292.486 434.381 302.4]
+/A << /S /GoTo /D (page.50) >>
+>>
+endobj
+6568 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [443.166 280.531 455.129 290.445]
+/A << /S /GoTo /D (page.52) >>
+>>
+endobj
+6569 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [368.379 268.576 380.342 278.49]
+/A << /S /GoTo /D (page.49) >>
+>>
+endobj
+6570 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [436.136 256.621 448.099 266.535]
+/A << /S /GoTo /D (page.52) >>
+>>
+endobj
+6571 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [424.462 244.665 436.425 254.58]
+/A << /S /GoTo /D (page.55) >>
+>>
+endobj
+6572 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [417.254 232.71 429.217 242.625]
+/A << /S /GoTo /D (page.50) >>
+>>
+endobj
+6573 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [363.402 220.755 375.365 230.669]
+/A << /S /GoTo /D (page.48) >>
+>>
+endobj
+6574 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [351.441 208.8 363.404 218.508]
+/A << /S /GoTo /D (page.35) >>
+>>
+endobj
+6575 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [351.441 196.845 363.404 206.553]
+/A << /S /GoTo /D (page.35) >>
+>>
+endobj
+6576 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [361.914 184.89 373.877 194.804]
+/A << /S /GoTo /D (page.35) >>
+>>
+endobj
+6577 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [360.408 172.934 372.371 182.642]
+/A << /S /GoTo /D (page.34) >>
+>>
+endobj
+6578 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [377.354 160.979 389.317 170.687]
+/A << /S /GoTo /D (page.43) >>
+>>
+endobj
+6579 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [387.226 149.024 399.189 158.938]
+/A << /S /GoTo /D (page.50) >>
+>>
+endobj
+6580 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [422.624 137.069 434.587 146.983]
+/A << /S /GoTo /D (page.53) >>
+>>
+endobj
+6581 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [399.204 125.114 411.167 135.028]
+/A << /S /GoTo /D (page.33) >>
+>>
+endobj
+6582 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [372.781 113.159 384.744 123.073]
+/A << /S /GoTo /D (page.34) >>
+>>
+endobj
+6583 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [366.89 101.203 378.853 111.118]
+/A << /S /GoTo /D (page.33) >>
+>>
+endobj
+6584 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [390.409 89.248 402.372 99.163]
+/A << /S /GoTo /D (page.33) >>
+>>
+endobj
+6585 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [364.397 77.293 376.36 87.207]
+/A << /S /GoTo /D (page.34) >>
+>>
+endobj
+6590 0 obj
+<<
+/D [6588 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+6587 0 obj
+<<
+/Font << /F50 2307 0 R /F43 2258 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+6709 0 obj
+<<
+/Length 1345      
+/Filter /FlateDecode
+>>
+stream
+xÚµšßoÛ6ÇßýWèÑM”DZ~”%Úf-K¬H5vƒ‚Ø–,°fX7`ë¿£~$Ž—š´©½D��|ôåïxwRà=z�·ž,å䇼Ä_yòoø	!Þ|úyòÞ»›"Î>Ë÷^Åücû1+sº×_L¨œü1Aðyà¡g@’øI{?™Ü}¼{øî½øÑ"ñþnÿò‹ãÈÇ-ï7OL>L‚cQðù‹¨EàÏ€&ÈU[zPb“Öô]«¡»ù×Ç^E½žxw7á<™Æ¤ÿ¾ƒÃ�„üÆ/˜†ç³8˜¦3Siâà<ð°¤õœ$&YÑÛÒQŠj­ªFòF*YkqM™õúXUšâ³
+wé^Ñ}FiNs)4’Vu:‹‚éZ´\Ë�iÙóó@ºSÕÓ�´^•ß:J¤Bt©Ú¤bãæÜ‚•k0Ÿ¤¥¸Þä;8aâEVòjúa†`ÏP!UV•ø&0:.«ŒÖÚŠ&N8z/KX0§™4o?dE“…@*ró,oƒ+Ís°ß•{¸w*¯Àê›´Ì!;m©JõvnÌ�q>MuPaK‹°™Öm‘6ñ•²Ù¹9–×´Mƹ‚„ê–x=Ot®Õ?ª¬*ä›p3ˆ[Å–ÆüNλ æ5bbT²«rêh) ô1à,Gï«jkÒƒM˜[šåz%¦·pÝnò[Å›eÁ2cŸ7SM³ªÎ/>Wb¨`Ÿ¨*ØŽ™<'çq"U|›Aƒ0
+11Ñb{Z”Ä#Ò0
+¯¤‘#š
+®Ôr±‘YÞÐb½—
¯_òP·+hÆÁT52I	�0ÐÕò‚Á!rWS¬ „Ö%œ–6ë>ÌŸ�J8u‹Î#ê†Ee¢-lieºsì_Àz*-ÖâJ
+yM±õ‚AÔŸ¿>>!â–µ5#
+Ý$vg$W"ë6œW�]a£¯»ú¦áÂÍÈrÄ:дv«%˶TºÏ’í`aЯº…™dåAÑ,sË”ºˆtÛSZµçk‘–3áÊ{%nè̽†îd~1Ô„Çm Q÷Éf;½za„ü9Ž<’ ?ŽÏÞÞá¶o™_nUiËG`DÎ•R¡P˜¨,۩IJú	/¢ŽÍ\[3‘É“-@Ó¢P³ÐÉ94	/£1õVûhJ(Äx›lÓ‘àŠWÅ
ú€¢�fqÈä=VÇS7—PÝí3Ê-R�y9zàT—i
uîÖ}W¯f	HdES;öÖ-¬)Š—ñ‰»8=£|.—Æj J.#êp$$ã(	‡yê¨PÑ0IÅ•|Š,-¥ŽVꡯIèÂèòÿP-Œvb«jËFbAe¢VŒùH¸½TEº¤Æì4·ÅÙÍ�¿'ïÄ!¶ûÐN�Åèý’}Z´{bcK¶hí,ÃŽ-Û
+hµ1?°�.qqâÝ-rC×–ìí2ÙÂJ©†óf©ÚGt£RÍj*GÆÙ@Õ%^·Ì¶ýCÀ£q£{¦¹¼Ð‰vÜÃf˜j�tÐÏry¼ÍtápÇÒÝ£•~÷�—ôØç’@µÛšú¿ªžö)JÍ1ÁWhÐtX„'„‡3°}ú>^ÉÔ
„FÖT4;Þ6fÃX€Õct0]×¥¤{k×u¢#‘0
+ͤ¹Ñ½¢�VÏøÈÀÂL�‡Üž1jÈ‹®&´¨~Mge›ç»]GW8ËÒâ²)âp}ë]&Œý B—¼Ê4¼WEüpNbý
+SŒcã®>!½§×O_üëá~Ö*úI§�oÝïùï:¬ÿùö8»�˜yxz¥4þ¯l_
+endstream
+endobj
+6708 0 obj
+<<
+/Type /Page
+/Contents 6709 0 R
+/Resources 6707 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 6424 0 R
+/Annots [ 6586 0 R 6591 0 R 6592 0 R 6593 0 R 6594 0 R 6595 0 R 6596 0 R 6597 0 R 6598 0 R 6599 0 R 6600 0 R 6601 0 R 6602 0 R 6603 0 R 6604 0 R 6605 0 R 6606 0 R 6607 0 R 6608 0 R 6609 0 R 6610 0 R 6611 0 R 6612 0 R 6613 0 R 6614 0 R 6615 0 R 6616 0 R 6617 0 R 6618 0 R 6619 0 R 6620 0 R 6621 0 R 6622 0 R 6623 0 R 6624 0 R 6625 0 R 6626 0 R 6627 0 R 6628 0 R 6629 0 R 6630 0 R 6631 0 R 6632 0 R 6633 0 R 6634 0 R 6635 0 R 6636 0 R 6637 0 R 6638 0 R 6639 0 R 6640 0 R 6641 0 R 6642 0 R 6643 0 R 6644 0 R 6645 0 R 6646 0 R 6647 0 R 6648 0 R 6649 0 R 6650 0 R 6651 0 R 6652 0 R 6653 0 R 6654 0 R 6655 0 R 6656 0 R 6657 0 R 6658 0 R 6659 0 R 6660 0 R 6661 0 R 6662 0 R 6663 0 R 6664 0 R 6665 0 R 6666 0 R 6667 0 R 6668 0 R 6669 0 R 6670 0 R 6671 0 R 6672 0 R 6673 0 R 6674 0 R 6675 0 R 6676 0 R 6677 0 R 6678 0 R 6679 0 R 6680 0 R 6681 0 R 6682 0 R 6683 0 R 6684 0 R 6685 0 R 6686 0 R 6687 0 R 6688 0 R 6689 0 R 6690 0 R 6691 0 R 6692 0 R 6693 0 R 6694 0 R 6695 0 R 6696 0 R 6697 0 R 6698 0 R 6699 0 R 6700 0 R 6701 0 R 6702 0 R 6703 0 R 6704 0 R 6705 0 R ]
+>>
+endobj
+6586 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [148.595 758.738 160.558 768.652]
+/A << /S /GoTo /D (page.46) >>
+>>
+endobj
+6591 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [152.639 746.783 164.602 756.491]
+/A << /S /GoTo /D (page.50) >>
+>>
+endobj
+6592 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [140.131 734.827 152.094 744.535]
+/A << /S /GoTo /D (page.43) >>
+>>
+endobj
+6593 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [217.887 722.872 229.85 732.786]
+/A << /S /GoTo /D (page.55) >>
+>>
+endobj
+6594 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [168.518 710.917 180.481 720.831]
+/A << /S /GoTo /D (page.52) >>
+>>
+endobj
+6595 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [185.187 698.962 197.15 708.876]
+/A << /S /GoTo /D (page.47) >>
+>>
+endobj
+6596 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.28 687.007 183.243 696.921]
+/A << /S /GoTo /D (page.52) >>
+>>
+endobj
+6597 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [168.752 675.052 180.715 684.966]
+/A << /S /GoTo /D (page.50) >>
+>>
+endobj
+6598 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [189.445 663.096 201.408 673.011]
+/A << /S /GoTo /D (page.55) >>
+>>
+endobj
+6599 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [195.426 651.141 207.389 661.055]
+/A << /S /GoTo /D (page.53) >>
+>>
+endobj
+6600 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [228.709 639.186 240.672 649.1]
+/A << /S /GoTo /D (page.51) >>
+>>
+endobj
+6601 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [132.367 627.231 144.33 637.145]
+/A << /S /GoTo /D (page.34) >>
+>>
+endobj
+6602 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [166.663 615.276 178.626 625.19]
+/A << /S /GoTo /D (page.51) >>
+>>
+endobj
+6603 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [149.734 603.321 161.697 613.235]
+/A << /S /GoTo /D (page.50) >>
+>>
+endobj
+6604 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.554 591.365 146.517 601.28]
+/A << /S /GoTo /D (page.47) >>
+>>
+endobj
+6605 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [208.92 579.41 220.883 589.324]
+/A << /S /GoTo /D (page.46) >>
+>>
+endobj
+6606 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [165.578 567.455 177.541 577.369]
+/A << /S /GoTo /D (page.35) >>
+>>
+endobj
+6607 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [169.057 555.5 181.02 565.414]
+/A << /S /GoTo /D (page.34) >>
+>>
+endobj
+6608 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [173.504 543.545 185.467 553.459]
+/A << /S /GoTo /D (page.47) >>
+>>
+endobj
+6609 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [189.544 531.59 201.507 541.504]
+/A << /S /GoTo /D (page.54) >>
+>>
+endobj
+6610 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [132.16 519.634 144.123 529.549]
+/A << /S /GoTo /D (page.56) >>
+>>
+endobj
+6611 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.648 507.679 147.611 517.593]
+/A << /S /GoTo /D (page.56) >>
+>>
+endobj
+6612 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [144.606 495.724 156.568 505.638]
+/A << /S /GoTo /D (page.47) >>
+>>
+endobj
+6613 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [136.276 483.769 148.239 493.683]
+/A << /S /GoTo /D (page.56) >>
+>>
+endobj
+6614 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.229 471.814 137.192 481.728]
+/A << /S /GoTo /D (page.45) >>
+>>
+endobj
+6615 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [152.568 459.859 164.531 469.773]
+/A << /S /GoTo /D (page.45) >>
+>>
+endobj
+6616 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [175.548 447.903 187.511 457.818]
+/A << /S /GoTo /D (page.57) >>
+>>
+endobj
+6617 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [189.213 435.948 201.176 445.862]
+/A << /S /GoTo /D (page.54) >>
+>>
+endobj
+6618 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [186.451 423.993 198.414 433.907]
+/A << /S /GoTo /D (page.48) >>
+>>
+endobj
+6619 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [185.976 412.038 197.939 421.952]
+/A << /S /GoTo /D (page.44) >>
+>>
+endobj
+6620 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [185.976 400.083 197.939 409.997]
+/A << /S /GoTo /D (page.44) >>
+>>
+endobj
+6621 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [185.976 388.128 197.939 398.042]
+/A << /S /GoTo /D (page.44) >>
+>>
+endobj
+6622 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [203.917 376.172 215.88 386.087]
+/A << /S /GoTo /D (page.43) >>
+>>
+endobj
+6623 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [203.917 364.217 215.88 374.131]
+/A << /S /GoTo /D (page.43) >>
+>>
+endobj
+6624 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [203.917 352.262 215.88 362.176]
+/A << /S /GoTo /D (page.44) >>
+>>
+endobj
+6625 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [130.161 340.307 142.124 350.221]
+/A << /S /GoTo /D (page.34) >>
+>>
+endobj
+6626 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.61 328.352 157.573 338.266]
+/A << /S /GoTo /D (page.42) >>
+>>
+endobj
+6627 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.61 316.397 157.573 326.311]
+/A << /S /GoTo /D (page.42) >>
+>>
+endobj
+6628 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.61 304.441 157.573 314.356]
+/A << /S /GoTo /D (page.42) >>
+>>
+endobj
+6629 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [185.689 292.486 197.652 302.4]
+/A << /S /GoTo /D (page.52) >>
+>>
+endobj
+6630 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [188.728 280.531 200.691 290.445]
+/A << /S /GoTo /D (page.48) >>
+>>
+endobj
+6631 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [165.586 268.576 177.549 278.49]
+/A << /S /GoTo /D (page.49) >>
+>>
+endobj
+6632 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [162.09 256.621 174.053 266.535]
+/A << /S /GoTo /D (page.46) >>
+>>
+endobj
+6633 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.136 244.665 151.099 254.58]
+/A << /S /GoTo /D (page.46) >>
+>>
+endobj
+6634 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [168.258 232.71 180.221 242.625]
+/A << /S /GoTo /D (page.46) >>
+>>
+endobj
+6635 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [121.195 220.087 133.158 230.463]
+/A << /S /GoTo /D (page.57) >>
+>>
+endobj
+6636 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [121.195 208.132 133.158 218.508]
+/A << /S /GoTo /D (page.57) >>
+>>
+endobj
+6637 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [121.195 196.177 133.158 206.553]
+/A << /S /GoTo /D (page.57) >>
+>>
+endobj
+6638 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [116.21 184.222 128.172 194.598]
+/A << /S /GoTo /D (page.57) >>
+>>
+endobj
+6639 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [193.974 172.934 205.937 182.849]
+/A << /S /GoTo /D (page.46) >>
+>>
+endobj
+6640 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [144.606 160.979 156.568 170.894]
+/A << /S /GoTo /D (page.35) >>
+>>
+endobj
+6641 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.664 149.024 138.627 158.938]
+/A << /S /GoTo /D (page.50) >>
+>>
+endobj
+6642 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.587 137.069 158.55 146.983]
+/A << /S /GoTo /D (page.48) >>
+>>
+endobj
+6643 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.118 125.114 151.081 135.028]
+/A << /S /GoTo /D (page.34) >>
+>>
+endobj
+6644 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [182.963 113.159 194.926 123.073]
+/A << /S /GoTo /D (page.55) >>
+>>
+endobj
+6645 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [197.91 101.203 209.873 111.118]
+/A << /S /GoTo /D (page.55) >>
+>>
+endobj
+6646 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.938 89.248 203.901 99.163]
+/A << /S /GoTo /D (page.55) >>
+>>
+endobj
+6647 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [245.359 77.293 257.322 87.207]
+/A << /S /GoTo /D (page.46) >>
+>>
+endobj
+6648 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [453.558 758.738 465.521 768.652]
+/A << /S /GoTo /D (page.46) >>
+>>
+endobj
+6649 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 746.783 369.896 756.697]
+/A << /S /GoTo /D (page.45) >>
+>>
+endobj
+6650 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 734.827 369.896 744.742]
+/A << /S /GoTo /D (page.45) >>
+>>
+endobj
+6651 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 722.872 369.896 732.786]
+/A << /S /GoTo /D (page.45) >>
+>>
+endobj
+6652 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [459.592 710.917 471.555 720.831]
+/A << /S /GoTo /D (page.42) >>
+>>
+endobj
+6653 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [449.622 698.962 461.584 708.876]
+/A << /S /GoTo /D (page.42) >>
+>>
+endobj
+6654 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [450.124 687.007 462.087 696.921]
+/A << /S /GoTo /D (page.41) >>
+>>
+endobj
+6655 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [450.124 675.052 462.087 684.966]
+/A << /S /GoTo /D (page.42) >>
+>>
+endobj
+6656 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [460.587 663.096 472.55 673.011]
+/A << /S /GoTo /D (page.36) >>
+>>
+endobj
+6657 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [481.488 651.141 493.451 661.055]
+/A << /S /GoTo /D (page.42) >>
+>>
+endobj
+6658 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [456.033 639.186 467.996 649.1]
+/A << /S /GoTo /D (page.56) >>
+>>
+endobj
+6659 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [418.222 627.231 430.185 637.145]
+/A << /S /GoTo /D (page.45) >>
+>>
+endobj
+6660 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [385.11 615.276 397.073 625.19]
+/A << /S /GoTo /D (page.56) >>
+>>
+endobj
+6661 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [430.667 603.321 442.63 613.235]
+/A << /S /GoTo /D (page.45) >>
+>>
+endobj
+6662 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [417.451 591.365 429.414 601.28]
+/A << /S /GoTo /D (page.38) >>
+>>
+endobj
+6663 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [421.432 579.41 433.395 589.324]
+/A << /S /GoTo /D (page.38) >>
+>>
+endobj
+6664 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [435.876 567.455 447.839 577.369]
+/A << /S /GoTo /D (page.38) >>
+>>
+endobj
+6665 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [443.623 555.5 455.586 565.414]
+/A << /S /GoTo /D (page.41) >>
+>>
+endobj
+6666 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [459.565 543.545 471.528 553.459]
+/A << /S /GoTo /D (page.39) >>
+>>
+endobj
+6667 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [462.058 531.59 474.021 541.504]
+/A << /S /GoTo /D (page.40) >>
+>>
+endobj
+6668 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [407.256 519.634 419.219 529.549]
+/A << /S /GoTo /D (page.40) >>
+>>
+endobj
+6669 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [421.701 507.679 433.664 517.593]
+/A << /S /GoTo /D (page.40) >>
+>>
+endobj
+6670 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [422.714 495.724 434.677 505.638]
+/A << /S /GoTo /D (page.37) >>
+>>
+endobj
+6671 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [430.174 483.769 442.137 493.683]
+/A << /S /GoTo /D (page.40) >>
+>>
+endobj
+6672 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [397.017 471.814 408.98 481.728]
+/A << /S /GoTo /D (page.37) >>
+>>
+endobj
+6673 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [397.286 459.859 409.249 469.773]
+/A << /S /GoTo /D (page.37) >>
+>>
+endobj
+6674 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [429.017 447.903 440.98 457.818]
+/A << /S /GoTo /D (page.37) >>
+>>
+endobj
+6675 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [401.778 435.948 413.741 445.862]
+/A << /S /GoTo /D (page.38) >>
+>>
+endobj
+6676 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [423.108 423.993 435.071 433.907]
+/A << /S /GoTo /D (page.38) >>
+>>
+endobj
+6677 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [405.768 412.038 417.731 421.952]
+/A << /S /GoTo /D (page.40) >>
+>>
+endobj
+6678 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [476.744 400.083 488.707 409.997]
+/A << /S /GoTo /D (page.39) >>
+>>
+endobj
+6679 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [461.582 388.128 473.545 398.042]
+/A << /S /GoTo /D (page.39) >>
+>>
+endobj
+6680 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [479.515 376.172 491.478 386.087]
+/A << /S /GoTo /D (page.39) >>
+>>
+endobj
+6681 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [390.319 364.217 402.282 374.131]
+/A << /S /GoTo /D (page.37) >>
+>>
+endobj
+6682 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [427.592 352.262 439.555 362.176]
+/A << /S /GoTo /D (page.41) >>
+>>
+endobj
+6683 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [477.991 340.307 489.954 350.221]
+/A << /S /GoTo /D (page.41) >>
+>>
+endobj
+6684 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [427.914 328.352 439.877 338.266]
+/A << /S /GoTo /D (page.38) >>
+>>
+endobj
+6685 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [428.183 316.397 440.146 326.311]
+/A << /S /GoTo /D (page.41) >>
+>>
+endobj
+6686 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [464.102 304.441 476.065 314.356]
+/A << /S /GoTo /D (page.39) >>
+>>
+endobj
+6687 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [466.595 292.486 478.558 302.4]
+/A << /S /GoTo /D (page.39) >>
+>>
+endobj
+6688 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [439.687 280.531 451.65 290.445]
+/A << /S /GoTo /D (page.41) >>
+>>
+endobj
+6689 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [476.009 268.576 487.972 278.49]
+/A << /S /GoTo /D (page.40) >>
+>>
+endobj
+6690 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [459.09 256.621 471.053 266.535]
+/A << /S /GoTo /D (page.38) >>
+>>
+endobj
+6691 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [477.022 244.665 488.985 254.58]
+/A << /S /GoTo /D (page.39) >>
+>>
+endobj
+6692 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [448.528 232.71 460.491 242.625]
+/A << /S /GoTo /D (page.39) >>
+>>
+endobj
+6693 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [471.571 220.755 483.534 230.669]
+/A << /S /GoTo /D (page.41) >>
+>>
+endobj
+6694 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [454.32 208.8 466.283 218.714]
+/A << /S /GoTo /D (page.41) >>
+>>
+endobj
+6695 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [414.384 196.845 426.347 206.759]
+/A << /S /GoTo /D (page.40) >>
+>>
+endobj
+6696 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [429.179 184.89 441.141 194.804]
+/A << /S /GoTo /D (page.40) >>
+>>
+endobj
+6697 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [459.96 172.934 471.923 182.849]
+/A << /S /GoTo /D (page.56) >>
+>>
+endobj
+6698 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [391.816 160.979 403.779 170.894]
+/A << /S /GoTo /D (page.36) >>
+>>
+endobj
+6699 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [391.816 149.024 403.779 158.938]
+/A << /S /GoTo /D (page.36) >>
+>>
+endobj
+6700 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [391.816 137.069 403.779 146.983]
+/A << /S /GoTo /D (page.37) >>
+>>
+endobj
+6701 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [391.305 125.114 403.268 135.028]
+/A << /S /GoTo /D (page.56) >>
+>>
+endobj
+6702 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [366.397 113.159 378.36 123.073]
+/A << /S /GoTo /D (page.47) >>
+>>
+endobj
+6703 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [423.709 101.203 435.672 111.118]
+/A << /S /GoTo /D (page.37) >>
+>>
+endobj
+6704 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [403.535 89.248 415.498 98.956]
+/A << /S /GoTo /D (page.36) >>
+>>
+endobj
+6705 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [363.904 77.293 375.867 87.207]
+/A << /S /GoTo /D (page.34) >>
+>>
+endobj
+6710 0 obj
+<<
+/D [6708 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+6707 0 obj
+<<
+/Font << /F50 2307 0 R /F43 2258 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+6825 0 obj
+<<
+/Length 1597      
+/Filter /FlateDecode
+>>
+stream
+xÚ½š[s¢H€ßý<jÕ†¥¹óH/ƒ,˜g³S�ŽRcÀ
ÌŒÿ~»Áx‹Ò�˜¼hÔð�û9Ý
3c8¦ßº�´þîI£²š,Ìä™Q8V•eFÑxVÌ$dÛC«kN;?&_QPYIUÑ¥Å@ð×-sÒúÕè[Ž
[€ª²*/2ÁKëñÇ„è·/Ç
+šÊü.þó…%�•D
ý½`ÜÖ?-n_)ôýN)�c
¡eÀroZ=XæÔ6�‰ÙõîM×Õ;×î›
+•š¤³�JN¿Å<ÞðŠÚ–„Íï¥$ôr«IÒóÎcÐ7Ë3tK$°Ó÷­á¿HCs:!ÑÀiš\ÒVqÍb�'Q”J�JŠ,’(*Á2÷Á¶ÇvÔ¤4δÜáØjæ°¯¦s;v‡“ïŒ Ub¾9žk�­~�´•È)/I@#0D¾2€SQTI„êäœJœæfév’Aò!êh¬ÆK‡ÀÉÈõtÓõ¯z†qï©ž;ÐùòRæÔù"žÀÎkz‚Jøgˆ–ß‹î_O4¨a5’÷&ZPÅÏs¸m�††Þ
¨B&¨`=»,–Žˆ>ã—±15ÕF�)b€XÞÓÇ?Á�ÚD¨|T�mÒGÍæ”A·½á­‰²O÷º¦át$®ýÝžÔärç�¦E�¬®{»çz·#ð‚
+’ú“Î1€içeNîs?ŠÉ�”êR&2˜Ã'òOkƒúãk‡—Ú05Þ”3°n55;rÞæÆ"‚qn#&JÙ¨�áçðÄâ×øÅ�ÃzbiZõ�§3ºŠQê:Z¥p´¿Ó¢&î½;ÝhæÀ_«(…/È­YM{ŽæëvÊz«]3åJØò(Ð5™g»°1(V%è�ç<5\€4þNúÌ
\¤T‘Ð^
+ƒ×ŽÊQä”Z3§…œSO~èÀl™ÄÉÊP™¸BßâáÙ  áƒ)™Xû¤³•HSôdyçÄ|Å�‚›Ì|^“äˆ5å˜qP~^/sšrˆ¶(4×–Ó‹â(›Ã�Ä•jrp±H.„Êç ’”¨jõbé§|*¦D‰îäj°’Ô^-$"O&ãü
+z!J#�ä=Vä>Éï²FÖ©à\ÍO{´ežN/lZÕ,Å2¿Íý<³ /òš5KšŒCâ„Pê®:4®bBlrÁC}d[&Ñ$µ:zˆS.áÏo{UÑ"
+öÖp$€("I~F�BÙCÿ¿3¼XEY¬(îø¦_vÿźëç~m9Ç…†ˆ{Ö»s?…×pô}ot
Œ�UCïQ<»ÐÌ}ÚŽ%Y>(O…Vù¼92……Çö]H6[ш\÷î>	aFáB�]Ç]ŽÙ©t4-ÿ…&O¸šØ&•I–ÍôÅ,Û®¥(ô”Ì« VËe²Q
†ý4Y-³Ë]¼K€Í’¯ãš'Âb»ßN“/ðWÄe»V˜ ZÎaê®"òºH­^›æ‡ÉK3žuú‚r3©*DÖm‡�4ÞU¹2’˜c†Û¬¹”ÂO—í\Tµ.¾ÞŽ…š_î š‡¦¤ÑìhâSÀîa–ù3Ø<Í8?ÎûæîÛë¨Ë�|®qìóç¦îlÎ2¼.–±9g.^u¯<ó0L{bv›pPßÞÀ·¦Kyh ¾*×;U‘(…öpÂëÃуc~š¡½‡ÑÈèV×èw�ÅR™Š·?q•¹„ö	þ" ¢5Psƒ8Šñø 	á~GìÆZuÝJ<lo8ÉaJQ¨$|
+qC®è¤TF¼sÞi1Û#ŸÄHâœnû¨Id¯—Ñe
+º‹;î5é›l
+áþÉ/Ô—K´õs´~r!’L<ªÖª›ð~×ß)éJú­†²¹_êG¡@¤
.‡Óþ¸ºÔï§Ãú1…ÅAy?ã#Š
+-y.äŠDn9§ÓÀ·°²`ã—e>ð‰«,­zŸÂ Á7T6=�âfÅŸÙð-©‡c©zw\¹Šã(žÑØY½7:¦]¬ÝYÞÎòë‘ÝuœÏa4¨N£ü²ì9}vê¡2Ib9
Ôy¦ìí
7™åYÜ{ÀM”XYÞ¤AÆ0Ž¦S(Tž¬—w“¢¾Ö3djñ�ªHÅÿ
¹â#Q
+endstream
+endobj
+6824 0 obj
+<<
+/Type /Page
+/Contents 6825 0 R
+/Resources 6823 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 6424 0 R
+/Annots [ 6706 0 R 6711 0 R 6712 0 R 6713 0 R 6714 0 R 6715 0 R 6716 0 R 6717 0 R 6718 0 R 6719 0 R 6720 0 R 6721 0 R 6722 0 R 6723 0 R 6724 0 R 6725 0 R 6726 0 R 6727 0 R 6728 0 R 6729 0 R 6730 0 R 6731 0 R 6732 0 R 6733 0 R 6734 0 R 6735 0 R 6736 0 R 6737 0 R 6738 0 R 6739 0 R 6740 0 R 6741 0 R 6742 0 R 6743 0 R 6744 0 R 6745 0 R 6746 0 R 6747 0 R 6748 0 R 6749 0 R 6750 0 R 6751 0 R 6752 0 R 6753 0 R 6754 0 R 6755 0 R 6756 0 R 6757 0 R 6758 0 R 6759 0 R 6760 0 R 6761 0 R 6762 0 R 6763 0 R 6764 0 R 6765 0 R 6766 0 R 6767 0 R 6768 0 R 6769 0 R 6770 0 R 6771 0 R 6772 0 R 6773 0 R 6774 0 R 6775 0 R 6776 0 R 6777 0 R 6778 0 R 6779 0 R 6780 0 R 6781 0 R 6782 0 R 6783 0 R 6784 0 R 6785 0 R 6786 0 R 6787 0 R 6788 0 R 6789 0 R 6790 0 R 6791 0 R 6792 0 R 6793 0 R 6794 0 R 6795 0 R 6796 0 R 6797 0 R 6798 0 R 6799 0 R 6800 0 R 6801 0 R 6802 0 R 6803 0 R 6804 0 R 6805 0 R 6806 0 R 6807 0 R 6808 0 R 6809 0 R 6810 0 R 6811 0 R 6812 0 R 6813 0 R 6814 0 R 6815 0 R 6816 0 R 6817 0 R 6818 0 R 6819 0 R 6820 0 R 6821 0 R ]
+>>
+endobj
+6706 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [205.119 758.738 217.082 768.652]
+/A << /S /GoTo /D (page.53) >>
+>>
+endobj
+6711 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [159.266 746.783 171.228 756.697]
+/A << /S /GoTo /D (page.54) >>
+>>
+endobj
+6712 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [189.93 734.827 201.893 744.742]
+/A << /S /GoTo /D (page.51) >>
+>>
+endobj
+6713 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.165 722.204 143.128 732.58]
+/A << /S /GoTo /D (page.57) >>
+>>
+endobj
+6714 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.165 710.249 143.128 720.625]
+/A << /S /GoTo /D (page.58) >>
+>>
+endobj
+6715 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [220.056 698.962 232.019 708.876]
+/A << /S /GoTo /D (page.54) >>
+>>
+endobj
+6716 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.103 687.007 158.066 696.921]
+/A << /S /GoTo /D (page.35) >>
+>>
+endobj
+6717 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [179.027 675.052 190.99 684.966]
+/A << /S /GoTo /D (page.51) >>
+>>
+endobj
+6718 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.687 663.096 137.65 672.804]
+/A << /S /GoTo /D (page.42) >>
+>>
+endobj
+6719 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [115.716 651.141 127.679 660.849]
+/A << /S /GoTo /D (page.43) >>
+>>
+endobj
+6720 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [144.839 639.186 156.802 649.1]
+/A << /S /GoTo /D (page.56) >>
+>>
+endobj
+6721 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.18 615.276 138.143 624.984]
+/A << /S /GoTo /D (page.42) >>
+>>
+endobj
+6722 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.18 591.365 138.143 601.073]
+/A << /S /GoTo /D (page.42) >>
+>>
+endobj
+6723 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.18 567.455 138.143 577.163]
+/A << /S /GoTo /D (page.41) >>
+>>
+endobj
+6724 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.18 543.545 138.143 553.253]
+/A << /S /GoTo /D (page.42) >>
+>>
+endobj
+6725 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.18 519.634 138.143 529.342]
+/A << /S /GoTo /D (page.36) >>
+>>
+endobj
+6726 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [115.589 507.679 127.551 517.593]
+/A << /S /GoTo /D (page.63) >>
+>>
+endobj
+6727 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [130.544 507.679 142.507 517.593]
+/A << /S /GoTo /D (page.64) >>
+>>
+endobj
+6728 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.983 495.724 203.946 505.638]
+/A << /S /GoTo /D (page.64) >>
+>>
+endobj
+6729 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.983 483.769 203.946 493.683]
+/A << /S /GoTo /D (page.63) >>
+>>
+endobj
+6730 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [159.077 471.814 171.04 481.728]
+/A << /S /GoTo /D (page.63) >>
+>>
+endobj
+6731 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.574 459.859 172.537 469.773]
+/A << /S /GoTo /D (page.63) >>
+>>
+endobj
+6732 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.004 447.903 149.967 457.611]
+/A << /S /GoTo /D (page.65) >>
+>>
+endobj
+6733 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [152.959 447.903 164.922 457.611]
+/A << /S /GoTo /D (page.66) >>
+>>
+endobj
+6734 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [185.187 435.948 197.15 445.862]
+/A << /S /GoTo /D (page.65) >>
+>>
+endobj
+6735 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [228.377 423.325 240.34 433.907]
+/A << /S /GoTo /D (page.66) >>
+>>
+endobj
+6736 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [115.938 412.038 127.901 421.746]
+/A << /S /GoTo /D (page.67) >>
+>>
+endobj
+6737 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [130.894 412.038 142.857 421.746]
+/A << /S /GoTo /D (page.68) >>
+>>
+endobj
+6738 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [124.037 400.083 136 409.791]
+/A << /S /GoTo /D (page.68) >>
+>>
+endobj
+6739 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [176.005 387.46 187.968 398.042]
+/A << /S /GoTo /D (page.67) >>
+>>
+endobj
+6740 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [121.903 375.612 133.866 385.88]
+/A << /S /GoTo /D (page.68) >>
+>>
+endobj
+6741 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.416 363.657 145.379 373.925]
+/A << /S /GoTo /D (page.68) >>
+>>
+endobj
+6742 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.18 340.307 138.143 350.015]
+/A << /S /GoTo /D (page.42) >>
+>>
+endobj
+6743 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.416 328.352 150.379 338.06]
+/A << /S /GoTo /D (page.68) >>
+>>
+endobj
+6744 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [153.372 328.352 165.335 338.06]
+/A << /S /GoTo /D (page.77) >>
+>>
+endobj
+6745 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [150.102 315.836 162.065 326.104]
+/A << /S /GoTo /D (page.73) >>
+>>
+endobj
+6746 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [181.349 303.773 193.312 314.356]
+/A << /S /GoTo /D (page.76) >>
+>>
+endobj
+6747 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [223.06 291.818 235.023 302.4]
+/A << /S /GoTo /D (page.76) >>
+>>
+endobj
+6748 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [173.324 279.863 185.287 290.445]
+/A << /S /GoTo /D (page.74) >>
+>>
+endobj
+6749 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [218.182 267.908 230.145 278.49]
+/A << /S /GoTo /D (page.74) >>
+>>
+endobj
+6750 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [167.577 255.953 179.54 266.535]
+/A << /S /GoTo /D (page.75) >>
+>>
+endobj
+6751 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [154.119 243.998 166.081 254.58]
+/A << /S /GoTo /D (page.75) >>
+>>
+endobj
+6752 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [162.592 232.042 174.555 242.625]
+/A << /S /GoTo /D (page.71) >>
+>>
+endobj
+6753 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.455 220.195 150.418 230.463]
+/A << /S /GoTo /D (page.70) >>
+>>
+endobj
+6754 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [161.372 208.24 173.335 218.508]
+/A << /S /GoTo /D (page.72) >>
+>>
+endobj
+6755 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [127.175 196.284 139.138 206.553]
+/A << /S /GoTo /D (page.70) >>
+>>
+endobj
+6756 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [150.093 184.329 162.056 194.598]
+/A << /S /GoTo /D (page.72) >>
+>>
+endobj
+6757 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.136 172.374 151.099 182.642]
+/A << /S /GoTo /D (page.69) >>
+>>
+endobj
+6758 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [162.054 160.419 174.017 170.687]
+/A << /S /GoTo /D (page.72) >>
+>>
+endobj
+6759 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [178.498 148.464 190.461 158.732]
+/A << /S /GoTo /D (page.73) >>
+>>
+endobj
+6760 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [149.6 136.509 161.563 146.777]
+/A << /S /GoTo /D (page.71) >>
+>>
+endobj
+6761 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [152.81 125.114 164.773 134.822]
+/A << /S /GoTo /D (page.74) >>
+>>
+endobj
+6762 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [141.635 113.159 153.598 122.867]
+/A << /S /GoTo /D (page.77) >>
+>>
+endobj
+6763 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [156.591 113.159 168.554 122.867]
+/A << /S /GoTo /D (page.90) >>
+>>
+endobj
+6764 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.112 101.203 158.075 110.911]
+/A << /S /GoTo /D (page.82) >>
+>>
+endobj
+6765 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [189.553 88.688 201.516 99.163]
+/A << /S /GoTo /D (page.81) >>
+>>
+endobj
+6766 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [150.595 77.293 162.558 87.207]
+/A << /S /GoTo /D (page.84) >>
+>>
+endobj
+6767 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [393.941 758.177 405.904 768.446]
+/A << /S /GoTo /D (page.84) >>
+>>
+endobj
+6768 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [393.278 746.222 405.241 756.697]
+/A << /S /GoTo /D (page.82) >>
+>>
+endobj
+6769 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [372.378 734.827 384.34 744.535]
+/A << /S /GoTo /D (page.82) >>
+>>
+endobj
+6770 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [374.027 722.204 385.99 732.58]
+/A << /S /GoTo /D (page.84) >>
+>>
+endobj
+6771 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [389.61 710.917 401.573 720.831]
+/A << /S /GoTo /D (page.84) >>
+>>
+endobj
+6772 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [412.214 698.402 424.177 708.876]
+/A << /S /GoTo /D (page.79) >>
+>>
+endobj
+6773 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [399.294 687.007 411.257 696.921]
+/A << /S /GoTo /D (page.83) >>
+>>
+endobj
+6774 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [371.884 675.052 383.847 684.966]
+/A << /S /GoTo /D (page.83) >>
+>>
+endobj
+6775 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [404.808 663.096 416.771 673.011]
+/A << /S /GoTo /D (page.80) >>
+>>
+endobj
+6776 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [424.839 650.581 436.802 661.055]
+/A << /S /GoTo /D (page.80) >>
+>>
+endobj
+6777 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [402.136 638.518 414.099 649.1]
+/A << /S /GoTo /D (page.81) >>
+>>
+endobj
+6778 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [384.84 626.563 396.803 637.145]
+/A << /S /GoTo /D (page.81) >>
+>>
+endobj
+6779 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [425.574 614.715 437.537 625.19]
+/A << /S /GoTo /D (page.80) >>
+>>
+endobj
+6780 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [384.123 603.321 396.086 613.029]
+/A << /S /GoTo /D (page.83) >>
+>>
+endobj
+6781 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [396.156 591.365 408.119 601.28]
+/A << /S /GoTo /D (page.90) >>
+>>
+endobj
+6782 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [375.865 578.85 387.828 589.324]
+/A << /S /GoTo /D (page.85) >>
+>>
+endobj
+6783 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [381.344 567.455 393.307 577.163]
+/A << /S /GoTo /D (page.85) >>
+>>
+endobj
+6784 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [364.765 555.5 376.728 565.208]
+/A << /S /GoTo /D (page.87) >>
+>>
+endobj
+6785 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [371.884 543.545 383.847 553.253]
+/A << /S /GoTo /D (page.86) >>
+>>
+endobj
+6786 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [371.373 531.59 383.336 541.504]
+/A << /S /GoTo /D (page.79) >>
+>>
+endobj
+6787 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [433.025 519.634 444.988 529.549]
+/A << /S /GoTo /D (page.88) >>
+>>
+endobj
+6788 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [408.52 507.119 420.483 517.593]
+/A << /S /GoTo /D (page.88) >>
+>>
+endobj
+6789 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [392.803 495.724 404.766 505.638]
+/A << /S /GoTo /D (page.87) >>
+>>
+endobj
+6790 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [389.315 483.769 401.278 493.683]
+/A << /S /GoTo /D (page.86) >>
+>>
+endobj
+6791 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [405.266 471.146 417.229 481.728]
+/A << /S /GoTo /D (page.85) >>
+>>
+endobj
+6792 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [410.887 459.298 422.85 469.773]
+/A << /S /GoTo /D (page.88) >>
+>>
+endobj
+6793 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [389.79 447.343 401.753 457.611]
+/A << /S /GoTo /D (page.87) >>
+>>
+endobj
+6794 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 423.993 369.896 433.701]
+/A << /S /GoTo /D (page.56) >>
+>>
+endobj
+6795 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 400.083 369.896 409.791]
+/A << /S /GoTo /D (page.45) >>
+>>
+endobj
+6796 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 376.172 369.896 385.88]
+/A << /S /GoTo /D (page.56) >>
+>>
+endobj
+6797 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 352.262 369.896 361.97]
+/A << /S /GoTo /D (page.45) >>
+>>
+endobj
+6798 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [367.04 339.747 379.003 350.015]
+/A << /S /GoTo /D (page.91) >>
+>>
+endobj
+6799 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [381.996 339.747 398.944 350.015]
+/A << /S /GoTo /D (page.100) >>
+>>
+endobj
+6800 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [421.333 328.352 433.296 338.266]
+/A << /S /GoTo /D (page.99) >>
+>>
+endobj
+6801 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [394.264 316.397 406.227 326.311]
+/A << /S /GoTo /D (page.99) >>
+>>
+endobj
+6802 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [419.477 304.441 436.425 314.356]
+/A << /S /GoTo /D (page.100) >>
+>>
+endobj
+6803 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [408.753 291.926 420.716 302.4]
+/A << /S /GoTo /D (page.95) >>
+>>
+endobj
+6804 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [429.178 279.971 441.141 290.445]
+/A << /S /GoTo /D (page.96) >>
+>>
+endobj
+6805 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [429.689 268.015 441.652 278.49]
+/A << /S /GoTo /D (page.96) >>
+>>
+endobj
+6806 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [425.108 256.06 437.071 266.535]
+/A << /S /GoTo /D (page.98) >>
+>>
+endobj
+6807 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [401.813 244.105 413.776 254.58]
+/A << /S /GoTo /D (page.97) >>
+>>
+endobj
+6808 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [426.426 232.71 438.389 242.625]
+/A << /S /GoTo /D (page.97) >>
+>>
+endobj
+6809 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [401.688 220.755 413.651 230.669]
+/A << /S /GoTo /D (page.97) >>
+>>
+endobj
+6810 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [404.145 208.24 416.108 218.508]
+/A << /S /GoTo /D (page.98) >>
+>>
+endobj
+6811 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [395.349 196.845 407.312 206.759]
+/A << /S /GoTo /D (page.99) >>
+>>
+endobj
+6812 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [423.198 184.329 435.161 194.804]
+/A << /S /GoTo /D (page.95) >>
+>>
+endobj
+6813 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [395.295 172.374 407.258 182.849]
+/A << /S /GoTo /D (page.94) >>
+>>
+endobj
+6814 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [397.743 160.419 409.706 170.687]
+/A << /S /GoTo /D (page.92) >>
+>>
+endobj
+6815 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [374.009 149.024 385.972 158.938]
+/A << /S /GoTo /D (page.96) >>
+>>
+endobj
+6816 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [362.228 137.069 374.191 146.983]
+/A << /S /GoTo /D (page.93) >>
+>>
+endobj
+6817 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [377.497 124.446 389.46 134.822]
+/A << /S /GoTo /D (page.93) >>
+>>
+endobj
+6818 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [386.965 112.491 398.928 123.073]
+/A << /S /GoTo /D (page.93) >>
+>>
+endobj
+6819 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [413.192 100.535 425.155 111.118]
+/A << /S /GoTo /D (page.93) >>
+>>
+endobj
+6820 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [414.375 88.58 426.338 99.163]
+/A << /S /GoTo /D (page.94) >>
+>>
+endobj
+6821 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [384.374 76.733 396.337 87.001]
+/A << /S /GoTo /D (page.94) >>
+>>
+endobj
+6826 0 obj
+<<
+/D [6824 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+6823 0 obj
+<<
+/Font << /F50 2307 0 R /F43 2258 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+6914 0 obj
+<<
+/Length 1170      
+/Filter /FlateDecode
+>>
+stream
+xÚÅZ]s¢J}÷Wð(U7\†�'ÊÆ
ÜJnj‹"81Ô"°@v“Äd5‰É‹£ §O÷LŸixfÅð̤7rzÿžË<£p*„"ãÜ3žS dªÀAÀ8K涠Äþp¾1’9 ‰äÂò°>£ëâD9½_=@Žóx
PN$Æ_÷nðÌ’œûÆðœ¨*ÌŸòŸkF’EN.ñBÆî]õø¿I‘㯤Tž¨Žß²zL–^Žµ”=ùþs’ÇZå˜%?žòJZ>éª"fMzÌí™0Púª\�ßØc΀ʩ‚LFÀ©²¼ÁÏÃÌ
ãÕ
+§¬Ì÷¹
+&àÁ.èmŸzܽâ=„
FØ…á+ø‚0‰gßÏ©XòûX¯l´ÚPRm¨1ν ÌZ@’œÚ�AŽ�÷E>z¢»)Òp.Xâ#f²JÑ“ÿàE«O“{�RoþoV�û8�â0Œ�§º‡já,‰£¬…XÚ
Y„«¦	ñÇ	ü"�?‹|ìܬY å .“1ˆòû¦™ö®n83Û½^»²
+1rÜQ%Ÿ;†/"\‘*.¢òöþzkY>¡eÝœ"Ë=·†�ÉWضºƒìcã-�&–g:š;®6êsw†æG»­~Öx.ñ‡¬Ã=ë†q¡ŸØäžÃHÓÜsÍÆÝZ½vÜÙp„fGOî Ax‰U4·ucnwêlkù;h`t:´§�·0èÚÈV2,?Ô­Çh63:ÕH}ľ¿8?ï`kØ‹¶þ½uÚs÷m·…r?,r¸¿Õ†ÌňŒ7‡§5n#ÍBÎ
û'uþ¦ÓŒ2(ëû„E€±pÌ…ãZH3¬q;K}×üþÈS*€“¤=:欨>ò–Ÿ¦}á^cd·€ÃVm’ää6ý;)
¿¦{C ólÿ‹Á|x‰º
ÿth¡ñVl:Wz[Ÿ´«²JCã_©²Äþ¼*`úûÓ4ª-vìN¬âÞÜX˜ÝÞ„í’ !éV~¶ed¡¶Ý߆9ºvÑeÚ­ÑØϽeVtPj´FaÓÖ(é­Ñu†
½i¨ì
šãzI‚£¥{W¶èè�CÀ7EÌ>	ß@QÞžÇ嶗åÛVÚª…úñ:ñRÜ=?NŠÄ|¦’¨P÷i¼vï¼C‰Š¨sZ¢=lžYPýT©ä~’„h
&~̓Ǽ®—b]¼š~Ö˜„
+°Ér£ƒ¦%½ªñMoyטÝì!¸ÏÝßç-LJåëcä{ycrŠxò+¸Ãõ4H�5\¦k¸y¥��«iCwL*¨¢|½1�¦ÀüG˜h^Sª±ß–!Kã<öã°FÄäÆSé#{>]?Ä^D…;,�REا.Q0¨�E6�VpRìÿnŹ¬#å`&W@¹Wó±'€uxåqÒ4RÖŸ²—¦£sòõªì€èäfìØJP†5E$óê$ƒÚ4DþÝþÇ{ïÈ2Ç‹ É«Û÷ ' T¼b É'Ë9«¹Ÿà§Do—lIiSÎm¾�ãr7{^Yæû8ÚáJ8þAS©{
+endstream
+endobj
+6913 0 obj
+<<
+/Type /Page
+/Contents 6914 0 R
+/Resources 6912 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 6424 0 R
+/Annots [ 6822 0 R 6827 0 R 6828 0 R 6829 0 R 6830 0 R 6831 0 R 6832 0 R 6833 0 R 6834 0 R 6835 0 R 6836 0 R 6837 0 R 6838 0 R 6839 0 R 6840 0 R 6841 0 R 6842 0 R 6843 0 R 6844 0 R 6845 0 R 6846 0 R 6847 0 R 6848 0 R 6849 0 R 6850 0 R 6851 0 R 6852 0 R 6853 0 R 6854 0 R 6855 0 R 6856 0 R 6857 0 R 6858 0 R 6859 0 R 6860 0 R 6861 0 R 6862 0 R 6863 0 R 6864 0 R 6865 0 R 6866 0 R 6867 0 R 6868 0 R 6869 0 R 6870 0 R 6871 0 R 6872 0 R 6873 0 R 6874 0 R 6875 0 R 6876 0 R 6877 0 R 6878 0 R 6879 0 R 6880 0 R 6881 0 R 6882 0 R 6883 0 R 6884 0 R 6885 0 R 6886 0 R 6887 0 R 6888 0 R 6889 0 R 6890 0 R 6891 0 R 6892 0 R 6893 0 R 6894 0 R 6895 0 R 6896 0 R 6897 0 R 6898 0 R 6899 0 R 6900 0 R 6901 0 R 6902 0 R 6903 0 R 6904 0 R 6905 0 R 6906 0 R 6907 0 R 6908 0 R 6909 0 R 6910 0 R ]
+>>
+endobj
+6822 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [179.502 758.177 191.465 768.652]
+/A << /S /GoTo /D (page.95) >>
+>>
+endobj
+6827 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [120.753 746.115 137.701 756.491]
+/A << /S /GoTo /D (page.101) >>
+>>
+endobj
+6828 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [140.694 746.115 157.642 756.491]
+/A << /S /GoTo /D (page.106) >>
+>>
+endobj
+6829 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.741 734.159 123.689 744.535]
+/A << /S /GoTo /D (page.102) >>
+>>
+endobj
+6830 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.534 722.204 142.482 732.58]
+/A << /S /GoTo /D (page.105) >>
+>>
+endobj
+6831 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [124.037 710.249 140.985 720.831]
+/A << /S /GoTo /D (page.104) >>
+>>
+endobj
+6832 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [151.438 698.294 168.386 708.876]
+/A << /S /GoTo /D (page.104) >>
+>>
+endobj
+6833 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [153.581 686.339 170.529 696.921]
+/A << /S /GoTo /D (page.105) >>
+>>
+endobj
+6834 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.146 674.384 152.094 684.76]
+/A << /S /GoTo /D (page.103) >>
+>>
+endobj
+6835 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [161.525 662.428 178.473 672.804]
+/A << /S /GoTo /D (page.105) >>
+>>
+endobj
+6836 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [153.616 650.473 170.565 661.055]
+/A << /S /GoTo /D (page.103) >>
+>>
+endobj
+6837 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [173.557 638.518 190.506 649.1]
+/A << /S /GoTo /D (page.105) >>
+>>
+endobj
+6838 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [132.653 626.563 149.602 637.145]
+/A << /S /GoTo /D (page.106) >>
+>>
+endobj
+6839 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [130.296 614.608 147.244 624.984]
+/A << /S /GoTo /D (page.103) >>
+>>
+endobj
+6840 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.664 602.76 143.612 613.235]
+/A << /S /GoTo /D (page.102) >>
+>>
+endobj
+6841 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.18 579.41 138.143 589.118]
+/A << /S /GoTo /D (page.38) >>
+>>
+endobj
+6842 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.18 555.5 138.143 565.208]
+/A << /S /GoTo /D (page.38) >>
+>>
+endobj
+6843 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.18 531.59 138.143 541.297]
+/A << /S /GoTo /D (page.38) >>
+>>
+endobj
+6844 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.18 507.679 138.143 517.387]
+/A << /S /GoTo /D (page.41) >>
+>>
+endobj
+6845 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.18 483.769 138.143 493.477]
+/A << /S /GoTo /D (page.39) >>
+>>
+endobj
+6846 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.18 459.859 138.143 469.566]
+/A << /S /GoTo /D (page.40) >>
+>>
+endobj
+6847 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.18 435.948 138.143 445.656]
+/A << /S /GoTo /D (page.40) >>
+>>
+endobj
+6848 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.18 412.038 138.143 421.746]
+/A << /S /GoTo /D (page.40) >>
+>>
+endobj
+6849 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.18 388.128 138.143 397.835]
+/A << /S /GoTo /D (page.37) >>
+>>
+endobj
+6850 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.18 364.217 138.143 373.925]
+/A << /S /GoTo /D (page.40) >>
+>>
+endobj
+6851 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.18 340.307 138.143 350.015]
+/A << /S /GoTo /D (page.37) >>
+>>
+endobj
+6852 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.18 316.397 138.143 326.104]
+/A << /S /GoTo /D (page.37) >>
+>>
+endobj
+6853 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.18 292.486 138.143 302.194]
+/A << /S /GoTo /D (page.37) >>
+>>
+endobj
+6854 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.18 268.576 138.143 278.284]
+/A << /S /GoTo /D (page.38) >>
+>>
+endobj
+6855 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.18 244.665 138.143 254.373]
+/A << /S /GoTo /D (page.38) >>
+>>
+endobj
+6856 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.18 220.755 138.143 230.463]
+/A << /S /GoTo /D (page.40) >>
+>>
+endobj
+6857 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.18 196.845 138.143 206.553]
+/A << /S /GoTo /D (page.39) >>
+>>
+endobj
+6858 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.18 172.934 138.143 182.642]
+/A << /S /GoTo /D (page.39) >>
+>>
+endobj
+6859 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.18 149.024 138.143 158.732]
+/A << /S /GoTo /D (page.39) >>
+>>
+endobj
+6860 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.18 125.114 138.143 134.822]
+/A << /S /GoTo /D (page.37) >>
+>>
+endobj
+6861 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.18 101.203 138.143 110.911]
+/A << /S /GoTo /D (page.41) >>
+>>
+endobj
+6862 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.18 77.293 138.143 87.001]
+/A << /S /GoTo /D (page.41) >>
+>>
+endobj
+6863 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 746.783 369.896 756.491]
+/A << /S /GoTo /D (page.38) >>
+>>
+endobj
+6864 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 722.872 369.896 732.58]
+/A << /S /GoTo /D (page.41) >>
+>>
+endobj
+6865 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 698.962 369.896 708.67]
+/A << /S /GoTo /D (page.39) >>
+>>
+endobj
+6866 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 675.052 369.896 684.76]
+/A << /S /GoTo /D (page.39) >>
+>>
+endobj
+6867 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 651.141 369.896 660.849]
+/A << /S /GoTo /D (page.41) >>
+>>
+endobj
+6868 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 627.231 369.896 636.939]
+/A << /S /GoTo /D (page.40) >>
+>>
+endobj
+6869 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 603.321 369.896 613.029]
+/A << /S /GoTo /D (page.38) >>
+>>
+endobj
+6870 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 579.41 369.896 589.118]
+/A << /S /GoTo /D (page.39) >>
+>>
+endobj
+6871 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 555.5 369.896 565.208]
+/A << /S /GoTo /D (page.39) >>
+>>
+endobj
+6872 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 531.59 369.896 541.297]
+/A << /S /GoTo /D (page.41) >>
+>>
+endobj
+6873 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 507.679 369.896 517.387]
+/A << /S /GoTo /D (page.41) >>
+>>
+endobj
+6874 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 483.769 369.896 493.477]
+/A << /S /GoTo /D (page.40) >>
+>>
+endobj
+6875 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 459.859 369.896 469.566]
+/A << /S /GoTo /D (page.40) >>
+>>
+endobj
+6876 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [354.317 447.903 371.265 457.611]
+/A << /S /GoTo /D (page.106) >>
+>>
+endobj
+6877 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [374.258 447.903 391.206 457.611]
+/A << /S /GoTo /D (page.113) >>
+>>
+endobj
+6878 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [346.447 435.948 363.395 445.656]
+/A << /S /GoTo /D (page.108) >>
+>>
+endobj
+6879 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [402.11 423.433 419.058 433.907]
+/A << /S /GoTo /D (page.110) >>
+>>
+endobj
+6880 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [406.593 411.478 423.541 421.952]
+/A << /S /GoTo /D (page.110) >>
+>>
+endobj
+6881 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [394.811 399.522 411.759 409.997]
+/A << /S /GoTo /D (page.108) >>
+>>
+endobj
+6882 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [407.274 387.567 424.222 398.042]
+/A << /S /GoTo /D (page.108) >>
+>>
+endobj
+6883 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [407.399 375.504 424.348 386.087]
+/A << /S /GoTo /D (page.110) >>
+>>
+endobj
+6884 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [385.325 363.657 402.273 374.131]
+/A << /S /GoTo /D (page.108) >>
+>>
+endobj
+6885 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [369.114 351.702 386.062 362.176]
+/A << /S /GoTo /D (page.112) >>
+>>
+endobj
+6886 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [402.773 340.307 419.721 350.221]
+/A << /S /GoTo /D (page.111) >>
+>>
+endobj
+6887 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [387.548 328.352 404.497 338.266]
+/A << /S /GoTo /D (page.109) >>
+>>
+endobj
+6888 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [360.901 316.397 377.849 326.311]
+/A << /S /GoTo /D (page.109) >>
+>>
+endobj
+6889 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [409.767 303.881 426.715 314.356]
+/A << /S /GoTo /D (page.113) >>
+>>
+endobj
+6890 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [394.542 291.926 411.49 302.4]
+/A << /S /GoTo /D (page.112) >>
+>>
+endobj
+6891 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [402.414 279.863 419.362 290.445]
+/A << /S /GoTo /D (page.112) >>
+>>
+endobj
+6892 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [379.847 268.576 396.795 278.49]
+/A << /S /GoTo /D (page.111) >>
+>>
+endobj
+6893 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [383.836 256.621 400.784 266.535]
+/A << /S /GoTo /D (page.109) >>
+>>
+endobj
+6894 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [382.975 244.665 399.924 254.58]
+/A << /S /GoTo /D (page.111) >>
+>>
+endobj
+6895 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [349.834 232.15 366.782 242.418]
+/A << /S /GoTo /D (page.114) >>
+>>
+endobj
+6896 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [369.775 232.15 386.723 242.418]
+/A << /S /GoTo /D (page.115) >>
+>>
+endobj
+6897 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [425.233 220.755 442.182 230.669]
+/A << /S /GoTo /D (page.115) >>
+>>
+endobj
+6898 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [425.233 208.8 442.182 218.714]
+/A << /S /GoTo /D (page.114) >>
+>>
+endobj
+6899 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [359.93 196.284 376.878 206.553]
+/A << /S /GoTo /D (page.115) >>
+>>
+endobj
+6900 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [379.871 196.284 396.819 206.553]
+/A << /S /GoTo /D (page.119) >>
+>>
+endobj
+6901 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [379.362 184.89 396.31 194.804]
+/A << /S /GoTo /D (page.118) >>
+>>
+endobj
+6902 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [389.333 172.934 406.281 182.849]
+/A << /S /GoTo /D (page.117) >>
+>>
+endobj
+6903 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [372.889 160.979 389.837 170.894]
+/A << /S /GoTo /D (page.117) >>
+>>
+endobj
+6904 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [374.87 149.024 391.818 158.938]
+/A << /S /GoTo /D (page.118) >>
+>>
+endobj
+6905 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [377.372 137.069 394.32 146.983]
+/A << /S /GoTo /D (page.118) >>
+>>
+endobj
+6906 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [375.731 125.114 392.679 135.028]
+/A << /S /GoTo /D (page.116) >>
+>>
+endobj
+6907 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [374.879 112.598 391.827 123.073]
+/A << /S /GoTo /D (page.117) >>
+>>
+endobj
+6908 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 89.248 369.896 98.956]
+/A << /S /GoTo /D (page.56) >>
+>>
+endobj
+6909 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [339.496 77.293 356.444 87.001]
+/A << /S /GoTo /D (page.119) >>
+>>
+endobj
+6910 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [359.437 77.293 376.385 87.001]
+/A << /S /GoTo /D (page.130) >>
+>>
+endobj
+6915 0 obj
+<<
+/D [6913 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+6912 0 obj
+<<
+/Font << /F50 2307 0 R /F43 2258 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+7033 0 obj
+<<
+/Length 1316      
+/Filter /FlateDecode
+>>
+stream
+xÚµš[S£H†ïó+¸U+KMàRc<ŒŽÎ
+N¹åNQ�¤wdéfÆüûmÑÄR>íM’"áé—ïL]Y(ºr>:ñGža]q4׶MÅŸ+]sl[™¸†f#Å�•ÇñåÍéìAýáQ,ÓÑ°ãˆS«/��Ëã™?úo„ÄQ]A/ÇÑÃR¢Õèñ‡®Äâ»/Š®™®£ü®~¹R,ljØ2ÅçDñF�ô]Qâø«(W×&®@ÛHÓ·ª¼ãë $a|J¢\=2õñfÍÿ¨äÔ:òE#èî|¤<gŒ§ùA½�x9BHs1ÞGÎÒÈI'ä•jéc¢‚™�„šïCí}¨¯"
]ˆ(3¢ë%ÉHB ‰¤ñ5}AZ�”ä*×ÈÉŽ¿•CšKp÷î
+Þ2ÌIì‰x"°Û]]bó¬XlÒw/C¶¼L)¬Ëu•¨ëÃcð
é¦HI¢n¾.d$\	û–gaì8¯½«–Ù,Ig�v›5‘�ÆËŸñ|ö¼Ó„aX\ãõG\qF0TD®œŠ�†+Øì:ˆ©M”ÆÙêdÃÉ¡ÅÓ~xñ0–PŽ]LEi:¥Ž3	–<µ�'Ì£‹4äEÚÍÔ{ᾫŽ¨ðâ’Óù¦o	>B®æxß7þµ0Qh¼·&Ü£5Šë°‚‚Ax8J(Iym=p¸žÈ©ïA€öL�À8Sÿ
Ø­™ñç
�‚yYçÃrHø¥xœM4qòÚŽ‡Yy™1Þ¡
”‹�®ZôÔåIi�û³³aþ¢O¥©‹ù|˜×h<ÌšWAN¢_CŒ¤u¬ÂçRI–ƒœöÙêVŽw29ÞYó|àîëÀhI,’y50æ©oêªÊ ª¸”ÚÛ˜šeQiëŸlÕîzÆE+dÃÞÐFÀ†6:½}†CA9g÷Œºû¿wql`;ð«-Œ÷ÚºX¦-h¶.ˆ÷4«^ðåç/§iöÄQli–%SÂþ5cdH¸æI‡k¬`›
åáL]„#óͼù8ÏÀ𔶠¼ËTo¶ÇpC
gfÓ„0—)G6ˆi/05Æ°Å쨩wOâ8c1ˆ3 \§ÛªÌiÜaG°tIé¦âðz:߆t_#}œ”÷ÓéÌó†æ$¶;æ$§‡ää¤wNºpN
+ßø{j¦YÊI9­?ƒûfû6^¹¹ðYìu˜3²ïk¿7‰¼ï“€qš$Á"Ëâ¾J?ì>ßgwC#ÌêZõÓtÝèTnß ²thDž±îÂK¿ÁKã¶�€Æ�$ŠYXøc°ÙXí5çGR	¸{oL
Œ‘+
tséùb~IF'’Œ$iÂ:”Ô8ñAPp|ÆCû®XE9™ö�ª÷(SX‹SfSPŒ…º`Nú¼Ælß]/5å|»µýzóJÄ°ÄáeF~Æëf[ªº
9	êvPý¹õ)ëÕV@B£^+Mà•ÊòŸÆA˜ðN[ó]·AŠ
Œò�0U¶ÞºVìÀ‘´ÅW&ZÓæ�Þ á;Ëí®¾öI;ì<÷²Ê.—IL+H.1$Œ9»³·i*Ùy¬xú—ÀÿŸõ0F�è	�)—’vâÆK²�wéÃÛ}ÍéÒì
ØáRôü-ƒru/c`¸–2v|íKÙ¾¿÷ÈÆšn¢>Oìl²5cb[;�YX³íÆ…çå#"AcµRTí¦þ|šUål³íPpº'UHüE<B¸
+endstream
+endobj
+7032 0 obj
+<<
+/Type /Page
+/Contents 7033 0 R
+/Resources 7031 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 7035 0 R
+/Annots [ 6911 0 R 6916 0 R 6917 0 R 6918 0 R 6919 0 R 6920 0 R 6921 0 R 6922 0 R 6923 0 R 6924 0 R 6925 0 R 6926 0 R 6927 0 R 6928 0 R 6929 0 R 6930 0 R 6931 0 R 6932 0 R 6933 0 R 6934 0 R 6935 0 R 6936 0 R 6937 0 R 6938 0 R 6939 0 R 6940 0 R 6941 0 R 6942 0 R 6943 0 R 6944 0 R 6945 0 R 6946 0 R 6947 0 R 6948 0 R 6949 0 R 6950 0 R 6951 0 R 6952 0 R 6953 0 R 6954 0 R 6955 0 R 6956 0 R 6957 0 R 6958 0 R 6959 0 R 6960 0 R 6961 0 R 6962 0 R 6963 0 R 6964 0 R 6965 0 R 6966 0 R 6967 0 R 6968 0 R 6969 0 R 6970 0 R 6971 0 R 6972 0 R 6973 0 R 6974 0 R 6975 0 R 6976 0 R 6977 0 R 6978 0 R 6979 0 R 6980 0 R 6981 0 R 6982 0 R 6983 0 R 6984 0 R 6985 0 R 6986 0 R 6987 0 R 6988 0 R 6989 0 R 6990 0 R 6991 0 R 6992 0 R 6993 0 R 6994 0 R 6995 0 R 6996 0 R 6997 0 R 6998 0 R 6999 0 R 7000 0 R 7001 0 R 7002 0 R 7003 0 R 7004 0 R 7005 0 R 7006 0 R 7007 0 R 7008 0 R 7009 0 R 7010 0 R 7011 0 R 7012 0 R 7013 0 R 7014 0 R 7015 0 R 7016 0 R 7017 0 R 7018 0 R 7019 0 R 7020 0 R 7021 0 R 7022 0 R 7023 0 R 7024 0 R 7025 0 R 7026 0 R 7027 0 R 7028 0 R 7029 0 R ]
+>>
+endobj
+6911 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [167.81 758.177 184.758 768.652]
+/A << /S /GoTo /D (page.128) >>
+>>
+endobj
+6916 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [167.317 746.222 184.265 756.697]
+/A << /S /GoTo /D (page.127) >>
+>>
+endobj
+6917 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [163.524 734.267 180.472 744.742]
+/A << /S /GoTo /D (page.123) >>
+>>
+endobj
+6918 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [162.986 722.204 179.934 732.786]
+/A << /S /GoTo /D (page.124) >>
+>>
+endobj
+6919 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.61 710.357 162.558 720.831]
+/A << /S /GoTo /D (page.121) >>
+>>
+endobj
+6920 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [143.628 698.962 160.576 708.876]
+/A << /S /GoTo /D (page.122) >>
+>>
+endobj
+6921 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [182.506 686.339 199.454 696.921]
+/A << /S /GoTo /D (page.128) >>
+>>
+endobj
+6922 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [206.831 674.384 223.779 684.966]
+/A << /S /GoTo /D (page.129) >>
+>>
+endobj
+6923 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [144.032 662.428 160.98 673.011]
+/A << /S /GoTo /D (page.121) >>
+>>
+endobj
+6924 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [148.111 651.141 165.059 661.055]
+/A << /S /GoTo /D (page.126) >>
+>>
+endobj
+6925 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [151.106 639.186 168.054 649.1]
+/A << /S /GoTo /D (page.123) >>
+>>
+endobj
+6926 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [151.59 627.231 168.538 637.145]
+/A << /S /GoTo /D (page.126) >>
+>>
+endobj
+6927 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [163.067 614.715 180.015 625.19]
+/A << /S /GoTo /D (page.127) >>
+>>
+endobj
+6928 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [189.598 602.76 206.546 613.235]
+/A << /S /GoTo /D (page.126) >>
+>>
+endobj
+6929 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [155.006 590.805 171.955 601.28]
+/A << /S /GoTo /D (page.123) >>
+>>
+endobj
+6930 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [164.062 578.85 181.01 589.324]
+/A << /S /GoTo /D (page.125) >>
+>>
+endobj
+6931 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [161.471 567.455 178.419 577.369]
+/A << /S /GoTo /D (page.125) >>
+>>
+endobj
+6932 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.634 555.5 155.582 565.414]
+/A << /S /GoTo /D (page.125) >>
+>>
+endobj
+6933 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [140.131 543.545 157.079 553.459]
+/A << /S /GoTo /D (page.122) >>
+>>
+endobj
+6934 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.136 531.59 156.084 541.504]
+/A << /S /GoTo /D (page.120) >>
+>>
+endobj
+6935 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [164.959 519.074 181.907 529.549]
+/A << /S /GoTo /D (page.124) >>
+>>
+endobj
+6936 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [170.939 507.679 187.887 517.593]
+/A << /S /GoTo /D (page.124) >>
+>>
+endobj
+6937 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [149.949 495.056 166.897 505.638]
+/A << /S /GoTo /D (page.122) >>
+>>
+endobj
+6938 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [132.654 483.101 149.602 493.683]
+/A << /S /GoTo /D (page.121) >>
+>>
+endobj
+6939 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [164.053 471.146 181.001 481.728]
+/A << /S /GoTo /D (page.130) >>
+>>
+endobj
+6940 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [186.388 459.191 203.336 469.773]
+/A << /S /GoTo /D (page.129) >>
+>>
+endobj
+6941 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.68 447.903 138.643 457.818]
+/A << /S /GoTo /D (page.22) >>
+>>
+endobj
+6942 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [143.117 435.388 155.08 445.656]
+/A << /S /GoTo /D (page.24) >>
+>>
+endobj
+6943 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.929 423.433 169.892 433.701]
+/A << /S /GoTo /D (page.24) >>
+>>
+endobj
+6944 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [112.713 412.038 124.676 421.952]
+/A << /S /GoTo /D (page.25) >>
+>>
+endobj
+6945 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.239 400.083 118.202 409.791]
+/A << /S /GoTo /D (page.25) >>
+>>
+endobj
+6946 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [112.713 388.128 124.676 398.042]
+/A << /S /GoTo /D (page.26) >>
+>>
+endobj
+6947 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.239 376.172 118.202 385.88]
+/A << /S /GoTo /D (page.26) >>
+>>
+endobj
+6948 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [156.45 363.549 168.413 374.131]
+/A << /S /GoTo /D (page.24) >>
+>>
+endobj
+6949 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.151 352.262 146.114 361.97]
+/A << /S /GoTo /D (page.24) >>
+>>
+endobj
+6950 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [107.234 340.307 119.197 350.221]
+/A << /S /GoTo /D (page.25) >>
+>>
+endobj
+6951 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [104.249 328.352 116.212 338.06]
+/A << /S /GoTo /D (page.25) >>
+>>
+endobj
+6952 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [120.594 316.397 132.557 326.104]
+/A << /S /GoTo /D (page.26) >>
+>>
+endobj
+6953 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [111.547 304.441 123.51 314.356]
+/A << /S /GoTo /D (page.26) >>
+>>
+endobj
+6954 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [101.756 292.486 113.719 302.194]
+/A << /S /GoTo /D (page.24) >>
+>>
+endobj
+6955 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [122.683 280.531 134.646 290.239]
+/A << /S /GoTo /D (page.24) >>
+>>
+endobj
+6956 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.185 268.576 137.148 278.284]
+/A << /S /GoTo /D (page.24) >>
+>>
+endobj
+6957 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [142.113 256.621 154.076 266.329]
+/A << /S /GoTo /D (page.23) >>
+>>
+endobj
+6958 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.077 244.665 137.04 254.58]
+/A << /S /GoTo /D (page.26) >>
+>>
+endobj
+6959 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [114.542 232.71 126.505 242.625]
+/A << /S /GoTo /D (page.26) >>
+>>
+endobj
+6960 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [105.244 220.195 117.207 230.463]
+/A << /S /GoTo /D (page.26) >>
+>>
+endobj
+6961 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [114.703 208.8 126.666 218.714]
+/A << /S /GoTo /D (page.25) >>
+>>
+endobj
+6962 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [109.942 196.845 121.905 206.553]
+/A << /S /GoTo /D (page.25) >>
+>>
+endobj
+6963 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [161.955 184.329 173.918 194.598]
+/A << /S /GoTo /D (page.24) >>
+>>
+endobj
+6964 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [123.499 172.374 135.462 182.642]
+/A << /S /GoTo /D (page.23) >>
+>>
+endobj
+6965 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [118.702 160.979 130.665 170.687]
+/A << /S /GoTo /D (page.23) >>
+>>
+endobj
+6966 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [112.22 149.024 124.183 158.938]
+/A << /S /GoTo /D (page.25) >>
+>>
+endobj
+6967 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.239 137.069 118.202 146.777]
+/A << /S /GoTo /D (page.25) >>
+>>
+endobj
+6968 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [100.259 125.114 112.222 134.822]
+/A << /S /GoTo /D (page.27) >>
+>>
+endobj
+6969 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [123.185 113.159 135.148 122.867]
+/A << /S /GoTo /D (page.26) >>
+>>
+endobj
+6970 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.18 89.248 138.143 98.956]
+/A << /S /GoTo /D (page.36) >>
+>>
+endobj
+6971 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 758.738 369.896 768.446]
+/A << /S /GoTo /D (page.36) >>
+>>
+endobj
+6972 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 734.827 369.896 744.535]
+/A << /S /GoTo /D (page.37) >>
+>>
+endobj
+6973 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.94 722.872 374.888 732.58]
+/A << /S /GoTo /D (page.131) >>
+>>
+endobj
+6974 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [377.88 722.872 394.829 732.58]
+/A << /S /GoTo /D (page.135) >>
+>>
+endobj
+6975 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [356.938 710.249 373.886 720.625]
+/A << /S /GoTo /D (page.135) >>
+>>
+endobj
+6976 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [361.421 698.294 378.369 708.67]
+/A << /S /GoTo /D (page.133) >>
+>>
+endobj
+6977 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [358.937 686.339 375.885 696.715]
+/A << /S /GoTo /D (page.134) >>
+>>
+endobj
+6978 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [358.937 674.384 375.885 684.76]
+/A << /S /GoTo /D (page.134) >>
+>>
+endobj
+6979 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [379.004 662.428 395.952 672.804]
+/A << /S /GoTo /D (page.132) >>
+>>
+endobj
+6980 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [362.918 650.473 379.866 661.055]
+/A << /S /GoTo /D (page.135) >>
+>>
+endobj
+6981 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [360.928 639.186 377.876 648.894]
+/A << /S /GoTo /D (page.133) >>
+>>
+endobj
+6982 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [369.894 627.231 386.842 637.145]
+/A << /S /GoTo /D (page.133) >>
+>>
+endobj
+6983 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [377.677 615.276 394.625 624.984]
+/A << /S /GoTo /D (page.132) >>
+>>
+endobj
+6984 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 591.365 369.896 601.073]
+/A << /S /GoTo /D (page.56) >>
+>>
+endobj
+6985 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [352.954 579.41 369.903 589.118]
+/A << /S /GoTo /D (page.137) >>
+>>
+endobj
+6986 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [372.895 579.41 389.843 589.118]
+/A << /S /GoTo /D (page.139) >>
+>>
+endobj
+6987 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [395.672 567.455 412.62 577.369]
+/A << /S /GoTo /D (page.138) >>
+>>
+endobj
+6988 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [392.175 555.5 409.123 565.414]
+/A << /S /GoTo /D (page.138) >>
+>>
+endobj
+6989 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [372.512 542.984 389.46 553.253]
+/A << /S /GoTo /D (page.137) >>
+>>
+endobj
+6990 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [389.96 530.922 406.908 541.297]
+/A << /S /GoTo /D (page.138) >>
+>>
+endobj
+6991 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 507.679 369.896 517.387]
+/A << /S /GoTo /D (page.47) >>
+>>
+endobj
+6992 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [340.984 495.724 357.933 505.638]
+/A << /S /GoTo /D (page.139) >>
+>>
+endobj
+6993 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [360.925 495.724 377.873 505.638]
+/A << /S /GoTo /D (page.140) >>
+>>
+endobj
+6994 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [347.476 483.769 364.424 493.477]
+/A << /S /GoTo /D (page.140) >>
+>>
+endobj
+6995 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [367.417 483.769 384.365 493.477]
+/A << /S /GoTo /D (page.152) >>
+>>
+endobj
+6996 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [401.294 471.146 418.242 481.522]
+/A << /S /GoTo /D (page.143) >>
+>>
+endobj
+6997 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [401.294 459.191 418.242 469.566]
+/A << /S /GoTo /D (page.143) >>
+>>
+endobj
+6998 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [381.353 447.903 398.301 457.818]
+/A << /S /GoTo /D (page.143) >>
+>>
+endobj
+6999 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [385.334 435.948 402.282 445.862]
+/A << /S /GoTo /D (page.142) >>
+>>
+endobj
+7000 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [385.334 423.993 402.282 433.907]
+/A << /S /GoTo /D (page.143) >>
+>>
+endobj
+7001 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [385.334 412.038 402.282 421.952]
+/A << /S /GoTo /D (page.143) >>
+>>
+endobj
+7002 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [364.909 400.083 381.857 409.791]
+/A << /S /GoTo /D (page.151) >>
+>>
+endobj
+7003 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [364.909 388.128 381.857 398.042]
+/A << /S /GoTo /D (page.152) >>
+>>
+endobj
+7004 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [365.402 376.172 382.35 386.087]
+/A << /S /GoTo /D (page.150) >>
+>>
+endobj
+7005 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [371.382 364.217 388.33 374.131]
+/A << /S /GoTo /D (page.141) >>
+>>
+endobj
+7006 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [371.382 352.262 388.33 362.176]
+/A << /S /GoTo /D (page.142) >>
+>>
+endobj
+7007 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [364.909 340.307 381.857 350.015]
+/A << /S /GoTo /D (page.151) >>
+>>
+endobj
+7008 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [399.294 328.352 416.242 338.06]
+/A << /S /GoTo /D (page.145) >>
+>>
+endobj
+7009 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [415.738 315.729 432.686 326.104]
+/A << /S /GoTo /D (page.145) >>
+>>
+endobj
+7010 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [429.385 303.881 446.333 314.149]
+/A << /S /GoTo /D (page.145) >>
+>>
+endobj
+7011 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [425.807 291.926 442.756 302.194]
+/A << /S /GoTo /D (page.147) >>
+>>
+endobj
+7012 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [408.771 280.531 425.719 290.445]
+/A << /S /GoTo /D (page.150) >>
+>>
+endobj
+7013 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [431.554 268.015 448.502 278.49]
+/A << /S /GoTo /D (page.148) >>
+>>
+endobj
+7014 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [418.24 256.06 435.188 266.535]
+/A << /S /GoTo /D (page.149) >>
+>>
+endobj
+7015 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [410 244.665 426.948 254.58]
+/A << /S /GoTo /D (page.150) >>
+>>
+endobj
+7016 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [414.483 232.71 431.431 242.625]
+/A << /S /GoTo /D (page.149) >>
+>>
+endobj
+7017 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [395.806 220.755 412.754 230.669]
+/A << /S /GoTo /D (page.147) >>
+>>
+endobj
+7018 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [413.712 208.24 430.66 218.714]
+/A << /S /GoTo /D (page.146) >>
+>>
+endobj
+7019 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [412.124 196.845 429.073 206.759]
+/A << /S /GoTo /D (page.149) >>
+>>
+endobj
+7020 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [400.298 184.329 417.246 194.804]
+/A << /S /GoTo /D (page.147) >>
+>>
+endobj
+7021 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [399.07 172.374 416.018 182.849]
+/A << /S /GoTo /D (page.147) >>
+>>
+endobj
+7022 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [411.721 160.311 428.67 170.687]
+/A << /S /GoTo /D (page.146) >>
+>>
+endobj
+7023 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [373.884 149.024 390.832 158.732]
+/A << /S /GoTo /D (page.142) >>
+>>
+endobj
+7024 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [373.884 137.069 390.832 146.777]
+/A << /S /GoTo /D (page.142) >>
+>>
+endobj
+7025 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [373.884 125.114 390.832 134.822]
+/A << /S /GoTo /D (page.142) >>
+>>
+endobj
+7026 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [364.909 113.159 381.857 122.867]
+/A << /S /GoTo /D (page.142) >>
+>>
+endobj
+7027 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [364.909 101.203 381.857 110.911]
+/A << /S /GoTo /D (page.151) >>
+>>
+endobj
+7028 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [363.913 89.248 380.862 98.956]
+/A << /S /GoTo /D (page.151) >>
+>>
+endobj
+7029 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [366.397 77.293 383.345 87.001]
+/A << /S /GoTo /D (page.151) >>
+>>
+endobj
+7034 0 obj
+<<
+/D [7032 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+7031 0 obj
+<<
+/Font << /F50 2307 0 R /F43 2258 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+7099 0 obj
+<<
+/Length 1014      
+/Filter /FlateDecode
+>>
+stream
+xÚÅYQw¢8}÷WäQÎYÙ$��ëŒE+¸c·;‡C‘±ìXd$ÎŽÿ~ØÖq´Ä‚ú‚ˆ÷ÞÜïË—/Á@Ðm\¹�??tÙ T
îW AY§h–)îÜ7¥Ò÷#P1•‘ªðæ·{vÇšd–ÛøÞ@ü>è@×e« xjÜ�`ÊŸ}PVü—�|*Qd’ãÍ�Ó¸mÀmQüþ«(ÊšÁ¡)’ᳪ	�†7°ÿÈÔËÙFèÛ÷-¬éMDÐf@�Í/-„dƒ�-”ámŠŠËQFNû½0t&
ç_½4šÅá´N/WåÔâÐøh”2d“_±Ü¾ãåx7í‰÷¡gõ;ybíÊæ)òù±„WÑh9Ö£Ÿ>þÎE_e¥ašF‹¸„Sº¥„`Ó�Ó`)µiF	»ÞKÿ*Ïû&aØ³Ë:õ”ÎÜPEI6ï<«=êKH;v$þÑ–§rók»r„LY'áÁ$ß²Çe)¦‹LønØ3ÛýÊS:d.æXH/°Æ¶5Z¦ku¼ËqÚ’›]«*5Q¦¹Š£,£Ë²ugqìCzp~g§B¤ÌgÇB´ö¥ÁØþd2?ÛžY9-‰ÈÛ#ËtíÞß<ŠÖÄ­LŠ„¢—Õw\¢dš0U+ÏL²Ó‡ƒQD·pÔ²�ÞÀ>K0WÉ”g¢É«.§_'la.bfZ~²·¼~Oõ%"n8–gbB�ñfíÿÉwÄRBÞx	2Ú=ÇÅ„ÖA‰� TtõM�O0K‚Ñ)�Ý®õ?$Lšþü Ý"`~i¿öv]†¬À0g£4š¶&
+²T/’¾ŒC�Âý—5º8=÷®ò¾Kbñy”)ØÝZ·]$À<)]Ì"TBËj¢ît÷/Ã1A2Õt@u"óSÒQÌŠ@0ó½m×°²„6Ãœîʬƒ‹Ò™V±CUN*ê§Y‹ŸPt‚–Y‡¡*çëœ|¿Ù¶Ó:oznzˆâ\0/y�Á�Q¬ŽI“Ê*²¿êØ{ß­$Ùt‹½‡…Û
ÕE-JV™ˆyÔ-I•ô„8žzþœy±ÿÖ'ñ2°ác±5�Ò"yN™Z<Ð�Õ‘G'‰6
º—uëuè0Þ¥ƒ…qö�ÏE²- ½„Qš®x.\`!ˆ.ÉãË=RIÊüçz©LLWÿ†
;yèïÔ/焈�· ÎÂSÖeá$¸>ÇyÛ÷ë½'äÓÊB‚ðy	ïÎjè§ñY›Àþy{Îû—‘ûÞ±"CóŠíù}•±FÕìÕšJT™•Ê”nÜí†q¸äq*墊řï,ò­k=ã
_¶ñ®Æÿ
õHy¿
+endstream
+endobj
+7098 0 obj
+<<
+/Type /Page
+/Contents 7099 0 R
+/Resources 7097 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 7035 0 R
+/Annots [ 7030 0 R 7036 0 R 7037 0 R 7038 0 R 7039 0 R 7040 0 R 7041 0 R 7042 0 R 7043 0 R 7044 0 R 7045 0 R 7046 0 R 7047 0 R 7048 0 R 7049 0 R 7050 0 R 7051 0 R 7052 0 R 7053 0 R 7054 0 R 7055 0 R 7056 0 R 7057 0 R 7058 0 R 7059 0 R 7060 0 R 7061 0 R 7062 0 R 7063 0 R 7064 0 R 7065 0 R 7066 0 R 7067 0 R 7068 0 R 7069 0 R 7070 0 R 7071 0 R 7072 0 R 7073 0 R 7074 0 R 7075 0 R 7076 0 R 7077 0 R 7078 0 R 7079 0 R 7080 0 R 7081 0 R 7082 0 R 7083 0 R 7084 0 R 7085 0 R 7086 0 R 7087 0 R 7088 0 R 7089 0 R 7090 0 R 7091 0 R 7092 0 R 7093 0 R 7094 0 R 7095 0 R ]
+>>
+endobj
+7030 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.151 758.738 151.099 768.652]
+/A << /S /GoTo /D (page.151) >>
+>>
+endobj
+7036 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.658 746.783 150.606 756.697]
+/A << /S /GoTo /D (page.142) >>
+>>
+endobj
+7037 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.136 734.827 156.084 744.742]
+/A << /S /GoTo /D (page.142) >>
+>>
+endobj
+7038 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [166.053 722.204 183.001 732.786]
+/A << /S /GoTo /D (page.148) >>
+>>
+endobj
+7039 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.156 710.917 150.104 720.831]
+/A << /S /GoTo /D (page.151) >>
+>>
+endobj
+7040 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.649 698.962 150.597 708.67]
+/A << /S /GoTo /D (page.151) >>
+>>
+endobj
+7041 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.18 675.052 138.143 684.76]
+/A << /S /GoTo /D (page.37) >>
+>>
+endobj
+7042 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.605 651.141 158.568 661.055]
+/A << /S /GoTo /D (page.26) >>
+>>
+endobj
+7043 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [155.213 626.671 167.176 636.939]
+/A << /S /GoTo /D (page.94) >>
+>>
+endobj
+7044 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.18 603.321 138.143 613.029]
+/A << /S /GoTo /D (page.36) >>
+>>
+endobj
+7045 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [121.195 578.85 133.158 589.118]
+/A << /S /GoTo /D (page.18) >>
+>>
+endobj
+7046 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.18 555.5 138.143 565.208]
+/A << /S /GoTo /D (page.34) >>
+>>
+endobj
+7047 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.18 521.627 138.143 531.335]
+/A << /S /GoTo /D (page.53) >>
+>>
+endobj
+7048 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.255 509.672 118.218 519.38]
+/A << /S /GoTo /D (page.27) >>
+>>
+endobj
+7049 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [116.712 497.156 128.675 507.425]
+/A << /S /GoTo /D (page.27) >>
+>>
+endobj
+7050 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [114.219 485.761 126.182 495.469]
+/A << /S /GoTo /D (page.27) >>
+>>
+endobj
+7051 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.18 461.851 138.143 471.559]
+/A << /S /GoTo /D (page.54) >>
+>>
+endobj
+7052 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.18 437.941 138.143 447.649]
+/A << /S /GoTo /D (page.51) >>
+>>
+endobj
+7053 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.18 414.03 138.143 423.738]
+/A << /S /GoTo /D (page.57) >>
+>>
+endobj
+7054 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.18 390.12 138.143 399.828]
+/A << /S /GoTo /D (page.58) >>
+>>
+endobj
+7055 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.18 366.21 138.143 375.918]
+/A << /S /GoTo /D (page.54) >>
+>>
+endobj
+7056 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [155.213 341.739 167.176 352.007]
+/A << /S /GoTo /D (page.95) >>
+>>
+endobj
+7057 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.648 318.389 152.596 328.097]
+/A << /S /GoTo /D (page.143) >>
+>>
+endobj
+7058 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.648 294.479 152.596 304.187]
+/A << /S /GoTo /D (page.142) >>
+>>
+endobj
+7059 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.648 270.568 152.596 280.276]
+/A << /S /GoTo /D (page.143) >>
+>>
+endobj
+7060 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.648 246.658 152.596 256.366]
+/A << /S /GoTo /D (page.143) >>
+>>
+endobj
+7061 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [116.712 212.785 128.675 222.493]
+/A << /S /GoTo /D (page.17) >>
+>>
+endobj
+7062 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [105.244 200.83 117.207 210.538]
+/A << /S /GoTo /D (page.19) >>
+>>
+endobj
+7063 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [115.349 176.92 127.312 186.628]
+/A << /S /GoTo /D (page.20) >>
+>>
+endobj
+7064 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.18 153.009 138.143 162.717]
+/A << /S /GoTo /D (page.35) >>
+>>
+endobj
+7065 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.18 119.136 138.143 128.844]
+/A << /S /GoTo /D (page.51) >>
+>>
+endobj
+7066 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.18 85.263 138.143 94.971]
+/A << /S /GoTo /D (page.42) >>
+>>
+endobj
+7067 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 758.738 369.896 768.446]
+/A << /S /GoTo /D (page.43) >>
+>>
+endobj
+7068 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [367.401 734.827 384.349 744.535]
+/A << /S /GoTo /D (page.151) >>
+>>
+endobj
+7069 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [367.401 710.917 384.349 720.625]
+/A << /S /GoTo /D (page.152) >>
+>>
+endobj
+7070 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.933 687.007 369.896 696.715]
+/A << /S /GoTo /D (page.56) >>
+>>
+endobj
+7071 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [367.401 663.096 384.349 672.804]
+/A << /S /GoTo /D (page.150) >>
+>>
+endobj
+7072 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [367.401 639.186 384.349 648.894]
+/A << /S /GoTo /D (page.141) >>
+>>
+endobj
+7073 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [367.401 615.276 384.349 624.984]
+/A << /S /GoTo /D (page.142) >>
+>>
+endobj
+7074 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [367.401 591.365 384.349 601.073]
+/A << /S /GoTo /D (page.151) >>
+>>
+endobj
+7075 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [367.401 567.455 384.349 577.163]
+/A << /S /GoTo /D (page.145) >>
+>>
+endobj
+7076 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [367.401 543.545 384.349 553.253]
+/A << /S /GoTo /D (page.145) >>
+>>
+endobj
+7077 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [367.401 519.634 384.349 529.342]
+/A << /S /GoTo /D (page.145) >>
+>>
+endobj
+7078 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [367.401 495.724 384.349 505.432]
+/A << /S /GoTo /D (page.147) >>
+>>
+endobj
+7079 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [367.401 471.814 384.349 481.522]
+/A << /S /GoTo /D (page.150) >>
+>>
+endobj
+7080 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [367.401 447.903 384.349 457.611]
+/A << /S /GoTo /D (page.148) >>
+>>
+endobj
+7081 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [367.401 423.993 384.349 433.701]
+/A << /S /GoTo /D (page.149) >>
+>>
+endobj
+7082 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [367.401 400.083 384.349 409.791]
+/A << /S /GoTo /D (page.150) >>
+>>
+endobj
+7083 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [367.401 376.172 384.349 385.88]
+/A << /S /GoTo /D (page.149) >>
+>>
+endobj
+7084 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [367.401 352.262 384.349 361.97]
+/A << /S /GoTo /D (page.147) >>
+>>
+endobj
+7085 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [367.401 328.352 384.349 338.06]
+/A << /S /GoTo /D (page.146) >>
+>>
+endobj
+7086 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [367.401 304.441 384.349 314.149]
+/A << /S /GoTo /D (page.149) >>
+>>
+endobj
+7087 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [367.401 280.531 384.349 290.239]
+/A << /S /GoTo /D (page.147) >>
+>>
+endobj
+7088 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [367.401 256.621 384.349 266.329]
+/A << /S /GoTo /D (page.147) >>
+>>
+endobj
+7089 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [367.401 232.71 384.349 242.418]
+/A << /S /GoTo /D (page.146) >>
+>>
+endobj
+7090 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [367.401 208.8 384.349 218.508]
+/A << /S /GoTo /D (page.142) >>
+>>
+endobj
+7091 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [367.401 184.89 384.349 194.598]
+/A << /S /GoTo /D (page.142) >>
+>>
+endobj
+7092 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [367.401 160.979 384.349 170.687]
+/A << /S /GoTo /D (page.142) >>
+>>
+endobj
+7093 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [367.401 137.069 384.349 146.777]
+/A << /S /GoTo /D (page.142) >>
+>>
+endobj
+7094 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [367.401 113.159 384.349 122.867]
+/A << /S /GoTo /D (page.151) >>
+>>
+endobj
+7095 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [367.401 89.248 384.349 98.956]
+/A << /S /GoTo /D (page.151) >>
+>>
+endobj
+7100 0 obj
+<<
+/D [7098 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+7097 0 obj
+<<
+/Font << /F50 2307 0 R /F43 2258 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+7109 0 obj
+<<
+/Length 312       
+/Filter /FlateDecode
+>>
+stream
+xÚ½SMkÂ@½ï¯˜cu:û™Ýc‹VêÁV“‚ ÚÓB´T…ê¿ï6‰6´§ffß{3Ã#È� Ë®vy£	,:c$$3ˆ­19�†C2…qpÛowFá$é�’µµþkYà&úJ³NÂÞ÷Y¾°­Pð<gã	ÁÔ×z@(�…�²sJKÔJú¸€˜
5Eùü·(G9m8ÒNÕºX¥M_.Jû2¯e»Æ-Ù€k^7TðÐâ�Ðþåè´®àF*½ë—cªŸŠÎ4èî' SâØé†ñÕ¿ò­²b–®^óE6=¯=v­ñù¯Øóát¿½‡œ¦5’ä1ÚÎõEdTÃõJ£1õ*»Ù"[>®ýíJ…O¡ `[Åí·PR°Ùæa‹S�-~H÷?
	ëøz
+endstream
+endobj
+7108 0 obj
+<<
+/Type /Page
+/Contents 7109 0 R
+/Resources 7107 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 7035 0 R
+/Annots [ 7096 0 R 7101 0 R 7102 0 R 7103 0 R 7104 0 R 7105 0 R 7106 0 R ]
+>>
+endobj
+7096 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.648 758.738 152.596 768.446]
+/A << /S /GoTo /D (page.151) >>
+>>
+endobj
+7101 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.648 734.827 152.596 744.535]
+/A << /S /GoTo /D (page.151) >>
+>>
+endobj
+7102 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.648 710.917 152.596 720.625]
+/A << /S /GoTo /D (page.142) >>
+>>
+endobj
+7103 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.648 687.007 152.596 696.715]
+/A << /S /GoTo /D (page.142) >>
+>>
+endobj
+7104 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.648 663.096 152.596 672.804]
+/A << /S /GoTo /D (page.148) >>
+>>
+endobj
+7105 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.648 639.186 152.596 648.894]
+/A << /S /GoTo /D (page.151) >>
+>>
+endobj
+7106 0 obj
+<<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.648 615.276 152.596 624.984]
+/A << /S /GoTo /D (page.151) >>
+>>
+endobj
+7110 0 obj
+<<
+/D [7108 0 R /XYZ 69.866 801.979 null]
+>>
+endobj
+7107 0 obj
+<<
+/Font << /F50 2307 0 R /F43 2258 0 R >>
+/ProcSet [ /PDF /Text ]
+>>
+endobj
+7112 0 obj
+[600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600]
+endobj
+7113 0 obj
+[531.3]
+endobj
+7114 0 obj
+[500 777.8 500 777.8 777.8 777.8 777.8 777.8 777.8 777.8 1000 500 500 777.8 777.8 777.8 777.8 777.8 777.8 777.8 777.8 777.8 777.8 777.8 777.8 1000 1000 777.8 777.8 1000 1000 500 500 1000 1000 1000 777.8 1000 1000 611.1 611.1 1000 1000 1000 777.8 275 1000 666.7 666.7 888.9 888.9 0 0 555.6 555.6 666.7 500 722.2 722.2 777.8 777.8 611.1 798.5 656.8 526.5 771.4 527.8 718.7 594.9 844.5 544.5 677.8 762 689.7 1200.9 820.5 796.1 695.6 816.7 847.5 605.6 544.6 625.8 612.8 987.8 713.3 668.3 724.7 666.7 666.7 666.7 666.7 666.7 611.1 611.1 444.4 444.4 444.4 444.4 500 500 388.9 388.9 277.8]
+endobj
+7115 0 obj
+[777.8 500 777.8]
+endobj
+7116 0 obj
+[339.3]
+endobj
+7117 0 obj
+[1138.9 1138.9 585.3 585.3 1138.9 1138.9 1138.9 892.9 1138.9 1138.9 708.3 708.3 1138.9 1138.9 1138.9 892.9 329.4 1138.9 769.8 769.8 1015.9 1015.9 0 0 646.8 646.8 769.8 585.3 831.4 831.4 892.9 892.9 708.3 917.6 753.4 620.2 889.5 616.1 818.4 688.5 978.7 646.5 782.2 871.7 791.7 1342.7 935.6 905.8 809.2 935.9 981 702.2 647.8 717.8 719.9 1135.1 818.9 764.4 823.1 769.8 769.8 769.8 769.8 769.8 708.3 708.3 523.8 523.8 523.8 523.8 585.3 585.3 462.3 462.3 339.3 585.3 585.3 708.3 585.3]
+endobj
+7118 0 obj
+[600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600]
+endobj
+7119 0 obj
+[500 500 167 333 556 222 333 333 0 333 584 0 611 500 333 278 0 0 0 0 0 0 0 0 0 0 0 0 333 191 278 278 355 556 556 889 667 222 333 333 389 584 278 333 278 278 556 556 556 556 556 556 556 556 556 556 278 278 584 584 584 556 1015 667 667 722 722 667 611 778 722 278 500 667 556 833 722 778 667 778 722 667 611 722 667 944 667 667 611 278 278 278 469 556 222 556 556 500 556 556 278 556 556 222 222 500 222 833 556 556 556 556 333 500 278 556 500 722 500 500 500]
+endobj
+7120 0 obj
+[501 501 137 273 501 228 273 273 0 273 479 0 501 410 273 228 0 0 0 0 0 0 0 0 0 0 0 0 273 195 228 273 389 456 456 729 592 228 273 273 319 479 228 273 228 228 456 456 456 456 456 456 456 456 456 456 273 273 479 479 479 501 800 592 592 592 592 547 501 638 592 228 456 592 501 683 592 638 547 638 592 547 501 592 547 774 547 547 501 273 228 273 479 456 228 456 501 456 501 456 273 501 501 228 228 456 228 729 501 501 501 501 319 456 273 501 456 638 456]
+endobj
+7121 0 obj
+[611 611 167 333 611 278 333 333 0 333 584 0 611 500 333 278 0 0 0 0 0 0 0 0 0 0 0 0 333 238 278 333 474 556 556 889 722 278 333 333 389 584 278 333 278 278 556 556 556 556 556 556 556 556 556 556 333 333 584 584 584 611 975 722 722 722 722 667 611 778 722 278 556 722 611 833 722 778 667 778 722 667 611 722 667 944 667 667 611 333 278 333 584 556 278 556 611 556 611 556 333 611 611 278 278 556 278 889 611 611 611 611 389 556 333 611 556 778 556 556]
+endobj
+7122 0 obj
+[500 500 167 333 556 222 333 333 0 333 584 0 611 500 333 278 0 0 0 0 0 0 0 0 0 0 0 0 333 191 278 278 355 556 556 889 667 222 333 333 389 584 278 333 278 278 556 556 556 556 556 556 556 556 556 556 278 278 584 584 584 556 1015 667 667 722 722 667 611 778 722 278 500 667 556 833 722 778 667 778 722 667 611 722 667 944 667 667 611 278 278 278 469 556 222 556 556 500 556 556 278 556 556 222 222 500 222 833 556 556 556 556 333 500 278 556 500 722 500 500 500 334 260 334 584 0 0 0 222 556 333 1000 556 556 333 1000 667 333 1000 0 0 0 0 0 0 333 333 350]
+endobj
+7123 0 obj
+<<
+/Length1 1416
+/Length2 6052
+/Length3 0
+/Length 7019      
+/Filter /FlateDecode
+>>
+stream
+xÚ�wT“ÛÒ6Ò„ RE:Q�CHè½÷*¥† ”$$‘Š ½IïU©*½ƒH‘* H¥ƒ)*J/_PϽ÷Üÿ_ëûVÖJÞ™yföÌÞϳ×Λw�øí‘v05$ËI
•uu5Á  $,	
89�áXWØß~§)��#Rÿ�PFà X¼O‚Åu‘ ÖW X“‹K�@@!Hòo -T�xÀí�º@-$†
p*#QÞh¸£¿Îß�@n(,))~çW:PÑ
††C! .ësï…¸��P8ëý�Ü2NX,JJPÐÓÓSâ†@¢åxî=áX' !C{Àì�#õ n°?£	8�ÆNpÌï€Ò
ë	AÀx‡+
+C`ð)ö04¿:ÐHS¨�‚!~ƒu~îÿl,þW¹?Ù…àˆ_É(醂 ¼áG ÜÔWÓÀzaï!û ăÄçC< pWˆð«uPMÑÁOøg>
Ga1¸ëÅŒ‚eðÛ¬Š°WFº¹ÁXà¢?8Åï»·àŸÃuA =>[p„½ÃÅöP‚&¸û˜¦ÊÞø·Ï†Š‚$Ä…%D�0w Ìê$x±€±7
+ö+¾pãgðóA!Q@ü0?¸ÿðÁ@<`@,ú
ÌÏç?ÿ´`0ÐÅí`ŽpàßÕñn˜Ãoþh¸Ð„§ºøüëÉ
+Ï0{$ÂÕûßð_G,htOí®’)ߟ‘ÿTRBz
}ø……€üB¢  $"
Ç?øý³Î]üOÿ‘«‰p@/Š]ô‹ß¨¿{öøCî?
+á
þ³˜O]�ûßL·‰‚ ø/ðÿ™ï¿Rþ4¿¨ò¿2ý¿;R{àêú+ÎýðÿÄ!npWï?<u`ñ2ÐEâÅ€øo¨ì·vuaöðnÿÕÄBðrPD8â)͉üöÃ1jp/˜ý]8êô›6¿ý&‚s…#`w‘øŃÏ�þ+†WÔ�`ðÜü‚`ð’Ãþ:ȆÕ?ûPE@‘öêBÐhˆ7øxKèÆËÔæõ‹Ý@A
‹O
âgö: Ñ€‹ƒ
+:^ÜeømÀ~û@@A׋&.ÿX
ú�Æ·ó‹&øVþ¶	ó‚A
“H¨t°supËa¥"³'ÿÊ�ÉVÚ¡¹ÿP�5¶[uÔf1Á(;kJû¹ÚdXÍÚ¹MOÉý0gîÃŽÏr
{­·È>?»Úš#»]ÜÄùþ¥ñDŸ–[”�OÌR”ؤŠÑÝwY£¨ÚÉåí»�8)}ÿªîü˜èÉEW¢&®Ò¢×Ú^Y’¥CÏ"iúå“!¶É®ÏxEt—á¯ÜOn±AKÑ–©z·´eZ�	žT½ý}3Ô]¬Q�Z�V¾s„b©U¥ûXTD.W˜Î<½ö3·Øc3ƒÆÇN�VaÓ¾ûÅ<OÊaµÞ¶Óòö¦ÕMî¤vq'Û$‡hðÜ+5j†N)
�—¿i?�ÆNÔÐ+—x€1íL‡k¼ž+ûÄꢢí=5Þ9²ðó�vª¦ÅpO0÷ÝÙ³Òå/~uœ¯b<B	›ÿªL¡^Vå£ÏâÙðszÚÃáš=³Ï2n&d!‘æÔb,W4#Ü`N-,|ÕžVnrM°îsïåÂ{û>8‘³§;­­J\SîQˆšhÜBÍŒoFÁ“ã-°à›ZhzU´2ÎÓmqß·ÂkÑJ§×
YèW†kqýºð�úq4R
+Èžól£-28†A 9âVÙôRWø[)aœ=A‰^Þ‹ãÝ@ú·=Èa€GI`ôñ&ît“0¨@ÕâHžß½.m:Úæ(Öû´›‚PnòÎù¹æTý-7EÐà©¡pýD/]ŸO+ßSúæeIêÅøƒ•aݤe}J'?~ÚiîÇWÑô­'ÄF·(.ì6åFñŒU1�½ÒR"H& ùìsÖæ®°#3ÓN–ì5v‹Vös»s¤ÍõïJ,¦óÇ=�.×o›ÝbÿÊH¸\Ÿ�ùz
²½Ž¼¯†Ñ�ç	N*àܲÚnòŒÖ{Y6¦!·§â·÷�l:;¾û^òµ–¯µU`çûåAŽ%×HÛÀv­MYZÏ!¾¶­N1Åvy:<ïmA-¸@ÎIß«Í	Ľ
´iNŒF
!O¹HúÑ ÎøG7&¬��“	@7³«Ît}g
a¸³ÐÆjS¨¨á%Äù¦Ä'›Á$y÷¦g*…=žÇÇƺäݱŽ¶KÈøŽh"ƒP„ˆØ(‘.mÐ’ÐÌœôƒ·øF¦¨Ç.Q~1««êG!³TN²^DµzÉõ;|Ш9¶`·2VÝïpÎ0ì‹ôä;¡X^¦ßf¤QͺJ,ãÌgPÕ»¹™Ù7MfíëoÖHÛ‹<Í7.¤œ•º³tìAwªË;3!͇¾~Ù<º‚wÕx£À`lÞ³[âÞc'¶ŽÑ<nÒ¦â
+‘‡½{/¾áÐT/óÝYûçã1—F×ý9N›]7+ªtÉ%þ® ¼•.��‡L3GiÆÃwÁ>ïi™èy�ßç¨MùØ¿lq 
ýô5¯Ì'Bgt“+¼½Ðož-¹Ô_´p|ð­n^N>�vj¹Ö8ïcò›¡gÆØ¢ Œ-Ö´Ü&�h^ceé` ÷>ùÚxÍ/8/»:eþ4¨ù–xÀ¶;6xÁáد�fu$‰§2T‚ØÈpÌ<Ùû�L¦VÈ9Yߺe1¨™Š³ýJ¬IvsÈ‚�ÜxŒ`^iÅ3e7äü
+hˆ³Ôï	jú†ýg'z¹HšÈËÖž*Eß`»ö׺ˆ6 pû{#Ö
+muòd¨+pai–ê@¥î&EVØÉ	[ïîÞ¢‘[eÚÐõU`Wî盟ÆÈÙ^ÚÆ7ÇÞ
“·Q´¤é&C,�¢€ê€lQ¡ûÂRÙ
Ì}2÷ÔG|À‡çPSMÆJ"1n´î­Ãlˆ}@@Ðìs½ÍP!+(²¸/²s.»Åú�þÒÃ{ºÂÉš·CC{²Ê×r÷ã½OÚ:&ÝÍ|á;¼u]‘¢~Ï%‹nTæÞƒ´ÔR_ƒÝ[Ïð‹#{&ä§úfcZI?ô2úòô `±X»ÿ@hÛE)!¼çÌõ›œgÂœù†Ì'�{1•=Ä^4¯hý–Õø92oeÚÑÝä®Ã¹¨Úa¥kz¯­;4ve»P,ë1î‹”�‘Š¥ïÎ×Ìœ;+òfÚ:Ž†<¯ª&ç.ú,=XipÕ„=Xe·öVAú°S™@¶Î¥fÁxú3ä(î¨H~ˆ!Mù5­¥Ùf·<ä2õ¨ƒ>™ÙÜ;Â¥’Ü’G ÙƒøÁ„r®
+ѽ+oFKŽêÞ$¬âŸ×¹gzÿ¹Ýó‹AЃAgz9Õq—ê€ê›æÝí:q­õ‡OzãMR+÷3—€ºa®ÇÆ,}ˆÑ3ïÌ.˜IOÏùOLˆ"ñLV$2D˜}È׊Xa•¾¼ÊŒk
+œÕ+çJfJRoV¨”$”îѼ´1¬†Kâ(j
0ù(¨MHäúÁAÌË}!�•ÜPíéWõHCC°†—óxÚ.Ù%±âç½*o¤×»zçòo©^ùÕF¯Òˆ,½ëx7ä›sL×iÕ3²‘ò±÷1»@Bò,èq3ƒiU
4©4yg-e	uiè…Çx8[~<+§Jt^^¯ÏMÒfÉÿf4#[ΦV'@ƒ‡m°WÇj ºŸÿИÁNÇOPnHÔ…æÃ�¬�çSý3qzÑŸá·™¥’?ÜyjbC¯sW>¾®·ÿ†žrùª‘îþ{øÖû«SrÉר{†ÂW®¬üæýà|Û¬3[eCb-Šc{Ìw;çfƒZä|ÿ`dãÓú”N¢´ÍC€½AŠ–&G}sJç½>î�ôn†îk´ùZ	þTD’wR^ˆÕ|ºa>Îó÷R¼Ü|Æbt‡D+DF±3¡8Þ=ïíÊýhIçRÓ0öe;Ñ–IÍ·/käíŒ/ÜFyéOâŒé$ã¦U›Íôù§R&:¢)+5ÖQ«× ¤l·È,q§¯©GÇØ‚U�MI|²Á;àÁ ãªdS�ÓQQo3m_\ÀèÎRêwß©zìåg%ûõSÙrܤðT»ñ„–˪EukÝÙ{aÛS�¼3drE×Ôìyæ¾ÀgÚ{üصô´õʲj!\öûñÁ…a#1,¸ÎµkÖö¥]Æj$An3�æ&ý«
Oöýô�q•ê5#ìÕB¨è—·Ê‹
+Q��Ý¢T½^:*oÛÓ"ëžvë±¾3$êD}ÍrèñZRáNy4ˆÈ«žšÈš†ÏÄ<y�¹Ú9ÙôéX=GVIĶ£jñŒŸ¨ô´áËÞµµ ’@Ü«”•Xt9	åÆÂ(G¡Òs
+BÁȸÏR�Jô{À‰¹\
êÌ9£Càb +Œm  a7Ù7£9‘»Š^$w¾˜{ý»Rõ)?µKË˦œž—ÂÅÝ“—ÚlånQ³
+s6Š­~h¿ß<ÖNCv‡ÃFî6®bATÓƒòø^þ=‚‚Ô|&QñTÂM7¹÷9‹Ø¾UOúÖrº?éHBI+j¾e?õz#£²zѵ€D½w¹•�»æ}¥�Ú—¿‰Qµ+ÎŒ÷ÚÚ.·:K	RÞ ¸_p~fRÄÉ{,Ælùq§^iu1q*^¦cån4ŠÈ¹, ½gݳÂ/™ƒ—h=Ïiø9|eRØ=ð³v¯9Û9Äï)Àò5VCyãòVÿ[º @eqø²ŸÜëZº’NT*󤂹ucøÔ÷µ€O*´2Ìõô8?œ»˜~ê¡2Yß··,�,“÷ÏP@®T�bÊZÕç	j1n<ó7æ
+„IJ±ó†+ðLW§—ËÍSåt©ÉõÏ6Cü/ý\üuF>-}}u@]¶Ëú…ÓÇ
—ŠÌ&8¹„ÝXü¡ÆúÆ¡—ú¹@|(å&ƒþAhÆý¨oÎKjtÆ3-ï®Þá€l1NWc’jó>Zº@]ÀÈ*¾Õ‡daƒ«óÄ
ªav[Qw”ËÝw:¹BOÍi75ó3{Æӈѯ,§ë_?zsþéĆ´õHXlFÛß@É/¯Èrx¯<t�´êÙD“É>*t|Ç…ôiÐPŸb;÷¤•î2ãjJr*ºý™8ëÀ²‘÷úÉU®³Ãï¼eYvK¬q¢ªÑ�Œ8Ž³GЯs 
£HTì+Åï„NÅhEÈ«p[­·‰g.Q-MƒêªNã\kò׃B€ù´å̶ÉÙK
+’Q7Ó�–
+:‰ãT+C,ÅJ\[Å_L¼&Ò¡üª#L+!‰È—ÆvŸfÛD—+Ú~¾Jj•{ñEÛË]¸³pá�
¶˜µ,s=î�ïˆÙÎpPþ ìªj¼BEs’À–�õº¦P*—›UC®¶6uwp¶f\ºâàcï‡'Á~nfYëü?êt‡p[Œ�_\Nôäi'¦Q�Î&Ó"H˜š³¤ÞL©Ÿ úúEªë·¨9'Ku[»Kû6‰‚Œî¹í>kaÚ
+÷ŒÚñ½­¥e’[/Î=Ú¢÷œÏ¨	bäÓr�gYÇVEJ0R­V½ÌÒBå!¯ªå]Ûj«¡t4ËgwvoÂÈò§7ø±àÇ™{ãídB“gN]NW|æI×G’�™Cy´Á±o{ˆ–¾J¨sRG †ZÞlö4èþ�K>Fœ¾æ€l2‹Þ|ž�ÓJŽü4¥r3¥ÞY…|춄ô•‡O¶kÏw0Ĭ¹Ö•²ŽÊߟÆ×ÎÊ­m~À]–Ž±±JlAûãÿ
j$VDbRt)?Ww|Ü”vô†YŠòHIV’cïò�ÞMŽLÞ±ø½ã>'4åÞÍ rvX©ôÚÀµ€Q³n�{ÿõ3�jÚâ9AÁœx¹¾0Æ^iúÜýJü`cÅ‹¤2ª	ÔgǽKžÞVó–Y3!w·ogò9µë�÷¥}ööŒ›DQ…¶ç¾Ž-Ö{º5Nµ@Úê²¹Ðe¿àÕ¡é¤*ÛT^h•`…'´û]mþ¦ùèäk¦Ð,cùí«…aÄégÝä•©€÷	ЧÞM&†�.Dqø7’ºþæoÛBƒ}[ÌïŽç™¾êæ^ÇÍ�l¸ùx¼zÜ©‡åÍü‘
¥"PI¯dJ °‘ƺŒÏñgfoˆ°rד¨•m¥3^9œýZÍt‰HQ?—»<óÆ¡Š“{æ5¤2­qKˆ‹$�I¡½å_a·´+|Sö�êŽÁzR*÷¦ŠŒt�seWÃñü¤æÊ‘†Žõiýü‰b­c¨zâ[=£ÞHh�ÐøÏæh�ÐÙ%ñ÷Ê�­••ò£Ö*édgÑq#¶)ÛtY®îeÜBV³méz0ælíµ$P
ëùâQ8åà…uLÚö5ºëÔ¶wý�ÎÙeµgÏåU�Vµ™33¹jøv"òÑ–B䢽&P­›Ÿî™<)u"©ã%´ÍCŸ(R”%šHôôv#ãxQ˜+,GWU÷]]Ší|;ƒÒ†ñшœ„!ïáÐ
+úàÉz?¶—kÚëµM�ƒn¿�`ZŒÎIF©JµzögçŒÐ«Bi(s;K;e5÷Ö#Šµzm¿¿I2ç1ôÚšKX�#êò"˜r*¹MÖ¬¢Á¸‘;	ê#„Öùw4Ñk^Y
+mÜ
+,”r'¦ïésòÖž­=S“–¹wžû.䧧ïö‹†yòqjÚ]cAtÛi{Å–b—ÝFKo~íɲk)§+n”
ñÇ|NT¹«¬'¢mY?»½*¯zû‡!bô ùÖÆ¢ËíÙÜÝ£¼c_-
+žó]
KbfR:¿;I£&ò*2<
)[V™§ß’_~O(ý4·®þ®—º#‘„ !ØcMSwÑ;Š C‚^DP—Õ·²¡ív®¬­S	!I<ö*í�„K?üé©ŒÝQrVnÓ%ÀR.C8›´ìÕLbõé‡qTâFhWh5G„ËÞò[…%²º¢´(ˆn@øë”t·û«a¾'i»vŸØÒ)®`uÂ$Fª@©ýá¾Ãc­úl<óîïV¨Ô’±ä)ú¹„ù²^Õ…ÍÝ$QSW?Ù¬vËž'R�ò¥VŒêK®„*ú
2<±¤Xô¶¦¼#ëeÝñ„äelûü1}²0g¥©%	ùùàÏ+*$/câY,ïz«$M¶]v3+²¹�`9Oñõä¡Ö´] ,ë„C ¾�Ì+~
­lcÔ-á>E®Uo…W_é?�=$%
!lOA
+îÇbG˜(¼(’wöøéyÅë·4†m
dvÀý€¦ ãK5Ó.ïESíÍ1Ç)�«‚ì]ÌPâ+îÞ†£2½l‹^²»üYáÄ?Õ‡éü*ï5}ÃAÓÇw+†ùyà„?ÜL'æ¹Ku2R–Ì£ž]:CÉ
+VQ¶q�ÕŒýT­~´?™/6âdáÒmôŽÉ¿§\�Dnw´ÔXÃG®èy];pð
+ÈRŸEž¯*¶Ìêj†“!9;Ôí·a²2O÷ÿ+Í£‚õDÞÀà¼ò.§`1éaEš/%T‡Š8x·Ö˜˜:÷ο�šš0ëœYç˜)T|¼°L�ï~û@®RtÕ|dÛ†l#/×` ±ø	ÿ‡aq·ÓFzÚ\“_K°_¯g¯î~Õè¤uÒPÔ‘Çò”Û9æÜn…—^ÖÍ|:š¢é¹6lUÖ¾ÅȘ6{”ö‚G“ž°ó²Çª1m§ò—tN×Q?Ä!Eƒú
+g^ÔØ—Q©>L<éçê¤{ô‘´§¸àð¡N“€<¨v–ÿýÒ”‘­ò‚Gâî0ãŒúb»B
+
+[Ý07Z‰56Ó·
eý." ïÅá•àõ™úÇãCóFƼÒ
G	mu:›o š›�È]\‘YÐ÷Á
¸T/©Yß6qªvMKÛÏ	cbÏÏÏ0îaÆ¥­N�ÄÐSÛ:‰\Rf÷"»ZÒã�KŽÏêtìå¢#µ/g^U8~oùÍHOJâI>ý_ŽÄëEód&òs<Ëã†vœ#'SÈ膀´5¹H±«K]½þ<iäú	€ÏzÍ=Eß
+ÞXôuI/á†1r2Ìi½hU§h\HdëÝëÈa
éî!o;¡FŒ×9»¶W.ñæqËò“�–|é
wjYÛjöÕ}Ðakp7ÿ`â�í�g©½õëÜ?/ˆ$Š2$×XÍ?¢Ó�¯@†³’‰ªóÚÊ¿5TÓ-¹ºÐpö~ÐqéñªÝajžAtFÐ*Ú¦´/-hŠÿªÝµIc¡ðnt'¯Uj¯çèTø‹1¼_lý¦Ùæ`(îXõz}�fÓ–Øá�M㎰˜³!ïÌÉ°o‰—4RPð¦ÕsS¨SŽƒ+×ôüµÎY©¦×Túë·û"ÉnªH•DQ„pò^¦ƒ0,eêz%žöõÞ²ÑI=–gymOÃ{,6
Ú²÷âþÒ,‚¢(¿+ÑÂË"@ì!Êšƒ°“Ù{\c¥c
+Úâ=¬×þšü�¯AA&À?…|>»v¦ÌXÎHIœò¤'ÀµŸj«gÄÒŸÑ�ï:‡G'2E¥0}Ê1tžìÌ;ðh#o
Â~峊½Æ»5¸_ŽË+w:š<´ä*êæ
+k?_ÿé.PÕÈÚ6û®0ìF×Páf¯k’©—ðžqöó+ûœ:v8&R;#ÜX­R*î½Ñ+„ð
¸§ï]
Ý÷'Qו™ e™\oáuF«Ã<.ëùølrNñ[D/åð§ñå6Ñ X¦Kœ”aªQ¹®_]ÞÈ’pëq@@äu£†U†¬¤�²kˆØ#Œ$™Õ„`§X÷¼ø©
cKptzy錔–åø	AIBûζt36â ¸|²Eé[ý³ðîÏ�>¡vî圱ý5GD-?\TÊu¶¼
+Z$™É"ŸÝqr›Úç�,ú8jLÄË­„ò®Å…K;J´2pœrÝ·»‡©¸\s~­¥ØË©a~ÅѲ$:©cNLJ”‘–Ãj³�ux™L>¦µ	Í‹³âŸyíÍÏ->”‘j©èÅ�ynþ¤À¤c>áyR†ìX PHiød”{ëäG‹%ŸÅºø¬ÍíQ�xz õqKʽø®ý¥w‡–ûÇŸÖ;V>|³F‘‘àúÙz`G¤®ÿaž¯…¸¸�\³èx®¨æ•Âm‰è®ñËI6.ðrûÂø‘vèõ	…kzÃ7ÙŒãÝ(IÉùþÚ(›^
+endstream
+endobj
+7124 0 obj
+<<
+/Type /FontDescriptor
+/FontName /SYFPBV+CMMI10
+/Flags 4
+/FontBBox [-32 -250 1048 750]
+/Ascent 694
+/CapHeight 683
+/Descent -194
+/ItalicAngle -14
+/StemV 72
+/XHeight 431
+/CharSet (/greater/less)
+/FontFile 7123 0 R
+>>
+endobj
+7125 0 obj
+<<
+/Length1 1397
+/Length2 5932
+/Length3 0
+/Length 6894      
+/Filter /FlateDecode
+>>
+stream
+xÚ�tT”ïö.)ˆ"]2ÄÐ1Cwƒt§ä00Ä14ˆ Ý‚"HwJH‡4"­„„”¤Hóãœóÿ�{׺wÍZß|{ïgïwïw?ÏdÔÑ瑳EÚÀ”‘˜$PÐÔT
€@¼ ?
hG9Ãþº	€F0w8!þ¿
+î0
+íS„ Ð8M$ æéÀÂâ`qÀ‰ýˆt(B¼à¶M^€
ó * ]}Ýáö(ô1ÿz°C9`11îßé9˜;
+A4!(˜úD(Ä �„Âa(ß”`—t@¡\Åùø¼½½y!.¼Hw{in€7åЃyÀܽ`¶€_´ .°?“ñ
p�?~}¤Êâ Îp(á�ÎðDØÂÜ
èÃ
úªmWâXã€ð÷n`^ð¿ËýÍþUŽø��B‘.®„/a°ƒ;ÃÚʼ(7‚°ý„8{ Ñù/ÜbƒüîP–Ó@ÐþÏêwEyðzÀ��È÷«ú–•¶
+HåAð«?E¸;Š¾v_¾?›uB ½þ
;8ÂÖî׶ž®|†¸›'LUñ/í"ø�φ�DEDù
07ÌêÀ÷«¼�¯+ìwüË�ž Ðßé
+°C
„ÛÁÐþ/åî	ôÿß�Z`0ÀE
l`öpÁª£Ý0»?6zùîp€Í=0ôë÷ï74½l‘gßÿÀï—ÏHWÁ@ߘëÏÄÿŽÉË#}þ<`¿‹€
"è—ÀVÑ�Àÿv
úOª*Â	ƒþt‹¾¦uìõ—ìÅÁ
øg1-$šµ0ûHnAÑðÿ7Õ§üßþ«Êÿ‹äÿÝ�²§³óï0ûïøÿ†¸À�}ÿФõD¡ ‰DËñßPcØÑjÂláž.ÿUEAÐB�CØ£ÉÌä	þñÃ=”á>0[8
+êð‡2ü†¿¤æGÀt�ð_ßtô_1´¾ Nè—B´ØP¿×øˆ¡åôÏ>”P¤í/Ýñ	 îî_ôêÑ–ÀŒ¨-Ìç7³
|¼$
+�@Ï°CºüZ³ €�…ôv@"�þ,'øÇPOwwt¿©�nà_öo¡Ã`>0(Áì*êXÚrZ%Gëͳ6*‰»—vjÂÏ3šg‰�êUš°ZNÒÏÊœS/Qží
+[:¶kÉ»�¾ú2}ä¿ZËPç+xÂàüÍžÁ&qêæs2Ùÿ'Óq#FŽqŠüñB÷^ú˜{·elí{õ�Ä
l5Ý3ÉÞ¬dEÊ"ja-ZmUE™tbF;+z¨&›~ƒ5¡c*¶ì—„§_cÍ£Rµ^2©K¶�$yWÞ[êì_ é¡ïŒ	Vó
+YÛg	G‘(IôÓ)
+âU-ä]fzm¿¼ïoó�T^…Ãl‚#¹(q-£×x'(¢rÐe=nÝó�D×Çí’ËL¹Ï¡uôÂÄ®™ÖºÃï×¾×V/¨3ÜRaßjI¨Ø—}õ`'ïP¥DWéÜSJ0\¡“Ò?G€Å�_Þžfð3ä�g,›¬$Xn¢ïÃÌß!^ØcÝ5a´}nVò8¦Û>ùsÕÄY~tªýö£k[J™º@Nª(ùK§�Eý@é'ã
+CаažH¹\MÍ™æ<Ñ[VqdM|bb:¸Yz
wœìÞTóÛZ„Ý.»Z,W2쥽걧|l÷™!k›óÜñ'YùÙ3Â×Q�­›Ù�žyÈ~cÇ™hªòö[q}d›ÿf±t‡ÇäLQ^¶Xí—Ÿc©ºlÏ�]y–±wÆŠë£ØÊï¯a»½2 ¿=©ñCþ0¬
+/~`ìL¾×*Áý>OC²GÇ
+@1)Eý 2|äìHÐ[ü­ÓD„AG/Oœícé¹äbWT’TJ;‘²Í
Ñr™`6~†VŸ¿ê`dF1ø]Ïü® ¥il…êBW5Yá"€,£«ÇŠ,k
²-+1OZ¿è¯ØèáÀ|“Køš{ûî-»V­ÜÃö¼�7CbøëØ—6Æ~L—�ŽÄ*ûEYêâ½%§aź^ó¢;½ä³JæÇò¿ ˜{R¼;ô¹!*œ„—­Û:	)1Bøt·ýÆœCò`ù~t@‰À¡"Ž¸àŠÑEU·7˼[–N¶´¡ks3+¢0¨TTjO§ðÝ�ßý3½îÔêGùnè¹}Ú„Ô«¤jÙ¯æ÷ãí-
7£tJ‚GŨÖù_Îa.2Ê}œ;©ƒ©¦`ˆbz9Ð
qZk-Ò\$J>póŸY}öä°0>x—/%’î>9Nb(Ùõ‹«mÑßÁ­¦¹÷†9×·¹2ú^̉—·†åš‘É`\’d¸HH.jòÍMÙCžíì"2	ÒÅ�½†ë˜nÊjˆ9Ór&t[6ã.‹'½ë_æ0š¢b$jñf”uÈ„Uj4ñâ\>2¹Óõ²u»ÞQ0+ìÏ|elÁ”k“ŽÎ„j]F«^ñ
y¾¿¢[ĸ�&ªmÊ`:yÛÒœi6’|�­QxŠ]g:2ÐÁØN¬ÁÛF¤´³ÊUxÕï=Rešcrug!jYíŒ`6¾ì¦ˆØ¾:žî­È5â$¥É´äy¤â`‘xv©Ùm;ÆZåm‡|ºZÿ¨ÖÊ'ý­vnýÇÓ‡H£äe |ZÔÏú™d_xK8©þeß¾?»ã¯ºžiì�öKrfÏðï/šº¾>/HEè�~šzÙ£
{ë³Ýþi#û?4çž1m+¿V×�…FŠ€ÿÊSS~÷­aWeýŽJ»Â»X?s'Ù‰
++‹„lÃ$ø›Yè(©ºH°ÈÝ(È-?Zc|Â5ªó±âYÁYLu5ï�Ë¿‰‹?û°o'ÜÿÉ©‡ø£RuœñòÜ6Va3xÔgçq†H?À6é{ãE"S•Ÿ/[~�ö£y›j_PË;žªeY%Èãó\[=€—¦KM%8’.Ìëø3LŽSrµŸ#ílÿ�õzÖ»ª`/2l2 \HÁ˜–#765$?øü0rdZ8Ý+ð˜¬@�_>Rš«·hbøÈ­xðø«dy¹Ïˆ õ ²{4ǹ²ý…ތ֭é,JêoõÝ*W\�@ž‚äðÔw'FYîD1Å9Æœ¶8ˆbTæ§òåu*EÇ0ð=vFë¶û5Õ|‘‚°º<ñ�—¤X³¹ÿE%K¼š~zq¢–Cîòe%á{ÛÙ¾—X©'ý&
+ÜQ|,¤	ûNT­wÇÄ”…F{€´rkK!_"ÚƒD
+›–&ª]‰Öds–K#P7w¸&ãã£J·}µ$|ÇM™6ÊÊœ†`¬oý‘?dà¦Ú¦ÀÂY-J$rå~Ê0ÔDÓ@!Lf”'Û¨yé’ܦßÒ¨ÃÖØ
+áå�1{4jô:Ú)Ú¯ä�äYï·ŒmÜn¸„ˆ|>cùRÌzHË‘-jóbÙ¼mŒ’g´Õ$ïnUWŸÆÎa¬Ó›:3ϽÇs"¶M‘!AVŒÙ§K@ìÝ©
t¬”\¶ÃžpAÑp§MKÐíˇèH
<ž”}!‰P}”nHŠýéTfçá‚-¥ö{�ͤ{Ä“šó:Ë8Òh±ÓFXˆæG$óõRBùý®ÕÉÃ-®R�uñ’õP,ÐKCCJìÖ¾0:Þ¦¤è€y9ËfE¦¢öÙP�G¨
+dÑô}"�hSgL=o"¬w‡UA:dÕ0xUU<¿ÚBBßÕ µÛã 5«_Ž'ÞhŒ+Ù=)M,Ž<Oß�žÒL{}
g“ÿ!Ð*Œz—óÑz©áÒ‰SÆRßFª+‰"w%ÿ	mþ»k'nÑÜûû'înÔy[)4àRk%ˆO¬›>ŽÚ0ØäOˆOî…Ï­e’‚kŸ
+ïUœŠ
ëU}”ÉÜùäåæy‡,@®aºÉ¯¹Ok]±ŠLˆœÖ’¬èâdDµ)ëáë—s°
*ü§Ö)•ÓicTYïá7Ñ!âùôÇ­ó~ÂØÑBíÏ×c‹ñGJ>4Ha9fOë÷ï‹ï¾KþQs”jÍšQ q§µÍVÑÁŸ|ë}Z`ôóJ÷ëAˆ³îÀÝã~•Ù2¿(i ʱ9’RŠYyâ!ýz4¹ó¤è1”.fuôhg†ù�Mz̹kµ;µ½@¨ã­ÔlÁd’í)Ys+=É´O_ñŒ› ®‚¦”cÃÚ0ædnåšñ3¼äâѹÃpñcsGc^LyýÁ{ì;£Ïñ?óÚß
+L‚Ú«8j?páÙóàÍR
ÍVsF¹,²'%Þj3íyfh91 MÀÕ‘¯ö@Ù6™jØV]J?¼!.ÕÿÍ^I3f£ÚóF7ÉÕ(˜Â•UÄLÌmžD©úýê²Þ('A“ßÒ“pèdÇ`(¿\~rPm7Ë·¢œà^r†ÿœXÏÈëò™åñÎ~Åm̓သbžç®3>w¯ö°K‰ã²ð‚dØð6bìÛýf(œkŠ’#N÷·¸_¯ÑŽÖ27¼l’{« \žžbêò*ÌòÎŽl,/iÁŒÇTsâž4­£ÝÌ´Éë‰�
+÷^UyR5o~Ò¥ˆŸðUHh©0ö˜¥øJØ]µÂU¬j@K¢<òDm·
6tDü-Ž•§ÆbôzÌ	HYs»g�b7ÅË™ù„Mø ãNL­èir¡Êb›\ÈŒHÆ‹*øt$‰ÌÎghxu-’Ï—ÚÎbŸ`KúÓÍrÍ:é0ø¼¦ƒdý1[mV ¶õ‘À5Nçæá$ûú*¸tjžáqצߤž£œ÷©gD”¥5Xå–³‡;NT’ÇróË‹§dÏôµ3?h“çnÉ>+o�©G»êKBïÞUî-ÆKé~Êm©¬ü$P�÷ôƒ,ý  ñâ¸íùWE
,'jî`Ð~
ygF½*dJ'§”:ú¬’ŽîY¸«Îg]÷z….xYzÿŒ“…›ücÖü§d‘W¯ž›7蛲5½ßºè›SÈöËJ€Iî±7}&ïÀ¥ópÊÍû†<À«c=�‘!ó	O]Qª^¯Ü¬³{%éÕI£š4ëS”|ÈÁm*}èËéècêƒ�ABŠÁk.Š†)-“›êA`M§÷û3ø:'ø@>g’Ô6ncÚ5´õ‚2(yÙகCÇ¢C5æAœÓajD{ËÂ3ú·
+õÕ΀ã%‡Õ‰
Ôº—VŸºs7a¯ÊË4é$Æ:8#pRKV!Ä?cÒ'ê~9´i!¼
æT¢ÄJÁ~aâz÷Ù|Ÿí-kã¯uϬ7qÌ'bØÞ_oí¶2®(×}O·«•oœ²›
ëY(dçÀ¨­LgÒ�[ÚŒËRõºq%Yê4Ë}Xõd(é	\Â	ÕÈŽƒëøtN…S-Âd­77i•]�"èm~ˆqL—Y€¿í¯¹(Ê ÈY£Ç}º
+ä)½® Ñ›ú2d5–«ã׫;ì´¶ˆãvkR“Ã%
+h³Ü ØúIXc�‡U‚a¶XÝÎ-¹ï£õBÎHQÇ¡[/W•@b0+:	Ù�|9ŠOX"O¥4Õ¶f­ÀÕ‹¿—Áï¥uÿ½³ò—C¶ÆU߀õA%Œ7'¤³´—ôÕ¦ÊÈ×Ö]®Ñ„Q/€-Çk~óŠ„m˜yËÒv–ž?Âê0÷¯iÞVäqÕ�Œoû˜þA�î¦_—ÕðnÞj?Å-¾»MŸ$|ó^¼¹ê‡Ñø)k¤ùŸoÄjì�ÙWhÍe½Ë§¼@àR‘ã´ªS�0oµ•žOYµ‹“F=´¬æÀ]Ñ'¹/Úß2øˆ¹¸NÎ�£zK’¦Â|Š2†zÝü
kÒ\Š¾WóÉ5�V=Uw+z…
°þ&¨ïŠFP,Ž¥õS¹
+¾âÈÔ×�ƒ}pCâÀL"¥(­©jür’d×[iéàlé“ÑEï‡~µ (¢‘Ÿ½Gxç«Ú<\pVç[¨pTËLÍèuØmZªŠIîÈÀõƒÉ¥s³±U_ú¾ì¹b®ö$\7�ú�ÕàÍž«…ñéVTyÔkTFrbAÓ=>T(ŸfprùÔý!ïws?Î`ô"\¶8tÆ�sØ°�õEÊÌB­FsÏ	,æ[�>9Hñ䆰_ZõY–Ä2ˆ[û�ÈÜÈ·^àMã±æ4cÞZ[8>™¼¾=+¦ÒãfÈxƳ‰
N…<i±ÝW|{'�Za­CïTÈK}]énô…ñ¼q㬩®ZÂíqÒbüuTâ¥6PÄØ/ù(u×ñquמ¡½©[KèÚîFB¼~']JÝâ¾ñ™¤Ý§
¸vËð®t¾‰z¼Æ?S¯´X%KT½øçýr‰¯A·Ò
Ö‰NJB„ÊU�˜tTòŽÎ$
ŠÁÓç’%žumês´{Ô;LR—˜¢¢\¼”Wïš-gHx·?ü¤´Î¤^®à—ôx<jåMôäiÙ¼@¶?Ë©aóã‹¢tøÚ'^Aæ‘ð½¾Ñ·¬R4.‰·Çj~ÎsãnìÇŽK�t•¾¼¯�Ea™»âHx±¾¤¼b_sÐèo:xæ\›òâó^tí
÷ÿ±?ºm=ö.ð]Fš @=ƒrgM·û$7ô(™V•i´T&û�d_v!¼Îöý ]`FœN”.§'Ëô$´ì²sn–�¤K5bæ.ObOÆ“Ý#�ña&\S§ätöµ&ßïy-5Óάç+�'e¾pÁmòjiÜÞÅØ9ù¢4*vl<Lª‰s@aVy*äý\ñ©î¦5÷
É5b¾œ?psöÎÏ¿‘ 8ôäáŽ|ÈÆ¥p¦eÒErs×�t0–•åƒ‘9›äî•ÊËø¡¦#]ñ7¯èÉî~M}oPü^YQïÅã’ºd?ž‰Ü
+5ùy�°´®Zàë�9\ˆÉ¹ ª2�góÓìÊ�ÙÅ?sê5yhÞ GxÇÌM*ÉȜ֋ú'dp~ëŽ6!¬É* K}¾Ná^Të:,ŽÔ>׫+;ŠkÈo)�|?¤#¢:'j{
°ÎÛ¼åˆi$ð5ç­©Ë
³'sS´†õBƒ6f¡\‰ô1Lœ€~DÎéFkP�r÷m±ÖÅ>U³TÛí4–):D”¶�•Cun+I6©ìul>�»T‘™  [C�Û£žƒk +¾g³…Û2sLžÉM»ao[ó$dcë•£ŸfÖ³£S¢˜l„Ùµâom�Xá'´Ë4@N P)ÙnÞµ� ˜¢!£$¤ÝI”W"¯óÃ÷Æè;t�3¾˜JW`ÿF�sÑë›ùÛœžLTšÃgÂiÜ«—´Qd½_òu¥íŽõH
+Ðt~×ØØí-œ#ª#�ôÇ÷ bèÅ*tLÀ`ï\/.M¦|ËÜÜõ†ðR?³FÖúk…àpœPÃö=íIß~£HH–g[¡<·aå�L	�`”íçœçÍr§ó�KâUú‡ú¹w¼Ø°¢
+egíwÀ|â=Æ•\¶—[øÞW>0/úÎÊH$¹ŒbƹÅ||ðSgߵ܆G%Ù*6Øçp¨®íšL4$rŸ›9ÃüðaÅðXˆ bmAŠ™‡h£"¤›ƒöaîf#¡9¬øôÍÏI«y?šHhƒÇJBÄ‹—×LYãÕäk'¤É
×%:¡¼ŽOêÖ‚ý¿_ª¾�œÄ»2Ó%C¥á:óÚ8¦)$–®5°Š¼²[ò>u²¾Ü‚£Ìœœ-:¦ü·KV²Ò+úŸŒžø®ØÏH—Ÿ²œš•§Ü7IöWo¢È÷eÔ+¼®ÕCþ×¹ÓÍŽ_2Ó¯7É#˜�þ
+ÛþXGö½%:TMð)‰û9šLV’X¼*Z†Êi3Éc‘==‘/@Zé\|ÎM÷¿êí”»µ™�MÔìex��Xo{÷\î—è*ZPet?–}ÌþœéúÑÄ•a¹PçKu&Ì	!Eƒë#xjš'�;c¸³2·ã¾de�	•®��Â×–&âwŽ2��Ÿ¼xç6Ô8{=¾ƒÈ¹—L@»ÕÖØ9”´mï±ÛqcÁ£&nnt 6ë�OKy€ŽAÑ4Íý6ûd9Û÷î‘öeß#R¬ÑÛ‰Rðî,¶…Xà›‹܃ ;áü'“¥‰r¤åoò[FÏî>ÈÆAøÉh¤àéJ‡ß}ô4²C_ss¥òýôL´—®—É)Ý^Ac2�àãÌSÑXòë„cÎdÌ™[¹xbÉòO4[M‚;‚¶&ÊçªúO¶JÔÍAÖÛEfõoIGæ²?Ðá×hU.~J…9®ð*~ºïYHx‡_[7tB�}ìÕO³e.ª;CšYì2uîo&Õw?ÃßÛãÜ¥ «÷n·~OÛÞ½u]¬hÁ�Îlùº”j©$¾«éb¢/Bׇ�aÈZAGºö¤0{G¸Þaõ´ËîibÔY+�¬Ko­'̬ª›(
+ÄkRi¿)»ÿzã[‘“®Ê„©QËŽîy{,Ä`ÐFsM³±\-ЕÞ5¨ïÞ»m..º|Jø¦þj»¾ã¹¬ØTºùg{²#‘ùTµÈó=é)Ê—Ò´Xá�/† Š‰i{3Õõ“ñ²~38n“üfΪcSÚ'SÅü�~:uò[óœÖºö¡Œû¿˜B|N²R\�ëÇXtØî4XeÙ1ÑŒNüØWhº5^N
K®‘º¬»£ŽÎݺ”2§vã¦_X?©5èV§ÕáÓ §U�JHs×ÍÉðeòi1åç“/†¯H§ºç·gáÄ`Ô¶M4·L[~�ûžVMT­£	ÇÀ¾O·ÍéÒ;°êð#Qââü¸øDf�ÿçSÊŽŠ/ùävâ8ô
+@ �¸­ìÁÊ¢G”6Ôöƒév	‘\Ç3Ã[Ù•7ä°/Jf%}P2þOsHoÉ~NSÒp«µ³RoÖ4Û�åe&_)WðÒ’¶£¨²½ý×aà!£A£ó½<ã.Eî¤ôÅÅ“2ÉRbon}�ÿ¹ÊX�4£Wµ\ÆÓÑØdý™NˆÕuÿµ…¹vù#ýVoͳ΄v×í³ìí«‚aXÉDÌt;1Ó�oœdÊ�5³¯9Ÿ-äXìŒüð}§ÖÅæo�¹ü?¯—\-
+endstream
+endobj
+7126 0 obj
+<<
+/Type /FontDescriptor
+/FontName /VQCTSW+CMMI7
+/Flags 4
+/FontBBox [-1 -250 1171 750]
+/Ascent 694
+/CapHeight 683
+/Descent -194
+/ItalicAngle -14
+/StemV 81
+/XHeight 431
+/CharSet (/arrowhookright)
+/FontFile 7125 0 R
+>>
+endobj
+7127 0 obj
+<<
+/Length1 1403
+/Length2 6103
+/Length3 0
+/Length 7066      
+/Filter /FlateDecode
+>>
+stream
+xÚ�xTTíÚ6Ò ÝÍ€t-ÝÝ]’ÃÃ2Cƒ¤”tI#H‡€„4JJ—”(HI‡€€
+ò�¾¾çœ÷üÿZß·f­=û¹ïë®ç¹®=³6;‹�1¿¢Ü¬‡!ù…€Re]cK! …ñÙÙM H(øo;>»Ø
�äþ¡ìv@¢l*HPhyC
B"!q)!	)  Jþ
„{I
T| N]
€Fà³+Ã=ý½ .®HT�¿o
\ n€�¤¤ßïp€¢Ør€
t�®`TE�`AÀHÿ¤à’qE"=¥}}}<p/9n>€/é
+0#À^>`'À¯‘
zà?£	à³L\!ˆ¿Æpg¤¯ƒ€2@! 0�
+ñ†9�½¨êcM€¾'öXç/àÏæ„„þ•îOô¯DØï`îáéó‡À\Î( ¯¦#€ôCò
`N¿€Pïàã�:8¢¿[w¨)Pþ™
ò‚x"ô׌‚¿Ò ¶Yæ¤÷ðÃ�ü_ý©@¼À Ô¾ûþ9\wÜø÷Êsrþ5†“·§ )òЬ©òƒ2áÿÛæFÄ€’ââbBðCØä*ø«€‰¿'ø·ó·5Cp 'ÜàŒq£¾ð>`ÒËøŸŽ®ð…„Nàv�Àðÿ�e;ÿµF�¿Ä`
DÑOüõù×�
ŠaNpÔÿßðßG,¨§¤d®lÎûgä9•”à~€@~aI¿¤8 $$$��ÿ3��äOÿ«	s†$ÿjµO·ìó‡\Â
øg.=8Š¹`׿‰þ(¡.Bÿgºÿùÿ±üW–ÿ•èÿÝ‘š7úÛÏõàÿñ;x@ þ(æz#Q*Ð…£´ûo¨9ø/éê‚� ÞÿíÕD: Ô sA1š_HT(ú—‚Pƒø�� H�ë_¬ùËnúKoPlG@~=aPQ@àùP"¹£ž"5»À(
ý³®*wú%6a1q€ƒ——ƒ?>ê¬Q+1@ J•N`¿ßd
+ÀàHT5c0Àî…ÿë`E‚ÔÌ„;ê\9Û…€âAG¯ß†Ty{y¡ä÷›¨vþ^ÿÖ:ìá/ÍÃAÒ‘n/#;¯êé}ù·Æ±W׺c“-bÄ�Ï]uprÔg*Ù;ÕÒŒ>5X¬Œšž¢ç9ºšð{ð&/l%S£‰¦:°¡tÂ_4üíì�˜É	Nç2)ñ4vƒô8Å�‘ØÞÓš3Í|þú±D¯Èö‹Ï%7݈m+É}€ ì‚„%“™ Xн�þÄ’…m
9bù€$‘ÌË:ËÛDÓtòý	$ñR©3žö›ÿ†uböÈÇ�o󞊜k÷Õ‰×F‘ÓRh±Œ¦ÑR¦äi½B q(‰](Wf$³Ò–zDq¬`ØK¬ü˜-ìHñnvÑS»«ÿh¬Å».6/[лrÊ`·™kòM��¦55Ö•¯þ)›{�ÚÅHÖq�´°“Š	€Ýؽ|«;/¯¸´ÔAß�ó(BÄöóÍ•}BNŠ�°M†,ôþЧçJâP&ÏQgó÷×2r:vrM=·5ïÑ{|_Ÿ@ª-˜Ó`ç;­o;Gz£OàlGŒ”3aÉ]9ûý{)¯4Å.Þ‘šñ¨Š#´à=vÜII³!F…˜ÝêÒV
+’‹S¬If"ÄE&¤&:ÛhYzx–R�CgIˆÈÝ�*_¼¯{&Þ*›q?øhyê䎊áAIÃÆ]ÃÞoX¶ÉŽ^'‚¸¶Ú…ÝV®öåzœZHÑdHË~òõŽ’åL؉ÄüJ¡ÒOÓ;òŠG
+�~$~Ý>o>.´PlŒ±‚Ʀ÷Ì„lØ=cì²LdÈz=uÐ×Å™±í§Ñüýó„ÜqD]jˆ5²ZÝ’$Ö®üq�2ÖÔzÐA§ó¼׫w̹åü��õ¥´èf˜§íN³Þ±ç�ª‡J*2bÎÅÇ’"µº¡’�˜1f!*„_ï“:L5‡ÏÃÐ\�[ð7¡òÚï©Š÷­Ùž´Æ‘6~W÷<¹ècøHÞÞÀ ¨5ºÄ(
W»ÿÃÇ@äÃ'A}ñ·þŠðž†£GûÛ6æéUÂuÛ°c,EWËÏ¢ZI‹-“æÆŠ-TOtn„7ì„ÛîÖ¶UÂ52ñ…¨ýfh)†÷8{:½iƒ:à„WßÍõ˜�rTÓO˳ےfÑÏp¤odA™Õn©„è�¢¹
+½`R+püRV;Ì
%T¾²
”•.÷ráF2ø8ÏÁ#x�'iòt÷™ƒ/¡ò ž•Ö£ZÛ£šÏ6UQ›$ï å‘ÚUúÃ3‰,šwã_ξü±MóÕˆô§rÖ\:»gìKÖ�·×½*$ÏX9ùì]Ógy�A_¿;ˆl©U@12ºÏîûaÖÐã”Ì S5Ì+zk×¥YÞ›­Lý$Tn¡ˆ0ƒ7>]öi/8H•ïmLg–NÏk�ý Ç9¸Q^Ýý€µú[KFõ´Ñ!–�‘rÆb)fž¡Š+>-Ѭ‚_ÁÕhq—;U‚£3t[QóÊÀ½ª1Ûw)‡¼ÌIsX#À�t)á÷#™)n8ìÀxÄÔ@³Ñ9P{¢rA÷˜àhܲ®³èPðÀçMÒ¤uQÛ�E¦Vvý"…ýl�ˆ¨42™ÎD­ç£Ë!>)s|ƒlM¬®¦åºòç�ûòkiž<ó‘>DÔ²ËBˆà
uâ4…½T1Û‘ŒX“­ÆûÎíQ:òèˆ6}îÈ& Äìçv¢Çx‘ê%ßS�ž“Ÿ�9ïFOÙ’ª¸~8—Ù,ÌÎ^WÊÝ›þþzp©!ìÌ©|濲^o7ôbö…‚
ˆé~ZŒNâ!gíç;Ú1×¢îú²Ô‡?«æM
© |
àªOV¨?»£¿Ëæ!’À}ˆaýžûàòû«‰Å�ÙðŽpÛ¶Wñ[g§6¤÷¡I›¯m‘‘o“××m¹sXL¶úCÏÐ×jŽ–¦רºŒY‹¤“v2®½mÑŒcñÅN³Å•dI—‹}`ËÙ&¸µÙI
“�¬�§/+Ém±ÇùC‚c¦‡
+g3yŸ0ä@ˆîÜT‚&<aÃËM³Ÿæ«õ*ÃÑŽ]ÙߪvO
+hmkz%Tá›[5fï7'†"z*slÎwäçøÐO‘Eд,Wñ”[ýŸ^»rl£Ý±FÉdc€-†Á!‹¡ç%Þ›dúË6/ñËÎ7Ò¥�V™;=ƒ›>‹L’îþ¤‰TÍ©þžÒt*À47ÚC¡¼)©£H›š�¹Ž
êÊò¬ìáAà�¥¾,;
™ãâ	£¥F;lŸ_µIÝv½ãîJT½·¸SêÄYÓ·ÕCÏßÖBðVM�~Àþ%18z©‡>~ñ5�Çèã:«kºþb¢û“¯Ï—@£gÍ“pŠ%ôš¸\�ÒwíÚÎÏZ
+¸³¾â<,à]XYúgŒw”æÞÁ'·Ó‹¿±çWhÄ
’™aßÐsžçM6L]T"�+†Kˆ�ä?6XPb’sEXF<î¿t×3o¶|}¨¶(³£ܘ¹ë޸܇³jtÈõ~nÒVx‘�ˆ®x}sàÙ�?A¼
òˆ€Ï¾=¨¥5Üj§¬�,òÏ'JKzïÃLvÌû(¹¤�©?]µ”øîåFªîàþ‚`í#Õ>rñ1Ƶ8'jÉ@¹i×Gïh›U]<˜ ì€ð§°À¦Y¨H‘:ùu|:oÐv=×f›ÙÜ—Õ8õŠ¨D¸¶3½9EÀŠW¡Ý¡ìuÖ@Î*ÑÑ(]@WM_FCÔ1m€à‡Æ–¥€�>«È ¶X•;Lƒ¢üÄßÖ€ª‡ž-qtVÆß[χ֢kpcß®Ñ.¶*n¦·½éBB»&4nŠ¬ÑLÂüºÅŒ�
byšž�Á•IeÎeÝh¾îï£i˜®4„¸%p+’ ¬	S}Çál@ÆÅŸaMÕ}fò�2²Ø€³íûƒA=¥rN·nþ&9	a}ÍfCŸŸ®Ñ>,sQ¡M9K9^|ÝžsG2«cË$Fy%D°ù¨=e +
+«ÎÈsøT2~ÐkrNóIÜ­ÎôPû‚ÜÏ­¨]�{üŠ×Q¨~þå‚>Í\¨ŠÎ±¡†HØe‹
?~ÞyÚÅ)3eÙµŠ
æ?¼"Š/”‹çQ»÷Ô)úK	<13ÐF¹JŽí'†^€ËTÏsx;Ú,–[Ü;~½a‡ã¥ãµðÓûIÚ¾†.<óx„lɉÂæãbò'z÷tÌb�¿½½¾ò ¤€:LÚ°S°–Ù'wTÚ½0|a¡Ûô|}1�È4‚ƒƒHEó°ˆHÂ`˜Áýå3C±IÑ!ZÙ…“�va±{uõXœÛÇ�êb\z0€ºJýãóÃØWIû•æ†»ì
‘³4Z/Û-JèŠ{E�šþÀþî瘳÷b¬Óî•0F¨ÜS}žêéY§ÆS]ñµa%ËçØKÖi&
»[B:ƒá,ÁSG`!õµ{[n¨3GŠg|E‡Ñ}<�²O2•Ã!ÕMš—1�²�Ç=õ^1Õ¥¯^›g/ÌB»}Ù¬…3`ÉêlL‘ñ=7ìèbònãœIg:i_vò²ÎÄ*‘Öþñé®­
+¤âƺìD
+!“ÿ¡U¸—åÅŠiô÷ \´Ì{ØßÄÌ"÷�§Mãö„_^ÏÉÞÆç þÏôŠéôaï r$¿”3%on¥ñà3òºx*†òÕó½‘
r«#U—Èý:G�zœY×üt‘�$D`WP­‚ž~¸mXœ‰4Ê[k�C`eð¸ÒÑö„>oÎ{xžiEÛêÖ3ÃníNögBDÊ×
)w{”˜Ìα�Hª·S%»Éâ?±‘TïäúbÕÙ‹‰\–ª¹Ìö4Šæ+eïlæ(VT“­u=|9y2J̼úzeZ´'Ž)º$yêHè…�3Í;¼š3¾yã�Bñó�N,†g^%åÖ)ßøØ"èlnø‘@}Þâw©Îv[HYº7)\Ô6qw,ýUõ‡ÉnµñìtP}CNJ¸,Mígê;Ì<£]UØ‚Û¾Øý±F÷Û¹––žä‚Z»úô84=ž||.gÁòÖ#üeDaJEd~Ë:c¦¬±s•ÿ�;õ\
+–ŒÿUžž7¡C:Î^iE×€@Ùà1:R¯©´?*ü’¤Õ]QÓ&š›Z÷Š8¤Å¸øó­e欙.<
;;iŽ£‚Ç6‘q(…ó¤€F¼NsÍñj8Hfub äée7Ó4Ýa=ÙíÞRo:ˆ¨6´E¦è‘?§Ç
B&Ût7LÒ“Å®½Ü°óý×MÎ2½\õ¦ã5¬,9"ô�Šñ×n6Md°39­¢ù%•ÃPY½«Çwºa„Œ	�©-¹äX—îóì<éw¯ð¹‚¯Ç]¡}„žÅjlô&©ø®·]Ù”„tÑ'Sî;=TM¥)í{â¶D»–M*ÀFi¶¶íJ‡Ì»pgswg³ݯ£Ä<
9·}¯#éPÆ4ÏT8=û!’ñÔ“jX÷,Íðsv,¦ãZ¥ çÙ�æ³g&i»Õ¦ïcÚýœS$Mí�퓾ù-öÐNä�–™ë)Àó8Ý°†HŒMR5íç=ÿÂÉCuóÐ"Ôäì)C?ï~*ˆ+_)ìAË]0:é|ÞVw˜±¶^|å�k£Îžý}`=I9K§!Sž �±ê×vî¼­TÍ[3çõäXuõØ9ýÞE_›!Áð9Ûw¶—²tŸÂòä÷œD@Ü$6"Ut™D{sshì<ºÁ}tÙ»¥ÒÊNÏײ°†½<»hë…(Ün
+ÕHéHzb@�ŒÈŒCuÎËuå™ížÜ˜µÜØ?óì˜sH‹¹æ¸Ú¾ç–6ßÕÕmÇonŒ$|8èÃÑR7r©¼º%¢‡Ö¢c…hô51ðL¡Bt¶OÖ_<áåϯ­,2}ò´Aí«é•
k‡öDTouçŒe7X‚\XÍ•q�q¢§ÏÑi’vqÇ‘|CÆe©ÉŸµñõHÚ~Žrû³â®†TÓ‹gk–ŒŽBiÍëC�­¾CF¶–Ó9´D|øÏØÔ*Þej¨,�šÑÉ{žâøO?m£0XaW“íïTŠÆ¾Xº(R×^4pm|¤×dÝŠ©9b·ªŒ{bB°2㌷�'3›™vÇ^õ«¬*4¯ÅÙy³ö‘Í>Ø›8ç}ȃŠPÒu=awçb‡3¸·–„H~É^Ó©ÏÚ^Ïyˆö²y`žî슈üBRB¥î©Í7)sZi
+RæäÇ$YXëÒX‘JÌ©x±åäIkšÒò…,&%1�»¯T¦6›/"Re§-â~Þ½Ikzꪋ”ó—­‹âÙsTÆè~dKØ… Wôj(‚r¶\
”e\ŸÝyp~¹X8Ì †¾Qd�Æ!�D£_x«Hk»ˆ¾?›N`’~åÍͺÛ(ýýƒqFf¯O×èÉõWåG�ò=Z‚©j¬â¦õ@¹mlôsÞÚ†³‘@ZÖ‘ÙêiÙý°/ˆÝ•Ã?¸–ÍÚB˘ﵸþG�à'¡ÈýÑ1Ò“b³õÑÊFÞÒÒW5µ¯¯%âMá9/æ+ý··FúÓpL
+ã•Å®Õ½\ÖM±ûIÄÆØ’¢ŸÆsÕ'5÷Äá>Êø¨^µ¹x¿àéaQ¶®ÏÖ*—5²<bc@øe²öå0×fÂfÀ}Ìœæ±þb
+]Œ‘@üóÄÚ<#ënê©,¸žŒÛ½Ï¸?9÷û;…jɉ^K3Ÿ<~ ’šç’Z'5È_<ŽÚ ·ÊeÒŽq‰Æ¬Ø)é­Ü&&WˆÏ3©IÌq:\°²jÙj*~»qê­•—K|ÆzÓ_Ràf¾¼cÛ‘ÎG	Ä¢ÚÃ+O0,VÃ
•<·h3�›‚¹œãiªmKÉ÷"Ó“±�Mõ'@ƒDnÂÊÖ¥Ÿªõ%äÂÜÍ¿»—Wv¡�ZÔqF¼<b,£Ê#¦ì•1-¹ ·|_î䶌X !‰–#ȾGO÷%sÉi‘áD)É«*Ñp¢·‰�›í?pÀæ4Þ£-_0šöîà’‚Ž…DÊR':Ú'–èQØ–™?™}ážäç»Ù,ÙªýùjòpšÉ~7bÉõÓZÖÜ7.iJqùñKG‰çÒJ¶†Iú•i"ßzx”îŠ4FxÃ:0Ø^­jíÝÚécƒÚ¿ÃgÎb{½jÌ/Ii(Ø_º¥Û-�_|34¼7Sß|‡‰äÀuÃ&®Ìñ¤ïf·c¯ÚnOXfúj<s�“äÉÐ[Uo=™×C«Uô³R_¡„]7E3|e—YÖ¼èƒ5÷€®MÐqcºïT×L�r(v;Á뮹%l.)çœ\ù
+@2uÕßr.‚Œn©¾m/r«Š*ëb-oú|~”<�_84lM9«çZˆžhIFÙȽ“p§\ý™v�=G#õ
_�ßDÐ9¢áwXªQ £¦Mº±½ˆ5~èZ~·ÍJ|Šæ1šßÊ´«1¿¹YÆ„
ç«úËي;z[ù�Ð*©X¶+}±UƒÍHß>»©XU`‹öŠHìÔ(«íÖô7—‡?%�
Ϊƒ\Òž¬²?GœA¹îêˆÃ9åÑý°�8<ýo_öíÉFpË=S³[W+4Å©•3µo”1}ëó=(pª?Œ¿c{aøƒiZYç¼ø,¥•Ê/ËïSwãcµÖ•\,ÂG¬‘›ªirãQA-Òö˜Ä>?د˜ß×™X‚æ±mŽÃÁèq¬êOMéÜV«±#ýãN�>~sRÞN†)TÞVþv/MœXÓªž;òn¿Ñ�²Y„Öù}â÷=Ý·x©LÒ£¢Í¤�Cû&Ú9—ËEÁ×ƹÌ,{´×z/äÑ~¼�Ú·]&[bEŸ¼¡uý\Ÿ™:†á;>ø
ß·LZW¾�—>R8޻Ƚc�à?™:dž	ªYvŸ{êd¤x`Ï5ðX!0YËß\®ç$fSî{Jݶ¿Âç�Û6ӵ︿_)ôiH�3Odü•%*¡,~Ií'X
+•ÑïŽ3pù�Š0—»¼7÷ õŽ£fÍ
+¹äô>	¢d‘[ù
lJ îë|n;÷"�†{.›?ð•~R[½þüwa£ŠÞ&b¿·;û¸Ì1†¸ç¾J.S)ë�7Æ7¹¬UÐ\Ç“‹é¶†,Mÿ¹ªXoF÷b=½*Üu	^)`+ô‚9^?ÉÈ‚ö�Ä"�/?÷³3†rïz
]­,½®b¥nöÆÏR§Š]ñö/Õ#Ê­N9ép)ÚÊ¿f}ÚvŒ1|Iw~Ro%+t¸$ÓÒàøТ‘¬„®?b ×x GQ¹}½qI¥º‡Ã·
6ž!•Õ¥†“sSð‡i�†Ì>•HÍЙ.	O·Ê
Å,¼Mc%î14o¡óu:E”G?àG»¨õÌ
”^mÉq½úaqq’<é`Ov_‚,Ý’&»éâêíÉŸ¢lDsU-.C0Oþz,.{�ÐÆ
!ФdzýÒ¤½0-™|;Þ"/kÂ4C÷‰uÇcÀTãrç™WÕ©�ÓG=?dÿ&—+ŸÊJ~.E¯]EïŽþ¸ÿòµ,{ÞÝ%sy8¦“thõ†Ž´·ÕŠùš}öî¤
Wç0_¿\Ú£ˆ�N±žþ„²YþwÓPrŒzÿüŸYß	®ŒÉ°h­¾í¦.gˆUÒ0�Ù—e©fnb¶æ^­‚ø'[°Î”Íõ믋fÐ]ÝÄí·Ð²
+ÞttKN‡\çqÜìŒ{HÌzÝŠ –]€¸E£ß7MêÕ=šïÅa]»´N«_­ìuñ"ycRvãy"U<’ “VýÂêfY
7™&óý˜ù5úõêQ!«9Œ¢…ͪú¶] Î]º­A­—¶�×[ª�Ì
¹\RÚ[³:9^öÝëÍfܽí!É&rQÙ8¾çþ²kº/ýÓ~•òR@¾¡ß™©çŽV¼Þ"pŠ9'ò;sΡ˜^W‹
œS�z&·›[Øà2¿A9Àc�ç¹>f;Å#:’÷c¹rr7ÚÄ%äŽU
^G—ÌÝÛV‚ë)ÂÁÞìù4Ù
I^ÜWØ:‹ÓóGv³½U*(gÝÈ}U\â ßÍ*BZVWüè“·U3âгm¤­¹ßþ”ÙŒÕq�@!ÇDEr5€WJ	ÏT�uZùrGú¼Ì•”	ñšzؼÀ5� •,µZ!áBê»[
+endstream
+endobj
+7128 0 obj
+<<
+/Type /FontDescriptor
+/FontName /NBBWCW+CMSY10
+/Flags 4
+/FontBBox [-29 -960 1116 775]
+/Ascent 750
+/CapHeight 683
+/Descent -194
+/ItalicAngle -14
+/StemV 40
+/XHeight 431
+/CharSet (/asteriskmath/bar)
+/FontFile 7127 0 R
+>>
+endobj
+7129 0 obj
+<<
+/Length1 1422
+/Length2 6187
+/Length3 0
+/Length 7168      
+/Filter /FlateDecode
+>>
+stream
+xÚ�tT”ïö.ÝHw8( !ÌÝHw#-01ÃÐÝHIH—Jª€”„¤´¤„(�Ò-ˆ ÂŒsÎÿwî]ëÞ5k}ó½Ï~ö~÷~ßçù¸8ô�ì‘v0U$-I
”tŒÌÅ
 �° $DÂÅeG»ÂþÂ$\&0”'‰�ú_%‚Æ`Ê4†§ƒD4½\
`aXL
+,.
„@ É‘()€2ÄnÐh"0O.%¤»
+îè„Æló¯W”–”¿û; àCÁ¡@‚v‚¹av„B\
FH(†öûG	'4Ú]
+ôññ„¸y
+"QŽr¼w
>p´Àæ	CyÃì
¿èBÜ`&$á;Á=ÿàFH´`W8†ðÄdx!ìa(fs€‘†6@φøCÖþC¸ø{6° øßåþfÿ*GüN†@¡H7wÂŽp8À]a=UmA´/ú.‚°ÿE„¸z"1ùoÜb‡!üîPU0@0þÏŠ‚»£==ᮿFþ*ƒ9e„½ÒÍ
†@{’üêOŽ‚A1Çîüs³.¤"àïÂ
Ž°wø5„½—;ð>îáÓPþKÁ@$ÿÁah€(HRLLDóÀ|¡NÀ_å�ýÜa¿ƒà_0f‚ w¤;À
3,îÃü‘xB¼a4Êð¿ÿ\‘€Á{8
°ƒ9Â$ÿ©Ž�aÖ˜ËGÁ}
– ŒöÀЯ߿ß`äe�D¸úý‡þû~�z
+š¦Æ*ü&þwLQé‹$EÁ°æ!.!úg}üo ÿäj �É?ÝbŽé_{ÿÏ_sðþYK‰Q-Àó‘[�DAPÌüÿ-õß)ÿ7…ÿªòÿù7¤êåêú;Ìó;þ„!npW¿¿Œh½Ðè 16@ü7ÕöÇ´:0{¸—ÛG5ÐŒŽ1€EA"p¸§*Üf¯GC�þHæ~ÿ—Õ\á˜>ÒþëÛ‚É�þ+†ñÔóýðÄèòw†±Ï?÷UA@‘ö¿|&$*€ P?FNB¢¢€0Æ�ö0ßßJH4&€™1à€D‘üºVa!“…ôq…9 …~£`0´ƒ@]<]!žNÿ†%E@W¤ã¯»úåã_ð?š�z¡PSþÖ¦Ó­
`0_”df	•Žt®�lýV­Àâ#ðy„`i¥ýa²yo¬(šûã“'mµ	E[ûJÆ¡LýOϣǧYø¾�úZ½Í[ÌP/Dc©ô®)	<}wñå­#ŒÝÉì8&žùp�ê0Å€�ÂÖÏòNšéô�(ñ.áͪ�âŸíž›’»7@éWJŽt¢BAû.N¼9ç
+zÐÜŠ2‰e™åe¬qì'N<<é\±5�éÂoÍ2){paa ¯¯7Søä™V÷+±Êh&ZMŽ‚¡Ô~&º”<ÍFO,nEѯJÏÓ“o1•¸Es/âºÕN�YY9“z˜@n€2Vç!x,v*J�Bs¬¾¥u|Xˆ{@†ã‡¿Á.Ù‘­(ãt=d@^ÉÝö+Lißh?~¨Vÿyécº÷hè.Äœ3?Ψÿˆqh¿‹G©pÑ,ÞãHý†®ÞeÜòæÛìd÷Yø胛U¢Êã³FsÚµd�b°„âN_6¬”˜QS3*Ýr=6Ûø˜£v¼»‰6­è zLȺkš‹ÿê–ʦ劎ͥºÎIìP·Øs~(͊ݬ{Á’…]ƒÊ{ªŽ�|üÃ!kä¼Èzýöèವj£eмՕ5pþËûUægÚyÁH a´´ô�\¬¸àƾ¢]»aNMÀâç¡*ص¤F´=‚õ’x!ÔƒÀDBŸ¦–XµqæÛ
Û@ËÉl‘O-eÎþmþËãìwé5ÒK†Âg‹èýw^ù®\cÛe	|×UDÍ�F?xH
)“§Râ+‰§\Áú1]Ç©ŸN¿{ug§Ú+ë$÷Z¾Œg·È�š&¥©niòÈ龕ïÙ;�‹½i¤t�än¢›ì©V´bïK"ˆ[Öl]c1)9£àUW÷íÌ’Î’%߉Û%ý‘øfRr©sNí³J‰‡ÙT]�wxüQr t0sÌ=Eñ‰Ÿõ•­rÕƒhü—GUCfÞ²Ó-ùÃh¾,(Qc;Õqÿê
+A}ûÕ3§»K•QÙc~)}\vÏ.š}V¾½·ƒ†
+…�( �E‹>¯{¸ÝÖ“Òt&XHÍ�é�žY¼
i˜=åQoÕ÷."82±äaÚ‚ˆ÷/Š:À2´§çjZ„l|7¡ÑÖåÚmˆÅ¡{maà§K=wÜ.’§Â{?W±™’<­CBí´ô;žÏ9²+èͧØ*ø²à	ùO¹’½�{2é¤;_Ó_°;;œ
õ¶Ü´Ž>Ž<¹…sqÅó†6q.ÞξÎ�>”Î�Pq
+_¶�•&R‹dú.Ÿ-µ‘]a½ )‹¤zÎSš˜õrºo8<‡swú”cÁäàï"§5ÈBJ;ÃtÉk~Ñ ‰ÆyœSv<>ŒÆKØ!:9üv8î8IžŸªI«H5ésG¤éu˜üOÊ å`6wY䀅¬IfFzéêÈ‹5ñF•X@ å0¬û0°ª7n°ºXúÚêEl4AZQV�º¨HϬÈ?
 1 zz&Ó®
(	dË>}ú͵"Ç�TZZ}”­'ÂSHÞ¿}ÿ�~ró¾âDZÀž‰Ò¤GxT<)´ÑÂRØb22ÀÈžì.ó›?Û¤jðêv•gªh©ÛøƒÑ½’ÍùÜ�…ÌŠãRï|ÈHŒ‹šãL“ö™ûðŸ_ªˆŠk/;¯æØM<±\ƒË;Œos=æ¨O®[2¿s¤\L3…I~jõFƒèkåAdßûhÂïמ<®Âq!넾�fâˆÙeµð±›#î´#¨H0x΄²Vb&Î-©SpÑ2Hæ|Mü'ùlK¢2
Ÿö¢x°I±gaa‹ æIõ»Ä„WA¡‹ƒy_?)S<|·_øu}Îr½ÖÿbwŽ(j»§cx�cÚLRLåŽÌ6{úN—7ïA’f;刑½‡ðhýÞ~ÅÊÈÖ—Ëu£xÃcuQÑ™&Í;šŸ=îF$ݯ´èŽ\°ÌÕüÐf ÅDœPÀ§�)ñj5ªn²ˆé(±:c€îûÕìœ#aà@µj�­ñÊg—ÃtšGBYù¹-ûbŽ*oÇÝfÏ·ík×kav�øå»2 `j’¾orîýÝž\å™?@]
'Ä—%¼£ôxå;ž¾Ê¾'E>7‘Üí��a3±J•aªõSQ¢mnE(ÿ7AVOð!Ï›TæšXCI2}‹r£%�„q…XR¼uºCÞ˜¿»ãëµ9Œó7¶$³ªZRYs'ËŸOl=	ÏÚ:šL
+5^ §©ô,Ä“tBz°æ§™@n¯~‡ÐÂ)?ös&_¥3àr‘À<:oó±Ms]-ˆ¼Ä2Êþ|«‚Æ×Hç¤TmÈž¥è4ü-ìÇÖ�›ì™A¨\FÅY'ÿ÷í8ÒâgûXf£L{¸¯íÔö‡ÂD�—¾gG^œñîT¦ïGŠ’y¿,„“ÝGD	åÄZuÓUwÈŠ™E3¬$«îs…ÌÚßÜÊ­«På»·tÈLTç¡BO1Â’^ágW
1]æ€_ú{¶k}íS¾âÕg¸ja¥Ïã�õk={5ü3k„-Ã-d¹%ܨíW<ëXúaÒ¬è·m’Ndaz¥¶a?{¸ö%ØôxpŠŒ[Ø^¦›²*F¹΀¶²‰®.¹Žè>/ŒK.M:¸QXš"á)$<4šmÕ%•S>ÕþfÏ0ä•£+…'ÌÕÿ(PäJ–ÈøaÉl‘—{KãCæª)’Á"Õ%8ŸK…<Eêûˆ%õ=œÒõ1.î½ÂñWQéÂ…Ó®—Ûö?ts¶ï‚ž«^ pØèò°î˜Uóßõ:è&°áK¼¶[g¯3ïò©”U0÷�ûi%­X4Ó;LYŸLÎ7¦ï¹)u¾Cü6£±ý¥ŸKòæ3Û2¼¾Ì83¶ÖÚbÞ€L;/ûdî5¡£]èýJo¯ù¨œØ{Ž]3òõ�&ƒn_	ñí*üÀVB²É[/»Ü#RÞ3¿¼w:͸¡ˆŒ–Ui½énrStžK©Æ4§£ûý�cJãçˆØú/|dB"-ÚÜ©AÅÙ¢&ÀŸœ8à>Pîg5|lvºSë]‹©Œ»ëõe~É^ç­©;÷¿–L)©*—|Ž¹ÑuÅŒÕõ'.ОÞc�wf¨ëžöé�ÛÔ³½u§7ö–û…l!i"ÍÚz³Ÿ?ǓɧØdrݬ[H—¯.Æ0…+�ƒÃûÔI!ï轨”IJìÒk›Wnºw2BαñcÜß0½"ïXÎ$eã¨}w–Uü
ovÙñ躟y-´^2öt¿©£Ç£i€:öU¼Zyx¶Z»(%¾ŒBóÙîG�—ºn‹Á¦µkáϬ"Q†·ØžV]m< §¯°ú�Xh‚QqpŸlQÇî6<äzoWnùú%þxèknÀ$Šs#ñ„¢r.>O4,V~hz‹YÓ<¡PŒ+Oôˆ_Ô�›°>aO]ü†“€ÕÿYü%Ð_Ê¥Yà+c
9½˜œƒ)@c]ÈH´ J¬�õº€Ü¥54e]ùæ‰Ø§g9²ô(°<ú]×ÎGЙ�6ÁC
+‘|l>Jþ+6ƒƒƒ‹nà\FRË‹†ôf+ás/7?Ä“-æñ?îµÁ3\zXdÎ…S¯+ún5FloÒf¯½Ô!·"eÉän¤žßå'6ñ|õ2´§¸ó¼r‹ÞØës�˜ŠåŸXÌ'‹&‚,—ÃOÅ—=]Jé°Àµ¢Ó±³©d6)îX}õ…þ'ÄMN;Ǭå=ºd•i4+ãäÝ.SJYìš×¬5Û¤d[ÚŽ¬Ëº#z?uv¬„êZó™ˆWÙ‡øeRƒzäלK‰¤Wóôüo²vÖ[?vêí[íŒÏ.IþÔÂ)–%§ì(oC'ñõ2àôÌËé“/ׄHÊj`h!»âÂFÌ)ÁŠü­sÓ$—�„eïeÜuÈ8YCœã®qÀ„h‚{ð#´íœÏT,͉�ÞKa⦒-ÆT3¦×¯uΖ–¾¤¨ècW„R%•×‘Æ,&èÏ᧽�WǶ“¾#ÊöáèìÕ›Išý)2Ñ.�«ÛÝKïq^½7Â6rêZÉ*ªM­xÇ·x(#ÆX-Š¤?×Í6„®}{¡ó
�=´õ‰™ÍOÊZ�ñÚ=÷œÑΧ�ròhÅ]®¾O’åß‹ìXp,Ò}š•xÿyR@…W¦/¤ïFh7�óžžk®´7€€—�س>sÕ£YýqånüSéçÇÞãŒïÎ÷–æ¶b\øÕõ(ñ«—~šŽ”^Ç�è
K©	Ñú%ÈUyTðà/,I2‹àO°ñ¸´ã+~¹Œ³nDN|Ý_¶×°*…-�Õžláîs¹ë4D,$5¸G|Âbd�¬ø²)zæÓ˜À*ÁÖzž;£ØT+½ÖžÑÙ½ì§:··>zA~¤üÈrâTjæ¾ëêä“Æl¬Ó°ÚØeMÇ–Ÿ=hÝÿåÄ
†£þ¤3gõéžëý[cŸ\º#åèeYŸh¼£ÑÜ0TàÓ¿×ÈáÕñð¨aŸwp®{Úï
,­èõÏŸœþßm¢²:’«¤M” *ò®bêd¾Ñ
©�÷JiËzÑ(oh,��ÚÓkÂ~l+ÝìË[÷ŸíïØz9->v’0Û
ò^3d¶´m®gOøq>ÛË›Èß"xùè9‚5,MTËâ™ä7†.ö"	4*xúÐ|€n»=ã�RípVS±6U�!ÆS씬313Eo"PûŠïÛ…½íh�åN\·õyìÇXÊõV,àŒCO
+ùÜãÔxµŒy9h=Ëb;ÒÀªù|— ëPÃ7æòÓZZêÃö½Ã%NÜ$…h3MãMóÜ·¸Y#Ø̾z ¢�Û^�+ÍÞFqw0¯Þ(‹z£�ÜÕ¨`iUÖÉ;2éøX	4‘`/žÁUý“µÞ.[C ÐÓoËhm½ˆ„DiZ0+ÑNv•¬” %Û9·Î!=Õùð#"¢\<.±=þ‡à9E);/½¿Mnã÷·råmuR?üRµ©à;0�×̪׾îgéwà:ºåÇ›WÐ'9´'C,Ž¦uk4Z©2ìW”ÇmÏ®wî÷Tê¡Ø¶>Ä	|;|†&)€öq=
+3Å5”×7 Žhý,ò3ûµ!~<±Î…XxqÛû”?VcDÝ”5�üÛÕ׺LšpŸèï’&€¯�6ΖÖðó‰N>R–W‘ìQo¤œÝ)¤
\nL×½EsL6b¢K}}¢MÇ7sñt-é3�,xm×'Û,evËÓ(;Žó=d¶.±…y{’±Ós¢�eU&òŸ�-œKÃ"ç¦û¬~bÕ¨�“¹trðáŠzSn}) ¢}3ÓA£[\¬ßkQ«åòÃÚ÷+¸°¢xÐÈqy1C·ÍCæ‘|ÌqQ’Óéª|_õöZåÏ$ØÕuo{¦tYxÕ¥ãâ` ÉDÙl¤Í-WŽ”pæa�ÝZfW
Iz÷	w<´g¢§.ßh�à¬ùômY‡¸Ë¸OJF´Iø.­²ìôEÙMrìó.�¡�½£‘=”�ï>F*ö^ǼùÞ‹]ò˜2�¼û´ôU&lGs~³™Ÿ!—I<1Ü5Ùâ©ÎÄ—’Ù:q‘·ÆiúyîÕy:£ÏïvVgô†:ìÅÎñ·¤§´'€?§wôóµøŒ¾ò»1âóÑá6^Yíh4ï
+Y�1"«ª€SÛl­_?»Ý<
·@âfÈíÁ{�88./,ÆH(
Y–Ûlîú,×Ë2ðÏÙª}^¦2õ{~¬Œe->VöÞ=rŸÞ‰î°#d^Ç<U(ñlï¾:¯£ìÖÛ€¥o㯛ȫ‡4Tðœ]ϘÅRß©�³5¾ìX]Ì,/ºÕM< p�	"jÄi´¹"°v¿¸µ›‹d÷!œc½ó²H?ÂÄ/Ó‚––jßsš&Õ‹Êp¥3.èçáÅ
:ù
ÓN©|F,ÜfkÂT÷*0.²’ôƒSCÔ\ÀlsÕ™æ�/µŸêölÓ|kL”TpãdÛº’²ò
|¹ÑS³Êì¬' +Zq��mR£ªÖ¾–ß–Þ±wU–Ç¢5÷½§(ƪße]°zÿŒ|…͵جκˆºzdù€r$ëà»
wLE<Ç,äÙ€Yº2ï¬íØ•£ÅjÖl#Ò0Ók8AP”Æqó=—0õ½ CDÐÉG
ÅAþÈáîÅìëµÇßûà³?ÃØCºƒ?D4Ë舿�‰p}ܵ?5¦$칎å)5TÔÖ#<Ìë‡ xdüBB¤…·b=X¸×XŒ²¼¬ŒÂõkÞä
!dC3G!ÿ+’>�nªîF=JÇÜ‘Þ·ãÛú1õÄW¬,Dd…ìŠ&yo%—�Séo\¦…ÂÅ™Ÿï‹²K„Òæ¢×{Ò-ædüêë[¶cÒ©åÒ¯œF!Z'›|w¿�êêô�7ÚÖm™#H;”•N}lhœN›€ÕîÂ0u FžÂ‹w¼ð£.—Ûß›î“>Àµ­äF2ñ»·É@¦\[ð³Ø÷¾�Ë>×Âk#YßkPxX‡£Æ¿h¬¿�o¸qô1‚\XoúXaM±Éµk<`ÃÓõÍè1ø\°6ê28Ál“[ ¾N6ˆÖ­P5È
ýÀ„�Kòø ã(‘ÞÞ#»Ýˆ1¯*±ÇWû”v™KV§’Å
'ºÓ²läéñFõðàöäÁKVØãJ`z#4%Me
…c%‚V‘ûH§!Ô"±PgLîðiúKŒ6é¹RÚíq§Å/D½/í³QcŸ¿Õäc
}j€\jßoßÍ—×/ÛtƒÅ¾�,˜«øüÀµ¶¯ãÝI¥ÄÓk‘,:Ú+™QMœ]
µ²ñž{þDÇ­£CGgÖ¡HhÁ½Õpd8•ÅI}}ý<â–jûí–ã(lf¥¨«Ân’óoµPAE‰A›Ä\>»!süçÃ/ÊöJf¹$õª½;êþ#Ïi‹–‰FŠÖcBÎbk¸ô5
¨*æ"XÓqô[Ìa?¼ g1÷úÏ+Ø0Ÿ2ˆ}¾`Q¼c&1¥R¸ýÔ~j³ÆjÝZ®*ÕÝšbt:ETaˆÃ³}uŒ·¿�p@Í™„:–a'QÇ¿Ä–Žø5šË9fõS¦?7ì_�ª }sÓù9qÐ:~ÊdýªcgÁ¢ÐÒº²©ofMLO*†%´Ôhm@uaÓÈSÿRÓˆ|"|»Øöz^lb¿­#Þ�v;n{v@m9?mÉÚôò~!çªmêSª¯ë‘ÿYm1ÑKè”øêñÁµ»ôB²™F�SI±ìžF§f)ÉÂÃy�yføü
,ôXùU\‰Tª=Ó†àSÿ
+¢	å
)†UÇÚø“€jó“ áðkj¹Ë±Ã…M2Ò>­Ì#§3W²²O½×i¥ìù–e-=ÑL·
+­­¡At¬‚že/KØ–­§óÔä®åÏk®†L5‡×ÎÌ`§¤ãx	
|'»ˆ>_º	ÿƒrïÎ†šÑ�g"~s/ÑÀå“k_Ûƒ‘G›83ï¼=´lVó;/d–+ç\šÂ7B‹¤Cv{pKŸ;Ì%™2¸õœ
”××3‰¼GèñqQ±S¥¤ðÊÎW­[f¶=æ$îR2–yEîiÛ$¯ît§Û:™Àôˆñú–ÏD7éµïÑm
+Ful€´2¶)K;®óÄséœìò¡~¢Îˆ<Cf´Øm‘IÀê€Þg‰¾\äúm­¦ˆç�Þ7%Ù-¦ÅÁõ¥i0
+™[¶Lí™ûÔ´ÂÉ‘!§­;3Û¦–ø^Š�•‰“ëN
¹HÕN#oÆÜŽú-=ÈÊžPЫu|MHR×õkBP¥Ÿ^¢P¬M[NH�B@šÞ‰0¦éhRþ¬äE9èmê(ˈÀ0"o1\8–®Hï©ð†â¤Jêsw ˜´‡¤5³%¡LJþÁÑ’Å‘ŒåþRkž¯UµsÜþ®ãÑò‚ƒ]žMrŠ~Ы[
+u^¥Ìë:ò<ðéwÀN‚A¼£ß
¯Ó
ó4zUW‘$Áo‰ÏÏ×ÔñÇ
E+Û~‹tâó¡l×"4ëtZìl'Ó–$ËÑÕN¯œéS¥©Ë]öNà¾`=t­ìXÈ¥ei:Ÿ)WÛSl¸¯:º„hfü¸ÏÄ%½Ó7é¼ÓâÄê¤ÚÚµäBƒ½ðc‘s¿Á_*�õM	‘]Z‡½²ý=!âŸîÊÿ¶…ár
+endstream
+endobj
+7130 0 obj
+<<
+/Type /FontDescriptor
+/FontName /OAJWTE+CMSY7
+/Flags 4
+/FontBBox [-15 -951 1251 782]
+/Ascent 750
+/CapHeight 683
+/Descent -194
+/ItalicAngle -14
+/StemV 49
+/XHeight 431
+/CharSet (/arrowleft/backslash/logicaland)
+/FontFile 7129 0 R
+>>
+endobj
+7131 0 obj
+<<
+/Length1 1378
+/Length2 6060
+/Length3 0
+/Length 7008      
+/Filter /FlateDecode
+>>
+stream
+xÚ�uTÓû6-N�	et�N‘î�a€ŽmÀˆ
¶Ñ Ý)Ò J(!) "%-‚´„HHˆ„tóŸñ<Ïÿ÷¼ï9ï{vÎöýÜ÷u×ç¾®ï¸ØM„”a(;¸
+‰‰È
UõM,e€""â 1—)ëÿkp™ÃÑ
+)÷¿ªh8‹³©A°8œ>
+	Ôñp
ŠŠE¥äD¥åDD€b""²ÿ¢Ðr@5ˆ'Ô
uPH8À¥ŠróA#±¸2ÿzòBù€¢²²Ò‚¿Ã�Ê®p4
+Aõ!XG¸+®"â4AAp¬Ï?RðÊ;b±nrÂÂ^^^ ˆ+„B;(ð	½XG 1G{ÂaÀ_ïB\á&
¸€¦ŽÌ»	ÊëAÃ�8ƒ
+GbpH
Äšhë

ÜàÈ?`½?Aàß»
Š‚Dÿ�îoô¯Däï`Šruƒ }H =Â4ÐÐa½±‚@öqÁ pñOÂb‡üîÔP6BpþE#Ü°áòkDá_ip·¬Ž„©¢\]áH,ð«?5Å]»�ðŸÍ:#Q^H¿¿{fÿk˜‡›°áî
×VûÁ™ÿ±9À±@IY))	Y Ü÷†:
+ÿJoêãÿíýeÆMàç†rÚㆀ ìḀâ	bÑð¿ÿíøç	 *
+„! X Ü
�ü';Î·ÿsÆ-�ð‚EpÜŠüúüûÉG/
+éâóøïý
+kßÕÖRø3ñ¿}**(o Ÿ�¸PHVR(**#	”––ü3�!ñ·
‘ÿÄj#íQ@Ù?Ýâ®é_{þ%ï_qð
ÿ™ë.
+ÇZ8�÷?$·‘�â¾Dÿ¿©þ;äÿÆð_Yþ_$ÿï†4<\\~»yûÿ7Äáâó€#­'}NÈÿ†ZÀÿˆVCx¸þ·WÁ	Aé€#³�¨HDâ��Ñ@xÃa†,ÔñeþØÍ~IÍ�„¢0ˆ_ï\”ˆÈùpú‚:ãÞ/»à8ùü³®:Š‚ýÒ™˜¤‚FC|"8:‰áöí'Š$îý›É@a…Å…q3íQhÀ¯µŠ…!ÜÌŒ3nŽ¿œ€€z Ñ8¡ýæ
®ú¿Î¿U
‡{ဩqôv˜Ó«°¦£*ef/¡oI澶D'YvEIb¹'žù9ê]ÉÒqWy+¿Ñ—n8Y1<îÏÌ¿y4àmÝ–<›¦õ‹§Þµ¨²-”×{¼Ûæ¿C19J§G/Rm=2ºIñLæyl1~.Ý.¾R±\xÞ‚Y±’]º_P²¥1cã•s[Ö	b-Ù8¿b?XZS&P£Á¦Úfƒç±ˆ„C•¦8ÆcŸEpB懙™÷9Ý]éâ;ùº•Rå4Œ´¾:l¹}É=Œt�rtê1xÜ*’ª%©IìŒÏ]#¸g	!]S`Ù†wkXcΕø­G{õlDJÌà–É!X€Ýv׫ƒ«ÎÁÔ¢MQyÐä“™-�5Þ:’oJ€©ÿ^	ý„¦Ýy	{s–G
+=ª¤äyL·?÷7x7¶97+;À¢”„8Kå^ö–IÈŽfñUî8ôô®Þ'¡¨¢‰ˆU4¾7�¨Ì§âfnü™H/›juªîg$¹îs{ß
+twÏ»î%Ušy¤ž¼›»+Ë>Ô+nµnDäþÝqÒ+¾>ÍŠ·œ@d ‰ä0	²n¥OØ.qQsêc
=(*kKî^mæ~öícw‘õ�¸Ï§ìç	õ?aÎ}›}×Òîte·ªåËO•¼H§¿õ¹‰0 ƒÁöã|ªP âwß¡ŽÉka�wо•ë[îø÷……¡Óòä
G³Ïã(>Þ÷„\(YÆÎ\3{DÜQíèЮL]ÔÉ«B’sëOðêQÑAa·È0Ðw!,_«Ýñ#—$+÷æÏîà²ÀâÇ$±.y™Ma‚r±ý‘oµžíªöUÏõÞg­9\c®‰øV´	ú`Ö+@4€,
çÈÆR%L/Ò%¨¯S—€=¶‘Ïó�;æCŽ:²9ä
癄nÉÜÉš¼?\c–¥s¦ˆÁ!®l¶wRâÖ¡µ1ö�;ì×>r몘\Ѻuv®ˆVÚ>LŠM½®dln¥ÊUóÍnód7›l˜±ÚÔ† ©ÌyhÍ!½y"¡?“»Ämn7:Öxí_$²ÂV›ã�]³$£}‹¢œ
(™
+%侦0PHFHíƒHC¶T¤šéŒÆ¢Φˆ‚åOÝ¿²´QÆð$Ò|u
|ä"í#âÀYó=ø¶–Ù{бK/?WšˆÄˆ@¶(˜GÅË’@ÆAœÌÆöÁÙ@:UÐ&R7-ENŸÐš}#àNqV‡3:7ìG’á-9©,ýˬÖ+²áŸT;ÍYUç¬D@ŽèNÚ’4(• §iïéˆý€!�;]Dz–üóÊ¢¤×Þ»Cü|`ðÑ![ÇC}ÉC¤&ZËaZôô˜ñ…ÿ.˜1Ípf7t¥Ñ\s±Ÿ:$_ç3Uµ¼×JðO¤l¿“~†,ýÆ�N즀0ÏÈãØï‰N@écÒ‡yÔeSOØŠWÜ^®„é—’Hš}ôÄSˆFtàƒ‚Í”û%á ë†yÀ#Ýc<£"c)ô5«/1g=}ë¾Ý'¦{lò‘ü>ô6*“y¯½OûDŠïÝj"tç´jùxÄšÝ#�.*®-LüZâyU+(K”?‘ -	ýí<r6Œ'ä+¡m³Ôø Eß@k*õ¹µ¥ëOKcÅç>�Ylš@IW^2ÕÝé}»ñË¢ýºW`B-¹
M¦Ú‡@›³N‚ Ö@¼r=Ƭk{¥ÐÜ»£uq+äVÁ…¾Cd¢àÃÛKÁn¶«uw·ÜNKÝUÔ€Ô<“ÑGÓt<ñ‘³³©î%wÆ;×ú.kâ¥vÖ­}>¯êTg–ˆjµM¤h^mΈ�¿séÏ5c5Ê÷ F
Ú]蟡³ÚÌwßÅ+’Ìúm+Ïü‘)Uå‘ÔÍ({À›®;_ž>!:#\\äO\øF†p+×SG:�C–ÜS<±ÍCÛñ)×Ð&׳Lw9B'¨ËŽ›E–Rû™Î
+kõm¾qùÝt i)ΰ|Êø)¢"¾@˜Mc‘ó¦¯gnGíYÉ„ ÷+G¶î©Ð’è¸É!¦
÷K[`51€¹N÷”\yñ9ñCió¾±±®4•TïCÒ�‘^"}51©a–Ó¥B&Ÿ*Tæ¹Üð
¶È8*vµEàmWŽ�ݬv¼ÆLUƒµ†ûæ�s€Ui ²æîb,CƒÓ—ãà¥KóéÆÁ¬•Ûo\·¹_½ê¶Y�|�´
¹Ñ-Xz.ÉÝt]ŠýürâÑÚ�ÚDÅÁ©È‹ÃÉájËŸO©9»'{§+rwÔ輦ŒÏ‚{‚¬"!osi¿Ét.¶bŠ§åøŽâØŸ©K}”âxãÕ^ìÐôð(—3`ZêLÃ\LîÚ%cúN7¬““„/y~¤=”÷âšå6±—ÒBG‹¸#¸Ó,¥»¡ù*GDë^Ø
Y’4³Àך¿ÙÈ´úiØ"¼þÁ×
+èIoºòl{'¡W‘â�ͪhze@
çIIYU¹A;I�Ò
+Ta$I]ìúô¸v¶Ík㥞V�÷IzörWóE1W™
Z$@½™^ÂsZ{y+Š”“,�"xŽV#Ï�å
'Yëv/÷‰§Og¨ž,¸Ã½’ÃY–!™[q* )ê[‹ìd|Æœ¢ïr%¾F?­^‘.×~Ïã|déeÕò»7¾uì,Ó�ìôÏy†ÍÅ…¾»!L[…3‡.ÖØ„…0§E}ä]$Rõ4¼Å-æRȳãF/¦MS÷<O…gÚK3´›)òA=:E;uy�6q|ºYº«çô‰wuÓ‡€ÄŽ^‘fØ>ìÚÍ»õª1ý6¼é‰
V&g™ÍŒ3r-ª
‚R¥÷?
EG(:I6;ºŠ
ÊxÕÁ^ºzVßOÿYÌ0+Úýº¢žùŠÖnâZ5FðÕ!T:%ÂgÒ�‰fò0)ro¾Å(Íà)ï­Ø¾Š<ïƒXç6w³‘ô1Ôó' øéM“ß›ärùåArÿ›«Œëº÷†n¡ŠÝÂ7&b
+ªÇ ¾ÙS~Ô$d`¹ç!ÆEl©:ù{"ÝnPÑ|è•Ns]Bs¶lRÓòöe—ÐÎpË×/(µ	¨Nc£\^÷á�»:úzX'ø<Ö´.¥:4Ë›\auxòUOvô¾£¥»Â³@FïN¢›Â¹©«ùé_dr*Ko‘°+d-œì••šØ½2⡹Á­Ï`™m|ö
fqVQ³ÏÆœûcHé@x“š-Šàa·ûCŽâ{]B-šOâG°sO·?‰ÛÜx¨{µ²? 
+kÑ£`\^ÒèÝ™�ï�áðT­º…#löûù±É­hW´D‰·+\æ”—E¨CÙNÓ)ËæIR­O|¤Óç¨È“aÊ|8hц®m}GsäàAë¬Ø4åRPÏ8
I-­;^I ŸŸ)ÓCq€yhÛìâï¬â›(”ºM†¨/ÆÜ¢’Hþ<ÖtŸƒ|ûÉÂʶÖG©™3‡ò³¦'…·–†7"}ú“]æYP±Ï““äbë›ñ´ç¦ïd¡"KüaÅê'í?xâù“Ëlô(=3!N*5
½B–Z^,ã�tN ÜOZª%¤6#�<ò‘ zJ—ç:Û÷ñ;A­Çúé‘Ö+õ2¨µ°x&ᶋ&{Í}ljŖ¨¤ê\£ ¼rêD"º‹/¾…
+g}¯´Z“³
+ÀÈ’Ç�„5=DÓå1ª ‘L¥*³“¦j}gšþOÏvç"œj–ŒðTñêÜ�VÓ‘ÖsžU¶(‚ÁzÉay³–†áòaù[äƶùf¸?¼ó>Än9¹®æq]Ê¿ô(ö5ð�ú~vŠ­#�àÆ™6¼ Ž›š
ÉÀ|¾k®`ãµÝrÅ–½|‘»#_Í7?fÒ¥tüœ3åìä�wÏ—A4},•ï¸G•Ü#Í•Ö5�RüÊg;õÒßà�wIBŒuyÏYÖí§ú«;ˆyá:I
™•)]Û()ÏÒmeÌÂ2ÓøPšðËŽ†÷EµÌÆÞ½á†ÎJ›jr?é³ÜJåê…Á§¢Ç)ŒÈóT|{9õ¢JÜ4ÍbÒ‘ïÏ_ëOW÷çÔM7ä·ú<Oï¨<ENî¡‹Ø
ˆò¤og3¿æx(†ÍôîòÒØô­¾°Ë~SÑŒüõ�áæó„‘}|湉®®Ò=zS·Ñ±`ÆÇXZ’Q�jx_×@椂kCßÚ®{vµésW‹`Vý|õ›‡çKLš_)
æ�5-¶bÊò^w[‰€ær^�•£ZúW]�²^òc1öO"7ëhs®µ‡)dN‘¯,ÉSx�4=õg÷ìÁ3>7Ý\\¦Ó¸^4^aи’þ´ácC¥óÙøavM<µšÚ—š.Å7EµÏ<9Y	;öÁE“KsZ#–CLÖ¾†— D}h2o}êiÈ“±¤1HS–4mõ½®sâ—§âÕyñÊÔ¦ã�땶>érö(3
¯·‡)—_\‹hCG˜†€O3%èiXî3p NÎ=-UnÞ»=þã®S®g—3™\¸éât_!ÁõKú9#ë÷þÓä‹QŸÍBÅ+ûó�øþäó:Qù‹êÚ=u‚Y‡Âða_+5׺ðîò7µëÏ­ˆ¯Ö(t¥yäÝi’zã xu±¡AßÌ­«�I¨ô¹(ܵ@ƵàÕ…˜¬Ü)dÓo´º,pÏkpËR+¯j>¼69d6-/IœC²Q/EëlÆa‘0¥I¡kQ2xÄI€~Jò¥úIek¯‡ÛVwÿ�Št�RZ õŠ:iÍ©À䥄eÆçA!	k[Eüû´¸5òC'RŽG)�.^~©%†ƒ4¨:ßœ¼PÂ'pî}¥nÁrööƒóh2JêAô€	ö­�ÖmüƘÒýS\øtàQ1˜{±Y\”AÈ­Þ�VÕôÐê"È$lü£¡zC	 "5æ-|§Žý,/9y2¨ß_VFÂümÇŽÞËøèÂ$w
+Öp�ãÓúýûbÆg}�Ó·�ó§"JíG¼"ü�CQL/ÖZóŸŸÄ„�Xc,$lCÍ>ÈM\O¢ÍT„ÆDtT¥­ÍUfzH¡K”|—Ø>`°¥}æWÊX-㛨õ´õ˺A(èjoÍ}Rÿ2ì½B¡‡[†¯çD�ûµq˜«.F$­ºí¢è‘RQ}
+-×·)ˆ‰^ÒÙP¹™¿>7c¡P÷\Mèyo¢>Ô‡�~GºùÝUAH!™¥ÓµÇ‡ŸF¢{$›(«-Ô]ÇïrÖÉ™oZw
©dÀ:süÜ£äÚ•tUчÑL¥ž$Ê–IAyÒÍ×n]–�õ¤!èåmÛWì(
´zªB™’
+Þ€{M–‹­¢Ö™”�Î¥°‚ç;Š�gÌx-©¹r?I�’¢©6ïT]dýp�Ïg-èïKÞ,ï
’z)Í›­>å®×…ät‚»¸$W#"ZÇû�7tä@äÓ6‡‰±ü0õÒù¨�÷µÉâTÂ9ª~L‰ŠÎØ£²G3ɱ[$ß°m{�›>sJ½ù|hµ«Ò,k‰›Ø½¦7pÃ=>ú®þ¼eév¤Ï؇8Æw–¬<W¥÷ßQ¿ót3¸btÈ°†ø¼ü<°Ñc³úX¥¼?ý¶Fô9£ÊâAUËÛûŸbò%l9×go”°Wod—«4©³�BÉ2¡!+Sšî}y‡ž¡WlÆÖt>Öâï—¤µÚô�¨Fw�祹5Vb<àþtÃ9Øù!][Š0;ñÚXò¾h”3Y\Üù^ô“í^s.üª—€ã‰–ûâ$Kû"Züj�HŠö>€¤(|9H0NüCÓl¼ïGÊã‚š8´šN=Bv}*‰©Gª´ž¤šÜ»ZÁ;&ÆvÝü0,bp™Ì1~ÿB	›Ê¥¯E]žÂ|ÁlÖ�d,Ê8›ª¾Húaûð9¨³©&ïàÇaT�ä\M�^ÔÎãzöd¼Øé\¹#.Ël;µ‘³€MI0À˜=˜¢Â¯u†ÎOй;\¯C¬±vKçÀ\ßBŒ˜_gI9ÑÞÿ¦ÜíNjº~þ“Äšâ<Fµ‘ABV뇠�`Ù	µg•àNÆ4èkÎw,ÄüÇ»ÜãÀ‡^ýü¤÷AzVï*ñG´GóFÔzèKér~4E…ÉÏB'²ëÚ‰sû#÷^ä
-GV¶ÛÏ÷ùOa6êùQ)
™Ky_¼l(ëh¦®yT–=+®ÎÈ+X•½ŸÙPVÜÒøXÛ�Á²®(�Ò¿ÿÞ’"[(w4K~	›-­<Á‰¦ýÜ|gbKÉKÚ
ym®kÂìMuoÀ¬ºîê@¯ñÒ«sŠn.à-„v#ëêÓ–nÆÇwG‚'
cz¦ëdRWl?ª¾íÝã]�‡÷dÚq`S	?l¯•(ò¸æóÀ±.Äêâ^]­z±Òâ¡0½V]g�¤Ýq‚:ÏŸ
R¤Å{'z6øµ„)βÙš¸˜«¤
ø•²Ê	<Æá#‚É�Ÿ;§wÊæ=/¿��ÜÊŸ :îçpXÉ™fànõx‚)¶ÔÆD%¶ÆK¢yM69„¡¦·HT˧_³öÞÙ—iï2¸•né:êÉ ™ÂYD¶—
ðPŽ>[Sè/ ô[½Y«ü»{Ú”u
+E¶ÝeAkQ”¤Õdû‚Äþ…/øH—ÛìÌÛßÖ~×ÖëôÐü!מìÊ—PŒ_Ðt}
+ÈNÁó­ÛlÒÛ¾sA³é•Bd8³µvÅN¹i·®ˆ/óšRè½fv”_uí«w§Ýâ&†ó“û²æNí3”àyõ=–ŒŠŠ@ˆÌ;Ë“ŽÇñÃ×^Ü�¡%ªÔ‘ÿé×~r£[<ïÖ¼é9»ä�0(åä¶òwûëu�W0†>ùÉEmv3TC£*|,ɺ 9í•a£¸ŠÛ<¡ß0#ìUÎÛÞ/å_?«›ž0¸ÿùÿŒçkXíÆò‡Í�=…kÁ=›ÑŒüœ¢"Ò„wÔ«à)qJ�[Œ¾	{½°ü­qÛꛜ±:Uù-O˜èËüí7†¤Þþï󎱮¯Ú׺zŒÍ¾˜½«{ç	Ò#}QyH7–'i¥òø†=Áþysoä$ê{9'‡îìª
+�[\‹šºGÁXš–™ëa˜‹ë¹îGPrùÆÙŒ|×Ûô’HézÊ{G
þLÑi¨Î™ÅLç“=è5J:#ü›ûͼæ¡;Auƒ�<_“‡ikéÑœö[+3Qx¼ÜN"•¿m¾-”}æË+�ò©"-פæóöþœû(ÎÜ!Hç<VÁÌn>]ríêk˜®"¬öŸ»g¨égW„2ò}—Ü3cy zó(e‡l玔©ë·~7»Ñt}­�<ïð*ÿ�r§†øÑÕüÖÜŠbòUpåq™ÇîK–‡¶#…l+‰sräwEö.œ¬(·…o¾¿&¢Ÿ1aí†á%TX£¤Ïö›Th4¼Ð+'´¾�ؽôæ´ˆê/iD9,”*RvL\Ùå‹iH‹ó,5d¥åçyÑH:ähг%­)Æë™>¢)q÷’+ÃãiÝ1RîŽw0mÙžk”ªd¡«ðÔ^jµ¸™êÓªmÚn»ň[éDz½æ* k&€Sç}iBóF|]¶Êê£ý�}ƒÈ–jNc³<ú¦¸Á1—ÚôŠÿàenŽAºDGr6Wk
eIpÇSû¯jyÌÏ'(†ÉôLÈM:JúÆgOë§éÓ~hÿ¸ðR�Yß™™¾ŒQ*ÂÏ<®&X¸²ßNœJ×n«ß>®’6'}AæŸÂÎ5~~êäÒ±jé‡wʲŒR¸´5Ë¡M´Ÿñ›“<ƒk¦Û.\o—½Ô¡Ïúô=6MhÂnCÑ¥³PŠAÓêIáãÔ€*ùÜÎ/u.¾˜ñ2ÆÒÞ‰ÆÙl�»`£‹ëÀðc9
wÐO!À
+­M‹·lÈK¯I+øã2ùWÜ&ößm¯”O<ëw°$Ö)áp£H�Ç@ýÇ*IzO@Y…i³c͘Ï!øq×Ò!³ß¥F’çÚé+¿Íz6Ô$LOþ?Äþ™¤
+endstream
+endobj
+7132 0 obj
+<<
+/Type /FontDescriptor
+/FontName /FRNIHB+CMSY8
+/Flags 4
+/FontBBox [-30 -955 1185 779]
+/Ascent 750
+/CapHeight 683
+/Descent -194
+/ItalicAngle -14
+/StemV 46
+/XHeight 431
+/CharSet (/asteriskmath)
+/FontFile 7131 0 R
+>>
+endobj
+7133 0 obj
+<<
+/Length1 1612
+/Length2 18382
+/Length3 0
+/Length 19224     
+/Filter /FlateDecode
+>>
+stream
+xÚ¬·ct¥]°.wlsŶ:é ã¤c'cŶmÛ¶mÛîضíÜþ¾}ÎÙgì{îŸs÷�5Æ;«j>õT=5çX“œXN‘^ÀÐZ(jmå@ÏÌÀÄ
�1µÔw´—¶¶’¢W;þÙaÉÉ…ì€z¦ÖVÂz@n€*Ð 4°°˜¹¸¸`É
BÖ6®v¦Æ&*eUjZZºÿ´üÐwýŸž¿;íM�­?œ€Ö6–@+‡¿ÿ×�@€ƒ	`dj
ÉÊ©KȈ
¨Äd”
b@+ �ž@ÎQßÂÔ ej´²RŒ¬íÿ±X[šþSš=Ã_,
{€ÀÞh`úwÐÅhó�‹`´³4µ·ÿû
0µÛéY9üí�ƒ5ÀÔÊÀÂÑðíFÖÿ²±³þaù×÷LÎÚÞÁÞÀÎÔÆ
ð7«œ°èðt0Ñsø'·½é_7ÀÚèo¤¡µ�ã?%ýëûó×ë gjepº8ü“K04µ·±Ðsý›û/˜��é¿4íM­Œÿ“
Àh¬ggh
´·ÿóûŸîüg�€ÿ­z=×w[ÿõ¿8˜:Ø-Œ`™Yþæ4pø›ÛØÔ
+–ñŸA‘°2²03ý‡ÝÐÑæúœ€vÿ6ˆêŸ™¡þKBÏÐÚÊÂ`4‚e”±vø›@õ§2ßÈÿ
ÿ·üß"ïÿ?qÿ«FÿÛ!þÿ{žÿ+´¨£……Œžåß
ø�ð÷†±H
þ¹c,ôìþ_áz–¦®ÿ‡
ÿ5Pø$ÿ?p$ôþ6CÀÊø¯ LLÿa4µ5u
Ê™:˜Œô,þvê_»²•!ÐÎÂÔ
+øWÑ›	 gfbú/>%Ss«ZÏþ. •á%ÿW¤©3J	J«þV¦ý¯wê¿QrµwPrµùKì”"mmø¿ÿ`
+Z»Üéÿž@zVNÇß„ß™™=ÿÙþ…aþϵ´žƒ�©@ãoÉLÌÿþ?~ÿ¹Òú/0"VÖ†ÿÌŠ¢ƒž•áßñú_†ÜŽvvUý÷Äÿ-ø®ÿt Ðh»²hmð#À,%=Õ¡+{hBX£¯‡|(Ц¸^© ϧʺÛ;%d›«\÷½:�¡aŠû³ÕuáÔæcÿÍÁH¦ewð2ß“”º7eƒ¢�“öÀ�Q»!õL5Âýj^jâ7“ÊÁ΄¼‚vÑ;ÁT;«ôÕµ©Sž:Ù£
¢—Ar]4FrjMþéEüñÓ#åÀèðÐ`÷
dï>mV4ù=,¯ÄSâW]»ûzƒOÈW'Nç�òþÈàg	-ž#DWêƒ�îC!~œyMfØ䩳òÞY¥ŠÙ˜,£…¹>D‹¢�ÔS}
L7“�«˜rvêíæz;t­-}Hºèfc^Žõƒ(>—’}—p¶=«F¡žÅ0Ž]BÒ�Ÿý7m$âÜçŽm‘YÞ=« ÕÐÎú¢i>0w¥,·wRvk¬zG =ÀïEÌ�%bµ�[ÝY1Ô󌕒1Ïøë´Rt0A²@v[NM8Ccßnh	—N|�dfC(5%Ñ<%é«£½Ù»·ÉX‡PÐ?]’šÃkŽì4KG~œ�-s[�v5Ülk+‡Ðe—¿øJJz@­L	í`!å´%{=\çÝ‘›0$gœÑó^
oÈ“ð›ÜàBl2ðûż@÷eüº€® þÊÕá8Ë2nÁ΀è™v_шò¾p2óonÿYÏP±ç)ú8üÔj
½ ¼Ñîô4ÖÏ+ÛŒDÞ�
¡7…ß±¥üH§‡Rì�^ƒyû¥$	yaÂØ«Ø�Ê·ñ°¾…#œP‚_]&Ü[¶`ÀkÛ@~\÷¾7ɬ’O^@ËæÀ«fY¦¿Hy®f¯»íì}À®!P_	}`Á Õøì7Ÿeÿp¸Ÿ[®«Â?µš
+ÙŠUñk˾<%OÃTÃúm„ÇÑsT†Wv&±¸pi¤m‘ñ×yâåœTë�¦‡§½¾; ïç`½$ü(í/9Qöe0÷µ¯h×Ö™¹Š›lÞúͲÍ4(2«÷u#5%&…nÌQ`f„%sW r?(Ñ´d¹'W
+'U7%u!V�n¸	b«Ôö´½hè”Å’Ur¤4
+kûN·ÉÈù»È(ˆ2r’Qòn#ä.ÿ0‹@t­ž$¸1nõ¢_JjòÓgþC4C{³~»ÖBñ’+ßca|E×Sø~L®"
v5E·’4Ø›Û
+¥j+bñSšy,e:dC)ª¬3ækžyìáÅQÑãÆk;uXè�¾PTÍÚåÇ
+Da`ÚZ>9o1Á#‹†ß[r»bÍnP¾óõx¦'ªdu„;è
+uµözÂ
+|Ûвz$Nn‘qÈæ©.€5c!�ŸšO\$	gMyëDŽÍº½ð(`u’‹9÷Áww²óhFÑ‚aø,ò8uãÄújBÎÈ«×ÚŽ‚ˬÍë
æYÓÿ	æñžüòݯÈLêy©vׇgºwô�¦3‡ŸUŒΛîR­2ã
+�EGm·Ë¢­‹4ð¨OæùAÕû”áj"Ã"cnkTgZëÐ52}÷C-£ÿÏêMy‘ÿo’2Fõç?AzpŸñf�®‚‚'§‘…
fÁš^ôâUzºŠ¤’†UŠ…öq˜ãÍBëcAHq?�
+“&ÆýkG;.êŸþ <Ì-†ú}‚Õ{O×�|ú$B¡,zGW2ó¡\6LEºBØ«üêôànúH“½…xÑÌ#˜/Ș¢Þ�MóÎÉ€³ã-ð.zÄAª «8È·w Á˜OÅôyóPÐ51càªj6h§oM{ÌBÔÕ¬w½â:·˜ª )i„Šb~w6ÕXç”õËŠh�ë{ö'ìj'‡k£ré6
r´³Z;—«TëýÅ’›®¨÷¶’/_þC
]"·vƒ„OöQ ƒÀg9çD¼M_àŸ‚ëœ�vâ’Çhxøð7f¼¨Hk±!wð­Q¸%Ö?F®†Ä¢«‘�×0¿µ/qUô	 k .ŠJM]fë4Àïÿj2u±–Eº¹ýcK©—ãÕRÖgÁ>”°3	¬ÁcÉcNûŽÅô*_bÍ6ï­XzC
>¡ê<†`³Q` u:CaØ°û
+^1Ru±a‰
Õ}`ÅfÉíÿ”Í~» °õå(Y©¾%¢ÆÀ]âe>¯J^7 ¨{(ßûŽ%·‚Þ¥)ûC•ê¾iL™Žì�}ž.ÉHß‹ºŒ"](QÕ�ÚKß‘R]ìA+�˹eúpBT¦ÐKb³<ç4Œ8cos•â`PÏuõ‰dyŸ»ASyp$Mž›,„||˞ўéäܘCâ›øËR²¤òˆ»ÐÜCX‰’YúwÉ«—"Qº‡�ae觪ßC0i���á»Gž´Û
=¸„ùá�拾ibHÛMÉWZS;ð"רLëâvÑråÕe
+ç:T©5™-Ͳ¢Ê#W�üJ�Õ5¦¸©´;Ý{MïMN‚”eí¥RÂrØüh™Å;ô�ß]jª¯g<äˆóÒZ_!üNÖk„¦md±:{_‰\Û†Éß@7rÃl¿´L	0ìÇኜKk‹èüßÚ½dk.áƒ'
ˆlEš‘g}º·ð¿W6
+„`£­%­-@ç@”—W¦	ÄoM¶EÒ‡$Ç—èa  s{Èï2…ÛVr´û†O%ųñËaÝ×ZüÂü¡…Îë›ÚúÕ2Zòu6žuö…µ÷²Æ3{yÒ˜D^ƒà¬˜¡•¦Ï5^Pøfb
+(oËt把v“Ã_¼m$ã3¤à@iüÃÁk¾BÛô•ÙrŸ_fYÐ;3¢·_²ßÀß[{\ªù¹7(Yg=/AÛ3¶ã5Ìâ&�Ùl—ZjúÏ�[†~XÖW‚°�'ãýZÀF.�ÚûŽT«¡lº%מ+bŒJx@ÓR¥"’Ò;�ç˜mÊ9¾{=[-ÄõãïC3¢%2 |ËŒÂPËòà—˜ÞÄ‚ÔJŒcsnÆ“‚I±ÐÖ&Wµ|çþ®Ô;­c"™¼
+’¿y…·]Õ.¨ÇË'룽JÓKì“V@Ï¿™'’ÀMªï¶ÝÛ/©m^+'ufœd•n�,»ñ¥L‹9¾7Zö%�.Lju=#éµ…yÝ<›¢õÒ”4#]õÕ=‹mG£œ«î±Ë"`ASoÁíW
bAÑ¢å@e«ø>W¤A’éNGY!˜þOäñB)—û®1_'Õ¼Ió6e`G;eŽªggÔäha¦øwzÿäsã@.ÇdQªVÂÃÚÞ·*ü¢®F˘"“µBÞëœû<µÜv„v…/
É$6vË›'1Fðh6†ÏO¼.+ƒ Ië_È¥2<™_´-ð‚Ythj‰uõƒ]FÜkxwYÌäû nºrƒó«}¿|%Š0-ž⟌Vl¬Ð
+ú„ìè=7·œ=´à6\ýÓ‘‹Æ[z,ªID?'†,¬ÛÊž)¡
+üýc—Ú`óÿhPú±½;^õîqYŽŠªkÜ}žŒ&f›W#Á$%X
’U'·RèS3Za©oCì’kul—~‚x)ƒ
+W³»±L²ì‰0èÎ÷³ΰ¼ƒ}……zHJj²§2X”…Œ™) 2¤`˼7fÑ+ÊæK	†7â¤FÅ®Çûí§håVeZ	D0ü€ääß5ÊâºHaúŠe\kÃãpÑŒn«P&¬aÃm¥}ÒsD¯3¿ÓФ¬G“v�Å,'ïÂÔA“ÝWr†¨‚þÌW‰�õ©ÿ°¸l\�’äϬÂ_¾ch#7rS‘)&Ûâ_ÜC¬‹¬dò/x 
§³¬3
s	®Ÿˆì¾J
+FRƒ³¿%9ÚH�@ô#ËPÝ´hîiK÷¤(<4¸ËNÓÕ'Ü—ŒN„ûx•¥Í/o,cæEºoæûŠÙÑÕäqw¯Ëéà<4¿�‹håÙ’±
uTÀ¿‰“jYF¬=tš{¯ÔÝуÑMç^±hèY�~Þ�'°}~©¹M÷ƒ¤s�èDÝ´âSÙ�Îþ—üɹ>ß8ŸãñŽËßí%G<A¹­¢ð§¿llw|2ý·P&Gðíjá/f7kž�ê HËI“c%–##J´)@ÊAgæô¥¸’b,™•«ÌÏ°µ³Bïþü6ìýàòÅ[3^hí‹ôç=Xç[j™/Æ(Þ+,q:%å
Ý·ÆÀuûólÕ5æ)ÿ£=U,™.ëðûÀƒÓ�ê_Q3i¯|N±v'Yq œs$häÛ]ÌùƇm5rS«GÀŒ‡"Ï%¬°�yQþùj_È_æ^Ó¨Ô+m°Æö#{e¸™‰Ö]§Y+ 7«µF�>>óŒ1é¿—Ë>R+àì?	×ÜXêR:Óc��ÓˆâMÛ�Æ·%é¸tPÔûò>JâlEKRƒÇÓLªñBúE”°b¢><øôH¬R�ä¹»]QA
PV«¢»_Þ‰˜Ñ,Ó"åÑ0û…—{››•_#h¬ß.$^©Zzæ�üò	FWŸR�T,žµGkò8z%ùD‰Êò
^Ý‘q
‚ãÄ÷¯¢9
+&†
*úOœéÑÁ£�ª&M»�Oþ{MÉjiƒÇ ÍŽéUÖìzð'ïIMÇCž9<‘¨w,%ì¿È©™Ç®$¯g[9Çiþii+’b¾Ø€�çcÌ<*ý±‰ñåsv ¼¶ÕnÖH^TLÛ%7y(J¸á_¯ÞA	sÈÿQøK®°è Ö�Ò<�PW|èƒÞ�Ï.5°QHok¨þó™Í³‰2°"ʦäAWUP‰?´WýŸ³¥Ä¢Â[ƒ|â£î]àÝ?NžZOTÌSŽ°XaZá<ýí^––‹šH¢Ê�J\ûÜgë7Q6T=è�Ua1/cÂàcFµ×zÆwä^”q§#˜ljO3ãbN
+älG4=§¨g”È1ºh€³ˆDÞüªÝ¬*THÄ9áÚ[1\zºP»Í£¬D™zKò4c{ˆõ»¿[÷­º‡¹c'dä§MìÛ¬w.ÃÙü æ¡V^	<°Š šèŒFñò5“GϽ¦I*Ä%é-61¿O¦XnâÓu+fY¾¼rÞ4Nÿ…—.§�±ßßO›�†07¹Æ²ÌÓ`­$éËÈñ$[ðSÑÛ?µ~,ƒ}S¼[F’àÐ’ƒò˾0O´­Ã©ÊÜøè#fDš7)ãŽp™±V{7ßvüq“UWƒ¾	É�ªŠ­ó\`N'ü“?35y’„<Ÿo¨ë
M ªºõ. ³ùn8ò`¾²¥W_½6ÖœZiytãxâþ¸Vz�›�¢ðŒ6Vãµ*¯íÉ¥(~Þaˆm]X‚㤸ÊÏ,ô�†S2‰+½[÷}ðI—µk鸞Ï 'ŒíœXƒ¥ÔDð»¬Y°+}_‘~½Ë<ÄÙ©,Qþk!J‚‰ˆ¿ �zY9èf'y#Ô:özHên>ç¹·;CSŸ®re¼=ùH?ÌðÅÜs°†™¶5ŒÔV“w·8T
|×Å­ðêgýŽGWä§Sþwœy?  �°F©²sÄÃñ›Ž@Ô–QekÜ$oãµ$vã¿Eh=6½€ÜgbWòÚEòÃd¯%¯ê/Ú\2èÆJÌß\gèáäh è¸Îß`Ñ̦¬º'1)ÉË㊆ؑ\„lë)Ë–0o¹Ü“2BÃ/B!iÕBßÐgkî˜ÈXÐ~sÕâò;ψùäÆŽ›S—d¸Wž3ý)mÀì'•;°îäD–S(i%riÒóU.¶†¢”~ïè>
¦8Ð>nð|lpB$¹ƒß^%j/U‘Zqø¦‰iÓÞ�O«�‘2›’[ÚB\ì+«evPê
+{xÂäÍ,¶)[€¤Òê˜@]±†XÙ%½Ÿ¾
ÒI,y‡L´“:
‰ÍcÖ.é±-7ÀŸ„è?uV­{Ýí4l÷	H|ô¿0.Gô7�I"§ +T�ÅåÄØɲ³çüÀÄÂ�.Öþð6/ÖSÅt#–Eé£j'B£iOÒ8Ã=S·sÚßéVÐûé”ïÕ¢þ²ˆiJî�£¬«fÞhŒÍŒ>ªdXŒåÐv|Æ|²Éƒ²
J&ë�¦ŠËLjT¼<… ¸Y‡4w�Øv‘Xúœh£h<Qƒl&X˜€Åž…8ä;ó[—¬“ús^ÐLÊÅÀƒãäfv?pèþÓ�X‰¤èf!ƒ)'õÅþ#�StÅ¿¦=Ó±L õÑ–ƒÉ©L�%œCýA½ð@L%v9ŠÕÄ€Üjž[ÕÝù¯2…Žjü —”xZd•ž	\tYQJfñ^â½Rß)~ƒ-ˆ&WD…[ù‡²Úóª¬ÎÁıÕsÓÕ9HmHá+îдo,òágs¼þëÀH¾+V½kÌså'”´Fš¨ËÑ‹KöCpŠ"Û”—"´²‚FæX¿^Ò$½ãrûn
ÍJhÀ‚LÚPûô‡­¤rës¬ÝBÆw5£jÁëçµF«È#—¨)Ðð¼îþ+ë¸,«ÍÙVXºÍ-»+9�™ÃÌ4<³0,ïÎè×·”
®G˜ÑŒ2� Î"&(u›´ŠjW¬¹ú��Ò1Q¬,ñˆxÓìgeóÄ°:>ùq®ƒ¯•TàÅâ+FòΑð'v¡í6m ñºc�ߘú÷tZ[VÎ~ä{´zï3n^}g\„È�¿LÚZL6;w€MýŠ¢r�Ä–£½7~+wõ4õ–eYV5àj�òªÅ9Ë!;rü•Ã�rõ›3RÄý�Y>^­‘dý±2™‚>í×ziå3~³ÕKd«� Xe�v¤\•Ÿ¾Þ³dWñ	W WV×U“ó»*	d')½ŒACÖ‡Yª[äÁ€Îö+s—ÒN$Ú°àLÖL„7þì;„ß®D¬*ç¨À®¯s5îV³\çiLÈ(|]
+E>f[á¯ZæY®Q²ú w,`ˆ”AâÔÌL‚
+:ùm1ç_ÉC„›¿t
ó5¶²*Șg
‘„ð¶	«ˆ±L(oS�)\Cs©†ÛðŽ�þ{í
ã·ÂÊÓ…cL,C&--ø(%CG2:ÉœBU›‘‘$i.i¹N�VჼòS©xöaž•]•È+ÖÖ^oÛµL¾ãœž»×ÂÖœ~ñ°lAiÁÃì=s÷ìQæùhfýÓÅVqä»h�´ïÈóG«Ù™ìÀzYRRðáE�|V‰Î•3™sÿïšB”ê5ö‰3h*…ØèZ”8Ø8‚©Sí8"ïD‡ê�·ïç£ka‰]++ðÉš‘‚ÏÛGj¸mBnÎÀ‚5)Ç_Y®Úï"·ŠÝêx¢ë-ñ¦PP»{6½c‰ð`õ^Ÿ-ð¶»õ®˜Õ°Åj\>©ú¦ÍØœ…Jµ¡ÛŒ÷©•~Û³¬°‹6hØÆ2ÞÖJ§
üô¹ˆ0…¾™R½¹o†ÓâN}š;¿�ÛØxËÆî{}Ù×ô÷™ÍŽ©ÑΨÙßڱØκf¼kó®L;îã…•lµ~+àãùVŒ¾8*€"«qZá7`J)LÈÆÑ÷f³	B³§By)�£ê¶ôÞú©uùNš–“e~…Qul¿FV?©'øÍä\�ó[•¢JL3$c…
?~>7EFç5*êþŽ°xý‘SÞù'G[7²]lô–g°çà}y›ºþKŽîa(­sAüÓ*+oò¿opŒ¦/þÅ>€;®`¢óÂÊ¢’ŸÉ|Ùµ	.ñsZÚnîé:WË™Û9>넾Oò•
+™â…£üur⛌t`¤*µÁ7ìì­?åúÿ=äˆ*‹£0œÞË?õSÁlåã+j‰Æ~}Ñ"β	Š ÊÒˆÛ/Lp„>Í?íÙ±X1ÚÄwzÞÏŒ%:'á2øò‘ahïy¡æXØ=ÿ/r=ô²°½g¢œ|Î#Èo×19pú©‰êj¥„Ë—U¹èøJ[*R+iafdê�!RæA‘HU©e4¸º½Uʾb�€ŠÉÀ“€˜Zd\éµo¡_ÔîžäØI%„3hB&QÛ…,PK¤)Uô§‡‘1ÅèÏ5Ê”U$f”þ¶~÷r™5®˜€CG!Pùàì©Â}”±ˆ¥U]§ìàÌYC÷ÓÄUqØH—pìÁÊÁícÈÛ×`Ó·k`m>œµgN&ÎÁ3eav5‘~ï,cœ�˜x?�~ŸqGÀý”™I¨±ª§��I­ÜU0þù¹\�ÂIZM7æËñ#èr¸]«o‡tßHÕsŠ?~Èx2ÈI¯õ#Fצ“$!´ÛX™ˆ™Ro¬v*hi¥}áØÕ9&¥V
Æ—ž×»®Ÿu¾a�/¢N¸•2zH
ÒÏì#4;dŒÛÇ™ ÕMõ'c±æƒÎœùªCÖѨpÈ×ÃCVM¾K"ÉiàYj†Ñ�úìù°Ç'º³ì’y2%"Ӊƹ©Ù•ÊK,éš“ä�þò¼9ƒ"®<ƒ§�Ì&Ú
+®5ËË9JGJM†ôÀfÃâ¯~yä,íïEe#¿ý	««/ÁRàž—ßm�pAP
®&e]’Ð�Þ&,Ì
Q¨ÔÕöf=è†êN�5€
BEm¥Îoš§8�Ëæ¡Ff®×ÜÀ–¤•Äë�Œ
+«AHáÁN~ë³›®\­±Íz˜ˆPwÕm¾,nÿ�<BÑ5ÛBœ)*m—Ó¥Vå³iµl
±AÓ9&@Î÷~Õ£LºY›éªm5^!ûÖÿmŠh8a¾Ó¥é×^8¥œ’yg´�‡&µ!´ÃM»ÄK¾ï9
Zù÷Ú>õ„NÒäBû¯Ñ-…ßÒ2©*Ø…¾â&š	Yè=Áñ˜¤ú
…¶…ùAï	ãtƒO,Þq¦©Vdþ'·4¾¼õmß'ÁÍD¤Y•’x�ÒÖ»Q"þŸŒ{Rr]œíV‚-/Œ¦R²>š†¤ÐémÂzQ'ô19Ö™añ�P"ëF“Ø—®ÞïPóñQ+Ÿ®ê—«2:%
ý(W÷üÚ¹¹üu!ªî¶�°ÛÔ†71¸îr�%l{F\YUúŠâúhCR œd±ÁQOï†*Æ·ïî…†;
+ ⊀7­¯îÉx³øX]‘í�[ÕT†8['L‚‘¨Ðî‚“Ëε£ÌÀ€IÓT•îŸdð•;˜Cÿ�i@‡#]Õ�ãˆy~¢cŽ#U“ÈøÉG•™“[mjá¯j›Á�ô¡_L‡š$NÙõp“£¿€	¸´ˆN\?Ÿæ„F6}
�u·©ZýÃ]†ÄeDn:áºr½Î¶ƒ/‹hLo¾‘/HLú/·ø¤°ê‹•TÛ¤Û–ΤߦáÍG³·še ]GD‘ŠµÞ}à)WS÷Vv¢Þ�nϘµ¹’ 6>SX3¡5^(ØæTçr<~Þëô~c$è‡ðζ|�¨*ÆMG¯"$!á
+žîÿ®òjéÒ.õ¶¼�Ôcš}+^{G€BÀëÀ)è"ôÍoç$E-�3Eab³Û†¤ØèLC_¤ÉÿTžYbq‚k
Žkèn©âdLæS|
+é¹Y¹Ïàwò0¼«NcL*Øn<M¾‘÷˜©¼�Ï^cS1Æ %ÒŽLløÀV+Ï©ñ|rN9µÏíF:‘7(ÊPJ Ï*Û_åxÞ2í
­‘Ì?<Ì+‡râ=_ O¬#Pß{|{uÖ	a…•eï`A+lÙs–-éS™1>¬¸B•¤ç›‘2\��gf�3ñ©Ã¯`ß%húf^WËîoÈ1ãÝûs˜‰'&¿ÿõá}Âò…¯Ò6ÖÍ>4Îf˜Æ<ù5t+GžPÝY ˆˆ.¼öàC”>Êd¿J~ÖÝÀüe^Ó{ÛNyßfÎ!êÅ›PÁâ	Ÿ(ïcÓÅnâS¹Ýy$GR!cðEÊPIJ<é:6I«ºñJ;ÈvN힉UÅó“¡bØðº<Í`¹#8»©@†x4Â4èÍ<–
-ÂcÍÞ½D«ÀÇ,ÞÕôžÓ· +Þì¨åXÈ”Fƒ4߯E·Š’ä×l)…V‹ã8Ð{%¾qíet?78ËUUï†ÓO½úÎÞ2O¸ÁÙ{�×ÍÓþ‰ä–¢�èþ�Qsgn-RǺô(ˆún¨¡»Fl´Ûtõ–m¿T£§ÝþšcÓI]k:oáX…¤!üÜîb¤8¥Ê˜wž­†04-&Z:#9ô!Ü_®€·>÷‡4fµàXÛŽ]‚îÀxý'÷Ágô7=J	ûm¯^<Ø�qokæoƶËIh©€ ‚ÂÁH6ðÌ[¡›Æˆ™„»µQvLÖ¯H¯¢çè�œuK1\——¨Î¾Ò 4‰4ŸÏZ£‚ðæ†ȉò«ºŸª"7_Tq¸�9d¯Ûñʱ ÌØà�›Œ†×¶ÅåÍ¿í®nع.Ǧ•¾àF¼-í–‹§åìËžhÐÜêníwIc+	Î3«¢†»tâ­óÝ‚îÏ!4orǽÓtÏ°|(>ŠA èº++xÝþ`½t71tª‹¦’›žT­­ŸÜ•¿ž/.“«_‡DŠ?%˜z(µ@‚YœØË/‡]L‡°Lüy.ëIÁ ¬�§$‚ÎÈÒß0¾I5’ôë›ßªâÞóƒÖ7–eúa‘"nV‘)~‚]cw‡ùM/ò:…ôÒ�Á`xø�†'1_	U50)ˆ^n™-Éy
I”˜n/~Û¡Wºäí¤¾ÈPÆìÁçd –´3« 9q)2é‘D1âèV½)�ä7“ÿjzë`iqyI×ÏÜ÷RØ3Š_ÿ©›=Š|·†ÌX›‚¼¶ç~1{�3œ
ÀcÜãç}  ‰;‰vS³‚‹Çõp	âm«øØ×�Ñ÷]hû=1rQ÷«»wˆ™çz’º"vî�ƒ½ Oeí¹$}Eºâ*
+[óÅ,â¶Jà©$ó
—… o'žz-9¦¯‘ãÿþ5QÀf½éEÏl I�¥ôpúv«£dtˆ
c±l
¶?w^ä(js¸Pñº¿5îi¦?(î{ÎXâdtòi Ц£Aà¤Yê¸ä*�$¦~Ým
ï;ßh´¿ñy^€ä�½#=µÇ˜®Ì2IÿS£.WõÉ{düOû߶á0PªÈó¼ÝILtº8:¹�ÛC²¤ò
¡‘à¾
iº(¤YK‹.èÛ¹-*ßãÄ�Ôe[ïóè¦
+ÎsþX¡&Ö_WUL„÷%ƒd5Ζ-•8UT^¢ÅjjÈÞãOж–7x¯ê�ó~¶|òÒ)Måf‚çòåw‰ÂbA8Æù©5Ð@¬MV»Ï˜È
+«Þ:ˆz)€f¿£fß}:¼�.Úˆù`ho¾Q2{[BFjDô+’q˜R¶cL² ¨˜'
~ËD•àŽØ(щæ_�ø9{ÑðZ¹7ѾîÃûÁ›ß}ÆÙ&°F®jˆDÛiÍ/±²çJò÷™˜2´œ±¤¢âÃ-ÕêºÇÛ}�Ü{ÈñSÊ7*–tcÔD
ñ�ïJ­¨¹D£ŸP–Ãä¼²ÚÌs®û™D@èp ½41Ì”¹Î®ŠYþ<ûü²Ô.cªñn~ÊÞáôV²ƒØ	º)µAyKDœî¼ìýJ¥%ì0á¬î@ˆ×ïµ¥E‘lë‹uÌò¾ä÷­
y™~V-ôê?£Þ(œSúj•±—剌ø�b™—u´û*…ëPâbƯŠ¡ÃÞéÀµÐtŽHú
T=º§¢¶þ€ß›”gšÑ†.CÕïÄ%Ÿ¡]®nFýü}²}"@Nþ¢m挙�W
î9…³è†a¡áË{ÚÚìÒþñÄÔ	ÜåµøB,xG È™�GØÒ±6+¸éç?j@Ò	tjpNF0¦T�r'¾Îâ/ ˆ‰YWg—mKQÎÓ#Eªu¯0ÞÈ=Â4\z´ª^ 'iá%¢k×I¾– ;ž©³g>=F¥0õ»šè˜�9ùq±³]åâe
+ÿšSÞ–’ÌSýhYf@ŦàNA�+‰©Ì•Ð9:L};¯c׆/g�Û¿‚CHT¦™Ñîžió¨u-%V>ß�ÚÚO°¿dã»d_ºŸ^0POØ^ÏY.}G˜BxºwXïéBö
+Ak,6]`š¼P‘8÷<ÚDòæä±8Inz꺤—h)¢Ñ‡å„Ê:–?šc~ÌA—–‹%`s”/âÏ*ÌøUwu{ îIßrÜ¡ù%õýb@Æ-•
AΣû§^#�Öú£×僽HòïØ”·@û;É4vh_5ûý�æ ÚbþVzâv‡åv)‰Û»á÷6?¦NŽtŠ8K¿s½SRóPÏ]žRJ'ÚSh=@õn4"�Þ}Lrûô”Ç8É+z½ÒGÁÝ9ˆÑjº7Â�‚Ú|UyÇ”ºöÜM†ižŠQ†Br�ãKaö<òàû1¼kƒ«}$Æ…×ÕnYÓ:Ì%‚`ÜžNÇ…DP\Úñ¹ÜMÆ™ã¸vÞ“tø74àÂîM¡Bþ<iR´‹tŠöðÀòt’Á#œ@‰•Û#jÃß Šu`žc¥d +<糖‘²Eiˆ „Hâ2ƒX:Ñ,B13ElÃBÚ:½éVõ«Ûˆ'DÛY¾›'™jŵ¦wsÖ;~ɶt%dOHBør:å‹þ[$U‘×e�Hö”<›r«<U÷•6Ýj»lé /6^5­E(û2“k*1k–
Ÿ97<0AIm¾kûlíDìÄuU–‰¸;5U™s�Ÿ³+0r{0j
æ‹zÌÔøæ\,W82t·ˆà»(ë"7±»#º¥Zp71ÿ^¯¥5F:¬\Xže„ÉtH@Ài&*jN
+òhö5þA`~ÕX›„Ε%Ž’ ²øàŠw#ÆMWÑšü£‚øÕ… f»÷0–~úåëÛÙ1qÙŒºûfÁ¡š…g‚5<ºy¦œ×Qæp1Æ´4p�}2xÐ&5>l:½n%ø\ói¡o,vͼ[#«�2ïB,ÍYcG®¸Ä½®e«”1"¨5Œ£<Ñj*[S`Ëd$¸$‹å•sÖ{º•4Yt)¥hÃi §skß—”‹»¥>›m0�îÁXšòÐõn€Û(ýÙC�ô¶4ãÄCqùØ[�Zl�!�RŸûcV¸óuõæ5‰µ)ûŒ<¦ÄeJ”˜—6Žwy©¨7ÔÀç
+#²SAcš0ËCí©<§Í$üóæô½\@9½%½B�¤/‰ã‰�yIæv#û%:N•ØWέÃè)¥„³ÝÌ+Òv ‹«Ùvï
+¦O@Àäâ
Öh‹¦Í	�L\~†úhq«„Ì�õmÃg‰cëD.VQµ‰ˆt9q«F]ó—ùèÊÐpÐé¨'2­$“3Ó5€çªq©ËŸ™iš_³Äšã/Ö¤ú°¿owÃ-N•S,z¦À>q>kböUf–>K8Cpûò„u“qÉ5A1XX‡E=°R omôx{ñýPñŽ°˜³©;è”ÙéW=ÚS'ûCœ¹mðë¤5å[7º”•C‚ÞrÝ÷„ÛL“¾b{=P,rq¬rèŸÞ;/ÁP4A>,ƒp��_¢>–òp.“kÐ7”1‚cd–­¯q•…§†KŽ8Á8{KÊ)�¦·„ æí…!¾<G_‡òiÍœòøïRþ	Ë84Á�#Öm)rR;•e™VèÜ·–4ªS_jJ�o Ù)Úfƒ(£Rƒ«kR1#ïúߨÚÇWIu=#5+&�ÜÎtâ…™Ÿaà],õý
1aYœ)}ø+ß8Çw·âx•Y'Úëë‰mF3»³Kìs?@ÇQ’Õ^M{ýY&­eJȳc×–ìFõuÓY³º”2'œF§besN܉FktINz½_Ð!E†ÜÇŘí­;Ä|
M"eÜù—Í\ç¬@÷Ý[ï
{áóJâ¢èSkbÛ”S^�.GÂ6—æ»aÒèµ´BLØÏ©5£ñ/D6ü~l�ÀíŸÜ:ß³Ó­ú½�6 ¨¦Bò8…Ö郃O\„áÍSÛÊsë`�§É¾ð…Vý¼Æb™çRÎDÃ8>&iðI¦»Þ°t†hCáöuË‚$KÐæ÷ðb~žu'ÍèÓç.’+ô(£ZG^ñ«j‰Cíû°²-0Õ&‚E¨
_#šË8üä\Oýl©z_èVAÓ¿mBú%‘ÉpºOÊ3®cB|ãNlþ¿)f‹Ö»Bi'j3
+â±ýªlæ	î„J¶¥jÙ {mœŽ„J¦ß-Ö°µ,hÃùì(ñ¡‹UçTŒ,Éœï‚X oûX8tÔç{fz‚a	£ü6}ñ0XS측"º½\Æ}$‰ïý§„‡“G�µ8�(¿œ=õjÇ)ôfbûæÙÙG·ÉkûÀŸù�«¡î
'©B_¶'ïO¹v
°­§wéz'p²QÐYÏ…ùn˜/ƒšÓbÿ3X1ûGîgíL	!ÇbѶ+´_ôÚÍ�qb$VGU;2Ì*¼CWC§þº&NþR-�8ºBÏc�Íl.�Üá’.N*ú놻šý}Б²i“Ì΢Úþt�1fp
j‡GÛ¬DËÎ<mcÀ^›|ñ‘Im.`ŠvþkÒp ¦g´3©÷[Þ¹DPÅ{‰"Â`4ëpvV`‰Â”ýƒìŽÚ0*øc›ÛƘ‚ñ+è™ýŒ%ó:ŽçQ0QŠ›RÄ\ʆ½IáÃË`Yà c]WfF�¶Å¿=ø8K0´šmöÔøõв”òS�gºMœ·±ÜßDN¼¯Š"Ðk·ë]ñûüèܾ_WÅäÁcUF¿Ÿ&Ö\EùËå”P‡Ðjl‹GCóïN!;_G%ö‰B�°³òQ£Ä±áƒ_õ}‡%#�9Y“íé‚5{úˆ¸¢¤G®!Zª7C=îåÈiîҀϩiÑ	
ÂÌŸ\ÇØ)ÒJå�µ3Ž•Ú²µ�]õm¶Iœ�[V+#³kÒèkÏr3ÌgÏ;ú]š¼V	›/¸bb'ªÎìß4<yXëÚFS½;›ÒÌ•É2ÕSá…‡³6>4¬vJߟƒñ:ø¿9
œƒ^hj^
+Ò)OJáóMÞ4•káÿp5©ªêa;S’Z(ÐmúúcÈ­Eß×#ýžÍ1B>3Ýå}ûÖCÆvøýÎ#ÍQGZA¿&A`³ŠViÿÆ¢dÆjw¾8Ž¶¨OQX68Kmèú3â¦ÚÍa­Ô+l¸¨¶šŸ‹!x±
âŒk'ö<!_Š5†F�SwòÐJì-wg/¯¸�
+þdµFÒ–ï®z„º´^#¯×Æ@•ÈâTå=ýšOÚYLñ¢ïè3°ºçÃa‚€â¢È
õ™ÕÃWóÉb&Áˆ>
+2 Ï“/Ë&D¸
§Ô»oJ‰ýUô	§|j‹Ðëï+³òÏÖ^^vCÌŠ1íkûj¼±Ù~÷ÜÈ Ô«ëvḂm�±\›»…)ñT^5sÏyð÷Ü\áЄpÔVá%ðþÅ|cyag›<SœÌQ$�•SuHÎÀÄÞSƒŒBuæïȸ°õcXo‰ƒ‘�z9¦ZëÅOܪ¨ŸI¶ä;3”eqÛz†œV�é ][¥ó²ýa'0¿.>™¿2¤ûøÉdΘ&À{›o�p+|‘ÑëIà{Y“�	õqúúEp^l­ú¹m
+¨
˜ø�òÇqì~H-Sp{<¡öáѬGö�ŠÅ<Uv9àãGùGP3& ø²xjYùfÊú§âN°æ5÷rú°Xz¥úxEq±á:aô„�–Ò’ÐU1†›EÖ™Ï]�¼aÉî<Ôú_wËŸô±O
+hLCæÅåc4¸k¨¤èIÌ‚ÓŸãjˆZ^ü¢R¿Ö õôVÀί2¶i’c�ý¸ÛQIcuttzÔ9:Ì1b˲„ÁIÏõÌÓ)!à$£å™–/¼‹5ðÊRt\1;6ÙŒ¬ÁOIX,ÌÂ2”os÷žá­OHz·ªƒÒ,1suy~̾¼x!q™n—J‘÷Y…§ÃvdcÑ>éQ”)•-žÍí£ò¤ö–�i²¯×E‹>X#ñ,œwŠ¢é-ñDµ°Ïå^R�è0¿õŠR¡^Õ–õÖÓ&îÅž½Û;~•Ofd8äŸÔAX¼¬¶ø77D�!÷[dÛ»bø�JVjW“¿ð+ã´å¼ÿáßjA
+SÝÀ-qMk=ú¶Hf€wuP¼«2ý­"\¤¯„£0â¢,Oâ\Wm”‘3ø³ÎŽjYHó1õê�Ðc†<š¤ÀƒŒ§<÷Åü•[{•Sø…Žó6ÛáuÕÑŠ+Ë…�Ô£þíÙ‘;ÔM÷ØÍSº¢ØV¸j«ËïR}~[n7Û,å,:µ µ[ø¤ª¤Í‡$Âdx÷¢¥8,I°¢,1¼ýRµæÉé„qäâ}È»2ÃñÎÈÜ
fòÙ€fú$$ùHÇÆŽ»K>bŸ…N'‡¡Ÿm¯šCõ¼@VçGåýÄ‹²šZ,Ið»G¸suçM7{+ZïpŸÙ.ãÁ:e¶³*üÉ(Æ~MÌÃ/%[&gvIC•–ÍåIÕ7ÓtþÒLu-âó`ìôÑ” æ|Qyº‡1ý<‰¬t
ßÈ¿€áJxÊyVDmÚEˆ;Õ˜ú¤~ø¯ðöòweÊ♟!YÑDsSJú¤:vpH`·�I?ˆéiÕYÛÁ¨Â0�‡-I2}¾†‘ZÀ%™™Ï™nY)	¢Ê©ÔªV¬].ÔýÓëÅÔs fNÖ‰þv}¿û²›
7Ïï0ß™=6âF̸tà(h¬L!2ΚgGNËÖm< Φ˜>n‹}šEQ…ˆà™M«{)1L5öW9ê%�¤�*ŽºçZ39)ÒRÆÎÞˆCE)ƌވ®MånõŒñ7çÏ]ÇW¯ËŒR"b¦T;¤`Â�áBýÅÚ«ÅT>_õÎlAŒ§ÎÚå�")
Vöv!¿aÑPߧ_ºø_xŒItÅÈi[+î±F„¨ÖkfÛy½hœ…^·½L<–ˆ4ðù’_*µ;Š
>éÁzv÷{kíi(
çy3%iº²0³3‰‚SÙFÆ ¥LbæÁj¬tÃ�œÄN�d3¹z*[Õô‚eœ4Òs÷ä/Sî�GÝÌŠÔȲd_Îò­%Çì‚]ô½cÔ²bÓ�ËÖúò+…£)ßyéú,/! ´„ô—¨vmÆ;ÐMºñ¾�(ÐõgÓ!9,§žM®pÞÊ–Br+4Á|HÆu³q/ëô'Z¤—u¡*ݲ8Îüaù­a…ùÓ¢p(žÄÏ~l¾¿Zæ•èRÔ!rËZzcaõf`‘æ
+@{ºùÇ
ÝRM¾ºÍ¤ûÂE´mQq­=îÏà0)&,Ú+ì7¹rq§m©2ˆ…¦çZ¤Ðü‹«0ŸɪøîyWV§ýúã–•³»=7†�¡©©CÝÒ£o!BÆhä ‡W‡ Å!
é€7;¶¬êȉ¸”ÎíƒôJPØÓ††˜~G¹ê;Ë^È0Ó
+s[~Q)B×¥=vf&%ó«”ÄE¶?ëGýãžc!ýÈ5›´?5¸¼ñî¢òdB½-o€è†`0ž•Ÿ²�cÑ|´¯£B6K:æ÷ÀfQݪ/¤ƒ4‡mßAê8®åezYo«:êù8èsàˉZ–ý¬›þeèù�µipÃ.­7ßƃRƒ 3[Úrµz4¸éÆtaú·ÞÔÞÑ(	-Ql¸$iJ—Ê|༂æØ:òÖóL*ô.‘ݯ!]°\�£EŠ3ßL#Q\0+í –?UO¶¡¿aMqÔEÅkg�ó$zy,¼["z•;‚|Ìè@`i¬ã0;óv7Å��Rê/9�žâwçGPiSךhœm‡®Á"®Upœ1Ò´ÞgëüÈ’vÓZ5¹SÓžúIÉèÿ훦êa,óÓêU!†Â}E«É|8=)ºÐ"ï¾a¦”gW÷ÀžµÜ¶K4	lŠÍlï\˜(ãú¡'Ù/3l@á*Òxíg~m�“H†(É(žñ(ÞY?�Ô<ìË�­j|‡ºÊ�ˆÞÈT*L¬ãe²íÉ~%Žw/1r)šM2"ì¬~HŒU†íÎcíÉW÷³ëUäÁÂG5ãEÊ¡ù(Ám쳻ʉkÆuQJ2ÛÛ†㱪¸•ºy7ˆ®s˜X9°ýN%ŸØÆÝX·Gö•G¹tЩç8_Ær%Å>ø²žI/½­t¤ÃËIyå?T½¤³E°†5ÏíRÛÁolÛ„×í\êPXTWõ;Ì›[3M½[7"kÈÆH·s3:r<±ÍÓ¥T!œq2n0‰fa;
ﶰ ª	L$o»ÇƒO¼v&ÉV,þ½RìõoL͸{Pu¢°ÛQÔ^§3‡jÞÕ�²�“R!¸b/mÇM ËŽ’nÖ°°&ß°µè£Y¹´›í7*$­bõ9 ŸSßFAgà»p7IX#¦¹™ð_ÕÀ£í�Éyu^¬àS9þþA–<öt!Ø|ãnJZ;�ßI¢]£¢Ö'ù<¾,ñä$¨7Çsj>‚:}%�ÆS¸næ¤'ÁaÎÿisÕEi»ÉN�úõ©—�VÉðÞ‡oÕGê{tÒºÏɇȂá]×5.˜v­óìŸ~™h:×8]ä§j,ï¤à‚ùoJ\.zF�ôQ½×/:Öd'ûÜ»¨9T൚�+ÜüU;®®žÊXs¯-#EXª’R¿ª¯â´
Uüxœò78ä²Çñ•P€N¸fN¯èaI7©�9Ýân˜)%Ø­ÖÌhòo?,!j¡ÿ\À¬Ì&ç1$@Ï¡éÏψñÒ;�5Eyî	
9ÖŒ]´o:¡y%9ªÑ¦IlÒë)^Dw^¸+/o<•�a~nd‚hƯëXÊú’<ŽZ\ºðqVº¹Ûg>UºžŸvnˆ\ñ2Aº"îSjÇs¬¶,ð©ý<¦’˜‚Peçl¥üžTt	å9ÊcìsãS¹Ô0ðL<ï°_ÍŽœ‡ZK.Š>ø,Ì0ää1~…&r´W«›jËCa5wëü“‚^û9Ø‘	q¯ˆíôg †©dF_°7
+Ãt
)-[,mó†¥~Çÿ|3Ï„­ËÁŠéj;b'‘7€I�¡
rsÁ¹ôȱOÿZ##>í\¿:
,hé®v9�»TçqÈ®	úh7�ÎJæÞ�c¼–±%áŠÒ�›ð^ÚDÄzäÛ'�
”%©»°‹T¶é½òoدy¦³8xƒµw�~-`~øÂa ¦hÿ¢PÑ`˜¾v›Ô2Qhz�˜Áà滄/A’ª+œsÊŸØü)²æË_3â§eÎRï&ú~×€G.ƒ_¼’Ûþ‹¼¦MæGì¬o}=J^PÓDZÇšŠn�Åí¡Þ~ø£H‘&±hß°ðÑ…±/•ÒSì¶uQT5§}mˆüÈáðQkms{}¿oüÆžàeɧÎuWTö™` õ´·¬¹#Ïå‹v�¨éÅÑxŠ?’Ï’;BBÂ0sŒÙíj‚§³O’+öüvçM|¡ùtôÓB”öe¹Ã)	¥xkiÔóÏ­jûÙ°àhqœëÝKjžúlÀÈý¼j°ÎöØçÀN¶ž«¹&Ry‰b¥µ.L��(Ûñg}ÓhràJvºT€�)kAßZЯU{�J{³7|-<ÇíÅJBŒ\ ÀE…Š-j|♜SÂnšªóGDÚÞ=Üà¯U^êÓßsÚ©£ô•ot1Ì
+þåù‚h{#F¿óªúÒP0P¿5y{ga+™~f?tî>³ cCù¶�¾¾=X¾hÚ[N¦©á@Àú¤ˆD~ÕâÞ…‹3SÖÇ
®JñÎÄÙ£GÕÑ&
*Ç�dy“^¨—¹£j�Ú’ôd?
+a÷�¸žéEï€Ü)ÜVç¤uÊ/ßW@î×ñËßö‘*½&ÙIán
âVœÃZÄÃ�×Õ`þöi\Þ3h‡ûbì‘>“?é†÷³Õ*²½¿õA£Qú¹r4@5l ¡Â&½³UÂóæTK®BõЇáWxúÅ‚x+t)¬Ë«Ö@NS^Þv÷˜Æœj¢,…ø¼Ú"xï;Æ=ÙMÂL
+îï1gǦ«VÕòß�Vøj¹Œ¸q£	g4ìt‘t0á§@!¥	?.øåñp�—ÄÅ~ÕTÀÈ�œx¥±X¢ÞìþeAå§ê‡z¼®Â"ÙœeЙù^ãð4Î\k^'°ZOÆuzIèÙSbú¤œ¸Ñat£LkÐWYÎë*"µ*"ÍÏx›ï¥
bà"heRÄáÁ¿Ì{›jŽÊ1HBççû$1ü0X}4›7­ñÑk=½Ÿ‡ƒnÿ°ãÔIÜ€+¸Ûw׈vwæ÷º_½˜í¾.Ÿª¹ö8ˆÅr>·y¢"˜§âŠ^!î¯'J!ñÃú™Ì°öbqþ¤¡på?ž»7ÎœB’Ñ©ùÙ#Îæ
ÜeY®'/.m@¢öL&PuÈ1N|æÔ)M҆є6ÄŽ7ý©¯ž6wlq{Œf/ËÓuÇÙAÅmºzæSå4=�ÅB=OOèœÇ÷½ö-'¶´
ç#¡=š{Hn8¥¢…(>YT�2¼äxÃNIB<„¯^�F–�Å…›*°î”$U“ƒ6§ëØù­=W5?gNí°ewÆ�äˬÕ/ã¢Ü1Ozß©Jų8‰q�½Ïp(ìK ~Y§^�\ÈÐÖÁ°|“òªRÚgÔµËÈÇU”QÑÝœ’tµhÞÇëû	k3ÜÐŽð¦$�Óx»™Þé`$Á2>ôÿ	
+íõâŒÚb0ÊölX‰g9ÚÓ?
qÄd#V¿z7v*wD–iݬ\f¤e¼F‹(“ÿ{¹â×YÙeø­4#‘j
J'8Ò¼Ž@]˜–É]œ	Cë1|:Äw[ÑÓø:ÜY§�èZ¿ÐÝ 3¦$
+¶ضÏR´A\†ß
îâïVщ?ðÎEWâáùÁe¶;§€Ú'òBúŽ›»JZã«7¶�åɯ=¡
’ßSqNµ£žws%Xú6cã*&gÓø�}¿ RçÓ[«À‘ï£ìWQêÃs!ðà`‹+7—M¾µBá•ĤNÑÍ/"¶‘ÚKàtÞoŠK¶H=芲ƒ¿o¿5­p�'ÒÚ	(2ÚN[.¨â(„«šý£öÎ÷G(ÕFAkU�u{&Ýõ®'É0K±á3M‡Ý€%–#˜ÅÌ;RÊü_�-nßÆ3ÑV9*á9€Ðì…"¡¼âÿ¦–š|‚[!¹Z¿AqîãÕ˻ಓU5Š¤Àöt5è÷�úTç´ÍØŸp÷zOA]„Gì÷¿3QAa
…j/À6~†Oùqì“o…S4p\„ܹV³^X\êJ§Ü°Ï‰³…)ÿ/ªä*a�økbÖ;À^‘>))°g§À™ŠKl¾Ü(y'É!ßR«àgòFÉ|Ç™Ýò)¸5âã¨FKÇžá’‹L_õð‡¥Óª¿ãŽ#X!Îfû©›1E‰YŽžç �ø2ªGhc3‡æ# l úN�ý‚C®¤ž&ÞÖézuw…øÂVe:™cZkíãå*�æ ”u­ZFl¼æ>Ä*çbs÷ry䫲î’P1θ‘æ*óŽ°?q~~/)Zl»Â&.-Úêˆ uo¸…R¸ÅæuäÜÛ»y­t`-Ótr„Ë®{K~l0oQ¹
+¹8L£¾Ñ)'Ww°y1(Åû{�O6rȤd}¼í¿"Žç¿/&ˆdÈ€»2îô&’(k©-þÛÆXìÒ¨ÂbŸXšåËò.x­t@?‰Ñן+‡j0ë
³Ýdœ’;F@¦©,ó—	~�‹—)¥*©þÙ;øÌŸÔãUÝ•¨5_oÖwK�‹IÉo„ûGAJˆÒ¶9þ”Ú€¿\ÖⱌñrÁ»´LÊ}ŸÞtY}Vè�®ìŠ.×ÈFzTú{¤f#Sn?9rV´Z};|–ÓâdÕ(úâDÀ–]RƧ1 Ÿ{l¤�ˆñ/xPÊ›“ÇwÒq[ö*;¾œ-äp.70EœšMÐפί:ðÌÓÀEž©yb¢¸ðl²Å÷=,WòÐá’*‹ÜÄÀׂNÊfôX†Šó®Ÿ49Ù¶y?63¿ŒÄ~[žÃ&D¶¶ÊL¾9þ¤B™û“(ÿ¬È�ãïsµs9ô*v?í0üÀÍÕÖtóæá+@öê/˜â©Âèð|21¢LVtâÔT‚‘e”_ÅòXʇNS^Æ•¸žDï¬Ãâ?'‚ j¸à(*™¶S´‰ÿÇu@¥ö+%‡ïÉŽ•ì\´sáÇ;%ÝòYåðZr?<![ïÊÓ<ôµ‚:dy¾sú?¼µ\Ï
+	ë�F"ÍjÂ|,Æ“JæüæE¶ëâ†Ã²'# Pÿ]N!VŠ¥uk r'Žs·ç#ìÂýïe»õOo¯'Ë~è(Ì(»[9hpë2¤†–fñ±¾�æ¶Â‘ZÆõŽÝ_Ù]xÐQCq#Ýd*÷Dë?Þ[â�ÂDa/JkÏP¡ŠF�8â”èÔXÄb´;É
+
+(&ÛvÇ1ét
´Ï³eó ô¡-kœ:׸ÜNƪu�hU‘ÉÁƒ|\§rLüCŽÑ6äíý„‡&§}…z=,‚sY”¸¨”xÑIª)†l“IºÁ/,å²”ÿÑ
³Œ4õBKÄ‘=D`%lá*ÄBä¥Uz£Ûào•.j
^‚æ)å˜
LÊ^AÖzv$½‰ŠA	a¥eFÆÝ yx:ÕºGa"gËi
ÐÞaÂs¿×Eè…=œG¾þÕÊ"¯íø…š'žì·G('¾•å>²ò{¨�~‰Ê›rƒÔ¸]Ô§23ZE×>¹FŠ÷ÉʼGå[Ýž%Tr¦ÖU­2”wûUÕ¨=ÜГ³Ozºš¦»ÂB£z»bqËåjƒXÍGÓÆhcQFˆßSÒ+èìßã$•_ÕM׎:â‡rce'ƒŽKôõ"Eq  h+N!‡
3»_¡ž®?EM,TÔnŠÚübË£˜¯‰¿åEühõ›–÷¦éÙWðî1熲NÿËÏ[–«UëµlñàC:nðúìãK¤ê•BíBØOõ8ñT	gVž¬¸©dú…0 
+ 	0èÙE ¸jf“Ì,¶
xµY þ¸�¥ÊˆWb³õ@d™L‰{ŠßD6:ñß�6¡ÙÊÜÎ'纅–öÎ]XH²zxn9nWºß5$£¹ÛZ@¦*
 FúknP3˜ˆ*ZfÆ‚±>ü‘?=VÞ@›
+2‰y‹5®Ñrÿ4Äæ
+¸ã^7®žrÿ"mi:ö)#uoò¨¯WÏf&eÖ8Š�/ò˜l2ÇÓœb7=§“âá]ÈÏPP'dÚc‚²/ó4Pìðœy0°ô'cTÑlîÿ@ÃË
+Ÿ¯	¥._=Œò½¬×¢D²Ÿ-.¥té¡¥ãáY#:t\	‹Lßb‡÷]"‹C%:Ø,YÅĈؘ4,¿:¤]§(Ø”zB2äÁ—€>iy9ÆoØ&kÇZ§ZšÇÖÃá	Ì̼;ñaYû*Ýd„[mØ]q]�\öÖ˜5àÖ«¬Ë˜;‰°åY¢×ðP ®j
¾ÆgÞàßà �.ôBUœI¡ ×PwÛ‡Š¹bltZÜhùg5Bø´> 
6»jöø­½ö/ùõ±Å—«q*^‹÷¦Ø+àj'\>”’îºs…ª}WËŒXjxù|èïÑ)]ˆ$9Õ¨gøú¢»öñ¢¬.éx® JÁÉkän~¸/²úÈ\‰¤YÆë$©½¼cµõÅqT<Ù=³§@KÐHq‡ñÌö>Yàr0΋/{˜<¤þ³NÎÊ¥™NÏXëN[÷#º¹m=�¶õ
MiÎd3ƒ
n[ÌÖªLh�B†ÚøÍ+éäW¹·wUÝslïˆQÔÁ£Œ5iÁõx*áRF¦Q?ñ®+åT÷Ñn"úö£i˜èå—YœîAaÍ·hu¢ŸÉÞÂ>Ûkª*_ä³Â-£Úfä.mŽ/Óš)¸’N*z‹B°Ð_2ª(´+HY¬[ÛŠên0SàðìnO$ú¹Ñû§&º�vCâ&¡5¶}ÛmÍ&›Ê4œ=�q#ô!ÃÎJ�¹|»}"J˜b‰Oƒ�wèÈCÜÃî©{ðe™´O ÔLM�€W7À–0\áPþr
+endstream
+endobj
+7134 0 obj
+<<
+/Type /FontDescriptor
+/FontName /LBMWZU+NimbusMonL-Regu
+/Flags 4
+/FontBBox [-12 -237 650 811]
+/Ascent 625
+/CapHeight 557
+/Descent -147
+/ItalicAngle 0
+/StemV 41
+/XHeight 426
+/CharSet (/A/B/C/D/E/F/G/H/I/J/K/L/M/N/O/P/Q/R/S/T/U/V/W/X/Y/Z/a/ampersand/asciitilde/asterisk/b/braceleft/braceright/bracketleft/bracketright/c/colon/comma/d/e/eight/equal/exclam/f/five/four/g/greater/h/hyphen/i/j/k/l/less/m/n/nine/numbersign/o/one/p/parenleft/parenright/period/plus/q/quotedbl/quoteright/r/s/semicolon/seven/six/slash/t/three/two/u/underscore/v/w/x/y/z/zero)
+/FontFile 7133 0 R
+>>
+endobj
+7135 0 obj
+<<
+/Length1 1630
+/Length2 12254
+/Length3 0
+/Length 13101     
+/Filter /FlateDecode
+>>
+stream
+xÚ­weT\í’5î4XãîîîÜwww'¸$8wMpww	îÜ?Þ÷Î�;ë~ókf~t¯óÔ®Ú%»Î³Ö¡ QRe1s0
J:؃X™y
ŠVv&®.
+öò*@×/&¶V€€�‚BÌh²r°7
y
š@3€8ÐÀÊ
+`áááA ˆ98z:[YX‚Ôê*š4ttôÿ²üå0ñü'òébea üxpÚ:8Ú
íAÿã@U ²Ì­l�±/JÚ2ŠRj)Eu€ÐèllPrýhÅ oe
+´w
ÒÌœ
¶ÿ8LìͬþjÍ…ñƒKÄ`pqšZ}„
=L�ŽAôG ³�•‹ËÇ3ÀÊ`állú˜
È
`eojëjöW
vs‡¿rtvøð°ûÀ>È”\@.¦ÎVŽ ÀGV%qÉÔ	²4ý•ÛÅê8˜xš9˜ºþÕÒßØÍ
+2¶²w
€€ ¿r™
fV.Ž¶Æž¹?È�­þ.ÃÕÅÊÞâ_Ðœ�ÆÎf¶@—šó¯>
ÿ¥{cGG[Ï¿£þöúϬ@.@[sFÖ�œ¦ �ÜVöL-‹Œ½¹€…ùv3WÇbn@ç¿Dý×ÎÐ|alæ`oë	0š#0):€>R¨ÿg*3þ߉ü ñÿ‰Àÿ'òþïÄýw�þËKü¿}Ÿÿ�ZÒÕÖVÑØîc
þqÉ>n€<à¯{ÆÖØð×]ãä
+üÿÂŒí¬l=ÿ›ÀwÔþ£ØÿàûwXdü1{‹aXX™ÿa¶r‘´òš)Y�L-
æƶ3ûÛ®not¶µ²~hû÷X?‚˜™ÿ
S³´2µ±ÿKŽ@@{³/ÿC®¿‹gRS•“VÔ¡ûïnØ¿=•>6
¤æéüGM³ÿ<üÅ#*êà
ðfàd
0°²q
¸¸Ø
Ü,,¾ÿMÆ¿iXþuV09[yt™™™Yÿÿüýë¤ÿo4ö¦fmŽ*ÈØÞìcÙþÓðlêêìü¡ñßïÿGÓÿ<ÿ½ö@ ÐayÁÁ”/Ä:=+Tƒ“70&®ÛÓÅ9êXR¯V˜PåðË?=b‹ç‡ÑKu(cÃï[«çü±ãë®,íÞP¶-Õ¯Tàùw_2šî|ôuÊv.º½ &ƒäŒÍï‹9ùM(Nf�½í1eƒâ‰v6g¸‹{š2·üLò;G?Ó´ºx¬´0Œš‚ãÊäÃû;ª¾áÁ�þ_WÐÝ»øt¹ñð|Æ8~_�IR@žFÎ7õ¦oÐOn\îÛ|ÊÁh�Œ')-1¾C âí~‘Fo(‘�ˆ ®ü&k\ŠŒieÿÜ>P™j6ëpÑ÷âÉFš‰žæ«qÒž‹f.âKª¢L§Xì¸ÒfbI|9—©ea(°\IÄ!NHò‘ÉÐx’Ž^óQMª½ß‰xoøp†|I?|M¯P…ÒU\n¼päÐÏßâ§BÙyù^êTz8·áÿ65Â^ÃhgÔ»�>C(luâÌ)»±XZ�’42ƒb&^4{kÚO4œyzj™^Ôq„!«Â2rs¬ßuÊOÔ�ðÏ\Þ±€é7B>mwõì�-6Í(�}ᶙ!˜kõ¿ÒÙ :‡jîJª‡X/å½³ž­ûZM¬öŠú—Žd£“%P¢W{»£›J�˜’ZH­)�ôE¥‹ÀtØèFd�VzŠ/ñäRü>
+
+×h˜n¡AÌ!ˆi†žýþGM´ùSûÊåæ�
+OQy/ cúJ~8²ÏtcÀݧ3h2¡Ä�<Áx!ÎP”ª|ïÙÌf+¿‰Â‹O̦ä™�ˆTA›

+ŠJõúv…©AÙƒ|@n¯¨x›ìb°û!7Aœf’G[ã#f}2 Î~=î­HÇœBrâ¨~Ü	²�ÙÄKTffW!äú"®5ëWJùj÷�…!J5ìuâ°""€»R!"ì¤0ªz”*¾Ž�^)5r³+_¥žUõ
+¥§¨Þ&ŠɶrÐ]È�`· —þP$úöøË»�7mñ
†$¶×M�à7<s�˱6“�ÐÈÛÙs×}Ž©ÏÏlK$#W&üü¥—qÕ¯ÓÆó¾£W�íIuà�«ù° Rú+輜ÃôÏÔúìZ³+ú
ák×çà ò¨·$Ãþ5Bœ~Gf”*�öÉÈBQè¥9ÕµÑÚz)ŽxòƒDðÑÆí¶AIf5Z³¹rŽB~Á+×É–�_ÑÔµ‡ðr^{“ê6Ý.Á�˜–¾gú�Œ$=…ˆ¤ùH»–Â<°¡yI»îÙ%ÝÔ
S¨ ¡¬ÚѲ³…fQ£Z<m'™	˜€/©ÞRákéßÙÆ 
SZuâÖÆ)c÷ƒÑnT7HÊ9üÈM³Xïeò(S%ü„d\ä…LZ©×<¬WDoç¶s.+ªäæq�/7ffÝfÉVÒïPÁ&¼-pŒ.‹’�mE¼¸Êé�Þd? £ù¬Ü/ó 4³ŠÚhLý@œwéÙm
+Þ½ÞäƯÇà9²Í��‹;ÖÇ@Â~íðÖ�T<UȽ4O›‘s~¬íäü’zu6›%Ò×Ï\Údå!—·–Ÿó=ýPf‰æ]c|^§
)vÿŠ éãbE‘�ÛªÀð%·.:�?òó´z.ˆŒ»V=U¦ÔLlBòž9ƒî¬$ãb¢8ëñÝhÅ·�ÆÌdÒ0¥v“¦Õå‹ØO[-Óߤ%�ªX´lå,£?•FÍé[y`gãÎë(N.¶#r÷;$׉	ô )¾LáIùö´×-ýR?�øƒbæÁ
…7�¡â[Ÿ@`ñ£Ã8/ó7oãÝ°°�Ê=géâvÕš�F$ÅŠˆ¶	x’u—´A¡¬#5nGQÀè¤Dd�
€qL£	¡|ƒƒCÄÐb«–ÜØW…0YTf¾ý”Ç­^…UVõ	’è‚�çæ Et¢ü±ßY#Ö÷[~ü7FåŽ-›Êd[t&v±Ù(8?ØÍß¡òÅx©UZ­FËÖ¨ù…~|/ÿbV>×f”zw�fzŒÿsÝŽ•ð,`Þo#+®¼Aœ¶Y�éhøÛº^CøsÀÔH
¬›ÄôZhôq
+c7Ð�-ÇÄŠ~jŠvA
]·‡ÃPAX´^7±pú*àkOœÜA±	S{Ê%H®v·Mâ×{±�Or9xÔŸÇÓû×oÖH]w°iÄߊäã:œkTü�+WËVÃhƒ�"Ÿ†+…J×?¹YÄrã£;­ HJ†}-ñÅÇ¿›« ÃºÈ*7£vÛmNãùóœ¡ÃiZͺýRi^¾ë=cn“á½õ>±5–Q
XcTãÞn>9{Ʋ˼ÇèÊçïñ…¼°Öϱ]pžh=@a£ª½Fà ø]>5Ó[Ñ'Ó‚C@2dÜRÆÌ1 es‘²üÞÞíª„ä¸C•w¬)¾
+ûin‹þ8N¶9Âl
WðI³g£O…Ü^ÐmæIcŽŠl‚ô#½VÁ²
\ Ø-µ�XcÏËéEÃgúìûëÙV®56z¶~7þg*…îûR#@?¯—#$?úNæ�.D¶‰í¦^©<@f»§áÌ|—Y¼7j�)RÜð²£tü¹X»­©3é5ÍâÔŽÿÞŒÕí¾…¶Ø5úSÁ‚å%¸0ñ’Ý‘	Êçå®ÆÐöö[�fn2Õ)ž¾Ø:M¼k(u‰„'£û­Aéг³¦)l±ã¬6ú&½?¨÷Ž=Çð6
^ùUÍ…Å€“ƒ{ìwŒw÷øY%9—9؈åû°»¹ÌÙ6ÆC÷§û©Ÿ…Þ+Dx襘QŒ˜U^ÙœUÈ}Òsep?™\,¸èœçµ\Â7¢åË›‚€ËŠoO_¡—¿eÇk|Ë<<EI¹Ê°Ïj² ß…q¬#¨,žÍ~_-°-ÂáÞ®Ioc:¯‡Ïܘò�@=­vmÄÁxU{o^~³ÂšÕµS¯ß.`6ÃØ/—×æŸÒPÏÅ9¿ÛÒgE*ÂI5NY_›ŠÈÊLÕ
+žñQ'i$µæß· Y]Ê­“«»æ€û‘Ì¡œ‚¼Ué̺Ën­û[°Ÿ¨Ÿ"D~ôà„•ÅÄ¿‚ÝjB©_å@´„D,¼ÜfI-b5ZÒ¨ðÙ~Cm•�“Þ|•ÂaG„V”H2^è–Ó¶gzlkMQ�'žhÒY­–<3¬6g™õô¥t>Žg:Ðè¿ YIàF-4�dyŸ²¿gÍh‡¸Ùq‘Oüñ
J'òJŸ?Š$Œÿ3A‘6ÅʈËÑ6Dæõ²Í1Ëû…VØŸcLD„ÝÙŒ­>ÝĬû^<L½÷ú¨8F²¥˜í�ñGÊ°0ùYÐÍœLŸ‘hüž<«Nq•qo;àÂNߊE�_hfú;z8©{d�Ú\ëä
+>’	‘”=û®NãÁÙ²«û½ç¾
+æ»9šä»Þ|™ Ñã±røl­Ü�»&Ã>¹,æÆwwÎ)U]Ä£K¼Eêh&LìÂ�©dMAC†DrN¥`)UŸå‚.»�óŸ!ºŸÚý_cÜp&�^‘ÕÔ[Û£iµûç‹|¦Ô=L7h	µÊ—©¨Oë�$¨ˆå?Ëo-åB¹�|ÇÃIýŠ^#ýÜÿ¨e;�·ê¿a¹  –î£Wke¦T=�}�|J‹šBß!»Ö}(WNŸ4–Z?–n’lW°T;s­­‘'!Ro|j2ú��^åÑd‚
;Áv.çÔ; �ò]œõWÎ
+=ž#¡#jJíòHýn<ŠÛ铵§;È
Ö±~Éñ¼ñ7GóÊNÿpîó‹äþÉÁVl_·'½Üš�4}/~7ø–©Ð´ö�zßX£p¹2\Ÿ–«†u¶C_qIœvÏJVWgº–8©tÅLIš˜iìo¡ë?¤Í–¸á÷[àÒ±æ�CƒÐÁdVý¥WÌ9ÕÊ`ÅIç^sZræžcO@Cï�ª�D”phÛý©Q(0°ï 2œ÷çªþnNä±{ä…Ëî¨èŸ}„ÌF‡•.Þ9ÞG©€¯2‰µü\@œø�ìïW6ÿÒOœ¼þÀ›ž‚IǸXZ”�j×ìZŒV_•œØGQôùìá‡C•K0�oÈk)l·Çïýµ�9ì‘ê=ÙeÙÄAž%=¾(}qüFç,xg_’ŸW¨ÜhÀ­�â#ÛÄ°&B�œd_õ·ÄyU™ÂʘKÞ®‚’M¾w8%f¢o"*4ÖQ·;¿¦¿ÛçuyÂOÙAšÍÕîkE<rGãlÇ<|]¾:�
½’‘Fɹô±£è^Ú¡†Uº.†›z’³õnâ�{¯µ5Øo=¥fê”w|
7Võ’cT·fZä\,ïü†•ŽÊz¿GoÏ™®ï%ŒÁ"Ù8+òªAdE}^•Ñjô<ÁƒPA1RêL	:²†
«9¸^‰–³‘ŒA<A]´jIü*6µ\ÔP
Kg©‡•?¾PØÞx�/3ú¨N)#
½ aµ˜éœ­ùÚHœ­imàÝíãËÉéÝVó4Uf*¬ü¡L¥p�5/$Ô<|9’<�<7ìݹhö[þïó	¸„P'¿l¬%:™3#spUhíûhe'Óý"�N]™«¤~Âu¸­À•†kr–ÛŸ&38ç6Ï«° Ç·íâÀ+^cKImC®×"
Y¯]úw/l‡oLw¯[=ÀŠÒäE"ضL¥¹¦TY^”µ!„D,ÏJ¨&‘_x:¢nµÝÍñPZKð[HMÄ}§Pù�š/¤e˜”:̘C`6v9^÷§%4¡_z×rzLËË…®E°â‚@º"¯EAà÷L­[šžh¤núbAWJKÆcÚ€7+¾ÒˆÌ	g"lQkÃ0Úy0Ãa-“ƒ¨æÐ\™=ÖPš©ï¤!­3«W£—�t‰ë²ðêß쉻¾‘œÏBýº3Å%uÁe¸à€Ðð•yFH­äò7‚RëKaèé2,ó�Î5Tú[ÞîÈ.(œ·ìƒýœ{¹†
‰ÇƒkhÄ^@â6’CBÙKzŸm
+¦|ãCþMæ­¬òO&¿^,b¥ö=dëɶ§O²X¶`G¬†3Bé2émýÃo`µ"ªüýf
©„òò“.ÝBåòv;ô2òÖ•˜Š.+qKìMçcîÓ!º2nÖ=ù·ð{b‹Éü5 ?=çÆØ;:îB"KÌêØfVJˆœ¶vË\nò?<Cê›#w€·Ç_bN»¨[þ,Ëñç,‡ê›C-³�`vR¿d–]­£›±²~´ÞÝ
”:O‚lÆPs§Åç	ç3Y.z}Ö3?à­éÀÙÒÃ÷+{¡ÊRyÜIûà$]x(jéÍz5 LÄWÏ÷´gíA ö²2ãyóŒâN!n›{vú)¾¾L5q°Ûû6Nç0Ÿ�±é‚¯mÔ�ÓߪžŸ¨Ë°Þ$ÊJÉR\³f-«Ÿe ·ž%3¦l
+ùS¹
+àóˆ+åÊ]Ù_“½ˆ¼VÝ°¨©ïUîa°¶Ô³Þ¢²
|ž¢íkh
+TõpìOD‰.ˆ=-]ãóGjYMt˜—y5ËnTíÍÀm=¸s·ÃZ`#$˜’5V`ÖDÝ ²+žù¸›—!¢§s,ê[qð¹“ûªB8åU?Å›„
î0ñY.Òœ`º0Wlš
y0ÛãSŽBÈ×:ÿyÁìØÒø†ÉÅáÞ4ó+~�rѯ¬¥XQl�rLjFjÌÆò[ñùÏSã²d>Ú0ñ•e'H�ˆSp
+5É>ã'€8újrˆév¿ç&V7ù{~BÒ1†äkñºK1=?ù!¬’‹î+¸#á’"é»9sgªÉ9eGk.†¬¸E<Qû;ZÍY
•ó“0L0&/|•dìu<3âùó…±ý4dx‰g2‰en#…ÎSyóóÃ�I)‚e•2,Ô=Í[}vÓÑìtè{�†DÍbP!ßÅ‚?k|‡%°*ûœj£
ÂŒRB
ñ÷aCR¸ÊèØ·ü6\O�ar†dGvSõ#-o;xc‚v__Ðq¡MES‚ïÆFÚ`ÆÆ"]ñºeƒPVt sÈN*³ÏU#ûР
+­žvZo=47¿^ŠÞj}Úø
:8å6“4Ø¢º—4%ÓiO%KoÜÀõ‚6ônÙ\z6+GÀ½_�~�ßý¹�Šø¨?Í‹q&Ø+
K+(ûZ”,	ùF÷-Ȭ™
-Á§wWöû1|«J|eå99˜xêZˆÊÔuuä‚”Úò%rKՉʨßýö×r_dðA
1ñhRÍôãý‘â‚vô†MÅ«lc¶õºnuriŸ¶ý}ßÞN_ã!}Y$Á±©O„ЭñžŸòÉdӌӿKuø£;”S*.% ã,ÛxlV¦³y»¨¸r
™¨'Ü:²Ÿ\TZÝ‚rŠÁªó9Ì…·,
 ¬·[óÜ¢V*ýà'šÆ±èâ¹û:íZKu¼ÃÒáÖ
JU¼�´1½I&É;Óñ*Ü”OTäLOõ�›z
+…	Ý•È$0qã“ü"qv——;[“V&[Ý,‡hóC7Õ>§
+%xˬÒýa‚+
M÷s‡«¿ZEæü!›\&ȵ¥666+‡”jÐ,‘íÔ:Œö ”kvJéRAþ»ª¹à{”)¸ƒçàÔ¹þâ;¸„a¿<É0fkõtÀTRàÜÏò7Ë�qr>¦Sò•Çë²7Ï´ŒlvúµÏçË7jªƒ+ó1UÙ|�HL8mÙ
õyŠLÙû´Êj"Åy²ôÐ×þ–ÒbŠÊê9­äÁŸÃŒ(Ú)}øvböÞÏK÷²¬õ|r'n,³OÇìÇ¡¤þlÑDÊ3šaˆ](6§:7Ñ¥Eëã5™A[ ¶Ê²
‹gzæ-?ÿ�)Žxà{ìÉÅ~„fûí$c^NVís
g^¦‹Š¡=gÑÜÛµÓK´	¯†rׂS¦²MÇ$äFL¢Ï<Oþôi‰�f -
+
ó§û<äæС¼+né‹$´,1ž&êY!
++N7^o⨡vyËÊ^C	'æùºŽ„ë†i¯¢†½ÉÌ`�ë’cZžÕB¹K2v;”™G�áút{K?×;{ß2Bµ%³®¢ešÓ7¶Iã)RGÖy·6ž4\NAXÃUHÈn�‹¡N7©Zh½ð¤òIÓöósG(3S9$‹¾‰ÛÉþÀ·Î4aú“¼
d6gß*=ûPÜ£­êï-N;™~vA!`«Þr¤ù‡˜oár‰„µIêÒ6íÉÂî7•¯D¨›5{çªX½Ø¼{æ»7£þu\"h�(¸÷ëwõ4˜†»ŸÏcЕÍZ]-4¡2Ü’÷+ë®Onò¹†%€§¿º-d¹ŽàHMxS|¯œÔ–ޢ릦IúYŒHSˆ­~ôŠ¸@aÀåãû\ˆ2ù
ÂV™iñƒˆí¯NQ펦Ý$mx8£ÏX…?·/S¶‹°¬
+|ÙÐúš Ë~$@µßC´Ø‰�sÞ¼`7l±æßÑ7óµ­mAøh$û ô["¥Ì€6î b`X'�ÀôL�¿3´Oþûäýò—õâÚZAB�Á¶ì{ød?áõ D*ñýbW�>Í^Œ{ûA8âfØ
+ŸÙWÙ+^Má­3†­v&u™_¦
DÉî„£XßMh\dzÍßyÓº3\ÀJ
"dzÅ"évÜÒÑY0›"„c
+?;%×cU
+cA¢âAÈwãúñWÀ†­sÎèûu}=9´!¬êEýÒ1þúv"„
Þ,Å/¶PT@„_´Á®ÚáÉeÄÞ\¥kÍUcƶ¡Lr’–/0Þ˜q“¬ ÿCÆ^ͯ¡+^2ù¹[�Ð’&Õô«äÚWËú¶TAí…¶¿�ž¼ñï·,,(OlBD}JI”DsRólê÷‰¼K£ïâl~ È¯%Š9ˆ(~©ª¾Jìâaª<:ñ
²\sBðd–“}Û-^vÞQ\4VuÙû‘�Îý/9];ï7%ã&rúÕ_HõÔXÖÍfÀà@ßZ„¼ÓBb™}Ÿ«°oÂÊ
«·5hÞ—aœ³òòFßfVeIP,)ÃÍ•L¹mQÅ—K\brß^^žÙ§[°+•¨Ž¢G—´éfDeÈ7†`Õ}Sã]×(�xÔR�°ÈJg±m
+VòOõ_ÒTAŽg�{Ímš¤¢DÉø8=m-69’Ó$ä×cá2ó&÷ͤJSydÚj]šoîp�c¦á=ˆyUFfõîA‹ÍHñ»Ì}<wÚ
í—�ZBuú"R¿ÓW>Sr‚ZuAê*ý¬ŒÙ�	˜ðÞá{ôìƒô	ÜOHL°T´ÞL@¨>/€HZ‰ò7#©af&=ç#ÔÍè•s±�cŒ)ÈÆŸªAõ!i�$ßp3…2�t׋Íi¤o›}žUDPÕxTѤŒ<ߠ͢ºS`{šä(õÁP9¿Û'CŸ±dhË7ãÎ'ÄèVdÆ“e¸'æ«#ÑÖuAb³iÝ9iÝÁ±uAŠ
ÒSÂåÁÂwÕrPdzûu´ãŽitTÛjÂ:¸ƒür1š3d"Qªa™_á’žÎmlü7c�>'ñ+fY~!	
y¯àÞéE1¿®˜¬ÁT2Ån>�ë¾¢³ Õ5ò³OæÞDäY?j@ÞM¯·ØÄ[yÜ(®+­KÈÏ!Ì­Øé‹Ð{{Fá@³Йè¹ÛÝÔ}ºôÓÐ[cϼS7‹a*K]þ^*qàEUßáOé/ý’¨å%�»rä-}ã› 2ò$–(´¶ë3’Y{‘Ä6`Í_¾œ‰ÙVc¨šñkÞé:Ls™:ùë„å/9šéèžmil㦴J DY
+hÍŠ®&Q˜v(Û%q¦5èzý…åÖA@y>Õn"XE†&xh›×îû¨£¦áÊ\>~é|ࡆoº1L�dÄÎÃ¥3ðI6ë4t-üLv™oXU±¯Ìþ¡P¶ŒÃNZÀÖØ–};RiÊ{äV?”+_“b³ÊŒônÂŽ’˹Ð	ÏîÖ[}RX›?ñ#o²Ò|ž�êAƒ’`“p¦ªÑW¾õÍÙà*çùÛ›V“£ÖÂøRž“33�Q¥•Q£ïzÿP�!2³r7t¤ì{:¦uRãÆ=A„ ™› Ž`Ï,|Ül<»Q�E:3¤¸Qœu™f¼oñ¡é•;}v*kÎ=rºNU'ˆEp‰ŽÁl·¢~(yÓ€·Óã{å¾u€‡7(¤Â5o4o±ý‰	F’©U,�_šwó…Ç×w1Q¢ƒùª
{Ü݆¶¼RC¨{_¿¿~ã
+ö<ˆα: ž!Õti÷.)uP™PeÆŸ6'”"–n¡Þ?žÞÑ¢L‚^Ï
+ÊÁý²0�ü&3œ‘9ž_ÆK…gغÜÖQ†½/	MU\=
ê“šëåÏá[bÂV„¥¯Å/}ß¼¨ÏŒûƒŒ‚7(štsœ=œøT[øo
y×ù˜9,”;_ð-ÄŠ†ð#„d]/–wÕ±ŒI=OY‰GG]Çù³AHN%û=cæSˆ8}¾õ&ðÜÝ3ìq#Ø
+¨{Û*ë	Äè¼l"îëÔu\	Úh2†#xVð,1�c�tR©$eÙò…�©s¥wѶ<\÷KØu‚•ƒ2¿Mê5EHó¥Ýwe¾\ö¦Ç™à#ÇêÄõ\èªHÇ\0ÑôÎÆáû
+¨œþÑ;n&…/­/]É»¼ûÙÜf®úC­òGNû­v¥:Å©ËR´ê¬D;žó×òûJþ‘¼t=a*/(
ÕAq~€žío'ÌTÂ-2û{ĉR@zAÈS`Ô—­\¾®VXĶïè7µYv»5A¸ø…À(p᎛©-îÍèQêþf¼Ñ6nÁpžZÛR@Aô½�â ÎÏ÷#›DµÉ¬\ÇŸÀçIecÌX[hPY@ò¸ü�k£îЃ,S¨ÅCˆúyü+
îèçÔëƒà&&¬
÷ïe·›G«T	›’ 	µ%ù³;«oÔUõ™_âσ0ÆÝIu¿b<DÉi®ñTã
+©›ºUæ`òÌѤ„×�Ô�íQñ‹Œ¾xüÜeŒðbtjðWDGƒÇ½ƒžÜ³[:«iãœ.Ý>Ì߀ÀG�yà&P–:†BôîwT 	T;õmçÕ
+	bÖJŠO7+o×Òqº
+¥£×žè~oâï·(N¡9 Š™ù	–²eè§Wó¶Ã$(°]ëa=4ŽÞëÞ“²VG\âꓱìSÄï´Öj£ ÛËÍ#}S³×¶j¯q/…´‡ÑœÊÊVÕN¡u�{$çÛ×ÜhüÖ'BðCèö}�÷•Åû‰©úô͇xºóX±±e�\$<^¶^¸Icy7Ã,g±¿jÊÖÒÊB
+>´‚t1œ‡âªOž#�+<€…žð'Döi+»:.l©æšš
$ò&Ë}±V±^i h›Tú�ëñöPì•—|ÈâÝçJë7Äž$ýS“‰À¼U½_ ‚§‚<sÒúdCßyöÊ�†ÖVÃrõúêç/Σâ6ÖÜD¹Šn:ÿêÖ¥.²0‰ÕƒOÛå�Ócsq¬Ï”ØA“;¶U—büï‚Ÿ69µ°o6*ˆŽ�‹#ý5R»•Ê‚RµsÖý’Á³y­e¯ÇÍ@]g«GeÑ0�+·!ük—E?ŽÐú@7]8]‹Ÿ�˜
+�uzW¤ñÔ3fšJ´n8Mõ;-×ªÂÖ‹¡¡¶~ê¨�Ö/†ñߎíŽ9¿ñ=3
|L:d�%&éK6–4!‘iᇞ³8�¹-ö*PMnVÓÎí¶Þ
t�eÌe²¡˜QÊZ“„ÌP	÷¥Ö=îÌìÙ¸Òçù4£÷ñ–œUq¶MymåÝY<ÝÃ"ï)!g°¬®˜ ?�‰Ö{˜…/*P»®É÷j$OB¯NmñšÜœ:äŠÂS#‰Ay4h¿m¤g²¬yuu|€†¦
íƒ
–|S´8§
ˆˆöþ}-½Ý|v-�ÕAYžM+`´iµ¯ßü½h‚"­d»%JfôÄ-ý˜ÐØ.õs‰iEêKMÜâ$¼¯ÐÞ™Ìí©û-Ù’ЀÅ
+É6Y³Ê1û�#Bݲ€	ϱLÝ	œ±
	ë«Í>s€¯Ox¼ªuÕ‘4÷ÀtÝ~·ðò„ÞVó§ÄÆÁ’gLNJÊ•—ïzA�Mf-an¼Âx¹oËÑOq¥¦÷fÁ n�# îBaM�(É_|í…>ØÛC�ÎñŠ˜Èšˆ…[‰æ>ˆï‹‹ƒt{ò´R^:ÞÞTÂZ„í-QŸ[Íœ¯Ö
{õ‘²ußâ~â°óú›¦R+˜évÉ�PUÚÇ
+iplÓû!Wç9ÀJbo>¶ñ*bu'B!—F>º L&4Õ9»áAkXp®„¢2Ÿñ‡áÒXk
92Áˆê¬T|n{Fí�£Ûª>c‹HÿL¿œ�{Ïþ*©µ)Eç–qú`Y°´T‹Y]ç´+Õî©U�ú¨l¾ŽæØwt±W×Ýìø˜9jÓÆ{
Un×4ä>p�ô%'ÃTÏ'?ÇÂ,yx2?jÀ†E+O
˜6õõ±ßêuN¿YðFë¡vÁ…÷’Å·åM×yXÏjÀaø–Ä
+ž�zù˱N!”ælw˜4?’àñ¼ÂÍe\�f’Éÿ…^¤óXDø¿ Þ'¨hd?Ò‚µø,sY2¡.š6°@ÿX%ÝÁèß=¡�	XÍœß:e÷žï u0·’^.-Ô ¸éZ‚”.–«ðSÀ¿1ÐÝìùÅi5û÷̳­¡Ä†>®(pÊe\]•CÚÞ÷Ñô²túÿZ¹Ñ÷왋x÷@q=bÐLÐA
+[þe�€Z½BÓ=�(‰qPIÚpGcA�šŠï]™7€A…÷y°¬%)«Ê…ÐU<õ{ÊêÀ*ï^—aE
6 YÀ150`á~èv	²-�,sôH±Ä5ÆkÄ æ\`Š+¿½cÁ×?¹ŠsÒ9�gÝÎ�Ï[*5¼FBê±ÓH½0@›ïâäoùZ!5–µ$d¶ŸH‚[”ØÀ·¦¾*9ýhè.õš’³`’ÝÂ%-S9Ð&°‚ mzØéÖ±öæ+stêûÒòv,j@’8ð©ØCè¾½TÏz
7À69Šö
¥õb;Á¥>.®b8‰m¶xV²6ºŠ­#ˆô8�c¶‹zÅÞß4mö]Ø°©Wywg§ú'a\¡ü¸þ1!§¦BAaëqRçÞ}Kñvù÷€c¡åàùPð*
ýd»	lz†R@î÷r	g¼À&˜cóð�E©à¼œ\i_ý»Œ¤µ°<IÂ-H/Yóà¦_îY~ms©ü�л™mÕK¯ºdpFΩýé^ÕŸ{¾¯öèÈKÌ–Ü`Ø[ýŽ¶Òx•ª²ñ�;úFáÏ*�dä=8rÛd=4ð2·duHô„¹†=i}¬æs4êí9ïÅâÓuòé¡9ª®ðüv‹¶®ì7Ü
ÏI<ºøub/øÉ\Xb¸ñ*EÖ›%ʯÍvºòÌ))좆™-”Çç¦(ز±.33E!êÕR¶‹ŽT6tsõϵ¥µÎν»,ÔOðñ=q
uK�ïÁm±­Å'ô™v{ÃR˜}ѹN¯LÓ_ÄRÎQõ<×B¸y�›¼3L¸¦1ô‰~=ó2/�©ò0”øæÝ$Ìõ$Èod…&8HÌ„4KÆ‚q½.‡ù†Âú*L„¸hv›ÇW¯#Û/Rݱ–U².÷ëQÌO´`®/qï¨YÚúÖ±*gµN͇—ôón[›÷ôãd"2o=ÚonNŽD
U`¨0ã	†*{q/órKN2²Hˆ†b6l¡Æ™ü]ïz2Ó•ÖY×O{>£å—PoŠf«°„nmÀ¯¨\LµuŸÙ̪ê¢Îà¥$<ìuJ¥…G˜P5v=”�À,æzxö}J¾+ßú…Ó‘O”…R9O¶C	,1šFo
+7d0Ã6>›z•}ŸT›‰ÌÂp²¤–Mv¨o”OÔÉç20äîà¸Þ{@´›Æ:®š¯ÁŸ›£C[GÿIŒÛ¬?3Àwš ¨{^´ƒ&qbñŸ‡¤`ÔF�èy7©èè]¹ÒÎ&Ü!!2£äWJñ£ªG¾M
ˆbäuÊy£É
p{ÕÐŒ<®ÜlMüxÃ+”ûN™O­V[N÷ٗtE3^šLÚ±ÕôvN$piÝkÆ3&¥À1Þ„lc¯YépÁ:].öò±kÐêÜ?行V1¸øjÅh„Ü¡âûg¢ÍTó’.0�¸Ú�ƒaš¦­L¾Òä·îâù5mö	îy
+G)$•�ÎÿØ�.èã7áI›hO8×67-ˆ´'‡¤ô%<–“Ö˜²1¯Óî9ÒÀ	®Ù;ZY'™m$�d8㵬2NÇšÖê’ ÊZ™Ž@n?4«·h_Çßò:Ã…‰ŽCQqΡX³¡¥F�´(
cr®=†ŒœÔ¤–3oÙËP26¨,Ë2¤H=)ãeT4ª3¦'ï�0öwàô"û¼d6`›nÖÕ+-à”ÕîœM“ÿrè”6PԉƠ€ÂHÄsÚ±�aWmpb1ÑË
6G[ݧ+Lg AÈÙïØ	Rg{žÇ¤=e–xSßýU�ßÿ}³NFª #ÞVj‡ÅòøbP.C�nèw§oˆ�ŸÁÇ2è\‹bBÒî;שžˆÂÏWÿLÙ˜ùÈäø‰Xôdn„@¶G4"³=¬sˆL"šÏí3 ·ŸyÌ&;Ä>ðä=M•vâ(xªTB|Õ?Á”ÇZÔÔ¬îp$~W�h†À6ì4•F–ÿ"U|;û…õ6€\m.ÚßJ“}¾Éã!¶«¦‡²&ÔºÞwi·Ëð MÃÄ_”µ`m/È‚÷Wá§y“©¡unè5/X¹ÛèvÉHX'–Výó–¢=„ºëH·«CÆ'™Jµ'íPœ¶°V‹ÆS,Ó60ö.m].þ„›‚¼áø[lužŸÐ„; p		WÈL�oKTvƸmùµ[àÓ]lÁl5}úR"QR3+ýY mÏs¢¨ãÎù˜á¢çÙ”^–#«l¦£´¯?¨·‘î¹LŒˆo¼Êë»æîwSHG¡7c48KÔvÓ
+:“eÜêÕ�WNÓł늡¶~’Égt/\ÍÐED‡\(ô ¾ÿõòìò°¦g”®w|›ÃMå/<X¯Ð"‰Óï÷}„
+3í*Í	>¥?Ã0ð^~Æ£‘\¡`¥Ào³ê©Ì½¸d(:â7ƒ¦Å#ã­ø-úliæìýÔt^Bg{ÔìYú³@f}É…* ˆžgi[~^“5«êd•`Žº.zõ-‰3�¾02c~ÃuWX¶¶Òà6!Åéz×î øÞ9<=—;¦Êó(Á½“±ÏŸ¬3×\tä{.-z«e*ð~zË�8Ù©™ÍQ–`…hγTôÑAÊ .Û³-¬Úœp¨Øh'Ÿ‹I�úzð".ØfÞHÁšØ¾úú)S³{LŸ¦M;1œj$
AL�7Ó2ÒÿJä·¤÷;+Fþ¶äŽ4�Kõ—ÈEÞ›¨
|éà³f]Ø`¿'ÏÀÝ2$G(êeÒ™ïȦ“ÂÌ¡Û†¥w0äAä×­Ú¥3ÏQ*•Î˧Lèù>ôx»¼8ˆµ€É0EÌ¡q[åÉÝu>½·2²?„ªÀËšÂÿŸr—Ÿ½Æ�WQ8‚Ávèû˜kEå>?«¹“;…j%ZëM½(�VËðâ~Û£­å ;õQõòYÿèÙy|mÂ`Ž²þãYmðÓ­œ
Ñ Œ§W#’{vƒ+6jŠR)p¶ï <?ÇƢŭ$%|¾½§ÈûÓ ñ&†ëLJ,éŠ	Þ3	LÊ®%'lÑ7ÚˆN02EÜw¦d­Zt››‡0§cu(}Ûï¿S{͆ÁÕ’æ*9pöÕsÔ|ÆQV°¼–!ròf‚T_˜×øYP‚â4N©&
+Ó5NßÄô«O”Ä;"‹’«–6RÌèÂYÛ$U¶ý‚ä]Ú鎎O[ÖÕ¼Tçí¸[S¯nÓmë‹2¶’RkƒRefšNUud½îu×Á©wcÂd%îÙ^kjR—NüYÇÔg�Zˆ:Žû9+Y¿
³Ñ3©ôÛ8ó÷b˜$ðIHîÅž¡ ¨ÕºIn•¿bAa`ÐKþMžR.dÔoÕ·D½o¬.Ü"Êw¥iõ™ù‚<:×ÂùŽuðó"ó�çÈ”bmñ÷r[Á]æy8ÔnŒ®P.9¨f¸«ä­nÕk±tk°Kq)ƒ×…µLYå(�þùKwATƒãú]õÅn&sX^EѸ­ €àP‘Süz—°�³3âQ8ÓuÆI×OÙçªØëb)oNñÕ5’Ý7NøÁ"ðƒçŸ�\Åó«×µ©ÃK+éd#¡Š	¥7.+~Rˆ-
˜“ï
1J4TNMR»ôD¥ÆªjŒqÊîšÝöñ+ ˆI€ÄœLå	bã¿Üm
¯À¹À¢±š:eMÞn3©“Ûf³€êVÅÎ[ë»S9}ïêz¬ÉXž¢$ÇÑz‹]q
àlÛ?/€;¶r«ìcàÃÍgµ¶(LWjÿP¼ÓýCÂmý>(]è?»PÊÏB±•¥¶ÈüþN¾ólNH.
ú…†’ì»ôaS$í±-|rS솂Å1êÕøh›€Qd#J”8¸©?±’ϱF†J
%¤Á�ZJyžÛAÜCù�¿§ÚE)m÷Bƒ�㫢按%39^m¶›¤¸M°óˆ�/‘s¼$Un¼O¶å!<ï_mÞ³™RUN)ÊZJçÒûEò�8äWQÙV~ùŸÚbÖ†¤=…WéÔìšJ j5OXT¼˜Pi¥1ª«žÛëlsÉß2ÖØ ¦�¸W@aÊkªZ™±{@È‘a(qCƒ&^Aå7H~¿î„ºP¦ÞØÎAWf£×x…ëOZ—ü®#Ž1©Ÿ Ý඘«žrt_Ñ5vû¹'xûg5íéR›ë¥ ¢jŽÛ–ÌH½ü9–K®ÝY#™aÌÿ}ü
+endstream
+endobj
+7136 0 obj
+<<
+/Type /FontDescriptor
+/FontName /TSKHNZ+NimbusMonL-ReguObli
+/Flags 4
+/FontBBox [-61 -237 774 811]
+/Ascent 625
+/CapHeight 557
+/Descent -147
+/ItalicAngle -12
+/StemV 43
+/XHeight 426
+/CharSet (/A/B/C/D/E/F/G/H/I/J/K/L/M/N/O/P/R/S/T/U/V/X/Y/a/b/c/comma/d/e/f/g/h/i/k/l/m/n/o/p/q/r/s/t/three/two/u/underscore/v/x/y/z)
+/FontFile 7135 0 R
+>>
+endobj
+7137 0 obj
+<<
+/Length1 1608
+/Length2 11648
+/Length3 0
+/Length 12467     
+/Filter /FlateDecode
+>>
+stream
+xÚ­xeT]Û’5ÁÝ	www·`8ÀÁÝ-¸»w÷àîîÜ]$û¸÷õë×ã}ý«»ì1öªª5kVÍZk챩Ȕ՘DLíŒA’v¶ÎLl̬¼E°�±‹“ÐVžIÔÎÚðnäD¤¢s
�Áv¶â@g/@d
+™ØÙ
l<<<ˆT1;{G°¹…3€VCU‹Ž��ñ_–¿BÆÿô¼ït›Û¨ß_\AÖvö6 [çwˆÿñF5àl
˜�­A1%eE)­”¢@
+drZ”]Œ­Á&y°	ÈÖ	D0³sXÿc
0±³5ÿUšó;–ˆp²™€ß·�ÜM@ö¹
ö G°“Óû;ì0wÚ:¿÷ÀÙ¶5±v1ý‹À»ÝÌîoBöŽvï6ï¾w0e;'g'G°½3à=«²¸ä?x:[�ÿÊí~wìÌÞ#MíL\þ*éoß;̻׶u8ƒÜ�ÿÊe˜‚�ì­�ï¹ßÁìÁÓpqÛšÿ‹
#Àdt4µ99½Ã¼cÿÕ�Õ	ø/Õíí­=þÞm÷wÔr;;�¬Í˜ÙØßsš8¿ç6Û"²ü5(2¶fv6ÖØM]ìÿés9þÝ Ú¿f†î�ÐÔÎÖÚ`
+2CdQ´s~O	 ýŸ©Ìü'òÿ�Äÿ'ÿŸÈû¿÷ß5ú/‡ø{žÿZÒÅÚZhó>ÿ¸`ï7Œ@ð×óÿÅmÀÖÿMô¿j�þÁð¿‘q¾·AÄÖü]
+VfÖÁN’`w�©2ØÙÄ`´~ïÑßv
[S�£5Øô®åßm0±qrþ›OÝlbeûWÓ¹xþv�lMÿ�ù»<ófQ”Seø÷Ûôï(åwÕ�Õ=ì߉ýG
+v¦ÿ¹øCTÔÎàÅÄö™ÀÄÁúùý°±rx>ñøü7ùþbû×Z
èìv|y/š•íïÒÿãù×Jÿß`$lMìLÿš5g ­éûhý§á/·‰‹£ã»¢Ÿö÷’ÿ¹þ{ÈA w�	â�%;¾ Ë´oéε¸9Câ_úzØ †‚íKÔóý«íºýÒ¶y*Œžk‚™§x_[=Oí_öeéFz>ZÓt§€.óˆ|(èzó16¨Û?3°” ¤ŸiEy]-ÈoAër±jìL¨¨?ÃOµs8Â_=ÐùS¸æûcSÞÛ£úš¤ÖÇât 7B`ÖœžQ'?ÜÓŒ
vßÀôî2dÇ"Pñ
q}“OÉ’œ=ŒoL^ܘªy³ƒ'ÉLúF`™k(‘z(¡D…‰-.õÓ8¶"LšV}ÄŽNdÙ§ˆëô]ⱚ‚:GG
{zMnj¢øS…ŸžJ�Y:>“e<$	5šmB©9a¥ø£DÃM-7§¡Ì½£ßæ>Qe'ùZ°§sP?#¹"˜khWK!á?·yéå]ý¶yUȾæ´ÓךBbBÏ‚ZÝ{>×™šFåQÔ½•öulaj›NŒùhß$:7OVö|Rî(%â’R^‡¥O›ЗÅ
©.
+×m H|[øëê2G4·#‘;gŽÌÆU<hwÁõÇÐSêÿ¨>-wêìž…=Ú<†xBª8‰T;?�7îñCÒ¥OÏ»Ø?>KÑþ
+¥5)CÄZì›ì';;¤¸¡î­´ÃåR²
¯À.Á§=ÈÂåËŸ…�¼f!,Wác&!¥û^Evák:È#è¯õ^U—#-0ÿ+i„Ñ÷¡QÐ:L{å—Næy%lhŠœ:ÁÕ ­¢zcé1½Âùß)µe|à2è/ˆëT�'H
h´¬ÞC÷o,…¹–6gQmòµ³\«p:B½#m2?ˆDY$	D³§„›G¡qÙ?˜ÿÈù“÷XÑ�NJ¡Óu?ôgP[/”c¶lÜC åboò&2ø¼“�pª‹궺’Äç„gÕëõÛŠùÂ
³ç~·™&÷ŠÀÛ°€ƒÊ,1jD8WÄVŠo‹ã‹÷ÁŠ-Œ n©Ÿíù±…H¥f®r߸",}7!%€d£.&-tÜ7†w»kõÓÄŒh÷€hîTÇÁ•ÜÙýâÅX(xzNŒé‚\¸™]šÀ¦D"jÎVŠu z².fï©ÆzÎ¥‘º}Œ	¹SổHûZŒ‡t0!gÌ{܇,¬ij¨}Í.›kÉ�®×ó*§„¥DMk£è£/?ÊšR‚Ù¯+pßÔ7`|[<é°°zRJ¹kM‹­ÒFÏ/ÒÃÈžÎùJ ßGQGFš:ñðdÇÎå”9麪6ƒÞ?ä
+[,y®ú牙ztE±zL®µ‡¥m{³�%æ6%¼¬Ö¯älOE;¯àdzÄ^‰Áé[ŒÒï>
n¢WKÍþ)3Ïà§ÉSžq˜™O¿ˆ(jOÐÆŃ*jÇàüÓ@q»i§†pFcSñ	«�pªÊo„Û±'Ç•kŸìb\’ˆ0«›‚o¯™_e—Ú÷¸äf‡”2I1pã6œ—8Uaa‹;R#AMÇ/±kÕÔ§Æ{6P¸¦é†ôp<ìËýPPwùVî¼’S˜“¸ŸùÐ)rFºÜn…Ë3€›s;›Æ-ç»Âk³ë‘{_3úOÊÇm?êPÈRs
}ð’¬IÎñÕ	>´äýHrAšÞ"c™3]‰%Ãô*DÖM„L¼Àþ¤úù,À	5G¥Ù(àJÑqîçYµ'ÄyÏNùÒæâÀu‰í•�-Ž#zA¡¥,+†C.Ý
+ÀSG²…’e´•G#Eýûh I…UßMé$�Ç£fÚO«­Ý}²‰éªåC1ÓÒ)-%&sUž}èu
+ŸÂqM¹áz
�/Ä+¹MLV=â¯Hs§i±õx‘u5¦Ü'`ÁîÄLïì5Z½PptL=ì´öJÌ‘,âöõ5+JoCÇͯ¥f¾ûCè>
66²ÂÉ鋉@¥ËÁºpEµ Ôt³Û”×¢ñ›5?.‰ŠÑ¢“WèkMÓØHí€"žœšªxU¸<19‡ Æp±rFÞm�G0�o�Ý(‘×Õ¡ÇÐ[‡�Î)(,t>3:µ�N$ZaOßV¤,®tmÜ��ˆPÏAŠ—�Oát1Di‘Ò¶™ë¥
+ÇÝp‘…7Ãü¿#Û
…;Q�³�®P=‘Q;"Æe“é³æ/zkw|ý9yòªHÌñWžtª£\£
¬{œÈ'Ußhê�Xøv
aÜó„“
å³¼˜é�‰
7eŽ=J~0�ÙÊtMÃégT{'¡ŸrÇd¿*(î�©�EYK„‘‡OÓ«&*5»*qjžžµÑR@øÞÌŸ¡ùuðų£i8ë6J`mž�–VˆP¿Ru`û/$µLž×«å³>%£Ü½½üj©´Ìýù¡¼8NGˆ¼ÏÀ¶lnÓ¾¥=qbòXd®•¢±Ù{â¥wâ`~™è^8ÿ�ÂŽÍŸs}h¬8qó�A§¡'<@‘A4jï}•2CgQj‚nƒšhÆ—Î_[`mõúº™ð�¶äiµÌzlK-q¶U°²§wéG[$-õbYz°i+ãTdXËND‘eÚ£+9çJN‚¬�3£[:õ®#Gùy4Óv50»:ðò²ŽŠßñðiÑ�;ÃÃ…_‹·.ÙSëP\ËÈ[`µÑè>»ReS… rÊÌB‡}ÐZâ6œÔÅöGlqZ��7¼6ÿÕfëäÎŒ
+Œøa®€V‹�wÜzFV^?�ô~EÓèã|XŽÈH�sS¼]|�¢Ó0û
ÞSoMSš–G
+GUŒpK™onÖƹÓü‚õãV&û%¤,@‹Bï
+)­®§=hI†lý(¼ï|Z›K1�±¯ë�gî¦kŽÖÖUAü'œ&Zý†ûǃe€~›·Yý*¤ÿƒ+Ë]q¼Yq­Í[pb~L`É�|µD}ZV.´+ÛSYàÉM•][M0Ô)œ	ª‰h?~Ô
´Ìì±8]åÜÛº»58:< #ÖCˆàOÈžªGê½.¢@¸ïŒI«7|– ,4 þ±;="Í׆bLQ¥»õ³�Í/ÕbÒB�÷<13CýÐFzÎI/Ñv�„F°~¸ÈÇ”V—ã¦ÒÌs†˜1ÌãQ£u°É„ä?úÅgNj*BàC]Ž"cUt§}Åžä@žôÍÙÝÅ+“–ÓÔE^>éõ÷\E=,yü8XmººãW¾w,M~8Ä÷‹LºZà­=
A†PT�æß¾â Ò#�«|ÀZ6mZÞ¬
�ÙiËQŒD­‚”KÕÚòS½/÷Ei*-g›)’Ät‰ûb¦–J‹T f#÷š”»Ò.ëÞl�ÕŸ¸ßîæ_,yÕéët„hôhaNœ$)AU]¯ÂKp&8:ñša%ðçýšÅh)Ô:QƘ[U"~è6	ª.°cÈa¦½gÀtŸ×µö›Õ_Ou„è­eãÌ-ÏÕ‹u‚¸f7}qöSÅÏR-ã�¦GTωù¶ËÙÅ|£cðiàÛ.;]„håâò¾ú½áÆÞä©‘­ùVð��ô;uxïnJ
½Gû�\�±…S'#Õ	¬¸‡ëµ@‘ÛêìSF:ÔàeŽ�aV)}U=BŒN¸5¿£�Ñ¥þö%ÑUÉ~9¯WA�þÇvæƒ(å¹cArÊz~‹fï\bôj	ì–¤À‹èÔ¾÷¤"S‰Ž�º{›�ÊZÿOGˆâü7ý—¸?�†wˆ‹(݉<]òî³t«dY³iž#Nꦈ|T•Fäu~9€öÑ	²ôø¦ª‚Wp á{¹}u?E“¢}¶â¤E¼Áß
+ib‘Üݸµã^“=-Ô¬œ¢ƒgq:¼†ZöI¿,Xıˆ�|wzý–A§°ý•7õV#l÷Él›¶‰ó×¹ŠÓ‘4£‡‘QGíUµ1kå€ÙÖ™º­yqUŽ\þ7RíîDIr}Ü RÐù"ôˆ‘n
½þ˜&Ê÷–)ß`èá–¹wªgãìëÀ
%»ÜHÊ¥�YF~r¸ß9R&™˜R5¯
/)¶Ös�sG^ð‘„Øeü·0Œ¯¦Œu÷ýJ¿qÿÄ|Å+7 MZ)ÇÜy¹[z3§Þ€ÓŸ„±ƒ¶Ù	å\^{ÆP£Âû½Ö=Rxj«†	÷Ã8VÁ.]y¡.8¬%áaœfγ$t-M² žµøö…˶0ãÔÙcŸÄBˆ–tzÍ£Öò„5Ö
+¦u%t$MħüVõó½hèmkbD€~ÃD+,iJpa‹ÞU#Âè²
TÔ§g”Ù72SZT”s,Tœžq jØGŒÀ#ì�’wüHwsô›# ì,÷­¤%²_Äã‚�ø;8áêcK�“ÎI£)B³#·éWåç&†P’Ìâû¿ ©Ð¨ôÊ( r9² @L÷W˜Xæߟcrº‰V
<ex§n¶öÕž„ÊE¯$f\á̬Ý1 ‹c�|Ëwu3?Kžì“`¬G•¢sdS#»>·,Oû…y©�«JÌ@µ)r¹`ATä$ÇÊ‹#}©LC~3ëÊÊï$4ƒ@Ÿ°óœ4À'ƒð2j±Ý:)J¾ˆW'”:ñ‚ ×°'e¨Ú
Ô2�X]cê‰íõêBÍì}½^'§†h,ß@3ເИ(Dþ\¯Bƒ ¾fz¹}¦õñ>GSè±£§±µj/z¥\†î´�â�Ž‘9Fh®ËöufLÆ”Êã*xôâ°bD;l&«ëë-(Qvn‹ŸayÓÌtÏD‡(ä1ŒÂ±‚΄A%q¾
0¥$‚±Ø·¾´›aPM‰…-ãôÞY7X6ržŒ|å¯U=Ö+³ÔQ YåÇü<D¼StWo7’bˆy¿w?€…Æ„\+(Ó˜9¢ëê9cÞ\™“\'ZÃÖÍ{ëß-30ØH¢hY•+ç4άØñð!hpçÇèÞ–
bó
O«|ór17G¥.âÈ[W-²|d
÷ŒT_FããuWëÝK
Tí	•†Í(¡äµ÷%6¬Ù�O»8ºúKŽuƒY}´@>t¨…0êésýykÊçMGbÇy�Oô~Ò×>ìÈ‘¢å¯ç`šÃsÜn;VzmÓÕÞ^Ê]ja2Õ	¶I5³—üã–ºƒÚ¥l7ò(ßïaÃæu¾$H‚ëì€/N'=)›$­•K#{ß1¹ª¤6x,9ûÝE–¡R3øe™Èñ˜¨vi¾ÛتNsåQÀúlJm´¯scÓxq0}~Z2øƒ¡5ðÞW�‹´,—qÕ¥DYiÉ,kxçïK­xÈ%ç•/¹¯=YH{³×Ëo¤V¯&éÁ‰ÏB¡›µ÷&4‘TLGa¹­fMõ}ºªå‚3¾\õÃ#eÎ(Ç©À“äü6ætÔ»›Obe8h²)�Ìi\KédŠ¨†U‰U……=3ô¡¼¨÷hD•Z)áúÉÑÙRûœµÑÑÌ(*“ݸW«ü29Ò¥ß"±jÈœnìIfñEô\ž‚¤<ô¤œkãxè�β�½‹×¸®(�±Ædb2óÝÞµy'~g󚬆ZÓ×,­?zäm�ôi$÷Ù¢5»È©J™«ãh¨üÈB¦¬-´göŒ¯ •µ¬÷£¶í³ð±-UDëÏ•Ú‚ºwÖÛhLÕR�é%?H<èi°4&×�©Þ¥Ø_ö¶ï�8tá÷å~*îbùÁÜQZ¦j�æ$®(ËxÒ÷rVZôî#u™èz÷šß,Hçø:¾a÷ u{Lïýù·“ЩÌEX.¶L@̆a[X½ÁäÕ‘­
*Ódˆ–ƒß�–ˆ�è„|ºÁ?Hn„²"¦¦Lqí‡�¾^K+_ÂW­„˜{“ÎäA*È@9pÄ„´§HR˜½.ïSõì"\’ ¿Ça>qÚ À¬®\]”±Ã[=¤êkÍD…�Y24_`<ÀŽ¡vÎ6Ý;:c ½c{ÛÜ;mui�€„â¿�úÜ3ö‡ŸÇ#I.3CB†gzàc8ñöÓüˆ*¸Ž²>Œ®¦Óß¹·=Ï:‚&‡”uÀøA=½¸ßz(PµÜ‚’èψX¶yu‡Ã}™‡Ò˜§äʽaÕ‚mÃ}»äÿ
+r*'úøܤ¢ç¥Šwæ9Œ¿wMpKš§€^q�ÞÉÌ�X’!î¢Që’÷fÇÐœV=¼<hŽÚ¾�Ôu!\^-Æáþ‚>Öu!{ªÁžH$ÏýT}Úv±Pñ-·q½ÀqT+†.쓹%×�	]KWÇú99Â
”›YÉ~�ˆ–þ:ñq½=ɇ‘Юƒ�¦éÎJ?òpØíãîX¾a+³’…’ªÆø±oVÐQ¸<&z	óسPÝ.wÒPC°…“nh£n˜ûË«¶WíVÛ±´…Ò“±�¹3¾<¡£ê¬¤¹”ÒÈSI/÷¨<A—G‚’;»cÙ“Ì.+Pl7…¸ç´a¢L§k“gº`(w•Yož�
+©Òbê�£çåÇçœ:üŽsáj€›CÓ"«Âz\íº§FÇMÿ±E*cEÕB¹Ô(}pvû€š…Û§bFòyö $$ØfâÛÖ,‹b‡8ÌiK7‘îAžÎÊIV™Ê&•Éi“ûHiDÝXϧµËŠg$fdÃë蕳C÷šîº
Çëu~Ëa+õ“šë+:Ö׆�N(xXœh8Z[C.e?Çú9Ëéú™f€]ö¼‚
+~ë�ä)ð´ÓåR[jÂ6'mððñO·c1ØX�Z·Ó¿LäbÝPà5Ð�²­P"ð¶_›617ìSêæîL�~Óm?ÊÚã3L4A°Q,âøXßÚ†:Ñ…ßÕA\yB‹�³-#‡ðŒòhÕÖq&ë#TJx]Ûþɉ9Ô2ã/֩ܘ&T·=ìúõÎî^(•¨Ð���evo™k“’5—Û×
+pÏ•®ÕÖvw.O0ÂZFGŠ”Ó6n×õ�á“–�/F5À:öÃym÷@IXJ~cMV4—€6ÙT[¶u¡‹ª�öø%ŒÖÙ*‘Öv~zظ5cŸLJ;YÔ­&™Ö²
Ä›FZ¨/Ì­!g¢-®µá�	Oaß™„¯(¾��,BFÅ6ଚä8&ç•Í@©¾ãÊÈ…EóÁŠ•ú˜7QÍ—)¨õ€T¶¶ëd„~²ËÊßë(¢'tpDíŽ5©q»Ù9éúÌ5BqqE�ºãí3vN³]ñÿÉ�•ÍÕæþ6J¼ÂÍÛNq(rt¥©L�0„·ÿ€Ú­jó3RGðXí>Q1Ño€›í�ÄBbûtÈá²YПÐ
¬|ǃÞž!ï~¶Â¬roÇ8.Z·ËŠÿ°H¾
+%²:®"¦I\¹«©~É“YàDùžê«nëtŠ3®‡LPÜh«z¼ôÜÿÓ§ÀøçѸ5•I¦#«¬vjIYx
Ù,çÔ}'$uBkœ_áàÎ÷±p«Ä‹Ä¹âA·ìÉ´µ²8áa«¶U³zXR«™ÞmOHì³%‡Èmûf¶KÇ0@‡Õí›»ðŠ:Ó~à£]â:
+c{ËÿJ»ºw¹ ÷9|²	üFÞ ãk­N.~kº).&d¯[w"nLGµßæ:0S挽{{yáeÞÏf´\['?ÃÁ?*,{ÛnÍ”ç
+½FÚS/4üF½«ƒhë~û[Þ†çUc§¬F÷Bm§›0oü寊
5
+¥+ã.¼ŒåÎ@,n±¢U|+*n}°¿qç.ïïb|™ct‡tÿá4öúsœ¯C‰ú2|ÿѼã dÞHíä"ƒë"ÚØ�/Ð|Æïµyî;©a-
f8ÆSmv{
+v8	Ïæ&V¾�$æžON
+Oy¤â¬t"Z@­Ô)ºh€»Qˆ
꺨EÉSñ¢›5­DkÇM†Zn�+2-Ô:’’Ñ>þúeƒ
+Ó(¹	‰KÑ<÷xNªÁñUBVØŽ]“ü\õAç”Ä"¤6g¢ž#m
od™ºJåŸ?Õ¾à_åÞ¾éXc&Bú;:Ú¢v|¯ks^J4cXqÔ“šTõ˜¢ÅÈ¡(ùì�—ÔçŽæYñä�ù¹¬HÀõK4×76›¤óŽªoËŽ“&Øσ|»Þ—`;‹˱ G76Dm_ŒåÌ‹¶ÈËWÆEºÛFµ€_‡‡…38ÀØŸ$‡ÜŠc·rËö‚4�éŸ}ÒTëœ&p�º3ÄsÖð…„‘‡Ë>`L³
+;Y)N¥Üý¹ð+¦¾'|õÚ¤	ÄfJ1‚lq·ÇŠ€ÙÖ!Ca"“°DOsÃ:kv]¢YH_%>°�b…$—ùz¶ ¾`铃�ŸYøø^>Ë£Æ5j�‹:pÀ®É¬ôP²1©&w£Â¿Ã|ÿE}Œ–žàVi7?
_4ÁYE@›Ÿ~Œôߟ#½­ÛB`½]©:—¸݈³
5£bŒØ%ë-n¶ÌšhZÆ%všèµ1Ò¿Çê`ÙÄ^|»
+ïOá^³¤vã¸ÜÑ[ÕN•ø‚Ý÷ê«zž»	ª¶!bì§C!dFÍÅ!'éºm=€³êhf³ñ?i9úúG¿eÿ„VÓ‰ƒ—‡Ô¦¡&¯[Ãw¼ÀЧ¢$aé�bí7ŠIÉEIª ‘°V­Gè.)Ö1B/_wÏ—ov‰Ñ¸�	›ÈmLLÖOQ÷*%QÚÓìžžrŽiZ<t°ñá‹ÁÄL!´Ùå²[È]F‰%“70…¢SÞœÏÛ¹È(RC¿rCo»ÈÊPRÄ茜?Š
˜h«to^øMHe�šŸo�{ø¸`µ×ï=y.ïœ$Kf]£[ÍQ¢y‹-¯…›…Ô3™¨•80?š-CìÛŸbv¢
ŸhÀq!í"늤¤”²›XýÌ{hÑ~’’
ƒK_tÞ1æñ[Ò‘>4×tá
+ì{Eøu5@EAˆ6x«S¦zËâ©ã?ÐË}F£l§Ç?o£I¡ßûò)¸¹w«»NqÁ¥ºþÓª�®æúødS|²~µ¡'°ÀHͳÂá&^¼“Ž¾‘-k.ïRŽ`aJO½&)ñþðFp$|Lãô%/‰o±“øŒ2RŽçWGfÓé ¯ãm8˜ªIilïŠó½æûz×ëúK\šƒ æE¯Œy0:u³p°¬Ï@*m˜‰í-‰êõ4Èj%kÕêRr séI«Å©˜"¬þšLX8’§Ç§¸PЈRùt!=’£óuómÖ‘¥"í¡n|sC3—�3»ƒÎ…K&¡!ÝÖþº'‘ç~Rúz­"•zŠ=pØ8ª®Ÿ’]ZEãñÙ3b>¹0ô3÷�*0x�UÕy
[ýW›ÞNu~Wa¬hÏ-ÐS—÷PÅz–W�ÿ¸^n•“€vº°Ý”¦Óï[b!ÞÆ—L™þóŒ
SŃ‹aÌúµw
R¯ùŸÓs5bÄ:¥t‰Hñ2XÎc¨ 
ý0>¶÷+|R¨™*Õ´zsû<†S·ôSGhB˜6
+¹†ðÏž[EÈ<ÖkC¢úÓE³=�Wº"×bFÒ2õ�}³6"ž¥%H#|j ?Èh;¶˜Ý)Äë¤5Á
b‰›
+m;O5ñ«…£b„`0FùzýlHpu,t^èºÏ;ªY—Ž/£	)#wë—Xé.œËô¨obY«PÒ{ŸTh‹âwaöF†tš(˜ˆ_ÀÖ³nºèÃò‹lâ%Å7œøέ`b³ÖÎ]OB,šG¥„±Ÿ/˜Ýþ†¯žÔ»Û·ßÚy“ÉK5ï5Ìg~Œ€ìT2q"©·[•›ìð¯€v„ð!T{┚/çÖQÞ9[‹ßÞ é~¥¾gD„ØHr¥ï:^õ4^9—ÑéèpÞå,+/AN%
Ì
+`?­W-ê%ýV¹Xøc꽺û§T`æ’Ø1Ú6…~È!Š%Òˆo 2®yI·Û¡J{»WaCWèù¬Ñÿ«
:AÆSU=¥Gm±ƒ¼õ$*ºCîîé�	7Ï#†*g;‡zǦpAèRJ¬™H�,ÓJÁßM<?Yã’¤�xΖ9îϼ‡¼ßü�{
”ä¾^d@üEKÅF§å^p÷I*[ö•ØD4×:áR©·Öû&xE–ÙwV³_âr,›$À˜I%i³×iÊ­‰ØA+”ó)‚å7i#»Nv­„’�XI3ˆéÙîêÛ1eîy.£Í°{ÐpÃFB†�\x"Czž�ˆì’!_nÞE—I1žS PÖÊÑ]Ç\†£ì>äÅ>k$»¶I R)F%aÓ	PTrGµîXÏê§F}¸Rx0øUY_%K9·{óbb­M8ž›«Lv%‡H…&¦”[yî'4và5ѹ[Y‚âþØz@b‡jÓ÷ŠÕÏ�ìþÃ0¦_¦b
'Xã8ëÜh�ü+“ÉeΪø³Âß  ݦöè`�ƒÍU5ãó²êÑ1œ.†Ï'yë>HU…D•6‘pèòµ)ÞŒŽ7Ê^~-úÖV8(.òÙ=;ÃMû<WƒG%g[!.}ˆJGžxrï˜t–ðòÛo¡çliO-Ñ÷x|ðþÕo;‚©L†`‹q*â­Î|«òË<Oy|˜$Ñšt´œÍ@ÖŒîïÕPUóH‹!ý<ÕÙ	!.
D	ˉú?^VÇHííEŸ«Kj\üÑÖØýÝx—Ñ5tó–¬—s¶ZÑ$¤ßUôÓ©sFS_yÛ1÷qÝVÁÞMY7ò@H¬YFù(<,5Ëع@5OÆNɺA=¬½^˜®¨ù­Dš™ú;IJWš—Éx€½‹ïÏ&hX¢xNÞ’˜WÎòqðCM7¹Õ'O¦hG[�Í‚_‰�â&¾¸›òªˆÀŒ wË;ÚLÒÔ!PÔyõQ²,aÒË<®¶l‹¬—GßdÈà‡â…ëjjrP×Ø\rõÚBÓŒ§¤"–VJ’+„a&t5zÈ~üLúż]¬í1ŸƒÁIÕÊÔ	;ƒ=�hùxxõ‘�¡)! j.2ÇL{›*øAU©Óü,yÆ(OèSÉb½æ�ãÙJ;1q™ÒULõDް†„
P€m\rÎÑœp¤—SòŸð^†ûHÌCFï;Ôºý�£SUÏó2D0[EåÆÌ@ùØXƒ²öM�~ðcÅ�ºQÅoÖçùŠ…Ñq-'³#
ÏòO¦½{ÈË:‹¼ĭõu8Nt:;oc2ðÔxúlBNJõÎ]w¯‡5HéV‹nVŸõìª5ÖYèsbÿ¬©�à ±‡›³�Z´B„	dpÔÕaºPZü®T6ÿ�Õ“–‘^ÀgöÆÇi¼}Õ~ÄÝÄo¡BÐ`!ÍæÊ~ö_Fš;¹F—EÞ¿2èKïÄ¿`r`”™þŒdêã¶ôö)ý¾
O…ÏîÖ¶:ík¾b…ï’VcÚçâùŒ†I|õ	››x8+ý‘/´pÞמÁ*²°’ñ�¬9HÎ󚕽ô�æz:ûU©¦�èSÈ>UJ‹®?Üö¹Ûó"r4/ð¿Ëçe6Nø`À 5ÉŽÜŠùrÎPŸ{ÚŽk½˜‡2Þ«à�p`$Îŵ¥b
Z$}h»‰0¬}Ã+p}³ÃjÂÒE;yÖCÇ<§CÊßc²ù¡ð
XˆJÚu¿ç½3í­V˧¼EÌé{Ç…7ëÜÀ^§ú %}w¯ÔÙŒ�‘¦©Ud�IYB®'ÌJm
…±lUìF&¥#è%éÖC\êyÂ4Ïâbž´C*ô¯f˱>éPoŠ,·ŠNÀÖ„\Ù¥ayŠsÅHvZ äõìÊùÁ#ñ#X™EÆ�CÄp%èÓûÏ$:é¸{ON³‡ÆÈ:=<»5î‡<®'¸Dmo{ÒEÈ??—YSجž<×\]RcmœûÈ#FÎÓ*#žf±E/«ôS+‘0�äò×2 €òO-EEQ[/²Íì“ “ÌŠÎz§“bdÅ=4æ
;€E•
+­6X”äj wDhê8¦xrÛö¼»6ö¹CÊn
AºN®@«’ÓžÇò)x77Dy[gáe»!P¯ªÖ<7TDÿ6õRV?ÉÃ�fy)ààv‡ž`¢u§ì�?º±s@X¹/µž
õ§œ*-ÕÓZ‰¤�çl_	í·à&ç='O2 ƒaèftgqJóÔ÷,m6Ýê=«å
+2èAc»
+«ÅÂɺäB*Ø’�ü$èy"Éu¯/Ã�^úa3~[¼ùߌ‰¶>ÜÚÞ‚Ý®‰Ä‘SÌä«~­rI
9ˆ�þÍ4Ý=�¶=CôI�³’W
ºû­ŸöV1ºo3©¶¡OÞM6R©+ùòK
+ìÈ ÄÜî³�/zÛRwÖö~ÎJŸ\xÕ¾Ò°³E`o�-¡”‹¼Í¬À¦M!ÄÇu"DàÔMÔ4‚´ÞªNâGŸäÌõ²øgƒäŒúKT håTîkÞ…ôg,KÈçKnDž]\ƒïrrŠŠa	¨16%á²ÆëŽ_XzW©ä*®�ûÍô"²œl—÷šzi¦�+ðV
NÒmÛ+ù›|,L	ž
êˆJ"ÄR¶¸ãª9äÆõ‚°»P¨â*É÷¢«5¡„÷ZËAôùë<’ñ”�íå—Ä߸Y»ù@¿éŠf³Ù^g(?]úZ‹P*'Ó䞬ªB
ü’Ôl›P;ÙMW�}()²‹thýC¼Po +Á_Úi— Ô#mÉ Î{¨Î;ÍК�derÊZdRÝ©y“ƒP.÷xyš2›¸µJ�”7Þš“Æ•°7´(šdôÔ]µê7rÕ®Á'VBMÖÙ5&¸ð¼þ#c0•ÎøVú;…ÇZ5A!õ¹›@#¡�½^w¢vW¾Tƒ”š»E_)™+*Ø^�€õ�ØŒgk»™cò7?~j†Ë�ü_é`GWú[|«c�
Æý4Ѧ9fy‰õñdÏ\°¸üͲúdÍõÓ×B"wêÖç×TeC´»Œ­¾ü0gþ”A:Îôã|Ümxêkr+,pª¡±+ÆÔÚ„vµ˜¹ÓcùÂ+ž `k¥)šP�yO}û9ӃݛZC�ðÞü!µ\(³
.ÛÁ‚ÝÒÛúö;å`9eaà<ýÉÒaÔÇJÄêêeì„áôü8#•nÌÀoPrÊ‹Qèij$”ç-yâ%�ÜÄÎV‰•[6T•ÂÈmŸachF8dÂ>œ²³D‰\áP¤‰ 0K
¬o#J1Ù%v,Œê,pwÇÞ§þ¾\æš*Ÿæ#ež�"§µ’EòñËIËß�z†ÒŒ®¬_èù­Í�ü©ý6w^h¯OóéŽZC0–·¿¼ê#ß$¿àÇð.9ärBr�ßû)’øà+Š�pßÒ_—$¡è'B	ìk\•Ô/÷ÊUæ*âÖ΀ª�„*ˆZ"ßSO‡«_œTà)9Q¦^FFþóèi݉§! ú*m{Ū!J¾ùé8'_㨴�\ynA/¢®iGhLÃåÈÞÔù†ÞD­¡ÊK_n²k/¡ 3•`´*]F¢ò2µ™¹°WXüÊ¿\Lû"¨§''+¶…1Ìš�õD¨Àp{÷Ý_±8óÅ®ë£�Í$¯Ê
+Z²ÏM$JmùïC^74ÐÖZZi¹Ù³×û"H )FKDŒ}h‚}†·sªqx›5ïûçke¹¸|}Ç0’WûÜž—âÌ㚬2Z1ÓB
+¤P áMÁ�&vf‚¾/]|ö¼½´.ß!°HC㎯ÒT‚Ò|�“·¼1d�LÇ;ë~ël6ª3±ÉJä�3{5P0wžÀÆŽ¢ô0<õn¤ .ÉPÃ2ñàí!Šlß	X�E{ÄB3&òï>C±�ºø¾Ø™C}óþ‰÷ÎTÔ„]ÚÕÙH^ô㉣lðJ�nã~H;\àéz�V(óg¿·tOÝÖ ¡Œk
{'®Ÿx¥”ü“B³}£Kik:óòC‘ÁŽà‘V/ZfG‹oÊvra3{„ÉJìóÖ!ã±»øÔJ
&Ç2›"žXIþÐÊ‹4
+³A:&ìí‹g:4oã¸Âüï¯ÙÉúè¤Õ.*Uó<bI6ɤ]±´“
‹Ø¡“ÁÆ]Œ¦hoüTQF¾¥õ×zM~ùœã¼1#“Êá^öîú¸­í•õ�˜ÞÚy0”Ó¡|{~|»g¢u:ÏI£/¿ü3ˆê¾f®]ú«Å±R�ic®ê슚Ž¸÷WRÉלû†ŽTnعW4uåL­þ\b2 Ú†›ãaSGh3îfS¡d$2&úö5Ô"%°3–>BHŒÓ•OVý#1„‹ª7Ò`pà #ÿݧí\#ñÑÁŽçèö¨^ý‚F¸|ÁŸ �[éDë–®ö®¬»®_*µþ~^ƒÙw)£p.Åèž&ýÏ=fGÛNì®%¾yŸ“ûíŠEšjÅTCXy#³��².ŽWp¨²ät,éÏb°º´´ÝUš)?ŽÏÍ»ª¤Â‰üÀ|˜Šë"1†]À
ÝLA}GcõŸdsÐS°½|`Ƨx†5‚Œ¹
Ÿ
+ž2“#ôôâÈýðªï>ßÏ…R82l³S
‚f]Á<S!Pµ�£¤®ƒ&ÈI¡ËS‡ËÁh“ñ6Ø–W(	½ØÉw5q-ì]F×ðÓÒ¥x(ìª?MÏ7^è¦&qƒ†Œ%(vèßæÉ©Äþ¤ƒ‰ä@ÿí¢¹tÒÏn¬ª¾Ð³[Z‹Ì<®ï}]ž£Ó’Ï4Gÿé[�L
.€Óݵœ!4UX2”ŒPQá·¾>öv«ƒB‘Òö‚ˆ4½ç;mËÖ»Ž%":äTkÄR˜ßkRN¾õªéþm]
ç`¾ˆ¢§Š7põ…kî‡ùÙ7?+nV²³ÕÞ6ö-ð´7îØôáU�2„�»{+r¢BÕþ™ƒø¹«��vvD
’,SŸ\?˜ýð(ºgy¾MMáëÇÿ�Ë_¢Í“P͉Ÿ�ÿ×8‹ìño¥›B–Õ„ªG%AF8çã¯Q¥ÄZãË^Ó’WÿEóV·€·mü1±9Æ•vmîá'‚“f
é¹F­r+‚©{ãUUjÁØ—û<ã_å=kl¿ùáéVBÿ4»G:J²¬Eæç‘&
+#°§½}ü\º»FéñyTGØÆ«Ÿ–á¤ÂÈé?A ôùSáÈjJØ
+=×M$œ¾ÒÓÍÌ.C€f fB”nýt¥¤£îtTˆ1“îCRÕ3"¾cTÍwüt纼ä·7r¬ÂÌYëì}z£‘ð‰©Ÿ;!$vxÁŸí–ŒÊ­w¬ŽŒ‡5¨?5sƒªôÕê�ÞÊè3¡ö1œrN¡­õRƃºàâg*ÐeG–Smçm cOɆ¯÷¸ GYÃ?ˆ£fV£ÉOŸ„é,Gì3f!V!É'á1“óÛß±ž}¼Á}âŒÝÞþêP�â†f™xYÞ\þ þYÊæôΪy€‘4Ù;ûâÿ
~üÈP
+endstream
+endobj
+7138 0 obj
+<<
+/Type /FontDescriptor
+/FontName /NLCTDB+NimbusSanL-Bold
+/Flags 4
+/FontBBox [-173 -307 1003 949]
+/Ascent 722
+/CapHeight 722
+/Descent -217
+/ItalicAngle 0
+/StemV 141
+/XHeight 532
+/CharSet (/A/B/C/D/E/F/G/H/I/K/L/M/N/O/P/Q/R/S/T/U/V/W/X/Y/Z/a/b/c/colon/d/e/eight/f/fi/five/four/g/h/hyphen/i/j/k/l/m/n/nine/o/one/p/parenleft/parenright/period/plus/q/r/s/seven/six/t/three/two/u/underscore/v/w/x/y/zero)
+/FontFile 7137 0 R
+>>
+endobj
+7139 0 obj
+<<
+/Length1 1625
+/Length2 9253
+/Length3 0
+/Length 10088     
+/Filter /FlateDecode
+>>
+stream
+xÚ­wUT\[—.Ü� �à.A‚»»;T(ªpwHp
Ü‚»w$¸‡àÎ%çt÷ßãÜ~êþjŒ½¦|ó›²æ®ýšZ]‹MÂ
+f	’…A]ظØ9…ª`{KWg-¨2›$b%ƒZ
ž|è¯_K9�,\À0¨´…H ²Hƒ€nn—   úk€ÌÁÓ	lcë`ÔÑÔcbaaý—ä�	ÀÒó?5ÏžÎ`(€þùÁ
�9؃ .ÏÿkG-àbXƒ! €”šº�‚ª€QNU ‚‚œ, uWKPAPgÀæ€ü}Ÿ³ÿIÍ™ýKÂ`
pv
ÁÏn  Èá�Šàr²;;??ÀÎ'¨Ës
\`0qµúCàYn
û‹�ƒìÙÂþY÷¦svq:�\ÏQÕ¥eÿæébkáò'¶3øY
€Y?[ZÁ€®RúK÷ó¬u±C�
. —?±,A+°³ÄÂó9ö3˜ƒø/®Î`¨Í¿°œ@6NV�³ó3Ì3öŸêü+OÀËÞÂÁ
âù—7ì/«ÿâvqA¬Ùѹ¸Ÿc]žcÛ€¡è†E
j
pqþ-·ruøO�Èé¯1þ™¦gV0(Ä`²FçP…¹<‡0þïºÌþïkò¿¡Åÿ–ÿ[Úûkî?{ôß.ñÿõ>ÿZÖQµ°€¿—àyË8”
öàÏ¢ùCØêÿó²°C<ÿ¿ê�þæúîŸ:‹ç‚H@mž›ÂÉÎù·ì,öY©ƒ]€¶kÈsµþ’ë<3q‚€¡ ç®þUP'ç?tÚ¶` ôOùùþV�žå?˜?7ê/ÞRúÊšJÒ,ÿÓnýËRýy\´=žÉýG.*0«ÿ:üÁ‘”„y¼Ù¸x
l<œü�çµ+ÈÏçû?„ü‡ë_g'°Àè9oN®¿²ÿ�ß¿N&ÿ€‘�aV†FËÅjõ<gÿ%ø£º:9=·÷¯«ÿœõžÿšxÈDŸŸ…
߆¼KIOu©"Éî‘6úÖÉ…ØêPX£�ŸP
ëðO	_,5¿¯e¯zlòœÙsxØTdÞè$†0t$�Žr^ùÒ2uåâ-Ñ·ð³lq˜b¥îëE{O+¯ ¾áÔÝZÑÐ4-¸G¦káqB=¾b
+ uË
 ¤»tÀö&W jÅ­…ïÊÛÛ§ÿ´suÉÐ3Øß×ÛñûE×&9KÖ´×o-Hü÷¨\<Í�Îk€�/nÝÞ(�]Ç5Ü–²Þ”ÛÞ×_°	-5çaqú€ívÈ•˜Êª_Ü,…rq�	.©˜B‰	Ê
’h{¢ò˜’×wÄYUIÒýR'Žn¸$.Gd#‚?LjéNŒ¡m¼ŸBaÐ%õ\¶)>\ÚLG 2óÁ;ÈQQJF1[›‘,¬kú÷	r$.©iÜ*§xQÚ.,bj)eØý�B刲ûšŸçº�™‹c³}ÃHÕ›]/~3¤ƒåÊø�wøÂЄ–b2óº2ù.¹’²³¤«ÌíºÛC”¹&s‚iXÝ#jo�dî¶t2U]]Ê\€'›ÆàÉü}d¤“ûAÁV“FUG
+¬Z/#x¾’é~y$_̶*ÔM!ÀÓ»°´e<ðòX¬Æ=Ô’|ÝŽ‘Ï¡ÞÔ 3ý·…�D@	*Õ´ìRâM°¬ðuò§U>=Q{4:1óYÀˆ`	6¦ª¥gV`\g>Í´sÀ
+úð“DVøV¸yh­¦IŽêâJZKW{1_­u‡ç÷uÖWÅ6$%+ÚÐw�t’ÄIW¸UéŽúñAˆÖn
+�¹¬Î+º¡˜¹Œ�Zäx\‡L%ßxCÔ"Ž4»½t6U½Ù[Ér²BzŒÝw•M³iO5ß±=±5ÉÚ-k.ä”qTžhù¸§•c­¼¸¬‡À6lƒüÒ;«Y¼ûàùé‹�Ns(ƒE¼Îk¼\S¢ŠZNŒ®`�È"	Q7?ŽE„qII”‘ø–RÒÏÇ“¿[²úøáE!ŠgШ=¨º°m,ÎàgP°Žf55,ReËÐô7ŽH%òéñÉîÖQj½qiåa¼V&ð¡Öwjû±Ž±yCÚ-¯ôkÇpÀ¾*ÝÆ‘'4*"(|®¬?aé2,ñ¨Çf±
ÔãÓ¿pv7'í—Œ°ªÈu”±FÚA[/ÛDmešJÑ¡Æ0Õ L}ÏL¿ë÷Öm› ŒÂª»�ý$‰¯”W”–¶áϬ~[¿rjõ]$¿\j�™öùãMô'‡1a£k…’àÙ¥§·B³+æu*PIk˜ÜªQïö~µöÐdTÐÐ{k¼LwTqÜó†RE5º¦©Ñ/Õ†cjˆD+møí©(té€ô*Ýæ/Šï^}b
ÉÜeÅL@«#E_r-¦–z§öe%3ÏOé!Ãã$(6k‹¢a�¤«�é¢ñ¢NÕ��Ǧ›1É�?-~iÙp˜Þ-b-nq9‘´q÷ýÊõÁÔȶÝÄÛô¢[êåIˆRMŸy²œ@»‰dÓ¬÷öÃ>Hr¼{cpr³�Ñ™àòTþ»•ªÐ§óÓ„«Ç­ð~�4˜�‹Â®°Qv:ê®%Á¶g?—ž=²$»©Ì�˜*S&—6„®Ìg†9rk�/ÕÓ:ˆñ]’T¿›-SÙzÕûè¹!e=.¦5—qœ´XË-x�ŸlDŽúãöªÞšœ�åãD,~ÄÉ6Khñé‘àa£˲ú÷E-ã|„ŽøÓÒñà][ÑQÈ»ÒêˆVÓ‹`£�`ʲɬ:ëK¹b‚Hæ21󛬵mÙBTê%ù.ÌÈf±�º���$Û½6Q!S¯Hú2]¬1e²F	EÇG²¥&‚èÕ�®æd’¹¤ú°D^j˜h¿çnZŸpÝ�/"Îôàà%ÞÞÉŠ
+W):�Ò!êÐ|�áF¡%¸΃±…
@ÒbAV²˜í*¦«ºž„Í}sjhîÆRĘʪÕ'Ë£Õz]ŠG«$Y ÞŒŸ0‹äi]ñ«û�†fôGaë_ÉS•a°7Ö•¬X@ë	�³Í¾»‡�œ	Ü0;©Gƒùž™w«.µ*3=áM�¬ýM£ÉìînªáÕ—H
+,íÜó_ñ“&뽉KqKÒÁ†d£œõ8šÇjj©ðt¢²õ~u²ãdqõ3L¢Oq3þw¡îVE›+€&Ïý9éï'/îؽ�:n‡å�l¯½'_«üid
+�šÜÎ7ž‚mêÀ6�ú®ofRéÔø|霂.=
öHé$Î�yʤ²÷Ì7ç)fa–¹,—?¾jü"u ¤ 3;nj]­¿VÓ6L‰zC�ãqÿ8žfr‚ÂKÀw«À¹ÂvîÐ*'Øô<ùÒñ½L“1’$9¿_ðÿb¦�|å¼_x;3¬1ÒÝ!¯pDÉ«ñKon‹»™a"xÊ¢›”ÞET‚
©·—áäóBÍê¤pŽ€ÑÈ°`Õrìýæ
ŠU€èHäk\÷¼—X1‚v¶ÍÄyÚsΟÆB«e§ây§)|FøB`8Õ
+û§Ý/÷2ÉnÛ´ÐÃ�Tj›ªwÜ£Ä>È¡˜qÇ;µRöâ%ÀVò¸C“kªNŽ(©‘£_�¬Ðg¦O{›`�Œ�c×¼p�³dkl¶y§³\†¹6e]rFC$éFR†a�’tÃÆQÉôÜ+-ùØš¯�e»|sŒ¯ÂD(‚ß›ÐýX�y@_s$N!Eš3”%À<ûÉ�ë#SWPeÆ3’¥#²D£}�ùËÕð`ùƒ¹­Nút­žÃÛóÍÔ0Ú~©Ù‰=„°B3…¢
.—âŠ÷W0Õ/3»gl¸�ó9½§•^ÄslçŸ-ÛsÈRÈ30‹_è5nÈo>1Þ0ŠõW^Á%�@b;öPR†7šxæð¢8ÕÂç�ÅÑkÇÆn˜³iÝž?S‡‡ae"²é|–Ãàpvu²K_aQì7ÛébR<Z[æ,D�á”0þÜaóJ1$Ü*·ïŸäÓ›¼íO‰rZË>ŠbëÕ=db¾)JB¤Û® ,o+­aœ‚P2àÂb:c¹´Ð.t9˜³Çì1µÍ’4ðQÿ*e‚u4dµUvù»7·O¨7=±v„аJ†ÓázR¥Á‰IŸNS‘`d^!"µ*¿ÇË1LO»RÐ.YþÅcõzÄ“Ñs?ßúÊj_<¹¯Éçˆõú
+wSƒÄö
+õ3§”ÜÛ`�2Jì!¿ùzÁ+'Â4‹·’P¡º0!øY#(IW�¿äç–>Åz\t¢f:Pú¦3߯´K¡r°Ò>ñ¿"½ˆ1pN
!uÁ¢v{2㬠‘Áp^uÅ™ëí÷<ò5zcB'�Œ²—(ß4á¦qݽ—lÃw;™úÝ@±?NR8Ò+/Ã~È*õcà›à�aÏ~}‰ÃšTCÔZ¥’ˆÄ�ñbû¬é£u{“•Wc#íÛZ†%$ä«6Ú-D7äŠ5a™ú¼~òóXÞžð×ìíúãsmÑþ-Ìqó÷ðDsF?D‡
ÆæŠ*?õý.J)™ÓMÙUÌÊÔ´D£dãý‚4ºgÓ(ÝÚÒo:n�¡ÄÜص½Ã®MÒW£®À€âWH[tÝ¥Ÿ$Q
¯z;ÅŒòJ‡�(|þœ¬ú±Z�œ“o§«šâþÃUñ¤™œ¼…-å,°]ù �ç­ìí¾*Å+ÓñÜù/úª¸„Sær§á^qŸQ±Œ§Á6C ÂL›Djbb« !²Ï]ŒÆÊvD�‚Ù”±êaòÈŒÁh6­Ëv½�¢Eû$£ï,a¹Œ@ç>ˆª8ëÖÜàfÍëÂí}¦Q5õ	r´õ®níÒ£¨`Nk!Cœš‘÷gy	÷Û©6Á˜§ùE›¨æR`\òIûÆBt?Ùü÷®Ð5Øëgp¼S”	VÅ·§¶sîëüÛb¼µØPP$yC¾œtŒûÍ#�n£YŸ]}WfµÚøÏäb¶$vˆn~mbѪÎÿ�ÁqDµ2#±ØG‡åÄ!#c
OÕ,Â'x¬&aÊÝwѪù¡–÷´ÖÓÔg%´XÍCéøb´”‰\R:,ˆüј°8�™Ì}|-J¶O…‰C£ìM‚uɃƒï{à!OŽOf_cj¯¦Ya·×%�Iå¢î:šU¶ÞñªyT7%
:Ôô&Lû�GÏŒ'ª²«…"ÉùmóŠGyö6߬
ÓN¤«N›‘ZB�b1µx
³vÌÔѸR8Y÷©°ùï;ýßíE9Ùý&PåòBÂhù/ý­?ÓÂF=Xêßjn˜6¼œÑ%ô
ÇIbh×ï2l(ºŽrmú•`äîÿb„�8Ý‚žšÏv`õ¨�Z”0üFR$SNî¬;é�1a9¨tôÔƒ5'Sï
%ÏÛG[ãš4é�¤ È(N�†?<Ú` —uÉãò ª›¦Ð#aîºÆ„…�ˆöc¿-Ñ81;¸/ä*Ç?vÎKÂ}
WPaßÑT~9:\¤¯‹<XW¡ì$Uç�èæ0ª÷ïDDЯÃîÈÍ�fÚžìmϾU$Z/ÊÏ–Œœ£ÜŽæ<U@´¼½9ü:¦¥GÃn„°Òß¹Ó"	rqÌþÉ.]¾0á%mN‘ÚPåè5¢;¤-9\~„Q‚Úó%¯û,5zŠûÖ U-Méeþ¸Ó”Dòg†™5§„VÁ‘ɵ¸¦”‰èDÚàþk|í7£[â5›ßí;¡‹+jýË´ãô]ï'<œÎ?Ú5W4RߟûMÎ#¬Àé8ÜÊ¡àôg¬´/€
‘H/ÇQªÃùgZ1_´Ûh/F†.ˆï%7ËöýðAi4�Vã<WÄNA:Î
öÊÔˆ7lüКâ‹JdPO�!PŽnÙ â°äIN•[[÷Ží|\Ôp,ÛD̼9O×*`a˜�LÜF� Æ0ÁmÕ%�„2ªïÓè·8_<˜CŠ­ýC•&?	÷†UW@MmËï¯m‰GÅj6?¨Ó»]þpïvX*¯øÞ?ý‘å}´ÂX°Ç€>Å/™Øl¢Xy*:j÷˜;þ•ïnn$³î^C³z+ŽJoîQ}LŒ�ÛRã‚d.9¡"MRc¾Y;Eh÷¨-2]“TB•}&UmÈž|ÖXË4‘Ÿ;1xIR“ßW¶_rtáIû„sS\î³}óù’i¾"?ÐßHÎ(ðB8=«ãt¾F‡z&––69+Ьv„Jˆ|_ƒÇã?ÙTl�]á¯"áC€ºiá_#‘ÂßHûÁÜu7X�ïñQ({°ŠÙÙRÈ£;JTÞþ.™ºmPfYßÿ,uà›Ê|36¸ñ÷©Î|sž›ŒU(M�Ê0c:è»3¾åƒ=vãVh:›`þÃuuæcž¼áâ¬1_}âŠ} Ã–ÏUð‰£éÔ…¨'IÛnï +_Áæ5¾Œ<Oû‰�Ü¥„â]èª{§¤h½`u[²¶SªwÂ
0Ú‘9ƒ#|æ.¢ªÝg&…3�«–8åû¼Ì—}_ûÑ•¤j„Ó!c’©c†}Êiy+ÃRpÁ±Pþ½þ™�³7ÞµLŸ[/Búèüà�ê^!í±{î«‚�„¯£Ú–a˜ƒÉ3w4Ö,áEª+ú<
�¨1ešž=:øª÷?XÄ·
¥;ÄAc3nŠ$T²ú‡±Šœ3Ê’2¶
¤T“¶G¾(
+ÜðJ"&³p#qÆ¢§‡2Y
+ß|výˆ…$¶5¿'–Ûøø!�q›™³£)yç7)w“Ñ×éƒùÇ@o”W%M.Gɳ6e<±ÞG<Œ¶’�ÇÏ�é+<“ëw„„œÐ½Lß&ö‹á¤àê 
+ë›ï¸Ó1c"2Pxd;9÷c¯Ññ*}¦"ª’ª
+J&ödÑ6¢„+&çÆt8,ì5;`A¦‹7øP„~�Ã.íÀÓ¬‹¦Ó¡Q3¹»`(èVb:´û†æH²9½{ÿ’âà釃�©nmzv”*Ïû Ô,„úNï;ZÏ—zpÚ YCþÞßé{ùŸOd¯ëG¿›*ÀÎNÅ5éÍét�«¬=B¢Ó«ºCnù)m©K̵Åx©#^E| $q=ô-”ã­ðdã��bm9L¹Ã!«ä] lMn9�ü1Ñ$—b6e5ñ]º^ÈhÓ9nk0páeCY$]ã||㮧Ê&ctÍÊšþÍЪ8‘oµpE.šb$ËÓa$îÞ
+Š)L|ÄcDåøs·Ž´^eëÊ  †¤q
‹´7{(:„ßÞ•ñt$ž„Mƒ•	�¹‹ü½ÞÇ9L‰Î�¥ÈûÙòÝÆ2“Œ\ESü¢
+�n¢Îá2ŠRqÏŒ)^H ³÷›Yÿã«íõJ¯d8®èÁXüŽ&„c[<ÚcêÝš¢ø5¯o=Ã�»@§[§V¸³CþœµcZL¿ÆºÁ¬&ŠX_¿žôó¦ü›a¥�ô<ƽó+ýXàÇ{òà"õîÆL�XòëÎ`ª_êѱµÖ²g�F;ò"Ì߉ˆƒI•ÖšR¿^�è}êÝè1,ö”.È@>Œ1·›‘ªpVÚ7¿À­ëcp}(gß¹æ›]iP¡“B”‰Gʺ(0-Íl¾£°e<!­²÷Î6%2/øØ”�œ×„º¿›û­&·XuÔs¹Gj6U†ÎU3C?E�W­	Ë¥‘ïl⤙|¤ÚC1µµ§d§ˆè%
hR]cVÐTe…úg��D#’VdǨº³øÌ%%j*4�!=O@€ ´’’aa;r+žâ%2	a|Ò¨_|èðw,ûÞ"�Û¥t¾‘Ó0’3zccµt®c֜墓�~ÍÈœ�ì&˜+·• ~*ƒÇi+dmªœD�nû§`W]YµKÊw«­œÔöQ¦NûWù�¬›Y-ÞBÌʲû%HÍ£ãvy£j¢â	ÀêW±�S¿-’šMÙ$ƒï&´Í´|¢q&©þn6MкFS±¦¢åÍØ û½Õv&O0þ§;0¡�ÉOP@�ÂJä�ÌÀÈŒìo$8Í–AÁ-+àxŠÕÓÙCûHõB7ðè¦ï-JuKE<ѯû½³ï}é7ña½=ßNè¨BÅ>¢0šžÙ ¶&[ÀCñ6U&Rxç©�óí5å
+Ê@Ëwcö‹k·t‚g•ä)éóÃ5í'A ³6×ëkg+T¤ü0Ûï^ÝÖæ×_Ox¥s§ï´\O
+¡álx”{
+§ê‹Œpµ—q
4$P#¸	w5ŒE1lšZ}|/GÕ˜É/æV×Ð;ÑlœätA	±¼¬ö…;Hà\KZJµáø÷…aÈ{�Ík__¤µÎðæn~°Ä\	þY·
+ž&¾›ÌDÇh¥&™ìú¹yF�óN°ðÒH1}Éù¡^øã
+�¨âGNB»ÔÈà	¿¬%­£ó­p®–5=¶©¦Ðý�9	å	âÏ3û•ìê§i¶PŒ©—QŠ
:vf¨¤|‰Ûˆ—K–:1¿b1w²û<åßÏ“5
+]îê
æ¿Û@šè<º#¦ž™°…awnqgZ¾¡.Ñ·ÔV×�/ÂSJWk¬Î˜ÕÁÎ×y§=Ô0bßb§~è7+%Î`p.\2ziÆyòKú)EH…—ýŠŒkùÈ«¾�Ax“
ÅLgwws`à&pM¦ü6311“‚4 )(1×½œBœ¦¥ýs±¼è¾gnD&1�*PŒø-MF+:Ópš18…	% I
+~}÷­/S¿À¢äÅþ™!óÆù×]I-Ÿù¼NûBüÕÝ�GAý`CþÆKwêð·Õ
oÌLrW˜¢¢és˧[n’ÑÄžÿל†á+Zê.Ô"ÕØ›½ÖÒ?æɱlkS‰‹åáþ„…Mþ0.â³¥ßôÔ¤Ùb|ã�´¨ˆå]h[¥LBÙÉß8±©­4ÑtBïÀÎI.·Ó¡^y¦ý*ÇyMÌ‘j“^l?çã…n"SUÅà e�(:v1»?iëï»dÑ×]@í×fm9uŒ÷ïÓÁ¬¿èÕÕLÊ[\±Ã>¹—Èù¢´¬ºIkmÝ’R&K½ZB«k“¡§ ?…¨·¿Ç¢½/Ÿ)âPUî¨˜Šº‡ñ4⸿òð$=ZéH
ÅEJ^¬Ü¡½qg6äãÀ‡x3Ç¢÷„:˶×$àð
‰^yEë%ãfðã‰:ÿìPìs$ƲóJc×'Álƒ™~²­ÉupÖ“C­(�ž3ªàe¸×±r&cuß9~=›ÁÀÓ�âϤ™]x��¢ì�ÙJ;s@Эq:[r²¯¢ZÉé!EÜÃ
ó੺똯Û;#ÆîǨü¶ìWÀ:?ôŠxÖ°aÈLËÊ{[=ªò“4±åkÝFn9bVA6ÚõÜÒÔo³ ?:–ýV¬Èh½`XfS½äßÃÔ�í�·U£ïÒ¦ÇݬAÏ/À•ÔŸòÜ’Cs±Ì¯[,�¶C{¯sS4¦¾&ä®ò8uúõÌji“¸³[ŸÏbW¦¼bØ‚téé¢gïwl3¬ÜCãšzÆQ¹Z
“pí^< # C{{Ú™ç•7Kn�›Ð¸†õX–è“#\™|‘—JªßgrV�ØÊ=w.¼C£�¯¿ZšÎ…J“}щ>1_¥I^þb$ä“´û÷ñCý3‚Ûj¿ŽLy²�½	h²½:n2_—êw‘<mÿ¼½`OŸç ñãgã‚Œc?Zqõ=‰3¯ÙÛÞbÌ1O=6éϾu¨´�”ê¼+d¤zCÍ·éx…Š{êžï²z©2£–BÓž–ÆÐ:¬ª¯µ£ŸÚmøŸ"kë`p¯	¯lîÀœy–žðœÆwwËž¿”T°
+ÕW=jsÒM¾ÖöžOâ9é[{�§ÛL]SÓö¶Šl
+*½úÎþ�x׺|ä[íÝXìgóÚ*2¹]M·¢
g	‘”§úwæWQ$sðÆUÍy¬'-†í7opÎ)îu—œú’ÐÀœèåmÓ†NÌÕnÁ«§
+ӽˎ¶Ïè7º7Þ—(„}Øê
û3ŠÍüˆƒßÆl)ÄJß°�úý	ß«-TuxÚX)2Ó€¹t½›È½RÆæ„wt€Åû7 T2i‚[ ž^Ÿ½A÷(9eÊÞÏYݪ²ªmÏ>Cq‹–†’IhŒJ ýÇR§ntRÅDyëœ1r¡7?T
Ò€˜RˆDs¬v¶„g¸®h¦ÀlÕWJîMïJÞi¨(K-¤lêžSÙVG4«]®‘GàÖ}¾ß»Dôrýi¬˜"°á¤{üi+£W:ç48Í;�lðƪÈË»çwN°FçÀ˜&Y¨”Ÿˆ‘ð&XMûX°Ë7Ö·¿�]XÓœ�#Ž3—S[cBA™LçYÿŽï#C€=�#<‰uÖo¼GQu´žß,‡¿$ÀWZ±MÍKPö«í~Ì”ï¢r¿Ö�Bõ®)Õ’/ë÷¸èSpóÀdÓ#Ö?cW¤Å#©|'D\â·:MøMÿ`ßÃMµ×݃='Opyx60M}ÁÛ|dÉžâÝX;uVz/s¯7Åm‡„+:>K¸=ÇvIòŽHr_æ–«MDúVÿ(’O�nÍ%2NQ‘��$ÅK=$"ŸdÍoñ�ùì-4,¶?,m: †ç½-ÝØRWdò߸ÿè’ˆk·äœ¼óà"={nGáT¾MÊÅ�+ö<Îò¤·[vàãV"§€”Xò#|7�ׇÞ:‰9›ˆŒBÚs]/öm'N%™!Éb‡R)‘Ì©MŸß·ÒÇ>Ó¼|ÊŽe‡Ål(”ájŒùx"âó3‡Èj¦‘ñÜaR|3{ßö㩬O»1NU7wé5…ÌpRi›zfâH1Vœ.ZتI·‹R¸Ï“6H‡�‚…óŸ�cjîì‘>w­�"ËM)šf
+1–á<”–ì1yîn$^5Ö–í7µJk`æaøqø`/Þî^ÉÓ5dxüò¯}¡ù©‚ï·û¦V¨ó‹¤–¿æ(’»gEx’f‰"û`2 à}bò9ñ/›š…¡n7ï†ZKá„Æ—‰ÆÂ.ÄfJ!䊣)zØàl’•·tÈ;ÙÚmŒ�V®.ª÷'ûëëýeøœ³öÔ	æ^�‘dI~¸¯Ž1Ÿ¸©1Ü#¨XvÏ¿ÁJçzW×íKq•I2-ìày�É79kSû½–”™õ.9&’UÄ8'ó’°±+÷#’à9€¸N�å”	¿»¶S»Df•æçbð&å9[`iaÿ–‡ú$DcóákJ�1ú“s8ŽÐ›¹Ï$9M½ÞlôÓüi¯1̧›ëÃúŽÃ;§‚Œ²Gzus?^Ý	QI¬�U;1é$O-jš6#'EtŒ&×™o-¿$qg¢Õ×eO@=ÒUÂÉ|µzH¿6§RåJ¸³„°<JÛjॎÃ=ÜDÏ¡²x§��pYß<žW‹UÔç,óQÝ­…ݼS𧠤é¿E®JƒG»ó�ÚYëð˨â`?eÆÈÝÝðeâôâV,>a�Ó[áJy\’L''}ZSüí6å¾�FvCgŽz­VY¬70ULôÈ%–ÃwD«/€OWõ•ØÓØu°²´nÛÄ6vŽç-@чdàNK6àRJÀŠèù[pºI<U9n1›¸b¯p×=å—¹Zi¡äà/ç­lº˜wu6r(	b©êXÚŽQµ8[
+ãèòÂ×}ŸR)O�òVÖµgW•0¢=ìvñ>M½²ñÍL„Õ9þlE*ÿvgpÑ/ˆàržËÃALy]ù´F"y¹�Ož¦?‡]y-8WÎÛº”/²ÙDz²Ê�9¹jHÿJs«œHû±1Ö�SóA(Ž0£ =ªþ¦ðûOËM¥È²¢áŸ¥hžSñÛÕ4¶ÙQ-#̺Dç}ÃU
2Ø™ÜÖécúšl5”óÊ_£T‡V‹õÌN¼–£Á­ÞÇÕ#ß­„,‚>´@¸í‡Wn›ÇŸÆ×Û©ñ2×å¿w|²»÷ZwfDZ­yûL05Æ*
�LTÉ­¯ÆøëÛ'pÀeàÕ(°nwŽØ:ÞÌ ™µÙ•÷™ÁKÃíÇIx�)Sì©"“ƬGý䱸ÄÊjy=®eÒµ¸K'³¢á8÷…µîR	¨ñ¹)‘R¸yP›æ{BTà±~|o9ŒæLIK
“Ëìð¡À¼òwàD¼
hmü)¤…M5Fy,5ªÐ
+TÿšKÐî2^ø÷¸ñfÓ»uÎ-¯�‚�!]Ύíºûã/BöÌ°
ø#]!¡šwC�âX6íŒÁg÷§¬SjCV­_R¶2"ƒôhÖ9ÔøÌ9X
jV€?çe‡û®>†JúâDIc†Gó[Ñ™ºíbËû±�¦S3±³„+_l‰‘^ÕŽ´!Ëdƒ5¢ÁÛ·[ûYoHñ=øXBù¢ÒHãóÃávyÁ:Û¦Ýs©—ï�$�)€;‰Bh•µà2RÖ°ñ~©—â+¢�È•œGw´F&R2%»»±7zM¸e–I’-¦ˆû¾õøŽ°K^Š´s3^¸xäÊÙòöúh…w©²!½+€àp¦'ÚwÒ¦<pS‚Sg­õáW0N­ôï/È>ƒ¯´KÊáíÝ€fŸøÔúqîp7̒ĆŽ.Yl‘/x®x2•&Pæ~›EðÈKwZXCR>u¼€  Äé¤Õ@ºdCq"5ç^ˆÕ?ú(KP‚YgÁ	㑈Aµô)•±yäuO
%VËã0Í´©ä¨�Û‡�ŠÔZyAÑ[(dà>iCxÐH}<AÖp)Án¶í‹oõ'1wÐ’ô™TÙóÄ�b$ª³åD«žª|%{K°å�´Y¨ú;yÀ£,ûõIUŠP=ÈQÜDÔá�µÒú)a¿æýq&4‡îáqPñ;exY¯ ±ß”³Ô TgŸoÕù÷G»•„i¾3õÁzÚ™ƒ«w–zÙ&kaÎçºsq6.ôd‰µ‰òù´u4•ˆ…ÃóãøÅÕ ‡ÑÁJÕ÷A?\æO}_%-.¤ÔÓª†1µ
ˆêÚ9=ð5ÜDýÀœÌøˆ$Tðmɇð“Ÿ6ÁWÞ`÷#š.ë å1¹ÛJ—–�kK<ãï7z	ÛQ-OEüôvR´RA@ÝQk#…õò˜Ö4—ÇWã"Hý|ã�„´×éðlC+ûvßÎzx7¨Ó‹\í°{,½€¯¼dµ>»DÊŠjÁoõ'ˆ¤Y«‹«ƒ­X}Å0#<€¸‹”]±ß»JŽð{gw9yC=Ž3Y	¼[—tT’4ñvh�ô.�ÕP’³®X½ò’:Ž2t
+Š	Cÿ¦6$
+endstream
+endobj
+7140 0 obj
+<<
+/Type /FontDescriptor
+/FontName /CXLRKD+NimbusSanL-BoldCond
+/Flags 4
+/FontBBox [-139 -307 822 975]
+/Ascent 722
+/CapHeight 722
+/Descent -217
+/ItalicAngle 0
+/StemV 114
+/XHeight 532
+/CharSet (/A/C/D/E/F/G/I/L/N/P/R/S/T/a/c/d/e/fi/five/four/g/h/i/l/m/n/o/one/p/plus/r/s/six/t/three/two/u/x/zero)
+/FontFile 7139 0 R
+>>
+endobj
+7141 0 obj
+<<
+/Length1 1144
+/Length2 10821
+/Length3 0
+/Length 11594     
+/Filter /FlateDecode
+>>
+stream
+xÚuueX]K¶-îî΂wwwwÝÀ6ÁÝ%¸»»»î ¸Ü�ðrN¿î~·û¾oýXUcÌSj¬oQS¨j0‰Y8˜�¤ì]™Ø˜Yù
Ê`;37
 ½"“:ÈÊ
ðä"QSk‚]mAÿEÿ!$œA@W°ƒ½$Ðõ¯iíP:ØY
l¬ü¬¼ü\lÖ¬ÿtpæ¨:ƒí¼
ª W�³-Øþ%é`îf²wÕpst´ƒ,ÔA.nÎæ ~€åŸÊþ;+@ÂÁÑËleí
+ ÓRסg``ü7ÂÆÇÇ0óú'�¹€­ì
4î [Ç¿2ý‘�
ÙƒœÿmñW¬ª%PÊìúW»:kWWG~GK èÆìbÉlre¡ÿS¨”½…„ƒÝ_.HÍLì2ÿÓ”ËÎ퓽ƒ‡½ÏÁ–`{‹¿[²psdѲ;¹�ä$ÿoðéߘÈÀÅÊÎÊÇÊ9
@žæÖ,¥ÔôrýM²ýí-ü|
–@[�Øôç…äãt
\�Ý@~>ÿ/ñ?wHll°¹+Àdõçþ­þYþc¯tu{X™YYÙ¬=ÿZý¹P{[¯‡+í@uE)yyU†ÿìý_Qââ$™Øx8
Lì¼\œòG‘�‹ã?U�àÿ[ë¿ËÙ[:øþQøŸ‰ý³xw�³Ëèþ6,=à*);¸‚ÍAº›Ä�•‹õ�?þ¼ØþWóüþµÐæ�v³µý»º4øÓ¹@ðWï¶@çÿ
+Ú�m½þ—ÿ¨ú‡Ïÿ?:r®@[°¹˜½•í¿Æv‘{‚,TÁ®æÖÿ0Æ?p-{‹¿¿8�ªƒø¯oÀÄÆÅöœ¦5Øü“=ÈÅå�ûþ¦@öÿ‘RÊÞÜÁloÐpýã? ³Å¿€¿hs7gç?ãùû‚þœýçÞü§@ÈdŽ´ºä`.bó%¤ë±AŒØƒéç4Ç ·Öý»9'R¬-ä3Ô€2Á§JbÎÂ;ÞÔ\IÕIká:h%hÈ°b©X�O|âÝÌðXØ¡XP²‘D§ÌM‚Êü(—t³W¬ƒD‰1éù¿$¼Fd/(ªïõ¨…%¾ai„9à�>ê9©À“U×"ª-Ñóá=>W‘µõWã‡[ï‘dµùžŽ,ßÛúý‰V^¹õô
»¶ËtqiH•+`!LÉõË¥±^%Ï·^ögënÑÈ>ÆÒ¨ÚÖ)äßÛãPà’I7QÐf‚¸íV͈³‹†º¿Ó�£ð®0‰Ù›ž˜Õ{PFmyWæP¸)ÂËlï®?¶O±O.w¯8XÞXÅ„Œâtµ=ei/ÙáoÎM¸Kô(ììMA4’A¨‘8Ô'vrh=ö•Ó0é/Îä–‰ÿÊiÃ'V"xÑlŠ
è©KÈMB ?Î#=œÑ¸0¾6¦�eT­¾òY&Ú{­åæsP,éÚ¢+|—•YV¶_j®QG®õ‰3‘+E“yuØšMå¹±j<]tóÒ}¹@²¿7 ùà6XAs~fè\%h0þ¤^BcÁ@¹ø�dA\ˆì½‹5T=Ë–ŒVÇ"2¶z½@Væ×ânôãK¤ÆVDK€fù⦠° &¥ˆV¢¤>™€óðw�ð@·mµN
+u|Ärp ±ÐÙÇÈèQ‘Æ,\…;w¬Sù[ï
+³!å)ehmÚƤ·=nMvÂᎌ›(CAö¢å­î¾ôÓZWqÛŠÐÜ(Nš4£ÏÁmΤ…fâ$và›Z	¡E-Ÿ`�±Ô¡¡ÅÁ{éaÔ‡‹ÙD6W̾ùö5  •AŠÍ"DîF
+ß²së×ã·â©_RÇfüJyr�¿„ÃÖ–9Ù.‹¯ŸäÁü•€•+·©£qÚË»ÙÛï<ÉFí¶£Mè0š9/¼%ý0äè·òFW—Lм�¬3?ê~Å{çƒÕL<Nív¥×#À®LzOT0�ì(fvss_�ò}Ÿ¾æác݇øvÇ‹ï»{Xñ}:Úü‘º…y=—]S³å=zÁ!z�ÈÆÍS8T&qk3ºšÞ'µ«*¢ŸHìR¯Ô*“‚c!êYè°âŒà8hFt”vNo™1Ÿ­•hƒL¾ñAÔý˜Î­HžWsš<RåÏQE‘ˆZÒ»†ü…ôˆDPñö²‡ì5žÞñõÂlM~æ†ì"ßòÚÍà+ŒãÛÛ\Q9ÕÒT]#G×#åÞŒÿê`­°KoBå9žI¹©ïÄ—°\ˆuÐ4ÑA¯ÆF¼�À®¬Í·Íܧ¯IUlË‚µj¦a廿’²’˜ hGª���|'áòf/Ö«8©I¢Rªçà:ëàÙÙÎÊJ½÷7¨Z«HHW�ñ»~4ØËúÄeölB†Ú
+í°Vè;+¹Ä¤Íˆ/VÅ/£TB¶®‚_+óô¢™ê¼‚º¸ËˆÛX�ÃʘBR,Û¶ý9ap°ë¢MðåŽQ›÷¸å¾%¤lÝøt´s¨¨Gé?gâIMêë^ìRÚí/ÐD‰¬?^Õpºè%áß©=[íAÌ”Ž2	‹
/¡•!°A†šÎÄ⟭�Ç}{ ‡”r9G>ã¾AjÁ×#£XJIû\x—{S+pt�,äßÞ[ïAŠ¼»ÕÜ·ñSú|	½U”!—ßÉ·Ð
+áG¢å‘ûˆŽѬˆ»f柫XädÒ«= 4Æ9IkG,1ˆkù¤“ÞcøHyW“®Ô4Ù£¡&¦C2½*×€ƒzúÎp3áF,v#Ëãmú‘Éð\^4/˜ –Ì>;-ðð“V£&0^BX_
>•#^Hœš
+J"ˆ‹Û³ìY¦4ó¢ñq¡Í²ºe‡Gæ”­ÎÅ«Z„T£‘#ÄîA@ì³¼;ÔgH™t¹bùeŸ¤xeû.€&éù¥gÔ
+¾ù`–ÁÎs#L$ò‘Q*'¼i
pê nÏ
èDn'ÏÎÿ1u�”#</#¯1+=;6N."ŠwÛ«¾;ÙÂÀìô#•€5UU›ÐÝû¥ZUãµ\+þÓ‚‹Y7qO!)ß±o–¤C8²Î¾ ©¿Gbñmˆ||‰˜ò�­ìz<!…¨Ù·–»y+kpŠøs,ˆI
+rGôBx¹°cà(t,>‚™þAßÒý„Sk½%s¦RH£Rù”DCýWŸ1æ¤ïLGV JýÊ÷˜�öêÐÕA¡ûl
6å~§­²wÇdÙ(¢Äá¨ÆZm¸/Zñê‘×£}�¼±mÐ)†�¿y¤ªö^6OzœJùÆ‘9’>êÚ}™Û¨8c�0žëä×a¾»B®†Ñá�qï+_{?wI~¡-OŠB q	Ƶz[lú
+fÍŽĘÛôi�ÕmJæM³âб—åm' gûH|»6ûåÖ®½
+¤þ5÷ºŠ‘L8êAz‰™ßŽ¯ÈVð°S6�+âò§ŠË\*Pœå^¨0¹F.wºÐA"Ë̳êK£‡Å¬è�¶5ëñCÛî™X	¹ÚÊhú5V§ñá‘Û¿Ú?£DîXaĄ̂Ï÷Ž§3{�q5Áœaï2VKßâù¹L·ŒÆ+]œRƒO¶÷ï{ÍÌ1Mˆ´³Å/:t8½øÝ­ÏÙ„í…2ÍŽjI�™õjàãQ7G–ÚÊi�mFkÞ­ÞøP¡Ë–[Þüè¤Â	«XÞSu…\³÷úeܟ±�æecZ�FK2Q`ܵ�£Åº£µ£6˜-³»�êMÑA·/&/Y&Î1¸x¯-Áj®§�š?ƒkÑ°ñ
©©¦˜ñi°^Ø+Ë_©
ñbæ)E¥MÚl
k=lµñ!@¿�åÅÌA¨(…•
+˜”ô#|fú(
ý´]ƒ‚¸ñ:7!áCõ¹­Õ27­Øp
+ìTD��‘¡Lê�
0s�ùòB¾„¡�¿åõW’®Ýy':*s‡&Ã3+Ù!ÇÐ7ñPµ"Þ—rxד(¿Ï*urÎ<ïoC§á¢wp+H$DJ—°\=_ÍIˆ=µÅžlh«Óö�ÚBÙ»-wÝ~n–„_²ÔÖ°â¾-Ï­ê»N­(�¦=,’N®TQxÄõÊŠ5Á�cØž®B”æN
uk `d`wüa_xŠC—$„õ¨Bh¥«®)2…dÝ$)$*µpØ]Å´Æ}Gød‰–)­§¥¤4×Û’�ìòßÒ“Bý .‡°}‹ãèù_­	kîU·–²Cû¤O0.dŒbÖ>PÌ£Ù7I’˜­3mRòx5<¨
+£D±VA¼f’†‘«¿#¬Õ³Ÿ$£gö .ä¦Â‰ld#‹­…t]ˆqfäPUEAxðÛ“X|“w|JC;ªwWŒÒþÚ·½�«	ª1ù>ã®òð›AÊß4�äÜ9b¤3OáCf~,òX«6öäW¯Ã¼§@E”DÖ(VÀ¨=UŽÍè»þ
+âÜZs�Ò¢êØÚ†àÏ~¥´½Ê)*…w`ÊÁÙâÖüú}78rõã³ö&7ÓÂ_Ö’ç^g[
ú�Ø‘îÆÝÉÈ­Ÿ	=mÑPüçÊLÏЫ¹¼ºâ蜲GÂE¸Bþ0MÃBu}BX&ƒ%È\ÉI^S5»û‘_ÄDaŸ„mWúaðu!N~¶F’4Fa½Wh�O_
>ÖzÄz Âœ<¼p¾~£^¹þ@4”Rg?\f�ï(þ�&. ?Ú±O€Gø”ÓD+¶UwCÓÄØr»^fÚÃ݃š„ý©
+C&— Ì*ŽKC‘èù»�Ð._,3]zm¸1ǵ
¾D)4]
ëî�*¯3tP rÈgÿª/‡íàÔ3
ÝXð‡Œ¹“¡¦Öcj¹ÔWÇÈ[9¶ºwõ8“ª‰žٯB\7ž Fæ³l“Ýt•%ÂůÊWÕ»
+fâ`MÄWM%K• »Ëa;­Ò×JÃœt“÷³Ã/š‡Šqò{¶¢Êú(¡[{z¨µV¦ÇœŒm$Wã
ž`¶¹XU6�eŒ9uDÞÎœjY|’59)
+ûGÙ¹?eð‡A‰†‘sœ¾œ)ªiV??!H™NsB@‘kdGåsÒbôab.ðÛ÷©[¯¶8‘Ãd•s3Bš‡!‚+©™›¶Ç�/öém«S­F"I	/¾7Öz¬…µ
+Fæì×�áh£¢ëøs.�¬(ãõ;Gõc�&Zªq{@ø%™@hsFç˜qu7¸ù¸®Ñøð#{ºxÄí¹°å€¯9$žÐ‡›À$ïNÙ3Qr#NB'‡ún:[ôãúɨt¼x'v±Ðl‰+8ë.ûž3Õ¯")­0­CÀ
Ô2«ñí³oÈCV‰J›½F�Ó	9.©:–MúDåãÞ û¤ií·)íD¿¹¯ÈEà7Þ‘O#[Ìù=Ý.-Ì)­yÌAÆêwF8\ò´í*V©*Œ
Ž³é	ë=bÆÂ'¥üo
]R¦zTâ·‘¤	"®öÛ6à–ø€AÃZÈ÷'%8Íü…%ƒÄЀ
ã;Þ¤¶zr½XJ¼`£ëû¤­†f¾™ïtÐØ
+PsÆŸQ
Ér§>Ï%ɇìDö$(‘Àâa¿ºˆ®Y†VRªÎ%,{ŒÛ,èTMÊI~¸’GQ�UD¤AßhÖ0/yD�Ê
}¹²Öa£ë² Òß„ÑöÝÐ3ŽG#Î7�„GNÇÑ^“lÞ„‡‡ìC½áYúgp
¿z©NHmWÞNl	W2¹ {§GvºšÊØS¤™yÖGHÁ§…|hÌTC2|5ø×%)Û_±’ðÄ]kÃa–V¥y73.Yµ»ýÇ4±>…L:i©bö3jIƒ>ÏOÅJ¦¼x
­Ó$�,èïjq+©bªcÁ’ßû÷_
+]üh„oܯÎóGwçQDì9¤ÂÈ–]f:ÍaìØðz WæìB¶}ãyW䃦½#ùTd¾G·T¯59íŒûOlâYN<m‚—J)›ï�Qô“*lF—{
%ýÒ¯"O•<=èÏ~Ìk¹)s®DóòÖKÔz
ŽÑLPÈyyÝ øqÓê_:rã:¡ÚAÁsãЭSùi«î§ä`£Ê–2|QµKg ÎKÑÞJ[Æ~Ï.it%ïÀ4¬åsR–¯=ã(ÕÂIÌVÌ9y£eœ]ÐnŠþ¶Ë®b cˆ8¨}Æܦk÷/7}4‚ùÊ™v"<I9Áj×í²~–"x'óÂ’Õ òìPîõ²Òg§Œ”ÈÞׇ	fÄsQ´N_•èŪu^i8jéºï«²GØ»Tš¢�}RÂ	hÅx¾ÝŸüìÝæ•ã<"»A¤rt$³ÁDÓæ|zÕ_ü”‚•½a‡_§šu1?5¹»{çGÁp
+”¢ÉW;â�&†i;ºÎÜFó¶•D‰6B¢íɬ	J+ú2?\hèo²èqdÇ$«%EE­áÎ-áÉ	-€¿ä�k¸,Q7Â9]MAnM³EV€ùô¸4)É Éó�„!ËÛY}pU
+�âºùìÄs@ƒ8�ÚI÷vP¦á‡ì¥Î(\óP·�Y+mba"ϾêE–/éLZ'„Àjï�|Ð>¸Ï=Ù_ãzáWÂ[­Ïªë€Lˆ×ïH#®' ÑÝθLÙº¸†j0>Nãhgîq?v¯ºl!ñR6\›ñ îm=”×�¼6ÏR!ÉPÇìšj~t÷I¨õ_ ] èÔ“bò1¯6G†Rewب0¤é-,΋¨g|¸o¸g™RËñÁZójDÕñ‰u”l±ÞS†—?Ô|ê!Gb“YEî.=¥Àg„±ø)âäVß¼2Î@¿Ò°õqþüZ¯<ÜbÍ{€|v%×¾
qUn´ðòÎÉeºQaâ«y•íùßsøX"Aïà؃‘K¬Aru¹e!ŒÔÏ2V&¢ÛjU“7r°bI쳫Bîðߨ�kî <	^~)zrvt…ÅyŠYKJÛóÅ3ŒÿM�P+ÜÆ/ŠÞšÀáó]íü±¤«¿ìà¢îfiö„è^¥B�© Ù:yo¹­?²¼yÒ#ܯR&ÖÉ
ûH
ÑÁcŽîgìؼ”©bU|û²Iö>åUr»¶‘	…]²èV{wd¿�piË«-
DÁOGyMîŸk¡7ö“œzyhåBÚŒûæ ï7\Ó?�–cƒ9G“NŠâÚüá‚Z~ýš›Sɽ:yyü7%+2–Ý"ìO®èý8ñ6浫K=	Õܳé7¬o5‰aþ«Ô/v-2†ÏîRòÃ=”˜e!	ûº>uòΣµdK¹ú
+^#UíÊД"8h… º}ײ‹‡•�zŠ8c+Ìüp×ÄWo4ôÊüÓy!@àÃDLGÙ)k¸Î-b–Ù§tΖßÒ�ˆ�±•ï8�Æ{Û-=%+XZEí$m~RÜ&Î	Ýbôš¡›ûc³ˆP…æ•÷5ßGíCºÌ(‹h*Nª„t„ίfR•»C»2~ôØþ@™Dœ^ö¼�ž¨Þ(>{tc±ç
Üw¸OèÑs[Næ¼€(롤Ðê<!Ç�Hs.XïõKM£tÇN+§˜…/xÙ„Z�w›œŽ­úžž·p²¢–lQXò…Ož²bÞ–HIñ
+{ˆ£“€=àKNW%ê­®?$_µ]ÚIø.ƒÛ€Øæc"1Sf÷b¯?}J&Sˆ½Ú›¬=rx�n™
+¬#=€Ÿ¤šLé¬úó`_˜8úÃt¡räº�”Èà‹°ÊL½øšæ‚ÔÉkð¯°7?C/X¨Èø*×öDsŒcD„&—-E�?($—ÙÅø:ÈÙ{{˜Ë‰ïõmn„[ÊÖ~}ðlœz–û"uw&9F>öŠ·eU1ËÙ8[à—„LD™3zÒ—B¨Ó.1îZÁƒðŸùo³–¼BÈ»B¡�Ï\ûä¾ÎŸÏÂ7Õ/q(•*£"?{â�¶é›žRµñÍ÷PÒº%‡-÷Iˆ!Ï<œmªýŠ¸*ÉÖ÷f)l/çô,T&óÔ‘ÐoA:� íTd[;ù©A7E(Ëxç_®ÍOmA™Ý±Ya³0úaòÐeƒD«4,éúY%�t¯—WÚŸÚ[3z1~‚�ÀhœÂˆ"{˜ª¡¨¤'©fµ‰ %»6ƒÎ:gA»òËäN¡cE®ºÃ+ÜWȘâ3¥¯ƒ¼—X^Æ(Î÷`òÊ9Ýžïw²îèý¤ãbPJŽösZZĸÜX«âS)MyV\Ê}¬�å±Át|qæÍ_ñ>?çGÙÍnœï6±3�]’¨ÓKDËWL^×�À‰Yš¹²WºÑCl˜�ÖG|0f`	Ö�¡h¸$ª�uÞ­ŽÓoTk^‚•�Ç©*OvUG•&7˜5^"È?^#”Ù·«~ûZu‡}#o9¶¯ÜZ™ÍÊ«0Ó�ºÜ7ër40­GæÆþ.£[*†É�ò#�H
+ƒÜRH©È½vÑ÷,w¥Ò¢ÍÆâÂÏ—áC’—t«4`¢!x¡üR�ß3õ°C4Ü«!º¡êÜŸ•�†Šô–\u.^OZ¦|xÔˆMº£°àþ¥4‹åpï{ì,-œÖ|Ÿ wk«K’>tR¼d‡³à—côp¦½FBfYÑÏ&R®Tv?T ÆU´øàÙYüÐbseÞÿ1�%ßß±ÃQ�'þ›"ééùÞf
+&qugò4�Â�–‹Ñå�iI˜ò‡ÈŸÎg… Á—˜i„[ƒ®¶=àû{”9í¦™S€¨ÿ>`]¢d÷6ÓÅ�­dtP9ãÃIaºâN¹mP*5á]by¯-6
ÛÛ(¢žb™ÉãTˇ.ìâœf1p”¸ù‰C‹I^H€DY�ø¢ï×3Û,Þy<‚3¤«Â
¿œ»æ}‘·>¿Á[A-Üã‹dàCµÉG'_iàHߨ‡MbPb(6¹.qµ‰‰†Åb»ÝÍw�.åÕ’Ã3òÆyl*)¯»çÄé;ÒR(zäY`=ᡯj�!„gFý[ƒ”ú	ÏbÐœoäŽykiñ‡ÏÕ«?…�‰ü!LÌÙ‰¸Ÿ£Ç­ÙX¾NRì²¹Ö&1š¸ˆ©Qœ[k»Sf¬±ù0Æ	�]7Ñœ Ó¸‡¥MfÖz6åÜüT´9êrŽ>„¹ RÿÄÒM^úÉwwÉ�Aµ¾NPÃÀ‡(Úǃ}øKFâN²,ñ`:aOkí»IÛÓÆ|–AöŒ›
žšÊ§QW³Ç�¼W¤¡í¯XS¾½ËlÅJ£0í�a;$ß+ð”\ÄÕÆ\v¿>¡G»Xþ2ý1�¥�
¶oðÿ^Ï¡úˆ³Îª¦õ[%�Ó’C.B|4!7µ©¢ú!åœÌÊ1–t"÷[�Õ¯º®gq\¼e±DìI5§/±+¯³„91šQ�ýò�
5�a(ñÍûÖpõ¬“áckx5Ùm›»o¹ûâw†B�`3ôTåký}ÊH�¹dy
+JhÓÅ�*·ßE®Úk~7ÔˆHäH‰ ôÚÚÛWlÞ¦7Ù%ŸÄM—4#Wùgl2
+ó{,Ô¨çöO'ÀßüH_ø†ó,õ…AVS–ÇÎc¶ÅèNgæþ•V¾p�Í�7ÂRš[‡…À?=
6í.hN—gÚ¶µ|�¬˜é órÌòL$oŽØ$ê�bç—]„‡M¸˜œ+Õ´fâøòôù¬d´ã�3ô|^]°q� ±’šì�ñ}�´~ÁuI¶ï¦w
+s1ù¬·��#ö†Èy³?óVîUú§ˆeü·|;y™Ž†Š1ê�6¿¨ä/mƒß•¾÷C‹\…Î
÷Y�
¹‹ø&
¿o£`²²2
+“ÝlôbyÉ·Rzº	,aU/mg
¼UG
X)9·)(/iºoˆ;ð ÿHé)�ž‘ ‡gOŒÑÖ�ö`oô2TÆ	$$ô@c•¶�}§*R¢,ì‹Œ
zƒ‹±ß€ ‡,uxH³¾¸'jnùCí…Ÿ«r
+JŠW>zÞ<°j”ý¾Q
®ƒCõÔ³tO�<g—nŒ4/fJ3IÅà–[ß<¹&I°bWmŸÅ"¥4»…—¿ìhÈûº§š*‰Ð^Lÿx@ô*y½wÏä<Æ|kvn‘j¡ABSÊZ‹eFÛÌWyëЗ®o«:»lé¦8°m€�jÈù;�‰þÊ	yå!„ÕRÛ1‰óaw¯kû4ÎDp°ƒ&W_Ê@Æà�¬üóíðø.cg;˜™÷ë–OóñG�”îÏèä=O“’wÌ7RE¾Pn95V©ûWwˆ.äð¢w^m/³¼²&÷£µ§CSq”1a¦šë4x…xHSÊ/Çá�ršPxé�@YŸ½œ%r†1H„X¼	ã<ï}R)[Ãà·ª¦ÙË4÷Õ[s•RZÌ•Jø))2>Òå™±tM=°
¼¼÷}0Þm�¶ó]8G«€y ú	Á:¥ó¢WRk3'I·@Ü\¢K'ʦ<<TÞÜ̵GbøÉ~FÄtÌ$v
+etð;$L:ç¦ã‰‹fÚólÒþS³
†lœɳ%|’â-ö4¦Øga!ñS_í¡¯2£ʳœèOÂ(È‘\ò�U¨{HÕç¨!(vѪúü†ãfu%…‚½;m¥	êœÈŸy!Ç/áŽû¿Ëx…ª',¨	;+2¼õÁÄGÁS_V[ÇQêv‰]~ ‡ÚØ
+i¯@¨l;Ò#ãM‚®N~±ŸNò£€ÓÎ�.Œï£`Ùï‰Êšè‚�«qa)Ÿ‹}]#ç£n`d^ÇQ¶_;R#yƒ¢åÂG‹·Þ•¡RÑbO0"öÈõÆX<%‘{à@�¬0¨®
d•òz§wlbé¥
˜³
Eñæi}¦µ`E·lÍŒR“²…DÔd9imI„÷«	Â.†ýš]ZŠÜþT
Ti‡Ž‘ß�Øc‰5K³F÷ϧ—k-úiø湶û/PHHcCÁJ—Ó@ÂýqEéƒó£·y=׌`q=",.o-15'	ߋ΃­ÝÞtí‘S^Å5mh‘¦�Rštëý�ß&ZY¬„÷Òú0Eú­ãœcdSì²%Í®‚^ô)y¥ÊŸ<*S"Ƶ/FFðE"
‰
+ÞcÆìõÚªR¶Y‡Ü÷Š1¡„ùmÆ|Öw<‚\þTï¼Õ�þö1$n¤�¤ó»Š„tÃ<ñ÷3†‰b®çJ/+áòãQ¬KÝ}ñ[^ì »O‘ýÛÝ«o]©ô5‚=„Æm­©bìkÓ�¨Ba‡„,"J¸ƒ¸:#%¯‰‚´'ÜÃM¨F<ûé'aþnÇ!í~u¬ÞuíúÆsk—Dwó“¡‘Cgø°œi¸óv�ÄðF¿y¼´W�î.‡”¡qî¿QÇ	i©h¤ágëÕƒe"û—j“ðeyŠî³0&T·Ñ?!gF–»Î¤¶Ï‹Ì²Ýjã¢6RTðñ‰LFÌ
8ÊóXjb“?nÛ_}ÿ­OؾÍÖ‰'Ói”atÀD*΢ï®OÕ³Ò麱Wƒ†³ìD÷3¨hèL)é¶vd±—žÛϯĘÉûœ¢9b™1¾_/áN¿¾÷ݸ2ìÕ�1ÿˆ¯¸­Ï«àµÆUW“„Ôà8Úy|K »‰NkÉ�XàW€Þ,Ugmõþö–	
Îá�¾R3CTñ°YžÏµ½¡þyÏ9îˆý¸œtâµ]ì°æüÍ©œíñ·Aª˜åꣂ[˜…P.ùcVú�g~OF9DþåŒü‡—ÍH‹w•š—`ï
at˜s½Èð@5$íw¨›¸ccùt4üB”j¹œf�Ì•	�¤A1­¡Fõ�ðZˉ÷‚ØR7U+Õ ÚïgÆŠL7ý³žôÜïÎ3Djî¨`ˆ˜iýªW±+#T<Î[盪éßÎœ)Î^4‡ê3¼f0»å»?–»2˜c tÈç?Ô> î¨7¾S\Š1ì�Op¯6Ëóí�¬wäÄC«Æ¤ÃÕ~–ŠìœB)ŽX[¸øH3\dn(PuË$ÕÕq³¡\P5w@˜#¡ùÚ·¹a~yøêa"];+ƒ¼�]Þ8¾…ä’u$‹Ù™â䢭­kÆŠÊ©·]hF#œÅñ™ér45ÎWŽ4ÁÄïR«–ž÷ð¦Ç¼½N+»:…ñÕÅ}ÔØxKY˳Ë5)'SN‚iZþ™˜yÝ­9‡Åñˆ˜ãͽ+ ºø®G³úÈ"@¦>³ª!!ëaÆ')WŒ¢ÃÔ2èÖŒ@kf–”¢|Á[õNÊoþoëêÑ¿w¨òYšŒ9±jW÷ÑŒ·ÑÂpõ"ÒŒ¡‹VMnÅÔõ:@),ãð®ÄÁ^f¾if$ƒ½é&l	áKÀvêvbf‹jêâÒ
]¹¤[f${ªøeÄX
6Û{a[k}”BÉ›c•qr™ÚÙýM¸Ç–yæÒgY±à¢Î_l#î̶Ù4¤²‡ Ýoujfú‚$]MŽ*ì±Ü–‹®w^??[[}NG>�$sBÅš~Pn¯¦#d@Ç“ÓÜLàIdƒ®î¼)3’º:Ä/Ÿ5IÈ€…rŸg«~uoL¼xpxš/izYÅýô
+$Ö×håij¦æ�,.sæ­qaßÿ[i”™‡éÝŒTí„©‚ËòYåxZø=I+lï2hå¨?åú0÷•ÒÄe£JGýs¦BiÓ!­íç:‡`	ÌÌ6uÝìhr"läyú/³!ú¹Êj&1qý±0²6Ó†»”F6ÇbÖ:®;>Ý|âÁ©s¢x®ì�_“ošÞ
�‚~ËBíbŒÈ=‡}ÏAƒð�gÅ+)»Ùݲ€É­R3¯þƒ˜£¹Ú;üÑl??½:UQVªmÖ¸Y1ºxt,á$õ³YÌ�û¨{y]°´H�6PqcÝ”—9)¼Ë6u•Ä2?—÷SvK¶¬Y•É\é¤òaMèÿA:OFìA}ºzI¨…§þ‘`-Á×ÙwÖ–À'ˆÖ%ø#Fplâªm™ã.¿õ—D•äc„]ƒ“¸lÏŠÔ	þÅ�
¨°,lb?ijÛ‰{!ZîœÚ¢®‡1ðǹ�—_
+åQk¸¥£çØ÷Å_¥oÀ$«Ï4ØS«d\܉ÂA+šîæÂüŒÁ)‚«ìGî´b>D˜èm/mC‘{²jÒOÙÐ5SŽ»ÅÙSîâ�}‹ð!Ã¥#¶^[UëLVù”ØPò\Ë[ƒϦÎ,hÿ¦ýµ·ó>‡Fîk.þýH¼¤Ý®¼-–,-�¾HÅYatÇâ~*Æ6ÝäCæ]=Ù^)Û£¬P„ÎâÙ–¿d;)÷åóJÏkt/µ@é\“Úw�¼ù£6"�C(ðœ©
+C¡C×1óúÁ)7„þëM0ö­Ë,oÒC+ñ»:1²&;¸xœ2Lu�ù1�ÉÞ?Œ›Š´îˆçDœ.\}Áª©Y¤ñ·åï]|‰ï8=¨Ï|Ϋ—¶%Cç×Ê�RóRæZ^KçEK¥L-Z©¿0Ïcf%Ʊ‹,:2
Y¾º§´¼¨É“‘Oã/ħK׺,lþ˜‚œ~DÔ02Xã^±|VíåÞ¬ëV“C}‘ ,
£¿X±td;ú5p4¼È¤a°ãŒ—ä�$Hè±�¬��O¦oÒ˜ý‰(à¦Û¾F§o¥aœM5†Ï—V9á¯7Êè„2>_�89��¨(ì"·Ou2²u	ºØ”¿6³ð¡‡ª˜`×ïìÞq;š¼¡nÒ·ÔgMˆD«��d×_T¯
+<$0>ðå(å:”y�í’4¥©ãcÓD,ÏåÊ®–É:!½3‚€Äûª3Öz½ðA¡Òï
ŠéÓð·üD© žj1vIƒ
+Öˆõ)ä§�k¥Ü!ÅÃÚ/‘kÒëtçô�:6ÚÒµŒÂït˼,a½×6½§ØÙýRcìûÁ�oIdÊU)j_i¿vй‘2ÙÓ|ì
+�£ÍÙsÉÔ·›©�ÕóºÉVHáŒóçÅ:"ÃÕËDo<¸ß\W>š!´4á¿‹ÄýókØh0ˆ…aÅ6Ï
ãj”—ï4L”žôÛüžÁŒ™µUžÑŸJÌtƒu35
+ä@½SÞD¤[ìjIñ>]v·A¾î+ð²c|@,½mm׫²­´mèÒÏ�o­‡­9ÄÝëøS›¢|ÐM®ftöï¼¥a¼}H ‘&]˜Úì<<Ïòû»®$öuBfÅÂ1ÚîƳ¯[O¢Ý5xò7Ö'�x({]ú° 짱*:i«‡ûŠ>¼žWMÚã©)y­ŠÈ/^¼R;žëw>òàG)@“õíÌÙižµ+Æ#RXëæŽvÚŒ©ÍŠ³ŸgÐy\ihV�ö^ˆå­Ø•R-;Àg•ÿ¨ª©´Îb´Fž6¹Qæ
+¶@eÖøQï?±‘kœJçlbÑßdY¤0ª*�E?BObÃȶ0­6qP<]á,Íë
Kq y¡^ PjŒM"2$(hèŠ&\³ŽÝÂí>ÃÓÔi‰]'
 ŽLôó3Ä¢Ï�[åy§Ä7BåìÒT•‚Jù>dJéÕ¬¾R¯ 2o1)8Í`Öì
+^)¯B ¯À–Êù(¯9¸��‹È
ÜóX•iÚ_o¿Tסå‰g¬`½	'ýÔPmiÌ’Lø©‰$A¬{sÎ$<ºôI±€ræÿ:(#Ða�Eu¯ÿÅÕ¥ŠrGõI”ÇY‚éflŒ£<~¡Iï;eV‘ Îj³‚›I´j«š¾Î4Ž¿É0
1žÔá%­gtr/Lï~;ØL+Ô×éÈÌÃaŠ¸ÝÎjþ|¢:.×�ºÕ9')ƒtN÷ILÈ‘IòåÀfuçåƒÔC±@Pù™j¼Ø9#p¢PÛ‡{è"åÍC»dË ¢WœÀ'XEQp®:‡øg†9&Š[·¹�Ö�ç³
+:Aiž
¤>ˆé™X ç7£)Émÿï='?mS¶+Dqÿ*$
B
‚�mH’à¡.¨öî¤n$.Î%ñ¤&!̱Ê	 ÒÇXfSâ¥
+
ûS;Vt²ã3ÉU:…ºî´BàO9q6£þ"ðÅÍ#K¼Ö!D/“‰óÉ»K*°B~(µþòàÛ¿ ×Z¥nùåÔ}ç–io¾;Ѐ1Âýç‡å0
èqǧñorpƒ8ã¥×Œ¶šÙ-”/¡» Œ™	È|ºÐ\xÊõ¦a×øOòp¬HÙΩÿƒæu’
+endstream
+endobj
+7142 0 obj
+<<
+/Type /FontDescriptor
+/FontName /RLEJJP+NimbusSanL-Regu
+/Flags 4
+/FontBBox [-174 -285 1001 953]
+/Ascent 712
+/CapHeight 712
+/Descent -213
+/ItalicAngle 0
+/StemV 85
+/XHeight 523
+/CharSet (/A/B/C/D/E/F/G/H/I/J/K/L/M/N/O/P/Q/R/S/T/U/V/W/X/Y/Z/a/ampersand/b/bracketleft/bracketright/bullet/c/colon/comma/d/dollar/e/eight/equal/exclam/f/fi/five/fl/four/g/h/hyphen/i/j/k/l/m/n/nine/numbersign/o/one/p/parenleft/parenright/period/plus/q/question/quotedbl/quotesingle/r/s/semicolon/seven/six/slash/t/three/two/u/underscore/v/w/x/y/z/zero)
+/FontFile 7141 0 R
+>>
+endobj
+7143 0 obj
+<<
+/Length1 1177
+/Length2 9813
+/Length3 0
+/Length 10594     
+/Filter /FlateDecode
+>>
+stream
+xÚm·eX\˺5Š»»hÜ]‚»»»Cã4и»[pwÁ‚»w
NîN��µ×Ùgß³ïzæ�Y5Æë5ªŸžÔäªÌb–Næ@i'�3;?@ÙÖÑÜÝUÃ¤È¬´v—s3s¼ÜfHÔÔš¶nÀ4y'%À@37['�¤™Û»�¦�;@Éà`°³ñ³ñòs±½¯Ù8ÿmè樂m�|ª@7 ØÁôNI:Y¸;AnîÎζ@Ku «“;ØèÊ°z¯ðŸ3$œœ½Á¶Ö6n:-uzFF¦ÿ ì|||sï3I «­5@ó¾ð:89ÿ•í=„¿nù—­ª•™”¥­Û_mèlÜÜœùYY�­Ì€ï‹«èÆJÿ^¬ÈRÂÉñ¯®HÍOÒ´xoÌ›õŸfhròùþ#ee²üW{–îάZ [w œäÿ8¼CHÿÁ¬�nn66>6^Ðô²°aý+µ¦·3ð_$û_°ÈÒß×ÙÉ`eæà
+ô·µ¾¿�|]Í<€7°;Ðß÷ÿKüß;;ÀÒÖÂ
`´~?’ÿD‡�Vï•ÌÜÀ¶^666vÛ_Ïÿ®ŒÞ×Ò	äàýse3G €UVF^VI•ñŸúÿ_Kqq§÷°Ììy
̼\vö÷>ù¸9ÿ;ªª™íÿTÅög9�•€ïïâߧöï<€`×wUèþ%bzÀÿ�¤ìäfk
ÐýG0†lÜlïZy±ÿ£�þÿ�rúïÒîÿš
ÝßÍÞ»w(þêßáýŠü5[‹ÿŸ—™£­ƒ÷?øý·¡ðoéÿO¸ÿ¦ÿŽ.²v˜Ù9þm]¥m½€–ª¶n6«äo\dù¯«Turµýë2¿»p³ÿ§ickaºº¾Kñ_dù_I¥@N–¶ k€†Û»ÍÀ–ÿüE[¸ƒÁïsú×I½ûþ{oeû^"è´@ZYt²³këz¨#ödÞ›æàѺ{s'ãBŠw€Üe�êW&°¯ æ*ºåMË“T�°þj­
ñ‰X*þ£§=Ÿx7<v8”l4Ñ	K£ 2?ÊÝ÷K¶
¢¤8‚Œ‚C	ïaÙsòª;=ja‰),�'Ü@’ýý8bÒª’D•ƒEz>¼§�3Y‡5~¸c=’lv!‘Èò½-³�´òúÈ-'÷Ø5ÝX¦‹ƒâ¨Ü�?"d�Ü.̉õ*>ò÷Lõr<Ùt+ˆö@ö1•ÅÒî_³N"¿n�1ü@�#HI"YGA# ˜	æVtX±@ Î^(장Cá]f™›×zRÄløTäR¸+ÂËlíü|h›ä˜Xê^v²º¶6ŠÁ©7°ü±¢ï$AÝxC!U$þg®V…¬™…G¹Ñâ
+EÍ�^}ÃÞ„Î…èççBÚ^l% �M¶1àÅË3„ÉÖ0’B$9‰X0ÖÞ>šU“„yšT+Bê(¡b›²YÃ&Ýd"KŠ
qæ‰Î¥ç«"–…ËŸ�÷Í„møÇwCŒ,+$067Ïê|7¦÷±¹µ°0ÕÜîbÛ0œ%’ÂúÐBñ@i˜Þs@µÆ'[#á+?ÌÓĆ%ìC2�gãé‘	‰[P¯Q/¿\oÊÎTUs¼)×Æ^ù›ví˜ù2â�¨5kRÍ7ÓÙ•^k%üQÓ>¸1Wl.Öx˯B¸]Bù¢¶yJýZt2?1R�©1Ú~ó†ΕUÏÁ=ˆçN�113Ç7£|Žþ6­@ÿ½�qhßêqØmBÓk¸¼q*ì
>ŬC?\2=q[öµÎ5Ÿí)L*HįȧÀæ8<Ãç{;…¦-˜Žåë|<.†�
+)îþ¬úv˜¦µb>ÄO¶·-Nz­LÉûèß|a¾sò\¼|<kUú^—
+ïú
.UH¤�Õ}¹¥
+ÈOu–Çr#_¸ßDr™µŽ_C�†Yìí¡ã£�ªFÏýÍ@¾ŽEµRéÓ!;ñ·g¼1q~XŒÆœ?òç´q‘ �É<ÙŒ}·›“/ÑÅîIèå´ƒÏ+™ìI÷1RÄz»eCtu/ç
+6Ó>J‰ªÒE¢µ)Ùš�®BßÉ’Ípœ¼Å›&
+Ñá$¯ÉÌF³•òW£œ.;„Z /PÔ<¨%!³EîH–wœn™ß1�¥ª×1°K

ý¦ôºùµÝáeÆÆ:ó2ûIÆÕ{kQ
,…n¡ï³0�òp;m'|$†Ï1¦ê©³¿{(î>&踥�m�_›3,î¤rÄ`¾ÙðØ7Œ³Ý,£Z÷éÐxØà;?ÛAÀ!õ`è
+ƒ¨¿j|þué’˜¶WÙ…8C6™Zª˜µþ” uˆã�°6½Ï ¸�2’ÒYºh=çåÞ3,;—dIE¿nöôà0H¼ÕH¡!“͵"À&ü³'7ÃÕ8ÛwUà�{V‹>–s´ŒðÕ"…˜c8¬kh–-)vIÕO¹¨£$æ!÷ž{vtµ¯Ð…w9%e¥� ó»ÊMÊ·‡›€pç+²<¹± ¡¾x†ƒÑkûn{Ü�Êö«üΆ™±³¥aþÃ&`X�Útµ:äפ›ØÀAØ«~)örÙçZY‘àΟ[PX=Y8°9+½¢3eûÝ#Ÿ¥KHsyüµÂOÐã�Ï~�3+º8«û—ʼn›¶îy\®6û¨I¢èµE„¦%Ku£?õÛ`ÄÞÖÓl¤K…Ùú “¹°
+{¬¢.«*tU„gUW�»dÊÚÚ¯gŒ‡æW¶jð½ð\“m²[ýò÷–Š·‡…sÙ>Õú³ª†wïP�éÁZ;,]ï~¾0«äU™”ü|•‘�=�jÊ{["¦�u'®²ã»]w�3H¿©
ÅW&ï¬BȪO6�RgˆT�ê´,ë­të	+K¿‚“‰PìdEέ$û$&–‡¤ �ƒ³ö‹g\¬9œeqa<—û±�wפ…Lj¤k%§ÀôÑ´-†3ªL)¾×ó:~k…X„—JïºfI€Ã°uÌS™É*ÙÜÞkV	»³~îkh®ªÚò]-`åY§éÓ[{çÕÂB„~ÍwÈ
þt’yÝáLîB|–Ža7xÖ´²:~}ÅmÄÓŒ@SsFiÄL-�Þ,XÄMùì-ýâ¹¹vÀ�æ:Òï�x§O›”�Þ¼4.oø°é˜ýçòW�D�6ok®ü˜U^á§t9´ŽDÚƒ—c·5B>3r?á
ÓB`ä:s•Oõ3¤Šµ»æîc™†lâBÔ†¾?ݵð¯êG
/éÖ6<9�>Ú´•H1f夠ˆ¡©ãé@%~Ó¸5pï¥+k9¥Þ£:î´K>kÒ¸û™W
´1š
+Ú«A`Ÿl19”N~:$Ü(Òò
Ø4h±GD�|6Â�Nê�Ú'™¥:¬†ãIÊeÊ&2vÊ|XI�Ïꮄʯ/ÓøD7@$—�<¹6:•­Ô[
¨~j1Ôg?žtÃ!ñZ<	+ÑWìXƒRq‚iüTSO|_O¸}âD¿Îc1.!8Sÿqž�j�mwn}h. 7æ@n‡`âÊeÏ-/ׂ[<µ
í
+´yŒ
z~1RüdÑ?å� ¶à¦z
™ÍÚ�½hˆ
4“±(Ggè_‚…×Sˆ4&8·�›˜V6áè¿ó¹Œëeú„ì¦jΩò¯æó³�|ŒF¡y˜³‰ôãç«°9ŒI`]ˆ:�ÏU÷P²˜}ý£"'â‘Ð\±™¨ÃšÜSAµOÀE.‹‹âûÄŠ
ãÕ_Èã‰^P;Ç8÷eдe]
+ûÛe©‰àR„TbyQ@»þ›BÏë
r{áÜGív¢2ý͇k<×é–Äš%ô`${	æÈ‘@~•d*±™¥Y
+ŸC€E†BöêD¢^׌aM€Ê½ÉÍÂç-ó:®CÈìœ+TÜzágvÈ¥©ãˆT>LÞ#»cl”
+Áæ,®ócñþ¼¿ºfLW¬„ù](×JãòLî?5—g"–ñûñ„>Ö_”I”ÑâÍ“~ÅÄ™D¬s–y�üºÕé%N*Rǧ�uº«|£RÙ,¢×�“eI¹Ù5ô;6Ž:ÍdÔÌ®#ˆÜ
+â#™uöåà®=5ï[­#ö�9÷N¸Ô_
"(÷‘þd:P=ÐÇŽÓ¥‘Hõdõ»y²$ëû£ƒ5XjU.
cÜ0ÙCcEÓ
‚š¾M°/]/©¤J=“\ª\‘
;U¬äîq—Êy=¢#1ª/=^·,²ƒ~SÞSOcàto1Ž:˜@„‹øÂË/¾K�zÕrJÅX¨ç¿Â®ÔÅ¢¢GPÑ8‹ü¿7Õðµ¦ÿF”’Nz¤b–Üzhå_Š‰qï"=ÐKã{BK��¦�àV
+�¡÷h!z 2¥ãg/X‚¢uZô’Óöh}°’ÊÛžŸDN‘˜2N9!d°ïøý8/*-�Ì"Çß/Ð=Éxb~IÝ!ûZ¯öBâ ¼|ͪù`¾‡mwÙ-2ƒ�Ö©žjfÚ�˜¢ôØöíˆÕ0ø¢óШݾªŸ)ØÄ,‚¸Ž¸÷Û`¼)wi,¦É
ö	
ÅX“M*íÅ(5tëø¾-!�ˆkú#ï•6yƒ/'ÃEx‘Èá€S0.×+̓èD@0fX¥já>J¢¿É™^Øo¬,Œë99ò${0”к2¤:“ÁòÁ¼6Ô½-ã
ÁYu‰¨ºçŠUúïãR±#n¢4‹=RÊ?Öìz>=ŸýåF¼Ï7CÕå™O•¨íØ¢zLO‹$œa­�ðÊ÷o&ïóµêñ«0¬ÎŒnxÙ^³‘êðüÀ›¿-:¸H/“G‘»#»+‰Û½*ÓS&‰9â!ÞŸz’�Z¾’ñqg?¦"
�Wí#JÙw““œuîË1dF·†nTrâs’ßê7?jLý†;•ÔH<û¤òó^]•_ñ<Ô£¾•¢Ãb×<mIt±ÝS¡¨°ÓÎP
¹¿"ö�,ïs3lìOl§zl›¯Jƒfðàè’7ÑŠ9ø!’YÖèþ¾Õ–_£ABÐ
b8jÙ §ššùL•N‹_Še˜˜–윴ÛSõVûrA…"j¿#
+\6
+fîf�žtì¤ËíÊqÂoˆÙ¬Ùô´‚�ìçÏ¢`-”/Ì™Æÿ—tâ9e?BtǨm·›j�>‚aüðx}C'“Â’&"*P˜ºq�.A·Úf5Rõ/6lMð›2{zÏ¿pÏiüžE@_vÏ>ÈÎ¥²ñF�‚¸³˜¬®É‡9
Ý ]^£ïv_žv6гM\Ø1è—UÚ	~èètûoÓQ1*H¯P±7–dNçLˆè~7ôkÊwöWÌtz¨BlyÒ¯4´X ÁYS*kH¤<50Å­Ÿ1ºsƒ"»Æì+êhUn·²; É3]ŽSœ
+”=ʬüÃ%Ž¹º1òzç‰û>X[’ïámåÇxX�Š¾ÊXì;¢|ŽÓ^ˆ70IÎŽx¥tVUEë³bG¥%­@´v`|²ù„ì-9Êã4ï§Aa†:”Ô&R©onn¬Sgz˜Ý£b0‰-æAÑøÉòÁi
+5ÐÓ>«Kžªéá…æCÞ¸-ÏD9�î2èp`aÛì�Y<èÖukqø"\›b_¼H–Tž
MäÿU/-=ù­ö§‡¹'LÏ#£<v#‰!¦CØåmz4­ß3ƒYj¥
Û¿¡î~´”äð'‹¯L.©-äIo$EöOàcšå�l7å5Û̲Á1öàa%3½¸U:ZØŸÞ>WÛ­#ÆBÙì
íãnÖîAhêi%ÃfhAMé,17\V5g÷gNE‹º³.Âb^…xdlþ$ýßYÇ•K¿ÿ½®ÅìQ„Ír¥x;óx[‚Îa¬ºýdÿª(8AÝØG«lP	ûãlt0˜ÄÎ|§šFâ‘ñu
*í؉³¢Þ;TtDƒOlì9|K¥“¤ntÊ:H’�Áæçu¡;Â#*�{Ú|í©HÜŸô%¹ŒÏ4´áëfŠ7F#`¥cúi©Ïz°„Pü¸å¹�•{]˕ľÇò¼YCÒw„fŸLmªO‡r|¿*¤^®0ØP¨}œJPM`/0uö–ˆ—qÍu(Kq˜"ÚĺDAN^Ò¨2I®ñ`ù˜$ʤ9�mP
Š¡º¦ÐNjò©<
2ð|Di©«R$|’ð&•úõáà`{œÝáÇÈd¯ŸÖ‘§
+WõD‡ó˜œEÃöèX
§S’ÑG‡–[¡û$A1:ïß­mŒLˆ¸„ö
µ
!)?ß´%¯Í!3<’�õYe•m{ êÅbc±»êLŒã�
+¹KÎáÛÚ�GåBÏ~Ï6'CÔŸfaçCnBƒf-Ë­r‰o†—KÙçÆög3+ÁÚFY:µèt$tœî1+&4Ѿ(¡Ù¼øù¡›mâ\h¢uùªøù·á‚L‰�`›(Y©U•XVB#AӼଂÁö+…h–1Uï´n½¸sí	ø?^؇^ûÂ9ÅgÎK0FÔ
îXö,ª°~M
rJ!�Ýwl!Å5s«ƒ<äY;®ö´Š¬-¦MXÌ²¼YŠŠcVO©réÏÒbÂ
}%-h%�uŒ³©Ðªfc/õ�¿*±rO`t’
w¦èÅ5%	VáÆólq:äÞz
+š+B‰ùt¢L1§_„’[xCøŽTŒ½‰<ÎÞ>÷ã»wøž+H<á‚ñ+¾ÕdîÌS~Ø
`‰%~
+¥ÙÍßGž:ciÙä<�Î×Ú­ùˆ2àClà€æÀ¿{<Ûöû dsŸ)^›pÑ­b”I	eÚ½ÅgÅ^@{ž¢ûiü®l“Ì/ë"Ö4�rÉå®ÝÝ^߆»›¥c‡§ð0 >íie‡´'=x¸…Ô½E«j‡m ÖˤÎlwY5€3Ýê§ØÐ^ëÆãÅš;²’^\\ý@K„á9µ¾;ÎiôC>ÊÏ6s:jvŽ´N|êc)OóÕƒì�·4’O]qëÐÖ7„ëüÈß¹<ƒî,¢b~n¡§(u÷ÍQ%¬*�Å!°�uÿDÊ�‡¡Dó4Ô‹&-h¨|š.�Û-†Ç$M-OѼ®ùzŽ_²¡N7dNÂÆŠ”“H€î88ó$^k9Æ%K9KÇqÊg„.íÙ8c½h×öM™´Ý¥f?ø«ˆ!bªÍ/3úKL3wØä«R£s^œÇ”Ž½<ó&æÏö–(¬ËÏ
›zŠíÇâ€_±½p04ÁëÖ>Ð’HžHÍðõÕ"GWŸÊѦH™ˆå±xï­ä6¹(6FG‹2'àÒ¾þøãÝ›qf&FÖlÄÏ'P³¸¦eG
>λ¼=¥Q~Æí7“V7˜B�Ô|r;�àð‚ìµüë%¢‚».ßíËäÕc~Z	
+º»g‚fËø$
#þb(­¤Å“ABF+ÑI˜å(“cM3D˜ù1åhÌ	]Šh-cö5mo«VŠ¸ÏiVî’ѸÌõG	ª®ŒÄ6bvÚ …ÎÇ¢Þ·]æ
+É_Æ�;oñfuy&tÀM¤£öBBgT2:Ë…;y%޲йIÆ�ÞI˜ÓÑŸ"E€ýŒIªíØû Žeþ!“_²‰%hcJoà–�À�æâ�*¤¹ü¥yE_LdzäðRÆ2Ø&;›r®¿©EÐgå¾Ð*³ÎÝål£î,÷¼„©xþçA5|5-md.’DwóAŸJAD_cï2?Í"@pµ'é(oí”XþQù'üciX=/fn¥uS£MyÚö·îY}±n>)ÌÄ’ƒt¯ŒŽŽ7[íê–BE*Š©˜u,}Úlq4	©Vv"¶?8
ÈÜ7>ë¾±°M*¿’�)†ÅÈpËÍ#y¬6rÛz”sæ~·X°ÅŸ	&nö~£yAŠc^™ÕÈok/RDûäQwâ™ù
¥_B.Ø|?ðžõîù<Å&ÛåÉJÔ`Y+š¹‰ÎÓ�‚k~çU&_¾—h¦»ùSâû_¸h®Èáhé~oÍ\rðTê×ïæÜ�öû»Pþ‹–t•tSŠ	Á{žK	)sV¼/_4ˆ"D2)¨X4Ïå_ªÉŒ•w¶ôNzQ‚Føà<,L¢q¬º5"`{ç v©nFbB ¬œT-y@"È�@;(ãtSSmWýz‚JÖŒée⻾º(Q‘áz¥H“U'Z¯Å�Óh¹Kò1xm¤uB
FÚÜXës¬�yâ*u a¥Úßµ´Ð¦óØ•c\2E;�Å|G%¦H˜�`ß`{’b q”T§|6L;kÕí
¡þ
+´cgõÖÚ¤…X‡“èÖ¢QÄvÀ\‚–½o$IJð4Õvò¶sM`®x¨D÷¹F Ð|ñøß)X?v"ïDOŽåWô0ãg—ùã2õJˆ~9“W­I,+‰áЯ2�¼ë'd�\q‚œ@úÝÖ!lŸËž”©c[·¾�·ë¡b²0¡˜Ì{a²Ôn¼0ñb�5Αã¨ÄH²ÕxÒ±z^æ�sÎ2þ*?2kI¢ š­–²t}®T�¿Øù¨™ë‰þŠ{ñ´Éa\“œ˜Ý#�%DB#øä°Yƒ0‰Æë�`µ§fuÆoû%ªÓÝ<úÉWŒ
ÁOCñ—A<]ƒà¨Ì"–Yç|¼=³<ùèúÑDt]H)
+%6‹é8Õ!•N:ø»äNŒ�‹
'[bÂ(j«Z{ÕµP@¬
ËÆ7ç(þpâƒÄ+È:	t(Çß”-Mäª&°¢™ÊH�:„bÅ{œîúdr
+}íÀDM)Ç…¢S÷õrX"a貧�ˆ¢‡ötÔ¸;ªÞ‚¯)¾:¹XHhFÅ{ß]]Ô8!XñÐäõºxX”fH•h?j_ßAÁ"Â:ÐuÖþiÒ¾NŽÚºH�½ÈÚ»Œýa_(.·I2ßÊ`qÚ[Ð<cÚ3A¦õµ;ü)·Æع»,Öuÿ•ãK=¤A£XôËßF‰Ëtzûëø|àÃ`öf”[	Ú©tù²±&O¸³î'«µØ‘ëµ�8œÚ·Ü¤¤…þðJº®ʯ¤‰
+¡¥™`Ú±Ÿ‡î�ÄÎÛM@«ùm.|\üL
 üŠ-Ù®äUùt�[³
|Zfu¿Î,ˆçì«Ò’½p}kªqohÍ*~„
+¬�=Ñ–Ïö·O%0U1A–Å2\ð¡G꽋·ýTUe¹0ÃÏ*јN‘ÝÙY´/°Þ+]©?j��—üz´Z«h"Ö,�Ghã�éV
þ’M�H<@%êiÀË>M­
ûÛ™4NfL‘j…쨸ŸjΞpå­_ôÞV­^ûÍqgK‘JW
+Õ„3ö’·qå^‹³Æ“Z©�Áàç`þš#E³(€»±}¤ÒN“ã¥éœà<ðe²�vI¯‡ÌFÆЃkK³ñQñȤ�rñ¹³+ÅɽÆÚ?-®s¡qßd¤íí¦¥¦tôºû³PžQ,ÎаèF2BS7áôp[ò­‹Nñ²ù¢Þ‰D¢³“2CNèd±eªg¹¹�ðÀ‘}�«ûš¼¿á@‡o~ƒc3;¯ñãOÐRs©´õ.>÷ÀÒOßÂ$‹Ö`ü-ø¦š«Nìåêú>FIžv6çqøa¬W̓Áö®ÅdTáÁF‡'@Qru©u+¢‰ç³²ù³³CdE|‚ ´ª»†uŸ”ZŒÎMÊ
ȼ;¨äç¹-^):5ZÒWŵ“…øNV*dŸãoŸ‹J±ŒJF܌җ‡F²·enŠ´Vfž9ò
+KëSEl`º#·3\ö�áEÎÚýo;�¢X¶Š±G¶4–ÖÆáC¢Â
F>øŸt’�“!WƦE¤Oèÿ ·ížh~þl��WE·mp]
·bctG1�ÍLpBöJнï6÷ JÀÖ÷vË£ÖŽ×ë
+¯Áí”kŽ¦ã°×�Á]¢ŒoÀÅ®Î-yY]“�|f¦ëL¦oŸz¤ðëÌwc2ëˆWmÅD»÷¼l¡¸í=“
+«4ŠŽpË´î&…›{»Bá`—öÅ¥·š…q@¡Ô:¬ÇŽî•jqÑ==�Òº��×y¼c7åŒdÅD‰n^ŒÁÔ<ëÀn¾Ÿx‡—“K­Ÿí6óÞ‡	5ƒ3TÌ!PwS§öÙPã%¡1,ýÝÙC:¨ðò…ëg•)§¼Ï¬®_°t¢ù•hÈ[ˆ <‘~¦ý5®7dù¡<óÜ€û£&¶¡b�
+Á8X	»žnåL”…‚°Ä´�·ôj'urÙîRMÚ‚¾róC¶g0¦U’A-|_�¾ŸqåÔð•jÇ´¦Ñe(ÚZKÖáÅê•UYCuP^ÒgôÈë[ðõQïÇF)Mgõà´�[¿ð6!í
Öñ(Wò‘ôc¾Š÷~¡eè!s8Â9&§D*}æ}„Àõhô?Á�4†ÂÑ©B…D¢A×Á!%å#ô>I´!/ÒÂÜ^0æX\`± (7Æå±mhJ0;õ‰/\ò&­ãÉånõÓ
sI•}Ï‰ÃÀ/Aaþ-Aa?î"¸ÐB=	õ¨(G£{žS5ˆê™øßô{-ƒ›Ø-4 Ö†:+Ókü¿ˆæY¯P~„ÜÄ%¶2Â|̵¥.hô½1/­gð¸ñÞzÂ:ÐÃm�nܺdZ�Q´æiòçò)2ôdK@„vþMÛÊñjL“à1}gGZ
×ÅÀÓ
RŠerU»9gúZÝŒÎO$MHm3.H¿7û°.Ñ¿8°Ø6QŸ¼Æ�Öp¿Å¡ùÀW¡ ¶óP‰"¼<²Oêõh7IˆòjÍîBh” PC”®ÓZ1•˜ä³Ñ‚œe
~¡O|p¶Ø‹2Ô|í$¸y4˜í\å1Àz¸â•Ä4­™Ro#�$P²‹'5e¶®üÚ^‘æIÒÈ‹€‡)¿ð“wÌ65€ƒÿcò´î½ƒ`$ÉdAá(q›jò]ê£ÏØñ~‡„ËŽ¹
+�Ð�ùâ¦�nn
õï‘™U»Q0Di³€¤ì«ZâªRºD£	[9Í©û`l¥-?J¬&Rl½TÓ½ÌôI¦ÃA·gk[ŽŸ&Â¥DMJLúä2�ºo¹¯*0n�
+Ég`½UÒnѳÂô8µát3+p|i²©•ø8ý2jË#*î˜�*�¡ÓNiŸ)«Êm‡™X=½—6‘Í‹»�žV«»(jáeù4Ï–26‘x^LŸ»AÕûÜÃÐEH¥^=Øia¿)µ¨-Fœ‰*ÌKh`t
+�§[zœ/µÓ€ß`9aß<=êJÙßп£%—!K<¼¥Ë:«˜ã;¿
¶
m±­‘±‘ÁÇbw›uüÖ9ó!Guœ†‘Ä¥,øçÂ;Û,1
+÷Ò|Ç}B$ó=¢¥¿ŽÛÂ"
×BG]�l˜ìþñìæYFóRCòBÏýdjÔ~~Ö•¦ž¥mz,K'³Îèôfÿä#èdÙÈ3ÂÈEA/žãèNWü<LH/ÓÛpP¹áÎõeëóÊ Š¹ìÀ)è
+¯•ý¡ª,šfi%	Yï
+¥Ý‚ÿ<¦JÔhÁú³g�ÓÁîƒ&9šËy}×"rÜbü Bd²‹§ùëéÜ:–¡dˆÕÝ•uÓkü33È‘|�Hù—°ž‘‹±Œâš»þ…	Á[³?S}mW­WpR×f©ßæ~m
+’ÉÚ°*Ü8NŒRõý/&@Ä�¤J¿ÃœI\­êQê#R÷ÕÇ[¥Ä(#–%æ{S¢¦RGpøDx¶ÃÇx uå¸ÿt§ÐÈW¦8éo0…¯
Å¢x`Í=ÖG`/�íBºiµåÇeÈådÈÜØxÊ~1¯WÒªâyéÑnƒ‘bëE”M£RU~Ùý™(Þã;/Ò†élBÜ¢‘ÿºs'_7œ�_x^-)ÏÐ"j{ÊE
9Ó÷	Þ<ݱu q]ÐÕæž…zQW½ö¨ýYwÇ`åÝXì³8U¾OúJ‡êCõUµœ0pÜÜç’_÷ýÂ×\ió[Àf“–¨6¯$Z-eÝ"LIFDïd!£Ô}»ÅE´9:*wÔ}c”µzÊdÛ	r¸‚(ä[ÂkEiûà‚/Ãø—ÀH”ħzý@Öâ�³ÊS8F‘P_yȪyx¦¼µ�ß$ó
`ìKÊ�¯kŒ-wQBùƒm¹!v,Ú§,F}cê 9¢ÓàÉs FËr(¾æèΟdö‰/UXr,\"\•§ÍiŸcës@WåA‹ñÛírüýÚ Bë<œ
‚FÊUÃôÕ´A4ûö„ÁŽQ&½
áî¬È—Ÿ9_ó@¤ÊA,˜�ýâ[øÕ¾ðA
|™}y“À©çë%�¼`Ò¼Ô.ÙkþLÁ:|’vƒ�™f ù¸.|Q±+8YÁêŠq3±™™€ �ùaÍ š|eº.–3Ë��×lZ¼
+€óÉø:So¿C:ÄW3ý(cn>
+�‹·Ê*¬óÕgu-ÁnU5¾¥Óí|]¤maCÝ,TßÉýýÔyѧkDµÖ’Dª_ ¨í¼¤°ì!ª~ç")yβ¦Á&]ÄçýaAØ´¦µï¡á6LŸWo8lÖoRN¶Po®ÏMâìHÔT­¼ü�¼ W×zèf
̆ ý݈üÈÐY;=$Ù†bsÝ¥iøЗ¢è =ÈœIu†+RM>X[(ÿé‘¥qv¬:®²5ñùÙš*°‘xuŒ›$6«Kˆß
+çD^ûwE˜1ñùp¿Ò‹•ÙN€P°úò¸FR-]šæzðÆícŽ
(2âJ€fDöpA½uê
çòå;KÚÛ¯�{©cí4ž×çHŸøq}ofüG<�RA4Ÿ;דW�ã!ŸÇuÉNÛúb™ ýgýV è‡^éx�ñ„iÅñFâ¨|Öx=¯ÔQΣÞÃ:	¨9¢Íûåq΄
Ìü	
+�/&Ñ9óÆÆ—ÖÁè¡ÏȦèÒ€egð‰%V½zO¤B	Ƚ³»&3‰3‘}¤àYU³8ëäj÷R|BÓHú0ªÈtÿÔ+óv;ì’‰]ZÊ
þ{:ßtZ"©$ùq¾a|UºàìëV8Ò,‚.ÁiŠhÙ3—NŽ-1[]Õ±Íèaþãq¹×R i*fQˤKô`×Ý­äv‹±ÚÀ™t‘<<e†§ehø¢ÄãÙŽú]±er¤Àý�½„ÓþÓÛôz¨„$‹2ÑÝùJ¸¨
G‰`RÄâÄå_x»
|]Û¼U!òjÙ\jKßm�P2_˼#ŸúN×<ª5SE$Âsu±¶1‹#*$Ž˜~HÈ
+í
+”¢N¥'ùWxc|v"öú—²›ß¢yçÄ®F3œ„ͬñ
+æÜiYz,ïÍŒmê¡"Ð9
¥
÷<r@
Ó
+pŒ§Œó­Ê<Kò%ä“çâ^Å8VFä=M•ûL“©Ù)•#ˆ—9!±¥kò¡�­KúJ_xï)¯Fô8Ð�
¦uú¹)„#,cKä�$·.š¬ø^~»•Z01¿i�óêP­‰ÛS'[œ%¤ýMH»ÍE>kXÏïlr³ö<‰çfz
�O[ÝBs;]üd‡‡�kK¿×Nc§ZλðÁ†y‚v—?7ÑcS©n£l\ŠKk°=k*¤U:b¦ ÕŠ\Op¿ó;1�-Å3˜«Š"ìó:'G4J@Ú^Âò,û‰Ñî=‹ÎŽ~ôûo›lÈ{xéxç*D—e?ÍERÑ2g¶Úí­HªÜ,š\Ò¼ÌrcNŽ~—¬ë­ §t¯ ^
ZšÜy·¥ò”ÐðãœúiM€ä›w"ëlÌ÷ÝÔxûI¥&Ó©ÿ­9I#
+endstream
+endobj
+7144 0 obj
+<<
+/Type /FontDescriptor
+/FontName /HGJHMP+NimbusSanL-ReguItal
+/Flags 4
+/FontBBox [-178 -284 1108 953]
+/Ascent 712
+/CapHeight 712
+/Descent -213
+/ItalicAngle -12
+/StemV 88
+/XHeight 523
+/CharSet (/A/B/C/D/E/F/G/H/I/J/K/L/M/N/O/P/R/S/T/U/V/W/X/Y/a/b/c/comma/d/e/eight/f/fi/five/fl/four/g/h/hyphen/i/k/l/m/n/nine/o/one/p/parenleft/parenright/period/plus/q/quotesingle/r/s/six/slash/t/three/two/u/underscore/v/w/x/y/z/zero)
+/FontFile 7143 0 R
+>>
+endobj
+7111 0 obj
+<<
+/Type /Encoding
+/Differences [2/fi/fl 31/quotesingle 33/exclam/quotedbl/numbersign/dollar 38/ampersand/quoteright/parenleft/parenright/asterisk/plus/comma/hyphen/period/slash/zero/one/two/three/four/five/six/seven/eight/nine/colon/semicolon/less/equal/greater/question 65/A/B/C/D/E/F/G/H/I/J/K/L/M/N/O/P/Q/R/S/T/U/V/W/X/Y/Z/bracketleft 93/bracketright 95/underscore 97/a/b/c/d/e/f/g/h/i/j/k/l/m/n/o/p/q/r/s/t/u/v/w/x/y/z/braceleft 125/braceright/asciitilde 149/bullet]
+>>
+endobj
+7145 0 obj
+<<
+/Length 696       
+/Filter /FlateDecode
+>>
+stream
+xÚmTMoâ0½çWx•ÚÅ$�
+!Ù	‘8l[•jµWHL7IP‡þûõ¬V=Mžß̼ñs÷ëu;ÑU··õÈÙ›=w—¾´“ì÷îÝÝå]yil;<[[Ùj<=?±×¾+·v`÷Ù&ß´õðàÈ›¶<^*;²~&ûQ·�‚>ìþÝþ�”MS>Ù_êãP·ò{=éÇsæ@öd”ôÇöçºkŸ˜xäœ;`ÝVY×`Œs4½JaÓQÜ¡n«þª‡í¡.’Uu9\ßèY6î>�¼ý<¶Ù´‡.Z.ÙôÍž‡þ“4>DÓ—¾²}Ý~°û¯ÒÜÑör:-d0­V¬²WÑÍÿ¼k,›þ8ã�óþy²LÒ»ðºÊ®²çÓ®´ý®ý°Ñ’ó[Å*²mõíLrŸ²?ŒÜÔqù¥ã•â5
F8@ šˆ=�@Šð)&° 	È8Ô¹€ÂÅRx u€Dº\j2H—†ª¡ÐV�Á¹0CzL]øÂb°ct‘I	©g$`htÑ‹0œÆ\F„áŒ0ä†sê�‡ájd<—Iê6œ»õñzgóñºË»þêW¤qÈ�’£+—Ÿ#ö•ñÌÇkÄÞ

.‰bªs��ré…¤šáæÄç†bïmŽXú¾„Kß7ǵHß7Géû„û¾nb§>&jÊØ�µäuœ�¯¼ú•ñ1ÜV™÷•âÜãâµÇ‰Ou$ÕŸqWèS/%1{\øxB!€§ÔK(hH©—TЖ枃»J©Ï�ϯv×ÜëÁ=küÒ2ø¥UðKÏ‚_:~é$ø¥Óà—ÖÁ/�¿Œ~™Eð+7¿èË¢/	ÿlì¡ÛÒ(/}ïö	-+ZXukoûìÔ��E?Z„ãæÅÛKýqíƒÄ
+endstream
+endobj
+2944 0 obj
+<<
+/Type /Font
+/Subtype /Type1
+/BaseFont /SYFPBV+CMMI10
+/FontDescriptor 7124 0 R
+/FirstChar 60
+/LastChar 62
+/Widths 7115 0 R
+/ToUnicode 7145 0 R
+>>
+endobj
+7146 0 obj
+<<
+/Length 695       
+/Filter /FlateDecode
+>>
+stream
+xÚmTMoâ0½çWx•ÚÅ$�
+!Ù	‘8l[•jµWHL7IP‡þûõ¬V=Mžß̼ñs÷ëu;ÑU··õÈÙ›=w—¾´“ì÷îÝÝå]yil;<[[Ùj<=?±×¾+·v`÷Ù&ß´õðàÈ›¶<^*;²~&ûQ·�‚>ìþÝþ�”MS§“ý¥>u;áà¾×ÃÑq~:fc_0F)l®»ö‰‰GιÖm•u
f8GÓ«6•ê¶ê¯bØÒ"!YU—Ãõ�žeã.ÉÛÏó`›M{è¢å’MßÜáyè?IáC4}é+Û×í»ÿ¢Ì�l/§ÓÑBãÑjÅ*{pÝìϻƲéOÞ(ïŸ'Ë$½¯ªì*{>íJÛïÚ-9_±eQ¬"ÛVßÎ$÷)ûÃÈM—ÏñP:^9À ^`„ª‰Ø	¤Ÿbrš€Œ@
‘{@
(\,…RH¤Ë¡&€ti 
+mœ+3¤ÇÔ…Ï ,;F™$Б€‘zF†F½ÃiÌeDÎ(ó0œAº1a8§Î
yΠFÆÃp™ nù[¯w6¯»ü·ë¯Îpµ@‡)9ºréñ9b_iaÏ|¼Fì-ÐÐà’(¦:×ù(—nQHªY^`nA|n(öÞ戥ïK¸ô}s\‹ô}sÔ‘¾oA¸ïë&vqêcâ ¦Œ
YK^ÇøÊ›!¡_Ãm•y_)Î=^ ^{œøTGRý÷w…¾1õR³Ç…��'ÄxJ½„‚†”zImiî9¸«”êðøüj'pͽܳÁ/-ƒ_Z¿ô,ø¥ãà—N‚_:
~iüÒyðËÈà—Y¿2qó‹¾,ú’ðÏƺíŒòÒ÷n�Ъ¢5�Q·ö¶ÍNÝ	Yô£58.]¼½Ñ»á‚ò
+endstream
+endobj
+2886 0 obj
+<<
+/Type /Font
+/Subtype /Type1
+/BaseFont /VQCTSW+CMMI7
+/FontDescriptor 7126 0 R
+/FirstChar 45
+/LastChar 45
+/Widths 7116 0 R
+/ToUnicode 7146 0 R
+>>
+endobj
+7147 0 obj
+<<
+/Length 900       
+/Filter /FlateDecode
+>>
+stream
+xÚmUMoÛ:¼ëW°‡éÁ5?$R.¤d9ôMðð®ŽÄä	ˆeC¶ù÷�³k›m‘CŒÕp¹;;†wŸ~>Î|¿Ž3óEŠ_ñ¸?O]œ5߶‡âî®Ýwç]Oßcìc]=~?§}÷Oâ¾yhÆáô9%?ŒÝÛ¹�׬�“B|Æœ‚>âþ)þ;ëvÇw%gÏçáí4Œ3‰ä§áô–’>\	‚‚6ý§ã°¿
+õEJ™€õØ7ûÆ8ó1¿’{Æ~ºðÏ`W(-ú¡;]¾è·Û%=°ùñýxŠ»‡ñe_,—bþ+-OÓ;qü\ÌL}œ†ñUÜÿI--=ž‡·B«•èãKª˜æÿ¾ÝE1ÿpÆ[ÎÓû!
+Mߊyuû>Û.NÛñ5K)Wb¹Ù¬Š8ö­iÇ[ž_®¹uÊ•MúÑzQ­Š¥Ò)V†€Ú(
TØ€àx¿
à
Þ¢
 žjy‹°°!À
ÐÔ•µZÔÀ2àP="¦ZdÔ0\ÃG©R\¡·”).–2*ÎШa!„U¼Ä,†³ÔÛHð° `+jÐÃ.¸5Nα@èâ°èÐVK-à
xŸ%ô˜Ü3š% A°YÓ€z¡ÎšÔ>kP#¬³¦
õ™5m0W£oš¦Ã¾žj­®§Üý·�.†ÐZ¡ŽT$X/©)n)æ#W—„o(æ“oÀRZÞ$K¢p4’ŽZ¶-bâ\­1¦Ü°Jä	æP"Gñ‘XÔQ¬‚i/8ºkÉ^€ÂZqŒ:ZsŒ½š9”d š­BùŽ)ßsLù-ï7½æx�˜ÏJ�›¡¾Ò`¯ažÉ½)f¥É$†µ’
1™¸
+dÑŠcªCZCù<£7Ã3JÊgózÌnøþHÈ°íáÌY�ÉšäTœ¯a…Šï¯Æ,_»œ-Ÿ—Oë87Ë}êÛKÔ´Ü—Ll¹oKñšò+Êg­JÌâ.¾GZyóº‹Vð�c­48¸’ï¼äØWtù]Í:P~`�áŒñ±–rZŽq.nÍ1]Ç
ÇàSÿæ/©ßP•ýïuö¿7Ùÿ¾Ìþ÷Uö¿·ÙÿÞeÿû:û?Èìÿ ²ÿƒÎþ&û?”Ùÿ!dÿ‡&û¿1y–¦¼ÍH·œn5þ¹ã)º½ÝyšÒ“Bï½x#†1Þž´Ãþ€]ôGoáõñÅ×�Mñ?®Xê
+endstream
+endobj
+2949 0 obj
+<<
+/Type /Font
+/Subtype /Type1
+/BaseFont /NBBWCW+CMSY10
+/FontDescriptor 7128 0 R
+/FirstChar 3
+/LastChar 106
+/Widths 7114 0 R
+/ToUnicode 7147 0 R
+>>
+endobj
+7148 0 obj
+<<
+/Length 900       
+/Filter /FlateDecode
+>>
+stream
+xÚmUMoÛ:¼ëW°‡éÁ5?$R.¤d9ôMðð®ŽÄä	ˆeC¶ù÷�³k›m‘CŒÕp¹;;†wŸ~>Î|¿Ž3óEŠ_ñ¸?O]œ5߶‡âî®Ýwç]Oßcìc]=~?§}÷Oâ¾yhÆáô9%?ŒÝÛ¹�׬�“B|Æœ‚>âþ)þ;ëvÇw7{>o§aœIä>
§·”óѲH˜ø´åŸ8‡ýøU¨/RʬǾÙï0ñ˜_xˆù•ÙË0öÓ…ŒxµBiÑÝéòE¿Ý.‰�Í�ïÇSÜ=Œ/ûb¹ó_iñxšÞ‰áçbþcêã4Œ¯âþfiåñ|8¼E°²X­D_RÁ4û÷í.ŠùGÞRžÞQhúV̪Û÷ñxØvqÚŽ¯±XJ¹ËÍfUıÿkM;ÞòürÍ­S®lÒ�Ö‹jU,•N±2Ô@	 "À–,Àû
 ð
õTË[<€5€

€¦¨¬Õ –
€ê1Õ"à†á<J•â
+½¥Lq±¬�Qq†F
!¬â- f1œ¥ÞF‚‡[1P€v
À­
8prŽB‡E‡¶Zj™Àû,¡ÇäžyÐ,

‚ÍšÔuÖ4 FðYÓ€a�5
¨×Ȭiƒ¹}Ó4öõTku=åî¿ít1„Ö
+u¤"ÁxIMqK1¹¢¸$|C1Ÿ|–Òò^È Y…£‘tÔ²mçj�1å†U"O0‡9Š�Ä¢ŽbLƒxÁ9Ð]KöÖŠcÔÑšcìÕÌ¡$ÕlÊ_pLùžcÊoy/¸é5ÇÄ|V
+Üõ•{
óLîM1+M&1¬•ˆÉÄU ‹VSÒÊÊç%¸žQR>›×cvÃ÷GÂ@†m¯gÎ
+üKÖÄ §â|
+T|5f©øÚÕàlù¼xZÇ1¸YîëPß^ê ¦å¾dbË}[Š×”_Q>kUbwñ88Òʘ×]´‚k¥ÁÁ•|'à%Ǿ¢ËïjÖ�ò{gäˆ�µ”ÓrŒsqkŽé:n8Ÿú7ÏxIuø†ªì¯³ÿ½Éþ÷eö¿¯²ÿ½Íþ÷.ûß×ÙÿAfÿ•ýtö0Ùÿ¡Ìþ!û?4Ùÿ�ɳ4åmFºåt«ñÏÑíÙèÎÓ”^z­è¥À1Œñö öì¢?z	¯ï.¾~lŠÿ
P}éL
+endstream
+endobj
+2885 0 obj
+<<
+/Type /Font
+/Subtype /Type1
+/BaseFont /OAJWTE+CMSY7
+/FontDescriptor 7130 0 R
+/FirstChar 32
+/LastChar 110
+/Widths 7117 0 R
+/ToUnicode 7148 0 R
+>>
+endobj
+7149 0 obj
+<<
+/Length 900       
+/Filter /FlateDecode
+>>
+stream
+xÚmUMoÛ:¼ëW°‡éÁ5?$R.¤d9ôMðð®ŽÄä	ˆeC¶ù÷�³k›m‘CŒÕp¹;;†wŸ~>Î|¿Ž3óEŠ_ñ¸?O]œ5߶‡âî®Ýwç]Oßcìc]=~?§}÷Oâ¾yhÆáô9%?ŒÝÛ¹�׬�“B|Æœ‚>âþ)þ;ëvÇ÷zö|ÞNÃ8“È}No)ç£e‘0ñ&hË?q:ûñ«P_¤”	X�}³ßa†c1¿ðó+³—aì§ñj…Ò¢ºÓå‹~»]›ß�§¸{_öÅr)æ¿Òâñ4½ÃÏÅüÇÔÇi_ÅýÌÒÊãùpx‹`!d±Z‰>¾¤‚iöïÛ]ó�¼¥<½¢Ðô­˜U·ïãñ°íâ´_c±”r%–›Íªˆcÿךv¼åùåš[§\Ù¤­ÕªX*�be¨-€@E€-
X€÷@à-ê©–·xkM
PY«…
@
,Õ#bªE†A
Ã5<x”*ÅzK™âbY!£â�BXÅ[@Ìb8K½�
+¶b =ì€[pàä„.‹mµÔ2
€÷YB�É=ó Y›5
¨ê¬i@�೦
5Â:kP¯‘YÓs5ú¦i:ìë©ÖêzÊÝÛéb­êHE‚ð’šâ–b>rEqIø†b>ù,¥å½�A²$
+G#é¨eÛ"&ÎÕcÊ
«Dž`%r‰EÅ*˜ñ‚s »–ì(¬Ǩ£5ÇØ«™CIªÙ*”¿à˜ò=Ç”ßò^pÓkŽˆù¬¸ê+
öæ™Ü›bVšLbX+“‰«@­8¦:¤•1”Ï3Jp3<£¤|6¯Çì†ï�„�Û^Îœø—¬‰ANÅùV¨øþjÌRñµ«ÁÙòy9ð´Žcp³Üס¾½ÔAMË}ÉÄ–û¶¯)¿¢|ÖªÄ,îâ+pp¤•70¯»hÿ8ÖJƒƒ+ùNÀKŽ}E—ßÕ¬åöÎÈk)§åçâÖÓuÜp>õožñ’êð
UÙÿ^gÿ{“ýïËì_eÿ{›ýï]ö¿¯³ÿƒÌþ*û?èìÿ`²ÿC™ýBöh²ÿ“giÊÛŒtËéVãŸ;¢Û³Ñ�§)½(ôZÑK�7bãíA;ìØEô^ß]|ýØÿs‰éQ
+endstream
+endobj
+3175 0 obj
+<<
+/Type /Font
+/Subtype /Type1
+/BaseFont /FRNIHB+CMSY8
+/FontDescriptor 7132 0 R
+/FirstChar 3
+/LastChar 3
+/Widths 7113 0 R
+/ToUnicode 7149 0 R
+>>
+endobj
+7150 0 obj
+<<
+/Length 664       
+/Filter /FlateDecode
+>>
+stream
+xÚmTMoâ0½çWx•ÚÅNB°+„�8l[´Ú+ML7RI"ý÷;oìÐnµDoÆ3óÞŒ?n~<ï&yݽÚIr/Å‹=wWÙIñóÐG77eW]N¶­­m=®žijëª�Äm±-·m3ÜQð¶­Þ/µ£þ´²oMûq»·¿'}åœvúIÄí›á�Ö¿/	²ÅÕú˺sÓµBÝK)ɱnë¢;A÷9šn1Õ›¶vA€x…œHÅ¢nª!Xü­N4$ï>΃=mÛc-búB‹çÁ}°²»húäjëšöMÜ^U‘wwéûwBFË¥¨í‘ŠQ¯�‡“ÓïM]—÷½1ÛÊ«©ºÚžûCeÝ¡}³ÑBÊ¥Xl6Ëȶõ·5R^�clF±rŽ�JÕ’kà
;æ%9”&¬}â8KÉ£|Ìy’091Ûx‡&G¦Ϲ�ÌPT#Zƒ%ö)&!lRv¨D¡r䨑\#G�|í»bÇš›»HÍØUõçà¨äʸ4è'ö22ú³�|Ú –^DŠÎäÌç¡m©=^
�sà•ÇèS<cL’ýŘùUÙŠùã„ý_¸3Øé;èS³}Ш2?}LNÍ=ç8g,™åýÌéuÑ..Q/)87l	ã°_Ї¹ƒ?“£?íq
ZqÍóб�Á<4÷¤4谡Цg~·Ñ§ö³,óI’	4èœsY�^y?4hÞv5ãšÐO#æܵï‘y7ŒSè4�ñ&ì*ãsÙ¸0¸PÇ.œ9Sú¹�Ë0׬à˜pÀ•—~ne8�|âpÑð\¯ouqŽn6¿|kq_›Ö^•¾ë‘Å~�Æ÷ÖÓ&ú¡Öam
+endstream
+endobj
+2883 0 obj
+<<
+/Type /Font
+/Subtype /Type1
+/BaseFont /LBMWZU+NimbusMonL-Regu
+/FontDescriptor 7134 0 R
+/FirstChar 33
+/LastChar 126
+/Widths 7118 0 R
+/Encoding 7111 0 R
+/ToUnicode 7150 0 R
+>>
+endobj
+7151 0 obj
+<<
+/Length 665       
+/Filter /FlateDecode
+>>
+stream
+xÚmTÁn£0½óÞC¥ö�ÆBì*ŠD ‘rضjªÕ^SpºH
 “ú÷;olšv»R‚ž3óÞŒm®~<î&yݽØIr+Å“º³«ì¤ø¹ï£««²«ÎGÛžî­­m=¾îÄ£ëª�=‰ëb[nÛætCÁÛ¶z;×vŒúÐʾ6í%:âúÙþžô•s�vúI>7§7
+øöN!.„àà_Ö
M×Þ	u+¥$bÝÖEw„õ!šy1
š¶vÁƒx�£HÅ¢nªSXñ³:Ò�¼{Nö¸m]´Xˆé½Nî�½ÝDÓW[×´¯âúb‹èݹïß,,-—¢¶ªFýÞï�VL¿õõñþù½·"æµò~ª®¶C¿¯¬Û·¯6ZH¹‹ÍfÙ¶þç�
+)/‡16£X9ÇC¥jIÄxÃļ$BiÂÊÐ#Ž³”ˆåcΓ„‰@Älã	MD¦Ϲ�ÌPT#ZC%ö)&!lR&T
ÆG¨„ˆ5ò‚k䨑¯}WL¬¹¹±‹ÔŒ]UöŽz@®ŒKƒ~bo#£?¯“ËÂÒ›HÑ™œù<´-µÇ+`ãq¼ò}Ê‚§¢bŒI2_Ì�Y_%°­X?N˜ÿ¤�a�~Zjö•ƒG•ùécrjî5×À9cÉú+ϳ¦÷E»H¸D½¤àÜ°%ŒÃ~ÁWæýLzŒþ´Ç9<hÅ5cÌCÇ>óÐÜ“2ð Ã†Â›žùÝFŸÚϲ`Ì'I&ð sÎe?zåyxмíjÆ5áŸF̹kß#ën§ði‚âMØ7>TÆç2´0´PÇ-œ9Sú¹AË°Ö¬à˜p •—~ne8�|âpÑð9ø¸¿ÕÙ9ºÚüÍà[‹ûÚ´öã³Òw=²øÏߣñ£‡ÕÃ&ú÷Âc˜
+endstream
+endobj
+4060 0 obj
+<<
+/Type /Font
+/Subtype /Type1
+/BaseFont /TSKHNZ+NimbusMonL-ReguObli
+/FontDescriptor 7136 0 R
+/FirstChar 44
+/LastChar 122
+/Widths 7112 0 R
+/Encoding 7111 0 R
+/ToUnicode 7151 0 R
+>>
+endobj
+7152 0 obj
+<<
+/Length 665       
+/Filter /FlateDecode
+>>
+stream
+xÚmTMkã0½ûWh…ö�F²G*!àØ	ä°miʲ×ÄVZCcÛYè¿ßy#9톅ļÍÌ{3ú¸ùñ¼›¤es°“è^ŠÛ7ç®°“ìç¾
nnò¦8Ÿl=<Z[Úr\íÄs×;;ˆÛl›oëj¸£àm]|œK;Fý?heߪú+<âöÕþž´ïº›ÐO"îµ>hýzI�-.¶àÐ_¶ë«¦~ê^JIŽu]fÍ	ºû`ê¹ÅtTs¬ê²óÄ
rŠ²*oñ·8Ñ�¼ûì{ÚÖÇ&X,Äô…û¡ûdewÁô©+mWÕoâö¢Š¼»sÛ~X(2X.Ei�TŒz}ÜŸ¬˜^7uY~ýl­ÙVNMÑ”¶o÷…íöõ›
R.Åb³Y¶.¯Ö”O9ÇØ„bå«%9ÖÀvÌsr(MXú„a“#Dù�ó$ar b¶qMŽDžs!™ ¨F´KèRLDØÄìPˆ0.BEäHQ#͸FŠéÚuÅŽ577v›±«â}ßQÈ•anÐOèd$ôg;ú²A,�ˆ�É™ËCÛR;¼6§À+‡Ñ§Ìx**Ę$û³90ó«²ó‡û¿q'°ão¶×§fÿú Q%nú˜œš;Î5pÊX2ÿÊù™Óé¢]$œ£^”q®ßÆ~¿ +ôs"FÚá´âš!æ¡CƒyhîIhÐ~C¡MÏÜn£Oíf™1æ“$#hÐ)ç²½r~hмíjÆ5¡ŸF̹k×#ónÇÐi<â�ß7>TÆå²ßsa>Æs¡Žñ\8s&ws—a®YÆ1þ:€+ÍÝÜrùÄá¢á1¸\ßâÜut³ùÅà[‹ûZÕöò¨´M‹,þók4¾w°ž6Á_%aJ
+endstream
+endobj
+2307 0 obj
+<<
+/Type /Font
+/Subtype /Type1
+/BaseFont /NLCTDB+NimbusSanL-Bold
+/FontDescriptor 7138 0 R
+/FirstChar 2
+/LastChar 121
+/Widths 7121 0 R
+/Encoding 7111 0 R
+/ToUnicode 7152 0 R
+>>
+endobj
+7153 0 obj
+<<
+/Length 666       
+/Filter /FlateDecode
+>>
+stream
+xÚmTÁn£0½óÞC¥ö�Æ6„ØU‰@"å°mÕT«½&à´H
 CVê߯ßØ4ív çÇ̼7cì«�»IVµ3‰o9{2}{¶¥™ä?÷]tuU´åùdšáÞ˜ÊTã×þŽ=ڶܙ�]çÛbÛÔÃ�Þ6åÛ¹2cÔÿƒVæ¥n.!Ða×Ïæ÷¤{ýsP¶™(;á|®‡7ðís»Œ‚Û×msÇÄ-çÜë¦ÊÛ¬÷Ñ4ȳéhèX7•
Ø
Ž"!YU—CXÑ»<¹ y÷Þæ´mŽm´X°é“ûØö�¼ÝDÓ[[7/ìúbËÑ»s×½X`<Z.YeŽ®šë÷~2lú­¯�ïÏï�a’ÖÂû)ÛÊôݾ4vß¼˜hÁù’-6›edšêŸo"¤Žclêbù/‘ˆ¥#ÖÀ"æ…#„rXh÷’2M!Q^Rw؈˜m<¡‘
+‡çTˆ§(ª­ "}ŠŽÖ	"�í#Dìˆ5²œjd¨‘­}WD¬©¹±‹D�]•¯{ëz@.—…F?ÒÛHÝCëø²†0÷&tÆg>msåñ
+X{œ
¯<FŸ<§©‰1qâó90鋶é˘øOÚ)Öɧuð'f_9x©Ÿ>&'æ^s
œ椿ò<iz_n.P/Î)7l	á°_ð%ÃÜ¡Ÿr�ÑŸò8ƒ%¨¦Ä<”ô1˜‡¢ž„†6ÞÔÌï6úT~–9aú“x*£\ò£Vž‡EÛ.fTþ݈)wí{$Ý
á>uÐB¼ûF?•ö¹Ä-ÌG-ÔÑAÿœ.üÜ ¥Ik–SL8ÐÊ
+?·"ü�ôÇá á:ø8¿åÙZw´éΠS‹óZ7æãZéÚYôÐ}4^zX=l¢¿Bcp
+endstream
+endobj
+2878 0 obj
+<<
+/Type /Font
+/Subtype /Type1
+/BaseFont /CXLRKD+NimbusSanL-BoldCond
+/FontDescriptor 7140 0 R
+/FirstChar 2
+/LastChar 120
+/Widths 7120 0 R
+/Encoding 7111 0 R
+/ToUnicode 7153 0 R
+>>
+endobj
+7154 0 obj
+<<
+/Length 665       
+/Filter /FlateDecode
+>>
+stream
+xÚmTMkã0½ûWh…ö�F’G*!àØ	ä°miʲ×ÔVZCcÛYè¿ßy#9햅ļÍÌ{3ú¸úñ¸Ÿ¤eóâ&ñ­O®oÎ]á&ÙÏC]]åMq>¹z¸w®tå¸Ú߉Ǯ)ön×Ù.ßÕÕpCÁ»ºx?—nŒúÐÚ½VõgxÄõ³û=ißþt¦›ÐO"î¹Þiýû’ [\lÁ¡¿\×WM}'Ô­”’›ºÌšt÷Ñ4p‹é¨æXÕeˆȉ”eUÁâoq¢
 yÿÑî´«�M´\Šé-öC÷ÁÊn¢éCWº®ª_ÅõEy÷ç¶}wP d´Z‰Ò©õz891ýÞÔeùù£uB³­¼š¢)]ß
+×êW-¥\‰åv»Š\]~[S!åå8Æ&+ø¨™Z‘c¼eÇ"'‡2„•¥�ÖÉŒå5çIÂä@Ä|놉"¼àB2AQƒhíSlLØÎØ¡28a}„ŠÉ‘¢Fšq�5Ò�ïŠnnìbfÇ®Š·CG= WêÜ¢íe$ôg;þ´A,½ˆ:“sŸ‡¶¥ñx
l=N�×£O™ñT”Ƙ$û³0ó«²óë˜ý_¸س/vЧæÿú Q%~ú˜œZxÎ
pÊX2ÿÚû™Óë¢]$œ£^œqnØÆa¿ K‡¹ƒ?‘£?ãq
+
FqM�yíc0Ã=)
&l(´™¹ßmôiü,3Æ|’d
&å\ÖcÖÞ
†·]͹&ôÓˆ9wã{dÞ-ãtÚÀ…xö�•õ¹ì\˜�
\¨cÎœÍýÜÀe™kžqL¸àJs?·<œ@>q¸hx.×·8wÝl~1øÖâ¾Vµ»<*mÓ"‹ÿü�﬇mômDaš
+endstream
+endobj
+2258 0 obj
+<<
+/Type /Font
+/Subtype /Type1
+/BaseFont /RLEJJP+NimbusSanL-Regu
+/FontDescriptor 7142 0 R
+/FirstChar 2
+/LastChar 149
+/Widths 7122 0 R
+/Encoding 7111 0 R
+/ToUnicode 7154 0 R
+>>
+endobj
+7155 0 obj
+<<
+/Length 666       
+/Filter /FlateDecode
+>>
+stream
+xÚmTÁn£0½óÞC¥ö�Æ6„ØU‰@"å°Ûª©V{MÁi‘@�¬Ô¿ßycÓt·+%èù13ïÍØæêÛÃn’Uí³›Ä·R<º¡=÷¥›äß÷]tuU´åùèšÓç*W�o‡;ñзåÎ�Äu¾-¶M}º¡àmS¾�+7Fý?hå^êæqýä~Mº×ß}kú	ý$ŸêÓ|y'ˆBpðO×uÛÜ	u+¥$bÝTy{„õ!šy1
ê¦êƒñG‘Ò¢ªËSXñ³<Ò�¼{Nî¸mm´Xˆé#½Ný;{»‰¦÷}åúºy×[DïÎ]÷æ`AÈh¹•;P5ê÷ÇþèÄôK_ïŸÞ;'4¯•÷S¶•º}éú}ó⢅”K±Øl–‘kªÞ©�ò|cSŠ•s<T¢–D¬�7LÌ"”!¬,=´N"4ÊkΓ„‰@Älã	CDªϹ�LQÔ Ú@Eû¶	*�ë#TLD†YÎ52ÔÈÖ¾+&ÖÜÜØEbÇ®Ê×}O= Wê¢ím¤ôçu|YCXz	:“3Ÿ‡¶¥ñxl=΀W£O™óT”Ƙ$óù˜õUÛŠõuÌü'íëäÓ:øS³¿9xT©Ÿ>&§æ^s
œ1–¬¿ò<kz_´‹„Ô‹sÎ
[Â8ì|é0wè§Òcôg<ÎàÁ(®©1£}æa¸'eáÁ„
…73ó»�>�ŸeΘO’ŒáÁdœË~ÌÊóð`xÛÕŒkÂ?�˜s×¾GÖÝ0NàÓ-ÄÛ°o|¨¬Ïe>ha>6h¡Ž
Z8s¶ðsƒ–e­YÎ1á:@++üÜŠpùÄá¢ásðqËsßÓÕæoßZÜ׺qŸ•®í�Åþ�=¬î7Ñ÷cÅ
+endstream
+endobj
+2881 0 obj
+<<
+/Type /Font
+/Subtype /Type1
+/BaseFont /HGJHMP+NimbusSanL-ReguItal
+/FontDescriptor 7144 0 R
+/FirstChar 2
+/LastChar 122
+/Widths 7119 0 R
+/Encoding 7111 0 R
+/ToUnicode 7155 0 R
+>>
+endobj
+2259 0 obj
+<<
+/Type /Pages
+/Count 6
+/Parent 7156 0 R
+/Kids [2254 0 R 2261 0 R 2305 0 R 2352 0 R 2396 0 R 2441 0 R]
+>>
+endobj
+2488 0 obj
+<<
+/Type /Pages
+/Count 6
+/Parent 7156 0 R
+/Kids [2486 0 R 2532 0 R 2577 0 R 2622 0 R 2667 0 R 2712 0 R]
+>>
+endobj
+2759 0 obj
+<<
+/Type /Pages
+/Count 6
+/Parent 7156 0 R
+/Kids [2757 0 R 2803 0 R 2848 0 R 2870 0 R 2875 0 R 2891 0 R]
+>>
+endobj
+2899 0 obj
+<<
+/Type /Pages
+/Count 6
+/Parent 7156 0 R
+/Kids [2896 0 R 2902 0 R 2909 0 R 2913 0 R 2921 0 R 2938 0 R]
+>>
+endobj
+2976 0 obj
+<<
+/Type /Pages
+/Count 6
+/Parent 7156 0 R
+/Kids [2973 0 R 2988 0 R 3027 0 R 3046 0 R 3063 0 R 3088 0 R]
+>>
+endobj
+3149 0 obj
+<<
+/Type /Pages
+/Count 6
+/Parent 7156 0 R
+/Kids [3115 0 R 3160 0 R 3168 0 R 3182 0 R 3196 0 R 3232 0 R]
+>>
+endobj
+3266 0 obj
+<<
+/Type /Pages
+/Count 6
+/Parent 7157 0 R
+/Kids [3263 0 R 3288 0 R 3322 0 R 3363 0 R 3375 0 R 3386 0 R]
+>>
+endobj
+3401 0 obj
+<<
+/Type /Pages
+/Count 6
+/Parent 7157 0 R
+/Kids [3395 0 R 3404 0 R 3430 0 R 3504 0 R 3611 0 R 3725 0 R]
+>>
+endobj
+3801 0 obj
+<<
+/Type /Pages
+/Count 6
+/Parent 7157 0 R
+/Kids [3797 0 R 3818 0 R 3825 0 R 3829 0 R 3833 0 R 3837 0 R]
+>>
+endobj
+3848 0 obj
+<<
+/Type /Pages
+/Count 6
+/Parent 7157 0 R
+/Kids [3845 0 R 3852 0 R 3856 0 R 3860 0 R 3864 0 R 3868 0 R]
+>>
+endobj
+3875 0 obj
+<<
+/Type /Pages
+/Count 6
+/Parent 7157 0 R
+/Kids [3872 0 R 3877 0 R 3881 0 R 3885 0 R 3889 0 R 3893 0 R]
+>>
+endobj
+3900 0 obj
+<<
+/Type /Pages
+/Count 6
+/Parent 7157 0 R
+/Kids [3897 0 R 3902 0 R 3906 0 R 3910 0 R 3914 0 R 3918 0 R]
+>>
+endobj
+3933 0 obj
+<<
+/Type /Pages
+/Count 6
+/Parent 7158 0 R
+/Kids [3930 0 R 3944 0 R 3949 0 R 3953 0 R 3965 0 R 4044 0 R]
+>>
+endobj
+4061 0 obj
+<<
+/Type /Pages
+/Count 6
+/Parent 7158 0 R
+/Kids [4052 0 R 4066 0 R 4084 0 R 4107 0 R 4118 0 R 4142 0 R]
+>>
+endobj
+4210 0 obj
+<<
+/Type /Pages
+/Count 6
+/Parent 7158 0 R
+/Kids [4205 0 R 4232 0 R 4242 0 R 4255 0 R 4267 0 R 4282 0 R]
+>>
+endobj
+4301 0 obj
+<<
+/Type /Pages
+/Count 6
+/Parent 7158 0 R
+/Kids [4296 0 R 4309 0 R 4390 0 R 4453 0 R 4495 0 R 4509 0 R]
+>>
+endobj
+4525 0 obj
+<<
+/Type /Pages
+/Count 6
+/Parent 7158 0 R
+/Kids [4519 0 R 4532 0 R 4542 0 R 4555 0 R 4567 0 R 4580 0 R]
+>>
+endobj
+4596 0 obj
+<<
+/Type /Pages
+/Count 6
+/Parent 7158 0 R
+/Kids [4590 0 R 4603 0 R 4610 0 R 4656 0 R 4725 0 R 4789 0 R]
+>>
+endobj
+4820 0 obj
+<<
+/Type /Pages
+/Count 6
+/Parent 7159 0 R
+/Kids [4813 0 R 4828 0 R 4841 0 R 4853 0 R 4873 0 R 4885 0 R]
+>>
+endobj
+4906 0 obj
+<<
+/Type /Pages
+/Count 6
+/Parent 7159 0 R
+/Kids [4901 0 R 4924 0 R 5019 0 R 5037 0 R 5054 0 R 5068 0 R]
+>>
+endobj
+5082 0 obj
+<<
+/Type /Pages
+/Count 6
+/Parent 7159 0 R
+/Kids [5076 0 R 5115 0 R 5158 0 R 5186 0 R 5195 0 R 5205 0 R]
+>>
+endobj
+5221 0 obj
+<<
+/Type /Pages
+/Count 6
+/Parent 7159 0 R
+/Kids [5215 0 R 5227 0 R 5255 0 R 5285 0 R 5295 0 R 5322 0 R]
+>>
+endobj
+5345 0 obj
+<<
+/Type /Pages
+/Count 6
+/Parent 7159 0 R
+/Kids [5339 0 R 5353 0 R 5397 0 R 5454 0 R 5475 0 R 5481 0 R]
+>>
+endobj
+5492 0 obj
+<<
+/Type /Pages
+/Count 6
+/Parent 7159 0 R
+/Kids [5487 0 R 5495 0 R 5510 0 R 5520 0 R 5530 0 R 5540 0 R]
+>>
+endobj
+5558 0 obj
+<<
+/Type /Pages
+/Count 6
+/Parent 7160 0 R
+/Kids [5552 0 R 5591 0 R 5639 0 R 5655 0 R 5670 0 R 5679 0 R]
+>>
+endobj
+5697 0 obj
+<<
+/Type /Pages
+/Count 6
+/Parent 7160 0 R
+/Kids [5691 0 R 5710 0 R 5746 0 R 5758 0 R 5782 0 R 5807 0 R]
+>>
+endobj
+5895 0 obj
+<<
+/Type /Pages
+/Count 6
+/Parent 7160 0 R
+/Kids [5890 0 R 5925 0 R 5931 0 R 5936 0 R 5948 0 R 5959 0 R]
+>>
+endobj
+5978 0 obj
+<<
+/Type /Pages
+/Count 6
+/Parent 7160 0 R
+/Kids [5972 0 R 5983 0 R 5993 0 R 6004 0 R 6020 0 R 6081 0 R]
+>>
+endobj
+6106 0 obj
+<<
+/Type /Pages
+/Count 6
+/Parent 7160 0 R
+/Kids [6103 0 R 6109 0 R 6162 0 R 6232 0 R 6293 0 R 6356 0 R]
+>>
+endobj
+6424 0 obj
+<<
+/Type /Pages
+/Count 6
+/Parent 7160 0 R
+/Kids [6421 0 R 6485 0 R 6588 0 R 6708 0 R 6824 0 R 6913 0 R]
+>>
+endobj
+7035 0 obj
+<<
+/Type /Pages
+/Count 3
+/Parent 7161 0 R
+/Kids [7032 0 R 7098 0 R 7108 0 R]
+>>
+endobj
+7156 0 obj
+<<
+/Type /Pages
+/Count 36
+/Parent 7162 0 R
+/Kids [2259 0 R 2488 0 R 2759 0 R 2899 0 R 2976 0 R 3149 0 R]
+>>
+endobj
+7157 0 obj
+<<
+/Type /Pages
+/Count 36
+/Parent 7162 0 R
+/Kids [3266 0 R 3401 0 R 3801 0 R 3848 0 R 3875 0 R 3900 0 R]
+>>
+endobj
+7158 0 obj
+<<
+/Type /Pages
+/Count 36
+/Parent 7162 0 R
+/Kids [3933 0 R 4061 0 R 4210 0 R 4301 0 R 4525 0 R 4596 0 R]
+>>
+endobj
+7159 0 obj
+<<
+/Type /Pages
+/Count 36
+/Parent 7162 0 R
+/Kids [4820 0 R 4906 0 R 5082 0 R 5221 0 R 5345 0 R 5492 0 R]
+>>
+endobj
+7160 0 obj
+<<
+/Type /Pages
+/Count 36
+/Parent 7162 0 R
+/Kids [5558 0 R 5697 0 R 5895 0 R 5978 0 R 6106 0 R 6424 0 R]
+>>
+endobj
+7161 0 obj
+<<
+/Type /Pages
+/Count 3
+/Parent 7162 0 R
+/Kids [7035 0 R]
+>>
+endobj
+7162 0 obj
+<<
+/Type /Pages
+/Count 183
+/Kids [7156 0 R 7157 0 R 7158 0 R 7159 0 R 7160 0 R 7161 0 R]
+>>
+endobj
+7163 0 obj
+<<
+/Type /Outlines
+/First 3 0 R
+/Last 2251 0 R
+/Count 7
+>>
+endobj
+2251 0 obj
+<<
+/Title 2252 0 R
+/A 2249 0 R
+/Parent 7163 0 R
+/Prev 423 0 R
+>>
+endobj
+2247 0 obj
+<<
+/Title 2248 0 R
+/A 2245 0 R
+/Parent 423 0 R
+/Prev 2243 0 R
+>>
+endobj
+2243 0 obj
+<<
+/Title 2244 0 R
+/A 2241 0 R
+/Parent 423 0 R
+/Prev 2063 0 R
+/Next 2247 0 R
+>>
+endobj
+2239 0 obj
+<<
+/Title 2240 0 R
+/A 2237 0 R
+/Parent 2199 0 R
+/Prev 2235 0 R
+>>
+endobj
+2235 0 obj
+<<
+/Title 2236 0 R
+/A 2233 0 R
+/Parent 2199 0 R
+/Prev 2231 0 R
+/Next 2239 0 R
+>>
+endobj
+2231 0 obj
+<<
+/Title 2232 0 R
+/A 2229 0 R
+/Parent 2199 0 R
+/Prev 2227 0 R
+/Next 2235 0 R
+>>
+endobj
+2227 0 obj
+<<
+/Title 2228 0 R
+/A 2225 0 R
+/Parent 2199 0 R
+/Prev 2223 0 R
+/Next 2231 0 R
+>>
+endobj
+2223 0 obj
+<<
+/Title 2224 0 R
+/A 2221 0 R
+/Parent 2199 0 R
+/Prev 2219 0 R
+/Next 2227 0 R
+>>
+endobj
+2219 0 obj
+<<
+/Title 2220 0 R
+/A 2217 0 R
+/Parent 2199 0 R
+/Prev 2215 0 R
+/Next 2223 0 R
+>>
+endobj
+2215 0 obj
+<<
+/Title 2216 0 R
+/A 2213 0 R
+/Parent 2199 0 R
+/Prev 2211 0 R
+/Next 2219 0 R
+>>
+endobj
+2211 0 obj
+<<
+/Title 2212 0 R
+/A 2209 0 R
+/Parent 2199 0 R
+/Prev 2207 0 R
+/Next 2215 0 R
+>>
+endobj
+2207 0 obj
+<<
+/Title 2208 0 R
+/A 2205 0 R
+/Parent 2199 0 R
+/Prev 2203 0 R
+/Next 2211 0 R
+>>
+endobj
+2203 0 obj
+<<
+/Title 2204 0 R
+/A 2201 0 R
+/Parent 2199 0 R
+/Next 2207 0 R
+>>
+endobj
+2199 0 obj
+<<
+/Title 2200 0 R
+/A 2197 0 R
+/Parent 2063 0 R
+/Prev 2123 0 R
+/First 2203 0 R
+/Last 2239 0 R
+/Count -10
+>>
+endobj
+2195 0 obj
+<<
+/Title 2196 0 R
+/A 2193 0 R
+/Parent 2123 0 R
+/Prev 2191 0 R
+>>
+endobj
+2191 0 obj
+<<
+/Title 2192 0 R
+/A 2189 0 R
+/Parent 2123 0 R
+/Prev 2187 0 R
+/Next 2195 0 R
+>>
+endobj
+2187 0 obj
+<<
+/Title 2188 0 R
+/A 2185 0 R
+/Parent 2123 0 R
+/Prev 2183 0 R
+/Next 2191 0 R
+>>
+endobj
+2183 0 obj
+<<
+/Title 2184 0 R
+/A 2181 0 R
+/Parent 2123 0 R
+/Prev 2179 0 R
+/Next 2187 0 R
+>>
+endobj
+2179 0 obj
+<<
+/Title 2180 0 R
+/A 2177 0 R
+/Parent 2123 0 R
+/Prev 2175 0 R
+/Next 2183 0 R
+>>
+endobj
+2175 0 obj
+<<
+/Title 2176 0 R
+/A 2173 0 R
+/Parent 2123 0 R
+/Prev 2171 0 R
+/Next 2179 0 R
+>>
+endobj
+2171 0 obj
+<<
+/Title 2172 0 R
+/A 2169 0 R
+/Parent 2123 0 R
+/Prev 2167 0 R
+/Next 2175 0 R
+>>
+endobj
+2167 0 obj
+<<
+/Title 2168 0 R
+/A 2165 0 R
+/Parent 2123 0 R
+/Prev 2163 0 R
+/Next 2171 0 R
+>>
+endobj
+2163 0 obj
+<<
+/Title 2164 0 R
+/A 2161 0 R
+/Parent 2123 0 R
+/Prev 2159 0 R
+/Next 2167 0 R
+>>
+endobj
+2159 0 obj
+<<
+/Title 2160 0 R
+/A 2157 0 R
+/Parent 2123 0 R
+/Prev 2155 0 R
+/Next 2163 0 R
+>>
+endobj
+2155 0 obj
+<<
+/Title 2156 0 R
+/A 2153 0 R
+/Parent 2123 0 R
+/Prev 2151 0 R
+/Next 2159 0 R
+>>
+endobj
+2151 0 obj
+<<
+/Title 2152 0 R
+/A 2149 0 R
+/Parent 2123 0 R
+/Prev 2147 0 R
+/Next 2155 0 R
+>>
+endobj
+2147 0 obj
+<<
+/Title 2148 0 R
+/A 2145 0 R
+/Parent 2123 0 R
+/Prev 2143 0 R
+/Next 2151 0 R
+>>
+endobj
+2143 0 obj
+<<
+/Title 2144 0 R
+/A 2141 0 R
+/Parent 2123 0 R
+/Prev 2139 0 R
+/Next 2147 0 R
+>>
+endobj
+2139 0 obj
+<<
+/Title 2140 0 R
+/A 2137 0 R
+/Parent 2123 0 R
+/Prev 2135 0 R
+/Next 2143 0 R
+>>
+endobj
+2135 0 obj
+<<
+/Title 2136 0 R
+/A 2133 0 R
+/Parent 2123 0 R
+/Prev 2131 0 R
+/Next 2139 0 R
+>>
+endobj
+2131 0 obj
+<<
+/Title 2132 0 R
+/A 2129 0 R
+/Parent 2123 0 R
+/Prev 2127 0 R
+/Next 2135 0 R
+>>
+endobj
+2127 0 obj
+<<
+/Title 2128 0 R
+/A 2125 0 R
+/Parent 2123 0 R
+/Next 2131 0 R
+>>
+endobj
+2123 0 obj
+<<
+/Title 2124 0 R
+/A 2121 0 R
+/Parent 2063 0 R
+/Prev 2071 0 R
+/Next 2199 0 R
+/First 2127 0 R
+/Last 2195 0 R
+/Count -18
+>>
+endobj
+2119 0 obj
+<<
+/Title 2120 0 R
+/A 2117 0 R
+/Parent 2071 0 R
+/Prev 2115 0 R
+>>
+endobj
+2115 0 obj
+<<
+/Title 2116 0 R
+/A 2113 0 R
+/Parent 2071 0 R
+/Prev 2111 0 R
+/Next 2119 0 R
+>>
+endobj
+2111 0 obj
+<<
+/Title 2112 0 R
+/A 2109 0 R
+/Parent 2071 0 R
+/Prev 2107 0 R
+/Next 2115 0 R
+>>
+endobj
+2107 0 obj
+<<
+/Title 2108 0 R
+/A 2105 0 R
+/Parent 2071 0 R
+/Prev 2103 0 R
+/Next 2111 0 R
+>>
+endobj
+2103 0 obj
+<<
+/Title 2104 0 R
+/A 2101 0 R
+/Parent 2071 0 R
+/Prev 2099 0 R
+/Next 2107 0 R
+>>
+endobj
+2099 0 obj
+<<
+/Title 2100 0 R
+/A 2097 0 R
+/Parent 2071 0 R
+/Prev 2095 0 R
+/Next 2103 0 R
+>>
+endobj
+2095 0 obj
+<<
+/Title 2096 0 R
+/A 2093 0 R
+/Parent 2071 0 R
+/Prev 2091 0 R
+/Next 2099 0 R
+>>
+endobj
+2091 0 obj
+<<
+/Title 2092 0 R
+/A 2089 0 R
+/Parent 2071 0 R
+/Prev 2087 0 R
+/Next 2095 0 R
+>>
+endobj
+2087 0 obj
+<<
+/Title 2088 0 R
+/A 2085 0 R
+/Parent 2071 0 R
+/Prev 2083 0 R
+/Next 2091 0 R
+>>
+endobj
+2083 0 obj
+<<
+/Title 2084 0 R
+/A 2081 0 R
+/Parent 2071 0 R
+/Prev 2079 0 R
+/Next 2087 0 R
+>>
+endobj
+2079 0 obj
+<<
+/Title 2080 0 R
+/A 2077 0 R
+/Parent 2071 0 R
+/Prev 2075 0 R
+/Next 2083 0 R
+>>
+endobj
+2075 0 obj
+<<
+/Title 2076 0 R
+/A 2073 0 R
+/Parent 2071 0 R
+/Next 2079 0 R
+>>
+endobj
+2071 0 obj
+<<
+/Title 2072 0 R
+/A 2069 0 R
+/Parent 2063 0 R
+/Prev 2067 0 R
+/Next 2123 0 R
+/First 2075 0 R
+/Last 2119 0 R
+/Count -12
+>>
+endobj
+2067 0 obj
+<<
+/Title 2068 0 R
+/A 2065 0 R
+/Parent 2063 0 R
+/Next 2071 0 R
+>>
+endobj
+2063 0 obj
+<<
+/Title 2064 0 R
+/A 2061 0 R
+/Parent 423 0 R
+/Prev 2059 0 R
+/Next 2243 0 R
+/First 2067 0 R
+/Last 2199 0 R
+/Count -4
+>>
+endobj
+2059 0 obj
+<<
+/Title 2060 0 R
+/A 2057 0 R
+/Parent 423 0 R
+/Prev 2051 0 R
+/Next 2063 0 R
+>>
+endobj
+2055 0 obj
+<<
+/Title 2056 0 R
+/A 2053 0 R
+/Parent 2051 0 R
+>>
+endobj
+2051 0 obj
+<<
+/Title 2052 0 R
+/A 2049 0 R
+/Parent 423 0 R
+/Prev 2047 0 R
+/Next 2059 0 R
+/First 2055 0 R
+/Last 2055 0 R
+/Count -1
+>>
+endobj
+2047 0 obj
+<<
+/Title 2048 0 R
+/A 2045 0 R
+/Parent 423 0 R
+/Prev 2019 0 R
+/Next 2051 0 R
+>>
+endobj
+2043 0 obj
+<<
+/Title 2044 0 R
+/A 2041 0 R
+/Parent 2027 0 R
+/Prev 2039 0 R
+>>
+endobj
+2039 0 obj
+<<
+/Title 2040 0 R
+/A 2037 0 R
+/Parent 2027 0 R
+/Prev 2035 0 R
+/Next 2043 0 R
+>>
+endobj
+2035 0 obj
+<<
+/Title 2036 0 R
+/A 2033 0 R
+/Parent 2027 0 R
+/Prev 2031 0 R
+/Next 2039 0 R
+>>
+endobj
+2031 0 obj
+<<
+/Title 2032 0 R
+/A 2029 0 R
+/Parent 2027 0 R
+/Next 2035 0 R
+>>
+endobj
+2027 0 obj
+<<
+/Title 2028 0 R
+/A 2025 0 R
+/Parent 2019 0 R
+/Prev 2023 0 R
+/First 2031 0 R
+/Last 2043 0 R
+/Count -4
+>>
+endobj
+2023 0 obj
+<<
+/Title 2024 0 R
+/A 2021 0 R
+/Parent 2019 0 R
+/Next 2027 0 R
+>>
+endobj
+2019 0 obj
+<<
+/Title 2020 0 R
+/A 2017 0 R
+/Parent 423 0 R
+/Prev 2015 0 R
+/Next 2047 0 R
+/First 2023 0 R
+/Last 2027 0 R
+/Count -2
+>>
+endobj
+2015 0 obj
+<<
+/Title 2016 0 R
+/A 2013 0 R
+/Parent 423 0 R
+/Prev 1967 0 R
+/Next 2019 0 R
+>>
+endobj
+2011 0 obj
+<<
+/Title 2012 0 R
+/A 2009 0 R
+/Parent 1975 0 R
+/Prev 2007 0 R
+>>
+endobj
+2007 0 obj
+<<
+/Title 2008 0 R
+/A 2005 0 R
+/Parent 1975 0 R
+/Prev 2003 0 R
+/Next 2011 0 R
+>>
+endobj
+2003 0 obj
+<<
+/Title 2004 0 R
+/A 2001 0 R
+/Parent 1975 0 R
+/Prev 1999 0 R
+/Next 2007 0 R
+>>
+endobj
+1999 0 obj
+<<
+/Title 2000 0 R
+/A 1997 0 R
+/Parent 1975 0 R
+/Prev 1995 0 R
+/Next 2003 0 R
+>>
+endobj
+1995 0 obj
+<<
+/Title 1996 0 R
+/A 1993 0 R
+/Parent 1975 0 R
+/Prev 1991 0 R
+/Next 1999 0 R
+>>
+endobj
+1991 0 obj
+<<
+/Title 1992 0 R
+/A 1989 0 R
+/Parent 1975 0 R
+/Prev 1987 0 R
+/Next 1995 0 R
+>>
+endobj
+1987 0 obj
+<<
+/Title 1988 0 R
+/A 1985 0 R
+/Parent 1975 0 R
+/Prev 1983 0 R
+/Next 1991 0 R
+>>
+endobj
+1983 0 obj
+<<
+/Title 1984 0 R
+/A 1981 0 R
+/Parent 1975 0 R
+/Prev 1979 0 R
+/Next 1987 0 R
+>>
+endobj
+1979 0 obj
+<<
+/Title 1980 0 R
+/A 1977 0 R
+/Parent 1975 0 R
+/Next 1983 0 R
+>>
+endobj
+1975 0 obj
+<<
+/Title 1976 0 R
+/A 1973 0 R
+/Parent 1967 0 R
+/Prev 1971 0 R
+/First 1979 0 R
+/Last 2011 0 R
+/Count -9
+>>
+endobj
+1971 0 obj
+<<
+/Title 1972 0 R
+/A 1969 0 R
+/Parent 1967 0 R
+/Next 1975 0 R
+>>
+endobj
+1967 0 obj
+<<
+/Title 1968 0 R
+/A 1965 0 R
+/Parent 423 0 R
+/Prev 1963 0 R
+/Next 2015 0 R
+/First 1971 0 R
+/Last 1975 0 R
+/Count -2
+>>
+endobj
+1963 0 obj
+<<
+/Title 1964 0 R
+/A 1961 0 R
+/Parent 423 0 R
+/Prev 1847 0 R
+/Next 1967 0 R
+>>
+endobj
+1959 0 obj
+<<
+/Title 1960 0 R
+/A 1957 0 R
+/Parent 1855 0 R
+/Prev 1955 0 R
+>>
+endobj
+1955 0 obj
+<<
+/Title 1956 0 R
+/A 1953 0 R
+/Parent 1855 0 R
+/Prev 1951 0 R
+/Next 1959 0 R
+>>
+endobj
+1951 0 obj
+<<
+/Title 1952 0 R
+/A 1949 0 R
+/Parent 1855 0 R
+/Prev 1947 0 R
+/Next 1955 0 R
+>>
+endobj
+1947 0 obj
+<<
+/Title 1948 0 R
+/A 1945 0 R
+/Parent 1855 0 R
+/Prev 1943 0 R
+/Next 1951 0 R
+>>
+endobj
+1943 0 obj
+<<
+/Title 1944 0 R
+/A 1941 0 R
+/Parent 1855 0 R
+/Prev 1939 0 R
+/Next 1947 0 R
+>>
+endobj
+1939 0 obj
+<<
+/Title 1940 0 R
+/A 1937 0 R
+/Parent 1855 0 R
+/Prev 1935 0 R
+/Next 1943 0 R
+>>
+endobj
+1935 0 obj
+<<
+/Title 1936 0 R
+/A 1933 0 R
+/Parent 1855 0 R
+/Prev 1931 0 R
+/Next 1939 0 R
+>>
+endobj
+1931 0 obj
+<<
+/Title 1932 0 R
+/A 1929 0 R
+/Parent 1855 0 R
+/Prev 1927 0 R
+/Next 1935 0 R
+>>
+endobj
+1927 0 obj
+<<
+/Title 1928 0 R
+/A 1925 0 R
+/Parent 1855 0 R
+/Prev 1923 0 R
+/Next 1931 0 R
+>>
+endobj
+1923 0 obj
+<<
+/Title 1924 0 R
+/A 1921 0 R
+/Parent 1855 0 R
+/Prev 1919 0 R
+/Next 1927 0 R
+>>
+endobj
+1919 0 obj
+<<
+/Title 1920 0 R
+/A 1917 0 R
+/Parent 1855 0 R
+/Prev 1915 0 R
+/Next 1923 0 R
+>>
+endobj
+1915 0 obj
+<<
+/Title 1916 0 R
+/A 1913 0 R
+/Parent 1855 0 R
+/Prev 1911 0 R
+/Next 1919 0 R
+>>
+endobj
+1911 0 obj
+<<
+/Title 1912 0 R
+/A 1909 0 R
+/Parent 1855 0 R
+/Prev 1907 0 R
+/Next 1915 0 R
+>>
+endobj
+1907 0 obj
+<<
+/Title 1908 0 R
+/A 1905 0 R
+/Parent 1855 0 R
+/Prev 1903 0 R
+/Next 1911 0 R
+>>
+endobj
+1903 0 obj
+<<
+/Title 1904 0 R
+/A 1901 0 R
+/Parent 1855 0 R
+/Prev 1899 0 R
+/Next 1907 0 R
+>>
+endobj
+1899 0 obj
+<<
+/Title 1900 0 R
+/A 1897 0 R
+/Parent 1855 0 R
+/Prev 1895 0 R
+/Next 1903 0 R
+>>
+endobj
+1895 0 obj
+<<
+/Title 1896 0 R
+/A 1893 0 R
+/Parent 1855 0 R
+/Prev 1891 0 R
+/Next 1899 0 R
+>>
+endobj
+1891 0 obj
+<<
+/Title 1892 0 R
+/A 1889 0 R
+/Parent 1855 0 R
+/Prev 1887 0 R
+/Next 1895 0 R
+>>
+endobj
+1887 0 obj
+<<
+/Title 1888 0 R
+/A 1885 0 R
+/Parent 1855 0 R
+/Prev 1883 0 R
+/Next 1891 0 R
+>>
+endobj
+1883 0 obj
+<<
+/Title 1884 0 R
+/A 1881 0 R
+/Parent 1855 0 R
+/Prev 1879 0 R
+/Next 1887 0 R
+>>
+endobj
+1879 0 obj
+<<
+/Title 1880 0 R
+/A 1877 0 R
+/Parent 1855 0 R
+/Prev 1875 0 R
+/Next 1883 0 R
+>>
+endobj
+1875 0 obj
+<<
+/Title 1876 0 R
+/A 1873 0 R
+/Parent 1855 0 R
+/Prev 1871 0 R
+/Next 1879 0 R
+>>
+endobj
+1871 0 obj
+<<
+/Title 1872 0 R
+/A 1869 0 R
+/Parent 1855 0 R
+/Prev 1867 0 R
+/Next 1875 0 R
+>>
+endobj
+1867 0 obj
+<<
+/Title 1868 0 R
+/A 1865 0 R
+/Parent 1855 0 R
+/Prev 1863 0 R
+/Next 1871 0 R
+>>
+endobj
+1863 0 obj
+<<
+/Title 1864 0 R
+/A 1861 0 R
+/Parent 1855 0 R
+/Prev 1859 0 R
+/Next 1867 0 R
+>>
+endobj
+1859 0 obj
+<<
+/Title 1860 0 R
+/A 1857 0 R
+/Parent 1855 0 R
+/Next 1863 0 R
+>>
+endobj
+1855 0 obj
+<<
+/Title 1856 0 R
+/A 1853 0 R
+/Parent 1847 0 R
+/Prev 1851 0 R
+/First 1859 0 R
+/Last 1959 0 R
+/Count -26
+>>
+endobj
+1851 0 obj
+<<
+/Title 1852 0 R
+/A 1849 0 R
+/Parent 1847 0 R
+/Next 1855 0 R
+>>
+endobj
+1847 0 obj
+<<
+/Title 1848 0 R
+/A 1845 0 R
+/Parent 423 0 R
+/Prev 1843 0 R
+/Next 1963 0 R
+/First 1851 0 R
+/Last 1855 0 R
+/Count -2
+>>
+endobj
+1843 0 obj
+<<
+/Title 1844 0 R
+/A 1841 0 R
+/Parent 423 0 R
+/Prev 1803 0 R
+/Next 1847 0 R
+>>
+endobj
+1839 0 obj
+<<
+/Title 1840 0 R
+/A 1837 0 R
+/Parent 1811 0 R
+/Prev 1835 0 R
+>>
+endobj
+1835 0 obj
+<<
+/Title 1836 0 R
+/A 1833 0 R
+/Parent 1811 0 R
+/Prev 1831 0 R
+/Next 1839 0 R
+>>
+endobj
+1831 0 obj
+<<
+/Title 1832 0 R
+/A 1829 0 R
+/Parent 1811 0 R
+/Prev 1827 0 R
+/Next 1835 0 R
+>>
+endobj
+1827 0 obj
+<<
+/Title 1828 0 R
+/A 1825 0 R
+/Parent 1811 0 R
+/Prev 1823 0 R
+/Next 1831 0 R
+>>
+endobj
+1823 0 obj
+<<
+/Title 1824 0 R
+/A 1821 0 R
+/Parent 1811 0 R
+/Prev 1819 0 R
+/Next 1827 0 R
+>>
+endobj
+1819 0 obj
+<<
+/Title 1820 0 R
+/A 1817 0 R
+/Parent 1811 0 R
+/Prev 1815 0 R
+/Next 1823 0 R
+>>
+endobj
+1815 0 obj
+<<
+/Title 1816 0 R
+/A 1813 0 R
+/Parent 1811 0 R
+/Next 1819 0 R
+>>
+endobj
+1811 0 obj
+<<
+/Title 1812 0 R
+/A 1809 0 R
+/Parent 1803 0 R
+/Prev 1807 0 R
+/First 1815 0 R
+/Last 1839 0 R
+/Count -7
+>>
+endobj
+1807 0 obj
+<<
+/Title 1808 0 R
+/A 1805 0 R
+/Parent 1803 0 R
+/Next 1811 0 R
+>>
+endobj
+1803 0 obj
+<<
+/Title 1804 0 R
+/A 1801 0 R
+/Parent 423 0 R
+/Prev 1799 0 R
+/Next 1843 0 R
+/First 1807 0 R
+/Last 1811 0 R
+/Count -2
+>>
+endobj
+1799 0 obj
+<<
+/Title 1800 0 R
+/A 1797 0 R
+/Parent 423 0 R
+/Prev 1779 0 R
+/Next 1803 0 R
+>>
+endobj
+1795 0 obj
+<<
+/Title 1796 0 R
+/A 1793 0 R
+/Parent 1787 0 R
+/Prev 1791 0 R
+>>
+endobj
+1791 0 obj
+<<
+/Title 1792 0 R
+/A 1789 0 R
+/Parent 1787 0 R
+/Next 1795 0 R
+>>
+endobj
+1787 0 obj
+<<
+/Title 1788 0 R
+/A 1785 0 R
+/Parent 1779 0 R
+/Prev 1783 0 R
+/First 1791 0 R
+/Last 1795 0 R
+/Count -2
+>>
+endobj
+1783 0 obj
+<<
+/Title 1784 0 R
+/A 1781 0 R
+/Parent 1779 0 R
+/Next 1787 0 R
+>>
+endobj
+1779 0 obj
+<<
+/Title 1780 0 R
+/A 1777 0 R
+/Parent 423 0 R
+/Prev 1775 0 R
+/Next 1799 0 R
+/First 1783 0 R
+/Last 1787 0 R
+/Count -2
+>>
+endobj
+1775 0 obj
+<<
+/Title 1776 0 R
+/A 1773 0 R
+/Parent 423 0 R
+/Prev 1695 0 R
+/Next 1779 0 R
+>>
+endobj
+1771 0 obj
+<<
+/Title 1772 0 R
+/A 1769 0 R
+/Parent 1703 0 R
+/Prev 1767 0 R
+>>
+endobj
+1767 0 obj
+<<
+/Title 1768 0 R
+/A 1765 0 R
+/Parent 1703 0 R
+/Prev 1763 0 R
+/Next 1771 0 R
+>>
+endobj
+1763 0 obj
+<<
+/Title 1764 0 R
+/A 1761 0 R
+/Parent 1703 0 R
+/Prev 1759 0 R
+/Next 1767 0 R
+>>
+endobj
+1759 0 obj
+<<
+/Title 1760 0 R
+/A 1757 0 R
+/Parent 1703 0 R
+/Prev 1755 0 R
+/Next 1763 0 R
+>>
+endobj
+1755 0 obj
+<<
+/Title 1756 0 R
+/A 1753 0 R
+/Parent 1703 0 R
+/Prev 1751 0 R
+/Next 1759 0 R
+>>
+endobj
+1751 0 obj
+<<
+/Title 1752 0 R
+/A 1749 0 R
+/Parent 1703 0 R
+/Prev 1747 0 R
+/Next 1755 0 R
+>>
+endobj
+1747 0 obj
+<<
+/Title 1748 0 R
+/A 1745 0 R
+/Parent 1703 0 R
+/Prev 1743 0 R
+/Next 1751 0 R
+>>
+endobj
+1743 0 obj
+<<
+/Title 1744 0 R
+/A 1741 0 R
+/Parent 1703 0 R
+/Prev 1739 0 R
+/Next 1747 0 R
+>>
+endobj
+1739 0 obj
+<<
+/Title 1740 0 R
+/A 1737 0 R
+/Parent 1703 0 R
+/Prev 1735 0 R
+/Next 1743 0 R
+>>
+endobj
+1735 0 obj
+<<
+/Title 1736 0 R
+/A 1733 0 R
+/Parent 1703 0 R
+/Prev 1731 0 R
+/Next 1739 0 R
+>>
+endobj
+1731 0 obj
+<<
+/Title 1732 0 R
+/A 1729 0 R
+/Parent 1703 0 R
+/Prev 1727 0 R
+/Next 1735 0 R
+>>
+endobj
+1727 0 obj
+<<
+/Title 1728 0 R
+/A 1725 0 R
+/Parent 1703 0 R
+/Prev 1723 0 R
+/Next 1731 0 R
+>>
+endobj
+1723 0 obj
+<<
+/Title 1724 0 R
+/A 1721 0 R
+/Parent 1703 0 R
+/Prev 1719 0 R
+/Next 1727 0 R
+>>
+endobj
+1719 0 obj
+<<
+/Title 1720 0 R
+/A 1717 0 R
+/Parent 1703 0 R
+/Prev 1715 0 R
+/Next 1723 0 R
+>>
+endobj
+1715 0 obj
+<<
+/Title 1716 0 R
+/A 1713 0 R
+/Parent 1703 0 R
+/Prev 1711 0 R
+/Next 1719 0 R
+>>
+endobj
+1711 0 obj
+<<
+/Title 1712 0 R
+/A 1709 0 R
+/Parent 1703 0 R
+/Prev 1707 0 R
+/Next 1715 0 R
+>>
+endobj
+1707 0 obj
+<<
+/Title 1708 0 R
+/A 1705 0 R
+/Parent 1703 0 R
+/Next 1711 0 R
+>>
+endobj
+1703 0 obj
+<<
+/Title 1704 0 R
+/A 1701 0 R
+/Parent 1695 0 R
+/Prev 1699 0 R
+/First 1707 0 R
+/Last 1771 0 R
+/Count -17
+>>
+endobj
+1699 0 obj
+<<
+/Title 1700 0 R
+/A 1697 0 R
+/Parent 1695 0 R
+/Next 1703 0 R
+>>
+endobj
+1695 0 obj
+<<
+/Title 1696 0 R
+/A 1693 0 R
+/Parent 423 0 R
+/Prev 1691 0 R
+/Next 1775 0 R
+/First 1699 0 R
+/Last 1703 0 R
+/Count -2
+>>
+endobj
+1691 0 obj
+<<
+/Title 1692 0 R
+/A 1689 0 R
+/Parent 423 0 R
+/Prev 1631 0 R
+/Next 1695 0 R
+>>
+endobj
+1687 0 obj
+<<
+/Title 1688 0 R
+/A 1685 0 R
+/Parent 1639 0 R
+/Prev 1683 0 R
+>>
+endobj
+1683 0 obj
+<<
+/Title 1684 0 R
+/A 1681 0 R
+/Parent 1639 0 R
+/Prev 1679 0 R
+/Next 1687 0 R
+>>
+endobj
+1679 0 obj
+<<
+/Title 1680 0 R
+/A 1677 0 R
+/Parent 1639 0 R
+/Prev 1675 0 R
+/Next 1683 0 R
+>>
+endobj
+1675 0 obj
+<<
+/Title 1676 0 R
+/A 1673 0 R
+/Parent 1639 0 R
+/Prev 1671 0 R
+/Next 1679 0 R
+>>
+endobj
+1671 0 obj
+<<
+/Title 1672 0 R
+/A 1669 0 R
+/Parent 1639 0 R
+/Prev 1667 0 R
+/Next 1675 0 R
+>>
+endobj
+1667 0 obj
+<<
+/Title 1668 0 R
+/A 1665 0 R
+/Parent 1639 0 R
+/Prev 1663 0 R
+/Next 1671 0 R
+>>
+endobj
+1663 0 obj
+<<
+/Title 1664 0 R
+/A 1661 0 R
+/Parent 1639 0 R
+/Prev 1659 0 R
+/Next 1667 0 R
+>>
+endobj
+1659 0 obj
+<<
+/Title 1660 0 R
+/A 1657 0 R
+/Parent 1639 0 R
+/Prev 1655 0 R
+/Next 1663 0 R
+>>
+endobj
+1655 0 obj
+<<
+/Title 1656 0 R
+/A 1653 0 R
+/Parent 1639 0 R
+/Prev 1651 0 R
+/Next 1659 0 R
+>>
+endobj
+1651 0 obj
+<<
+/Title 1652 0 R
+/A 1649 0 R
+/Parent 1639 0 R
+/Prev 1647 0 R
+/Next 1655 0 R
+>>
+endobj
+1647 0 obj
+<<
+/Title 1648 0 R
+/A 1645 0 R
+/Parent 1639 0 R
+/Prev 1643 0 R
+/Next 1651 0 R
+>>
+endobj
+1643 0 obj
+<<
+/Title 1644 0 R
+/A 1641 0 R
+/Parent 1639 0 R
+/Next 1647 0 R
+>>
+endobj
+1639 0 obj
+<<
+/Title 1640 0 R
+/A 1637 0 R
+/Parent 1631 0 R
+/Prev 1635 0 R
+/First 1643 0 R
+/Last 1687 0 R
+/Count -12
+>>
+endobj
+1635 0 obj
+<<
+/Title 1636 0 R
+/A 1633 0 R
+/Parent 1631 0 R
+/Next 1639 0 R
+>>
+endobj
+1631 0 obj
+<<
+/Title 1632 0 R
+/A 1629 0 R
+/Parent 423 0 R
+/Prev 1627 0 R
+/Next 1691 0 R
+/First 1635 0 R
+/Last 1639 0 R
+/Count -2
+>>
+endobj
+1627 0 obj
+<<
+/Title 1628 0 R
+/A 1625 0 R
+/Parent 423 0 R
+/Prev 1523 0 R
+/Next 1631 0 R
+>>
+endobj
+1623 0 obj
+<<
+/Title 1624 0 R
+/A 1621 0 R
+/Parent 1531 0 R
+/Prev 1619 0 R
+>>
+endobj
+1619 0 obj
+<<
+/Title 1620 0 R
+/A 1617 0 R
+/Parent 1531 0 R
+/Prev 1615 0 R
+/Next 1623 0 R
+>>
+endobj
+1615 0 obj
+<<
+/Title 1616 0 R
+/A 1613 0 R
+/Parent 1531 0 R
+/Prev 1611 0 R
+/Next 1619 0 R
+>>
+endobj
+1611 0 obj
+<<
+/Title 1612 0 R
+/A 1609 0 R
+/Parent 1531 0 R
+/Prev 1607 0 R
+/Next 1615 0 R
+>>
+endobj
+1607 0 obj
+<<
+/Title 1608 0 R
+/A 1605 0 R
+/Parent 1531 0 R
+/Prev 1603 0 R
+/Next 1611 0 R
+>>
+endobj
+1603 0 obj
+<<
+/Title 1604 0 R
+/A 1601 0 R
+/Parent 1531 0 R
+/Prev 1599 0 R
+/Next 1607 0 R
+>>
+endobj
+1599 0 obj
+<<
+/Title 1600 0 R
+/A 1597 0 R
+/Parent 1531 0 R
+/Prev 1595 0 R
+/Next 1603 0 R
+>>
+endobj
+1595 0 obj
+<<
+/Title 1596 0 R
+/A 1593 0 R
+/Parent 1531 0 R
+/Prev 1591 0 R
+/Next 1599 0 R
+>>
+endobj
+1591 0 obj
+<<
+/Title 1592 0 R
+/A 1589 0 R
+/Parent 1531 0 R
+/Prev 1587 0 R
+/Next 1595 0 R
+>>
+endobj
+1587 0 obj
+<<
+/Title 1588 0 R
+/A 1585 0 R
+/Parent 1531 0 R
+/Prev 1583 0 R
+/Next 1591 0 R
+>>
+endobj
+1583 0 obj
+<<
+/Title 1584 0 R
+/A 1581 0 R
+/Parent 1531 0 R
+/Prev 1579 0 R
+/Next 1587 0 R
+>>
+endobj
+1579 0 obj
+<<
+/Title 1580 0 R
+/A 1577 0 R
+/Parent 1531 0 R
+/Prev 1575 0 R
+/Next 1583 0 R
+>>
+endobj
+1575 0 obj
+<<
+/Title 1576 0 R
+/A 1573 0 R
+/Parent 1531 0 R
+/Prev 1571 0 R
+/Next 1579 0 R
+>>
+endobj
+1571 0 obj
+<<
+/Title 1572 0 R
+/A 1569 0 R
+/Parent 1531 0 R
+/Prev 1567 0 R
+/Next 1575 0 R
+>>
+endobj
+1567 0 obj
+<<
+/Title 1568 0 R
+/A 1565 0 R
+/Parent 1531 0 R
+/Prev 1563 0 R
+/Next 1571 0 R
+>>
+endobj
+1563 0 obj
+<<
+/Title 1564 0 R
+/A 1561 0 R
+/Parent 1531 0 R
+/Prev 1559 0 R
+/Next 1567 0 R
+>>
+endobj
+1559 0 obj
+<<
+/Title 1560 0 R
+/A 1557 0 R
+/Parent 1531 0 R
+/Prev 1555 0 R
+/Next 1563 0 R
+>>
+endobj
+1555 0 obj
+<<
+/Title 1556 0 R
+/A 1553 0 R
+/Parent 1531 0 R
+/Prev 1551 0 R
+/Next 1559 0 R
+>>
+endobj
+1551 0 obj
+<<
+/Title 1552 0 R
+/A 1549 0 R
+/Parent 1531 0 R
+/Prev 1547 0 R
+/Next 1555 0 R
+>>
+endobj
+1547 0 obj
+<<
+/Title 1548 0 R
+/A 1545 0 R
+/Parent 1531 0 R
+/Prev 1543 0 R
+/Next 1551 0 R
+>>
+endobj
+1543 0 obj
+<<
+/Title 1544 0 R
+/A 1541 0 R
+/Parent 1531 0 R
+/Prev 1539 0 R
+/Next 1547 0 R
+>>
+endobj
+1539 0 obj
+<<
+/Title 1540 0 R
+/A 1537 0 R
+/Parent 1531 0 R
+/Prev 1535 0 R
+/Next 1543 0 R
+>>
+endobj
+1535 0 obj
+<<
+/Title 1536 0 R
+/A 1533 0 R
+/Parent 1531 0 R
+/Next 1539 0 R
+>>
+endobj
+1531 0 obj
+<<
+/Title 1532 0 R
+/A 1529 0 R
+/Parent 1523 0 R
+/Prev 1527 0 R
+/First 1535 0 R
+/Last 1623 0 R
+/Count -23
+>>
+endobj
+1527 0 obj
+<<
+/Title 1528 0 R
+/A 1525 0 R
+/Parent 1523 0 R
+/Next 1531 0 R
+>>
+endobj
+1523 0 obj
+<<
+/Title 1524 0 R
+/A 1521 0 R
+/Parent 423 0 R
+/Prev 1519 0 R
+/Next 1627 0 R
+/First 1527 0 R
+/Last 1531 0 R
+/Count -2
+>>
+endobj
+1519 0 obj
+<<
+/Title 1520 0 R
+/A 1517 0 R
+/Parent 423 0 R
+/Prev 1387 0 R
+/Next 1523 0 R
+>>
+endobj
+1515 0 obj
+<<
+/Title 1516 0 R
+/A 1513 0 R
+/Parent 1395 0 R
+/Prev 1511 0 R
+>>
+endobj
+1511 0 obj
+<<
+/Title 1512 0 R
+/A 1509 0 R
+/Parent 1395 0 R
+/Prev 1507 0 R
+/Next 1515 0 R
+>>
+endobj
+1507 0 obj
+<<
+/Title 1508 0 R
+/A 1505 0 R
+/Parent 1395 0 R
+/Prev 1503 0 R
+/Next 1511 0 R
+>>
+endobj
+1503 0 obj
+<<
+/Title 1504 0 R
+/A 1501 0 R
+/Parent 1395 0 R
+/Prev 1499 0 R
+/Next 1507 0 R
+>>
+endobj
+1499 0 obj
+<<
+/Title 1500 0 R
+/A 1497 0 R
+/Parent 1395 0 R
+/Prev 1495 0 R
+/Next 1503 0 R
+>>
+endobj
+1495 0 obj
+<<
+/Title 1496 0 R
+/A 1493 0 R
+/Parent 1395 0 R
+/Prev 1491 0 R
+/Next 1499 0 R
+>>
+endobj
+1491 0 obj
+<<
+/Title 1492 0 R
+/A 1489 0 R
+/Parent 1395 0 R
+/Prev 1487 0 R
+/Next 1495 0 R
+>>
+endobj
+1487 0 obj
+<<
+/Title 1488 0 R
+/A 1485 0 R
+/Parent 1395 0 R
+/Prev 1483 0 R
+/Next 1491 0 R
+>>
+endobj
+1483 0 obj
+<<
+/Title 1484 0 R
+/A 1481 0 R
+/Parent 1395 0 R
+/Prev 1479 0 R
+/Next 1487 0 R
+>>
+endobj
+1479 0 obj
+<<
+/Title 1480 0 R
+/A 1477 0 R
+/Parent 1395 0 R
+/Prev 1475 0 R
+/Next 1483 0 R
+>>
+endobj
+1475 0 obj
+<<
+/Title 1476 0 R
+/A 1473 0 R
+/Parent 1395 0 R
+/Prev 1471 0 R
+/Next 1479 0 R
+>>
+endobj
+1471 0 obj
+<<
+/Title 1472 0 R
+/A 1469 0 R
+/Parent 1395 0 R
+/Prev 1467 0 R
+/Next 1475 0 R
+>>
+endobj
+1467 0 obj
+<<
+/Title 1468 0 R
+/A 1465 0 R
+/Parent 1395 0 R
+/Prev 1463 0 R
+/Next 1471 0 R
+>>
+endobj
+1463 0 obj
+<<
+/Title 1464 0 R
+/A 1461 0 R
+/Parent 1395 0 R
+/Prev 1459 0 R
+/Next 1467 0 R
+>>
+endobj
+1459 0 obj
+<<
+/Title 1460 0 R
+/A 1457 0 R
+/Parent 1395 0 R
+/Prev 1455 0 R
+/Next 1463 0 R
+>>
+endobj
+1455 0 obj
+<<
+/Title 1456 0 R
+/A 1453 0 R
+/Parent 1395 0 R
+/Prev 1451 0 R
+/Next 1459 0 R
+>>
+endobj
+1451 0 obj
+<<
+/Title 1452 0 R
+/A 1449 0 R
+/Parent 1395 0 R
+/Prev 1447 0 R
+/Next 1455 0 R
+>>
+endobj
+1447 0 obj
+<<
+/Title 1448 0 R
+/A 1445 0 R
+/Parent 1395 0 R
+/Prev 1443 0 R
+/Next 1451 0 R
+>>
+endobj
+1443 0 obj
+<<
+/Title 1444 0 R
+/A 1441 0 R
+/Parent 1395 0 R
+/Prev 1439 0 R
+/Next 1447 0 R
+>>
+endobj
+1439 0 obj
+<<
+/Title 1440 0 R
+/A 1437 0 R
+/Parent 1395 0 R
+/Prev 1435 0 R
+/Next 1443 0 R
+>>
+endobj
+1435 0 obj
+<<
+/Title 1436 0 R
+/A 1433 0 R
+/Parent 1395 0 R
+/Prev 1431 0 R
+/Next 1439 0 R
+>>
+endobj
+1431 0 obj
+<<
+/Title 1432 0 R
+/A 1429 0 R
+/Parent 1395 0 R
+/Prev 1427 0 R
+/Next 1435 0 R
+>>
+endobj
+1427 0 obj
+<<
+/Title 1428 0 R
+/A 1425 0 R
+/Parent 1395 0 R
+/Prev 1423 0 R
+/Next 1431 0 R
+>>
+endobj
+1423 0 obj
+<<
+/Title 1424 0 R
+/A 1421 0 R
+/Parent 1395 0 R
+/Prev 1419 0 R
+/Next 1427 0 R
+>>
+endobj
+1419 0 obj
+<<
+/Title 1420 0 R
+/A 1417 0 R
+/Parent 1395 0 R
+/Prev 1415 0 R
+/Next 1423 0 R
+>>
+endobj
+1415 0 obj
+<<
+/Title 1416 0 R
+/A 1413 0 R
+/Parent 1395 0 R
+/Prev 1411 0 R
+/Next 1419 0 R
+>>
+endobj
+1411 0 obj
+<<
+/Title 1412 0 R
+/A 1409 0 R
+/Parent 1395 0 R
+/Prev 1407 0 R
+/Next 1415 0 R
+>>
+endobj
+1407 0 obj
+<<
+/Title 1408 0 R
+/A 1405 0 R
+/Parent 1395 0 R
+/Prev 1403 0 R
+/Next 1411 0 R
+>>
+endobj
+1403 0 obj
+<<
+/Title 1404 0 R
+/A 1401 0 R
+/Parent 1395 0 R
+/Prev 1399 0 R
+/Next 1407 0 R
+>>
+endobj
+1399 0 obj
+<<
+/Title 1400 0 R
+/A 1397 0 R
+/Parent 1395 0 R
+/Next 1403 0 R
+>>
+endobj
+1395 0 obj
+<<
+/Title 1396 0 R
+/A 1393 0 R
+/Parent 1387 0 R
+/Prev 1391 0 R
+/First 1399 0 R
+/Last 1515 0 R
+/Count -30
+>>
+endobj
+1391 0 obj
+<<
+/Title 1392 0 R
+/A 1389 0 R
+/Parent 1387 0 R
+/Next 1395 0 R
+>>
+endobj
+1387 0 obj
+<<
+/Title 1388 0 R
+/A 1385 0 R
+/Parent 423 0 R
+/Prev 1383 0 R
+/Next 1519 0 R
+/First 1391 0 R
+/Last 1395 0 R
+/Count -2
+>>
+endobj
+1383 0 obj
+<<
+/Title 1384 0 R
+/A 1381 0 R
+/Parent 423 0 R
+/Prev 1303 0 R
+/Next 1387 0 R
+>>
+endobj
+1379 0 obj
+<<
+/Title 1380 0 R
+/A 1377 0 R
+/Parent 1311 0 R
+/Prev 1375 0 R
+>>
+endobj
+1375 0 obj
+<<
+/Title 1376 0 R
+/A 1373 0 R
+/Parent 1311 0 R
+/Prev 1371 0 R
+/Next 1379 0 R
+>>
+endobj
+1371 0 obj
+<<
+/Title 1372 0 R
+/A 1369 0 R
+/Parent 1311 0 R
+/Prev 1367 0 R
+/Next 1375 0 R
+>>
+endobj
+1367 0 obj
+<<
+/Title 1368 0 R
+/A 1365 0 R
+/Parent 1311 0 R
+/Prev 1363 0 R
+/Next 1371 0 R
+>>
+endobj
+1363 0 obj
+<<
+/Title 1364 0 R
+/A 1361 0 R
+/Parent 1311 0 R
+/Prev 1359 0 R
+/Next 1367 0 R
+>>
+endobj
+1359 0 obj
+<<
+/Title 1360 0 R
+/A 1357 0 R
+/Parent 1311 0 R
+/Prev 1355 0 R
+/Next 1363 0 R
+>>
+endobj
+1355 0 obj
+<<
+/Title 1356 0 R
+/A 1353 0 R
+/Parent 1311 0 R
+/Prev 1351 0 R
+/Next 1359 0 R
+>>
+endobj
+1351 0 obj
+<<
+/Title 1352 0 R
+/A 1349 0 R
+/Parent 1311 0 R
+/Prev 1347 0 R
+/Next 1355 0 R
+>>
+endobj
+1347 0 obj
+<<
+/Title 1348 0 R
+/A 1345 0 R
+/Parent 1311 0 R
+/Prev 1343 0 R
+/Next 1351 0 R
+>>
+endobj
+1343 0 obj
+<<
+/Title 1344 0 R
+/A 1341 0 R
+/Parent 1311 0 R
+/Prev 1339 0 R
+/Next 1347 0 R
+>>
+endobj
+1339 0 obj
+<<
+/Title 1340 0 R
+/A 1337 0 R
+/Parent 1311 0 R
+/Prev 1335 0 R
+/Next 1343 0 R
+>>
+endobj
+1335 0 obj
+<<
+/Title 1336 0 R
+/A 1333 0 R
+/Parent 1311 0 R
+/Prev 1331 0 R
+/Next 1339 0 R
+>>
+endobj
+1331 0 obj
+<<
+/Title 1332 0 R
+/A 1329 0 R
+/Parent 1311 0 R
+/Prev 1327 0 R
+/Next 1335 0 R
+>>
+endobj
+1327 0 obj
+<<
+/Title 1328 0 R
+/A 1325 0 R
+/Parent 1311 0 R
+/Prev 1323 0 R
+/Next 1331 0 R
+>>
+endobj
+1323 0 obj
+<<
+/Title 1324 0 R
+/A 1321 0 R
+/Parent 1311 0 R
+/Prev 1319 0 R
+/Next 1327 0 R
+>>
+endobj
+1319 0 obj
+<<
+/Title 1320 0 R
+/A 1317 0 R
+/Parent 1311 0 R
+/Prev 1315 0 R
+/Next 1323 0 R
+>>
+endobj
+1315 0 obj
+<<
+/Title 1316 0 R
+/A 1313 0 R
+/Parent 1311 0 R
+/Next 1319 0 R
+>>
+endobj
+1311 0 obj
+<<
+/Title 1312 0 R
+/A 1309 0 R
+/Parent 1303 0 R
+/Prev 1307 0 R
+/First 1315 0 R
+/Last 1379 0 R
+/Count -17
+>>
+endobj
+1307 0 obj
+<<
+/Title 1308 0 R
+/A 1305 0 R
+/Parent 1303 0 R
+/Next 1311 0 R
+>>
+endobj
+1303 0 obj
+<<
+/Title 1304 0 R
+/A 1301 0 R
+/Parent 423 0 R
+/Prev 1299 0 R
+/Next 1383 0 R
+/First 1307 0 R
+/Last 1311 0 R
+/Count -2
+>>
+endobj
+1299 0 obj
+<<
+/Title 1300 0 R
+/A 1297 0 R
+/Parent 423 0 R
+/Prev 1267 0 R
+/Next 1303 0 R
+>>
+endobj
+1295 0 obj
+<<
+/Title 1296 0 R
+/A 1293 0 R
+/Parent 1283 0 R
+/Prev 1291 0 R
+>>
+endobj
+1291 0 obj
+<<
+/Title 1292 0 R
+/A 1289 0 R
+/Parent 1283 0 R
+/Prev 1287 0 R
+/Next 1295 0 R
+>>
+endobj
+1287 0 obj
+<<
+/Title 1288 0 R
+/A 1285 0 R
+/Parent 1283 0 R
+/Next 1291 0 R
+>>
+endobj
+1283 0 obj
+<<
+/Title 1284 0 R
+/A 1281 0 R
+/Parent 1267 0 R
+/Prev 1275 0 R
+/First 1287 0 R
+/Last 1295 0 R
+/Count -3
+>>
+endobj
+1279 0 obj
+<<
+/Title 1280 0 R
+/A 1277 0 R
+/Parent 1275 0 R
+>>
+endobj
+1275 0 obj
+<<
+/Title 1276 0 R
+/A 1273 0 R
+/Parent 1267 0 R
+/Prev 1271 0 R
+/Next 1283 0 R
+/First 1279 0 R
+/Last 1279 0 R
+/Count -1
+>>
+endobj
+1271 0 obj
+<<
+/Title 1272 0 R
+/A 1269 0 R
+/Parent 1267 0 R
+/Next 1275 0 R
+>>
+endobj
+1267 0 obj
+<<
+/Title 1268 0 R
+/A 1265 0 R
+/Parent 423 0 R
+/Prev 1263 0 R
+/Next 1299 0 R
+/First 1271 0 R
+/Last 1283 0 R
+/Count -3
+>>
+endobj
+1263 0 obj
+<<
+/Title 1264 0 R
+/A 1261 0 R
+/Parent 423 0 R
+/Prev 1243 0 R
+/Next 1267 0 R
+>>
+endobj
+1259 0 obj
+<<
+/Title 1260 0 R
+/A 1257 0 R
+/Parent 1251 0 R
+/Prev 1255 0 R
+>>
+endobj
+1255 0 obj
+<<
+/Title 1256 0 R
+/A 1253 0 R
+/Parent 1251 0 R
+/Next 1259 0 R
+>>
+endobj
+1251 0 obj
+<<
+/Title 1252 0 R
+/A 1249 0 R
+/Parent 1243 0 R
+/Prev 1247 0 R
+/First 1255 0 R
+/Last 1259 0 R
+/Count -2
+>>
+endobj
+1247 0 obj
+<<
+/Title 1248 0 R
+/A 1245 0 R
+/Parent 1243 0 R
+/Next 1251 0 R
+>>
+endobj
+1243 0 obj
+<<
+/Title 1244 0 R
+/A 1241 0 R
+/Parent 423 0 R
+/Prev 1239 0 R
+/Next 1263 0 R
+/First 1247 0 R
+/Last 1251 0 R
+/Count -2
+>>
+endobj
+1239 0 obj
+<<
+/Title 1240 0 R
+/A 1237 0 R
+/Parent 423 0 R
+/Prev 1207 0 R
+/Next 1243 0 R
+>>
+endobj
+1235 0 obj
+<<
+/Title 1236 0 R
+/A 1233 0 R
+/Parent 1227 0 R
+/Prev 1231 0 R
+>>
+endobj
+1231 0 obj
+<<
+/Title 1232 0 R
+/A 1229 0 R
+/Parent 1227 0 R
+/Next 1235 0 R
+>>
+endobj
+1227 0 obj
+<<
+/Title 1228 0 R
+/A 1225 0 R
+/Parent 1207 0 R
+/Prev 1215 0 R
+/First 1231 0 R
+/Last 1235 0 R
+/Count -2
+>>
+endobj
+1223 0 obj
+<<
+/Title 1224 0 R
+/A 1221 0 R
+/Parent 1215 0 R
+/Prev 1219 0 R
+>>
+endobj
+1219 0 obj
+<<
+/Title 1220 0 R
+/A 1217 0 R
+/Parent 1215 0 R
+/Next 1223 0 R
+>>
+endobj
+1215 0 obj
+<<
+/Title 1216 0 R
+/A 1213 0 R
+/Parent 1207 0 R
+/Prev 1211 0 R
+/Next 1227 0 R
+/First 1219 0 R
+/Last 1223 0 R
+/Count -2
+>>
+endobj
+1211 0 obj
+<<
+/Title 1212 0 R
+/A 1209 0 R
+/Parent 1207 0 R
+/Next 1215 0 R
+>>
+endobj
+1207 0 obj
+<<
+/Title 1208 0 R
+/A 1205 0 R
+/Parent 423 0 R
+/Prev 1203 0 R
+/Next 1239 0 R
+/First 1211 0 R
+/Last 1227 0 R
+/Count -3
+>>
+endobj
+1203 0 obj
+<<
+/Title 1204 0 R
+/A 1201 0 R
+/Parent 423 0 R
+/Prev 427 0 R
+/Next 1207 0 R
+>>
+endobj
+1199 0 obj
+<<
+/Title 1200 0 R
+/A 1197 0 R
+/Parent 1171 0 R
+/Prev 1195 0 R
+>>
+endobj
+1195 0 obj
+<<
+/Title 1196 0 R
+/A 1193 0 R
+/Parent 1171 0 R
+/Prev 1191 0 R
+/Next 1199 0 R
+>>
+endobj
+1191 0 obj
+<<
+/Title 1192 0 R
+/A 1189 0 R
+/Parent 1171 0 R
+/Prev 1187 0 R
+/Next 1195 0 R
+>>
+endobj
+1187 0 obj
+<<
+/Title 1188 0 R
+/A 1185 0 R
+/Parent 1171 0 R
+/Prev 1183 0 R
+/Next 1191 0 R
+>>
+endobj
+1183 0 obj
+<<
+/Title 1184 0 R
+/A 1181 0 R
+/Parent 1171 0 R
+/Prev 1179 0 R
+/Next 1187 0 R
+>>
+endobj
+1179 0 obj
+<<
+/Title 1180 0 R
+/A 1177 0 R
+/Parent 1171 0 R
+/Prev 1175 0 R
+/Next 1183 0 R
+>>
+endobj
+1175 0 obj
+<<
+/Title 1176 0 R
+/A 1173 0 R
+/Parent 1171 0 R
+/Next 1179 0 R
+>>
+endobj
+1171 0 obj
+<<
+/Title 1172 0 R
+/A 1169 0 R
+/Parent 427 0 R
+/Prev 435 0 R
+/First 1175 0 R
+/Last 1199 0 R
+/Count -7
+>>
+endobj
+1167 0 obj
+<<
+/Title 1168 0 R
+/A 1165 0 R
+/Parent 435 0 R
+/Prev 1163 0 R
+>>
+endobj
+1163 0 obj
+<<
+/Title 1164 0 R
+/A 1161 0 R
+/Parent 435 0 R
+/Prev 1159 0 R
+/Next 1167 0 R
+>>
+endobj
+1159 0 obj
+<<
+/Title 1160 0 R
+/A 1157 0 R
+/Parent 435 0 R
+/Prev 1155 0 R
+/Next 1163 0 R
+>>
+endobj
+1155 0 obj
+<<
+/Title 1156 0 R
+/A 1153 0 R
+/Parent 435 0 R
+/Prev 1151 0 R
+/Next 1159 0 R
+>>
+endobj
+1151 0 obj
+<<
+/Title 1152 0 R
+/A 1149 0 R
+/Parent 435 0 R
+/Prev 1147 0 R
+/Next 1155 0 R
+>>
+endobj
+1147 0 obj
+<<
+/Title 1148 0 R
+/A 1145 0 R
+/Parent 435 0 R
+/Prev 1143 0 R
+/Next 1151 0 R
+>>
+endobj
+1143 0 obj
+<<
+/Title 1144 0 R
+/A 1141 0 R
+/Parent 435 0 R
+/Prev 1139 0 R
+/Next 1147 0 R
+>>
+endobj
+1139 0 obj
+<<
+/Title 1140 0 R
+/A 1137 0 R
+/Parent 435 0 R
+/Prev 1135 0 R
+/Next 1143 0 R
+>>
+endobj
+1135 0 obj
+<<
+/Title 1136 0 R
+/A 1133 0 R
+/Parent 435 0 R
+/Prev 1131 0 R
+/Next 1139 0 R
+>>
+endobj
+1131 0 obj
+<<
+/Title 1132 0 R
+/A 1129 0 R
+/Parent 435 0 R
+/Prev 1127 0 R
+/Next 1135 0 R
+>>
+endobj
+1127 0 obj
+<<
+/Title 1128 0 R
+/A 1125 0 R
+/Parent 435 0 R
+/Prev 1123 0 R
+/Next 1131 0 R
+>>
+endobj
+1123 0 obj
+<<
+/Title 1124 0 R
+/A 1121 0 R
+/Parent 435 0 R
+/Prev 1119 0 R
+/Next 1127 0 R
+>>
+endobj
+1119 0 obj
+<<
+/Title 1120 0 R
+/A 1117 0 R
+/Parent 435 0 R
+/Prev 1115 0 R
+/Next 1123 0 R
+>>
+endobj
+1115 0 obj
+<<
+/Title 1116 0 R
+/A 1113 0 R
+/Parent 435 0 R
+/Prev 1111 0 R
+/Next 1119 0 R
+>>
+endobj
+1111 0 obj
+<<
+/Title 1112 0 R
+/A 1109 0 R
+/Parent 435 0 R
+/Prev 1107 0 R
+/Next 1115 0 R
+>>
+endobj
+1107 0 obj
+<<
+/Title 1108 0 R
+/A 1105 0 R
+/Parent 435 0 R
+/Prev 1103 0 R
+/Next 1111 0 R
+>>
+endobj
+1103 0 obj
+<<
+/Title 1104 0 R
+/A 1101 0 R
+/Parent 435 0 R
+/Prev 1099 0 R
+/Next 1107 0 R
+>>
+endobj
+1099 0 obj
+<<
+/Title 1100 0 R
+/A 1097 0 R
+/Parent 435 0 R
+/Prev 1095 0 R
+/Next 1103 0 R
+>>
+endobj
+1095 0 obj
+<<
+/Title 1096 0 R
+/A 1093 0 R
+/Parent 435 0 R
+/Prev 1091 0 R
+/Next 1099 0 R
+>>
+endobj
+1091 0 obj
+<<
+/Title 1092 0 R
+/A 1089 0 R
+/Parent 435 0 R
+/Prev 1087 0 R
+/Next 1095 0 R
+>>
+endobj
+1087 0 obj
+<<
+/Title 1088 0 R
+/A 1085 0 R
+/Parent 435 0 R
+/Prev 1083 0 R
+/Next 1091 0 R
+>>
+endobj
+1083 0 obj
+<<
+/Title 1084 0 R
+/A 1081 0 R
+/Parent 435 0 R
+/Prev 1079 0 R
+/Next 1087 0 R
+>>
+endobj
+1079 0 obj
+<<
+/Title 1080 0 R
+/A 1077 0 R
+/Parent 435 0 R
+/Prev 1075 0 R
+/Next 1083 0 R
+>>
+endobj
+1075 0 obj
+<<
+/Title 1076 0 R
+/A 1073 0 R
+/Parent 435 0 R
+/Prev 1071 0 R
+/Next 1079 0 R
+>>
+endobj
+1071 0 obj
+<<
+/Title 1072 0 R
+/A 1069 0 R
+/Parent 435 0 R
+/Prev 1067 0 R
+/Next 1075 0 R
+>>
+endobj
+1067 0 obj
+<<
+/Title 1068 0 R
+/A 1065 0 R
+/Parent 435 0 R
+/Prev 1063 0 R
+/Next 1071 0 R
+>>
+endobj
+1063 0 obj
+<<
+/Title 1064 0 R
+/A 1061 0 R
+/Parent 435 0 R
+/Prev 1059 0 R
+/Next 1067 0 R
+>>
+endobj
+1059 0 obj
+<<
+/Title 1060 0 R
+/A 1057 0 R
+/Parent 435 0 R
+/Prev 1055 0 R
+/Next 1063 0 R
+>>
+endobj
+1055 0 obj
+<<
+/Title 1056 0 R
+/A 1053 0 R
+/Parent 435 0 R
+/Prev 1051 0 R
+/Next 1059 0 R
+>>
+endobj
+1051 0 obj
+<<
+/Title 1052 0 R
+/A 1049 0 R
+/Parent 435 0 R
+/Prev 1047 0 R
+/Next 1055 0 R
+>>
+endobj
+1047 0 obj
+<<
+/Title 1048 0 R
+/A 1045 0 R
+/Parent 435 0 R
+/Prev 1043 0 R
+/Next 1051 0 R
+>>
+endobj
+1043 0 obj
+<<
+/Title 1044 0 R
+/A 1041 0 R
+/Parent 435 0 R
+/Prev 1039 0 R
+/Next 1047 0 R
+>>
+endobj
+1039 0 obj
+<<
+/Title 1040 0 R
+/A 1037 0 R
+/Parent 435 0 R
+/Prev 1035 0 R
+/Next 1043 0 R
+>>
+endobj
+1035 0 obj
+<<
+/Title 1036 0 R
+/A 1033 0 R
+/Parent 435 0 R
+/Prev 1031 0 R
+/Next 1039 0 R
+>>
+endobj
+1031 0 obj
+<<
+/Title 1032 0 R
+/A 1029 0 R
+/Parent 435 0 R
+/Prev 1027 0 R
+/Next 1035 0 R
+>>
+endobj
+1027 0 obj
+<<
+/Title 1028 0 R
+/A 1025 0 R
+/Parent 435 0 R
+/Prev 1023 0 R
+/Next 1031 0 R
+>>
+endobj
+1023 0 obj
+<<
+/Title 1024 0 R
+/A 1021 0 R
+/Parent 435 0 R
+/Prev 1019 0 R
+/Next 1027 0 R
+>>
+endobj
+1019 0 obj
+<<
+/Title 1020 0 R
+/A 1017 0 R
+/Parent 435 0 R
+/Prev 1015 0 R
+/Next 1023 0 R
+>>
+endobj
+1015 0 obj
+<<
+/Title 1016 0 R
+/A 1013 0 R
+/Parent 435 0 R
+/Prev 1011 0 R
+/Next 1019 0 R
+>>
+endobj
+1011 0 obj
+<<
+/Title 1012 0 R
+/A 1009 0 R
+/Parent 435 0 R
+/Prev 1007 0 R
+/Next 1015 0 R
+>>
+endobj
+1007 0 obj
+<<
+/Title 1008 0 R
+/A 1005 0 R
+/Parent 435 0 R
+/Prev 1003 0 R
+/Next 1011 0 R
+>>
+endobj
+1003 0 obj
+<<
+/Title 1004 0 R
+/A 1001 0 R
+/Parent 435 0 R
+/Prev 999 0 R
+/Next 1007 0 R
+>>
+endobj
+999 0 obj
+<<
+/Title 1000 0 R
+/A 997 0 R
+/Parent 435 0 R
+/Prev 995 0 R
+/Next 1003 0 R
+>>
+endobj
+995 0 obj
+<<
+/Title 996 0 R
+/A 993 0 R
+/Parent 435 0 R
+/Prev 991 0 R
+/Next 999 0 R
+>>
+endobj
+991 0 obj
+<<
+/Title 992 0 R
+/A 989 0 R
+/Parent 435 0 R
+/Prev 987 0 R
+/Next 995 0 R
+>>
+endobj
+987 0 obj
+<<
+/Title 988 0 R
+/A 985 0 R
+/Parent 435 0 R
+/Prev 983 0 R
+/Next 991 0 R
+>>
+endobj
+983 0 obj
+<<
+/Title 984 0 R
+/A 981 0 R
+/Parent 435 0 R
+/Prev 979 0 R
+/Next 987 0 R
+>>
+endobj
+979 0 obj
+<<
+/Title 980 0 R
+/A 977 0 R
+/Parent 435 0 R
+/Prev 975 0 R
+/Next 983 0 R
+>>
+endobj
+975 0 obj
+<<
+/Title 976 0 R
+/A 973 0 R
+/Parent 435 0 R
+/Prev 971 0 R
+/Next 979 0 R
+>>
+endobj
+971 0 obj
+<<
+/Title 972 0 R
+/A 969 0 R
+/Parent 435 0 R
+/Prev 967 0 R
+/Next 975 0 R
+>>
+endobj
+967 0 obj
+<<
+/Title 968 0 R
+/A 965 0 R
+/Parent 435 0 R
+/Prev 963 0 R
+/Next 971 0 R
+>>
+endobj
+963 0 obj
+<<
+/Title 964 0 R
+/A 961 0 R
+/Parent 435 0 R
+/Prev 959 0 R
+/Next 967 0 R
+>>
+endobj
+959 0 obj
+<<
+/Title 960 0 R
+/A 957 0 R
+/Parent 435 0 R
+/Prev 955 0 R
+/Next 963 0 R
+>>
+endobj
+955 0 obj
+<<
+/Title 956 0 R
+/A 953 0 R
+/Parent 435 0 R
+/Prev 951 0 R
+/Next 959 0 R
+>>
+endobj
+951 0 obj
+<<
+/Title 952 0 R
+/A 949 0 R
+/Parent 435 0 R
+/Prev 947 0 R
+/Next 955 0 R
+>>
+endobj
+947 0 obj
+<<
+/Title 948 0 R
+/A 945 0 R
+/Parent 435 0 R
+/Prev 943 0 R
+/Next 951 0 R
+>>
+endobj
+943 0 obj
+<<
+/Title 944 0 R
+/A 941 0 R
+/Parent 435 0 R
+/Prev 939 0 R
+/Next 947 0 R
+>>
+endobj
+939 0 obj
+<<
+/Title 940 0 R
+/A 937 0 R
+/Parent 435 0 R
+/Prev 935 0 R
+/Next 943 0 R
+>>
+endobj
+935 0 obj
+<<
+/Title 936 0 R
+/A 933 0 R
+/Parent 435 0 R
+/Prev 931 0 R
+/Next 939 0 R
+>>
+endobj
+931 0 obj
+<<
+/Title 932 0 R
+/A 929 0 R
+/Parent 435 0 R
+/Prev 927 0 R
+/Next 935 0 R
+>>
+endobj
+927 0 obj
+<<
+/Title 928 0 R
+/A 925 0 R
+/Parent 435 0 R
+/Prev 923 0 R
+/Next 931 0 R
+>>
+endobj
+923 0 obj
+<<
+/Title 924 0 R
+/A 921 0 R
+/Parent 435 0 R
+/Prev 919 0 R
+/Next 927 0 R
+>>
+endobj
+919 0 obj
+<<
+/Title 920 0 R
+/A 917 0 R
+/Parent 435 0 R
+/Prev 915 0 R
+/Next 923 0 R
+>>
+endobj
+915 0 obj
+<<
+/Title 916 0 R
+/A 913 0 R
+/Parent 435 0 R
+/Prev 911 0 R
+/Next 919 0 R
+>>
+endobj
+911 0 obj
+<<
+/Title 912 0 R
+/A 909 0 R
+/Parent 435 0 R
+/Prev 907 0 R
+/Next 915 0 R
+>>
+endobj
+907 0 obj
+<<
+/Title 908 0 R
+/A 905 0 R
+/Parent 435 0 R
+/Prev 903 0 R
+/Next 911 0 R
+>>
+endobj
+903 0 obj
+<<
+/Title 904 0 R
+/A 901 0 R
+/Parent 435 0 R
+/Prev 899 0 R
+/Next 907 0 R
+>>
+endobj
+899 0 obj
+<<
+/Title 900 0 R
+/A 897 0 R
+/Parent 435 0 R
+/Prev 895 0 R
+/Next 903 0 R
+>>
+endobj
+895 0 obj
+<<
+/Title 896 0 R
+/A 893 0 R
+/Parent 435 0 R
+/Prev 891 0 R
+/Next 899 0 R
+>>
+endobj
+891 0 obj
+<<
+/Title 892 0 R
+/A 889 0 R
+/Parent 435 0 R
+/Prev 887 0 R
+/Next 895 0 R
+>>
+endobj
+887 0 obj
+<<
+/Title 888 0 R
+/A 885 0 R
+/Parent 435 0 R
+/Prev 883 0 R
+/Next 891 0 R
+>>
+endobj
+883 0 obj
+<<
+/Title 884 0 R
+/A 881 0 R
+/Parent 435 0 R
+/Prev 879 0 R
+/Next 887 0 R
+>>
+endobj
+879 0 obj
+<<
+/Title 880 0 R
+/A 877 0 R
+/Parent 435 0 R
+/Prev 875 0 R
+/Next 883 0 R
+>>
+endobj
+875 0 obj
+<<
+/Title 876 0 R
+/A 873 0 R
+/Parent 435 0 R
+/Prev 871 0 R
+/Next 879 0 R
+>>
+endobj
+871 0 obj
+<<
+/Title 872 0 R
+/A 869 0 R
+/Parent 435 0 R
+/Prev 867 0 R
+/Next 875 0 R
+>>
+endobj
+867 0 obj
+<<
+/Title 868 0 R
+/A 865 0 R
+/Parent 435 0 R
+/Prev 863 0 R
+/Next 871 0 R
+>>
+endobj
+863 0 obj
+<<
+/Title 864 0 R
+/A 861 0 R
+/Parent 435 0 R
+/Prev 859 0 R
+/Next 867 0 R
+>>
+endobj
+859 0 obj
+<<
+/Title 860 0 R
+/A 857 0 R
+/Parent 435 0 R
+/Prev 855 0 R
+/Next 863 0 R
+>>
+endobj
+855 0 obj
+<<
+/Title 856 0 R
+/A 853 0 R
+/Parent 435 0 R
+/Prev 851 0 R
+/Next 859 0 R
+>>
+endobj
+851 0 obj
+<<
+/Title 852 0 R
+/A 849 0 R
+/Parent 435 0 R
+/Prev 847 0 R
+/Next 855 0 R
+>>
+endobj
+847 0 obj
+<<
+/Title 848 0 R
+/A 845 0 R
+/Parent 435 0 R
+/Prev 843 0 R
+/Next 851 0 R
+>>
+endobj
+843 0 obj
+<<
+/Title 844 0 R
+/A 841 0 R
+/Parent 435 0 R
+/Prev 839 0 R
+/Next 847 0 R
+>>
+endobj
+839 0 obj
+<<
+/Title 840 0 R
+/A 837 0 R
+/Parent 435 0 R
+/Prev 835 0 R
+/Next 843 0 R
+>>
+endobj
+835 0 obj
+<<
+/Title 836 0 R
+/A 833 0 R
+/Parent 435 0 R
+/Prev 831 0 R
+/Next 839 0 R
+>>
+endobj
+831 0 obj
+<<
+/Title 832 0 R
+/A 829 0 R
+/Parent 435 0 R
+/Prev 827 0 R
+/Next 835 0 R
+>>
+endobj
+827 0 obj
+<<
+/Title 828 0 R
+/A 825 0 R
+/Parent 435 0 R
+/Prev 823 0 R
+/Next 831 0 R
+>>
+endobj
+823 0 obj
+<<
+/Title 824 0 R
+/A 821 0 R
+/Parent 435 0 R
+/Prev 819 0 R
+/Next 827 0 R
+>>
+endobj
+819 0 obj
+<<
+/Title 820 0 R
+/A 817 0 R
+/Parent 435 0 R
+/Prev 815 0 R
+/Next 823 0 R
+>>
+endobj
+815 0 obj
+<<
+/Title 816 0 R
+/A 813 0 R
+/Parent 435 0 R
+/Prev 811 0 R
+/Next 819 0 R
+>>
+endobj
+811 0 obj
+<<
+/Title 812 0 R
+/A 809 0 R
+/Parent 435 0 R
+/Prev 807 0 R
+/Next 815 0 R
+>>
+endobj
+807 0 obj
+<<
+/Title 808 0 R
+/A 805 0 R
+/Parent 435 0 R
+/Prev 803 0 R
+/Next 811 0 R
+>>
+endobj
+803 0 obj
+<<
+/Title 804 0 R
+/A 801 0 R
+/Parent 435 0 R
+/Prev 799 0 R
+/Next 807 0 R
+>>
+endobj
+799 0 obj
+<<
+/Title 800 0 R
+/A 797 0 R
+/Parent 435 0 R
+/Prev 795 0 R
+/Next 803 0 R
+>>
+endobj
+795 0 obj
+<<
+/Title 796 0 R
+/A 793 0 R
+/Parent 435 0 R
+/Prev 791 0 R
+/Next 799 0 R
+>>
+endobj
+791 0 obj
+<<
+/Title 792 0 R
+/A 789 0 R
+/Parent 435 0 R
+/Prev 787 0 R
+/Next 795 0 R
+>>
+endobj
+787 0 obj
+<<
+/Title 788 0 R
+/A 785 0 R
+/Parent 435 0 R
+/Prev 783 0 R
+/Next 791 0 R
+>>
+endobj
+783 0 obj
+<<
+/Title 784 0 R
+/A 781 0 R
+/Parent 435 0 R
+/Prev 779 0 R
+/Next 787 0 R
+>>
+endobj
+779 0 obj
+<<
+/Title 780 0 R
+/A 777 0 R
+/Parent 435 0 R
+/Prev 775 0 R
+/Next 783 0 R
+>>
+endobj
+775 0 obj
+<<
+/Title 776 0 R
+/A 773 0 R
+/Parent 435 0 R
+/Prev 771 0 R
+/Next 779 0 R
+>>
+endobj
+771 0 obj
+<<
+/Title 772 0 R
+/A 769 0 R
+/Parent 435 0 R
+/Prev 767 0 R
+/Next 775 0 R
+>>
+endobj
+767 0 obj
+<<
+/Title 768 0 R
+/A 765 0 R
+/Parent 435 0 R
+/Prev 763 0 R
+/Next 771 0 R
+>>
+endobj
+763 0 obj
+<<
+/Title 764 0 R
+/A 761 0 R
+/Parent 435 0 R
+/Prev 759 0 R
+/Next 767 0 R
+>>
+endobj
+759 0 obj
+<<
+/Title 760 0 R
+/A 757 0 R
+/Parent 435 0 R
+/Prev 755 0 R
+/Next 763 0 R
+>>
+endobj
+755 0 obj
+<<
+/Title 756 0 R
+/A 753 0 R
+/Parent 435 0 R
+/Prev 751 0 R
+/Next 759 0 R
+>>
+endobj
+751 0 obj
+<<
+/Title 752 0 R
+/A 749 0 R
+/Parent 435 0 R
+/Prev 747 0 R
+/Next 755 0 R
+>>
+endobj
+747 0 obj
+<<
+/Title 748 0 R
+/A 745 0 R
+/Parent 435 0 R
+/Prev 743 0 R
+/Next 751 0 R
+>>
+endobj
+743 0 obj
+<<
+/Title 744 0 R
+/A 741 0 R
+/Parent 435 0 R
+/Prev 739 0 R
+/Next 747 0 R
+>>
+endobj
+739 0 obj
+<<
+/Title 740 0 R
+/A 737 0 R
+/Parent 435 0 R
+/Prev 735 0 R
+/Next 743 0 R
+>>
+endobj
+735 0 obj
+<<
+/Title 736 0 R
+/A 733 0 R
+/Parent 435 0 R
+/Prev 731 0 R
+/Next 739 0 R
+>>
+endobj
+731 0 obj
+<<
+/Title 732 0 R
+/A 729 0 R
+/Parent 435 0 R
+/Prev 727 0 R
+/Next 735 0 R
+>>
+endobj
+727 0 obj
+<<
+/Title 728 0 R
+/A 725 0 R
+/Parent 435 0 R
+/Prev 723 0 R
+/Next 731 0 R
+>>
+endobj
+723 0 obj
+<<
+/Title 724 0 R
+/A 721 0 R
+/Parent 435 0 R
+/Prev 719 0 R
+/Next 727 0 R
+>>
+endobj
+719 0 obj
+<<
+/Title 720 0 R
+/A 717 0 R
+/Parent 435 0 R
+/Prev 715 0 R
+/Next 723 0 R
+>>
+endobj
+715 0 obj
+<<
+/Title 716 0 R
+/A 713 0 R
+/Parent 435 0 R
+/Prev 711 0 R
+/Next 719 0 R
+>>
+endobj
+711 0 obj
+<<
+/Title 712 0 R
+/A 709 0 R
+/Parent 435 0 R
+/Prev 707 0 R
+/Next 715 0 R
+>>
+endobj
+707 0 obj
+<<
+/Title 708 0 R
+/A 705 0 R
+/Parent 435 0 R
+/Prev 703 0 R
+/Next 711 0 R
+>>
+endobj
+703 0 obj
+<<
+/Title 704 0 R
+/A 701 0 R
+/Parent 435 0 R
+/Prev 699 0 R
+/Next 707 0 R
+>>
+endobj
+699 0 obj
+<<
+/Title 700 0 R
+/A 697 0 R
+/Parent 435 0 R
+/Prev 695 0 R
+/Next 703 0 R
+>>
+endobj
+695 0 obj
+<<
+/Title 696 0 R
+/A 693 0 R
+/Parent 435 0 R
+/Prev 691 0 R
+/Next 699 0 R
+>>
+endobj
+691 0 obj
+<<
+/Title 692 0 R
+/A 689 0 R
+/Parent 435 0 R
+/Prev 687 0 R
+/Next 695 0 R
+>>
+endobj
+687 0 obj
+<<
+/Title 688 0 R
+/A 685 0 R
+/Parent 435 0 R
+/Prev 683 0 R
+/Next 691 0 R
+>>
+endobj
+683 0 obj
+<<
+/Title 684 0 R
+/A 681 0 R
+/Parent 435 0 R
+/Prev 679 0 R
+/Next 687 0 R
+>>
+endobj
+679 0 obj
+<<
+/Title 680 0 R
+/A 677 0 R
+/Parent 435 0 R
+/Prev 675 0 R
+/Next 683 0 R
+>>
+endobj
+675 0 obj
+<<
+/Title 676 0 R
+/A 673 0 R
+/Parent 435 0 R
+/Prev 671 0 R
+/Next 679 0 R
+>>
+endobj
+671 0 obj
+<<
+/Title 672 0 R
+/A 669 0 R
+/Parent 435 0 R
+/Prev 667 0 R
+/Next 675 0 R
+>>
+endobj
+667 0 obj
+<<
+/Title 668 0 R
+/A 665 0 R
+/Parent 435 0 R
+/Prev 663 0 R
+/Next 671 0 R
+>>
+endobj
+663 0 obj
+<<
+/Title 664 0 R
+/A 661 0 R
+/Parent 435 0 R
+/Prev 659 0 R
+/Next 667 0 R
+>>
+endobj
+659 0 obj
+<<
+/Title 660 0 R
+/A 657 0 R
+/Parent 435 0 R
+/Prev 655 0 R
+/Next 663 0 R
+>>
+endobj
+655 0 obj
+<<
+/Title 656 0 R
+/A 653 0 R
+/Parent 435 0 R
+/Prev 651 0 R
+/Next 659 0 R
+>>
+endobj
+651 0 obj
+<<
+/Title 652 0 R
+/A 649 0 R
+/Parent 435 0 R
+/Prev 647 0 R
+/Next 655 0 R
+>>
+endobj
+647 0 obj
+<<
+/Title 648 0 R
+/A 645 0 R
+/Parent 435 0 R
+/Prev 643 0 R
+/Next 651 0 R
+>>
+endobj
+643 0 obj
+<<
+/Title 644 0 R
+/A 641 0 R
+/Parent 435 0 R
+/Prev 639 0 R
+/Next 647 0 R
+>>
+endobj
+639 0 obj
+<<
+/Title 640 0 R
+/A 637 0 R
+/Parent 435 0 R
+/Prev 635 0 R
+/Next 643 0 R
+>>
+endobj
+635 0 obj
+<<
+/Title 636 0 R
+/A 633 0 R
+/Parent 435 0 R
+/Prev 631 0 R
+/Next 639 0 R
+>>
+endobj
+631 0 obj
+<<
+/Title 632 0 R
+/A 629 0 R
+/Parent 435 0 R
+/Prev 627 0 R
+/Next 635 0 R
+>>
+endobj
+627 0 obj
+<<
+/Title 628 0 R
+/A 625 0 R
+/Parent 435 0 R
+/Prev 623 0 R
+/Next 631 0 R
+>>
+endobj
+623 0 obj
+<<
+/Title 624 0 R
+/A 621 0 R
+/Parent 435 0 R
+/Prev 619 0 R
+/Next 627 0 R
+>>
+endobj
+619 0 obj
+<<
+/Title 620 0 R
+/A 617 0 R
+/Parent 435 0 R
+/Prev 615 0 R
+/Next 623 0 R
+>>
+endobj
+615 0 obj
+<<
+/Title 616 0 R
+/A 613 0 R
+/Parent 435 0 R
+/Prev 611 0 R
+/Next 619 0 R
+>>
+endobj
+611 0 obj
+<<
+/Title 612 0 R
+/A 609 0 R
+/Parent 435 0 R
+/Prev 607 0 R
+/Next 615 0 R
+>>
+endobj
+607 0 obj
+<<
+/Title 608 0 R
+/A 605 0 R
+/Parent 435 0 R
+/Prev 603 0 R
+/Next 611 0 R
+>>
+endobj
+603 0 obj
+<<
+/Title 604 0 R
+/A 601 0 R
+/Parent 435 0 R
+/Prev 599 0 R
+/Next 607 0 R
+>>
+endobj
+599 0 obj
+<<
+/Title 600 0 R
+/A 597 0 R
+/Parent 435 0 R
+/Prev 595 0 R
+/Next 603 0 R
+>>
+endobj
+595 0 obj
+<<
+/Title 596 0 R
+/A 593 0 R
+/Parent 435 0 R
+/Prev 591 0 R
+/Next 599 0 R
+>>
+endobj
+591 0 obj
+<<
+/Title 592 0 R
+/A 589 0 R
+/Parent 435 0 R
+/Prev 587 0 R
+/Next 595 0 R
+>>
+endobj
+587 0 obj
+<<
+/Title 588 0 R
+/A 585 0 R
+/Parent 435 0 R
+/Prev 583 0 R
+/Next 591 0 R
+>>
+endobj
+583 0 obj
+<<
+/Title 584 0 R
+/A 581 0 R
+/Parent 435 0 R
+/Prev 579 0 R
+/Next 587 0 R
+>>
+endobj
+579 0 obj
+<<
+/Title 580 0 R
+/A 577 0 R
+/Parent 435 0 R
+/Prev 575 0 R
+/Next 583 0 R
+>>
+endobj
+575 0 obj
+<<
+/Title 576 0 R
+/A 573 0 R
+/Parent 435 0 R
+/Prev 571 0 R
+/Next 579 0 R
+>>
+endobj
+571 0 obj
+<<
+/Title 572 0 R
+/A 569 0 R
+/Parent 435 0 R
+/Prev 567 0 R
+/Next 575 0 R
+>>
+endobj
+567 0 obj
+<<
+/Title 568 0 R
+/A 565 0 R
+/Parent 435 0 R
+/Prev 563 0 R
+/Next 571 0 R
+>>
+endobj
+563 0 obj
+<<
+/Title 564 0 R
+/A 561 0 R
+/Parent 435 0 R
+/Prev 559 0 R
+/Next 567 0 R
+>>
+endobj
+559 0 obj
+<<
+/Title 560 0 R
+/A 557 0 R
+/Parent 435 0 R
+/Prev 555 0 R
+/Next 563 0 R
+>>
+endobj
+555 0 obj
+<<
+/Title 556 0 R
+/A 553 0 R
+/Parent 435 0 R
+/Prev 551 0 R
+/Next 559 0 R
+>>
+endobj
+551 0 obj
+<<
+/Title 552 0 R
+/A 549 0 R
+/Parent 435 0 R
+/Prev 547 0 R
+/Next 555 0 R
+>>
+endobj
+547 0 obj
+<<
+/Title 548 0 R
+/A 545 0 R
+/Parent 435 0 R
+/Prev 543 0 R
+/Next 551 0 R
+>>
+endobj
+543 0 obj
+<<
+/Title 544 0 R
+/A 541 0 R
+/Parent 435 0 R
+/Prev 539 0 R
+/Next 547 0 R
+>>
+endobj
+539 0 obj
+<<
+/Title 540 0 R
+/A 537 0 R
+/Parent 435 0 R
+/Prev 535 0 R
+/Next 543 0 R
+>>
+endobj
+535 0 obj
+<<
+/Title 536 0 R
+/A 533 0 R
+/Parent 435 0 R
+/Prev 531 0 R
+/Next 539 0 R
+>>
+endobj
+531 0 obj
+<<
+/Title 532 0 R
+/A 529 0 R
+/Parent 435 0 R
+/Prev 527 0 R
+/Next 535 0 R
+>>
+endobj
+527 0 obj
+<<
+/Title 528 0 R
+/A 525 0 R
+/Parent 435 0 R
+/Prev 523 0 R
+/Next 531 0 R
+>>
+endobj
+523 0 obj
+<<
+/Title 524 0 R
+/A 521 0 R
+/Parent 435 0 R
+/Prev 519 0 R
+/Next 527 0 R
+>>
+endobj
+519 0 obj
+<<
+/Title 520 0 R
+/A 517 0 R
+/Parent 435 0 R
+/Prev 515 0 R
+/Next 523 0 R
+>>
+endobj
+515 0 obj
+<<
+/Title 516 0 R
+/A 513 0 R
+/Parent 435 0 R
+/Prev 511 0 R
+/Next 519 0 R
+>>
+endobj
+511 0 obj
+<<
+/Title 512 0 R
+/A 509 0 R
+/Parent 435 0 R
+/Prev 507 0 R
+/Next 515 0 R
+>>
+endobj
+507 0 obj
+<<
+/Title 508 0 R
+/A 505 0 R
+/Parent 435 0 R
+/Prev 503 0 R
+/Next 511 0 R
+>>
+endobj
+503 0 obj
+<<
+/Title 504 0 R
+/A 501 0 R
+/Parent 435 0 R
+/Prev 499 0 R
+/Next 507 0 R
+>>
+endobj
+499 0 obj
+<<
+/Title 500 0 R
+/A 497 0 R
+/Parent 435 0 R
+/Prev 495 0 R
+/Next 503 0 R
+>>
+endobj
+495 0 obj
+<<
+/Title 496 0 R
+/A 493 0 R
+/Parent 435 0 R
+/Prev 491 0 R
+/Next 499 0 R
+>>
+endobj
+491 0 obj
+<<
+/Title 492 0 R
+/A 489 0 R
+/Parent 435 0 R
+/Prev 487 0 R
+/Next 495 0 R
+>>
+endobj
+487 0 obj
+<<
+/Title 488 0 R
+/A 485 0 R
+/Parent 435 0 R
+/Prev 483 0 R
+/Next 491 0 R
+>>
+endobj
+483 0 obj
+<<
+/Title 484 0 R
+/A 481 0 R
+/Parent 435 0 R
+/Prev 479 0 R
+/Next 487 0 R
+>>
+endobj
+479 0 obj
+<<
+/Title 480 0 R
+/A 477 0 R
+/Parent 435 0 R
+/Prev 475 0 R
+/Next 483 0 R
+>>
+endobj
+475 0 obj
+<<
+/Title 476 0 R
+/A 473 0 R
+/Parent 435 0 R
+/Prev 471 0 R
+/Next 479 0 R
+>>
+endobj
+471 0 obj
+<<
+/Title 472 0 R
+/A 469 0 R
+/Parent 435 0 R
+/Prev 467 0 R
+/Next 475 0 R
+>>
+endobj
+467 0 obj
+<<
+/Title 468 0 R
+/A 465 0 R
+/Parent 435 0 R
+/Prev 463 0 R
+/Next 471 0 R
+>>
+endobj
+463 0 obj
+<<
+/Title 464 0 R
+/A 461 0 R
+/Parent 435 0 R
+/Prev 459 0 R
+/Next 467 0 R
+>>
+endobj
+459 0 obj
+<<
+/Title 460 0 R
+/A 457 0 R
+/Parent 435 0 R
+/Prev 455 0 R
+/Next 463 0 R
+>>
+endobj
+455 0 obj
+<<
+/Title 456 0 R
+/A 453 0 R
+/Parent 435 0 R
+/Prev 451 0 R
+/Next 459 0 R
+>>
+endobj
+451 0 obj
+<<
+/Title 452 0 R
+/A 449 0 R
+/Parent 435 0 R
+/Prev 447 0 R
+/Next 455 0 R
+>>
+endobj
+447 0 obj
+<<
+/Title 448 0 R
+/A 445 0 R
+/Parent 435 0 R
+/Prev 443 0 R
+/Next 451 0 R
+>>
+endobj
+443 0 obj
+<<
+/Title 444 0 R
+/A 441 0 R
+/Parent 435 0 R
+/Prev 439 0 R
+/Next 447 0 R
+>>
+endobj
+439 0 obj
+<<
+/Title 440 0 R
+/A 437 0 R
+/Parent 435 0 R
+/Next 443 0 R
+>>
+endobj
+435 0 obj
+<<
+/Title 436 0 R
+/A 433 0 R
+/Parent 427 0 R
+/Prev 431 0 R
+/Next 1171 0 R
+/First 439 0 R
+/Last 1167 0 R
+/Count -183
+>>
+endobj
+431 0 obj
+<<
+/Title 432 0 R
+/A 429 0 R
+/Parent 427 0 R
+/Next 435 0 R
+>>
+endobj
+427 0 obj
+<<
+/Title 428 0 R
+/A 425 0 R
+/Parent 423 0 R
+/Next 1203 0 R
+/First 431 0 R
+/Last 1171 0 R
+/Count -3
+>>
+endobj
+423 0 obj
+<<
+/Title 424 0 R
+/A 421 0 R
+/Parent 7163 0 R
+/Prev 55 0 R
+/Next 2251 0 R
+/First 427 0 R
+/Last 2247 0 R
+/Count -33
+>>
+endobj
+419 0 obj
+<<
+/Title 420 0 R
+/A 417 0 R
+/Parent 411 0 R
+/Prev 415 0 R
+>>
+endobj
+415 0 obj
+<<
+/Title 416 0 R
+/A 413 0 R
+/Parent 411 0 R
+/Next 419 0 R
+>>
+endobj
+411 0 obj
+<<
+/Title 412 0 R
+/A 409 0 R
+/Parent 403 0 R
+/Prev 407 0 R
+/First 415 0 R
+/Last 419 0 R
+/Count -2
+>>
+endobj
+407 0 obj
+<<
+/Title 408 0 R
+/A 405 0 R
+/Parent 403 0 R
+/Next 411 0 R
+>>
+endobj
+403 0 obj
+<<
+/Title 404 0 R
+/A 401 0 R
+/Parent 55 0 R
+/Prev 279 0 R
+/First 407 0 R
+/Last 411 0 R
+/Count -2
+>>
+endobj
+399 0 obj
+<<
+/Title 400 0 R
+/A 397 0 R
+/Parent 287 0 R
+/Prev 395 0 R
+>>
+endobj
+395 0 obj
+<<
+/Title 396 0 R
+/A 393 0 R
+/Parent 287 0 R
+/Prev 391 0 R
+/Next 399 0 R
+>>
+endobj
+391 0 obj
+<<
+/Title 392 0 R
+/A 389 0 R
+/Parent 287 0 R
+/Prev 387 0 R
+/Next 395 0 R
+>>
+endobj
+387 0 obj
+<<
+/Title 388 0 R
+/A 385 0 R
+/Parent 287 0 R
+/Prev 383 0 R
+/Next 391 0 R
+>>
+endobj
+383 0 obj
+<<
+/Title 384 0 R
+/A 381 0 R
+/Parent 287 0 R
+/Prev 379 0 R
+/Next 387 0 R
+>>
+endobj
+379 0 obj
+<<
+/Title 380 0 R
+/A 377 0 R
+/Parent 287 0 R
+/Prev 375 0 R
+/Next 383 0 R
+>>
+endobj
+375 0 obj
+<<
+/Title 376 0 R
+/A 373 0 R
+/Parent 287 0 R
+/Prev 371 0 R
+/Next 379 0 R
+>>
+endobj
+371 0 obj
+<<
+/Title 372 0 R
+/A 369 0 R
+/Parent 287 0 R
+/Prev 367 0 R
+/Next 375 0 R
+>>
+endobj
+367 0 obj
+<<
+/Title 368 0 R
+/A 365 0 R
+/Parent 287 0 R
+/Prev 363 0 R
+/Next 371 0 R
+>>
+endobj
+363 0 obj
+<<
+/Title 364 0 R
+/A 361 0 R
+/Parent 287 0 R
+/Prev 359 0 R
+/Next 367 0 R
+>>
+endobj
+359 0 obj
+<<
+/Title 360 0 R
+/A 357 0 R
+/Parent 287 0 R
+/Prev 355 0 R
+/Next 363 0 R
+>>
+endobj
+355 0 obj
+<<
+/Title 356 0 R
+/A 353 0 R
+/Parent 287 0 R
+/Prev 351 0 R
+/Next 359 0 R
+>>
+endobj
+351 0 obj
+<<
+/Title 352 0 R
+/A 349 0 R
+/Parent 287 0 R
+/Prev 347 0 R
+/Next 355 0 R
+>>
+endobj
+347 0 obj
+<<
+/Title 348 0 R
+/A 345 0 R
+/Parent 287 0 R
+/Prev 343 0 R
+/Next 351 0 R
+>>
+endobj
+343 0 obj
+<<
+/Title 344 0 R
+/A 341 0 R
+/Parent 287 0 R
+/Prev 339 0 R
+/Next 347 0 R
+>>
+endobj
+339 0 obj
+<<
+/Title 340 0 R
+/A 337 0 R
+/Parent 287 0 R
+/Prev 335 0 R
+/Next 343 0 R
+>>
+endobj
+335 0 obj
+<<
+/Title 336 0 R
+/A 333 0 R
+/Parent 287 0 R
+/Prev 331 0 R
+/Next 339 0 R
+>>
+endobj
+331 0 obj
+<<
+/Title 332 0 R
+/A 329 0 R
+/Parent 287 0 R
+/Prev 327 0 R
+/Next 335 0 R
+>>
+endobj
+327 0 obj
+<<
+/Title 328 0 R
+/A 325 0 R
+/Parent 287 0 R
+/Prev 323 0 R
+/Next 331 0 R
+>>
+endobj
+323 0 obj
+<<
+/Title 324 0 R
+/A 321 0 R
+/Parent 287 0 R
+/Prev 319 0 R
+/Next 327 0 R
+>>
+endobj
+319 0 obj
+<<
+/Title 320 0 R
+/A 317 0 R
+/Parent 287 0 R
+/Prev 315 0 R
+/Next 323 0 R
+>>
+endobj
+315 0 obj
+<<
+/Title 316 0 R
+/A 313 0 R
+/Parent 287 0 R
+/Prev 311 0 R
+/Next 319 0 R
+>>
+endobj
+311 0 obj
+<<
+/Title 312 0 R
+/A 309 0 R
+/Parent 287 0 R
+/Prev 307 0 R
+/Next 315 0 R
+>>
+endobj
+307 0 obj
+<<
+/Title 308 0 R
+/A 305 0 R
+/Parent 287 0 R
+/Prev 303 0 R
+/Next 311 0 R
+>>
+endobj
+303 0 obj
+<<
+/Title 304 0 R
+/A 301 0 R
+/Parent 287 0 R
+/Prev 299 0 R
+/Next 307 0 R
+>>
+endobj
+299 0 obj
+<<
+/Title 300 0 R
+/A 297 0 R
+/Parent 287 0 R
+/Prev 295 0 R
+/Next 303 0 R
+>>
+endobj
+295 0 obj
+<<
+/Title 296 0 R
+/A 293 0 R
+/Parent 287 0 R
+/Prev 291 0 R
+/Next 299 0 R
+>>
+endobj
+291 0 obj
+<<
+/Title 292 0 R
+/A 289 0 R
+/Parent 287 0 R
+/Next 295 0 R
+>>
+endobj
+287 0 obj
+<<
+/Title 288 0 R
+/A 285 0 R
+/Parent 279 0 R
+/Prev 283 0 R
+/First 291 0 R
+/Last 399 0 R
+/Count -28
+>>
+endobj
+283 0 obj
+<<
+/Title 284 0 R
+/A 281 0 R
+/Parent 279 0 R
+/Next 287 0 R
+>>
+endobj
+279 0 obj
+<<
+/Title 280 0 R
+/A 277 0 R
+/Parent 55 0 R
+/Prev 211 0 R
+/Next 403 0 R
+/First 283 0 R
+/Last 287 0 R
+/Count -2
+>>
+endobj
+275 0 obj
+<<
+/Title 276 0 R
+/A 273 0 R
+/Parent 219 0 R
+/Prev 271 0 R
+>>
+endobj
+271 0 obj
+<<
+/Title 272 0 R
+/A 269 0 R
+/Parent 219 0 R
+/Prev 267 0 R
+/Next 275 0 R
+>>
+endobj
+267 0 obj
+<<
+/Title 268 0 R
+/A 265 0 R
+/Parent 219 0 R
+/Prev 263 0 R
+/Next 271 0 R
+>>
+endobj
+263 0 obj
+<<
+/Title 264 0 R
+/A 261 0 R
+/Parent 219 0 R
+/Prev 259 0 R
+/Next 267 0 R
+>>
+endobj
+259 0 obj
+<<
+/Title 260 0 R
+/A 257 0 R
+/Parent 219 0 R
+/Prev 255 0 R
+/Next 263 0 R
+>>
+endobj
+255 0 obj
+<<
+/Title 256 0 R
+/A 253 0 R
+/Parent 219 0 R
+/Prev 251 0 R
+/Next 259 0 R
+>>
+endobj
+251 0 obj
+<<
+/Title 252 0 R
+/A 249 0 R
+/Parent 219 0 R
+/Prev 247 0 R
+/Next 255 0 R
+>>
+endobj
+247 0 obj
+<<
+/Title 248 0 R
+/A 245 0 R
+/Parent 219 0 R
+/Prev 243 0 R
+/Next 251 0 R
+>>
+endobj
+243 0 obj
+<<
+/Title 244 0 R
+/A 241 0 R
+/Parent 219 0 R
+/Prev 239 0 R
+/Next 247 0 R
+>>
+endobj
+239 0 obj
+<<
+/Title 240 0 R
+/A 237 0 R
+/Parent 219 0 R
+/Prev 235 0 R
+/Next 243 0 R
+>>
+endobj
+235 0 obj
+<<
+/Title 236 0 R
+/A 233 0 R
+/Parent 219 0 R
+/Prev 231 0 R
+/Next 239 0 R
+>>
+endobj
+231 0 obj
+<<
+/Title 232 0 R
+/A 229 0 R
+/Parent 219 0 R
+/Prev 227 0 R
+/Next 235 0 R
+>>
+endobj
+227 0 obj
+<<
+/Title 228 0 R
+/A 225 0 R
+/Parent 219 0 R
+/Prev 223 0 R
+/Next 231 0 R
+>>
+endobj
+223 0 obj
+<<
+/Title 224 0 R
+/A 221 0 R
+/Parent 219 0 R
+/Next 227 0 R
+>>
+endobj
+219 0 obj
+<<
+/Title 220 0 R
+/A 217 0 R
+/Parent 211 0 R
+/Prev 215 0 R
+/First 223 0 R
+/Last 275 0 R
+/Count -14
+>>
+endobj
+215 0 obj
+<<
+/Title 216 0 R
+/A 213 0 R
+/Parent 211 0 R
+/Next 219 0 R
+>>
+endobj
+211 0 obj
+<<
+/Title 212 0 R
+/A 209 0 R
+/Parent 55 0 R
+/Prev 203 0 R
+/Next 279 0 R
+/First 215 0 R
+/Last 219 0 R
+/Count -2
+>>
+endobj
+207 0 obj
+<<
+/Title 208 0 R
+/A 205 0 R
+/Parent 203 0 R
+>>
+endobj
+203 0 obj
+<<
+/Title 204 0 R
+/A 201 0 R
+/Parent 55 0 R
+/Prev 183 0 R
+/Next 211 0 R
+/First 207 0 R
+/Last 207 0 R
+/Count -1
+>>
+endobj
+199 0 obj
+<<
+/Title 200 0 R
+/A 197 0 R
+/Parent 191 0 R
+/Prev 195 0 R
+>>
+endobj
+195 0 obj
+<<
+/Title 196 0 R
+/A 193 0 R
+/Parent 191 0 R
+/Next 199 0 R
+>>
+endobj
+191 0 obj
+<<
+/Title 192 0 R
+/A 189 0 R
+/Parent 183 0 R
+/Prev 187 0 R
+/First 195 0 R
+/Last 199 0 R
+/Count -2
+>>
+endobj
+187 0 obj
+<<
+/Title 188 0 R
+/A 185 0 R
+/Parent 183 0 R
+/Next 191 0 R
+>>
+endobj
+183 0 obj
+<<
+/Title 184 0 R
+/A 181 0 R
+/Parent 55 0 R
+/Prev 159 0 R
+/Next 203 0 R
+/First 187 0 R
+/Last 191 0 R
+/Count -2
+>>
+endobj
+179 0 obj
+<<
+/Title 180 0 R
+/A 177 0 R
+/Parent 167 0 R
+/Prev 175 0 R
+>>
+endobj
+175 0 obj
+<<
+/Title 176 0 R
+/A 173 0 R
+/Parent 167 0 R
+/Prev 171 0 R
+/Next 179 0 R
+>>
+endobj
+171 0 obj
+<<
+/Title 172 0 R
+/A 169 0 R
+/Parent 167 0 R
+/Next 175 0 R
+>>
+endobj
+167 0 obj
+<<
+/Title 168 0 R
+/A 165 0 R
+/Parent 159 0 R
+/Prev 163 0 R
+/First 171 0 R
+/Last 179 0 R
+/Count -3
+>>
+endobj
+163 0 obj
+<<
+/Title 164 0 R
+/A 161 0 R
+/Parent 159 0 R
+/Next 167 0 R
+>>
+endobj
+159 0 obj
+<<
+/Title 160 0 R
+/A 157 0 R
+/Parent 55 0 R
+/Prev 135 0 R
+/Next 183 0 R
+/First 163 0 R
+/Last 167 0 R
+/Count -2
+>>
+endobj
+155 0 obj
+<<
+/Title 156 0 R
+/A 153 0 R
+/Parent 143 0 R
+/Prev 151 0 R
+>>
+endobj
+151 0 obj
+<<
+/Title 152 0 R
+/A 149 0 R
+/Parent 143 0 R
+/Prev 147 0 R
+/Next 155 0 R
+>>
+endobj
+147 0 obj
+<<
+/Title 148 0 R
+/A 145 0 R
+/Parent 143 0 R
+/Next 151 0 R
+>>
+endobj
+143 0 obj
+<<
+/Title 144 0 R
+/A 141 0 R
+/Parent 135 0 R
+/Prev 139 0 R
+/First 147 0 R
+/Last 155 0 R
+/Count -3
+>>
+endobj
+139 0 obj
+<<
+/Title 140 0 R
+/A 137 0 R
+/Parent 135 0 R
+/Next 143 0 R
+>>
+endobj
+135 0 obj
+<<
+/Title 136 0 R
+/A 133 0 R
+/Parent 55 0 R
+/Prev 107 0 R
+/Next 159 0 R
+/First 139 0 R
+/Last 143 0 R
+/Count -2
+>>
+endobj
+131 0 obj
+<<
+/Title 132 0 R
+/A 129 0 R
+/Parent 115 0 R
+/Prev 127 0 R
+>>
+endobj
+127 0 obj
+<<
+/Title 128 0 R
+/A 125 0 R
+/Parent 115 0 R
+/Prev 123 0 R
+/Next 131 0 R
+>>
+endobj
+123 0 obj
+<<
+/Title 124 0 R
+/A 121 0 R
+/Parent 115 0 R
+/Prev 119 0 R
+/Next 127 0 R
+>>
+endobj
+119 0 obj
+<<
+/Title 120 0 R
+/A 117 0 R
+/Parent 115 0 R
+/Next 123 0 R
+>>
+endobj
+115 0 obj
+<<
+/Title 116 0 R
+/A 113 0 R
+/Parent 107 0 R
+/Prev 111 0 R
+/First 119 0 R
+/Last 131 0 R
+/Count -4
+>>
+endobj
+111 0 obj
+<<
+/Title 112 0 R
+/A 109 0 R
+/Parent 107 0 R
+/Next 115 0 R
+>>
+endobj
+107 0 obj
+<<
+/Title 108 0 R
+/A 105 0 R
+/Parent 55 0 R
+/Prev 103 0 R
+/Next 135 0 R
+/First 111 0 R
+/Last 115 0 R
+/Count -2
+>>
+endobj
+103 0 obj
+<<
+/Title 104 0 R
+/A 101 0 R
+/Parent 55 0 R
+/Prev 59 0 R
+/Next 107 0 R
+>>
+endobj
+99 0 obj
+<<
+/Title 100 0 R
+/A 97 0 R
+/Parent 67 0 R
+/Prev 95 0 R
+>>
+endobj
+95 0 obj
+<<
+/Title 96 0 R
+/A 93 0 R
+/Parent 67 0 R
+/Prev 91 0 R
+/Next 99 0 R
+>>
+endobj
+91 0 obj
+<<
+/Title 92 0 R
+/A 89 0 R
+/Parent 67 0 R
+/Prev 87 0 R
+/Next 95 0 R
+>>
+endobj
+87 0 obj
+<<
+/Title 88 0 R
+/A 85 0 R
+/Parent 67 0 R
+/Prev 83 0 R
+/Next 91 0 R
+>>
+endobj
+83 0 obj
+<<
+/Title 84 0 R
+/A 81 0 R
+/Parent 67 0 R
+/Prev 79 0 R
+/Next 87 0 R
+>>
+endobj
+79 0 obj
+<<
+/Title 80 0 R
+/A 77 0 R
+/Parent 67 0 R
+/Prev 75 0 R
+/Next 83 0 R
+>>
+endobj
+75 0 obj
+<<
+/Title 76 0 R
+/A 73 0 R
+/Parent 67 0 R
+/Prev 71 0 R
+/Next 79 0 R
+>>
+endobj
+71 0 obj
+<<
+/Title 72 0 R
+/A 69 0 R
+/Parent 67 0 R
+/Next 75 0 R
+>>
+endobj
+67 0 obj
+<<
+/Title 68 0 R
+/A 65 0 R
+/Parent 59 0 R
+/Prev 63 0 R
+/First 71 0 R
+/Last 99 0 R
+/Count -8
+>>
+endobj
+63 0 obj
+<<
+/Title 64 0 R
+/A 61 0 R
+/Parent 59 0 R
+/Next 67 0 R
+>>
+endobj
+59 0 obj
+<<
+/Title 60 0 R
+/A 57 0 R
+/Parent 55 0 R
+/Next 103 0 R
+/First 63 0 R
+/Last 67 0 R
+/Count -2
+>>
+endobj
+55 0 obj
+<<
+/Title 56 0 R
+/A 53 0 R
+/Parent 7163 0 R
+/Prev 47 0 R
+/Next 423 0 R
+/First 59 0 R
+/Last 403 0 R
+/Count -10
+>>
+endobj
+51 0 obj
+<<
+/Title 52 0 R
+/A 49 0 R
+/Parent 47 0 R
+>>
+endobj
+47 0 obj
+<<
+/Title 48 0 R
+/A 45 0 R
+/Parent 7163 0 R
+/Prev 39 0 R
+/Next 55 0 R
+/First 51 0 R
+/Last 51 0 R
+/Count -1
+>>
+endobj
+43 0 obj
+<<
+/Title 44 0 R
+/A 41 0 R
+/Parent 39 0 R
+>>
+endobj
+39 0 obj
+<<
+/Title 40 0 R
+/A 37 0 R
+/Parent 7163 0 R
+/Prev 31 0 R
+/Next 47 0 R
+/First 43 0 R
+/Last 43 0 R
+/Count -1
+>>
+endobj
+35 0 obj
+<<
+/Title 36 0 R
+/A 33 0 R
+/Parent 31 0 R
+>>
+endobj
+31 0 obj
+<<
+/Title 32 0 R
+/A 29 0 R
+/Parent 7163 0 R
+/Prev 3 0 R
+/Next 39 0 R
+/First 35 0 R
+/Last 35 0 R
+/Count -1
+>>
+endobj
+27 0 obj
+<<
+/Title 28 0 R
+/A 25 0 R
+/Parent 19 0 R
+/Prev 23 0 R
+>>
+endobj
+23 0 obj
+<<
+/Title 24 0 R
+/A 21 0 R
+/Parent 19 0 R
+/Next 27 0 R
+>>
+endobj
+19 0 obj
+<<
+/Title 20 0 R
+/A 17 0 R
+/Parent 3 0 R
+/Prev 7 0 R
+/First 23 0 R
+/Last 27 0 R
+/Count -2
+>>
+endobj
+15 0 obj
+<<
+/Title 16 0 R
+/A 13 0 R
+/Parent 7 0 R
+/Prev 11 0 R
+>>
+endobj
+11 0 obj
+<<
+/Title 12 0 R
+/A 9 0 R
+/Parent 7 0 R
+/Next 15 0 R
+>>
+endobj
+7 0 obj
+<<
+/Title 8 0 R
+/A 5 0 R
+/Parent 3 0 R
+/Next 19 0 R
+/First 11 0 R
+/Last 15 0 R
+/Count -2
+>>
+endobj
+3 0 obj
+<<
+/Title 4 0 R
+/A 1 0 R
+/Parent 7163 0 R
+/Next 31 0 R
+/First 7 0 R
+/Last 19 0 R
+/Count -2
+>>
+endobj
+7164 0 obj
+<<
+/Names [(Doc-Start) 2257 0 R (Item.1) 2926 0 R (Item.10) 2941 0 R (Item.11) 2942 0 R (Item.12) 2943 0 R (Item.13) 2945 0 R]
+/Limits [(Doc-Start) (Item.13)]
+>>
+endobj
+7165 0 obj
+<<
+/Names [(Item.14) 2946 0 R (Item.15) 2947 0 R (Item.16) 2948 0 R (Item.2) 2927 0 R (Item.3) 2928 0 R (Item.4) 2929 0 R]
+/Limits [(Item.14) (Item.4)]
+>>
+endobj
+7166 0 obj
+<<
+/Names [(Item.5) 2930 0 R (Item.6) 2931 0 R (Item.7) 2932 0 R (Item.8) 2933 0 R (Item.9) 2934 0 R (_e_c_c_x08_8h_source) 3044 0 R]
+/Limits [(Item.5) (_e_c_c_x08_8h_source)]
+>>
+endobj
+7167 0 obj
+<<
+/Names [(chapter.1) 2 0 R (chapter.2) 30 0 R (chapter.3) 38 0 R (chapter.4) 46 0 R (chapter.5) 54 0 R (chapter.6) 422 0 R]
+/Limits [(chapter.1) (chapter.6)]
+>>
+endobj
+7168 0 obj
+<<
+/Names [(class_e_c_c_x08_class) 2978 0 R (class_e_c_c_x08_class_a037e2c1119bec4fc1a58c4b5d7e9953e) 3140 0 R (class_e_c_c_x08_class_a05c4f1c6aeef0c4b48c48d535a4f0be8) 3133 0 R (class_e_c_c_x08_class_a0af496f4f6283fb188a3ad6913b18989) 3141 0 R (class_e_c_c_x08_class_a10a159069677548893d7003029a5a96a) 3122 0 R (class_e_c_c_x08_class_a17a7d2be8131668fabe54fe5e91dc8a6) 3124 0 R]
+/Limits [(class_e_c_c_x08_class) (class_e_c_c_x08_class_a17a7d2be8131668fabe54fe5e91dc8a6)]
+>>
+endobj
+7169 0 obj
+<<
+/Names [(class_e_c_c_x08_class_a19836fa133e93c0f75be4764aace6c4b) 3147 0 R (class_e_c_c_x08_class_a3e34eb649f790b55bcd72d574908c9c0) 3126 0 R (class_e_c_c_x08_class_a48561c17d4d098ba92e6bc2a7fdeac6d) 3132 0 R (class_e_c_c_x08_class_a4a5f3108618fd2aa9b0f20fa8e7c36ca) 3139 0 R (class_e_c_c_x08_class_a50f9f1ab507e8b64d19184156309043e) 3135 0 R (class_e_c_c_x08_class_a5a1bf071f9ddd7e91f55276c01489c57) 3127 0 R]
+/Limits [(class_e_c_c_x08_class_a19836fa133e93c0f75be4764aace6c4b) (class_e_c_c_x08_class_a5a1bf071f9ddd7e91f55276c01489c57)]
+>>
+endobj
+7170 0 obj
+<<
+/Names [(class_e_c_c_x08_class_a650b127e87e9da84b682288a3fb4f21d) 3123 0 R (class_e_c_c_x08_class_a6af05022d5555a3b6704e54a3e6f14b9) 3143 0 R (class_e_c_c_x08_class_a786ff810c81adf5b9d0200ff26bed474) 3130 0 R (class_e_c_c_x08_class_a794f5e5f70ab2d599a81d180f9af684a) 3136 0 R (class_e_c_c_x08_class_a7b4bb823665ab21c1817edfb1e505b9c) 3129 0 R (class_e_c_c_x08_class_a819a648140ca87e5108494c653dfcead) 3119 0 R]
+/Limits [(class_e_c_c_x08_class_a650b127e87e9da84b682288a3fb4f21d) (class_e_c_c_x08_class_a819a648140ca87e5108494c653dfcead)]
+>>
+endobj
+7171 0 obj
+<<
+/Names [(class_e_c_c_x08_class_a9d0f88d07c2a9c887cfc24c65cf50712) 3146 0 R (class_e_c_c_x08_class_abe7124229ccb4c381e908072747a5ee4) 3145 0 R (class_e_c_c_x08_class_acaf73883865be9425b6be4462419d22d) 3131 0 R (class_e_c_c_x08_class_ad3e75dd17031b55ee3b5ef2e41ac5978) 3142 0 R (class_e_c_c_x08_class_ad68f553b5b45f3c213057dd9d944fbc9) 3128 0 R (class_e_c_c_x08_class_ae0f21d5ef6b5757b0983aa057f0addb8) 3125 0 R]
+/Limits [(class_e_c_c_x08_class_a9d0f88d07c2a9c887cfc24c65cf50712) (class_e_c_c_x08_class_ae0f21d5ef6b5757b0983aa057f0addb8)]
+>>
+endobj
+7172 0 obj
+<<
+/Names [(class_e_c_c_x08_class_ae6436397524e383de6b8ab365f49dd40) 3137 0 R (class_e_c_c_x08_class_ae9e3b022a6837e33a53287ac8c29c88a) 3120 0 R (class_e_c_c_x08_class_af08dc331e1b6fbb23c9a8d2bbf175c40) 3134 0 R (class_e_c_c_x08_class_af63d01958252c79cc8fde6ed540d6aac) 3138 0 R (class_e_c_c_x08_class_af883c46cb6ce19c9897519a4a7aa79cd) 3144 0 R (class_e_c_c_x08_class_afc346a4c26d1736f65e8257d33a1d7f6) 3121 0 R]
+/Limits [(class_e_c_c_x08_class_ae6436397524e383de6b8ab365f49dd40) (class_e_c_c_x08_class_afc346a4c26d1736f65e8257d33a1d7f6)]
+>>
+endobj
+7173 0 obj
+<<
+/Names [(class_socket) 2983 0 R (class_socket_a415267444fb4cee693a40677790c31b8) 3237 0 R (class_socket_a5166aafd8f2b57afa7b42657ac614c16) 3203 0 R (class_socket_a65e62a97055eb6af74a22157d5c235f0) 3236 0 R (class_socket_a889ea2afe1c918b4e012c1cb71fd25e5) 3204 0 R (class_socket_a9ab369e62d1719daf4828fe6ce3cfce2) 3205 0 R]
+/Limits [(class_socket) (class_socket_a9ab369e62d1719daf4828fe6ce3cfce2)]
+>>
+endobj
+7174 0 obj
+<<
+/Names [(class_socket_aadb9126e8400985f4db6846f0f83ed2c) 3207 0 R (class_socket_ad5cfcfe830c666c640eb515d93443691) 3206 0 R (etoc@tocid.1) 2308 0 R (md__r_e_a_d_m_e) 2879 0 R (md__r_e_a_d_m_e_autotoc_md1) 2880 0 R (md__r_e_a_d_m_e_autotoc_md2) 2882 0 R]
+/Limits [(class_socket_aadb9126e8400985f4db6846f0f83ed2c) (md__r_e_a_d_m_e_autotoc_md2)]
+>>
+endobj
+7175 0 obj
+<<
+/Names [(md__r_e_a_d_m_e_autotoc_md3) 2884 0 R (md__r_e_a_d_m_e_autotoc_md4) 2888 0 R (md__r_e_a_d_m_e_autotoc_md5) 2905 0 R (md__r_e_a_d_m_e_autotoc_md6) 2906 0 R (md_src_arduino__r_e_a_d_m_e) 2924 0 R (md_src_arduino__r_e_a_d_m_e_autotoc_md8) 2925 0 R]
+/Limits [(md__r_e_a_d_m_e_autotoc_md3) (md_src_arduino__r_e_a_d_m_e_autotoc_md8)]
+>>
+endobj
+7176 0 obj
+<<
+/Names [(page.1) 2877 0 R (page.10) 2990 0 R (page.100) 4926 0 R (page.101) 5021 0 R (page.102) 5039 0 R (page.103) 5056 0 R]
+/Limits [(page.1) (page.103)]
+>>
+endobj
+7177 0 obj
+<<
+/Names [(page.104) 5070 0 R (page.105) 5078 0 R (page.106) 5117 0 R (page.107) 5160 0 R (page.108) 5188 0 R (page.109) 5197 0 R]
+/Limits [(page.104) (page.109)]
+>>
+endobj
+7178 0 obj
+<<
+/Names [(page.11) 3029 0 R (page.110) 5207 0 R (page.111) 5217 0 R (page.112) 5229 0 R (page.113) 5257 0 R (page.114) 5287 0 R]
+/Limits [(page.11) (page.114)]
+>>
+endobj
+7179 0 obj
+<<
+/Names [(page.115) 5297 0 R (page.116) 5324 0 R (page.117) 5341 0 R (page.118) 5355 0 R (page.119) 5399 0 R (page.12) 3048 0 R]
+/Limits [(page.115) (page.12)]
+>>
+endobj
+7180 0 obj
+<<
+/Names [(page.120) 5456 0 R (page.121) 5477 0 R (page.122) 5483 0 R (page.123) 5489 0 R (page.124) 5497 0 R (page.125) 5512 0 R]
+/Limits [(page.120) (page.125)]
+>>
+endobj
+7181 0 obj
+<<
+/Names [(page.126) 5522 0 R (page.127) 5532 0 R (page.128) 5542 0 R (page.129) 5554 0 R (page.13) 3065 0 R (page.130) 5593 0 R]
+/Limits [(page.126) (page.130)]
+>>
+endobj
+7182 0 obj
+<<
+/Names [(page.131) 5641 0 R (page.132) 5657 0 R (page.133) 5672 0 R (page.134) 5681 0 R (page.135) 5693 0 R (page.136) 5712 0 R]
+/Limits [(page.131) (page.136)]
+>>
+endobj
+7183 0 obj
+<<
+/Names [(page.137) 5748 0 R (page.138) 5760 0 R (page.139) 5784 0 R (page.14) 3090 0 R (page.140) 5809 0 R (page.141) 5892 0 R]
+/Limits [(page.137) (page.141)]
+>>
+endobj
+7184 0 obj
+<<
+/Names [(page.142) 5927 0 R (page.143) 5933 0 R (page.144) 5938 0 R (page.145) 5950 0 R (page.146) 5961 0 R (page.147) 5974 0 R]
+/Limits [(page.142) (page.147)]
+>>
+endobj
+7185 0 obj
+<<
+/Names [(page.148) 5985 0 R (page.149) 5995 0 R (page.15) 3117 0 R (page.150) 6006 0 R (page.151) 6022 0 R (page.152) 6083 0 R]
+/Limits [(page.148) (page.152)]
+>>
+endobj
+7186 0 obj
+<<
+/Names [(page.153) 6105 0 R (page.154) 6111 0 R (page.155) 6164 0 R (page.156) 6234 0 R (page.157) 6295 0 R (page.158) 6358 0 R]
+/Limits [(page.153) (page.158)]
+>>
+endobj
+7187 0 obj
+<<
+/Names [(page.159) 6423 0 R (page.16) 3162 0 R (page.160) 6487 0 R (page.161) 6590 0 R (page.162) 6710 0 R (page.163) 6826 0 R]
+/Limits [(page.159) (page.163)]
+>>
+endobj
+7188 0 obj
+<<
+/Names [(page.164) 6915 0 R (page.165) 7034 0 R (page.166) 7100 0 R (page.167) 7110 0 R (page.17) 3170 0 R (page.18) 3184 0 R]
+/Limits [(page.164) (page.18)]
+>>
+endobj
+7189 0 obj
+<<
+/Names [(page.19) 3198 0 R (page.2) 2893 0 R (page.20) 3234 0 R (page.21) 3265 0 R (page.22) 3290 0 R (page.23) 3324 0 R]
+/Limits [(page.19) (page.23)]
+>>
+endobj
+7190 0 obj
+<<
+/Names [(page.24) 3365 0 R (page.25) 3377 0 R (page.26) 3388 0 R (page.27) 3397 0 R (page.28) 3406 0 R (page.29) 3432 0 R]
+/Limits [(page.24) (page.29)]
+>>
+endobj
+7191 0 obj
+<<
+/Names [(page.3) 2898 0 R (page.30) 3506 0 R (page.31) 3613 0 R (page.32) 3727 0 R (page.33) 3799 0 R (page.34) 3820 0 R]
+/Limits [(page.3) (page.34)]
+>>
+endobj
+7192 0 obj
+<<
+/Names [(page.35) 3827 0 R (page.36) 3831 0 R (page.37) 3835 0 R (page.38) 3839 0 R (page.39) 3847 0 R (page.4) 2904 0 R]
+/Limits [(page.35) (page.4)]
+>>
+endobj
+7193 0 obj
+<<
+/Names [(page.40) 3854 0 R (page.41) 3858 0 R (page.42) 3862 0 R (page.43) 3866 0 R (page.44) 3870 0 R (page.45) 3874 0 R]
+/Limits [(page.40) (page.45)]
+>>
+endobj
+7194 0 obj
+<<
+/Names [(page.46) 3879 0 R (page.47) 3883 0 R (page.48) 3887 0 R (page.49) 3891 0 R (page.5) 2911 0 R (page.50) 3895 0 R]
+/Limits [(page.46) (page.50)]
+>>
+endobj
+7195 0 obj
+<<
+/Names [(page.51) 3899 0 R (page.52) 3904 0 R (page.53) 3908 0 R (page.54) 3912 0 R (page.55) 3916 0 R (page.56) 3920 0 R]
+/Limits [(page.51) (page.56)]
+>>
+endobj
+7196 0 obj
+<<
+/Names [(page.57) 3932 0 R (page.58) 3946 0 R (page.59) 3951 0 R (page.6) 2915 0 R (page.60) 3955 0 R (page.61) 3967 0 R]
+/Limits [(page.57) (page.61)]
+>>
+endobj
+7197 0 obj
+<<
+/Names [(page.62) 4046 0 R (page.63) 4054 0 R (page.64) 4068 0 R (page.65) 4086 0 R (page.66) 4109 0 R (page.67) 4120 0 R]
+/Limits [(page.62) (page.67)]
+>>
+endobj
+7198 0 obj
+<<
+/Names [(page.68) 4144 0 R (page.69) 4207 0 R (page.7) 2923 0 R (page.70) 4234 0 R (page.71) 4244 0 R (page.72) 4257 0 R]
+/Limits [(page.68) (page.72)]
+>>
+endobj
+7199 0 obj
+<<
+/Names [(page.73) 4269 0 R (page.74) 4284 0 R (page.75) 4298 0 R (page.76) 4311 0 R (page.77) 4392 0 R (page.78) 4455 0 R]
+/Limits [(page.73) (page.78)]
+>>
+endobj
+7200 0 obj
+<<
+/Names [(page.79) 4497 0 R (page.8) 2940 0 R (page.80) 4511 0 R (page.81) 4521 0 R (page.82) 4534 0 R (page.83) 4544 0 R]
+/Limits [(page.79) (page.83)]
+>>
+endobj
+7201 0 obj
+<<
+/Names [(page.84) 4557 0 R (page.85) 4569 0 R (page.86) 4582 0 R (page.87) 4592 0 R (page.88) 4605 0 R (page.89) 4612 0 R]
+/Limits [(page.84) (page.89)]
+>>
+endobj
+7202 0 obj
+<<
+/Names [(page.9) 2975 0 R (page.90) 4658 0 R (page.91) 4727 0 R (page.92) 4791 0 R (page.93) 4815 0 R (page.94) 4830 0 R]
+/Limits [(page.9) (page.94)]
+>>
+endobj
+7203 0 obj
+<<
+/Names [(page.95) 4843 0 R (page.96) 4855 0 R (page.97) 4875 0 R (page.98) 4887 0 R (page.99) 4903 0 R (section*.1) 3066 0 R]
+/Limits [(page.95) (section*.1)]
+>>
+endobj
+7204 0 obj
+<<
+/Names [(section*.10) 3325 0 R (section*.11) 3398 0 R (section*.12) 3433 0 R (section*.13) 3434 0 R (section*.14) 3800 0 R (section*.15) 4055 0 R]
+/Limits [(section*.10) (section*.15)]
+>>
+endobj
+7205 0 obj
+<<
+/Names [(section*.16) 4056 0 R (section*.17) 4087 0 R (section*.18) 4121 0 R (section*.19) 4122 0 R (section*.2) 3118 0 R (section*.20) 4208 0 R]
+/Limits [(section*.16) (section*.20)]
+>>
+endobj
+7206 0 obj
+<<
+/Names [(section*.21) 4456 0 R (section*.22) 4728 0 R (section*.23) 5022 0 R (section*.24) 5161 0 R (section*.25) 5162 0 R (section*.26) 5288 0 R]
+/Limits [(section*.21) (section*.26)]
+>>
+endobj
+7207 0 obj
+<<
+/Names [(section*.27) 5325 0 R (section*.28) 5400 0 R (section*.29) 5642 0 R (section*.3) 3148 0 R (section*.30) 5643 0 R (section*.31) 5749 0 R]
+/Limits [(section*.27) (section*.31)]
+>>
+endobj
+7208 0 obj
+<<
+/Names [(section*.32) 5810 0 R (section*.33) 5811 0 R (section*.34) 5893 0 R (section*.35) 5894 0 R (section*.36) 2250 0 R (section*.4) 3171 0 R]
+/Limits [(section*.32) (section*.4)]
+>>
+endobj
+7209 0 obj
+<<
+/Names [(section*.5) 3185 0 R (section*.6) 3199 0 R (section*.7) 3202 0 R (section*.8) 3235 0 R (section*.9) 3238 0 R (section.1.1) 6 0 R]
+/Limits [(section*.5) (section.1.1)]
+>>
+endobj
+7210 0 obj
+<<
+/Names [(section.1.2) 18 0 R (section.2.1) 34 0 R (section.3.1) 42 0 R (section.4.1) 50 0 R (section.5.1) 58 0 R (section.5.10) 402 0 R]
+/Limits [(section.1.2) (section.5.10)]
+>>
+endobj
+7211 0 obj
+<<
+/Names [(section.5.2) 102 0 R (section.5.3) 106 0 R (section.5.4) 134 0 R (section.5.5) 158 0 R (section.5.6) 182 0 R (section.5.7) 202 0 R]
+/Limits [(section.5.2) (section.5.7)]
+>>
+endobj
+7212 0 obj
+<<
+/Names [(section.5.8) 210 0 R (section.5.9) 278 0 R (section.6.1) 426 0 R (section.6.10) 1382 0 R (section.6.11) 1386 0 R (section.6.12) 1518 0 R]
+/Limits [(section.5.8) (section.6.12)]
+>>
+endobj
+7213 0 obj
+<<
+/Names [(section.6.13) 1522 0 R (section.6.14) 1626 0 R (section.6.15) 1630 0 R (section.6.16) 1690 0 R (section.6.17) 1694 0 R (section.6.18) 1774 0 R]
+/Limits [(section.6.13) (section.6.18)]
+>>
+endobj
+7214 0 obj
+<<
+/Names [(section.6.19) 1778 0 R (section.6.2) 1202 0 R (section.6.20) 1798 0 R (section.6.21) 1802 0 R (section.6.22) 1842 0 R (section.6.23) 1846 0 R]
+/Limits [(section.6.19) (section.6.23)]
+>>
+endobj
+7215 0 obj
+<<
+/Names [(section.6.24) 1962 0 R (section.6.25) 1966 0 R (section.6.26) 2014 0 R (section.6.27) 2018 0 R (section.6.28) 2046 0 R (section.6.29) 2050 0 R]
+/Limits [(section.6.24) (section.6.29)]
+>>
+endobj
+7216 0 obj
+<<
+/Names [(section.6.3) 1206 0 R (section.6.30) 2058 0 R (section.6.31) 2062 0 R (section.6.32) 2242 0 R (section.6.33) 2246 0 R (section.6.4) 1238 0 R]
+/Limits [(section.6.3) (section.6.4)]
+>>
+endobj
+7217 0 obj
+<<
+/Names [(section.6.5) 1242 0 R (section.6.6) 1262 0 R (section.6.7) 1266 0 R (section.6.8) 1298 0 R (section.6.9) 1302 0 R (struct_t_l_s__session) 2985 0 R]
+/Limits [(section.6.5) (struct_t_l_s__session)]
+>>
+endobj
+7218 0 obj
+<<
+/Names [(struct_t_l_s__session_a024f4141e00823f6d0c8367405d25793) 3334 0 R (struct_t_l_s__session_a04ec050580401dd1d386e329e43b4e58) 3327 0 R (struct_t_l_s__session_a128fa451adfee0d939300fd130cbe185) 3354 0 R (struct_t_l_s__session_a12b8b2922dd9e37546592a618c721f41) 3348 0 R (struct_t_l_s__session_a14f1ce0291842ad4763979c27e985f6b) 3343 0 R (struct_t_l_s__session_a17bfd7bac99455c6aec56288bb406268) 3335 0 R]
+/Limits [(struct_t_l_s__session_a024f4141e00823f6d0c8367405d25793) (struct_t_l_s__session_a17bfd7bac99455c6aec56288bb406268)]
+>>
+endobj
+7219 0 obj
+<<
+/Names [(struct_t_l_s__session_a1add0b39f1e49f34b3eb4164f3b3b759) 3333 0 R (struct_t_l_s__session_a1f1da4c8ae7fb1055a0e2a2e2f212725) 3332 0 R (struct_t_l_s__session_a2340601e94fb9dba59416570fe21a715) 3339 0 R (struct_t_l_s__session_a25f8656ac2eb46c98015a8251a01011c) 3330 0 R (struct_t_l_s__session_a358daf4ad97c5933268851250fb90083) 3337 0 R (struct_t_l_s__session_a3762b005bae063072f8bfe78711592ce) 3341 0 R]
+/Limits [(struct_t_l_s__session_a1add0b39f1e49f34b3eb4164f3b3b759) (struct_t_l_s__session_a3762b005bae063072f8bfe78711592ce)]
+>>
+endobj
+7220 0 obj
+<<
+/Names [(struct_t_l_s__session_a4635560f5d28a4e470e9d9daf00d0721) 3338 0 R (struct_t_l_s__session_a4ee4f5c25f51c1c87ff63b5d3cf93a1c) 3352 0 R (struct_t_l_s__session_a5005b3b16963dc348f94c3f81c1f5e13) 3329 0 R (struct_t_l_s__session_a64578d777eacea6f53eef13676039ed8) 3340 0 R (struct_t_l_s__session_a785098bf569661d0f5103f5f0f01eb93) 3326 0 R (struct_t_l_s__session_a78c0bddb1e9a270a14a217659b3eaad5) 3346 0 R]
+/Limits [(struct_t_l_s__session_a4635560f5d28a4e470e9d9daf00d0721) (struct_t_l_s__session_a78c0bddb1e9a270a14a217659b3eaad5)]
+>>
+endobj
+7221 0 obj
+<<
+/Names [(struct_t_l_s__session_a801b2cd7e838f621976301da6c72b0df) 3328 0 R (struct_t_l_s__session_aa94c2e7b78ab19e9098e81c554f90b8a) 3356 0 R (struct_t_l_s__session_aaf5941fece001e3797b6dd399ae51292) 3349 0 R (struct_t_l_s__session_ab0aff1dadec8c32fd7544e5c47d8d050) 3355 0 R (struct_t_l_s__session_ab64e16663d54fbba6a28cfbae608f8b6) 3345 0 R (struct_t_l_s__session_ab7b62f1fc800cd7bbe0eb13599045e92) 3350 0 R]
+/Limits [(struct_t_l_s__session_a801b2cd7e838f621976301da6c72b0df) (struct_t_l_s__session_ab7b62f1fc800cd7bbe0eb13599045e92)]
+>>
+endobj
+7222 0 obj
+<<
+/Names [(struct_t_l_s__session_ab8376d0fb045c5dc1a3306a4d149f337) 3344 0 R (struct_t_l_s__session_addd71624b9f19d693eab2ab6743c9c9c) 3347 0 R (struct_t_l_s__session_ae59f0c1cfe873359679fafac2154c447) 3342 0 R (struct_t_l_s__session_af0c486630787d7b0519b8613674558d0) 3336 0 R (structcrypto) 2977 0 R (structcrypto_a0bc6e38c10da4705f3a21596e66b6ceb) 3075 0 R]
+/Limits [(struct_t_l_s__session_ab8376d0fb045c5dc1a3306a4d149f337) (structcrypto_a0bc6e38c10da4705f3a21596e66b6ceb)]
+>>
+endobj
+7223 0 obj
+<<
+/Names [(structcrypto_a1f0f21608efdefa091958c6abe36bf1b) 3071 0 R (structcrypto_a3189c7dd2fe6c3cbc1ffd41720977175) 3072 0 R (structcrypto_a6da27ddf35821286af88c12267678a37) 3067 0 R (structcrypto_a6f2d937a4ddb574df6aebadd72af0102) 3076 0 R (structcrypto_a835f82f1bfdf28071da4f1ca521c532c) 3068 0 R (structcrypto_aabf86e64107fd26ecb2862fc6bb7ad00) 3074 0 R]
+/Limits [(structcrypto_a1f0f21608efdefa091958c6abe36bf1b) (structcrypto_aabf86e64107fd26ecb2862fc6bb7ad00)]
+>>
+endobj
+7224 0 obj
+<<
+/Names [(structcrypto_aee54e28a2fe73a7f1bafd7c946430a22) 3070 0 R (structee__status) 2979 0 R (structee__status_abbd2cf161b15371a36fbe760588b2b2b) 3154 0 R (structee__status_abddddbbc0d2fe27635c66bbadde390b9) 3152 0 R (structee__status_af4d9d88c2dda22baed16d27b7c4b42fb) 3153 0 R (structee__status_af739e2a3db47b5289fc682ede5f6ab7b) 3151 0 R]
+/Limits [(structcrypto_aee54e28a2fe73a7f1bafd7c946430a22) (structee__status_af739e2a3db47b5289fc682ede5f6ab7b)]
+>>
+endobj
+7225 0 obj
+<<
+/Names [(structoctad) 2980 0 R (structoctad_a43389422956a84b8bafbd9e710d35053) 3172 0 R (structoctad_aac9fd4aac8548b45f1d8653a4e194366) 3173 0 R (structoctad_af7369ba76f648fb2c39e081239874371) 3174 0 R (structpktype) 2981 0 R (structpktype_a81908ce09cfe1c183b5c1d44708ab9a2) 3187 0 R]
+/Limits [(structoctad) (structpktype_a81908ce09cfe1c183b5c1d44708ab9a2)]
+>>
+endobj
+7226 0 obj
+<<
+/Names [(structpktype_aa8fa37d88b74366bd16a3f46d1a36293) 3188 0 R (structpktype_ae3d2dbf17869cb218ea7f4ea10ccbc03) 3186 0 R (structret) 2982 0 R (structret_a4e027b19a827d55f0d0e38c50515f752) 3200 0 R (structret_a5f2cd96fef0fd36bdd38cd72f85981f9) 3201 0 R (structticket) 2984 0 R]
+/Limits [(structpktype_aa8fa37d88b74366bd16a3f46d1a36293) (structticket)]
+>>
+endobj
+7227 0 obj
+<<
+/Names [(structticket_a0afa2495687dbd787aa04b82ef8de7cb) 3250 0 R (structticket_a0f21883e83fa71ca8bcf0099c44be3fb) 3245 0 R (structticket_a52c459e527403a39f4a189ac6a380e5e) 3249 0 R (structticket_a5a8f9c9d4a534c06f733a2cc1bfe0253) 3243 0 R (structticket_a6e3531a00554984c2e3d14aa2997609c) 3253 0 R (structticket_a7c66b0d388e88a0671aa70088e1d4e1f) 3246 0 R]
+/Limits [(structticket_a0afa2495687dbd787aa04b82ef8de7cb) (structticket_a7c66b0d388e88a0671aa70088e1d4e1f)]
+>>
+endobj
+7228 0 obj
+<<
+/Names [(structticket_a869300f7efe0bba46232714f0613b550) 3239 0 R (structticket_a8f26e9c77f54bc5cf1329b4a7fdb276d) 3252 0 R (structticket_a91cbb645c8d90f0a4846e29764772335) 3251 0 R (structticket_aaa058ee224e94dfda2ad19d2a8e2bc30) 3242 0 R (structticket_ab49a7b1bd72975477eaaa8c5cf1fdbb1) 3248 0 R (structticket_ae600b67c9b83f30822d2d722e69110d6) 3240 0 R]
+/Limits [(structticket_a869300f7efe0bba46232714f0613b550) (structticket_ae600b67c9b83f30822d2d722e69110d6)]
+>>
+endobj
+7229 0 obj
+<<
+/Names [(structticket_aefff163e6e665c6affa39084c0e298f3) 3254 0 R (structticket_af5feccff050166d2869c1f77e0bd9e37) 3247 0 R (structunihash) 2986 0 R (structunihash_a3187081af2ca6caf003ce75d3c53d30a) 3400 0 R (structunihash_aabe87d5ccd83b6b85f3078ba01911d64) 3399 0 R (subsection.1.1.1) 10 0 R]
+/Limits [(structticket_aefff163e6e665c6affa39084c0e298f3) (subsection.1.1.1)]
+>>
+endobj
+7230 0 obj
+<<
+/Names [(subsection.1.1.2) 14 0 R (subsection.1.2.1) 22 0 R (subsection.1.2.2) 26 0 R (subsection.5.1.1) 62 0 R (subsection.5.1.2) 66 0 R (subsection.5.10.1) 406 0 R]
+/Limits [(subsection.1.1.2) (subsection.5.10.1)]
+>>
+endobj
+7231 0 obj
+<<
+/Names [(subsection.5.10.2) 410 0 R (subsection.5.3.1) 110 0 R (subsection.5.3.2) 114 0 R (subsection.5.4.1) 138 0 R (subsection.5.4.2) 142 0 R (subsection.5.5.1) 162 0 R]
+/Limits [(subsection.5.10.2) (subsection.5.5.1)]
+>>
+endobj
+7232 0 obj
+<<
+/Names [(subsection.5.5.2) 166 0 R (subsection.5.6.1) 186 0 R (subsection.5.6.2) 190 0 R (subsection.5.7.1) 206 0 R (subsection.5.8.1) 214 0 R (subsection.5.8.2) 218 0 R]
+/Limits [(subsection.5.5.2) (subsection.5.8.2)]
+>>
+endobj
+7233 0 obj
+<<
+/Names [(subsection.5.9.1) 282 0 R (subsection.5.9.2) 286 0 R (subsection.6.1.1) 430 0 R (subsection.6.1.2) 434 0 R (subsection.6.1.3) 1170 0 R (subsection.6.11.1) 1390 0 R]
+/Limits [(subsection.5.9.1) (subsection.6.11.1)]
+>>
+endobj
+7234 0 obj
+<<
+/Names [(subsection.6.11.2) 1394 0 R (subsection.6.13.1) 1526 0 R (subsection.6.13.2) 1530 0 R (subsection.6.15.1) 1634 0 R (subsection.6.15.2) 1638 0 R (subsection.6.17.1) 1698 0 R]
+/Limits [(subsection.6.11.2) (subsection.6.17.1)]
+>>
+endobj
+7235 0 obj
+<<
+/Names [(subsection.6.17.2) 1702 0 R (subsection.6.19.1) 1782 0 R (subsection.6.19.2) 1786 0 R (subsection.6.21.1) 1806 0 R (subsection.6.21.2) 1810 0 R (subsection.6.23.1) 1850 0 R]
+/Limits [(subsection.6.17.2) (subsection.6.23.1)]
+>>
+endobj
+7236 0 obj
+<<
+/Names [(subsection.6.23.2) 1854 0 R (subsection.6.25.1) 1970 0 R (subsection.6.25.2) 1974 0 R (subsection.6.27.1) 2022 0 R (subsection.6.27.2) 2026 0 R (subsection.6.29.1) 2054 0 R]
+/Limits [(subsection.6.23.2) (subsection.6.29.1)]
+>>
+endobj
+7237 0 obj
+<<
+/Names [(subsection.6.3.1) 1210 0 R (subsection.6.3.2) 1214 0 R (subsection.6.3.3) 1226 0 R (subsection.6.31.1) 2066 0 R (subsection.6.31.2) 2070 0 R (subsection.6.31.3) 2122 0 R]
+/Limits [(subsection.6.3.1) (subsection.6.31.3)]
+>>
+endobj
+7238 0 obj
+<<
+/Names [(subsection.6.31.4) 2198 0 R (subsection.6.5.1) 1246 0 R (subsection.6.5.2) 1250 0 R (subsection.6.7.1) 1270 0 R (subsection.6.7.2) 1274 0 R (subsection.6.7.3) 1282 0 R]
+/Limits [(subsection.6.31.4) (subsection.6.7.3)]
+>>
+endobj
+7239 0 obj
+<<
+/Names [(subsection.6.9.1) 1306 0 R (subsection.6.9.2) 1310 0 R (subsubsection.5.1.2.1) 70 0 R (subsubsection.5.1.2.2) 74 0 R (subsubsection.5.1.2.3) 78 0 R (subsubsection.5.1.2.4) 82 0 R]
+/Limits [(subsection.6.9.1) (subsubsection.5.1.2.4)]
+>>
+endobj
+7240 0 obj
+<<
+/Names [(subsubsection.5.1.2.5) 86 0 R (subsubsection.5.1.2.6) 90 0 R (subsubsection.5.1.2.7) 94 0 R (subsubsection.5.1.2.8) 98 0 R (subsubsection.5.10.2.1) 414 0 R (subsubsection.5.10.2.2) 418 0 R]
+/Limits [(subsubsection.5.1.2.5) (subsubsection.5.10.2.2)]
+>>
+endobj
+7241 0 obj
+<<
+/Names [(subsubsection.5.3.2.1) 118 0 R (subsubsection.5.3.2.2) 122 0 R (subsubsection.5.3.2.3) 126 0 R (subsubsection.5.3.2.4) 130 0 R (subsubsection.5.4.2.1) 146 0 R (subsubsection.5.4.2.2) 150 0 R]
+/Limits [(subsubsection.5.3.2.1) (subsubsection.5.4.2.2)]
+>>
+endobj
+7242 0 obj
+<<
+/Names [(subsubsection.5.4.2.3) 154 0 R (subsubsection.5.5.2.1) 170 0 R (subsubsection.5.5.2.2) 174 0 R (subsubsection.5.5.2.3) 178 0 R (subsubsection.5.6.2.1) 194 0 R (subsubsection.5.6.2.2) 198 0 R]
+/Limits [(subsubsection.5.4.2.3) (subsubsection.5.6.2.2)]
+>>
+endobj
+7243 0 obj
+<<
+/Names [(subsubsection.5.8.2.1) 222 0 R (subsubsection.5.8.2.10) 258 0 R (subsubsection.5.8.2.11) 262 0 R (subsubsection.5.8.2.12) 266 0 R (subsubsection.5.8.2.13) 270 0 R (subsubsection.5.8.2.14) 274 0 R]
+/Limits [(subsubsection.5.8.2.1) (subsubsection.5.8.2.14)]
+>>
+endobj
+7244 0 obj
+<<
+/Names [(subsubsection.5.8.2.2) 226 0 R (subsubsection.5.8.2.3) 230 0 R (subsubsection.5.8.2.4) 234 0 R (subsubsection.5.8.2.5) 238 0 R (subsubsection.5.8.2.6) 242 0 R (subsubsection.5.8.2.7) 246 0 R]
+/Limits [(subsubsection.5.8.2.2) (subsubsection.5.8.2.7)]
+>>
+endobj
+7245 0 obj
+<<
+/Names [(subsubsection.5.8.2.8) 250 0 R (subsubsection.5.8.2.9) 254 0 R (subsubsection.5.9.2.1) 290 0 R (subsubsection.5.9.2.10) 326 0 R (subsubsection.5.9.2.11) 330 0 R (subsubsection.5.9.2.12) 334 0 R]
+/Limits [(subsubsection.5.8.2.8) (subsubsection.5.9.2.12)]
+>>
+endobj
+7246 0 obj
+<<
+/Names [(subsubsection.5.9.2.13) 338 0 R (subsubsection.5.9.2.14) 342 0 R (subsubsection.5.9.2.15) 346 0 R (subsubsection.5.9.2.16) 350 0 R (subsubsection.5.9.2.17) 354 0 R (subsubsection.5.9.2.18) 358 0 R]
+/Limits [(subsubsection.5.9.2.13) (subsubsection.5.9.2.18)]
+>>
+endobj
+7247 0 obj
+<<
+/Names [(subsubsection.5.9.2.19) 362 0 R (subsubsection.5.9.2.2) 294 0 R (subsubsection.5.9.2.20) 366 0 R (subsubsection.5.9.2.21) 370 0 R (subsubsection.5.9.2.22) 374 0 R (subsubsection.5.9.2.23) 378 0 R]
+/Limits [(subsubsection.5.9.2.19) (subsubsection.5.9.2.23)]
+>>
+endobj
+7248 0 obj
+<<
+/Names [(subsubsection.5.9.2.24) 382 0 R (subsubsection.5.9.2.25) 386 0 R (subsubsection.5.9.2.26) 390 0 R (subsubsection.5.9.2.27) 394 0 R (subsubsection.5.9.2.28) 398 0 R (subsubsection.5.9.2.3) 298 0 R]
+/Limits [(subsubsection.5.9.2.24) (subsubsection.5.9.2.3)]
+>>
+endobj
+7249 0 obj
+<<
+/Names [(subsubsection.5.9.2.4) 302 0 R (subsubsection.5.9.2.5) 306 0 R (subsubsection.5.9.2.6) 310 0 R (subsubsection.5.9.2.7) 314 0 R (subsubsection.5.9.2.8) 318 0 R (subsubsection.5.9.2.9) 322 0 R]
+/Limits [(subsubsection.5.9.2.4) (subsubsection.5.9.2.9)]
+>>
+endobj
+7250 0 obj
+<<
+/Names [(subsubsection.6.1.2.1) 438 0 R (subsubsection.6.1.2.10) 474 0 R (subsubsection.6.1.2.100) 834 0 R (subsubsection.6.1.2.101) 838 0 R (subsubsection.6.1.2.102) 842 0 R (subsubsection.6.1.2.103) 846 0 R]
+/Limits [(subsubsection.6.1.2.1) (subsubsection.6.1.2.103)]
+>>
+endobj
+7251 0 obj
+<<
+/Names [(subsubsection.6.1.2.104) 850 0 R (subsubsection.6.1.2.105) 854 0 R (subsubsection.6.1.2.106) 858 0 R (subsubsection.6.1.2.107) 862 0 R (subsubsection.6.1.2.108) 866 0 R (subsubsection.6.1.2.109) 870 0 R]
+/Limits [(subsubsection.6.1.2.104) (subsubsection.6.1.2.109)]
+>>
+endobj
+7252 0 obj
+<<
+/Names [(subsubsection.6.1.2.11) 478 0 R (subsubsection.6.1.2.110) 874 0 R (subsubsection.6.1.2.111) 878 0 R (subsubsection.6.1.2.112) 882 0 R (subsubsection.6.1.2.113) 886 0 R (subsubsection.6.1.2.114) 890 0 R]
+/Limits [(subsubsection.6.1.2.11) (subsubsection.6.1.2.114)]
+>>
+endobj
+7253 0 obj
+<<
+/Names [(subsubsection.6.1.2.115) 894 0 R (subsubsection.6.1.2.116) 898 0 R (subsubsection.6.1.2.117) 902 0 R (subsubsection.6.1.2.118) 906 0 R (subsubsection.6.1.2.119) 910 0 R (subsubsection.6.1.2.12) 482 0 R]
+/Limits [(subsubsection.6.1.2.115) (subsubsection.6.1.2.12)]
+>>
+endobj
+7254 0 obj
+<<
+/Names [(subsubsection.6.1.2.120) 914 0 R (subsubsection.6.1.2.121) 918 0 R (subsubsection.6.1.2.122) 922 0 R (subsubsection.6.1.2.123) 926 0 R (subsubsection.6.1.2.124) 930 0 R (subsubsection.6.1.2.125) 934 0 R]
+/Limits [(subsubsection.6.1.2.120) (subsubsection.6.1.2.125)]
+>>
+endobj
+7255 0 obj
+<<
+/Names [(subsubsection.6.1.2.126) 938 0 R (subsubsection.6.1.2.127) 942 0 R (subsubsection.6.1.2.128) 946 0 R (subsubsection.6.1.2.129) 950 0 R (subsubsection.6.1.2.13) 486 0 R (subsubsection.6.1.2.130) 954 0 R]
+/Limits [(subsubsection.6.1.2.126) (subsubsection.6.1.2.130)]
+>>
+endobj
+7256 0 obj
+<<
+/Names [(subsubsection.6.1.2.131) 958 0 R (subsubsection.6.1.2.132) 962 0 R (subsubsection.6.1.2.133) 966 0 R (subsubsection.6.1.2.134) 970 0 R (subsubsection.6.1.2.135) 974 0 R (subsubsection.6.1.2.136) 978 0 R]
+/Limits [(subsubsection.6.1.2.131) (subsubsection.6.1.2.136)]
+>>
+endobj
+7257 0 obj
+<<
+/Names [(subsubsection.6.1.2.137) 982 0 R (subsubsection.6.1.2.138) 986 0 R (subsubsection.6.1.2.139) 990 0 R (subsubsection.6.1.2.14) 490 0 R (subsubsection.6.1.2.140) 994 0 R (subsubsection.6.1.2.141) 998 0 R]
+/Limits [(subsubsection.6.1.2.137) (subsubsection.6.1.2.141)]
+>>
+endobj
+7258 0 obj
+<<
+/Names [(subsubsection.6.1.2.142) 1002 0 R (subsubsection.6.1.2.143) 1006 0 R (subsubsection.6.1.2.144) 1010 0 R (subsubsection.6.1.2.145) 1014 0 R (subsubsection.6.1.2.146) 1018 0 R (subsubsection.6.1.2.147) 1022 0 R]
+/Limits [(subsubsection.6.1.2.142) (subsubsection.6.1.2.147)]
+>>
+endobj
+7259 0 obj
+<<
+/Names [(subsubsection.6.1.2.148) 1026 0 R (subsubsection.6.1.2.149) 1030 0 R (subsubsection.6.1.2.15) 494 0 R (subsubsection.6.1.2.150) 1034 0 R (subsubsection.6.1.2.151) 1038 0 R (subsubsection.6.1.2.152) 1042 0 R]
+/Limits [(subsubsection.6.1.2.148) (subsubsection.6.1.2.152)]
+>>
+endobj
+7260 0 obj
+<<
+/Names [(subsubsection.6.1.2.153) 1046 0 R (subsubsection.6.1.2.154) 1050 0 R (subsubsection.6.1.2.155) 1054 0 R (subsubsection.6.1.2.156) 1058 0 R (subsubsection.6.1.2.157) 1062 0 R (subsubsection.6.1.2.158) 1066 0 R]
+/Limits [(subsubsection.6.1.2.153) (subsubsection.6.1.2.158)]
+>>
+endobj
+7261 0 obj
+<<
+/Names [(subsubsection.6.1.2.159) 1070 0 R (subsubsection.6.1.2.16) 498 0 R (subsubsection.6.1.2.160) 1074 0 R (subsubsection.6.1.2.161) 1078 0 R (subsubsection.6.1.2.162) 1082 0 R (subsubsection.6.1.2.163) 1086 0 R]
+/Limits [(subsubsection.6.1.2.159) (subsubsection.6.1.2.163)]
+>>
+endobj
+7262 0 obj
+<<
+/Names [(subsubsection.6.1.2.164) 1090 0 R (subsubsection.6.1.2.165) 1094 0 R (subsubsection.6.1.2.166) 1098 0 R (subsubsection.6.1.2.167) 1102 0 R (subsubsection.6.1.2.168) 1106 0 R (subsubsection.6.1.2.169) 1110 0 R]
+/Limits [(subsubsection.6.1.2.164) (subsubsection.6.1.2.169)]
+>>
+endobj
+7263 0 obj
+<<
+/Names [(subsubsection.6.1.2.17) 502 0 R (subsubsection.6.1.2.170) 1114 0 R (subsubsection.6.1.2.171) 1118 0 R (subsubsection.6.1.2.172) 1122 0 R (subsubsection.6.1.2.173) 1126 0 R (subsubsection.6.1.2.174) 1130 0 R]
+/Limits [(subsubsection.6.1.2.17) (subsubsection.6.1.2.174)]
+>>
+endobj
+7264 0 obj
+<<
+/Names [(subsubsection.6.1.2.175) 1134 0 R (subsubsection.6.1.2.176) 1138 0 R (subsubsection.6.1.2.177) 1142 0 R (subsubsection.6.1.2.178) 1146 0 R (subsubsection.6.1.2.179) 1150 0 R (subsubsection.6.1.2.18) 506 0 R]
+/Limits [(subsubsection.6.1.2.175) (subsubsection.6.1.2.18)]
+>>
+endobj
+7265 0 obj
+<<
+/Names [(subsubsection.6.1.2.180) 1154 0 R (subsubsection.6.1.2.181) 1158 0 R (subsubsection.6.1.2.182) 1162 0 R (subsubsection.6.1.2.183) 1166 0 R (subsubsection.6.1.2.19) 510 0 R (subsubsection.6.1.2.2) 442 0 R]
+/Limits [(subsubsection.6.1.2.180) (subsubsection.6.1.2.2)]
+>>
+endobj
+7266 0 obj
+<<
+/Names [(subsubsection.6.1.2.20) 514 0 R (subsubsection.6.1.2.21) 518 0 R (subsubsection.6.1.2.22) 522 0 R (subsubsection.6.1.2.23) 526 0 R (subsubsection.6.1.2.24) 530 0 R (subsubsection.6.1.2.25) 534 0 R]
+/Limits [(subsubsection.6.1.2.20) (subsubsection.6.1.2.25)]
+>>
+endobj
+7267 0 obj
+<<
+/Names [(subsubsection.6.1.2.26) 538 0 R (subsubsection.6.1.2.27) 542 0 R (subsubsection.6.1.2.28) 546 0 R (subsubsection.6.1.2.29) 550 0 R (subsubsection.6.1.2.3) 446 0 R (subsubsection.6.1.2.30) 554 0 R]
+/Limits [(subsubsection.6.1.2.26) (subsubsection.6.1.2.30)]
+>>
+endobj
+7268 0 obj
+<<
+/Names [(subsubsection.6.1.2.31) 558 0 R (subsubsection.6.1.2.32) 562 0 R (subsubsection.6.1.2.33) 566 0 R (subsubsection.6.1.2.34) 570 0 R (subsubsection.6.1.2.35) 574 0 R (subsubsection.6.1.2.36) 578 0 R]
+/Limits [(subsubsection.6.1.2.31) (subsubsection.6.1.2.36)]
+>>
+endobj
+7269 0 obj
+<<
+/Names [(subsubsection.6.1.2.37) 582 0 R (subsubsection.6.1.2.38) 586 0 R (subsubsection.6.1.2.39) 590 0 R (subsubsection.6.1.2.4) 450 0 R (subsubsection.6.1.2.40) 594 0 R (subsubsection.6.1.2.41) 598 0 R]
+/Limits [(subsubsection.6.1.2.37) (subsubsection.6.1.2.41)]
+>>
+endobj
+7270 0 obj
+<<
+/Names [(subsubsection.6.1.2.42) 602 0 R (subsubsection.6.1.2.43) 606 0 R (subsubsection.6.1.2.44) 610 0 R (subsubsection.6.1.2.45) 614 0 R (subsubsection.6.1.2.46) 618 0 R (subsubsection.6.1.2.47) 622 0 R]
+/Limits [(subsubsection.6.1.2.42) (subsubsection.6.1.2.47)]
+>>
+endobj
+7271 0 obj
+<<
+/Names [(subsubsection.6.1.2.48) 626 0 R (subsubsection.6.1.2.49) 630 0 R (subsubsection.6.1.2.5) 454 0 R (subsubsection.6.1.2.50) 634 0 R (subsubsection.6.1.2.51) 638 0 R (subsubsection.6.1.2.52) 642 0 R]
+/Limits [(subsubsection.6.1.2.48) (subsubsection.6.1.2.52)]
+>>
+endobj
+7272 0 obj
+<<
+/Names [(subsubsection.6.1.2.53) 646 0 R (subsubsection.6.1.2.54) 650 0 R (subsubsection.6.1.2.55) 654 0 R (subsubsection.6.1.2.56) 658 0 R (subsubsection.6.1.2.57) 662 0 R (subsubsection.6.1.2.58) 666 0 R]
+/Limits [(subsubsection.6.1.2.53) (subsubsection.6.1.2.58)]
+>>
+endobj
+7273 0 obj
+<<
+/Names [(subsubsection.6.1.2.59) 670 0 R (subsubsection.6.1.2.6) 458 0 R (subsubsection.6.1.2.60) 674 0 R (subsubsection.6.1.2.61) 678 0 R (subsubsection.6.1.2.62) 682 0 R (subsubsection.6.1.2.63) 686 0 R]
+/Limits [(subsubsection.6.1.2.59) (subsubsection.6.1.2.63)]
+>>
+endobj
+7274 0 obj
+<<
+/Names [(subsubsection.6.1.2.64) 690 0 R (subsubsection.6.1.2.65) 694 0 R (subsubsection.6.1.2.66) 698 0 R (subsubsection.6.1.2.67) 702 0 R (subsubsection.6.1.2.68) 706 0 R (subsubsection.6.1.2.69) 710 0 R]
+/Limits [(subsubsection.6.1.2.64) (subsubsection.6.1.2.69)]
+>>
+endobj
+7275 0 obj
+<<
+/Names [(subsubsection.6.1.2.7) 462 0 R (subsubsection.6.1.2.70) 714 0 R (subsubsection.6.1.2.71) 718 0 R (subsubsection.6.1.2.72) 722 0 R (subsubsection.6.1.2.73) 726 0 R (subsubsection.6.1.2.74) 730 0 R]
+/Limits [(subsubsection.6.1.2.7) (subsubsection.6.1.2.74)]
+>>
+endobj
+7276 0 obj
+<<
+/Names [(subsubsection.6.1.2.75) 734 0 R (subsubsection.6.1.2.76) 738 0 R (subsubsection.6.1.2.77) 742 0 R (subsubsection.6.1.2.78) 746 0 R (subsubsection.6.1.2.79) 750 0 R (subsubsection.6.1.2.8) 466 0 R]
+/Limits [(subsubsection.6.1.2.75) (subsubsection.6.1.2.8)]
+>>
+endobj
+7277 0 obj
+<<
+/Names [(subsubsection.6.1.2.80) 754 0 R (subsubsection.6.1.2.81) 758 0 R (subsubsection.6.1.2.82) 762 0 R (subsubsection.6.1.2.83) 766 0 R (subsubsection.6.1.2.84) 770 0 R (subsubsection.6.1.2.85) 774 0 R]
+/Limits [(subsubsection.6.1.2.80) (subsubsection.6.1.2.85)]
+>>
+endobj
+7278 0 obj
+<<
+/Names [(subsubsection.6.1.2.86) 778 0 R (subsubsection.6.1.2.87) 782 0 R (subsubsection.6.1.2.88) 786 0 R (subsubsection.6.1.2.89) 790 0 R (subsubsection.6.1.2.9) 470 0 R (subsubsection.6.1.2.90) 794 0 R]
+/Limits [(subsubsection.6.1.2.86) (subsubsection.6.1.2.90)]
+>>
+endobj
+7279 0 obj
+<<
+/Names [(subsubsection.6.1.2.91) 798 0 R (subsubsection.6.1.2.92) 802 0 R (subsubsection.6.1.2.93) 806 0 R (subsubsection.6.1.2.94) 810 0 R (subsubsection.6.1.2.95) 814 0 R (subsubsection.6.1.2.96) 818 0 R]
+/Limits [(subsubsection.6.1.2.91) (subsubsection.6.1.2.96)]
+>>
+endobj
+7280 0 obj
+<<
+/Names [(subsubsection.6.1.2.97) 822 0 R (subsubsection.6.1.2.98) 826 0 R (subsubsection.6.1.2.99) 830 0 R (subsubsection.6.1.3.1) 1174 0 R (subsubsection.6.1.3.2) 1178 0 R (subsubsection.6.1.3.3) 1182 0 R]
+/Limits [(subsubsection.6.1.2.97) (subsubsection.6.1.3.3)]
+>>
+endobj
+7281 0 obj
+<<
+/Names [(subsubsection.6.1.3.4) 1186 0 R (subsubsection.6.1.3.5) 1190 0 R (subsubsection.6.1.3.6) 1194 0 R (subsubsection.6.1.3.7) 1198 0 R (subsubsection.6.11.2.1) 1398 0 R (subsubsection.6.11.2.10) 1434 0 R]
+/Limits [(subsubsection.6.1.3.4) (subsubsection.6.11.2.10)]
+>>
+endobj
+7282 0 obj
+<<
+/Names [(subsubsection.6.11.2.11) 1438 0 R (subsubsection.6.11.2.12) 1442 0 R (subsubsection.6.11.2.13) 1446 0 R (subsubsection.6.11.2.14) 1450 0 R (subsubsection.6.11.2.15) 1454 0 R (subsubsection.6.11.2.16) 1458 0 R]
+/Limits [(subsubsection.6.11.2.11) (subsubsection.6.11.2.16)]
+>>
+endobj
+7283 0 obj
+<<
+/Names [(subsubsection.6.11.2.17) 1462 0 R (subsubsection.6.11.2.18) 1466 0 R (subsubsection.6.11.2.19) 1470 0 R (subsubsection.6.11.2.2) 1402 0 R (subsubsection.6.11.2.20) 1474 0 R (subsubsection.6.11.2.21) 1478 0 R]
+/Limits [(subsubsection.6.11.2.17) (subsubsection.6.11.2.21)]
+>>
+endobj
+7284 0 obj
+<<
+/Names [(subsubsection.6.11.2.22) 1482 0 R (subsubsection.6.11.2.23) 1486 0 R (subsubsection.6.11.2.24) 1490 0 R (subsubsection.6.11.2.25) 1494 0 R (subsubsection.6.11.2.26) 1498 0 R (subsubsection.6.11.2.27) 1502 0 R]
+/Limits [(subsubsection.6.11.2.22) (subsubsection.6.11.2.27)]
+>>
+endobj
+7285 0 obj
+<<
+/Names [(subsubsection.6.11.2.28) 1506 0 R (subsubsection.6.11.2.29) 1510 0 R (subsubsection.6.11.2.3) 1406 0 R (subsubsection.6.11.2.30) 1514 0 R (subsubsection.6.11.2.4) 1410 0 R (subsubsection.6.11.2.5) 1414 0 R]
+/Limits [(subsubsection.6.11.2.28) (subsubsection.6.11.2.5)]
+>>
+endobj
+7286 0 obj
+<<
+/Names [(subsubsection.6.11.2.6) 1418 0 R (subsubsection.6.11.2.7) 1422 0 R (subsubsection.6.11.2.8) 1426 0 R (subsubsection.6.11.2.9) 1430 0 R (subsubsection.6.13.2.1) 1534 0 R (subsubsection.6.13.2.10) 1570 0 R]
+/Limits [(subsubsection.6.11.2.6) (subsubsection.6.13.2.10)]
+>>
+endobj
+7287 0 obj
+<<
+/Names [(subsubsection.6.13.2.11) 1574 0 R (subsubsection.6.13.2.12) 1578 0 R (subsubsection.6.13.2.13) 1582 0 R (subsubsection.6.13.2.14) 1586 0 R (subsubsection.6.13.2.15) 1590 0 R (subsubsection.6.13.2.16) 1594 0 R]
+/Limits [(subsubsection.6.13.2.11) (subsubsection.6.13.2.16)]
+>>
+endobj
+7288 0 obj
+<<
+/Names [(subsubsection.6.13.2.17) 1598 0 R (subsubsection.6.13.2.18) 1602 0 R (subsubsection.6.13.2.19) 1606 0 R (subsubsection.6.13.2.2) 1538 0 R (subsubsection.6.13.2.20) 1610 0 R (subsubsection.6.13.2.21) 1614 0 R]
+/Limits [(subsubsection.6.13.2.17) (subsubsection.6.13.2.21)]
+>>
+endobj
+7289 0 obj
+<<
+/Names [(subsubsection.6.13.2.22) 1618 0 R (subsubsection.6.13.2.23) 1622 0 R (subsubsection.6.13.2.3) 1542 0 R (subsubsection.6.13.2.4) 1546 0 R (subsubsection.6.13.2.5) 1550 0 R (subsubsection.6.13.2.6) 1554 0 R]
+/Limits [(subsubsection.6.13.2.22) (subsubsection.6.13.2.6)]
+>>
+endobj
+7290 0 obj
+<<
+/Names [(subsubsection.6.13.2.7) 1558 0 R (subsubsection.6.13.2.8) 1562 0 R (subsubsection.6.13.2.9) 1566 0 R (subsubsection.6.15.2.1) 1642 0 R (subsubsection.6.15.2.10) 1678 0 R (subsubsection.6.15.2.11) 1682 0 R]
+/Limits [(subsubsection.6.13.2.7) (subsubsection.6.15.2.11)]
+>>
+endobj
+7291 0 obj
+<<
+/Names [(subsubsection.6.15.2.12) 1686 0 R (subsubsection.6.15.2.2) 1646 0 R (subsubsection.6.15.2.3) 1650 0 R (subsubsection.6.15.2.4) 1654 0 R (subsubsection.6.15.2.5) 1658 0 R (subsubsection.6.15.2.6) 1662 0 R]
+/Limits [(subsubsection.6.15.2.12) (subsubsection.6.15.2.6)]
+>>
+endobj
+7292 0 obj
+<<
+/Names [(subsubsection.6.15.2.7) 1666 0 R (subsubsection.6.15.2.8) 1670 0 R (subsubsection.6.15.2.9) 1674 0 R (subsubsection.6.17.2.1) 1706 0 R (subsubsection.6.17.2.10) 1742 0 R (subsubsection.6.17.2.11) 1746 0 R]
+/Limits [(subsubsection.6.15.2.7) (subsubsection.6.17.2.11)]
+>>
+endobj
+7293 0 obj
+<<
+/Names [(subsubsection.6.17.2.12) 1750 0 R (subsubsection.6.17.2.13) 1754 0 R (subsubsection.6.17.2.14) 1758 0 R (subsubsection.6.17.2.15) 1762 0 R (subsubsection.6.17.2.16) 1766 0 R (subsubsection.6.17.2.17) 1770 0 R]
+/Limits [(subsubsection.6.17.2.12) (subsubsection.6.17.2.17)]
+>>
+endobj
+7294 0 obj
+<<
+/Names [(subsubsection.6.17.2.2) 1710 0 R (subsubsection.6.17.2.3) 1714 0 R (subsubsection.6.17.2.4) 1718 0 R (subsubsection.6.17.2.5) 1722 0 R (subsubsection.6.17.2.6) 1726 0 R (subsubsection.6.17.2.7) 1730 0 R]
+/Limits [(subsubsection.6.17.2.2) (subsubsection.6.17.2.7)]
+>>
+endobj
+7295 0 obj
+<<
+/Names [(subsubsection.6.17.2.8) 1734 0 R (subsubsection.6.17.2.9) 1738 0 R (subsubsection.6.19.2.1) 1790 0 R (subsubsection.6.19.2.2) 1794 0 R (subsubsection.6.21.2.1) 1814 0 R (subsubsection.6.21.2.2) 1818 0 R]
+/Limits [(subsubsection.6.17.2.8) (subsubsection.6.21.2.2)]
+>>
+endobj
+7296 0 obj
+<<
+/Names [(subsubsection.6.21.2.3) 1822 0 R (subsubsection.6.21.2.4) 1826 0 R (subsubsection.6.21.2.5) 1830 0 R (subsubsection.6.21.2.6) 1834 0 R (subsubsection.6.21.2.7) 1838 0 R (subsubsection.6.23.2.1) 1858 0 R]
+/Limits [(subsubsection.6.21.2.3) (subsubsection.6.23.2.1)]
+>>
+endobj
+7297 0 obj
+<<
+/Names [(subsubsection.6.23.2.10) 1894 0 R (subsubsection.6.23.2.11) 1898 0 R (subsubsection.6.23.2.12) 1902 0 R (subsubsection.6.23.2.13) 1906 0 R (subsubsection.6.23.2.14) 1910 0 R (subsubsection.6.23.2.15) 1914 0 R]
+/Limits [(subsubsection.6.23.2.10) (subsubsection.6.23.2.15)]
+>>
+endobj
+7298 0 obj
+<<
+/Names [(subsubsection.6.23.2.16) 1918 0 R (subsubsection.6.23.2.17) 1922 0 R (subsubsection.6.23.2.18) 1926 0 R (subsubsection.6.23.2.19) 1930 0 R (subsubsection.6.23.2.2) 1862 0 R (subsubsection.6.23.2.20) 1934 0 R]
+/Limits [(subsubsection.6.23.2.16) (subsubsection.6.23.2.20)]
+>>
+endobj
+7299 0 obj
+<<
+/Names [(subsubsection.6.23.2.21) 1938 0 R (subsubsection.6.23.2.22) 1942 0 R (subsubsection.6.23.2.23) 1946 0 R (subsubsection.6.23.2.24) 1950 0 R (subsubsection.6.23.2.25) 1954 0 R (subsubsection.6.23.2.26) 1958 0 R]
+/Limits [(subsubsection.6.23.2.21) (subsubsection.6.23.2.26)]
+>>
+endobj
+7300 0 obj
+<<
+/Names [(subsubsection.6.23.2.3) 1866 0 R (subsubsection.6.23.2.4) 1870 0 R (subsubsection.6.23.2.5) 1874 0 R (subsubsection.6.23.2.6) 1878 0 R (subsubsection.6.23.2.7) 1882 0 R (subsubsection.6.23.2.8) 1886 0 R]
+/Limits [(subsubsection.6.23.2.3) (subsubsection.6.23.2.8)]
+>>
+endobj
+7301 0 obj
+<<
+/Names [(subsubsection.6.23.2.9) 1890 0 R (subsubsection.6.25.2.1) 1978 0 R (subsubsection.6.25.2.2) 1982 0 R (subsubsection.6.25.2.3) 1986 0 R (subsubsection.6.25.2.4) 1990 0 R (subsubsection.6.25.2.5) 1994 0 R]
+/Limits [(subsubsection.6.23.2.9) (subsubsection.6.25.2.5)]
+>>
+endobj
+7302 0 obj
+<<
+/Names [(subsubsection.6.25.2.6) 1998 0 R (subsubsection.6.25.2.7) 2002 0 R (subsubsection.6.25.2.8) 2006 0 R (subsubsection.6.25.2.9) 2010 0 R (subsubsection.6.27.2.1) 2030 0 R (subsubsection.6.27.2.2) 2034 0 R]
+/Limits [(subsubsection.6.25.2.6) (subsubsection.6.27.2.2)]
+>>
+endobj
+7303 0 obj
+<<
+/Names [(subsubsection.6.27.2.3) 2038 0 R (subsubsection.6.27.2.4) 2042 0 R (subsubsection.6.3.2.1) 1218 0 R (subsubsection.6.3.2.2) 1222 0 R (subsubsection.6.3.3.1) 1230 0 R (subsubsection.6.3.3.2) 1234 0 R]
+/Limits [(subsubsection.6.27.2.3) (subsubsection.6.3.3.2)]
+>>
+endobj
+7304 0 obj
+<<
+/Names [(subsubsection.6.31.2.1) 2074 0 R (subsubsection.6.31.2.10) 2110 0 R (subsubsection.6.31.2.11) 2114 0 R (subsubsection.6.31.2.12) 2118 0 R (subsubsection.6.31.2.2) 2078 0 R (subsubsection.6.31.2.3) 2082 0 R]
+/Limits [(subsubsection.6.31.2.1) (subsubsection.6.31.2.3)]
+>>
+endobj
+7305 0 obj
+<<
+/Names [(subsubsection.6.31.2.4) 2086 0 R (subsubsection.6.31.2.5) 2090 0 R (subsubsection.6.31.2.6) 2094 0 R (subsubsection.6.31.2.7) 2098 0 R (subsubsection.6.31.2.8) 2102 0 R (subsubsection.6.31.2.9) 2106 0 R]
+/Limits [(subsubsection.6.31.2.4) (subsubsection.6.31.2.9)]
+>>
+endobj
+7306 0 obj
+<<
+/Names [(subsubsection.6.31.3.1) 2126 0 R (subsubsection.6.31.3.10) 2162 0 R (subsubsection.6.31.3.11) 2166 0 R (subsubsection.6.31.3.12) 2170 0 R (subsubsection.6.31.3.13) 2174 0 R (subsubsection.6.31.3.14) 2178 0 R]
+/Limits [(subsubsection.6.31.3.1) (subsubsection.6.31.3.14)]
+>>
+endobj
+7307 0 obj
+<<
+/Names [(subsubsection.6.31.3.15) 2182 0 R (subsubsection.6.31.3.16) 2186 0 R (subsubsection.6.31.3.17) 2190 0 R (subsubsection.6.31.3.18) 2194 0 R (subsubsection.6.31.3.2) 2130 0 R (subsubsection.6.31.3.3) 2134 0 R]
+/Limits [(subsubsection.6.31.3.15) (subsubsection.6.31.3.3)]
+>>
+endobj
+7308 0 obj
+<<
+/Names [(subsubsection.6.31.3.4) 2138 0 R (subsubsection.6.31.3.5) 2142 0 R (subsubsection.6.31.3.6) 2146 0 R (subsubsection.6.31.3.7) 2150 0 R (subsubsection.6.31.3.8) 2154 0 R (subsubsection.6.31.3.9) 2158 0 R]
+/Limits [(subsubsection.6.31.3.4) (subsubsection.6.31.3.9)]
+>>
+endobj
+7309 0 obj
+<<
+/Names [(subsubsection.6.31.4.1) 2202 0 R (subsubsection.6.31.4.10) 2238 0 R (subsubsection.6.31.4.2) 2206 0 R (subsubsection.6.31.4.3) 2210 0 R (subsubsection.6.31.4.4) 2214 0 R (subsubsection.6.31.4.5) 2218 0 R]
+/Limits [(subsubsection.6.31.4.1) (subsubsection.6.31.4.5)]
+>>
+endobj
+7310 0 obj
+<<
+/Names [(subsubsection.6.31.4.6) 2222 0 R (subsubsection.6.31.4.7) 2226 0 R (subsubsection.6.31.4.8) 2230 0 R (subsubsection.6.31.4.9) 2234 0 R (subsubsection.6.5.2.1) 1254 0 R (subsubsection.6.5.2.2) 1258 0 R]
+/Limits [(subsubsection.6.31.4.6) (subsubsection.6.5.2.2)]
+>>
+endobj
+7311 0 obj
+<<
+/Names [(subsubsection.6.7.2.1) 1278 0 R (subsubsection.6.7.3.1) 1286 0 R (subsubsection.6.7.3.2) 1290 0 R (subsubsection.6.7.3.3) 1294 0 R (subsubsection.6.9.2.1) 1314 0 R (subsubsection.6.9.2.10) 1350 0 R]
+/Limits [(subsubsection.6.7.2.1) (subsubsection.6.9.2.10)]
+>>
+endobj
+7312 0 obj
+<<
+/Names [(subsubsection.6.9.2.11) 1354 0 R (subsubsection.6.9.2.12) 1358 0 R (subsubsection.6.9.2.13) 1362 0 R (subsubsection.6.9.2.14) 1366 0 R (subsubsection.6.9.2.15) 1370 0 R (subsubsection.6.9.2.16) 1374 0 R]
+/Limits [(subsubsection.6.9.2.11) (subsubsection.6.9.2.16)]
+>>
+endobj
+7313 0 obj
+<<
+/Names [(subsubsection.6.9.2.17) 1378 0 R (subsubsection.6.9.2.2) 1318 0 R (subsubsection.6.9.2.3) 1322 0 R (subsubsection.6.9.2.4) 1326 0 R (subsubsection.6.9.2.5) 1330 0 R (subsubsection.6.9.2.6) 1334 0 R]
+/Limits [(subsubsection.6.9.2.17) (subsubsection.6.9.2.6)]
+>>
+endobj
+7314 0 obj
+<<
+/Names [(subsubsection.6.9.2.7) 1338 0 R (subsubsection.6.9.2.8) 1342 0 R (subsubsection.6.9.2.9) 1346 0 R (table.6.1) 4069 0 R (table.6.10) 4258 0 R (table.6.100) 5231 0 R]
+/Limits [(subsubsection.6.9.2.7) (table.6.100)]
+>>
+endobj
+7315 0 obj
+<<
+/Names [(table.6.101) 5232 0 R (table.6.102) 5258 0 R (table.6.103) 5259 0 R (table.6.104) 5298 0 R (table.6.105) 5299 0 R (table.6.106) 5327 0 R]
+/Limits [(table.6.101) (table.6.106)]
+>>
+endobj
+7316 0 obj
+<<
+/Names [(table.6.107) 5342 0 R (table.6.108) 5343 0 R (table.6.109) 5344 0 R (table.6.11) 4259 0 R (table.6.110) 5356 0 R (table.6.111) 5357 0 R]
+/Limits [(table.6.107) (table.6.111)]
+>>
+endobj
+7317 0 obj
+<<
+/Names [(table.6.112) 5358 0 R (table.6.113) 5478 0 R (table.6.114) 5479 0 R (table.6.115) 5484 0 R (table.6.116) 5485 0 R (table.6.117) 5490 0 R]
+/Limits [(table.6.112) (table.6.117)]
+>>
+endobj
+7318 0 obj
+<<
+/Names [(table.6.118) 5491 0 R (table.6.119) 5498 0 R (table.6.12) 4260 0 R (table.6.120) 5499 0 R (table.6.121) 5513 0 R (table.6.122) 5514 0 R]
+/Limits [(table.6.118) (table.6.122)]
+>>
+endobj
+7319 0 obj
+<<
+/Names [(table.6.123) 5515 0 R (table.6.124) 5523 0 R (table.6.125) 5524 0 R (table.6.126) 5525 0 R (table.6.127) 5533 0 R (table.6.128) 5534 0 R]
+/Limits [(table.6.123) (table.6.128)]
+>>
+endobj
+7320 0 obj
+<<
+/Names [(table.6.129) 5543 0 R (table.6.13) 4270 0 R (table.6.130) 5544 0 R (table.6.131) 5555 0 R (table.6.132) 5556 0 R (table.6.133) 5557 0 R]
+/Limits [(table.6.129) (table.6.133)]
+>>
+endobj
+7321 0 obj
+<<
+/Names [(table.6.134) 5594 0 R (table.6.135) 5658 0 R (table.6.136) 5673 0 R (table.6.137) 5674 0 R (table.6.138) 5675 0 R (table.6.139) 5682 0 R]
+/Limits [(table.6.134) (table.6.139)]
+>>
+endobj
+7322 0 obj
+<<
+/Names [(table.6.14) 4271 0 R (table.6.140) 5683 0 R (table.6.141) 5684 0 R (table.6.142) 5694 0 R (table.6.143) 5695 0 R (table.6.144) 5761 0 R]
+/Limits [(table.6.14) (table.6.144)]
+>>
+endobj
+7323 0 obj
+<<
+/Names [(table.6.145) 5762 0 R (table.6.146) 5763 0 R (table.6.147) 5785 0 R (table.6.148) 5934 0 R (table.6.149) 5951 0 R (table.6.15) 4285 0 R]
+/Limits [(table.6.145) (table.6.15)]
+>>
+endobj
+7324 0 obj
+<<
+/Names [(table.6.150) 5952 0 R (table.6.151) 5953 0 R (table.6.152) 5962 0 R (table.6.153) 5963 0 R (table.6.154) 5964 0 R (table.6.155) 5975 0 R]
+/Limits [(table.6.150) (table.6.155)]
+>>
+endobj
+7325 0 obj
+<<
+/Names [(table.6.156) 5976 0 R (table.6.157) 5977 0 R (table.6.158) 5986 0 R (table.6.159) 5987 0 R (table.6.16) 4286 0 R (table.6.160) 5988 0 R]
+/Limits [(table.6.156) (table.6.160)]
+>>
+endobj
+7326 0 obj
+<<
+/Names [(table.6.161) 5996 0 R (table.6.162) 5997 0 R (table.6.163) 5998 0 R (table.6.164) 6007 0 R (table.6.165) 6008 0 R (table.6.17) 4287 0 R]
+/Limits [(table.6.161) (table.6.17)]
+>>
+endobj
+7327 0 obj
+<<
+/Names [(table.6.18) 4299 0 R (table.6.19) 4300 0 R (table.6.2) 4070 0 R (table.6.20) 4312 0 R (table.6.21) 4313 0 R (table.6.22) 4314 0 R]
+/Limits [(table.6.18) (table.6.22)]
+>>
+endobj
+7328 0 obj
+<<
+/Names [(table.6.23) 4498 0 R (table.6.24) 4512 0 R (table.6.25) 4513 0 R (table.6.26) 4514 0 R (table.6.27) 4522 0 R (table.6.28) 4523 0 R]
+/Limits [(table.6.23) (table.6.28)]
+>>
+endobj
+7329 0 obj
+<<
+/Names [(table.6.29) 4524 0 R (table.6.3) 4110 0 R (table.6.30) 4535 0 R (table.6.31) 4536 0 R (table.6.32) 4537 0 R (table.6.33) 4545 0 R]
+/Limits [(table.6.29) (table.6.33)]
+>>
+endobj
+7330 0 obj
+<<
+/Names [(table.6.34) 4546 0 R (table.6.35) 4547 0 R (table.6.36) 4548 0 R (table.6.37) 4558 0 R (table.6.38) 4559 0 R (table.6.39) 4560 0 R]
+/Limits [(table.6.34) (table.6.39)]
+>>
+endobj
+7331 0 obj
+<<
+/Names [(table.6.4) 4111 0 R (table.6.40) 4570 0 R (table.6.41) 4571 0 R (table.6.42) 4572 0 R (table.6.43) 4583 0 R (table.6.44) 4584 0 R]
+/Limits [(table.6.4) (table.6.44)]
+>>
+endobj
+7332 0 obj
+<<
+/Names [(table.6.45) 4593 0 R (table.6.46) 4594 0 R (table.6.47) 4595 0 R (table.6.48) 4606 0 R (table.6.49) 4607 0 R (table.6.5) 4124 0 R]
+/Limits [(table.6.45) (table.6.5)]
+>>
+endobj
+7333 0 obj
+<<
+/Names [(table.6.50) 4608 0 R (table.6.51) 4659 0 R (table.6.52) 4660 0 R (table.6.53) 4816 0 R (table.6.54) 4817 0 R (table.6.55) 4818 0 R]
+/Limits [(table.6.50) (table.6.55)]
+>>
+endobj
+7334 0 obj
+<<
+/Names [(table.6.56) 4819 0 R (table.6.57) 4831 0 R (table.6.58) 4832 0 R (table.6.59) 4833 0 R (table.6.6) 4235 0 R (table.6.60) 4844 0 R]
+/Limits [(table.6.56) (table.6.60)]
+>>
+endobj
+7335 0 obj
+<<
+/Names [(table.6.61) 4845 0 R (table.6.62) 4846 0 R (table.6.63) 4856 0 R (table.6.64) 4857 0 R (table.6.65) 4858 0 R (table.6.66) 4859 0 R]
+/Limits [(table.6.61) (table.6.66)]
+>>
+endobj
+7336 0 obj
+<<
+/Names [(table.6.67) 4876 0 R (table.6.68) 4877 0 R (table.6.69) 4888 0 R (table.6.7) 4236 0 R (table.6.70) 4889 0 R (table.6.71) 4890 0 R]
+/Limits [(table.6.67) (table.6.71)]
+>>
+endobj
+7337 0 obj
+<<
+/Names [(table.6.72) 4904 0 R (table.6.73) 4905 0 R (table.6.74) 4927 0 R (table.6.75) 4928 0 R (table.6.76) 5040 0 R (table.6.77) 5057 0 R]
+/Limits [(table.6.72) (table.6.77)]
+>>
+endobj
+7338 0 obj
+<<
+/Names [(table.6.78) 5058 0 R (table.6.79) 5059 0 R (table.6.8) 4245 0 R (table.6.80) 5071 0 R (table.6.81) 5072 0 R (table.6.82) 5073 0 R]
+/Limits [(table.6.78) (table.6.82)]
+>>
+endobj
+7339 0 obj
+<<
+/Names [(table.6.83) 5079 0 R (table.6.84) 5080 0 R (table.6.85) 5081 0 R (table.6.86) 5118 0 R (table.6.87) 5119 0 R (table.6.88) 5189 0 R]
+/Limits [(table.6.83) (table.6.88)]
+>>
+endobj
+7340 0 obj
+<<
+/Names [(table.6.89) 5190 0 R (table.6.9) 4246 0 R (table.6.90) 5198 0 R (table.6.91) 5199 0 R (table.6.92) 5200 0 R (table.6.93) 5208 0 R]
+/Limits [(table.6.89) (table.6.93)]
+>>
+endobj
+7341 0 obj
+<<
+/Names [(table.6.94) 5209 0 R (table.6.95) 5210 0 R (table.6.96) 5218 0 R (table.6.97) 5219 0 R (table.6.98) 5220 0 R (table.6.99) 5230 0 R]
+/Limits [(table.6.94) (table.6.99)]
+>>
+endobj
+7342 0 obj
+<<
+/Names [(tls1__3_8h) 2894 0 R (tls1__3_8h_a049edff83685de08215c79860380f46f) 3441 0 R (tls1__3_8h_a066901ffac09dc72c1f6a76d29b1c575) 3515 0 R (tls1__3_8h_a0a1f060193ab58a3c90b82988479d5b5) 3625 0 R (tls1__3_8h_a0ae654442f7cd9609c67a9d01d5b76f2) 3753 0 R (tls1__3_8h_a0b18b7af6e4667ed600f1a9e18b3702e) 3661 0 R]
+/Limits [(tls1__3_8h) (tls1__3_8h_a0b18b7af6e4667ed600f1a9e18b3702e)]
+>>
+endobj
+7343 0 obj
+<<
+/Names [(tls1__3_8h_a104cb3663af17a0a687b0cd725341b7a) 3642 0 R (tls1__3_8h_a113044f98597022ad8f8bc35aa06f9c5) 3615 0 R (tls1__3_8h_a11e5ff8f28ac9380b39562a9db75fa77) 3553 0 R (tls1__3_8h_a120e75c22f78b1ed453126173a3a135b) 3651 0 R (tls1__3_8h_a13500a8813b145def6df450cd5dea0c4) 3766 0 R (tls1__3_8h_a14a099c64e2db7a86755e723a6fc003f) 3738 0 R]
+/Limits [(tls1__3_8h_a104cb3663af17a0a687b0cd725341b7a) (tls1__3_8h_a14a099c64e2db7a86755e723a6fc003f)]
+>>
+endobj
+7344 0 obj
+<<
+/Names [(tls1__3_8h_a167e5f8ab01015ba2b24bf9467b8a835) 3516 0 R (tls1__3_8h_a17a27683a309d3bfe24ca6ed5c945c96) 3659 0 R (tls1__3_8h_a180698b245499ea37cbd0db4177539f9) 3532 0 R (tls1__3_8h_a188be171b89d59fe6f907a86687013a2) 3622 0 R (tls1__3_8h_a18f2498943999661836821eebb57e028) 3543 0 R (tls1__3_8h_a195baf7c0a79fcc73992de601a924249) 3530 0 R]
+/Limits [(tls1__3_8h_a167e5f8ab01015ba2b24bf9467b8a835) (tls1__3_8h_a195baf7c0a79fcc73992de601a924249)]
+>>
+endobj
+7345 0 obj
+<<
+/Names [(tls1__3_8h_a1f87fa495b0a9cf6ff14664bac6c0ead) 3807 0 R (tls1__3_8h_a1f9984d3424408116f870aa3ffbd8c82) 3440 0 R (tls1__3_8h_a1fd998a580e8d1967290fd852d061254) 3616 0 R (tls1__3_8h_a202c333d977b3e487ce2772d696fddd4) 3764 0 R (tls1__3_8h_a20ad80e7d257a94588bc229b730f7945) 3751 0 R (tls1__3_8h_a22c1533a4932e7a5b3647ccbe3cbde95) 3548 0 R]
+/Limits [(tls1__3_8h_a1f87fa495b0a9cf6ff14664bac6c0ead) (tls1__3_8h_a22c1533a4932e7a5b3647ccbe3cbde95)]
+>>
+endobj
+7346 0 obj
+<<
+/Names [(tls1__3_8h_a22d9f24915e2fb809959c6479508bfe8) 3541 0 R (tls1__3_8h_a22e28c40511845ea7f8421bfb140b1b3) 3782 0 R (tls1__3_8h_a233c0ef2a9d642fb9ca1c254e8b37be3) 3729 0 R (tls1__3_8h_a24e4e8fe9ff4014dcb28bcc0779e382a) 3744 0 R (tls1__3_8h_a2716011f133618b6340c7172ba3fdf11) 3542 0 R (tls1__3_8h_a277f7abca2044f354abe265252cb9252) 3773 0 R]
+/Limits [(tls1__3_8h_a22d9f24915e2fb809959c6479508bfe8) (tls1__3_8h_a277f7abca2044f354abe265252cb9252)]
+>>
+endobj
+7347 0 obj
+<<
+/Names [(tls1__3_8h_a28919a9959f0147a4bb0284a2060cf20) 3620 0 R (tls1__3_8h_a28ab9d8782c4995a341d940183914a36) 3757 0 R (tls1__3_8h_a29dec32cb8bb66baf1c850df2c876499) 3544 0 R (tls1__3_8h_a2cd5d60f1aad92bfe845b7a4d3ab2cd9) 3353 0 R (tls1__3_8h_a305aa71b6075a2f23d36cb792c519011) 3758 0 R (tls1__3_8h_a324017af35e723864b7074e43ecb1623) 3657 0 R]
+/Limits [(tls1__3_8h_a28919a9959f0147a4bb0284a2060cf20) (tls1__3_8h_a324017af35e723864b7074e43ecb1623)]
+>>
+endobj
+7348 0 obj
+<<
+/Names [(tls1__3_8h_a32abf56070a1d443df8f6748e8d8e534) 3551 0 R (tls1__3_8h_a34141cc5b18dc3b9a5c78301e67d8699) 3759 0 R (tls1__3_8h_a3421319257516c96f3fff9442c7a10ae) 3438 0 R (tls1__3_8h_a347fed99b27daf3cd0d2cc6bce4ee14d) 3663 0 R (tls1__3_8h_a35d45aeb44dc1ea7d0ee616ce4fa71d0) 3639 0 R (tls1__3_8h_a3690b60b2a57b35be9bd056794433f2a) 3522 0 R]
+/Limits [(tls1__3_8h_a32abf56070a1d443df8f6748e8d8e534) (tls1__3_8h_a3690b60b2a57b35be9bd056794433f2a)]
+>>
+endobj
+7349 0 obj
+<<
+/Names [(tls1__3_8h_a36987d5e686aa8d5a5752fad188fc972) 3626 0 R (tls1__3_8h_a39edb87bab9b619fd9cba6c5cfb4b5ee) 3804 0 R (tls1__3_8h_a3a1ace7afbc094bac9a6cf5496351461) 3781 0 R (tls1__3_8h_a3a54ac117bb30599d5df5f4ff08a0fda) 3512 0 R (tls1__3_8h_a3a8d62bba8785e2dda80d42b6e96bc32) 3771 0 R (tls1__3_8h_a3ac18852b5f71d1499f5e1536311b12a) 3644 0 R]
+/Limits [(tls1__3_8h_a36987d5e686aa8d5a5752fad188fc972) (tls1__3_8h_a3ac18852b5f71d1499f5e1536311b12a)]
+>>
+endobj
+7350 0 obj
+<<
+/Names [(tls1__3_8h_a3bdac7e874fc054099ed13e2a11e9a0a) 3630 0 R (tls1__3_8h_a3c848b937dc1157faba5f472dc7db882) 3507 0 R (tls1__3_8h_a3eebd09a9a94c914de17855816e6ac45) 3660 0 R (tls1__3_8h_a3fa4adf91c076826330222025d8affa5) 3810 0 R (tls1__3_8h_a4112a74ab8350a9235a89999be0c5031) 3526 0 R (tls1__3_8h_a4217616afae0660885777b6ab586c3a7) 3652 0 R]
+/Limits [(tls1__3_8h_a3bdac7e874fc054099ed13e2a11e9a0a) (tls1__3_8h_a4217616afae0660885777b6ab586c3a7)]
+>>
+endobj
+7351 0 obj
+<<
+/Names [(tls1__3_8h_a42d4f54d23f86205a1fa590480181e0f) 3073 0 R (tls1__3_8h_a42ed9bb2d8c709a8901a509340eb9625) 3244 0 R (tls1__3_8h_a44757eea433a0c13e613e4a8b6b7e668) 3811 0 R (tls1__3_8h_a45167996bc287391d11954085deece97) 3624 0 R (tls1__3_8h_a474e9fd9b8bfb496452ffc6d022f3cb3) 3814 0 R (tls1__3_8h_a48c56124c4f5ee1c5eeb4b509218ad90) 3654 0 R]
+/Limits [(tls1__3_8h_a42d4f54d23f86205a1fa590480181e0f) (tls1__3_8h_a48c56124c4f5ee1c5eeb4b509218ad90)]
+>>
+endobj
+7352 0 obj
+<<
+/Names [(tls1__3_8h_a499ed5d3f8ea8654bb19ef0e7c82a93c) 3647 0 R (tls1__3_8h_a4b5c95f51c533c0244b705634b2c35b8) 3435 0 R (tls1__3_8h_a4c85c11a6ec5c8302e25ffec8b87c173) 3537 0 R (tls1__3_8h_a51e1cfe6d71ad92d7503c207cf9be105) 3550 0 R (tls1__3_8h_a5285f40796ab54428826d61d50c616ed) 3437 0 R (tls1__3_8h_a52cadf7f83ff343c727f32c36998758b) 3816 0 R]
+/Limits [(tls1__3_8h_a499ed5d3f8ea8654bb19ef0e7c82a93c) (tls1__3_8h_a52cadf7f83ff343c727f32c36998758b)]
+>>
+endobj
+7353 0 obj
+<<
+/Names [(tls1__3_8h_a53cbdcdf0624fb62fa2f42aa21f8f4ac) 3538 0 R (tls1__3_8h_a54f228e1944ee10c77cac7e9c6ac05a5) 3778 0 R (tls1__3_8h_a5a8bc0678d19bace9ec042d79a98bf25) 3513 0 R (tls1__3_8h_a5ae99a5912cb34dc0f8148d8ea4ea521) 3748 0 R (tls1__3_8h_a5bddff8a4478c3fa9e4b6485d48a0a0c) 3643 0 R (tls1__3_8h_a5ce95d1c789558704c065f9f3ae81f96) 3533 0 R]
+/Limits [(tls1__3_8h_a53cbdcdf0624fb62fa2f42aa21f8f4ac) (tls1__3_8h_a5ce95d1c789558704c065f9f3ae81f96)]
+>>
+endobj
+7354 0 obj
+<<
+/Names [(tls1__3_8h_a60660b382346187ab8f42fb9c6bb9431) 3511 0 R (tls1__3_8h_a60fb8e077f876e00793b8d7c63219e08) 3656 0 R (tls1__3_8h_a61e226bbacb67ab860103722e75b66e8) 3547 0 R (tls1__3_8h_a62ba10db01e1e9eb6fb886968d86b74a) 3802 0 R (tls1__3_8h_a643edcb536f268f003f2f276ddfa6e48) 3728 0 R (tls1__3_8h_a645a56d77daf4a5df13383d7123b96b2) 3650 0 R]
+/Limits [(tls1__3_8h_a60660b382346187ab8f42fb9c6bb9431) (tls1__3_8h_a645a56d77daf4a5df13383d7123b96b2)]
+>>
+endobj
+7355 0 obj
+<<
+/Names [(tls1__3_8h_a6540b63c26c948173ce46e589f8a1e3f) 3737 0 R (tls1__3_8h_a67c5a0f262db5cd2a04c62a779cc2d4b) 3531 0 R (tls1__3_8h_a67f92f94d0d69f03e4f43fa9a0462c03) 3653 0 R (tls1__3_8h_a6985d26f5a1ab79682d11f3fb20e1e10) 3770 0 R (tls1__3_8h_a6a1e3fd193b6dd39939b3c436d1014ce) 3734 0 R (tls1__3_8h_a6b1381fd0d59dde7504bb25677c05034) 3514 0 R]
+/Limits [(tls1__3_8h_a6540b63c26c948173ce46e589f8a1e3f) (tls1__3_8h_a6b1381fd0d59dde7504bb25677c05034)]
+>>
+endobj
+7356 0 obj
+<<
+/Names [(tls1__3_8h_a6c3df225e23ad8a213f3e2fd8b027d71) 3665 0 R (tls1__3_8h_a6c61024505208107a3b5010f70640761) 3528 0 R (tls1__3_8h_a6cbd210f38401c7e3fa5991504a2bbca) 3809 0 R (tls1__3_8h_a6e383f8f299532a58fa8b88767f18daf) 3545 0 R (tls1__3_8h_a6ebccf75bb3d8609bc1f41333f2ea07b) 3331 0 R (tls1__3_8h_a705424dcab1cd0d9b75ea9a3e7dc6a31) 3640 0 R]
+/Limits [(tls1__3_8h_a6c3df225e23ad8a213f3e2fd8b027d71) (tls1__3_8h_a705424dcab1cd0d9b75ea9a3e7dc6a31)]
+>>
+endobj
+7357 0 obj
+<<
+/Names [(tls1__3_8h_a72c8bfdadfaf9ba1c9e1a34c6ac78708) 3815 0 R (tls1__3_8h_a72d3239eb2ab8dcbda07d02d79ebc63c) 3521 0 R (tls1__3_8h_a73d8ba16d80d060c50c69ea830d953a9) 3241 0 R (tls1__3_8h_a77304588f23598f8a1a70c214642e6e6) 3645 0 R (tls1__3_8h_a796bd7c6ba2e59281760fb155c6287e8) 3666 0 R (tls1__3_8h_a79ce7495682b605f0cc796372a8ba6e2) 3756 0 R]
+/Limits [(tls1__3_8h_a72c8bfdadfaf9ba1c9e1a34c6ac78708) (tls1__3_8h_a79ce7495682b605f0cc796372a8ba6e2)]
+>>
+endobj
+7358 0 obj
+<<
+/Names [(tls1__3_8h_a79e3c0e2a67a84f1df4ce57b575c3a87) 3518 0 R (tls1__3_8h_a7cb9531118755e07150f13a13e0586ff) 3627 0 R (tls1__3_8h_a7fcf03244d689b8873bfe8564d521226) 3805 0 R (tls1__3_8h_a80fd9475005bfe22a8ba827f92d2d792) 3641 0 R (tls1__3_8h_a82554141e636ee8308756de7a6797c12) 3540 0 R (tls1__3_8h_a83f3e5758c4a1683890c77de91879c0f) 3742 0 R]
+/Limits [(tls1__3_8h_a79e3c0e2a67a84f1df4ce57b575c3a87) (tls1__3_8h_a83f3e5758c4a1683890c77de91879c0f)]
+>>
+endobj
+7359 0 obj
+<<
+/Names [(tls1__3_8h_a842a772cc913a9329c2605ac1c726cee) 3629 0 R (tls1__3_8h_a85ec2b846bed1bc0c03afcb993181e9b) 3633 0 R (tls1__3_8h_a85f8537a722e3f7833a467fb9fecf211) 3628 0 R (tls1__3_8h_a86410f6c0cc635f1052231a20086da1f) 3730 0 R (tls1__3_8h_a8b48566d29d02563199fd2e1d4795afd) 3636 0 R (tls1__3_8h_a8b65f1298c73f2ec423860f06a35747a) 3732 0 R]
+/Limits [(tls1__3_8h_a842a772cc913a9329c2605ac1c726cee) (tls1__3_8h_a8b65f1298c73f2ec423860f06a35747a)]
+>>
+endobj
+7360 0 obj
+<<
+/Names [(tls1__3_8h_a8ea3efe20abf6ad015aa261fc70eb028) 3617 0 R (tls1__3_8h_a8f6dc1d52e683902482d52744ac0a996) 3536 0 R (tls1__3_8h_a91ddc107caabf6c6629bb5157f27649e) 3554 0 R (tls1__3_8h_a93e41fd4d610ea125a2fa25479b0bdc2) 3733 0 R (tls1__3_8h_a9416b52c3bb6bace012901478d20a272) 3765 0 R (tls1__3_8h_a948d48005d539a1185e50354a37978e4) 3749 0 R]
+/Limits [(tls1__3_8h_a8ea3efe20abf6ad015aa261fc70eb028) (tls1__3_8h_a948d48005d539a1185e50354a37978e4)]
+>>
+endobj
+7361 0 obj
+<<
+/Names [(tls1__3_8h_a94eb0868bd96c94f6335175ebee6522c) 3662 0 R (tls1__3_8h_a95a1089062b5112c013afaacf690a71a) 3806 0 R (tls1__3_8h_a967027b262594c98eebfbb882a762dd7) 3552 0 R (tls1__3_8h_a9670987cc01bf2c10ea3acc14ae8f04c) 3780 0 R (tls1__3_8h_a98c94c5986465343f350d9851e7fe594) 3351 0 R (tls1__3_8h_a9cea33bd124bea9c85bd4c49218bcf18) 3779 0 R]
+/Limits [(tls1__3_8h_a94eb0868bd96c94f6335175ebee6522c) (tls1__3_8h_a9cea33bd124bea9c85bd4c49218bcf18)]
+>>
+endobj
+7362 0 obj
+<<
+/Names [(tls1__3_8h_a9dfa578e14a4c779938817cf715c9849) 3741 0 R (tls1__3_8h_a9e16bc460df3efd20261c1b80b0a00ba) 3760 0 R (tls1__3_8h_aa09cb16a1c0c65587c7b35f635b1bee5) 3517 0 R (tls1__3_8h_aa0a98c02a15b7eb8e6cb2ebb420f345a) 3761 0 R (tls1__3_8h_aa17d9eeaf23453804379e08c107c1959) 3755 0 R (tls1__3_8h_aa19413c3cb45e1f92b296849b6b17a15) 3631 0 R]
+/Limits [(tls1__3_8h_a9dfa578e14a4c779938817cf715c9849) (tls1__3_8h_aa19413c3cb45e1f92b296849b6b17a15)]
+>>
+endobj
+7363 0 obj
+<<
+/Names [(tls1__3_8h_aa2f489c72d9cc424aea5765fde328c28) 3534 0 R (tls1__3_8h_aa601c4712c56caa0b20a73cc5c7d6cf6) 3813 0 R (tls1__3_8h_aa65588fd0832b6a5a7db60707ffa1cc0) 3739 0 R (tls1__3_8h_aa662dca60df65badddc1e0e856c4cde7) 3735 0 R (tls1__3_8h_aa9207c7fe4e471b0c83cd033dc023a49) 3402 0 R (tls1__3_8h_aaa704b6b56f5f74fdaad5b877e9ff5e0) 3439 0 R]
+/Limits [(tls1__3_8h_aa2f489c72d9cc424aea5765fde328c28) (tls1__3_8h_aaa704b6b56f5f74fdaad5b877e9ff5e0)]
+>>
+endobj
+7364 0 obj
+<<
+/Names [(tls1__3_8h_aaaff359295e4b584c446f7d4fd27be25) 3527 0 R (tls1__3_8h_aac0f8b417bb22e204b8f167d80054c8e) 3664 0 R (tls1__3_8h_aac7a8c406b156ca887c6888b34682dbb) 3763 0 R (tls1__3_8h_ab1d7f8d913b1fa59531259ec86f55e9f) 3618 0 R (tls1__3_8h_ab3076eb7d6a67fe36ae77a96571138eb) 3803 0 R (tls1__3_8h_ab46f0386d8f98d1db2ced0dcf90b1182) 3750 0 R]
+/Limits [(tls1__3_8h_aaaff359295e4b584c446f7d4fd27be25) (tls1__3_8h_ab46f0386d8f98d1db2ced0dcf90b1182)]
+>>
+endobj
+7365 0 obj
+<<
+/Names [(tls1__3_8h_ab51d51d7876ee5c968ea17cba18d05bd) 3632 0 R (tls1__3_8h_ab53d544cdcc2ed9a2d48419aa85c9537) 3762 0 R (tls1__3_8h_ab78f7bb814bfba2dee9ce08b0ea1a85c) 3646 0 R (tls1__3_8h_ab8cf2ea30c61636731a446049a93181a) 3442 0 R (tls1__3_8h_ab8ef12fab634c171394422d0ee8baf94) 3150 0 R (tls1__3_8h_abb32cd9141ad1aa4bf07b0abe6374ad1) 3520 0 R]
+/Limits [(tls1__3_8h_ab51d51d7876ee5c968ea17cba18d05bd) (tls1__3_8h_abb32cd9141ad1aa4bf07b0abe6374ad1)]
+>>
+endobj
+7366 0 obj
+<<
+/Names [(tls1__3_8h_abddf8683546c89361c4a6e50bdff0b28) 3812 0 R (tls1__3_8h_abec1420658f3a4247bcb5aa14154b6e6) 3535 0 R (tls1__3_8h_ac12ec152c87531d806610734b2fd181f) 3523 0 R (tls1__3_8h_ac5909a9a61a8f148a5fca14f45e96a51) 3525 0 R (tls1__3_8h_ac6862054ffa24641798cd70bae3a7ae3) 3649 0 R (tls1__3_8h_ac7422f87d3e725f29bcafd8f98dba18a) 3746 0 R]
+/Limits [(tls1__3_8h_abddf8683546c89361c4a6e50bdff0b28) (tls1__3_8h_ac7422f87d3e725f29bcafd8f98dba18a)]
+>>
+endobj
+7367 0 obj
+<<
+/Names [(tls1__3_8h_ac86ed785ce39c6020955310031a657a1) 3638 0 R (tls1__3_8h_ac8954b72bcbbc464c28389c5747773bf) 3634 0 R (tls1__3_8h_ac9878986a7bbcc614ed54916bec7805d) 3508 0 R (tls1__3_8h_acc31fbf250dc76d537fce47379361657) 3754 0 R (tls1__3_8h_acde772ee66a2f66efeaf3be1b7f77283) 3658 0 R (tls1__3_8h_ace1fc9dae6e7200dfd0a662eaf67079b) 3745 0 R]
+/Limits [(tls1__3_8h_ac86ed785ce39c6020955310031a657a1) (tls1__3_8h_ace1fc9dae6e7200dfd0a662eaf67079b)]
+>>
+endobj
+7368 0 obj
+<<
+/Names [(tls1__3_8h_acfb97ea44efc04325334d1a273df53e2) 3635 0 R (tls1__3_8h_ad21cc58ec3fb3407eee2c3729bf6dec2) 3774 0 R (tls1__3_8h_ad5806394d68a0686c653c2898812f310) 3539 0 R (tls1__3_8h_ad72217ba6e6cae3ddc4454bb640223a8) 3743 0 R (tls1__3_8h_ad88b87de987d71d6f44f9c652be4f4d1) 3769 0 R (tls1__3_8h_ad8c5b4de72ef653ee9b32ffd15d247a5) 3619 0 R]
+/Limits [(tls1__3_8h_acfb97ea44efc04325334d1a273df53e2) (tls1__3_8h_ad8c5b4de72ef653ee9b32ffd15d247a5)]
+>>
+endobj
+7369 0 obj
+<<
+/Names [(tls1__3_8h_ad99d010ce10246c2f28dd95d82aacae2) 3614 0 R (tls1__3_8h_ada0646eb6ae96c28f6732940012c9f2b) 3637 0 R (tls1__3_8h_ada3f1f3fa9b684d837200490fbb07c26) 3667 0 R (tls1__3_8h_adb7bc59d1dcf6fffb0d265a92966fd39) 3731 0 R (tls1__3_8h_add4dcdeac40e0b135f1cb39761bfaba0) 3509 0 R (tls1__3_8h_addc28cf3340526efbb1bed511d798e91) 3549 0 R]
+/Limits [(tls1__3_8h_ad99d010ce10246c2f28dd95d82aacae2) (tls1__3_8h_addc28cf3340526efbb1bed511d798e91)]
+>>
+endobj
+7370 0 obj
+<<
+/Names [(tls1__3_8h_ade5e8b3c09f907dfea533f4e63927998) 3510 0 R (tls1__3_8h_adf01762e375d30f644666e9fe3be27c1) 3069 0 R (tls1__3_8h_ae0f7fbd53cd8b03aa1db0c0b4c72ef88) 3808 0 R (tls1__3_8h_ae154ece6999205b2a3ff49fa15ec3eaf) 3546 0 R (tls1__3_8h_ae2e1a44a10d4219f4645a4e99fee009c) 3767 0 R (tls1__3_8h_ae482545ce00b782ff5222bd4e4d815d5) 3524 0 R]
+/Limits [(tls1__3_8h_ade5e8b3c09f907dfea533f4e63927998) (tls1__3_8h_ae482545ce00b782ff5222bd4e4d815d5)]
+>>
+endobj
+7371 0 obj
+<<
+/Names [(tls1__3_8h_ae62b03ae6897545150d9d761d135cd86) 3668 0 R (tls1__3_8h_ae8d85100657628f3fce48fe9e0d4db89) 3752 0 R (tls1__3_8h_ae96bab0a93d664a56710709bcb65ef51) 3747 0 R (tls1__3_8h_aea87c42356a133dfbb72ab79806bac48) 3736 0 R (tls1__3_8h_aea87eed84ae0db3008863f1b05c0440c) 3776 0 R (tls1__3_8h_aeb4652eafac81aeec104d8a76ad860a2) 3740 0 R]
+/Limits [(tls1__3_8h_ae62b03ae6897545150d9d761d135cd86) (tls1__3_8h_aeb4652eafac81aeec104d8a76ad860a2)]
+>>
+endobj
+7372 0 obj
+<<
+/Names [(tls1__3_8h_aefe64fcd97c1648ae7f188013f50c163) 3777 0 R (tls1__3_8h_af00aa3c79fe31d435739c34e4c989835) 3648 0 R (tls1__3_8h_af3fd066a8822f6b8d8c0bab20e908910) 3775 0 R (tls1__3_8h_af4b172387ab1e36244119578e9a1bb2a) 3529 0 R (tls1__3_8h_af4c06a7b9ea8f5fdf71a5a5c2674ace3) 3621 0 R (tls1__3_8h_af4c988184090ef4782044fa78a69045e) 3768 0 R]
+/Limits [(tls1__3_8h_aefe64fcd97c1648ae7f188013f50c163) (tls1__3_8h_af4c988184090ef4782044fa78a69045e)]
+>>
+endobj
+7373 0 obj
+<<
+/Names [(tls1__3_8h_af80869aa9586d1b074f01111780e4ddb) 3772 0 R (tls1__3_8h_afacb94b91c071b8332028b5807b083c8) 3623 0 R (tls1__3_8h_afb40225335cfd9cfc043af5c42a32ffa) 3436 0 R (tls1__3_8h_afca50ec5894e2701729585222f4a7334) 3519 0 R (tls1__3_8h_afd58bdc9a1a5abec5cb8b6861b0901c4) 3655 0 R (tls1__3_8h_source) 3947 0 R]
+/Limits [(tls1__3_8h_af80869aa9586d1b074f01111780e4ddb) (tls1__3_8h_source)]
+>>
+endobj
+7374 0 obj
+<<
+/Names [(tls__bfibe_8h) 3030 0 R (tls__bfibe_8h_a90b472dac9b76fbde7ea27f7a0b8cf78) 4057 0 R (tls__bfibe_8h_aba94d3909b10b680eb3aaf77d93ca1da) 4062 0 R (tls__bfibe_8h_acb237b5ae4bd92b8f6ca90a8b849eb62) 4058 0 R (tls__bfibe_8h_af190453673d997151a7237eba4ecccfe) 4059 0 R (tls__bfibe_8h_source) 4071 0 R]
+/Limits [(tls__bfibe_8h) (tls__bfibe_8h_source)]
+>>
+endobj
+7375 0 obj
+<<
+/Names [(tls__cert__chain_8h) 3031 0 R (tls__cert__chain_8h_aa840f940fbe383f05413a414a5086cea) 4089 0 R (tls__cert__chain_8h_abc0e5fc4c7a025e94eeb2aaa54c5f370) 4088 0 R (tls__cert__chain_8h_source) 4112 0 R (tls__certs_8h) 3032 0 R (tls__certs_8h_a05314a602c0ce93a32732d5ea754de92) 4126 0 R]
+/Limits [(tls__cert__chain_8h) (tls__certs_8h_a05314a602c0ce93a32732d5ea754de92)]
+>>
+endobj
+7376 0 obj
+<<
+/Names [(tls__certs_8h_ab893fde7f330deb4d550d1a63997f55a) 4125 0 R (tls__certs_8h_ad9d8b74186c6a2ac0fd7a16fd36d1481) 4123 0 R (tls__certs_8h_adf42bd5d56522c904033fb0717be6ee1) 4127 0 R (tls__certs_8h_source) 4145 0 R (tls__client__recv_8h) 3033 0 R (tls__client__recv_8h_a05f53888e8be7930e631aaa658cd3e3a) 4218 0 R]
+/Limits [(tls__certs_8h_ab893fde7f330deb4d550d1a63997f55a) (tls__client__recv_8h_a05f53888e8be7930e631aaa658cd3e3a)]
+>>
+endobj
+7377 0 obj
+<<
+/Names [(tls__client__recv_8h_a18fb5d996e783d4d5caca2fd3472c0b3) 4225 0 R (tls__client__recv_8h_a24caae65e02803e80ae173895fd334bf) 4217 0 R (tls__client__recv_8h_a63b1b91f645ec84e1a16ffa74abb44df) 4209 0 R (tls__client__recv_8h_a6ea7cf6c689380612ee6369a53a3e496) 4223 0 R (tls__client__recv_8h_a7251fea497927ca661f1c838826369bf) 4216 0 R (tls__client__recv_8h_a869e9cb9bcd3628093b074ee3a9c5606) 4215 0 R]
+/Limits [(tls__client__recv_8h_a18fb5d996e783d4d5caca2fd3472c0b3) (tls__client__recv_8h_a869e9cb9bcd3628093b074ee3a9c5606)]
+>>
+endobj
+7378 0 obj
+<<
+/Names [(tls__client__recv_8h_a8c5a39e3322ed3abda8fdac275bd8f0d) 4212 0 R (tls__client__recv_8h_a94d98e1c8189a87072c2358bdf106ac7) 4220 0 R (tls__client__recv_8h_a9a3b463b2438583501ecb4330e49e864) 4214 0 R (tls__client__recv_8h_a9caaa2d33c4bd794b44eba99554e6005) 4219 0 R (tls__client__recv_8h_a9fbde1f9d42348a7d60fdc326c705048) 4211 0 R (tls__client__recv_8h_ab1edcc5afbc6ebc5e2f2e6af324be1ba) 4213 0 R]
+/Limits [(tls__client__recv_8h_a8c5a39e3322ed3abda8fdac275bd8f0d) (tls__client__recv_8h_ab1edcc5afbc6ebc5e2f2e6af324be1ba)]
+>>
+endobj
+7379 0 obj
+<<
+/Names [(tls__client__recv_8h_abc61bbc8d5f16a3646531c5d829ab4e9) 4224 0 R (tls__client__recv_8h_ac4016a17dac06d44cf54422a0b6553b2) 4226 0 R (tls__client__recv_8h_ae098040b054f38e7658c29dfc71a7841) 4222 0 R (tls__client__recv_8h_afd248c035d3fc30804461c6509776a68) 4221 0 R (tls__client__recv_8h_source) 4393 0 R (tls__client__send_8h) 3034 0 R]
+/Limits [(tls__client__recv_8h_abc61bbc8d5f16a3646531c5d829ab4e9) (tls__client__send_8h)]
+>>
+endobj
+7380 0 obj
+<<
+/Names [(tls__client__send_8h_a001b7d8bce6fea3da1d821e89b102e36) 4471 0 R (tls__client__send_8h_a08dee8d5bd3df471b1da1ed77a4b9371) 4475 0 R (tls__client__send_8h_a1553ec144ff983a19fbac15287b5650e) 4463 0 R (tls__client__send_8h_a1970aa3fae4d5a9d0166f9975420c8be) 4499 0 R (tls__client__send_8h_a1b05bed69596b34f80fc460710bd1af3) 4473 0 R (tls__client__send_8h_a1f55fbb70c8d9bb96502cbd91d1cdce6) 4462 0 R]
+/Limits [(tls__client__send_8h_a001b7d8bce6fea3da1d821e89b102e36) (tls__client__send_8h_a1f55fbb70c8d9bb96502cbd91d1cdce6)]
+>>
+endobj
+7381 0 obj
+<<
+/Names [(tls__client__send_8h_a2ae6b9eef1b8fa44f42aeede03d166c3) 4466 0 R (tls__client__send_8h_a3426e5597c2646607d74ba45881331a1) 4476 0 R (tls__client__send_8h_a3f2dea2ce7289f8bce2f6dfaac14f6c4) 4460 0 R (tls__client__send_8h_a47426f5d0addf1b5276403d20cb57f43) 4480 0 R (tls__client__send_8h_a5809bb963eb76b8aa7002bae244837aa) 4469 0 R (tls__client__send_8h_a58576f34a1a3600c77e60d9831ac7174) 4465 0 R]
+/Limits [(tls__client__send_8h_a2ae6b9eef1b8fa44f42aeede03d166c3) (tls__client__send_8h_a58576f34a1a3600c77e60d9831ac7174)]
+>>
+endobj
+7382 0 obj
+<<
+/Names [(tls__client__send_8h_a5abfbe6d2e0753c1e9aee4c3731a75cf) 4477 0 R (tls__client__send_8h_a69bcfb300064b7f15307350e7d0124a5) 4459 0 R (tls__client__send_8h_a6c68dc8d23117860735e6d2a37733f1b) 4503 0 R (tls__client__send_8h_a75405e425d1a8734b4d448fa843f75ab) 4464 0 R (tls__client__send_8h_a7c39ce6582f79fc4db8995020c582ea2) 4501 0 R (tls__client__send_8h_a83d64f2525fe60c359db5f2e6502136f) 4478 0 R]
+/Limits [(tls__client__send_8h_a5abfbe6d2e0753c1e9aee4c3731a75cf) (tls__client__send_8h_a83d64f2525fe60c359db5f2e6502136f)]
+>>
+endobj
+7383 0 obj
+<<
+/Names [(tls__client__send_8h_a98a0f43e9052f8230efaee151d650195) 4470 0 R (tls__client__send_8h_a9c81ed54086d15ab4982b68ef57af9de) 4472 0 R (tls__client__send_8h_a9cab659f1afb869e0553aec979dbef57) 4500 0 R (tls__client__send_8h_ab206e386ec23f927c695b39cb165bd33) 4502 0 R (tls__client__send_8h_abee16589c78e98f01d9132aa5ced2c84) 4461 0 R (tls__client__send_8h_ac3814152151d8ad90f5cf22869a7c5ed) 4467 0 R]
+/Limits [(tls__client__send_8h_a98a0f43e9052f8230efaee151d650195) (tls__client__send_8h_ac3814152151d8ad90f5cf22869a7c5ed)]
+>>
+endobj
+7384 0 obj
+<<
+/Names [(tls__client__send_8h_acbe3332ca8c08818211e307c5ddb48c0) 4504 0 R (tls__client__send_8h_ae6b7732d127485cfde84999ddfda0822) 4457 0 R (tls__client__send_8h_ae7c449e4c9fd2eae231da36b4fdaed4d) 4479 0 R (tls__client__send_8h_ae9f1efa7bf9cc9f1d167289728e114aa) 4474 0 R (tls__client__send_8h_aee3012ea76db9592b6f2e3fbacab3cc1) 4458 0 R (tls__client__send_8h_aeeee21f81f578cdfdbd7434f1f5ba619) 4468 0 R]
+/Limits [(tls__client__send_8h_acbe3332ca8c08818211e307c5ddb48c0) (tls__client__send_8h_aeeee21f81f578cdfdbd7434f1f5ba619)]
+>>
+endobj
+7385 0 obj
+<<
+/Names [(tls__client__send_8h_source) 4661 0 R (tls__keys__calc_8h) 3035 0 R (tls__keys__calc_8h_a024aaf0b72dbcf480a7d9107d286f716) 4805 0 R (tls__keys__calc_8h_a039d437970a1f493377a08cb31d96dec) 4736 0 R (tls__keys__calc_8h_a1ebed486a752d2d46461470742670741) 4735 0 R (tls__keys__calc_8h_a2f62f573a6b6cabe93ec2147d4823c6a) 4798 0 R]
+/Limits [(tls__client__send_8h_source) (tls__keys__calc_8h_a2f62f573a6b6cabe93ec2147d4823c6a)]
+>>
+endobj
+7386 0 obj
+<<
+/Names [(tls__keys__calc_8h_a4577af1f5021f2b06b2f9331641a0d1e) 4730 0 R (tls__keys__calc_8h_a51906ad75db829ff0f4d9185498c07bc) 4794 0 R (tls__keys__calc_8h_a5f4c6740b2154c2414a0984653bb2356) 4806 0 R (tls__keys__calc_8h_a657bc15591cfddc543c9908e454cefb1) 4799 0 R (tls__keys__calc_8h_a6c05578c90c439bd0ff35fdcdc02b39b) 4800 0 R (tls__keys__calc_8h_a725431b0b8841d5799e2e305a95a24f8) 4729 0 R]
+/Limits [(tls__keys__calc_8h_a4577af1f5021f2b06b2f9331641a0d1e) (tls__keys__calc_8h_a725431b0b8841d5799e2e305a95a24f8)]
+>>
+endobj
+7387 0 obj
+<<
+/Names [(tls__keys__calc_8h_a78bfe1942bb3e34bc537e89f8f23ad87) 4734 0 R (tls__keys__calc_8h_a7c80470edcd5c41df2776758a8f73bf7) 4792 0 R (tls__keys__calc_8h_a8806c3d2593fca6f70e1765af93bbbc6) 4797 0 R (tls__keys__calc_8h_a8be08a8f8802cf8a4c21deb5db506394) 4804 0 R (tls__keys__calc_8h_a8f0a6b45ba2baf667a3f3db7f2c45817) 4795 0 R (tls__keys__calc_8h_aaa92ece79610e718653811665708f83f) 4803 0 R]
+/Limits [(tls__keys__calc_8h_a78bfe1942bb3e34bc537e89f8f23ad87) (tls__keys__calc_8h_aaa92ece79610e718653811665708f83f)]
+>>
+endobj
+7388 0 obj
+<<
+/Names [(tls__keys__calc_8h_ab4626ca7ee28b8311899148e788712c3) 4731 0 R (tls__keys__calc_8h_ab53120ef3350624efa158b055849babb) 4802 0 R (tls__keys__calc_8h_ac1ec60c7aa252ae5b0f77a7373996efa) 4793 0 R (tls__keys__calc_8h_ac637f846d7e27564dcbb7fb60c48d195) 4733 0 R (tls__keys__calc_8h_acbeac5740057ccd837c02450d4922d71) 4801 0 R (tls__keys__calc_8h_add8404a61a7878b2263a0f646a4ff621) 4732 0 R]
+/Limits [(tls__keys__calc_8h_ab4626ca7ee28b8311899148e788712c3) (tls__keys__calc_8h_add8404a61a7878b2263a0f646a4ff621)]
+>>
+endobj
+7389 0 obj
+<<
+/Names [(tls__keys__calc_8h_ae5bb549f97d541ccc349f71498003fc3) 4796 0 R (tls__keys__calc_8h_source) 4929 0 R (tls__logger_8h) 3036 0 R (tls__logger_8h_a2b301f7e69e5ce3e02c33aad08173456) 5027 0 R (tls__logger_8h_a39ed4d1104d3236eabf2645f694cb835) 5045 0 R (tls__logger_8h_a651d4f36081a25b3faef1650dd09e146) 5042 0 R]
+/Limits [(tls__keys__calc_8h_ae5bb549f97d541ccc349f71498003fc3) (tls__logger_8h_a651d4f36081a25b3faef1650dd09e146)]
+>>
+endobj
+7390 0 obj
+<<
+/Names [(tls__logger_8h_a6b30aace4c91e3ec0e218f8cbc952e89) 5041 0 R (tls__logger_8h_a8d27a3c69395afe39b1a0eef660ead80) 5046 0 R (tls__logger_8h_a995bd949a028c783b2d017bb0a90d1d6) 5043 0 R (tls__logger_8h_a9c5a0178dbefc32b05346ed2cb72fb8d) 5026 0 R (tls__logger_8h_aa044d181bcf7e7b069c765f0f61666c3) 5024 0 R (tls__logger_8h_abd169a995e32ba3382dc2ac1e845ce7e) 5047 0 R]
+/Limits [(tls__logger_8h_a6b30aace4c91e3ec0e218f8cbc952e89) (tls__logger_8h_abd169a995e32ba3382dc2ac1e845ce7e)]
+>>
+endobj
+7391 0 obj
+<<
+/Names [(tls__logger_8h_ae2132d5a0dc6fe9904607b60d73cd4dd) 5023 0 R (tls__logger_8h_af93c1a98069834a92f0e5e950a26a5d2) 5044 0 R (tls__logger_8h_afa1794a7a7edf39877bf04448eb73322) 5025 0 R (tls__logger_8h_source) 5120 0 R (tls__octads_8h) 2935 0 R (tls__octads_8h_a0efa0fde372b7c30c52f2a5bb87b53d8) 5170 0 R]
+/Limits [(tls__logger_8h_ae2132d5a0dc6fe9904607b60d73cd4dd) (tls__octads_8h_a0efa0fde372b7c30c52f2a5bb87b53d8)]
+>>
+endobj
+7392 0 obj
+<<
+/Names [(tls__octads_8h_a0f21c9f01a4618b2ba2fa35696091b15) 5165 0 R (tls__octads_8h_a10136983b6ac2a3a8c83db12b30684b7) 5174 0 R (tls__octads_8h_a24550ec574b05d7c2757427e513f7f0d) 5173 0 R (tls__octads_8h_a33dec0d7edc1aee475b06eaf181422d9) 5172 0 R (tls__octads_8h_a3a80e4927697fcac5933d578387fbf5f) 5178 0 R (tls__octads_8h_a3efcd968dd7f10d5c1657a3459572313) 5169 0 R]
+/Limits [(tls__octads_8h_a0f21c9f01a4618b2ba2fa35696091b15) (tls__octads_8h_a3efcd968dd7f10d5c1657a3459572313)]
+>>
+endobj
+7393 0 obj
+<<
+/Names [(tls__octads_8h_a45b0fd64bac9cb68498ba9780645eef0) 5175 0 R (tls__octads_8h_a6b30111fa707d3dca3a1e3c8f8cc89de) 5179 0 R (tls__octads_8h_a6ff7f2532a22366f0013bc41397129fd) 5163 0 R (tls__octads_8h_a74598758cc17201ad6b6dc9c9fb66191) 5168 0 R (tls__octads_8h_a87568e9d7e93086c6236b574ab1b1cb3) 5177 0 R (tls__octads_8h_ac32bd2227bddd61a17b0de38d3023762) 5164 0 R]
+/Limits [(tls__octads_8h_a45b0fd64bac9cb68498ba9780645eef0) (tls__octads_8h_ac32bd2227bddd61a17b0de38d3023762)]
+>>
+endobj
+7394 0 obj
+<<
+/Names [(tls__octads_8h_ac4412f87c137a3bc3be78ff34b0330db) 5176 0 R (tls__octads_8h_acdb901eb60607373df25e808e9f0c03a) 5166 0 R (tls__octads_8h_acee64048f5c24fde7b69662b64fd05df) 5167 0 R (tls__octads_8h_aeb68aaff5654f79b11bf1489c6621d32) 5171 0 R (tls__octads_8h_source) 5260 0 R (tls__pqibe_8h) 3037 0 R]
+/Limits [(tls__octads_8h_ac4412f87c137a3bc3be78ff34b0330db) (tls__pqibe_8h)]
+>>
+endobj
+7395 0 obj
+<<
+/Names [(tls__pqibe_8h_a08f71b6a3ad349575d16e29e7b923a94) 5289 0 R (tls__pqibe_8h_a850e9c87016ac49ff175a53dd945a94e) 5290 0 R (tls__pqibe_8h_source) 5300 0 R (tls__protocol_8h) 3038 0 R (tls__protocol_8h_a0cb98cf50652da571def63ff5a5b713e) 5332 0 R (tls__protocol_8h_a1e67c183344f2c6b2c06df64dbbf763b) 5326 0 R]
+/Limits [(tls__pqibe_8h_a08f71b6a3ad349575d16e29e7b923a94) (tls__protocol_8h_a1e67c183344f2c6b2c06df64dbbf763b)]
+>>
+endobj
+7396 0 obj
+<<
+/Names [(tls__protocol_8h_a30ba7a0e9d9e20e131c092775962fadc) 5329 0 R (tls__protocol_8h_a46e777beb241ab49e05f1af9d2c1c303) 5328 0 R (tls__protocol_8h_a4b5ab8c9441bfd0cacccb79816e85f95) 5333 0 R (tls__protocol_8h_ab104ed5e5a9bab2c1387314c5ac3317c) 5331 0 R (tls__protocol_8h_aef9cfbd06be159bf12ad0d119fa6d55c) 5330 0 R (tls__protocol_8h_source) 5359 0 R]
+/Limits [(tls__protocol_8h_a30ba7a0e9d9e20e131c092775962fadc) (tls__protocol_8h_source)]
+>>
+endobj
+7397 0 obj
+<<
+/Names [(tls__sal_8h) 3039 0 R (tls__sal_8h_a06f2be86c6a75520db79ffabfc420b6c) 5464 0 R (tls__sal_8h_a0793a30d3c3866ab32b753b92fb0a07d) 5408 0 R (tls__sal_8h_a13449a33ffd970e78387f523d44d131b) 5458 0 R (tls__sal_8h_a1905f28ad597708f1a8bd5e93f8bc51c) 5461 0 R (tls__sal_8h_a23a7cc46d32b4f319aaf18d65527d309) 5466 0 R]
+/Limits [(tls__sal_8h) (tls__sal_8h_a23a7cc46d32b4f319aaf18d65527d309)]
+>>
+endobj
+7398 0 obj
+<<
+/Names [(tls__sal_8h_a2895671c64db7244ca7de9fe1bf143e8) 5460 0 R (tls__sal_8h_a29234294cedf38c4bcde0628d60eb574) 5403 0 R (tls__sal_8h_a4825a14218af99362d0183f71d9cbaf2) 5404 0 R (tls__sal_8h_a62fb33997562fa9f4f3b29c02b47a77f) 5401 0 R (tls__sal_8h_a72c6f91ca8ee5f1cace7b1e49556f344) 5463 0 R (tls__sal_8h_a808235992932012ef83baa255cbc5dd6) 5402 0 R]
+/Limits [(tls__sal_8h_a2895671c64db7244ca7de9fe1bf143e8) (tls__sal_8h_a808235992932012ef83baa255cbc5dd6)]
+>>
+endobj
+7399 0 obj
+<<
+/Names [(tls__sal_8h_a8182a146d9381e90b2bdd98a00d71981) 5467 0 R (tls__sal_8h_a8d303dcc6bf5b5bf5edd51e38c477f2d) 5409 0 R (tls__sal_8h_a94dad73db6a55397ab0b94f804255c27) 5472 0 R (tls__sal_8h_a9e7208079886cace1d02513ea7fe6a26) 5465 0 R (tls__sal_8h_aa19daa6fb66babf69e7803cebd799822) 5469 0 R (tls__sal_8h_aaaf5555a4ac9a916b0ef075246536c15) 5468 0 R]
+/Limits [(tls__sal_8h_a8182a146d9381e90b2bdd98a00d71981) (tls__sal_8h_aaaf5555a4ac9a916b0ef075246536c15)]
+>>
+endobj
+7400 0 obj
+<<
+/Names [(tls__sal_8h_aab75c91cf197022f100d94374f45a881) 5457 0 R (tls__sal_8h_aace924671f2ab6d930506ac1b5a369e4) 5471 0 R (tls__sal_8h_ab76e7d66aad85296057c6b5e0a730e87) 5406 0 R (tls__sal_8h_abb77bcf10cb38c7312a7a07b0b951732) 5462 0 R (tls__sal_8h_ac019b5b53dd056f21d22ecc8d2e83d3e) 5473 0 R (tls__sal_8h_ac77eb18d9c8ce4ed73d35849a324710c) 5459 0 R]
+/Limits [(tls__sal_8h_aab75c91cf197022f100d94374f45a881) (tls__sal_8h_ac77eb18d9c8ce4ed73d35849a324710c)]
+>>
+endobj
+7401 0 obj
+<<
+/Names [(tls__sal_8h_aeff2ed65094d7367f61fde67c57f1a3f) 5405 0 R (tls__sal_8h_af0a45e41d3656ef9c63525b04ce9128a) 5407 0 R (tls__sal_8h_af3c6cdb6ef9337ef5da8a9a7eaf499fe) 5470 0 R (tls__sal_8h_source) 5595 0 R (tls__sockets_8h) 3040 0 R (tls__sockets_8h_a1a1abbec5212c04c6e6bc6b148a1c52b) 5646 0 R]
+/Limits [(tls__sal_8h_aeff2ed65094d7367f61fde67c57f1a3f) (tls__sockets_8h_a1a1abbec5212c04c6e6bc6b148a1c52b)]
+>>
+endobj
+7402 0 obj
+<<
+/Names [(tls__sockets_8h_a5013aef55fe502aeb151cb0afb1eb9c1) 5644 0 R (tls__sockets_8h_a7541b8517df33c37c33a18e704e160cf) 5645 0 R (tls__sockets_8h_a9e377d7cf9f9307fa2335b3b6aaa92a4) 5661 0 R (tls__sockets_8h_aa6e4a0ba6948d599480de3449b0166ad) 5663 0 R (tls__sockets_8h_ac0c18423ccde1870aebe4a0746a2de5b) 5662 0 R (tls__sockets_8h_acc32c3ae0be546ae354fdfddba021640) 5664 0 R]
+/Limits [(tls__sockets_8h_a5013aef55fe502aeb151cb0afb1eb9c1) (tls__sockets_8h_acc32c3ae0be546ae354fdfddba021640)]
+>>
+endobj
+7403 0 obj
+<<
+/Names [(tls__sockets_8h_ad4cecfe2f93ed49bda489b41e1673b5f) 5659 0 R (tls__sockets_8h_adb86bfbca7563c85fa80130b8e9ca3c1) 5660 0 R (tls__sockets_8h_source) 5696 0 R (tls__tickets_8h) 3041 0 R (tls__tickets_8h_a026e3569450bc98105cb58239c05e771) 5752 0 R (tls__tickets_8h_a3a234d8d5c97ca669c759362ce10da54) 5751 0 R]
+/Limits [(tls__sockets_8h_ad4cecfe2f93ed49bda489b41e1673b5f) (tls__tickets_8h_a3a234d8d5c97ca669c759362ce10da54)]
+>>
+endobj
+7404 0 obj
+<<
+/Names [(tls__tickets_8h_a4cc21b3e154a0337557dc9baa1cdde5a) 5750 0 R (tls__tickets_8h_abb28b61694dab27674754d8c974975c2) 5753 0 R (tls__tickets_8h_source) 5786 0 R (tls__wifi_8h) 3042 0 R (tls__wifi_8h_source) 5787 0 R (tls__x509_8h) 3043 0 R]
+/Limits [(tls__tickets_8h_a4cc21b3e154a0337557dc9baa1cdde5a) (tls__x509_8h)]
+>>
+endobj
+7405 0 obj
+<<
+/Names [(tls__x509_8h_a032e98c7594a00ff27e6e71be783bf1d) 5898 0 R (tls__x509_8h_a08072852023e718409b709916f4478cd) 5912 0 R (tls__x509_8h_a18ffa7f3ffe42d28ef6e9264fae10f69) 5907 0 R (tls__x509_8h_a26ebd69b7048f0ec457aed53cd2ab4b2) 5914 0 R (tls__x509_8h_a2763d07a5f34925fb4a99817d4140573) 5812 0 R (tls__x509_8h_a27885f5e775115282ef665fcf7fc486a) 5919 0 R]
+/Limits [(tls__x509_8h_a032e98c7594a00ff27e6e71be783bf1d) (tls__x509_8h_a27885f5e775115282ef665fcf7fc486a)]
+>>
+endobj
+7406 0 obj
+<<
+/Names [(tls__x509_8h_a29762ed96ca7d3ccf89be8c496cb9ebb) 5897 0 R (tls__x509_8h_a30c58503b1c92df4b7164ae795b56d1b) 5908 0 R (tls__x509_8h_a30e204cf860fbe7790d3ffa14e45878e) 5816 0 R (tls__x509_8h_a319fe0afe56c81a5571f22690a68921d) 5917 0 R (tls__x509_8h_a3a434044d9c3a7c32547906e7deea086) 5909 0 R (tls__x509_8h_a3ae4aa6c7903bd00fc86312f4676d675) 5910 0 R]
+/Limits [(tls__x509_8h_a29762ed96ca7d3ccf89be8c496cb9ebb) (tls__x509_8h_a3ae4aa6c7903bd00fc86312f4676d675)]
+>>
+endobj
+7407 0 obj
+<<
+/Names [(tls__x509_8h_a4a71fcb7d2942084a57e335d27b98f3a) 5916 0 R (tls__x509_8h_a4cfd7b1ce0abf2a824f8264a8b889884) 5918 0 R (tls__x509_8h_a4ea66d8861556e4cb5494fedcae31e09) 5904 0 R (tls__x509_8h_a56c084dad2b13fc39219718e2c9ea08b) 5920 0 R (tls__x509_8h_a57a0487efa9bf85e480c13eb64e3a0d9) 5913 0 R (tls__x509_8h_a5d088c99b89447f5acabcd147c303f09) 5820 0 R]
+/Limits [(tls__x509_8h_a4a71fcb7d2942084a57e335d27b98f3a) (tls__x509_8h_a5d088c99b89447f5acabcd147c303f09)]
+>>
+endobj
+7408 0 obj
+<<
+/Names [(tls__x509_8h_a5e369d22599c01a332492a07d08a0f47) 5899 0 R (tls__x509_8h_a5ee39c05f4370aae62248dbf2b6ff542) 5818 0 R (tls__x509_8h_a63098f816389dc75a1f6a65ee054a622) 5905 0 R (tls__x509_8h_a63727d4ec7bf088c3e114441725dd3c8) 5922 0 R (tls__x509_8h_a66695c60281f55b5dc7c4ef8032cbdea) 5901 0 R (tls__x509_8h_a782bd259401c3866aab10943cadab704) 5900 0 R]
+/Limits [(tls__x509_8h_a5e369d22599c01a332492a07d08a0f47) (tls__x509_8h_a782bd259401c3866aab10943cadab704)]
+>>
+endobj
+7409 0 obj
+<<
+/Names [(tls__x509_8h_a7a49b7fe3b98b5bdee0ea00cda616b3f) 5821 0 R (tls__x509_8h_a7e4c63b8a91d9debc4337994b1fc2b95) 5822 0 R (tls__x509_8h_a7e7e2672eddbe00a3ded84a2d65046d0) 5823 0 R (tls__x509_8h_a8b27e013d3e6af063bb660fd41529a71) 5923 0 R (tls__x509_8h_a99dcbac6d2b5bed887178a19ebe012fc) 5915 0 R (tls__x509_8h_aa4f3b44079b42b4abe5e0699a9f3781a) 5902 0 R]
+/Limits [(tls__x509_8h_a7a49b7fe3b98b5bdee0ea00cda616b3f) (tls__x509_8h_aa4f3b44079b42b4abe5e0699a9f3781a)]
+>>
+endobj
+7410 0 obj
+<<
+/Names [(tls__x509_8h_aaaea4c5d93fd7ec8cceb7f632cb9b5d6) 5817 0 R (tls__x509_8h_ab394bd87c3a26068186a0152dbcbd202) 5813 0 R (tls__x509_8h_abf031319593095cab51fce85367b5c84) 5906 0 R (tls__x509_8h_ac4d3fa6ca7b0008cd109057f3620344b) 5815 0 R (tls__x509_8h_adb2680da06573ec6cd27305f778a6609) 5814 0 R (tls__x509_8h_ae05d7020ae2dac500d00452e36bc4b8d) 5911 0 R]
+/Limits [(tls__x509_8h_aaaea4c5d93fd7ec8cceb7f632cb9b5d6) (tls__x509_8h_ae05d7020ae2dac500d00452e36bc4b8d)]
+>>
+endobj
+7411 0 obj
+<<
+/Names [(tls__x509_8h_ae95cc4b48cfce918f4410032436b0953) 5903 0 R (tls__x509_8h_af15f220eebf42393d74cd0338e4a6471) 5896 0 R (tls__x509_8h_af9600e0331e171fd6f06598cff2a9ee5) 5819 0 R (tls__x509_8h_afac5896b24f8e6d2427daa60dddae297) 5921 0 R (tls__x509_8h_source) 6084 0 R]
+/Limits [(tls__x509_8h_ae95cc4b48cfce918f4410032436b0953) (tls__x509_8h_source)]
+>>
+endobj
+7412 0 obj
+<<
+/Kids [7164 0 R 7165 0 R 7166 0 R 7167 0 R 7168 0 R 7169 0 R]
+/Limits [(Doc-Start) (class_e_c_c_x08_class_a5a1bf071f9ddd7e91f55276c01489c57)]
+>>
+endobj
+7413 0 obj
+<<
+/Kids [7170 0 R 7171 0 R 7172 0 R 7173 0 R 7174 0 R 7175 0 R]
+/Limits [(class_e_c_c_x08_class_a650b127e87e9da84b682288a3fb4f21d) (md_src_arduino__r_e_a_d_m_e_autotoc_md8)]
+>>
+endobj
+7414 0 obj
+<<
+/Kids [7176 0 R 7177 0 R 7178 0 R 7179 0 R 7180 0 R 7181 0 R]
+/Limits [(page.1) (page.130)]
+>>
+endobj
+7415 0 obj
+<<
+/Kids [7182 0 R 7183 0 R 7184 0 R 7185 0 R 7186 0 R 7187 0 R]
+/Limits [(page.131) (page.163)]
+>>
+endobj
+7416 0 obj
+<<
+/Kids [7188 0 R 7189 0 R 7190 0 R 7191 0 R 7192 0 R 7193 0 R]
+/Limits [(page.164) (page.45)]
+>>
+endobj
+7417 0 obj
+<<
+/Kids [7194 0 R 7195 0 R 7196 0 R 7197 0 R 7198 0 R 7199 0 R]
+/Limits [(page.46) (page.78)]
+>>
+endobj
+7418 0 obj
+<<
+/Kids [7200 0 R 7201 0 R 7202 0 R 7203 0 R 7204 0 R 7205 0 R]
+/Limits [(page.79) (section*.20)]
+>>
+endobj
+7419 0 obj
+<<
+/Kids [7206 0 R 7207 0 R 7208 0 R 7209 0 R 7210 0 R 7211 0 R]
+/Limits [(section*.21) (section.5.7)]
+>>
+endobj
+7420 0 obj
+<<
+/Kids [7212 0 R 7213 0 R 7214 0 R 7215 0 R 7216 0 R 7217 0 R]
+/Limits [(section.5.8) (struct_t_l_s__session)]
+>>
+endobj
+7421 0 obj
+<<
+/Kids [7218 0 R 7219 0 R 7220 0 R 7221 0 R 7222 0 R 7223 0 R]
+/Limits [(struct_t_l_s__session_a024f4141e00823f6d0c8367405d25793) (structcrypto_aabf86e64107fd26ecb2862fc6bb7ad00)]
+>>
+endobj
+7422 0 obj
+<<
+/Kids [7224 0 R 7225 0 R 7226 0 R 7227 0 R 7228 0 R 7229 0 R]
+/Limits [(structcrypto_aee54e28a2fe73a7f1bafd7c946430a22) (subsection.1.1.1)]
+>>
+endobj
+7423 0 obj
+<<
+/Kids [7230 0 R 7231 0 R 7232 0 R 7233 0 R 7234 0 R 7235 0 R]
+/Limits [(subsection.1.1.2) (subsection.6.23.1)]
+>>
+endobj
+7424 0 obj
+<<
+/Kids [7236 0 R 7237 0 R 7238 0 R 7239 0 R 7240 0 R 7241 0 R]
+/Limits [(subsection.6.23.2) (subsubsection.5.4.2.2)]
+>>
+endobj
+7425 0 obj
+<<
+/Kids [7242 0 R 7243 0 R 7244 0 R 7245 0 R 7246 0 R 7247 0 R]
+/Limits [(subsubsection.5.4.2.3) (subsubsection.5.9.2.23)]
+>>
+endobj
+7426 0 obj
+<<
+/Kids [7248 0 R 7249 0 R 7250 0 R 7251 0 R 7252 0 R 7253 0 R]
+/Limits [(subsubsection.5.9.2.24) (subsubsection.6.1.2.12)]
+>>
+endobj
+7427 0 obj
+<<
+/Kids [7254 0 R 7255 0 R 7256 0 R 7257 0 R 7258 0 R 7259 0 R]
+/Limits [(subsubsection.6.1.2.120) (subsubsection.6.1.2.152)]
+>>
+endobj
+7428 0 obj
+<<
+/Kids [7260 0 R 7261 0 R 7262 0 R 7263 0 R 7264 0 R 7265 0 R]
+/Limits [(subsubsection.6.1.2.153) (subsubsection.6.1.2.2)]
+>>
+endobj
+7429 0 obj
+<<
+/Kids [7266 0 R 7267 0 R 7268 0 R 7269 0 R 7270 0 R 7271 0 R]
+/Limits [(subsubsection.6.1.2.20) (subsubsection.6.1.2.52)]
+>>
+endobj
+7430 0 obj
+<<
+/Kids [7272 0 R 7273 0 R 7274 0 R 7275 0 R 7276 0 R 7277 0 R]
+/Limits [(subsubsection.6.1.2.53) (subsubsection.6.1.2.85)]
+>>
+endobj
+7431 0 obj
+<<
+/Kids [7278 0 R 7279 0 R 7280 0 R 7281 0 R 7282 0 R 7283 0 R]
+/Limits [(subsubsection.6.1.2.86) (subsubsection.6.11.2.21)]
+>>
+endobj
+7432 0 obj
+<<
+/Kids [7284 0 R 7285 0 R 7286 0 R 7287 0 R 7288 0 R 7289 0 R]
+/Limits [(subsubsection.6.11.2.22) (subsubsection.6.13.2.6)]
+>>
+endobj
+7433 0 obj
+<<
+/Kids [7290 0 R 7291 0 R 7292 0 R 7293 0 R 7294 0 R 7295 0 R]
+/Limits [(subsubsection.6.13.2.7) (subsubsection.6.21.2.2)]
+>>
+endobj
+7434 0 obj
+<<
+/Kids [7296 0 R 7297 0 R 7298 0 R 7299 0 R 7300 0 R 7301 0 R]
+/Limits [(subsubsection.6.21.2.3) (subsubsection.6.25.2.5)]
+>>
+endobj
+7435 0 obj
+<<
+/Kids [7302 0 R 7303 0 R 7304 0 R 7305 0 R 7306 0 R 7307 0 R]
+/Limits [(subsubsection.6.25.2.6) (subsubsection.6.31.3.3)]
+>>
+endobj
+7436 0 obj
+<<
+/Kids [7308 0 R 7309 0 R 7310 0 R 7311 0 R 7312 0 R 7313 0 R]
+/Limits [(subsubsection.6.31.3.4) (subsubsection.6.9.2.6)]
+>>
+endobj
+7437 0 obj
+<<
+/Kids [7314 0 R 7315 0 R 7316 0 R 7317 0 R 7318 0 R 7319 0 R]
+/Limits [(subsubsection.6.9.2.7) (table.6.128)]
+>>
+endobj
+7438 0 obj
+<<
+/Kids [7320 0 R 7321 0 R 7322 0 R 7323 0 R 7324 0 R 7325 0 R]
+/Limits [(table.6.129) (table.6.160)]
+>>
+endobj
+7439 0 obj
+<<
+/Kids [7326 0 R 7327 0 R 7328 0 R 7329 0 R 7330 0 R 7331 0 R]
+/Limits [(table.6.161) (table.6.44)]
+>>
+endobj
+7440 0 obj
+<<
+/Kids [7332 0 R 7333 0 R 7334 0 R 7335 0 R 7336 0 R 7337 0 R]
+/Limits [(table.6.45) (table.6.77)]
+>>
+endobj
+7441 0 obj
+<<
+/Kids [7338 0 R 7339 0 R 7340 0 R 7341 0 R 7342 0 R 7343 0 R]
+/Limits [(table.6.78) (tls1__3_8h_a14a099c64e2db7a86755e723a6fc003f)]
+>>
+endobj
+7442 0 obj
+<<
+/Kids [7344 0 R 7345 0 R 7346 0 R 7347 0 R 7348 0 R 7349 0 R]
+/Limits [(tls1__3_8h_a167e5f8ab01015ba2b24bf9467b8a835) (tls1__3_8h_a3ac18852b5f71d1499f5e1536311b12a)]
+>>
+endobj
+7443 0 obj
+<<
+/Kids [7350 0 R 7351 0 R 7352 0 R 7353 0 R 7354 0 R 7355 0 R]
+/Limits [(tls1__3_8h_a3bdac7e874fc054099ed13e2a11e9a0a) (tls1__3_8h_a6b1381fd0d59dde7504bb25677c05034)]
+>>
+endobj
+7444 0 obj
+<<
+/Kids [7356 0 R 7357 0 R 7358 0 R 7359 0 R 7360 0 R 7361 0 R]
+/Limits [(tls1__3_8h_a6c3df225e23ad8a213f3e2fd8b027d71) (tls1__3_8h_a9cea33bd124bea9c85bd4c49218bcf18)]
+>>
+endobj
+7445 0 obj
+<<
+/Kids [7362 0 R 7363 0 R 7364 0 R 7365 0 R 7366 0 R 7367 0 R]
+/Limits [(tls1__3_8h_a9dfa578e14a4c779938817cf715c9849) (tls1__3_8h_ace1fc9dae6e7200dfd0a662eaf67079b)]
+>>
+endobj
+7446 0 obj
+<<
+/Kids [7368 0 R 7369 0 R 7370 0 R 7371 0 R 7372 0 R 7373 0 R]
+/Limits [(tls1__3_8h_acfb97ea44efc04325334d1a273df53e2) (tls1__3_8h_source)]
+>>
+endobj
+7447 0 obj
+<<
+/Kids [7374 0 R 7375 0 R 7376 0 R 7377 0 R 7378 0 R 7379 0 R]
+/Limits [(tls__bfibe_8h) (tls__client__send_8h)]
+>>
+endobj
+7448 0 obj
+<<
+/Kids [7380 0 R 7381 0 R 7382 0 R 7383 0 R 7384 0 R 7385 0 R]
+/Limits [(tls__client__send_8h_a001b7d8bce6fea3da1d821e89b102e36) (tls__keys__calc_8h_a2f62f573a6b6cabe93ec2147d4823c6a)]
+>>
+endobj
+7449 0 obj
+<<
+/Kids [7386 0 R 7387 0 R 7388 0 R 7389 0 R 7390 0 R 7391 0 R]
+/Limits [(tls__keys__calc_8h_a4577af1f5021f2b06b2f9331641a0d1e) (tls__octads_8h_a0efa0fde372b7c30c52f2a5bb87b53d8)]
+>>
+endobj
+7450 0 obj
+<<
+/Kids [7392 0 R 7393 0 R 7394 0 R 7395 0 R 7396 0 R 7397 0 R]
+/Limits [(tls__octads_8h_a0f21c9f01a4618b2ba2fa35696091b15) (tls__sal_8h_a23a7cc46d32b4f319aaf18d65527d309)]
+>>
+endobj
+7451 0 obj
+<<
+/Kids [7398 0 R 7399 0 R 7400 0 R 7401 0 R 7402 0 R 7403 0 R]
+/Limits [(tls__sal_8h_a2895671c64db7244ca7de9fe1bf143e8) (tls__tickets_8h_a3a234d8d5c97ca669c759362ce10da54)]
+>>
+endobj
+7452 0 obj
+<<
+/Kids [7404 0 R 7405 0 R 7406 0 R 7407 0 R 7408 0 R 7409 0 R]
+/Limits [(tls__tickets_8h_a4cc21b3e154a0337557dc9baa1cdde5a) (tls__x509_8h_aa4f3b44079b42b4abe5e0699a9f3781a)]
+>>
+endobj
+7453 0 obj
+<<
+/Kids [7410 0 R 7411 0 R]
+/Limits [(tls__x509_8h_aaaea4c5d93fd7ec8cceb7f632cb9b5d6) (tls__x509_8h_source)]
+>>
+endobj
+7454 0 obj
+<<
+/Kids [7412 0 R 7413 0 R 7414 0 R 7415 0 R 7416 0 R 7417 0 R]
+/Limits [(Doc-Start) (page.78)]
+>>
+endobj
+7455 0 obj
+<<
+/Kids [7418 0 R 7419 0 R 7420 0 R 7421 0 R 7422 0 R 7423 0 R]
+/Limits [(page.79) (subsection.6.23.1)]
+>>
+endobj
+7456 0 obj
+<<
+/Kids [7424 0 R 7425 0 R 7426 0 R 7427 0 R 7428 0 R 7429 0 R]
+/Limits [(subsection.6.23.2) (subsubsection.6.1.2.52)]
+>>
+endobj
+7457 0 obj
+<<
+/Kids [7430 0 R 7431 0 R 7432 0 R 7433 0 R 7434 0 R 7435 0 R]
+/Limits [(subsubsection.6.1.2.53) (subsubsection.6.31.3.3)]
+>>
+endobj
+7458 0 obj
+<<
+/Kids [7436 0 R 7437 0 R 7438 0 R 7439 0 R 7440 0 R 7441 0 R]
+/Limits [(subsubsection.6.31.3.4) (tls1__3_8h_a14a099c64e2db7a86755e723a6fc003f)]
+>>
+endobj
+7459 0 obj
+<<
+/Kids [7442 0 R 7443 0 R 7444 0 R 7445 0 R 7446 0 R 7447 0 R]
+/Limits [(tls1__3_8h_a167e5f8ab01015ba2b24bf9467b8a835) (tls__client__send_8h)]
+>>
+endobj
+7460 0 obj
+<<
+/Kids [7448 0 R 7449 0 R 7450 0 R 7451 0 R 7452 0 R 7453 0 R]
+/Limits [(tls__client__send_8h_a001b7d8bce6fea3da1d821e89b102e36) (tls__x509_8h_source)]
+>>
+endobj
+7461 0 obj
+<<
+/Kids [7454 0 R 7455 0 R 7456 0 R 7457 0 R 7458 0 R 7459 0 R]
+/Limits [(Doc-Start) (tls__client__send_8h)]
+>>
+endobj
+7462 0 obj
+<<
+/Kids [7460 0 R]
+/Limits [(tls__client__send_8h_a001b7d8bce6fea3da1d821e89b102e36) (tls__x509_8h_source)]
+>>
+endobj
+7463 0 obj
+<<
+/Kids [7461 0 R 7462 0 R]
+/Limits [(Doc-Start) (tls__x509_8h_source)]
+>>
+endobj
+7464 0 obj
+<<
+/Dests 7463 0 R
+>>
+endobj
+7465 0 obj
+<<
+/Type /Catalog
+/Pages 7162 0 R
+/Outlines 7163 0 R
+/Names 7464 0 R
+/PageMode/UseOutlines/PageLabels<</Nums[0<</S/a>>2<</S/r>>16<</S/D>>]>>
+/OpenAction 2253 0 R
+>>
+endobj
+7466 0 obj
+<<
+/Producer (MiKTeX pdfTeX-1.40.24)
+/Author()/Title(\376\377\000T\000I\000I\000\040\000T\000L\000S\0001\000.\0003)/Subject(\376\377\000T\000L\000S\000\040\0001\000.\0003)/Creator(LaTeX with hyperref)/Keywords()
+/CreationDate (D:20230117104432+04'00')
+/ModDate (D:20230117104432+04'00')
+/Trapped /False
+/PTEX.Fullbanner (This is MiKTeX-pdfTeX 4.13.0 (1.40.24))
+>>
+endobj
+xref
+0 7467
+0000000000 65535 f 
+0000000015 00000 n 
+0000240016 00000 n 
+0001250767 00000 n 
+0000000060 00000 n 
+0000000175 00000 n 
+0000240202 00000 n 
+0001250660 00000 n 
+0000000222 00000 n 
+0000000311 00000 n 
+0000240326 00000 n 
+0001250588 00000 n 
+0000000363 00000 n 
+0000000453 00000 n 
+0000240450 00000 n 
+0001250515 00000 n 
+0000000506 00000 n 
+0000000662 00000 n 
+0000243457 00000 n 
+0001250406 00000 n 
+0000000710 00000 n 
+0000000816 00000 n 
+0000249036 00000 n 
+0001250332 00000 n 
+0000000869 00000 n 
+0000001065 00000 n 
+0000250925 00000 n 
+0001250258 00000 n 
+0000001118 00000 n 
+0000001299 00000 n 
+0000254385 00000 n 
+0001250133 00000 n 
+0000001345 00000 n 
+0000001562 00000 n 
+0000254573 00000 n 
+0001250072 00000 n 
+0000001610 00000 n 
+0000002012 00000 n 
+0000263393 00000 n 
+0001249946 00000 n 
+0000002058 00000 n 
+0000002204 00000 n 
+0000263454 00000 n 
+0001249885 00000 n 
+0000002252 00000 n 
+0000002380 00000 n 
+0000271391 00000 n 
+0001249759 00000 n 
+0000002426 00000 n 
+0000002519 00000 n 
+0000271452 00000 n 
+0001249698 00000 n 
+0000002567 00000 n 
+0000002665 00000 n 
+0000275450 00000 n 
+0001249569 00000 n 
+0000002711 00000 n 
+0000002897 00000 n 
+0000275574 00000 n 
+0001249457 00000 n 
+0000002945 00000 n 
+0000003116 00000 n 
+0000275698 00000 n 
+0001249383 00000 n 
+0000003169 00000 n 
+0000003332 00000 n 
+0000275759 00000 n 
+0001249272 00000 n 
+0000003385 00000 n 
+0000003543 00000 n 
+0000275883 00000 n 
+0001249198 00000 n 
+0000003601 00000 n 
+0000003701 00000 n 
+0000277959 00000 n 
+0001249111 00000 n 
+0000003759 00000 n 
+0000003834 00000 n 
+0000278084 00000 n 
+0001249024 00000 n 
+0000003892 00000 n 
+0000003972 00000 n 
+0000278209 00000 n 
+0001248937 00000 n 
+0000004030 00000 n 
+0000004105 00000 n 
+0000278334 00000 n 
+0001248850 00000 n 
+0000004163 00000 n 
+0000004243 00000 n 
+0000278458 00000 n 
+0001248763 00000 n 
+0000004301 00000 n 
+0000004401 00000 n 
+0000278583 00000 n 
+0001248676 00000 n 
+0000004459 00000 n 
+0000004554 00000 n 
+0000278708 00000 n 
+0001248601 00000 n 
+0000004612 00000 n 
+0000004713 00000 n 
+0000286465 00000 n 
+0001248510 00000 n 
+0000004762 00000 n 
+0000004954 00000 n 
+0000288472 00000 n 
+0001248379 00000 n 
+0000005003 00000 n 
+0000005193 00000 n 
+0000289906 00000 n 
+0001248300 00000 n 
+0000005247 00000 n 
+0000005411 00000 n 
+0000289968 00000 n 
+0001248182 00000 n 
+0000005465 00000 n 
+0000005624 00000 n 
+0000290093 00000 n 
+0001248103 00000 n 
+0000005683 00000 n 
+0000005807 00000 n 
+0000290219 00000 n 
+0001248010 00000 n 
+0000005866 00000 n 
+0000005957 00000 n 
+0000290345 00000 n 
+0001247917 00000 n 
+0000006016 00000 n 
+0000006145 00000 n 
+0000290471 00000 n 
+0001247838 00000 n 
+0000006204 00000 n 
+0000006356 00000 n 
+0000290596 00000 n 
+0001247707 00000 n 
+0000006405 00000 n 
+0000006572 00000 n 
+0000292679 00000 n 
+0001247628 00000 n 
+0000006626 00000 n 
+0000006790 00000 n 
+0000292741 00000 n 
+0001247510 00000 n 
+0000006844 00000 n 
+0000007003 00000 n 
+0000292866 00000 n 
+0001247431 00000 n 
+0000007062 00000 n 
+0000007148 00000 n 
+0000292991 00000 n 
+0001247338 00000 n 
+0000007207 00000 n 
+0000007293 00000 n 
+0000293117 00000 n 
+0001247259 00000 n 
+0000007352 00000 n 
+0000007438 00000 n 
+0000293241 00000 n 
+0001247128 00000 n 
+0000007487 00000 n 
+0000007659 00000 n 
+0000295303 00000 n 
+0001247049 00000 n 
+0000007713 00000 n 
+0000007877 00000 n 
+0000295365 00000 n 
+0001246931 00000 n 
+0000007931 00000 n 
+0000008090 00000 n 
+0000295490 00000 n 
+0001246852 00000 n 
+0000008149 00000 n 
+0000008240 00000 n 
+0000295616 00000 n 
+0001246759 00000 n 
+0000008299 00000 n 
+0000008390 00000 n 
+0000295742 00000 n 
+0001246680 00000 n 
+0000008449 00000 n 
+0000008545 00000 n 
+0000295867 00000 n 
+0001246549 00000 n 
+0000008594 00000 n 
+0000008751 00000 n 
+0000298419 00000 n 
+0001246470 00000 n 
+0000008805 00000 n 
+0000008969 00000 n 
+0000298481 00000 n 
+0001246352 00000 n 
+0000009023 00000 n 
+0000009182 00000 n 
+0000298606 00000 n 
+0001246273 00000 n 
+0000009241 00000 n 
+0000009327 00000 n 
+0000298730 00000 n 
+0001246194 00000 n 
+0000009386 00000 n 
+0000009472 00000 n 
+0000298855 00000 n 
+0001246063 00000 n 
+0000009521 00000 n 
+0000009688 00000 n 
+0000305761 00000 n 
+0001245998 00000 n 
+0000009742 00000 n 
+0000009906 00000 n 
+0000305886 00000 n 
+0001245867 00000 n 
+0000009955 00000 n 
+0000010127 00000 n 
+0000306011 00000 n 
+0001245788 00000 n 
+0000010181 00000 n 
+0000010345 00000 n 
+0000306073 00000 n 
+0001245669 00000 n 
+0000010399 00000 n 
+0000010558 00000 n 
+0000308260 00000 n 
+0001245590 00000 n 
+0000010617 00000 n 
+0000010713 00000 n 
+0000308386 00000 n 
+0001245497 00000 n 
+0000010772 00000 n 
+0000010863 00000 n 
+0000308512 00000 n 
+0001245404 00000 n 
+0000010922 00000 n 
+0000011018 00000 n 
+0000308637 00000 n 
+0001245311 00000 n 
+0000011077 00000 n 
+0000011163 00000 n 
+0000308762 00000 n 
+0001245218 00000 n 
+0000011222 00000 n 
+0000011313 00000 n 
+0000308888 00000 n 
+0001245125 00000 n 
+0000011372 00000 n 
+0000011468 00000 n 
+0000309014 00000 n 
+0001245032 00000 n 
+0000011527 00000 n 
+0000011613 00000 n 
+0000309140 00000 n 
+0001244939 00000 n 
+0000011672 00000 n 
+0000011816 00000 n 
+0000311008 00000 n 
+0001244846 00000 n 
+0000011875 00000 n 
+0000012022 00000 n 
+0000311134 00000 n 
+0001244753 00000 n 
+0000012082 00000 n 
+0000012183 00000 n 
+0000311259 00000 n 
+0001244660 00000 n 
+0000012243 00000 n 
+0000012359 00000 n 
+0000311385 00000 n 
+0001244567 00000 n 
+0000012419 00000 n 
+0000012558 00000 n 
+0000311511 00000 n 
+0001244474 00000 n 
+0000012618 00000 n 
+0000012772 00000 n 
+0000311637 00000 n 
+0001244395 00000 n 
+0000012832 00000 n 
+0000012938 00000 n 
+0000311762 00000 n 
+0001244264 00000 n 
+0000012987 00000 n 
+0000013187 00000 n 
+0000322509 00000 n 
+0001244185 00000 n 
+0000013241 00000 n 
+0000013405 00000 n 
+0000322571 00000 n 
+0001244066 00000 n 
+0000013459 00000 n 
+0000013618 00000 n 
+0000322696 00000 n 
+0001243987 00000 n 
+0000013677 00000 n 
+0000013778 00000 n 
+0000322822 00000 n 
+0001243894 00000 n 
+0000013837 00000 n 
+0000013961 00000 n 
+0000324599 00000 n 
+0001243801 00000 n 
+0000014020 00000 n 
+0000014126 00000 n 
+0000324725 00000 n 
+0001243708 00000 n 
+0000014185 00000 n 
+0000014266 00000 n 
+0000324850 00000 n 
+0001243615 00000 n 
+0000014325 00000 n 
+0000014436 00000 n 
+0000324976 00000 n 
+0001243522 00000 n 
+0000014495 00000 n 
+0000014629 00000 n 
+0000325101 00000 n 
+0001243429 00000 n 
+0000014688 00000 n 
+0000014837 00000 n 
+0000325227 00000 n 
+0001243336 00000 n 
+0000014896 00000 n 
+0000015053 00000 n 
+0000325353 00000 n 
+0001243243 00000 n 
+0000015112 00000 n 
+0000015269 00000 n 
+0000325479 00000 n 
+0001243150 00000 n 
+0000015329 00000 n 
+0000015438 00000 n 
+0000327943 00000 n 
+0001243057 00000 n 
+0000015498 00000 n 
+0000015607 00000 n 
+0000328069 00000 n 
+0001242964 00000 n 
+0000015667 00000 n 
+0000015753 00000 n 
+0000328195 00000 n 
+0001242871 00000 n 
+0000015813 00000 n 
+0000015899 00000 n 
+0000328321 00000 n 
+0001242778 00000 n 
+0000015959 00000 n 
+0000016050 00000 n 
+0000328446 00000 n 
+0001242685 00000 n 
+0000016110 00000 n 
+0000016201 00000 n 
+0000328572 00000 n 
+0001242592 00000 n 
+0000016261 00000 n 
+0000016352 00000 n 
+0000328698 00000 n 
+0001242499 00000 n 
+0000016412 00000 n 
+0000016503 00000 n 
+0000328824 00000 n 
+0001242406 00000 n 
+0000016563 00000 n 
+0000016654 00000 n 
+0000331216 00000 n 
+0001242313 00000 n 
+0000016714 00000 n 
+0000016805 00000 n 
+0000331341 00000 n 
+0001242220 00000 n 
+0000016865 00000 n 
+0000016956 00000 n 
+0000331467 00000 n 
+0001242127 00000 n 
+0000017016 00000 n 
+0000017107 00000 n 
+0000331593 00000 n 
+0001242034 00000 n 
+0000017167 00000 n 
+0000017268 00000 n 
+0000331719 00000 n 
+0001241941 00000 n 
+0000017328 00000 n 
+0000017429 00000 n 
+0000331844 00000 n 
+0001241848 00000 n 
+0000017489 00000 n 
+0000017590 00000 n 
+0000331970 00000 n 
+0001241755 00000 n 
+0000017650 00000 n 
+0000017751 00000 n 
+0000332095 00000 n 
+0001241662 00000 n 
+0000017811 00000 n 
+0000017902 00000 n 
+0000334880 00000 n 
+0001241569 00000 n 
+0000017962 00000 n 
+0000018073 00000 n 
+0000335006 00000 n 
+0001241490 00000 n 
+0000018133 00000 n 
+0000018214 00000 n 
+0000335131 00000 n 
+0001241373 00000 n 
+0000018264 00000 n 
+0000018446 00000 n 
+0000335255 00000 n 
+0001241294 00000 n 
+0000018501 00000 n 
+0000018670 00000 n 
+0000335317 00000 n 
+0001241176 00000 n 
+0000018725 00000 n 
+0000018889 00000 n 
+0000335442 00000 n 
+0001241097 00000 n 
+0000018949 00000 n 
+0000019050 00000 n 
+0000335568 00000 n 
+0001241018 00000 n 
+0000019110 00000 n 
+0000019211 00000 n 
+0000340039 00000 n 
+0001240883 00000 n 
+0000019258 00000 n 
+0000019392 00000 n 
+0000340164 00000 n 
+0001240763 00000 n 
+0000019441 00000 n 
+0000019616 00000 n 
+0000383730 00000 n 
+0001240684 00000 n 
+0000019670 00000 n 
+0000019834 00000 n 
+0000383791 00000 n 
+0001240548 00000 n 
+0000019888 00000 n 
+0000020105 00000 n 
+0000383916 00000 n 
+0001240469 00000 n 
+0000020164 00000 n 
+0000020273 00000 n 
+0000384042 00000 n 
+0001240376 00000 n 
+0000020332 00000 n 
+0000020476 00000 n 
+0000385283 00000 n 
+0001240283 00000 n 
+0000020535 00000 n 
+0000020664 00000 n 
+0000385409 00000 n 
+0001240190 00000 n 
+0000020723 00000 n 
+0000020837 00000 n 
+0000385535 00000 n 
+0001240097 00000 n 
+0000020896 00000 n 
+0000021005 00000 n 
+0000385661 00000 n 
+0001240004 00000 n 
+0000021064 00000 n 
+0000021178 00000 n 
+0000385787 00000 n 
+0001239911 00000 n 
+0000021237 00000 n 
+0000021343 00000 n 
+0000385912 00000 n 
+0001239818 00000 n 
+0000021402 00000 n 
+0000021536 00000 n 
+0000386038 00000 n 
+0001239725 00000 n 
+0000021595 00000 n 
+0000021696 00000 n 
+0000386164 00000 n 
+0001239632 00000 n 
+0000021756 00000 n 
+0000021862 00000 n 
+0000387518 00000 n 
+0001239539 00000 n 
+0000021922 00000 n 
+0000022031 00000 n 
+0000387644 00000 n 
+0001239446 00000 n 
+0000022091 00000 n 
+0000022200 00000 n 
+0000387770 00000 n 
+0001239353 00000 n 
+0000022260 00000 n 
+0000022369 00000 n 
+0000387896 00000 n 
+0001239260 00000 n 
+0000022429 00000 n 
+0000022538 00000 n 
+0000388022 00000 n 
+0001239167 00000 n 
+0000022598 00000 n 
+0000022697 00000 n 
+0000388148 00000 n 
+0001239074 00000 n 
+0000022757 00000 n 
+0000022856 00000 n 
+0000388274 00000 n 
+0001238981 00000 n 
+0000022916 00000 n 
+0000023037 00000 n 
+0000388399 00000 n 
+0001238888 00000 n 
+0000023097 00000 n 
+0000023221 00000 n 
+0000390088 00000 n 
+0001238795 00000 n 
+0000023281 00000 n 
+0000023423 00000 n 
+0000390214 00000 n 
+0001238702 00000 n 
+0000023483 00000 n 
+0000023617 00000 n 
+0000390340 00000 n 
+0001238609 00000 n 
+0000023677 00000 n 
+0000023826 00000 n 
+0000390465 00000 n 
+0001238516 00000 n 
+0000023886 00000 n 
+0000024088 00000 n 
+0000390591 00000 n 
+0001238423 00000 n 
+0000024148 00000 n 
+0000024315 00000 n 
+0000390717 00000 n 
+0001238330 00000 n 
+0000024375 00000 n 
+0000024527 00000 n 
+0000390843 00000 n 
+0001238237 00000 n 
+0000024587 00000 n 
+0000024729 00000 n 
+0000391926 00000 n 
+0001238144 00000 n 
+0000024789 00000 n 
+0000024931 00000 n 
+0000392051 00000 n 
+0001238051 00000 n 
+0000024991 00000 n 
+0000025133 00000 n 
+0000392176 00000 n 
+0001237958 00000 n 
+0000025193 00000 n 
+0000025368 00000 n 
+0000392300 00000 n 
+0001237865 00000 n 
+0000025428 00000 n 
+0000025570 00000 n 
+0000392426 00000 n 
+0001237772 00000 n 
+0000025630 00000 n 
+0000025767 00000 n 
+0000392552 00000 n 
+0001237679 00000 n 
+0000025827 00000 n 
+0000026002 00000 n 
+0000392678 00000 n 
+0001237586 00000 n 
+0000026062 00000 n 
+0000026232 00000 n 
+0000393998 00000 n 
+0001237493 00000 n 
+0000026292 00000 n 
+0000026434 00000 n 
+0000394124 00000 n 
+0001237400 00000 n 
+0000026494 00000 n 
+0000026669 00000 n 
+0000394249 00000 n 
+0001237307 00000 n 
+0000026729 00000 n 
+0000026904 00000 n 
+0000394375 00000 n 
+0001237214 00000 n 
+0000026964 00000 n 
+0000027144 00000 n 
+0000394501 00000 n 
+0001237121 00000 n 
+0000027204 00000 n 
+0000027374 00000 n 
+0000394627 00000 n 
+0001237028 00000 n 
+0000027434 00000 n 
+0000027599 00000 n 
+0000394753 00000 n 
+0001236935 00000 n 
+0000027659 00000 n 
+0000027806 00000 n 
+0000396368 00000 n 
+0001236842 00000 n 
+0000027866 00000 n 
+0000028077 00000 n 
+0000396494 00000 n 
+0001236749 00000 n 
+0000028137 00000 n 
+0000028363 00000 n 
+0000396618 00000 n 
+0001236656 00000 n 
+0000028423 00000 n 
+0000028618 00000 n 
+0000396744 00000 n 
+0001236563 00000 n 
+0000028678 00000 n 
+0000028889 00000 n 
+0000396870 00000 n 
+0001236470 00000 n 
+0000028949 00000 n 
+0000029172 00000 n 
+0000396996 00000 n 
+0001236377 00000 n 
+0000029232 00000 n 
+0000029458 00000 n 
+0000397121 00000 n 
+0001236284 00000 n 
+0000029518 00000 n 
+0000029726 00000 n 
+0000397247 00000 n 
+0001236191 00000 n 
+0000029786 00000 n 
+0000029999 00000 n 
+0000398918 00000 n 
+0001236098 00000 n 
+0000030059 00000 n 
+0000030267 00000 n 
+0000399044 00000 n 
+0001236005 00000 n 
+0000030327 00000 n 
+0000030540 00000 n 
+0000399170 00000 n 
+0001235912 00000 n 
+0000030600 00000 n 
+0000030818 00000 n 
+0000399295 00000 n 
+0001235819 00000 n 
+0000030878 00000 n 
+0000031058 00000 n 
+0000399421 00000 n 
+0001235726 00000 n 
+0000031118 00000 n 
+0000031290 00000 n 
+0000399547 00000 n 
+0001235633 00000 n 
+0000031350 00000 n 
+0000031520 00000 n 
+0000399673 00000 n 
+0001235540 00000 n 
+0000031580 00000 n 
+0000031740 00000 n 
+0000399799 00000 n 
+0001235447 00000 n 
+0000031800 00000 n 
+0000031965 00000 n 
+0000401386 00000 n 
+0001235354 00000 n 
+0000032025 00000 n 
+0000032177 00000 n 
+0000401512 00000 n 
+0001235261 00000 n 
+0000032237 00000 n 
+0000032455 00000 n 
+0000401638 00000 n 
+0001235168 00000 n 
+0000032515 00000 n 
+0000032690 00000 n 
+0000401764 00000 n 
+0001235075 00000 n 
+0000032750 00000 n 
+0000032930 00000 n 
+0000401890 00000 n 
+0001234982 00000 n 
+0000032990 00000 n 
+0000033195 00000 n 
+0000402016 00000 n 
+0001234889 00000 n 
+0000033255 00000 n 
+0000033450 00000 n 
+0000402142 00000 n 
+0001234796 00000 n 
+0000033510 00000 n 
+0000033680 00000 n 
+0000402267 00000 n 
+0001234703 00000 n 
+0000033740 00000 n 
+0000033930 00000 n 
+0000403381 00000 n 
+0001234610 00000 n 
+0000033990 00000 n 
+0000034188 00000 n 
+0000403507 00000 n 
+0001234517 00000 n 
+0000034248 00000 n 
+0000034446 00000 n 
+0000403633 00000 n 
+0001234424 00000 n 
+0000034506 00000 n 
+0000034731 00000 n 
+0000403759 00000 n 
+0001234331 00000 n 
+0000034791 00000 n 
+0000034989 00000 n 
+0000403885 00000 n 
+0001234238 00000 n 
+0000035049 00000 n 
+0000035260 00000 n 
+0000404011 00000 n 
+0001234145 00000 n 
+0000035320 00000 n 
+0000035426 00000 n 
+0000404137 00000 n 
+0001234052 00000 n 
+0000035486 00000 n 
+0000035607 00000 n 
+0000404263 00000 n 
+0001233959 00000 n 
+0000035667 00000 n 
+0000035788 00000 n 
+0000405417 00000 n 
+0001233866 00000 n 
+0000035848 00000 n 
+0000035969 00000 n 
+0000405543 00000 n 
+0001233773 00000 n 
+0000036029 00000 n 
+0000036125 00000 n 
+0000405669 00000 n 
+0001233680 00000 n 
+0000036185 00000 n 
+0000036301 00000 n 
+0000405795 00000 n 
+0001233587 00000 n 
+0000036361 00000 n 
+0000036485 00000 n 
+0000405921 00000 n 
+0001233494 00000 n 
+0000036545 00000 n 
+0000036737 00000 n 
+0000406047 00000 n 
+0001233401 00000 n 
+0000036797 00000 n 
+0000036989 00000 n 
+0000406173 00000 n 
+0001233308 00000 n 
+0000037049 00000 n 
+0000037241 00000 n 
+0000406299 00000 n 
+0001233215 00000 n 
+0000037301 00000 n 
+0000037481 00000 n 
+0000407290 00000 n 
+0001233122 00000 n 
+0000037541 00000 n 
+0000037721 00000 n 
+0000407416 00000 n 
+0001233029 00000 n 
+0000037781 00000 n 
+0000037961 00000 n 
+0000407542 00000 n 
+0001232936 00000 n 
+0000038021 00000 n 
+0000038183 00000 n 
+0000407668 00000 n 
+0001232843 00000 n 
+0000038243 00000 n 
+0000038405 00000 n 
+0000407794 00000 n 
+0001232750 00000 n 
+0000038465 00000 n 
+0000038627 00000 n 
+0000407920 00000 n 
+0001232657 00000 n 
+0000038687 00000 n 
+0000038798 00000 n 
+0000408046 00000 n 
+0001232564 00000 n 
+0000038858 00000 n 
+0000038984 00000 n 
+0000408172 00000 n 
+0001232471 00000 n 
+0000039044 00000 n 
+0000039170 00000 n 
+0000409349 00000 n 
+0001232378 00000 n 
+0000039230 00000 n 
+0000039384 00000 n 
+0000409474 00000 n 
+0001232285 00000 n 
+0000039444 00000 n 
+0000039545 00000 n 
+0000409599 00000 n 
+0001232192 00000 n 
+0000039605 00000 n 
+0000039726 00000 n 
+0000409725 00000 n 
+0001232099 00000 n 
+0000039786 00000 n 
+0000039958 00000 n 
+0000409851 00000 n 
+0001232006 00000 n 
+0000040018 00000 n 
+0000040180 00000 n 
+0000409975 00000 n 
+0001231913 00000 n 
+0000040240 00000 n 
+0000040349 00000 n 
+0000410100 00000 n 
+0001231820 00000 n 
+0000040409 00000 n 
+0000040518 00000 n 
+0000411268 00000 n 
+0001231727 00000 n 
+0000040578 00000 n 
+0000040687 00000 n 
+0000411394 00000 n 
+0001231634 00000 n 
+0000040747 00000 n 
+0000040962 00000 n 
+0000411519 00000 n 
+0001231541 00000 n 
+0000041022 00000 n 
+0000041214 00000 n 
+0000411645 00000 n 
+0001231448 00000 n 
+0000041274 00000 n 
+0000041408 00000 n 
+0000411771 00000 n 
+0001231355 00000 n 
+0000041468 00000 n 
+0000041627 00000 n 
+0000411897 00000 n 
+0001231262 00000 n 
+0000041688 00000 n 
+0000041812 00000 n 
+0000412023 00000 n 
+0001231169 00000 n 
+0000041873 00000 n 
+0000042055 00000 n 
+0000412149 00000 n 
+0001231076 00000 n 
+0000042116 00000 n 
+0000042268 00000 n 
+0000413236 00000 n 
+0001230983 00000 n 
+0000042329 00000 n 
+0000042458 00000 n 
+0000413362 00000 n 
+0001230890 00000 n 
+0000042519 00000 n 
+0000042643 00000 n 
+0000413488 00000 n 
+0001230797 00000 n 
+0000042704 00000 n 
+0000042853 00000 n 
+0000413614 00000 n 
+0001230704 00000 n 
+0000042914 00000 n 
+0000043033 00000 n 
+0000413740 00000 n 
+0001230611 00000 n 
+0000043094 00000 n 
+0000043205 00000 n 
+0000413866 00000 n 
+0001230518 00000 n 
+0000043266 00000 n 
+0000043400 00000 n 
+0000413992 00000 n 
+0001230425 00000 n 
+0000043461 00000 n 
+0000043623 00000 n 
+0000414118 00000 n 
+0001230332 00000 n 
+0000043684 00000 n 
+0000043800 00000 n 
+0000415246 00000 n 
+0001230239 00000 n 
+0000043861 00000 n 
+0000044005 00000 n 
+0000415372 00000 n 
+0001230146 00000 n 
+0000044066 00000 n 
+0000044238 00000 n 
+0000415498 00000 n 
+0001230053 00000 n 
+0000044299 00000 n 
+0000044466 00000 n 
+0000415624 00000 n 
+0001229960 00000 n 
+0000044527 00000 n 
+0000044694 00000 n 
+0000415750 00000 n 
+0001229867 00000 n 
+0000044755 00000 n 
+0000044866 00000 n 
+0000415876 00000 n 
+0001229774 00000 n 
+0000044927 00000 n 
+0000045063 00000 n 
+0000416002 00000 n 
+0001229681 00000 n 
+0000045124 00000 n 
+0000045230 00000 n 
+0000416128 00000 n 
+0001229588 00000 n 
+0000045291 00000 n 
+0000045440 00000 n 
+0000417171 00000 n 
+0001229495 00000 n 
+0000045501 00000 n 
+0000045630 00000 n 
+0000417296 00000 n 
+0001229402 00000 n 
+0000045691 00000 n 
+0000045835 00000 n 
+0000417421 00000 n 
+0001229309 00000 n 
+0000045896 00000 n 
+0000046040 00000 n 
+0000417546 00000 n 
+0001229216 00000 n 
+0000046101 00000 n 
+0000046237 00000 n 
+0000417672 00000 n 
+0001229123 00000 n 
+0000046298 00000 n 
+0000046442 00000 n 
+0000417798 00000 n 
+0001229030 00000 n 
+0000046503 00000 n 
+0000046642 00000 n 
+0000417922 00000 n 
+0001228937 00000 n 
+0000046703 00000 n 
+0000046824 00000 n 
+0000419113 00000 n 
+0001228844 00000 n 
+0000046885 00000 n 
+0000047069 00000 n 
+0000419239 00000 n 
+0001228751 00000 n 
+0000047130 00000 n 
+0000047241 00000 n 
+0000419365 00000 n 
+0001228658 00000 n 
+0000047302 00000 n 
+0000047436 00000 n 
+0000419491 00000 n 
+0001228565 00000 n 
+0000047497 00000 n 
+0000047641 00000 n 
+0000419617 00000 n 
+0001228472 00000 n 
+0000047702 00000 n 
+0000047877 00000 n 
+0000419742 00000 n 
+0001228379 00000 n 
+0000047938 00000 n 
+0000048097 00000 n 
+0000419868 00000 n 
+0001228286 00000 n 
+0000048158 00000 n 
+0000048295 00000 n 
+0000419993 00000 n 
+0001228193 00000 n 
+0000048356 00000 n 
+0000048513 00000 n 
+0000421177 00000 n 
+0001228100 00000 n 
+0000048574 00000 n 
+0000048713 00000 n 
+0000421303 00000 n 
+0001228007 00000 n 
+0000048774 00000 n 
+0000048938 00000 n 
+0000421429 00000 n 
+0001227914 00000 n 
+0000048999 00000 n 
+0000049128 00000 n 
+0000421555 00000 n 
+0001227821 00000 n 
+0000049189 00000 n 
+0000049338 00000 n 
+0000421681 00000 n 
+0001227728 00000 n 
+0000049399 00000 n 
+0000049601 00000 n 
+0000421807 00000 n 
+0001227635 00000 n 
+0000049662 00000 n 
+0000049856 00000 n 
+0000421933 00000 n 
+0001227542 00000 n 
+0000049917 00000 n 
+0000050051 00000 n 
+0000422059 00000 n 
+0001227447 00000 n 
+0000050112 00000 n 
+0000050247 00000 n 
+0000423252 00000 n 
+0001227350 00000 n 
+0000050309 00000 n 
+0000050454 00000 n 
+0000423379 00000 n 
+0001227252 00000 n 
+0000050516 00000 n 
+0000050664 00000 n 
+0000423506 00000 n 
+0001227154 00000 n 
+0000050726 00000 n 
+0000050881 00000 n 
+0000423633 00000 n 
+0001227056 00000 n 
+0000050943 00000 n 
+0000051088 00000 n 
+0000423759 00000 n 
+0001226958 00000 n 
+0000051150 00000 n 
+0000051330 00000 n 
+0000423886 00000 n 
+0001226860 00000 n 
+0000051392 00000 n 
+0000051537 00000 n 
+0000424013 00000 n 
+0001226762 00000 n 
+0000051599 00000 n 
+0000051767 00000 n 
+0000424140 00000 n 
+0001226664 00000 n 
+0000051829 00000 n 
+0000051997 00000 n 
+0000425350 00000 n 
+0001226566 00000 n 
+0000052059 00000 n 
+0000052247 00000 n 
+0000425477 00000 n 
+0001226468 00000 n 
+0000052309 00000 n 
+0000052449 00000 n 
+0000425604 00000 n 
+0001226370 00000 n 
+0000052511 00000 n 
+0000052679 00000 n 
+0000425731 00000 n 
+0001226272 00000 n 
+0000052741 00000 n 
+0000052891 00000 n 
+0000425857 00000 n 
+0001226174 00000 n 
+0000052953 00000 n 
+0000053131 00000 n 
+0000425983 00000 n 
+0001226076 00000 n 
+0000053193 00000 n 
+0000053391 00000 n 
+0000426110 00000 n 
+0001225978 00000 n 
+0000053453 00000 n 
+0000053628 00000 n 
+0000426237 00000 n 
+0001225880 00000 n 
+0000053690 00000 n 
+0000053860 00000 n 
+0000427395 00000 n 
+0001225782 00000 n 
+0000053922 00000 n 
+0000054097 00000 n 
+0000427522 00000 n 
+0001225684 00000 n 
+0000054159 00000 n 
+0000054309 00000 n 
+0000427649 00000 n 
+0001225586 00000 n 
+0000054371 00000 n 
+0000054531 00000 n 
+0000427776 00000 n 
+0001225488 00000 n 
+0000054593 00000 n 
+0000054783 00000 n 
+0000427902 00000 n 
+0001225390 00000 n 
+0000054845 00000 n 
+0000054980 00000 n 
+0000428029 00000 n 
+0001225292 00000 n 
+0000055042 00000 n 
+0000055222 00000 n 
+0000428156 00000 n 
+0001225194 00000 n 
+0000055284 00000 n 
+0000055449 00000 n 
+0000428283 00000 n 
+0001225096 00000 n 
+0000055511 00000 n 
+0000055656 00000 n 
+0000429467 00000 n 
+0001224998 00000 n 
+0000055718 00000 n 
+0000055878 00000 n 
+0000429594 00000 n 
+0001224900 00000 n 
+0000055940 00000 n 
+0000056098 00000 n 
+0000429720 00000 n 
+0001224802 00000 n 
+0000056160 00000 n 
+0000056330 00000 n 
+0000429847 00000 n 
+0001224704 00000 n 
+0000056392 00000 n 
+0000056537 00000 n 
+0000429974 00000 n 
+0001224606 00000 n 
+0000056599 00000 n 
+0000056769 00000 n 
+0000430101 00000 n 
+0001224508 00000 n 
+0000056831 00000 n 
+0000057024 00000 n 
+0000430228 00000 n 
+0001224410 00000 n 
+0000057086 00000 n 
+0000057261 00000 n 
+0000430355 00000 n 
+0001224312 00000 n 
+0000057323 00000 n 
+0000057483 00000 n 
+0000431507 00000 n 
+0001224214 00000 n 
+0000057545 00000 n 
+0000057715 00000 n 
+0000431634 00000 n 
+0001224116 00000 n 
+0000057777 00000 n 
+0000057917 00000 n 
+0000431761 00000 n 
+0001224018 00000 n 
+0000057979 00000 n 
+0000058119 00000 n 
+0000431888 00000 n 
+0001223920 00000 n 
+0000058181 00000 n 
+0000058384 00000 n 
+0000432015 00000 n 
+0001223822 00000 n 
+0000058446 00000 n 
+0000058652 00000 n 
+0000432142 00000 n 
+0001223724 00000 n 
+0000058714 00000 n 
+0000058834 00000 n 
+0000432269 00000 n 
+0001223626 00000 n 
+0000058896 00000 n 
+0000059016 00000 n 
+0000432396 00000 n 
+0001223528 00000 n 
+0000059078 00000 n 
+0000059198 00000 n 
+0000434462 00000 n 
+0001223430 00000 n 
+0000059260 00000 n 
+0000059390 00000 n 
+0000434589 00000 n 
+0001223347 00000 n 
+0000059452 00000 n 
+0000059610 00000 n 
+0000434652 00000 n 
+0001223224 00000 n 
+0000059665 00000 n 
+0000059835 00000 n 
+0000434778 00000 n 
+0001223140 00000 n 
+0000059895 00000 n 
+0000059987 00000 n 
+0000434905 00000 n 
+0001223041 00000 n 
+0000060047 00000 n 
+0000060144 00000 n 
+0000435032 00000 n 
+0001222942 00000 n 
+0000060204 00000 n 
+0000060306 00000 n 
+0000435158 00000 n 
+0001222843 00000 n 
+0000060366 00000 n 
+0000060468 00000 n 
+0000435284 00000 n 
+0001222744 00000 n 
+0000060528 00000 n 
+0000060630 00000 n 
+0000439807 00000 n 
+0001222645 00000 n 
+0000060690 00000 n 
+0000060802 00000 n 
+0000439934 00000 n 
+0001222561 00000 n 
+0000060862 00000 n 
+0000060974 00000 n 
+0000440061 00000 n 
+0001222464 00000 n 
+0000061024 00000 n 
+0000061119 00000 n 
+0000465982 00000 n 
+0001222325 00000 n 
+0000061169 00000 n 
+0000061360 00000 n 
+0000466171 00000 n 
+0001222241 00000 n 
+0000061415 00000 n 
+0000061580 00000 n 
+0000466234 00000 n 
+0001222101 00000 n 
+0000061635 00000 n 
+0000061853 00000 n 
+0000466360 00000 n 
+0001222017 00000 n 
+0000061913 00000 n 
+0000062048 00000 n 
+0000466487 00000 n 
+0001221933 00000 n 
+0000062108 00000 n 
+0000062243 00000 n 
+0000466550 00000 n 
+0001221808 00000 n 
+0000062298 00000 n 
+0000062473 00000 n 
+0000466676 00000 n 
+0001221724 00000 n 
+0000062533 00000 n 
+0000062712 00000 n 
+0000468949 00000 n 
+0001221640 00000 n 
+0000062772 00000 n 
+0000062951 00000 n 
+0000469138 00000 n 
+0001221542 00000 n 
+0000063001 00000 n 
+0000063111 00000 n 
+0000473186 00000 n 
+0001221403 00000 n 
+0000063161 00000 n 
+0000063380 00000 n 
+0000473312 00000 n 
+0001221319 00000 n 
+0000063435 00000 n 
+0000063600 00000 n 
+0000473375 00000 n 
+0001221194 00000 n 
+0000063655 00000 n 
+0000063830 00000 n 
+0000473501 00000 n 
+0001221110 00000 n 
+0000063890 00000 n 
+0000064078 00000 n 
+0000478632 00000 n 
+0001221026 00000 n 
+0000064138 00000 n 
+0000064381 00000 n 
+0000478820 00000 n 
+0001220928 00000 n 
+0000064431 00000 n 
+0000064569 00000 n 
+0000481171 00000 n 
+0001220789 00000 n 
+0000064619 00000 n 
+0000064810 00000 n 
+0000481360 00000 n 
+0001220705 00000 n 
+0000064865 00000 n 
+0000065030 00000 n 
+0000481423 00000 n 
+0001220565 00000 n 
+0000065085 00000 n 
+0000065260 00000 n 
+0000481548 00000 n 
+0001220496 00000 n 
+0000065320 00000 n 
+0000065498 00000 n 
+0000484717 00000 n 
+0001220371 00000 n 
+0000065553 00000 n 
+0000065728 00000 n 
+0000484843 00000 n 
+0001220287 00000 n 
+0000065788 00000 n 
+0000065905 00000 n 
+0000484970 00000 n 
+0001220188 00000 n 
+0000065965 00000 n 
+0000066067 00000 n 
+0000485097 00000 n 
+0001220104 00000 n 
+0000066127 00000 n 
+0000066234 00000 n 
+0000485223 00000 n 
+0001220006 00000 n 
+0000066284 00000 n 
+0000066394 00000 n 
+0000485349 00000 n 
+0001219867 00000 n 
+0000066444 00000 n 
+0000066668 00000 n 
+0000498602 00000 n 
+0001219783 00000 n 
+0000066723 00000 n 
+0000066888 00000 n 
+0000498665 00000 n 
+0001219657 00000 n 
+0000066943 00000 n 
+0000067118 00000 n 
+0000501554 00000 n 
+0001219573 00000 n 
+0000067178 00000 n 
+0000067316 00000 n 
+0000501743 00000 n 
+0001219474 00000 n 
+0000067376 00000 n 
+0000067514 00000 n 
+0000501932 00000 n 
+0001219375 00000 n 
+0000067574 00000 n 
+0000067702 00000 n 
+0000504484 00000 n 
+0001219276 00000 n 
+0000067762 00000 n 
+0000067915 00000 n 
+0000504673 00000 n 
+0001219177 00000 n 
+0000067975 00000 n 
+0000068138 00000 n 
+0000507287 00000 n 
+0001219078 00000 n 
+0000068198 00000 n 
+0000068356 00000 n 
+0000507476 00000 n 
+0001218979 00000 n 
+0000068416 00000 n 
+0000068584 00000 n 
+0000510506 00000 n 
+0001218880 00000 n 
+0000068644 00000 n 
+0000068812 00000 n 
+0000510693 00000 n 
+0001218781 00000 n 
+0000068872 00000 n 
+0000069060 00000 n 
+0000510882 00000 n 
+0001218682 00000 n 
+0000069121 00000 n 
+0000069269 00000 n 
+0000513714 00000 n 
+0001218583 00000 n 
+0000069330 00000 n 
+0000069483 00000 n 
+0000513903 00000 n 
+0001218484 00000 n 
+0000069544 00000 n 
+0000069777 00000 n 
+0000517451 00000 n 
+0001218385 00000 n 
+0000069838 00000 n 
+0000070026 00000 n 
+0000517639 00000 n 
+0001218286 00000 n 
+0000070087 00000 n 
+0000070265 00000 n 
+0000517828 00000 n 
+0001218187 00000 n 
+0000070326 00000 n 
+0000070489 00000 n 
+0000520852 00000 n 
+0001218088 00000 n 
+0000070550 00000 n 
+0000070793 00000 n 
+0000521041 00000 n 
+0001218004 00000 n 
+0000070854 00000 n 
+0000071052 00000 n 
+0000535275 00000 n 
+0001217906 00000 n 
+0000071103 00000 n 
+0000071251 00000 n 
+0000535401 00000 n 
+0001217767 00000 n 
+0000071302 00000 n 
+0000071531 00000 n 
+0000553823 00000 n 
+0001217683 00000 n 
+0000071587 00000 n 
+0000071757 00000 n 
+0000553886 00000 n 
+0001217557 00000 n 
+0000071813 00000 n 
+0000071993 00000 n 
+0000554012 00000 n 
+0001217473 00000 n 
+0000072054 00000 n 
+0000072187 00000 n 
+0000554200 00000 n 
+0001217374 00000 n 
+0000072248 00000 n 
+0000072431 00000 n 
+0000556567 00000 n 
+0001217275 00000 n 
+0000072492 00000 n 
+0000072665 00000 n 
+0000556756 00000 n 
+0001217176 00000 n 
+0000072726 00000 n 
+0000072924 00000 n 
+0000556945 00000 n 
+0001217077 00000 n 
+0000072985 00000 n 
+0000073183 00000 n 
+0000559348 00000 n 
+0001216978 00000 n 
+0000073244 00000 n 
+0000073442 00000 n 
+0000559537 00000 n 
+0001216879 00000 n 
+0000073503 00000 n 
+0000073661 00000 n 
+0000559725 00000 n 
+0001216780 00000 n 
+0000073722 00000 n 
+0000073900 00000 n 
+0000562500 00000 n 
+0001216681 00000 n 
+0000073961 00000 n 
+0000074124 00000 n 
+0000562689 00000 n 
+0001216582 00000 n 
+0000074186 00000 n 
+0000074334 00000 n 
+0000562878 00000 n 
+0001216483 00000 n 
+0000074396 00000 n 
+0000074539 00000 n 
+0000565209 00000 n 
+0001216384 00000 n 
+0000074601 00000 n 
+0000074744 00000 n 
+0000565397 00000 n 
+0001216285 00000 n 
+0000074806 00000 n 
+0000074974 00000 n 
+0000565585 00000 n 
+0001216186 00000 n 
+0000075036 00000 n 
+0000075199 00000 n 
+0000567882 00000 n 
+0001216087 00000 n 
+0000075261 00000 n 
+0000075409 00000 n 
+0000568071 00000 n 
+0001215988 00000 n 
+0000075471 00000 n 
+0000075629 00000 n 
+0000568260 00000 n 
+0001215889 00000 n 
+0000075691 00000 n 
+0000075864 00000 n 
+0000568449 00000 n 
+0001215790 00000 n 
+0000075926 00000 n 
+0000076089 00000 n 
+0000570684 00000 n 
+0001215691 00000 n 
+0000076151 00000 n 
+0000076309 00000 n 
+0000570873 00000 n 
+0001215592 00000 n 
+0000076371 00000 n 
+0000076529 00000 n 
+0000574384 00000 n 
+0001215493 00000 n 
+0000076591 00000 n 
+0000076774 00000 n 
+0000574572 00000 n 
+0001215394 00000 n 
+0000076836 00000 n 
+0000076984 00000 n 
+0000574761 00000 n 
+0001215295 00000 n 
+0000077046 00000 n 
+0000077219 00000 n 
+0000577243 00000 n 
+0001215196 00000 n 
+0000077281 00000 n 
+0000077424 00000 n 
+0000577431 00000 n 
+0001215097 00000 n 
+0000077486 00000 n 
+0000077649 00000 n 
+0000577619 00000 n 
+0001214998 00000 n 
+0000077711 00000 n 
+0000077889 00000 n 
+0000580651 00000 n 
+0001214899 00000 n 
+0000077951 00000 n 
+0000078179 00000 n 
+0000580838 00000 n 
+0001214800 00000 n 
+0000078241 00000 n 
+0000078439 00000 n 
+0000581026 00000 n 
+0001214701 00000 n 
+0000078501 00000 n 
+0000078689 00000 n 
+0000590655 00000 n 
+0001214617 00000 n 
+0000078751 00000 n 
+0000078935 00000 n 
+0000590844 00000 n 
+0001214519 00000 n 
+0000078986 00000 n 
+0000079134 00000 n 
+0000604429 00000 n 
+0001214380 00000 n 
+0000079185 00000 n 
+0000079404 00000 n 
+0000616975 00000 n 
+0001214296 00000 n 
+0000079460 00000 n 
+0000079630 00000 n 
+0000617038 00000 n 
+0001214170 00000 n 
+0000079686 00000 n 
+0000079866 00000 n 
+0000617164 00000 n 
+0001214086 00000 n 
+0000079927 00000 n 
+0000080110 00000 n 
+0000619459 00000 n 
+0001213987 00000 n 
+0000080171 00000 n 
+0000080319 00000 n 
+0000619648 00000 n 
+0001213888 00000 n 
+0000080380 00000 n 
+0000080538 00000 n 
+0000619835 00000 n 
+0001213789 00000 n 
+0000080599 00000 n 
+0000080732 00000 n 
+0000622827 00000 n 
+0001213690 00000 n 
+0000080793 00000 n 
+0000080981 00000 n 
+0000623016 00000 n 
+0001213591 00000 n 
+0000081042 00000 n 
+0000081205 00000 n 
+0000623205 00000 n 
+0001213492 00000 n 
+0000081266 00000 n 
+0000081459 00000 n 
+0000623394 00000 n 
+0001213393 00000 n 
+0000081520 00000 n 
+0000081698 00000 n 
+0000626076 00000 n 
+0001213294 00000 n 
+0000081759 00000 n 
+0000081947 00000 n 
+0000626265 00000 n 
+0001213195 00000 n 
+0000082009 00000 n 
+0000082217 00000 n 
+0000626454 00000 n 
+0001213096 00000 n 
+0000082279 00000 n 
+0000082472 00000 n 
+0000629142 00000 n 
+0001212997 00000 n 
+0000082534 00000 n 
+0000082747 00000 n 
+0000629330 00000 n 
+0001212898 00000 n 
+0000082809 00000 n 
+0000083022 00000 n 
+0000629518 00000 n 
+0001212799 00000 n 
+0000083084 00000 n 
+0000083232 00000 n 
+0000633000 00000 n 
+0001212700 00000 n 
+0000083294 00000 n 
+0000083482 00000 n 
+0000633189 00000 n 
+0001212601 00000 n 
+0000083544 00000 n 
+0000083732 00000 n 
+0000633378 00000 n 
+0001212502 00000 n 
+0000083794 00000 n 
+0000084002 00000 n 
+0000636997 00000 n 
+0001212403 00000 n 
+0000084064 00000 n 
+0000084282 00000 n 
+0000637186 00000 n 
+0001212304 00000 n 
+0000084344 00000 n 
+0000084527 00000 n 
+0000640063 00000 n 
+0001212205 00000 n 
+0000084589 00000 n 
+0000084767 00000 n 
+0000640252 00000 n 
+0001212106 00000 n 
+0000084829 00000 n 
+0000085012 00000 n 
+0000640440 00000 n 
+0001212007 00000 n 
+0000085074 00000 n 
+0000085287 00000 n 
+0000645324 00000 n 
+0001211923 00000 n 
+0000085349 00000 n 
+0000085567 00000 n 
+0000645513 00000 n 
+0001211825 00000 n 
+0000085618 00000 n 
+0000085756 00000 n 
+0000662844 00000 n 
+0001211686 00000 n 
+0000085807 00000 n 
+0000086008 00000 n 
+0000667298 00000 n 
+0001211602 00000 n 
+0000086064 00000 n 
+0000086234 00000 n 
+0000667361 00000 n 
+0001211476 00000 n 
+0000086290 00000 n 
+0000086470 00000 n 
+0000667487 00000 n 
+0001211392 00000 n 
+0000086531 00000 n 
+0000086664 00000 n 
+0000667675 00000 n 
+0001211293 00000 n 
+0000086725 00000 n 
+0000086833 00000 n 
+0000670558 00000 n 
+0001211194 00000 n 
+0000086894 00000 n 
+0000087057 00000 n 
+0000670747 00000 n 
+0001211095 00000 n 
+0000087118 00000 n 
+0000087256 00000 n 
+0000674163 00000 n 
+0001210996 00000 n 
+0000087317 00000 n 
+0000087455 00000 n 
+0000674352 00000 n 
+0001210897 00000 n 
+0000087516 00000 n 
+0000087644 00000 n 
+0000674541 00000 n 
+0001210798 00000 n 
+0000087705 00000 n 
+0000087868 00000 n 
+0000676261 00000 n 
+0001210699 00000 n 
+0000087929 00000 n 
+0000088107 00000 n 
+0000676449 00000 n 
+0001210600 00000 n 
+0000088168 00000 n 
+0000088301 00000 n 
+0000676638 00000 n 
+0001210501 00000 n 
+0000088363 00000 n 
+0000088531 00000 n 
+0000676827 00000 n 
+0001210402 00000 n 
+0000088593 00000 n 
+0000088761 00000 n 
+0000684468 00000 n 
+0001210318 00000 n 
+0000088823 00000 n 
+0000088966 00000 n 
+0000684657 00000 n 
+0001210220 00000 n 
+0000089017 00000 n 
+0000089137 00000 n 
+0000684783 00000 n 
+0001210081 00000 n 
+0000089188 00000 n 
+0000089389 00000 n 
+0000693526 00000 n 
+0001209997 00000 n 
+0000089445 00000 n 
+0000089615 00000 n 
+0000695528 00000 n 
+0001209871 00000 n 
+0000089671 00000 n 
+0000089851 00000 n 
+0000695654 00000 n 
+0001209787 00000 n 
+0000089912 00000 n 
+0000090035 00000 n 
+0000695780 00000 n 
+0001209688 00000 n 
+0000090096 00000 n 
+0000090265 00000 n 
+0000695968 00000 n 
+0001209589 00000 n 
+0000090326 00000 n 
+0000090505 00000 n 
+0000698269 00000 n 
+0001209490 00000 n 
+0000090566 00000 n 
+0000090717 00000 n 
+0000698458 00000 n 
+0001209391 00000 n 
+0000090778 00000 n 
+0000090947 00000 n 
+0000698647 00000 n 
+0001209292 00000 n 
+0000091008 00000 n 
+0000091144 00000 n 
+0000700881 00000 n 
+0001209193 00000 n 
+0000091205 00000 n 
+0000091364 00000 n 
+0000701070 00000 n 
+0001209094 00000 n 
+0000091425 00000 n 
+0000091609 00000 n 
+0000701258 00000 n 
+0001208995 00000 n 
+0000091670 00000 n 
+0000091844 00000 n 
+0000703474 00000 n 
+0001208896 00000 n 
+0000091906 00000 n 
+0000092090 00000 n 
+0000703663 00000 n 
+0001208797 00000 n 
+0000092152 00000 n 
+0000092331 00000 n 
+0000703852 00000 n 
+0001208698 00000 n 
+0000092393 00000 n 
+0000092549 00000 n 
+0000704041 00000 n 
+0001208599 00000 n 
+0000092611 00000 n 
+0000092772 00000 n 
+0000706633 00000 n 
+0001208500 00000 n 
+0000092834 00000 n 
+0000092975 00000 n 
+0000706822 00000 n 
+0001208401 00000 n 
+0000093037 00000 n 
+0000093211 00000 n 
+0000707010 00000 n 
+0001208302 00000 n 
+0000093273 00000 n 
+0000093462 00000 n 
+0000712270 00000 n 
+0001208218 00000 n 
+0000093524 00000 n 
+0000093713 00000 n 
+0000712458 00000 n 
+0001208120 00000 n 
+0000093764 00000 n 
+0000093884 00000 n 
+0000719389 00000 n 
+0001207981 00000 n 
+0000093935 00000 n 
+0000094131 00000 n 
+0000719515 00000 n 
+0001207897 00000 n 
+0000094187 00000 n 
+0000094357 00000 n 
+0000719578 00000 n 
+0001207772 00000 n 
+0000094413 00000 n 
+0000094593 00000 n 
+0000719704 00000 n 
+0001207688 00000 n 
+0000094654 00000 n 
+0000094838 00000 n 
+0000722496 00000 n 
+0001207604 00000 n 
+0000094899 00000 n 
+0000095083 00000 n 
+0000722685 00000 n 
+0001207506 00000 n 
+0000095134 00000 n 
+0000095249 00000 n 
+0000722811 00000 n 
+0001207367 00000 n 
+0000095300 00000 n 
+0000095511 00000 n 
+0000728361 00000 n 
+0001207283 00000 n 
+0000095567 00000 n 
+0000095737 00000 n 
+0000728424 00000 n 
+0001207158 00000 n 
+0000095793 00000 n 
+0000095973 00000 n 
+0000728550 00000 n 
+0001207074 00000 n 
+0000096034 00000 n 
+0000096185 00000 n 
+0000730888 00000 n 
+0001206975 00000 n 
+0000096246 00000 n 
+0000096387 00000 n 
+0000731077 00000 n 
+0001206876 00000 n 
+0000096448 00000 n 
+0000096594 00000 n 
+0000731265 00000 n 
+0001206777 00000 n 
+0000096655 00000 n 
+0000096816 00000 n 
+0000733748 00000 n 
+0001206678 00000 n 
+0000096877 00000 n 
+0000097023 00000 n 
+0000733937 00000 n 
+0001206579 00000 n 
+0000097084 00000 n 
+0000097230 00000 n 
+0000734126 00000 n 
+0001206495 00000 n 
+0000097291 00000 n 
+0000097442 00000 n 
+0000742532 00000 n 
+0001206397 00000 n 
+0000097493 00000 n 
+0000097623 00000 n 
+0000742658 00000 n 
+0001206258 00000 n 
+0000097674 00000 n 
+0000097860 00000 n 
+0000752967 00000 n 
+0001206174 00000 n 
+0000097916 00000 n 
+0000098086 00000 n 
+0000753030 00000 n 
+0001206048 00000 n 
+0000098142 00000 n 
+0000098322 00000 n 
+0000754373 00000 n 
+0001205964 00000 n 
+0000098383 00000 n 
+0000098519 00000 n 
+0000754499 00000 n 
+0001205865 00000 n 
+0000098580 00000 n 
+0000098731 00000 n 
+0000754688 00000 n 
+0001205766 00000 n 
+0000098792 00000 n 
+0000098938 00000 n 
+0000756177 00000 n 
+0001205667 00000 n 
+0000098999 00000 n 
+0000099135 00000 n 
+0000756366 00000 n 
+0001205568 00000 n 
+0000099196 00000 n 
+0000099352 00000 n 
+0000756553 00000 n 
+0001205469 00000 n 
+0000099413 00000 n 
+0000099564 00000 n 
+0000757964 00000 n 
+0001205370 00000 n 
+0000099625 00000 n 
+0000099771 00000 n 
+0000758090 00000 n 
+0001205271 00000 n 
+0000099832 00000 n 
+0000099988 00000 n 
+0000758279 00000 n 
+0001205172 00000 n 
+0000100049 00000 n 
+0000100200 00000 n 
+0000758468 00000 n 
+0001205073 00000 n 
+0000100262 00000 n 
+0000100433 00000 n 
+0000760059 00000 n 
+0001204974 00000 n 
+0000100495 00000 n 
+0000100666 00000 n 
+0000760248 00000 n 
+0001204875 00000 n 
+0000100728 00000 n 
+0000100899 00000 n 
+0000760374 00000 n 
+0001204776 00000 n 
+0000100961 00000 n 
+0000101137 00000 n 
+0000763363 00000 n 
+0001204677 00000 n 
+0000101199 00000 n 
+0000101375 00000 n 
+0000763552 00000 n 
+0001204578 00000 n 
+0000101437 00000 n 
+0000101608 00000 n 
+0000766172 00000 n 
+0001204479 00000 n 
+0000101670 00000 n 
+0000101811 00000 n 
+0000766361 00000 n 
+0001204380 00000 n 
+0000101873 00000 n 
+0000102034 00000 n 
+0000766550 00000 n 
+0001204281 00000 n 
+0000102096 00000 n 
+0000102257 00000 n 
+0000768974 00000 n 
+0001204182 00000 n 
+0000102319 00000 n 
+0000102520 00000 n 
+0000769163 00000 n 
+0001204083 00000 n 
+0000102582 00000 n 
+0000102753 00000 n 
+0000769351 00000 n 
+0001203984 00000 n 
+0000102815 00000 n 
+0000102991 00000 n 
+0000772099 00000 n 
+0001203885 00000 n 
+0000103053 00000 n 
+0000103229 00000 n 
+0000772287 00000 n 
+0001203786 00000 n 
+0000103291 00000 n 
+0000103487 00000 n 
+0000775339 00000 n 
+0001203687 00000 n 
+0000103549 00000 n 
+0000103770 00000 n 
+0000775528 00000 n 
+0001203588 00000 n 
+0000103832 00000 n 
+0000104043 00000 n 
+0000781992 00000 n 
+0001203504 00000 n 
+0000104105 00000 n 
+0000104286 00000 n 
+0000782181 00000 n 
+0001203406 00000 n 
+0000104337 00000 n 
+0000104442 00000 n 
+0000792233 00000 n 
+0001203267 00000 n 
+0000104493 00000 n 
+0000104699 00000 n 
+0000796475 00000 n 
+0001203183 00000 n 
+0000104755 00000 n 
+0000104925 00000 n 
+0000796538 00000 n 
+0001203058 00000 n 
+0000104981 00000 n 
+0000105161 00000 n 
+0000796664 00000 n 
+0001202974 00000 n 
+0000105222 00000 n 
+0000105380 00000 n 
+0000799010 00000 n 
+0001202875 00000 n 
+0000105441 00000 n 
+0000105594 00000 n 
+0000799199 00000 n 
+0001202776 00000 n 
+0000105655 00000 n 
+0000105793 00000 n 
+0000799387 00000 n 
+0001202677 00000 n 
+0000105854 00000 n 
+0000105982 00000 n 
+0000801529 00000 n 
+0001202578 00000 n 
+0000106043 00000 n 
+0000106176 00000 n 
+0000801718 00000 n 
+0001202479 00000 n 
+0000106237 00000 n 
+0000106370 00000 n 
+0000801905 00000 n 
+0001202380 00000 n 
+0000106431 00000 n 
+0000106564 00000 n 
+0000804303 00000 n 
+0001202281 00000 n 
+0000106625 00000 n 
+0000106753 00000 n 
+0000804492 00000 n 
+0001202197 00000 n 
+0000106814 00000 n 
+0000106947 00000 n 
+0000804681 00000 n 
+0001202099 00000 n 
+0000106998 00000 n 
+0000107123 00000 n 
+0000815964 00000 n 
+0001201960 00000 n 
+0000107174 00000 n 
+0000107380 00000 n 
+0000816089 00000 n 
+0001201876 00000 n 
+0000107436 00000 n 
+0000107606 00000 n 
+0000816152 00000 n 
+0001201751 00000 n 
+0000107662 00000 n 
+0000107842 00000 n 
+0000818593 00000 n 
+0001201667 00000 n 
+0000107903 00000 n 
+0000108051 00000 n 
+0000818782 00000 n 
+0001201568 00000 n 
+0000108112 00000 n 
+0000108290 00000 n 
+0000818970 00000 n 
+0001201469 00000 n 
+0000108351 00000 n 
+0000108524 00000 n 
+0000823648 00000 n 
+0001201385 00000 n 
+0000108585 00000 n 
+0000108769 00000 n 
+0000823837 00000 n 
+0001201287 00000 n 
+0000108820 00000 n 
+0000108945 00000 n 
+0000823963 00000 n 
+0001201148 00000 n 
+0000108996 00000 n 
+0000109187 00000 n 
+0000824026 00000 n 
+0001201079 00000 n 
+0000109243 00000 n 
+0000109413 00000 n 
+0000829018 00000 n 
+0001200981 00000 n 
+0000109464 00000 n 
+0000109574 00000 n 
+0000829144 00000 n 
+0001200842 00000 n 
+0000109625 00000 n 
+0000109816 00000 n 
+0000843065 00000 n 
+0001200758 00000 n 
+0000109872 00000 n 
+0000110042 00000 n 
+0000843128 00000 n 
+0001200617 00000 n 
+0000110098 00000 n 
+0000110321 00000 n 
+0000844181 00000 n 
+0001200533 00000 n 
+0000110382 00000 n 
+0000110502 00000 n 
+0000844308 00000 n 
+0001200434 00000 n 
+0000110563 00000 n 
+0000110683 00000 n 
+0000844435 00000 n 
+0001200335 00000 n 
+0000110744 00000 n 
+0000110864 00000 n 
+0000844562 00000 n 
+0001200236 00000 n 
+0000110925 00000 n 
+0000111040 00000 n 
+0000844689 00000 n 
+0001200137 00000 n 
+0000111101 00000 n 
+0000111216 00000 n 
+0000844816 00000 n 
+0001200038 00000 n 
+0000111277 00000 n 
+0000111402 00000 n 
+0000844943 00000 n 
+0001199939 00000 n 
+0000111463 00000 n 
+0000111588 00000 n 
+0000845070 00000 n 
+0001199840 00000 n 
+0000111649 00000 n 
+0000111774 00000 n 
+0000846832 00000 n 
+0001199741 00000 n 
+0000111835 00000 n 
+0000111970 00000 n 
+0000846959 00000 n 
+0001199642 00000 n 
+0000112032 00000 n 
+0000112167 00000 n 
+0000847085 00000 n 
+0001199543 00000 n 
+0000112229 00000 n 
+0000112369 00000 n 
+0000847211 00000 n 
+0001199459 00000 n 
+0000112431 00000 n 
+0000112571 00000 n 
+0000847274 00000 n 
+0001199318 00000 n 
+0000112627 00000 n 
+0000112807 00000 n 
+0000847400 00000 n 
+0001199234 00000 n 
+0000112868 00000 n 
+0000113047 00000 n 
+0000847588 00000 n 
+0001199135 00000 n 
+0000113108 00000 n 
+0000113287 00000 n 
+0000851044 00000 n 
+0001199036 00000 n 
+0000113348 00000 n 
+0000113570 00000 n 
+0000851233 00000 n 
+0001198937 00000 n 
+0000113631 00000 n 
+0000113838 00000 n 
+0000853975 00000 n 
+0001198838 00000 n 
+0000113899 00000 n 
+0000114083 00000 n 
+0000854164 00000 n 
+0001198739 00000 n 
+0000114144 00000 n 
+0000114346 00000 n 
+0000854353 00000 n 
+0001198640 00000 n 
+0000114407 00000 n 
+0000114604 00000 n 
+0000856738 00000 n 
+0001198541 00000 n 
+0000114665 00000 n 
+0000114882 00000 n 
+0000856927 00000 n 
+0001198442 00000 n 
+0000114943 00000 n 
+0000115122 00000 n 
+0000857116 00000 n 
+0001198343 00000 n 
+0000115184 00000 n 
+0000115378 00000 n 
+0000859499 00000 n 
+0001198244 00000 n 
+0000115440 00000 n 
+0000115629 00000 n 
+0000859687 00000 n 
+0001198145 00000 n 
+0000115691 00000 n 
+0000115875 00000 n 
+0000859876 00000 n 
+0001198046 00000 n 
+0000115937 00000 n 
+0000116169 00000 n 
+0000861936 00000 n 
+0001197947 00000 n 
+0000116231 00000 n 
+0000116438 00000 n 
+0000862125 00000 n 
+0001197848 00000 n 
+0000116500 00000 n 
+0000116712 00000 n 
+0000862314 00000 n 
+0001197749 00000 n 
+0000116774 00000 n 
+0000116978 00000 n 
+0000864618 00000 n 
+0001197650 00000 n 
+0000117040 00000 n 
+0000117239 00000 n 
+0000864806 00000 n 
+0001197566 00000 n 
+0000117301 00000 n 
+0000117498 00000 n 
+0000864931 00000 n 
+0001197440 00000 n 
+0000117554 00000 n 
+0000117734 00000 n 
+0000867279 00000 n 
+0001197356 00000 n 
+0000117795 00000 n 
+0000117910 00000 n 
+0000867406 00000 n 
+0001197257 00000 n 
+0000117971 00000 n 
+0000118086 00000 n 
+0000867533 00000 n 
+0001197158 00000 n 
+0000118147 00000 n 
+0000118262 00000 n 
+0000867659 00000 n 
+0001197059 00000 n 
+0000118323 00000 n 
+0000118438 00000 n 
+0000867784 00000 n 
+0001196960 00000 n 
+0000118499 00000 n 
+0000118614 00000 n 
+0000867911 00000 n 
+0001196861 00000 n 
+0000118675 00000 n 
+0000118790 00000 n 
+0000868038 00000 n 
+0001196762 00000 n 
+0000118851 00000 n 
+0000118966 00000 n 
+0000868163 00000 n 
+0001196663 00000 n 
+0000119027 00000 n 
+0000119142 00000 n 
+0000878654 00000 n 
+0001196564 00000 n 
+0000119203 00000 n 
+0000119318 00000 n 
+0000878781 00000 n 
+0001196480 00000 n 
+0000119380 00000 n 
+0000119500 00000 n 
+0000878908 00000 n 
+0001196382 00000 n 
+0000119551 00000 n 
+0000119661 00000 n 
+0000886730 00000 n 
+0001196299 00000 n 
+0000119712 00000 n 
+0000119809 00000 n 
+0000897291 00000 n 
+0001196216 00000 n 
+0000119859 00000 n 
+0000119913 00000 n 
+0000120206 00000 n 
+0000120392 00000 n 
+0000119965 00000 n 
+0000120329 00000 n 
+0001190331 00000 n 
+0001191471 00000 n 
+0000120690 00000 n 
+0000120567 00000 n 
+0000120466 00000 n 
+0000122492 00000 n 
+0000122643 00000 n 
+0000122796 00000 n 
+0000122956 00000 n 
+0000123116 00000 n 
+0000123268 00000 n 
+0000123428 00000 n 
+0000123588 00000 n 
+0000123739 00000 n 
+0000123892 00000 n 
+0000124043 00000 n 
+0000124196 00000 n 
+0000124347 00000 n 
+0000124500 00000 n 
+0000124651 00000 n 
+0000124804 00000 n 
+0000124962 00000 n 
+0000125122 00000 n 
+0000125286 00000 n 
+0000125451 00000 n 
+0000125616 00000 n 
+0000125780 00000 n 
+0000125944 00000 n 
+0000126109 00000 n 
+0000126274 00000 n 
+0000126438 00000 n 
+0000126591 00000 n 
+0000126743 00000 n 
+0000126901 00000 n 
+0000127061 00000 n 
+0000127226 00000 n 
+0000127391 00000 n 
+0000127556 00000 n 
+0000127721 00000 n 
+0000127874 00000 n 
+0000128032 00000 n 
+0000128192 00000 n 
+0000128357 00000 n 
+0000128522 00000 n 
+0000128684 00000 n 
+0000130601 00000 n 
+0000128896 00000 n 
+0000121997 00000 n 
+0000120732 00000 n 
+0001188444 00000 n 
+0000128833 00000 n 
+0000130759 00000 n 
+0000130919 00000 n 
+0000131084 00000 n 
+0000131249 00000 n 
+0000131414 00000 n 
+0000131567 00000 n 
+0000131724 00000 n 
+0000131884 00000 n 
+0000132047 00000 n 
+0000132211 00000 n 
+0000132364 00000 n 
+0000132522 00000 n 
+0000132675 00000 n 
+0000132833 00000 n 
+0000132993 00000 n 
+0000133158 00000 n 
+0000133323 00000 n 
+0000133488 00000 n 
+0000133653 00000 n 
+0000133817 00000 n 
+0000133982 00000 n 
+0000134147 00000 n 
+0000134311 00000 n 
+0000134476 00000 n 
+0000134642 00000 n 
+0000134808 00000 n 
+0000134973 00000 n 
+0000135137 00000 n 
+0000135303 00000 n 
+0000135456 00000 n 
+0000135613 00000 n 
+0000135773 00000 n 
+0000135938 00000 n 
+0000136102 00000 n 
+0000136267 00000 n 
+0000136432 00000 n 
+0000136597 00000 n 
+0000136761 00000 n 
+0000136925 00000 n 
+0000137089 00000 n 
+0000137253 00000 n 
+0000139141 00000 n 
+0000137416 00000 n 
+0000130088 00000 n 
+0000128984 00000 n 
+0000139307 00000 n 
+0000139473 00000 n 
+0000139639 00000 n 
+0000139805 00000 n 
+0000139971 00000 n 
+0000140137 00000 n 
+0000140303 00000 n 
+0000140468 00000 n 
+0000140633 00000 n 
+0000140798 00000 n 
+0000140960 00000 n 
+0000141126 00000 n 
+0000141292 00000 n 
+0000141458 00000 n 
+0000141624 00000 n 
+0000141789 00000 n 
+0000141955 00000 n 
+0000142121 00000 n 
+0000142274 00000 n 
+0000142433 00000 n 
+0000142593 00000 n 
+0000142759 00000 n 
+0000142925 00000 n 
+0000143076 00000 n 
+0000143227 00000 n 
+0000143385 00000 n 
+0000143545 00000 n 
+0000143709 00000 n 
+0000143874 00000 n 
+0000144038 00000 n 
+0000144203 00000 n 
+0000144368 00000 n 
+0000144533 00000 n 
+0000144698 00000 n 
+0000144863 00000 n 
+0000145028 00000 n 
+0000145194 00000 n 
+0000145360 00000 n 
+0000145524 00000 n 
+0000145689 00000 n 
+0000147548 00000 n 
+0000145853 00000 n 
+0000138637 00000 n 
+0000137504 00000 n 
+0000147714 00000 n 
+0000147880 00000 n 
+0000148046 00000 n 
+0000148212 00000 n 
+0000148378 00000 n 
+0000148544 00000 n 
+0000148709 00000 n 
+0000148874 00000 n 
+0000149040 00000 n 
+0000149206 00000 n 
+0000149372 00000 n 
+0000149538 00000 n 
+0000149704 00000 n 
+0000149869 00000 n 
+0000150035 00000 n 
+0000150201 00000 n 
+0000150366 00000 n 
+0000150532 00000 n 
+0000150698 00000 n 
+0000150864 00000 n 
+0000151030 00000 n 
+0000151196 00000 n 
+0000151362 00000 n 
+0000151528 00000 n 
+0000151693 00000 n 
+0000151859 00000 n 
+0000152025 00000 n 
+0000152190 00000 n 
+0000152356 00000 n 
+0000152522 00000 n 
+0000152688 00000 n 
+0000152854 00000 n 
+0000153020 00000 n 
+0000153185 00000 n 
+0000153351 00000 n 
+0000153517 00000 n 
+0000153683 00000 n 
+0000153849 00000 n 
+0000154014 00000 n 
+0000154180 00000 n 
+0000154345 00000 n 
+0000156157 00000 n 
+0000154509 00000 n 
+0000147035 00000 n 
+0000145941 00000 n 
+0000156323 00000 n 
+0000156489 00000 n 
+0000156653 00000 n 
+0000156819 00000 n 
+0000156985 00000 n 
+0000157150 00000 n 
+0000157315 00000 n 
+0000157479 00000 n 
+0000157644 00000 n 
+0000157810 00000 n 
+0000157976 00000 n 
+0000158142 00000 n 
+0000158308 00000 n 
+0000158473 00000 n 
+0000158638 00000 n 
+0000158803 00000 n 
+0000158969 00000 n 
+0000159135 00000 n 
+0000159301 00000 n 
+0000159467 00000 n 
+0000159633 00000 n 
+0000159799 00000 n 
+0000159965 00000 n 
+0000160131 00000 n 
+0000160296 00000 n 
+0000160462 00000 n 
+0000160628 00000 n 
+0000160793 00000 n 
+0000160958 00000 n 
+0000161123 00000 n 
+0000161288 00000 n 
+0000161454 00000 n 
+0000161620 00000 n 
+0000161786 00000 n 
+0000161952 00000 n 
+0000162118 00000 n 
+0000162283 00000 n 
+0000162448 00000 n 
+0000162612 00000 n 
+0000162778 00000 n 
+0000162943 00000 n 
+0000164881 00000 n 
+0000163106 00000 n 
+0000155644 00000 n 
+0000154597 00000 n 
+0001191596 00000 n 
+0000165047 00000 n 
+0000165214 00000 n 
+0000165379 00000 n 
+0000165546 00000 n 
+0000165713 00000 n 
+0000165880 00000 n 
+0000166047 00000 n 
+0000166213 00000 n 
+0000166380 00000 n 
+0000166547 00000 n 
+0000166714 00000 n 
+0000166881 00000 n 
+0000167048 00000 n 
+0000167214 00000 n 
+0000167381 00000 n 
+0000167548 00000 n 
+0000167714 00000 n 
+0000167881 00000 n 
+0000168047 00000 n 
+0000168214 00000 n 
+0000168381 00000 n 
+0000168548 00000 n 
+0000168715 00000 n 
+0000168882 00000 n 
+0000169048 00000 n 
+0000169215 00000 n 
+0000169382 00000 n 
+0000169548 00000 n 
+0000169715 00000 n 
+0000169882 00000 n 
+0000170049 00000 n 
+0000170215 00000 n 
+0000170382 00000 n 
+0000170548 00000 n 
+0000170715 00000 n 
+0000170882 00000 n 
+0000171049 00000 n 
+0000171216 00000 n 
+0000171382 00000 n 
+0000171549 00000 n 
+0000171715 00000 n 
+0000173664 00000 n 
+0000171880 00000 n 
+0000164368 00000 n 
+0000163194 00000 n 
+0000173831 00000 n 
+0000173998 00000 n 
+0000174163 00000 n 
+0000174330 00000 n 
+0000174497 00000 n 
+0000174664 00000 n 
+0000174831 00000 n 
+0000174997 00000 n 
+0000175164 00000 n 
+0000175331 00000 n 
+0000175498 00000 n 
+0000175665 00000 n 
+0000175832 00000 n 
+0000175998 00000 n 
+0000176165 00000 n 
+0000176332 00000 n 
+0000176498 00000 n 
+0000176665 00000 n 
+0000176832 00000 n 
+0000176999 00000 n 
+0000177166 00000 n 
+0000177333 00000 n 
+0000177499 00000 n 
+0000177666 00000 n 
+0000177832 00000 n 
+0000177999 00000 n 
+0000178166 00000 n 
+0000178332 00000 n 
+0000178499 00000 n 
+0000178666 00000 n 
+0000178833 00000 n 
+0000179000 00000 n 
+0000179167 00000 n 
+0000179333 00000 n 
+0000179500 00000 n 
+0000179667 00000 n 
+0000179834 00000 n 
+0000180001 00000 n 
+0000180167 00000 n 
+0000180334 00000 n 
+0000180500 00000 n 
+0000182475 00000 n 
+0000180665 00000 n 
+0000173151 00000 n 
+0000171968 00000 n 
+0000182642 00000 n 
+0000182802 00000 n 
+0000182967 00000 n 
+0000183132 00000 n 
+0000183297 00000 n 
+0000183462 00000 n 
+0000183627 00000 n 
+0000183791 00000 n 
+0000183954 00000 n 
+0000184107 00000 n 
+0000184260 00000 n 
+0000184418 00000 n 
+0000184578 00000 n 
+0000184742 00000 n 
+0000184907 00000 n 
+0000185066 00000 n 
+0000185230 00000 n 
+0000185395 00000 n 
+0000185548 00000 n 
+0000185701 00000 n 
+0000185859 00000 n 
+0000186018 00000 n 
+0000186183 00000 n 
+0000186348 00000 n 
+0000186500 00000 n 
+0000186653 00000 n 
+0000186810 00000 n 
+0000186969 00000 n 
+0000187134 00000 n 
+0000187292 00000 n 
+0000187455 00000 n 
+0000187620 00000 n 
+0000187785 00000 n 
+0000187937 00000 n 
+0000188090 00000 n 
+0000188248 00000 n 
+0000188407 00000 n 
+0000188571 00000 n 
+0000188735 00000 n 
+0000188900 00000 n 
+0000189064 00000 n 
+0000191100 00000 n 
+0000189227 00000 n 
+0000181962 00000 n 
+0000180753 00000 n 
+0000191265 00000 n 
+0000191429 00000 n 
+0000191594 00000 n 
+0000191759 00000 n 
+0000191925 00000 n 
+0000192091 00000 n 
+0000192257 00000 n 
+0000192422 00000 n 
+0000192588 00000 n 
+0000192753 00000 n 
+0000192919 00000 n 
+0000193083 00000 n 
+0000193237 00000 n 
+0000193390 00000 n 
+0000193551 00000 n 
+0000193712 00000 n 
+0000193877 00000 n 
+0000194043 00000 n 
+0000194209 00000 n 
+0000194375 00000 n 
+0000194541 00000 n 
+0000194707 00000 n 
+0000194872 00000 n 
+0000195038 00000 n 
+0000195204 00000 n 
+0000195371 00000 n 
+0000195537 00000 n 
+0000195703 00000 n 
+0000195870 00000 n 
+0000196037 00000 n 
+0000196204 00000 n 
+0000196371 00000 n 
+0000196538 00000 n 
+0000196705 00000 n 
+0000196872 00000 n 
+0000197039 00000 n 
+0000197206 00000 n 
+0000197372 00000 n 
+0000197538 00000 n 
+0000197705 00000 n 
+0000197871 00000 n 
+0000199891 00000 n 
+0000198036 00000 n 
+0000190587 00000 n 
+0000189315 00000 n 
+0000200058 00000 n 
+0000200225 00000 n 
+0000200392 00000 n 
+0000200559 00000 n 
+0000200713 00000 n 
+0000200867 00000 n 
+0000201027 00000 n 
+0000201188 00000 n 
+0000201354 00000 n 
+0000201520 00000 n 
+0000201686 00000 n 
+0000201852 00000 n 
+0000202017 00000 n 
+0000202183 00000 n 
+0000202349 00000 n 
+0000202514 00000 n 
+0000202679 00000 n 
+0000202846 00000 n 
+0000203013 00000 n 
+0000203180 00000 n 
+0000203347 00000 n 
+0000203514 00000 n 
+0000203681 00000 n 
+0000203848 00000 n 
+0000204015 00000 n 
+0000204182 00000 n 
+0000204348 00000 n 
+0000204514 00000 n 
+0000204681 00000 n 
+0000204848 00000 n 
+0000205014 00000 n 
+0000205168 00000 n 
+0000205322 00000 n 
+0000205483 00000 n 
+0000205644 00000 n 
+0000205810 00000 n 
+0000205976 00000 n 
+0000206142 00000 n 
+0000206307 00000 n 
+0000206473 00000 n 
+0000206638 00000 n 
+0000208573 00000 n 
+0000206802 00000 n 
+0000199378 00000 n 
+0000198124 00000 n 
+0000208738 00000 n 
+0000208904 00000 n 
+0000209071 00000 n 
+0000209238 00000 n 
+0000209404 00000 n 
+0000209558 00000 n 
+0000209712 00000 n 
+0000209873 00000 n 
+0000210033 00000 n 
+0000210199 00000 n 
+0000210365 00000 n 
+0000210531 00000 n 
+0000210697 00000 n 
+0000210863 00000 n 
+0000211029 00000 n 
+0000211194 00000 n 
+0000211359 00000 n 
+0000211525 00000 n 
+0000211692 00000 n 
+0000211859 00000 n 
+0000212025 00000 n 
+0000212192 00000 n 
+0000212359 00000 n 
+0000212526 00000 n 
+0000212693 00000 n 
+0000212859 00000 n 
+0000213013 00000 n 
+0000213166 00000 n 
+0000213327 00000 n 
+0000213487 00000 n 
+0000213653 00000 n 
+0000213819 00000 n 
+0000213972 00000 n 
+0000214126 00000 n 
+0000214287 00000 n 
+0000214448 00000 n 
+0000214614 00000 n 
+0000214779 00000 n 
+0000214944 00000 n 
+0000215110 00000 n 
+0000215274 00000 n 
+0000217236 00000 n 
+0000215438 00000 n 
+0000208060 00000 n 
+0000206890 00000 n 
+0001191721 00000 n 
+0000217402 00000 n 
+0000217556 00000 n 
+0000217708 00000 n 
+0000217869 00000 n 
+0000218030 00000 n 
+0000218196 00000 n 
+0000218361 00000 n 
+0000218526 00000 n 
+0000218692 00000 n 
+0000218858 00000 n 
+0000219024 00000 n 
+0000219190 00000 n 
+0000219356 00000 n 
+0000219522 00000 n 
+0000219689 00000 n 
+0000219856 00000 n 
+0000220022 00000 n 
+0000220189 00000 n 
+0000220356 00000 n 
+0000220523 00000 n 
+0000220690 00000 n 
+0000220857 00000 n 
+0000221024 00000 n 
+0000221191 00000 n 
+0000221358 00000 n 
+0000221525 00000 n 
+0000221691 00000 n 
+0000221857 00000 n 
+0000222024 00000 n 
+0000222191 00000 n 
+0000222357 00000 n 
+0000222511 00000 n 
+0000222665 00000 n 
+0000222826 00000 n 
+0000222987 00000 n 
+0000223153 00000 n 
+0000223319 00000 n 
+0000223484 00000 n 
+0000223649 00000 n 
+0000223815 00000 n 
+0000223980 00000 n 
+0000225908 00000 n 
+0000224144 00000 n 
+0000216723 00000 n 
+0000215526 00000 n 
+0000226073 00000 n 
+0000226239 00000 n 
+0000226391 00000 n 
+0000226545 00000 n 
+0000226706 00000 n 
+0000226867 00000 n 
+0000227031 00000 n 
+0000227196 00000 n 
+0000227361 00000 n 
+0000227527 00000 n 
+0000227676 00000 n 
+0000227830 00000 n 
+0000227991 00000 n 
+0000228143 00000 n 
+0000228297 00000 n 
+0000228457 00000 n 
+0000228617 00000 n 
+0000228783 00000 n 
+0000228949 00000 n 
+0000229115 00000 n 
+0000229281 00000 n 
+0000229447 00000 n 
+0000229613 00000 n 
+0000229779 00000 n 
+0000229944 00000 n 
+0000230110 00000 n 
+0000230277 00000 n 
+0000230443 00000 n 
+0000230610 00000 n 
+0000230770 00000 n 
+0000230936 00000 n 
+0000231101 00000 n 
+0000231267 00000 n 
+0000231431 00000 n 
+0000231597 00000 n 
+0000231762 00000 n 
+0000231927 00000 n 
+0000232092 00000 n 
+0000232257 00000 n 
+0000232424 00000 n 
+0000232590 00000 n 
+0000233907 00000 n 
+0000232755 00000 n 
+0000225395 00000 n 
+0000224232 00000 n 
+0000234074 00000 n 
+0000234241 00000 n 
+0000234408 00000 n 
+0000234575 00000 n 
+0000234742 00000 n 
+0000234909 00000 n 
+0000235070 00000 n 
+0000235235 00000 n 
+0000235401 00000 n 
+0000235567 00000 n 
+0000235728 00000 n 
+0000235894 00000 n 
+0000236060 00000 n 
+0000236225 00000 n 
+0000236391 00000 n 
+0000236557 00000 n 
+0000236723 00000 n 
+0000236877 00000 n 
+0000237028 00000 n 
+0000237180 00000 n 
+0000233592 00000 n 
+0000232843 00000 n 
+0000239411 00000 n 
+0000239594 00000 n 
+0000240573 00000 n 
+0000239249 00000 n 
+0000237268 00000 n 
+0000239953 00000 n 
+0001189386 00000 n 
+0000240076 00000 n 
+0000240139 00000 n 
+0001191273 00000 n 
+0000240262 00000 n 
+0001186556 00000 n 
+0000240387 00000 n 
+0001184499 00000 n 
+0001182204 00000 n 
+0000239774 00000 n 
+0000240511 00000 n 
+0000243241 00000 n 
+0000243518 00000 n 
+0000243097 00000 n 
+0000240731 00000 n 
+0000243394 00000 n 
+0000340101 00000 n 
+0000246045 00000 n 
+0000245859 00000 n 
+0000243634 00000 n 
+0000245982 00000 n 
+0001191846 00000 n 
+0000248756 00000 n 
+0000249158 00000 n 
+0000248612 00000 n 
+0000246147 00000 n 
+0000248909 00000 n 
+0000248972 00000 n 
+0000249096 00000 n 
+0000250709 00000 n 
+0000250986 00000 n 
+0000250565 00000 n 
+0000249274 00000 n 
+0000250862 00000 n 
+0000251582 00000 n 
+0000251396 00000 n 
+0000251102 00000 n 
+0000251519 00000 n 
+0000253652 00000 n 
+0000253831 00000 n 
+0000254010 00000 n 
+0000254168 00000 n 
+0000255200 00000 n 
+0000253481 00000 n 
+0000251656 00000 n 
+0000254322 00000 n 
+0000254446 00000 n 
+0000254509 00000 n 
+0000254634 00000 n 
+0000254697 00000 n 
+0000254760 00000 n 
+0000254823 00000 n 
+0000254886 00000 n 
+0000254949 00000 n 
+0000255012 00000 n 
+0000255075 00000 n 
+0000255138 00000 n 
+0000684720 00000 n 
+0000257816 00000 n 
+0000258740 00000 n 
+0000257663 00000 n 
+0000255316 00000 n 
+0000258236 00000 n 
+0000258299 00000 n 
+0000258362 00000 n 
+0000258425 00000 n 
+0001181261 00000 n 
+0000258488 00000 n 
+0000258551 00000 n 
+0000258614 00000 n 
+0000258677 00000 n 
+0001183351 00000 n 
+0000258028 00000 n 
+0000260063 00000 n 
+0000260217 00000 n 
+0000260372 00000 n 
+0000260535 00000 n 
+0000260690 00000 n 
+0000260849 00000 n 
+0000261004 00000 n 
+0000261158 00000 n 
+0000261313 00000 n 
+0000261467 00000 n 
+0000261622 00000 n 
+0000261773 00000 n 
+0000261928 00000 n 
+0000262083 00000 n 
+0000262238 00000 n 
+0000262392 00000 n 
+0000262546 00000 n 
+0000262700 00000 n 
+0000262863 00000 n 
+0000263018 00000 n 
+0000263174 00000 n 
+0000263515 00000 n 
+0000259739 00000 n 
+0000258898 00000 n 
+0000263330 00000 n 
+0001191971 00000 n 
+0000275511 00000 n 
+0000278768 00000 n 
+0000288410 00000 n 
+0000290533 00000 n 
+0000293178 00000 n 
+0000295804 00000 n 
+0000298792 00000 n 
+0000305823 00000 n 
+0000311699 00000 n 
+0000335068 00000 n 
+0000264103 00000 n 
+0000263917 00000 n 
+0000263617 00000 n 
+0000264040 00000 n 
+0000265846 00000 n 
+0000265998 00000 n 
+0000266153 00000 n 
+0000266308 00000 n 
+0000266463 00000 n 
+0000266624 00000 n 
+0000266779 00000 n 
+0000266935 00000 n 
+0000267090 00000 n 
+0000267253 00000 n 
+0000267408 00000 n 
+0000267571 00000 n 
+0000267727 00000 n 
+0000267888 00000 n 
+0000268043 00000 n 
+0000268200 00000 n 
+0000268355 00000 n 
+0000268512 00000 n 
+0000268668 00000 n 
+0000268824 00000 n 
+0000268980 00000 n 
+0000269139 00000 n 
+0000269295 00000 n 
+0000269449 00000 n 
+0000269605 00000 n 
+0000269763 00000 n 
+0000269919 00000 n 
+0000270077 00000 n 
+0000270233 00000 n 
+0000270388 00000 n 
+0000270544 00000 n 
+0000270700 00000 n 
+0000270855 00000 n 
+0000271011 00000 n 
+0000271173 00000 n 
+0000271513 00000 n 
+0000265396 00000 n 
+0000264177 00000 n 
+0000271328 00000 n 
+0000463693 00000 n 
+0000473123 00000 n 
+0000478883 00000 n 
+0000485286 00000 n 
+0000535338 00000 n 
+0000604366 00000 n 
+0000662781 00000 n 
+0000719326 00000 n 
+0000722748 00000 n 
+0000742595 00000 n 
+0000792170 00000 n 
+0000815901 00000 n 
+0000823900 00000 n 
+0000829081 00000 n 
+0000886667 00000 n 
+0000272092 00000 n 
+0000271906 00000 n 
+0000271615 00000 n 
+0000272029 00000 n 
+0000273195 00000 n 
+0000273385 00000 n 
+0000273575 00000 n 
+0000273763 00000 n 
+0000273952 00000 n 
+0000274104 00000 n 
+0000274292 00000 n 
+0000274444 00000 n 
+0000274632 00000 n 
+0000274817 00000 n 
+0000275007 00000 n 
+0000275197 00000 n 
+0000277067 00000 n 
+0000276006 00000 n 
+0000272952 00000 n 
+0000272166 00000 n 
+0000275387 00000 n 
+0000275635 00000 n 
+0000275820 00000 n 
+0000275944 00000 n 
+0000392362 00000 n 
+0000278020 00000 n 
+0000278145 00000 n 
+0000278270 00000 n 
+0000435347 00000 n 
+0000278394 00000 n 
+0000278519 00000 n 
+0000278644 00000 n 
+0000277255 00000 n 
+0000277407 00000 n 
+0000277559 00000 n 
+0000277745 00000 n 
+0000280939 00000 n 
+0000281126 00000 n 
+0000281314 00000 n 
+0000281501 00000 n 
+0000281689 00000 n 
+0000281877 00000 n 
+0000278830 00000 n 
+0000276887 00000 n 
+0000276136 00000 n 
+0000277896 00000 n 
+0000282065 00000 n 
+0000282253 00000 n 
+0000282441 00000 n 
+0000282629 00000 n 
+0000282816 00000 n 
+0000283003 00000 n 
+0000283190 00000 n 
+0000283378 00000 n 
+0000283566 00000 n 
+0000283754 00000 n 
+0000283942 00000 n 
+0000284130 00000 n 
+0000284318 00000 n 
+0000284506 00000 n 
+0000284694 00000 n 
+0000284882 00000 n 
+0000285070 00000 n 
+0000285258 00000 n 
+0000285445 00000 n 
+0000285633 00000 n 
+0000285826 00000 n 
+0000286019 00000 n 
+0000286210 00000 n 
+0000288597 00000 n 
+0000280543 00000 n 
+0000278932 00000 n 
+0000286402 00000 n 
+0000286527 00000 n 
+0000286590 00000 n 
+0000286653 00000 n 
+0000286716 00000 n 
+0000286779 00000 n 
+0000286842 00000 n 
+0000286904 00000 n 
+0000286967 00000 n 
+0000287030 00000 n 
+0000287093 00000 n 
+0000287155 00000 n 
+0000287218 00000 n 
+0000287281 00000 n 
+0000287344 00000 n 
+0000287406 00000 n 
+0000287469 00000 n 
+0000287532 00000 n 
+0000287595 00000 n 
+0000287657 00000 n 
+0000287720 00000 n 
+0000287783 00000 n 
+0000287846 00000 n 
+0000287908 00000 n 
+0000287971 00000 n 
+0000288034 00000 n 
+0000288097 00000 n 
+0000288159 00000 n 
+0000288222 00000 n 
+0000288285 00000 n 
+0000288348 00000 n 
+0000288534 00000 n 
+0001192096 00000 n 
+0000434715 00000 n 
+0000290030 00000 n 
+0000290155 00000 n 
+0000290281 00000 n 
+0000290407 00000 n 
+0000289690 00000 n 
+0000291830 00000 n 
+0000292019 00000 n 
+0000292207 00000 n 
+0000290658 00000 n 
+0000289546 00000 n 
+0000288713 00000 n 
+0000289843 00000 n 
+0000292396 00000 n 
+0000294454 00000 n 
+0000294643 00000 n 
+0000294832 00000 n 
+0000293303 00000 n 
+0000291659 00000 n 
+0000290774 00000 n 
+0000292553 00000 n 
+0000292616 00000 n 
+0000292803 00000 n 
+0000292928 00000 n 
+0000293053 00000 n 
+0001185647 00000 n 
+0000295022 00000 n 
+0000297241 00000 n 
+0000297428 00000 n 
+0000297615 00000 n 
+0000297801 00000 n 
+0000295928 00000 n 
+0000294283 00000 n 
+0000293447 00000 n 
+0000295177 00000 n 
+0000295240 00000 n 
+0000295427 00000 n 
+0000295552 00000 n 
+0000295678 00000 n 
+0000297987 00000 n 
+0000298140 00000 n 
+0000300846 00000 n 
+0000301002 00000 n 
+0000301157 00000 n 
+0000301310 00000 n 
+0000299295 00000 n 
+0000297052 00000 n 
+0000296044 00000 n 
+0000298293 00000 n 
+0000298356 00000 n 
+0000298543 00000 n 
+0000298668 00000 n 
+0000298917 00000 n 
+0000298980 00000 n 
+0000299043 00000 n 
+0000299106 00000 n 
+0000299169 00000 n 
+0000299232 00000 n 
+0000301468 00000 n 
+0000301657 00000 n 
+0000301847 00000 n 
+0000302035 00000 n 
+0000302225 00000 n 
+0000302414 00000 n 
+0000302601 00000 n 
+0000302753 00000 n 
+0000302941 00000 n 
+0000303093 00000 n 
+0000303280 00000 n 
+0000303432 00000 n 
+0000303620 00000 n 
+0000303807 00000 n 
+0000303996 00000 n 
+0000304183 00000 n 
+0000304373 00000 n 
+0000304560 00000 n 
+0000304750 00000 n 
+0000304940 00000 n 
+0000305129 00000 n 
+0000305319 00000 n 
+0000307181 00000 n 
+0000306197 00000 n 
+0000300477 00000 n 
+0000299425 00000 n 
+0000305509 00000 n 
+0000305572 00000 n 
+0000305635 00000 n 
+0000305698 00000 n 
+0000305948 00000 n 
+0000306135 00000 n 
+0000308322 00000 n 
+0000399232 00000 n 
+0000308448 00000 n 
+0000308574 00000 n 
+0000392236 00000 n 
+0000308698 00000 n 
+0000308824 00000 n 
+0000308950 00000 n 
+0000309076 00000 n 
+0000309201 00000 n 
+0000311070 00000 n 
+0000311196 00000 n 
+0000311321 00000 n 
+0000311447 00000 n 
+0000311573 00000 n 
+0000307369 00000 n 
+0000307557 00000 n 
+0000307709 00000 n 
+0000307861 00000 n 
+0000308013 00000 n 
+0000310420 00000 n 
+0000310606 00000 n 
+0000309264 00000 n 
+0000306992 00000 n 
+0000306313 00000 n 
+0000308197 00000 n 
+0001192221 00000 n 
+0000310792 00000 n 
+0000313500 00000 n 
+0000313699 00000 n 
+0000313898 00000 n 
+0000314052 00000 n 
+0000314251 00000 n 
+0000314449 00000 n 
+0000314648 00000 n 
+0000314835 00000 n 
+0000315034 00000 n 
+0000315233 00000 n 
+0000315432 00000 n 
+0000315631 00000 n 
+0000315786 00000 n 
+0000315984 00000 n 
+0000316138 00000 n 
+0000316337 00000 n 
+0000316489 00000 n 
+0000316686 00000 n 
+0000316885 00000 n 
+0000311824 00000 n 
+0000310258 00000 n 
+0000309366 00000 n 
+0000310945 00000 n 
+0000317072 00000 n 
+0000317224 00000 n 
+0000317421 00000 n 
+0000317620 00000 n 
+0000317806 00000 n 
+0000317958 00000 n 
+0000318155 00000 n 
+0000318352 00000 n 
+0000318539 00000 n 
+0000318691 00000 n 
+0000318888 00000 n 
+0000319086 00000 n 
+0000319274 00000 n 
+0000319426 00000 n 
+0000319623 00000 n 
+0000319820 00000 n 
+0000320008 00000 n 
+0000320160 00000 n 
+0000320357 00000 n 
+0000320508 00000 n 
+0000320704 00000 n 
+0000320903 00000 n 
+0000321090 00000 n 
+0000321289 00000 n 
+0000321477 00000 n 
+0000321676 00000 n 
+0000321831 00000 n 
+0000322029 00000 n 
+0000322184 00000 n 
+0000324044 00000 n 
+0000322947 00000 n 
+0000312933 00000 n 
+0000311940 00000 n 
+0000322383 00000 n 
+0000322446 00000 n 
+0000322633 00000 n 
+0000322758 00000 n 
+0000322884 00000 n 
+0000324661 00000 n 
+0000324787 00000 n 
+0000401700 00000 n 
+0000324912 00000 n 
+0000325037 00000 n 
+0000325163 00000 n 
+0000325289 00000 n 
+0000325415 00000 n 
+0000325541 00000 n 
+0000328005 00000 n 
+0000328131 00000 n 
+0000328257 00000 n 
+0000328382 00000 n 
+0000328508 00000 n 
+0000328634 00000 n 
+0000328760 00000 n 
+0000328885 00000 n 
+0000331278 00000 n 
+0000331403 00000 n 
+0000331529 00000 n 
+0000331655 00000 n 
+0000331781 00000 n 
+0000394060 00000 n 
+0000331906 00000 n 
+0000401574 00000 n 
+0000332032 00000 n 
+0000332157 00000 n 
+0000334942 00000 n 
+0000324198 00000 n 
+0000324385 00000 n 
+0000326558 00000 n 
+0000326712 00000 n 
+0000326864 00000 n 
+0000325604 00000 n 
+0000323882 00000 n 
+0000323063 00000 n 
+0000324536 00000 n 
+0000327051 00000 n 
+0000327202 00000 n 
+0000327390 00000 n 
+0000327542 00000 n 
+0000327730 00000 n 
+0000329949 00000 n 
+0000330137 00000 n 
+0000330289 00000 n 
+0000328948 00000 n 
+0000326351 00000 n 
+0000325720 00000 n 
+0000327880 00000 n 
+0000330476 00000 n 
+0000330627 00000 n 
+0000330779 00000 n 
+0000330966 00000 n 
+0000333447 00000 n 
+0000333602 00000 n 
+0000333756 00000 n 
+0000332220 00000 n 
+0000329751 00000 n 
+0000329050 00000 n 
+0000331153 00000 n 
+0000333909 00000 n 
+0000334099 00000 n 
+0000334287 00000 n 
+0000334478 00000 n 
+0000334666 00000 n 
+0000335630 00000 n 
+0000333240 00000 n 
+0000332322 00000 n 
+0000334817 00000 n 
+0000335193 00000 n 
+0000335379 00000 n 
+0000335504 00000 n 
+0001192346 00000 n 
+0000392113 00000 n 
+0000336233 00000 n 
+0000336047 00000 n 
+0000335746 00000 n 
+0000336170 00000 n 
+0000337532 00000 n 
+0000337685 00000 n 
+0000337845 00000 n 
+0000338001 00000 n 
+0000338157 00000 n 
+0000338314 00000 n 
+0000338479 00000 n 
+0000338667 00000 n 
+0000338855 00000 n 
+0000339043 00000 n 
+0000339230 00000 n 
+0000339418 00000 n 
+0000339604 00000 n 
+0000339790 00000 n 
+0000342447 00000 n 
+0000342635 00000 n 
+0000342821 00000 n 
+0000343009 00000 n 
+0000343197 00000 n 
+0000343385 00000 n 
+0000343573 00000 n 
+0000343761 00000 n 
+0000340352 00000 n 
+0000337271 00000 n 
+0000336307 00000 n 
+0000339976 00000 n 
+0000340226 00000 n 
+0000340289 00000 n 
+0000383853 00000 n 
+0000383978 00000 n 
+0000384104 00000 n 
+0000385345 00000 n 
+0000385471 00000 n 
+0000385597 00000 n 
+0000385723 00000 n 
+0000385849 00000 n 
+0000343949 00000 n 
+0000344136 00000 n 
+0000344324 00000 n 
+0000344512 00000 n 
+0000344700 00000 n 
+0000344888 00000 n 
+0000345076 00000 n 
+0000345264 00000 n 
+0000345452 00000 n 
+0000345640 00000 n 
+0000345828 00000 n 
+0000346016 00000 n 
+0000346203 00000 n 
+0000346391 00000 n 
+0000346579 00000 n 
+0000346767 00000 n 
+0000346955 00000 n 
+0000347142 00000 n 
+0000347330 00000 n 
+0000347517 00000 n 
+0000347705 00000 n 
+0000347893 00000 n 
+0000348081 00000 n 
+0000348269 00000 n 
+0000348456 00000 n 
+0000348644 00000 n 
+0000348831 00000 n 
+0000349019 00000 n 
+0000349206 00000 n 
+0000349394 00000 n 
+0000349581 00000 n 
+0000349768 00000 n 
+0000349956 00000 n 
+0000350143 00000 n 
+0000350331 00000 n 
+0000350519 00000 n 
+0000350707 00000 n 
+0000350895 00000 n 
+0000351083 00000 n 
+0000351271 00000 n 
+0000351459 00000 n 
+0000351647 00000 n 
+0000351835 00000 n 
+0000352023 00000 n 
+0000352211 00000 n 
+0000352398 00000 n 
+0000352586 00000 n 
+0000352774 00000 n 
+0000352962 00000 n 
+0000353150 00000 n 
+0000353338 00000 n 
+0000353526 00000 n 
+0000353713 00000 n 
+0000353901 00000 n 
+0000354087 00000 n 
+0000354273 00000 n 
+0000356386 00000 n 
+0000356574 00000 n 
+0000356762 00000 n 
+0000356950 00000 n 
+0000354522 00000 n 
+0000341736 00000 n 
+0000340496 00000 n 
+0000354459 00000 n 
+0000385974 00000 n 
+0000386100 00000 n 
+0000386226 00000 n 
+0000387580 00000 n 
+0000387706 00000 n 
+0000387832 00000 n 
+0000387958 00000 n 
+0000388084 00000 n 
+0000388210 00000 n 
+0000388336 00000 n 
+0000388461 00000 n 
+0000390150 00000 n 
+0000390276 00000 n 
+0000390402 00000 n 
+0000390527 00000 n 
+0000390653 00000 n 
+0000390779 00000 n 
+0000390904 00000 n 
+0000391988 00000 n 
+0000392488 00000 n 
+0000392614 00000 n 
+0000392740 00000 n 
+0000394186 00000 n 
+0000394311 00000 n 
+0000394437 00000 n 
+0000394563 00000 n 
+0000394689 00000 n 
+0000394815 00000 n 
+0000396430 00000 n 
+0000396556 00000 n 
+0000396680 00000 n 
+0000396806 00000 n 
+0000396932 00000 n 
+0000397058 00000 n 
+0000397183 00000 n 
+0000397309 00000 n 
+0000398980 00000 n 
+0000399106 00000 n 
+0000399357 00000 n 
+0000399483 00000 n 
+0000399609 00000 n 
+0000399735 00000 n 
+0000399861 00000 n 
+0000401448 00000 n 
+0000401826 00000 n 
+0000401952 00000 n 
+0000402078 00000 n 
+0000402204 00000 n 
+0000357138 00000 n 
+0000357325 00000 n 
+0000357513 00000 n 
+0000357699 00000 n 
+0000357885 00000 n 
+0000358070 00000 n 
+0000358258 00000 n 
+0000358446 00000 n 
+0000358633 00000 n 
+0000358820 00000 n 
+0000359007 00000 n 
+0000359194 00000 n 
+0000359382 00000 n 
+0000359569 00000 n 
+0000359757 00000 n 
+0000359945 00000 n 
+0000360133 00000 n 
+0000360321 00000 n 
+0000360509 00000 n 
+0000360696 00000 n 
+0000360884 00000 n 
+0000361072 00000 n 
+0000361259 00000 n 
+0000361447 00000 n 
+0000361635 00000 n 
+0000361822 00000 n 
+0000362009 00000 n 
+0000362195 00000 n 
+0000362382 00000 n 
+0000362569 00000 n 
+0000362757 00000 n 
+0000362944 00000 n 
+0000363131 00000 n 
+0000363319 00000 n 
+0000363507 00000 n 
+0000363695 00000 n 
+0000363883 00000 n 
+0000364071 00000 n 
+0000364259 00000 n 
+0000364447 00000 n 
+0000364635 00000 n 
+0000364823 00000 n 
+0000365010 00000 n 
+0000365198 00000 n 
+0000365386 00000 n 
+0000365574 00000 n 
+0000365762 00000 n 
+0000365949 00000 n 
+0000366135 00000 n 
+0000366321 00000 n 
+0000366505 00000 n 
+0000368692 00000 n 
+0000368880 00000 n 
+0000369067 00000 n 
+0000369255 00000 n 
+0000366754 00000 n 
+0000355756 00000 n 
+0000354624 00000 n 
+0000366691 00000 n 
+0000402329 00000 n 
+0000403443 00000 n 
+0000403569 00000 n 
+0000403695 00000 n 
+0000403821 00000 n 
+0000403947 00000 n 
+0000404073 00000 n 
+0000404199 00000 n 
+0000404325 00000 n 
+0000405479 00000 n 
+0000405605 00000 n 
+0000405731 00000 n 
+0000405857 00000 n 
+0000405983 00000 n 
+0000406109 00000 n 
+0000406235 00000 n 
+0000406361 00000 n 
+0000407352 00000 n 
+0000407478 00000 n 
+0000407604 00000 n 
+0000407730 00000 n 
+0000407856 00000 n 
+0000407982 00000 n 
+0000408108 00000 n 
+0000408234 00000 n 
+0000409411 00000 n 
+0000409536 00000 n 
+0000409661 00000 n 
+0000409787 00000 n 
+0000409911 00000 n 
+0000410036 00000 n 
+0000410162 00000 n 
+0000411330 00000 n 
+0000411456 00000 n 
+0000411581 00000 n 
+0000411707 00000 n 
+0000411833 00000 n 
+0000411959 00000 n 
+0000412085 00000 n 
+0000412211 00000 n 
+0000413298 00000 n 
+0000413424 00000 n 
+0000413550 00000 n 
+0000413676 00000 n 
+0000413802 00000 n 
+0000413928 00000 n 
+0000414054 00000 n 
+0000414180 00000 n 
+0000415308 00000 n 
+0000415434 00000 n 
+0000415560 00000 n 
+0000415686 00000 n 
+0000415812 00000 n 
+0000415938 00000 n 
+0000416064 00000 n 
+0000369443 00000 n 
+0000369631 00000 n 
+0000369819 00000 n 
+0000370007 00000 n 
+0000370195 00000 n 
+0000370382 00000 n 
+0000370569 00000 n 
+0000370757 00000 n 
+0000370945 00000 n 
+0000371133 00000 n 
+0000371321 00000 n 
+0000371509 00000 n 
+0000371697 00000 n 
+0000371883 00000 n 
+0000372071 00000 n 
+0000372259 00000 n 
+0000372447 00000 n 
+0000372635 00000 n 
+0000372822 00000 n 
+0000373010 00000 n 
+0000373197 00000 n 
+0000373384 00000 n 
+0000373572 00000 n 
+0000373760 00000 n 
+0000373948 00000 n 
+0000374135 00000 n 
+0000374323 00000 n 
+0000374510 00000 n 
+0000374698 00000 n 
+0000374886 00000 n 
+0000375074 00000 n 
+0000375262 00000 n 
+0000375449 00000 n 
+0000375637 00000 n 
+0000375825 00000 n 
+0000376013 00000 n 
+0000376201 00000 n 
+0000376389 00000 n 
+0000376577 00000 n 
+0000376765 00000 n 
+0000376953 00000 n 
+0000377141 00000 n 
+0000377328 00000 n 
+0000377516 00000 n 
+0000377704 00000 n 
+0000377892 00000 n 
+0000378078 00000 n 
+0000378265 00000 n 
+0000378453 00000 n 
+0000378639 00000 n 
+0000378823 00000 n 
+0000380416 00000 n 
+0000380604 00000 n 
+0000380792 00000 n 
+0000380980 00000 n 
+0000379072 00000 n 
+0000368062 00000 n 
+0000366842 00000 n 
+0000379009 00000 n 
+0000416190 00000 n 
+0000417233 00000 n 
+0000417358 00000 n 
+0000417482 00000 n 
+0000417608 00000 n 
+0000417734 00000 n 
+0000417859 00000 n 
+0000417984 00000 n 
+0000419175 00000 n 
+0000419301 00000 n 
+0000419427 00000 n 
+0000419553 00000 n 
+0000419679 00000 n 
+0000419804 00000 n 
+0000419930 00000 n 
+0000420055 00000 n 
+0000421239 00000 n 
+0000421365 00000 n 
+0000421491 00000 n 
+0000421617 00000 n 
+0000421743 00000 n 
+0000421869 00000 n 
+0000421995 00000 n 
+0000422121 00000 n 
+0000423315 00000 n 
+0000423442 00000 n 
+0000423569 00000 n 
+0000423696 00000 n 
+0000423822 00000 n 
+0000423949 00000 n 
+0000424076 00000 n 
+0000424203 00000 n 
+0000425413 00000 n 
+0000425540 00000 n 
+0000425667 00000 n 
+0000425793 00000 n 
+0000425920 00000 n 
+0000426046 00000 n 
+0000426173 00000 n 
+0000426300 00000 n 
+0000427458 00000 n 
+0000427585 00000 n 
+0000427712 00000 n 
+0000427838 00000 n 
+0000427965 00000 n 
+0000428092 00000 n 
+0000428219 00000 n 
+0000428346 00000 n 
+0000429530 00000 n 
+0000429657 00000 n 
+0000429783 00000 n 
+0000429910 00000 n 
+0000430037 00000 n 
+0000430164 00000 n 
+0000430291 00000 n 
+0000381168 00000 n 
+0000381355 00000 n 
+0000381543 00000 n 
+0000381730 00000 n 
+0000381918 00000 n 
+0000382105 00000 n 
+0000382293 00000 n 
+0000382481 00000 n 
+0000382669 00000 n 
+0000382856 00000 n 
+0000383044 00000 n 
+0000383232 00000 n 
+0000383419 00000 n 
+0000384168 00000 n 
+0000380128 00000 n 
+0000379160 00000 n 
+0000383604 00000 n 
+0000383667 00000 n 
+0001192471 00000 n 
+0000430417 00000 n 
+0000431570 00000 n 
+0000431697 00000 n 
+0000431824 00000 n 
+0000431951 00000 n 
+0000432078 00000 n 
+0000432205 00000 n 
+0000432332 00000 n 
+0000432459 00000 n 
+0000434525 00000 n 
+0000434841 00000 n 
+0000434968 00000 n 
+0000435095 00000 n 
+0000435220 00000 n 
+0000439870 00000 n 
+0000386289 00000 n 
+0000385097 00000 n 
+0000384284 00000 n 
+0000385220 00000 n 
+0000387267 00000 n 
+0000389649 00000 n 
+0000389837 00000 n 
+0000388524 00000 n 
+0000387123 00000 n 
+0000386391 00000 n 
+0000387455 00000 n 
+0000390967 00000 n 
+0000389496 00000 n 
+0000388626 00000 n 
+0000390025 00000 n 
+0000392803 00000 n 
+0000391740 00000 n 
+0000391083 00000 n 
+0000391863 00000 n 
+0000394877 00000 n 
+0000393812 00000 n 
+0000392905 00000 n 
+0000393935 00000 n 
+0000395933 00000 n 
+0000396119 00000 n 
+0000398479 00000 n 
+0000398667 00000 n 
+0000397371 00000 n 
+0000395780 00000 n 
+0000394979 00000 n 
+0000396305 00000 n 
+0001192596 00000 n 
+0000400949 00000 n 
+0000401136 00000 n 
+0000399924 00000 n 
+0000398326 00000 n 
+0000397487 00000 n 
+0000398855 00000 n 
+0000402392 00000 n 
+0000400796 00000 n 
+0000400040 00000 n 
+0000401323 00000 n 
+0000404388 00000 n 
+0000403195 00000 n 
+0000402494 00000 n 
+0000403318 00000 n 
+0000406424 00000 n 
+0000405231 00000 n 
+0000404490 00000 n 
+0000405354 00000 n 
+0000408297 00000 n 
+0000407104 00000 n 
+0000406526 00000 n 
+0000407227 00000 n 
+0000410226 00000 n 
+0000409163 00000 n 
+0000408399 00000 n 
+0000409286 00000 n 
+0001192721 00000 n 
+0000412273 00000 n 
+0000411082 00000 n 
+0000410328 00000 n 
+0000411205 00000 n 
+0000414243 00000 n 
+0000413050 00000 n 
+0000412375 00000 n 
+0000413173 00000 n 
+0000416253 00000 n 
+0000415060 00000 n 
+0000414345 00000 n 
+0000415183 00000 n 
+0000418048 00000 n 
+0000416985 00000 n 
+0000416355 00000 n 
+0000417108 00000 n 
+0000420117 00000 n 
+0000418927 00000 n 
+0000418150 00000 n 
+0000419050 00000 n 
+0000422184 00000 n 
+0000420991 00000 n 
+0000420219 00000 n 
+0000421114 00000 n 
+0001192846 00000 n 
+0000424266 00000 n 
+0000423066 00000 n 
+0000422286 00000 n 
+0000423189 00000 n 
+0000426362 00000 n 
+0000425164 00000 n 
+0000424368 00000 n 
+0000425287 00000 n 
+0000428409 00000 n 
+0000427209 00000 n 
+0000426464 00000 n 
+0000427332 00000 n 
+0000430480 00000 n 
+0000429281 00000 n 
+0000428511 00000 n 
+0000429404 00000 n 
+0000432522 00000 n 
+0000431321 00000 n 
+0000430582 00000 n 
+0000431444 00000 n 
+0000433461 00000 n 
+0000433649 00000 n 
+0000433837 00000 n 
+0000434025 00000 n 
+0000434212 00000 n 
+0000437584 00000 n 
+0000437772 00000 n 
+0000437960 00000 n 
+0000435410 00000 n 
+0000433281 00000 n 
+0000432624 00000 n 
+0000434399 00000 n 
+0001192971 00000 n 
+0000438112 00000 n 
+0000438270 00000 n 
+0000438429 00000 n 
+0000438617 00000 n 
+0000438804 00000 n 
+0000438992 00000 n 
+0000439180 00000 n 
+0000439368 00000 n 
+0000439556 00000 n 
+0000440124 00000 n 
+0000437341 00000 n 
+0000435512 00000 n 
+0000439744 00000 n 
+0000439997 00000 n 
+0000442202 00000 n 
+0000442016 00000 n 
+0000440226 00000 n 
+0000442139 00000 n 
+0000444228 00000 n 
+0000444042 00000 n 
+0000442290 00000 n 
+0000444165 00000 n 
+0000446198 00000 n 
+0000446385 00000 n 
+0000446572 00000 n 
+0000446758 00000 n 
+0000446910 00000 n 
+0000447101 00000 n 
+0000447293 00000 n 
+0000449843 00000 n 
+0000447548 00000 n 
+0000446000 00000 n 
+0000444316 00000 n 
+0000447485 00000 n 
+0000450037 00000 n 
+0000450197 00000 n 
+0000450387 00000 n 
+0000450575 00000 n 
+0000450730 00000 n 
+0000450920 00000 n 
+0000451075 00000 n 
+0000451264 00000 n 
+0000451450 00000 n 
+0000451639 00000 n 
+0000451828 00000 n 
+0000452017 00000 n 
+0000452173 00000 n 
+0000452363 00000 n 
+0000452550 00000 n 
+0000452738 00000 n 
+0000452893 00000 n 
+0000453083 00000 n 
+0000453238 00000 n 
+0000453428 00000 n 
+0000453583 00000 n 
+0000453773 00000 n 
+0000453960 00000 n 
+0000454150 00000 n 
+0000454337 00000 n 
+0000454527 00000 n 
+0000454714 00000 n 
+0000454904 00000 n 
+0000455093 00000 n 
+0000455282 00000 n 
+0000455471 00000 n 
+0000455660 00000 n 
+0000455816 00000 n 
+0000456002 00000 n 
+0000456192 00000 n 
+0000456349 00000 n 
+0000456547 00000 n 
+0000456745 00000 n 
+0000456901 00000 n 
+0000457099 00000 n 
+0000457287 00000 n 
+0000457485 00000 n 
+0000457683 00000 n 
+0000457880 00000 n 
+0000458078 00000 n 
+0000458233 00000 n 
+0000458432 00000 n 
+0000458588 00000 n 
+0000458787 00000 n 
+0000458942 00000 n 
+0000459140 00000 n 
+0000459328 00000 n 
+0000459483 00000 n 
+0000459682 00000 n 
+0000459870 00000 n 
+0000460024 00000 n 
+0000460222 00000 n 
+0000460410 00000 n 
+0000460563 00000 n 
+0000460761 00000 n 
+0000460949 00000 n 
+0000461102 00000 n 
+0000461300 00000 n 
+0000461488 00000 n 
+0000461641 00000 n 
+0000461839 00000 n 
+0000461991 00000 n 
+0000462189 00000 n 
+0000462374 00000 n 
+0000462559 00000 n 
+0000462757 00000 n 
+0000462914 00000 n 
+0000463112 00000 n 
+0000463268 00000 n 
+0000463466 00000 n 
+0000463756 00000 n 
+0000449024 00000 n 
+0000447636 00000 n 
+0000463630 00000 n 
+0000465159 00000 n 
+0000465350 00000 n 
+0000465537 00000 n 
+0000465728 00000 n 
+0000466739 00000 n 
+0000464988 00000 n 
+0000463844 00000 n 
+0000465919 00000 n 
+0000466045 00000 n 
+0000466108 00000 n 
+0000466297 00000 n 
+0000466423 00000 n 
+0000466613 00000 n 
+0001187498 00000 n 
+0001193096 00000 n 
+0000468886 00000 n 
+0000468605 00000 n 
+0000471049 00000 n 
+0000469201 00000 n 
+0000468461 00000 n 
+0000466911 00000 n 
+0000468760 00000 n 
+0000468823 00000 n 
+0000469012 00000 n 
+0000469075 00000 n 
+0000471238 00000 n 
+0000471428 00000 n 
+0000471625 00000 n 
+0000471780 00000 n 
+0000471935 00000 n 
+0000472090 00000 n 
+0000472287 00000 n 
+0000472442 00000 n 
+0000472597 00000 n 
+0000472752 00000 n 
+0000472905 00000 n 
+0000473564 00000 n 
+0000470806 00000 n 
+0000469359 00000 n 
+0000473060 00000 n 
+0000473249 00000 n 
+0000473438 00000 n 
+0000478569 00000 n 
+0000475869 00000 n 
+0000476022 00000 n 
+0000476177 00000 n 
+0000476338 00000 n 
+0000476492 00000 n 
+0000476648 00000 n 
+0000476802 00000 n 
+0000476966 00000 n 
+0000477124 00000 n 
+0000477281 00000 n 
+0000477478 00000 n 
+0000477633 00000 n 
+0000477788 00000 n 
+0000477943 00000 n 
+0000478138 00000 n 
+0000478291 00000 n 
+0000478945 00000 n 
+0000475590 00000 n 
+0000473736 00000 n 
+0000478443 00000 n 
+0000478506 00000 n 
+0000478695 00000 n 
+0000478758 00000 n 
+0000480344 00000 n 
+0000480535 00000 n 
+0000480726 00000 n 
+0000480917 00000 n 
+0000481674 00000 n 
+0000480173 00000 n 
+0000479103 00000 n 
+0000481108 00000 n 
+0000481234 00000 n 
+0000481297 00000 n 
+0000481486 00000 n 
+0000481611 00000 n 
+0000484780 00000 n 
+0000484906 00000 n 
+0000485033 00000 n 
+0000483584 00000 n 
+0000483739 00000 n 
+0000483893 00000 n 
+0000484082 00000 n 
+0000484273 00000 n 
+0000484463 00000 n 
+0000488068 00000 n 
+0000488220 00000 n 
+0000488416 00000 n 
+0000488571 00000 n 
+0000488726 00000 n 
+0000488878 00000 n 
+0000489073 00000 n 
+0000485412 00000 n 
+0000483395 00000 n 
+0000481846 00000 n 
+0000484654 00000 n 
+0000485159 00000 n 
+0000489228 00000 n 
+0000489380 00000 n 
+0000489577 00000 n 
+0000489731 00000 n 
+0000489883 00000 n 
+0000490080 00000 n 
+0000490233 00000 n 
+0000490387 00000 n 
+0000490585 00000 n 
+0000490750 00000 n 
+0000490902 00000 n 
+0000491100 00000 n 
+0000491265 00000 n 
+0000491417 00000 n 
+0000491615 00000 n 
+0000491780 00000 n 
+0000491935 00000 n 
+0000492087 00000 n 
+0000492285 00000 n 
+0000492449 00000 n 
+0000492600 00000 n 
+0000492798 00000 n 
+0000492962 00000 n 
+0000493116 00000 n 
+0000493314 00000 n 
+0000493479 00000 n 
+0000493631 00000 n 
+0000493782 00000 n 
+0000493980 00000 n 
+0000494144 00000 n 
+0000494296 00000 n 
+0000494493 00000 n 
+0000494658 00000 n 
+0000494818 00000 n 
+0000494978 00000 n 
+0000495130 00000 n 
+0000495328 00000 n 
+0000495493 00000 n 
+0000495648 00000 n 
+0000495800 00000 n 
+0000495998 00000 n 
+0000496163 00000 n 
+0000496318 00000 n 
+0000496470 00000 n 
+0000496668 00000 n 
+0000496833 00000 n 
+0000496988 00000 n 
+0000497143 00000 n 
+0000497295 00000 n 
+0000497492 00000 n 
+0000497655 00000 n 
+0000497809 00000 n 
+0000497964 00000 n 
+0000498115 00000 n 
+0000498312 00000 n 
+0000500425 00000 n 
+0000500575 00000 n 
+0000500730 00000 n 
+0000498790 00000 n 
+0000487375 00000 n 
+0000485542 00000 n 
+0000498476 00000 n 
+0000498539 00000 n 
+0000498728 00000 n 
+0001193221 00000 n 
+0000501680 00000 n 
+0000501869 00000 n 
+0000504422 00000 n 
+0000504610 00000 n 
+0000507224 00000 n 
+0000507413 00000 n 
+0000507601 00000 n 
+0000510631 00000 n 
+0000510819 00000 n 
+0000513651 00000 n 
+0000513840 00000 n 
+0000514028 00000 n 
+0000517576 00000 n 
+0000517765 00000 n 
+0000520789 00000 n 
+0000520978 00000 n 
+0000500885 00000 n 
+0000501035 00000 n 
+0000501190 00000 n 
+0000501338 00000 n 
+0000501994 00000 n 
+0000500227 00000 n 
+0000498948 00000 n 
+0000501491 00000 n 
+0000501617 00000 n 
+0000501806 00000 n 
+0000503672 00000 n 
+0000503822 00000 n 
+0000503977 00000 n 
+0000504132 00000 n 
+0000504736 00000 n 
+0000503501 00000 n 
+0000502152 00000 n 
+0000504296 00000 n 
+0000504359 00000 n 
+0000504547 00000 n 
+0000506315 00000 n 
+0000506465 00000 n 
+0000506629 00000 n 
+0000506779 00000 n 
+0000506943 00000 n 
+0000509347 00000 n 
+0000509497 00000 n 
+0000507663 00000 n 
+0000506135 00000 n 
+0000504894 00000 n 
+0000507098 00000 n 
+0000507161 00000 n 
+0000507350 00000 n 
+0000507539 00000 n 
+0000509661 00000 n 
+0000509810 00000 n 
+0000509973 00000 n 
+0000510127 00000 n 
+0000510291 00000 n 
+0000510945 00000 n 
+0000509149 00000 n 
+0000507821 00000 n 
+0000510443 00000 n 
+0000510569 00000 n 
+0000510756 00000 n 
+0000512582 00000 n 
+0000512728 00000 n 
+0000512892 00000 n 
+0000513042 00000 n 
+0000513206 00000 n 
+0000513365 00000 n 
+0000515826 00000 n 
+0000515976 00000 n 
+0000516140 00000 n 
+0000514090 00000 n 
+0000512393 00000 n 
+0000511103 00000 n 
+0000513525 00000 n 
+0000513588 00000 n 
+0000513777 00000 n 
+0000513965 00000 n 
+0000516295 00000 n 
+0000516445 00000 n 
+0000516609 00000 n 
+0000516764 00000 n 
+0000516914 00000 n 
+0000517078 00000 n 
+0000517233 00000 n 
+0000517891 00000 n 
+0000515601 00000 n 
+0000514248 00000 n 
+0000517388 00000 n 
+0000517514 00000 n 
+0000517702 00000 n 
+0001193346 00000 n 
+0000519726 00000 n 
+0000519876 00000 n 
+0000520040 00000 n 
+0000520195 00000 n 
+0000520349 00000 n 
+0000520499 00000 n 
+0000521167 00000 n 
+0000519537 00000 n 
+0000518049 00000 n 
+0000520663 00000 n 
+0000520726 00000 n 
+0000520915 00000 n 
+0000521104 00000 n 
+0000523760 00000 n 
+0000523922 00000 n 
+0000524075 00000 n 
+0000524228 00000 n 
+0000524386 00000 n 
+0000524548 00000 n 
+0000524711 00000 n 
+0000524864 00000 n 
+0000525062 00000 n 
+0000525216 00000 n 
+0000525371 00000 n 
+0000525524 00000 n 
+0000525722 00000 n 
+0000525877 00000 n 
+0000526030 00000 n 
+0000526227 00000 n 
+0000526382 00000 n 
+0000526535 00000 n 
+0000526733 00000 n 
+0000526888 00000 n 
+0000527043 00000 n 
+0000527240 00000 n 
+0000527405 00000 n 
+0000527558 00000 n 
+0000527756 00000 n 
+0000527921 00000 n 
+0000528074 00000 n 
+0000528272 00000 n 
+0000528437 00000 n 
+0000528592 00000 n 
+0000528745 00000 n 
+0000528943 00000 n 
+0000529108 00000 n 
+0000529261 00000 n 
+0000529458 00000 n 
+0000529623 00000 n 
+0000529778 00000 n 
+0000529974 00000 n 
+0000530139 00000 n 
+0000530292 00000 n 
+0000530445 00000 n 
+0000530643 00000 n 
+0000530808 00000 n 
+0000530961 00000 n 
+0000531158 00000 n 
+0000531323 00000 n 
+0000531482 00000 n 
+0000531642 00000 n 
+0000531795 00000 n 
+0000531993 00000 n 
+0000532158 00000 n 
+0000532312 00000 n 
+0000532465 00000 n 
+0000532663 00000 n 
+0000532827 00000 n 
+0000532982 00000 n 
+0000533135 00000 n 
+0000533333 00000 n 
+0000533498 00000 n 
+0000533652 00000 n 
+0000533807 00000 n 
+0000533960 00000 n 
+0000534158 00000 n 
+0000534323 00000 n 
+0000534478 00000 n 
+0000534633 00000 n 
+0000534786 00000 n 
+0000534984 00000 n 
+0000538375 00000 n 
+0000538573 00000 n 
+0000538738 00000 n 
+0000538936 00000 n 
+0000539091 00000 n 
+0000539278 00000 n 
+0000535464 00000 n 
+0000523013 00000 n 
+0000521325 00000 n 
+0000535149 00000 n 
+0000535212 00000 n 
+0000539433 00000 n 
+0000539631 00000 n 
+0000539786 00000 n 
+0000539984 00000 n 
+0000540138 00000 n 
+0000540336 00000 n 
+0000540491 00000 n 
+0000540689 00000 n 
+0000540843 00000 n 
+0000541040 00000 n 
+0000541194 00000 n 
+0000541391 00000 n 
+0000541545 00000 n 
+0000541743 00000 n 
+0000541898 00000 n 
+0000542053 00000 n 
+0000542251 00000 n 
+0000542406 00000 n 
+0000542561 00000 n 
+0000542757 00000 n 
+0000542910 00000 n 
+0000543108 00000 n 
+0000543263 00000 n 
+0000543461 00000 n 
+0000543616 00000 n 
+0000543813 00000 n 
+0000543967 00000 n 
+0000544165 00000 n 
+0000544320 00000 n 
+0000544518 00000 n 
+0000544673 00000 n 
+0000544827 00000 n 
+0000545025 00000 n 
+0000545180 00000 n 
+0000545378 00000 n 
+0000545533 00000 n 
+0000545729 00000 n 
+0000545882 00000 n 
+0000546080 00000 n 
+0000546235 00000 n 
+0000546433 00000 n 
+0000546598 00000 n 
+0000546753 00000 n 
+0000546906 00000 n 
+0000547103 00000 n 
+0000547268 00000 n 
+0000547422 00000 n 
+0000547620 00000 n 
+0000547785 00000 n 
+0000547940 00000 n 
+0000548095 00000 n 
+0000548247 00000 n 
+0000548443 00000 n 
+0000550626 00000 n 
+0000550824 00000 n 
+0000550989 00000 n 
+0000551187 00000 n 
+0000551352 00000 n 
+0000548732 00000 n 
+0000537709 00000 n 
+0000535580 00000 n 
+0000548606 00000 n 
+0000548669 00000 n 
+0000553949 00000 n 
+0000554137 00000 n 
+0000556504 00000 n 
+0000556693 00000 n 
+0000556882 00000 n 
+0000559285 00000 n 
+0000559474 00000 n 
+0000559662 00000 n 
+0000562437 00000 n 
+0000562626 00000 n 
+0000562815 00000 n 
+0000565147 00000 n 
+0000565334 00000 n 
+0000565522 00000 n 
+0000567819 00000 n 
+0000568008 00000 n 
+0000568197 00000 n 
+0000568386 00000 n 
+0000570621 00000 n 
+0000570810 00000 n 
+0000570999 00000 n 
+0000574510 00000 n 
+0000574698 00000 n 
+0000577180 00000 n 
+0000551505 00000 n 
+0000551702 00000 n 
+0000551867 00000 n 
+0000552022 00000 n 
+0000552220 00000 n 
+0000552385 00000 n 
+0000552539 00000 n 
+0000552736 00000 n 
+0000552900 00000 n 
+0000553098 00000 n 
+0000553262 00000 n 
+0000553417 00000 n 
+0000553605 00000 n 
+0000554263 00000 n 
+0000550329 00000 n 
+0000548848 00000 n 
+0000553760 00000 n 
+0000554074 00000 n 
+0000577368 00000 n 
+0000577557 00000 n 
+0000580588 00000 n 
+0000580776 00000 n 
+0000580964 00000 n 
+0000590592 00000 n 
+0000556069 00000 n 
+0000556223 00000 n 
+0000558540 00000 n 
+0000557008 00000 n 
+0000555916 00000 n 
+0000554435 00000 n 
+0000556378 00000 n 
+0000556441 00000 n 
+0000556630 00000 n 
+0000556819 00000 n 
+0000558695 00000 n 
+0000558850 00000 n 
+0000559005 00000 n 
+0000559788 00000 n 
+0000558369 00000 n 
+0000557166 00000 n 
+0000559159 00000 n 
+0000559222 00000 n 
+0000559411 00000 n 
+0000559600 00000 n 
+0001193471 00000 n 
+0000561538 00000 n 
+0000561692 00000 n 
+0000561846 00000 n 
+0000562001 00000 n 
+0000562156 00000 n 
+0000562941 00000 n 
+0000561358 00000 n 
+0000559946 00000 n 
+0000562311 00000 n 
+0000562374 00000 n 
+0000562563 00000 n 
+0000562752 00000 n 
+0000564557 00000 n 
+0000564712 00000 n 
+0000564866 00000 n 
+0000565711 00000 n 
+0000564395 00000 n 
+0000563099 00000 n 
+0000565021 00000 n 
+0000565084 00000 n 
+0000565272 00000 n 
+0000565459 00000 n 
+0000565648 00000 n 
+0000567137 00000 n 
+0000567292 00000 n 
+0000567447 00000 n 
+0000567601 00000 n 
+0000570031 00000 n 
+0000568512 00000 n 
+0000566966 00000 n 
+0000565869 00000 n 
+0000567756 00000 n 
+0000567945 00000 n 
+0000568134 00000 n 
+0000568323 00000 n 
+0000570186 00000 n 
+0000570341 00000 n 
+0000572903 00000 n 
+0000573067 00000 n 
+0000573222 00000 n 
+0000571061 00000 n 
+0000569869 00000 n 
+0000568670 00000 n 
+0000570496 00000 n 
+0000570559 00000 n 
+0000570747 00000 n 
+0000570936 00000 n 
+0000573377 00000 n 
+0000573540 00000 n 
+0000573694 00000 n 
+0000573858 00000 n 
+0000574013 00000 n 
+0000574167 00000 n 
+0000574824 00000 n 
+0000572687 00000 n 
+0000571219 00000 n 
+0000574321 00000 n 
+0000574447 00000 n 
+0000574635 00000 n 
+0000576726 00000 n 
+0000576890 00000 n 
+0000579343 00000 n 
+0000579507 00000 n 
+0000577682 00000 n 
+0000576573 00000 n 
+0000574982 00000 n 
+0000577054 00000 n 
+0000577117 00000 n 
+0000577305 00000 n 
+0000577494 00000 n 
+0001193596 00000 n 
+0000579662 00000 n 
+0000579826 00000 n 
+0000579981 00000 n 
+0000580145 00000 n 
+0000580300 00000 n 
+0000581089 00000 n 
+0000579145 00000 n 
+0000577840 00000 n 
+0000580462 00000 n 
+0000580525 00000 n 
+0000580713 00000 n 
+0000580901 00000 n 
+0000581803 00000 n 
+0000581617 00000 n 
+0000581247 00000 n 
+0000581740 00000 n 
+0000584084 00000 n 
+0000584246 00000 n 
+0000584400 00000 n 
+0000584554 00000 n 
+0000584713 00000 n 
+0000584874 00000 n 
+0000585072 00000 n 
+0000585237 00000 n 
+0000585435 00000 n 
+0000585590 00000 n 
+0000585778 00000 n 
+0000585933 00000 n 
+0000586131 00000 n 
+0000586286 00000 n 
+0000586483 00000 n 
+0000586638 00000 n 
+0000586835 00000 n 
+0000586990 00000 n 
+0000587187 00000 n 
+0000587342 00000 n 
+0000587540 00000 n 
+0000587695 00000 n 
+0000587893 00000 n 
+0000588048 00000 n 
+0000588245 00000 n 
+0000588400 00000 n 
+0000588555 00000 n 
+0000588753 00000 n 
+0000588908 00000 n 
+0000589063 00000 n 
+0000589261 00000 n 
+0000589415 00000 n 
+0000589613 00000 n 
+0000589767 00000 n 
+0000589963 00000 n 
+0000590117 00000 n 
+0000590313 00000 n 
+0000593691 00000 n 
+0000593889 00000 n 
+0000594044 00000 n 
+0000594242 00000 n 
+0000594397 00000 n 
+0000590907 00000 n 
+0000583616 00000 n 
+0000581891 00000 n 
+0000590466 00000 n 
+0000590529 00000 n 
+0000590718 00000 n 
+0000590781 00000 n 
+0000594552 00000 n 
+0000594749 00000 n 
+0000594903 00000 n 
+0000595101 00000 n 
+0000595256 00000 n 
+0000595454 00000 n 
+0000595609 00000 n 
+0000595806 00000 n 
+0000595961 00000 n 
+0000596159 00000 n 
+0000596324 00000 n 
+0000596479 00000 n 
+0000596634 00000 n 
+0000596832 00000 n 
+0000596997 00000 n 
+0000597152 00000 n 
+0000597350 00000 n 
+0000597515 00000 n 
+0000597670 00000 n 
+0000597825 00000 n 
+0000597979 00000 n 
+0000598177 00000 n 
+0000598340 00000 n 
+0000598538 00000 n 
+0000598703 00000 n 
+0000598901 00000 n 
+0000599065 00000 n 
+0000599220 00000 n 
+0000599418 00000 n 
+0000599583 00000 n 
+0000599738 00000 n 
+0000599936 00000 n 
+0000600101 00000 n 
+0000600256 00000 n 
+0000600454 00000 n 
+0000600619 00000 n 
+0000600817 00000 n 
+0000601013 00000 n 
+0000601178 00000 n 
+0000601373 00000 n 
+0000601538 00000 n 
+0000601692 00000 n 
+0000601888 00000 n 
+0000602053 00000 n 
+0000602249 00000 n 
+0000602414 00000 n 
+0000602609 00000 n 
+0000602774 00000 n 
+0000602970 00000 n 
+0000603135 00000 n 
+0000603290 00000 n 
+0000603484 00000 n 
+0000603648 00000 n 
+0000603802 00000 n 
+0000603955 00000 n 
+0000604149 00000 n 
+0000607430 00000 n 
+0000607626 00000 n 
+0000607782 00000 n 
+0000607936 00000 n 
+0000608091 00000 n 
+0000608287 00000 n 
+0000604555 00000 n 
+0000593007 00000 n 
+0000591051 00000 n 
+0000604303 00000 n 
+0000604492 00000 n 
+0000617101 00000 n 
+0000619396 00000 n 
+0000619585 00000 n 
+0000619773 00000 n 
+0000619961 00000 n 
+0000622953 00000 n 
+0000623142 00000 n 
+0000623331 00000 n 
+0000608443 00000 n 
+0000608639 00000 n 
+0000608792 00000 n 
+0000608947 00000 n 
+0000609143 00000 n 
+0000609308 00000 n 
+0000609463 00000 n 
+0000609658 00000 n 
+0000609821 00000 n 
+0000609976 00000 n 
+0000610171 00000 n 
+0000610335 00000 n 
+0000610530 00000 n 
+0000610683 00000 n 
+0000610837 00000 n 
+0000610991 00000 n 
+0000611145 00000 n 
+0000611337 00000 n 
+0000611491 00000 n 
+0000611645 00000 n 
+0000611799 00000 n 
+0000611953 00000 n 
+0000612148 00000 n 
+0000612312 00000 n 
+0000612467 00000 n 
+0000612622 00000 n 
+0000612777 00000 n 
+0000612973 00000 n 
+0000613138 00000 n 
+0000613293 00000 n 
+0000613448 00000 n 
+0000613602 00000 n 
+0000613798 00000 n 
+0000613954 00000 n 
+0000614108 00000 n 
+0000614304 00000 n 
+0000614459 00000 n 
+0000614614 00000 n 
+0000614769 00000 n 
+0000614965 00000 n 
+0000615120 00000 n 
+0000615274 00000 n 
+0000615429 00000 n 
+0000615625 00000 n 
+0000615780 00000 n 
+0000615935 00000 n 
+0000616089 00000 n 
+0000616285 00000 n 
+0000616440 00000 n 
+0000616595 00000 n 
+0000616750 00000 n 
+0000617227 00000 n 
+0000606782 00000 n 
+0000604685 00000 n 
+0000616912 00000 n 
+0000626013 00000 n 
+0000626202 00000 n 
+0000626391 00000 n 
+0000629079 00000 n 
+0000629267 00000 n 
+0000629456 00000 n 
+0000632937 00000 n 
+0000633126 00000 n 
+0000633315 00000 n 
+0000636934 00000 n 
+0000637123 00000 n 
+0000640000 00000 n 
+0000640189 00000 n 
+0000640377 00000 n 
+0000645261 00000 n 
+0000618623 00000 n 
+0000618787 00000 n 
+0000618942 00000 n 
+0000619106 00000 n 
+0000621655 00000 n 
+0000620023 00000 n 
+0000618452 00000 n 
+0000617399 00000 n 
+0000619270 00000 n 
+0000619333 00000 n 
+0000619522 00000 n 
+0000619711 00000 n 
+0000619898 00000 n 
+0001193721 00000 n 
+0000621819 00000 n 
+0000621983 00000 n 
+0000622138 00000 n 
+0000622302 00000 n 
+0000622456 00000 n 
+0000622611 00000 n 
+0000623456 00000 n 
+0000621457 00000 n 
+0000620181 00000 n 
+0000622764 00000 n 
+0000622890 00000 n 
+0000623079 00000 n 
+0000623268 00000 n 
+0000624957 00000 n 
+0000625112 00000 n 
+0000625267 00000 n 
+0000625422 00000 n 
+0000625577 00000 n 
+0000625732 00000 n 
+0000626517 00000 n 
+0000624768 00000 n 
+0000623614 00000 n 
+0000625887 00000 n 
+0000625950 00000 n 
+0000626139 00000 n 
+0000626328 00000 n 
+0000628153 00000 n 
+0000628317 00000 n 
+0000628472 00000 n 
+0000628636 00000 n 
+0000628790 00000 n 
+0000629643 00000 n 
+0000627973 00000 n 
+0000626675 00000 n 
+0000628953 00000 n 
+0000629016 00000 n 
+0000629205 00000 n 
+0000629393 00000 n 
+0000629581 00000 n 
+0000631475 00000 n 
+0000631630 00000 n 
+0000631784 00000 n 
+0000631939 00000 n 
+0000632093 00000 n 
+0000632248 00000 n 
+0000632403 00000 n 
+0000632557 00000 n 
+0000632712 00000 n 
+0000635404 00000 n 
+0000635559 00000 n 
+0000635714 00000 n 
+0000633441 00000 n 
+0000631259 00000 n 
+0000629801 00000 n 
+0000632874 00000 n 
+0000633063 00000 n 
+0000633252 00000 n 
+0000635869 00000 n 
+0000636033 00000 n 
+0000636188 00000 n 
+0000636343 00000 n 
+0000636498 00000 n 
+0000636653 00000 n 
+0000637312 00000 n 
+0000635188 00000 n 
+0000633599 00000 n 
+0000636808 00000 n 
+0000636871 00000 n 
+0000637060 00000 n 
+0000637249 00000 n 
+0000639009 00000 n 
+0000639164 00000 n 
+0000639318 00000 n 
+0000639473 00000 n 
+0000639628 00000 n 
+0000639782 00000 n 
+0000642706 00000 n 
+0000642861 00000 n 
+0000643016 00000 n 
+0000640503 00000 n 
+0000638820 00000 n 
+0000637470 00000 n 
+0000639937 00000 n 
+0000640126 00000 n 
+0000640314 00000 n 
+0001193846 00000 n 
+0000643171 00000 n 
+0000643326 00000 n 
+0000643481 00000 n 
+0000643636 00000 n 
+0000643795 00000 n 
+0000643949 00000 n 
+0000644103 00000 n 
+0000644267 00000 n 
+0000644462 00000 n 
+0000644626 00000 n 
+0000644820 00000 n 
+0000644983 00000 n 
+0000648677 00000 n 
+0000648873 00000 n 
+0000649038 00000 n 
+0000649234 00000 n 
+0000645576 00000 n 
+0000642436 00000 n 
+0000640661 00000 n 
+0000645136 00000 n 
+0000645199 00000 n 
+0000645387 00000 n 
+0000645450 00000 n 
+0000649399 00000 n 
+0000649594 00000 n 
+0000649759 00000 n 
+0000649953 00000 n 
+0000650118 00000 n 
+0000650273 00000 n 
+0000650468 00000 n 
+0000650633 00000 n 
+0000650788 00000 n 
+0000650943 00000 n 
+0000651139 00000 n 
+0000651295 00000 n 
+0000651491 00000 n 
+0000651647 00000 n 
+0000651802 00000 n 
+0000651957 00000 n 
+0000652153 00000 n 
+0000652309 00000 n 
+0000652505 00000 n 
+0000652660 00000 n 
+0000652816 00000 n 
+0000653012 00000 n 
+0000653177 00000 n 
+0000653332 00000 n 
+0000653528 00000 n 
+0000653693 00000 n 
+0000653848 00000 n 
+0000654044 00000 n 
+0000654209 00000 n 
+0000654405 00000 n 
+0000654560 00000 n 
+0000654714 00000 n 
+0000654869 00000 n 
+0000655023 00000 n 
+0000655219 00000 n 
+0000655374 00000 n 
+0000655529 00000 n 
+0000655684 00000 n 
+0000655838 00000 n 
+0000656034 00000 n 
+0000656199 00000 n 
+0000656354 00000 n 
+0000656508 00000 n 
+0000656663 00000 n 
+0000656859 00000 n 
+0000657024 00000 n 
+0000657179 00000 n 
+0000657334 00000 n 
+0000657488 00000 n 
+0000657684 00000 n 
+0000657840 00000 n 
+0000657995 00000 n 
+0000658191 00000 n 
+0000658346 00000 n 
+0000658501 00000 n 
+0000658656 00000 n 
+0000658852 00000 n 
+0000659007 00000 n 
+0000659162 00000 n 
+0000659317 00000 n 
+0000659513 00000 n 
+0000659668 00000 n 
+0000659823 00000 n 
+0000659978 00000 n 
+0000660174 00000 n 
+0000660329 00000 n 
+0000660484 00000 n 
+0000660639 00000 n 
+0000660831 00000 n 
+0000661023 00000 n 
+0000661211 00000 n 
+0000661366 00000 n 
+0000661558 00000 n 
+0000661713 00000 n 
+0000661866 00000 n 
+0000662058 00000 n 
+0000662214 00000 n 
+0000662404 00000 n 
+0000662562 00000 n 
+0000664666 00000 n 
+0000664857 00000 n 
+0000665012 00000 n 
+0000665204 00000 n 
+0000665358 00000 n 
+0000665513 00000 n 
+0000665666 00000 n 
+0000665821 00000 n 
+0000665974 00000 n 
+0000662970 00000 n 
+0000647795 00000 n 
+0000645734 00000 n 
+0000662718 00000 n 
+0000662907 00000 n 
+0000667424 00000 n 
+0000667613 00000 n 
+0000670495 00000 n 
+0000670684 00000 n 
+0000670873 00000 n 
+0000666128 00000 n 
+0000666320 00000 n 
+0000666470 00000 n 
+0000666661 00000 n 
+0000666852 00000 n 
+0000667044 00000 n 
+0000669562 00000 n 
+0000669750 00000 n 
+0000667738 00000 n 
+0000664396 00000 n 
+0000663114 00000 n 
+0000667235 00000 n 
+0000667550 00000 n 
+0000674289 00000 n 
+0000674478 00000 n 
+0000676198 00000 n 
+0000676386 00000 n 
+0000676575 00000 n 
+0000676764 00000 n 
+0000684405 00000 n 
+0000669905 00000 n 
+0000670059 00000 n 
+0000670214 00000 n 
+0000672695 00000 n 
+0000672855 00000 n 
+0000670936 00000 n 
+0000669382 00000 n 
+0000667910 00000 n 
+0000670369 00000 n 
+0000670432 00000 n 
+0000670621 00000 n 
+0000670810 00000 n 
+0000673015 00000 n 
+0000673170 00000 n 
+0000673325 00000 n 
+0000673480 00000 n 
+0000673635 00000 n 
+0000673790 00000 n 
+0000673945 00000 n 
+0000674667 00000 n 
+0000672479 00000 n 
+0000671094 00000 n 
+0000674100 00000 n 
+0000674226 00000 n 
+0000674415 00000 n 
+0000674604 00000 n 
+0000675983 00000 n 
+0000676890 00000 n 
+0000675839 00000 n 
+0000674825 00000 n 
+0000676135 00000 n 
+0000676324 00000 n 
+0000676512 00000 n 
+0000676701 00000 n 
+0001193971 00000 n 
+0000679151 00000 n 
+0000679306 00000 n 
+0000679460 00000 n 
+0000679616 00000 n 
+0000679808 00000 n 
+0000680000 00000 n 
+0000680188 00000 n 
+0000680343 00000 n 
+0000680534 00000 n 
+0000680689 00000 n 
+0000680844 00000 n 
+0000681036 00000 n 
+0000681191 00000 n 
+0000681383 00000 n 
+0000681542 00000 n 
+0000681702 00000 n 
+0000681893 00000 n 
+0000682048 00000 n 
+0000682239 00000 n 
+0000682394 00000 n 
+0000682550 00000 n 
+0000682705 00000 n 
+0000682861 00000 n 
+0000683015 00000 n 
+0000683169 00000 n 
+0000683361 00000 n 
+0000683513 00000 n 
+0000683705 00000 n 
+0000683896 00000 n 
+0000684087 00000 n 
+0000686980 00000 n 
+0000684846 00000 n 
+0000678746 00000 n 
+0000677034 00000 n 
+0000684279 00000 n 
+0000684342 00000 n 
+0000684531 00000 n 
+0000684594 00000 n 
+0000687134 00000 n 
+0000687326 00000 n 
+0000687518 00000 n 
+0000687673 00000 n 
+0000687865 00000 n 
+0000688020 00000 n 
+0000688175 00000 n 
+0000688367 00000 n 
+0000688521 00000 n 
+0000688675 00000 n 
+0000688867 00000 n 
+0000689021 00000 n 
+0000689213 00000 n 
+0000689368 00000 n 
+0000689560 00000 n 
+0000689715 00000 n 
+0000689907 00000 n 
+0000690062 00000 n 
+0000690254 00000 n 
+0000690409 00000 n 
+0000690601 00000 n 
+0000690756 00000 n 
+0000690948 00000 n 
+0000691101 00000 n 
+0000691293 00000 n 
+0000691447 00000 n 
+0000691639 00000 n 
+0000691794 00000 n 
+0000691986 00000 n 
+0000692141 00000 n 
+0000692296 00000 n 
+0000692488 00000 n 
+0000692643 00000 n 
+0000692835 00000 n 
+0000692990 00000 n 
+0000693182 00000 n 
+0000693589 00000 n 
+0000686512 00000 n 
+0000685004 00000 n 
+0000693337 00000 n 
+0000693400 00000 n 
+0000693463 00000 n 
+0000695591 00000 n 
+0000695717 00000 n 
+0000695906 00000 n 
+0000696093 00000 n 
+0000698395 00000 n 
+0000698584 00000 n 
+0000698773 00000 n 
+0000701007 00000 n 
+0000701195 00000 n 
+0000701384 00000 n 
+0000703600 00000 n 
+0000703789 00000 n 
+0000703978 00000 n 
+0000706570 00000 n 
+0000706759 00000 n 
+0000706948 00000 n 
+0000712207 00000 n 
+0000695000 00000 n 
+0000695155 00000 n 
+0000695310 00000 n 
+0000697587 00000 n 
+0000697742 00000 n 
+0000696155 00000 n 
+0000694838 00000 n 
+0000693719 00000 n 
+0000695465 00000 n 
+0000695843 00000 n 
+0000696031 00000 n 
+0000697897 00000 n 
+0000698051 00000 n 
+0000700353 00000 n 
+0000698835 00000 n 
+0000697416 00000 n 
+0000696313 00000 n 
+0000698206 00000 n 
+0000698332 00000 n 
+0000698521 00000 n 
+0000698710 00000 n 
+0000700508 00000 n 
+0000700663 00000 n 
+0000702947 00000 n 
+0000701447 00000 n 
+0000700191 00000 n 
+0000698993 00000 n 
+0000700818 00000 n 
+0000700944 00000 n 
+0000701132 00000 n 
+0000701321 00000 n 
+0000703102 00000 n 
+0000703257 00000 n 
+0000705672 00000 n 
+0000704104 00000 n 
+0000702785 00000 n 
+0000701605 00000 n 
+0000703411 00000 n 
+0000703537 00000 n 
+0000703726 00000 n 
+0000703915 00000 n 
+0001194096 00000 n 
+0000705827 00000 n 
+0000705981 00000 n 
+0000706136 00000 n 
+0000706291 00000 n 
+0000707073 00000 n 
+0000705492 00000 n 
+0000704262 00000 n 
+0000706444 00000 n 
+0000706507 00000 n 
+0000706696 00000 n 
+0000706885 00000 n 
+0000709171 00000 n 
+0000709325 00000 n 
+0000709481 00000 n 
+0000709673 00000 n 
+0000709861 00000 n 
+0000710049 00000 n 
+0000710238 00000 n 
+0000710393 00000 n 
+0000710584 00000 n 
+0000710739 00000 n 
+0000710931 00000 n 
+0000711086 00000 n 
+0000711241 00000 n 
+0000711432 00000 n 
+0000711586 00000 n 
+0000711740 00000 n 
+0000711929 00000 n 
+0000714570 00000 n 
+0000714762 00000 n 
+0000714916 00000 n 
+0000715108 00000 n 
+0000712521 00000 n 
+0000708883 00000 n 
+0000707231 00000 n 
+0000712081 00000 n 
+0000712144 00000 n 
+0000712332 00000 n 
+0000712395 00000 n 
+0000715263 00000 n 
+0000715454 00000 n 
+0000715609 00000 n 
+0000715800 00000 n 
+0000715954 00000 n 
+0000716145 00000 n 
+0000716300 00000 n 
+0000716492 00000 n 
+0000716646 00000 n 
+0000716838 00000 n 
+0000716993 00000 n 
+0000717185 00000 n 
+0000717340 00000 n 
+0000717532 00000 n 
+0000717686 00000 n 
+0000717841 00000 n 
+0000718032 00000 n 
+0000718187 00000 n 
+0000718379 00000 n 
+0000718534 00000 n 
+0000718726 00000 n 
+0000718881 00000 n 
+0000719072 00000 n 
+0000719767 00000 n 
+0000714192 00000 n 
+0000712679 00000 n 
+0000719263 00000 n 
+0000719452 00000 n 
+0000719641 00000 n 
+0000722433 00000 n 
+0000721770 00000 n 
+0000721925 00000 n 
+0000722116 00000 n 
+0000722874 00000 n 
+0000721608 00000 n 
+0000719939 00000 n 
+0000722307 00000 n 
+0000722370 00000 n 
+0000722559 00000 n 
+0000722622 00000 n 
+0000724796 00000 n 
+0000724960 00000 n 
+0000725154 00000 n 
+0000725309 00000 n 
+0000725503 00000 n 
+0000725667 00000 n 
+0000725861 00000 n 
+0000726025 00000 n 
+0000726219 00000 n 
+0000726383 00000 n 
+0000726538 00000 n 
+0000726731 00000 n 
+0000726896 00000 n 
+0000727051 00000 n 
+0000727244 00000 n 
+0000727407 00000 n 
+0000727561 00000 n 
+0000727754 00000 n 
+0000727919 00000 n 
+0000728081 00000 n 
+0000728676 00000 n 
+0000724481 00000 n 
+0000723032 00000 n 
+0000728235 00000 n 
+0000728298 00000 n 
+0000728487 00000 n 
+0000728613 00000 n 
+0000730825 00000 n 
+0000731014 00000 n 
+0000731202 00000 n 
+0000733685 00000 n 
+0000733874 00000 n 
+0000734063 00000 n 
+0000730116 00000 n 
+0000730279 00000 n 
+0000730443 00000 n 
+0000730607 00000 n 
+0000731390 00000 n 
+0000729945 00000 n 
+0000728848 00000 n 
+0000730762 00000 n 
+0000730951 00000 n 
+0000731139 00000 n 
+0000731327 00000 n 
+0001194221 00000 n 
+0000732820 00000 n 
+0000732984 00000 n 
+0000733139 00000 n 
+0000733303 00000 n 
+0000733458 00000 n 
+0000736517 00000 n 
+0000734314 00000 n 
+0000732640 00000 n 
+0000731548 00000 n 
+0000733622 00000 n 
+0000733811 00000 n 
+0000734000 00000 n 
+0000734189 00000 n 
+0000734252 00000 n 
+0000736675 00000 n 
+0000736836 00000 n 
+0000736998 00000 n 
+0000737162 00000 n 
+0000737326 00000 n 
+0000737485 00000 n 
+0000737643 00000 n 
+0000737808 00000 n 
+0000738002 00000 n 
+0000738158 00000 n 
+0000738352 00000 n 
+0000738515 00000 n 
+0000738709 00000 n 
+0000738874 00000 n 
+0000739068 00000 n 
+0000739233 00000 n 
+0000739388 00000 n 
+0000739582 00000 n 
+0000739747 00000 n 
+0000739902 00000 n 
+0000740096 00000 n 
+0000740259 00000 n 
+0000740414 00000 n 
+0000740608 00000 n 
+0000740773 00000 n 
+0000740962 00000 n 
+0000741150 00000 n 
+0000741338 00000 n 
+0000741527 00000 n 
+0000741716 00000 n 
+0000741904 00000 n 
+0000742093 00000 n 
+0000742282 00000 n 
+0000745208 00000 n 
+0000745397 00000 n 
+0000745586 00000 n 
+0000742783 00000 n 
+0000736076 00000 n 
+0000734472 00000 n 
+0000742469 00000 n 
+0000742720 00000 n 
+0000753093 00000 n 
+0000754436 00000 n 
+0000754625 00000 n 
+0000754814 00000 n 
+0000756303 00000 n 
+0000756492 00000 n 
+0000756616 00000 n 
+0000758027 00000 n 
+0000758216 00000 n 
+0000745775 00000 n 
+0000745963 00000 n 
+0000746117 00000 n 
+0000746305 00000 n 
+0000746459 00000 n 
+0000746613 00000 n 
+0000746767 00000 n 
+0000746954 00000 n 
+0000747109 00000 n 
+0000747264 00000 n 
+0000747419 00000 n 
+0000747607 00000 n 
+0000747762 00000 n 
+0000747917 00000 n 
+0000748072 00000 n 
+0000748261 00000 n 
+0000748416 00000 n 
+0000748605 00000 n 
+0000748761 00000 n 
+0000748950 00000 n 
+0000749107 00000 n 
+0000749296 00000 n 
+0000749453 00000 n 
+0000749642 00000 n 
+0000749797 00000 n 
+0000749951 00000 n 
+0000750140 00000 n 
+0000750294 00000 n 
+0000750448 00000 n 
+0000750636 00000 n 
+0000750791 00000 n 
+0000750946 00000 n 
+0000751135 00000 n 
+0000751289 00000 n 
+0000751443 00000 n 
+0000751597 00000 n 
+0000751786 00000 n 
+0000751941 00000 n 
+0000752095 00000 n 
+0000752250 00000 n 
+0000752439 00000 n 
+0000752594 00000 n 
+0000752749 00000 n 
+0000753156 00000 n 
+0000744659 00000 n 
+0000742913 00000 n 
+0000752904 00000 n 
+0000758405 00000 n 
+0000759996 00000 n 
+0000760185 00000 n 
+0000760311 00000 n 
+0000763300 00000 n 
+0000763489 00000 n 
+0000763678 00000 n 
+0000766298 00000 n 
+0000766487 00000 n 
+0000766676 00000 n 
+0000769100 00000 n 
+0000769289 00000 n 
+0000772036 00000 n 
+0000772224 00000 n 
+0000775276 00000 n 
+0000775465 00000 n 
+0000781929 00000 n 
+0000754877 00000 n 
+0000754187 00000 n 
+0000753286 00000 n 
+0000754310 00000 n 
+0000754562 00000 n 
+0000754751 00000 n 
+0000756679 00000 n 
+0000755991 00000 n 
+0000755035 00000 n 
+0000756114 00000 n 
+0000756240 00000 n 
+0000756429 00000 n 
+0000758531 00000 n 
+0000757778 00000 n 
+0000756837 00000 n 
+0000757901 00000 n 
+0000758153 00000 n 
+0000758342 00000 n 
+0001194346 00000 n 
+0000759716 00000 n 
+0000760436 00000 n 
+0000759572 00000 n 
+0000758675 00000 n 
+0000759870 00000 n 
+0000759933 00000 n 
+0000760122 00000 n 
+0000762245 00000 n 
+0000762400 00000 n 
+0000762555 00000 n 
+0000762710 00000 n 
+0000762865 00000 n 
+0000763019 00000 n 
+0000765333 00000 n 
+0000765488 00000 n 
+0000765643 00000 n 
+0000763741 00000 n 
+0000762056 00000 n 
+0000760594 00000 n 
+0000763174 00000 n 
+0000763237 00000 n 
+0000763426 00000 n 
+0000763615 00000 n 
+0000765798 00000 n 
+0000765952 00000 n 
+0000768287 00000 n 
+0000766738 00000 n 
+0000765153 00000 n 
+0000763899 00000 n 
+0000766109 00000 n 
+0000766235 00000 n 
+0000766424 00000 n 
+0000766613 00000 n 
+0000768444 00000 n 
+0000768601 00000 n 
+0000768756 00000 n 
+0000769414 00000 n 
+0000768116 00000 n 
+0000766896 00000 n 
+0000768911 00000 n 
+0000769037 00000 n 
+0000769226 00000 n 
+0000771291 00000 n 
+0000771446 00000 n 
+0000771601 00000 n 
+0000771756 00000 n 
+0000772350 00000 n 
+0000771120 00000 n 
+0000769572 00000 n 
+0000771910 00000 n 
+0000771973 00000 n 
+0000772161 00000 n 
+0000774221 00000 n 
+0000774376 00000 n 
+0000774531 00000 n 
+0000774686 00000 n 
+0000774841 00000 n 
+0000774995 00000 n 
+0000775654 00000 n 
+0000774032 00000 n 
+0000772508 00000 n 
+0000775150 00000 n 
+0000775213 00000 n 
+0000775402 00000 n 
+0000775591 00000 n 
+0001194471 00000 n 
+0000777841 00000 n 
+0000777996 00000 n 
+0000778150 00000 n 
+0000778305 00000 n 
+0000778458 00000 n 
+0000778612 00000 n 
+0000778801 00000 n 
+0000778990 00000 n 
+0000779179 00000 n 
+0000779367 00000 n 
+0000779556 00000 n 
+0000779745 00000 n 
+0000779934 00000 n 
+0000780123 00000 n 
+0000780312 00000 n 
+0000780501 00000 n 
+0000780690 00000 n 
+0000780879 00000 n 
+0000781067 00000 n 
+0000781221 00000 n 
+0000781408 00000 n 
+0000781561 00000 n 
+0000781714 00000 n 
+0000784771 00000 n 
+0000784959 00000 n 
+0000785114 00000 n 
+0000785268 00000 n 
+0000785423 00000 n 
+0000785612 00000 n 
+0000785767 00000 n 
+0000785922 00000 n 
+0000782244 00000 n 
+0000777499 00000 n 
+0000775812 00000 n 
+0000781866 00000 n 
+0000782055 00000 n 
+0000782118 00000 n 
+0000786077 00000 n 
+0000786266 00000 n 
+0000786421 00000 n 
+0000786610 00000 n 
+0000786767 00000 n 
+0000786955 00000 n 
+0000787111 00000 n 
+0000787300 00000 n 
+0000787456 00000 n 
+0000787645 00000 n 
+0000787801 00000 n 
+0000787956 00000 n 
+0000788145 00000 n 
+0000788301 00000 n 
+0000788456 00000 n 
+0000788645 00000 n 
+0000788800 00000 n 
+0000788954 00000 n 
+0000789143 00000 n 
+0000789298 00000 n 
+0000789453 00000 n 
+0000789608 00000 n 
+0000789797 00000 n 
+0000789952 00000 n 
+0000790106 00000 n 
+0000790261 00000 n 
+0000790450 00000 n 
+0000790605 00000 n 
+0000790760 00000 n 
+0000790915 00000 n 
+0000791070 00000 n 
+0000791225 00000 n 
+0000791418 00000 n 
+0000791609 00000 n 
+0000791800 00000 n 
+0000791954 00000 n 
+0000794170 00000 n 
+0000794363 00000 n 
+0000794519 00000 n 
+0000794711 00000 n 
+0000794867 00000 n 
+0000795060 00000 n 
+0000792421 00000 n 
+0000784240 00000 n 
+0000782402 00000 n 
+0000792107 00000 n 
+0000792296 00000 n 
+0000792359 00000 n 
+0000796601 00000 n 
+0000796790 00000 n 
+0000799136 00000 n 
+0000795215 00000 n 
+0000795407 00000 n 
+0000795563 00000 n 
+0000795756 00000 n 
+0000795910 00000 n 
+0000796103 00000 n 
+0000796257 00000 n 
+0000796853 00000 n 
+0000793918 00000 n 
+0000792565 00000 n 
+0000796412 00000 n 
+0000796727 00000 n 
+0000799325 00000 n 
+0000799513 00000 n 
+0000801655 00000 n 
+0000801843 00000 n 
+0000804240 00000 n 
+0000804429 00000 n 
+0000798483 00000 n 
+0000798638 00000 n 
+0000798792 00000 n 
+0000801002 00000 n 
+0000799575 00000 n 
+0000798321 00000 n 
+0000797025 00000 n 
+0000798947 00000 n 
+0000799073 00000 n 
+0000799262 00000 n 
+0000799450 00000 n 
+0000801157 00000 n 
+0000801311 00000 n 
+0000802031 00000 n 
+0000800840 00000 n 
+0000799733 00000 n 
+0000801466 00000 n 
+0000801592 00000 n 
+0000801780 00000 n 
+0000801968 00000 n 
+0000803557 00000 n 
+0000803711 00000 n 
+0000803866 00000 n 
+0000804020 00000 n 
+0000806857 00000 n 
+0000804744 00000 n 
+0000803386 00000 n 
+0000802189 00000 n 
+0000804177 00000 n 
+0000804366 00000 n 
+0000804555 00000 n 
+0000804618 00000 n 
+0001194596 00000 n 
+0000807015 00000 n 
+0000807171 00000 n 
+0000807364 00000 n 
+0000807557 00000 n 
+0000807712 00000 n 
+0000807868 00000 n 
+0000808060 00000 n 
+0000808250 00000 n 
+0000808406 00000 n 
+0000808561 00000 n 
+0000808717 00000 n 
+0000808935 00000 n 
+0000806614 00000 n 
+0000804902 00000 n 
+0000808872 00000 n 
+0000810900 00000 n 
+0000811056 00000 n 
+0000811212 00000 n 
+0000811367 00000 n 
+0000811560 00000 n 
+0000811715 00000 n 
+0000811870 00000 n 
+0000812062 00000 n 
+0000812217 00000 n 
+0000812409 00000 n 
+0000812564 00000 n 
+0000812756 00000 n 
+0000812911 00000 n 
+0000813103 00000 n 
+0000813258 00000 n 
+0000813451 00000 n 
+0000813607 00000 n 
+0000813799 00000 n 
+0000813954 00000 n 
+0000814108 00000 n 
+0000814301 00000 n 
+0000814456 00000 n 
+0000814643 00000 n 
+0000814798 00000 n 
+0000814991 00000 n 
+0000815146 00000 n 
+0000815338 00000 n 
+0000815494 00000 n 
+0000815685 00000 n 
+0000817723 00000 n 
+0000817878 00000 n 
+0000818066 00000 n 
+0000816277 00000 n 
+0000810504 00000 n 
+0000809023 00000 n 
+0000815838 00000 n 
+0000816026 00000 n 
+0000816215 00000 n 
+0000818719 00000 n 
+0000818907 00000 n 
+0000819096 00000 n 
+0000818221 00000 n 
+0000818375 00000 n 
+0000820910 00000 n 
+0000819157 00000 n 
+0000817543 00000 n 
+0000816421 00000 n 
+0000818530 00000 n 
+0000818656 00000 n 
+0000818844 00000 n 
+0000819033 00000 n 
+0000821065 00000 n 
+0000821221 00000 n 
+0000821375 00000 n 
+0000821539 00000 n 
+0000821732 00000 n 
+0000821887 00000 n 
+0000822075 00000 n 
+0000822231 00000 n 
+0000822424 00000 n 
+0000822580 00000 n 
+0000822773 00000 n 
+0000822929 00000 n 
+0000823122 00000 n 
+0000823278 00000 n 
+0000823431 00000 n 
+0000825761 00000 n 
+0000825915 00000 n 
+0000824152 00000 n 
+0000820631 00000 n 
+0000819315 00000 n 
+0000823585 00000 n 
+0000823711 00000 n 
+0000823774 00000 n 
+0000824089 00000 n 
+0000826069 00000 n 
+0000826222 00000 n 
+0000826378 00000 n 
+0000826534 00000 n 
+0000826690 00000 n 
+0000826875 00000 n 
+0000827065 00000 n 
+0000827253 00000 n 
+0000827443 00000 n 
+0000827632 00000 n 
+0000827822 00000 n 
+0000828011 00000 n 
+0000828201 00000 n 
+0000828391 00000 n 
+0000828579 00000 n 
+0000828767 00000 n 
+0000831589 00000 n 
+0000831779 00000 n 
+0000829331 00000 n 
+0000825464 00000 n 
+0000824310 00000 n 
+0000828955 00000 n 
+0000829207 00000 n 
+0000829269 00000 n 
+0000843191 00000 n 
+0000844244 00000 n 
+0000844371 00000 n 
+0000844498 00000 n 
+0000844625 00000 n 
+0000844752 00000 n 
+0000844879 00000 n 
+0000845006 00000 n 
+0000845133 00000 n 
+0000846895 00000 n 
+0000847022 00000 n 
+0000847148 00000 n 
+0000831934 00000 n 
+0000832123 00000 n 
+0000832276 00000 n 
+0000832431 00000 n 
+0000832621 00000 n 
+0000832776 00000 n 
+0000832931 00000 n 
+0000833086 00000 n 
+0000833276 00000 n 
+0000833430 00000 n 
+0000833584 00000 n 
+0000833774 00000 n 
+0000833927 00000 n 
+0000834082 00000 n 
+0000834271 00000 n 
+0000834426 00000 n 
+0000834580 00000 n 
+0000834770 00000 n 
+0000834924 00000 n 
+0000835079 00000 n 
+0000835233 00000 n 
+0000835421 00000 n 
+0000835575 00000 n 
+0000835730 00000 n 
+0000835920 00000 n 
+0000836075 00000 n 
+0000836265 00000 n 
+0000836420 00000 n 
+0000836610 00000 n 
+0000836765 00000 n 
+0000836955 00000 n 
+0000837110 00000 n 
+0000837300 00000 n 
+0000837454 00000 n 
+0000837607 00000 n 
+0000837795 00000 n 
+0000837950 00000 n 
+0000838140 00000 n 
+0000838295 00000 n 
+0000838484 00000 n 
+0000838639 00000 n 
+0000838829 00000 n 
+0000838984 00000 n 
+0000839139 00000 n 
+0000839329 00000 n 
+0000839484 00000 n 
+0000839636 00000 n 
+0000839824 00000 n 
+0000839976 00000 n 
+0000840164 00000 n 
+0000840314 00000 n 
+0000840500 00000 n 
+0000840651 00000 n 
+0000840838 00000 n 
+0000840989 00000 n 
+0000841176 00000 n 
+0000841328 00000 n 
+0000841516 00000 n 
+0000841668 00000 n 
+0000841856 00000 n 
+0000842008 00000 n 
+0000842196 00000 n 
+0000842348 00000 n 
+0000842536 00000 n 
+0000842688 00000 n 
+0000843253 00000 n 
+0000830851 00000 n 
+0000829447 00000 n 
+0000842876 00000 n 
+0000842939 00000 n 
+0000843002 00000 n 
+0001194721 00000 n 
+0000847337 00000 n 
+0000847525 00000 n 
+0000850981 00000 n 
+0000851170 00000 n 
+0000851358 00000 n 
+0000854101 00000 n 
+0000854290 00000 n 
+0000856675 00000 n 
+0000856864 00000 n 
+0000857053 00000 n 
+0000857242 00000 n 
+0000859625 00000 n 
+0000859813 00000 n 
+0000861873 00000 n 
+0000862062 00000 n 
+0000862251 00000 n 
+0000864555 00000 n 
+0000864743 00000 n 
+0000864994 00000 n 
+0000867342 00000 n 
+0000867469 00000 n 
+0000867596 00000 n 
+0000867721 00000 n 
+0000867847 00000 n 
+0000867974 00000 n 
+0000868101 00000 n 
+0000868225 00000 n 
+0000878717 00000 n 
+0000845196 00000 n 
+0000843995 00000 n 
+0000843383 00000 n 
+0000844118 00000 n 
+0000846461 00000 n 
+0000846616 00000 n 
+0000847651 00000 n 
+0000846308 00000 n 
+0000845298 00000 n 
+0000846769 00000 n 
+0000847463 00000 n 
+0000848356 00000 n 
+0000848170 00000 n 
+0000847837 00000 n 
+0000848293 00000 n 
+0000849928 00000 n 
+0000850082 00000 n 
+0000850237 00000 n 
+0000850392 00000 n 
+0000850546 00000 n 
+0000850700 00000 n 
+0000852984 00000 n 
+0000853139 00000 n 
+0000851420 00000 n 
+0000849739 00000 n 
+0000848444 00000 n 
+0000850855 00000 n 
+0000850918 00000 n 
+0000851107 00000 n 
+0000851295 00000 n 
+0000853294 00000 n 
+0000853449 00000 n 
+0000853603 00000 n 
+0000853757 00000 n 
+0000854477 00000 n 
+0000852795 00000 n 
+0000851592 00000 n 
+0000853912 00000 n 
+0000854038 00000 n 
+0000854227 00000 n 
+0000854414 00000 n 
+0000855838 00000 n 
+0000855992 00000 n 
+0000856147 00000 n 
+0000856302 00000 n 
+0000856457 00000 n 
+0000858816 00000 n 
+0000857304 00000 n 
+0000855658 00000 n 
+0000854635 00000 n 
+0000856612 00000 n 
+0000856801 00000 n 
+0000856990 00000 n 
+0000857179 00000 n 
+0001194846 00000 n 
+0000858971 00000 n 
+0000859126 00000 n 
+0000859281 00000 n 
+0000860001 00000 n 
+0000858645 00000 n 
+0000857462 00000 n 
+0000859436 00000 n 
+0000859562 00000 n 
+0000859750 00000 n 
+0000859939 00000 n 
+0000861346 00000 n 
+0000861501 00000 n 
+0000861656 00000 n 
+0000862440 00000 n 
+0000861184 00000 n 
+0000860159 00000 n 
+0000861810 00000 n 
+0000861999 00000 n 
+0000862188 00000 n 
+0000862377 00000 n 
+0000864029 00000 n 
+0000864183 00000 n 
+0000864338 00000 n 
+0000866003 00000 n 
+0000865056 00000 n 
+0000863867 00000 n 
+0000862598 00000 n 
+0000864492 00000 n 
+0000864681 00000 n 
+0000864868 00000 n 
+0000866155 00000 n 
+0000866307 00000 n 
+0000866459 00000 n 
+0000866610 00000 n 
+0000866762 00000 n 
+0000866914 00000 n 
+0000867066 00000 n 
+0000870479 00000 n 
+0000870631 00000 n 
+0000870783 00000 n 
+0000868288 00000 n 
+0000865796 00000 n 
+0000865214 00000 n 
+0000867216 00000 n 
+0000870937 00000 n 
+0000871091 00000 n 
+0000871281 00000 n 
+0000871435 00000 n 
+0000871625 00000 n 
+0000871779 00000 n 
+0000871969 00000 n 
+0000872123 00000 n 
+0000872313 00000 n 
+0000872467 00000 n 
+0000872657 00000 n 
+0000872811 00000 n 
+0000873001 00000 n 
+0000873155 00000 n 
+0000873345 00000 n 
+0000873499 00000 n 
+0000873689 00000 n 
+0000873843 00000 n 
+0000874033 00000 n 
+0000874187 00000 n 
+0000874377 00000 n 
+0000874565 00000 n 
+0000874753 00000 n 
+0000874942 00000 n 
+0000875098 00000 n 
+0000875288 00000 n 
+0000875443 00000 n 
+0000875633 00000 n 
+0000875787 00000 n 
+0000875943 00000 n 
+0000876133 00000 n 
+0000876288 00000 n 
+0000876443 00000 n 
+0000876599 00000 n 
+0000876789 00000 n 
+0000876944 00000 n 
+0000877099 00000 n 
+0000877289 00000 n 
+0000877444 00000 n 
+0000877599 00000 n 
+0000877789 00000 n 
+0000877944 00000 n 
+0000878098 00000 n 
+0000878285 00000 n 
+0000878438 00000 n 
+0000881700 00000 n 
+0000881856 00000 n 
+0000882046 00000 n 
+0000882201 00000 n 
+0000882356 00000 n 
+0000882546 00000 n 
+0000882700 00000 n 
+0000882890 00000 n 
+0000883045 00000 n 
+0000883234 00000 n 
+0000883389 00000 n 
+0000883578 00000 n 
+0000878971 00000 n 
+0000869912 00000 n 
+0000868390 00000 n 
+0000878591 00000 n 
+0000878844 00000 n 
+0000883732 00000 n 
+0000883920 00000 n 
+0000884075 00000 n 
+0000884230 00000 n 
+0000884420 00000 n 
+0000884575 00000 n 
+0000884764 00000 n 
+0000884919 00000 n 
+0000885109 00000 n 
+0000885264 00000 n 
+0000885454 00000 n 
+0000885609 00000 n 
+0000885764 00000 n 
+0000885954 00000 n 
+0000886109 00000 n 
+0000886274 00000 n 
+0000886439 00000 n 
+0000886793 00000 n 
+0000881304 00000 n 
+0000879073 00000 n 
+0000886604 00000 n 
+0001194971 00000 n 
+0000888046 00000 n 
+0000888274 00000 n 
+0000887902 00000 n 
+0000886881 00000 n 
+0000888211 00000 n 
+0000889997 00000 n 
+0000890148 00000 n 
+0000890299 00000 n 
+0000890450 00000 n 
+0000890601 00000 n 
+0000890752 00000 n 
+0000890903 00000 n 
+0000891054 00000 n 
+0000891205 00000 n 
+0000891356 00000 n 
+0000891507 00000 n 
+0000891658 00000 n 
+0000891808 00000 n 
+0000891958 00000 n 
+0000892108 00000 n 
+0000892259 00000 n 
+0000892410 00000 n 
+0000892561 00000 n 
+0000892711 00000 n 
+0000892861 00000 n 
+0000893010 00000 n 
+0000893161 00000 n 
+0000893311 00000 n 
+0000893462 00000 n 
+0000893611 00000 n 
+0000893762 00000 n 
+0000893913 00000 n 
+0000894064 00000 n 
+0000894215 00000 n 
+0000894366 00000 n 
+0000894517 00000 n 
+0000894668 00000 n 
+0000894819 00000 n 
+0000894970 00000 n 
+0000895121 00000 n 
+0000895272 00000 n 
+0000895423 00000 n 
+0000895573 00000 n 
+0000895723 00000 n 
+0000895874 00000 n 
+0000896025 00000 n 
+0000896176 00000 n 
+0000896325 00000 n 
+0000896475 00000 n 
+0000896626 00000 n 
+0000896777 00000 n 
+0000896928 00000 n 
+0000897079 00000 n 
+0000899435 00000 n 
+0000897354 00000 n 
+0000889430 00000 n 
+0000888362 00000 n 
+0000897228 00000 n 
+0000899585 00000 n 
+0000899736 00000 n 
+0000899887 00000 n 
+0000900038 00000 n 
+0000900189 00000 n 
+0000900340 00000 n 
+0000900491 00000 n 
+0000900641 00000 n 
+0000900790 00000 n 
+0000900939 00000 n 
+0000901088 00000 n 
+0000901239 00000 n 
+0000901389 00000 n 
+0000901539 00000 n 
+0000901689 00000 n 
+0000901841 00000 n 
+0000901992 00000 n 
+0000902143 00000 n 
+0000902294 00000 n 
+0000902443 00000 n 
+0000902594 00000 n 
+0000902745 00000 n 
+0000902896 00000 n 
+0000903047 00000 n 
+0000903197 00000 n 
+0000903348 00000 n 
+0000903498 00000 n 
+0000903649 00000 n 
+0000903797 00000 n 
+0000903947 00000 n 
+0000904098 00000 n 
+0000904249 00000 n 
+0000904400 00000 n 
+0000904549 00000 n 
+0000904700 00000 n 
+0000904851 00000 n 
+0000905002 00000 n 
+0000905153 00000 n 
+0000905304 00000 n 
+0000905455 00000 n 
+0000905606 00000 n 
+0000905757 00000 n 
+0000905908 00000 n 
+0000906059 00000 n 
+0000906210 00000 n 
+0000906361 00000 n 
+0000906512 00000 n 
+0000906663 00000 n 
+0000906814 00000 n 
+0000906966 00000 n 
+0000907117 00000 n 
+0000907267 00000 n 
+0000907417 00000 n 
+0000907568 00000 n 
+0000907720 00000 n 
+0000907872 00000 n 
+0000908022 00000 n 
+0000908173 00000 n 
+0000908322 00000 n 
+0000908473 00000 n 
+0000908624 00000 n 
+0000908775 00000 n 
+0000908926 00000 n 
+0000909077 00000 n 
+0000909228 00000 n 
+0000909378 00000 n 
+0000909589 00000 n 
+0000898697 00000 n 
+0000897456 00000 n 
+0000909526 00000 n 
+0000911485 00000 n 
+0000911635 00000 n 
+0000911785 00000 n 
+0000911936 00000 n 
+0000912086 00000 n 
+0000912236 00000 n 
+0000912387 00000 n 
+0000912537 00000 n 
+0000912687 00000 n 
+0000912837 00000 n 
+0000912988 00000 n 
+0000913139 00000 n 
+0000913290 00000 n 
+0000913441 00000 n 
+0000913592 00000 n 
+0000913743 00000 n 
+0000913894 00000 n 
+0000914045 00000 n 
+0000914196 00000 n 
+0000914347 00000 n 
+0000914498 00000 n 
+0000914648 00000 n 
+0000914798 00000 n 
+0000914948 00000 n 
+0000915099 00000 n 
+0000915250 00000 n 
+0000915401 00000 n 
+0000915551 00000 n 
+0000915699 00000 n 
+0000915850 00000 n 
+0000916001 00000 n 
+0000916152 00000 n 
+0000916303 00000 n 
+0000916454 00000 n 
+0000916605 00000 n 
+0000916756 00000 n 
+0000916907 00000 n 
+0000917056 00000 n 
+0000917206 00000 n 
+0000917356 00000 n 
+0000917507 00000 n 
+0000917658 00000 n 
+0000917808 00000 n 
+0000917958 00000 n 
+0000918108 00000 n 
+0000918258 00000 n 
+0000918409 00000 n 
+0000918560 00000 n 
+0000918710 00000 n 
+0000918860 00000 n 
+0000919010 00000 n 
+0000919160 00000 n 
+0000919311 00000 n 
+0000919462 00000 n 
+0000919613 00000 n 
+0000919764 00000 n 
+0000921867 00000 n 
+0000919977 00000 n 
+0000910846 00000 n 
+0000909677 00000 n 
+0000919914 00000 n 
+0000922018 00000 n 
+0000922169 00000 n 
+0000922321 00000 n 
+0000922471 00000 n 
+0000922623 00000 n 
+0000922775 00000 n 
+0000922927 00000 n 
+0000923079 00000 n 
+0000923231 00000 n 
+0000923383 00000 n 
+0000923535 00000 n 
+0000923687 00000 n 
+0000923839 00000 n 
+0000923991 00000 n 
+0000924141 00000 n 
+0000924291 00000 n 
+0000924440 00000 n 
+0000924590 00000 n 
+0000924741 00000 n 
+0000924892 00000 n 
+0000925042 00000 n 
+0000925192 00000 n 
+0000925344 00000 n 
+0000925494 00000 n 
+0000925644 00000 n 
+0000925794 00000 n 
+0000925945 00000 n 
+0000926097 00000 n 
+0000926246 00000 n 
+0000926397 00000 n 
+0000926547 00000 n 
+0000926697 00000 n 
+0000926847 00000 n 
+0000926998 00000 n 
+0000927149 00000 n 
+0000927300 00000 n 
+0000927452 00000 n 
+0000927604 00000 n 
+0000927756 00000 n 
+0000927908 00000 n 
+0000928060 00000 n 
+0000928212 00000 n 
+0000928364 00000 n 
+0000928516 00000 n 
+0000928668 00000 n 
+0000928820 00000 n 
+0000928972 00000 n 
+0000929124 00000 n 
+0000929276 00000 n 
+0000929428 00000 n 
+0000929580 00000 n 
+0000929730 00000 n 
+0000929881 00000 n 
+0000930031 00000 n 
+0000930181 00000 n 
+0000930331 00000 n 
+0000930482 00000 n 
+0000930633 00000 n 
+0000932773 00000 n 
+0000930845 00000 n 
+0000921201 00000 n 
+0000920065 00000 n 
+0000930782 00000 n 
+0000932924 00000 n 
+0000933075 00000 n 
+0000933226 00000 n 
+0000933377 00000 n 
+0000933528 00000 n 
+0000933679 00000 n 
+0000933830 00000 n 
+0000933982 00000 n 
+0000934133 00000 n 
+0000934284 00000 n 
+0000934435 00000 n 
+0000934585 00000 n 
+0000934736 00000 n 
+0000934887 00000 n 
+0000935037 00000 n 
+0000935187 00000 n 
+0000935337 00000 n 
+0000935489 00000 n 
+0000935640 00000 n 
+0000935789 00000 n 
+0000935938 00000 n 
+0000936089 00000 n 
+0000936240 00000 n 
+0000936390 00000 n 
+0000936539 00000 n 
+0000936687 00000 n 
+0000936836 00000 n 
+0000936986 00000 n 
+0000937136 00000 n 
+0000937287 00000 n 
+0000937435 00000 n 
+0000937585 00000 n 
+0000937736 00000 n 
+0000937887 00000 n 
+0000938038 00000 n 
+0000938188 00000 n 
+0000938338 00000 n 
+0000938489 00000 n 
+0000938640 00000 n 
+0000938791 00000 n 
+0000938941 00000 n 
+0000939090 00000 n 
+0000939240 00000 n 
+0000939391 00000 n 
+0000939542 00000 n 
+0000939693 00000 n 
+0000939844 00000 n 
+0000939995 00000 n 
+0000940146 00000 n 
+0000940297 00000 n 
+0000940448 00000 n 
+0000940599 00000 n 
+0000940751 00000 n 
+0000940903 00000 n 
+0000941055 00000 n 
+0000941207 00000 n 
+0000941359 00000 n 
+0000941511 00000 n 
+0000941663 00000 n 
+0000941815 00000 n 
+0000941966 00000 n 
+0000942179 00000 n 
+0000932080 00000 n 
+0000930933 00000 n 
+0000942116 00000 n 
+0001195096 00000 n 
+0000944002 00000 n 
+0000944154 00000 n 
+0000944305 00000 n 
+0000944456 00000 n 
+0000944607 00000 n 
+0000944759 00000 n 
+0000944911 00000 n 
+0000945063 00000 n 
+0000945214 00000 n 
+0000945364 00000 n 
+0000945515 00000 n 
+0000945667 00000 n 
+0000945819 00000 n 
+0000945971 00000 n 
+0000946123 00000 n 
+0000946275 00000 n 
+0000946427 00000 n 
+0000946577 00000 n 
+0000946727 00000 n 
+0000946877 00000 n 
+0000947028 00000 n 
+0000947178 00000 n 
+0000947329 00000 n 
+0000947480 00000 n 
+0000947631 00000 n 
+0000947782 00000 n 
+0000947933 00000 n 
+0000948084 00000 n 
+0000948235 00000 n 
+0000948384 00000 n 
+0000948535 00000 n 
+0000948685 00000 n 
+0000948836 00000 n 
+0000948987 00000 n 
+0000949138 00000 n 
+0000949289 00000 n 
+0000949440 00000 n 
+0000949590 00000 n 
+0000949739 00000 n 
+0000949890 00000 n 
+0000950041 00000 n 
+0000950192 00000 n 
+0000950343 00000 n 
+0000950494 00000 n 
+0000950645 00000 n 
+0000950796 00000 n 
+0000950947 00000 n 
+0000951098 00000 n 
+0000951248 00000 n 
+0000951399 00000 n 
+0000951550 00000 n 
+0000951701 00000 n 
+0000951850 00000 n 
+0000951999 00000 n 
+0000952150 00000 n 
+0000952300 00000 n 
+0000952451 00000 n 
+0000952602 00000 n 
+0000955335 00000 n 
+0000952814 00000 n 
+0000943345 00000 n 
+0000942267 00000 n 
+0000952751 00000 n 
+0000955485 00000 n 
+0000955635 00000 n 
+0000955786 00000 n 
+0000955936 00000 n 
+0000956086 00000 n 
+0000956236 00000 n 
+0000956386 00000 n 
+0000956534 00000 n 
+0000956684 00000 n 
+0000956835 00000 n 
+0000956984 00000 n 
+0000957135 00000 n 
+0000957286 00000 n 
+0000957437 00000 n 
+0000957587 00000 n 
+0000957737 00000 n 
+0000957887 00000 n 
+0000958036 00000 n 
+0000958186 00000 n 
+0000958337 00000 n 
+0000958488 00000 n 
+0000958638 00000 n 
+0000958788 00000 n 
+0000958939 00000 n 
+0000959089 00000 n 
+0000959240 00000 n 
+0000959391 00000 n 
+0000959542 00000 n 
+0000959693 00000 n 
+0000959843 00000 n 
+0000959993 00000 n 
+0000960143 00000 n 
+0000960293 00000 n 
+0000960443 00000 n 
+0000960594 00000 n 
+0000960744 00000 n 
+0000960895 00000 n 
+0000961046 00000 n 
+0000961197 00000 n 
+0000961346 00000 n 
+0000961495 00000 n 
+0000961646 00000 n 
+0000961797 00000 n 
+0000961947 00000 n 
+0000962098 00000 n 
+0000962249 00000 n 
+0000962400 00000 n 
+0000962551 00000 n 
+0000962702 00000 n 
+0000962851 00000 n 
+0000963000 00000 n 
+0000963149 00000 n 
+0000963299 00000 n 
+0000963449 00000 n 
+0000963600 00000 n 
+0000963750 00000 n 
+0000963900 00000 n 
+0000964051 00000 n 
+0000964199 00000 n 
+0000964349 00000 n 
+0000964499 00000 n 
+0000964650 00000 n 
+0000964801 00000 n 
+0000964952 00000 n 
+0000965103 00000 n 
+0000965254 00000 n 
+0000965405 00000 n 
+0000965556 00000 n 
+0000965706 00000 n 
+0000965857 00000 n 
+0000966007 00000 n 
+0000966157 00000 n 
+0000966308 00000 n 
+0000966458 00000 n 
+0000966609 00000 n 
+0000966760 00000 n 
+0000966911 00000 n 
+0000967061 00000 n 
+0000967212 00000 n 
+0000967363 00000 n 
+0000967512 00000 n 
+0000967663 00000 n 
+0000967813 00000 n 
+0000967964 00000 n 
+0000968114 00000 n 
+0000968264 00000 n 
+0000968415 00000 n 
+0000968564 00000 n 
+0000968715 00000 n 
+0000968865 00000 n 
+0000969016 00000 n 
+0000969167 00000 n 
+0000969318 00000 n 
+0000969469 00000 n 
+0000969620 00000 n 
+0000969771 00000 n 
+0000969921 00000 n 
+0000970070 00000 n 
+0000972975 00000 n 
+0000970281 00000 n 
+0000954309 00000 n 
+0000952902 00000 n 
+0000970218 00000 n 
+0000973126 00000 n 
+0000973277 00000 n 
+0000973428 00000 n 
+0000973578 00000 n 
+0000973729 00000 n 
+0000973879 00000 n 
+0000974029 00000 n 
+0000974180 00000 n 
+0000974331 00000 n 
+0000974482 00000 n 
+0000974631 00000 n 
+0000974781 00000 n 
+0000974931 00000 n 
+0000975082 00000 n 
+0000975232 00000 n 
+0000975381 00000 n 
+0000975532 00000 n 
+0000975680 00000 n 
+0000975831 00000 n 
+0000975981 00000 n 
+0000976131 00000 n 
+0000976282 00000 n 
+0000976433 00000 n 
+0000976584 00000 n 
+0000976735 00000 n 
+0000976886 00000 n 
+0000977037 00000 n 
+0000977188 00000 n 
+0000977339 00000 n 
+0000977490 00000 n 
+0000977641 00000 n 
+0000977792 00000 n 
+0000977942 00000 n 
+0000978092 00000 n 
+0000978242 00000 n 
+0000978393 00000 n 
+0000978543 00000 n 
+0000978693 00000 n 
+0000978843 00000 n 
+0000978992 00000 n 
+0000979143 00000 n 
+0000979293 00000 n 
+0000979443 00000 n 
+0000979593 00000 n 
+0000979743 00000 n 
+0000979894 00000 n 
+0000980045 00000 n 
+0000980196 00000 n 
+0000980346 00000 n 
+0000980497 00000 n 
+0000980648 00000 n 
+0000980799 00000 n 
+0000980949 00000 n 
+0000981100 00000 n 
+0000981251 00000 n 
+0000981401 00000 n 
+0000981550 00000 n 
+0000981699 00000 n 
+0000981850 00000 n 
+0000982001 00000 n 
+0000982152 00000 n 
+0000982303 00000 n 
+0000982454 00000 n 
+0000982605 00000 n 
+0000982756 00000 n 
+0000982907 00000 n 
+0000983057 00000 n 
+0000983208 00000 n 
+0000983357 00000 n 
+0000983508 00000 n 
+0000983657 00000 n 
+0000983807 00000 n 
+0000983957 00000 n 
+0000984107 00000 n 
+0000984258 00000 n 
+0000984407 00000 n 
+0000984558 00000 n 
+0000984708 00000 n 
+0000984859 00000 n 
+0000985010 00000 n 
+0000985161 00000 n 
+0000985312 00000 n 
+0000985462 00000 n 
+0000985613 00000 n 
+0000985763 00000 n 
+0000985914 00000 n 
+0000986065 00000 n 
+0000986216 00000 n 
+0000986367 00000 n 
+0000986518 00000 n 
+0000986669 00000 n 
+0000986820 00000 n 
+0000986971 00000 n 
+0000987122 00000 n 
+0000987273 00000 n 
+0000987424 00000 n 
+0000987575 00000 n 
+0000987724 00000 n 
+0000987874 00000 n 
+0000988024 00000 n 
+0000988174 00000 n 
+0000988324 00000 n 
+0000988474 00000 n 
+0000988625 00000 n 
+0000988773 00000 n 
+0000988924 00000 n 
+0000989074 00000 n 
+0000989224 00000 n 
+0000989375 00000 n 
+0000989526 00000 n 
+0000989677 00000 n 
+0000989828 00000 n 
+0000989978 00000 n 
+0000990129 00000 n 
+0000990278 00000 n 
+0000993400 00000 n 
+0000990490 00000 n 
+0000971796 00000 n 
+0000970369 00000 n 
+0000990427 00000 n 
+0000993551 00000 n 
+0000993702 00000 n 
+0000993852 00000 n 
+0000994002 00000 n 
+0000994153 00000 n 
+0000994304 00000 n 
+0000994455 00000 n 
+0000994605 00000 n 
+0000994755 00000 n 
+0000994906 00000 n 
+0000995055 00000 n 
+0000995205 00000 n 
+0000995355 00000 n 
+0000995505 00000 n 
+0000995655 00000 n 
+0000995805 00000 n 
+0000995956 00000 n 
+0000996107 00000 n 
+0000996258 00000 n 
+0000996409 00000 n 
+0000996559 00000 n 
+0000996710 00000 n 
+0000996861 00000 n 
+0000997012 00000 n 
+0000997162 00000 n 
+0000997312 00000 n 
+0000997463 00000 n 
+0000997614 00000 n 
+0000997761 00000 n 
+0000997911 00000 n 
+0000998061 00000 n 
+0000998212 00000 n 
+0000998362 00000 n 
+0000998512 00000 n 
+0000998662 00000 n 
+0000998813 00000 n 
+0000998964 00000 n 
+0000999112 00000 n 
+0000999263 00000 n 
+0000999413 00000 n 
+0000999563 00000 n 
+0000999713 00000 n 
+0000999864 00000 n 
+0001000015 00000 n 
+0001000165 00000 n 
+0001000316 00000 n 
+0001000467 00000 n 
+0001000618 00000 n 
+0001000769 00000 n 
+0001000920 00000 n 
+0001001069 00000 n 
+0001001219 00000 n 
+0001001370 00000 n 
+0001001521 00000 n 
+0001001672 00000 n 
+0001001821 00000 n 
+0001001970 00000 n 
+0001002121 00000 n 
+0001002272 00000 n 
+0001002422 00000 n 
+0001002571 00000 n 
+0001002721 00000 n 
+0001002872 00000 n 
+0001003023 00000 n 
+0001003174 00000 n 
+0001003325 00000 n 
+0001003476 00000 n 
+0001003625 00000 n 
+0001003775 00000 n 
+0001003925 00000 n 
+0001004076 00000 n 
+0001004226 00000 n 
+0001004376 00000 n 
+0001004527 00000 n 
+0001004676 00000 n 
+0001004827 00000 n 
+0001004977 00000 n 
+0001005128 00000 n 
+0001005278 00000 n 
+0001005429 00000 n 
+0001005580 00000 n 
+0001005731 00000 n 
+0001005881 00000 n 
+0001006031 00000 n 
+0001006182 00000 n 
+0001006333 00000 n 
+0001006483 00000 n 
+0001006633 00000 n 
+0001006783 00000 n 
+0001006935 00000 n 
+0001007086 00000 n 
+0001007237 00000 n 
+0001007389 00000 n 
+0001007538 00000 n 
+0001007689 00000 n 
+0001007839 00000 n 
+0001007989 00000 n 
+0001008139 00000 n 
+0001008289 00000 n 
+0001008440 00000 n 
+0001008590 00000 n 
+0001008741 00000 n 
+0001008892 00000 n 
+0001009043 00000 n 
+0001009194 00000 n 
+0001009345 00000 n 
+0001009496 00000 n 
+0001009646 00000 n 
+0001009797 00000 n 
+0001009948 00000 n 
+0001010096 00000 n 
+0001012548 00000 n 
+0001010308 00000 n 
+0000992257 00000 n 
+0000990578 00000 n 
+0001010245 00000 n 
+0001012699 00000 n 
+0001012851 00000 n 
+0001013003 00000 n 
+0001013155 00000 n 
+0001013306 00000 n 
+0001013458 00000 n 
+0001013610 00000 n 
+0001013762 00000 n 
+0001013913 00000 n 
+0001014065 00000 n 
+0001014217 00000 n 
+0001014367 00000 n 
+0001014519 00000 n 
+0001014671 00000 n 
+0001014822 00000 n 
+0001014971 00000 n 
+0001015119 00000 n 
+0001015268 00000 n 
+0001015418 00000 n 
+0001015568 00000 n 
+0001015718 00000 n 
+0001015868 00000 n 
+0001016018 00000 n 
+0001016168 00000 n 
+0001016318 00000 n 
+0001016468 00000 n 
+0001016618 00000 n 
+0001016768 00000 n 
+0001016918 00000 n 
+0001017068 00000 n 
+0001017218 00000 n 
+0001017368 00000 n 
+0001017518 00000 n 
+0001017668 00000 n 
+0001017818 00000 n 
+0001017968 00000 n 
+0001018116 00000 n 
+0001018267 00000 n 
+0001018417 00000 n 
+0001018567 00000 n 
+0001018717 00000 n 
+0001018868 00000 n 
+0001019019 00000 n 
+0001019170 00000 n 
+0001019320 00000 n 
+0001019469 00000 n 
+0001019619 00000 n 
+0001019770 00000 n 
+0001019921 00000 n 
+0001020072 00000 n 
+0001020224 00000 n 
+0001020376 00000 n 
+0001020528 00000 n 
+0001020679 00000 n 
+0001020831 00000 n 
+0001020983 00000 n 
+0001021135 00000 n 
+0001021287 00000 n 
+0001021439 00000 n 
+0001021591 00000 n 
+0001021743 00000 n 
+0001021895 00000 n 
+0001022047 00000 n 
+0001022199 00000 n 
+0001022348 00000 n 
+0001022500 00000 n 
+0001022651 00000 n 
+0001022803 00000 n 
+0001022954 00000 n 
+0001023105 00000 n 
+0001023256 00000 n 
+0001023408 00000 n 
+0001023558 00000 n 
+0001023709 00000 n 
+0001023861 00000 n 
+0001024011 00000 n 
+0001024163 00000 n 
+0001024315 00000 n 
+0001024466 00000 n 
+0001024617 00000 n 
+0001024769 00000 n 
+0001024921 00000 n 
+0001025070 00000 n 
+0001025220 00000 n 
+0001028089 00000 n 
+0001025433 00000 n 
+0001011648 00000 n 
+0001010396 00000 n 
+0001025370 00000 n 
+0001028240 00000 n 
+0001028392 00000 n 
+0001028544 00000 n 
+0001028696 00000 n 
+0001028847 00000 n 
+0001028999 00000 n 
+0001029151 00000 n 
+0001029303 00000 n 
+0001029454 00000 n 
+0001029606 00000 n 
+0001029756 00000 n 
+0001029907 00000 n 
+0001030058 00000 n 
+0001030209 00000 n 
+0001030360 00000 n 
+0001030510 00000 n 
+0001030662 00000 n 
+0001030812 00000 n 
+0001030964 00000 n 
+0001031115 00000 n 
+0001031267 00000 n 
+0001031419 00000 n 
+0001031571 00000 n 
+0001031723 00000 n 
+0001031875 00000 n 
+0001032027 00000 n 
+0001032177 00000 n 
+0001032327 00000 n 
+0001032478 00000 n 
+0001032629 00000 n 
+0001032780 00000 n 
+0001032931 00000 n 
+0001033081 00000 n 
+0001033231 00000 n 
+0001033381 00000 n 
+0001033532 00000 n 
+0001033682 00000 n 
+0001033833 00000 n 
+0001033983 00000 n 
+0001034134 00000 n 
+0001034285 00000 n 
+0001034436 00000 n 
+0001034587 00000 n 
+0001034736 00000 n 
+0001034886 00000 n 
+0001035037 00000 n 
+0001035186 00000 n 
+0001035337 00000 n 
+0001035488 00000 n 
+0001035639 00000 n 
+0001035790 00000 n 
+0001035940 00000 n 
+0001036091 00000 n 
+0001036242 00000 n 
+0001036393 00000 n 
+0001036541 00000 n 
+0001036692 00000 n 
+0001036843 00000 n 
+0001036993 00000 n 
+0001037143 00000 n 
+0001037295 00000 n 
+0001037446 00000 n 
+0001037598 00000 n 
+0001037749 00000 n 
+0001037901 00000 n 
+0001038053 00000 n 
+0001038205 00000 n 
+0001038357 00000 n 
+0001038509 00000 n 
+0001038660 00000 n 
+0001038811 00000 n 
+0001038962 00000 n 
+0001039113 00000 n 
+0001039263 00000 n 
+0001039414 00000 n 
+0001039565 00000 n 
+0001039716 00000 n 
+0001039868 00000 n 
+0001040020 00000 n 
+0001040172 00000 n 
+0001040324 00000 n 
+0001040476 00000 n 
+0001040628 00000 n 
+0001040780 00000 n 
+0001040932 00000 n 
+0001041084 00000 n 
+0001041236 00000 n 
+0001041388 00000 n 
+0001041540 00000 n 
+0001041691 00000 n 
+0001041842 00000 n 
+0001041993 00000 n 
+0001042145 00000 n 
+0001042296 00000 n 
+0001042448 00000 n 
+0001042600 00000 n 
+0001042752 00000 n 
+0001042904 00000 n 
+0001043055 00000 n 
+0001043205 00000 n 
+0001043352 00000 n 
+0001043503 00000 n 
+0001043655 00000 n 
+0001043805 00000 n 
+0001043957 00000 n 
+0001044109 00000 n 
+0001044260 00000 n 
+0001044411 00000 n 
+0001044563 00000 n 
+0001044715 00000 n 
+0001044867 00000 n 
+0001045019 00000 n 
+0001045171 00000 n 
+0001045321 00000 n 
+0001047402 00000 n 
+0001045534 00000 n 
+0001026919 00000 n 
+0001025521 00000 n 
+0001045471 00000 n 
+0001195221 00000 n 
+0001047554 00000 n 
+0001047706 00000 n 
+0001047858 00000 n 
+0001048010 00000 n 
+0001048162 00000 n 
+0001048313 00000 n 
+0001048462 00000 n 
+0001048613 00000 n 
+0001048764 00000 n 
+0001048914 00000 n 
+0001049064 00000 n 
+0001049212 00000 n 
+0001049362 00000 n 
+0001049512 00000 n 
+0001049663 00000 n 
+0001049814 00000 n 
+0001049964 00000 n 
+0001050114 00000 n 
+0001050263 00000 n 
+0001050412 00000 n 
+0001050561 00000 n 
+0001050712 00000 n 
+0001050864 00000 n 
+0001051016 00000 n 
+0001051168 00000 n 
+0001051320 00000 n 
+0001051471 00000 n 
+0001051621 00000 n 
+0001051771 00000 n 
+0001051921 00000 n 
+0001052071 00000 n 
+0001052219 00000 n 
+0001052370 00000 n 
+0001052522 00000 n 
+0001052674 00000 n 
+0001052825 00000 n 
+0001052977 00000 n 
+0001053129 00000 n 
+0001053281 00000 n 
+0001053433 00000 n 
+0001053585 00000 n 
+0001053737 00000 n 
+0001053889 00000 n 
+0001054041 00000 n 
+0001054193 00000 n 
+0001054345 00000 n 
+0001054497 00000 n 
+0001054649 00000 n 
+0001054800 00000 n 
+0001054951 00000 n 
+0001055102 00000 n 
+0001055254 00000 n 
+0001055406 00000 n 
+0001055558 00000 n 
+0001055709 00000 n 
+0001055859 00000 n 
+0001056010 00000 n 
+0001056162 00000 n 
+0001056314 00000 n 
+0001056466 00000 n 
+0001057359 00000 n 
+0001056679 00000 n 
+0001046718 00000 n 
+0001045622 00000 n 
+0001056616 00000 n 
+0001057511 00000 n 
+0001057663 00000 n 
+0001057815 00000 n 
+0001057967 00000 n 
+0001058119 00000 n 
+0001058271 00000 n 
+0001058486 00000 n 
+0001057161 00000 n 
+0001056767 00000 n 
+0001058423 00000 n 
+0001179990 00000 n 
+0001058574 00000 n 
+0001058910 00000 n 
+0001058936 00000 n 
+0001059537 00000 n 
+0001059573 00000 n 
+0001059599 00000 n 
+0001060098 00000 n 
+0001060494 00000 n 
+0001060971 00000 n 
+0001061439 00000 n 
+0001061911 00000 n 
+0001062481 00000 n 
+0001069621 00000 n 
+0001069856 00000 n 
+0001076871 00000 n 
+0001077106 00000 n 
+0001084293 00000 n 
+0001084532 00000 n 
+0001091821 00000 n 
+0001092073 00000 n 
+0001099202 00000 n 
+0001099436 00000 n 
+0001118782 00000 n 
+0001119376 00000 n 
+0001132599 00000 n 
+0001132954 00000 n 
+0001145543 00000 n 
+0001145984 00000 n 
+0001156193 00000 n 
+0001156528 00000 n 
+0001168244 00000 n 
+0001168816 00000 n 
+0001179531 00000 n 
+0001180483 00000 n 
+0001181427 00000 n 
+0001182369 00000 n 
+0001183517 00000 n 
+0001184665 00000 n 
+0001185810 00000 n 
+0001186751 00000 n 
+0001187697 00000 n 
+0001188638 00000 n 
+0001189584 00000 n 
+0001190525 00000 n 
+0001195319 00000 n 
+0001195445 00000 n 
+0001195571 00000 n 
+0001195697 00000 n 
+0001195823 00000 n 
+0001195949 00000 n 
+0001196029 00000 n 
+0001196139 00000 n 
+0001250876 00000 n 
+0001251056 00000 n 
+0001251229 00000 n 
+0001251426 00000 n 
+0001251607 00000 n 
+0001252100 00000 n 
+0001252661 00000 n 
+0001253222 00000 n 
+0001253783 00000 n 
+0001254344 00000 n 
+0001254765 00000 n 
+0001255132 00000 n 
+0001255493 00000 n 
+0001255673 00000 n 
+0001255858 00000 n 
+0001256041 00000 n 
+0001256224 00000 n 
+0001256409 00000 n 
+0001256593 00000 n 
+0001256778 00000 n 
+0001256962 00000 n 
+0001257147 00000 n 
+0001257331 00000 n 
+0001257516 00000 n 
+0001257700 00000 n 
+0001257882 00000 n 
+0001258058 00000 n 
+0001258235 00000 n 
+0001258410 00000 n 
+0001258585 00000 n 
+0001258762 00000 n 
+0001258938 00000 n 
+0001259115 00000 n 
+0001259291 00000 n 
+0001259468 00000 n 
+0001259644 00000 n 
+0001259821 00000 n 
+0001259997 00000 n 
+0001260174 00000 n 
+0001260349 00000 n 
+0001260532 00000 n 
+0001260741 00000 n 
+0001260949 00000 n 
+0001261158 00000 n 
+0001261366 00000 n 
+0001261573 00000 n 
+0001261773 00000 n 
+0001261973 00000 n 
+0001262176 00000 n 
+0001262386 00000 n 
+0001262603 00000 n 
+0001262819 00000 n 
+0001263036 00000 n 
+0001263249 00000 n 
+0001263478 00000 n 
+0001264039 00000 n 
+0001264600 00000 n 
+0001265161 00000 n 
+0001265722 00000 n 
+0001266222 00000 n 
+0001266711 00000 n 
+0001267190 00000 n 
+0001267572 00000 n 
+0001267950 00000 n 
+0001268439 00000 n 
+0001268928 00000 n 
+0001269324 00000 n 
+0001269564 00000 n 
+0001269809 00000 n 
+0001270052 00000 n 
+0001270299 00000 n 
+0001270556 00000 n 
+0001270813 00000 n 
+0001271070 00000 n 
+0001271323 00000 n 
+0001271574 00000 n 
+0001271840 00000 n 
+0001272122 00000 n 
+0001272405 00000 n 
+0001272688 00000 n 
+0001272977 00000 n 
+0001273260 00000 n 
+0001273547 00000 n 
+0001273838 00000 n 
+0001274128 00000 n 
+0001274417 00000 n 
+0001274700 00000 n 
+0001274994 00000 n 
+0001275293 00000 n 
+0001275590 00000 n 
+0001275887 00000 n 
+0001276186 00000 n 
+0001276484 00000 n 
+0001276783 00000 n 
+0001277081 00000 n 
+0001277386 00000 n 
+0001277689 00000 n 
+0001277994 00000 n 
+0001278297 00000 n 
+0001278602 00000 n 
+0001278904 00000 n 
+0001279206 00000 n 
+0001279504 00000 n 
+0001279795 00000 n 
+0001280085 00000 n 
+0001280376 00000 n 
+0001280666 00000 n 
+0001280957 00000 n 
+0001281247 00000 n 
+0001281538 00000 n 
+0001281828 00000 n 
+0001282119 00000 n 
+0001282408 00000 n 
+0001282697 00000 n 
+0001282988 00000 n 
+0001283278 00000 n 
+0001283569 00000 n 
+0001283859 00000 n 
+0001284153 00000 n 
+0001284458 00000 n 
+0001284762 00000 n 
+0001285067 00000 n 
+0001285368 00000 n 
+0001285667 00000 n 
+0001285972 00000 n 
+0001286276 00000 n 
+0001286576 00000 n 
+0001286876 00000 n 
+0001287175 00000 n 
+0001287475 00000 n 
+0001287780 00000 n 
+0001288077 00000 n 
+0001288374 00000 n 
+0001288671 00000 n 
+0001288976 00000 n 
+0001289280 00000 n 
+0001289585 00000 n 
+0001289882 00000 n 
+0001290179 00000 n 
+0001290476 00000 n 
+0001290768 00000 n 
+0001291068 00000 n 
+0001291365 00000 n 
+0001291668 00000 n 
+0001291970 00000 n 
+0001292267 00000 n 
+0001292565 00000 n 
+0001292859 00000 n 
+0001293150 00000 n 
+0001293447 00000 n 
+0001293738 00000 n 
+0001293984 00000 n 
+0001294193 00000 n 
+0001294401 00000 n 
+0001294610 00000 n 
+0001294818 00000 n 
+0001295027 00000 n 
+0001295235 00000 n 
+0001295444 00000 n 
+0001295651 00000 n 
+0001295858 00000 n 
+0001296067 00000 n 
+0001296275 00000 n 
+0001296482 00000 n 
+0001296682 00000 n 
+0001296883 00000 n 
+0001297083 00000 n 
+0001297284 00000 n 
+0001297483 00000 n 
+0001297682 00000 n 
+0001297883 00000 n 
+0001298083 00000 n 
+0001298284 00000 n 
+0001298484 00000 n 
+0001298685 00000 n 
+0001298885 00000 n 
+0001299086 00000 n 
+0001299286 00000 n 
+0001299487 00000 n 
+0001299892 00000 n 
+0001300365 00000 n 
+0001300838 00000 n 
+0001301311 00000 n 
+0001301784 00000 n 
+0001302257 00000 n 
+0001302730 00000 n 
+0001303203 00000 n 
+0001303676 00000 n 
+0001304149 00000 n 
+0001304622 00000 n 
+0001305095 00000 n 
+0001305568 00000 n 
+0001306041 00000 n 
+0001306514 00000 n 
+0001306987 00000 n 
+0001307460 00000 n 
+0001307933 00000 n 
+0001308406 00000 n 
+0001308879 00000 n 
+0001309352 00000 n 
+0001309825 00000 n 
+0001310298 00000 n 
+0001310771 00000 n 
+0001311244 00000 n 
+0001311717 00000 n 
+0001312190 00000 n 
+0001312663 00000 n 
+0001313136 00000 n 
+0001313609 00000 n 
+0001314082 00000 n 
+0001314501 00000 n 
+0001314876 00000 n 
+0001315274 00000 n 
+0001315731 00000 n 
+0001316284 00000 n 
+0001316837 00000 n 
+0001317295 00000 n 
+0001317848 00000 n 
+0001318401 00000 n 
+0001318954 00000 n 
+0001319507 00000 n 
+0001320060 00000 n 
+0001320513 00000 n 
+0001321050 00000 n 
+0001321587 00000 n 
+0001322124 00000 n 
+0001322580 00000 n 
+0001323085 00000 n 
+0001323529 00000 n 
+0001324034 00000 n 
+0001324539 00000 n 
+0001324947 00000 n 
+0001325395 00000 n 
+0001325862 00000 n 
+0001326275 00000 n 
+0001326756 00000 n 
+0001327237 00000 n 
+0001327718 00000 n 
+0001328150 00000 n 
+0001328663 00000 n 
+0001329115 00000 n 
+0001329460 00000 n 
+0001329949 00000 n 
+0001330438 00000 n 
+0001330927 00000 n 
+0001331416 00000 n 
+0001331905 00000 n 
+0001332394 00000 n 
+0001332771 00000 n 
+0001332937 00000 n 
+0001333133 00000 n 
+0001333249 00000 n 
+0001333367 00000 n 
+0001333484 00000 n 
+0001333600 00000 n 
+0001333720 00000 n 
+0001333844 00000 n 
+0001333978 00000 n 
+0001334181 00000 n 
+0001334345 00000 n 
+0001334480 00000 n 
+0001334620 00000 n 
+0001334765 00000 n 
+0001334911 00000 n 
+0001335059 00000 n 
+0001335205 00000 n 
+0001335351 00000 n 
+0001335497 00000 n 
+0001335644 00000 n 
+0001335791 00000 n 
+0001335937 00000 n 
+0001336083 00000 n 
+0001336229 00000 n 
+0001336374 00000 n 
+0001336508 00000 n 
+0001336632 00000 n 
+0001336755 00000 n 
+0001336877 00000 n 
+0001337033 00000 n 
+0001337223 00000 n 
+0001337413 00000 n 
+0001337603 00000 n 
+0001337793 00000 n 
+0001337956 00000 n 
+0001338091 00000 n 
+0001338299 00000 n 
+0001338501 00000 n 
+0001338696 00000 n 
+0001338892 00000 n 
+0001339089 00000 n 
+0001339220 00000 n 
+0001339338 00000 n 
+0001339464 00000 n 
+0001339605 00000 n 
+0001339751 00000 n 
+0001339919 00000 n 
+0001340085 00000 n 
+0001340260 00000 n 
+0001340391 00000 n 
+0001340521 00000 n 
+0001340615 00000 n 
+0001340655 00000 n 
+0001340838 00000 n 
+trailer
+<< /Size 7467
+/Root 7465 0 R
+/Info 7466 0 R
+/ID [<55BD5F5CAEC7A3F919BE73E932064F05> <55BD5F5CAEC7A3F919BE73E932064F05>] >>
+startxref
+1341220
+%%EOF
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/doc/sal.pdf b/TIIGER_TLS/PQ_TIIGER_TLS/doc/sal.pdf
new file mode 100644
index 0000000..d6d3c66
Binary files /dev/null and b/TIIGER_TLS/PQ_TIIGER_TLS/doc/sal.pdf differ
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/doc/tls.pdf b/TIIGER_TLS/PQ_TIIGER_TLS/doc/tls.pdf
new file mode 100644
index 0000000..f3ec0e2
Binary files /dev/null and b/TIIGER_TLS/PQ_TIIGER_TLS/doc/tls.pdf differ
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/doc/vision.pdf b/TIIGER_TLS/PQ_TIIGER_TLS/doc/vision.pdf
new file mode 100644
index 0000000..f3675f0
Binary files /dev/null and b/TIIGER_TLS/PQ_TIIGER_TLS/doc/vision.pdf differ
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/include/tls1_3.h b/TIIGER_TLS/PQ_TIIGER_TLS/include/tls1_3.h
new file mode 100644
index 0000000..3336be4
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/include/tls1_3.h
@@ -0,0 +1,584 @@
+/*
+* JS update 14.04.2024
+* Doplnene IDs pre algoritmy ML-KEM a ML-DSA
+*/
+
+/*
+* JS update 29.02.2024
+* Navysenie premennej TLS_X509_MAX_FIELD
+* Zmeny premennych spojenych s PQ algoritmami (pre CRYPTO_SETTING == POST_QUANTUM)
+* Pridana tabulka pre s velkostami verejnych a sukromnych klucov KEM protokolov a certifikatov, s velkostami sifrovanej spravy a certifikatov
+* Navysenie poctu podporovanych KEM protokolov a algoritmov pre certifikaty
+* Pridane ID pre nove PQ algoritmy
+*/
+
+/**
+ * @file tls1_3.h
+ * @author Mike Scott
+ * @brief Main TLS 1.3 Header File for constants and structures
+ *
+ */ 
+
+#ifndef TLS1_3_H
+#define TLS1_3_H
+
+#include <stdint.h>
+#include "tls_octads.h"
+#include "tls_sockets.h"
+
+typedef uint8_t byte;           /**< 8-bit unsigned integer */
+typedef int8_t sign8 ;          /**< 8-bit signed integer */
+typedef int16_t sign16;         /**< 16-bit signed integer */
+typedef int32_t sign32;         /**< 32-bit signed integer */
+typedef int64_t sign64;         /**< 64-bit signed integer */
+typedef uint32_t unsign32 ;     /**< 32-bit unsigned integer */
+typedef uint64_t unsign64;      /**< 64-bit unsigned integer */
+
+// Terminal Output
+#define IO_NONE 0           /**< Run silently */
+#define IO_APPLICATION 1    /**< just print application traffic */
+#define IO_PROTOCOL 2       /**< print protocol progress + application traffic */
+#define IO_DEBUG 3          /**< print lots of debug information + protocol progress + application progress */
+#define IO_WIRE 4           /**< print lots of debug information + protocol progress + application progress + bytes on the wire */
+
+// // Supported CRYPTO_SETTINGs
+#define TINY_ECC 1          /**< ECC keys only */
+#define TYPICAL 2           /**< Mixture of RSA and ECC - for use with most standard web servers */
+#define POST_QUANTUM 3      /**< Post quantum (Dilithium+Kyber?) */   
+#define HYBRID 4            /**< Hybrid, Kyber/Dilithium + X25519 */
+#define EDDSA 0             /**< experimental EDDSA certificate chain used */
+
+// Client Certificate Chain + Key
+#define NOCERT 0  /**< Don't have a Client Cert */
+#define RSA_SS 1  /**< self signed RSA cert */
+#define ECC_SS 2  /**< self signed ECC cert */
+#define DLT_SS 3  /**< self signed Dilithium cert */
+#define HYB_SS 6  /**< self signed Hybrid cert (Dilithium+ECC) */
+#define HW_1 4    /**< RP2040 1 Hardware cert */
+#define HW_2 5    /**< RP2040 2 Hardware cert */
+#define EDD_SS 7  /**< self signed Ed25519 cert */
+
+// THESE ARE IMPORTANT USER DEFINED SETTINGS ***********************************
+
+// Note that favourite group (as used in client hello) is determined by the SAL ordering - see tls_sal.cpp
+// If server does not support it, an expensive Handshake Retry will be required
+// So best to place a popular group (such as X25519) at top of list in SAL
+
+#define VERBOSITY IO_APPLICATION   /**< Set to level of output information desired - see above */
+#define THIS_YEAR 2023            /**< Set to this year - crudely used to deprecate old certificates */
+
+#define POST_HS_AUTH              /**< Willing to do post handshake authentication */
+#define CLIENT_CERT RSA_SS        /**< Indicate capability of authenticating with a cert plus signing key */
+
+#define CRYPTO_SETTING POST_QUANTUM    /**< Determine Cryptography settings */
+// Supported protocols    
+#define TLS_APPLICATION_PROTOCOL (char *)("http/1.1") /**< Support ALPN protocol */
+#define ALLOW_SELF_SIGNED         /**< allow self-signed server cert */
+//#define NO_CERT_CHECKS          /**< Don't do any checks on server certs - useful for Anvil testing */
+#define TRY_EARLY_DATA            /**< Try to send early data on resumptions */
+
+//#define ENABLE_HEARTBEATS        /**< Enable heartbeats */
+//#define PEER_CAN_HEARTBEAT       /**< Allow peer to heartbeat */
+
+// Note that BUFF, Certificates and crypto keys can be quite large, and therefore maybe better taken from the heap
+// on systems with a shallow stack. Define this to use the heap.
+
+//#define SHALLOW_STACK           /**< Get large arrays from heap, else stack */
+
+// comment out if no max record size. In practise TLS1.3 doesn't seem to support this record_size_limit extension, so use with caution
+// #define MAX_RECORD 1024       /**< Maximum record size client is willing to receive - should be less than TLS_MAX_IBUFF_SIZE below */
+// Note that if this is not used, max_fragment_size extension is tried instead, see TLS_MAX_FRAG below
+
+// define this so that all encrypted records are padded with 0s to full length
+// #define PAD_SHORT_RECORDS     /**< Pad short output records */ 
+
+//#define PREFER_RAW_SERVER_PUBLIC_KEY   /**< Would be happy with raw public key from server */
+//#define PREFER_RAW_CLIENT_PUBLIC_KEY   /**< Would prefer server to accept raw public key from client */
+
+// may need to undefine this for fuzzing 
+#define MERGE_MESSAGES           /**< allow merging of messages into single record */
+
+// *****************************************************************************
+
+
+// Standard Hash Types
+
+#define TLS_SHA256_T 1           /**< SHA256 hash  */
+#define TLS_SHA384_T 2           /**< SHA384 hash  */
+#define TLS_SHA512_T 3           /**< SHA512 hash  */
+
+// Some maximum sizes for stack allocated memory. Handshake will fail if these sizes are exceeded! 
+
+#define TLS_MAX_HASH_STATE 768  /**< Maximum memory required to store hash function state */
+#define TLS_MAX_HASH 64         /**< Maximum hash output length in bytes */
+#define TLS_MAX_KEY 32          /**< Maximum key length in bytes */
+
+// JS zvysena hodnota kvoli CA SPHINCS+-SHAKE-128f-simple v subore tls_cacerts - "maximum size for CA root signed certs in base64"
+#define TLS_X509_MAX_FIELD 30000           /**< Maximum X.509 field size */
+#define TLS_MAX_EXT_LABEL 256            /**< Max external psk label size */
+
+// Max Frag length must be less than TLS_MAX_IBUFF_SIZE
+#define TLS_MAX_FRAG 2                   /**< Max Fragment length desired - 1 for 512, 2 for 1024, 3 for 2048, 4 for 4096, 0 for 16384 */
+
+#if CRYPTO_SETTING==TYPICAL
+ #define TLS_MAX_IBUFF_SIZE (16384+256)  /**< Maximum Input/Output buffer size. We will want to reduce this as much as possible! But must be large enough to take full certificate chain */
+ #define TLS_MAX_PLAIN_FRAG 16384        /**< Max Plaintext Fragment size */
+ #define TLS_MAX_CIPHER_FRAG (16384+256) /**< Max Ciphertext Fragment size */
+
+ #define TLS_MAX_CERT_SIZE 2048       /**< I checked - current max for root CAs is 2016 */
+ #define TLS_MAX_CERT_B64 2800        /**< In base64 - current max for root CAs is 2688 */
+ #define TLS_MAX_HELLO 1024           /**< Max client hello size (less extensions) KEX public key is largest component */
+
+ #define TLS_MAX_SIG_PUB_KEY_SIZE 512        /**< Max signature public key size in bytes        4096-bit RSA */
+ #define TLS_MAX_SIG_SECRET_KEY_SIZE 1280    /**< Max signature private key size in bytes       4096-bit RSA */
+ #define TLS_MAX_SIGNATURE_SIZE 512          /**< Max digital signature size in bytes           4096-bit RSA */
+ #define TLS_MAX_KEX_PUB_KEY_SIZE 97         /**< Max key exchange public key size in bytes        384-bit ECC */
+ #define TLS_MAX_KEX_CIPHERTEXT_SIZE 97      /**< Max key exchange (KEM) ciphertext size        384-bit ECC */
+ #define TLS_MAX_KEX_SECRET_KEY_SIZE 48      /**< Max key exchange private key size in bytes    384-bit ECC */
+#endif
+
+
+/*
+JS
+15.04.2024
+
+KEX algorithms
+https://openquantumsafe.org/liboqs/algorithms/
++-----------------+----------+----------+-----------+---------+---------+---------+---------+---------+---------+------------------+--------------------+------------------+--------------------+-------------------+---------------------+
+|    Algorithm    | Kyber512 | Kyber768 | Kyber1024 | BIKE-L1 | BIKE-L3 | BIKE-L5 | HQC-128 | HQC-192 | HQC-256 | FrodoKEM-640-AES | FrodoKEM-640-SHAKE | FrodoKEM-976-AES | FrodoKEM-976-SHAKE | FrodoKEM-1344-AES | FrodoKEM-1344-SHAKE |
++-----------------+----------+----------+-----------+---------+---------+---------+---------+---------+---------+------------------+--------------------+------------------+--------------------+-------------------+---------------------+
+| Public key size |      800 |     1184 |      1568 |    1541 |    3083 |    5122 |    2249 |    4522 |    7245 |             9616 |               9616 |            15632 |              15632 |             21520 |               21520 |
++-----------------+----------+----------+-----------+---------+---------+---------+---------+---------+---------+------------------+--------------------+------------------+--------------------+-------------------+---------------------+
+| Secret key size |     1632 |     2400 |      3168 |    5223 |   10105 |   16494 |    2289 |    4562 |    7285 |            19888 |              19888 |            31296 |              31296 |             43088 |               43088 |
++-----------------+----------+----------+-----------+---------+---------+---------+---------+---------+---------+------------------+--------------------+------------------+--------------------+-------------------+---------------------+
+| Ciphertext size |      768 |     1088 |      1568 |    1573 |    3115 |    5154 |    4481 |    9026 |   14469 |             9720 |               9720 |            15744 |              15744 |             21632 |               21632 |
++-----------------+----------+----------+-----------+---------+---------+---------+---------+---------+---------+------------------+--------------------+------------------+--------------------+-------------------+---------------------+
+*BIKE nie je dostupny na Windowse
+ML-KEM - rovnaký ako KYBER
++-----------------+-----------+-----------+------------+
+|    Algorithm    | ML-KEM512 | ML-KEM768 | ML-KEM1024 |
++-----------------+-----------+-----------+------------+
+| Public key size |       800 |      1184 |       1568 |
++-----------------+-----------+-----------+------------+
+| Secret key size |      1632 |      2400 |       3168 |
++-----------------+-----------+-----------+------------+
+| Ciphertext size |       768 |      1088 |       1568 |
++-----------------+-----------+-----------+------------+
+
+
+
+Signature algorithms
+https://openquantumsafe.org/liboqs/algorithms/
++-----------------+------------+------------+------------+-----------+------------+---------------------------+---------------------------+----------------------------+
+|    Algorithm    | DILITHIUM2 | DILITHIUM3 | DILITHIUM5 | FALCON512 | FALCON1024 | SPHINCS+-SHA2-128f-simple | SPHINCS+-SHA2-128s-simple | SPHINCS+-SHAKE-128f-simple |
++-----------------+------------+------------+------------+-----------+------------+---------------------------+---------------------------+----------------------------+
+| Public key size |       1312 |       1952 |       2592 |       897 |       1793 |                        32 |                        32 |                         32 |
++-----------------+------------+------------+------------+-----------+------------+---------------------------+---------------------------+----------------------------+
+| Secret key size |       2528 |       4000 |       4864 |      1281 |       2305 |                        64 |                        64 |                         64 |
++-----------------+------------+------------+------------+-----------+------------+---------------------------+---------------------------+----------------------------+
+| Signature size  |       2420 |       3293 |       4595 |       666 |       1280 |                     17088 |                      7856 |                      17088 |
++-----------------+------------+------------+------------+-----------+------------+---------------------------+---------------------------+----------------------------+
+ML-DSA - rovnaký ako DILITHIUM
++-----------------+-----------+-----------+------------+
+|    Algorithm    |  ML-DSA44 |  ML-DSA65 |   ML-DSA87 |
++-----------------+-----------+-----------+------------+
+| Public key size |      1312 |      1952 |       2592 |
++-----------------+-----------+-----------+------------+
+| Secret key size |      2528 |      4000 |       4864 |
++-----------------+-----------+-----------+------------+
+| Ciphertext size |      2420 |      3293 |       4595 |
++-----------------+-----------+-----------+------------+
+
+*/
+
+#if CRYPTO_SETTING == POST_QUANTUM
+
+ // JS MAX_IBUFF_SIZE zmeneny na 52295 kvoli SPHINCS_SHAKE_128F_SIMPLE, najvacsi vygenerovany certchain
+ #define TLS_MAX_IBUFF_SIZE (52295)      /**< Maximum Input/Output buffer size. We will want to reduce this as much as possible! But must be large enough to take full certificate chain */
+ #define TLS_MAX_PLAIN_FRAG 16384            /**< Max Plaintext Fragment size */
+ #define TLS_MAX_CIPHER_FRAG (16384+256)     /**< Max Ciphertext Fragment size */
+
+ #define TLS_MAX_CERT_SIZE 6144      /**< I checked - current max for root CAs is 2016 - but would be much bigger for Dilithium!*/
+ #define TLS_MAX_CERT_B64 8192       /**< In base64 - current max for root CAs is 2688 */
+ #define TLS_MAX_HELLO 2048          /**< Max client hello size (less extensions) KEX public key is largest component */
+
+// JS zmenene na zaklade PQ algoritmov
+ #define TLS_MAX_SIG_PUB_KEY_SIZE 2592        /**< Max signature public key size in bytes */ // Najvacsi je DILITHIUM5
+ #define TLS_MAX_SIG_SECRET_KEY_SIZE 4864     /**< Max signature private key size in bytes */ // Najvacsi je DILITHIUM5
+ #define TLS_MAX_SIGNATURE_SIZE 17088          /**< Max signature size in bytes */   // Najvacsi je SPHINCS+-SHA2-128f-simple alebo SPHINCS+-SHAKE-128f-simple
+ 
+ // JS zmenene na zaklade PQ algoritmov
+ #define TLS_MAX_KEX_PUB_KEY_SIZE 21520        // Najvacsi je FrodoKEM-1344-SHAKE
+ #define TLS_MAX_KEX_CIPHERTEXT_SIZE 21632     // Najvacsi je FrodoKEM-1344-SHAKE
+ #define TLS_MAX_KEX_SECRET_KEY_SIZE 43088     // Najvacsi je FrodoKEM-1344-SHAKE
+#endif
+
+
+#if CRYPTO_SETTING == HYBRID
+
+ #define TLS_MAX_IBUFF_SIZE (16384+256)   /**< Maximum Input/Output buffer size. We will want to reduce this as much as possible! But must be large enough to take full certificate chain */
+ #define TLS_MAX_PLAIN_FRAG 16384         /**< Max Plaintext Fragment size */
+ #define TLS_MAX_CIPHER_FRAG (16384+256)  /**< Max Ciphertext Fragment size */
+
+ #define TLS_MAX_CERT_SIZE 6144      /**< I checked - current max for root CAs is 2016 - but would be much bigger for Dilithium!*/
+ #define TLS_MAX_CERT_B64 8192       /**< In base64 - current max for root CAs is 2688 */
+ #define TLS_MAX_HELLO 2048          /**< Max client hello size (less extensions) KEX public key is largest component */
+
+// These all blow up post quantum
+ #define TLS_MAX_SIG_PUB_KEY_SIZE 1312+65         /**< Max signature public key size in bytes     DILITHIUM2 + P256 */
+ #define TLS_MAX_SIG_SECRET_KEY_SIZE 2528+200     /**< Max signature private key size in bytes    DILITHIUM2 + P256 (maybe includes the public key?) */
+ #define TLS_MAX_SIGNATURE_SIZE 2420+100          /**< Max signature size in bytes                DILITHIUM2 + P256 (DER encoding for ECC sig) */
+ #define TLS_MAX_KEX_PUB_KEY_SIZE 1184+32         /**< Max key exchange public key size in bytes  KYBER768+X25519   */
+ #define TLS_MAX_KEX_CIPHERTEXT_SIZE 1088+32      /**< Max key exchange (KEM) ciphertext size     KYBER768+X25519   */
+ #define TLS_MAX_KEX_SECRET_KEY_SIZE 2400+32      /**< Max key exchange private key size in bytes KYBER768+X25519   */
+#endif
+
+#if CRYPTO_SETTING==TINY_ECC || CRYPTO_SETTING==EDDSA
+ #define TLS_MAX_IBUFF_SIZE (4096+256)   /**< Maximum Input/Output buffer size. We will want to reduce this as much as possible! But must be large enough to take full certificate chain */
+ #define TLS_MAX_PLAIN_FRAG 4096         /**< Max Plaintext Fragment size */
+ #define TLS_MAX_CIPHER_FRAG (4096+256)  /**< Max Ciphertext Fragment size */
+
+ #define TLS_MAX_CERT_SIZE 2048      /**< I checked - current max for root CAs is 2016 */
+ #define TLS_MAX_CERT_B64 2800       /**< In base64 - current max for root CAs is 2688 */
+ #define TLS_MAX_HELLO 1024          /**< Max client hello size (less extensions) KEX public key is largest component */
+
+ #define TLS_MAX_SIG_PUB_KEY_SIZE 133        /**< Max signature public key size in bytes        ECC */
+ #define TLS_MAX_SIG_SECRET_KEY_SIZE 66      /**< Max signature private key size in bytes       ECC */
+ #define TLS_MAX_SIGNATURE_SIZE 132          /**< Max signature size in bytes                   ECC */
+ #define TLS_MAX_KEX_PUB_KEY_SIZE 97         /**< Max key exchange public key size in bytes        ECC */
+ #define TLS_MAX_KEX_CIPHERTEXT_SIZE 97      /**< Max key exchange (KEM) ciphertext size        ECC */
+ #define TLS_MAX_KEX_SECRET_KEY_SIZE 48      /**< Max key exchange private key size in bytes    ECC */
+#endif
+
+// Certificate size limits
+#define TLS_MAX_SERVER_CHAIN_LEN 2             /**< Maximum Server Certificate chain length - omitting root CA */
+#define TLS_MAX_SERVER_CHAIN_SIZE (TLS_MAX_SERVER_CHAIN_LEN*TLS_MAX_CERT_SIZE) /**< Maximum Server Certificate chain length in bytes */
+#define TLS_MAX_CLIENT_CHAIN_LEN 1             /**< Maximum Client Certificate chain length - one self signed here */
+#define TLS_MAX_CLIENT_CHAIN_SIZE (TLS_MAX_CLIENT_CHAIN_LEN*TLS_MAX_CERT_SIZE) /**< Maximum Client Certificate chain length in bytes */
+
+#define TLS_MAX_SHARED_SECRET_SIZE 256    /**< Max key exchange Shared secret size */
+
+// Both of these are bumped up by PQ IBE and Hybrid
+#define TLS_MAX_TICKET_SIZE 4196        /**< maximum resumption ticket size - beware some servers send much bigger tickets! */
+#define TLS_MAX_EXTENSIONS 61440         /**< Max extensions size */ // add 0 at the end, after hqc256 unable to perform
+
+#define TLS_MAX_ECC_FIELD 66            /**< Max ECC field size in bytes */
+#define TLS_MAX_IV_SIZE 12              /**< Max IV size in bytes */
+#define TLS_MAX_TAG_SIZE 16             /**< Max HMAC tag length in bytes */    
+#define TLS_MAX_COOKIE 128              /**< Max Cookie size */    
+
+#define TLS_MAX_OUTPUT_RECORD_SIZE 1024 /**< Max output record size */
+#define TLS_MAX_OBUFF_SIZE (TLS_MAX_OUTPUT_RECORD_SIZE+TLS_MAX_TAG_SIZE+6) /**< Max output buffer size */
+
+#define TLS_MAX_SERVER_NAME 128         /**< Max server name size in bytes */
+
+// JS zvyseny maximalny pocet podporovanych KEX/KEM a DSA
+#define TLS_MAX_SUPPORTED_GROUPS 18     /**< Max number of supported crypto groups */
+#define TLS_MAX_SUPPORTED_SIGS 17       /**< Max number of supported signature schemes */    
+
+#define TLS_MAX_PSK_MODES 2             /**< Max preshared key modes */
+#define TLS_MAX_CIPHER_SUITES 5         /**< Max number of supported cipher suites */
+
+// Cipher Suites 
+#define TLS_AES_128_GCM_SHA256 0x1301   /**< AES128/SHA256/GCM cipher suite - this is only one which MUST be implemented */
+#define TLS_AES_256_GCM_SHA384 0x1302   /**< AES256/SHA384/GCM cipher suite */
+#define TLS_CHACHA20_POLY1305_SHA256 0x1303 /**< CHACHA20/SHA256/POLY1305 cipher suite */
+#define TLS_AES_128_CCM_SHA256 0x1304   /**< AES/SHA256/CCM cipher suite - optional */
+#define TLS_AES_128_CCM_8_SHA256 0x1305 /**< AES/SHA256/CCM 8 cipher suite - optional */
+
+// Key exchange groups 
+#define X25519 0x001d                   /**< X25519 elliptic curve key exchange */
+#define SECP256R1 0x0017                /**< NIST SECP256R1 elliptic curve key exchange */
+#define SECP384R1 0x0018                /**< NIST SECP384R1 elliptic curve key exchange */
+#define SECP521R1 0x0019                /**< NIST SECP521R1 elliptic curve key exchange */
+#define X448 0x001e                     /**< X448 elliptic curve key exchange */
+
+// JS pridane ID pre PQ algoritmy
+// Ide o experimentalne ID, zalozene na zaklade oqsprovidera 0.5.3 https://github.com/open-quantum-safe/oqs-provider/blob/main/ALGORITHMS.md#oids (29.02.2024)
+// Ine aplikacie mozu pouzivat rozdielne ID - napr. HQC protokol funguje pri pouziti openssl s_server ale nie je kompatibilny s test serverom https://test.openquantumsafe.org/
+// V pripade standardizacie moze prist k zmene ID 
+#define KYBER512 0x023A
+#define KYBER768 0x023C                 /**< Kyber PQ key exchange - NOTE I just made this up! Not generally recognised! */ // POZNAMKA - liboqs 0x023C (povodne 0x4242)
+#define KYBER1024 0x023D
+#define MLKEM512 0x0247
+#define MLKEM768 0x0248                 
+#define MLKEM1024 0x0249
+#define BIKEL1 0x0241
+#define BIKEL3	0x0242
+#define BIKEL5 0x0243
+#define HQC128 0x0244
+#define HQC192 0x0245
+#define HQC256 0x0246
+#define FRODO640AES 0x0200
+#define FRODO640SHAKE 0x0201
+#define FRODO976AES 0x0202
+#define FRODO976SHAKE 0x0203
+#define FRODO1344AES 0x0204
+#define FRODO1344SHAKE 0x0205
+#define HYBRID_KX 0x421d                /**< Hybrid key exchange, Kyber+X25519 */
+
+// Signature algorithms for TLS1.3 and Certs that we can handle 
+#define ECDSA_SECP256R1_SHA256 0x0403   /**< Supported ECDSA Signature algorithm */ 
+#define ECDSA_SECP256R1_SHA384 0x0413   /**< Non-standard ECDSA Signature algorithm */ 
+#define ECDSA_SECP384R1_SHA384 0x0503   /**< Supported ECDSA Signature algorithm */
+#define RSA_PSS_RSAE_SHA256 0x0804      /**< Supported RSA Signature algorithm */ 
+#define RSA_PSS_RSAE_SHA384 0x0805      /**< Supported RSA Signature algorithm */
+#define RSA_PSS_RSAE_SHA512 0x0806      /**< Supported RSA Signature algorithm */
+#define RSA_PKCS1_SHA256 0x0401         /**< Supported RSA Signature algorithm */
+#define RSA_PKCS1_SHA384 0x0501         /**< Supported RSA Signature algorithm */
+#define RSA_PKCS1_SHA512 0x0601         /**< Supported RSA Signature algorithm */
+#define ED25519 0x0807                  /**< Ed25519 EdDSA Signature algorithm */
+#define ED448 0x0808                    /**< Ed448 EdDSA Signature algorithm */
+
+// JS pridane ID pre PQ algoritmy
+// Ide o experimentalne ID, zalozene na zaklade oqsprovidera 0.6.0 https://github.com/open-quantum-safe/oqs-provider/blob/0.6.0/ALGORITHMS.md (15.04.2024)
+// Ine aplikacie mozu pouzivat rozdielne ID 
+// V pripade standardizacie moze prist k zmene ID 
+#define DILITHIUM2 0xfea0               
+#define DILITHIUM3 0xfea3              
+#define DILITHIUM5 0xfea5
+
+#define MLDSA44 0xfed0
+#define MLDSA65 0xfed1
+#define MLDSA87 0xfed2
+
+#define FALCON512 0xfed7
+#define FALCON1024 0xfeda
+#define SPHINCSSHA2128FSIMPLE 0xfeb3
+#define SPHINCSSHA2128SSIMPLE 0xfeb6
+#define SPHINCSSHAKE128FSIMPLE 0xfec2
+#define SPHINCSSHA2192FSIMPLE 0xfeb9
+
+#define DILITHIUM2_P256 0x09F2          /**< Dilithium2+SECP256R1 Signature algorithms - this type can be negotiated, but always implemented seperately by SAL */
+
+// pre-shared Key (PSK) modes 
+#define PSKOK 0x00                      /**< Preshared Key only mode */
+#define PSKWECDHE 0x01                  /**< Preshared Key with Diffie-Hellman key exchange mode */
+
+// ticket origin
+#define TLS_FULL_HANDSHAKE  1           /**< Came from Full Handshake */
+#define TLS_EXTERNAL_PSK  2             /**< External Pre-Shared Key */
+
+// TLS versions 
+#define TLS1_0 0x0301                   /**< TLS 1.0 version */
+#define TLS1_2 0x0303                   /**< TLS 1.2 version */
+#define TLS1_3 0x0304                   /**< TLS 1.3 version */
+
+#define TLS13_UPDATE_NOT_REQUESTED 0    /**< Updating my keys */
+#define TLS13_UPDATE_REQUESTED 1        /**< Updating my keys and telling you to update yours */
+
+// Extensions 
+#define SERVER_NAME 0x0000              /**< Server Name extension */
+#define SUPPORTED_GROUPS 0x000a         /**< Supported Group extension */
+#define SIG_ALGS 0x000d                 /**< Signature algorithms extension */
+#define POST_HANDSHAKE_AUTH 0x0031      /**< Post Handshake Authentication */
+#define SIG_ALGS_CERT 0x0032            /**< Signature algorithms Certificate extension */
+#define KEY_SHARE 0x0033                /**< Key Share extension */
+#define PSK_MODE 0x002d                 /**< Preshared key mode extension */
+#define PRESHARED_KEY 0x0029            /**< Preshared key extension */
+#define TLS_VER 0x002b                  /**< TLS version extension */
+#define COOKIE 0x002c                   /**< Cookie extension */
+#define EARLY_DATA 0x002a               /**< Early Data extension */
+#define MAX_FRAG_LENGTH 0x0001          /**< max fragmentation length extension */
+#define PADDING 0x0015                  /**< Padding extension */
+#define APP_PROTOCOL 0x0010             /**< Application Layer Protocol Negotiation (ALPN) */
+#define RECORD_SIZE_LIMIT 0x001c        /**< Record Size Limit */
+#define CLIENT_CERT_TYPE 0x0013         /**< Client Certificate type */
+#define SERVER_CERT_TYPE 0x0014         /**< Server Certificate type */
+#define HEARTBEAT 0x000f                /**< Heartbeat */
+#define CERT_AUTHORITIES 0x002f         /**< Certificate Authorities */
+
+// record types 
+#define HSHAKE 0x16                     /**< Handshake record */
+#define APPLICATION 0x17                /**< Application record */
+#define ALERT 0x15                      /**< Alert record */
+#define CHANGE_CIPHER 0x14              /**< Change Cipher record */
+#define HEART_BEAT 0x18                 /**< Heart Beat Record */
+// pseudo record types
+#define TIMED_OUT 0x01                  /**< Time-out  */
+
+// message types 
+#define CLIENT_HELLO 0x01               /**< Client Hello message */ 
+#define SERVER_HELLO 0x02               /**< Server Hello message */ 
+#define CERTIFICATE 0x0b                /**< Certificate message */ 
+#define CERT_REQUEST 0x0d               /**< Certificate Request */
+#define CERT_VERIFY 0x0f                /**< Certificate Verify message */ 
+#define FINISHED 0x14                   /**< Handshake Finished message */
+#define ENCRYPTED_EXTENSIONS 0x08       /**< Encrypted Extensions message */ 
+#define TICKET 0x04                     /**< Ticket message */ 
+#define KEY_UPDATE 0x18                 /**< Key Update message */
+#define MESSAGE_HASH 0xFE               /**< Special synthetic message hash message */    
+#define END_OF_EARLY_DATA 0x05          /**< End of Early Data message */   
+// pseudo message types
+#define HANDSHAKE_RETRY 0x102           /**< Handshake retry */
+
+// Causes of server error - which should generate a client alert 
+#define NOT_TLS1_3 -2                   /**< Wrong version error, not TLS1.3 */
+#define BAD_CERT_CHAIN -3               /**< Bad Certificate Chain error */
+#define ID_MISMATCH -4                  /**< Session ID mismatch error */
+#define UNRECOGNIZED_EXT -5             /**< Unrecognised extension error */
+#define BAD_HELLO -6                    /**< badly formed Hello message error */
+#define WRONG_MESSAGE -7                /**< Message out-of-order error */
+#define MISSING_REQUEST_CONTEXT -8      /**< Request context missing error */
+#define AUTHENTICATION_FAILURE -9       /**< Authentication error - AEAD Tag incorrect */
+#define BAD_RECORD -10                  /**< Badly formed Record received */
+#define BAD_TICKET -11                  /**< Badly formed Ticket received */
+#define NOT_EXPECTED -12                /**< Received ack for something not requested */
+#define CA_NOT_FOUND -13                /**< Certificate Authority not found */
+#define CERT_OUTOFDATE -14              /**< Certificate Expired */
+#define MEM_OVERFLOW -15                /**< Memory Overflow */
+#define FORBIDDEN_EXTENSION -16         /**< Forbidden Encrypted Extension */
+#define MAX_EXCEEDED -17                /**< Maximum record size exceeded */
+#define EMPTY_CERT_CHAIN -18            /**< Empty Certificate Message */
+#define SELF_SIGNED_CERT -20            /**< Self signed certificate */
+#define TIME_OUT -21                    /**< Time out */
+#define ERROR_ALERT_RECEIVED -22        /**< Alert has been received */
+#define BAD_MESSAGE -23                 /**< Badly formed message */
+#define CERT_VERIFY_FAIL -24            /**< Certificate Verification failure */
+#define BAD_HANDSHAKE -26               /**< Could not agree */
+#define BAD_REQUEST_UPDATE -27          /**< Bad Request Update value */
+#define CLOSURE_ALERT_RECEIVED -28      /**< Alert has been received */
+#define MISSING_EXTENSIONS -30          /**< Some mandatory extensions are missing */
+// client alerts 
+#define ILLEGAL_PARAMETER 0x2F          /**< Illegal parameter alert */
+#define UNEXPECTED_MESSAGE 0x0A         /**< Unexpected message alert */
+#define DECRYPT_ERROR 0x33              /**< Decryption error alert */
+#define BAD_CERTIFICATE 0x2A            /**< Bad certificate alert */
+#define UNSUPPORTED_EXTENSION 0x6E      /**< Unsupported extension alert */
+#define UNKNOWN_CA 0x30                 /**< Unrecognised Certificate Authority */
+#define CERTIFICATE_EXPIRED 0x2D        /**< Certificate Expired */
+#define PROTOCOL_VERSION 0x46           /**< Wrong TLS version */
+#define DECODE_ERROR 0x32               /**< Decode error alert */
+#define RECORD_OVERFLOW 0x16            /**< Record Overflow */
+#define BAD_RECORD_MAC 0x14             /**< Bad Record Mac */
+#define HANDSHAKE_FAILURE 0x28          /**< Could not agree */
+#define CLOSE_NOTIFY 0x00               /**< Orderly shut down of connection */
+#define MISSING_EXTENSION 0x6D;         /**< Missing extension */
+
+#define LOG_OUTPUT_TRUNCATION 256       /**< Output Hex digits before truncation */
+
+#define TLS13_DISCONNECTED 0            /**< TLS1.3 Connection is broken */
+#define TLS13_CONNECTED 1               /**< TLS1.3 Connection is made */ 
+#define TLS13_HANDSHAKING 2             /**< TLS1.3 is handshaking */
+
+// protocol returns..
+#define TLS_FAILURE 0                   /**< Failed to cmake TLS1.3 connection */
+#define TLS_SUCCESS 1                   /**< Succeeded in making TLS1.3 connection */ 
+#define TLS_RESUMPTION_REQUIRED 2       /**< Connection succeeded, but handshake retry was needed */
+#define TLS_EARLY_DATA_ACCEPTED 3       /**< Connection succeeded, and early data was accepted */
+
+// PSK modes
+#define PSK_NOT 0           /**< No PSK */
+#define PSK_KEY 1           /**< Using PSK from database */
+#define PSK_IBE 2           /**< Using IBE based PSK */
+
+// Certificate types
+#define X509_CERT 0         /**< X509 Certificate-based authentication */
+#define RAW_PUBLIC_KEY 2    /**< Raw Public Key based authentication */
+
+/**
+ * @brief function return structure */
+typedef struct 
+{
+    unsign32 val;    /**< return value */
+    int err;         /**< error return */   
+} ret;
+
+/**
+ * @brief server encrypted extensions expectations/responses */
+typedef struct 
+{
+    bool early_data;    /**< true if early data accepted */
+    bool alpn;          /**< true if ALPN accepted */
+    bool server_name;   /**< true if server name accepted */
+    bool max_frag_length;   /**< true if max frag length respected */
+} ee_status;
+
+/**
+ * @brief crypto context structure */
+typedef struct
+{
+    bool active;            /**< Indicates if encryption has been activated */
+    char k[TLS_MAX_KEY];    /**< AEAD cryptographic Key bytes */
+    char iv[12];            /**< AEAD cryptographic IV bytes */
+    octad K;                /**< Key as octad */
+    octad IV;               /**< IV as octad */
+    unsign32 record;        /**< current record number - to be incremented */
+    int suite;              /**< Cipher Suite */
+    int taglen;             /**< Tag Length */
+} crypto;
+
+/**
+ * @brief ticket context structure */
+typedef struct 
+{
+    bool valid;                         /**< Is ticket valid? */
+    char tick[TLS_MAX_TICKET_SIZE];     /**< Ticket bytes */
+    char nonce[256];                    /**< nonce */
+    char psk[TLS_MAX_HASH];             /**< pre-shared key */
+    octad TICK;                         /**< Ticket or external PSK label as octad */
+    octad NONCE;                        /**< Nonce as octad */
+    octad PSK;                          /**< PSK as octad */
+    unsign32 age_obfuscator;            /**< ticket age obfuscator - 0 for external PSK */
+    unsign32 max_early_data;            /**< Maximum early data allowed for this ticket */
+    unsign32 birth;                     /**< Birth time of this ticket */ 
+    int lifetime;                       /**< ticket lifetime */        
+    int cipher_suite;                   /**< Cipher suite used */
+    int favourite_group;                /**< the server's favourite group */
+    int origin;                         /**< Origin of initial handshake - Full or PSK? */
+} ticket;
+
+/**
+ * @brief Universal Hash Function */
+typedef struct 
+{
+    char state[TLS_MAX_HASH_STATE];   /**< hash function state */
+    int htype;                        /**< The hash type (typically SHA256) */
+} unihash;
+
+/**
+ * @brief TLS1.3 session state */
+typedef struct 
+{
+    int status;             /**< Connection status */
+    int max_record;         /**< max record size I should send */
+    Socket *sockptr;        /**< Pointer to socket */
+    char id[32];            /**< Session ID */
+    char hostname[TLS_MAX_SERVER_NAME];     /**< Server name for connection */
+    int cipher_suite;       /**< agreed cipher suite */
+    int favourite_group;    /**< favourite key exchange group - may be changed on handshake retry */
+    int server_cert_type;   /**< server certificate type */
+    int client_cert_type;   /**< client certificate type */
+    crypto K_send;          /**< Sending Key */
+    crypto K_recv;          /**< Receiving Key */
+    octad HS;               /**< Handshake secret */
+    char hs[TLS_MAX_HASH];  /**< Handshake secret data */
+    octad RMS;              /**< Resumption Master Secret */
+    char rms[TLS_MAX_HASH]; /**< Resumption Master Secret data */
+    octad STS;              /**< Server Traffic secret */
+    char sts[TLS_MAX_HASH]; /**< Server Traffic secret data */
+    octad CTS;              /**< Client Traffic secret */
+    char cts[TLS_MAX_HASH]; /**< Client Traffic secret data */
+    octad CTX;              /**< Certificate Request Context */
+    char ctx[TLS_MAX_HASH]; /**< Certificate Request Context data */
+    octad IBUFF;            /**< Main input buffer for this connection */
+    octad OBUFF;            /**< output buffer for this connection */
+#ifndef SHALLOW_STACK
+    char ibuff[TLS_MAX_IBUFF_SIZE]; /**< Byte array for main input buffer for this connection */
+    char obuff[TLS_MAX_OBUFF_SIZE]; /**< output buffer for this connection */
+#endif
+    int ptr;                /**< pointer into IBUFF buffer */
+    unihash tlshash;        /**< Transcript hash recorder */
+    ticket T;               /**< resumption ticket */
+    bool expect_heartbeats;       /**< Expect to receive heartbeats */
+    bool allowed_to_heartbeat;    /**< Am I allowed to heartbeat? */
+    bool heartbeat_req_in_flight; /**< timestamp on outstanding request, otherwise 0 */
+} TLS_session;
+
+// IBUFF buffer
+// xxxxxxxxxxxxxxxxxxxxxxxxxxxyyyyyyyyyyyyyyyyyyyyyyyyyyy
+// -------------ptr---------->----------IBUFF.len------->
+//
+// when ptr becomes equal to IBUFF.len, pull in another record (and maybe decrypt it)
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/include/tls_bfibe.h b/TIIGER_TLS/PQ_TIIGER_TLS/include/tls_bfibe.h
new file mode 100644
index 0000000..0522f6b
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/include/tls_bfibe.h
@@ -0,0 +1,50 @@
+/**
+ * @file tls_bfibe.h
+ * @author Mike Scott
+ * @brief Boneh and Franklin IBE
+ *
+ */
+//
+// Pairing-based B&F IBE 128-bit API Functions
+// Uses MIRACL
+//
+#ifndef BFIBE_BLS381_H
+#define BFIBE_BLS381_H
+
+#include "pair_BLS12381.h"
+
+using namespace core;
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#if CHUNK == 32
+#define PGS_BLS12381 MODBYTES_B384_29  /**< BF Group Size */
+#define PFS_BLS12381 MODBYTES_B384_29  /**< BF Field Size */
+#else
+#define PGS_BLS12381 MODBYTES_B384_58  /**< BF Group Size */
+#define PFS_BLS12381 MODBYTES_B384_58  /**< BF Field Size */
+#endif
+
+/* IBE primitives */
+
+/** @brief Create key SSK encapsulated in ciphertext CT to be sent to ID
+ *
+    @param ID the entity to receive encapsulated key
+    @param R32 32 random bytes
+    @param SSK is the encapsulated key
+    @param CT is the ciphertext
+    @return true if OK
+ */
+bool BFIBE_CCA_ENCRYPT(char *ID,octet *R32,octet *SSK,octet *CT);
+
+/** @brief Create key SSK encapsulated in ciphertext CT to be sent to ID
+ *
+    @param SK the secret key of ID
+    @param CT is the ciphertext
+    @param SSK is the decapsulated key
+    @return true if OK
+ */
+bool BFIBE_CCA_DECRYPT(octet *SK,octet *CT,octet *SSK);
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/include/tls_cert_chain.h b/TIIGER_TLS/PQ_TIIGER_TLS/include/tls_cert_chain.h
new file mode 100644
index 0000000..80f1432
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/include/tls_cert_chain.h
@@ -0,0 +1,41 @@
+/**
+ * @file tls_cert_chain.h
+ * @author Mike Scott
+ * @brief Process Certificate Chain
+ *
+ */
+
+// TLS1.3 Server Certificate Chain Code
+
+#ifndef TLS_CERT_CHAIN_H
+#define TLS_CERT_CHAIN_H
+#include "tls1_3.h" 
+#include "tls_x509.h"
+#include "tls_sal.h"
+#include "tls_client_recv.h"
+#include "tls_logger.h"
+#include "tls_certs.h"
+
+using namespace std;
+
+/** @brief Check Certificate Chain for hostname, and extract public key
+ *
+    @param CERTCHAIN the input certificate chain
+    @param hostname the input Server name associated with the Certificate chain
+    @param cert_type the certificate type (a certificate or a raw key)
+    @param PUBKEY the Server's public key extracted from the Certificate chain 
+    @param SIG signature (supplied as workspace)
+    @return 0 if certificate chain is OK, else returns negative failure reason
+ */
+extern int checkServerCertChain(octad *CERTCHAIN,char *hostname,int cert_type,octad *PUBKEY,octad *SIG);  
+
+/** @brief Get Client private key and Certificate chain from .pem files
+ *
+    @param PRIVKEY the Client's private  key
+    @param cert_type the certificate type (a certificate or a raw key)
+    @param CERTCHAIN the Client's certificate chain
+    @return type of private key, ECC or RSA
+ */
+extern int getClientPrivateKeyandCertChain(octad *PRIVKEY,int cert_type,octad *CERTCHAIN);
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/include/tls_certs.h b/TIIGER_TLS/PQ_TIIGER_TLS/include/tls_certs.h
new file mode 100644
index 0000000..d7292ae
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/include/tls_certs.h
@@ -0,0 +1,25 @@
+/**
+ * @file tls_certs.h
+ * @author Mike Scott
+ * @brief Certificate Authority root certificate store
+ *
+ */
+
+#ifndef TLS_CA_CERTS_H
+#define TLS_CA_CERTS_H
+
+#include "tls1_3.h"
+
+//extern const char *mysupportedca;  /**< Supported root CA */
+extern const char *myprivate; /**< Client private key */
+extern const char *mycert;    /**< Client certificate */
+extern const char *cacerts;   /**< The Root Certificate store */
+
+/** @brief Get Client Certificate chain requirements
+ *
+    @param sigReqs list of signature requirements
+    @return number of such requirements
+ */
+extern int getSigRequirements(int *sigReqs);
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/include/tls_client_recv.h b/TIIGER_TLS/PQ_TIIGER_TLS/include/tls_client_recv.h
new file mode 100644
index 0000000..875bbc8
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/include/tls_client_recv.h
@@ -0,0 +1,171 @@
+/**
+ * @file tls_client_recv.h
+ * @author Mike Scott
+ * @brief Process Input received from the Server
+ *
+ */
+// Process input received from Server
+
+#ifndef TLS_CLIENT_RECV_H
+#define TLS_CLIENT_RECV_H
+
+#include "tls_sal.h"
+#include "tls1_3.h"
+#include "tls_sockets.h"
+#include "tls_keys_calc.h"
+#include "tls_client_send.h"
+
+/** @brief Parse out an octad from a pointer into an octad 
+ *
+    @param E the output octad copied out from the octad M
+    @param len the expected length of the output octad E
+    @param M the input octad
+    @param ptr a pointer into M, which advances after use
+    @return the actual length of E extracted, and an error flag
+ */
+extern ret parseoctad(octad *E,int len,octad *M,int &ptr);
+
+/** @brief Parse out byte array from a pointer into an octad 
+ *
+    @param e the output byte array copied out from the octad M
+    @param len the expected length of e
+    @param M the input octad
+    @param ptr a pointer into M, which advances after use
+    @return the actual length of e extracted, and an error flag
+ */
+extern ret parsebytes(char *e,int len,octad *M,int &ptr);
+
+/** @brief Parse out an unsigned integer from a pointer into an octad 
+ *
+    @param M the input octad
+    @param len the number of bytes in integer
+    @param ptr a pointer into M, which advances after use
+    @return the integer value, and an error flag
+ */
+extern ret parseInt(octad *M,int len,int &ptr);
+
+/** @brief Return a pointer to an octad from a pointer into an octad 
+ *
+    @param E a pointer to an octad contained within an octad M
+    @param len the expected length of the octad E
+    @param M the input octad
+    @param ptr a pointer into M, which advances after use
+    @return the actual length of E, and an error flag
+ */
+extern ret parseoctadptr(octad *E,int len,octad *M,int &ptr);
+
+/** @brief Read a record from the Server, a fragment of a full protocol message
+ *
+    @param session the TLS session structure
+    @return a positive indication of the record type, or a negative error return
+ */
+extern int getServerRecord(TLS_session *session);
+
+/** @brief Parse out an unsigned integer from a pointer into an octad, if necessary pulling in a new fragment
+ *
+    @param session the TLS session structure
+    @param len the number of bytes in integer
+    @return the unsigned integer, and an error flag
+ */
+extern ret parseIntorPull(TLS_session *session,int len);
+
+/** @brief Parse out an octad from a pointer into an octad, if necessary pulling in a new fragment
+ *
+    @param session the TLS session structure
+    @param O the output octad
+    @param len the expected length of the output octad O
+    @return the actual length of O extracted, and an error flag
+ */
+extern ret parseoctadorPull(TLS_session *session,octad *O,int len);
+
+
+/** @brief Parse out a byte array from a pointer into an octad, if necessary pulling in a new fragment
+ *
+    @param session the TLS session structure
+    @param o the output bytes
+    @param len the expected length of the output
+    @return the actual length of o extracted, and an error flag
+ */
+extern ret parsebytesorPull(TLS_session *session,char *o,int len);
+
+/** @brief Return a pointer to an octad from a pointer into an octad, if necessary pulling in a new fragment
+ *
+    @param session the TLS session structure
+    @param O a pointer to an octad contained within an octad IO
+    @param len the expected length of the octad O
+    @return the actual length of O extracted, and an error flag
+ */
+extern ret parseoctadorPullptrX(TLS_session *session,octad *O,int len);
+
+/** @brief Process response from server input
+ *
+    @param session the TLS1.3 session structure
+    @param r return value to be processed
+    @return true, if its a bad response requiring an abort
+ */
+extern bool badResponse(TLS_session *session,ret r);
+
+/** @brief Identify type of incoming message
+ *
+    @param session the TLS session structure
+    @return negative error, zero for OK, or positive for message type
+ */
+extern ret seeWhatsNext(TLS_session *session);
+
+/** @brief Receive and parse Server Encrypted Extensions
+ *
+    @param session the TLS session structure
+    @param enc_ext_expt ext structure containing server expectations
+    @param enc_ext_resp ext structure containing server responses
+    @return response structure
+ */
+extern ret getServerEncryptedExtensions(TLS_session *session,ee_status *enc_ext_expt,ee_status *enc_ext_resp);
+
+/** @brief Get Server proof that he owns the Certificate, by receiving and verifying its signature on transcript hash
+ *
+    @param session the TLS session structure
+    @param SCVSIG the received signature on the transcript hash
+    @param sigalg the type of the received signature
+    @return response structure
+ */
+extern ret getServerCertVerify(TLS_session *session,octad *SCVSIG,int &sigalg);
+
+/** @brief Get final handshake message from Server, a HMAC on the transcript hash
+ *
+    @param session the TLS session structure
+    @param HFIN an octad containing HMAC on transcript as calculated by Server
+    @return response structure
+ */
+extern ret getServerFinished(TLS_session *session,octad *HFIN);
+
+/** @brief Receive and parse initial Server Hello
+ *
+    @param session the TLS session structure
+    @param kex key exchange data
+    @param CK an output Cookie
+    @param PK the key exchange public value supplied by the Server
+    @param pskid indicates if a pre-shared key was accepted, otherwise -1
+    @return response structure
+ */
+extern ret getServerHello(TLS_session *session,/*int &cipher,*/int &kex,octad *CK,octad *PK,int &pskid);
+
+/** @brief Receive and check certificate chain
+ *
+    @param session the TLS session structure
+    @param PUBKEY the public key extracted from the Server certificate 
+    @param SIG signature (supplied as workspace)
+    @return response structure
+ */
+extern ret getCheckServerCertificateChain(TLS_session *session,octad *PUBKEY,octad *SIG);
+
+/** @brief process a Certificate Request
+ *
+    @param session the TLS session structure
+    @param context true if expecting a context
+    @return response structure
+ */
+extern ret getCertificateRequest(TLS_session *session,bool context);
+
+
+
+#endif
\ No newline at end of file
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/include/tls_client_send.h b/TIIGER_TLS/PQ_TIIGER_TLS/include/tls_client_send.h
new file mode 100644
index 0000000..07d26cc
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/include/tls_client_send.h
@@ -0,0 +1,283 @@
+/**
+ * @file tls_client_send.h
+ * @author Mike Scott
+ * @brief Process Output to be sent to the Server
+ *
+ */
+
+// Process output sent to Server
+#ifndef TLS_CLIENT_SEND_H
+#define TLS_CLIENT_SEND_H
+
+#include "tls_sal.h"
+#include "tls1_3.h"
+#include "tls_sockets.h"
+#include "tls_keys_calc.h"
+
+/** @brief Send Change Cipher Suite message 
+ *
+    @param session the TLS session structure
+ */
+extern void sendCCCS(TLS_session *session);
+
+
+/** @brief Add Heartbeat extension 
+ *
+    @param EXT the extensions octad which is being built
+*/
+extern void addHeartbeat(octad *EXT);
+
+/** @brief Add Certificate Authorities extension 
+ *
+    @param EXT the extensions octad which is being built
+*/
+extern void addCertAuthorities(octad *EXT);
+
+
+/** @brief Add PreShared Key extension to under-construction Extensions Octet (omitting binder)
+ *
+    @param EXT the extensions octad which is being built
+    @param age the obfuscated age of the preshared key
+    @param IDS the proposed preshared key identity
+    @param sha the hash algorithm used to calculate the HMAC binder
+    @return length of binder to be sent later
+ */
+extern int addPreSharedKeyExt(octad *EXT,unsign32 age,octad *IDS,int sha);
+
+/** @brief Add Server name extension to under-construction Extensions Octet
+ *
+    @param EXT the extensions octad which is being built
+    @param servername the Host name (URL) of the Server
+ */          
+extern void addServerNameExt(octad *EXT,char *servername);
+
+/** @brief Add Supported Groups extension to under-construction Extensions Octet
+ *
+    @param EXT the extensions octad which is being built
+    @param nsg Number of supported groups
+    @param supportedGroups an array of supported groups
+ */    
+extern void addSupportedGroupsExt(octad *EXT,int nsg,int *supportedGroups);
+
+/** @brief indicate acceptance of raw server public key
+ *
+    @param EXT the extensions octad which is being built
+ */ 
+extern void addServerRawPublicKey(octad *EXT);
+/** @brief indicate acceptance of raw client public key
+ *
+    @param EXT the extensions octad which is being built
+ */ 
+extern void addClientRawPublicKey(octad *EXT);
+
+
+/** @brief Add Supported TLS1.3 Signature algorithms to under-construction Extensions Octet
+ *
+    @param EXT the extensions octad which is being built
+    @param nsa Number of supported signature algorithms
+    @param sigAlgs an array of supported signature algorithms
+ */    
+extern void addSigAlgsExt(octad *EXT,int nsa,int *sigAlgs);
+
+/** @brief Add Supported X.509 Certificate Signature algorithms to under-construction Extensions Octet
+ *
+    @param EXT the extensions octad which is being built
+    @param nsac Number of supported signature algorithms
+    @param sigAlgsCert an array of supported signature algorithms
+ */    
+extern void addSigAlgsCertExt(octad *EXT,int nsac,int *sigAlgsCert);
+
+
+/** @brief Add Key Share extension to under-construction Extensions Octet
+ *
+    @param EXT the extensions octad which is being built
+    @param alg the suggested key exchange algorithm
+    @param PK the key exchange public value to be sent to the Server
+ */  
+extern void addKeyShareExt(octad *EXT,int alg,octad *PK);
+
+
+/** @brief Add Application Layer Protocol Negotiation (ALPN) extension to under-construction Extensions Octet
+ *
+    @param EXT the extensions octad which is being built
+    @param AP the IANA sequence associated with the expected protocol
+ */ 
+extern void addALPNExt(octad *EXT,octad *AP);
+
+
+/** @brief Add Maximum Fragment Length extension to under-construction Extensions Octet
+ *
+    @param EXT the extensions octad which is being built
+    @param mode the proposed maximum fragment size
+ */  
+extern void addMFLExt(octad *EXT,int mode);
+
+/** @brief Add Record Size Limit extension to under-construction Extensions Octet
+ *
+    @param EXT the extensions octad which is being built
+    @param size the demanded maximum fragment size
+ */  
+extern void addRSLExt(octad *EXT,int size);
+
+/** @brief Add Preshared Key exchange modes extension to under-construction Extensions Octet
+ *
+    @param EXT the extensions octad which is being built
+    @param mode the proposed preshared key mode 
+ */  
+extern void addPSKModesExt(octad *EXT,int mode);
+
+/** @brief Add Version extension to under-construction Extensions Octet
+ *
+    @param EXT the extensions octad which is being built
+    @param version the supported TLS version 
+ */ 
+extern void addVersionExt(octad *EXT,int version);
+
+/** @brief Add padding extension to under-construction Extensions Octet
+ *
+    @param EXT the extensions octad which is being built
+    @param n the zero padding length
+ */
+extern void addPadding(octad *EXT,int n);
+
+/** @brief Add Cookie extension to under-construction Extensions Octet
+ *
+    @param EXT the extensions octad which is being built
+    @param CK the cookie octad to be added
+ */
+extern void addCookieExt(octad *EXT,octad *CK);
+
+/** @brief Indicate desire to send Early Data in under-construction Extensions Octet
+ *
+    @param EXT the extensions octad which is being built
+ */
+extern void addEarlyDataExt(octad *EXT);
+
+/** @brief indicate willingness to do post handshake authentication
+ *
+    @param EXT the extensions octad which is being built
+ */
+extern void addPostHSAuth(octad *EXT);
+
+/** @brief Generate 32-byte random octad
+ *
+    @param RN the output 32-byte octad 
+    @return length of output octad
+ */
+extern int clientRandom(octad *RN);
+
+/** @brief Build a cipher-suites octad from supported ciphers
+ *
+    @param CS the output cipher-suite octad 
+    @param ncs the number of supported cipher-suites
+    @param ciphers an array of supported cipher-suites
+    @return length of the output octad
+ */
+extern int cipherSuites(octad *CS,int ncs,int *ciphers); 
+
+/** @brief Send a record to server
+ *
+    @param session the TLS session structure
+    @param rectype the record type
+    @param version TLS version indication
+    @param DATA the record (message fragment) to be trasnsmitted
+    @return flush is true if record is to be sent immediately
+ */
+extern void sendRecord(TLS_session *session,int rectype,int version,octad *DATA,bool flush);
+
+/** @brief Send a generic client message (as a single record) to the Server
+ *
+    @param session the TLS session structure
+    @param rectype the record type
+    @param version TLS version indication
+    @param CM the client message to be sent
+    @param EXT extensions to be added (or NULL if there are none)
+    @param flush transmit immediately if true
+ */
+extern void sendClientMessage(TLS_session *session,int rectype,int version,octad *CM,octad *EXT,bool flush);
+
+/** @brief Send a Heartbeat request record
+ *
+    @param session the TLS session structure
+ */
+extern void sendHeartbeatRequest(TLS_session *session);
+
+/** @brief Send zero length application fragment -  to bewilder the enemy
+ *
+    @param session the TLS session structure
+ */
+extern void sendZeroRecord(TLS_session *session);
+
+
+/** @brief Send a preshared key binder message to the Server
+ *
+    @param session the TLS session structure
+    @param BND binding HMAC of truncated transcript hash
+ */
+extern void sendBinder(TLS_session *session,octad *BND);
+
+/** @brief Prepare and send Client Hello message to the Server, appending prepared extensions
+ *
+    @param session the TLS session structure
+    @param version TLS version indication
+    @param CH workspace octad in which to build client Hello
+    @param CRN Random bytes
+    @param already_agreed true if cipher suite previously negotiated, else false
+    @param EXTENSIONS pre-prepared extensions
+    @param extra length of preshared key binder to be sent later
+    @param resume true if this hello is for handshae resumption
+    @param flush transmit immediately
+ */
+extern void sendClientHello(TLS_session *session,int version,octad *CH,octad *CRN,bool already_agreed,octad *EXTENSIONS,int extra,bool resume,bool flush);
+
+/** @brief Prepare and send an Alert message to the Server
+ *
+    @param session the TLS session structure
+    @param type the type of the Alert
+ */
+extern void sendAlert(TLS_session *session,int type);
+
+
+/** @brief Prepare and send a key update message to the Server
+ *
+    @param session the TLS session structure
+    @param type the type of the update
+ */
+extern void sendKeyUpdate(TLS_session *session,int type);
+
+/** @brief Prepare and send a final handshake Verification message to the Server
+ *
+    @param session the TLS session structure
+    @param CHF the client verify data HMAC
+ */
+extern void sendClientFinish(TLS_session *session,octad *CHF);
+
+/** @brief Prepare and send client certificate message to the Server
+ *
+    @param session the TLS session structure
+    @param CERTCHAIN the client certificate chain
+ */
+extern void sendClientCertificateChain(TLS_session *session,octad *CERTCHAIN);
+
+/** @brief Send client Certificate Verify message to the Server
+ *
+    @param session the TLS session structure
+    @param sigAlg the client's digital signature algorithm
+    @param CCVSIG the client's signature
+ */
+extern void sendClientCertVerify(TLS_session *session, int sigAlg, octad *CCVSIG);
+
+
+/** @brief Indicate End of Early Data in message to the Server
+ *
+    @param session the TLS session structure
+ */
+extern void sendEndOfEarlyData(TLS_session *session);
+
+/** @brief Maps problem cause to Alert
+ *
+    @param rtn the cause of a problem (a function error return)
+    @return type of Alert that should be sent to Server
+ */
+extern int alert_from_cause(int rtn);
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/include/tls_keys_calc.h b/TIIGER_TLS/PQ_TIIGER_TLS/include/tls_keys_calc.h
new file mode 100644
index 0000000..f28255c
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/include/tls_keys_calc.h
@@ -0,0 +1,202 @@
+/**
+ * @file tls_keys_calc.h
+ * @author Mike Scott
+ * @brief TLS 1.3 crypto support functions
+ *
+ */
+
+// TLS1.3 crypto support functions
+#ifndef TLS_KEYS_CALC_H
+#define TLS_KEYS_CALC_H
+
+#include "tls1_3.h"
+#include "tls_sal.h"
+#include "tls_client_recv.h"
+
+// transcript hash support
+/** @brief Initialise Transcript hash
+ *
+    @param session the TLS session structure
+ */
+extern void initTranscriptHash(TLS_session *session);
+
+/** @brief Accumulate octad into ongoing hashing 
+ *
+    @param session the TLS session structure
+    @param O an octad to be included in hash
+
+ */
+extern void runningHash(TLS_session *session,octad *O);
+
+/** @brief Accumulate transcript hash from IO buffer
+ *
+    @param session the TLS session structure
+
+ */
+extern void runningHashIO(TLS_session *session);
+
+/** @brief rewind the IO buffer
+ *
+    @param session the TLS session structure
+
+ */
+extern void rewindIO(TLS_session *session);
+
+
+/** @brief Accumulate transcript hash and from IO buffer, and rewind IO buffer
+ *
+    @param session the TLS session structure
+
+ */
+extern void runningHashIOrewind(TLS_session *session);
+
+
+/** @brief Output current hash value
+ *
+    @param session the TLS session structure
+    @param O an output octad containing current hash
+ */
+extern void transcriptHash(TLS_session *session,octad *O);
+
+/** @brief Calculate special synthetic hash calculation for first clientHello after retry request (RFC 8446 section 4.4.1)
+ *
+     @param session the TLS session structure
+    @param O an octad containing clientHello
+    @param E an octad containing clientHello extensions 
+
+ */
+extern void runningSyntheticHash(TLS_session *session,octad *O,octad *E);
+
+/** @brief Initiate a Crypto Context
+ *
+    @param C an AEAD encryption context
+ */
+extern void initCryptoContext(crypto *C);
+
+/** @brief Build a Crypto Context
+ *
+    @param C an AEAD encryption context
+    @param K an encryption key
+    @param IV an encryption Initialisation Vector
+ */
+extern void updateCryptoContext(crypto *C,octad *K,octad *IV);
+
+/** @brief Increment a Crypto Context for the next record, updating IV
+ *
+    @param C an AEAD encryption context
+ */
+extern void incrementCryptoContext(crypto *C);
+
+
+/** @brief Create a crypto context from an input raw Secret and an agreed cipher_suite 
+ *
+    @param cipher the chosen cipher site
+    @param TS the input raw secret
+    @param context the output crypto conetext
+ */
+extern void createCryptoContext(int cipher,octad *TS,crypto *context);
+
+/** @brief Build a crypto context for transmission from an input raw Secret and an agreed cipher_suite 
+ *
+    @param session TLS session structure
+    @param TS the input raw secret
+ */
+extern void createSendCryptoContext(TLS_session *session,octad *TS);
+
+/** @brief Build a crypto context for reception from an input raw Secret and an agreed cipher_suite 
+ *
+    @param session TLS session structure
+    @param TS the input raw secret
+ */
+extern void createRecvCryptoContext(TLS_session *session,octad *TS);
+
+/** @brief Recover pre-shared key from the Resumption Master Secret and store with ticket
+ *
+    @param session the TLS session structure
+ */
+extern void recoverPSK(TLS_session *session);
+
+/** @brief Extract Early Secret Key and Binder Key from Preshared Key (External or Resumption)
+ *
+    @param htype hash algorithm
+    @param PSK the input pre-shared key, or NULL if not available
+    @param ES the output early secret key
+    @param BKE the output external binder key (or NULL if not required)
+    @param BKR the output resumption binder key (or NULL if not required)
+ */
+extern void deriveEarlySecrets(int htype,octad *PSK,octad *ES,octad *BKE,octad *BKR);
+
+/** @brief Extract more secrets from Early Secret
+ *
+    @param htype hash algorithm
+    @param H a partial transcript hash
+    @param ES the input early secret key
+    @param CETS the output Client Early Traffic Secret (or NULL if not required)
+    @param EEMS the output Early Exporter Master Secret (or NULL if not required)
+ */
+extern void deriveLaterSecrets(int htype,octad *H,octad *ES,octad *CETS,octad *EEMS);
+
+/** @brief Extract Handshake Secret from Shared Secret and Early Secret. Use Handshake Secret to extract Client and Server Handshake Traffic secrets 
+ *
+     @param session the TLS session structure
+    @param SS input Shared Secret
+    @param ES the input early secret key
+    @param H a partial transcript hash
+ */
+extern void deriveHandshakeSecrets(TLS_session *session,octad *SS,octad *ES, octad *H);
+
+/** @brief Extract Application Secret from Handshake Secret and Early Secret. Use Handshake Secret to extract Client and Server Application Traffic secrets 
+ *
+     @param session the TLS session structure   
+    @param SFH an input partial transcript hash
+    @param CFH an input partial transcript hash
+    @param EMS the output External Master Secret (or NULL if not required)
+ */
+extern void deriveApplicationSecrets(TLS_session *session,octad *SFH,octad *CFH,octad *EMS);
+
+/** @brief Perform a Key Update on a crypto context
+ *
+    @param context an AEAD encryption context
+    @param TS the updated Traffic secret
+ */
+extern void deriveUpdatedKeys(crypto *context,octad *TS);
+
+/** @brief Test if data from Server is verified using server traffic secret and a transcript hash 
+ *
+    @param htype hash algorithm
+    @param SF the input verification data from Server
+    @param STS the input Server Traffic Secret
+    @param H the input partial transcript hash
+    @return true is data is verified, else false
+ */
+extern bool checkVeriferData(int htype,octad *SF,octad *STS,octad *H);
+
+/** @brief Create handshake verification data for Client to send to Server from client traffic secret and a transcript hash
+ *
+    @param htype hash algorithm
+    @param SF the output verification data
+    @param CTS the input Client Traffic Secret
+    @param H the input partial transcript hash
+ */
+extern void deriveVeriferData(int htype,octad *SF,octad *CTS,octad *H);
+
+/** @brief verify Server's signature on protocol transcript
+ *
+    @param sigalg the algorithm used for digital signature
+    @param SCVSIG the input signature on the transcript
+    @param H the transcript hash 
+    @param CERTPK the Server's public key
+    @return true if signature is verified, else returns false
+ */
+extern bool checkServerCertVerifier(int sigalg,octad *SCVSIG,octad *H,octad *CERTPK);
+
+/** @brief Create Cert Verify message, as a digital signature on some TLS1.3 specific message+transcript hash
+ *
+    @param sigAlg the signature algorithm
+    @param H a transcript hash to be signed
+    @param KEY the Client's private key
+    @param CCVSIG the output digital signature
+ */
+extern void createClientCertVerifier(int sigAlg,octad *H,octad *KEY,octad *CCVSIG);
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/include/tls_logger.h b/TIIGER_TLS/PQ_TIIGER_TLS/include/tls_logger.h
new file mode 100644
index 0000000..63b8997
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/include/tls_logger.h
@@ -0,0 +1,100 @@
+/**
+ * @file tls_logger.h
+ * @author Mike Scott
+ * @brief TLS 1.3 logging
+ *
+ */
+// Log protocol progress
+#ifndef TLS_LOGGER_H
+#define TLS_LOGGER_H
+
+#include <string.h>
+#include "tls1_3.h"
+#include "tls_x509.h"
+
+/** @brief internal printf function - all output funnels through this function 
+ *
+    @param s a string to be output
+ */
+extern void myprintf(char *s);
+
+/** @brief basic logging function
+ *
+    @param logit logging level
+    @param preamble a string to be output
+    @param string another string, or a format specifier for info, or NULL
+    @param info an integer to be output
+    @param O an octad to be output (or NULL)
+ */
+extern void log(int logit,char *preamble,char *string,unsign32 info,octad *O);
+
+/** @brief logging the Server hello
+ *
+    @param cipher_suite the chosen cipher suite
+    @param pskid the chosen preshared key (or -1 if none)
+    @param PK the Server Public Key
+    @param CK a Cookie (if any)
+ */
+extern void logServerHello(int cipher_suite,int pskid,octad *PK,octad *CK);
+
+/** @brief logging a resumption ticket
+ *
+    @param T a resumption ticket
+ */
+extern void logTicket(ticket *T);
+
+/** @brief logging server extended extensions responses vs expectations
+ *
+    @param e structure containing server expectations
+    @param r structure containing server responses
+ */
+extern void logEncExt(ee_status *e,ee_status *r);
+
+/** @brief logging a Certificate in standard base 64 format
+ *
+    @param CERT the certificate to be logged
+ */
+extern void logCert(octad *CERT);
+
+/** @brief logging Certificate details
+ *
+    @param PUBKEY the certificate public key octad
+    @param pk the public key type
+    @param SIG the signature on the certificate
+    @param sg the signature type
+    @param ISSUER the (composite) certificate issuer
+    @param SUBJECT the (composite) certificate subject
+ */
+extern void logCertDetails(octad *PUBKEY,pktype pk,octad *SIG,pktype sg,octad *ISSUER,octad *SUBJECT);
+
+/** @brief log client processing of a Server response
+ *
+    @param r the Server response 
+ */
+extern void logServerResponse(ret r);
+
+/** @brief log Server Alert
+ *
+    @param detail the server's alert code
+ */
+extern void logAlert(int detail);
+
+/** @brief log Cipher Suite
+ *
+    @param cipher_suite the Cipher Suite to be logged
+ */
+extern void logCipherSuite(int cipher_suite);
+
+/** @brief log Key Exchange Group
+ *
+    @param kex the Key Exchange Group to be logged
+ */
+extern void logKeyExchange(int kex);
+
+/** @brief log Signature Algorithm
+ *
+    @param sigAlg the Signature Algorithm to be logged
+ */
+extern void logSigAlg(int sigAlg);
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/include/tls_octads.h b/TIIGER_TLS/PQ_TIIGER_TLS/include/tls_octads.h
new file mode 100644
index 0000000..cfacc12
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/include/tls_octads.h
@@ -0,0 +1,160 @@
+/*
+* JS update 29.02.2024
+* Odstranene funkcie pre ARDUINO
+*/
+
+/**
+ * @file tls_octads.h
+ * @author Mike Scott
+ * @brief octad handling routines - octads don't overflow, they truncate
+ *
+ */ 
+
+#ifndef TLS_OCTADS_H
+#define TLS_OCTADS_H
+
+// An octad - "a group or set of eight" - Oxford dictionary
+
+#include <stddef.h>
+
+/** @brief read milliseconds from a stop-watch 
+ *
+    @return milliseconds read from stop-watch
+ */
+extern unsigned long millis();
+
+/**
+    @brief Safe representation of an octad
+*/
+typedef struct
+{
+    int len;   /**< length in bytes  */
+    int max;   /**< max length allowed - enforce truncation */
+    char *val; /**< byte array  */
+} octad;
+
+/** @brief Join len bytes of integer x to end of octad O (big endian)
+ *
+     @param O octad to be appended to
+    @param x integer to be appended to O
+    @param len number of bytes in m
+
+ */
+extern void OCT_append_int(octad *O, unsigned int x, int len);
+
+/** @brief Join one octad to the end of another
+ *
+    @param O octad to be appended to
+    @param P octad to be joined to the end of O
+ */
+extern void OCT_append_octad(octad *O, octad *P);
+
+/** @brief Compare two octads
+ *
+    @param O first octad to be compared
+    @param P second octad to be compared
+    @return true if equal, else false
+ */
+extern bool OCT_compare(octad *O, octad *P);
+
+/** @brief Shifts octad left by n bytes
+ *
+    Leftmost bytes disappear
+     @param O octad to be shifted
+    @param n number of bytes to shift
+
+ */
+extern void OCT_shift_left(octad *O, int n);
+
+/** @brief Wipe clean an octad
+ *
+    @param O octad to be cleared
+ */
+extern void OCT_kill(octad *O);
+
+/** @brief Convert a hex number to an octad
+ *
+    @param O octad
+    @param src Hex string to be converted
+ */
+extern void OCT_from_hex(octad *O, char *src);
+
+/** @brief Join from a C string to end of an octad
+ *
+    @param O octad to be written to
+    @param s zero terminated string to be joined to octad
+ */
+extern void OCT_append_string(octad *O, char *s);
+
+/** @brief Join single byte to end of an octad, repeated n times
+ *
+    @param O octad to be written to
+    @param b byte to be joined to end of octad
+    @param n number of times b is to be joined
+ */
+extern void OCT_append_byte(octad *O, int b, int n);
+
+/** @brief Join bytes to end of an octad
+ *
+    @param O octad to be written to
+    @param s byte array to be joined to end of octad
+    @param n number of bytes to join
+ */
+extern void OCT_append_bytes(octad *O, char *s, int n);
+
+/** @brief Create an octad from a base64 number
+ *
+     @param O octad to be populated
+    @param b zero terminated base64 string
+
+ */
+extern void OCT_from_base64(octad *O, char *b);
+
+/** @brief Reverse bytes in an octad
+ *
+    @param O octad to be reversed
+ */
+extern void OCT_reverse(octad *O);
+
+/** @brief Reverse bytes in an octad
+ *
+    @param O octad to be truncated
+    @param n the new shorter length
+ */
+extern void OCT_truncate(octad *O,int n);
+
+/** @brief Copy one octad into another
+ *
+     @param O octad to be copied to
+    @param P octad to be copied from
+
+ */
+extern void OCT_copy(octad *O, octad *P);
+
+/** @brief Output octad as hex string
+ *
+     @param O octad to be output
+    @param max the maximum output length
+    @param s the char array to receive output
+
+ */
+extern bool OCT_output_hex(octad *O,int max,char *s);
+
+/** @brief Output octad as C ascii string
+ *
+     @param O octad to be output
+    @param max the maximum output length
+    @param s the char array to receive output
+
+ */
+extern bool OCT_output_string(octad *O,int max,char *s);
+
+/** @brief Output octad as base64 string
+ *
+     @param O octad to be output
+    @param max the maximum output length
+    @param s the char array to receive output
+
+ */
+extern void OCT_output_base64(octad *O,int max,char *s);
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/include/tls_pqibe.h b/TIIGER_TLS/PQ_TIIGER_TLS/include/tls_pqibe.h
new file mode 100644
index 0000000..32fa536
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/include/tls_pqibe.h
@@ -0,0 +1,38 @@
+/**
+ * @file tls_pqibe.h
+ * @author Mike Scott
+ * @brief Ducas et al. IBE
+ *
+ */
+//
+// Lattice-based B&F IBE 128-bit API Functions 
+// Ducas et al. Method
+// Implementation by M.Scott
+//
+
+#ifndef PQIBE_H
+#define PQIBE_H
+
+#include "core.h"
+
+using namespace core;
+
+/** @brief IBE KEM CCA encrypt
+ *
+    @param ID Identity
+    @param R32 32 random bytes
+    @param KEY random session key generated
+    @param CT encapsulating ciphertext
+ */
+extern void PQIBE_CCA_ENCRYPT(char *ID,octet *R32,octet *KEY,octet *CT);
+
+/** @brief IBE KEM CCA decrypt
+ *
+    @param ID Identity
+    @param csk secret key
+    @param CT ciphertext
+    @param KEY output session key 
+ */
+extern void PQIBE_CCA_DECRYPT(char *ID,const int16_t *csk,octet *CT,octet *KEY);
+
+#endif
\ No newline at end of file
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/include/tls_protocol.h b/TIIGER_TLS/PQ_TIIGER_TLS/include/tls_protocol.h
new file mode 100644
index 0000000..975a00d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/include/tls_protocol.h
@@ -0,0 +1,78 @@
+/**
+ * @file tls_protocol.h
+ * @author Mike Scott
+ * @brief TLS 1.3 main client-side protocol functions
+ *
+ */
+// Main TLS 1.3 Protocol
+
+#ifndef TLS_PROTOCOL_H
+#define TLS_PROTOCOL_H
+
+#include "tls_keys_calc.h"
+#include "tls_cert_chain.h"
+#include "tls_client_recv.h"
+#include "tls_client_send.h"
+#include "tls_tickets.h"
+#include "tls_logger.h"
+
+/** @brief initialise a TLS 1.3 session structure
+ *
+    @param client the socket connection to the Server
+    @param hostname the host name (URL) of the server
+    @return an initialised TLS1.3 session structure
+ */
+extern TLS_session TLS13_start(Socket *client,char *hostname);
+
+/** @brief terminate a session structure
+ *
+    @param session the session structure
+ */
+extern void TLS13_end(TLS_session *session);
+
+
+/** @brief stop sending - send CLOSE_NOTIFY and DISCONNECT
+ *
+    @param session the session structure
+ */
+extern void TLS13_stop(TLS_session *session);
+
+
+/** @brief TLS 1.3 forge connection
+ *
+    @param session an initialised TLS session structure
+    @param EARLY some early data to be transmitted
+    @return false for failure, true for success
+ */
+extern bool TLS13_connect(TLS_session *session,octad *EARLY);
+
+/**    @brief TLS 1.3 send data
+ *
+    @param session an initialised TLS session structure
+    @param DATA some data to be transmitted
+ */
+extern void TLS13_send(TLS_session *session,octad *DATA);
+
+/** @brief TLS 1.3 receive data
+ *
+    @param session an initialised TLS session structure
+    @param DATA that has been received
+    @return 0 for time-out, negative for error, or length of data successfully received
+ */
+extern int TLS13_recv(TLS_session *session,octad *DATA);
+
+/** @brief TLS 1.3 receive data and check for liveness of connection
+ *
+    @param session an initialised TLS session structure
+    @param DATA that has been received
+    @return 0 for time-out, negative for error, or length of data successfully received
+ */
+extern int TLS13_recv_and_check(TLS_session *session,octad *DATA);
+
+
+/** @brief TLS 1.3 end session, delete keys, clean up buffers
+ *
+    @param session an initialised TLS session structure
+ */
+extern void TLS13_clean(TLS_session *session);
+#endif
\ No newline at end of file
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/include/tls_sal.h b/TIIGER_TLS/PQ_TIIGER_TLS/include/tls_sal.h
new file mode 100644
index 0000000..19e19fe
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/include/tls_sal.h
@@ -0,0 +1,225 @@
+/**
+ * @file tls_sal.h
+ * @author Mike Scott
+ * @brief Security Abstraction Layer for TLS 
+ *
+ */
+// Process input received from Server
+
+#ifndef TLS_SAL_H
+#define TLS_SAL_H
+
+// Use MIRACL core library
+
+#include "tls1_3.h"
+
+/** @brief Return name of SAL provider
+*
+    @return name of SAL provider
+*/
+extern char *SAL_name();
+
+/** @brief Return supported ciphers
+*
+    @param ciphers array of supported ciphers in preferred order
+    @return number of supported ciphers
+*/
+extern int SAL_ciphers(int *ciphers);
+
+/** @brief Return supported groups in preferred order
+*
+    @param groups array of supported groups
+    @return number of supported groups
+*/
+extern int SAL_groups(int *groups);
+
+/** @brief Return supported TLS signature algorithms in preferred order 
+*
+    @param sigAlgs array of supported signature algorithms
+    @return number of supported groups
+*/
+extern int SAL_sigs(int *sigAlgs);
+
+/** @brief Return supported TLS signature algorithms for Certificates in preferred order
+*
+    @param sigAlgsCert array of supported signature algorithms for Certificates
+    @return number of supported groups
+*/
+extern int SAL_sigCerts(int *sigAlgsCert);
+
+/** @brief Initialise library for use
+*
+    @return return true if successful, else false
+*/
+extern bool SAL_initLib();
+
+/** @brief finish use of library
+*
+*/
+extern void SAL_endLib();
+
+/** @brief return hash type asspciated with a cipher suite
+*
+    @param cipher_suite a TLS cipher suite
+    @return hash function output length
+*/
+extern int SAL_hashType(int cipher_suite);
+
+/** @brief return output length of hash function associated with a hash type
+*
+    @param hash_type a TLS hash type
+    @return hash function output length
+*/
+extern int SAL_hashLen(int hash_type);
+
+/** @brief return key length associated with a cipher suite
+*
+    @param cipher_suite a TLS cipher suite
+    @return key length
+*/
+int SAL_aeadKeylen(int cipher_suite);
+
+/** @brief return authentication tag length associated with a cipher suite
+*
+    @param cipher_suite a TLS cipher suite
+    @return tag length
+*/
+int SAL_aeadTaglen(int cipher_suite);
+
+/** @brief get a random byte
+*
+    @return a random byte
+*/
+extern int SAL_randomByte();
+
+/** @brief get a random octad
+*
+    @param len number of random bytes
+    @param R octad to be filled with random bytes
+*/
+extern void SAL_randomOctad(int len, octad *R);
+
+/** @brief HKDF Extract function
+ *
+    @param sha hash algorithm
+    @param PRK an output Key
+    @param SALT public input salt
+    @param IKM raw secret keying material
+ */
+extern void SAL_hkdfExtract(int sha,octad *PRK,octad *SALT,octad *IKM);
+
+/** @brief Special HKDF Expand function (for TLS)
+ *
+    @param htype hash algorithm
+    @param olen is the desired length of the expanded key
+    @param OKM an expanded output Key
+    @param PRK is the fixed length input key
+    @param INFO is public label information
+ */
+extern void SAL_hkdfExpand(int htype, int olen, octad *OKM,octad *PRK, octad *INFO);
+
+/** @brief simple HMAC function
+ *
+    @param htype hash algorithm
+    @param T an output tag
+    @param K an input key, or salt
+    @param M an input message
+ */
+extern void SAL_hmac(int htype,octad *T,octad *K,octad *M);
+
+/** @brief simple HASH of nothing function
+ *
+    @param sha the SHA2 function output length (32,48 or 64)
+    @param H the output hash
+ */
+extern void SAL_hashNull(int sha,octad *H);
+
+// hash functions
+
+/** @brief Initiate Hashing context
+ *
+    @param hlen length in bytes of SHA2 hashing output
+    @param h a hashing context
+ */
+extern void SAL_hashInit(int hlen,unihash *h);
+
+/** @brief Hash process an array of bytes
+ *
+    @param h a hashing context
+    @param b the byte array to be included in hash
+    @param len the array length
+ */
+extern void SAL_hashProcessArray(unihash *h,char *b,int len);
+
+
+/** @brief Hash finish and output
+ *
+    @param h a hashing context
+    @param d the current output digest of an ongoing hashing operation
+    @return hash output length
+ */
+extern int SAL_hashOutput(unihash *h,char *d);
+
+/** @brief AEAD encryption 
+ *
+    @param send the AES key and IV
+    @param hdrlen the length of the header
+    @param hdr the header bytes
+    @param ptlen the plaintext length
+    @param pt the input plaintext and output ciphertext
+    @param TAG the output authentication tag
+ */
+extern void SAL_aeadEncrypt(crypto *send,int hdrlen,char *hdr,int ptlen,char *pt,octad *TAG);
+
+/** @brief AEAD decryption 
+ *
+    @param recv the AES key and IV
+    @param hdrlen the length of the header
+    @param hdr the header bytes
+    @param ctlen the ciphertext length
+    @param ct the input ciphertext and output plaintext
+    @param TAG the expected authentication tag
+    @return false if tag is wrong, else true
+ */
+extern bool SAL_aeadDecrypt(crypto *recv,int hdrlen,char *hdr,int ctlen,char *ct,octad *TAG);
+
+/** @brief generate a public/private key pair in an approved group for a key exchange
+ *
+    @param group the cryptographic group used to generate the key pair
+    @param SK the output Private Key
+    @param PK the output Public Key
+ */
+extern void SAL_generateKeyPair(int group,octad *SK,octad *PK);
+
+/** @brief generate a Diffie-Hellman shared secret
+ *
+    @param group the cryptographic group used to generate the shared secret
+    @param SK the input client private key
+    @param PK the input server public Key
+    @param SS the output shared secret
+    @return false for all zeros, else true
+ */
+extern bool SAL_generateSharedSecret(int group,octad *SK,octad *PK,octad *SS);
+
+
+/** @brief Verify a generic TLS signature
+ *
+    @param sigAlg the signature type
+    @param TRANS the signed input transcript hash 
+    @param SIG the input signature
+    @param PUBKEY the public key used to verify the signature
+    @return true if signature is valid, else false
+ */
+extern bool SAL_tlsSignatureVerify(int sigAlg,octad *TRANS,octad *SIG,octad *PUBKEY);
+
+/** @brief Apply a generic TLS transcript signature
+ *
+    @param sigAlg the signature type
+    @param KEY the private key used to form the signature
+    @param TRANS the input transcript hash to be signed
+    @param SIG the output signature
+ */
+extern void SAL_tlsSignature(int sigAlg,octad *KEY,octad *TRANS,octad *SIG);
+
+
+#endif
\ No newline at end of file
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/include/tls_sockets.h b/TIIGER_TLS/PQ_TIIGER_TLS/include/tls_sockets.h
new file mode 100644
index 0000000..806aeb8
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/include/tls_sockets.h
@@ -0,0 +1,188 @@
+/*
+* JS update 29.02.2024
+* Hlavickove subory pre WIN platformu
+* Odstranene funkcie pre ARDUINO
+*/
+
+/**
+ * @file tls_sockets.h
+ * @author Mike Scott
+ * @brief set up sockets for reading and writing
+ *
+ */
+
+// Set up and read/write sockets
+
+#ifndef TLS_SOCKETS_H
+#define TLS_SOCKETS_H
+
+#include <string.h>
+#include "tls_octads.h"
+
+// JS pridana podpora pre Windows
+#ifdef __WIN32
+#include <winsock2.h>
+#include <afunix.h>
+#include <ws2tcpip.h>
+#else
+#include <sys/socket.h> 
+#include <arpa/inet.h> 
+#include <netinet/in.h> 
+#include <netinet/in.h>
+#include <sys/un.h>
+#include <netdb.h>
+#endif
+
+#include <stdlib.h> 
+#include <time.h>
+#include <unistd.h> 
+#include <stdio.h> 
+
+/** @brief create a client socket 
+ *
+    @param port the TCP/IP port on which to connect
+    @param ip the IP address with which to connect
+    @param toms the time-out period in milliseconds
+    @return the socket handle
+ */
+extern int setclientsock(int port, char *ip, int toms);
+
+/** @brief get the IP address from a URL
+ *
+    @param ip the IP address
+    @param hostname the input Server name (URL)
+    @return 1 for success, 0 for failure
+ */
+extern int getIPaddress(char *ip,char *hostname);
+
+// Simple socket class
+/**
+ * @brief Socket instance */
+class Socket
+{
+    int sock;     /**< the socket handle */
+    int toms;     /**< the socket time-out in milliseconds */
+    bool is_af_unix;  /**< Is it an AF_UNIX socket? */
+
+private:
+    Socket(bool is_af_unix) {
+        this->sock = 0;
+        this->toms = 5000;
+        this->is_af_unix = is_af_unix;
+    }
+
+    static int afunix_setclientsock(const char *const socket_path)
+    {
+        int sock;
+        struct sockaddr_un serv_addr;
+        if ((sock = socket(AF_UNIX, SOCK_STREAM, 0)) < 0)
+            return -2;
+
+        serv_addr.sun_family = AF_UNIX;
+        strcpy(serv_addr.sun_path, socket_path);
+
+        if (::connect(sock, (struct sockaddr *)&serv_addr, sizeof(serv_addr)) < 0)
+            return -1;
+      
+        return sock;
+    }
+
+public:
+
+    bool connect(char *host,int port) {
+        if(!this->is_af_unix) {
+            char ip[40];
+            sock = 0;
+            if (!getIPaddress(ip, host))
+                return false;
+            sock = setclientsock(port, ip, toms);
+            if (sock <= 0)
+                return false;
+            return true;
+        } else {
+            bool connected = true;
+            sock = afunix_setclientsock(host);
+            if (sock <= 0) {
+                connected = false;
+            }
+            return connected;
+        }
+    }
+
+    int getport() {
+        struct sockaddr_in local_address;
+        socklen_t addr_size = sizeof(local_address);
+        getsockname(sock, (struct sockaddr *)&local_address, &addr_size);    
+        return ntohs(local_address.sin_port);
+    }
+
+    static Socket InetSocket() {
+        return Socket(false);
+    }
+
+    static Socket UnixSocket() {
+        return Socket(true);
+    }
+
+    void setTimeout(int to) {toms=to;}
+    int write(char *buf,int len) {return ::send(sock,buf,len,0);}
+    int read(char *buf,int len) {return ::recv(sock,buf,len,0);}
+    void stop() {::close(sock);}
+
+    ~Socket() {::close(sock);}
+};
+
+/** @brief send an octad over a socket 
+ *
+    @param client the socket connection to the Server
+    @param B the octad to be transmitted
+ */
+extern void sendOctad(Socket *client,octad *B);
+
+/** @brief send a 16-bit integer as an octad to Server
+ *
+    @param client the socket connection to the Server
+    @param len the 16-bit integer to be encoded as octad and transmitted
+ */
+extern void sendLen(Socket *client,int len);
+
+/** @brief receive bytes over a socket sonnection
+ *
+    @param client the socket connection to the Server
+    @param b the received bytes
+    @param expected the number of bytes expected
+    @return -1 on failure, 0 on success
+ */
+extern int getBytes(Socket *client,char *b,int expected);
+
+/** @brief receive 16-bit integer from a socket
+ *
+    @param client the socket connection to the Server
+    @return a 16-bit integer
+ */
+extern int getInt16(Socket *client);
+
+/** @brief receive 24-bit integer from a socket
+ *
+    @param client the socket connection to the Server
+    @return a 24-bit integer
+ */
+extern int getInt24(Socket *client);
+
+/** @brief receive a single byte from a socket
+ *
+    @param client the socket connection to the Server
+    @return a byte
+ */
+extern int getByte(Socket *client);
+
+/** @brief receive an octad from a socket
+ *
+    @param client the socket connection to the Server
+    @param B the output octad
+    @param expected the number of bytes expected
+    @return -1 on failure, 0 on success
+ */
+extern int getOctad(Socket *client,octad *B,int expected);
+
+#endif
\ No newline at end of file
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/include/tls_tickets.h b/TIIGER_TLS/PQ_TIIGER_TLS/include/tls_tickets.h
new file mode 100644
index 0000000..8c12aa9
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/include/tls_tickets.h
@@ -0,0 +1,43 @@
+/**
+ * @file tls_tickets.h
+ * @author Mike Scott
+ * @brief TLS 1.3 process resumption tickets
+ *
+ */
+// Process Resumption Tickets
+
+#ifndef TLS_TICKETS_H
+#define TLS_TICKETS_H
+
+#include "tls1_3.h" 
+#include "tls_client_recv.h"
+
+/** @brief parse a received ticket octad into a ticket structure 
+ *
+    @param TICK the input ticket octad
+    @param T the output ticket structure
+    @param birth the birth time of the ticket
+    @return bad ticket error, or 0 if ticket is good
+ */
+extern int parseTicket(octad *TICK,unsign32 birth,ticket *T);
+
+/** @brief initialize a ticket structure
+ *
+    @param T the ticket structure
+ */
+extern void initTicketContext(ticket *T);
+
+/** @brief terminate a ticket structure
+ *
+    @param T the ticket structure
+ */
+extern void endTicketContext(ticket *T);
+
+/** @brief Check that a ticket is still good, and not out-of-date 
+ *
+    @param T the ticket structure
+    @return true if ticket is still good
+ */
+extern bool ticket_still_good(ticket *T);
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/include/tls_x509.h b/TIIGER_TLS/PQ_TIIGER_TLS/include/tls_x509.h
new file mode 100644
index 0000000..fb508ed
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/include/tls_x509.h
@@ -0,0 +1,232 @@
+/*
+* JS update 14.04.2024
+* Upravenie definovanych kriviek
+* Pridane krivky pre algoritmy ML-KEM a ML-DSA
+* Testovane s novou verziou liboqs 0.10.0
+*/
+
+/*
+* JS update 29.02.2024
+* Definovanie "novych" kriviek na rozlisenie pouzitych PQ algoritmov
+*/
+
+/**
+ * @file tls_x509.h
+ * @author Mike Scott
+ * @brief X509 function Header File
+ *
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef TLS_X509_H
+#define TLS_X509_H
+
+// Supported Encryption Methods
+
+#define X509_ECC 1      /**< Elliptic Curve data type detected */
+#define X509_RSA 2      /**< RSA data type detected */
+#define X509_ECD 3      /**< Elliptic Curve (Ed25519) detected */
+#define X509_PQ 4       /**< Post Quantum method */
+#define X509_HY 5       /**< Hybrid Post_Quantum */
+
+// Supported Hash functions
+
+#define X509_H256 2     /**< SHA256 hash algorithm used */
+#define X509_H384 3     /**< SHA384 hash algorithm used */
+#define X509_H512 4     /**< SHA512 hash algorithm used */
+#define X509_SHAKE256 5 /**< SHA3 SHAKE256 algorithm used */
+
+#define X509_MLKEM 98
+#define X509_MLDSA 99
+
+// Supported Curves
+
+#define USE_NIST256 0    /**< For the NIST 256-bit standard curve - WEIERSTRASS only */
+#define USE_ED25519 1     /**< Bernstein's Modulus 2^255-19 - EDWARDS */
+#define USE_ED448 4     /**< Goldilocks Modulus Ed448 - EDWARDS */
+//#define USE_BRAINPOOL 2  /**< For Brainpool 256-bit curve - WEIERSTRASS only */
+//#define USE_ANSSI 3      /**< For French 256-bit standard curve - WEIERSTRASS only */
+#define USE_NIST384 10   /**< For the NIST 384-bit standard curve - WEIERSTRASS only */
+#define USE_NIST521 12   /**< For the NIST 521-bit standard curve - WEIERSTRASS only */
+
+// JS update
+// Definovanie curve hodnoty pre rozne PQ algoritmy
+#define USE_DILITHIUM2 100
+#define USE_DILITHIUM3 101
+#define USE_DILITHIUM5 102
+#define USE_MLDSA44 103
+#define USE_MLDSA65 104
+#define USE_MLDSA87 105
+#define USE_FALCON512 106
+#define USE_FALCON1024 107
+#define USE_SPHINCSSHA2128FSIMPLE 108
+#define USE_SPHINCSSHA2128SSIMPLE 109
+#define USE_SPHINCSSHAKE128FSIMPLE 110
+#define USE_SPHINCSSHA2192FSIMPLE 111
+
+extern octad X509_CN;  /**< Country Name */
+extern octad X509_ON;  /**< organisation Name */
+extern octad X509_EN;  /**< email */
+extern octad X509_LN;  /**< local name */
+extern octad X509_UN;  /**< Unit name (aka Organisation Unit OU) */
+extern octad X509_MN;  /**< My Name (aka Common Name) */
+extern octad X509_SN;  /**< State Name */
+
+extern octad X509_AN;  /**< Alternate Name */
+extern octad X509_KU;  /**< Key Usage */
+extern octad X509_BC;  /**< Basic Constraints */
+
+/**
+ * @brief Public key type
+ */
+typedef struct
+{
+    int type;  /**< signature type (ECC or RSA) */
+    int hash;  /**< hash type */
+    int curve; /**< elliptic curve used or RSA key length in bits  */
+} pktype;
+
+
+/** @brief in-place ECDSA signature encoding
+ *
+    @param c an ecdsa signature to be converted from r|s form to ASN.1
+*/
+extern void ecdsa_sig_encode(octad *c);
+
+/** @brief in-place ECDSA signature decoding
+ *
+    @param c an ecdsa signature to be converted from ASN.1 to simple r|s form
+    @return index into c where conversion ended
+*/
+extern int ecdsa_sig_decode(octad *c);
+
+/* X.509 functions */
+
+/** @brief Extract private key
+ *
+    @param c an X.509 private key 
+    @param pk the extracted private key - for RSA octad = p|q|dp|dq|c, for ECC octad = k
+    @return 0 on failure, or indicator of private key type (ECC or RSA)
+*/
+extern pktype X509_extract_private_key(octad *c,octad *pk);
+
+/** @brief Extract certificate signature
+ *
+    @param c an X.509 certificate
+    @param s the extracted signature
+    @return 0 on failure, or indicator of signature type (ECC or RSA)
+
+*/
+extern pktype X509_extract_cert_sig(octad *c, octad *s);
+/** @brief
+ *
+    @param sc a signed certificate
+    @param c the extracted certificate
+    @return 0 on failure
+*/
+extern int X509_extract_cert(octad *sc, octad *c);
+
+/** @brief
+ *
+    @param c an X.509 certificate
+    @param ptr pointer to ASN.1 raw public key
+    @return length of raw public key
+*/
+extern int X509_find_public_key(octad *c,int *ptr);
+
+/** @brief
+ *
+    @param c an ASN.1 encoded public key
+    @param key the extracted public key
+    @return indicator of public key type (ECC or RSA)
+*/
+extern pktype X509_get_public_key(octad *c,octad *key);
+
+
+/** @brief
+ *
+    @param c an X.509 certificate
+    @param k the extracted key
+    @return 0 on failure, or indicator of public key type (ECC or RSA)
+*/
+extern pktype X509_extract_public_key(octad *c, octad *k);
+/** @brief
+ *
+    @param c an X.509 certificate
+    @param len length of issuer field
+    @return 0 on failure, or pointer to issuer field in cert
+*/
+extern int X509_find_issuer(octad *c,int *len);
+/** @brief
+ *
+    @param c an X.509 certificate
+    @return 0 on failure, or pointer to validity field in cert
+*/
+extern int X509_find_validity(octad *c);
+/** @brief
+ *
+    @param c an X.509 certificate
+    @param len length of suject field
+    @return 0 on failure, or pointer to subject field in cert
+*/
+extern int X509_find_subject(octad *c,int *len);
+
+/** @brief
+ *
+    @param c an X.509 certificate
+    @return true if self-signed, else false
+*/
+extern int X509_self_signed(octad *c);
+
+/** @brief
+ *
+    @param c an X.509 certificate
+    @param S is OID of property we are looking for
+    @param s is a pointer to the section of interest in the cert
+    @param f is pointer to the length of the property
+    @return 0 on failure, or pointer to the property
+*/
+extern int X509_find_entity_property(octad *c, octad *S, int s, int *f);
+/** @brief
+ *
+    @param c an X.509 certificate
+    @param s is a pointer to the start of the validity field
+    @return 0 on failure, or pointer to the start date
+*/
+extern int X509_find_start_date(octad *c, int s);
+/** @brief
+ *
+    @param c an X.509 certificate
+    @param s is a pointer to the start of the validity field
+    @return 0 on failure, or pointer to the expiry date
+*/
+extern int X509_find_expiry_date(octad *c, int s);
+
+/** @brief
+ *
+    @param c an X.509 certificate
+    @return 0 on failure (or no extensions), or pointer to extensions field in cert
+*/
+extern int X509_find_extensions(octad *c);
+/** @brief
+ *
+    @param c an X.509 certificate
+    @param S is OID of particular extension we are looking for
+    @param s is a pointer to the section of interest in the cert
+    @param f is pointer to the length of the extension
+    @return 0 on failure, or pointer to the extension
+*/
+extern int X509_find_extension(octad *c, octad *S, int s, int *f);
+
+/** @brief
+ *
+    @param c an X.509 certificate
+    @param s is a pointer to certificate extension SubjectAltNames
+    @param name is a URL
+    @return 0 on failure, 1 if URL is in list of alt names
+*/
+extern int X509_find_alt_name(octad *c,int s,char *name);
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/lib/ibe/tls_bfibe.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/lib/ibe/tls_bfibe.cpp
new file mode 100644
index 0000000..80f94d2
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/lib/ibe/tls_bfibe.cpp
@@ -0,0 +1,268 @@
+//
+// Pairing-based B&F IBE 128-bit API Functions
+// Uses MIRACL
+//
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include <time.h>
+#include "randapi.h"
+#include "tls_bfibe.h"
+
+#if CHUNK == 32
+using namespace B384_29;
+#else
+using namespace B384_58;
+#endif
+
+using namespace BLS12381;
+
+#define ROUNDUP(a,b) ((a)-1)/(b)+1
+
+/* Encode octet to curve point on G2 */
+static void h1(char *identity,ECP2 *Qid)
+{
+    int j,k,m,L;
+    char okm[128],fd[64],dst[64],id[100];
+    octet ID = {0,sizeof(id),id};
+    octet DST = {0, sizeof(dst), dst};
+    OCT_jstring(&DST,(char *)"BLS12381G1_XMD:SHA-256_SVDW_NU_BFIBE"); // Domain Separation Tag
+    OCT_jstring(&ID,identity);
+    BIG q,r,w;
+    FP u1,u2;
+    FP2 u;
+    DBIG dx;
+    octet OKM = {0,sizeof(okm),okm};
+    BIG_rcopy(q,Modulus);
+    k=BIG_nbits(q);
+    BIG_rcopy(r, CURVE_Order);
+    m=BIG_nbits(r);
+    L=ROUNDUP(k+ROUNDUP(m,2),8);
+    XOF_Expand(SHAKE128,&OKM,2*L,&DST,&ID);
+    for (j=0;j<L;j++)
+        fd[j]=OKM.val[j];
+        
+    BIG_dfromBytesLen(dx,fd,L);
+    BIG_dmod(w,dx,q);
+    FP_nres(&u1,w);
+
+    for (j=0;j<L;j++)
+        fd[j]=OKM.val[L+j];
+       
+    BIG_dfromBytesLen(dx,fd,L);
+    BIG_dmod(w,dx,q);
+    FP_nres(&u2,w);
+
+    FP2_from_FPs(&u,&u1,&u2);
+
+    ECP2_map2point(Qid,&u);
+    ECP2_cfp(Qid);
+    ECP2_affine(Qid);
+}
+
+/* create random r in Zq from U and V, and rP */
+static void h3(octet *U,octet *V,BIG r,ECP *rP)
+{
+    int i;
+    BIG q;
+    csprng RNG; 
+    BIG_rcopy(q, CURVE_Order);
+    char raw[128];
+    octet RAW = {128, sizeof(raw), raw};
+    sha3 sh;
+    SHA3_init(&sh,SHAKE256);
+    for (i=0;i<U->len;i++) {
+        SHA3_process(&sh,U->val[i]&0xff);
+    } 
+    if (V!=NULL)
+    {
+        for (i=0;i<V->len;i++) {
+            SHA3_process(&sh,V->val[i]&0xff); 
+        }
+    }
+    SHA3_shake(&sh,raw,128);
+    CREATE_CSPRNG(&RNG, &RAW);
+    BIG_randtrunc(r, q, 2 * CURVE_SECURITY_BLS12381, &RNG);
+    ECP_generator(rP);
+    PAIR_G1mul(rP,r);
+} 
+
+/* hash input octet to 32 bytes */
+static void h4(octet *I,octet *O)
+{
+    sha3 sh;
+    SHA3_init(&sh,SHA3_HASH256);
+    for (int i=0;i<I->len;i++) {
+        SHA3_process(&sh,I->val[i]&0xff);
+    }  
+    SHA3_hash(&sh,O->val);
+    O->len=32;
+} 
+
+/* Client secret CST=s*IDHTS where IDHTS is server ID hashed to a curve point, and s is the master secret */
+static void bfibe_get_id_secret(BIG s, char *id, octet *SK)
+{
+    ECP2 Q;
+    h1(id,&Q); // Hash to curve
+    PAIR_G2mul(&Q, s);
+    ECP2_toOctet(SK, &Q, false); // change to TRUE for point compression 
+    
+} 
+
+/* Extract TA public PK=S*Q where Q is fixed generator in G2 and S is master secret */
+static void bfibe_get_ta_public(BIG s, octet *PK)
+{
+    BIG r;
+    ECP P;
+  
+    BIG_rcopy(r, CURVE_Order);
+    ECP_generator(&P);
+   
+    PAIR_G1mul(&P, s);
+    ECP_toOctet(PK, &P, false);
+} 
+
+char *tapk=(char *)"0402d506a111d406dd0ad9d64b6515c4e15fd28ab45595b89817871d9220f0242c7b7ef1800ad8e6a8f047100088702ac8042add1af478ae20672c6670959ae36f19dcdee948f6b40a3498af69d708fbf15e81b536dacac484a697a59f3742063b";
+
+/* IBE Encrypt */
+bool BFIBE_CCA_ENCRYPT(char *ID,octet *R32,octet *M,octet *CT)
+{
+    ECP rP,Ppub;
+    ECP2 Qid;
+    BIG r;
+    FP12 g;
+
+    char u[2*PFS_BLS12381+1],z[12*PFS_BLS12381],sigma[32],mask[32],v[32],w[32];
+    octet SIGMA={0,sizeof(sigma),sigma};
+    octet MASK={0,sizeof(mask),mask};
+    octet U = {0, sizeof(u), u};
+    octet V = {0, sizeof(v), v};
+    octet W = {0, sizeof(w), w};
+    octet Z = {0, sizeof(z), z};
+
+    sha3 sh;
+    SHA3_init(&sh,SHAKE256);
+    for (int i=0;i<R32->len;i++) {
+        SHA3_process(&sh,R32->val[i]&0xff);
+    }     
+    SHA3_shake(&sh,SIGMA.val,32);   // random sigma
+    SHA3_shake(&sh,M->val,32);      // generate encapsulated 
+
+    M->len=32;
+    SIGMA.len=32;
+
+    h1(ID,&Qid);                    // HID=H1(ID)
+    h3(&SIGMA,M,r,&rP);             // r,rP=H3(sigma,m)
+    h4(&SIGMA,&MASK);               // MASK=H4(sigma)
+
+    OCT_copy(&W,M);
+    OCT_xor(&W,&MASK);
+
+    OCT_fromHex(&U,tapk);
+    if (!ECP_fromOctet(&Ppub,&U)) return false;
+
+    PAIR_G1mul(&Ppub,r);
+    ECP_toOctet(&U,&rP,false);
+    PAIR_ate(&g, &Qid, &Ppub); // e(HID,r.Ppub)
+    PAIR_fexp(&g);
+    FP12_toOctet(&Z,&g);
+
+    h4(&Z,&MASK);
+
+    OCT_copy(&V,&SIGMA);
+    OCT_xor(&V,&MASK);
+
+    OCT_empty(CT);
+    OCT_joctet(CT,&U);
+    OCT_joctet(CT,&V);
+    OCT_joctet(CT,&W);
+ 
+    return true;
+} 
+
+/* IBE Decrypt */
+bool BFIBE_CCA_DECRYPT(octet *SK,octet *CT,octet *M)
+{
+    ECP rPc,rP;
+    ECP2 Did;
+    FP12 g;
+    BIG r;
+ 
+    char u[2*PFS_BLS12381+65],z[12*PFS_BLS12381],sigma[32],v[64],w[32];
+    octet U={0,sizeof(u),u};
+    octet W={0,sizeof(w),w};
+    octet V={0,sizeof(v),v};
+    octet Z = {0, sizeof(z), z};
+    octet SIGMA={0,sizeof(sigma),sigma};
+   
+    OCT_copy(&U,CT);
+    OCT_chop(&U,&V,2*PFS_BLS12381+1);
+    OCT_chop(&V,&W,32);
+    if (!ECP_fromOctet(&rP,&U)) return false;
+    if (!ECP2_fromOctet(&Did,SK)) return false;
+
+    PAIR_ate(&g,&Did,&rP);  // e(Did,U)
+    PAIR_fexp(&g);
+    FP12_toOctet(&Z,&g);
+    h4(&Z,&SIGMA);
+
+    OCT_xor(&SIGMA,&V);
+    h4(&SIGMA,M);
+    OCT_xor(M,&W);
+    h3(&SIGMA,M,r,&rPc);  
+    if (!ECP_equals(&rP,&rPc)) return false;
+    
+    return true;
+} 
+
+// secret key for "localhost"
+char *idsk=(char *)"040ec014966d3442e85ed19b46044d9655d8ed91ef05e6678e57a51cfd9202c8dad2c854850b09fc919b6cb000a2f5b05801b767a87194d62d45cb1b1a9cd15b63ea733770361de22f64946631c2c21826d8abf884e4d07159d54c91b79662e2e4050ae782a9fb9394853669540b4cb1f46098ca690bd572b9c47587ca12a2f2c268e1a22ebc0d752f95bcf926a8b6e2cb1452dc7bf03eab18c5b68822b0da20279d1e8997a759637abdffec93f4c985f9256deed1cca5c50e2c37ae6c10c67c13";
+
+/*
+#define LOOPS 100
+
+int main()
+{
+    char *id=(char *)"localhost";
+    char r32[32],sk[256],m[32],ct[2*PFS_BLS12381+65],pk[4*PFS_BLS12381+1];
+    octet R32={32, sizeof(r32), r32};
+    octet SK = {0, sizeof(sk), sk};
+    octet PK = {0, sizeof(pk), pk};
+    octet M = {0, sizeof(m), m};
+    octet CT = {0, sizeof(ct), ct};
+
+//    BIG s;
+//    ECP rP;
+//
+//    for (int i=0;i<32;i++)
+//        r32[i]=i+5;
+//
+//    h3(&R32,NULL, s, &rP);
+//    //OCT_output(&S);
+
+//    bfibe_get_id_secret(s, id, &SK);
+//    printf("SK= "); OCT_output(&SK);
+//    bfibe_get_ta_public(s, &PK);
+//    printf("PK= "); OCT_output(&PK);
+
+
+    OCT_fromHex(&SK,idsk);
+
+    for (int i=0;i<LOOPS;i++)
+    {
+        for (int j=0;j<32;j++) {
+            r32[j]=((i+j)%256);
+        }
+
+        BFIBE_CCA_ENCRYPT(id,&R32,&M,&CT);
+
+        printf("EM= ");
+        OCT_output(&M);
+
+        BFIBE_CCA_DECRYPT(&SK,&CT,&M);
+        printf("DM= ");
+        OCT_output(&M);
+    }
+    return 0;
+}
+*/
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/lib/ibe/tls_pqibe.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/lib/ibe/tls_pqibe.cpp
new file mode 100644
index 0000000..bba8b89
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/lib/ibe/tls_pqibe.cpp
@@ -0,0 +1,642 @@
+//
+// Lattice-based B&F IBE 128-bit API Functions 
+// Ducas et al. Method
+// Implementation by M.Scott
+// For code to set up TA and issue secret keys, contact me - michael.scott@tii.ae
+
+#include <iostream>
+#include <stdlib.h>
+#include <cstdint>
+
+#include "tls_pqibe.h"
+
+using namespace std;
+using namespace core;
+
+#define PRIME 0x8020001
+#define ONE 0x7C1FFE1
+#define R2MODP 0xFA047E
+#define LIM 128 // should be 256? But could be 64 if we went unsigned
+#define LGN 10
+#define ND 0x801FFFF
+#define DEGREE (1<<LGN)
+#define DLQ ((DEGREE/LIM)*PRIME)
+
+#define UBITS 28
+#define VBITS 3
+#define ULEN (UBITS*DEGREE/8)
+#define VLEN (VBITS*DEGREE/8)
+
+#define byte unsigned char
+
+const int32_t inv= 0x400000;
+const int32_t invpr= 0x60ff677;
+const int32_t  roots[]= {0x7c1ffe1,0x6362708,0x45401e8,0x60207e,0x272355d,0x233006,0x9d6d36,0x3d02f9a,0x771d6e8,0x661ea3e,0x1b2a2f,0x487c668,0x56ec3e9,0x563ea0e,0x71ef93f,0x46af7ca,0x431e77b,0x219e6a7,0x33e88d8,0x68edbb5,0x587f588,0x77d7677,0x6ef458c,0x33d0371,0x74055eb,0xad4ed7,0x52224a3,0x67ab958,0x54281c9,0x1e39f16,0x28403d4,0x6fff0a3,0x4173ac0,0x50139dd,0x7594613,0x715165a,0x1dda5b6,0x22a9f4f,0x4063386,0x3da7712,0x1878088,0x3e26ff1,0x684d588,0x111c526,0x5723b3,0x41546ba,0x58f9bee,0x20e749c,0x6575666,0x708d971,0x7048652,0x5e6d01b,0x661ab01,0xb5c31c,0x767e192,0x5bc96f,0x7c4edaf,0x3be6cea,0x3355c75,0x1b35ff7,0x7a0a781,0x7d3ca83,0x2db976e,0x36881de,0x5fbebb3,0x47b73cc,0x6975af0,0x610bf6a,0x740a9dd,0x117a783,0x6d75314,0x260368f,0x25dd6f9,0x118eb2,0x731d94b,0x657e164,0x7eb3daa,0xc97fb6,0x502d1ab,0x13418a0,0x3c2363d,0x54d8e23,0x1032621,0x2e8905a,0x5fdabc8,0x780c630,0x2474ee,0x42fae99,0x186acc9,0x497adcb,0x2042f33,0x3262a8f,0x7cc5a40,0x203d094,0x4ee931e,0x4ed448b,0x1115636,0x1c18918,0x1d828b,0x7bf1c61,0x12b3ab6,0x2d57990,0x30f45,0x7649bc5,0x6a2146,0x8c800c,0x46fab1f,0x7741b5d,0xe32f75,0x3d0e352,0xb8d0c6,0x2cc08a,0x2e0a850,0x1adfb1f,0x5e1e299,0x8a5028,0x648ec62,0x581adad,0x53023c0,0x1b503f2,0x7826bb5,0xb3f6f5,0x351c21e,0x4991a0d,0x1147223,0x40def85,0x6be2de0,0x387163,0x4bb22e6,0x2eba55e,0x3fadf24,0x5609ebe,0x1dfdd31,0x53fbbe,0x5094fbf,0x91104d,0x719a691,0x196daa3,0x6c3179d,0x7ebf37f,0x239bbec,0x4fb5764,0x6ed689b,0x3a0fdce,0x239175e,0x5acd5ef,0x1bfa82b,0x5143035,0x294f431,0x270683,0x3625660,0xd159ba,0x32633e4,0x41d0706,0x1fb0544,0x5e75b4,0x65d50a7,0x2d042de,0x5badff,0x551c2bf,0x735c056,0x5f8428f,0x4c9e9f6,0x821991,0x1d8cf36,0x6ca4a8b,0x11f2c27,0x313d03c,0x1996452,0x2107370,0x5d2e4a9,0x4612494,0x4097732,0x282aaeb,0x2d38f9f,0x6ba7a8e,0x3d59450,0x6b85240,0x1cdf1e4,0x65bbec8,0xdb39f2,0x451971c,0x7f03bd2,0x6e4a4d0,0x74f8d97,0x7035ad9,0x695321d,0x6c2493,0x725b0fb,0x1096e3e,0x71681b2,0x57647be,0x6bff3be,0x297dc11,0x7c01a06,0x6bae8c8,0x5f3ec37,0x6a06a45,0x4f046d3,0x6b35f00,0x4d1c9e7,0x53a6282,0x3bd9efb,0x6057dd7,0x65d048c,0x2cd242d,0x450924c,0x21a9bb6,0x2ed604c,0x6b0e157,0x630b785,0x68e451b,0x50a0bbe,0x42dde0e,0x6ce8a37,0x5ceee9,0x78c51a3,0x7187991,0x244f75b,0x736d41,0xea6968,0x6f0d951,0x741fe2f,0x7d8e6a3,0x26a2143,0x35d30e8,0x39668,0x3052302,0x3920332,0x5f3debe,0x6e9b06,0x2839909,0x5224455,0x5305ebe,0x1ed7bfd,0x626943a,0x6a0b01e,0x106f1d5,0x8e8e2e,0x4cd1bff,0x96b09e,0x5fc992a,0x27d655b,0x100c33a,0x51bbfe3,0x5ead0ea,0xa6b1fb,0x41869df,0x7f9cd9a,0x199daa,0x26656a1,0x1c9185,0x2c429ea,0x1076c9e,0x4f874ab,0x4488c7d,0x55c6eac,0x5b8750f,0x5d18a95,0x3fee28b,0x665c466,0x2ce7927,0x671042,0x7806ab2,0x3f53bcd,0x4780c89,0x7096f1d,0x238017e,0x56c858c,0x6ef3fce,0x6809f09,0x32c79f5,0x4f386b,0x32313aa,0x8ffe22,0x31a2aec,0x65769df,0x2102bb7,0xaea89e,0x24000fc,0x48972af,0x707f6f0,0x7d39d84,0x24782dd,0x6c11eff,0x20d8ebf,0x7420bf9,0x1e6b929,0x2e7d2c8,0x482cfc1,0x645d2e5,0x44d9435,0x5e3ba72,0x3910df,0x132a89d,0x504162d,0x3f607ba,0x94ed1d,0x7cbdd40,0x70d86ea,0x76e369a,0x5aa8d15,0x1948566,0x5ba66d4,0x1872901,0x67e2700,0x195af5d,0x4394e59,0x279e163,0x401a4b0,0x6914ba0,0x3a32be5,0x601b550,0x1412f99,0x961169,0x28cd9fa,0x3ba58ad,0x1ff88eb,0x36d9167,0x2c70d6f,0x1c5d3dd,0x62a7022,0x5106f33,0x7891cd8,0x67d937,0x126ccb9,0x7d1244f,0x3fb2737,0x1a299e9,0xf1777b,0x637d472,0x2c70798,0x6c275f1,0x5acd1fa,0x486b52f,0x366a133,0x43f3bc6,0x47fb230,0x4be7ce8,0x4733305,0x75388a,0x64da47,0x3ce0fea,0x39bba0f,0x309fb0a,0x38b6b6d,0x22c3a83,0xdfc544,0x4824353,0x1070e76,0x39b82ea,0xb2416e,0x26a094c,0x6306ffc,0x4e11a8b,0x3c98963,0x44e68c3,0x7d1d519,0x44391c1,0x3dbb4bc,0x74e781c,0x717dc85,0x13fbff9,0x4e3c47,0x51f26f8,0x9a26d4,0x13c6214,0x6aaf4bd,0x34c2090,0x7d0b242,0x7752e34,0x5a4552d,0x1a149ea,0x5cb4845,0x246b6ad,0x7a24799,0x6c407a4,0x77ec983,0x16ba77c,0x497ad49,0x2ebe598,0x534231e,0x6c4f9a,0x3e0a073,0x1872622,0x62a6282,0x76f311d,0x7bdf999,0x689eecf,0x295e0df,0x14f3fdf,0x7076a0d,0x2be24ab,0x2da71fe,0x4f80a89,0x251e057,0x322e69a,0x16b2bbf,0x4ff5289,0x3f0e32d,0x16d527a,0x701e1ba,0x20c44cd,0x623e2e2,0x16002e9,0x579a9c7,0x10ce8db,0x6450074,0x455bc64,0x7d311bf,0x4dbfc29,0x59c8d4c,0x7543b60,0x12e5a94,0x3700305,0x5fcdf8,0x717918f,0x4940c85,0x189c0f8,0x9d944b,0x16ddc48,0x634fc61,0x593331f,0x263468f,0x31dc2c9,0x1f84ec6,0x70c419e,0x10d5691,0x2735f36,0x7480514,0x5ede7db,0x423b720,0x6c2692e,0x22904b,0x32b80de,0xbc4c03,0x2155403,0x687464f,0x3b84ebe,0x878c20,0x5f3741d,0x751f169,0x6188f1,0x6ae9086,0x14c446d,0xc057f7,0x3f9e770,0x7b50f01,0x6104f16,0x2579ffd,0x1671bb5,0x25ed079,0x45f06a5,0x8f792a,0x402218c,0x7ab1eec,0xf4c80,0x27fefa4,0x387d544,0x568a258,0x29da24e,0x20ee75b,0x6a74db8,0x44f51b0,0x14f9681,0x3bae8b,0x13420d5,0x27619a7,0x5864241,0xb2f50f,0x48d73de,0x7c2bab,0x49485f,0x46f8c7e,0x71d942a,0x4e7891c,0x62323d1,0x181d65c,0xc4b86f,0x4d0331b,0x7599b74,0x5896207,0x6cc77fa,0x54d4cbf,0x6129685,0x27c4625,0x9a510d,0x2cba43d,0x2ee86f9,0x69c06c3,0x9427e6,0x56e284b,0x2a34e16,0x12689d1,0x1b6aeba,0x7fd22a7,0x547a436,0x1ff185c,0x6351914,0x51c3532,0x286d9f1,0x864b5b,0x80716a,0x72cb23d,0x6679e95,0x534ee49,0x2497172,0x3c32234,0x323e3ec,0x7e6750a,0x3fdbf59,0xdea7bb,0x4ba2cdf,0x27fea89,0x4e69dc8,0x4781409,0x6a0415,0x31aedce,0x2db22c3,0x7c2f2f4,0xd78dcb,0x77b5521,0x472377,0xdf9f67,0x31647d5,0x1920ca,0x2ab9c6b,0x340c89d,0x321e9b0,0x476449e,0x4537447,0x4fd33ab,0x48f3087,0x4962f90,0x5f4a9b,0x5f0fba6,0x55a7b38,0x432f9ea,0x22cd9dc,0x524cdd1,0x3e10242,0x2b75ec3,0x79b098f,0x5bc685d,0xf8e66f,0x68cca72,0xa6c3c4,0x5244bcb,0x4ec557c,0x581e7b,0x462ca63,0x3070dc5,0x25fce06,0x78e740b,0x5fdfd60,0x437f083,0xffe489,0x6c6b517,0x411d983,0x3c9152c,0x41448e9,0x60833c3,0x71cf255,0x499c5d1,0x523caca,0x4e92636,0x13371a6,0x393d9da,0x608e9db,0xd25a16,0x56c2481,0x3e1e7f9,0x16ea093,0x2ebb28a,0x1d134b4,0x70ac086,0x3306cb,0x734053,0x6f31161,0x5cf70e5,0x5b31d29,0xa5fd3,0x2e4c16d,0x21c1e70,0x8ce7e3,0x58965c4,0x115764b,0x7e218d7,0x6481815,0x35f830a,0x6fad851,0x415cc9e,0x4667bad,0x67f23fb,0xcebc6a,0x69f7a10,0x496533,0x7114be2,0x2fa1f7,0x7545eb3,0x5799a9b,0x5b883d5,0x4db0d2b,0x30d0517,0x61a2d48,0x2f35fa3,0x4240c1,0x68e92f6,0x575ccf3,0x4933b25,0x56a20b7,0x55f7d7,0x1b6b755,0x78b329,0x3a746c2,0x7ca2fc5,0x7cb4f6f,0x7e2e2f0,0x79d3f10,0x7c204c1,0xea97ea,0x7fe039b,0x36602f8,0x562d036,0x4a3bcaf,0x717db8b,0x5027292,0x558cfb,0x169127f,0x56a7b81,0x438ed28,0x20bf27b,0x1797db7,0x10441d,0xf700c9,0x109bc1,0x6dfc58e,0x6a2fa19,0x4608c4a,0x5417c51,0x39be70f,0x68da436,0x5e9b14e,0x2ce412e,0xb6f71e,0x2e69e85,0x5c28ee0,0x7ecf45c,0x51d26f0,0x11442ac,0x17be9c6,0x48b5456,0x836963,0x756298e,0x376ae86,0xd43456,0x72a0d97,0x4bf4142,0xcefec6,0x6814369,0x5adf37f,0x55182d9,0x310b174,0x53e22dd,0xb1f8bd,0x2d0efee,0x55ea79c,0x364fb64,0x763976e,0x4a2eebf,0x2cc20ab,0x68d1634,0x2f67fa9,0x190e115,0x6462607,0x1af288f,0x4e4e393,0x271d707,0xb467f5,0x1c61455,0x3d3de48,0x6f81ed3,0xc8c13c,0x4b11854,0x624fe28,0x5b90ec9,0x201edfd,0x5d6f2b6,0x2b87a0a,0x222fcf,0x32607bc,0x6c30b15,0x22b6d7e,0xf8da4,0x74d2eb8,0x6d046e1,0x4d98a6b,0x27fd53,0x12662fd,0x6aa1fd6,0x498444a,0x6cd0adf,0x451a0d4,0x18f0606,0xcf045d,0x195e795,0x3afc84e,0x693d407,0x11aa1c6,0xb01416,0x7dfda83,0x6acb1cd,0x320d61e,0x82c022,0x11d4cbb,0x3acee56,0x5526958,0x34459b5,0x464554b,0x632b495,0x2cbea3,0x3ccf259,0xf643c5,0x6bfa1f,0x1d1d9b0,0x154db08,0x2523afc,0x437c34a,0x5072e17,0x122347d,0x34a3127,0x37b44b,0x6c08534,0x2aa5808,0x3afae59,0x445d921,0x2ab1de6,0x4d96d55,0x5431d,0x523dd2e,0x722f9d5,0x45734bb,0x6bc887f,0x25e1804,0x246af45,0x6768527,0x4585c73,0x64d365f,0x331e48c,0x614144b,0x939809,0x5b41f97,0x6fb4dff,0x3477273,0x1ea6539,0x3f338ec,0x8b6982,0x12ddbb2,0x7c30d5,0x7cd75be,0x55abc82,0xdaa31c,0xd76205,0x22a8473,0x75b80fb,0x679fc3,0x1e17971,0x4d24ffa,0x75c5862,0x557d559,0x74d22c6,0x8ca7ff,0x5991f9c,0x596145b,0x55a814,0x4f14d2a,0xd21cd,0x71a2d4d,0x5cbc7e8,0x2f29f4f,0x6a8e423,0x6811fd8,0x37db3f5,0x1905e43,0x1718e24,0x57df501,0x7aff1cc,0x3b3b3a6,0x18f7a26,0x13c210d,0x45f100b,0x6dc7596,0x6e97f37,0x48d4cc6,0x7f42bb5,0x1f899e9,0xfb9637,0x487f256,0x365863d,0x7597dd3,0xa58a45,0x729f6a4,0x5cb2199,0x17ae74c,0x7909c18,0x2b0b952,0xe0a171,0x693fc73,0x2b57c81,0x29b29b2,0x729b5e3,0x4edc9c,0x634c403,0x247701a,0x6eb82fc,0x2dde47e,0x311d474,0x24a7c70,0x4e015af,0x3ccf141,0x1993500,0x5fc84d5,0x507c2c3,0x2e110e8,0x311ecce,0x3c2471c,0x46b458f,0x16a5ee9,0x13b01df,0x1561ff8,0x38a77ef,0x7c75126,0x1ee8e7c,0x2a01a13,0x6d49243,0x2740959,0x5e3e5b5,0x165085e,0x4bc97de,0x43e9792,0xf454fd,0x455e7d0,0x4e3a904,0x1bb1eb0,0x48cd3d,0x6bead5e,0x71124c1,0x21e1d95,0x773d24e,0x2ed1663,0x6f9f032,0x515f6c8,0x6c67b09,0xb7f77e,0x74728d4,0x426e6ac,0x49a0529,0x35feaaf,0x69f9e7b,0x2869e17,0x5b0bfb5,0x4e7c4ef,0x487b0fe,0x6ee95d7,0x5768ac5,0x6c2e422,0x25bd1c6,0x7f6e275,0x9264a8,0x7eec1b9,0x14ff3b,0x20ea61e,0x3b6f38a,0x17cff30,0x6d28215,0x4af675b,0x3314fa9,0x2d66b59,0xc4e05a,0x3f83dc0,0x6fc0829,0x7d3a801,0x5f31349,0x5c3661b,0x33422b3,0x749d080,0x611ed27,0x4eb127e,0x7059df8,0x1fba41c,0x16a0e2d,0x4d8c23a,0x1c9a55d,0xb8e367,0x4a62a4b,0xf6f13c,0x221bf12,0x8008c8d,0x75e2d09,0x455af8a,0x4d86259,0x4a795b9,0x2829807,0x17db465,0x78cbc07,0x13e818b,0x36269fd,0x4aff55e,0x19a2b7f,0x3d8898a,0x22c8139,0x211b3e6,0x7a4a777,0x7cfa48,0x6c8e467,0x273d68,0x3736667,0x6bb2126,0x306f3ad,0x4bbcfd7,0x42980a6,0x536d6dc,0x1ecd05b,0x24750d6,0x7abe57d,0x7826152,0x280c017,0x29f696,0x972107,0x636de5f,0x4c6270c,0x20ec336,0x7cd3890,0x4f6695b,0x7d812cd,0x7d24295,0x56df8e8,0x32c234c,0x28e09ad,0x614a222,0x62cf3f4,0x320cc34,0x39f9351,0x6045d37,0x18aa271,0x60c4141,0x47379bc,0xb35036,0x5eb8ba7,0x7833692,0x3c19795,0x7558f4,0x4308d8e,0x74a896e,0x444ffec,0x60a9940,0x4f36b02,0x7a6fd03,0x72ed39f,0x5c394a4,0x6428ddc,0x4051209,0x77a7c23,0x25f8654,0x4d3200e,0x30a39d4,0x64905a1,0x3277ccb,0x1c8243,0x74d1181,0x2fa171e,0x294cbd4,0x50daf3c,0x51864c6,0x2db4e5,0x6b2f3a3,0x2ad69d9,0x9ab907,0x4990b7b,0x18e9ae6,0x5b0ebd3,0x7cf100e,0x288d15b,0x2d3038e,0x6e4bfe3,0x8a4d05,0x5765da3,0x411a39d,0x691532,0x32bdc9f,0x6529766,0x7a2da34,0x4441416,0x1b746be,0x298a23,0x60e37c3,0x7169326,0x5a74aab,0x109e47e,0x3e0d746,0x3ae10ca,0x1976153,0x6b1d570,0x44d0848,0x3d2c343,0x3264897,0x64f99df,0x297910d,0x7447561,0x3caafe6,0x71d154c,0x4a9d4e7,0x42baf5a,0x16658f,0x124dfa2,0x1bd6350,0x75e9084,0x795453,0x39e28d4,0x2f22307,0x5321fdc,0x2e85bdf,0x56fed28,0x6bee8d5};
+const int32_t iroots[]= {0x7c1ffe1,0x1cbd8f9,0x7a1df83,0x3adfe19,0x431d067,0x76492cb,0x7decffb,0x58fcaa4,0x3970837,0xe306c2,0x29e15f3,0x2933c18,0x37a3999,0x7e6d5d2,0x1a015c3,0x902919,0x1020f5e,0x57dfc2d,0x61e60eb,0x2bf7e38,0x18746a9,0x2dfdb5e,0x754b12a,0xc1aa16,0x4c4fc90,0x112ba75,0x84898a,0x27a0a79,0x173244c,0x4c37729,0x5e8195a,0x3d01886,0x4997e23,0x5266893,0x2e357e,0x615880,0x64ea00a,0x4cca38c,0x4439317,0x3d1252,0x7a63692,0x9a1e6f,0x74c3ce5,0x1a05500,0x21b2fe6,0xfd79af,0xf92690,0x1aaa99b,0x5f38b65,0x2726413,0x3ecb947,0x7aadc4e,0x6f03adb,0x17d2a79,0x41f9010,0x67a7f79,0x42788ef,0x3fbcc7b,0x5d760b2,0x6245a4b,0xece9a7,0xa8b9ee,0x300c624,0x3eac541,0x7c98e9e,0x143d221,0x3f4107c,0x6ed8dde,0x368e5f4,0x4b03de3,0x74e090c,0x7f944c,0x64cfc0f,0x2d1dc41,0x2805254,0x1b9139f,0x777afd9,0x2201d68,0x65404e2,0x52157b1,0x7d53f77,0x7492f3b,0x4311caf,0x71ed08c,0x8de4a4,0x39254e2,0x7757ff5,0x797debb,0x9d643c,0x7fef0bc,0x52c8671,0x6d6c54b,0x42e3a0,0x7e47d76,0x64076e9,0x6f0a9cb,0x314bb76,0x3136ce3,0x5fe2f6d,0x35a5c1,0x4dbd572,0x5fdd0ce,0x36a5236,0x67b5338,0x3d25168,0x7dd8b13,0x8139d1,0x2045439,0x5196fa7,0x6fed9e0,0x2b471de,0x43fc9c4,0x6cde761,0x2ff2e56,0x738804b,0x16c257,0x1aa1e9d,0xd026b6,0x7f0714f,0x5a42908,0x5a1c972,0x12aaced,0x6ea587e,0xc15624,0x1f14097,0x16aa511,0x3868c35,0x206144e,0x3b97384,0x3098b56,0x6fa9363,0x53dd617,0x7e56e7c,0x59ba960,0x7e86257,0x83267,0x3e99622,0x75b4e06,0x2172f17,0x2e6401e,0x7013cc7,0x5849aa6,0x20566d7,0x76b4f63,0x334e402,0x77371d3,0x6fb0e2c,0x1614fe3,0x1db6bc7,0x6148404,0x2d1a143,0x2dfbbac,0x57e66f8,0x79364fb,0x20e2143,0x46ffccf,0x4fcdcff,0x7fe6999,0x4a4cf19,0x597debe,0x29195e,0xc001d2,0x11126b0,0x7179699,0x78e92c0,0x5bd08a6,0xe98670,0x75ae5e,0x7a51118,0x13375ca,0x3d421f3,0x2f7f443,0x173bae6,0x1d1487c,0x1511eaa,0x5149fb5,0x5e7644b,0x3b16db5,0x534dbd4,0x1a4fb75,0x1fc822a,0x4446106,0x2c79d7f,0x330361a,0x14ea101,0x311b92e,0x16195bc,0x20e13ca,0x1471739,0x41e5fb,0x56a23f0,0x1420c43,0x28bb843,0xeb7e4f,0x6f891c3,0xdc4f06,0x795db6e,0x16ccde4,0xfea528,0xb2726a,0x11d5b31,0x11c42f,0x3b068e5,0x726c60f,0x1a64139,0x6340e1d,0x149adc1,0x42c6bb1,0x1478573,0x52e7062,0x57f5516,0x3f888cf,0x3a0db6d,0x22f1b58,0x5f18c91,0x6689baf,0x4ee2fc5,0x6e2d3da,0x137b576,0x62930cb,0x77fe670,0x338160b,0x209bd72,0xcc3fab,0x2b03d42,0x7a65202,0x531bd23,0x1a4af5a,0x7a38a4d,0x606fabd,0x3e4f8fb,0x4dbcc1d,0x730a647,0x49fa9a1,0x7daf97e,0x56d0bd0,0x2edcfcc,0x64257d6,0x2552a12,0x5c8e8a3,0x4610233,0x1149766,0x306a89d,0x5c84415,0x160c82,0x13ee864,0x66b255e,0xe85970,0x770efb4,0x2f8b042,0x7ae0443,0x62222d0,0x2a16143,0x40720dd,0x5165aa3,0x346dd1b,0x7235846,0x40440a8,0x1b8af7,0x4de1c15,0x43eddcd,0x5b88e8f,0x2cd11b8,0x19a616c,0xd54dc4,0x7818e97,0x77bb4a6,0x57b2610,0x2e5cacf,0x1cce6ed,0x602e7a5,0x2ba5bcb,0x4dd5a,0x64b5147,0x6db7630,0x55eb1eb,0x293d7b6,0x76dd81b,0x165f93e,0x5137908,0x5365bc4,0x767aef4,0x585b9dc,0x1ef697c,0x2b4b342,0x1358807,0x2789dfa,0xa8648d,0x331cce6,0x73d4792,0x68029a5,0x1dedc30,0x31a76e5,0xe46bd7,0x3927383,0x7b8b7a2,0x785d456,0x3748c23,0x74f0af2,0x27bbdc0,0x58be65a,0x6cddf2c,0x7c65176,0x6b26980,0x3b2ae51,0x15ab249,0x5f318a6,0x5645db3,0x2995da9,0x47a2abd,0x582105d,0x7f2b381,0x56e115,0x3ffde75,0x77286d7,0x3a2f95c,0x5a32f88,0x69ae44c,0x5aa6004,0x1f1b0eb,0x4cf100,0x4081891,0x741a80a,0x6b5bb94,0x1536f7b,0x7a07710,0xb00e98,0x20e8be4,0x77a73e1,0x449b143,0x17ab9b2,0x5ecabfe,0x745b3fe,0x4d67f23,0x7df6fb6,0x13f96d3,0x3de48e1,0x2141826,0xb9faed,0x58ea0cb,0x6f4a970,0xf5be63,0x609b13b,0x4e43d38,0x59eb972,0x26ecce2,0x1cd03a0,0x69423b9,0x7646bb6,0x6783f09,0x36df37c,0xea6e72,0x7a23209,0x491fcfc,0x6d3a56d,0xadc4a1,0x26572b5,0x32603d8,0x2eee42,0x3ac439d,0x1bcff8d,0x6f51726,0x288563a,0x6a1fd18,0x1de1d1f,0x5f5bb34,0x1001e47,0x694ad87,0x4111cd4,0x302ad78,0x696d442,0x4df1967,0x5b01faa,0x309f578,0x5278e03,0x543db56,0xfa95f4,0x6b2c022,0x56c1f22,0x1781132,0x440668,0x92cee4,0x1d79d7f,0x67ad9df,0x4215f8e,0x795b067,0x2cddce3,0x5161a69,0x36a52b8,0x6965885,0x83367e,0x13df85d,0x5fb868,0x5bb4954,0x236b7bc,0x660b617,0x25daad4,0x8cd1cd,0x314dbf,0x4b5df71,0x1570b44,0x6c59ded,0x767d92d,0x2e2d909,0x7b3c3ba,0x6c24008,0xea237c,0xb387e5,0x4264b45,0x3be6e40,0x302ae8,0x3b3973e,0x438769e,0x320e576,0x1d19005,0x597f6b5,0x74fbe93,0x4667d17,0x6faf18b,0x37fbcae,0x7223abd,0x5d5c57e,0x4769494,0x4f804f7,0x46645f2,0x433f017,0x79d25ba,0x78cc777,0x38eccfc,0x3438319,0x3824dd1,0x3c2c43b,0x49b5ece,0x37b4ad2,0x2552e07,0x13f8a10,0x53af869,0x1ca2b8f,0x7108886,0x65f6618,0x406d8ca,0x30dbb2,0x6db3348,0x79a26ca,0x78e329,0x2f190ce,0x1d78fdf,0x63c2c24,0x53af292,0x4946e9a,0x6027716,0x447a754,0x5752607,0x76bee98,0x6c0d068,0x2004ab1,0x45ed41c,0x170b461,0x4005b51,0x5881e9e,0x3c8b1a8,0x66c50a4,0x183d901,0x67ad700,0x247992d,0x66d7a9b,0x25772ec,0x93c967,0xf47917,0x3622c1,0x76d12e4,0x40bf847,0x2fde9d4,0x6cf5764,0x7c8ef22,0x21e458f,0x3b46bcc,0x1bc2d1c,0x37f3040,0x51a2d39,0x61b46d8,0xbff408,0x5f47142,0x140e102,0x5ba7d24,0x2e627d,0xfa0911,0x3788d52,0x5c1ff05,0x7535763,0x5f1d44a,0x1aa9622,0x4e7d515,0x77201df,0x4deec57,0x7b2c796,0x4d5860c,0x18160f8,0x112c033,0x2957a75,0x5c9fe83,0xf890e4,0x389f378,0x40cc434,0x81954f,0x79aefbf,0x53386da,0x19c3b9b,0x4031d76,0x230756c,0x2498af2,0x2a59155,0x143172c,0x29212d9,0x519a422,0x2cfe025,0x50fdcfa,0x463d72d,0x788abae,0xa36f7d,0x6449cb1,0x6dd205f,0x7eb9a72,0x3d650a7,0x3582b1a,0xe4eab5,0x437501b,0xbd8aa0,0x56a6ef4,0x1b26622,0x4dbb76a,0x42f3cbe,0x3b4f7b9,0x1502a91,0x66a9eae,0x453ef37,0x42128bb,0x6f81b83,0x25ab556,0xeb6cdb,0x1f3c83e,0x7d875de,0x64ab943,0x3bdebeb,0x5f25cd,0x1af689b,0x4d62362,0x798eacf,0x3f05c64,0x28ba25e,0x777b2fc,0x11d401e,0x52efc73,0x5792ea6,0x32eff3,0x251142e,0x673651b,0x368f486,0x76746fa,0x5549628,0x14f0c5e,0x7d44b1c,0x2e99b3b,0x2f450c5,0x56d342d,0x507e8e3,0xb4ee80,0x7e57dbe,0x4da8336,0x1b8fa60,0x4f7c62d,0x32edff3,0x5a279ad,0x8783de,0x3fcedf8,0x1bf7225,0x23e6b5d,0xd32c62,0x5b02fe,0x30e94ff,0x1f766c1,0x3bd0015,0xb77693,0x3d17273,0x78ca70d,0x440686c,0x7ec96f,0x216745a,0x74eafcb,0x38e8645,0x1f5bec0,0x6775d90,0x1fda2ca,0x4626cb0,0x4e133cd,0x1d50c0d,0x1ed5ddf,0x573f654,0x4d5dcb5,0x2940719,0x2fbd6c,0x29ed34,0x30b96a6,0x34c771,0x5f33ccb,0x33bd8f5,0x1cb21a2,0x76adefa,0x7d8096b,0x5813fea,0x7f9eaf,0x561a84,0x5baaf2b,0x6152fa6,0x2cb2925,0x3d87f5b,0x346302a,0x4fb0c54,0x146dedb,0x48e999a,0x7dac299,0x1391b9a,0x78505b9,0x5d588a,0x5f04c1b,0x5d57ec8,0x4297677,0x667d482,0x3520aa3,0x49f9604,0x6c37e76,0x7543fa,0x6844b9c,0x57f67fa,0x35a6a48,0x3299da8,0x3ac5077,0xa3d2f8,0x8037375,0x5e040ef,0x70b0ec5,0x35bd5b6,0x7491c9a,0x6385aa4,0x3293dc7,0x697f1d4,0x6065be5,0xfc6209,0x316ed83,0x1f012da,0xb82f81,0x4cddd4e,0x23e99e6,0x20eecb8,0x2e5800,0x105f7d8,0x409c241,0x73d1fa7,0x52b94a8,0x4d0b058,0x35298a6,0x12f7dec,0x68500d1,0x44b0c77,0x5f359e3,0x7ed00c6,0x133e48,0x76f9b59,0xb1d8c,0x5a62e3b,0x13f1bdf,0x28b753c,0x1136a2a,0x37a4f03,0x31a3b12,0x251404c,0x57b61ea,0x1626186,0x4a21552,0x367fad8,0x3db1955,0xbad72d,0x74a0883,0x13b84f8,0x2ec0939,0x1080fcf,0x514e99e,0x8e2db3,0x5e3e26c,0xf0db40,0x14352a3,0x7b932c4,0x646e151,0x31e56fd,0x3ac1831,0x70dab04,0x3c3686f,0x3456823,0x69cf7a3,0x21e1a4c,0x58df6a8,0x12d6dbe,0x561e5ee,0x6137185,0x3aaedb,0x4778812,0x6abe009,0x6c6fe22,0x697a118,0x396ba72,0x43fb8e5,0x4f01333,0x520ef19,0x2fa3d3e,0x2057b2c,0x668cb01,0x4350ec0,0x321ea52,0x5b78391,0x4f02b8d,0x5241b83,0x1167d05,0x5ba8fe7,0x1cd3bfe,0x7b32365,0xd84a1e,0x566d64f,0x54c8380,0x16e038e,0x7215e90,0x55146af,0x7163e9,0x68718b5,0x236de68,0xd8095d,0x75c75bc,0xa8822e,0x49c79c4,0x37a0dab,0x70669ca,0x6096618,0xdd44c,0x374b33b,0x11880ca,0x1258a6b,0x3a2eff6,0x6c5def4,0x67285db,0x44e4c5b,0x520e35,0x2840b00,0x69071dd,0x671a1be,0x4844c0c,0x180e029,0x1591bde,0x50f60b2,0x2363819,0xe7d2b4,0x7f4de34,0x310b2d7,0x7ac57ed,0x26beba6,0x268e065,0x7755802,0xb4dd3b,0x2aa2aa8,0xa5a79f,0x32fb007,0x6208690,0x79a603e,0xa67f06,0x5d77b8e,0x72a9dfc,0x7275ce5,0x2a7437f,0x348a43,0x785cf2c,0x6d4244f,0x776967f,0x40ec715,0x6179ac8,0x4ba8d8e,0x106b202,0x24de06a,0x76e67f8,0x1edebb6,0x4d01b75,0x1b4c9a2,0x3a9a38e,0x18b7ada,0x5bb50bc,0x5a3e7fd,0x1457782,0x3aacb46,0xdf062c,0x2de22d3,0x7fcbce4,0x32892ac,0x556e21b,0x3bc26e0,0x45251a8,0x557a7f9,0x1417acd,0x7ca4bb6,0x4b7ceda,0x6dfcb84,0x2fad1ea,0x3ca3cb7,0x5afc505,0x6ad24f9,0x6302651,0x79605e2,0x70bbc3c,0x4350da8,0x7d5415e,0x1cf4b6c,0x39daab6,0x4bda64c,0x2af96a9,0x45511ab,0x6e4b346,0x77f3fdf,0x4e129e3,0x1554e34,0x22257e,0x751ebeb,0x6e75e3b,0x16e2bfa,0x45237b3,0x66c186c,0x732fba4,0x672f9fb,0x3b05f2d,0x134f522,0x369bbb7,0x157e02b,0x6db9d04,0x7da02ae,0x3287596,0x131b920,0xb4d149,0x7f2725d,0x5d69283,0x13ef4ec,0x4dbf845,0x7dfd032,0x54985f7,0x22b0d4b,0x6001204,0x248f138,0x1dd01d9,0x350e7ad,0x7393ec5,0x109e12e,0x42e21b9,0x63bebac,0x74d980c,0x59028fa,0x31d1c6e,0x652d772,0x1bbd9fa,0x6711eec,0x50b8058,0x174e9cd,0x535df56,0x35f1142,0x9e6893,0x49d049d,0x2a35865,0x5311013,0x7500744,0x2c3dd24,0x4f14e8d,0x2b07d28,0x2540c82,0x180bc98,0x733013b,0x342bebf,0xd7f26a,0x72dcbab,0x48b517b,0xabd673,0x77e969e,0x376abab,0x686163b,0x6edbd55,0x2e4d911,0x150ba5,0x23f7121,0x51b617c,0x74b08e3,0x533bed3,0x2184eb3,0x1745bcb,0x46618f2,0x2c083b0,0x3a173b7,0x15f05e8,0x1223a73,0x7f16440,0x70aff38,0x7f1bbe4,0x688824a,0x5f60d86,0x3c912d9,0x2978480,0x698ed82,0x7ac7306,0x2ff8d6f,0xea2476,0x35e4352,0x29f2fcb,0x49bfd09,0x3fc66,0x7176817,0x3ffb40,0x64c0f1,0x1f1d11,0x36b092,0x37d03c,0x45ab93f,0x7894cd8,0x64b48ac,0x7ac082a,0x297df4a,0x36ec4dc,0x28c330e,0x1736d0b,0x7bfbf40,0x50ea05e,0x1e7d2b9,0x4f4faea,0x326f2d6,0x2497c2c,0x2886566,0xada14e,0x7d25e0a,0xf0b41f,0x7b89ace,0x16285f1,0x7334397,0x182dc06,0x39b8454,0x3ec3363,0x10727b0,0x4a27cf7,0x1b9e7ec,0x1fe72a,0x6ec89b6,0x2789a3d,0x775181e,0x5e5e191,0x51d3e94,0x7f7a02e,0x24ee2d8,0x2328f1c,0x10eeea0,0x78ebfae,0x7cef936,0xf73f7b,0x630cb4d,0x5164d77,0x6935f6e,0x4201808,0x295db80,0x72fa5eb,0x1f91626,0x46e2627,0x6ce8e5b,0x318d9cb,0x2de3537,0x3683a30,0xe50dac,0x1f9cc3e,0x3edb718,0x438ead5,0x3f0267e,0x13b4aea,0x7021b78,0x3ca0f7e,0x20402a1,0x738bf6,0x5a231fb,0x4faf23c,0x39f359e,0x7a9e186,0x315aa85,0x2ddb436,0x75b3c3d,0x175358f,0x7091992,0x24597a4,0x66f672,0x54aa13e,0x420fdbf,0x2dd3230,0x5d52625,0x3cf0617,0x2a784c9,0x211045b,0x7a2b566,0x36bd071,0x372cf7a,0x304cc56,0x3ae8bba,0x38bbb63,0x4e01651,0x4c13764,0x5566396,0x7e8df37,0x4ebb82c,0x722609a,0x7badc8a,0x86aae0,0x72a7236,0x3f0d0d,0x526dd3e,0x4e71233,0x797fbec,0x389ebf8,0x31b6239,0x5821578,0x347d322};
+
+// TA public key in NTT format
+const int32_t H[]={0x377e3ac,0x2360cb0,0x5841181,0x3ef642b,0x4fb0d0,0x17c0de,0x76a2ab5,0x651d1a0,0x25498d,0x41f52e5,0x5c534e2,0x6f5e332,0x6b3c6b6,0x23afb52,0x36b5eb8,0x1714f92,0x5b1e345,0x308f251,0x45277e9,0x7fea756,0x197f90f,0x7f10e43,0xf136e5,0x53a546d,0x42e5ed3,0x3a83ce9,0x1be404f,0x4b423,0x7458a12,0x3990ae0,0x59ea53f,0x7120158,0x53c1e4c,0x2c26ded,0x55b3324,0x6c16736,0x40ed524,0x36e3f9e,0x548fd7d,0x25feb0,0x18b32c0,0x7b98356,0x1d9e22,0x1e791c3,0x4b4f653,0x2b9b5c0,0x13ac4cd,0x1fc4bd7,0x7196c5b,0x6cb7ab2,0x4a04d36,0x57486db,0x7972f4b,0x2a64ed2,0x30d6f31,0x64f0443,0x33352ca,0x4bef8bd,0x315c46a,0x4eb8b62,0x5de0c0b,0x22fdc7a,0x3ae7eae,0x78a3cfa,0x169ec52,0x64e725d,0x15dc340,0x3367ed3,0x1ee1ba7,0x39522fe,0x70a1973,0x655158c,0x5c91545,0x662d3c3,0x622e99e,0x6b42bcf,0x5ca7c85,0x42e93ac,0x325a086,0x408cc43,0x5801e57,0x4e412e9,0x2459d87,0x71a4ca4,0x3f1b0b0,0x7336021,0x48fef71,0x59c8427,0x63a89eb,0x731c8d6,0x460ccfa,0x6b9e8c0,0x36e542e,0x50a2334,0x1762a7f,0x5be94be,0x4ea626a,0x3ec7299,0x614a747,0x2d11f30,0x800f076,0x73486bc,0x26679e8,0x6880939,0x2541798,0x77ff34b,0x310136e,0x7a360f2,0x1b52ac0,0xfb887,0x65d6b54,0x469807d,0x252cb62,0xbff315,0x6fe7a1f,0x4244d2a,0x65d706f,0xc8ab7a,0x128a9c8,0x61e4e65,0xfde5a,0x392acb,0x1613400,0x5906fad,0x6e93932,0x75f599b,0x19424fe,0x5d2d30a,0x4337643,0x6800ec4,0x3eb06f9,0x3497960,0x7798f3e,0x39e1aa7,0x2193267,0x120d716,0x6754886,0x4c762c5,0x5934a21,0x3006633,0x489996f,0xbcddc3,0x325ed6b,0x1872a98,0x5025218,0x3aa692,0xd047cb,0x3abca42,0x286f6fd,0x68d9bee,0x7c3acbf,0x7576a73,0x52a1688,0x64000d,0x146fb7f,0x1b79c87,0x5b58168,0x55c2fd2,0x471a5ad,0x3369dda,0x3070579,0x70e70b7,0xa6b827,0x7dbe0ea,0x61f5222,0x3360d98,0x152c618,0x26a4008,0x41a8735,0x42645a7,0x7f20e6,0x166ce00,0x62298a2,0x2c845c3,0x2be2d6b,0x39baeff,0x631079a,0x6cf03c,0x69ebdb6,0x42baa1,0x32f120,0x2c18dbc,0x5214310,0x3f39556,0x518a26,0x58ee623,0x732d2a5,0x29ac71c,0x6716d00,0x1978ad1,0x1ea0cd9,0x273e4cf,0x4a7a364,0x97183e,0x30bf41c,0x6f84fdf,0xc9094b,0x5da21cf,0x65fb540,0x637a07b,0x9b89bb,0x2efb071,0x73366e2,0x77eccb4,0x3e37d2c,0x13600b5,0x24394a,0x4bb6252,0x5983c53,0x2bb7dd8,0x6307988,0x7165bd8,0x2bbdf23,0x3b1c2e8,0x5f9b60f,0xf31cc7,0x36ab176,0x55ae611,0x51b2830,0x4f6bc12,0xc3cd6c,0x7f01bfe,0x6eacd2,0x1783dfc,0x24917b6,0x4922140,0x25473d7,0x20b5b13,0x13fecc5,0x7a088cb,0x2e25cd7,0x58998c2,0x24e190c,0x443fe75,0x7a8dd11,0x5042d9,0xc65a71,0x4b5afa2,0x409924a,0x3cc3531,0x31a3358,0x72c9b5a,0x74e6a37,0x6aa6040,0x394f548,0x67d4c0d,0x21bb02a,0x74dfbea,0x455d831,0x58fe8f0,0x46b0c09,0x6edba4d,0x74c5063,0x37bf9a6,0x114d925,0x113c16c,0x35ab796,0x6fdd797,0xf80d49,0x3a613cf,0x6e34724,0x442c9ef,0x1301a7,0x7b9c20,0x46a65ce,0x709832b,0x526cf49,0x26f8134,0x5706dba,0x33605aa,0x246556d,0x2c173b1,0x16798c2,0x2f9e079,0x3936798,0x2b4b931,0x3012784,0x72fce5d,0x4708819,0x6e8f495,0x7690898,0x25d2691,0x12d163,0x5f46d2b,0x60d576d,0x5f51064,0x3a18110,0x5217918,0x974971,0x1758994,0x7c4b13d,0x5110b91,0x16c1dce,0x6223ae4,0x3c07fc3,0x2f83045,0x2ce96bd,0x1d50d92,0x61136dd,0x3b677b,0x321c168,0x2d3f3a5,0x12576be,0x365e366,0x33bb933,0x46e9b62,0x5ad0bea,0xe9ac84,0x6b944fd,0x1d302ab,0x602164b,0x5b42a5a,0x15e06b3,0x36e77e1,0x30f7efd,0x4e95aca,0x6d25558,0x4e81718,0x526febc,0x6a23e0c,0x4244242,0x2faf835,0x28a3a7f,0x1020b5e,0x56df169,0x2d714b7,0x1d2ec6c,0x1874d4,0x2b63c87,0x1356ac6,0x2c184d5,0x7240dfd,0x67d8856,0x4be1526,0x299f701,0x2e97da4,0x129357f,0x177d3a5,0xe5e47,0x76ae2c5,0x204cd26,0x3901b87,0x20c1960,0x296f293,0x137e972,0x5190f21,0x4c7bcc3,0x18cfa22,0xca6539,0x7d32bfb,0x6f0f842,0x7f495a8,0x15dae55,0x4648139,0x5682ad0,0x7c5c67c,0x3738cef,0x24d3245,0x1d9a985,0x40dcb42,0x24de229,0x5cc81f5,0x4d57b74,0x4d207a7,0x6c2860c,0x2a87b4e,0x5a44938,0x2e91fa8,0x42d9f49,0x3d95d1f,0x3a99a23,0x2f9a7c7,0x66a97e1,0x1d1d9fb,0x623b30e,0x1f1a5dc,0x852204,0x39843a8,0x6262e02,0x6aa8c16,0x75eaef7,0x71efd55,0x62ab01b,0x7721d13,0x76d859a,0x101f3f6,0x59fb8c1,0x207f290,0x31519b8,0x60f3b54,0x2884d1c,0x2de31a4,0x173afb9,0x4ed680,0x5e2f62f,0x7490c69,0x54ef3d6,0x607c8a3,0x5bb2e42,0x1af69b5,0x23c83a6,0x56447c9,0x7852be8,0x4a3613c,0x110b98e,0x235ae7e,0x31bdb3e,0xec48fd,0x33e0dfa,0x7c778c9,0x64aecdc,0x51b34dd,0x2e5175f,0x7011933,0x49ee13f,0x65cb8f,0x36cbd56,0x5064da7,0x1a80a67,0x1969517,0x6a38c63,0x7c28d6a,0x34bb2a,0x7a876f3,0x342f5e0,0x2fbb12f,0xb25fac,0x3ca6e83,0x15b9cba,0x103b4ff,0x408771e,0x31ee966,0xd7c7de,0x2d0bf76,0x9ab853,0x3a3f9af,0x606595e,0x69d221f,0x6dd45bd,0x33d0c1c,0x23888fb,0x22361ce,0x2e2fadb,0x1a1cc3f,0x7132901,0x2c817fa,0x4157f7c,0x55db333,0x2f0de77,0x38e10fd,0x214f489,0x174c758,0x3da51a5,0x572254a,0x1868348,0x77cc0b9,0x3ce6a12,0x1036ad3,0xd3d696,0x6b11906,0x22735d1,0x7425489,0x7a28d4b,0x4a8a808,0x1a22793,0x6529113,0x139b11f,0x4550de9,0x36be09,0x606ad5d,0x77c98df,0x156058a,0x4d506ca,0x12525aa,0x275e9d5,0x7b92544,0x672b0ff,0x931867,0x678a235,0x185cca6,0x51c77e3,0xb16f85,0x30e02e,0xcc5355,0x58115f,0x148f6e1,0x4262907,0x24b2b45,0x1893364,0x6de5df1,0x74b5ae3,0x7704a8c,0x1dc25a6,0x2bf9703,0x18ceba4,0x78ab580,0x3379bd1,0x588f134,0x15914ca,0x799f482,0x6ab968,0x515cea,0x71d79d1,0x721afda,0x2a39159,0x5e544c0,0x10dd915,0x19b99ec,0x63bb11a,0x15cd90,0x7c9c9e5,0x6b681f5,0x210488d,0x85108e,0x6d92960,0x4c90aa4,0xca81d4,0x75c0bc0,0x77791c,0x17a067b,0x78e440b,0x53a93ee,0x5405009,0x56c1820,0x6a15962,0x39f96cb,0x25d0ff7,0x5949b66,0x78c6d1b,0x6074dfd,0xd9d39e,0x708feac,0x5640323,0x3b17eb0,0x2c8973,0x2c8c4c0,0x5a9a13e,0x6884db7,0x439b45b,0x2106e9a,0xac5c79,0x5dae202,0x1310f16,0x18d049b,0x7f1c7f0,0x5b89ae1,0x52eff13,0x30e3bbe,0x5168608,0x6e7a9f,0x1dc283,0x561d17c,0x7c80555,0x717ce18,0x2758c12,0x33648e0,0x62cff39,0x27d70f5,0x8cdc0e,0x5e8ea65,0x895e62,0x170a599,0x183b830,0x5d7a6ee,0x5fde98c,0x6586b06,0x46856c6,0x801797c,0x60250b7,0x71c319e,0x33c7b1b,0xee0a74,0x4de1f09,0x16dfbcc,0x1f8eb70,0x602aebf,0x66aa4e5,0x1f28478,0x5f3705d,0x1d491fb,0x72f44e6,0x50b1b3,0x18f943c,0x324f3cf,0x3ccc236,0x23b2093,0x8c349a,0xe742c2,0x3c6c5f7,0x2958d29,0x69ac3b7,0x1e5f60a,0x596c48b,0x6aa31f2,0x66e668b,0x45a6166,0x55799e3,0x22e5e06,0x51134fe,0x4c2f853,0x226a6ce,0x1afae06,0x22293a7,0x3f8554,0x6aa7aa4,0x13cd0ab,0x1a95d67,0x6f597ae,0x4d86a24,0x4d86186,0x6c63795,0x51733f0,0x7413b68,0x2bf1065,0x7cef545,0x3885e35,0x5e25e1d,0x476285d,0x7802a69,0x2a3b758,0x4aad59c,0x9f8cc7,0x13abee1,0x10bce32,0x51d1e6e,0x600b6ba,0x683d9ec,0x5da71d0,0x9fdd65,0x513da62,0x5b89037,0x1f04ac9,0x663909,0x49eb4b4,0x6de306e,0x2c608c7,0x637b5ab,0x2b4569f,0x14fc96f,0x3fb247,0x2d0f06f,0x4d395f5,0x6139db3,0x7060a13,0xd23800,0x757718e,0x7bac474,0x485dbcd,0x2f7fc75,0x5470a51,0x22d83b,0x2c0e18c,0x1a38f32,0x319c112,0x315855f,0x5c1f68f,0x5c7d3ef,0x426d659,0x4c546ec,0x5650a59,0x7fcc7dc,0x5e85103,0xa5ff03,0x768adaa,0x3d725b0,0x5f2c4c5,0x326fedc,0xf862cd,0x3f7d1e3,0x2419447,0x78a5cba,0x5156c17,0x5b3100b,0x5bd5db3,0x57734e5,0x306c5b0,0x431a133,0x6710fda,0x5fb4bde,0x18a7d45,0x20e993e,0x418ff53,0x7c7ac7,0x2f67806,0x3d7aef8,0x6fcd3c5,0x2e57f8d,0x61835b9,0x1b79247,0x1a764e5,0x393e5dc,0x3c5095d,0x4df1e3d,0x16ed9e2,0x23ce993,0x4b8c002,0x56f37c7,0xb78b4e,0x772a665,0x4e174a3,0xe9d697,0x341d634,0x671c049,0x30070dc,0x6b661e6,0x4d962a3,0x5b6c05d,0x418723a,0x3ecca9f,0x4e75db9,0x1b84a70,0x192af1a,0x6e64168,0x6b20c83,0x7c4a4b,0x47d18b5,0x5ceb492,0x38cca1f,0x36fb59b,0x5f6f4d7,0x218d94a,0x429c411,0x3e20f8b,0xa2f49f,0x15be4e2,0x69a75b4,0x335cbd1,0x622e90b,0x58021b7,0x45cd581,0x2ecff8e,0x30dbf67,0x2b63d19,0x4e5d7d1,0xaa1122,0x4243cdf,0x4dbb9c,0x390acf9,0xdf1f53,0x78c38c0,0x253ebec,0x34ad12d,0x40ed99e,0x413f7ed,0x293108b,0x7233723,0x7571447,0x3f98a72,0x68cad3a,0xab5195,0x10af3f4,0x5d5abbb,0x677b7d0,0xaa5970,0x507f4e9,0x1529cde,0x4bd461d,0x564541a,0xa92a3f,0x1221af,0x33e8927,0x36abcda,0x15f434d,0x4e091ad,0x3d0dcab,0x6056a3f,0x22cb1ad,0x349f4c7,0x4703e5f,0xb53ee1,0x36f3b03,0x5695df,0x2e07e6d,0x7a5e49c,0x1dca3ae,0x314d93,0x2d93c87,0x187d956,0x7f49488,0x62b143f,0xe30574,0x19f61b9,0x40e298b,0x77801bd,0x456108e,0x7f7ace4,0x200b80b,0x3d8e631,0x4218d7a,0x10312bc,0x54462b,0x2466b11,0x5c38b9,0x7ab99de,0x7b8c192,0x5b5b75b,0x757bd87,0x5be9f20,0x887b68,0x47a624c,0x23f2c2f,0x2693e64,0x7a0e484,0x3635e7f,0x259d8d2,0x7c7dd8a,0x59abde1,0x3b4b658,0x605ef55,0x298b136,0x57655ab,0x8c5e54,0x2c4ce91,0x5820d2e,0x16911c8,0x38c421a,0x604a251,0x51c06e5,0x3c70a52,0x56a4ffd,0x605d5dd,0x2259b23,0x6a1e0d3,0x6384c16,0x2523d50,0x7f7374e,0x1992354,0x25a854b,0x3d33eb5,0x502b7bc,0x1a8a059,0x455b4ec,0xa4e7e5,0x4258fd7,0x6468d44,0x1845bef,0x52f9f4c,0x6e4e591,0x3681eea,0x711278c,0x255f6fb,0x77e6067,0x2625a0c,0x976464,0x69bd825,0x348c924,0x1eaee70,0x245a55f,0x4bb4e7d,0x7fb363f,0x56689fc,0x3155ef0,0xfdedbc,0x6ba113f,0x69aa598,0x3aa95c6,0x20475ae,0x204b624,0xc1cd31,0x5552a6,0x2e28e54,0x32ed92d,0x4c42445,0x2780720,0x7ec4fb3,0x62a791d,0xfca712,0x4fa24a2,0x4c1acb2,0x3a9b11a,0x3aaf977,0x2161312,0xb45b8b,0x5087b66,0x2ad83f4,0x2dc9633,0x3b1da6e,0x57e5881,0x2741763,0x63cd22,0x215e9b4,0x5614da5,0x217134b,0x66d5cc8,0x4a48a8e,0x664a46d,0x7fb33ca,0x2b4a5ce,0x646d5da,0x26d8854,0x274bde1,0x28668a6,0x6ac9b6d,0x17b17af,0x2a9c5f0,0x11d9aac,0x4e0908f,0x4e5ba9f,0x45c6a32,0x67cbfde,0x4fddb5a,0x7c0ab08,0x1f5c2f8,0x320b5cb,0x3b1fc26,0x667aa46,0x129e8b2,0x1d098e9,0x29635a2,0x78ab019,0x6b62e6f,0x390cb0b,0x4858319,0x3129817,0x3ec0f33,0x1a79dc2,0x1b32f49,0x58cb4cd,0x30ccc0,0x5ef2398,0x5f282b0,0x4804dfc,0x3156aaf,0x5fef5b5,0x6cd995f,0x7c2d048,0x5d967cc,0x2bfd61c,0x7496c44,0x96d5f6,0x2f2ce2,0x6ef6f06,0x1704980,0x466a39,0x210aef4,0x7242fde,0x6bcf42d,0x2584d1b,0x708da42,0x195f6b,0x6a6b70f,0x43fea69,0x3043fc,0x3b5c396,0x29d78df,0x29f5748,0x31ca59a,0x46f93c,0x703582f,0x115bf,0x43fac3,0x5029494,0x64e518a,0x5267f1e,0x6f34a89,0x1b4c416,0x15e4630,0x2d7eae7,0x55cd171,0x5fab087,0x11cc383,0x1eb2fbc,0x43e682d,0x430c7d9,0x60fa28,0x413ad72,0x4b56a22,0x6fbc498,0x1f8858a,0x238a96b,0x4869439,0x6f334e7,0x7c9737b,0x7634fdd,0x1dcb9f7,0x5be249a,0x5716fec,0x16cc3fb,0x291eb70,0x2c06aac,0x493f3b,0x4aba690,0x433c2d8,0x50a029d,0x376baa9,0x792ac7a,0x86f7a1,0x21ffc32,0x634fcc5,0x2ac6037,0x669a60a,0x3f6ae71,0xe3a783,0x70b68d5,0x4e415ce,0x15bdfe9,0x5211065,0x419f9a8,0xae2fed,0x57f38eb,0x4548482,0x1ac2eb6,0x76b3309,0x52c34a4,0x444e63a,0x18bd3f5,0x356572f,0x6d6fa48,0x3c1e8d7,0x4bae0e9,0x63bbdbd,0x1866492,0x5bfd368,0x3b9739a,0x24c216,0xf50471,0xd94777,0x5e2a3c7,0x767072b,0x36a5764,0x78888ac,0x5c6b3d5,0x38200b9,0x658ed81};
+
+//const int32_t H[]={52424332,86419331,100281829,26092113,31425049,44501326,22753073,25911274,32399324,52275749,82654901,112957555,7062995,72377240,59635533,2947678,23443436,11737345,24467451,83146335,60806975,83310820,52671905,50859759,46747981,123697787,42273843,53140943,132744737,23193929,55161079,88883569,30185251,15426898,10637871,6011655,47924241,64955761,97600115,94237518,123408389,65294538,91425157,39535266,67296739,35846403,114135997,17015834,84492896,118318790,123429403,97254014,119976388,119441899,69987419,22357274,13836478,99715640,8864885,97805755,989907,65769383,55337542,87376917,19609637,10589162,67727916,85356123,18263070,59254521,126168209,51233539,99698,48958079,97936146,84678921,34269358,122328672,97259374,18008647,48770962,116473697,131067647,120796592,34695112,132070906,85630497,94466376,44421174,94745700,104683424,85985627,70456618,82488252,6609853,118120182,9887156,95128290,74287744,65972735,116093844,90397373,105781092,81267675,47824996,17182203,92192736,73224256,14172570,26817363,101766600,57880921,119252825,29519272,57851033,100629940,91247239,110316721,127118676,47454805,15198736,93588873,91861761,116023232,119093487,75999855,45406328,2833127,98969504,116439286,121520408,127305365,134243779,101459576,86403802,27611155,133305973,89651114,1125832,76906685,69801243,120940569,128028546,91933707,77070197,34080494,5046436,101866359,96966064,49690507,128208599,105888911,131630254,23330239,51623014,6346113,129792069,42209429,37798608,124278266,43189912,38352552,93519575,5389657,39702635,97884097,110700562,54705611,116229619,62434923,124433437,105517671,100752396,97362328,126455555,21159148,5542264,48413029,22966322,13228484,133947423,39801261,124287483,36305722,123431838,101012364,129307403,125152359,131262913,64841473,117102988,54682368,110333297,117596464,90409186,48021946,58770261,28300887,74521533,115537872,2066913,72679842,92648376,94779373,50019904,34622343,93422624,113273797,95111397,88118762,60696715,81203606,77432432,111020166,73829036,108735877,73877602,71124764,81179850,118258267,101357992,30006004,90991921,36918520,111573417,65290828,25141260,74246924,39429006,5698526,127752863,119673924,43428974,26155101,80755282,133006106,37786815,19242105,95709873,13115771,67096487,18950767,14136188,16540678,72841015,132445350,74727888,34978150,54966701,75568253,133042029,87356538,14160641,115289370,50721712,60887488,114874297,40189801,118783177,79033409,25628073,86202718,123220958,78315831,129908154,3000567,122075976,51019479,14344667,96536064,20975064,125270612,7095488,2095571,118366518,88696041,49349421,102916376,77879043,90959260,49942433,428027,125026597,73734673,41470068,75050280,49152345,53421135,74573404,79797348,15822022,84838620,126135335,108604222,40269793,64323769,116591979,39143511,66043329,123308186,92142975,115991222,122992385,64152735,41516562,16472280,81250609,816025,105588493,75511207,51540932,101092200,58959708,103649482,25408188,2196171,46308717,85855626,43544673,21152673,31883599,29269620,122563584,133332028,17063666,60948372,14016273,14689030,25586454,129464115,50558555,12797097,48094136,110525720,46505184,66728736,86882082,55570781,81922957,122754743,100267365,51195568,9130045,30394901,68898169,11293130,30906247,11796641,30009770,40474754,124723788,15605488,95481047,112150212,44538708,30037242,68082669,37442145,86901110,117611103,88652182,10189372,107115246,101852173,18499596,18646227,40456333,109112707,2499886,84041509,128557219,97339579,54298690,69606243,64038161,35498763,120149516,106907488,90247483,55278888,83634890,26220477,133429657,134291341,67962165,102611987,78209219,123116708,56797777,38254315,99160685,40801077,18206523,90403438,96884501,89939923,90704566,21910498,96863340,74310984,70006448,59618015,72462291,25892069,48792519,39009680,112270430,98246423,14288031,112644070,57610566,19936956,117113146,4113978,95352569,65843878,71076167,60117679,104368912,31431216,128325629,67731501,86396140,72904827,2526590,24280599,71606365,115882957,41331204,131738828,13048050,26951535,42473681,133533473,132347619,112237258,100301245,45357069,82615782,55635866,26347114,106800099,26417572,30257513,24567678,5135738,89760357,35044991,14825144,51876073,133438263,112794022,66906734,33613612,36882667,131739622,69467978,76035891,46374841,69947815,65745578,60802087,107791076,27694285,103134164,28845134,56374995,74509691,100947666,54737872,54323629,104825279,49556397,61871432,59433417,92479810,24987343,44974886,78049016,74651793,131310946,123076389,23827503,32780498,122814008,79480358,40114679,108645752,87253173,9404390,59366696,103340339,18019654,58427436,123411247,122767531,131652653,47809513,11144541,5752843,46843099,102556976,75448535,59479983,480938,72060011,53262583,47569127,44016601,99737548,93882,90568115,125891252,100707413,129054689,75033734,56539032,81405087,94330069,82153157,67532499,9491526,91445122,98746764,92748435,11353150,108185221,95930896,86017813,93240952,61593524,42085038,16326710,91788414,85454637,29872098,99011028,20484059,83394964,69324195,99411734,105075731,115515854,13107968,3151274,116415188,53388904,27922677,90743194,50739983,90526394,40100406,24557502,122469465,9448796,74346179,122853371,96645823,20797293,21796784,17831658,100620993,25724587,44474440,8978677,13041919,81777314,48999282,55225918,53423365,32435528,127865706,6035767,73795793,34329857,43814229,129737792,112993171,82456892,100149457,101046923,9289912,842669,48983587,13059687,52470541,107864607,84227225,93233687,100768545,35983862,870451,56516996,66492244,42498661,22827895,132301563,98181621,127415837,130962310,91690763,39579876,102838246,73002957,27520870,79902536,109099537,70100599,67404515,85171687,20839391,115692911,101263743,48151238,133222895,90560286,23163955,76381570,85319617,63920745,57533283,68552278,102196222,45415213,53857986,36768339,60276613,42065347,125247831,76921630,118795162,5625373,3957099,21966915,16302433,78977029,83766933,37129994,17584516,79728873,70427663,70318518,116880832,111313395,94814779,29607742,125560375,72161564,66793202,120260029,127389909,10856241,111280397,103232081,108534252,45177642,109019188,134030253,22175887,63692449,4583502,112333582,33559936,15382241,68806714,110237657,59022733,10049406,117621209,20779886,96265824,58020339,91107100,18143953,129938028,120462121,23174953,1853276,41683620,71851681,121856823,23228953,97023774,42359166,109928096,50358377,27446342,86838794,96642231,66162861,87324702,10930841,121426415,110874157,84267068,55521942,89330885,79477413,104738166,41448239,9766281,5536060,65502203,18636018,40694365,106741558,63866525,34428645,48266013,119154354,87977344,111527653,68282956,132818766,113079857,91591643,39605275,26903585,93499204,68370597,43074923,21116811,47554947,100290988,13870353,67740156,36807943,117425171,113689190,114013167,9937281,34877307,85405469,131081591,66007357,49059664,98025400,8767865,14576411,103236582,99445632,110099846,71281841,77048977,126786994,58575748,26596444,89739571,20955683,132876433,118667531,55147207,126801934,30893304,51321294,65044602,5095993,50913997,1406190,115366977,24235264,13092365,51233323,93031369,129137885,37818994,72279792,92816397,41378017,37364616,16238111,133460582,110347273,46407959,35479797,64835662,61359683,94233975,98957066,39355213,67191078,116498323,33078316,91548094,106687690,133815897,53234284,67269353,35150304,103754008,85412263,78524363,21045548,96386411,81989943,80050053,82811384,97906219,14005136,113759288,122132932,17473929,92158016,74354590,85904482,55482271,118792296,67893009,35983939,115208180,84319300,8243647,3502033,134105132,131316195,6765964,129838929,18525476,94367510,127521896,114149960,53215231,107103561,32255750,127880023,113386704,33825514,34011551,46595177,84069299,113510736,55747635,13819979,64645821,39384625,16222866,32371103,119221772,99078413,111369857,97914167,36588680,7455259,3702310,61940999,44387690,80253318,56683185,79371780,99339643,110962059,27852371,14540752,84924345,44302826,92089672,29492836,92093272,33269678,120013054,41046690,104201099,28993849,59305427,75835453,100200239,65646558,126623243,3520446,28324976,105534807,129508010,123353332,105880886,127733718,133979673,32160414,129291675,40933549,70296420,19048568,76255625,87293490,72641469,84016402,17848394,52294772,50389475,102702919,27821913,67439374,102533264,98482214,85705482,80113799,63600325,16279678,24898624,74353543,124272522,122242063,4028236,111188658,112359413,96597406,17966994,12783736,86405629,90175003,120958474,65608160,7444914,84236262,123690589,7546562,64583839,104967000,24321391,32261932,56983422,48997040,105859075,69691436,88623611,48312043,105486076,71322824,5799394,122765063,103791846,34983369,69364859,34664304,58895391,86120655,93269113,79150599,44867189,13453528,12029236,50455252,60398380,103790686,99086202,120580468,99994872,44394436,5726310,40284169,38535660,99370987,39951542,65839277,119647299,48073185,34637029,17412488,103910610,11569532,91895875,9599888,50820116,118427843,43949183,42999693,117697835,42914867,83367243,41310186,71618340,117707086,18664027,121014994,41796657,25957978,64076656,35553428,30792208,74815321,41034239,460930,94049175,115342314,100500760,112292800,8626756,50883476,54784229,9666235,88038534,93654719,113248418,42712121,84292206,101330205,105685153,78431032,32876904,67004528,10022085,54387564,104851782,103709360,27848793,46759222,29489160,81116087,9317969,100822045,22376412,83562083,110182728,39320209,61871848,60538388,102540813,56651003,129293924,531836,92131342,33698785,61250227,108880159,19767189};
+// random 128 bytes
+const byte rkey[]={103,198,105,115,81,255,74,236,41,205,186,171,242,251,227,70,124,194,84,248,27,232,231,141,118,90,46,99,51,159,201,154,102,50,13,183,49,88,163,90,37,93,5,23,88,233,94,212,171,178,205,198,155,180,84,17,14,130,116,65,33,61,220,135,112,233,62,161,65,225,252,103,62,1,126,151,234,220,107,150,143,56,92,42,236,176,59,251,50,175,60,84,236,24,219,92,2,26,254,67,251,250,170,58,251,41,209,230,5,60,124,148,117,216,190,97,137,249,92,187,168,153,15,149,177,235,241,179};
+
+/* Montgomery stuff */
+
+static int32_t redc(uint64_t T)
+{
+    uint32_t m=(uint32_t)T*(uint32_t)ND;
+    return ((uint64_t)m*PRIME+T)>>32;
+}
+
+static int32_t nres(uint32_t x)
+{
+    return redc((uint64_t)x*R2MODP);
+}
+
+static int32_t modmul(uint32_t a,uint32_t b)
+{
+    return redc((uint64_t)a*b);
+}
+
+/* NTT code */
+/* Cooley-Tukey NTT */
+static void ntt(int32_t *b)
+{
+    int m,i,j,k,t=DEGREE/2;
+    int32_t S,U,V,q=PRIME;
+
+    for (j=0;j<DEGREE;j++)
+        b[j]=nres(b[j]);
+
+    m=1;
+    while (m<DEGREE)
+    {
+        k=0;
+        for (i=0;i<m;i++)
+        {
+            S=roots[m+i];
+            for (j=k;j<k+t;j++)
+            {
+                U=b[j];   
+                V=modmul(b[j+t],S);
+                b[j]=U+V;
+                b[j+t]=U+2*q-V;
+            }
+            k+=2*t;
+        }
+        t/=2;
+        m*=2;
+    }
+}
+
+/* Gentleman-Sande INTT */
+static void intt(int32_t *b)
+{
+    int m,i,j,k,n,t=1;
+    int32_t S,U,V,W,q=PRIME;
+    int lim;
+
+    m=DEGREE/2;
+    n=LGN;
+
+
+    while (m>=LIM)
+    {
+        n--;
+        k=0;
+        for (i=0;i<m;i++)
+        {
+            S=iroots[m+i];
+            for (j=k;j<k+t;j++)
+            {
+
+                U=b[j]; 
+                V=b[j+t]; 
+                b[j]=U+V;    
+                W=U+DLQ-V; 
+                b[j+t]=modmul(W,S); 
+            }
+            k+=2*t;
+        }
+        t*=2;
+        m/=2;
+    }
+
+    while (m>1)
+    {
+        lim=LIM>>n;
+        n--;
+        k=0;
+        for (i=0;i<m;i++)
+        {
+            S=iroots[m+i];
+
+
+            for (j=k;j<k+lim;j++)
+            {
+                U=modmul(b[j],ONE);  
+                V=modmul(b[j+t],ONE); 
+                b[j]=U+V;    
+                W=U+DLQ-V; 
+                b[j+t]=modmul(W,S);
+            }
+
+            for (j=k+lim;j<k+t;j++)
+            {
+                U=b[j]; 
+                V=b[j+t]; 
+                b[j]=U+V;    
+                W=U+DLQ-V; 
+                b[j+t]=modmul(W,S);
+            }
+            k+=2*t;
+        }
+        t*=2;
+        m/=2;
+    }
+
+    t=DEGREE/2;
+    for (j=0;j<t;j++)
+    {
+
+        if (j<LIM/2)
+        { // need to knock back excesses. Never used if L=1.
+            U=modmul(b[j],ONE);  
+            V=modmul(b[j+t],ONE); 
+        }
+        else
+        {
+            U=b[j];
+            V=b[j+t];
+        }
+        W=U+DLQ-V; 
+        b[j+t]=modmul(W,invpr); 
+        b[j]=modmul(U+V,inv);
+
+    }
+
+    for (j=0;j<DEGREE;j++)
+    {
+        b[j]=redc((uint64_t)b[j]);  
+        b[j]=b[j]-q;
+        b[j]+=(b[j]>>31)&q;
+    }
+}
+
+// polynomial functions
+/* reduces inputs < 2q */
+static void poly_soft_reduce(int32_t *poly)
+{
+    int i;
+    int32_t e;
+    for (i=0;i<DEGREE;i++)
+    {
+        e=poly[i]-PRIME;
+        poly[i]=(e+((e>>31)&PRIME));  //**
+    }
+}
+
+/* fully reduces modulo q */
+static void poly_hard_reduce(int32_t *poly)
+{
+    int i;
+    int32_t e;
+    for (i=0;i<DEGREE;i++)
+    {
+        e=modmul(poly[i],ONE);
+        e=e-PRIME;
+        poly[i]=e+((e>>31)&PRIME);
+    }
+}
+
+// multiply two polynomials in frequency domain
+static void poly_mul(int32_t *p1,int32_t *p2,int32_t *p3)
+{
+    int i;
+    for (i=0;i<DEGREE;i++)
+        p1[i]=modmul(p2[i],p3[i]);
+    poly_hard_reduce(p1);
+}
+
+static void poly_add(int32_t *p1,int32_t *p2,int32_t *p3)
+{
+    int i;
+    for (i=0;i<DEGREE;i++)
+        p1[i]=(p2[i]+p3[i]);    //**
+}
+
+static void poly_sub(int32_t *p1,int32_t *p2,int32_t *p3)
+{
+    int i;
+    for (i=0;i<DEGREE;i++)
+        p1[i]=(p2[i]+PRIME-p3[i]);  //**
+}
+
+// shorten, but round to VBITS
+static void poly_shorten(int32_t *p)
+{
+    int i;
+    for (i=0;i<DEGREE;i++) {
+        p[i]/=(1<<(UBITS-VBITS-1));
+        if ((p[i]&1) == 1) {
+            p[i]>>=1;
+            p[i]+=1;
+        } else {
+            p[i]>>=1;
+        }
+    }
+}
+
+static void poly_lengthen(int32_t *p)
+{
+    int i;
+    for (i=0;i<DEGREE;i++)
+        p[i]*=(1<<(UBITS-VBITS));
+}
+
+static void hid(char *ID,int32_t *id)
+{ // hash identity to polynomial
+    sha3 SHA3;
+    char hash[4*DEGREE];
+    SHA3_init(&SHA3,SHAKE128);
+    int k,m,i=0;
+    while (ID[i]!=0)
+        SHA3_process(&SHA3,ID[i++]);
+    SHA3_shake(&SHA3,hash,4*DEGREE);
+
+    for (i=m=0;i<DEGREE;i++)
+    {
+        byte n=(byte)hash[m++];
+        uint32_t s=(uint32_t)n;
+        for (k=1;k<4;k++) {s<<=8; n=(byte)hash[m++]; s+=(uint32_t)n;}
+        s%=PRIME;
+        id[i]=(int32_t)s;
+        //if (id[i]>(PRIME/2)) id[i]-=PRIME;
+    }
+}
+
+// get n-th bit from byte array
+static int getbit(byte b[],int n)
+{
+    int wd=n/8;
+    int bt=n%8;
+    return (b[wd]>>bt)&1;
+}
+
+// centered binomial distribution
+static void CBD(byte bts[],int32_t *f)
+{
+    int a,b;
+    for (int i=0;i<DEGREE;i++)
+    {
+        a=getbit(bts,2*i);
+        b=getbit(bts,2*i+1);
+        f[i]=(PRIME+a-b)%PRIME; 
+    }
+}
+
+// hash internal key of length DEGREE/8 into external key of length 32 
+static void hdk(byte *ikey,byte *key) {
+    sha3 SHA3;
+    SHA3_init(&SHA3,SHA3_HASH256);
+    for (int i=0;i<DEGREE/8;i++) SHA3_process(&SHA3,ikey[i]);
+    SHA3_hash(&SHA3,(char *)key);
+}
+
+static void expand(byte *ikey,int32_t *key) {
+    int i,k,m;
+    byte next=0;
+    for (m=k=i=0;i<DEGREE;i++)
+    { // expand into polynomial
+        if (m==0)
+            next=ikey[k++];
+        key[i]=(next&1)*(PRIME/2); 
+        next>>=1; m++; m&=7;
+    }
+}
+
+static void shrink(int32_t *key,byte *ikey)
+{
+    int i,k,m;
+    byte next=0;
+    for (m=k=i=0;i<DEGREE;i++)
+    { // shrink into byte array
+        next+=((key[i]/(PRIME/2))&1)<<m; m++;
+        if (m==8) {
+            m=0;
+            ikey[k]=next; k++;
+            next=0;
+        } 
+    }
+}
+
+// array t has ab active bits per word
+// extract bytes from array of words
+static byte nextbyte32(int ab,int32_t *t,int &ptr, int &bts)
+{
+    int32_t r,w;
+    int left=ab-bts; // number of bits left in this word
+    int i=0;
+    w=t[ptr];
+
+    r=w>>bts;
+    while (left<8)
+    {
+        i++;
+        w=t[ptr+i];
+        r|=w<<left;
+        left+=ab;
+    }
+
+    bts+=8;
+    while (bts>=ab)
+    {
+        bts-=ab;
+        ptr++;
+    }
+    return (byte)r&0xff;        
+}
+
+// extract ab bits into word from dense byte stream
+static int32_t nextword(const int ab,byte t[],int &ptr, int &bts)
+{
+    int32_t r=t[ptr]>>bts;
+    int32_t mask=(1<<ab)-1;
+    int32_t w;
+    int i=0;
+    int gotbits=8-bts; // bits left in current byte
+    while (gotbits<ab)
+    {
+        i++;
+        w=(int32_t)t[ptr+i];
+        r|=w<<gotbits;
+        gotbits+=8;
+    }
+    bts+=ab;
+    while (bts>=8)
+    {
+        bts-=8;
+        ptr++;
+    }
+    w=r&mask;
+
+    return w;  
+}
+
+// pack ciphertext
+static int pack_ct(byte ct[],int32_t *u,int32_t *v)
+{
+    int ptr,bts,i,n=0;
+    ptr=bts=0;
+    for (i=0;i<ULEN;i++)
+        ct[n++]=nextbyte32(UBITS,u,ptr,bts);
+    ptr=bts=0;
+    for (i=0;i<VLEN;i++)
+        ct[n++]=nextbyte32(VBITS,v,ptr,bts);
+    return n;
+}
+
+// pack ciphertext and check its the same
+static int chk_pack_ct(byte ct[],int32_t *u,int32_t *v)
+{
+    int ptr,bts,i,n=0;
+    byte m,diff=0;
+    ptr=bts=0;
+    for (i=0;i<ULEN;i++) {
+        m=nextbyte32(UBITS,u,ptr,bts);
+        diff|=(m^ct[n++]);
+    }
+    ptr=bts=0;
+    for (i=0;i<VLEN;i++) {
+        m=nextbyte32(VBITS,v,ptr,bts);
+        diff|=(m^ct[n++]);
+    }
+    return diff;
+}
+
+// unpack ciphertext
+static void unpack_ct(int32_t *u,int32_t *v,byte pk[])
+{
+    int ptr,bts,i;
+    ptr=bts=0;
+    for (i=0;i<DEGREE;i++ )
+        u[i]=nextword(UBITS,pk,ptr,bts);
+    for (i=0;i<DEGREE;i++ )
+        v[i]=nextword(VBITS,pk,ptr,bts);
+}
+
+// ID is identity, ikey is input session key, ud/vt is ciphertext
+static void cpa_base_encrypt(char *ID,byte *ikey,int32_t *ud,int32_t *vd)
+{
+    int i,j;
+    int32_t rd[DEGREE],e[DEGREE];
+    byte sigma[32];
+    byte buff[256];
+    sha3 sh;
+
+    hdk(ikey,sigma);  // Use ikey as seed
+    SHA3_init(&sh,SHAKE256);
+    for (j=0;j<32;j++)
+        SHA3_process(&sh,sigma[j]); 
+    SHA3_process(&sh,0);
+    SHA3_shake(&sh,(char *)buff,256);
+    CBD(buff,rd);
+
+    for (i=0;i<DEGREE;i++)
+        e[i]=H[i];   // already in ntt format
+
+    ntt(rd);
+    poly_mul(ud,e,rd);
+    intt(ud);
+
+    SHA3_init(&sh,SHAKE256);
+    for (j=0;j<32;j++)
+        SHA3_process(&sh,sigma[j]); 
+    SHA3_process(&sh,1);
+    SHA3_shake(&sh,(char *)buff,256);
+    CBD(buff,e);
+
+    poly_add(ud,ud,e);
+    poly_hard_reduce(ud);
+
+// v=rt+e2+K
+    hid(ID,e);
+    ntt(e);
+    poly_mul(vd,e,rd);
+    intt(vd);
+
+    SHA3_init(&sh,SHAKE256);
+    for (j=0;j<32;j++)
+        SHA3_process(&sh,sigma[j]); 
+    SHA3_process(&sh,2);
+    SHA3_shake(&sh,(char *)buff,256);
+    CBD(buff,e); 
+
+    poly_add(vd,vd,e);
+    poly_soft_reduce(vd);
+
+    expand(ikey,e); // expand to polynomial - re-use e
+    poly_add(vd,vd,e);
+    poly_hard_reduce(vd);
+    poly_shorten(vd);
+
+//    pack_ct(ct,ud,vd);
+}
+
+// ID is identity, ikey is input session key, ct is ciphertext
+static void cpa_encrypt(char *ID,byte *ikey,byte *ct)
+{
+    int32_t ud[DEGREE],vd[DEGREE];
+    cpa_base_encrypt(ID,ikey,ud,vd);
+    pack_ct(ct,ud,vd);
+}
+
+// ID is identity, ikey is output session key, ct is ciphertext
+// This time checking that (ud,vd) does in fact compress to ct
+static byte cpa_check_encrypt(char *ID,byte *ikey,byte *ct)
+{
+    int32_t ud[DEGREE],vd[DEGREE];
+    cpa_base_encrypt(ID,ikey,ud,vd);
+    byte d=chk_pack_ct(ct,ud,vd);
+    if (d==0)
+        return 0;
+    else
+        return 0xff;
+}
+
+static void cpa_decrypt(const int16_t *csk,byte *ct,byte *ikey) {
+    int i;
+    int32_t sk[DEGREE];
+    int32_t u[DEGREE],v[DEGREE];
+    //byte ikey[DEGREE/8];
+
+    unpack_ct(u,v,ct);
+
+    for (int i=0;i<DEGREE;i++) {
+        sk[i]=(int32_t)csk[i];
+        if (sk[i]<0) sk[i]+=PRIME;
+    }
+    poly_lengthen(v);
+    ntt(sk);
+    ntt(u);
+    poly_mul(u,u,sk);
+    intt(u);
+    poly_sub(v,v,u);
+    poly_hard_reduce(v);
+
+    for (i=0;i<DEGREE;i++)
+    {
+        if (v[i]>(PRIME/4) && v[i]<((3*PRIME)/4)) v[i]=PRIME/2;
+        else v[i]=0;;
+    }    
+
+    shrink(v,ikey);
+}
+
+// encapsulate 32-byte key inside ciphertext ct
+void PQIBE_CCA_ENCRYPT(char *ID,octet *R32,octet *KEY,octet *CT)
+{
+    int i;
+    byte ikey[DEGREE/8],ss[32];
+    sha3 sh;
+    SHA3_init(&sh,SHAKE256);
+    for (i=0;i<R32->len;i++)
+        SHA3_process(&sh,R32->val[i]); 
+    SHA3_shake(&sh,(char *)ikey,128);
+    hdk(ikey,ss);
+
+    cpa_encrypt(ID,ikey,(byte *)CT->val);
+
+    for (i=0;i<32;i++)
+        CT->val[i+ULEN+VLEN]=(char)ss[i];
+    CT->len=ULEN+VLEN+32;
+
+    SHA3_init(&sh,SHA3_HASH256);
+    for (i=0;i<CT->len;i++)
+        SHA3_process(&sh,(unsigned char)CT->val[i]); 
+    for (i=0;i<DEGREE/8;i++)
+        SHA3_process(&sh,ikey[i]); 
+    SHA3_hash(&sh,KEY->val);
+    KEY->len=32;
+}
+
+// decapsulate 32-byte key inside ciphertext ct
+void PQIBE_CCA_DECRYPT(char *ID,const int16_t *csk,octet *CT,octet *KEY) {
+    int i;
+    byte ikey[DEGREE/8];
+    sha3 sh;
+    cpa_decrypt(csk,(byte *)CT->val,ikey);
+    byte mask=cpa_check_encrypt(ID,ikey,(byte *)CT->val); // make sure to generate the same ciphertext
+
+    for (i=0;i<DEGREE/8;i++)
+        ikey[i]^=(ikey[i]^rkey[i])&mask;    // if not substitute some nonsense
+
+    SHA3_init(&sh,SHA3_HASH256);
+    for (i=0;i<CT->len;i++)
+        SHA3_process(&sh,(unsigned char)CT->val[i]); 
+    for (i=0;i<DEGREE/8;i++)
+        SHA3_process(&sh,ikey[i]); 
+    SHA3_hash(&sh,KEY->val);
+    KEY->len=32;
+}
+/*
+int main() {
+    int i,m,k;
+    byte ikey[DEGREE/8],ikey2[DEGREE/8];
+    sha3 SHA3;
+    byte ct[4000];
+    byte key[32];
+    byte key2[32];
+    byte r32[32];
+
+    //for (i=0;i<128;i++)
+    //    printf("%d,",rand()%256);
+    //printf("\n");
+
+for (m=0;m<100;m++)
+{
+    for (i=0;i<32;i++) // create byte array with DEGREE bits for polynomial
+        r32[i]=rand()%256;
+
+//    for (i=0;i<DEGREE/8;i++) // create byte array with DEGREE bits for polynomial
+//        ikey[i]=rand()%256;
+
+//    cpa_encrypt(ID,ikey,ct);
+//    cout << "session key= ";
+//    for (i=0;i<32;i++) {
+//        cout << (int)ikey[i] << ",";
+//    }
+//    cout << endl;
+
+//    cpa_decrypt(csk,ct,ikey2);
+//    cout << "session key= ";
+//    for (i=0;i<32;i++) {
+//        cout << (int)ikey2[i] << ",";
+//    }
+//    cout << endl;
+
+
+
+    core::IBE_CCA_encrypt(ID,r32,key,ct);
+    printf("EK= ");
+    for (i=0;i<32;i++)
+        printf("%d,",key[i]); 
+    printf("\n");
+
+    core::IBE_CCA_decrypt(ID,csk,ct,key2);
+    printf("DK= ");
+    for (i=0;i<32;i++)
+        printf("%d,",key2[i]); 
+    printf("\n");
+
+    for (i=0;i<32;i++)
+    {
+        if (key[i]!=key2[i]) {printf("SCREAM\n"); exit(0);}
+    }
+
+}
+
+    return 0;
+}
+*/
\ No newline at end of file
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/lib/tls_cacerts.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/lib/tls_cacerts.cpp
new file mode 100644
index 0000000..c1abf3d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/lib/tls_cacerts.cpp
@@ -0,0 +1,3843 @@
+/*
+* JS update 29.02.2024
+* Vygenerovanovy novy root CA PQ algoritmus
+*/
+
+//
+// Certificate data stored here
+// CA root certificates
+//
+
+#include "tls_certs.h"
+
+// Root Certificate Store begins here
+
+// First cert is our own experimental hybrid p256+DILITHIUM2 root certificate, then a DILITHIUM3 root certificate (Remove to save memory)
+// Third is our own secp256r1 root certificate
+// after that all globaly accepted CAs
+
+const char *cacerts=(char *)
+#if CRYPTO_SETTING == HYBRID
+"-----BEGIN CERTIFICATE-----\n"                                       // Expires July 2023
+"MIIQITCCBk6gAwIBAgIUFJOOxlIuqQwRXFiAlXGzk64MtsIwCAYGK84PAgcBMBwx\n"
+"GjAYBgNVBAMMEVRpaWdlclRMUyByb290IENBMB4XDTIyMDcyMDEyMTgwOFoXDTIz\n"
+"MDcyMDEyMTgwOFowHDEaMBgGA1UEAwwRVGlpZ2VyVExTIHJvb3QgQ0EwggV0MAgG\n"
+"BivODwIHAQOCBWYAAAAAQQR1qVlmR79IAoiLtM0jEz96fYEXwJjP8FYNMI7gCYfk\n"
+"hFpUEt5Agd9NcGejbKP0H7fE77KWlzVmmmbshS5XLBtSwduuagf5T7cN+v8f11kt\n"
+"SpL1e90g7s/95soAAzRhen4LSbtGSrC+s6nUuoHHIKFgW8/DJ1dZ8PJr91fMxSjd\n"
+"YxN7e686prLPWxekJJoDfkwtvmX7O+wLdYdnDTikBTOqwL1JwXi72qOQTKjU+KRX\n"
+"Y8kO/hqJbPXhIoRZ3GI5CwHsPwXSm8tA4I2Pn7Vcw2lWBSzbFtmJGxdVe+C+Irf7\n"
+"m/o+SzrUybVpCchgUACfQfB12Xx4u+g41OikyUEBg/gS0Zfv+q+nOd26SBwkpVIA\n"
+"B0CT2A6n9l8NYvVgWRpCaGjGU9DVutfcVbTj0QH/UpI6Zm7ZiSORZUmkZ7UFaHn5\n"
+"2kec2fz1Bdfneh0FfcTOcrc6GI2BU9NL1IXUoRIBEHdoJ0p/Svc12RLA8hQ5KJoO\n"
+"GFjJzRbAq2bT77h8WV4LZG5mfB26xo+pm56gptIPm/MxFLBzv8wdsJNPEJxXBtY4\n"
+"clEuOdK40S+fcvLJLaJqmybmhGmg4Whk5LhdJW1+l7/DuNWPXkojmdYP95IICTim\n"
+"tPAcExGIt1SWHBMHU9Z/vq4ED3VxTWyrTKBegpWW/a6LjlB8ybGMQ40Wu13ecDND\n"
+"Ecf6Zg7TBeQbUk5peYzzdTZVmRVcaJ8KJuvVuvvVMh1+FOT7eBQb5zgZrd/ExGmR\n"
+"bFLUNzrLKTPXio9g+kU6I2m0meqF6kwisyQRfvdTI5WVqlVDqdlGa6ToW0JFB+6s\n"
+"My9GjAxur47xRczm+4dCnqq4ieJW/9jRgdeG+ZKK0Hzrr2QmFtSHAhz2BIlFbx9/\n"
+"Xo+dmmC284azvpASCvsRDUV2i3taZTxGwGR69Pyrz2XqwoYNantXffdwt/8oji3w\n"
+"i1gYLdzTsabh5pW7jyIbM8IHWE0/hQysxBLJ7oHicVokd0aRAVRUmxwjPS0Pd9E2\n"
+"+PwmWisRcONehx86r5Ncg4fMMHipprJJOrsZVgH7/zAfALfJdJ+8xFzDBqCY2dzI\n"
+"9tjoNkc04nK4b+tA2VZ02vdqlSLZSoqoKHJ1Qc4UIkjVwj+68IrZsdaZR/dvR1oU\n"
+"x4cLmgnAoPrijiVUfdsqmwvKOG9rHW4tL6iCbj1Er+pCR/oq4b+EhET9jyFAw9W4\n"
+"tXHdffWUReO54lO3FHZQry0RNilQdzSNKloVbuF5HgAhRtPx8QsWcoyV8c6UhK5B\n"
+"qe4WSyTdedU1849jeZ2FoH54fRMjD6/Hp1GjHFTxiEgZjXmSLMr1TgHioLPtwJPJ\n"
+"38rX80EVSg+g0VJyjcanGkrFtErzChqwXubBUbRAsEW2CR5YkpGfUz4zsF9PzhMz\n"
+"NuwhjuuUexWjDiwfpKLzxF29y0UBiEiLKbZrs8cUZ2uNzwJyTOZW5fmiSrFw4TiD\n"
+"tuvXCmYHLWnLQwSoIvqwcAA5/XUjDeHRKBgr04W23PBkgC74C2zIHZCygTGg4V3K\n"
+"2tZE7vkD+X0LGxpE+wxRW7dkG5jXhIu+gdHx1LzXixrWLggmlu1TVlaC43LBxBuM\n"
+"hbSRBtytcCm0HZMjTT1j8CgjH/lqWn+vnzoYqYxidUtWGg/JgoZ2SEyCfzQuJrPE\n"
+"4wvsLBa+R7q35eDVfpNS7KsNGLR8nJDIUU07vtEYkYXIDHGKBn5RUJUdnJ5Va/VZ\n"
+"mO5kHP6t9lbpQquaBuc/svk2lT/jQhEceUcyjZeiqk937MnYPasIdlAUgd0PlnOa\n"
+"AahcLpwGOR4MpobdkCY4mmFbW0BtV5Ov7xLPeOWoBDWtSWyE4TifFMliQqSiDCrQ\n"
+"5KNTMFEwHQYDVR0OBBYEFJiBzqjFIen1gYpKD1g4IWFYNawKMB8GA1UdIwQYMBaA\n"
+"FJiBzqjFIen1gYpKD1g4IWFYNawKMA8GA1UdEwEB/wQFMAMBAf8wCAYGK84PAgcB\n"
+"A4IJwQAAAABIMEYCIQD6W177TQalvXQk8Ieh2qY3NBzjD/xsq6DT2hSLkRVsHAIh\n"
+"ANXEXF6EUBiQ/2ZSKBprAA4zrd8zbblvgWxilWjGCFET2gyczt34tRhseXDXZitf\n"
+"z6ItHerKOY8lxfCmKP32o41tiivYu3Nq5O0u/1G75+79HcaA8QJYIX7zmzW37EGJ\n"
+"N4KnjJqMZDwmiOL4frA5KjgYpIaW1PTAj7+G2osOmYy4VSUDXSLB9PlaPjOo3inc\n"
+"sPtfVHq0yK8Rs1MimETpyWovtNV9Fpqo921l18nmnLElo9E8pwz04fnEkelrY838\n"
+"CpZc8MDb1pGaOuwD8CLRWyxHayGUkgONoNiGP/6GzkbOw0kEYUTOhLfgUgN4RVSD\n"
+"32jw8CO6nt2SOflaclMt0QDepxYkVutJPpRJYStVlfA9BBmmRG96q9AY+ircFoUd\n"
+"mQGbhcjVEZEcmEQK4yI+96T1jTXVz/lG1LHrRsCTsaywi+7fBH9uicNv44lOpBmx\n"
+"LVeP0j1jMTlVxTSHUR7zJQuLXA022HxMsnloDlx9xkFnzVWQAcjhF4fy9JoW2a98\n"
+"6VK8YBKxbZnslSgJEj15ysqcWBBmYKFdMJn/y6QDT3gyk/AMXEYkLxQ3xJzFmRop\n"
+"MpRokMSvz3OzLrWYQuwTp6CyE7AZoRN8RwIVr71OOgkAbegCIC2VvVwBNvluJ9J7\n"
+"GiROVItnasAHdznHhHTVUf7wtl1PnMsmnqFJVvT7VkfhRXJRwJ3N1devDYxU3gnW\n"
+"CZNVgNFZiq0OBGsXKKjQ/m/KhKAvy+O/TiD5SZnhGbJ/TaT8jZ4HnEf9J1W68jxj\n"
+"fyzHIudkJFKs92aMB3b23x6Lq9ROmKAHEOP+DyxNm+c+0waccGWwS3+UHy4P49ay\n"
+"JpnKA9SogHmpWoU8LJhYpDKXJqkqHmt89lZ9kMngQSh882m0HEK81nYO2DIqaoVH\n"
+"j6sMp7H0OUroo4Z/SIAWCe9xWrlPwJZgbOLTVqlngBYfsLjY0h91JdABbj6hsbol\n"
+"Oo8Gg+Uz5xGfAuS1enmaSMq0CJ8/RSmmVq8Xb8JNr414U8DYdprxa4sFvvrrQ6/J\n"
+"IXzXf/fNO60BzuR7nkUJm+WaSz9bYQmbeC/2oRa6zK+UDDUzi06s7fSaJK4CcVVH\n"
+"vACOF9d+HS1wnL6QVeeVp3ueZEuI1eClHtPjNMHEDrCWaDr2NZlldaSvJYsG/5v5\n"
+"+1SmdPNkHzOqlOGVOvko6/QmfxqnXfK2StFw4JvccL/hNm+QOrgPmCnIhLE718zt\n"
+"lXUbi6vbLeoyIk7CFytzjih6Xm/DyzStFFHjMT4zwuAar8tJp7Imtwzp60X4iuS2\n"
+"rtTnLdQ179MhCTxDCFwVwxi+YNr8hTCldi9zH+ORjR9WE3OceqeXOWFwfrVWrUn+\n"
+"lsnVkFxan9H55/GuACHjqAlrKldzvZwlEUXgFpWmZMIFt2BMWwkLH82AWPQalqmk\n"
+"a0PgkvKyzRHVxa0BizzkLXV5ZHwIasU0HMIzTP0paT/HBRWBsxJs0H/QU/nBtGEJ\n"
+"z9o0juGINqHnc69YxLAAvQ4en3aiG9DG/nh4h3SJd2bSpMyf9uQTKLb0eqRCOfVU\n"
+"8F6rrcd1Zdi3TfImrbIvVpuBZlZiUB10ghHkdZlhP/hRUEnaR50KkX5ZT38sGocJ\n"
+"iKjBBSQ2gmWyNeTxJDKph9p5h/Jh47bndii45CaH9l4D1GB69aZ+6NMPgIrc80gC\n"
+"a9sXO5j1K70bwvTHWnHkSkx/6Ojx2yZ+EAaQiE0ZVi32+GpozJ0VW+ihQPOCi6dn\n"
+"bjmgrAiaNMxR088hz2jnvvH+TlOH5qrXSCcAVCwuotiACI2uwPyRtm7EiUm9Z1qx\n"
+"OsS7aUBtF6ZJP0qJYncGsfNdYJX6c+JfeikEOEByVQJs0SHq3RAnCDOjKRiSz19i\n"
+"IfB1tbQUAw7ib5UbGH1DipiynbsdZU+EVD8BbZ7SL/vYqPJ7taWW1zpyRetGtIHd\n"
+"iqmm1+MphKEM8+TE6apR9Oq74xMqS9enUiRaZctnkCVUmGTDER/cuqSa3NkcVpnY\n"
+"upj3QB+mjgc3sjUjDUnz1fj9SicQef9MQJ1vj+We9fl12E0NkLSjta+kgncePWNl\n"
+"/d2BBy2UYMcNSg0haeIKhviLptt4LrIEGMhp5nuLMfotAyVqtpPdhJ8R9WWLXVJ4\n"
+"P3fclEkN4Y1GUDD8TTUPzVUSI+CN5BW8H85HYhKFSpiygYhVE5umeA440mfeGWOe\n"
+"vEA3kdF9SAtwjoO6Rc+kHcNZeUeG3M18eUbM3et/cRarLJvD+JV/r3EWmM/uXggo\n"
+"cgRYSHKb4Grjn7IK8UTlnkiyIs6M4eamN6q60JEmx+RnGUUH46kpQ9n7fahRyX6A\n"
+"Kshqjg9SI5Km7gflhnTYkpNA0T+AVc/nROOufVNb/2PYzKMBqzjvXXwxYniZTnct\n"
+"ph2X4EY02woJTcPKYg+w0zIMT3l7yD9l8j61PrcAxTUKVIpGIlZ4ikrGIlNgGrqw\n"
+"pjitfOmxr4XGQaN/dDo6Duy0n5DzSuWXnAqefjNJdedGIk210QlMR0sduSbEf/9Y\n"
+"dj8+eOy0A9zIkReDUzdgSQDXmyICm2y0BWOiJVRNCp17lA5RQ8egODahKEPFfyP+\n"
+"tZlqg2xhZxrL4oXMyo8AgnZO2rZfdFEA4ihl3uzFbwjC+e6G55MjO2Sso6/6lUyG\n"
+"xBI9gQ//PTH4d0XXi0w5sIDPw/SmZJtifk34MFEH535iIxB+EZ+ldwxBNCfNaeQo\n"
+"wxwxuhhsyx8y53VVoL99ZhDYoyU5KsvD+JANA+KSqfNsZPheFkQmTl9K8G4goK0v\n"
+"Lx7F33iTnEmA6ohwsEhGAX2VR1HPERExi4fENttR2XraU9j7Rxt1W+Oz7l6eiJfI\n"
+"qqqGsw5nYwyOIxUqHkbqDqBExu4gYzTAlXcRwIWPHIasJyMZPaZH6XD7HKCIDSXi\n"
+"ON7Vk4oPgNrpvRVGV3CeGNrdE1Yf9iY+KE6zKTcdBfi35UVucuHaX6vw0/pTUexY\n"
+"Xxi2hk5hwx0IhO5tqZX3//RxyP4AX44Sng2dlJ2hp/5D6E7DnCC3mQQ4xFWU3J34\n"
+"f4qm/SZ8C5hb1aryRT2DaezSO+4zeWfQgNGzo6NUl+9MWW04HjH439WLR9Cuoex3\n"
+"ITjj3ObhN0oJqnmCEeGB3vmQDIPcjSXDFxbxsPQGRIUXgAE4zvx4UUegrXUgAd82\n"
+"ffgD9UmJVAN0Acghi2UPkochIzdLYmNmaW+Q0dLxAQQJECgrMkBLYW+Mn8DX5OgC\n"
+"JS0zPFNlapKUlae3vL/EztHT1+z2D0dbXGFib42Ts7S4w9b4+wAAAAAAAAAAAAAA\n"
+"AA0eNEQ=\n"
+"-----END CERTIFICATE-----\n"
+#endif
+
+// JS tu sa pridava CA certifikat serveru
+// na zaciatok certifikatu musi byt pridany " a na koniec \n"
+// vhodny nastroj na upravu - https://phrasefix.com/tools/add-text-to-each-line/
+
+// CA certifikat FALCON512 
+#if CRYPTO_SETTING == POST_QUANTUM
+
+"-----BEGIN CERTIFICATE-----\n"
+"MIIHWTCCBLigAwIBAgIUG+osm3PoS09a/buahc+Kut/OMz8wBwYFK84PAwYwPDEL\n"
+"MAkGA1UEAwwCU0sxCzAJBgNVBAYTAlhYMRAwDgYDVQQIDAdNeVN0YXRlMQ4wDAYD\n"
+"VQQKDAVNeU9yZzAeFw0yNDAyMjgxMTE5NTBaFw0yNTAyMjcxMTE5NTBaMDwxCzAJ\n"
+"BgNVBAMMAlNLMQswCQYDVQQGEwJYWDEQMA4GA1UECAwHTXlTdGF0ZTEOMAwGA1UE\n"
+"CgwFTXlPcmcwggOPMAcGBSvODwMGA4IDggAJpwK8ODdXe4DRNKXwXvaawVk5sKyK\n"
+"HY7PW8KXghNCUtYxo+xSVNvj/wvpbfICiSpc7j24vSXdQSIi+B6ABqpos+KXhFBl\n"
+"nWjY8UKBHfyJMCya/ixoF0gFJNaPLCHO6EVIDF5jjeICVJitDxrdq3oZLL725rSm\n"
+"JYZ1aDCqSEZLNDFrWV/uQCGS5raLzVFFdY/JHdeVeehHgdoqWTBG4WjyabcKTYHE\n"
+"Y9RLpYZaUbCgOXACvWr37Fgnxh7Uy8OsgkIdeghqd5yWXyt6K7Mx9i+ky0WhEXXL\n"
+"5Bwfn7A1t9Q80p4OzNcXxoWcTXJdlAgZ810VgRnHRHStkbBWuEAXrAkgm9fGWj84\n"
+"CgJZBmtj3G9yCBgpGgSiCTqj5LA8+3MY3SUbMSaV5qxymhGpS0lGBINWhOWWEGGq\n"
+"jFlCFQ1EX6DQAx7suJI55oqmFEKONUsnLdRjEBVBUr3Prr7RCtQtFJ4QolSLQ+ei\n"
+"IlbKAi0VsH4g+qA7JOULNlMoRMi4n9zcN7RM/Wucg5kZyRgmoo0qYGOBsrJmgsRZ\n"
+"UqzVzGIWhBNCHjF1reufARpmKeNhj3bkrGu0004QYOd7Zwz5X4wgauiZh7LCL4fp\n"
+"CqZnFv4GGCnwCgoPyukXfbqprJte2+AYrR/XsZuthCl3oIafsTrmMMP4JBqgLdU5\n"
+"xMlFuCRSh5DM9KbGK2LIESJt1Rc4OOGHb2bLJIXcgB0k0HBgRXy1ANr1CQRHSMqs\n"
+"BHsRA5OlEzP0759WYcBqYxj+Fl2SE1DwAKWgFlTyxbSowrXyNUV7Q7XT159uBUp+\n"
+"uviqIwMHdCaq2BE1GrpL6XNYF29CTZL5FUZtIiTDfd5ARhA1SzQf+rrxVxQUJWaA\n"
+"nihoyFdMe6yJOQCl16PO3JMxmnVmJuLhtaKrZo7iqwTVVUKCYKr25AGd0WEE3FfS\n"
+"Ow5lmnrI0I8aHKJl2o91ZmpmwBOuvGkCc3rCSbIN81ewGDALGexqxqhlbEyfUi8k\n"
+"qQK4N9b357t/fACzmcmqYITWFeUQwmzVpJpxB8QOwXGzmtkUJim4yCPXHiAleceQ\n"
+"Yr5Z6LZ2UwsdFtJQeZsG44vWkuSQS9NVjHajyJXYc6ikIk3EhH7W1ueK0bmmnF2b\n"
+"85VKs/ACxLyQcbdNVqobV8MxoX7IYOB1u7miRGoDXBX+sLXfVUsOlHTq41Y6Vxw3\n"
+"CEOUzI/w7hqk73ejYzBhMB0GA1UdDgQWBBS2yijl2eQJyhYte0nSXjU/oWowbTAf\n"
+"BgNVHSMEGDAWgBS2yijl2eQJyhYte0nSXjU/oWowbTAPBgNVHRMBAf8EBTADAQH/\n"
+"MA4GA1UdDwEB/wQEAwIBhjAHBgUrzg8DBgOCApAAOWDxHTo0PfnpXCExhQjgj18e\n"
+"H+wfmb3dvRzUK3T6OmT2IyffthgO4pc7rC/9h3hiWXYGCqJHa6puMTfGfWnsUpmy\n"
+"dtFu1yU/e58TAjwF6y9/QqBaDs966IngUhVPGGs5E+SSZpdzjo4jmtS58ydp4YGn\n"
+"hyWdc2VfA5IhuDZ52PVsJ1m4FyrlQPgvm3WrUHm2ifperEV2RhMS10AYUy1aGmP1\n"
+"A0sHJ1DHCj0/Le2BlyjtCancW77ieEUt2v18qXpS8fushhfErMNHLzMeqcyUt0EL\n"
+"j8mg63t5uXcssLvfZlndhrMMO2CAZ3aQamb72l+Uy6QZTMVFWm4Gl3qJ+RXlVheB\n"
+"olujjJpVjma1GGMWe+pUbY7d7yOrNqFCYPp0LA4S3SaK0OQxov1j8TX6lpVTgqdt\n"
+"6dCAoxf5Vhfvqa5LOCuXOtMrGjGV2rJJqksBSKT+PyOBDfy0Wn5U9RDHyc82i5t0\n"
+"QEQg6VqrMwWbfchJvrFDSNima/7WPf1doXl2YhxvXXL3k+x96vBCCamxvnqH9xia\n"
+"Xb+rg5JvtG+caf5EiaIJEWqMJ5bA2sW/Fa+a5vD7E34OpfPb4HOEMb7/Ez76zYIr\n"
+"ys1WSw/eyG+Es4jmLBbFlzqAu1ASW//aK+5dBkFJRtn9RnyPyNmYfMJdSV9ydhal\n"
+"H1MORz2u/eNT83aCSZrTY61Uhgcawjcf6+KpUJ4wlPYBrUeILLfmS5sob4Uvg9se\n"
+"j+aiimkr+yQ9X5mwkdwXHvnSUFp+uQy7RSnksiFJy2r4GMUyNpHjz7RkTTzTDDZI\n"
+"zDystObzeu/BvSg5PtRPiW6zSbSDHFYvCuEo3f2CfvIiJa0ksE9f1B3cmKpQWFvR\n"
+"Ck+ggoPPTTdqBBjUwA==\n"
+"-----END CERTIFICATE-----\n"
+
+#endif
+#if CRYPTO_SETTING == TINY_ECC
+"-----BEGIN CERTIFICATE-----\n"                                       // Expires June 2023
+"MIIBjTCCATOgAwIBAgIUbraw40ya/lt/Pja8JrDeNgC1lk4wCgYIKoZIzj0EAwIw\n"
+"HDEaMBgGA1UEAwwRVGlpZ2VyVExTIHJvb3QgQ0EwHhcNMjIwNjI1MTcxNzUzWhcN\n"
+"MjMwNjI1MTcxNzUzWjAcMRowGAYDVQQDDBFUaWlnZXJUTFMgcm9vdCBDQTBZMBMG\n"
+"ByqGSM49AgEGCCqGSM49AwEHA0IABMYQS4Krd0v+41tWzgz6dDKT1FqW7KIMupeJ\n"
+"TwMraJkf4cmEd6gPVCJKFiUY9WKL64ONOTqmrg6DD+FjRWVWXuqjUzBRMB0GA1Ud\n"
+"DgQWBBSTV6Jk8SGIoDpFgRVa0ff/7IyadjAfBgNVHSMEGDAWgBSTV6Jk8SGIoDpF\n"
+"gRVa0ff/7IyadjAPBgNVHRMBAf8EBTADAQH/MAoGCCqGSM49BAMCA0gAMEUCIQDG\n"
+"3OZtZ2fflA/tvblnTuXSUrQW2QfZP9LGAjBuKMhvGQIgH3tvw6g21ZxTABZS4JMU\n"
+"G2i8HbvF7TswzTUkOGdeN+Y=\n"
+"-----END CERTIFICATE-----\n"
+#endif
+#if CRYPTO_SETTING == EDDSA
+"-----BEGIN CERTIFICATE-----\n"
+"MIIBmDCCARigAwIBAgIUON4MhGt/yJjaMwD8/bX17kZn9ikwBQYDK2VxMBwxGjAY\n"
+"BgNVBAMMEVRpaWdlclRMUyByb290IENBMB4XDTIzMDUwMTExMjM0OVoXDTI2MDEy\n"
+"NTExMjM0OVowHDEaMBgGA1UEAwwRVGlpZ2VyVExTIHJvb3QgQ0EwQzAFBgMrZXED\n"
+"OgBgs1wDOyR/QuqUugf+4fFcl74f4nxopVIHyp/z8rkwW5ej9Ns/tyWStC9FY1XU\n"
+"KOJOY/OLNVRsMQCjUzBRMB0GA1UdDgQWBBR2kOEcrMY3yjNjQ+dz4OHFT2UcbTAf\n"
+"BgNVHSMEGDAWgBR2kOEcrMY3yjNjQ+dz4OHFT2UcbTAPBgNVHRMBAf8EBTADAQH/\n"
+"MAUGAytlcQNzAJb1pnAheREXu/hQWVmCEEgu1JZPW1Ik4GDDE/isEziVRRRAbAXb\n"
+"KxQkfAha7YCg8vyfS6lCCLMdANDFSM6tfAqEvl+4z5RR79U6sNEMN0zcgoI1l94i\n"
+"IoVQUBMjZ+RCQeBJeQ+8nLehcCoSI5a4oTcSAA==\n"
+"-----END CERTIFICATE-----\n"
+#endif
+"-----BEGIN CERTIFICATE-----\n"                                       //   OU = GlobalSign ECC Root CA - R5 O  = GlobalSign CN = GlobalSign
+"MIICHjCCAaSgAwIBAgIRYFlJ4CYuu1X5CneKcflK2GwwCgYIKoZIzj0EAwMwUDEk\n"
+"MCIGA1UECxMbR2xvYmFsU2lnbiBFQ0MgUm9vdCBDQSAtIFI1MRMwEQYDVQQKEwpH\n"
+"bG9iYWxTaWduMRMwEQYDVQQDEwpHbG9iYWxTaWduMB4XDTEyMTExMzAwMDAwMFoX\n"
+"DTM4MDExOTAzMTQwN1owUDEkMCIGA1UECxMbR2xvYmFsU2lnbiBFQ0MgUm9vdCBD\n"
+"QSAtIFI1MRMwEQYDVQQKEwpHbG9iYWxTaWduMRMwEQYDVQQDEwpHbG9iYWxTaWdu\n"
+"MHYwEAYHKoZIzj0CAQYFK4EEACIDYgAER0UOlvt9Xb/pOdEh+J8LttV7HpI6SFkc\n"
+"8GIxLcB6KP4ap1yztsyX50XUWPrRd21DosCHZTQKH3rd6zwzocWdTaRvQZU4f8ke\n"
+"hOvRnkmSh5SHDDqFSmafnVmTTZdhBoZKo0IwQDAOBgNVHQ8BAf8EBAMCAQYwDwYD\n"
+"VR0TAQH/BAUwAwEB/zAdBgNVHQ4EFgQUPeYpSJvqB8ohREom3m7e0oPQn1kwCgYI\n"
+"KoZIzj0EAwMDaAAwZQIxAOVpEslu28YxuglB4Zf4+/2a4n0Sye18ZNPLBSWLVtmg\n"
+"515dTguDnFt2KaAJJiFqYgIwcdK1j1zqO+F4CYWodZI7yFz9SO8NdCKoCOJuxUnO\n"
+"xwy8p2Fp8fc74SrL+SvzZpA3\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                       //   OU = GlobalSign Root CA - R2 O  = GlobalSign CN = GlobalSign
+"MIIDujCCAqKgAwIBAgILBAAAAAABD4Ym5g0wDQYJKoZIhvcNAQEFBQAwTDEgMB4G\n"
+"A1UECxMXR2xvYmFsU2lnbiBSb290IENBIC0gUjIxEzARBgNVBAoTCkdsb2JhbFNp\n"
+"Z24xEzARBgNVBAMTCkdsb2JhbFNpZ24wHhcNMDYxMjE1MDgwMDAwWhcNMjExMjE1\n"
+"MDgwMDAwWjBMMSAwHgYDVQQLExdHbG9iYWxTaWduIFJvb3QgQ0EgLSBSMjETMBEG\n"
+"A1UEChMKR2xvYmFsU2lnbjETMBEGA1UEAxMKR2xvYmFsU2lnbjCCASIwDQYJKoZI\n"
+"hvcNAQEBBQADggEPADCCAQoCggEBAKbPJA6+Lm8omUVCxKs+IVSbC9N/hHD6ErPL\n"
+"v4dfxn+G07IwXNb9rfF73OX4YJYJkhD10FPe+3t+c4isUoh7SqbKSaZeqKeMWhG8\n"
+"eoLrvozps6yWJQeXSpkqBy+0Hne/ig+1AnwblrjFuTosvNYSuetZfeLQBoZfXklq\n"
+"tTleiDTsvHgMCJiEbKjNS7SgfQx5TfC4LcshytVsW33hoCmEofnTlEnLJGKRILzd\n"
+"C9XZzPnqJworc5HGnRusyMvo4KD0L5CLTfuwNhv2GXqF4G3yYROIXJ/gkwpRl4pa\n"
+"zq+r1feqCapgvdzZX99yqWATXgAByUr6P6TqBwMhAo6CygPCm48CAwEAAaOBnDCB\n"
+"mTAOBgNVHQ8BAf8EBAMCAQYwDwYDVR0TAQH/BAUwAwEB/zAdBgNVHQ4EFgQUm+IH\n"
+"V2ccHsBqBt5ZtJot39wZhi4wNgYDVR0fBC8wLTAroCmgJ4YlaHR0cDovL2NybC5n\n"
+"bG9iYWxzaWduLm5ldC9yb290LXIyLmNybDAfBgNVHSMEGDAWgBSb4gdXZxwewGoG\n"
+"3lm0mi3f3BmGLjANBgkqhkiG9w0BAQUFAAOCAQEAmYFThxxol4aR7OBKuEQLq4Gs\n"
+"J0/WwbgcQ3izDJr86iw8bmEbTUsp9Z8FHSbBuOmDAGJFtqkIk7mpM0sYmsL4h4hO\n"
+"291xNBrBVNpGP+DTKqttVCL1OmLNIG+6KYnX3ZHu01yiPqFbQfXf5WRDLenVOavS\n"
+"ot+3i9DAgBkcRcAtjOj4LaR0VknFBbVPFd5uRHg5h6h+u/N5GJG79G+dwfCMNYxd\n"
+"AfvDbbnvRG15RjF+Cv6pgsH/76tuIMRQyV+dTZsXjAzlAcmgQWpzU/qlULRuJQ/7\n"
+"TBj0/VLZjmmx6BEP3ojY+x1J96relc8geMJgEtslQIxq/H5COEBkEveegeGTLg==\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                      //   O  = SwissSign AG CN = SwissSign Gold CA - G2
+"MIIFujCCA6KgAwIBAgIJALtAHEP1Xk+wMA0GCSqGSIb3DQEBBQUAMEUxCzAJBgNV\n"
+"BAYTAkNIMRUwEwYDVQQKEwxTd2lzc1NpZ24gQUcxHzAdBgNVBAMTFlN3aXNzU2ln\n"
+"biBHb2xkIENBIC0gRzIwHhcNMDYxMDI1MDgzMDM1WhcNMzYxMDI1MDgzMDM1WjBF\n"
+"MQswCQYDVQQGEwJDSDEVMBMGA1UEChMMU3dpc3NTaWduIEFHMR8wHQYDVQQDExZT\n"
+"d2lzc1NpZ24gR29sZCBDQSAtIEcyMIICIjANBgkqhkiG9w0BAQEFAAOCAg8AMIIC\n"
+"CgKCAgEAr+TufoskDhJuqVAtFkQ7kpJcyrhdhJJCEyq8ZVeCQD5XJM1QiyUqt2/8\n"
+"76LQwB8CJEoTlo8jE+YoWACjR8cGp4QjK7u9lit/VcyLwVcfDmJlD909Vopz2q5+\n"
+"bbqBHH5CjCA12UNNhPqE21Is8w4ndwtrvxEvcnifLtg+5hg3Wipy+dpikJKVyh+c\n"
+"6bM8K8vzARO/Ws/BtQpgvd21mWRTuKCWs2/iJneRjOBiEAKfNA+k1ZIzUd6+jbqE\n"
+"emA8atufK+ze3gE/bk3lUIbLtK/tREDFylqM2tIrfKjuvqblCqoOpd8FUrdVxyJd\n"
+"MmqXl2MT28nbeTZ7hTpKxVKJ+STnnXepgv9VHKVxaSvRAiTysybUa9oEVeXBCsdt\n"
+"MDeQKuSeFDNeFhdVxVu1yzSJkvGdJo+hB9TGsnhQ2wwMC3wLjEHXuendjIj3o02y\n"
+"MszYF9rNt85mndT9Xv+9lz4pded+p2JYryU0pUHHPbwNUMoDAw8IWh+Vc3hiv69y\n"
+"FGkOpeUDDniOJihC8AcLYiAQZzlG+qkDzAQ4embvIIO1jEpWjpEA/I5cgt6IoMPi\n"
+"aG59je883WX0XaxR7ySArqpWl2/5rX3aYT+YdzylkbYcjCbaZaIJbcHiVOO5ykxM\n"
+"gI93e2CaHt+28kgeDrpOVG2Y4OGiGqJ3UM/EY5LsRxmd6+ZrzsECAwEAAaOBrDCB\n"
+"qTAOBgNVHQ8BAf8EBAMCAQYwDwYDVR0TAQH/BAUwAwEB/zAdBgNVHQ4EFgQUWyV7\n"
+"lqRlUX64OfPAeGZe6Drn8O4wHwYDVR0jBBgwFoAUWyV7lqRlUX64OfPAeGZe6Drn\n"
+"8O4wRgYDVR0gBD8wPTA7BglghXQBWQECAQEwLjAsBggrBgEFBQcCARYgaHR0cDov\n"
+"L3JlcG9zaXRvcnkuc3dpc3NzaWduLmNvbS8wDQYJKoZIhvcNAQEFBQADggIBACe6\n"
+"45R88a7A3hfm5djV9VSwg/S7zV4Fe0+fdWavPOhWfvxyeDgD2StiGwC5+OlgzczO\n"
+"UYrHUDFu4Up+GC9pWbY9ZIEr44OE5iKHjn3g7gKZYbge9LgriBIWhMIxkziWMaa5\n"
+"O1M/wySTVltpkuzFwbs4AOPsF6m43Md8AYOfMke6UiI0HTJ6CVanfCU2qT1L2sCC\n"
+"bwq7EsiHSycR+R4tx5M/nttfJmtS2S6K8RTGRI0Vqbe/vd6mGu6uLftIdxf+u+yv\n"
+"GPUqUfA5hJeVbG4bwyvEdGB5JbAKJ9/fXtI5z0V9QkvfsywexcZdylU6oJxpmo/a\n"
+"77KwPJ+HbBIrZXAVUjEaJM9vMSNQH4xPjyPDdEFjHFWoFN0+4FFQz/EbMFYOkrCC\n"
+"hdiDyyJkvC24JdVUorgG6q2SpCSgwYa1ShNqR88uC1aVVMvOmttqtKay20EIhid3\n"
+"92qgQmwLOM7XdVAyksLfKzAiSNDVQTglXaTpXZ/GlHXQRf0wl0OPkKsKx4ZzYEpp\n"
+"Ld6leNcG2mqeSz53OiATIgHQv2ieY2BrNU0LbbqhPcCT4H8js1WtciVORvnSFu+w\n"
+"ZMEBnunKoGqYDs/YYPIvSbjkQuE4NRb0yG5P94FW6LqjviOvrv1vA+ACOzB2+htt\n"
+"Qc8Bsem4yWb02ybzOqR08kkkW8mw0FfB+j564ZfJ\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                       //   O  = DigiCert Inc OU = www.digicert.com CN = DigiCert High Assurance EV Root CA
+"MIIDxTCCAq2gAwIBAgIQAqxcJmoLQJuPC3nyrkYldzANBgkqhkiG9w0BAQUFADBs\n"
+"MQswCQYDVQQGEwJVUzEVMBMGA1UEChMMRGlnaUNlcnQgSW5jMRkwFwYDVQQLExB3\n"
+"d3cuZGlnaWNlcnQuY29tMSswKQYDVQQDEyJEaWdpQ2VydCBIaWdoIEFzc3VyYW5j\n"
+"ZSBFViBSb290IENBMB4XDTA2MTExMDAwMDAwMFoXDTMxMTExMDAwMDAwMFowbDEL\n"
+"MAkGA1UEBhMCVVMxFTATBgNVBAoTDERpZ2lDZXJ0IEluYzEZMBcGA1UECxMQd3d3\n"
+"LmRpZ2ljZXJ0LmNvbTErMCkGA1UEAxMiRGlnaUNlcnQgSGlnaCBBc3N1cmFuY2Ug\n"
+"RVYgUm9vdCBDQTCCASIwDQYJKoZIhvcNAQEBBQADggEPADCCAQoCggEBAMbM5XPm\n"
+"+9S75S0tMqbf5YE/yc0lSbZxKsPVlDRnogocsF9ppkCxxLeyj9CYpKlBWTrT3JTW\n"
+"PNt0OKRKzE0lgvdKpVMSOO7zSW1xkX5jtqumX8OkhPhPYlG++MXs2ziS4wblCJEM\n"
+"xChBVfvLWokVfnHoNb9Ncgk9vjo4UFt3MRuNs8ckRZqnrG0AFFoEt7oT61EKmEFB\n"
+"Ik5lYYeBQVCmeVyJ3hlKV9Uu5l0cUyx+mM0aBhakaHPQNAQTXKFx01p8VdteZOE3\n"
+"hzBWBOURtCmAEvF5OYiiAhF8J2a3iLd48soKqDirCmTCv2ZdlYTBoSUeh10aUAsg\n"
+"EsxBu24LUTi4S8sCAwEAAaNjMGEwDgYDVR0PAQH/BAQDAgGGMA8GA1UdEwEB/wQF\n"
+"MAMBAf8wHQYDVR0OBBYEFLE+w2kD+L9HAdSYJhoIAu9jZCvDMB8GA1UdIwQYMBaA\n"
+"FLE+w2kD+L9HAdSYJhoIAu9jZCvDMA0GCSqGSIb3DQEBBQUAA4IBAQAcGgaX3Nec\n"
+"nzyIZgYIVyHbIUf4KmeqvxgydkAQV8GK83rZEWWONfqe/EW1ntlMMUu4kehDLI6z\n"
+"eM7b41N5cdblIZQB2lWHmiRk9opmzN6cN82oNLFpmyPInngiK3BD41VHMWEZ71jF\n"
+"hS9OMPagMRYjyOfiZRYzy78aG6A9+MpeizGLYAiJLQwGXFK3xPkKmNEVX58Svnw2\n"
+"Yzi9RKR/5CYrCsSXaQ3pjOLAEFe4yHYSkVXySGnYvCoCWw9E1CAx2/S6cCZdkGCe\n"
+"vEsXCS+0yx5DaMkHJ8HSXPfqIbloEpw8nL+e/IBcm2PN7EeqJSdnoDfzAIJ9VNep\n"
+"+OkuE6N36B9K\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                        //   O  = Digital Signature Trust Co. CN = DST Root CA X3
+"MIIDSjCCAjKgAwIBAgIQRK+wgNajJ7qJMDmGLvhAazANBgkqhkiG9w0BAQUFADA/\n"
+"MSQwIgYDVQQKExtEaWdpdGFsIFNpZ25hdHVyZSBUcnVzdCBDby4xFzAVBgNVBAMT\n"
+"DkRTVCBSb290IENBIFgzMB4XDTAwMDkzMDIxMTIxOVoXDTIxMDkzMDE0MDExNVow\n"
+"PzEkMCIGA1UEChMbRGlnaXRhbCBTaWduYXR1cmUgVHJ1c3QgQ28uMRcwFQYDVQQD\n"
+"Ew5EU1QgUm9vdCBDQSBYMzCCASIwDQYJKoZIhvcNAQEBBQADggEPADCCAQoCggEB\n"
+"AN+v6ZdQCINXtMxiZfaQguzH0yxrMMpb7NnDfcdAwRgUi+DoM3ZJKuM/IUmTrE4O\n"
+"rz5Iy2Xu/NMhD2XSKtkyj4zl93ewEnu1lcCJo6m67XMuegwGMoOifooUMM0RoOEq\n"
+"OLl5CjH9UL2AZd+3UWODyOKIYepLYYHsUmu5ouJLGiifSKOeDNoJjj4XLh7dIN9b\n"
+"xiqKqy69cK3FCxolkHRyxXtqqzTWMIn/5WgTe1QLyNau7Fqckh49ZLOMxt+/yUFw\n"
+"7BZy1SbsOFU5Q9D8/RhcQPGX69Wam40dutolucbY38EVAjqr2m7xPi71XAicPNaD\n"
+"aeQQmxkqtilX4+U9m5/wAl0CAwEAAaNCMEAwDwYDVR0TAQH/BAUwAwEB/zAOBgNV\n"
+"HQ8BAf8EBAMCAQYwHQYDVR0OBBYEFMSnsaR7LHH62+FLkHX/xBVghYkQMA0GCSqG\n"
+"SIb3DQEBBQUAA4IBAQCjGiybFwBcqR7uKGY3Or+Dxz9LwwmglSBd49lZRNI+DT69\n"
+"ikugdB/OEIKcdBodfpga3csTS7MgROSR6cz8faXbauX+5v3gTt23ADq1cEmv8uXr\n"
+"AvHRAosZy5Q6XkjEGB5YGV8eAlrwDPGxrancWYaLbumR9YbK+rlmM6pZW87ipxZz\n"
+"R8srzJmwN0jP41ZL9c8PDHIyh8bwRLtTcm1D9SZImlJnt1ir/md2cXjbDaJWFBM5\n"
+"JDGFoqgCWjBH4d1QB7wCCZAA62RjYJsWvIjJEubSfZGL+T0yjWW06XyxV3bqxbYo\n"
+"Ob8VZRzI9neWagqNdwvYkQsEjgfbKbYK7p2CNTUQ\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                          //   O  = Baltimore OU = CyberTrust CN = Baltimore CyberTrust Root
+"MIIDdzCCAl+gAwIBAgIEAgAAuTANBgkqhkiG9w0BAQUFADBaMQswCQYDVQQGEwJJ\n"
+"RTESMBAGA1UEChMJQmFsdGltb3JlMRMwEQYDVQQLEwpDeWJlclRydXN0MSIwIAYD\n"
+"VQQDExlCYWx0aW1vcmUgQ3liZXJUcnVzdCBSb290MB4XDTAwMDUxMjE4NDYwMFoX\n"
+"DTI1MDUxMjIzNTkwMFowWjELMAkGA1UEBhMCSUUxEjAQBgNVBAoTCUJhbHRpbW9y\n"
+"ZTETMBEGA1UECxMKQ3liZXJUcnVzdDEiMCAGA1UEAxMZQmFsdGltb3JlIEN5YmVy\n"
+"VHJ1c3QgUm9vdDCCASIwDQYJKoZIhvcNAQEBBQADggEPADCCAQoCggEBAKMEuyKr\n"
+"mD1X6CZymrV51Cni4eiVgLGw41uOKymaZN+hXe2wCQVt2yguzmKiYv60iNoS6zjr\n"
+"IZ3AQSsBUnuId9Mcj8e6uYi1agnnc+gRQKfRzMpijS3ljwumUNKoUMMo6vWrJYeK\n"
+"mpYcqWe4PwzV9/lSEy/CG9VwcPCPwBLKBsua4dnKM3p31vjsufFoREJIE9LAwqSu\n"
+"XmD+tqYF/LTdB1kC1FkYmGP1pWPgkAx9XbIGevOF6uvUA65ehD5f/xXtabz5OTZy\n"
+"dc93Uk3zyZAsuT3lySNTPx8kmCFcB5kpvcY67Oduhjprl3RjM71oGDHweI12v/ye\n"
+"jl0qhqdNkNwnGjkCAwEAAaNFMEMwHQYDVR0OBBYEFOWdWTCCR1jMrPoIVDaGezq1\n"
+"BE3wMBIGA1UdEwEB/wQIMAYBAf8CAQMwDgYDVR0PAQH/BAQDAgEGMA0GCSqGSIb3\n"
+"DQEBBQUAA4IBAQCFDF2O5G9RaEIFoN27TyclhAO992T9Ldcw46QQF+vaKSm2eT92\n"
+"9hkTI7gQCvlYpNRhcL0EYWoSihfVCr3FvDB81ukMJY2GQE/szKN+OMY3EU/t3Wgx\n"
+"jkzSswF07r51XgdIGn9w/xZchMB5hbgF/X++ZRGjD8ACtPhSNzkE1akxehi/oCr0\n"
+"Epn3o0WC4zxe9Z2etciefC7IpJ5OCBRLbf1wbWsaY71k5h+3zvDyny67G7fyUIhz\n"
+"ksLi4xaNmjICq44Y3ekQEe5+NauQrz4wlHrQMz2nZQ/1/I6eYs9HRCwBXbsdtTLS\n"
+"R9I4LtD+gdwyah617jzV/OeBHRnDJELqYzmp\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                       //   O  = DigiCert Inc OU = www.digicert.com CN = DigiCert Global Root CA
+"MIIDrzCCApegAwIBAgIQCDvgVpBCRrGhdWrJWZHHSjANBgkqhkiG9w0BAQUFADBh\n"
+"MQswCQYDVQQGEwJVUzEVMBMGA1UEChMMRGlnaUNlcnQgSW5jMRkwFwYDVQQLExB3\n"
+"d3cuZGlnaWNlcnQuY29tMSAwHgYDVQQDExdEaWdpQ2VydCBHbG9iYWwgUm9vdCBD\n"
+"QTAeFw0wNjExMTAwMDAwMDBaFw0zMTExMTAwMDAwMDBaMGExCzAJBgNVBAYTAlVT\n"
+"MRUwEwYDVQQKEwxEaWdpQ2VydCBJbmMxGTAXBgNVBAsTEHd3dy5kaWdpY2VydC5j\n"
+"b20xIDAeBgNVBAMTF0RpZ2lDZXJ0IEdsb2JhbCBSb290IENBMIIBIjANBgkqhkiG\n"
+"9w0BAQEFAAOCAQ8AMIIBCgKCAQEA4jvhEXLeqKTTo1eqUKKPC3eQyaKl7hLOllsB\n"
+"CSDMAZOnTjC3U/dDxGkAV53ijSLdhwZAAIEJzs4bg7/fzTtxRuLWZscFs3YnFo97\n"
+"nh6Vfe63SKMI2tavegw5BmV/Sl0fvBf4q77uKNd0f3p4mVmFaG5cIzJLv07A6Fpt\n"
+"43C/dxC//AH2hdmoRBBYMql1GNXRor5H4idq9Joz+EkIYIvUX7Q6hL+hqkpMfT7P\n"
+"T19sdl6gSzeRntwi5m3OFBqOasv+zbMUZBfHWymeMr/y7vrTC0LUq7dBMtoM1O/4\n"
+"gdW7jVg/tRvoSSiicNoxBN33shbyTApOB6jtSj1etX+jkMOvJwIDAQABo2MwYTAO\n"
+"BgNVHQ8BAf8EBAMCAYYwDwYDVR0TAQH/BAUwAwEB/zAdBgNVHQ4EFgQUA95QNVbR\n"
+"TLtm8KPiGxvDl7I90VUwHwYDVR0jBBgwFoAUA95QNVbRTLtm8KPiGxvDl7I90VUw\n"
+"DQYJKoZIhvcNAQEFBQADggEBAMucN6pIExIK+t1EnE9SsPTfrgT1eXkIoyQY/Esr\n"
+"hMAtudXH/vTBH1jLuG2cenTnmCmrEbXjcKChzUyImZOMkXDiqw8cvpOp/2PV5Adg\n"
+"06O/nVsJ8dWO41P0jmP6P6fbtGbfYmbW0W5BjfIttep3Sp+dWOIrWcBAI+0tKIJF\n"
+"PnlUkiaY4IBIqDfv8NZ5YBberOgOzW6sRBc4L0na4UU+Krk2U886UAb3LujEV0ls\n"
+"YSEY1QSteDwsOoBrp+uvFRTp2InBuThs4pFsiv9kuXclVzDAGySj4dzp30d8tbQk\n"
+"CAUw7C29C79Fv1C5qfPrmAESrciIxpg0X40KPMbp1ZWVbd4=\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                      //   O  = The USERTRUST Network CN = USERTrust ECC Certification Authority
+"MIICjzCCAhWgAwIBAgIQXIuZxVqUxdJxVt7NiYDMJjAKBggqhkjOPQQDAzCBiDEL\n"
+"MAkGA1UEBhMCVVMxEzARBgNVBAgTCk5ldyBKZXJzZXkxFDASBgNVBAcTC0plcnNl\n"
+"eSBDaXR5MR4wHAYDVQQKExVUaGUgVVNFUlRSVVNUIE5ldHdvcmsxLjAsBgNVBAMT\n"
+"JVVTRVJUcnVzdCBFQ0MgQ2VydGlmaWNhdGlvbiBBdXRob3JpdHkwHhcNMTAwMjAx\n"
+"MDAwMDAwWhcNMzgwMTE4MjM1OTU5WjCBiDELMAkGA1UEBhMCVVMxEzARBgNVBAgT\n"
+"Ck5ldyBKZXJzZXkxFDASBgNVBAcTC0plcnNleSBDaXR5MR4wHAYDVQQKExVUaGUg\n"
+"VVNFUlRSVVNUIE5ldHdvcmsxLjAsBgNVBAMTJVVTRVJUcnVzdCBFQ0MgQ2VydGlm\n"
+"aWNhdGlvbiBBdXRob3JpdHkwdjAQBgcqhkjOPQIBBgUrgQQAIgNiAAQarFRaqflo\n"
+"I+d61SRvU8Za2EurxtW20eZzca7dnNYMYf3boIkDuAUU7FfO7l0/4iGzzvfUinng\n"
+"o4N+LZfQYcTxmdwlkWOrfzCjtHDix6EznPO/LlxTsV+zfTJ/ijTjeXmjQjBAMB0G\n"
+"A1UdDgQWBBQ64QmG1M8ZwpZ2dEl23OA1xmNjmjAOBgNVHQ8BAf8EBAMCAQYwDwYD\n"
+"VR0TAQH/BAUwAwEB/zAKBggqhkjOPQQDAwNoADBlAjA2Z6EWCNzklwBBHU6+4WMB\n"
+"zzuqQhFkoJ2UOQIReVx7Hfpkue4WQrO/isIJxOzksU0CMQDpKmFHjFJKS04YcPbW\n"
+"RNZu9YO6bVi9JNlWSOrvxKJGgYhqOkbRqZtNyWHa0V1Xahg=\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                       //  OU = GlobalSign Root CA - R3 O  = GlobalSign CN = GlobalSign
+"MIIDXzCCAkegAwIBAgILBAAAAAABIVhTCKIwDQYJKoZIhvcNAQELBQAwTDEgMB4G\n"
+"A1UECxMXR2xvYmFsU2lnbiBSb290IENBIC0gUjMxEzARBgNVBAoTCkdsb2JhbFNp\n"
+"Z24xEzARBgNVBAMTCkdsb2JhbFNpZ24wHhcNMDkwMzE4MTAwMDAwWhcNMjkwMzE4\n"
+"MTAwMDAwWjBMMSAwHgYDVQQLExdHbG9iYWxTaWduIFJvb3QgQ0EgLSBSMzETMBEG\n"
+"A1UEChMKR2xvYmFsU2lnbjETMBEGA1UEAxMKR2xvYmFsU2lnbjCCASIwDQYJKoZI\n"
+"hvcNAQEBBQADggEPADCCAQoCggEBAMwldpB5BngiFvXAg7aEyiie/QV2EcWtiHL8\n"
+"RgJDx7KKnQRfJMsuS+FggkbhUqsMgUdwbN1k0ev1LKMPgj0MK66X17YUhhB5uzsT\n"
+"gHeMCOFJ0mpiLx9e+pZo34knlTifBtc+ycsmWQ1z3rDI6SYOgxXG71uL0gRgykmm\n"
+"KPZpO/bLyCiR5Z2KYVc3rHQU3HTgOu5yLy6c+9C7v/U9AOEGM+iCK65TpjoWc4zd\n"
+"QQ4gOsC0p6Hpsk+QLjJg6VfLuQSSaGjlOCZgdbKfd/+RFO+uIEn8rUAVSNECMWEZ\n"
+"XriX7613t2Saer9fwRPvm2L7DWzgVGkWqQPabumDk3F2xmmFghcCAwEAAaNCMEAw\n"
+"DgYDVR0PAQH/BAQDAgEGMA8GA1UdEwEB/wQFMAMBAf8wHQYDVR0OBBYEFI/wS3+o\n"
+"LkUkrk1Q+mOai97i3Ru8MA0GCSqGSIb3DQEBCwUAA4IBAQBLQNvAUKr+yAzv95ZU\n"
+"RUm7lgAJQayzE4aGKAczymvmdLm6AC2upArT9fHxD4q/c2dKg8dEe3jgr25sbwMp\n"
+"jjM5RcOO5LlXbKr8EpbsU8Yt5CRsuZRj+9xTaGdWPoO4zzUhw8lo/s7awlOqzJCK\n"
+"6fBdRoyV3XpYKBovHd7NADdBj+1EbddTKJd+82cEHhXXipa0095MJ6RMG3NzdvQX\n"
+"mcIfeg7jLQitChws/zyrVQ4PkX4268NXSb7hLi18YIvDQVETI53O9zJrlAGomecs\n"
+"Mx86OyXShkDOOyyGeMlhLxS67ttVb9+E7gUJTb0o2HLO02JQZR7rkpeDMdmztcpH\n"
+"WD9f\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                      //   O  = GlobalSign nv-sa OU = Root CA CN = GlobalSign Root CA
+"MIIDdTCCAl2gAwIBAgILBAAAAAABFUtaw5QwDQYJKoZIhvcNAQEFBQAwVzELMAkG\n"
+"A1UEBhMCQkUxGTAXBgNVBAoTEEdsb2JhbFNpZ24gbnYtc2ExEDAOBgNVBAsTB1Jv\n"
+"b3QgQ0ExGzAZBgNVBAMTEkdsb2JhbFNpZ24gUm9vdCBDQTAeFw05ODA5MDExMjAw\n"
+"MDBaFw0yODAxMjgxMjAwMDBaMFcxCzAJBgNVBAYTAkJFMRkwFwYDVQQKExBHbG9i\n"
+"YWxTaWduIG52LXNhMRAwDgYDVQQLEwdSb290IENBMRswGQYDVQQDExJHbG9iYWxT\n"
+"aWduIFJvb3QgQ0EwggEiMA0GCSqGSIb3DQEBAQUAA4IBDwAwggEKAoIBAQDaDuaZ\n"
+"jc6j40+Kfvvxi4Mla+pIH/EqsLmVEQS98GPR4mdmzxzdzxtIK+6NiY6arymAZavp\n"
+"xy0Sy6scTHAHoT0KMM0VjU/43dSMUBUc71DuxC73/OlS8pF94G3VNTCOXkNz8kHp\n"
+"1Wrjsok6Vjk4bwY8iGlbKk3Fp1S4bInMm/k8yuX9ifUSPJJ4ltbcdG6TRGHRjcdG\n"
+"snUOhugZitVtbNV4FpWi6cgKOOvyJBNPc1STE4U6G7weNLWLBYy5d4ux2x8gkasJ\n"
+"U26Qzns3dLlwR5EiUWMWea6xrkEmCMgZK9FGqkjWZCrXgzT/LCrBbBlDSgeF59N8\n"
+"9iFo7+ryUp9/k5DPAgMBAAGjQjBAMA4GA1UdDwEB/wQEAwIBBjAPBgNVHRMBAf8E\n"
+"BTADAQH/MB0GA1UdDgQWBBRge2YaRQ2XyolQL30EzTSo//z9SzANBgkqhkiG9w0B\n"
+"AQUFAAOCAQEA1nPnfE920I2/7LqivjTFKDK1fPxsnCwrvQmeU79rXqoRSLblCKOz\n"
+"yj1hTdNGCbM+w6DjY1Ub8rrvrTnhQ7k4o+YviiY776BQVvnGCv04zcQLcFGUl5gE\n"
+"38NflNUVyRRBnMRddWQVDf9VMOyGj/8N7yy5Y0b2qvzfvGn9LhJIZJrglfCm7ymP\n"
+"AbEVtQwdpf5pLGkkeB6zpxxxYu7KyJesF12KwvhHhm4qxFYxldBniYUr+WymXUad\n"
+"DKqC5JlR3XC321Y9YeRq4VzW9v493kHMB65jUr9TU/Qr6cf9tveCX4XSQRjbgbME\n"
+"HMUfpIBvFSDJ3gyICh3WZlXi/EjJKSZp4A==\n"
+"-----END CERTIFICATE-----\n"
+#ifdef POPULAR_ROOT_CERTS
+;
+#else
+
+"-----BEGIN CERTIFICATE-----\n"                                      //   CN = ACCVRAIZ1 OU = PKIACCV O  = ACCV
+"MIIH0zCCBbugAwIBAgIIXsO3pkN/pOAwDQYJKoZIhvcNAQEFBQAwQjESMBAGA1UE\n"
+"AwwJQUNDVlJBSVoxMRAwDgYDVQQLDAdQS0lBQ0NWMQ0wCwYDVQQKDARBQ0NWMQsw\n"
+"CQYDVQQGEwJFUzAeFw0xMTA1MDUwOTM3MzdaFw0zMDEyMzEwOTM3MzdaMEIxEjAQ\n"
+"BgNVBAMMCUFDQ1ZSQUlaMTEQMA4GA1UECwwHUEtJQUNDVjENMAsGA1UECgwEQUND\n"
+"VjELMAkGA1UEBhMCRVMwggIiMA0GCSqGSIb3DQEBAQUAA4ICDwAwggIKAoICAQCb\n"
+"qau/YUqXry+XZpp0X9DZlv3P4uRm7x8fRzPCRKPfmt4ftVTdFXxpNRFvu8gMjmoY\n"
+"HtiP2Ra8EEg2XPBjs5BaXCQ316PWywlxufEBcoSwfdtNgM3802/J+Nq2DoLSRYWo\n"
+"G2ioPej0RGy9ocLLA76MPhMAhN9KSMDjIgro6TenGEyxCQ0jVn8ETdkXhBilyNpA\n"
+"lHPrzg5XPAOBOp0KoVdDaaxXbXmQeOW1tDvYvEyNKKGno6e6Ak4l0Squ7a4DIrhr\n"
+"IA8wKFSVf+DuzgpmndFALW4ir50awQUZ0m/A8p/4e7MCQvtQqR0tkw8jq8bBD5L/\n"
+"0KIV9VMJcRz/RROE5iZe+OCIHAr8Fraocwa48GOEAqDGWuzndN9wrqODJerWx5eH\n"
+"k6fGioozl2A3ED6XPm4pFdahD9GILBKfb6qkxkLrQaLjlUPTAYVtjrs78yM2x/47\n"
+"4KElB0iryYl0/wiPgL/AlmXz7uxLaL2diMMxs0Dx6M/2OLuc5NF/1OVYm3z61PMO\n"
+"m3WR5LpSLhl+0fXNWhn8ugb2+1KoS5kE3fj5tItQo05iifCHJPqDQsGH+tUtKSpa\n"
+"cXpkatcnYGMN285J9Y0fkIkyF/hzQ7jSWpOGYdbhdQrqeWZ2iE9x6wQl1gpaepPl\n"
+"uUsXQA+xtrn13k/c4LOsOxFwYIRKQ26ZIMApcQrAZQIDAQABo4ICyzCCAscwfQYI\n"
+"KwYBBQUHAQEEcTBvMEwGCCsGAQUFBzAChkBodHRwOi8vd3d3LmFjY3YuZXMvZmls\n"
+"ZWFkbWluL0FyY2hpdm9zL2NlcnRpZmljYWRvcy9yYWl6YWNjdjEuY3J0MB8GCCsG\n"
+"AQUFBzABhhNodHRwOi8vb2NzcC5hY2N2LmVzMB0GA1UdDgQWBBTSh7Tj3zcnk1X2\n"
+"VuqB5TbMjB4/vTAPBgNVHRMBAf8EBTADAQH/MB8GA1UdIwQYMBaAFNKHtOPfNyeT\n"
+"VfZW6oHlNsyMHj+9MIIBcwYDVR0gBIIBajCCAWYwggFiBgRVHSAAMIIBWDCCASIG\n"
+"CCsGAQUFBwICMIIBFB6CARAAQQB1AHQAbwByAGkAZABhAGQAIABkAGUAIABDAGUA\n"
+"cgB0AGkAZgBpAGMAYQBjAGkA8wBuACAAUgBhAO0AegAgAGQAZQAgAGwAYQAgAEEA\n"
+"QwBDAFYAIAAoAEEAZwBlAG4AYwBpAGEAIABkAGUAIABUAGUAYwBuAG8AbABvAGcA\n"
+"7QBhACAAeQAgAEMAZQByAHQAaQBmAGkAYwBhAGMAaQDzAG4AIABFAGwAZQBjAHQA\n"
+"cgDzAG4AaQBjAGEALAAgAEMASQBGACAAUQA0ADYAMAAxADEANQA2AEUAKQAuACAA\n"
+"QwBQAFMAIABlAG4AIABoAHQAdABwADoALwAvAHcAdwB3AC4AYQBjAGMAdgAuAGUA\n"
+"czAwBggrBgEFBQcCARYkaHR0cDovL3d3dy5hY2N2LmVzL2xlZ2lzbGFjaW9uX2Mu\n"
+"aHRtMFUGA1UdHwROMEwwSqBIoEaGRGh0dHA6Ly93d3cuYWNjdi5lcy9maWxlYWRt\n"
+"aW4vQXJjaGl2b3MvY2VydGlmaWNhZG9zL3JhaXphY2N2MV9kZXIuY3JsMA4GA1Ud\n"
+"DwEB/wQEAwIBBjAXBgNVHREEEDAOgQxhY2N2QGFjY3YuZXMwDQYJKoZIhvcNAQEF\n"
+"BQADggIBAJcxAp/n/UNnSEQU5CmH7UwoZtCPNdpNYbdKl02125DgBS4OxnnQ8pdp\n"
+"D70ER9m+27Up2pvZrqmZ1dM8MJP1jaGo/AaNRPTKFpV8M9xii6g3+CfYCS0b78gU\n"
+"JyCpZET/LtZ1qmxNYEAZSUNUY9rizLpm5U9EelvZaoErQNV/+QEnWCzI7UiRfD+m\n"
+"AM/EKXMRNt6GGT6d7hmKG9Ww7Y49nCrADdg9ZuM8Db3VlFzi4qc1GwQA9j9ajepD\n"
+"vV+JHanBsMyZ4k0ACtrJJ1vnE5Bc5PUzolVt3OAJTS+xJlsndQAJxGJ3KQhfnlms\n"
+"tn6tn1QwIgPBHnFk/vk4CpYY3QIUrCPLBhwepH2NDd4nQeit2hW3sCPdK6jT2iWH\n"
+"7ehVRE2I9DZ+hJp4rPcOVkkO1jMl1oRQQmwgEh0q1b688nCBpHBgvgW1m54ERL5h\n"
+"I6zppSSMEYCUWqKiuUnSwdzRp+0xESyeGabu4VXhwOrPDYTkF7eifKXeVSUG7szA\n"
+"h1xA2syVP1XgNce4hL60Xc16gwFy7ofmXx2utYXGJt/mwZrpHgJHnyqobalbz+xF\n"
+"d3+YJ5oyXSrjhO7FmGYvliAd3djDJ9ew+f7Zfc3Qn48LFFhRny+Lwzgt3uiP1o2H\n"
+"pPVWQxaZLPSkVrQ0uGE3ycJYgBugl6H8WY3pEfbRD0tVNEYqi4Y7\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                        // O= FNMT-RCM OU= AC RAIZ FNMT-RCM
+"MIIFgzCCA2ugAwIBAgIPXZONMGc2yAYdGsdUhGkHMA0GCSqGSIb3DQEBCwUAMDsx\n"
+"CzAJBgNVBAYTAkVTMREwDwYDVQQKDAhGTk1ULVJDTTEZMBcGA1UECwwQQUMgUkFJ\n"
+"WiBGTk1ULVJDTTAeFw0wODEwMjkxNTU5NTZaFw0zMDAxMDEwMDAwMDBaMDsxCzAJ\n"
+"BgNVBAYTAkVTMREwDwYDVQQKDAhGTk1ULVJDTTEZMBcGA1UECwwQQUMgUkFJWiBG\n"
+"Tk1ULVJDTTCCAiIwDQYJKoZIhvcNAQEBBQADggIPADCCAgoCggIBALpxgHpMhm5/\n"
+"yBNtwMZ9HACXjywMI7sQmkCpGreHiPibVmr75nuOi5KOpyVdWRHbNi63URcfqQgf\n"
+"BBckWKo3Shjf5TnUV/3XwSyRAZHiItQDwFj8d0fsjz50Q7qsNI1NOHZnjrDIbzAz\n"
+"WHFctPVrbtQBULgTfmxKo0nRIBnuvMApGGWn3v7v3QqQIecaZ5JCEJhfTzC8PhxF\n"
+"tBDXaEAUwED653cXeuYLj2VbPNmaUtu1vZ5Gzz3rkQUCwJaydkxNEJY7kvqcfw+Z\n"
+"374jNUUeAlz+taibmSXaXvMiwzn15Cou08YfxGyqxRxqAQVKL9LFwag0Jl1mpdIC\n"
+"IfkYtwb1TplvqKtMUejPUBjFd8g5CSxJkjKZqLsXF3mwWsXmo8RZZUc1g16p6DUL\n"
+"mbvkzSDGm0oGObVo/CK67lWMK07q87Hj/LaZmtVC+nFNCM+HHmpxffnTtOmlcYF7\n"
+"wk5HlqX2doWjKI/pgG6BU6VtX7hI+cL5NqYuSf+4lsKMB7ObiFj86xsc3i1w4peS\n"
+"MKGJ47xVqCfWS+2QrYv6YyVZLag13cqXM7zlzced0ezvXg5KkAYmY6252TUtB7p2\n"
+"ZSysV4999AeU14ECll2jB0nVetBX+RvnU0Z1qrB5QstocQjpYL05ac70r8NWQMet\n"
+"UqIJ5G+GR4of6ygnXYMgrwTJbFaai0b1AgMBAAGjgYMwgYAwDwYDVR0TAQH/BAUw\n"
+"AwEB/zAOBgNVHQ8BAf8EBAMCAQYwHQYDVR0OBBYEFPd9xf3E6Jobd2Sn9R2gzL+H\n"
+"YJptMD4GA1UdIAQ3MDUwMwYEVR0gADArMCkGCCsGAQUFBwIBFh1odHRwOi8vd3d3\n"
+"LmNlcnQuZm5tdC5lcy9kcGNzLzANBgkqhkiG9w0BAQsFAAOCAgEAB5BK3/MjTvDD\n"
+"nFFlm5wioooMhfNzKWtN/gHiqQxjAb8EZ6WdmF/9ARP67Jpi6Yb+tmLSbkyU+8B1\n"
+"RXxlDPiyN8+sD8+Nb/kZ94/sHvJwnvDKuO+3/3Y3dlv2bojzr2IyIpMNOmqOFGYM\n"
+"LVN0V2Ue1bLdI4E7pWYjJ2cJj+F3qkPNZVEI7VFY/uY5+ctHhKQV8Xa7pO6kO8Rf\n"
+"77IzlhEYt8llvhjho6Tc+hj507wTmzl6NLrTQfv6MooqtyuGC2mDOL7Nii4LcK2N\n"
+"JpLuHvUBKwrZ1pebbuCoGRw6IYsMHkCtA+fdZn71uSANA+iW+YJF1DngoABd15jm\n"
+"fZ5nc8OaKveri6E6FO80vFIOiZiaBECEHX5FaZNXzuvO+FB8TxxuBEOb+dY7Ixjp\n"
+"6o7RTUaN8Tvkasq6+yO3m/qZASlaWFot4/nUbQ4mrcFuNLwy+AwF+mWj2zs3gyLp\n"
+"1txyM/1d8iC9djwj2ij3+RvrWWTV3F9yfiD8zYm1kGdNYno/Tq0dwzn+evQoFt9B\n"
+"9kiABdcPUXmsEKvU7ANm5mqwujGSQkBqvjrTcuFqN1W8rB2Vt2lh8kORdOag0wok\n"
+"RqEIr9baRRmW1FMdW4R58MD3R++Lj8UGrp1MYp3/RgT408m2ECVAdf4WqslKYIYv\n"
+"uu8wd+RU4riEmViAqhOLUTpPSPaLtrM=\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                             // O  = Actalis S.p.A.\/03358520967 CN = Actalis Authentication Root CA
+"MIIFuzCCA6OgAwIBAgIIVwoRl0LE48wwDQYJKoZIhvcNAQELBQAwazELMAkGA1UE\n"
+"BhMCSVQxDjAMBgNVBAcMBU1pbGFuMSMwIQYDVQQKDBpBY3RhbGlzIFMucC5BLi8w\n"
+"MzM1ODUyMDk2NzEnMCUGA1UEAwweQWN0YWxpcyBBdXRoZW50aWNhdGlvbiBSb290\n"
+"IENBMB4XDTExMDkyMjExMjIwMloXDTMwMDkyMjExMjIwMlowazELMAkGA1UEBhMC\n"
+"SVQxDjAMBgNVBAcMBU1pbGFuMSMwIQYDVQQKDBpBY3RhbGlzIFMucC5BLi8wMzM1\n"
+"ODUyMDk2NzEnMCUGA1UEAwweQWN0YWxpcyBBdXRoZW50aWNhdGlvbiBSb290IENB\n"
+"MIICIjANBgkqhkiG9w0BAQEFAAOCAg8AMIICCgKCAgEAp8bEpSmkLO/lGMWwUKNv\n"
+"UTufClrJwkg4CsIcoBh/kbWHuUA/3R1oHwiD1S0eiKD4j1aPbZkCkpAW1V8IbInX\n"
+"4ay8IMKx4INRimlNAJZaby/ARH6jDuSRzVju3PvHHkVH3Se5CAGfpiEd9UEtL0z9\n"
+"KK3giq0itFZljoZUj5NDKd45RnijMCO6zfB9E1fAXdKDa0hMxKufgFpbOr3JpyI/\n"
+"gCczWw63igxdBzcIy2zSekciRDXFzMwujt0q7bd9Zg1fYVEiVRvjRuPjPdA1Yprb\n"
+"rxTIW6HMiRvhMCb8oJsfgadHHwTrozmSBp+Z07/T6k9QnBn+locePGX2oxgkg4YQ\n"
+"51Q+qDp2JE+BIcXjDwL4k5RHILv+1A7TaLndxHqEguNTVHnd25zS8gebLra8Pu2F\n"
+"be8lEfKXGkJh90qX6IuxEAf6ZYGyojnP9zz/GPvG8VqLWeICrHuS0E4UT1lF9gxe\n"
+"KF+w6D9Fz8+vm2/7hNN3WpVvrJSEnu68wEqPSpP4RCHiMUVhUE4Q2OM1fEwZtN4F\n"
+"v6MGn8i1zeQf1xcGDXqVdFUNaBr8EBtiZJ1t4JWgw5QHVw0U5r0F+7if5t+L4sbn\n"
+"fpb2U8WANFAoWPASUHEXMLrmeGO89LKtmyuy/uE5jF66CyCU3nuDuP/jVo23Eek7\n"
+"jPKxwV2dpAtMK9myGPW1n0sCAwEAAaNjMGEwHQYDVR0OBBYEFFLYiDrIn3hm7Ynz\n"
+"ezhwlMkCAjbQMA8GA1UdEwEB/wQFMAMBAf8wHwYDVR0jBBgwFoAUUtiIOsifeGbt\n"
+"ifN7OHCUyQICNtAwDgYDVR0PAQH/BAQDAgEGMA0GCSqGSIb3DQEBCwUAA4ICAQAL\n"
+"e3KHwGCmSUyIWOYdiPcUZEim2FgKDk8TNd81HdTtBjHIgT5q1d07GjLukD0R0i70\n"
+"jsNjLiNmsGe+b7bAEzlgqqI0JZN1Ut6nna0Oh4lScWoWPBkdg/iaKWW+9D+a2fDz\n"
+"WochcYBNy+A4mz+7+uAwTc+G02UQGRjRlwKxK3JCaKygvU5a2hi/a5iB0P2avl4V\n"
+"SM0RFbnAKVy06Ij3Pjaut2L9HmLecHgQHEhb2rykOLpn7VU+Xlff1ANATIGk0k9j\n"
+"pwlCCRT8AKnCgHNPLsBA2RF7SOp6AsDT6ygBJlh0wcBzIm2Tlf05fbsq4/aC4yyX\n"
+"X04fkZT6/iyj2HYauE2yOE+b+h1IYHkm4vP9qdCa6HCPSXrW5b0KDtst842/6+Ok\n"
+"fcvHlXHo2qN8xcL4dJIEG4aspCJTQLas/kx2z/uUMsA1n3Y/buWQbqCmJqK4LL7R\n"
+"K4X9p2jIugErsWx0Hbhzlefut8cl8ABMALJ+tguLHPPAUJ4lueAI3jZm/zel0btU\n"
+"ZCzJJ7VLkn5l/9Mt4blOvH+kQSGQQXemOR/qnuOf0GZvBeyqdn6/axag67XH/JJU\n"
+"LysRJyU3eExRarDzzFhdFPFqSBX/wge2sY0PjlxQRrM9vwGYT7JZVEc+NHt4bVaT\n"
+"LnPqZih4zR0Uv6CPLy64Lo7yFIrM6bV8+2ydDKXhlg==\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                             //   O  = AffirmTrust CN = AffirmTrust Commercial
+"MIIDTDCCAjSgAwIBAgIId3cGJyapsXwwDQYJKoZIhvcNAQELBQAwRDELMAkGA1UE\n"
+"BhMCVVMxFDASBgNVBAoMC0FmZmlybVRydXN0MR8wHQYDVQQDDBZBZmZpcm1UcnVz\n"
+"dCBDb21tZXJjaWFsMB4XDTEwMDEyOTE0MDYwNloXDTMwMTIzMTE0MDYwNlowRDEL\n"
+"MAkGA1UEBhMCVVMxFDASBgNVBAoMC0FmZmlybVRydXN0MR8wHQYDVQQDDBZBZmZp\n"
+"cm1UcnVzdCBDb21tZXJjaWFsMIIBIjANBgkqhkiG9w0BAQEFAAOCAQ8AMIIBCgKC\n"
+"AQEA9htPZwcroRX1BiLLHwGy43NFBkRJLLtJJRTWzsO3qyxPxkEylFf6EqdbDuKP\n"
+"Hx6GGaeqtS25Xw2Kwq+FNXkyLbscYjfysVtKPcrNcV/pQr6U6Mje+SJIZMblq8Yr\n"
+"ba0F8PrVC8+a5fBQpIs7R6UjW3p6+DM/uO+Zl+MgwdYoic+U+7lF7eNAFxHUdPAL\n"
+"MeIrJmqbTFeurCA+ukV6BfO9m2kVrn1OIGPENXY6BwLJN/3HR+7o8XYdcxXyl6S1\n"
+"yHp52UKqK39c/s4mT6NmgTWvRLpUHhwwMmWd5jyTXlBOeuM61G7MGvv50jeuJCqr\n"
+"VwMiKA1JdX+3KNp1v47j3A55MQIDAQABo0IwQDAdBgNVHQ4EFgQUnZPGU4teyq8/\n"
+"nx4P5ZmVvCT2lI8wDwYDVR0TAQH/BAUwAwEB/zAOBgNVHQ8BAf8EBAMCAQYwDQYJ\n"
+"KoZIhvcNAQELBQADggEBAFis9AQOzcAN/wr91LoWXym9e2iZWEnStB03TX8nfUYG\n"
+"XUPGhi4+c7ImfU+TqbbEKpqrIZcUsd6M06uJFdhrJNTxFq7YpFzUf1GO7RgBsZNj\n"
+"vbz4YYCanrHOQnDiqX0GJX0nof5v7LMeJNrjS1UaADs1tDvZ110w/YETifLCBivt\n"
+"Z8SOyUOyXGsViQK8YvxO8rUzqrJv0wqiUOP2O+guRMLbZjipM1ZI8W0bM40NjD9g\n"
+"N53Tym1+NH4Nn3J2ixufcv1SNUFFApYvHLKac0khsUlHRUe072o0EclNmsxZt9YC\n"
+"nlpOZbWUrhvfKbAW8b8Angc6F2S1BLUjIZkKlTuXfO8=\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                         //   O  = AffirmTrust CN = AffirmTrust Networking
+"MIIDTDCCAjSgAwIBAgIIfE8EORzUmS0wDQYJKoZIhvcNAQEFBQAwRDELMAkGA1UE\n"
+"BhMCVVMxFDASBgNVBAoMC0FmZmlybVRydXN0MR8wHQYDVQQDDBZBZmZpcm1UcnVz\n"
+"dCBOZXR3b3JraW5nMB4XDTEwMDEyOTE0MDgyNFoXDTMwMTIzMTE0MDgyNFowRDEL\n"
+"MAkGA1UEBhMCVVMxFDASBgNVBAoMC0FmZmlybVRydXN0MR8wHQYDVQQDDBZBZmZp\n"
+"cm1UcnVzdCBOZXR3b3JraW5nMIIBIjANBgkqhkiG9w0BAQEFAAOCAQ8AMIIBCgKC\n"
+"AQEAtITMMxcua5Rsa2FSoOujz3mUTOWUgJnLVWREZY9nZOIG41w3SfYvm4SEHi3y\n"
+"YJ0wTsyEheIszx6e/jarM3c1RNg1lho9Nuh6DtjVR6FqaYvZ/Ls6rnla1fTWcbua\n"
+"kCNrmreIdIcMHl+5ni36q1Mr3Lt2PpNMCAiMHqIjHNRqrSK6mQEubWXLviRmVSRL\n"
+"QESxG9fhwoXA3hA/Pe24/PHxI1Pcv2WXb9n5QHGNfb2V1M6+oF4nI979ptAmDgAp\n"
+"6zxG8D1gvz9Q0twmQVGeFDdCBKNwV6gbh+0t+nvujArjqWaJGctB+d1ENmHP4ndG\n"
+"yH329JKBNv3bNPFyfvMMFr20FQIDAQABo0IwQDAdBgNVHQ4EFgQUBx/S55zawm6i\n"
+"QLSwelAQUHTEyL0wDwYDVR0TAQH/BAUwAwEB/zAOBgNVHQ8BAf8EBAMCAQYwDQYJ\n"
+"KoZIhvcNAQEFBQADggEBAIlXshZ6qML91tmbmzTCnLQyFE2npN/svqe++EPbkTfO\n"
+"tDIuUFUaNU52Q3Eg75N3ThVwLofDwR1t3Mu1J9QsVtFSUzpE0nPIxBsFZVpikpzu\n"
+"QY0x2+c06lkh1QF612S4ZDnNye2v7UsDSKegmQGA3GWjNq5lWUhPgkvIZfFXHeVZ\n"
+"Lgo/bNjR9eUJtGxUAArgFU2HdW23WJZa3W3SAKD0m0i+wzekujbgfIeFlxoVot4u\n"
+"olu9rxj5kFDNcFn4J2dHy8egBzp90SxdbBk6ZrV9/ZFvgrG+CJPbFEfxojfHRZ48\n"
+"x3evZKiT3/Zpg4Jg8klCNO1aAFSFHBY2kgxc+qatv9s=\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                           //   O  = AffirmTrust CN = AffirmTrust Premium
+"MIIFRjCCAy6gAwIBAgIIbYwURrGmCu4wDQYJKoZIhvcNAQEMBQAwQTELMAkGA1UE\n"
+"BhMCVVMxFDASBgNVBAoMC0FmZmlybVRydXN0MRwwGgYDVQQDDBNBZmZpcm1UcnVz\n"
+"dCBQcmVtaXVtMB4XDTEwMDEyOTE0MTAzNloXDTQwMTIzMTE0MTAzNlowQTELMAkG\n"
+"A1UEBhMCVVMxFDASBgNVBAoMC0FmZmlybVRydXN0MRwwGgYDVQQDDBNBZmZpcm1U\n"
+"cnVzdCBQcmVtaXVtMIICIjANBgkqhkiG9w0BAQEFAAOCAg8AMIICCgKCAgEAxBLf\n"
+"qV/+Qd3d9Z+K4/as4Tx4mrzY8H96oDMq3I0gW64tb+eT2TZwamjPjlGjhVtnBKAQ\n"
+"JG9dKILBl1fYSCkTtuG+kU3fhQxTGJoeJKJPj/CihQvL9Cl/0qRY7iZNyaqoe5rZ\n"
+"+jjeRFcV5fiMyNlI4g0WJx0eyIOFJbe6qlVBzAMiSy2RjYvmia9mx+n/K+k8rNrS\n"
+"s8PhaJyJ+HoAVt70VZVs+7pk3WKL3wt3MutizCaam7uqYoNMtAZ6MMgpv+0GTZe5\n"
+"HMQxK9VfvFMSF5yZVylmd2EhMQcuJUmdGPLu8ytxjLW6OQdJd/zvLpKQBY0tL3d7\n"
+"70O/Nbua2Plzpyzy0FfuKE4mX4+QaAkvuPjcBukumj5Rp9EixAqnOEhss/n/fauG\n"
+"V+O61oV4d7pD6kh/9ti+I20ev9E2bFhc8e6kGVQa9QPSdubhjL08s9NIS+LI+H+S\n"
+"qHZGnEJlPqQewQcDWkYtuJfzt9WyVSHvutxMAJf7FJUnM7/oQ0dG0giZFmA7mn7S\n"
+"5u046uwBHjxIVkkJx0w3AJ6IDsBz4W9m6XJHMD4Q5QsDyZpCAGzFlH5hxIrff4Ia\n"
+"C1nEWTJ3s7xgaVY5/bQGeyzWZDbZvUjthB9+pSKPKrhC9IK31FOQeE4tGv2Bb0TX\n"
+"OwF0lkLgAOIua+rF7nKsu7/+6qqo+Nz2snmKtmcCAwEAAaNCMEAwHQYDVR0OBBYE\n"
+"FJ3AZ6YMItkm9UWrpmVSESfYRaxjMA8GA1UdEwEB/wQFMAMBAf8wDgYDVR0PAQH/\n"
+"BAQDAgEGMA0GCSqGSIb3DQEBDAUAA4ICAQCzV00QYk465KzquByvMiPIs0laUZx2\n"
+"KI15qldGF9X1Uva3ROgIRL8YhNILgM3FEv0AVQVhh0HctSSePMTYyPtwni94loMg\n"
+"Nt58D2kTiKV1NpgIpsbfrM7jWNa3Pt668+s0QNiigfV4Py/VpfzZotReBA4Xrf5B\n"
+"8OWycvpEgjNC6C1Y91aMYj+6QrCcDFx+LmUmXFNPALJ4fqENmS2NuB2OosSw/WDQ\n"
+"MKSOyARiqcTtNd56l+0OOF6SL5Nwpamcb6d9Ex1+xghIsV5n61EIJenmJWtSKZGc\n"
+"0jlzCFfemQa0W50QBuHCAKi4HEoCChTQwUHK+4w1IX2COPKpVJEZNZOUbWo6xbLQ\n"
+"u4mGk+ibyQ86p3q4ofB4Rvr8Ny/lioTz3/4E2aFooC8k4gmVBtWVyuEklut89pMF\n"
+"u+1z6S3RdTnX5yTb2E5fQ4+e0BQ5v1VwSJlXMbSc7kqYA5YwH2AG7hsj/oFgIxpH\n"
+"YoWlzBk0gG+zrBrjn/B7SK3VAdlntqlyk+otZrWyuOQ9PLLvTIzq6we/qzWaVYa8\n"
+"GKa1qF60g2xraUDTn9zxw2lrueFtCfTxqlB2Cnp9ehehVZZCmTEJ3WARjQUwfuaO\n"
+"RtGdFNrHF+QFlozEJLUbzxQHskD4o55BhrwE0GuWyCqANP2/7waj3VjFhT0+j/6e\n"
+"KeC2uAloGRwYQw==\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                        //   O  = AffirmTrust CN = AffirmTrust Premium ECC
+"MIIB/jCCAYWgAwIBAgIIdJclisc/elQwCgYIKoZIzj0EAwMwRTELMAkGA1UEBhMC\n"
+"VVMxFDASBgNVBAoMC0FmZmlybVRydXN0MSAwHgYDVQQDDBdBZmZpcm1UcnVzdCBQ\n"
+"cmVtaXVtIEVDQzAeFw0xMDAxMjkxNDIwMjRaFw00MDEyMzExNDIwMjRaMEUxCzAJ\n"
+"BgNVBAYTAlVTMRQwEgYDVQQKDAtBZmZpcm1UcnVzdDEgMB4GA1UEAwwXQWZmaXJt\n"
+"VHJ1c3QgUHJlbWl1bSBFQ0MwdjAQBgcqhkjOPQIBBgUrgQQAIgNiAAQNMF4bFZ0D\n"
+"0KF5Nbc6PJJ6yhUczWLznCZcBz3lVPqj1swS6vQUX+iOGasvLkjmrBhDeKzQN8O9\n"
+"ss0s5kfiGuZjuD0uL3jET9v0D6RoTFVya5UdThhClXjMNzyR4ptlKymjQjBAMB0G\n"
+"A1UdDgQWBBSaryl6wBE1NSZRMADDav5A1a7WPDAPBgNVHRMBAf8EBTADAQH/MA4G\n"
+"A1UdDwEB/wQEAwIBBjAKBggqhkjOPQQDAwNnADBkAjAXCfOHiFBar8jAQr9HX/Vs\n"
+"aobgxCd05DhT1wV/GzTjxi+zygk8N53X57hG8f2h4nECMEJZh0PUUd+60wkyWs6I\n"
+"flc9nF9Ca/UHLbXwgpP5WW+uZPpY5Yse42O+tYHNbwKMeQ==\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                        // O  = Amazon CN = Amazon Root CA 1
+"MIIDQTCCAimgAwIBAgITBmyfz5m/jAo54vB4ikPmljZbyjANBgkqhkiG9w0BAQsF\n"
+"ADA5MQswCQYDVQQGEwJVUzEPMA0GA1UEChMGQW1hem9uMRkwFwYDVQQDExBBbWF6\n"
+"b24gUm9vdCBDQSAxMB4XDTE1MDUyNjAwMDAwMFoXDTM4MDExNzAwMDAwMFowOTEL\n"
+"MAkGA1UEBhMCVVMxDzANBgNVBAoTBkFtYXpvbjEZMBcGA1UEAxMQQW1hem9uIFJv\n"
+"b3QgQ0EgMTCCASIwDQYJKoZIhvcNAQEBBQADggEPADCCAQoCggEBALJ4gHHKeNXj\n"
+"ca9HgFB0fW7Y14h29Jlo91ghYPl0hAEvrAIthtOgQ3pOsqTQNroBvo3bSMgHFzZM\n"
+"9O6II8c+6zf1tRn4SWiw3te5djgdYZ6k/oI2peVKVuRF4fn9tBb6dNqcmzU5L/qw\n"
+"IFAGbHrQgLKm+a/sRxmPUDgH3KKHOVj4utWp+UhnMJbulHheb4mjUcAwhmahRWa6\n"
+"VOujw5H5SNz/0egwLX0tdHA114gk957EWW67c4cX8jJGKLhD+rcdqsq08p8kDi1L\n"
+"93FcXmn/6pUCyziKrlA4b9v7LWIbxcceVOF34GfID5yHI9Y/QCB/IIDEgEw+OyQm\n"
+"jgSubJrIqg0CAwEAAaNCMEAwDwYDVR0TAQH/BAUwAwEB/zAOBgNVHQ8BAf8EBAMC\n"
+"AYYwHQYDVR0OBBYEFIQYzIU07LwMlJQuCFmcx7IQTgoIMA0GCSqGSIb3DQEBCwUA\n"
+"A4IBAQCY8jdaQZChGsV2USggNiMOruYou6r4lK5IpDB/G/wkjUu0yKGX9rbxenDI\n"
+"U5PMCCjjmCXPI6T53iHTfIUJrU6adTrCC2qJeHZERxhlbI1Bjjt/msv0tadQ1wUs\n"
+"N+gDS63pYaACbvXy8MWy7Vu33PqUXHeeE6V/Uq2V8viTO96LXFvKWlJbYK8U90vv\n"
+"o/ufQJVtMVT8QtPHRh8jrdkPSHCa2XV4cdFyQzR1bldZwgJcJmApzyMZFo6IQ6XU\n"
+"5MsI+yMRQ+hDKXJioaldXgjUkK642M4UwtBV8ob2xJNDd2ZhwLnoQdeXeGADbkpy\n"
+"rqXRfboQnoZsG4q5WTP468SQvvG5\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                        //   O  = Amazon CN = Amazon Root CA 2
+"MIIFQTCCAymgAwIBAgITBmyf0pY1hp8KD+WGePhbJruKNzANBgkqhkiG9w0BAQwF\n"
+"ADA5MQswCQYDVQQGEwJVUzEPMA0GA1UEChMGQW1hem9uMRkwFwYDVQQDExBBbWF6\n"
+"b24gUm9vdCBDQSAyMB4XDTE1MDUyNjAwMDAwMFoXDTQwMDUyNjAwMDAwMFowOTEL\n"
+"MAkGA1UEBhMCVVMxDzANBgNVBAoTBkFtYXpvbjEZMBcGA1UEAxMQQW1hem9uIFJv\n"
+"b3QgQ0EgMjCCAiIwDQYJKoZIhvcNAQEBBQADggIPADCCAgoCggIBAK2Wny2cSkxK\n"
+"gXlRmeyKy2tgURO8TW0G/LAIjd0ZEGrHJgw12MBvIITplLGbhQPDW9tK6Mj4kHbZ\n"
+"W0/jTOgGNk3Mmqw9DJArktQGGWCsN0R5hYGCrVo34A3MnaZMUnbqQ523BNFQ9lXg\n"
+"1dKmSYXpN+nKfq5clU1Imj+uIFptiJXZNLhSGkOQsL9sBbm2eLfq0OQ6PBJTYv9K\n"
+"8nu+NQWpEjTj82R0Yiw9AElaKP4yRLuH3WUnAnE72kr3H9rN9yFVkE8P7K6C4Z9r\n"
+"2UXTu/Bfh+08LDmG2j/e7HJV63mjrdvdfLC6HM783k81ds8P+HgfajZRRidhW+me\n"
+"z/CiVX18JYpvL7TFz4QuK/0NURBs+18bvBt+xa47mAExkv8LV/SasrlX6avvDXbR\n"
+"8O70zoan4G7ptGmh32n2M8ZpLpcTnqWHsFcQgTfJU7O7f/aS0ZzQGPSSbtqDT6Zj\n"
+"mUyl+17vIWR6IF9sZIUVyzfpYgwLKhbcAS4y2j5L9Z469hdAlO+ekQiG+r5jqFoz\n"
+"7Mt0Q5X5bGlSNscpb/xVA1wf+5+9R+vnSUeVC06JIglJ4PVhHvG/LopyboBZ/1c6\n"
+"+XUyo05f7O0oYtlNc/LMgRdg7c3r3NunysV+Ar3yVAhU/bQtCSwXVEqY0VThUWcI\n"
+"0u1ufm8/0i2BWSlmy5A5lREedCf+3euvAgMBAAGjQjBAMA8GA1UdEwEB/wQFMAMB\n"
+"Af8wDgYDVR0PAQH/BAQDAgGGMB0GA1UdDgQWBBSwDPBMMPQFWAJI/TPlUq9LhONm\n"
+"UjANBgkqhkiG9w0BAQwFAAOCAgEAqqiAjw54o+Ci1M3m9Zh6O+oAA7CXDpO8Wqj2\n"
+"LIxyh6mx/H9z/WNxeKWHWc8w4Q0QshNabYL1auaAn6AFC2jkR2vHat+2/XcycuUY\n"
+"+gn0oJMsXdKMdYV2ZZAMA3m3MSNjrXiDCYZohMr/+c8mmpJ5581LxedhpxfL86kS\n"
+"k5Nrp+gvU5LEYFiwzAJRGFuFjWJZY7attN6a+yb3ACfAXVU3dJnJUH/jWS5E4ywl\n"
+"7uxMMne0nxrpS10gxdr9HIcWxkPo1LsmmkVwXqkLN1PiRnsn/eBG8om3zEK2yygm\n"
+"btmlyTrIQRNg91CMFa6ybRoVGld45pIq2WWQgj9sAq+uEjonljYE1x2igGOpm/Hl\n"
+"urR8FLBOybEfdF849lHqm/osohHUqS0nGkWxr7JOcQ3AWEbWaQbLU8uz/mtBzUF+\n"
+"fUwPfHJ5elnNXkoOrJupmHN5fLT0zLm4BwyydFy4x2+IoZCn9Kr5v2c69BoVYh63\n"
+"n749sSmvZ6ES8lgQGVMDMBu4Gon2nL2XA46jCfMdiyHxtN/kHNGfZQIG6lzWE7OE\n"
+"76KlXIx3KadowGuuQNKotOrN8I1LOJwZmhsoVLiJkO/KdYE+HvJkJMcYr07/R54H\n"
+"9jVlpNMKVv/1F2Rs76giJUmTtt8AF9pYfl3uxRuw0dFfIRDH+fO6AgonB8Xx1sfT\n"
+"4PsJYGw=\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                          //   O  = Amazon CN = Amazon Root CA 3
+"MIIBtjCCAVugAwIBAgITBmyf1XSXNmY/Owua2eiedgPySjAKBggqhkjOPQQDAjA5\n"
+"MQswCQYDVQQGEwJVUzEPMA0GA1UEChMGQW1hem9uMRkwFwYDVQQDExBBbWF6b24g\n"
+"Um9vdCBDQSAzMB4XDTE1MDUyNjAwMDAwMFoXDTQwMDUyNjAwMDAwMFowOTELMAkG\n"
+"A1UEBhMCVVMxDzANBgNVBAoTBkFtYXpvbjEZMBcGA1UEAxMQQW1hem9uIFJvb3Qg\n"
+"Q0EgMzBZMBMGByqGSM49AgEGCCqGSM49AwEHA0IABCmXp8ZBf8ANm+gBG1bG8lKl\n"
+"ui2yEujSLtf6ycXYqm0fc4E7O5hrOXwzpcVOho6AF2hiRVd9RFgdszflZwjrZt6j\n"
+"QjBAMA8GA1UdEwEB/wQFMAMBAf8wDgYDVR0PAQH/BAQDAgGGMB0GA1UdDgQWBBSr\n"
+"ttvXBp43rDCGB5Fwx5zEGbF4wDAKBggqhkjOPQQDAgNJADBGAiEA4IWSoxe3jfkr\n"
+"BqWTrBqYaGFy+uGh0PsceGCmQ5nFuMQCIQCcAu/xlJyzlvnrxir4tiz+OpAUFteM\n"
+"YyRIHN8wfdVoOw==\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                         //   O  = Amazon CN = Amazon Root CA 4
+"MIIB8jCCAXigAwIBAgITBmyf18G7EEwpQ+Vxe3ssyBrBDjAKBggqhkjOPQQDAzA5\n"
+"MQswCQYDVQQGEwJVUzEPMA0GA1UEChMGQW1hem9uMRkwFwYDVQQDExBBbWF6b24g\n"
+"Um9vdCBDQSA0MB4XDTE1MDUyNjAwMDAwMFoXDTQwMDUyNjAwMDAwMFowOTELMAkG\n"
+"A1UEBhMCVVMxDzANBgNVBAoTBkFtYXpvbjEZMBcGA1UEAxMQQW1hem9uIFJvb3Qg\n"
+"Q0EgNDB2MBAGByqGSM49AgEGBSuBBAAiA2IABNKrijdPo1MN/sGKe0uoe0ZLY7Bi\n"
+"9i0b2whxIdIA6GO9mif78DluXeo9pcmBqqNbIJhFXRbb/egQbeOc4OO9X4Ri83Bk\n"
+"M6DLJC9wuoihKqB1+IGuYgbEgds5bimwHvouXKNCMEAwDwYDVR0TAQH/BAUwAwEB\n"
+"/zAOBgNVHQ8BAf8EBAMCAYYwHQYDVR0OBBYEFNPsxzplbszh2naaVvuc84ZtV+WB\n"
+"MAoGCCqGSM49BAMDA2gAMGUCMDqLIfG9fhGt0O9Yli/W651+kI0rz2ZVwyzjKKlw\n"
+"CkcO8DdZEv8tmZQoTipPNU0zWgIxAOp1AE47xDqUEpHJWEadIRNyp4iciuRMStuW\n"
+"1KyLa2tJElMzrdfkviT8tQp21KW8EA==\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                        //   CN = Atos TrustedRoot 2011 O  = Atos
+"MIIDdzCCAl+gAwIBAgIIXDPLYixfszIwDQYJKoZIhvcNAQELBQAwPDEeMBwGA1UE\n"
+"AwwVQXRvcyBUcnVzdGVkUm9vdCAyMDExMQ0wCwYDVQQKDARBdG9zMQswCQYDVQQG\n"
+"EwJERTAeFw0xMTA3MDcxNDU4MzBaFw0zMDEyMzEyMzU5NTlaMDwxHjAcBgNVBAMM\n"
+"FUF0b3MgVHJ1c3RlZFJvb3QgMjAxMTENMAsGA1UECgwEQXRvczELMAkGA1UEBhMC\n"
+"REUwggEiMA0GCSqGSIb3DQEBAQUAA4IBDwAwggEKAoIBAQCVhTuXbyo7LjvPpvMp\n"
+"Nb7PGKw+qtn4TaA+Gke5vJrf8v7MPkfoepbCJI419KkM/IL9bcFyYie96mvr54rM\n"
+"VD6QUM+A1JX76LWC1BTFtqlVJVfbsVD2sGBkWXppzwO3bw2+yj5vdHLqqjAqc2K+\n"
+"SZFhyBH+DgMq92og3AIVDV4VavzjgsG1xZ1kCWyjWZgHJ8cblithdHFsQ/H3NYkQ\n"
+"4J7sVaE3IqKHBAUsR320HLliKWYoyrfhk/WklAOZuXCFteZI6o1Q/NnezG8HDt0L\n"
+"cp2AMBYHlT8oDv3FdU9T1nSatCQujgKRz3bFmx5VdJx4IbHwLfELn8LVlhgf8FQi\n"
+"eowHAgMBAAGjfTB7MB0GA1UdDgQWBBSnpQaxLKYJYO7Rl+lwrrw7GWzbITAPBgNV\n"
+"HRMBAf8EBTADAQH/MB8GA1UdIwQYMBaAFKelBrEspglg7tGX6XCuvDsZbNshMBgG\n"
+"A1UdIAQRMA8wDQYLKwYBBAGwLQMEAQEwDgYDVR0PAQH/BAQDAgGGMA0GCSqGSIb3\n"
+"DQEBCwUAA4IBAQAmdzTblEiGKkGdLD4GkGDEjKwLVLgfuXvTBznk+j57sj1O7Z8j\n"
+"vZfza1zv7v1Apt+hk6EKhqzvINB5Ab149xnYJDE0BAGmuhWawyfc2E8PzBhj/5kP\n"
+"DpFrdRbhIfzYJsdHt6bPWHJxfrrhTZVHO8mvbaG0weyJ9rQPOLXiZNwlz6bb65pc\n"
+"maHFCN795trV1lpFDMS3wrUU77QR/w4VtfX128a961qn8FYiqTxlVMYVqL2Gns2D\n"
+"lmh6cYGJ4Qvh6hEbaAjMaZ7snkGeRDImeuKHCnE96+RapNLbxc3G3mB/ufNPRJLv\n"
+"KrcYPqcZ2Qt9sTdBQrC6YB3y/gkRsPCHe6ed\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                        //  CN = Autoridad de Certificacion Firmaprofesional CIF A62634068
+"MIIGFDCCA/ygAwIBAgIIU+w77vuySF8wDQYJKoZIhvcNAQEFBQAwUTELMAkGA1UE\n"
+"BhMCRVMxQjBABgNVBAMMOUF1dG9yaWRhZCBkZSBDZXJ0aWZpY2FjaW9uIEZpcm1h\n"
+"cHJvZmVzaW9uYWwgQ0lGIEE2MjYzNDA2ODAeFw0wOTA1MjAwODM4MTVaFw0zMDEy\n"
+"MzEwODM4MTVaMFExCzAJBgNVBAYTAkVTMUIwQAYDVQQDDDlBdXRvcmlkYWQgZGUg\n"
+"Q2VydGlmaWNhY2lvbiBGaXJtYXByb2Zlc2lvbmFsIENJRiBBNjI2MzQwNjgwggIi\n"
+"MA0GCSqGSIb3DQEBAQUAA4ICDwAwggIKAoICAQDKlmuO6vj78aI14H9M2uDDUtd9\n"
+"thDIAl6zQyrET2qyyhxdKJp4ERppWVevtSBC5IsP5t9bpgOSL/UR5GLXMnE42QQM\n"
+"cas9UX4PB99jBVzpv5RvwSmCwLTaUbDBPLutN0pcyvFLNg4kq7/DhHf9qFD0sefG\n"
+"L9ItWY16Ck6WaVICqjaY7Pz6FIMMNx/Jkjd/14Et5cS54D40/mf0PmbR0/RAz15i\n"
+"NA9wBj4gGFrO93IbJWyTdBSTo3OxDqqHECNZXyAFGUftaI6SEspd/NYrspI8IM/h\n"
+"X68gvqB2f3bl7BqGYTM+53u0P6APjqK5am+5hyZvQWyIplD9amML9ZMWGxmPsu2b\n"
+"m8mQ9QEM3xk9Dz44I8kvjwzRAv4bVdZO0I08r0+k8/6vKtMFnXkIoctXMbScyJCy\n"
+"Z/QYFpM6/EfY0XiWMR+6KwxfXZmtY4laJCB22N/9q06mIqqdXuYnin1oKaPnirja\n"
+"EbsXLZmdEyRG98Xi2J+Of8ePdG1asuhy9azuJBCtLxTa/y2aRnFHvkLfuwHb9H/T\n"
+"KI8xWVvTyQKmtFLKbpf7Q8UIJm+K9Lv9nyiqDdVF8xM6HdjAeI9BZzwelGSuewvF\n"
+"6NkBiDkal4ZkQdU7hwxu+g/GvUgUvzlN1J5Bto+WHWOWk9mVBngxaJ43BjuAiUVh\n"
+"OSPHG0SjFeUc+JIwuwIDAQABo4HvMIHsMBIGA1UdEwEB/wQIMAYBAf8CAQEwDgYD\n"
+"VR0PAQH/BAQDAgEGMB0GA1UdDgQWBBRlzeurNR4APn7VdMActHNHDhpkLzCBpgYD\n"
+"VR0gBIGeMIGbMIGYBgRVHSAAMIGPMC8GCCsGAQUFBwIBFiNodHRwOi8vd3d3LmZp\n"
+"cm1hcHJvZmVzaW9uYWwuY29tL2NwczBcBggrBgEFBQcCAjBQHk4AUABhAHMAZQBv\n"
+"ACAAZABlACAAbABhACAAQgBvAG4AYQBuAG8AdgBhACAANAA3ACAAQgBhAHIAYwBl\n"
+"AGwAbwBuAGEAIAAwADgAMAAxADcwDQYJKoZIhvcNAQEFBQADggIBABd9oPm03cXF\n"
+"661LJLWhAqvdpYhKsg9VSytXjDvlMd3+xDLx51tkljYyGOylMnfX40S2wBEqgLk9\n"
+"am58m9Ot/MPWo+ZkKXzR4Tgegiv/J2Wv+xYVxC5xhOW1//qkR71kMrv2JYSiJ0L1\n"
+"ILDCExARzRAVukKQKtJE4ZYm6zFIEv0q2skGz3QeqUvVhyj5eTSSPi5E6PaPT481\n"
+"PyWzOdxjKpBrIF/EUhJOlywqrJ2X3kjyo2bbwtKDlaZmp54lD+kLM5FlClrD2VQS\n"
+"3a/DTg4fJl4N3LON7NWBcN7STyQF82xO9UxJZo3R/9ILJUFI/lGExkKvgATP0H5k\n"
+"SeTy36LssUzAKh3ntLFlosS88Zj0qnAHY7S42jtM+kAiMFsRpvAFDsYCA0irhpuF\n"
+"3dvd6qJ2gHN99ZwExEWN57kci57q13XRcrHedUTnQn3iV2t93Jm8PYMo6oCTjcVM\n"
+"ZcFwgbg4/EMxsvYDNEeyrPsiBsse3RdHHF9mudMaotoRsaS8I8nkvof/uZS2+F0g\n"
+"StRf571oe2XyFR7SOqkt6dhrJKyXWERHrVkY8SFlcN7ONGCoQPHzPKTDKCOM/icz\n"
+"Q0CgFzzr6juwcqajuUpLXhZI9LK8yIySxZ2frHI2vDSANGupi5LAuBft7HZT9SQB\n"
+"jLMi6Et8Vcad+qMUu2WFbm5PEn4KPJ2V\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                        //   O  = Buypass AS-983163327 CN = Buypass Class 2 Root CA
+"MIIFWTCCA0GgAwIBAgIBAjANBgkqhkiG9w0BAQsFADBOMQswCQYDVQQGEwJOTzEd\n"
+"MBsGA1UECgwUQnV5cGFzcyBBUy05ODMxNjMzMjcxIDAeBgNVBAMMF0J1eXBhc3Mg\n"
+"Q2xhc3MgMiBSb290IENBMB4XDTEwMTAyNjA4MzgwM1oXDTQwMTAyNjA4MzgwM1ow\n"
+"TjELMAkGA1UEBhMCTk8xHTAbBgNVBAoMFEJ1eXBhc3MgQVMtOTgzMTYzMzI3MSAw\n"
+"HgYDVQQDDBdCdXlwYXNzIENsYXNzIDIgUm9vdCBDQTCCAiIwDQYJKoZIhvcNAQEB\n"
+"BQADggIPADCCAgoCggIBANfHXvfBB9R3+0Mh9PT1aeTuMgHbo4Yf5FkNuud1g1Lr\n"
+"6hxhFUi7HQfKjK6w3Jad6sNgkoaCKHOcVgb/S2TwDCo3SbXlzwx87vFKu3MwZfPV\n"
+"L4O2fuPn9Z6rYPnT8Z2SdIrkHJasW4DptfQxh6NR/Md+oW+OU3fUl8FVM5I+GC91\n"
+"1K2GScuVr1QGbNgGE41b/+EmGVnAJLqBcXmQRFBoJJRfuLMR8SlBYaNByyM21cHx\n"
+"MlAQTn/0hpPshNOOvEu/XAFOBz3cFIqUCqTqc/sLUegTBxj6DvEr0VQVfTzh97QZ\n"
+"QmdiXnfgolXsttlpF9U6r0TtSsWe5HonfOV116rLJeffawrbD02TTqigzXsu8lkB\n"
+"arcNuAeBfos4GzjmCleZPe4h6KP1DBbdi+w0jpwqHAAVF41og9JwnxgIzRFo1clr\n"
+"Us3ERo/ctfPYV3Me6ZQ5BL/T3jjetFPsaRyifsSP5BtwrfKi+fv3FmRmaZ9JUaLi\n"
+"FRhnBkp/1Wy1TbMz4GHrXb7pmA8y1x1LPC5aAVKRCfLf6o3YBkBjqhHk/sM3nhRS\n"
+"P/TizPJhk9H9Z2vXUq6/aKtAQ6BXNVN48FP4YUIHZMbXb5tMOA1jrGKvNouicwoN\n"
+"9SG9dKpN6nIDSdvHXx1iY8f93ZHsM+71bbRuMGjeyNYmsHVee7QHIJihdjK4TWxP\n"
+"AgMBAAGjQjBAMA8GA1UdEwEB/wQFMAMBAf8wHQYDVR0OBBYEFMmAd+BikoL1Rpzz\n"
+"uvdMw964o605MA4GA1UdDwEB/wQEAwIBBjANBgkqhkiG9w0BAQsFAAOCAgEAU18h\n"
+"9bqwOlI5LJKwbADJ784g7wbylp7ppHR/ehb8t/W2+xUbP6umwHJdELFx7rxP462s\n"
+"A20ucS6vxOOto70MEae0/0qyexAQH6dXQbLArvQsWdZHEIjzIVEpMMpghq9Gqx3t\n"
+"OluwlN5E40EIosHsHdb9T7bWR9AUC8rmyrV7d35BH16Dx7aMOZawP5aBQW9gkOLo\n"
+"+fsicdl9sz1Gv7SEr5AcD48Saq/v7h56rgJKihcrdv6sVIkkLE8/trKnToyokZf7\n"
+"KcZ7XC25y2a2t6hbElGFtQl+Ynhw/qlqYLYdDnkM/crqJIByw5c/8nerQyIKx+u2\n"
+"DISCLIBrQYoIwOula9+ZEsuK1V6ADJHgJgg2SMX6OBE1/yWDLfJ6v9r9jv6ly0Us\n"
+"H8SIU653DtmadsWOLB2jutXsMq7Aqqz30XpN69QH4kj3Io6wpJ9qzo6ysmD0oyLQ\n"
+"I+uUWnpp3Q+/QFesa1lQ2aOZ4W7+jQF5JyMV3pKdewlNWudLSDBaGOYKbeaP4NK7\n"
+"5t98biGCwWg5TbSYWGZizEqQXsP6JwSxeRV0mcy+rSDeJmAc61ZRpqPq5KM/p/9h\n"
+"3PFaTWwyI0PurKju7koSCTxdccK+efrCh2gdC/1cacwG0Jp9VJkqyTkaGa9LKkPz\n"
+"Y11aWOIv4x3kqdbQCtCev9eBCfHJxyYNrJgWVqA=\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                         //   O  = Buypass AS-983163327 CN = Buypass Class 3 Root CA
+"MIIFWTCCA0GgAwIBAgIBAjANBgkqhkiG9w0BAQsFADBOMQswCQYDVQQGEwJOTzEd\n"
+"MBsGA1UECgwUQnV5cGFzcyBBUy05ODMxNjMzMjcxIDAeBgNVBAMMF0J1eXBhc3Mg\n"
+"Q2xhc3MgMyBSb290IENBMB4XDTEwMTAyNjA4Mjg1OFoXDTQwMTAyNjA4Mjg1OFow\n"
+"TjELMAkGA1UEBhMCTk8xHTAbBgNVBAoMFEJ1eXBhc3MgQVMtOTgzMTYzMzI3MSAw\n"
+"HgYDVQQDDBdCdXlwYXNzIENsYXNzIDMgUm9vdCBDQTCCAiIwDQYJKoZIhvcNAQEB\n"
+"BQADggIPADCCAgoCggIBAKXaCpUWUOOV8l6ddjEGMnqb8RB2uACatVI2zSRHsJ8Y\n"
+"ZLya9vrVediQYkwiL944PdbgqOkcLNt4EemOaFEVcsfzM4fkoF0LXOBXByow9c3E\n"
+"N3coTRiR5r/VUv1xLXA+58bEiuPwKAv0dpihi4dVsjoT/Lc+JzeOIuOoTyrvYLs9\n"
+"tznDDgFHmV0ST9tD+leh7fmdvhFHJlsTmKtdFoqwNxxXnUX/iJY2v7vKB3tvh2PX\n"
+"0DJq1l1sDPGzbjniazEuOQAnFN44wOwZZoYS6J1yFhNkUsepNxz9gjDthBgd9K5c\n"
+"/3ATAOux9TN6S9ZV+AWNS2mw9bMoNlwUxFFzTWsL8TQH2xc519woe2v1n/MuwU8X\n"
+"KhDzzMro6/1rqy6any2CbgTUUgGTLT2G/H783+9CHaZr77kgxve9oKeV/afmiSTY\n"
+"zIw0bOIjL9kSGiG5VZFvC5F5GQytQIgLcOJ60g7YaEi7ghM5EFjp2CoHxhLbWNvS\n"
+"O1UQRwUVZ2J+GGOmRj8JDlQyXr8NYnon74Do29lLBlo3WiXQCBJ31G8JUJc9yB3D\n"
+"34xFMFbG02SrZvPAXpacw8Tvw3xrizp5f7NJzz3iiZ+gMEuFuZyUJHmPfWupRWgP\n"
+"K9Dx2hzLabjKSWJtyNBjYt1gD1iqj6G8BaVmos8bdrKEZLFMOVLAMLrwjEsCsLa3\n"
+"AgMBAAGjQjBAMA8GA1UdEwEB/wQFMAMBAf8wHQYDVR0OBBYEFEe4zf/lb+74suwv\n"
+"Tg75JbCOPGvDMA4GA1UdDwEB/wQEAwIBBjANBgkqhkiG9w0BAQsFAAOCAgEAACAj\n"
+"QTUEkMJAYmDv4jVM1z+s4jSQuKFvdvoWFqRINyzpkMLyPPgKn9iB5btb2iUspKdV\n"
+"cSQy9sgL8rxq+JOssgfCX5/bzMiKqr5qb+FJEMwx14C7u8jYog5kV+qi9cKpMRXS\n"
+"IGrs/CIBKM+GuIAeqcwRpTzyFrNHnfzSgCHEy9BHcEGhyoMZCCxt8l13nIoUE9Q2\n"
+"HJLw5QY33KbmkJs4j1xrG0aGQ0JfPgEHU1RdZX33inOhmlRaHylDFCfChQ+1iHsa\n"
+"O5S3HWCntZznKWlXWpuTekMwGwPXYshApqr8ZORK15FTAaggiG6cX0S5y2CBNOxv\n"
+"033aSF/rtJC8LakcC6wc1aJoIIAE1vyxjy+7SjENSoYc6+I2KSb12tjE8nVhz36u\n"
+"dmNKekBlk4f4HoCMhuWG1o8O/FMsYOgWYRqiPkN7zTlgVGr18okmAWiDSKIz6MkE\n"
+"kbIRNBE+6tBDGR8Dk5AM/1E9V/RBbuHLoL7ryWPNbczk+DaqaJ3tvV2XcEQNtg41\n"
+"3OEMXbugUZTLfhbrES+jkkXITHHZvMmZUldGL1DPvTVp9D0VzgalLA8+9oG6lLvD\n"
+"u79leNKGef9JOxqDDPDeeOzI8k1MGt6CKfjBWtrt7uYnXuhF0J0cUahoq0Tj0Itq\n"
+"4/g7u9xN12TyUb7mqqta6THuBrxzvxNiCp/HuZc=\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                          //   O  = Disig a.s. CN = CA Disig Root R2
+"MIIFaTCCA1GgAwIBAgIJAJK4iNuwisFjMA0GCSqGSIb3DQEBCwUAMFIxCzAJBgNV\n"
+"BAYTAlNLMRMwEQYDVQQHEwpCcmF0aXNsYXZhMRMwEQYDVQQKEwpEaXNpZyBhLnMu\n"
+"MRkwFwYDVQQDExBDQSBEaXNpZyBSb290IFIyMB4XDTEyMDcxOTA5MTUzMFoXDTQy\n"
+"MDcxOTA5MTUzMFowUjELMAkGA1UEBhMCU0sxEzARBgNVBAcTCkJyYXRpc2xhdmEx\n"
+"EzARBgNVBAoTCkRpc2lnIGEucy4xGTAXBgNVBAMTEENBIERpc2lnIFJvb3QgUjIw\n"
+"ggIiMA0GCSqGSIb3DQEBAQUAA4ICDwAwggIKAoICAQCio8QACdaFXS1tFPbCw3Oe\n"
+"NcJxVX6B+6tGUODBfEl45qt5WDza/3wcn9iXAng+a0EE6UG9vgMsRfYvZNSrXaNH\n"
+"PWSb6WiaxswbP7q+sos0Ai6YVRn8jG+qX9pMzk0DIaPY0jSTVpbLTAwAFjxfGs3I\n"
+"x2ymrdMxp7zo5eFm1tL7A7RBZckQrg4FY8aAamkw/dLukO8NJ9+flXP04SXabBbe\n"
+"QTg06ov80egEFGEtQX6sx3dOy1FU+16SGBsEWmjGycT6txOgmLcRK7fWV8x8nhfR\n"
+"yyX+hk4kLlYMeE2eARKmK6cBZW58Yh2EhN/qwGu1pSqVg8NTEQxzHQuyRpDRQjrO\n"
+"QG6Vrf/GlK1ul4SOfW+eioANSW1z4nuSHsPzwfPrLgVv2RvPN3YEyLRa5Beny912\n"
+"H9AZdugsBbPWnDTYltxhh5EF5EQIM8HauQhl1K6yNg3ruji6DOWbnuuNZt2Zz9aJ\n"
+"QfYEkoopKW1rOhzndX0CcQ7zwOe9yxndnWCywmZgtrEE7snmhrmaZkCo5xHtgUUD\n"
+"i/ZnWejBBhG93c+AAk9lQHhcR1DIm+YfgXvkRKhbhZri3lrVx/k6RGZL5DJUfORs\n"
+"nLMOPReisjQS1n6yqEm70XooQL6iFh/f5DcfEXP7kAplQ6INfPgGAVUzfbANuPT1\n"
+"rqVCV3w2EYx7XsQDnYx5nQIDAQABo0IwQDAPBgNVHRMBAf8EBTADAQH/MA4GA1Ud\n"
+"DwEB/wQEAwIBBjAdBgNVHQ4EFgQUtZn4r7CU9eMg1gqtzk5WpC5uQu0wDQYJKoZI\n"
+"hvcNAQELBQADggIBACYGXnDnZTPIgm7ZnBc6G3pmsgH2eDtpXi/q/075KMOYKmFM\n"
+"tCQSin1tERT3nLXK5ryeJ45MGcipvXrA1zYObYVybqjGom32+nNjf7xueQgcnYqf\n"
+"GopTpti72TVVsRHFqQOzVju5hJMiXn7B9hJSi+osZ7z+Nkz1uM/Rs0mSO9MpDpkb\n"
+"lvdhuDvEK7Z4bLQjb/D907JedR+Zlais9trhxTF7+9FGs9K8Z7RiVLoJ92Owk6Ka\n"
+"+elSLotgEqv89WBW7xBci8QaQtyDW2QOy7W81k/BfDxujRNt+3vrMNDcTa/F1bal\n"
+"TFtxyegxvug4BkihGuLq0t4SOVga/4AOgnXmt8kHbA7v/zjxmHHEt38OFdAlab0i\n"
+"nSvtBfZGR6ztwPDUO+Ls7pZbkBNOHlY667DvlruWIxG68kOGdGSVyCh13x01utI3\n"
+"gzhTODY7z2zp+WsO0PsE6E9312UBeIYMej4hYvF/Y3EMyZ9E26gnonW+boE+18Dr\n"
+"G5gPcFw0sorMwIUY6256s/daoQe/qUKS82Ail+QUoQebTnbAjn39pCXHR+3/H3Os\n"
+"zMOl6W8KjptlwlCFtaOgUxLMVYdh84GuEEZhvUQhuMI9dM9+JDX6HAcOmz0iyu8x\n"
+"L4ysEr3vQCj8KWefshNPZiTEUxnpHikV7+ZtsH8tZ/3zbBt1RqPlShfppNcL\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                        //   O  = China Financial Certification Authority CN = CFCA EV ROOT
+"MIIFjTCCA3WgAwIBAgIEGErM1jANBgkqhkiG9w0BAQsFADBWMQswCQYDVQQGEwJD\n"
+"TjEwMC4GA1UECgwnQ2hpbmEgRmluYW5jaWFsIENlcnRpZmljYXRpb24gQXV0aG9y\n"
+"aXR5MRUwEwYDVQQDDAxDRkNBIEVWIFJPT1QwHhcNMTIwODA4MDMwNzAxWhcNMjkx\n"
+"MjMxMDMwNzAxWjBWMQswCQYDVQQGEwJDTjEwMC4GA1UECgwnQ2hpbmEgRmluYW5j\n"
+"aWFsIENlcnRpZmljYXRpb24gQXV0aG9yaXR5MRUwEwYDVQQDDAxDRkNBIEVWIFJP\n"
+"T1QwggIiMA0GCSqGSIb3DQEBAQUAA4ICDwAwggIKAoICAQDXXWvNED8fBVnVBU03\n"
+"sQ7smCuOFR36k0sXgiFxEFLXUWRwFsJVaU2OFW2fvwwbwuCjZ9YMrM8irq93VCpL\n"
+"TIpTUnrD7i7es3ElweldPe6hL6P3KjzJIx1qqx2hp/Hz7KDVRM8Vz3IvHWOX6Jn5\n"
+"/ZOkVIBMUtRSqy5J35DNuF++P96hyk0g1CXohClTt7GIH//62pCfCqktQT+x8Rgp\n"
+"7hZZLDRJGqgG16iI0gNyejLi6mhNbiyWZXvKWfry4t3uMCz7zEasxGPrb382KzRz\n"
+"EpR/38wmnvFyXVBlWY9ps4deMm/DGIq1lY+wejfeWkU7xzbh72fROdOXW3NiGUgt\n"
+"hxwG+3SYIElz8AXSG7Ggo7cbcNOIabla1jj0Ytwli3i/+Oh+uFzJlU9fpy25IGvP\n"
+"a931DfSCt/SyZi4QKPaXWnuWFo8BGS1sbn85WAZkgwGDg8NNkt0yxoekN+kWzqot\n"
+"aK8KgWU6cMGbrU1tVMoqLUuFG7OA5nBFDWteNfB/O7ic5ARwiRIlk9oKmSJgamNg\n"
+"TnYGmE69g60dWIolhdLHZR4tjsbftsbhf4oEIRUpdPA+nJCdDC7xij5aqgwJHsfV\n"
+"PKPtl8MeNPo4+QgO48BdK4PRVmrJtqhUUy54Mmc9gn900PvhtgVguXDbjgv5E1hv\n"
+"cWAQUhC5wUEJ73IfZzF4/5YFjQIDAQABo2MwYTAfBgNVHSMEGDAWgBTj/i39KNAL\n"
+"tbq2osS/BqoFjJP7LzAPBgNVHRMBAf8EBTADAQH/MA4GA1UdDwEB/wQEAwIBBjAd\n"
+"BgNVHQ4EFgQU4/4t/SjQC7W6tqLEvwaqBYyT+y8wDQYJKoZIhvcNAQELBQADggIB\n"
+"ACXGumvrh8vegjmWPfBEp2uEcwPenStPuiB/vHiyz5ewG5zz13ku9Ui20vsXiObT\n"
+"ej/tUxPQ4i9qecsAIyjmHjdXNYmEwnZPNDatZ8POQQaIxffu2Bq41gt/UP+TqhdL\n"
+"jOztUmCypAbqTuv0axn96/Ua4CUqmtzHQTb3yHQFhDmVOdYLO6Qn+gjYXB74BGBS\n"
+"ESgoA//vU2YApUo0FmZ8/Qmkrp5nGm9BC2sGE5uPhnEFtC+NiWYzKXZUmhH4J/qy\n"
+"P5Hgzg0b8zAarb8iXRvTvyUFTeGSGn+ZnzxEk8rUQElsgIfXBDrDMlI1Dlb4pd19\n"
+"xIsNER9Tyx6yF7Zod1rg1MvIB671Oi6ON7fQAUtDKXeMOZePglr4UeWJoBjnaH9d\n"
+"Ci77o0cOPaYjesYBx4/IXr9tgFa+iiS6M+qf4TIRnvHST4D2G0CvOJ4RUHlzEhLN\n"
+"5mydLIhyPDCBBpEi6lmt2hkuIsKNuYyH4Ga8cyNfIWRjgEj1oDwYPZTISEEdQLpe\n"
+"/v5WOaHIz16eGWRGENoXkbcFgKyLmZJ956LYBws2J+dIeWCKw9cTXPhyQN9Ky8+Z\n"
+"AAoACxGV2lZFA4gKn2fQ1XmxqI1AbQ3CekD6819kR5LLU7m7Wc5P/dAVUwHY3+vZ\n"
+"5nbv0CO7O6l5s9UCKc2Jo5YPSjXnTkLAdc0Hz+Ys63su\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                         //   O  = COMODO CA Limited CN = COMODO Certification Authority
+"MIIEHTCCAwWgAwIBAgIQToEtioJl4AsC7j41AkblPTANBgkqhkiG9w0BAQUFADCB\n"
+"gTELMAkGA1UEBhMCR0IxGzAZBgNVBAgTEkdyZWF0ZXIgTWFuY2hlc3RlcjEQMA4G\n"
+"A1UEBxMHU2FsZm9yZDEaMBgGA1UEChMRQ09NT0RPIENBIExpbWl0ZWQxJzAlBgNV\n"
+"BAMTHkNPTU9ETyBDZXJ0aWZpY2F0aW9uIEF1dGhvcml0eTAeFw0wNjEyMDEwMDAw\n"
+"MDBaFw0yOTEyMzEyMzU5NTlaMIGBMQswCQYDVQQGEwJHQjEbMBkGA1UECBMSR3Jl\n"
+"YXRlciBNYW5jaGVzdGVyMRAwDgYDVQQHEwdTYWxmb3JkMRowGAYDVQQKExFDT01P\n"
+"RE8gQ0EgTGltaXRlZDEnMCUGA1UEAxMeQ09NT0RPIENlcnRpZmljYXRpb24gQXV0\n"
+"aG9yaXR5MIIBIjANBgkqhkiG9w0BAQEFAAOCAQ8AMIIBCgKCAQEA0ECLi3LjkRv3\n"
+"UcEbVASY06m/weaKXTuH+7uIzg3jLz8GlvCiKVCZrts7oVewdFFxze1CkU1B/qnI\n"
+"2GqGd0S7WWaXUF601CxwRM/aN5VCaTwwxHGzUvAhTaHYujl8HJ6jJJ3ygxaYqhZ8\n"
+"Q5sVW7euNJH+1GImGEaaP+vB+fGQV+useg2L23IwambV4EajcNxo2f8ESIl33rXp\n"
+"+2dtQem8Ob0y2WIC8bGoPW43nOIv4tOiJovGuFVDiOEjPqXSJDlqR6sA1KGzqSX+\n"
+"DT+nHbrTUcELpNqsOO9VUCQFZUaTNE8tja3G1CEZ0o7KBWFxB3NH5YoZEr0ETc5O\n"
+"nKVIrLsm9wIDAQABo4GOMIGLMB0GA1UdDgQWBBQLWOWLxkwVN6RAqTCpIb5HNlpW\n"
+"/zAOBgNVHQ8BAf8EBAMCAQYwDwYDVR0TAQH/BAUwAwEB/zBJBgNVHR8EQjBAMD6g\n"
+"PKA6hjhodHRwOi8vY3JsLmNvbW9kb2NhLmNvbS9DT01PRE9DZXJ0aWZpY2F0aW9u\n"
+"QXV0aG9yaXR5LmNybDANBgkqhkiG9w0BAQUFAAOCAQEAPpiem/Yb6dc5t3iuHXIY\n"
+"SdOH5EOC6z/JqvWote9VfCFSZfnVDeFs9D6Mk3ORLgLETgdxb8CPOGEIqB6BCsAv\n"
+"IC9Bi5HcSEW88cbeunZrM8gALTFGTO3nnc+IlP8zwFboJIYmuNg4ON8qa90SzMc/\n"
+"RxdMosIGlgnW2/4/PEZB31jiVg88O8EckzXZOFKs7sjsLjBOlDW0JB9LeGna8gI4\n"
+"zJVSk/BwJVmcIGfE7vmLV2H0knZ9P4SNVbfo5azV8fUZVqZa+5Acr5Pr5RzUZ5dd\n"
+"BA6+C4OmF4O5MBKgxTMVBbkN+8cFduPYSo38NBejxiEovjBFMR7HeL5YYTisO+IB\n"
+"ZQ==\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                       //   O  = COMODO CA Limited CN = COMODO ECC Certification Authority
+"MIICiTCCAg+gAwIBAgIQH0evqmIAcFBUTAGem2OZKjAKBggqhkjOPQQDAzCBhTEL\n"
+"MAkGA1UEBhMCR0IxGzAZBgNVBAgTEkdyZWF0ZXIgTWFuY2hlc3RlcjEQMA4GA1UE\n"
+"BxMHU2FsZm9yZDEaMBgGA1UEChMRQ09NT0RPIENBIExpbWl0ZWQxKzApBgNVBAMT\n"
+"IkNPTU9ETyBFQ0MgQ2VydGlmaWNhdGlvbiBBdXRob3JpdHkwHhcNMDgwMzA2MDAw\n"
+"MDAwWhcNMzgwMTE4MjM1OTU5WjCBhTELMAkGA1UEBhMCR0IxGzAZBgNVBAgTEkdy\n"
+"ZWF0ZXIgTWFuY2hlc3RlcjEQMA4GA1UEBxMHU2FsZm9yZDEaMBgGA1UEChMRQ09N\n"
+"T0RPIENBIExpbWl0ZWQxKzApBgNVBAMTIkNPTU9ETyBFQ0MgQ2VydGlmaWNhdGlv\n"
+"biBBdXRob3JpdHkwdjAQBgcqhkjOPQIBBgUrgQQAIgNiAAQDR3svdcmCFYX7deSR\n"
+"FtSrYpn1PlILBs5BAH+X4QokPB0BBO490o0JlwzgdeT6+3eKKvUDYEs2ixYjFq0J\n"
+"cfRK9ChQtP6IHG4/bC8vCVlbpVsLM5niwz2J+Wos77LTBumjQjBAMB0GA1UdDgQW\n"
+"BBR1cacZSBm8nZ3qQUfflMRId5nTeTAOBgNVHQ8BAf8EBAMCAQYwDwYDVR0TAQH/\n"
+"BAUwAwEB/zAKBggqhkjOPQQDAwNoADBlAjEA7wNbeqy3eApyt4jf/7VGFAkK+qDm\n"
+"fQjGGoe9GKhzvSbKYAydzpmfz1wPMOG+FDHqAjAU9JM8SaczepBGR7NjfRObTrdv\n"
+"GDeAU/7dIOA1mjbRxwG55tzd8/8dLDoWV9mSOdY=\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                         //   O  = COMODO CA Limited CN = COMODO RSA Certification Authority
+"MIIF2DCCA8CgAwIBAgIQTKr5yttjb+Af907YWwOGnTANBgkqhkiG9w0BAQwFADCB\n"
+"hTELMAkGA1UEBhMCR0IxGzAZBgNVBAgTEkdyZWF0ZXIgTWFuY2hlc3RlcjEQMA4G\n"
+"A1UEBxMHU2FsZm9yZDEaMBgGA1UEChMRQ09NT0RPIENBIExpbWl0ZWQxKzApBgNV\n"
+"BAMTIkNPTU9ETyBSU0EgQ2VydGlmaWNhdGlvbiBBdXRob3JpdHkwHhcNMTAwMTE5\n"
+"MDAwMDAwWhcNMzgwMTE4MjM1OTU5WjCBhTELMAkGA1UEBhMCR0IxGzAZBgNVBAgT\n"
+"EkdyZWF0ZXIgTWFuY2hlc3RlcjEQMA4GA1UEBxMHU2FsZm9yZDEaMBgGA1UEChMR\n"
+"Q09NT0RPIENBIExpbWl0ZWQxKzApBgNVBAMTIkNPTU9ETyBSU0EgQ2VydGlmaWNh\n"
+"dGlvbiBBdXRob3JpdHkwggIiMA0GCSqGSIb3DQEBAQUAA4ICDwAwggIKAoICAQCR\n"
+"6FSS0gpWsawNJN3Fz0RndJkrN6N9I3AAcbxT38T6KhKPS38QVr2fcHK3YX/JSw8X\n"
+"pz3jsARh7v8Rl8f0hj4K+j5c+ZPmNHrZFGvnnLOFoIJ6dq9xkNfs/Q36nGz637CC\n"
+"9BR++b7Epi9Pf5l/tfxnQ3K9DADWietrLNPtj5gcFKt+5eNu/Nio5JIk2kNrYrhV\n"
+"/erBvGy2i/MOjZrkm2xpmfh4SDBF1a3hDTxFYPwyllEnvGfDyi62a+pGx8cgoLEf\n"
+"Zd5ICLqkTqnyg0Y3hOvozIFIQ2dOciqbXL1MGyiKXCJ7tKuY2e7gUYPDCUZObT6Z\n"
+"+pUX2nwzV0E8jVHtC7ZcryxjGt9XyD+86V3Em69FmeKjWiS0uqlWPc9vqv9JWL7w\n"
+"qP/0uK3pN/u6uPQLOvnoQ0IeidiEyxPx2bvhiWC4jChWrBQdnArncevPDt09qZah\n"
+"SL0896+1DSJMwBGB7FY79tOi4lu3sgQiUpWAk2nojkxl8ZEDLXB0AuqLZxUpaVIC\n"
+"u9ffUGpVRr+goyhhf3DQw6KqLCGqR84onAZFdr+CGCe01a60y1Dma/RMhnEw6abf\n"
+"Fobg2P9A3fvQQoh/ozM6LlweQRGBY84YcWsr7KaKtzFcOmpH4MN5WdYgGq/yapiq\n"
+"crxXStJLnbsQ/LBMQeXtHT1eKJ2czL+zUdqnR+WEUwIDAQABo0IwQDAdBgNVHQ4E\n"
+"FgQUu69+Aj36pvE8hI6t7jiY7NkyMtQwDgYDVR0PAQH/BAQDAgEGMA8GA1UdEwEB\n"
+"/wQFMAMBAf8wDQYJKoZIhvcNAQEMBQADggIBAArx1UaEt65Ru2yyTUEUAJNMnMvl\n"
+"wFTPoCWOAvn9sKIN9SCYPBMtrFaisNZ+EZLpLrqeLppysb0ZRGxhNaKatBYSaVqM\n"
+"4dc+pBroLwP0rmEdEBsqpIt6xf4FpuHA1sj+nq6PK7o9mfjYcwlYRm6mnPTXJ9OV\n"
+"2jeDchzTc+CiR5kDOF3VSXkAKRzH7JsgHAckaVd4sjn8OoSgtZx8jb8uk2Intzna\n"
+"FxiuvTwJaP+EmzzV1gsD41eeFPfR60/IvYcjt7ZJQ3mFXLrrkguhxuhoqEwWsRqZ\n"
+"CuhTLJK7oQkYdQxlqHvLI7cawiiFwxv/0Cti76R7CZGYZ4wUAc1oBmpjIXUDgIiK\n"
+"boHGhfKppC3n9KUkEEeDys30jXlYsQab5xoq2Z0B15R97QNKyvDb6KkBPvVWmcke\n"
+"jkk9u+UJueBPSZI9FoJAzMxZxuY67RIuaTxslbH9qh17f4a+Hg4yRvv7E491f0yL\n"
+"S0Zj/gA0QHDBw7mh3aZw4gSzQbzpgJHqZJx64SIDqZxubw5lT2yHh17zbqD5daWb\n"
+"QOhTsiedSrnAdyGN/4fy3ryM7xfft0kL0fJuMAsaDk527RH89elWsn2/x20Kk4yl\n"
+"0MC2Hb46TpSi125sC8KKfPog88Tk5c0NqMuRkrF8hey1FGlmDoLnzc7ILaZRfyHB\n"
+"NVOFBkpdn627G190\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                         //   O  = Dhimyotis CN = Certigna
+"MIIDqDCCApCgAwIBAgIJAP7c4wEPyUj/MA0GCSqGSIb3DQEBBQUAMDQxCzAJBgNV\n"
+"BAYTAkZSMRIwEAYDVQQKDAlEaGlteW90aXMxETAPBgNVBAMMCENlcnRpZ25hMB4X\n"
+"DTA3MDYyOTE1MTMwNVoXDTI3MDYyOTE1MTMwNVowNDELMAkGA1UEBhMCRlIxEjAQ\n"
+"BgNVBAoMCURoaW15b3RpczERMA8GA1UEAwwIQ2VydGlnbmEwggEiMA0GCSqGSIb3\n"
+"DQEBAQUAA4IBDwAwggEKAoIBAQDIaPHJ1tazNHUmgh7stL7qXOEm7RFHYeGifBZ4\n"
+"QCHkYJ5ayGPhxLGWkv8YbWkj4Sti993iNi+RB7lIzw7sebYs5zRLcAglozyHGxny\n"
+"gQcPOJAZ0xH+hrTy0V4eHpbNgGzOOzGTtvKg0KmVEn2lmsxryIRWijOp5yIVUxbw\n"
+"zBfsV1/pogqYCd7jX5xv3EjjhQsVWqa6n6xI4wmy9/Qy3l40vhx4XUJbzg4ij02Q\n"
+"130yGLMLLGq/jj8UEYkgDncUtT2UCIf3JR7VsmAA7G8qKCVuKj4YYxclPz5EIBb2\n"
+"JsglrgVKtOdjLPOMFlN+XPsRGgjBRmKfIrjxwo1p3Po6WAbfAgMBAAGjgbwwgbkw\n"
+"DwYDVR0TAQH/BAUwAwEB/zAdBgNVHQ4EFgQUGu3+QTmQtCRZvgHyUtVF9lo53BEw\n"
+"ZAYDVR0jBF0wW4AUGu3+QTmQtCRZvgHyUtVF9lo53BGhOKQ2MDQxCzAJBgNVBAYT\n"
+"AkZSMRIwEAYDVQQKDAlEaGlteW90aXMxETAPBgNVBAMMCENlcnRpZ25hggkA/tzj\n"
+"AQ/JSP8wDgYDVR0PAQH/BAQDAgEGMBEGCWCGSAGG+EIBAQQEAwIABzANBgkqhkiG\n"
+"9w0BAQUFAAOCAQEAhQMeknH2Qq/ho2Ge6/PAD/Kl1NqV5ta+aDY9fm4fTIrv0Q8h\n"
+"bV6lUmPOEvjvKtpv6zf+EwLHyzs+ImvaYS5/1HI93TDhHkxAGYwP15zRgzB7mFnc\n"
+"fca5DClMoTOi62c6ZYTTluLtdkVwj7Ur3vkj1kluPBS1xp81HlDQwY9qcEQCYsuu\n"
+"HWhBp6pX6FOqB9IG9tUUBguRA3UsbHK1YZWaDYu5Def131TN3ubY1gkIl2PlwS6w\n"
+"t0QmwCbAr1UwnjvVNioZBPRcHv/PLLf/0P2HQBHVESO7SMAhqaQoLf0V+LBOK/Qw\n"
+"WyH8EZE0vkHve52Xdf+XlcCWWC/qu0bXu+TZLg==\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                        //   O  = Unizeto Technologies S.A. OU = Certum Certification Authority CN = Certum Trusted Network CA
+"MIIDuzCCAqOgAwIBAgIDBETAMA0GCSqGSIb3DQEBBQUAMH4xCzAJBgNVBAYTAlBM\n"
+"MSIwIAYDVQQKExlVbml6ZXRvIFRlY2hub2xvZ2llcyBTLkEuMScwJQYDVQQLEx5D\n"
+"ZXJ0dW0gQ2VydGlmaWNhdGlvbiBBdXRob3JpdHkxIjAgBgNVBAMTGUNlcnR1bSBU\n"
+"cnVzdGVkIE5ldHdvcmsgQ0EwHhcNMDgxMDIyMTIwNzM3WhcNMjkxMjMxMTIwNzM3\n"
+"WjB+MQswCQYDVQQGEwJQTDEiMCAGA1UEChMZVW5pemV0byBUZWNobm9sb2dpZXMg\n"
+"Uy5BLjEnMCUGA1UECxMeQ2VydHVtIENlcnRpZmljYXRpb24gQXV0aG9yaXR5MSIw\n"
+"IAYDVQQDExlDZXJ0dW0gVHJ1c3RlZCBOZXR3b3JrIENBMIIBIjANBgkqhkiG9w0B\n"
+"AQEFAAOCAQ8AMIIBCgKCAQEA4/t9o3K6wvDJFIf1awFO4W5AB7ptJ11/91sts1rH\n"
+"UV+rpDKmYYe2bg+G0jACl/jXaVehGDldamR5xgFZrDwxSjh80gTSSyjoIF87B6LM\n"
+"TXPb865Px1bVWqeWifrzq2jUI4ZZJ88JJ7ysbnKDHDBy3+Ci6dLhdHUZvSqeexVU\n"
+"BBvXQzmtVSjF4hq79MDkrjhJM8x2hZ85RdKknvISjFH4fOQtf/WsX+sWn7Et0brM\n"
+"kUJ3TCXJkDhv2/DM+44el1k+1WBO5gUo7Ul5E0u6SNsv+XLTOcr+H9g0cvW0QM8x\n"
+"AcPs3hEtF10fuFDRXhmnad4HMyjKUJX5p1TLVIZQRan5SQIDAQABo0IwQDAPBgNV\n"
+"HRMBAf8EBTADAQH/MB0GA1UdDgQWBBQIds3LB/8k9sXN7buQvOKEN0Z19zAOBgNV\n"
+"HQ8BAf8EBAMCAQYwDQYJKoZIhvcNAQEFBQADggEBAKaorSLOAT2mo/9i0Eidi15y\n"
+"sHhE49wcrwn9I0j6vSrEuVUEtRCjjSfeC4Jj0O7eDDd5QVsisrCaQVymcODU0HfL\n"
+"I9MA4GxWL+FpDQ3Zqr8hgVDZBqWo/5U30Kr+4rP1mS1FhIrlQgnXdAIv94nYmem8\n"
+"J9RHjboNRhx3zxSkHLmkMcScKHQDNP8zGSal6Q10tz6XxnboJ5ajZt3hrvJBW8qY\n"
+"VoNzcOSGGtIxQbovvi0TWnZvTuhOgQ4/WwMioBK+ZlgRSssDxLQqKi2WF+A5VLxI\n"
+"03YnnZotBqbJ7DnSq9ufmgsnAjUpsUCV5/nonFWIGUbWtzT1fs45mtk48VH3Tyw=\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                        //   O  = Unizeto Technologies S.A. OU = Certum Certification Authority CN = Certum Trusted Network CA 2
+"MIIF0jCCA7qgAwIBAgIQIdbQSk8lD8kyN/yqXhKN6TANBgkqhkiG9w0BAQ0FADCB\n"
+"gDELMAkGA1UEBhMCUEwxIjAgBgNVBAoTGVVuaXpldG8gVGVjaG5vbG9naWVzIFMu\n"
+"QS4xJzAlBgNVBAsTHkNlcnR1bSBDZXJ0aWZpY2F0aW9uIEF1dGhvcml0eTEkMCIG\n"
+"A1UEAxMbQ2VydHVtIFRydXN0ZWQgTmV0d29yayBDQSAyMCIYDzIwMTExMDA2MDgz\n"
+"OTU2WhgPMjA0NjEwMDYwODM5NTZaMIGAMQswCQYDVQQGEwJQTDEiMCAGA1UEChMZ\n"
+"VW5pemV0byBUZWNobm9sb2dpZXMgUy5BLjEnMCUGA1UECxMeQ2VydHVtIENlcnRp\n"
+"ZmljYXRpb24gQXV0aG9yaXR5MSQwIgYDVQQDExtDZXJ0dW0gVHJ1c3RlZCBOZXR3\n"
+"b3JrIENBIDIwggIiMA0GCSqGSIb3DQEBAQUAA4ICDwAwggIKAoICAQC9+Xj45tWA\n"
+"DGSdhhuWZGc/IjoedQF97/tcZ4zJzFxrqZHmuULlIEub2pt7uZld2ZuAS9eEQCsn\n"
+"0+i6MLs+CRqnSZXvK0AkwpfHp+6bJe+oCgCXhVqqndwpyeI1B+twTUrWwbNWuKFB\n"
+"OJvR+zF/j+Bf4bE/D44WSWDXBo0Y+aomEKsq09DRZ40bRr5HMNUuctHFY9rnY3lE\n"
+"fktjJImGLjQ/KUxSiyqnwOKRKIm5wFv5HdnnJ63/mgKXwcZQkpsCLL2puTRZCr+E\n"
+"Sv/f/rOf69me4Jgj7KZrdxYq28ytOxykh9xGc14ZYmhFV+SQgkK7QtbwYeDBoz1m\n"
+"o130GO6IyY0XRSmZMnUCMe4pJshrAua1YkV/NxVaI2iJ1D7eTiew8EAMvE0Xy02i\n"
+"sx7QBlrd9pPPV3WZ9fqGGmd4s7+W/jTcvedSVuWz5XV710GRBdxdaeOVDUO5/IOW\n"
+"OZV7bIBaTxNyxtd9KXpEulKkKtVBRgkg/iKgtlswjbyJDNXXcPiHUv3a76xRLgez\n"
+"Tv7QCdpw75j6VuZt27VXS9zlLCUVyJ4ueE742pyehizKV/Ma5ciSixqClnrDvFAS\n"
+"adgOWkaLOusm+iPJtrCBvkIApPjW/jAux9JG9uWOdf3yzLnQh1vMBhBgu4M1t15n\n"
+"3kfsmUjxpKEV/q2MYo45VU85FrmxY53/twIDAQABo0IwQDAPBgNVHRMBAf8EBTAD\n"
+"AQH/MB0GA1UdDgQWBBS2oVQ5AsOgP46KvPrU+Bym0ToO/TAOBgNVHQ8BAf8EBAMC\n"
+"AQYwDQYJKoZIhvcNAQENBQADggIBAHGlDs7k6b8/ONWJWsQCYftMxRQXLYtPU2sQ\n"
+"F/xlhMcQSZDe28cmk4gmb3DWAl45oPePq5a1pRNcgRRtDoGCERuKTsZPpd1iHkTf\n"
+"CVn0W3cLN+mLIMb4Ck4uWBzrM9DPhmDJ2vuAL55MYIR4PSFk1vtBHxgP58l1cb29\n"
+"XN40hz5BsA72udY/CROWFC/emh1auVbONTqwX3BNXuMp8SMoclm2q8KMZiYcdywm\n"
+"djWLKKdpoPk79SPdhRB0yZADVpHnr7pH1BKXESLjokmUbOe3lEu6LaTaM4tMpkT/\n"
+"WjzGHWTYtTHkpjx6qFcL2+1hGsvxznN3Y6SHb0xRONbkX8eftoEq5IVIeVheO/jb\n"
+"AoJnwTnbw3RLPTYe+SmTiGhbqEQZIfCn6IENLOiTNrQ3ssqwGyZ6miUfmpqAnksq\n"
+"P/ujmv5zMnHCnsZy4YpoJ/HkD7TETKVhk/iXEAcqMCWpuchxuO9ozC1+9eB+D4Ko\n"
+"b7a6bINDd82Kkhehnlt4Fj1F4jNy3eFmypnTycUm/Q1oBEauttmbjL4ZvrHG8hnj\n"
+"XALKLNhvSgfZyTXaQHXyxKcZb55CEJh15pWLYLztxRLXis7VmFxWlgPF7ncGNf/P\n"
+"5O4/E2Hu29othfDNrp2yGAlFw5Khchf8R7agCyzxxN5DaAhqXzvwdmP7zAYspsbi\n"
+"DrW5viSP\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                        //   O            = AC Camerfirma S.A. CN           = Chambers of Commerce Root - 2008
+"MIIHTzCCBTegAwIBAgIJAKPaQn6ksa7aMA0GCSqGSIb3DQEBBQUAMIGuMQswCQYD\n"
+"VQQGEwJFVTFDMEEGA1UEBxM6TWFkcmlkIChzZWUgY3VycmVudCBhZGRyZXNzIGF0\n"
+"IHd3dy5jYW1lcmZpcm1hLmNvbS9hZGRyZXNzKTESMBAGA1UEBRMJQTgyNzQzMjg3\n"
+"MRswGQYDVQQKExJBQyBDYW1lcmZpcm1hIFMuQS4xKTAnBgNVBAMTIENoYW1iZXJz\n"
+"IG9mIENvbW1lcmNlIFJvb3QgLSAyMDA4MB4XDTA4MDgwMTEyMjk1MFoXDTM4MDcz\n"
+"MTEyMjk1MFowga4xCzAJBgNVBAYTAkVVMUMwQQYDVQQHEzpNYWRyaWQgKHNlZSBj\n"
+"dXJyZW50IGFkZHJlc3MgYXQgd3d3LmNhbWVyZmlybWEuY29tL2FkZHJlc3MpMRIw\n"
+"EAYDVQQFEwlBODI3NDMyODcxGzAZBgNVBAoTEkFDIENhbWVyZmlybWEgUy5BLjEp\n"
+"MCcGA1UEAxMgQ2hhbWJlcnMgb2YgQ29tbWVyY2UgUm9vdCAtIDIwMDgwggIiMA0G\n"
+"CSqGSIb3DQEBAQUAA4ICDwAwggIKAoICAQCvAMtwNyuAWko6bHiUfaN/Gh/2NdW9\n"
+"28sNRHI+JrKQUrpjOyhYb6WzbZSm891kDFX29ufyIiKAXuFixrYp4YFs8r/lfTJq\n"
+"VKAyGVn+H4vXPWCGhSRv4xGzdz4gljUha7MI2XAuZPeEklPWDrCQiorjh40G072Q\n"
+"DuKZoRuGDtqaCrsLYVAGUvGef3bsyw/QHg3PmTA9HMRFEFis1tPo1+XqxQEHd9ZR\n"
+"5gN/ikilTWh1uem8nk4ZcfUyS5xtYBkL+8ydddy/Js2Pk3g5eXNeJQ7KXOt3EgfL\n"
+"ZEFHcpOrUMPrCXZkNNI5t3YRCQ12RcSprj1qr7V9ZS+UWBDsXHyvfuK2GNnQm05a\n"
+"Sd+pZgvMPMZ4fKecHePOjlO+Bd5gD2vlGts/4+EhySnB8esHnFIbAURRPHsl18Tl\n"
+"UlRdJQfKFiC4reRB7noI/plvg6aRArBsNlVq5331lubKgdaX8ZSD6e2wsWsSaR6s\n"
+"+12pxZjptFtYer49okQ6Y1nUCyXeG0+95QGezdIp1Z8XGQpvvwyQ0wlf2eOKNcx5\n"
+"Wk0ZN5K3xMGtr/R5JJqyAQuxr1yW84Ay+1w9mPGgP0revq+ULtlVmhduYJ1jbLhj\n"
+"ya6BXBg14JC7vjxPNyK5fuvPnnchpj04gftI2jE9K+OJ9dC1vX7gUMQSibMjmhAx\n"
+"hduub+84Mxh2EQIDAQABo4IBbDCCAWgwEgYDVR0TAQH/BAgwBgEB/wIBDDAdBgNV\n"
+"HQ4EFgQU+SSsD7K1+HnA+mCIG8TZTQKeFxkwgeMGA1UdIwSB2zCB2IAU+SSsD7K1\n"
+"+HnA+mCIG8TZTQKeFxmhgbSkgbEwga4xCzAJBgNVBAYTAkVVMUMwQQYDVQQHEzpN\n"
+"YWRyaWQgKHNlZSBjdXJyZW50IGFkZHJlc3MgYXQgd3d3LmNhbWVyZmlybWEuY29t\n"
+"L2FkZHJlc3MpMRIwEAYDVQQFEwlBODI3NDMyODcxGzAZBgNVBAoTEkFDIENhbWVy\n"
+"ZmlybWEgUy5BLjEpMCcGA1UEAxMgQ2hhbWJlcnMgb2YgQ29tbWVyY2UgUm9vdCAt\n"
+"IDIwMDiCCQCj2kJ+pLGu2jAOBgNVHQ8BAf8EBAMCAQYwPQYDVR0gBDYwNDAyBgRV\n"
+"HSAAMCowKAYIKwYBBQUHAgEWHGh0dHA6Ly9wb2xpY3kuY2FtZXJmaXJtYS5jb20w\n"
+"DQYJKoZIhvcNAQEFBQADggIBAJASryI1wqM58C7e6bXpeHxIvj99RZJe6dqxGfwW\n"
+"PJ+0W2aeaufDuV2I6A+tzyMP3iU6XsxPpcG1Lawk0lgH3qLPaYRgM+gQDROpI9CF\n"
+"5Y57pp49chNyM/WqfcZjHwj0/gF/JM8rLFQJ3uIrbZLGOU8W6jx+ekbURWpGqOt1\n"
+"glanq6B8aBMz9p0w8G8nOSQjKpD9kCk18pPfNKXG9/jvjA9iSnyu0/VU+I22mlaH\n"
+"FoI6M6taIgj3grrqLuBHmrS1RaMFO9ncLkVAO+rcf+g769HsJtg1pDDFOqxXnrN2\n"
+"pSB7+R5KBWIBpih1YJeSDW4+TTdDDZIVnBgizVGZoCkaPF+KMjNbMMeJL0eYD6MD\n"
+"xvbxrN8y8NmBGuScvfaAFPDRLLmF9dijscilIeUcE5fuDr3fKanvNFNb0+RqE4QG\n"
+"tjICxFKuItLcsiFCGtpA8CnJ7AoMXOLQusxI0zcKzBIKinmwPQN/aUv0NCB9szTq\n"
+"jktk9T79syNnFQ0EuPAtwQlRPLJsFfClI9eDdOTlLsn+mCdCxqvGnrDQWzilm1De\n"
+"fhiYtUU79nm06PcaewaD+9CL2rvHvRirCG88gGtAPxkZumWK5r7VXNM21+9AUiRg\n"
+"OGcEMeyP84LG3rlV8zsxkVrctQgVrXYlCg17LofiDKYGvCYQbTed7N14jHyAxfDZ\n"
+"d0jQ\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                        //   O  = Comodo CA Limited CN = AAA Certificate Services
+"MIIEMjCCAxqgAwIBAgIBATANBgkqhkiG9w0BAQUFADB7MQswCQYDVQQGEwJHQjEb\n"
+"MBkGA1UECAwSR3JlYXRlciBNYW5jaGVzdGVyMRAwDgYDVQQHDAdTYWxmb3JkMRow\n"
+"GAYDVQQKDBFDb21vZG8gQ0EgTGltaXRlZDEhMB8GA1UEAwwYQUFBIENlcnRpZmlj\n"
+"YXRlIFNlcnZpY2VzMB4XDTA0MDEwMTAwMDAwMFoXDTI4MTIzMTIzNTk1OVowezEL\n"
+"MAkGA1UEBhMCR0IxGzAZBgNVBAgMEkdyZWF0ZXIgTWFuY2hlc3RlcjEQMA4GA1UE\n"
+"BwwHU2FsZm9yZDEaMBgGA1UECgwRQ29tb2RvIENBIExpbWl0ZWQxITAfBgNVBAMM\n"
+"GEFBQSBDZXJ0aWZpY2F0ZSBTZXJ2aWNlczCCASIwDQYJKoZIhvcNAQEBBQADggEP\n"
+"ADCCAQoCggEBAL5AnfRu4ep2hxxNRUSOvkbIgwadwSr+GB+O5AL686tdUIoWMQua\n"
+"BtDFcCLNSS1UY8y2bmhGC1Pqy0wkwLxyTurxFa70VJoSCsN6sjNg4tqJVfMiWPPe\n"
+"3M/vg4aijJRPn2jymJBGhCfHdr/jzDUsi14HZGWCwEiwqJH5YZ92IFCokcdmtet4\n"
+"YgNW8IoaE+oxox6gmf049vYnMlhvB/VruPsUK6+3qszWY19zjNoFmag4qMsXeDZR\n"
+"rOme9Hg6jc8P2ULimAyrL58OAd7vn5lJ8S3frHRNG5i1R8XlKdH5kBjHYpy+g8cm\n"
+"ez6KJcfA3Z3mNWgQIJ2P2N7Sw4ScDV7oL8kCAwEAAaOBwDCBvTAdBgNVHQ4EFgQU\n"
+"oBEKIz6W8Qfs4q8p74Klf9AwpLQwDgYDVR0PAQH/BAQDAgEGMA8GA1UdEwEB/wQF\n"
+"MAMBAf8wewYDVR0fBHQwcjA4oDagNIYyaHR0cDovL2NybC5jb21vZG9jYS5jb20v\n"
+"QUFBQ2VydGlmaWNhdGVTZXJ2aWNlcy5jcmwwNqA0oDKGMGh0dHA6Ly9jcmwuY29t\n"
+"b2RvLm5ldC9BQUFDZXJ0aWZpY2F0ZVNlcnZpY2VzLmNybDANBgkqhkiG9w0BAQUF\n"
+"AAOCAQEACFb8AvCb6P+k+tZ7xkSAzk/ExfYAWMymtrwUSWgEdujm7l3sAg9g1o1Q\n"
+"GE8mTgHj5rCl7r+8dFRBv/38ErjHT1r0iWAFf2C3BUrz9vHCv8S5dIa2LX1rzNLz\n"
+"Rt0vxuBqw8M0Ayx9lt1awg6nCpnBBYurDC/zXDrPbDdVCYfeU0BsWO/8tqtlbgT2\n"
+"G9w84FoVxp7Z8VlIMCFlA2zs6SFz7JsDoeA3raAVGI/6ugLOpyypEBMs1OUIJqsi\n"
+"l2D4kF501KKaU73yqWjgom7C12yxow+ev+to51byrvLjKzg6CYG1a4XXvi3tPxq3\n"
+"smPi9WIsgtRqAEFQ8TmDn5XpNpaYbg==\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                        //  O  = Cybertrust, Inc CN = Cybertrust Global Root
+"MIIDoTCCAomgAwIBAgILBAAAAAABD4WqLUgwDQYJKoZIhvcNAQEFBQAwOzEYMBYG\n"
+"A1UEChMPQ3liZXJ0cnVzdCwgSW5jMR8wHQYDVQQDExZDeWJlcnRydXN0IEdsb2Jh\n"
+"bCBSb290MB4XDTA2MTIxNTA4MDAwMFoXDTIxMTIxNTA4MDAwMFowOzEYMBYGA1UE\n"
+"ChMPQ3liZXJ0cnVzdCwgSW5jMR8wHQYDVQQDExZDeWJlcnRydXN0IEdsb2JhbCBS\n"
+"b290MIIBIjANBgkqhkiG9w0BAQEFAAOCAQ8AMIIBCgKCAQEA+Mi8vRRQZhP/8NN5\n"
+"7CPytxrHjoXxEnOmGaoQ25yiZXRadz5RfVb23CO21O1fWLE3TdVJDm71aofW0ozS\n"
+"J8bi/zafmGWgE07GKmSb1ZASzxQG9Dvj1Ci+6A74q05IlG2OlTEQXO2iLb3VOm2y\n"
+"HLtgwEZLAfVJrn5GitB0jaEMAs7u/OePuGtm839EAL9mJRQr3RAwHQeWP032a7iP\n"
+"t3sMpTjr3kfb1V05/Iin89cqdPHoWqI7n1C6poxFNcJQZZXcY4Lv3b93TZxiyWNz\n"
+"FtApD0mpSPCzqrdsxacwOUBdrsTiXSZT8M4cIwhhqJQZugRiQOwfOHB3EgZxpzAY\n"
+"XSUnpQIDAQABo4GlMIGiMA4GA1UdDwEB/wQEAwIBBjAPBgNVHRMBAf8EBTADAQH/\n"
+"MB0GA1UdDgQWBBS2CHsNesysIEyGVjJez6tuhS1wVzA/BgNVHR8EODA2MDSgMqAw\n"
+"hi5odHRwOi8vd3d3Mi5wdWJsaWMtdHJ1c3QuY29tL2NybC9jdC9jdHJvb3QuY3Js\n"
+"MB8GA1UdIwQYMBaAFLYIew16zKwgTIZWMl7Pq26FLXBXMA0GCSqGSIb3DQEBBQUA\n"
+"A4IBAQBW7wojoFROlZfJ+InaRcHUowAl9B8Tq7ejhVhpwjCt2BWKLePJzYFa+HMj\n"
+"Wqd8BfP9IjsO0QbE2zZMcwSO5bAi5MXzLqXZI+O4Tkogp24CJJ8iYGd7ix1yCcUx\n"
+"XOl5n4BHPa2hCwcUPUf/A2kaDAtE52Mlp3+yybh2hO0j9n0Hq0V+09+zv+mKts2o\n"
+"omcrUtW3ZfA5TGOgkXmTUg9U3YO7n9GPp1Nzw8v/MOx8BLjYRB+TX3EJIrduPuoc\n"
+"A06dGiBh+4E37F78CkWr1+cXVdCg6mCbpvbjjFspwgZgFJ0tl0ypkxWdYcQBX0jW\n"
+"WL1WMRJOEcgh4LMRkWXbtKaIOM5V\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                        //  O  = D-Trust GmbH CN = D-TRUST Root Class 3 CA 2 2009
+"MIIEMzCCAxugAwIBAgIDCYPzMA0GCSqGSIb3DQEBCwUAME0xCzAJBgNVBAYTAkRF\n"
+"MRUwEwYDVQQKDAxELVRydXN0IEdtYkgxJzAlBgNVBAMMHkQtVFJVU1QgUm9vdCBD\n"
+"bGFzcyAzIENBIDIgMjAwOTAeFw0wOTExMDUwODM1NThaFw0yOTExMDUwODM1NTha\n"
+"ME0xCzAJBgNVBAYTAkRFMRUwEwYDVQQKDAxELVRydXN0IEdtYkgxJzAlBgNVBAMM\n"
+"HkQtVFJVU1QgUm9vdCBDbGFzcyAzIENBIDIgMjAwOTCCASIwDQYJKoZIhvcNAQEB\n"
+"BQADggEPADCCAQoCggEBANOySs96R+91myP6Oi/WUEWJNTrGa9v+2wBoqOADER03\n"
+"UAifTUpolDWzU9GUY6cgVq/eUXjsKj3zSEhQPgrfRlWLJ23DEE0NkVJD2IfgXU42\n"
+"tSHKXzlABF9bfsyjxiupQB7ZNoTWSPOSHjRGICTBpFGOShrvUD9pXRl/RcPHAY9R\n"
+"ySPocq60vFYJfxLLHLGvKZAKyVXMD9O0Gu1HNVpK7ZxzBCHQqr0ME7UAyiZsxGsM\n"
+"lFqVlNpQmvH/pStmMaTJOKDfHR+4CS7zp+hnUquVH+BGPtikw8paxTGA6Eian5Rp\n"
+"/hnd2HN8gcqW3o7tszIFZYQ05ub9VxC1X3a/L7AQDcUCAwEAAaOCARowggEWMA8G\n"
+"A1UdEwEB/wQFMAMBAf8wHQYDVR0OBBYEFP3aFMSfMN4hvR5COfyrYyNJ4PGEMA4G\n"
+"A1UdDwEB/wQEAwIBBjCB0wYDVR0fBIHLMIHIMIGAoH6gfIZ6bGRhcDovL2RpcmVj\n"
+"dG9yeS5kLXRydXN0Lm5ldC9DTj1ELVRSVVNUJTIwUm9vdCUyMENsYXNzJTIwMyUy\n"
+"MENBJTIwMiUyMDIwMDksTz1ELVRydXN0JTIwR21iSCxDPURFP2NlcnRpZmljYXRl\n"
+"cmV2b2NhdGlvbmxpc3QwQ6BBoD+GPWh0dHA6Ly93d3cuZC10cnVzdC5uZXQvY3Js\n"
+"L2QtdHJ1c3Rfcm9vdF9jbGFzc18zX2NhXzJfMjAwOS5jcmwwDQYJKoZIhvcNAQEL\n"
+"BQADggEBAH+X2zDI36ScfSF6gHDOFBJpiBSVYEQBrLLpME+bUMJm2H6NMLVwMeni\n"
+"acfzcNsgFYbQDfC+rAF1hM5+n02/t2A7nPPKHeJeaNijnZflQGDSNiH+0LS4F9p0\n"
+"o3/U37CYAqxva2ssJSRyoWXuJVrl5jLn8t+rSfrzkGkj2wTZ51xY/GXUl77M/C4K\n"
+"zCUqNQT4YJEVdT1B/yMfGchs64JTBKbkTCJNjYy6zltz7GRUUG3RnFX7acM2w4y8\n"
+"PIWmawomDeCTmGCufsYkl4phX5GOZpIJhzbNi5stPvZR1FDUWSi9g/LMKHtThm3Y\n"
+"Johw1+qRzT65ysCQblrGXnRl11z+o+I=\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                        //   O  = D-Trust GmbH CN = D-TRUST Root Class 3 CA 2 EV 2009
+"MIIEQzCCAyugAwIBAgIDCYP0MA0GCSqGSIb3DQEBCwUAMFAxCzAJBgNVBAYTAkRF\n"
+"MRUwEwYDVQQKDAxELVRydXN0IEdtYkgxKjAoBgNVBAMMIUQtVFJVU1QgUm9vdCBD\n"
+"bGFzcyAzIENBIDIgRVYgMjAwOTAeFw0wOTExMDUwODUwNDZaFw0yOTExMDUwODUw\n"
+"NDZaMFAxCzAJBgNVBAYTAkRFMRUwEwYDVQQKDAxELVRydXN0IEdtYkgxKjAoBgNV\n"
+"BAMMIUQtVFJVU1QgUm9vdCBDbGFzcyAzIENBIDIgRVYgMjAwOTCCASIwDQYJKoZI\n"
+"hvcNAQEBBQADggEPADCCAQoCggEBAJnxhDRwui+3MKCOvXwEz75ivJn9gpfSegpn\n"
+"ljgJ9hBOlSJzmY3aFS3nBfwZcyK3jpgAvDw9rKFs+9Z5JUut8Mxk2og+KbgPCdM0\n"
+"3TP1YtHhzRnp7hhPTFiu4h7WDFsVWtg6uMQYZB7jM7K1iXdODL/ZlGsTl28So/6Z\n"
+"qQTMFexgaDbtCHu39b+T7WYxg4zGcTSHThfqr4uRjRxWQa4iN1438h3Z0S0NL2lR\n"
+"p75mpoo6Kr3HGrHhFPC+Oh25z1uxav60sUYgovseO3Dvk5h9jHOW8sXvhXCtKSb8\n"
+"HgQ+HKDYD8tSg2J87otTlZCpV6LqYQXY+U3EJ/pure3511H3a6UCAwEAAaOCASQw\n"
+"ggEgMA8GA1UdEwEB/wQFMAMBAf8wHQYDVR0OBBYEFNOUikxiEyoZLsyvcop9Ntea\n"
+"HNxnMA4GA1UdDwEB/wQEAwIBBjCB3QYDVR0fBIHVMIHSMIGHoIGEoIGBhn9sZGFw\n"
+"Oi8vZGlyZWN0b3J5LmQtdHJ1c3QubmV0L0NOPUQtVFJVU1QlMjBSb290JTIwQ2xh\n"
+"c3MlMjAzJTIwQ0ElMjAyJTIwRVYlMjAyMDA5LE89RC1UcnVzdCUyMEdtYkgsQz1E\n"
+"RT9jZXJ0aWZpY2F0ZXJldm9jYXRpb25saXN0MEagRKBChkBodHRwOi8vd3d3LmQt\n"
+"dHJ1c3QubmV0L2NybC9kLXRydXN0X3Jvb3RfY2xhc3NfM19jYV8yX2V2XzIwMDku\n"
+"Y3JsMA0GCSqGSIb3DQEBCwUAA4IBAQA07XtaPKSUiO8aEXUHL7P+PPoeUSbrh/Yp\n"
+"3uDx1MYkCenBz1UbtDDZzhr+BlGmFaQt77JLvyAoJUnRpjZ3NOhk31KxEcdzes05\n"
+"nsKtjHEh8lprr988TlWvsoRlFIm5d8sqMb7Po23Pb0iUMkZv53GMoKaEGTcH8gNF\n"
+"CSuGdXzfX2lXANtu2KZyIktQ1HWYVt+3GP9DQ1CuekR78HlR10M9p9OB0/DJT7na\n"
+"xpeG0ILD5EJt/rDiZE4OJudANCa1CInXCGNjOCd1HjPqbqjdn5lPdE2BiYBL3ZqX\n"
+"KVwvvoFBuYz/6n1gBp7N1z3TLqMVvKjmJuVvw9y4AyHqnxbxLFS1\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                       //   O  = DigiCert Inc OU = www.digicert.com CN = DigiCert Assured ID Root CA
+"MIIDtzCCAp+gAwIBAgIQDOfg5RfYRv6P5WD8G/AwOTANBgkqhkiG9w0BAQUFADBl\n"
+"MQswCQYDVQQGEwJVUzEVMBMGA1UEChMMRGlnaUNlcnQgSW5jMRkwFwYDVQQLExB3\n"
+"d3cuZGlnaWNlcnQuY29tMSQwIgYDVQQDExtEaWdpQ2VydCBBc3N1cmVkIElEIFJv\n"
+"b3QgQ0EwHhcNMDYxMTEwMDAwMDAwWhcNMzExMTEwMDAwMDAwWjBlMQswCQYDVQQG\n"
+"EwJVUzEVMBMGA1UEChMMRGlnaUNlcnQgSW5jMRkwFwYDVQQLExB3d3cuZGlnaWNl\n"
+"cnQuY29tMSQwIgYDVQQDExtEaWdpQ2VydCBBc3N1cmVkIElEIFJvb3QgQ0EwggEi\n"
+"MA0GCSqGSIb3DQEBAQUAA4IBDwAwggEKAoIBAQCtDhXO5EOAXLGH87dg+XESpa7c\n"
+"JpSIqvTO9SA5KFhgDPiA2qkVlTJhPLWxKISKityfCgyDF3qPkKyK53lTXDGEKvYP\n"
+"mDI2dsze3Tyoou9q+yHyUmHfnyDXH+Kx2f4YZNISW1/5WBg1vEfNoTb5a3/UsDg+\n"
+"wRvDjDPZ2C8Y/igPs6eD1sNuRMBhNZYW/lmci3Zt1/GiSw0r/wty2p5g0I6QNcZ4\n"
+"VYcgoc/lbQrISXwxmDNsIumH0DJaoroTghHtORedmTpyoeb6pNnVFzF1roV9Iq4/\n"
+"AUaG9ih5yLHa5FcXxH4cDrC0kqZWs72yl+2qp/C3xag/lRbQ/6GW6whfGHdPAgMB\n"
+"AAGjYzBhMA4GA1UdDwEB/wQEAwIBhjAPBgNVHRMBAf8EBTADAQH/MB0GA1UdDgQW\n"
+"BBRF66Kv9JLLgjEtUYunpyGd823IDzAfBgNVHSMEGDAWgBRF66Kv9JLLgjEtUYun\n"
+"pyGd823IDzANBgkqhkiG9w0BAQUFAAOCAQEAog683+Lt8ONyc3pklL/3cmbYMuRC\n"
+"dWKuh+vy1dneVrOfzM4UKLkNl2BcEkxY5NM9g0lFWJc1aRqoR+pWxnmrEthngYTf\n"
+"fwk8lOa4JiwgvT2zKIn3X/8i4peEH+ll74fg38FnSbNd67IJKusm7Xi+fT8r87cm\n"
+"NW1fiQG2SVufAQWbqz0lwcy2f8Lxb4bG+mRo64EtlOtCt/qMHt1i8b5QZ7dsvfPx\n"
+"H2sMNgcWfzd8qVttevESRmCD1ycEvkvOl77DZypoEd+A5wwzZr8TDRRu838fYxAe\n"
+"+o0bJW1sj6W3YQGx0qMmoRBxna3iw/nDmVG3KwcIzi7mULKn+gpFL6Lw8g==\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                        //   O  = DigiCert Inc OU = www.digicert.com CN = DigiCert Assured ID Root G2
+"MIIDljCCAn6gAwIBAgIQC5McOtY5Z+pnI7/Dr5r0SzANBgkqhkiG9w0BAQsFADBl\n"
+"MQswCQYDVQQGEwJVUzEVMBMGA1UEChMMRGlnaUNlcnQgSW5jMRkwFwYDVQQLExB3\n"
+"d3cuZGlnaWNlcnQuY29tMSQwIgYDVQQDExtEaWdpQ2VydCBBc3N1cmVkIElEIFJv\n"
+"b3QgRzIwHhcNMTMwODAxMTIwMDAwWhcNMzgwMTE1MTIwMDAwWjBlMQswCQYDVQQG\n"
+"EwJVUzEVMBMGA1UEChMMRGlnaUNlcnQgSW5jMRkwFwYDVQQLExB3d3cuZGlnaWNl\n"
+"cnQuY29tMSQwIgYDVQQDExtEaWdpQ2VydCBBc3N1cmVkIElEIFJvb3QgRzIwggEi\n"
+"MA0GCSqGSIb3DQEBAQUAA4IBDwAwggEKAoIBAQDZ5ygvUj82ckmIkzTz+GoeMVSA\n"
+"n61UQbVH35ao1K+ALbkKz3X9iaV9JPrjIgwrvJUXCzO/GU1BBpAAvQxNEP4Htecc\n"
+"biJVMWWXvdMX0h5i89vqbFCMP4QMls+3ywPgym2hFEwbid3tALBSfK+RbLE4E9Hp\n"
+"EgjAALAcKxHad3A2m67OeYfcgnDmCXRwVWmvo2ifv922ebPynXApVfSr/5Vh88lA\n"
+"bx3RvpO704gqu52/clpWcTs/1PPRCv4o76Pu2ZmvA9OPYLfykqGxvYmJHzDNw6Yu\n"
+"YjOuFgJ3RFrngQo8p0Quebg/BLxcoIfhG69Rjs3sLPr4/m3wOnyqi+RnlTGNAgMB\n"
+"AAGjQjBAMA8GA1UdEwEB/wQFMAMBAf8wDgYDVR0PAQH/BAQDAgGGMB0GA1UdDgQW\n"
+"BBTOw0q5mVXyuNtgv6l+vVa1lzan1jANBgkqhkiG9w0BAQsFAAOCAQEAyqVVjOPI\n"
+"QW5pJ6d1Ee88hjZv0p3GeDgdaZaikmkuOGybfQTUiaWxMTeKySHMq2zNixya1r9I\n"
+"0jJmwYrA8y8678Dj1JGG0VDjA9tzd29KOVPt3ibHtX2vK0LRdWLjSisCx1BL4Gni\n"
+"lmwORGYQRI+tBev4eaymG+g3NJ1TyWGqolKvSnAWhsI6yLETcDbYz+70CjTVW0z9\n"
+"B5yiutkBclzzTcHdDrEcDcRjvq30FPuJ7KJBDkzMyFdA0G4Dqs0MjomZmWzwPDCv\n"
+"ON9vvKO+KSAnq3T/EyJ43pdSVR6DtVQgA+6uwE9W3jfMw3+qBCe703e4YtsXfJwo\n"
+"IhNzbM8m9Yop5w==\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                        //   O  = DigiCert Inc OU = www.digicert.com CN = DigiCert Assured ID Root G3
+"MIICRjCCAc2gAwIBAgIQC6Fa+h3foLVJRK/NJKBs7DAKBggqhkjOPQQDAzBlMQsw\n"
+"CQYDVQQGEwJVUzEVMBMGA1UEChMMRGlnaUNlcnQgSW5jMRkwFwYDVQQLExB3d3cu\n"
+"ZGlnaWNlcnQuY29tMSQwIgYDVQQDExtEaWdpQ2VydCBBc3N1cmVkIElEIFJvb3Qg\n"
+"RzMwHhcNMTMwODAxMTIwMDAwWhcNMzgwMTE1MTIwMDAwWjBlMQswCQYDVQQGEwJV\n"
+"UzEVMBMGA1UEChMMRGlnaUNlcnQgSW5jMRkwFwYDVQQLExB3d3cuZGlnaWNlcnQu\n"
+"Y29tMSQwIgYDVQQDExtEaWdpQ2VydCBBc3N1cmVkIElEIFJvb3QgRzMwdjAQBgcq\n"
+"hkjOPQIBBgUrgQQAIgNiAAQZ57ysRGXtzbg/WPuNsVepRC0FFfLvC/8QdJ+1YlJf\n"
+"Zn4f5dwbRXkLzMZTCp2NXQLZqVneAlr2lSoOjThKiknGvMYDOAdfVdp+CW7if17Q\n"
+"RSAPWXYQ1qAk8C3eNvJsKTmjQjBAMA8GA1UdEwEB/wQFMAMBAf8wDgYDVR0PAQH/\n"
+"BAQDAgGGMB0GA1UdDgQWBBTL0L2p4ZgFUaFNN6KDec6NHSrkhDAKBggqhkjOPQQD\n"
+"AwNnADBkAjAlpIFFAmsSS3V0T8gj43DydXLefInwz5FyYZ5eEJJZVrmDxxDnOOlY\n"
+"JjZ91eQ0hjkCMHw2U/Aw5WJjOpnitqM7mzT6HtoQknFekROn3aRukswy1vUhZscv\n"
+"6pZjamVFkpUBtA==\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                       //   O  = DigiCert Inc OU = www.digicert.com CN = DigiCert Global Root G2
+"MIIDjjCCAnagAwIBAgIQAzrx5qcRqaC7KGSxHQn65TANBgkqhkiG9w0BAQsFADBh\n"
+"MQswCQYDVQQGEwJVUzEVMBMGA1UEChMMRGlnaUNlcnQgSW5jMRkwFwYDVQQLExB3\n"
+"d3cuZGlnaWNlcnQuY29tMSAwHgYDVQQDExdEaWdpQ2VydCBHbG9iYWwgUm9vdCBH\n"
+"MjAeFw0xMzA4MDExMjAwMDBaFw0zODAxMTUxMjAwMDBaMGExCzAJBgNVBAYTAlVT\n"
+"MRUwEwYDVQQKEwxEaWdpQ2VydCBJbmMxGTAXBgNVBAsTEHd3dy5kaWdpY2VydC5j\n"
+"b20xIDAeBgNVBAMTF0RpZ2lDZXJ0IEdsb2JhbCBSb290IEcyMIIBIjANBgkqhkiG\n"
+"9w0BAQEFAAOCAQ8AMIIBCgKCAQEAuzfNNNx7a8myaJCtSnX/RrohCgiN9RlUyfuI\n"
+"2/Ou8jqJkTx65qsGGmvPrC3oXgkkRLpimn7Wo6h+4FR1IAWsULecYxpsMNzaHxmx\n"
+"1x7e/dfgy5SDN67sH0NO3Xss0r0upS/kqbitOtSZpLYl6ZtrAGCSYP9PIUkY92eQ\n"
+"q2EGnI/yuum06ZIya7XzV+hdG82MHauVBJVJ8zUtluNJbd134/tJS7SsVQepj5Wz\n"
+"tCO7TG1F8PapspUwtP1MVYwnSlcUfIKdzXOS0xZKBgyMUNGPHgm+F6HmIcr9g+UQ\n"
+"vIOlCsRnKPZzFBQ9RnbDhxSJITRNrw9FDKZJobq7nMWxM4MphQIDAQABo0IwQDAP\n"
+"BgNVHRMBAf8EBTADAQH/MA4GA1UdDwEB/wQEAwIBhjAdBgNVHQ4EFgQUTiJUIBiV\n"
+"5uNu5g/6+rkS7QYXjzkwDQYJKoZIhvcNAQELBQADggEBAGBnKJRvDkhj6zHd6mcY\n"
+"1Yl9PMWLSn/pvtsrF9+wX3N3KjITOYFnQoQj8kVnNeyIv/iPsGEMNKSuIEyExtv4\n"
+"NeF22d+mQrvHRAiGfzZ0JFrabA0UWTW98kndth/Jsw1HKj2ZL7tcu7XUIOGZX1NG\n"
+"Fdtom/DzMNU+MeKNhJ7jitralj41E6Vf8PlwUHBHQRFXGU7Aj64GxJUTFy8bJZ91\n"
+"8rGOmaFvE7FBcf6IKshPECBV1/MUReXgRPTqh5Uykw7+U0b6LJ3/iyK5S9kJRaTe\n"
+"pLiaWN0bfVKfjllDiIGknibVb63dDcY3fe0Dkhvld1927jyNxF1WW6LZZm6zNTfl\n"
+"MrY=\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                       //   O  = DigiCert Inc OU = www.digicert.com CN = DigiCert Global Root G3
+"MIICPzCCAcWgAwIBAgIQBVVWvPJepDU1w6QP1atFcjAKBggqhkjOPQQDAzBhMQsw\n"
+"CQYDVQQGEwJVUzEVMBMGA1UEChMMRGlnaUNlcnQgSW5jMRkwFwYDVQQLExB3d3cu\n"
+"ZGlnaWNlcnQuY29tMSAwHgYDVQQDExdEaWdpQ2VydCBHbG9iYWwgUm9vdCBHMzAe\n"
+"Fw0xMzA4MDExMjAwMDBaFw0zODAxMTUxMjAwMDBaMGExCzAJBgNVBAYTAlVTMRUw\n"
+"EwYDVQQKEwxEaWdpQ2VydCBJbmMxGTAXBgNVBAsTEHd3dy5kaWdpY2VydC5jb20x\n"
+"IDAeBgNVBAMTF0RpZ2lDZXJ0IEdsb2JhbCBSb290IEczMHYwEAYHKoZIzj0CAQYF\n"
+"K4EEACIDYgAE3afZu4q4C/sLfyHS8L6+c/MzXRq8NOrexpu80JX28MzQC7phW1FG\n"
+"fp4tn+6OYwwX7Adw9c+ELkCDnOg/QW07rdOkFFk2eJ0DQ+4QE2xy3q6Ip6FrtUPO\n"
+"Z9wj/wMco+I+o0IwQDAPBgNVHRMBAf8EBTADAQH/MA4GA1UdDwEB/wQEAwIBhjAd\n"
+"BgNVHQ4EFgQUs9tIpPmhxdiuNkHMEWNpYim8S8YwCgYIKoZIzj0EAwMDaAAwZQIx\n"
+"AK288mw/EkrRLTnDCgmXc/SINoyIJ7vmiI1Qhadj+Z4y3maTD/HMsQmP3Wyr+mt/\n"
+"oAIwOWZbwmSNuJ5Q3KjVSaLtx9zRSX8XAbjIho9OjIgrqJqpisXRAL34VOKa5Vt8\n"
+"sycX\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                       //  O  = DigiCert Inc OU = www.digicert.com CN = DigiCert Trusted Root G4
+"MIIFkDCCA3igAwIBAgIQBZsbV56OITLiOQe9p3d1XDANBgkqhkiG9w0BAQwFADBi\n"
+"MQswCQYDVQQGEwJVUzEVMBMGA1UEChMMRGlnaUNlcnQgSW5jMRkwFwYDVQQLExB3\n"
+"d3cuZGlnaWNlcnQuY29tMSEwHwYDVQQDExhEaWdpQ2VydCBUcnVzdGVkIFJvb3Qg\n"
+"RzQwHhcNMTMwODAxMTIwMDAwWhcNMzgwMTE1MTIwMDAwWjBiMQswCQYDVQQGEwJV\n"
+"UzEVMBMGA1UEChMMRGlnaUNlcnQgSW5jMRkwFwYDVQQLExB3d3cuZGlnaWNlcnQu\n"
+"Y29tMSEwHwYDVQQDExhEaWdpQ2VydCBUcnVzdGVkIFJvb3QgRzQwggIiMA0GCSqG\n"
+"SIb3DQEBAQUAA4ICDwAwggIKAoICAQC/5pBzaN675F1KPDAiMGkz7MKnJS7JIT3y\n"
+"ithZwuEppz1Yq3aaza57G4QNxDAf8xukOBbrVsaXbR2rsnnyyhHS5F/WBTxSD1If\n"
+"xp4VpX6+n6lXFllVcq9ok3DCsrp1mWpzMpTREEQQLt+C8weE5nQ7bXHiLQwb7iDV\n"
+"ySAdYyktzuxeTsiT+CFhmzTrBcZe7FsavOvJz82sNEBfsXpm7nfISKhmV1efVFiO\n"
+"DCu3T6cw2Vbuyntd463JT17lNecxy9qTXtyOj4DatpGYQJB5w3jHtrHEtWoYOAMQ\n"
+"jdjUN6QuBX2I9YI+EJFwq1WCQTLX2wRzKm6RAXwhTNS8rhsDdV14Ztk6MUSaM0C/\n"
+"CNdaSaTC5qmgZ92kJ7yhTzm1EVgX9yRcRo9k98FpiHaYdj1ZXUJ2h4mXaXpI8OCi\n"
+"EhtmmnTK3kse5w5jrubU75KSOp493ADkRSWJtppEGSt+wJS00mFt6zPZxd9LBADM\n"
+"fRyVw4/3IbKyEbe7f/LVjHAsQWCqsWMYRJUadmJ+9oCw++hkpjPRiQfhvbfmQ6QY\n"
+"uKZ3AeEPlAwhHbJUKSWJbOUOUlFHdL4mrLZBdd56rF+NP8m800ERElvlEFDrMcXK\n"
+"chYiCd98THU/Y+whX8QgUWtvsauGi0/C1kVfnSD8oR7FwI+isX4KJpn15GkvmB0t\n"
+"9dmpsh3lGwIDAQABo0IwQDAPBgNVHRMBAf8EBTADAQH/MA4GA1UdDwEB/wQEAwIB\n"
+"hjAdBgNVHQ4EFgQU7NfjgtJxXWRM3y5nP+e6mK4cD08wDQYJKoZIhvcNAQEMBQAD\n"
+"ggIBALth2X2pbL4XxJEbw6GiAI3jZGgPVs93rnD5/ZpKmbnJeFwMDF/k5hQpVgs2\n"
+"SV1EY+CtnJYYZhsjDT156W1r1lT40jzBQ0CuHVD1UvyQO7uYmWlrx8GnqGikJ9yd\n"
+"+SeuMIW59mdNOj6PWTkiU0TryF0Dyu1Qen1iIQqAyHNm0aAFYF/opbSnr6j3bTWc\n"
+"fFqK1qI4mfN4i/RN0iAL3gTujJtHgXINwBQy7zBZLq7gcfJW5GqXb5JQbZaNaHqa\n"
+"sjYUegbyJLkJEVDXCLG4iXqEI2FCKeWjzaIgQdfRnGTZ6iahixTXTBmyUEFxPT9N\n"
+"cCOGDErcgdLMMpSEDQgJlxxPwO5rIHQw0uA5NBCFIRUBCOhVMt5xSdkoF1BN5r5N\n"
+"0XWs0Mr7QbhDparTwwVETyw2m+L64kW4I1NsBm9nVX9GtUw/bihaeSbSpKhil9Ie\n"
+"4u1Ki7wb/UdKDd9nZn6yW0HQO+T0O/QEY+nvwlQAUaCKKsnOeMzV6ocEGLPOr0mI\n"
+"r/OSmbaz5mEP0oUA51Aa5BuVnRmhuZyxm7EAHu/QD09CbMkKvO5D+jpxpchNJqU1\n"
+"/YldvIViHTLSoCtU7ZpXwdv6EM8Zt4tKG48BtieVU+i2iW1bvGjUI+iLUaJW+fCm\n"
+"gKDWHrO8Dw9TdSmq6hN35N6MgSGtBxBHEa2HPQfRdbzP82Z+\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                        //   O  = E-Tu .ra EBG Bili .im Teknolojileri ve Hizmetleri A. .. OU = E-Tugra Sertifikasyon Merkezi CN = E-Tugra Certification Authority
+"MIIGSzCCBDOgAwIBAgIIamg+nFGby1MwDQYJKoZIhvcNAQELBQAwgbIxCzAJBgNV\n"
+"BAYTAlRSMQ8wDQYDVQQHDAZBbmthcmExQDA+BgNVBAoMN0UtVHXEn3JhIEVCRyBC\n"
+"aWxpxZ9pbSBUZWtub2xvamlsZXJpIHZlIEhpem1ldGxlcmkgQS7Fni4xJjAkBgNV\n"
+"BAsMHUUtVHVncmEgU2VydGlmaWthc3lvbiBNZXJrZXppMSgwJgYDVQQDDB9FLVR1\n"
+"Z3JhIENlcnRpZmljYXRpb24gQXV0aG9yaXR5MB4XDTEzMDMwNTEyMDk0OFoXDTIz\n"
+"MDMwMzEyMDk0OFowgbIxCzAJBgNVBAYTAlRSMQ8wDQYDVQQHDAZBbmthcmExQDA+\n"
+"BgNVBAoMN0UtVHXEn3JhIEVCRyBCaWxpxZ9pbSBUZWtub2xvamlsZXJpIHZlIEhp\n"
+"em1ldGxlcmkgQS7Fni4xJjAkBgNVBAsMHUUtVHVncmEgU2VydGlmaWthc3lvbiBN\n"
+"ZXJrZXppMSgwJgYDVQQDDB9FLVR1Z3JhIENlcnRpZmljYXRpb24gQXV0aG9yaXR5\n"
+"MIICIjANBgkqhkiG9w0BAQEFAAOCAg8AMIICCgKCAgEA4vU/kwVRHoViVF56C/UY\n"
+"B4Oufq9899SKa6VjQzm5S/fDxmSJPZQuVIBSOTkHS0vdhQd2h8y/L5VMzH2nPbxH\n"
+"D5hw+IyFHnSOkm0bQNGZDbt1bsipa5rAhDGvykPL6ys06I+XawGb1Q5KCKpbknSF\n"
+"Q9OArqGIW66z6l7LFpp3RMih9lRozt6Plyu6W0ACDGQXwLWTzeHxE2bODHnv0ZEo\n"
+"q1+gElIwcxmOj+GMB6LDu0rw6h8VqO4lzKRG+Bsi77MOQ7osJLjFLFzUHPhdZL3D\n"
+"k14opz8n8Y4e0ypQBaNV2cvnOVPAmJ6MVGKLJrD3fY185MaeZkJVgkfnsliNZvcH\n"
+"fC425lAcP9tDJMW/hkd5s3kc91r0E+xs+D/iWR+V7kI+ua2oMoVJl0b+SzGPWsut\n"
+"dEcf6ZG33ygEIqDUD13ieU/qbIWGvaimzuT6w+Gzrt48Ue7LE3wBf4QOXVGUnhMM\n"
+"ti6lTPk5cDZvlsouDERVxcr6XQKj39ZkjFqzAQqptQpHF//vkUAqjqFGOjGY5RH8\n"
+"zLtJVor8udBhmm9lbObDyz51Sf6Pp+KJxWfXnUYTTjF2OySznhFlhqt/7x3U+Lzn\n"
+"rFpct1pHXFXOVbQicVtbC/DP3KBhZOqp12gKY6fgDT+gr9Oq0n7vUaDmUStVkhUX\n"
+"U8u3Zg5mTPj5dUyQ5xJwx0UCAwEAAaNjMGEwHQYDVR0OBBYEFC7j27JJ0JxUeVz6\n"
+"Jyr+zE7S6E5UMA8GA1UdEwEB/wQFMAMBAf8wHwYDVR0jBBgwFoAULuPbsknQnFR5\n"
+"XPonKv7MTtLoTlQwDgYDVR0PAQH/BAQDAgEGMA0GCSqGSIb3DQEBCwUAA4ICAQAF\n"
+"Nzr0TbdF4kV1JI+2d1LoHNgQk2Xz8lkGpD4eKexd0dCrfOAKkEh47U6YA5n+KGCR\n"
+"HTAduGN8qOY1tfrTYXbm1gdLymmasoR6d5NFFxWfJNCYExL/u6Au/U5Mh/jOXKqY\n"
+"GwXgAEZKgoClM4so3O0409/lPun++1ndYYRP0lSWE2ETPo+Aab6TR7U1Q9Jauz1c\n"
+"77NCR807VRMGsAnb/WP2OogKmW9+4c4bU2pEZiNRCHu8W1Ki/QY3OEBhj0qWuJA3\n"
+"+GbHeJAAFS6LrVE1Uweoa2iu+U48BybNCAVwzDk/dr2l02cmAYamU9JgO3xDf1WK\n"
+"vJUawSg5TB9D0pH0clmKuVb8P7Sd2nCcdlqMQ1DujjByTd//SffGqWfZbawCEeI6\n"
+"FiWnWAjLb1NBnEg4R2gz0dfHj9R0IdTDBZB6/86WiLEVKV0jq9BgoRJP3vQXzTLl\n"
+"yb/IQ639Lo7xr+L0mPoSHyDYwKcMhcWQ9DstliaxLL5Mq+ux0orJ23gTDx4JnW2P\n"
+"AJ8C2sH6H3p6CcRK5ogql5+Ji/03X186zjhZhkuvcQu02PJwT58yE+Owp1fl2tpD\n"
+"y4Q08ijE6m30Ku/Ba3ba+367hTzSU8JNvnHhRdH9I2cNE3X7z2VnIp2usAnRCf8d\n"
+"NL/+I5c30jn6PQ0GC7TbO6Orb1wdtn7os4I07QZcJA==\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                        //   O= Agencia Catalana de Certificacio (NIF Q-0801176-I) OU= Serveis Publics de Certificacio CN= EC-ACC
+"MIIFVjCCBD6gAwIBAgIQ7is969Qh3hSoYqwE893EATANBgkqhkiG9w0BAQUFADCB\n"
+"8zELMAkGA1UEBhMCRVMxOzA5BgNVBAoTMkFnZW5jaWEgQ2F0YWxhbmEgZGUgQ2Vy\n"
+"dGlmaWNhY2lvIChOSUYgUS0wODAxMTc2LUkpMSgwJgYDVQQLEx9TZXJ2ZWlzIFB1\n"
+"YmxpY3MgZGUgQ2VydGlmaWNhY2lvMTUwMwYDVQQLEyxWZWdldSBodHRwczovL3d3\n"
+"dy5jYXRjZXJ0Lm5ldC92ZXJhcnJlbCAoYykwMzE1MDMGA1UECxMsSmVyYXJxdWlh\n"
+"IEVudGl0YXRzIGRlIENlcnRpZmljYWNpbyBDYXRhbGFuZXMxDzANBgNVBAMTBkVD\n"
+"LUFDQzAeFw0wMzAxMDcyMzAwMDBaFw0zMTAxMDcyMjU5NTlaMIHzMQswCQYDVQQG\n"
+"EwJFUzE7MDkGA1UEChMyQWdlbmNpYSBDYXRhbGFuYSBkZSBDZXJ0aWZpY2FjaW8g\n"
+"KE5JRiBRLTA4MDExNzYtSSkxKDAmBgNVBAsTH1NlcnZlaXMgUHVibGljcyBkZSBD\n"
+"ZXJ0aWZpY2FjaW8xNTAzBgNVBAsTLFZlZ2V1IGh0dHBzOi8vd3d3LmNhdGNlcnQu\n"
+"bmV0L3ZlcmFycmVsIChjKTAzMTUwMwYDVQQLEyxKZXJhcnF1aWEgRW50aXRhdHMg\n"
+"ZGUgQ2VydGlmaWNhY2lvIENhdGFsYW5lczEPMA0GA1UEAxMGRUMtQUNDMIIBIjAN\n"
+"BgkqhkiG9w0BAQEFAAOCAQ8AMIIBCgKCAQEAsyLHT+KXQpWIR4NA9h0X84NzJB5R\n"
+"85iKw5K4/0CQBXCHYMkAqbWUZRkiFRfCQ2xmRJoNBD45b6VLeqpjt4pEndljkYRm\n"
+"4CgPukLjbo73FCeTae6RDqNfDrHrZqJyTxIThmV6PttPB/SnCWDaOkKZx7J/sxaV\n"
+"HMf5NLWUhdWZXqBIoH7nF2W4onW4HvPlQn2v7fOKSGRdghST2MDk/7NQcvJ29rNd\n"
+"QlB50JQ+awwAvthrDk4q7D7SzIKiGGUzE3eeml0aE9jD2z3Il3rucO2n5nzbcc8t\n"
+"lGLfbdb1OL4/pYUKGbio2Al1QnDE6u/LDsg0qBIimAy4E5S2S+zw0JDnJwIDAQAB\n"
+"o4HjMIHgMB0GA1UdEQQWMBSBEmVjX2FjY0BjYXRjZXJ0Lm5ldDAPBgNVHRMBAf8E\n"
+"BTADAQH/MA4GA1UdDwEB/wQEAwIBBjAdBgNVHQ4EFgQUoMOLRKo3pUW/l4Ba0fF4\n"
+"opvpXY0wfwYDVR0gBHgwdjB0BgsrBgEEAfV4AQMBCjBlMCwGCCsGAQUFBwIBFiBo\n"
+"dHRwczovL3d3dy5jYXRjZXJ0Lm5ldC92ZXJhcnJlbDA1BggrBgEFBQcCAjApGidW\n"
+"ZWdldSBodHRwczovL3d3dy5jYXRjZXJ0Lm5ldC92ZXJhcnJlbCAwDQYJKoZIhvcN\n"
+"AQEFBQADggEBAKBIW4IB9k1IuDlVNZyAelOZ1Vr/sXE7zDkJlF7W2u++AVtd0x7Y\n"
+"/X1PzaBB4DSTv8vihpw3kpBWHNzrKQXlxJ7HNd+KDM3FIUPpqojlNcAZQmNaAl6k\n"
+"SBg6hW/cnbw/nZzBh7h6YQjpdwt/cKt63dmXLGQehb+8dJahw3oS7AwaboMMPOhy\n"
+"Rp/7SNVel+axofjk70YllJyJ22k4vuxcDlbHZVHlUIiIv0LVKz3l+bqeLrPK9HOS\n"
+"Agu+TGbrIP65y7WZf+a2E/rKS03Z7lNGBjvGTq2TWoF+bCpLagVFjPIhpDGQh2xl\n"
+"nJ2lYJU6Un/10asIbvPuW/mIPX64b24D5EI=\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                        //  O  = Entrust.net OU = www.entrust.net\/CPS_2048 incorp. by ref. (limits liab.)  CN = Entrust.net Certification Authority (2048)
+"MIIEKjCCAxKgAwIBAgIEOGPe+DANBgkqhkiG9w0BAQUFADCBtDEUMBIGA1UEChML\n"
+"RW50cnVzdC5uZXQxQDA+BgNVBAsUN3d3dy5lbnRydXN0Lm5ldC9DUFNfMjA0OCBp\n"
+"bmNvcnAuIGJ5IHJlZi4gKGxpbWl0cyBsaWFiLikxJTAjBgNVBAsTHChjKSAxOTk5\n"
+"IEVudHJ1c3QubmV0IExpbWl0ZWQxMzAxBgNVBAMTKkVudHJ1c3QubmV0IENlcnRp\n"
+"ZmljYXRpb24gQXV0aG9yaXR5ICgyMDQ4KTAeFw05OTEyMjQxNzUwNTFaFw0yOTA3\n"
+"MjQxNDE1MTJaMIG0MRQwEgYDVQQKEwtFbnRydXN0Lm5ldDFAMD4GA1UECxQ3d3d3\n"
+"LmVudHJ1c3QubmV0L0NQU18yMDQ4IGluY29ycC4gYnkgcmVmLiAobGltaXRzIGxp\n"
+"YWIuKTElMCMGA1UECxMcKGMpIDE5OTkgRW50cnVzdC5uZXQgTGltaXRlZDEzMDEG\n"
+"A1UEAxMqRW50cnVzdC5uZXQgQ2VydGlmaWNhdGlvbiBBdXRob3JpdHkgKDIwNDgp\n"
+"MIIBIjANBgkqhkiG9w0BAQEFAAOCAQ8AMIIBCgKCAQEArU1LqRKGsuqjIAcVFmQq\n"
+"K0vRvwtKTY7tgHalZ7d4QMBzQshowNtTK91euHaYNZOLGp18EzoOH1u3Hs/lJBQe\n"
+"sYGpjX24zGtLA/ECDNyrpUAkAH90lKGdCCmziAv1h3edVc3kw37XamSrhRSGlVuX\n"
+"MlBvPci6Zgzj/L24ScF2iUkZ/cCovYmjZy/Gn7xxGWC4LeksyZB2ZnuU4q941mVT\n"
+"XTzWnLLPKQP5L6RQstRIzgUyVYr9smRMDuSYB3Xbf9+5CFVghTAp+XtIpGmG4zU/\n"
+"HoZdenoVve8AjhUiVBcAkCaTvA5JaJG/+EfTnZVCwQ5N328mz8MYIWJmQ3DW1cAH\n"
+"4QIDAQABo0IwQDAOBgNVHQ8BAf8EBAMCAQYwDwYDVR0TAQH/BAUwAwEB/zAdBgNV\n"
+"HQ4EFgQUVeSB0RGAvtiJuQijMfmhJAkWuXAwDQYJKoZIhvcNAQEFBQADggEBADub\n"
+"j1abMOdTmXx6eadNl9cZlZD7Bh/KM3xGY4+WZiT6QBshJ8rmcnPyT/4xmf3IDExo\n"
+"U8aAghOY+rat2l098c5u9hURlIIM7j+VrxGrD9cv3h8Dj1csHsm7mhpElesYT6Yf\n"
+"zX1XEC+bBAlahLVu2B064dae0Wx5XnkcFMXj0EyTO2U87d89vqbllRrDtRnDvV5b\n"
+"u/8j72gZyxKTJ1wDLW8w0B62GqzeWvfRqqgnpv55gcR5mTNXuhKwqeBCbJPKVt7+\n"
+"bYQLCIt+jerXmCHG8+c8eS9enNFMFY3h7CI3zJpDC5fcgJCNs2ebb0gIFVbPv/Er\n"
+"fF6adulZkMV8gzURZVE=\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                       //   O  = Entrust, Inc. OU = www.entrust.net\/CPS is incorporated by reference CN = Entrust Root Certification Authority
+"MIIEkTCCA3mgAwIBAgIERWtQVDANBgkqhkiG9w0BAQUFADCBsDELMAkGA1UEBhMC\n"
+"VVMxFjAUBgNVBAoTDUVudHJ1c3QsIEluYy4xOTA3BgNVBAsTMHd3dy5lbnRydXN0\n"
+"Lm5ldC9DUFMgaXMgaW5jb3Jwb3JhdGVkIGJ5IHJlZmVyZW5jZTEfMB0GA1UECxMW\n"
+"KGMpIDIwMDYgRW50cnVzdCwgSW5jLjEtMCsGA1UEAxMkRW50cnVzdCBSb290IENl\n"
+"cnRpZmljYXRpb24gQXV0aG9yaXR5MB4XDTA2MTEyNzIwMjM0MloXDTI2MTEyNzIw\n"
+"NTM0MlowgbAxCzAJBgNVBAYTAlVTMRYwFAYDVQQKEw1FbnRydXN0LCBJbmMuMTkw\n"
+"NwYDVQQLEzB3d3cuZW50cnVzdC5uZXQvQ1BTIGlzIGluY29ycG9yYXRlZCBieSBy\n"
+"ZWZlcmVuY2UxHzAdBgNVBAsTFihjKSAyMDA2IEVudHJ1c3QsIEluYy4xLTArBgNV\n"
+"BAMTJEVudHJ1c3QgUm9vdCBDZXJ0aWZpY2F0aW9uIEF1dGhvcml0eTCCASIwDQYJ\n"
+"KoZIhvcNAQEBBQADggEPADCCAQoCggEBALaVtkNC+sZtKm9I35RMOVcF7sN5EUFo\n"
+"Nu3s/poBj6E4KPz3EEZmLk0eGrEaTsbRwJWIsMn/MYszA9u3g3s+IIRe7bJWKKf4\n"
+"4LlAcTfFy0cOlypowCKVYhXbR9n10Cv/gkvJrT7eTNuQgFA/CYqEAOwwCj0Yzfv9\n"
+"KlmaI5UXLEWeH25DeW0MXJj+SKfFI0dcXv1u5x609mhF0YaDW6KKjbHjKYD+JXGI\n"
+"rb68j6xSlkuqUY3kEzEZ6E5Nn9uss2rVvDlUccp6en+Q3X0dgNmBu1kmwhH+5pPi\n"
+"94DkZfs0Nw4pgHBNrziGLp5/V6+eF67rHMsoIV+2HNjnogQi+dPa2MsCAwEAAaOB\n"
+"sDCBrTAOBgNVHQ8BAf8EBAMCAQYwDwYDVR0TAQH/BAUwAwEB/zArBgNVHRAEJDAi\n"
+"gA8yMDA2MTEyNzIwMjM0MlqBDzIwMjYxMTI3MjA1MzQyWjAfBgNVHSMEGDAWgBRo\n"
+"kORnpKZTgMeGZqTx90tD+4S9bTAdBgNVHQ4EFgQUaJDkZ6SmU4DHhmak8fdLQ/uE\n"
+"vW0wHQYJKoZIhvZ9B0EABBAwDhsIVjcuMTo0LjADAgSQMA0GCSqGSIb3DQEBBQUA\n"
+"A4IBAQCT1DCw1wMgKtD5Y+iRDAUgqV8ZyntyTtSx29CW+1RaGSwMCPeyvIWonX9t\n"
+"O1KzKtvn1ISMY/YPyyYBkVBs9F8U4pN0wBOeMDpQ47RgxRzwIkSNcUesyBrJ6Zua\n"
+"AGAT/3B+XxFNSRuzFVJ7yVTav52Vr2ua2J7p8eRDjeIRRDq/r72DQnNSi6q7pynP\n"
+"9WQcCk3RvKqsnyrQ/39/2n3qse0wJcGE2jTSW3iDVuycNsMm4hH2Z0kdkquM++v/\n"
+"eu6FSqdQgPCnXEqULl8FmTxSQeDNtGPPAUO6nIPcj2A781q0tHuu2guQOHXvgR1m\n"
+"0vdXcDazv/wor3ElhVsT/h5/WrQ8\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                       //   O  = Entrust, Inc. OU = See www.entrust.net\/legal-terms CN = Entrust Root Certification Authority - EC1
+"MIIC+TCCAoCgAwIBAgINAKaLeSkAAAAAUNCR+TAKBggqhkjOPQQDAzCBvzELMAkG\n"
+"A1UEBhMCVVMxFjAUBgNVBAoTDUVudHJ1c3QsIEluYy4xKDAmBgNVBAsTH1NlZSB3\n"
+"d3cuZW50cnVzdC5uZXQvbGVnYWwtdGVybXMxOTA3BgNVBAsTMChjKSAyMDEyIEVu\n"
+"dHJ1c3QsIEluYy4gLSBmb3IgYXV0aG9yaXplZCB1c2Ugb25seTEzMDEGA1UEAxMq\n"
+"RW50cnVzdCBSb290IENlcnRpZmljYXRpb24gQXV0aG9yaXR5IC0gRUMxMB4XDTEy\n"
+"MTIxODE1MjUzNloXDTM3MTIxODE1NTUzNlowgb8xCzAJBgNVBAYTAlVTMRYwFAYD\n"
+"VQQKEw1FbnRydXN0LCBJbmMuMSgwJgYDVQQLEx9TZWUgd3d3LmVudHJ1c3QubmV0\n"
+"L2xlZ2FsLXRlcm1zMTkwNwYDVQQLEzAoYykgMjAxMiBFbnRydXN0LCBJbmMuIC0g\n"
+"Zm9yIGF1dGhvcml6ZWQgdXNlIG9ubHkxMzAxBgNVBAMTKkVudHJ1c3QgUm9vdCBD\n"
+"ZXJ0aWZpY2F0aW9uIEF1dGhvcml0eSAtIEVDMTB2MBAGByqGSM49AgEGBSuBBAAi\n"
+"A2IABIQTydC6bUF74mzQ61VfZgIaJPRbiWlH47jCffHyAsWfoPZb1YsGGYZPUxBt\n"
+"ByQnoaD41UcZYUx9ypMn6nQM72+WCf5j7HBdNq1nd67JnXxVRDqiY1Ef9eNi1KlH\n"
+"Bz7MIKNCMEAwDgYDVR0PAQH/BAQDAgEGMA8GA1UdEwEB/wQFMAMBAf8wHQYDVR0O\n"
+"BBYEFLdj5xrdjekIplWDpOBqUEFlEUJJMAoGCCqGSM49BAMDA2cAMGQCMGF52OVC\n"
+"R98crlOZF7ZvHH3hvxGU0QOIdeSNiaSKd0bebWHvAvX7td/M/k7//qnmpwIwW5nX\n"
+"hTcGtXsI/esni0qU+eH6p44mCOh8kmhtc9hvJqwhAriZtyZBWyVgrtBIGu4G\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                       //   O  = Entrust, Inc. OU = See www.entrust.net\/legal-terms CN = Entrust Root Certification Authority - G2
+"MIIEPjCCAyagAwIBAgIESlOMKDANBgkqhkiG9w0BAQsFADCBvjELMAkGA1UEBhMC\n"
+"VVMxFjAUBgNVBAoTDUVudHJ1c3QsIEluYy4xKDAmBgNVBAsTH1NlZSB3d3cuZW50\n"
+"cnVzdC5uZXQvbGVnYWwtdGVybXMxOTA3BgNVBAsTMChjKSAyMDA5IEVudHJ1c3Qs\n"
+"IEluYy4gLSBmb3IgYXV0aG9yaXplZCB1c2Ugb25seTEyMDAGA1UEAxMpRW50cnVz\n"
+"dCBSb290IENlcnRpZmljYXRpb24gQXV0aG9yaXR5IC0gRzIwHhcNMDkwNzA3MTcy\n"
+"NTU0WhcNMzAxMjA3MTc1NTU0WjCBvjELMAkGA1UEBhMCVVMxFjAUBgNVBAoTDUVu\n"
+"dHJ1c3QsIEluYy4xKDAmBgNVBAsTH1NlZSB3d3cuZW50cnVzdC5uZXQvbGVnYWwt\n"
+"dGVybXMxOTA3BgNVBAsTMChjKSAyMDA5IEVudHJ1c3QsIEluYy4gLSBmb3IgYXV0\n"
+"aG9yaXplZCB1c2Ugb25seTEyMDAGA1UEAxMpRW50cnVzdCBSb290IENlcnRpZmlj\n"
+"YXRpb24gQXV0aG9yaXR5IC0gRzIwggEiMA0GCSqGSIb3DQEBAQUAA4IBDwAwggEK\n"
+"AoIBAQC6hLZy254Ma+KZ6TABp3bqMriVQRrJ2mFOWHLP/vaCeb9zYQYKpSfYs1/T\n"
+"RU4cctZOMvJyig/3gxnQaoCAAEUesMfnmr8SVycco2gvCoe9amsOXmXzHHfV1IWN\n"
+"cCG0szLni6LVhjkCsbjSR87kyUnEO6fe+1R9V77w6G7CebI6C1XiUJgWMhNcL3hW\n"
+"wcKUs/Ja5CeanyTXxuzQmyWC48zCxEXFjJd6BmsqEZ+pCm5IO2/b1BEZQvePB7/1\n"
+"U1+cPvQXLOZprE4yTGJ36rfo5bs0vBmLrpxR57d+tVOxMyLlbc9wPBr64ptntoP0\n"
+"jaWvYkxN4FisZDQSA/i2jZRjJKRxAgMBAAGjQjBAMA4GA1UdDwEB/wQEAwIBBjAP\n"
+"BgNVHRMBAf8EBTADAQH/MB0GA1UdDgQWBBRqciZ60B7vfec7aVHUbI2fkBJmqzAN\n"
+"BgkqhkiG9w0BAQsFAAOCAQEAeZ8dlsa2eT8ijYfThwMEYGprmi5ZiXMRrEPR9RP/\n"
+"jTkrwPK9T3CMqS/qF8QLVJ7UG5aYMzyorWKiAHarWWluBh1+xLlEjZivEtRh2woZ\n"
+"Rkfz6/djwUAFQKXSt/S1mja/qYh2iARVBCuch38aNzx+LaUa2NSJXsq9rD1s2G2v\n"
+"1fN2D807iDginWyTmsQ9v4IbZT+mD12q/OWyFcq1rca8PdCE6OoGcrBNOTJ4vz4R\n"
+"nAuknZoh8/CbCzB428Hch0P+vGOaysXCHMnHjf87ElgI5rY97HosTvuDls4MPGmH\n"
+"VHOkc8KT/1EQrBVUAdj8BbGJoX90g5pJ19xOe4pIb4tF9g==\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                        //   O  = GUANG DONG CERTIFICATE AUTHORITY CO.,LTD. CN = GDCA TrustAUTH R5 ROOT
+"MIIFiDCCA3CgAwIBAgIIfQmX/vBH6nowDQYJKoZIhvcNAQELBQAwYjELMAkGA1UE\n"
+"BhMCQ04xMjAwBgNVBAoMKUdVQU5HIERPTkcgQ0VSVElGSUNBVEUgQVVUSE9SSVRZ\n"
+"IENPLixMVEQuMR8wHQYDVQQDDBZHRENBIFRydXN0QVVUSCBSNSBST09UMB4XDTE0\n"
+"MTEyNjA1MTMxNVoXDTQwMTIzMTE1NTk1OVowYjELMAkGA1UEBhMCQ04xMjAwBgNV\n"
+"BAoMKUdVQU5HIERPTkcgQ0VSVElGSUNBVEUgQVVUSE9SSVRZIENPLixMVEQuMR8w\n"
+"HQYDVQQDDBZHRENBIFRydXN0QVVUSCBSNSBST09UMIICIjANBgkqhkiG9w0BAQEF\n"
+"AAOCAg8AMIICCgKCAgEA2aMW8Mh0dHeb7zMNOwZ+Vfy1YI92hhJCfVZmPoiC7XJj\n"
+"Dp6L3TQsAlFRwxn9WVSEyfFrs0yw6ehGXTjGoqcuEVe6ghWinI9tsJlKCvLriXBj\n"
+"TnnEt1u9ol2x8kECK62pOqPseQrsXzrj/e+APK00mxqriCZ7VqKChh/rNYmDf1+u\n"
+"KU49tm7srsHwJ5uu4/Ts765/94Y9cnrrpftZTqfrlYwiOXnhLQiPzLyRuEH3FMEj\n"
+"qcOtmkVEs7LXLM3GKeJQEK5cy4KOFxg2fZfmiJqwTTQJ9Cy5WmYqsBebnh52nUpm\n"
+"MUHfP/vFBu8btn4aRjb3ZGM74zkYI+dndRTVdVeSN72+ahsmUPI2JgaQxXABZG12\n"
+"ZuGR224HwGGALrIuL4xwp9E7PLOR5G62xDtw8mySlwnNR30YwPO7ng/Wi64HtloP\n"
+"zgsMR6flPri9fcebNaBhlzpBdRfMK5Z3KpIhHtmVdiBnaM8Nvd/WHwlqmuLMc3Gk\n"
+"L30SgLdTMEZeS1SZD2fJpcjyIMGC7J0R38IC+xo70e0gmu9lZJIQDSri3nDxGGeC\n"
+"jGHeuLzRL5z7D9Ar7Rt2ueQ5Vfj4oR24qoAATILnsn8JuLwwoC8N9VKejveSswoA\n"
+"HQBUlwbgsQfZxw9cZX08bVlX5O2ljelAU58VS6Bx9hoh49pwBiFYFIeFd3mqgnkC\n"
+"AwEAAaNCMEAwHQYDVR0OBBYEFOLJQJ9NzuiaoXzPDj9lxSmIahlRMA8GA1UdEwEB\n"
+"/wQFMAMBAf8wDgYDVR0PAQH/BAQDAgGGMA0GCSqGSIb3DQEBCwUAA4ICAQDRSVfg\n"
+"p8xoWLoBDysZzY2wYUWsEe1jUGn4H3++Fo/9nesLqjJHdtJnJO29fDMylyrHBYZm\n"
+"DRd9FBUb1Ov9H5r2XpdptxolpAqzkT9fNqyL7FeoPueBihhXOYV0GkLH6VsTX4/5\n"
+"COmSdI31R9KrO9b7eGZONn356ZLpBN79SWP8bfsUcZNnL0dKt7n/HipzcEYwv1ry\n"
+"L3ml4Y0M2fmyYzeMN2WFcGpcWwlyua1jPLHd+PwyvzeG5LuOmCd+uh8W4XAR8gPf\n"
+"JWIyJyYYMoSf/wA6E7qaTfRPuBRwIrHKK5DOKcFw9C+df/KQHtZa37dG/OaG+svg\n"
+"IHZ6uqbL9XzeYqWxi+7egmaKTjowHz+Ay60nugxe19CxVsp3cbK1daFQqUBDF8Io\n"
+"2c9Si1vIY9RCPqAzekYu9wogRlR+ak8x8YF+QnQ4ZXMn7sZ8uI7XpTrXmKGcjBBV\n"
+"09tL7ECQ8s1uV9JiDnxXk7Gnbc2dg7sq5+W2O3FYrf3RRbxake5TFW/TRQl1brqQ\n"
+"XR4EzzffHqhmsYzmIGrv/EhOdJhCrylvLmrH+33RZjEizIYAfmaDDEL0vTSSwxrq\n"
+"T8p+ck0LcIymSLumoRT2+1hEmRSuqguTaaApJUqlyyvdimYHFngVV3Eb7PVHhPOe\n"
+"MTd61X8kreS8/f3MboPoDKi3QWwH3b08hpcv0g==\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                       //   O  = GeoTrust Inc. CN = GeoTrust Global CA
+"MIIDVDCCAjygAwIBAgIDAjRWMA0GCSqGSIb3DQEBBQUAMEIxCzAJBgNVBAYTAlVT\n"
+"MRYwFAYDVQQKEw1HZW9UcnVzdCBJbmMuMRswGQYDVQQDExJHZW9UcnVzdCBHbG9i\n"
+"YWwgQ0EwHhcNMDIwNTIxMDQwMDAwWhcNMjIwNTIxMDQwMDAwWjBCMQswCQYDVQQG\n"
+"EwJVUzEWMBQGA1UEChMNR2VvVHJ1c3QgSW5jLjEbMBkGA1UEAxMSR2VvVHJ1c3Qg\n"
+"R2xvYmFsIENBMIIBIjANBgkqhkiG9w0BAQEFAAOCAQ8AMIIBCgKCAQEA2swYYzD9\n"
+"9BcjGlZ+W988bDjkcbd4kdS8odhM+KhDtgPpTSEHCIjaWC9mOSm9BXiLnTjoBbdq\n"
+"fnGk5sRgprDvgOSJKA+eJdbtg/OtppHHmMlCGDUUna2YRpIuT8rxh0PBFpVXLVDv\n"
+"iS2Aelet8u5fa9IAjbkU+BQVNdnARqN7csiRv8lVK83Qlz6cJmTM386DGXHKTubU\n"
+"1XupGc1V3sjs0l44U+VcT4wt/lAjNvxm5suOpDkZALeVAjmRCw7+OC7RHQWa9k0+\n"
+"bw8HHa8sHo9gOeL6NlMTOdReJivbPagUvTLrGAMoUgRx5aszPeE4uwc2hGKceeoW\n"
+"MPRfwCvocWvk+QIDAQABo1MwUTAPBgNVHRMBAf8EBTADAQH/MB0GA1UdDgQWBBTA\n"
+"ephojYn7qwVkDBF9qn1luMrMTjAfBgNVHSMEGDAWgBTAephojYn7qwVkDBF9qn1l\n"
+"uMrMTjANBgkqhkiG9w0BAQUFAAOCAQEANeMpauUvXVSOKVCUn5kaFOSPeCpilKIn\n"
+"Z57QzxpeR+nBsqTP3UEaBU6bS+5Kb1VSsyShNwrrZHYqLizz/Tt1kL/6cdjHPTfS\n"
+"tQWVYrmm3ok9Nns4d0iXrKYgjy6myQzCsplFAMfOEVEiIuCl6rYVSAlk6l5PdPcF\n"
+"PseKUgzbFbS9bZvlxrFUaKnjaZC2mqUPuLk/IH2uSrW4nOQdtqvmlKXBx4Ot2/Un\n"
+"hw4EbNX/3aBd7YdStysVAq45pmp06drE57xNNB6pXE0zX5IJL4hmXXeXxx12E6nV\n"
+"5fEWCRE11azbJHFwLJhWC9kXtNHjUStedejV0NxPNO3CBWaAocvmMw==\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                       //  O  = GeoTrust Inc. CN = GeoTrust Primary Certification Authority
+"MIIDfDCCAmSgAwIBAgIQGKy1av1pthU6Y2yv2vrEoTANBgkqhkiG9w0BAQUFADBY\n"
+"MQswCQYDVQQGEwJVUzEWMBQGA1UEChMNR2VvVHJ1c3QgSW5jLjExMC8GA1UEAxMo\n"
+"R2VvVHJ1c3QgUHJpbWFyeSBDZXJ0aWZpY2F0aW9uIEF1dGhvcml0eTAeFw0wNjEx\n"
+"MjcwMDAwMDBaFw0zNjA3MTYyMzU5NTlaMFgxCzAJBgNVBAYTAlVTMRYwFAYDVQQK\n"
+"Ew1HZW9UcnVzdCBJbmMuMTEwLwYDVQQDEyhHZW9UcnVzdCBQcmltYXJ5IENlcnRp\n"
+"ZmljYXRpb24gQXV0aG9yaXR5MIIBIjANBgkqhkiG9w0BAQEFAAOCAQ8AMIIBCgKC\n"
+"AQEAvrgVe//UfH1nrYNke8hCUy3f9oQIIGHWAVlqnEQRr+92/ZV+zmEwu3qDXwK9\n"
+"AWbK7hWNb6EwnL2hhZ6UOvNWiAAxz9juapYC2e0DjPt1befquFUWBRaa9OBesYjA\n"
+"ZIVcFU2Ix7e64HXprQU9nceJSOC7KMgD4TCTZF5SwFlwIjVXiIrxlQqD17wxcwE0\n"
+"7e9GceBrAqg1cmuXm2bgyxx5X9gaBGgeRwLmnWDiNpcB3841kt++Z8dtd1k7j53W\n"
+"kBWUvEI0EME5+bEnPn7WinXFsq+W06Lem+SYvn3h6YGttm/81w7a4DSwDRp35+MI\n"
+"mO9Y+pyEtzavwt+s0vQQBnBxNQIDAQABo0IwQDAPBgNVHRMBAf8EBTADAQH/MA4G\n"
+"A1UdDwEB/wQEAwIBBjAdBgNVHQ4EFgQULNVQQZcVi/CPNmFbSvtr2ZnJM5IwDQYJ\n"
+"KoZIhvcNAQEFBQADggEBAFpwfyzdtzRP9YZRqSa+S7iq8XEN3GHHoOo0Hnp3DwQ1\n"
+"6CePbJC/kRYkRj5KTs4rFtULUh38H2eiAkUxT87z+gOneZ1TatnaYzr4gNfTmeGl\n"
+"4b7UVXGYNTq+k+qurUKykG/g/CFNNWMziUnWm07Kx+dOCQD32sfvmWKZd7aVIl6K\n"
+"oKv0uHiYyjgZmclynnjNS6yvGaBzEi38wkG6gZHaFloxt/m0cYASSJlyc1pZU8Fj\n"
+"UjPtp8nSOQJw+uCxQmYpqptR7TBUIhRf2asdweSU8Pj1K/fqynhG1riR/aYNKxoU\n"
+"AT6A8EKglQdebc3MS6RFjasS6LPeWuWgfOgPIh1a6Vk=\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                       //   O  = GeoTrust Inc. OU = (c) 2007 GeoTrust Inc. - For authorized use only CN = GeoTrust Primary Certification Authority - G2
+"MIICrjCCAjWgAwIBAgIQPLL0SAoA4v7rJDteYD7DazAKBggqhkjOPQQDAzCBmDEL\n"
+"MAkGA1UEBhMCVVMxFjAUBgNVBAoTDUdlb1RydXN0IEluYy4xOTA3BgNVBAsTMChj\n"
+"KSAyMDA3IEdlb1RydXN0IEluYy4gLSBGb3IgYXV0aG9yaXplZCB1c2Ugb25seTE2\n"
+"MDQGA1UEAxMtR2VvVHJ1c3QgUHJpbWFyeSBDZXJ0aWZpY2F0aW9uIEF1dGhvcml0\n"
+"eSAtIEcyMB4XDTA3MTEwNTAwMDAwMFoXDTM4MDExODIzNTk1OVowgZgxCzAJBgNV\n"
+"BAYTAlVTMRYwFAYDVQQKEw1HZW9UcnVzdCBJbmMuMTkwNwYDVQQLEzAoYykgMjAw\n"
+"NyBHZW9UcnVzdCBJbmMuIC0gRm9yIGF1dGhvcml6ZWQgdXNlIG9ubHkxNjA0BgNV\n"
+"BAMTLUdlb1RydXN0IFByaW1hcnkgQ2VydGlmaWNhdGlvbiBBdXRob3JpdHkgLSBH\n"
+"MjB2MBAGByqGSM49AgEGBSuBBAAiA2IABBWx6P0DFUPlrOuHNxFi79KDNlJ9RVcL\n"
+"So17VDs6bl8VAsBQps8lL33KSLjHUGMcKiEIfJo22Av+0SbFWDEwKCXzXV2juLal\n"
+"tJLtbCyf691DiaI8S0iRHVDsJt/WYC69IaNCMEAwDwYDVR0TAQH/BAUwAwEB/zAO\n"
+"BgNVHQ8BAf8EBAMCAQYwHQYDVR0OBBYEFBVfNVdRVfslsq0DafwBo/q+EVXVMAoG\n"
+"CCqGSM49BAMDA2cAMGQCMGSWWaboCd6LuvpaiIjwH5HTRqjySkwCY/tsXzjbLkGT\n"
+"qQ7mndwxHLKgpxgceeHHNgIwOlavmnRs9vuD4DPTCF+hnMJbn0bWtsuRBmOiBucz\n"
+"rD6ogRLQy7rQkgu2npaqBA+K\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                       //   O  = GeoTrust Inc. OU = (c) 2008 GeoTrust Inc. - For authorized use only CN = GeoTrust Primary Certification Authority - G3
+"MIID/jCCAuagAwIBAgIQFaxulBmyeUtB9iepwxgPHzANBgkqhkiG9w0BAQsFADCB\n"
+"mDELMAkGA1UEBhMCVVMxFjAUBgNVBAoTDUdlb1RydXN0IEluYy4xOTA3BgNVBAsT\n"
+"MChjKSAyMDA4IEdlb1RydXN0IEluYy4gLSBGb3IgYXV0aG9yaXplZCB1c2Ugb25s\n"
+"eTE2MDQGA1UEAxMtR2VvVHJ1c3QgUHJpbWFyeSBDZXJ0aWZpY2F0aW9uIEF1dGhv\n"
+"cml0eSAtIEczMB4XDTA4MDQwMjAwMDAwMFoXDTM3MTIwMTIzNTk1OVowgZgxCzAJ\n"
+"BgNVBAYTAlVTMRYwFAYDVQQKEw1HZW9UcnVzdCBJbmMuMTkwNwYDVQQLEzAoYykg\n"
+"MjAwOCBHZW9UcnVzdCBJbmMuIC0gRm9yIGF1dGhvcml6ZWQgdXNlIG9ubHkxNjA0\n"
+"BgNVBAMTLUdlb1RydXN0IFByaW1hcnkgQ2VydGlmaWNhdGlvbiBBdXRob3JpdHkg\n"
+"LSBHMzCCASIwDQYJKoZIhvcNAQEBBQADggEPADCCAQoCggEBANziXmJYHTNXOTIz\n"
+"+uvLh4yn1ErdBojqZI4xmKU4kB6Yzy5jK/BGvESyiaHAKAxJcCGVn2TAppMSAmUm\n"
+"hsalifD614SgcK9PGpc/BkTVyetyEH3kMSj7HGHmKAdEc5IiaacDiGydY8hS2pgn\n"
+"5whMcD60yRLBxWeDXTPzAxHsatBT4tG6NmCUgLthY2xbF37fQJQeqw3CIShwiP/W\n"
+"JmxsYAQlTlV+fe+/lEjetx3dcI0FX4ilm/LC7urRQEFtYjgdVgbFA0dRIBn8exAL\n"
+"DmKudlW/X3e+PkkBUz2YJQN2JFodtNuJ6nnltrM7P7pMKEF/BqxqjsHQ9gUdfeZC\n"
+"huOl1UcCAwEAAaNCMEAwDwYDVR0TAQH/BAUwAwEB/zAOBgNVHQ8BAf8EBAMCAQYw\n"
+"HQYDVR0OBBYEFMR5yo6hTgMdHNxr2zFblD4/MH8tMA0GCSqGSIb3DQEBCwUAA4IB\n"
+"AQAtxRPPVoB7eni9n64smefv2t+UXglpp+duaIy9cr5HqQ6XErhK8WTTOd8lNNTB\n"
+"zU6B8A8ExCSzNJbGpqow32hhc9f5joWJ7w5elShKKiePEI4ufIbEAp7aDHdlDkQN\n"
+"kv39sxY2+hENHYwOB4lqKVb3cvTdFZx3NWZXqxNT2I7BQMXXExZacse3aQHEerGD\n"
+"AWh9jUGhlBjBJVz88P6DAod8DQ3PLghcSkANPuyBYeYk28rgDi0Hsj5W3I31QYUH\n"
+"SJsMC8tJP33st/3LjWeJGqvtux6jAAgIFyqCXDFdRootD4abdNlF+9RAsXqqaC2G\n"
+"spki4cErx5z481+oghLrGREt\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                       //   O  = GeoTrust Inc. CN = GeoTrust Universal CA
+"MIIFaDCCA1CgAwIBAgIBATANBgkqhkiG9w0BAQUFADBFMQswCQYDVQQGEwJVUzEW\n"
+"MBQGA1UEChMNR2VvVHJ1c3QgSW5jLjEeMBwGA1UEAxMVR2VvVHJ1c3QgVW5pdmVy\n"
+"c2FsIENBMB4XDTA0MDMwNDA1MDAwMFoXDTI5MDMwNDA1MDAwMFowRTELMAkGA1UE\n"
+"BhMCVVMxFjAUBgNVBAoTDUdlb1RydXN0IEluYy4xHjAcBgNVBAMTFUdlb1RydXN0\n"
+"IFVuaXZlcnNhbCBDQTCCAiIwDQYJKoZIhvcNAQEBBQADggIPADCCAgoCggIBAKYV\n"
+"VaCjxuAfjJ0hUNfBvitbtaSeodlyWL0AG0y/YckUHUWCq8YdgNY96xCcOq9tJPi8\n"
+"cQGeBvV8Xx7BDlXKg5pZMK4ZyzBIle0iN430SppyZj6tlcDgFgDgEB8rMQ7XlFTT\n"
+"QjOgNB0eRXbdT8oYN+yFFXoZCPzVx5zw8qkuEKmS5j1YPakWaDwvdSEYfyh3peFh\n"
+"F7em6fgemdtzbvQKoiFs7tqqhZJmr/Z6a4LauiIINQ/PQvE1+mrufislzDoR5G2v\n"
+"c7J2Ha3QsnhnGqQ5HFELZ1aD/ThdDc7d8Lsrlh/eezJS/R27tQahsiFepdaVaH/w\n"
+"mZ7cRQg+59IJDTWU3YBOU5fXtQlEIGQWFwMCTFMNaN7VqnJNk22CDtucvc+081xd\n"
+"VHppCZbW2xHBjXWotM85yM48vCR85mLK4b19p71XZQvk/iXttmkQ3CgaRr0BHdCX\n"
+"teGYO8A3ZNY9lO4L4fUorgtWv3GLIylBjobFS1J72HGrH4oVpjuDWtdYAVHGTEHZ\n"
+"f9hBZ3KiKN9gg6meyHv8U3NyWfWTehd2Ds735VzZC1U0oqpbtWpU5xPKV+yXbfRe\n"
+"Bi9Fi1jUIxaS5BZuKGNZMN9QAZxjiRqf2xeUgnA3wySemkfWWspOqGmJch+RbNt+\n"
+"nhutxx9z3SxPGWX9f5NAEC7S8O08ni4oPmkmM8V7AgMBAAGjYzBhMA8GA1UdEwEB\n"
+"/wQFMAMBAf8wHQYDVR0OBBYEFNq7LqqwDLiIJlF0XG0D08DYj3rWMB8GA1UdIwQY\n"
+"MBaAFNq7LqqwDLiIJlF0XG0D08DYj3rWMA4GA1UdDwEB/wQEAwIBhjANBgkqhkiG\n"
+"9w0BAQUFAAOCAgEAMXjmx7XfuJRAyXHEqDXsRh3ChfMoWIawC/yOsjmPRFWrZIRc\n"
+"aanQmjg8+uUfNeVE44B5lGiku8SfPeE0zTBGi1QrlaXv9z+ZhP015s8xxtxqv6fX\n"
+"IwjhmF7DWgh2qaavdy+3YL1ERmrvl/9zlcGO6JP7/TG37FcREUWbMPEaiDnBTzyn\n"
+"ANXH/KttgCJwpQzgXQQpAvvLoJHRfNbDflDVnVi+QTjruXU8FdmbyUqDWcDaU/0z\n"
+"uzYYm4UPFd3uLax2k7nZAY1IEKj79TiG8dsKxr2EoyNB3tZ3b4XUhRxQ4K5RirqN\n"
+"Pnbiucon8l+f725ZDQbYKxek0nxru18UGkiPGkzns0ccjkxFKyDuSN/n3QmOGKja\n"
+"QI2SJhFTYXNd673nxE0pN2HrrDktZy4W1vUAg4WhzH92xH3kt0tm7wNFYGm2DFKW\n"
+"koRepqO1pD4r2czYG0eq8kTaT/kD6PAUyz/zg97QwVTjt+gKN02LIFkDMBmhLMi9\n"
+"ER/frslKxfMnZmaGrGiR/9nmUxwPi1xpZQomyB40w11Re9epnAahNt3ViZS82eQt\n"
+"DF4JbAiXfKM9fJP/P6EUp8+1Xevb2xzEdt+Iub1FBZUbrvxGakyvSOPOrg/Sfuvm\n"
+"bJxPgWp6ZKy7PtXny3YuxadIwVyQD8vIP/rmMuGNG2+k5o7Y+SlIis5z/iw=\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                        //   O  = GeoTrust Inc. CN = GeoTrust Universal CA 2
+"MIIFbDCCA1SgAwIBAgIBATANBgkqhkiG9w0BAQUFADBHMQswCQYDVQQGEwJVUzEW\n"
+"MBQGA1UEChMNR2VvVHJ1c3QgSW5jLjEgMB4GA1UEAxMXR2VvVHJ1c3QgVW5pdmVy\n"
+"c2FsIENBIDIwHhcNMDQwMzA0MDUwMDAwWhcNMjkwMzA0MDUwMDAwWjBHMQswCQYD\n"
+"VQQGEwJVUzEWMBQGA1UEChMNR2VvVHJ1c3QgSW5jLjEgMB4GA1UEAxMXR2VvVHJ1\n"
+"c3QgVW5pdmVyc2FsIENBIDIwggIiMA0GCSqGSIb3DQEBAQUAA4ICDwAwggIKAoIC\n"
+"AQCzVFLByT7y2dyxUxpZKeexw0Uo5dfR7cXFS6GqdHtXr0om/Nj1XqduGdt0DE81\n"
+"WzILAePb63p3NeqqWuDW6KFXlPCQo3RWlEQwAx5cTiuFJnSCegx2oG9NzkEtoBUG\n"
+"FF+3Qs17j1hhNNwqCPkuwwGmIkQcTAeC5lvO0Ep8BNMZcyfwqph/Lq9O64ceJHdq\n"
+"XbboW0W63MOhBW9Wjo8QJqVJwy7XQYci4E+GymC16qFjwAGXEHm9ADwSbSsVsaxL\n"
+"se4YuU6W3Nx2/zu+z18DwPw76L5GG//aQMJS9/7jOvdqdzXQ2o3rXhhqMcceujwb\n"
+"KNZrVMaqW9eiLBsZzKIC9ptZvTdrhrVtgrrY6slWvKk2WP0+GfPtDCapkzj4T8Fd\n"
+"IgbQl+rhrcZV4IErKIM6+vR7IVEAvlI4zs1meaj0gVbi0IMJR1FbUGrP20gaXT73\n"
+"y/Zl92zxlfgCOzJWgjl6W70viRu/obTo/3+NjN8D8WBOWBFM66M/ECuDmgFz2ZRt\n"
+"hAAnZqzwcEAJQpKtT5MNYQlRJNiS1QuUYbKHsu3/mjX/hVTK7URDrBs8FmtISgoc\n"
+"QIgfksILAAX/8sgCSqSqqcyZlpwvWOB94b67B9xfBHJcMTTD7F8t4D1kkCLm0ey4\n"
+"Lt1ZrtmhN79UNdxzMk+MBB4zsslG8dhcyFVQyWi9qLo2CQIDAQABo2MwYTAPBgNV\n"
+"HRMBAf8EBTADAQH/MB0GA1UdDgQWBBR281Xh+qQ2+/CfXGJx7Tz0RzgQKzAfBgNV\n"
+"HSMEGDAWgBR281Xh+qQ2+/CfXGJx7Tz0RzgQKzAOBgNVHQ8BAf8EBAMCAYYwDQYJ\n"
+"KoZIhvcNAQEFBQADggIBAGbBxiPz2eAubl/oz66wsCVNK/g7WJtAJDday6sWSf+z\n"
+"dXkzoS9tcBc0kf5nfo/sm+VegqlVHy/c1FEHEv6sFj4sNcZj/NwQ6w2jqtB8zNHQ\n"
+"L1EuxBRa3ugZ4T7GzKQp5y6EqgYweHZUcyiYWTjgAA1i00J9IZ+uPTqM1fp3DRgr\n"
+"Fg5fNuH8KrUwJM/gYwx7WBr+mbpCErGR9Hxo4sjoryzqyX6uuyo9DRXcNJW2GHSo\n"
+"ag/HtPQTxORb7QrSpJdMKu0vbBKJPfEncKpqA1Ihn0CoZ1Dy81of398j9tx4TuaY\n"
+"T1U6U+Pv8vSfx3zYWK8pIpe44L2RLrB27FcRz+8pRPPphXpgY+RdM4kX2TGq2tbz\n"
+"GDVyz4crL2MjhF2EjD9XoIj8mZEoJmmZ1I+XRL6O1UixpCgp8RW04eWe3fiPpm8m\n"
+"1wk8OhwRDqZsN/etRIcsKMfYdIKz0G9KV7s1KSegi+ghp4dkNl3M2Basx7InQJJV\n"
+"OCiNUW7dFGdTbHFcJoRNdVq2fmBWqU2t+5sel/MN2dKXVHfaPRK34B7vCAas+YWH\n"
+"6aLcr34YEoP9VhdBLtUpgn2Z9DH2canPLAEnpQW5qrJITirvn5NSUZU8UnOOVkwX\n"
+"QMAJKOSLakhT2+zNVVXxxvjpoixMptEmX36vWkzaH6byHCx+rgIW0lbQL1dTR+iS\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                        //   OU = GlobalSign ECC Root CA - R4 O  = GlobalSign CN = GlobalSign
+"MIIB4TCCAYegAwIBAgIRKjikHJYKBN5CsiilC+g0mAIwCgYIKoZIzj0EAwIwUDEk\n"
+"MCIGA1UECxMbR2xvYmFsU2lnbiBFQ0MgUm9vdCBDQSAtIFI0MRMwEQYDVQQKEwpH\n"
+"bG9iYWxTaWduMRMwEQYDVQQDEwpHbG9iYWxTaWduMB4XDTEyMTExMzAwMDAwMFoX\n"
+"DTM4MDExOTAzMTQwN1owUDEkMCIGA1UECxMbR2xvYmFsU2lnbiBFQ0MgUm9vdCBD\n"
+"QSAtIFI0MRMwEQYDVQQKEwpHbG9iYWxTaWduMRMwEQYDVQQDEwpHbG9iYWxTaWdu\n"
+"MFkwEwYHKoZIzj0CAQYIKoZIzj0DAQcDQgAEuMZ5049sJQ6fLjkZHAOkrprlOQcJ\n"
+"FspjsbmG+IpXwVfOQvpzofdlQv8ewQCybnMO/8ch5RikqtlxP6jUuc6MHaNCMEAw\n"
+"DgYDVR0PAQH/BAQDAgEGMA8GA1UdEwEB/wQFMAMBAf8wHQYDVR0OBBYEFFSwe61F\n"
+"uOJAf/sKbvu+M8k8o4TVMAoGCCqGSM49BAMCA0gAMEUCIQDckqGgE6bPA7DmxCGX\n"
+"kPoUVy0D7O48027KqGx2vKLeuwIgJ6iFJzWbVsaj8kfSt24bAgAXqmemFZHe+pTs\n"
+"ewv4n4Q=\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                       //   OU = GlobalSign Root CA - R6 O  = GlobalSign CN = GlobalSign
+"MIIFgzCCA2ugAwIBAgIORea7A4Mzw4VlSOb/RVEwDQYJKoZIhvcNAQEMBQAwTDEg\n"
+"MB4GA1UECxMXR2xvYmFsU2lnbiBSb290IENBIC0gUjYxEzARBgNVBAoTCkdsb2Jh\n"
+"bFNpZ24xEzARBgNVBAMTCkdsb2JhbFNpZ24wHhcNMTQxMjEwMDAwMDAwWhcNMzQx\n"
+"MjEwMDAwMDAwWjBMMSAwHgYDVQQLExdHbG9iYWxTaWduIFJvb3QgQ0EgLSBSNjET\n"
+"MBEGA1UEChMKR2xvYmFsU2lnbjETMBEGA1UEAxMKR2xvYmFsU2lnbjCCAiIwDQYJ\n"
+"KoZIhvcNAQEBBQADggIPADCCAgoCggIBAJUH6HPKZvnsFMp7PPcNCPG0RQssgrRI\n"
+"xutbPK6DuEGSMxSkb3/pKszGsIhrxbaJ0cay/xTOURQh7ErdG1rG1ofuTToVBu1k\n"
+"ZguSgMpE3nOUTvOniX9PeGMIyBJQbUJmL025eShNUhqKGoC3GYEOfsSKvGRMIRxD\n"
+"aNc9PIrFsmbVkJq3MQbFvuJtMgamHvm566qjuL++gmNQ0PAYid/kD3n16qIfKtJw\n"
+"LnvnvJO7bVPiSHyMEAc4/2ayd2F+4OqMPKq0pPbzlUoSB239jLKJz9CgYXfIWHSw\n"
+"1CM69106yqLbnQneXUQtkPGBzVeS+n68UARjNN9rkxi+azayOeSsJDa38O+2HBNX\n"
+"k7besvjihbdzorg1qkXy4J02oW9UivFyVm4uiMVRQkQVlO6jxTiWm05OWgtH8wY2\n"
+"SXcwvHE35absIQh1/OZhFj931dmRl4QKbNQCTXTAFO39OfuD8l4UoQSwC+n+7o/h\n"
+"bguyCLNhZglqsQY6ZZZZwPA1/cnaKI0aEYdwgQqomnUdnjqGBQCe24DWJfncBZ4n\n"
+"WUx2OVvq+aWh2IMP0f/fMBH5hc8zSPXKbWQULHpYT9NLCEnFlWQaYw55PfWzjMpY\n"
+"rZxCRXluDocZXFSxZba/jJvcE+kNb7gu3GduyYsRtYQUigAZcIN5kZeR1Bonvzce\n"
+"MgfYFGM8KEyvAgMBAAGjYzBhMA4GA1UdDwEB/wQEAwIBBjAPBgNVHRMBAf8EBTAD\n"
+"AQH/MB0GA1UdDgQWBBSubAWjkxPioufi1xzWx/B/yGdToDAfBgNVHSMEGDAWgBSu\n"
+"bAWjkxPioufi1xzWx/B/yGdToDANBgkqhkiG9w0BAQwFAAOCAgEAgyXt6NH9lVLN\n"
+"nsAEoJFp5lzQhN7craJP6Ed41mWYqVuoPId8AorRbrcWc+ZfwFSY1XS+wc3iEZGt\n"
+"Ixg93eFyRJa0lV7Ae46ZeBZDE1ZXs6KzO7V33EByrKPrmzU+sQghoefEQzd5Mr61\n"
+"55wsTLxDKZmOMNOsIeDjHfrYBzN2VAAiKrlNIC5waNrlU/yDXNOd8v9EDERm8tLj\n"
+"vUYAGm0CuiVdjaExUd1URhxN25mW7xocBFymFe944Hn+Xds+qkxV/ZoVqW/hpvvf\n"
+"cDDpw+5CRu3CkwWJ+n1jez/QcYF8AOiYrg54NMMl+68KnyBr3TsTjxKM4kEaSHpz\n"
+"oHdpx7Zcf4LIHv5YGygrqGytXm3ABdJ7t+uA/iU3/gKbaKxCXcPu9czc8FB10jZp\n"
+"nOZ7BN9uBmm23goJSFmH63sUYHpkqmlD75HHTOwY3WzvUy2MmeFe8nI+z1TIvWfs\n"
+"pA9MRf/TuTAjB0yPEL+GltmZWrSZVxykzLsViVO6LAUP5MSeGbEYNNVMnbrt9x+v\n"
+"JJUEeKgDu+6B5dpffItKoZB0JaezPkvILFa9x8jvOOJckvB595yEunQtYQEgfn7R\n"
+"8k8HWV+LLUNS60YMlOH1Zkd5d9VUWx+tJDfLRVpOoERIyNiwmcUVhAn21klJwGW4\n"
+"5hpxbqCo8YLoRT5s1gLXCmeDBVrJpBA=\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                       //   O= AC Camerfirma S.A. CN = Global Chambersign Root - 2008
+"MIIHSTCCBTGgAwIBAgIJAMnN0+nVfSPOMA0GCSqGSIb3DQEBBQUAMIGsMQswCQYD\n"
+"VQQGEwJFVTFDMEEGA1UEBxM6TWFkcmlkIChzZWUgY3VycmVudCBhZGRyZXNzIGF0\n"
+"IHd3dy5jYW1lcmZpcm1hLmNvbS9hZGRyZXNzKTESMBAGA1UEBRMJQTgyNzQzMjg3\n"
+"MRswGQYDVQQKExJBQyBDYW1lcmZpcm1hIFMuQS4xJzAlBgNVBAMTHkdsb2JhbCBD\n"
+"aGFtYmVyc2lnbiBSb290IC0gMjAwODAeFw0wODA4MDExMjMxNDBaFw0zODA3MzEx\n"
+"MjMxNDBaMIGsMQswCQYDVQQGEwJFVTFDMEEGA1UEBxM6TWFkcmlkIChzZWUgY3Vy\n"
+"cmVudCBhZGRyZXNzIGF0IHd3dy5jYW1lcmZpcm1hLmNvbS9hZGRyZXNzKTESMBAG\n"
+"A1UEBRMJQTgyNzQzMjg3MRswGQYDVQQKExJBQyBDYW1lcmZpcm1hIFMuQS4xJzAl\n"
+"BgNVBAMTHkdsb2JhbCBDaGFtYmVyc2lnbiBSb290IC0gMjAwODCCAiIwDQYJKoZI\n"
+"hvcNAQEBBQADggIPADCCAgoCggIBAMDfVtPkOpt2RbQT2//BthmLN0EYlVJH6xed\n"
+"KYiONWwGMi5HYvNJBL99RDaxccy9Wglz1dmFRP+RVyXfXjaOcNFccUMd2drvXNL7\n"
+"G706tcuto8xEpw2uIRU/uXpbknXYpBI4iRmKt4DS4jJvVpyR1ogQC7N0ZJJ0YPP2\n"
+"zxhPYLIj0Mc7zmFLmY/CDNBAspjcDahOo7kKrmCgrUVSY7pmvWjg+b4aqIG7HkF4\n"
+"ddPB/gBVsIdU6CeQNR1MM62X/JcumIS/LMmjv9GYERTtY/jKmIhYF5ntRQOXfjyG\n"
+"HoiMvvKRhI9lNNgATH23MRdaKXoKGCQwoze1eqkBfSbW+Q6OWfH9GzO1KTsXO0G2\n"
+"Id3UwD2ln58fQ1DJu7xsepeY7s2MH/ucUa6LcL0nn3HAa6x9kGbo1106DbDVwo3V\n"
+"yJ2dwW3Q0L9R5OP4wzg2rtandeavhENdk5IMagfeOx2YItaswTXbo6Al/3K1dh3e\n"
+"beksZixShNBFks4c5eUzHdwHU1SjqoI7mjcv3N2gZOnm3b2u/GSFHTynyQbehP9r\n"
+"6GsaPMWis0L7iwk+XwhSx2LE1AVxv8Rk5Pihg+g+EpuoHtQ2TS9x9o0o9oOpE9Jh\n"
+"wZG7SMA0j0GMS0zbaRL/UJScIINZc+18ofLx/d33SdNDWKBWY8o9PeU1VlnpDsog\n"
+"zCtLkykPAgMBAAGjggFqMIIBZjASBgNVHRMBAf8ECDAGAQH/AgEMMB0GA1UdDgQW\n"
+"BBS5CcqcHtvTbDprru1U8VuTBjUuXjCB4QYDVR0jBIHZMIHWgBS5CcqcHtvTbDpr\n"
+"ru1U8VuTBjUuXqGBsqSBrzCBrDELMAkGA1UEBhMCRVUxQzBBBgNVBAcTOk1hZHJp\n"
+"ZCAoc2VlIGN1cnJlbnQgYWRkcmVzcyBhdCB3d3cuY2FtZXJmaXJtYS5jb20vYWRk\n"
+"cmVzcykxEjAQBgNVBAUTCUE4Mjc0MzI4NzEbMBkGA1UEChMSQUMgQ2FtZXJmaXJt\n"
+"YSBTLkEuMScwJQYDVQQDEx5HbG9iYWwgQ2hhbWJlcnNpZ24gUm9vdCAtIDIwMDiC\n"
+"CQDJzdPp1X0jzjAOBgNVHQ8BAf8EBAMCAQYwPQYDVR0gBDYwNDAyBgRVHSAAMCow\n"
+"KAYIKwYBBQUHAgEWHGh0dHA6Ly9wb2xpY3kuY2FtZXJmaXJtYS5jb20wDQYJKoZI\n"
+"hvcNAQEFBQADggIBAICIf3DekijZBZRG/5BXqfEv3xoNa/p8DhxJJHkn2EaqbylZ\n"
+"UohwEurdPfWbU1Rv4WCiqAm57OtZfMY18dwY6fFn5a+6ReAJ3spED8IXDneRRXoz\n"
+"X1+WLGiLwUePmJs9wOzL9dWCkoQ10b42OFZyMVtHLaoXpGNR6woBrX/sdZ7LoR/x\n"
+"fxKxueRkf2fWIyr0uDldmOghp+G9PUIadJpwr2hsUF1Jz//7Dl3mLEfXgTpZALVz\n"
+"a2Mg9jFFCDkO9HB+QHBaP9BrQql0PSgvAm11cpUJjUhjxsYjV5KTXjXBjfkK9yyd\n"
+"Yhz2rXzdpjEetrHHfoUm+qRqtdpjMNHvkzeyZi99Bffnt0uYlDXA2TopwZ2yUDMd\n"
+"SqlapskD7+3056huirRXhOukP9DuqqqHW2Pok+JrqNS4cnhrG+055F3Lm6qH1U9O\n"
+"AP7Zap88MQ8oAgF9mOinsKJknnn4SPIVqczmyETrP3iZ8ntxPjzxmKfFGBI/5rso\n"
+"M0LpRQp8bfKGeS/Fghl9CYl8slR2iK7ewfPM4W7bMdaTrpmg7yVqc5iJWzouE4ge\n"
+"v8CSlDQb4ye3ix5vQv/n6TebUB0tovkC7stYWDpxvGjjqsGvHCgfotwjZT+B6q6Z\n"
+"09gwzxMNTxXJhLynSC34MCN32EZLeW32jO06f2ARePTpm67VVMB0gNELQp/B\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                      //   O  = The Go Daddy Group, Inc. OU = Go Daddy Class 2 Certification Authority
+"MIIEADCCAuigAwIBAgIBADANBgkqhkiG9w0BAQUFADBjMQswCQYDVQQGEwJVUzEh\n"
+"MB8GA1UEChMYVGhlIEdvIERhZGR5IEdyb3VwLCBJbmMuMTEwLwYDVQQLEyhHbyBE\n"
+"YWRkeSBDbGFzcyAyIENlcnRpZmljYXRpb24gQXV0aG9yaXR5MB4XDTA0MDYyOTE3\n"
+"MDYyMFoXDTM0MDYyOTE3MDYyMFowYzELMAkGA1UEBhMCVVMxITAfBgNVBAoTGFRo\n"
+"ZSBHbyBEYWRkeSBHcm91cCwgSW5jLjExMC8GA1UECxMoR28gRGFkZHkgQ2xhc3Mg\n"
+"MiBDZXJ0aWZpY2F0aW9uIEF1dGhvcml0eTCCASAwDQYJKoZIhvcNAQEBBQADggEN\n"
+"ADCCAQgCggEBAN6d1+pXGEmhW+vXX0iG6r7d/+TvZxz0ZWizV3GgXne77ZtJ6XCA\n"
+"PVYYYwhv2vLM0D9/AlQiVBDYsoHUwHU9S3/Hd8M+eKsaA7Ugay9qK7HFiH7Eux6w\n"
+"wdhFJ2+qN1j3hybX2C32qRe3H3I2TqYXP2WYktsqbl2i/ojgC95/5Y0V4evLOtXi\n"
+"EqITLdiOr18SPaAIBQi2XKVlOARFmR6jYGB0xUGlcmIbYsUfb18aQr4CUWWoriMY\n"
+"avx4A6lNf4DD+qta/KFApMoZFv6yyO9ecw3ud72a9nmYvLEHZ6IVDd2gWMZEewo+\n"
+"YihfukEHU1jPEX44dMX4/7VpkI+EdOqXG68CAQOjgcAwgb0wHQYDVR0OBBYEFNLE\n"
+"sNKR1EwRcbNhyz2h/t2oatTjMIGNBgNVHSMEgYUwgYKAFNLEsNKR1EwRcbNhyz2h\n"
+"/t2oatTjoWekZTBjMQswCQYDVQQGEwJVUzEhMB8GA1UEChMYVGhlIEdvIERhZGR5\n"
+"IEdyb3VwLCBJbmMuMTEwLwYDVQQLEyhHbyBEYWRkeSBDbGFzcyAyIENlcnRpZmlj\n"
+"YXRpb24gQXV0aG9yaXR5ggEAMAwGA1UdEwQFMAMBAf8wDQYJKoZIhvcNAQEFBQAD\n"
+"ggEBADJL87LKPpH8EsahB4yOd6AzBhRckB4Y9wimPQoZ+YeAEW5p5JYXMP80kWNy\n"
+"OO7MHAGjHZQopDH2esRU1/blMVgDoszOYtuURXO1v0XJJLXVggKtI3lpjbi2Tc7P\n"
+"TMozI+gciKqdi0FuFskg5YmezTvacPd+mSYgFFQlq25zheabIZ0KbIIOqPjCDPoQ\n"
+"HmyW74cNxA9hi63ugyuV+I6ShHI56yDqg+2DzZduCLzrTia2cyvk0/ZM/iZx4mER\n"
+"dEr/VxqHD3VILs9RaRegAhJhldXRQLIQTO7ErBBDpqWeCtWVYpoNz4iCxTIM5Cuf\n"
+"ReYNnyicsbkqWletNw+vHX/bvZ8=\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                       //   O  = GoDaddy.com, Inc. CN = Go Daddy Root Certificate Authority - G2
+"MIIDxTCCAq2gAwIBAgIBADANBgkqhkiG9w0BAQsFADCBgzELMAkGA1UEBhMCVVMx\n"
+"EDAOBgNVBAgTB0FyaXpvbmExEzARBgNVBAcTClNjb3R0c2RhbGUxGjAYBgNVBAoT\n"
+"EUdvRGFkZHkuY29tLCBJbmMuMTEwLwYDVQQDEyhHbyBEYWRkeSBSb290IENlcnRp\n"
+"ZmljYXRlIEF1dGhvcml0eSAtIEcyMB4XDTA5MDkwMTAwMDAwMFoXDTM3MTIzMTIz\n"
+"NTk1OVowgYMxCzAJBgNVBAYTAlVTMRAwDgYDVQQIEwdBcml6b25hMRMwEQYDVQQH\n"
+"EwpTY290dHNkYWxlMRowGAYDVQQKExFHb0RhZGR5LmNvbSwgSW5jLjExMC8GA1UE\n"
+"AxMoR28gRGFkZHkgUm9vdCBDZXJ0aWZpY2F0ZSBBdXRob3JpdHkgLSBHMjCCASIw\n"
+"DQYJKoZIhvcNAQEBBQADggEPADCCAQoCggEBAL9xYgjx+lk09xvJGKP3gElY6SKD\n"
+"E6bFIEMBO4Tx5oVJnyfq9oQbTqC023CYxzIBsQU+B07u9PpPL1kwIuerGVZr4oAH\n"
+"/PMWdYA5UXvl+TW2dE6pjYIT5LY/qQOD+qK+ihVqf94Lw7YZFAXK6sOoBJQ7Rnwy\n"
+"DfMAZiLIjWltNowRGLfTshxgtDj6AozO091GB94KPutdfMh8+7ArU6SSYmlRJQVh\n"
+"GkSBjCypQ5Yj36w6gZoOKcUcqeldHraenjAKOc7xiID7S13MMuyFYkMlNAJWJwGR\n"
+"tDtwKj9useiciAF9n9T521NtYJ2/LOdYq7hfRvzOxBsDPAnrSTFcaUaz4EcCAwEA\n"
+"AaNCMEAwDwYDVR0TAQH/BAUwAwEB/zAOBgNVHQ8BAf8EBAMCAQYwHQYDVR0OBBYE\n"
+"FDqahQcQZyi27/a9BUFuIMGU2g/eMA0GCSqGSIb3DQEBCwUAA4IBAQCZ21151fmX\n"
+"WWcDYfF+OwYxdS2hII5PZYe096acvNjpL9DbWu7PdIxztDhC2gV7+AJ1uP2lsdeu\n"
+"9tfeE8tTEH6KRtGX+rcuKxGrkLAngPnon1rpN5+r5N9ss4UXnT3ZJE95kTXWXwTr\n"
+"gIOrmgIttRD02JDHBHNA7XIloKmf7J6raBKZV8aPEjoJpL1E/QYVN8Gb5DKj7Tjo\n"
+"2GTzLH4U/ALqn83/B2gX2yKQOC16jdFU8WnjXzPKej17CuPKf1855eJ1usV2GDPO\n"
+"LPAvTK33sefOT6jEm0pUBsV/fdUID+Ic/n4XuKxe9tQWskMJDE32p2u0mYRlynqI\n"
+"4uJEvlz36hz1\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                       //  O  = Hellenic Academic and Research Institutions Cert. Authority CN = Hellenic Academic and Research Institutions ECC RootCA 2015
+"MIICwzCCAkqgAwIBAgIBADAKBggqhkjOPQQDAjCBqjELMAkGA1UEBhMCR1IxDzAN\n"
+"BgNVBAcTBkF0aGVuczFEMEIGA1UEChM7SGVsbGVuaWMgQWNhZGVtaWMgYW5kIFJl\n"
+"c2VhcmNoIEluc3RpdHV0aW9ucyBDZXJ0LiBBdXRob3JpdHkxRDBCBgNVBAMTO0hl\n"
+"bGxlbmljIEFjYWRlbWljIGFuZCBSZXNlYXJjaCBJbnN0aXR1dGlvbnMgRUNDIFJv\n"
+"b3RDQSAyMDE1MB4XDTE1MDcwNzEwMzcxMloXDTQwMDYzMDEwMzcxMlowgaoxCzAJ\n"
+"BgNVBAYTAkdSMQ8wDQYDVQQHEwZBdGhlbnMxRDBCBgNVBAoTO0hlbGxlbmljIEFj\n"
+"YWRlbWljIGFuZCBSZXNlYXJjaCBJbnN0aXR1dGlvbnMgQ2VydC4gQXV0aG9yaXR5\n"
+"MUQwQgYDVQQDEztIZWxsZW5pYyBBY2FkZW1pYyBhbmQgUmVzZWFyY2ggSW5zdGl0\n"
+"dXRpb25zIEVDQyBSb290Q0EgMjAxNTB2MBAGByqGSM49AgEGBSuBBAAiA2IABJKg\n"
+"QehLgoRc4vgxEZmGZE4JJS+dQS8KrjVPdJWyUWRrjWvmP3CV8AVER6ZyOFB2lQJa\n"
+"jq4onvktTpnvLEhvTCUp6NFxW98dwXU3tNf6e3pCnGoKVlp8aQuqgAkkbH7BRqNC\n"
+"MEAwDwYDVR0TAQH/BAUwAwEB/zAOBgNVHQ8BAf8EBAMCAQYwHQYDVR0OBBYEFLQi\n"
+"C4KZJAEOnLvkDv2/+5cgk5kqMAoGCCqGSM49BAMCA2cAMGQCMGfOFmI4oqxiRaep\n"
+"lSTAGiecMjvAwNW6qef4BENThe5SId6d9SWDPp5YSy/XZxMOIQIwBeF1Ad5o7Sof\n"
+"TUwJCA3sS61kFyjndc5FZXIhF8siQQ6ME5g4mlRtm8rifOoCWCKR\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                       //   O  = Hellenic Academic and Research Institutions Cert. Authority CN = Hellenic Academic and Research Institutions RootCA 2011
+"MIIEMTCCAxmgAwIBAgIBADANBgkqhkiG9w0BAQUFADCBlTELMAkGA1UEBhMCR1Ix\n"
+"RDBCBgNVBAoTO0hlbGxlbmljIEFjYWRlbWljIGFuZCBSZXNlYXJjaCBJbnN0aXR1\n"
+"dGlvbnMgQ2VydC4gQXV0aG9yaXR5MUAwPgYDVQQDEzdIZWxsZW5pYyBBY2FkZW1p\n"
+"YyBhbmQgUmVzZWFyY2ggSW5zdGl0dXRpb25zIFJvb3RDQSAyMDExMB4XDTExMTIw\n"
+"NjEzNDk1MloXDTMxMTIwMTEzNDk1MlowgZUxCzAJBgNVBAYTAkdSMUQwQgYDVQQK\n"
+"EztIZWxsZW5pYyBBY2FkZW1pYyBhbmQgUmVzZWFyY2ggSW5zdGl0dXRpb25zIENl\n"
+"cnQuIEF1dGhvcml0eTFAMD4GA1UEAxM3SGVsbGVuaWMgQWNhZGVtaWMgYW5kIFJl\n"
+"c2VhcmNoIEluc3RpdHV0aW9ucyBSb290Q0EgMjAxMTCCASIwDQYJKoZIhvcNAQEB\n"
+"BQADggEPADCCAQoCggEBAKlTAOMupvaO+mDYLZU++CwqVE7NuYRhlFhPjz2L5EPz\n"
+"dYmNUeTDN9KKiE15HrcS3UN4SoqS5tdI1Q+kOilENbgH9mgdVc04UfCMJDGFr4PJ\n"
+"fel3r+0ae50X+bOdOFAPplp5kYCvN66m0zH7tSYJnTxa71HFK9+WXesyHgLacEns\n"
+"bgzImjeN9/E2YEsmLIKe0HjzDQ9jpFEw4fkrJxIH2Oq9GGKYsFk3fb7u8yBRQlqD\n"
+"75O6aRXxYp2fmTmCobd0LovUxQt7L/DICto9eQqakxylKHJzkUOap9FNhYS5qXSP\n"
+"FEDH3N6sQWRstBmbAmNtJGSPRLIl6s5ddAxjMlyNh+UCAwEAAaOBiTCBhjAPBgNV\n"
+"HRMBAf8EBTADAQH/MAsGA1UdDwQEAwIBBjAdBgNVHQ4EFgQUppFC/RNhSiOeCKQp\n"
+"5dgTBCPuQSUwRwYDVR0eBEAwPqA8MAWCAy5ncjAFggMuZXUwBoIELmVkdTAGggQu\n"
+"b3JnMAWBAy5ncjAFgQMuZXUwBoEELmVkdTAGgQQub3JnMA0GCSqGSIb3DQEBBQUA\n"
+"A4IBAQAf73lB4XtuP7KMhjdCSk4cNx6NZrokgclPEg8hwAOXhiVtXdMiKahsog2p\n"
+"6z0GW5k6x8zDmjR/qw7IThzh+uTczQ2+vyT+bOdrwg3IBp5OjWEopmr95fZi6hg8\n"
+"TqBTnbI6nOulnJEWtk2C4AwFSKls9cz4y51JtPACpf1wA+2KIaWuE4ZJwzNzvoc7\n"
+"dIsXRSZMFpGD/md9zU1jZ/rzAxKWeAaNsWftjj++n08C9bMJL/NMh98qy5V8Acys\n"
+"Nnq/onN694/BtZqhFLKPM58N7yLcZnuEvUUXBj08yrl3NI/K6s8/MT7jiOOASSXI\n"
+"l7WdmplNsDz4SgCbZN2fOUvRJ9e4\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                       //   O  = Hellenic Academic and Research Institutions Cert. Authority CN = Hellenic Academic and Research Institutions RootCA 2015
+"MIIGCzCCA/OgAwIBAgIBADANBgkqhkiG9w0BAQsFADCBpjELMAkGA1UEBhMCR1Ix\n"
+"DzANBgNVBAcTBkF0aGVuczFEMEIGA1UEChM7SGVsbGVuaWMgQWNhZGVtaWMgYW5k\n"
+"IFJlc2VhcmNoIEluc3RpdHV0aW9ucyBDZXJ0LiBBdXRob3JpdHkxQDA+BgNVBAMT\n"
+"N0hlbGxlbmljIEFjYWRlbWljIGFuZCBSZXNlYXJjaCBJbnN0aXR1dGlvbnMgUm9v\n"
+"dENBIDIwMTUwHhcNMTUwNzA3MTAxMTIxWhcNNDAwNjMwMTAxMTIxWjCBpjELMAkG\n"
+"A1UEBhMCR1IxDzANBgNVBAcTBkF0aGVuczFEMEIGA1UEChM7SGVsbGVuaWMgQWNh\n"
+"ZGVtaWMgYW5kIFJlc2VhcmNoIEluc3RpdHV0aW9ucyBDZXJ0LiBBdXRob3JpdHkx\n"
+"QDA+BgNVBAMTN0hlbGxlbmljIEFjYWRlbWljIGFuZCBSZXNlYXJjaCBJbnN0aXR1\n"
+"dGlvbnMgUm9vdENBIDIwMTUwggIiMA0GCSqGSIb3DQEBAQUAA4ICDwAwggIKAoIC\n"
+"AQDC+Kk/G4n8PDwEXT2QNrCROnk8ZlrvbTkBSRq0t89/TSNTt5AA4xMqKKYx8ZEA\n"
+"4yjsriFBzh/a/X0SWwGDD7mwX5nh8hKDgE0GPt+sr+ehiGsxr/CL0BgzuNtFajT0\n"
+"AoAkKAoCFZVedioNmToUW/bLy1O8E00BiDeUJRtCvCLYjqOWXjrZMts+6PAQZe10\n"
+"4S+nfK8nNLspfZu2zwnI5dMK/IhlZXQK3HMcXM1AsRzUtoSMTFDPaI6oWa7CJ06C\n"
+"ojXdFPQf/7J31Ycvqm59JCfnxssm5uX+Zwdj2EUN3TpZZTlYepKZcj2chF6IIbjV\n"
+"9Cz82XBST3i4vTwri5WY9bPRaM8gFH5MXF/ni+X1NYEZN9cRCLdmvtNKzoNXADrD\n"
+"gfgXy5I2XdGj2HUb4Ysn6npIQf1FGQatJ5lOwXBH3bWfgVMS5bGMSF0xQxfjjMZ6\n"
+"Y5ZLKTBOhE5iGV48zpeQpX8B653g+IuJ3SWYPZK2fu/Z8VFRfS0myGlZYeCsargq\n"
+"NhEEelC9MoS+L9xy1dcdFkfkR2YgP/SWxa+OAXqlD3pk9Q0Yh9muiNX6hME6wGko\n"
+"LfINaFGq46V3xqSQDqE3izEjR8EJCOtu93ib14L8hCCZSRm2Ekax+0VVFqmjZayc\n"
+"Bw/qa9wfLgZy7IaIEuQt218FL+TwA9MmM+eAws1CoRc0CwIDAQABo0IwQDAPBgNV\n"
+"HRMBAf8EBTADAQH/MA4GA1UdDwEB/wQEAwIBBjAdBgNVHQ4EFgQUcRVnyMjJvXVd\n"
+"ctA4GGqd83EkVAswDQYJKoZIhvcNAQELBQADggIBAHW7bVRLqhBYRjTyYtcWNl0I\n"
+"XtVsyIe9tC5G8jH4fOpCtZMWVdyhDBKg2mF+D1hYc2Ryx+hFjtyp8iY/xnmMsVMI\n"
+"M4GwVhO+5lFc2JsKT0ucVlMC6U/2DWDqTUJV6HwbISHTGzrMd/K4kPFox/la/vot\n"
+"9L/J9UUbzjgQKjeKeaO04wlshYaT/4mWJ3iBj2fjRnRUjtkNaeJK9E10A/+yd+2V\n"
+"Z5fkscWrv2oj6NSU4kQoYsRL4vDY4ilrGnB+JGGTe08DMiUNRSQrlrRGar9KC/ea\n"
+"j8GsGsVn82800vpzY4zvFrCopEYq+OsS7HK07/grfoxSwIuEVPkvPuNVqNxmsdnh\n"
+"X9izjFk0WaSrT2y7HxjbdavYy5LNlDhhDgcGH0tGEPEVvo2FXDtKK4F5D7Rpn0lQ\n"
+"l033DlZdwJVqwjbDG2jJ9SrcR5q+ss7FJej6A7na+RZukYT1HCjI/CbM1xyQVqdf\n"
+"bzoEvM14iQuODy+jqk+iGxI9FghAD/FGTNeqewjBCvVtJ94Cj8rDtSvK6evIIVM4\n"
+"pcw72Hc3MKJP2W/R8kCtQXoXxdZKNYm3QdV8hn9VTYNKpXMgwDqvkPGaJI7ZjnHK\n"
+"e7iG2rKPmT4dEw0SEe7Uq/DpFXYC5ODfqiAeW2GFZECpkJcNrVPSWh2HagCXZWK0\n"
+"vm9qp/UsQu0yrbYhnr68\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                       //   O  = Hongkong Post CN = Hongkong Post Root CA 1
+"MIIDMDCCAhigAwIBAgICA+gwDQYJKoZIhvcNAQEFBQAwRzELMAkGA1UEBhMCSEsx\n"
+"FjAUBgNVBAoTDUhvbmdrb25nIFBvc3QxIDAeBgNVBAMTF0hvbmdrb25nIFBvc3Qg\n"
+"Um9vdCBDQSAxMB4XDTAzMDUxNTA1MTMxNFoXDTIzMDUxNTA0NTIyOVowRzELMAkG\n"
+"A1UEBhMCSEsxFjAUBgNVBAoTDUhvbmdrb25nIFBvc3QxIDAeBgNVBAMTF0hvbmdr\n"
+"b25nIFBvc3QgUm9vdCBDQSAxMIIBIjANBgkqhkiG9w0BAQEFAAOCAQ8AMIIBCgKC\n"
+"AQEArP84tulmAknjorThkPlAj3n54r15/gK97iSSHSL22oVyaf7XPwnU3ZG1ApzQ\n"
+"jVrhVcNQhrkpJsLj2aDxaQMoIIBFIi1WpztUlVYiWR8o3x8gPW2iNr4joLFutbEn\n"
+"PzlTCeqrauh0ssJlXI6/fMN4hM2eFvz1Lk8gKgifd/PFHsSaUmYeSF7jEAaPIpjh\n"
+"ZY4bXSNmO7ilMlHIhqqhqZ5/dpTCpmy3QfDVyAY45tQM4vM7TG1QjMSDJ8EThFk9\n"
+"nnV0ttgCXjqQesBCNnLsak3c78QA3xMYV18meMjWCnl3v/evt3a5pQuEF10Q6m/h\n"
+"q5URX208o1xNg1vysxmKgIsLhwIDAQABoyYwJDASBgNVHRMBAf8ECDAGAQH/AgED\n"
+"MA4GA1UdDwEB/wQEAwIBxjANBgkqhkiG9w0BAQUFAAOCAQEADkbVPK7ih9legYsC\n"
+"mEEIjEy82tvuJxuC52pF7BaLT4Wg87JwvVqWuspube5Gi27nKi6Wsxkz67SfqLI3\n"
+"7piol7Yutmcn1KZJ/RyTZXaeQi/cImyaT/JaFTmxcdcrUehtHJjA2Sr0oYJ71clB\n"
+"oiMBdDhViw+5LmeiIAQ32pwL0xch4I+XeTRvhEgCIDMb5jREn5Fw9IBehEPCKdJs\n"
+"EhTkYY2sEJCehFC78JZvRZ+K88psT/oROhUVRsPNH4NbLUES7VBnQRM9IauUiqpO\n"
+"fMGx+6fWtScvl6tu4B3i0RwsH0Ti/L6RoZz71ilTc4afU9hDDl3WY4JxHYB0yvbi\n"
+"AmvZWg==\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                       //   O = Internet Security Research Group CN = ISRG Root X1
+"MIIFazCCA1OgAwIBAgIRAIIQz7DSQONZRGPgu2OCiwAwDQYJKoZIhvcNAQELBQAw\n"
+"TzELMAkGA1UEBhMCVVMxKTAnBgNVBAoTIEludGVybmV0IFNlY3VyaXR5IFJlc2Vh\n"
+"cmNoIEdyb3VwMRUwEwYDVQQDEwxJU1JHIFJvb3QgWDEwHhcNMTUwNjA0MTEwNDM4\n"
+"WhcNMzUwNjA0MTEwNDM4WjBPMQswCQYDVQQGEwJVUzEpMCcGA1UEChMgSW50ZXJu\n"
+"ZXQgU2VjdXJpdHkgUmVzZWFyY2ggR3JvdXAxFTATBgNVBAMTDElTUkcgUm9vdCBY\n"
+"MTCCAiIwDQYJKoZIhvcNAQEBBQADggIPADCCAgoCggIBAK3oJHP0FDfzm54rVygc\n"
+"h77ct984kIxuPOZXoHj3dcKi/vVqbvYATyjb3miGbESTtrFj/RQSa78f0uoxmyF+\n"
+"0TM8ukj13Xnfs7j/EvEhmkvBioZxaUpmZmyPfjxwv60pIgbz5MDmgK7iS4+3mX6U\n"
+"A5/TR5d8mUgjU+g4rk8Kb4Mu0UlXjIB0ttov0DiNewNwIRt18jA8+o+u3dpjq+sW\n"
+"T8KOEUt+zwvo/7V3LvSye0rgTBIlDHCNAymg4VMk7BPZ7hm/ELNKjD+Jo2FR3qyH\n"
+"B5T0Y3HsLuJvW5iB4YlcNHlsdu87kGJ55tukmi8mxdAQ4Q7e2RCOFvu396j3x+UC\n"
+"B5iPNgiV5+I3lg02dZ77DnKxHZu8A/lJBdiB3QW0KtZB6awBdpUKD9jf1b0SHzUv\n"
+"KBds0pjBqAlkd25HN7rOrFleaJ1/ctaJxQZBKT5ZPt0m9STJEadao0xAH0ahmbWn\n"
+"OlFuhjuefXKnEgV4We0+UXgVCwOPjdAvBbI+e0ocS3MFEvzG6uBQE3xDk3SzynTn\n"
+"jh8BCNAw1FtxNrQHusEwMFxIt4I7mKZ9YIqioymCzLq9gwQbooMDQaHWBfEbwrbw\n"
+"qHyGO0aoSCqI3Haadr8faqU9GY/rOPNk3sgrDQoo//fb4hVC1CLQJ13hef4Y53CI\n"
+"rU7m2Ys6xt0nUW7/vGT1M0NPAgMBAAGjQjBAMA4GA1UdDwEB/wQEAwIBBjAPBgNV\n"
+"HRMBAf8EBTADAQH/MB0GA1UdDgQWBBR5tFnme7bl5AFzgAiIyBpY9umbbjANBgkq\n"
+"hkiG9w0BAQsFAAOCAgEAVR9YqbyyqFDQDLHYGmkgJykIrGF1XIpu+ILlaS/V9lZL\n"
+"ubhzEFnTIZd+50xx+7LSYK05qAvqFyFWhfFQDlnrzuBZ6brJFe+GnY+EgPbk6ZGQ\n"
+"3BebYhtF8GaV0nxvwuo77x/Py9auJ/GpsMiu/X1+mvoiBOv/2X/qkSsisRcOj/KK\n"
+"NFtY2PwByVS5uCbMiogziUwthDyC3+6WVwW6LLv3xLfHTjuCvjHIInNzktHCgKQ5\n"
+"ORAzI4JMPJ+GslWYHb4phowim57iaztXOoJwTdwJx4nLCgdNbOhdjsnvzqvHu7Ur\n"
+"TkXWStAmzOVyyghqpZXjFaH3pO3JLF+l+/+sKAIuvtd7u+Nxe5AW0wdeRlN8NwdC\n"
+"jNPElpzVmbUq4JUagEiuTDkHzsxHpFKVK7q4+63SM1N95R1NbdWhscdCb+ZAJzVc\n"
+"oyi3B43njTOQ5yOf+1CceWxG1bQVs5ZufpsMljq4Ui0/1lvh+wjChP4kqKOJ2qxq\n"
+"4RgqsahDYVvTH9w7jXbyLeiNdd8XM2w9U/t7y0Ff/9yi0GE44Za4rF2LN9d11TPA\n"
+"mRGunUHBcnWEvgJBQl9nJEiU0Zsnvgc/ubhPgXRR4Xq37Z0j4r7g1SgEEzwxA57d\n"
+"emyPxgcYxn/eR44/KJ4EBs+lVDR3veyJm+kXQ99b21/+jh5Xos1AnX5iItreGCc=\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                       //   O  = IdenTrust CN = IdenTrust Commercial Root CA 1
+"MIIFYDCCA0igAwIBAgIQCgFCgAAAAUUjyES1AAAAAjANBgkqhkiG9w0BAQsFADBK\n"
+"MQswCQYDVQQGEwJVUzESMBAGA1UEChMJSWRlblRydXN0MScwJQYDVQQDEx5JZGVu\n"
+"VHJ1c3QgQ29tbWVyY2lhbCBSb290IENBIDEwHhcNMTQwMTE2MTgxMjIzWhcNMzQw\n"
+"MTE2MTgxMjIzWjBKMQswCQYDVQQGEwJVUzESMBAGA1UEChMJSWRlblRydXN0MScw\n"
+"JQYDVQQDEx5JZGVuVHJ1c3QgQ29tbWVyY2lhbCBSb290IENBIDEwggIiMA0GCSqG\n"
+"SIb3DQEBAQUAA4ICDwAwggIKAoICAQCnUBneP5k91DNG8W9RYYKyqU+PZ4ldhNlT\n"
+"3Qwo2dfw/66VQ3KZ+bVdfIrBQuExUHTRgQ18zZshq0PirK1ehm7zCYofWjK9ouuU\n"
+"+ehcCuz/mNKvcbO0U59Oh++SvL3sTzIwiEsXXlfEU8L2ApeN2WIrvyQfYo3fw7gp\n"
+"S0l4PJNgiCL8mdo2yMKi1CxUAGc1bnO/AljwpN3lsKImesrgNqUZFvX9t++uP0D1\n"
+"bVoE/c40yiTcdCMbXTMTEl3EASX2MN0CXZ/g1Ue9tOsbobtJSdifWwLziuQkkORi\n"
+"T0/Br4sOdBeo0XKIanoBScy0RnnGF7HamB4HWfp1IYVl3ZBWzvurpWCdxJ35UrCL\n"
+"vYf5jysjCiN2O/cz4ckA82n5S6LgTrx+kzmEB/dEcH7+B1rlsazRGMzyNeVJSQjK\n"
+"Vsk9+w8YfYs7wRPCTY/JTw436R+hDmrfYi7LNQZReSzIJTj0+kuniVyc0uMNOYZK\n"
+"dHzVWYfCP04MXFL0PfdSgvHqo6z9STQaKPNBiDoT7uje/5kdX7rL6B7yuVBgwDHT\n"
+"c+XvvqDtMwt0viAgxGds8AgDelWAf0ZOlqf0Hj7h9tgJ4TNkK2PXMl6f+cB7D3hv\n"
+"l7yTmvmcEpB4eoCHFddydJxVdHixuuFucAS6T6C6aMN7/zHwcz09lCqxC0EOoP5N\n"
+"iGVreTO01wIDAQABo0IwQDAOBgNVHQ8BAf8EBAMCAQYwDwYDVR0TAQH/BAUwAwEB\n"
+"/zAdBgNVHQ4EFgQU7UQZwNPwBovupHu+QucmVMiONnYwDQYJKoZIhvcNAQELBQAD\n"
+"ggIBAA2ukDL2pkt8RHYZYR4nKM1eVO8lvOMIkPkp165oCOGUAFjvLi5+U1KMtlwH\n"
+"6oi6mYtQlNeCgN9hCQCTrQ0U5s7B8jeUeLBfnLOic7iPBZM4zY0+sLj7wM+x8uwt\n"
+"LRvM7Kqas6pgghstO8OEPVeKlh6cdbjTMM1gCIOQ045U8U1mwF10A0Cj7oV+wh93\n"
+"nAbowacYXVKV7cndJZ5t+qntozo00Fl72u1Q8zW/7esUTTHHYPTa8Yec4kjixsU3\n"
+"+wYQ+nVZZjFHKdp2mhzpgq7vmrlR94gjmmmVYjzlVYA211QC//G5Xc7UI2/YRYRK\n"
+"W2XviQzdFKcgyxilJbQN+QHwotL0AMh0jqEqSI5l2xPE4iUXfeu+h1sXIFRRk0pT\n"
+"AwvsXcoz7WL9RccvW9xYoIA55vrX/hMUpu09lEpCdNTDd1lzzY9GvlU47/rokTLq\n"
+"l1gEIt44w8y8bckzOmoKaT+gyOpyj4xjhiO9bTyWnpXgSUyqorkqG5w2gXjtw+hG\n"
+"4iZZRHUe2XWJUc0QhJ1hYMtd+ZciTY6Y5uN/9lu7rs3KSoFrXgvzUeF0K+l+J6fZ\n"
+"mUlO+KWA2yUPHGNiiskzZ2s8EIPGrd6ozRaOjfAHN3Gf8qv8QfXBi+wAN10J5U6A\n"
+"7/qxXDgGpRtK4dw4LTzcqx+QGtVKnO7RcGzM7vRX+Bi6hG6H\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                       //   O  = IdenTrust CN = IdenTrust Public Sector Root CA 1
+"MIIFZjCCA06gAwIBAgIQCgFCgAAAAUUjz0Z8AAAAAjANBgkqhkiG9w0BAQsFADBN\n"
+"MQswCQYDVQQGEwJVUzESMBAGA1UEChMJSWRlblRydXN0MSowKAYDVQQDEyFJZGVu\n"
+"VHJ1c3QgUHVibGljIFNlY3RvciBSb290IENBIDEwHhcNMTQwMTE2MTc1MzMyWhcN\n"
+"MzQwMTE2MTc1MzMyWjBNMQswCQYDVQQGEwJVUzESMBAGA1UEChMJSWRlblRydXN0\n"
+"MSowKAYDVQQDEyFJZGVuVHJ1c3QgUHVibGljIFNlY3RvciBSb290IENBIDEwggIi\n"
+"MA0GCSqGSIb3DQEBAQUAA4ICDwAwggIKAoICAQC2IpT8pEiv6EdrCvsnduTyP4o7\n"
+"ekosMSqMjbCpwzFrqHd2hCa2rIFCDQjrVVi7evi8ZX3yoG2LqEfpYnYeEe4IFNGy\n"
+"RBb06tD6Hi9e28tzQa68ALBKK0CyrOE7S8ItneShm+waOh7wCLPQ5CQ1B5+ctMlS\n"
+"bdsHyo+1W/CD80/HLaXIrcuVIKQxKFdYWuSNG5qrng0M8gozOSI5Cpcu81N3uURF\n"
+"/YTLNiCBWS2ab21ISGHKTN9T0a9SvESfqy9rg3LvdYDaBjMbXcjaY8ZNzaxmMc3R\n"
+"3j6HEDbhuaR672BQssvKplbgN6+rNBM5Jeg5ZuSYeqoSmJxZZoY+rfGwyj4GD3vw\n"
+"EUs3oERte8uojHH01bWRNszwFcYr3lEXsZdMUD2xlVl8BX0tIdUAvwFnol57plzy\n"
+"9yLxkA2T26pEUWbMfXYD62qoKjgZl3YNa4ph+bz27nb9cCvdKTz4Ch5bQhyLVi9V\n"
+"GxyhLrXHFub4qjySjmm2AcG1hp2JDws4lFTo6tyePSW8Uybt1as5qsVATFSrsrTZ\n"
+"2fjXctscvG29ZV/viDUqZi/u9rNl8DONfJhBaUYPQxxp+pu10GFqzcpL2UyQRqsV\n"
+"WaFHVCkugyhfHMKiq3IXAAaOReyL4jM9f9oZRORicsPfIsbyVtTdX5Vy7W1f90gD\n"
+"W/3FKqD2cyOEEBsB5wIDAQABo0IwQDAOBgNVHQ8BAf8EBAMCAQYwDwYDVR0TAQH/\n"
+"BAUwAwEB/zAdBgNVHQ4EFgQU43HgntinQtnbcZFrlJPrw6PRFKMwDQYJKoZIhvcN\n"
+"AQELBQADggIBAEf63QqwEZE4rU1d9+UOl1QZgkiHVIyqZJnYWv6IAcVYpZmxI1Qj\n"
+"t2odIFflAWJBF9MJ23XLblSQdf4an4EKwt3X9wnQW3IV5B4Jaj0z8yGa5hV+rVHV\n"
+"DRDtfULAj+7AmgjVQdZcDiFpboBhDhXAuM/FSRJSzL46zNQuOAXeNf0fb7iAaJg9\n"
+"TaDKQGXSc3z1i9kKlT/YPyNtGtEqJBnZhbMX73huqVjRI9PHE+1yJX9dsXNw0H8G\n"
+"lwmEKYBhHfpe/3OsoOOJuBxxFcbeMX8S3OFtm6/n6J91eEyrRjuazr8FGF1NFTwW\n"
+"mhlQBJqymm9li1JfPFgEKCXAZmExfrngdbkaqIHWchezxQMxNRF4eKLg6TCMf4Df\n"
+"WN88uieW4oA0beOY02QnrEh+KHdcxiVhJfiFDGX6xDIvpZgF5PgLZxYWxoK4Mhn5\n"
+"+bl53B/N66+rDt0b20XkeucC4pVd/GnwU2lhlXV5C15V5jgclKlZM57IcXR5f1GJ\n"
+"tshquDDIajjDbp7hNxbqBWJMWxJH7ae0s1hWx0nzfxJoCTFx8G34Tkf71oXuxVhA\n"
+"GaQdp/lLQzfcaFpPz+vCZHTetBXZ9FRUGi8c15dxVJCO2SCdUyt/q4/i6jC8UDfv\n"
+"8Ue1fXwsBOxonbRJRBD0ckscZOf85muQ3Wl9af0AVqW3rLatt8o+Ae+c\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                       //   O  = IZENPE S.A. CN = Izenpe.com
+"MIIF8TCCA9mgAwIBAgIQALC3WhZIX7/hy/WL1xnmfTANBgkqhkiG9w0BAQsFADA4\n"
+"MQswCQYDVQQGEwJFUzEUMBIGA1UECgwLSVpFTlBFIFMuQS4xEzARBgNVBAMMCkl6\n"
+"ZW5wZS5jb20wHhcNMDcxMjEzMTMwODI4WhcNMzcxMjEzMDgyNzI1WjA4MQswCQYD\n"
+"VQQGEwJFUzEUMBIGA1UECgwLSVpFTlBFIFMuQS4xEzARBgNVBAMMCkl6ZW5wZS5j\n"
+"b20wggIiMA0GCSqGSIb3DQEBAQUAA4ICDwAwggIKAoICAQDJ03rKDx6sp4boFmVq\n"
+"scIbRTJxldn+EFvMr+eleQGPicPK8lVx93e+d5TzcqQsRNiekpsUOqHnJJAKClaO\n"
+"xdgmlOHZSOEtPtoKct2jmRXagaKH9HtuJneJWK3W6wyyQXpzbm3benhB6QiIEn6H\n"
+"LmYRY2xU+zydcsC8Lv/Ct90NduM61/e0aL6i9eOBbsFGb12N4E3GVFWJGjMxCrFX\n"
+"uaOKmMPsOzTFlUFpfnXCPCDFYbpRR6AgkJOhkEvzTnyFRVSa0QUmQbC1TR0zvsQD\n"
+"yCV8wXDbO/QJLVQnSKwv4cSsPsjLkkxTOTcj7NMB+eAJRE1NZMDhDVqHIrytG6P+\n"
+"JrUV86f8hBnp7KGItERphIPzidF0BqnMC9bC3ieFUCbKF7jJeodWLBoBHmy+E60Q\n"
+"rLUk9TiRodZL2vG70t5HtfG8gfZZa88ZU+mNFctKy6lvROUbQc/hhqfK0GqfvEyN\n"
+"BjNaooXlkDWgYlwWTvDjovoDGrQscbNYLN57C9saD+veIR8GdwYDsMnvmfzAuU8L\n"
+"hij+0rnq49qlw0dpEuDb8PYZi+17cNcC1u2HGCgsBCRMd+RIihrGO5rUD8r6ddIB\n"
+"QFqNeb+Lz0vPqhbBleStTIo+F5HUsWLlguWABKQDfo2/2n+iD5dPDNMN+9fR5XJ+\n"
+"HMh3/1uaD7euBUbl8agW7EekFwIDAQABo4H2MIHzMIGwBgNVHREEgagwgaWBD2lu\n"
+"Zm9AaXplbnBlLmNvbaSBkTCBjjFHMEUGA1UECgw+SVpFTlBFIFMuQS4gLSBDSUYg\n"
+"QTAxMzM3MjYwLVJNZXJjLlZpdG9yaWEtR2FzdGVpeiBUMTA1NSBGNjIgUzgxQzBB\n"
+"BgNVBAkMOkF2ZGEgZGVsIE1lZGl0ZXJyYW5lbyBFdG9yYmlkZWEgMTQgLSAwMTAx\n"
+"MCBWaXRvcmlhLUdhc3RlaXowDwYDVR0TAQH/BAUwAwEB/zAOBgNVHQ8BAf8EBAMC\n"
+"AQYwHQYDVR0OBBYEFB0cZQ6o8iV7tJHP5LGx5r1VdGwFMA0GCSqGSIb3DQEBCwUA\n"
+"A4ICAQB4pgwWSp9MiDrAyw6lFn2fuUhfGI8NYjb2zRlrrKvV9pF9rnHzP7MOeIWb\n"
+"laQnIUdCSnxIOvVFfLMMjlF4rJUT3sb9fbgakEyrkgPH7UIBzg/YsfqikuFgba56\n"
+"awmqxinuaElnMIAkejEWOVt+8Rwu3WwJrfIxwYJOubv5vr8qhT/AQKM6WfxZSzwo\n"
+"JNu0FXWuDYi6LnPAvViH5ULy617uHjAimcs30cQhbIHsvm0m5hzkQiCeR7Csg1lw\n"
+"LDXWrzY0tM07+DKo7+N4ifuNRSzanLh+QBxh5z6ikixL8s36mLYp//Pye6kfLqCT\n"
+"VyvehQP5aTfLnnhqBbTFMXiJ7HqnheG5ezzevh55hM6fcA5ZwjUukCox2eRFekGk\n"
+"LhObNA5me0mrZJfQRsN5nXJQY6aYWwa9SG3YOYNw6DXwBdGqvOPbyALqfP2C2sJb\n"
+"UjWumDqtujWTI6cfSN01RpiyEGjkpTHCClguGYEQyVB1/OpaFs4R1+7vUIgtYf8/\n"
+"QnMFlEPVjjxOAToZpR9GTnfQXeWBIiGH/pR9hNiTrdZoQ0iy2+tzJOeRf1SktoA+\n"
+"naM8THLCV8Sg1Mw4J87VBp6iSNnpn86CcDaTmjvfliHjWbcM2pE38P1ZWrOZyGls\n"
+"QyYBNWNgVYkDOnXYukrZVP/u3oDYLdE41V4tC5h9Pmzb/CaIxw==\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                        //   O  = Microsec Ltd. CN = Microsec e-Szigno Root CA 2009
+"MIIECjCCAvKgAwIBAgIJAMJ+QwRORz8ZMA0GCSqGSIb3DQEBCwUAMIGCMQswCQYD\n"
+"VQQGEwJIVTERMA8GA1UEBwwIQnVkYXBlc3QxFjAUBgNVBAoMDU1pY3Jvc2VjIEx0\n"
+"ZC4xJzAlBgNVBAMMHk1pY3Jvc2VjIGUtU3ppZ25vIFJvb3QgQ0EgMjAwOTEfMB0G\n"
+"CSqGSIb3DQEJARYQaW5mb0BlLXN6aWduby5odTAeFw0wOTA2MTYxMTMwMThaFw0y\n"
+"OTEyMzAxMTMwMThaMIGCMQswCQYDVQQGEwJIVTERMA8GA1UEBwwIQnVkYXBlc3Qx\n"
+"FjAUBgNVBAoMDU1pY3Jvc2VjIEx0ZC4xJzAlBgNVBAMMHk1pY3Jvc2VjIGUtU3pp\n"
+"Z25vIFJvb3QgQ0EgMjAwOTEfMB0GCSqGSIb3DQEJARYQaW5mb0BlLXN6aWduby5o\n"
+"dTCCASIwDQYJKoZIhvcNAQEBBQADggEPADCCAQoCggEBAOn4j/NjrdqG2KfgQvvP\n"
+"kd6mJviZpWNwrZuuyjNAfW2WbqEORO7hE52UQlKavXWFdCyoDh2Tthi3jCyoz/tc\n"
+"cbna7P7ofo/kLx2yqHWH2Leh5TvPmUpG0IMZfcChEhyVbUr02MelTTMuhTlAdX4U\n"
+"fIASmFDHQWe4oIBhVKZsTh/gnQ4H6cm6M+f+wFUoLAKApxn1ntxVUwOXewdI/5n7\n"
+"N4okxFnMUBBjjqqpGrCEGob5X7uxUG6k0QrM1XF+H6cbfPVTbiJfyyvm1HxdrtbC\n"
+"xkzlBQHZ7Vf8wSN5/PrIJIOV87VqUQHQd9bpEqH5GoP7ghu5sJf0dgYzQ0mg/wu1\n"
+"+rUCAwEAAaOBgDB+MA8GA1UdEwEB/wQFMAMBAf8wDgYDVR0PAQH/BAQDAgEGMB0G\n"
+"A1UdDgQWBBTLD8bfQkPMPcu1SCOhGnqmKrs0aDAfBgNVHSMEGDAWgBTLD8bfQkPM\n"
+"Pcu1SCOhGnqmKrs0aDAbBgNVHREEFDASgRBpbmZvQGUtc3ppZ25vLmh1MA0GCSqG\n"
+"SIb3DQEBCwUAA4IBAQDJ0Q5eLtXMs3w+y/w9/w0olZMEyL/azXm4Q5DwpL7v8u8h\n"
+"mLzU1F0G9u5C7DBsoKqpyvGvivo/C3NqPuouQH4frlRheesuCDfXI/OMn74dseGk\n"
+"ddug4lQUsbocKaQY9hK6ohQU4zE1yED/t+AFdlfBHFny+L/k7SViXITwfn4fs775\n"
+"tyERzAMBVnCnEJIeGzSBHq2cGsMEPO0CYdYeBvNfOofyK/FFh+U9rNHHV4S9a67c\n"
+"2Pm2G2JwCz02yULyMtd6YebS2z3PyKnJm9zbWETXbzivf3jTo60adbocwTZ8jx5t\n"
+"HMN1Rq41Bab2XD0h7lbwyYIiLXpUq3DDfSJlgnCW\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                       //   O  = NetLock Kft. OU = Tanús .tványkiadók (Certification Services) CN = NetLock Arany (Class Gold) F .tanús .tvány
+"MIIEFTCCAv2gAwIBAgIGSUEs5AAQMA0GCSqGSIb3DQEBCwUAMIGnMQswCQYDVQQG\n"
+"EwJIVTERMA8GA1UEBwwIQnVkYXBlc3QxFTATBgNVBAoMDE5ldExvY2sgS2Z0LjE3\n"
+"MDUGA1UECwwuVGFuw7pzw610dsOhbnlraWFkw7NrIChDZXJ0aWZpY2F0aW9uIFNl\n"
+"cnZpY2VzKTE1MDMGA1UEAwwsTmV0TG9jayBBcmFueSAoQ2xhc3MgR29sZCkgRsWR\n"
+"dGFuw7pzw610dsOhbnkwHhcNMDgxMjExMTUwODIxWhcNMjgxMjA2MTUwODIxWjCB\n"
+"pzELMAkGA1UEBhMCSFUxETAPBgNVBAcMCEJ1ZGFwZXN0MRUwEwYDVQQKDAxOZXRM\n"
+"b2NrIEtmdC4xNzA1BgNVBAsMLlRhbsO6c8OtdHbDoW55a2lhZMOzayAoQ2VydGlm\n"
+"aWNhdGlvbiBTZXJ2aWNlcykxNTAzBgNVBAMMLE5ldExvY2sgQXJhbnkgKENsYXNz\n"
+"IEdvbGQpIEbFkXRhbsO6c8OtdHbDoW55MIIBIjANBgkqhkiG9w0BAQEFAAOCAQ8A\n"
+"MIIBCgKCAQEAxCRec75LbRTDofTjl5Bu0jBFHjzuZ9lk4BqKf8owyoPjIMHj9DrT\n"
+"lF8afFttvzBPhCf2nx9JvMaZCpDyD/V/Q4Q3Y1GLeqVw/HpYzY6b7cNGbIRwXdrz\n"
+"AZAj/E4wqX7hJ2Pn7WQ8oLjJM2P+FpD/sLj916jAwJRDC7bVWaaeVtAkH3B5r9s5\n"
+"VA1lddkVQZQBr17s9o3x/61k/iCa11zr/qYfCGSji3ZVrR47KGAuhyXoqq8fxmRG\n"
+"ILdwfzzeSNuWU7c5d+Qa4scWhHaXWy+7GRWF+GmF9ZmnqfI0p6m2pgP8b4Y9VHx2\n"
+"BJtr+UBdADTHLpl1neWIA6pN+APSQnbAGwIDAKiLo0UwQzASBgNVHRMBAf8ECDAG\n"
+"AQH/AgEEMA4GA1UdDwEB/wQEAwIBBjAdBgNVHQ4EFgQUzPpnk/C2uNClwB7zU/2M\n"
+"U9+D15YwDQYJKoZIhvcNAQELBQADggEBAKt/7hwWqZw8UQCgwBEIBaeZ5m8BiFRh\n"
+"bvG5GK1Krf6BQCOUL/t1fC8oS2IkgYIL9WHxHG64YTjrgfpioTtaYtOUZcTh5m2C\n"
+"+C8lcLIhJsFyUR+MLMOEkMNaj7rP9KdlpeuY0fsFskZ1FSNqb4VjMIDw1Z4fKRzC\n"
+"bLBQWV2QWzuoDTDPv31/zvGdg73JRm4gpvlhUbohL3u+pRVjodSVh/GeufOJ8z2F\n"
+"uLjbvrW5KfnaNwUASZQDhETnv0Mxz3WLJdH0pmT1kvarBes96aULNmLazAZfNou2\n"
+"XjG4Kvte9nHfRCaexOYNkbQudZWAUWpLMKawYqGT8ZvYzsRjdT9ZR7E=\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                       //   O  = Network Solutions L.L.C. CN = Network Solutions Certificate Authority
+"MIID5jCCAs6gAwIBAgIQV8szb8JcFuZHFhfjkDFo4DANBgkqhkiG9w0BAQUFADBi\n"
+"MQswCQYDVQQGEwJVUzEhMB8GA1UEChMYTmV0d29yayBTb2x1dGlvbnMgTC5MLkMu\n"
+"MTAwLgYDVQQDEydOZXR3b3JrIFNvbHV0aW9ucyBDZXJ0aWZpY2F0ZSBBdXRob3Jp\n"
+"dHkwHhcNMDYxMjAxMDAwMDAwWhcNMjkxMjMxMjM1OTU5WjBiMQswCQYDVQQGEwJV\n"
+"UzEhMB8GA1UEChMYTmV0d29yayBTb2x1dGlvbnMgTC5MLkMuMTAwLgYDVQQDEydO\n"
+"ZXR3b3JrIFNvbHV0aW9ucyBDZXJ0aWZpY2F0ZSBBdXRob3JpdHkwggEiMA0GCSqG\n"
+"SIb3DQEBAQUAA4IBDwAwggEKAoIBAQDkvH6SMG3G2I4rC7xGzuAnlt7e+foS0zwz\n"
+"c7MEL7xxjOWftiJgPl9dzgn/ggwbmlFQGiaJ3dVhXRncEg8tCqJDXRfQNJIg6nPP\n"
+"OCwGJgl6cvf6UDL4wpPTaaIjzkGxzOTVHzbRijr4jGPiFFlp7Q3Tf2vouAPlT2rl\n"
+"mGNpSAW+Lv8ztumXWWn4Zxmuk2GWRBXTcrA/vGp97Eh/jcOrqnErU2lBUzS1sLnF\n"
+"BgrEsEX1QV1uiUV7PTsmjHTC5dLRfbIR1PtYMiKagMnc/Qzpf14Dl847ABSHJ3A4\n"
+"qY5usyd2mFHgBeMhqxrVhSI8KbWaFsWAqPS7azCPL0YCorEMIuDTAgMBAAGjgZcw\n"
+"gZQwHQYDVR0OBBYEFCEwyfsA106Y2oeqKtCnLrFAMadMMA4GA1UdDwEB/wQEAwIB\n"
+"BjAPBgNVHRMBAf8EBTADAQH/MFIGA1UdHwRLMEkwR6BFoEOGQWh0dHA6Ly9jcmwu\n"
+"bmV0c29sc3NsLmNvbS9OZXR3b3JrU29sdXRpb25zQ2VydGlmaWNhdGVBdXRob3Jp\n"
+"dHkuY3JsMA0GCSqGSIb3DQEBBQUAA4IBAQC7rkvnt1frf6ott3NHhWrB5KUd5Oc8\n"
+"6fRZZXe1eltajSU24HqXLjjAV2CDmAaDn7l2em5Q4LqILPxFzBiwmZVRDuwduIj/\n"
+"h1AcgsLj4DKAv6ALR8jDMe+ZZzKATxcheQxpXN5eNK4CtSbqUN9/GGUsyfJj4akH\n"
+"/nxxH2szJGoeBfcFaMBqEssuXmHLrijTfsK0ZpEmXzwuJF/LWA/rKOyvEZbz3Htv\n"
+"wKeI8lN3s2Berq4o2jUsbzRF0ybh3uxbTydrFny9RAQYgrOJeRcQcT16ohZO9QHN\n"
+"pGxlaKFJdlxDydi8NmdspZS11My5vWo1ViHe2MPr+8ukYEywVaCge1ey\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                       //   O  = WISeKey OU = OISTE Foundation Endorsed CN = OISTE WISeKey Global Root GB CA
+"MIIDtTCCAp2gAwIBAgIQdrEgUnTwhYdGs/gjGvbCwDANBgkqhkiG9w0BAQsFADBt\n"
+"MQswCQYDVQQGEwJDSDEQMA4GA1UEChMHV0lTZUtleTEiMCAGA1UECxMZT0lTVEUg\n"
+"Rm91bmRhdGlvbiBFbmRvcnNlZDEoMCYGA1UEAxMfT0lTVEUgV0lTZUtleSBHbG9i\n"
+"YWwgUm9vdCBHQiBDQTAeFw0xNDEyMDExNTAwMzJaFw0zOTEyMDExNTEwMzFaMG0x\n"
+"CzAJBgNVBAYTAkNIMRAwDgYDVQQKEwdXSVNlS2V5MSIwIAYDVQQLExlPSVNURSBG\n"
+"b3VuZGF0aW9uIEVuZG9yc2VkMSgwJgYDVQQDEx9PSVNURSBXSVNlS2V5IEdsb2Jh\n"
+"bCBSb290IEdCIENBMIIBIjANBgkqhkiG9w0BAQEFAAOCAQ8AMIIBCgKCAQEA2Be3\n"
+"HEokKtaXscriHvt9OO+Y9bI5mE4nuBFde9IllIiCFSZqGzG7qFshISvYD06fWvGx\n"
+"WuR51jIjK+FTzJlFXHtPrby/h0oLS5daqPZI7H17Dc0hBt+eFf1Biki3IPShehtX\n"
+"1F1Q/7pn2COZH8g/497/b1t3sWtuuMlk9+HKQUYOKXHQuSP8yYFfTvdv37+ErXNk\n"
+"u7dCjmn21HYdfp2nuFeKUWdy19SouJVUQHMD9ur06/4oQnc/nSMbsrY9gBQHTC5P\n"
+"99UKFg29ZkM3fiNDecNAhvVMKdqOmq0NpQSHiB6F4+lT1ZvIiwNjeOvgGUpuuy9r\n"
+"M2RYk61pv48b74JIxwIDAQABo1EwTzALBgNVHQ8EBAMCAYYwDwYDVR0TAQH/BAUw\n"
+"AwEB/zAdBgNVHQ4EFgQUNQ/INmNe4qPs+TtmFc5RUuORmj0wEAYJKwYBBAGCNxUB\n"
+"BAMCAQAwDQYJKoZIhvcNAQELBQADggEBAEBM+4eymYGQfp3FsLAmzYh7KzKNbrgh\n"
+"cViXfa43FK8+5/ea4n32cZiZBKpDdHij40lhPnOMTZTg+XHEthYOU3gf1qKHLwI5\n"
+"gSk8rxWYITD+KJAAjNHhy/peyP34EEY7onhCkRd0VQreUGdNZtGn//3ZwLWoo4rO\n"
+"ZvUPQ82nK1d7Y0Zqqi5S2PTt4W2tKZB4SLrhI6qjiey1q5bAtEuiHZeeevJuQHHf\n"
+"aPFlTc58Bd9TZaml8LGXBHAVRgOY1NK/VLSgWH1Sb9pWJmLU2NuJMW8c8CLC02Ic\n"
+"Nc1MaRVUGpCY3useX8p3x8uOPUNpnJpY0CQ73xtAln41rYHHTnG6iBM=\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                       //   O  = WISeKey OU = OISTE Foundation Endorsed CN = OISTE WISeKey Global Root GC CA
+"MIICaTCCAe+gAwIBAgIQISpWDK7aDKtARb8roi066jAKBggqhkjOPQQDAzBtMQsw\n"
+"CQYDVQQGEwJDSDEQMA4GA1UEChMHV0lTZUtleTEiMCAGA1UECxMZT0lTVEUgRm91\n"
+"bmRhdGlvbiBFbmRvcnNlZDEoMCYGA1UEAxMfT0lTVEUgV0lTZUtleSBHbG9iYWwg\n"
+"Um9vdCBHQyBDQTAeFw0xNzA1MDkwOTQ4MzRaFw00MjA1MDkwOTU4MzNaMG0xCzAJ\n"
+"BgNVBAYTAkNIMRAwDgYDVQQKEwdXSVNlS2V5MSIwIAYDVQQLExlPSVNURSBGb3Vu\n"
+"ZGF0aW9uIEVuZG9yc2VkMSgwJgYDVQQDEx9PSVNURSBXSVNlS2V5IEdsb2JhbCBS\n"
+"b290IEdDIENBMHYwEAYHKoZIzj0CAQYFK4EEACIDYgAETOlQwMYPchi82PG6s4ni\n"
+"eUqjFqdrVCTbUf/q9Akkwwsin8tqJ4KBDdLArzHkdIJuyiXZjHWd8dvQmqJLIX4W\n"
+"p2OQ0jnUsYd4XxiWD1AbNTcPasbc2RNNpI6QN+a9WzGRo1QwUjAOBgNVHQ8BAf8E\n"
+"BAMCAQYwDwYDVR0TAQH/BAUwAwEB/zAdBgNVHQ4EFgQUSIcUrOPDnpBgOtfKie7T\n"
+"rYy0UGYwEAYJKwYBBAGCNxUBBAMCAQAwCgYIKoZIzj0EAwMDaAAwZQIwJsdpW9zV\n"
+"57LnyAyMjMPdeYwbY9XJUpROTYJKcx6ygISpJcBMWm1JKWB4E+J+SOtkAjEA2zQg\n"
+"Mgj/mkkCtojeFK9dbJlxjRo/i9fgojaGHAeCOnZT/cKi7e97sIBPWA9LUzm9\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                       //   O  = QuoVadis Limited OU = Root Certification Authority CN = QuoVadis Root Certification Authority
+"MIIF0DCCBLigAwIBAgIEOrZQizANBgkqhkiG9w0BAQUFADB/MQswCQYDVQQGEwJC\n"
+"TTEZMBcGA1UEChMQUXVvVmFkaXMgTGltaXRlZDElMCMGA1UECxMcUm9vdCBDZXJ0\n"
+"aWZpY2F0aW9uIEF1dGhvcml0eTEuMCwGA1UEAxMlUXVvVmFkaXMgUm9vdCBDZXJ0\n"
+"aWZpY2F0aW9uIEF1dGhvcml0eTAeFw0wMTAzMTkxODMzMzNaFw0yMTAzMTcxODMz\n"
+"MzNaMH8xCzAJBgNVBAYTAkJNMRkwFwYDVQQKExBRdW9WYWRpcyBMaW1pdGVkMSUw\n"
+"IwYDVQQLExxSb290IENlcnRpZmljYXRpb24gQXV0aG9yaXR5MS4wLAYDVQQDEyVR\n"
+"dW9WYWRpcyBSb290IENlcnRpZmljYXRpb24gQXV0aG9yaXR5MIIBIjANBgkqhkiG\n"
+"9w0BAQEFAAOCAQ8AMIIBCgKCAQEAv2G1lVO6V/z68mcLOhrfEYBklbTRvM16z/Yp\n"
+"li4kVEAkOPcahdxYTMukJ0KX0J+DisPkBgNbAKVRHnAEdOLB1Dqr1607BxgFjv2D\n"
+"rOpm2RgbaIr1VxqYuvXtdj182d6UajtLF8HVj71lODqV0D1VNk7feVcxKh7YWWVJ\n"
+"WCCYfqtffp/p1k3sg3Spx2zY7ilKhSoGFPlU5tPaZQeLYzcS19Dsw3sgQUSj7cug\n"
+"F+FxZc4dZjH3dgEZyH0DWLaVSR2mEiboxgx24ONmy+pdpibu5cxfvWenAScOospU\n"
+"xbF6lR1xHkopigPcakXBpBlebzbNw6Kwt/5cOOJSvPhEQ+aQuwIDAQABo4ICUjCC\n"
+"Ak4wPQYIKwYBBQUHAQEEMTAvMC0GCCsGAQUFBzABhiFodHRwczovL29jc3AucXVv\n"
+"dmFkaXNvZmZzaG9yZS5jb20wDwYDVR0TAQH/BAUwAwEB/zCCARoGA1UdIASCAREw\n"
+"ggENMIIBCQYJKwYBBAG+WAABMIH7MIHUBggrBgEFBQcCAjCBxxqBxFJlbGlhbmNl\n"
+"IG9uIHRoZSBRdW9WYWRpcyBSb290IENlcnRpZmljYXRlIGJ5IGFueSBwYXJ0eSBh\n"
+"c3N1bWVzIGFjY2VwdGFuY2Ugb2YgdGhlIHRoZW4gYXBwbGljYWJsZSBzdGFuZGFy\n"
+"ZCB0ZXJtcyBhbmQgY29uZGl0aW9ucyBvZiB1c2UsIGNlcnRpZmljYXRpb24gcHJh\n"
+"Y3RpY2VzLCBhbmQgdGhlIFF1b1ZhZGlzIENlcnRpZmljYXRlIFBvbGljeS4wIgYI\n"
+"KwYBBQUHAgEWFmh0dHA6Ly93d3cucXVvdmFkaXMuYm0wHQYDVR0OBBYEFItLbe3T\n"
+"KbkGGew5Oanwl4Rqy+/fMIGuBgNVHSMEgaYwgaOAFItLbe3TKbkGGew5Oanwl4Rq\n"
+"y+/foYGEpIGBMH8xCzAJBgNVBAYTAkJNMRkwFwYDVQQKExBRdW9WYWRpcyBMaW1p\n"
+"dGVkMSUwIwYDVQQLExxSb290IENlcnRpZmljYXRpb24gQXV0aG9yaXR5MS4wLAYD\n"
+"VQQDEyVRdW9WYWRpcyBSb290IENlcnRpZmljYXRpb24gQXV0aG9yaXR5ggQ6tlCL\n"
+"MA4GA1UdDwEB/wQEAwIBBjANBgkqhkiG9w0BAQUFAAOCAQEAitQUtf70mpKnGdSk\n"
+"fnIYj9lofFIk3WdvOXrEql494liwTXCYhGHoG+NpGA7O+0dQoE7/8CQfvbLO9Sf8\n"
+"7C9TqnN7Az10buYWnuulLsS/VidQK2K6vkscPFVcQR0kvoIgR13VRH56FmjffU1R\n"
+"cHhXHTMe/QKZnAzNCgVPx7uOpHX6Sm2xgI4JVrmcGmD+XcHXetwReNDWXcG31a0y\n"
+"mQM6isxUJTkxgXsTIlG6Rmyhu576BGxJJnSP0nPrzDCi5upZIof4l/UO/erMkqQW\n"
+"xFIY6iHOsfHmhIHluqmGKPJDWl0Snawe2ajlCmqnf6CHKc/yiU3U7MXi5nrQNiOK\n"
+"SnQ2+Q==\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                       //   O  = QuoVadis Limited CN = QuoVadis Root CA 1 G3
+"MIIFYDCCA0igAwIBAgIUeFhfLq0sGUvjNwc1NBMotZbUZZMwDQYJKoZIhvcNAQEL\n"
+"BQAwSDELMAkGA1UEBhMCQk0xGTAXBgNVBAoTEFF1b1ZhZGlzIExpbWl0ZWQxHjAc\n"
+"BgNVBAMTFVF1b1ZhZGlzIFJvb3QgQ0EgMSBHMzAeFw0xMjAxMTIxNzI3NDRaFw00\n"
+"MjAxMTIxNzI3NDRaMEgxCzAJBgNVBAYTAkJNMRkwFwYDVQQKExBRdW9WYWRpcyBM\n"
+"aW1pdGVkMR4wHAYDVQQDExVRdW9WYWRpcyBSb290IENBIDEgRzMwggIiMA0GCSqG\n"
+"SIb3DQEBAQUAA4ICDwAwggIKAoICAQCgvlAQjunybEC0BJyFuTHK3C3kEakEPBtV\n"
+"wedYMB0ktMPvhd6MLOHBPd+C5k+tR4ds7FtJwUrVu4/sh6x/gpqG7D0DmVIB0jWe\n"
+"rNrwU8lmPNSsAgHaJNM7qAJGr6Qc4/hzWHa39g6QDbXwz8z6+cZM5cOGMAqNF341\n"
+"68Xfuw6cwI2H44g4hWf6Pser4BOcBRiYz5P1sZK0/CPTz9XEJ0ngnjybCKOLXSoh\n"
+"4Pw5qlPafX7PGglTvF0FBM+hSo+LdoINofjSxxR3W5A2B4GbPgb6Ul5jxaYA/qXp\n"
+"UhtStZI5cgMJYr2wYBZupt0lwgNm3fME0UDiTouG9G/lg6AnhF4EwfWQvTA9xO+o\n"
+"abw4m6SkltFi2mnAAZauy8RRNOoMqv8hjlmPSlzkYZqn0ukqeI1RPToV7qJZjqlc\n"
+"3sX5kCLliEVx3ZGZbHqfPT2YfF72vhZooF6uCyP8Wg+qInYtyaEQHeTTRCOQiJ/G\n"
+"KubX9ZqzWB4vMIkIG1SitZgj7Ah3HJVdYdHLiZxfokqRmu8hqkkWCKi9YSgxyXSt\n"
+"hfbZxbGL0eUQMk1fiyA6PEkfM4VZDdvLCXVDaXP7a3F98N/ETH3Goy7IlXnLc6KO\n"
+"Tk0k+17kBL5yG6YnLUlamXrXXAkgt3+UuU/xDRxeiEIbEbfnkduebPRq34wGmAOt\n"
+"zCjvpUfzUwIDAQABo0IwQDAPBgNVHRMBAf8EBTADAQH/MA4GA1UdDwEB/wQEAwIB\n"
+"BjAdBgNVHQ4EFgQUo5fW816iEOGrRZ88F2Q87gFwnMwwDQYJKoZIhvcNAQELBQAD\n"
+"ggIBABj6W3X8PnrHX3fHyt/PX8MSxEBd1DKquGrX1RUVRpgjpeaQWxiZTOOtQqOC\n"
+"MTaIzen7xASWSIsBx40Bz1szBpZGZnQdT+3Btrm0DWHMY37XLneMlhwqI2hrhVd2\n"
+"cDMT/uFPpiN3GPoajOi9ZcnPP/TJF9zrx7zABC4tRi9pZsMbj/7sPtPKlL92CiUN\n"
+"qXsCHKnQO18LwIE6PWThv6ctTr1NxNgpxiIY0MWscgKCP6o6ojoilzHdCGPDdRS5\n"
+"YCgtW2jgFqlmgiNR9etT2DGbe+m3nUvriBbP+V04ikkwj+3x6xn0dxoxGE1nVGwv\n"
+"b2X52z3sIexe9PSLymBlVNFxZPT5pqOBMzYzcfCkeF9OrYMh3jRJjehZrJ3ydlo2\n"
+"8hP0r+AJx2EqbPfgna67hkooby7utHnNkDPDs3b69fBsnQGQ+p6Q9pxyz0fawx/k\n"
+"NSBT8lTR32GDpgLiJTjehTItXnOQUl1CxM49S+H5GYQd1aJQzEH7QRTDvdbJWqNj\n"
+"ZgKAvQU6O0ec7AAmTPWIUb+oI38YB7AL7YsmoWTTYUrrXJ/es69nA7Mf3W1daWhp\n"
+"q1467HxpvMc7hU6eFbm0FU/DlXpY18ls6Wy58yljXrQs8C097Vpl4KlbQMJImYFt\n"
+"nh8GKjwStIsPm6Ik8KaN1nrgS7ZklmOVhMJKzRwuJIczYOXD\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                       //   O  = QuoVadis Limited CN = QuoVadis Root CA 2
+"MIIFtzCCA5+gAwIBAgICBQkwDQYJKoZIhvcNAQEFBQAwRTELMAkGA1UEBhMCQk0x\n"
+"GTAXBgNVBAoTEFF1b1ZhZGlzIExpbWl0ZWQxGzAZBgNVBAMTElF1b1ZhZGlzIFJv\n"
+"b3QgQ0EgMjAeFw0wNjExMjQxODI3MDBaFw0zMTExMjQxODIzMzNaMEUxCzAJBgNV\n"
+"BAYTAkJNMRkwFwYDVQQKExBRdW9WYWRpcyBMaW1pdGVkMRswGQYDVQQDExJRdW9W\n"
+"YWRpcyBSb290IENBIDIwggIiMA0GCSqGSIb3DQEBAQUAA4ICDwAwggIKAoICAQCa\n"
+"GMpLlA0ALa8DKYrwD4HIrkwZhR0In6spRIXzL4GtMh6QRr+jhiYaHv5+HBg6XJxg\n"
+"Fyo6dIMzMH1hVBHL7avg5tKifvVrbxi3Cgst/ek+7wrGsxDp3MJGF/hd/aTa/55J\n"
+"WpzmM+Yklvc/ulsrHHo1wtZn/qtmUIttKGAr79dgw8eTvI02kfN/+NsRE8Scd3bB\n"
+"rrcCaoF6qUWD4gXmuVbBlDePSHFjIuwXZQeVikvfj8ZaCuWw419eaxGrDPmF60Tp\n"
+"+ARz8un+XJiM9XOva7R+zdRcAitMOeGylZUtQofX1bOQQ7dsE/He3fbE+Ik/0XX1\n"
+"ksOR1YqI0JDs3G3eicJlcZaLDQP9nL9bFqyS2+r+eXyt66/3FsvbzSUr5R/7mp/i\n"
+"Ucw6UwxI5g69ybR2BlLmEROFcmMDBOAENisgGQLodKcftslWZvB1JdxnwQ5hYIiz\n"
+"PtGo/KPaHbDRsSNU30R2be1B2MGyIrZTHN81Hdyhdyox5C315eXbyOD/5YDXC2Og\n"
+"/zOhD7osFRXql7PSorW+8oyWHhqPHWykYTe5hnMz15eWniN9gqRMgeKh0bpnX5UH\n"
+"oycR7hYQe7xFSkyyBNKr79X9DFHOUGoIMfmR2gyPZFwDwzqLID9ujWc9Otb+fVuI\n"
+"yV77zGHcizN300QyNQliBJIWENieJ0f7OyHj+OsdWwIDAQABo4GwMIGtMA8GA1Ud\n"
+"EwEB/wQFMAMBAf8wCwYDVR0PBAQDAgEGMB0GA1UdDgQWBBQahGK8SEwzJQTU7tD2\n"
+"A8QZRtGUazBuBgNVHSMEZzBlgBQahGK8SEwzJQTU7tD2A8QZRtGUa6FJpEcwRTEL\n"
+"MAkGA1UEBhMCQk0xGTAXBgNVBAoTEFF1b1ZhZGlzIExpbWl0ZWQxGzAZBgNVBAMT\n"
+"ElF1b1ZhZGlzIFJvb3QgQ0EgMoICBQkwDQYJKoZIhvcNAQEFBQADggIBAD4KFk2f\n"
+"BluornFdLwUvZ+YTRYPENvbzwCYMDbVHZF34tHLJRqUDGCdViXh9duqWNIAXINzn\n"
+"g/iN/Ae42l9NLmeyhP3ZRPx3UIHmfLTJDQtyU/h2BwdBR5YM++CCJpNVjP4iH2Bl\n"
+"fF/nJrP3MpCYUNQ3cVX2kiF495V5+vgtJodmVjB3pjd4M1IQWK4/YY7yarHvGH5K\n"
+"WWPKjaJW1acvvFYfzznB4vsKqBUsfU16Y8Zsl0Q80m/DShcK+JDSV6IZUaUtl0Ha\n"
+"B0+pUNqQjZRG4T7wlP0QADj1O+hA4bRuVhogzG9Yje0uRY/W6ZM/57Es3zrWIozc\n"
+"hLsib9D45MY56QSIPMO661V6bYCZJPVsAfv4l7CUW+v90m/xd2gNNWQjrLhVoQPR\n"
+"TUIZ3Ph1WVaj+ahJefivDrkRoHy3au000LYmYjgahwz46P0u05B/B5EqHdZ+XIWD\n"
+"mbA4CD/pXvk1B+TJYm5Xf6dQlfe6yJvmjqIBxdZmv3lh8zwc4bmCXF2gw+nYSL0Z\n"
+"ohEUGW6yhhtoPkg3Goi3XZZenMfvJ2II4pEZXNLxId26F0KCl3GBUzGpn/Z9Yr9y\n"
+"4aOTHcyKJloJONDO1w2AFrR4pTqHTI2KpdVGl/IsELm8VCLAAVBpQ570su9t+Oza\n"
+"8eOx79+Rj1QqCyXBJhnEUhAFZdWCEOrCMc0u\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                       //   O = QuoVadis Limited CN = QuoVadis Root CA 2 G3
+"MIIFYDCCA0igAwIBAgIURFc0JFuBiZs18s64KztbpybwdSgwDQYJKoZIhvcNAQEL\n"
+"BQAwSDELMAkGA1UEBhMCQk0xGTAXBgNVBAoTEFF1b1ZhZGlzIExpbWl0ZWQxHjAc\n"
+"BgNVBAMTFVF1b1ZhZGlzIFJvb3QgQ0EgMiBHMzAeFw0xMjAxMTIxODU5MzJaFw00\n"
+"MjAxMTIxODU5MzJaMEgxCzAJBgNVBAYTAkJNMRkwFwYDVQQKExBRdW9WYWRpcyBM\n"
+"aW1pdGVkMR4wHAYDVQQDExVRdW9WYWRpcyBSb290IENBIDIgRzMwggIiMA0GCSqG\n"
+"SIb3DQEBAQUAA4ICDwAwggIKAoICAQChriWyARjcV4g/Ruv5r+LrI3HimtFhZiFf\n"
+"qq8nUeVuGxbULX1QsFN3vXg6YOJkApt8hpvWGo6t/x8Vf9WVHhLL5hSEBMHfNrMW\n"
+"n4rjyduYNM7YMxcoRvynyfDStNVNCXJJ+fKH46nafaF9a7I6JaltUkSs+L5u+9ym\n"
+"c5GQYaYDFCDy54ejiK2toIz/pgslUiXnFgHVy7g1gQyjO/Dh4fxaXc6AcW34Sas+\n"
+"O7q414AB+6XrW7PFXmAqMaCvN+ggOp+oMiwMzAkd056OXbxMmO7FGmh77FOm6RQ1\n"
+"o9/NgJ8MSPsc9PG/Srj61YxxSscfrf5BmrODXfKEVu+lV0POKa2Mq1W/xPtbAd0j\n"
+"IaFYAI7D0GoT7RPjEiuA3GfmlbLNHiJuKvhB1PLKFAeNilUSxmn1uIZoL1NesNKq\n"
+"IcGY5jDjZ1XHm26sGahVpkUG0CM62+tlXSoREfA7T8pt9DTEceT/AFr2XK4jYIVz\n"
+"8eQQsSWu1ZK7E8EM4DnatDlXtas1qnIhO4M15zHfeiFuuDIIfR0ykRVKYnLP43eh\n"
+"vNURG3YBZwjgQQvD6xVu+KQZ2aKrr+InUlYrAoosFCT5v0ICvybIxo/gbjh9Uy3l\n"
+"7ZizlWNof/k19N+IxWA1ksB8aRxhlRbQ694Lrz4EEEVlWFA4r0jyWbYW8jwNkALG\n"
+"cC4BrTwV1wIDAQABo0IwQDAPBgNVHRMBAf8EBTADAQH/MA4GA1UdDwEB/wQEAwIB\n"
+"BjAdBgNVHQ4EFgQU7edvdlq/YOxJW8ald7tyFnGbxD0wDQYJKoZIhvcNAQELBQAD\n"
+"ggIBAJHfgD9DCX5xwvfrs4iP4VGyvD11+ShdyLyZm3tdquXK4Qr36LLTn91nMX66\n"
+"AarHakE7kNQIXLJgapDwyM4DYvmL7ftuKtwGTTwpD4kWilhMSA/ohGHqPHKmd+RC\n"
+"roijQ1h5fq7KpVMNqT1wvSAZYaRsOPxDMuHBR//47PERIjKWnML2W2mWeyAMQ0Ga\n"
+"W/ZZGYjeVYg3UQt4XAoeo0L9x52ID8DyeAIkVJOviYeIyUqAHerQbj5hLja7NQ4n\n"
+"lv1mNDthcnPxFlxHBlRJAHpYErAK74X9sbgzdWqTHBLmYF5vHX/JHyPLhGGfHoJE\n"
+"+V+tYlUkmlKY7VHnoX6XOuYvHxHaU4AshZ6rNRDbIl9qxV6XU/IyAgkwo1jwDQHV\n"
+"csaxfGl7w/U2Rcxhbl5MlMVerugOXou/983g7aEOGzPuVBj+D77vfoRrQ+NwmNtd\n"
+"dbINWQeFFSM51vHfqSYP1kjHs6Yi9TM3WpVHn3u6GBVv/9YUZINJ0gpnIdsPNWNg\n"
+"KCLjsZWDzYWm3S8P52dSbrsvhXz1SnPnxT7AvSESBT/8twNJAlvIJebiVDj1eYeM\n"
+"HVOyToV7BjjHLPj4sHKNJeV3UvQDHEimUF+IIDBu8oJDqz2XhOdT+yHBTw8imoa4\n"
+"WSr2Rz0ZiC3oheGe7IUIarFsNMkd7EgrO3jtZsSOeWmD3n+M\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                       //   O  = QuoVadis Limited CN = QuoVadis Root CA 3
+"MIIGnTCCBIWgAwIBAgICBcYwDQYJKoZIhvcNAQEFBQAwRTELMAkGA1UEBhMCQk0x\n"
+"GTAXBgNVBAoTEFF1b1ZhZGlzIExpbWl0ZWQxGzAZBgNVBAMTElF1b1ZhZGlzIFJv\n"
+"b3QgQ0EgMzAeFw0wNjExMjQxOTExMjNaFw0zMTExMjQxOTA2NDRaMEUxCzAJBgNV\n"
+"BAYTAkJNMRkwFwYDVQQKExBRdW9WYWRpcyBMaW1pdGVkMRswGQYDVQQDExJRdW9W\n"
+"YWRpcyBSb290IENBIDMwggIiMA0GCSqGSIb3DQEBAQUAA4ICDwAwggIKAoICAQDM\n"
+"V0IWVJzmmNPTTe7+7cefQzlKZbPoFog02w1ZkXTPkrgEQK0CSzGrvI2RaNggDhoB\n"
+"4hp7Thdd4oq3P5kazethq8Jlph+3t723j/z9cI8LoGe+AaJZz3HmDyl2/7FWeUUr\n"
+"H556VOijKTVopAFPD6QuN+8bv+OPEKhyq1hX51SGyMnzW9os2l2ObjyjPtr7guXd\n"
+"8lyyBTNvijbO0BNO/79KDDRMpsMhvVAEVeuxu537RR5kFd5VAYwCdrXLoT9Cabwv\n"
+"vWhDFlaJKjdhkf2mrk7AyxRllDdLkgbvBNDInIjbC3uBr7E9KsRlOni27tyAsdLT\n"
+"mZw67mtaa7ONt9XOnMK+pUsvFrGeaDsGb659n/je7Mwpp5ijJUMv7/FfJuGITfhe\n"
+"btfZFG4ZM2mnO4SJk8RTVROhUXhA+LjJou57ulJCg54U7QVSWllWp5f8nT8KKdjc\n"
+"T5EOE7zelaTfi5m+rJsziO+1ga8bxiJTyPbH7pcUsMV8eFLI8M5ud2CEpukqdiDt\n"
+"WAEXMJPpGovgc2PZapKUSU60rUqFxKMiMPwJ7Wgic6aIDFUhWMXhOp8q3crhkODZ\n"
+"c6tsgLjoC2SToJyMGf+z0gzskSaHirOi4XCPLArlzW1oUevaPwV/izLmE1xr/l9A\n"
+"4iLItLRkT9a6fUg+qGkM17uGcclzuD87nSVL2v9A6wIDAQABo4IBlTCCAZEwDwYD\n"
+"VR0TAQH/BAUwAwEB/zCB4QYDVR0gBIHZMIHWMIHTBgkrBgEEAb5YAAMwgcUwgZMG\n"
+"CCsGAQUFBwICMIGGGoGDQW55IHVzZSBvZiB0aGlzIENlcnRpZmljYXRlIGNvbnN0\n"
+"aXR1dGVzIGFjY2VwdGFuY2Ugb2YgdGhlIFF1b1ZhZGlzIFJvb3QgQ0EgMyBDZXJ0\n"
+"aWZpY2F0ZSBQb2xpY3kgLyBDZXJ0aWZpY2F0aW9uIFByYWN0aWNlIFN0YXRlbWVu\n"
+"dC4wLQYIKwYBBQUHAgEWIWh0dHA6Ly93d3cucXVvdmFkaXNnbG9iYWwuY29tL2Nw\n"
+"czALBgNVHQ8EBAMCAQYwHQYDVR0OBBYEFPLAE+CCQz777i9nMpY1XNu4ywLQMG4G\n"
+"A1UdIwRnMGWAFPLAE+CCQz777i9nMpY1XNu4ywLQoUmkRzBFMQswCQYDVQQGEwJC\n"
+"TTEZMBcGA1UEChMQUXVvVmFkaXMgTGltaXRlZDEbMBkGA1UEAxMSUXVvVmFkaXMg\n"
+"Um9vdCBDQSAzggIFxjANBgkqhkiG9w0BAQUFAAOCAgEAT62gLEz6wPJv92ZVqyM0\n"
+"7ucp2sNbtrCD2dDQ4iH782CnO11gUyeim/YIIirnv6By5ZwkajGxkHon24QRiSem\n"
+"d1o417+shvzuXYO8BsbRd2sPbSQvS3pspweWyuOEn62Iix2rFo1bZhfZFvSLgNLd\n"
+"+LJ2w/w4E6oM3kJpK27zPOuAJ9v1pkQNn1pVWQvVDVJIxa6f8i+AxeoyUDUSly7B\n"
+"4f/xI4hROJ/yZlZ25w9Rl6VSDE1JUZU2Pb+iSwwQHYaZTKrzchGT5Or2m9qoXadN\n"
+"t54CrnMAyNojA+j56hl0YgCUyyIgvpSnWbWCar6ZeXqp8kokUvd0/bpO5qgdAm6x\n"
+"DYBEwa7TIzdfu4V8K5Iu6H6li92Z4b8nby1dqnuH/grdS/yO9SbkbnBCbjPsMZ57\n"
+"k8HkyWkaPcBrTiJt7qtYTcbQQcEr6k8Sh17rRdhs9ZgC06DYVYoGmRmioHfRMJ6s\n"
+"zHXug/WwYjnPbFfiTNKRCw51KBuav/0aQ/HKd/s7j2G4aSgWQgRecCocIdiP4b0j\n"
+"Wy10QJLZYxkNc91pvGJHvOB0K7Lrfb5BG7XARsWhIstfTsEokt4YutUqKLsRixeT\n"
+"mJlglFwjz1onl14LBQaTNx47aTbrqZ5hHY8y2o4M1nQ+ewkk2gF3R8Q7zTSMmfXK\n"
+"4SVhM7JZG+Ju1zdXtg2pEto=\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                       //  O  = QuoVadis Limited CN = QuoVadis Root CA 3 G3
+"MIIFYDCCA0igAwIBAgIULvWbAiin23r/1aOp7r0DoM8Sah0wDQYJKoZIhvcNAQEL\n"
+"BQAwSDELMAkGA1UEBhMCQk0xGTAXBgNVBAoTEFF1b1ZhZGlzIExpbWl0ZWQxHjAc\n"
+"BgNVBAMTFVF1b1ZhZGlzIFJvb3QgQ0EgMyBHMzAeFw0xMjAxMTIyMDI2MzJaFw00\n"
+"MjAxMTIyMDI2MzJaMEgxCzAJBgNVBAYTAkJNMRkwFwYDVQQKExBRdW9WYWRpcyBM\n"
+"aW1pdGVkMR4wHAYDVQQDExVRdW9WYWRpcyBSb290IENBIDMgRzMwggIiMA0GCSqG\n"
+"SIb3DQEBAQUAA4ICDwAwggIKAoICAQCzyw4QZ47qFJenMioKVjZ/aEzHs286IxSR\n"
+"/xl/pcqs7rN2nXrpixurazHb+gtTTK/FpRp5PIpM/6zfJd5O2YIyC0TeytuMrKNu\n"
+"FoM7pmRLMon7FhY4futD4tN0SsJiCnMK3UmzV9KwCoWdcTzeo8vAMvMBOSBDGzXR\n"
+"U7Ox7sWTaYI+FrUoRqHe6okJ7UO4BUaKhvVZR74bbwEhELn9qdIoyhA5CcoTNs+c\n"
+"ra1AdHkrAj80//ogaX3T7mH1urPnMNA3I4ZyYUUpSFlob3emLoG+B01vr87ERROR\n"
+"FHAGjx+f+IdpsQ7vw4kZ6+ocYfx6bIrc1gMLnia6Et3UVDmrJqMz6nWB2i3ND0/k\n"
+"A9HvFZcba5DFApCTZgIhsUfei5pKgLlVj7WiL8DWM2fafsSntARE60f75li59wzw\n"
+"eyuxwHApw0BiLTtIadwjPEjrewl5qW3aqDCYz4ByA4imW0aucnl8CAMhZa634Ryl\n"
+"sSqiMd5mBPfAdOhx3v89WcyWJhKLhZVXGqtrdQtEPREoPHtht+KPZ0/l7DxMYIBp\n"
+"VzgeAVuNVejH38DMdyM0SXV89pgR6y3e7UEuFAUCf+D+IOs15xGsIs5XPd7JMG0Q\n"
+"A4XN8f+MFrXBsj6IbGB/kE+V9/YtrQE5BwT6dYB9v0lQ7e/JxHwc64B+27bQ3RP+\n"
+"ydOc17KXqQIDAQABo0IwQDAPBgNVHRMBAf8EBTADAQH/MA4GA1UdDwEB/wQEAwIB\n"
+"BjAdBgNVHQ4EFgQUxhfQvKjqAkPyGwaZXSuQILnXnOQwDQYJKoZIhvcNAQELBQAD\n"
+"ggIBADRh2Va1EodVTd2jNTFGu6QHcrxfYWLopfsLN7E8trP6KZ1/AvWkyaiTt3px\n"
+"KGmPc+FSkNrVvjrlt3ZqVoAh313m6Tqe5T72omnHKgqwGEfcIHB9UqM+WXzBusnI\n"
+"FUBhynLWcKzSt/Ac5IYp8M7vaGPQtSCKFWGafoaYtMnCdvvMujAWzKNhxnQT5Wvv\n"
+"oxXqA/4Ti2Tk08HS6IT7SdEQTXlm66r99I0xHnAUrdzeZxNMgRVhvLfZkXdxGYFg\n"
+"u/BYpbWcC/ePIlUnwEsBbTuZDdQdm2NnL9DuDcpmvJRPpq3t/O5jrFc/ZSXPsoaP\n"
+"0Aj/uHYUbt7lJ+yreLVTubY/6CD50qi+YUbKh4yE8/nxoGibIh6BJpsQBJFxwAYf\n"
+"3KDTuVan45gtf4Od34wrnDKOMpTwATwiKp9Dwi7DmDkHOHv8XgBCH/MyJnmDhPbl\n"
+"8MFREsALHgQjDFSlTC9JxUrRtm5gDWv8a4uFJGS3iQ6rJUdbPM9+Sb3H6QrG2vd+\n"
+"DhcI00iX0HGS8A85PjRqHH3Y8iKuu2n0M7SmSFXRDw4m6Oy2Cy2nhTXN/VnIn9HN\n"
+"PlopNLk9hM6xZdRZkZFWdSHBd575euFgndOtBBj0fOtek49TSiIp+EgrPk2GrFt/\n"
+"ywaZWWDYWGWVjUTR939+J399roD1B0y2PpxxVJkES/1Y+Zj0\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                      //   O  = SSL Corporation CN = SSL.com EV Root Certification Authority ECC
+"MIIClDCCAhqgAwIBAgIILCmcWxbtBZUwCgYIKoZIzj0EAwIwfzELMAkGA1UEBhMC\n"
+"VVMxDjAMBgNVBAgMBVRleGFzMRAwDgYDVQQHDAdIb3VzdG9uMRgwFgYDVQQKDA9T\n"
+"U0wgQ29ycG9yYXRpb24xNDAyBgNVBAMMK1NTTC5jb20gRVYgUm9vdCBDZXJ0aWZp\n"
+"Y2F0aW9uIEF1dGhvcml0eSBFQ0MwHhcNMTYwMjEyMTgxNTIzWhcNNDEwMjEyMTgx\n"
+"NTIzWjB/MQswCQYDVQQGEwJVUzEOMAwGA1UECAwFVGV4YXMxEDAOBgNVBAcMB0hv\n"
+"dXN0b24xGDAWBgNVBAoMD1NTTCBDb3Jwb3JhdGlvbjE0MDIGA1UEAwwrU1NMLmNv\n"
+"bSBFViBSb290IENlcnRpZmljYXRpb24gQXV0aG9yaXR5IEVDQzB2MBAGByqGSM49\n"
+"AgEGBSuBBAAiA2IABKoSR5CYG/vvw0AHgyBO8TCCogbR8pKGYfL2IWjKAMTH6kMA\n"
+"VIbc/R/fALhBYlzccBYy3h+Z1MzFB8gIH2EWB1E9fVwHU+M1OIzfzZ/ZLg1Kthku\n"
+"WnBaBu2+8KGwytAJKaNjMGEwHQYDVR0OBBYEFFvKXuXe0oGqzagtZFG22XKbl+ZP\n"
+"MA8GA1UdEwEB/wQFMAMBAf8wHwYDVR0jBBgwFoAUW8pe5d7SgarNqC1kUbbZcpuX\n"
+"5k8wDgYDVR0PAQH/BAQDAgGGMAoGCCqGSM49BAMCA2gAMGUCMQCK5kCJN+vp1RPZ\n"
+"ytRrJPOwPYdGWBrssd9v+1a6cGvHOMzosYxPD/fxZ3YOg9AeUY8CMD32IygmTMZg\n"
+"h5Mmm7I1HrrW9zzRHM76JTymGoEVW/MSD2zuZYrJh6j5B+BimoxcSg==\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                       //   O  = SSL Corporation CN = SSL.com EV Root Certification Authority RSA R2
+"MIIF6zCCA9OgAwIBAgIIVrYpzTS8ePYwDQYJKoZIhvcNAQELBQAwgYIxCzAJBgNV\n"
+"BAYTAlVTMQ4wDAYDVQQIDAVUZXhhczEQMA4GA1UEBwwHSG91c3RvbjEYMBYGA1UE\n"
+"CgwPU1NMIENvcnBvcmF0aW9uMTcwNQYDVQQDDC5TU0wuY29tIEVWIFJvb3QgQ2Vy\n"
+"dGlmaWNhdGlvbiBBdXRob3JpdHkgUlNBIFIyMB4XDTE3MDUzMTE4MTQzN1oXDTQy\n"
+"MDUzMDE4MTQzN1owgYIxCzAJBgNVBAYTAlVTMQ4wDAYDVQQIDAVUZXhhczEQMA4G\n"
+"A1UEBwwHSG91c3RvbjEYMBYGA1UECgwPU1NMIENvcnBvcmF0aW9uMTcwNQYDVQQD\n"
+"DC5TU0wuY29tIEVWIFJvb3QgQ2VydGlmaWNhdGlvbiBBdXRob3JpdHkgUlNBIFIy\n"
+"MIICIjANBgkqhkiG9w0BAQEFAAOCAg8AMIICCgKCAgEAjzZlQOHWTcDXtOlG2mvq\n"
+"M0fNTPl9fb69LT3w23jhhqXZuglXaO1XPqDQCEGD5yhBJB/jchXQARr7XnAjssuf\n"
+"OePPxU7Gkm0mxnu7s9onnQqG6YE3Bf7wcXHswxzpY6IXFJ3vG2fThVUCAtZJycxa\n"
+"4bH3bzKfydQ7iEGonL3Lq9ttewkfokxykNorCPzPPFTOZw+oz12WGQvE43LrrdF9\n"
+"HSfvkusQv1vrO6/PgN3B0pYEW3p+pKk8OHakYo6gOV7qd89dAFmPZiw+B6KjBSYR\n"
+"aZfqhbcPlgtLyEDhULouisv3D5oi53+aNxPN8k0TayHRwMwi8qFG9kRpnMphNQcA\n"
+"b9ZhCBHqurj26bNg5U257J8UZslXWNvNh2n4ioYSA0e/ZhN2rHd9NCSFg83XqpyQ\n"
+"Gp8hLH94t2S42Oim9HizVcuE0jLEeK6jj2HdzghTreyI/BXkmg3mnxp3zkyPuBQV\n"
+"PWKchjgGAGYS5Fl2WlPAApiiECtoRHuOec4zSnaqW4EWG7WK2NAAe15itAnWhmMO\n"
+"pgWVSbooi4iTsjQc2KRVbrcc0N6ZVTsj9CLg+SlmJuwgUHfbSguPvuUCYHBBXtSu\n"
+"UDkiFCbLsjtzdFVHB3mBOagwE0TlBIqulhMlQg+5U8Sb/M3kHN48+qvWBkofZ6aY\n"
+"MBzdLNvcGJVXZsb/XItW9XcCAwEAAaNjMGEwDwYDVR0TAQH/BAUwAwEB/zAfBgNV\n"
+"HSMEGDAWgBT5YLvU49U09rj1BoAlp3PbRmmonjAdBgNVHQ4EFgQU+WC71OPVNPa4\n"
+"9QaAJadz20ZpqJ4wDgYDVR0PAQH/BAQDAgGGMA0GCSqGSIb3DQEBCwUAA4ICAQBW\n"
+"s47LCp1Jjr+kxJG7ZhcFUZh1++VQLHqe8RT6q9OKPv+RKY9ji9i0qVQBDb6Thi/5\n"
+"Sm3HXvVX+cpVHBK+Rw82xd9qt9t1wkclf7nxY/hoLVUE0fKNsKTPvDxeH3jnpaAg\n"
+"cLAExbf3cqfeIg29MyVGjGSSJuM+LmOW2puMPfgYCdcDzH2GguDKBAdRUNf/ktUM\n"
+"79qGn5nX67evaOI5JpS6aLe/g9Pqemc9YmeuJeVy6OLk7K4S9ksrPJ/psEDzOFSz\n"
+"/bdoyNrGj1E8svuR3Bznm53htw1yj+KkxKl4+esUrMZDBcJlOSgYAsOCsp0FvmXt\n"
+"ll9ldDz7CTUue5wT/RsPXcdtgTpWD8w74a8CLyKsRspGPKAcTNZEtF4uXBVmCeEm\n"
+"Kf7GUmG6sXP/wwyc5WxqlD8UykAWlYTzWamsX0xhk23RO8yilQwipmdnRC652dKK\n"
+"QbNmC1r7fSOl8hqw/96bg5Qu0T/fkreRrwU7ZcegbLHNYhLDkBvjJc40vG93drEQ\n"
+"w/cFGsDWr3RiSBd3kmmQYRzelYB0VI8YHMPzA9C/pEN1hlMYegouCRw2n5H9gooi\n"
+"S9EOUCXdywMMF8mDAAhONU2Ki+3wApRmLER/y5UnlhetCTCstnEXbosX9hwJ1C07\n"
+"mKVx01QT2WDz9UtmT/rx7iASjbSsV7FFY6GsdqnC+w==\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                       //   O  = SSL Corporation CN = SSL.com Root Certification Authority ECC
+"MIICjTCCAhSgAwIBAgIIdebfy8FoW6gwCgYIKoZIzj0EAwIwfDELMAkGA1UEBhMC\n"
+"VVMxDjAMBgNVBAgMBVRleGFzMRAwDgYDVQQHDAdIb3VzdG9uMRgwFgYDVQQKDA9T\n"
+"U0wgQ29ycG9yYXRpb24xMTAvBgNVBAMMKFNTTC5jb20gUm9vdCBDZXJ0aWZpY2F0\n"
+"aW9uIEF1dGhvcml0eSBFQ0MwHhcNMTYwMjEyMTgxNDAzWhcNNDEwMjEyMTgxNDAz\n"
+"WjB8MQswCQYDVQQGEwJVUzEOMAwGA1UECAwFVGV4YXMxEDAOBgNVBAcMB0hvdXN0\n"
+"b24xGDAWBgNVBAoMD1NTTCBDb3Jwb3JhdGlvbjExMC8GA1UEAwwoU1NMLmNvbSBS\n"
+"b290IENlcnRpZmljYXRpb24gQXV0aG9yaXR5IEVDQzB2MBAGByqGSM49AgEGBSuB\n"
+"BAAiA2IABEVuqVDEpiM2nl8ojRfLliJkP9x6jh3MCLOicSS6jkm5BBtHllirLZXI\n"
+"7Z4INcgn64mMU1jrYor+8FsPazFSY0E7ic3s7LaNGdM0B9y7xgZ/wkWV7Mt/qCPg\n"
+"CemB+vNH06NjMGEwHQYDVR0OBBYEFILRhXMw5zUE044CkvvlpNHEIejNMA8GA1Ud\n"
+"EwEB/wQFMAMBAf8wHwYDVR0jBBgwFoAUgtGFczDnNQTTjgKS++Wk0cQh6M0wDgYD\n"
+"VR0PAQH/BAQDAgGGMAoGCCqGSM49BAMCA2cAMGQCMG/n61kRpGDPYbCWe+0F+S8T\n"
+"kdzt5fxQaxFGRrMcIQBiu77D5+jNB5n5DQtdcj7EqgIwH7y6C+IwJPt8bYBVCpk+\n"
+"gA0z5Wajs6O7pdWLjwkspl1+4vAHCGht0nxpbl/f5Wpl\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                      //   O  = SSL Corporation CN = SSL.com Root Certification Authority RSA
+"MIIF3TCCA8WgAwIBAgIIeyyb0xaAMpkwDQYJKoZIhvcNAQELBQAwfDELMAkGA1UE\n"
+"BhMCVVMxDjAMBgNVBAgMBVRleGFzMRAwDgYDVQQHDAdIb3VzdG9uMRgwFgYDVQQK\n"
+"DA9TU0wgQ29ycG9yYXRpb24xMTAvBgNVBAMMKFNTTC5jb20gUm9vdCBDZXJ0aWZp\n"
+"Y2F0aW9uIEF1dGhvcml0eSBSU0EwHhcNMTYwMjEyMTczOTM5WhcNNDEwMjEyMTcz\n"
+"OTM5WjB8MQswCQYDVQQGEwJVUzEOMAwGA1UECAwFVGV4YXMxEDAOBgNVBAcMB0hv\n"
+"dXN0b24xGDAWBgNVBAoMD1NTTCBDb3Jwb3JhdGlvbjExMC8GA1UEAwwoU1NMLmNv\n"
+"bSBSb290IENlcnRpZmljYXRpb24gQXV0aG9yaXR5IFJTQTCCAiIwDQYJKoZIhvcN\n"
+"AQEBBQADggIPADCCAgoCggIBAPkP3aMrfcvQKv7sZ4Wm5y4bunfh4/WvpOz6Sl2R\n"
+"xFdHaxh3a3by/ZPkPQ/CFp4LZsNWlJ4Xg4XOVu/yFv0AYvUiCVToZRdOQbngT0aX\n"
+"qhvIuG5iXmmxX9sqAn78bMrzQdjt0Oj8P2FI7bADFB0QDksZ4LtO7IZl/zbzXmcC\n"
+"C52GVWH9ejjt/uIZALdvoVBidXQ8oPrIJZK0bnoix/geoeOy3ZExqysdBP+lSgQ3\n"
+"6YWkMyv94tZVNHwZpEpox7Ko07fKoZOI68GXvIz5HdkihCR0xwQ9aqkpk8zruFvh\n"
+"/l8lqjRYyMEjVJ0bmBHDOJx+PYZspQ9AhnwC9FwCTyjLrnGfDzrIM/4RJTXq/LrF\n"
+"YD3ZfBjVsqnTdXgDciLKOsMf7yzlLqn6niy2UUb9rwPW6mBo6oUWNmuF6R7As93E\n"
+"JNyAKoFBbZQ+yODJgUEAnl6/f8UImKIYLEJAs/lvOCdLToD0PYFH4Ih86hzOtXVc\n"
+"US4cK38acijnALXRdMbX5J+tB5O2UzU1/Dfkw/ZdFr4hc96SCvigY2q8lpJqPvi8\n"
+"ZVWb3vUNiSYE/CUapiVpy8JtynziWV+XrOvvLsi81xtZPCvM8hnIk2snYxnP/Okm\n"
+"+Mpxm3+T/jRnhE6Z6/yzeAkzcLpmpnbtG3PrGqUNxCITIJRWCk4sbE6x/c+cCbqi\n"
+"M+2HAgMBAAGjYzBhMB0GA1UdDgQWBBTdBAkHovV6fVJTEpKV7jiAJQ2mWTAPBgNV\n"
+"HRMBAf8EBTADAQH/MB8GA1UdIwQYMBaAFN0ECQei9Xp9UlMSkpXuOIAlDaZZMA4G\n"
+"A1UdDwEB/wQEAwIBhjANBgkqhkiG9w0BAQsFAAOCAgEAIBgRlCn7Jp0cHh5wYfGV\n"
+"cpNxJK1ok1iOMq8bs3AD/CUrdIWQPXhq9LmLpZc7tRiRux6n+UBbkflVma8eEdBc\n"
+"Hadm47GUBwwyOabqG7B52B2ccETjit3E+ZUfijhDPwGFpUenPUayvOUiaPd7nNgs\n"
+"PgohyC0zrL/FgZkxdMF1ccW+sfAjRfSda/wZY52jvATGGAslu1OJD7OAUN5F7kR/\n"
+"q5R4ZJjT9ijdh9hwZXT7DrkT66cPYakylszeu+1jTBi7qUD3oFRuIIhxdRjqerQ0\n"
+"cuAjJ3dctpDqhiVAq+8zD8ufgr6iIPv2tS0a5sKFsXQP+8hlAqRSAUfdSSLBv9jr\n"
+"a6x+3uxjMxW3IwiPxg+NQVrdjsW5j+VFP3jbutIbQLH+cU0/4IGiul607BXgk90I\n"
+"H37hVZkLId6Tngr75qNJvTYw/ud3sqB1l7UtgYgXZSD32pAAn8lSzDLKNXz1PQ/Y\n"
+"K9f1JmzJBjSWFupwWRoyeXkLtoh/D1JIPb9s2KJELtFOt3JY04kTlf5Eq/jXixtu\n"
+"nLwsoFvVagCvXzfh1foQC5ichucmj87w7G6KVwuA406ywKBjYZC6VWg3dGq2ktuf\n"
+"oYYitmUnDuy2n0Jg5GfCtdpBC8TTi2EbvPofkSvXRAdeuims2cXp71NIWuuA8ShY\n"
+"Ic2wBlX7Jz9TkHCpBB5XJ7k=\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                        //   O  = Krajowa Izba Rozliczeniowa S.A. CN = SZAFIR ROOT CA2
+"MIIDcjCCAlqgAwIBAgIUPopdB+xV0jLVt+O2XwHrLdzk1uQwDQYJKoZIhvcNAQEL\n"
+"BQAwUTELMAkGA1UEBhMCUEwxKDAmBgNVBAoMH0tyYWpvd2EgSXpiYSBSb3psaWN6\n"
+"ZW5pb3dhIFMuQS4xGDAWBgNVBAMMD1NaQUZJUiBST09UIENBMjAeFw0xNTEwMTkw\n"
+"NzQzMzBaFw0zNTEwMTkwNzQzMzBaMFExCzAJBgNVBAYTAlBMMSgwJgYDVQQKDB9L\n"
+"cmFqb3dhIEl6YmEgUm96bGljemVuaW93YSBTLkEuMRgwFgYDVQQDDA9TWkFGSVIg\n"
+"Uk9PVCBDQTIwggEiMA0GCSqGSIb3DQEBAQUAA4IBDwAwggEKAoIBAQC3vD5QqEvN\n"
+"QLXOYeeWyrSh2gwisPq1e3YAd4wLz32ohswmUeQgPYUM1ljj5/QqGJ3a0a4m7utT\n"
+"3PSQ1hNKDJA8w/Ta0o4NkjrcsbH/ON7Dui1fgLkCvUqdGw+0w8LBZwPd3BucPbOw\n"
+"3gAeqDRHu5rr/gsUvTaE2g0gv/pby6kWIK05YO4vdbbnl5z5Pv1+TW9NL++IDWr6\n"
+"3fE9biCloBK0TXC5ztdyO4mTp4CEHCdJckm1/zuVnsHMyAHs6A6KCpbns6aH5db5\n"
+"BSsNl0BwPLqsdVqc1U2dAgrSS5tmS0YHF2Wtn2yIANwiieDhZNRnvDF5YTy7ykHN\n"
+"XGoAyDw4jlivAgMBAAGjQjBAMA8GA1UdEwEB/wQFMAMBAf8wDgYDVR0PAQH/BAQD\n"
+"AgEGMB0GA1UdDgQWBBQuFqlKGLXLzPVvUPMjX/hd56zwyDANBgkqhkiG9w0BAQsF\n"
+"AAOCAQEAtXP4A9xZWx126aMqe5Aosk3AM0+qmrHUuOQn/6mWmc5G4G18TKI4pAZw\n"
+"8PRBEew/R40/cof5O/2kbytTAOD/OblqBw7rHRz2onKQy4I9EYKL0rufKq8h5mOG\n"
+"nXkZ7/e7DDWQw4rtTw/1zBLZpD67oPwglV9PJi8RI4NOdQcPv5vRtB3pEAT+ymCP\n"
+"oky4rc/hkA/NrgrHXXu3UNLUYfrVFdvXn4dRVOul4+vJhaAlIDf7js4MNIThPIGy\n"
+"d05DpYhfhmehPea0XGG2Ptv+tyjFogeutcrKjSoS75ftwjCkySp6+/NNIxuZMzSg\n"
+"LvWpCz/UXeHPhJ/iGcJfitYgHuNztw==\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                       //   O  = Japan Certification Services, Inc. CN = SecureSign RootCA11
+"MIIDbTCCAlWgAwIBAgIBATANBgkqhkiG9w0BAQUFADBYMQswCQYDVQQGEwJKUDEr\n"
+"MCkGA1UEChMiSmFwYW4gQ2VydGlmaWNhdGlvbiBTZXJ2aWNlcywgSW5jLjEcMBoG\n"
+"A1UEAxMTU2VjdXJlU2lnbiBSb290Q0ExMTAeFw0wOTA0MDgwNDU2NDdaFw0yOTA0\n"
+"MDgwNDU2NDdaMFgxCzAJBgNVBAYTAkpQMSswKQYDVQQKEyJKYXBhbiBDZXJ0aWZp\n"
+"Y2F0aW9uIFNlcnZpY2VzLCBJbmMuMRwwGgYDVQQDExNTZWN1cmVTaWduIFJvb3RD\n"
+"QTExMIIBIjANBgkqhkiG9w0BAQEFAAOCAQ8AMIIBCgKCAQEA/XeqpRyQBTvLTJsz\n"
+"i1oURaTnkBbR31fSIRCkF/3frNYfp+TbfPfs37gD2pRY/V1yfIw/XwFndBWW4wI8\n"
+"h9uuywGOwvNmxoVF9ALGOrVisq/6nL+k5tSAMJjzDbaTj6nU2DbysPyKyiyhFTOV\n"
+"MdrAG/LuYpmGYz+/3ZMqg6h2uRMft85OQoWPIucuGvKVCbIFtUROd6EgvanyTgp9\n"
+"UK31BQ1FT0Zx/Sg+U/sE2C3XZR1KG/rPO7AxmjVuyIsG0wCR8pQIZUyxNAYAeoni\n"
+"8McDWc/V1uinMrPmmECGxc0nEovMe863ETxiYAcjPitAbpSACW22s293bzUIUPsC\n"
+"h8U+iQIDAQABo0IwQDAdBgNVHQ4EFgQUW/hNT7KlhtQ60vFjmqC+CfZXt94wDgYD\n"
+"VR0PAQH/BAQDAgEGMA8GA1UdEwEB/wQFMAMBAf8wDQYJKoZIhvcNAQEFBQADggEB\n"
+"AKChOBZmLqdWHyGcBvod7bkixTgm2E5P7KN/ed5GIaGHd48HCJqypMWvDzKYC3xm\n"
+"KbabfSVSSUOrTC4rbnpwrxYO4wJs+0LmGJ1F2FXI6Dvd5+H0LgscNFxsWEr7jIhQ\n"
+"X5Ucv+2rIrVls4W6ng+4reV6G4pQOh29Dbx7VFALuUKvVaAYga1lme++5Jy/xIWr\n"
+"QbJUb9wlze144o4MjQlJ3WN7WmmWAiGovVJZ6X01y8hSyn+B/tlr0/cR7SXf+Of5\n"
+"pPpyl4RTDaXQMhhRdlkUbA/r7F+AjHVDg8OFmP9Mni0N5HeDk061lgeLKBObjBmN\n"
+"QSdJQO7e5iNEOdyhIta6A/I=\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                       //   O  = SecureTrust Corporation CN = SecureTrust CA
+"MIIDuDCCAqCgAwIBAgIQDPCOXAgWpa1Cf/DrJxhZ0DANBgkqhkiG9w0BAQUFADBI\n"
+"MQswCQYDVQQGEwJVUzEgMB4GA1UEChMXU2VjdXJlVHJ1c3QgQ29ycG9yYXRpb24x\n"
+"FzAVBgNVBAMTDlNlY3VyZVRydXN0IENBMB4XDTA2MTEwNzE5MzExOFoXDTI5MTIz\n"
+"MTE5NDA1NVowSDELMAkGA1UEBhMCVVMxIDAeBgNVBAoTF1NlY3VyZVRydXN0IENv\n"
+"cnBvcmF0aW9uMRcwFQYDVQQDEw5TZWN1cmVUcnVzdCBDQTCCASIwDQYJKoZIhvcN\n"
+"AQEBBQADggEPADCCAQoCggEBAKukgeWVzfX2FI7CT8rU4niVWJxB4Q2ZQCQXOZEz\n"
+"Zum+4YOvYlyJ0fwkW2Gz4BERQRwdbvC4u/jep4G6pkjGnx29vo6pQT64lO0pGtSO\n"
+"0gMdA+9tDWccV9cGrcrI9f4Or2YlSASWC12juhbDCE/RRvgUXPLIXgGZbf2IzIao\n"
+"wW8xQmxSPmjL8xk037uHGFaAJsTQ3MBv396gwpEWoGQRS0S8Hvbn+mPeZqx2pHGj\n"
+"7DaUaHp3pLHnDi+BeuK1cobvomuL8A/b01k/unK8RCSc43Oz969XL0Imnal0ugBS\n"
+"8kvNU3xHCzaFDmapCJcWNFfBZveA4+1wVMeT4C4oFVmHursCAwEAAaOBnTCBmjAT\n"
+"BgkrBgEEAYI3FAIEBh4EAEMAQTALBgNVHQ8EBAMCAYYwDwYDVR0TAQH/BAUwAwEB\n"
+"/zAdBgNVHQ4EFgQUQjK2FvoE/f5dS3rD/fdMQB1aQ68wNAYDVR0fBC0wKzApoCeg\n"
+"JYYjaHR0cDovL2NybC5zZWN1cmV0cnVzdC5jb20vU1RDQS5jcmwwEAYJKwYBBAGC\n"
+"NxUBBAMCAQAwDQYJKoZIhvcNAQEFBQADggEBADDtT0rhWDpSclu1pqNlGKa7UTt3\n"
+"6Z3q059c4EVlew3KW+JwULKUBRSuSceNQQcSc5R+DCMh/bwQf2AQWnL1mA6s7Ll/\n"
+"3XpvXdMc9P+IBWlCqQVxyLesJugutIxq/3HcuLHfmbx8IVQr5Fiiu1cprp6poxkm\n"
+"D5kuCLDv/WnPmRoJjeOnnyvJNjR7JLN4TJUXpAYmHrZkUjZfYGfZnMUFdAvnZyPS\n"
+"CPyI6a6Lf+Ew9Dd+/cYy2i2eRDAwbO4H3tI0/NL/QPZL9GZGBlSm8jIKYyYwa5vR\n"
+"3ItHuuG51WLQoqD0ZwV4KWMabwTW+MZMo5qxN7SN5ShLHZ4swrhovO0C7jE=\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                      //   O  = SecureTrust Corporation CN = Secure Global CA
+"MIIDvDCCAqSgAwIBAgIQB1YipOjUiolN9BPI8PjqpTANBgkqhkiG9w0BAQUFADBK\n"
+"MQswCQYDVQQGEwJVUzEgMB4GA1UEChMXU2VjdXJlVHJ1c3QgQ29ycG9yYXRpb24x\n"
+"GTAXBgNVBAMTEFNlY3VyZSBHbG9iYWwgQ0EwHhcNMDYxMTA3MTk0MjI4WhcNMjkx\n"
+"MjMxMTk1MjA2WjBKMQswCQYDVQQGEwJVUzEgMB4GA1UEChMXU2VjdXJlVHJ1c3Qg\n"
+"Q29ycG9yYXRpb24xGTAXBgNVBAMTEFNlY3VyZSBHbG9iYWwgQ0EwggEiMA0GCSqG\n"
+"SIb3DQEBAQUAA4IBDwAwggEKAoIBAQCvNS7YrGxVaQZx5RNoJLNP2MwhR/jxYDiJ\n"
+"iQPpvepeRlMJ3Fz1Wuj3RSoC6zFh1ykzTM7HfAo3fg+6MpjhHZevj8fcyTiW89sa\n"
+"/FHtaMbQbqR8JNGuQsiWUGMu4P51/pinX0kuleM5M2SOHqRfkNJnPLLZ/kG5VacJ\n"
+"jnIFHovdRIWCQtBJwB1g8NEXLJXr9qXBkqPFwqcIYA1gBBCWeZ4WNOaptvolRTnI\n"
+"HmX5k/Wq8VLcmZg9pYYaDDUz+kulBAYVHDGA76oYa8J719rO+TMg1fW9ajMtgQT7\n"
+"sFzUnKPiXB3jqUJ1XnvUd+85VLrJChgbEplJL4hL/VBi0XPnj3pDAgMBAAGjgZ0w\n"
+"gZowEwYJKwYBBAGCNxQCBAYeBABDAEEwCwYDVR0PBAQDAgGGMA8GA1UdEwEB/wQF\n"
+"MAMBAf8wHQYDVR0OBBYEFK9EBMJBfkiD2045AuzshHrmzsmkMDQGA1UdHwQtMCsw\n"
+"KaAnoCWGI2h0dHA6Ly9jcmwuc2VjdXJldHJ1c3QuY29tL1NHQ0EuY3JsMBAGCSsG\n"
+"AQQBgjcVAQQDAgEAMA0GCSqGSIb3DQEBBQUAA4IBAQBjGghAfaReUw132HquHw0L\n"
+"URYD7xh8yOOvaliTFGCRsoTciE6+OYo68+aCiV0BN7OrJKQVDpI1WkpEXk5X+nXO\n"
+"H0jOZvQ8QCaSmGwb7iRGDBezUqXbpZGRzzfTb+cnCDpOGR86p1hcF895P4vkp9Mm\n"
+"I50mD1hp/Ed+stCNi5O/KU9DaXR2Z0vPB4zmAve14bRDtUstFJ/53CYNv6ZHdAbY\n"
+"iNE6KTCEztI5gGIbqMdXSbxqVVFnFUq+NQfk1XWYN3kwFNspnWzFacxHVaIw98xc\n"
+"f8LDmBxrThaA63p4ZUWiABqvDA1VZDRIuJK58bRQKfJPIx/abKwfROHdI3hRW8cW\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                      //   O  = SECOM Trust Systems CO.,LTD. OU = Security Communication RootCA2
+"MIIDdzCCAl+gAwIBAgIBADANBgkqhkiG9w0BAQsFADBdMQswCQYDVQQGEwJKUDEl\n"
+"MCMGA1UEChMcU0VDT00gVHJ1c3QgU3lzdGVtcyBDTy4sTFRELjEnMCUGA1UECxMe\n"
+"U2VjdXJpdHkgQ29tbXVuaWNhdGlvbiBSb290Q0EyMB4XDTA5MDUyOTA1MDAzOVoX\n"
+"DTI5MDUyOTA1MDAzOVowXTELMAkGA1UEBhMCSlAxJTAjBgNVBAoTHFNFQ09NIFRy\n"
+"dXN0IFN5c3RlbXMgQ08uLExURC4xJzAlBgNVBAsTHlNlY3VyaXR5IENvbW11bmlj\n"
+"YXRpb24gUm9vdENBMjCCASIwDQYJKoZIhvcNAQEBBQADggEPADCCAQoCggEBANAV\n"
+"OVKxUrO6xVmCxF1SrjpDZYBLx/KWvNs2l9amZIyoXvDjChz335c9S672XewhtUGr\n"
+"zbl+dp+++T42NKA7wfYxEUV0kz1XgMX5iZnK5atq1LXaQZAQwdbWQonCv/Q4EpVM\n"
+"VAX3NuRFg3sUZdbcDE3R3n4MqzvEFb46VqZab3ZpUql6ucjrappdUtAtCms1FgkQ\n"
+"hNBqyjoGADdH5H5XTz+L62e4iKrFvlNVspHEfbmwhRkGeC7bYRr6hfVKkaHnFtWO\n"
+"ojnflLhwHyg/i/xAXmODPIMqGplrz95Zajv8bxbXH/1KEOtOghY6rCcMU/Gt1SSw\n"
+"awNQwS08Ft1ENCcadfsCAwEAAaNCMEAwHQYDVR0OBBYEFAqFqXdlBZh8QIH4D5cs\n"
+"OPEK7DzPMA4GA1UdDwEB/wQEAwIBBjAPBgNVHRMBAf8EBTADAQH/MA0GCSqGSIb3\n"
+"DQEBCwUAA4IBAQBMOqNErLlFsceTfsgLCkLfZOoc7llsCLqJX2rKSpWeeo8HxdpF\n"
+"coJxDjrSzG+ntKEju/Ykn8sX/oymzsLS28yN/HH8AynBbF0zX2S2ZTuJbxh2ePXc\n"
+"okgfGT+Ok+vx+hfuzU7jBBJV1uXk3fs+BXziHV7Gp7yXT2g69ekuCkO2r1dcYmh8\n"
+"t/2jioSgrGK+KwmHNPBqAbubKVY8/gA3zyNs8U6qtnRGEmyR7jTV7JqR50S+kDFy\n"
+"1UkC9gLl9B/rfNmWVan/7Ir5mUf/NVoCqgTLiluHcSmRvaS0eg29mvVXIwAHIRc/\n"
+"SjnRBUkLp7Y3gaVdjKozXoEofKd9J+sAro03\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                      //   O  = SECOM Trust.net OU = Security Communication RootCA1
+"MIIDWjCCAkKgAwIBAgIBADANBgkqhkiG9w0BAQUFADBQMQswCQYDVQQGEwJKUDEY\n"
+"MBYGA1UEChMPU0VDT00gVHJ1c3QubmV0MScwJQYDVQQLEx5TZWN1cml0eSBDb21t\n"
+"dW5pY2F0aW9uIFJvb3RDQTEwHhcNMDMwOTMwMDQyMDQ5WhcNMjMwOTMwMDQyMDQ5\n"
+"WjBQMQswCQYDVQQGEwJKUDEYMBYGA1UEChMPU0VDT00gVHJ1c3QubmV0MScwJQYD\n"
+"VQQLEx5TZWN1cml0eSBDb21tdW5pY2F0aW9uIFJvb3RDQTEwggEiMA0GCSqGSIb3\n"
+"DQEBAQUAA4IBDwAwggEKAoIBAQCzs/5/022x7xZ8V6UMbXaKL0u/ZPtM7orw8yl8\n"
+"9f/uKuDp6bpbZCKamm8sOiZpUQWZJtzVHGpxxpp9Hp3dfGzGjGdnSj74cbAZJ6kJ\n"
+"DKaVv0uMDPpVmDvY6CKhS3E4eayXkmmziX7qIWgGmBSWh9JhNrxtJ1aeV+7AwFb9\n"
+"Ms+k2Y7CI9eNqPPYJayX5HA49LY6tJ07lyZDo6G8SVlyTCMwhwFY9k6+HGhWZq/N\n"
+"QV3Is00qVUarH9oe4kA92819uZKAnDfdDJZkndwi92SL32HeFZRSFaB9UslLqCHJ\n"
+"xrHty8OVYNEP8Ktw+N/LTX7s1vqr2b1/VPKl6Xn62dZ2JChzAgMBAAGjPzA9MB0G\n"
+"A1UdDgQWBBSgc0mZaNyFW2XjmygvV5+9M7wHSDALBgNVHQ8EBAMCAQYwDwYDVR0T\n"
+"AQH/BAUwAwEB/zANBgkqhkiG9w0BAQUFAAOCAQEAaECpqLvkT115swW1F7NgE+vG\n"
+"kl3g0dNq/vu+m22/xwVtWSDEHPC32oRYAmP6SBbvT6UL90qY8j+eG61Ha2POCEfr\n"
+"Uj94nK9NrvjVT8+amCoQQTlSxN3Zmw7vkwGusi7KaEIkQmywszo+zenaSMQVy+n5\n"
+"Bw+SUEmK3TGXX8npN6o7WWWXlDLJs58+OmJYxUmtYg5xpTKqL8aJdkNAExNnPaJU\n"
+"JRDL8Try2frbSVa7pv6nQTXD4IhhyYjH3zYQIphZ6rBK+1YWc26sTfcioU+tHXot\n"
+"RSflMMFe8toTyyVCUZVHA4xsIcx0Qu1T/zOLjw9XARYvz6buyXAiFL39vmwLAw==\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                       //   O  = Sonera CN = Sonera Class2 CA
+"MIIDIDCCAgigAwIBAgIBHTANBgkqhkiG9w0BAQUFADA5MQswCQYDVQQGEwJGSTEP\n"
+"MA0GA1UEChMGU29uZXJhMRkwFwYDVQQDExBTb25lcmEgQ2xhc3MyIENBMB4XDTAx\n"
+"MDQwNjA3Mjk0MFoXDTIxMDQwNjA3Mjk0MFowOTELMAkGA1UEBhMCRkkxDzANBgNV\n"
+"BAoTBlNvbmVyYTEZMBcGA1UEAxMQU29uZXJhIENsYXNzMiBDQTCCASIwDQYJKoZI\n"
+"hvcNAQEBBQADggEPADCCAQoCggEBAJAXSjWdyvANlsdE+hY3/Ei9vX+ALTU74W+o\n"
+"Z6m/AxxNjG8yR9VBaKQTBME1DJqEQ/xcHf+Js+gXGM2RX/uJ4+q/Tl18GybTdXnt\n"
+"5oTjV+WtKcT0OijnpXuENmmz/V52vaMtmdOQTiMofRhj8VQ7Jp12W5dCsv+u8E7s\n"
+"3TmVToMGf+dJQMjFAbJUWmYdPfz56TwKnoG4cPABi+QjVHzIrviQHgCWctRUz2Ej\n"
+"vOr7nQKV0ba5cTppCD8PtOFCx4j1P5iop7oc4HFx71hXgVB6XGt0Rg6DA5jDjqhu\n"
+"8nYybieDwnPz3BjotJPqdURrBGAgcVeHnfO+oJAjPYok4doh28MCAwEAAaMzMDEw\n"
+"DwYDVR0TAQH/BAUwAwEB/zARBgNVHQ4ECgQISqCqWITTXjwwCwYDVR0PBAQDAgEG\n"
+"MA0GCSqGSIb3DQEBBQUAA4IBAQBazof5FnIVV0sd2ZvnoiYw7JNn39Yt0jSv9zil\n"
+"zqsWuasvfDXLrNAPtEwr/IDva4yRXzZ299uzGxnq9LIR/WFxRL8oszodv7ND6J+/\n"
+"3DEIcbCdjdY0RzKQxmUk96BKfARzjzlvF4xytb1LyHr4e4PDKE6cCepnP7JnBBvD\n"
+"FNr450kkkdAdavphOe9r5yF1BgfYErQhIHBCcYHaPJo2vqZbDWpsmh+Re/n570K6\n"
+"Tk6ezAyNlNzZRZxe7EJQY670XcSxEtzKO6gunRRaBXW37Ndj4ro1tgQIkejanZz2\n"
+"ZrUYrAqmVCY0M9IbwdR/GjqOC6oybtv8TyWf2TLHllpwrN9M\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                       //   O  = Staat der Nederlanden CN = Staat der Nederlanden EV Root CA
+"MIIFcDCCA1igAwIBAgIEAJiWjTANBgkqhkiG9w0BAQsFADBYMQswCQYDVQQGEwJO\n"
+"TDEeMBwGA1UECgwVU3RhYXQgZGVyIE5lZGVybGFuZGVuMSkwJwYDVQQDDCBTdGFh\n"
+"dCBkZXIgTmVkZXJsYW5kZW4gRVYgUm9vdCBDQTAeFw0xMDEyMDgxMTE5MjlaFw0y\n"
+"MjEyMDgxMTEwMjhaMFgxCzAJBgNVBAYTAk5MMR4wHAYDVQQKDBVTdGFhdCBkZXIg\n"
+"TmVkZXJsYW5kZW4xKTAnBgNVBAMMIFN0YWF0IGRlciBOZWRlcmxhbmRlbiBFViBS\n"
+"b290IENBMIICIjANBgkqhkiG9w0BAQEFAAOCAg8AMIICCgKCAgEA48d+ifkkSzrS\n"
+"M4M1LGns3Amk41GoJSt5uAg94JG6hIXGhaTK5skuU6TJJB79VWZxXSzFYGgEt9nC\n"
+"UiY4iKTWO0Cmws0/zZiTs1QUWJZV1VD+hq2kY39ch/aO5ieSZxeSAgMs3NZmdO3d\n"
+"Z//BYY1jTw+bbRcwJu+r0h8QoPnFfxZpgQNH7R5ojXKhTbImxrpsX23Wr9GxE46p\n"
+"rfNeaXUmGD5BKyF/7otdBwadQ8QpCiv8Kj6GyzyDOvnJDdrFmeK8eEEzduG/L13l\n"
+"pJhQDBXd4Pqcfzho0LKmeqfRMb1+ilgnQ7O6M5HTp5gVXJrm0w912fxBmJc+qiXb\n"
+"j5IusHsMX/FjqTf5m3VpTCgmJdrV8hJwRVXj33NeN/UhbJCONVrJ0yPr08C+eKxC\n"
+"KFhmpUZtcALXEPlLVPxdhkqHz3/KRawRWrUgUY0viEeXOcDPusBCAUCZSCELa6fS\n"
+"/ZbV0b5GnUngC6agIk440ME8MLxwjyx1zNDFjFE7PZQIZCZhfbnDZY8UnCHQqv0X\n"
+"cgOPvZuM5l5Tnrmd74K74bzickFbIZTTRTeU0d8JOV3nI6qaHcptqAqGhYqCvkIH\n"
+"1vI4gnPah1vlPNOePqc7nvQDs/nxfRN0Av+7oeX6AHkcpmZBiFxgV6YuCcS6/ZrP\n"
+"px9Aw7vMWgpVSzs4dlG4Y4uElBbmVvMCAwEAAaNCMEAwDwYDVR0TAQH/BAUwAwEB\n"
+"/zAOBgNVHQ8BAf8EBAMCAQYwHQYDVR0OBBYEFP6rAJCYniT8qcwaivsnuL8wbqg7\n"
+"MA0GCSqGSIb3DQEBCwUAA4ICAQDPdyxuVr5Os7aEAJSrR8kN0nbHhp8dB9O2tLsI\n"
+"eK9p0gtJ3jPFrK3CiAJ9Brc1AsFgyb/E6JTe1NOpEyVa/m6irn0F3H3zbPB+po3u\n"
+"2dfOWBfoqSmuc0iH55vKbimhZF8ZE/euBhD/UcabTVUlT5OZEAFTdfETzsemQUHS\n"
+"v4ilf0X8rLiltTMMgsT7B/Zq5SWEXwbKwYY5EdtYzXc7LMJMD16a4/CrPmEbUCTC\n"
+"wPTxGfARKbalGAKb12NMcIxHowNDXLldRqANb/9Zjr7dn3LDWyvfjFvO5QxGbJKy\n"
+"CqNMVEIYFRIYvdr8unRu/8G2oGTYqV9Vrp9canaW2HNnh/tNf1zuacpzEPuKqf2e\n"
+"vTY4SUmH9A4U8OmHuD+nT3pajnnUk+S7aFKErGzp85hwVXIy+TSrK0m1zSBi5Dp6\n"
+"Z2Orltxtrpfs/J92VoguZs9btsmksNcFuuEnL5O7Jiqik7Ab846+HUCjuTaPPoIa\n"
+"Gl6I6lD4WeKDRikL40Rc4ZW2aZCaFG+XroHPaO+Zmr615+F/+PoTRxZMzG0IQOeL\n"
+"eG9QgkRQP2YGiqtDhFZKDyAthg710tvSeopLzaXoTvFeJiUBWSOgftL2fiFX1ye8\n"
+"FVdMpEbB4IMeDExNH08GGeL5qPQ6gqGyeUN51q1veieQA6TqJIc/2b3Z6fJfUEkc\n"
+"7uzXLg==\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                      //   O  = Staat der Nederlanden CN = Staat der Nederlanden Root CA - G3
+"MIIFdDCCA1ygAwIBAgIEAJiiOTANBgkqhkiG9w0BAQsFADBaMQswCQYDVQQGEwJO\n"
+"TDEeMBwGA1UECgwVU3RhYXQgZGVyIE5lZGVybGFuZGVuMSswKQYDVQQDDCJTdGFh\n"
+"dCBkZXIgTmVkZXJsYW5kZW4gUm9vdCBDQSAtIEczMB4XDTEzMTExNDExMjg0MloX\n"
+"DTI4MTExMzIzMDAwMFowWjELMAkGA1UEBhMCTkwxHjAcBgNVBAoMFVN0YWF0IGRl\n"
+"ciBOZWRlcmxhbmRlbjErMCkGA1UEAwwiU3RhYXQgZGVyIE5lZGVybGFuZGVuIFJv\n"
+"b3QgQ0EgLSBHMzCCAiIwDQYJKoZIhvcNAQEBBQADggIPADCCAgoCggIBAL4yolQP\n"
+"cPssXFnrbMSkUeiFKrPMSjTysF/zDsccPVMeiAho2G89rcKezIJnByeHaHE6n3WW\n"
+"IkYFsO2tx1ueKt6c/DrGlaf1F2cY5y9JCAxcz+bMNO14+1Cx3Gsy8KL+tjzk7FqX\n"
+"xz8ecAgwoNzFs21v0IJyEavSgWhZghe3eJJg+szeP4TrjTgzkApyI/o1zCZxMdFy\n"
+"KJLZWyNtZrVtB0LrpjPOktvA9mxjeM3KTj215VKb8b475lRgsGYeCasH/lSJEULR\n"
+"9yS6YHgamPfJEf0WwTUaVHXvQ9Plrk7O53vDxk5hUUurmkVLoR9BvUhTFXFkC4az\n"
+"5S6+zqQbwSmEorXLCCN2QyIkHxcE1G6cxvx/K2Ya7Irl1s9N9WMJtxU51nus6+N8\n"
+"6U78dULI7ViVDAZCopz35HCz33JvWjdAidiFpNfxC95DGdRKWCyMijmev4SH8RY7\n"
+"Ngzp07TKbBlBUgmhHbBqv4LvcFEhMtwFdozL92TkA1CvjJFnq8Xy7ljY3r735zHP\n"
+"bMk7ccHViLVlvMDoFxcHErVc0qsgk7TmgoNwNsXNo42ti+yjwUOH5kPiNL6VizXt\n"
+"BznaqB16nzaeErAMZRKQFWDZJkBE41ZgpRDUajz9QdwOWke275dhdU/Z/seyHdTt\n"
+"XUmzqWrLZoQT1Vyg3N9udwbRcXXIV2+vD3dbAgMBAAGjQjBAMA8GA1UdEwEB/wQF\n"
+"MAMBAf8wDgYDVR0PAQH/BAQDAgEGMB0GA1UdDgQWBBRUrfrHkleuyjWcLhL75Lpd\n"
+"INyUVzANBgkqhkiG9w0BAQsFAAOCAgEAMJmdBTLIXg47mAE6iqTnB/d6+Oea31BD\n"
+"U5cqPco8R5gu4RV78ZLzYdqQJRZlwJ9UXQ4DO1t3ApyEtg2YXzTdO2PCwyiBwpwp\n"
+"LiniyMMB8jPqKqrMCQj3ZWfGzd/TtiunvczRDnBfuCPRy5FOCvTIeuXZYzbB1N/8\n"
+"Ipf3YF3qKS9Ysr1YvY2WTxB1v0h7PVGHoTx0IsL8B3+A3MSs/mrBcDCw6Y5p4ixp\n"
+"gZQJut3+TcCDjJRYwEYgr5wfAvg1VUkvRtTA8KCWAg8zxXHzniN9lLf9OtMJgwYh\n"
+"/WA9rjLA0u6NpvDntIJ8CsxwyXmA+P5M9zWEGYox+wrZ13+b8KKaa8MFSu1BYBQw\n"
+"0aoRQm7TIwIEC8Zl3d1Sd9qBa7Ko+gE4uZbqKmxnl4mUnrzhVNXkanjvSr0rmj1A\n"
+"fsbAddJu+2gw7OyLnflJNZoaLNmzlTnVHpL3prllL+U9bTpITAjc5CgSKL59NVzq\n"
+"4BZ+Extq1z7XnvwtdbLBFNUjA9tbbws+eC8N3jONFrdI54OagQ97wUNNVQQXOEpR\n"
+"1VmiiXTTn74eS9fGbbeIJG9gkaSChVtWQbzQRKtqE77RLFi3EjNYsjdj3BP1lB0/\n"
+"QFH1T/U67cjF68IeHRaVesd+QnGTbksVtzDfqu1XhUisHWrdOWnk4Xl4vs4Fv6EM\n"
+"94B7IWcnMFk=\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                      //   O  = Starfield Technologies, Inc. OU = Starfield Class 2 Certification Authority
+"MIIEDzCCAvegAwIBAgIBADANBgkqhkiG9w0BAQUFADBoMQswCQYDVQQGEwJVUzEl\n"
+"MCMGA1UEChMcU3RhcmZpZWxkIFRlY2hub2xvZ2llcywgSW5jLjEyMDAGA1UECxMp\n"
+"U3RhcmZpZWxkIENsYXNzIDIgQ2VydGlmaWNhdGlvbiBBdXRob3JpdHkwHhcNMDQw\n"
+"NjI5MTczOTE2WhcNMzQwNjI5MTczOTE2WjBoMQswCQYDVQQGEwJVUzElMCMGA1UE\n"
+"ChMcU3RhcmZpZWxkIFRlY2hub2xvZ2llcywgSW5jLjEyMDAGA1UECxMpU3RhcmZp\n"
+"ZWxkIENsYXNzIDIgQ2VydGlmaWNhdGlvbiBBdXRob3JpdHkwggEgMA0GCSqGSIb3\n"
+"DQEBAQUAA4IBDQAwggEIAoIBAQC3Msj+6XGmBIWtDBFk385N78gDGIc/oav7PKaf\n"
+"8MOh2tTYbitTkPskpD6E8J7oX+zlJ0T1KKY/e97gKvDIr1MvnsoFAZMej2YcOadN\n"
+"+lq2cwQlZut3f+dZxkqZJRRU6ybH838Z1TBwj6+wRir/resp7defqgSHo9T5iaU0\n"
+"X9tDkYI22WY8sbi5gv2cOj4QyDvvBmVmepsZGD3/cVE8MC5fvj13c7JdBmzDI1aa\n"
+"K4UmkhynArPkPw2vCHmCuDY96pzTNbO8acr1zJ3o/WSNF4Azbl5KXZnJHoe0nRrA\n"
+"1W4TNSNe35tfPe/W93bC6j67eA0cQmdrBNj41tpvi/JEoAGrAgEDo4HFMIHCMB0G\n"
+"A1UdDgQWBBS/X7fRzt0fhvRbVazc1xDCDqmI5zCBkgYDVR0jBIGKMIGHgBS/X7fR\n"
+"zt0fhvRbVazc1xDCDqmI56FspGowaDELMAkGA1UEBhMCVVMxJTAjBgNVBAoTHFN0\n"
+"YXJmaWVsZCBUZWNobm9sb2dpZXMsIEluYy4xMjAwBgNVBAsTKVN0YXJmaWVsZCBD\n"
+"bGFzcyAyIENlcnRpZmljYXRpb24gQXV0aG9yaXR5ggEAMAwGA1UdEwQFMAMBAf8w\n"
+"DQYJKoZIhvcNAQEFBQADggEBAAWdP4id0ckaVaGsafPzWdqbAYcaT1epoXkJKtv3\n"
+"L7IezMdeatiDh6GX70k1PncGQVhiv45YuApnP+yz3SFmH8lU+nLMPUxA2IGvd56D\n"
+"eruix/U0F47ZEUD0/CwqTRV/p2JdLiXTAAsgGh1o+Re49L2L7ShZ3U0WixeDyLJl\n"
+"xy16paq8U4Zt3VekyvggQQto8PT7dL5WXXp59fkdheMtlb71cZBDzI0fmgAKhynp\n"
+"VSJYACPq4xJDKVtHCN2MQWplBqjlIapBtJUhlbl90TSrE9atvNziPTnNvT51cKEY\n"
+"WQPJIrSPnNVeKtelttQKbfi3QBFGmh95DmK/D5fs4C8fF5Q=\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                      //   O  = Starfield Technologies, Inc. CN = Starfield Root Certificate Authority - G2
+"MIID3TCCAsWgAwIBAgIBADANBgkqhkiG9w0BAQsFADCBjzELMAkGA1UEBhMCVVMx\n"
+"EDAOBgNVBAgTB0FyaXpvbmExEzARBgNVBAcTClNjb3R0c2RhbGUxJTAjBgNVBAoT\n"
+"HFN0YXJmaWVsZCBUZWNobm9sb2dpZXMsIEluYy4xMjAwBgNVBAMTKVN0YXJmaWVs\n"
+"ZCBSb290IENlcnRpZmljYXRlIEF1dGhvcml0eSAtIEcyMB4XDTA5MDkwMTAwMDAw\n"
+"MFoXDTM3MTIzMTIzNTk1OVowgY8xCzAJBgNVBAYTAlVTMRAwDgYDVQQIEwdBcml6\n"
+"b25hMRMwEQYDVQQHEwpTY290dHNkYWxlMSUwIwYDVQQKExxTdGFyZmllbGQgVGVj\n"
+"aG5vbG9naWVzLCBJbmMuMTIwMAYDVQQDEylTdGFyZmllbGQgUm9vdCBDZXJ0aWZp\n"
+"Y2F0ZSBBdXRob3JpdHkgLSBHMjCCASIwDQYJKoZIhvcNAQEBBQADggEPADCCAQoC\n"
+"ggEBAL3twQP89o/8ArFvW59I2Z154qK3A2FWGMNHttfKPTUuiUP3oWmb3ooa/RMg\n"
+"nLRJdzIpVv257IzdIvpy3Cdhl+72WoTsbhm5iSzchFvVdPtrX8WJpRBSiUZV9Lh1\n"
+"HOZ/5FSuS/hVclcCGfgXcVnrHigHdMWdSL5stPSksPNkN3mSwOxGXn/hbVNMYq/N\n"
+"Hwtjuzqd+/x5AJhhdM8mgkBj87JyahkNmcrUDnXMN/uLicFZ8WJ/X7NfZTD4p7dN\n"
+"dloedl40wOiWVpmKs/B/pM293DIxfJHP4F8R+GuqSVzRmZTRouNjWwl2tVZi4Ut0\n"
+"HZbUJtQIBFnQmA4O5t78w+wfkPECAwEAAaNCMEAwDwYDVR0TAQH/BAUwAwEB/zAO\n"
+"BgNVHQ8BAf8EBAMCAQYwHQYDVR0OBBYEFHwMMh+n2TB/xH1oo2Kooc6rB1snMA0G\n"
+"CSqGSIb3DQEBCwUAA4IBAQARWfolTwNvlJk7mh+ChTnUdgWUXuEok21iXQnCoKjU\n"
+"sHU48TRqneSfioYmUeYs0cYtbpUgSpIB7LiKZ3sx4mcujJUDJi5DnUox9g61DLu3\n"
+"4jd/IroAow57UvtruzvE03lRTs2Q9GcHGcg8RnoNAX3FWOdt5oUwF5okxBDgBPfg\n"
+"8n/Uqgr/Qh037ZTlZFkSIHc40zI+OIF1lnP6aI+xy84fxez6nH7PfrHxBy22/L/K\n"
+"pL/QlwVKvOoYKAKQvVR4CSFx09F9HdkWsKlhPdAKACL8x3vLCWRFCztAgfd9fDL1\n"
+"mMpYjn0q7pBZc2T5NnReJaH1ZgUufzkVqSr7UIuOhWn0\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                      //   O  = Starfield Technologies, Inc. CN = Starfield Services Root Certificate Authority - G2
+"MIID7zCCAtegAwIBAgIBADANBgkqhkiG9w0BAQsFADCBmDELMAkGA1UEBhMCVVMx\n"
+"EDAOBgNVBAgTB0FyaXpvbmExEzARBgNVBAcTClNjb3R0c2RhbGUxJTAjBgNVBAoT\n"
+"HFN0YXJmaWVsZCBUZWNobm9sb2dpZXMsIEluYy4xOzA5BgNVBAMTMlN0YXJmaWVs\n"
+"ZCBTZXJ2aWNlcyBSb290IENlcnRpZmljYXRlIEF1dGhvcml0eSAtIEcyMB4XDTA5\n"
+"MDkwMTAwMDAwMFoXDTM3MTIzMTIzNTk1OVowgZgxCzAJBgNVBAYTAlVTMRAwDgYD\n"
+"VQQIEwdBcml6b25hMRMwEQYDVQQHEwpTY290dHNkYWxlMSUwIwYDVQQKExxTdGFy\n"
+"ZmllbGQgVGVjaG5vbG9naWVzLCBJbmMuMTswOQYDVQQDEzJTdGFyZmllbGQgU2Vy\n"
+"dmljZXMgUm9vdCBDZXJ0aWZpY2F0ZSBBdXRob3JpdHkgLSBHMjCCASIwDQYJKoZI\n"
+"hvcNAQEBBQADggEPADCCAQoCggEBANUMOsQq+U7i9b4Zl1+OiFOxHz/Lz58gE20p\n"
+"OsgPfTz3a3Y4Y9k2YKibXlwAgLIvWX/2h/klQ4bnaRtSmpDhcePYLQ1Ob/bISdm2\n"
+"8xpWriu2dBTrz/sm4xq6HZYuajtYlIlHVv8loJNwU4PahHQUw2eeBGg6345AWh1K\n"
+"Ts9DkTvnVtYAcMtS7nt9rjrnvDH5RfbCYM8TWQIrgMw0R9+53pBlbQLPLJGmpufe\n"
+"hRhJfGZOozptqbXuNC66DQO4M99H67FrjSXZm86B0UVGMpZwh94CDklDhbZsc7tk\n"
+"6mFBrMnUVN+HL8cisibMn1lUaJ/8viovxFUcdUBgF4UCVTmLfwUCAwEAAaNCMEAw\n"
+"DwYDVR0TAQH/BAUwAwEB/zAOBgNVHQ8BAf8EBAMCAQYwHQYDVR0OBBYEFJxfAN+q\n"
+"AdcwKziIorhtSpzyEZGDMA0GCSqGSIb3DQEBCwUAA4IBAQBLNqaEd2ndOxmfZyMI\n"
+"bw5hyf2E3F/YNoHN2BtBLZ9g3ccaaNnRbobhiCPPE95Dz+I0swSdHynVv/heyNXB\n"
+"ve6SbzJ08pGCL72CQnqtKrcgfU28elUSwhXqvfdqlS5sdJ/PHLTyxQGjhdByPq1z\n"
+"qwubdQxtRbeOlKyWN7Wg0I8VRw7j6IPdj/3vQQF3zCepYoUz8jcI73HPdwbeyBkd\n"
+"iEDPfUYd/x7H4c7/I9vG+o1VTqkC50cRRj70/b17KSa7qWFiNyi2LSr2EIZkyXCn\n"
+"0q23KXB56jzaYyWf/Wi3MOxw+3WKt21gZ7IeyLnp2KhvAotnDU0mV3HaIPzBSlCN\n"
+"sSi6\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                      //   O  = SwissSign AG CN = SwissSign Silver CA - G2
+"MIIFvTCCA6WgAwIBAgIITxvUL1S7L0swDQYJKoZIhvcNAQEFBQAwRzELMAkGA1UE\n"
+"BhMCQ0gxFTATBgNVBAoTDFN3aXNzU2lnbiBBRzEhMB8GA1UEAxMYU3dpc3NTaWdu\n"
+"IFNpbHZlciBDQSAtIEcyMB4XDTA2MTAyNTA4MzI0NloXDTM2MTAyNTA4MzI0Nlow\n"
+"RzELMAkGA1UEBhMCQ0gxFTATBgNVBAoTDFN3aXNzU2lnbiBBRzEhMB8GA1UEAxMY\n"
+"U3dpc3NTaWduIFNpbHZlciBDQSAtIEcyMIICIjANBgkqhkiG9w0BAQEFAAOCAg8A\n"
+"MIICCgKCAgEAxPGHf9N4Mfc4yfjDmUO8x/e8N+dOcbpLj6VzHVxumK4DV644N0Mv\n"
+"Fz0fyM5oEMF4rhkDKxD6LHmD9ui5aLlV8gREpzn5/ASLHvGiTSf5YXu6t+WiE7br\n"
+"YT7QbNHm+/pe7R20nqA1W6GSy/BJkv6FCgU+5tkL4k+73JU3/JHpMjUi0R86TieF\n"
+"nbAVlDLaYQ1HTWBCrpJH6INaUFjpiou5XaHc3ZlKHzZnu0jkg7Y360g6rw9njxcH\n"
+"6ATK72oxh9TAtvmUcXtnZLi2kUpCe2UuMGoM9ZDulebyzYLs2aFK7PayS+VFheZt\n"
+"eJMELpyCbTapxDFkH4aDCyr0NQp4yVXPQbBH6TCfmb5hqAaEuSh6XzjZG6k4sIN/\n"
+"c8HDO0gqgg8hm7jMqDXDhBuDsz6+pJVpATqJAHgE2cn0mRmrVn5bi4Y5FZGkECwJ\n"
+"MoBgs5PAKrYYC51+jUnyEEp/+dVGLxmSo5mnJqy7jDzmDrxHB9xzUfFwZC8I+bRH\n"
+"HTBsROopN4WSaGa8gzj+ezku01DwH/teYLappvonQfGbGHLy9YR0SslnxFSuSGTf\n"
+"jNFusB3hB48IHpmccelM2KX3RxIfdNFRnobzwqIjQAtz20um53MGjMGg6cFZrEb6\n"
+"5i/4z3GcRm25xBWNOHkDRUjvxF3XCO6HOSKGsg0PWEP3calILv3q1h8CAwEAAaOB\n"
+"rDCBqTAOBgNVHQ8BAf8EBAMCAQYwDwYDVR0TAQH/BAUwAwEB/zAdBgNVHQ4EFgQU\n"
+"F6DNweRBtjpbO8tFnb0cwpj6hlgwHwYDVR0jBBgwFoAUF6DNweRBtjpbO8tFnb0c\n"
+"wpj6hlgwRgYDVR0gBD8wPTA7BglghXQBWQEDAQEwLjAsBggrBgEFBQcCARYgaHR0\n"
+"cDovL3JlcG9zaXRvcnkuc3dpc3NzaWduLmNvbS8wDQYJKoZIhvcNAQEFBQADggIB\n"
+"AHPGgeAn0i0P4JUw4ppBf1AsX19iYamGamkYDHRJ1l2E6kFSGG9YrVBWIGrGvShp\n"
+"WJHckRE1qTodvBqlYJ7YH39FkWnZfrt4csEGDyrOj4VwYaygzQu4OSlWhDJOhrs9\n"
+"xCrZ1x9y7v5RoSJBsXECYxqCsGKrXlcSH9/L3XWgwF15kIwb4FDm3jH+mHtwX6WQ\n"
+"2K34ArZv02DdQEsixT2tOnqfGhpHkXkzuoLcMmkDlm4fS/Bx/uNncqCxv1yL5PqZ\n"
+"IseEuRuNI5c/7SXgz2W79WEE790eslpBIlqhn10s6FvJbakMDHiqYMZWjwFaDGi8\n"
+"aRl5xB9+lwW/xekkUV7U1UtT7dkjWjYDZaPBA61BMPNGG4WQr2W11bHkFlt4dR2X\n"
+"em1ZqSqPe97Dh4kQmUlzeMg9vVE1dCrV8X5pGyq7O70luJpaPXJhkGaH7gzWTdQR\n"
+"dAtq/gsD/KNVV4n+SsuuWxcFyPKNIzFTONItaj+CuY0IavdeQXRuwxF+B6wpYJE/\n"
+"OMpXEA29MC/HpeZBoNquBYeaoKRlbEwJDIm6uNO5wJOKMPqN5ZprFQFOZ6raYlY+\n"
+"hAhm0sQ2fac+EPyI4NSA5QC9qvNOBqN6avlicuMJT+ubDgEj8Z+7fNzcbBGXJbLy\n"
+"tGMU0gYqZ4yD9c7qB9iaah7s5Aq7KkzrCWA5zspi2C5u\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                      //   O  = T-Systems Enterprise Services GmbH OU = T-Systems Trust Center CN = T-TeleSec GlobalRoot Class 2
+"MIIDwzCCAqugAwIBAgIBATANBgkqhkiG9w0BAQsFADCBgjELMAkGA1UEBhMCREUx\n"
+"KzApBgNVBAoMIlQtU3lzdGVtcyBFbnRlcnByaXNlIFNlcnZpY2VzIEdtYkgxHzAd\n"
+"BgNVBAsMFlQtU3lzdGVtcyBUcnVzdCBDZW50ZXIxJTAjBgNVBAMMHFQtVGVsZVNl\n"
+"YyBHbG9iYWxSb290IENsYXNzIDIwHhcNMDgxMDAxMTA0MDE0WhcNMzMxMDAxMjM1\n"
+"OTU5WjCBgjELMAkGA1UEBhMCREUxKzApBgNVBAoMIlQtU3lzdGVtcyBFbnRlcnBy\n"
+"aXNlIFNlcnZpY2VzIEdtYkgxHzAdBgNVBAsMFlQtU3lzdGVtcyBUcnVzdCBDZW50\n"
+"ZXIxJTAjBgNVBAMMHFQtVGVsZVNlYyBHbG9iYWxSb290IENsYXNzIDIwggEiMA0G\n"
+"CSqGSIb3DQEBAQUAA4IBDwAwggEKAoIBAQCqX9obX+hzkeXaXPSi5kfl82hVYAUd\n"
+"AqSzm1nzHoqvNK38DcLZSBnuaY/JIPwhqgcZ7bBcrGXHX+0CfHt8LRvWurmAwhiC\n"
+"FoT6ZrAIxlQjgeTNuUk/9k9uN0goOA/FvudocP05l03Sx5iRUKrERLMjfTlH6VJi\n"
+"1hKTXrcxlkIF+3anHqP1wvzpesVsqXFP6st4vGCvx9702cu+fjOlbpSD8DT6Iavq\n"
+"jnKgP6TeMFvvhk1qlVtDRKgQFRzlAVfFmPHmBiiRqiDFt1MmUUOyCxGVWOHAD3bZ\n"
+"wI18gfNycJ5v/hqO2V81xrJvNHy+SE/iWjnX2J14np+GPgNeGYtEotXHAgMBAAGj\n"
+"QjBAMA8GA1UdEwEB/wQFMAMBAf8wDgYDVR0PAQH/BAQDAgEGMB0GA1UdDgQWBBS/\n"
+"WSA2AHmgoCJrjNXyYdK4LMuCSjANBgkqhkiG9w0BAQsFAAOCAQEAMQOiYQsfdOhy\n"
+"NsZt+U2e+iKo4YFWz827n+qrkRk4r6p8FU3ztqONpfSO9kSpp+ghla0+AGIWiPAC\n"
+"uvxhI+YzmzB6azZie60EI4RYZeLbK4rnJVM3YlNfvNoBYimipidx5joifsFvHZVw\n"
+"IEoHNN/q/xWA5brXethbdXwFeilHfkCoMRN3zUA7tFFHei4R40cR3p1m0IvVVGb6\n"
+"g1XqfMIpiRvpb7PO4gWEyS8+eIVibslfwXhjdFjASBgMmTnrpMwatXlajRWc2BQN\n"
+"9noHV8cigwUtPJslJj0Ys6lDfMjIq2SPDqO/nBudMNva0Bkuqjzx+zOAduTNrRlP\n"
+"BSeOE6Fuwg==\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                       // O  = T-Systems Enterprise Services GmbH OU = T-Systems Trust Center CN = T-TeleSec GlobalRoot Class 3
+"MIIDwzCCAqugAwIBAgIBATANBgkqhkiG9w0BAQsFADCBgjELMAkGA1UEBhMCREUx\n"
+"KzApBgNVBAoMIlQtU3lzdGVtcyBFbnRlcnByaXNlIFNlcnZpY2VzIEdtYkgxHzAd\n"
+"BgNVBAsMFlQtU3lzdGVtcyBUcnVzdCBDZW50ZXIxJTAjBgNVBAMMHFQtVGVsZVNl\n"
+"YyBHbG9iYWxSb290IENsYXNzIDMwHhcNMDgxMDAxMTAyOTU2WhcNMzMxMDAxMjM1\n"
+"OTU5WjCBgjELMAkGA1UEBhMCREUxKzApBgNVBAoMIlQtU3lzdGVtcyBFbnRlcnBy\n"
+"aXNlIFNlcnZpY2VzIEdtYkgxHzAdBgNVBAsMFlQtU3lzdGVtcyBUcnVzdCBDZW50\n"
+"ZXIxJTAjBgNVBAMMHFQtVGVsZVNlYyBHbG9iYWxSb290IENsYXNzIDMwggEiMA0G\n"
+"CSqGSIb3DQEBAQUAA4IBDwAwggEKAoIBAQC9dZPwYiJvJK7genasfb3ZJNW4t/zN\n"
+"8ELg63iIVl6bmlQdTQyK9tPPcPRStdiTBONGhnFBSivwKixVA9ZIw+A5OO3yXDw/\n"
+"RLyTPWGrTs0NvvAgJ1gORH8EGoel15YUNpDQSXuhdfsaa3Ox+M6pCSzyU9XDFES4\n"
+"hqX2iys52qMzVNn6chr3IhUciJFrf2blw2qAsCTz34ZFiP0Zf3WHHx+xGwpzJFu5\n"
+"ZeAsVMhg02YXP+HMVDNzkQI6pn97djmiH5a2OK61yJN0HZ65tOVgnS9W0eDrXltM\n"
+"EnAMbEQgqxHY9Bn20pxSN+f6tsIxO0rUFJmtxxr1XV/6B7h8DR/Wgx6zAgMBAAGj\n"
+"QjBAMA8GA1UdEwEB/wQFMAMBAf8wDgYDVR0PAQH/BAQDAgEGMB0GA1UdDgQWBBS1\n"
+"A/d2O2GCahKqGFPrAyGUv/7OyjANBgkqhkiG9w0BAQsFAAOCAQEAVj3vlNW92nOy\n"
+"WL6ukK2YJ5f+AbGwUgC4TeQbIXQbfsDuXmkqJa9c1h3a0nnJ85cp4IaH3gRZD/FZ\n"
+"1GSFS5mvJQQeyUapl96Cshtwn5z2r3Ex3XsFpSzTucpH9sry9uetuUg/vBa3wW30\n"
+"6gmv7PO15wWeph6KU1HWk4HMdJP2udqmJQV0eVp+QD6CSyYRMG7hP0HHRwA11fXT\n"
+"91Q+gT3aSWqas+8QPebrb9HIIkfLzM8BMZLZGOMivgkeGj5asuRrDFR6fUNOuIml\n"
+"e9eiPZaGzPImNC1qkp2aGtAw4l1OBLBfiyB+d8E9lYLRRpo7PHi4b6HQDWSieB4p\n"
+"TpPDpFQUWw==\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                      // O  = Turkiye Bilimsel ve Teknolojik Arastirma Kurumu - TUBITAK OU = Kamu Sertifikasyon Merkezi - Kamu SM CN = TUBITAK Kamu SM SSL Kok Sertifikasi - Surum 1
+"MIIEYzCCA0ugAwIBAgIBATANBgkqhkiG9w0BAQsFADCB0jELMAkGA1UEBhMCVFIx\n"
+"GDAWBgNVBAcTD0dlYnplIC0gS29jYWVsaTFCMEAGA1UEChM5VHVya2l5ZSBCaWxp\n"
+"bXNlbCB2ZSBUZWtub2xvamlrIEFyYXN0aXJtYSBLdXJ1bXUgLSBUVUJJVEFLMS0w\n"
+"KwYDVQQLEyRLYW11IFNlcnRpZmlrYXN5b24gTWVya2V6aSAtIEthbXUgU00xNjA0\n"
+"BgNVBAMTLVRVQklUQUsgS2FtdSBTTSBTU0wgS29rIFNlcnRpZmlrYXNpIC0gU3Vy\n"
+"dW0gMTAeFw0xMzExMjUwODI1NTVaFw00MzEwMjUwODI1NTVaMIHSMQswCQYDVQQG\n"
+"EwJUUjEYMBYGA1UEBxMPR2ViemUgLSBLb2NhZWxpMUIwQAYDVQQKEzlUdXJraXll\n"
+"IEJpbGltc2VsIHZlIFRla25vbG9qaWsgQXJhc3Rpcm1hIEt1cnVtdSAtIFRVQklU\n"
+"QUsxLTArBgNVBAsTJEthbXUgU2VydGlmaWthc3lvbiBNZXJrZXppIC0gS2FtdSBT\n"
+"TTE2MDQGA1UEAxMtVFVCSVRBSyBLYW11IFNNIFNTTCBLb2sgU2VydGlmaWthc2kg\n"
+"LSBTdXJ1bSAxMIIBIjANBgkqhkiG9w0BAQEFAAOCAQ8AMIIBCgKCAQEAr3UwM6q7\n"
+"a9OZLBI3hNmNe5eA027n/5tQlT6QlVZC1xl8JoSNkvoBHToP4mQ4t4y86Ij5iySr\n"
+"LqP1N+RAjhgleYN1Hzv/bKjFxlb4tO2KRKOrbEz8HdDc72i9z+SqzvBV96I01INr\n"
+"N3wcwv61A+xXzry0tcXtAA9TNypN9E8Mg/uGz8v+jE69h/mniyFXnHrfA2eJLJ2X\n"
+"YacQuFWQfw4tJzh03+f92k4S400VIgLI4OD8D62K18lUUMw7D8oWgITQUVbDjlZ/\n"
+"iSIzL+aFCr2lqBs23tPcLG07xxO9WSMs5uWk99gL7eqQQESolbuT1dCANLZGeA4f\n"
+"AJNG4e7p+exPFwIDAQABo0IwQDAdBgNVHQ4EFgQUZT/HiobGPN08VFw1+DrtUgxH\n"
+"V8gwDgYDVR0PAQH/BAQDAgEGMA8GA1UdEwEB/wQFMAMBAf8wDQYJKoZIhvcNAQEL\n"
+"BQADggEBACo/4fEyjq7hmFxLXs9rHmoJ0iKpEsdeV31zVmSAhHqT5Am5EM2fKifh\n"
+"AHe+SMg1qIGf5LgsyX8OsNJLN13qudULXjS99HMpw+0mFZx+CFOKWI3QSyjfwbPf\n"
+"IPP54+M638yclNhOT8NrF7f3cuitZjO1JVOr4PhMqZ398g26rrnZqsZr+ZO7rqu4\n"
+"lzwDGrpDxpa5RXI4s6ehlj2Re37AIVNMh+3yC1SVUZPVIqUNivGTDj5UDrDYyU7c\n"
+"8jEyVupk+eq1nRZmQnLzf9OxMUP8pI4X8W0jq5Rm+K37DwhuJi1/FwcJsoz7UMCf\n"
+"lo3Ptv0AnVoUmr8CRPXBwp8iXqIPoeM=\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                       //   O  = TAIWAN-CA OU = Root CA CN = TWCA Global Root CA
+"MIIFQTCCAymgAwIBAgICDL4wDQYJKoZIhvcNAQELBQAwUTELMAkGA1UEBhMCVFcx\n"
+"EjAQBgNVBAoTCVRBSVdBTi1DQTEQMA4GA1UECxMHUm9vdCBDQTEcMBoGA1UEAxMT\n"
+"VFdDQSBHbG9iYWwgUm9vdCBDQTAeFw0xMjA2MjcwNjI4MzNaFw0zMDEyMzExNTU5\n"
+"NTlaMFExCzAJBgNVBAYTAlRXMRIwEAYDVQQKEwlUQUlXQU4tQ0ExEDAOBgNVBAsT\n"
+"B1Jvb3QgQ0ExHDAaBgNVBAMTE1RXQ0EgR2xvYmFsIFJvb3QgQ0EwggIiMA0GCSqG\n"
+"SIb3DQEBAQUAA4ICDwAwggIKAoICAQCwBdvI64zEbooh745NnHEKH1Jw7W2CnJfF\n"
+"10xORUnLQEK1EjRsGcJ0pDFfhQKX7EMzClPSnIyOt7h52yvVavKOZsTuKwEHktSz\n"
+"0ALfUPZVr2YOy+BHYC8rMjk1Ujoog/h7FsYYuGLWRyWRzvAZEk2tY/XTP3VfKfCh\n"
+"MBwqoJimFb3u/Rk28OKRQ4/6ytYQJ0lM793B8YVwm8rqqFpD/G2Gb3PpN0Wp8DbH\n"
+"zIh1HrtsBv+baz4X7GGqcXzGHaL3SekVtTzWoWH1EfcFbx39Eb7QMAfCKbAJTibc\n"
+"46KokWofwpFFiFzlmLhxpRUZyXx1EcxwdE8tmx2RRP1WKKD+u4ZqyPpcC1jcxkt2\n"
+"yKsi2XMPpfRaAok/T54igu6idFMqPVMnaR1sjjIsZAAmY2E2TqNGtz99sy2sbZCi\n"
+"laLOz9qC5wc0GZbpuCGqKX6mOL6OKUohZnkfs8O1CWfe1tQHRvMq2uYiN2DLgbYP\n"
+"oA/pyJV/v1WRBXrPPRXAb94JlAGD1zQbzECl8LibZ9WYkTunhHiVJqRaCPgrdLQA\n"
+"BDzfuBSO6N+pjWxnkjMdwLfS7JLIvgm/LCkFbwJrnu+8vyq8W8BQj0FwcYeyTbcE\n"
+"qYSjMq+u7msXi7Kx/mzhkIyIqJdIzshNy/MGz19qCkKxHh53L46g5pIOBvwFItIm\n"
+"4TFRfTLcDwIDAQABoyMwITAOBgNVHQ8BAf8EBAMCAQYwDwYDVR0TAQH/BAUwAwEB\n"
+"/zANBgkqhkiG9w0BAQsFAAOCAgEAXzSBdu+WHdXltdkCY4QWwa6gcFGn90xHNcgL\n"
+"1yg9iXHZqjNB6hQbbCEAwGxCGX6faVsgQt+i0trEfJdLjbDorMjupWkEmQqSpqsn\n"
+"LhpNgb+E1HAerUf+/UqdM+DyucRFCCEK2mlpc3INvjT+lIutwx4116KD7+U4x6WF\n"
+"H6vPNOw/KP4M8VeGTslV9xzU2KV9Bnpv1d8Q34FOIWWxtuEXeZVFBs5fzNxGiWNo\n"
+"RI2T9GRwoD2dKAXDOXC4Ynsg/eTb6QihuJ49CcdP+yz4k3ZB3lLg4VfSnQO8d57+\n"
+"nile98FRYB/e2guyLXW3Q0iT5/Z5xoRdgFlglPx4mI88k1HtQJAH32RjJMtOcQWh\n"
+"15QaiDLxInQirqWm2BJpTGCjAu4r7NRjkgtevi92a6O2JryPA9gK8kxkRr05YuWW\n"
+"6zRjESjMlfGt7+/cgFhI6Uu46mWs6fyAtbXIRfmswZ/ZuepiiI7E8UuDEq3mi4TW\n"
+"nsLrgxifarsbJGAzcMzs9zLzXNl5fe+epP7JI8Mk7hWSsT2RTyaGvWZzJBPqpK5j\n"
+"wa19hAM8EHiGG3njxPPyBJUgriOCxLM6AGK/5jYk4Ve6xx6QddVfP5VhK8E7zeWz\n"
+"aGHQRiapIVJpLesux+t3zqY6tQMzT3bR51xUAV3LePTJDL/PEo4XLSNolOer/qmy\n"
+"KwbQBM0=\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                      //   O  = TAIWAN-CA OU = Root CA CN = TWCA Root Certification Authority
+"MIIDezCCAmOgAwIBAgIBATANBgkqhkiG9w0BAQUFADBfMQswCQYDVQQGEwJUVzES\n"
+"MBAGA1UECgwJVEFJV0FOLUNBMRAwDgYDVQQLDAdSb290IENBMSowKAYDVQQDDCFU\n"
+"V0NBIFJvb3QgQ2VydGlmaWNhdGlvbiBBdXRob3JpdHkwHhcNMDgwODI4MDcyNDMz\n"
+"WhcNMzAxMjMxMTU1OTU5WjBfMQswCQYDVQQGEwJUVzESMBAGA1UECgwJVEFJV0FO\n"
+"LUNBMRAwDgYDVQQLDAdSb290IENBMSowKAYDVQQDDCFUV0NBIFJvb3QgQ2VydGlm\n"
+"aWNhdGlvbiBBdXRob3JpdHkwggEiMA0GCSqGSIb3DQEBAQUAA4IBDwAwggEKAoIB\n"
+"AQCwfnK4pAOU5qfeCTiRShFAh6d8WWQUe7UREN3+v9XAu1bihSX0NXIP+FPQQeFE\n"
+"AcK0HMMxQhZHhTMidrIKbw/lJVBPhYa+v5guEGcevhEFhgWQxFnQfHgQsIBct+HH\n"
+"K3XLfJ+utdGdIzdjp9xCoi2SBBtQwXu4PhvJVgSLL1KbralW6cH/ralYhzC2gfeX\n"
+"RfwZVzsrb+RH9JlF/h3x+JejiB03HFyP4HYlmlD4oFT/RJB2I9IyxsOrBr/8+7/z\n"
+"rX2SYgJbKdM1o5OaQ2RgXbL6Mv87BK9NQGr5x+PvI/1ry+UPizgN7gr8/g+YnzAx\n"
+"3WxSZfmLgb4i4RxYA7qRG4kHAgMBAAGjQjBAMA4GA1UdDwEB/wQEAwIBBjAPBgNV\n"
+"HRMBAf8EBTADAQH/MB0GA1UdDgQWBBRqOFsmjd6LWvJPelSDGRjjCDWmujANBgkq\n"
+"hkiG9w0BAQUFAAOCAQEAPNV3PdrfibqHDAhUaiBQkr6wQT25JmSDCi/oQMCXKCeC\n"
+"MErJk/9q56YAf4lCmtYR5VPOL8zy2gXE/uJQxDqGfczafhAJO5I1KlOy/usrBdls\n"
+"XebQ79NqZp4VKIV66IIArB6nCWlWQtNoURi+VJq/REG6Sb4gumlc7rh3zc5sH62D\n"
+"lhh9DrUUOYTxKOkto557HnpyWoOzeW/vtPzQCqVYT0bf+215WfKEIlKuD8z7fDvn\n"
+"aspHYcN6+NOSBB+4IIThNlQWx0DeO4pz3N/GCUzf7Nr/1FNCocnyYh0igzyXxfkZ\n"
+"YiesZSLX0zzG5Y6yU8xJzrww/nsOM5D77dIUkR8Hrw==\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                      //   O  = TeliaSonera CN = TeliaSonera Root CA v1
+"MIIFODCCAyCgAwIBAgIRAJW+FqD3LkbxezmCcvqLzZYwDQYJKoZIhvcNAQEFBQAw\n"
+"NzEUMBIGA1UECgwLVGVsaWFTb25lcmExHzAdBgNVBAMMFlRlbGlhU29uZXJhIFJv\n"
+"b3QgQ0EgdjEwHhcNMDcxMDE4MTIwMDUwWhcNMzIxMDE4MTIwMDUwWjA3MRQwEgYD\n"
+"VQQKDAtUZWxpYVNvbmVyYTEfMB0GA1UEAwwWVGVsaWFTb25lcmEgUm9vdCBDQSB2\n"
+"MTCCAiIwDQYJKoZIhvcNAQEBBQADggIPADCCAgoCggIBAMK+6yfwIaPzaSZVfp3F\n"
+"VRaRXP3vIb9TgHot0pGMYzHw7CTww6XScnwQbfQ3t+XmfHnqjLWCi65ItqwA3GV1\n"
+"7CpNX8GH9SBlK4GoRz6JI5UwFpB/6FcHSOcZrr9FZ7E3GwYq/t75rH2D+1665I+X\n"
+"Z75Ljo1kB1c4VWk0Nj0TSO9P4tNmHqTPGrdeNjPUtAa9GAH9d4RQAEX1jF3oI7x+\n"
+"/jXh7VB7qTCNGdMJjmhnXb88lxhTuylixcpecsHHltTbLaC0H2kD7OriUPEMPPCs\n"
+"81Mt8Bz17Ww5OXOAFshSsCPN4D7c3TxHoLs1iuKYaIu+5b9y7tL6pe0S7fyYGKkm\n"
+"dtwoSxAgHNN/Fnct7W+A90m7UwW7XWjH1Mh1Fj+JWov3F0fUTPHSiXk+TT2YqGHe\n"
+"Oh7S+F4D4MHJHIzTjU3TlTazN19jY5szFPAtJmtTfImMMsJu7D0hADnJoWjiUIMu\n"
+"sDor8zagrC/kb2HCUQk5PotTubtn2txTuXZZNp1D5SDgPTJghSJRt8czu90VL6R4\n"
+"pgd7gUY2BIbdeTXHlSw7sKMXNeVzH7RcWe/a6hBle3rQf5+ztCo3O3CLm1u5K7fs\n"
+"slESl1MpWtTwEhDcTwK7EpIvYtQ/aUN8Ddb8WHUBiJ1YFkveupD/RwGJBmr2X7KQ\n"
+"arMCpgKIv7NHfirZ1fpoeDVNAgMBAAGjPzA9MA8GA1UdEwEB/wQFMAMBAf8wCwYD\n"
+"VR0PBAQDAgEGMB0GA1UdDgQWBBTwj1k4ALP1j5qWDNXr+nuqF+gTEjANBgkqhkiG\n"
+"9w0BAQUFAAOCAgEAvuRcYk4k9AwI//DTDGjkk0kiP0Qnb7tt3oNmzqjMDfz1mgbl\n"
+"dxSR651Be5kqhOX//CHBXfDkH1e3damhXwIm/9fH907eT/j3HEbAek9ALCI18Bmx\n"
+"0GtnLLCo4MBANzX2hFxc469CeP6nyQ1Q6g2EdvZR74NTxnr/DlZJLo961gzmJ1Tj\n"
+"TQpgcmLNkQfWpb/ImWvtxBnmq0wROMVvMeJuScg/doAmAyYp4Db29iBT4xdwNBed\n"
+"Y2gea+zDTYa4EzAvXUYNR0PVG6pZDrlcjQZIrXSHX8f8MVRBE+LHIQ6e4B4N4cB7\n"
+"Q4WQxYpYxmUKeFfyxiMPAdkgS94P+5KFdSpcc41teyWRyu5FrgZLAMzTsVlQ2jqI\n"
+"OylDRl6XK1TOU2+NSueW+r9xDkKLfP0ooNBIytrEgUy7onOTJsjrDNYmiLbAJM+7\n"
+"vVvrdX3pCI6GMyx5dwlppYn8s3CQh3aP0yK7Qs69cwsgJirQmz1wHiRszYd2qReW\n"
+"t88NkvuOGKmYSdGe/mBEciG5Ge3C9THxOUiIkCR1VBatzvT4aRRkOfujuLpwQMcn\n"
+"HL/EVlP6Y2XQ8xwOFvVrhlhNGNTkDY6lnVuR3HYkUD/GKvvZt5y11ubQ2egZixVx\n"
+"SK236thZiNSQvxaz2emsWWFUyBy6ysHK4bkgTI86k4mloMy/0/Z1pHWWbVY=\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                      //  O  = TrustCor Systems S. de R.L. OU = TrustCor Certificate Authority CN = TrustCor ECA-1
+"MIIEIDCCAwigAwIBAgIJAISCLF8cYtBAMA0GCSqGSIb3DQEBCwUAMIGcMQswCQYD\n"
+"VQQGEwJQQTEPMA0GA1UECAwGUGFuYW1hMRQwEgYDVQQHDAtQYW5hbWEgQ2l0eTEk\n"
+"MCIGA1UECgwbVHJ1c3RDb3IgU3lzdGVtcyBTLiBkZSBSLkwuMScwJQYDVQQLDB5U\n"
+"cnVzdENvciBDZXJ0aWZpY2F0ZSBBdXRob3JpdHkxFzAVBgNVBAMMDlRydXN0Q29y\n"
+"IEVDQS0xMB4XDTE2MDIwNDEyMzIzM1oXDTI5MTIzMTE3MjgwN1owgZwxCzAJBgNV\n"
+"BAYTAlBBMQ8wDQYDVQQIDAZQYW5hbWExFDASBgNVBAcMC1BhbmFtYSBDaXR5MSQw\n"
+"IgYDVQQKDBtUcnVzdENvciBTeXN0ZW1zIFMuIGRlIFIuTC4xJzAlBgNVBAsMHlRy\n"
+"dXN0Q29yIENlcnRpZmljYXRlIEF1dGhvcml0eTEXMBUGA1UEAwwOVHJ1c3RDb3Ig\n"
+"RUNBLTEwggEiMA0GCSqGSIb3DQEBAQUAA4IBDwAwggEKAoIBAQDPj+ARtZ+odnbb\n"
+"3w9U73NjKYKtR8aja+3+XzP4Q1HpGjORMRegdMTUpwHmspI+ap3tDvl0mEDTPwOA\n"
+"BoJA6LHip1GnHYMma6ve+heRK9jGrB6xnhkB1Zem6g23xFUfJ3zSCNV2HykVh0A5\n"
+"3ThFEXXQmqc04L/NyFIduUd+Dbi7xgz2c1cWWn5DkR9VOsZtRASqnKmcp0yJF4Ou\n"
+"owReUoCLHhIlERnXDH19MURB6tuvsBzvgdAsxZohmz3tQjtQJvLsznFhBmIhVE5/\n"
+"wZ0+fyCMgMsq2JdiyIMzkX2woloPV+g7zPIlstR8L+xNxqE6FXrntl019fZISjZF\n"
+"ZtS6mFjBAgMBAAGjYzBhMB0GA1UdDgQWBBREnkj1zG1I1KBLf/5ZJC+Dl5mahjAf\n"
+"BgNVHSMEGDAWgBREnkj1zG1I1KBLf/5ZJC+Dl5mahjAPBgNVHRMBAf8EBTADAQH/\n"
+"MA4GA1UdDwEB/wQEAwIBhjANBgkqhkiG9w0BAQsFAAOCAQEABT41XBVwm8nHc2Fv\n"
+"civUwo/yQ10CzsSUuZQRg2dd4mdsdXa/uwyqNsatR5Nj3B5+1t4u/ukZMjgDfxT2\n"
+"AHMsWbEhBuH7rBiVDKP/mZb3Kyeb1STMHd3BOuCYRLDE5D53sXOpZCz2HAF8P11F\n"
+"hcCF5yWPldwX8zyfGm6wyuMdKulMY/okYWLW2n62HGz1Ah3UKt1VkOsqEUc8Ll50\n"
+"soIipX1TH0XsJ5F95yIW6MBoNtjG8U+ARDL54dHRHareqKucBK+tIA5kmE2la8BI\n"
+"WJZpTdwHjFGTot+fDz2LYLSCjaoITmJF4PkL0uDgPFveXHEnJcLmA4GLEFPjx1Wi\n"
+"tJ/X5g==\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                      //   O  = TrustCor Systems S. de R.L. OU = TrustCor Certificate Authority CN = TrustCor RootCert CA-1
+"MIIEMDCCAxigAwIBAgIJANqb7HHzA7AZMA0GCSqGSIb3DQEBCwUAMIGkMQswCQYD\n"
+"VQQGEwJQQTEPMA0GA1UECAwGUGFuYW1hMRQwEgYDVQQHDAtQYW5hbWEgQ2l0eTEk\n"
+"MCIGA1UECgwbVHJ1c3RDb3IgU3lzdGVtcyBTLiBkZSBSLkwuMScwJQYDVQQLDB5U\n"
+"cnVzdENvciBDZXJ0aWZpY2F0ZSBBdXRob3JpdHkxHzAdBgNVBAMMFlRydXN0Q29y\n"
+"IFJvb3RDZXJ0IENBLTEwHhcNMTYwMjA0MTIzMjE2WhcNMjkxMjMxMTcyMzE2WjCB\n"
+"pDELMAkGA1UEBhMCUEExDzANBgNVBAgMBlBhbmFtYTEUMBIGA1UEBwwLUGFuYW1h\n"
+"IENpdHkxJDAiBgNVBAoMG1RydXN0Q29yIFN5c3RlbXMgUy4gZGUgUi5MLjEnMCUG\n"
+"A1UECwweVHJ1c3RDb3IgQ2VydGlmaWNhdGUgQXV0aG9yaXR5MR8wHQYDVQQDDBZU\n"
+"cnVzdENvciBSb290Q2VydCBDQS0xMIIBIjANBgkqhkiG9w0BAQEFAAOCAQ8AMIIB\n"
+"CgKCAQEAv463leLCJhJrMxnHQFgKq1mqjQCj/IDHUHuO1CAmujIS2CNUSSUQIpid\n"
+"RtLByZ5OGy4sDjjzGiVoHKZaBeYei0i/mJZ0PmnK6bV4pQa81QBeCQryJ3pS/C3V\n"
+"seq0iWEk8xoT26nPUu0MJLq5nux+AHT6k61sKZKuUbS701e/s/OojZz0JEsq1pme\n"
+"9J7+wH5COucLlVPat2gOkEz7cD+PSiyU8ybdY2mplNgQTsVHCJCZGxdNuWxu72CV\n"
+"EY4hgLW9oHPY0LJ3xEXqWib7ZnZ2+AYfYW0PVcWDtxBWcgYHpfOxGgMFZA6dWorW\n"
+"hnAbJN7+KIor0Gqw/Hqi3LJ5DotlDwIDAQABo2MwYTAdBgNVHQ4EFgQU7mtJPHo/\n"
+"DeOxCbeKyKsZn3MzUOcwHwYDVR0jBBgwFoAU7mtJPHo/DeOxCbeKyKsZn3MzUOcw\n"
+"DwYDVR0TAQH/BAUwAwEB/zAOBgNVHQ8BAf8EBAMCAYYwDQYJKoZIhvcNAQELBQAD\n"
+"ggEBACUY1JGPE+6PHh0RU9otRCkZoB5rMZ5NDp6tPVxBb5UrJKF5mDo4Nvu7Zp5I\n"
+"/5CQ7z3UuJu0h3U/IJvOcs+hVcFNZKIZBqEHMwwLKeXx6quj7LUKdJDHfXLy11yf\n"
+"ke+Ri7fc7Waiz45mO7yfOgLgJ90WmMCV1Aqk5IGadZQ1nJBfiDcGrVmVCrDRZ9MZ\n"
+"yonnMlo2HD6CqFqTvsbQZJG2z9m2GM/bftJlo6bEjhcxwft+dtvTheNYsnd6djts\n"
+"L1Ac59v2Z3kf9YKVmgenFK+P3CghZwnS1k1aHBkcjndcw5QkPTJrS37UeJSDvjdN\n"
+"zl/HHk484IkzlQsPpTLWPFp5LBk=\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                      //   O  = TrustCor Systems S. de R.L. OU = TrustCor Certificate Authority CN = TrustCor RootCert CA-2
+"MIIGLzCCBBegAwIBAgIIJaHfyjPLWQIwDQYJKoZIhvcNAQELBQAwgaQxCzAJBgNV\n"
+"BAYTAlBBMQ8wDQYDVQQIDAZQYW5hbWExFDASBgNVBAcMC1BhbmFtYSBDaXR5MSQw\n"
+"IgYDVQQKDBtUcnVzdENvciBTeXN0ZW1zIFMuIGRlIFIuTC4xJzAlBgNVBAsMHlRy\n"
+"dXN0Q29yIENlcnRpZmljYXRlIEF1dGhvcml0eTEfMB0GA1UEAwwWVHJ1c3RDb3Ig\n"
+"Um9vdENlcnQgQ0EtMjAeFw0xNjAyMDQxMjMyMjNaFw0zNDEyMzExNzI2MzlaMIGk\n"
+"MQswCQYDVQQGEwJQQTEPMA0GA1UECAwGUGFuYW1hMRQwEgYDVQQHDAtQYW5hbWEg\n"
+"Q2l0eTEkMCIGA1UECgwbVHJ1c3RDb3IgU3lzdGVtcyBTLiBkZSBSLkwuMScwJQYD\n"
+"VQQLDB5UcnVzdENvciBDZXJ0aWZpY2F0ZSBBdXRob3JpdHkxHzAdBgNVBAMMFlRy\n"
+"dXN0Q29yIFJvb3RDZXJ0IENBLTIwggIiMA0GCSqGSIb3DQEBAQUAA4ICDwAwggIK\n"
+"AoICAQCnIG7CKqJiJJWQdsg4foDSq8GbZQWU9MEKENUCrO2fk8eHyLAnK0IMPQo+\n"
+"QVqedd2NyuCb7GgypGmSaIwLgQ5WoD4a3SwlFIIvl9NkRvRUqdw6VC0xK5mC8tkq\n"
+"1+9xALgxpL56JAfDQiDyitSSBBtlVkxs1Pu2YVpHI7TYabS3OtB0PAx1oYxOdqHp\n"
+"2yqlO/rOsP9+aij9JxzIsekp8VduZLTQwRVtDr4uDkbIXvRR/u8OYzo7cbrPb1nK\n"
+"DOObXUm4TOJXsZiKQlecdu/vvdFoqNL0Cbt3Nb4lggjEFixEIFapRBF37120Hape\n"
+"az6LMvYHL1cEksr1/p3C6eizjkxLAjHZ5DxIgif3GIJ2SDpxsROhOdUuxTTCHWKF\n"
+"3wP+TfSvPd9cW436cOGlfifHhi5qjxLGhF5DUVCcGZt45vz27Ud+ez1m7xMTiF88\n"
+"oWP7+ayHNZ/zgp6kPwqcMWmLmaSISo5uZk3vFsQPeSghYA2FFn3XVDjxklb9tTNM\n"
+"g9zXEJ9L/cb4Qr26fHMC4P99zVvh1Kxhe1fVSntb1IVYJ12/+CtgrKAmrhQhJ8Z3\n"
+"mjOAPF5GP/fDsaOGM8boXg25NSyqRsGFAnWAoOsk+xWq5Gd/bnc/9ASKL3x74xdh\n"
+"8N0JqSDIvgmk0H5Ew7IwSjiqqewYmgeCK9u4nBit2uBGF6zPXQIDAQABo2MwYTAd\n"
+"BgNVHQ4EFgQU2f4hQG6UnrybPZx9mCAZ5YwwYrIwHwYDVR0jBBgwFoAU2f4hQG6U\n"
+"nrybPZx9mCAZ5YwwYrIwDwYDVR0TAQH/BAUwAwEB/zAOBgNVHQ8BAf8EBAMCAYYw\n"
+"DQYJKoZIhvcNAQELBQADggIBAJ5Fngw7tu/hOsh80QA9z+LqBrWyOrsGS2h60COX\n"
+"dKcs8AjYeVrXWoSK2BKaG9l9XE1wxaX5q+WjiYndAfrs3fnpkpfbsEZC89NiqpX+\n"
+"MWcUaViQCqoL7jcjx1BRtPV+nuN79+TMQjItSQzL/0kMmx40/W5ulop5A7Zv2wnL\n"
+"/V9lFDfhOPXzYRZY5LVtDQsEGz9QLX+zx3oaFoBg+Iof6Rsqxvm6ARppv9JYx1RX\n"
+"CI/hOWB3S6xZhBqI8d3LT3jX5+EzLfzuQfogsL7L9ziUwOHQhQ+77Sxzq+3+knYa\n"
+"ZH9bDTMJBzN7Bj8RpFxwPIXAz+OQqIN3+tvmxYxoZxBnpVIt8MSZj3+/0WvitUfW\n"
+"2dCFmU2Umw9Lje4AWkcdEQOsQRivh7dvDDqPys/cA8GiCcjl/YBeyGBCARsaU1q7\n"
+"N6a3vLqE6R5sGtRk2tRD/pOLS/IseRYQ1JMLiI+h2IYURpFHmygk71dSTlxCnKr3\n"
+"Sewn6EAes6aJInKc9Q0ztFijMDvd1GpUk74aTfOTlPf8hAs/hCBcNANExdqtvArB\n"
+"As8e5ZTZ845b2EzwnexhF7sUMlQMAimTHpKG9n/v55IFDlndmQguLvqcAFLTxWYp\n"
+"5KeXRKQOKIETNcX2b2TmQcTVL8w0RSXPQQCWPUouwpaYT05KnJe32x+SMsj/D1Fu\n"
+"1uwJ\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                      //   O  = Trustis Limited OU = Trustis FPS Root CA
+"MIIDZzCCAk+gAwIBAgIQGx+ttiD5JNM2a/fH8YygWTANBgkqhkiG9w0BAQUFADBF\n"
+"MQswCQYDVQQGEwJHQjEYMBYGA1UEChMPVHJ1c3RpcyBMaW1pdGVkMRwwGgYDVQQL\n"
+"ExNUcnVzdGlzIEZQUyBSb290IENBMB4XDTAzMTIyMzEyMTQwNloXDTI0MDEyMTEx\n"
+"MzY1NFowRTELMAkGA1UEBhMCR0IxGDAWBgNVBAoTD1RydXN0aXMgTGltaXRlZDEc\n"
+"MBoGA1UECxMTVHJ1c3RpcyBGUFMgUm9vdCBDQTCCASIwDQYJKoZIhvcNAQEBBQAD\n"
+"ggEPADCCAQoCggEBAMVQe547NdDfxIzNjpvto8A2mfRC6qc+gIMPpqdZh8mQRUN+\n"
+"AOqGeSoDvT03mYlmt+WKVoaTnGhLaASMk5MCPjDSNzoiYYkchU59j9WvezX2fihH\n"
+"iTHcDnlkH5nSW7r+f2C/revnPDgpai/lkQtV/+xvWNUtyd5MZnGPDNcE2gfmHhjj\n"
+"vSkCqPoc4Vu5g6hBSLwacY3nYuUtsuvffM/bq1rKMfFMIvMFE/eC+XN5DL7XSxzA\n"
+"0RU8k0Fk0ea+IxciAIleH2ulrG6nS4zto3Lmr2NNL4XSFDWaLk6M6jKYKIahkQlB\n"
+"OrTh4/L68MkKokHdqeMDx4gVOxzUGpTXn2RZEm0CAwEAAaNTMFEwDwYDVR0TAQH/\n"
+"BAUwAwEB/zAfBgNVHSMEGDAWgBS6+nEleYtXQSUhhgtx67JkDoshZzAdBgNVHQ4E\n"
+"FgQUuvpxJXmLV0ElIYYLceuyZA6LIWcwDQYJKoZIhvcNAQEFBQADggEBAH5Y//01\n"
+"GX2cGE+esCu8jowU/yyg2kdbw++BLa8F6nRIW/M+TgfHbcWzk88iNVy2P3UnXwmW\n"
+"zaD+vkAMXBJV+JOCyinpXj9WV4s4NvdFGkwozZ5BuO1WTISkQMi4sKUraXAEasP4\n"
+"1BIy+Q7DsdwyhEQsb8tGD+pmQQ9P8Vilpg0ND2HepZ5dfWWhPBfnqFVO76DH7cZE\n"
+"f1T1o+CP8HxVIo8ptoGj4W1OLBuAZ+ytIJ8MYmHVl/9D7S3B2l0pKoU/rGXuhg8F\n"
+"jZBf3+6f9L/uHfuY5H+QK4R4EA5sSVPvFVtlRkpdr7r7OnIdzfYliB6XzCGcKQEN\n"
+"ZetX2fNXlrtIzYE=\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                      //   O  = The USERTRUST Network CN = USERTrust RSA Certification Authority
+"MIIF3jCCA8agAwIBAgIQAf1tMPyjylGoG7xkDjUDLTANBgkqhkiG9w0BAQwFADCB\n"
+"iDELMAkGA1UEBhMCVVMxEzARBgNVBAgTCk5ldyBKZXJzZXkxFDASBgNVBAcTC0pl\n"
+"cnNleSBDaXR5MR4wHAYDVQQKExVUaGUgVVNFUlRSVVNUIE5ldHdvcmsxLjAsBgNV\n"
+"BAMTJVVTRVJUcnVzdCBSU0EgQ2VydGlmaWNhdGlvbiBBdXRob3JpdHkwHhcNMTAw\n"
+"MjAxMDAwMDAwWhcNMzgwMTE4MjM1OTU5WjCBiDELMAkGA1UEBhMCVVMxEzARBgNV\n"
+"BAgTCk5ldyBKZXJzZXkxFDASBgNVBAcTC0plcnNleSBDaXR5MR4wHAYDVQQKExVU\n"
+"aGUgVVNFUlRSVVNUIE5ldHdvcmsxLjAsBgNVBAMTJVVTRVJUcnVzdCBSU0EgQ2Vy\n"
+"dGlmaWNhdGlvbiBBdXRob3JpdHkwggIiMA0GCSqGSIb3DQEBAQUAA4ICDwAwggIK\n"
+"AoICAQCAEmUXNg7D2wiz0KxXDXbtzSfTTK1Qg2HiqiBNCS1kCdzOiZ/MPans9s/B\n"
+"3PHTsdZ7NygRK0faOca8Ohm0X6a9fZ2jY0K2dvKpOyuR+OJv0OwWIJAJPuLodMkY\n"
+"tJHUYmTbf6MG8YgYapAiPLz+E/CHFHv25B+O1ORRxhFnRghRy4YUVD+8M/5+bJz/\n"
+"Fp0YvVGONaanZshyZ9shZrHUm3gDwFA66Mzw3LyeTP6vBZY1H1dat//O+T23LLb2\n"
+"VN3I5xI6Ta5MirdcmrS3ID3KfyI0rn47aGYBROcBTkZTmzNg95S+UzeQc0PzMsNT\n"
+"79uq/nROacdrjGCT3sTHDN/hMq7MkztReJVni+49Vv4M0GkPGw/zJSZrM233bkf6\n"
+"c0Plfg6lZrEpfDKEY1WJxA3Bk1QwGROs0303p+tdOmw1XNtB1xLaqUkL39iAigmT\n"
+"Yo61Zs8liM2EuLE/pDkP2QKe6xJMlXzzawWpXhaDzLhn4ugTncxbgtNMs+1b/97l\n"
+"c6wjOy0AvzVVdAlJ2ElYGn+SNuZRkg7zJn0cTRe8yexDJtC/QV9AqURE9JnnV4ee\n"
+"UB9XVKg+/XRjL7FQZQnmWEIuQxpMtPAlR1n6BB6T1CZGSlCBst6+eLf8ZxXhyVeE\n"
+"Hg9j1uliutZfVS7qXMYoCAQlObgOK6nyTJccBz8NUvXt7y+CDwIDAQABo0IwQDAd\n"
+"BgNVHQ4EFgQUU3m/WqorSs9UgOHYm8Cd8rIDZsswDgYDVR0PAQH/BAQDAgEGMA8G\n"
+"A1UdEwEB/wQFMAMBAf8wDQYJKoZIhvcNAQEMBQADggIBAFzUfA3P9wF9QZllDHPF\n"
+"Up/L+M+ZBn8b2kMVn54CVVeWFPFSPCeHlCjtHzoBN6J2/FNQwISbxmtOuowhT6KO\n"
+"VWKR82kV2LyI48SqC/3vqOlLVSoGIG1VeCkZ7l8wXEskEVX/JJpuXior7gtNn3/3\n"
+"ATiUFJVDBwn7YKnuHKsSjKCaXqeYalltiz8I+8jRRa8YFWSQEg9zKC7F4iRO/Fjs\n"
+"8PRF/iKz6y+O0tlFYQXBl2+odnKPi4w2r78NBc5xjeambx9spnFixdjQg3IM8WcR\n"
+"iQycE0xyNN+81XHfqnHd4blsjDwSXWXavVcStkNr/+XeTWYRUc+ZruwXtuhxkYze\n"
+"Sf7dNXGiFSeUHM9h4ya7b6NnJSFd5t0dCy5oGzuCr+yDZ4XUmFF0sbmZgIn/f3gZ\n"
+"XHlKYC6SQK5MNyosycdiyA5d9zZbyuAlJQG03RoHnHcAP9Dc1ew91Pq7P8yF1m9/\n"
+"qS3fuQL39ZeatTXaw2ewh0qpKJ4jjv9cJ2vhsE/zB+4ALtRZh8tSQZXq9EfX7mRB\n"
+"VXyNWQKV3WKdwrnuWih0hKWbt5DHDAff9Yk2dDLWKMGwsAvgnEzDHNb842m1R0aB\n"
+"L6KCq9NjRHDEjf8tM7qtj3u1cIiuPhnPQCjY/MiQu12ZIvVS5ljFH4gxQ+6IHdfG\n"
+"jjxDah2nGN59PRbxYvnKkKj9\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                      //  O  = VeriSign, Inc OU = VeriSign Trust Network CN = VeriSign Class 3 Public Primary Certification Authority - G4
+"MIIDhDCCAwqgAwIBAgIQL4D+I4wOIg9IZxIokYesszAKBggqhkjOPQQDAzCByjEL\n"
+"MAkGA1UEBhMCVVMxFzAVBgNVBAoTDlZlcmlTaWduLCBJbmMuMR8wHQYDVQQLExZW\n"
+"ZXJpU2lnbiBUcnVzdCBOZXR3b3JrMTowOAYDVQQLEzEoYykgMjAwNyBWZXJpU2ln\n"
+"biwgSW5jLiAtIEZvciBhdXRob3JpemVkIHVzZSBvbmx5MUUwQwYDVQQDEzxWZXJp\n"
+"U2lnbiBDbGFzcyAzIFB1YmxpYyBQcmltYXJ5IENlcnRpZmljYXRpb24gQXV0aG9y\n"
+"aXR5IC0gRzQwHhcNMDcxMTA1MDAwMDAwWhcNMzgwMTE4MjM1OTU5WjCByjELMAkG\n"
+"A1UEBhMCVVMxFzAVBgNVBAoTDlZlcmlTaWduLCBJbmMuMR8wHQYDVQQLExZWZXJp\n"
+"U2lnbiBUcnVzdCBOZXR3b3JrMTowOAYDVQQLEzEoYykgMjAwNyBWZXJpU2lnbiwg\n"
+"SW5jLiAtIEZvciBhdXRob3JpemVkIHVzZSBvbmx5MUUwQwYDVQQDEzxWZXJpU2ln\n"
+"biBDbGFzcyAzIFB1YmxpYyBQcmltYXJ5IENlcnRpZmljYXRpb24gQXV0aG9yaXR5\n"
+"IC0gRzQwdjAQBgcqhkjOPQIBBgUrgQQAIgNiAASnVnp8Utpkmw4tXNherJI9/gHm\n"
+"GUo9FANL+mAnINmDiWn6VMaaGF5VKmTeBvaNSjutEDxlPZCIBIngMGGzrl0Bp3ve\n"
+"fLK+ymVhAIau2o970ImtTR1ZmkGxvEeA3J5iw/mjgbIwga8wDwYDVR0TAQH/BAUw\n"
+"AwEB/zAOBgNVHQ8BAf8EBAMCAQYwbQYIKwYBBQUHAQwEYTBfoV2gWzBZMFcwVRYJ\n"
+"aW1hZ2UvZ2lmMCEwHzAHBgUrDgMCGgQUj+XTGoasjY5rw8+AatRIGCx7GS4wJRYj\n"
+"aHR0cDovL2xvZ28udmVyaXNpZ24uY29tL3ZzbG9nby5naWYwHQYDVR0OBBYEFLMW\n"
+"kf3upm7ktS5Jj4d4gYDs5bG1MAoGCCqGSM49BAMDA2gAMGUCMGYhDBgmYFo4e1ZC\n"
+"4Kf8NoRRkSAsdk1DPcQdhCPQrNZ8NQbOzWm9kA3bbEhCHQ6qQgIxAJw9SDkjOVga\n"
+"FRJZap7v1VmyHVIsmXHNxynfGyphe3HR3vPA5Q06Sqotp9iGKt0uEA==\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                       //   O  = VeriSign, Inc. OU = VeriSign Trust Network CN = VeriSign Class 3 Public Primary Certification Authority - G5
+"MIIE0zCCA7ugAwIBAgIQGNrRniZ96LtKIVjNzGs7SjANBgkqhkiG9w0BAQUFADCB\n"
+"yjELMAkGA1UEBhMCVVMxFzAVBgNVBAoTDlZlcmlTaWduLCBJbmMuMR8wHQYDVQQL\n"
+"ExZWZXJpU2lnbiBUcnVzdCBOZXR3b3JrMTowOAYDVQQLEzEoYykgMjAwNiBWZXJp\n"
+"U2lnbiwgSW5jLiAtIEZvciBhdXRob3JpemVkIHVzZSBvbmx5MUUwQwYDVQQDEzxW\n"
+"ZXJpU2lnbiBDbGFzcyAzIFB1YmxpYyBQcmltYXJ5IENlcnRpZmljYXRpb24gQXV0\n"
+"aG9yaXR5IC0gRzUwHhcNMDYxMTA4MDAwMDAwWhcNMzYwNzE2MjM1OTU5WjCByjEL\n"
+"MAkGA1UEBhMCVVMxFzAVBgNVBAoTDlZlcmlTaWduLCBJbmMuMR8wHQYDVQQLExZW\n"
+"ZXJpU2lnbiBUcnVzdCBOZXR3b3JrMTowOAYDVQQLEzEoYykgMjAwNiBWZXJpU2ln\n"
+"biwgSW5jLiAtIEZvciBhdXRob3JpemVkIHVzZSBvbmx5MUUwQwYDVQQDEzxWZXJp\n"
+"U2lnbiBDbGFzcyAzIFB1YmxpYyBQcmltYXJ5IENlcnRpZmljYXRpb24gQXV0aG9y\n"
+"aXR5IC0gRzUwggEiMA0GCSqGSIb3DQEBAQUAA4IBDwAwggEKAoIBAQCvJAgIKXo1\n"
+"nmAMqudLO07cfLw8RRy7K+D+KQL5VwijZIUVJ/XxrcgxiV0i6CqqpkKzj/i5Vbex\n"
+"t0uz/o9+B1fs70PbZmIVYc9gDaTY3vjgw2IIPVQT60nKWVSFJuUrjxuf6/WhkcIz\n"
+"SdhDY2pSS9KP6HBRTdGJaXvHcPaz3BJ023tdS1bTlr8Vd6Gw9KIl8q8ckmcY5fQG\n"
+"BO+QueQA5N06tRn/Arr0PO7gi+s3i+z016zy9vA9r911kTMZHRxAy3QkGSGT2RT+\n"
+"rCpSx4/VBEnkjWNHiDxpg8v+R70rfk/Fla4OndTRQ8Bnc+MUCH7lP59zuDMKz10/\n"
+"NIeWiu5T6CUVAgMBAAGjgbIwga8wDwYDVR0TAQH/BAUwAwEB/zAOBgNVHQ8BAf8E\n"
+"BAMCAQYwbQYIKwYBBQUHAQwEYTBfoV2gWzBZMFcwVRYJaW1hZ2UvZ2lmMCEwHzAH\n"
+"BgUrDgMCGgQUj+XTGoasjY5rw8+AatRIGCx7GS4wJRYjaHR0cDovL2xvZ28udmVy\n"
+"aXNpZ24uY29tL3ZzbG9nby5naWYwHQYDVR0OBBYEFH/TZafC3ey78DAJ80M5+gKv\n"
+"MzEzMA0GCSqGSIb3DQEBBQUAA4IBAQCTJEowX2LP2BqYLz3q3JktvXf2pXkiOOzE\n"
+"p6B4Eq1iDkVwZMXnl2YtmAl+X6/WzChl8gGqCBpH3vn5fJJaCGkgDdk+bW48DW7Y\n"
+"5gaRQBi5+MHt39tBquCWIMnNZBU4gcmU7qKEKQsTb47bDN0lAtukixlE0kF6BWlK\n"
+"WE9gyn6CagsCqiUXObXbf+eEZSqVir2G3l6BFoMtEMze/aiCKm0oHw0LxOXnGiYZ\n"
+"4fQRbxC1lfznQgUy286dUV4otp6F01vvpX1FQHKOtw5rDgb7MzVIcbidJ4vEZV8N\n"
+"hnacRHr2lVz2XTIIM6RUthg/aFzyQkqFOFSDX9HoLPKsEdao7WNq\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                      //   O  = VeriSign, Inc. OU = VeriSign Trust Network CN = VeriSign Universal Root Certification Authority
+"MIIEuTCCA6GgAwIBAgIQQBrEZCGzEyEDDrvkEhrFHTANBgkqhkiG9w0BAQsFADCB\n"
+"vTELMAkGA1UEBhMCVVMxFzAVBgNVBAoTDlZlcmlTaWduLCBJbmMuMR8wHQYDVQQL\n"
+"ExZWZXJpU2lnbiBUcnVzdCBOZXR3b3JrMTowOAYDVQQLEzEoYykgMjAwOCBWZXJp\n"
+"U2lnbiwgSW5jLiAtIEZvciBhdXRob3JpemVkIHVzZSBvbmx5MTgwNgYDVQQDEy9W\n"
+"ZXJpU2lnbiBVbml2ZXJzYWwgUm9vdCBDZXJ0aWZpY2F0aW9uIEF1dGhvcml0eTAe\n"
+"Fw0wODA0MDIwMDAwMDBaFw0zNzEyMDEyMzU5NTlaMIG9MQswCQYDVQQGEwJVUzEX\n"
+"MBUGA1UEChMOVmVyaVNpZ24sIEluYy4xHzAdBgNVBAsTFlZlcmlTaWduIFRydXN0\n"
+"IE5ldHdvcmsxOjA4BgNVBAsTMShjKSAyMDA4IFZlcmlTaWduLCBJbmMuIC0gRm9y\n"
+"IGF1dGhvcml6ZWQgdXNlIG9ubHkxODA2BgNVBAMTL1ZlcmlTaWduIFVuaXZlcnNh\n"
+"bCBSb290IENlcnRpZmljYXRpb24gQXV0aG9yaXR5MIIBIjANBgkqhkiG9w0BAQEF\n"
+"AAOCAQ8AMIIBCgKCAQEAx2E3XrEBNNti1xWb/1hajCMj1mCOkdeQmIN65lgZOIzF\n"
+"9uVkhbSicfvtvbnazU0AtMgtc6XHaXGVHzk8skQHnOgO+k1KxCHfKWGPMiJhgsWH\n"
+"H26MfF8WIFFE0XBPV+rjHOPMee5Y2A7Cs0WTwCznmhcrewA3ekEzeOEz4vMQGn+H\n"
+"LL729fdC4uW/h2KJXwBL38Xd5HVEMkE6HnFuacsLdUYI0crSK5XQz/u5QGtkjFdN\n"
+"/BMReYTtXlT2NJ8IAfMQJQYXStrxHXpma5hgZqTZ79IugvHw7wnqRMkVauIDbjPT\n"
+"rJ9VAMf2CGqUuV/c4DPxhGD5WycRtPwW8rtWaoAljQIDAQABo4GyMIGvMA8GA1Ud\n"
+"EwEB/wQFMAMBAf8wDgYDVR0PAQH/BAQDAgEGMG0GCCsGAQUFBwEMBGEwX6FdoFsw\n"
+"WTBXMFUWCWltYWdlL2dpZjAhMB8wBwYFKw4DAhoEFI/l0xqGrI2Oa8PPgGrUSBgs\n"
+"exkuMCUWI2h0dHA6Ly9sb2dvLnZlcmlzaWduLmNvbS92c2xvZ28uZ2lmMB0GA1Ud\n"
+"DgQWBBS2d/ppSEefUxLVwuoHMnYH0ZcHGTANBgkqhkiG9w0BAQsFAAOCAQEASvj4\n"
+"sAPmLGd75JR3Y8xuTPl9Dg3cyLk1uXBPY/ok+myDjEedO2Pzmvl2MpWRsXe8rJq+\n"
+"seQxIcaBlVZaDrHC1LGmWazxY8u4TB1ZkErvkBYoH1quEPuBUDgMbMzxPcP1Y+Oz\n"
+"4yHJJDnp/RVmRvQbEdBNc6N9Rvk97ahfYtTxP/jgdFcrGJ2BtMQo2pSXpXDrrB2+\n"
+"BxHw1dvd5Yzw1TKwg+ZX4o+/vqGqvz0dtdQ46tewXDpPaj+PwGZsY6rp2aQW9IHR\n"
+"lRQOfc2VNNnSj3BzgXucfr2YYdhFh5iQxeuGMMY1v/D/w1WIg0vvBZIGcfK4mJO3\n"
+"7M2CYfE45k+XmCpajQ==\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                      //   OU = www.xrampsecurity.com O  = XRamp Security Services Inc CN = XRamp Global Certification Authority
+"MIIEMDCCAxigAwIBAgIQUJRs7Bjq1ZxN1ZfvdY+grTANBgkqhkiG9w0BAQUFADCB\n"
+"gjELMAkGA1UEBhMCVVMxHjAcBgNVBAsTFXd3dy54cmFtcHNlY3VyaXR5LmNvbTEk\n"
+"MCIGA1UEChMbWFJhbXAgU2VjdXJpdHkgU2VydmljZXMgSW5jMS0wKwYDVQQDEyRY\n"
+"UmFtcCBHbG9iYWwgQ2VydGlmaWNhdGlvbiBBdXRob3JpdHkwHhcNMDQxMTAxMTcx\n"
+"NDA0WhcNMzUwMTAxMDUzNzE5WjCBgjELMAkGA1UEBhMCVVMxHjAcBgNVBAsTFXd3\n"
+"dy54cmFtcHNlY3VyaXR5LmNvbTEkMCIGA1UEChMbWFJhbXAgU2VjdXJpdHkgU2Vy\n"
+"dmljZXMgSW5jMS0wKwYDVQQDEyRYUmFtcCBHbG9iYWwgQ2VydGlmaWNhdGlvbiBB\n"
+"dXRob3JpdHkwggEiMA0GCSqGSIb3DQEBAQUAA4IBDwAwggEKAoIBAQCYJB69FbS6\n"
+"38eMpSe2OAtp87ZOqCwuIR1cRN8hXX4jdP5efrRKt6atH67gBhbim1vZZ3RrXYCP\n"
+"KZ2GG9mcDZhtdhAoWORlsH9KmHmf4MMxfoArtYzAQDsRhtDLooY2YKTVMIJt2W7Q\n"
+"DxIEM5dfT2Fa8OT5kavnHTu86M/0ay00fOJIYRyO82FEzG+gSqmUsE3a56k0enI4\n"
+"qEHMPJQRfevIpoy3hsvKMzvZPTeL+3o+hiznc9cKV6xkmxnr9A8ECIqsAxcZZPRa\n"
+"JSKNNCyy9mgdEm3Tih4U2sSPpuIjhdV6Db1q4Ons7Be7QhtnqiXtRYMh/MHJfNVi\n"
+"PvryxS3T/dRlAgMBAAGjgZ8wgZwwEwYJKwYBBAGCNxQCBAYeBABDAEEwCwYDVR0P\n"
+"BAQDAgGGMA8GA1UdEwEB/wQFMAMBAf8wHQYDVR0OBBYEFMZPoj0GY4QJnM5i5ASs\n"
+"jVy16bYbMDYGA1UdHwQvMC0wK6ApoCeGJWh0dHA6Ly9jcmwueHJhbXBzZWN1cml0\n"
+"eS5jb20vWEdDQS5jcmwwEAYJKwYBBAGCNxUBBAMCAQEwDQYJKoZIhvcNAQEFBQAD\n"
+"ggEBAJEVOQMBG2f7Shz5CmBbodpNl2L5JFMn14JkTpAuw0kbK5rc/Kh4ZzXxHfAR\n"
+"vbdI4xD2Dd8/0sm2qlWkSLoC295ZLhVbO50WfUfXN+pfTXYSNrsf16GBBEYgoyxt\n"
+"qZ4Bfj8pzgCT3/3JknOJiWSe5yvkHJEs0rnOfc5vMZnT5r7SHpDwCRR5XCOrTdLa\n"
+"IR9NmXmd4c8nnxCbHIgNsIpkQTG4DmyQJKSbXHGPurt+HBvbaoAPIbzp26a3QPSy\n"
+"i6mx5O+aGtA9aZnuqCij4Tyz8LIRnM98QObd50N9otg6tamN8jSZxNQQ4Qb9CYQQ\n"
+"O+7ETPTsJ3xCwnR8gooJybQDJbw=\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                      //   O  = certSIGN  OU = certSIGN ROOT CA
+"MIIDODCCAiCgAwIBAgIGIAYFFnACMA0GCSqGSIb3DQEBBQUAMDsxCzAJBgNVBAYT\n"
+"AlJPMREwDwYDVQQKEwhjZXJ0U0lHTjEZMBcGA1UECxMQY2VydFNJR04gUk9PVCBD\n"
+"QTAeFw0wNjA3MDQxNzIwMDRaFw0zMTA3MDQxNzIwMDRaMDsxCzAJBgNVBAYTAlJP\n"
+"MREwDwYDVQQKEwhjZXJ0U0lHTjEZMBcGA1UECxMQY2VydFNJR04gUk9PVCBDQTCC\n"
+"ASIwDQYJKoZIhvcNAQEBBQADggEPADCCAQoCggEBALczuX7IJUqOtdu0KBuqV5Do\n"
+"0SLTZLrTk+jUrIZhQGpgV2hUhE28alQCBf/fm5oqrl0Hj0rDKH/v+yv6efHHrfAQ\n"
+"UySQi2bJqIirr1qjAOm+ukbuW3N7LBeCgV5iLKECZbO9xSsAfsT8AzNXDe3i+s5d\n"
+"RdY4zTW2ssHQnIFKquSyAVwdj1+ZxLGt24gh65AIgoDzMKND5pCCrlUoSe1b16kQ\n"
+"OA7+j0xbm0bqQfWwCHTD0IgztnzXdN/chNFDDnU5oSVAKOp4yw4sLjmdjItuFhwv\n"
+"JoIQ4uNllAoEwF73XVv4EOLQunpL+943AAAaWyjj0pxzPjKHmKHJUS/X3qwzs08C\n"
+"AwEAAaNCMEAwDwYDVR0TAQH/BAUwAwEB/zAOBgNVHQ8BAf8EBAMCAcYwHQYDVR0O\n"
+"BBYEFOCMm9slSbPxfIbWskKHC9BroNnkMA0GCSqGSIb3DQEBBQUAA4IBAQA+0hyJ\n"
+"LjX8+HXd5n9liPRyTMks1zJO890ZeUe9jjtbkw9QSSQTaxQGcu8J06Gh40CEyecY\n"
+"MnQ8SG4Pn0vU9x7Tk4ZkVJdjclDVVc/6IJMCopvDI5NOFlV2oHB5bc0hH88vLbwZ\n"
+"44gx+FkagQnIl6Z0x2DEW8xXjrJ1/RsCCdtZb3KTafcxQdaIOL+Hsr0Wefmq5L6I\n"
+"Jd1hJyMctTEHBDa0GpC9oHRxUIltvBTjD4au8as+x6AJzKNI0eDbZOeStc+vckNw\n"
+"i/nDhDwTqn6Sm1dTk/pwwpEOMfmbZ13pljheX7NzTogVZ96edhBiIL5VaZVDADlN\n"
+"9u6wWk5JRFRYX0KD\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                      //   O  = Chunghwa Telecom Co., Ltd. OU = ePKI Root Certification Authority
+"MIIFsDCCA5igAwIBAgIQFci9ZUdcr7iXAF7kBtK8nTANBgkqhkiG9w0BAQUFADBe\n"
+"MQswCQYDVQQGEwJUVzEjMCEGA1UECgwaQ2h1bmdod2EgVGVsZWNvbSBDby4sIEx0\n"
+"ZC4xKjAoBgNVBAsMIWVQS0kgUm9vdCBDZXJ0aWZpY2F0aW9uIEF1dGhvcml0eTAe\n"
+"Fw0wNDEyMjAwMjMxMjdaFw0zNDEyMjAwMjMxMjdaMF4xCzAJBgNVBAYTAlRXMSMw\n"
+"IQYDVQQKDBpDaHVuZ2h3YSBUZWxlY29tIENvLiwgTHRkLjEqMCgGA1UECwwhZVBL\n"
+"SSBSb290IENlcnRpZmljYXRpb24gQXV0aG9yaXR5MIICIjANBgkqhkiG9w0BAQEF\n"
+"AAOCAg8AMIICCgKCAgEA4SUP7o3biDN1Z82tH306Tm2d0y8U82N0ywEhajfqhFAH\n"
+"SyZbCUNsIZ5qyNUD9WBpj8zwIuQf5/dqIjG3LBXy4P4AakP/h2XGtRrBp0xtInAh\n"
+"ijHyl3SJCRImHJ7K2RKilTza6We/CKBk49ZCt0Xvl/T29de1ShUCWH2YWEtgvM3X\n"
+"DZoTM1PRYfl61dd4s5oz9wCGzh1NlDivqOx4UXCKXBCDUSH3ET00hl7lSM2XgYI1\n"
+"TBnsZfZrxQWh7kcT1rMhJ5QQCtkkO7q+RBNGMD+XPNjX12ruOzjjK9SXDrkb5wdJ\n"
+"fzcq+Xd4z1TtW0ado4AOkUPB1ltfFLqfpo0kR0BZv3I4sjZsN/+Z0V0OWQqraffA\n"
+"sgRFelQArr5T9rXn4fg8ozHSqf4hUmTFpmfwdQcGlBSBVcYn5AGPF8Fqcde+S/uU\n"
+"WH1+ETOxQvdibBjWzwloPn9s9h6PYq2lY9sJpx8iQkEeb5mKPtf5P0B6ebClAZLS\n"
+"nT0IFaUQAS2zMnaolQ2zepr7BxB4EW/hj8e6DyUadCrlHJhBmd8hh+iVBmoKs2pH\n"
+"dmX2Os+PYhcZewoozRrSgx4hxyy/vv9haLdnG7t4TY3OZ+XkwY63I2binZB1NJip\n"
+"NiuKmpS5nezMirH4JYlcWrYvjB9teSSnUmjDhDXiZo1jDiVN1Rmy5nk3pyKdVDEC\n"
+"AwEAAaNqMGgwHQYDVR0OBBYEFB4M97Zn8uGSJglFwFU5Lnc/QkqiMAwGA1UdEwQF\n"
+"MAMBAf8wOQYEZyoHAAQxMC8wLQIBADAJBgUrDgMCGgUAMAcGBWcqAwAABBRFsMLH\n"
+"ClZ87lt4DJX5GFPBphzYEDANBgkqhkiG9w0BAQUFAAOCAgEACbODU1kBPpVJufGB\n"
+"uvl2ICO1J2B01GqZNF5sAFPZn/KmsSQHRGoqxqWOeBLoR9lYGxMqXnmbnwoqZ6Yl\n"
+"PwZpVnPDimZI+ymBV3QGypzqKOg4ZyYr8dW1P2WT+DZdjo2NQCCHGervJ8A9tDkP\n"
+"JXtoUHRVnAxZfVo9QZQlUgjgRywVMRnVvwdVxrsStZf0X4OFunHB2WyBEXYKCrC/\n"
+"gpf36j36+uwtqSiUO1bd0lEursC9CBWMd1I0ltabrNMdjmEPNXubrjlpC2JgQCA2\n"
+"j6/7Nu4tCEoduL+bXPjqpRugc6bY+G7gMwRfaKonh+3ZwZCc7b3jajWvY9+rGNm6\n"
+"5ulK6lCKD2GTHuItGeIwlDWSXQ62B68ZgI9HkFFLLk3dheLSClIKF5r8GrBQAuUB\n"
+"o2M3IUxExJtRmREOc5wGj1QupyheRDmHVi03vYVElOEMSyycw5KFNGHLD7ibSkNS\n"
+"/jQ6fbjpKdx2qcgw+BRxgMYeNkh0IkFch4LoGHGLQYlE535YW6i4jRPpp2zDR+2z\n"
+"Gp1iro2C6pSe3VkQw63d4k3jMdXH7OjysP6SHhYKGvzZ8/gntsm+HbRsZJB/9OTE\n"
+"W9c3rkIO3aQab3yIVMUWbuF6aC74Or8NpDyJO3inTmODBCEIZ43ygknQW/2xzQ+D\n"
+"hNQ+IIX3Sj0rnP0qCglN6oH4EZw=\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                      //   O  = thawte, Inc. OU = Certification Services Division CN = thawte Primary Root CA
+"MIIEIDCCAwigAwIBAgIQNE7VVyDV7exJ9C/ON9srbTANBgkqhkiG9w0BAQUFADCB\n"
+"qTELMAkGA1UEBhMCVVMxFTATBgNVBAoTDHRoYXd0ZSwgSW5jLjEoMCYGA1UECxMf\n"
+"Q2VydGlmaWNhdGlvbiBTZXJ2aWNlcyBEaXZpc2lvbjE4MDYGA1UECxMvKGMpIDIw\n"
+"MDYgdGhhd3RlLCBJbmMuIC0gRm9yIGF1dGhvcml6ZWQgdXNlIG9ubHkxHzAdBgNV\n"
+"BAMTFnRoYXd0ZSBQcmltYXJ5IFJvb3QgQ0EwHhcNMDYxMTE3MDAwMDAwWhcNMzYw\n"
+"NzE2MjM1OTU5WjCBqTELMAkGA1UEBhMCVVMxFTATBgNVBAoTDHRoYXd0ZSwgSW5j\n"
+"LjEoMCYGA1UECxMfQ2VydGlmaWNhdGlvbiBTZXJ2aWNlcyBEaXZpc2lvbjE4MDYG\n"
+"A1UECxMvKGMpIDIwMDYgdGhhd3RlLCBJbmMuIC0gRm9yIGF1dGhvcml6ZWQgdXNl\n"
+"IG9ubHkxHzAdBgNVBAMTFnRoYXd0ZSBQcmltYXJ5IFJvb3QgQ0EwggEiMA0GCSqG\n"
+"SIb3DQEBAQUAA4IBDwAwggEKAoIBAQCsoPD7gFnUnMekz52hWXMJEEUMDSxuaPFs\n"
+"W0hoSVk3/AszGcJ3f8wQLZU0HObrTQmnHNK4yZc2AreJ1CRfBsDMRJSUjQJib+ta\n"
+"3RGNKJpchJAQeg29dGYvajig4tVUROsdB58Hum/u6f1OCyn1PoSgAfGcq/gcfomk\n"
+"6KHYcWUNo1F77rzSImANuVud37r8UVsLr5iy6S7pBOhih94ryNdOwUxkHt3Ph1i6\n"
+"Sk/KaAcdHJ1KxtUvkcx8cXIcxcBn6zL9yZJclNqFwJu/U30rCfSMnZEfl2pSy94J\n"
+"NqR32HuHUETVPm4pafs5SSYeCaWAe0At6+gnhcn+Yf1+5nyXHdWdAgMBAAGjQjBA\n"
+"MA8GA1UdEwEB/wQFMAMBAf8wDgYDVR0PAQH/BAQDAgEGMB0GA1UdDgQWBBR7W0XP\n"
+"r87Lev0xkhpqtvNG61dIUDANBgkqhkiG9w0BAQUFAAOCAQEAeRHAS7ORtvzw6WfU\n"
+"DW5FvlXok9LOAz/t2iWwHVfLHjp2oEzsUHboZHIMpKnxuIvW1oeEuzLlQRHAd9mz\n"
+"YJ3rG9XRbkREqaYB7FViHXe4XI5ISXycO1cRrK1zN44veFyQaEfZYGDm/Ac9IiAX\n"
+"xPcW6cTYcvnIc3zfFi8VqT79aie2oetaupgf1eNNZAqdE8hhuvU5HIe6uL17In/2\n"
+"/qxAeeWsEG89jxt5dovEN7MhGITlNgDrYyCZuen+MwS7QcjBAvlEYyCegc5C09Y/\n"
+"LHbTY5xZ3Y+m4Q6gLkH3LpVHz7z9M/P2C2F+fpErgUfCJzDupxBdN49cOSvkBPB7\n"
+"jVaMaA==\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                      //   O  = thawte, Inc. OU = (c) 2007 thawte, Inc. - For authorized use only CN = thawte Primary Root CA - G2
+"MIICiDCCAg2gAwIBAgIQNfwmXNmET8k9Jj1Xm67XVjAKBggqhkjOPQQDAzCBhDEL\n"
+"MAkGA1UEBhMCVVMxFTATBgNVBAoTDHRoYXd0ZSwgSW5jLjE4MDYGA1UECxMvKGMp\n"
+"IDIwMDcgdGhhd3RlLCBJbmMuIC0gRm9yIGF1dGhvcml6ZWQgdXNlIG9ubHkxJDAi\n"
+"BgNVBAMTG3RoYXd0ZSBQcmltYXJ5IFJvb3QgQ0EgLSBHMjAeFw0wNzExMDUwMDAw\n"
+"MDBaFw0zODAxMTgyMzU5NTlaMIGEMQswCQYDVQQGEwJVUzEVMBMGA1UEChMMdGhh\n"
+"d3RlLCBJbmMuMTgwNgYDVQQLEy8oYykgMjAwNyB0aGF3dGUsIEluYy4gLSBGb3Ig\n"
+"YXV0aG9yaXplZCB1c2Ugb25seTEkMCIGA1UEAxMbdGhhd3RlIFByaW1hcnkgUm9v\n"
+"dCBDQSAtIEcyMHYwEAYHKoZIzj0CAQYFK4EEACIDYgAEotWcgnuVnfFSeIf+iha/\n"
+"BebfowJPDQfGAFG6DAJSLSKkQjnE/o/qycG+1E3/n3qe4rF8mq2nhglzh9HnmuN6\n"
+"papu+7qzcMBniKI11KOasf2twu8x+qi58/sIxpHR+ymVo0IwQDAPBgNVHRMBAf8E\n"
+"BTADAQH/MA4GA1UdDwEB/wQEAwIBBjAdBgNVHQ4EFgQUmtgAMADna3+FGO6Lts6K\n"
+"DPgR4bswCgYIKoZIzj0EAwMDaQAwZgIxAN344FdHW6fmCsO99YCKlzUNG4k8VIZ3\n"
+"KMqh9HneteY4sPBlcIx/AlTCv//YoT7ZzwIxAMSNlPzcU9LcnXgWHxUzI1NS41ox\n"
+"XZ3Krr0TKUQNJ1uo52icEvdYPy5yAlejj6EULg==\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                      //   O  = thawte, Inc. OU = Certification Services Division CN = thawte Primary Root CA - G3
+"MIIEKjCCAxKgAwIBAgIQYAGXt0an6rS0mtZLL/eQ+zANBgkqhkiG9w0BAQsFADCB\n"
+"rjELMAkGA1UEBhMCVVMxFTATBgNVBAoTDHRoYXd0ZSwgSW5jLjEoMCYGA1UECxMf\n"
+"Q2VydGlmaWNhdGlvbiBTZXJ2aWNlcyBEaXZpc2lvbjE4MDYGA1UECxMvKGMpIDIw\n"
+"MDggdGhhd3RlLCBJbmMuIC0gRm9yIGF1dGhvcml6ZWQgdXNlIG9ubHkxJDAiBgNV\n"
+"BAMTG3RoYXd0ZSBQcmltYXJ5IFJvb3QgQ0EgLSBHMzAeFw0wODA0MDIwMDAwMDBa\n"
+"Fw0zNzEyMDEyMzU5NTlaMIGuMQswCQYDVQQGEwJVUzEVMBMGA1UEChMMdGhhd3Rl\n"
+"LCBJbmMuMSgwJgYDVQQLEx9DZXJ0aWZpY2F0aW9uIFNlcnZpY2VzIERpdmlzaW9u\n"
+"MTgwNgYDVQQLEy8oYykgMjAwOCB0aGF3dGUsIEluYy4gLSBGb3IgYXV0aG9yaXpl\n"
+"ZCB1c2Ugb25seTEkMCIGA1UEAxMbdGhhd3RlIFByaW1hcnkgUm9vdCBDQSAtIEcz\n"
+"MIIBIjANBgkqhkiG9w0BAQEFAAOCAQ8AMIIBCgKCAQEAsr8nLPvb2FvdeHsbnndm\n"
+"gcs+vHyu86YnmjSjaDFxODNi5PNxZnmxqWWjpYvVj2AtP0LMqmsywCPLLEHd5N/8\n"
+"YZzic7IilRFDGF/Eth9XbAoFWCLINkw6fKXRz4aviKdEAhN0cXMKQlkC+BsUa0Lf\n"
+"b1+6a4KinVvnSr0eAXLbS3ToO39/fR8EtCab4LRarEc9VbjXsCZSKAExQGbY2SS9\n"
+"9irY7CFJXJv2eul/VTV+lmuNk5Mny5K76qxAwJ/C+IDPXfRa3M50hqY+bAtTyr2S\n"
+"zhkGcuYMXDhpxwTWvGzOW/b3aJzcJRVIiKHpqfiYnODz1TEoYRFsZ5aNOZnLwkUk\n"
+"OQIDAQABo0IwQDAPBgNVHRMBAf8EBTADAQH/MA4GA1UdDwEB/wQEAwIBBjAdBgNV\n"
+"HQ4EFgQUrWyqlGCc7eT/+j4KdCtjA/e2Wb8wDQYJKoZIhvcNAQELBQADggEBABpA\n"
+"2JVlrAmSicY59BDlqQ5mU1143vokkbvnRFHfxhY0Cu9qRFHqKweKA3rD6z8KLFIW\n"
+"oCtDuSWQP3CpMyVtRRooOyfPqsMpQhvfO0zAMzRbQYi/aytlryjvsvXDqmbOe1bu\n"
+"t8jLZ8HJnBoYuMTDSQPxYA5QzUbF83d597YV4Djbxy8ooAw/dyZ02SUS2jHaGh7c\n"
+"KUGRIjxpp7sC8rZcJwOJ9Abqm+RyguOhCcHpABnTPtRwa7pxpqpYrvS76Wy274fM\n"
+"m7v/OeZWYdMKp8RcTGB7BXcmer/YB1IsYvdwY9k5vG8cwnncdimvzsUsZAReiDZu\n"
+"MdRAGmI0Nj81Aa6sY6A=\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                       //   O  = Dhimyotis OU = 0002 48146308100036 CN = Certigna Root CA
+"MIIGWzCCBEOgAwIBAgIRAMrpG4nxVQMNo+ZBbcTjpuEwDQYJKoZIhvcNAQELBQAw\n"
+"WjELMAkGA1UEBhMCRlIxEjAQBgNVBAoMCURoaW15b3RpczEcMBoGA1UECwwTMDAw\n"
+"MiA0ODE0NjMwODEwMDAzNjEZMBcGA1UEAwwQQ2VydGlnbmEgUm9vdCBDQTAeFw0x\n"
+"MzEwMDEwODMyMjdaFw0zMzEwMDEwODMyMjdaMFoxCzAJBgNVBAYTAkZSMRIwEAYD\n"
+"VQQKDAlEaGlteW90aXMxHDAaBgNVBAsMEzAwMDIgNDgxNDYzMDgxMDAwMzYxGTAX\n"
+"BgNVBAMMEENlcnRpZ25hIFJvb3QgQ0EwggIiMA0GCSqGSIb3DQEBAQUAA4ICDwAw\n"
+"ggIKAoICAQDNGDllGlmx6mQWDoyUJJV8g9PFOSbcDO8WV43X2KyjQn+Cyu3NW9sO\n"
+"ty3tRQgXstmzy9YXUnIo245Onoq2C/mehJpNdt4iKVzSs9IGPjA5qXSjklYcoW9M\n"
+"CiBtnyN6tMbaLOQdLNyzKNAT8kxOAkmhVECe5uUFoC2EyP+YbNDrihqECB63aCPu\n"
+"I9Vwzm1RaRDuoXrC0SIxwoKF0vJVdlB8JXrJhFwLrN1CTivngqIkicuQstDuI7pm\n"
+"TLtipPlTWmR7fJj6o0ieD5Wupxj0auwuA0Wv8HT4Ks16XdG+RCYyKfHx9WzMfgIh\n"
+"C59vpD++nVPiz32pLHxYGpfhPTc3GGYo0kDFUYqMwy3OU4gkWGQwFsWq4NYKpkDf\n"
+"ePb1BHxpE4S80dGnBs8B92jAqFe7OmGtBIyT46388NtEbVncSVmurJqZNjBBe3Yz\n"
+"IoejwpKGbvlw7q6Hh5UbxHq9MfPU0uWZ/75I7HX1eBYdpnDBfzwboZL7z8g81sWT\n"
+"Co/1VTp2lc5ZmIoJlXcymoO6LAQ6l73UL77XbJuiyn1tJslV1c/DeVIICZkHJC1k\n"
+"JWumIWmbat10TWuXekG9qxf5kBdIjzb5LdXF2+6qhUVB+s06RbFo5jZMm5BX7CO5\n"
+"hwjCxAnxl4YqKE3idMDaxIzb3+KhF1nOJFl0Mdp//TBt2dzhauH8XwIDAQABo4IB\n"
+"GjCCARYwDwYDVR0TAQH/BAUwAwEB/zAOBgNVHQ8BAf8EBAMCAQYwHQYDVR0OBBYE\n"
+"FBiHVuBud+4kNTxOc5of1uHieX4rMB8GA1UdIwQYMBaAFBiHVuBud+4kNTxOc5of\n"
+"1uHieX4rMEQGA1UdIAQ9MDswOQYEVR0gADAxMC8GCCsGAQUFBwIBFiNodHRwczov\n"
+"L3d3d3cuY2VydGlnbmEuZnIvYXV0b3JpdGVzLzBtBgNVHR8EZjBkMC+gLaArhilo\n"
+"dHRwOi8vY3JsLmNlcnRpZ25hLmZyL2NlcnRpZ25hcm9vdGNhLmNybDAxoC+gLYYr\n"
+"aHR0cDovL2NybC5kaGlteW90aXMuY29tL2NlcnRpZ25hcm9vdGNhLmNybDANBgkq\n"
+"hkiG9w0BAQsFAAOCAgEAlLieT/DjlQgi581oQfccVdV8AOItOoldaDgvUSILSo3L\n"
+"6btdPrtcPbEo/uRTVRPPoZAbAh1fZkYJMyjhDSSXcNMQH+pkV5a7XdrnxIxPTGRG\n"
+"HVyH41neQtGbqH6mid2PHMkwgu07nM3A6RngatgCdTer9zQoKJHyBApPNeNgJgH6\n"
+"0BGM+RFq7q89w1DTj18zeTyGqHNFkIwgtnJzFyO+B2XleJINugHA64wcZr+shncB\n"
+"lA2c5uk5jR+mUYyZDDl34bSb+hxnV29qao6pK0xXeXpXIs/NX2NGjVxZOob4Mkdi\n"
+"o2cNGJHc+6Zr9UhhcyNZjgKnvETq9Emd8VRY+WCv2hikLyhF3HqgiIZd8zvn/yk1\n"
+"gPxkQ5Tm4xxvvq0OKmOZK8l+hfZx6AYDlf7ej0gcWtSS6Cvu5zHbugRqh5jnxV/v\n"
+"faci9wHYTfmJ0A6aBVmknpjZbyvKcL5kwlWj9Omvw5Ip3IgWJJk8jSaYtlu3zM63\n"
+"Nwf9JtmYhST/WSMDmu2dnajkXjjO11INb9I/bbEFa0nOipFGc/T2L/Coc3cOZayh\n"
+"jWZSaX5LaAzHHjcng6WMxwLkFM1JAbBzs/3GkDpv0mztO+7skb6iQ12LAEpmJURw\n"
+"3kAP+HwV96LOPNdeE4yBFxgX0b3xdxA61GU5wSesVywlVP+i2k+KYTlerj1KjL0=\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                      //   O  = Entrust, Inc. OU = See www.entrust.net\/legal-terms CN = Entrust Root Certification Authority - G4
+"MIIGSzCCBDOgAwIBAgIRANm1Q3+vqTkPAAAAAFVlrVgwDQYJKoZIhvcNAQELBQAw\n"
+"gb4xCzAJBgNVBAYTAlVTMRYwFAYDVQQKEw1FbnRydXN0LCBJbmMuMSgwJgYDVQQL\n"
+"Ex9TZWUgd3d3LmVudHJ1c3QubmV0L2xlZ2FsLXRlcm1zMTkwNwYDVQQLEzAoYykg\n"
+"MjAxNSBFbnRydXN0LCBJbmMuIC0gZm9yIGF1dGhvcml6ZWQgdXNlIG9ubHkxMjAw\n"
+"BgNVBAMTKUVudHJ1c3QgUm9vdCBDZXJ0aWZpY2F0aW9uIEF1dGhvcml0eSAtIEc0\n"
+"MB4XDTE1MDUyNzExMTExNloXDTM3MTIyNzExNDExNlowgb4xCzAJBgNVBAYTAlVT\n"
+"MRYwFAYDVQQKEw1FbnRydXN0LCBJbmMuMSgwJgYDVQQLEx9TZWUgd3d3LmVudHJ1\n"
+"c3QubmV0L2xlZ2FsLXRlcm1zMTkwNwYDVQQLEzAoYykgMjAxNSBFbnRydXN0LCBJ\n"
+"bmMuIC0gZm9yIGF1dGhvcml6ZWQgdXNlIG9ubHkxMjAwBgNVBAMTKUVudHJ1c3Qg\n"
+"Um9vdCBDZXJ0aWZpY2F0aW9uIEF1dGhvcml0eSAtIEc0MIICIjANBgkqhkiG9w0B\n"
+"AQEFAAOCAg8AMIICCgKCAgEAsewsQu7i0TD/pZJH4i3DumSXbcr3DbVZwbPLqGgZ\n"
+"2K+EbTBwXX7zLtJTmeH+H17ZSK9dE43b/2MzTdMAArzE+NEGCJR5WIoV3imz/f3E\n"
+"T+iq4qA7ec2/a0My3dl0ELn39GjUu9CH1apLiipvKgS1sqbHoHrmSKvS0VnM1n4j\n"
+"5pds8ELl3FFLFUHtSUrJ3hCX1nbB76W1NhSXNdh4IjVS70O92yfbYVaCNNzLiGAM\n"
+"C1rlLAHGVK/XqsEQe9IFWrhAnoanw5CGAlZSCXqc0ieCU0plUmr1POeo8pyvi73T\n"
+"DtTUXm6Hnmo9RR3RXRv06QqsYJn7ibT/mCzPfB3pAqoEmh643IhuJbNsZvc8kPNX\n"
+"wbMv9W3y+8qh+CmdRouzavbmZwe+LGcKKh9asj5XxNMhIWNlUpEbsZmOeX7m640A\n"
+"2Vqq6nPopIICR5b+W45UYaPrL0swsIsjdXJ8ITzI9vF01Bx7owVV7rtNOzK+mndm\n"
+"nqxpkCIHH2E6lr7lmk/MBTwoWdPBDFSoWWG9yHJM6Nyfh3+9nEg2XpWjDrk4JFX8\n"
+"dWbrAuMINClKxuMrLzOg2qOGpRKX/YAr2hRC45K9PvJdXmd0LhyIRyk0X+IyqJwl\n"
+"N4y6mACXi0mWHv0liqzc2thddG5msP9E36EYxr5ILzeUePiVSj9/E15dWf10hkNj\n"
+"c0kCAwEAAaNCMEAwDwYDVR0TAQH/BAUwAwEB/zAOBgNVHQ8BAf8EBAMCAQYwHQYD\n"
+"VR0OBBYEFJ84xFYjwznooHFs6FRM5Og6sb9nMA0GCSqGSIb3DQEBCwUAA4ICAQAS\n"
+"5UKme4sPDORGpbZgQIeMJX6tuGguW8ZAdjwD+MlZ9POrYs4QjbRaZIxowLByQzTS\n"
+"Gwv2LFPSypBLhmb8qoMi9IsabyZIrHZ3CL/FmFz0Jomee8O5ZDIBf9PD3Vht7LGr\n"
+"hFV0d4QEJ1JrhkzO3bll/9bGXp+aEJlLdWr+aumXIOTkdnrG0CSqkM0gkLpHZPt/\n"
+"B7NTeLUKYvJzQ85BK4FqLoUWlFPUa19yIqtRLULVAJyZv967lDtX/Zr1hstWO1uI\n"
+"AeV8KEsD+UmDfLJ/fOPtjqF/YFOOVZ1QNBIPt5d7bIdKROf1beyAN/BYGW5KaHbw\n"
+"H5Lk6rWS02FREAutp9lfx1/cH6NcjKF+m7ee01ZvZl4HliDtC3T7Zk6LERXpgUl+\n"
+"b7DUUH8i119lAg2m9IUe2K4GS0qn0jFmwvjO5QimpAKWRGhXxNUzzxkvFMSUHHuk\n"
+"2fCfDrGA4tGeEWSpiBE6doLlYsKA2KSD7ZPvfC+QsDJMlhVoSFLUmQjAJOgc47Ol\n"
+"IQ6SwJAfzyBfyjs4x7dtOvPmRLgOMWuIjnDrnBdSqEGULoe256YSxXXfW8AKbnuk\n"
+"5F6G+TaU33fD6Q3AOfF5u0aOq0NZJ7cguyPpVkAh7DE9ZapD8j3fcEThuk0mEDuY\n"
+"n/PIjhs4ViFqUZPTkcpG2om3PVODLAgfi49T3f+sHw==\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                      //   O  = Google Trust Services LLC CN = GTS Root R1
+"MIIFWjCCA0KgAwIBAgIQbkepxUtHDA3sM9CJuRz04TANBgkqhkiG9w0BAQwFADBH\n"
+"MQswCQYDVQQGEwJVUzEiMCAGA1UEChMZR29vZ2xlIFRydXN0IFNlcnZpY2VzIExM\n"
+"QzEUMBIGA1UEAxMLR1RTIFJvb3QgUjEwHhcNMTYwNjIyMDAwMDAwWhcNMzYwNjIy\n"
+"MDAwMDAwWjBHMQswCQYDVQQGEwJVUzEiMCAGA1UEChMZR29vZ2xlIFRydXN0IFNl\n"
+"cnZpY2VzIExMQzEUMBIGA1UEAxMLR1RTIFJvb3QgUjEwggIiMA0GCSqGSIb3DQEB\n"
+"AQUAA4ICDwAwggIKAoICAQC2EQKLHuOhd5s73L+UPreVp0A8of2C+X0yBoJx9vaM\n"
+"f/vo27xqLpeXo4xL+Sv2sfnOhB2x+cWX3u+58qPpvBKJXqeqUqv4IyfLpLGcY9vX\n"
+"mX7wCl7raKb0xlpHDU0QM+NOsROjyBhsS+z8CZDfnWQpJSMHobTSPS5g4M/SCYe7\n"
+"zUjwTcLCeoiKu7rPWRnWr4+wB7CeMfGCwcDfLqZtbBkOtdh+JhpFAz2weaSUKK0P\n"
+"fyblqAj+lug8aJRT7oM6iCsVlgmy4HqMLnXWnOunVmSPlk9orj2XwoSPwLxAwAtc\n"
+"vfaHszVsrBhQf4TgTM2S0yDpM7xSma8ytSmzJSq0SPly4cpk9+aCEI3oncKKiPo4\n"
+"Zor8Y/kB+Xj9e1x3+naH+uzfsQ55lVe0vSbv1gHR6xYKu44LtcXFilWr06zqkUsp\n"
+"zBmkMiVOKvFlRNACzqrOSbTqn3yDsEB750Orp2yjj32JgfpMpf/VjsPOS+C12LOO\n"
+"Rc92wO1AK/1TD7Cn1TsNsYqiA94xrcx36m97PtbfkSIS5r762DL8EGMUUXLeXdYW\n"
+"k70paDPvOmbsB4om3xPXV2V4J95eSRQAogB/mqghtqmxlbCluQ0WEdrHbEg8QOB+\n"
+"DVrNVjzRlwW5y0vtOUucxD/SVRNuJLDWcfr0wbrM7Rv1/oFB2ACYPTrIrnqYNxgF\n"
+"lQIDAQABo0IwQDAOBgNVHQ8BAf8EBAMCAQYwDwYDVR0TAQH/BAUwAwEB/zAdBgNV\n"
+"HQ4EFgQU5K8rJnEaK0gnhS9SZizv8IkTcT4wDQYJKoZIhvcNAQEMBQADggIBADiW\n"
+"Cu49tJYeX++dnAsznyvgyv3SjgofQXSlfKqE1OXyHuY3UjKcC9FhHb8owbZEKTV1\n"
+"d5iyfNm9dKyKaOOpMQkpAWBz40d8U6iQSifvS9efk+eCNs6aaAyC58/UEBZvXw6Z\n"
+"XPYfcX3v73svfuo21pdwCxXu11xWajOl40k4DLh9+42FpLFZXvRq4d2h9mREruZR\n"
+"gyFmxhE+885H7pwoHyXa/6xmld01D1zvICxi/ZG6qcz8WpyTgYMpl0p8WnK0OdC3\n"
+"d8t5/Wk6kjftbjhlRn7pYL15iJdfOBL07q9bgsiG1eGZbYwE8na6SfZu6W0eX6Dv\n"
+"J4J2QPim01hcDyxC2kLGe4g0x8HYRZvBPsVhHdljUEn2NIVq4BjFbkerQUIpm/Zg\n"
+"DdIx02OYI5NaAIFItO/Nis3Jz5nu2Z6qNuFoS3FJFDYoOj0dzpqPJeaAcWErtXvM\n"
+"+SUWgeExX6GjfhaknBZqlxi9dnKlC54dNuYvoS++cJEPqOba+MSSQGwlfnuzCdyy\n"
+"F62ARPBopY+Udf90WuioAnwMCeKpSwughQtiue+hMZL77/ZRBIls6Kl0obsXs7X9\n"
+"SQ98POyDGCBDTtWTurQ0sR8WNh8M5mQ5Fkzc4P4dyKliPUDqysU0ArSuiYgzNdws\n"
+"E3PYJ/HQcu51OyLemGhmW/HGY0dVHLqlCFF1pkgl\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                      //   O  = Google Trust Services LLC CN = GTS Root R2
+"MIIFWjCCA0KgAwIBAgIQbkepxlqz5yDFMJo/aFLybzANBgkqhkiG9w0BAQwFADBH\n"
+"MQswCQYDVQQGEwJVUzEiMCAGA1UEChMZR29vZ2xlIFRydXN0IFNlcnZpY2VzIExM\n"
+"QzEUMBIGA1UEAxMLR1RTIFJvb3QgUjIwHhcNMTYwNjIyMDAwMDAwWhcNMzYwNjIy\n"
+"MDAwMDAwWjBHMQswCQYDVQQGEwJVUzEiMCAGA1UEChMZR29vZ2xlIFRydXN0IFNl\n"
+"cnZpY2VzIExMQzEUMBIGA1UEAxMLR1RTIFJvb3QgUjIwggIiMA0GCSqGSIb3DQEB\n"
+"AQUAA4ICDwAwggIKAoICAQDO3v2m++zsFDQ8BwZabFn3GTXd98GdVarTzTukk3Lv\n"
+"CvptnfbwhYBboUhSnznFt+4orO/LdmgUud+tAWyZH8QiHZ/+cnfgLFuv5AS/T3Kg\n"
+"GjSY6Dlo7JUle3ah5mm5hRm9iYz+re026nO8/4Piy33B0s5Ks40FnotJk9/BW9Bu\n"
+"XvAuMC6C/Pq8tBcKSOWIm8Wba96wyrQD8Nr0kLhlZPdcTK3ofmZemde4wj7I0BOd\n"
+"re7kRXuJVfeKH2JShBKzwkCX44ofR5GmdFrS+LFjKBC4swm4VndAoiaYecb+3yXu\n"
+"PuWgf9RhD1FLPD+M2uFwdNjCaKH5wQzpoeJ/u1U8dgbuak7MkogwTZq9TwtImoS1\n"
+"mKPV+3PBV2HdKFZ1E66HjucMUQkQdYhMvI35ezzUIkgfKtzra7tEscszcTJGr61K\n"
+"8YzodDqs5xoic4DSMPclQsciOzsSrZYuxsN2B6ogtzVJV+mSSeh2FnIxZyuWfoqj\n"
+"x5RWIr9qS34BIbIjMt/kmkRtWVtd9QCgHJvGeJeNkP+byKq0rxFROV7Z+2et1VsR\n"
+"nTKaG73VululycslaVNVJ1zgyjbLiGH7HrfQy+4W+9OmTN6SpdTi3/UGVN4unUu0\n"
+"kzCqgc7dGtxRcw1PcOnlthYhGXmy5okLdWTK1au8CcEYof/UVKGFPP0UJAOyh9Ok\n"
+"twIDAQABo0IwQDAOBgNVHQ8BAf8EBAMCAQYwDwYDVR0TAQH/BAUwAwEB/zAdBgNV\n"
+"HQ4EFgQUu//KjiOfT5nK2+JopqUVJxce2Q4wDQYJKoZIhvcNAQEMBQADggIBALZp\n"
+"8KZ3/p7uC4Gt4cCpx/k1HUCCq+YEtN/L9x0Pg/B+E02NjO7jMyLDOfxA325BS0JT\n"
+"vhaI8dI4XsRomRyYUpOM52jtG2pzegVATX9lO9ZY8c6DR2Dj/5epnGB3GFW1fgiT\n"
+"z9D2PGcDFWEJ+YF59exTpJ/JjwGLc8R3dtyDovUMSRqodt6Sm2T4syzFJ9MHwAiA\n"
+"pJiS4wGWAqoC7o87xdFtCjMwc3i5T1QWvwsHoaRc5svJXISPD+AVdyx+Jn7axEvb\n"
+"pxZ3B7DNdehyQtaVhJ2Gg/LkkM0JR9SLA3DaWsYDQvTtN6LwG1BUSw7YhN4ZKJmB\n"
+"R64JGz9I0cNv4rBgF/XuIwKl2gBbbZCr7qLpGzvpx0QnRY5rn/WkhLx3+WuXrD5R\n"
+"RaIRpsyF7gpo8j5QOHokYh4XIDdtak23CZvJ/KRY9bb7nE4Yu5UC56GtmwfuNmsk\n"
+"0jmGwZODUNKBRqhfYlcsu2xkiAhu7xNUX90txGdj08+JN7+dIPT7eoOboB6BAFDC\n"
+"5AwiWVIQ7UNWhwD4FFKnHYuTjKJNRn8nxnGbJN7k2oaLDX5rIMHAnuFl2GqjpuiF\n"
+"izoHCBy69Y9Vmhh1fuXsgWbRIXOhNUQLgD1bnF5vKheW0YMjiGZt5obicDIvUiLn\n"
+"yOd/xCxgXS/Dr55FBcOEArf9LAhST4Ldo/DUhgkC\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                      //   O  = Google Trust Services LLC CN = GTS Root R3
+"MIICDDCCAZGgAwIBAgIQbkepx2ypcyRAiQ8DVd2NHTAKBggqhkjOPQQDAzBHMQsw\n"
+"CQYDVQQGEwJVUzEiMCAGA1UEChMZR29vZ2xlIFRydXN0IFNlcnZpY2VzIExMQzEU\n"
+"MBIGA1UEAxMLR1RTIFJvb3QgUjMwHhcNMTYwNjIyMDAwMDAwWhcNMzYwNjIyMDAw\n"
+"MDAwWjBHMQswCQYDVQQGEwJVUzEiMCAGA1UEChMZR29vZ2xlIFRydXN0IFNlcnZp\n"
+"Y2VzIExMQzEUMBIGA1UEAxMLR1RTIFJvb3QgUjMwdjAQBgcqhkjOPQIBBgUrgQQA\n"
+"IgNiAAQfTzOHMymKoYTey8chWEGJ6ladK0uFxh1MJ7x/JlFyb+Kf1qPKzEUURout\n"
+"736GjOyxfi//qXGdGIRFBEFVbivqJn+7kAHjSxm65FSWRQmx1WyRRK2EE46ajA2A\n"
+"DDL24CejQjBAMA4GA1UdDwEB/wQEAwIBBjAPBgNVHRMBAf8EBTADAQH/MB0GA1Ud\n"
+"DgQWBBTB8Sa6oC2uhYHP0/EqEr24Cmf9vDAKBggqhkjOPQQDAwNpADBmAjEAgFuk\n"
+"fCPAlaUs3L6JbyO5o91lAFJekazInXJ0glMLfalAvWhgxeG4VDvBNhcl2MG9AjEA\n"
+"njWSdIUlUfUk7GRSJFClH9voy8l27OyCbvWFGFPouOOaKaqW04MjyaR7YbPMAuhd\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                      //  O  = Google Trust Services LLC CN = GTS Root R4
+"MIICCjCCAZGgAwIBAgIQbkepyIuUtui7OyrYorLBmTAKBggqhkjOPQQDAzBHMQsw\n"
+"CQYDVQQGEwJVUzEiMCAGA1UEChMZR29vZ2xlIFRydXN0IFNlcnZpY2VzIExMQzEU\n"
+"MBIGA1UEAxMLR1RTIFJvb3QgUjQwHhcNMTYwNjIyMDAwMDAwWhcNMzYwNjIyMDAw\n"
+"MDAwWjBHMQswCQYDVQQGEwJVUzEiMCAGA1UEChMZR29vZ2xlIFRydXN0IFNlcnZp\n"
+"Y2VzIExMQzEUMBIGA1UEAxMLR1RTIFJvb3QgUjQwdjAQBgcqhkjOPQIBBgUrgQQA\n"
+"IgNiAATzdHOnaItgrkO4NcWBMHtLSZ37wWHO5t5GvWvVYRg1rkDdc/eJkTBa6zzu\n"
+"hXyiQHY7qca4R9gq55KRanPpsXI5nymfopjTX15YhmUPoYRlBtHci8nHc8iMai/l\n"
+"xKvRHYqjQjBAMA4GA1UdDwEB/wQEAwIBBjAPBgNVHRMBAf8EBTADAQH/MB0GA1Ud\n"
+"DgQWBBSATNbrdP9JNqPV2Py1PsVq8JQdjDAKBggqhkjOPQQDAwNnADBkAjBqUFJ0\n"
+"CMRw3J5QdCHojXohw0+WbhXRIjVhLfoIN+4Zba3bssx9BzT1YBkstTTZbyACMANx\n"
+"sbqjYAuG7ZoIapVon+Kz4ZNkfF6Tpt95LY2F45TPI11xzPKwTdb+mciUqXWi4w==\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                      //   O  = Hongkong Post CN = Hongkong Post Root CA 3
+"MIIFzzCCA7egAwIBAgIUCBZfikyl7ADJk0DfxMauI7gcWqQwDQYJKoZIhvcNAQEL\n"
+"BQAwbzELMAkGA1UEBhMCSEsxEjAQBgNVBAgTCUhvbmcgS29uZzESMBAGA1UEBxMJ\n"
+"SG9uZyBLb25nMRYwFAYDVQQKEw1Ib25na29uZyBQb3N0MSAwHgYDVQQDExdIb25n\n"
+"a29uZyBQb3N0IFJvb3QgQ0EgMzAeFw0xNzA2MDMwMjI5NDZaFw00MjA2MDMwMjI5\n"
+"NDZaMG8xCzAJBgNVBAYTAkhLMRIwEAYDVQQIEwlIb25nIEtvbmcxEjAQBgNVBAcT\n"
+"CUhvbmcgS29uZzEWMBQGA1UEChMNSG9uZ2tvbmcgUG9zdDEgMB4GA1UEAxMXSG9u\n"
+"Z2tvbmcgUG9zdCBSb290IENBIDMwggIiMA0GCSqGSIb3DQEBAQUAA4ICDwAwggIK\n"
+"AoICAQCziNfqzg8gTr7m1gNt7ln8wlffKWihgw4+aMdoWJwcYEuJQwy51BWy7sFO\n"
+"dem1p+/l6TWZ5Mwc50tfjTMwIDNT2aa71T4Tjukfh0mtUC1Qyhi+AViiE3CWu4mI\n"
+"VoBc+L0sPOFMV4i707mV78vH9toxdCim5lSJ9UExyuUmGs2C4HDaOym71QP1mbpV\n"
+"9WTRYA6ziUm4ii8F0oRFKHyPaFASePwLtVPLwpgchKOesL4jpNrcyCse2m5FHomY\n"
+"2vkALgbpDDtw1VAliJnLzXNg99X/NWfFobxeq81KuEXryGgeDQ0URhLj0mRiikKY\n"
+"vLTGCAj4/ahMZJx2Ab0vqWwzD9g/KLg8aQFChn5pwckGyuV6RmXpwtZQQS4/t+Tt\n"
+"bNe/JgERohYpSms0BpDsE9K2+2p20jzt8NYt3eEV7KObLyzJPivkaTv/ciWxNoZb\n"
+"x39ri1UbSsUgYT2uy1DhCDq+sI9jQVMwCFk8mB13umOResoQUGC/8Ne8lYePl8X+\n"
+"l2oBlKN8W4UdKjk60FSh0Tlxnf0h+bV78OLgAo9uliQlLKAeLKjEiafv7ZkGL7YK\n"
+"TE/bosw3Gq9HhS2KX8Q0NEwA/RiTZxPRN+ZItIsGxVd7GYYKecsAyVKvQv83j+Gj\n"
+"Hno9UKtjBucVtT+2RTeUN7F+8kjDf8V1/peNRY8apxpyKBpADwIDAQABo2MwYTAP\n"
+"BgNVHRMBAf8EBTADAQH/MA4GA1UdDwEB/wQEAwIBBjAfBgNVHSMEGDAWgBQXnc0e\n"
+"i9Y5K3DTXNSguB+wAPzFYTAdBgNVHQ4EFgQUF53NHovWOStw01zUoLgfsAD8xWEw\n"
+"DQYJKoZIhvcNAQELBQADggIBAFbVe27mIgHSQpsY1Q7XZiNc4/6gx5LS6ZStS6LG\n"
+"7BJ8dNVI0lkUmcDrudHr9EgwW62nV3OZqdPlt9EuWSRY3GguLmLYauRwCy0gUCCk\n"
+"MpXRAJi70/33MvJJrsZ64Ee+bs7Lo3I6LWldy8joRTnU+kLBEUx3XZL7av9YROXr\n"
+"gZ6voJmtvqkBZss4HTzfQx/0TW60uhdG/H39h4F5ag0zD/ov+BS5gLNdTaqX4fnk\n"
+"GMX41TiMJjz98iji7lpJiCzfeT2OnpA8vUFKOt1b9pq0zj8lMH8yfaIDlNDceqFS\n"
+"3m6TjRgm/VWsvY+b0s+v54Ysyx8Jb6NvqYTUc79NoXQbTiNg8swOqn+knEwlqLJm\n"
+"Ozj/2ZQw9nKEvmhVEA/GcywWaZMH/rFF7buiVWqw2rVKAiUnhde3t4ZEFolsgCs+\n"
+"l6mc1X5VTMbeRRAc6uk7nwNT7u56AQIWeNTowr5GdogTPyK7SBIdUgC0An4hGh6c\n"
+"JfTzPV4e0hz5sy229zdcxsshTrD3mUcYhcErulWuBurQB7Lcq9CClnXO0lD+mefP\n"
+"L5/ndtFhKvshuzHQqp9HpLIiyhY6UFfEW0NnxWViA0kB60PZ2Pierc+xYw5F9KBa\n"
+"LJstxabArahH9CdMOA0uG0k7UvToiIMrVCjU8jVStDKDYmlkDJGcn5fqdBb9HxEG\n"
+"mpv0\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                      //   O  = Microsoft Corporation CN = Microsoft ECC Root Certificate Authority 2017
+"MIICWTCCAd+gAwIBAgIQZvI9r4fei7FK6gxXMQHC7DAKBggqhkjOPQQDAzBlMQsw\n"
+"CQYDVQQGEwJVUzEeMBwGA1UEChMVTWljcm9zb2Z0IENvcnBvcmF0aW9uMTYwNAYD\n"
+"VQQDEy1NaWNyb3NvZnQgRUNDIFJvb3QgQ2VydGlmaWNhdGUgQXV0aG9yaXR5IDIw\n"
+"MTcwHhcNMTkxMjE4MjMwNjQ1WhcNNDIwNzE4MjMxNjA0WjBlMQswCQYDVQQGEwJV\n"
+"UzEeMBwGA1UEChMVTWljcm9zb2Z0IENvcnBvcmF0aW9uMTYwNAYDVQQDEy1NaWNy\n"
+"b3NvZnQgRUNDIFJvb3QgQ2VydGlmaWNhdGUgQXV0aG9yaXR5IDIwMTcwdjAQBgcq\n"
+"hkjOPQIBBgUrgQQAIgNiAATUvD0CQnVBEyPNgASGAlEvaqiBYgtlzPbKnR5vSmZR\n"
+"ogPZnZH6thaxjG7efM3beaYvzrvOcS/lpaso7GMEZpn4+vKTEAXhgShC48Zo9OYb\n"
+"hGBKia/teQ87zvH2RPUBeMCjVDBSMA4GA1UdDwEB/wQEAwIBhjAPBgNVHRMBAf8E\n"
+"BTADAQH/MB0GA1UdDgQWBBTIy5lycFIM+Oa+sgRXKSrPQhDtNTAQBgkrBgEEAYI3\n"
+"FQEEAwIBADAKBggqhkjOPQQDAwNoADBlAjBY8k3qDPlfXu5gKcs68tvWMoQZP3zV\n"
+"L8KxzJOuULsJMsbG7X7JNpQS5GiFBqIb0C8CMQCZ6Ra0DvpWSNSkMBaReNtUjGUB\n"
+"iudQZsIxtzm6uBoiB078a1QWIP8rtedMDE2mT3M=\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                      //   O  = Microsoft Corporation CN = Microsoft RSA Root Certificate Authority 2017
+"MIIFqDCCA5CgAwIBAgIQHtOXCV/YtLNHcB6qvn9FszANBgkqhkiG9w0BAQwFADBl\n"
+"MQswCQYDVQQGEwJVUzEeMBwGA1UEChMVTWljcm9zb2Z0IENvcnBvcmF0aW9uMTYw\n"
+"NAYDVQQDEy1NaWNyb3NvZnQgUlNBIFJvb3QgQ2VydGlmaWNhdGUgQXV0aG9yaXR5\n"
+"IDIwMTcwHhcNMTkxMjE4MjI1MTIyWhcNNDIwNzE4MjMwMDIzWjBlMQswCQYDVQQG\n"
+"EwJVUzEeMBwGA1UEChMVTWljcm9zb2Z0IENvcnBvcmF0aW9uMTYwNAYDVQQDEy1N\n"
+"aWNyb3NvZnQgUlNBIFJvb3QgQ2VydGlmaWNhdGUgQXV0aG9yaXR5IDIwMTcwggIi\n"
+"MA0GCSqGSIb3DQEBAQUAA4ICDwAwggIKAoICAQDKW76UM4wplZEWCpW9R2LBifOZ\n"
+"Nt9GkMml7Xhqb0eRaPgnZ1AzHaGm++DlQ6OEAlcBXZxIQIJTELy/xztokLaCLeX0\n"
+"ZdDMbRnMlfl7rEqUrQ7eS0MdhweSE5CAg2Q1OQT85elss7YfUJQ4ZVBcF0a5toW1\n"
+"HLUX6NZFndiyJrDKxHBKrmCk3bPZ7Pw71VdyvD/IybLeS2v4I2wDwAW9lcfNcztm\n"
+"gGTjGqwu+UcF8ga2m3P1eDNbx6H7JyqhtJqRjJHTOoI+dkC0zVJhUXAoP8XFWvLJ\n"
+"jEm7FFtNyP9nTUwSlq31/niol4fX/V4ggNyhSyL71Imtus5Hl0dVe49FyGcohJUc\n"
+"aDDv70ngNXtk55iwlNpNhTs+VcQor1fznhPbRiefHqJeRIOkpcrVE7NLP8TjwuaG\n"
+"YaRSMLl6IE9vDzhTyzMMEyuP1pq9KsgtsRx9S1HKR9FIJ3Jdh+vVReZIZZ2vUpC6\n"
+"W6IYZVcSn2i51BVrlMRpIpj0M+Dt+VGOQVDJNE92kKz8OMHY4Xu54+OU4UZpyw4K\n"
+"UGsTuqwPN1q3ErWQgR5WrlcihtnJ0tHXUeOrO8ZV/R4O03QK0dqq6mm4lyiPSMQH\n"
+"+FJDOvTKVTUssKZqwJz58oHhEmrARdlns87/I6KJClTUFLkqqNfs+avNJVgyeY+Q\n"
+"W5g5xAgGwax/Dj0ApQIDAQABo1QwUjAOBgNVHQ8BAf8EBAMCAYYwDwYDVR0TAQH/\n"
+"BAUwAwEB/zAdBgNVHQ4EFgQUCctZf4aycI8awznjwNnpv7tNsiMwEAYJKwYBBAGC\n"
+"NxUBBAMCAQAwDQYJKoZIhvcNAQEMBQADggIBAKyvPl3CEZaJjqPnktaXFbgToqZC\n"
+"LgLNFgVZJ8og6Lq46BrsTaiXVq5lQ7GPAJtSzVXNUzltYkyLDVt8LkS/gxCP81OC\n"
+"gMNPOsduET/m4xaRhPtthH80dK2Jp86519efhGSSvpWhrQlTM93uCupKUY5vVau6\n"
+"tZRGrox/2KJQJWVggEbbMwSubLWYdFQl3JPk+ONVFT24bcMKpBLBaYVu32TxU5nh\n"
+"SnUgnZUP5NbcA/FZGOhHibJXWpS2qdgXKxdJ5XbLwVaZOjex/2kskZGT4d9Mozd2\n"
+"TaGf+G0eHdP67Pv0RR0Tbc/3WeUiJ3IrhvNXuzDtJE3cfVa7o7P4NHmJweDyAmH3\n"
+"pvwPuxwXC65B2Xy9J6P9LjrRk5Sxcx0ki69bIImtt2dmefU6xqaWM/5TkshGsRGR\n"
+"xpl/j8nWZjEgQRCHLQzWwa80mMpkg/sTV9HB8Dx6jKXB/ZUhoHHBk2dxEuqPiApp\n"
+"GWSZI1b7rCoucL5mxAyE7+WL85MB+GqQk2dLsmijtWKP6T+MejteD+eMuMZ87zf9\n"
+"dOLITzNy4ZQ5bb0Sr74MTnB8G2+NszKTc0QWbej09+CVgI+WXTik9KveCjCHk9hN\n"
+"AHFiRSdLOkKEW39lt2c0Ui2cFmuqqNh7o0JMcccMyj6D5KbvtwEwXlGjefVwaaZB\n"
+"RA+GsCyRxj3qrg+E\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                      //   O  = Trustwave Holdings, Inc. CN = Trustwave Global Certification Authority
+"MIIF2jCCA8KgAwIBAgIMBfcOhtpJ80Y1LrqyMA0GCSqGSIb3DQEBCwUAMIGIMQsw\n"
+"CQYDVQQGEwJVUzERMA8GA1UECAwISWxsaW5vaXMxEDAOBgNVBAcMB0NoaWNhZ28x\n"
+"ITAfBgNVBAoMGFRydXN0d2F2ZSBIb2xkaW5ncywgSW5jLjExMC8GA1UEAwwoVHJ1\n"
+"c3R3YXZlIEdsb2JhbCBDZXJ0aWZpY2F0aW9uIEF1dGhvcml0eTAeFw0xNzA4MjMx\n"
+"OTM0MTJaFw00MjA4MjMxOTM0MTJaMIGIMQswCQYDVQQGEwJVUzERMA8GA1UECAwI\n"
+"SWxsaW5vaXMxEDAOBgNVBAcMB0NoaWNhZ28xITAfBgNVBAoMGFRydXN0d2F2ZSBI\n"
+"b2xkaW5ncywgSW5jLjExMC8GA1UEAwwoVHJ1c3R3YXZlIEdsb2JhbCBDZXJ0aWZp\n"
+"Y2F0aW9uIEF1dGhvcml0eTCCAiIwDQYJKoZIhvcNAQEBBQADggIPADCCAgoCggIB\n"
+"ALldUShLPDeS0YLOvR29zd24q88KPuFd5dyqCblXAj7mY2Hf8g+CY66j96xz0Xzn\n"
+"swuvCAAJWX/NKSqIk4cXGIDtiLK0thAfLdZfVaITXdHG6wZWiYj+rDKd/VzDBcdu\n"
+"7oaJuogDnXIhhpCujwOl3J+IKMujkkkP7NAP4m1ET4BqstTnoApTAbqOl5F2brz8\n"
+"1Ws25kCI1nsvXwXoLG0R8+eyvpJETNKXpP7ScoFDB5zpET71ixpZfR9oWN0EACyW\n"
+"80OzfpgZdNmcc9kYvkHHNHnZ9GLCQ7mzJ7Aiy/k9UscwR7PJPrhq4ufogXBeQotP\n"
+"JqX+OsIgbrv4Fo7NDKm0G2x2EOFYeUY+VM6AqFcJNykbmROPDMjWLBz7BegIlT1l\n"
+"RtzuzWniTY+HKE40Cz7PFNm73bZQmq131BnW2hqIyE4bJ3XYsgjxroMwuREOzYfw\n"
+"hI0Vcnyh78zyiGG69Gm7DIwLdVcEuE4qFC49DxweMqZiNu5m4iK4BUBjECLzMx10\n"
+"coos9TkpoNPnG4CELcU9402x/RpvumUHO1jsQkUm+9jaJXLE9gCxInm943xZYkqc\n"
+"BW89zubWR2OZxiRvchLIrH+QtAuRcOi35hYQcRfO3gZPSEF9NUqjifLJS3tBEW1n\n"
+"twiYTOURGa5CgNz7kAXU+FDKvuStx8KU1xad5hePrzb7AgMBAAGjQjBAMA8GA1Ud\n"
+"EwEB/wQFMAMBAf8wHQYDVR0OBBYEFJngGWcNYtt2s9o9uFvo/ULSMQ6HMA4GA1Ud\n"
+"DwEB/wQEAwIBBjANBgkqhkiG9w0BAQsFAAOCAgEAmHNw4rDT7TnsTGDZqRKGFx6W\n"
+"0OhUKDtkLSGm+J1WE2pIPU/HPinbbViDVD2HfSMF1OQc3Og4ZYbFdada2zUFvXfe\n"
+"uyk3QAUHw5RSn8pk3fEbK9xGChACMf1KaA0HZJDmHvUqoai7PF35owgLEQzxPy0Q\n"
+"lG/+4jSHg9bP5Rs1bdID4bANqKCqRieCNqcVtgimQlRXtpla4gt5kNdXElE1GYhB\n"
+"aCXUNxeEFfsBctyV3lImIJgm4nb1J2/6ADtKYdkNy1GTKv0WBpanI5ojSP5RvbbE\n"
+"sLFUzt5sQa0WZ37b/TjNuThOssFgy50X31ieemKyJo90lZvkWx3SD92YHJtZuSPT\n"
+"MaCm/zjdzyBP6VhWOmfD0faZmZ26NraAL4hHT4a/RDqA5Dccprrql5gR0IRiR2Qe\n"
+"qu5AvzSxnI9O4fKSTx+O856X3vOmeWqJcU9LJxdI/uz0UA9PSX3MReO9ekDFQdxh\n"
+"VicGaeVyQYHTtgGJoC86cnn+OjC/QezHYj6RS8fZMXZC+fc8Y+wmjHMMfRod6qh8\n"
+"h6jCJ3zhM0EPz8/8AKAigJ5Kp28AsEFFtyLKaEjFQqKu3R3y4G5OBVixwJAWKqQ9\n"
+"EEC+j2Jjg6mcgn0tAumDMHzLJ8n9HmYAsC7TIS+OMxZsmO0QqAfWzJPP29FpHOTK\n"
+"yeC2nOnOcXHebD8WpHk=\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                      //   O  = Trustwave Holdings, Inc. CN = Trustwave Global ECC P256 Certification Authority
+"MIICYDCCAgegAwIBAgIMDWpfCD8oXD5Rld9dMAoGCCqGSM49BAMCMIGRMQswCQYD\n"
+"VQQGEwJVUzERMA8GA1UECBMISWxsaW5vaXMxEDAOBgNVBAcTB0NoaWNhZ28xITAf\n"
+"BgNVBAoTGFRydXN0d2F2ZSBIb2xkaW5ncywgSW5jLjE6MDgGA1UEAxMxVHJ1c3R3\n"
+"YXZlIEdsb2JhbCBFQ0MgUDI1NiBDZXJ0aWZpY2F0aW9uIEF1dGhvcml0eTAeFw0x\n"
+"NzA4MjMxOTM1MTBaFw00MjA4MjMxOTM1MTBaMIGRMQswCQYDVQQGEwJVUzERMA8G\n"
+"A1UECBMISWxsaW5vaXMxEDAOBgNVBAcTB0NoaWNhZ28xITAfBgNVBAoTGFRydXN0\n"
+"d2F2ZSBIb2xkaW5ncywgSW5jLjE6MDgGA1UEAxMxVHJ1c3R3YXZlIEdsb2JhbCBF\n"
+"Q0MgUDI1NiBDZXJ0aWZpY2F0aW9uIEF1dGhvcml0eTBZMBMGByqGSM49AgEGCCqG\n"
+"SM49AwEHA0IABH77bOYj43MyCMpg5lOcunSNGLB4kFKA3TjASh3RqMyTpJcGOMoN\n"
+"FWLGjgEqZZ2q3zSRLoHB5DOSMcT9CTqmP62jQzBBMA8GA1UdEwEB/wQFMAMBAf8w\n"
+"DwYDVR0PAQH/BAUDAwcGADAdBgNVHQ4EFgQUo0EGrJBt0UrrdaVKEJmzsaGLSvcw\n"
+"CgYIKoZIzj0EAwIDRwAwRAIgB+ZU2g6gWrKuEZ+Hxbb/ad4lvvigtwjzRM4q3wgh\n"
+"DDcCIC0mA6AFvWvR9lz4ZcyGbbOcNEhjhAnFjXca4syc4XR7\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                      //   O  = Trustwave Holdings, Inc. CN = Trustwave Global ECC P384 Certification Authority
+"MIICnTCCAiSgAwIBAgIMCL2Fl2yZJ6SAaEc7MAoGCCqGSM49BAMDMIGRMQswCQYD\n"
+"VQQGEwJVUzERMA8GA1UECBMISWxsaW5vaXMxEDAOBgNVBAcTB0NoaWNhZ28xITAf\n"
+"BgNVBAoTGFRydXN0d2F2ZSBIb2xkaW5ncywgSW5jLjE6MDgGA1UEAxMxVHJ1c3R3\n"
+"YXZlIEdsb2JhbCBFQ0MgUDM4NCBDZXJ0aWZpY2F0aW9uIEF1dGhvcml0eTAeFw0x\n"
+"NzA4MjMxOTM2NDNaFw00MjA4MjMxOTM2NDNaMIGRMQswCQYDVQQGEwJVUzERMA8G\n"
+"A1UECBMISWxsaW5vaXMxEDAOBgNVBAcTB0NoaWNhZ28xITAfBgNVBAoTGFRydXN0\n"
+"d2F2ZSBIb2xkaW5ncywgSW5jLjE6MDgGA1UEAxMxVHJ1c3R3YXZlIEdsb2JhbCBF\n"
+"Q0MgUDM4NCBDZXJ0aWZpY2F0aW9uIEF1dGhvcml0eTB2MBAGByqGSM49AgEGBSuB\n"
+"BAAiA2IABGvaDXU1CDFHBa5FmVXxERMuSvgQMSOjfoPTfygIOiYaOs+Xgh+AtycJ\n"
+"j9GOMMQKmw6sWASr9zZ9lCOkmwqKi6vr/TklZvFe/oyujUF5nQlgziip04pt89ZF\n"
+"1PKYhDhloKNDMEEwDwYDVR0TAQH/BAUwAwEB/zAPBgNVHQ8BAf8EBQMDBwYAMB0G\n"
+"A1UdDgQWBBRVqYSJ0sEyvRjLbKYHTsjnnb6CkDAKBggqhkjOPQQDAwNnADBkAjA3\n"
+"AZKXRRJ+oPM+rRk6ct30UJMDEr5E0k9BpIycnR+j9sKS50gU/k6bpZFXrsY3crsC\n"
+"MGclCrEMXu6pY5Jv5ZAL/mYiykf9ijH3g/56vxC+GCsej/YpHpRZ744hN8tRmKVu\n"
+"Sw==\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                      //   O  = UniTrust CN = UCA Extended Validation Root
+"MIIFWjCCA0KgAwIBAgIQT9Irj/VkyDOeTzRYZiNwYDANBgkqhkiG9w0BAQsFADBH\n"
+"MQswCQYDVQQGEwJDTjERMA8GA1UECgwIVW5pVHJ1c3QxJTAjBgNVBAMMHFVDQSBF\n"
+"eHRlbmRlZCBWYWxpZGF0aW9uIFJvb3QwHhcNMTUwMzEzMDAwMDAwWhcNMzgxMjMx\n"
+"MDAwMDAwWjBHMQswCQYDVQQGEwJDTjERMA8GA1UECgwIVW5pVHJ1c3QxJTAjBgNV\n"
+"BAMMHFVDQSBFeHRlbmRlZCBWYWxpZGF0aW9uIFJvb3QwggIiMA0GCSqGSIb3DQEB\n"
+"AQUAA4ICDwAwggIKAoICAQCpCQcoEwKwmeBkqh5DFnpzsZGgdT6o+uM4AHrsiWog\n"
+"D4vFsJszA1qGxliG1cGFu0/GnEBNyr7uaZa4rYEwmnySBesFK5pI0Lh2PpbIILvS\n"
+"sPGP2KxFRv+qZ2C0d35qHzwaUnoEPQc8hQ2E0B92CvdqFN9y4zR8V05WAT558aop\n"
+"O2z6+I9tTcg1367r3CTueUWnhbYFiN6IXSV8l2RnCdm/WhUFhvMJHuxYMjMR83dk\n"
+"sHYf5BA1FxvyDrFspCqjc/wJHx4yGVMR59mzLC52LqGj3n5qiAno8geK+LLNEOfi\n"
+"c0CTuwjRP+H8C5SzJe98ptfRr5//lpr1kXuYC3fUfugH0mK1lTnj8/FtDw5lhIpj\n"
+"VMWAtuCeS31HJqcBCF3RiJ7XwzJE+oJKCmhUfzhTA8ykADNkUVkLo4KRel7sFsLz\n"
+"KuZi2irbWWIQJUoqgQtHB0MGcIfS+pMRKXpITeuUx3BNr2fVUbGAIAEBtHoIppB/\n"
+"TuDvB0GHr2qlXov7z1CymlSvw4m6WC31MJixNnI5fkkE/SmnTHnkBVfblLkWU41G\n"
+"sx2VYVdWf6/wFlthWG82UBEL2KwrlRYaDh8IzTY0ZRBiZtWAXxQgXy0MoHgKaNYs\n"
+"1+lvK9JKBZP8nm9rZ/+I8U6laUpSNwXqxhaN0sSZ0YIrO7o1dfdRUVjzyAfd5LQD\n"
+"fwIDAQABo0IwQDAdBgNVHQ4EFgQU2XQ65DA9DfcS3H5aBZ8eNJr34RQwDwYDVR0T\n"
+"AQH/BAUwAwEB/zAOBgNVHQ8BAf8EBAMCAYYwDQYJKoZIhvcNAQELBQADggIBADaN\n"
+"l8xCFWQpN5smLNb7rhVpLGsaGvdftvkHTFnq88nIua7Mui563MD1sC3AO6+fcAUR\n"
+"ap8lTwEpcOPlDOHqWnzcSbvBHiqB9RZLcpHIojG5qtr8nR/zXUACE/xOHAbKsxSQ\n"
+"VBcZEhrxH9cMaVr2cXj0lH2RC47skFSOvG+hTKv8dGT9cZr4QQehzZHkPJrgmzI5\n"
+"c6sq1WnIeJEmMX3ixzDx/BR4dxIOE/TdFpS/S2d7cFOFyrC78zhNLJA5wA3CXWvp\n"
+"4uXViI3WLL+rG761KIcSF3Ru/H38j9CHJrAb+7lsq+KePRXBOy5nAliRn+/4Qh8s\n"
+"t2j1da3Ptfb/EX3C8CSlrdP6oDyp+l3cpaDvRKS+1ujl5BOWF3sGPjLtx7dCvHaj\n"
+"2GU4Kzg1USEODm8uNBNA4StnDG1KQTAYI1oyVZnJF+A83vbsea0rWBmirSwiGpWO\n"
+"vpaQXUJXxPkUAzUrHC1RVwinOt4/5Mi0A3PCwSaAuwtCH60NryZy2sy+s6ODWA2C\n"
+"xR9GUeOcGMyNm43sSet1UNWMKFnKdDTajAshqx7qG+XH/RU+wBeq+yNuJkbL+vmx\n"
+"cmtpzyKEC2IPrNkZAJSidjzULZrtBJ4tBmIQN1IchXIbJ+XMxjHsN+xjWZsLHXbM\n"
+"fjKaiJUINlK73nZfdklJrX+9ZSCyycErdhh2n1ax\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                      //   O  = UniTrust CN = UCA Global G2 Root
+"MIIFRjCCAy6gAwIBAgIQXd+x2lqj7V2+WmUgZQOQ7zANBgkqhkiG9w0BAQsFADA9\n"
+"MQswCQYDVQQGEwJDTjERMA8GA1UECgwIVW5pVHJ1c3QxGzAZBgNVBAMMElVDQSBH\n"
+"bG9iYWwgRzIgUm9vdDAeFw0xNjAzMTEwMDAwMDBaFw00MDEyMzEwMDAwMDBaMD0x\n"
+"CzAJBgNVBAYTAkNOMREwDwYDVQQKDAhVbmlUcnVzdDEbMBkGA1UEAwwSVUNBIEds\n"
+"b2JhbCBHMiBSb290MIICIjANBgkqhkiG9w0BAQEFAAOCAg8AMIICCgKCAgEAxeYr\n"
+"b3zvJgUno4Ek2m/LAfmZmqkywiKHYUGRO8vDaBsGxUypK8FnFyIdK+35KYmToni9\n"
+"kmugow2ifsqTs6bRjDXVdfkX9s9FxeV67HeToI8jrg4aA3++1NDtLnurRiNb/yzm\n"
+"VHqUwCoV8MmNsHo7JOHXaOIxPAYzRrZUEaalLyJUKlgNAQLx+hVRZ2zA+te2G3/R\n"
+"VogvGjqNO7uCEeBHANBSh6v7hn4PJGtAnTRnvI3HLYZveT6OqTwXS3+wmeOwcWDc\n"
+"C/Vkw85DvG1xudLeJ1uK6NjGruFZfc8oLTW4lVYa8bJYS7cSN8h8s+1LgOGN+jIj\n"
+"tm+3SJUIsUROhYw6AlQgL9+/V087OpAh18EmNVQg7Mc/R+zvWr9LesGtOxdQXGLY\n"
+"D0tK3Cv6brxzks3sx1DoQZbXqX5t2Okdj4q1uViSukqSKwxW/YDrCPBeKW4bHAyv\n"
+"j5OJrdu9o54hyokZ7N+1wxrrFv54NkzWbtA+FxyQF2smuvt6L78RHBgOLXMDj6Dl\n"
+"NaBa4kx1HXHhOThTeEDMg5PXCp6dW4+K5OXgSORIskfNTip1KnvyIvbJvgmRlld6\n"
+"iIis7nCs+dwp4wwcOxJORNanTrAmyPPZGpeRaOrvjUYG0lZFWJo8DA+DuAUlwznP\n"
+"O6Q0ibd5Ei9Hxeepl2n8pndntd978XplFeRhVmUCAwEAAaNCMEAwDgYDVR0PAQH/\n"
+"BAQDAgEGMA8GA1UdEwEB/wQFMAMBAf8wHQYDVR0OBBYEFIHEjMz15DD/pQwIX4wV\n"
+"ZyF0Ad/fMA0GCSqGSIb3DQEBCwUAA4ICAQATZSL1jiutROTL/7lo5sOASD0Ee/oj\n"
+"L3rtNtqyzm325p7lX1iPyzcyochltq44PTUbPrw7tgTQvPlJ9Zv3hcU2tsu8+Mg5\n"
+"1eRfB70VVJd0ysrtT7q6ZHafgbiERUlMjW+i67HM0cOU2kTC5uLqGOiiHycFutfl\n"
+"1qnN3e92mI0ADs0b+gO3joBYDic/UvuUospeZcnWhNq5NXHzJsBPd+aBJ9J3O5oU\n"
+"b3n09tDh05S60FdRvScFDcH9yBIw7m+NESsIndTUv4BFFJqIRNow6rSn4+7vW4LV\n"
+"PtateJLbXDzz2K36uGt/xDYotgIVilQsnLAXc47QN6MUPJiVAAwpBVueSUmxX8fj\n"
+"y88nZY41F7dXyDDZQVu5FLbowg+UMaeUmMxq67XhJ/UQqAHojhJi6IjMtX9Gl8Cb\n"
+"EGY4GjZGXyJoPd/JxhMnq1MGrKI8hgZlb7F+sSlEmqO6SWkoaY/X5V+tBIZkbxqg\n"
+"DMUIYs6Ao9Dz7GjevjPHF1t/gMRMTLGmhIrDO7gJzRSBuhjjVFc2/tsvfEehOjPI\n"
+"+Vg7RE+xygKJBJYoaMVLuCaJu9YzL1DV/pqJuhgyklTGW+Cd+V7lDSKb9triyCGy\n"
+"YiGqhkCyLmTTX8jjfhFnRR8F/uOi77Oos/N9j/gMHyIfLXC0uAE0djAA5SN4p1bX\n"
+"UB+K+wb1whnw0A==\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                      //   O  = CERTSIGN SA OU = certSIGN ROOT CA G2
+"MIIFRzCCAy+gAwIBAgIJEQA0tk7GNi02MA0GCSqGSIb3DQEBCwUAMEExCzAJBgNV\n"
+"BAYTAlJPMRQwEgYDVQQKEwtDRVJUU0lHTiBTQTEcMBoGA1UECxMTY2VydFNJR04g\n"
+"Uk9PVCBDQSBHMjAeFw0xNzAyMDYwOTI3MzVaFw00MjAyMDYwOTI3MzVaMEExCzAJ\n"
+"BgNVBAYTAlJPMRQwEgYDVQQKEwtDRVJUU0lHTiBTQTEcMBoGA1UECxMTY2VydFNJ\n"
+"R04gUk9PVCBDQSBHMjCCAiIwDQYJKoZIhvcNAQEBBQADggIPADCCAgoCggIBAMDF\n"
+"dRmRfUR0dIf+DjuW3NgBFszuY5HnC2/OOwppGnzC46+CjobXXo9X69MhWf05N0Iw\n"
+"vlDqtg+piNguLWkh59E3GE59kdUWX2tbAMI5Qw02hVK5U2UPHULlj88F0+7cDBrZ\n"
+"uIt4ImfkabBoxTzkbFpG583H+u/E7Eu9aqSs/cwoUe+StCmrqzWaTOTECMYmzPhp\n"
+"n+Sc8CnTXPnGFiWeI8MgwT0PPzhAsP6CRDiqWhqKa2NYOLQV07YRaXseVO6MGiKs\n"
+"cpc/I1mbySKEwQdPzH/iV8oScLumZfNpdWO9lfsbl83kqK/20U6o2YpxJM02PbyW\n"
+"xPFsqa7lzw1uKA2wDrXKUXt4FMMgL3/7FFXhEZn91QqhngLjYl/rNUssuHLoPj1P\n"
+"rCy7Lobio3aP5ZMqz6WryFyNSwb/EkaseMsUBzXgqd+L6a8VTxaJW732jcZZroiF\n"
+"DsGJ6x9nxUWO/203Nit4ZoORUSs9/1F3dmKh7Gc+PoGD4FapUB8fepmrY7+EF3fx\n"
+"DTvf95xhszWYijqy7DwaNz9+j5LP2RIUZNoQAhVB/0/E6xyjyfqZ90bp4RjZsbgy\n"
+"LcsUDFDYg2WD7rlcz8sFWkz6GZdr1l0T08JcVLwyc6B49fFtHsufpaafItzRUZ6C\n"
+"eWRgKRM+o/1Pcmqr4tTluCRVLERLiohEnMqE0yo7AgMBAAGjQjBAMA8GA1UdEwEB\n"
+"/wQFMAMBAf8wDgYDVR0PAQH/BAQDAgEGMB0GA1UdDgQWBBSCIS1mxteg4BXrzkwJ\n"
+"d8RgnlRuAzANBgkqhkiG9w0BAQsFAAOCAgEAYN4auOfyYILVAzOBywaK8SJJ6ejq\n"
+"kX/GM15oGQOGO0MBzwdw5AgeZYWR5hEit/UCI46uuR59H35s5r0l1ZUa8gWmr4UC\n"
+"b6741jH/JclKyMeKqdmfS0mbEVeZkkMR3rYzpMzXjWR91M08KCy0mpbqTfXERMQl\n"
+"qiCA2ClV9+BB/AYm/7k29UMUA2Z44RGx2iBfRgB4ACGlHgAoYXhvqAEBj500mv/0\n"
+"OJD7uNGzcgbJceaBxXntC6Z58hMLnPddDnskk7RI24Zf3lCGeOdA5jGokHZwYa+c\n"
+"NywRtYK3qq4kNFtyDGkNzVmf9nGvnAvRCjj5BiKDUyUM/FHE5r7iOZULJK2v0ZXk\n"
+"ltd0ZGtxTgI8qoXzIKNDOXZbbFD+mpwUHmUUihW9o4JFWklWatKcsWMy5WHgUyIO\n"
+"pwpJ6st+H6jiYoD2EEVSmAYY3qXNL3+q1Ok+CHLsIwMCPKaq2LxndD0UF/tUSxfj\n"
+"03k9bWtJySgOLnRQvwzZRjoQhsmnP+mg7H/rpXdYaXHmgwo38oZJar55CJD2AhZk\n"
+"PuXaTH4MNMn5X7azKFGnpyuqSfqNZSlO42sTp5SjLVFteAxEy9/eCG/Oo2Sr05WE\n"
+"1LlSVHJ7liXMvGnjSG4N0MedJ5qq+BOS3R7fY581qRY27Iy4g/Q9iY/NtBde17MX\n"
+"QRBdJ3NghVdJIgc=\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                      //   O = Microsec Ltd. organizationIdentifier = VATHU-23584497 CN = e-Szigno Root CA 2017
+"MIICQDCCAeWgAwIBAgIMAVRI7yH9l1kN9QQKMAoGCCqGSM49BAMCMHExCzAJBgNV\n"
+"BAYTAkhVMREwDwYDVQQHDAhCdWRhcGVzdDEWMBQGA1UECgwNTWljcm9zZWMgTHRk\n"
+"LjEXMBUGA1UEYQwOVkFUSFUtMjM1ODQ0OTcxHjAcBgNVBAMMFWUtU3ppZ25vIFJv\n"
+"b3QgQ0EgMjAxNzAeFw0xNzA4MjIxMjA3MDZaFw00MjA4MjIxMjA3MDZaMHExCzAJ\n"
+"BgNVBAYTAkhVMREwDwYDVQQHDAhCdWRhcGVzdDEWMBQGA1UECgwNTWljcm9zZWMg\n"
+"THRkLjEXMBUGA1UEYQwOVkFUSFUtMjM1ODQ0OTcxHjAcBgNVBAMMFWUtU3ppZ25v\n"
+"IFJvb3QgQ0EgMjAxNzBZMBMGByqGSM49AgEGCCqGSM49AwEHA0IABJbcPYrYsHtv\n"
+"xie+RJCxs1YVe45DJH0ahFnuY2iyxl6H0BVIHqiQrb1TotreOpCmYF9oMrWGQd+H\n"
+"Wyx7xf58etqjYzBhMA8GA1UdEwEB/wQFMAMBAf8wDgYDVR0PAQH/BAQDAgEGMB0G\n"
+"A1UdDgQWBBSHERUI0arBeAyxr87GyZDvvzAEwDAfBgNVHSMEGDAWgBSHERUI0arB\n"
+"eAyxr87GyZDvvzAEwDAKBggqhkjOPQQDAgNJADBGAiEAtVfd14pVCzbhhkT61Nlo\n"
+"jbjcI4qKDdQvfepz7L9NbKgCIQDLpbQS+ue16M9+k/zzNY9vTlp8tLxOsvxyqltZ\n"
+"+efcMQ==\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                      //   OU = emSign PKI O  = eMudhra Inc CN = emSign ECC Root CA - C3
+"MIICKzCCAbGgAwIBAgIKe3G2gla4EnycqDAKBggqhkjOPQQDAzBaMQswCQYDVQQG\n"
+"EwJVUzETMBEGA1UECxMKZW1TaWduIFBLSTEUMBIGA1UEChMLZU11ZGhyYSBJbmMx\n"
+"IDAeBgNVBAMTF2VtU2lnbiBFQ0MgUm9vdCBDQSAtIEMzMB4XDTE4MDIxODE4MzAw\n"
+"MFoXDTQzMDIxODE4MzAwMFowWjELMAkGA1UEBhMCVVMxEzARBgNVBAsTCmVtU2ln\n"
+"biBQS0kxFDASBgNVBAoTC2VNdWRocmEgSW5jMSAwHgYDVQQDExdlbVNpZ24gRUND\n"
+"IFJvb3QgQ0EgLSBDMzB2MBAGByqGSM49AgEGBSuBBAAiA2IABP2lYa57JhAd6bci\n"
+"MK4G9IGzsUJxlTm801Ljr6/58pc1kjZGDoeVjbk5Wum739D+yAdBPLtVb4Ojavti\n"
+"sIGJAnB9SMVK4+kiVCJNk7tCDK93nCOmfddhEc5lx/h//vXyqaNCMEAwHQYDVR0O\n"
+"BBYEFPtaSNCAIEDyqOkAB2kZd6fmw/TPMA4GA1UdDwEB/wQEAwIBBjAPBgNVHRMB\n"
+"Af8EBTADAQH/MAoGCCqGSM49BAMDA2gAMGUCMQC02C8Cif22TGK6Q04ThHK1rt0c\n"
+"3ta13FaPWEBaLd4gTCKDypOofu4SQMfWh0/434UCMBwUZOR8loMRnLDRWmFLpg9J\n"
+"0wD8ofzkpf9/rdcw0Md3f76BB1UwUCAU9Vc4CqgxUQ==\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                      //   OU = emSign PKI O  = eMudhra Technologies Limited CN = emSign ECC Root CA - G3
+"MIICTjCCAdOgAwIBAgIKPPYHqWhwDtqLhDAKBggqhkjOPQQDAzBrMQswCQYDVQQG\n"
+"EwJJTjETMBEGA1UECxMKZW1TaWduIFBLSTElMCMGA1UEChMcZU11ZGhyYSBUZWNo\n"
+"bm9sb2dpZXMgTGltaXRlZDEgMB4GA1UEAxMXZW1TaWduIEVDQyBSb290IENBIC0g\n"
+"RzMwHhcNMTgwMjE4MTgzMDAwWhcNNDMwMjE4MTgzMDAwWjBrMQswCQYDVQQGEwJJ\n"
+"TjETMBEGA1UECxMKZW1TaWduIFBLSTElMCMGA1UEChMcZU11ZGhyYSBUZWNobm9s\n"
+"b2dpZXMgTGltaXRlZDEgMB4GA1UEAxMXZW1TaWduIEVDQyBSb290IENBIC0gRzMw\n"
+"djAQBgcqhkjOPQIBBgUrgQQAIgNiAAQjpQy4LRL1KPOxst3iAhKAnjlfSU2fySU0\n"
+"WXTsuwYc58Byr+iuL+FBVIcUqEqy6HyC5ltqtdyzdc6LBtCGI79G1Y4PPwT01xyS\n"
+"fvalY8L1X44uT6EYGQIrMgqCZH0Wk9GjQjBAMB0GA1UdDgQWBBR8XQKEE9TMipuB\n"
+"zhccLikenEhjQjAOBgNVHQ8BAf8EBAMCAQYwDwYDVR0TAQH/BAUwAwEB/zAKBggq\n"
+"hkjOPQQDAwNpADBmAjEAvvNhzwIQHWSVB7gYboiFBS+DCBeQyh+KTOgNG3qxrdWB\n"
+"CUfvO6wIBHxcmbHtRwfSAjEAnbpV/KlK6O3t5nYBQnvI+GDZjVGLVTv7jHvrZQnD\n"
+"+JbNR6iC8hZVdyR+EhCVBCyj\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                      //   OU = emSign PKI O  = eMudhra Inc CN = emSign Root CA - C1
+"MIIDczCCAlugAwIBAgILAK7PALrEzzL4Q7IwDQYJKoZIhvcNAQELBQAwVjELMAkG\n"
+"A1UEBhMCVVMxEzARBgNVBAsTCmVtU2lnbiBQS0kxFDASBgNVBAoTC2VNdWRocmEg\n"
+"SW5jMRwwGgYDVQQDExNlbVNpZ24gUm9vdCBDQSAtIEMxMB4XDTE4MDIxODE4MzAw\n"
+"MFoXDTQzMDIxODE4MzAwMFowVjELMAkGA1UEBhMCVVMxEzARBgNVBAsTCmVtU2ln\n"
+"biBQS0kxFDASBgNVBAoTC2VNdWRocmEgSW5jMRwwGgYDVQQDExNlbVNpZ24gUm9v\n"
+"dCBDQSAtIEMxMIIBIjANBgkqhkiG9w0BAQEFAAOCAQ8AMIIBCgKCAQEAz+upufGZ\n"
+"BczYKCFK83M0UYRWEPWgTywS4/oTmifQz/l5GnRfHXk5/Fv4cI7gklL35CX5VIPZ\n"
+"HdPIWoU/Xse2B+4+wM6ar6xWQio5JXDWv7V7Nq2s9nPczdcdioOl+yuQFTdrHCZH\n"
+"3DspVpNqs8FqOp099cGXOFgFixwR4+S0uF2FHYP+eF8LRWgYSKVGczQ7/g/IdrvH\n"
+"GPMF0Ybzhe3nudkyrVWIzqa2kbBPrH4VI5b2P/AgNBbeCsbEBEV5f6f9vtKppa+c\n"
+"xSMq9zwhbL2vj07FOrLzNBL834AaSaTUqZX3noleoomslMuoaJuvimUnzYnu3Yy1\n"
+"aylwQ6BpC+S5DwIDAQABo0IwQDAdBgNVHQ4EFgQU/qHgcB4qAzlSWkK+XJGFehiq\n"
+"TbUwDgYDVR0PAQH/BAQDAgEGMA8GA1UdEwEB/wQFMAMBAf8wDQYJKoZIhvcNAQEL\n"
+"BQADggEBAMJKVvoVIXsoounlHfv4LcQ5lkFMOycsxGwYFYDGrK9HWS8mC+M2sO87\n"
+"/kOXSTKZEhVb3xEp/6tT+LvBeA+snFOvV71ojD1pM/CjoCNjO2RnIkSt1XHLVip4\n"
+"kqNPEjE2NuLe/gDEo2APJ62gsIq1NnpSob0n9CAnYuhNlCQT5AoE6TyrLshDCUrG\n"
+"YQTlSTR+08TI9Q/Aqum6VF7zYytPT1DU/rl7mYw9wC68AivTxEDkigcxHpvOJpkT\n"
+"+xHqmiIMERnHXhuBUDDIlhJu58tBf5E7oke3VIAb3ADMmpDqw8NQBmIMMMAVSKeo\n"
+"WXzhriKi4gp6D/piq1JM4fHfyr6DDUI=\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                       //   OU = emSign PKI O  = eMudhra Technologies Limited CN = emSign Root CA - G1
+"MIIDlDCCAnygAwIBAgIKMfXkYgxsWO3W2DANBgkqhkiG9w0BAQsFADBnMQswCQYD\n"
+"VQQGEwJJTjETMBEGA1UECxMKZW1TaWduIFBLSTElMCMGA1UEChMcZU11ZGhyYSBU\n"
+"ZWNobm9sb2dpZXMgTGltaXRlZDEcMBoGA1UEAxMTZW1TaWduIFJvb3QgQ0EgLSBH\n"
+"MTAeFw0xODAyMTgxODMwMDBaFw00MzAyMTgxODMwMDBaMGcxCzAJBgNVBAYTAklO\n"
+"MRMwEQYDVQQLEwplbVNpZ24gUEtJMSUwIwYDVQQKExxlTXVkaHJhIFRlY2hub2xv\n"
+"Z2llcyBMaW1pdGVkMRwwGgYDVQQDExNlbVNpZ24gUm9vdCBDQSAtIEcxMIIBIjAN\n"
+"BgkqhkiG9w0BAQEFAAOCAQ8AMIIBCgKCAQEAk0u76WaK7p1b1TST0Bsew+eeuGQz\n"
+"f2N4aLTNLnF115sgxk0pvLZoYIr3IZpWNVrzdr3YzZr/k1ZLpVkGoZM0Kd0WNHVO\n"
+"8oG0x5ZOrRkVUkr+PHB1cM2vK6sVmjM8qrOLqs1D/fXqcP/tzxE7lM5OMhbTI0Aq\n"
+"d7OvPAEsbO2ZLIvZTmmYsvePQbAyeGHWDV/D+qJAkh1cF+ZwPjXnorfCYuKrpDhM\n"
+"tTk1b+oDafo6VGiFbdbyL0NVHpENDtjVaqSW0RM8LHhQ6DqS0hdW5TUaQBw+jSzt\n"
+"Od9C4INBdN+jzcKGYEho42kLVACL5HZpIQ15TjQIXhTCzLG3rdd8cIrHhQIDAQAB\n"
+"o0IwQDAdBgNVHQ4EFgQU++8Nhp6w492pufEhF38+/PB3KxowDgYDVR0PAQH/BAQD\n"
+"AgEGMA8GA1UdEwEB/wQFMAMBAf8wDQYJKoZIhvcNAQELBQADggEBAFn/8oz1h31x\n"
+"PaOfG1vR2vjTnGs2vZupYeveFix0PZ7mddrXuqe8QhfnPZHr5X3dPpzxz5KsbEjM\n"
+"wiI/aTvFthUvozXGaCocV685743QNcMYDHsAVhzNixl03r4PEuDQqqE/AjSxcM6d\n"
+"GNYIAwlG7mDgfrbESQRRfXBgvKqy/3lyeqYdPV8q+Mri/Tm3R7nrft8EI6/6nAYH\n"
+"6ftjk4BAtcZsCjEozgyfz7MjNYBBjWzEN3uBL4ChQEKF6dk4jeihU80Bv2noWgby\n"
+"RQuQ+q7hv53yrlc8pa6yVvSLZUDp/TGBLPQ5Cdjua6e0ph0VpZj3AYHYhX3zUVxx\n"
+"iN66zB+Afko=\n"
+"-----END CERTIFICATE-----\n"
+"-----BEGIN CERTIFICATE-----\n"                                     // root CA https://test.openquantumsafe.org/
+"MIIFCzCCAvOgAwIBAgIUU0jgPJ2tVAmcURRdcXR6wnQ09icwDQYJKoZIhvcNAQEL\n"
+"BQAwFTETMBEGA1UEAwwKb3FzdGVzdF9DQTAeFw0yNDAxMTcxMzM2MjlaFw0yNTA1\n"
+"MzExMzM2MjlaMBUxEzARBgNVBAMMCm9xc3Rlc3RfQ0EwggIiMA0GCSqGSIb3DQEB\n"
+"AQUAA4ICDwAwggIKAoICAQDQbubSsqmdgej+QQ6dk5qVNezXwDw2VD5ry2IjGtg8\n"
+"nHYSSmSE8M2uJvEQPNXYw1MRB+JkyAxj3jIRJOt3i7S845R5d+2o0LrArJCNveHo\n"
+"YxujhpkinPs5jdMAjQoRy/TXwXjvRt8cDrNvOaoYTJU/FZyy01zfi4+p+ZSJ/AAc\n"
+"CPp60x38LMuUez+dftx1ec9ZPOqlFX8Dj0WBSR/Ur4gHmh106Vnpp4iUpoVSjJ4a\n"
+"/9xBPD7TuNh2gPcVn4vCcaNG7/FQSKk0LVMVbWK8cKpLhd/5WXz45pfGuvTPxikX\n"
+"OWOjLeLjYDT9e/oG6y1Fx8pPNXUBptAvq41QrlAxhp8gXEIyZcjTjuet4lkpC1kL\n"
+"9QcKRd59ABsl0mvD934pXgUi3/jHgh9r7qKAJemFekkYvVW0bNyIrRzcBj3lUkYH\n"
+"ZeeXNsT3ApMKsGW7lmTz0B6LHglzr8FWtQ4tshZyDwxUeF+LHaeaXf6/MQuwkEg4\n"
+"wUzn1RGDQRPhaKYV0/heqeio7HHyXbfHXNsVu3M5yxmboHrK8XMQNqtP2zPem3fc\n"
+"Ku8tfapWAquPzjGB/VIcxPvmfJiRVBM1frmn1wO7EMK8ctglZ20oReugLuAXwOV4\n"
+"//TnDyXjLRzJ2iIjBUQdmghx+8DhqZ+QLa7wTEW+6B3CuryCvwdFAO8HcEHLc3mz\n"
+"swIDAQABo1MwUTAdBgNVHQ4EFgQU39ixs6YzavNrOux/XvBiKGWyEWgwHwYDVR0j\n"
+"BBgwFoAU39ixs6YzavNrOux/XvBiKGWyEWgwDwYDVR0TAQH/BAUwAwEB/zANBgkq\n"
+"hkiG9w0BAQsFAAOCAgEAIFjoCBFXwWhS4XM4Xu6/C2JElfoO+ZCKq6ZJuDZEpkil\n"
+"pwnbhGtTzHn8eFy2w6tBB4rkBWHSsl3LQshFiAtJ3rQrUeuzF64BVd/7W3J0Ci7R\n"
+"RzIk7XF89nEUUhDhOvPuntKndO1KuiNMZA7yNqGD2O8gj20CsFGi0ARbkzQSwHs3\n"
+"IUZd9y2ThKY+VroyU/z0UxWvts3rFH/y39Z0XE3TAGC6emCpMYYCru/GZoOCXlTI\n"
+"qRDP8/bh7aNpIY2IxMue76sttAQ1DUFi0rYxykO8197I8Tj50ob8yy421jHpOyhV\n"
+"EEyR9bULYmhyMl18G/E+L4x61UF0L4t4Pbb3fPvl22F06UyvHwcSdXg4oJkJPBvp\n"
+"GpLojq/qVDOEXlh2N9hAgu0sluLdUoCnI4q+mRFboyfIFDpiOcDecZv2ZzMno6c6\n"
+"/159vMmQi7mTUhZhSNTrGv7jfyT/2a4B5Le+Iplw/M8HNsnFU9AtBZ2T8yNqMxCt\n"
+"m9Uw0Kmw8vUJlKDM0V3ROoz1HEaUIXI2BPvhTnwQwrDOAMdaGAMGZushkKo5iZ9l\n"
+"L9IIdUZ2niafGDA7sxltVUco9B705FXCFMngUIuTANEB2fhPq/FifWCnTnL8O/aw\n"
+"i5Z8p8Cos0vcrMR8y6mBwURsEu+ecI0IQuOcwMxaFhTvIMQfodMQ/Eqr8czIYoo=\n"
+"-----END CERTIFICATE-----\n"
+
+"-----BEGIN CERTIFICATE-----\n"
+"MIIVdDCCCH+gAwIBAgIUBOFs94spf/A84sMbhh+9zhHpnNwwDQYLKwYBBAECggsH\n"
+"BgUwEjEQMA4GA1UEAwwHdGVzdCBDQTAeFw0yNDAyMTgxMDAyMDhaFw0yNTAyMTcx\n"
+"MDAyMDhaMBIxEDAOBgNVBAMMB3Rlc3QgQ0Ewgge0MA0GCysGAQQBAoILBwYFA4IH\n"
+"oQAGriPCZbTg5EVjxdD3wuZZjsFIbofZ2xDx2NKHxRf/4ORBjJ4aZZ5tghcmHKac\n"
+"PkDVWLw03fwlnn0ha+23R5Rv8FeFPG+ht8lKa4v1CDpmEHXztpL8ZmlWm7n53Miy\n"
+"K7JAax3zl2V3f/c0cvjBBVfzXWmGcghdmTZRK/usmTNAizvwEvJqVSBgDUVJ5k6J\n"
+"yDaHuTVTBI4OV2+q6Z5gsV50AfasU2qNaVfYpAbEn1DCBFZZo4qay8jZXU0YDnKA\n"
+"mi5Nddj8UiGtAi81xDhDNlOX1IpZQZfgbilHeFAX+p4eJc5FUtDsxt+J0ad9gnIq\n"
+"WbcbrkX5Huce+pvaGXS9AFS9oVyJaBFd0OlXV7yQvDxqVakA8tx6+eVLEHfEnf0P\n"
+"aDJitjcn/imdwRTUmru3gYO7epc9ey9TM9T0T8aYzH/JrdyZ/e7dv++9vKh6SrCU\n"
+"4DAbTM+mHKZTeA2igFZQzPcO85ky0nPzHSwwGKdimNfG9K8n98b6nB6JhVxCPkz4\n"
+"X18ScRpfn1n9YjM7XbyvnIDerDmPGdo+S9XwgjnvM9AOMUivuhEsLKFkmKbhLMNh\n"
+"M7X8E9CPRBI1rEDGkZEVO+xG5+HeZHjyPJije4fdrM954WcMVBlxuOL0iVGPkfLj\n"
+"5AVCdnXu83wdPQ++hmOGrON+6EedJ6Oa4bSWd40QsmyI3+LhsKRTjGq7bpj50HGd\n"
+"gGvUhECvwDPw7KiWBV3jf5da7ebNdHwgvJQm+al1t0hTn/rpgflUtsRxh4jNzcEK\n"
+"kytyuGshvat8v5psWXOlJR0iVI2P4vhn+j7HKNxeyXwOnfHJpz0gF/Vg5IQHotlO\n"
+"LUgwAdKrcys6sHZ2KyfB1p21K7N6Ozbwk2/you3tulPJspXhGBpXv8K6LCFW0Uig\n"
+"TSWH10oxe0oCxAhC3yZBWerCieU3trfV9sL5F/yJKwMRiu+0C68+DoESQd//WAHO\n"
+"i9lMLH93YOkbz5nDT8de8FRPgHtMG8pvoQJtOw8mEmYo9kTF+KFIxcunc3BwKb9m\n"
+"1I5qfXPXeew7bzL7al2RPMI0rqMMNKWO3fGo8id6lPXccZp0QT734j1MkuH8ChyS\n"
+"Ryd/Ncn0Q3d1XQSHMY6G9uCaju5E/ZPAL2DaSSvwmfZ6FPTFbU8lNfr7dhibzjXE\n"
+"wNdmam3bdySdMb0ic57hu7xX36vscMJ2A8vygiFRUQE718bgKoRIinoB4mNkRkOx\n"
+"2urEBsUyOuG1NkdKfaQpWAzYsA4YGBc+KJEttMv5Vw0hGtpDYmsQFDhxvTGy66kG\n"
+"unSL8WXYYg7Yketact12dfbasMe7ljGkP0iPGGKssMORwBCGZyZKmov7h9dkoqUT\n"
+"+hXxmOs/P6gpL4La7Ac0SlvmOUEDCAqelQEXpmP892+QfpN7h5dBaUL4XD2V8bvY\n"
+"4hIGsmYNdGt4IMQ3yKWHEkQMEBbrWFoiug2xIM2jCqka9/vnuHblKRLt7SgNVhUG\n"
+"P0/NeKGXZRdLxLph0rhDzOoUwzbfyNy6jXWJG40h02BARWa3iEOYkV7QK2SDv7iG\n"
+"Sgpg0fAYIWp7R6ZYKS66MBklwMEeaGg0e+3uK4q07U9cDh9gC1e6GpYWzwSwuRh2\n"
+"B1VBamDgcl817Fw3/SmZnzxU23p/lfRzQ/rczqF3MN0OK3/tU60nLofGXtKz8kKH\n"
+"wm41JrTQLESF+Id1/Nu6+8FSzLjt/2475SpWebBAKK63iYYjk+n/VQD0tKP8AC5C\n"
+"HF8Z+g4cHxQv65RhKsTq7xDnUllvezmDpL/t0rFba/BDKVpU2hOMcRhMKNtAl8Sf\n"
+"B9R3VTJXILvvgEbYgZJ84Xzx4c7dhJMIYdiCba6NNkuUbWyB7HkQkS9ro4rshkua\n"
+"Llk2U1CJYojdkpw5FZkAhuGNRBaqQxZLbpEBJr7xIz3aynUuOhTDCMKqK8sTX1dW\n"
+"61Qmn7znC7YpSWftTlKBjY4wanJsAAaFzt8NtphcMWykmEc2fiYEM9I4Y0RpBoJF\n"
+"Uh8tL9QNITXMZ+0gWTAYVWyuS/Cl6jUGHX28JcupN+I9F/RaVB3iHNxHVQbIbaf1\n"
+"BjLGIB9FXbD8guFo652/ZtFvbM3KvMZzDO4tEUQ1/HU7k2kwSiqwPFmfj0/vOqRh\n"
+"WH6B05LWJWSzuEO+lKOdr9WrLyjsAvrFSunUq4psuAQpLZiQPaIJTHSvJwXpbmvD\n"
+"96YX8g7Oy5jIwq2YmCJtv8PAixTZ92jo7Nl40GmM8XdbnBGnz6Hm/U0tanalDD2e\n"
+"h3tBuFWipteNWoXFCBHwHN1xl/QsyhiyBs7LsQ4ORDyXQoAt0fo7UiqAjDzZwSkR\n"
+"GLOA4ZO20kvwZ7pj8ujOaK8K2Es0B/WWsdvc+CyyeAY/qMIf1M3b0WGjNjQaD8ps\n"
+"x8yU12Z9VxwSpr9PNA/G4HRSlRbsIlgZ90osZufNs2PDSJqPSq8Ji3jVnJ1WlwlT\n"
+"jij+SYvXIjIkHiPnawiDs7+BlnBYkHtAtrtyiI7TYfJvw9eUemB9GZOs8ktJKDIB\n"
+"/PnFI7Z4hEIBtgVpc/LkPlBOKy6bPAQuxy9WPhKXVOFTHDxhd/VNbb6Xgh2x/Mpc\n"
+"qxNmmbd1U0WERi+e7zFoKGc4PulapOg5rp6bOGaAL5Nc2aNTMFEwHQYDVR0OBBYE\n"
+"FI+Bj/bsy06ApU29SfW4OVuThsOmMB8GA1UdIwQYMBaAFI+Bj/bsy06ApU29SfW4\n"
+"OVuThsOmMA8GA1UdEwEB/wQFMAMBAf8wDQYLKwYBBAECggsHBgUDggzeAHm3jVUs\n"
+"Z6gOw1V9A2D3pRfBOYb+cGIOm65MuRuvdOji7DQVFd+2F7EphguW2VQdZc5c7UaC\n"
+"fQm01CECcY4SywOalNOWCUivDYLy+9TTNnkZAgRe90FCmL+u1WOM0PUUNYhstJv1\n"
+"43e/cr2xftlaPzVf8lJ1t6LOPCC9yF/slbL05Igx2lTNBgUoZE5JJPdTBT79hbjk\n"
+"4DMpS3SWauX3CGrxuDOgqlD7aui32tTBMS7teEg2XXt3GhZ7nMhiZ9iV83mcUE1y\n"
+"4IqKUolBe+O67PLEHRatKtgK4/vVoTSj6BumowMek8KShg6bxllfuVVagLUjZea3\n"
+"8/q+RccArx1mNR3E8pLlW8VZ+CIRLCVN4Dyffv6VaAI3F0ClEceLv9fZecMKYrR9\n"
+"pNn/aUikUqwYLOVMaRK44/pLwwR15WbEm6wV9rNT3aGCpAZu9Z30UzULOgw/blM/\n"
+"GJTFE+3PWsaqKP9LIq3wJuXFg9mo1aMxAB9lmmDWst/8RvV3wexjTSaIErERo/mt\n"
+"9MSXyaPe8bEE0d7BjbtYMgOp151gzzndUIXM6uwfkPvPUkrtO+dtUFUY2kVCIudG\n"
+"SfKqOGrteaTojytw6pPQ11J2FMJWMTEQypEVfFT/XlhmlcKK9s7YdYlM+OxYubEu\n"
+"X9CqBaiQjRTVbsMP4rqPTqdfpv2OrT1+oeS/P2be8sgvUTDagecHvgYR9pMBHfe8\n"
+"DHr9eXoujOy0XNioVUvNVt5qq8bJ/6svFf1Ln7aPwJbfknaLI7yMOoG64aO8fWo7\n"
+"Yeft9fdZcB2eVvQUGEn8ZcaJ7lqe3tM878jzlevQVnTTMPaBaTTvALb8MRY/WrHJ\n"
+"cT5heLH3PtcClTh6h76/GFUjYy1Uch574VN+3PCgOccyKAxotyR9h0npqUklcFAB\n"
+"5VGmkAUsk8tM/+HGbwDXNLr+Pvv7Y7Sl7BgNeMPqnHkp6omCD7rvso4ovkpF9AbK\n"
+"xk8MFWve4rWk+Jvz241r0jisY7sIqTH2QcySeYnoPG51cqPSXdR96t+Gw6KaYEOa\n"
+"ULfOaZ+JaKjpRbMJUhubvqVe7XB6fRyvDk/uq1Ydr7f4M4IcGXPJkYAlf6yWey3P\n"
+"T333sjJNWR0qno//VlJyrvV9MkWl3bLXhN3lQDbxhJkffG5UtgS1ym5RQjBb7RXU\n"
+"vzDy1za39h3uPpzixxSa963AQnW9ZoVAOP2q8GG56y9qstTjcPlycAMcQd9UJG4q\n"
+"q5MJDH0LgbcCN1kphoN446rUcXly2V5HEuE4jDRd4VdcBO+svZDrLpLqGKrK2zTa\n"
+"L/C/45rltLWISNnoWH7pm9TM1JTsihA43AL7BXvviwul5W9xedBJocdDTw2M7zUZ\n"
+"08kURNqYHIu+JQ6Qcvy1aWDB/B1k830rbd9Yu7zTnTgimZ7Dvu27nwDazwuwyH+y\n"
+"YWB3TJPwth6RvTWWwl//Ta9DD1uKr1bHc3kRsLP4mGUzs03jJFEbTvC0iL8F/cES\n"
+"C0aKTcDbKL/sB97UM8Ho5f6TGQnYPfjzcmHjG8SmVUQPDYLNnOzBUoxiXYX3x28p\n"
+"Roi0SbDAnSy6NyXY9gjJiswbX6V7K+dVOLFURdAPPz+slyQ/Q8bNfYhG6WQhSLqK\n"
+"sQLJqSdiZa/4kRKtsDEnqep93lEJlbiYhVHEVU2jUGwMo9IDg5SV7E7Xm3mUEDaL\n"
+"irnKnvly5rYis7dHSxaNBFtFy3caYgeAvJLgvnpYAzkT7rjcTKeuPETI3ZfkkHli\n"
+"LT7y59j7uqFR3h8voSIYl3zK4gVVfZxqyB5U36/ixsgfCRAi5LZ0bg0T992LD3LU\n"
+"JOQ3vdvYcbvMCkdorrYnONh5E/8WnbEDde0VDjKsjYnA9A4GJvRQXZSe/nw5PmPG\n"
+"PdnBSUR9XBugc0E5AmkZNCYUowflIu45G/2uDzlHyK6+BmwafwzaH7squGdJJPmd\n"
+"RYPbChls/3tMg5oBOnt+hTZTr1PRm8wxuc7G6+MozMSa1WAQT2+X3xFbj9MN3hCh\n"
+"2sAhE7np/V8U86BIr4oCHfMcLJcYed2qWLDL4OjCPIw0J7zS0/y8czkj9iMSsWun\n"
+"JOkrjnGzQ7qhnEOpJtD755DmTROJok4BxnfQ9ivhFg0YS7+HG1Eq68+EC+W08EQ1\n"
+"Vj0e8kmWoW+gCppDzKb4p7pOPskOigBhGCUZ1MLNKVe5PtfrMp9wjIcYh0vCD3Lh\n"
+"nckSZdbFLC9z2U5J+zBwzJ/TM6EsYaAxAUiEUmAPnlRPHv/9dtJW8Jp+2MM5ALte\n"
+"ObE1I7uZn1woJOWtev7k3+bXSB6sniYV1QdOwXj17tp+hcVTXlEOHOc0jxCjKzAw\n"
+"MvzucTaOUxyBepTXI1DtBk3YtcHd6SNE/SQhn7X0ptpVRkKZPHowHpu4bAKnhq9D\n"
+"BP4BbG+G/4oav7HsXig9ZGx/FQKA3wKoKVW/erH2rmtdXyKGEOXHZQq1jc414+cU\n"
+"teDfuOHplfUQSzZkDA4hqw1ZWGW8NTnDC5GOd9oqGqATP5L7LofdhO4ibDp0RmMm\n"
+"wewFrOyX+dTOqBe5If/d4JLtHQF8k81Bn8UID06RjDC5Xv53umlfuSOSs40Hmy+W\n"
+"O5dqpujnRfWjfuun4EiY+byGP/X0FHAM+FWk6Kn0a7mB+luSAQJFYlMMgka8Y8bt\n"
+"U+GTnNyQNjB3VVKWTCYSlKCpbHVq+ub3LCroon161/n3XIWjbq5s/uhFX7SzEBMJ\n"
+"5FReud6J8aTfixSg/zOe+CdbGhUAAunQq1Y8OS5+M4YWKsXgJZYfFBV8xnBmhmKR\n"
+"24fkdwKJ7U6yyZu5PUPoo+721IZ14ynFfGsX95m9+HhJjqtPNwGMtj6LAHp2Jnjh\n"
+"vE4hvABobEHsl4cLwWxptIkQ+wYtgj82Mr9iEBFgfcZK/E5bclICPcbBdMp2rlMG\n"
+"4JPzWNbFP1A+z9pdgT3QlTqn/SRok3fcyURPvxllkDHZGvOvQqwlI6daYYdMhNJa\n"
+"9TwmSfwET9LnmS7/mvI2JzVvg9mIRGheJkguPGzDGASTrTbEByD77jCVmiuVFeWo\n"
+"iWePhtNAki4xal31YFEEw+8Y3CprHp3/qQ0Zgy9J72UTEQVOq/Ymt0u+vyhzW0JD\n"
+"6ja4odUOVLsYQcSAL832WHitFkpzSIeRazC1Jr+LGUKmAtLvNhxsQryNkHoHU9/q\n"
+"xZ+0skKsnTQDSDR3hGQlFzMoWKvADRu71PSw3EYsh+1dwT0YmDiXqkFbu0gm2Vn0\n"
+"k1eDR9i7R+cvP8h7VDRvnYP9URvBLHHkFpQUjP/J+Fm6PfnhZKXr7liJpgO6bMeP\n"
+"MlQa9OfqmZXRZEjme/FVH592KtzToYHFdIIxFsI2OwvZoUR7oCeGcQ4gwbEkHkRw\n"
+"DonMW6Ov5bLqdFKKFuxgz8up3ia6Ffr05XQbh0cZ6yET8QbFplVRhNlao+HIEpUm\n"
+"uExHVQWnzhi5uc7eumUzd/OLw0Vf9RawTn8IL5ImE6MUlXf94+3pcTVXFXHF4O+0\n"
+"CJay9h7AJxcaiHIlby/IxTu3AfY10gm1k5yBsMiX6F39iGNJnqZ2ext6tGl31I6y\n"
+"Jx60YRQOdEcrYA4ch/1tfH2Vou6pyO6WwRun4SN5jauDPVAKyzWhpb1M2DHMIbfZ\n"
+"JF+NnRalBdbVxQJQJR9uIYY3li42Jr+CRZjTv0FuUhGyGTYqAfAouS42PZYKa9zP\n"
+"RopquLkto21t7iZVBjnBKAv7etnr3iJW6MVWkTKutIdYxDLMlrd4PpOMiF9EiyMa\n"
+"UX/QoRjFpRKz4wFBwc7omQiTWp4ifv0/ekN9ckn7l/47X2PeUFFzaE9Vc4ZOG6sc\n"
+"xye6JRCA5lR/7rY6ITnHGP8m4Z0BtZ6eOQbK13qlnGniOonhPxkH+iHn6XCZdTh0\n"
+"v1bNz11H8CU2NEEXp/36XYutOOt4etBO3ca2KTw6/euuOuZUDTYvZuqH+nTEkjUI\n"
+"pOfVEIxELjJBPe1z6jCE7uC7CQKu3JRFsH1MOwgPFjm/bSbpshcQBJTQ/AS8N9pZ\n"
+"Ww8Z0KG+Esm0R+U8Dp9NXHJW2KJW7fV85yngLVsW3DTlkSoUrQ9NOy+LBrxHfv+f\n"
+"aYqibnSovWyn+5dQXm3ZyoK0cbjP29VwO8gpiNpH+xINcZi7JlVk9GzmaZmJxsuN\n"
+"C2ttH45adn0gHiuUCe63FK1Wrc072v8DM6dB4R41bMWHrvZZ6TP5njCmKhU9baOx\n"
+"ZAbB7+vSroiWCEfPtD+VWNSJdWJs1r+zI4EmzVSEx+/fl6yhCmkROeLvBre3chsi\n"
+"BFV9wiSry6jDd3l0I6ododgBz4AmKcaX/1y50j5ulX+vHO7niOq7A1vF76Due1zo\n"
+"Mpp+k8vwhef2vn0FFDVJTIeoDFKQlLjvASAqq/Uydn7iDlFxirK50So9VVxmqM7R\n"
+"AAAAAAAAAAAAAAAAAAAAAAAABw0SFh0l\n"
+"-----END CERTIFICATE-----\n";
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/lib/tls_cert_chain.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/lib/tls_cert_chain.cpp
new file mode 100644
index 0000000..55da614
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/lib/tls_cert_chain.cpp
@@ -0,0 +1,544 @@
+/*
+* JS update 14.04.2024
+* Pridana podpora pre algoritmy ML-KEM a ML-DSA
+* Testovane s novou verziou liboqs 0.10.0
+*/
+
+/*
+* JS update 29.02.2024
+* Doplnene podmienky pre overenie certifikatov podla parametrov pre konkretny PQ algoritmus
+*/
+
+//
+// TLS1.3 X509 Certificate Processing Code
+//
+
+#include "tls_cert_chain.h"
+
+// extract Distinguished Name
+static void createFullName(octad *FN,octad *CERT,int ic,int len)
+{
+    OCT_kill(FN);
+    OCT_append_bytes(FN,&CERT->val[ic],len);
+
+/*
+    int c,len;
+    OCT_kill(FN);
+    c=X509_find_entity_property(CERT,&X509_MN,ic,&len);
+    OCT_append_bytes(FN,&CERT->val[c],len);
+    OCT_append_byte(FN,'/',1); // spacer
+    c=X509_find_entity_property(CERT,&X509_ON,ic,&len);
+    OCT_append_bytes(FN,&CERT->val[c],len);
+    OCT_append_byte(FN,'/',1);
+    c=X509_find_entity_property(CERT,&X509_UN,ic,&len);
+    OCT_append_bytes(FN,&CERT->val[c],len); */
+}
+
+// read a line of base64
+static int readaline(char *line,const char *rom,int &ptr)
+{
+    int i=0;
+    if (rom[ptr]==0) return 0;
+    while (rom[ptr]!='\n')
+    {
+        line[i++]=rom[ptr++];
+    }
+    ptr++; // jump over CR
+    line[i]=0;
+    return i;
+}
+
+// Extract public key from a certificate
+static pktype getPublicKeyFromCert(octad *CERT,octad *PUBLIC_KEY)
+{
+    pktype pk=X509_extract_public_key(CERT, PUBLIC_KEY);  // pull out its public key
+    return pk;
+}
+
+// extract host name
+static bool checkHostnameInCert(octad *CERT,char *hostname)
+{
+    int len;
+    int ic=X509_find_extensions(CERT);
+    int c=X509_find_extension(CERT,&X509_AN,ic,&len);
+    return (bool)X509_find_alt_name(CERT,c,hostname);
+}
+
+// Crude check for certificate validity
+static bool checkCertNotExpired(octad *CERT)
+{
+    int ic = X509_find_validity(CERT);
+    int c = X509_find_expiry_date(CERT, ic);
+    int year=2000+(CERT->val[c]-'0')*10 +CERT->val[c+1]-'0';
+    if (year<THIS_YEAR) return false;
+    return true;
+}
+
+// given root issuer and public key type of signature, search through root CAs and return root public key
+// This is a simple linear search through CA certificates found in the ca-certificates.crt file (borrowed from Ubuntu)
+// This file should be in Read-Only-Memory
+
+static bool findRootCA(octad* ISSUER,pktype st,octad *PUBKEY)
+{
+    char owner[TLS_X509_MAX_FIELD];
+    octad OWNER={0,sizeof(owner),owner};
+#ifdef SHALLOW_STACK
+    char *b=(char *)malloc(TLS_MAX_CERT_B64);
+    octad SC={0,TLS_MAX_CERT_B64,b};        // optimization - share memory - can convert from base64 to binary in place
+#else
+    char b[TLS_MAX_CERT_B64];                // maximum size for CA root signed certs in base64
+    octad SC={0,sizeof(b),b};                // optimization - share memory - can convert from base64 to binary in place
+#endif
+    char line[80]; int ptr=0;
+
+    for (;;)
+    {
+        int len,i=0;
+        if (!readaline(line,cacerts,ptr)) break;
+        for (;;)
+        {
+            len=readaline(line,cacerts,ptr);
+            if (line[0]=='-') break;
+            for (int j=0;j<len;j++)
+                b[i++]=line[j];
+            b[i]=0;
+        }
+        OCT_from_base64(&SC,b);
+        X509_extract_cert(&SC, &SC);  // extract Cert from Signed Cert
+
+        int ic = X509_find_issuer(&SC,&len);
+        createFullName(&OWNER,&SC,ic,len);
+
+        if (!checkCertNotExpired(&SC))
+        { // Its expired!
+            continue;
+        }
+
+        if (OCT_compare(&OWNER,ISSUER))
+        {
+            pktype pt = X509_extract_public_key(&SC, PUBKEY);
+            if (st.type==pt.type || st.curve==pt.curve) 
+            { // found CA cert 
+                if (st.type==X509_PQ || st.type==X509_HY || st.curve==pt.curve)
+                {
+#ifdef SHALLOW_STACK
+                    free(b);
+#endif
+//        char buff[256];
+//        OCT_output_base64(&OWNER,256,buff);
+//        printf("BASE64 DN = %s\n",buff);
+
+                    return true;
+                }
+            }
+        } 
+    }
+#ifdef SHALLOW_STACK
+    free(b);
+#endif
+    return false;  // couldn't find it
+}
+
+// strip signature off certificate. Return signature type
+static pktype stripDownCert(octad *CERT,octad *SIG,octad *ISSUER,octad *SUBJECT)
+{
+    int ic,len;
+    pktype sg=X509_extract_cert_sig(CERT,SIG);
+    X509_extract_cert(CERT,CERT);  // modifies CERT which is in the IO buffer!
+    ic = X509_find_issuer(CERT,&len);
+    createFullName(ISSUER,CERT,ic,len);
+    ic = X509_find_subject(CERT,&len);
+    createFullName(SUBJECT,CERT,ic,len);
+    return sg;
+}
+
+// Check signature on Certificate given signature type and public key
+static bool checkCertSig(pktype st,octad *CERT,octad *SIG, octad *PUBKEY)
+{
+// determine signature algorithm
+    bool res=false;
+
+    log(IO_DEBUG,(char *)"Signature  = ",NULL,0,SIG);
+    log(IO_DEBUG,(char *)"Public key = ",NULL,0,PUBKEY);
+    log(IO_DEBUG,(char *)"Checking Signature on Cert \n",NULL,0,NULL);
+
+// determine certificate signature type, by parsing pktype
+    if (st.type== X509_ECC && st.hash==X509_H256 && st.curve==USE_NIST256)
+        res=SAL_tlsSignatureVerify(ECDSA_SECP256R1_SHA256,CERT,SIG,PUBKEY);
+    if (st.type== X509_ECC && st.hash==X509_H384 && st.curve==USE_NIST384)
+        res=SAL_tlsSignatureVerify(ECDSA_SECP384R1_SHA384,CERT,SIG,PUBKEY);
+    if (st.type== X509_ECD && st.curve==USE_ED25519)
+        res=SAL_tlsSignatureVerify(ED25519,CERT,SIG,PUBKEY);
+    if (st.type== X509_ECD && st.curve==USE_ED448)
+        res=SAL_tlsSignatureVerify(ED448,CERT,SIG,PUBKEY);
+    if (st.type== X509_RSA && st.hash==X509_H256)
+        res=SAL_tlsSignatureVerify(RSA_PKCS1_SHA256,CERT,SIG,PUBKEY);
+    if (st.type== X509_RSA && st.hash==X509_H384)
+        res=SAL_tlsSignatureVerify(RSA_PKCS1_SHA384,CERT,SIG,PUBKEY);
+    if (st.type== X509_RSA && st.hash==X509_H512)
+        res=SAL_tlsSignatureVerify(RSA_PKCS1_SHA512,CERT,SIG,PUBKEY);
+
+
+    // JS doplnene PQ algoritmy
+    if (st.type== X509_PQ && st.curve==USE_DILITHIUM2)
+        res=SAL_tlsSignatureVerify(DILITHIUM2,CERT,SIG,PUBKEY);
+    if (st.type== X509_PQ && st.curve==USE_DILITHIUM3)
+        res=SAL_tlsSignatureVerify(DILITHIUM3,CERT,SIG,PUBKEY);
+    if (st.type== X509_PQ && st.curve==USE_DILITHIUM5)
+        res=SAL_tlsSignatureVerify(DILITHIUM5,CERT,SIG,PUBKEY);
+
+    if (st.type== X509_PQ && st.curve==USE_MLDSA44)
+        res=SAL_tlsSignatureVerify(MLDSA44,CERT,SIG,PUBKEY);
+    if (st.type== X509_PQ && st.curve==USE_MLDSA65)
+        res=SAL_tlsSignatureVerify(MLDSA65,CERT,SIG,PUBKEY);
+    if (st.type== X509_PQ && st.curve==USE_MLDSA87)
+        res=SAL_tlsSignatureVerify(MLDSA87,CERT,SIG,PUBKEY);
+    if (st.type== X509_PQ && st.curve==USE_FALCON512)
+        res=SAL_tlsSignatureVerify(FALCON512,CERT,SIG,PUBKEY);
+    if (st.type== X509_PQ && st.curve==USE_FALCON1024)
+        res=SAL_tlsSignatureVerify(FALCON1024,CERT,SIG,PUBKEY);
+    
+    if (st.type== X509_PQ && st.curve==USE_SPHINCSSHA2128FSIMPLE && st.hash==X509_H256)
+        res=SAL_tlsSignatureVerify(SPHINCSSHA2128FSIMPLE,CERT,SIG,PUBKEY);
+    if (st.type== X509_PQ && st.curve==USE_SPHINCSSHAKE128FSIMPLE && st.hash==X509_SHAKE256)
+        res=SAL_tlsSignatureVerify(SPHINCSSHAKE128FSIMPLE,CERT,SIG,PUBKEY);
+    if (st.type== X509_PQ && st.curve==USE_SPHINCSSHA2128SSIMPLE)
+        res=SAL_tlsSignatureVerify(SPHINCSSHA2128SSIMPLE,CERT,SIG,PUBKEY);
+    //if (st.type== X509_PQ && st.curve==USE_SPHINCSSHA2192FSIMPLE)
+    //    res=SAL_tlsSignatureVerify(USE_SPHINCSSHA2192FSIMPLE,CERT,SIG,PUBKEY);
+
+// probably deepest into the stack at this stage.... (especially for Dilithium)
+
+    if (st.type==X509_HY)
+    {
+        octad FPUB={65,65,PUBKEY->val};
+        octad SPUB={PUBKEY->len-65,PUBKEY->len-65,&PUBKEY->val[65]};
+        octad FSIG={64,64,SIG->val};
+        octad SSIG={SIG->len-64,SIG->len-64,&SIG->val[64]};
+        res = SAL_tlsSignatureVerify(ECDSA_SECP256R1_SHA384,CERT,&FSIG,&FPUB) && SAL_tlsSignatureVerify(DILITHIUM2,CERT,&SSIG,&SPUB);
+    }
+
+    if (res)
+    {
+        log(IO_DEBUG,(char *)"Cert Signature Verification succeeded \n",NULL,0,NULL);
+        return true;
+    } else {
+        log(IO_DEBUG,(char *)"Cert Signature Verification Failed\n",NULL,0,NULL);
+        return false;
+    }
+}
+
+// Read in raw certificate chain from file, and serialize it for transmission
+// Read in client private key from .pem file
+// NOTE: key type can be determined from either the public key or the private key. They should be the same.
+// Here we get the type from the X.509 private key 
+// What if its a raw public key, and the private key is in hardware? The type is stored along with the cert..
+#if CLIENT_CERT != NOCERT
+int getClientPrivateKeyandCertChain(octad *PRIVKEY,int cert_type,octad *CERTCHAIN)
+{
+    int i,kind,ptr,len;
+    pktype pk;
+#ifdef SHALLOW_STACK
+    char *b=(char *)malloc(TLS_MAX_CERT_B64);
+    octad SC={0,TLS_MAX_CERT_B64,b};       // optimization - share memory - can convert from base64 to binary in place
+#else
+    char b[TLS_MAX_CERT_B64];    // maximum size key/cert
+    octad SC={0,sizeof(b),b};    // share memory - can convert from base64 to binary in place
+#endif
+    char line[80]; 
+    
+    OCT_kill(CERTCHAIN);
+// should be a chain of certificates, one after the other. May just be one self-signed
+    ptr=0;
+    for (;;)
+    {
+        i=0;
+        if (!readaline(line,mycert,ptr)) break;
+        for (;;)
+        {
+            len=readaline(line,mycert,ptr);
+            if (line[0]=='-') break;
+            for (int j=0;j<len;j++)
+                b[i++]=line[j];
+            b[i]=0;
+        }
+        OCT_from_base64(&SC,b);
+
+// Maybe send raw key instead?
+        if (cert_type==RAW_PUBLIC_KEY)
+        {
+            X509_extract_cert(&SC,&SC);
+            len=X509_find_public_key(&SC,&ptr);
+            octad PK={len,len,&SC.val[ptr]};
+            OCT_append_int(CERTCHAIN,len,3);
+            OCT_append_octad(CERTCHAIN,&PK);
+            break;
+        }
+
+// add to Certificate Chain
+        OCT_append_int(CERTCHAIN,SC.len,3);
+        OCT_append_octad(CERTCHAIN,&SC);
+        OCT_append_int(CERTCHAIN,0,2);  // add no certificate extensions
+    }
+
+    if (myprivate!=NULL)
+    { // unless private key is in protected hardware, so SAL has it already
+        ptr=0; i=0;
+        readaline(line,myprivate,ptr);
+        for (;;)
+        {
+            len=readaline(line,myprivate,ptr);
+            if (line[0]=='-') break;
+            for (int j=0;j<len;j++)
+                b[i++]=line[j];
+            b[i]=0;
+        }
+        OCT_from_base64(&SC,b);
+        pk=X509_extract_private_key(&SC, PRIVKEY); // returns signature type
+    }
+
+#ifdef SHALLOW_STACK
+    free(b);
+#endif
+
+    if (myprivate==NULL)
+    { // its in hardware. Get what type it is
+        int clientCertReqs[TLS_MAX_SUPPORTED_SIGS];
+        getSigRequirements(clientCertReqs);
+        return clientCertReqs[0];
+    }
+
+
+// figure out kind of signature client can apply - will be tested against client capabilities
+// Note that no hash type is specified - its just a private key, no algorithm specified
+    kind=0;
+    if (pk.type==X509_ECC)
+    {
+        if (pk.curve==USE_NIST256) kind=ECDSA_SECP256R1_SHA256;  // as long as this is a client capability
+        if (pk.curve==USE_NIST384) kind=ECDSA_SECP384R1_SHA384;  // as long as this is a client capability
+    }
+    if (pk.type==X509_RSA)
+    {
+        kind=RSA_PSS_RSAE_SHA256;  // as long as this is a capability
+    }
+    if (pk.type==X509_PQ)
+    {
+        // JS definovanie PQ algoritmov
+        if (pk.curve==USE_DILITHIUM2) kind=DILITHIUM2;
+        if (pk.curve==USE_DILITHIUM3) kind=DILITHIUM3;
+        if (pk.curve==USE_DILITHIUM5) kind=DILITHIUM5;
+        if (pk.curve==USE_FALCON512) kind=FALCON512;
+        if (pk.curve==USE_MLDSA44) kind=MLDSA44;
+        if (pk.curve==USE_MLDSA65) kind=MLDSA65;
+        if (pk.curve==USE_MLDSA87) kind=MLDSA87;
+        if (pk.curve==USE_FALCON1024) kind=FALCON1024;
+        // JS Sphincs 128F_simple pouzivaju rovnaku curve nezavisle od toho ci ide o sha alebo shake verziu
+        if (pk.curve==USE_SPHINCSSHA2128FSIMPLE) kind=SPHINCSSHA2128FSIMPLE;
+        if (pk.curve==USE_SPHINCSSHA2128SSIMPLE) kind=SPHINCSSHA2128SSIMPLE;
+        if (pk.curve==USE_SPHINCSSHAKE128FSIMPLE) kind=SPHINCSSHAKE128FSIMPLE;
+       //if (pk.curve==USE_SPHINCSSHA2192FSIMPLE) kind=SPHINCSSHA2192FSIMPLE;
+
+        
+    
+    }
+    if (pk.type==X509_HY)
+    {
+        kind=DILITHIUM2_P256;  
+    }
+    if (pk.type==X509_ECD)
+    {
+        if (pk.curve==USE_ED25519) kind=ED25519;  // as long as this is a client capability
+        if (pk.curve==USE_ED448) kind=ED448;  // as long as this is a client capability
+    }
+    return kind;
+}
+#endif
+
+// Check certificate has not expired
+// Detach signature from certificate
+// Check if self-signed
+// Check signature and public keys are supported types
+// Check subject of this certificate is issuer of previous certificate in the chain
+// output signature and public key, and issuer of this certificate
+static int parseCert(octad *SCERT,pktype &sst,octad *SSIG,octad *PREVIOUS_ISSUER,pktype &spt,octad *PUBKEY)
+{
+    char subject[TLS_X509_MAX_FIELD];
+    octad SUBJECT={0,sizeof(subject),subject};
+    char issuer[TLS_X509_MAX_FIELD];  
+    octad ISSUER={0,sizeof(issuer),issuer};
+
+    sst=stripDownCert(SCERT,SSIG,&ISSUER,&SUBJECT);    // break down Cert and extract signature
+
+    if (!checkCertNotExpired(SCERT)) {
+        log(IO_DEBUG,(char *)"Certificate has expired\n",NULL,0,NULL);
+        return  CERT_OUTOFDATE;
+    }
+    if (sst.type==0)
+    {
+        log(IO_DEBUG,(char *)"Unrecognised Signature Type\n",NULL,0,NULL);
+        return BAD_CERT_CHAIN;
+    }
+
+    spt=getPublicKeyFromCert(SCERT,PUBKEY);
+    logCertDetails(PUBKEY,spt,SSIG,sst,&ISSUER,&SUBJECT);
+
+    if (spt.type==0)
+    {
+        log(IO_DEBUG,(char *)"Unrecognised Public key Type\n",NULL,0,NULL);
+        return BAD_CERT_CHAIN;
+    }
+
+    if (OCT_compare(&ISSUER,&SUBJECT))
+    { //self-signed certificate
+        log(IO_DEBUG,(char *)"Self signed Cert\n",NULL,0,NULL);
+        return SELF_SIGNED_CERT;   // not necessarily fatal
+    }
+
+    if (PREVIOUS_ISSUER->len!=0)
+    { // there was one
+        if (!OCT_compare(PREVIOUS_ISSUER,&SUBJECT))
+        { // Is subject of this cert the issuer of the previous cert?
+            log(IO_DEBUG,(char *)"Subject of this certificate is not issuer of prior certificate\n",NULL,0,NULL);
+            return BAD_CERT_CHAIN;
+        }
+    }
+    OCT_copy(PREVIOUS_ISSUER,&ISSUER); // update issuer
+
+    return 0;
+}
+
+// extract server public key, and check validity of certificate chain
+// ensures that the hostname is valid.
+// Assumes simple chain Server Cert->Intermediate Cert->CA cert
+// CA cert not read from chain (if its even there). 
+// Search for issuer of Intermediate Cert in cert store 
+int checkServerCertChain(octad *CERTCHAIN,char *hostname,int cert_type,octad *PUBKEY,octad *SERVER_SIG)
+{
+    ret r;
+    int rtn,len,ptr=0;
+    pktype sst,ist,spt,ipt;
+
+// Clever re-use of memory - use pointers into cert chain rather than extracting certs
+    octad SERVER_CERT;  // server certificate
+    SERVER_CERT.len=0;
+    octad INTER_CERT;  // signature on intermediate certificate
+    INTER_CERT.len=0;
+
+    char issuer[TLS_X509_MAX_FIELD];  
+    octad ISSUER={0,sizeof(issuer),issuer};
+
+// Extract and process Server Cert
+    r=parseInt(CERTCHAIN,3,ptr); len=r.val; if (r.err) return r.err; // get length of first (server) certificate
+    if (len==0)
+        return EMPTY_CERT_CHAIN;
+
+    r=parseoctadptr(&SERVER_CERT,len,CERTCHAIN,ptr); if (r.err) return r.err;
+
+    if (cert_type==RAW_PUBLIC_KEY) { // its not a certificate, its a raw public key. We agreed that this was OK.
+        X509_get_public_key(&SERVER_CERT,PUBKEY);
+        return 0;  // NOTE no confirmation of identity
+    }
+
+    r=parseInt(CERTCHAIN,2,ptr); len=r.val; if (r.err) return r.err;
+    ptr+=len;   // skip certificate extensions
+
+// Check and parse Server Cert
+    rtn=parseCert(&SERVER_CERT,sst,SERVER_SIG,&ISSUER,spt,PUBKEY);
+    if (rtn != 0) {
+        if (rtn==SELF_SIGNED_CERT)
+        {
+            if (!checkCertSig(sst,&SERVER_CERT,SERVER_SIG,PUBKEY)) {
+                return BAD_CERT_CHAIN;
+            }
+        } else {
+            return rtn;
+        }
+    }
+// Confirm Identity - public key is associated with this hostname
+    if (!checkHostnameInCert(&SERVER_CERT,hostname) && strcmp(hostname,"localhost")!=0)
+    { // Check that certificate covers the server URL
+        log(IO_PROTOCOL,(char *)"Hostname NOT found in certificate\n",NULL,0,NULL);
+        return BAD_CERT_CHAIN;
+    }
+
+    if (rtn==SELF_SIGNED_CERT) 
+    {
+#ifdef ALLOW_SELF_SIGNED
+        log(IO_PROTOCOL,(char *)"Self-signed Certificate allowed\n",NULL,0,NULL);
+        return 0;  // If self-signed, thats the end of the chain. And for development its acceptable
+#else
+        return rtn;
+#endif
+    }
+    if (ptr==CERTCHAIN->len)
+    {
+        log(IO_DEBUG,(char *)"Non-self-signed Chain of length 1 ended unexpectedly\n",NULL,0,NULL);
+        return BAD_CERT_CHAIN;
+    }
+
+// Extract and process Intermediate Cert
+    r=parseInt(CERTCHAIN,3,ptr); len=r.val; if (r.err) return r.err; // get length of next certificate
+    if (len==0)
+        return EMPTY_CERT_CHAIN;
+
+    r=parseoctadptr(&INTER_CERT,len,CERTCHAIN,ptr); if (r.err) return r.err;
+
+    r=parseInt(CERTCHAIN,2,ptr); len=r.val; if (r.err) return r.err;
+    ptr+=len;   // skip certificate extensions
+
+    if (ptr<CERTCHAIN->len)
+        log(IO_PROTOCOL,(char *)"Warning - there are unprocessed Certificates in the Chain\n",NULL,0,NULL);
+
+#ifdef SHALLOW_STACK
+    octad INTER_SIG={0,TLS_MAX_SIGNATURE_SIZE,(char *)malloc(TLS_MAX_SIGNATURE_SIZE)};
+    octad PK = {0, TLS_MAX_SIG_PUB_KEY_SIZE, (char *)malloc(TLS_MAX_SIG_PUB_KEY_SIZE)};
+#else
+    char inter_sig[TLS_MAX_SIGNATURE_SIZE];  // signature on intermediate certificate
+    octad INTER_SIG={0,sizeof(inter_sig),inter_sig};
+    char pk[TLS_MAX_SIG_PUB_KEY_SIZE];  // Public Key 
+    octad PK = {0, sizeof(pk), pk};
+#endif
+
+// Check and parse Intermediate Cert
+    rtn=parseCert(&INTER_CERT,ist,&INTER_SIG,&ISSUER,ipt,&PK);
+    if (rtn != 0) {
+#ifdef SHALLOW_STACK
+        free(INTER_SIG.val); free(PK.val);
+#endif
+        return BAD_CERT_CHAIN;
+    }
+
+    if (!checkCertSig(sst,&SERVER_CERT,SERVER_SIG,&PK)) {  // Check intermediate signature on Server's certificate 
+        log(IO_DEBUG,(char *)"Server Certificate sig is NOT OK\n",NULL,0,NULL);
+#ifdef SHALLOW_STACK
+        free(INTER_SIG.val); free(PK.val);
+#endif
+        return BAD_CERT_CHAIN;
+    }
+    log(IO_DEBUG,(char *)"Server Certificate sig is OK\n",NULL,0,NULL);
+
+// Find Root of Trust
+// Find root certificate public key
+    if (!findRootCA(&ISSUER,ist,&PK)) {
+        log(IO_DEBUG,(char *)"Root Certificate not found\n",NULL,0,NULL);
+#ifdef SHALLOW_STACK
+        free(INTER_SIG.val); free(PK.val);
+#endif
+        return CA_NOT_FOUND;
+    }       
+    log(IO_DEBUG,(char *)"\nPublic Key from root cert= ",NULL,0,&PK);
+
+    if (!checkCertSig(ist,&INTER_CERT,&INTER_SIG,&PK)) {  // Check signature on intermediate cert with root cert public key
+        log(IO_DEBUG,(char *)"Root Certificate sig is NOT OK\n",NULL,0,NULL);
+#ifdef SHALLOW_STACK
+        free(INTER_SIG.val); free(PK.val);
+#endif
+        return BAD_CERT_CHAIN;
+    }
+    log(IO_DEBUG,(char *)"Root Certificate sig is OK\n",NULL,0,NULL);
+#ifdef SHALLOW_STACK
+    free(INTER_SIG.val); free(PK.val);
+#endif
+    return 0;
+}
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/lib/tls_client_cert.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/lib/tls_client_cert.cpp
new file mode 100644
index 0000000..d474f02
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/lib/tls_client_cert.cpp
@@ -0,0 +1,701 @@
+//
+// Client Certificate data stored here
+// My private key and my certificate
+//
+
+#include "tls_certs.h"
+
+
+// a preferred root CA
+// actually root CA of www.bbc.co.uk
+// const char *mysupportedca[1]={(char *)"MEwxIDAeBgNVBAsTF0dsb2JhbFNpZ24gUm9vdCBDQSAtIFIzMRMwEQYDVQQKEwpHbG9iYWxTaWduMRMwEQYDVQQDEwpHbG9iYWxTaWdu"};
+
+
+#if CLIENT_CERT == ECC_SS
+
+// My personal ECDSA private key - Certificate expires Jan 2026
+const char *myprivate=(char *)
+"-----BEGIN PRIVATE KEY-----\n"
+"MIGHAgEAMBMGByqGSM49AgEGCCqGSM49AwEHBG0wawIBAQQgwmEaEau6Dybv+N5d\n"
+"1v+BkVWYQZhNsNu/X8JPZzZgTd6hRANCAAQvn/UmTjXDk41r0ow6+LfsA3qdKV2K\n"
+"1eRIv6axrsfEKds9poshRyvEgy4M8WYZlyOOchiVcO2jTyxvH1Xun/WH\n"
+"-----END PRIVATE KEY-----\n";
+
+// self-signed cert
+const char *mycert=(char *)
+"-----BEGIN CERTIFICATE-----\n"
+"MIICdDCCAhmgAwIBAgIUPDaj+Hv0/zO5MmUpKn2EvnrRJrEwCgYIKoZIzj0EAwIw\n"
+"gY4xCzAJBgNVBAYTAklFMRAwDgYDVQQIDAdJcmVsYW5kMQ8wDQYDVQQHDAZEdWJs\n"
+"aW4xDzANBgNVBAoMBlNoYW11czERMA8GA1UECwwIUmVzZWFyY2gxEzARBgNVBAMM\n"
+"Ck1pa2UgU2NvdHQxIzAhBgkqhkiG9w0BCQEWFG1pY2hhZWwuc2NvdHRAdGlpLmFl\n"
+"MB4XDTIzMDQyNjE4MDMwNloXDTI2MDEyMDE4MDMwNlowgY4xCzAJBgNVBAYTAklF\n"
+"MRAwDgYDVQQIDAdJcmVsYW5kMQ8wDQYDVQQHDAZEdWJsaW4xDzANBgNVBAoMBlNo\n"
+"YW11czERMA8GA1UECwwIUmVzZWFyY2gxEzARBgNVBAMMCk1pa2UgU2NvdHQxIzAh\n"
+"BgkqhkiG9w0BCQEWFG1pY2hhZWwuc2NvdHRAdGlpLmFlMFkwEwYHKoZIzj0CAQYI\n"
+"KoZIzj0DAQcDQgAEL5/1Jk41w5ONa9KMOvi37AN6nSlditXkSL+msa7HxCnbPaaL\n"
+"IUcrxIMuDPFmGZcjjnIYlXDto08sbx9V7p/1h6NTMFEwHQYDVR0OBBYEFDOMT9fP\n"
+"R8x88EC9TzUeTZ8Af4o7MB8GA1UdIwQYMBaAFDOMT9fPR8x88EC9TzUeTZ8Af4o7\n"
+"MA8GA1UdEwEB/wQFMAMBAf8wCgYIKoZIzj0EAwIDSQAwRgIhAMjslzs/qSlwxY5q\n"
+"PIj1zkn3Z7bknRV3ICsVzl9hhGJBAiEAkhUnhBuPHgTuGJ3c1xGIIEjNDKvW7Fhc\n"
+"94BzAlOIACk=\n"
+"-----END CERTIFICATE-----\n";
+
+// Report signature requirements for our certificate chain
+int getSigRequirements(int *sigReqs) {
+    sigReqs[0]=ECDSA_SECP256R1_SHA256;
+    return 1;
+}
+
+#endif
+
+#if CLIENT_CERT == EDD_SS
+
+// My personal EDDSA private key - Certificate expires Jan 2026
+const char *myprivate=(char *)
+"-----BEGIN PRIVATE KEY-----\n"
+"MC4CAQAwBQYDK2VwBCIEIHlr6fjIis7VBPeGoP78bBXunfGqRNfv2PM6B/GurYTV\n"
+"-----END PRIVATE KEY-----\n";
+
+// self-signed cert
+const char *mycert=(char *)
+"-----BEGIN CERTIFICATE-----\n"
+"MIICMzCCAeWgAwIBAgIUBRZr5MpC58wQdpEZdnwSy43EhS0wBQYDK2VwMIGOMQsw\n"
+"CQYDVQQGEwJJRTEQMA4GA1UECAwHSXJlbGFuZDEPMA0GA1UEBwwGRHVibGluMQ8w\n"
+"DQYDVQQKDAZTaGFtdXMxETAPBgNVBAsMCFJlc2VhcmNoMRMwEQYDVQQDDApNaWtl\n"
+"IFNjb3R0MSMwIQYJKoZIhvcNAQkBFhRtaWNoYWVsLnNjb3R0QHRpaS5hZTAeFw0y\n"
+"MzA1MDIxNDMzMDVaFw0yNjAxMjYxNDMzMDVaMIGOMQswCQYDVQQGEwJJRTEQMA4G\n"
+"A1UECAwHSXJlbGFuZDEPMA0GA1UEBwwGRHVibGluMQ8wDQYDVQQKDAZTaGFtdXMx\n"
+"ETAPBgNVBAsMCFJlc2VhcmNoMRMwEQYDVQQDDApNaWtlIFNjb3R0MSMwIQYJKoZI\n"
+"hvcNAQkBFhRtaWNoYWVsLnNjb3R0QHRpaS5hZTAqMAUGAytlcAMhALvif4QmTzbS\n"
+"RuZAB6zRDtIcCOL5dJf1IP+7TQRlZ1I/o1MwUTAdBgNVHQ4EFgQUC6drttANglSF\n"
+"PbodPcsgxasZ5TYwHwYDVR0jBBgwFoAUC6drttANglSFPbodPcsgxasZ5TYwDwYD\n"
+"VR0TAQH/BAUwAwEB/zAFBgMrZXADQQAx2L90LWfhs2LJG5xcMyFB0YMG7ebbapbL\n"
+"2ij1QxL+kyyx5x/7lTJZZin8I036tLR739JOW05uwtjq+im49QQE\n"
+"-----END CERTIFICATE-----\n";
+
+// Report signature requirements for our certificate chain
+int getSigRequirements(int *sigReqs) {
+    sigReqs[0]=ED25519;
+    return 1;
+}
+
+#endif
+
+
+#if CLIENT_CERT == HW_1
+// My first Arduino Nano RP2040 self-signed Cert. Private key is on the board slot 0. Expires November 2026
+const char *myprivate=NULL;
+
+const char *mycert=(char *) 
+"-----BEGIN CERTIFICATE-----\n"
+"MIIBKzCB0aADAgECAgEBMAoGCCqGSM49BAMCMB0xGzAZBgNVBAMTEjAxMjM0NjI0QjIwMjYwRDdF\n"
+"RTAeFw0yMTExMTgxMTAwMDBaFw0yNjExMTgxMTAwMDBaMB0xGzAZBgNVBAMTEjAxMjM0NjI0QjIw\n"
+"MjYwRDdFRTBZMBMGByqGSM49AgEGCCqGSM49AwEHA0IABDOFj/SnArwqM15cZs/bXppfTuAxgMzB\n"
+"N3LS48xHSqpLhHlVnvOvWqyhE8v+ZX4Jzlo7Z9LGOG537EeldBeGjYijAjAAMAoGCCqGSM49BAMC\n"
+"A0kAMEYCIQC9O1l85YX1+9vZ0t/SHQ3zFH5e7Vc8XtrZ+mTtMc5riwIhAL/SektrG3C0JwII0VV5\n"
+"pSR9RRnuwo810km81P4S56/m\n"
+"-----END CERTIFICATE-----\n";
+
+// Report signature requirements for our certificate chain
+int getSigRequirements(int *sigReqs) {
+    sigReqs[0]=ECDSA_SECP256R1_SHA256;
+    return 1;
+}
+
+#endif
+
+#if CLIENT_CERT == HW_2
+// My second Arduino Nano RP2040 self-signed Cert. Private key is on the board slot 0. Expires December 2026
+const char *myprivate=NULL;
+
+const char *mycert=(char *) 
+"-----BEGIN CERTIFICATE-----\n"
+"MIIBKzCB0aADAgECAgEBMAoGCCqGSM49BAMCMB0xGzAZBgNVBAMTEjAxMjM2RDlBNkNDRUQ5RUNF\n"
+"RTAeFw0yMTEyMjgxMjAwMDBaFw0yNjEyMjgxMjAwMDBaMB0xGzAZBgNVBAMTEjAxMjM2RDlBNkND\n"
+"RUQ5RUNFRTBZMBMGByqGSM49AgEGCCqGSM49AwEHA0IABBxL51SsKUIJ6Akw2IMsn3PMa5tm8kRT\n"
+"NDLBHfvIPZh05hoVnR3LO4+Ho91dMbN38tVM71opoTzPtIWrj5L6WI6jAjAAMAoGCCqGSM49BAMC\n"
+"A0kAMEYCIQDgqosqLRntTyehtDCuWcY6WP41sfwx1k78W6EkLpoDyQIhAPzxQawMjI9mLeePF6Kk\n"
+"BzPRSurX7+nLFDC6u3pfmEY8\n"
+"-----END CERTIFICATE-----\n";
+
+// Report signature requirements for our certificate chain
+int getSigRequirements(int *sigReqs) {
+    sigReqs[0]=ECDSA_SECP256R1_SHA256;
+    return 1;
+}
+#endif
+
+/*
+// My Arduino Nano 33 IoT self-signed Cert. Private key is on the board slot 0. Expires July 2031
+const char *myprivate=NULL;
+
+const char *mycert=(char *) 
+"-----BEGIN CERTIFICATE-----\n"
+"MIIBKjCB0aADAgECAgEBMAoGCCqGSM49BAMCMB0xGzAZBgNVBAMTEjAxMjNBMDUz\n"
+"MEQ0RkU1RUVFRTAeFw0yMTA3MDQxNTAwMDBaFw0zMTA3MDQxNTAwMDBaMB0xGzAZ\n"
+"BgNVBAMTEjAxMjNBMDUzMEQ0RkU1RUVFRTBZMBMGByqGSM49AgEGCCqGSM49AwEH\n"
+"A0IABL8xBsAdr4E1MZMoQeA6hmklaiidF8gpgZWmRkSfIIyHwMup/wsz4eTGAB5J\n"
+"IhLI/gFGVjsAU+WK7ulsW5YgxCqjAjAAMAoGCCqGSM49BAMCA0gAMEUCIQDYWgeH\n"
+"TF7AcJH+3nr7VQo8acgoyhlPnR62xwjj0AsUcwIgQ9qgNjVtZgoZC5+fTpPyG7dt\n"
+"1YI/aNe4SDOv0a2jtmc=\n"
+"-----END CERTIFICATE-----\n";
+*/
+
+#if CLIENT_CERT == RSA_SS
+// My personal private key RSA 2048 bits - expires October 2025
+const char *myprivate=(char *)
+"-----BEGIN PRIVATE KEY-----\n"
+"MIIEvgIBADANBgkqhkiG9w0BAQEFAASCBKgwggSkAgEAAoIBAQDPopFHQN4sWfEO\n"
+"fwKMqZAYOZCbpS13lZTYGlIsDOe4Ak3ZoKpkQw/evePpmfRJt3c76m57c9CM53z0\n"
+"P0P820IOahlzU+02WcAfgDCBYrCmbKwm2H5HhylBiHF5AlvgoOf/J2xXadK6Afll\n"
+"7+gCEZTfBpbfqX2uPO8zLzzrRRVxi8NMky3hVtjoZMtfn9yshLe2Tb9UfZjXMe60\n"
+"u4Zc9+azAA3QBilUWtSAFI461svZzSQvkZs5n14hcbTqzNBMR4qQXBZtqq/SDYQs\n"
+"p5jqFVmDEQOSTFndwIBEJ+g7vBAberjeh9R+bAHftHAGkMvmrqHLMkD5qAp1D1bc\n"
+"8l+3i8etAgMBAAECggEACxUYP/9cXG2oiieJUUyznjdkWopkdN+NBEPTYvqFW7Lz\n"
+"yMvkjFlv/WmRQqSu/0hFmvMWVoyF8x9f8gF2dYaWbgKHvTobjS0ZLhU/gYhs+VUP\n"
+"kzs28kZqk07fD6BqmwC7oUjPZZMGZls4npJBheq+UXEemG2JgcVK1yaMT9puHJNK\n"
+"dKqP4i37KSKzXmhWTptCrk7cOXZYYFzhKm7xbG+wWqPpVhVbJIAMEvA4PBOMY2f5\n"
+"M+OXF3W82nl6hRTHEUUl26NkkKrzFHHkLbTZsBocnpy42tIImOCHPvlf6AJqEO6Y\n"
+"mp47sCCg5N3AE8Ztg2EF+EAwCDNEZf+df66lLzztgQKBgQD6qgOluasejwJLzmOp\n"
+"E6iI4YgPkEG+8HIquJn3EtmVaOWl2w0f5g6PpEjMum8nqyb+qBEgRiV7FYy+KyCv\n"
+"c82/jPyN7wtvUZpjBmDEX3mHMvlFFvd1u0/W5AroH8JnHMNRb5cTwJPVNFp5iL/T\n"
+"ipgSuRGrvnx0jgT8t5MQ1yICkQKBgQDUDhFSPJyNxWpdh022rMxH5FIphbFATt9E\n"
+"/I/uxIxUVtFelvP4dmhUcq5laeE9gegdV7o5cnbKS2T22qffaj5uTcicivPfNeBr\n"
+"+UQX8rEjfq+25278zecQv6WlHNR6Duo6aLtOQR1VGrD7y6XX4T62NF2+oBHtVrgh\n"
+"HQTJ1d3JXQKBgQDaWT7UHefxtqFJZ39oyLcGhW8AH6klqk3I6QU1NDZU8AsbbrUA\n"
+"FGaauYCw1bX92Bkfu0cv1erQTPVMskTGkRmowic9e/15+puBpwykAobaPozkohzt\n"
+"cT0a84qMqR2utF9vkMUJb7dXAUPOmlB+9TuDE7NQ552B6jRt73ssMDpwAQKBgF7F\n"
+"ssQYRret5W3LjNX5wIrY5keccq2VEoAYiJNj0HvZGVW3DW6cLOChKIQ2n+4HYx/K\n"
+"F3aZS7H5pDQXYTOenixaIzCjgX7e62AWVXKGiticRBfws0/VDlIT9QooKmYqyFA2\n"
+"go/k1iE0/qhqScKD7q0sFkGd9KUoPr6942f5Z1gZAoGBALbA84ln9+6WilePWd56\n"
+"9Stjm1hFbMvxH4GfFRWYyyKLI2/xRhF/botoOw9s5KaWv515ENphKjkSlOe/2ymm\n"
+"2TmDZxokL5ZtxJrUzYOGA1Y1rfFspquDiiMSV/nk4VBucNHXk855l/x1S8DeR2K2\n"
+"lYtWM/F1mJ0keAIM9bnn1iII\n"
+"-----END PRIVATE KEY-----\n";
+
+// A chain of certificates - just one self-signed here
+const char *mycert=(char *)
+"-----BEGIN CERTIFICATE-----\n"
+"MIIEJzCCAw+gAwIBAgIUT1xD+P/lcf5CVT4nEnjkDHCx2BYwDQYJKoZIhvcNAQEL\n"
+"BQAwgaIxCzAJBgNVBAYTAklFMQ8wDQYDVQQIDAZVbHN0ZXIxFzAVBgNVBAcMDkJh\n"
+"bGx5amFtZXNkdWZmMRgwFgYDVQQKDA9TaGFtdXMgU29mdHdhcmUxETAPBgNVBAsM\n"
+"CFJlc2VhcmNoMRYwFAYDVQQDDA1NaWNoYWVsIFNjb3R0MSQwIgYJKoZIhvcNAQkB\n"
+"FhVtaWtlLnNjb3R0QG1pcmFjbC5jb20wHhcNMjMwMTA1MDU1MDU2WhcNMjUxMDAx\n"
+"MDU1MDU2WjCBojELMAkGA1UEBhMCSUUxDzANBgNVBAgMBlVsc3RlcjEXMBUGA1UE\n"
+"BwwOQmFsbHlqYW1lc2R1ZmYxGDAWBgNVBAoMD1NoYW11cyBTb2Z0d2FyZTERMA8G\n"
+"A1UECwwIUmVzZWFyY2gxFjAUBgNVBAMMDU1pY2hhZWwgU2NvdHQxJDAiBgkqhkiG\n"
+"9w0BCQEWFW1pa2Uuc2NvdHRAbWlyYWNsLmNvbTCCASIwDQYJKoZIhvcNAQEBBQAD\n"
+"ggEPADCCAQoCggEBAM+ikUdA3ixZ8Q5/AoypkBg5kJulLXeVlNgaUiwM57gCTdmg\n"
+"qmRDD9694+mZ9Em3dzvqbntz0IznfPQ/Q/zbQg5qGXNT7TZZwB+AMIFisKZsrCbY\n"
+"fkeHKUGIcXkCW+Cg5/8nbFdp0roB+WXv6AIRlN8Glt+pfa487zMvPOtFFXGLw0yT\n"
+"LeFW2Ohky1+f3KyEt7ZNv1R9mNcx7rS7hlz35rMADdAGKVRa1IAUjjrWy9nNJC+R\n"
+"mzmfXiFxtOrM0ExHipBcFm2qr9INhCynmOoVWYMRA5JMWd3AgEQn6Du8EBt6uN6H\n"
+"1H5sAd+0cAaQy+auocsyQPmoCnUPVtzyX7eLx60CAwEAAaNTMFEwHQYDVR0OBBYE\n"
+"FC4O3mIGz/e49iRpegbDKk+Dmp9tMB8GA1UdIwQYMBaAFC4O3mIGz/e49iRpegbD\n"
+"Kk+Dmp9tMA8GA1UdEwEB/wQFMAMBAf8wDQYJKoZIhvcNAQELBQADggEBACyDnPof\n"
+"l/BFzmLTssYJ0tyH0vDYK2Q/vvaz59DmBxDPxIlk/mR7AZILxH1gIy82DYBL/4Qg\n"
+"N29yI7zQlpIrygE9z5oKzeUwj9oqzw/la2D9uLegs9X6eYuTUSNGH2uxWmtNnfku\n"
+"ZPNpbeKtKD+IibtTRBeMsygZftmAzRmGkO74VIt/mmr6A2dU/wkpywLLmeiD8Bnu\n"
+"5Lk4x+HPjtgVYR7D1FXOU6+q5zS2SrCj3yTNxw5dBq2WfQnnFZCFWkgxZ9hBDQ9P\n"
+"+5XjRXUpUH2VbfSNBjktYJKZpuXWj4yVChzPtYsGJfuqpMAoWziZNHNHP1RCyzZw\n"
+"Y3ErhHcLL7Z4dRk=\n"
+"-----END CERTIFICATE-----\n";
+
+// Report signature requirements for our certificate chain
+int getSigRequirements(int *sigReqs) {
+    //sigReqs[0]=RSA_PSS_RSAE_SHA256;
+    sigReqs[0]=RSA_PKCS1_SHA256;
+    return 1;
+}
+
+#endif
+
+#if CLIENT_CERT == HYB_SS
+
+const char *myprivate=(char *)
+"-----BEGIN PRIVATE KEY-----\n"
+"MIIPkgIBADAIBgYrzg8CBwEEgg+BBIIPfQAAAHkwdwIBAQQgkYuuKdN+r5kGvGT+\n"
+"rzKbkF9Q8klKB8GCpx5ryVxPNMOgCgYIKoZIzj0DAQehRANCAAQlLQDTEIkDRJyA\n"
+"LllVKPUAe4RtZzGU4hBA888XYwb1ofgXVLdTh51aNtSwIGTJMODgBKaDwe8UkOMr\n"
+"5duZZhCsqtjYPtkkWCrHmpIdsQHs3kG9+ipyFok7CNxd5dQ/H68/c+PNDtkwJ4ex\n"
+"ZuZz4HAZuqC7kiVnJP9LSOq2DBjW2YB0b+q972tLokOwK2I20HWO+DVhgKzB+ZP5\n"
+"IbWIMu4RkKhhkESIQ7CRGUluwygoEQEOlIQMkbRBQwCBHLSAJARi3JQJBChIwCRx\n"
+"Epgo2LRAY5hlCjMlWThp1BBSUxYNopYg06gECsBlQKQFIgZGicIMRDJm3EBNCwQq\n"
+"WzIgDKQR4UIGgBaN1LIJG6Aw4aAR4pgN44BgDEISy5hI4xJsCzIwmqgAkiQoYJhE\n"
+"YZYhDChiiBQoyABSWwaNERAhGKMxikQim4JNmhJlDAcESCiSAqlxEzNMwCCJyaJE\n"
+"QURQCAVARIQFGYchErSI45Jl2gCKxLBxJBgx3JiRmDgJHIgkGyEuIzAxAJKRCxUM\n"
+"WyAKwDAhiTQqQQAQGjcECyMNVMgF4EYmzIYxEqBM4BIlBDZxwAhtYwIOoUAmYZgx\n"
+"27ZlSURI0KQoYwBIoSQmiUhiYBhIwxKIQkQwG4VImgaKGZdMIhlSpIaQ27ApUSYk\n"
+"mMZECzQlmhAN48Rli8RN0CCRIAcBkjZwDDZABAkOzASF5JCJ1KiMQwguGxANUSBS\n"
+"QzIxywaJAMhN06SQmiKK05ggo7YJBMUAEZEFRJJlGUdJQBJuCiMNS8iRJAJJSzBo\n"
+"HAYkEpKRHBWOzEQSSQABIxdCyRKSUjAwCrFFmABoG6NNGKJAGqCEXDSIGkaCpDBJ\n"
+"IsMR4hiNCzGBiqAIW0YGAplApIRNIzQOCTQuIZZM0ChiCKFQC4NMyjIIJEaAIUFo\n"
+"EAEggigsjCguUzIKW7QNShJQCJctwAIuALIFiCYppJhEQIgE2ZgsIzNOGykOABUM\n"
+"1IaNGhQsE6eEIxCIYsAkABRE3ABtQwBSYqQszCBI2iBkwqYFGgRKG0AQEIIFxLgs\n"
+"URQmGwIlCEVw4wCKQEBpCoNIXMJNkKiMCIIhgwRiAjNpIBmIFCeOgkRAIkAQUkho\n"
+"o5gNSTCSEhkFi0BMGUIGZEhCGpls5BKAQiBghJhwmgCF5CiSysQwUpgIiJJBSyJK\n"
+"WMBFyTZOgDACWkJN0zIxywQlC5EkGMUJlICQk8RgAUmCw6QISYKQULhQ3DgkIRch\n"
+"ITJtJIBomI1zCrT+qVfx+Q06YYRC++suSw1+K8jotSbSsD5iLShXpAEbTe41494b\n"
+"aT0WUkJvISwHYaDXcQLXw2KuqgsWn9uX+fAdFy4v2hWrKFT+k0Kt5LecAptMRIDs\n"
+"o7RB1mBUAQOkAhy6pZRD3IMBtrehUSR5oJDLjijKPCDmrxmjlhwOdF3SXjYJRTlv\n"
+"Nq+HrLEkfkEJAjlGZOpViYcV/9mczBluR1d+ceWsF9fAmxhwRm/8/Ei2ve4EmizF\n"
+"rAN1vSFuT7tiilcCa3Fn0k+Oh+2nvUn1NL5nVdcNpAt7mxpJ42+ogtjzN+shruVN\n"
+"IyY2UgpPaNf7K9ZS4Ut7jc6qvAH0unGiormot6iqLivojwC+UVil/VvNOD2y4Nag\n"
+"0HMcAnThK/HrCm6IQ5BHwAw+x3sWJv8vLapQn671/jMyy/0EaWrRE7NX0NBHnNmg\n"
+"wB+c1IOb10y1xxG85rQTVv8Wn9t1ynggBG4UrJMU8g/N3mSkq7/bpU66fHbbao+v\n"
+"u4kKSBkCkUDifa7MrVGnA38s63xwSLSrtYPyopkWwVC2R6oUh4qih1hnMcM63AmA\n"
+"1C8wIi0pAfxmz8PuDFYnJk7M06t93fFi1nCOh13syP5uCEZXEK1vxZ2rEuzTIgWT\n"
+"MNtTzEo8NW0Ey0pVh2ntncrzI10f16q99tQUY/QrH8CC5lBgv7L51CdxaptYOBUQ\n"
+"hVaRMPZk8gL5e6cAz4Btv2KMQuCoFrL2P0QA8ZRfgI3dFsk5IZvznRDcj+GVg26I\n"
+"erMzK9uQ5IARtciQCfcxGs4j2v47awQyuCQVwnQHrv/SwQTScI4zlyy1AnBFQVaI\n"
+"ID1daHTDV5/SZ2T5cs5UAcz8VaxODBGBKg4alXzXWid0xgZ2JyVFBFZnSuuwHNYt\n"
+"Mlv2aNlETb+R6ofGh3ASzKTRacEKORGl/gNr4kLWCmotttewr63V2/Eober1e0Mf\n"
+"tjDZBHN67n9Pdso15kD5MWzB2oVKxS4en5dNYW8dG+cbU0yMFgBaSARTPMhtTj1Z\n"
+"u4khWgGYemGlHslPxeT4c3hAY61mIKsELXwzzNJ8M+/M1lYKa1zQrZUGp+egLUhG\n"
+"9VgZGJaV8NHUJr9mYV5gj5xnc7+rkXsJ1z+GUduxmBE1F+Deoz6jkrNd+vnn7yEj\n"
+"Y58h0FkmdWSwJ7O0XHiXLGfD5OjT/BPEYNI+acElHF75Sk4NXmVZ7YYMMM2wR9CO\n"
+"q4z2U8a1cDO8VygCNCvNgr201xVQZ5aqyjkR26rIp1UrgMUt8Rm6Xkc6vtLHW91T\n"
+"RzrXY+Ie8DBXPNpe7fP+yiY92IZNmnlQaRzkcvRCActSHTfE/cj7PKdpRC/khxt4\n"
+"p5Rk5ZavKE/tOlrRDZALtRS6k9cX8FcMOyvxypMAr3xWf5GJN7lqo/xLCTBPTvOW\n"
+"A+iff7zKi7CqYrM/HJTIeMHAcGgngarWNJiQgkBoSdowBf1MZatM3mqwfQA+wn2M\n"
+"ynq2ku6z+A2vtz0hIYJ6k6QAwe5R2caokjjv+B3r226mHkUCim6l6RcV++w16OsT\n"
+"Yi1ZR5cKi3lJMT/QbPDy/6GnChkWXF3BgFfGiZoAvW5hmy2VwqLd9wrKHjdobzt5\n"
+"4fAxLe1DrdpG4fpw0mnvjF6NSx8pqm+T3m+0d7u8WS15L7FEa7pJhXuz4w9tcVgq\n"
+"k6nimqALI0PkhApw1+9UI4LultTZciyoLR4rXlRXgEx/OJDq2azOE6f9D5P09XPk\n"
+"OKtlKqtnSA7D7eF3FaiUanIB7i9u6gBDmzTFb4wRCBSftqm9uAZr/Kx5NUYajgwU\n"
+"BOvwgiOobBXa88g3hqBi5t50bkDiuI4NSB4NJ5wRo6u4NxgreTNcaW3Vv2dggxf8\n"
+"ikYbNavT4fXYxdqMiGYZ0qSDFk4epvnP8lOMQcx39DXv+fDLGZd8GKrBzWJ0xN1U\n"
+"cKjkCpPHbSQrorheNhWiHb9OJgdVsmreHQAjQLWJNvCdEVN/wPTcmFTfJHWqlcHT\n"
+"wQzJXQ6pXVERSKAevyjj0eN7zZIKL+oFd/0bOKkZkUIvh3JWiKOEfTPTDLcUwzqR\n"
+"iXJ8Ct+bjutUydf830GwYPX3GA0WkY8G3iDOJW5glRGM+3gCub7G8zqakwzs60yT\n"
+"d9pv5DmzzkE2u8jZmqpgYVxsGSQlxkZ2BDeYsjNpnj7LzHJu6mPd6slX2rgu/efI\n"
+"gP+/M8MM4efcYhV6aSm2Q44n0Y4hHQwkpyObu56HSJnwvpzpv9eq2Ng+2SRYKsea\n"
+"kh2xAezeQb36KnIWiTsI3F3l1D8fr6lr9fCRgx1mhFxgK4C4jjH1qHnHaJ2d7rpY\n"
+"tIyhe0dHZiBsXLn45+nH8WRaMuAtwC6XHRPl4CPmlRBXwV5dwGtPfsuD6tVwW4V/\n"
+"oFL7MMuqGndP1GfdT5vhNWBYlaVd0QgwabJ50ZclECWdOJllVjrNZOe/9AlLU8Ij\n"
+"mKBM7bGGfCkecCldY1rrzetD3Qw6V5eUqnK/WqysohijiurOE9NjZpmyEGKOgDSq\n"
+"gnR+Ug5z1bbcKTOc7rM2VUb94a6q4/JaRQWbgi4tToxtb2wkROAaxT/1ISIg4dtX\n"
+"inFCXIEkgKjPlch6Msy8CI3M3KKzJt3ov9eNPzB1EyE4eaQk5whWinkCPi3U4yA8\n"
+"TZFDXkTz3gqh6S3q+/FRWZPkYTlkXJTM30TpeC2fVL6tnTQfoipfA2jjVGRXo/tu\n"
+"zOJFL4Z4ucgrU+y8oMpooYvXAKj0nhlFobcOCoP2dlNWcMh5wYprKOtg4ewsf5It\n"
+"wNsHPGtazslSgtrwV8o6FhKK8nCN4FIMIhmVIuXtkEHd3RSlPV/2OWxRGMO+YAyh\n"
+"5NWuj/XAlTgxSEOoUjOTZYDkF/ptc9Bf8sLIHXJTQI6xgQROqfztLR4ALL7Y5LvR\n"
+"GAXLkqaTXoBGK8kJRUGjOH8b8UYBKfGnY1ZlwwSs9cWTeuufIzi75SEi/tqGDQpP\n"
+"7sb+oAJZADlmDWsYSLZVZk40+yLcMiTAtHkPq9n+nD/dYe0OBbuQzZUWsdvZpqki\n"
+"etYV2TZIX37ocehYT09xkKWBRFWxRDLCKKP7/ONuJwQCR3lXmFz14opzXo+nvwcm\n"
+"QA9V2Gs6Dbncv/NpyEFKwLBDqVSqZaD8HBPZMU2sOF4T4Qp0YC0gXoQBMeuenedw\n"
+"t/05qrNAxPuDxWnb/uHq39UwvheEQbvHkyOi26EulQWyMkkOMBxVzrjgpV+LdHlD\n"
+"GDtcStNwOOzSUAyQwAE6d9W2EO+i0+BAj8ryHARQ6jwCpSNmaCunyPqcsuUUkhql\n"
+"LojgpX66ikzdh6w30Cpl+7ZrfhcNx3HkOJRCusIOB7xgILXu/xDM+LRaOKcUpph9\n"
+"AHG5+orc+ccsC8mtRrtgbPO3xLh6JxdVay9HsVugyZWG7F549ed53NthpOZ/GHPr\n"
+"BKx64Mf56xGrxVOW9QGMLnDMCOFdvi3Ow15VjcPZExrdG3yo9EcCYVB7P3zsLnm4\n"
+"K/sapZPTS+GVuHIvt/exvZ+oy/CN//9idLc4T19tltKVc419AcVeAyRjduN5mC9S\n"
+"ENHHFAsyDdwDpICq2hwjUUPGGI+Ak3v86S5YjwklodNKxEWvvDbSSpP8WH7iRKyY\n"
+"kN/QlurKKnbOfV0OAMxnpyhYMBI9eVMmMN8+5UzGeFSRZG8Bpm7Ioo4PzPXsjkvR\n"
+"MNjpZe4rLoDqudECL/4pDNj8Sg1NdyeACQrpRtWz95DBRenSIfyT7xqS+LmPsDxJ\n"
+"OlPmpnAAO/9sg8jUEgYUW3dZ9gEXNSXI+El+m29WCtRExJmZ9wlWpIK/Xnbmv5dp\n"
+"8rt7uWH3qoWBjnYLtFjMgLlqzZr0ZmajXvn8ifgWAmuWE9K5bzr4Q0l9I6bLI41w\n"
+"1lsudpO+/kIlblMr6lr0FsBMLty+L/Qbi1pboeMoDlsP+XmEhRIb6OJAtBL/W/pA\n"
+"J1dpNMnoJuRXQUsNoYOR2Xe7bCjk6qFADGZxsx12wk5usbvfXZoBgGIqOuehHng/\n"
+"u6taoqDv\n"
+"-----END PRIVATE KEY-----\n";
+
+// A chain of certificates - just one self-signed here. Expires August 2023
+const char *mycert=(char *)
+"-----BEGIN CERTIFICATE-----\n"
+"MIIQKTCCBligAwIBAgIUWEGWHej9h0YdDKgO+9exOw6AcNswCAYGK84PAgcBMCEx\n"
+"HzAdBgNVBAMMFk1pa2UgU2NvdHQgSHlicmlkIENlcnQwHhcNMjIwODA1MDk0MzU0\n"
+"WhcNMjMwODA1MDk0MzU0WjAhMR8wHQYDVQQDDBZNaWtlIFNjb3R0IEh5YnJpZCBD\n"
+"ZXJ0MIIFdDAIBgYrzg8CBwEDggVmAAAAAEEEJS0A0xCJA0ScgC5ZVSj1AHuEbWcx\n"
+"lOIQQPPPF2MG9aH4F1S3U4edWjbUsCBkyTDg4ASmg8HvFJDjK+XbmWYQrKrY2D7Z\n"
+"JFgqx5qSHbEB7N5BvfoqchaJOwjcXeXUPx+vqWv18JGDHWaEXGArgLiOMfWoecdo\n"
+"nZ3uuli0jKF7R0dmIGxcufjn6cfxZFoy4C3ALpcdE+XgI+aVEFfBXl3Aa09+y4Pq\n"
+"1XBbhX+gUvswy6oad0/UZ91Pm+E1YFiVpV3RCDBpsnnRlyUQJZ04mWVWOs1k57/0\n"
+"CUtTwiOYoEztsYZ8KR5wKV1jWuvN60PdDDpXl5Sqcr9arKyiGKOK6s4T02NmmbIQ\n"
+"Yo6ANKqCdH5SDnPVttwpM5zuszZVRv3hrqrj8lpFBZuCLi1OjG1vbCRE4BrFP/Uh\n"
+"IiDh21eKcUJcgSSAqM+VyHoyzLwIjczcorMm3ei/140/MHUTITh5pCTnCFaKeQI+\n"
+"LdTjIDxNkUNeRPPeCqHpLer78VFZk+RhOWRclMzfROl4LZ9Uvq2dNB+iKl8DaONU\n"
+"ZFej+27M4kUvhni5yCtT7Lygymihi9cAqPSeGUWhtw4Kg/Z2U1ZwyHnBimso62Dh\n"
+"7Cx/ki3A2wc8a1rOyVKC2vBXyjoWEorycI3gUgwiGZUi5e2QQd3dFKU9X/Y5bFEY\n"
+"w75gDKHk1a6P9cCVODFIQ6hSM5NlgOQX+m1z0F/ywsgdclNAjrGBBE6p/O0tHgAs\n"
+"vtjku9EYBcuSppNegEYryQlFQaM4fxvxRgEp8adjVmXDBKz1xZN6658jOLvlISL+\n"
+"2oYNCk/uxv6gAlkAOWYNaxhItlVmTjT7ItwyJMC0eQ+r2f6cP91h7Q4Fu5DNlRax\n"
+"29mmqSJ61hXZNkhffuhx6FhPT3GQpYFEVbFEMsIoo/v8424nBAJHeVeYXPXiinNe\n"
+"j6e/ByZAD1XYazoNudy/82nIQUrAsEOpVKploPwcE9kxTaw4XhPhCnRgLSBehAEx\n"
+"656d53C3/Tmqs0DE+4PFadv+4erf1TC+F4RBu8eTI6LboS6VBbIySQ4wHFXOuOCl\n"
+"X4t0eUMYO1xK03A47NJQDJDAATp31bYQ76LT4ECPyvIcBFDqPAKlI2ZoK6fI+pyy\n"
+"5RSSGqUuiOClfrqKTN2HrDfQKmX7tmt+Fw3HceQ4lEK6wg4HvGAgte7/EMz4tFo4\n"
+"pxSmmH0Acbn6itz5xywLya1Gu2Bs87fEuHonF1VrL0exW6DJlYbsXnj153nc22Gk\n"
+"5n8Yc+sErHrgx/nrEavFU5b1AYwucMwI4V2+Lc7DXlWNw9kTGt0bfKj0RwJhUHs/\n"
+"fOwuebgr+xqlk9NL4ZW4ci+397G9n6jL8I3//2J0tzhPX22W0pVzjX0BxV4DJGN2\n"
+"43mYL1IQ0ccUCzIN3AOkgKraHCNRQ8YYj4CTe/zpLliPCSWh00rERa+8NtJKk/xY\n"
+"fuJErJiQ39CW6soqds59XQ4AzGenKFgwEj15UyYw3z7lTMZ4VJFkbwGmbsiijg/M\n"
+"9eyOS9Ew2Oll7isugOq50QIv/ikM2PxKDU13J4AJCulG1bP3kMFF6dIh/JPvGpL4\n"
+"uY+wPEk6U+amcAA7/2yDyNQSBhRbd1n2ARc1Jcj4SX6bb1YK1ETEmZn3CVakgr9e\n"
+"dua/l2nyu3u5YfeqhYGOdgu0WMyAuWrNmvRmZqNe+fyJ+BYCa5YT0rlvOvhDSX0j\n"
+"pssjjXDWWy52k77+QiVuUyvqWvQWwEwu3L4v9BuLWluh4ygOWw/5eYSFEhvo4kC0\n"
+"Ev9b+kAnV2k0yegm5FdBSw2hg5HZd7tsKOTqoUAMZnGzHXbCTm6xu99dmgGAYio6\n"
+"56EeeD+7q1qioO+jUzBRMB0GA1UdDgQWBBRmB57SoHK+qb2Qk4O6M01F74TguDAf\n"
+"BgNVHSMEGDAWgBRmB57SoHK+qb2Qk4O6M01F74TguDAPBgNVHRMBAf8EBTADAQH/\n"
+"MAgGBivODwIHAQOCCb8AAAAARjBEAiBL6cXBMRrbsBDReyQU9wtmhrEKMkv3f8uD\n"
+"RP1cOIc7EwIgFY9wghFmTja4l7zPAnxQ4sIUEeCwK5Bz7ZxRir4TnC8qlthmybFb\n"
+"8NGHVURVbHq9pXvGOue1Bn33DjjAAY93MSSQhXrA7qyjkD9VjjOEbwUuThuSLVz4\n"
+"giTvNWlUgsO8GGa/FxdCLK/bzWz+KOwReOT7VeHk2t1RGGf88h2Hu9LdDggkOOoM\n"
+"Bp45iZdqhwHzzH/s3QgOxVWs0O6N1FZA5SeCPSC9s6j2s1hroUZSc0gt2JVnSZwq\n"
+"mBix0CEqTzJinOlpPberDoLE68qot4HiiMNndgsH09NKsPPu2SR5Q55iau+KZkmU\n"
+"fgkxN0fbf79Q/zQETxNhgNAUIETybtbWcBl6EQgz61MV+EpMfmrOlZ5++XpHLcZH\n"
+"zHwcI8rdzCR+c0Yw7z0+kY8HHqUfeI6zompM41LVhaZ9r7T0tX5KidCbMSnvOG6U\n"
+"/fMQScXRvwBt0xMm2pw0kkWZ9TpNgE3rhjGaQjS0pyUCj2KhYeFoOYYAc5uWBj5y\n"
+"8gba8znh4qClSOeRmkpZyagN34O9xMgAwsoqH7CTYYKetI3F2ifoVoR0hBlak9cJ\n"
+"cSs2hte3etya/uKgeyCazwt4V3WUqYpC74SwsL/PrDxvfK/i1IJJep/6UXHI1uiS\n"
+"+v6OyZL6NDfUQZXWRWhq0Wlz3/9qzZ47VhMqSsdrlfqETFBns/ayV2qDtNJM1jg6\n"
+"EoyPFsPtuWHDCgD6F53xifFK12P+aqcFY58bnpSn3AlSANf643aWC3uUaquM+p6s\n"
+"z+rWM1pLnxb2/JnDknMYiRZY0HN8k104NtC/9DZvlSYMJ9UHFUUXoXjWJXMLNdfu\n"
+"Mbagw1LztaA+i7Qh7bSFoRMEzV/yrrA2XFdHoKQvPEUQzC5UVRgc2nk7Sb15kxh5\n"
+"NqUJsPvUnC34lbr26W0/zJtajut9uX1S5QbNKJn6Hx0i4dYWQLlSg1vllH7rKxnQ\n"
+"lutPSN5mSdbXGaJ14zL3tPGzykL2S3ho2F+fBYQFL7bFvzryb80jjFRRf0GraHvG\n"
+"88ty9hFuPXnxYQDRzC/+g45l/QPQr15qO8h7Z7ERSJhnJUIg4rlGgrk9X/xdZj8u\n"
+"g/az2+QZgXBNaY07Lo7rFBohXDj0YIl22PGy9yWJbT8xDHclnIb8s5y8Va9ZAo5l\n"
+"q/6ZYvGgXO+aGPhdBhQ2+JiL5yAWUWDgLqwPJZB/lmEee2wfw+hu5DdJ6p+BCnCI\n"
+"j6s54vpcuWkEtGBxoi4bcXmw3HBoYgAm292VBauLgQ/U6S86RlMUMgaFdH3fywRZ\n"
+"ElqKy1gRDsTulDTy3w4yrgdQIDZMYYo/Xp7EnBvzLQoHEb1fAt70/eCw5F2XwJGr\n"
+"1RaeKHjujJwIjxHLriH3wuoAcFd0P3fuK57QWGmY9FRknImRWCYzdCn3fr19ubqG\n"
+"YRxxofWoV6BRhVT0hA+gG5rX6vy64yELbWudh8ye0vHFaYgc+JbGodnYvB4LmAyS\n"
+"XaooDF3yOCMSs7MIGfpro6A7Z5uYi69LuhHW9QQzw5OUi21cbA/fSwHEzCmQYuw/\n"
+"xZBQ//q5selJUo86n42v45wf+LVQ/cLl9LPDIJfiOpE+JltX8ZraUTl+Hhi+5wsq\n"
+"LX4ELq3xfFsYWhOqb8RK0ZgpdrMbt24kLaozCLNIDZ7fKwd9lpCe3rp9Hs4rOFCa\n"
+"WfRdnbF+FdOMTGHgx12UwdbO7FhGq6+xkce21bBLe4xZPn/YcyLa4a0zhSthP4F+\n"
+"E3yrX+1khAKBug00Uwl+xQeSUlfH2ap645khUTSoju8e8gVG3ZtnjADDQYgFJXb6\n"
+"jDASXW+4dq3zrG3q8W83yZ9beWvUG1vAhC3F234qwu6TFSceyFsxBF/8dOUyXEX9\n"
+"GBxfAl17OOOq/ixeWKALW2m9k5+NZ2oFKHOyFpuvBi4OnCHIHqiJoRK6Q0ix9CPi\n"
+"NtNYEOpxcXlh5YGInND/eeZyndUjP9kifNIlllOKzg84Six0x6gR+Bmo1raAzsmq\n"
+"bmb+iStK+wyJT/1p8ow6sQYSW7NPXfmpPRAqpRIPbVuYY87MkEAMHzGEDH+y4Kzp\n"
+"bqZYghv/27A0bEcDksaFIEtjRY5vYGdMnV+l83cqB2PWBhkRHE+iEBsTsMPilqoG\n"
+"T2xMOcQNW4042i/EdRQxtCno44asRScodG6Ruri/KWu6EXTydqaBMdmK3DlGwGnQ\n"
+"mRszvMgmWjg3KtsVUBrt1tG42HTtNmNEBR7W9pU758AP+obI0qUIt8LaRIx1dul5\n"
+"RU33vSL1mUk2ltXrw29XKMEmnskYyl/8CwdEYtjFX0zMNHySipW2Zvg1WbQB6SwH\n"
+"s267Z1fahxOh+EOayfuRuo9ShVwgnurV9lWYSXO301wyVO27W6I9ALKDTj0EhZ32\n"
+"bRtTlEsxhSql022ER8DVCeY5cTJi3zQmsGliUAjRYjCu/IkLdQQCpAo7q3WvtUP2\n"
+"dhPNn4Z1DnMjvxUFN1cxyWq1JvkpGnyCkSOtqZ7kXyQZfZh6KMaUUvMCwaaAY9Bl\n"
+"Xt215OpBzFInv00aE4CINiNw7MeqSHb65ka6dsxJpUjvh7fjoMy88TFvjtqtRUQX\n"
+"peYZE+Vzs2S94sB9SUSBxiv383kN9ewfwA+aID1/KN+HJARh3haCTZqk13B0vNRQ\n"
+"tLRjLZs2NTQPJxH3qa6ConK8887sJ37LuWOexQ68JYjpSK92zrOejtMmfRRA0P4X\n"
+"aRIp/a5fgOalCDIP1JXsOo1GoM4pMuQFtMt+1lijcgQp0tstxvoAqBlmqHAQGtpg\n"
+"dug1GTec2DRPk48NehGP12+sgUNRVFU949I0mf16xYq8bXDM4DVlmbnVjw3aVU7m\n"
+"Wd1aHWl3mR7FOSU2XjXAGOuy1HCXaiRUVg5r6aEuYcITDw6bkG2UxpGvA/q+nxKR\n"
+"DrHxBJOmwem3FEng+arCt/x6T5zoiA0n0kxxLNe+zqbSspCvLcrc4iZgV1/nwdBr\n"
+"Cte5bMgmHXmGC6xwWbgFufd6l3egRFWDx52qjp6JPpxyNpEWKOg/yjokbCq8rX/r\n"
+"Kr0wVRZ1Fn7bhZk6edZrcJs/xYvrVMs296Q/PKBstsnmWqiOAfVwX1L6JcE8KR+N\n"
+"Q3LixJQoXIMHKOlkX6nLdWnqNrRy2uF79yqNbuMQmemFpwaT3Id+rbNw/bXY+VkT\n"
+"2S3JbznK8hDmu3tu6oKBuLSEzyg0rHHJCFJYZmmAgYWQpsbK7PgBEHF4eZKVouHi\n"
+"GygzX2Gmv8LT8Pn7BDBDVgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA\n"
+"AAAAAAAAAAAADRcjJw==\n"
+"-----END CERTIFICATE-----\n";
+
+// Report signature requirements for our certificate chain
+int getSigRequirements(int *sigReqs) {
+    sigReqs[0]=ECDSA_SECP256R1_SHA256;
+    sigReqs[1]=DILITHIUM2;
+    return 2;
+}
+
+#endif
+
+#if CLIENT_CERT == DLT_SS
+
+const char *myprivate=(char *)
+"-----BEGIN PRIVATE KEY-----\n"
+"MIIXWgIBADANBgsrBgEEAQKCCwcGBQSCF0QEghdAb0r/8S5RTMtIu2gZx3ioiyAm\n"
+"YyEErZnjcy9NVODI+iJfllk/EjDc4jK3RBynpNPYAiyGv82Bs+684lrBFqlB0d2s\n"
+"Ti4nOUBIgy/+X0xJl+rvgP/382RDhDCp/oCCjUschhISVnM0ZEVRI3dUAQF0aHRD\n"
+"hUUgAhdSNmUSByJxEjA0E3ZlMIEQYzdkCCIoZSQAIBVmQWAyhIVVExF2JWEwc0QW\n"
+"NkJCh0EiJCN3eEMSZHJGEnZDMHA2BUJER4RWhzQzImgVEiciUFdWMxVQNwcHhjQg\n"
+"BYVDMlZRNFEIIRFUCERoQlYxBRciFWWCUXdHQoZCMQMBODZgYYcQVkVgh3BTVQSG\n"
+"YoIhMEdhIUUBGFUnE3hwAEI4EXAEJDUiEVJTGAGGCGZEMCY0JGYDSEZQZDMYVRAj\n"
+"N3ZEIBhWZyiEBDIyMxMlYjdnInZFIgBVVoRzJFYWCHVXMWJxVoGDMROGVROFUQc3\n"
+"RHcCInEXdmRGAzUQY2AQEzgUdWEQMTIXUWgGiBVYYCQyOCCENSNleEeFg4ZQJRAY\n"
+"hlUVOFEkgSVAdIVmKEIVJTI1YicAZXgjVgUhNnIUBwNCI4QmMlZoFhgBRREEIkcR\n"
+"c2RzQGiCUAGGUxgBQYQDNTYTYIQCN4NiI4UIWDiBWBBhRwMFGFKEAwNFcHMyBFZU\n"
+"BIYVWGgIADYgcFNyQ1hhJGBHM2UlRYcGRjMFFGNXKFCHQ0IhEYdFFIUIgnKIJ3hE\n"
+"A0UCgHgURDKBgSZlgSaCZ1hAciVDVGYAeIBBaHEGd1AkE4IxMUQ0gSByF3h0UIAG\n"
+"CFBkJgFoEoIYhXREeBAwYmFQNHczgAMyQjEQRAEVEFdSaAcnZIclA2dxGBiAQUIG\n"
+"GECBWFUVgENUSEc4QhY3NXElcxIEVFdWVoiGMUaEQiA0AmN0MDEWVYgmAhgmCHFI\n"
+"RCcwhnJ1FnRGIIJxUnNjJQZSUXQzNkQgAidBBhYTFnMyAWhWAxI1Z1JkKFEkU1ZU\n"
+"d4BmJCYHaCeFYIBVYSNyczggRCNyCHB1FwAAUVhVRoOAQChXEXRoYwCFaFhINAMl\n"
+"NiQSdogWZWgmR2R4F3cRQnJGF0ZkESdWU4cwZwiFMDZThQNDd3BnhxdDJXBDJSUB\n"
+"JRRhc2Z3VSYzRyNiZHADNjNEUyBkYIcYVEFoFDUmNQg0FGNCg4CFSCYFJCOCZzEW\n"
+"cjVTA0eFB2UIB4VjQ1UAZoEXV0R4eANyIGaEFyVEdjYUJlaEI3dRYwBXZ0MQBgAW\n"
+"ICAIBBdIAigYQ0YFFyVnQ4czAWUFOCUyATYjZRg0NhRYQRBih4doAyKCQRAQABhV\n"
+"SIZQYgIDdHMkclIYNUgIJnMEUGAIJjAhYzUXVRcEWCcmZUNxBIcXYTRzJRZFJUgX\n"
+"RQJydIEHcwGEB3MYhGVDEREWVHN2UWAwg1dSI0QlYmRnNRgWVoUBZoJVFBhSSGUg\n"
+"JnEFJGFRMBeDWCQRZ0AnJ1h2QTFHJhA3EXMFJ1NxdFFyUWNDAEAnIYCCRVg4QTJQ\n"
+"EFFFg2SGNYFBM1V3M4ZjWENiSINGNWNHBEIgExVIV3MXUXIXBHIDFIKIRDRkM1eH\n"
+"gjMCIINlhnUjUIdCJlAhYXBAElF3NURkR3BEM0AIFXQTKGZwM0BYaFYyMQcRATJR\n"
+"WEgVJTUxUkWFhjgDhkSFASY3hnSDEDRBEAcgYENgUVB3EoZxV3hkVUdkJzcBWCRn\n"
+"dXEWEUJ0dnYVNyWAMHFiZoQAVyQ4FUYFYYJVRCAAVBZnMSA2AVgHIzgEUCFWJANQ\n"
+"WANxFRgYBGFVBTYAc4WIMnYlcWgHAIOIF1eIBYB1NIaHUTJ4QYN4R3BwhRaHBTCH\n"
+"SIY4A1CDV1R1cCAyY2YwKDViMnghgHMUdoMzN2YHhmBnV3MRZRJ2SHAWGCJSF3RA\n"
+"N3NHcWaAJUEWJSBngQFyJgRHMBJYQwZyMHIWIzAwNYdhcVVYgmYxcnAig0dHBCR4\n"
+"RlA2hnU4N4BGUmICCCJhMFMFNGI1EYJBVDMhQ1A2iBSEcnFjNIM2ImMGdIA2YuSe\n"
+"wzo5G9LaLXMURS1ZJ8y0XA71CPYqX1R9nvEl8UOUbjhy3JmlEE/dVGy5WgPow8Mv\n"
+"dCaxtelwpuM5iPUWF6A3MgWefVMyGxxk/IyMwgxMXFajBrl8pcZBiWzhyxVoTdfz\n"
+"lcpAIXX0lP/Nde1iegIHQKSomrbHN7ojOLD6SllLG0FL6by3GX9t5M5nWDqTiTLr\n"
+"SuOftMpplw1g6yOhdQXtQHVHsGFdsmR61VEZFqxVLn5ofPH0oQko3uiREDl07f7P\n"
+"otSG7yrVf1CSjlhdFjhhgJMJ9oY4J/R5G4HX5952ieRVldZQEdTrRzxdeTwHYt+p\n"
+"2PKxukc0jB5U+zrgromORpzpRzUZVFirvbPk6frMU0ElXkL5olQHjiYcGYxIcHNy\n"
+"zpUgjw+zuJPPMDjj39X9XrF9Mavnsc2BMF4RVjsi+MST29yhpzTg+69i2VAt6gK7\n"
+"DQqiB+84MF2lfTVVso4ZsmzvQlzFx2s/OvWkBYBoot2wdefXpsPsrIoXQscJLa9A\n"
+"S9U49TBY7DvazBI3haVZEpWrBlB5l1BxWm72hdaQSGUwhFaZc/xeCWVxs5IW0mJh\n"
+"Jg7a+W8HmouISBJdkrtttrVfK3ihS97gdJI2m1MVkelniWsFvp3kFHGso9J+QDLC\n"
+"zpOzZ8L2GV08BQBlyzzrnrUjBuG6/NKRqmH8QSZUc3EdNKoqZQbwdl65WIdt+XBu\n"
+"lD2bJz8FQQh5BZ1kRfKxeaMgjxeDTuBeRo9wra8BZO1RwFL+0VndKa25YuyGQv5/\n"
+"YdnXXMvpV5Y7tCZMYaFAyaQgGKCwhrC4hnO78r2rPG/16XVpNSuwiSjUqNHfTvFK\n"
+"VLbY6hnLpPfHKovXatGNPksA8/rgxn3pWfXetmBCxjwO8mhoi6yso2zyX8cshYb2\n"
+"RIT3V5Wiz45xoi6KYo0/8/a/s2qVMRSidfdRB/3lI0nl8NsFajq+cDYaT8qb/L3F\n"
+"b1iS9yPxJBHPa42Br+9NG/R8Os8oP8dExP9lRvtWF6HWu+QHzs/2W0u4RuKXGdS7\n"
+"u0d2dnkDACmjyNakDC3pR/0HrdhMBOREc9utvCJhe5tnLBSJ6AoHOjDMrBuUineS\n"
+"eN6wwWAMCwGSsYScFcToNehlg1KQGVnW1rQE78fC2MKLX9jwOQ5iLCq/AlpRGwn6\n"
+"3S0ocMeciYP/vV8MG4/eQOhuCGDVIqyKi+KUlvWUmXrOpBQgX1ZXeP65d6Uvg9dn\n"
+"syWpw5sjKoAuOxPj2lxhD5bfWM68iFfNq5OYTAiztkjVWn4j46jxV7bZklpTkJGL\n"
+"ZNLyN7Wkb8o3ck5RV9TsJx8JMtumgFS4y2tHneTt40+KMDODrhs08m8BYAjFZDv7\n"
+"Z53JlksV7V4JunRPuDJxnsYjuqIXjSvtQ8r+qb0xN5dG3tKAaeUYjfUQ/LG2oogF\n"
+"jBOIjcqt8V0JmNlo9mXVXF3fsmBi6rAgitK/Vk4qYghouU3KYNAe16l5H6+oq/Lv\n"
+"Ff6HIRopVXYtHRYYKNhnhxBP4NU9kRg2WqBSUosBSdy17m6nDd19pRhPfN2cuFOU\n"
+"AeA+S0HXIsxZKHO858+VF2qA7Wv9XgtXy06ZYJ8kADvHZeVtzBP7P2cGjAn1eRue\n"
+"GcdwmSbqaoDFgFe1MqPum2DgX+g5pKii7wMTQN22ifKCJPJdJqtNfQ2KVj1XIFah\n"
+"em8sxVjk3GWvTDHNRn29aZNxJvSu5enW3jzAApIigFqP8RYbQl4JPQex46es2cHV\n"
+"nK//BxhKTcwDg+pc+BbG8ufiT3OxHk7Wq3cl6fOJyduB2eS43i2iS9hGtefcxXwA\n"
+"+vIKRJjSGJVqNqnEmkh6fPPpfdv0ZfWUsPIrPTQBECJXrI9olIL6HdviJ3HiaBS6\n"
+"QGRmVc52uNsMqvjBUOhGGw32F9hZf19/tj3YAESVoJMxoQ4FpK0cH3U1F/t0Wkpu\n"
+"632PLNBHKDlDmbcDc5jlDmGzqMYw0bW+KPqDn01xgpOVHCqC4Xc8f9q+HDpME8rL\n"
+"Aft8cJHIpEXUYNxQ+i4az9H2Rc5jbrYECaf1Z6pDkd+VpkozJAmDRI6gEcXx0wGk\n"
+"7RmA9qY/v8mzUdWPfoY+U716qPjOliEM9l8GlZzGwI9AKZTRNQ4SANEV5GFMUt6d\n"
+"pZoI2TzYEAb+v11APafR1O5I++USF2CtK/iqIpAqpA1UWU0hf7QlDEKARDVoQlSc\n"
+"sAs1ewPvo+uA/gboJHST2nYaP/KBeGVGq0d3AwFUp3mRhUwqP7vWPmg2hOXP6BeU\n"
+"pOgh6XRKcEHGc40jmSHP+6d53OS9osHnDr5MFRImW2IOSE0Tgy1ZnlyFCfuUff64\n"
+"igIATxTWnTXitLai7NTwJWdzVS2s8ERA20DJ7sDPYVpVx5Lj0qRSZuFw1WHe6TIk\n"
+"SNhwtghBdmojg8nypuCV7EARUp97NOz1WS0phhalDSZ3ugLMnDgz4LtHjgcXUymj\n"
+"96OnA1ke2fTozbUoke8Kq9v7ZYVHPK3PGS2x58L6p7giepPz4rDKKxl986WtOWQq\n"
+"j/B5aeXtpjoLPgPBENPGRYh3KzXXpnOSoGz51uB7tp/5mRUcLgnv2qaOschEr1RG\n"
+"Jt+EXY7AlTZmGkLhN5K4zZ96vfGZkyXWBjNUf2ZOoSdRIb/YvB+KBo+0GJ5MtXbW\n"
+"KO/9+BYkcF7YdWMjUS6meg7hydaerDnSF/HEhOXCRornnTbmHzIHW64Hx1W/Ri1N\n"
+"zBDEA3hdtWtfHpch2cEmXZrbWQk25YmHNykXefOQxakW9dT92Jlbv+Pmk2R2+eYs\n"
+"vGm7rZe4Zfyb3c0G6evIeDD/5Ot2P9GUwuA5y5v1Nk7oqDrB/pCLPMC+SNdHIyH3\n"
+"LqoCEq2MkMI/XiEy/V1yRQgA/OGV7F3GmprywX0IIM3XphMzm94sBMSPVyp7t1Xg\n"
+"sQI4oRF7ivetZ9EcCtaKQvfnl7ba2Jkr4MlrRJl7FUj1xMLpo/iipN4BcvSZc5oa\n"
+"rACX84ZoD++NgubUWRAtB92I6nHP0Z44E8BK7t0Qg3LQfsVSN/MENa6fkLH4zeWg\n"
+"OMba+Kyvxgy/IwolX8XaW51aIRQr4f2QSRIudgRUmkq1SZg+3oEQVhwiEb68W8aU\n"
+"W68G3zjsFaGjel7VQZKXoOuXSChtpQZdTbmnpUWzSzGTJAUGxOE1H06X4Bc0yLZN\n"
+"5RWV98aOz6G6JTSdhSYbzoe5NmntzTbraR1azhBUIw6JI7SAVhr3ZxNauB5VS9Bp\n"
+"XGP0Hw2saInqm5xo2AAQA3bviSyLjU+bo4vP1WD8POsE861q35II8cJKbNn1WfNB\n"
+"OeBcPrV3JC6zfjhSWUkxQ49FnKXX8f8KldUSHe+rWDZOd4/BtcBGW8AhYdceaG9K\n"
+"//EuUUzLSLtoGcd4qIsgJmMhBK2Z43MvTVTgyPoicfl5qiDjWCYBY7nFfPbsMXYS\n"
+"hTng+65mbiGRrVtU/SDsHbeou/CrsGO2VzMQCzte/W0aw4KFwn24X91s+ou5jUGj\n"
+"VLEWw/FNHIbzXFKUbyFe1rZd/Y4WECg8JaFzgppOYLbVCKl9iuJVkigd46VYOARZ\n"
+"8tFOSkazJegeuPYUvBnVFUx//+isBzbOKih1sGFkttm+DrXgqp8dokefOLbGlBPe\n"
+"FHDNyNpZdmSoh9LDp0j7Um5eBFAK7Zn0uSQ152d7fmnsnX7xAsVDpG4COZ/hHy/s\n"
+"UkJsmrc0aKRFveBPVbIanDKPLrJgGRF+wG1CS4i2/P7DdrH1lZC06ctAa0UlwQlG\n"
+"8rVlGn1hnEobiAA+jTSmvHMXZftYbde9qP3aoieG080qxuUmsO+cnOMgAJp/Tlsp\n"
+"BK8dDQVASl8xYgFu+gjyALLalGjt2PDcK5fNd28k+TQ4h2hIhsnHcz8fBHPr0aFQ\n"
+"DB8LsduL8Yw4T1EvHRM+w1eTia/SXFhocV+3XI0Ks0Te3xq2fprUKzjoy/9FIPlQ\n"
+"CvJ3n7hIICdrQnLIjj5lLYMMb2p8j4ILWcKSxj1qJ5C7/5+RCUhYjJLZuag0fSvz\n"
+"4TaQjIfzj/Nc/WEEjhjpcT1E0za9X2vma8Vhtz5UiIzFzwt5S6pze/TBknNZN8u0\n"
+"DB7zu38pcZrvWREi3mzSSYaJB9CTPc03xPuGcW66WY23UIimRB+XKKEBPMr+ExI+\n"
+"Wr56dOze1L9hMAaUL9LvkBocGnw0xNxXq8CzdnYIeuS9NYVJqwCHSswjQ/nfuru8\n"
+"B8VZO0QDXm6TsGEwD2mioZISjxglXHk2s0OJm06izWB5V5uMF0yaeH70kYOGGi9z\n"
+"1njlV/vY+wJw2QNS5QlTC1OjzRRKuVzFXYFhe+vWEL0P9hzQ+LnFQrUaAsU1MIWP\n"
+"fxSPl9YOjWCj65FbYVkYNHbnluh+NvcEAu0rOX2Er1TcZWcJWfoDmadtuhX0KoH3\n"
+"AkuSt3vmqcx1iYjJSyjr+mOXzLQeeOYpSK1bm8Ylea+94kh+oQrtFen+Ak47FpNK\n"
+"p5U4Oj4OjK4e997S/uiXF4PK4GqLo59I0PKUcDmvgID93Vee58EmAy6OL0JgXm77\n"
+"tLImC8rUyc0LiC/VQ2VcgtixBJg7Fvt+u0tLLCF6T8PRkmwsqKjlWe2T/EFbdlhX\n"
+"ek4TZ6pKNEucs6/lCJ2mRxwfB5W3XNNK06CT53u4cXzADE1m+Jn3e3Ccf0saZAxx\n"
+"3VtYzYL8vGPj8UZulWV3DtTO4kHcDkxY5jntXO5p2kQH5z9uDH0GWMAqOVa1D9Oy\n"
+"hgzZabYBmHc5sKtWXO1FmviJcj2ic6CU2OR90OWitwUDRzM8YSi4bJuutsPTnoPe\n"
+"05qwNI3HriCZOXwsFoBH2YCsP1l6SAbIGijLqzkYz30OvYzTXUnJD1FzcyGbhGTF\n"
+"RKXkB1CT1Tgk/yJPwRfSsF8M3KzDf+tJmEjHYnvTO+kgoz4/V40Zib+ri4bTzLJA\n"
+"0W0rzGByQ5TEaPUBkJqnQZTohDfDvZ7yxGAF+YLzvtfLlepP2bN4dqz999M7y0LC\n"
+"XNiJA1nHOCstJ0pciKfAPMgdwxWvVka/mf2LmU/xgPhNFf39TVodOqerDowflP9z\n"
+"5hletxtpzJUhLuPucPiV9H2suKqM7OfSf8FYRHctVjEcPnBB8eHZ9KXId6l0c3Ex\n"
+"UVxW6au6jKzGSgSIQZmDYOsv4EVCxMUGG2cK1XQAu2XpxpSIQQ1TtKwNfLTEYt/Q\n"
+"shsyeYenZDzt+coLTTytd0JGPmHJPEYL0oh29Up8N0PSupXHT3j+s5Dp5fEvTDBi\n"
+"tD+yKfeI9aR+gWD5F2bJFIOrWUK6TVvwvUxpNf1DiVJresH5vdiJwQ/zpF9XR08r\n"
+"H+gfe99c7Tny8sr5QrjVrHjuyYcZg3xmv+lUvGp4kvR+nPf1Jo+4F5sqQ4X7jb7e\n"
+"CeWWxcNZJLK2DOegYHf4y3GWQkZtd9kKiVFs/tyN4Wd9aTuY1ES8w9FB3y5Y60ak\n"
+"AC7oWG69NBALtQsYWZ183+t43UcOww/+e1NnKTK1c7PsJnilXVTTDAI0bHaec/XS\n"
+"lpQHuY2XseA7apCOVZQlS9A44GwwPFcWqwMAxfYV5jaH1/Dm5LlTp+x6nwK2a5xw\n"
+"iblwTWBDxAxq7LwKKNelUt7DmFvNCvbaql3HbmRe6akNLYo5C6ntWmYPKuLkwXmG\n"
+"DimgQ+VSNPS6TXgPwSoxKgNCMqM+DEbX/m00sNjrcm4TheuL4R5qOXPPe9etHCjf\n"
+"eQJpYs9jTzF7uAJLumlU7U/WV0vDj6wM+8B9GLvr3Z/z5pSRWJughRPoAGszgwiL\n"
+"KRXTm4khMlPpLiU8q/cZMQkKM/NYoCuOoHaL7VETRY+0RFb9zOgUK2EM0KvGWzc5\n"
+"4MFScSFFbBhdTLq5b9MIW11Nm7cptNtwjX2djEjVC52yIXOrja4S9Iv/KKJANdfv\n"
+"eD5S0+0Yeddp3lx4J5eS+3xP6zxjqpswtSIQbhMd1rmZnC84mPc28oaLJhkJmQ8H\n"
+"C7+nxVM/RSaC6FGZpuJKUWvMd/dY/yiFiga8qrup\n"
+"-----END PRIVATE KEY-----\n";
+
+// A chain of certificates - just one self-signed here. Expires June 2023
+
+const char *mycert=(char *)
+"-----BEGIN CERTIFICATE-----\n"
+"MIIc6TCCCt6gAwIBAgIUA7ZH2Ec3rQC+1bnmpdhaDvIQXJEwDQYLKwYBBAECggsH\n"
+"CAcwEjEQMA4GA1UEAwwHdGVzdCBDQTAeFw0yNDAyMTkxMDE3NDVaFw0yNTAyMTgx\n"
+"MDE3NDVaMBIxEDAOBgNVBAMMB3Rlc3QgQ0Ewggo0MA0GCysGAQQBAoILBwgHA4IK\n"
+"IQAXYTuJzM/A/CcDfGM7U2HR1LQGj99aRSUnbYuql1BUaMul1/hyPVjAX88jeD/w\n"
+"umgXwps7It9OgZnIpZuclr12hM+wRCWmPblKsw230S/N+kzTLmBi8bcUsfSu60IX\n"
+"DbHIdjfwnyueos/2atEDd8WMjMNDjL/BqgGA2ks9k4SuqdNP1wsUCIxI+6y9ipp4\n"
+"hadDFequvwQ41mu1Kvfr/NxzGalLFQ2NnuWqMjRPxAzOBr+X8f7VUlvBEykwAlYN\n"
+"8H2GsOtaiZh9VdRURjw48XpyK+bs6C/lVrCMZGenyaLvnQHQ/SRVyyG9BhopPYEV\n"
+"GpAQp6sM1pKEnyGJsArcZYmTsPBv9wo96G+/9S0rQaF+56PVbWbLHFLc5nNkFaaY\n"
+"G4Pv6yE/Rs6n/Tp9Su37ALWMJT4d13qzfWIQrJQBxLKdN7ISsZxUV4ZHUNudu6UF\n"
+"nEORn/QytH+ntahsYAun7F2tlpmT4cVEmD78RkVe7KkaAySof61j4XJANzqtRFYi\n"
+"vwxm99gBJ5f/kWdett1QinMoVI+d4KtRSCetlMVO1AdAnuilpD/QPtb7UrtjleNf\n"
+"Kd467IMFwHo2mrCuWhzwNbpb4vM0DcIWiXU4hQaTQQ8GYBTOBSvjirfTAA9dH64R\n"
+"FVIBYjT94V3YYM8+5DF0Rm6noPIDbCtRWQ/gxqsyXnyN93OSNJRFClh1iyaOp3pc\n"
+"qe2pUi7H/DY98+KSJo8EgoaJsDnvVSO9jTvDMXammtNoOdgU+J/20kXNXoz4nXcm\n"
+"ZhnL723yfCfZRid5Od+fZQVufK8IJXtbmD1EzdMDb4oVzp2fJ/4a1NmLV1f06s18\n"
+"8B6pINUiCgbpYT2+wMDXUKVF+nNEqyCxrhDEyxTzp+8CaLo0EzfcHENdZ8Civclj\n"
+"B9K5rLurEE/zLwyzI3BGmIR2KleUSzgo2OiszoXtlTR399GFc5cacOpEiEbXcRhB\n"
+"vxXBlFvtafkPRU8moWy0LZdqBcxAIA8/hToxCstKp06AhgdPp+sKNBGDUPwpwnBA\n"
+"ShEzMRIq7h7lbYWynG0mZ7Yux4nBLJLucTX5WGMeyJxYBLA4AAr3rLXw+JSHJUeE\n"
+"Fh8Yma0hTuS0rp4tu1sHtQCm0tq1stNzN8bIn9TpbWatkOXkxq+sovltb7xRJLBC\n"
+"lD7heQ4UsY+0YVkLUUIjOHoxlfFU6zHviABF1KVZk8mJ+DMiRUlguWnC4D0CxHmI\n"
+"RJ7+2hAms/Y/hhDOfpJ7ahNjgMy/HeH2fRzImcpn5Jq2IzlIJCvIX/RXqyrNKcLb\n"
+"xmxj5KNWnaCzuAR1msDlTfwKIuF1Ene1Fal8mQUntw/4pg0OOiEMteW6Eehmq61r\n"
+"5sjQIoMyBA84MNQz12lbtWVJ+gPTgoTLAF4QnejnG9q5CJVSFWCg/wNTEwtDApDo\n"
+"KCiroI61lF8WudawEYm8Tw42rgcY68qzz5CArGMP+dS2B5qLRG+WD3UX9WKFXn8M\n"
+"coRpsZ2Q8d56mzURDdTR53v2jZBcrNXI6yEnx+C/k2IcuPke/RoOuWG2yQaNCKlq\n"
+"sACGG+VwjDjPZG3HG40N5j/v6eHV6CLIwW46T0z+ajt7fpAnM85lACJOrKlTGKBC\n"
+"LSsXH2EDiYqtU4YonSM+JHN67/Y+cIG+fiJPnvuDf0rf9kqolnC//p/GCBdPMi9m\n"
+"LocGAS/fai3vwIV/94yEMadC8r6+G4sPrUrJwtr+sij+doyacOYUp5dBOqdG5yhg\n"
+"B1aECnktU23yRUimGCClrbfHNYJYms3HNCp8IePU9HY/hmxuizdjyyWMg+dgazbY\n"
+"yQ3rtp8VkWMAgqX3Ha6hRJ0PSr6/KcjUlG2lnXAaaQ2mSM1cAJ1UCBLwECQGsV/z\n"
+"MoXdtTAiTa94IBkEtiJddvzFrGp82Xg+fgs4Ac+k1086iqUrNVeBqIg6xGZItshE\n"
+"zRP6ERoMrFcm6XBgecwtpq6xCrqCBuFIiRk0Ocm2xzSxr3Crj5kuxM/ERf3rfY8x\n"
+"6TXwm3FC7m7N7QkBsu6aZYiKKeVQcRr5Bo6GEs5RSX+WQ2m7lUxhF5f3S8iqGMN1\n"
+"PQRlTZQsrVbf7ysjNmHGJgTXNE6Xf7gxXjQDudIwjJ92GCcinLMwTOeZ6pkXFMy8\n"
+"vZqz5HPCs8SfbZRwmDbgusmKMe/6U+Pzs+aEYtNR9ySugM6rSG9icp7XXQbja8PD\n"
+"a4DvzCtQABizQZ374IuBIy0b2dOvtaSjecPVezrOftXcxRI8aT5f/IK9pC+Gt9L5\n"
+"ms01W4IIa/JgUFM1VCEXQa3MLqoPM3ivG5WtmxphYifJKituV7F5spU2UDK5SVjM\n"
+"swe94tX8CHpHHh3fcNp4fg0A8obpfqt3r0yyp6j5PveGgV3rYbL0Q7JY3i4UBD5/\n"
+"QV72mpZqN8jH0NlcPX9WYxB63LnpjOG3VEhmqzxrAxjiGRIIgUEkszukmCf1f/H1\n"
+"oWkg3lntFQ1UiETCzQCYO1MAY0u9LKBKu3DhftffEjrH+ZzKNYF0PKSEDIeSIsFQ\n"
+"GY20NBXVzeV8d4S9jRoyZ+OCmJYNGX5DnIiL0hzhXRfhjaO9ev+vn/dMwS02edy1\n"
+"hNESgdodk8ec0ZBa7AvT6FYJ4SX3NFmQRg2R0O/XsbIzkucYFMzxuzVBXjTfrEeQ\n"
+"kvPO88561w9svD55tc3mv6DW/35beY4HSj1drE6ZPOb35fWLug35umq11KJO6a0k\n"
+"5GcbIy3AhCKyR5hQ3GReWwfBKbF+WYx50rdlwBQ6zxOdixAox7tTIW5pdeniubIz\n"
+"PfyLKI8p0oy/OhUzOMRaIXbRDSX7vmwvKxo3oV1u3Rg686uKbbwxXHX2KiP3GxOX\n"
+"sLafuety1QwNK0/hoLkWDjYqM5olOUxHygEY8IHjuMUPjQhYuVjHq9nbSRKp5zWT\n"
+"qfJ3cSq6fAH4Gx5lvAt2Tf9MmjaziyDa1OEuThynrtzgQSHBiq1utCDf2rSknOhj\n"
+"RjKX6xqFDrcyJrovW1+FaVSoY8/xQjQI7ROLUaCRKDuEXPOn6bcb0qBHIuwUssgF\n"
+"Ne+6Gy6CnhSEEaJ/LcJttiKDyU0XI4kRUVrwDvr9khrzkgLFRfzysq/bdAN2FO6c\n"
+"9l5C1ppiL3ecMH09AHD2y6KYmBCK4XpU7OvSMgDGytJagAMGGPuseJgIXEmM1RfV\n"
+"qP2Oc1Hsl+Tu0rqPrqvCl9vOZXG+hNB825pkaxwuf8e3t2hZVreVkTAmUefy/yq/\n"
+"ccc5N1XwCuqbz5nC8FBpub6pXWEaTMQ6ZwikTcsC45Q+SabiHTDlNc0JuFFOBCLR\n"
+"je9pjLYfgT3xkjmxMCvkShaaTWw98ssY3HnLGO2NnT0DFyW7p+BxlU2qC9OJU46E\n"
+"SyR6pJPvz+Eu+fv6eETaIxtvcRjQN5iS8hgFI5xO069/Tm4ywUm4ZpuBnFKpqdAi\n"
+"zUNcBNuxiyVh/qUgWygJjyv/6+IZBX7MZijT4RJ11Y/R4E0ineMcW6jBPZ3IbJT1\n"
+"qrWjMjAwMA8GA1UdEwEB/wQFMAMBAf8wHQYDVR0OBBYEFChosgq0uAEUAxjns+bc\n"
+"NlmsY4YIMA0GCysGAQQBAoILBwgHA4IR9AAZVgNn0fNUVl2gIeacBaDFSoYTAWoi\n"
+"aCD7mhJWL3o4/zSoOqHW53b4M0g+EoRYD4+ZYyhKYo0PB5WnhQTBmnPL55uhW91y\n"
+"UomDwP+7rUfh16sgQ0EaGznrc96fNgjh6nXBqSGAg73SdbUt1K6o6yTlKbfaRnGg\n"
+"JKS4jNE3UrzgATSGiRGywb3yodoUGFx2xjYLakJEw2Gba45XtVDrsbEBkX2DY0iZ\n"
+"wh5ABAwhgDBr8FYSv12LQ2rQn3XGxGTF3TYNX4uvGpD03hB/yUtWvmyov05Kb343\n"
+"Ah70ItaYNwyykMSZmB4YHPYH/WzIy33mazxZXagXc/4z2yMKb9ii5aivwlYZDr8V\n"
+"hPcvhFGQsRTg0x5wUBJyHeVB+eSX9D9CumxtO8gC12FZAiyIFX1do/RoZUY8jfaz\n"
+"xDnsjmfNX0X0BpAr6F7s5ckpLYx6IWflEngAyZ8q8LIXpbEZWDN/Av3cw4Rme0v7\n"
+"RMk8Awf5u8jkOTz5BKIJd9S1myQLkOCgZyggARVktyGEXg93HJ0WwMDeHjbtwtvz\n"
+"dESKW7WfVRpOzvktEjZlTvVEWvhwmLQorZHgupjIFQj3YFgz5IjugSJM5jrEiXLp\n"
+"+roRno767bg8/JCWq40DU5hqRBtkGux72aejotjdJH6E8PbuxHDzY1ifWMJVUGjX\n"
+"TUmWqCeF0F6nFtmfaoNPhcrQW2qNRu1m7bE9fdt6xKY5bQ3H4br69QAUovntWTfX\n"
+"MpSSb4tZMt4CTpdVS7AJGZjg+gqdgv64uqkaszrHgFviaeTSi4bjT+cb0ANxMLWx\n"
+"e9gp9ni5hS43CWGGqpseqgKXVKEbKkXbnfK+fG/I/zi3WsxZV2QhwFUeSw5gWcaZ\n"
+"r5TN6z5rM5ltfO7ZeGKiVenEMhP5HKSA3XQ4Gk9tWMgzUsP3+r4BJjsyJBvYsZ8I\n"
+"GFpku/nE4VUN5Qs5PnvYYOZzyBla5GRIvweaXRnDKEw55uyQ3V2X8VjnAgDLI0kS\n"
+"nOSenHWa8H00Hmy64NfMQtbkJByySer5bokIktT0hTCLtBZRD52rVKWMxtD1+L1x\n"
+"PvrMznAO72kroFKyCUh+rB6GNHOgvPxpH/oUnh17GnhfbBQQRwwfbUs42Bzvh6Jd\n"
+"XYZjJxCyH7oQC51n9v4dJiAxKDuYt8neE+RDPvMn8IfwoVKX9RM4N2u6hc1m0KWC\n"
+"ogBjJLe9wBABAKNzN0qnGMDx9+BIQOrAwgXKlOPAp42l8rhfu24mtJmUWnvdrSfZ\n"
+"Q04AvfyOzNV0e4vcN4Px9zHquW8FF0delhNuQUHO2Qk+rbsrVnBT1siqtD8ZiGFt\n"
+"UXAEk0D3ryQCnl14jYoNPlK8XeZaeXDpxRWWJZnYOzFjhB7zuW8QTS32w9MExoht\n"
+"OXwn4FCBXcLRQMUXEc2YioGU/WDeEs24sYcfRg9yAhw8BRcrdFlymNHJlPaiEh5q\n"
+"EdOVxjL/OgqGPX3TnIDmtgzJmLLKGVDeigK6KmKXj5iGcpSMngVVV2nDoVUwTocT\n"
+"aX+Aj+Hxj0pyTzNP+vywhDTBLKPyFJdxZhvn7WRN1lVYWyCmsA9H0arVK3Y2S/K7\n"
+"sXiXdXR7Q72o9whwcViSn/nqbMgh4PKzzl9bwQxJ/8AQ3cvF734o0pz0iST6E6ma\n"
+"WUDau5yYAU7dQf0p8P+I+tM1VZpj7LWTO2dniVkyZuAm5LTB+GIxcB1wDHrRVwzc\n"
+"DT4UyOx/jc9dIyJVLlM8pFexuNbmgStyI1Ka4RZOgpzgSKvTT9uVsxIh6m5/KuMF\n"
+"pYJMzr16uJdOXXtBnrKRNHnFSDT+1bQIByRzrcqSzFPsnKu1B4pf+Mz9y7UBIDvS\n"
+"cILw9AK7+T6qreLsh40H//BJ1bTDP3TvWJUCLLfqJ89LvMRpyZBUqHZEJFq6Px5O\n"
+"+DK370eP48lKHRmmod53bkIa8jtHpXcZeSlsf4NAPDNj5YGeyjVW25E2z7lP3HXX\n"
+"VP+n/rnaId0CgOyY1r5g7UcBX74zMxROL+iN5PKnPY4SBir837KCUhKEjFGhet0G\n"
+"fch0pviOrOgaXoEgq45Nv8sXKIc8XINiwkrR1osDaxHRX71/j1L/dT6nSQp7iO7Z\n"
+"y+ubu4Picpv4haa2IMIxj0XD2Jq4Nxs7/vW+FXcIAQKujPfDgFU+CnfxQnrPde5L\n"
+"WZ0nzIvF9nizH5oC+2dWWAuQC8z6x7P6WoF6H0WdDr5WRRSJ5VL2Ytutw6b5ubXk\n"
+"whyePBIZpOL/WUTp0XacZJrgho+gCHAPTA8FwXxYG4xvOuSejP5Vq8vgu54r+gke\n"
+"25XdelJhhsNkZBDPoxaxA5QCxH65uu9EfMniYGCnpYraRNgemqFUKxsUv5xXq9Cl\n"
+"fwdK0029QMWHA2fOrF5NjnQOWiol2qU+JSUB5g8fpQzTf2UOQZdMY9pzc6bZh79g\n"
+"0ZoKO0k8xtCdbB7mc95gmu6Mz5ejotdI3WBjQLFnA9n5ZeU81cRFOw6wzHT+2i/L\n"
+"iqjMoDa9FQGD7xgFJQVQmxJYJXLyeTRFfHaVArUXXc4tEGY/SoERWIYDYP+rae01\n"
+"49Qncv4TOqD5ZeTIvBTNUtLXx4WuiZF7P5LpddBNo3N3sBLEhm/XrcHca53FoRWc\n"
+"rVQPg6Xee9FMkKOVU8145iDuBhjRi/2/CpKRo+DI06T13DIMNtHltjz3vhtjcMZT\n"
+"dRbjpBDQ5M4WwRDeTsKc2reEHRJG8BWJwIz+7C233P89MdQybfg9GUzDTFhvIFzL\n"
+"+7nNHy3GBGd+vFDoyEIk+T/knM4eB1zARpVtJaEH4MMBXcKDt+4aJAmYfYxD3wLa\n"
+"FR7UurpH2I8CTMXWTIZcwDPggCLVPHn70Hbn8lieoLkmPATqJtHS+yQmXO07oyU6\n"
+"icw2TG/i3nnIQOIUsFnH4+Kg8Kcjgo2qT7du099i1GJP/wrKsRqziT6Su3mbhwtQ\n"
+"T3+jpZlda53rxuOsRbOeZKLeNt79D4GeFGxVWAY9BtA8ZioRMZCB6Uz2UPIIKeDB\n"
+"G/6Jzu13b/ThG6nGjT0yl5kxj+pLhupdqNIyUSZybY/N4QyFJp05WQCHOg2Kkibf\n"
+"gF5v0ogCdonMa9Fe+UyY96PjPkZVrvfQKV3+Oor/o+uX/Pw5swe13J1bVljJCu/5\n"
+"S95jXiOekanUUHMWl7J075Wf1UEDEnUfg1F2NDgQDHL2yGZ85HuOKwYKt2H0BlJo\n"
+"ddEVRp5sqNzq+ZqsX83SUed6pJZDXc7K0f1kMhzilYGZSnjiJCjTn6X9ULVdTpdy\n"
+"P29iBh+dyIgmkkoKwKjkGF9EI9RL2Mkfct/lW0HXaHVzXB0BJlEpTII2UsHoZuHh\n"
+"JajXgAy4wrgqh8tAtmiJUzlVILRxOEJjeo1MqDdVy8aKAyGqxICi+OShH4kLQ/a8\n"
+"kJ5r7kryO1/IVjO+3RgRsP1yrtggPnvz5Me6rKG6Bnh9GlyRIYtjnHLK1bdPfAAL\n"
+"mABLUNZqRlo0c5faoGMoHBbCzoIt8fLj7jbqGqKO1Ouj1NZDbpV8y7b8VGgJ3QXW\n"
+"4oPFI/Oo9DvNWEuXLD5XBW5gdx8VtYbFD1tjehaG2bJjrOM22ytbAIiAWiIG7XVF\n"
+"/XTYWpwe2GwviKqOVr1dtcr0iAVrYB9UCFs5NPmXRueZKh4fMxy+RglMyotsi9RO\n"
+"5/7TXY+aSx3Uxl68FlNfEDDpAI4pMwjV+F7YXlWpzWMz4bGhQxGkoXfZMSwO6woV\n"
+"ovUXD16LPh/pvjGjUiK9M0xn3hwMrbAnanI98iciiSflI3xv6RtU2ASn64vp0CAf\n"
+"EUWB+lRGxeVx9pJ3r9NzxSW9jSgaC4Z6QiZxvpTswCHqC3JgFUEkTZYXVcReafja\n"
+"lKCGAJ993KjnhPXSq4Y6GXrR4xWsJMeYu8xPeKsKIwKex80B/80LEJ3NSTxLEuOT\n"
+"a3rVCFbw0FjoCS66o7ZrBqPNxZKiTF5J1mjKcTun66EbK/evk4mVUUZ7IAGdCE9Y\n"
+"PafVX6H+K4KHSjawL6unOm/H5kRpV1zP9YGfw4+9PyaEhi/O39ge7onXV59m7itK\n"
+"acsXhGqn91WFxouB5Ah3hqm2vTIFWVtLSKzwO64oBV25LOtfR2Xwck3AIbfZnqxc\n"
+"AG+ex3++KkCOwk5MozVx8xLrLkWvF8V2322NUtnnoGo+FWKgo2aA34AP4i59Me94\n"
+"B6SgXljdPL3Ze8AFbeIYYpD00RPIQgR+Tv3NStgm6Ff77arh88PbyzycGzEa2N1A\n"
+"hHMrW5AWWqQQIP5cAyjlnYNnJTXR9m+36Y02YD3RyHT3oXKTzQisK04N5VKsonI4\n"
+"gkgSh8qY1ksGiSPqYh46WV5naTXa/83tRlIuxYeybCdlTgOtgOt49aOhQNE69yOd\n"
+"iLvTwLWvrsDkpH3kIpG/k2awhStwsBJmv5rox290FWmxzMACVwKliHkNc8w9zPZj\n"
+"oU8lFvrvlpeC7G+rp/uq60RW2qY2T4wSyn42OYcvM49VaPFE2JKPU1w+6LSWi0LH\n"
+"RCb2QDcnShNssy0ttz+XQMICHybonJcCFh4j8hRgYmrg4NdC+ApfBSajW/fuspy4\n"
+"JSvfIPSR4dUCD2vPjgAfrYIqPYigOJcp+YC/UEMWGw0ddwSECgbtDIeJ4ECK0LEU\n"
+"RSgXeitRvQDx+Y/xYGbwE98L6giWDpr0bNRx9EzHCrpmgt5igilbqSS3S8X6W7/G\n"
+"GFQtKUhdnkQLpgNkKc5O2K7MSwBmO5hY9pFxm4FRR/08Vj/Xu2zr9SirdsGjQnMA\n"
+"tmt0YVjpAC9lUK4nKCgc4L7fc8vzKHjJOOEzAt4Z0RR0YnHd7BN9S7kNeRmrHIE8\n"
+"uwKKmpRFnhhxWH5ISJMAsUqmlBFs9IfbawAN8/eAyDb7yel8KZZTbv1BRLmjpivs\n"
+"8NFqzLi86nL9U/yimEVD5IxZfjLvhJ3pDGPk7KVzWIBjYfaGeVelhxN+2vRcdDVj\n"
+"wHL9HQCjAzdrfacvaA6TekeFQqMQ0nl56dB+phUYNZzms4RxoiavzFxC8QDK9axC\n"
+"4icHP8ZUgjF/ZIQyLJaflM++O8SzHJ33yCSINSFPBquknzisVh8v48mULuuvWUPd\n"
+"+MPuKC1zsSUFq01WVhTdAxmFroMEBb3Nb0/gFt5NBTkxE1L0TFrXl69sojWAXDMx\n"
+"GvQi0/x/XR6Sl1fAHQiKnv1zDTPfZ8CI56YcdVyPB78qF9TfmWxBi2KJrTbHgsxh\n"
+"rRbx8ntG6F1hEDe4z5JgwPqiWV9OH4S4f8TZ70r8sK5rZ6DwjFKVV/dYmoIpMSiA\n"
+"2tIEAy49MqMnNefTAcs0XPHoglBFLJVa9mkhvABdyr6CNR1ajuX+sS4Q07gHGHqA\n"
+"GRcGpdn9JuYxoAl1vb7C3zQ7FMEDmjS0/GttEIDmc3VFElSWx6KtkXqpV+20N+vc\n"
+"ID5zetmss0PmHnYI9CndtKEu0KyT7L2SF3hIbNdnHoqk5172gZb87ggvIQIEQ1q2\n"
+"pmTyJ7tmwlnO0DNcQgfiAAuSTOr4l36cD19D7VSELX/c5dx4woEIoHF9rYDG3CP/\n"
+"sFk/Qyn8UcD2lqGNOVLmyWUr7u7AZh4ibd11qqtRJto4ri1OQOpIaP6g7Eln6vQ6\n"
+"/1EJrFumd8EvnMmuiDKienieTIAUErM1mvR6GgF6h8tgMmaAjF9dDEsqrmVCc2/d\n"
+"3na6HAwMVise4LuDIdqjydEflnxOs+N/gf6ys4O+CAK0WFZm3MFD67NWUh7hds2A\n"
+"7SkGRoQtSfAyZq8ZGiBtGqPObKR7oz+27sAOvX+5+7ADA67QlTMrcfi8SwG38zwU\n"
+"ariCRU59xMBHClWheYhDaEN61SVUqA+LpQQ2YleuyKu1Hou/iXsClcHslQEDidhE\n"
+"MaeitUkOrjcuFlGeuZGveuVExUq5/5XT0JnxjDxIxOpG5e6BcvkwGxXj0W3ICa2b\n"
+"Z9+nhNy56hx8fNFFl2ZehFPf4P6RpANSpsHKXq/MQC4vX4S6Rd05sqlDd1Xg+Fy0\n"
+"OBDogKOQ5NoOHyWuaTISVz4skA8vrNbc2uU/vyd3PMmkF5wOQuAiSW6L0mZrdFjt\n"
+"nB95HzEdo32avwgm01u+2LbwRTF/w2CbtkQlqNjhEyuR8AAICxUyaIiUsu77NEdW\n"
+"V7DMze8aHSg5Z3h7fREYGRwlQmZ2jJCiKjxmos/n8hxCUW/6AAAAAAAAAAAAAAAA\n"
+"AAAAAAAECBMbIy41Og==\n"
+"-----END CERTIFICATE-----\n";
+
+// Report signature requirements for our certificate chain
+int getSigRequirements(int *sigReqs) {
+    sigReqs[0]=DILITHIUM3;
+    return 1;
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/lib/tls_client_recv.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/lib/tls_client_recv.cpp
new file mode 100644
index 0000000..7503d64
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/lib/tls_client_recv.cpp
@@ -0,0 +1,975 @@
+// 
+// Process input received from Server
+//
+
+#include "tls_client_recv.h"
+#include "tls_cert_chain.h"
+#include "tls_logger.h"
+
+// check for malformed input
+bool malformed(int rval,int maxm) {
+    if ((rval&1) == 1) { // if its odd -> error
+        return true;
+    }
+    if (rval/2 > maxm) { // if its too big -> error
+        return true;
+    }
+    return false;
+}
+
+// First some functions for parsing values out of an octad string
+// parse out an octad of length len from octad M into E
+// ptr is a moving pointer through the octad M
+ret parseoctad(octad *E,int len,octad *M,int &ptr)
+{
+    ret r={0,BAD_RECORD};
+    if (ptr+len>M->len) return r;   // not enough in M - probably need to read in some more
+    if (E==NULL)
+    {
+        ptr+=len;
+    } else {
+        E->len=len;
+        for (int i=0;i<len && i<E->max;i++ )
+            E->val[i]=M->val[ptr++];
+    }
+    r.val=len; r.err=0;             // it looks OK
+    return r;
+}
+
+// parse out an array of bytes of length len
+ret parsebytes(char *e,int len,octad *M,int &ptr)
+{
+    ret r={0,BAD_RECORD};
+    if (ptr+len>M->len) return r;   // not enough in M - probably need to read in some more
+    if (e==NULL)
+    {
+        ptr+=len;
+    } else {
+        for (int i=0;i<len;i++ )
+            e[i]=M->val[ptr++];
+    }
+    r.val=len; r.err=0;             // it looks OK
+    return r;
+}
+
+// parse out an octad of length len from octad M
+// ptr is a moving pointer through the octad M
+// but now E is just a pointer into M
+ret parseoctadptr(octad *E,int len,octad *M,int &ptr)
+{
+    ret r={0,BAD_RECORD};
+    if (ptr+len>M->len) return r;   // not enough in M - probably need to read in some more
+    E->len=len;
+    E->max=len;
+    E->val=&M->val[ptr];
+    ptr+=len;
+    r.val=len; r.err=0;             // it looks OK
+    return r;
+}
+
+// parse out an integer of length len
+ret parseInt(octad *M,int len,int &ptr)
+{
+    ret r={0,BAD_RECORD};
+    if (ptr+len>M->len) return r;
+    r.val=0;
+    for (int i=0;i<len;i++)
+        r.val=256*r.val+(unsigned int)(unsigned char)M->val[ptr++];
+    r.err=0;
+    return r;
+}
+
+// ALL Server to Client records arrive via this function
+// Basic function for reading in a record, which may be only contain a fragment of a larger message
+
+// Protocol messages can be fragmented, and arrive as multiple records. 
+// Record contents are appended to the input buffer. 
+// Messages are read from the input buffer, and on reaching the end of the buffer, 
+// new records are pulled in to complete a message. 
+// Most records must be decrypted before being appended to the message buffer.
+
+// get another fragment of server response, in the form of a record. Record type encoded in its header
+// output message body to IBUFF
+// If record is encrypted, decrypt and authenticate it
+// append its contents to the end of IBUFF
+// returns record type, ALERT, APPLICATION or HSHAKE (or pseudo type TIMED_OUT)
+int getServerRecord(TLS_session *session)
+{
+    int rtn,left,pos,rlen,taglen;
+    char rh[5];
+    octad RH={0,sizeof(rh),rh};
+
+    char tag[TLS_MAX_TAG_SIZE];
+    octad TAG={0,sizeof(tag),tag};
+
+    pos=session->IBUFF.len;               // current end of IO
+    rtn=getOctad(session->sockptr,&RH,3);  // Get record Header - should be something like 17 03 03 XX YY
+
+// Need to check RH.val for correctness
+    if (rtn<0)
+        return TIMED_OUT;
+    if (RH.val[0]==ALERT)
+    {  // plaintext alert
+        left=getInt16(session->sockptr);
+        if (left!=2) return BAD_RECORD;                     // ** RM
+        rtn=getOctad(session->sockptr,&session->IBUFF,left);
+        if (rtn<0)
+            return TIMED_OUT;
+        return ALERT;
+    }
+    if (RH.val[0]==CHANGE_CIPHER)
+    { // read it, and ignore it
+        char sccs[10];
+        left=getInt16(session->sockptr);
+        if (left!=1) return BAD_RECORD;                    // ** RM
+        rtn=getBytes(session->sockptr,sccs,left);
+        if (rtn<0)
+            return TIMED_OUT;
+        if (session->status!=TLS13_HANDSHAKING)
+            return WRONG_MESSAGE;
+        rtn=getOctad(session->sockptr,&RH,3); // get the next record and carry on
+        if (rtn<0)
+            return TIMED_OUT;
+    }
+
+    if (RH.val[0]!=HSHAKE && RH.val[0]!=APPLICATION && RH.val[0]!=HEART_BEAT)
+        return WRONG_MESSAGE;
+
+    left=getInt16(session->sockptr);
+    if (left>TLS_MAX_CIPHER_FRAG)
+        return MAX_EXCEEDED;
+
+    OCT_append_int(&RH,left,2);
+    if (left+pos>session->IBUFF.max)
+    { // this commonly happens with big records of application data from server
+        log(IO_DEBUG,(char *)"Record received of length= ",(char *)"%d",left+pos,NULL);
+        return MEM_OVERFLOW;   // record is too big - memory overflow
+    }
+    if (!session->K_recv.active)
+    { // not encrypted
+        if (RH.val[0]==APPLICATION || RH.val[0]==HEART_BEAT){
+            return BAD_RECORD;
+        }
+        if (left>TLS_MAX_PLAIN_FRAG)
+            return MAX_EXCEEDED;
+        if (left==0)
+            return WRONG_MESSAGE;
+        rtn=getBytes(session->sockptr,&session->IBUFF.val[pos],left);  // read in record body
+        if (rtn<0)
+            return TIMED_OUT;
+        session->IBUFF.len+=left;
+        return HSHAKE;
+    }
+    if (RH.val[0]==HSHAKE) {
+        return BAD_RECORD;
+    }
+    taglen=session->K_recv.taglen;
+    if (left < taglen) 
+        return BAD_RECORD;
+  
+    rlen=left-taglen; // plaintext record length
+
+    rtn=getBytes(session->sockptr,&session->IBUFF.val[pos],rlen);  // read in record body
+    if (rtn<0)
+        return TIMED_OUT;
+
+    session->IBUFF.len+=(rlen);    // place record into iobuff
+    rtn=getOctad(session->sockptr,&TAG,taglen);        // extract TAG
+    if (rtn<0)
+        return TIMED_OUT;
+    bool success=SAL_aeadDecrypt(&session->K_recv,RH.len,RH.val,rlen,&session->IBUFF.val[pos],&TAG);
+    if (!success)
+       return AUTHENTICATION_FAILURE;     // tag is wrong   
+    
+    incrementCryptoContext(&session->K_recv); // update IV
+
+// get record ending - encodes real (disguised) record type. Could be an Alert.
+    int lb=session->IBUFF.val[session->IBUFF.len-1]; 
+    session->IBUFF.len--; rlen--; // remove it
+    while (lb==0 && rlen>0 /*session->IBUFF.len>0*/)
+    { // could be zero padding
+        lb=session->IBUFF.val[session->IBUFF.len-1];   // need to track back through zero padding for this....
+        session->IBUFF.len--; rlen--;// remove it
+    }
+
+    if (rlen>TLS_MAX_PLAIN_FRAG) return MAX_EXCEEDED;
+
+    // rlen is Inner Plaintext length?
+    if ((lb==HSHAKE || lb==ALERT) && rlen==0)
+        return WRONG_MESSAGE;  // Implementations MUST NOT send zero-length fragments of Handshake types
+    if (lb==HSHAKE)
+        return HSHAKE;
+    if (lb==APPLICATION)
+        return APPLICATION;
+    if (lb==HEART_BEAT)
+        return HEART_BEAT;
+    if (lb==ALERT)
+    { // Disguised Alert record received, delete anything in IO prior to alert, and just return 2-byte alert
+        OCT_shift_left(&session->IBUFF,pos);
+        return ALERT;
+    }
+    return WRONG_MESSAGE;
+}
+
+// These functions read data from the input buffer, and pull more handshake records from a socket if it has to.
+// ALL of these records SHOULD be of type HSHAKE
+ret parseIntorPull(TLS_session *session,int len)
+{
+    ret r=parseInt(&session->IBUFF,len,session->ptr);
+    while (r.err)
+    { // not enough bytes in IO - Pull in some more
+        int rtn=getServerRecord(session); 
+        if (rtn!=HSHAKE) {  // Bad input from server (Authentication failure? Wrong record type?)
+            r.err=rtn;  // probably negative error
+            if (rtn==ALERT) r.val=session->IBUFF.val[1];
+            if (rtn==APPLICATION) r.err=WRONG_MESSAGE;
+            break;
+        }
+        r=parseInt(&session->IBUFF,len,session->ptr);
+    }
+    return r;
+}
+
+// Get an octad O of length len from the IBUFF buffer. Create a copy.
+ret parseoctadorPull(TLS_session *session,octad *O,int len)
+{
+    ret r=parseoctad(O,len,&session->IBUFF,session->ptr);
+    while (r.err)
+    { // not enough bytes in IBUFF - pull in another fragment
+        int rtn=getServerRecord(session);
+        if (rtn!=HSHAKE) {
+            r.err=rtn;
+            if (rtn==ALERT) r.val=session->IBUFF.val[1];
+            if (rtn==APPLICATION) r.err=WRONG_MESSAGE;
+            break;
+        }
+        r=parseoctad(O,len,&session->IBUFF,session->ptr);
+    }
+    return r;
+}
+
+// Get byte array o of length len from the IBUFF buffer. Create a copy.
+ret parsebytesorPull(TLS_session *session,char *o,int len)
+{
+    ret r=parsebytes(o,len,&session->IBUFF,session->ptr);
+    while (r.err)
+    { // not enough bytes in IO - pull in another fragment
+        int rtn=getServerRecord(session);
+        if (rtn!=HSHAKE) {
+            r.err=rtn;
+            if (rtn==ALERT) r.val=session->IBUFF.val[1];
+            if (rtn==APPLICATION) r.err=WRONG_MESSAGE;
+            break;
+        }
+        r=parsebytes(o,len,&session->IBUFF,session->ptr);
+    }
+    return r;
+}
+
+// Get an octad O of length len from the IBUFF buffer, but this time the output octad is a pointer into the IBUFF buffer
+ret parseoctadorPullptrX(TLS_session *session,octad *O,int len)
+{
+    ret r=parseoctadptr(O,len,&session->IBUFF,session->ptr);
+    while (r.err)
+    { // not enough bytes in IO - pull in another fragment
+        int rtn=getServerRecord(session); 
+        if (rtn!=HSHAKE) {
+            r.err=rtn;
+            if (rtn==ALERT) r.val=session->IBUFF.val[1];
+            if (rtn==APPLICATION) r.err=WRONG_MESSAGE;
+            break;
+        }
+        r=parseoctadptr(O,len,&session->IBUFF,session->ptr);
+    }
+    return r;
+}
+
+// Could have (a) received an alert, or (b) had problem with response, so need to send an alert
+// test for a bad response, log what happened and act accordingly
+// Very probably requires sending an alert to the server, and aborting
+// If Alert received, log it, send alert, abort
+bool badResponse(TLS_session *session,ret r) //Socket *client,crypto *send,ret r)
+{
+    logServerResponse(r);
+    if (r.err != 0)
+    {
+       log(IO_PROTOCOL,(char *)"Handshake failed\n",NULL,0,NULL);
+    }
+    if (r.err<0)
+    { // send an alert to the Server, and abort
+        sendAlert(session,alert_from_cause(r.err));
+        return true;
+    }
+    if (r.err==ALERT)
+    { // received an alert from the Server - abort
+        log(IO_PROTOCOL,(char *)"*** Alert received - ",NULL,0,NULL);
+        logAlert(r.val);
+        return true;
+    }
+    if (r.err) // some other error, maybe time out
+        return true;
+    return false;
+}
+
+// Function return convention. These functions return a "ret" structure
+// if r.err +ve log unexpected event and abort
+// if r.err -ve send alert and abort
+// if r.err = ALERT, r.val=received alert code
+// if all goes well, r.val returns message type, r.err=0
+
+// Note: we are on a hair trigger here. Anything doesn't look right, we bomb out.
+
+// Functions to process server responses
+// Deals with any kind of fragmentation
+// Build up server handshake response in IBUFF, decrypting each fragment in-place
+// extract Encrypted Extensions, Certificate Chain, Server Certificate Signature and Server Verifier Data
+// update transcript hash
+// Bad actor Server could be throwing anything at us - so be careful
+ret seeWhatsNext(TLS_session *session)
+{
+    int nb;
+    ret r;
+
+    //session->ptr=0;
+    r=parseIntorPull(session,1); 
+    if (r.err) return r; 
+    session->ptr-=1;
+
+    nb=r.val;
+    if (nb==END_OF_EARLY_DATA || nb==KEY_UPDATE) { // Servers MUST NOT send this.... KEY_UPDATE should not happen at this stage
+        r.err=WRONG_MESSAGE;
+        return r;
+    }
+    return r;      
+}
+
+// Get encrypted extensions
+ret getServerEncryptedExtensions(TLS_session *session,ee_status *enc_ext_expt,ee_status *enc_ext_resp)
+{
+    ret r;
+    int nb,left,ext,len,tlen,xlen,mfl,cct,sct,hbmode;//,ptr=0;
+    int unexp=0;
+
+    r=parseIntorPull(session,1);
+    if (r.err) return r;
+    nb=r.val;
+
+    if (nb!=ENCRYPTED_EXTENSIONS) {
+        r.err=WRONG_MESSAGE;
+        return r;
+    }
+
+    r=parseIntorPull(session,3); left=r.val; if (r.err) return r;         // message length    
+
+    enc_ext_resp->early_data=false;
+    enc_ext_resp->alpn=false;
+    enc_ext_resp->server_name=false;
+    enc_ext_resp->max_frag_length=false;
+
+    r=parseIntorPull(session,2); len=r.val; if (r.err) return r; // length of extensions
+
+
+    if (left!=len+2) {
+        r.err=BAD_MESSAGE;
+        return r;
+    }
+
+// extension could include Servers preference for supported groups, which could be
+// taken into account by the client for later connections. Here we will ignore it. From RFC:
+// "Clients MUST NOT act upon any information found in "supported_groups" prior to successful completion of the handshake"
+    while (len>0)
+    {
+        r=parseIntorPull(session,2); ext=r.val; if (r.err) return r;
+        r=parseIntorPull(session,2); tlen=r.val; if (r.err) return r;
+        if (len<tlen+4) {
+            r.err=BAD_MESSAGE;
+            return r;
+        }
+        len-=(tlen+4);
+        switch (ext)
+        {
+        case EARLY_DATA :
+            if (tlen!=0) {
+                r.err=UNRECOGNIZED_EXT;
+                return r;
+            }
+            enc_ext_resp->early_data=true;
+            if (!enc_ext_expt->early_data) {
+                r.err=NOT_EXPECTED;
+                return r;
+            }
+
+            break;
+        case MAX_FRAG_LENGTH :
+            r=parseIntorPull(session,1); mfl=r.val; if (r.err) return r; // ideally this should the same as requested by client
+                                                   // but server may have ignored this request... :( so we ignore this response 
+            if (mfl!=TLS_MAX_FRAG || tlen!=1) {
+                r.err=UNRECOGNIZED_EXT;
+                return r;
+            }     
+            enc_ext_resp->max_frag_length=true;
+            if (!enc_ext_expt->max_frag_length) {
+                r.err=NOT_EXPECTED;
+                return r;
+            }
+            break;
+
+        case CLIENT_CERT_TYPE :
+            r=parseIntorPull(session,1); cct=r.val; if (r.err) return r;
+            if (tlen!=1) {
+                r.err=UNRECOGNIZED_EXT;
+                return r;
+            }
+#ifdef PREFER_RAW_CLIENT_PUBLIC_KEY
+            if (cct!=RAW_PUBLIC_KEY) {
+                session->client_cert_type=X509_CERT;
+            } else {
+                session->client_cert_type=RAW_PUBLIC_KEY;
+            }
+#else
+            session->client_cert_type=X509_CERT;
+#endif
+            break;
+        case SERVER_CERT_TYPE :
+            r=parseIntorPull(session,1); sct=r.val; if (r.err) return r;
+            if (tlen!=1) {
+                r.err=UNRECOGNIZED_EXT;
+                return r;
+            }
+#ifdef PREFER_RAW_SERVER_PUBLIC_KEY
+            if (sct!=RAW_PUBLIC_KEY) {
+                session->server_cert_type=X509_CERT;
+            } else {
+                session->server_cert_type=RAW_PUBLIC_KEY;
+            }
+#else
+             session->server_cert_type=X509_CERT;
+#endif
+             break;
+        case RECORD_SIZE_LIMIT:
+            r=parseIntorPull(session,2); mfl=r.val; if (r.err) return r;
+            
+            if (tlen!=2 || mfl<64) {
+                r.err=UNRECOGNIZED_EXT;
+                return r;
+            } 
+            session->max_record=mfl;
+            break;
+
+        case HEARTBEAT:
+            r=parseIntorPull(session,1); hbmode=r.val; if (r.err) return r;
+            if (hbmode==0 || hbmode>2)
+            {
+                r.err=UNRECOGNIZED_EXT;
+                return r;
+            }
+//printf("EXPECTING HEARTBEATs\n");
+            session->expect_heartbeats=true;
+            if (hbmode==1) {
+//printf("ALLOWED TO HEARTBEAT\n");
+                session->allowed_to_heartbeat=true;
+            }
+            else session->allowed_to_heartbeat=false;
+            break;
+
+        case APP_PROTOCOL :
+            r=parseIntorPull(session,2); xlen=r.val; if (r.err) return r;
+            r=parseIntorPull(session,1); mfl=r.val; if (r.err) return r;
+            if (tlen!=xlen+2 || xlen!=mfl+1)                                        // ** RM
+            {
+                r.err=UNRECOGNIZED_EXT;
+                return r;
+            }
+            r=parseoctadorPull(session,NULL,mfl);  if (r.err) return r; // ALPN code - send to NULL -- assume its the one I asked for
+            
+            enc_ext_resp->alpn=true;
+            if (!enc_ext_expt->alpn) {
+                r.err=NOT_EXPECTED;
+                return r;
+            }
+            break;
+        case SERVER_NAME:
+            enc_ext_resp->server_name=true;
+            if (tlen!=0) {
+                r.err=UNRECOGNIZED_EXT;
+                return r;
+            }            
+            if (!enc_ext_expt->server_name) {
+                r.err=NOT_EXPECTED;
+                return r;
+            }
+            break;
+        case SIG_ALGS:
+        case SIG_ALGS_CERT:
+        case KEY_SHARE:
+        case PSK_MODE:
+        case PRESHARED_KEY:
+        case TLS_VER:
+        case COOKIE:
+        case PADDING:
+            session->ptr+=tlen; // skip over it
+            r.err=FORBIDDEN_EXTENSION;
+            return r;
+        default:    // ignore all other extensions
+            session->ptr+=tlen; // skip over it
+            unexp++;
+            break;
+        }
+        if (r.err) return r;
+    }
+
+// Update Transcript hash and rewind IO buffer
+    runningHashIOrewind(session);
+
+    if (unexp>0)    
+    {
+        r.err=UNRECOGNIZED_EXT;
+        log(IO_DEBUG,(char *)"Unrecognized extensions received\n",NULL,0,NULL);
+    }
+    r.val=nb;
+    return r;
+}
+
+// check for overlap given server signature capabilities, and my client certificate
+static bool overlap(int *serverSigAlgs,int nssa,int *serverCertSigAlgs,int nscsa) {
+    int clientCertReqs[TLS_MAX_SUPPORTED_SIGS];
+    int nsreq=getSigRequirements(clientCertReqs);
+
+    for (int i=0;i<nsreq;i++) {
+        bool itsthere=false;
+        int sig=clientCertReqs[i];
+        for (int j=0;j<nssa;j++) {
+            if (sig==serverSigAlgs[j]) {
+                itsthere=true;
+            }
+        }
+        for (int j=0;j<nscsa;j++) {
+            if (sig==serverCertSigAlgs[j]) {
+                itsthere=true;
+            }
+        }
+        if (!itsthere) {
+            return false;
+        }
+    }
+    return true;    
+}
+
+// Receive a Certificate request
+ret getCertificateRequest(TLS_session *session,bool context)
+{
+    ret r;
+    int i,left,nb,ext,len,tlen,nssa,nscsa;//,ptr=0;
+    int unexp=0;
+    int sigalgs[TLS_MAX_SUPPORTED_SIGS]; // acceptable client signature types
+    int certsigalgs[TLS_MAX_SUPPORTED_SIGS];
+
+    r=parseIntorPull(session,1); // get message type
+    if (r.err!=0) {return r;}
+    nb=r.val;
+    if (nb != CERT_REQUEST) {
+        r.err=WRONG_MESSAGE;
+        return r;
+    }
+
+    r=parseIntorPull(session,3); left=r.val; if (r.err) return r;         // message length 
+    r=parseIntorPull(session,1); nb=r.val; if (r.err) return r;
+    if (context)
+    {
+        if (nb==0x00) {
+            r.err= MISSING_REQUEST_CONTEXT;// expecting Request context
+            return r;
+        }   
+        r=parseoctadorPull(session,&session->CTX,nb); if (r.err) return r;
+        left-=nb;
+    } else {
+        if (nb!=0x00) {
+            r.err= MISSING_REQUEST_CONTEXT;// expecting 0x00 Request context
+            return r;
+        }         
+    }
+    r=parseIntorPull(session,2); len=r.val; if (r.err) return r; // length of extensions
+    if (left!=len+3) {
+        r.err=BAD_MESSAGE;
+        return r;
+    }
+  
+    nssa=nscsa=0;
+// extension must include signature algorithms
+    while (len>0)
+    {
+        r=parseIntorPull(session,2); ext=r.val; if (r.err) return r;
+        r=parseIntorPull(session,2); tlen=r.val; if (r.err) return r; 
+        if (len<tlen+4) {
+            r.err=BAD_MESSAGE;
+            return r;
+        }
+        len-=(4+tlen);  
+        switch (ext)
+        {
+        case SIG_ALGS :
+            r=parseIntorPull(session,2);  if (r.err) return r;
+            if (malformed(r.val,TLS_MAX_SUPPORTED_SIGS) || tlen!=2+r.val) {
+                r.err=UNRECOGNIZED_EXT;
+                return r;
+            }
+            nssa=r.val/2;
+            for (i=0;i<nssa;i++)
+            {
+                r=parseIntorPull(session,2); if (r.err) return r;
+                sigalgs[i]=r.val;
+            }
+            break;
+
+        case SIG_ALGS_CERT :
+            r=parseIntorPull(session,2);  if (r.err) return r;
+            if (malformed(r.val,TLS_MAX_SUPPORTED_SIGS) || tlen!=2+r.val) {
+                r.err=UNRECOGNIZED_EXT;
+                return r;
+            }
+            nscsa=r.val/2;
+            for (i=0;i<nscsa;i++)
+            {
+                r=parseIntorPull(session,2); if (r.err) return r;
+                if (i<TLS_MAX_SUPPORTED_SIGS) certsigalgs[i]=r.val;
+            }
+            break;
+
+        default:    // ignore all other extensions
+            session->ptr+=tlen; // skip over it
+            unexp++;
+            break;
+        }
+        if (r.err) return r;
+    }
+
+// Update Transcript hash and rewind IO buffer
+    runningHashIOrewind(session);
+    r.val=CERT_REQUEST;
+    if (nssa==0) { // must specify at least one signature algorithm
+        r.err=MISSING_EXTENSIONS;
+        return r;
+    } 
+
+#if CLIENT_CERT == NOCERT
+    r.val=0;
+#else
+// just decline by sending NULL certificate, rather than an alert
+    if (!overlap(sigalgs,nssa,certsigalgs,nscsa)) {
+        r.val=0;
+        //log(IO_DEBUG,(char *)"Server cannot verify client certificate\n",NULL,0,NULL);
+        //r.err=BAD_HANDSHAKE;
+        //return r;
+    }
+#endif
+    if (unexp>0)    
+        log(IO_DEBUG,(char *)"Unrecognized extensions received\n",NULL,0,NULL);
+
+    return r;
+}
+
+// Get certificate chain, and check its validity 
+ret getCheckServerCertificateChain(TLS_session *session,octad *PUBKEY,octad *SIG)
+{
+    ret r;
+    int nb,len,tlen;
+    octad CERTCHAIN;       // // Clever re-use of memory - share memory rather than make a copy!
+    CERTCHAIN.len=0;
+
+    r=parseIntorPull(session,1); // get message type
+    if (r.err!=0) {return r;}
+    nb=r.val;
+    if (nb != CERTIFICATE) {
+        r.err=WRONG_MESSAGE;
+        return r;
+    }
+
+    r=parseIntorPull(session,3); len=r.val; if (r.err) return r;         // message length   
+    log(IO_DEBUG,(char *)"Certificate Chain Length= ",(char *)"%d",len,NULL);
+
+    if (len==0)
+    {
+        r.err=EMPTY_CERT_CHAIN;
+        return r;
+    }
+
+    r=parseIntorPull(session,1); nb=r.val; if (r.err) return r;
+    if (nb!=0x00) {
+        r.err=MISSING_REQUEST_CONTEXT;// expecting 0x00 Request context
+        return r;
+    }
+    r=parseIntorPull(session,3); tlen=r.val; if (r.err) return r;    // get length of certificate chain list
+
+    if (tlen==0)
+    {
+        r.err=EMPTY_CERT_CHAIN;
+        return r;
+    }
+    if (tlen+4!=len)
+    {
+        r.err=BAD_CERT_CHAIN;
+        return r;
+    }
+
+    r=parseoctadorPullptrX(session,&CERTCHAIN,tlen); if (r.err) return r; // get pointer to certificate chain
+
+// Update Transcript hash and rewind IO buffer
+    runningHashIO(session);     // Got to do this here, as checkServerCertChain may modify IO buffer contents
+    r.err=checkServerCertChain(&CERTCHAIN,session->hostname,session->server_cert_type,PUBKEY,SIG);
+
+#ifdef NO_CERT_CHECKS
+    r.err=0;
+#endif
+
+    rewindIO(session); // now save to rewind
+
+    r.val=CERTIFICATE;
+    return r;
+}
+
+// Get Server proof that he owns the Certificate, by receiving its signature SCVSIG on transcript hash
+ret getServerCertVerify(TLS_session *session,octad *SCVSIG,int &sigalg)
+{
+    ret r;
+    int nb,left,len;//,ptr=0;
+    int sigAlgs[TLS_MAX_SUPPORTED_SIGS];
+    int nsa=SAL_sigs(sigAlgs);
+    r=parseIntorPull(session,1); // get message type
+    if (r.err!=0) {return r;}
+    nb=r.val;
+    if (nb != CERT_VERIFY) {
+        r.err=WRONG_MESSAGE;
+        return r;
+    }
+
+    r=parseIntorPull(session,3); left=r.val; if (r.err) return r; // message length    
+    OCT_kill(SCVSIG);
+    r=parseIntorPull(session,2); sigalg=r.val; if (r.err) return r; // may for example be 0804 - RSA-PSS-RSAE-SHA256
+
+    bool offered=false;
+    for (int i=0;i<nsa;i++)
+        if (sigalg==sigAlgs[i]) offered=true;
+    if (!offered)
+    {
+        r.err=CERT_VERIFY_FAIL;
+        return r;
+    }
+
+    r=parseIntorPull(session,2); len=r.val; if (r.err) return r;    // sig data follows
+    r=parseoctadorPull(session,SCVSIG,len); if (r.err) return r;
+
+    if (left!=len+4) {
+        r.err=BAD_MESSAGE;
+        return r;
+    }
+
+// Update Transcript hash and rewind IO buffer
+    runningHashIOrewind(session);
+
+    r.val=CERT_VERIFY;
+    return r;
+}
+
+// Get handshake finish verifier data in HFIN
+ret getServerFinished(TLS_session *session,octad *HFIN)
+{
+    ret r;
+    int nb,len;
+    r=parseIntorPull(session,1); // get message type
+    if (r.err!=0) {return r;}
+    nb=r.val;
+    if (nb != FINISHED) {
+        r.err=WRONG_MESSAGE;
+        return r;
+    }
+
+    int hashtype=SAL_hashType(session->cipher_suite);
+    int hlen=SAL_hashLen(hashtype);
+    r=parseIntorPull(session,3); len=r.val; if (r.err) return r;         // message length    
+    OCT_kill(HFIN);
+    r=parseoctadorPull(session,HFIN,hlen); if (r.err) return r;
+
+    if (len!=hlen)
+        r.err=BAD_MESSAGE;
+
+// Update Transcript hash and rewind IO buffer
+    runningHashIOrewind(session);
+
+    r.val=FINISHED;
+    return r;
+}
+
+// Handshake Retry Request
+static const char *hrrh= (const char *)"CF21AD74E59A6111BE1D8C021E65B891C2A211167ABB8C5E079E09E2C8A8339C";
+
+// Process initial serverHello - NOT encrypted
+// pskid >=0 if Pre-Shared-Key is accepted
+ret getServerHello(TLS_session *session,int &kex,octad *CK,octad *PK,int &pskid)
+{
+    ret r;
+    int tls,left,silen,cmp,extLen,ext,tmplen,pklen,cipher;
+    bool retry=false;
+    char sid[32];
+    char srn[32];
+    octad SRN={0,sizeof(srn),srn};    
+    char hrr[40];
+    octad HRR={0,sizeof(hrr),hrr};
+
+// need this to check for Handshake Retry Request    
+    OCT_from_hex(&HRR,(char *)hrrh);
+
+    kex=-1;
+    pskid=-1;
+
+    OCT_kill(CK); OCT_kill(PK);
+// get first fragment - not encrypted
+    OCT_kill(&session->IBUFF);
+
+// start parsing mandatory components
+    session->ptr=0;
+
+    r=parseIntorPull(session,1); 
+    if (r.err) return r; // should be Server Hello
+    if (r.val!=SERVER_HELLO)
+    {
+        r.err=BAD_HELLO;
+        return r;
+    }
+
+    r=parseIntorPull(session,3); left=r.val; if (r.err) return r;   // If not enough, pull in another fragment
+    r=parseIntorPull(session,2); if (r.err) return r;
+
+    if (left<72)
+    {
+        r.err=BAD_HELLO;
+        return r;
+    }
+    left-=2;                // whats left in message
+
+    r= parseoctadorPull(session,&SRN,32); if (r.err) return r;
+    left-=32;
+    if (OCT_compare(&SRN,&HRR))
+    {
+        retry=true;        // "random" data was not random at all - indicated Handshake Retry Request!
+    }
+    r=parseIntorPull(session,1); silen=r.val; if (silen!=32) r.err=BAD_HELLO; if (r.err) return r; 
+    left-=1;
+    r=parsebytesorPull(session,sid,silen); if (r.err) return r;
+    left-=silen;  
+
+// Tricky one. According to the RFC (4.1.3) this check should be made, even though the session id is "legacy",
+// Unfortunately it is not made clear if the same session ID should be use on a handshake resumption.
+// We note that some servers echo the original id, not a new id associated with a new Client Hello
+// Solution here is to use same id on resumption(?)
+    bool mismatch=false;
+    for (int i=0;i<32;i++)
+    {
+        if (session->id[i]!=sid[i])
+            mismatch=true;
+    }
+    if (mismatch) { 
+        r.err=ID_MISMATCH;  // check identities match
+        return r;
+    }
+    r=parseIntorPull(session,2); cipher=r.val; if (r.err) return r;
+    left-=2;
+
+    if (session->cipher_suite!=0)
+    { // don't allow a change after initial assignment
+        if (cipher!=session->cipher_suite)
+        {
+            r.err=BAD_HELLO;
+            return r;
+        }
+    }
+    session->cipher_suite=cipher;
+
+    r=parseIntorPull(session,1); cmp=r.val; if (r.err) return r;
+    left-=1; // Compression not used in TLS1.3
+    if (cmp!=0x00) { 
+        r.err=NOT_TLS1_3;  // don't ask
+        return r;
+    }
+
+    r=parseIntorPull(session,2); extLen=r.val; if (r.err) return r;
+    left-=2;  
+    if (left!=extLen) { // Check space left is size of extensions
+        r.err=BAD_HELLO;
+        return r;
+    }
+
+    int supported_version=0;
+// process extensions
+    while (extLen>0)
+    {
+        r=parseIntorPull(session,2); ext=r.val; if (r.err) return r;
+        r=parseIntorPull(session,2); tmplen=r.val; if (r.err) break;
+        if (extLen<4+tmplen)
+        {
+            r.err=BAD_HELLO;
+            return r;
+        }
+        extLen-=(4+tmplen);
+        log(IO_DEBUG,(char *)"Server Hello Extension= ",(char *)"%x",ext,NULL);
+        switch (ext)
+        {
+        case KEY_SHARE :
+            { // actually mandatory
+                int glen=2;
+                r=parseIntorPull(session,2); kex=r.val; if (r.err) break;
+                if (!retry)
+                { // its not a retry request
+                    r=parseIntorPull(session,2); pklen=r.val; if (r.err) break;   // FIX this first for HRR
+                    r=parseoctadorPull(session,PK,pklen); 
+                    glen+=(2+pklen);
+                }
+                if (tmplen!=glen)    
+                {
+                    r.err=BAD_HELLO;
+                    return r;
+                }
+                break;
+            }
+        case PRESHARED_KEY :
+            { // Indicate acceptance of pre-shared key
+                if (tmplen!=2)    
+                {
+                    r.err=BAD_HELLO;
+                    return r;
+                }
+                r=parseIntorPull(session,2); pskid=r.val;
+                break;
+            }
+        case COOKIE :
+            { // Pick up a cookie
+                r=parseoctadorPull(session,CK,tmplen);
+                break;
+            }
+        case TLS_VER :
+            { // report TLS version
+                if (tmplen!=2)        
+                {
+                    r.err=BAD_HELLO;
+                    return r;
+                }
+                r=parseIntorPull(session,2); tls=r.val; if (r.err) break; // get TLS version
+                supported_version=tls;
+                break;
+            }
+       default :
+            r.err=UNRECOGNIZED_EXT;            
+            break;           
+        }
+        if (r.err) return r;
+    }
+    
+    if (supported_version==0 || supported_version!=TLS1_3)
+        r.err=NOT_TLS1_3;
+
+    if (retry)
+        r.val=HANDSHAKE_RETRY;
+    else
+        r.val=SERVER_HELLO;
+    return r;
+}
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/lib/tls_client_send.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/lib/tls_client_send.cpp
new file mode 100644
index 0000000..a4c9071
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/lib/tls_client_send.cpp
@@ -0,0 +1,566 @@
+// 
+// Process output sent to Server
+//
+
+#include "tls_client_send.h"
+#include "tls_logger.h"
+#include "tls_certs.h"
+
+// send Change Cipher Suite - helps get past middleboxes (WTF?)
+void sendCCCS(TLS_session *session)
+{
+    char cccs[10];
+    octad CCCS={0,sizeof(cccs),cccs};
+    OCT_from_hex(&CCCS,(char *)"140303000101");
+    sendOctad(session->sockptr,&CCCS);
+}
+
+// Functions to build clientHello Extensions based on our preferences/capabilities
+
+// Build Heartbeat Extension
+void addHeartbeat(octad *EXT)
+{
+    OCT_append_int(EXT,HEARTBEAT,2);  // This extension is HEARTBEAT
+    OCT_append_int(EXT,1,2);
+#ifdef PEER_CAN_HEARTBEAT
+    OCT_append_int(EXT,1,1);  // peer can heartbeat
+#else
+    OCT_append_int(EXT,2,1);  // peer cannot heartbeat
+#endif
+}
+
+// Build Certificate Authorities Extension
+/*
+void addCertAuthorities(octad *EXT)
+{
+    char dn[256];
+    octad DN={0,sizeof(dn),dn};
+    OCT_from_base64(&DN,(char *)mysupportedca);
+    OCT_append_int(EXT,CERT_AUTHORITIES,2);     
+    OCT_append_int(EXT,DN.len+2,2);   // only one CA allowed (for now)
+    OCT_append_int(EXT,DN.len,2);
+    OCT_append_octad(EXT,&DN);
+}
+*/
+// Build Servername Extension
+void addServerNameExt(octad *EXT,char *servername)
+{
+    int len=strlen(servername);
+    OCT_append_int(EXT,SERVER_NAME,2);  // This extension is SERVER_NAME(0)
+    OCT_append_int(EXT,5+len,2);        // In theory its a list..
+    OCT_append_int(EXT,3+len,2);        // but only one entry
+    OCT_append_int(EXT,0,1);            // Server is of type DNS Hostname (only one type supported, and only one of each type)
+    OCT_append_int(EXT,len,2);            // serverName length
+    OCT_append_string(EXT,servername);    // servername
+}
+    
+// Build Supported Groups Extension
+void addSupportedGroupsExt(octad *EXT,int nsg,int *supportedGroups)
+{
+    OCT_append_int(EXT,SUPPORTED_GROUPS,2); // This extension is SUPPORTED GROUPS(0x0a)
+    OCT_append_int(EXT,2*nsg+2,2);          // Total length
+    OCT_append_int(EXT,2*nsg,2);            // Number of entries
+    for (int i=0;i<nsg;i++)                    // One entry per supported group 
+        OCT_append_int(EXT,supportedGroups[i],2);
+}
+
+// Build client cert type extension for raw public key
+void addClientRawPublicKey(octad *EXT)
+{
+    OCT_append_int(EXT,CLIENT_CERT_TYPE,2);
+    OCT_append_int(EXT,3,2);
+    OCT_append_int(EXT,2,1);
+    OCT_append_int(EXT,RAW_PUBLIC_KEY,1);
+    OCT_append_int(EXT,X509_CERT,1);
+}
+
+// Build server cert type extension for raw public key
+void addServerRawPublicKey(octad *EXT)
+{
+    OCT_append_int(EXT,SERVER_CERT_TYPE,2);
+    OCT_append_int(EXT,3,2);
+    OCT_append_int(EXT,2,1);
+    OCT_append_int(EXT,RAW_PUBLIC_KEY,1);
+    OCT_append_int(EXT,X509_CERT,1);
+}
+
+// Build Signature algorithms Extension
+void addSigAlgsExt(octad *EXT,int nsa,int *sigAlgs)
+{
+    OCT_append_int(EXT,SIG_ALGS,2);        // This extension is SIGNATURE_ALGORITHMS(0x0d)
+    OCT_append_int(EXT,2*nsa+2,2);        // Total length
+    OCT_append_int(EXT,2*nsa,2);        // Number of entries
+    for (int i=0;i<nsa;i++)                // One entry per supported signature algorithm
+        OCT_append_int(EXT,sigAlgs[i],2);
+}
+
+// Build Signature algorithms Cert Extension
+void addSigAlgsCertExt(octad *EXT,int nsac,int *sigAlgsCert)
+{
+    OCT_append_int(EXT,SIG_ALGS_CERT,2);    // This extension is SIGNATURE_ALGORITHMS_CERT (0x32)
+    OCT_append_int(EXT,2*nsac+2,2);            // Total length
+    OCT_append_int(EXT,2*nsac,2);            // Number of entries
+    for (int i=0;i<nsac;i++)                // One entry per supported signature algorithm
+        OCT_append_int(EXT,sigAlgsCert[i],2);
+}
+
+// Add Pre-Shared-Key ...
+// ..but omit binding
+int addPreSharedKeyExt(octad *EXT,unsign32 age,octad *IDS,int sha)
+{
+    int tlen1,tlen2;
+    tlen1=tlen2=0;
+    tlen1+=IDS->len+2+4;
+    tlen2+=sha+1;
+    OCT_append_int(EXT,PRESHARED_KEY,2);
+    OCT_append_int(EXT,tlen1+tlen2+4,2);
+// PSK Identifiers
+    OCT_append_int(EXT,tlen1,2);
+    OCT_append_int(EXT,IDS->len,2);
+    OCT_append_octad(EXT,IDS);
+    OCT_append_int(EXT,age,4);
+    return tlen2+2;  // length of binders
+}
+
+// Add Client Key Share extension
+// Offer just one public key
+void addKeyShareExt(octad *EXT,int alg,octad *PK)
+{
+    int tlen=PK->len+4;
+    OCT_append_int(EXT,KEY_SHARE,2); // This extension is KEY_SHARE(0x0033)
+    OCT_append_int(EXT,tlen+2,2);
+    OCT_append_int(EXT,tlen,2);
+    OCT_append_int(EXT,alg,2);
+    OCT_append_int(EXT,PK->len,2);
+    OCT_append_octad(EXT,PK);
+}
+
+// Add ALPN extension
+// Offer just one option
+void addALPNExt(octad *EXT,octad *AP)
+{
+    int tlen=AP->len+1;
+    OCT_append_int(EXT,APP_PROTOCOL,2);
+    OCT_append_int(EXT,tlen+2,2);
+    OCT_append_int(EXT,tlen,2);
+    OCT_append_int(EXT,AP->len,1);
+    OCT_append_octad(EXT,AP);
+}
+
+// indicate supported PSK mode
+void addPSKModesExt(octad *EXT,int mode)
+{
+    OCT_append_int(EXT,PSK_MODE,2);
+    OCT_append_int(EXT,2,2);
+    OCT_append_int(EXT,1,1);
+    OCT_append_int(EXT,mode,1);
+}
+
+// indicate preferred maximum fragment length
+void addMFLExt(octad *EXT,int mode)
+{
+    if (mode>0)
+    {
+        OCT_append_int(EXT,MAX_FRAG_LENGTH,2);
+        OCT_append_int(EXT,1,2);
+        OCT_append_int(EXT,mode,1);
+    }
+}
+
+// indicate preferred maximum record size
+void addRSLExt(octad *EXT,int size)
+{
+    OCT_append_int(EXT,RECORD_SIZE_LIMIT,2);
+    OCT_append_int(EXT,2,2);
+    OCT_append_int(EXT,size,2);
+}
+
+// add n padding bytes
+void addPadding(octad *EXT,int n)
+{
+    OCT_append_int(EXT,PADDING,2);
+    OCT_append_int(EXT,n,2);
+    OCT_append_byte(EXT,0,n);
+}
+
+// indicate TLS version support
+void addVersionExt(octad *EXT,int version)
+{
+    OCT_append_int(EXT,TLS_VER,2);
+    OCT_append_int(EXT,3,2);
+    OCT_append_int(EXT,2,1);
+    OCT_append_int(EXT,version,2);
+}
+
+// Add a cookie - useful for handshake resumption
+void addCookieExt(octad *EXT,octad *CK)
+{
+    OCT_append_int(EXT,COOKIE,2);
+    OCT_append_int(EXT,CK->len,2);
+    OCT_append_octad(EXT,CK);
+}
+
+// indicate desire to send early data
+void addEarlyDataExt(octad *EXT)
+{
+    OCT_append_int(EXT,EARLY_DATA,2);
+    OCT_append_int(EXT,0,2);
+}
+
+// indicate willingness to do post handshake authentication
+void addPostHSAuth(octad *EXT)
+{
+    OCT_append_int(EXT,POST_HANDSHAKE_AUTH,2);
+    OCT_append_int(EXT,0,2);
+}
+
+// build cipher-suites octad from ciphers we support
+int cipherSuites(octad *CS,int ncs,int *ciphers)
+{
+    OCT_kill(CS);
+    OCT_append_int(CS,2*ncs,2);
+    for (int i=0;i<ncs;i++)
+        OCT_append_int(CS,ciphers[i],2);
+    return CS->len;
+}
+
+void sendZeroRecord(TLS_session *session) {
+    char rh[5];
+    char tag[TLS_MAX_TAG_SIZE];
+    octad TAG={0,sizeof(tag),tag};
+    int taglen=session->K_send.taglen;
+    int ctlen=TLS_MAX_OUTPUT_RECORD_SIZE+1;
+    int reclen=ctlen+taglen;
+    rh[0]=APPLICATION;
+    rh[1]=(TLS1_2/256);
+    rh[2]=(TLS1_2%256);
+    rh[3]=(reclen/256);
+    rh[4]=(reclen%256);
+
+    session->OBUFF.val[5]=APPLICATION;
+    session->OBUFF.len=ctlen+5;
+
+    SAL_aeadEncrypt(&session->K_send,5,rh,ctlen,&session->OBUFF.val[5],&TAG);
+    incrementCryptoContext(&session->K_send);  // increment IV
+    OCT_append_octad(&session->OBUFF,&TAG);
+
+    for (int j=0;j<5;j++)
+        session->OBUFF.val[j]=rh[j];
+
+    sendOctad(session->sockptr,&session->OBUFF); // transmit it
+    OCT_kill(&session->OBUFF); // empty it
+    session->OBUFF.len=5;
+}
+
+// send one or more records, maybe encrypted.
+void sendRecord(TLS_session *session,int rectype,int version,octad *DATA,bool flush) {
+    char rh[5];
+    int alen;
+    if (session->OBUFF.len==0)
+    { // first time - reserve 5 spaces for header
+        session->OBUFF.len=5;
+        alen=0;
+    } else {
+        alen=session->OBUFF.len-5; // payload length
+    }
+
+    for (int i=0;i<DATA->len;i++) {
+        OCT_append_byte(&session->OBUFF,DATA->val[i],1); alen++;
+        bool flushing=false;
+        if (i==DATA->len-1 && flush) flushing=true;;
+        if (alen==TLS_MAX_OUTPUT_RECORD_SIZE || flushing)
+        {
+            int reclen,ctlen;
+            if (!session->K_send.active) { // no encryption
+                reclen=alen;
+                rh[0]=rectype;
+                rh[1]=(version/256);
+                rh[2]=(version%256);
+                rh[3]=(reclen/256);
+                rh[4]=(reclen%256);
+            } else {
+                char tag[TLS_MAX_TAG_SIZE];
+                octad TAG={0,sizeof(tag),tag};
+                int taglen=session->K_send.taglen;
+                OCT_append_byte(&session->OBUFF,rectype,1); 
+#ifdef PAD_SHORT_RECORDS
+                ctlen=TLS_MAX_OUTPUT_RECORD_SIZE+1; // pad to full length - should be padded with 0s
+                session->OBUFF.len=ctlen+5;
+#else
+                ctlen=alen+1; 
+#endif
+                reclen=ctlen+taglen;
+                rh[0]=APPLICATION;
+                rh[1]=(TLS1_2/256);
+                rh[2]=(TLS1_2%256);
+                rh[3]=(reclen/256);
+                rh[4]=(reclen%256);
+
+                SAL_aeadEncrypt(&session->K_send,5,rh,ctlen,&session->OBUFF.val[5],&TAG);
+                incrementCryptoContext(&session->K_send);  // increment IV
+                OCT_append_octad(&session->OBUFF,&TAG);
+            }
+            for (int j=0;j<5;j++)
+                session->OBUFF.val[j]=rh[j];
+
+            sendOctad(session->sockptr,&session->OBUFF); // transmit it
+            OCT_kill(&session->OBUFF); // empty it
+            alen=0;
+            session->OBUFF.len=5;
+        }
+        if (flushing) session->OBUFF.len=0;
+    }
+} 
+
+
+// ALL Client to Server output goes via this function 
+// Send a client message CM|EXT (as a single record). 
+// Only transmit (flush) on a key change, or end of pass
+void sendClientMessage(TLS_session *session,int rectype,int version,octad *CM,octad *EXT,bool flush)
+{
+    if (session->status==TLS13_DISCONNECTED) {
+        return;
+    }
+
+    bool choice=flush;
+#ifndef MERGE_MESSAGES
+    choice=true;
+#endif
+    if (EXT!=NULL)
+    {
+        sendRecord(session,rectype,version,CM,false);
+        sendRecord(session,rectype,version,EXT,choice);
+    } else {
+        sendRecord(session,rectype,version,CM,choice);
+    } 
+}
+
+// Send a heartbeat request record. Note my payloads are always of length 0.
+// should it be encrypted? Yes
+void sendHeartbeatRequest(TLS_session *session)
+{
+    char hb[20];
+    octad HB={0,sizeof(hb),hb};
+    if (session->status==TLS13_DISCONNECTED || !session->allowed_to_heartbeat || session->heartbeat_req_in_flight) {
+        return;
+    }
+//printf("Sending HEART_BEAT REQ\n");
+    OCT_append_int(&HB,1,1); // heartbeat request
+    OCT_append_int(&HB,0,2); // zero payload
+    for (int i=0;i<16;i++)
+        OCT_append_int(&HB,SAL_randomByte(),1);
+    session->heartbeat_req_in_flight=true;
+    sendRecord(session,HEART_BEAT,TLS1_2,&HB,true);
+}
+
+
+// build and transmit unencrypted client hello. Append pre-prepared extensions
+void sendClientHello(TLS_session *session,int version,octad *CH,octad *CRN,bool already_agreed,octad *EXTENSIONS,int extra,bool resume,bool flush)
+{
+    char cs[2+TLS_MAX_CIPHER_SUITES*2];
+    octad CS = {0, sizeof(cs), cs};
+    int nsc;
+    int ciphers[TLS_MAX_CIPHER_SUITES];
+    int compressionMethods=0x0100;
+    int total=8;
+    int extlen=EXTENSIONS->len+extra;
+
+    nsc=SAL_ciphers(ciphers);  
+    if (already_agreed)
+    { // cipher suite already agreed
+        nsc=1;
+        ciphers[0]=session->cipher_suite;
+    }
+
+    total+=32; // Random bytes clientRandom(&RN);
+    total+=33;
+    if (!resume) { // if its a handshake resumption, re-use the old id?? Since its the same session?
+        for (int i=0;i<32;i++)
+            session->id[i]=SAL_randomByte();
+    }
+ 
+    total+=cipherSuites(&CS,nsc,ciphers);
+
+    OCT_kill(CH);
+    OCT_append_byte(CH,CLIENT_HELLO,1);        // clientHello handshake message  // 1
+    OCT_append_int(CH,total+extlen-2,3);    // 3
+
+    OCT_append_int(CH,TLS1_2,2);            // 2
+    OCT_append_octad(CH,CRN);                // 32
+    OCT_append_byte(CH,32,1);                // 1   
+    OCT_append_bytes(CH,session->id,32);    // 32
+    OCT_append_octad(CH,&CS);                // 2+TLS_MAX_CIPHER_SUITES*2
+    OCT_append_int(CH,compressionMethods,2);  // 2
+    OCT_append_int(CH,extlen,2);              // 2
+
+// transmit it
+    sendClientMessage(session,HSHAKE,version,CH,EXTENSIONS,flush);
+}
+
+// Send "binder",
+void sendBinder(TLS_session *session,octad *BND)
+{
+    char b[TLS_MAX_HASH+3];
+    octad B={0,sizeof(b),b};
+    int tlen2=BND->len+1;
+    //OCT_kill(B);
+    OCT_append_int(&B,tlen2,2);
+    OCT_append_int(&B,BND->len,1);
+    OCT_append_octad(&B,BND);
+    runningHash(session,&B);
+    sendClientMessage(session,HSHAKE,TLS1_2,&B,NULL,true);
+}
+
+// send client alert - might be encrypted if send!=NULL
+void sendAlert(TLS_session *session,int type)
+{
+    char pt[2];
+    octad PT={0,sizeof(pt),pt};
+    OCT_append_byte(&PT,0x02,1);  // alerts are always fatal
+    OCT_append_byte(&PT,type,1);  // alert type
+    OCT_kill(&session->IBUFF); session->ptr=0;
+    sendClientMessage(session,ALERT,TLS1_2,&PT,NULL,true);
+    if (session->status!=TLS13_DISCONNECTED)
+    {
+        log(IO_PROTOCOL,(char *)"Alert sent to Server - ",NULL,0,NULL);
+        logAlert(type);
+    }
+    session->status=TLS13_DISCONNECTED; // write side of connection is now off
+}
+
+void sendKeyUpdate(TLS_session *session,int type)
+{
+    char up[5];
+    octad UP={0,sizeof(up),up};
+    OCT_append_byte(&UP,KEY_UPDATE,1);
+    OCT_append_int(&UP,1,3);
+    OCT_append_int(&UP,type,1);
+    OCT_kill(&session->IBUFF); session->ptr=0;
+    sendClientMessage(session,HSHAKE,TLS1_2,&UP,NULL,true); // sent using old keys
+    deriveUpdatedKeys(&session->K_send,&session->CTS);        // now update keys
+    log(IO_PROTOCOL,(char *)"KEY UPDATE REQUESTED\n",NULL,0,NULL);
+}
+
+// Send final client handshake verification data
+void sendClientFinish(TLS_session *session,octad *CHF)
+{
+    char pt[4];
+    octad PT={0,sizeof(pt),pt};
+
+    OCT_append_byte(&PT,FINISHED,1);    // indicates handshake message "client finished" 
+    OCT_append_int(&PT,CHF->len,3);        // .. and its length 
+
+    runningHash(session,&PT);
+    runningHash(session,CHF);
+    sendClientMessage(session,HSHAKE,TLS1_2,&PT,CHF,true); // now we can flush
+}
+
+/* Send Client Cert Verify */
+void sendClientCertVerify(TLS_session *session, int sigAlg, octad *CCVSIG)
+{
+    char pt[10];
+    octad PT={0,sizeof(pt),pt};
+    OCT_append_byte(&PT,CERT_VERIFY,1);
+    OCT_append_int(&PT,4+CCVSIG->len,3);
+    OCT_append_int(&PT,sigAlg,2);
+    OCT_append_int(&PT,CCVSIG->len,2);
+    runningHash(session,&PT);
+    runningHash(session,CCVSIG);
+    sendClientMessage(session,HSHAKE,TLS1_2,&PT,CCVSIG,false);
+}
+
+// Send Client Certificate 
+void sendClientCertificateChain(TLS_session *session,octad *CERTCHAIN)
+{
+    char pt[50];
+    octad PT={0,sizeof(pt),pt};
+
+    OCT_append_byte(&PT,CERTIFICATE,1);
+    if (CERTCHAIN==NULL) {  // no acceptable certificate available
+        OCT_append_int(&PT,4,3);
+        int nb=session->CTX.len;
+        OCT_append_byte(&PT,nb,1); // cert context
+        if (nb>0)
+            OCT_append_octad(&PT,&session->CTX);
+        OCT_append_int(&PT,0,3);  // zero length
+        runningHash(session,&PT);
+        sendClientMessage(session,HSHAKE,TLS1_2,&PT,NULL,true);
+    } else {
+        OCT_append_int(&PT,4+CERTCHAIN->len,3);
+        int nb=session->CTX.len;
+        OCT_append_byte(&PT,nb,1); // cert context
+        if (nb>0)
+            OCT_append_octad(&PT,&session->CTX);
+        OCT_append_int(&PT,CERTCHAIN->len,3);  // length of certificate chain
+        runningHash(session,&PT);
+        runningHash(session,CERTCHAIN);
+        sendClientMessage(session,HSHAKE,TLS1_2,&PT,CERTCHAIN,false);
+       
+    }
+} 
+
+// if early data was accepted, send this to indicate early data is finished
+void sendEndOfEarlyData(TLS_session *session)
+{
+    char ed[4];
+    octad ED={0,sizeof(ed),ed};
+    OCT_append_byte(&ED,END_OF_EARLY_DATA,1);
+    OCT_append_int(&ED,0,3);
+    runningHash(session,&ED);
+    sendClientMessage(session,HSHAKE,TLS1_2,&ED,NULL,true); // change of encryption keys coming, so flush
+}
+
+//
+// map causes to alerts
+//
+int alert_from_cause(int rtn)
+{
+    switch (rtn)
+    {
+    case NOT_TLS1_3:
+        return ILLEGAL_PARAMETER;
+    case ID_MISMATCH:
+        return ILLEGAL_PARAMETER;
+    case UNRECOGNIZED_EXT:
+        return ILLEGAL_PARAMETER;
+    case BAD_HELLO:
+        return ILLEGAL_PARAMETER;        
+    case WRONG_MESSAGE:                 // Cause
+        return UNEXPECTED_MESSAGE;      // Alert
+    case BAD_CERT_CHAIN:                // Cause
+        return BAD_CERTIFICATE;         // Alert
+    case MISSING_REQUEST_CONTEXT:
+        return ILLEGAL_PARAMETER;
+    case AUTHENTICATION_FAILURE:
+        return BAD_RECORD_MAC;
+    case BAD_RECORD:
+        return DECODE_ERROR;
+    case BAD_TICKET:
+        return ILLEGAL_PARAMETER;
+    case NOT_EXPECTED:
+        return UNSUPPORTED_EXTENSION;
+    case CA_NOT_FOUND:
+        return UNKNOWN_CA;
+    case CERT_OUTOFDATE:
+        return CERTIFICATE_EXPIRED;
+    case MEM_OVERFLOW:
+        return DECODE_ERROR;
+    case FORBIDDEN_EXTENSION:
+        return ILLEGAL_PARAMETER;
+    case MAX_EXCEEDED:
+        return RECORD_OVERFLOW;
+    case CERT_VERIFY_FAIL:
+        return DECRYPT_ERROR;
+    case BAD_HANDSHAKE:
+        return HANDSHAKE_FAILURE;
+    case BAD_REQUEST_UPDATE:
+        return ILLEGAL_PARAMETER;
+    case MISSING_EXTENSIONS:
+        return MISSING_EXTENSION;
+    case BAD_MESSAGE:
+    case EMPTY_CERT_CHAIN:
+        return DECODE_ERROR;
+    default:
+        return ILLEGAL_PARAMETER;    
+    }
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/lib/tls_keys_calc.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/lib/tls_keys_calc.cpp
new file mode 100644
index 0000000..df3b678
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/lib/tls_keys_calc.cpp
@@ -0,0 +1,443 @@
+//
+// TLS1.3 crypto support functions (hashing, KDFs etc)
+//
+
+#include "tls_keys_calc.h"
+#include "tls_logger.h"
+#include "tls_x509.h"
+
+// Initialise transcript hash
+void initTranscriptHash(TLS_session *session)
+{
+    int hashtype=SAL_hashType(session->cipher_suite);
+    SAL_hashInit(hashtype,&session->tlshash);
+}
+
+// Add octad to transcript hash 
+void runningHash(TLS_session *session,octad *O)
+{
+    SAL_hashProcessArray(&session->tlshash,O->val,O->len);
+}
+
+// Add IO buffer to transcript hash
+void runningHashIO(TLS_session *session)
+{
+    SAL_hashProcessArray(&session->tlshash,session->IBUFF.val,session->ptr);
+}
+
+// Shift octad left - rewind IO buffer to start 
+void rewindIO(TLS_session *session)
+{
+    OCT_shift_left(&session->IBUFF,session->ptr);  
+    session->ptr=0;
+}
+
+void runningHashIOrewind(TLS_session *session)
+{
+    runningHashIO(session);
+    rewindIO(session);
+}
+
+// Output transcript hash 
+void transcriptHash(TLS_session *session,octad *O)
+{
+    O->len=SAL_hashOutput(&session->tlshash,O->val); 
+}
+
+// special case handling for first clientHello after retry request
+void runningSyntheticHash(TLS_session *session,octad *O,octad *E)
+{
+    int htype=session->tlshash.htype; 
+    unihash rhash;
+    char hh[TLS_MAX_HASH];
+    octad HH={0,sizeof(hh),hh};
+
+    SAL_hashInit(htype,&rhash); 
+ // RFC 8446 - "special synthetic message"
+    SAL_hashProcessArray(&rhash,O->val,O->len);
+    SAL_hashProcessArray(&rhash,E->val,E->len);
+    HH.len=SAL_hashOutput(&rhash,HH.val);
+    
+    char t[4];
+    t[0]=MESSAGE_HASH;
+    t[1]=t[2]=0;
+    t[3]=SAL_hashLen(htype);
+    SAL_hashProcessArray(&session->tlshash,t,4);
+    
+    runningHash(session,&HH);
+}
+
+// Initialise crypto context (Key,IV, Record number)
+void initCryptoContext(crypto *C)
+{
+    C->active=false;
+
+    C->K.len = 0;
+    C->K.max = TLS_MAX_KEY;
+    C->K.val = C->k;
+
+    C->IV.len = 0;
+    C->IV.max = 12;
+    C->IV.val = C->iv;
+
+    C->suite=TLS_AES_128_GCM_SHA256; // default
+    C->record=0;
+    C->taglen=16;  // default
+}
+
+// Fill a crypto context with new key/IV
+void updateCryptoContext(crypto *C,octad *K,octad *IV)
+{ 
+    C->active=true;
+    OCT_copy(&(C->K),K);
+    OCT_copy(&(C->IV),IV);
+    C->record=0;
+}
+
+//  increment record, and update IV
+void incrementCryptoContext(crypto *C)
+{ 
+    unsigned char b[4];  
+    b[3] = (unsigned char)(C->record);
+    b[2] = (unsigned char)(C->record >> 8);
+    b[1] = (unsigned char)(C->record >> 16);
+    b[0] = (unsigned char)(C->record >> 24);
+    for (int i=0;i<4;i++)
+        C->IV.val[8+i]^=b[i];  // revert to original IV
+    C->record++;
+    b[3] = (unsigned char)(C->record);
+    b[2] = (unsigned char)(C->record >> 8);
+    b[1] = (unsigned char)(C->record >> 16);
+    b[0] = (unsigned char)(C->record >> 24);
+    for (int i=0;i<4;i++)
+        C->IV.val[8+i]^=b[i];  // advance to new IV
+}
+
+// create expanded HKDF label LB from label and context
+static void hkdfLabel(octad *LB,int length,octad *Label,octad *CTX)
+{
+    OCT_append_int(LB,length,2);                    // 2
+    OCT_append_byte(LB,(char)(6+Label->len),1);        // 1
+    OCT_append_string(LB,(char *)"tls13 ");            // 6
+    OCT_append_octad(LB,Label);                        // Label->len
+    if (CTX!=NULL)
+    {
+        OCT_append_byte(LB, (char)(CTX->len), 1);    // 1
+        OCT_append_octad(LB,CTX);                    // CTX->len
+    } else {
+        OCT_append_byte(LB,0,1);                    // 1
+    }
+}
+
+// HKDF extension for TLS1.3
+static void hkdfExpandLabel(int htype,octad *OKM,int olen,octad *PRK,octad *Label,octad *CTX)
+{
+    char hl[TLS_MAX_HASH+24];
+    octad HL={0,sizeof(hl),hl};
+    hkdfLabel(&HL,olen,Label,CTX);
+    SAL_hkdfExpand(htype,olen,OKM,PRK,&HL);
+}
+
+// create verification data
+void deriveVeriferData(int htype,octad *CF,octad *CHTS,octad *H)
+{
+    char fk[TLS_MAX_HASH];
+    octad FK = {0,sizeof(fk),fk};
+    char info[10];
+    octad INFO = {0,sizeof(info),info};
+    int hlen=SAL_hashLen(htype);
+    OCT_kill(&INFO);
+    OCT_append_string(&INFO,(char *)"finished");
+    hkdfExpandLabel(htype,&FK,hlen,CHTS,&INFO,NULL); 
+    SAL_hmac(htype,CF,&FK,H);
+}
+
+// check verification data
+bool checkVeriferData(int htype,octad *SF,octad *SHTS,octad *H)
+{
+    char vd[TLS_MAX_HASH];
+    octad VD = {0,sizeof(vd),vd};
+    deriveVeriferData(htype,&VD,SHTS,H);
+    return OCT_compare(SF,&VD);
+}
+
+// update Traffic secret and associated traffic key and IV
+void deriveUpdatedKeys(crypto *context,octad *TS)
+{
+    int htype,sha,key;
+    char info[16];
+    octad INFO = {0,sizeof(info),info};
+    char nts[TLS_MAX_HASH];
+    octad NTS={0,sizeof(nts),nts};
+
+// find cipher suite
+    htype=SAL_hashType(context->suite);
+    sha=SAL_hashLen(htype);
+
+    key=SAL_aeadKeylen(context->suite); // depends on key length
+
+    OCT_kill(&INFO);
+    OCT_append_string(&INFO,(char *)"traffic upd");
+    hkdfExpandLabel(htype,&NTS,sha,TS,&INFO,NULL);
+
+    OCT_copy(TS,&NTS);
+
+    OCT_kill(&INFO);
+    OCT_append_string(&INFO,(char *)"key");
+    hkdfExpandLabel(htype,&(context->K),key,TS,&INFO,NULL);
+
+    OCT_kill(&INFO);
+    OCT_append_string(&INFO,(char *)"iv");
+    hkdfExpandLabel(htype,&(context->IV),12,TS,&INFO,NULL);
+// reset record number
+    context->record=0;
+    context->active=true;
+}
+
+// Create a crypto context from an input raw Secret and an agreed cipher_suite 
+void createCryptoContext(int cipher_suite,octad *TS,crypto *context)
+{
+    int key,htype=SAL_hashType(cipher_suite);
+
+    key=SAL_aeadKeylen(cipher_suite);
+
+    char info[8];
+    octad INFO = {0,sizeof(info),info};
+
+    OCT_kill(&INFO);
+    OCT_append_string(&INFO,(char *)"key");
+    hkdfExpandLabel(htype,&(context->K),key,TS,&INFO,NULL);
+
+    OCT_kill(&INFO);
+    OCT_append_string(&INFO,(char *)"iv");
+    hkdfExpandLabel(htype,&(context->IV),12,TS,&INFO,NULL);
+
+    context->active=true;
+    context->suite=cipher_suite;
+    context->record=0;
+    context->taglen=SAL_aeadTaglen(cipher_suite);
+}
+
+void createSendCryptoContext(TLS_session *session,octad *TS)
+{
+    createCryptoContext(session->cipher_suite,TS,&session->K_send);
+}
+
+void createRecvCryptoContext(TLS_session *session,octad *TS)
+{
+    createCryptoContext(session->cipher_suite,TS,&session->K_recv);
+}
+
+// recover Pre-Shared-Key from Resumption Master Secret
+void recoverPSK(TLS_session *session)
+{
+    char info[16];
+    octad INFO = {0,sizeof(info),info};
+    int htype=SAL_hashType(session->cipher_suite);
+    int hlen=SAL_hashLen(htype);
+    OCT_kill(&INFO);
+    OCT_append_string(&INFO,(char *)"resumption");
+    hkdfExpandLabel(htype,&session->T.PSK,hlen,&session->RMS, &INFO, &session->T.NONCE);
+}
+
+// Key Schedule code
+// Get Early Secret ES and optional Binder Key (either External or Resumption)
+void deriveEarlySecrets(int htype,octad *PSK,octad *ES,octad *BKE,octad *BKR)
+{
+    char emh[TLS_MAX_HASH];
+    octad EMH = {0,sizeof(emh),emh};  
+    char zk[TLS_MAX_HASH];              
+    octad ZK = {0,sizeof(zk),zk}; 
+    char info[16];
+    octad INFO = {0,sizeof(info),info};
+
+    int hlen=SAL_hashLen(htype);
+
+    OCT_append_byte(&ZK,0,hlen);    // Zero key
+
+    if (PSK==NULL)
+        OCT_copy(&EMH,&ZK);            // if no PSK available use ZK
+    else
+        OCT_copy(&EMH,PSK);
+
+    SAL_hkdfExtract(htype,ES,&ZK,&EMH);  // hash function, ES is output, ZK is salt and EMH is IKM
+
+    SAL_hashNull(htype,&EMH);        // EMH = hash of ""
+
+    if (BKE!=NULL)
+    {  // External Binder Key
+        OCT_kill(&INFO);
+        OCT_append_string(&INFO,(char *)"ext binder");
+        hkdfExpandLabel(htype,BKE,hlen,ES,&INFO,&EMH);
+    }
+    if (BKR!=NULL)
+    { // Resumption Binder Key
+        OCT_kill(&INFO);
+        OCT_append_string(&INFO,(char *)"res binder");
+        hkdfExpandLabel(htype,BKR,hlen,ES,&INFO,&EMH);
+    }
+}
+
+// Get Later Secrets (Client Early Traffic Secret CETS and Early Exporter Master Secret EEMS) - requires partial transcript hash H
+void deriveLaterSecrets(int htype,octad *ES,octad *H,octad *CETS,octad *EEMS)
+{
+    char info[16];
+    octad INFO = {0,sizeof(info),info};
+    int hlen=SAL_hashLen(htype);
+
+    if (CETS!=NULL)
+    {
+        OCT_kill(&INFO);
+        OCT_append_string(&INFO,(char *)"c e traffic");
+        hkdfExpandLabel(htype,CETS,hlen,ES,&INFO,H);
+    }
+    if (EEMS!=NULL)
+    {
+        OCT_kill(&INFO);
+        OCT_append_string(&INFO,(char *)"e exp master");
+        hkdfExpandLabel(htype,EEMS,hlen,ES,&INFO,H);
+    }
+}
+
+// get Client and Server Handshake secrets for encrypting rest of handshake, from Shared secret SS and early secret ES
+void deriveHandshakeSecrets(TLS_session *session,octad *SS,octad *ES,octad *H)
+{
+    char ds[TLS_MAX_HASH];
+    octad DS = {0,sizeof(ds),ds};       // Derived Secret
+    char emh[TLS_MAX_HASH];
+    octad EMH = {0,sizeof(emh),emh};    // Empty Hash
+    char info[16];
+    octad INFO = {0,sizeof(info),info};
+    int htype=SAL_hashType(session->cipher_suite);
+    int hlen=SAL_hashLen(htype);
+
+    SAL_hashNull(htype,&EMH);            // hash of ""
+
+    OCT_kill(&INFO);
+    OCT_append_string(&INFO,(char *)"derived");
+    hkdfExpandLabel(htype,&DS,hlen,ES,&INFO,&EMH);  
+
+    SAL_hkdfExtract(htype,&session->HS,&DS,SS);
+
+    OCT_kill(&INFO);
+    OCT_append_string(&INFO,(char *)"c hs traffic");
+    hkdfExpandLabel(htype,&session->CTS,hlen,&session->HS,&INFO,H);
+
+    OCT_kill(&INFO);
+    OCT_append_string(&INFO,(char *)"s hs traffic");
+    hkdfExpandLabel(htype,&session->STS,hlen,&session->HS,&INFO,H);
+}
+
+// Extract Client and Server Application Traffic secrets from Transcript Hashes, Handshake secret 
+// SFH - Server Finished Hash
+// CFH - Client Finished Hash
+void deriveApplicationSecrets(TLS_session *session,octad *SFH,octad *CFH,octad *EMS)
+{
+    char ds[TLS_MAX_HASH];
+    octad DS = {0,sizeof(ds),ds};
+    char ms[TLS_MAX_HASH];
+    octad MS = {0,sizeof(ms),ms};
+    char emh[TLS_MAX_HASH];
+    octad EMH = {0,sizeof(emh),emh};
+    char zk[TLS_MAX_HASH];                    // Zero Key
+    octad ZK = {0,sizeof(zk),zk};
+    char info[16];
+    octad INFO = {0,sizeof(info),info};
+    int htype=SAL_hashType(session->cipher_suite);
+    int hlen=SAL_hashLen(htype);
+
+    OCT_append_byte(&ZK,0,hlen);            // 00..00  
+    SAL_hashNull(htype,&EMH);                // hash("")
+
+    OCT_kill(&INFO);
+    OCT_append_string(&INFO,(char *)"derived");
+    hkdfExpandLabel(htype,&DS,hlen,&session->HS,&INFO,&EMH);   // Use handshake secret from above
+
+    SAL_hkdfExtract(htype,&MS,&DS,&ZK);
+
+    OCT_kill(&INFO);
+    OCT_append_string(&INFO,(char *)"c ap traffic");
+    hkdfExpandLabel(htype,&session->CTS,hlen,&MS,&INFO,SFH);
+
+    OCT_kill(&INFO);
+    OCT_append_string(&INFO,(char *)"s ap traffic");
+    hkdfExpandLabel(htype,&session->STS,hlen,&MS,&INFO,SFH);
+
+    if (EMS!=NULL)
+    {
+        OCT_kill(&INFO);
+        OCT_append_string(&INFO,(char *)"exp master");
+        hkdfExpandLabel(htype,EMS,hlen,&MS,&INFO,SFH);
+    }
+
+    OCT_kill(&INFO);
+    OCT_append_string(&INFO,(char *)"res master");
+    hkdfExpandLabel(htype,&session->RMS,hlen,&MS,&INFO,CFH);
+}
+
+// Create Client Cert Verify message, a digital signature using KEY on some TLS1.3 specific message+transcript hash
+void createClientCertVerifier(int sigAlg,octad *H,octad *KEY,octad *CCVSIG)
+{
+    char ccv[100+TLS_MAX_HASH];
+    octad CCV={0,sizeof(ccv),ccv};
+// create TLS1.3 message to be signed
+    OCT_append_byte(&CCV,32,64); // 64 spaces
+    OCT_append_string(&CCV,(char *)"TLS 1.3, client CertificateVerify");  // 33 chars
+    OCT_append_byte(&CCV,0,1);   // add 0 character
+    OCT_append_octad(&CCV,H);    // add Transcript Hash 
+
+    if (sigAlg==DILITHIUM2_P256)
+    {
+        octad FKEY={32,32,KEY->val};
+        octad SKEY={KEY->len-32,KEY->len-32,&KEY->val[32]};
+        SAL_tlsSignature(ECDSA_SECP256R1_SHA384,&FKEY,&CCV,CCVSIG);
+        ecdsa_sig_encode(CCVSIG);  // ASN.1 encode it - it grows
+        octad SSIG={0,TLS_MAX_SIGNATURE_SIZE-32,&CCVSIG->val[CCVSIG->len]};
+        SAL_tlsSignature(DILITHIUM2,&SKEY,&CCV,&SSIG); // append PQ sig
+        CCVSIG->len += SSIG.len;
+        return;
+    }
+
+    SAL_tlsSignature(sigAlg,KEY,&CCV,CCVSIG);
+// adjustment for ECDSA signatures
+    if (sigAlg==ECDSA_SECP256R1_SHA256 || sigAlg==ECDSA_SECP384R1_SHA384)
+    {
+        ecdsa_sig_encode(CCVSIG);
+    }
+    return;
+}
+
+// check that SCVSIG is digital signature (using sigAlg algorithm) of some TLS1.3 specific message+transcript hash, 
+// as verified by Server Certificate public key CERTPK
+bool checkServerCertVerifier(int sigAlg,octad *SCVSIG,octad *H,octad *CERTPK)
+{
+// Server Certificate Verify
+    char scv[100+TLS_MAX_HASH];
+    octad SCV={0,sizeof(scv),scv};
+
+// TLS1.3 message that was signed
+    OCT_append_byte(&SCV,32,64); // 64 spaces
+    OCT_append_string(&SCV,(char *)"TLS 1.3, server CertificateVerify");  // 33 chars
+    OCT_append_byte(&SCV,0,1);   // add 0 character
+    OCT_append_octad(&SCV,H);    // add Transcript Hash 
+
+    if (sigAlg==DILITHIUM2_P256)
+    {
+        octad FPUB={65,65,CERTPK->val};
+        octad SPUB={CERTPK->len-65,CERTPK->len-65,&CERTPK->val[65]};
+        int len=SCVSIG->len;   // full length
+        int index=ecdsa_sig_decode(SCVSIG); // ASN.1 decode it - it shrinks - return undecoded length
+        if (index==0) return false;
+        int mlen=SCVSIG->len;               // modified length
+        octad FSIG={mlen,mlen,SCVSIG->val};
+        octad SSIG={len-index,len-index,&SCVSIG->val[index]};
+        return SAL_tlsSignatureVerify(ECDSA_SECP256R1_SHA384,&SCV,&FSIG,&FPUB) && SAL_tlsSignatureVerify(DILITHIUM2,&SCV,&SSIG,&SPUB);
+    }
+
+// Special case processing required here for ECDSA signatures -  SCVSIG is modified
+    if (sigAlg==ECDSA_SECP256R1_SHA256 || sigAlg==ECDSA_SECP384R1_SHA384) {
+        if (!ecdsa_sig_decode(SCVSIG)) return false;
+    }
+    log(IO_DEBUG,(char *)"Certificate Signature = ",NULL,0,SCVSIG);
+    return SAL_tlsSignatureVerify(sigAlg,&SCV,SCVSIG,CERTPK);
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/lib/tls_logger.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/lib/tls_logger.cpp
new file mode 100644
index 0000000..d7e898d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/lib/tls_logger.cpp
@@ -0,0 +1,627 @@
+/*
+* JS update 14.04.2024
+* Doplneny vypis pre algoritmy ML-KEM a ML-DSA
+*/
+
+/*
+* JS update 29.02.2024
+* Doplnene vypisy pre PQ algoritmy
+* Odstranene funkcie pre ARDUINO
+*/
+
+// 
+// Log protocol progress
+//
+#include "tls_logger.h"
+#include <stdio.h>
+
+
+// all terminal output redirected here
+void myprintf(char *s)
+{
+    printf("%s",s);
+}
+
+// log debug string and info or octad
+// if string is not NULL, output info, with format in string
+// if O is not null, output octad in hex.
+
+void log(int logit,char *preamble,char *string,unsign32 info,octad *O)
+{
+    if (logit>VERBOSITY) return;
+
+#if VERBOSITY>IO_NONE    
+    char w[16];
+    myprintf(preamble);
+
+    if (O!=NULL)
+    {
+        char buff[LOG_OUTPUT_TRUNCATION+8];
+        bool res=OCT_output_hex(O,LOG_OUTPUT_TRUNCATION,buff);
+        sprintf(w,"(%d) ",O->len);
+        myprintf(w);
+        myprintf(buff);
+        if (!res) myprintf((char *)" (truncated)");
+        myprintf((char *)"\n");
+        return;
+    }    
+
+    if (string!=NULL)
+    { // if its bigger than 6 its not a format descriptor ???
+        if (strlen(string)>6)
+            myprintf(string);
+        else
+        {
+            sprintf(w,string,info);
+            myprintf(w);
+        }
+        myprintf((char *)"\n");
+        return;
+    }
+ 
+#endif
+}
+
+static void nameCipherSuite(int cipher_suite)
+{
+    switch (cipher_suite)
+    {
+    case TLS_AES_128_GCM_SHA256:
+        myprintf((char *)"TLS_AES_128_GCM_SHA256\n");
+        break;
+    case TLS_AES_256_GCM_SHA384:
+        myprintf((char *)"TLS_AES_256_GCM_SHA384\n");   
+        break;
+    case TLS_CHACHA20_POLY1305_SHA256:
+        myprintf((char *)"TLS_CHACHA20_POLY1305_SHA256\n");   
+        break;
+    default:
+        myprintf((char *)"Non-standard\n");   
+        break;
+    }
+}
+
+void logCipherSuite(int cipher_suite)
+{
+#if VERBOSITY >= IO_DEBUG
+    log(IO_DEBUG,(char *)"Cipher Suite is ",NULL,0,NULL);
+    nameCipherSuite(cipher_suite);
+#endif
+}
+
+// JS doplnene nazvy PQ algoritmov
+static void nameKeyExchange(int kex)
+{
+#if VERBOSITY >= IO_PROTOCOL
+    switch (kex)
+    {
+    case X25519:
+        myprintf((char *)"X25519\n");
+        break;
+    case SECP256R1:
+        myprintf((char *)"SECP256R1\n");   
+        break;
+    case SECP384R1:
+        myprintf((char *)"SECP384R1\n");   
+        break;
+    case KYBER768:
+        myprintf((char *)"KYBER768\n");
+        break;
+    case KYBER512:
+        myprintf((char *)"KYBER512\n");
+        break;
+    case KYBER1024:
+        myprintf((char *)"KYBER1024\n");
+        break;
+    case MLKEM512:
+        myprintf((char *)"MLKEM512\n");
+        break;
+    case MLKEM768:
+        myprintf((char *)"MLKEM768\n");
+        break;
+    case MLKEM1024:
+        myprintf((char *)"MLKEM1024\n");
+        break;
+    case BIKEL1:
+        myprintf((char *)"BIKEL1\n");
+        break;
+    case BIKEL3:
+        myprintf((char *)"BIKEL3\n");
+        break;
+    case BIKEL5:
+        myprintf((char *)"BIKEL5\n");
+        break;
+    case HQC128:
+        myprintf((char *)"HQC128\n");
+        break;
+    case HQC192:
+        myprintf((char *)"HQC192\n");
+        break;
+    case HQC256:
+        myprintf((char *)"HQC256\n");
+        break;
+    case FRODO640AES:
+        myprintf((char *)"FRODO640AES\n");
+        break;
+    case FRODO640SHAKE:
+        myprintf((char *)"FRODO640SHAKE\n");
+        break;
+    case FRODO976AES:
+        myprintf((char *)"FRODO976AES\n");
+        break;
+    case FRODO976SHAKE:
+        myprintf((char *)"FRODO976SHAKE\n");
+        break;
+    case FRODO1344AES:
+        myprintf((char *)"FRODO1344AES\n");
+        break;
+    case FRODO1344SHAKE:
+        myprintf((char *)"FRODO1344SHAKE\n");
+        break;
+    case HYBRID_KX:
+        myprintf((char *)"KYBER + X25519\n");
+        break;
+    default:
+        myprintf((char *)"Non-standard\n");   
+        break;
+    }
+#endif
+}
+
+void logKeyExchange(int kex)
+{
+    log(IO_PROTOCOL,(char *)"Key Exchange Group is ",NULL,0,NULL);
+    nameKeyExchange(kex);
+}
+
+// JS doplnene nazvy PQ algoritmov
+static void nameSigAlg(int sigAlg)
+{
+#if VERBOSITY >= IO_PROTOCOL
+    switch (sigAlg)
+    {
+    case ECDSA_SECP256R1_SHA256:
+        myprintf((char *)"ECDSA_SECP256R1_SHA256\n");
+        break;
+    case RSA_PSS_RSAE_SHA256:
+        myprintf((char *)"RSA_PSS_RSAE_SHA256\n");   
+        break;
+    case RSA_PKCS1_SHA256:
+        myprintf((char *)"RSA_PKCS1_SHA256\n");   
+        break;
+    case ECDSA_SECP384R1_SHA384:
+        myprintf((char *)"ECDSA_SECP384R1_SHA384\n");
+        break;
+    case RSA_PSS_RSAE_SHA384:
+        myprintf((char *)"RSA_PSS_RSAE_SHA384\n");   
+        break;
+    case RSA_PKCS1_SHA384:
+        myprintf((char *)"RSA_PKCS1_SHA384\n");   
+        break;
+    case RSA_PSS_RSAE_SHA512:
+        myprintf((char *)"RSA_PSS_RSAE_SHA512\n");   
+        break;
+    case RSA_PKCS1_SHA512:
+        myprintf((char *)"RSA_PKCS1_SHA512\n");   
+        break;
+    case ED25519:
+        myprintf((char *)"ED25519\n");   
+        break;
+//------------------------------------------------
+    case DILITHIUM2:
+        myprintf((char *)"DILITHIUM2\n");   
+        break;
+    case DILITHIUM3:
+        myprintf((char *)"DILITHIUM3\n");   
+        break;
+    case DILITHIUM5:
+        myprintf((char *)"DILITHIUM5\n");   
+        break;
+    case MLDSA44:
+        myprintf((char *)"MLDSA44\n");   
+        break;
+    case MLDSA65:
+        myprintf((char *)"MLDSA65\n");   
+        break;
+    case MLDSA87:
+        myprintf((char *)"MLDSA87\n");   
+        break;
+    case FALCON512:
+        myprintf((char *)"FALCON512\n");   
+        break;
+    case FALCON1024:
+        myprintf((char *)"FALCON1024\n");   
+        break;
+    case SPHINCSSHA2128FSIMPLE:
+        myprintf((char *)"SPHINCS_SHA2_128F_SIMPLE\n");   
+        break;
+    case SPHINCSSHA2128SSIMPLE:
+        myprintf((char *)"SPHINCS_SHA2_128S_SIMPLE\n");   
+        break;
+    case SPHINCSSHAKE128FSIMPLE:
+        myprintf((char *)"SPHINCS_SHAKE_128F_SIMPLE\n");   
+        break;
+//------------------------------------------------
+    case DILITHIUM2_P256:
+        myprintf((char *)"DILITHIUM2 + P256\n");   
+        break;
+    default:
+        myprintf((char *)"Non-standard\n");   
+        break;
+    }
+#endif
+}
+
+void logSigAlg(int sigAlg)
+{
+    log(IO_PROTOCOL,(char *)"Signature Algorithm is ",NULL,0,NULL);
+    nameSigAlg(sigAlg);
+}
+
+// log Encrypted Extensions Responses
+void logEncExt(ee_status *expected,ee_status *received)
+{
+#if VERBOSITY >= IO_PROTOCOL
+    if (expected->early_data)
+    {
+        if (received->early_data)
+        {
+            log(IO_PROTOCOL,(char *)"Early Data Accepted\n",NULL,0,NULL);
+        } else {
+            log(IO_PROTOCOL,(char *)"Early Data was NOT Accepted\n",NULL,0,NULL);
+        }
+    }
+#endif
+#if VERBOSITY >= IO_DEBUG
+    if (expected->alpn)
+    {
+        if (received->alpn)
+        {
+             log(IO_DEBUG,(char *)"ALPN extension acknowledged by server\n",NULL,0,NULL);
+        
+        } else {
+            log(IO_DEBUG,(char *)"Warning - ALPN extension NOT acknowledged by server\n",NULL,0,NULL);
+        }
+    }
+
+    if (expected->server_name)
+    {
+        if (received->server_name)
+        {
+            log(IO_DEBUG,(char *)"Server Name acknowledged\n",NULL,0,NULL);
+        } else {
+            log(IO_DEBUG,(char *)"Server Name NOT acknowledged\n",NULL,0,NULL);
+        }
+    }
+    if (expected->max_frag_length)
+    {
+        if (received->max_frag_length)
+        {
+            log(IO_DEBUG,(char *)"Max frag length request acknowledged\n",NULL,0,NULL);
+        } else {
+            log(IO_DEBUG,(char *)"Max frag length request NOT acknowledged\n",NULL,0,NULL);
+        }
+    }
+#endif
+}
+
+// log server hello outputs
+void logServerHello(int cipher_suite,int pskid,octad *PK,octad *CK)
+{
+#if VERBOSITY >= IO_DEBUG
+    log(IO_DEBUG,(char *)"Parsing serverHello\n",NULL,0,NULL);
+    logCipherSuite(cipher_suite);
+    if (pskid>=0) log(IO_DEBUG,(char *)"PSK Identity= ",(char *)"%d",pskid,NULL);
+    if (PK->len>0) {
+        log(IO_DEBUG,(char *)"Server Public Key= ",NULL,0,PK);//OCT_output(PK);
+    }
+    if (CK->len>0) {
+        log(IO_DEBUG,(char *)"Cookie= ",NULL,0,CK); //OCT_output(CK);
+    }
+    log(IO_DEBUG,(char *)"\n",NULL,0,NULL);
+#endif
+}
+
+// log ticket details
+void logTicket(ticket *T)
+{
+#if VERBOSITY >= IO_DEBUG
+    log(IO_DEBUG,(char *)"\nParsing Ticket\n",NULL,0,NULL);
+    log(IO_DEBUG,(char *)"Ticket = ",NULL,0,&T->TICK); 
+    unsign32 minutes=T->lifetime/60;
+    log(IO_DEBUG,(char *)"life time in minutes = ",(char *)"%d",minutes,NULL);
+    log(IO_DEBUG,(char *)"PSK = ",NULL,0,&T->PSK); 
+    log(IO_DEBUG,(char *)"max_early_data = ",(char *)"%d",T->max_early_data,NULL);
+    log(IO_DEBUG,(char *)"\n",NULL,0,NULL);
+#endif
+}
+
+// log a certificate in base64
+
+void logCert(octad *CERT)
+{
+    char b[5004];
+    log(IO_DEBUG,(char *)"-----BEGIN CERTIFICATE----- \n",NULL,0,NULL);
+#if VERBOSITY >= IO_DEBUG
+    OCT_output_base64(CERT,5000,b);
+#endif
+    log(IO_DEBUG,(char *)"",b,0,NULL);
+    log(IO_DEBUG,(char *)"-----END CERTIFICATE----- \n",NULL,0,NULL);
+}
+
+// Construct Distinguished Name from DER encoding
+static int make_dn(octad *DN,octad *DER) {
+    int i,c,len,n=0;
+    DN->val[n++]='{';
+    c=X509_find_entity_property(DER,&X509_MN,0,&len);
+    for (i=0;i<len;i++) {
+        DN->val[n++]=DER->val[c+i];
+    }
+
+    DN->val[n++]=',';
+    c=X509_find_entity_property(DER,&X509_UN,0,&len);
+    for (i=0;i<len;i++) {
+        DN->val[n++]=DER->val[c+i];
+    }
+
+    DN->val[n++]=',';
+    c=X509_find_entity_property(DER,&X509_ON,0,&len);
+    for (i=0;i<len;i++) {
+        DN->val[n++]=DER->val[c+i];
+    }
+
+    DN->val[n++]=',';
+    c=X509_find_entity_property(DER,&X509_CN,0,&len);
+    for (i=0;i<len;i++) {
+        DN->val[n++]=DER->val[c+i];
+    }
+    DN->val[n++]='}';
+    DN->val[n++]=0;
+    DN->len=n;
+    return n;
+}
+
+// log certificate details
+void logCertDetails(octad *PUBKEY,pktype pk,octad *SIG,pktype sg,octad *ISSUER,octad *SUBJECT)
+{
+#if VERBOSITY >= IO_DEBUG
+    log(IO_DEBUG,(char *)"Parsing Certificate\n",NULL,0,NULL);
+    log(IO_DEBUG,(char *)"Signature on Certificate is ",NULL,0,SIG); 
+    if (sg.type==X509_ECC)
+    {
+        log(IO_DEBUG,(char *)"ECDSA signature ",NULL,0,NULL);
+        if (sg.curve==USE_NIST256)
+            log(IO_DEBUG,(char *)"Curve is SECP256R1\n",NULL,0,NULL);
+        if (sg.curve==USE_NIST384)
+            log(IO_DEBUG,(char *)"Curve is SECP384R1\n",NULL,0,NULL);
+        if (sg.curve==USE_NIST521)
+            log(IO_DEBUG,(char *)"Curve is SECP521R1\n",NULL,0,NULL);
+        if (sg.hash == X509_H256) log(IO_DEBUG,(char *)"Hashed with SHA256\n",NULL,0,NULL);
+        if (sg.hash == X509_H384) log(IO_DEBUG,(char *)"Hashed with SHA384\n",NULL,0,NULL);
+        if (sg.hash == X509_H512) log(IO_DEBUG,(char *)"Hashed with SHA512\n",NULL,0,NULL);
+    }
+    if (sg.type==X509_ECD)
+    {
+       log(IO_DEBUG,(char *)"EDDSA signature ",NULL,0,NULL);
+        if (sg.curve==USE_ED25519)
+            log(IO_DEBUG,(char *)"Curve is ED25519\n",NULL,0,NULL);
+        if (sg.curve==USE_ED448)
+            log(IO_DEBUG,(char *)"Curve is ED448\n",NULL,0,NULL);
+    }
+    if (sg.type==X509_RSA)
+        log(IO_DEBUG,(char *)"RSA signature of length ",(char *)"%d",sg.curve,NULL);
+
+    log(IO_DEBUG,(char *)"Public key from Certificate is ",NULL,0,PUBKEY); 
+    if (pk.type==X509_ECC)
+    {
+        log(IO_DEBUG,(char *)"ECC public key ",NULL,0,NULL);
+        if (pk.curve==USE_NIST256)
+            log(IO_DEBUG,(char *)"Curve is SECP256R1\n",NULL,0,NULL);
+        if (pk.curve==USE_NIST384)
+            log(IO_DEBUG,(char *)"Curve is SECP384R1\n",NULL,0,NULL);
+        if (pk.curve==USE_NIST521)
+            log(IO_DEBUG,(char *)"Curve is SECP521R1\n",NULL,0,NULL);
+    }
+    if (pk.type==X509_RSA)
+        log(IO_DEBUG,(char *)"Certificate public key is RSA of length ",(char *)"%d",pk.curve,NULL);
+    
+    char dn[256];
+    octad DN={0,sizeof(dn),dn};
+    make_dn(&DN,ISSUER);
+
+    log(IO_DEBUG,(char *)"Issuer is  ",(char *)DN.val,0,NULL);
+    make_dn(&DN,SUBJECT);
+    log(IO_DEBUG,(char *)"Subject is ",(char *)DN.val,0,NULL);
+    //log(IO_DEBUG,(char *)"Issuer is  ",(char *)ISSUER->val,0,NULL);
+    //log(IO_DEBUG,(char *)"Subject is ",(char *)SUBJECT->val,0,NULL);
+#endif
+}
+
+// log alert
+void logAlert(int detail)
+{
+#if VERBOSITY >= IO_PROTOCOL
+    switch (detail)
+    {
+    case 0 :
+        log(IO_PROTOCOL,(char *)"Close notify\n",NULL,0,NULL);
+        break;
+    case 10 :
+        log(IO_PROTOCOL,(char *)"Unexpected Message\n",NULL,0,NULL);
+        break;
+    case 20 :
+        log(IO_PROTOCOL,(char *)"Bad record mac\n",NULL,0,NULL);
+        break;
+    case 22 :
+        log(IO_PROTOCOL,(char *)"Record overflow\n",NULL,0,NULL);
+        break;
+    case 40 :
+        log(IO_PROTOCOL,(char *)"Handshake Failure (not TLS1.3?)\n",NULL,0,NULL);
+        break;
+    case 42 :
+        log(IO_PROTOCOL,(char *)"Bad certificate\n",NULL,0,NULL);
+        break;
+    case 43 :
+        log(IO_PROTOCOL,(char *)"Unsupported certificate\n",NULL,0,NULL);
+        break;
+    case 44 :
+        log(IO_PROTOCOL,(char *)"Certificate revoked\n",NULL,0,NULL);
+        break;
+    case 45 :
+        log(IO_PROTOCOL,(char *)"Certificate expired\n",NULL,0,NULL);
+        break;
+    case 46 :
+        log(IO_PROTOCOL,(char *)"Certificate unknown\n",NULL,0,NULL);
+        break;
+    case 47 :
+        log(IO_PROTOCOL,(char *)"Illegal parameter\n",NULL,0,NULL);
+        break;
+    case 48 :
+        log(IO_PROTOCOL,(char *)"Unknown CA\n",NULL,0,NULL);
+        break;
+    case 49 :
+        log(IO_PROTOCOL,(char *)"Access denied\n",NULL,0,NULL);
+        break;
+    case 50 :
+        log(IO_PROTOCOL,(char *)"Decode error\n",NULL,0,NULL);
+        break;
+    case 51 :
+        log(IO_PROTOCOL,(char *)"Decrypt error\n",NULL,0,NULL);
+        break;
+    case 70 :
+        log(IO_PROTOCOL,(char *)"Protocol version\n",NULL,0,NULL);
+        break;
+    case 71 :
+        log(IO_PROTOCOL,(char *)"Insufficient security\n",NULL,0,NULL);
+        break;
+    case 80 :
+        log(IO_PROTOCOL,(char *)"Internal error\n",NULL,0,NULL);
+        break;
+    case 86 :
+        log(IO_PROTOCOL,(char *)"Inappropriate fallback\n",NULL,0,NULL);
+        break;
+    case 90 :
+        log(IO_PROTOCOL,(char *)"User cancelled\n",NULL,0,NULL);
+        break;
+    case 109 :
+        log(IO_PROTOCOL,(char *)"Missing Extension\n",NULL,0,NULL);
+        break;
+    case 110 :
+        log(IO_PROTOCOL,(char *)"Unsupported Extension\n",NULL,0,NULL);
+        break;
+    case 112 :
+        log(IO_PROTOCOL,(char *)"Unrecognised name\n",NULL,0,NULL);
+        break;
+    case 113 :
+        log(IO_PROTOCOL,(char *)"Bad certificate status response\n",NULL,0,NULL);
+        break;
+    case 115 :
+        log(IO_PROTOCOL,(char *)"Unknown PSK identity \n",NULL,0,NULL);
+        break;
+    case 116 :
+        log(IO_PROTOCOL,(char *)"Certificate required\n",NULL,0,NULL);
+        break;
+    case 120 :
+        log(IO_PROTOCOL,(char *)"No application protocol\n",NULL,0,NULL);
+        break;
+    default:
+        log(IO_PROTOCOL,(char *)"Unrecognised alert\n",NULL,0,NULL);
+        break;
+    }
+#endif
+}
+
+// process server function return
+void logServerResponse(ret r)
+{
+    int rtn=r.err;
+    if (rtn==0) return;
+#if VERBOSITY >= IO_DEBUG
+    if (rtn<0)
+    { // fatal errors - after logging we will send a server alert and close connection
+        switch (rtn)
+        { 
+        case NOT_TLS1_3:
+            log(IO_DEBUG,(char *)"Not TLS1.3\n",NULL,0,NULL);
+            break;
+        case ID_MISMATCH:
+            log(IO_DEBUG,(char *)"Identity Mismatch\n",NULL,0,NULL);
+            break;
+        case UNRECOGNIZED_EXT:
+            log(IO_DEBUG,(char *)"Unrecognised Extension\n",NULL,0,NULL);
+            break;
+        case BAD_HELLO:
+            log(IO_DEBUG,(char *)"Malformed Hello\n",NULL,0,NULL);
+            break;
+        case WRONG_MESSAGE:
+            log(IO_DEBUG,(char *)"Message received out-of-order\n",NULL,0,NULL);
+            break;
+        case BAD_CERT_CHAIN:
+            log(IO_DEBUG,(char *)"Bad Certificate Chain\n",NULL,0,NULL);
+            break;
+        case MISSING_REQUEST_CONTEXT:
+            log(IO_DEBUG,(char *)"Missing Request Context\n",NULL,0,NULL);
+            break;
+        case AUTHENTICATION_FAILURE:
+            log(IO_DEBUG,(char *)"Authentication Failure\n",NULL,0,NULL);
+            break;
+        case BAD_RECORD:
+            log(IO_DEBUG,(char *)"Malformed Record received (max size exceeded?)\n",NULL,0,NULL);
+            break;
+        case BAD_TICKET:
+            log(IO_DEBUG,(char *)"Malformed Ticket received\n",NULL,0,NULL);
+            break;
+        case NOT_EXPECTED:
+            log(IO_DEBUG,(char *)"Unexpected message/extension\n",NULL,0,NULL);
+            break;
+        case CA_NOT_FOUND:
+            log(IO_DEBUG,(char *)"Certificate Authority not found\n",NULL,0,NULL);
+            break;
+        case CERT_OUTOFDATE:
+            log(IO_DEBUG,(char *)"Certificate is out of date\n",NULL,0,NULL);
+            break;
+        case MEM_OVERFLOW:
+            log(IO_DEBUG,(char *)"Memory overflow\n",NULL,0,NULL);
+            break;
+        case FORBIDDEN_EXTENSION:
+            log(IO_DEBUG,(char *)"Forbidden extension found\n",NULL,0,NULL);
+            break;
+        case MAX_EXCEEDED:
+            log(IO_DEBUG,(char *)"Maximum record size exceeded\n",NULL,0,NULL);
+            break;
+        case CERT_VERIFY_FAIL:
+            log(IO_DEBUG,(char *)"Certificate verification failure\n",NULL,0,NULL);
+            break;
+        case BAD_HANDSHAKE:
+            log(IO_DEBUG,(char *)"Handshake protocol failure\n",NULL,0,NULL);
+            break;
+        case BAD_REQUEST_UPDATE:
+            log(IO_DEBUG,(char *)"Bad Key update request\n",NULL,0,NULL);
+            break;
+        case MISSING_EXTENSIONS:
+            log(IO_DEBUG,(char *)"Some extension(s) are missing\n",NULL,0,NULL);
+            break;
+        case BAD_MESSAGE:
+            log(IO_DEBUG,(char *)"Malformed Message received\n",NULL,0,NULL);
+            break;
+        case EMPTY_CERT_CHAIN:
+            log(IO_DEBUG,(char *)"Client Certificate required\n",NULL,0,NULL);
+            break;
+        default:
+            log(IO_DEBUG,(char *)"Unknown Error\n",NULL,0,NULL);
+            break;
+        }
+    } else { // server response requiring client action 
+        switch (rtn)
+        {
+        case TIMED_OUT :
+            log(IO_DEBUG,(char *)"Time Out\n",NULL,0,NULL);
+            break;
+        case ALERT :
+            log(IO_DEBUG,(char *)"Alert received from server\n",NULL,0,NULL);  // received an alert 
+            break;
+        default: break;
+        }
+    }
+#endif
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/lib/tls_octads.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/lib/tls_octads.cpp
new file mode 100644
index 0000000..044b5dc
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/lib/tls_octads.cpp
@@ -0,0 +1,342 @@
+/*
+* JS update 29.02.2024
+* Odstranene funkcie pre ARDUINO
+*/
+
+//
+// Safe octad handling in C
+// octad buffers don't overflow - they truncate
+//
+
+#include "tls_octads.h"
+#include <sys/time.h>
+
+// read milliseconds from a stop-watch
+unsigned long millis()
+{
+    unsigned long milli_time, seconds, useconds;
+    struct timeval stop_watch;
+    gettimeofday(&stop_watch, NULL);
+    seconds=stop_watch.tv_sec;
+    useconds=stop_watch.tv_usec;
+    milli_time=((seconds) * 1000 + useconds/1000);
+    return milli_time;
+}
+
+/* appends integer x of length len bytes to octad */
+void OCT_append_int(octad *y, unsigned int x, int len)
+{
+    int i, n;
+    n = y->len + len;
+    if (n > y->max || len <= 0) 
+    {
+        return;
+    }
+    for (i = y->len; i < n; i++) y->val[i] = 0;
+    y->len = n;
+
+    i = y->len;
+    while (x > 0 && i > 0)
+    {
+        i--;
+        y->val[i] = x % 256;
+        x /= 256;
+    }
+}
+
+/* appends one octad to another */
+void OCT_append_octad(octad *y, octad *x)
+{
+    /* y=y || x */
+    int i, j;
+    if (x == NULL) return;
+
+    for (i = 0; i < x->len; i++)
+    {
+        j = y->len + i;
+        if (j >= y->max)
+        {
+            y->len = y->max;
+            return;
+        }
+        y->val[j] = x->val[i];
+    }
+    y->len += x->len;
+}
+
+/* compare 2 octads
+ * If x==y return TRUE, else return FALSE */
+
+bool OCT_compare(octad *x, octad *y)
+{
+    int i,res=0;
+    if (x->len != y->len) return false;
+    
+    for (i = 0; i < x->len; i++)
+    {
+        res |= (int)(x->val[i] ^ y->val[i]);
+    }
+    if (res==0) return true;
+    return false;
+}
+
+/* Shift octad to the left by n bytes. Leftmost bytes disappear  */
+void OCT_shift_left(octad *x, int n)
+{
+    int i;
+    if (n >= x->len)
+    {
+        x->len = 0;
+        return;
+    }
+    x->len -= n;
+    for (i = 0; i < x->len; i++)
+        x->val[i] = x->val[i + n];
+}
+
+/* Kill an octad string - Zeroise it for security */
+void OCT_kill(octad *w)
+{
+    int i;
+    for (i = 0; i < w->max; i++) w->val[i] = 0;
+    w->len = 0;
+}
+
+static int char2int(char input)
+{
+    if (input >= '0' && input <= '9')
+        return input - '0';
+    if (input >= 'A' && input <= 'F')
+        return input - 'A' + 10;
+    if (input >= 'a' && input <= 'f')
+        return input - 'a' + 10;
+    return 0;
+}
+
+/* Convert to octad from a hex string */
+void OCT_from_hex(octad *dst, char *src)
+{
+    int i = 0;
+    int j = 0;
+    OCT_kill(dst);
+    while (src[j] != 0 && i<dst->max)
+    {
+        dst->val[i++] = char2int(src[j]) * 16 + char2int(src[j + 1]);
+        j += 2;
+    }
+    dst->len = i;
+}
+
+/* Appends C string to an octad - truncates if no room  */
+void OCT_append_string(octad *y, char *s)
+{
+    int i, j;
+    i = y->len;
+    j = 0;
+    while (s[j] != 0 && i < y->max)
+    {
+        y->val[i] = s[j];
+        y->len++;
+        i++;
+        j++;
+    }
+}
+
+/* Append byte to octad rep times */
+void OCT_append_byte(octad *y, int ch, int rep)
+{
+    int i, j;
+    i = y->len;
+    for (j = 0; j < rep && i < y->max; j++)
+    {
+        y->val[i] = ch;
+        y->len++;
+        i++;
+    }
+}
+
+/* Append byte array to octad - truncates if no room */
+void OCT_append_bytes(octad *y, char *b, int len)
+{
+    int i, j;
+    i = y->len;
+    for (j = 0; j < len && i < y->max; j++)
+    {
+        y->val[i] = b[j];
+        y->len++;
+        i++;
+    }
+}
+
+/* Convert to octad from a base64 string */
+void OCT_from_base64(octad *w, char *b)
+{
+    int i, j, k, pads, len;// = (int)strlen(b);
+    int c, ch[4], ptr[3];
+    j = k = 0;
+
+    len=0;
+    while (b[len]!=0) len++;
+
+    while (j < len && k < w->max)
+    {
+        pads = 0;
+        for (i = 0; i < 4; i++)
+        {
+            c = 80 + b[j++];
+            if (c <= 112) continue; /* ignore white space */
+            if (c > 144 && c < 171) c -= 145;
+            if (c > 176 && c < 203) c -= 151;
+            if (c > 127 && c < 138) c -= 76;
+            if (c == 123) c = 62;
+            if (c == 127) c = 63;
+            if (c == 141)
+            {
+                pads++;    /* ignore pads '=' */
+                continue;
+            }
+            ch[i] = c;
+        }
+        ptr[0] = (ch[0] << 2) | (ch[1] >> 4);
+        ptr[1] = (ch[1] << 4) | (ch[2] >> 2);
+        ptr[2] = (ch[2] << 6) | ch[3];
+        for (i = 0; i < 3 - pads && k < w->max; i++)
+        {
+            /* don't put in leading zeros */
+            w->val[k++] = ptr[i];
+        }
+
+    }
+    w->len = k;
+}
+
+/* reverse bytes. Useful if dealing with those unpleasant little-endian people */
+void OCT_reverse(octad *w)
+{
+    int i;
+    unsigned char ch;
+    for (i = 0; i < w->len/2; i++) { 
+        ch = w->val[i]; 
+        w->val[i] = w->val[w->len - i - 1]; 
+        w->val[w->len - i - 1] = ch; 
+    } 
+}
+
+/* copy an octad string - truncates if no room */
+void OCT_copy(octad *y, octad *x)
+{
+    int i;
+    OCT_kill(y);
+    y->len = x->len;
+    if (y->len > y->max) 
+    {
+        y->len = y->max;
+    }
+    for (i = 0; i < y->len; i++)
+        y->val[i] = x->val[i];
+}
+
+// Output octad to a zero-terminated C string, in hex
+// output truncates after max chars, returns false if truncation occurs
+bool OCT_output_hex(octad *O,int max,char *s)
+{
+    int i,j,t,b;
+    bool rtn=true;
+    unsigned char ch;
+    for (i=j=0; i < O->len; i++)
+    {
+        ch = (unsigned char)O->val[i];
+        t=ch>>4;
+        if (t<10)
+            s[j++]='0'+t;
+        else
+            s[j++]='A'+(t-10);
+
+        b=ch&0xF;
+        if (b<10)
+            s[j++]='0'+b;
+        else
+            s[j++]='A'+(b-10);
+
+        if (j>=max)
+        {
+            rtn=false;
+            break;
+        }
+    }
+    s[j]=0;
+    return rtn;
+}
+
+// Output octad to a zero-terminated C string, as an Ascii string
+// output truncates after max chars, returns false if truncation occurs
+bool OCT_output_string(octad *O,int max,char *s)
+{
+    int i,j;
+    bool rtn=true;
+    unsigned char ch;
+    for (i=j=0; i < O->len; i++)
+    {
+        ch = (unsigned char)O->val[i];
+        s[j++]=ch;
+        if (ch==0) return rtn;
+        if (j>=max)
+        {
+            rtn=false;
+            break;
+        }
+    }
+    s[j]=0;
+    return rtn;
+}
+
+void OCT_truncate(octad *O,int n)
+{
+    if (n<O->len)
+        O->len=n;
+}
+
+/* Convert an octad string to base64 string */
+void OCT_output_base64(octad *O,int max,char *b)
+{
+    int i, j, k, rem, last;
+    int c, ch[4];
+    bool rtn=true;
+    unsigned char ptr[3];
+    rem = O->len % 3;
+    j = k = 0;
+    last = 4;
+    while (j < O->len)
+    {
+        for (i = 0; i < 3; i++)
+        {
+            if (j < O->len) ptr[i] = O->val[j++];
+            else
+            {
+                ptr[i] = 0;
+                last--;
+            }
+        }
+        ch[0] = (ptr[0] >> 2) & 0x3f;
+        ch[1] = ((ptr[0] << 4) | (ptr[1] >> 4)) & 0x3f;
+        ch[2] = ((ptr[1] << 2) | (ptr[2] >> 6)) & 0x3f;
+        ch[3] = ptr[2] & 0x3f;
+        for (i = 0; i < last; i++)
+        {
+            c = ch[i];
+            if (c < 26) c += 65;
+            if (c >= 26 && c < 52) c += 71;
+            if (c >= 52 && c < 62) c -= 4;
+            if (c == 62) c = '+';
+            if (c == 63) c = '/';
+            b[k++] = c;
+        }
+        if (k>=max)
+        {
+            rtn=false;
+            break;
+        }
+    }
+    if (k<max && rem>0) for (i = rem; i < 3; i++) b[k++] = '=';
+    b[k] = '\0'; /* dangerous! */
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/lib/tls_protocol.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/lib/tls_protocol.cpp
new file mode 100644
index 0000000..75faef2
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/lib/tls_protocol.cpp
@@ -0,0 +1,1237 @@
+//
+// Main TLS1.3 protocol
+//
+
+#include "tls_protocol.h"
+
+// Initialise TLS 1.3 session state
+TLS_session TLS13_start(Socket *sockptr,char *hostname)
+{
+    TLS_session state;
+    state.sockptr=sockptr;                                  // pointer to socket
+    strcpy(state.hostname,hostname);                        // server to connection with
+
+    state.status=TLS13_DISCONNECTED;
+    state.max_record=0;
+    state.cipher_suite=0;//TLS_AES_128_GCM_SHA256;          // cipher suite
+    initCryptoContext(&state.K_send);                       // Transmission key
+    initCryptoContext(&state.K_recv);                       // Reception key
+
+    state.HS={0,TLS_MAX_HASH,state.rms};                    // handshake secret
+    state.RMS={0,TLS_MAX_HASH,state.rms};                   // Resumption Master secret
+    state.STS={0,TLS_MAX_HASH,state.sts};                   // Server traffic secret
+    state.CTS={0,TLS_MAX_HASH,state.cts};                   // Client traffic secret
+    state.CTX={0,TLS_MAX_HASH,state.ctx};                   // Client traffic secret
+#ifdef SHALLOW_STACK
+    state.IBUFF= {0,TLS_MAX_IBUFF_SIZE,(char *)malloc(TLS_MAX_IBUFF_SIZE)};  // main input buffer
+    state.OBUFF={0,TLS_MAX_OBUFF_SIZE,(char *)malloc(TLS_MAX_OBUFF_SIZE)};  // main input buffer
+#else
+    state.IBUFF={0,TLS_MAX_IBUFF_SIZE,state.ibuff};
+    state.OBUFF={0,TLS_MAX_OBUFF_SIZE,state.obuff};
+#endif
+    state.ptr=0;
+    state.favourite_group=0;                                // default key exchange group
+    state.server_cert_type=X509_CERT;                       // Server Cert type (could be raw public key)
+    state.client_cert_type=X509_CERT;                       // Client Cert type (could be raw public key)
+    initTicketContext(&state.T);                            // Resumption ticket - may be added to session state
+    state.expect_heartbeats=false;                          // not expecting heartbeats
+    state.allowed_to_heartbeat=false;                       // not allowed to heartbeat
+    state.heartbeat_req_in_flight=false;                    // timestamp on outstanding request in flight, else 0
+    return state;
+}
+
+// build client's chosen set of extensions, and assert expectations of server responses
+// The User may want to change the mix of optional extensions
+// mode=0 - full handshake
+// mode=1 - resumption handshake
+// mode=2 = External PSK handshake
+static void buildExtensions(TLS_session *session,octad *EXT,octad *PK,ee_status *expectations,int mode)
+{
+    int groups[TLS_MAX_SUPPORTED_GROUPS];
+    int nsg=SAL_groups(groups);
+    int sigAlgs[TLS_MAX_SUPPORTED_SIGS];
+    int nsa=SAL_sigs(sigAlgs);
+    int sigAlgsCert[TLS_MAX_SUPPORTED_SIGS];
+    int nsac=SAL_sigCerts(sigAlgsCert);
+    char alpn[20];
+    octad ALPN={0,sizeof(alpn),alpn};         // ALPN
+    int tlsVersion=TLS1_3;
+    int pskMode=PSKWECDHE;
+#ifdef TLS_APPLICATION_PROTOCOL
+    OCT_append_string(&ALPN,(char *)TLS_APPLICATION_PROTOCOL);
+#endif
+    if (mode!=0)
+    {  // resumption
+        nsg=1;
+        groups[0]=session->favourite_group; // Only allow the group already agreed
+    }
+    OCT_kill(EXT);
+#ifdef ENABLE_HEARTBEATS
+    addHeartbeat(EXT); // I can heartbeat if you let me
+#endif
+
+// addCertAuthorities(EXT);
+
+    addServerNameExt(EXT,session->hostname); expectations->server_name=true;  // Server Name extension - acknowledgement is expected
+    addSupportedGroupsExt(EXT,nsg,groups);
+    addKeyShareExt(EXT,session->favourite_group,PK); // only sending one public key
+#ifdef TLS_APPLICATION_PROTOCOL
+    addALPNExt(EXT,&ALPN); expectations->alpn=true; // only supporting one application protocol
+#endif
+    addPSKModesExt(EXT,pskMode);
+    addVersionExt(EXT,tlsVersion);
+#ifdef MAX_RECORD
+    addRSLExt(EXT,MAX_RECORD);               // demand a fragment size limit
+#else
+    if (mode!=2)
+    {
+        addMFLExt(EXT,TLS_MAX_FRAG);  expectations->max_frag_length=true; // ask for max fragment length - server may not agree - but no harm in asking
+    }
+#endif
+    addPadding(EXT,SAL_randomByte()%16);  // add some random padding (because I can)
+
+    if (mode==0) // full handshake
+    { // need signature related extensions for full handshake
+        addSigAlgsExt(EXT,nsa,sigAlgs);
+        addSigAlgsCertExt(EXT,nsac,sigAlgsCert);
+#ifdef PREFER_RAW_SERVER_PUBLIC_KEY
+        addServerRawPublicKey(EXT);
+#endif
+#ifdef PREFER_RAW_CLIENT_PUBLIC_KEY
+        addClientRawPublicKey(EXT);
+#endif
+    } 
+    if (mode==2)
+    { // // PSK, but client authentication may still be sought
+#ifdef PREFER_RAW_CLIENT_PUBLIC_KEY
+        addClientRawPublicKey(EXT);
+#endif
+    }
+}
+
+// Phase 1 - Exchange Client/Server "Hellos"
+static int TLS13_exchange_hellos(TLS_session *session)
+{
+    ret rtn;
+    int i,pskid;
+    int kex,hashtype;
+    int nsc,nsg;
+    bool resumption_required=false;
+
+    int ciphers[TLS_MAX_CIPHER_SUITES];
+    nsc=SAL_ciphers(ciphers);  
+    int groups[TLS_MAX_SUPPORTED_GROUPS];
+    nsg=SAL_groups(groups);
+
+#ifdef SHALLOW_STACK
+    octad CSK = {0, TLS_MAX_KEX_SECRET_KEY_SIZE, (char *)malloc(TLS_MAX_KEX_SECRET_KEY_SIZE)};
+    octad CPK = {0, TLS_MAX_KEX_PUB_KEY_SIZE, (char *)malloc(TLS_MAX_KEX_PUB_KEY_SIZE)}; 
+    octad SPK = {0, TLS_MAX_KEX_CIPHERTEXT_SIZE, (char *)malloc(TLS_MAX_KEX_CIPHERTEXT_SIZE)};   
+    octad EXT = {0, TLS_MAX_EXTENSIONS, (char *)malloc(TLS_MAX_EXTENSIONS)};
+#else
+    char csk[TLS_MAX_KEX_SECRET_KEY_SIZE];   // clients key exchange secret key
+    octad CSK = {0, sizeof(csk), csk};
+    char cpk[TLS_MAX_KEX_PUB_KEY_SIZE];      // Client key exchange Public Key (shared memory)
+    octad CPK = {0, sizeof(cpk), cpk}; 
+    char spk[TLS_MAX_KEX_CIPHERTEXT_SIZE];
+    octad SPK = {0, sizeof(spk), spk};       // Server's key exchange Public Key/Ciphertext
+    char ext[TLS_MAX_EXTENSIONS];
+    octad EXT={0,sizeof(ext),ext};           // Extensions   
+#endif
+    char ss[TLS_MAX_SHARED_SECRET_SIZE];     // key exchange Shared Secret 
+    octad SS = {0, sizeof(ss), ss};    
+    char ch[TLS_MAX_HELLO];              // Client Hello
+    octad CH = {0, sizeof(ch), ch};      
+    char es[TLS_MAX_HASH];               // Early Secret
+    octad ES = {0,sizeof(es),es};
+    char hh[TLS_MAX_HASH];               
+    octad HH={0,sizeof(hh),hh};          // Transcript hashes 
+    char cook[TLS_MAX_COOKIE];
+    octad COOK={0,sizeof(cook),cook};    // Cookie
+    char crn[32];
+    octad CRN = {0, sizeof(crn), crn};
+
+    ee_status enc_ext_resp={false,false,false,false};  // encrypted extensions expectations
+    ee_status enc_ext_expt={false,false,false,false};  // encrypted extensions responses
+
+    log(IO_PROTOCOL,(char *)"Attempting Full Handshake\n",NULL,0,NULL);
+
+    session->favourite_group=groups[0]; // only sending one key share - so choose first in our list
+//
+// Generate key pair in favourite group
+//
+    SAL_generateKeyPair(session->favourite_group,&CSK,&CPK);   
+    log(IO_DEBUG,(char *)"Private key= ",NULL,0,&CSK);
+    log(IO_DEBUG,(char *)"Client Public key= ",NULL,0,&CPK);
+
+// Client Hello
+    SAL_randomOctad(32,&CRN);
+
+// First build our preferred mix of client Hello extensions, based on our capabililities
+    buildExtensions(session,&EXT,&CPK,&enc_ext_expt,0);
+
+// create and send Client Hello octad
+    sendClientHello(session,TLS1_0,&CH,&CRN,false,&EXT,0,false,true);  
+//
+//
+//   ----------------------------------------------------------> client Hello
+//
+//    
+    log(IO_DEBUG,(char *)"Client Hello sent\n",NULL,0,NULL);
+
+// Process Server Hello response
+    rtn=getServerHello(session,kex,&COOK,&SPK,pskid);
+//
+//
+//  <--------------------------------- server Hello (or helloRetryRequest?)
+//
+//
+    if (badResponse(session,rtn)) 
+    {
+#ifdef SHALLOW_STACK
+        free(CSK.val); free(CPK.val); free(SPK.val); free(EXT.val);
+#endif
+        return TLS_FAILURE;
+    }
+// Find cipher-suite chosen by Server
+    hashtype=0;
+    for (i=0;i<nsc;i++)
+    {
+        if (session->cipher_suite==ciphers[i])
+            hashtype=SAL_hashType(session->cipher_suite);
+    }
+    if (SAL_hashLen(hashtype)==0)
+    {
+        sendAlert(session,ILLEGAL_PARAMETER);
+        logCipherSuite(session->cipher_suite);
+        log(IO_DEBUG,(char *)"Cipher_suite not valid\n",NULL,0,NULL);
+        log(IO_PROTOCOL,(char *)"Full Handshake failed\n",NULL,0,NULL);
+#ifdef SHALLOW_STACK
+        free(CSK.val); free(CPK.val); free(SPK.val);  free(EXT.val);
+#endif
+        return TLS_FAILURE;
+    }
+    logCipherSuite(session->cipher_suite);
+    deriveEarlySecrets(hashtype,NULL,&ES,NULL,NULL);   // Early Secret
+    log(IO_DEBUG,(char *)"Early Secret= ",NULL,0,&ES);
+
+// Initialise Transcript Hash
+// For Transcript hash we must use cipher-suite hash function
+    initTranscriptHash(session);
+    if (rtn.val==HANDSHAKE_RETRY)  // Was serverHello an helloRetryRequest?
+    {
+        log(IO_DEBUG,(char *)"Server HelloRetryRequest= ",NULL,0,&session->IBUFF);
+        runningSyntheticHash(session,&CH,&EXT); // RFC 8446 section 4.4.1
+        runningHashIOrewind(session);      // Hash of helloRetryRequest
+
+        bool supported=false;
+        for (int i=0;i<nsg;i++)
+            if (kex==groups[i]) supported=true; 
+
+        if (!supported || kex==session->favourite_group)  // kex is alternate group suggested by server
+        { // its not supported or its the same one I originally chose !?
+            sendAlert(session,ILLEGAL_PARAMETER);
+            log(IO_DEBUG,(char *)"Group not supported, or no change as result of HRR\n",NULL,0,NULL);   
+            log(IO_PROTOCOL,(char *)"Full Handshake failed\n",NULL,0,NULL);
+#ifdef SHALLOW_STACK
+            free(CSK.val); free(CPK.val); free(SPK.val);  free(EXT.val);
+#endif
+            return TLS_FAILURE;
+        }
+
+// Repair clientHello by supplying public key of Server's preferred key exchange algorithm
+// build new client Hello extensions
+
+// generate new key pair in new server selected group 
+        session->favourite_group=kex;  // OK, lets try the alternate
+        SAL_generateKeyPair(session->favourite_group,&CSK,&CPK); 
+        buildExtensions(session,&EXT,&CPK,&enc_ext_expt,0);
+
+        if (COOK.len!=0)
+            addCookieExt(&EXT,&COOK);   // there was a cookie in the HRR ... so send it back in an extension
+        sendCCCS(session);  // send Client Cipher Change
+
+// create and send new Client Hello octad
+        sendClientHello(session,TLS1_2,&CH,&CRN,false,&EXT,0,true,true);
+//
+//
+//  ---------------------------------------------------> Resend Client Hello
+//
+//
+        log(IO_DEBUG,(char *)"Client Hello re-sent\n",NULL,0,NULL);
+
+        int skex; // Server Key Exchange Group - should be same as kex
+        rtn=getServerHello(session,skex,&COOK,&SPK,pskid);
+        
+        if (badResponse(session,rtn)) 
+        {
+#ifdef SHALLOW_STACK
+            free(CSK.val); free(CPK.val); free(SPK.val);  free(EXT.val);
+#endif
+            return TLS_FAILURE;
+        }
+
+        if (rtn.val==HANDSHAKE_RETRY)
+        { // only one retry allowed
+            log(IO_DEBUG,(char *)"A second Handshake Retry Request?\n",NULL,0,NULL); 
+            sendAlert(session,UNEXPECTED_MESSAGE);
+            log(IO_PROTOCOL,(char *)"Full Handshake failed\n",NULL,0,NULL);
+#ifdef SHALLOW_STACK
+            free(CSK.val); free(CPK.val); free(SPK.val);  free(EXT.val);
+#endif
+            return TLS_FAILURE;
+        }
+
+        if (kex!=skex)
+        {
+            log(IO_DEBUG,(char *)"Server came back with wrong group\n",NULL,0,NULL); 
+            sendAlert(session,ILLEGAL_PARAMETER);
+            log(IO_PROTOCOL,(char *)"Full Handshake failed\n",NULL,0,NULL);
+#ifdef SHALLOW_STACK
+            free(CSK.val); free(CPK.val); free(SPK.val);  free(EXT.val);
+#endif
+            return TLS_FAILURE;
+        }
+//
+//
+//  <---------------------------------------------------------- server Hello
+//
+//
+        resumption_required=true;
+    }
+    log(IO_DEBUG,(char *)"Server Hello= ",NULL,0,&session->IBUFF); 
+    logServerHello(session->cipher_suite,pskid,&SPK,&COOK);
+    logKeyExchange(kex);
+// Hash Transcript of the Hellos 
+    runningHash(session,&CH);
+    runningHash(session,&EXT);
+    runningHashIOrewind(session);
+    transcriptHash(session,&HH);        // HH = hash of clientHello+serverHello
+
+// Generate Shared secret SS from Client Secret Key and Server's Public Key
+    bool nonzero=SAL_generateSharedSecret(kex,&CSK,&SPK,&SS);
+    if (!nonzero)
+    { // all zero shared secret??
+        sendAlert(session,ILLEGAL_PARAMETER);
+        TLS13_clean(session);
+#ifdef SHALLOW_STACK
+        free(CSK.val); free(CPK.val); free(SPK.val);  free(EXT.val);
+#endif
+        return TLS_FAILURE;
+    }
+    log(IO_DEBUG,(char *)"Shared Secret= ",NULL,0,&SS);
+
+// Extract Handshake secret, Client and Server Handshake Traffic secrets, Client and Server Handshake keys and IVs from Transcript Hash and Shared secret
+
+    deriveHandshakeSecrets(session,&SS,&ES,&HH);
+
+    createSendCryptoContext(session,&session->CTS);
+    createRecvCryptoContext(session,&session->STS);
+
+    log(IO_DEBUG,(char *)"Handshake Secret= ",NULL,0,&session->HS);
+    log(IO_DEBUG,(char *)"Client handshake traffic secret= ",NULL,0,&session->CTS);
+    log(IO_DEBUG,(char *)"Client handshake key= ",NULL,0,&(session->K_send.K));
+    log(IO_DEBUG,(char *)"Client handshake iv= ",NULL,0,&(session->K_send.IV));
+    log(IO_DEBUG,(char *)"Server handshake traffic secret= ",NULL,0,&session->STS);
+    log(IO_DEBUG,(char *)"Server handshake key= ",NULL,0,&(session->K_recv.K));
+    log(IO_DEBUG,(char *)"Server handshake iv= ",NULL,0,&(session->K_recv.IV));
+#ifdef SHALLOW_STACK
+    free(CSK.val); free(CPK.val); free(SPK.val);  free(EXT.val);
+#endif
+// 1. get encrypted extensions
+    rtn=getServerEncryptedExtensions(session,&enc_ext_expt,&enc_ext_resp);   
+//
+//
+//  <------------------------------------------------- {Encrypted Extensions}
+//
+//
+    if (badResponse(session,rtn)) 
+        return TLS_FAILURE;
+    
+    logEncExt(&enc_ext_expt,&enc_ext_resp);
+    log(IO_DEBUG,(char *)"Encrypted Extensions Processed\n",NULL,0,NULL);
+    if (resumption_required) return TLS_RESUMPTION_REQUIRED;
+    return TLS_SUCCESS;
+}
+
+// Phase 2 - check that the server is trusted
+static int TLS13_server_trust(TLS_session *session)
+{
+    ret rtn;
+    int hashtype;
+
+#ifdef SHALLOW_STACK
+    octad SERVER_PK = {0,TLS_MAX_SIG_PUB_KEY_SIZE,(char *)malloc(TLS_MAX_SIG_PUB_KEY_SIZE)};  // Server's cert sig public key
+    octad SCVSIG={0,TLS_MAX_SIGNATURE_SIZE,(char *)malloc(TLS_MAX_SIGNATURE_SIZE)};           // Server's digital signature on transcript
+#else
+    char server_pk[TLS_MAX_SIG_PUB_KEY_SIZE];
+    octad SERVER_PK = {0,sizeof(server_pk),server_pk}; // Server's cert sig public key
+    char scvsig[TLS_MAX_SIGNATURE_SIZE];
+    octad SCVSIG={0,sizeof(scvsig),scvsig};           // Server's digital signature on transcript
+#endif
+    char hh[TLS_MAX_HASH];               
+    octad HH={0,sizeof(hh),hh};          // Transcript hashes
+    char fh[TLS_MAX_HASH];
+    octad FH={0,sizeof(fh),fh};       
+
+    char fin[TLS_MAX_HASH];
+    octad FIN={0,sizeof(fin),fin};                    // Server's finish message
+
+    hashtype=SAL_hashType(session->cipher_suite);
+
+// Client now receives certificate chain and verifier from Server. Need to parse these out, check CA signature on the cert
+// (maybe its self-signed), extract public key from cert, and use this public key to check server's signature 
+// on the "verifier". Note Certificate signature might use old methods, but server will use PSS padding for its signature (or ECC).
+    rtn=getCheckServerCertificateChain(session,&SERVER_PK,&SCVSIG);  // note SCVSIG is used here as workspace
+    if (session->server_cert_type==RAW_PUBLIC_KEY) {
+        log(IO_PROTOCOL,(char *)"WARNING - server is authenticating with raw public key\n",NULL,0,NULL);
+    }
+//
+//
+//  <---------------------------------------------------------- {Certificate}
+//
+//
+    if (badResponse(session,rtn))
+    {    
+#ifdef SHALLOW_STACK
+        free(SERVER_PK.val); free (SCVSIG.val);
+#endif
+        return TLS_FAILURE;
+    }
+    transcriptHash(session,&HH); // HH = hash of clientHello+serverHello+encryptedExtensions+CertChain
+    log(IO_DEBUG,(char *)"Certificate Chain is valid\n",NULL,0,NULL);
+    log(IO_DEBUG,(char *)"Transcript Hash (CH+SH+EE+CT) = ",NULL,0,&HH); 
+
+// 3. get verifier signature
+    int sigalg;
+    rtn=getServerCertVerify(session,&SCVSIG,sigalg);
+//
+//
+//  <---------------------------------------------------- {Certificate Verify}
+//
+//
+    if (badResponse(session,rtn)) 
+    {
+#ifdef SHALLOW_STACK
+        free(SERVER_PK.val); free (SCVSIG.val);
+#endif
+        return TLS_FAILURE;
+    }
+    transcriptHash(session,&FH); // hash of clientHello+serverHello+encryptedExtensions+CertChain+serverCertVerify
+    log(IO_DEBUG,(char *)"Transcript Hash (CH+SH+EE+SCT+SCV) = ",NULL,0,&FH);
+    log(IO_DEBUG,(char *)"Server Transcript Signature= ",NULL,0,&SCVSIG);
+
+    logSigAlg(sigalg);
+    if (!checkServerCertVerifier(sigalg,&SCVSIG,&HH,&SERVER_PK))
+    {
+        sendAlert(session,DECRYPT_ERROR);
+        log(IO_DEBUG,(char *)"Server Cert Verification failed\n",NULL,0,NULL);
+        log(IO_PROTOCOL,(char *)"Full Handshake failed\n",NULL,0,NULL);
+#ifdef SHALLOW_STACK
+        free(SERVER_PK.val); free (SCVSIG.val);
+#endif
+        return TLS_FAILURE;
+    }
+    log(IO_PROTOCOL,(char *)"Server Cert Verification OK - ",session->hostname,0,NULL);
+#ifdef SHALLOW_STACK
+    free(SERVER_PK.val); free (SCVSIG.val);
+#endif
+// 4. get Server Finished
+    rtn=getServerFinished(session,&FIN);
+//
+//
+//  <------------------------------------------------------ {Server Finished}
+//
+//
+    if (badResponse(session,rtn))
+        return TLS_FAILURE;
+    
+    if (!checkVeriferData(hashtype,&FIN,&session->STS,&FH))
+    {
+        sendAlert(session,DECRYPT_ERROR);
+        log(IO_DEBUG,(char *)"Server Data is NOT verified\n",NULL,0,NULL);
+        log(IO_DEBUG,(char *)"Full Handshake failed\n",NULL,0,NULL);
+        return TLS_FAILURE;
+    }
+    log(IO_DEBUG,(char *)"\nServer Data is verified\n",NULL,0,NULL);
+
+    return TLS_SUCCESS;
+}
+
+// Phase 3 - client supplies trust to server, given servers list of acceptable signature types
+#if CLIENT_CERT != NOCERT
+static void TLS13_client_trust(TLS_session *session)
+{
+#ifdef SHALLOW_STACK
+    octad CLIENT_KEY={0,TLS_MAX_SIG_SECRET_KEY_SIZE,(char *)malloc(TLS_MAX_SIG_SECRET_KEY_SIZE)};   // Client secret key
+    octad CLIENT_CERTCHAIN={0,TLS_MAX_CLIENT_CHAIN_SIZE,(char *)malloc(TLS_MAX_CLIENT_CHAIN_SIZE)};   // Client certificate chain
+    octad CCVSIG={0,TLS_MAX_SIGNATURE_SIZE,(char *)malloc(TLS_MAX_SIGNATURE_SIZE)}; 
+#else 
+    char client_key[TLS_MAX_SIG_SECRET_KEY_SIZE];           
+    octad CLIENT_KEY={0,sizeof(client_key),client_key};   // Client secret key
+    char client_certchain[TLS_MAX_CLIENT_CHAIN_SIZE];           
+    octad CLIENT_CERTCHAIN={0,sizeof(client_certchain),client_certchain};   // Client certificate chain
+    char ccvsig[TLS_MAX_SIGNATURE_SIZE];
+    octad CCVSIG={0,sizeof(ccvsig),ccvsig};           // Client's digital signature on transcript
+#endif
+    char th[TLS_MAX_HASH];
+    octad TH={0,sizeof(th),th};  // Transcript hash
+
+    int kind=getClientPrivateKeyandCertChain(&CLIENT_KEY,session->client_cert_type,&CLIENT_CERTCHAIN);
+
+    if (kind!=0)
+    { // Yes, I can do that kind of signature
+        log(IO_PROTOCOL,(char *)"Client is authenticating\n",NULL,0,NULL);
+        sendClientCertificateChain(session,&CLIENT_CERTCHAIN);
+//
+//
+//  {client Certificate} ---------------------------------------------------->
+//
+//
+        transcriptHash(session,&TH);
+        createClientCertVerifier(kind,&TH,&CLIENT_KEY,&CCVSIG);      
+        sendClientCertVerify(session,kind,&CCVSIG);
+//
+//
+//  {Certificate Verify} ---------------------------------------------------->
+//
+//
+    } else { // No, I can't - send a null cert, and no verifier
+        sendClientCertificateChain(session,NULL);
+    }
+#ifdef SHALLOW_STACK
+    free(CLIENT_KEY.val); free(CLIENT_CERTCHAIN.val); free(CCVSIG.val);
+#endif
+}
+#endif
+
+// TLS1.3 full handshake - connect to server
+static int TLS13_full(TLS_session *session)
+{
+    ret rtn;
+    int hashtype;
+    bool resumption_required=false;
+    bool gotacertrequest=false;
+    bool have_suitable_cert=false;
+
+    char hh[TLS_MAX_HASH];               
+    octad HH={0,sizeof(hh),hh};          // Transcript hashes  
+    char th[TLS_MAX_HASH];
+    octad TH={0,sizeof(th),th};  
+    char chf[TLS_MAX_HASH];                           
+    octad CHF={0,sizeof(chf),chf};       // client verify
+
+// Exchange Hellos
+    int rval=TLS13_exchange_hellos(session);
+    if (rval==TLS_FAILURE)
+    {
+        TLS13_clean(session);
+        return TLS_FAILURE;
+    }
+    if (rval==TLS_RESUMPTION_REQUIRED)
+        resumption_required=true;
+        
+// get certificate request (maybe..) and certificate chain, check it, get Server public key
+
+    hashtype=SAL_hashType(session->cipher_suite);
+    rtn=seeWhatsNext(session);  // get next message type
+    if (badResponse(session,rtn)) 
+    {
+        TLS13_clean(session);
+        return TLS_FAILURE;
+    }
+
+    if (rtn.val==CERT_REQUEST)
+    { // optional certificate request received
+        gotacertrequest=true;
+        rtn=getCertificateRequest(session,false);
+//
+//
+//  <---------------------------------------------------- {Certificate Request}
+//
+//
+        if (badResponse(session,rtn))
+        {
+            TLS13_clean(session);
+            return TLS_FAILURE;
+        }
+        if (rtn.val==CERT_REQUEST) {
+            have_suitable_cert=true;
+        }
+        log(IO_PROTOCOL,(char *)"Certificate Request received\n",NULL,0,NULL);
+    }
+
+    rval=TLS13_server_trust(session);
+    if (rval==TLS_FAILURE)
+    {
+        TLS13_clean(session);
+        return TLS_FAILURE;
+    }
+    sendCCCS(session);  // send Client Cipher Change
+    transcriptHash(session,&HH); // hash of clientHello+serverHello+encryptedExtensions+CertChain+serverCertVerify+serverFinish
+
+    log(IO_DEBUG,(char *)"Transcript Hash (CH+SH+EE+SCT+SCV+SF) YYY = ",NULL,0,&HH);
+
+// Now its the clients turn to respond
+// Send Certificate (if it was asked for, and if I have one) & Certificate Verify.
+    OCT_kill(&session->IBUFF);
+    session->ptr=0;
+
+    if (gotacertrequest)
+    {
+        if (have_suitable_cert) {
+            TLS13_client_trust(session);
+        } else {
+            sendClientCertificateChain(session,NULL);
+        }
+    } 
+    transcriptHash(session,&TH);
+
+// HH is server finished hash
+// TH is client finished hash
+// both are needed
+
+    log(IO_DEBUG,(char *)"Transcript Hash (CH+SH+EE+SCT+SCV+SF+[CCT+CSV])  XXXX = ",NULL,0,&TH);
+
+// create client verify data
+// .... and send it to Server
+    deriveVeriferData(hashtype,&CHF,&session->CTS,&TH);  
+    sendClientFinish(session,&CHF);  
+//
+//
+//  {client Finished} ----------------------------------------------------->
+//
+//
+    log(IO_DEBUG,(char *)"Client Verify Data= ",NULL,0,&CHF); 
+    transcriptHash(session,&TH); // hash of clientHello+serverHello+encryptedExtensions+CertChain+serverCertVerify+serverFinish(+clientCertChain+clientCertVerify)+clientFinish
+    log(IO_DEBUG,(char *)"Transcript Hash (CH+SH+EE+SCT+SCV+SF+[CCT+CSV]+CF) = ",NULL,0,&TH);
+
+// calculate traffic and application keys from handshake secret and transcript hashes
+    deriveApplicationSecrets(session,&HH,&TH,NULL);
+
+    createSendCryptoContext(session,&session->CTS);
+    createRecvCryptoContext(session,&session->STS);
+
+    log(IO_DEBUG,(char *)"Client application traffic secret= ",NULL,0,&session->CTS);
+    log(IO_DEBUG,(char *)"Server application traffic secret= ",NULL,0,&session->STS);
+    log(IO_PROTOCOL,(char *)"FULL Handshake succeeded\n",NULL,0,NULL);
+    if (resumption_required) log(IO_PROTOCOL,(char *)"... after handshake resumption\n",NULL,0,NULL);
+
+    OCT_kill(&session->IBUFF);  // clean up IO buffer
+
+    if (resumption_required) return TLS_RESUMPTION_REQUIRED;
+    return TLS_SUCCESS;
+}
+
+// TLS1.3 fast resumption handshake (0RTT and 1RTT)
+// EARLY - First message from Client to Server (should ideally be sent as early data!)
+static int TLS13_resume(TLS_session *session,octad *EARLY)
+{
+    int hashtype,kex,pskid;
+    ret rtn;
+
+#ifdef SHALLOW_STACK
+    octad CSK = {0, TLS_MAX_KEX_SECRET_KEY_SIZE, (char *)malloc(TLS_MAX_KEX_SECRET_KEY_SIZE)};
+    octad CPK = {0, TLS_MAX_KEX_PUB_KEY_SIZE, (char *)malloc(TLS_MAX_KEX_PUB_KEY_SIZE)}; 
+    octad SPK = {0, TLS_MAX_KEX_CIPHERTEXT_SIZE, (char *)malloc(TLS_MAX_KEX_CIPHERTEXT_SIZE)};   
+    octad EXT = {0, TLS_MAX_EXTENSIONS, (char *)malloc(TLS_MAX_EXTENSIONS)};
+#else
+    char csk[TLS_MAX_KEX_SECRET_KEY_SIZE];   
+    octad CSK = {0, sizeof(csk), csk};   // clients key exchange secret key
+    char cpk[TLS_MAX_KEX_PUB_KEY_SIZE];
+    octad CPK = {0, sizeof(cpk), cpk};   // Client's key exchange Public Key
+    char spk[TLS_MAX_KEX_CIPHERTEXT_SIZE];
+    octad SPK = {0, sizeof(spk), spk};   // Server's key exchange Public Key/Ciphertext
+    char ext[TLS_MAX_EXTENSIONS];
+    octad EXT={0,sizeof(ext),ext};       // Extensions  
+#endif
+    char es[TLS_MAX_HASH];               // Early Secret
+    octad ES = {0,sizeof(es),es};
+    char ss[TLS_MAX_SHARED_SECRET_SIZE];
+    octad SS = {0, sizeof(ss), ss};      // Shared Secret
+    char ch[TLS_MAX_HELLO];                 // Client Hello
+    octad CH = {0, sizeof(ch), ch};
+
+    char hh[TLS_MAX_HASH];               
+    octad HH={0,sizeof(hh),hh};          // Transcript hashes
+    char fh[TLS_MAX_HASH];
+    octad FH={0,sizeof(fh),fh};       
+    char th[TLS_MAX_HASH];
+    octad TH={0,sizeof(th),th};  
+    char fin[TLS_MAX_HASH];
+    octad FIN={0,sizeof(fin),fin};      // Server's finish message
+    char chf[TLS_MAX_HASH];                           
+    octad CHF={0,sizeof(chf),chf};      // client verify
+    char cets[TLS_MAX_HASH];           
+    octad CETS={0,sizeof(cets),cets};   // Early traffic secret
+    char cook[TLS_MAX_COOKIE];
+    octad COOK={0,sizeof(cook),cook};   // Cookie
+    char bnd[TLS_MAX_HASH];
+    octad BND={0,sizeof(bnd),bnd};
+    char psk[TLS_MAX_HASH];
+    octad PSK={0,sizeof(psk),psk};      // Pre-shared key
+    char bk[TLS_MAX_HASH];
+    octad BK={0,sizeof(bk),bk};         // Binder key
+    char crn[32];
+    octad CRN = {0, sizeof(crn), crn};
+
+    unsign32 time_ticket_received,time_ticket_used;
+    int origin;
+    unsign32 age,age_obfuscator=0;
+    unsign32 max_early_data=0;
+#ifdef TRY_EARLY_DATA
+    bool have_early_data=true;       // Hope to send client message as early data
+#else
+    bool have_early_data=false;
+#endif
+    bool external_psk=false;
+    ee_status enc_ext_resp={false,false,false,false};  // encrypted extensions responses 
+    ee_status enc_ext_expt={false,false,false,false};  // encrypted extensions expectations
+
+// Extract Ticket parameters
+    age_obfuscator=session->T.age_obfuscator;
+    max_early_data=session->T.max_early_data;
+    OCT_copy(&PSK,&session->T.PSK);
+    time_ticket_received=session->T.birth;
+    session->cipher_suite=session->T.cipher_suite;
+    session->favourite_group=session->T.favourite_group;
+    origin=session->T.origin;
+
+    log(IO_PROTOCOL,(char *)"Attempting Resumption Handshake\n",NULL,0,NULL);
+    logTicket(&session->T); // lifetime,age_obfuscator,max_early_data,&NONCE,&ETICK);
+
+    if (max_early_data==0 || EARLY==NULL)
+        have_early_data=false;      // early data not allowed - or I don't have any
+
+// Generate Early secret and Binder Key from PSK
+
+    hashtype=SAL_hashType(session->cipher_suite);
+    initTranscriptHash(session);
+
+    if (origin==TLS_EXTERNAL_PSK)
+    { // its an external PSK
+        external_psk=true;
+        deriveEarlySecrets(hashtype,&PSK,&ES,&BK,NULL);
+    } else {
+        external_psk=false;
+        deriveEarlySecrets(hashtype,&PSK,&ES,NULL,&BK);   // compute early secret and Binder Key from PSK
+    }
+    //log(IO_DEBUG,(char *)"PSK= ",NULL,0,&PSK); 
+    log(IO_DEBUG,(char *)"Binder Key= ",NULL,0,&BK); 
+    log(IO_DEBUG,(char *)"Early Secret= ",NULL,0,&ES);
+
+// Generate key pair in favourite group - use same favourite group that worked before for this server - so should be no HRR
+    SAL_generateKeyPair(session->favourite_group,&CSK,&CPK);
+    log(IO_DEBUG,(char *)"Private key= ",NULL,0,&CSK);  
+    log(IO_DEBUG,(char *)"Client Public key= ",NULL,0,&CPK);  
+
+// Client Hello
+    SAL_randomOctad(32,&CRN);
+// First build standard client Hello extensions
+
+    int resmode=1;
+    if (origin==TLS_EXTERNAL_PSK)
+        resmode=2;
+    buildExtensions(session,&EXT,&CPK,&enc_ext_expt,resmode);    
+    
+    if (have_early_data) {
+        addEarlyDataExt(&EXT); enc_ext_expt.early_data=true;   // try sending client message as early data if allowed
+    }
+#ifdef POST_HS_AUTH
+    addPostHSAuth(&EXT);  // willing to do post handshake authentication if necessary
+#endif
+    age=0;
+    if (!external_psk)
+    { // Its NOT an external pre-shared key
+        time_ticket_used=(unsign32)millis();
+        age=time_ticket_used-time_ticket_received; // age of ticket in milliseconds - problem for some sites which work for age=0 ??
+        log(IO_DEBUG,(char *)"Ticket age= ",(char *)"%x",age,NULL);
+        age+=age_obfuscator;
+        log(IO_DEBUG,(char *)"obfuscated age = ",(char *)"%x",age,NULL);
+    }
+
+    int extra=addPreSharedKeyExt(&EXT,age,&session->T.TICK,SAL_hashLen(hashtype)); // must be last extension..
+
+// create and send Client Hello octad
+    sendClientHello(session,TLS1_2,&CH,&CRN,true,&EXT,extra,false,false);  // don't transmit yet - wait for binders
+//
+//
+//   ----------------------------------------------------------> client Hello
+//
+//
+    runningHash(session,&CH); 
+    runningHash(session,&EXT);
+    transcriptHash(session,&HH);            // HH = hash of Truncated clientHello
+    log(IO_DEBUG,(char *)"Hash of Truncated client Hello",NULL,0,&HH);
+    deriveVeriferData(hashtype,&BND,&BK,&HH);
+    sendBinder(session,&BND);               // Send Binders
+    log(IO_DEBUG,(char *)"Client Hello + Binder sent\n",NULL,0,NULL);
+    log(IO_DEBUG,(char *)"Binder= ",NULL,0,&BND);
+  
+    transcriptHash(session,&HH);            // HH = hash of full clientHello
+    log(IO_DEBUG,(char *)"Hash of Completed client Hello",NULL,0,&HH);
+
+    if (have_early_data)
+        sendCCCS(session);
+
+    deriveLaterSecrets(hashtype,&ES,&HH,&CETS,NULL);   // Get Client Early Traffic Secret from transcript hash and ES
+    log(IO_DEBUG,(char *)"Client Early Traffic Secret= ",NULL,0,&CETS); 
+    createSendCryptoContext(session,&CETS);
+// if its allowed, send client message as (encrypted!) early data
+    if (have_early_data)
+    {
+        log(IO_APPLICATION,(char *)"Sending some early data\n",NULL,0,NULL);
+        sendClientMessage(session,APPLICATION,TLS1_2,EARLY,NULL,true);
+//
+//
+//   ----------------------------------------------------------> (Early Data)
+//
+//
+    } 
+
+// Process Server Hello
+    rtn=getServerHello(session,kex,&COOK,&SPK,pskid);
+    if (badResponse(session,rtn)) 
+    {
+        TLS13_clean(session);
+#ifdef SHALLOW_STACK
+        free(CSK.val); free(CPK.val); free(SPK.val); free(EXT.val);
+#endif
+        return TLS_FAILURE;
+    }
+//
+//
+//  <---------------------------------------------------------- server Hello
+//
+//
+    runningHashIOrewind(session); // Hashing Server Hello
+    transcriptHash(session,&HH);       // HH = hash of clientHello+serverHello
+
+    if (pskid<0)
+    { // Ticket rejected by Server (as out of date??)
+        log(IO_PROTOCOL,(char *)"Ticket rejected by server\n",NULL,0,NULL);
+        log(IO_PROTOCOL,(char *)"Resumption Handshake failed\n",NULL,0,NULL);
+        TLS13_clean(session);
+#ifdef SHALLOW_STACK
+        free(CSK.val); free(CPK.val); free(SPK.val);  free(EXT.val);
+#endif
+        return TLS_FAILURE; 
+    }
+
+    if (pskid>0)
+    { // pskid out-of-range (only one allowed)
+        sendAlert(session,ILLEGAL_PARAMETER);
+        log(IO_PROTOCOL,(char *)"Resumption Handshake failed\n",NULL,0,NULL);
+        TLS13_clean(session);
+#ifdef SHALLOW_STACK
+        free(CSK.val); free(CPK.val); free(SPK.val);  free(EXT.val);
+#endif
+        return TLS_FAILURE;
+    }
+
+    logServerHello(session->cipher_suite,pskid,&SPK,&COOK);
+    logKeyExchange(kex);
+
+    if (rtn.val==HANDSHAKE_RETRY || kex!=session->favourite_group)
+    { // should not happen
+        sendAlert(session,UNEXPECTED_MESSAGE);
+        log(IO_DEBUG,(char *)"No change possible as result of HRR\n",NULL,0,NULL); 
+        log(IO_PROTOCOL,(char *)"Resumption Handshake failed\n",NULL,0,NULL);
+        TLS13_clean(session);
+#ifdef SHALLOW_STACK
+        free(CSK.val); free(CPK.val); free(SPK.val);  free(EXT.val);
+#endif
+        return TLS_FAILURE;
+    }
+    //log(IO_DEBUG,(char *)"serverHello= ",NULL,0,&session->IBUFF); 
+
+// Generate Shared secret SS from Client Secret Key and Server's Public Key
+    bool nonzero=SAL_generateSharedSecret(kex,&CSK,&SPK,&SS);
+    if (!nonzero)
+    { // all zero shared secret??
+        sendAlert(session,ILLEGAL_PARAMETER);
+        TLS13_clean(session);
+#ifdef SHALLOW_STACK
+        free(CSK.val); free(CPK.val); free(SPK.val);  free(EXT.val);
+#endif
+        return TLS_FAILURE;
+    }
+    log(IO_DEBUG,(char *)"Shared Secret= ",NULL,0,&SS);
+
+    deriveHandshakeSecrets(session,&SS,&ES,&HH); 
+    createRecvCryptoContext(session,&session->STS);
+
+    log(IO_DEBUG,(char *)"Handshake Secret= ",NULL,0,&session->HS);
+    log(IO_DEBUG,(char *)"Client handshake traffic secret= ",NULL,0,&session->CTS);
+    log(IO_DEBUG,(char *)"Server handshake traffic secret= ",NULL,0,&session->STS);
+
+#ifdef SHALLOW_STACK
+    free(CSK.val); free(CPK.val); free(SPK.val);  free(EXT.val);
+#endif
+
+// 1. get encrypted extensions
+    rtn=getServerEncryptedExtensions(session,&enc_ext_expt,&enc_ext_resp);
+//
+//
+//  <------------------------------------------------- {Encrypted Extensions}
+//
+//
+    if (badResponse(session,rtn)) 
+    {
+        TLS13_clean(session);
+        return TLS_FAILURE;
+    }
+    logEncExt(&enc_ext_expt,&enc_ext_resp);
+    transcriptHash(session,&FH); // hash of clientHello+serverHello+encryptedExtension
+    log(IO_DEBUG,(char *)"Transcript Hash (CH+SH+EE) = ",NULL,0,&FH); 
+
+// 2. get server finish
+    rtn=getServerFinished(session,&FIN);   // Finished
+//
+//
+//  <------------------------------------------------------ {Server Finished}
+//
+//
+    if (badResponse(session,rtn)) 
+    {
+        TLS13_clean(session);
+        return TLS_FAILURE;
+    }
+
+// Now indicate End of Early Data, encrypted with 0-RTT keys
+    transcriptHash(session,&HH); // hash of clientHello+serverHello+encryptedExtension+serverFinish
+    if (enc_ext_resp.early_data)
+    {
+        sendEndOfEarlyData(session);     // Should only be sent if server has accepted Early data - see encrypted extensions!
+        log(IO_DEBUG,(char *)"Send End of Early Data \n",NULL,0,NULL);
+    }
+    transcriptHash(session,&TH); // hash of clientHello+serverHello+encryptedExtension+serverFinish+EndOfEarlyData
+    log(IO_DEBUG,(char *)"Transcript Hash (CH+SH+EE+SF+ED) = ",NULL,0,&TH); 
+
+// Switch to handshake keys
+    createSendCryptoContext(session,&session->CTS);
+    if (!checkVeriferData(hashtype,&FIN,&session->STS,&FH))
+    {
+        sendAlert(session,DECRYPT_ERROR);
+        log(IO_DEBUG,(char *)"Server Data is NOT verified\n",NULL,0,NULL);
+        log(IO_PROTOCOL,(char *)"Resumption Handshake failed\n",NULL,0,NULL);
+        TLS13_clean(session);
+        return TLS_FAILURE;
+    }
+
+// create client verify data and send it to Server
+    deriveVeriferData(hashtype,&CHF,&session->CTS,&TH);  
+    sendClientFinish(session,&CHF);  
+//
+//
+//  {client Finished} ----------------------------------------------------->
+//
+//
+    log(IO_DEBUG,(char *)"Server Data is verified\n",NULL,0,NULL);
+    log(IO_DEBUG,(char *)"Client Verify Data= ",NULL,0,&CHF); 
+
+    transcriptHash(session,&FH); // hash of clientHello+serverHello+encryptedExtension+serverFinish+EndOfEarlyData+clientFinish
+
+// calculate traffic and application keys from handshake secret and transcript hashes, and store in session
+    deriveApplicationSecrets(session,&HH,&FH,NULL);  
+    createSendCryptoContext(session,&session->CTS);
+    createRecvCryptoContext(session,&session->STS);
+
+    log(IO_DEBUG,(char *)"Client application traffic secret= ",NULL,0,&session->CTS);
+    log(IO_DEBUG,(char *)"Server application traffic secret= ",NULL,0,&session->STS);
+    log(IO_PROTOCOL,(char *)"RESUMPTION Handshake succeeded\n",NULL,0,NULL);
+
+    OCT_kill(&session->IBUFF);  // clean up IO buffer
+
+    if (enc_ext_resp.early_data)
+    {
+        log(IO_PROTOCOL,(char *)"Application Message accepted as Early Data\n\n",EARLY->val,0,NULL);
+        return TLS_EARLY_DATA_ACCEPTED;
+    }
+    return TLS_SUCCESS;
+}
+
+// connect to server
+// first try resumption if session has a good ticket attached
+bool TLS13_connect(TLS_session *session,octad *EARLY)
+{
+    int rtn=0;
+    bool early_went=false;
+    session->status=TLS13_HANDSHAKING;
+    if (ticket_still_good(&session->T))
+    { // have a good ticket? Try it.
+        rtn=TLS13_resume(session,EARLY);
+        if (rtn==TLS_EARLY_DATA_ACCEPTED) early_went=true;
+    } else {
+        log(IO_PROTOCOL,(char *)"Resumption Ticket not found or invalid\n",NULL,0,NULL);
+        rtn=TLS13_full(session);
+    }
+    initTicketContext(&session->T); // clear out any ticket
+    
+    if (rtn==0)  // failed to connect
+    {
+        //session->status=TLS13_DISCONNECTED;
+        return false;
+    }
+    
+    if (!early_went && EARLY!=NULL)
+        TLS13_send(session,EARLY);  // didn't go early, so send it now
+    session->status=TLS13_CONNECTED;
+    return true;   // exiting with live session, ready to receive fresh ticket
+}
+
+// send a message post-handshake
+void TLS13_send(TLS_session *state,octad *GET)
+{
+    log(IO_APPLICATION,(char *)"Sending Application Message\n\n",GET->val,0,NULL);
+    sendClientMessage(state,APPLICATION,TLS1_2,GET,NULL,true);
+}
+
+// Process Server records received post-handshake
+// Should be mostly application data, but..
+// could be more handshake data disguised as application data
+// For example could include a ticket. Or key update.
+// returns +ve length of message, or negative error, or 0 for a time-out
+int TLS13_recv(TLS_session *session,octad *REC)
+{
+    ret r;
+    int nb,len,type,nticks,kur,rtn;//,ptr=0;
+    bool fin=false;
+    bool have_suitable_cert=false;
+    octad TICK;        // Ticket raw data
+    char fh[TLS_MAX_HASH];
+    octad FH={0,sizeof(fh),fh};  // Transcript hash
+    char chf[TLS_MAX_HASH];                           
+    octad CHF={0,sizeof(chf),chf};      // client verify
+    int hashtype=SAL_hashType(session->cipher_suite);
+    TICK.len=0;
+    session->ptr=0;
+    nticks=0;        // number of tickets received
+    OCT_kill(REC);
+    log(IO_PROTOCOL,(char *)"Waiting for Server input \n",NULL,0,NULL);
+    while (1)
+    {
+        //log(IO_PROTOCOL,(char *)"Waiting for Server input \n",NULL,0,NULL);
+        OCT_kill(&session->IBUFF); session->ptr=0;
+        type=getServerRecord(session);  // get first fragment to determine type
+        if (type<0)
+        {
+            sendAlert(session,alert_from_cause(type));
+            return type;   // its an error
+        }
+        if (type==TIMED_OUT)
+        {
+            log(IO_PROTOCOL,(char *)"TIME_OUT\n",NULL,0,NULL);
+            return 0;
+        }
+        if (type==HSHAKE)
+        {
+            while (1)
+            {
+
+                r=parseIntorPull(session,1); nb=r.val; if (r.err) break; 
+                session->ptr-=1; // peek ahead
+
+                switch (nb)
+                {
+                case TICKET :   // keep last ticket
+                    r=parseIntorPull(session,1); if (r.err) break;
+                    r=parseIntorPull(session,3); len=r.val; if (r.err) break;   // message length
+                    r=parseoctadorPullptrX(session,&TICK,len);    // just copy out pointer to this
+                    nticks++;
+                    rtn=parseTicket(&TICK,(unsign32)millis(),&session->T);       // extract into ticket structure T, and keep for later use  
+                    if (rtn==BAD_TICKET) {
+                        session->T.valid=false;
+                        log(IO_PROTOCOL,(char *)"Got a bad ticket ",NULL,0,NULL);
+                    } else {
+                        session->T.cipher_suite=session->cipher_suite;
+                        session->T.favourite_group=session->favourite_group;
+                        session->T.valid=true;
+                        log(IO_PROTOCOL,(char *)"Got a ticket with lifetime (minutes)= ",(char *)"%d",session->T.lifetime/60,NULL);
+                    }
+
+                    if (session->ptr==session->IBUFF.len) fin=true; // record finished
+                    if (fin) break;
+                    continue;
+
+               case KEY_UPDATE :
+                    r=parseIntorPull(session,1); if (r.err) break;
+                    r=parseIntorPull(session,3); len=r.val; if (r.err) break;   // message length
+
+                    if (len!=1)
+                    {
+                        log(IO_PROTOCOL,(char *)"Something wrong\n",NULL,0,NULL);
+                        sendAlert(session,DECODE_ERROR);
+                        return BAD_RECORD;
+                    }
+                    r=parseIntorPull(session,1); kur=r.val; if (r.err) break;
+                    if (kur==TLS13_UPDATE_NOT_REQUESTED)
+                    {
+                        deriveUpdatedKeys(&session->K_recv,&session->STS);  // reset record number
+                        log(IO_PROTOCOL,(char *)"RECEIVING KEYS UPDATED\n",NULL,0,NULL);
+                    }
+                    if (kur==TLS13_UPDATE_REQUESTED)
+                    {
+                        deriveUpdatedKeys(&session->K_recv,&session->STS);
+                        sendKeyUpdate(session,TLS13_UPDATE_NOT_REQUESTED); // tell server to update their receiving keys
+                        log(IO_PROTOCOL,(char *)"SENDING KEYS UPDATED\n",NULL,0,NULL);
+                        log(IO_PROTOCOL,(char *)"Key update notified - client should do the same\n",NULL,0,NULL);
+                        log(IO_PROTOCOL,(char *)"RECEIVING KEYS UPDATED\n",NULL,0,NULL);
+                    }
+                    if (kur!=TLS13_UPDATE_NOT_REQUESTED && kur!=TLS13_UPDATE_REQUESTED)
+                    {
+                        log(IO_PROTOCOL,(char *)"Bad Request Update value\n",NULL,0,NULL);
+                        sendAlert(session,ILLEGAL_PARAMETER);
+                        return BAD_REQUEST_UPDATE;
+                    }
+                    if (session->ptr==session->IBUFF.len) fin=true; // record finished
+                    if (fin) break;
+                    continue;
+#ifdef POST_HS_AUTH
+                case CERT_REQUEST:
+                    r=getCertificateRequest(session,true);
+                    if (badResponse(session,r)) {
+                        return BAD_MESSAGE;
+                    }
+                    have_suitable_cert=false;
+                    if (r.val==CERT_REQUEST) {
+                        have_suitable_cert=true;
+                    }
+                    // send client credentials
+                    if (have_suitable_cert) {
+                        TLS13_client_trust(session);
+                    } else {
+                        sendClientCertificateChain(session,NULL);
+                    }
+                    transcriptHash(session,&FH);
+// create client verify data and send it to Server
+                    deriveVeriferData(hashtype,&CHF,&session->CTS,&FH);  
+                    sendClientFinish(session,&CHF);  
+                    if (session->ptr==session->IBUFF.len) fin=true; // record finished
+                    if (fin) break;
+                    continue;
+#endif                
+
+                default:
+                    r=parseIntorPull(session,1); if (r.err) break;
+                    r=parseIntorPull(session,3); len=r.val; if (r.err) break;   // message length
+                    log(IO_PROTOCOL,(char *)"Unsupported Handshake message type ",(char *)"%x",nb,NULL);
+                    sendAlert(session,UNEXPECTED_MESSAGE);
+                    return WRONG_MESSAGE;
+                    //fin=true;
+                    //break;            
+                }
+                if (r.err || fin) break;
+            }
+            if (r.err) {
+                sendAlert(session,alert_from_cause(r.err));
+                return r.err;
+            }
+        }
+        if (type==APPLICATION)
+        { // application data received - return it
+            if (session->IBUFF.len==0) continue; // empty application message
+            OCT_copy(REC,&session->IBUFF);
+            break;
+        }
+        if (type==HEART_BEAT)
+        {
+            REC->len=0;
+            int len=session->IBUFF.len;
+            int mode=session->IBUFF.val[0];
+            int paylen=256*(int)(unsigned char)session->IBUFF.val[1]+(int)(unsigned char)session->IBUFF.val[2];
+            if (len>18+paylen && len<256) { // looks OK - ignore if too large
+                if (mode==1) { // request
+                    if (session->expect_heartbeats) {
+                        char resp[256];
+                        octad RESP={0,sizeof(resp),resp};
+                        RESP.len=len;
+                        RESP.val[0]=2; // convert it to a response and bounce it back
+                        for (int i=1;i<paylen+3;i++) {
+                            RESP.val[i]=session->IBUFF.val[i];
+                        }
+                        for (int i=paylen+3;i<len;i++) {
+                            RESP.val[i]=SAL_randomByte();
+                        }
+//printf("Received heart-beat request  - sending response\n");
+                        sendRecord(session,HEART_BEAT,TLS1_2,&RESP,true);
+                    }
+                }
+                if (mode==2) { // response
+                    if (session->heartbeat_req_in_flight && paylen==0) { // if I asked for one, and the payload length is zero
+                        session->heartbeat_req_in_flight=false; // reset it
+                        OCT_kill(&session->IBUFF);
+//printf("Received heart-beat response\n");
+                        break; // better exit so link can be tested for liveness
+                    }
+                }
+            }
+            OCT_kill(&session->IBUFF);
+        }
+        if (type==ALERT)
+        {
+            log(IO_PROTOCOL,(char *)"*** Alert received - ",NULL,0,NULL);
+            logAlert(session->IBUFF.val[1]);
+            if (session->IBUFF.val[1]==CLOSE_NOTIFY) {
+                TLS13_stop(session);
+                return CLOSURE_ALERT_RECEIVED;
+            } else return ERROR_ALERT_RECEIVED;    // Alert received
+        }
+    }
+
+    if (session->T.valid)
+    { // if ticket received, recover PSK
+        recoverPSK(session); // recover PSK using NONCE and RMS, and store it with ticket
+        session->T.origin=TLS_FULL_HANDSHAKE;
+    } else {
+        log(IO_PROTOCOL,(char *)"No ticket provided \n",NULL,0,NULL);
+    }
+
+    return REC->len;
+}
+
+// Send a heart-beat request, and wait for an immediate response
+// if heartbeats not permitted, same as recv()
+int TLS13_recv_and_check(TLS_session *session,octad *REC)
+{
+    sendHeartbeatRequest(session);
+    int r=TLS13_recv(session,REC);
+    if (r!=0) { // its a regular response - line is alive, heartbeat response will come later and be ignored
+            return r;
+    }
+// it may be heart-beat response that has been received, or we may just have timed out
+    if (session->heartbeat_req_in_flight) { // its not been reset, nothing received, line has gone dead
+        session->status=TLS13_DISCONNECTED;
+        return TIME_OUT;
+    }
+    return 0; // its alive, but nothing has been received. This parrot is not dead, its just resting.
+}
+
+// clean up buffers, kill crypto keys
+void TLS13_clean(TLS_session *session)
+{
+    OCT_kill(&session->IBUFF);
+    OCT_kill(&session->OBUFF);
+    OCT_kill(&session->CTS);
+    OCT_kill(&session->STS);
+    OCT_kill(&session->RMS);
+    OCT_kill(&session->HS);
+    initCryptoContext(&session->K_send);
+    initCryptoContext(&session->K_recv);
+    session->status=TLS13_DISCONNECTED;
+}
+
+void TLS13_stop(TLS_session *session)
+{
+    sendAlert(session,CLOSE_NOTIFY);
+}
+
+void TLS13_end(TLS_session *session)
+{    
+    TLS13_clean(session);
+    endTicketContext(&session->T);
+#ifdef SHALLOW_STACK
+    free(session->IBUFF.val);
+    free(session->OBUFF.val);
+#endif
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/lib/tls_sal.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/lib/tls_sal.cpp
new file mode 100644
index 0000000..34eac1e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/lib/tls_sal.cpp
@@ -0,0 +1,1707 @@
+/*
+* JS update 14.04.2024
+* Pridana podpora pre algoritmy ML-KEM a ML-DSA
+* Testovane s novou verziou liboqs 0.10.0
+*/
+
+/*
+* JS update 29.02.2024
+* Pridanie kniznice liboqs, nahradenie funkcii z miracl core
+* Pouzitie generatoru (pseudo)nahodnych cisel z kniznice liboqs
+* Uprava funkcii, ktore priamo vyuzivaju pole s vygenerovanymi cislami
+* Definovanie novych PQ KEM algoritmov do zoznamu
+* Pridane nove PQ algoritmy pre certifikaty a podpis
+* Pridane funkcie pre generovanie sukromneho a verejneho kluca pre KEM protokoly
+* Pridane funkcie na decapsulaciu pre KEM protokoly
+* Pridane funkcii na overenie a podpis novymi PQ algoritmami
+*/
+
+// JS update
+// Cryptographic Security Abstraction Layer API - this version uses MIRACL core & liboqs functions
+//
+
+#include "tls_sal.h"
+
+// Pull in MIRACL core code
+
+#include "core.h"
+#include "ecdh_NIST256.h"  
+#include "ecdh_NIST384.h"
+#include "ecdh_C25519.h"
+#include "rsa_RSA2048.h"
+#include "rsa_RSA4096.h"
+#include "eddsa_Ed25519.h"
+#include "eddsa_Ed448.h"
+#if CRYPTO_SETTING>=POST_QUANTUM
+// JS post-kvantove algoritmy pridane z kniznice liboqs
+#include <oqs/oqs.h>
+#include <oqs/oqsconfig.h>
+#endif
+
+using namespace core;
+
+csprng RNG;    // Global miracl core Crypto Strong RNG - could be a hardware source
+
+// JS definovanie pola pre vygenerovanie 64 nahodnych cisel pouzitych ako seed pre RNG
+uint8_t RNGseed[64];
+
+// JS pridanie liboqs do vypisu
+char* SAL_name()
+{
+    return (char *)"MIRACL Core + liboqs"; 
+}
+
+// JS pole naplnene nahodne vygenerovanymi cislami a pouzite ako seed pre RNG generator
+bool SAL_initLib()
+{ // Initialise library
+    OQS_randombytes(RNGseed, 64);
+    RAND_seed(&RNG, 64, (char*) RNGseed);    
+    return true;
+}
+
+void SAL_endLib()
+{
+}
+
+int SAL_ciphers(int *ciphers)
+{
+    int n=2;
+    ciphers[0]=TLS_AES_128_GCM_SHA256;
+    ciphers[1]=TLS_AES_256_GCM_SHA384;
+    return n;
+}
+
+// IMPORTANT - Favourite group (as used in client Hello) must be placed first in list
+int SAL_groups(int *groups)
+{
+    int n=0;
+
+#if CRYPTO_SETTING==TINY_ECC || CRYPTO_SETTING==EDDSA
+    n=3;
+    groups[0]=X25519;
+    groups[1]=SECP256R1;
+    groups[2]=SECP384R1;
+#endif
+
+#if CRYPTO_SETTING==TYPICAL
+    n=3;
+    groups[0]=X25519;
+    groups[1]=SECP256R1;
+    groups[2]=SECP384R1;
+#endif
+
+// JS doplnene PQ KEM algoritmy
+// BIKE nefunguje na Windowse, preto je jeho pridanie do zoznamu podmienene linuxovym prostredim
+#if CRYPTO_SETTING==POST_QUANTUM
+    n=0;
+   	groups[n]=KYBER512; n++;
+	groups[n]=KYBER768; n++;
+	groups[n]=KYBER1024; n++;
+    groups[n]=MLKEM512; n++;
+    groups[n]=MLKEM768; n++;
+    groups[n]=MLKEM1024; n++;
+	groups[n]=HQC128; n++;
+	groups[n]=HQC192; n++;
+	groups[n]=HQC256; n++;
+	groups[n]=FRODO640AES; n++;
+	groups[n]=FRODO640SHAKE; n++;
+	groups[n]=FRODO976AES; n++;
+	groups[n]=FRODO976SHAKE; n++;
+	groups[n]=FRODO1344AES; n++;
+	groups[n]=FRODO1344SHAKE; n++;
+#ifdef __linux__
+	groups[n]=BIKEL1; n++;
+	groups[n]=BIKEL3; n++;
+	groups[n]=BIKEL5; n++;
+#endif
+
+#endif
+
+    return n;
+}
+
+int SAL_sigs(int *sigAlgs)
+{
+    int n=4;
+    sigAlgs[0]=ECDSA_SECP256R1_SHA256;
+    sigAlgs[1]=ECDSA_SECP384R1_SHA384;
+    sigAlgs[2]=ED25519;
+    sigAlgs[3]=ED448;
+#if CRYPTO_SETTING>TINY_ECC
+    sigAlgs[n]=RSA_PSS_RSAE_SHA256; n++;
+#endif
+
+// JS doplnene PQ algoritmy
+#if CRYPTO_SETTING>=POST_QUANTUM
+	sigAlgs[n]=DILITHIUM2; n++;
+    sigAlgs[n]=DILITHIUM3; n++;
+	sigAlgs[n]=DILITHIUM5; n++;
+    sigAlgs[n]=MLDSA44; n++;
+    sigAlgs[n]=MLDSA65; n++;
+    sigAlgs[n]=MLDSA87; n++;
+    sigAlgs[n]=FALCON512; n++;
+    sigAlgs[n]=FALCON1024; n++;
+    sigAlgs[n]=SPHINCSSHA2128FSIMPLE; n++;
+    sigAlgs[n]=SPHINCSSHA2128SSIMPLE; n++; 
+    sigAlgs[n]=SPHINCSSHAKE128FSIMPLE; n++;
+    //sigAlgs[n]=SPHINCSSHA2192FSIMPLE; n++;
+#endif
+    return n;
+}
+
+int SAL_sigCerts(int *sigAlgsCert)
+{
+    int n=4;
+    sigAlgsCert[0]=ECDSA_SECP256R1_SHA256;
+    sigAlgsCert[1]=ECDSA_SECP384R1_SHA384;
+    sigAlgsCert[2]=ED25519;
+    sigAlgsCert[3]=ED448;
+#if CRYPTO_SETTING>TINY_ECC
+    sigAlgsCert[n]=RSA_PKCS1_SHA256; n++;
+    sigAlgsCert[n]=RSA_PKCS1_SHA384; n++;
+    sigAlgsCert[n]=RSA_PKCS1_SHA512; n++;
+#endif
+
+// JS doplnene PQ algoritmy
+#if CRYPTO_SETTING>=POST_QUANTUM
+    sigAlgsCert[n]=DILITHIUM2; n++;
+    sigAlgsCert[n]=DILITHIUM3; n++;
+    sigAlgsCert[n]=DILITHIUM5; n++;
+    sigAlgsCert[n]=MLDSA44; n++;
+    sigAlgsCert[n]=MLDSA65; n++;
+    sigAlgsCert[n]=MLDSA87; n++;
+    sigAlgsCert[n]=FALCON512; n++;
+    sigAlgsCert[n]=FALCON1024; n++;
+    sigAlgsCert[n]=SPHINCSSHA2128FSIMPLE; n++;
+    sigAlgsCert[n]=SPHINCSSHA2128SSIMPLE; n++;
+    sigAlgsCert[n]=SPHINCSSHAKE128FSIMPLE; n++;
+    //sigAlgsCert[n]=SPHINCSSHA2192FSIMPLE; n++;
+#endif
+    return n;
+}
+
+// return hashtype from cipher_suite
+int SAL_hashType(int cipher_suite)
+{
+    int htype=0;  
+    if (cipher_suite==TLS_AES_128_GCM_SHA256) htype=TLS_SHA256_T;
+    if (cipher_suite==TLS_AES_256_GCM_SHA384) htype=TLS_SHA384_T;
+    if (cipher_suite==TLS_CHACHA20_POLY1305_SHA256) htype=TLS_SHA256_T;
+    return htype;
+}
+
+/*
+// return hashtype from signature algorithm
+int SAL_hashTypeSig(int sigAlg)
+{
+    int htype=0;  
+    if (sigAlg==ECDSA_SECP256R1_SHA256) htype=TLS_SHA256_T;
+    if (sigAlg==ECDSA_SECP384R1_SHA384) htype=TLS_SHA384_T;
+    if (sigAlg==RSA_PSS_RSAE_SHA256) htype=TLS_SHA256_T;
+    if (sigAlg==RSA_PSS_RSAE_SHA384) htype=TLS_SHA384_T;
+    if (sigAlg==RSA_PSS_RSAE_SHA512) htype=TLS_SHA512_T;
+    if (sigAlg==RSA_PKCS1_SHA256) htype=TLS_SHA256_T;
+    if (sigAlg==RSA_PKCS1_SHA384) htype=TLS_SHA384_T;
+    if (sigAlg==RSA_PKCS1_SHA512) htype=TLS_SHA512_T;
+    return htype;
+}
+*/ 
+// return hash length from hash type
+int SAL_hashLen(int hash_type)
+{
+    int hlen=0;
+    if (hash_type==TLS_SHA256_T) hlen=32;
+    if (hash_type==TLS_SHA384_T) hlen=48;
+    if (hash_type==TLS_SHA512_T) hlen=64;
+    return hlen;
+}
+
+int SAL_aeadKeylen(int cipher_suite)
+{
+    int klen=0;
+    if (cipher_suite==TLS_AES_128_GCM_SHA256) klen=16;
+    if (cipher_suite==TLS_AES_256_GCM_SHA384) klen=32;
+    if (cipher_suite==TLS_CHACHA20_POLY1305_SHA256) klen=32;
+    return klen;
+}
+
+int SAL_aeadTaglen(int cipher_suite)
+{
+    int tlen=0;
+    if (cipher_suite==TLS_AES_128_GCM_SHA256) tlen=16;
+    if (cipher_suite==TLS_AES_256_GCM_SHA384) tlen=16;
+    if (cipher_suite==TLS_CHACHA20_POLY1305_SHA256) tlen=16;
+    return tlen;
+}
+
+// convert TLS octad to MIRACL core octet
+static octet octad_to_octet(octad *x)
+{
+    octet y;
+    if (x!=NULL) {
+        y.len=x->len;
+        y.max=x->max;
+        y.val=x->val;
+    } else {
+        y.len=y.max=0;
+        y.val=NULL;
+    }
+    return y;
+}
+
+// Return a random byte
+int SAL_randomByte()
+{
+    return RAND_byte(&RNG);
+}
+
+// Fill an octad with random values
+void SAL_randomOctad(int len,octad *R)
+{
+    for (int i=0;i<len;i++)
+        R->val[i]=SAL_randomByte();
+    R->len=len;
+}
+
+// HKDF - Extract secret from raw input
+void SAL_hkdfExtract(int htype,octad *PRK,octad *SALT,octad *IKM)
+{
+    int hlen=SAL_hashLen(htype);
+    octet MC_PRK=octad_to_octet(PRK);   // Make it MIRACL core compatible
+    octet MC_SALT=octad_to_octet(SALT);
+    octet MC_IKM=octad_to_octet(IKM);
+
+    HKDF_Extract(MC_SHA2,hlen,&MC_PRK,&MC_SALT,&MC_IKM);
+
+    IKM->len=MC_IKM.len;              // restore length
+    SALT->len=MC_SALT.len;
+    PRK->len=MC_PRK.len;
+}
+
+void SAL_hkdfExpand(int htype, int olen, octad *OKM,octad *PRK, octad *INFO)
+{
+    int hlen=SAL_hashLen(htype);
+    octet MC_OKM=octad_to_octet(OKM); 
+    octet MC_INFO=octad_to_octet(INFO);
+    octet MC_PRK=octad_to_octet(PRK);
+
+    HKDF_Expand(MC_SHA2,hlen,&MC_OKM,olen,&MC_PRK,&MC_INFO);
+
+    OKM->len=MC_OKM.len;
+    INFO->len=MC_INFO.len;
+    PRK->len=MC_PRK.len;
+}
+
+// HMAC
+void SAL_hmac(int htype,octad *T,octad *K,octad *M)
+{
+    int hlen=SAL_hashLen(htype);
+    octet MC_T=octad_to_octet(T);
+    octet MC_K=octad_to_octet(K);
+    octet MC_M=octad_to_octet(M);
+
+    HMAC(MC_SHA2,hlen,&MC_T,hlen,&MC_K,&MC_M);
+
+    T->len=MC_T.len;
+    K->len=MC_K.len;
+    M->len=MC_M.len;
+}
+
+// HASH of NULL
+void SAL_hashNull(int htype,octad *H)
+{
+    if (htype==TLS_SHA256_T)
+    {
+        core::hash256 sh;
+        HASH256_init(&sh);
+        HASH256_hash(&sh,H->val);
+    } 
+    if (htype==TLS_SHA384_T)
+    {
+        core::hash384 sh;
+        HASH384_init(&sh);
+        HASH384_hash(&sh,H->val);
+    }     
+    if (htype==TLS_SHA512_T)
+    {
+        core::hash512 sh;
+        HASH512_init(&sh);
+        HASH512_hash(&sh,H->val);
+
+    }     
+    H->len=SAL_hashLen(htype);
+    return;    
+}
+
+// Unified hashing. Hash type type indicate by htype.
+void SAL_hashInit(int htype,unihash *h)
+{
+    if (htype==TLS_SHA256_T) 
+        HASH256_init((core::hash256*)&(h->state));
+    if (htype==TLS_SHA384_T)
+        HASH384_init((core::hash512*)&(h->state));
+    if (htype==TLS_SHA512_T)
+        HASH512_init((core::hash512*)&(h->state));
+    h->htype=htype;
+}
+
+// Process a byte array
+void SAL_hashProcessArray(unihash *h,char *b,int len)
+{
+    int i;
+    if (h->htype==TLS_SHA256_T)
+    {
+        for (i=0;i<len;i++)
+            HASH256_process((core::hash256*)&(h->state),b[i]);   
+    }   
+    if (h->htype==TLS_SHA384_T)
+    {
+        for (i=0;i<len;i++)
+            HASH384_process((core::hash512*)&(h->state),b[i]);   
+    }  
+    if (h->htype==TLS_SHA512_T)
+    {
+        for (i=0;i<len;i++)
+            HASH512_process((core::hash512*)&(h->state),b[i]);   
+    }     
+}
+
+// output digest
+int SAL_hashOutput(unihash *h,char *d)
+{
+    int hlen=SAL_hashLen(h->htype);
+    if (h->htype==TLS_SHA256_T)
+        HASH256_continuing_hash((core::hash256*)&(h->state),d);
+    if (h->htype==TLS_SHA384_T)
+        HASH384_continuing_hash((core::hash384*)&(h->state),d);
+    if (h->htype==TLS_SHA512_T)
+        HASH512_continuing_hash((core::hash512*)&(h->state),d);
+    return hlen;
+}
+
+void SAL_aeadEncrypt(crypto *send,int hdrlen,char *hdr,int ptlen,char *pt,octad *TAG)
+{ // AEAD encryption
+  // its AES-GCM
+    gcm g;
+    GCM_init(&g,send->K.len,send->K.val,12,send->IV.val);  // Encrypt with Key and IV
+    GCM_add_header(&g,hdr,hdrlen);
+    GCM_add_plain(&g,pt,pt,ptlen);
+//create and append TA
+    GCM_finish(&g,TAG->val); 
+    TAG->len=16;
+}
+
+bool SAL_aeadDecrypt(crypto *recv,int hdrlen,char *hdr,int ctlen,char *ct,octad *TAG)
+{ // AEAD decryption
+  // its AES-GCM
+    char ctag[TLS_MAX_TAG_SIZE];   // calculated TAG
+    octad CTAG={0,sizeof(ctag),ctag};
+    gcm g;
+    GCM_init(&g,recv->K.len,recv->K.val,12,recv->IV.val);  // Decrypt with Key and IV
+    GCM_add_header(&g,hdr,hdrlen);
+    GCM_add_cipher(&g,ct,ct,ctlen);
+//create and append TA
+    GCM_finish(&g,CTAG.val); CTAG.len=16;
+    if (!OCT_compare(TAG,&CTAG))
+        return false;
+    return true;
+}
+
+// generate a public/private key pair in an approved group for a key exchange
+void SAL_generateKeyPair(int group,octad *SK,octad *PK)
+{
+    octet MC_SK=octad_to_octet(SK);
+    octet MC_PK=octad_to_octet(PK);
+
+    if (group==X25519)
+    { // Note that this program maintains the private key in big-endian format
+      // But X25519 assumes private and public keys are all in little-endian form (and are transmitted/received in that form)
+        SAL_randomOctad(32,SK);
+        SK->val[31]&=248;  
+        SK->val[0]&=127;
+        SK->val[0]|=64;
+        C25519::ECP_KEY_PAIR_GENERATE(NULL, &MC_SK, &MC_PK);
+        OCT_reverse(&MC_PK);  // public key must be transmitted in little-endian form
+    }
+    if (group==SECP256R1)
+    {
+        SAL_randomOctad(32,SK);
+        NIST256::ECP_KEY_PAIR_GENERATE(NULL, &MC_SK, &MC_PK);
+    }
+    if (group==SECP384R1)
+    {
+        SAL_randomOctad(48,SK);
+        NIST384::ECP_KEY_PAIR_GENERATE(NULL, &MC_SK, &MC_PK);
+    }
+	SK->len=MC_SK.len;
+    	PK->len=MC_PK.len;
+
+//--------------------------------------------------------------------------
+// JS doplnene PQ KEM algoritmy 
+#if CRYPTO_SETTING>=POST_QUANTUM
+    if (group==KYBER768){
+        OQS_STATUS rc = OQS_KEM_kyber_768_keypair((uint8_t*) PK->val, (uint8_t*) SK->val);
+	    if (rc != OQS_SUCCESS) {
+		    fprintf(stderr, "ERROR: OQS_KEM_kyber_768_keypair failed!\n");
+            SK->len=0;
+            PK->len=0;
+        }
+        else{
+            SK->len=OQS_KEM_kyber_768_length_secret_key;
+            PK->len=OQS_KEM_kyber_768_length_public_key;
+        }
+    }
+
+    if (group==KYBER512){
+        OQS_STATUS rc = OQS_KEM_kyber_512_keypair((uint8_t*) PK->val, (uint8_t*) SK->val);
+	    if (rc != OQS_SUCCESS) {
+		    fprintf(stderr, "ERROR: OQS_KEM_kyber_512_keypair failed!\n");
+            SK->len=0;
+            PK->len=0;
+        }
+        else{
+            SK->len=OQS_KEM_kyber_512_length_secret_key;
+            PK->len=OQS_KEM_kyber_512_length_public_key;
+        }
+    }
+
+    if (group==KYBER1024){
+        OQS_STATUS rc = OQS_KEM_kyber_1024_keypair((uint8_t*) PK->val, (uint8_t*) SK->val);
+	    if (rc != OQS_SUCCESS) {
+		    fprintf(stderr, "ERROR: OQS_KEM_kyber_1024_keypair failed!\n");
+            SK->len=0;
+            PK->len=0;
+        }
+        else{
+            SK->len=OQS_KEM_kyber_1024_length_secret_key;
+            PK->len=OQS_KEM_kyber_1024_length_public_key;
+        }
+    }
+
+    if (group==MLKEM512){
+        OQS_STATUS rc = OQS_KEM_ml_kem_512_keypair((uint8_t*) PK->val, (uint8_t*) SK->val);
+	    if (rc != OQS_SUCCESS) {
+		    fprintf(stderr, "ERROR: OQS_KEM_ml_kem_512_keypair failed!\n");
+            SK->len=0;
+            PK->len=0;
+        }
+        else{
+            SK->len=OQS_KEM_ml_kem_512_length_secret_key;
+            PK->len=OQS_KEM_ml_kem_512_length_public_key;
+        }
+    }
+
+    if (group==MLKEM768){
+        OQS_STATUS rc = OQS_KEM_ml_kem_768_keypair((uint8_t*) PK->val, (uint8_t*) SK->val);
+	    if (rc != OQS_SUCCESS) {
+		    fprintf(stderr, "ERROR: OQS_KEM_ml_kem_768_keypair failed!\n");
+            SK->len=0;
+            PK->len=0;
+        }
+        else{
+            SK->len=OQS_KEM_ml_kem_768_length_secret_key;
+            PK->len=OQS_KEM_ml_kem_768_length_public_key;
+        }
+    }
+
+    if (group==MLKEM1024){
+        OQS_STATUS rc = OQS_KEM_ml_kem_1024_keypair((uint8_t*) PK->val, (uint8_t*) SK->val);
+	    if (rc != OQS_SUCCESS) {
+		    fprintf(stderr, "ERROR: OQS_KEM_ml_kem_1024_keypair failed!\n");
+            SK->len=0;
+            PK->len=0;
+        }
+        else{
+            SK->len=OQS_KEM_ml_kem_1024_length_secret_key;
+            PK->len=OQS_KEM_ml_kem_1024_length_public_key;
+        }
+    }
+
+// JS Protokol BIKE nie je podporovany na Windowse, preto je definovany len pre linuxove prostredie
+// Bez podmienky aplikacia na Windowse padne, pretoze liboqs na Windowse neobsahuje funkcie pre BIKE
+#ifdef __linux__
+    if (group==BIKEL1){
+        OQS_STATUS rc = OQS_KEM_bike_l1_keypair((uint8_t*) PK->val, (uint8_t*) SK->val);
+	    if (rc != OQS_SUCCESS) {
+		    fprintf(stderr, "ERROR: OQS_KEM_bike_l1_keypair failed!\n");
+            SK->len=0;
+            PK->len=0;
+        }
+        else{
+            SK->len=OQS_KEM_bike_l1_length_secret_key;
+            PK->len=OQS_KEM_bike_l1_length_public_key;
+        }
+    }
+
+    if (group==BIKEL3){
+        OQS_STATUS rc = OQS_KEM_bike_l3_keypair((uint8_t*) PK->val, (uint8_t*) SK->val);
+	    if (rc != OQS_SUCCESS) {
+		    fprintf(stderr, "ERROR: OQS_KEM_bike_l3_keypair failed!\n");
+            SK->len=0;
+            PK->len=0;
+        }
+        else{
+            SK->len=OQS_KEM_bike_l3_length_secret_key;
+            PK->len=OQS_KEM_bike_l3_length_public_key;
+        }
+    }
+
+    if (group==BIKEL5){
+        OQS_STATUS rc = OQS_KEM_bike_l5_keypair((uint8_t*) PK->val, (uint8_t*) SK->val);
+	    if (rc != OQS_SUCCESS) {
+		    fprintf(stderr, "ERROR: OQS_KEM_bike_l5_keypair failed!\n");
+            SK->len=0;
+            PK->len=0;
+        }
+        else{
+            SK->len=OQS_KEM_bike_l5_length_secret_key;
+            PK->len=OQS_KEM_bike_l5_length_public_key;
+        }
+    }
+#endif
+
+    if (group==HQC128){
+        OQS_STATUS rc = OQS_KEM_hqc_128_keypair((uint8_t*) PK->val, (uint8_t*) SK->val);
+	    if (rc != OQS_SUCCESS) {
+		    fprintf(stderr, "ERROR: OQS_KEM_hqc_128_keypair failed!\n");
+            SK->len=0;
+            PK->len=0;
+        }
+        else{
+            SK->len=OQS_KEM_hqc_128_length_secret_key;
+            PK->len=OQS_KEM_hqc_128_length_public_key;
+        }
+    }
+
+    if (group==HQC192){
+        OQS_STATUS rc = OQS_KEM_hqc_192_keypair((uint8_t*) PK->val, (uint8_t*) SK->val);
+	    if (rc != OQS_SUCCESS) {
+		    fprintf(stderr, "ERROR: OQS_KEM_hqc_192_keypair failed!\n");
+            SK->len=0;
+            PK->len=0;
+        }
+        else{
+            SK->len=OQS_KEM_hqc_192_length_secret_key;
+            PK->len=OQS_KEM_hqc_192_length_public_key;
+        }
+    }
+
+   if (group==HQC256){
+        OQS_STATUS rc = OQS_KEM_hqc_256_keypair((uint8_t*) PK->val, (uint8_t*) SK->val);
+	    if (rc != OQS_SUCCESS) {
+		    fprintf(stderr, "ERROR: OQS_KEM_hqc_256_keypair failed!\n");
+            SK->len=0;
+            PK->len=0;
+        }
+        else{
+            SK->len=OQS_KEM_hqc_256_length_secret_key;
+            PK->len=OQS_KEM_hqc_256_length_public_key;
+        }
+    }
+
+   if (group==FRODO640AES){
+        OQS_STATUS rc = OQS_KEM_frodokem_640_aes_keypair((uint8_t*) PK->val, (uint8_t*) SK->val);
+	    if (rc != OQS_SUCCESS) {
+		    fprintf(stderr, "ERROR: OQS_KEM_frodokem_640_aes_keypair failed!\n");
+            SK->len=0;
+            PK->len=0;
+        }
+        else{
+            SK->len=OQS_KEM_frodokem_640_aes_length_secret_key;
+            PK->len=OQS_KEM_frodokem_640_aes_length_public_key;
+        }
+    }
+
+   if (group==FRODO976AES){
+        OQS_STATUS rc = OQS_KEM_frodokem_976_aes_keypair((uint8_t*) PK->val, (uint8_t*) SK->val);
+	    if (rc != OQS_SUCCESS) {
+		    fprintf(stderr, "ERROR: OQS_KEM_frodokem_976_aes_keypair failed!\n");
+            SK->len=0;
+            PK->len=0;
+        }
+        else{
+            SK->len=OQS_KEM_frodokem_976_aes_length_secret_key;
+            PK->len=OQS_KEM_frodokem_976_aes_length_public_key;
+        }
+    }
+
+   if (group==FRODO1344AES){
+        OQS_STATUS rc = OQS_KEM_frodokem_1344_aes_keypair((uint8_t*) PK->val, (uint8_t*) SK->val);
+	    if (rc != OQS_SUCCESS) {
+		    fprintf(stderr, "ERROR: OQS_KEM_frodokem_1344_aes_keypair failed!\n");
+            SK->len=0;
+            PK->len=0;
+        }
+        else{
+            SK->len=OQS_KEM_frodokem_1344_aes_length_secret_key;
+            PK->len=OQS_KEM_frodokem_1344_aes_length_public_key;
+        }
+    }
+
+
+   if (group==FRODO640SHAKE){
+        OQS_STATUS rc = OQS_KEM_frodokem_640_shake_keypair((uint8_t*) PK->val, (uint8_t*) SK->val);
+	    if (rc != OQS_SUCCESS) {
+		    fprintf(stderr, "ERROR: OQS_KEM_frodokem_640_shake_keypair failed!\n");
+            SK->len=0;
+            PK->len=0;
+        }
+        else{
+            SK->len=OQS_KEM_frodokem_640_shake_length_secret_key;
+            PK->len=OQS_KEM_frodokem_640_shake_length_public_key;
+        }
+    }
+
+   if (group==FRODO976SHAKE){
+        OQS_STATUS rc = OQS_KEM_frodokem_976_shake_keypair((uint8_t*) PK->val, (uint8_t*) SK->val);
+	    if (rc != OQS_SUCCESS) {
+		    fprintf(stderr, "ERROR: OQS_KEM_frodokem_976_shake_keypair failed!\n");
+            SK->len=0;
+            PK->len=0;
+        }
+        else{
+            SK->len=OQS_KEM_frodokem_976_shake_length_secret_key;
+            PK->len=OQS_KEM_frodokem_976_shake_length_public_key;
+        }
+    }
+
+   if (group==FRODO1344SHAKE){
+        OQS_STATUS rc = OQS_KEM_frodokem_1344_shake_keypair((uint8_t*) PK->val, (uint8_t*) SK->val);
+	    if (rc != OQS_SUCCESS) {
+		    fprintf(stderr, "ERROR: OQS_KEM_frodokem_1344_shake_keypair failed!\n");
+            SK->len=0;
+            PK->len=0;
+        }
+        else{
+            SK->len=OQS_KEM_frodokem_1344_shake_length_secret_key;
+            PK->len=OQS_KEM_frodokem_1344_shake_length_public_key;		
+        }
+    }
+//--------------------------------------------------------------------------
+
+#endif
+}
+
+// generate shared secret SS from secret key SK and public key PK
+bool SAL_generateSharedSecret(int group,octad *SK,octad *PK,octad *SS)
+{
+    octet MC_SK=octad_to_octet(SK);
+    octet MC_PK=octad_to_octet(PK);
+    octet MC_SS=octad_to_octet(SS);
+    int res=0;
+
+    if (group==X25519) {
+        OCT_reverse(&MC_PK); // to big endian
+        res=C25519::ECP_SVDP_DH(&MC_SK, &MC_PK, &MC_SS,0);
+        OCT_reverse(&MC_PK); // back again
+        OCT_reverse(&MC_SS);
+    }
+    if (group==SECP256R1) {
+        res=NIST256::ECP_SVDP_DH(&MC_SK, &MC_PK, &MC_SS,0);
+    }
+    if (group==SECP384R1) {
+        res=NIST384::ECP_SVDP_DH(&MC_SK, &MC_PK, &MC_SS,0);
+    }
+    SK->len=MC_SK.len;
+    PK->len=MC_PK.len;
+    SS->len=MC_SS.len;
+
+//--------------------------------------------------------------------------
+// JS doplnene PQ KEM algoritmy
+// Zo strany klienta je pri KEM protokole realizovana len decapsulacia
+#if CRYPTO_SETTING>=POST_QUANTUM
+    if (group==KYBER768) {
+        OQS_STATUS rc = OQS_KEM_kyber_768_decaps( (uint8_t*) SS->val, (uint8_t*) PK->val, (uint8_t*) SK->val);
+    	if (rc != OQS_SUCCESS) {
+	    	fprintf(stderr, "ERROR: OQS_KEM_kyber_768_decaps failed!\n");
+            SS->len=0;
+        }
+        else{
+            SK->len=OQS_KEM_kyber_768_length_secret_key;
+            PK->len=OQS_KEM_kyber_768_length_ciphertext;
+            SS->len=OQS_KEM_kyber_768_length_shared_secret;
+        }
+    }
+if (group==KYBER512) {
+        OQS_STATUS rc = OQS_KEM_kyber_512_decaps( (uint8_t*) SS->val, (uint8_t*) PK->val, (uint8_t*) SK->val);
+    	if (rc != OQS_SUCCESS) {
+	    	fprintf(stderr, "ERROR: OQS_KEM_kyber_512_decaps failed!\n");
+            SS->len=0;
+        }
+        else{
+            SK->len=OQS_KEM_kyber_512_length_secret_key;
+            PK->len=OQS_KEM_kyber_512_length_ciphertext;
+            SS->len=OQS_KEM_kyber_512_length_shared_secret;
+        }
+    }
+if (group==KYBER1024) {
+        OQS_STATUS rc = OQS_KEM_kyber_1024_decaps( (uint8_t*) SS->val, (uint8_t*) PK->val, (uint8_t*) SK->val);
+    	if (rc != OQS_SUCCESS) {
+	    	fprintf(stderr, "ERROR: OQS_KEM_kyber_1024_decaps failed!\n");
+            SS->len=0;
+        }
+        else{
+            SK->len=OQS_KEM_kyber_1024_length_secret_key;
+            PK->len=OQS_KEM_kyber_1024_length_ciphertext;
+            SS->len=OQS_KEM_kyber_1024_length_shared_secret;
+        }
+    }
+
+if (group==MLKEM512) {
+        OQS_STATUS rc = OQS_KEM_ml_kem_512_decaps( (uint8_t*) SS->val, (uint8_t*) PK->val, (uint8_t*) SK->val);
+    	if (rc != OQS_SUCCESS) {
+	    	fprintf(stderr, "ERROR: OQS_KEM_ml_kem_512_decaps failed!\n");
+            SS->len=0;
+        }
+        else{
+            SK->len=OQS_KEM_ml_kem_512_length_secret_key;
+            PK->len=OQS_KEM_ml_kem_512_length_ciphertext;
+            SS->len=OQS_KEM_ml_kem_512_length_shared_secret;
+        }
+    }
+
+if (group==MLKEM768) {
+        OQS_STATUS rc = OQS_KEM_ml_kem_768_decaps( (uint8_t*) SS->val, (uint8_t*) PK->val, (uint8_t*) SK->val);
+    	if (rc != OQS_SUCCESS) {
+	    	fprintf(stderr, "ERROR: OQS_KEM_ml_kem_768_decaps failed!\n");
+            SS->len=0;
+        }
+        else{
+            SK->len=OQS_KEM_ml_kem_768_length_secret_key;
+            PK->len=OQS_KEM_ml_kem_768_length_ciphertext;
+            SS->len=OQS_KEM_ml_kem_768_length_shared_secret;
+        }
+    }
+
+if (group==MLKEM1024) {
+        OQS_STATUS rc = OQS_KEM_ml_kem_1024_decaps( (uint8_t*) SS->val, (uint8_t*) PK->val, (uint8_t*) SK->val);
+    	if (rc != OQS_SUCCESS) {
+	    	fprintf(stderr, "ERROR: OQS_KEM_ml_kem_1024_decaps failed!\n");
+            SS->len=0;
+        }
+        else{
+            SK->len=OQS_KEM_ml_kem_1024_length_secret_key;
+            PK->len=OQS_KEM_ml_kem_1024_length_ciphertext;
+            SS->len=OQS_KEM_ml_kem_1024_length_shared_secret;
+        }
+    }
+
+// JS Protokol BIKE nie je podporovany na Windowse, preto je definovany len pre linuxove prostredie
+// Bez podmienky aplikacia na Windowse padne, pretoze liboqs na Windowse neobsahuje funkcie pre BIKE
+#ifdef __linux__
+if (group==BIKEL1) {
+        OQS_STATUS rc = OQS_KEM_bike_l1_decaps( (uint8_t*) SS->val, (uint8_t*) PK->val, (uint8_t*) SK->val);
+    	if (rc != OQS_SUCCESS) {
+	    	fprintf(stderr, "ERROR: OQS_KEM_bike_l1_decaps failed!\n");
+            SS->len=0;
+        }
+        else{
+            SK->len=OQS_KEM_bike_l1_length_secret_key;
+            PK->len=OQS_KEM_bike_l1_length_ciphertext;
+            SS->len=OQS_KEM_bike_l1_length_shared_secret;
+        }
+    }
+
+if (group==BIKEL3) {
+        OQS_STATUS rc = OQS_KEM_bike_l3_decaps( (uint8_t*) SS->val, (uint8_t*) PK->val, (uint8_t*) SK->val);
+    	if (rc != OQS_SUCCESS) {
+	    	fprintf(stderr, "ERROR: OQS_KEM_bike_l3_decaps failed!\n");
+            SS->len=0;
+        }
+        else{
+            SK->len=OQS_KEM_bike_l3_length_secret_key;
+            PK->len=OQS_KEM_bike_l3_length_ciphertext;
+            SS->len=OQS_KEM_bike_l3_length_shared_secret;
+        }
+    }
+
+if (group==BIKEL5) {
+        OQS_STATUS rc = OQS_KEM_bike_l5_decaps( (uint8_t*) SS->val, (uint8_t*) PK->val, (uint8_t*) SK->val);
+    	if (rc != OQS_SUCCESS) {
+	    	fprintf(stderr, "ERROR: OQS_KEM_bike_l5_decaps failed!\n");
+            SS->len=0;
+        }
+        else{
+            SK->len=OQS_KEM_bike_l5_length_secret_key;
+            PK->len=OQS_KEM_bike_l5_length_ciphertext;
+            SS->len=OQS_KEM_bike_l5_length_shared_secret;
+        }
+    }
+#endif
+
+if (group==HQC128) {
+        OQS_STATUS rc = OQS_KEM_hqc_128_decaps( (uint8_t*) SS->val, (uint8_t*) PK->val, (uint8_t*) SK->val);
+    	if (rc != OQS_SUCCESS) {
+	    	fprintf(stderr, "ERROR: OQS_KEM_hqc_128_decaps failed!\n");
+            SS->len=0;
+        }
+        else{
+            SK->len=OQS_KEM_hqc_128_length_secret_key;
+            PK->len=OQS_KEM_hqc_128_length_ciphertext;
+            SS->len=OQS_KEM_hqc_128_length_shared_secret;
+        }
+    }
+
+if (group==HQC192) {
+        OQS_STATUS rc = OQS_KEM_hqc_192_decaps( (uint8_t*) SS->val, (uint8_t*) PK->val, (uint8_t*) SK->val);
+    	if (rc != OQS_SUCCESS) {
+	    	fprintf(stderr, "ERROR: OQS_KEM_hqc_192_decaps failed!\n");
+            SS->len=0;
+        }
+        else{
+            SK->len=OQS_KEM_hqc_192_length_secret_key;
+            PK->len=OQS_KEM_hqc_192_length_ciphertext;
+            SS->len=OQS_KEM_hqc_192_length_shared_secret;
+        }
+    }
+
+if (group==HQC256) {
+        OQS_STATUS rc = OQS_KEM_hqc_256_decaps( (uint8_t*) SS->val, (uint8_t*) PK->val, (uint8_t*) SK->val);
+    	if (rc != OQS_SUCCESS) {
+	    	fprintf(stderr, "ERROR: OQS_KEM_hqc_256_decaps failed!\n");
+            SS->len=0;
+        }
+        else{
+            SK->len=OQS_KEM_hqc_256_length_secret_key;
+            PK->len=OQS_KEM_hqc_256_length_ciphertext;
+            SS->len=OQS_KEM_hqc_256_length_shared_secret;
+        }
+    }
+
+if (group==FRODO640AES) {
+        OQS_STATUS rc = OQS_KEM_frodokem_640_aes_decaps( (uint8_t*) SS->val, (uint8_t*) PK->val, (uint8_t*) SK->val);
+    	if (rc != OQS_SUCCESS) {
+	    	fprintf(stderr, "ERROR: OQS_KEM_frodokem_640_aes_decaps failed!\n");
+            SS->len=0;
+        }
+        else{
+            SK->len=OQS_KEM_frodokem_640_aes_length_secret_key;
+            PK->len=OQS_KEM_frodokem_640_aes_length_ciphertext;
+            SS->len=OQS_KEM_frodokem_640_aes_length_shared_secret;
+        }
+    }
+
+if (group==FRODO976AES) {
+        OQS_STATUS rc = OQS_KEM_frodokem_976_aes_decaps( (uint8_t*) SS->val, (uint8_t*) PK->val, (uint8_t*) SK->val);
+    	if (rc != OQS_SUCCESS) {
+	    	fprintf(stderr, "ERROR: OQS_KEM_frodokem_976_aes_decaps failed!\n");
+            SS->len=0;
+        }
+        else{
+            SK->len=OQS_KEM_frodokem_976_aes_length_secret_key;
+            PK->len=OQS_KEM_frodokem_976_aes_length_ciphertext;
+            SS->len=OQS_KEM_frodokem_976_aes_length_shared_secret;
+        }
+    }
+
+if (group==FRODO1344AES) {
+        OQS_STATUS rc = OQS_KEM_frodokem_1344_aes_decaps( (uint8_t*) SS->val, (uint8_t*) PK->val, (uint8_t*) SK->val);
+    	if (rc != OQS_SUCCESS) {
+	    	fprintf(stderr, "ERROR: OQS_KEM_frodokem_1344_aes_decaps failed!\n");
+            SS->len=0;
+        }
+        else{
+            SK->len=OQS_KEM_frodokem_1344_aes_length_secret_key;
+            PK->len=OQS_KEM_frodokem_1344_aes_length_ciphertext;
+            SS->len=OQS_KEM_frodokem_1344_aes_length_shared_secret;
+        }
+    }
+
+if (group==FRODO640SHAKE) {
+        OQS_STATUS rc = OQS_KEM_frodokem_640_shake_decaps( (uint8_t*) SS->val, (uint8_t*) PK->val, (uint8_t*) SK->val);
+    	if (rc != OQS_SUCCESS) {
+	    	fprintf(stderr, "ERROR: OQS_KEM_frodokem_640_shake_decaps failed!\n");
+            SS->len=0;
+        }
+        else{
+            SK->len=OQS_KEM_frodokem_640_shake_length_secret_key;
+            PK->len=OQS_KEM_frodokem_640_shake_length_ciphertext;
+            SS->len=OQS_KEM_frodokem_640_shake_length_shared_secret;
+        }
+    }
+
+if (group==FRODO976SHAKE) {
+        OQS_STATUS rc = OQS_KEM_frodokem_976_shake_decaps( (uint8_t*) SS->val, (uint8_t*) PK->val, (uint8_t*) SK->val);
+    	if (rc != OQS_SUCCESS) {
+	    	fprintf(stderr, "ERROR: OQS_KEM_frodokem_976_shake_decaps failed!\n");
+            SS->len=0;
+        }
+        else{
+            SK->len=OQS_KEM_frodokem_976_shake_length_secret_key;
+            PK->len=OQS_KEM_frodokem_976_shake_length_ciphertext;
+            SS->len=OQS_KEM_frodokem_976_shake_length_shared_secret;
+        }
+    }
+
+if (group==FRODO1344SHAKE) {
+        OQS_STATUS rc = OQS_KEM_frodokem_1344_shake_decaps( (uint8_t*) SS->val, (uint8_t*) PK->val, (uint8_t*) SK->val);
+    	if (rc != OQS_SUCCESS) {
+	    	fprintf(stderr, "ERROR: OQS_KEM_frodokem_1344_shake_decaps failed!\n");
+            SS->len=0;
+        }
+        else{
+            SK->len=OQS_KEM_frodokem_1344_shake_length_secret_key;
+            PK->len=OQS_KEM_frodokem_1344_shake_length_ciphertext;
+            SS->len=OQS_KEM_frodokem_1344_shake_length_shared_secret;
+        }
+    }
+//--------------------------------------------------------------------------
+#endif
+    
+// all zeros is suspect...
+    char ors=0;
+    for (int i=0;i<SS->len;i++) ors|=SS->val[i];
+    if (ors==0 || res!=0) return false;
+    return true;
+}
+
+//--------------------------------------------------------------------------
+// JS funkcie pre nove PQ algoritmy
+// Najprv funkcia pre overenie, potom funkcia pre podpis
+#if CRYPTO_SETTING>=POST_QUANTUM
+static bool DILITHIUM3_VERIFY(octad *CERT,octad *SIG,octad *PUBKEY)
+{
+    OQS_STATUS rc = OQS_SIG_dilithium_3_verify((uint8_t*) CERT->val, CERT->len, (uint8_t*) SIG->val, SIG->len, (uint8_t*) PUBKEY->val);
+	if (rc != OQS_SUCCESS) {
+		fprintf(stderr, "ERROR: OQS_SIG_dilithium_3_verify failed!\n");
+        return false;
+    }
+    return true;  
+}
+
+static void DILITHIUM3_SIGN(octad *KEY,octad *MESS,octad *SIG)
+{
+    OQS_STATUS rc = OQS_SIG_dilithium_3_sign( (uint8_t*) SIG->val, (size_t*) SIG->len, (uint8_t*) MESS->val, (size_t) MESS->len, (uint8_t*) KEY->val);
+	if (rc != OQS_SUCCESS) {
+		fprintf(stderr, "ERROR: OQS_SIG_dilithium_3_sign failed!\n");
+        SIG->len=0;
+    }
+    else{
+        SIG->len=OQS_SIG_dilithium_3_length_signature;
+    }    
+}
+
+static bool DILITHIUM2_VERIFY(octad *CERT,octad *SIG,octad *PUBKEY)
+{
+    OQS_STATUS rc = OQS_SIG_dilithium_2_verify((uint8_t*) CERT->val, CERT->len, (uint8_t*) SIG->val, SIG->len, (uint8_t*) PUBKEY->val);
+	if (rc != OQS_SUCCESS) {
+		fprintf(stderr, "ERROR: OQS_SIG_dilithium_2_verify failed!\n");
+        return false;
+    }
+    return true;  
+}
+
+static void DILITHIUM2_SIGN(octad *KEY,octad *MESS,octad *SIG)
+{
+    OQS_STATUS rc = OQS_SIG_dilithium_2_sign( (uint8_t*) SIG->val, (size_t*) SIG->len, (uint8_t*) MESS->val, (size_t) MESS->len, (uint8_t*) KEY->val);
+	if (rc != OQS_SUCCESS) {
+		fprintf(stderr, "ERROR: OQS_SIG_dilithium_2_sign failed!\n");
+        SIG->len=0;
+    }
+    else{
+        SIG->len=OQS_SIG_dilithium_2_length_signature;
+    }    
+}
+
+
+static bool DILITHIUM5_VERIFY(octad *CERT,octad *SIG,octad *PUBKEY)
+{
+    OQS_STATUS rc = OQS_SIG_dilithium_5_verify((uint8_t*) CERT->val, CERT->len, (uint8_t*) SIG->val, SIG->len, (uint8_t*) PUBKEY->val);
+	if (rc != OQS_SUCCESS) {
+		fprintf(stderr, "ERROR: OQS_SIG_dilithium_5_verify failed!\n");
+        return false;
+    }
+    return true;  
+}
+
+static void DILITHIUM5_SIGN(octad *KEY,octad *MESS,octad *SIG)
+{
+    OQS_STATUS rc = OQS_SIG_dilithium_5_sign( (uint8_t*) SIG->val, (size_t*) SIG->len, (uint8_t*) MESS->val, (size_t) MESS->len, (uint8_t*) KEY->val);
+	if (rc != OQS_SUCCESS) {
+		fprintf(stderr, "ERROR: OQS_SIG_dilithium_5_sign failed!\n");
+        SIG->len=0;
+    }
+    else{
+        SIG->len=OQS_SIG_dilithium_5_length_signature;
+    }    
+}
+
+//-----
+
+static bool MLDSA44_VERIFY(octad *CERT,octad *SIG,octad *PUBKEY)
+{
+    OQS_STATUS rc = OQS_SIG_ml_dsa_44_ipd_verify((uint8_t*) CERT->val, CERT->len, (uint8_t*) SIG->val, SIG->len, (uint8_t*) PUBKEY->val);
+	if (rc != OQS_SUCCESS) {
+		fprintf(stderr, "ERROR: OQS_SIG_ml_dsa_44_ipd_verify failed!\n");
+        return false;
+    }
+    return true;  
+}
+
+static void MLDSA44_SIGN(octad *KEY,octad *MESS,octad *SIG)
+{
+    OQS_STATUS rc = OQS_SIG_ml_dsa_44_ipd_sign( (uint8_t*) SIG->val, (size_t*) SIG->len, (uint8_t*) MESS->val, (size_t) MESS->len, (uint8_t*) KEY->val);
+	if (rc != OQS_SUCCESS) {
+		fprintf(stderr, "ERROR: OQS_SIG_ml_dsa_44_ipd_sign failed!\n");
+        SIG->len=0;
+    }
+    else{
+        SIG->len=OQS_SIG_ml_dsa_44_ipd_length_signature;
+    }    
+}
+
+static bool MLDSA65_VERIFY(octad *CERT,octad *SIG,octad *PUBKEY)
+{
+    OQS_STATUS rc = OQS_SIG_ml_dsa_65_ipd_verify((uint8_t*) CERT->val, CERT->len, (uint8_t*) SIG->val, SIG->len, (uint8_t*) PUBKEY->val);
+	if (rc != OQS_SUCCESS) {
+		fprintf(stderr, "ERROR: OQS_SIG_ml_dsa_65_ipd_verify failed!\n");
+        return false;
+    }
+    return true;  
+}
+
+static void MLDSA65_SIGN(octad *KEY,octad *MESS,octad *SIG)
+{
+    OQS_STATUS rc = OQS_SIG_ml_dsa_65_ipd_sign( (uint8_t*) SIG->val, (size_t*) SIG->len, (uint8_t*) MESS->val, (size_t) MESS->len, (uint8_t*) KEY->val);
+	if (rc != OQS_SUCCESS) {
+		fprintf(stderr, "ERROR: OQS_SIG_ml_dsa_65_ipd_sign failed!\n");
+        SIG->len=0;
+    }
+    else{
+        SIG->len=OQS_SIG_ml_dsa_65_ipd_length_signature;
+    }    
+}
+
+static bool MLDSA87_VERIFY(octad *CERT,octad *SIG,octad *PUBKEY)
+{
+    OQS_STATUS rc = OQS_SIG_ml_dsa_87_ipd_verify((uint8_t*) CERT->val, CERT->len, (uint8_t*) SIG->val, SIG->len, (uint8_t*) PUBKEY->val);
+	if (rc != OQS_SUCCESS) {
+		fprintf(stderr, "ERROR: OQS_SIG_ml_dsa_87_ipd_verify failed!\n");
+        return false;
+    }
+    return true;  
+}
+
+static void MLDSA87_SIGN(octad *KEY,octad *MESS,octad *SIG)
+{
+    OQS_STATUS rc = OQS_SIG_ml_dsa_87_ipd_sign( (uint8_t*) SIG->val, (size_t*) SIG->len, (uint8_t*) MESS->val, (size_t) MESS->len, (uint8_t*) KEY->val);
+	if (rc != OQS_SUCCESS) {
+		fprintf(stderr, "ERROR: OQS_SIG_ml_dsa_87_ipd_sign failed!\n");
+        SIG->len=0;
+    }
+    else{
+        SIG->len=OQS_SIG_ml_dsa_87_ipd_length_signature;
+    }    
+}
+
+
+// ------
+static bool FALCON512_VERIFY(octad *CERT,octad *SIG,octad *PUBKEY)
+{
+    OQS_STATUS rc = OQS_SIG_falcon_512_verify((uint8_t*) CERT->val, CERT->len, (uint8_t*) SIG->val, SIG->len, (uint8_t*) PUBKEY->val);
+	if (rc != OQS_SUCCESS) {
+		fprintf(stderr, "ERROR: OQS_SIG_falcon_512_verify failed!\n");
+        return false;
+    }
+    return true;  
+}
+
+static void FALCON512_SIGN(octad *KEY,octad *MESS,octad *SIG)
+{
+    OQS_STATUS rc = OQS_SIG_falcon_512_sign( (uint8_t*) SIG->val, (size_t*) SIG->len, (uint8_t*) MESS->val, (size_t) MESS->len, (uint8_t*) KEY->val);
+	if (rc != OQS_SUCCESS) {
+		fprintf(stderr, "ERROR: OQS_SIG_falcon_512_sign failed!\n");
+        SIG->len=0;
+    }
+    else{
+        SIG->len=OQS_SIG_falcon_512_length_signature;
+    }    
+}
+
+static bool FALCON1024_VERIFY(octad *CERT,octad *SIG,octad *PUBKEY)
+{
+    OQS_STATUS rc = OQS_SIG_falcon_1024_verify((uint8_t*) CERT->val, CERT->len, (uint8_t*) SIG->val, SIG->len, (uint8_t*) PUBKEY->val);
+	if (rc != OQS_SUCCESS) {
+		fprintf(stderr, "ERROR: OQS_SIG_falcon_1024_verify failed!\n");
+        return false;
+    }
+    return true;  
+}
+
+static void FALCON1024_SIGN(octad *KEY,octad *MESS,octad *SIG)
+{
+    OQS_STATUS rc = OQS_SIG_falcon_1024_sign( (uint8_t*) SIG->val, (size_t*) SIG->len, (uint8_t*) MESS->val, (size_t) MESS->len, (uint8_t*) KEY->val);
+	if (rc != OQS_SUCCESS) {
+		fprintf(stderr, "ERROR: OQS_SIG_falcon_1024_sign failed!\n");
+        SIG->len=0;
+    }
+    else{
+        SIG->len=OQS_SIG_falcon_1024_length_signature;
+    }    
+}
+
+static bool SPHINCSSHA2128FSIMPLE_VERIFY(octad *CERT,octad *SIG,octad *PUBKEY)
+{
+    OQS_STATUS rc = OQS_SIG_sphincs_sha2_128f_simple_verify((uint8_t*) CERT->val, CERT->len, (uint8_t*) SIG->val, SIG->len, (uint8_t*) PUBKEY->val);
+	if (rc != OQS_SUCCESS) {
+        return false;
+    }
+    return true;  
+}
+
+static void SPHINCSSHA2128FSIMPLE_SIGN(octad *KEY,octad *MESS,octad *SIG)
+{
+    OQS_STATUS rc = OQS_SIG_sphincs_sha2_128f_simple_sign( (uint8_t*) SIG->val, (size_t*) SIG->len, (uint8_t*) MESS->val, (size_t) MESS->len, (uint8_t*) KEY->val);
+	if (rc != OQS_SUCCESS) {
+        SIG->len=0;
+    }
+    else{
+        SIG->len=OQS_SIG_sphincs_sha2_128f_simple_length_signature;
+    }    
+}
+
+static bool SPHINCSSHA2128SSIMPLE_VERIFY(octad *CERT,octad *SIG,octad *PUBKEY)
+{
+    OQS_STATUS rc = OQS_SIG_sphincs_sha2_128s_simple_verify((uint8_t*) CERT->val, CERT->len, (uint8_t*) SIG->val, SIG->len, (uint8_t*) PUBKEY->val);
+	if (rc != OQS_SUCCESS) {
+        return false;
+    }
+    return true;  
+}
+
+static void SPHINCSSHA2128SSIMPLE_SIGN(octad *KEY,octad *MESS,octad *SIG)
+{
+    OQS_STATUS rc = OQS_SIG_sphincs_sha2_128s_simple_sign( (uint8_t*) SIG->val, (size_t*) SIG->len, (uint8_t*) MESS->val, (size_t) MESS->len, (uint8_t*) KEY->val);
+	if (rc != OQS_SUCCESS) {
+        SIG->len=0;
+    }
+    else{
+        SIG->len=OQS_SIG_sphincs_sha2_128s_simple_length_signature;
+    }    
+}
+
+static bool SPHINCSSHAKE128FSIMPLE_VERIFY(octad *CERT,octad *SIG,octad *PUBKEY)
+{
+    OQS_STATUS rc = OQS_SIG_sphincs_shake_128f_simple_verify((uint8_t*) CERT->val, CERT->len, (uint8_t*) SIG->val, SIG->len, (uint8_t*) PUBKEY->val);
+	if (rc != OQS_SUCCESS) {
+        return false;
+    }
+    return true;  
+}
+
+static void SPHINCSSHAKE128FSIMPLE_SIGN(octad *KEY,octad *MESS,octad *SIG)
+{
+    OQS_STATUS rc = OQS_SIG_sphincs_shake_128f_simple_sign( (uint8_t*) SIG->val, (size_t*) SIG->len, (uint8_t*) MESS->val, (size_t) MESS->len, (uint8_t*) KEY->val);
+	if (rc != OQS_SUCCESS) {
+        SIG->len=0;
+    }
+    else{
+        SIG->len=OQS_SIG_sphincs_shake_128f_simple_length_signature;
+    }    
+}
+/*
+static bool SPHINCSSHA2192FSIMPLE_VERIFY(octad *CERT,octad *SIG,octad *PUBKEY)
+{
+    OQS_STATUS rc = OQS_SIG_sphincs_sha2_192f_simple_verify((uint8_t*) CERT->val, CERT->len, (uint8_t*) SIG->val, SIG->len, (uint8_t*) PUBKEY->val);
+	if (rc != OQS_SUCCESS) {
+        return false;
+    }
+    return true;  
+}
+
+static void SPHINCSSHA2192FSIMPLE_SIGN(octad *KEY,octad *MESS,octad *SIG)
+{
+    OQS_STATUS rc = OQS_SIG_sphincs_sha2_192f_simple_sign( (uint8_t*) SIG->val, (size_t*) SIG->len, (uint8_t*) MESS->val, (size_t) MESS->len, (uint8_t*) KEY->val);
+	if (rc != OQS_SUCCESS) {
+        SIG->len=0;
+    }
+    else{
+        SIG->len=OQS_SIG_sphincs_sha2_192s_simple_length_signature;
+    }    
+}
+*/
+//--------------------------------------------------------------------------
+#endif
+
+// RSA 2048-bit PKCS1.5 signature verification
+static bool RSA_2048_PKCS15_VERIFY(int sha,octad *CERT,octad *SIG,octad *PUBKEY)
+{
+    bool res;
+    char p1[RFS_RSA2048];
+    octet P1={0,sizeof(p1),p1};
+    char p2[RFS_RSA2048];
+    octet P2={0,sizeof(p2),p2};
+
+    octet MC_CERT=octad_to_octet(CERT);
+    octet MC_SIG=octad_to_octet(SIG);
+    octet MC_PUBKEY=octad_to_octet(PUBKEY);
+
+    RSA2048::rsa_public_key PK;
+    PK.e = 65537; // assuming this!
+    RSA2048::RSA_fromOctet(PK.n, &MC_PUBKEY);
+    RSA2048::RSA_ENCRYPT(&PK, &MC_SIG, &P2);
+    PKCS15(sha, &MC_CERT, &P1);
+    res=OCT_comp(&P1, &P2);
+    if (!res)
+    { // check alternate PKCS1.5 encoding
+        PKCS15b(sha, &MC_CERT, &P1);
+        res=OCT_comp(&P1, &P2);
+    }
+    return res;
+}
+
+// RSA 4096-bit PKCS1.5 signature verification
+static bool RSA_4096_PKCS15_VERIFY(int sha,octad *CERT,octad *SIG,octad *PUBKEY)
+{
+    bool res;
+    char p1[RFS_RSA4096];
+    octet P1={0,sizeof(p1),p1};
+    char p2[RFS_RSA4096];
+    octet P2={0,sizeof(p2),p2};
+
+    octet MC_CERT=octad_to_octet(CERT);
+    octet MC_SIG=octad_to_octet(SIG);
+    octet MC_PUBKEY=octad_to_octet(PUBKEY);
+
+    RSA4096::rsa_public_key PK;
+    PK.e = 65537; // assuming this!
+    RSA4096::RSA_fromOctet(PK.n, &MC_PUBKEY);
+    RSA4096::RSA_ENCRYPT(&PK, &MC_SIG, &P2);
+    PKCS15(sha, &MC_CERT, &P1);
+    res=OCT_comp(&P1, &P2);
+    if (!res)
+    { // check alternate PKCS1.5 encoding
+        PKCS15b(sha, &MC_CERT, &P1);
+        res=OCT_comp(&P1, &P2);
+    }
+    return res;
+}
+
+static bool RSA_PKCS15_VERIFY(int sha,octad *CERT,octad *SIG,octad *PUBKEY)
+{
+    if (PUBKEY->len==RFS_RSA2048)
+        return RSA_2048_PKCS15_VERIFY(sha,CERT,SIG,PUBKEY);
+    if (PUBKEY->len==RFS_RSA4096)
+        return RSA_4096_PKCS15_VERIFY(sha,CERT,SIG,PUBKEY);
+    return false;
+}
+
+// RSA 2048-bit PSS-RSAE signature verification
+static bool RSA_2048_PSS_RSAE_VERIFY(int sha,octad *MESS,octad *SIG,octad *PUBKEY)
+{
+    char p[RFS_RSA2048];
+    octet P={0,sizeof(p),p};
+
+    octet MC_MESS=octad_to_octet(MESS);
+    octet MC_SIG=octad_to_octet(SIG);
+    octet MC_PUBKEY=octad_to_octet(PUBKEY);
+
+    RSA2048::rsa_public_key PK;
+    PK.e = 65537;
+    RSA2048::RSA_fromOctet(PK.n, &MC_PUBKEY);
+    RSA2048::RSA_ENCRYPT(&PK, &MC_SIG, &P);
+    if (PSS_VERIFY(sha,&MC_MESS,&P)) 
+        return true;
+    return false;
+}
+
+// RSA 4096-bit PSS-RSAE signature verification
+static bool RSA_4096_PSS_RSAE_VERIFY(int sha,octad *MESS,octad *SIG,octad *PUBKEY)
+{
+    char p[RFS_RSA4096];
+    octet P={0,sizeof(p),p};
+
+    octet MC_MESS=octad_to_octet(MESS);
+    octet MC_SIG=octad_to_octet(SIG);
+    octet MC_PUBKEY=octad_to_octet(PUBKEY);
+
+    RSA4096::rsa_public_key PK;
+    PK.e = 65537;
+    RSA4096::RSA_fromOctet(PK.n, &MC_PUBKEY);
+    RSA4096::RSA_ENCRYPT(&PK, &MC_SIG, &P);
+    if (PSS_VERIFY(sha,&MC_MESS,&P)) 
+        return true;
+    return false;
+}
+
+static bool RSA_PSS_RSAE_VERIFY(int sha,octad *MESS,octad *SIG,octad *PUBKEY)
+{
+    if (PUBKEY->len==RFS_RSA2048)
+        return RSA_2048_PSS_RSAE_VERIFY(sha,MESS,SIG,PUBKEY);
+    if (PUBKEY->len==RFS_RSA4096)
+        return RSA_4096_PSS_RSAE_VERIFY(sha,MESS,SIG,PUBKEY);
+    return false;
+}
+
+// Curve SECP256R1 elliptic curve ECDSA verification
+static bool SECP256R1_ECDSA_VERIFY(int sha,octad *CERT,octad *SIG,octad *PUBKEY)
+{
+    int res;
+
+    octet MC_CERT=octad_to_octet(CERT);
+    octet MC_SIG=octad_to_octet(SIG);
+    octet MC_PUBKEY=octad_to_octet(PUBKEY);
+
+    res=NIST256::ECP_PUBLIC_KEY_VALIDATE(&MC_PUBKEY);
+    if (res!=0) return false;
+
+    char r[32];
+    octet R={0,sizeof(r),r};
+    char s[32];
+    octet S={0,sizeof(s),s};
+    int siglen=SIG->len/2;
+    for (int i=0;i<siglen;i++)
+    {
+        OCT_jbyte(&R,MC_SIG.val[i],1);
+        OCT_jbyte(&S,MC_SIG.val[i+siglen],1);
+    }    
+
+    res=NIST256::ECP_VP_DSA(sha, &MC_PUBKEY, &MC_CERT, &R, &S);
+    if (res!=0) return false;
+
+    return true;
+}
+
+// Curve SECP384R1 elliptic curve ECDSA verification
+
+static bool SECP384R1_ECDSA_VERIFY(int sha,octad *CERT,octad *SIG,octad *PUBKEY)
+{
+    int res;
+
+    octet MC_CERT=octad_to_octet(CERT);
+    octet MC_SIG=octad_to_octet(SIG);
+    octet MC_PUBKEY=octad_to_octet(PUBKEY);
+
+    res=NIST384::ECP_PUBLIC_KEY_VALIDATE(&MC_PUBKEY);
+    if (res!=0) return false;
+
+    char r[48];
+    octet R={0,sizeof(r),r};
+    char s[48];
+    octet S={0,sizeof(s),s};
+    int siglen=SIG->len/2;
+    for (int i=0;i<siglen;i++)
+    {
+        OCT_jbyte(&R,MC_SIG.val[i],1);
+        OCT_jbyte(&S,MC_SIG.val[i+siglen],1);
+    }    
+
+    res=NIST384::ECP_VP_DSA(sha, &MC_PUBKEY, &MC_CERT, &R, &S);
+    if (res!=0) return false;
+
+    return true;
+}
+
+static bool Ed25519_VERIFY(octad *CERT,octad *SIG,octad *PUBKEY)
+{ 
+    octet MC_CERT=octad_to_octet(CERT);
+    octet MC_SIG=octad_to_octet(SIG);
+    octet MC_PUBKEY=octad_to_octet(PUBKEY);
+    return Ed25519::EDDSA_VERIFY(false,&MC_PUBKEY,NULL,&MC_CERT,&MC_SIG);
+}
+
+static bool Ed448_VERIFY(octad *CERT,octad *SIG,octad *PUBKEY)
+{ 
+    octet MC_CERT=octad_to_octet(CERT);
+    octet MC_SIG=octad_to_octet(SIG);
+    octet MC_PUBKEY=octad_to_octet(PUBKEY);
+    return Ed448::EDDSA_VERIFY(false,&MC_PUBKEY,NULL,&MC_CERT,&MC_SIG);
+}
+
+// Use Curve SECP256R1 ECDSA to digitally sign a message using a private key 
+static void SECP256R1_ECDSA_SIGN(int sha,octad *KEY,octad *MESS,octad *SIG)
+{
+    octet MC_MESS=octad_to_octet(MESS);
+    octet MC_KEY=octad_to_octet(KEY);
+    octet MC_SIG=octad_to_octet(SIG);
+
+    char r[32];
+    octet R={0,sizeof(r),r};
+    char s[32];
+    octet S={0,sizeof(s),s};
+
+    NIST256::ECP_SP_DSA(sha, &RNG, NULL, &MC_KEY, &MC_MESS, &R, &S);
+
+    OCT_copy(&MC_SIG,&R);
+    OCT_joctet(&MC_SIG,&S);
+
+    SIG->len=MC_SIG.len;
+}
+
+// Use Curve SECP384R1 ECDSA to digitally sign a message using a private key 
+static void SECP384R1_ECDSA_SIGN(int sha,octad *KEY,octad *MESS,octad *SIG)
+{
+    octet MC_MESS=octad_to_octet(MESS);
+    octet MC_KEY=octad_to_octet(KEY);
+    octet MC_SIG=octad_to_octet(SIG);
+
+    char r[48];
+    octet R={0,sizeof(r),r};
+    char s[48];
+    octet S={0,sizeof(s),s};
+
+    NIST384::ECP_SP_DSA(sha, &RNG, NULL, &MC_KEY, &MC_MESS, &R, &S);
+
+    OCT_copy(&MC_SIG,&R);
+    OCT_joctet(&MC_SIG,&S);
+
+    SIG->len=MC_SIG.len;
+}
+
+static void Ed25519_SIGN(octad *KEY,octad *MESS,octad *SIG)
+{ 
+    octet MC_MESS=octad_to_octet(MESS);
+    octet MC_KEY=octad_to_octet(KEY);
+    octet MC_SIG=octad_to_octet(SIG);
+    Ed25519::EDDSA_SIGNATURE(false,&MC_KEY,NULL,&MC_MESS,&MC_SIG);
+    SIG->len=MC_SIG.len;
+}
+
+static void Ed448_SIGN(octad *KEY,octad *MESS,octad *SIG)
+{ 
+    octet MC_MESS=octad_to_octet(MESS);
+    octet MC_KEY=octad_to_octet(KEY);
+    octet MC_SIG=octad_to_octet(SIG);
+    Ed448::EDDSA_SIGNATURE(false,&MC_KEY,NULL,&MC_MESS,&MC_SIG);
+    SIG->len=MC_SIG.len;
+}
+
+// Use RSA-2048 PSS-RSAE to digitally sign a message using a private key
+static void RSA_2048_PSS_RSAE_SIGN(int sha,octad *KEY,octad *MESS,octad *SIG)
+{
+    int len=KEY->len/5;   // length of p and q
+    if (len!=128) return;
+    char p[128];
+    octet P={len,sizeof(p),p};
+    char q[128];
+    octet Q={len,sizeof(q),q};
+    char dp[128];
+    octet DP={len,sizeof(dp),dp};
+    char dq[128];
+    octet DQ={len,sizeof(dq),dq};
+    char c[128];
+    octet C={len,sizeof(c),c}; 
+    for (int i=0;i<len;i++)
+    {
+        p[i]=KEY->val[i];
+        q[i]=KEY->val[i+len];
+        dp[i]=KEY->val[i+2*len];
+        dq[i]=KEY->val[i+3*len];
+        c[i]=KEY->val[i+4*len];
+    }
+    RSA2048::rsa_private_key SK;
+    char enc[256];
+    octet ENC={0,sizeof(enc),enc};
+    RSA2048::RSA_PRIVATE_KEY_FROM_OPENSSL(&P,&Q,&DP,&DQ,&C,&SK);
+
+    octet MC_MESS=octad_to_octet(MESS);
+    octet MC_SIG=octad_to_octet(SIG);
+
+    PSS_ENCODE(sha, &MC_MESS, &RNG, &ENC);
+    RSA2048::RSA_DECRYPT(&SK,&ENC,&MC_SIG);
+    SIG->len=MC_SIG.len;
+}
+
+// Use RSA-4096 PSS-RSAE to digitally sign a message using a private key
+static void RSA_4096_PSS_RSAE_SIGN(int sha,octad *KEY,octad *MESS,octad *SIG)
+{
+    int len=KEY->len/5;   // length of p and q
+    if (len!=256) return;
+    char p[256];
+    octet P={len,sizeof(p),p};
+    char q[256];
+    octet Q={len,sizeof(q),q};
+    char dp[256];
+    octet DP={len,sizeof(dp),dp};
+    char dq[256];
+    octet DQ={len,sizeof(dq),dq};
+    char c[256];
+    octet C={len,sizeof(c),c}; 
+    for (int i=0;i<len;i++)
+    {
+        p[i]=KEY->val[i];
+        q[i]=KEY->val[i+len];
+        dp[i]=KEY->val[i+2*len];
+        dq[i]=KEY->val[i+3*len];
+        c[i]=KEY->val[i+4*len];
+    }
+    RSA4096::rsa_private_key SK;
+    char enc[512];
+    octet ENC={0,sizeof(enc),enc};
+
+    octet MC_MESS=octad_to_octet(MESS);
+    octet MC_SIG=octad_to_octet(SIG);
+
+    RSA4096::RSA_PRIVATE_KEY_FROM_OPENSSL(&P,&Q,&DP,&DQ,&C,&SK);
+
+    PSS_ENCODE(sha, &MC_MESS, &RNG, &ENC);
+    RSA4096::RSA_DECRYPT(&SK,&ENC,&MC_SIG);
+    SIG->len=MC_SIG.len;
+}
+
+static void RSA_PSS_RSAE_SIGN(int sha,octad *KEY,octad *MESS,octad *SIG)
+{
+    int len=KEY->len/5;
+    if (len==128) RSA_2048_PSS_RSAE_SIGN(sha,KEY,MESS,SIG);
+    if (len==256) RSA_4096_PSS_RSAE_SIGN(sha,KEY,MESS,SIG);
+}
+
+// RFC8446:     "A TLS-compliant application MUST support digital signatures with
+//              rsa_pkcs1_sha256 (for certificates), rsa_pss_rsae_sha256 (for
+//              CertificateVerify and certificates), and ecdsa_secp256r1_sha256."
+
+// SAL signature verification
+bool SAL_tlsSignatureVerify(int sigAlg,octad *BUFF,octad *SIG,octad *PUBKEY)
+{
+    bool result;
+    //double start,elapsed;
+    //start = millis();
+    switch (sigAlg) {
+        case RSA_PKCS1_SHA256 :
+            result= RSA_PKCS15_VERIFY(32,BUFF,SIG,PUBKEY);
+            break;
+        case ECDSA_SECP256R1_SHA256 :
+            result= SECP256R1_ECDSA_VERIFY(32,BUFF,SIG,PUBKEY); 
+            break;
+        case ECDSA_SECP256R1_SHA384 :
+            result= SECP256R1_ECDSA_VERIFY(48,BUFF,SIG,PUBKEY); 
+            break;
+        case RSA_PKCS1_SHA384 :
+            result= RSA_PKCS15_VERIFY(48,BUFF,SIG,PUBKEY);
+            break;        
+        case ECDSA_SECP384R1_SHA384 :
+            result= SECP384R1_ECDSA_VERIFY(48,BUFF,SIG,PUBKEY);
+            break;
+        case RSA_PKCS1_SHA512 :
+            result= RSA_PKCS15_VERIFY(64,BUFF,SIG,PUBKEY);
+            break;        
+        case RSA_PSS_RSAE_SHA256:
+            result= RSA_PSS_RSAE_VERIFY(32,BUFF,SIG,PUBKEY);
+            break;
+        case ED25519:
+            result= Ed25519_VERIFY(BUFF,SIG,PUBKEY);
+            break;
+        case ED448:
+            result= Ed448_VERIFY(BUFF,SIG,PUBKEY);
+            break;
+
+// JS doplnenie novych PQ algoritmov
+#if CRYPTO_SETTING>=POST_QUANTUM
+        case DILITHIUM2:
+            result= DILITHIUM2_VERIFY(BUFF,SIG,PUBKEY);
+            break;
+        case DILITHIUM3:
+            result= DILITHIUM3_VERIFY(BUFF,SIG,PUBKEY);
+            break;
+        case DILITHIUM5:
+            result= DILITHIUM5_VERIFY(BUFF,SIG,PUBKEY);
+            break;
+        case MLDSA44:
+            result= MLDSA44_VERIFY(BUFF,SIG,PUBKEY);
+            break;
+        case MLDSA65:
+            result= MLDSA65_VERIFY(BUFF,SIG,PUBKEY);
+            break;
+        case MLDSA87:
+            result= MLDSA87_VERIFY(BUFF,SIG,PUBKEY);
+            break;
+        case FALCON512:
+            result= FALCON512_VERIFY(BUFF,SIG,PUBKEY);
+            break;
+        case FALCON1024:
+            result= FALCON1024_VERIFY(BUFF,SIG,PUBKEY);
+            break;
+        case SPHINCSSHA2128FSIMPLE:
+            result= SPHINCSSHA2128FSIMPLE_VERIFY(BUFF,SIG,PUBKEY);
+            break;
+        case SPHINCSSHA2128SSIMPLE:
+            result= SPHINCSSHA2128SSIMPLE_VERIFY(BUFF,SIG,PUBKEY);
+            break;
+        case SPHINCSSHAKE128FSIMPLE:
+            result= SPHINCSSHAKE128FSIMPLE_VERIFY(BUFF,SIG,PUBKEY);
+            break;
+        /*
+        case SPHINCSSHA2192FSIMPLE:
+            result= SPHINCSSHA2192FSIMPLE_VERIFY(BUFF,SIG,PUBKEY);
+            break;
+        */
+#endif
+        default:
+            result=false;
+    }
+    //elapsed=(millis()-start);
+    //printf("        Verification= %.2lf ms\n", elapsed);
+    return result;
+}
+
+// Form Transcript Signature 
+void SAL_tlsSignature(int sigAlg,octad *KEY,octad *TRANS,octad *SIG)
+{ // probably need to support more cases
+    //int start,elapsed;
+    //start = millis();
+    switch (sigAlg)
+    {
+    case RSA_PSS_RSAE_SHA256:
+        RSA_PSS_RSAE_SIGN(32,KEY,TRANS,SIG);
+        break;
+    case ED25519:
+        Ed25519_SIGN(KEY,TRANS,SIG);
+        break;
+    case ED448:
+        Ed448_SIGN(KEY,TRANS,SIG);
+        break;
+    case ECDSA_SECP256R1_SHA256:
+        SECP256R1_ECDSA_SIGN(32,KEY,TRANS,SIG);
+        break;
+    case ECDSA_SECP256R1_SHA384:
+        SECP256R1_ECDSA_SIGN(48,KEY,TRANS,SIG);
+        break;
+    case ECDSA_SECP384R1_SHA384:
+        SECP384R1_ECDSA_SIGN(48,KEY,TRANS,SIG);
+        break;
+
+// JS doplnenie novych PQ algoritmov
+#if CRYPTO_SETTING>=POST_QUANTUM
+    case DILITHIUM2:
+        DILITHIUM2_SIGN(KEY,TRANS,SIG);
+        break;
+    case DILITHIUM3:
+        DILITHIUM3_SIGN(KEY,TRANS,SIG);
+        break;
+    case DILITHIUM5:
+        DILITHIUM5_SIGN(KEY,TRANS,SIG);
+        break;
+    case MLDSA44:
+        MLDSA44_SIGN(KEY,TRANS,SIG);
+        break;
+    case MLDSA65:
+        MLDSA65_SIGN(KEY,TRANS,SIG);
+        break;
+    case MLDSA87:
+        MLDSA87_SIGN(KEY,TRANS,SIG);
+        break;
+    case FALCON512:
+        FALCON512_SIGN(KEY,TRANS,SIG);
+            break;
+    case FALCON1024:
+        FALCON1024_SIGN(KEY,TRANS,SIG);
+        break;
+    case SPHINCSSHA2128FSIMPLE:
+        SPHINCSSHA2128FSIMPLE_SIGN(KEY,TRANS,SIG);
+        break;
+    case SPHINCSSHA2128SSIMPLE:
+        SPHINCSSHA2128SSIMPLE_SIGN(KEY,TRANS,SIG);
+        break;
+    case SPHINCSSHAKE128FSIMPLE:
+        SPHINCSSHAKE128FSIMPLE_SIGN(KEY,TRANS,SIG);
+        break;
+    /* 
+    case SPHINCSSHA2192FSIMPLE:
+        SPHINCSSHA2192FSIMPLE_SIGN(KEY,TRANS,SIG);
+        break;  
+    */
+#endif
+    }
+    //elapsed=(millis()-start);
+    //printf("        Signature= %d\n", elapsed);
+}
\ No newline at end of file
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/lib/tls_sockets.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/lib/tls_sockets.cpp
new file mode 100644
index 0000000..f1a9955
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/lib/tls_sockets.cpp
@@ -0,0 +1,137 @@
+/*
+* JS update 29.02.2024
+* Uprava vstupnych parametrov pre funkciu rozdielne definovanu pre Linux a Windows
+* Odstranene funkcie pre ARDUINO
+*/
+
+// Set up and read/write sockets
+
+#include "tls_logger.h"
+
+//int BYTES_READ=0;
+//int BYTES_WRITTEN=0;
+
+// open socket
+int setclientsock(int port,char *ip,int toms)
+{
+    int sock = 0; 
+    struct sockaddr_in serv_addr; 
+    if ((sock = socket(AF_INET, SOCK_STREAM, 0)) < 0) 
+        return -1; 
+   
+    serv_addr.sin_family = AF_INET; 
+    serv_addr.sin_port = htons(port); 
+       
+// Convert IPv4 and IPv6 addresses from text to binary form 
+    if(inet_pton(AF_INET, ip, &serv_addr.sin_addr)<=0)  
+        return -2; 
+   
+// Set time-out period    
+    struct timeval timeout;
+    timeout.tv_sec  = toms/1000;  // after some seconds read() will timeout
+    timeout.tv_usec = (toms%1000)*1000;
+
+    // JS uprava casovacu pre Windows funkciu s odlisnym argumentom
+    #ifdef __WIN32
+        //int nTimeout = 30000;
+        setsockopt(sock, SOL_SOCKET, SO_RCVTIMEO, (const char*)&timeout.tv_usec, sizeof(timeout.tv_usec));
+    #else
+        setsockopt(sock, SOL_SOCKET, SO_RCVTIMEO, &timeout, sizeof(timeout));
+    #endif
+    
+    if (connect(sock, (struct sockaddr *)&serv_addr, sizeof(serv_addr)) < 0) 
+        return -3; 
+    
+    return sock;
+}
+
+// get IP address from Hostname
+int getIPaddress(char *ip,char *hostname)
+{
+    hostent * record = gethostbyname(hostname);
+    if(record == NULL) return 0;
+    in_addr * address = (in_addr * )record->h_addr;
+    strcpy(ip,inet_ntoa(* address));
+    return 1;
+}
+
+// Send Octet
+void sendOctad(Socket *client,octad *B)
+{
+    client->write(B->val,B->len);
+//BYTES_WRITTEN+=B->len;
+
+#if VERBOSITY >= IO_WIRE
+
+    char w[4];
+    myprintf((char *)"-> ");
+    for (int j = 0; j < B->len; j++)
+    {
+        sprintf(w,"%02x", (unsigned char)B->val[j]);
+        myprintf(w);
+    }
+    myprintf((char *)"\n");
+
+#endif    
+}
+
+// Send Octet length
+void sendLen(Socket *client,int len)
+{
+    char buff[2];
+    octad B={0, sizeof(buff), buff};
+    B.len=2;
+    B.val[0]=len&0xff;
+    B.val[1]=len/256;
+    sendOctad(client,&B);
+}
+
+// get expected bytes
+int getBytes(Socket *client,char *b,int expected)
+{
+    int n,more,i=0,len=expected;
+
+//BYTES_READ+=expected;
+
+    unsigned long start=millis();
+    while(len>0)
+    {
+        if (millis()>start+5000)
+            return -1;
+        more=client->read(&b[i],len);
+        if (more==0) continue;
+        if (more<0) return -1;
+        i+=more;
+        len-=more;
+    }
+
+#if VERBOSITY >= IO_WIRE
+
+    char w[4];
+    myprintf((char *)"<- ");
+    for (int j = 0; j < expected; j++)
+    {
+        sprintf(w,"%02x", (unsigned char)b[j]);
+        myprintf(w);
+    }
+    myprintf((char *)"\n");
+
+#endif
+    return 0;
+}
+
+// Get 16-bit Integer from stream
+int getInt16(Socket *client)
+{
+    char b[2];
+    getBytes(client,b,2);
+    return 256*(int)(unsigned char)b[0]+(int)(unsigned char)b[1];
+}
+
+// Get expected number of bytes into an octet
+int getOctad(Socket *client,octad *B,int expected)
+{
+    B->len=expected;
+    return getBytes(client,B->val,expected);
+}
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/lib/tls_tickets.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/lib/tls_tickets.cpp
new file mode 100644
index 0000000..8b14fa4
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/lib/tls_tickets.cpp
@@ -0,0 +1,106 @@
+// 
+// Process Resumption Tickets and external PSKs
+//
+
+#include "tls_tickets.h"
+
+// Initialise a ticket. Also record the cipher-suite in use, and servers favourite key exchange group
+void initTicketContext(ticket *T)
+{
+    T->valid=false;
+
+    T->NONCE.len = 0;
+    T->NONCE.max = 256;
+    T->NONCE.val = T->nonce;
+
+    T->PSK.len = 0;
+    T->PSK.max = TLS_MAX_HASH;
+    T->PSK.val = T->psk;
+
+    T->TICK.len = 0;
+    T->TICK.max = TLS_MAX_TICKET_SIZE;
+    T->TICK.val = T->tick;
+
+    T->lifetime=0;
+    T->age_obfuscator=0;
+    T->max_early_data=0;
+    T->birth=0;
+    T->cipher_suite=0;
+    T->favourite_group=0;
+    T->origin=0;
+}
+
+// terminate a ticket
+void endTicketContext(ticket *T)
+{
+    OCT_kill(&T->NONCE);
+    OCT_kill(&T->PSK);
+    OCT_kill(&T->TICK);
+
+    T->lifetime=0;
+    T->age_obfuscator=0;
+    T->max_early_data=0;
+    T->birth=0;
+    T->cipher_suite=0;
+    T->favourite_group=0;
+    T->origin=0;
+}
+
+// Parse ticket data and birth time into a ticket structure 
+int parseTicket(octad *TICK,unsign32 birth,ticket *T)  
+{
+    ret r;
+    int ext,len,tmplen,ptr=0;
+    if (TICK->len==0) return BAD_TICKET;
+    r=parseInt(TICK,4,ptr);  if (r.err) return r.err; T->lifetime=r.val;
+    r=parseInt(TICK,4,ptr);  if (r.err) return r.err; T->age_obfuscator=r.val;
+    r=parseInt(TICK,1,ptr); len=r.val;  if (r.err) return r.err;
+    r=parseoctad(&T->NONCE,len,TICK,ptr);  if (r.err) return r.err;        // could be a single byte 0,1,2,3,... incremented for each ticket issued on this connection 
+    r=parseInt(TICK,2,ptr); len=r.val; if (r.err) return r.err;
+    r=parseoctad(&T->TICK,len,TICK,ptr);  if (r.err) return r.err;        // extract ticket
+    r=parseInt(TICK,2,ptr); len=r.val; if (r.err) return r.err;            // length of extensions
+
+    T->birth=birth;
+    T->max_early_data=0;
+    while (len>0)
+    {
+        r=parseInt(TICK,2,ptr); ext=r.val; if (r.err) return r.err;
+        len-=2;
+        switch (ext)
+        {
+        case EARLY_DATA :
+            {
+                r=parseInt(TICK,2,ptr); if (r.err) return r.err; tmplen=r.val; if (tmplen!=4) return BAD_TICKET;
+                len-=2;  // tmplen=4 - max_early data
+                r=parseInt(TICK,4,ptr); T->max_early_data=r.val;
+                len-=tmplen;
+                break;
+            }
+       default :   // ignore other extensions  // Probably GREASE extensions
+
+            r=parseInt(TICK,2,ptr); tmplen=r.val;
+            len-=2;
+            len-=tmplen; ptr+=tmplen;
+            break;
+        }
+        if (r.err) return r.err;
+    }
+    T->valid=true;
+    return 0;
+}
+
+// check a ticket exists, its good, and its not out-of-date
+bool ticket_still_good(ticket *T)
+{
+    unsign32 time_ticket_received,time_ticket_used;
+    unsign32 age;
+    if (T->origin==TLS_EXTERNAL_PSK) return true;
+    if (T->lifetime<=0 || !T->valid)
+        return false;
+    time_ticket_received=T->birth;
+    time_ticket_used=(unsign32)millis();
+    age=time_ticket_used-time_ticket_received;
+    if (age>1000*T->lifetime)
+        return false;
+    return true;
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/lib/tls_x509.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/lib/tls_x509.cpp
new file mode 100644
index 0000000..7521a5e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/lib/tls_x509.cpp
@@ -0,0 +1,1727 @@
+/*
+* JS update 14.04.2024
+* Pridana podpora pre algoritmy ML-KEM a ML-DSA
+* Testovane s novou verziou liboqs 0.10.0
+*/
+
+/*
+* JS update 29.02.2024
+* Definovanie OIDs pre PQ algoritmy
+* Porovnanie OID certifikatu s OID PQ algoritmov
+* Doplnenie PQ algoritmov do funkcii pre ziskanie verejneho a sukromneho kluca
+*/
+
+//
+// X.509 Functions 
+//
+
+#include <stdio.h>
+#include "tls_octads.h"  
+#include "tls_x509.h"
+
+// Some ASN.1 tags
+
+#define ANY 0x00
+#define SEQ 0x30
+#define OID 0x06
+#define INT 0x02
+#define NUL 0x05
+#define ZER 0x00
+#define UTF 0x0C
+#define UTC 0x17
+#define GTM 0x18
+#define LOG 0x01
+#define BIT 0x03
+#define OCT 0x04
+#define STR 0x13
+#define SET 0x31
+#define IA5 0x16
+#define EXT 0xA3
+#define DNS 0x82
+
+// Define some OIDs
+
+// Elliptic Curve with SHA256
+static unsigned char eccsha256[8] = {0x2a, 0x86, 0x48, 0xce, 0x3d, 0x04, 0x03, 0x02};
+static octad ECCSHA256 = {8, sizeof(eccsha256), (char *)eccsha256};
+
+// Elliptic Curve with SHA384
+static unsigned char eccsha384[8] = {0x2a, 0x86, 0x48, 0xce, 0x3d, 0x04, 0x03, 0x03};
+static octad ECCSHA384 = {8, sizeof(eccsha384), (char *)eccsha384};
+
+// Elliptic Curve with SHA512
+static unsigned char eccsha512[8] = {0x2a, 0x86, 0x48, 0xce, 0x3d, 0x04, 0x03, 0x04};
+static octad ECCSHA512 = {8, sizeof(eccsha512), (char *)eccsha512};
+
+// EC Public Key - Elliptic curve public key cryptography
+static unsigned char ecpk[7] = {0x2a, 0x86, 0x48, 0xce, 0x3d, 0x02, 0x01};
+static octad ECPK = {7, sizeof(ecpk), (char *)ecpk};
+
+// ED25519 Public Key - Elliptic curve EdDSA (Ed25519) Signature
+static unsigned char edpk25519[3] = {0x2B, 0x65, 0x70};  
+static octad EDPK25519 = {3, sizeof(edpk25519),(char *)edpk25519};
+
+// ED448 Public Key - Elliptic curve EdDSA (Ed448) Signature
+static unsigned char edpk448[3] = {0x2B, 0x65, 0x71};  
+static octad EDPK448 = {3, sizeof(edpk448),(char *)edpk448};
+
+// C25519 curve
+static unsigned char prime25519[9] = {0x2B, 0x06, 0x01, 0x04, 0x01, 0xDA, 0x47, 0x0F, 0x01}; /*****/
+static octad PRIME25519 = {9, sizeof(prime25519), (char *)prime25519};
+
+// NIST256 curve - (NIST) P-256
+static unsigned char prime256v1[8] = {0x2a, 0x86, 0x48, 0xce, 0x3d, 0x03, 0x01, 0x07};
+static octad PRIME256V1 = {8, sizeof(prime256v1), (char *)prime256v1};
+
+// NIST384 curve
+static unsigned char secp384r1[5] = {0x2B, 0x81, 0x04, 0x00, 0x22};
+static octad SECP384R1 = {5, sizeof(secp384r1), (char *)secp384r1};
+
+// NIST521 curve
+static unsigned char secp521r1[5] = {0x2B, 0x81, 0x04, 0x00, 0x23};
+static octad SECP521R1 = {5, sizeof(secp521r1), (char *)secp521r1};
+
+// RSA Public Key - RSAES-PKCS1-v1_5
+static unsigned char rsapk[9] = {0x2a, 0x86, 0x48, 0x86, 0xf7, 0x0d, 0x01, 0x01, 0x01};
+static octad RSAPK = {9, sizeof(rsapk), (char *)rsapk};
+
+// RSA with SHA256
+static unsigned char rsasha256[9] = {0x2a, 0x86, 0x48, 0x86, 0xf7, 0x0d, 0x01, 0x01, 0x0b};
+static octad RSASHA256 = {9, sizeof(rsasha256), (char *)rsasha256};
+
+// RSA with SHA384
+static unsigned char rsasha384[9] = {0x2a, 0x86, 0x48, 0x86, 0xf7, 0x0d, 0x01, 0x01, 0x0c};
+static octad RSASHA384 = {9, sizeof(rsasha384), (char *)rsasha384};
+
+// RSA with SHA512
+static unsigned char rsasha512[9] = {0x2a, 0x86, 0x48, 0x86, 0xf7, 0x0d, 0x01, 0x01, 0x0d};
+static octad RSASHA512 = {9, sizeof(rsasha512), (char *)rsasha512};
+
+//------------------------------------------------------------------------------------------------------------
+// JS upravene a pridane nove OIDs pre PQ algoritmy
+// OIDs na zaklade dokumentacie (14.04.2024), oqsprovider 0.6.0 https://github.com/open-quantum-safe/oqs-provider/blob/main/ALGORITHMS.md#oids
+// Transformacia z "dotted" verzie na C hex string pomocou nastroju https://misc.daniel-marschall.de/asn.1/oid-converter/online.php
+
+// DILITHIUM2
+static unsigned char dilithium2[11] = {0x2b, 0x06, 0x01, 0x04, 0x01, 0x02, 0x82, 0x0B, 0x07, 0x04, 0x04};
+static octad DILITHIUM2 = {11, sizeof(dilithium2), (char *)dilithium2};
+
+// DILITHIUM3
+static unsigned char dilithium3[11] = {0x2b, 0x06, 0x01, 0x04, 0x01, 0x02, 0x82, 0x0B, 0x07, 0x06, 0x05};
+static octad DILITHIUM3 = {11, sizeof(dilithium3), (char *)dilithium3};
+
+// DILITHIUM5
+static unsigned char dilithium5[11] = {0x2b, 0x06, 0x01, 0x04, 0x01, 0x02, 0x82, 0x0B, 0x07, 0x08, 0x07};
+static octad DILITHIUM5 = {11, sizeof(dilithium5), (char *)dilithium5};
+
+// MLDSA44  
+static unsigned char mldsa44[11] = {0x2B, 0x06, 0x01, 0x04, 0x01, 0x02, 0x82, 0x0B, 0x0C, 0x04, 0x04};
+static octad MLDSA44 = {11, sizeof(mldsa44), (char *)mldsa44};
+
+// MLDSA65
+static unsigned char mldsa65[11] = {0x2B, 0x06, 0x01, 0x04, 0x01, 0x02, 0x82, 0x0B, 0x0C, 0x06, 0x05};
+static octad MLDSA65 = {11, sizeof(mldsa65), (char *)mldsa65};
+
+// MLDSA87
+static unsigned char mldsa87[11] = {0x2B, 0x06, 0x01, 0x04, 0x01, 0x02, 0x82, 0x0B, 0x0C, 0x08, 0x07};
+static octad MLDSA87 = {11, sizeof(mldsa87), (char *)mldsa87};
+
+// FALCON512
+static unsigned char falcon512[5] = {0x2B, 0xCE, 0x0F, 0x03, 0x0B};
+static octad FALCON512 = {5, sizeof(falcon512), (char *)falcon512};
+
+// FALCON1024
+static unsigned char falcon1024[5] = {0x2B, 0xCE, 0x0F, 0x03, 0x0E};
+static octad FALCON1024 = {5, sizeof(falcon1024), (char *)falcon1024};
+
+// SPHINCSSHA2128FSIMPLE
+static unsigned char sphincssha2128fsimple[6] = {0x2b, 0xce, 0x0f, 0x06, 0x04, 0x0d};
+static octad SPHINCSSHA2128FSIMPLE = {6, sizeof(sphincssha2128fsimple), (char *)sphincssha2128fsimple};
+
+// SPHINCSSHA2128SSIMPLE
+static unsigned char sphincssha2128ssimple[6] = {0x2b, 0xce, 0x0f, 0x06, 0x04, 0x10};
+static octad SPHINCSSHA2128SSIMPLE = {6, sizeof(sphincssha2128ssimple), (char *)sphincssha2128ssimple};
+
+// SPHINCSSHAKE128FSIMPLE
+static unsigned char sphincsshake128fsimple[6] = {0x2b, 0xce, 0x0f, 0x06, 0x07, 0x0d};
+static octad SPHINCSSHAKE128FSIMPLE = {6, sizeof(sphincsshake128fsimple), (char *)sphincsshake128fsimple};
+
+// SPHINCSSHA2192FSIMPLE 
+static unsigned char sphincssha2192fsimple[6] = {0x2b, 0xce, 0x0f, 0x06, 0x05, 0x0a};
+static octad SPHINCSSHA2192FSIMPLE = {6, sizeof(sphincssha2192fsimple), (char *)sphincssha2192fsimple};
+
+//------------------------------------------------------------------------------------------------------------
+
+// DILITHIUM2 + P256
+static unsigned char hybrid[6] = {0x2B, 0xCE, 0x0F, 0x02, 0x07, 0x01};
+static octad HYBRID = {6,sizeof(hybrid), (char *)hybrid};
+
+// Cert details
+// countryName
+static unsigned char cn[3] = {0x55, 0x04, 0x06};
+octad X509_CN = {3, sizeof(cn), (char *)cn};
+
+// stateName
+static char sn[3]= {0x55,0x04,0x08};
+octad X509_SN= {3,sizeof(sn),sn};
+
+// localName
+static char ln[3]= {0x55,0x04,0x07};
+octad X509_LN= {3,sizeof(ln),ln};
+
+// orgName
+static unsigned char on[3] = {0x55, 0x04, 0x0A};
+octad X509_ON = {3, sizeof(on), (char *)on};
+
+// unitName
+static char un[3]= {0x55,0x04,0x0B};
+octad X509_UN= {3,sizeof(un),un};
+
+// myName
+static char mn[3]= {0x55,0x04,0x03};
+octad X509_MN= {3,sizeof(mn),mn};
+
+// emailName
+static unsigned char en[9] = {0x2a, 0x86, 0x48, 0x86, 0xf7, 0x0d, 0x01, 0x09, 0x01};
+octad X509_EN = {9, sizeof(en), (char *)en};
+
+// Extensions
+// Alt Name
+static char an[3]={0x55,0x1D,0x11};
+octad X509_AN = {3, sizeof(an),an};
+
+// Key Usage
+static char ku[3]={0x55,0x1d,0x0f};
+octad X509_KU = {3,sizeof(ku),ku};
+
+// Basic Constraints
+static char bc[3]={0x55,0x1d,0x13};
+octad X509_BC = {3,sizeof(bc),bc};
+
+/* Check expected TAG and return ASN.1 field length. If tag=0 skip check. */
+static int getalen(int tag, char *b, int j)
+{
+    int len;
+
+    if (tag != 0 && (unsigned char)b[j] != tag) return -1; // not a valid tag
+    j++;
+
+    if ((unsigned char)b[j] == 0x81)
+    {
+        j++;
+        len = (unsigned char)b[j];
+    }
+    else if ((unsigned char)b[j] == 0x82)
+    {
+        j++;
+        len = 256 * b[j++];
+        len += (unsigned char)b[j];
+    }
+    else
+    {
+        len = (unsigned char)b[j];
+        if (len > 127) return -1;
+    }
+    return len;
+}
+
+/* jump over length field */
+static int skip(int len)
+{
+    if (len < 128) return 2;
+    if (len < 256) return 3;
+    return 4;
+}
+
+/* round length up to nearest 8-byte length */
+static int bround(int len)
+{
+    if (len % 8 == 0) return len;
+    return len + (8 - len % 8);
+
+}
+
+// in-place ECDSA signature encoding from r|s to ASN.1
+void ecdsa_sig_encode(octad *c) {
+    char r[66],s[66];
+    int i,ptr=0;
+    int hlen=c->len/2;
+    int rinc=0;
+    int sinc=0;
+    int len=2*hlen+4;
+
+    for (i=0;i<hlen;i++)
+    {
+        r[i]=c->val[i];
+        s[i]=c->val[hlen+i];
+    }
+
+    if (r[0]&0x80) {
+        rinc=1; len+=1;
+    }
+    if (s[0]&0x80) {
+        sinc=1; len+=1;
+    }
+    c->val[ptr++]=SEQ;
+    c->val[ptr++]=(char)len;
+    c->val[ptr++]=INT;
+    if (rinc)
+    {
+        c->val[ptr++]=(char)(hlen+1);
+        c->val[ptr++]=0;
+    } else {
+        c->val[ptr++]=(char)hlen;
+    }
+    for (i=0;i<hlen;i++)
+        c->val[ptr++]=r[i];
+
+    c->val[ptr++]=INT;
+    if (sinc)
+    {
+        c->val[ptr++]=(char)(hlen+1);
+        c->val[ptr++]=0;
+    } else {
+        c->val[ptr++]=(char)hlen;
+    }
+    for (i=0;i<hlen;i++)
+        c->val[ptr++]=s[i];
+    c->len=ptr;
+}
+
+// in-place ECDSA signature decoding from ASN.1 to r|s
+// return final index into c
+int ecdsa_sig_decode(octad *c) {
+    int i,j=0;
+    int ex,fin,rlen,slen,len=getalen(SEQ, c->val, j);
+    slen=0;
+    if (len < 0) return 0;        // if not a SEQ clause, there is a problem, exit
+    j += skip(len);  
+
+    len = getalen(INT, c->val, j);
+    if (len < 0) return 0;
+    j += skip(len);
+    if (c->val[j]==0)
+    { // leading zero
+        j++;
+        len-=1;
+    }
+    rlen=bround(len);
+    ex=rlen-len;
+    for (i=0;i<ex;i++)
+        c->val[slen++]=0;
+    fin=j+len;
+    while (j<fin)
+        c->val[slen++]=c->val[j++];
+    
+    len = getalen(INT, c->val, j);
+    if (len < 0) return 0;
+    j += skip(len);
+    if (c->val[j]==0)
+    { // leading zero
+        j++;
+        len-=1;
+    }
+    rlen=bround(len);
+    ex=rlen-len;
+   
+    for (i=0;i<ex;i++)
+        c->val[slen++]=0;
+    fin=j+len;
+    while (j<fin)
+        c->val[slen++]=c->val[j++];
+    c->len=slen;   // adjust length
+    return j;
+}
+
+// Input private key in PKCS#8 format
+// e.g. openssl req -x509 -nodes -newkey rsa:4096 -keyout key.pem -out cert.pem -days 365
+// e.g. openssl req -x509 -nodes -days 3650 -newkey ec:<(openssl ecparam -name prime256v1) -keyout key.pem -out ecdsacert.pem
+// extract private key from uncompressed key.pem into octad
+// For RSA octad = p|q|dp|dq|c where pk->len is multiple of 5
+// For ECC octad = k
+pktype X509_extract_private_key(octad *c,octad *pk)
+{
+    int i, j, k, fin, len, rlen, flen, tlen, tot, end;
+    char soid[12];
+    octad SOID = {0, sizeof(soid), soid};
+    pktype ret;
+
+    ret.type = 0;
+    ret.hash = 0;
+    j=0;
+
+    len = getalen(SEQ, c->val, j);  // Check for expected SEQ clause, and get length
+    if (len < 0) return ret;        // if not a SEQ clause, there is a problem, exit
+    j += skip(len);                 // skip over length to clause contents. Add len to skip clause
+
+    if (len + j != c->len) return ret;
+
+    len = getalen(INT, c->val, j);
+    if (len < 0) return ret;
+    j += skip(len) + len;            // jump over serial number clause (if there is one)
+
+    len = getalen(SEQ, c->val, j); 
+    if (len < 0) return ret;        
+    j += skip(len);
+
+// extract OID
+    len = getalen(OID, c->val, j);
+    if (len < 0) return ret;
+    j += skip(len);
+
+    fin = j + len;
+    if (len>SOID.max) return ret;
+    SOID.len = len;
+    for (i = 0; j < fin; j++)
+        SOID.val[i++] = c->val[j];
+    j=fin;
+
+    if (OCT_compare(&EDPK25519, &SOID)) 
+    { // Its an Ed25519 key
+        len = getalen(OCT, c->val, j);
+        if (len < 0) return ret;
+        j += skip(len);
+        len = getalen(OCT, c->val, j);
+        if (len < 0) return ret;
+        j += skip(len);
+        rlen=32;
+        if (rlen>pk->max) return ret;
+        pk->len=rlen;
+        for (i=0;i<rlen-len;i++)
+            pk->val[i]=0;
+        for (i=rlen-len;i<rlen;i++)
+            pk->val[i]=c->val[j++];
+        ret.type = X509_ECD;
+        ret.curve = USE_ED25519;
+    }
+    if (OCT_compare(&EDPK448, &SOID))
+    { // Its an Ed448 key
+        len = getalen(OCT, c->val, j);
+        if (len < 0) return ret;
+        j += skip(len);
+        len = getalen(OCT, c->val, j);
+        if (len < 0) return ret;
+        j += skip(len);
+        rlen=57;
+        if (rlen>pk->max) return ret;
+        pk->len=rlen;
+        for (i=0;i<rlen-len;i++)
+            pk->val[i]=0;
+        for (i=rlen-len;i<rlen;i++)
+            pk->val[i]=c->val[j++];
+        ret.type = X509_ECD;
+        ret.curve = USE_ED448;
+    }
+
+//------------------------------------------------------------------------------------------------------------
+// JS porovnanie OID PQ algoritmov a nastavenie dlzky kluca
+// parameter curve vyuzity na definovanie konkretneho algoritmu pre dalsie pouzitie
+
+    if (OCT_compare(&DILITHIUM5, &SOID))
+    { // Its a DILITHIUM5 key
+        len = getalen(OCT, c->val, j);
+        if (len < 0) return ret;
+        j += skip(len);
+        len = getalen(OCT, c->val, j);
+        if (len < 0) return ret;
+        j += skip(len);
+        tlen=len; 
+        if (tlen>pk->max)
+            tlen=pk->max;
+        for (i=0;i<tlen;i++)
+            pk->val[i]=c->val[j++];
+        pk->len=tlen;
+        ret.type=X509_PQ;
+        ret.curve=USE_DILITHIUM5;
+    }
+
+    if (OCT_compare(&DILITHIUM3, &SOID))
+    { // Its a DILITHIUM3 key
+        len = getalen(OCT, c->val, j);
+        if (len < 0) return ret;
+        j += skip(len);
+        len = getalen(OCT, c->val, j);
+        if (len < 0) return ret;
+        j += skip(len);
+        tlen=len; 
+        if (tlen>pk->max)
+            tlen=pk->max;
+        for (i=0;i<tlen;i++)
+            pk->val[i]=c->val[j++];
+        pk->len=tlen;
+        ret.type=X509_PQ;
+        ret.curve=USE_DILITHIUM3;
+    }
+    if (OCT_compare(&DILITHIUM2, &SOID))
+    { // Its a DILITHIUM2 key
+        len = getalen(OCT, c->val, j);
+        if (len < 0) return ret;
+        j += skip(len);
+        len = getalen(OCT, c->val, j);
+        if (len < 0) return ret;
+        j += skip(len);
+        tlen=len; 
+        if (tlen>pk->max)
+            tlen=pk->max;
+        for (i=0;i<tlen;i++)
+            pk->val[i]=c->val[j++];
+        pk->len=tlen;
+        ret.type=X509_PQ;
+        ret.curve=USE_DILITHIUM2;
+    }
+
+    if (OCT_compare(&MLDSA44, &SOID))
+    { // Its a MLDSA44 key
+        len = getalen(OCT, c->val, j);
+        if (len < 0) return ret;
+        j += skip(len);
+        len = getalen(OCT, c->val, j);
+        if (len < 0) return ret;
+        j += skip(len);
+        tlen=len; 
+        if (tlen>pk->max)
+            tlen=pk->max;
+        for (i=0;i<tlen;i++)
+            pk->val[i]=c->val[j++];
+        pk->len=tlen;
+        ret.type=X509_PQ;
+        ret.curve=USE_MLDSA44;
+    }
+
+    if (OCT_compare(&MLDSA65, &SOID))
+    { // Its a MLDSA65 key
+        len = getalen(OCT, c->val, j);
+        if (len < 0) return ret;
+        j += skip(len);
+        len = getalen(OCT, c->val, j);
+        if (len < 0) return ret;
+        j += skip(len);
+        tlen=len; 
+        if (tlen>pk->max)
+            tlen=pk->max;
+        for (i=0;i<tlen;i++)
+            pk->val[i]=c->val[j++];
+        pk->len=tlen;
+        ret.type=X509_PQ;
+        ret.curve=USE_MLDSA65;
+    }
+
+    if (OCT_compare(&MLDSA87, &SOID))
+    { // Its a MLDSA87 key
+        len = getalen(OCT, c->val, j);
+        if (len < 0) return ret;
+        j += skip(len);
+        len = getalen(OCT, c->val, j);
+        if (len < 0) return ret;
+        j += skip(len);
+        tlen=len; 
+        if (tlen>pk->max)
+            tlen=pk->max;
+        for (i=0;i<tlen;i++)
+            pk->val[i]=c->val[j++];
+        pk->len=tlen;
+        ret.type=X509_PQ;
+        ret.curve=USE_MLDSA87;
+    }
+
+    if (OCT_compare(&FALCON512, &SOID))
+    { // Its a FALCON512 key
+        len = getalen(OCT, c->val, j);
+        if (len < 0) return ret;
+        j += skip(len);
+        len = getalen(OCT, c->val, j);
+        if (len < 0) return ret;
+        j += skip(len);
+        tlen=len; 
+        if (tlen>pk->max)
+            tlen=pk->max;
+        for (i=0;i<tlen;i++)
+            pk->val[i]=c->val[j++];
+        pk->len=tlen;
+        ret.type=X509_PQ;
+        ret.curve=USE_FALCON512;
+    }
+
+    if (OCT_compare(&FALCON1024, &SOID))
+    { // Its a FALCON1024 key
+        len = getalen(OCT, c->val, j);
+        if (len < 0) return ret;
+        j += skip(len);
+        len = getalen(OCT, c->val, j);
+        if (len < 0) return ret;
+        j += skip(len);
+        tlen=len; 
+        if (tlen>pk->max)
+            tlen=pk->max;
+        for (i=0;i<tlen;i++)
+            pk->val[i]=c->val[j++];
+        pk->len=tlen;
+        ret.type=X509_PQ;
+        ret.curve=USE_FALCON1024;
+    }
+
+    if (OCT_compare(&SPHINCSSHA2128FSIMPLE, &SOID))
+    { // Its a SPHINCS_SHA2_128F_SIMPLE key
+        len = getalen(OCT, c->val, j);
+        if (len < 0) return ret;
+        j += skip(len);
+        len = getalen(OCT, c->val, j);
+        if (len < 0) return ret;
+        j += skip(len);
+        tlen=len; 
+        if (tlen>pk->max)
+            tlen=pk->max;
+        for (i=0;i<tlen;i++)
+            pk->val[i]=c->val[j++];
+        pk->len=tlen;
+        ret.type=X509_PQ;
+        ret.hash=X509_H256;
+        ret.curve=USE_SPHINCSSHA2128FSIMPLE;
+    }
+
+    if (OCT_compare(&SPHINCSSHA2128SSIMPLE, &SOID))
+    { // Its a SPHINCS_SHA2_128S_SIMPLE key
+        len = getalen(OCT, c->val, j);
+        if (len < 0) return ret;
+        j += skip(len);
+        len = getalen(OCT, c->val, j);
+        if (len < 0) return ret;
+        j += skip(len);
+        tlen=len; 
+        if (tlen>pk->max)
+            tlen=pk->max;
+        for (i=0;i<tlen;i++)
+            pk->val[i]=c->val[j++];
+        pk->len=tlen;
+        ret.type=X509_PQ;
+        ret.hash=X509_H256;
+        ret.curve=USE_SPHINCSSHA2128SSIMPLE;
+    }
+
+    if (OCT_compare(&SPHINCSSHAKE128FSIMPLE, &SOID))
+    { // Its a SPHINCS_SHAKE_128F_SIMPLE key
+        len = getalen(OCT, c->val, j);
+        if (len < 0) return ret;
+        j += skip(len);
+        len = getalen(OCT, c->val, j);
+        if (len < 0) return ret;
+        j += skip(len);
+        tlen=len; 
+        if (tlen>pk->max)
+            tlen=pk->max;
+        for (i=0;i<tlen;i++)
+            pk->val[i]=c->val[j++];
+        pk->len=tlen;
+        ret.type=X509_PQ;
+        ret.hash=X509_H256;
+        ret.curve=USE_SPHINCSSHAKE128FSIMPLE;
+    }
+/*
+    if (OCT_compare(&SPHINCSSHA2192FSIMPLE, &SOID))
+    { // Its a SPHINCS_SHAKE_128F_SIMPLE key
+        len = getalen(OCT, c->val, j);
+        if (len < 0) return ret;
+        j += skip(len);
+        len = getalen(OCT, c->val, j);
+        if (len < 0) return ret;
+        j += skip(len);
+        tlen=len; 
+        if (tlen>pk->max)
+            tlen=pk->max;
+        for (i=0;i<tlen;i++)
+            pk->val[i]=c->val[j++];
+        pk->len=tlen;
+        ret.type=X509_PQ;
+        ret.hash=X509_H256;
+        ret.curve=USE_SPHINCSSHA2192FSIMPLE;
+    }
+*/
+//------------------------------------------------------------------------------------------------------------
+
+    if (OCT_compare(&HYBRID, &SOID))
+    { // Its a P256 key followed by a DILITHIUM2 key
+        len = getalen(OCT, c->val, j);
+        if (len < 0) return ret;
+        j += skip(len);
+        len = getalen(OCT, c->val, j);
+        if (len < 0) return ret;
+        j += skip(len);
+        tlen=len; 
+        if (tlen>pk->max)
+            tlen=pk->max;
+        j+=4; tlen-=4; 
+
+        tot=j+tlen;
+        len = getalen(SEQ, c->val, j);
+        if (len < 0) return ret;
+        j += skip(len);
+        end=j+len;
+        len = getalen(INT, c->val, j);
+        if (len < 0) return ret;
+        j += skip(len)+len;
+        len = getalen(OCT, c->val, j);
+        if (len < 0) return ret;
+        j += skip(len);
+
+        if (len>pk->max) return ret;
+        for (i=0;i<len;i++)
+            pk->val[i]=c->val[j++];
+
+        j=end; // skip ahead to PQ private key
+        tlen=tot-j;
+        if (tlen+len>pk->max) return ret;
+        pk->len=tlen+len;
+        for (i=0;i<tlen;i++)
+            pk->val[len+i]=c->val[j++];
+
+        ret.type=X509_HY;
+        ret.curve=8*tlen;
+    }
+
+    if (OCT_compare(&ECPK, &SOID))
+    { // Its an ECC key
+        len = getalen(OID, c->val, j);
+        if (len < 0) return ret;
+        j += skip(len);
+
+        fin = j + len;
+        if (len>SOID.max) return ret;
+        SOID.len = len;
+        for (i = 0; j < fin; j++)
+            SOID.val[i++] = c->val[j];
+        j=fin;           
+        
+        len = getalen(OCT, c->val, j);
+        if (len < 0) return ret;
+        j += skip(len);
+
+        len = getalen(SEQ, c->val, j); 
+        if (len < 0) return ret; 
+        j += skip(len);
+
+        len = getalen(INT, c->val, j);
+        if (len < 0) return ret;
+        j += skip(len) + len; // jump over version
+
+        len = getalen(OCT, c->val, j);
+        if (len < 0) return ret;
+        j += skip(len);
+
+        ret.type = X509_ECC;
+        if (OCT_compare(&PRIME256V1, &SOID)) {
+            ret.curve = USE_NIST256;
+            rlen=32;
+        }
+        if (OCT_compare(&SECP384R1, &SOID)) {
+            ret.curve = USE_NIST384;
+            rlen=48;
+        }
+        if (OCT_compare(&SECP521R1, &SOID)) {
+            rlen=66;
+            ret.curve = USE_NIST521;
+        }
+        if (rlen>pk->max)
+        {
+            ret.curve=0;
+            return ret;
+        }
+        pk->len=rlen;
+        for (i=0;i<rlen-len;i++)
+            pk->val[i]=0;
+        for (i=rlen-len;i<rlen;i++)
+            pk->val[i]=c->val[j++];
+
+    }
+    if (OCT_compare(&RSAPK, &SOID))
+    { // Its an RSA key
+        len = getalen(NUL, c->val, j);
+        if (len<0) return ret;
+        j += skip(len);
+
+        len = getalen(OCT, c->val, j);
+        if (len < 0) return ret;
+        j += skip(len);
+
+        len = getalen(SEQ, c->val, j); 
+        if (len < 0) return ret; 
+        j += skip(len);
+
+        len = getalen(INT, c->val, j);
+        if (len < 0) return ret;
+        j += skip(len) + len; // jump over version
+
+        len = getalen(INT, c->val, j);
+        if (len < 0) return ret;
+        j += skip(len) + len; // jump over n
+
+        len = getalen(INT, c->val, j);
+        if (len < 0) return ret;
+        j += skip(len) + len; // jump over e
+
+        len = getalen(INT, c->val, j);
+        if (len < 0) return ret;
+        j += skip(len) + len; // jump over d
+
+        len = getalen(INT, c->val, j);
+        if (len < 0) return ret;
+        j += skip(len); // get p
+        if (c->val[j] == 0)
+        { // skip leading zero
+            j++;
+            len--;
+        }
+        rlen=bround(len);
+        if (5*rlen>pk->max)
+            return ret;
+
+        for (i=0;i<rlen-len;i++)
+            pk->val[i]=0;
+
+        for (i=rlen-len;i<rlen;i++)
+            pk->val[i]=c->val[j++];
+
+        flen=rlen;                // should be same length for all
+        for (k=1;k<5;k++)
+        {
+            len = getalen(INT,c->val,j);
+            if (len<0) return ret;
+            j += skip(len);        // get q,dp,dq,c
+            if (c->val[j] == 0)
+            { // skip leading zero
+                j++;
+                len--;
+            }
+            rlen=bround(len);
+            if (rlen!=flen) return ret;
+            for (i=0;i<rlen-len;i++)
+                pk->val[i]=0;
+            for (i=rlen-len;i<rlen;i++)
+                pk->val[k*flen+i]=c->val[j++];
+        }
+        pk->len=5*flen;
+        ret.type = X509_RSA;
+        ret.curve = 16 * flen;
+    }
+    return ret;
+}
+
+//  Input signed cert as octad, and extract signature
+//  Return 0 for failure, ECC for Elliptic Curve signature, RSA for RSA signature
+//  Note that signature type is not provided here - its the type of the public key that
+//  is used to verify it that matters, and which determines for example the curve to be used!
+pktype X509_extract_cert_sig(octad *sc, octad *sig)
+{
+    int i, j, k, fin, len, rlen, slen, sj, ex, end, siglen;
+    char soid[12];
+    octad SOID = {0, sizeof(soid), soid};
+    pktype ret;
+
+    ret.type = 0;
+    ret.hash = 0;
+
+    j = 0;
+
+    len = getalen(SEQ, sc->val, j); // Check for expected SEQ clause, and get length
+    if (len < 0) return ret;        // if not a SEQ clause, there is a problem, exit
+    j += skip(len);                 // skip over length to clause contents. Add len to skip clause
+
+    if (len + j != sc->len) return ret;
+
+    len = getalen(SEQ, sc->val, j);
+    if (len < 0) return ret;
+    j += skip(len) + len; // jump over cert to signature OID
+
+    len = getalen(SEQ, sc->val, j);
+    if (len < 0) return ret;
+    j += skip(len);
+
+    sj = j + len; // Needed to jump over signature OID
+
+// dive in to extract OID
+    len = getalen(OID, sc->val, j);
+    if (len < 0) return ret;
+    j += skip(len);
+
+    fin = j + len;
+    if (len>SOID.max) return ret;
+    SOID.len = len;
+    for (i = 0; j < fin; j++)
+        SOID.val[i++] = sc->val[j];
+
+    // check OID here..
+    if (OCT_compare(&EDPK25519, &SOID))
+    {
+        ret.type = X509_ECD;
+        ret.hash = X509_H512;
+    }
+    if (OCT_compare(&EDPK448, &SOID))
+    {
+        ret.type = X509_ECD;
+        ret.hash = X509_SHAKE256;
+    }
+    if (OCT_compare(&ECCSHA256, &SOID))
+    {
+        ret.type = X509_ECC;
+        ret.hash = X509_H256;
+    }
+    if (OCT_compare(&ECCSHA384, &SOID))
+    {
+        ret.type = X509_ECC;
+        ret.hash = X509_H384;
+    }
+    if (OCT_compare(&ECCSHA512, &SOID))
+    {
+        ret.type = X509_ECC;
+        ret.hash = X509_H512;
+    }
+    if (OCT_compare(&RSASHA256, &SOID))
+    {
+        ret.type = X509_RSA;
+        ret.hash = X509_H256;
+    }
+    if (OCT_compare(&RSASHA384, &SOID))
+    {
+        ret.type = X509_RSA;
+        ret.hash = X509_H384;
+    }
+    if (OCT_compare(&RSASHA512, &SOID))
+    {
+        ret.type = X509_RSA;
+        ret.hash = X509_H512;
+    }
+
+//------------------------------------------------------------
+// JS doplnene PQ algoritmy 
+
+    if (OCT_compare(&DILITHIUM5, &SOID))
+    {
+        ret.type = X509_PQ;
+        ret.hash = 0; // hash type is implicit
+        ret.curve = USE_DILITHIUM5; 
+    }
+    if (OCT_compare(&DILITHIUM3, &SOID))
+    {
+        ret.type = X509_PQ;
+        ret.hash = 0; // hash type is implicit
+        ret.curve = USE_DILITHIUM3; 
+    }
+    if (OCT_compare(&DILITHIUM2, &SOID))
+    {
+        ret.type = X509_PQ;
+        ret.hash = 0; // hash type is implicit
+        ret.curve = USE_DILITHIUM2; 
+    }
+    if (OCT_compare(&MLDSA44, &SOID))
+    {
+        ret.type = X509_PQ;
+        ret.hash = 0; // hash type is implicit
+        ret.curve = USE_MLDSA44; 
+    }
+    if (OCT_compare(&MLDSA65, &SOID))
+    {
+        ret.type = X509_PQ;
+        ret.hash = 0; // hash type is implicit
+        ret.curve = USE_MLDSA65; 
+    }
+    if (OCT_compare(&MLDSA87, &SOID))
+    {
+        ret.type = X509_PQ;
+        ret.hash = 0; // hash type is implicit
+        ret.curve = USE_MLDSA87; 
+    }
+    if (OCT_compare(&FALCON512, &SOID))
+    {
+        ret.type = X509_PQ;
+        ret.hash = 0; // hash type is implicit
+        ret.curve = USE_FALCON512;
+    }
+    if (OCT_compare(&FALCON1024, &SOID))
+    {
+        ret.type = X509_PQ;
+        ret.hash = 0; // hash type is implicit
+        ret.curve = USE_FALCON1024;
+    }
+    if (OCT_compare(&SPHINCSSHA2128FSIMPLE, &SOID))
+    {
+        ret.type = X509_PQ;
+        ret.hash = X509_H256;
+        ret.curve = USE_SPHINCSSHA2128FSIMPLE;
+    }
+    if (OCT_compare(&SPHINCSSHA2128SSIMPLE, &SOID))
+    {
+        ret.type = X509_PQ;
+        ret.hash = X509_H256;
+        ret.curve = USE_SPHINCSSHA2128SSIMPLE;
+    }
+
+    if (OCT_compare(&SPHINCSSHAKE128FSIMPLE, &SOID))
+    {
+        ret.type = X509_PQ;
+        ret.hash = X509_SHAKE256;
+        ret.curve = USE_SPHINCSSHAKE128FSIMPLE;
+    }
+/*    if (OCT_compare(&SPHINCSSHA2192FSIMPLE, &SOID))
+    {
+        ret.type = X509_PQ;
+        ret.hash = X509_H256; 
+        ret.curve = USE_SPHINCSSHA2192FSIMPLE;
+    }
+*/
+//------------------------------------------------------------
+
+    if (OCT_compare(&HYBRID, &SOID))
+    {
+        ret.type = X509_HY;
+        ret.hash = 0; // hash type is implicit
+    }
+    if (ret.type == 0) return ret; // unsupported type
+
+    j = sj; // jump out to signature
+
+    len = getalen(BIT, sc->val, j);
+    if (len < 0)
+    {
+        ret.type = 0;
+        return ret;
+    }
+    j += skip(len);
+    j++;
+    len--; // skip bit shift (hopefully 0!)
+
+    if (ret.type==X509_ECD)
+    {
+        if (len>sig->max)
+        {
+            ret.type=0;
+            return ret;
+        }
+        sig->len = len;
+        i = 0;
+        fin = j + len;
+        for (; j < fin; j++)
+            sig->val[i++] = sc->val[j];
+
+        if (ret.hash == X509_H512) ret.curve = USE_ED25519;
+        if (ret.hash == X509_SHAKE256) ret.curve = USE_ED448;
+    }
+
+    if (ret.type == X509_ECC)
+    {
+        // signature in the form (r,s)
+        len = getalen(SEQ, sc->val, j);
+        if (len < 0)
+        {
+            ret.type = 0;
+            return ret;
+        }
+        j += skip(len);
+
+        // pick up r part of signature
+        len = getalen(INT, sc->val, j);
+        if (len < 0)
+        {
+            ret.type = 0;
+            return ret;
+        }
+        j += skip(len);
+
+        if (sc->val[j] == 0)
+        {
+            // skip leading zero
+            j++;
+            len--;
+        }
+        rlen = bround(len);
+
+        ex = rlen - len;
+        if (2*rlen>sig->max)
+        {
+            ret.type=0;
+            return ret;
+        }
+        sig->len = 2 * rlen;
+
+        i = 0;
+        for (k = 0; k < ex; k++)
+            sig->val[i++] = 0;
+
+        fin = j + len;
+        for (; j < fin; j++)
+            sig->val[i++] = sc->val[j];
+
+        // pick up s part of signature
+        len = getalen(INT, sc->val, j);
+        if (len < 0)
+        {
+            ret.type = 0;
+            return ret;
+        }
+        j += skip(len);
+
+        if (sc->val[j] == 0)
+        {
+            // skip leading zeros
+            j++;
+            len--;
+        }
+        rlen = bround(len);
+        ex = rlen - len;
+        for (k = 0; k < ex; k++)
+            sig->val[i++] = 0;
+
+        fin = j + len;
+        for (; j < fin; j++)
+            sig->val[i++] = sc->val[j];
+
+        if (ret.hash == X509_H256) ret.curve = USE_NIST256;
+        if (ret.hash == X509_H384) ret.curve = USE_NIST384;
+        if (ret.hash == X509_H512) ret.curve = USE_NIST521;
+    }
+    if (ret.type == X509_RSA)
+    {
+        rlen = bround(len);
+        ex = rlen - len;
+
+        if (rlen>sig->max)
+        {
+            ret.type=0;
+            return ret;
+        }
+
+        sig->len = rlen;
+        i = 0;
+        for (k = 0; k < ex; k++)
+            sig->val[i++] = 0;
+
+        fin = j + len;
+        for (; j < fin; j++)
+            sig->val[i++] = sc->val[j];
+
+        ret.curve = 8*rlen;
+    }
+    if (ret.type == X509_PQ)
+    {
+        if (len>sig->max)
+        {
+            ret.type=0;
+            return ret;
+        }
+        sig->len = len;
+        fin = j + len;
+        for (i=0; j < fin; j++)
+            sig->val[i++] = sc->val[j];
+    }
+    if (ret.type == X509_HY)
+    {
+        j+=4;
+        len-=4;
+        end=j+len;
+// first get ECC sig
+        len = getalen(SEQ, sc->val, j);
+        if (len < 0) {
+            ret.type=0;
+            return ret;
+        }
+        j += skip(len);
+        // pick up r part of signature
+        len = getalen(INT, sc->val, j);
+        if (len < 0) {
+            ret.type=0;
+            return ret;
+        }
+        j += skip(len);
+        if (sc->val[j]==0) {
+            j++;
+            len-=1;
+        }
+        rlen=bround(len);
+        ex=rlen-len;
+        siglen=2*rlen;
+        if (siglen>sig->max)
+        {
+            ret.type=0;
+            return ret;
+        }
+        
+        slen=0;
+        for (i=0;i<ex;i++)
+            sig->val[slen++]=0;
+        fin=j+len;
+        while (j<fin)
+            sig->val[slen++]=sc->val[j++];
+        // pick up s part of signature
+        len = getalen(INT, sc->val, j);
+        if (len < 0) {
+            ret.type=0;
+            return ret;
+        }
+        j += skip(len);
+        if (sc->val[j]==0) {
+            j++;
+            len-=1;
+        }
+        rlen=bround(len);
+        ex=rlen-len;
+        for (i=0;i<ex;i++)
+            sig->val[slen++]=0;
+        fin=j+len;
+        while (j<fin)
+            sig->val[slen++]=sc->val[j++];
+
+// now get PQ sig
+        siglen+=end-j;
+        if (siglen>sig->max)
+        {
+            ret.type=0;
+            return ret;
+        }
+        sig->len=siglen; /**/
+        while (j<end)
+            sig->val[slen++]=sc->val[j++];
+        ret.curve=USE_NIST256;
+    }
+    return ret;
+}
+
+// Extract certificate from signed cert
+int X509_extract_cert(octad *sc, octad *cert)
+{
+    int i, j, fin, len, k;
+
+    j = 0;
+    len = getalen(SEQ, sc->val, j);
+
+    if (len < 0) return 0;
+    j += skip(len);
+
+    k = j;
+
+    len = getalen(SEQ, sc->val, j);
+    if (len < 0) return 0;
+    j += skip(len);
+
+    fin = j + len;
+    if (fin-k>cert->max) return 0;
+    cert->len = fin - k;
+    for (i = k; i < fin; i++) cert->val[i - k] = sc->val[i];
+
+    return 1;
+}
+
+
+
+
+// find index to start of ASN.1 raw public key, and return its length
+int X509_find_public_key(octad *c,int *ptr)
+{
+    int j, k, fin, len;
+
+    j = 0;
+
+    len = getalen(SEQ, c->val, j);
+    if (len < 0) return 0;
+    j += skip(len);
+
+    if (len + j != c->len) return 0;
+
+    len = getalen(ANY, c->val, j);
+    if (len < 0) return 0;
+    j += skip(len) + len; //jump over version clause
+
+    len = getalen(INT, c->val, j);
+
+    if (len > 0) j += skip(len) + len; // jump over serial number clause (if there is one)
+
+    len = getalen(SEQ, c->val, j);
+    if (len < 0) return 0;
+    j += skip(len) + len; // jump over signature algorithm
+
+    len = getalen(SEQ, c->val, j);
+    if (len < 0) return 0;
+    j += skip(len) + len; // skip issuer
+
+    len = getalen(SEQ, c->val, j);
+    if (len < 0) return 0;
+    j += skip(len) + len; // skip validity
+
+    len = getalen(SEQ, c->val, j);
+    if (len < 0) return 0;
+    j += skip(len) + len; // skip subject
+
+    k=j;
+    len = getalen(SEQ, c->val, j); // look ahead to determine length
+    if (len < 0) return 0;
+    j += skip(len); //
+
+    fin=j+len;
+    *ptr=k;
+    return fin-k;
+}
+
+// get Public Key details from ASN.1 description
+pktype X509_get_public_key(octad *c,octad *key) 
+{
+    int i, j, fin, len, sj;
+    char koid[12];     /*****/
+    octad KOID = {0, sizeof(koid), koid};
+    pktype ret;
+
+    ret.type = ret.hash = 0;
+    ret.curve = -1;
+
+    j=0;
+
+    len = getalen(SEQ, c->val, j);
+    if (len < 0) return ret;
+    j += skip(len); //
+
+    len = getalen(SEQ, c->val, j);
+    if (len < 0) return ret;
+    j += skip(len);
+
+// ** Maybe dive in and check Public Key OIDs here?
+// ecpublicKey & prime256v1, secp384r1 or secp521r1 for ECC
+// rsapublicKey for RSA
+
+    sj = j + len;
+
+    len = getalen(OID, c->val, j);
+    if (len < 0) return ret;
+    j += skip(len);
+
+    fin = j + len;
+    if (len>KOID.max) return ret;
+    KOID.len = len;
+    for (i = 0; j < fin; j++)
+        KOID.val[i++] = c->val[j];
+
+    ret.type = 0;
+    if (OCT_compare(&ECPK, &KOID)) ret.type = X509_ECC;
+    if (OCT_compare(&EDPK25519, &KOID)) {ret.type = X509_ECD; ret.curve=USE_ED25519;}
+    if (OCT_compare(&EDPK448, &KOID)) {ret.type = X509_ECD;  ret.curve=USE_ED448;}
+    if (OCT_compare(&RSAPK, &KOID)) ret.type = X509_RSA;
+    if (OCT_compare(&HYBRID, &KOID)) ret.type = X509_HY;
+    // JS pridane PQ algoritmy, parameter curve pouzity na definovanie konkretneho algoritmu pre dalsie funkcie 
+    if (OCT_compare(&DILITHIUM2, &KOID)) {ret.type = X509_PQ; ret.curve=USE_DILITHIUM2;}
+    if (OCT_compare(&DILITHIUM3, &KOID)) {ret.type = X509_PQ; ret.curve=USE_DILITHIUM3;}
+    if (OCT_compare(&DILITHIUM5, &KOID)) {ret.type = X509_PQ; ret.curve=USE_DILITHIUM5;}
+    if (OCT_compare(&MLDSA44, &KOID)) {ret.type = X509_PQ; ret.curve=USE_MLDSA44;}
+    if (OCT_compare(&MLDSA65, &KOID)) {ret.type = X509_PQ; ret.curve=USE_MLDSA65;}
+    if (OCT_compare(&MLDSA87, &KOID)) {ret.type = X509_PQ; ret.curve=USE_MLDSA87;}
+    if (OCT_compare(&FALCON512, &KOID)) {ret.type = X509_PQ; ret.curve=USE_FALCON512;}
+    if (OCT_compare(&FALCON1024, &KOID)) {ret.type = X509_PQ; ret.curve=USE_FALCON1024;}
+    if (OCT_compare(&SPHINCSSHA2128FSIMPLE, &KOID)) {ret.type = X509_PQ; ret.curve=USE_SPHINCSSHA2128FSIMPLE; ret.hash=X509_H256;}
+    if (OCT_compare(&SPHINCSSHA2128SSIMPLE, &KOID)) {ret.type = X509_PQ; ret.curve=USE_SPHINCSSHA2128SSIMPLE;}
+    if (OCT_compare(&SPHINCSSHAKE128FSIMPLE, &KOID)) {ret.type = X509_PQ; ret.curve=USE_SPHINCSSHAKE128FSIMPLE; ret.hash=X509_SHAKE256;} 
+    //if (OCT_compare(&SPHINCSSHA2192FSIMPLE, &KOID)) {ret.type = X509_PQ; ret.curve=USE_SPHINCSSHA2192FSIMPLE; ret.hash=X509_SHAKE256;}    
+
+    if (ret.type == 0) return ret;
+
+    if (ret.type == X509_ECC)
+    {
+        // which elliptic curve?
+        len = getalen(OID, c->val, j);
+        if (len < 0)
+        {
+            ret.type = 0;
+            return ret;
+        }
+        j += skip(len);
+
+        fin = j + len;
+        if (len>KOID.max)
+        {
+            ret.type=0;
+            return ret;
+        }
+        KOID.len = len;
+        for (i = 0; j < fin; j++)
+            KOID.val[i++] = c->val[j];
+
+        if (OCT_compare(&PRIME25519, &KOID)) ret.curve = USE_ED25519; /*****/
+        if (OCT_compare(&PRIME256V1, &KOID)) ret.curve = USE_NIST256;
+        if (OCT_compare(&SECP384R1, &KOID)) ret.curve = USE_NIST384;
+        if (OCT_compare(&SECP521R1, &KOID)) ret.curve = USE_NIST521;
+    }
+
+    j = sj; // skip to actual Public Key
+
+    len = getalen(BIT, c->val, j);
+    if (len < 0)
+    {
+        ret.type = 0;
+        return ret;
+    }
+    j += skip(len); //
+    j++;
+    len--; // skip bit shift (hopefully 0!)
+
+// extract key
+    if (key==NULL)
+        return ret;
+    if (ret.type == X509_ECC || ret.type == X509_ECD || ret.type == X509_PQ || ret.type == X509_HY)
+    {
+        if (ret.type==X509_HY)
+        {
+            j+=4;
+            len-=4;
+        }
+        if (len>key->max)
+        {
+            ret.type=0;
+            return ret;
+        }
+        key->len = len;
+        fin = j + len;
+        for (i = 0; j < fin; j++)
+            key->val[i++] = c->val[j];
+
+    }
+    //if (ret.type == X509_PQ  || ret.type == X509_HY) 
+     //   ret.curve=8*len;
+
+    if (ret.type == X509_RSA)
+    {
+        // Key is (modulus,exponent) - assume exponent is 65537
+        len = getalen(SEQ, c->val, j);
+        if (len < 0)
+        {
+            ret.type = 0;
+            return ret;
+        }
+        j += skip(len); //
+
+        len = getalen(INT, c->val, j); // get modulus
+        if (len < 0)
+        {
+            ret.type = 0;
+            return ret;
+        }
+        j += skip(len); //
+        if (c->val[j] == 0)
+        {
+            j++;
+            len--; // remove leading zero
+        }
+        if (len>key->max)
+        {
+            ret.type=0;
+            return ret;
+        }
+        key->len = len;
+        fin = j + len;
+        for (i = 0; j < fin; j++)
+            key->val[i++] = c->val[j];
+
+        ret.curve = 8 * len;
+    }
+    return ret;
+}
+
+// Extract Public Key from inside Certificate
+pktype X509_extract_public_key(octad *c, octad *key)
+{
+    int ptr=0;
+    int pklen=X509_find_public_key(c,&ptr);
+    octad CC={pklen,pklen,&c->val[ptr]};
+    return X509_get_public_key(&CC,key);
+}
+
+// Find pointer to main sections of cert, before extracting individual field
+// Find index to issuer in cert, and its length
+// This is the certificate DER encoded distinguished issuer name 
+int X509_find_issuer(octad *c,int *flen)
+{
+    int j, len;
+    *flen=0;
+    j = 0;
+    len = getalen(SEQ, c->val, j);
+    if (len < 0) return 0;
+    j += skip(len);
+
+    if (len + j != c->len) return 0;
+
+    len = getalen(ANY, c->val, j);
+    if (len < 0) return 0;
+    j += skip(len) + len;                // jump over version clause
+
+    len = getalen(INT, c->val, j);
+
+    if (len > 0) j += skip(len) + len;    // jump over serial number clause (if there is one)
+
+    len = getalen(SEQ, c->val, j);
+    if (len < 0) return 0;
+    j += skip(len) + len;                // jump over signature algorithm
+
+    len=getalen(SEQ,c->val,j);
+    *flen=len+skip(len);      // length of issuer
+
+    return j;
+}
+
+// Find index to validity period
+int X509_find_validity(octad *c)
+{
+    int j, len;
+    j = X509_find_issuer(c,&len);
+    j+=len; // skip issuer
+
+    //len = getalen(SEQ, c->val, j);
+    //if (len < 0) return 0;
+    //j += skip(len) + len; // skip issuer
+
+    return j;
+}
+
+// Find index to subject in cert
+int X509_find_subject(octad *c,int *flen)
+{
+    int j, len;
+    *flen=0;
+    j = X509_find_validity(c);
+
+    len = getalen(SEQ, c->val, j);
+    if (len < 0) return 0;
+    j += skip(len) + len; // skip validity
+
+    len=getalen(SEQ,c->val,j);
+    *flen=len+skip(len);
+
+    return j;
+}
+
+// Test for a self-signed certificate
+int X509_self_signed(octad *c)
+{
+    int i,m,slen,ilen;
+    int ksub=X509_find_subject(c,&slen);
+    int kiss=X509_find_issuer(c,&ilen);
+
+    //int sublen=getalen(SEQ,c->val,ksub);
+    //int isslen=getalen(SEQ,c->val,kiss);
+    //if (isslen!=sublen) return 0;
+    //ksub+=skip(sublen);
+    //kiss+=skip(isslen);
+    for (i=m=0;i<slen;i++)
+        m|=c->val[i+ksub] - c->val[i+kiss];
+    if (m!=0) return 0;
+    return 1;
+}
+
+// NOTE: When extracting cert information, we actually return just an index to the data inside the cert, and maybe its length
+// So no memory is assigned to store cert info. It is the callers responsibility to allocate such memory if required, and copy
+// cert information into it.
+
+// Find entity property indicated by SOID, given start of issuer or subject field. Return index in cert, flen=length of field
+
+int X509_find_entity_property(octad *c, octad *SOID, int start, int *flen)
+{
+    int i, j, k, fin, len, tlen;
+    char foid[50];  /*****/
+    octad FOID = {0, sizeof(foid), foid};
+
+    j = start;
+
+    tlen = getalen(SEQ, c->val, j);
+    if (tlen < 0) return 0;
+    j += skip(tlen);
+
+    for (k = j; j < k + tlen;)
+    {
+        // search for Owner OID
+        len = getalen(SET, c->val, j);
+        if (len < 0) return 0;
+        j += skip(len);
+        len = getalen(SEQ, c->val, j);
+        if (len < 0) return 0;
+        j += skip(len);
+        len = getalen(OID, c->val, j);
+        if (len < 0) return 0;
+        j += skip(len);
+        fin = j + len; // extract OID
+        if (len>FOID.max) return 0;
+        FOID.len = len;
+        for (i = 0; j < fin; j++)
+            FOID.val[i++] = c->val[j];
+        len = getalen(ANY, c->val, j); // get text, could be any type
+        if (len < 0) return 0;
+
+        j += skip(len);
+        if (OCT_compare(&FOID, SOID))
+        {
+            // if its the right one return
+            *flen = len;
+            return j;
+        }
+        j += len; // skip over it
+    }
+    *flen = 0; /*****/
+    return 0;
+}
+
+// Find start date of certificate validity period
+int X509_find_start_date(octad *c, int start)
+{
+    int j, len;
+    j = start;
+
+    len = getalen(SEQ, c->val, j);
+    if (len < 0) return 0;
+    j += skip(len);
+
+    len = getalen(UTC, c->val, j);
+    if (len < 0) 
+    {  // could be generalised time 
+        len = getalen(GTM, c->val, j);
+        if (len<0) return 0;
+        j += skip(len);
+        j += 2; // skip century
+    }
+    else j += skip(len);
+    return j;
+}
+
+// Find expiry date of certificate validity period
+int X509_find_expiry_date(octad *c, int start)
+{
+    int j, len;
+    j = start;
+
+    len = getalen(SEQ, c->val, j);
+    if (len < 0) return 0;
+    j += skip(len);
+
+    len = getalen(UTC, c->val, j);
+    if (len < 0) 
+    {
+        len = getalen(GTM,c->val,j);
+        if (len<0) return 0;
+    }
+    j += skip(len) + len;
+
+    len = getalen(UTC, c->val, j);
+    if (len < 0) 
+    {
+        len = getalen(GTM, c->val,j);
+        if (len<0) return 0;
+        j+=skip(len);
+        j+=2; // skip century
+    }
+    else j += skip(len);
+
+    return j;
+}
+
+// find certificate extensions
+int X509_find_extensions(octad *c)
+{
+    int j, len;
+    j=X509_find_subject(c,&len);
+    j+=len; // skip subject
+
+    //len = getalen(SEQ, c->val, j);
+    //if (len<0) return 0;
+    //j += skip(len)+len; // skip subject
+
+    len = getalen(SEQ, c->val, j);
+    if (len<0) return 0;
+    j += skip(len)+len; // skip public key
+
+    if (j>=c->len) return 0;
+    return j;
+}
+
+// find a particular extension
+int X509_find_extension(octad *c, octad *SOID, int start, int *flen)
+{
+    int i, j, k, fin, len, tlen, nj;
+    char foid[50];  /*****/
+    octad FOID = {0, sizeof(foid), foid};
+
+    j = start;
+
+    tlen = getalen(EXT, c->val, j);
+    if (tlen < 0) return 0;
+    j += skip(tlen);
+
+    tlen = getalen(SEQ, c->val, j);
+    if (tlen < 0) return 0;
+    j += skip(tlen);
+
+    for (k = j; j < k + tlen;)
+    {
+        // search for Owner OID
+        len = getalen(SEQ, c->val, j);
+        if (len < 0) return 0;
+        j += skip(len);  nj=j+len;
+        len = getalen(OID, c->val, j);
+        if (len < 0) return 0;
+        j += skip(len);
+        fin = j + len; // extract OID
+        if (len>FOID.max) return 0;
+        FOID.len = len;
+        for (i = 0; j < fin; j++)
+            FOID.val[i++] = c->val[j];
+        if (OCT_compare(&FOID, SOID))
+        {
+            // if its the right one return
+            *flen = nj-j;
+            return j;
+        }
+        j = nj; // skip over this extension
+    }
+    *flen = 0; /*****/
+    return 0;
+}
+
+// return 1 if name found, else 0, where name is URL
+// input cert, and pointer to SAN extension
+// Takes wild-card into consideration
+int X509_find_alt_name(octad *c,int start,char *name)
+{
+    int i,j,len,k,m,tlen,cmp,tag;
+
+    if (start==0) return 0;
+    j=start;
+    tlen = getalen(OCT, c->val, j);
+    if (tlen < 0) return 0;
+    j += skip(tlen);
+
+    tlen = getalen(SEQ, c->val, j);
+    if (tlen < 0) return 0;
+    j += skip(tlen);  
+    
+    for (k=j;j<k+tlen;)
+    {
+        tag=c->val[j]; tag&=0xff;
+        len = getalen(ANY, c->val, j);  
+        if (len < 0) return 0;
+        j += skip(len);               // ?? If its not dns, skip over it j+=len
+        if (tag!=DNS)
+        { // only interested in URLs
+            j+=len;
+            continue;
+        }
+        cmp=1; m=0;
+        if (c->val[j]=='*')
+        { // wildcard
+            j++; len--; // skip over *
+            while (name[m]!='.' && name[m]!=0)  // advance to first .
+                m++;
+        }
+        for (i=0;i<len;i++)
+        {
+            if (name[m]==0)
+            { // name has ended before comparison completed
+                cmp=0;
+                j++;
+                continue;
+            }
+            if (c->val[j++]!=name[m++])  // mismatch
+                cmp=0;
+        }
+        if (name[m]!=0) cmp=0; // name should have ended
+        if (cmp) return 1;
+    }
+    return 0;
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/libclient.dll.a b/TIIGER_TLS/PQ_TIIGER_TLS/libclient.dll.a
new file mode 100644
index 0000000..3c99622
Binary files /dev/null and b/TIIGER_TLS/PQ_TIIGER_TLS/libclient.dll.a differ
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/libtiitls.a b/TIIGER_TLS/PQ_TIIGER_TLS/libtiitls.a
new file mode 100644
index 0000000..37ff2ec
Binary files /dev/null and b/TIIGER_TLS/PQ_TIIGER_TLS/libtiitls.a differ
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/README.txt b/TIIGER_TLS/PQ_TIIGER_TLS/sal/README.txt
new file mode 100644
index 0000000..6221be5
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/README.txt
@@ -0,0 +1,51 @@
+Tento priecinok obsahuje priecinok so statickou kniznicou miracl core a vsetky
+potrebne hlavickove subory. Zlozka obsahuje celkovo 3 verzie kniznice 
+miracl core, kazda vygenerovana na inej architekture, resp. na inom operacnom 
+systeme, aby sa zaistilo, ze pouzivatel moze okamzite vyuzivat cely balik.
+
+Kazda zlozka podla nazvu zodpoveda prislusnej architekture operacneho systemu.
+Pred skompilovanim finalneho spustitelneho suboru pouzivatel skopiruje alebo 
+premenuje zlozku s kniznicou miracl core v zavislosti od pouzivaneho 
+prostredia. 
+
+V zakladnej verzii je pouzita kniznica miracl core pre Windows x64.
+
+POSTUP GENEROVANIA
+Celkovy proces generovania knižnice miracl core je velmi podobny na roznych
+platformach. Rozdiel je iba v pristupe instalacie pythonu.
+
+1. LINUX
+
+a) Nainštalujeme python
+sudo apt install python3
+
+b) Stiahneme repozitár knižnice a prejdeme do zložky cpp
+git clone https://github.com/miracl/core.git
+cd core/cpp
+
+c) Spustime automaticke generovanie kniznice
+python3 config64.py test
+
+2. WINDOWS x64
+
+a) Stiahneme a nainštalujeme python
+https://www.python.org/downloads/windows/
+
+b) Stiahneme knižnicu miracl core
+https://github.com/miracl/core/archive/refs/heads/master.zip
+cd core\cpp
+
+c) Spustime automaticke generovanie kniznice
+python config64.py test
+
+3. WINDOWS x86
+
+- bude doplnene pri finalnom generovani kniznice v najnovsej verzii
+
+---------------------------------------------------------------------
+Pouzita verzia kniznice v4.1
+Podla historie gitu obsahuje v4.1 rozne upravy nedefinovane v ciselnych
+updatoch kniznice.
+ 
+Posledné generovanie knižnice - 11-04-2024
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/core.a b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/core.a
new file mode 100644
index 0000000..533fa20
Binary files /dev/null and b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/core.a differ
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/.gitignore b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/.gitignore
new file mode 100644
index 0000000..2b5d52e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/.gitignore
@@ -0,0 +1,33 @@
+# Prerequisites
+*.d
+
+# Compiled Object files
+*.slo
+*.lo
+*.o
+*.obj
+
+# Precompiled Headers
+*.gch
+*.pch
+
+# Compiled Dynamic libraries
+*.so
+*.dylib
+*.dll
+
+# Fortran module files
+*.mod
+*.smod
+
+# Compiled Static libraries
+*.lai
+*.la
+*.a
+*.lib
+
+# Executables
+*.exe
+*.out
+*.app
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/aes.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/aes.cpp
new file mode 100644
index 0000000..9986370
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/aes.cpp
@@ -0,0 +1,803 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+
+/*
+ * Implementation of the NIST Advanced Ecryption Standard
+ *
+ * SU=m, SU is Stack Usage
+ */
+
+#include <stdlib.h>
+
+
+#include "arch.h"
+#include "core.h"
+
+using namespace core;
+
+/* this is fixed */
+#define NB 4
+
+/* Rotates 32-bit word left by 1, 2 or 3 byte  */
+
+#define ROTL8(x) (((x)<<8)|((x)>>24))
+#define ROTL16(x) (((x)<<16)|((x)>>16))
+#define ROTL24(x) (((x)<<24)|((x)>>8))
+
+static const uchar InCo[4] = {0xB, 0xD, 0x9, 0xE}; /* Inverse Coefficients */
+
+static const uchar ptab[] =
+{
+    1, 3, 5, 15, 17, 51, 85, 255, 26, 46, 114, 150, 161, 248, 19, 53,
+    95, 225, 56, 72, 216, 115, 149, 164, 247, 2, 6, 10, 30, 34, 102, 170,
+    229, 52, 92, 228, 55, 89, 235, 38, 106, 190, 217, 112, 144, 171, 230, 49,
+    83, 245, 4, 12, 20, 60, 68, 204, 79, 209, 104, 184, 211, 110, 178, 205,
+    76, 212, 103, 169, 224, 59, 77, 215, 98, 166, 241, 8, 24, 40, 120, 136,
+    131, 158, 185, 208, 107, 189, 220, 127, 129, 152, 179, 206, 73, 219, 118, 154,
+    181, 196, 87, 249, 16, 48, 80, 240, 11, 29, 39, 105, 187, 214, 97, 163,
+    254, 25, 43, 125, 135, 146, 173, 236, 47, 113, 147, 174, 233, 32, 96, 160,
+    251, 22, 58, 78, 210, 109, 183, 194, 93, 231, 50, 86, 250, 21, 63, 65,
+    195, 94, 226, 61, 71, 201, 64, 192, 91, 237, 44, 116, 156, 191, 218, 117,
+    159, 186, 213, 100, 172, 239, 42, 126, 130, 157, 188, 223, 122, 142, 137, 128,
+    155, 182, 193, 88, 232, 35, 101, 175, 234, 37, 111, 177, 200, 67, 197, 84,
+    252, 31, 33, 99, 165, 244, 7, 9, 27, 45, 119, 153, 176, 203, 70, 202,
+    69, 207, 74, 222, 121, 139, 134, 145, 168, 227, 62, 66, 198, 81, 243, 14,
+    18, 54, 90, 238, 41, 123, 141, 140, 143, 138, 133, 148, 167, 242, 13, 23,
+    57, 75, 221, 124, 132, 151, 162, 253, 28, 36, 108, 180, 199, 82, 246, 1
+};
+
+static const uchar ltab[] =
+{
+    0, 255, 25, 1, 50, 2, 26, 198, 75, 199, 27, 104, 51, 238, 223, 3,
+    100, 4, 224, 14, 52, 141, 129, 239, 76, 113, 8, 200, 248, 105, 28, 193,
+    125, 194, 29, 181, 249, 185, 39, 106, 77, 228, 166, 114, 154, 201, 9, 120,
+    101, 47, 138, 5, 33, 15, 225, 36, 18, 240, 130, 69, 53, 147, 218, 142,
+    150, 143, 219, 189, 54, 208, 206, 148, 19, 92, 210, 241, 64, 70, 131, 56,
+    102, 221, 253, 48, 191, 6, 139, 98, 179, 37, 226, 152, 34, 136, 145, 16,
+    126, 110, 72, 195, 163, 182, 30, 66, 58, 107, 40, 84, 250, 133, 61, 186,
+    43, 121, 10, 21, 155, 159, 94, 202, 78, 212, 172, 229, 243, 115, 167, 87,
+    175, 88, 168, 80, 244, 234, 214, 116, 79, 174, 233, 213, 231, 230, 173, 232,
+    44, 215, 117, 122, 235, 22, 11, 245, 89, 203, 95, 176, 156, 169, 81, 160,
+    127, 12, 246, 111, 23, 196, 73, 236, 216, 67, 31, 45, 164, 118, 123, 183,
+    204, 187, 62, 90, 251, 96, 177, 134, 59, 82, 161, 108, 170, 85, 41, 157,
+    151, 178, 135, 144, 97, 190, 220, 252, 188, 149, 207, 205, 55, 63, 91, 209,
+    83, 57, 132, 60, 65, 162, 109, 71, 20, 42, 158, 93, 86, 242, 211, 171,
+    68, 17, 146, 217, 35, 32, 46, 137, 180, 124, 184, 38, 119, 153, 227, 165,
+    103, 74, 237, 222, 197, 49, 254, 24, 13, 99, 140, 128, 192, 247, 112, 7
+};
+
+static const uchar fbsub[] =
+{
+    99, 124, 119, 123, 242, 107, 111, 197, 48, 1, 103, 43, 254, 215, 171, 118,
+    202, 130, 201, 125, 250, 89, 71, 240, 173, 212, 162, 175, 156, 164, 114, 192,
+    183, 253, 147, 38, 54, 63, 247, 204, 52, 165, 229, 241, 113, 216, 49, 21,
+    4, 199, 35, 195, 24, 150, 5, 154, 7, 18, 128, 226, 235, 39, 178, 117,
+    9, 131, 44, 26, 27, 110, 90, 160, 82, 59, 214, 179, 41, 227, 47, 132,
+    83, 209, 0, 237, 32, 252, 177, 91, 106, 203, 190, 57, 74, 76, 88, 207,
+    208, 239, 170, 251, 67, 77, 51, 133, 69, 249, 2, 127, 80, 60, 159, 168,
+    81, 163, 64, 143, 146, 157, 56, 245, 188, 182, 218, 33, 16, 255, 243, 210,
+    205, 12, 19, 236, 95, 151, 68, 23, 196, 167, 126, 61, 100, 93, 25, 115,
+    96, 129, 79, 220, 34, 42, 144, 136, 70, 238, 184, 20, 222, 94, 11, 219,
+    224, 50, 58, 10, 73, 6, 36, 92, 194, 211, 172, 98, 145, 149, 228, 121,
+    231, 200, 55, 109, 141, 213, 78, 169, 108, 86, 244, 234, 101, 122, 174, 8,
+    186, 120, 37, 46, 28, 166, 180, 198, 232, 221, 116, 31, 75, 189, 139, 138,
+    112, 62, 181, 102, 72, 3, 246, 14, 97, 53, 87, 185, 134, 193, 29, 158,
+    225, 248, 152, 17, 105, 217, 142, 148, 155, 30, 135, 233, 206, 85, 40, 223,
+    140, 161, 137, 13, 191, 230, 66, 104, 65, 153, 45, 15, 176, 84, 187, 22
+};
+
+static const uchar rbsub[] =
+{
+    82, 9, 106, 213, 48, 54, 165, 56, 191, 64, 163, 158, 129, 243, 215, 251,
+    124, 227, 57, 130, 155, 47, 255, 135, 52, 142, 67, 68, 196, 222, 233, 203,
+    84, 123, 148, 50, 166, 194, 35, 61, 238, 76, 149, 11, 66, 250, 195, 78,
+    8, 46, 161, 102, 40, 217, 36, 178, 118, 91, 162, 73, 109, 139, 209, 37,
+    114, 248, 246, 100, 134, 104, 152, 22, 212, 164, 92, 204, 93, 101, 182, 146,
+    108, 112, 72, 80, 253, 237, 185, 218, 94, 21, 70, 87, 167, 141, 157, 132,
+    144, 216, 171, 0, 140, 188, 211, 10, 247, 228, 88, 5, 184, 179, 69, 6,
+    208, 44, 30, 143, 202, 63, 15, 2, 193, 175, 189, 3, 1, 19, 138, 107,
+    58, 145, 17, 65, 79, 103, 220, 234, 151, 242, 207, 206, 240, 180, 230, 115,
+    150, 172, 116, 34, 231, 173, 53, 133, 226, 249, 55, 232, 28, 117, 223, 110,
+    71, 241, 26, 113, 29, 41, 197, 137, 111, 183, 98, 14, 170, 24, 190, 27,
+    252, 86, 62, 75, 198, 210, 121, 32, 154, 219, 192, 254, 120, 205, 90, 244,
+    31, 221, 168, 51, 136, 7, 199, 49, 177, 18, 16, 89, 39, 128, 236, 95,
+    96, 81, 127, 169, 25, 181, 74, 13, 45, 229, 122, 159, 147, 201, 156, 239,
+    160, 224, 59, 77, 174, 42, 245, 176, 200, 235, 187, 60, 131, 83, 153, 97,
+    23, 43, 4, 126, 186, 119, 214, 38, 225, 105, 20, 99, 85, 33, 12, 125
+};
+
+static const unsign32 rco[] =
+{1, 2, 4, 8, 16, 32, 64, 128, 27, 54, 108, 216, 171, 77, 154, 47};
+
+static const unsign32 ftable[] =
+{
+    0xa56363c6, 0x847c7cf8, 0x997777ee, 0x8d7b7bf6, 0xdf2f2ff, 0xbd6b6bd6,
+    0xb16f6fde, 0x54c5c591, 0x50303060, 0x3010102, 0xa96767ce, 0x7d2b2b56,
+    0x19fefee7, 0x62d7d7b5, 0xe6abab4d, 0x9a7676ec, 0x45caca8f, 0x9d82821f,
+    0x40c9c989, 0x877d7dfa, 0x15fafaef, 0xeb5959b2, 0xc947478e, 0xbf0f0fb,
+    0xecadad41, 0x67d4d4b3, 0xfda2a25f, 0xeaafaf45, 0xbf9c9c23, 0xf7a4a453,
+    0x967272e4, 0x5bc0c09b, 0xc2b7b775, 0x1cfdfde1, 0xae93933d, 0x6a26264c,
+    0x5a36366c, 0x413f3f7e, 0x2f7f7f5, 0x4fcccc83, 0x5c343468, 0xf4a5a551,
+    0x34e5e5d1, 0x8f1f1f9, 0x937171e2, 0x73d8d8ab, 0x53313162, 0x3f15152a,
+    0xc040408, 0x52c7c795, 0x65232346, 0x5ec3c39d, 0x28181830, 0xa1969637,
+    0xf05050a, 0xb59a9a2f, 0x907070e, 0x36121224, 0x9b80801b, 0x3de2e2df,
+    0x26ebebcd, 0x6927274e, 0xcdb2b27f, 0x9f7575ea, 0x1b090912, 0x9e83831d,
+    0x742c2c58, 0x2e1a1a34, 0x2d1b1b36, 0xb26e6edc, 0xee5a5ab4, 0xfba0a05b,
+    0xf65252a4, 0x4d3b3b76, 0x61d6d6b7, 0xceb3b37d, 0x7b292952, 0x3ee3e3dd,
+    0x712f2f5e, 0x97848413, 0xf55353a6, 0x68d1d1b9, 0x0, 0x2cededc1,
+    0x60202040, 0x1ffcfce3, 0xc8b1b179, 0xed5b5bb6, 0xbe6a6ad4, 0x46cbcb8d,
+    0xd9bebe67, 0x4b393972, 0xde4a4a94, 0xd44c4c98, 0xe85858b0, 0x4acfcf85,
+    0x6bd0d0bb, 0x2aefefc5, 0xe5aaaa4f, 0x16fbfbed, 0xc5434386, 0xd74d4d9a,
+    0x55333366, 0x94858511, 0xcf45458a, 0x10f9f9e9, 0x6020204, 0x817f7ffe,
+    0xf05050a0, 0x443c3c78, 0xba9f9f25, 0xe3a8a84b, 0xf35151a2, 0xfea3a35d,
+    0xc0404080, 0x8a8f8f05, 0xad92923f, 0xbc9d9d21, 0x48383870, 0x4f5f5f1,
+    0xdfbcbc63, 0xc1b6b677, 0x75dadaaf, 0x63212142, 0x30101020, 0x1affffe5,
+    0xef3f3fd, 0x6dd2d2bf, 0x4ccdcd81, 0x140c0c18, 0x35131326, 0x2fececc3,
+    0xe15f5fbe, 0xa2979735, 0xcc444488, 0x3917172e, 0x57c4c493, 0xf2a7a755,
+    0x827e7efc, 0x473d3d7a, 0xac6464c8, 0xe75d5dba, 0x2b191932, 0x957373e6,
+    0xa06060c0, 0x98818119, 0xd14f4f9e, 0x7fdcdca3, 0x66222244, 0x7e2a2a54,
+    0xab90903b, 0x8388880b, 0xca46468c, 0x29eeeec7, 0xd3b8b86b, 0x3c141428,
+    0x79dedea7, 0xe25e5ebc, 0x1d0b0b16, 0x76dbdbad, 0x3be0e0db, 0x56323264,
+    0x4e3a3a74, 0x1e0a0a14, 0xdb494992, 0xa06060c, 0x6c242448, 0xe45c5cb8,
+    0x5dc2c29f, 0x6ed3d3bd, 0xefacac43, 0xa66262c4, 0xa8919139, 0xa4959531,
+    0x37e4e4d3, 0x8b7979f2, 0x32e7e7d5, 0x43c8c88b, 0x5937376e, 0xb76d6dda,
+    0x8c8d8d01, 0x64d5d5b1, 0xd24e4e9c, 0xe0a9a949, 0xb46c6cd8, 0xfa5656ac,
+    0x7f4f4f3, 0x25eaeacf, 0xaf6565ca, 0x8e7a7af4, 0xe9aeae47, 0x18080810,
+    0xd5baba6f, 0x887878f0, 0x6f25254a, 0x722e2e5c, 0x241c1c38, 0xf1a6a657,
+    0xc7b4b473, 0x51c6c697, 0x23e8e8cb, 0x7cdddda1, 0x9c7474e8, 0x211f1f3e,
+    0xdd4b4b96, 0xdcbdbd61, 0x868b8b0d, 0x858a8a0f, 0x907070e0, 0x423e3e7c,
+    0xc4b5b571, 0xaa6666cc, 0xd8484890, 0x5030306, 0x1f6f6f7, 0x120e0e1c,
+    0xa36161c2, 0x5f35356a, 0xf95757ae, 0xd0b9b969, 0x91868617, 0x58c1c199,
+    0x271d1d3a, 0xb99e9e27, 0x38e1e1d9, 0x13f8f8eb, 0xb398982b, 0x33111122,
+    0xbb6969d2, 0x70d9d9a9, 0x898e8e07, 0xa7949433, 0xb69b9b2d, 0x221e1e3c,
+    0x92878715, 0x20e9e9c9, 0x49cece87, 0xff5555aa, 0x78282850, 0x7adfdfa5,
+    0x8f8c8c03, 0xf8a1a159, 0x80898909, 0x170d0d1a, 0xdabfbf65, 0x31e6e6d7,
+    0xc6424284, 0xb86868d0, 0xc3414182, 0xb0999929, 0x772d2d5a, 0x110f0f1e,
+    0xcbb0b07b, 0xfc5454a8, 0xd6bbbb6d, 0x3a16162c
+};
+
+static const unsign32 rtable[] =
+{
+    0x50a7f451, 0x5365417e, 0xc3a4171a, 0x965e273a, 0xcb6bab3b, 0xf1459d1f,
+    0xab58faac, 0x9303e34b, 0x55fa3020, 0xf66d76ad, 0x9176cc88, 0x254c02f5,
+    0xfcd7e54f, 0xd7cb2ac5, 0x80443526, 0x8fa362b5, 0x495ab1de, 0x671bba25,
+    0x980eea45, 0xe1c0fe5d, 0x2752fc3, 0x12f04c81, 0xa397468d, 0xc6f9d36b,
+    0xe75f8f03, 0x959c9215, 0xeb7a6dbf, 0xda595295, 0x2d83bed4, 0xd3217458,
+    0x2969e049, 0x44c8c98e, 0x6a89c275, 0x78798ef4, 0x6b3e5899, 0xdd71b927,
+    0xb64fe1be, 0x17ad88f0, 0x66ac20c9, 0xb43ace7d, 0x184adf63, 0x82311ae5,
+    0x60335197, 0x457f5362, 0xe07764b1, 0x84ae6bbb, 0x1ca081fe, 0x942b08f9,
+    0x58684870, 0x19fd458f, 0x876cde94, 0xb7f87b52, 0x23d373ab, 0xe2024b72,
+    0x578f1fe3, 0x2aab5566, 0x728ebb2, 0x3c2b52f, 0x9a7bc586, 0xa50837d3,
+    0xf2872830, 0xb2a5bf23, 0xba6a0302, 0x5c8216ed, 0x2b1ccf8a, 0x92b479a7,
+    0xf0f207f3, 0xa1e2694e, 0xcdf4da65, 0xd5be0506, 0x1f6234d1, 0x8afea6c4,
+    0x9d532e34, 0xa055f3a2, 0x32e18a05, 0x75ebf6a4, 0x39ec830b, 0xaaef6040,
+    0x69f715e, 0x51106ebd, 0xf98a213e, 0x3d06dd96, 0xae053edd, 0x46bde64d,
+    0xb58d5491, 0x55dc471, 0x6fd40604, 0xff155060, 0x24fb9819, 0x97e9bdd6,
+    0xcc434089, 0x779ed967, 0xbd42e8b0, 0x888b8907, 0x385b19e7, 0xdbeec879,
+    0x470a7ca1, 0xe90f427c, 0xc91e84f8, 0x0, 0x83868009, 0x48ed2b32,
+    0xac70111e, 0x4e725a6c, 0xfbff0efd, 0x5638850f, 0x1ed5ae3d, 0x27392d36,
+    0x64d90f0a, 0x21a65c68, 0xd1545b9b, 0x3a2e3624, 0xb1670a0c, 0xfe75793,
+    0xd296eeb4, 0x9e919b1b, 0x4fc5c080, 0xa220dc61, 0x694b775a, 0x161a121c,
+    0xaba93e2, 0xe52aa0c0, 0x43e0223c, 0x1d171b12, 0xb0d090e, 0xadc78bf2,
+    0xb9a8b62d, 0xc8a91e14, 0x8519f157, 0x4c0775af, 0xbbdd99ee, 0xfd607fa3,
+    0x9f2601f7, 0xbcf5725c, 0xc53b6644, 0x347efb5b, 0x7629438b, 0xdcc623cb,
+    0x68fcedb6, 0x63f1e4b8, 0xcadc31d7, 0x10856342, 0x40229713, 0x2011c684,
+    0x7d244a85, 0xf83dbbd2, 0x1132f9ae, 0x6da129c7, 0x4b2f9e1d, 0xf330b2dc,
+    0xec52860d, 0xd0e3c177, 0x6c16b32b, 0x99b970a9, 0xfa489411, 0x2264e947,
+    0xc48cfca8, 0x1a3ff0a0, 0xd82c7d56, 0xef903322, 0xc74e4987, 0xc1d138d9,
+    0xfea2ca8c, 0x360bd498, 0xcf81f5a6, 0x28de7aa5, 0x268eb7da, 0xa4bfad3f,
+    0xe49d3a2c, 0xd927850, 0x9bcc5f6a, 0x62467e54, 0xc2138df6, 0xe8b8d890,
+    0x5ef7392e, 0xf5afc382, 0xbe805d9f, 0x7c93d069, 0xa92dd56f, 0xb31225cf,
+    0x3b99acc8, 0xa77d1810, 0x6e639ce8, 0x7bbb3bdb, 0x97826cd, 0xf418596e,
+    0x1b79aec, 0xa89a4f83, 0x656e95e6, 0x7ee6ffaa, 0x8cfbc21, 0xe6e815ef,
+    0xd99be7ba, 0xce366f4a, 0xd4099fea, 0xd67cb029, 0xafb2a431, 0x31233f2a,
+    0x3094a5c6, 0xc066a235, 0x37bc4e74, 0xa6ca82fc, 0xb0d090e0, 0x15d8a733,
+    0x4a9804f1, 0xf7daec41, 0xe50cd7f, 0x2ff69117, 0x8dd64d76, 0x4db0ef43,
+    0x544daacc, 0xdf0496e4, 0xe3b5d19e, 0x1b886a4c, 0xb81f2cc1, 0x7f516546,
+    0x4ea5e9d, 0x5d358c01, 0x737487fa, 0x2e410bfb, 0x5a1d67b3, 0x52d2db92,
+    0x335610e9, 0x1347d66d, 0x8c61d79a, 0x7a0ca137, 0x8e14f859, 0x893c13eb,
+    0xee27a9ce, 0x35c961b7, 0xede51ce1, 0x3cb1477a, 0x59dfd29c, 0x3f73f255,
+    0x79ce1418, 0xbf37c773, 0xeacdf753, 0x5baafd5f, 0x146f3ddf, 0x86db4478,
+    0x81f3afca, 0x3ec468b9, 0x2c342438, 0x5f40a3c2, 0x72c31d16, 0xc25e2bc,
+    0x8b493c28, 0x41950dff, 0x7101a839, 0xdeb30c08, 0x9ce4b4d8, 0x90c15664,
+    0x6184cb7b, 0x70b632d5, 0x745c6c48, 0x4257b8d0
+};
+
+#define MR_TOBYTE(x) ((uchar)((x)))
+
+static unsign32 pack(const uchar *b)
+{
+    /* pack bytes into a 32-bit Word */
+    return ((unsign32)b[3] << 24) | ((unsign32)b[2] << 16) | ((unsign32)b[1] << 8) | (unsign32)b[0];
+}
+
+static void unpack(unsign32 a, uchar *b)
+{
+    /* unpack bytes from a word */
+    b[0] = MR_TOBYTE(a);
+    b[1] = MR_TOBYTE(a >> 8);
+    b[2] = MR_TOBYTE(a >> 16);
+    b[3] = MR_TOBYTE(a >> 24);
+}
+
+/* SU= 8 */
+static uchar bmul(uchar x, uchar y)
+{
+    /* x.y= AntiLog(Log(x) + Log(y)) */
+    if (x && y) return ptab[(ltab[x] + ltab[y]) % 255];
+    else return 0;
+}
+
+static unsign32 SubByte(unsign32 a)
+{
+    uchar b[4];
+    unpack(a, b);
+    b[0] = fbsub[b[0]];
+    b[1] = fbsub[b[1]];
+    b[2] = fbsub[b[2]];
+    b[3] = fbsub[b[3]];
+    return pack(b);
+}
+
+/* SU= 16 */
+static uchar product(unsign32 x, unsign32 y)
+{
+    /* dot product of two 4-byte arrays */
+    uchar xb[4], yb[4];
+    unpack(x, xb);
+    unpack(y, yb);
+    return bmul(xb[0], yb[0])^bmul(xb[1], yb[1])^bmul(xb[2], yb[2])^bmul(xb[3], yb[3]);
+}
+
+static unsign32 InvMixCol(unsign32 x)
+{
+    /* matrix Multiplication */
+    unsign32 y, m;
+    uchar b[4];
+
+    m = pack(InCo);
+    b[3] = product(m, x);
+    m = ROTL24(m);
+    b[2] = product(m, x);
+    m = ROTL24(m);
+    b[1] = product(m, x);
+    m = ROTL24(m);
+    b[0] = product(m, x);
+    y = pack(b);
+    return y;
+}
+
+/* SU= 8 */
+/* reset cipher */
+void core::AES_reset(core::aes *a, int mode, char *iv)
+{
+    /* reset mode, or reset iv */
+    int i;
+    a->mode = mode;
+    for (i = 0; i < 4 * NB; i++)
+        a->f[i] = 0;
+    if (mode != ECB && iv != NULL)
+    {
+        for (i = 0; i < 4 * NB; i++)
+            a->f[i] = iv[i];
+    }
+}
+
+void core::AES_getreg(core::aes *a, char *ir)
+{
+    int i;
+    for (i = 0; i < 4 * NB; i++) ir[i] = a->f[i];
+}
+
+/* SU= 72 */
+/* Initialise cipher */
+int core::AES_init(core::aes* a, int mode, int nk, char *key, char *iv)
+{
+    /* Key length Nk=16, 24 or 32 bytes */
+    /* Key Scheduler. Create expanded encryption key */
+    int i, j, k, N, nr;
+    unsign32 CipherKey[8];
+
+    nk /= 4;
+
+    if (nk != 4 && nk != 6 && nk != 8) return 0;
+
+    nr = 6 + nk;
+
+    a->Nk = nk;
+    a->Nr = nr;
+
+    AES_reset(a, mode, iv);
+
+    N = NB * (nr + 1);
+
+    for (i = j = 0; i < nk; i++, j += 4)
+    {
+        CipherKey[i] = pack((uchar *)&key[j]);
+    }
+    for (i = 0; i < nk; i++) a->fkey[i] = CipherKey[i];
+    for (j = nk, k = 0; j < N; j += nk, k++)
+    {
+        a->fkey[j] = a->fkey[j - nk] ^ SubByte(ROTL24(a->fkey[j - 1]))^rco[k];
+        if (nk <= 6)
+        {
+            for (i = 1; i < nk && (i + j) < N; i++)
+                a->fkey[i + j] = a->fkey[i + j - nk] ^ a->fkey[i + j - 1];
+        }
+        else
+        {
+            for (i = 1; i < 4 && (i + j) < N; i++)
+                a->fkey[i + j] = a->fkey[i + j - nk] ^ a->fkey[i + j - 1];
+            if ((j + 4) < N) a->fkey[j + 4] = a->fkey[j + 4 - nk] ^ SubByte(a->fkey[j + 3]);
+            for (i = 5; i < nk && (i + j) < N; i++)
+                a->fkey[i + j] = a->fkey[i + j - nk] ^ a->fkey[i + j - 1];
+        }
+
+    }
+    /* now for the expanded decrypt key in reverse order */
+
+    for (j = 0; j < NB; j++) a->rkey[j + N - NB] = a->fkey[j];
+    for (i = NB; i < N - NB; i += NB)
+    {
+        k = N - NB - i;
+        for (j = 0; j < NB; j++) a->rkey[k + j] = InvMixCol(a->fkey[i + j]);
+    }
+    for (j = N - NB; j < N; j++) a->rkey[j - N + NB] = a->fkey[j];
+    return 1;
+}
+
+/* SU= 80 */
+/* Encrypt a single block */
+void core::AES_ecb_encrypt(core::aes *a, uchar *buff)
+{
+    int i, j, k;
+    unsign32 p[4], q[4], *x, *y, *t;
+
+    for (i = j = 0; i < NB; i++, j += 4)
+    {
+        p[i] = pack((uchar *)&buff[j]);
+        p[i] ^= a->fkey[i];
+    }
+
+    k = NB;
+    x = p;
+    y = q;
+
+    /* State alternates between x and y */
+    for (i = 1; i < a->Nr; i++)
+    {
+
+        y[0] = a->fkey[k] ^ ftable[MR_TOBYTE(x[0])] ^
+               ROTL8(ftable[MR_TOBYTE(x[1] >> 8)])^
+               ROTL16(ftable[MR_TOBYTE(x[2] >> 16)])^
+               ROTL24(ftable[x[3] >> 24]);
+        y[1] = a->fkey[k + 1] ^ ftable[MR_TOBYTE(x[1])] ^
+               ROTL8(ftable[MR_TOBYTE(x[2] >> 8)])^
+               ROTL16(ftable[MR_TOBYTE(x[3] >> 16)])^
+               ROTL24(ftable[x[0] >> 24]);
+        y[2] = a->fkey[k + 2] ^ ftable[MR_TOBYTE(x[2])] ^
+               ROTL8(ftable[MR_TOBYTE(x[3] >> 8)])^
+               ROTL16(ftable[MR_TOBYTE(x[0] >> 16)])^
+               ROTL24(ftable[x[1] >> 24]);
+        y[3] = a->fkey[k + 3] ^ ftable[MR_TOBYTE(x[3])] ^
+               ROTL8(ftable[MR_TOBYTE(x[0] >> 8)])^
+               ROTL16(ftable[MR_TOBYTE(x[1] >> 16)])^
+               ROTL24(ftable[x[2] >> 24]);
+
+        k += 4;
+        t = x;
+        x = y;
+        y = t;    /* swap pointers */
+    }
+
+    /* Last Round */
+
+    y[0] = a->fkey[k] ^ (unsign32)fbsub[MR_TOBYTE(x[0])] ^
+           ROTL8((unsign32)fbsub[MR_TOBYTE(x[1] >> 8)])^
+           ROTL16((unsign32)fbsub[MR_TOBYTE(x[2] >> 16)])^
+           ROTL24((unsign32)fbsub[x[3] >> 24]);
+    y[1] = a->fkey[k + 1] ^ (unsign32)fbsub[MR_TOBYTE(x[1])] ^
+           ROTL8((unsign32)fbsub[MR_TOBYTE(x[2] >> 8)])^
+           ROTL16((unsign32)fbsub[MR_TOBYTE(x[3] >> 16)])^
+           ROTL24((unsign32)fbsub[x[0] >> 24]);
+    y[2] = a->fkey[k + 2] ^ (unsign32)fbsub[MR_TOBYTE(x[2])] ^
+           ROTL8((unsign32)fbsub[MR_TOBYTE(x[3] >> 8)])^
+           ROTL16((unsign32)fbsub[MR_TOBYTE(x[0] >> 16)])^
+           ROTL24((unsign32)fbsub[x[1] >> 24]);
+    y[3] = a->fkey[k + 3] ^ (unsign32)fbsub[MR_TOBYTE(x[3])] ^
+           ROTL8((unsign32)fbsub[MR_TOBYTE(x[0] >> 8)])^
+           ROTL16((unsign32)fbsub[MR_TOBYTE(x[1] >> 16)])^
+           ROTL24((unsign32)fbsub[x[2] >> 24]);
+
+    for (i = j = 0; i < NB; i++, j += 4)
+    {
+        unpack(y[i], (uchar *)&buff[j]);
+        x[i] = y[i] = 0; /* clean up stack */
+    }
+}
+
+/* SU= 80 */
+/* Decrypt a single block */
+void core::AES_ecb_decrypt(core::aes *a, uchar *buff)
+{
+    int i, j, k;
+    unsign32 p[4], q[4], *x, *y, *t;
+
+    for (i = j = 0; i < NB; i++, j += 4)
+    {
+        p[i] = pack((uchar *)&buff[j]);
+        p[i] ^= a->rkey[i];
+    }
+
+    k = NB;
+    x = p;
+    y = q;
+
+    /* State alternates between x and y */
+    for (i = 1; i < a->Nr; i++)
+    {
+        /* Nr is number of rounds. May be odd. */
+
+        y[0] = a->rkey[k] ^ rtable[MR_TOBYTE(x[0])] ^
+               ROTL8(rtable[MR_TOBYTE(x[3] >> 8)])^
+               ROTL16(rtable[MR_TOBYTE(x[2] >> 16)])^
+               ROTL24(rtable[x[1] >> 24]);
+        y[1] = a->rkey[k + 1] ^ rtable[MR_TOBYTE(x[1])] ^
+               ROTL8(rtable[MR_TOBYTE(x[0] >> 8)])^
+               ROTL16(rtable[MR_TOBYTE(x[3] >> 16)])^
+               ROTL24(rtable[x[2] >> 24]);
+        y[2] = a->rkey[k + 2] ^ rtable[MR_TOBYTE(x[2])] ^
+               ROTL8(rtable[MR_TOBYTE(x[1] >> 8)])^
+               ROTL16(rtable[MR_TOBYTE(x[0] >> 16)])^
+               ROTL24(rtable[x[3] >> 24]);
+        y[3] = a->rkey[k + 3] ^ rtable[MR_TOBYTE(x[3])] ^
+               ROTL8(rtable[MR_TOBYTE(x[2] >> 8)])^
+               ROTL16(rtable[MR_TOBYTE(x[1] >> 16)])^
+               ROTL24(rtable[x[0] >> 24]);
+
+        k += 4;
+        t = x;
+        x = y;
+        y = t;    /* swap pointers */
+    }
+
+
+    /* Last Round */
+    y[0] = a->rkey[k] ^ (unsign32)rbsub[MR_TOBYTE(x[0])] ^
+           ROTL8((unsign32)rbsub[MR_TOBYTE(x[3] >> 8)])^
+           ROTL16((unsign32)rbsub[MR_TOBYTE(x[2] >> 16)])^
+           ROTL24((unsign32)rbsub[x[1] >> 24]);
+    y[1] = a->rkey[k + 1] ^ (unsign32)rbsub[MR_TOBYTE(x[1])] ^
+           ROTL8((unsign32)rbsub[MR_TOBYTE(x[0] >> 8)])^
+           ROTL16((unsign32)rbsub[MR_TOBYTE(x[3] >> 16)])^
+           ROTL24((unsign32)rbsub[x[2] >> 24]);
+    y[2] = a->rkey[k + 2] ^ (unsign32)rbsub[MR_TOBYTE(x[2])] ^
+           ROTL8((unsign32)rbsub[MR_TOBYTE(x[1] >> 8)])^
+           ROTL16((unsign32)rbsub[MR_TOBYTE(x[0] >> 16)])^
+           ROTL24((unsign32)rbsub[x[3] >> 24]);
+    y[3] = a->rkey[k + 3] ^ (unsign32)rbsub[MR_TOBYTE(x[3])] ^
+           ROTL8((unsign32)rbsub[MR_TOBYTE(x[2] >> 8)])^
+           ROTL16((unsign32)rbsub[MR_TOBYTE(x[1] >> 16)])^
+           ROTL24((unsign32)rbsub[x[0] >> 24]);
+
+    for (i = j = 0; i < NB; i++, j += 4)
+    {
+        unpack(y[i], (uchar *)&buff[j]);
+        x[i] = y[i] = 0; /* clean up stack */
+    }
+
+}
+
+/* simple default increment function */
+static void increment(char *f)
+{
+    int i;
+    for (i = 0; i < 16; i++)
+    {
+        f[i]++;
+        if (f[i] != 0) break;
+    }
+}
+
+/* SU= 40 */
+/* Encrypt using selected mode of operation */
+unsign32 core::AES_encrypt(core::aes* a, char *buff)
+{
+    int j, bytes;
+    char st[16];
+    unsign32 fell_off;
+
+    /* Supported Modes of Operation */
+
+    fell_off = 0;
+    switch (a->mode)
+    {
+    case ECB:
+        AES_ecb_encrypt(a, (uchar *)buff);
+        return 0;
+    case CBC:
+        for (j = 0; j < 4 * NB; j++) buff[j] ^= a->f[j];
+        AES_ecb_encrypt(a, (uchar *)buff);
+        for (j = 0; j < 4 * NB; j++) a->f[j] = buff[j];
+        return 0;
+
+    case CFB1:
+    case CFB2:
+    case CFB4:
+        bytes = a->mode - CFB1 + 1;
+        for (j = 0; j < bytes; j++) fell_off = (fell_off << 8) | a->f[j];
+        for (j = 0; j < 4 * NB; j++) st[j] = a->f[j];
+        for (j = bytes; j < 4 * NB; j++) a->f[j - bytes] = a->f[j];
+        AES_ecb_encrypt(a, (uchar *)st);
+        for (j = 0; j < bytes; j++)
+        {
+            buff[j] ^= st[j];
+            a->f[16 - bytes + j] = buff[j];
+        }
+        return fell_off;
+
+    case OFB1:
+    case OFB2:
+    case OFB4:
+    case OFB8:
+    case OFB16:
+
+        bytes = a->mode - OFB1 + 1;
+        AES_ecb_encrypt(a, (uchar *)(a->f));
+        for (j = 0; j < bytes; j++) buff[j] ^= a->f[j];
+        return 0;
+
+    case CTR1:
+    case CTR2:
+    case CTR4:
+    case CTR8:
+    case CTR16:
+
+        bytes = a->mode - CTR1 + 1;
+        for (j = 0; j < 4 * NB; j++) st[j] = a->f[j];
+        AES_ecb_encrypt(a, (uchar *)st);
+        for (j = 0; j < bytes; j++) buff[j] ^= st[j];
+        increment(a->f);
+        return 0;
+
+    default:
+        return 0;
+    }
+}
+
+/* SU= 40 */
+/* Decrypt using selected mode of operation */
+unsign32 core::AES_decrypt(core::aes *a, char *buff)
+{
+    int j, bytes;
+    char st[16];
+    unsign32 fell_off;
+
+    /* Supported modes of operation */
+    fell_off = 0;
+    switch (a->mode)
+    {
+    case ECB:
+        AES_ecb_decrypt(a, (uchar *)buff);
+        return 0;
+    case CBC:
+        for (j = 0; j < 4 * NB; j++)
+        {
+            st[j] = a->f[j];
+            a->f[j] = buff[j];
+        }
+        AES_ecb_decrypt(a, (uchar *)buff);
+        for (j = 0; j < 4 * NB; j++)
+        {
+            buff[j] ^= st[j];
+            st[j] = 0;
+        }
+        return 0;
+    case CFB1:
+    case CFB2:
+    case CFB4:
+        bytes = a->mode - CFB1 + 1;
+        for (j = 0; j < bytes; j++) fell_off = (fell_off << 8) | a->f[j];
+        for (j = 0; j < 4 * NB; j++) st[j] = a->f[j];
+        for (j = bytes; j < 4 * NB; j++) a->f[j - bytes] = a->f[j];
+        AES_ecb_encrypt(a, (uchar *)st);
+        for (j = 0; j < bytes; j++)
+        {
+            a->f[16 - bytes + j] = buff[j];
+            buff[j] ^= st[j];
+        }
+        return fell_off;
+    case OFB1:
+    case OFB2:
+    case OFB4:
+    case OFB8:
+    case OFB16:
+        bytes = a->mode - OFB1 + 1;
+        AES_ecb_encrypt(a, (uchar *)(a->f));
+        for (j = 0; j < bytes; j++) buff[j] ^= a->f[j];
+        return 0;
+
+    case CTR1:
+    case CTR2:
+    case CTR4:
+    case CTR8:
+    case CTR16:
+
+        bytes = a->mode - CTR1 + 1;
+        for (j = 0; j < 4 * NB; j++) st[j] = a->f[j];
+        AES_ecb_encrypt(a, (uchar *)st);
+        for (j = 0; j < bytes; j++) buff[j] ^= st[j];
+        increment(a->f);
+        return 0;
+
+    default:
+        return 0;
+    }
+}
+
+/* Clean up and delete left-overs */
+void core::AES_end(core::aes *a)
+{
+    /* clean up */
+    int i;
+    for (i = 0; i < NB * (a->Nr + 1); i++)
+        a->fkey[i] = a->rkey[i] = 0;
+    for (i = 0; i < 4 * NB; i++)
+        a->f[i] = 0;
+}
+
+/* AES encryption/decryption. Encrypt byte array M using key K and returns ciphertext */
+void core::AES_CBC_IV0_ENCRYPT(octet *k, octet *m, octet *c)
+{
+    /* AES CBC encryption, with Null IV and key k */
+    /* Input is from an octet string m, output is to an octet string c */
+    /* Input is padded as necessary to make up a full final block */
+    aes a;
+    int fin;
+    int i, j, ipt, opt;
+    char buff[16];
+    int padlen;
+
+    OCT_clear(c);
+    if (m->len == 0) return;
+    AES_init(&a, CBC, k->len, k->val, NULL);
+
+    ipt = opt = 0;
+    fin = 0;
+    for (;;)
+    {
+        for (i = 0; i < 16; i++)
+        {
+            if (ipt < m->len) buff[i] = m->val[ipt++];
+            else
+            {
+                fin = 1;
+                break;
+            }
+        }
+        if (fin) break;
+        AES_encrypt(&a, buff);
+        for (i = 0; i < 16; i++)
+            if (opt < c->max) c->val[opt++] = buff[i];
+    }
+
+    /* last block, filled up to i-th index */
+
+    padlen = 16 - i;
+    for (j = i; j < 16; j++) buff[j] = padlen;
+    AES_encrypt(&a, buff);
+    for (i = 0; i < 16; i++)
+        if (opt < c->max) c->val[opt++] = buff[i];
+    AES_end(&a);
+    c->len = opt;
+}
+
+/* decrypts and returns TRUE if all consistent, else returns FALSE */
+int core::AES_CBC_IV0_DECRYPT(octet *k, octet *c, octet *m)
+{
+    /* padding is removed */
+    aes a;
+    int i, ipt, opt, ch;
+    char buff[16];
+    int fin, bad;
+    int padlen;
+    ipt = opt = 0;
+
+    OCT_clear(m);
+    if (c->len == 0) return 1;
+    ch = c->val[ipt++];
+
+    AES_init(&a, CBC, k->len, k->val, NULL);
+    fin = 0;
+
+    for (;;)
+    {
+        for (i = 0; i < 16; i++)
+        {
+            buff[i] = ch;
+            if (ipt >= c->len)
+            {
+                fin = 1;
+                break;
+            }
+            else ch = c->val[ipt++];
+        }
+        AES_decrypt(&a, buff);
+        if (fin) break;
+        for (i = 0; i < 16; i++)
+            if (opt < m->max) m->val[opt++] = buff[i];
+    }
+    AES_end(&a);
+    bad = 0;
+    padlen = buff[15];
+    if (i != 15 || padlen < 1 || padlen > 16) bad = 1;
+    if (padlen >= 2 && padlen <= 16)
+        for (i = 16 - padlen; i < 16; i++) if (buff[i] != padlen) bad = 1;
+
+    if (!bad) for (i = 0; i < 16 - padlen; i++)
+            if (opt < m->max) m->val[opt++] = buff[i];
+
+    m->len = opt;
+    if (bad) return 0;
+    return 1;
+}
+
+/*
+#include <stdio.h>
+
+#define KK 32
+
+int main()
+{
+    int i;
+    aes a;
+    unsign32 t;
+    uchar x,y;
+
+    char key[KK];
+    char block[16];
+    char iv[16];
+    for (i=0;i<KK;i++) key[i]=5;
+    key[0]=1;
+    for (i=0;i<16;i++) iv[i]=i;
+    for (i=0;i<16;i++) block[i]=i;
+
+    AES_init(&a,CTR16,KK,key,iv);
+
+    printf("Plain=   ");
+    for (i=0;i<16;i++) printf("%02x",block[i]);
+    printf("\n");
+    AES_encrypt(&a,block);
+    printf("Encrypt= ");
+    for (i=0;i<16;i++) printf("%02x",(uchar)block[i]);
+    printf("\n");
+    AES_reset(&a,CTR16,iv);
+    AES_decrypt(&a,block);
+    printf("Decrypt= ");
+    for (i=0;i<16;i++) printf("%02x",(uchar)block[i]);
+    printf("\n");
+
+    AES_end(&a);
+
+    return 0;
+}
+
+*/
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/arch.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/arch.h
new file mode 100644
index 0000000..b37fea3
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/arch.h
@@ -0,0 +1,106 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* Architecture definition header file */
+
+/**
+ * @file arch.h
+ * @author Mike Scott
+ * @date 23rd February 2016
+ * @brief Architecture Header File
+ *
+ * Specify Processor Architecture
+ *
+ */
+
+/* NOTE: There is only one user configurable section in this header - see below */
+
+#ifndef ARCH_H
+#define ARCH_H
+#include <stdint.h>
+
+#define WOULD_USE_VLAS   /* Would like to use variable length arrays? */
+
+#ifdef WOULD_USE_VLAS
+#if __cplusplus >= 201402L
+#define USE_VLAS
+#endif
+#endif
+
+namespace core {
+
+/*** START OF USER CONFIGURABLE SECTION - set architecture ***/
+
+#define CHUNK 64      /**< size of chunk in bits = wordlength of computer = 16, 32 or 64. Note not all curve options are supported on 16-bit processors */
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+/* Create Integer types */
+
+//#define byte uint8_t            /**< 8-bit unsigned integer */
+//#define sign8 int8_t            /**< 8-bit signed integer */
+//#define sign16 int16_t          /**< 16-bit signed integer */
+//#define sign32 int32_t          /**< 32-bit signed integer */
+//#define sign64 int64_t          /**< 64-bit signed integer */
+//#define unsign32 uint32_t       /**< 32-bit unsigned integer */
+//#define unsign64 uint64_t       /**< 64-bit unsigned integer */
+
+using byte = uint8_t;			/**< 8-bit unsigned integer */
+using sign8 = int8_t;			/**< 8-bit signed integer */
+using sign16 = int16_t;			/**< 16-bit signed integer */
+using sign32 = int32_t;			/**< 32-bit signed integer */
+using sign64 = int64_t;			/**< 64-bit signed integer */
+using unsign32 = uint32_t;		/**< 32-bit unsigned integer */
+using unsign64 = uint64_t;		/**< 64-bit unsigned integer */
+
+//#define uchar unsigned char  /**<  Unsigned char */
+using uchar = unsigned char;
+
+/* Don't mess with anything below this line unless you know what you are doing */
+
+#if CHUNK==16
+
+#define chunk int16_t       /**< C type corresponding to word length */
+#define dchunk int32_t      /**< Always define double length chunk type if available */
+
+#endif
+
+#if CHUNK == 32
+
+#define chunk int32_t       /**< C type corresponding to word length */
+#define dchunk int64_t      /**< Always define double length chunk type if available */
+
+#endif
+
+#if CHUNK == 64
+
+#define chunk int64_t       /**< C type corresponding to word length */
+#if defined(__SIZEOF_INT128__) && __SIZEOF_INT128__ == 16
+#define dchunk __int128
+#endif
+
+#endif
+
+#ifdef dchunk
+#define COMBA      /**< Use COMBA method for faster muls, sqrs and reductions */
+#endif
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/benchtest_all b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/benchtest_all
new file mode 100644
index 0000000..02ed847
Binary files /dev/null and b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/benchtest_all differ
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/benchtest_all.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/benchtest_all.cpp
new file mode 100644
index 0000000..0a5b42a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/benchtest_all.cpp
@@ -0,0 +1,1462 @@
+
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* Test and benchmark elliptic curve and RSA functions
+    First build core.a from config*.py file
+    g++ -O3 benchtest_all.c core.a -o benchtest_all
+*/
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <time.h>
+
+#include "rsa_RSA2048.h"
+#include "ecp_Ed25519.h"
+#include "pair_BN254.h"
+
+#if CHUNK==32 || CHUNK==64
+#include "ecp_NIST256.h"
+#include "ecp_Ed448.h"
+#include "pair_BLS12383.h"
+#include "pair4_BLS24479.h"
+#include "pair8_BLS48556.h"
+#endif
+
+#define MIN_TIME 10.0
+#define MIN_ITERS 10
+
+using namespace core;
+
+int ed25519(csprng *RNG)
+{
+    using namespace Ed25519;
+    using namespace Ed25519_BIG;
+    using namespace Ed25519_FP;
+
+    int i, iterations;
+    clock_t start;
+    double elapsed;
+    ECP EP, EG;
+    BIG s, r, x, y;
+    FP rw;
+    printf("\nTesting/Timing Ed25519 ECC\n");
+
+#if CURVETYPE_Ed25519==WEIERSTRASS
+    printf("Weierstrass parameterization\n");
+#endif
+#if CURVETYPE_Ed25519==EDWARDS
+    printf("Edwards parameterization\n");
+#endif
+#if CURVETYPE_Ed25519==MONTGOMERY
+    printf("Montgomery parameterization\n");
+#endif
+
+
+#if MODTYPE_F25519 == PSEUDO_MERSENNE
+    printf("Pseudo-Mersenne Modulus\n");
+#endif
+
+#if MODTYPE_F25519 == GENERALISED_MERSENNE
+    printf("Generalised-Mersenne Modulus\n");
+#endif
+
+#if MODTYPE_F25519 == MONTGOMERY_FRIENDLY
+    printf("Montgomery Friendly Modulus\n");
+#endif
+
+#if MODTYPE_F25519 == NOT_SPECIAL
+    printf("Not special Modulus\n");
+#endif
+
+
+#if CHUNK==16
+    printf("16-bit Build\n");
+#endif
+#if CHUNK==32
+    printf("32-bit Build\n");
+#endif
+#if CHUNK==64
+    printf("64-bit Build\n");
+#endif
+
+    ECP_generator(&EG);
+    BIG_rcopy(r, CURVE_Order);
+
+    FP_rand(&rw,RNG);
+
+    ECP_map2point(&EP,&rw);
+    ECP_cfp(&EP);
+
+    if (ECP_isinf(&EP))
+    {
+        printf("HASHING FAILURE - P=O\n");
+        return 0;
+    }
+    
+    ECP_mul(&EP,r);
+    if (!ECP_isinf(&EP))
+    {
+        printf("EP= "); ECP_output(&EP); printf("\n");
+        printf("HASHING FAILURE - P=O\n");
+        return 0;
+    }
+
+    BIG_randtrunc(s, r, 2 * CURVE_SECURITY_Ed25519, RNG);
+
+    ECP_copy(&EP, &EG);
+    ECP_mul(&EP, r);
+
+    if (!ECP_isinf(&EP))
+    {
+        printf("FAILURE - rG!=O\n");
+        return 0;
+    }
+
+    iterations = 0;
+    start = clock();
+    do {
+        ECP_copy(&EP, &EG);
+        ECP_mul(&EP, s);
+
+        iterations++;
+        elapsed = (clock() - start) / (double)CLOCKS_PER_SEC;
+    } while (elapsed < MIN_TIME || iterations < MIN_ITERS);
+    elapsed = 1000.0 * elapsed / iterations;
+    printf("EC  mul - %8d iterations  ", iterations);
+    printf(" %8.2lf ms per iteration\n", elapsed);
+
+    return 0;
+}
+
+#if CHUNK==32 || CHUNK==64
+int nist256(csprng *RNG)
+{
+    using namespace NIST256;
+    using namespace NIST256_BIG;
+    using namespace NIST256_FP;
+
+    int i, iterations;
+    clock_t start;
+    double elapsed;
+    ECP EP, EG;
+    BIG s, r, x, y;
+    FP rw;
+    printf("\nTesting/Timing NIST256 ECC\n");
+
+#if CURVETYPE_NIST256==WEIERSTRASS
+    printf("Weierstrass parameterization\n");
+#endif
+#if CURVETYPE_NIST256==EDWARDS
+    printf("Edwards parameterization\n");
+#endif
+#if CURVETYPE_NIST256==MONTGOMERY
+    printf("Montgomery parameterization\n");
+#endif
+
+
+#if MODTYPE_NIST256 == PSEUDO_MERSENNE
+    printf("Pseudo-Mersenne Modulus\n");
+#endif
+
+#if MODTYPE_NIST256 == GENERALISED_MERSENNE
+    printf("Generalised-Mersenne Modulus\n");
+#endif
+
+#if MODTYPE_NIST256 == MONTGOMERY_FRIENDLY
+    printf("Montgomery Friendly Modulus\n");
+#endif
+
+#if MODTYPE_NIST256 == NOT_SPECIAL
+    printf("Not special Modulus\n");
+#endif
+
+#if CHUNK==16
+    printf("16-bit Build\n");
+#endif
+#if CHUNK==32
+    printf("32-bit Build\n");
+#endif
+#if CHUNK==64
+    printf("64-bit Build\n");
+#endif
+
+    ECP_generator(&EG);
+
+    BIG_rcopy(r, CURVE_Order);
+
+    FP_rand(&rw,RNG);
+    ECP_map2point(&EP,&rw);
+    ECP_cfp(&EP);
+
+    if (ECP_isinf(&EP))
+    {
+        printf("HASHING FAILURE - P=O\n");
+        return 0;
+    }
+    ECP_mul(&EP,r);
+    if (!ECP_isinf(&EP))
+    {
+        printf("HASHING FAILURE - P=O\n");
+        return 0;
+    }
+
+    BIG_randtrunc(s, r, 2 * CURVE_SECURITY_NIST256, RNG);
+
+    ECP_copy(&EP, &EG);
+    ECP_mul(&EP, r);
+
+    if (!ECP_isinf(&EP))
+    {
+        printf("FAILURE - rG!=O\n");
+        return 0;
+    }
+
+    iterations = 0;
+    start = clock();
+    do {
+        ECP_copy(&EP, &EG);
+        ECP_mul(&EP, s);
+
+        iterations++;
+        elapsed = (clock() - start) / (double)CLOCKS_PER_SEC;
+    } while (elapsed < MIN_TIME || iterations < MIN_ITERS);
+    elapsed = 1000.0 * elapsed / iterations;
+    printf("EC  mul - %8d iterations  ", iterations);
+    printf(" %8.2lf ms per iteration\n", elapsed);
+
+    return 0;
+}
+
+int ed448(csprng *RNG)
+{
+    using namespace Ed448;
+    using namespace Ed448_BIG;
+    using namespace Ed448_FP;
+
+    int i, iterations;
+    clock_t start;
+    double elapsed;
+    ECP EP, EG;
+    BIG s, r, x, y;
+    FP rw;
+    printf("\nTesting/Timing Ed448 ECC\n");
+
+#if CURVETYPE_Ed448==WEIERSTRASS
+    printf("Weierstrass parameterization\n");
+#endif
+#if CURVETYPE_Ed448==EDWARDS
+    printf("Edwards parameterization\n");
+#endif
+#if CURVETYPE_Ed448==MONTGOMERY
+    printf("Montgomery parameterization\n");
+#endif
+
+#if MODTYPE_F448 == PSEUDO_MERSENNE
+    printf("Pseudo-Mersenne Modulus\n");
+#endif
+
+#if MODTYPE_F448 == GENERALISED_MERSENNE
+    printf("Generalised-Mersenne Modulus\n");
+#endif
+
+#if MODTYPE_F448 == MONTGOMERY_FRIENDLY
+    printf("Montgomery Friendly Modulus\n");
+#endif
+
+#if MODTYPE_F448 == NOT_SPECIAL
+    printf("Not special Modulus\n");
+#endif
+
+#if CHUNK==16
+    printf("16-bit Build\n");
+#endif
+#if CHUNK==32
+    printf("32-bit Build\n");
+#endif
+#if CHUNK==64
+    printf("64-bit Build\n");
+#endif
+
+    ECP_generator(&EG);
+    BIG_rcopy(r, CURVE_Order);
+    FP_rand(&rw,RNG);
+    ECP_map2point(&EP,&rw);
+    ECP_cfp(&EP);
+
+    if (ECP_isinf(&EP))
+    {
+        printf("HASHING FAILURE - P=O\n");
+        return 0;
+    }
+    ECP_mul(&EP,r);
+    if (!ECP_isinf(&EP))
+    {
+        printf("HASHING FAILURE - P=O\n");
+        return 0;
+    }
+
+    BIG_randtrunc(s, r, 2 * CURVE_SECURITY_Ed448, RNG);
+
+    ECP_copy(&EP, &EG);
+    ECP_mul(&EP, r);
+
+    if (!ECP_isinf(&EP))
+    {
+        printf("FAILURE - rG!=O\n");
+        return 0;
+    }
+
+    iterations = 0;
+    start = clock();
+    do {
+        ECP_copy(&EP, &EG);
+        ECP_mul(&EP, s);
+
+        iterations++;
+        elapsed = (clock() - start) / (double)CLOCKS_PER_SEC;
+    } while (elapsed < MIN_TIME || iterations < MIN_ITERS);
+    elapsed = 1000.0 * elapsed / iterations;
+    printf("EC  mul - %8d iterations  ", iterations);
+    printf(" %8.2lf ms per iteration\n", elapsed);
+
+    return 0;
+}
+#endif
+
+int bn254(csprng *RNG)
+{
+    using namespace BN254;
+    using namespace BN254_FP;
+    using namespace BN254_BIG;
+
+    int i, iterations;
+    clock_t start;
+    double elapsed;
+
+    ECP P, G;
+    ECP2 Q, W;
+    FP12 g, w;
+    FP4 cm;
+    FP2 rz2;
+    FP rz;
+
+    BIG s, r, x, y;
+    printf("\nTesting/Timing BN254 Pairings\n");
+
+    ECP_generator(&G);
+    BIG_rcopy(r, CURVE_Order);
+    FP_rand(&rz,RNG);
+    ECP_map2point(&P,&rz);
+    ECP_cfp(&P);
+
+    if (ECP_isinf(&P))
+    {
+        printf("HASHING FAILURE - P=O\n");
+        return 0;
+    }
+    ECP_mul(&P,r);
+    if (!ECP_isinf(&P))
+    {
+        printf("HASHING FAILURE - P=O\n");
+        return 0;
+    }
+
+    BIG_randtrunc(s, r, 2 * CURVE_SECURITY_BN254, RNG);
+
+    ECP_copy(&P, &G);
+    PAIR_G1mul(&P, r);
+
+    if (!ECP_isinf(&P))
+    {
+        printf("FAILURE - rG!=O\n");
+        return 0;
+    }
+
+    iterations = 0;
+    start = clock();
+    do {
+        ECP_copy(&P, &G);
+        PAIR_G1mul(&P, s);
+
+        iterations++;
+        elapsed = (clock() - start) / (double)CLOCKS_PER_SEC;
+    } while (elapsed < MIN_TIME || iterations < MIN_ITERS);
+    elapsed = 1000.0 * elapsed / iterations;
+    printf("G1 mul              - %8d iterations  ", iterations);
+    printf(" %8.2lf ms per iteration\n", elapsed);
+
+    ECP2_generator(&W);
+
+    FP2_rand(&rz2,RNG);
+    ECP2_map2point(&Q,&rz2);
+    ECP2_cfp(&Q);
+
+    if (ECP2_isinf(&Q))
+    {
+        printf("HASHING FAILURE - P=O\n");
+        return 0;
+    }
+
+    //printf("Q= "); ECP2_output(&Q); printf("\n");
+    ECP2_mul(&Q,r);
+    if (!ECP2_isinf(&Q))
+    {
+        printf("FAILURE - rQ!=O\n");
+        return 0;
+    }
+
+    ECP2_copy(&Q, &W);
+    ECP2_mul(&Q, r);
+
+    if (!ECP2_isinf(&Q))
+    {
+        printf("FAILURE - rQ!=O\n");
+        return 0;
+    }
+
+    iterations = 0;
+    start = clock();
+    do {
+        ECP2_copy(&Q, &W);
+        PAIR_G2mul(&Q, s);
+
+        iterations++;
+        elapsed = (clock() - start) / (double)CLOCKS_PER_SEC;
+    } while (elapsed < MIN_TIME || iterations < MIN_ITERS);
+    elapsed = 1000.0 * elapsed / iterations;
+    printf("G2 mul              - %8d iterations  ", iterations);
+    printf(" %8.2lf ms per iteration\n", elapsed);
+
+    PAIR_ate(&w, &Q, &P);
+    PAIR_fexp(&w);
+
+//printf("pairing= ");FP12_output(&w); printf("\n");
+
+    FP12_copy(&g, &w);
+
+    PAIR_GTpow(&g, r);
+
+    if (!FP12_isunity(&g))
+    {
+        printf("FAILURE - g^r!=1\n");
+        return 0;
+    }
+
+    iterations = 0;
+    start = clock();
+    do {
+        FP12_copy(&g, &w);
+        PAIR_GTpow(&g, s);
+
+        iterations++;
+        elapsed = (clock() - start) / (double)CLOCKS_PER_SEC;
+    } while (elapsed < MIN_TIME || iterations < MIN_ITERS);
+    elapsed = 1000.0 * elapsed / iterations;
+    printf("GT pow              - %8d iterations  ", iterations);
+    printf(" %8.2lf ms per iteration\n", elapsed);
+
+    FP12_copy(&g, &w);
+
+    iterations = 0;
+    start = clock();
+    do {
+        FP12_compow(&cm, &g, s, r);
+        iterations++;
+        elapsed = (clock() - start) / (double)CLOCKS_PER_SEC;
+    } while (elapsed < MIN_TIME || iterations < MIN_ITERS);
+    elapsed = 1000.0 * elapsed / iterations;
+    printf("GT pow (compressed) - %8d iterations  ", iterations);
+    printf(" %8.2lf ms per iteration\n", elapsed);
+
+    iterations = 0;
+    start = clock();
+    do {
+        PAIR_ate(&w, &Q, &P);
+        iterations++;
+        elapsed = (clock() - start) / (double)CLOCKS_PER_SEC;
+    } while (elapsed < MIN_TIME || iterations < MIN_ITERS);
+    elapsed = 1000.0 * elapsed / iterations;
+    printf("PAIRing ATE         - %8d iterations  ", iterations);
+    printf(" %8.2lf ms per iteration\n", elapsed);
+
+    iterations = 0;
+    start = clock();
+    do {
+        FP12_copy(&g, &w);
+        PAIR_fexp(&g);
+        iterations++;
+        elapsed = (clock() - start) / (double)CLOCKS_PER_SEC;
+    } while (elapsed < MIN_TIME || iterations < MIN_ITERS);
+    elapsed = 1000.0 * elapsed / iterations;
+    printf("PAIRing FEXP        - %8d iterations  ", iterations);
+    printf(" %8.2lf ms per iteration\n", elapsed);
+
+    ECP_copy(&P, &G);
+    ECP2_copy(&Q, &W);
+
+    PAIR_G1mul(&P, s);
+    PAIR_ate(&g, &Q, &P);
+    PAIR_fexp(&g);
+
+    ECP_copy(&P, &G);
+
+    PAIR_G2mul(&Q, s);
+    PAIR_ate(&w, &Q, &P);
+    PAIR_fexp(&w);
+
+	if (!PAIR_G1member(&P))
+	{
+        printf("FAILURE - P not in G1\n");
+        return 0;
+	}
+
+	if (!PAIR_G2member(&Q))
+	{
+        printf("FAILURE - Q not in G2\n");
+        return 0;
+	}
+
+	if (!PAIR_GTmember(&w))
+	{
+        printf("FAILURE - e(Q,P) not in GT\n");
+        return 0;
+	}
+
+    if (!FP12_equals(&g, &w))
+    {
+        printf("FAILURE - e(sQ,p)!=e(Q,sP) \n");
+        return 0;
+    }
+
+    ECP2_copy(&Q, &W);
+    PAIR_ate(&g, &Q, &P);
+    PAIR_fexp(&g);
+
+    PAIR_GTpow(&g, s);
+
+    if (!FP12_equals(&g, &w))
+    {
+        printf("FAILURE - e(sQ,p)!=e(Q,P)^s \n");
+        return 0;
+    }
+
+    ECP N1;
+    ECP2 N2;
+
+    ECP_inf(&N1);
+    ECP2_inf(&N2);
+
+    PAIR_ate(&g, &N2, &P);
+    PAIR_fexp(&g);
+
+    if (!FP12_isunity(&g))
+    {
+        printf("FAILURE - e(O,P) !=1 \n");
+        return 0;
+    }
+
+    PAIR_ate(&g, &Q, &N1);
+    PAIR_fexp(&g);
+
+    if (!FP12_isunity(&g))
+    {
+        printf("FAILURE - e(Q,O) !=1 \n");
+        return 0;
+    }
+ 
+	
+
+    return 0;
+}
+
+#if CHUNK==32 || CHUNK==64
+int bls383(csprng *RNG)
+{
+    using namespace BLS12383;
+    using namespace BLS12383_FP;
+    using namespace BLS12383_BIG;
+
+    int i, iterations;
+    clock_t start;
+    double elapsed;
+
+    ECP P, G;
+    ECP2 Q, W;
+    FP12 g, w;
+    FP4 cm;
+    FP2 rz2;
+    FP rz;
+
+    BIG s, r, x, y;
+    printf("\nTesting/Timing BLS12383 Pairings\n");
+
+    ECP_generator(&G);
+
+    BIG_rcopy(r, CURVE_Order);
+    FP_rand(&rz,RNG);
+
+/*
+    iterations = 0;
+    start = clock();
+    do {
+        BIG_randomnum(s,r,RNG);
+        iterations++;
+        elapsed = (clock() - start) / (double)CLOCKS_PER_SEC;
+    } while (elapsed < MIN_TIME || iterations < MIN_ITERS);
+    elapsed = 1000.0 * elapsed / iterations;
+    printf("BIG_randomnum  - %8d iterations  ", iterations);
+    printf(" %8.2lf ms per iteration\n", elapsed);
+    printf("nbits(r)= %d\n",BIG_nbits(r));
+*/
+//    iterations = 0;
+//    start = clock();
+//    do {
+        ECP_map2point(&P,&rz);
+        ECP_cfp(&P);
+//        iterations++;
+//        elapsed = (clock() - start) / (double)CLOCKS_PER_SEC;
+//    } while (elapsed < MIN_TIME || iterations < MIN_ITERS);
+//    elapsed = 1000.0 * elapsed / iterations;
+//    printf("G1 hash to point  - %8d iterations  ", iterations);
+//    printf(" %8.2lf ms per iteration\n", elapsed);
+
+
+    if (ECP_isinf(&P))
+    {
+        printf("HASHING FAILURE - P=O\n");
+        return 0;
+    }
+    ECP_mul(&P,r);
+    if (!ECP_isinf(&P))
+    {
+        printf("HASHING FAILURE - P=O\n");
+        return 0;
+    }
+
+    BIG_randtrunc(s, r, 2 * CURVE_SECURITY_BLS12383, RNG);
+
+
+    ECP_copy(&P, &G);
+    PAIR_G1mul(&P, r);
+
+    if (!ECP_isinf(&P))
+    {
+        printf("FAILURE - rG!=O\n");
+        return 0;
+    }
+
+    iterations = 0;
+    start = clock();
+    do {
+        ECP_copy(&P, &G);
+        PAIR_G1mul(&P, s);
+
+        iterations++;
+        elapsed = (clock() - start) / (double)CLOCKS_PER_SEC;
+    } while (elapsed < MIN_TIME || iterations < MIN_ITERS);
+    elapsed = 1000.0 * elapsed / iterations;
+    printf("G1 mul              - %8d iterations  ", iterations);
+    printf(" %8.2lf ms per iteration\n", elapsed);
+
+    ECP2_generator(&W);
+
+    FP2_rand(&rz2,RNG);
+    ECP2_map2point(&Q,&rz2);
+    ECP2_cfp(&Q);
+
+    if (ECP2_isinf(&Q))
+    {
+        printf("HASHING FAILURE - P=O\n");
+        return 0;
+    }
+
+    ECP2_mul(&Q,r);
+    if (!ECP2_isinf(&Q))
+    {
+        printf("FAILURE - rQ!=O\n");
+        return 0;
+    }
+
+
+    ECP2_copy(&Q, &W);
+    ECP2_mul(&Q, r);
+
+    if (!ECP2_isinf(&Q))
+    {
+        printf("FAILURE - rQ!=O\n");
+        return 0;
+    }
+
+    iterations = 0;
+    start = clock();
+    do {
+        ECP2_copy(&Q, &W);
+        PAIR_G2mul(&Q, s);
+
+        iterations++;
+        elapsed = (clock() - start) / (double)CLOCKS_PER_SEC;
+    } while (elapsed < MIN_TIME || iterations < MIN_ITERS);
+    elapsed = 1000.0 * elapsed / iterations;
+    printf("G2 mul              - %8d iterations  ", iterations);
+    printf(" %8.2lf ms per iteration\n", elapsed);
+
+    PAIR_ate(&w, &Q, &P);
+    PAIR_fexp(&w);
+
+    FP12_copy(&g, &w);
+
+    PAIR_GTpow(&g, r);
+
+    if (!FP12_isunity(&g))
+    {
+        printf("FAILURE - g^r!=1\n");
+        return 0;
+    }
+
+    iterations = 0;
+    start = clock();
+    do {
+        FP12_copy(&g, &w);
+        PAIR_GTpow(&g, s);
+
+        iterations++;
+        elapsed = (clock() - start) / (double)CLOCKS_PER_SEC;
+    } while (elapsed < MIN_TIME || iterations < MIN_ITERS);
+    elapsed = 1000.0 * elapsed / iterations;
+    printf("GT pow              - %8d iterations  ", iterations);
+    printf(" %8.2lf ms per iteration\n", elapsed);
+
+    FP12_copy(&g, &w);
+
+    iterations = 0;
+    start = clock();
+    do {
+        FP12_compow(&cm, &g, s, r);
+        iterations++;
+        elapsed = (clock() - start) / (double)CLOCKS_PER_SEC;
+    } while (elapsed < MIN_TIME || iterations < MIN_ITERS);
+    elapsed = 1000.0 * elapsed / iterations;
+    printf("GT pow (compressed) - %8d iterations  ", iterations);
+    printf(" %8.2lf ms per iteration\n", elapsed);
+
+    iterations = 0;
+    start = clock();
+    do {
+        PAIR_ate(&w, &Q, &P);
+        iterations++;
+        elapsed = (clock() - start) / (double)CLOCKS_PER_SEC;
+    } while (elapsed < MIN_TIME || iterations < MIN_ITERS);
+    elapsed = 1000.0 * elapsed / iterations;
+    printf("PAIRing ATE         - %8d iterations  ", iterations);
+    printf(" %8.2lf ms per iteration\n", elapsed);
+
+    iterations = 0;
+    start = clock();
+    do {
+        FP12_copy(&g, &w);
+        PAIR_fexp(&g);
+        iterations++;
+        elapsed = (clock() - start) / (double)CLOCKS_PER_SEC;
+    } while (elapsed < MIN_TIME || iterations < MIN_ITERS);
+    elapsed = 1000.0 * elapsed / iterations;
+    printf("PAIRing FEXP        - %8d iterations  ", iterations);
+    printf(" %8.2lf ms per iteration\n", elapsed);
+
+    ECP_copy(&P, &G);
+    ECP2_copy(&Q, &W);
+
+    PAIR_G1mul(&P, s);
+    PAIR_ate(&g, &Q, &P);
+    PAIR_fexp(&g);
+
+    ECP_copy(&P, &G);
+
+    PAIR_G2mul(&Q, s);
+    PAIR_ate(&w, &Q, &P);
+    PAIR_fexp(&w);
+
+	if (!PAIR_G1member(&P))
+	{
+        printf("FAILURE - P not in G1\n");
+        return 0;
+	}
+
+	if (!PAIR_G2member(&Q))
+	{
+        printf("FAILURE - Q not in G2\n");
+        return 0;
+	}
+
+	if (!PAIR_GTmember(&w))
+	{
+        printf("FAILURE - e(Q,P) not in GT\n");
+        return 0;
+	}
+
+    if (!FP12_equals(&g, &w))
+    {
+        printf("FAILURE - e(sQ,p)!=e(Q,sP) \n");
+        return 0;
+    }
+
+    ECP2_copy(&Q, &W);
+    PAIR_ate(&g, &Q, &P);
+    PAIR_fexp(&g);
+
+    PAIR_GTpow(&g, s);
+
+    if (!FP12_equals(&g, &w))
+    {
+        printf("FAILURE - e(sQ,p)!=e(Q,P)^s \n");
+        return 0;
+    }
+
+    ECP N1;
+    ECP2 N2;
+
+    ECP_inf(&N1);
+    ECP2_inf(&N2);
+
+    PAIR_ate(&g, &N2, &P);
+    PAIR_fexp(&g);
+
+    if (!FP12_isunity(&g))
+    {
+        printf("FAILURE - e(O,P) !=1 \n");
+        return 0;
+    }
+
+    PAIR_ate(&g, &Q, &N1);
+    PAIR_fexp(&g);
+
+    if (!FP12_isunity(&g))
+    {
+        printf("FAILURE - e(Q,O) !=1 \n");
+        return 0;
+    }
+
+    return 0;
+}
+
+int bls24(csprng *RNG)
+{
+    using namespace BLS24479;
+    using namespace BLS24479_FP;
+    using namespace BLS24479_BIG;
+
+    int i, iterations;
+    clock_t start;
+    double elapsed;
+
+    ECP P, G;
+    ECP4 Q, W;
+    FP24 g, w;
+    FP rz;
+    FP4 rz4;
+
+    FP8 cm;
+    BIG a, b, s, r;
+
+    printf("\nTesting/Timing BLS24479 Pairings\n");
+
+    ECP_generator(&G);
+    BIG_rcopy(r, CURVE_Order);
+    FP_rand(&rz,RNG);
+    ECP_map2point(&P,&rz);
+    ECP_cfp(&P);
+
+    if (ECP_isinf(&P))
+    {
+        printf("HASHING FAILURE - P=O\n");
+        return 0;
+    }
+    ECP_mul(&P,r);
+    if (!ECP_isinf(&P))
+    {
+        printf("HASHING FAILURE - P=O\n");
+        return 0;
+    }
+
+    BIG_randtrunc(s, r, 2 * CURVE_SECURITY_BLS24479, RNG);
+
+    ECP_copy(&P, &G);
+    PAIR_G1mul(&P, r);
+
+    if (!ECP_isinf(&P))
+    {
+        printf("FAILURE - rG!=O\n");
+        return 0;
+    }
+
+    iterations = 0;
+    start = clock();
+    do {
+        ECP_copy(&P, &G);
+        PAIR_G1mul(&P, s);
+
+        iterations++;
+        elapsed = (clock() - start) / (double)CLOCKS_PER_SEC;
+    } while (elapsed < MIN_TIME || iterations < MIN_ITERS);
+    elapsed = 1000.0 * elapsed / iterations;
+    printf("G1 mul              - %8d iterations  ", iterations);
+    printf(" %8.2lf ms per iteration\n", elapsed);
+
+    ECP4_generator(&W);
+
+    FP4_rand(&rz4,RNG);
+    ECP4_map2point(&Q,&rz4);
+    ECP4_cfp(&Q);
+
+    if (ECP4_isinf(&Q))
+    {
+        printf("HASHING FAILURE - P=O\n");
+        return 0;
+    }
+
+    ECP4_mul(&Q,r);
+    if (!ECP4_isinf(&Q))
+    {
+        printf("FAILURE - rQ!=O\n");
+        return 0;
+    }
+    ECP4_copy(&Q, &W);
+    ECP4_mul(&Q, r);
+
+    if (!ECP4_isinf(&Q))
+    {
+        printf("FAILURE - rQ!=O\n");
+        return 0;
+    }
+
+    iterations = 0;
+    start = clock();
+    do {
+        ECP4_copy(&Q, &W);
+        PAIR_G2mul(&Q, s);
+
+        iterations++;
+        elapsed = (clock() - start) / (double)CLOCKS_PER_SEC;
+    } while (elapsed < MIN_TIME || iterations < MIN_ITERS);
+    elapsed = 1000.0 * elapsed / iterations;
+    printf("G2 mul              - %8d iterations  ", iterations);
+    printf(" %8.2lf ms per iteration\n", elapsed);
+
+    PAIR_ate(&w, &Q, &P);
+    PAIR_fexp(&w);
+
+    FP24_copy(&g, &w);
+
+    PAIR_GTpow(&g, r);
+
+    if (!FP24_isunity(&g))
+    {
+        printf("FAILURE - g^r!=1\n");
+        return 0;
+    }
+
+    iterations = 0;
+    start = clock();
+    do {
+        FP24_copy(&g, &w);
+        PAIR_GTpow(&g, s);
+
+        iterations++;
+        elapsed = (clock() - start) / (double)CLOCKS_PER_SEC;
+    } while (elapsed < MIN_TIME || iterations < MIN_ITERS);
+    elapsed = 1000.0 * elapsed / iterations;
+    printf("GT pow              - %8d iterations  ", iterations);
+    printf(" %8.2lf ms per iteration\n", elapsed);
+/*
+    FP24_copy(&g, &w);
+
+    iterations = 0;
+    start = clock();
+    do {
+        FP24_compow(&cm, &g, s, r);
+        iterations++;
+        elapsed = (clock() - start) / (double)CLOCKS_PER_SEC;
+    } while (elapsed < MIN_TIME || iterations < MIN_ITERS);
+    elapsed = 1000.0 * elapsed / iterations;
+    printf("GT pow (compressed) - %8d iterations  ", iterations);
+    printf(" %8.2lf ms per iteration\n", elapsed);
+*/
+    iterations = 0;
+    start = clock();
+    do {
+        PAIR_ate(&w, &Q, &P);
+        iterations++;
+        elapsed = (clock() - start) / (double)CLOCKS_PER_SEC;
+    } while (elapsed < MIN_TIME || iterations < MIN_ITERS);
+    elapsed = 1000.0 * elapsed / iterations;
+    printf("PAIRing ATE         - %8d iterations  ", iterations);
+    printf(" %8.2lf ms per iteration\n", elapsed);
+
+    iterations = 0;
+    start = clock();
+    do {
+        FP24_copy(&g, &w);
+        PAIR_fexp(&g);
+        iterations++;
+        elapsed = (clock() - start) / (double)CLOCKS_PER_SEC;
+    } while (elapsed < MIN_TIME || iterations < MIN_ITERS);
+    elapsed = 1000.0 * elapsed / iterations;
+    printf("PAIRing FEXP        - %8d iterations  ", iterations);
+    printf(" %8.2lf ms per iteration\n", elapsed);
+
+    ECP_copy(&P, &G);
+    ECP4_copy(&Q, &W);
+
+    PAIR_G1mul(&P, s);
+    PAIR_ate(&g, &Q, &P);
+    PAIR_fexp(&g);
+
+    ECP_copy(&P, &G);
+
+    PAIR_G2mul(&Q, s);
+    PAIR_ate(&w, &Q, &P);
+    PAIR_fexp(&w);
+
+	if (!PAIR_G1member(&P))
+	{
+        printf("FAILURE - P not in G1\n");
+        return 0;
+	}
+
+	if (!PAIR_G2member(&Q))
+	{
+        printf("FAILURE - Q not in G2\n");
+        return 0;
+	}
+
+	if (!PAIR_GTmember(&w))
+	{
+        printf("FAILURE - e(Q,P) not in GT\n");
+        return 0;
+	}
+
+    if (!FP24_equals(&g, &w))
+    {
+        printf("FAILURE - e(sQ,p)!=e(Q,sP) \n");
+        return 0;
+    }
+
+    ECP4_copy(&Q, &W);
+    PAIR_ate(&g, &Q, &P);
+    PAIR_fexp(&g);
+
+    PAIR_GTpow(&g, s);
+
+    if (!FP24_equals(&g, &w))
+    {
+        printf("FAILURE - e(sQ,p)!=e(Q,P)^s \n");
+        return 0;
+    }
+
+    ECP N1;
+    ECP4 N2;
+
+    ECP_inf(&N1);
+    ECP4_inf(&N2);
+
+    PAIR_ate(&g, &N2, &P);
+    PAIR_fexp(&g);
+
+    if (!FP24_isunity(&g))
+    {
+        printf("FAILURE - e(O,P) !=1 \n");
+        return 0;
+    }
+
+    PAIR_ate(&g, &Q, &N1);
+    PAIR_fexp(&g);
+
+    if (!FP24_isunity(&g))
+    {
+        printf("FAILURE - e(Q,O) !=1 \n");
+        return 0;
+    }
+    /*
+        PAIR_ate(&g,&N2,&N1);
+        PAIR_fexp(&g);
+
+        if (!FP24_isunity(&g))
+        {
+            printf("FAILURE - e(O,O) !=1 \n");
+            return 0;
+        }
+    */
+    return 0;
+}
+
+int bls48(csprng *RNG)
+{
+    using namespace BLS48556;
+    using namespace BLS48556_FP;
+    using namespace BLS48556_BIG;
+
+    int i, iterations;
+    clock_t start;
+    double elapsed;
+
+    ECP P, G;
+    ECP8 Q, W;
+    FP48 g, w;
+    FP rz;
+    FP8 rz8;
+
+    FP16 cm;
+    BIG a, b, s, r;
+
+    printf("\nTesting/Timing BLS48556 Pairings\n");
+
+    ECP_generator(&G);
+    BIG_rcopy(r, CURVE_Order);
+    FP_rand(&rz,RNG);
+    ECP_map2point(&P,&rz);
+    ECP_cfp(&P);
+
+    if (ECP_isinf(&P))
+    {
+        printf("HASHING FAILURE - P=O\n");
+        return 0;
+    }
+    ECP_mul(&P,r);
+    if (!ECP_isinf(&P))
+    {
+        printf("HASHING FAILURE - P=O\n");
+        return 0;
+    }
+
+    BIG_randtrunc(s, r, 2 * CURVE_SECURITY_BLS48556, RNG);
+
+    ECP_copy(&P, &G);
+    PAIR_G1mul(&P, r);
+
+    if (!ECP_isinf(&P))
+    {
+        printf("FAILURE - rG!=O\n");
+        return 0;
+    }
+
+    iterations = 0;
+    start = clock();
+    do {
+        ECP_copy(&P, &G);
+        PAIR_G1mul(&P, s);
+
+        iterations++;
+        elapsed = (clock() - start) / (double)CLOCKS_PER_SEC;
+    } while (elapsed < MIN_TIME || iterations < MIN_ITERS);
+    elapsed = 1000.0 * elapsed / iterations;
+    printf("G1 mul              - %8d iterations  ", iterations);
+    printf(" %8.2lf ms per iteration\n", elapsed);
+
+
+    ECP8_generator(&W);
+
+    FP8_rand(&rz8,RNG);
+    ECP8_map2point(&Q,&rz8);
+    ECP8_cfp(&Q);
+
+    if (ECP8_isinf(&Q))
+    {
+        printf("HASHING FAILURE - P=O\n");
+        return 0;
+    }
+
+    ECP8_mul(&Q,r);
+    if (!ECP8_isinf(&Q))
+    {
+        printf("FAILURE - rQ!=O\n");
+        return 0;
+    }
+    ECP8_copy(&Q, &W);
+
+    //ECP8_mul(&Q,r);
+    PAIR_G2mul(&Q, r);
+
+    if (!ECP8_isinf(&Q))
+    {
+        printf("FAILURE - rQ!=O\n");
+        return 0;
+    }
+
+    iterations = 0;
+    start = clock();
+    do {
+        ECP8_copy(&Q, &W);
+        PAIR_G2mul(&Q, s);
+
+        iterations++;
+        elapsed = (clock() - start) / (double)CLOCKS_PER_SEC;
+    } while (elapsed < MIN_TIME || iterations < MIN_ITERS);
+    elapsed = 1000.0 * elapsed / iterations;
+    printf("G2 mul              - %8d iterations  ", iterations);
+    printf(" %8.2lf ms per iteration\n", elapsed);
+
+
+    PAIR_ate(&w, &Q, &P);
+    PAIR_fexp(&w);
+
+    FP48_copy(&g, &w);
+
+    PAIR_GTpow(&g, r);
+
+    if (!FP48_isunity(&g))
+    {
+        printf("FAILURE - g^r!=1\n");
+        return 0;
+    }
+
+    iterations = 0;
+    start = clock();
+    do {
+        FP48_copy(&g, &w);
+        PAIR_GTpow(&g, s);
+
+        iterations++;
+        elapsed = (clock() - start) / (double)CLOCKS_PER_SEC;
+    } while (elapsed < MIN_TIME || iterations < MIN_ITERS);
+    elapsed = 1000.0 * elapsed / iterations;
+    printf("GT pow              - %8d iterations  ", iterations);
+    printf(" %8.2lf ms per iteration\n", elapsed);
+/*
+    FP48_copy(&g, &w);
+
+    iterations = 0;
+    start = clock();
+    do {
+        FP48_compow(&cm, &g, s, r);
+        iterations++;
+        elapsed = (clock() - start) / (double)CLOCKS_PER_SEC;
+    } while (elapsed < MIN_TIME || iterations < MIN_ITERS);
+    elapsed = 1000.0 * elapsed / iterations;
+    printf("GT pow (compressed) - %8d iterations  ", iterations);
+    printf(" %8.2lf ms per iteration\n", elapsed);
+*/
+    iterations = 0;
+    start = clock();
+    do {
+        PAIR_ate(&w, &Q, &P);
+        iterations++;
+        elapsed = (clock() - start) / (double)CLOCKS_PER_SEC;
+    } while (elapsed < MIN_TIME || iterations < MIN_ITERS);
+    elapsed = 1000.0 * elapsed / iterations;
+    printf("PAIRing ATE         - %8d iterations  ", iterations);
+    printf(" %8.2lf ms per iteration\n", elapsed);
+
+    iterations = 0;
+    start = clock();
+    do {
+        FP48_copy(&g, &w);
+        PAIR_fexp(&g);
+        iterations++;
+        elapsed = (clock() - start) / (double)CLOCKS_PER_SEC;
+    } while (elapsed < MIN_TIME || iterations < MIN_ITERS);
+    elapsed = 1000.0 * elapsed / iterations;
+    printf("PAIRing FEXP        - %8d iterations  ", iterations);
+    printf(" %8.2lf ms per iteration\n", elapsed);
+
+    ECP_copy(&P, &G);
+    ECP8_copy(&Q, &W);
+
+    PAIR_G1mul(&P, s);
+    PAIR_ate(&g, &Q, &P);
+    PAIR_fexp(&g);
+
+    ECP_copy(&P, &G);
+
+    PAIR_G2mul(&Q, s);
+    //ECP8_mul(&Q,s);
+    PAIR_ate(&w, &Q, &P);
+    PAIR_fexp(&w);
+
+	if (!PAIR_G1member(&P))
+	{
+        printf("FAILURE - P not in G1\n");
+        return 0;
+	}
+
+	if (!PAIR_G2member(&Q))
+	{
+        printf("FAILURE - Q not in G2\n");
+        return 0;
+	}
+
+	if (!PAIR_GTmember(&w))
+	{
+        printf("FAILURE - e(Q,P) not in GT\n");
+        return 0;
+	}
+
+    if (!FP48_equals(&g, &w))
+    {
+        printf("FAILURE - e(sQ,p)!=e(Q,sP) \n");
+        return 0;
+    }
+
+    ECP8_copy(&Q, &W);
+    PAIR_ate(&g, &Q, &P);
+    PAIR_fexp(&g);
+
+    PAIR_GTpow(&g, s);
+
+    if (!FP48_equals(&g, &w))
+    {
+        printf("FAILURE - e(sQ,p)!=e(Q,P)^s \n");
+        return 0;
+    }
+
+    ECP N1;
+    ECP8 N2;
+
+    ECP_inf(&N1);
+    ECP8_inf(&N2);
+
+    PAIR_ate(&g, &N2, &P);
+    PAIR_fexp(&g);
+
+    if (!FP48_isunity(&g))
+    {
+        printf("FAILURE - e(O,P) !=1 \n");
+        return 0;
+    }
+
+    PAIR_ate(&g, &Q, &N1);
+    PAIR_fexp(&g);
+
+    if (!FP48_isunity(&g))
+    {
+        printf("FAILURE - e(Q,O) !=1 \n");
+        return 0;
+    }
+    /*
+        PAIR_ate(&g,&N2,&N1);
+        PAIR_fexp(&g);
+
+        if (!FP48_isunity(&g))
+        {
+            printf("FAILURE - e(O,O) !=1 \n");
+            return 0;
+        }
+    */
+    return 0;
+}
+#endif
+
+int rsa2048(csprng *RNG)
+{
+    using namespace RSA2048;
+
+    rsa_public_key pub;
+    rsa_private_key priv;
+
+    int i, iterations;
+    clock_t start;
+    double elapsed;
+
+    char m[RFS_RSA2048], d[RFS_RSA2048], c[RFS_RSA2048];
+    octet M = {0, sizeof(m), m};
+    octet D = {0, sizeof(d), d};
+    octet C = {0, sizeof(c), c};
+
+    printf("\nTesting/Timing 2048-bit RSA\n");
+
+    printf("Generating 2048-bit RSA public/private key pair\n");
+
+    iterations = 0;
+    start = clock();
+    do {
+        RSA_KEY_PAIR(RNG, 65537, &priv, &pub, NULL, NULL);
+        iterations++;
+        elapsed = (clock() - start) / (double)CLOCKS_PER_SEC;
+    } while (elapsed < MIN_TIME || iterations < 1);
+    elapsed = 1000.0 * elapsed / iterations;
+    printf("RSA gen - %8d iterations  ", iterations);
+    printf(" %8.2lf ms per iteration\n", elapsed);
+
+    M.len = RFS_RSA2048;
+    for (i = 0; i < RFS_RSA2048; i++) M.val[i] = i % 128;
+
+    iterations = 0;
+    start = clock();
+    do {
+        RSA_ENCRYPT(&pub, &M, &C);
+        iterations++;
+        elapsed = (clock() - start) / (double)CLOCKS_PER_SEC;
+    } while (elapsed < MIN_TIME || iterations < MIN_ITERS);
+    elapsed = 1000.0 * elapsed / iterations;
+    printf("RSA enc - %8d iterations  ", iterations);
+    printf(" %8.2lf ms per iteration\n", elapsed);
+
+    iterations = 0;
+    start = clock();
+    do {
+        RSA_DECRYPT(&priv, &C, &D);
+        iterations++;
+        elapsed = (clock() - start) / (double)CLOCKS_PER_SEC;
+    } while (elapsed < MIN_TIME || iterations < MIN_ITERS);
+    elapsed = 1000.0 * elapsed / iterations;
+    printf("RSA dec - %8d iterations  ", iterations);
+    printf(" %8.2lf ms per iteration\n", elapsed);
+
+    for (i = 0; i < RFS_RSA2048; i++)
+    {
+        if (M.val[i] != D.val[i])
+        {
+            printf("FAILURE - RSA decryption\n");
+            return 0;
+        }
+    }
+
+    printf("All tests pass\n");
+
+    return 0;
+}
+
+int main()
+{
+    csprng RNG;
+    int i;
+    char pr[10];
+    unsigned long ran;
+
+    time((time_t *)&ran);
+    pr[0] = ran;
+    pr[1] = ran >> 8;
+    pr[2] = ran >> 16;
+    pr[3] = ran >> 24;
+    for (i = 4; i < 10; i++) pr[i] = i; /*****4****/
+    RAND_seed(&RNG, 10, pr);
+
+    ed25519(&RNG);
+#if CHUNK==32 || CHUNK==64
+    nist256(&RNG);
+    ed448(&RNG);
+#endif
+    bn254(&RNG);
+#if CHUNK==32 || CHUNK==64
+    bls383(&RNG);
+    bls24(&RNG);
+    bls48(&RNG);
+#endif
+    rsa2048(&RNG);
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/big.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/big.cpp
new file mode 100644
index 0000000..3009e4d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/big.cpp
@@ -0,0 +1,1830 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* CORE basic functions for BIG type */
+/* SU=m, SU is Stack Usage */
+
+#include "big_XXX.h"
+
+//int XXX::BIGMULS=0;
+//int XXX::BIGSQRS=0;
+
+/* test a=0? */
+int XXX::BIG_iszilch(BIG a)
+{
+    int i;
+    chunk d=0;
+    for (i = 0; i < NLEN_XXX; i++)
+        d|=a[i];
+    return (1 & ((d-1)>>BASEBITS_XXX));
+}
+
+/* test a=1? */
+int XXX::BIG_isunity(BIG a)
+{
+    int i;
+    chunk d=0;
+    for (i = 1; i < NLEN_XXX; i++)
+        d|=a[i];
+    return (1 & ((d-1)>>BASEBITS_XXX) & (((a[0]^1)-1)>>BASEBITS_XXX));
+}
+
+/* test a=0? */
+int XXX::BIG_diszilch(DBIG a)
+{
+    int i;
+    chunk d=0;
+    for (i = 0; i < DNLEN_XXX; i++)
+        d|=a[i];
+    return (1 & ((d-1)>>BASEBITS_XXX));
+}
+
+/* SU= 56 */
+/* output a */
+void XXX::BIG_output(BIG a)
+{
+    BIG b;
+    int i, len;
+    len = BIG_nbits(a);
+    if (len % 4 == 0) len /= 4;
+    else
+    {
+        len /= 4;
+        len++;
+    }
+    if (len < MODBYTES_XXX * 2) len = MODBYTES_XXX * 2;
+
+    for (i = len - 1; i >= 0; i--)
+    {
+        BIG_copy(b, a);
+        BIG_shr(b, i * 4);
+        printf("%01x", (unsigned int) b[0] & 15);
+    }
+}
+
+/* SU= 16 */
+void XXX::BIG_rawoutput(BIG a)
+{
+    int i;
+    printf("(");
+    for (i = 0; i < NLEN_XXX - 1; i++)
+#if CHUNK==64
+        printf("%jx,", (uintmax_t) a[i]);
+    printf("%jx)", (uintmax_t) a[NLEN_XXX - 1]);
+#else
+        printf("%x,", (unsigned int) a[i]);
+    printf("%x)", (unsigned int) a[NLEN_XXX - 1]);
+#endif
+}
+
+// modified to prevent Nonce@Once side channel attack
+// Two tricks to thwart compiler optimization
+// 1. Prevent mask removal by performing transformation that might change the mask, but in fact does not
+// 2. Force the code to calculate an intermediate value, by making it part of (an unused) return value
+// problem is XORing with all zeros or XORing with "random" shows up in side-channel, and reveals d
+
+/* Swap a and b if d=1 */
+chunk XXX::BIG_cswap(BIG a, BIG b, int d)
+{
+    int i;
+    chunk e, r, ra, w, t, c = (chunk) - d;
+    w=0; 
+    r=a[0]^b[1];  // sort of random
+    ra=r+r; ra>>=1; // I know this doesn't change r, but the compiler doesn't!
+#ifdef DEBUG_NORM
+    for (i = 0; i < NLEN_XXX + 2; i++)
+#else
+    for (i = 0; i < NLEN_XXX; i++)
+#endif
+    {
+        t = c & (a[i] ^ b[i]);
+        t^=r; 
+        e=a[i]^t; w^=e;  // to force calculation of e
+        a[i]=e^ra;
+        e=b[i]^t; w^=e;
+        b[i]=e^ra;
+    }
+    return w; // to bewilder optimizer
+}
+
+/* Move g to f if d=1 */
+chunk XXX::BIG_cmove(BIG f, BIG g, int d)
+{
+    int i;
+    chunk e,w,r,ra,t,b = (chunk) - d;
+    w=0;
+    r=f[0]^g[1];
+    ra=r+r; ra>>=1; // I know this doesn't change r, but the compiler doesn't!
+#ifdef DEBUG_NORM
+    for (i = 0; i < NLEN_XXX + 2; i++)
+#else
+    for (i = 0; i < NLEN_XXX; i++)
+#endif
+    {
+        t=(f[i]^g[i])&b;
+        t^=r;
+        e=f[i]^t; w^=e;  // to force calculation of e
+        f[i]=e^ra;
+    }
+    return w; // to bewilder optimizer
+}
+
+/* Move g to f if d=1 */
+chunk XXX::BIG_dcmove(DBIG f, DBIG g, int d)
+{
+    int i;
+    chunk e,w,r,ra,t,b = (chunk) - d;
+    w=0;
+    r=f[0]^g[1];
+    ra=r+r; ra>>=1; // I know this doesn't change r, but the compiler doesn't!
+#ifdef DEBUG_NORM
+    for (i = 0; i < DNLEN_XXX + 2; i++)
+#else
+    for (i = 0; i < DNLEN_XXX; i++)
+#endif
+    {
+        t=(f[i]^g[i])&b;
+        t^=r;
+        e=f[i]^t; w^=e;
+        f[i]=e^ra;
+    }
+    return w;
+}
+
+/* convert BIG to/from bytes */
+/* SU= 64 */
+void XXX::BIG_toBytes(char *b, BIG a)
+{
+    int i;
+    BIG c;
+    BIG_copy(c, a);
+    BIG_norm(c);
+    for (i = MODBYTES_XXX - 1; i >= 0; i--)
+    {
+        b[i] = c[0] & 0xff;
+        BIG_fshr(c, 8);
+    }
+}
+
+/* SU= 16 */
+void XXX::BIG_fromBytes(BIG a, char *b)
+{
+    int i;
+    BIG_zero(a);
+    for (i = 0; i < MODBYTES_XXX; i++)
+    {
+        BIG_fshl(a, 8);
+        a[0] += (int)(unsigned char)b[i];
+    }
+#ifdef DEBUG_NORM
+    a[MPV_XXX] = 1; a[MNV_XXX] = 0;
+#endif
+}
+
+void XXX::BIG_fromBytesLen(BIG a, char *b, int s)
+{
+    int i, len = s;
+    BIG_zero(a);
+
+    if (len > MODBYTES_XXX) len = MODBYTES_XXX;
+    for (i = 0; i < len; i++)
+    {
+        BIG_fshl(a, 8);
+        a[0] += (int)(unsigned char)b[i];
+    }
+#ifdef DEBUG_NORM
+    a[MPV_XXX] = 1; a[MNV_XXX] = 0;
+#endif
+}
+
+
+
+/* SU= 88 */
+void XXX::BIG_doutput(DBIG a)
+{
+    DBIG b;
+    int i, len;
+    BIG_dnorm(a);
+    len = BIG_dnbits(a);
+    if (len % 4 == 0) len /= 4;
+    else
+    {
+        len /= 4;
+        len++;
+    }
+
+    for (i = len - 1; i >= 0; i--)
+    {
+        BIG_dcopy(b, a);
+        BIG_dshr(b, i * 4);
+        printf("%01x", (unsigned int) b[0] & 15);
+    }
+}
+
+
+void XXX::BIG_drawoutput(DBIG a)
+{
+    int i;
+    printf("(");
+    for (i = 0; i < DNLEN_XXX - 1; i++)
+#if CHUNK==64
+        printf("%jx,", (uintmax_t) a[i]);
+    printf("%jx)", (uintmax_t) a[DNLEN_XXX - 1]);
+#else
+        printf("%x,", (unsigned int) a[i]);
+    printf("%x)", (unsigned int) a[DNLEN_XXX - 1]);
+#endif
+}
+
+/* Copy b=a */
+void XXX::BIG_copy(BIG b, BIG a)
+{
+    int i;
+    for (i = 0; i < NLEN_XXX; i++)
+        b[i] = a[i];
+#ifdef DEBUG_NORM
+    b[MPV_XXX] = a[MPV_XXX];
+    b[MNV_XXX] = a[MNV_XXX];
+#endif
+}
+
+/* Copy from ROM b=a */
+void XXX::BIG_rcopy(BIG b, const BIG a)
+{
+    int i;
+    for (i = 0; i < NLEN_XXX; i++)
+        b[i] = a[i];
+#ifdef DEBUG_NORM
+    b[MPV_XXX] = 1; b[MNV_XXX] = 0;
+#endif
+}
+
+/* double length DBIG copy b=a */
+void XXX::BIG_dcopy(DBIG b, DBIG a)
+{
+    int i;
+    for (i = 0; i < DNLEN_XXX; i++)
+        b[i] = a[i];
+#ifdef DEBUG_NORM
+    b[DMPV_XXX] = a[DMPV_XXX];
+    b[DMNV_XXX] = a[DMNV_XXX];
+#endif
+}
+
+/* Copy BIG to bottom half of DBIG */
+void XXX::BIG_dscopy(DBIG b, BIG a)
+{
+    int i;
+    for (i = 0; i < NLEN_XXX - 1; i++)
+        b[i] = a[i];
+
+    b[NLEN_XXX - 1] = a[NLEN_XXX - 1] & BMASK_XXX; /* top word normalized */
+    b[NLEN_XXX] = a[NLEN_XXX - 1] >> BASEBITS_XXX;
+
+    for (i = NLEN_XXX + 1; i < DNLEN_XXX; i++) b[i] = 0;
+#ifdef DEBUG_NORM
+    b[DMPV_XXX] = a[MPV_XXX];
+    b[DMNV_XXX] = a[MNV_XXX];
+#endif
+}
+
+/* Copy BIG to top half of DBIG */
+void XXX::BIG_dsucopy(DBIG b, BIG a)
+{
+    int i;
+    for (i = 0; i < NLEN_XXX; i++)
+        b[i] = 0;
+    for (i = NLEN_XXX; i < DNLEN_XXX; i++)
+        b[i] = a[i - NLEN_XXX];
+#ifdef DEBUG_NORM
+    b[DMPV_XXX] = a[MPV_XXX];
+    b[DMNV_XXX] = a[MNV_XXX];
+#endif
+}
+
+/* Copy bottom half of DBIG to BIG */
+void XXX::BIG_sdcopy(BIG b, DBIG a)
+{
+    int i;
+    for (i = 0; i < NLEN_XXX; i++)
+        b[i] = a[i];
+#ifdef DEBUG_NORM
+    b[MPV_XXX] = a[DMPV_XXX];
+    b[MNV_XXX] = a[DMNV_XXX];
+#endif
+}
+
+/* Copy top half of DBIG to BIG */
+void XXX::BIG_sducopy(BIG b, DBIG a)
+{
+    int i;
+    for (i = 0; i < NLEN_XXX; i++)
+        b[i] = a[i + NLEN_XXX];
+#ifdef DEBUG_NORM
+    b[MPV_XXX] = a[DMPV_XXX];
+    b[MNV_XXX] = a[DMNV_XXX];
+
+#endif
+}
+
+/* Set a=0 */
+void XXX::BIG_zero(BIG a)
+{
+    int i;
+    for (i = 0; i < NLEN_XXX; i++)
+        a[i] = 0;
+#ifdef DEBUG_NORM
+    a[MPV_XXX] = a[MNV_XXX] = 0;
+#endif
+}
+
+void XXX::BIG_dzero(DBIG a)
+{
+    int i;
+    for (i = 0; i < DNLEN_XXX; i++)
+        a[i] = 0;
+#ifdef DEBUG_NORM
+    a[DMPV_XXX] = a[DMNV_XXX] = 0;
+#endif
+}
+
+/* set a=1 */
+void XXX::BIG_one(BIG a)
+{
+    int i;
+    a[0] = 1;
+    for (i = 1; i < NLEN_XXX; i++)
+        a[i] = 0;
+#ifdef DEBUG_NORM
+    a[MPV_XXX] = 1;
+    a[MNV_XXX] = 0;
+#endif
+}
+
+/* Set c=a+b */
+/* SU= 8 */
+void XXX::BIG_add(BIG c, BIG a, BIG b)
+{
+    int i;
+    for (i = 0; i < NLEN_XXX; i++)
+        c[i] = a[i] + b[i];
+#ifdef DEBUG_NORM
+    c[MPV_XXX] = a[MPV_XXX] + b[MPV_XXX];
+    c[MNV_XXX] = a[MNV_XXX] + b[MNV_XXX];
+    if (c[MPV_XXX] > NEXCESS_XXX)  printf("add problem - positive digit overflow %d\n", (int)c[MPV_XXX]);
+    if (c[MNV_XXX] > NEXCESS_XXX)  printf("add problem - negative digit overflow %d\n", (int)c[MNV_XXX]);
+
+#endif
+}
+
+/* Set c=a or b */
+/* SU= 8 */
+void XXX::BIG_or(BIG c, BIG a, BIG b)
+{
+    int i;
+    BIG_norm(a);
+    BIG_norm(b);
+    for (i = 0; i < NLEN_XXX; i++)
+        c[i] = a[i] | b[i];
+#ifdef DEBUG_NORM
+    c[MPV_XXX] = 1;
+    c[MNV_XXX] = 0;
+#endif
+
+}
+
+
+/* Set c=c+d */
+void XXX::BIG_inc(BIG c, int d)
+{
+    BIG_norm(c);
+    c[0] += (chunk)d;
+#ifdef DEBUG_NORM
+    c[MPV_XXX] += 1;
+#endif
+}
+
+/* Set c=a-b */
+/* SU= 8 */
+void XXX::BIG_sub(BIG c, BIG a, BIG b)
+{
+    int i;
+    for (i = 0; i < NLEN_XXX; i++)
+        c[i] = a[i] - b[i];
+#ifdef DEBUG_NORM
+    c[MPV_XXX] = a[MPV_XXX] + b[MNV_XXX];
+    c[MNV_XXX] = a[MNV_XXX] + b[MPV_XXX];
+    if (c[MPV_XXX] > NEXCESS_XXX)  printf("sub problem - positive digit overflow %d\n", (int)c[MPV_XXX]);
+    if (c[MNV_XXX] > NEXCESS_XXX)  printf("sub problem - negative digit overflow %d\n", (int)c[MNV_XXX]);
+
+#endif
+}
+
+/* SU= 8 */
+
+void XXX::BIG_dsub(DBIG c, DBIG a, DBIG b)
+{
+    int i;
+    for (i = 0; i < DNLEN_XXX; i++)
+        c[i] = a[i] - b[i];
+#ifdef DEBUG_NORM
+    c[DMPV_XXX] = a[DMPV_XXX] + b[DMNV_XXX];
+    c[DMNV_XXX] = a[DMNV_XXX] + b[DMPV_XXX];
+    if (c[DMPV_XXX] > NEXCESS_XXX)  printf("double sub problem - positive digit overflow %d\n", (int)c[DMPV_XXX]);
+    if (c[DMNV_XXX] > NEXCESS_XXX)  printf("double sub problem - negative digit overflow %d\n", (int)c[DMNV_XXX]);
+#endif
+}
+
+void XXX::BIG_dadd(DBIG c, DBIG a, DBIG b)
+{
+    int i;
+    for (i = 0; i < DNLEN_XXX; i++)
+        c[i] = a[i] + b[i];
+#ifdef DEBUG_NORM
+    c[DMPV_XXX] = a[DMPV_XXX] + b[DMNV_XXX];
+    c[DMNV_XXX] = a[DMNV_XXX] + b[DMPV_XXX];
+    if (c[DMPV_XXX] > NEXCESS_XXX)  printf("double add problem - positive digit overflow %d\n", (int)c[DMPV_XXX]);
+    if (c[DMNV_XXX] > NEXCESS_XXX)  printf("double add problem - negative digit overflow %d\n", (int)c[DMNV_XXX]);
+#endif
+}
+
+/* Set c=c-1 */
+void XXX::BIG_dec(BIG c, int d)
+{
+    BIG_norm(c);
+    c[0] -= (chunk)d;
+#ifdef DEBUG_NORM
+    c[MNV_XXX] += 1;
+#endif
+}
+
+/* multiplication r=a*c by c<=NEXCESS_XXX */
+void XXX::BIG_imul(BIG r, BIG a, int c)
+{
+    int i;
+    for (i = 0; i < NLEN_XXX; i++) r[i] = a[i] * c;
+#ifdef DEBUG_NORM
+    r[MPV_XXX] = a[MPV_XXX] * c;
+    r[MNV_XXX] = a[MNV_XXX] * c;
+    if (r[MPV_XXX] > NEXCESS_XXX)  printf("int mul problem - positive digit overflow %d\n", (int)r[MPV_XXX]);
+    if (r[MNV_XXX] > NEXCESS_XXX)  printf("int mul problem - negative digit overflow %d\n", (int)r[MNV_XXX]);
+
+#endif
+}
+
+/* multiplication r=a*c by larger integer - c<=FEXCESS */
+/* SU= 24 */
+chunk XXX::BIG_pmul(BIG r, BIG a, int c)
+{
+    int i;
+    chunk ak, carry = 0;
+    for (i = 0; i < NLEN_XXX; i++)
+    {
+        ak = a[i];
+        r[i] = 0;
+        carry = muladd(ak, (chunk)c, carry, &r[i]);
+    }
+#ifdef DEBUG_NORM
+    r[MPV_XXX] = 1;
+    r[MNV_XXX] = 0;
+#endif
+    return carry;
+}
+
+/* r/=3 */
+/* SU= 16 */
+/*
+int XXX::BIG_div3(BIG r)
+{
+    int i;
+    chunk ak,base,carry=0;
+    BIG_norm(r);
+    base=((chunk)1<<BASEBITS_XXX);
+    for (i=NLEN_XXX-1; i>=0; i--)
+    {
+        ak=(carry*base+r[i]);
+        r[i]=ak/3;
+        carry=ak%3;
+    }
+    return (int)carry;
+}
+*/
+/* multiplication c=a*b by even larger integer b>FEXCESS, resulting in DBIG */
+/* SU= 24 */
+void XXX::BIG_pxmul(DBIG c, BIG a, int b)
+{
+    int j;
+    chunk carry;
+    BIG_dzero(c);
+    carry = 0;
+    for (j = 0; j < NLEN_XXX; j++)
+        carry = muladd(a[j], (chunk)b, carry, &c[j]);
+    c[NLEN_XXX] = carry;
+#ifdef DEBUG_NORM
+    c[DMPV_XXX] = 1;
+    c[DMNV_XXX] = 0;
+#endif
+}
+
+/* .. if you know the result will fit in a BIG, c must be distinct from a and b */
+/* SU= 40 */
+void XXX::BIG_smul(BIG c, BIG a, BIG b)
+{
+    int i, j;
+    chunk carry;
+
+    BIG_zero(c);
+    for (i = 0; i < NLEN_XXX; i++)
+    {
+        carry = 0;
+        for (j = 0; j < NLEN_XXX; j++)
+        {
+            if (i + j < NLEN_XXX)
+                carry = muladd(a[i], b[j], carry, &c[i + j]);
+        }
+    }
+#ifdef DEBUG_NORM
+    c[MPV_XXX] = 1;
+    c[MNV_XXX] = 0;
+#endif
+
+}
+
+/* Set c=a*b */
+/* SU= 72 */
+void XXX::BIG_mul(DBIG c, BIG a, BIG b)
+{
+    int i,k;
+#ifdef dchunk
+    dchunk co,t;
+    dchunk s;
+    dchunk d[NLEN_XXX];
+    int m;
+#endif
+
+//XXX::BIGMULS++;
+
+#ifdef DEBUG_NORM
+    if ((a[MPV_XXX] != 1 && a[MPV_XXX] != 0) || a[MNV_XXX] != 0) printf("First input to mul not normed\n");
+    if ((b[MPV_XXX] != 1 && b[MPV_XXX] != 0) || b[MNV_XXX] != 0) printf("Second input to mul not normed\n");
+#endif
+
+    /* Faster to Combafy it.. Let the compiler unroll the loops! */
+
+#ifdef COMBA
+
+    /* faster psuedo-Karatsuba method */
+#ifdef UNWOUND
+
+#ifdef USE_KARATSUBA
+
+    INLINE_MUL2
+
+#else
+
+    INLINE_MUL1
+
+#endif
+
+#else
+
+#ifndef USE_KARATSUBA
+
+    t=(dchunk)a[0]*b[0];
+    c[0]=(chunk)t & BMASK_XXX;
+    t = t >> BASEBITS_XXX;
+    for (i=1;i<NLEN_XXX;i++)
+    {
+        k=0; 
+        while (k<=i) {t+=(dchunk)a[k]*b[i-k]; k++;}
+        c[i]=(chunk)t & BMASK_XXX;
+        t = t >> BASEBITS_XXX;
+    }
+
+    for (i=NLEN_XXX;i<2*NLEN_XXX-1;i++)
+    {
+        k=i-(NLEN_XXX-1);
+        while (k<=NLEN_XXX-1) {t+=(dchunk)a[k]*b[i-k]; k++;}
+        c[i]=(chunk)t & BMASK_XXX;
+        t = t >> BASEBITS_XXX;
+    }
+
+    c[2 * NLEN_XXX - 1] = (chunk)t;
+#else
+
+    for (i = 0; i < NLEN_XXX; i++)
+        d[i] = (dchunk)a[i] * b[i];
+
+    s = d[0];
+    t = s;
+    c[0] = (chunk)t & BMASK_XXX;
+    t = t >> BASEBITS_XXX;
+
+    for (k = 1; k < NLEN_XXX; k++)
+    {
+        s += d[k];
+        t += s;
+        /*for (i = k; i >= 1 + k / 2; i--) This causes a huge slow down! gcc/g++ optimizer problem (I think) */
+        for (i=1+k/2;i<=k;i++) t += (dchunk)(a[i] - a[k - i]) * (b[k - i] - b[i]);
+        c[k] = (chunk)t & BMASK_XXX;
+        t = t >> BASEBITS_XXX;
+    }
+    for (k = NLEN_XXX; k < 2 * NLEN_XXX - 1; k++)
+    {
+        s -= d[k - NLEN_XXX];
+        t += s;
+        for (i=1+k/2;i<NLEN_XXX;i++) t += (dchunk)(a[i] - a[k - i]) * (b[k - i] - b[i]);
+        c[k] = (chunk)t & BMASK_XXX;
+        t = t >> BASEBITS_XXX;
+    }
+    c[2 * NLEN_XXX - 1] = (chunk)t;
+#endif
+#endif
+
+#else
+    int j;
+    chunk carry;
+    BIG_dzero(c);
+    for (i = 0; i < NLEN_XXX; i++)
+    {
+        carry = 0;
+        for (j = 0; j < NLEN_XXX; j++)
+            carry = muladd(a[i], b[j], carry, &c[i + j]);
+
+        c[NLEN_XXX + i] = carry;
+    }
+
+#endif
+
+#ifdef DEBUG_NORM
+    c[DMPV_XXX] = 1;
+    c[DMNV_XXX] = 0;
+#endif
+}
+
+/* Set c=a*a */
+/* SU= 80 */
+void XXX::BIG_sqr(DBIG c, BIG a)
+{
+    int i, j;
+#ifdef dchunk
+    dchunk t, co;
+#endif
+//XXX::BIGSQRS++;
+#ifdef DEBUG_NORM
+    if ((a[MPV_XXX] != 1 && a[MPV_XXX] != 0) || a[MNV_XXX] != 0) printf("Input to sqr not normed\n");
+#endif
+    /* Note 2*a[i] in loop below and extra addition */
+
+#ifdef COMBA
+
+#ifdef UNWOUND
+
+    INLINE_SQR
+
+#else
+
+
+    t = (dchunk)a[0] * a[0];
+    c[0] = (chunk)t & BMASK_XXX;
+    co = t >> BASEBITS_XXX;
+
+    for (j = 1; j < NLEN_XXX - 1; )
+    {
+        t = (dchunk)a[j] * a[0];
+        for (i = 1; i < (j + 1) / 2; i++) {t += (dchunk)a[j - i] * a[i]; }
+        t += t; t += co;
+        c[j] = (chunk)t & BMASK_XXX;
+        co = t >> BASEBITS_XXX;
+        j++;
+        t = (dchunk)a[j] * a[0];
+        for (i = 1; i < (j + 1) / 2; i++) {t += (dchunk)a[j - i] * a[i]; }
+        t += t; t += co;
+        t += (dchunk)a[j / 2] * a[j / 2];
+        c[j] = (chunk)t & BMASK_XXX;
+        co = t >> BASEBITS_XXX;
+        j++;
+    }
+
+    for (j = NLEN_XXX - 1 + NLEN_XXX % 2; j < DNLEN_XXX - 3; )
+    {
+        t = (dchunk)a[NLEN_XXX - 1] * a[j - NLEN_XXX + 1];
+        for (i = j - NLEN_XXX + 2; i < (j + 1) / 2; i++) {t += (dchunk)a[j - i] * a[i];  }
+        t += t; t += co;
+        c[j] = (chunk)t & BMASK_XXX;
+        co = t >> BASEBITS_XXX;
+        j++;
+        t = (dchunk)a[NLEN_XXX - 1] * a[j - NLEN_XXX + 1];
+        for (i = j - NLEN_XXX + 2; i < (j + 1) / 2; i++) {t += (dchunk)a[j - i] * a[i];  }
+        t += t; t += co;
+        t += (dchunk)a[j / 2] * a[j / 2];
+        c[j] = (chunk)t & BMASK_XXX;
+        co = t >> BASEBITS_XXX;
+        j++;
+    }
+
+    t = (dchunk)a[NLEN_XXX - 2] * a[NLEN_XXX - 1];
+    t += t; t += co;
+    c[DNLEN_XXX - 3] = (chunk)t & BMASK_XXX;
+    co = t >> BASEBITS_XXX;
+
+    t = (dchunk)a[NLEN_XXX - 1] * a[NLEN_XXX - 1] + co;
+    c[DNLEN_XXX - 2] = (chunk)t & BMASK_XXX;
+    co = t >> BASEBITS_XXX;
+    c[DNLEN_XXX - 1] = (chunk)co;
+
+
+#endif
+
+#else
+    chunk carry;
+    BIG_dzero(c);
+    for (i = 0; i < NLEN_XXX; i++)
+    {
+        carry = 0;
+        for (j = i + 1; j < NLEN_XXX; j++)
+            carry = muladd(a[i], a[j], carry, &c[i + j]);
+        c[NLEN_XXX + i] = carry;
+    }
+
+    for (i = 0; i < DNLEN_XXX; i++) c[i] *= 2;
+
+    for (i = 0; i < NLEN_XXX; i++)
+        c[2 * i + 1] += muladd(a[i], a[i], 0, &c[2 * i]);
+
+    BIG_dnorm(c); 
+#endif
+
+
+#ifdef DEBUG_NORM
+    c[DMPV_XXX] = 1;
+    c[DMNV_XXX] = 0;
+#endif
+
+}
+
+/* Montgomery reduction */
+void XXX::BIG_monty(BIG a, BIG md, chunk MC, DBIG d)
+{
+    int i, k;
+
+#ifdef dchunk
+    dchunk c,t,s;
+    dchunk dd[NLEN_XXX];
+    chunk v[NLEN_XXX];
+#endif
+
+
+#ifdef DEBUG_NORM
+    if ((d[DMPV_XXX] != 1 && d[DMPV_XXX] != 0) || d[DMNV_XXX] != 0) printf("Input to redc not normed\n");
+#endif
+
+#ifdef COMBA
+
+#ifdef UNWOUND
+
+#ifdef USE_KARATSUBA
+
+    INLINE_REDC2
+
+#else
+
+    INLINE_REDC1
+
+#endif
+
+#else
+
+#ifndef USE_KARATSUBA 
+    t = d[0];
+    v[0] = ((chunk)t * MC)&BMASK_XXX;
+    t += (dchunk)v[0] * md[0];
+    t = (t >> BASEBITS_XXX) + d[1];
+   
+    for (i = 1; i < NLEN_XXX; i++)
+    {
+        k=1;
+        t += (dchunk)v[0] * md[i];
+        while (k<i) {t += (dchunk)v[k]*md[i-k]; k++;}
+        v[i] = ((chunk)t * MC)&BMASK_XXX;
+        t += (dchunk)v[i] * md[0];
+        t = (t >> BASEBITS_XXX) + d[i + 1];
+    }
+    for (i = NLEN_XXX; i < 2 * NLEN_XXX - 1; i++)
+    {
+        k=i-(NLEN_XXX-1);
+        while (k<=NLEN_XXX-1) {t += (dchunk)v[k]*md[i-k]; k++;}
+        a[i - NLEN_XXX] = (chunk)t & BMASK_XXX;
+        t = (t >> BASEBITS_XXX) + d[i + 1];
+    }
+    a[NLEN_XXX - 1] = (chunk)t & BMASK_XXX;
+#else
+
+    t = d[0];
+    v[0] = ((chunk)t * MC)&BMASK_XXX;
+    t += (dchunk)v[0] * md[0];
+    t = (t >> BASEBITS_XXX) + d[1];
+    s = 0;
+
+    for (k = 1; k < NLEN_XXX; k++)
+    {
+        t = t + s + (dchunk)v[0] * md[k];
+
+        for (i=1+k/2;i<k;i++) t += (dchunk)(v[k - i] - v[i]) * (md[i] - md[k - i]);
+        v[k] = ((chunk)t * MC)&BMASK_XXX;
+        t += (dchunk)v[k] * md[0];
+        t = (t >> BASEBITS_XXX) + d[k + 1];
+        dd[k] = (dchunk)v[k] * md[k];
+        s += dd[k];
+    }
+    for (k = NLEN_XXX; k < 2 * NLEN_XXX - 1; k++)
+    {
+        t = t + s;
+        for (i=1+k/2;i<NLEN_XXX;i++) t += (dchunk)(v[k - i] - v[i]) * (md[i] - md[k - i]);
+        a[k - NLEN_XXX] = (chunk)t & BMASK_XXX;
+        t = (t >> BASEBITS_XXX) + d[k + 1];
+        s -= dd[k - NLEN_XXX + 1];
+    }
+    a[NLEN_XXX - 1] = (chunk)t & BMASK_XXX;
+#endif
+
+#endif
+
+
+
+#else
+    int j;
+    chunk m, carry;
+    for (i = 0; i < NLEN_XXX; i++)
+    {
+        if (MC == -1) m = (-d[i])&BMASK_XXX;
+        else
+        {
+            if (MC == 1) m = d[i];
+            else m = (MC * d[i])&BMASK_XXX;
+        }
+        carry = 0;
+        for (j = 0; j < NLEN_XXX; j++)
+            carry = muladd(m, md[j], carry, &d[i + j]);
+        d[NLEN_XXX + i] += carry;
+    }
+    BIG_sducopy(a, d);
+    BIG_norm(a);
+
+#endif
+
+#ifdef DEBUG_NORM
+    a[MPV_XXX] = 1;  a[MNV_XXX] = 0;
+#endif
+}
+
+/* General shift left of a by n bits */
+/* a MUST be normalised */
+/* SU= 32 */
+void XXX::BIG_shl(BIG a, int k)
+{
+    int i;
+    int n = k % BASEBITS_XXX;
+    int m = k / BASEBITS_XXX;
+
+    a[NLEN_XXX - 1] = ((a[NLEN_XXX - 1 - m] << n));
+    if (NLEN_XXX >= m + 2) a[NLEN_XXX - 1] |= (a[NLEN_XXX - m - 2] >> (BASEBITS_XXX - n));
+
+    for (i = NLEN_XXX - 2; i > m; i--)
+        a[i] = ((a[i - m] << n)&BMASK_XXX) | (a[i - m - 1] >> (BASEBITS_XXX - n));
+    a[m] = (a[0] << n)&BMASK_XXX;
+    for (i = 0; i < m; i++) a[i] = 0;
+
+}
+
+/* Fast shift left of a by n bits, where n less than a word, Return excess (but store it as well) */
+/* a MUST be normalised */
+/* SU= 16 */
+int XXX::BIG_fshl(BIG a, int n)
+{
+    int i;
+
+    a[NLEN_XXX - 1] = ((a[NLEN_XXX - 1] << n)) | (a[NLEN_XXX - 2] >> (BASEBITS_XXX - n)); /* top word not masked */
+    for (i = NLEN_XXX - 2; i > 0; i--)
+        a[i] = ((a[i] << n)&BMASK_XXX) | (a[i - 1] >> (BASEBITS_XXX - n));
+    a[0] = (a[0] << n)&BMASK_XXX;
+
+    return (int)(a[NLEN_XXX - 1] >> ((8 * MODBYTES_XXX) % BASEBITS_XXX)); /* return excess - only used in ff.c */
+}
+
+/* double length left shift of a by k bits - k can be > BASEBITS_XXX , a MUST be normalised */
+/* SU= 32 */
+void XXX::BIG_dshl(DBIG a, int k)
+{
+    int i;
+    int n = k % BASEBITS_XXX;
+    int m = k / BASEBITS_XXX;
+
+    a[DNLEN_XXX - 1] = ((a[DNLEN_XXX - 1 - m] << n)) | (a[DNLEN_XXX - m - 2] >> (BASEBITS_XXX - n));
+
+    for (i = DNLEN_XXX - 2; i > m; i--)
+        a[i] = ((a[i - m] << n)&BMASK_XXX) | (a[i - m - 1] >> (BASEBITS_XXX - n));
+    a[m] = (a[0] << n)&BMASK_XXX;
+    for (i = 0; i < m; i++) a[i] = 0;
+
+}
+
+/* General shift right of a by k bits */
+/* a MUST be normalised */
+/* SU= 32 */
+void XXX::BIG_shr(BIG a, int k)
+{
+    int i;
+    int n = k % BASEBITS_XXX;
+    int m = k / BASEBITS_XXX;
+    for (i = 0; i < NLEN_XXX - m - 1; i++)
+        a[i] = (a[m + i] >> n) | ((a[m + i + 1] << (BASEBITS_XXX - n))&BMASK_XXX);
+    if (NLEN_XXX > m)  a[NLEN_XXX - m - 1] = a[NLEN_XXX - 1] >> n;
+    for (i = NLEN_XXX - m; i < NLEN_XXX; i++) a[i] = 0;
+
+}
+
+/* Fast combined shift, subtract and norm. Return sign of result */
+int XXX::BIG_ssn(BIG r, BIG a, BIG m)
+{
+    int i, n = NLEN_XXX - 1;
+    chunk carry;
+    m[0] = (m[0] >> 1) | ((m[1] << (BASEBITS_XXX - 1))&BMASK_XXX);
+    r[0] = a[0] - m[0];
+    carry = r[0] >> BASEBITS_XXX;
+    r[0] &= BMASK_XXX;
+
+    for (i = 1; i < n; i++)
+    {
+        m[i] = (m[i] >> 1) | ((m[i + 1] << (BASEBITS_XXX - 1))&BMASK_XXX);
+        r[i] = a[i] - m[i] + carry;
+        carry = r[i] >> BASEBITS_XXX;
+        r[i] &= BMASK_XXX;
+    }
+
+    m[n] >>= 1;
+    r[n] = a[n] - m[n] + carry;
+#ifdef DEBUG_NORM
+    r[MPV_XXX] = 1; r[MNV_XXX] = 0;
+#endif
+    return ((r[n] >> (CHUNK - 1)) & 1);
+}
+
+/* Faster shift right of a by k bits. Return shifted out part */
+/* a MUST be normalised */
+/* SU= 16 */
+int XXX::BIG_fshr(BIG a, int k)
+{
+    int i;
+    chunk r = a[0] & (((chunk)1 << k) - 1); /* shifted out part */
+    for (i = 0; i < NLEN_XXX - 1; i++)
+        a[i] = (a[i] >> k) | ((a[i + 1] << (BASEBITS_XXX - k))&BMASK_XXX);
+    a[NLEN_XXX - 1] = a[NLEN_XXX - 1] >> k;
+    return (int)r;
+}
+
+/* double length right shift of a by k bits - can be > BASEBITS_XXX */
+/* SU= 32 */
+void XXX::BIG_dshr(DBIG a, int k)
+{
+    int i;
+    int n = k % BASEBITS_XXX;
+    int m = k / BASEBITS_XXX;
+    for (i = 0; i < DNLEN_XXX - m - 1; i++)
+        a[i] = (a[m + i] >> n) | ((a[m + i + 1] << (BASEBITS_XXX - n))&BMASK_XXX);
+    a[DNLEN_XXX - m - 1] = a[DNLEN_XXX - 1] >> n;
+    for (i = DNLEN_XXX - m; i < DNLEN_XXX; i++ ) a[i] = 0;
+}
+
+/* Split DBIG d into two BIGs t|b. Split happens at n bits, where n falls into NLEN_XXX word */
+/* d MUST be normalised */
+/* SU= 24 */
+chunk XXX::BIG_split(BIG t, BIG b, DBIG d, int n)
+{
+    int i;
+    chunk nw, carry = 0;
+    int m = n % BASEBITS_XXX;
+
+    if (m == 0)
+    {
+        for (i = 0; i < NLEN_XXX; i++) b[i] = d[i];
+        if (t != b)
+        {
+            for (i = NLEN_XXX; i < 2 * NLEN_XXX; i++) t[i - NLEN_XXX] = d[i];
+            carry = t[NLEN_XXX - 1] >> BASEBITS_XXX;
+            t[NLEN_XXX - 1] = t[NLEN_XXX - 1] & BMASK_XXX; /* top word normalized */
+        }
+        return carry;
+    }
+
+    for (i = 0; i < NLEN_XXX - 1; i++) b[i] = d[i];
+
+    b[NLEN_XXX - 1] = d[NLEN_XXX - 1] & (((chunk)1 << m) - 1);
+
+    if (t != b)
+    {
+        carry = (d[DNLEN_XXX - 1] << (BASEBITS_XXX - m));
+        for (i = DNLEN_XXX - 2; i >= NLEN_XXX - 1; i--)
+        {
+            nw = (d[i] >> m) | carry;
+            carry = (d[i] << (BASEBITS_XXX - m))&BMASK_XXX;
+            t[i - NLEN_XXX + 1] = nw;
+        }
+    }
+#ifdef DEBUG_NORM
+    t[MPV_XXX] = 1; t[MNV_XXX] = 0;
+    b[MPV_XXX] = 1; b[MNV_XXX] = 0;
+#endif
+    return carry;
+}
+
+/* you gotta keep the sign of carry! Look - no branching! */
+/* Note that sign bit is needed to disambiguate between +ve and -ve values */
+/* normalise BIG - force all digits < 2^BASEBITS_XXX */
+chunk XXX::BIG_norm(BIG a)
+{
+    int i;
+    chunk d, carry;
+
+    carry=a[0]>>BASEBITS_XXX;
+    a[0]&=BMASK_XXX;
+
+    for (i = 1; i < NLEN_XXX - 1; i++)
+    {
+        d = a[i] + carry;
+        a[i] = d & BMASK_XXX;
+        carry = d >> BASEBITS_XXX;
+    }
+    a[NLEN_XXX - 1] = (a[NLEN_XXX - 1] + carry);
+
+#ifdef DEBUG_NORM
+    a[MPV_XXX] = 1; a[MNV_XXX] = 0;
+#endif
+    return (a[NLEN_XXX - 1] >> ((8 * MODBYTES_XXX) % BASEBITS_XXX)); /* only used in ff.c */
+}
+
+void XXX::BIG_dnorm(DBIG a)
+{
+    int i;
+    chunk d, carry;
+
+    carry=a[0]>>BASEBITS_XXX;
+    a[0]&=BMASK_XXX;
+
+    for (i = 1; i < DNLEN_XXX - 1; i++)
+    {
+        d = a[i] + carry;
+        a[i] = d & BMASK_XXX;
+        carry = d >> BASEBITS_XXX;
+    }
+    a[DNLEN_XXX - 1] = (a[DNLEN_XXX - 1] + carry);
+#ifdef DEBUG_NORM
+    a[DMPV_XXX] = 1; a[DMNV_XXX] = 0;
+#endif
+}
+
+/* Compare a and b. Return 1 for a>b, -1 for a<b, 0 for a==b */
+/* a and b MUST be normalised before call */
+/* sodium constant time implementation */
+
+int XXX::BIG_comp(BIG a, BIG b)
+{
+    int i;
+    chunk gt=0; chunk eq=1;
+    for (i = NLEN_XXX-1; i>=0; i--)
+    {
+        gt |= ((b[i]-a[i]) >> BASEBITS_XXX) & eq;
+        eq &= ((b[i]^a[i])-1) >> BASEBITS_XXX;
+    }
+    return (int)(gt+gt+eq-1);
+}
+
+int XXX::BIG_dcomp(DBIG a, DBIG b)
+{
+    int i;
+    chunk gt=0; chunk eq=1;
+    for (i = DNLEN_XXX-1; i>=0; i--)
+    {
+        gt |= ((b[i]-a[i]) >> BASEBITS_XXX) & eq;
+        eq &= ((b[i]^a[i])-1) >> BASEBITS_XXX;
+    }
+    return (int)(gt+gt+eq-1);
+}
+
+/* return number of bits in a */
+/* SU= 8 */
+int XXX::BIG_nbits(BIG a)
+{
+    int bts, k = NLEN_XXX - 1;
+    BIG t;
+    chunk c;
+    BIG_copy(t, a);
+    BIG_norm(t);
+    while (k >= 0 && t[k] == 0) k--;
+    if (k < 0) return 0;
+    bts = BASEBITS_XXX * k;
+    c = t[k];
+    while (c != 0)
+    {
+        c /= 2;
+        bts++;
+    }
+    return bts;
+}
+
+/* SU= 8, Calculate number of bits in a DBIG - output normalised */
+int XXX::BIG_dnbits(DBIG a)
+{
+    int bts, k = DNLEN_XXX - 1;
+    DBIG t;
+    chunk c;
+    BIG_dcopy(t, a);
+    BIG_dnorm(t);
+    while (k >= 0 && t[k] == 0) k--;
+    if (k < 0) return 0;
+    bts = BASEBITS_XXX * k;
+    c = t[k];
+    while (c != 0)
+    {
+        c /= 2;
+        bts++;
+    }
+    return bts;
+}
+
+// Set b=b mod m in constant time (if bd is known at compile time)
+// bd is Max number of bits in b - Actual number of bits in m
+void XXX::BIG_ctmod(BIG b, BIG m, int bd)
+{
+    int k=bd;
+    BIG r,c;
+    BIG_copy(c,m);
+    BIG_norm(b);
+
+    BIG_shl(c,k);
+    while (k>=0)
+    {
+        BIG_sub(r, b, c);
+        BIG_norm(r);
+        BIG_cmove(b, r, 1 - ((r[NLEN_XXX - 1] >> (CHUNK - 1)) & 1));
+        BIG_fshr(c, 1);
+        k--;
+    }
+}
+
+/* Set b=b mod m */
+/* SU= 16 */
+void XXX::BIG_mod(BIG b, BIG m)
+{
+    int k=BIG_nbits(b)-BIG_nbits(m);
+    if (k<0) k=0;
+    BIG_ctmod(b,m,k);
+/*
+    int k = 0;
+    BIG r; 
+    BIG c;
+    BIG_copy(c, m);
+
+    BIG_norm(b);
+    if (BIG_comp(b, c) < 0)
+        return;
+    do
+    {
+        BIG_fshl(c, 1);
+        k++;
+    }
+    while (BIG_comp(b, c) >= 0);
+
+    while (k > 0)
+    {
+        BIG_fshr(c, 1);
+
+// constant time...
+        BIG_sub(r, b, c);
+        BIG_norm(r);
+        BIG_cmove(b, r, 1 - ((r[NLEN_XXX - 1] >> (CHUNK - 1)) & 1));
+        k--;
+    } */
+}
+
+
+// Set a=b mod m in constant time (if bd is known at compile time)
+// bd is Max number of bits in b - Actual number of bits in m
+void XXX::BIG_ctdmod(BIG a, DBIG b, BIG m, int bd)
+{
+    int k=bd;
+    DBIG c,r;
+    BIG_dscopy(c,m);
+    BIG_dnorm(b);
+
+    BIG_dshl(c,k);
+    while (k>=0)
+    {
+        BIG_dsub(r, b, c);
+        BIG_dnorm(r);
+        BIG_dcmove(b, r, 1 - ((r[DNLEN_XXX - 1] >> (CHUNK - 1)) & 1));
+        BIG_dshr(c, 1);
+        k--;
+    }
+    BIG_sdcopy(a,b);
+}
+
+/* Set a=b mod c, b is destroyed. Slow but rarely used. */
+/* SU= 96 */
+void XXX::BIG_dmod(BIG a, DBIG b, BIG m)
+{
+    int k=BIG_dnbits(b)-BIG_nbits(m);
+    if (k<0) k=0;
+    BIG_ctdmod(a,b,m,k);
+
+/*
+    int k = 0;
+    DBIG c, r;
+    BIG_dnorm(b);
+    BIG_dscopy(c,m);
+
+    if (BIG_dcomp(b, c) < 0)
+    {
+        BIG_sdcopy(a, b);
+        return;
+    }
+
+    do
+    {
+        BIG_dshl(c, 1);
+        k++;
+    }
+    while (BIG_dcomp(b, c) >= 0);
+
+    while (k > 0)
+    {
+        BIG_dshr(c, 1);
+// constant time...
+        BIG_dsub(r, b, c);
+        BIG_dnorm(r);
+        BIG_dcmove(b, r, 1 - ((r[DNLEN_XXX - 1] >> (CHUNK - 1)) & 1));
+
+        k--;
+    }
+    BIG_sdcopy(a, b); */
+}
+
+// a=b/m  in constant time (if bd is known at compile time)
+// bd is Max number of bits in b - Actual number of bits in m
+void XXX::BIG_ctddiv(BIG a,DBIG b,BIG m,int bd)
+{
+    int d,k=bd;
+    DBIG c,dr;
+    BIG e,r;
+    BIG_dscopy(c,m);
+    BIG_dnorm(b);
+
+    BIG_zero(a);
+    BIG_zero(e);
+    BIG_inc(e, 1);
+
+    BIG_shl(e,k);
+    BIG_dshl(c,k);
+
+    while (k >= 0)
+    {
+        BIG_dsub(dr, b, c);
+        BIG_dnorm(dr);
+        d = 1 - ((dr[DNLEN_XXX - 1] >> (CHUNK - 1)) & 1);
+        BIG_dcmove(b, dr, d);
+
+        BIG_add(r, a, e);
+        BIG_norm(r);
+        BIG_cmove(a, r, d);
+
+        BIG_dshr(c, 1);
+        BIG_fshr(e, 1);
+        k--;
+    }
+}
+
+/* Set a=b/c,  b is destroyed. Slow but rarely used. */
+/* SU= 136 */
+void XXX::BIG_ddiv(BIG a, DBIG b, BIG m)
+{
+    int k=BIG_dnbits(b)-BIG_nbits(m);
+    if (k<0) k=0;
+    BIG_ctddiv(a,b,m,k);
+/*
+    int d, k = 0;
+    DBIG c, dr;
+    BIG e, r;
+    BIG_dnorm(b);
+    BIG_dscopy(c,m);
+
+    BIG_zero(a);
+    BIG_zero(e);
+    BIG_inc(e, 1);
+
+    while (BIG_dcomp(b, c) >= 0)
+    {
+        BIG_fshl(e, 1);
+        BIG_dshl(c, 1);
+        k++;
+    }
+
+    while (k > 0)
+    {
+        BIG_dshr(c, 1);
+        BIG_fshr(e, 1);
+
+        BIG_dsub(dr, b, c);
+        BIG_dnorm(dr);
+        d = 1 - ((dr[DNLEN_XXX - 1] >> (CHUNK - 1)) & 1);
+        BIG_dcmove(b, dr, d);
+
+        BIG_add(r, a, e);
+        BIG_norm(r);
+        BIG_cmove(a, r, d);
+
+        k--;
+    } */
+}
+
+// a=a/m  in constant time (if bd is known at compile time)
+// bd is Max number of bits in b - Actual number of bits in m
+void XXX::BIG_ctsdiv(BIG b,BIG m,int bd)
+{
+    int d, k=bd;
+    BIG e,a,r,c;
+    BIG_norm(b);
+    BIG_copy(a,b);
+    BIG_copy(c,m);
+    BIG_zero(b);
+    BIG_zero(e);
+    BIG_inc(e, 1);
+
+    BIG_shl(c,k);
+    BIG_shl(e,k);
+
+    while (k >= 0)
+    {
+        BIG_sub(r, a, c);
+        BIG_norm(r);
+        d = 1 - ((r[NLEN_XXX - 1] >> (CHUNK - 1)) & 1);
+        BIG_cmove(a, r, d);
+
+        BIG_add(r, b, e);
+        BIG_norm(r);
+        BIG_cmove(b, r, d);
+
+        BIG_fshr(c, 1);
+        BIG_fshr(e, 1);
+
+        k--;
+    }
+}
+
+void XXX::BIG_sdiv(BIG b, BIG m)
+{
+    int k=BIG_nbits(b)-BIG_nbits(m);
+    if (k<0) k=0;
+    BIG_ctsdiv(b,m,k);
+/*
+    int d, k = 0;
+    BIG c, e, a, r;
+    BIG_norm(b);
+    BIG_copy(a,b);
+    BIG_copy(c, m);
+
+    BIG_zero(b);
+    BIG_zero(e);
+    BIG_inc(e, 1);
+
+    while (BIG_comp(a, c) >= 0)
+    {
+        BIG_fshl(e, 1);
+        BIG_fshl(c, 1);
+        k++;
+    }
+
+    while (k > 0)
+    {
+        BIG_fshr(c, 1);
+        BIG_fshr(e, 1);
+
+        BIG_sub(r, a, c);
+        BIG_norm(r);
+        d = 1 - ((r[NLEN_XXX - 1] >> (CHUNK - 1)) & 1);
+        BIG_cmove(a, r, d);
+
+        BIG_add(r, b, e);
+        BIG_norm(r);
+        BIG_cmove(b, r, d);
+        k--;
+    } */
+}
+
+/* return LSB of a */
+int XXX::BIG_parity(BIG a)
+{
+    return a[0] % 2;
+}
+
+/* return n-th bit of a */
+/* SU= 16 */
+int XXX::BIG_bit(BIG a, int n)
+{
+    return (int)((a[n / BASEBITS_XXX] & ((chunk)1 << (n % BASEBITS_XXX))) >> (n%BASEBITS_XXX));
+}
+
+/* return last n bits of a, where n is small < BASEBITS_XXX */
+/* SU= 16 */
+int XXX::BIG_lastbits(BIG a, int n)
+{
+    int msk = (1 << n) - 1;
+    BIG_norm(a);
+    return ((int)a[0])&msk;
+}
+
+/* get 8*MODBYTES_XXX size random number */
+void XXX::BIG_random(BIG m, csprng *rng)
+{
+    int i, b, j = 0, r = 0;
+    int len = 8 * MODBYTES_XXX;
+
+    BIG_zero(m);
+    /* generate random BIG */
+    for (i = 0; i < len; i++)
+    {
+        if (j == 0) r = RAND_byte(rng);
+        else r >>= 1;
+        b = r & 1;
+        BIG_shl(m, 1);
+        m[0] += b;
+        j++;
+        j &= 7;
+    }
+
+#ifdef DEBUG_NORM
+    m[MPV_XXX] = 1; m[MNV_XXX] = 0;
+#endif
+}
+
+/* get random BIG from rng, modulo q. Done one bit at a time, so its portable */
+
+extern int NFILLPOOL;
+
+void XXX::BIG_randomnum(BIG m, BIG q, csprng *rng)
+{
+    int i, b, j = 0, r = 0;
+    int n=2 * BIG_nbits(q);
+    DBIG d;
+    BIG_dzero(d);
+
+    /* generate random DBIG */
+    for (i = 0; i < n; i++)
+    {
+        if (j == 0) r = RAND_byte(rng);
+        else r >>= 1;
+        b = r & 1;
+        BIG_dshl(d, 1);
+        d[0] += b;
+        j++;
+        j &= 7;
+    }
+    /* reduce modulo a BIG. Removes bias */
+    BIG_dmod(m, d, q);
+#ifdef DEBUG_NORM
+    m[MPV_XXX] = 1; m[MNV_XXX] = 0;
+#endif
+}
+
+/* create randum BIG less than r and less than trunc bits */
+void XXX::BIG_randtrunc(BIG s, BIG r, int trunc, csprng *rng)
+{
+    BIG_randomnum(s, r, rng);
+    if (BIG_nbits(r) > trunc)
+        BIG_mod2m(s, trunc);
+}
+
+/* Set r=a*b mod m */
+/* SU= 96 */
+void XXX::BIG_modmul(BIG r, BIG a1, BIG b1, BIG m)
+{
+    DBIG d;
+    BIG a, b;
+    BIG_copy(a, a1);
+    BIG_copy(b, b1);
+    BIG_mod(a, m);
+    BIG_mod(b, m);
+
+    BIG_mul(d, a, b);
+    BIG_ctdmod(r, d, m,BIG_nbits(m));
+}
+
+/* Set a=a*a mod m */
+/* SU= 88 */
+void XXX::BIG_modsqr(BIG r, BIG a1, BIG m)
+{
+    DBIG d;
+    BIG a;
+    BIG_copy(a, a1);
+    BIG_mod(a, m);
+    BIG_sqr(d, a);
+    BIG_ctdmod(r, d, m, BIG_nbits(m));
+}
+
+/* Set r=-a mod m */
+/* SU= 16 */
+void XXX::BIG_modneg(BIG r, BIG a1, BIG m)
+{
+    BIG a;
+    BIG_copy(a, a1);
+    BIG_mod(a, m);
+    BIG_sub(r, m, a); BIG_norm(r);
+}
+
+/* Set r=a+b mod m */
+void XXX::BIG_modadd(BIG r, BIG a1, BIG b1, BIG m)
+{
+    BIG a, b;
+    BIG_copy(a, a1);
+    BIG_copy(b, b1);
+    BIG_mod(a, m);
+    BIG_mod(b, m);
+    BIG_add(r,a,b); BIG_norm(r);
+    BIG_ctmod(r,m,1);
+}
+
+/* Set a=a/b mod m */
+/* SU= 136 */
+void XXX::BIG_moddiv(BIG r, BIG a1, BIG b1, BIG m)
+{
+    DBIG d;
+    BIG z;
+    BIG a, b;
+    BIG_copy(a, a1);
+    BIG_copy(b, b1);
+    BIG_mod(a, m);
+    BIG_invmodp(z, b, m);
+
+    BIG_mul(d, a, z);
+    BIG_ctdmod(r, d, m, BIG_nbits(m));
+}
+
+/* Get jacobi Symbol (a/p). Returns 0, 1 or -1 */
+/* SU= 216 */
+int XXX::BIG_jacobi(BIG a, BIG p)
+{
+    int n8, k, m = 0;
+    BIG t, x, n, zilch, one;
+    BIG_one(one);
+    BIG_zero(zilch);
+    if (BIG_parity(p) == 0 || BIG_comp(a, zilch) == 0 || BIG_comp(p, one) <= 0) return 0;
+    BIG_norm(a);
+    BIG_copy(x, a);
+    BIG_copy(n, p);
+    BIG_mod(x, p);
+
+    while (BIG_comp(n, one) > 0)
+    {
+        if (BIG_comp(x, zilch) == 0) return 0;
+        n8 = BIG_lastbits(n, 3);
+        k = 0;
+        while (BIG_parity(x) == 0)
+        {
+            k++;
+            BIG_shr(x, 1);
+        }
+        if (k % 2 == 1) m += (n8 * n8 - 1) / 8;
+        m += (n8 - 1) * (BIG_lastbits(x, 2) - 1) / 4;
+        BIG_copy(t, n);
+
+        BIG_mod(t, x);
+        BIG_copy(n, x);
+        BIG_copy(x, t);
+        m %= 2;
+
+    }
+    if (m == 0) return 1;
+    else return -1;
+}
+
+/*
+
+int XXX::step1(BIG u,BIG x,BIG p)
+{
+    int k=0;
+    BIG t;
+    while (BIG_bit(u,k)==0)
+    {
+        BIG_add(t,x,p);
+        BIG_cmove(x,t,BIG_parity(x));
+        BIG_norm(x);
+        BIG_fshr(x,1);
+        k++;
+    }
+    return k;
+}
+
+void XXX::step2(BIG xf,BIG xs,BIG p)
+{
+    BIG t;
+    BIG_add(t,xf,p);
+    BIG_cmove(xf,t,(BIG_comp(xf,xs)>>1)&1); // move if x1<x2 
+    BIG_sub(xf,xf,xs);
+    BIG_norm(xf);
+}
+
+*/
+
+/* Arazi and Qi inversion mod 256 */
+static int invmod256(int a)
+{
+    int U, t1, t2, b, c;
+    t1 = 0;
+    c = (a >> 1) & 1;
+    t1 += c;
+    t1 &= 1;
+    t1 = 2 - t1;
+    t1 <<= 1;
+    U = t1 + 1;
+
+// i=2
+    b = a & 3;
+    t1 = U * b;
+    t1 >>= 2;
+    c = (a >> 2) & 3;
+    t2 = (U * c) & 3;
+    t1 += t2;
+    t1 *= U;
+    t1 &= 3;
+    t1 = 4 - t1;
+    t1 <<= 2;
+    U += t1;
+
+// i=4
+    b = a & 15;
+    t1 = U * b;
+    t1 >>= 4;
+    c = (a >> 4) & 15;
+    t2 = (U * c) & 15;
+    t1 += t2;
+    t1 *= U;
+    t1 &= 15;
+    t1 = 16 - t1;
+    t1 <<= 4;
+    U += t1;
+
+    return U;
+}
+
+/* a=1/a mod 2^BIGBITS_XXX. This is very fast! */
+void XXX::BIG_invmod2m(BIG a)
+{
+    int i;
+    BIG U, t1, b, c;
+    BIG_zero(U);
+    BIG_inc(U, invmod256(BIG_lastbits(a, 8)));
+    for (i = 8; i < BIGBITS_XXX; i <<= 1)
+    {
+        BIG_norm(U);
+        BIG_copy(b, a);
+        BIG_mod2m(b, i);  // bottom i bits of a
+
+        BIG_smul(t1, U, b);
+        BIG_shr(t1, i); // top i bits of U*b
+
+        BIG_copy(c, a);
+        BIG_shr(c, i);
+        BIG_mod2m(c, i); // top i bits of a
+
+        BIG_smul(b, U, c);
+        BIG_mod2m(b, i); // bottom i bits of U*c
+
+        BIG_add(t1, t1, b);
+        BIG_norm(t1);
+        BIG_smul(b, t1, U);
+        BIG_copy(t1, b); // (t1+b)*U
+        BIG_mod2m(t1, i);               // bottom i bits of (t1+b)*U
+
+        BIG_one(b);
+        BIG_shl(b, i);
+        BIG_sub(t1, b, t1);
+        BIG_norm(t1);
+
+        BIG_shl(t1, i);
+
+        BIG_add(U, U, t1);
+    }
+    BIG_copy(a, U);
+    BIG_norm(a);
+    BIG_mod2m(a, BIGBITS_XXX);
+}
+
+// Set r=1/a mod p. Binary method 
+// NOTE: This function is NOT side-channel safe
+// If a is a secret then ALWAYS calculate 1/a = m*(1/am) mod p 
+// where m is a random masking value
+void XXX::BIG_invmodp(BIG r, BIG a, BIG p)
+{
+    BIG u, v, x1, x2, t, one;
+    int par,s;
+
+    BIG_mod(a, p);
+    if (BIG_iszilch(a))
+    {
+        BIG_zero(r);
+        return;
+    }
+
+    BIG_copy(u, a);
+    BIG_copy(v, p);
+    BIG_one(one);
+    BIG_copy(x1, one);
+    BIG_zero(x2);
+
+    while (BIG_comp(u, one) != 0 && BIG_comp(v, one) != 0)
+    {
+        while (BIG_parity(u) == 0)
+        {
+            BIG_fshr(u, 1);
+            BIG_add(t,x1,p);
+            BIG_cmove(x1,t,BIG_parity(x1));
+            BIG_norm(x1);
+            BIG_fshr(x1,1);
+        }
+        while (BIG_parity(v) == 0)
+        {
+            BIG_fshr(v, 1);
+            BIG_add(t,x2,p);
+            BIG_cmove(x2,t,BIG_parity(x2));
+            BIG_norm(x2);
+            BIG_fshr(x2,1);
+        } 
+        if (BIG_comp(u, v) >= 0) 
+        {
+            BIG_sub(u, u, v);
+            BIG_norm(u);
+            BIG_add(t,x1,p);
+            BIG_cmove(x1,t,(BIG_comp(x1,x2)>>1)&1); // move if x1<x2 
+            BIG_sub(x1,x1,x2);
+            BIG_norm(x1);
+        }
+        else
+        {
+            BIG_sub(v, v, u);
+            BIG_norm(v);
+            BIG_add(t,x2,p);
+            BIG_cmove(x2,t,(BIG_comp(x2,x1)>>1)&1); // move if x2<x1 
+            BIG_sub(x2,x2,x1);
+            BIG_norm(x2);
+        }
+    }
+    BIG_copy(r,x1);
+    BIG_cmove(r,x2,BIG_comp(u,one)&1);
+}
+
+
+/* set x = x mod 2^m */
+void XXX::BIG_mod2m(BIG x, int m)
+{
+    int i, wd, bt;
+    chunk msk;
+    BIG_norm(x);
+
+    wd = m / BASEBITS_XXX;
+    bt = m % BASEBITS_XXX;
+    msk = ((chunk)1 << bt) - 1;
+    x[wd] &= msk;
+    for (i = wd + 1; i < NLEN_XXX; i++) x[i] = 0;
+}
+
+// new
+/* Convert to DBIG number from byte array of given length */
+void XXX::BIG_dfromBytesLen(DBIG a, char *b, int s)
+{
+    int i, len = s;
+    BIG_dzero(a);
+
+    for (i = 0; i < len; i++)
+    {
+        BIG_dshl(a, 8);
+        a[0] += (int)(unsigned char)b[i];
+    }
+#ifdef DEBUG_NORM
+    a[DMPV_XXX] = 1; a[DMNV_XXX] = 0;
+#endif
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/big.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/big.h
new file mode 100644
index 0000000..894cc57
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/big.h
@@ -0,0 +1,697 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file big.h
+ * @author Mike Scott
+ * @date 23rd February 2016
+ * @brief Big number Header File
+ *
+ *
+ */
+
+#ifndef BIG_XXX_H
+#define BIG_XXX_H
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <inttypes.h>
+#include "arch.h"
+#include "core.h"
+#include "config_big_XXX.h"
+
+using namespace core;
+
+/* could comment this out if code size is a major issue */
+#define UNWOUND
+/* Normally recommended, but may not be optimal for some architectures, for example 32-bit ARM M4 */
+#define USE_KARATSUBA
+
+#define BIGBITS_XXX (8*MODBYTES_XXX)
+#define NLEN_XXX (1+((8*MODBYTES_XXX-1)/BASEBITS_XXX))
+#define DNLEN_XXX 2*NLEN_XXX
+#define BMASK_XXX (((chunk)1<<BASEBITS_XXX)-1) /**< Mask = 2^BASEBITS-1 */
+#define NEXCESS_XXX (1<<(CHUNK-BASEBITS_XXX-1))           /**< 2^(CHUNK-BASEBITS-1) - digit cannot be multiplied by more than this before normalisation */
+
+#define HBITS_XXX (BASEBITS_XXX/2)      /**< Number of bits in number base divided by 2 */
+#define HMASK_XXX (((chunk)1<<HBITS_XXX)-1)    /**< Mask = 2^HBITS-1 */
+
+//#define DEBUG_NORM
+
+#ifdef DEBUG_NORM  /* Add an extra location to track chunk extension */
+#define MPV_XXX NLEN_XXX
+#define MNV_XXX (NLEN_XXX+1)
+#define DMPV_XXX DNLEN_XXX
+#define DMNV_XXX (DNLEN_XXX+1)
+
+#endif
+
+namespace XXX {
+
+//extern int BIGMULS;
+//extern int BIGSQRS;
+
+#ifdef DEBUG_NORM
+typedef chunk BIG[NLEN_XXX + 2]; /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_XXX + 2]; /**< Define type DBIG as array of chunks */
+#else
+typedef chunk BIG[NLEN_XXX];     /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_XXX];   /**< Define type DBIG as array of chunks */
+#endif
+
+/* BIG number prototypes */
+
+/**	@brief Tests for BIG equal to zero (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_iszilch(BIG x);
+/**	@brief Tests for BIG equal to one (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if one, else returns 0
+ */
+extern int BIG_isunity(BIG x);
+/**	@brief Tests for DBIG equal to zero (Constant Time)
+ *
+	@param x a DBIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_diszilch(DBIG x);
+/**	@brief Outputs a BIG number to the console (Variable Time)
+ *
+	@param x a BIG number
+ */
+extern void BIG_output(BIG x);
+/**	@brief Outputs a BIG number to the console in raw form (Variable Time for debugging)
+ *
+	@param x a BIG number
+ */
+extern void BIG_rawoutput(BIG x);
+/**	@brief Conditional constant time swap of two BIG numbers
+ *
+	Conditionally swaps parameters in constant time (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s swap takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cswap(BIG x, BIG y, int s);
+/**	@brief Conditional copy of BIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cmove(BIG x, BIG y, int s);
+/**	@brief Conditional copy of DBIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a DBIG number
+	@param y another DBIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_dcmove(BIG x, BIG y, int s);
+/**	@brief Convert from BIG number to byte array (Constant Time)
+ *
+	@param a byte array
+	@param x BIG number
+ */
+extern void BIG_toBytes(char *a, BIG x);
+/**	@brief Convert to BIG number from byte array (Constant Time)
+ *
+	@param x BIG number
+	@param a byte array
+ */
+extern void BIG_fromBytes(BIG x, char *a);
+/**	@brief Convert to BIG number from byte array of given length (Variable Time)
+ *
+	@param x BIG number
+	@param a byte array
+	@param s byte array length
+ */
+extern void BIG_fromBytesLen(BIG x, char *a, int s);
+/**@brief Convert to DBIG number from byte array of given length (Variable Time)
+ *
+   @param x DBIG number
+   @param a byte array
+   @param s byte array length
+ */
+extern void BIG_dfromBytesLen(DBIG x, char *a, int s);
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_doutput(DBIG x); 
+
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_drawoutput(DBIG x);
+
+/**	@brief Copy BIG from Read-Only Memory to a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number in ROM
+ */
+extern void BIG_rcopy(BIG x, const BIG y);
+/**	@brief Copy BIG to another BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_copy(BIG x, BIG y);
+/**	@brief Copy DBIG to another DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_dcopy(DBIG x, DBIG y);
+/**	@brief Copy BIG to upper half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dsucopy(DBIG x, BIG y);
+/**	@brief Copy BIG to lower half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dscopy(DBIG x, BIG y);
+/**	@brief Copy lower half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sdcopy(BIG x, DBIG y);
+/**	@brief Copy upper half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sducopy(BIG x, DBIG y);
+/**	@brief Set BIG to zero (Constant Time)
+ *
+	@param x BIG number to be set to zero  
+ */
+extern void BIG_zero(BIG x);
+/**	@brief Set DBIG to zero (Constant Time)
+ *
+	@param x DBIG number to be set to zero
+ */
+extern void BIG_dzero(DBIG x);
+/**	@brief Set BIG to one (unity) (Constant Time)
+ *
+	@param x BIG number to be set to one.
+ */
+extern void BIG_one(BIG x);
+/**	@brief Set BIG to inverse mod 2^256 (Constant Time)
+ *
+	@param x BIG number to be inverted
+ */
+extern void BIG_invmod2m(BIG x);
+/**	@brief Set BIG to sum of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, sum of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_add(BIG x, BIG y, BIG z);
+
+/**	@brief Set BIG to logical or of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, or of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_or(BIG x, BIG y, BIG z);
+
+/**	@brief Increment BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be incremented
+	@param i integer
+ */
+extern void BIG_inc(BIG x, int i);
+/**	@brief Set BIG to difference of two BIGs (Constant Time)
+ *
+	@param x BIG number, difference of other two - output not normalised
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_sub(BIG x, BIG y, BIG z);
+/**	@brief Decrement BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be decremented
+	@param i integer
+ */
+extern void BIG_dec(BIG x, int i);
+/**	@brief Set DBIG to sum of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, sum of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dadd(DBIG x, DBIG y, DBIG z);
+/**	@brief Set DBIG to difference of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, difference of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dsub(DBIG x, DBIG y, DBIG z);
+/**	@brief Multiply BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_imul(BIG x, BIG y, int i);
+/**	@brief Multiply BIG by not-so-small small integer - output normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+	@return Overflowing bits
+ */
+extern chunk BIG_pmul(BIG x, BIG y, int i);
+/**	@brief Divide BIG by 3 - output normalised (Constant Time)
+ *
+	@param x BIG number
+	@return Remainder
+ */
+extern int BIG_div3(BIG x);
+/**	@brief Multiply BIG by even bigger small integer resulting in a DBIG - output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_pxmul(DBIG x, BIG y, int i);
+/**	@brief Multiply BIG by another BIG resulting in DBIG - inputs normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_mul(DBIG x, BIG y, BIG z);
+/**	@brief Multiply BIG by another BIG resulting in another BIG - inputs normalised and output normalised (Constant Time)
+ *
+	Note that the product must fit into a BIG, and x must be distinct from y and z
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_smul(BIG x, BIG y, BIG z);
+/**	@brief Square BIG resulting in a DBIG - input normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, square of a BIG
+	@param y BIG number to be squared
+ */
+extern void BIG_sqr(DBIG x, BIG y);
+
+/**	@brief Montgomery reduction of a DBIG to a BIG  - input normalised and output normalised (Constant Time)
+ *
+	@param a BIG number, reduction of a BIG
+	@param md BIG number, the modulus
+	@param MC the Montgomery Constant
+	@param d DBIG number to be reduced
+ */
+extern void BIG_monty(BIG a, BIG md, chunk MC, DBIG d);
+
+/**	@brief Shifts a BIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shl(BIG x, int s);
+/**	@brief Fast shifts a BIG left by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Overflow bits
+ */
+extern int BIG_fshl(BIG x, int s);
+/**	@brief Shifts a DBIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshl(DBIG x, int s);
+/**	@brief Shifts a BIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shr(BIG x, int s);
+
+
+/**	@brief Fast time-critical combined shift by 1 bit, subtract and normalise (Constant Time)
+ *
+	@param r BIG number normalised output
+	@param a BIG number to be subtracted from
+	@param m BIG number to be shifted and subtracted
+	@return sign of r
+ */
+extern int BIG_ssn(BIG r, BIG a, BIG m);
+
+/**	@brief Fast shifts a BIG right by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Shifted out bits
+ */
+extern int BIG_fshr(BIG x, int s);
+/**	@brief Shifts a DBIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshr(DBIG x, int s);
+/**	@brief Splits a DBIG into two BIGs - input must be normalised, outputs normalised (Constant Time as used)
+ *
+	Internal function. The value of s must be approximately in the middle of the DBIG.
+	Typically used to extract z mod 2^MODBITS and z/2^MODBITS
+	@param x BIG number, top half of z
+	@param y BIG number, bottom half of z
+	@param z DBIG number to be split in two.
+	@param s Bit position at which to split
+	@return carry-out from top half
+ */
+extern chunk BIG_split(BIG x, BIG y, DBIG z, int s);
+/**	@brief Normalizes a BIG number - output normalised (Constant Time)
+ *
+	All digits of the input BIG are reduced mod 2^BASEBITS
+	@param x BIG number to be normalised
+ */
+extern chunk BIG_norm(BIG x);
+/**	@brief Normalizes a DBIG number - output normalised (Constant Time)
+ *
+	All digits of the input DBIG are reduced mod 2^BASEBITS
+	@param x DBIG number to be normalised
+ */
+extern void BIG_dnorm(DBIG x);
+/**	@brief Compares two BIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first BIG number to be compared
+	@param y second BIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_comp(BIG x, BIG y);
+/**	@brief Compares two DBIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first DBIG number to be compared
+	@param y second DBIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_dcomp(DBIG x, DBIG y);
+/**	@brief Calculate number of bits in a BIG - output normalised (Variable Time)
+ *
+	@param x BIG number
+	@return Number of bits in x
+ */
+extern int BIG_nbits(BIG x);
+/**	@brief Calculate number of bits in a DBIG - output normalised (Variable Time)
+ *
+	@param x DBIG number
+	@return Number of bits in x
+ */
+extern int BIG_dnbits(DBIG x);
+
+/**	@brief Reduce x mod n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctmod(BIG x, BIG n, int bd);
+
+/**	@brief  x=y mod n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctdmod(BIG x, DBIG y, BIG n, int bd);
+
+/**	@brief Divide x by n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctsdiv(BIG x,BIG n,int bd);
+
+/**	@brief  x=y/n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctddiv(BIG x, DBIG y, BIG n,int bd);
+
+
+/**	@brief Reduce x mod n - input and output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+ */
+extern void BIG_mod(BIG x, BIG n);
+/**	@brief Divide x by n - output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+ */
+extern void BIG_sdiv(BIG x, BIG n);
+/**	@brief  x=y mod n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_dmod(BIG x, DBIG y, BIG n);
+/**	@brief  x=y/n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_ddiv(BIG x, DBIG y, BIG n);
+/**	@brief  return parity of BIG, that is the least significant bit (Constant Time)
+ *
+	@param x BIG number
+	@return 0 or 1
+ */
+extern int BIG_parity(BIG x);
+/**	@brief  return i-th of BIG (Constant Time)
+ *
+	@param x BIG number
+	@param i the bit of x to be returned
+	@return 0 or 1
+ */
+extern int BIG_bit(BIG x, int i);
+/**	@brief  return least significant bits of a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param n number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int BIG_lastbits(BIG x, int n);
+/**	@brief  Create a random BIG from a random number generator (Constant Time)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_random(BIG x, csprng *r);
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randomnum(BIG x, BIG n, csprng *r);
+
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus and truncated to max bit length (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param t Maximum bit length
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randtrunc(BIG x, BIG n, int t, csprng *r);
+
+/**	brief  return NAF (Non-Adjacent-Form) value as +/- 1, 3 or 5, inputs must be normalised
+ *
+	Given x and 3*x extracts NAF value from given bit position, and returns number of bits processed, and number of trailing zeros detected if any
+	param x BIG number
+	param x3 BIG number, three times x
+	param i bit position
+	param nbs pointer to integer returning number of bits processed
+	param nzs pointer to integer returning number of trailing 0s
+	return + or - 1, 3 or 5
+*/
+
+/**	@brief  Calculate x=y*z mod n (Variable Time)
+ *
+	Slow method for modular multiplication
+	@param x BIG number, on exit = y*z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modmul(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y/z mod n (Variable Time)
+ *
+	Slow method for modular division
+	@param x BIG number, on exit = y/z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_moddiv(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y^2 mod n (Variable Time)
+ *
+	Slow method for modular squaring
+	@param x BIG number, on exit = y^2 mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modsqr(BIG x, BIG y, BIG n);
+/**	@brief  Calculate x=-y mod n (Variable Time)
+ *
+	Modular negation
+	@param x BIG number, on exit = -y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modneg(BIG x, BIG y, BIG n);
+
+/**	@brief  Calculate x=y+z mod n (Variable Time)
+ *
+	Slow method for modular addition
+	@param x BIG number, on exit = y+z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modadd(BIG x, BIG y, BIG z, BIG n);
+
+/**	@brief  Calculate jacobi Symbol (x/y) (Variable Time)
+ *
+	@param x BIG number
+	@param y BIG number
+	@return Jacobi symbol, -1,0 or 1
+ */
+extern int BIG_jacobi(BIG x, BIG y);
+/**	@brief  Calculate x=1/y mod n (Variable Time)
+ *
+	Modular Inversion - This is slow. Uses binary method.
+	@param x BIG number, on exit = 1/y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_invmodp(BIG x, BIG y, BIG n);
+/** @brief Calculate x=x mod 2^m (Variable Time)
+ *
+	Truncation
+	@param x BIG number, on reduced mod 2^m
+	@param m new truncated size
+*/
+extern void BIG_mod2m(BIG x, int m);
+
+/**	@brief Calculates a*b+c+*d
+ *
+	Calculate partial product of a.b, add in carry c, and add total to d (Constant Time)
+	@param a multiplier
+	@param b multiplicand
+	@param c carry
+	@param d pointer to accumulated bottom half of result
+	@return top half of result
+ */
+
+
+extern int step1(BIG,BIG,BIG);
+extern void step2(BIG,BIG,BIG);
+
+#ifdef dchunk
+
+/* Method required to calculate x*y+c+r, bottom half in r, top half returned */
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    dchunk prod = (dchunk)x * y + c + *r;
+    *r = (chunk)prod & BMASK_XXX;
+    return (chunk)(prod >> BASEBITS_XXX);
+}
+
+#else
+
+/* No integer type available that can store double the wordlength */
+/* accumulate partial products */
+
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    chunk x0, x1, y0, y1;
+    chunk bot, top, mid, carry;
+    x0 = x & HMASK_XXX;
+    x1 = (x >> HBITS_XXX);
+    y0 = y & HMASK_XXX;
+    y1 = (y >> HBITS_XXX);
+    bot = x0 * y0;
+    top = x1 * y1;
+    mid = x0 * y1 + x1 * y0;
+    x0 = mid & HMASK_XXX;
+    x1 = (mid >> HBITS_XXX);
+    bot += x0 << HBITS_XXX;
+    bot += *r;
+    bot += c;
+
+    top += x1;
+    carry = bot >> BASEBITS_XXX;
+    bot &= BMASK_XXX;
+    top += carry;
+
+    *r = bot;
+    return top;
+}
+
+#endif
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/big_B160_56.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/big_B160_56.h
new file mode 100644
index 0000000..85ef05b
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/big_B160_56.h
@@ -0,0 +1,697 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file big.h
+ * @author Mike Scott
+ * @date 23rd February 2016
+ * @brief Big number Header File
+ *
+ *
+ */
+
+#ifndef BIG_B160_56_H
+#define BIG_B160_56_H
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <inttypes.h>
+#include "arch.h"
+#include "core.h"
+#include "config_big_B160_56.h"
+
+using namespace core;
+
+/* could comment this out if code size is a major issue */
+#define UNWOUND
+/* Normally recommended, but may not be optimal for some architectures, for example 32-bit ARM M4 */
+#define USE_KARATSUBA
+
+#define BIGBITS_B160_56 (8*MODBYTES_B160_56)
+#define NLEN_B160_56 (1+((8*MODBYTES_B160_56-1)/BASEBITS_B160_56))
+#define DNLEN_B160_56 2*NLEN_B160_56
+#define BMASK_B160_56 (((chunk)1<<BASEBITS_B160_56)-1) /**< Mask = 2^BASEBITS-1 */
+#define NEXCESS_B160_56 (1<<(CHUNK-BASEBITS_B160_56-1))           /**< 2^(CHUNK-BASEBITS-1) - digit cannot be multiplied by more than this before normalisation */
+
+#define HBITS_B160_56 (BASEBITS_B160_56/2)      /**< Number of bits in number base divided by 2 */
+#define HMASK_B160_56 (((chunk)1<<HBITS_B160_56)-1)    /**< Mask = 2^HBITS-1 */
+
+//#define DEBUG_NORM
+
+#ifdef DEBUG_NORM  /* Add an extra location to track chunk extension */
+#define MPV_B160_56 NLEN_B160_56
+#define MNV_B160_56 (NLEN_B160_56+1)
+#define DMPV_B160_56 DNLEN_B160_56
+#define DMNV_B160_56 (DNLEN_B160_56+1)
+
+#endif
+
+namespace B160_56 {
+
+//extern int BIGMULS;
+//extern int BIGSQRS;
+
+#ifdef DEBUG_NORM
+typedef chunk BIG[NLEN_B160_56 + 2]; /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B160_56 + 2]; /**< Define type DBIG as array of chunks */
+#else
+typedef chunk BIG[NLEN_B160_56];     /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B160_56];   /**< Define type DBIG as array of chunks */
+#endif
+
+/* BIG number prototypes */
+
+/**	@brief Tests for BIG equal to zero (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_iszilch(BIG x);
+/**	@brief Tests for BIG equal to one (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if one, else returns 0
+ */
+extern int BIG_isunity(BIG x);
+/**	@brief Tests for DBIG equal to zero (Constant Time)
+ *
+	@param x a DBIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_diszilch(DBIG x);
+/**	@brief Outputs a BIG number to the console (Variable Time)
+ *
+	@param x a BIG number
+ */
+extern void BIG_output(BIG x);
+/**	@brief Outputs a BIG number to the console in raw form (Variable Time for debugging)
+ *
+	@param x a BIG number
+ */
+extern void BIG_rawoutput(BIG x);
+/**	@brief Conditional constant time swap of two BIG numbers
+ *
+	Conditionally swaps parameters in constant time (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s swap takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cswap(BIG x, BIG y, int s);
+/**	@brief Conditional copy of BIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cmove(BIG x, BIG y, int s);
+/**	@brief Conditional copy of DBIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a DBIG number
+	@param y another DBIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_dcmove(BIG x, BIG y, int s);
+/**	@brief Convert from BIG number to byte array (Constant Time)
+ *
+	@param a byte array
+	@param x BIG number
+ */
+extern void BIG_toBytes(char *a, BIG x);
+/**	@brief Convert to BIG number from byte array (Constant Time)
+ *
+	@param x BIG number
+	@param a byte array
+ */
+extern void BIG_fromBytes(BIG x, char *a);
+/**	@brief Convert to BIG number from byte array of given length (Variable Time)
+ *
+	@param x BIG number
+	@param a byte array
+	@param s byte array length
+ */
+extern void BIG_fromBytesLen(BIG x, char *a, int s);
+/**@brief Convert to DBIG number from byte array of given length (Variable Time)
+ *
+   @param x DBIG number
+   @param a byte array
+   @param s byte array length
+ */
+extern void BIG_dfromBytesLen(DBIG x, char *a, int s);
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_doutput(DBIG x); 
+
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_drawoutput(DBIG x);
+
+/**	@brief Copy BIG from Read-Only Memory to a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number in ROM
+ */
+extern void BIG_rcopy(BIG x, const BIG y);
+/**	@brief Copy BIG to another BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_copy(BIG x, BIG y);
+/**	@brief Copy DBIG to another DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_dcopy(DBIG x, DBIG y);
+/**	@brief Copy BIG to upper half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dsucopy(DBIG x, BIG y);
+/**	@brief Copy BIG to lower half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dscopy(DBIG x, BIG y);
+/**	@brief Copy lower half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sdcopy(BIG x, DBIG y);
+/**	@brief Copy upper half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sducopy(BIG x, DBIG y);
+/**	@brief Set BIG to zero (Constant Time)
+ *
+	@param x BIG number to be set to zero  
+ */
+extern void BIG_zero(BIG x);
+/**	@brief Set DBIG to zero (Constant Time)
+ *
+	@param x DBIG number to be set to zero
+ */
+extern void BIG_dzero(DBIG x);
+/**	@brief Set BIG to one (unity) (Constant Time)
+ *
+	@param x BIG number to be set to one.
+ */
+extern void BIG_one(BIG x);
+/**	@brief Set BIG to inverse mod 2^256 (Constant Time)
+ *
+	@param x BIG number to be inverted
+ */
+extern void BIG_invmod2m(BIG x);
+/**	@brief Set BIG to sum of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, sum of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_add(BIG x, BIG y, BIG z);
+
+/**	@brief Set BIG to logical or of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, or of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_or(BIG x, BIG y, BIG z);
+
+/**	@brief Increment BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be incremented
+	@param i integer
+ */
+extern void BIG_inc(BIG x, int i);
+/**	@brief Set BIG to difference of two BIGs (Constant Time)
+ *
+	@param x BIG number, difference of other two - output not normalised
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_sub(BIG x, BIG y, BIG z);
+/**	@brief Decrement BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be decremented
+	@param i integer
+ */
+extern void BIG_dec(BIG x, int i);
+/**	@brief Set DBIG to sum of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, sum of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dadd(DBIG x, DBIG y, DBIG z);
+/**	@brief Set DBIG to difference of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, difference of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dsub(DBIG x, DBIG y, DBIG z);
+/**	@brief Multiply BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_imul(BIG x, BIG y, int i);
+/**	@brief Multiply BIG by not-so-small small integer - output normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+	@return Overflowing bits
+ */
+extern chunk BIG_pmul(BIG x, BIG y, int i);
+/**	@brief Divide BIG by 3 - output normalised (Constant Time)
+ *
+	@param x BIG number
+	@return Remainder
+ */
+extern int BIG_div3(BIG x);
+/**	@brief Multiply BIG by even bigger small integer resulting in a DBIG - output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_pxmul(DBIG x, BIG y, int i);
+/**	@brief Multiply BIG by another BIG resulting in DBIG - inputs normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_mul(DBIG x, BIG y, BIG z);
+/**	@brief Multiply BIG by another BIG resulting in another BIG - inputs normalised and output normalised (Constant Time)
+ *
+	Note that the product must fit into a BIG, and x must be distinct from y and z
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_smul(BIG x, BIG y, BIG z);
+/**	@brief Square BIG resulting in a DBIG - input normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, square of a BIG
+	@param y BIG number to be squared
+ */
+extern void BIG_sqr(DBIG x, BIG y);
+
+/**	@brief Montgomery reduction of a DBIG to a BIG  - input normalised and output normalised (Constant Time)
+ *
+	@param a BIG number, reduction of a BIG
+	@param md BIG number, the modulus
+	@param MC the Montgomery Constant
+	@param d DBIG number to be reduced
+ */
+extern void BIG_monty(BIG a, BIG md, chunk MC, DBIG d);
+
+/**	@brief Shifts a BIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shl(BIG x, int s);
+/**	@brief Fast shifts a BIG left by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Overflow bits
+ */
+extern int BIG_fshl(BIG x, int s);
+/**	@brief Shifts a DBIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshl(DBIG x, int s);
+/**	@brief Shifts a BIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shr(BIG x, int s);
+
+
+/**	@brief Fast time-critical combined shift by 1 bit, subtract and normalise (Constant Time)
+ *
+	@param r BIG number normalised output
+	@param a BIG number to be subtracted from
+	@param m BIG number to be shifted and subtracted
+	@return sign of r
+ */
+extern int BIG_ssn(BIG r, BIG a, BIG m);
+
+/**	@brief Fast shifts a BIG right by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Shifted out bits
+ */
+extern int BIG_fshr(BIG x, int s);
+/**	@brief Shifts a DBIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshr(DBIG x, int s);
+/**	@brief Splits a DBIG into two BIGs - input must be normalised, outputs normalised (Constant Time as used)
+ *
+	Internal function. The value of s must be approximately in the middle of the DBIG.
+	Typically used to extract z mod 2^MODBITS and z/2^MODBITS
+	@param x BIG number, top half of z
+	@param y BIG number, bottom half of z
+	@param z DBIG number to be split in two.
+	@param s Bit position at which to split
+	@return carry-out from top half
+ */
+extern chunk BIG_split(BIG x, BIG y, DBIG z, int s);
+/**	@brief Normalizes a BIG number - output normalised (Constant Time)
+ *
+	All digits of the input BIG are reduced mod 2^BASEBITS
+	@param x BIG number to be normalised
+ */
+extern chunk BIG_norm(BIG x);
+/**	@brief Normalizes a DBIG number - output normalised (Constant Time)
+ *
+	All digits of the input DBIG are reduced mod 2^BASEBITS
+	@param x DBIG number to be normalised
+ */
+extern void BIG_dnorm(DBIG x);
+/**	@brief Compares two BIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first BIG number to be compared
+	@param y second BIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_comp(BIG x, BIG y);
+/**	@brief Compares two DBIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first DBIG number to be compared
+	@param y second DBIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_dcomp(DBIG x, DBIG y);
+/**	@brief Calculate number of bits in a BIG - output normalised (Variable Time)
+ *
+	@param x BIG number
+	@return Number of bits in x
+ */
+extern int BIG_nbits(BIG x);
+/**	@brief Calculate number of bits in a DBIG - output normalised (Variable Time)
+ *
+	@param x DBIG number
+	@return Number of bits in x
+ */
+extern int BIG_dnbits(DBIG x);
+
+/**	@brief Reduce x mod n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctmod(BIG x, BIG n, int bd);
+
+/**	@brief  x=y mod n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctdmod(BIG x, DBIG y, BIG n, int bd);
+
+/**	@brief Divide x by n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctsdiv(BIG x,BIG n,int bd);
+
+/**	@brief  x=y/n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctddiv(BIG x, DBIG y, BIG n,int bd);
+
+
+/**	@brief Reduce x mod n - input and output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+ */
+extern void BIG_mod(BIG x, BIG n);
+/**	@brief Divide x by n - output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+ */
+extern void BIG_sdiv(BIG x, BIG n);
+/**	@brief  x=y mod n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_dmod(BIG x, DBIG y, BIG n);
+/**	@brief  x=y/n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_ddiv(BIG x, DBIG y, BIG n);
+/**	@brief  return parity of BIG, that is the least significant bit (Constant Time)
+ *
+	@param x BIG number
+	@return 0 or 1
+ */
+extern int BIG_parity(BIG x);
+/**	@brief  return i-th of BIG (Constant Time)
+ *
+	@param x BIG number
+	@param i the bit of x to be returned
+	@return 0 or 1
+ */
+extern int BIG_bit(BIG x, int i);
+/**	@brief  return least significant bits of a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param n number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int BIG_lastbits(BIG x, int n);
+/**	@brief  Create a random BIG from a random number generator (Constant Time)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_random(BIG x, csprng *r);
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randomnum(BIG x, BIG n, csprng *r);
+
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus and truncated to max bit length (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param t Maximum bit length
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randtrunc(BIG x, BIG n, int t, csprng *r);
+
+/**	brief  return NAF (Non-Adjacent-Form) value as +/- 1, 3 or 5, inputs must be normalised
+ *
+	Given x and 3*x extracts NAF value from given bit position, and returns number of bits processed, and number of trailing zeros detected if any
+	param x BIG number
+	param x3 BIG number, three times x
+	param i bit position
+	param nbs pointer to integer returning number of bits processed
+	param nzs pointer to integer returning number of trailing 0s
+	return + or - 1, 3 or 5
+*/
+
+/**	@brief  Calculate x=y*z mod n (Variable Time)
+ *
+	Slow method for modular multiplication
+	@param x BIG number, on exit = y*z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modmul(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y/z mod n (Variable Time)
+ *
+	Slow method for modular division
+	@param x BIG number, on exit = y/z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_moddiv(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y^2 mod n (Variable Time)
+ *
+	Slow method for modular squaring
+	@param x BIG number, on exit = y^2 mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modsqr(BIG x, BIG y, BIG n);
+/**	@brief  Calculate x=-y mod n (Variable Time)
+ *
+	Modular negation
+	@param x BIG number, on exit = -y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modneg(BIG x, BIG y, BIG n);
+
+/**	@brief  Calculate x=y+z mod n (Variable Time)
+ *
+	Slow method for modular addition
+	@param x BIG number, on exit = y+z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modadd(BIG x, BIG y, BIG z, BIG n);
+
+/**	@brief  Calculate jacobi Symbol (x/y) (Variable Time)
+ *
+	@param x BIG number
+	@param y BIG number
+	@return Jacobi symbol, -1,0 or 1
+ */
+extern int BIG_jacobi(BIG x, BIG y);
+/**	@brief  Calculate x=1/y mod n (Variable Time)
+ *
+	Modular Inversion - This is slow. Uses binary method.
+	@param x BIG number, on exit = 1/y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_invmodp(BIG x, BIG y, BIG n);
+/** @brief Calculate x=x mod 2^m (Variable Time)
+ *
+	Truncation
+	@param x BIG number, on reduced mod 2^m
+	@param m new truncated size
+*/
+extern void BIG_mod2m(BIG x, int m);
+
+/**	@brief Calculates a*b+c+*d
+ *
+	Calculate partial product of a.b, add in carry c, and add total to d (Constant Time)
+	@param a multiplier
+	@param b multiplicand
+	@param c carry
+	@param d pointer to accumulated bottom half of result
+	@return top half of result
+ */
+
+
+extern int step1(BIG,BIG,BIG);
+extern void step2(BIG,BIG,BIG);
+
+#ifdef dchunk
+
+/* Method required to calculate x*y+c+r, bottom half in r, top half returned */
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    dchunk prod = (dchunk)x * y + c + *r;
+    *r = (chunk)prod & BMASK_B160_56;
+    return (chunk)(prod >> BASEBITS_B160_56);
+}
+
+#else
+
+/* No integer type available that can store double the wordlength */
+/* accumulate partial products */
+
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    chunk x0, x1, y0, y1;
+    chunk bot, top, mid, carry;
+    x0 = x & HMASK_B160_56;
+    x1 = (x >> HBITS_B160_56);
+    y0 = y & HMASK_B160_56;
+    y1 = (y >> HBITS_B160_56);
+    bot = x0 * y0;
+    top = x1 * y1;
+    mid = x0 * y1 + x1 * y0;
+    x0 = mid & HMASK_B160_56;
+    x1 = (mid >> HBITS_B160_56);
+    bot += x0 << HBITS_B160_56;
+    bot += *r;
+    bot += c;
+
+    top += x1;
+    carry = bot >> BASEBITS_B160_56;
+    bot &= BMASK_B160_56;
+    top += carry;
+
+    *r = bot;
+    return top;
+}
+
+#endif
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/big_B168_60.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/big_B168_60.h
new file mode 100644
index 0000000..cf431a0
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/big_B168_60.h
@@ -0,0 +1,697 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file big.h
+ * @author Mike Scott
+ * @date 23rd February 2016
+ * @brief Big number Header File
+ *
+ *
+ */
+
+#ifndef BIG_B168_60_H
+#define BIG_B168_60_H
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <inttypes.h>
+#include "arch.h"
+#include "core.h"
+#include "config_big_B168_60.h"
+
+using namespace core;
+
+/* could comment this out if code size is a major issue */
+#define UNWOUND
+/* Normally recommended, but may not be optimal for some architectures, for example 32-bit ARM M4 */
+#define USE_KARATSUBA
+
+#define BIGBITS_B168_60 (8*MODBYTES_B168_60)
+#define NLEN_B168_60 (1+((8*MODBYTES_B168_60-1)/BASEBITS_B168_60))
+#define DNLEN_B168_60 2*NLEN_B168_60
+#define BMASK_B168_60 (((chunk)1<<BASEBITS_B168_60)-1) /**< Mask = 2^BASEBITS-1 */
+#define NEXCESS_B168_60 (1<<(CHUNK-BASEBITS_B168_60-1))           /**< 2^(CHUNK-BASEBITS-1) - digit cannot be multiplied by more than this before normalisation */
+
+#define HBITS_B168_60 (BASEBITS_B168_60/2)      /**< Number of bits in number base divided by 2 */
+#define HMASK_B168_60 (((chunk)1<<HBITS_B168_60)-1)    /**< Mask = 2^HBITS-1 */
+
+//#define DEBUG_NORM
+
+#ifdef DEBUG_NORM  /* Add an extra location to track chunk extension */
+#define MPV_B168_60 NLEN_B168_60
+#define MNV_B168_60 (NLEN_B168_60+1)
+#define DMPV_B168_60 DNLEN_B168_60
+#define DMNV_B168_60 (DNLEN_B168_60+1)
+
+#endif
+
+namespace B168_60 {
+
+//extern int BIGMULS;
+//extern int BIGSQRS;
+
+#ifdef DEBUG_NORM
+typedef chunk BIG[NLEN_B168_60 + 2]; /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B168_60 + 2]; /**< Define type DBIG as array of chunks */
+#else
+typedef chunk BIG[NLEN_B168_60];     /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B168_60];   /**< Define type DBIG as array of chunks */
+#endif
+
+/* BIG number prototypes */
+
+/**	@brief Tests for BIG equal to zero (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_iszilch(BIG x);
+/**	@brief Tests for BIG equal to one (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if one, else returns 0
+ */
+extern int BIG_isunity(BIG x);
+/**	@brief Tests for DBIG equal to zero (Constant Time)
+ *
+	@param x a DBIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_diszilch(DBIG x);
+/**	@brief Outputs a BIG number to the console (Variable Time)
+ *
+	@param x a BIG number
+ */
+extern void BIG_output(BIG x);
+/**	@brief Outputs a BIG number to the console in raw form (Variable Time for debugging)
+ *
+	@param x a BIG number
+ */
+extern void BIG_rawoutput(BIG x);
+/**	@brief Conditional constant time swap of two BIG numbers
+ *
+	Conditionally swaps parameters in constant time (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s swap takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cswap(BIG x, BIG y, int s);
+/**	@brief Conditional copy of BIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cmove(BIG x, BIG y, int s);
+/**	@brief Conditional copy of DBIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a DBIG number
+	@param y another DBIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_dcmove(BIG x, BIG y, int s);
+/**	@brief Convert from BIG number to byte array (Constant Time)
+ *
+	@param a byte array
+	@param x BIG number
+ */
+extern void BIG_toBytes(char *a, BIG x);
+/**	@brief Convert to BIG number from byte array (Constant Time)
+ *
+	@param x BIG number
+	@param a byte array
+ */
+extern void BIG_fromBytes(BIG x, char *a);
+/**	@brief Convert to BIG number from byte array of given length (Variable Time)
+ *
+	@param x BIG number
+	@param a byte array
+	@param s byte array length
+ */
+extern void BIG_fromBytesLen(BIG x, char *a, int s);
+/**@brief Convert to DBIG number from byte array of given length (Variable Time)
+ *
+   @param x DBIG number
+   @param a byte array
+   @param s byte array length
+ */
+extern void BIG_dfromBytesLen(DBIG x, char *a, int s);
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_doutput(DBIG x); 
+
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_drawoutput(DBIG x);
+
+/**	@brief Copy BIG from Read-Only Memory to a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number in ROM
+ */
+extern void BIG_rcopy(BIG x, const BIG y);
+/**	@brief Copy BIG to another BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_copy(BIG x, BIG y);
+/**	@brief Copy DBIG to another DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_dcopy(DBIG x, DBIG y);
+/**	@brief Copy BIG to upper half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dsucopy(DBIG x, BIG y);
+/**	@brief Copy BIG to lower half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dscopy(DBIG x, BIG y);
+/**	@brief Copy lower half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sdcopy(BIG x, DBIG y);
+/**	@brief Copy upper half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sducopy(BIG x, DBIG y);
+/**	@brief Set BIG to zero (Constant Time)
+ *
+	@param x BIG number to be set to zero  
+ */
+extern void BIG_zero(BIG x);
+/**	@brief Set DBIG to zero (Constant Time)
+ *
+	@param x DBIG number to be set to zero
+ */
+extern void BIG_dzero(DBIG x);
+/**	@brief Set BIG to one (unity) (Constant Time)
+ *
+	@param x BIG number to be set to one.
+ */
+extern void BIG_one(BIG x);
+/**	@brief Set BIG to inverse mod 2^256 (Constant Time)
+ *
+	@param x BIG number to be inverted
+ */
+extern void BIG_invmod2m(BIG x);
+/**	@brief Set BIG to sum of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, sum of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_add(BIG x, BIG y, BIG z);
+
+/**	@brief Set BIG to logical or of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, or of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_or(BIG x, BIG y, BIG z);
+
+/**	@brief Increment BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be incremented
+	@param i integer
+ */
+extern void BIG_inc(BIG x, int i);
+/**	@brief Set BIG to difference of two BIGs (Constant Time)
+ *
+	@param x BIG number, difference of other two - output not normalised
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_sub(BIG x, BIG y, BIG z);
+/**	@brief Decrement BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be decremented
+	@param i integer
+ */
+extern void BIG_dec(BIG x, int i);
+/**	@brief Set DBIG to sum of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, sum of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dadd(DBIG x, DBIG y, DBIG z);
+/**	@brief Set DBIG to difference of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, difference of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dsub(DBIG x, DBIG y, DBIG z);
+/**	@brief Multiply BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_imul(BIG x, BIG y, int i);
+/**	@brief Multiply BIG by not-so-small small integer - output normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+	@return Overflowing bits
+ */
+extern chunk BIG_pmul(BIG x, BIG y, int i);
+/**	@brief Divide BIG by 3 - output normalised (Constant Time)
+ *
+	@param x BIG number
+	@return Remainder
+ */
+extern int BIG_div3(BIG x);
+/**	@brief Multiply BIG by even bigger small integer resulting in a DBIG - output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_pxmul(DBIG x, BIG y, int i);
+/**	@brief Multiply BIG by another BIG resulting in DBIG - inputs normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_mul(DBIG x, BIG y, BIG z);
+/**	@brief Multiply BIG by another BIG resulting in another BIG - inputs normalised and output normalised (Constant Time)
+ *
+	Note that the product must fit into a BIG, and x must be distinct from y and z
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_smul(BIG x, BIG y, BIG z);
+/**	@brief Square BIG resulting in a DBIG - input normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, square of a BIG
+	@param y BIG number to be squared
+ */
+extern void BIG_sqr(DBIG x, BIG y);
+
+/**	@brief Montgomery reduction of a DBIG to a BIG  - input normalised and output normalised (Constant Time)
+ *
+	@param a BIG number, reduction of a BIG
+	@param md BIG number, the modulus
+	@param MC the Montgomery Constant
+	@param d DBIG number to be reduced
+ */
+extern void BIG_monty(BIG a, BIG md, chunk MC, DBIG d);
+
+/**	@brief Shifts a BIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shl(BIG x, int s);
+/**	@brief Fast shifts a BIG left by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Overflow bits
+ */
+extern int BIG_fshl(BIG x, int s);
+/**	@brief Shifts a DBIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshl(DBIG x, int s);
+/**	@brief Shifts a BIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shr(BIG x, int s);
+
+
+/**	@brief Fast time-critical combined shift by 1 bit, subtract and normalise (Constant Time)
+ *
+	@param r BIG number normalised output
+	@param a BIG number to be subtracted from
+	@param m BIG number to be shifted and subtracted
+	@return sign of r
+ */
+extern int BIG_ssn(BIG r, BIG a, BIG m);
+
+/**	@brief Fast shifts a BIG right by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Shifted out bits
+ */
+extern int BIG_fshr(BIG x, int s);
+/**	@brief Shifts a DBIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshr(DBIG x, int s);
+/**	@brief Splits a DBIG into two BIGs - input must be normalised, outputs normalised (Constant Time as used)
+ *
+	Internal function. The value of s must be approximately in the middle of the DBIG.
+	Typically used to extract z mod 2^MODBITS and z/2^MODBITS
+	@param x BIG number, top half of z
+	@param y BIG number, bottom half of z
+	@param z DBIG number to be split in two.
+	@param s Bit position at which to split
+	@return carry-out from top half
+ */
+extern chunk BIG_split(BIG x, BIG y, DBIG z, int s);
+/**	@brief Normalizes a BIG number - output normalised (Constant Time)
+ *
+	All digits of the input BIG are reduced mod 2^BASEBITS
+	@param x BIG number to be normalised
+ */
+extern chunk BIG_norm(BIG x);
+/**	@brief Normalizes a DBIG number - output normalised (Constant Time)
+ *
+	All digits of the input DBIG are reduced mod 2^BASEBITS
+	@param x DBIG number to be normalised
+ */
+extern void BIG_dnorm(DBIG x);
+/**	@brief Compares two BIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first BIG number to be compared
+	@param y second BIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_comp(BIG x, BIG y);
+/**	@brief Compares two DBIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first DBIG number to be compared
+	@param y second DBIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_dcomp(DBIG x, DBIG y);
+/**	@brief Calculate number of bits in a BIG - output normalised (Variable Time)
+ *
+	@param x BIG number
+	@return Number of bits in x
+ */
+extern int BIG_nbits(BIG x);
+/**	@brief Calculate number of bits in a DBIG - output normalised (Variable Time)
+ *
+	@param x DBIG number
+	@return Number of bits in x
+ */
+extern int BIG_dnbits(DBIG x);
+
+/**	@brief Reduce x mod n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctmod(BIG x, BIG n, int bd);
+
+/**	@brief  x=y mod n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctdmod(BIG x, DBIG y, BIG n, int bd);
+
+/**	@brief Divide x by n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctsdiv(BIG x,BIG n,int bd);
+
+/**	@brief  x=y/n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctddiv(BIG x, DBIG y, BIG n,int bd);
+
+
+/**	@brief Reduce x mod n - input and output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+ */
+extern void BIG_mod(BIG x, BIG n);
+/**	@brief Divide x by n - output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+ */
+extern void BIG_sdiv(BIG x, BIG n);
+/**	@brief  x=y mod n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_dmod(BIG x, DBIG y, BIG n);
+/**	@brief  x=y/n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_ddiv(BIG x, DBIG y, BIG n);
+/**	@brief  return parity of BIG, that is the least significant bit (Constant Time)
+ *
+	@param x BIG number
+	@return 0 or 1
+ */
+extern int BIG_parity(BIG x);
+/**	@brief  return i-th of BIG (Constant Time)
+ *
+	@param x BIG number
+	@param i the bit of x to be returned
+	@return 0 or 1
+ */
+extern int BIG_bit(BIG x, int i);
+/**	@brief  return least significant bits of a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param n number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int BIG_lastbits(BIG x, int n);
+/**	@brief  Create a random BIG from a random number generator (Constant Time)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_random(BIG x, csprng *r);
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randomnum(BIG x, BIG n, csprng *r);
+
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus and truncated to max bit length (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param t Maximum bit length
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randtrunc(BIG x, BIG n, int t, csprng *r);
+
+/**	brief  return NAF (Non-Adjacent-Form) value as +/- 1, 3 or 5, inputs must be normalised
+ *
+	Given x and 3*x extracts NAF value from given bit position, and returns number of bits processed, and number of trailing zeros detected if any
+	param x BIG number
+	param x3 BIG number, three times x
+	param i bit position
+	param nbs pointer to integer returning number of bits processed
+	param nzs pointer to integer returning number of trailing 0s
+	return + or - 1, 3 or 5
+*/
+
+/**	@brief  Calculate x=y*z mod n (Variable Time)
+ *
+	Slow method for modular multiplication
+	@param x BIG number, on exit = y*z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modmul(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y/z mod n (Variable Time)
+ *
+	Slow method for modular division
+	@param x BIG number, on exit = y/z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_moddiv(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y^2 mod n (Variable Time)
+ *
+	Slow method for modular squaring
+	@param x BIG number, on exit = y^2 mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modsqr(BIG x, BIG y, BIG n);
+/**	@brief  Calculate x=-y mod n (Variable Time)
+ *
+	Modular negation
+	@param x BIG number, on exit = -y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modneg(BIG x, BIG y, BIG n);
+
+/**	@brief  Calculate x=y+z mod n (Variable Time)
+ *
+	Slow method for modular addition
+	@param x BIG number, on exit = y+z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modadd(BIG x, BIG y, BIG z, BIG n);
+
+/**	@brief  Calculate jacobi Symbol (x/y) (Variable Time)
+ *
+	@param x BIG number
+	@param y BIG number
+	@return Jacobi symbol, -1,0 or 1
+ */
+extern int BIG_jacobi(BIG x, BIG y);
+/**	@brief  Calculate x=1/y mod n (Variable Time)
+ *
+	Modular Inversion - This is slow. Uses binary method.
+	@param x BIG number, on exit = 1/y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_invmodp(BIG x, BIG y, BIG n);
+/** @brief Calculate x=x mod 2^m (Variable Time)
+ *
+	Truncation
+	@param x BIG number, on reduced mod 2^m
+	@param m new truncated size
+*/
+extern void BIG_mod2m(BIG x, int m);
+
+/**	@brief Calculates a*b+c+*d
+ *
+	Calculate partial product of a.b, add in carry c, and add total to d (Constant Time)
+	@param a multiplier
+	@param b multiplicand
+	@param c carry
+	@param d pointer to accumulated bottom half of result
+	@return top half of result
+ */
+
+
+extern int step1(BIG,BIG,BIG);
+extern void step2(BIG,BIG,BIG);
+
+#ifdef dchunk
+
+/* Method required to calculate x*y+c+r, bottom half in r, top half returned */
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    dchunk prod = (dchunk)x * y + c + *r;
+    *r = (chunk)prod & BMASK_B168_60;
+    return (chunk)(prod >> BASEBITS_B168_60);
+}
+
+#else
+
+/* No integer type available that can store double the wordlength */
+/* accumulate partial products */
+
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    chunk x0, x1, y0, y1;
+    chunk bot, top, mid, carry;
+    x0 = x & HMASK_B168_60;
+    x1 = (x >> HBITS_B168_60);
+    y0 = y & HMASK_B168_60;
+    y1 = (y >> HBITS_B168_60);
+    bot = x0 * y0;
+    top = x1 * y1;
+    mid = x0 * y1 + x1 * y0;
+    x0 = mid & HMASK_B168_60;
+    x1 = (mid >> HBITS_B168_60);
+    bot += x0 << HBITS_B168_60;
+    bot += *r;
+    bot += c;
+
+    top += x1;
+    carry = bot >> BASEBITS_B168_60;
+    bot &= BMASK_B168_60;
+    top += carry;
+
+    *r = bot;
+    return top;
+}
+
+#endif
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/big_B256_56.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/big_B256_56.h
new file mode 100644
index 0000000..63e0e1d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/big_B256_56.h
@@ -0,0 +1,697 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file big.h
+ * @author Mike Scott
+ * @date 23rd February 2016
+ * @brief Big number Header File
+ *
+ *
+ */
+
+#ifndef BIG_B256_56_H
+#define BIG_B256_56_H
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <inttypes.h>
+#include "arch.h"
+#include "core.h"
+#include "config_big_B256_56.h"
+
+using namespace core;
+
+/* could comment this out if code size is a major issue */
+#define UNWOUND
+/* Normally recommended, but may not be optimal for some architectures, for example 32-bit ARM M4 */
+#define USE_KARATSUBA
+
+#define BIGBITS_B256_56 (8*MODBYTES_B256_56)
+#define NLEN_B256_56 (1+((8*MODBYTES_B256_56-1)/BASEBITS_B256_56))
+#define DNLEN_B256_56 2*NLEN_B256_56
+#define BMASK_B256_56 (((chunk)1<<BASEBITS_B256_56)-1) /**< Mask = 2^BASEBITS-1 */
+#define NEXCESS_B256_56 (1<<(CHUNK-BASEBITS_B256_56-1))           /**< 2^(CHUNK-BASEBITS-1) - digit cannot be multiplied by more than this before normalisation */
+
+#define HBITS_B256_56 (BASEBITS_B256_56/2)      /**< Number of bits in number base divided by 2 */
+#define HMASK_B256_56 (((chunk)1<<HBITS_B256_56)-1)    /**< Mask = 2^HBITS-1 */
+
+//#define DEBUG_NORM
+
+#ifdef DEBUG_NORM  /* Add an extra location to track chunk extension */
+#define MPV_B256_56 NLEN_B256_56
+#define MNV_B256_56 (NLEN_B256_56+1)
+#define DMPV_B256_56 DNLEN_B256_56
+#define DMNV_B256_56 (DNLEN_B256_56+1)
+
+#endif
+
+namespace B256_56 {
+
+//extern int BIGMULS;
+//extern int BIGSQRS;
+
+#ifdef DEBUG_NORM
+typedef chunk BIG[NLEN_B256_56 + 2]; /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B256_56 + 2]; /**< Define type DBIG as array of chunks */
+#else
+typedef chunk BIG[NLEN_B256_56];     /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B256_56];   /**< Define type DBIG as array of chunks */
+#endif
+
+/* BIG number prototypes */
+
+/**	@brief Tests for BIG equal to zero (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_iszilch(BIG x);
+/**	@brief Tests for BIG equal to one (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if one, else returns 0
+ */
+extern int BIG_isunity(BIG x);
+/**	@brief Tests for DBIG equal to zero (Constant Time)
+ *
+	@param x a DBIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_diszilch(DBIG x);
+/**	@brief Outputs a BIG number to the console (Variable Time)
+ *
+	@param x a BIG number
+ */
+extern void BIG_output(BIG x);
+/**	@brief Outputs a BIG number to the console in raw form (Variable Time for debugging)
+ *
+	@param x a BIG number
+ */
+extern void BIG_rawoutput(BIG x);
+/**	@brief Conditional constant time swap of two BIG numbers
+ *
+	Conditionally swaps parameters in constant time (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s swap takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cswap(BIG x, BIG y, int s);
+/**	@brief Conditional copy of BIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cmove(BIG x, BIG y, int s);
+/**	@brief Conditional copy of DBIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a DBIG number
+	@param y another DBIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_dcmove(BIG x, BIG y, int s);
+/**	@brief Convert from BIG number to byte array (Constant Time)
+ *
+	@param a byte array
+	@param x BIG number
+ */
+extern void BIG_toBytes(char *a, BIG x);
+/**	@brief Convert to BIG number from byte array (Constant Time)
+ *
+	@param x BIG number
+	@param a byte array
+ */
+extern void BIG_fromBytes(BIG x, char *a);
+/**	@brief Convert to BIG number from byte array of given length (Variable Time)
+ *
+	@param x BIG number
+	@param a byte array
+	@param s byte array length
+ */
+extern void BIG_fromBytesLen(BIG x, char *a, int s);
+/**@brief Convert to DBIG number from byte array of given length (Variable Time)
+ *
+   @param x DBIG number
+   @param a byte array
+   @param s byte array length
+ */
+extern void BIG_dfromBytesLen(DBIG x, char *a, int s);
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_doutput(DBIG x); 
+
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_drawoutput(DBIG x);
+
+/**	@brief Copy BIG from Read-Only Memory to a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number in ROM
+ */
+extern void BIG_rcopy(BIG x, const BIG y);
+/**	@brief Copy BIG to another BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_copy(BIG x, BIG y);
+/**	@brief Copy DBIG to another DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_dcopy(DBIG x, DBIG y);
+/**	@brief Copy BIG to upper half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dsucopy(DBIG x, BIG y);
+/**	@brief Copy BIG to lower half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dscopy(DBIG x, BIG y);
+/**	@brief Copy lower half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sdcopy(BIG x, DBIG y);
+/**	@brief Copy upper half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sducopy(BIG x, DBIG y);
+/**	@brief Set BIG to zero (Constant Time)
+ *
+	@param x BIG number to be set to zero  
+ */
+extern void BIG_zero(BIG x);
+/**	@brief Set DBIG to zero (Constant Time)
+ *
+	@param x DBIG number to be set to zero
+ */
+extern void BIG_dzero(DBIG x);
+/**	@brief Set BIG to one (unity) (Constant Time)
+ *
+	@param x BIG number to be set to one.
+ */
+extern void BIG_one(BIG x);
+/**	@brief Set BIG to inverse mod 2^256 (Constant Time)
+ *
+	@param x BIG number to be inverted
+ */
+extern void BIG_invmod2m(BIG x);
+/**	@brief Set BIG to sum of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, sum of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_add(BIG x, BIG y, BIG z);
+
+/**	@brief Set BIG to logical or of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, or of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_or(BIG x, BIG y, BIG z);
+
+/**	@brief Increment BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be incremented
+	@param i integer
+ */
+extern void BIG_inc(BIG x, int i);
+/**	@brief Set BIG to difference of two BIGs (Constant Time)
+ *
+	@param x BIG number, difference of other two - output not normalised
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_sub(BIG x, BIG y, BIG z);
+/**	@brief Decrement BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be decremented
+	@param i integer
+ */
+extern void BIG_dec(BIG x, int i);
+/**	@brief Set DBIG to sum of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, sum of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dadd(DBIG x, DBIG y, DBIG z);
+/**	@brief Set DBIG to difference of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, difference of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dsub(DBIG x, DBIG y, DBIG z);
+/**	@brief Multiply BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_imul(BIG x, BIG y, int i);
+/**	@brief Multiply BIG by not-so-small small integer - output normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+	@return Overflowing bits
+ */
+extern chunk BIG_pmul(BIG x, BIG y, int i);
+/**	@brief Divide BIG by 3 - output normalised (Constant Time)
+ *
+	@param x BIG number
+	@return Remainder
+ */
+extern int BIG_div3(BIG x);
+/**	@brief Multiply BIG by even bigger small integer resulting in a DBIG - output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_pxmul(DBIG x, BIG y, int i);
+/**	@brief Multiply BIG by another BIG resulting in DBIG - inputs normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_mul(DBIG x, BIG y, BIG z);
+/**	@brief Multiply BIG by another BIG resulting in another BIG - inputs normalised and output normalised (Constant Time)
+ *
+	Note that the product must fit into a BIG, and x must be distinct from y and z
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_smul(BIG x, BIG y, BIG z);
+/**	@brief Square BIG resulting in a DBIG - input normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, square of a BIG
+	@param y BIG number to be squared
+ */
+extern void BIG_sqr(DBIG x, BIG y);
+
+/**	@brief Montgomery reduction of a DBIG to a BIG  - input normalised and output normalised (Constant Time)
+ *
+	@param a BIG number, reduction of a BIG
+	@param md BIG number, the modulus
+	@param MC the Montgomery Constant
+	@param d DBIG number to be reduced
+ */
+extern void BIG_monty(BIG a, BIG md, chunk MC, DBIG d);
+
+/**	@brief Shifts a BIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shl(BIG x, int s);
+/**	@brief Fast shifts a BIG left by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Overflow bits
+ */
+extern int BIG_fshl(BIG x, int s);
+/**	@brief Shifts a DBIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshl(DBIG x, int s);
+/**	@brief Shifts a BIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shr(BIG x, int s);
+
+
+/**	@brief Fast time-critical combined shift by 1 bit, subtract and normalise (Constant Time)
+ *
+	@param r BIG number normalised output
+	@param a BIG number to be subtracted from
+	@param m BIG number to be shifted and subtracted
+	@return sign of r
+ */
+extern int BIG_ssn(BIG r, BIG a, BIG m);
+
+/**	@brief Fast shifts a BIG right by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Shifted out bits
+ */
+extern int BIG_fshr(BIG x, int s);
+/**	@brief Shifts a DBIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshr(DBIG x, int s);
+/**	@brief Splits a DBIG into two BIGs - input must be normalised, outputs normalised (Constant Time as used)
+ *
+	Internal function. The value of s must be approximately in the middle of the DBIG.
+	Typically used to extract z mod 2^MODBITS and z/2^MODBITS
+	@param x BIG number, top half of z
+	@param y BIG number, bottom half of z
+	@param z DBIG number to be split in two.
+	@param s Bit position at which to split
+	@return carry-out from top half
+ */
+extern chunk BIG_split(BIG x, BIG y, DBIG z, int s);
+/**	@brief Normalizes a BIG number - output normalised (Constant Time)
+ *
+	All digits of the input BIG are reduced mod 2^BASEBITS
+	@param x BIG number to be normalised
+ */
+extern chunk BIG_norm(BIG x);
+/**	@brief Normalizes a DBIG number - output normalised (Constant Time)
+ *
+	All digits of the input DBIG are reduced mod 2^BASEBITS
+	@param x DBIG number to be normalised
+ */
+extern void BIG_dnorm(DBIG x);
+/**	@brief Compares two BIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first BIG number to be compared
+	@param y second BIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_comp(BIG x, BIG y);
+/**	@brief Compares two DBIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first DBIG number to be compared
+	@param y second DBIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_dcomp(DBIG x, DBIG y);
+/**	@brief Calculate number of bits in a BIG - output normalised (Variable Time)
+ *
+	@param x BIG number
+	@return Number of bits in x
+ */
+extern int BIG_nbits(BIG x);
+/**	@brief Calculate number of bits in a DBIG - output normalised (Variable Time)
+ *
+	@param x DBIG number
+	@return Number of bits in x
+ */
+extern int BIG_dnbits(DBIG x);
+
+/**	@brief Reduce x mod n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctmod(BIG x, BIG n, int bd);
+
+/**	@brief  x=y mod n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctdmod(BIG x, DBIG y, BIG n, int bd);
+
+/**	@brief Divide x by n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctsdiv(BIG x,BIG n,int bd);
+
+/**	@brief  x=y/n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctddiv(BIG x, DBIG y, BIG n,int bd);
+
+
+/**	@brief Reduce x mod n - input and output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+ */
+extern void BIG_mod(BIG x, BIG n);
+/**	@brief Divide x by n - output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+ */
+extern void BIG_sdiv(BIG x, BIG n);
+/**	@brief  x=y mod n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_dmod(BIG x, DBIG y, BIG n);
+/**	@brief  x=y/n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_ddiv(BIG x, DBIG y, BIG n);
+/**	@brief  return parity of BIG, that is the least significant bit (Constant Time)
+ *
+	@param x BIG number
+	@return 0 or 1
+ */
+extern int BIG_parity(BIG x);
+/**	@brief  return i-th of BIG (Constant Time)
+ *
+	@param x BIG number
+	@param i the bit of x to be returned
+	@return 0 or 1
+ */
+extern int BIG_bit(BIG x, int i);
+/**	@brief  return least significant bits of a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param n number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int BIG_lastbits(BIG x, int n);
+/**	@brief  Create a random BIG from a random number generator (Constant Time)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_random(BIG x, csprng *r);
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randomnum(BIG x, BIG n, csprng *r);
+
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus and truncated to max bit length (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param t Maximum bit length
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randtrunc(BIG x, BIG n, int t, csprng *r);
+
+/**	brief  return NAF (Non-Adjacent-Form) value as +/- 1, 3 or 5, inputs must be normalised
+ *
+	Given x and 3*x extracts NAF value from given bit position, and returns number of bits processed, and number of trailing zeros detected if any
+	param x BIG number
+	param x3 BIG number, three times x
+	param i bit position
+	param nbs pointer to integer returning number of bits processed
+	param nzs pointer to integer returning number of trailing 0s
+	return + or - 1, 3 or 5
+*/
+
+/**	@brief  Calculate x=y*z mod n (Variable Time)
+ *
+	Slow method for modular multiplication
+	@param x BIG number, on exit = y*z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modmul(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y/z mod n (Variable Time)
+ *
+	Slow method for modular division
+	@param x BIG number, on exit = y/z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_moddiv(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y^2 mod n (Variable Time)
+ *
+	Slow method for modular squaring
+	@param x BIG number, on exit = y^2 mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modsqr(BIG x, BIG y, BIG n);
+/**	@brief  Calculate x=-y mod n (Variable Time)
+ *
+	Modular negation
+	@param x BIG number, on exit = -y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modneg(BIG x, BIG y, BIG n);
+
+/**	@brief  Calculate x=y+z mod n (Variable Time)
+ *
+	Slow method for modular addition
+	@param x BIG number, on exit = y+z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modadd(BIG x, BIG y, BIG z, BIG n);
+
+/**	@brief  Calculate jacobi Symbol (x/y) (Variable Time)
+ *
+	@param x BIG number
+	@param y BIG number
+	@return Jacobi symbol, -1,0 or 1
+ */
+extern int BIG_jacobi(BIG x, BIG y);
+/**	@brief  Calculate x=1/y mod n (Variable Time)
+ *
+	Modular Inversion - This is slow. Uses binary method.
+	@param x BIG number, on exit = 1/y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_invmodp(BIG x, BIG y, BIG n);
+/** @brief Calculate x=x mod 2^m (Variable Time)
+ *
+	Truncation
+	@param x BIG number, on reduced mod 2^m
+	@param m new truncated size
+*/
+extern void BIG_mod2m(BIG x, int m);
+
+/**	@brief Calculates a*b+c+*d
+ *
+	Calculate partial product of a.b, add in carry c, and add total to d (Constant Time)
+	@param a multiplier
+	@param b multiplicand
+	@param c carry
+	@param d pointer to accumulated bottom half of result
+	@return top half of result
+ */
+
+
+extern int step1(BIG,BIG,BIG);
+extern void step2(BIG,BIG,BIG);
+
+#ifdef dchunk
+
+/* Method required to calculate x*y+c+r, bottom half in r, top half returned */
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    dchunk prod = (dchunk)x * y + c + *r;
+    *r = (chunk)prod & BMASK_B256_56;
+    return (chunk)(prod >> BASEBITS_B256_56);
+}
+
+#else
+
+/* No integer type available that can store double the wordlength */
+/* accumulate partial products */
+
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    chunk x0, x1, y0, y1;
+    chunk bot, top, mid, carry;
+    x0 = x & HMASK_B256_56;
+    x1 = (x >> HBITS_B256_56);
+    y0 = y & HMASK_B256_56;
+    y1 = (y >> HBITS_B256_56);
+    bot = x0 * y0;
+    top = x1 * y1;
+    mid = x0 * y1 + x1 * y0;
+    x0 = mid & HMASK_B256_56;
+    x1 = (mid >> HBITS_B256_56);
+    bot += x0 << HBITS_B256_56;
+    bot += *r;
+    bot += c;
+
+    top += x1;
+    carry = bot >> BASEBITS_B256_56;
+    bot &= BMASK_B256_56;
+    top += carry;
+
+    *r = bot;
+    return top;
+}
+
+#endif
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/big_B288_60.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/big_B288_60.h
new file mode 100644
index 0000000..991383b
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/big_B288_60.h
@@ -0,0 +1,697 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file big.h
+ * @author Mike Scott
+ * @date 23rd February 2016
+ * @brief Big number Header File
+ *
+ *
+ */
+
+#ifndef BIG_B288_60_H
+#define BIG_B288_60_H
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <inttypes.h>
+#include "arch.h"
+#include "core.h"
+#include "config_big_B288_60.h"
+
+using namespace core;
+
+/* could comment this out if code size is a major issue */
+#define UNWOUND
+/* Normally recommended, but may not be optimal for some architectures, for example 32-bit ARM M4 */
+#define USE_KARATSUBA
+
+#define BIGBITS_B288_60 (8*MODBYTES_B288_60)
+#define NLEN_B288_60 (1+((8*MODBYTES_B288_60-1)/BASEBITS_B288_60))
+#define DNLEN_B288_60 2*NLEN_B288_60
+#define BMASK_B288_60 (((chunk)1<<BASEBITS_B288_60)-1) /**< Mask = 2^BASEBITS-1 */
+#define NEXCESS_B288_60 (1<<(CHUNK-BASEBITS_B288_60-1))           /**< 2^(CHUNK-BASEBITS-1) - digit cannot be multiplied by more than this before normalisation */
+
+#define HBITS_B288_60 (BASEBITS_B288_60/2)      /**< Number of bits in number base divided by 2 */
+#define HMASK_B288_60 (((chunk)1<<HBITS_B288_60)-1)    /**< Mask = 2^HBITS-1 */
+
+//#define DEBUG_NORM
+
+#ifdef DEBUG_NORM  /* Add an extra location to track chunk extension */
+#define MPV_B288_60 NLEN_B288_60
+#define MNV_B288_60 (NLEN_B288_60+1)
+#define DMPV_B288_60 DNLEN_B288_60
+#define DMNV_B288_60 (DNLEN_B288_60+1)
+
+#endif
+
+namespace B288_60 {
+
+//extern int BIGMULS;
+//extern int BIGSQRS;
+
+#ifdef DEBUG_NORM
+typedef chunk BIG[NLEN_B288_60 + 2]; /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B288_60 + 2]; /**< Define type DBIG as array of chunks */
+#else
+typedef chunk BIG[NLEN_B288_60];     /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B288_60];   /**< Define type DBIG as array of chunks */
+#endif
+
+/* BIG number prototypes */
+
+/**	@brief Tests for BIG equal to zero (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_iszilch(BIG x);
+/**	@brief Tests for BIG equal to one (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if one, else returns 0
+ */
+extern int BIG_isunity(BIG x);
+/**	@brief Tests for DBIG equal to zero (Constant Time)
+ *
+	@param x a DBIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_diszilch(DBIG x);
+/**	@brief Outputs a BIG number to the console (Variable Time)
+ *
+	@param x a BIG number
+ */
+extern void BIG_output(BIG x);
+/**	@brief Outputs a BIG number to the console in raw form (Variable Time for debugging)
+ *
+	@param x a BIG number
+ */
+extern void BIG_rawoutput(BIG x);
+/**	@brief Conditional constant time swap of two BIG numbers
+ *
+	Conditionally swaps parameters in constant time (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s swap takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cswap(BIG x, BIG y, int s);
+/**	@brief Conditional copy of BIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cmove(BIG x, BIG y, int s);
+/**	@brief Conditional copy of DBIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a DBIG number
+	@param y another DBIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_dcmove(BIG x, BIG y, int s);
+/**	@brief Convert from BIG number to byte array (Constant Time)
+ *
+	@param a byte array
+	@param x BIG number
+ */
+extern void BIG_toBytes(char *a, BIG x);
+/**	@brief Convert to BIG number from byte array (Constant Time)
+ *
+	@param x BIG number
+	@param a byte array
+ */
+extern void BIG_fromBytes(BIG x, char *a);
+/**	@brief Convert to BIG number from byte array of given length (Variable Time)
+ *
+	@param x BIG number
+	@param a byte array
+	@param s byte array length
+ */
+extern void BIG_fromBytesLen(BIG x, char *a, int s);
+/**@brief Convert to DBIG number from byte array of given length (Variable Time)
+ *
+   @param x DBIG number
+   @param a byte array
+   @param s byte array length
+ */
+extern void BIG_dfromBytesLen(DBIG x, char *a, int s);
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_doutput(DBIG x); 
+
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_drawoutput(DBIG x);
+
+/**	@brief Copy BIG from Read-Only Memory to a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number in ROM
+ */
+extern void BIG_rcopy(BIG x, const BIG y);
+/**	@brief Copy BIG to another BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_copy(BIG x, BIG y);
+/**	@brief Copy DBIG to another DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_dcopy(DBIG x, DBIG y);
+/**	@brief Copy BIG to upper half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dsucopy(DBIG x, BIG y);
+/**	@brief Copy BIG to lower half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dscopy(DBIG x, BIG y);
+/**	@brief Copy lower half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sdcopy(BIG x, DBIG y);
+/**	@brief Copy upper half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sducopy(BIG x, DBIG y);
+/**	@brief Set BIG to zero (Constant Time)
+ *
+	@param x BIG number to be set to zero  
+ */
+extern void BIG_zero(BIG x);
+/**	@brief Set DBIG to zero (Constant Time)
+ *
+	@param x DBIG number to be set to zero
+ */
+extern void BIG_dzero(DBIG x);
+/**	@brief Set BIG to one (unity) (Constant Time)
+ *
+	@param x BIG number to be set to one.
+ */
+extern void BIG_one(BIG x);
+/**	@brief Set BIG to inverse mod 2^256 (Constant Time)
+ *
+	@param x BIG number to be inverted
+ */
+extern void BIG_invmod2m(BIG x);
+/**	@brief Set BIG to sum of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, sum of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_add(BIG x, BIG y, BIG z);
+
+/**	@brief Set BIG to logical or of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, or of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_or(BIG x, BIG y, BIG z);
+
+/**	@brief Increment BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be incremented
+	@param i integer
+ */
+extern void BIG_inc(BIG x, int i);
+/**	@brief Set BIG to difference of two BIGs (Constant Time)
+ *
+	@param x BIG number, difference of other two - output not normalised
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_sub(BIG x, BIG y, BIG z);
+/**	@brief Decrement BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be decremented
+	@param i integer
+ */
+extern void BIG_dec(BIG x, int i);
+/**	@brief Set DBIG to sum of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, sum of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dadd(DBIG x, DBIG y, DBIG z);
+/**	@brief Set DBIG to difference of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, difference of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dsub(DBIG x, DBIG y, DBIG z);
+/**	@brief Multiply BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_imul(BIG x, BIG y, int i);
+/**	@brief Multiply BIG by not-so-small small integer - output normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+	@return Overflowing bits
+ */
+extern chunk BIG_pmul(BIG x, BIG y, int i);
+/**	@brief Divide BIG by 3 - output normalised (Constant Time)
+ *
+	@param x BIG number
+	@return Remainder
+ */
+extern int BIG_div3(BIG x);
+/**	@brief Multiply BIG by even bigger small integer resulting in a DBIG - output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_pxmul(DBIG x, BIG y, int i);
+/**	@brief Multiply BIG by another BIG resulting in DBIG - inputs normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_mul(DBIG x, BIG y, BIG z);
+/**	@brief Multiply BIG by another BIG resulting in another BIG - inputs normalised and output normalised (Constant Time)
+ *
+	Note that the product must fit into a BIG, and x must be distinct from y and z
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_smul(BIG x, BIG y, BIG z);
+/**	@brief Square BIG resulting in a DBIG - input normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, square of a BIG
+	@param y BIG number to be squared
+ */
+extern void BIG_sqr(DBIG x, BIG y);
+
+/**	@brief Montgomery reduction of a DBIG to a BIG  - input normalised and output normalised (Constant Time)
+ *
+	@param a BIG number, reduction of a BIG
+	@param md BIG number, the modulus
+	@param MC the Montgomery Constant
+	@param d DBIG number to be reduced
+ */
+extern void BIG_monty(BIG a, BIG md, chunk MC, DBIG d);
+
+/**	@brief Shifts a BIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shl(BIG x, int s);
+/**	@brief Fast shifts a BIG left by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Overflow bits
+ */
+extern int BIG_fshl(BIG x, int s);
+/**	@brief Shifts a DBIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshl(DBIG x, int s);
+/**	@brief Shifts a BIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shr(BIG x, int s);
+
+
+/**	@brief Fast time-critical combined shift by 1 bit, subtract and normalise (Constant Time)
+ *
+	@param r BIG number normalised output
+	@param a BIG number to be subtracted from
+	@param m BIG number to be shifted and subtracted
+	@return sign of r
+ */
+extern int BIG_ssn(BIG r, BIG a, BIG m);
+
+/**	@brief Fast shifts a BIG right by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Shifted out bits
+ */
+extern int BIG_fshr(BIG x, int s);
+/**	@brief Shifts a DBIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshr(DBIG x, int s);
+/**	@brief Splits a DBIG into two BIGs - input must be normalised, outputs normalised (Constant Time as used)
+ *
+	Internal function. The value of s must be approximately in the middle of the DBIG.
+	Typically used to extract z mod 2^MODBITS and z/2^MODBITS
+	@param x BIG number, top half of z
+	@param y BIG number, bottom half of z
+	@param z DBIG number to be split in two.
+	@param s Bit position at which to split
+	@return carry-out from top half
+ */
+extern chunk BIG_split(BIG x, BIG y, DBIG z, int s);
+/**	@brief Normalizes a BIG number - output normalised (Constant Time)
+ *
+	All digits of the input BIG are reduced mod 2^BASEBITS
+	@param x BIG number to be normalised
+ */
+extern chunk BIG_norm(BIG x);
+/**	@brief Normalizes a DBIG number - output normalised (Constant Time)
+ *
+	All digits of the input DBIG are reduced mod 2^BASEBITS
+	@param x DBIG number to be normalised
+ */
+extern void BIG_dnorm(DBIG x);
+/**	@brief Compares two BIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first BIG number to be compared
+	@param y second BIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_comp(BIG x, BIG y);
+/**	@brief Compares two DBIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first DBIG number to be compared
+	@param y second DBIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_dcomp(DBIG x, DBIG y);
+/**	@brief Calculate number of bits in a BIG - output normalised (Variable Time)
+ *
+	@param x BIG number
+	@return Number of bits in x
+ */
+extern int BIG_nbits(BIG x);
+/**	@brief Calculate number of bits in a DBIG - output normalised (Variable Time)
+ *
+	@param x DBIG number
+	@return Number of bits in x
+ */
+extern int BIG_dnbits(DBIG x);
+
+/**	@brief Reduce x mod n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctmod(BIG x, BIG n, int bd);
+
+/**	@brief  x=y mod n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctdmod(BIG x, DBIG y, BIG n, int bd);
+
+/**	@brief Divide x by n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctsdiv(BIG x,BIG n,int bd);
+
+/**	@brief  x=y/n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctddiv(BIG x, DBIG y, BIG n,int bd);
+
+
+/**	@brief Reduce x mod n - input and output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+ */
+extern void BIG_mod(BIG x, BIG n);
+/**	@brief Divide x by n - output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+ */
+extern void BIG_sdiv(BIG x, BIG n);
+/**	@brief  x=y mod n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_dmod(BIG x, DBIG y, BIG n);
+/**	@brief  x=y/n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_ddiv(BIG x, DBIG y, BIG n);
+/**	@brief  return parity of BIG, that is the least significant bit (Constant Time)
+ *
+	@param x BIG number
+	@return 0 or 1
+ */
+extern int BIG_parity(BIG x);
+/**	@brief  return i-th of BIG (Constant Time)
+ *
+	@param x BIG number
+	@param i the bit of x to be returned
+	@return 0 or 1
+ */
+extern int BIG_bit(BIG x, int i);
+/**	@brief  return least significant bits of a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param n number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int BIG_lastbits(BIG x, int n);
+/**	@brief  Create a random BIG from a random number generator (Constant Time)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_random(BIG x, csprng *r);
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randomnum(BIG x, BIG n, csprng *r);
+
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus and truncated to max bit length (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param t Maximum bit length
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randtrunc(BIG x, BIG n, int t, csprng *r);
+
+/**	brief  return NAF (Non-Adjacent-Form) value as +/- 1, 3 or 5, inputs must be normalised
+ *
+	Given x and 3*x extracts NAF value from given bit position, and returns number of bits processed, and number of trailing zeros detected if any
+	param x BIG number
+	param x3 BIG number, three times x
+	param i bit position
+	param nbs pointer to integer returning number of bits processed
+	param nzs pointer to integer returning number of trailing 0s
+	return + or - 1, 3 or 5
+*/
+
+/**	@brief  Calculate x=y*z mod n (Variable Time)
+ *
+	Slow method for modular multiplication
+	@param x BIG number, on exit = y*z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modmul(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y/z mod n (Variable Time)
+ *
+	Slow method for modular division
+	@param x BIG number, on exit = y/z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_moddiv(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y^2 mod n (Variable Time)
+ *
+	Slow method for modular squaring
+	@param x BIG number, on exit = y^2 mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modsqr(BIG x, BIG y, BIG n);
+/**	@brief  Calculate x=-y mod n (Variable Time)
+ *
+	Modular negation
+	@param x BIG number, on exit = -y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modneg(BIG x, BIG y, BIG n);
+
+/**	@brief  Calculate x=y+z mod n (Variable Time)
+ *
+	Slow method for modular addition
+	@param x BIG number, on exit = y+z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modadd(BIG x, BIG y, BIG z, BIG n);
+
+/**	@brief  Calculate jacobi Symbol (x/y) (Variable Time)
+ *
+	@param x BIG number
+	@param y BIG number
+	@return Jacobi symbol, -1,0 or 1
+ */
+extern int BIG_jacobi(BIG x, BIG y);
+/**	@brief  Calculate x=1/y mod n (Variable Time)
+ *
+	Modular Inversion - This is slow. Uses binary method.
+	@param x BIG number, on exit = 1/y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_invmodp(BIG x, BIG y, BIG n);
+/** @brief Calculate x=x mod 2^m (Variable Time)
+ *
+	Truncation
+	@param x BIG number, on reduced mod 2^m
+	@param m new truncated size
+*/
+extern void BIG_mod2m(BIG x, int m);
+
+/**	@brief Calculates a*b+c+*d
+ *
+	Calculate partial product of a.b, add in carry c, and add total to d (Constant Time)
+	@param a multiplier
+	@param b multiplicand
+	@param c carry
+	@param d pointer to accumulated bottom half of result
+	@return top half of result
+ */
+
+
+extern int step1(BIG,BIG,BIG);
+extern void step2(BIG,BIG,BIG);
+
+#ifdef dchunk
+
+/* Method required to calculate x*y+c+r, bottom half in r, top half returned */
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    dchunk prod = (dchunk)x * y + c + *r;
+    *r = (chunk)prod & BMASK_B288_60;
+    return (chunk)(prod >> BASEBITS_B288_60);
+}
+
+#else
+
+/* No integer type available that can store double the wordlength */
+/* accumulate partial products */
+
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    chunk x0, x1, y0, y1;
+    chunk bot, top, mid, carry;
+    x0 = x & HMASK_B288_60;
+    x1 = (x >> HBITS_B288_60);
+    y0 = y & HMASK_B288_60;
+    y1 = (y >> HBITS_B288_60);
+    bot = x0 * y0;
+    top = x1 * y1;
+    mid = x0 * y1 + x1 * y0;
+    x0 = mid & HMASK_B288_60;
+    x1 = (mid >> HBITS_B288_60);
+    bot += x0 << HBITS_B288_60;
+    bot += *r;
+    bot += c;
+
+    top += x1;
+    carry = bot >> BASEBITS_B288_60;
+    bot &= BMASK_B288_60;
+    top += carry;
+
+    *r = bot;
+    return top;
+}
+
+#endif
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/big_B336_60.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/big_B336_60.h
new file mode 100644
index 0000000..1072096
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/big_B336_60.h
@@ -0,0 +1,697 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file big.h
+ * @author Mike Scott
+ * @date 23rd February 2016
+ * @brief Big number Header File
+ *
+ *
+ */
+
+#ifndef BIG_B336_60_H
+#define BIG_B336_60_H
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <inttypes.h>
+#include "arch.h"
+#include "core.h"
+#include "config_big_B336_60.h"
+
+using namespace core;
+
+/* could comment this out if code size is a major issue */
+#define UNWOUND
+/* Normally recommended, but may not be optimal for some architectures, for example 32-bit ARM M4 */
+#define USE_KARATSUBA
+
+#define BIGBITS_B336_60 (8*MODBYTES_B336_60)
+#define NLEN_B336_60 (1+((8*MODBYTES_B336_60-1)/BASEBITS_B336_60))
+#define DNLEN_B336_60 2*NLEN_B336_60
+#define BMASK_B336_60 (((chunk)1<<BASEBITS_B336_60)-1) /**< Mask = 2^BASEBITS-1 */
+#define NEXCESS_B336_60 (1<<(CHUNK-BASEBITS_B336_60-1))           /**< 2^(CHUNK-BASEBITS-1) - digit cannot be multiplied by more than this before normalisation */
+
+#define HBITS_B336_60 (BASEBITS_B336_60/2)      /**< Number of bits in number base divided by 2 */
+#define HMASK_B336_60 (((chunk)1<<HBITS_B336_60)-1)    /**< Mask = 2^HBITS-1 */
+
+//#define DEBUG_NORM
+
+#ifdef DEBUG_NORM  /* Add an extra location to track chunk extension */
+#define MPV_B336_60 NLEN_B336_60
+#define MNV_B336_60 (NLEN_B336_60+1)
+#define DMPV_B336_60 DNLEN_B336_60
+#define DMNV_B336_60 (DNLEN_B336_60+1)
+
+#endif
+
+namespace B336_60 {
+
+//extern int BIGMULS;
+//extern int BIGSQRS;
+
+#ifdef DEBUG_NORM
+typedef chunk BIG[NLEN_B336_60 + 2]; /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B336_60 + 2]; /**< Define type DBIG as array of chunks */
+#else
+typedef chunk BIG[NLEN_B336_60];     /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B336_60];   /**< Define type DBIG as array of chunks */
+#endif
+
+/* BIG number prototypes */
+
+/**	@brief Tests for BIG equal to zero (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_iszilch(BIG x);
+/**	@brief Tests for BIG equal to one (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if one, else returns 0
+ */
+extern int BIG_isunity(BIG x);
+/**	@brief Tests for DBIG equal to zero (Constant Time)
+ *
+	@param x a DBIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_diszilch(DBIG x);
+/**	@brief Outputs a BIG number to the console (Variable Time)
+ *
+	@param x a BIG number
+ */
+extern void BIG_output(BIG x);
+/**	@brief Outputs a BIG number to the console in raw form (Variable Time for debugging)
+ *
+	@param x a BIG number
+ */
+extern void BIG_rawoutput(BIG x);
+/**	@brief Conditional constant time swap of two BIG numbers
+ *
+	Conditionally swaps parameters in constant time (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s swap takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cswap(BIG x, BIG y, int s);
+/**	@brief Conditional copy of BIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cmove(BIG x, BIG y, int s);
+/**	@brief Conditional copy of DBIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a DBIG number
+	@param y another DBIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_dcmove(BIG x, BIG y, int s);
+/**	@brief Convert from BIG number to byte array (Constant Time)
+ *
+	@param a byte array
+	@param x BIG number
+ */
+extern void BIG_toBytes(char *a, BIG x);
+/**	@brief Convert to BIG number from byte array (Constant Time)
+ *
+	@param x BIG number
+	@param a byte array
+ */
+extern void BIG_fromBytes(BIG x, char *a);
+/**	@brief Convert to BIG number from byte array of given length (Variable Time)
+ *
+	@param x BIG number
+	@param a byte array
+	@param s byte array length
+ */
+extern void BIG_fromBytesLen(BIG x, char *a, int s);
+/**@brief Convert to DBIG number from byte array of given length (Variable Time)
+ *
+   @param x DBIG number
+   @param a byte array
+   @param s byte array length
+ */
+extern void BIG_dfromBytesLen(DBIG x, char *a, int s);
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_doutput(DBIG x); 
+
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_drawoutput(DBIG x);
+
+/**	@brief Copy BIG from Read-Only Memory to a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number in ROM
+ */
+extern void BIG_rcopy(BIG x, const BIG y);
+/**	@brief Copy BIG to another BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_copy(BIG x, BIG y);
+/**	@brief Copy DBIG to another DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_dcopy(DBIG x, DBIG y);
+/**	@brief Copy BIG to upper half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dsucopy(DBIG x, BIG y);
+/**	@brief Copy BIG to lower half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dscopy(DBIG x, BIG y);
+/**	@brief Copy lower half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sdcopy(BIG x, DBIG y);
+/**	@brief Copy upper half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sducopy(BIG x, DBIG y);
+/**	@brief Set BIG to zero (Constant Time)
+ *
+	@param x BIG number to be set to zero  
+ */
+extern void BIG_zero(BIG x);
+/**	@brief Set DBIG to zero (Constant Time)
+ *
+	@param x DBIG number to be set to zero
+ */
+extern void BIG_dzero(DBIG x);
+/**	@brief Set BIG to one (unity) (Constant Time)
+ *
+	@param x BIG number to be set to one.
+ */
+extern void BIG_one(BIG x);
+/**	@brief Set BIG to inverse mod 2^256 (Constant Time)
+ *
+	@param x BIG number to be inverted
+ */
+extern void BIG_invmod2m(BIG x);
+/**	@brief Set BIG to sum of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, sum of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_add(BIG x, BIG y, BIG z);
+
+/**	@brief Set BIG to logical or of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, or of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_or(BIG x, BIG y, BIG z);
+
+/**	@brief Increment BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be incremented
+	@param i integer
+ */
+extern void BIG_inc(BIG x, int i);
+/**	@brief Set BIG to difference of two BIGs (Constant Time)
+ *
+	@param x BIG number, difference of other two - output not normalised
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_sub(BIG x, BIG y, BIG z);
+/**	@brief Decrement BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be decremented
+	@param i integer
+ */
+extern void BIG_dec(BIG x, int i);
+/**	@brief Set DBIG to sum of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, sum of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dadd(DBIG x, DBIG y, DBIG z);
+/**	@brief Set DBIG to difference of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, difference of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dsub(DBIG x, DBIG y, DBIG z);
+/**	@brief Multiply BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_imul(BIG x, BIG y, int i);
+/**	@brief Multiply BIG by not-so-small small integer - output normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+	@return Overflowing bits
+ */
+extern chunk BIG_pmul(BIG x, BIG y, int i);
+/**	@brief Divide BIG by 3 - output normalised (Constant Time)
+ *
+	@param x BIG number
+	@return Remainder
+ */
+extern int BIG_div3(BIG x);
+/**	@brief Multiply BIG by even bigger small integer resulting in a DBIG - output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_pxmul(DBIG x, BIG y, int i);
+/**	@brief Multiply BIG by another BIG resulting in DBIG - inputs normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_mul(DBIG x, BIG y, BIG z);
+/**	@brief Multiply BIG by another BIG resulting in another BIG - inputs normalised and output normalised (Constant Time)
+ *
+	Note that the product must fit into a BIG, and x must be distinct from y and z
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_smul(BIG x, BIG y, BIG z);
+/**	@brief Square BIG resulting in a DBIG - input normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, square of a BIG
+	@param y BIG number to be squared
+ */
+extern void BIG_sqr(DBIG x, BIG y);
+
+/**	@brief Montgomery reduction of a DBIG to a BIG  - input normalised and output normalised (Constant Time)
+ *
+	@param a BIG number, reduction of a BIG
+	@param md BIG number, the modulus
+	@param MC the Montgomery Constant
+	@param d DBIG number to be reduced
+ */
+extern void BIG_monty(BIG a, BIG md, chunk MC, DBIG d);
+
+/**	@brief Shifts a BIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shl(BIG x, int s);
+/**	@brief Fast shifts a BIG left by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Overflow bits
+ */
+extern int BIG_fshl(BIG x, int s);
+/**	@brief Shifts a DBIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshl(DBIG x, int s);
+/**	@brief Shifts a BIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shr(BIG x, int s);
+
+
+/**	@brief Fast time-critical combined shift by 1 bit, subtract and normalise (Constant Time)
+ *
+	@param r BIG number normalised output
+	@param a BIG number to be subtracted from
+	@param m BIG number to be shifted and subtracted
+	@return sign of r
+ */
+extern int BIG_ssn(BIG r, BIG a, BIG m);
+
+/**	@brief Fast shifts a BIG right by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Shifted out bits
+ */
+extern int BIG_fshr(BIG x, int s);
+/**	@brief Shifts a DBIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshr(DBIG x, int s);
+/**	@brief Splits a DBIG into two BIGs - input must be normalised, outputs normalised (Constant Time as used)
+ *
+	Internal function. The value of s must be approximately in the middle of the DBIG.
+	Typically used to extract z mod 2^MODBITS and z/2^MODBITS
+	@param x BIG number, top half of z
+	@param y BIG number, bottom half of z
+	@param z DBIG number to be split in two.
+	@param s Bit position at which to split
+	@return carry-out from top half
+ */
+extern chunk BIG_split(BIG x, BIG y, DBIG z, int s);
+/**	@brief Normalizes a BIG number - output normalised (Constant Time)
+ *
+	All digits of the input BIG are reduced mod 2^BASEBITS
+	@param x BIG number to be normalised
+ */
+extern chunk BIG_norm(BIG x);
+/**	@brief Normalizes a DBIG number - output normalised (Constant Time)
+ *
+	All digits of the input DBIG are reduced mod 2^BASEBITS
+	@param x DBIG number to be normalised
+ */
+extern void BIG_dnorm(DBIG x);
+/**	@brief Compares two BIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first BIG number to be compared
+	@param y second BIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_comp(BIG x, BIG y);
+/**	@brief Compares two DBIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first DBIG number to be compared
+	@param y second DBIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_dcomp(DBIG x, DBIG y);
+/**	@brief Calculate number of bits in a BIG - output normalised (Variable Time)
+ *
+	@param x BIG number
+	@return Number of bits in x
+ */
+extern int BIG_nbits(BIG x);
+/**	@brief Calculate number of bits in a DBIG - output normalised (Variable Time)
+ *
+	@param x DBIG number
+	@return Number of bits in x
+ */
+extern int BIG_dnbits(DBIG x);
+
+/**	@brief Reduce x mod n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctmod(BIG x, BIG n, int bd);
+
+/**	@brief  x=y mod n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctdmod(BIG x, DBIG y, BIG n, int bd);
+
+/**	@brief Divide x by n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctsdiv(BIG x,BIG n,int bd);
+
+/**	@brief  x=y/n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctddiv(BIG x, DBIG y, BIG n,int bd);
+
+
+/**	@brief Reduce x mod n - input and output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+ */
+extern void BIG_mod(BIG x, BIG n);
+/**	@brief Divide x by n - output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+ */
+extern void BIG_sdiv(BIG x, BIG n);
+/**	@brief  x=y mod n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_dmod(BIG x, DBIG y, BIG n);
+/**	@brief  x=y/n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_ddiv(BIG x, DBIG y, BIG n);
+/**	@brief  return parity of BIG, that is the least significant bit (Constant Time)
+ *
+	@param x BIG number
+	@return 0 or 1
+ */
+extern int BIG_parity(BIG x);
+/**	@brief  return i-th of BIG (Constant Time)
+ *
+	@param x BIG number
+	@param i the bit of x to be returned
+	@return 0 or 1
+ */
+extern int BIG_bit(BIG x, int i);
+/**	@brief  return least significant bits of a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param n number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int BIG_lastbits(BIG x, int n);
+/**	@brief  Create a random BIG from a random number generator (Constant Time)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_random(BIG x, csprng *r);
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randomnum(BIG x, BIG n, csprng *r);
+
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus and truncated to max bit length (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param t Maximum bit length
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randtrunc(BIG x, BIG n, int t, csprng *r);
+
+/**	brief  return NAF (Non-Adjacent-Form) value as +/- 1, 3 or 5, inputs must be normalised
+ *
+	Given x and 3*x extracts NAF value from given bit position, and returns number of bits processed, and number of trailing zeros detected if any
+	param x BIG number
+	param x3 BIG number, three times x
+	param i bit position
+	param nbs pointer to integer returning number of bits processed
+	param nzs pointer to integer returning number of trailing 0s
+	return + or - 1, 3 or 5
+*/
+
+/**	@brief  Calculate x=y*z mod n (Variable Time)
+ *
+	Slow method for modular multiplication
+	@param x BIG number, on exit = y*z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modmul(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y/z mod n (Variable Time)
+ *
+	Slow method for modular division
+	@param x BIG number, on exit = y/z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_moddiv(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y^2 mod n (Variable Time)
+ *
+	Slow method for modular squaring
+	@param x BIG number, on exit = y^2 mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modsqr(BIG x, BIG y, BIG n);
+/**	@brief  Calculate x=-y mod n (Variable Time)
+ *
+	Modular negation
+	@param x BIG number, on exit = -y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modneg(BIG x, BIG y, BIG n);
+
+/**	@brief  Calculate x=y+z mod n (Variable Time)
+ *
+	Slow method for modular addition
+	@param x BIG number, on exit = y+z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modadd(BIG x, BIG y, BIG z, BIG n);
+
+/**	@brief  Calculate jacobi Symbol (x/y) (Variable Time)
+ *
+	@param x BIG number
+	@param y BIG number
+	@return Jacobi symbol, -1,0 or 1
+ */
+extern int BIG_jacobi(BIG x, BIG y);
+/**	@brief  Calculate x=1/y mod n (Variable Time)
+ *
+	Modular Inversion - This is slow. Uses binary method.
+	@param x BIG number, on exit = 1/y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_invmodp(BIG x, BIG y, BIG n);
+/** @brief Calculate x=x mod 2^m (Variable Time)
+ *
+	Truncation
+	@param x BIG number, on reduced mod 2^m
+	@param m new truncated size
+*/
+extern void BIG_mod2m(BIG x, int m);
+
+/**	@brief Calculates a*b+c+*d
+ *
+	Calculate partial product of a.b, add in carry c, and add total to d (Constant Time)
+	@param a multiplier
+	@param b multiplicand
+	@param c carry
+	@param d pointer to accumulated bottom half of result
+	@return top half of result
+ */
+
+
+extern int step1(BIG,BIG,BIG);
+extern void step2(BIG,BIG,BIG);
+
+#ifdef dchunk
+
+/* Method required to calculate x*y+c+r, bottom half in r, top half returned */
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    dchunk prod = (dchunk)x * y + c + *r;
+    *r = (chunk)prod & BMASK_B336_60;
+    return (chunk)(prod >> BASEBITS_B336_60);
+}
+
+#else
+
+/* No integer type available that can store double the wordlength */
+/* accumulate partial products */
+
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    chunk x0, x1, y0, y1;
+    chunk bot, top, mid, carry;
+    x0 = x & HMASK_B336_60;
+    x1 = (x >> HBITS_B336_60);
+    y0 = y & HMASK_B336_60;
+    y1 = (y >> HBITS_B336_60);
+    bot = x0 * y0;
+    top = x1 * y1;
+    mid = x0 * y1 + x1 * y0;
+    x0 = mid & HMASK_B336_60;
+    x1 = (mid >> HBITS_B336_60);
+    bot += x0 << HBITS_B336_60;
+    bot += *r;
+    bot += c;
+
+    top += x1;
+    carry = bot >> BASEBITS_B336_60;
+    bot &= BMASK_B336_60;
+    top += carry;
+
+    *r = bot;
+    return top;
+}
+
+#endif
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/big_B384_56.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/big_B384_56.h
new file mode 100644
index 0000000..c160c76
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/big_B384_56.h
@@ -0,0 +1,697 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file big.h
+ * @author Mike Scott
+ * @date 23rd February 2016
+ * @brief Big number Header File
+ *
+ *
+ */
+
+#ifndef BIG_B384_56_H
+#define BIG_B384_56_H
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <inttypes.h>
+#include "arch.h"
+#include "core.h"
+#include "config_big_B384_56.h"
+
+using namespace core;
+
+/* could comment this out if code size is a major issue */
+#define UNWOUND
+/* Normally recommended, but may not be optimal for some architectures, for example 32-bit ARM M4 */
+#define USE_KARATSUBA
+
+#define BIGBITS_B384_56 (8*MODBYTES_B384_56)
+#define NLEN_B384_56 (1+((8*MODBYTES_B384_56-1)/BASEBITS_B384_56))
+#define DNLEN_B384_56 2*NLEN_B384_56
+#define BMASK_B384_56 (((chunk)1<<BASEBITS_B384_56)-1) /**< Mask = 2^BASEBITS-1 */
+#define NEXCESS_B384_56 (1<<(CHUNK-BASEBITS_B384_56-1))           /**< 2^(CHUNK-BASEBITS-1) - digit cannot be multiplied by more than this before normalisation */
+
+#define HBITS_B384_56 (BASEBITS_B384_56/2)      /**< Number of bits in number base divided by 2 */
+#define HMASK_B384_56 (((chunk)1<<HBITS_B384_56)-1)    /**< Mask = 2^HBITS-1 */
+
+//#define DEBUG_NORM
+
+#ifdef DEBUG_NORM  /* Add an extra location to track chunk extension */
+#define MPV_B384_56 NLEN_B384_56
+#define MNV_B384_56 (NLEN_B384_56+1)
+#define DMPV_B384_56 DNLEN_B384_56
+#define DMNV_B384_56 (DNLEN_B384_56+1)
+
+#endif
+
+namespace B384_56 {
+
+//extern int BIGMULS;
+//extern int BIGSQRS;
+
+#ifdef DEBUG_NORM
+typedef chunk BIG[NLEN_B384_56 + 2]; /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B384_56 + 2]; /**< Define type DBIG as array of chunks */
+#else
+typedef chunk BIG[NLEN_B384_56];     /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B384_56];   /**< Define type DBIG as array of chunks */
+#endif
+
+/* BIG number prototypes */
+
+/**	@brief Tests for BIG equal to zero (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_iszilch(BIG x);
+/**	@brief Tests for BIG equal to one (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if one, else returns 0
+ */
+extern int BIG_isunity(BIG x);
+/**	@brief Tests for DBIG equal to zero (Constant Time)
+ *
+	@param x a DBIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_diszilch(DBIG x);
+/**	@brief Outputs a BIG number to the console (Variable Time)
+ *
+	@param x a BIG number
+ */
+extern void BIG_output(BIG x);
+/**	@brief Outputs a BIG number to the console in raw form (Variable Time for debugging)
+ *
+	@param x a BIG number
+ */
+extern void BIG_rawoutput(BIG x);
+/**	@brief Conditional constant time swap of two BIG numbers
+ *
+	Conditionally swaps parameters in constant time (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s swap takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cswap(BIG x, BIG y, int s);
+/**	@brief Conditional copy of BIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cmove(BIG x, BIG y, int s);
+/**	@brief Conditional copy of DBIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a DBIG number
+	@param y another DBIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_dcmove(BIG x, BIG y, int s);
+/**	@brief Convert from BIG number to byte array (Constant Time)
+ *
+	@param a byte array
+	@param x BIG number
+ */
+extern void BIG_toBytes(char *a, BIG x);
+/**	@brief Convert to BIG number from byte array (Constant Time)
+ *
+	@param x BIG number
+	@param a byte array
+ */
+extern void BIG_fromBytes(BIG x, char *a);
+/**	@brief Convert to BIG number from byte array of given length (Variable Time)
+ *
+	@param x BIG number
+	@param a byte array
+	@param s byte array length
+ */
+extern void BIG_fromBytesLen(BIG x, char *a, int s);
+/**@brief Convert to DBIG number from byte array of given length (Variable Time)
+ *
+   @param x DBIG number
+   @param a byte array
+   @param s byte array length
+ */
+extern void BIG_dfromBytesLen(DBIG x, char *a, int s);
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_doutput(DBIG x); 
+
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_drawoutput(DBIG x);
+
+/**	@brief Copy BIG from Read-Only Memory to a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number in ROM
+ */
+extern void BIG_rcopy(BIG x, const BIG y);
+/**	@brief Copy BIG to another BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_copy(BIG x, BIG y);
+/**	@brief Copy DBIG to another DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_dcopy(DBIG x, DBIG y);
+/**	@brief Copy BIG to upper half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dsucopy(DBIG x, BIG y);
+/**	@brief Copy BIG to lower half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dscopy(DBIG x, BIG y);
+/**	@brief Copy lower half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sdcopy(BIG x, DBIG y);
+/**	@brief Copy upper half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sducopy(BIG x, DBIG y);
+/**	@brief Set BIG to zero (Constant Time)
+ *
+	@param x BIG number to be set to zero  
+ */
+extern void BIG_zero(BIG x);
+/**	@brief Set DBIG to zero (Constant Time)
+ *
+	@param x DBIG number to be set to zero
+ */
+extern void BIG_dzero(DBIG x);
+/**	@brief Set BIG to one (unity) (Constant Time)
+ *
+	@param x BIG number to be set to one.
+ */
+extern void BIG_one(BIG x);
+/**	@brief Set BIG to inverse mod 2^256 (Constant Time)
+ *
+	@param x BIG number to be inverted
+ */
+extern void BIG_invmod2m(BIG x);
+/**	@brief Set BIG to sum of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, sum of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_add(BIG x, BIG y, BIG z);
+
+/**	@brief Set BIG to logical or of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, or of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_or(BIG x, BIG y, BIG z);
+
+/**	@brief Increment BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be incremented
+	@param i integer
+ */
+extern void BIG_inc(BIG x, int i);
+/**	@brief Set BIG to difference of two BIGs (Constant Time)
+ *
+	@param x BIG number, difference of other two - output not normalised
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_sub(BIG x, BIG y, BIG z);
+/**	@brief Decrement BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be decremented
+	@param i integer
+ */
+extern void BIG_dec(BIG x, int i);
+/**	@brief Set DBIG to sum of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, sum of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dadd(DBIG x, DBIG y, DBIG z);
+/**	@brief Set DBIG to difference of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, difference of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dsub(DBIG x, DBIG y, DBIG z);
+/**	@brief Multiply BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_imul(BIG x, BIG y, int i);
+/**	@brief Multiply BIG by not-so-small small integer - output normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+	@return Overflowing bits
+ */
+extern chunk BIG_pmul(BIG x, BIG y, int i);
+/**	@brief Divide BIG by 3 - output normalised (Constant Time)
+ *
+	@param x BIG number
+	@return Remainder
+ */
+extern int BIG_div3(BIG x);
+/**	@brief Multiply BIG by even bigger small integer resulting in a DBIG - output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_pxmul(DBIG x, BIG y, int i);
+/**	@brief Multiply BIG by another BIG resulting in DBIG - inputs normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_mul(DBIG x, BIG y, BIG z);
+/**	@brief Multiply BIG by another BIG resulting in another BIG - inputs normalised and output normalised (Constant Time)
+ *
+	Note that the product must fit into a BIG, and x must be distinct from y and z
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_smul(BIG x, BIG y, BIG z);
+/**	@brief Square BIG resulting in a DBIG - input normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, square of a BIG
+	@param y BIG number to be squared
+ */
+extern void BIG_sqr(DBIG x, BIG y);
+
+/**	@brief Montgomery reduction of a DBIG to a BIG  - input normalised and output normalised (Constant Time)
+ *
+	@param a BIG number, reduction of a BIG
+	@param md BIG number, the modulus
+	@param MC the Montgomery Constant
+	@param d DBIG number to be reduced
+ */
+extern void BIG_monty(BIG a, BIG md, chunk MC, DBIG d);
+
+/**	@brief Shifts a BIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shl(BIG x, int s);
+/**	@brief Fast shifts a BIG left by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Overflow bits
+ */
+extern int BIG_fshl(BIG x, int s);
+/**	@brief Shifts a DBIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshl(DBIG x, int s);
+/**	@brief Shifts a BIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shr(BIG x, int s);
+
+
+/**	@brief Fast time-critical combined shift by 1 bit, subtract and normalise (Constant Time)
+ *
+	@param r BIG number normalised output
+	@param a BIG number to be subtracted from
+	@param m BIG number to be shifted and subtracted
+	@return sign of r
+ */
+extern int BIG_ssn(BIG r, BIG a, BIG m);
+
+/**	@brief Fast shifts a BIG right by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Shifted out bits
+ */
+extern int BIG_fshr(BIG x, int s);
+/**	@brief Shifts a DBIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshr(DBIG x, int s);
+/**	@brief Splits a DBIG into two BIGs - input must be normalised, outputs normalised (Constant Time as used)
+ *
+	Internal function. The value of s must be approximately in the middle of the DBIG.
+	Typically used to extract z mod 2^MODBITS and z/2^MODBITS
+	@param x BIG number, top half of z
+	@param y BIG number, bottom half of z
+	@param z DBIG number to be split in two.
+	@param s Bit position at which to split
+	@return carry-out from top half
+ */
+extern chunk BIG_split(BIG x, BIG y, DBIG z, int s);
+/**	@brief Normalizes a BIG number - output normalised (Constant Time)
+ *
+	All digits of the input BIG are reduced mod 2^BASEBITS
+	@param x BIG number to be normalised
+ */
+extern chunk BIG_norm(BIG x);
+/**	@brief Normalizes a DBIG number - output normalised (Constant Time)
+ *
+	All digits of the input DBIG are reduced mod 2^BASEBITS
+	@param x DBIG number to be normalised
+ */
+extern void BIG_dnorm(DBIG x);
+/**	@brief Compares two BIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first BIG number to be compared
+	@param y second BIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_comp(BIG x, BIG y);
+/**	@brief Compares two DBIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first DBIG number to be compared
+	@param y second DBIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_dcomp(DBIG x, DBIG y);
+/**	@brief Calculate number of bits in a BIG - output normalised (Variable Time)
+ *
+	@param x BIG number
+	@return Number of bits in x
+ */
+extern int BIG_nbits(BIG x);
+/**	@brief Calculate number of bits in a DBIG - output normalised (Variable Time)
+ *
+	@param x DBIG number
+	@return Number of bits in x
+ */
+extern int BIG_dnbits(DBIG x);
+
+/**	@brief Reduce x mod n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctmod(BIG x, BIG n, int bd);
+
+/**	@brief  x=y mod n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctdmod(BIG x, DBIG y, BIG n, int bd);
+
+/**	@brief Divide x by n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctsdiv(BIG x,BIG n,int bd);
+
+/**	@brief  x=y/n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctddiv(BIG x, DBIG y, BIG n,int bd);
+
+
+/**	@brief Reduce x mod n - input and output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+ */
+extern void BIG_mod(BIG x, BIG n);
+/**	@brief Divide x by n - output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+ */
+extern void BIG_sdiv(BIG x, BIG n);
+/**	@brief  x=y mod n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_dmod(BIG x, DBIG y, BIG n);
+/**	@brief  x=y/n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_ddiv(BIG x, DBIG y, BIG n);
+/**	@brief  return parity of BIG, that is the least significant bit (Constant Time)
+ *
+	@param x BIG number
+	@return 0 or 1
+ */
+extern int BIG_parity(BIG x);
+/**	@brief  return i-th of BIG (Constant Time)
+ *
+	@param x BIG number
+	@param i the bit of x to be returned
+	@return 0 or 1
+ */
+extern int BIG_bit(BIG x, int i);
+/**	@brief  return least significant bits of a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param n number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int BIG_lastbits(BIG x, int n);
+/**	@brief  Create a random BIG from a random number generator (Constant Time)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_random(BIG x, csprng *r);
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randomnum(BIG x, BIG n, csprng *r);
+
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus and truncated to max bit length (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param t Maximum bit length
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randtrunc(BIG x, BIG n, int t, csprng *r);
+
+/**	brief  return NAF (Non-Adjacent-Form) value as +/- 1, 3 or 5, inputs must be normalised
+ *
+	Given x and 3*x extracts NAF value from given bit position, and returns number of bits processed, and number of trailing zeros detected if any
+	param x BIG number
+	param x3 BIG number, three times x
+	param i bit position
+	param nbs pointer to integer returning number of bits processed
+	param nzs pointer to integer returning number of trailing 0s
+	return + or - 1, 3 or 5
+*/
+
+/**	@brief  Calculate x=y*z mod n (Variable Time)
+ *
+	Slow method for modular multiplication
+	@param x BIG number, on exit = y*z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modmul(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y/z mod n (Variable Time)
+ *
+	Slow method for modular division
+	@param x BIG number, on exit = y/z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_moddiv(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y^2 mod n (Variable Time)
+ *
+	Slow method for modular squaring
+	@param x BIG number, on exit = y^2 mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modsqr(BIG x, BIG y, BIG n);
+/**	@brief  Calculate x=-y mod n (Variable Time)
+ *
+	Modular negation
+	@param x BIG number, on exit = -y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modneg(BIG x, BIG y, BIG n);
+
+/**	@brief  Calculate x=y+z mod n (Variable Time)
+ *
+	Slow method for modular addition
+	@param x BIG number, on exit = y+z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modadd(BIG x, BIG y, BIG z, BIG n);
+
+/**	@brief  Calculate jacobi Symbol (x/y) (Variable Time)
+ *
+	@param x BIG number
+	@param y BIG number
+	@return Jacobi symbol, -1,0 or 1
+ */
+extern int BIG_jacobi(BIG x, BIG y);
+/**	@brief  Calculate x=1/y mod n (Variable Time)
+ *
+	Modular Inversion - This is slow. Uses binary method.
+	@param x BIG number, on exit = 1/y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_invmodp(BIG x, BIG y, BIG n);
+/** @brief Calculate x=x mod 2^m (Variable Time)
+ *
+	Truncation
+	@param x BIG number, on reduced mod 2^m
+	@param m new truncated size
+*/
+extern void BIG_mod2m(BIG x, int m);
+
+/**	@brief Calculates a*b+c+*d
+ *
+	Calculate partial product of a.b, add in carry c, and add total to d (Constant Time)
+	@param a multiplier
+	@param b multiplicand
+	@param c carry
+	@param d pointer to accumulated bottom half of result
+	@return top half of result
+ */
+
+
+extern int step1(BIG,BIG,BIG);
+extern void step2(BIG,BIG,BIG);
+
+#ifdef dchunk
+
+/* Method required to calculate x*y+c+r, bottom half in r, top half returned */
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    dchunk prod = (dchunk)x * y + c + *r;
+    *r = (chunk)prod & BMASK_B384_56;
+    return (chunk)(prod >> BASEBITS_B384_56);
+}
+
+#else
+
+/* No integer type available that can store double the wordlength */
+/* accumulate partial products */
+
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    chunk x0, x1, y0, y1;
+    chunk bot, top, mid, carry;
+    x0 = x & HMASK_B384_56;
+    x1 = (x >> HBITS_B384_56);
+    y0 = y & HMASK_B384_56;
+    y1 = (y >> HBITS_B384_56);
+    bot = x0 * y0;
+    top = x1 * y1;
+    mid = x0 * y1 + x1 * y0;
+    x0 = mid & HMASK_B384_56;
+    x1 = (mid >> HBITS_B384_56);
+    bot += x0 << HBITS_B384_56;
+    bot += *r;
+    bot += c;
+
+    top += x1;
+    carry = bot >> BASEBITS_B384_56;
+    bot &= BMASK_B384_56;
+    top += carry;
+
+    *r = bot;
+    return top;
+}
+
+#endif
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/big_B384_58.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/big_B384_58.h
new file mode 100644
index 0000000..4eda3e5
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/big_B384_58.h
@@ -0,0 +1,697 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file big.h
+ * @author Mike Scott
+ * @date 23rd February 2016
+ * @brief Big number Header File
+ *
+ *
+ */
+
+#ifndef BIG_B384_58_H
+#define BIG_B384_58_H
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <inttypes.h>
+#include "arch.h"
+#include "core.h"
+#include "config_big_B384_58.h"
+
+using namespace core;
+
+/* could comment this out if code size is a major issue */
+#define UNWOUND
+/* Normally recommended, but may not be optimal for some architectures, for example 32-bit ARM M4 */
+#define USE_KARATSUBA
+
+#define BIGBITS_B384_58 (8*MODBYTES_B384_58)
+#define NLEN_B384_58 (1+((8*MODBYTES_B384_58-1)/BASEBITS_B384_58))
+#define DNLEN_B384_58 2*NLEN_B384_58
+#define BMASK_B384_58 (((chunk)1<<BASEBITS_B384_58)-1) /**< Mask = 2^BASEBITS-1 */
+#define NEXCESS_B384_58 (1<<(CHUNK-BASEBITS_B384_58-1))           /**< 2^(CHUNK-BASEBITS-1) - digit cannot be multiplied by more than this before normalisation */
+
+#define HBITS_B384_58 (BASEBITS_B384_58/2)      /**< Number of bits in number base divided by 2 */
+#define HMASK_B384_58 (((chunk)1<<HBITS_B384_58)-1)    /**< Mask = 2^HBITS-1 */
+
+//#define DEBUG_NORM
+
+#ifdef DEBUG_NORM  /* Add an extra location to track chunk extension */
+#define MPV_B384_58 NLEN_B384_58
+#define MNV_B384_58 (NLEN_B384_58+1)
+#define DMPV_B384_58 DNLEN_B384_58
+#define DMNV_B384_58 (DNLEN_B384_58+1)
+
+#endif
+
+namespace B384_58 {
+
+//extern int BIGMULS;
+//extern int BIGSQRS;
+
+#ifdef DEBUG_NORM
+typedef chunk BIG[NLEN_B384_58 + 2]; /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B384_58 + 2]; /**< Define type DBIG as array of chunks */
+#else
+typedef chunk BIG[NLEN_B384_58];     /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B384_58];   /**< Define type DBIG as array of chunks */
+#endif
+
+/* BIG number prototypes */
+
+/**	@brief Tests for BIG equal to zero (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_iszilch(BIG x);
+/**	@brief Tests for BIG equal to one (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if one, else returns 0
+ */
+extern int BIG_isunity(BIG x);
+/**	@brief Tests for DBIG equal to zero (Constant Time)
+ *
+	@param x a DBIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_diszilch(DBIG x);
+/**	@brief Outputs a BIG number to the console (Variable Time)
+ *
+	@param x a BIG number
+ */
+extern void BIG_output(BIG x);
+/**	@brief Outputs a BIG number to the console in raw form (Variable Time for debugging)
+ *
+	@param x a BIG number
+ */
+extern void BIG_rawoutput(BIG x);
+/**	@brief Conditional constant time swap of two BIG numbers
+ *
+	Conditionally swaps parameters in constant time (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s swap takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cswap(BIG x, BIG y, int s);
+/**	@brief Conditional copy of BIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cmove(BIG x, BIG y, int s);
+/**	@brief Conditional copy of DBIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a DBIG number
+	@param y another DBIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_dcmove(BIG x, BIG y, int s);
+/**	@brief Convert from BIG number to byte array (Constant Time)
+ *
+	@param a byte array
+	@param x BIG number
+ */
+extern void BIG_toBytes(char *a, BIG x);
+/**	@brief Convert to BIG number from byte array (Constant Time)
+ *
+	@param x BIG number
+	@param a byte array
+ */
+extern void BIG_fromBytes(BIG x, char *a);
+/**	@brief Convert to BIG number from byte array of given length (Variable Time)
+ *
+	@param x BIG number
+	@param a byte array
+	@param s byte array length
+ */
+extern void BIG_fromBytesLen(BIG x, char *a, int s);
+/**@brief Convert to DBIG number from byte array of given length (Variable Time)
+ *
+   @param x DBIG number
+   @param a byte array
+   @param s byte array length
+ */
+extern void BIG_dfromBytesLen(DBIG x, char *a, int s);
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_doutput(DBIG x); 
+
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_drawoutput(DBIG x);
+
+/**	@brief Copy BIG from Read-Only Memory to a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number in ROM
+ */
+extern void BIG_rcopy(BIG x, const BIG y);
+/**	@brief Copy BIG to another BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_copy(BIG x, BIG y);
+/**	@brief Copy DBIG to another DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_dcopy(DBIG x, DBIG y);
+/**	@brief Copy BIG to upper half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dsucopy(DBIG x, BIG y);
+/**	@brief Copy BIG to lower half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dscopy(DBIG x, BIG y);
+/**	@brief Copy lower half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sdcopy(BIG x, DBIG y);
+/**	@brief Copy upper half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sducopy(BIG x, DBIG y);
+/**	@brief Set BIG to zero (Constant Time)
+ *
+	@param x BIG number to be set to zero  
+ */
+extern void BIG_zero(BIG x);
+/**	@brief Set DBIG to zero (Constant Time)
+ *
+	@param x DBIG number to be set to zero
+ */
+extern void BIG_dzero(DBIG x);
+/**	@brief Set BIG to one (unity) (Constant Time)
+ *
+	@param x BIG number to be set to one.
+ */
+extern void BIG_one(BIG x);
+/**	@brief Set BIG to inverse mod 2^256 (Constant Time)
+ *
+	@param x BIG number to be inverted
+ */
+extern void BIG_invmod2m(BIG x);
+/**	@brief Set BIG to sum of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, sum of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_add(BIG x, BIG y, BIG z);
+
+/**	@brief Set BIG to logical or of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, or of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_or(BIG x, BIG y, BIG z);
+
+/**	@brief Increment BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be incremented
+	@param i integer
+ */
+extern void BIG_inc(BIG x, int i);
+/**	@brief Set BIG to difference of two BIGs (Constant Time)
+ *
+	@param x BIG number, difference of other two - output not normalised
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_sub(BIG x, BIG y, BIG z);
+/**	@brief Decrement BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be decremented
+	@param i integer
+ */
+extern void BIG_dec(BIG x, int i);
+/**	@brief Set DBIG to sum of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, sum of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dadd(DBIG x, DBIG y, DBIG z);
+/**	@brief Set DBIG to difference of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, difference of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dsub(DBIG x, DBIG y, DBIG z);
+/**	@brief Multiply BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_imul(BIG x, BIG y, int i);
+/**	@brief Multiply BIG by not-so-small small integer - output normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+	@return Overflowing bits
+ */
+extern chunk BIG_pmul(BIG x, BIG y, int i);
+/**	@brief Divide BIG by 3 - output normalised (Constant Time)
+ *
+	@param x BIG number
+	@return Remainder
+ */
+extern int BIG_div3(BIG x);
+/**	@brief Multiply BIG by even bigger small integer resulting in a DBIG - output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_pxmul(DBIG x, BIG y, int i);
+/**	@brief Multiply BIG by another BIG resulting in DBIG - inputs normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_mul(DBIG x, BIG y, BIG z);
+/**	@brief Multiply BIG by another BIG resulting in another BIG - inputs normalised and output normalised (Constant Time)
+ *
+	Note that the product must fit into a BIG, and x must be distinct from y and z
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_smul(BIG x, BIG y, BIG z);
+/**	@brief Square BIG resulting in a DBIG - input normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, square of a BIG
+	@param y BIG number to be squared
+ */
+extern void BIG_sqr(DBIG x, BIG y);
+
+/**	@brief Montgomery reduction of a DBIG to a BIG  - input normalised and output normalised (Constant Time)
+ *
+	@param a BIG number, reduction of a BIG
+	@param md BIG number, the modulus
+	@param MC the Montgomery Constant
+	@param d DBIG number to be reduced
+ */
+extern void BIG_monty(BIG a, BIG md, chunk MC, DBIG d);
+
+/**	@brief Shifts a BIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shl(BIG x, int s);
+/**	@brief Fast shifts a BIG left by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Overflow bits
+ */
+extern int BIG_fshl(BIG x, int s);
+/**	@brief Shifts a DBIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshl(DBIG x, int s);
+/**	@brief Shifts a BIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shr(BIG x, int s);
+
+
+/**	@brief Fast time-critical combined shift by 1 bit, subtract and normalise (Constant Time)
+ *
+	@param r BIG number normalised output
+	@param a BIG number to be subtracted from
+	@param m BIG number to be shifted and subtracted
+	@return sign of r
+ */
+extern int BIG_ssn(BIG r, BIG a, BIG m);
+
+/**	@brief Fast shifts a BIG right by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Shifted out bits
+ */
+extern int BIG_fshr(BIG x, int s);
+/**	@brief Shifts a DBIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshr(DBIG x, int s);
+/**	@brief Splits a DBIG into two BIGs - input must be normalised, outputs normalised (Constant Time as used)
+ *
+	Internal function. The value of s must be approximately in the middle of the DBIG.
+	Typically used to extract z mod 2^MODBITS and z/2^MODBITS
+	@param x BIG number, top half of z
+	@param y BIG number, bottom half of z
+	@param z DBIG number to be split in two.
+	@param s Bit position at which to split
+	@return carry-out from top half
+ */
+extern chunk BIG_split(BIG x, BIG y, DBIG z, int s);
+/**	@brief Normalizes a BIG number - output normalised (Constant Time)
+ *
+	All digits of the input BIG are reduced mod 2^BASEBITS
+	@param x BIG number to be normalised
+ */
+extern chunk BIG_norm(BIG x);
+/**	@brief Normalizes a DBIG number - output normalised (Constant Time)
+ *
+	All digits of the input DBIG are reduced mod 2^BASEBITS
+	@param x DBIG number to be normalised
+ */
+extern void BIG_dnorm(DBIG x);
+/**	@brief Compares two BIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first BIG number to be compared
+	@param y second BIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_comp(BIG x, BIG y);
+/**	@brief Compares two DBIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first DBIG number to be compared
+	@param y second DBIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_dcomp(DBIG x, DBIG y);
+/**	@brief Calculate number of bits in a BIG - output normalised (Variable Time)
+ *
+	@param x BIG number
+	@return Number of bits in x
+ */
+extern int BIG_nbits(BIG x);
+/**	@brief Calculate number of bits in a DBIG - output normalised (Variable Time)
+ *
+	@param x DBIG number
+	@return Number of bits in x
+ */
+extern int BIG_dnbits(DBIG x);
+
+/**	@brief Reduce x mod n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctmod(BIG x, BIG n, int bd);
+
+/**	@brief  x=y mod n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctdmod(BIG x, DBIG y, BIG n, int bd);
+
+/**	@brief Divide x by n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctsdiv(BIG x,BIG n,int bd);
+
+/**	@brief  x=y/n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctddiv(BIG x, DBIG y, BIG n,int bd);
+
+
+/**	@brief Reduce x mod n - input and output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+ */
+extern void BIG_mod(BIG x, BIG n);
+/**	@brief Divide x by n - output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+ */
+extern void BIG_sdiv(BIG x, BIG n);
+/**	@brief  x=y mod n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_dmod(BIG x, DBIG y, BIG n);
+/**	@brief  x=y/n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_ddiv(BIG x, DBIG y, BIG n);
+/**	@brief  return parity of BIG, that is the least significant bit (Constant Time)
+ *
+	@param x BIG number
+	@return 0 or 1
+ */
+extern int BIG_parity(BIG x);
+/**	@brief  return i-th of BIG (Constant Time)
+ *
+	@param x BIG number
+	@param i the bit of x to be returned
+	@return 0 or 1
+ */
+extern int BIG_bit(BIG x, int i);
+/**	@brief  return least significant bits of a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param n number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int BIG_lastbits(BIG x, int n);
+/**	@brief  Create a random BIG from a random number generator (Constant Time)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_random(BIG x, csprng *r);
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randomnum(BIG x, BIG n, csprng *r);
+
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus and truncated to max bit length (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param t Maximum bit length
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randtrunc(BIG x, BIG n, int t, csprng *r);
+
+/**	brief  return NAF (Non-Adjacent-Form) value as +/- 1, 3 or 5, inputs must be normalised
+ *
+	Given x and 3*x extracts NAF value from given bit position, and returns number of bits processed, and number of trailing zeros detected if any
+	param x BIG number
+	param x3 BIG number, three times x
+	param i bit position
+	param nbs pointer to integer returning number of bits processed
+	param nzs pointer to integer returning number of trailing 0s
+	return + or - 1, 3 or 5
+*/
+
+/**	@brief  Calculate x=y*z mod n (Variable Time)
+ *
+	Slow method for modular multiplication
+	@param x BIG number, on exit = y*z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modmul(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y/z mod n (Variable Time)
+ *
+	Slow method for modular division
+	@param x BIG number, on exit = y/z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_moddiv(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y^2 mod n (Variable Time)
+ *
+	Slow method for modular squaring
+	@param x BIG number, on exit = y^2 mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modsqr(BIG x, BIG y, BIG n);
+/**	@brief  Calculate x=-y mod n (Variable Time)
+ *
+	Modular negation
+	@param x BIG number, on exit = -y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modneg(BIG x, BIG y, BIG n);
+
+/**	@brief  Calculate x=y+z mod n (Variable Time)
+ *
+	Slow method for modular addition
+	@param x BIG number, on exit = y+z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modadd(BIG x, BIG y, BIG z, BIG n);
+
+/**	@brief  Calculate jacobi Symbol (x/y) (Variable Time)
+ *
+	@param x BIG number
+	@param y BIG number
+	@return Jacobi symbol, -1,0 or 1
+ */
+extern int BIG_jacobi(BIG x, BIG y);
+/**	@brief  Calculate x=1/y mod n (Variable Time)
+ *
+	Modular Inversion - This is slow. Uses binary method.
+	@param x BIG number, on exit = 1/y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_invmodp(BIG x, BIG y, BIG n);
+/** @brief Calculate x=x mod 2^m (Variable Time)
+ *
+	Truncation
+	@param x BIG number, on reduced mod 2^m
+	@param m new truncated size
+*/
+extern void BIG_mod2m(BIG x, int m);
+
+/**	@brief Calculates a*b+c+*d
+ *
+	Calculate partial product of a.b, add in carry c, and add total to d (Constant Time)
+	@param a multiplier
+	@param b multiplicand
+	@param c carry
+	@param d pointer to accumulated bottom half of result
+	@return top half of result
+ */
+
+
+extern int step1(BIG,BIG,BIG);
+extern void step2(BIG,BIG,BIG);
+
+#ifdef dchunk
+
+/* Method required to calculate x*y+c+r, bottom half in r, top half returned */
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    dchunk prod = (dchunk)x * y + c + *r;
+    *r = (chunk)prod & BMASK_B384_58;
+    return (chunk)(prod >> BASEBITS_B384_58);
+}
+
+#else
+
+/* No integer type available that can store double the wordlength */
+/* accumulate partial products */
+
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    chunk x0, x1, y0, y1;
+    chunk bot, top, mid, carry;
+    x0 = x & HMASK_B384_58;
+    x1 = (x >> HBITS_B384_58);
+    y0 = y & HMASK_B384_58;
+    y1 = (y >> HBITS_B384_58);
+    bot = x0 * y0;
+    top = x1 * y1;
+    mid = x0 * y1 + x1 * y0;
+    x0 = mid & HMASK_B384_58;
+    x1 = (mid >> HBITS_B384_58);
+    bot += x0 << HBITS_B384_58;
+    bot += *r;
+    bot += c;
+
+    top += x1;
+    carry = bot >> BASEBITS_B384_58;
+    bot &= BMASK_B384_58;
+    top += carry;
+
+    *r = bot;
+    return top;
+}
+
+#endif
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/big_B416_60.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/big_B416_60.h
new file mode 100644
index 0000000..978bc98
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/big_B416_60.h
@@ -0,0 +1,697 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file big.h
+ * @author Mike Scott
+ * @date 23rd February 2016
+ * @brief Big number Header File
+ *
+ *
+ */
+
+#ifndef BIG_B416_60_H
+#define BIG_B416_60_H
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <inttypes.h>
+#include "arch.h"
+#include "core.h"
+#include "config_big_B416_60.h"
+
+using namespace core;
+
+/* could comment this out if code size is a major issue */
+#define UNWOUND
+/* Normally recommended, but may not be optimal for some architectures, for example 32-bit ARM M4 */
+#define USE_KARATSUBA
+
+#define BIGBITS_B416_60 (8*MODBYTES_B416_60)
+#define NLEN_B416_60 (1+((8*MODBYTES_B416_60-1)/BASEBITS_B416_60))
+#define DNLEN_B416_60 2*NLEN_B416_60
+#define BMASK_B416_60 (((chunk)1<<BASEBITS_B416_60)-1) /**< Mask = 2^BASEBITS-1 */
+#define NEXCESS_B416_60 (1<<(CHUNK-BASEBITS_B416_60-1))           /**< 2^(CHUNK-BASEBITS-1) - digit cannot be multiplied by more than this before normalisation */
+
+#define HBITS_B416_60 (BASEBITS_B416_60/2)      /**< Number of bits in number base divided by 2 */
+#define HMASK_B416_60 (((chunk)1<<HBITS_B416_60)-1)    /**< Mask = 2^HBITS-1 */
+
+//#define DEBUG_NORM
+
+#ifdef DEBUG_NORM  /* Add an extra location to track chunk extension */
+#define MPV_B416_60 NLEN_B416_60
+#define MNV_B416_60 (NLEN_B416_60+1)
+#define DMPV_B416_60 DNLEN_B416_60
+#define DMNV_B416_60 (DNLEN_B416_60+1)
+
+#endif
+
+namespace B416_60 {
+
+//extern int BIGMULS;
+//extern int BIGSQRS;
+
+#ifdef DEBUG_NORM
+typedef chunk BIG[NLEN_B416_60 + 2]; /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B416_60 + 2]; /**< Define type DBIG as array of chunks */
+#else
+typedef chunk BIG[NLEN_B416_60];     /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B416_60];   /**< Define type DBIG as array of chunks */
+#endif
+
+/* BIG number prototypes */
+
+/**	@brief Tests for BIG equal to zero (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_iszilch(BIG x);
+/**	@brief Tests for BIG equal to one (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if one, else returns 0
+ */
+extern int BIG_isunity(BIG x);
+/**	@brief Tests for DBIG equal to zero (Constant Time)
+ *
+	@param x a DBIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_diszilch(DBIG x);
+/**	@brief Outputs a BIG number to the console (Variable Time)
+ *
+	@param x a BIG number
+ */
+extern void BIG_output(BIG x);
+/**	@brief Outputs a BIG number to the console in raw form (Variable Time for debugging)
+ *
+	@param x a BIG number
+ */
+extern void BIG_rawoutput(BIG x);
+/**	@brief Conditional constant time swap of two BIG numbers
+ *
+	Conditionally swaps parameters in constant time (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s swap takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cswap(BIG x, BIG y, int s);
+/**	@brief Conditional copy of BIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cmove(BIG x, BIG y, int s);
+/**	@brief Conditional copy of DBIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a DBIG number
+	@param y another DBIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_dcmove(BIG x, BIG y, int s);
+/**	@brief Convert from BIG number to byte array (Constant Time)
+ *
+	@param a byte array
+	@param x BIG number
+ */
+extern void BIG_toBytes(char *a, BIG x);
+/**	@brief Convert to BIG number from byte array (Constant Time)
+ *
+	@param x BIG number
+	@param a byte array
+ */
+extern void BIG_fromBytes(BIG x, char *a);
+/**	@brief Convert to BIG number from byte array of given length (Variable Time)
+ *
+	@param x BIG number
+	@param a byte array
+	@param s byte array length
+ */
+extern void BIG_fromBytesLen(BIG x, char *a, int s);
+/**@brief Convert to DBIG number from byte array of given length (Variable Time)
+ *
+   @param x DBIG number
+   @param a byte array
+   @param s byte array length
+ */
+extern void BIG_dfromBytesLen(DBIG x, char *a, int s);
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_doutput(DBIG x); 
+
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_drawoutput(DBIG x);
+
+/**	@brief Copy BIG from Read-Only Memory to a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number in ROM
+ */
+extern void BIG_rcopy(BIG x, const BIG y);
+/**	@brief Copy BIG to another BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_copy(BIG x, BIG y);
+/**	@brief Copy DBIG to another DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_dcopy(DBIG x, DBIG y);
+/**	@brief Copy BIG to upper half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dsucopy(DBIG x, BIG y);
+/**	@brief Copy BIG to lower half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dscopy(DBIG x, BIG y);
+/**	@brief Copy lower half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sdcopy(BIG x, DBIG y);
+/**	@brief Copy upper half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sducopy(BIG x, DBIG y);
+/**	@brief Set BIG to zero (Constant Time)
+ *
+	@param x BIG number to be set to zero  
+ */
+extern void BIG_zero(BIG x);
+/**	@brief Set DBIG to zero (Constant Time)
+ *
+	@param x DBIG number to be set to zero
+ */
+extern void BIG_dzero(DBIG x);
+/**	@brief Set BIG to one (unity) (Constant Time)
+ *
+	@param x BIG number to be set to one.
+ */
+extern void BIG_one(BIG x);
+/**	@brief Set BIG to inverse mod 2^256 (Constant Time)
+ *
+	@param x BIG number to be inverted
+ */
+extern void BIG_invmod2m(BIG x);
+/**	@brief Set BIG to sum of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, sum of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_add(BIG x, BIG y, BIG z);
+
+/**	@brief Set BIG to logical or of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, or of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_or(BIG x, BIG y, BIG z);
+
+/**	@brief Increment BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be incremented
+	@param i integer
+ */
+extern void BIG_inc(BIG x, int i);
+/**	@brief Set BIG to difference of two BIGs (Constant Time)
+ *
+	@param x BIG number, difference of other two - output not normalised
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_sub(BIG x, BIG y, BIG z);
+/**	@brief Decrement BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be decremented
+	@param i integer
+ */
+extern void BIG_dec(BIG x, int i);
+/**	@brief Set DBIG to sum of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, sum of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dadd(DBIG x, DBIG y, DBIG z);
+/**	@brief Set DBIG to difference of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, difference of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dsub(DBIG x, DBIG y, DBIG z);
+/**	@brief Multiply BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_imul(BIG x, BIG y, int i);
+/**	@brief Multiply BIG by not-so-small small integer - output normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+	@return Overflowing bits
+ */
+extern chunk BIG_pmul(BIG x, BIG y, int i);
+/**	@brief Divide BIG by 3 - output normalised (Constant Time)
+ *
+	@param x BIG number
+	@return Remainder
+ */
+extern int BIG_div3(BIG x);
+/**	@brief Multiply BIG by even bigger small integer resulting in a DBIG - output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_pxmul(DBIG x, BIG y, int i);
+/**	@brief Multiply BIG by another BIG resulting in DBIG - inputs normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_mul(DBIG x, BIG y, BIG z);
+/**	@brief Multiply BIG by another BIG resulting in another BIG - inputs normalised and output normalised (Constant Time)
+ *
+	Note that the product must fit into a BIG, and x must be distinct from y and z
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_smul(BIG x, BIG y, BIG z);
+/**	@brief Square BIG resulting in a DBIG - input normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, square of a BIG
+	@param y BIG number to be squared
+ */
+extern void BIG_sqr(DBIG x, BIG y);
+
+/**	@brief Montgomery reduction of a DBIG to a BIG  - input normalised and output normalised (Constant Time)
+ *
+	@param a BIG number, reduction of a BIG
+	@param md BIG number, the modulus
+	@param MC the Montgomery Constant
+	@param d DBIG number to be reduced
+ */
+extern void BIG_monty(BIG a, BIG md, chunk MC, DBIG d);
+
+/**	@brief Shifts a BIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shl(BIG x, int s);
+/**	@brief Fast shifts a BIG left by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Overflow bits
+ */
+extern int BIG_fshl(BIG x, int s);
+/**	@brief Shifts a DBIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshl(DBIG x, int s);
+/**	@brief Shifts a BIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shr(BIG x, int s);
+
+
+/**	@brief Fast time-critical combined shift by 1 bit, subtract and normalise (Constant Time)
+ *
+	@param r BIG number normalised output
+	@param a BIG number to be subtracted from
+	@param m BIG number to be shifted and subtracted
+	@return sign of r
+ */
+extern int BIG_ssn(BIG r, BIG a, BIG m);
+
+/**	@brief Fast shifts a BIG right by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Shifted out bits
+ */
+extern int BIG_fshr(BIG x, int s);
+/**	@brief Shifts a DBIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshr(DBIG x, int s);
+/**	@brief Splits a DBIG into two BIGs - input must be normalised, outputs normalised (Constant Time as used)
+ *
+	Internal function. The value of s must be approximately in the middle of the DBIG.
+	Typically used to extract z mod 2^MODBITS and z/2^MODBITS
+	@param x BIG number, top half of z
+	@param y BIG number, bottom half of z
+	@param z DBIG number to be split in two.
+	@param s Bit position at which to split
+	@return carry-out from top half
+ */
+extern chunk BIG_split(BIG x, BIG y, DBIG z, int s);
+/**	@brief Normalizes a BIG number - output normalised (Constant Time)
+ *
+	All digits of the input BIG are reduced mod 2^BASEBITS
+	@param x BIG number to be normalised
+ */
+extern chunk BIG_norm(BIG x);
+/**	@brief Normalizes a DBIG number - output normalised (Constant Time)
+ *
+	All digits of the input DBIG are reduced mod 2^BASEBITS
+	@param x DBIG number to be normalised
+ */
+extern void BIG_dnorm(DBIG x);
+/**	@brief Compares two BIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first BIG number to be compared
+	@param y second BIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_comp(BIG x, BIG y);
+/**	@brief Compares two DBIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first DBIG number to be compared
+	@param y second DBIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_dcomp(DBIG x, DBIG y);
+/**	@brief Calculate number of bits in a BIG - output normalised (Variable Time)
+ *
+	@param x BIG number
+	@return Number of bits in x
+ */
+extern int BIG_nbits(BIG x);
+/**	@brief Calculate number of bits in a DBIG - output normalised (Variable Time)
+ *
+	@param x DBIG number
+	@return Number of bits in x
+ */
+extern int BIG_dnbits(DBIG x);
+
+/**	@brief Reduce x mod n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctmod(BIG x, BIG n, int bd);
+
+/**	@brief  x=y mod n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctdmod(BIG x, DBIG y, BIG n, int bd);
+
+/**	@brief Divide x by n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctsdiv(BIG x,BIG n,int bd);
+
+/**	@brief  x=y/n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctddiv(BIG x, DBIG y, BIG n,int bd);
+
+
+/**	@brief Reduce x mod n - input and output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+ */
+extern void BIG_mod(BIG x, BIG n);
+/**	@brief Divide x by n - output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+ */
+extern void BIG_sdiv(BIG x, BIG n);
+/**	@brief  x=y mod n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_dmod(BIG x, DBIG y, BIG n);
+/**	@brief  x=y/n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_ddiv(BIG x, DBIG y, BIG n);
+/**	@brief  return parity of BIG, that is the least significant bit (Constant Time)
+ *
+	@param x BIG number
+	@return 0 or 1
+ */
+extern int BIG_parity(BIG x);
+/**	@brief  return i-th of BIG (Constant Time)
+ *
+	@param x BIG number
+	@param i the bit of x to be returned
+	@return 0 or 1
+ */
+extern int BIG_bit(BIG x, int i);
+/**	@brief  return least significant bits of a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param n number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int BIG_lastbits(BIG x, int n);
+/**	@brief  Create a random BIG from a random number generator (Constant Time)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_random(BIG x, csprng *r);
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randomnum(BIG x, BIG n, csprng *r);
+
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus and truncated to max bit length (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param t Maximum bit length
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randtrunc(BIG x, BIG n, int t, csprng *r);
+
+/**	brief  return NAF (Non-Adjacent-Form) value as +/- 1, 3 or 5, inputs must be normalised
+ *
+	Given x and 3*x extracts NAF value from given bit position, and returns number of bits processed, and number of trailing zeros detected if any
+	param x BIG number
+	param x3 BIG number, three times x
+	param i bit position
+	param nbs pointer to integer returning number of bits processed
+	param nzs pointer to integer returning number of trailing 0s
+	return + or - 1, 3 or 5
+*/
+
+/**	@brief  Calculate x=y*z mod n (Variable Time)
+ *
+	Slow method for modular multiplication
+	@param x BIG number, on exit = y*z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modmul(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y/z mod n (Variable Time)
+ *
+	Slow method for modular division
+	@param x BIG number, on exit = y/z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_moddiv(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y^2 mod n (Variable Time)
+ *
+	Slow method for modular squaring
+	@param x BIG number, on exit = y^2 mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modsqr(BIG x, BIG y, BIG n);
+/**	@brief  Calculate x=-y mod n (Variable Time)
+ *
+	Modular negation
+	@param x BIG number, on exit = -y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modneg(BIG x, BIG y, BIG n);
+
+/**	@brief  Calculate x=y+z mod n (Variable Time)
+ *
+	Slow method for modular addition
+	@param x BIG number, on exit = y+z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modadd(BIG x, BIG y, BIG z, BIG n);
+
+/**	@brief  Calculate jacobi Symbol (x/y) (Variable Time)
+ *
+	@param x BIG number
+	@param y BIG number
+	@return Jacobi symbol, -1,0 or 1
+ */
+extern int BIG_jacobi(BIG x, BIG y);
+/**	@brief  Calculate x=1/y mod n (Variable Time)
+ *
+	Modular Inversion - This is slow. Uses binary method.
+	@param x BIG number, on exit = 1/y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_invmodp(BIG x, BIG y, BIG n);
+/** @brief Calculate x=x mod 2^m (Variable Time)
+ *
+	Truncation
+	@param x BIG number, on reduced mod 2^m
+	@param m new truncated size
+*/
+extern void BIG_mod2m(BIG x, int m);
+
+/**	@brief Calculates a*b+c+*d
+ *
+	Calculate partial product of a.b, add in carry c, and add total to d (Constant Time)
+	@param a multiplier
+	@param b multiplicand
+	@param c carry
+	@param d pointer to accumulated bottom half of result
+	@return top half of result
+ */
+
+
+extern int step1(BIG,BIG,BIG);
+extern void step2(BIG,BIG,BIG);
+
+#ifdef dchunk
+
+/* Method required to calculate x*y+c+r, bottom half in r, top half returned */
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    dchunk prod = (dchunk)x * y + c + *r;
+    *r = (chunk)prod & BMASK_B416_60;
+    return (chunk)(prod >> BASEBITS_B416_60);
+}
+
+#else
+
+/* No integer type available that can store double the wordlength */
+/* accumulate partial products */
+
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    chunk x0, x1, y0, y1;
+    chunk bot, top, mid, carry;
+    x0 = x & HMASK_B416_60;
+    x1 = (x >> HBITS_B416_60);
+    y0 = y & HMASK_B416_60;
+    y1 = (y >> HBITS_B416_60);
+    bot = x0 * y0;
+    top = x1 * y1;
+    mid = x0 * y1 + x1 * y0;
+    x0 = mid & HMASK_B416_60;
+    x1 = (mid >> HBITS_B416_60);
+    bot += x0 << HBITS_B416_60;
+    bot += *r;
+    bot += c;
+
+    top += x1;
+    carry = bot >> BASEBITS_B416_60;
+    bot &= BMASK_B416_60;
+    top += carry;
+
+    *r = bot;
+    return top;
+}
+
+#endif
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/big_B448_58.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/big_B448_58.h
new file mode 100644
index 0000000..8aa26f1
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/big_B448_58.h
@@ -0,0 +1,697 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file big.h
+ * @author Mike Scott
+ * @date 23rd February 2016
+ * @brief Big number Header File
+ *
+ *
+ */
+
+#ifndef BIG_B448_58_H
+#define BIG_B448_58_H
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <inttypes.h>
+#include "arch.h"
+#include "core.h"
+#include "config_big_B448_58.h"
+
+using namespace core;
+
+/* could comment this out if code size is a major issue */
+#define UNWOUND
+/* Normally recommended, but may not be optimal for some architectures, for example 32-bit ARM M4 */
+#define USE_KARATSUBA
+
+#define BIGBITS_B448_58 (8*MODBYTES_B448_58)
+#define NLEN_B448_58 (1+((8*MODBYTES_B448_58-1)/BASEBITS_B448_58))
+#define DNLEN_B448_58 2*NLEN_B448_58
+#define BMASK_B448_58 (((chunk)1<<BASEBITS_B448_58)-1) /**< Mask = 2^BASEBITS-1 */
+#define NEXCESS_B448_58 (1<<(CHUNK-BASEBITS_B448_58-1))           /**< 2^(CHUNK-BASEBITS-1) - digit cannot be multiplied by more than this before normalisation */
+
+#define HBITS_B448_58 (BASEBITS_B448_58/2)      /**< Number of bits in number base divided by 2 */
+#define HMASK_B448_58 (((chunk)1<<HBITS_B448_58)-1)    /**< Mask = 2^HBITS-1 */
+
+//#define DEBUG_NORM
+
+#ifdef DEBUG_NORM  /* Add an extra location to track chunk extension */
+#define MPV_B448_58 NLEN_B448_58
+#define MNV_B448_58 (NLEN_B448_58+1)
+#define DMPV_B448_58 DNLEN_B448_58
+#define DMNV_B448_58 (DNLEN_B448_58+1)
+
+#endif
+
+namespace B448_58 {
+
+//extern int BIGMULS;
+//extern int BIGSQRS;
+
+#ifdef DEBUG_NORM
+typedef chunk BIG[NLEN_B448_58 + 2]; /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B448_58 + 2]; /**< Define type DBIG as array of chunks */
+#else
+typedef chunk BIG[NLEN_B448_58];     /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B448_58];   /**< Define type DBIG as array of chunks */
+#endif
+
+/* BIG number prototypes */
+
+/**	@brief Tests for BIG equal to zero (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_iszilch(BIG x);
+/**	@brief Tests for BIG equal to one (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if one, else returns 0
+ */
+extern int BIG_isunity(BIG x);
+/**	@brief Tests for DBIG equal to zero (Constant Time)
+ *
+	@param x a DBIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_diszilch(DBIG x);
+/**	@brief Outputs a BIG number to the console (Variable Time)
+ *
+	@param x a BIG number
+ */
+extern void BIG_output(BIG x);
+/**	@brief Outputs a BIG number to the console in raw form (Variable Time for debugging)
+ *
+	@param x a BIG number
+ */
+extern void BIG_rawoutput(BIG x);
+/**	@brief Conditional constant time swap of two BIG numbers
+ *
+	Conditionally swaps parameters in constant time (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s swap takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cswap(BIG x, BIG y, int s);
+/**	@brief Conditional copy of BIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cmove(BIG x, BIG y, int s);
+/**	@brief Conditional copy of DBIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a DBIG number
+	@param y another DBIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_dcmove(BIG x, BIG y, int s);
+/**	@brief Convert from BIG number to byte array (Constant Time)
+ *
+	@param a byte array
+	@param x BIG number
+ */
+extern void BIG_toBytes(char *a, BIG x);
+/**	@brief Convert to BIG number from byte array (Constant Time)
+ *
+	@param x BIG number
+	@param a byte array
+ */
+extern void BIG_fromBytes(BIG x, char *a);
+/**	@brief Convert to BIG number from byte array of given length (Variable Time)
+ *
+	@param x BIG number
+	@param a byte array
+	@param s byte array length
+ */
+extern void BIG_fromBytesLen(BIG x, char *a, int s);
+/**@brief Convert to DBIG number from byte array of given length (Variable Time)
+ *
+   @param x DBIG number
+   @param a byte array
+   @param s byte array length
+ */
+extern void BIG_dfromBytesLen(DBIG x, char *a, int s);
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_doutput(DBIG x); 
+
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_drawoutput(DBIG x);
+
+/**	@brief Copy BIG from Read-Only Memory to a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number in ROM
+ */
+extern void BIG_rcopy(BIG x, const BIG y);
+/**	@brief Copy BIG to another BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_copy(BIG x, BIG y);
+/**	@brief Copy DBIG to another DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_dcopy(DBIG x, DBIG y);
+/**	@brief Copy BIG to upper half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dsucopy(DBIG x, BIG y);
+/**	@brief Copy BIG to lower half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dscopy(DBIG x, BIG y);
+/**	@brief Copy lower half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sdcopy(BIG x, DBIG y);
+/**	@brief Copy upper half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sducopy(BIG x, DBIG y);
+/**	@brief Set BIG to zero (Constant Time)
+ *
+	@param x BIG number to be set to zero  
+ */
+extern void BIG_zero(BIG x);
+/**	@brief Set DBIG to zero (Constant Time)
+ *
+	@param x DBIG number to be set to zero
+ */
+extern void BIG_dzero(DBIG x);
+/**	@brief Set BIG to one (unity) (Constant Time)
+ *
+	@param x BIG number to be set to one.
+ */
+extern void BIG_one(BIG x);
+/**	@brief Set BIG to inverse mod 2^256 (Constant Time)
+ *
+	@param x BIG number to be inverted
+ */
+extern void BIG_invmod2m(BIG x);
+/**	@brief Set BIG to sum of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, sum of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_add(BIG x, BIG y, BIG z);
+
+/**	@brief Set BIG to logical or of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, or of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_or(BIG x, BIG y, BIG z);
+
+/**	@brief Increment BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be incremented
+	@param i integer
+ */
+extern void BIG_inc(BIG x, int i);
+/**	@brief Set BIG to difference of two BIGs (Constant Time)
+ *
+	@param x BIG number, difference of other two - output not normalised
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_sub(BIG x, BIG y, BIG z);
+/**	@brief Decrement BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be decremented
+	@param i integer
+ */
+extern void BIG_dec(BIG x, int i);
+/**	@brief Set DBIG to sum of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, sum of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dadd(DBIG x, DBIG y, DBIG z);
+/**	@brief Set DBIG to difference of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, difference of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dsub(DBIG x, DBIG y, DBIG z);
+/**	@brief Multiply BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_imul(BIG x, BIG y, int i);
+/**	@brief Multiply BIG by not-so-small small integer - output normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+	@return Overflowing bits
+ */
+extern chunk BIG_pmul(BIG x, BIG y, int i);
+/**	@brief Divide BIG by 3 - output normalised (Constant Time)
+ *
+	@param x BIG number
+	@return Remainder
+ */
+extern int BIG_div3(BIG x);
+/**	@brief Multiply BIG by even bigger small integer resulting in a DBIG - output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_pxmul(DBIG x, BIG y, int i);
+/**	@brief Multiply BIG by another BIG resulting in DBIG - inputs normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_mul(DBIG x, BIG y, BIG z);
+/**	@brief Multiply BIG by another BIG resulting in another BIG - inputs normalised and output normalised (Constant Time)
+ *
+	Note that the product must fit into a BIG, and x must be distinct from y and z
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_smul(BIG x, BIG y, BIG z);
+/**	@brief Square BIG resulting in a DBIG - input normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, square of a BIG
+	@param y BIG number to be squared
+ */
+extern void BIG_sqr(DBIG x, BIG y);
+
+/**	@brief Montgomery reduction of a DBIG to a BIG  - input normalised and output normalised (Constant Time)
+ *
+	@param a BIG number, reduction of a BIG
+	@param md BIG number, the modulus
+	@param MC the Montgomery Constant
+	@param d DBIG number to be reduced
+ */
+extern void BIG_monty(BIG a, BIG md, chunk MC, DBIG d);
+
+/**	@brief Shifts a BIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shl(BIG x, int s);
+/**	@brief Fast shifts a BIG left by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Overflow bits
+ */
+extern int BIG_fshl(BIG x, int s);
+/**	@brief Shifts a DBIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshl(DBIG x, int s);
+/**	@brief Shifts a BIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shr(BIG x, int s);
+
+
+/**	@brief Fast time-critical combined shift by 1 bit, subtract and normalise (Constant Time)
+ *
+	@param r BIG number normalised output
+	@param a BIG number to be subtracted from
+	@param m BIG number to be shifted and subtracted
+	@return sign of r
+ */
+extern int BIG_ssn(BIG r, BIG a, BIG m);
+
+/**	@brief Fast shifts a BIG right by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Shifted out bits
+ */
+extern int BIG_fshr(BIG x, int s);
+/**	@brief Shifts a DBIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshr(DBIG x, int s);
+/**	@brief Splits a DBIG into two BIGs - input must be normalised, outputs normalised (Constant Time as used)
+ *
+	Internal function. The value of s must be approximately in the middle of the DBIG.
+	Typically used to extract z mod 2^MODBITS and z/2^MODBITS
+	@param x BIG number, top half of z
+	@param y BIG number, bottom half of z
+	@param z DBIG number to be split in two.
+	@param s Bit position at which to split
+	@return carry-out from top half
+ */
+extern chunk BIG_split(BIG x, BIG y, DBIG z, int s);
+/**	@brief Normalizes a BIG number - output normalised (Constant Time)
+ *
+	All digits of the input BIG are reduced mod 2^BASEBITS
+	@param x BIG number to be normalised
+ */
+extern chunk BIG_norm(BIG x);
+/**	@brief Normalizes a DBIG number - output normalised (Constant Time)
+ *
+	All digits of the input DBIG are reduced mod 2^BASEBITS
+	@param x DBIG number to be normalised
+ */
+extern void BIG_dnorm(DBIG x);
+/**	@brief Compares two BIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first BIG number to be compared
+	@param y second BIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_comp(BIG x, BIG y);
+/**	@brief Compares two DBIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first DBIG number to be compared
+	@param y second DBIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_dcomp(DBIG x, DBIG y);
+/**	@brief Calculate number of bits in a BIG - output normalised (Variable Time)
+ *
+	@param x BIG number
+	@return Number of bits in x
+ */
+extern int BIG_nbits(BIG x);
+/**	@brief Calculate number of bits in a DBIG - output normalised (Variable Time)
+ *
+	@param x DBIG number
+	@return Number of bits in x
+ */
+extern int BIG_dnbits(DBIG x);
+
+/**	@brief Reduce x mod n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctmod(BIG x, BIG n, int bd);
+
+/**	@brief  x=y mod n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctdmod(BIG x, DBIG y, BIG n, int bd);
+
+/**	@brief Divide x by n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctsdiv(BIG x,BIG n,int bd);
+
+/**	@brief  x=y/n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctddiv(BIG x, DBIG y, BIG n,int bd);
+
+
+/**	@brief Reduce x mod n - input and output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+ */
+extern void BIG_mod(BIG x, BIG n);
+/**	@brief Divide x by n - output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+ */
+extern void BIG_sdiv(BIG x, BIG n);
+/**	@brief  x=y mod n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_dmod(BIG x, DBIG y, BIG n);
+/**	@brief  x=y/n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_ddiv(BIG x, DBIG y, BIG n);
+/**	@brief  return parity of BIG, that is the least significant bit (Constant Time)
+ *
+	@param x BIG number
+	@return 0 or 1
+ */
+extern int BIG_parity(BIG x);
+/**	@brief  return i-th of BIG (Constant Time)
+ *
+	@param x BIG number
+	@param i the bit of x to be returned
+	@return 0 or 1
+ */
+extern int BIG_bit(BIG x, int i);
+/**	@brief  return least significant bits of a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param n number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int BIG_lastbits(BIG x, int n);
+/**	@brief  Create a random BIG from a random number generator (Constant Time)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_random(BIG x, csprng *r);
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randomnum(BIG x, BIG n, csprng *r);
+
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus and truncated to max bit length (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param t Maximum bit length
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randtrunc(BIG x, BIG n, int t, csprng *r);
+
+/**	brief  return NAF (Non-Adjacent-Form) value as +/- 1, 3 or 5, inputs must be normalised
+ *
+	Given x and 3*x extracts NAF value from given bit position, and returns number of bits processed, and number of trailing zeros detected if any
+	param x BIG number
+	param x3 BIG number, three times x
+	param i bit position
+	param nbs pointer to integer returning number of bits processed
+	param nzs pointer to integer returning number of trailing 0s
+	return + or - 1, 3 or 5
+*/
+
+/**	@brief  Calculate x=y*z mod n (Variable Time)
+ *
+	Slow method for modular multiplication
+	@param x BIG number, on exit = y*z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modmul(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y/z mod n (Variable Time)
+ *
+	Slow method for modular division
+	@param x BIG number, on exit = y/z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_moddiv(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y^2 mod n (Variable Time)
+ *
+	Slow method for modular squaring
+	@param x BIG number, on exit = y^2 mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modsqr(BIG x, BIG y, BIG n);
+/**	@brief  Calculate x=-y mod n (Variable Time)
+ *
+	Modular negation
+	@param x BIG number, on exit = -y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modneg(BIG x, BIG y, BIG n);
+
+/**	@brief  Calculate x=y+z mod n (Variable Time)
+ *
+	Slow method for modular addition
+	@param x BIG number, on exit = y+z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modadd(BIG x, BIG y, BIG z, BIG n);
+
+/**	@brief  Calculate jacobi Symbol (x/y) (Variable Time)
+ *
+	@param x BIG number
+	@param y BIG number
+	@return Jacobi symbol, -1,0 or 1
+ */
+extern int BIG_jacobi(BIG x, BIG y);
+/**	@brief  Calculate x=1/y mod n (Variable Time)
+ *
+	Modular Inversion - This is slow. Uses binary method.
+	@param x BIG number, on exit = 1/y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_invmodp(BIG x, BIG y, BIG n);
+/** @brief Calculate x=x mod 2^m (Variable Time)
+ *
+	Truncation
+	@param x BIG number, on reduced mod 2^m
+	@param m new truncated size
+*/
+extern void BIG_mod2m(BIG x, int m);
+
+/**	@brief Calculates a*b+c+*d
+ *
+	Calculate partial product of a.b, add in carry c, and add total to d (Constant Time)
+	@param a multiplier
+	@param b multiplicand
+	@param c carry
+	@param d pointer to accumulated bottom half of result
+	@return top half of result
+ */
+
+
+extern int step1(BIG,BIG,BIG);
+extern void step2(BIG,BIG,BIG);
+
+#ifdef dchunk
+
+/* Method required to calculate x*y+c+r, bottom half in r, top half returned */
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    dchunk prod = (dchunk)x * y + c + *r;
+    *r = (chunk)prod & BMASK_B448_58;
+    return (chunk)(prod >> BASEBITS_B448_58);
+}
+
+#else
+
+/* No integer type available that can store double the wordlength */
+/* accumulate partial products */
+
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    chunk x0, x1, y0, y1;
+    chunk bot, top, mid, carry;
+    x0 = x & HMASK_B448_58;
+    x1 = (x >> HBITS_B448_58);
+    y0 = y & HMASK_B448_58;
+    y1 = (y >> HBITS_B448_58);
+    bot = x0 * y0;
+    top = x1 * y1;
+    mid = x0 * y1 + x1 * y0;
+    x0 = mid & HMASK_B448_58;
+    x1 = (mid >> HBITS_B448_58);
+    bot += x0 << HBITS_B448_58;
+    bot += *r;
+    bot += c;
+
+    top += x1;
+    carry = bot >> BASEBITS_B448_58;
+    bot &= BMASK_B448_58;
+    top += carry;
+
+    *r = bot;
+    return top;
+}
+
+#endif
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/big_B448_60.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/big_B448_60.h
new file mode 100644
index 0000000..ce14891
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/big_B448_60.h
@@ -0,0 +1,697 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file big.h
+ * @author Mike Scott
+ * @date 23rd February 2016
+ * @brief Big number Header File
+ *
+ *
+ */
+
+#ifndef BIG_B448_60_H
+#define BIG_B448_60_H
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <inttypes.h>
+#include "arch.h"
+#include "core.h"
+#include "config_big_B448_60.h"
+
+using namespace core;
+
+/* could comment this out if code size is a major issue */
+#define UNWOUND
+/* Normally recommended, but may not be optimal for some architectures, for example 32-bit ARM M4 */
+#define USE_KARATSUBA
+
+#define BIGBITS_B448_60 (8*MODBYTES_B448_60)
+#define NLEN_B448_60 (1+((8*MODBYTES_B448_60-1)/BASEBITS_B448_60))
+#define DNLEN_B448_60 2*NLEN_B448_60
+#define BMASK_B448_60 (((chunk)1<<BASEBITS_B448_60)-1) /**< Mask = 2^BASEBITS-1 */
+#define NEXCESS_B448_60 (1<<(CHUNK-BASEBITS_B448_60-1))           /**< 2^(CHUNK-BASEBITS-1) - digit cannot be multiplied by more than this before normalisation */
+
+#define HBITS_B448_60 (BASEBITS_B448_60/2)      /**< Number of bits in number base divided by 2 */
+#define HMASK_B448_60 (((chunk)1<<HBITS_B448_60)-1)    /**< Mask = 2^HBITS-1 */
+
+//#define DEBUG_NORM
+
+#ifdef DEBUG_NORM  /* Add an extra location to track chunk extension */
+#define MPV_B448_60 NLEN_B448_60
+#define MNV_B448_60 (NLEN_B448_60+1)
+#define DMPV_B448_60 DNLEN_B448_60
+#define DMNV_B448_60 (DNLEN_B448_60+1)
+
+#endif
+
+namespace B448_60 {
+
+//extern int BIGMULS;
+//extern int BIGSQRS;
+
+#ifdef DEBUG_NORM
+typedef chunk BIG[NLEN_B448_60 + 2]; /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B448_60 + 2]; /**< Define type DBIG as array of chunks */
+#else
+typedef chunk BIG[NLEN_B448_60];     /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B448_60];   /**< Define type DBIG as array of chunks */
+#endif
+
+/* BIG number prototypes */
+
+/**	@brief Tests for BIG equal to zero (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_iszilch(BIG x);
+/**	@brief Tests for BIG equal to one (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if one, else returns 0
+ */
+extern int BIG_isunity(BIG x);
+/**	@brief Tests for DBIG equal to zero (Constant Time)
+ *
+	@param x a DBIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_diszilch(DBIG x);
+/**	@brief Outputs a BIG number to the console (Variable Time)
+ *
+	@param x a BIG number
+ */
+extern void BIG_output(BIG x);
+/**	@brief Outputs a BIG number to the console in raw form (Variable Time for debugging)
+ *
+	@param x a BIG number
+ */
+extern void BIG_rawoutput(BIG x);
+/**	@brief Conditional constant time swap of two BIG numbers
+ *
+	Conditionally swaps parameters in constant time (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s swap takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cswap(BIG x, BIG y, int s);
+/**	@brief Conditional copy of BIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cmove(BIG x, BIG y, int s);
+/**	@brief Conditional copy of DBIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a DBIG number
+	@param y another DBIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_dcmove(BIG x, BIG y, int s);
+/**	@brief Convert from BIG number to byte array (Constant Time)
+ *
+	@param a byte array
+	@param x BIG number
+ */
+extern void BIG_toBytes(char *a, BIG x);
+/**	@brief Convert to BIG number from byte array (Constant Time)
+ *
+	@param x BIG number
+	@param a byte array
+ */
+extern void BIG_fromBytes(BIG x, char *a);
+/**	@brief Convert to BIG number from byte array of given length (Variable Time)
+ *
+	@param x BIG number
+	@param a byte array
+	@param s byte array length
+ */
+extern void BIG_fromBytesLen(BIG x, char *a, int s);
+/**@brief Convert to DBIG number from byte array of given length (Variable Time)
+ *
+   @param x DBIG number
+   @param a byte array
+   @param s byte array length
+ */
+extern void BIG_dfromBytesLen(DBIG x, char *a, int s);
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_doutput(DBIG x); 
+
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_drawoutput(DBIG x);
+
+/**	@brief Copy BIG from Read-Only Memory to a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number in ROM
+ */
+extern void BIG_rcopy(BIG x, const BIG y);
+/**	@brief Copy BIG to another BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_copy(BIG x, BIG y);
+/**	@brief Copy DBIG to another DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_dcopy(DBIG x, DBIG y);
+/**	@brief Copy BIG to upper half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dsucopy(DBIG x, BIG y);
+/**	@brief Copy BIG to lower half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dscopy(DBIG x, BIG y);
+/**	@brief Copy lower half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sdcopy(BIG x, DBIG y);
+/**	@brief Copy upper half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sducopy(BIG x, DBIG y);
+/**	@brief Set BIG to zero (Constant Time)
+ *
+	@param x BIG number to be set to zero  
+ */
+extern void BIG_zero(BIG x);
+/**	@brief Set DBIG to zero (Constant Time)
+ *
+	@param x DBIG number to be set to zero
+ */
+extern void BIG_dzero(DBIG x);
+/**	@brief Set BIG to one (unity) (Constant Time)
+ *
+	@param x BIG number to be set to one.
+ */
+extern void BIG_one(BIG x);
+/**	@brief Set BIG to inverse mod 2^256 (Constant Time)
+ *
+	@param x BIG number to be inverted
+ */
+extern void BIG_invmod2m(BIG x);
+/**	@brief Set BIG to sum of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, sum of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_add(BIG x, BIG y, BIG z);
+
+/**	@brief Set BIG to logical or of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, or of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_or(BIG x, BIG y, BIG z);
+
+/**	@brief Increment BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be incremented
+	@param i integer
+ */
+extern void BIG_inc(BIG x, int i);
+/**	@brief Set BIG to difference of two BIGs (Constant Time)
+ *
+	@param x BIG number, difference of other two - output not normalised
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_sub(BIG x, BIG y, BIG z);
+/**	@brief Decrement BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be decremented
+	@param i integer
+ */
+extern void BIG_dec(BIG x, int i);
+/**	@brief Set DBIG to sum of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, sum of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dadd(DBIG x, DBIG y, DBIG z);
+/**	@brief Set DBIG to difference of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, difference of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dsub(DBIG x, DBIG y, DBIG z);
+/**	@brief Multiply BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_imul(BIG x, BIG y, int i);
+/**	@brief Multiply BIG by not-so-small small integer - output normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+	@return Overflowing bits
+ */
+extern chunk BIG_pmul(BIG x, BIG y, int i);
+/**	@brief Divide BIG by 3 - output normalised (Constant Time)
+ *
+	@param x BIG number
+	@return Remainder
+ */
+extern int BIG_div3(BIG x);
+/**	@brief Multiply BIG by even bigger small integer resulting in a DBIG - output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_pxmul(DBIG x, BIG y, int i);
+/**	@brief Multiply BIG by another BIG resulting in DBIG - inputs normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_mul(DBIG x, BIG y, BIG z);
+/**	@brief Multiply BIG by another BIG resulting in another BIG - inputs normalised and output normalised (Constant Time)
+ *
+	Note that the product must fit into a BIG, and x must be distinct from y and z
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_smul(BIG x, BIG y, BIG z);
+/**	@brief Square BIG resulting in a DBIG - input normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, square of a BIG
+	@param y BIG number to be squared
+ */
+extern void BIG_sqr(DBIG x, BIG y);
+
+/**	@brief Montgomery reduction of a DBIG to a BIG  - input normalised and output normalised (Constant Time)
+ *
+	@param a BIG number, reduction of a BIG
+	@param md BIG number, the modulus
+	@param MC the Montgomery Constant
+	@param d DBIG number to be reduced
+ */
+extern void BIG_monty(BIG a, BIG md, chunk MC, DBIG d);
+
+/**	@brief Shifts a BIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shl(BIG x, int s);
+/**	@brief Fast shifts a BIG left by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Overflow bits
+ */
+extern int BIG_fshl(BIG x, int s);
+/**	@brief Shifts a DBIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshl(DBIG x, int s);
+/**	@brief Shifts a BIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shr(BIG x, int s);
+
+
+/**	@brief Fast time-critical combined shift by 1 bit, subtract and normalise (Constant Time)
+ *
+	@param r BIG number normalised output
+	@param a BIG number to be subtracted from
+	@param m BIG number to be shifted and subtracted
+	@return sign of r
+ */
+extern int BIG_ssn(BIG r, BIG a, BIG m);
+
+/**	@brief Fast shifts a BIG right by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Shifted out bits
+ */
+extern int BIG_fshr(BIG x, int s);
+/**	@brief Shifts a DBIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshr(DBIG x, int s);
+/**	@brief Splits a DBIG into two BIGs - input must be normalised, outputs normalised (Constant Time as used)
+ *
+	Internal function. The value of s must be approximately in the middle of the DBIG.
+	Typically used to extract z mod 2^MODBITS and z/2^MODBITS
+	@param x BIG number, top half of z
+	@param y BIG number, bottom half of z
+	@param z DBIG number to be split in two.
+	@param s Bit position at which to split
+	@return carry-out from top half
+ */
+extern chunk BIG_split(BIG x, BIG y, DBIG z, int s);
+/**	@brief Normalizes a BIG number - output normalised (Constant Time)
+ *
+	All digits of the input BIG are reduced mod 2^BASEBITS
+	@param x BIG number to be normalised
+ */
+extern chunk BIG_norm(BIG x);
+/**	@brief Normalizes a DBIG number - output normalised (Constant Time)
+ *
+	All digits of the input DBIG are reduced mod 2^BASEBITS
+	@param x DBIG number to be normalised
+ */
+extern void BIG_dnorm(DBIG x);
+/**	@brief Compares two BIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first BIG number to be compared
+	@param y second BIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_comp(BIG x, BIG y);
+/**	@brief Compares two DBIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first DBIG number to be compared
+	@param y second DBIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_dcomp(DBIG x, DBIG y);
+/**	@brief Calculate number of bits in a BIG - output normalised (Variable Time)
+ *
+	@param x BIG number
+	@return Number of bits in x
+ */
+extern int BIG_nbits(BIG x);
+/**	@brief Calculate number of bits in a DBIG - output normalised (Variable Time)
+ *
+	@param x DBIG number
+	@return Number of bits in x
+ */
+extern int BIG_dnbits(DBIG x);
+
+/**	@brief Reduce x mod n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctmod(BIG x, BIG n, int bd);
+
+/**	@brief  x=y mod n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctdmod(BIG x, DBIG y, BIG n, int bd);
+
+/**	@brief Divide x by n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctsdiv(BIG x,BIG n,int bd);
+
+/**	@brief  x=y/n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctddiv(BIG x, DBIG y, BIG n,int bd);
+
+
+/**	@brief Reduce x mod n - input and output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+ */
+extern void BIG_mod(BIG x, BIG n);
+/**	@brief Divide x by n - output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+ */
+extern void BIG_sdiv(BIG x, BIG n);
+/**	@brief  x=y mod n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_dmod(BIG x, DBIG y, BIG n);
+/**	@brief  x=y/n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_ddiv(BIG x, DBIG y, BIG n);
+/**	@brief  return parity of BIG, that is the least significant bit (Constant Time)
+ *
+	@param x BIG number
+	@return 0 or 1
+ */
+extern int BIG_parity(BIG x);
+/**	@brief  return i-th of BIG (Constant Time)
+ *
+	@param x BIG number
+	@param i the bit of x to be returned
+	@return 0 or 1
+ */
+extern int BIG_bit(BIG x, int i);
+/**	@brief  return least significant bits of a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param n number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int BIG_lastbits(BIG x, int n);
+/**	@brief  Create a random BIG from a random number generator (Constant Time)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_random(BIG x, csprng *r);
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randomnum(BIG x, BIG n, csprng *r);
+
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus and truncated to max bit length (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param t Maximum bit length
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randtrunc(BIG x, BIG n, int t, csprng *r);
+
+/**	brief  return NAF (Non-Adjacent-Form) value as +/- 1, 3 or 5, inputs must be normalised
+ *
+	Given x and 3*x extracts NAF value from given bit position, and returns number of bits processed, and number of trailing zeros detected if any
+	param x BIG number
+	param x3 BIG number, three times x
+	param i bit position
+	param nbs pointer to integer returning number of bits processed
+	param nzs pointer to integer returning number of trailing 0s
+	return + or - 1, 3 or 5
+*/
+
+/**	@brief  Calculate x=y*z mod n (Variable Time)
+ *
+	Slow method for modular multiplication
+	@param x BIG number, on exit = y*z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modmul(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y/z mod n (Variable Time)
+ *
+	Slow method for modular division
+	@param x BIG number, on exit = y/z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_moddiv(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y^2 mod n (Variable Time)
+ *
+	Slow method for modular squaring
+	@param x BIG number, on exit = y^2 mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modsqr(BIG x, BIG y, BIG n);
+/**	@brief  Calculate x=-y mod n (Variable Time)
+ *
+	Modular negation
+	@param x BIG number, on exit = -y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modneg(BIG x, BIG y, BIG n);
+
+/**	@brief  Calculate x=y+z mod n (Variable Time)
+ *
+	Slow method for modular addition
+	@param x BIG number, on exit = y+z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modadd(BIG x, BIG y, BIG z, BIG n);
+
+/**	@brief  Calculate jacobi Symbol (x/y) (Variable Time)
+ *
+	@param x BIG number
+	@param y BIG number
+	@return Jacobi symbol, -1,0 or 1
+ */
+extern int BIG_jacobi(BIG x, BIG y);
+/**	@brief  Calculate x=1/y mod n (Variable Time)
+ *
+	Modular Inversion - This is slow. Uses binary method.
+	@param x BIG number, on exit = 1/y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_invmodp(BIG x, BIG y, BIG n);
+/** @brief Calculate x=x mod 2^m (Variable Time)
+ *
+	Truncation
+	@param x BIG number, on reduced mod 2^m
+	@param m new truncated size
+*/
+extern void BIG_mod2m(BIG x, int m);
+
+/**	@brief Calculates a*b+c+*d
+ *
+	Calculate partial product of a.b, add in carry c, and add total to d (Constant Time)
+	@param a multiplier
+	@param b multiplicand
+	@param c carry
+	@param d pointer to accumulated bottom half of result
+	@return top half of result
+ */
+
+
+extern int step1(BIG,BIG,BIG);
+extern void step2(BIG,BIG,BIG);
+
+#ifdef dchunk
+
+/* Method required to calculate x*y+c+r, bottom half in r, top half returned */
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    dchunk prod = (dchunk)x * y + c + *r;
+    *r = (chunk)prod & BMASK_B448_60;
+    return (chunk)(prod >> BASEBITS_B448_60);
+}
+
+#else
+
+/* No integer type available that can store double the wordlength */
+/* accumulate partial products */
+
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    chunk x0, x1, y0, y1;
+    chunk bot, top, mid, carry;
+    x0 = x & HMASK_B448_60;
+    x1 = (x >> HBITS_B448_60);
+    y0 = y & HMASK_B448_60;
+    y1 = (y >> HBITS_B448_60);
+    bot = x0 * y0;
+    top = x1 * y1;
+    mid = x0 * y1 + x1 * y0;
+    x0 = mid & HMASK_B448_60;
+    x1 = (mid >> HBITS_B448_60);
+    bot += x0 << HBITS_B448_60;
+    bot += *r;
+    bot += c;
+
+    top += x1;
+    carry = bot >> BASEBITS_B448_60;
+    bot &= BMASK_B448_60;
+    top += carry;
+
+    *r = bot;
+    return top;
+}
+
+#endif
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/big_B464_60.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/big_B464_60.h
new file mode 100644
index 0000000..0af3c14
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/big_B464_60.h
@@ -0,0 +1,697 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file big.h
+ * @author Mike Scott
+ * @date 23rd February 2016
+ * @brief Big number Header File
+ *
+ *
+ */
+
+#ifndef BIG_B464_60_H
+#define BIG_B464_60_H
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <inttypes.h>
+#include "arch.h"
+#include "core.h"
+#include "config_big_B464_60.h"
+
+using namespace core;
+
+/* could comment this out if code size is a major issue */
+#define UNWOUND
+/* Normally recommended, but may not be optimal for some architectures, for example 32-bit ARM M4 */
+#define USE_KARATSUBA
+
+#define BIGBITS_B464_60 (8*MODBYTES_B464_60)
+#define NLEN_B464_60 (1+((8*MODBYTES_B464_60-1)/BASEBITS_B464_60))
+#define DNLEN_B464_60 2*NLEN_B464_60
+#define BMASK_B464_60 (((chunk)1<<BASEBITS_B464_60)-1) /**< Mask = 2^BASEBITS-1 */
+#define NEXCESS_B464_60 (1<<(CHUNK-BASEBITS_B464_60-1))           /**< 2^(CHUNK-BASEBITS-1) - digit cannot be multiplied by more than this before normalisation */
+
+#define HBITS_B464_60 (BASEBITS_B464_60/2)      /**< Number of bits in number base divided by 2 */
+#define HMASK_B464_60 (((chunk)1<<HBITS_B464_60)-1)    /**< Mask = 2^HBITS-1 */
+
+//#define DEBUG_NORM
+
+#ifdef DEBUG_NORM  /* Add an extra location to track chunk extension */
+#define MPV_B464_60 NLEN_B464_60
+#define MNV_B464_60 (NLEN_B464_60+1)
+#define DMPV_B464_60 DNLEN_B464_60
+#define DMNV_B464_60 (DNLEN_B464_60+1)
+
+#endif
+
+namespace B464_60 {
+
+//extern int BIGMULS;
+//extern int BIGSQRS;
+
+#ifdef DEBUG_NORM
+typedef chunk BIG[NLEN_B464_60 + 2]; /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B464_60 + 2]; /**< Define type DBIG as array of chunks */
+#else
+typedef chunk BIG[NLEN_B464_60];     /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B464_60];   /**< Define type DBIG as array of chunks */
+#endif
+
+/* BIG number prototypes */
+
+/**	@brief Tests for BIG equal to zero (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_iszilch(BIG x);
+/**	@brief Tests for BIG equal to one (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if one, else returns 0
+ */
+extern int BIG_isunity(BIG x);
+/**	@brief Tests for DBIG equal to zero (Constant Time)
+ *
+	@param x a DBIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_diszilch(DBIG x);
+/**	@brief Outputs a BIG number to the console (Variable Time)
+ *
+	@param x a BIG number
+ */
+extern void BIG_output(BIG x);
+/**	@brief Outputs a BIG number to the console in raw form (Variable Time for debugging)
+ *
+	@param x a BIG number
+ */
+extern void BIG_rawoutput(BIG x);
+/**	@brief Conditional constant time swap of two BIG numbers
+ *
+	Conditionally swaps parameters in constant time (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s swap takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cswap(BIG x, BIG y, int s);
+/**	@brief Conditional copy of BIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cmove(BIG x, BIG y, int s);
+/**	@brief Conditional copy of DBIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a DBIG number
+	@param y another DBIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_dcmove(BIG x, BIG y, int s);
+/**	@brief Convert from BIG number to byte array (Constant Time)
+ *
+	@param a byte array
+	@param x BIG number
+ */
+extern void BIG_toBytes(char *a, BIG x);
+/**	@brief Convert to BIG number from byte array (Constant Time)
+ *
+	@param x BIG number
+	@param a byte array
+ */
+extern void BIG_fromBytes(BIG x, char *a);
+/**	@brief Convert to BIG number from byte array of given length (Variable Time)
+ *
+	@param x BIG number
+	@param a byte array
+	@param s byte array length
+ */
+extern void BIG_fromBytesLen(BIG x, char *a, int s);
+/**@brief Convert to DBIG number from byte array of given length (Variable Time)
+ *
+   @param x DBIG number
+   @param a byte array
+   @param s byte array length
+ */
+extern void BIG_dfromBytesLen(DBIG x, char *a, int s);
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_doutput(DBIG x); 
+
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_drawoutput(DBIG x);
+
+/**	@brief Copy BIG from Read-Only Memory to a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number in ROM
+ */
+extern void BIG_rcopy(BIG x, const BIG y);
+/**	@brief Copy BIG to another BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_copy(BIG x, BIG y);
+/**	@brief Copy DBIG to another DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_dcopy(DBIG x, DBIG y);
+/**	@brief Copy BIG to upper half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dsucopy(DBIG x, BIG y);
+/**	@brief Copy BIG to lower half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dscopy(DBIG x, BIG y);
+/**	@brief Copy lower half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sdcopy(BIG x, DBIG y);
+/**	@brief Copy upper half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sducopy(BIG x, DBIG y);
+/**	@brief Set BIG to zero (Constant Time)
+ *
+	@param x BIG number to be set to zero  
+ */
+extern void BIG_zero(BIG x);
+/**	@brief Set DBIG to zero (Constant Time)
+ *
+	@param x DBIG number to be set to zero
+ */
+extern void BIG_dzero(DBIG x);
+/**	@brief Set BIG to one (unity) (Constant Time)
+ *
+	@param x BIG number to be set to one.
+ */
+extern void BIG_one(BIG x);
+/**	@brief Set BIG to inverse mod 2^256 (Constant Time)
+ *
+	@param x BIG number to be inverted
+ */
+extern void BIG_invmod2m(BIG x);
+/**	@brief Set BIG to sum of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, sum of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_add(BIG x, BIG y, BIG z);
+
+/**	@brief Set BIG to logical or of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, or of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_or(BIG x, BIG y, BIG z);
+
+/**	@brief Increment BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be incremented
+	@param i integer
+ */
+extern void BIG_inc(BIG x, int i);
+/**	@brief Set BIG to difference of two BIGs (Constant Time)
+ *
+	@param x BIG number, difference of other two - output not normalised
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_sub(BIG x, BIG y, BIG z);
+/**	@brief Decrement BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be decremented
+	@param i integer
+ */
+extern void BIG_dec(BIG x, int i);
+/**	@brief Set DBIG to sum of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, sum of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dadd(DBIG x, DBIG y, DBIG z);
+/**	@brief Set DBIG to difference of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, difference of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dsub(DBIG x, DBIG y, DBIG z);
+/**	@brief Multiply BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_imul(BIG x, BIG y, int i);
+/**	@brief Multiply BIG by not-so-small small integer - output normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+	@return Overflowing bits
+ */
+extern chunk BIG_pmul(BIG x, BIG y, int i);
+/**	@brief Divide BIG by 3 - output normalised (Constant Time)
+ *
+	@param x BIG number
+	@return Remainder
+ */
+extern int BIG_div3(BIG x);
+/**	@brief Multiply BIG by even bigger small integer resulting in a DBIG - output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_pxmul(DBIG x, BIG y, int i);
+/**	@brief Multiply BIG by another BIG resulting in DBIG - inputs normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_mul(DBIG x, BIG y, BIG z);
+/**	@brief Multiply BIG by another BIG resulting in another BIG - inputs normalised and output normalised (Constant Time)
+ *
+	Note that the product must fit into a BIG, and x must be distinct from y and z
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_smul(BIG x, BIG y, BIG z);
+/**	@brief Square BIG resulting in a DBIG - input normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, square of a BIG
+	@param y BIG number to be squared
+ */
+extern void BIG_sqr(DBIG x, BIG y);
+
+/**	@brief Montgomery reduction of a DBIG to a BIG  - input normalised and output normalised (Constant Time)
+ *
+	@param a BIG number, reduction of a BIG
+	@param md BIG number, the modulus
+	@param MC the Montgomery Constant
+	@param d DBIG number to be reduced
+ */
+extern void BIG_monty(BIG a, BIG md, chunk MC, DBIG d);
+
+/**	@brief Shifts a BIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shl(BIG x, int s);
+/**	@brief Fast shifts a BIG left by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Overflow bits
+ */
+extern int BIG_fshl(BIG x, int s);
+/**	@brief Shifts a DBIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshl(DBIG x, int s);
+/**	@brief Shifts a BIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shr(BIG x, int s);
+
+
+/**	@brief Fast time-critical combined shift by 1 bit, subtract and normalise (Constant Time)
+ *
+	@param r BIG number normalised output
+	@param a BIG number to be subtracted from
+	@param m BIG number to be shifted and subtracted
+	@return sign of r
+ */
+extern int BIG_ssn(BIG r, BIG a, BIG m);
+
+/**	@brief Fast shifts a BIG right by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Shifted out bits
+ */
+extern int BIG_fshr(BIG x, int s);
+/**	@brief Shifts a DBIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshr(DBIG x, int s);
+/**	@brief Splits a DBIG into two BIGs - input must be normalised, outputs normalised (Constant Time as used)
+ *
+	Internal function. The value of s must be approximately in the middle of the DBIG.
+	Typically used to extract z mod 2^MODBITS and z/2^MODBITS
+	@param x BIG number, top half of z
+	@param y BIG number, bottom half of z
+	@param z DBIG number to be split in two.
+	@param s Bit position at which to split
+	@return carry-out from top half
+ */
+extern chunk BIG_split(BIG x, BIG y, DBIG z, int s);
+/**	@brief Normalizes a BIG number - output normalised (Constant Time)
+ *
+	All digits of the input BIG are reduced mod 2^BASEBITS
+	@param x BIG number to be normalised
+ */
+extern chunk BIG_norm(BIG x);
+/**	@brief Normalizes a DBIG number - output normalised (Constant Time)
+ *
+	All digits of the input DBIG are reduced mod 2^BASEBITS
+	@param x DBIG number to be normalised
+ */
+extern void BIG_dnorm(DBIG x);
+/**	@brief Compares two BIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first BIG number to be compared
+	@param y second BIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_comp(BIG x, BIG y);
+/**	@brief Compares two DBIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first DBIG number to be compared
+	@param y second DBIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_dcomp(DBIG x, DBIG y);
+/**	@brief Calculate number of bits in a BIG - output normalised (Variable Time)
+ *
+	@param x BIG number
+	@return Number of bits in x
+ */
+extern int BIG_nbits(BIG x);
+/**	@brief Calculate number of bits in a DBIG - output normalised (Variable Time)
+ *
+	@param x DBIG number
+	@return Number of bits in x
+ */
+extern int BIG_dnbits(DBIG x);
+
+/**	@brief Reduce x mod n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctmod(BIG x, BIG n, int bd);
+
+/**	@brief  x=y mod n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctdmod(BIG x, DBIG y, BIG n, int bd);
+
+/**	@brief Divide x by n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctsdiv(BIG x,BIG n,int bd);
+
+/**	@brief  x=y/n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctddiv(BIG x, DBIG y, BIG n,int bd);
+
+
+/**	@brief Reduce x mod n - input and output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+ */
+extern void BIG_mod(BIG x, BIG n);
+/**	@brief Divide x by n - output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+ */
+extern void BIG_sdiv(BIG x, BIG n);
+/**	@brief  x=y mod n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_dmod(BIG x, DBIG y, BIG n);
+/**	@brief  x=y/n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_ddiv(BIG x, DBIG y, BIG n);
+/**	@brief  return parity of BIG, that is the least significant bit (Constant Time)
+ *
+	@param x BIG number
+	@return 0 or 1
+ */
+extern int BIG_parity(BIG x);
+/**	@brief  return i-th of BIG (Constant Time)
+ *
+	@param x BIG number
+	@param i the bit of x to be returned
+	@return 0 or 1
+ */
+extern int BIG_bit(BIG x, int i);
+/**	@brief  return least significant bits of a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param n number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int BIG_lastbits(BIG x, int n);
+/**	@brief  Create a random BIG from a random number generator (Constant Time)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_random(BIG x, csprng *r);
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randomnum(BIG x, BIG n, csprng *r);
+
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus and truncated to max bit length (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param t Maximum bit length
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randtrunc(BIG x, BIG n, int t, csprng *r);
+
+/**	brief  return NAF (Non-Adjacent-Form) value as +/- 1, 3 or 5, inputs must be normalised
+ *
+	Given x and 3*x extracts NAF value from given bit position, and returns number of bits processed, and number of trailing zeros detected if any
+	param x BIG number
+	param x3 BIG number, three times x
+	param i bit position
+	param nbs pointer to integer returning number of bits processed
+	param nzs pointer to integer returning number of trailing 0s
+	return + or - 1, 3 or 5
+*/
+
+/**	@brief  Calculate x=y*z mod n (Variable Time)
+ *
+	Slow method for modular multiplication
+	@param x BIG number, on exit = y*z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modmul(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y/z mod n (Variable Time)
+ *
+	Slow method for modular division
+	@param x BIG number, on exit = y/z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_moddiv(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y^2 mod n (Variable Time)
+ *
+	Slow method for modular squaring
+	@param x BIG number, on exit = y^2 mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modsqr(BIG x, BIG y, BIG n);
+/**	@brief  Calculate x=-y mod n (Variable Time)
+ *
+	Modular negation
+	@param x BIG number, on exit = -y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modneg(BIG x, BIG y, BIG n);
+
+/**	@brief  Calculate x=y+z mod n (Variable Time)
+ *
+	Slow method for modular addition
+	@param x BIG number, on exit = y+z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modadd(BIG x, BIG y, BIG z, BIG n);
+
+/**	@brief  Calculate jacobi Symbol (x/y) (Variable Time)
+ *
+	@param x BIG number
+	@param y BIG number
+	@return Jacobi symbol, -1,0 or 1
+ */
+extern int BIG_jacobi(BIG x, BIG y);
+/**	@brief  Calculate x=1/y mod n (Variable Time)
+ *
+	Modular Inversion - This is slow. Uses binary method.
+	@param x BIG number, on exit = 1/y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_invmodp(BIG x, BIG y, BIG n);
+/** @brief Calculate x=x mod 2^m (Variable Time)
+ *
+	Truncation
+	@param x BIG number, on reduced mod 2^m
+	@param m new truncated size
+*/
+extern void BIG_mod2m(BIG x, int m);
+
+/**	@brief Calculates a*b+c+*d
+ *
+	Calculate partial product of a.b, add in carry c, and add total to d (Constant Time)
+	@param a multiplier
+	@param b multiplicand
+	@param c carry
+	@param d pointer to accumulated bottom half of result
+	@return top half of result
+ */
+
+
+extern int step1(BIG,BIG,BIG);
+extern void step2(BIG,BIG,BIG);
+
+#ifdef dchunk
+
+/* Method required to calculate x*y+c+r, bottom half in r, top half returned */
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    dchunk prod = (dchunk)x * y + c + *r;
+    *r = (chunk)prod & BMASK_B464_60;
+    return (chunk)(prod >> BASEBITS_B464_60);
+}
+
+#else
+
+/* No integer type available that can store double the wordlength */
+/* accumulate partial products */
+
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    chunk x0, x1, y0, y1;
+    chunk bot, top, mid, carry;
+    x0 = x & HMASK_B464_60;
+    x1 = (x >> HBITS_B464_60);
+    y0 = y & HMASK_B464_60;
+    y1 = (y >> HBITS_B464_60);
+    bot = x0 * y0;
+    top = x1 * y1;
+    mid = x0 * y1 + x1 * y0;
+    x0 = mid & HMASK_B464_60;
+    x1 = (mid >> HBITS_B464_60);
+    bot += x0 << HBITS_B464_60;
+    bot += *r;
+    bot += c;
+
+    top += x1;
+    carry = bot >> BASEBITS_B464_60;
+    bot &= BMASK_B464_60;
+    top += carry;
+
+    *r = bot;
+    return top;
+}
+
+#endif
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/big_B480_56.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/big_B480_56.h
new file mode 100644
index 0000000..7c76010
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/big_B480_56.h
@@ -0,0 +1,697 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file big.h
+ * @author Mike Scott
+ * @date 23rd February 2016
+ * @brief Big number Header File
+ *
+ *
+ */
+
+#ifndef BIG_B480_56_H
+#define BIG_B480_56_H
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <inttypes.h>
+#include "arch.h"
+#include "core.h"
+#include "config_big_B480_56.h"
+
+using namespace core;
+
+/* could comment this out if code size is a major issue */
+#define UNWOUND
+/* Normally recommended, but may not be optimal for some architectures, for example 32-bit ARM M4 */
+#define USE_KARATSUBA
+
+#define BIGBITS_B480_56 (8*MODBYTES_B480_56)
+#define NLEN_B480_56 (1+((8*MODBYTES_B480_56-1)/BASEBITS_B480_56))
+#define DNLEN_B480_56 2*NLEN_B480_56
+#define BMASK_B480_56 (((chunk)1<<BASEBITS_B480_56)-1) /**< Mask = 2^BASEBITS-1 */
+#define NEXCESS_B480_56 (1<<(CHUNK-BASEBITS_B480_56-1))           /**< 2^(CHUNK-BASEBITS-1) - digit cannot be multiplied by more than this before normalisation */
+
+#define HBITS_B480_56 (BASEBITS_B480_56/2)      /**< Number of bits in number base divided by 2 */
+#define HMASK_B480_56 (((chunk)1<<HBITS_B480_56)-1)    /**< Mask = 2^HBITS-1 */
+
+//#define DEBUG_NORM
+
+#ifdef DEBUG_NORM  /* Add an extra location to track chunk extension */
+#define MPV_B480_56 NLEN_B480_56
+#define MNV_B480_56 (NLEN_B480_56+1)
+#define DMPV_B480_56 DNLEN_B480_56
+#define DMNV_B480_56 (DNLEN_B480_56+1)
+
+#endif
+
+namespace B480_56 {
+
+//extern int BIGMULS;
+//extern int BIGSQRS;
+
+#ifdef DEBUG_NORM
+typedef chunk BIG[NLEN_B480_56 + 2]; /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B480_56 + 2]; /**< Define type DBIG as array of chunks */
+#else
+typedef chunk BIG[NLEN_B480_56];     /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B480_56];   /**< Define type DBIG as array of chunks */
+#endif
+
+/* BIG number prototypes */
+
+/**	@brief Tests for BIG equal to zero (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_iszilch(BIG x);
+/**	@brief Tests for BIG equal to one (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if one, else returns 0
+ */
+extern int BIG_isunity(BIG x);
+/**	@brief Tests for DBIG equal to zero (Constant Time)
+ *
+	@param x a DBIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_diszilch(DBIG x);
+/**	@brief Outputs a BIG number to the console (Variable Time)
+ *
+	@param x a BIG number
+ */
+extern void BIG_output(BIG x);
+/**	@brief Outputs a BIG number to the console in raw form (Variable Time for debugging)
+ *
+	@param x a BIG number
+ */
+extern void BIG_rawoutput(BIG x);
+/**	@brief Conditional constant time swap of two BIG numbers
+ *
+	Conditionally swaps parameters in constant time (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s swap takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cswap(BIG x, BIG y, int s);
+/**	@brief Conditional copy of BIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cmove(BIG x, BIG y, int s);
+/**	@brief Conditional copy of DBIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a DBIG number
+	@param y another DBIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_dcmove(BIG x, BIG y, int s);
+/**	@brief Convert from BIG number to byte array (Constant Time)
+ *
+	@param a byte array
+	@param x BIG number
+ */
+extern void BIG_toBytes(char *a, BIG x);
+/**	@brief Convert to BIG number from byte array (Constant Time)
+ *
+	@param x BIG number
+	@param a byte array
+ */
+extern void BIG_fromBytes(BIG x, char *a);
+/**	@brief Convert to BIG number from byte array of given length (Variable Time)
+ *
+	@param x BIG number
+	@param a byte array
+	@param s byte array length
+ */
+extern void BIG_fromBytesLen(BIG x, char *a, int s);
+/**@brief Convert to DBIG number from byte array of given length (Variable Time)
+ *
+   @param x DBIG number
+   @param a byte array
+   @param s byte array length
+ */
+extern void BIG_dfromBytesLen(DBIG x, char *a, int s);
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_doutput(DBIG x); 
+
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_drawoutput(DBIG x);
+
+/**	@brief Copy BIG from Read-Only Memory to a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number in ROM
+ */
+extern void BIG_rcopy(BIG x, const BIG y);
+/**	@brief Copy BIG to another BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_copy(BIG x, BIG y);
+/**	@brief Copy DBIG to another DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_dcopy(DBIG x, DBIG y);
+/**	@brief Copy BIG to upper half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dsucopy(DBIG x, BIG y);
+/**	@brief Copy BIG to lower half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dscopy(DBIG x, BIG y);
+/**	@brief Copy lower half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sdcopy(BIG x, DBIG y);
+/**	@brief Copy upper half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sducopy(BIG x, DBIG y);
+/**	@brief Set BIG to zero (Constant Time)
+ *
+	@param x BIG number to be set to zero  
+ */
+extern void BIG_zero(BIG x);
+/**	@brief Set DBIG to zero (Constant Time)
+ *
+	@param x DBIG number to be set to zero
+ */
+extern void BIG_dzero(DBIG x);
+/**	@brief Set BIG to one (unity) (Constant Time)
+ *
+	@param x BIG number to be set to one.
+ */
+extern void BIG_one(BIG x);
+/**	@brief Set BIG to inverse mod 2^256 (Constant Time)
+ *
+	@param x BIG number to be inverted
+ */
+extern void BIG_invmod2m(BIG x);
+/**	@brief Set BIG to sum of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, sum of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_add(BIG x, BIG y, BIG z);
+
+/**	@brief Set BIG to logical or of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, or of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_or(BIG x, BIG y, BIG z);
+
+/**	@brief Increment BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be incremented
+	@param i integer
+ */
+extern void BIG_inc(BIG x, int i);
+/**	@brief Set BIG to difference of two BIGs (Constant Time)
+ *
+	@param x BIG number, difference of other two - output not normalised
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_sub(BIG x, BIG y, BIG z);
+/**	@brief Decrement BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be decremented
+	@param i integer
+ */
+extern void BIG_dec(BIG x, int i);
+/**	@brief Set DBIG to sum of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, sum of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dadd(DBIG x, DBIG y, DBIG z);
+/**	@brief Set DBIG to difference of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, difference of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dsub(DBIG x, DBIG y, DBIG z);
+/**	@brief Multiply BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_imul(BIG x, BIG y, int i);
+/**	@brief Multiply BIG by not-so-small small integer - output normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+	@return Overflowing bits
+ */
+extern chunk BIG_pmul(BIG x, BIG y, int i);
+/**	@brief Divide BIG by 3 - output normalised (Constant Time)
+ *
+	@param x BIG number
+	@return Remainder
+ */
+extern int BIG_div3(BIG x);
+/**	@brief Multiply BIG by even bigger small integer resulting in a DBIG - output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_pxmul(DBIG x, BIG y, int i);
+/**	@brief Multiply BIG by another BIG resulting in DBIG - inputs normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_mul(DBIG x, BIG y, BIG z);
+/**	@brief Multiply BIG by another BIG resulting in another BIG - inputs normalised and output normalised (Constant Time)
+ *
+	Note that the product must fit into a BIG, and x must be distinct from y and z
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_smul(BIG x, BIG y, BIG z);
+/**	@brief Square BIG resulting in a DBIG - input normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, square of a BIG
+	@param y BIG number to be squared
+ */
+extern void BIG_sqr(DBIG x, BIG y);
+
+/**	@brief Montgomery reduction of a DBIG to a BIG  - input normalised and output normalised (Constant Time)
+ *
+	@param a BIG number, reduction of a BIG
+	@param md BIG number, the modulus
+	@param MC the Montgomery Constant
+	@param d DBIG number to be reduced
+ */
+extern void BIG_monty(BIG a, BIG md, chunk MC, DBIG d);
+
+/**	@brief Shifts a BIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shl(BIG x, int s);
+/**	@brief Fast shifts a BIG left by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Overflow bits
+ */
+extern int BIG_fshl(BIG x, int s);
+/**	@brief Shifts a DBIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshl(DBIG x, int s);
+/**	@brief Shifts a BIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shr(BIG x, int s);
+
+
+/**	@brief Fast time-critical combined shift by 1 bit, subtract and normalise (Constant Time)
+ *
+	@param r BIG number normalised output
+	@param a BIG number to be subtracted from
+	@param m BIG number to be shifted and subtracted
+	@return sign of r
+ */
+extern int BIG_ssn(BIG r, BIG a, BIG m);
+
+/**	@brief Fast shifts a BIG right by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Shifted out bits
+ */
+extern int BIG_fshr(BIG x, int s);
+/**	@brief Shifts a DBIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshr(DBIG x, int s);
+/**	@brief Splits a DBIG into two BIGs - input must be normalised, outputs normalised (Constant Time as used)
+ *
+	Internal function. The value of s must be approximately in the middle of the DBIG.
+	Typically used to extract z mod 2^MODBITS and z/2^MODBITS
+	@param x BIG number, top half of z
+	@param y BIG number, bottom half of z
+	@param z DBIG number to be split in two.
+	@param s Bit position at which to split
+	@return carry-out from top half
+ */
+extern chunk BIG_split(BIG x, BIG y, DBIG z, int s);
+/**	@brief Normalizes a BIG number - output normalised (Constant Time)
+ *
+	All digits of the input BIG are reduced mod 2^BASEBITS
+	@param x BIG number to be normalised
+ */
+extern chunk BIG_norm(BIG x);
+/**	@brief Normalizes a DBIG number - output normalised (Constant Time)
+ *
+	All digits of the input DBIG are reduced mod 2^BASEBITS
+	@param x DBIG number to be normalised
+ */
+extern void BIG_dnorm(DBIG x);
+/**	@brief Compares two BIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first BIG number to be compared
+	@param y second BIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_comp(BIG x, BIG y);
+/**	@brief Compares two DBIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first DBIG number to be compared
+	@param y second DBIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_dcomp(DBIG x, DBIG y);
+/**	@brief Calculate number of bits in a BIG - output normalised (Variable Time)
+ *
+	@param x BIG number
+	@return Number of bits in x
+ */
+extern int BIG_nbits(BIG x);
+/**	@brief Calculate number of bits in a DBIG - output normalised (Variable Time)
+ *
+	@param x DBIG number
+	@return Number of bits in x
+ */
+extern int BIG_dnbits(DBIG x);
+
+/**	@brief Reduce x mod n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctmod(BIG x, BIG n, int bd);
+
+/**	@brief  x=y mod n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctdmod(BIG x, DBIG y, BIG n, int bd);
+
+/**	@brief Divide x by n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctsdiv(BIG x,BIG n,int bd);
+
+/**	@brief  x=y/n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctddiv(BIG x, DBIG y, BIG n,int bd);
+
+
+/**	@brief Reduce x mod n - input and output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+ */
+extern void BIG_mod(BIG x, BIG n);
+/**	@brief Divide x by n - output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+ */
+extern void BIG_sdiv(BIG x, BIG n);
+/**	@brief  x=y mod n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_dmod(BIG x, DBIG y, BIG n);
+/**	@brief  x=y/n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_ddiv(BIG x, DBIG y, BIG n);
+/**	@brief  return parity of BIG, that is the least significant bit (Constant Time)
+ *
+	@param x BIG number
+	@return 0 or 1
+ */
+extern int BIG_parity(BIG x);
+/**	@brief  return i-th of BIG (Constant Time)
+ *
+	@param x BIG number
+	@param i the bit of x to be returned
+	@return 0 or 1
+ */
+extern int BIG_bit(BIG x, int i);
+/**	@brief  return least significant bits of a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param n number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int BIG_lastbits(BIG x, int n);
+/**	@brief  Create a random BIG from a random number generator (Constant Time)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_random(BIG x, csprng *r);
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randomnum(BIG x, BIG n, csprng *r);
+
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus and truncated to max bit length (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param t Maximum bit length
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randtrunc(BIG x, BIG n, int t, csprng *r);
+
+/**	brief  return NAF (Non-Adjacent-Form) value as +/- 1, 3 or 5, inputs must be normalised
+ *
+	Given x and 3*x extracts NAF value from given bit position, and returns number of bits processed, and number of trailing zeros detected if any
+	param x BIG number
+	param x3 BIG number, three times x
+	param i bit position
+	param nbs pointer to integer returning number of bits processed
+	param nzs pointer to integer returning number of trailing 0s
+	return + or - 1, 3 or 5
+*/
+
+/**	@brief  Calculate x=y*z mod n (Variable Time)
+ *
+	Slow method for modular multiplication
+	@param x BIG number, on exit = y*z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modmul(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y/z mod n (Variable Time)
+ *
+	Slow method for modular division
+	@param x BIG number, on exit = y/z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_moddiv(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y^2 mod n (Variable Time)
+ *
+	Slow method for modular squaring
+	@param x BIG number, on exit = y^2 mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modsqr(BIG x, BIG y, BIG n);
+/**	@brief  Calculate x=-y mod n (Variable Time)
+ *
+	Modular negation
+	@param x BIG number, on exit = -y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modneg(BIG x, BIG y, BIG n);
+
+/**	@brief  Calculate x=y+z mod n (Variable Time)
+ *
+	Slow method for modular addition
+	@param x BIG number, on exit = y+z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modadd(BIG x, BIG y, BIG z, BIG n);
+
+/**	@brief  Calculate jacobi Symbol (x/y) (Variable Time)
+ *
+	@param x BIG number
+	@param y BIG number
+	@return Jacobi symbol, -1,0 or 1
+ */
+extern int BIG_jacobi(BIG x, BIG y);
+/**	@brief  Calculate x=1/y mod n (Variable Time)
+ *
+	Modular Inversion - This is slow. Uses binary method.
+	@param x BIG number, on exit = 1/y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_invmodp(BIG x, BIG y, BIG n);
+/** @brief Calculate x=x mod 2^m (Variable Time)
+ *
+	Truncation
+	@param x BIG number, on reduced mod 2^m
+	@param m new truncated size
+*/
+extern void BIG_mod2m(BIG x, int m);
+
+/**	@brief Calculates a*b+c+*d
+ *
+	Calculate partial product of a.b, add in carry c, and add total to d (Constant Time)
+	@param a multiplier
+	@param b multiplicand
+	@param c carry
+	@param d pointer to accumulated bottom half of result
+	@return top half of result
+ */
+
+
+extern int step1(BIG,BIG,BIG);
+extern void step2(BIG,BIG,BIG);
+
+#ifdef dchunk
+
+/* Method required to calculate x*y+c+r, bottom half in r, top half returned */
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    dchunk prod = (dchunk)x * y + c + *r;
+    *r = (chunk)prod & BMASK_B480_56;
+    return (chunk)(prod >> BASEBITS_B480_56);
+}
+
+#else
+
+/* No integer type available that can store double the wordlength */
+/* accumulate partial products */
+
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    chunk x0, x1, y0, y1;
+    chunk bot, top, mid, carry;
+    x0 = x & HMASK_B480_56;
+    x1 = (x >> HBITS_B480_56);
+    y0 = y & HMASK_B480_56;
+    y1 = (y >> HBITS_B480_56);
+    bot = x0 * y0;
+    top = x1 * y1;
+    mid = x0 * y1 + x1 * y0;
+    x0 = mid & HMASK_B480_56;
+    x1 = (mid >> HBITS_B480_56);
+    bot += x0 << HBITS_B480_56;
+    bot += *r;
+    bot += c;
+
+    top += x1;
+    carry = bot >> BASEBITS_B480_56;
+    bot &= BMASK_B480_56;
+    top += carry;
+
+    *r = bot;
+    return top;
+}
+
+#endif
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/big_B512_60.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/big_B512_60.h
new file mode 100644
index 0000000..fa72a4a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/big_B512_60.h
@@ -0,0 +1,697 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file big.h
+ * @author Mike Scott
+ * @date 23rd February 2016
+ * @brief Big number Header File
+ *
+ *
+ */
+
+#ifndef BIG_B512_60_H
+#define BIG_B512_60_H
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <inttypes.h>
+#include "arch.h"
+#include "core.h"
+#include "config_big_B512_60.h"
+
+using namespace core;
+
+/* could comment this out if code size is a major issue */
+#define UNWOUND
+/* Normally recommended, but may not be optimal for some architectures, for example 32-bit ARM M4 */
+#define USE_KARATSUBA
+
+#define BIGBITS_B512_60 (8*MODBYTES_B512_60)
+#define NLEN_B512_60 (1+((8*MODBYTES_B512_60-1)/BASEBITS_B512_60))
+#define DNLEN_B512_60 2*NLEN_B512_60
+#define BMASK_B512_60 (((chunk)1<<BASEBITS_B512_60)-1) /**< Mask = 2^BASEBITS-1 */
+#define NEXCESS_B512_60 (1<<(CHUNK-BASEBITS_B512_60-1))           /**< 2^(CHUNK-BASEBITS-1) - digit cannot be multiplied by more than this before normalisation */
+
+#define HBITS_B512_60 (BASEBITS_B512_60/2)      /**< Number of bits in number base divided by 2 */
+#define HMASK_B512_60 (((chunk)1<<HBITS_B512_60)-1)    /**< Mask = 2^HBITS-1 */
+
+//#define DEBUG_NORM
+
+#ifdef DEBUG_NORM  /* Add an extra location to track chunk extension */
+#define MPV_B512_60 NLEN_B512_60
+#define MNV_B512_60 (NLEN_B512_60+1)
+#define DMPV_B512_60 DNLEN_B512_60
+#define DMNV_B512_60 (DNLEN_B512_60+1)
+
+#endif
+
+namespace B512_60 {
+
+//extern int BIGMULS;
+//extern int BIGSQRS;
+
+#ifdef DEBUG_NORM
+typedef chunk BIG[NLEN_B512_60 + 2]; /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B512_60 + 2]; /**< Define type DBIG as array of chunks */
+#else
+typedef chunk BIG[NLEN_B512_60];     /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B512_60];   /**< Define type DBIG as array of chunks */
+#endif
+
+/* BIG number prototypes */
+
+/**	@brief Tests for BIG equal to zero (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_iszilch(BIG x);
+/**	@brief Tests for BIG equal to one (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if one, else returns 0
+ */
+extern int BIG_isunity(BIG x);
+/**	@brief Tests for DBIG equal to zero (Constant Time)
+ *
+	@param x a DBIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_diszilch(DBIG x);
+/**	@brief Outputs a BIG number to the console (Variable Time)
+ *
+	@param x a BIG number
+ */
+extern void BIG_output(BIG x);
+/**	@brief Outputs a BIG number to the console in raw form (Variable Time for debugging)
+ *
+	@param x a BIG number
+ */
+extern void BIG_rawoutput(BIG x);
+/**	@brief Conditional constant time swap of two BIG numbers
+ *
+	Conditionally swaps parameters in constant time (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s swap takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cswap(BIG x, BIG y, int s);
+/**	@brief Conditional copy of BIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cmove(BIG x, BIG y, int s);
+/**	@brief Conditional copy of DBIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a DBIG number
+	@param y another DBIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_dcmove(BIG x, BIG y, int s);
+/**	@brief Convert from BIG number to byte array (Constant Time)
+ *
+	@param a byte array
+	@param x BIG number
+ */
+extern void BIG_toBytes(char *a, BIG x);
+/**	@brief Convert to BIG number from byte array (Constant Time)
+ *
+	@param x BIG number
+	@param a byte array
+ */
+extern void BIG_fromBytes(BIG x, char *a);
+/**	@brief Convert to BIG number from byte array of given length (Variable Time)
+ *
+	@param x BIG number
+	@param a byte array
+	@param s byte array length
+ */
+extern void BIG_fromBytesLen(BIG x, char *a, int s);
+/**@brief Convert to DBIG number from byte array of given length (Variable Time)
+ *
+   @param x DBIG number
+   @param a byte array
+   @param s byte array length
+ */
+extern void BIG_dfromBytesLen(DBIG x, char *a, int s);
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_doutput(DBIG x); 
+
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_drawoutput(DBIG x);
+
+/**	@brief Copy BIG from Read-Only Memory to a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number in ROM
+ */
+extern void BIG_rcopy(BIG x, const BIG y);
+/**	@brief Copy BIG to another BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_copy(BIG x, BIG y);
+/**	@brief Copy DBIG to another DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_dcopy(DBIG x, DBIG y);
+/**	@brief Copy BIG to upper half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dsucopy(DBIG x, BIG y);
+/**	@brief Copy BIG to lower half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dscopy(DBIG x, BIG y);
+/**	@brief Copy lower half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sdcopy(BIG x, DBIG y);
+/**	@brief Copy upper half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sducopy(BIG x, DBIG y);
+/**	@brief Set BIG to zero (Constant Time)
+ *
+	@param x BIG number to be set to zero  
+ */
+extern void BIG_zero(BIG x);
+/**	@brief Set DBIG to zero (Constant Time)
+ *
+	@param x DBIG number to be set to zero
+ */
+extern void BIG_dzero(DBIG x);
+/**	@brief Set BIG to one (unity) (Constant Time)
+ *
+	@param x BIG number to be set to one.
+ */
+extern void BIG_one(BIG x);
+/**	@brief Set BIG to inverse mod 2^256 (Constant Time)
+ *
+	@param x BIG number to be inverted
+ */
+extern void BIG_invmod2m(BIG x);
+/**	@brief Set BIG to sum of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, sum of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_add(BIG x, BIG y, BIG z);
+
+/**	@brief Set BIG to logical or of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, or of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_or(BIG x, BIG y, BIG z);
+
+/**	@brief Increment BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be incremented
+	@param i integer
+ */
+extern void BIG_inc(BIG x, int i);
+/**	@brief Set BIG to difference of two BIGs (Constant Time)
+ *
+	@param x BIG number, difference of other two - output not normalised
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_sub(BIG x, BIG y, BIG z);
+/**	@brief Decrement BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be decremented
+	@param i integer
+ */
+extern void BIG_dec(BIG x, int i);
+/**	@brief Set DBIG to sum of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, sum of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dadd(DBIG x, DBIG y, DBIG z);
+/**	@brief Set DBIG to difference of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, difference of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dsub(DBIG x, DBIG y, DBIG z);
+/**	@brief Multiply BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_imul(BIG x, BIG y, int i);
+/**	@brief Multiply BIG by not-so-small small integer - output normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+	@return Overflowing bits
+ */
+extern chunk BIG_pmul(BIG x, BIG y, int i);
+/**	@brief Divide BIG by 3 - output normalised (Constant Time)
+ *
+	@param x BIG number
+	@return Remainder
+ */
+extern int BIG_div3(BIG x);
+/**	@brief Multiply BIG by even bigger small integer resulting in a DBIG - output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_pxmul(DBIG x, BIG y, int i);
+/**	@brief Multiply BIG by another BIG resulting in DBIG - inputs normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_mul(DBIG x, BIG y, BIG z);
+/**	@brief Multiply BIG by another BIG resulting in another BIG - inputs normalised and output normalised (Constant Time)
+ *
+	Note that the product must fit into a BIG, and x must be distinct from y and z
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_smul(BIG x, BIG y, BIG z);
+/**	@brief Square BIG resulting in a DBIG - input normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, square of a BIG
+	@param y BIG number to be squared
+ */
+extern void BIG_sqr(DBIG x, BIG y);
+
+/**	@brief Montgomery reduction of a DBIG to a BIG  - input normalised and output normalised (Constant Time)
+ *
+	@param a BIG number, reduction of a BIG
+	@param md BIG number, the modulus
+	@param MC the Montgomery Constant
+	@param d DBIG number to be reduced
+ */
+extern void BIG_monty(BIG a, BIG md, chunk MC, DBIG d);
+
+/**	@brief Shifts a BIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shl(BIG x, int s);
+/**	@brief Fast shifts a BIG left by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Overflow bits
+ */
+extern int BIG_fshl(BIG x, int s);
+/**	@brief Shifts a DBIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshl(DBIG x, int s);
+/**	@brief Shifts a BIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shr(BIG x, int s);
+
+
+/**	@brief Fast time-critical combined shift by 1 bit, subtract and normalise (Constant Time)
+ *
+	@param r BIG number normalised output
+	@param a BIG number to be subtracted from
+	@param m BIG number to be shifted and subtracted
+	@return sign of r
+ */
+extern int BIG_ssn(BIG r, BIG a, BIG m);
+
+/**	@brief Fast shifts a BIG right by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Shifted out bits
+ */
+extern int BIG_fshr(BIG x, int s);
+/**	@brief Shifts a DBIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshr(DBIG x, int s);
+/**	@brief Splits a DBIG into two BIGs - input must be normalised, outputs normalised (Constant Time as used)
+ *
+	Internal function. The value of s must be approximately in the middle of the DBIG.
+	Typically used to extract z mod 2^MODBITS and z/2^MODBITS
+	@param x BIG number, top half of z
+	@param y BIG number, bottom half of z
+	@param z DBIG number to be split in two.
+	@param s Bit position at which to split
+	@return carry-out from top half
+ */
+extern chunk BIG_split(BIG x, BIG y, DBIG z, int s);
+/**	@brief Normalizes a BIG number - output normalised (Constant Time)
+ *
+	All digits of the input BIG are reduced mod 2^BASEBITS
+	@param x BIG number to be normalised
+ */
+extern chunk BIG_norm(BIG x);
+/**	@brief Normalizes a DBIG number - output normalised (Constant Time)
+ *
+	All digits of the input DBIG are reduced mod 2^BASEBITS
+	@param x DBIG number to be normalised
+ */
+extern void BIG_dnorm(DBIG x);
+/**	@brief Compares two BIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first BIG number to be compared
+	@param y second BIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_comp(BIG x, BIG y);
+/**	@brief Compares two DBIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first DBIG number to be compared
+	@param y second DBIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_dcomp(DBIG x, DBIG y);
+/**	@brief Calculate number of bits in a BIG - output normalised (Variable Time)
+ *
+	@param x BIG number
+	@return Number of bits in x
+ */
+extern int BIG_nbits(BIG x);
+/**	@brief Calculate number of bits in a DBIG - output normalised (Variable Time)
+ *
+	@param x DBIG number
+	@return Number of bits in x
+ */
+extern int BIG_dnbits(DBIG x);
+
+/**	@brief Reduce x mod n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctmod(BIG x, BIG n, int bd);
+
+/**	@brief  x=y mod n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctdmod(BIG x, DBIG y, BIG n, int bd);
+
+/**	@brief Divide x by n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctsdiv(BIG x,BIG n,int bd);
+
+/**	@brief  x=y/n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctddiv(BIG x, DBIG y, BIG n,int bd);
+
+
+/**	@brief Reduce x mod n - input and output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+ */
+extern void BIG_mod(BIG x, BIG n);
+/**	@brief Divide x by n - output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+ */
+extern void BIG_sdiv(BIG x, BIG n);
+/**	@brief  x=y mod n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_dmod(BIG x, DBIG y, BIG n);
+/**	@brief  x=y/n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_ddiv(BIG x, DBIG y, BIG n);
+/**	@brief  return parity of BIG, that is the least significant bit (Constant Time)
+ *
+	@param x BIG number
+	@return 0 or 1
+ */
+extern int BIG_parity(BIG x);
+/**	@brief  return i-th of BIG (Constant Time)
+ *
+	@param x BIG number
+	@param i the bit of x to be returned
+	@return 0 or 1
+ */
+extern int BIG_bit(BIG x, int i);
+/**	@brief  return least significant bits of a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param n number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int BIG_lastbits(BIG x, int n);
+/**	@brief  Create a random BIG from a random number generator (Constant Time)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_random(BIG x, csprng *r);
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randomnum(BIG x, BIG n, csprng *r);
+
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus and truncated to max bit length (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param t Maximum bit length
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randtrunc(BIG x, BIG n, int t, csprng *r);
+
+/**	brief  return NAF (Non-Adjacent-Form) value as +/- 1, 3 or 5, inputs must be normalised
+ *
+	Given x and 3*x extracts NAF value from given bit position, and returns number of bits processed, and number of trailing zeros detected if any
+	param x BIG number
+	param x3 BIG number, three times x
+	param i bit position
+	param nbs pointer to integer returning number of bits processed
+	param nzs pointer to integer returning number of trailing 0s
+	return + or - 1, 3 or 5
+*/
+
+/**	@brief  Calculate x=y*z mod n (Variable Time)
+ *
+	Slow method for modular multiplication
+	@param x BIG number, on exit = y*z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modmul(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y/z mod n (Variable Time)
+ *
+	Slow method for modular division
+	@param x BIG number, on exit = y/z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_moddiv(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y^2 mod n (Variable Time)
+ *
+	Slow method for modular squaring
+	@param x BIG number, on exit = y^2 mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modsqr(BIG x, BIG y, BIG n);
+/**	@brief  Calculate x=-y mod n (Variable Time)
+ *
+	Modular negation
+	@param x BIG number, on exit = -y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modneg(BIG x, BIG y, BIG n);
+
+/**	@brief  Calculate x=y+z mod n (Variable Time)
+ *
+	Slow method for modular addition
+	@param x BIG number, on exit = y+z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modadd(BIG x, BIG y, BIG z, BIG n);
+
+/**	@brief  Calculate jacobi Symbol (x/y) (Variable Time)
+ *
+	@param x BIG number
+	@param y BIG number
+	@return Jacobi symbol, -1,0 or 1
+ */
+extern int BIG_jacobi(BIG x, BIG y);
+/**	@brief  Calculate x=1/y mod n (Variable Time)
+ *
+	Modular Inversion - This is slow. Uses binary method.
+	@param x BIG number, on exit = 1/y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_invmodp(BIG x, BIG y, BIG n);
+/** @brief Calculate x=x mod 2^m (Variable Time)
+ *
+	Truncation
+	@param x BIG number, on reduced mod 2^m
+	@param m new truncated size
+*/
+extern void BIG_mod2m(BIG x, int m);
+
+/**	@brief Calculates a*b+c+*d
+ *
+	Calculate partial product of a.b, add in carry c, and add total to d (Constant Time)
+	@param a multiplier
+	@param b multiplicand
+	@param c carry
+	@param d pointer to accumulated bottom half of result
+	@return top half of result
+ */
+
+
+extern int step1(BIG,BIG,BIG);
+extern void step2(BIG,BIG,BIG);
+
+#ifdef dchunk
+
+/* Method required to calculate x*y+c+r, bottom half in r, top half returned */
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    dchunk prod = (dchunk)x * y + c + *r;
+    *r = (chunk)prod & BMASK_B512_60;
+    return (chunk)(prod >> BASEBITS_B512_60);
+}
+
+#else
+
+/* No integer type available that can store double the wordlength */
+/* accumulate partial products */
+
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    chunk x0, x1, y0, y1;
+    chunk bot, top, mid, carry;
+    x0 = x & HMASK_B512_60;
+    x1 = (x >> HBITS_B512_60);
+    y0 = y & HMASK_B512_60;
+    y1 = (y >> HBITS_B512_60);
+    bot = x0 * y0;
+    top = x1 * y1;
+    mid = x0 * y1 + x1 * y0;
+    x0 = mid & HMASK_B512_60;
+    x1 = (mid >> HBITS_B512_60);
+    bot += x0 << HBITS_B512_60;
+    bot += *r;
+    bot += c;
+
+    top += x1;
+    carry = bot >> BASEBITS_B512_60;
+    bot &= BMASK_B512_60;
+    top += carry;
+
+    *r = bot;
+    return top;
+}
+
+#endif
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/big_B528_60.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/big_B528_60.h
new file mode 100644
index 0000000..971a677
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/big_B528_60.h
@@ -0,0 +1,697 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file big.h
+ * @author Mike Scott
+ * @date 23rd February 2016
+ * @brief Big number Header File
+ *
+ *
+ */
+
+#ifndef BIG_B528_60_H
+#define BIG_B528_60_H
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <inttypes.h>
+#include "arch.h"
+#include "core.h"
+#include "config_big_B528_60.h"
+
+using namespace core;
+
+/* could comment this out if code size is a major issue */
+#define UNWOUND
+/* Normally recommended, but may not be optimal for some architectures, for example 32-bit ARM M4 */
+#define USE_KARATSUBA
+
+#define BIGBITS_B528_60 (8*MODBYTES_B528_60)
+#define NLEN_B528_60 (1+((8*MODBYTES_B528_60-1)/BASEBITS_B528_60))
+#define DNLEN_B528_60 2*NLEN_B528_60
+#define BMASK_B528_60 (((chunk)1<<BASEBITS_B528_60)-1) /**< Mask = 2^BASEBITS-1 */
+#define NEXCESS_B528_60 (1<<(CHUNK-BASEBITS_B528_60-1))           /**< 2^(CHUNK-BASEBITS-1) - digit cannot be multiplied by more than this before normalisation */
+
+#define HBITS_B528_60 (BASEBITS_B528_60/2)      /**< Number of bits in number base divided by 2 */
+#define HMASK_B528_60 (((chunk)1<<HBITS_B528_60)-1)    /**< Mask = 2^HBITS-1 */
+
+//#define DEBUG_NORM
+
+#ifdef DEBUG_NORM  /* Add an extra location to track chunk extension */
+#define MPV_B528_60 NLEN_B528_60
+#define MNV_B528_60 (NLEN_B528_60+1)
+#define DMPV_B528_60 DNLEN_B528_60
+#define DMNV_B528_60 (DNLEN_B528_60+1)
+
+#endif
+
+namespace B528_60 {
+
+//extern int BIGMULS;
+//extern int BIGSQRS;
+
+#ifdef DEBUG_NORM
+typedef chunk BIG[NLEN_B528_60 + 2]; /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B528_60 + 2]; /**< Define type DBIG as array of chunks */
+#else
+typedef chunk BIG[NLEN_B528_60];     /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B528_60];   /**< Define type DBIG as array of chunks */
+#endif
+
+/* BIG number prototypes */
+
+/**	@brief Tests for BIG equal to zero (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_iszilch(BIG x);
+/**	@brief Tests for BIG equal to one (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if one, else returns 0
+ */
+extern int BIG_isunity(BIG x);
+/**	@brief Tests for DBIG equal to zero (Constant Time)
+ *
+	@param x a DBIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_diszilch(DBIG x);
+/**	@brief Outputs a BIG number to the console (Variable Time)
+ *
+	@param x a BIG number
+ */
+extern void BIG_output(BIG x);
+/**	@brief Outputs a BIG number to the console in raw form (Variable Time for debugging)
+ *
+	@param x a BIG number
+ */
+extern void BIG_rawoutput(BIG x);
+/**	@brief Conditional constant time swap of two BIG numbers
+ *
+	Conditionally swaps parameters in constant time (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s swap takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cswap(BIG x, BIG y, int s);
+/**	@brief Conditional copy of BIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cmove(BIG x, BIG y, int s);
+/**	@brief Conditional copy of DBIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a DBIG number
+	@param y another DBIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_dcmove(BIG x, BIG y, int s);
+/**	@brief Convert from BIG number to byte array (Constant Time)
+ *
+	@param a byte array
+	@param x BIG number
+ */
+extern void BIG_toBytes(char *a, BIG x);
+/**	@brief Convert to BIG number from byte array (Constant Time)
+ *
+	@param x BIG number
+	@param a byte array
+ */
+extern void BIG_fromBytes(BIG x, char *a);
+/**	@brief Convert to BIG number from byte array of given length (Variable Time)
+ *
+	@param x BIG number
+	@param a byte array
+	@param s byte array length
+ */
+extern void BIG_fromBytesLen(BIG x, char *a, int s);
+/**@brief Convert to DBIG number from byte array of given length (Variable Time)
+ *
+   @param x DBIG number
+   @param a byte array
+   @param s byte array length
+ */
+extern void BIG_dfromBytesLen(DBIG x, char *a, int s);
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_doutput(DBIG x); 
+
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_drawoutput(DBIG x);
+
+/**	@brief Copy BIG from Read-Only Memory to a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number in ROM
+ */
+extern void BIG_rcopy(BIG x, const BIG y);
+/**	@brief Copy BIG to another BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_copy(BIG x, BIG y);
+/**	@brief Copy DBIG to another DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_dcopy(DBIG x, DBIG y);
+/**	@brief Copy BIG to upper half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dsucopy(DBIG x, BIG y);
+/**	@brief Copy BIG to lower half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dscopy(DBIG x, BIG y);
+/**	@brief Copy lower half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sdcopy(BIG x, DBIG y);
+/**	@brief Copy upper half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sducopy(BIG x, DBIG y);
+/**	@brief Set BIG to zero (Constant Time)
+ *
+	@param x BIG number to be set to zero  
+ */
+extern void BIG_zero(BIG x);
+/**	@brief Set DBIG to zero (Constant Time)
+ *
+	@param x DBIG number to be set to zero
+ */
+extern void BIG_dzero(DBIG x);
+/**	@brief Set BIG to one (unity) (Constant Time)
+ *
+	@param x BIG number to be set to one.
+ */
+extern void BIG_one(BIG x);
+/**	@brief Set BIG to inverse mod 2^256 (Constant Time)
+ *
+	@param x BIG number to be inverted
+ */
+extern void BIG_invmod2m(BIG x);
+/**	@brief Set BIG to sum of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, sum of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_add(BIG x, BIG y, BIG z);
+
+/**	@brief Set BIG to logical or of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, or of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_or(BIG x, BIG y, BIG z);
+
+/**	@brief Increment BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be incremented
+	@param i integer
+ */
+extern void BIG_inc(BIG x, int i);
+/**	@brief Set BIG to difference of two BIGs (Constant Time)
+ *
+	@param x BIG number, difference of other two - output not normalised
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_sub(BIG x, BIG y, BIG z);
+/**	@brief Decrement BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be decremented
+	@param i integer
+ */
+extern void BIG_dec(BIG x, int i);
+/**	@brief Set DBIG to sum of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, sum of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dadd(DBIG x, DBIG y, DBIG z);
+/**	@brief Set DBIG to difference of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, difference of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dsub(DBIG x, DBIG y, DBIG z);
+/**	@brief Multiply BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_imul(BIG x, BIG y, int i);
+/**	@brief Multiply BIG by not-so-small small integer - output normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+	@return Overflowing bits
+ */
+extern chunk BIG_pmul(BIG x, BIG y, int i);
+/**	@brief Divide BIG by 3 - output normalised (Constant Time)
+ *
+	@param x BIG number
+	@return Remainder
+ */
+extern int BIG_div3(BIG x);
+/**	@brief Multiply BIG by even bigger small integer resulting in a DBIG - output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_pxmul(DBIG x, BIG y, int i);
+/**	@brief Multiply BIG by another BIG resulting in DBIG - inputs normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_mul(DBIG x, BIG y, BIG z);
+/**	@brief Multiply BIG by another BIG resulting in another BIG - inputs normalised and output normalised (Constant Time)
+ *
+	Note that the product must fit into a BIG, and x must be distinct from y and z
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_smul(BIG x, BIG y, BIG z);
+/**	@brief Square BIG resulting in a DBIG - input normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, square of a BIG
+	@param y BIG number to be squared
+ */
+extern void BIG_sqr(DBIG x, BIG y);
+
+/**	@brief Montgomery reduction of a DBIG to a BIG  - input normalised and output normalised (Constant Time)
+ *
+	@param a BIG number, reduction of a BIG
+	@param md BIG number, the modulus
+	@param MC the Montgomery Constant
+	@param d DBIG number to be reduced
+ */
+extern void BIG_monty(BIG a, BIG md, chunk MC, DBIG d);
+
+/**	@brief Shifts a BIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shl(BIG x, int s);
+/**	@brief Fast shifts a BIG left by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Overflow bits
+ */
+extern int BIG_fshl(BIG x, int s);
+/**	@brief Shifts a DBIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshl(DBIG x, int s);
+/**	@brief Shifts a BIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shr(BIG x, int s);
+
+
+/**	@brief Fast time-critical combined shift by 1 bit, subtract and normalise (Constant Time)
+ *
+	@param r BIG number normalised output
+	@param a BIG number to be subtracted from
+	@param m BIG number to be shifted and subtracted
+	@return sign of r
+ */
+extern int BIG_ssn(BIG r, BIG a, BIG m);
+
+/**	@brief Fast shifts a BIG right by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Shifted out bits
+ */
+extern int BIG_fshr(BIG x, int s);
+/**	@brief Shifts a DBIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshr(DBIG x, int s);
+/**	@brief Splits a DBIG into two BIGs - input must be normalised, outputs normalised (Constant Time as used)
+ *
+	Internal function. The value of s must be approximately in the middle of the DBIG.
+	Typically used to extract z mod 2^MODBITS and z/2^MODBITS
+	@param x BIG number, top half of z
+	@param y BIG number, bottom half of z
+	@param z DBIG number to be split in two.
+	@param s Bit position at which to split
+	@return carry-out from top half
+ */
+extern chunk BIG_split(BIG x, BIG y, DBIG z, int s);
+/**	@brief Normalizes a BIG number - output normalised (Constant Time)
+ *
+	All digits of the input BIG are reduced mod 2^BASEBITS
+	@param x BIG number to be normalised
+ */
+extern chunk BIG_norm(BIG x);
+/**	@brief Normalizes a DBIG number - output normalised (Constant Time)
+ *
+	All digits of the input DBIG are reduced mod 2^BASEBITS
+	@param x DBIG number to be normalised
+ */
+extern void BIG_dnorm(DBIG x);
+/**	@brief Compares two BIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first BIG number to be compared
+	@param y second BIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_comp(BIG x, BIG y);
+/**	@brief Compares two DBIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first DBIG number to be compared
+	@param y second DBIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_dcomp(DBIG x, DBIG y);
+/**	@brief Calculate number of bits in a BIG - output normalised (Variable Time)
+ *
+	@param x BIG number
+	@return Number of bits in x
+ */
+extern int BIG_nbits(BIG x);
+/**	@brief Calculate number of bits in a DBIG - output normalised (Variable Time)
+ *
+	@param x DBIG number
+	@return Number of bits in x
+ */
+extern int BIG_dnbits(DBIG x);
+
+/**	@brief Reduce x mod n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctmod(BIG x, BIG n, int bd);
+
+/**	@brief  x=y mod n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctdmod(BIG x, DBIG y, BIG n, int bd);
+
+/**	@brief Divide x by n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctsdiv(BIG x,BIG n,int bd);
+
+/**	@brief  x=y/n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctddiv(BIG x, DBIG y, BIG n,int bd);
+
+
+/**	@brief Reduce x mod n - input and output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+ */
+extern void BIG_mod(BIG x, BIG n);
+/**	@brief Divide x by n - output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+ */
+extern void BIG_sdiv(BIG x, BIG n);
+/**	@brief  x=y mod n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_dmod(BIG x, DBIG y, BIG n);
+/**	@brief  x=y/n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_ddiv(BIG x, DBIG y, BIG n);
+/**	@brief  return parity of BIG, that is the least significant bit (Constant Time)
+ *
+	@param x BIG number
+	@return 0 or 1
+ */
+extern int BIG_parity(BIG x);
+/**	@brief  return i-th of BIG (Constant Time)
+ *
+	@param x BIG number
+	@param i the bit of x to be returned
+	@return 0 or 1
+ */
+extern int BIG_bit(BIG x, int i);
+/**	@brief  return least significant bits of a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param n number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int BIG_lastbits(BIG x, int n);
+/**	@brief  Create a random BIG from a random number generator (Constant Time)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_random(BIG x, csprng *r);
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randomnum(BIG x, BIG n, csprng *r);
+
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus and truncated to max bit length (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param t Maximum bit length
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randtrunc(BIG x, BIG n, int t, csprng *r);
+
+/**	brief  return NAF (Non-Adjacent-Form) value as +/- 1, 3 or 5, inputs must be normalised
+ *
+	Given x and 3*x extracts NAF value from given bit position, and returns number of bits processed, and number of trailing zeros detected if any
+	param x BIG number
+	param x3 BIG number, three times x
+	param i bit position
+	param nbs pointer to integer returning number of bits processed
+	param nzs pointer to integer returning number of trailing 0s
+	return + or - 1, 3 or 5
+*/
+
+/**	@brief  Calculate x=y*z mod n (Variable Time)
+ *
+	Slow method for modular multiplication
+	@param x BIG number, on exit = y*z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modmul(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y/z mod n (Variable Time)
+ *
+	Slow method for modular division
+	@param x BIG number, on exit = y/z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_moddiv(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y^2 mod n (Variable Time)
+ *
+	Slow method for modular squaring
+	@param x BIG number, on exit = y^2 mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modsqr(BIG x, BIG y, BIG n);
+/**	@brief  Calculate x=-y mod n (Variable Time)
+ *
+	Modular negation
+	@param x BIG number, on exit = -y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modneg(BIG x, BIG y, BIG n);
+
+/**	@brief  Calculate x=y+z mod n (Variable Time)
+ *
+	Slow method for modular addition
+	@param x BIG number, on exit = y+z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modadd(BIG x, BIG y, BIG z, BIG n);
+
+/**	@brief  Calculate jacobi Symbol (x/y) (Variable Time)
+ *
+	@param x BIG number
+	@param y BIG number
+	@return Jacobi symbol, -1,0 or 1
+ */
+extern int BIG_jacobi(BIG x, BIG y);
+/**	@brief  Calculate x=1/y mod n (Variable Time)
+ *
+	Modular Inversion - This is slow. Uses binary method.
+	@param x BIG number, on exit = 1/y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_invmodp(BIG x, BIG y, BIG n);
+/** @brief Calculate x=x mod 2^m (Variable Time)
+ *
+	Truncation
+	@param x BIG number, on reduced mod 2^m
+	@param m new truncated size
+*/
+extern void BIG_mod2m(BIG x, int m);
+
+/**	@brief Calculates a*b+c+*d
+ *
+	Calculate partial product of a.b, add in carry c, and add total to d (Constant Time)
+	@param a multiplier
+	@param b multiplicand
+	@param c carry
+	@param d pointer to accumulated bottom half of result
+	@return top half of result
+ */
+
+
+extern int step1(BIG,BIG,BIG);
+extern void step2(BIG,BIG,BIG);
+
+#ifdef dchunk
+
+/* Method required to calculate x*y+c+r, bottom half in r, top half returned */
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    dchunk prod = (dchunk)x * y + c + *r;
+    *r = (chunk)prod & BMASK_B528_60;
+    return (chunk)(prod >> BASEBITS_B528_60);
+}
+
+#else
+
+/* No integer type available that can store double the wordlength */
+/* accumulate partial products */
+
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    chunk x0, x1, y0, y1;
+    chunk bot, top, mid, carry;
+    x0 = x & HMASK_B528_60;
+    x1 = (x >> HBITS_B528_60);
+    y0 = y & HMASK_B528_60;
+    y1 = (y >> HBITS_B528_60);
+    bot = x0 * y0;
+    top = x1 * y1;
+    mid = x0 * y1 + x1 * y0;
+    x0 = mid & HMASK_B528_60;
+    x1 = (mid >> HBITS_B528_60);
+    bot += x0 << HBITS_B528_60;
+    bot += *r;
+    bot += c;
+
+    top += x1;
+    carry = bot >> BASEBITS_B528_60;
+    bot &= BMASK_B528_60;
+    top += carry;
+
+    *r = bot;
+    return top;
+}
+
+#endif
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/big_B560_58.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/big_B560_58.h
new file mode 100644
index 0000000..c9341c4
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/big_B560_58.h
@@ -0,0 +1,697 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file big.h
+ * @author Mike Scott
+ * @date 23rd February 2016
+ * @brief Big number Header File
+ *
+ *
+ */
+
+#ifndef BIG_B560_58_H
+#define BIG_B560_58_H
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <inttypes.h>
+#include "arch.h"
+#include "core.h"
+#include "config_big_B560_58.h"
+
+using namespace core;
+
+/* could comment this out if code size is a major issue */
+#define UNWOUND
+/* Normally recommended, but may not be optimal for some architectures, for example 32-bit ARM M4 */
+#define USE_KARATSUBA
+
+#define BIGBITS_B560_58 (8*MODBYTES_B560_58)
+#define NLEN_B560_58 (1+((8*MODBYTES_B560_58-1)/BASEBITS_B560_58))
+#define DNLEN_B560_58 2*NLEN_B560_58
+#define BMASK_B560_58 (((chunk)1<<BASEBITS_B560_58)-1) /**< Mask = 2^BASEBITS-1 */
+#define NEXCESS_B560_58 (1<<(CHUNK-BASEBITS_B560_58-1))           /**< 2^(CHUNK-BASEBITS-1) - digit cannot be multiplied by more than this before normalisation */
+
+#define HBITS_B560_58 (BASEBITS_B560_58/2)      /**< Number of bits in number base divided by 2 */
+#define HMASK_B560_58 (((chunk)1<<HBITS_B560_58)-1)    /**< Mask = 2^HBITS-1 */
+
+//#define DEBUG_NORM
+
+#ifdef DEBUG_NORM  /* Add an extra location to track chunk extension */
+#define MPV_B560_58 NLEN_B560_58
+#define MNV_B560_58 (NLEN_B560_58+1)
+#define DMPV_B560_58 DNLEN_B560_58
+#define DMNV_B560_58 (DNLEN_B560_58+1)
+
+#endif
+
+namespace B560_58 {
+
+//extern int BIGMULS;
+//extern int BIGSQRS;
+
+#ifdef DEBUG_NORM
+typedef chunk BIG[NLEN_B560_58 + 2]; /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B560_58 + 2]; /**< Define type DBIG as array of chunks */
+#else
+typedef chunk BIG[NLEN_B560_58];     /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B560_58];   /**< Define type DBIG as array of chunks */
+#endif
+
+/* BIG number prototypes */
+
+/**	@brief Tests for BIG equal to zero (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_iszilch(BIG x);
+/**	@brief Tests for BIG equal to one (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if one, else returns 0
+ */
+extern int BIG_isunity(BIG x);
+/**	@brief Tests for DBIG equal to zero (Constant Time)
+ *
+	@param x a DBIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_diszilch(DBIG x);
+/**	@brief Outputs a BIG number to the console (Variable Time)
+ *
+	@param x a BIG number
+ */
+extern void BIG_output(BIG x);
+/**	@brief Outputs a BIG number to the console in raw form (Variable Time for debugging)
+ *
+	@param x a BIG number
+ */
+extern void BIG_rawoutput(BIG x);
+/**	@brief Conditional constant time swap of two BIG numbers
+ *
+	Conditionally swaps parameters in constant time (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s swap takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cswap(BIG x, BIG y, int s);
+/**	@brief Conditional copy of BIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cmove(BIG x, BIG y, int s);
+/**	@brief Conditional copy of DBIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a DBIG number
+	@param y another DBIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_dcmove(BIG x, BIG y, int s);
+/**	@brief Convert from BIG number to byte array (Constant Time)
+ *
+	@param a byte array
+	@param x BIG number
+ */
+extern void BIG_toBytes(char *a, BIG x);
+/**	@brief Convert to BIG number from byte array (Constant Time)
+ *
+	@param x BIG number
+	@param a byte array
+ */
+extern void BIG_fromBytes(BIG x, char *a);
+/**	@brief Convert to BIG number from byte array of given length (Variable Time)
+ *
+	@param x BIG number
+	@param a byte array
+	@param s byte array length
+ */
+extern void BIG_fromBytesLen(BIG x, char *a, int s);
+/**@brief Convert to DBIG number from byte array of given length (Variable Time)
+ *
+   @param x DBIG number
+   @param a byte array
+   @param s byte array length
+ */
+extern void BIG_dfromBytesLen(DBIG x, char *a, int s);
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_doutput(DBIG x); 
+
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_drawoutput(DBIG x);
+
+/**	@brief Copy BIG from Read-Only Memory to a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number in ROM
+ */
+extern void BIG_rcopy(BIG x, const BIG y);
+/**	@brief Copy BIG to another BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_copy(BIG x, BIG y);
+/**	@brief Copy DBIG to another DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_dcopy(DBIG x, DBIG y);
+/**	@brief Copy BIG to upper half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dsucopy(DBIG x, BIG y);
+/**	@brief Copy BIG to lower half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dscopy(DBIG x, BIG y);
+/**	@brief Copy lower half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sdcopy(BIG x, DBIG y);
+/**	@brief Copy upper half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sducopy(BIG x, DBIG y);
+/**	@brief Set BIG to zero (Constant Time)
+ *
+	@param x BIG number to be set to zero  
+ */
+extern void BIG_zero(BIG x);
+/**	@brief Set DBIG to zero (Constant Time)
+ *
+	@param x DBIG number to be set to zero
+ */
+extern void BIG_dzero(DBIG x);
+/**	@brief Set BIG to one (unity) (Constant Time)
+ *
+	@param x BIG number to be set to one.
+ */
+extern void BIG_one(BIG x);
+/**	@brief Set BIG to inverse mod 2^256 (Constant Time)
+ *
+	@param x BIG number to be inverted
+ */
+extern void BIG_invmod2m(BIG x);
+/**	@brief Set BIG to sum of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, sum of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_add(BIG x, BIG y, BIG z);
+
+/**	@brief Set BIG to logical or of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, or of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_or(BIG x, BIG y, BIG z);
+
+/**	@brief Increment BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be incremented
+	@param i integer
+ */
+extern void BIG_inc(BIG x, int i);
+/**	@brief Set BIG to difference of two BIGs (Constant Time)
+ *
+	@param x BIG number, difference of other two - output not normalised
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_sub(BIG x, BIG y, BIG z);
+/**	@brief Decrement BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be decremented
+	@param i integer
+ */
+extern void BIG_dec(BIG x, int i);
+/**	@brief Set DBIG to sum of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, sum of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dadd(DBIG x, DBIG y, DBIG z);
+/**	@brief Set DBIG to difference of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, difference of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dsub(DBIG x, DBIG y, DBIG z);
+/**	@brief Multiply BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_imul(BIG x, BIG y, int i);
+/**	@brief Multiply BIG by not-so-small small integer - output normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+	@return Overflowing bits
+ */
+extern chunk BIG_pmul(BIG x, BIG y, int i);
+/**	@brief Divide BIG by 3 - output normalised (Constant Time)
+ *
+	@param x BIG number
+	@return Remainder
+ */
+extern int BIG_div3(BIG x);
+/**	@brief Multiply BIG by even bigger small integer resulting in a DBIG - output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_pxmul(DBIG x, BIG y, int i);
+/**	@brief Multiply BIG by another BIG resulting in DBIG - inputs normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_mul(DBIG x, BIG y, BIG z);
+/**	@brief Multiply BIG by another BIG resulting in another BIG - inputs normalised and output normalised (Constant Time)
+ *
+	Note that the product must fit into a BIG, and x must be distinct from y and z
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_smul(BIG x, BIG y, BIG z);
+/**	@brief Square BIG resulting in a DBIG - input normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, square of a BIG
+	@param y BIG number to be squared
+ */
+extern void BIG_sqr(DBIG x, BIG y);
+
+/**	@brief Montgomery reduction of a DBIG to a BIG  - input normalised and output normalised (Constant Time)
+ *
+	@param a BIG number, reduction of a BIG
+	@param md BIG number, the modulus
+	@param MC the Montgomery Constant
+	@param d DBIG number to be reduced
+ */
+extern void BIG_monty(BIG a, BIG md, chunk MC, DBIG d);
+
+/**	@brief Shifts a BIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shl(BIG x, int s);
+/**	@brief Fast shifts a BIG left by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Overflow bits
+ */
+extern int BIG_fshl(BIG x, int s);
+/**	@brief Shifts a DBIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshl(DBIG x, int s);
+/**	@brief Shifts a BIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shr(BIG x, int s);
+
+
+/**	@brief Fast time-critical combined shift by 1 bit, subtract and normalise (Constant Time)
+ *
+	@param r BIG number normalised output
+	@param a BIG number to be subtracted from
+	@param m BIG number to be shifted and subtracted
+	@return sign of r
+ */
+extern int BIG_ssn(BIG r, BIG a, BIG m);
+
+/**	@brief Fast shifts a BIG right by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Shifted out bits
+ */
+extern int BIG_fshr(BIG x, int s);
+/**	@brief Shifts a DBIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshr(DBIG x, int s);
+/**	@brief Splits a DBIG into two BIGs - input must be normalised, outputs normalised (Constant Time as used)
+ *
+	Internal function. The value of s must be approximately in the middle of the DBIG.
+	Typically used to extract z mod 2^MODBITS and z/2^MODBITS
+	@param x BIG number, top half of z
+	@param y BIG number, bottom half of z
+	@param z DBIG number to be split in two.
+	@param s Bit position at which to split
+	@return carry-out from top half
+ */
+extern chunk BIG_split(BIG x, BIG y, DBIG z, int s);
+/**	@brief Normalizes a BIG number - output normalised (Constant Time)
+ *
+	All digits of the input BIG are reduced mod 2^BASEBITS
+	@param x BIG number to be normalised
+ */
+extern chunk BIG_norm(BIG x);
+/**	@brief Normalizes a DBIG number - output normalised (Constant Time)
+ *
+	All digits of the input DBIG are reduced mod 2^BASEBITS
+	@param x DBIG number to be normalised
+ */
+extern void BIG_dnorm(DBIG x);
+/**	@brief Compares two BIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first BIG number to be compared
+	@param y second BIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_comp(BIG x, BIG y);
+/**	@brief Compares two DBIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first DBIG number to be compared
+	@param y second DBIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_dcomp(DBIG x, DBIG y);
+/**	@brief Calculate number of bits in a BIG - output normalised (Variable Time)
+ *
+	@param x BIG number
+	@return Number of bits in x
+ */
+extern int BIG_nbits(BIG x);
+/**	@brief Calculate number of bits in a DBIG - output normalised (Variable Time)
+ *
+	@param x DBIG number
+	@return Number of bits in x
+ */
+extern int BIG_dnbits(DBIG x);
+
+/**	@brief Reduce x mod n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctmod(BIG x, BIG n, int bd);
+
+/**	@brief  x=y mod n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctdmod(BIG x, DBIG y, BIG n, int bd);
+
+/**	@brief Divide x by n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctsdiv(BIG x,BIG n,int bd);
+
+/**	@brief  x=y/n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctddiv(BIG x, DBIG y, BIG n,int bd);
+
+
+/**	@brief Reduce x mod n - input and output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+ */
+extern void BIG_mod(BIG x, BIG n);
+/**	@brief Divide x by n - output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+ */
+extern void BIG_sdiv(BIG x, BIG n);
+/**	@brief  x=y mod n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_dmod(BIG x, DBIG y, BIG n);
+/**	@brief  x=y/n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_ddiv(BIG x, DBIG y, BIG n);
+/**	@brief  return parity of BIG, that is the least significant bit (Constant Time)
+ *
+	@param x BIG number
+	@return 0 or 1
+ */
+extern int BIG_parity(BIG x);
+/**	@brief  return i-th of BIG (Constant Time)
+ *
+	@param x BIG number
+	@param i the bit of x to be returned
+	@return 0 or 1
+ */
+extern int BIG_bit(BIG x, int i);
+/**	@brief  return least significant bits of a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param n number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int BIG_lastbits(BIG x, int n);
+/**	@brief  Create a random BIG from a random number generator (Constant Time)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_random(BIG x, csprng *r);
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randomnum(BIG x, BIG n, csprng *r);
+
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus and truncated to max bit length (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param t Maximum bit length
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randtrunc(BIG x, BIG n, int t, csprng *r);
+
+/**	brief  return NAF (Non-Adjacent-Form) value as +/- 1, 3 or 5, inputs must be normalised
+ *
+	Given x and 3*x extracts NAF value from given bit position, and returns number of bits processed, and number of trailing zeros detected if any
+	param x BIG number
+	param x3 BIG number, three times x
+	param i bit position
+	param nbs pointer to integer returning number of bits processed
+	param nzs pointer to integer returning number of trailing 0s
+	return + or - 1, 3 or 5
+*/
+
+/**	@brief  Calculate x=y*z mod n (Variable Time)
+ *
+	Slow method for modular multiplication
+	@param x BIG number, on exit = y*z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modmul(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y/z mod n (Variable Time)
+ *
+	Slow method for modular division
+	@param x BIG number, on exit = y/z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_moddiv(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y^2 mod n (Variable Time)
+ *
+	Slow method for modular squaring
+	@param x BIG number, on exit = y^2 mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modsqr(BIG x, BIG y, BIG n);
+/**	@brief  Calculate x=-y mod n (Variable Time)
+ *
+	Modular negation
+	@param x BIG number, on exit = -y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modneg(BIG x, BIG y, BIG n);
+
+/**	@brief  Calculate x=y+z mod n (Variable Time)
+ *
+	Slow method for modular addition
+	@param x BIG number, on exit = y+z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modadd(BIG x, BIG y, BIG z, BIG n);
+
+/**	@brief  Calculate jacobi Symbol (x/y) (Variable Time)
+ *
+	@param x BIG number
+	@param y BIG number
+	@return Jacobi symbol, -1,0 or 1
+ */
+extern int BIG_jacobi(BIG x, BIG y);
+/**	@brief  Calculate x=1/y mod n (Variable Time)
+ *
+	Modular Inversion - This is slow. Uses binary method.
+	@param x BIG number, on exit = 1/y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_invmodp(BIG x, BIG y, BIG n);
+/** @brief Calculate x=x mod 2^m (Variable Time)
+ *
+	Truncation
+	@param x BIG number, on reduced mod 2^m
+	@param m new truncated size
+*/
+extern void BIG_mod2m(BIG x, int m);
+
+/**	@brief Calculates a*b+c+*d
+ *
+	Calculate partial product of a.b, add in carry c, and add total to d (Constant Time)
+	@param a multiplier
+	@param b multiplicand
+	@param c carry
+	@param d pointer to accumulated bottom half of result
+	@return top half of result
+ */
+
+
+extern int step1(BIG,BIG,BIG);
+extern void step2(BIG,BIG,BIG);
+
+#ifdef dchunk
+
+/* Method required to calculate x*y+c+r, bottom half in r, top half returned */
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    dchunk prod = (dchunk)x * y + c + *r;
+    *r = (chunk)prod & BMASK_B560_58;
+    return (chunk)(prod >> BASEBITS_B560_58);
+}
+
+#else
+
+/* No integer type available that can store double the wordlength */
+/* accumulate partial products */
+
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    chunk x0, x1, y0, y1;
+    chunk bot, top, mid, carry;
+    x0 = x & HMASK_B560_58;
+    x1 = (x >> HBITS_B560_58);
+    y0 = y & HMASK_B560_58;
+    y1 = (y >> HBITS_B560_58);
+    bot = x0 * y0;
+    top = x1 * y1;
+    mid = x0 * y1 + x1 * y0;
+    x0 = mid & HMASK_B560_58;
+    x1 = (mid >> HBITS_B560_58);
+    bot += x0 << HBITS_B560_58;
+    bot += *r;
+    bot += c;
+
+    top += x1;
+    carry = bot >> BASEBITS_B560_58;
+    bot &= BMASK_B560_58;
+    top += carry;
+
+    *r = bot;
+    return top;
+}
+
+#endif
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/big_B584_60.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/big_B584_60.h
new file mode 100644
index 0000000..6024967
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/big_B584_60.h
@@ -0,0 +1,697 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file big.h
+ * @author Mike Scott
+ * @date 23rd February 2016
+ * @brief Big number Header File
+ *
+ *
+ */
+
+#ifndef BIG_B584_60_H
+#define BIG_B584_60_H
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <inttypes.h>
+#include "arch.h"
+#include "core.h"
+#include "config_big_B584_60.h"
+
+using namespace core;
+
+/* could comment this out if code size is a major issue */
+#define UNWOUND
+/* Normally recommended, but may not be optimal for some architectures, for example 32-bit ARM M4 */
+#define USE_KARATSUBA
+
+#define BIGBITS_B584_60 (8*MODBYTES_B584_60)
+#define NLEN_B584_60 (1+((8*MODBYTES_B584_60-1)/BASEBITS_B584_60))
+#define DNLEN_B584_60 2*NLEN_B584_60
+#define BMASK_B584_60 (((chunk)1<<BASEBITS_B584_60)-1) /**< Mask = 2^BASEBITS-1 */
+#define NEXCESS_B584_60 (1<<(CHUNK-BASEBITS_B584_60-1))           /**< 2^(CHUNK-BASEBITS-1) - digit cannot be multiplied by more than this before normalisation */
+
+#define HBITS_B584_60 (BASEBITS_B584_60/2)      /**< Number of bits in number base divided by 2 */
+#define HMASK_B584_60 (((chunk)1<<HBITS_B584_60)-1)    /**< Mask = 2^HBITS-1 */
+
+//#define DEBUG_NORM
+
+#ifdef DEBUG_NORM  /* Add an extra location to track chunk extension */
+#define MPV_B584_60 NLEN_B584_60
+#define MNV_B584_60 (NLEN_B584_60+1)
+#define DMPV_B584_60 DNLEN_B584_60
+#define DMNV_B584_60 (DNLEN_B584_60+1)
+
+#endif
+
+namespace B584_60 {
+
+//extern int BIGMULS;
+//extern int BIGSQRS;
+
+#ifdef DEBUG_NORM
+typedef chunk BIG[NLEN_B584_60 + 2]; /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B584_60 + 2]; /**< Define type DBIG as array of chunks */
+#else
+typedef chunk BIG[NLEN_B584_60];     /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B584_60];   /**< Define type DBIG as array of chunks */
+#endif
+
+/* BIG number prototypes */
+
+/**	@brief Tests for BIG equal to zero (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_iszilch(BIG x);
+/**	@brief Tests for BIG equal to one (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if one, else returns 0
+ */
+extern int BIG_isunity(BIG x);
+/**	@brief Tests for DBIG equal to zero (Constant Time)
+ *
+	@param x a DBIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_diszilch(DBIG x);
+/**	@brief Outputs a BIG number to the console (Variable Time)
+ *
+	@param x a BIG number
+ */
+extern void BIG_output(BIG x);
+/**	@brief Outputs a BIG number to the console in raw form (Variable Time for debugging)
+ *
+	@param x a BIG number
+ */
+extern void BIG_rawoutput(BIG x);
+/**	@brief Conditional constant time swap of two BIG numbers
+ *
+	Conditionally swaps parameters in constant time (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s swap takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cswap(BIG x, BIG y, int s);
+/**	@brief Conditional copy of BIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cmove(BIG x, BIG y, int s);
+/**	@brief Conditional copy of DBIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a DBIG number
+	@param y another DBIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_dcmove(BIG x, BIG y, int s);
+/**	@brief Convert from BIG number to byte array (Constant Time)
+ *
+	@param a byte array
+	@param x BIG number
+ */
+extern void BIG_toBytes(char *a, BIG x);
+/**	@brief Convert to BIG number from byte array (Constant Time)
+ *
+	@param x BIG number
+	@param a byte array
+ */
+extern void BIG_fromBytes(BIG x, char *a);
+/**	@brief Convert to BIG number from byte array of given length (Variable Time)
+ *
+	@param x BIG number
+	@param a byte array
+	@param s byte array length
+ */
+extern void BIG_fromBytesLen(BIG x, char *a, int s);
+/**@brief Convert to DBIG number from byte array of given length (Variable Time)
+ *
+   @param x DBIG number
+   @param a byte array
+   @param s byte array length
+ */
+extern void BIG_dfromBytesLen(DBIG x, char *a, int s);
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_doutput(DBIG x); 
+
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_drawoutput(DBIG x);
+
+/**	@brief Copy BIG from Read-Only Memory to a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number in ROM
+ */
+extern void BIG_rcopy(BIG x, const BIG y);
+/**	@brief Copy BIG to another BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_copy(BIG x, BIG y);
+/**	@brief Copy DBIG to another DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_dcopy(DBIG x, DBIG y);
+/**	@brief Copy BIG to upper half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dsucopy(DBIG x, BIG y);
+/**	@brief Copy BIG to lower half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dscopy(DBIG x, BIG y);
+/**	@brief Copy lower half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sdcopy(BIG x, DBIG y);
+/**	@brief Copy upper half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sducopy(BIG x, DBIG y);
+/**	@brief Set BIG to zero (Constant Time)
+ *
+	@param x BIG number to be set to zero  
+ */
+extern void BIG_zero(BIG x);
+/**	@brief Set DBIG to zero (Constant Time)
+ *
+	@param x DBIG number to be set to zero
+ */
+extern void BIG_dzero(DBIG x);
+/**	@brief Set BIG to one (unity) (Constant Time)
+ *
+	@param x BIG number to be set to one.
+ */
+extern void BIG_one(BIG x);
+/**	@brief Set BIG to inverse mod 2^256 (Constant Time)
+ *
+	@param x BIG number to be inverted
+ */
+extern void BIG_invmod2m(BIG x);
+/**	@brief Set BIG to sum of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, sum of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_add(BIG x, BIG y, BIG z);
+
+/**	@brief Set BIG to logical or of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, or of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_or(BIG x, BIG y, BIG z);
+
+/**	@brief Increment BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be incremented
+	@param i integer
+ */
+extern void BIG_inc(BIG x, int i);
+/**	@brief Set BIG to difference of two BIGs (Constant Time)
+ *
+	@param x BIG number, difference of other two - output not normalised
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_sub(BIG x, BIG y, BIG z);
+/**	@brief Decrement BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be decremented
+	@param i integer
+ */
+extern void BIG_dec(BIG x, int i);
+/**	@brief Set DBIG to sum of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, sum of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dadd(DBIG x, DBIG y, DBIG z);
+/**	@brief Set DBIG to difference of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, difference of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dsub(DBIG x, DBIG y, DBIG z);
+/**	@brief Multiply BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_imul(BIG x, BIG y, int i);
+/**	@brief Multiply BIG by not-so-small small integer - output normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+	@return Overflowing bits
+ */
+extern chunk BIG_pmul(BIG x, BIG y, int i);
+/**	@brief Divide BIG by 3 - output normalised (Constant Time)
+ *
+	@param x BIG number
+	@return Remainder
+ */
+extern int BIG_div3(BIG x);
+/**	@brief Multiply BIG by even bigger small integer resulting in a DBIG - output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_pxmul(DBIG x, BIG y, int i);
+/**	@brief Multiply BIG by another BIG resulting in DBIG - inputs normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_mul(DBIG x, BIG y, BIG z);
+/**	@brief Multiply BIG by another BIG resulting in another BIG - inputs normalised and output normalised (Constant Time)
+ *
+	Note that the product must fit into a BIG, and x must be distinct from y and z
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_smul(BIG x, BIG y, BIG z);
+/**	@brief Square BIG resulting in a DBIG - input normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, square of a BIG
+	@param y BIG number to be squared
+ */
+extern void BIG_sqr(DBIG x, BIG y);
+
+/**	@brief Montgomery reduction of a DBIG to a BIG  - input normalised and output normalised (Constant Time)
+ *
+	@param a BIG number, reduction of a BIG
+	@param md BIG number, the modulus
+	@param MC the Montgomery Constant
+	@param d DBIG number to be reduced
+ */
+extern void BIG_monty(BIG a, BIG md, chunk MC, DBIG d);
+
+/**	@brief Shifts a BIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shl(BIG x, int s);
+/**	@brief Fast shifts a BIG left by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Overflow bits
+ */
+extern int BIG_fshl(BIG x, int s);
+/**	@brief Shifts a DBIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshl(DBIG x, int s);
+/**	@brief Shifts a BIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shr(BIG x, int s);
+
+
+/**	@brief Fast time-critical combined shift by 1 bit, subtract and normalise (Constant Time)
+ *
+	@param r BIG number normalised output
+	@param a BIG number to be subtracted from
+	@param m BIG number to be shifted and subtracted
+	@return sign of r
+ */
+extern int BIG_ssn(BIG r, BIG a, BIG m);
+
+/**	@brief Fast shifts a BIG right by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Shifted out bits
+ */
+extern int BIG_fshr(BIG x, int s);
+/**	@brief Shifts a DBIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshr(DBIG x, int s);
+/**	@brief Splits a DBIG into two BIGs - input must be normalised, outputs normalised (Constant Time as used)
+ *
+	Internal function. The value of s must be approximately in the middle of the DBIG.
+	Typically used to extract z mod 2^MODBITS and z/2^MODBITS
+	@param x BIG number, top half of z
+	@param y BIG number, bottom half of z
+	@param z DBIG number to be split in two.
+	@param s Bit position at which to split
+	@return carry-out from top half
+ */
+extern chunk BIG_split(BIG x, BIG y, DBIG z, int s);
+/**	@brief Normalizes a BIG number - output normalised (Constant Time)
+ *
+	All digits of the input BIG are reduced mod 2^BASEBITS
+	@param x BIG number to be normalised
+ */
+extern chunk BIG_norm(BIG x);
+/**	@brief Normalizes a DBIG number - output normalised (Constant Time)
+ *
+	All digits of the input DBIG are reduced mod 2^BASEBITS
+	@param x DBIG number to be normalised
+ */
+extern void BIG_dnorm(DBIG x);
+/**	@brief Compares two BIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first BIG number to be compared
+	@param y second BIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_comp(BIG x, BIG y);
+/**	@brief Compares two DBIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first DBIG number to be compared
+	@param y second DBIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_dcomp(DBIG x, DBIG y);
+/**	@brief Calculate number of bits in a BIG - output normalised (Variable Time)
+ *
+	@param x BIG number
+	@return Number of bits in x
+ */
+extern int BIG_nbits(BIG x);
+/**	@brief Calculate number of bits in a DBIG - output normalised (Variable Time)
+ *
+	@param x DBIG number
+	@return Number of bits in x
+ */
+extern int BIG_dnbits(DBIG x);
+
+/**	@brief Reduce x mod n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctmod(BIG x, BIG n, int bd);
+
+/**	@brief  x=y mod n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctdmod(BIG x, DBIG y, BIG n, int bd);
+
+/**	@brief Divide x by n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctsdiv(BIG x,BIG n,int bd);
+
+/**	@brief  x=y/n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctddiv(BIG x, DBIG y, BIG n,int bd);
+
+
+/**	@brief Reduce x mod n - input and output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+ */
+extern void BIG_mod(BIG x, BIG n);
+/**	@brief Divide x by n - output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+ */
+extern void BIG_sdiv(BIG x, BIG n);
+/**	@brief  x=y mod n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_dmod(BIG x, DBIG y, BIG n);
+/**	@brief  x=y/n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_ddiv(BIG x, DBIG y, BIG n);
+/**	@brief  return parity of BIG, that is the least significant bit (Constant Time)
+ *
+	@param x BIG number
+	@return 0 or 1
+ */
+extern int BIG_parity(BIG x);
+/**	@brief  return i-th of BIG (Constant Time)
+ *
+	@param x BIG number
+	@param i the bit of x to be returned
+	@return 0 or 1
+ */
+extern int BIG_bit(BIG x, int i);
+/**	@brief  return least significant bits of a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param n number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int BIG_lastbits(BIG x, int n);
+/**	@brief  Create a random BIG from a random number generator (Constant Time)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_random(BIG x, csprng *r);
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randomnum(BIG x, BIG n, csprng *r);
+
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus and truncated to max bit length (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param t Maximum bit length
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randtrunc(BIG x, BIG n, int t, csprng *r);
+
+/**	brief  return NAF (Non-Adjacent-Form) value as +/- 1, 3 or 5, inputs must be normalised
+ *
+	Given x and 3*x extracts NAF value from given bit position, and returns number of bits processed, and number of trailing zeros detected if any
+	param x BIG number
+	param x3 BIG number, three times x
+	param i bit position
+	param nbs pointer to integer returning number of bits processed
+	param nzs pointer to integer returning number of trailing 0s
+	return + or - 1, 3 or 5
+*/
+
+/**	@brief  Calculate x=y*z mod n (Variable Time)
+ *
+	Slow method for modular multiplication
+	@param x BIG number, on exit = y*z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modmul(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y/z mod n (Variable Time)
+ *
+	Slow method for modular division
+	@param x BIG number, on exit = y/z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_moddiv(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y^2 mod n (Variable Time)
+ *
+	Slow method for modular squaring
+	@param x BIG number, on exit = y^2 mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modsqr(BIG x, BIG y, BIG n);
+/**	@brief  Calculate x=-y mod n (Variable Time)
+ *
+	Modular negation
+	@param x BIG number, on exit = -y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modneg(BIG x, BIG y, BIG n);
+
+/**	@brief  Calculate x=y+z mod n (Variable Time)
+ *
+	Slow method for modular addition
+	@param x BIG number, on exit = y+z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modadd(BIG x, BIG y, BIG z, BIG n);
+
+/**	@brief  Calculate jacobi Symbol (x/y) (Variable Time)
+ *
+	@param x BIG number
+	@param y BIG number
+	@return Jacobi symbol, -1,0 or 1
+ */
+extern int BIG_jacobi(BIG x, BIG y);
+/**	@brief  Calculate x=1/y mod n (Variable Time)
+ *
+	Modular Inversion - This is slow. Uses binary method.
+	@param x BIG number, on exit = 1/y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_invmodp(BIG x, BIG y, BIG n);
+/** @brief Calculate x=x mod 2^m (Variable Time)
+ *
+	Truncation
+	@param x BIG number, on reduced mod 2^m
+	@param m new truncated size
+*/
+extern void BIG_mod2m(BIG x, int m);
+
+/**	@brief Calculates a*b+c+*d
+ *
+	Calculate partial product of a.b, add in carry c, and add total to d (Constant Time)
+	@param a multiplier
+	@param b multiplicand
+	@param c carry
+	@param d pointer to accumulated bottom half of result
+	@return top half of result
+ */
+
+
+extern int step1(BIG,BIG,BIG);
+extern void step2(BIG,BIG,BIG);
+
+#ifdef dchunk
+
+/* Method required to calculate x*y+c+r, bottom half in r, top half returned */
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    dchunk prod = (dchunk)x * y + c + *r;
+    *r = (chunk)prod & BMASK_B584_60;
+    return (chunk)(prod >> BASEBITS_B584_60);
+}
+
+#else
+
+/* No integer type available that can store double the wordlength */
+/* accumulate partial products */
+
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    chunk x0, x1, y0, y1;
+    chunk bot, top, mid, carry;
+    x0 = x & HMASK_B584_60;
+    x1 = (x >> HBITS_B584_60);
+    y0 = y & HMASK_B584_60;
+    y1 = (y >> HBITS_B584_60);
+    bot = x0 * y0;
+    top = x1 * y1;
+    mid = x0 * y1 + x1 * y0;
+    x0 = mid & HMASK_B584_60;
+    x1 = (mid >> HBITS_B584_60);
+    bot += x0 << HBITS_B584_60;
+    bot += *r;
+    bot += c;
+
+    top += x1;
+    carry = bot >> BASEBITS_B584_60;
+    bot &= BMASK_B584_60;
+    top += carry;
+
+    *r = bot;
+    return top;
+}
+
+#endif
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/bls.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/bls.cpp
new file mode 100644
index 0000000..e5e204e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/bls.cpp
@@ -0,0 +1,188 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* Boneh-Lynn-Shacham signature 128-bit API */
+
+/* Loosely (for now) following https://datatracker.ietf.org/doc/html/draft-irtf-cfrg-bls-signature-02 */
+
+// Minimal-signature-size variant
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include "bls_ZZZ.h"
+
+using namespace XXX;
+using namespace YYY;
+
+#ifndef CORE_ARDUINO
+static FP4 G2_TAB[G2_TABLE_ZZZ];  // space for precomputation on fixed G2 parameter
+#endif
+
+#define CEIL(a,b) (((a)-1)/(b)+1)
+
+/* output u[i] \in F_p */
+/* https://datatracker.ietf.org/doc/draft-irtf-cfrg-hash-to-curve/ */
+static void hash_to_field(int hash,int hlen,FP *u,octet *DST,octet *M, int ctr)
+{
+    int i,j,L,nbq;
+    BIG q,w;
+    DBIG dx;
+    char okm[256],fd[128];
+    octet OKM = {0,sizeof(okm),okm};
+
+    BIG_rcopy(q, Modulus);
+    nbq=BIG_nbits(q);
+    L=CEIL(nbq+CURVE_SECURITY_ZZZ,8);
+
+    XMD_Expand(hash,hlen,&OKM,L*ctr,DST,M);
+    for (i=0;i<ctr;i++)
+    {
+        for (j=0;j<L;j++)
+            fd[j]=OKM.val[i*L+j];
+        
+        BIG_dfromBytesLen(dx,fd,L);
+        BIG_ctdmod(w,dx,q,8*L-nbq);
+        FP_nres(&u[i],w);
+    }
+}
+
+/* hash a message to an ECP point, using SHA2, random oracle method */
+static void BLS_HASH_TO_POINT(ECP *P, octet *M)
+{
+    FP u[2];
+    ECP P1;
+    char dst[50];
+    octet DST = {0,sizeof(dst),dst};
+
+    OCT_jstring(&DST,(char *)"BLS_SIG_ZZZG1_XMD:SHA-256_SVDW_RO_NUL_");
+    hash_to_field(MC_SHA2,HASH_TYPE_ZZZ,u,&DST,M,2);
+
+    ECP_map2point(P,&u[0]);
+    ECP_map2point(&P1,&u[1]);
+
+    ECP_add(P,&P1);
+    ECP_cfp(P);
+    ECP_affine(P);
+}
+
+#ifdef CORE_ARDUINO
+int ZZZ::BLS_INIT()
+{
+    return BLS_OK;
+}
+#else
+int ZZZ::BLS_INIT()
+{
+    ECP2 G;
+    if (!ECP2_generator(&G)) return BLS_FAIL;
+    PAIR_precomp(G2_TAB, &G);  // should be done just once on start-up
+    return BLS_OK;
+}
+#endif
+
+/* generate key pair, private key S, public key W */
+
+int ZZZ::BLS_KEY_PAIR_GENERATE(octet *IKM, octet* S, octet *W)
+{
+    int nbr,L;
+    BIG r,s;
+    DBIG dx;
+    ECP2 G;
+    char salt[20],prk[HASH_TYPE_ZZZ],okm[128],aikm[65],len[2];
+    octet SALT = {0,sizeof(salt),salt};
+    octet PRK = {0,sizeof(prk),prk};
+    octet OKM = {0,sizeof(okm),okm};
+    octet AIKM = {0,sizeof(aikm),aikm};
+    octet LEN = {0,sizeof(len),len};
+
+    OCT_copy(&AIKM,IKM);
+    OCT_jbyte(&AIKM,0,1);
+
+    BIG_rcopy(r, CURVE_Order);
+    nbr=BIG_nbits(r);
+    L=CEIL(3*CEIL(nbr,8),2);
+    OCT_jint(&LEN,L,2);
+
+    if (!ECP2_generator(&G)) return BLS_FAIL;
+
+    OCT_jstring(&SALT,(char *)"BLS-SIG-KEYGEN-SALT-");
+    HKDF_Extract(MC_SHA2,HASH_TYPE_ZZZ,&PRK,&SALT,&AIKM);
+    HKDF_Expand(MC_SHA2,HASH_TYPE_ZZZ,&OKM,L,&PRK,&LEN);
+
+    BIG_dfromBytesLen(dx,OKM.val,L);
+    BIG_ctdmod(s,dx,r,8*L-nbr);
+    BIG_toBytes(S->val, s);
+    S->len = MODBYTES_XXX;
+
+// SkToPk
+
+    PAIR_G2mul(&G, s);
+    ECP2_toOctet(W, &G, true);
+    return BLS_OK;
+}
+
+
+/* Sign message M using private key S to produce signature SIG */
+
+int ZZZ::BLS_CORE_SIGN(octet *SIG, octet *M, octet *S)
+{
+    BIG s;
+    ECP D;
+    BLS_HASH_TO_POINT(&D, M);
+    BIG_fromBytes(s, S->val);
+    PAIR_G1mul(&D, s);
+    ECP_toOctet(SIG, &D, true); /* compress output */
+    return BLS_OK;
+}
+
+/* Verify signature given message M, the signature SIG, and the public key W */
+int ZZZ::BLS_CORE_VERIFY(octet *SIG, octet *M, octet *W)
+{
+    FP12 v;
+    ECP2 G, PK;
+    ECP D, HM;
+    BLS_HASH_TO_POINT(&HM, M);
+
+    ECP_fromOctet(&D, SIG);
+	if (!PAIR_G1member(&D)) return BLS_FAIL;
+    ECP_neg(&D);
+
+    ECP2_fromOctet(&PK, W);
+	if (!PAIR_G2member(&PK)) return BLS_FAIL;
+
+// Use multi-pairing mechanism and precomputation on G2
+#ifndef CORE_ARDUINO
+    FP12 r[ATE_BITS_ZZZ];  // space for accumulated line functions
+
+    PAIR_initmp(r);
+    PAIR_another_pc(r, G2_TAB, &D);
+    PAIR_another(r, &PK, &HM);
+    PAIR_miller(&v, r);
+#else
+//.. or alternatively just
+    if (!ECP2_generator(&G)) return BLS_FAIL;
+    PAIR_double_ate(&v, &G, &D, &PK, &HM);
+#endif
+    PAIR_fexp(&v);
+
+    if (FP12_isunity(&v)) return BLS_OK;
+    return BLS_FAIL;
+}
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/bls.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/bls.h
new file mode 100644
index 0000000..d91ee9d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/bls.h
@@ -0,0 +1,87 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file bls.h
+ * @author Mike Scott
+ * @date 28th Novemebr 2018
+ * @brief BLS Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef BLS_ZZZ_H
+#define BLS_ZZZ_H
+
+#include "pair_ZZZ.h"
+
+using namespace core;
+
+namespace ZZZ {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define BGS_ZZZ MODBYTES_XXX  /**< BLS Group Size */
+#define BFS_ZZZ MODBYTES_XXX  /**< BLS Field Size */
+
+#define BLS_OK           0  /**< Function completed without error */
+#define BLS_FAIL        -1  /**< Point is NOT on the curve */
+
+/* BLS API functions */
+
+
+/** @brief Initialise BLS
+ *
+    @return BLS_OK if worked, otherwise BLS_FAIL
+ */
+int BLS_INIT();
+
+/** @brief Generate Key Pair
+ *
+    @param IKM contains truly random keying material
+    @param S on output a private key
+    @param W on output a public key = S*G, where G is fixed generator
+    @return BLS_OK
+ */
+int BLS_KEY_PAIR_GENERATE(octet *IKM, octet* S, octet *W);
+
+/** @brief Calculate a signature
+ *
+    @param SIG the ouput signature
+    @param M is the message to be signed
+    @param S an input private key
+    @return BLS_OK
+ */
+int BLS_CORE_SIGN(octet *SIG, octet *M, octet *S);
+
+/** @brief Verify a signature
+ *
+    @param SIG an input signature
+    @param M is the message whose signature is to be verified.
+    @param W an public key
+    @return BLS_OK if verified, otherwise BLS_FAIL
+ */
+int BLS_CORE_VERIFY(octet *SIG, octet *M, octet *W);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/bls192.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/bls192.cpp
new file mode 100644
index 0000000..e9c48ed
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/bls192.cpp
@@ -0,0 +1,189 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* Boneh-Lynn-Shacham signature 192-bit API */
+
+/* Loosely (for now) following https://datatracker.ietf.org/doc/html/draft-irtf-cfrg-bls-signature-02 */
+
+// Minimal-signature-size variant
+
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include "bls192_ZZZ.h"
+
+using namespace XXX;
+using namespace YYY;
+
+#ifndef CORE_ARDUINO
+static FP8 G2_TAB[G2_TABLE_ZZZ];  // space for precomputation on fixed G2 parameter
+#endif
+
+#define CEIL(a,b) (((a)-1)/(b)+1)
+
+/* output u[i] \in F_p */
+/* https://datatracker.ietf.org/doc/draft-irtf-cfrg-hash-to-curve/ */
+static void hash_to_field(int hash,int hlen,FP *u,octet *DST,octet *M, int ctr)
+{
+    int i,j,L,nbq;
+    BIG q,w;
+    DBIG dx;
+    char okm[256],fd[128];
+    octet OKM = {0,sizeof(okm),okm};
+
+    BIG_rcopy(q, Modulus);
+    nbq=BIG_nbits(q);
+    L=CEIL(nbq+CURVE_SECURITY_ZZZ,8);
+
+    XMD_Expand(hash,hlen,&OKM,L*ctr,DST,M);
+    for (i=0;i<ctr;i++)
+    {
+        for (j=0;j<L;j++)
+            fd[j]=OKM.val[i*L+j];
+        
+        BIG_dfromBytesLen(dx,fd,L);
+        BIG_ctdmod(w,dx,q,8*L-nbq);
+        FP_nres(&u[i],w);
+    }
+}
+
+/* hash a message to an ECP point, using SHA2, random oracle method */
+static void BLS_HASH_TO_POINT(ECP *P, octet *M)
+{
+    FP u[2];
+    ECP P1;
+    char dst[50];
+    octet DST = {0,sizeof(dst),dst};
+
+    OCT_jstring(&DST,(char *)"BLS_SIG_ZZZG1_XMD:SHA-384_SVDW_RO_NUL_");
+    hash_to_field(MC_SHA2,HASH_TYPE_ZZZ,u,&DST,M,2);
+
+    ECP_map2point(P,&u[0]);
+    ECP_map2point(&P1,&u[1]);
+
+    ECP_add(P,&P1);
+    ECP_cfp(P);
+    ECP_affine(P);
+}
+
+#ifdef CORE_ARDUINO
+int ZZZ::BLS_INIT()
+{
+    return BLS_OK;
+}
+#else
+int ZZZ::BLS_INIT()
+{
+    ECP4 G;
+    if (!ECP4_generator(&G)) return BLS_FAIL;
+    PAIR_precomp(G2_TAB, &G);  // should be done just once on start-up
+    return BLS_OK;
+}
+#endif
+
+/* generate key pair, private key S, public key W */
+
+int ZZZ::BLS_KEY_PAIR_GENERATE(octet *IKM, octet* S, octet *W)
+{
+    int nbr,L;
+    BIG r,s;
+    DBIG dx;
+    ECP4 G;
+    char salt[20],prk[HASH_TYPE_ZZZ],okm[128],aikm[65],len[2];
+    octet SALT = {0,sizeof(salt),salt};
+    octet PRK = {0,sizeof(prk),prk};
+    octet OKM = {0,sizeof(okm),okm};
+    octet AIKM = {0,sizeof(aikm),aikm};
+    octet LEN = {0,sizeof(len),len};
+
+    OCT_copy(&AIKM,IKM);
+    OCT_jbyte(&AIKM,0,1);
+
+    BIG_rcopy(r, CURVE_Order);
+    nbr=BIG_nbits(r);
+    L=CEIL(3*CEIL(nbr,8),2);
+    OCT_jint(&LEN,L,2);
+
+    if (!ECP4_generator(&G)) return BLS_FAIL;
+
+    OCT_jstring(&SALT,(char *)"BLS-SIG-KEYGEN-SALT-");
+    HKDF_Extract(MC_SHA2,HASH_TYPE_ZZZ,&PRK,&SALT,&AIKM);
+    HKDF_Expand(MC_SHA2,HASH_TYPE_ZZZ,&OKM,L,&PRK,&LEN);
+
+    BIG_dfromBytesLen(dx,OKM.val,L);
+    BIG_ctdmod(s,dx,r,8*L-nbr);
+    BIG_toBytes(S->val, s);
+    S->len = MODBYTES_XXX;
+
+// SkToPk
+
+    PAIR_G2mul(&G, s);
+    ECP4_toOctet(W, &G, true);
+    return BLS_OK;
+}
+
+
+/* Sign message m using private key S to produce signature SIG */
+
+int ZZZ::BLS_CORE_SIGN(octet *SIG, octet *M, octet *S)
+{
+    BIG s;
+    ECP D;
+    BLS_HASH_TO_POINT(&D, M);
+    BIG_fromBytes(s, S->val);
+    PAIR_G1mul(&D, s);
+    ECP_toOctet(SIG, &D, true); /* compress output */
+    return BLS_OK;
+}
+
+/* Verify signature given message M, the signature SIG, and the public key W */
+int ZZZ::BLS_CORE_VERIFY(octet *SIG, octet *M, octet *W)
+{
+    FP24 v;
+    ECP4 G, PK;
+    ECP D, HM;
+    BLS_HASH_TO_POINT(&HM, M);
+
+    ECP_fromOctet(&D, SIG);
+	if (!PAIR_G1member(&D)) return BLS_FAIL;
+    ECP_neg(&D);
+
+    ECP4_fromOctet(&PK, W);
+	if (!PAIR_G2member(&PK)) return BLS_FAIL;
+
+// Use new multi-pairing mechanism
+#ifndef CORE_ARDUINO
+    FP24 r[ATE_BITS_ZZZ];
+
+    PAIR_initmp(r);
+    PAIR_another_pc(r, G2_TAB, &D);
+    PAIR_another(r, &PK, &HM);
+    PAIR_miller(&v, r);
+#else
+//.. or alternatively
+    if (!ECP4_generator(&G)) return BLS_FAIL;
+    PAIR_double_ate(&v, &G, &D, &PK, &HM);
+#endif
+    PAIR_fexp(&v);
+
+    if (FP24_isunity(&v)) return BLS_OK;
+    return BLS_FAIL;
+}
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/bls192.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/bls192.h
new file mode 100644
index 0000000..2432d91
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/bls192.h
@@ -0,0 +1,86 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file bls192.h
+ * @author Mike Scott
+ * @date 28th Novemebr 2018
+ * @brief BLS Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef BLS192_ZZZ_H
+#define BLS192_ZZZ_H
+
+#include "pair4_ZZZ.h"
+
+using namespace core;
+
+namespace ZZZ {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define BGS_ZZZ MODBYTES_XXX  /**< BLS Group Size */
+#define BFS_ZZZ MODBYTES_XXX  /**< BLS Field Size */
+
+#define BLS_OK           0  /**< Function completed without error */
+#define BLS_FAIL        -1  /**< Point is NOT on the curve */
+
+/* BLS API functions */
+
+/** @brief Initialise BLS
+ *
+    @return BLS_OK if worked, otherwise BLS_FAIL
+ */
+int BLS_INIT();
+
+/** @brief Generate Key Pair
+ *
+    @param IKM contains truly random keying material
+    @param S on output a private key
+    @param W on output a public key = S*G, where G is fixed generator
+    @return BLS_OK
+ */
+int BLS_KEY_PAIR_GENERATE(octet *IKM, octet* S, octet *W);
+
+/** @brief Calculate a signature
+ *
+    @param SIG the ouput signature
+    @param M is the message to be signed
+    @param S an input private key
+    @return BLS_OK
+ */
+int BLS_CORE_SIGN(octet *SIG, octet *M, octet *S);
+
+/** @brief Verify a signature
+ *
+    @param SIG an input signature
+    @param M is the message whose signature is to be verified.
+    @param W an public key
+    @return BLS_OK if verified, otherwise BLS_FAIL
+ */
+int BLS_CORE_VERIFY(octet *SIG, octet *M, octet *W);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/bls192_BLS24479.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/bls192_BLS24479.h
new file mode 100644
index 0000000..e5b67f5
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/bls192_BLS24479.h
@@ -0,0 +1,86 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file bls192.h
+ * @author Mike Scott
+ * @date 28th Novemebr 2018
+ * @brief BLS Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef BLS192_BLS24479_H
+#define BLS192_BLS24479_H
+
+#include "pair4_BLS24479.h"
+
+using namespace core;
+
+namespace BLS24479 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define BGS_BLS24479 MODBYTES_B480_56  /**< BLS Group Size */
+#define BFS_BLS24479 MODBYTES_B480_56  /**< BLS Field Size */
+
+#define BLS_OK           0  /**< Function completed without error */
+#define BLS_FAIL        -1  /**< Point is NOT on the curve */
+
+/* BLS API functions */
+
+/** @brief Initialise BLS
+ *
+    @return BLS_OK if worked, otherwise BLS_FAIL
+ */
+int BLS_INIT();
+
+/** @brief Generate Key Pair
+ *
+    @param IKM contains truly random keying material
+    @param S on output a private key
+    @param W on output a public key = S*G, where G is fixed generator
+    @return BLS_OK
+ */
+int BLS_KEY_PAIR_GENERATE(octet *IKM, octet* S, octet *W);
+
+/** @brief Calculate a signature
+ *
+    @param SIG the ouput signature
+    @param M is the message to be signed
+    @param S an input private key
+    @return BLS_OK
+ */
+int BLS_CORE_SIGN(octet *SIG, octet *M, octet *S);
+
+/** @brief Verify a signature
+ *
+    @param SIG an input signature
+    @param M is the message whose signature is to be verified.
+    @param W an public key
+    @return BLS_OK if verified, otherwise BLS_FAIL
+ */
+int BLS_CORE_VERIFY(octet *SIG, octet *M, octet *W);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/bls256.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/bls256.cpp
new file mode 100644
index 0000000..ba36355
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/bls256.cpp
@@ -0,0 +1,185 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* Boneh-Lynn-Shacham signature 256-bit API */
+
+/* Loosely (for now) following https://datatracker.ietf.org/doc/html/draft-irtf-cfrg-bls-signature-02 */
+
+// Minimal-signature-size variant
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include "bls256_ZZZ.h"
+
+using namespace XXX;
+using namespace YYY;
+
+#ifndef CORE_ARDUINO
+static FP16 G2_TAB[G2_TABLE_ZZZ];  // space for precomputation on fixed G2 parameter
+#endif
+
+#define CEIL(a,b) (((a)-1)/(b)+1)
+
+/* output u[i] \in F_p */
+/* https://datatracker.ietf.org/doc/draft-irtf-cfrg-hash-to-curve/ */
+static void hash_to_field(int hash,int hlen,FP *u,octet *DST,octet *M, int ctr)
+{
+    int i,j,L,nbq;
+    BIG q,w;
+    DBIG dx;
+    char okm[256],fd[128];
+    octet OKM = {0,sizeof(okm),okm};
+
+    BIG_rcopy(q, Modulus);
+    nbq=BIG_nbits(q);
+    L=CEIL(nbq+CURVE_SECURITY_ZZZ,8);
+
+    XMD_Expand(hash,hlen,&OKM,L*ctr,DST,M);
+    for (i=0;i<ctr;i++)
+    {
+        for (j=0;j<L;j++)
+            fd[j]=OKM.val[i*L+j];
+        
+        BIG_dfromBytesLen(dx,fd,L);
+        BIG_ctdmod(w,dx,q,8*L-nbq);
+        FP_nres(&u[i],w);
+    }
+}
+
+/* hash a message to an ECP point, using SHA2, random oracle method */
+static void BLS_HASH_TO_POINT(ECP *P, octet *M)
+{
+    FP u[2];
+    ECP P1;
+    char dst[50];
+    octet DST = {0,sizeof(dst),dst};
+
+    OCT_jstring(&DST,(char *)"BLS_SIG_ZZZG1_XMD:SHA-512_SVDW_RO_NUL_");
+    hash_to_field(MC_SHA2,HASH_TYPE_ZZZ,u,&DST,M,2);
+
+    ECP_map2point(P,&u[0]);
+    ECP_map2point(&P1,&u[1]);
+
+    ECP_add(P,&P1);
+    ECP_cfp(P);
+    ECP_affine(P);
+}
+
+#ifdef CORE_ARDUINO
+int ZZZ::BLS_INIT()
+{
+    return BLS_OK;
+}
+#else
+int ZZZ::BLS_INIT()
+{
+    ECP8 G;
+    if (!ECP8_generator(&G)) return BLS_FAIL;
+    PAIR_precomp(G2_TAB, &G);  // should be done just once on start-up
+    return BLS_OK;
+}
+#endif
+
+/* generate key pair, private key S, public key W */
+
+int ZZZ::BLS_KEY_PAIR_GENERATE(octet *IKM, octet* S, octet *W)
+{
+    int nbr,L;
+    BIG r,s;
+    DBIG dx;
+    ECP8 G;
+    char salt[20],prk[HASH_TYPE_ZZZ],okm[128],aikm[65],len[2];
+    octet SALT = {0,sizeof(salt),salt};
+    octet PRK = {0,sizeof(prk),prk};
+    octet OKM = {0,sizeof(okm),okm};
+    octet AIKM = {0,sizeof(aikm),aikm};
+    octet LEN = {0,sizeof(len),len};
+
+    OCT_copy(&AIKM,IKM);
+    OCT_jbyte(&AIKM,0,1);
+
+    BIG_rcopy(r, CURVE_Order);
+    nbr=BIG_nbits(r);
+    L=CEIL(3*CEIL(nbr,8),2);
+    OCT_jint(&LEN,L,2);
+
+    if (!ECP8_generator(&G)) return BLS_FAIL;
+
+    OCT_jstring(&SALT,(char *)"BLS-SIG-KEYGEN-SALT-");
+    HKDF_Extract(MC_SHA2,HASH_TYPE_ZZZ,&PRK,&SALT,&AIKM);
+    HKDF_Expand(MC_SHA2,HASH_TYPE_ZZZ,&OKM,L,&PRK,&LEN);
+
+    BIG_dfromBytesLen(dx,OKM.val,L);
+    BIG_ctdmod(s,dx,r,8*L-nbr);
+    BIG_toBytes(S->val, s);
+    S->len = MODBYTES_XXX;
+
+// SkToPk
+
+    PAIR_G2mul(&G, s);
+    ECP8_toOctet(W, &G, true);
+    return BLS_OK;
+}
+/* Sign message m using private key S to produce signature SIG */
+
+int ZZZ::BLS_CORE_SIGN(octet *SIG, octet *M, octet *S)
+{
+    BIG s;
+    ECP D;
+    BLS_HASH_TO_POINT(&D, M);
+    BIG_fromBytes(s, S->val);
+    PAIR_G1mul(&D, s);
+    ECP_toOctet(SIG, &D, true); /* compress output */
+    return BLS_OK;
+}
+
+/* Verify signature of message M, the signature SIG, and the public key W */
+int ZZZ::BLS_CORE_VERIFY(octet *SIG, octet *M, octet *W)
+{
+    FP48 v;
+    ECP8 G, PK;
+    ECP D, HM;
+    BLS_HASH_TO_POINT(&HM, M);
+
+    ECP_fromOctet(&D, SIG);
+	if (!PAIR_G1member(&D)) return BLS_FAIL;
+    ECP_neg(&D);
+
+    ECP8_fromOctet(&PK, W);
+	if (!PAIR_G2member(&PK)) return BLS_FAIL;
+
+// Use new multi-pairing mechanism
+#ifndef CORE_ARDUINO
+    FP48 r[ATE_BITS_ZZZ];
+    PAIR_initmp(r);
+    PAIR_another_pc(r, G2_TAB, &D);
+    PAIR_another(r, &PK, &HM);
+    PAIR_miller(&v, r);
+#else
+//.. or alternatively
+    if (!ECP8_generator(&G)) return BLS_FAIL;
+    PAIR_double_ate(&v, &G, &D, &PK, &HM);
+#endif
+
+    PAIR_fexp(&v);
+    if (FP48_isunity(&v)) return BLS_OK;
+    return BLS_FAIL;
+}
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/bls256.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/bls256.h
new file mode 100644
index 0000000..97a8031
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/bls256.h
@@ -0,0 +1,86 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file bls256.h
+ * @author Mike Scott
+ * @date 28th Novemebr 2018
+ * @brief BLS Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef BLS256_ZZZ_H
+#define BLS256_ZZZ_H
+
+#include "pair8_ZZZ.h"
+
+using namespace core;
+
+namespace ZZZ {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define BGS_ZZZ MODBYTES_XXX  /**< BLS Group Size */
+#define BFS_ZZZ MODBYTES_XXX  /**< BLS Field Size */
+
+#define BLS_OK           0  /**< Function completed without error */
+#define BLS_FAIL        -1  /**< Point is NOT on the curve */
+
+/* BLS API functions */
+
+/** @brief Initialise BLS
+ *
+    @return BLS_OK if worked, otherwise BLS_FAIL
+ */
+int BLS_INIT();
+
+/** @brief Generate Key Pair
+ *
+    @param IKM contains truly random keying material
+    @param S on output a private key
+    @param W on output a public key = S*G, where G is fixed generator
+    @return BLS_OK
+ */
+int BLS_KEY_PAIR_GENERATE(octet *IKM, octet* S, octet *W);
+
+/** @brief Calculate a signature
+ *
+    @param SIG the ouput signature
+    @param m is the message to be signed
+    @param S an input private key
+    @return BLS_OK
+ */
+int BLS_CORE_SIGN(octet *SIG, octet *M, octet *S);
+
+/** @brief Verify a signature
+ *
+    @param SIG an input signature
+    @param m is the message whose signature is to be verified.
+    @param W an public key
+    @return BLS_OK if verified, otherwise BLS_FAIL
+ */
+int BLS_CORE_VERIFY(octet *SIG, octet *M, octet *W);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/bls256_BLS48286.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/bls256_BLS48286.h
new file mode 100644
index 0000000..323f20b
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/bls256_BLS48286.h
@@ -0,0 +1,86 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file bls256.h
+ * @author Mike Scott
+ * @date 28th Novemebr 2018
+ * @brief BLS Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef BLS256_BLS48286_H
+#define BLS256_BLS48286_H
+
+#include "pair8_BLS48286.h"
+
+using namespace core;
+
+namespace BLS48286 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define BGS_BLS48286 MODBYTES_B288_60  /**< BLS Group Size */
+#define BFS_BLS48286 MODBYTES_B288_60  /**< BLS Field Size */
+
+#define BLS_OK           0  /**< Function completed without error */
+#define BLS_FAIL        -1  /**< Point is NOT on the curve */
+
+/* BLS API functions */
+
+/** @brief Initialise BLS
+ *
+    @return BLS_OK if worked, otherwise BLS_FAIL
+ */
+int BLS_INIT();
+
+/** @brief Generate Key Pair
+ *
+    @param IKM contains truly random keying material
+    @param S on output a private key
+    @param W on output a public key = S*G, where G is fixed generator
+    @return BLS_OK
+ */
+int BLS_KEY_PAIR_GENERATE(octet *IKM, octet* S, octet *W);
+
+/** @brief Calculate a signature
+ *
+    @param SIG the ouput signature
+    @param m is the message to be signed
+    @param S an input private key
+    @return BLS_OK
+ */
+int BLS_CORE_SIGN(octet *SIG, octet *M, octet *S);
+
+/** @brief Verify a signature
+ *
+    @param SIG an input signature
+    @param m is the message whose signature is to be verified.
+    @param W an public key
+    @return BLS_OK if verified, otherwise BLS_FAIL
+ */
+int BLS_CORE_VERIFY(octet *SIG, octet *M, octet *W);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/bls256_BLS48556.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/bls256_BLS48556.h
new file mode 100644
index 0000000..a0b79b2
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/bls256_BLS48556.h
@@ -0,0 +1,86 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file bls256.h
+ * @author Mike Scott
+ * @date 28th Novemebr 2018
+ * @brief BLS Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef BLS256_BLS48556_H
+#define BLS256_BLS48556_H
+
+#include "pair8_BLS48556.h"
+
+using namespace core;
+
+namespace BLS48556 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define BGS_BLS48556 MODBYTES_B560_58  /**< BLS Group Size */
+#define BFS_BLS48556 MODBYTES_B560_58  /**< BLS Field Size */
+
+#define BLS_OK           0  /**< Function completed without error */
+#define BLS_FAIL        -1  /**< Point is NOT on the curve */
+
+/* BLS API functions */
+
+/** @brief Initialise BLS
+ *
+    @return BLS_OK if worked, otherwise BLS_FAIL
+ */
+int BLS_INIT();
+
+/** @brief Generate Key Pair
+ *
+    @param IKM contains truly random keying material
+    @param S on output a private key
+    @param W on output a public key = S*G, where G is fixed generator
+    @return BLS_OK
+ */
+int BLS_KEY_PAIR_GENERATE(octet *IKM, octet* S, octet *W);
+
+/** @brief Calculate a signature
+ *
+    @param SIG the ouput signature
+    @param m is the message to be signed
+    @param S an input private key
+    @return BLS_OK
+ */
+int BLS_CORE_SIGN(octet *SIG, octet *M, octet *S);
+
+/** @brief Verify a signature
+ *
+    @param SIG an input signature
+    @param m is the message whose signature is to be verified.
+    @param W an public key
+    @return BLS_OK if verified, otherwise BLS_FAIL
+ */
+int BLS_CORE_VERIFY(octet *SIG, octet *M, octet *W);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/bls256_BLS48581.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/bls256_BLS48581.h
new file mode 100644
index 0000000..1196da4
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/bls256_BLS48581.h
@@ -0,0 +1,86 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file bls256.h
+ * @author Mike Scott
+ * @date 28th Novemebr 2018
+ * @brief BLS Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef BLS256_BLS48581_H
+#define BLS256_BLS48581_H
+
+#include "pair8_BLS48581.h"
+
+using namespace core;
+
+namespace BLS48581 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define BGS_BLS48581 MODBYTES_B584_60  /**< BLS Group Size */
+#define BFS_BLS48581 MODBYTES_B584_60  /**< BLS Field Size */
+
+#define BLS_OK           0  /**< Function completed without error */
+#define BLS_FAIL        -1  /**< Point is NOT on the curve */
+
+/* BLS API functions */
+
+/** @brief Initialise BLS
+ *
+    @return BLS_OK if worked, otherwise BLS_FAIL
+ */
+int BLS_INIT();
+
+/** @brief Generate Key Pair
+ *
+    @param IKM contains truly random keying material
+    @param S on output a private key
+    @param W on output a public key = S*G, where G is fixed generator
+    @return BLS_OK
+ */
+int BLS_KEY_PAIR_GENERATE(octet *IKM, octet* S, octet *W);
+
+/** @brief Calculate a signature
+ *
+    @param SIG the ouput signature
+    @param m is the message to be signed
+    @param S an input private key
+    @return BLS_OK
+ */
+int BLS_CORE_SIGN(octet *SIG, octet *M, octet *S);
+
+/** @brief Verify a signature
+ *
+    @param SIG an input signature
+    @param m is the message whose signature is to be verified.
+    @param W an public key
+    @return BLS_OK if verified, otherwise BLS_FAIL
+ */
+int BLS_CORE_VERIFY(octet *SIG, octet *M, octet *W);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/bls_BLS12381.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/bls_BLS12381.h
new file mode 100644
index 0000000..e1bf9ff
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/bls_BLS12381.h
@@ -0,0 +1,87 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file bls.h
+ * @author Mike Scott
+ * @date 28th Novemebr 2018
+ * @brief BLS Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef BLS_BLS12381_H
+#define BLS_BLS12381_H
+
+#include "pair_BLS12381.h"
+
+using namespace core;
+
+namespace BLS12381 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define BGS_BLS12381 MODBYTES_B384_58  /**< BLS Group Size */
+#define BFS_BLS12381 MODBYTES_B384_58  /**< BLS Field Size */
+
+#define BLS_OK           0  /**< Function completed without error */
+#define BLS_FAIL        -1  /**< Point is NOT on the curve */
+
+/* BLS API functions */
+
+
+/** @brief Initialise BLS
+ *
+    @return BLS_OK if worked, otherwise BLS_FAIL
+ */
+int BLS_INIT();
+
+/** @brief Generate Key Pair
+ *
+    @param IKM contains truly random keying material
+    @param S on output a private key
+    @param W on output a public key = S*G, where G is fixed generator
+    @return BLS_OK
+ */
+int BLS_KEY_PAIR_GENERATE(octet *IKM, octet* S, octet *W);
+
+/** @brief Calculate a signature
+ *
+    @param SIG the ouput signature
+    @param M is the message to be signed
+    @param S an input private key
+    @return BLS_OK
+ */
+int BLS_CORE_SIGN(octet *SIG, octet *M, octet *S);
+
+/** @brief Verify a signature
+ *
+    @param SIG an input signature
+    @param M is the message whose signature is to be verified.
+    @param W an public key
+    @return BLS_OK if verified, otherwise BLS_FAIL
+ */
+int BLS_CORE_VERIFY(octet *SIG, octet *M, octet *W);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/bls_BLS12383.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/bls_BLS12383.h
new file mode 100644
index 0000000..32bd832
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/bls_BLS12383.h
@@ -0,0 +1,87 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file bls.h
+ * @author Mike Scott
+ * @date 28th Novemebr 2018
+ * @brief BLS Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef BLS_BLS12383_H
+#define BLS_BLS12383_H
+
+#include "pair_BLS12383.h"
+
+using namespace core;
+
+namespace BLS12383 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define BGS_BLS12383 MODBYTES_B384_58  /**< BLS Group Size */
+#define BFS_BLS12383 MODBYTES_B384_58  /**< BLS Field Size */
+
+#define BLS_OK           0  /**< Function completed without error */
+#define BLS_FAIL        -1  /**< Point is NOT on the curve */
+
+/* BLS API functions */
+
+
+/** @brief Initialise BLS
+ *
+    @return BLS_OK if worked, otherwise BLS_FAIL
+ */
+int BLS_INIT();
+
+/** @brief Generate Key Pair
+ *
+    @param IKM contains truly random keying material
+    @param S on output a private key
+    @param W on output a public key = S*G, where G is fixed generator
+    @return BLS_OK
+ */
+int BLS_KEY_PAIR_GENERATE(octet *IKM, octet* S, octet *W);
+
+/** @brief Calculate a signature
+ *
+    @param SIG the ouput signature
+    @param M is the message to be signed
+    @param S an input private key
+    @return BLS_OK
+ */
+int BLS_CORE_SIGN(octet *SIG, octet *M, octet *S);
+
+/** @brief Verify a signature
+ *
+    @param SIG an input signature
+    @param M is the message whose signature is to be verified.
+    @param W an public key
+    @return BLS_OK if verified, otherwise BLS_FAIL
+ */
+int BLS_CORE_VERIFY(octet *SIG, octet *M, octet *W);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/bls_BLS12443.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/bls_BLS12443.h
new file mode 100644
index 0000000..42b13f5
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/bls_BLS12443.h
@@ -0,0 +1,87 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file bls.h
+ * @author Mike Scott
+ * @date 28th Novemebr 2018
+ * @brief BLS Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef BLS_BLS12443_H
+#define BLS_BLS12443_H
+
+#include "pair_BLS12443.h"
+
+using namespace core;
+
+namespace BLS12443 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define BGS_BLS12443 MODBYTES_B448_60  /**< BLS Group Size */
+#define BFS_BLS12443 MODBYTES_B448_60  /**< BLS Field Size */
+
+#define BLS_OK           0  /**< Function completed without error */
+#define BLS_FAIL        -1  /**< Point is NOT on the curve */
+
+/* BLS API functions */
+
+
+/** @brief Initialise BLS
+ *
+    @return BLS_OK if worked, otherwise BLS_FAIL
+ */
+int BLS_INIT();
+
+/** @brief Generate Key Pair
+ *
+    @param IKM contains truly random keying material
+    @param S on output a private key
+    @param W on output a public key = S*G, where G is fixed generator
+    @return BLS_OK
+ */
+int BLS_KEY_PAIR_GENERATE(octet *IKM, octet* S, octet *W);
+
+/** @brief Calculate a signature
+ *
+    @param SIG the ouput signature
+    @param M is the message to be signed
+    @param S an input private key
+    @return BLS_OK
+ */
+int BLS_CORE_SIGN(octet *SIG, octet *M, octet *S);
+
+/** @brief Verify a signature
+ *
+    @param SIG an input signature
+    @param M is the message whose signature is to be verified.
+    @param W an public key
+    @return BLS_OK if verified, otherwise BLS_FAIL
+ */
+int BLS_CORE_VERIFY(octet *SIG, octet *M, octet *W);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/bls_BLS12461.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/bls_BLS12461.h
new file mode 100644
index 0000000..f52b401
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/bls_BLS12461.h
@@ -0,0 +1,87 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file bls.h
+ * @author Mike Scott
+ * @date 28th Novemebr 2018
+ * @brief BLS Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef BLS_BLS12461_H
+#define BLS_BLS12461_H
+
+#include "pair_BLS12461.h"
+
+using namespace core;
+
+namespace BLS12461 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define BGS_BLS12461 MODBYTES_B464_60  /**< BLS Group Size */
+#define BFS_BLS12461 MODBYTES_B464_60  /**< BLS Field Size */
+
+#define BLS_OK           0  /**< Function completed without error */
+#define BLS_FAIL        -1  /**< Point is NOT on the curve */
+
+/* BLS API functions */
+
+
+/** @brief Initialise BLS
+ *
+    @return BLS_OK if worked, otherwise BLS_FAIL
+ */
+int BLS_INIT();
+
+/** @brief Generate Key Pair
+ *
+    @param IKM contains truly random keying material
+    @param S on output a private key
+    @param W on output a public key = S*G, where G is fixed generator
+    @return BLS_OK
+ */
+int BLS_KEY_PAIR_GENERATE(octet *IKM, octet* S, octet *W);
+
+/** @brief Calculate a signature
+ *
+    @param SIG the ouput signature
+    @param M is the message to be signed
+    @param S an input private key
+    @return BLS_OK
+ */
+int BLS_CORE_SIGN(octet *SIG, octet *M, octet *S);
+
+/** @brief Verify a signature
+ *
+    @param SIG an input signature
+    @param M is the message whose signature is to be verified.
+    @param W an public key
+    @return BLS_OK if verified, otherwise BLS_FAIL
+ */
+int BLS_CORE_VERIFY(octet *SIG, octet *M, octet *W);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/bls_BN158.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/bls_BN158.h
new file mode 100644
index 0000000..5ae3c37
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/bls_BN158.h
@@ -0,0 +1,87 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file bls.h
+ * @author Mike Scott
+ * @date 28th Novemebr 2018
+ * @brief BLS Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef BLS_BN158_H
+#define BLS_BN158_H
+
+#include "pair_BN158.h"
+
+using namespace core;
+
+namespace BN158 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define BGS_BN158 MODBYTES_B160_56  /**< BLS Group Size */
+#define BFS_BN158 MODBYTES_B160_56  /**< BLS Field Size */
+
+#define BLS_OK           0  /**< Function completed without error */
+#define BLS_FAIL        -1  /**< Point is NOT on the curve */
+
+/* BLS API functions */
+
+
+/** @brief Initialise BLS
+ *
+    @return BLS_OK if worked, otherwise BLS_FAIL
+ */
+int BLS_INIT();
+
+/** @brief Generate Key Pair
+ *
+    @param IKM contains truly random keying material
+    @param S on output a private key
+    @param W on output a public key = S*G, where G is fixed generator
+    @return BLS_OK
+ */
+int BLS_KEY_PAIR_GENERATE(octet *IKM, octet* S, octet *W);
+
+/** @brief Calculate a signature
+ *
+    @param SIG the ouput signature
+    @param M is the message to be signed
+    @param S an input private key
+    @return BLS_OK
+ */
+int BLS_CORE_SIGN(octet *SIG, octet *M, octet *S);
+
+/** @brief Verify a signature
+ *
+    @param SIG an input signature
+    @param M is the message whose signature is to be verified.
+    @param W an public key
+    @return BLS_OK if verified, otherwise BLS_FAIL
+ */
+int BLS_CORE_VERIFY(octet *SIG, octet *M, octet *W);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/bls_BN254.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/bls_BN254.h
new file mode 100644
index 0000000..3c725b6
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/bls_BN254.h
@@ -0,0 +1,87 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file bls.h
+ * @author Mike Scott
+ * @date 28th Novemebr 2018
+ * @brief BLS Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef BLS_BN254_H
+#define BLS_BN254_H
+
+#include "pair_BN254.h"
+
+using namespace core;
+
+namespace BN254 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define BGS_BN254 MODBYTES_B256_56  /**< BLS Group Size */
+#define BFS_BN254 MODBYTES_B256_56  /**< BLS Field Size */
+
+#define BLS_OK           0  /**< Function completed without error */
+#define BLS_FAIL        -1  /**< Point is NOT on the curve */
+
+/* BLS API functions */
+
+
+/** @brief Initialise BLS
+ *
+    @return BLS_OK if worked, otherwise BLS_FAIL
+ */
+int BLS_INIT();
+
+/** @brief Generate Key Pair
+ *
+    @param IKM contains truly random keying material
+    @param S on output a private key
+    @param W on output a public key = S*G, where G is fixed generator
+    @return BLS_OK
+ */
+int BLS_KEY_PAIR_GENERATE(octet *IKM, octet* S, octet *W);
+
+/** @brief Calculate a signature
+ *
+    @param SIG the ouput signature
+    @param M is the message to be signed
+    @param S an input private key
+    @return BLS_OK
+ */
+int BLS_CORE_SIGN(octet *SIG, octet *M, octet *S);
+
+/** @brief Verify a signature
+ *
+    @param SIG an input signature
+    @param M is the message whose signature is to be verified.
+    @param W an public key
+    @return BLS_OK if verified, otherwise BLS_FAIL
+ */
+int BLS_CORE_VERIFY(octet *SIG, octet *M, octet *W);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/bls_BN254CX.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/bls_BN254CX.h
new file mode 100644
index 0000000..a8e89b7
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/bls_BN254CX.h
@@ -0,0 +1,87 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file bls.h
+ * @author Mike Scott
+ * @date 28th Novemebr 2018
+ * @brief BLS Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef BLS_BN254CX_H
+#define BLS_BN254CX_H
+
+#include "pair_BN254CX.h"
+
+using namespace core;
+
+namespace BN254CX {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define BGS_BN254CX MODBYTES_B256_56  /**< BLS Group Size */
+#define BFS_BN254CX MODBYTES_B256_56  /**< BLS Field Size */
+
+#define BLS_OK           0  /**< Function completed without error */
+#define BLS_FAIL        -1  /**< Point is NOT on the curve */
+
+/* BLS API functions */
+
+
+/** @brief Initialise BLS
+ *
+    @return BLS_OK if worked, otherwise BLS_FAIL
+ */
+int BLS_INIT();
+
+/** @brief Generate Key Pair
+ *
+    @param IKM contains truly random keying material
+    @param S on output a private key
+    @param W on output a public key = S*G, where G is fixed generator
+    @return BLS_OK
+ */
+int BLS_KEY_PAIR_GENERATE(octet *IKM, octet* S, octet *W);
+
+/** @brief Calculate a signature
+ *
+    @param SIG the ouput signature
+    @param M is the message to be signed
+    @param S an input private key
+    @return BLS_OK
+ */
+int BLS_CORE_SIGN(octet *SIG, octet *M, octet *S);
+
+/** @brief Verify a signature
+ *
+    @param SIG an input signature
+    @param M is the message whose signature is to be verified.
+    @param W an public key
+    @return BLS_OK if verified, otherwise BLS_FAIL
+ */
+int BLS_CORE_VERIFY(octet *SIG, octet *M, octet *W);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/bls_BN462.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/bls_BN462.h
new file mode 100644
index 0000000..4593746
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/bls_BN462.h
@@ -0,0 +1,87 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file bls.h
+ * @author Mike Scott
+ * @date 28th Novemebr 2018
+ * @brief BLS Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef BLS_BN462_H
+#define BLS_BN462_H
+
+#include "pair_BN462.h"
+
+using namespace core;
+
+namespace BN462 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define BGS_BN462 MODBYTES_B464_60  /**< BLS Group Size */
+#define BFS_BN462 MODBYTES_B464_60  /**< BLS Field Size */
+
+#define BLS_OK           0  /**< Function completed without error */
+#define BLS_FAIL        -1  /**< Point is NOT on the curve */
+
+/* BLS API functions */
+
+
+/** @brief Initialise BLS
+ *
+    @return BLS_OK if worked, otherwise BLS_FAIL
+ */
+int BLS_INIT();
+
+/** @brief Generate Key Pair
+ *
+    @param IKM contains truly random keying material
+    @param S on output a private key
+    @param W on output a public key = S*G, where G is fixed generator
+    @return BLS_OK
+ */
+int BLS_KEY_PAIR_GENERATE(octet *IKM, octet* S, octet *W);
+
+/** @brief Calculate a signature
+ *
+    @param SIG the ouput signature
+    @param M is the message to be signed
+    @param S an input private key
+    @return BLS_OK
+ */
+int BLS_CORE_SIGN(octet *SIG, octet *M, octet *S);
+
+/** @brief Verify a signature
+ *
+    @param SIG an input signature
+    @param M is the message whose signature is to be verified.
+    @param W an public key
+    @return BLS_OK if verified, otherwise BLS_FAIL
+ */
+int BLS_CORE_VERIFY(octet *SIG, octet *M, octet *W);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/bls_FP256BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/bls_FP256BN.h
new file mode 100644
index 0000000..d699d50
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/bls_FP256BN.h
@@ -0,0 +1,87 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file bls.h
+ * @author Mike Scott
+ * @date 28th Novemebr 2018
+ * @brief BLS Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef BLS_FP256BN_H
+#define BLS_FP256BN_H
+
+#include "pair_FP256BN.h"
+
+using namespace core;
+
+namespace FP256BN {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define BGS_FP256BN MODBYTES_B256_56  /**< BLS Group Size */
+#define BFS_FP256BN MODBYTES_B256_56  /**< BLS Field Size */
+
+#define BLS_OK           0  /**< Function completed without error */
+#define BLS_FAIL        -1  /**< Point is NOT on the curve */
+
+/* BLS API functions */
+
+
+/** @brief Initialise BLS
+ *
+    @return BLS_OK if worked, otherwise BLS_FAIL
+ */
+int BLS_INIT();
+
+/** @brief Generate Key Pair
+ *
+    @param IKM contains truly random keying material
+    @param S on output a private key
+    @param W on output a public key = S*G, where G is fixed generator
+    @return BLS_OK
+ */
+int BLS_KEY_PAIR_GENERATE(octet *IKM, octet* S, octet *W);
+
+/** @brief Calculate a signature
+ *
+    @param SIG the ouput signature
+    @param M is the message to be signed
+    @param S an input private key
+    @return BLS_OK
+ */
+int BLS_CORE_SIGN(octet *SIG, octet *M, octet *S);
+
+/** @brief Verify a signature
+ *
+    @param SIG an input signature
+    @param M is the message whose signature is to be verified.
+    @param W an public key
+    @return BLS_OK if verified, otherwise BLS_FAIL
+ */
+int BLS_CORE_VERIFY(octet *SIG, octet *M, octet *W);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/bls_FP512BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/bls_FP512BN.h
new file mode 100644
index 0000000..ce2b275
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/bls_FP512BN.h
@@ -0,0 +1,87 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file bls.h
+ * @author Mike Scott
+ * @date 28th Novemebr 2018
+ * @brief BLS Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef BLS_FP512BN_H
+#define BLS_FP512BN_H
+
+#include "pair_FP512BN.h"
+
+using namespace core;
+
+namespace FP512BN {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define BGS_FP512BN MODBYTES_B512_60  /**< BLS Group Size */
+#define BFS_FP512BN MODBYTES_B512_60  /**< BLS Field Size */
+
+#define BLS_OK           0  /**< Function completed without error */
+#define BLS_FAIL        -1  /**< Point is NOT on the curve */
+
+/* BLS API functions */
+
+
+/** @brief Initialise BLS
+ *
+    @return BLS_OK if worked, otherwise BLS_FAIL
+ */
+int BLS_INIT();
+
+/** @brief Generate Key Pair
+ *
+    @param IKM contains truly random keying material
+    @param S on output a private key
+    @param W on output a public key = S*G, where G is fixed generator
+    @return BLS_OK
+ */
+int BLS_KEY_PAIR_GENERATE(octet *IKM, octet* S, octet *W);
+
+/** @brief Calculate a signature
+ *
+    @param SIG the ouput signature
+    @param M is the message to be signed
+    @param S an input private key
+    @return BLS_OK
+ */
+int BLS_CORE_SIGN(octet *SIG, octet *M, octet *S);
+
+/** @brief Verify a signature
+ *
+    @param SIG an input signature
+    @param M is the message whose signature is to be verified.
+    @param W an public key
+    @return BLS_OK if verified, otherwise BLS_FAIL
+ */
+int BLS_CORE_VERIFY(octet *SIG, octet *M, octet *W);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/blsrev.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/blsrev.cpp
new file mode 100644
index 0000000..0f449f5
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/blsrev.cpp
@@ -0,0 +1,165 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* Boneh-Lynn-Shacham signature 128-bit API */
+
+/* Loosely (for now) following https://datatracker.ietf.org/doc/html/draft-irtf-cfrg-bls-signature-00 */
+
+// Minimal-pubkey-size variant
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include "bls_ZZZ.h"
+
+using namespace XXX;
+using namespace YYY;
+
+#define CEIL(a,b) (((a)-1)/(b)+1)
+
+/* output u[i] \in F_p */
+/* https://datatracker.ietf.org/doc/draft-irtf-cfrg-hash-to-curve/ */
+static void hash_to_field(int hash,int hlen,FP2 *u,octet *DST,octet *M, int ctr)
+{
+    int i,j,k,L,nbq;
+    BIG q,a[2];
+    DBIG dx;
+    char okm[512],fd[128];
+    octet OKM = {0,sizeof(okm),okm};
+
+    BIG_rcopy(q, Modulus);
+    nbq=BIG_nbits(q);
+    L=CEIL(nbq+CURVE_SECURITY_ZZZ,8);
+
+    XMD_Expand(hash,hlen,&OKM,L*ctr*2,DST,M);
+    for (i=0;i<ctr;i++)
+    {
+        for (k=0;k<2;k++)
+        {
+            for (j=0;j<L;j++)
+                fd[j]=OKM.val[(2*i+k)*L+j];
+        
+            BIG_dfromBytesLen(dx,fd,L);
+            BIG_ctdmod(a[k],dx,q,8*L-nbq);
+        }
+        FP2_from_BIGs(&u[i],a[0],a[1]);
+    }
+}
+
+/* hash a message to an ECP2 point, using SHA2, random oracle method */
+static void BLS_HASH_TO_POINT(ECP2 *P, octet *M)
+{
+    FP2 u[2];
+    ECP2 P1;
+    char dst[50];
+    octet DST = {0,sizeof(dst),dst};
+
+    OCT_jstring(&DST,(char *)"BLS_SIG_ZZZG2_XMD:SHA256-SVDW-RO-_NUL_");
+    hash_to_field(MC_SHA2,HASH_TYPE_ZZZ,u,&DST,M,2);
+
+    ECP2_map2point(P,&u[0]);
+    ECP2_map2point(&P1,&u[1]);
+
+    ECP2_add(P,&P1);
+    ECP2_cfp(P);
+    ECP2_affine(P);
+}
+
+int ZZZ::BLS_INIT()
+{
+    return BLS_OK;
+}
+
+/* generate key pair, private key S, public key W */
+int ZZZ::BLS_KEY_PAIR_GENERATE(octet *IKM, octet* S, octet *W)
+{
+    int nbr,L;
+    BIG r,s;
+    DBIG dx;
+    ECP G;
+    char salt[20],prk[HASH_TYPE_ZZZ],okm[128],aikm[65],len[2];
+    octet SALT = {0,sizeof(salt),salt};
+    octet PRK = {0,sizeof(prk),prk};
+    octet OKM = {0,sizeof(okm),okm};
+    octet AIKM = {0,sizeof(aikm),aikm};
+    octet LEN = {0,sizeof(len),len};
+
+    OCT_copy(&AIKM,IKM);
+    OCT_jbyte(&AIKM,0,1);
+
+    BIG_rcopy(r, CURVE_Order);
+    nbr=BIG_nbits(r);
+    L=CEIL(3*CEIL(nbr,8),2);
+    OCT_jint(&LEN,L,2);
+
+    if (!ECP_generator(&G)) return BLS_FAIL;
+
+    OCT_jstring(&SALT,(char *)"BLS-SIG-KEYGEN-SALT-");
+    HKDF_Extract(MC_SHA2,HASH_TYPE_ZZZ,&PRK,&SALT,&AIKM);
+    HKDF_Expand(MC_SHA2,HASH_TYPE_ZZZ,&OKM,L,&PRK,&LEN);
+
+    BIG_dfromBytesLen(dx,OKM.val,L);
+    BIG_ctdmod(s,dx,r,8*L-nbr);
+    BIG_toBytes(S->val, s);
+    S->len = MODBYTES_XXX;
+
+// SkToPk
+
+    PAIR_G1mul(&G, s);
+    ECP_toOctet(W, &G, true);
+    return BLS_OK;
+}
+
+/* Sign message M using private key S to produce signature SIG */
+
+int ZZZ::BLS_CORE_SIGN(octet *SIG, octet *M, octet *S)
+{
+    BIG s;
+    ECP2 D;
+    BLS_HASH_TO_POINT(&D, M);
+    BIG_fromBytes(s, S->val);
+    PAIR_G2mul(&D, s);
+
+    ECP2_toOctet(SIG, &D, true); /* compress output */
+    return BLS_OK;
+}
+
+/* Verify signature given message m, the signature SIG, and the public key W */
+int ZZZ::BLS_CORE_VERIFY(octet *SIG, octet *M, octet *W)
+{
+    FP12 v;
+    ECP G, PK;
+    ECP2 D, HM;
+    BLS_HASH_TO_POINT(&HM, M);
+
+    ECP2_fromOctet(&D, SIG);
+	if (!PAIR_G2member(&D)) return BLS_FAIL;
+    ECP2_neg(&D);
+
+    ECP_fromOctet(&PK, W);
+
+    if (!ECP_generator(&G)) return BLS_FAIL;
+    PAIR_double_ate(&v, &D, &G, &HM, &PK);
+
+    PAIR_fexp(&v);
+
+    if (FP12_isunity(&v)) return BLS_OK;
+    return BLS_FAIL;
+}
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/blsrev192.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/blsrev192.cpp
new file mode 100644
index 0000000..1a4cd90
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/blsrev192.cpp
@@ -0,0 +1,167 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* Boneh-Lynn-Shacham signature 192-bit API */
+
+/* Loosely (for now) following https://datatracker.ietf.org/doc/html/draft-irtf-cfrg-bls-signature-00 */
+
+// Minimal-pubkey-size variant
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include "bls192_ZZZ.h"
+
+using namespace XXX;
+using namespace YYY;
+
+#define CEIL(a,b) (((a)-1)/(b)+1)
+
+/* output u[i] \in F_p */
+/* https://datatracker.ietf.org/doc/draft-irtf-cfrg-hash-to-curve/ */
+static void hash_to_field(int hash,int hlen,FP4 *u,octet *DST,octet *M, int ctr)
+{
+    int i,j,k,L,nbq;
+    BIG q,a[4];
+    FP2 c,d;
+    DBIG dx;
+    char okm[1024],fd[128];
+    octet OKM = {0,sizeof(okm),okm};
+
+    BIG_rcopy(q, Modulus);
+    nbq=BIG_nbits(q);
+    L=CEIL(nbq+CURVE_SECURITY_ZZZ,8);
+
+    XMD_Expand(hash,hlen,&OKM,L*ctr*4,DST,M);
+    for (i=0;i<ctr;i++)
+    {
+        for (k=0;k<4;k++)
+        {
+            for (j=0;j<L;j++)
+                fd[j]=OKM.val[(4*i+k)*L+j];
+        
+            BIG_dfromBytesLen(dx,fd,L);
+            BIG_ctdmod(a[k],dx,q,8*L-nbq);
+        }
+        FP2_from_BIGs(&c,a[0],a[1]);
+        FP2_from_BIGs(&d,a[2],a[3]);
+        FP4_from_FP2s(&u[i],&c,&d);
+    }
+}
+
+/* hash a message to an ECP4 point, using SHA2, random oracle method */
+static void BLS_HASH_TO_POINT(ECP4 *P, octet *M)
+{
+    FP4 u[2];
+    ECP4 P1;
+    char dst[50];
+    octet DST = {0,sizeof(dst),dst};
+
+    OCT_jstring(&DST,(char *)"BLS_SIG_ZZZG2_XMD:SHA384-SVDW-RO-_NUL_");
+    hash_to_field(MC_SHA2,HASH_TYPE_ZZZ,u,&DST,M,2);
+
+    ECP4_map2point(P,&u[0]);
+    ECP4_map2point(&P1,&u[1]);
+
+    ECP4_add(P,&P1);
+    ECP4_cfp(P);
+    ECP4_affine(P);
+}
+
+int ZZZ::BLS_INIT()
+{
+    return BLS_OK;
+}
+
+/* generate key pair, private key S, public key W */
+int ZZZ::BLS_KEY_PAIR_GENERATE(octet *IKM, octet* S, octet *W)
+{
+    int nbr,L;
+    BIG r,s;
+    DBIG dx;
+    ECP G;
+    char salt[20],prk[HASH_TYPE_ZZZ],okm[128],aikm[65],len[2];
+    octet SALT = {0,sizeof(salt),salt};
+    octet PRK = {0,sizeof(prk),prk};
+    octet OKM = {0,sizeof(okm),okm};
+    octet AIKM = {0,sizeof(aikm),aikm};
+    octet LEN = {0,sizeof(len),len};
+
+    OCT_copy(&AIKM,IKM);
+    OCT_jbyte(&AIKM,0,1);
+
+    BIG_rcopy(r, CURVE_Order);
+    nbr=BIG_nbits(r);
+    L=CEIL(3*CEIL(nbr,8),2);
+    OCT_jint(&LEN,L,2);
+
+    if (!ECP_generator(&G)) return BLS_FAIL;
+
+    OCT_jstring(&SALT,(char *)"BLS-SIG-KEYGEN-SALT-");
+    HKDF_Extract(MC_SHA2,HASH_TYPE_ZZZ,&PRK,&SALT,&AIKM);
+    HKDF_Expand(MC_SHA2,HASH_TYPE_ZZZ,&OKM,L,&PRK,&LEN);
+
+    BIG_dfromBytesLen(dx,OKM.val,L);
+    BIG_ctdmod(s,dx,r,8*L-nbr);
+    BIG_toBytes(S->val, s);
+    S->len = MODBYTES_XXX;
+
+// SkToPk
+
+    PAIR_G1mul(&G, s);
+    ECP_toOctet(W, &G, true);
+    return BLS_OK;
+}
+
+/* Sign message M using private key S to produce signature SIG */
+
+int ZZZ::BLS_CORE_SIGN(octet *SIG, octet *M, octet *S)
+{
+    BIG s;
+    ECP4 D;
+    BLS_HASH_TO_POINT(&D, M);
+    BIG_fromBytes(s, S->val);
+    PAIR_G2mul(&D, s);
+
+    ECP4_toOctet(SIG, &D, true); /* compress output */
+    return BLS_OK;
+}
+
+/* Verify signature given message m, the signature SIG, and the public key W */
+int ZZZ::BLS_CORE_VERIFY(octet *SIG, octet *M, octet *W)
+{
+    FP24 v;
+    ECP G, PK;
+    ECP4 D, HM;
+
+    BLS_HASH_TO_POINT(&HM, M);
+
+    ECP4_fromOctet(&D, SIG);
+	if (!PAIR_G2member(&D)) return BLS_FAIL;
+    ECP4_neg(&D);
+
+    ECP_fromOctet(&PK, W);
+    if (!ECP_generator(&G)) return BLS_FAIL;
+    PAIR_double_ate(&v, &D, &G, &HM, &PK);
+
+    PAIR_fexp(&v);
+    if (FP24_isunity(&v)) return BLS_OK;
+    return BLS_FAIL;
+}
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/blsrev256.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/blsrev256.cpp
new file mode 100644
index 0000000..a6a2f59
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/blsrev256.cpp
@@ -0,0 +1,172 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* Boneh-Lynn-Shacham signature 256-bit API */
+
+/* Loosely (for now) following https://datatracker.ietf.org/doc/html/draft-irtf-cfrg-bls-signature-00 */
+
+// Minimal-pubkey-size variant
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include "bls256_ZZZ.h"
+
+using namespace XXX;
+using namespace YYY;
+
+#define CEIL(a,b) (((a)-1)/(b)+1)
+
+/* output u[i] \in F_p */
+/* https://datatracker.ietf.org/doc/draft-irtf-cfrg-hash-to-curve/ */
+static void hash_to_field(int hash,int hlen,FP8 *u,octet *DST,octet *M, int ctr)
+{
+    int i,j,k,L,nbq;
+    BIG q,a[8];
+    FP2 c,d;
+    FP4 e,f;
+    DBIG dx;
+    char okm[2048],fd[128];
+    octet OKM = {0,sizeof(okm),okm};
+
+    BIG_rcopy(q, Modulus);
+    nbq=BIG_nbits(q);
+    L=CEIL(nbq+CURVE_SECURITY_ZZZ,8);
+
+    XMD_Expand(hash,hlen,&OKM,L*ctr*8,DST,M);
+    for (i=0;i<ctr;i++)
+    {
+        for (k=0;k<8;k++)
+        {
+            for (j=0;j<L;j++)
+                fd[j]=OKM.val[(8*i+k)*L+j];
+        
+            BIG_dfromBytesLen(dx,fd,L);
+            BIG_ctdmod(a[k],dx,q,8*L-nbq);
+        }
+        FP2_from_BIGs(&c,a[0],a[1]);
+        FP2_from_BIGs(&d,a[2],a[3]);
+        FP4_from_FP2s(&e,&c,&d);
+
+        FP2_from_BIGs(&c,a[4],a[5]);
+        FP2_from_BIGs(&d,a[6],a[7]);
+        FP4_from_FP2s(&f,&c,&d);
+
+        FP8_from_FP4s(&u[i],&e,&f);
+    }
+}
+
+/* hash a message to an ECP8 point, using SHA2, random oracle method */
+static void BLS_HASH_TO_POINT(ECP8 *P, octet *M)
+{
+    FP8 u[2];
+    ECP8 P1;
+    char dst[50];
+    octet DST = {0,sizeof(dst),dst};
+
+    OCT_jstring(&DST,(char *)"BLS_SIG_ZZZG2_XMD:SHA512-SVDW-RO-_NUL_");
+    hash_to_field(MC_SHA2,HASH_TYPE_ZZZ,u,&DST,M,2);
+
+    ECP8_map2point(P,&u[0]);
+    ECP8_map2point(&P1,&u[1]);
+    ECP8_add(P,&P1);
+    ECP8_cfp(P);
+    ECP8_affine(P);
+}
+
+int ZZZ::BLS_INIT()
+{
+    return BLS_OK;
+}
+
+/* generate key pair, private key S, public key W */
+int ZZZ::BLS_KEY_PAIR_GENERATE(octet *IKM, octet* S, octet *W)
+{
+    int nbr,L;
+    BIG r,s;
+    DBIG dx;
+    ECP G;
+    char salt[20],prk[HASH_TYPE_ZZZ],okm[128],aikm[65],len[2];
+    octet SALT = {0,sizeof(salt),salt};
+    octet PRK = {0,sizeof(prk),prk};
+    octet OKM = {0,sizeof(okm),okm};
+    octet AIKM = {0,sizeof(aikm),aikm};
+    octet LEN = {0,sizeof(len),len};
+
+    OCT_copy(&AIKM,IKM);
+    OCT_jbyte(&AIKM,0,1);
+
+    BIG_rcopy(r, CURVE_Order);
+    nbr=BIG_nbits(r);
+    L=CEIL(3*CEIL(nbr,8),2);
+    OCT_jint(&LEN,L,2);
+
+    if (!ECP_generator(&G)) return BLS_FAIL;
+
+    OCT_jstring(&SALT,(char *)"BLS-SIG-KEYGEN-SALT-");
+    HKDF_Extract(MC_SHA2,HASH_TYPE_ZZZ,&PRK,&SALT,&AIKM);
+    HKDF_Expand(MC_SHA2,HASH_TYPE_ZZZ,&OKM,L,&PRK,&LEN);
+
+    BIG_dfromBytesLen(dx,OKM.val,L);
+    BIG_ctdmod(s,dx,r,8*L-nbr);
+    BIG_toBytes(S->val, s);
+    S->len = MODBYTES_XXX;
+
+// SkToPk
+
+    PAIR_G1mul(&G, s);
+    ECP_toOctet(W, &G, true);
+    return BLS_OK;
+}
+
+/* Sign message M using private key S to produce signature SIG */
+
+int ZZZ::BLS_CORE_SIGN(octet *SIG, octet *M, octet *S)
+{
+    BIG s;
+    ECP8 D;
+    BLS_HASH_TO_POINT(&D, M);
+    BIG_fromBytes(s, S->val);
+    PAIR_G2mul(&D, s);
+    ECP8_toOctet(SIG, &D, true); /* compress output */
+    return BLS_OK;
+}
+
+/* Verify signature of message m, the signature SIG, and the public key W */
+int ZZZ::BLS_CORE_VERIFY(octet *SIG, octet *M, octet *W)
+{
+    FP48 v;
+    ECP G, PK;
+    ECP8 D, HM;
+    BLS_HASH_TO_POINT(&HM, M);
+
+    ECP8_fromOctet(&D, SIG);
+	if (!PAIR_G2member(&D)) return BLS_FAIL;
+    ECP8_neg(&D);
+
+    ECP_fromOctet(&PK, W);
+
+    if (!ECP_generator(&G)) return BLS_FAIL;
+    PAIR_double_ate(&v, &D, &G, &HM, &PK);
+
+    PAIR_fexp(&v);
+    if (FP48_isunity(&v)) return BLS_OK;
+    return BLS_FAIL;
+}
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config16.py b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config16.py
new file mode 100644
index 0000000..94f2564
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config16.py
@@ -0,0 +1,744 @@
+#!/usr/bin/env python3
+
+#
+# Copyright (c) 2012-2020 MIRACL UK Ltd.
+#
+# This file is part of MIRACL Core
+# (see https://github.com/miracl/core).
+#
+# Licensed under the Apache License, Version 2.0 (the "License");
+# you may not use this file except in compliance with the License.
+# You may obtain a copy of the License at
+#
+#     http://www.apache.org/licenses/LICENSE-2.0
+#
+# Unless required by applicable law or agreed to in writing, software
+# distributed under the License is distributed on an "AS IS" BASIS,
+# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+# See the License for the specific language governing permissions and
+# limitations under the License.
+#
+
+import os
+import sys
+import shutil
+import fnmatch
+
+testing=False
+keep_querying=True
+
+if len(sys.argv)==2 :
+    if sys.argv[1]=="test":
+        testing=True
+
+my_compiler = "g++"
+generated_files = []
+
+def copy_keep_file(file, target):
+    shutil.copyfile(file, target)
+
+def copy_temp_file(file, target):
+    shutil.copyfile(file, target)
+    generated_files.append(target)
+
+def delete_file(expression):
+    for root, dirs, files in os.walk(os.path.abspath(os.path.dirname(__file__))):
+        for name in files:
+            if fnmatch.fnmatch(name, expression):
+                os.remove(os.path.join(root, name))
+
+class miracl_compile:
+    def compile_file(optim, file):
+        print("Processing " + file + "..", end = "", flush=True)
+        if optim != 0:
+            flags = " -O%d -c %s" % (optim, file)
+        else:
+            flags = " -c %s" % (file)
+        os.system(my_compiler + flags)
+        print(". [DONE]")
+
+    def compile_binary(optim, file, lib, bin):
+        print("Processing " + file + "..", end = "", flush=True)
+        if sys.platform.startswith("win"):
+            bin += ".exe"
+        if optim != 0:
+            flags = " -O%d %s %s -o %s" % (optim, file, lib, bin)
+        else:
+            flags = " %s %s -o %s" % (file, lib, bin)
+        os.system(my_compiler + flags)
+        print(". [DONE]")
+
+def inline_mul1(N,base)  :
+    str=""
+    str+="\tt=(dchunk)a[0]*b[0]; c[0]=(chunk)t & BMASK_XXX; t=t>>BASEBITS_XXX;\n"
+
+    for i in range(1,N) :
+        k=0;
+        str+="\tt=t"
+        while (k<=i) :
+            str+="+(dchunk)a[{}]*b[{}]".format(k,i-k)
+            k+=1
+        str+="; c[{}]=(chunk)t & BMASK_XXX; ".format(i)
+        str+="t=t>>BASEBITS_XXX;\n"
+
+    for i in range(N,2*N-1) :
+        k=i-(N-1)
+        str+="\tt=t"
+        while (k<=N-1) :
+            str+="+(dchunk)a[{}]*b[{}]".format(k,i-k)
+            k+=1
+        str+="; c[{}]=(chunk)t & BMASK_XXX; ".format(i)
+        str+="t=t>>BASEBITS_XXX;\n"
+
+    str+="\tc[{}]=(chunk)t;\n".format(2*N-1)
+
+    return str.replace("XXX",base)
+
+def inline_mul2(N,base)  :
+    str=""
+    for i in range(0,N) :
+        str+="\td[{}]=(dchunk)a[{}]*b[{}];\n".format(i, i, i)
+    str+="\n\ts=d[0];\n\tt = s; c[0]=(chunk)t&BMASK_XXX; co=t>>BASEBITS_XXX;\n"
+    for k in range(1,N) :
+        str+="\ts+=d[{}]; t=co+s ".format(k)
+        for i in range(k,int(k/2),-1) :
+            str+="+(dchunk)(a[{}]-a[{}])*(b[{}]-b[{}])".format(i,k - i, k - i, i)
+        str+="; c[{}]=(chunk)t&BMASK_XXX; co=t>>BASEBITS_XXX; \n".format(k)
+    str+="\n"
+    for k in range(N,2 * N - 1) :
+        str+="\ts-=d[{}]; t=co+s ".format(k - N)
+        for i in range(N-1,int(k/2),-1) :
+            str+="+(dchunk)(a[{}]-a[{}])*(b[{}]-b[{}])".format(i, k - i, k - i, i)
+        str+="; c[{}]=(chunk)t&BMASK_XXX; co=t>>BASEBITS_XXX; \n".format(k)
+
+    str+="\tc[{}]=(chunk)co;\n".format(2 * N - 1)
+    return str.replace("XXX",base)
+
+def inline_sqr(N,base) :
+    str=""
+    str+="\n\tt=(dchunk)a[0]*a[0]; c[0]=(chunk)t&BMASK_XXX; co=t>>BASEBITS_XXX;\n"
+
+    for k in range(1,N) :
+        str+="\tt= "
+        for i in range(k,int(k/2),-1) :
+            str+="+(dchunk)a[{}]*a[{}]".format(i, k - i)
+        str+="; t+=t; t+=co;"
+        if k % 2 == 0 :
+            str+=" t+=(dchunk)a[{}]*a[{}];".format(int(k/2), int(k/2))
+        str+=" c[{}]=(chunk)t&BMASK_XXX; co=t>>BASEBITS_XXX; \n".format(k)
+    str+="\n"
+
+    for k in range(N,2*N-2) :
+        str+="\tt= "
+        for i in range(N-1,int(k/2),-1) :
+            str+="+(dchunk)a[{}]*a[{}]".format(i, k - i)
+        str+="; t+=t; t+=co;"
+        if k % 2 == 0 :
+            str+=" t+=(dchunk)a[{}]*a[{}];".format(int(k/2),int(k/2))
+        str+=" c[{}]=(chunk)t&BMASK_XXX; co=t>>BASEBITS_XXX; \n".format(k)
+
+    str+="\tt=co; t+=(dchunk)a[{}]*a[{}]; c[{}]=(chunk)t&BMASK_XXX; co=t>>BASEBITS_XXX; \n ".format(N-1,N-1,2*N-2)
+
+    str+="\tc[{}]=(chunk)co;\n".format(2 * N - 1)
+    return str.replace("XXX",base)
+
+def inline_redc2(N,base) :
+    str=""
+    str+="\tt=d[0]; v[0]=((chunk)t*MC)&BMASK_XXX; t+=(dchunk)v[0]*md[0];  s=0; c=(t>>BASEBITS_XXX);\n\n"
+
+    for k in range(1,N) :
+        str+="\tt=d[{}]+c+s+(dchunk)v[0]*md[{}]".format(k, k)
+        for i in range(k-1,int(k/2),-1) :
+            str+="+(dchunk)(v[{}]-v[{}])*(md[{}]-md[{}])".format(k - i, i, i, k - i)
+        str+="; v[{}]=((chunk)t*MC)&BMASK_XXX; t+=(dchunk)v[{}]*md[0]; ".format(k, k)
+        str+=" dd[{}]=(dchunk)v[{}]*md[{}]; s+=dd[{}]; c=(t>>BASEBITS_XXX); \n".format(k, k, k, k)
+
+    str+="\n"
+    for k in range(N,2*N-1) :
+        str+="\tt=d[{}]+c+s".format(k)
+        for i in range(N-1,int(k/2),-1) :
+            str+="+(dchunk)(v[{}]-v[{}])*(md[{}]-md[{}])".format(k - i, i, i, k - i)
+        str+="; a[{}]=(chunk)t&BMASK_XXX;  s-=dd[{}]; c=(t>>BASEBITS_XXX); \n".format(k - N, k - N + 1)
+
+    str+="\ta[{}]=d[{}]+((chunk)c&BMASK_XXX);\n".format(N-1,2*N-1)
+    return str.replace("XXX",base)
+
+def inline_redc1(N,base) :
+    str=""
+
+    str+="\tt = d[0];\n"
+    str+="\tv[0] = ((chunk)t * MC)&BMASK_XXX;\n"
+    str+="\tt += (dchunk)v[0] * md[0];\n"
+    str+="\tt = (t >> BASEBITS_XXX) + d[1];\n"
+
+    for i in range(1,N) :
+        k=1
+        str+="\tt += (dchunk)v[0] * md[{}] ".format(i)
+        while k<i :
+            str+="+ (dchunk)v[{}]*md[{}]".format(k,i-k)
+            k+=1
+        str+="; v[{}] = ((chunk)t * MC)&BMASK_XXX; ".format(i)
+        str+="t += (dchunk)v[{}] * md[0]; ".format(i)
+        str+="t = (t >> BASEBITS_XXX) + d[{}];\n".format(i+1)
+
+    for i in range(N,2*N-1) :
+        k=i-(N-1)
+        str+="\tt=t "
+        while k<=N-1 :
+            str+="+ (dchunk)v[{}]*md[{}] ".format(k,i-k)
+            k+=1
+        str+="; a[{}] = (chunk)t & BMASK_XXX; ".format(i-N)
+        str+="t = (t >> BASEBITS_XXX) + d[{}];\n".format(i+1)
+
+    str+="\ta[{}] = (chunk)t & BMASK_XXX;\n".format(N-1)
+    return str.replace("XXX",base)
+
+
+def replace(namefile,oldtext,newtext):
+    f = open(namefile,'r')
+    filedata = f.read()
+    f.close()
+
+    newdata = filedata.replace(oldtext,newtext)
+
+    f = open(namefile,'w')
+    f.write(newdata)
+    f.close()
+
+# rsaset(big,ring,bit_bits_in_base,multiplier)
+# for each choice give distinct names for "big" and "ring".
+# Typically "big" is the length in bits of the underlying big number type
+# "ring" is the RSA modulus size = "big" times 2^m
+# Next give the number base used for 32 bit architectures, as n where the base is 2^n
+# multiplier is 2^m (see above)
+def rsaset(tb,tff,base,ml) :
+
+    itb=int(tb)
+    inb=int(itb/8)
+    nb=str(inb)
+    ib=int(base)
+    inb=int(nb)
+
+    nlen=(1+((8*inb-1)//ib))
+
+    bd="B"+tb+"_"+base
+    fnameh="config_big_"+bd+".h"
+    copy_keep_file("config_big.h", fnameh)
+    replace(fnameh,"XXX",bd)
+    replace(fnameh,"@NB@",nb)
+    replace(fnameh,"@BASE@",base)
+
+    fnameh="config_ff_"+tff+".h"
+    copy_keep_file("config_ff.h", fnameh)
+    replace(fnameh,"XXX",bd)
+    replace(fnameh,"WWW",tff)
+    replace(fnameh,"@ML@",ml);
+
+    fnamec="big_"+bd+".cpp"
+    fnameh="big_"+bd+".h"
+
+    copy_temp_file("big.cpp", fnamec)
+    copy_keep_file("big.h", fnameh)
+
+    replace(fnamec,"XXX",bd)
+    replace(fnameh,"XXX",bd)
+
+    replace(fnamec,"INLINE_MUL1",inline_mul1(nlen,bd))
+    replace(fnamec,"INLINE_MUL2",inline_mul2(nlen,bd))
+    replace(fnamec,"INLINE_SQR",inline_sqr(nlen,bd))
+    replace(fnamec,"INLINE_REDC1",inline_redc1(nlen,bd))
+    replace(fnamec,"INLINE_REDC2",inline_redc2(nlen,bd))
+
+    miracl_compile.compile_file(3, fnamec)
+
+    fnamec="ff_"+tff+".cpp"
+    fnameh="ff_"+tff+".h"
+
+    copy_temp_file("ff.cpp", fnamec)
+    copy_keep_file("ff.h", fnameh)
+
+    replace(fnamec,"WWW",tff)
+    replace(fnamec,"XXX",bd)
+    replace(fnameh,"WWW",tff)
+    replace(fnameh,"XXX",bd)
+    miracl_compile.compile_file(3, fnamec)
+
+    fnamec="rsa_"+tff+".cpp"
+    fnameh="rsa_"+tff+".h"
+
+    copy_temp_file("rsa.cpp", fnamec)
+    copy_keep_file("rsa.h", fnameh)
+
+    replace(fnamec,"WWW",tff)
+    replace(fnamec,"XXX",bd)
+    replace(fnameh,"WWW",tff)
+    replace(fnameh,"XXX",bd)
+    miracl_compile.compile_file(3, fnamec)
+
+# curveset(modulus_bits,field,curve,bits_in_base,modulus_mod_8,Z,modulus_type,curve_type,Curve A,pairing_friendly,sextic twist,sign of x,g2_table size,ate bits,curve security)
+# for each curve give names for field and curve. In many cases the latter two will be the same.
+# modulus_bits is the bit length of the modulus, typically the same or slightly smaller than "big"
+# Typically "field" describes the modulus, and "curve" is the common name for the elliptic curve
+# Next give the number base used for 32 bit architecture, as n where the base is 2^n (note that these must be fixed for the same "big" name, if is ever re-used for another curve)
+# m8 max m such that 2^m | modulus-1
+# rz Z value for hash_to_point, If list G1 Z value is in [0], G2 Z value (=a+bz) is in [1], [2]
+# modulus_type is NOT_SPECIAL, or PSEUDO_MERSENNE, or MONTGOMERY_Friendly, or GENERALISED_MERSENNE (supported for Ed448 only)
+# i for Fp2 QNR 2^i+sqrt(-1) (relevant for PFCs only, else =0). Or QNR over Fp if p=1 mod 8
+# curve_type is WEIERSTRASS, EDWARDS or MONTGOMERY
+# Curve A parameter
+# pairing_friendly is BN, BLS or NOT (if not pairing friendly)
+# if pairing friendly. M or D type twist, and sign of the family parameter x
+# g2_table size is number of entries in precomputed table
+# ate bits is number of bits in Ate parameter (from romgen program)
+# curve security is AES equivalent, rounded up.
+def curveset(nbt,tf,tc,base,m8,rz,mt,qi,ct,ca,pf,stw,sx,g2,ab,cs) :
+    inbt=int(nbt)
+    itb=int(inbt+(8-inbt%8)%8)
+    inb=int(itb/8)
+    tb=str(itb)
+    nb=str(inb)
+
+    bd="B"+tb+"_"+base
+    fnameh="config_big_"+bd+".h"
+    copy_keep_file("config_big.h", fnameh)
+
+    replace(fnameh,"XXX",bd)
+    replace(fnameh,"@NB@",nb)
+    replace(fnameh,"@BASE@",base)
+
+    fnameh="config_field_"+tf+".h"
+    copy_keep_file("config_field.h", fnameh)
+
+    replace(fnameh,"XXX",bd)
+    replace(fnameh,"YYY",tf)
+    replace(fnameh,"@NBT@",nbt)
+    replace(fnameh,"@M8@",m8)
+    replace(fnameh,"@MT@",mt)
+    hc="0"
+    hc2="0"
+# Get Hash-to-Curve Z for G1 and G2
+
+    if isinstance(rz,list) :
+        if len(rz)==2 :     # Z followed by SSWU isogeny degree
+            replace(fnameh,"@RZ@",rz[0])
+            replace(fnameh,"@RZ2A@","0")
+            replace(fnameh,"@RZ2B@","0")
+            hc=rz[1]
+        if len(rz)==3 :     # Z for G1 followed by Z for G2 (for SVDW)
+            replace(fnameh,"@RZ@",rz[0])
+            replace(fnameh,"@RZ2A@",rz[1])
+            replace(fnameh,"@RZ2B@",rz[2])
+        if len(rz)==5 :     # Z for G1, Z for G2, SSWU isogeny degree for G1, SSWU isogeny degree for G2
+            replace(fnameh,"@RZ@",rz[0])
+            replace(fnameh,"@RZ2A@",rz[1])
+            replace(fnameh,"@RZ2B@",rz[2])
+            hc=rz[3]
+            hc2=rz[4]
+    else :
+        replace(fnameh,"@RZ@",rz)   # just Z for SSWU, or indicates RFC7748 or Generic for Elligator
+        replace(fnameh,"@RZ2A@","0")
+        replace(fnameh,"@RZ2B@","0")
+
+    itw=int(qi)%10
+    replace(fnameh,"@QI@",str(itw))
+    if int(qi)//10 > 0 :
+        replace(fnameh,"@TW@","POSITOWER")
+    else :
+        replace(fnameh,"@TW@","NEGATOWER")
+
+    ib=int(base)
+    inb=int(nb)
+    inbt=int(nbt)
+    nlen=(1+((8*inb-1)//ib))
+    sh=ib*nlen-inbt
+
+    if sh > 6 :
+        sh=6
+    replace(fnameh,"@SH@",str(sh))
+
+    fnameh="config_curve_"+tc+".h"
+    copy_keep_file("config_curve.h", fnameh)
+
+    replace(fnameh,"XXX",bd)
+    replace(fnameh,"YYY",tf)
+    replace(fnameh,"ZZZ",tc)
+    replace(fnameh,"@CT@",ct)
+    replace(fnameh,"@CA@",ca)
+    replace(fnameh,"@PF@",pf)
+
+    replace(fnameh,"@ST@",stw)
+    replace(fnameh,"@SX@",sx)
+    replace(fnameh,"@CS@",cs)
+    replace(fnameh,"@AB@",ab)
+    replace(fnameh,"@G2@",g2)
+
+    replace(fnameh,"@HC@",hc)
+    replace(fnameh,"@HC2@",hc2)
+
+    fnamec="big_"+bd+".cpp"
+    fnameh="big_"+bd+".h"
+
+    copy_temp_file("big.cpp", fnamec)
+    copy_keep_file("big.h", fnameh)
+
+    replace(fnamec,"XXX",bd)
+    replace(fnameh,"XXX",bd)
+
+    replace(fnamec,"INLINE_MUL1",inline_mul1(nlen,bd))
+    replace(fnamec,"INLINE_MUL2",inline_mul2(nlen,bd))
+    replace(fnamec,"INLINE_SQR",inline_sqr(nlen,bd))
+    replace(fnamec,"INLINE_REDC1",inline_redc1(nlen,bd))
+    replace(fnamec,"INLINE_REDC2",inline_redc2(nlen,bd))
+
+    miracl_compile.compile_file(3, fnamec)
+
+    fnamec="fp_"+tf+".cpp"
+    fnameh="fp_"+tf+".h"
+
+    copy_temp_file("fp.cpp", fnamec)
+    copy_keep_file("fp.h", fnameh)
+
+    replace(fnamec,"YYY",tf)
+    replace(fnamec,"XXX",bd)
+    replace(fnameh,"YYY",tf)
+    replace(fnameh,"XXX",bd)
+    miracl_compile.compile_file(3, fnamec)
+
+    miracl_compile.compile_file(3, "rom_field_"+tf+".cpp");
+
+    fnamec="ecp_"+tc+".cpp"
+    fnameh="ecp_"+tc+".h"
+
+    copy_temp_file("ecp.cpp", fnamec)
+    copy_keep_file("ecp.h", fnameh)
+
+    replace(fnamec,"ZZZ",tc)
+    replace(fnamec,"YYY",tf)
+    replace(fnamec,"XXX",bd)
+    replace(fnameh,"ZZZ",tc)
+    replace(fnameh,"YYY",tf)
+    replace(fnameh,"XXX",bd)
+    miracl_compile.compile_file(3, fnamec)
+
+    fnamec="ecdh_"+tc+".cpp"
+    fnameh="ecdh_"+tc+".h"
+
+    copy_temp_file("ecdh.cpp", fnamec)
+    copy_keep_file("ecdh.h", fnameh)
+
+    replace(fnamec,"ZZZ",tc)
+    replace(fnamec,"YYY",tf)
+    replace(fnamec,"XXX",bd)
+    replace(fnameh,"ZZZ",tc)
+    replace(fnameh,"YYY",tf)
+    replace(fnameh,"XXX",bd)
+    miracl_compile.compile_file(3, fnamec)
+
+    miracl_compile.compile_file(3, "rom_curve_"+tc+".cpp");
+
+    if pf != "NOT_PF" :
+        fnamec="fp2_"+tf+".cpp"
+        fnameh="fp2_"+tf+".h"
+
+        copy_temp_file("fp2.cpp", fnamec)
+        copy_keep_file("fp2.h", fnameh)
+
+        replace(fnamec,"YYY",tf)
+        replace(fnamec,"XXX",bd)
+        replace(fnameh,"YYY",tf)
+        replace(fnameh,"XXX",bd)
+        miracl_compile.compile_file(3, fnamec)
+
+        fnamec="fp4_"+tf+".cpp"
+        fnameh="fp4_"+tf+".h"
+
+        copy_temp_file("fp4.cpp", fnamec)
+        copy_keep_file("fp4.h", fnameh)
+
+        replace(fnamec,"YYY",tf)
+        replace(fnamec,"XXX",bd)
+        replace(fnamec,"ZZZ",tc)
+        replace(fnameh,"YYY",tf)
+        replace(fnameh,"XXX",bd)
+        replace(fnameh,"ZZZ",tc)
+        miracl_compile.compile_file(3, fnamec)
+
+        fnamec="fp12_"+tf+".cpp"
+        fnameh="fp12_"+tf+".h"
+
+        copy_temp_file("fp12.cpp", fnamec)
+        copy_keep_file("fp12.h", fnameh)
+
+        replace(fnamec,"YYY",tf)
+        replace(fnamec,"XXX",bd)
+        replace(fnamec,"ZZZ",tc)
+        replace(fnameh,"YYY",tf)
+        replace(fnameh,"XXX",bd)
+        replace(fnameh,"ZZZ",tc)
+        miracl_compile.compile_file(3, fnamec)
+
+        fnamec="ecp2_"+tc+".cpp"
+        fnameh="ecp2_"+tc+".h"
+
+        copy_temp_file("ecp2.cpp", fnamec)
+        copy_keep_file("ecp2.h", fnameh)
+
+        replace(fnamec,"ZZZ",tc)
+        replace(fnamec,"YYY",tf)
+        replace(fnamec,"XXX",bd)
+        replace(fnameh,"ZZZ",tc)
+        replace(fnameh,"YYY",tf)
+        replace(fnameh,"XXX",bd)
+        miracl_compile.compile_file(3, fnamec)
+
+        fnamec="pair_"+tc+".cpp"
+        fnameh="pair_"+tc+".h"
+
+        copy_temp_file("pair.cpp", fnamec)
+        copy_keep_file("pair.h", fnameh)
+
+        replace(fnamec,"ZZZ",tc)
+        replace(fnamec,"YYY",tf)
+        replace(fnamec,"XXX",bd)
+        replace(fnameh,"ZZZ",tc)
+        replace(fnameh,"YYY",tf)
+        replace(fnameh,"XXX",bd)
+        miracl_compile.compile_file(3, fnamec)
+
+        fnamec="mpin_"+tc+".cpp"
+        fnameh="mpin_"+tc+".h"
+
+        copy_temp_file("mpin.cpp", fnamec)
+        copy_keep_file("mpin.h", fnameh)
+
+        replace(fnamec,"ZZZ",tc)
+        replace(fnamec,"YYY",tf)
+        replace(fnamec,"XXX",bd)
+        replace(fnameh,"ZZZ",tc)
+        replace(fnameh,"YYY",tf)
+        replace(fnameh,"XXX",bd)
+        miracl_compile.compile_file(3, fnamec)
+
+        fnamec="bls_"+tc+".cpp"
+        fnameh="bls_"+tc+".h"
+
+        copy_temp_file("bls.cpp", fnamec)
+        copy_keep_file("bls.h", fnameh)
+
+        replace(fnamec,"ZZZ",tc)
+        replace(fnamec,"YYY",tf)
+        replace(fnamec,"XXX",bd)
+        replace(fnameh,"ZZZ",tc)
+        replace(fnameh,"YYY",tf)
+        replace(fnameh,"XXX",bd)
+        miracl_compile.compile_file(3, fnamec)
+
+replace("arch.h","@WL@","16")
+
+class miracl_crypto:
+    np_curves = (
+        ( "255", "F25519", "Ed25519", "13", "2", "1", "PSEUDO_MERSENNE", "0", "EDWARDS", "-1", "NOT_PF", "", "", "", "", "128"),
+        ( "256", "F256PME", "NUMS256E", "13", "1", "1", "PSEUDO_MERSENNE", "0", "EDWARDS", "1", "NOT_PF", "", "", "", "", "128"),
+        ( "160", "SECP160R1", "SECP160R1", "13", "1", "3", "NOT_SPECIAL", "0", "WEIERSTRASS", "-3", "NOT_PF", "", "", "", "", "128")
+    )
+
+    pf_curves = (
+        ( "254", "BN254", "BN254", "13", "1",["-1", "-1", "0"],"NOT_SPECIAL", "0", "WEIERSTRASS", "0", "BN_CURVE", "D_TYPE", "NEGATIVEX", "71", "66", "128"),
+        ( "254", "BN254CX", "BN254CX", "13", "1",["-1", "-1", "0"],"NOT_SPECIAL", "0", "WEIERSTRASS", "0", "BN_CURVE", "D_TYPE", "NEGATIVEX", "76", "66", "128")
+    )
+
+    # There are choices here, different ways of getting the same result, but some faster than others
+    rsa_params = (
+        # 256 is slower but may allow reuse of 256-bit BIGs used for elliptic curve
+        # 512 is faster.. but best is 1024
+        ( "256", "RSA2048", "13", "8")
+    )
+
+    total_entries = len(np_curves)+len(pf_curves)+len(rsa_params)
+
+    def valid_query(number):
+        return number >= 0 and number <= miracl_crypto.total_entries
+
+def interactive_prompt_print():
+    index = 1
+    print("Elliptic Curves")
+    for tuple in miracl_crypto.np_curves:
+        print(str(index) + ".", tuple[2])
+        index += 1
+
+    print("\nPairing-Friendly Elliptic Curves")
+    for tuple in miracl_crypto.pf_curves:
+        print(str(index) + ".", tuple[2])
+        index += 1
+
+    print("\nRSA")
+    # Python interprets the singular RSA entry in a way
+    # that doesn't allow for nested tuples if there aren't
+    # more than one entry, the original code has been commented
+    # out and replaced with a subpar fix
+    #
+    # If you are adding more RSA curves, it will error out
+    # Uncomment the original code if you intend to do so and
+    # comment out the patch
+    #
+    # for tuple in miracl_crypto.rsa_params:
+    #    print(str(index) + ".", "RSA" + str(tuple[1]))
+    #    index += 1
+    # ----BEGIN PATCH-------------
+    print(str(index) + ".", miracl_crypto.rsa_params[1])
+    index += 1
+    # ----END   PATCH--------------
+
+def interactive_prompt_exect(index):
+    index -= 1 # Python internally is zero-indexed
+    if index < len(miracl_crypto.np_curves):
+        tuple = miracl_crypto.np_curves[index]
+        curveset(
+            tuple[0], tuple[1], tuple[2], tuple[3], tuple[4],
+            tuple[5], tuple[6], tuple[7], tuple[8], tuple[9],
+            tuple[10], tuple[11], tuple[12],
+            tuple[13], tuple[14], tuple[15]
+        )
+    elif index < len(miracl_crypto.np_curves) + len(miracl_crypto.pf_curves):
+        tuple = miracl_crypto.pf_curves[index-len(miracl_crypto.np_curves)]
+        curveset(
+            tuple[0], tuple[1], tuple[2], tuple[3], tuple[4],
+            tuple[5], tuple[6], tuple[7], tuple[8], tuple[9],
+            tuple[10], tuple[11], tuple[12],
+            tuple[13], tuple[14], tuple[15]
+        )
+    else:
+        # Python interprets the singular RSA entry in a way
+        # that doesn't allow for nested tuples if there aren't
+        # more than one entry, the original code has been commented
+        # out and replaced with a subpar fix
+        #
+        # If you are adding more RSA curves, it will error out
+        # Uncomment the original code if you intend to do so and
+        # comment out the patch
+        #
+        # tuple = miracl_crypto.rsa_params[index-(len(miracl_crypto.np_curves)+len(miracl_crypto.pf_curves))]
+        # rsaset(
+        #     tuple[0], tuple[1], tuple[2], tuple[3]
+        # )
+        # ----BEGIN PATCH-------------
+        rsaset(
+            miracl_crypto.rsa_params[0], miracl_crypto.rsa_params[1], miracl_crypto.rsa_params[2], miracl_crypto.rsa_params[3]
+        )
+        # ----END   PATCH--------------
+
+def interactive_prompt_input():
+    while True:
+        userInput = input("\nChoose schemes to support (select 0 to finish): ")
+        try:
+            return int(userInput)
+        except:
+            if (userInput == ''):
+                return 0
+            print("Non-integer input, select values between 1 and " + str(miracl_crypto.total_entries))
+            interactive_prompt_input()
+
+interactive_prompt_print()
+while keep_querying and not testing:
+    query_val = -1
+    while not miracl_crypto.valid_query(query_val):
+        query_val = interactive_prompt_input()
+        if not miracl_crypto.valid_query(query_val):
+            print("Number out of range, select values between 1 and " + str(miracl_crypto.total_entries))
+        elif query_val == 0:
+            keep_querying = False
+        else:
+            interactive_prompt_exect(query_val)
+
+if testing:
+    for i in range(0, miracl_crypto.total_entries):
+        interactive_prompt_exect(i+1)
+
+# create library
+miracl_compile.compile_file(3, "randapi.cpp")
+miracl_compile.compile_file(3, "hash.cpp")
+miracl_compile.compile_file(3, "hmac.cpp")
+miracl_compile.compile_file(3, "rand.cpp")
+miracl_compile.compile_file(3, "oct.cpp")
+miracl_compile.compile_file(3, "share.cpp")
+miracl_compile.compile_file(3, "aes.cpp")
+miracl_compile.compile_file(3, "gcm.cpp")
+miracl_compile.compile_file(3, "newhope.cpp")
+miracl_compile.compile_file(3, "dilithium.cpp")
+miracl_compile.compile_file(3, "kyber.cpp")
+miracl_compile.compile_file(3, "x509.cpp")
+
+if sys.platform.startswith("win") :
+    os.system("for %i in (*.o) do @echo %~nxi >> f.list")
+    os.system("ar rc core.a @f.list")
+    delete_file("f.list")
+else :
+    os.system("ar rc core.a *.o")
+
+if testing :
+    miracl_compile.compile_binary(2, "testecc.cpp", "core.a", "testecc")
+    miracl_compile.compile_binary(2, "testmpin.cpp", "core.a", "testmpin")
+    miracl_compile.compile_binary(2, "testbls.cpp", "core.a", "testbls")
+    miracl_compile.compile_binary(2, "benchtest_all.cpp", "core.a", "benchtest_all")
+
+#clean up
+for file in generated_files:
+    delete_file(file)
+
+delete_file("*.o")
+delete_file("big.*")
+delete_file("fp.*")
+delete_file("ecp.*")
+delete_file("ecdh.*")
+delete_file("hpke.*")
+delete_file("ff.*")
+delete_file("rsa.*")
+delete_file("config_big.h")
+delete_file("config_field.h")
+delete_file("config_curve.h")
+delete_file("config_ff.h")
+delete_file("fp2.*")
+delete_file("fp4.*")
+delete_file("fp8.*")
+delete_file("fp16.*")
+delete_file("share.cpp")
+delete_file("x509.cpp")
+delete_file("gcm.cpp")
+delete_file("hash.cpp")
+delete_file("hmac.cpp")
+delete_file("aes.cpp")
+delete_file("oct.cpp");
+delete_file("newhope.cpp")
+delete_file("dilithium.cpp")
+delete_file("kyber.cpp")
+delete_file("Doxyfile")
+delete_file("refman.pdf")
+delete_file("readme.md")
+delete_file("rand.cpp")
+delete_file("randapi.cpp")
+delete_file("config*.py")
+
+delete_file("fp12.*")
+delete_file("fp24.*")
+delete_file("fp48.*")
+
+delete_file("ecp2.*")
+delete_file("ecp4.*")
+delete_file("ecp8.*")
+
+delete_file("pair.*")
+delete_file("mpin.*")
+delete_file("bls.*")
+
+delete_file("pair4.*")
+delete_file("mpin192.*")
+delete_file("bls192.*")
+
+delete_file("pair8.*")
+delete_file("mpin256.*")
+delete_file("bls256.*")
+
+delete_file("rom_field*.cpp")
+delete_file("rom_curve*.cpp")
+
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config32.py b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config32.py
new file mode 100644
index 0000000..38e83a1
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config32.py
@@ -0,0 +1,983 @@
+#!/usr/bin/env python3
+
+#
+# Copyright (c) 2012-2020 MIRACL UK Ltd.
+#
+# This file is part of MIRACL Core
+# (see https://github.com/miracl/core).
+#
+# Licensed under the Apache License, Version 2.0 (the "License");
+# you may not use this file except in compliance with the License.
+# You may obtain a copy of the License at
+#
+#     http://www.apache.org/licenses/LICENSE-2.0
+#
+# Unless required by applicable law or agreed to in writing, software
+# distributed under the License is distributed on an "AS IS" BASIS,
+# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+# See the License for the specific language governing permissions and
+# limitations under the License.
+#
+
+import os
+import sys
+import shutil
+import fnmatch
+
+testing=False
+keep_querying=True
+
+if len(sys.argv)==2 :
+    if sys.argv[1]=="test":
+        testing=True
+
+my_compiler = "g++"
+generated_files = []
+
+def copy_keep_file(file, target):
+    shutil.copyfile(file, target)
+
+def copy_temp_file(file, target):
+    shutil.copyfile(file, target)
+    generated_files.append(target)
+
+def delete_file(expression):
+    for root, dirs, files in os.walk(os.path.abspath(os.path.dirname(__file__))):
+        for name in files:
+            if fnmatch.fnmatch(name, expression):
+                os.remove(os.path.join(root, name))
+
+class miracl_compile:
+    def compile_file(optim, file):
+        print("Processing " + file + "..", end = "", flush=True)
+        if optim != 0:
+            flags = " -O%d -c %s" % (optim, file)
+        else:
+            flags = "  -c %s" % (file)
+        os.system(my_compiler + flags)
+        print(". [DONE]")
+
+    def compile_binary(optim, file, lib, bin):
+        print("Processing " + file + "..", end = "", flush=True)
+        if sys.platform.startswith("win"):
+            bin += ".exe"
+        if optim != 0:
+            flags = "  -O%d %s %s -o %s" % (optim, file, lib, bin)
+        else:
+            flags = "  %s %s -o %s" % (file, lib, bin)
+        os.system(my_compiler + flags)
+        print(". [DONE]")
+
+def inline_mul1(N,base)  :
+    str=""
+    str+="\tt=(dchunk)a[0]*b[0]; c[0]=(chunk)t & BMASK_XXX; t=t>>BASEBITS_XXX;\n"
+
+    for i in range(1,N) :
+        k=0;
+        str+="\tt=t"
+        while (k<=i) :
+            str+="+(dchunk)a[{}]*b[{}]".format(k,i-k)
+            k+=1
+        str+="; c[{}]=(chunk)t & BMASK_XXX; ".format(i)
+        str+="t=t>>BASEBITS_XXX;\n"
+
+    for i in range(N,2*N-1) :
+        k=i-(N-1)
+        str+="\tt=t"
+        while (k<=N-1) :
+            str+="+(dchunk)a[{}]*b[{}]".format(k,i-k)
+            k+=1
+        str+="; c[{}]=(chunk)t & BMASK_XXX; ".format(i)
+        str+="t=t>>BASEBITS_XXX;\n"
+
+    str+="\tc[{}]=(chunk)t;\n".format(2*N-1)
+
+    return str.replace("XXX",base)
+
+def inline_mul2(N,base)  :
+    str=""
+    for i in range(0,N) :
+        str+="\td[{}]=(dchunk)a[{}]*b[{}];\n".format(i, i, i)
+    str+="\n\ts=d[0];\n\tt = s; c[0]=(chunk)t&BMASK_XXX; co=t>>BASEBITS_XXX;\n"
+    for k in range(1,N) :
+        str+="\ts+=d[{}]; t=co+s ".format(k)
+        for i in range(k,int(k/2),-1) :
+            str+="+(dchunk)(a[{}]-a[{}])*(b[{}]-b[{}])".format(i,k - i, k - i, i)
+        str+="; c[{}]=(chunk)t&BMASK_XXX; co=t>>BASEBITS_XXX; \n".format(k)
+    str+="\n"
+    for k in range(N,2 * N - 1) :
+        str+="\ts-=d[{}]; t=co+s ".format(k - N)
+        for i in range(N-1,int(k/2),-1) :
+            str+="+(dchunk)(a[{}]-a[{}])*(b[{}]-b[{}])".format(i, k - i, k - i, i)
+        str+="; c[{}]=(chunk)t&BMASK_XXX; co=t>>BASEBITS_XXX; \n".format(k)
+
+    str+="\tc[{}]=(chunk)co;\n".format(2 * N - 1)
+    return str.replace("XXX",base)
+
+def inline_sqr(N,base) :
+    str=""
+    str+="\n\tt=(dchunk)a[0]*a[0]; c[0]=(chunk)t&BMASK_XXX; co=t>>BASEBITS_XXX;\n"
+
+    for k in range(1,N) :
+        str+="\tt= "
+        for i in range(k,int(k/2),-1) :
+            str+="+(dchunk)a[{}]*a[{}]".format(i, k - i)
+        str+="; t+=t; t+=co;"
+        if k % 2 == 0 :
+            str+=" t+=(dchunk)a[{}]*a[{}];".format(int(k/2), int(k/2))
+        str+=" c[{}]=(chunk)t&BMASK_XXX; co=t>>BASEBITS_XXX; \n".format(k)
+    str+="\n"
+
+    for k in range(N,2*N-2) :
+        str+="\tt= "
+        for i in range(N-1,int(k/2),-1) :
+            str+="+(dchunk)a[{}]*a[{}]".format(i, k - i)
+        str+="; t+=t; t+=co;"
+        if k % 2 == 0 :
+            str+=" t+=(dchunk)a[{}]*a[{}];".format(int(k/2),int(k/2))
+        str+=" c[{}]=(chunk)t&BMASK_XXX; co=t>>BASEBITS_XXX; \n".format(k)
+
+    str+="\tt=co; t+=(dchunk)a[{}]*a[{}]; c[{}]=(chunk)t&BMASK_XXX; co=t>>BASEBITS_XXX; \n ".format(N-1,N-1,2*N-2)
+
+    str+="\tc[{}]=(chunk)co;\n".format(2 * N - 1)
+    return str.replace("XXX",base)
+
+def inline_redc2(N,base) :
+    str=""
+    str+="\tt=d[0]; v[0]=((chunk)t*MC)&BMASK_XXX; t+=(dchunk)v[0]*md[0];  s=0; c=(t>>BASEBITS_XXX);\n\n"
+
+    for k in range(1,N) :
+        str+="\tt=d[{}]+c+s+(dchunk)v[0]*md[{}]".format(k, k)
+        for i in range(k-1,int(k/2),-1) :
+            str+="+(dchunk)(v[{}]-v[{}])*(md[{}]-md[{}])".format(k - i, i, i, k - i)
+        str+="; v[{}]=((chunk)t*MC)&BMASK_XXX; t+=(dchunk)v[{}]*md[0]; ".format(k, k)
+        str+=" dd[{}]=(dchunk)v[{}]*md[{}]; s+=dd[{}]; c=(t>>BASEBITS_XXX); \n".format(k, k, k, k)
+
+    str+="\n"
+    for k in range(N,2*N-1) :
+        str+="\tt=d[{}]+c+s".format(k)
+        for i in range(N-1,int(k/2),-1) :
+            str+="+(dchunk)(v[{}]-v[{}])*(md[{}]-md[{}])".format(k - i, i, i, k - i)
+        str+="; a[{}]=(chunk)t&BMASK_XXX;  s-=dd[{}]; c=(t>>BASEBITS_XXX); \n".format(k - N, k - N + 1)
+
+    str+="\ta[{}]=d[{}]+((chunk)c&BMASK_XXX);\n".format(N-1,2*N-1)
+    return str.replace("XXX",base)
+
+def inline_redc1(N,base) :
+    str=""
+
+    str+="\tt = d[0];\n"
+    str+="\tv[0] = ((chunk)t * MC)&BMASK_XXX;\n"
+    str+="\tt += (dchunk)v[0] * md[0];\n"
+    str+="\tt = (t >> BASEBITS_XXX) + d[1];\n"
+
+    for i in range(1,N) :
+        k=1
+        str+="\tt += (dchunk)v[0] * md[{}] ".format(i)
+        while k<i :
+            str+="+ (dchunk)v[{}]*md[{}]".format(k,i-k)
+            k+=1
+        str+="; v[{}] = ((chunk)t * MC)&BMASK_XXX; ".format(i)
+        str+="t += (dchunk)v[{}] * md[0]; ".format(i)
+        str+="t = (t >> BASEBITS_XXX) + d[{}];\n".format(i+1)
+
+    for i in range(N,2*N-1) :
+        k=i-(N-1)
+        str+="\tt=t "
+        while k<=N-1 :
+            str+="+ (dchunk)v[{}]*md[{}] ".format(k,i-k)
+            k+=1
+        str+="; a[{}] = (chunk)t & BMASK_XXX; ".format(i-N)
+        str+="t = (t >> BASEBITS_XXX) + d[{}];\n".format(i+1)
+
+    str+="\ta[{}] = (chunk)t & BMASK_XXX;\n".format(N-1)
+    return str.replace("XXX",base)
+
+
+def replace(namefile,oldtext,newtext):
+    f = open(namefile,'r')
+    filedata = f.read()
+    f.close()
+
+    newdata = filedata.replace(oldtext,newtext)
+
+    f = open(namefile,'w')
+    f.write(newdata)
+    f.close()
+
+# rsaset(big,ring,bit_bits_in_base,multiplier)
+# for each choice give distinct names for "big" and "ring".
+# Typically "big" is the length in bits of the underlying big number type
+# "ring" is the RSA modulus size = "big" times 2^m
+# Next give the number base used for 32 bit architectures, as n where the base is 2^n
+# multiplier is 2^m (see above)
+def rsaset(tb,tff,base,ml) :
+    itb=int(tb)
+    inb=int(itb/8)
+    nb=str(inb)
+    ib=int(base)
+    inb=int(nb)
+
+    nlen=(1+((8*inb-1)//ib))
+
+    bd="B"+tb+"_"+base
+    fnameh="config_big_"+bd+".h"
+    copy_keep_file("config_big.h", fnameh)
+    replace(fnameh,"XXX",bd)
+    replace(fnameh,"@NB@",nb)
+    replace(fnameh,"@BASE@",base)
+
+    fnameh="config_ff_"+tff+".h"
+    copy_keep_file("config_ff.h", fnameh)
+    replace(fnameh,"XXX",bd)
+    replace(fnameh,"WWW",tff)
+    replace(fnameh,"@ML@",ml);
+
+    fnamec="big_"+bd+".cpp"
+    fnameh="big_"+bd+".h"
+
+    copy_temp_file("big.cpp", fnamec)
+    copy_keep_file("big.h", fnameh)
+
+    replace(fnamec,"XXX",bd)
+    replace(fnameh,"XXX",bd)
+
+    replace(fnamec,"INLINE_MUL1",inline_mul1(nlen,bd))
+    replace(fnamec,"INLINE_MUL2",inline_mul2(nlen,bd))
+    replace(fnamec,"INLINE_SQR",inline_sqr(nlen,bd))
+    replace(fnamec,"INLINE_REDC1",inline_redc1(nlen,bd))
+    replace(fnamec,"INLINE_REDC2",inline_redc2(nlen,bd))
+
+
+    miracl_compile.compile_file(3, fnamec)
+
+    fnamec="ff_"+tff+".cpp"
+    fnameh="ff_"+tff+".h"
+
+    copy_temp_file("ff.cpp", fnamec)
+    copy_keep_file("ff.h", fnameh)
+
+    replace(fnamec,"WWW",tff)
+    replace(fnamec,"XXX",bd)
+    replace(fnameh,"WWW",tff)
+    replace(fnameh,"XXX",bd)
+    miracl_compile.compile_file(3, fnamec)
+
+    fnamec="rsa_"+tff+".cpp"
+    fnameh="rsa_"+tff+".h"
+
+    copy_temp_file("rsa.cpp", fnamec)
+    copy_keep_file("rsa.h", fnameh)
+
+    replace(fnamec,"WWW",tff)
+    replace(fnamec,"XXX",bd)
+    replace(fnameh,"WWW",tff)
+    replace(fnameh,"XXX",bd)
+    miracl_compile.compile_file(3, fnamec)
+
+# curveset(modulus_bits,field,curve,bits_in_base,modulus_mod_8,Z,modulus_type,curve_type,Curve A,pairing_friendly,sextic twist,sign of x,g2_table size,ate bits,curve security)
+# for each curve give names for field and curve. In many cases the latter two will be the same.
+# modulus_bits is the bit length of the modulus, typically the same or slightly smaller than "big"
+# Typically "field" describes the modulus, and "curve" is the common name for the elliptic curve
+# Next give the number base used for 32 bit architecture, as n where the base is 2^n (note that these must be fixed for the same "big" name, if is ever re-used for another curve)
+# m8 max m such that 2^m | modulus-1
+# rz Z value for hash_to_point, If list G1 Z value is in [0], G2 Z value (=a+bz) is in [1], [2]
+# modulus_type is NOT_SPECIAL, or PSEUDO_MERSENNE, or MONTGOMERY_Friendly, or GENERALISED_MERSENNE (supported for Ed448 only)
+# i for Fp2 QNR 2^i+sqrt(-1) (relevant for PFCs only, else =0). Or QNR over Fp if p=1 mod 8
+# curve_type is WEIERSTRASS, EDWARDS or MONTGOMERY
+# Curve A parameter
+# pairing_friendly is BN_CURVE, BLS_CURVE or NOT_PF (if not pairing friendly)
+# if pairing friendly. M or D type twist, and sign of the family parameter x
+# g2_table size is number of entries in precomputed table
+# ate bits is number of bits in Ate parameter (from romgen program)
+# curve security is AES equiavlent, rounded up.
+def curveset(nbt,tf,tc,base,m8,rz,mt,qi,ct,ca,pf,stw,sx,g2,ab,cs) :
+    inbt=int(nbt)
+    itb=int(inbt+(8-inbt%8)%8)
+    inb=int(itb/8)
+    tb=str(itb)
+    nb=str(inb)
+
+    bd="B"+tb+"_"+base
+
+    fnameh="config_big_"+bd+".h"
+    copy_keep_file("config_big.h", fnameh)
+
+    replace(fnameh,"XXX",bd)
+    replace(fnameh,"@NB@",nb)
+    replace(fnameh,"@BASE@",base)
+
+    fnameh="config_field_"+tf+".h"
+    copy_keep_file("config_field.h", fnameh)
+
+    replace(fnameh,"XXX",bd)
+    replace(fnameh,"YYY",tf)
+    replace(fnameh,"@NBT@",nbt)
+    replace(fnameh,"@M8@",m8)
+    replace(fnameh,"@MT@",mt)
+    hc="0"
+    hc2="0"
+# Get Hash-to-Curve Z for G1 and G2
+
+    if isinstance(rz,list) :
+        if len(rz)==2 :     # Z followed by SSWU isogeny degree
+            replace(fnameh,"@RZ@",rz[0])
+            replace(fnameh,"@RZ2A@","0")
+            replace(fnameh,"@RZ2B@","0")
+            hc=rz[1]
+        if len(rz)==3 :     # Z for G1 followed by Z for G2 (for SVDW)
+            replace(fnameh,"@RZ@",rz[0])
+            replace(fnameh,"@RZ2A@",rz[1])
+            replace(fnameh,"@RZ2B@",rz[2])
+        if len(rz)==5 :     # Z for G1, Z for G2, SSWU isogeny degree for G1, SSWU isogeny degree for G2
+            replace(fnameh,"@RZ@",rz[0])
+            replace(fnameh,"@RZ2A@",rz[1])
+            replace(fnameh,"@RZ2B@",rz[2])
+            hc=rz[3]
+            hc2=rz[4]
+    else :
+        replace(fnameh,"@RZ@",rz)   # just Z for SSWU, or indicates RFC7748 or Generic for Elligator
+        replace(fnameh,"@RZ2A@","0")
+        replace(fnameh,"@RZ2B@","0")
+    itw=int(qi)%10
+    replace(fnameh,"@QI@",str(itw))
+    if int(qi)//10 > 0 :
+        replace(fnameh,"@TW@","POSITOWER")
+    else :
+        replace(fnameh,"@TW@","NEGATOWER")
+
+    ib=int(base)
+    inb=int(nb)
+    inbt=int(nbt)
+    nlen=(1+((8*inb-1)//ib))
+    sh=ib*nlen-inbt
+
+    if sh > 14 :
+        sh=14
+    replace(fnameh,"@SH@",str(sh))
+
+    fnameh="config_curve_"+tc+".h"
+    copy_keep_file("config_curve.h", fnameh)
+
+    replace(fnameh,"XXX",bd)
+    replace(fnameh,"YYY",tf)
+    replace(fnameh,"ZZZ",tc)
+    replace(fnameh,"@CT@",ct)
+    replace(fnameh,"@CA@",ca)
+    replace(fnameh,"@PF@",pf)
+
+    replace(fnameh,"@ST@",stw)
+    replace(fnameh,"@SX@",sx)
+    replace(fnameh,"@CS@",cs)
+    replace(fnameh,"@AB@",ab)
+    replace(fnameh,"@G2@",g2)
+
+    replace(fnameh,"@HC@",hc)
+    replace(fnameh,"@HC2@",hc2)
+
+    fnamec="big_"+bd+".cpp"
+    fnameh="big_"+bd+".h"
+
+    copy_temp_file("big.cpp", fnamec)
+    copy_keep_file("big.h", fnameh)
+
+    replace(fnamec,"XXX",bd)
+    replace(fnameh,"XXX",bd)
+
+    replace(fnamec,"INLINE_MUL1",inline_mul1(nlen,bd))
+    replace(fnamec,"INLINE_MUL2",inline_mul2(nlen,bd))
+    replace(fnamec,"INLINE_SQR",inline_sqr(nlen,bd))
+    replace(fnamec,"INLINE_REDC1",inline_redc1(nlen,bd))
+    replace(fnamec,"INLINE_REDC2",inline_redc2(nlen,bd))
+
+    miracl_compile.compile_file(3, fnamec)
+
+    fnamec="fp_"+tf+".cpp"
+    fnameh="fp_"+tf+".h"
+
+    copy_temp_file("fp.cpp", fnamec)
+    copy_keep_file("fp.h", fnameh)
+
+    replace(fnamec,"YYY",tf)
+    replace(fnamec,"XXX",bd)
+    replace(fnameh,"YYY",tf)
+    replace(fnameh,"XXX",bd)
+    miracl_compile.compile_file(3, fnamec)
+
+    miracl_compile.compile_file(3, "rom_field_"+tf+".cpp");
+
+    fnamec="ecp_"+tc+".cpp"
+    fnameh="ecp_"+tc+".h"
+
+    copy_temp_file("ecp.cpp", fnamec)
+    copy_keep_file("ecp.h", fnameh)
+
+    replace(fnamec,"ZZZ",tc)
+    replace(fnamec,"YYY",tf)
+    replace(fnamec,"XXX",bd)
+    replace(fnameh,"ZZZ",tc)
+    replace(fnameh,"YYY",tf)
+    replace(fnameh,"XXX",bd)
+    miracl_compile.compile_file(3, fnamec)
+
+    fnamec="ecdh_"+tc+".cpp"
+    fnameh="ecdh_"+tc+".h"
+
+    copy_temp_file("ecdh.cpp", fnamec)
+    copy_keep_file("ecdh.h", fnameh)
+
+    replace(fnamec,"ZZZ",tc)
+    replace(fnamec,"YYY",tf)
+    replace(fnamec,"XXX",bd)
+    replace(fnameh,"ZZZ",tc)
+    replace(fnameh,"YYY",tf)
+    replace(fnameh,"XXX",bd)
+    miracl_compile.compile_file(3, fnamec)
+
+
+    fnamec="eddsa_"+tc+".cpp"
+    fnameh="eddsa_"+tc+".h"
+
+    copy_temp_file("eddsa.cpp", fnamec)
+    copy_keep_file("eddsa.h", fnameh)
+
+    replace(fnamec,"ZZZ",tc)
+    replace(fnamec,"YYY",tf)
+    replace(fnamec,"XXX",bd)
+    replace(fnameh,"ZZZ",tc)
+    replace(fnameh,"YYY",tf)
+    replace(fnameh,"XXX",bd)
+    miracl_compile.compile_file(3, fnamec)
+
+
+    fnamec="hpke_"+tc+".cpp"
+    fnameh="hpke_"+tc+".h"
+
+    copy_temp_file("hpke.cpp", fnamec)
+    copy_keep_file("hpke.h", fnameh)
+
+    replace(fnamec,"ZZZ",tc)
+    replace(fnameh,"ZZZ",tc)
+    miracl_compile.compile_file(3, fnamec)
+
+    miracl_compile.compile_file(3, "rom_curve_"+tc+".cpp");
+
+    if pf != "NOT_PF" :
+        fnamec="fp2_"+tf+".cpp"
+        fnameh="fp2_"+tf+".h"
+
+        copy_temp_file("fp2.cpp", fnamec)
+        copy_keep_file("fp2.h", fnameh)
+        replace(fnamec,"YYY",tf)
+        replace(fnamec,"XXX",bd)
+        replace(fnameh,"YYY",tf)
+        replace(fnameh,"XXX",bd)
+        miracl_compile.compile_file(3, fnamec)
+
+        fnamec="fp4_"+tf+".cpp"
+        fnameh="fp4_"+tf+".h"
+
+        copy_temp_file("fp4.cpp", fnamec)
+        copy_keep_file("fp4.h", fnameh)
+
+        replace(fnamec,"YYY",tf)
+        replace(fnamec,"XXX",bd)
+        replace(fnamec,"ZZZ",tc)
+        replace(fnameh,"YYY",tf)
+        replace(fnameh,"XXX",bd)
+        replace(fnameh,"ZZZ",tc)
+        miracl_compile.compile_file(3, fnamec)
+
+
+        if pf == "BN_CURVE" or pf == "BLS12_CURVE" :
+            fnamec="fp12_"+tf+".cpp"
+            fnameh="fp12_"+tf+".h"
+
+            copy_temp_file("fp12.cpp", fnamec)
+            copy_keep_file("fp12.h", fnameh)
+
+            replace(fnamec,"YYY",tf)
+            replace(fnamec,"XXX",bd)
+            replace(fnamec,"ZZZ",tc)
+            replace(fnameh,"YYY",tf)
+            replace(fnameh,"XXX",bd)
+            replace(fnameh,"ZZZ",tc)
+            miracl_compile.compile_file(3, fnamec)
+
+            fnamec="ecp2_"+tc+".cpp"
+            fnameh="ecp2_"+tc+".h"
+
+            copy_temp_file("ecp2.cpp", fnamec)
+            copy_keep_file("ecp2.h", fnameh)
+
+            replace(fnamec,"ZZZ",tc)
+            replace(fnamec,"YYY",tf)
+            replace(fnamec,"XXX",bd)
+            replace(fnameh,"ZZZ",tc)
+            replace(fnameh,"YYY",tf)
+            replace(fnameh,"XXX",bd)
+            miracl_compile.compile_file(3, fnamec)
+
+            fnamec="pair_"+tc+".cpp"
+            fnameh="pair_"+tc+".h"
+
+            copy_temp_file("pair.cpp", fnamec)
+            copy_keep_file("pair.h", fnameh)
+
+            replace(fnamec,"ZZZ",tc)
+            replace(fnamec,"YYY",tf)
+            replace(fnamec,"XXX",bd)
+            replace(fnameh,"ZZZ",tc)
+            replace(fnameh,"YYY",tf)
+            replace(fnameh,"XXX",bd)
+            miracl_compile.compile_file(3, fnamec)
+
+            fnamec="mpin_"+tc+".cpp"
+            fnameh="mpin_"+tc+".h"
+
+            copy_temp_file("mpin.cpp", fnamec)
+            copy_keep_file("mpin.h", fnameh)
+
+            replace(fnamec,"ZZZ",tc)
+            replace(fnamec,"YYY",tf)
+            replace(fnamec,"XXX",bd)
+            replace(fnameh,"ZZZ",tc)
+            replace(fnameh,"YYY",tf)
+            replace(fnameh,"XXX",bd)
+            miracl_compile.compile_file(3, fnamec)
+
+            fnamec="bls_"+tc+".cpp"
+            fnameh="bls_"+tc+".h"
+
+            copy_temp_file("bls.cpp", fnamec)
+            copy_keep_file("bls.h", fnameh)
+
+            replace(fnamec,"ZZZ",tc)
+            replace(fnamec,"YYY",tf)
+            replace(fnamec,"XXX",bd)
+            replace(fnameh,"ZZZ",tc)
+            replace(fnameh,"YYY",tf)
+            replace(fnameh,"XXX",bd)
+            miracl_compile.compile_file(3, fnamec)
+
+        if pf == "BLS24_CURVE" :
+            fnamec="fp8_"+tf+".cpp"
+            fnameh="fp8_"+tf+".h"
+
+            copy_temp_file("fp8.cpp", fnamec)
+            copy_keep_file("fp8.h", fnameh)
+
+            replace(fnamec,"YYY",tf)
+            replace(fnamec,"XXX",bd)
+            replace(fnamec,"ZZZ",tc)
+            replace(fnameh,"YYY",tf)
+            replace(fnameh,"XXX",bd)
+            replace(fnameh,"ZZZ",tc)
+            miracl_compile.compile_file(3, fnamec)
+
+
+            fnamec="fp24_"+tf+".cpp"
+            fnameh="fp24_"+tf+".h"
+
+            copy_temp_file("fp24.cpp", fnamec)
+            copy_keep_file("fp24.h", fnameh)
+
+            replace(fnamec,"YYY",tf)
+            replace(fnamec,"XXX",bd)
+            replace(fnamec,"ZZZ",tc)
+            replace(fnameh,"YYY",tf)
+            replace(fnameh,"XXX",bd)
+            replace(fnameh,"ZZZ",tc)
+            miracl_compile.compile_file(3, fnamec)
+
+            fnamec="ecp4_"+tc+".cpp"
+            fnameh="ecp4_"+tc+".h"
+
+            copy_temp_file("ecp4.cpp", fnamec)
+            copy_keep_file("ecp4.h", fnameh)
+
+            replace(fnamec,"ZZZ",tc)
+            replace(fnamec,"YYY",tf)
+            replace(fnamec,"XXX",bd)
+            replace(fnameh,"ZZZ",tc)
+            replace(fnameh,"YYY",tf)
+            replace(fnameh,"XXX",bd)
+            miracl_compile.compile_file(3, fnamec)
+
+            fnamec="pair4_"+tc+".cpp"
+            fnameh="pair4_"+tc+".h"
+
+            copy_temp_file("pair4.cpp", fnamec)
+            copy_keep_file("pair4.h", fnameh)
+
+            replace(fnamec,"ZZZ",tc)
+            replace(fnamec,"YYY",tf)
+            replace(fnamec,"XXX",bd)
+            replace(fnameh,"ZZZ",tc)
+            replace(fnameh,"YYY",tf)
+            replace(fnameh,"XXX",bd)
+            miracl_compile.compile_file(3, fnamec)
+
+            fnamec="mpin192_"+tc+".cpp"
+            fnameh="mpin192_"+tc+".h"
+
+            copy_temp_file("mpin192.cpp", fnamec)
+            copy_keep_file("mpin192.h", fnameh)
+
+            replace(fnamec,"ZZZ",tc)
+            replace(fnamec,"YYY",tf)
+            replace(fnamec,"XXX",bd)
+            replace(fnameh,"ZZZ",tc)
+            replace(fnameh,"YYY",tf)
+            replace(fnameh,"XXX",bd)
+            miracl_compile.compile_file(3, fnamec)
+
+            fnamec="bls192_"+tc+".cpp"
+            fnameh="bls192_"+tc+".h"
+
+            copy_temp_file("bls192.cpp", fnamec)
+            copy_keep_file("bls192.h", fnameh)
+
+            replace(fnamec,"ZZZ",tc)
+            replace(fnamec,"YYY",tf)
+            replace(fnamec,"XXX",bd)
+            replace(fnameh,"ZZZ",tc)
+            replace(fnameh,"YYY",tf)
+            replace(fnameh,"XXX",bd)
+            miracl_compile.compile_file(3, fnamec)
+
+        if pf == "BLS48_CURVE" :
+
+            fnamec="fp8_"+tf+".cpp"
+            fnameh="fp8_"+tf+".h"
+
+            copy_temp_file("fp8.cpp", fnamec)
+            copy_keep_file("fp8.h", fnameh)
+
+            replace(fnamec,"YYY",tf)
+            replace(fnamec,"XXX",bd)
+            replace(fnamec,"ZZZ",tc)
+            replace(fnameh,"YYY",tf)
+            replace(fnameh,"XXX",bd)
+            replace(fnameh,"ZZZ",tc)
+            miracl_compile.compile_file(3, fnamec)
+
+
+            fnamec="ecp8_"+tc+".cpp"
+            fnameh="ecp8_"+tc+".h"
+
+            copy_temp_file("ecp8.cpp", fnamec)
+            copy_keep_file("ecp8.h", fnameh)
+
+            replace(fnamec,"ZZZ",tc)
+            replace(fnamec,"YYY",tf)
+            replace(fnamec,"XXX",bd)
+            replace(fnameh,"ZZZ",tc)
+            replace(fnameh,"YYY",tf)
+            replace(fnameh,"XXX",bd)
+            miracl_compile.compile_file(3, fnamec)
+
+
+            fnamec="fp16_"+tf+".cpp"
+            fnameh="fp16_"+tf+".h"
+
+            copy_temp_file("fp16.cpp", fnamec)
+            copy_keep_file("fp16.h", fnameh)
+
+            replace(fnamec,"YYY",tf)
+            replace(fnamec,"XXX",bd)
+            replace(fnamec,"ZZZ",tc)
+            replace(fnameh,"YYY",tf)
+            replace(fnameh,"XXX",bd)
+            replace(fnameh,"ZZZ",tc)
+            miracl_compile.compile_file(3, fnamec)
+
+
+            fnamec="fp48_"+tf+".cpp"
+            fnameh="fp48_"+tf+".h"
+
+            copy_temp_file("fp48.cpp", fnamec)
+            copy_keep_file("fp48.h", fnameh)
+
+            replace(fnamec,"YYY",tf)
+            replace(fnamec,"XXX",bd)
+            replace(fnamec,"ZZZ",tc)
+            replace(fnameh,"YYY",tf)
+            replace(fnameh,"XXX",bd)
+            replace(fnameh,"ZZZ",tc)
+            miracl_compile.compile_file(3, fnamec)
+
+
+            fnamec="pair8_"+tc+".cpp"
+            fnameh="pair8_"+tc+".h"
+
+            copy_temp_file("pair8.cpp", fnamec)
+            copy_keep_file("pair8.h", fnameh)
+  
+            replace(fnamec,"ZZZ",tc)
+            replace(fnamec,"YYY",tf)
+            replace(fnamec,"XXX",bd)
+            replace(fnameh,"ZZZ",tc)
+            replace(fnameh,"YYY",tf)
+            replace(fnameh,"XXX",bd)
+            miracl_compile.compile_file(3, fnamec)
+
+            fnamec="mpin256_"+tc+".cpp"
+            fnameh="mpin256_"+tc+".h"
+
+            copy_temp_file("mpin256.cpp", fnamec)
+            copy_keep_file("mpin256.h", fnameh)
+
+            replace(fnamec,"ZZZ",tc)
+            replace(fnamec,"YYY",tf)
+            replace(fnamec,"XXX",bd)
+            replace(fnameh,"ZZZ",tc)
+            replace(fnameh,"YYY",tf)
+            replace(fnameh,"XXX",bd)
+            miracl_compile.compile_file(3, fnamec)
+
+            fnamec="bls256_"+tc+".cpp"
+            fnameh="bls256_"+tc+".h"
+
+            copy_temp_file("bls256.cpp", fnamec)
+            copy_keep_file("bls256.h", fnameh)
+
+            replace(fnamec,"ZZZ",tc)
+            replace(fnamec,"YYY",tf)
+            replace(fnamec,"XXX",bd)
+            replace(fnameh,"ZZZ",tc)
+            replace(fnameh,"YYY",tf)
+            replace(fnameh,"XXX",bd)
+            miracl_compile.compile_file(3, fnamec)
+
+replace("arch.h","@WL@","32")
+
+class miracl_crypto:
+    np_curves = (
+        ( "255", "F25519", "Ed25519", "29", "2", "1", "PSEUDO_MERSENNE", "0", "EDWARDS", "-1", "NOT_PF", "", "", "", "", "128"),
+        ( "255", "F25519", "C25519", "29", "2", "1", "PSEUDO_MERSENNE", "0", "MONTGOMERY", "486662", "NOT_PF", "", "", "", "", "128"),
+        ( "256", "NIST256", "NIST256", "28", "1", "-10", "NOT_SPECIAL", "0", "WEIERSTRASS", "-3", "NOT_PF", "", "", "", "", "128"),
+        ( "256", "BRAINPOOL", "BRAINPOOL", "28", "1", "-3", "NOT_SPECIAL", "0", "WEIERSTRASS", "-3", "NOT_PF", "", "", "", "", "128"),
+        ( "256", "ANSSI", "ANSSI", "28", "1", "-5", "NOT_SPECIAL", "0", "WEIERSTRASS", "-3", "NOT_PF", "", "", "", "", "128"),
+        ( "336", "HIFIVE", "HIFIVE", "29", "2", "1", "PSEUDO_MERSENNE", "0", "EDWARDS", "1", "NOT_PF", "", "", "", "", "192"),
+        ( "448", "F448", "Ed448", "29", "1", "0", "GENERALISED_MERSENNE", "0", "EDWARDS", "1", "NOT_PF", "", "", "", "", "256"),
+        ( "384", "NIST384", "NIST384", "29", "1", "-12", "NOT_SPECIAL", "0", "WEIERSTRASS", "-3", "NOT_PF", "", "", "", "", "192"),
+        ( "414", "C41417", "C41417", "29", "1", "1", "PSEUDO_MERSENNE", "0", "EDWARDS", "1", "NOT_PF", "", "", "", "", "256"),
+        ( "521", "NIST521", "NIST521", "28", "1", "-4", "PSEUDO_MERSENNE", "0", "WEIERSTRASS", "-3", "NOT_PF", "", "", "", "", "256"),
+        ( "256", "F256PMW", "NUMS256W", "28", "1", "7", "PSEUDO_MERSENNE", "0", "WEIERSTRASS", "-3", "NOT_PF", "", "", "", "", "128"),
+        ( "256", "F256PME", "NUMS256E", "29", "1", "0", "PSEUDO_MERSENNE", "0", "EDWARDS", "1", "NOT_PF", "", "", "", "", "128"),
+        ( "384", "F384PM", "NUMS384W", "29", "1", "-4", "PSEUDO_MERSENNE", "0", "WEIERSTRASS", "-3", "NOT_PF", "", "", "", "", "192"),
+        ( "384", "F384PM", "NUMS384E", "29", "1", "0", "PSEUDO_MERSENNE", "0", "EDWARDS", "1", "NOT_PF", "", "", "", "", "192"),
+        ( "512", "F512PM", "NUMS512W", "29", "1", "-4", "PSEUDO_MERSENNE", "0", "WEIERSTRASS", "-3", "NOT_PF", "", "", "", "", "256"),
+        ( "512", "F512PM", "NUMS512E", "29", "1", "0", "PSEUDO_MERSENNE", "0", "EDWARDS", "1", "NOT_PF", "", "", "", "", "256"),
+        #                                             ,"1", for SVDW
+        # set for SSWU plus isogenies
+        ( "256", "SECP256K1", "SECP256K1", "28", "1",["-11", "3"],"NOT_SPECIAL", "0", "WEIERSTRASS", "0", "NOT_PF", "", "", "", "", "128"),
+        ( "256", "SM2", "SM2", "28", "1", "-9", "NOT_SPECIAL", "0", "WEIERSTRASS", "-3", "NOT_PF", "", "", "", "", "128"),
+        ( "255", "F25519", "C13318", "29", "2", "2", "PSEUDO_MERSENNE", "0", "WEIERSTRASS", "-3", "NOT_PF", "", "", "", "", "128"),
+        ( "255", "JUBJUB", "JUBJUB", "29", "32", "1", "NOT_SPECIAL", "5", "EDWARDS", "-1", "NOT_PF", "", "", "", "", "128"),
+        ( "448", "F448", "X448", "29", "1", "0", "GENERALISED_MERSENNE", "0", "MONTGOMERY", "156326", "NOT_PF", "", "", "", "", "256"),
+        ( "160", "SECP160R1", "SECP160R1", "29", "1", "3", "NOT_SPECIAL", "0", "WEIERSTRASS", "-3", "NOT_PF", "", "", "", "", "128"),
+        ( "251", "C1174", "C1174", "29", "1", "0", "PSEUDO_MERSENNE", "0", "EDWARDS", "1", "NOT_PF", "", "", "", "", "128"),
+        ( "166", "C1665", "C1665", "29", "1", "0", "PSEUDO_MERSENNE", "0", "EDWARDS", "1", "NOT_PF", "", "", "", "", "128"),
+        ( "256", "MDC", "MDC", "28", "1", "0", "NOT_SPECIAL", "0", "EDWARDS", "1", "NOT_PF", "", "", "", "", "128"),
+        ( "255", "TWEEDLEDUM", "TWEEDLEDUM", "29", "33", "1", "NOT_SPECIAL", "5", "WEIERSTRASS", "0", "NOT_PF", "", "", "", "", "128"),
+        ( "255", "TWEEDLEDEE", "TWEEDLEDEE", "29", "34", "1", "NOT_SPECIAL", "5", "WEIERSTRASS", "0", "NOT_PF", "", "", "", "", "128")
+    )
+
+    pf_curves = (
+        ( "254", "BN254", "BN254", "28", "1",["-1", "-1", "0"],"NOT_SPECIAL", "0", "WEIERSTRASS", "0", "BN_CURVE", "D_TYPE", "NEGATIVEX", "71", "66", "128"),
+        ( "254", "BN254CX", "BN254CX", "28", "1",["-1", "-1", "0"],"NOT_SPECIAL", "0", "WEIERSTRASS", "0", "BN_CURVE", "D_TYPE", "NEGATIVEX", "76", "66", "128"),
+        ( "383", "BLS12383", "BLS12383", "29", "1",["1", "1", "0"],"NOT_SPECIAL", "0", "WEIERSTRASS", "0", "BLS12_CURVE", "M_TYPE", "POSITIVEX", "68", "65", "128"),
+        #                                        ["-3" ,"-1", "0"]  for SVDW
+        # set for SSWU plus isogenies
+        ( "381", "BLS12381", "BLS12381", "29", "1",["11", "-2", "-1", "11", "3"],"NOT_SPECIAL", "0", "WEIERSTRASS", "0", "BLS12_CURVE", "M_TYPE", "NEGATIVEX", "69", "65", "128"),
+        ( "256", "FP256BN", "FP256BN", "28", "1",["1", "1", "0"],"NOT_SPECIAL", "0", "WEIERSTRASS", "0", "BN_CURVE", "M_TYPE", "NEGATIVEX", "83", "66", "128"),
+        ( "512", "FP512BN", "FP512BN", "29", "1",["1", "1", "0"],"NOT_SPECIAL", "0", "WEIERSTRASS", "0", "BN_CURVE", "M_TYPE", "POSITIVEX", "172", "130", "128"),
+        ( "443", "BLS12443", "BLS12443", "29", "1",["-7", "1", "1", "11", "3"],"NOT_SPECIAL", "0", "WEIERSTRASS", "0", "BLS12_CURVE", "M_TYPE", "POSITIVEX", "78", "75", "128"),
+        # https://eprint.iacr.org/2017/334.pdf
+        ( "461", "BLS12461", "BLS12461", "28", "1",["1", "4", "0"],"NOT_SPECIAL", "0", "WEIERSTRASS", "0", "BLS12_CURVE", "M_TYPE", "NEGATIVEX", "79", "78", "128"),
+        ( "462", "BN462", "BN462", "28", "1",["1","1","0"],"NOT_SPECIAL", "1", "WEIERSTRASS", "0", "BN_CURVE", "D_TYPE", "POSITIVEX", "125", "118", "128"),
+        ( "479", "BLS24479", "BLS24479", "29", "1",["1", "4", "0"],"NOT_SPECIAL", "0", "WEIERSTRASS", "0", "BLS24_CURVE", "M_TYPE", "POSITIVEX", "52", "49", "192"),
+        ( "556", "BLS48556", "BLS48556", "29", "1",["-1", "2", "0"],"NOT_SPECIAL", "0", "WEIERSTRASS", "0", "BLS48_CURVE", "M_TYPE", "POSITIVEX", "35", "32", "256"),
+        ( "581", "BLS48581", "BLS48581", "29", "1",["2", "2", "0"],"NOT_SPECIAL", "10", "WEIERSTRASS", "0", "BLS48_CURVE", "D_TYPE", "NEGATIVEX", "36", "33", "256"),
+        ( "286", "BLS48286", "BLS48286", "29", "1",["1", "1", "0"],"NOT_SPECIAL", "0", "WEIERSTRASS", "0", "BLS48_CURVE", "M_TYPE", "POSITIVEX", "20", "17", "128"),
+        ( "158", "BN158", "BN158", "28","1",["1", "1", "0"], "NOT_SPECIAL", "0", "WEIERSTRASS", "0","BN_CURVE","M_TYPE","NEGATIVEX","49","42","128")
+    )
+
+    # There are choices here, different ways of getting the same result, but some faster than others
+    rsa_params = (
+        # 256 is slower but may allow reuse of 256-bit BIGs used for elliptic curve
+        # 512 is faster.. but best is 1024
+        #("1024", "RSA2048", "28", "2"),
+        ("512","RSA2048","29","4"),
+        #("256","RSA2048","29","8"),
+        ("384", "RSA3072", "28", "8"),
+        #("256","RSA4096","29","16"),
+        ("512", "RSA4096", "29", "8")
+    )
+
+    total_entries = len(np_curves)+len(pf_curves)+len(rsa_params)
+
+    def valid_query(number):
+        return number >= 0 and number <= miracl_crypto.total_entries
+
+def interactive_prompt_print():
+    index = 1
+    print("Elliptic Curves")
+    for tuple in miracl_crypto.np_curves:
+        print(str(index) + ".", tuple[2])
+        index += 1
+
+    print("\nPairing-Friendly Elliptic Curves")
+    for tuple in miracl_crypto.pf_curves:
+        print(str(index) + ".", tuple[2])
+        index += 1
+
+    print("\nRSA")
+    for tuple in miracl_crypto.rsa_params:
+        print(str(index) + ".", tuple[1])
+        index += 1
+
+def interactive_prompt_exect(index):
+    index -= 1 # Python internally is zero-indexed
+    if index < len(miracl_crypto.np_curves):
+        tuple = miracl_crypto.np_curves[index]
+        curveset(
+            tuple[0], tuple[1], tuple[2], tuple[3], tuple[4],
+            tuple[5], tuple[6], tuple[7], tuple[8], tuple[9],
+            tuple[10], tuple[11], tuple[12],
+            tuple[13], tuple[14], tuple[15]
+        )
+    elif index < len(miracl_crypto.np_curves) + len(miracl_crypto.pf_curves):
+        tuple = miracl_crypto.pf_curves[index-len(miracl_crypto.np_curves)]
+        curveset(
+            tuple[0], tuple[1], tuple[2], tuple[3], tuple[4],
+            tuple[5], tuple[6], tuple[7], tuple[8], tuple[9],
+            tuple[10], tuple[11], tuple[12],
+            tuple[13], tuple[14], tuple[15]
+        )
+    else:
+        tuple = miracl_crypto.rsa_params[index-(len(miracl_crypto.np_curves)+len(miracl_crypto.pf_curves))]
+        rsaset(
+            tuple[0], tuple[1], tuple[2], tuple[3]
+        )
+
+def interactive_prompt_input():
+    while True:
+        userInput = input("\nChoose schemes to support (select 0 to finish): ")
+        try:
+            return int(userInput)
+        except:
+            if (userInput == ''):
+                return 0
+            print("Non-integer input, select values between 1 and " + str(miracl_crypto.total_entries))
+            interactive_prompt_input()
+
+interactive_prompt_print()
+while keep_querying and not testing:
+    query_val = -1
+    while not miracl_crypto.valid_query(query_val):
+        query_val = interactive_prompt_input()
+        if not miracl_crypto.valid_query(query_val):
+            print("Number out of range, select values between 1 and " + str(miracl_crypto.total_entries))
+        elif query_val == 0:
+            keep_querying = False
+        else:
+            interactive_prompt_exect(query_val)
+
+if testing:
+    for i in range(0, miracl_crypto.total_entries):
+        interactive_prompt_exect(i+1)
+
+# create library
+miracl_compile.compile_file(3, "randapi.cpp")
+miracl_compile.compile_file(3, "hash.cpp")
+miracl_compile.compile_file(3, "hmac.cpp")
+miracl_compile.compile_file(3, "rand.cpp")
+miracl_compile.compile_file(3, "oct.cpp")
+miracl_compile.compile_file(3, "share.cpp")
+miracl_compile.compile_file(3, "aes.cpp")
+miracl_compile.compile_file(3, "gcm.cpp")
+miracl_compile.compile_file(3, "newhope.cpp")
+miracl_compile.compile_file(3, "dilithium.cpp")
+miracl_compile.compile_file(3, "kyber.cpp")
+miracl_compile.compile_file(3, "x509.cpp")
+
+if sys.platform.startswith("win") :
+    os.system("for %i in (*.o) do @echo %~nxi >> f.list")
+    os.system("ar rc core.a @f.list")
+    delete_file("f.list")
+else :
+    os.system("ar rc core.a *.o")
+
+if testing :
+    miracl_compile.compile_binary(2, "testecc.cpp", "core.a", "testecc")
+    miracl_compile.compile_binary(2, "testeddsa.cpp", "core.a", "testeddsa")
+    miracl_compile.compile_binary(2, "testmpin.cpp", "core.a", "testmpin")
+    miracl_compile.compile_binary(2, "testbls.cpp", "core.a", "testbls")
+    miracl_compile.compile_binary(2, "benchtest_all.cpp", "core.a", "benchtest_all")
+    miracl_compile.compile_binary(2, "testnhs.cpp", "core.a", "testnhs")
+    miracl_compile.compile_binary(2, "testdlthm.cpp", "core.a", "testdlthm")
+    miracl_compile.compile_binary(2, "testkyber.cpp", "core.a", "testkyber")
+
+#clean up
+for file in generated_files:
+    delete_file(file)
+
+delete_file("*.o")
+delete_file("big.*")
+delete_file("fp.*")
+delete_file("ecp.*")
+delete_file("ecdh.*")
+delete_file("hpke.*")
+delete_file("ff.*")
+delete_file("rsa.*")
+delete_file("config_big.h")
+delete_file("config_field.h")
+delete_file("config_curve.h")
+delete_file("config_ff.h")
+delete_file("fp2.*")
+delete_file("fp4.*")
+delete_file("fp8.*")
+delete_file("fp16.*")
+delete_file("share.cpp")
+delete_file("x509.cpp")
+delete_file("gcm.cpp")
+delete_file("hash.cpp")
+delete_file("hmac.cpp")
+delete_file("aes.cpp")
+delete_file("oct.cpp");
+delete_file("newhope.cpp")
+delete_file("dilithium.cpp")
+delete_file("kyber.cpp")
+delete_file("Doxyfile")
+delete_file("refman.pdf")
+delete_file("readme.md")
+delete_file("rand.cpp")
+delete_file("randapi.cpp")
+delete_file("config*.py")
+
+delete_file("fp12.*")
+delete_file("fp24.*")
+delete_file("fp48.*")
+
+delete_file("ecp2.*")
+delete_file("ecp4.*")
+delete_file("ecp8.*")
+
+delete_file("pair.*")
+delete_file("mpin.*")
+delete_file("bls.*")
+
+delete_file("pair4.*")
+delete_file("mpin192.*")
+delete_file("bls192.*")
+
+delete_file("pair8.*")
+delete_file("mpin256.*")
+delete_file("bls256.*")
+
+delete_file("rom_field*.cpp")
+delete_file("rom_curve*.cpp")
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config64.py b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config64.py
new file mode 100644
index 0000000..b25021b
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config64.py
@@ -0,0 +1,1036 @@
+#!/usr/bin/env python3
+
+#
+# Copyright (c) 2012-2020 MIRACL UK Ltd.
+#
+# This file is part of MIRACL Core
+# (see https://github.com/miracl/core).
+#
+# Licensed under the Apache License, Version 2.0 (the "License");
+# you may not use this file except in compliance with the License.
+# You may obtain a copy of the License at
+#
+#     http://www.apache.org/licenses/LICENSE-2.0
+#
+# Unless required by applicable law or agreed to in writing, software
+# distributed under the License is distributed on an "AS IS" BASIS,
+# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+# See the License for the specific language governing permissions and
+# limitations under the License.
+#
+
+import os
+import sys
+import getopt
+import shutil
+import fnmatch
+
+intr=False
+arg_options=False
+testing=False
+fast_fail=True
+keep_querying=True
+ignore_variables=False
+
+my_compiler = "g++"
+generated_files = []
+
+def copy_keep_file(file, target):
+    shutil.copyfile(file, target)
+
+def copy_temp_file(file, target):
+    shutil.copyfile(file, target)
+    generated_files.append(target)
+
+def delete_file(expression):
+    for root, dirs, files in os.walk(os.path.abspath(os.path.dirname(__file__))):
+        for name in files:
+            if fnmatch.fnmatch(name, expression):
+                os.remove(os.path.join(root, name))
+
+def request_compile(compiler_path, cflags, optim, file, lib, bin):
+    flags = " -std=c++11"
+    if optim != 0:
+        flags += " -O%d" % optim
+    if cflags != None:
+        flags += " %s" % cflags
+    if lib == None and bin == None:
+        flags += " -c %s" % (file)
+    else:
+        if sys.platform.startswith("win"):
+            bin += ".exe"
+        flags += " %s %s -o %s" % (file, lib, bin)
+    print("Processing " + file + "..", end = "", flush=True)
+    if sys.platform.startswith("win") :
+        os.system(compiler_path + flags)
+        print(". [DONE]")
+    else :
+        if os.WEXITSTATUS(os.system(compiler_path + flags)) == 0:
+            print(". [DONE]")
+        elif fast_fail:
+            print("unable to process. Fast-fail enabled, quitting!")
+            sys.exit(1)
+        else:
+            print(". [ERROR]")
+
+class miracl_compile:
+    def compile_file(optim, file):
+        if (os.environ.get('CXX') != None and not ignore_variables):
+            request_compile(os.environ.get('CXX'), os.environ.get('CXXFLAGS'), optim, file, None, None)
+        else:
+            request_compile(my_compiler, None, optim, file, None, None)
+
+    def compile_binary(optim, file, lib, bin):
+        if (os.environ.get('CXX') != None and not ignore_variables):
+            request_compile(os.environ.get('CXX'), os.environ.get('CXXFLAGS'), optim, file, lib, bin)
+        else:
+            request_compile(my_compiler, None, optim, file, lib, bin)
+
+
+def inline_mul1(N,base)  :
+    str=""
+    str+="\tt=(dchunk)a[0]*b[0]; c[0]=(chunk)t & BMASK_XXX; t=t>>BASEBITS_XXX;\n"
+
+    for i in range(1,N) :
+        k=0;
+        str+="\tt=t"
+        while (k<=i) :
+            str+="+(dchunk)a[{}]*b[{}]".format(k,i-k)
+            k+=1
+        str+="; c[{}]=(chunk)t & BMASK_XXX; ".format(i)
+        str+="t=t>>BASEBITS_XXX;\n"
+
+    for i in range(N,2*N-1) :
+        k=i-(N-1)
+        str+="\tt=t"
+        while (k<=N-1) :
+            str+="+(dchunk)a[{}]*b[{}]".format(k,i-k)
+            k+=1
+        str+="; c[{}]=(chunk)t & BMASK_XXX; ".format(i)
+        str+="t=t>>BASEBITS_XXX;\n"
+
+    str+="\tc[{}]=(chunk)t;\n".format(2*N-1)
+
+    return str.replace("XXX",base)
+
+def inline_mul2(N,base)  :
+    str=""
+    for i in range(0,N) :
+        str+="\td[{}]=(dchunk)a[{}]*b[{}];\n".format(i, i, i)
+    str+="\n\ts=d[0];\n\tt = s; c[0]=(chunk)t&BMASK_XXX; co=t>>BASEBITS_XXX;\n"
+    for k in range(1,N) :
+        str+="\ts+=d[{}]; t=co+s ".format(k)
+        for i in range(k,int(k/2),-1) :
+            str+="+(dchunk)(a[{}]-a[{}])*(b[{}]-b[{}])".format(i,k - i, k - i, i)
+        str+="; c[{}]=(chunk)t&BMASK_XXX; co=t>>BASEBITS_XXX; \n".format(k)
+    str+="\n"
+    for k in range(N,2 * N - 1) :
+        str+="\ts-=d[{}]; t=co+s ".format(k - N)
+        for i in range(N-1,int(k/2),-1) :
+            str+="+(dchunk)(a[{}]-a[{}])*(b[{}]-b[{}])".format(i, k - i, k - i, i)
+        str+="; c[{}]=(chunk)t&BMASK_XXX; co=t>>BASEBITS_XXX; \n".format(k)
+
+    str+="\tc[{}]=(chunk)co;\n".format(2 * N - 1)
+    return str.replace("XXX",base)
+
+def inline_sqr(N,base) :
+    str=""
+    str+="\n\tt=(dchunk)a[0]*a[0]; c[0]=(chunk)t&BMASK_XXX; co=t>>BASEBITS_XXX;\n"
+
+    for k in range(1,N) :
+        str+="\tt= "
+        for i in range(k,int(k/2),-1) :
+            str+="+(dchunk)a[{}]*a[{}]".format(i, k - i)
+        str+="; t+=t; t+=co;"
+        if k % 2 == 0 :
+            str+=" t+=(dchunk)a[{}]*a[{}];".format(int(k/2), int(k/2))
+        str+=" c[{}]=(chunk)t&BMASK_XXX; co=t>>BASEBITS_XXX; \n".format(k)
+    str+="\n"
+
+    for k in range(N,2*N-2) :
+        str+="\tt= "
+        for i in range(N-1,int(k/2),-1) :
+            str+="+(dchunk)a[{}]*a[{}]".format(i, k - i)
+        str+="; t+=t; t+=co;"
+        if k % 2 == 0 :
+            str+=" t+=(dchunk)a[{}]*a[{}];".format(int(k/2),int(k/2))
+        str+=" c[{}]=(chunk)t&BMASK_XXX; co=t>>BASEBITS_XXX; \n".format(k)
+
+    str+="\tt=co; t+=(dchunk)a[{}]*a[{}]; c[{}]=(chunk)t&BMASK_XXX; co=t>>BASEBITS_XXX; \n ".format(N-1,N-1,2*N-2)
+
+    str+="\tc[{}]=(chunk)co;\n".format(2 * N - 1)
+    return str.replace("XXX",base)
+
+def inline_redc2(N,base) :
+    str=""
+    str+="\tt=d[0]; v[0]=((chunk)t*MC)&BMASK_XXX; t+=(dchunk)v[0]*md[0];  s=0; c=(t>>BASEBITS_XXX);\n\n"
+
+    for k in range(1,N) :
+        str+="\tt=d[{}]+c+s+(dchunk)v[0]*md[{}]".format(k, k)
+        for i in range(k-1,int(k/2),-1) :
+            str+="+(dchunk)(v[{}]-v[{}])*(md[{}]-md[{}])".format(k - i, i, i, k - i)
+        str+="; v[{}]=((chunk)t*MC)&BMASK_XXX; t+=(dchunk)v[{}]*md[0]; ".format(k, k)
+        str+=" dd[{}]=(dchunk)v[{}]*md[{}]; s+=dd[{}]; c=(t>>BASEBITS_XXX); \n".format(k, k, k, k)
+
+    str+="\n"
+    for k in range(N,2*N-1) :
+        str+="\tt=d[{}]+c+s".format(k)
+        for i in range(N-1,int(k/2),-1) :
+            str+="+(dchunk)(v[{}]-v[{}])*(md[{}]-md[{}])".format(k - i, i, i, k - i)
+        str+="; a[{}]=(chunk)t&BMASK_XXX;  s-=dd[{}]; c=(t>>BASEBITS_XXX); \n".format(k - N, k - N + 1)
+
+    str+="\ta[{}]=d[{}]+((chunk)c&BMASK_XXX);\n".format(N-1,2*N-1)
+    return str.replace("XXX",base)
+
+def inline_redc1(N,base) :
+    str=""
+
+    str+="\tt = d[0];\n"
+    str+="\tv[0] = ((chunk)t * MC)&BMASK_XXX;\n"
+    str+="\tt += (dchunk)v[0] * md[0];\n"
+    str+="\tt = (t >> BASEBITS_XXX) + d[1];\n"
+
+    for i in range(1,N) :
+        k=1
+        str+="\tt += (dchunk)v[0] * md[{}] ".format(i)
+        while k<i :
+            str+="+ (dchunk)v[{}]*md[{}]".format(k,i-k)
+            k+=1
+        str+="; v[{}] = ((chunk)t * MC)&BMASK_XXX; ".format(i)
+        str+="t += (dchunk)v[{}] * md[0]; ".format(i)
+        str+="t = (t >> BASEBITS_XXX) + d[{}];\n".format(i+1)
+
+    for i in range(N,2*N-1) :
+        k=i-(N-1)
+        str+="\tt=t "
+        while k<=N-1 :
+            str+="+ (dchunk)v[{}]*md[{}] ".format(k,i-k)
+            k+=1
+        str+="; a[{}] = (chunk)t & BMASK_XXX; ".format(i-N)
+        str+="t = (t >> BASEBITS_XXX) + d[{}];\n".format(i+1)
+
+    str+="\ta[{}] = (chunk)t & BMASK_XXX;\n".format(N-1)
+    return str.replace("XXX",base)
+
+
+def replace(namefile,oldtext,newtext):
+    f = open(namefile,'r')
+    filedata = f.read()
+    f.close()
+
+    newdata = filedata.replace(oldtext,newtext)
+
+    f = open(namefile,'w')
+    f.write(newdata)
+    f.close()
+
+# rsaset(big,ring,bit_bits_in_base,multiplier)
+# for each choice give distinct names for "big" and "ring".
+# Typically "big" is the length in bits of the underlying big number type
+# "ring" is the RSA modulus size = "big" times 2^m
+# Next give the number base used for 32 bit architectures, as n where the base is 2^n
+# multiplier is 2^m (see above)
+def rsaset(tb,tff,base,ml) :
+
+    itb=int(tb)
+    inb=int(itb/8)
+    nb=str(inb)
+
+    ib=int(base)
+    inb=int(nb)
+
+    nlen=(1+((8*inb-1)//ib))
+
+    bd="B"+tb+"_"+base
+    fnameh="config_big_"+bd+".h"
+    copy_keep_file("config_big.h", fnameh)
+    replace(fnameh,"XXX",bd)
+    replace(fnameh,"@NB@",nb)
+    replace(fnameh,"@BASE@",base)
+
+    fnameh="config_ff_"+tff+".h"
+    copy_keep_file("config_ff.h", fnameh)
+    replace(fnameh,"XXX",bd)
+    replace(fnameh,"WWW",tff)
+    replace(fnameh,"@ML@",ml);
+
+    fnamec="big_"+bd+".cpp"
+    fnameh="big_"+bd+".h"
+
+    copy_temp_file("big.cpp", fnamec)
+    copy_keep_file("big.h", fnameh)
+
+    replace(fnamec,"XXX",bd)
+    replace(fnameh,"XXX",bd)
+
+    replace(fnamec,"INLINE_MUL1",inline_mul1(nlen,bd))
+    replace(fnamec,"INLINE_MUL2",inline_mul2(nlen,bd))
+    replace(fnamec,"INLINE_SQR",inline_sqr(nlen,bd))
+    replace(fnamec,"INLINE_REDC1",inline_redc1(nlen,bd))
+    replace(fnamec,"INLINE_REDC2",inline_redc2(nlen,bd))
+
+    miracl_compile.compile_file(3, fnamec)
+
+    fnamec="ff_"+tff+".cpp"
+    fnameh="ff_"+tff+".h"
+
+    copy_temp_file("ff.cpp", fnamec)
+    copy_keep_file("ff.h", fnameh)
+
+    replace(fnamec,"WWW",tff)
+    replace(fnamec,"XXX",bd)
+    replace(fnameh,"WWW",tff)
+    replace(fnameh,"XXX",bd)
+    miracl_compile.compile_file(3, fnamec)
+
+    fnamec="rsa_"+tff+".cpp"
+    fnameh="rsa_"+tff+".h"
+
+    copy_temp_file("rsa.cpp", fnamec)
+    copy_keep_file("rsa.h", fnameh)
+
+    replace(fnamec,"WWW",tff)
+    replace(fnamec,"XXX",bd)
+    replace(fnameh,"WWW",tff)
+    replace(fnameh,"XXX",bd)
+    miracl_compile.compile_file(3, fnamec)
+
+# curveset(modulus_bits,field,curve,bits_in_base,modulus_mod_8,Z,modulus_type,curve_type,Curve A,pairing_friendly,sextic twist,sign of x,g2_table size,ate bits,curve security)
+# for each curve give names for field and curve. In many cases the latter two will be the same.
+# modulus_bits is the bit length of the modulus, typically the same or slightly smaller than "big"
+# Typically "field" describes the modulus, and "curve" is the common name for the elliptic curve
+# Next give the number base used for 32 bit architecture, as n where the base is 2^n (note that these must be fixed for the same "big" name, if is ever re-used for another curve)
+# m8 max m such that 2^m | modulus-1
+# rz Z value for hash_to_point, If list G1 Z value is in [0], G2 Z value (=a+bz) is in [1], [2]
+# modulus_type is NOT_SPECIAL, or PSEUDO_MERSENNE, or MONTGOMERY_Friendly, or GENERALISED_MERSENNE (supported for Ed448 only)
+# i for Fp2 QNR 2^i+sqrt(-1) (relevant for PFCs only, else =0). Or QNR over Fp if p=1 mod 8
+# curve_type is WEIERSTRASS, EDWARDS or MONTGOMERY
+# Curve A parameter
+# pairing_friendly is BN, BLS or NOT (if not pairing friendly)
+# if pairing friendly. M or D type twist, and sign of the family parameter x
+# g2_table size is number of entries in precomputed table
+# ate bits is number of bits in Ate parameter (from romgen program)
+# curve security is AES equivalent, rounded up.
+
+def curveset(nbt,tf,tc,base,m8,rz,mt,qi,ct,ca,pf,stw,sx,g2,ab,cs) :
+
+    inbt=int(nbt)
+    itb=int(inbt+(8-inbt%8)%8)
+    inb=int(itb/8)
+    tb=str(itb)
+    nb=str(inb)
+
+    bd="B"+tb+"_"+base
+    fnameh="config_big_"+bd+".h"
+    copy_keep_file("config_big.h", fnameh)
+
+    replace(fnameh,"XXX",bd)
+    replace(fnameh,"@NB@",nb)
+    replace(fnameh,"@BASE@",base)
+
+    fnameh="config_field_"+tf+".h"
+    copy_keep_file("config_field.h", fnameh)
+
+    replace(fnameh,"XXX",bd)
+    replace(fnameh,"YYY",tf)
+    replace(fnameh,"@NBT@",nbt)
+    replace(fnameh,"@M8@",m8)
+    replace(fnameh,"@MT@",mt)
+    hc="0"
+    hc2="0"
+# Get Hash-to-Curve Z for G1 and G2
+
+    if isinstance(rz,list) :
+        if len(rz)==2 :     # Z followed by SSWU isogeny degree
+            replace(fnameh,"@RZ@",rz[0])
+            replace(fnameh,"@RZ2A@","0")
+            replace(fnameh,"@RZ2B@","0")
+            hc=rz[1]
+        if len(rz)==3 :     # Z for G1 followed by Z for G2 (for SVDW)
+            replace(fnameh,"@RZ@",rz[0])
+            replace(fnameh,"@RZ2A@",rz[1])
+            replace(fnameh,"@RZ2B@",rz[2])
+        if len(rz)==5 :     # Z for G1, Z for G2, SSWU isogeny degree for G1, SSWU isogeny degree for G2
+            replace(fnameh,"@RZ@",rz[0])
+            replace(fnameh,"@RZ2A@",rz[1])
+            replace(fnameh,"@RZ2B@",rz[2])
+            hc=rz[3]
+            hc2=rz[4]
+    else :
+        replace(fnameh,"@RZ@",rz)   # just Z for SSWU, or indicates RFC7748 or Generic for Elligator
+        replace(fnameh,"@RZ2A@","0")
+        replace(fnameh,"@RZ2B@","0")
+
+    itw=int(qi)%10
+    replace(fnameh,"@QI@",str(itw))
+    if int(qi)//10 > 0 :
+        replace(fnameh,"@TW@","POSITOWER")
+    else :
+        replace(fnameh,"@TW@","NEGATOWER")
+
+    ib=int(base)
+    inb=int(nb)
+    inbt=int(nbt)
+    nlen=(1+((8*inb-1)//ib))
+    sh=ib*nlen-inbt
+
+    if sh > 30 :
+        sh=30
+    replace(fnameh,"@SH@",str(sh))
+
+    fnameh="config_curve_"+tc+".h"
+    copy_keep_file("config_curve.h", fnameh)
+
+    replace(fnameh,"XXX",bd)
+    replace(fnameh,"YYY",tf)
+    replace(fnameh,"ZZZ",tc)
+    replace(fnameh,"@CT@",ct)
+    replace(fnameh,"@CA@",ca)
+    replace(fnameh,"@PF@",pf)
+
+    replace(fnameh,"@ST@",stw)
+    replace(fnameh,"@SX@",sx)
+    replace(fnameh,"@CS@",cs)
+    replace(fnameh,"@AB@",ab)
+    replace(fnameh,"@G2@",g2)
+
+    replace(fnameh,"@HC@",hc)
+    replace(fnameh,"@HC2@",hc2)
+
+    fnamec="big_"+bd+".cpp"
+    fnameh="big_"+bd+".h"
+
+    copy_temp_file("big.cpp", fnamec)
+    copy_keep_file("big.h", fnameh)
+
+    replace(fnamec,"XXX",bd)
+    replace(fnameh,"XXX",bd)
+
+    replace(fnamec,"INLINE_MUL1",inline_mul1(nlen,bd))
+    replace(fnamec,"INLINE_MUL2",inline_mul2(nlen,bd))
+    replace(fnamec,"INLINE_SQR",inline_sqr(nlen,bd))
+    replace(fnamec,"INLINE_REDC1",inline_redc1(nlen,bd))
+    replace(fnamec,"INLINE_REDC2",inline_redc2(nlen,bd))
+
+
+    miracl_compile.compile_file(3, fnamec)
+
+    fnamec="fp_"+tf+".cpp"
+    fnameh="fp_"+tf+".h"
+
+    copy_temp_file("fp.cpp", fnamec)
+    copy_keep_file("fp.h", fnameh)
+
+    replace(fnamec,"YYY",tf)
+    replace(fnamec,"XXX",bd)
+    replace(fnameh,"YYY",tf)
+    replace(fnameh,"XXX",bd)
+    miracl_compile.compile_file(3, fnamec)
+
+    miracl_compile.compile_file(3, "rom_field_"+tf+".cpp");
+
+    fnamec="ecp_"+tc+".cpp"
+    fnameh="ecp_"+tc+".h"
+
+    copy_temp_file("ecp.cpp", fnamec)
+    copy_keep_file("ecp.h", fnameh)
+
+    replace(fnamec,"ZZZ",tc)
+    replace(fnamec,"YYY",tf)
+    replace(fnamec,"XXX",bd)
+    replace(fnameh,"ZZZ",tc)
+    replace(fnameh,"YYY",tf)
+    replace(fnameh,"XXX",bd)
+    miracl_compile.compile_file(3, fnamec)
+
+    fnamec="ecdh_"+tc+".cpp"
+    fnameh="ecdh_"+tc+".h"
+
+    copy_temp_file("ecdh.cpp", fnamec)
+    copy_keep_file("ecdh.h", fnameh)
+
+    replace(fnamec,"ZZZ",tc)
+    replace(fnamec,"YYY",tf)
+    replace(fnamec,"XXX",bd)
+    replace(fnameh,"ZZZ",tc)
+    replace(fnameh,"YYY",tf)
+    replace(fnameh,"XXX",bd)
+    miracl_compile.compile_file(3, fnamec)
+
+    fnamec="eddsa_"+tc+".cpp"
+    fnameh="eddsa_"+tc+".h"
+
+    copy_temp_file("eddsa.cpp", fnamec)
+    copy_keep_file("eddsa.h", fnameh)
+
+    replace(fnamec,"ZZZ",tc)
+    replace(fnamec,"YYY",tf)
+    replace(fnamec,"XXX",bd)
+    replace(fnameh,"ZZZ",tc)
+    replace(fnameh,"YYY",tf)
+    replace(fnameh,"XXX",bd)
+    miracl_compile.compile_file(3, fnamec)
+
+
+    fnamec="hpke_"+tc+".cpp"
+    fnameh="hpke_"+tc+".h"
+
+    copy_temp_file("hpke.cpp", fnamec)
+    copy_keep_file("hpke.h", fnameh)
+
+    replace(fnamec,"ZZZ",tc)
+    replace(fnameh,"ZZZ",tc)
+    miracl_compile.compile_file(3, fnamec)
+
+    miracl_compile.compile_file(3, "rom_curve_"+tc+".cpp");
+
+    if pf != "NOT_PF" :
+        fnamec="fp2_"+tf+".cpp"
+        fnameh="fp2_"+tf+".h"
+
+        copy_temp_file("fp2.cpp", fnamec)
+        copy_keep_file("fp2.h", fnameh)
+        replace(fnamec,"YYY",tf)
+        replace(fnamec,"XXX",bd)
+        replace(fnameh,"YYY",tf)
+        replace(fnameh,"XXX",bd)
+        miracl_compile.compile_file(3, fnamec)
+
+        fnamec="fp4_"+tf+".cpp"
+        fnameh="fp4_"+tf+".h"
+
+        copy_temp_file("fp4.cpp", fnamec)
+        copy_keep_file("fp4.h", fnameh)
+
+        replace(fnamec,"YYY",tf)
+        replace(fnamec,"XXX",bd)
+        replace(fnamec,"ZZZ",tc)
+        replace(fnameh,"YYY",tf)
+        replace(fnameh,"XXX",bd)
+        replace(fnameh,"ZZZ",tc)
+        miracl_compile.compile_file(3, fnamec)
+
+        if pf == "BN_CURVE" or pf == "BLS12_CURVE" :
+            fnamec="fp12_"+tf+".cpp"
+            fnameh="fp12_"+tf+".h"
+
+            copy_temp_file("fp12.cpp", fnamec)
+            copy_keep_file("fp12.h", fnameh)
+
+            replace(fnamec,"YYY",tf)
+            replace(fnamec,"XXX",bd)
+            replace(fnamec,"ZZZ",tc)
+            replace(fnameh,"YYY",tf)
+            replace(fnameh,"XXX",bd)
+            replace(fnameh,"ZZZ",tc)
+            miracl_compile.compile_file(3, fnamec)
+
+            fnamec="ecp2_"+tc+".cpp"
+            fnameh="ecp2_"+tc+".h"
+
+            copy_temp_file("ecp2.cpp", fnamec)
+            copy_keep_file("ecp2.h", fnameh)
+
+            replace(fnamec,"ZZZ",tc)
+            replace(fnamec,"YYY",tf)
+            replace(fnamec,"XXX",bd)
+            replace(fnameh,"ZZZ",tc)
+            replace(fnameh,"YYY",tf)
+            replace(fnameh,"XXX",bd)
+            miracl_compile.compile_file(3, fnamec)
+
+            fnamec="pair_"+tc+".cpp"
+            fnameh="pair_"+tc+".h"
+
+            copy_temp_file("pair.cpp", fnamec)
+            copy_keep_file("pair.h", fnameh)
+
+            replace(fnamec,"ZZZ",tc)
+            replace(fnamec,"YYY",tf)
+            replace(fnamec,"XXX",bd)
+            replace(fnameh,"ZZZ",tc)
+            replace(fnameh,"YYY",tf)
+            replace(fnameh,"XXX",bd)
+            miracl_compile.compile_file(3, fnamec)
+
+            fnamec="mpin_"+tc+".cpp"
+            fnameh="mpin_"+tc+".h"
+
+            copy_temp_file("mpin.cpp", fnamec)
+            copy_keep_file("mpin.h", fnameh)
+
+            replace(fnamec,"ZZZ",tc)
+            replace(fnamec,"YYY",tf)
+            replace(fnamec,"XXX",bd)
+            replace(fnameh,"ZZZ",tc)
+            replace(fnameh,"YYY",tf)
+            replace(fnameh,"XXX",bd)
+            miracl_compile.compile_file(3, fnamec)
+
+            fnamec="bls_"+tc+".cpp"
+            fnameh="bls_"+tc+".h"
+
+            copy_temp_file("bls.cpp", fnamec)
+            copy_keep_file("bls.h", fnameh)
+
+            replace(fnamec,"ZZZ",tc)
+            replace(fnamec,"YYY",tf)
+            replace(fnamec,"XXX",bd)
+            replace(fnameh,"ZZZ",tc)
+            replace(fnameh,"YYY",tf)
+            replace(fnameh,"XXX",bd)
+            miracl_compile.compile_file(3, fnamec)
+
+        if pf == "BLS24_CURVE" :
+            fnamec="fp8_"+tf+".cpp"
+            fnameh="fp8_"+tf+".h"
+
+            copy_temp_file("fp8.cpp", fnamec)
+            copy_keep_file("fp8.h", fnameh)
+
+            replace(fnamec,"YYY",tf)
+            replace(fnamec,"XXX",bd)
+            replace(fnamec,"ZZZ",tc)
+            replace(fnameh,"YYY",tf)
+            replace(fnameh,"XXX",bd)
+            replace(fnameh,"ZZZ",tc)
+            miracl_compile.compile_file(3, fnamec)
+
+
+            fnamec="fp24_"+tf+".cpp"
+            fnameh="fp24_"+tf+".h"
+
+            copy_temp_file("fp24.cpp", fnamec)
+            copy_keep_file("fp24.h", fnameh)
+
+            replace(fnamec,"YYY",tf)
+            replace(fnamec,"XXX",bd)
+            replace(fnamec,"ZZZ",tc)
+            replace(fnameh,"YYY",tf)
+            replace(fnameh,"XXX",bd)
+            replace(fnameh,"ZZZ",tc)
+            miracl_compile.compile_file(3, fnamec)
+
+            fnamec="ecp4_"+tc+".cpp"
+            fnameh="ecp4_"+tc+".h"
+
+            copy_temp_file("ecp4.cpp", fnamec)
+            copy_keep_file("ecp4.h", fnameh)
+
+            replace(fnamec,"ZZZ",tc)
+            replace(fnamec,"YYY",tf)
+            replace(fnamec,"XXX",bd)
+            replace(fnameh,"ZZZ",tc)
+            replace(fnameh,"YYY",tf)
+            replace(fnameh,"XXX",bd)
+            miracl_compile.compile_file(3, fnamec)
+
+            fnamec="pair4_"+tc+".cpp"
+            fnameh="pair4_"+tc+".h"
+
+            copy_temp_file("pair4.cpp", fnamec)
+            copy_keep_file("pair4.h", fnameh)
+
+            replace(fnamec,"ZZZ",tc)
+            replace(fnamec,"YYY",tf)
+            replace(fnamec,"XXX",bd)
+            replace(fnameh,"ZZZ",tc)
+            replace(fnameh,"YYY",tf)
+            replace(fnameh,"XXX",bd)
+            miracl_compile.compile_file(3, fnamec)
+
+            fnamec="mpin192_"+tc+".cpp"
+            fnameh="mpin192_"+tc+".h"
+
+            copy_temp_file("mpin192.cpp", fnamec)
+            copy_keep_file("mpin192.h", fnameh)
+
+            replace(fnamec,"ZZZ",tc)
+            replace(fnamec,"YYY",tf)
+            replace(fnamec,"XXX",bd)
+            replace(fnameh,"ZZZ",tc)
+            replace(fnameh,"YYY",tf)
+            replace(fnameh,"XXX",bd)
+            miracl_compile.compile_file(3, fnamec)
+
+            fnamec="bls192_"+tc+".cpp"
+            fnameh="bls192_"+tc+".h"
+
+            copy_temp_file("bls192.cpp", fnamec)
+            copy_keep_file("bls192.h", fnameh)
+
+            replace(fnamec,"ZZZ",tc)
+            replace(fnamec,"YYY",tf)
+            replace(fnamec,"XXX",bd)
+            replace(fnameh,"ZZZ",tc)
+            replace(fnameh,"YYY",tf)
+            replace(fnameh,"XXX",bd)
+            miracl_compile.compile_file(3, fnamec)
+
+        if pf == "BLS48_CURVE" :
+
+            fnamec="fp8_"+tf+".cpp"
+            fnameh="fp8_"+tf+".h"
+
+            copy_temp_file("fp8.cpp", fnamec)
+            copy_keep_file("fp8.h", fnameh)
+
+            replace(fnamec,"YYY",tf)
+            replace(fnamec,"XXX",bd)
+            replace(fnamec,"ZZZ",tc)
+            replace(fnameh,"YYY",tf)
+            replace(fnameh,"XXX",bd)
+            replace(fnameh,"ZZZ",tc)
+            miracl_compile.compile_file(3, fnamec)
+
+
+            fnamec="ecp8_"+tc+".cpp"
+            fnameh="ecp8_"+tc+".h"
+
+            copy_temp_file("ecp8.cpp", fnamec)
+            copy_keep_file("ecp8.h", fnameh)
+
+            replace(fnamec,"ZZZ",tc)
+            replace(fnamec,"YYY",tf)
+            replace(fnamec,"XXX",bd)
+            replace(fnameh,"ZZZ",tc)
+            replace(fnameh,"YYY",tf)
+            replace(fnameh,"XXX",bd)
+            miracl_compile.compile_file(3, fnamec)
+
+
+            fnamec="fp16_"+tf+".cpp"
+            fnameh="fp16_"+tf+".h"
+
+            copy_temp_file("fp16.cpp", fnamec)
+            copy_keep_file("fp16.h", fnameh)
+
+            replace(fnamec,"YYY",tf)
+            replace(fnamec,"XXX",bd)
+            replace(fnamec,"ZZZ",tc)
+            replace(fnameh,"YYY",tf)
+            replace(fnameh,"XXX",bd)
+            replace(fnameh,"ZZZ",tc)
+            miracl_compile.compile_file(3, fnamec)
+
+
+            fnamec="fp48_"+tf+".cpp"
+            fnameh="fp48_"+tf+".h"
+
+            copy_temp_file("fp48.cpp", fnamec)
+            copy_keep_file("fp48.h", fnameh)
+
+            replace(fnamec,"YYY",tf)
+            replace(fnamec,"XXX",bd)
+            replace(fnamec,"ZZZ",tc)
+            replace(fnameh,"YYY",tf)
+            replace(fnameh,"XXX",bd)
+            replace(fnameh,"ZZZ",tc)
+            miracl_compile.compile_file(3, fnamec)
+
+
+            fnamec="pair8_"+tc+".cpp"
+            fnameh="pair8_"+tc+".h"
+
+            copy_temp_file("pair8.cpp", fnamec)
+            copy_keep_file("pair8.h", fnameh)
+
+            replace(fnamec,"ZZZ",tc)
+            replace(fnamec,"YYY",tf)
+            replace(fnamec,"XXX",bd)
+            replace(fnameh,"ZZZ",tc)
+            replace(fnameh,"YYY",tf)
+            replace(fnameh,"XXX",bd)
+            miracl_compile.compile_file(3, fnamec)
+
+            fnamec="mpin256_"+tc+".cpp"
+            fnameh="mpin256_"+tc+".h"
+
+            copy_temp_file("mpin256.cpp", fnamec)
+            copy_keep_file("mpin256.h", fnameh)
+
+            replace(fnamec,"ZZZ",tc)
+            replace(fnamec,"YYY",tf)
+            replace(fnamec,"XXX",bd)
+            replace(fnameh,"ZZZ",tc)
+            replace(fnameh,"YYY",tf)
+            replace(fnameh,"XXX",bd)
+            miracl_compile.compile_file(3, fnamec)
+
+            fnamec="bls256_"+tc+".cpp"
+            fnameh="bls256_"+tc+".h"
+
+            copy_temp_file("bls256.cpp", fnamec)
+            copy_keep_file("bls256.h", fnameh)
+
+            replace(fnamec,"ZZZ",tc)
+            replace(fnamec,"YYY",tf)
+            replace(fnamec,"XXX",bd)
+            replace(fnameh,"ZZZ",tc)
+            replace(fnameh,"YYY",tf)
+            replace(fnameh,"XXX",bd)
+            miracl_compile.compile_file(3, fnamec)
+
+class miracl_crypto:
+    np_curves = (
+        ( "255", "F25519", "Ed25519", "56", "2", "1", "PSEUDO_MERSENNE", "0", "EDWARDS", "-1", "NOT_PF", "", "", "", "", "128" ),
+        ( "255", "F25519", "C25519", "56", "2", "1", "PSEUDO_MERSENNE", "0", "MONTGOMERY", "486662", "NOT_PF", "", "", "", "", "128" ),
+        ( "256", "NIST256", "NIST256", "56", "1", "-10", "NOT_SPECIAL", "0", "WEIERSTRASS", "-3", "NOT_PF", "", "", "", "", "128" ),
+        ( "256", "BRAINPOOL", "BRAINPOOL", "56", "1", "-3", "NOT_SPECIAL", "0", "WEIERSTRASS", "-3", "NOT_PF", "", "", "", "", "128" ),
+        ( "256", "ANSSI", "ANSSI", "56", "1", "-5", "NOT_SPECIAL", "0", "WEIERSTRASS", "-3", "NOT_PF", "", "", "", "", "128" ),
+        ( "336", "HIFIVE", "HIFIVE", "60", "2", "1", "PSEUDO_MERSENNE", "0", "EDWARDS", "1", "NOT_PF", "", "", "", "", "192" ),
+        ( "448", "F448", "Ed448", "58", "1", "0", "GENERALISED_MERSENNE", "0", "EDWARDS", "1", "NOT_PF", "", "", "", "", "256" ),
+        ( "384", "NIST384", "NIST384", "56", "1", "-12", "NOT_SPECIAL", "0", "WEIERSTRASS", "-3", "NOT_PF", "", "", "", "", "192" ),
+        ( "414", "C41417", "C41417", "60", "1", "1", "PSEUDO_MERSENNE", "0", "EDWARDS", "1", "NOT_PF", "", "", "", "", "256" ),
+        ( "521", "NIST521", "NIST521", "60", "1", "-4", "PSEUDO_MERSENNE", "0", "WEIERSTRASS", "-3", "NOT_PF", "", "", "", "", "256" ),
+        ( "256", "F256PMW", "NUMS256W", "56", "1", "7", "PSEUDO_MERSENNE", "0", "WEIERSTRASS", "-3", "NOT_PF", "", "", "", "", "128" ),
+        ( "256", "F256PME", "NUMS256E", "56", "1", "0", "PSEUDO_MERSENNE", "0", "EDWARDS", "1", "NOT_PF", "", "", "", "", "128" ),
+        ( "384", "F384PM", "NUMS384W", "58", "1", "-4", "PSEUDO_MERSENNE", "0", "WEIERSTRASS", "-3", "NOT_PF", "", "", "", "", "192" ),
+        ( "384", "F384PM", "NUMS384E", "58", "1", "0", "PSEUDO_MERSENNE", "0", "EDWARDS", "1", "NOT_PF", "", "", "", "", "192" ),
+        ( "512", "F512PM", "NUMS512W", "60", "1", "-4", "PSEUDO_MERSENNE", "0", "WEIERSTRASS", "-3", "NOT_PF", "", "", "", "", "256" ),
+        ( "512", "F512PM", "NUMS512E", "60", "1", "0", "PSEUDO_MERSENNE", "0", "EDWARDS", "1", "NOT_PF", "", "", "", "", "256" ),
+        #                                            ,"1", for SVDW
+        # set for SSWU plus isogenies
+        ( "256", "SECP256K1", "SECP256K1", "56", "1",["-11", "3"], "NOT_SPECIAL", "0", "WEIERSTRASS", "0", "NOT_PF", "", "", "", "", "128" ),
+        ( "256", "SM2", "SM2", "56", "1", "-9", "NOT_SPECIAL", "0", "WEIERSTRASS", "-3", "NOT_PF", "", "", "", "", "128" ),
+        ( "255", "F25519", "C13318", "56", "2", "2", "PSEUDO_MERSENNE", "0", "WEIERSTRASS", "-3", "NOT_PF", "", "", "", "", "128" ),
+        ( "255", "JUBJUB", "JUBJUB", "56", "32", "1", "NOT_SPECIAL", "5", "EDWARDS", "-1", "NOT_PF", "", "", "", "", "128" ),
+        ( "448", "F448", "X448", "58", "1", "0", "GENERALISED_MERSENNE", "0", "MONTGOMERY", "156326", "NOT_PF", "", "", "", "", "256" ),
+        ( "160", "SECP160R1", "SECP160R1", "56", "1", "3", "NOT_SPECIAL", "0", "WEIERSTRASS", "-3", "NOT_PF", "", "", "", "", "128" ),
+        ( "251", "C1174", "C1174", "56", "1", "0", "PSEUDO_MERSENNE", "0", "EDWARDS", "1", "NOT_PF", "", "", "", "", "128" ),
+        ( "166", "C1665", "C1665", "60", "1", "0", "PSEUDO_MERSENNE", "0", "EDWARDS", "1", "NOT_PF", "", "", "", "", "128" ),
+        ( "256", "MDC", "MDC", "56", "1", "0", "NOT_SPECIAL", "0", "EDWARDS", "1", "NOT_PF", "", "", "", "", "128" ),
+        ( "255", "TWEEDLEDUM", "TWEEDLEDUM", "56", "33", "1", "NOT_SPECIAL", "5", "WEIERSTRASS", "0", "NOT_PF", "", "", "", "", "128" ),
+        ( "255", "TWEEDLEDEE", "TWEEDLEDEE", "56", "34", "1", "NOT_SPECIAL", "5", "WEIERSTRASS", "0", "NOT_PF", "", "", "", "", "128" )
+    )
+
+    pf_curves = (
+        ( "254", "BN254", "BN254", "56", "1",["-1", "-1", "0"], "NOT_SPECIAL", "0", "WEIERSTRASS", "0", "BN_CURVE", "D_TYPE", "NEGATIVEX", "71", "66", "128" ),
+        ( "254", "BN254CX", "BN254CX", "56", "1",["-1", "-1", "0"], "NOT_SPECIAL", "0", "WEIERSTRASS", "0", "BN_CURVE", "D_TYPE", "NEGATIVEX", "76", "66", "128" ),
+        ( "383", "BLS12383", "BLS12383", "58", "1",["1", "1", "0"], "NOT_SPECIAL", "0", "WEIERSTRASS", "0", "BLS12_CURVE", "M_TYPE", "POSITIVEX", "68", "65", "128" ),
+        #                                           ["-3" ,"-1", "0"]  for SVDW
+        # set for SSWU plus isogenies
+        ( "381", "BLS12381", "BLS12381", "58", "1",["11", "-2", "-1", "11", "3"], "NOT_SPECIAL", "0", "WEIERSTRASS", "0", "BLS12_CURVE", "M_TYPE", "NEGATIVEX", "69", "65", "128" ),
+        ( "256", "FP256BN", "FP256BN", "56", "1",["1", "1", "0"], "NOT_SPECIAL", "0", "WEIERSTRASS", "0", "BN_CURVE", "M_TYPE", "NEGATIVEX", "83", "66", "128" ),
+        ( "512", "FP512BN", "FP512BN", "60", "1",["1", "1", "0"], "NOT_SPECIAL", "0", "WEIERSTRASS", "0", "BN_CURVE", "M_TYPE", "POSITIVEX", "172", "130", "128" ),
+        ( "443", "BLS12443", "BLS12443", "60", "1",["-7", "1", "1", "11", "3"], "NOT_SPECIAL", "0", "WEIERSTRASS", "0", "BLS12_CURVE", "M_TYPE", "POSITIVEX", "78", "75", "128" ),
+        # https://eprint.iacr.org/2017/334.pdf
+        ( "461", "BLS12461", "BLS12461", "60", "1",["1", "4", "0"], "NOT_SPECIAL", "0", "WEIERSTRASS", "0", "BLS12_CURVE", "M_TYPE", "NEGATIVEX", "79", "78", "128" ),
+        ( "462", "BN462", "BN462", "60", "1",["1", "1", "0"], "NOT_SPECIAL", "1", "WEIERSTRASS", "0", "BN_CURVE", "D_TYPE", "POSITIVEX", "125", "118", "128" ),
+        ( "479", "BLS24479", "BLS24479", "56", "1",["1", "4", "0"], "NOT_SPECIAL", "0", "WEIERSTRASS", "0", "BLS24_CURVE", "M_TYPE", "POSITIVEX", "52", "49", "192" ),
+        ( "556", "BLS48556", "BLS48556", "58", "1",["-1", "2", "0"], "NOT_SPECIAL", "0", "WEIERSTRASS", "0", "BLS48_CURVE", "M_TYPE", "POSITIVEX", "35", "32", "256" ),
+        ( "581", "BLS48581", "BLS48581", "60", "1",["2", "2", "0"], "NOT_SPECIAL", "10", "WEIERSTRASS", "0", "BLS48_CURVE", "D_TYPE", "NEGATIVEX", "36", "33", "256" ),
+        ( "286", "BLS48286", "BLS48286", "60", "1",["1", "1", "0"], "NOT_SPECIAL", "0", "WEIERSTRASS", "0", "BLS48_CURVE", "M_TYPE", "POSITIVEX", "20", "17", "128" ),
+        ( "158", "BN158", "BN158", "56","1",["1", "1", "0"], "NOT_SPECIAL", "0", "WEIERSTRASS", "0","BN_CURVE","M_TYPE","NEGATIVEX","49","42","128")
+    )
+
+    # There are choices here, different ways of getting the same result, but some faster than others
+    rsa_params = (
+        # 256 is slower but may allow reuse of 256-bit BIGs used for elliptic curve
+        # 512 is faster.. but best is 1024
+        #("1024", "RSA2048", "58", "2"),
+        ("512", "RSA2048", "60", "4"),
+        #("256", "RSA2048", "56", "8"),
+        ("384", "RSA3072", "56", "8"),
+        #("256", "RSA4096", "56", "16"),
+        ("512", "RSA4096", "60", "8")
+    )
+
+    min_core_library = (
+        "randapi.cpp",
+        "hash.cpp",
+        "hmac.cpp",
+        "rand.cpp",
+        "oct.cpp",
+        "share.cpp",
+        "aes.cpp",
+        "gcm.cpp",
+        "newhope.cpp",
+        "dilithium.cpp",
+        "kyber.cpp",
+        "x509.cpp"
+    )
+
+    total_entries = len(np_curves)+len(pf_curves)+len(rsa_params)
+
+    def valid_query(number):
+        return number >= 0 and number <= miracl_crypto.total_entries
+
+def interactive_prompt_print():
+    index = 1
+    print("Elliptic Curves")
+    for tuple in miracl_crypto.np_curves:
+        print(str(index) + ".", tuple[2])
+        index += 1
+
+    print("\nPairing-Friendly Elliptic Curves")
+    for tuple in miracl_crypto.pf_curves:
+        print(str(index) + ".", tuple[2])
+        index += 1
+
+    print("\nRSA")
+    for tuple in miracl_crypto.rsa_params:
+        print(str(index) + ".", tuple[1])
+        index += 1
+
+def interactive_prompt_exect(index):
+    index -= 1 # Python internally is zero-indexed
+    if index < len(miracl_crypto.np_curves):
+        tuple = miracl_crypto.np_curves[index]
+        curveset(
+            tuple[0], tuple[1], tuple[2], tuple[3], tuple[4],
+            tuple[5], tuple[6], tuple[7], tuple[8], tuple[9],
+            tuple[10], tuple[11], tuple[12],
+            tuple[13], tuple[14], tuple[15]
+        )
+        #curve_selected=True
+    elif index < len(miracl_crypto.np_curves) + len(miracl_crypto.pf_curves):
+        tuple = miracl_crypto.pf_curves[index-len(miracl_crypto.np_curves)]
+        curveset(
+            tuple[0], tuple[1], tuple[2], tuple[3], tuple[4],
+            tuple[5], tuple[6], tuple[7], tuple[8], tuple[9],
+            tuple[10], tuple[11], tuple[12],
+            tuple[13], tuple[14], tuple[15]
+        )
+        #pfcurve_selected=True
+    else:
+        tuple = miracl_crypto.rsa_params[index-(len(miracl_crypto.np_curves)+len(miracl_crypto.pf_curves))]
+        rsaset(
+            tuple[0], tuple[1], tuple[2], tuple[3]
+        )
+        #rsa_selected=True
+
+def interactive_prompt_input():
+    while True:
+        userInput = input("\nChoose schemes to support (select 0 to finish): ")
+        try:
+            return int(userInput)
+        except:
+            if (userInput == ''):
+                return 0
+            print("Non-integer input, select values between 1 and " + str(miracl_crypto.total_entries))
+            interactive_prompt_input()
+
+def usage():
+    print("Usage: ./config64.py [OPTIONS] [ARGUMENTS]\n")
+    print("Option              Long Option              Action")
+    print("   -h, -?           --help                   Shows this message\n")
+    print("Script Behaviour:")
+    print("   -d               --disable-fastfail       Disable script termination if build fails (default: false)")
+    print("   -i               --ignore-environment     Do not read environment variables, rely on shell instead (default: false)\n")
+    print("Build Configuration:")
+    print("   -o               --options=1 --options=64 Disable interactive mode and select specific options")
+    print("   -r               --run-tests              Disable interactive mode, select all options, build and run tests")
+    print("                                             (implies --disable-fastfail, --ignore-environment)\n")
+
+def arg_manager(argv, build_options):
+    global testing, arg_options, fast_fail, intr, ignore_variables
+    # Account for legacy behaviour
+    # Should be removed in future releases
+    if len(argv) == 0:
+        intr = True
+        return False
+    if len(argv) == 1:
+        if (argv[0] == "test"):
+            testing = True
+            return False
+    # Now let's try to actually make sense of arguments
+    try:
+        opts, args = getopt.getopt(
+            argv,
+            "hdiro:",
+            ["help", "disable-fastfail", "ignore-environment", "run-tests", "options="]
+        )
+    except getopt.GetoptError as err:
+        print(err)
+        usage()
+        sys.exit(2)
+
+    for opt, arg in opts:
+        if opt in ['-h', '--help']:
+            usage()
+            sys.exit(0)
+        elif opt in ['-d', '--disable-fastfail']:
+            fast_fail = False
+        elif opt in ['-i', '--ignore-environment']:
+            ignore_variables = True
+        elif opt in ['-r', '--run-tests']:
+            testing = True
+            fast_fail = False
+            ignore_variables = True
+        elif opt in ['-o', '--options']:
+            arg_options = True
+            try:
+                intarg = int(arg)
+                if (intarg <= miracl_crypto.total_entries and intarg > 0):
+                    build_options.append(intarg)
+                else:
+                    raise ValueError("Value too low or too high!")
+            except:
+                print("config64.py: Error! You have passed an invalid option, exiting.")
+                print("             If you are trying to select multiple options, please repeat the flag\n")
+                print("             e.g. ")
+                print("                  ./config64.py -o 1 -o 23 -o 25")
+                sys.exit(1)
+    return len(opts) > 0 and not testing and arg_options
+
+def main(argv):
+    global testing, keep_querying, my_compiler, generated_files, arg_options, intr
+    options_list = []
+
+    replace("arch.h","@WL@","64")
+
+    if not arg_manager(argv, options_list):
+        if intr:
+            if not testing:
+                interactive_prompt_print()
+            while keep_querying and not testing:
+                query_val = -1
+                while not miracl_crypto.valid_query(query_val):
+                    query_val = interactive_prompt_input()
+                    if not miracl_crypto.valid_query(query_val):
+                        print("Number out of range, select values between 1 and " + str(miracl_crypto.total_entries))
+                    elif query_val == 0:
+                        keep_querying = False
+                    else:
+                        interactive_prompt_exect(query_val)
+        elif not arg_options and not testing:
+            print("config64.py: Invalid input, program terminating")
+            sys.exit(2)
+    else:
+        for i in options_list:
+            interactive_prompt_exect(i)
+
+    if testing:
+        for i in range(0, miracl_crypto.total_entries):
+            interactive_prompt_exect(i+1)
+
+    # create library
+    for f in miracl_crypto.min_core_library:
+        miracl_compile.compile_file(3, f)
+
+    if sys.platform.startswith("win") :
+        os.system("for %i in (*.o) do @echo %~nxi >> f.list")
+        os.system("ar rc core.a @f.list")
+        delete_file("f.list")
+    else :
+        os.system("ar rc core.a *.o")
+
+    if testing :
+        miracl_compile.compile_binary(2, "testecc.cpp", "core.a", "testecc")
+        miracl_compile.compile_binary(2, "testeddsa.cpp", "core.a", "testeddsa")
+        miracl_compile.compile_binary(2, "testmpin.cpp", "core.a", "testmpin")
+        miracl_compile.compile_binary(2, "testbls.cpp", "core.a", "testbls")
+        miracl_compile.compile_binary(2, "benchtest_all.cpp", "core.a", "benchtest_all")
+        miracl_compile.compile_binary(2, "testnhs.cpp", "core.a", "testnhs")
+        miracl_compile.compile_binary(2, "testdlthm.cpp", "core.a", "testdlthm")
+        miracl_compile.compile_binary(2, "testkyber.cpp", "core.a", "testkyber")
+
+    #clean up
+    for file in generated_files:
+        delete_file(file)
+    delete_file("*.o")
+    sys.exit(0)
+
+if __name__ == "__main__":
+    main(sys.argv[1:])
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_big.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_big.h
new file mode 100644
index 0000000..ce262ec
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_big.h
@@ -0,0 +1,31 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_BIG_XXX_H
+#define CONFIG_BIG_XXX_H
+
+#include"core.h"
+
+// BIG stuff
+
+#define MODBYTES_XXX @NB@
+#define BASEBITS_XXX @BASE@
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_big_B160_56.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_big_B160_56.h
new file mode 100644
index 0000000..e07a289
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_big_B160_56.h
@@ -0,0 +1,31 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_BIG_B160_56_H
+#define CONFIG_BIG_B160_56_H
+
+#include"core.h"
+
+// BIG stuff
+
+#define MODBYTES_B160_56 20
+#define BASEBITS_B160_56 56
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_big_B168_60.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_big_B168_60.h
new file mode 100644
index 0000000..5180f26
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_big_B168_60.h
@@ -0,0 +1,31 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_BIG_B168_60_H
+#define CONFIG_BIG_B168_60_H
+
+#include"core.h"
+
+// BIG stuff
+
+#define MODBYTES_B168_60 21
+#define BASEBITS_B168_60 60
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_big_B256_56.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_big_B256_56.h
new file mode 100644
index 0000000..0cb6488
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_big_B256_56.h
@@ -0,0 +1,31 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_BIG_B256_56_H
+#define CONFIG_BIG_B256_56_H
+
+#include"core.h"
+
+// BIG stuff
+
+#define MODBYTES_B256_56 32
+#define BASEBITS_B256_56 56
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_big_B288_60.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_big_B288_60.h
new file mode 100644
index 0000000..7aa116a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_big_B288_60.h
@@ -0,0 +1,31 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_BIG_B288_60_H
+#define CONFIG_BIG_B288_60_H
+
+#include"core.h"
+
+// BIG stuff
+
+#define MODBYTES_B288_60 36
+#define BASEBITS_B288_60 60
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_big_B336_60.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_big_B336_60.h
new file mode 100644
index 0000000..5cdd05d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_big_B336_60.h
@@ -0,0 +1,31 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_BIG_B336_60_H
+#define CONFIG_BIG_B336_60_H
+
+#include"core.h"
+
+// BIG stuff
+
+#define MODBYTES_B336_60 42
+#define BASEBITS_B336_60 60
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_big_B384_56.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_big_B384_56.h
new file mode 100644
index 0000000..acfb14f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_big_B384_56.h
@@ -0,0 +1,31 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_BIG_B384_56_H
+#define CONFIG_BIG_B384_56_H
+
+#include"core.h"
+
+// BIG stuff
+
+#define MODBYTES_B384_56 48
+#define BASEBITS_B384_56 56
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_big_B384_58.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_big_B384_58.h
new file mode 100644
index 0000000..0d9dce8
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_big_B384_58.h
@@ -0,0 +1,31 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_BIG_B384_58_H
+#define CONFIG_BIG_B384_58_H
+
+#include"core.h"
+
+// BIG stuff
+
+#define MODBYTES_B384_58 48
+#define BASEBITS_B384_58 58
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_big_B416_60.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_big_B416_60.h
new file mode 100644
index 0000000..8aaab21
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_big_B416_60.h
@@ -0,0 +1,31 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_BIG_B416_60_H
+#define CONFIG_BIG_B416_60_H
+
+#include"core.h"
+
+// BIG stuff
+
+#define MODBYTES_B416_60 52
+#define BASEBITS_B416_60 60
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_big_B448_58.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_big_B448_58.h
new file mode 100644
index 0000000..83fff6c
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_big_B448_58.h
@@ -0,0 +1,31 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_BIG_B448_58_H
+#define CONFIG_BIG_B448_58_H
+
+#include"core.h"
+
+// BIG stuff
+
+#define MODBYTES_B448_58 56
+#define BASEBITS_B448_58 58
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_big_B448_60.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_big_B448_60.h
new file mode 100644
index 0000000..c031342
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_big_B448_60.h
@@ -0,0 +1,31 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_BIG_B448_60_H
+#define CONFIG_BIG_B448_60_H
+
+#include"core.h"
+
+// BIG stuff
+
+#define MODBYTES_B448_60 56
+#define BASEBITS_B448_60 60
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_big_B464_60.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_big_B464_60.h
new file mode 100644
index 0000000..cc0daa5
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_big_B464_60.h
@@ -0,0 +1,31 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_BIG_B464_60_H
+#define CONFIG_BIG_B464_60_H
+
+#include"core.h"
+
+// BIG stuff
+
+#define MODBYTES_B464_60 58
+#define BASEBITS_B464_60 60
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_big_B480_56.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_big_B480_56.h
new file mode 100644
index 0000000..1b0f11f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_big_B480_56.h
@@ -0,0 +1,31 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_BIG_B480_56_H
+#define CONFIG_BIG_B480_56_H
+
+#include"core.h"
+
+// BIG stuff
+
+#define MODBYTES_B480_56 60
+#define BASEBITS_B480_56 56
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_big_B512_60.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_big_B512_60.h
new file mode 100644
index 0000000..e2dce43
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_big_B512_60.h
@@ -0,0 +1,31 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_BIG_B512_60_H
+#define CONFIG_BIG_B512_60_H
+
+#include"core.h"
+
+// BIG stuff
+
+#define MODBYTES_B512_60 64
+#define BASEBITS_B512_60 60
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_big_B528_60.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_big_B528_60.h
new file mode 100644
index 0000000..fa3c8dc
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_big_B528_60.h
@@ -0,0 +1,31 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_BIG_B528_60_H
+#define CONFIG_BIG_B528_60_H
+
+#include"core.h"
+
+// BIG stuff
+
+#define MODBYTES_B528_60 66
+#define BASEBITS_B528_60 60
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_big_B560_58.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_big_B560_58.h
new file mode 100644
index 0000000..c2f9f59
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_big_B560_58.h
@@ -0,0 +1,31 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_BIG_B560_58_H
+#define CONFIG_BIG_B560_58_H
+
+#include"core.h"
+
+// BIG stuff
+
+#define MODBYTES_B560_58 70
+#define BASEBITS_B560_58 58
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_big_B584_60.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_big_B584_60.h
new file mode 100644
index 0000000..733d55e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_big_B584_60.h
@@ -0,0 +1,31 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_BIG_B584_60_H
+#define CONFIG_BIG_B584_60_H
+
+#include"core.h"
+
+// BIG stuff
+
+#define MODBYTES_B584_60 73
+#define BASEBITS_B584_60 60
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve.h
new file mode 100644
index 0000000..d7858d8
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_ZZZ_H
+#define CONFIG_CURVE_ZZZ_H
+
+#include"core.h"
+#include"config_field_YYY.h"
+
+// ECP stuff
+
+#define CURVETYPE_ZZZ @CT@
+#define CURVE_A_ZZZ @CA@
+#define PAIRING_FRIENDLY_ZZZ @PF@
+#define CURVE_SECURITY_ZZZ @CS@
+#define HTC_ISO_ZZZ @HC@
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_ZZZ
+
+#if PAIRING_FRIENDLY_ZZZ != NOT_PF
+
+#define HTC_ISO_G2_ZZZ @HC2@
+
+#define USE_GLV_ZZZ   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_ZZZ /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_ZZZ /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_ZZZ @ST@
+#define SIGN_OF_X_ZZZ @SX@
+
+#define ATE_BITS_ZZZ @AB@
+#define G2_TABLE_ZZZ @G2@
+
+#endif
+
+
+#if CURVE_SECURITY_ZZZ == 128
+#define AESKEY_ZZZ 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_ZZZ SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_ZZZ == 192
+#define AESKEY_ZZZ 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_ZZZ SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_ZZZ == 256
+#define AESKEY_ZZZ 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_ZZZ SHA512  /**< Hash type */
+#endif
+
+
+namespace ZZZ_BIG = XXX;
+namespace ZZZ_FP = YYY;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_ANSSI.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_ANSSI.h
new file mode 100644
index 0000000..9b5648f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_ANSSI.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_ANSSI_H
+#define CONFIG_CURVE_ANSSI_H
+
+#include"core.h"
+#include"config_field_ANSSI.h"
+
+// ECP stuff
+
+#define CURVETYPE_ANSSI WEIERSTRASS
+#define CURVE_A_ANSSI -3
+#define PAIRING_FRIENDLY_ANSSI NOT_PF
+#define CURVE_SECURITY_ANSSI 128
+#define HTC_ISO_ANSSI 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_ANSSI
+
+#if PAIRING_FRIENDLY_ANSSI != NOT_PF
+
+#define HTC_ISO_G2_ANSSI 0
+
+#define USE_GLV_ANSSI   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_ANSSI /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_ANSSI /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_ANSSI 
+#define SIGN_OF_X_ANSSI 
+
+#define ATE_BITS_ANSSI 
+#define G2_TABLE_ANSSI 
+
+#endif
+
+
+#if CURVE_SECURITY_ANSSI == 128
+#define AESKEY_ANSSI 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_ANSSI SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_ANSSI == 192
+#define AESKEY_ANSSI 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_ANSSI SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_ANSSI == 256
+#define AESKEY_ANSSI 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_ANSSI SHA512  /**< Hash type */
+#endif
+
+
+namespace ANSSI_BIG = B256_56;
+namespace ANSSI_FP = ANSSI;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_BLS12381.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_BLS12381.h
new file mode 100644
index 0000000..14993f8
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_BLS12381.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_BLS12381_H
+#define CONFIG_CURVE_BLS12381_H
+
+#include"core.h"
+#include"config_field_BLS12381.h"
+
+// ECP stuff
+
+#define CURVETYPE_BLS12381 WEIERSTRASS
+#define CURVE_A_BLS12381 0
+#define PAIRING_FRIENDLY_BLS12381 BLS12_CURVE
+#define CURVE_SECURITY_BLS12381 128
+#define HTC_ISO_BLS12381 11
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_BLS12381
+
+#if PAIRING_FRIENDLY_BLS12381 != NOT_PF
+
+#define HTC_ISO_G2_BLS12381 3
+
+#define USE_GLV_BLS12381   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_BLS12381 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_BLS12381 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_BLS12381 M_TYPE
+#define SIGN_OF_X_BLS12381 NEGATIVEX
+
+#define ATE_BITS_BLS12381 65
+#define G2_TABLE_BLS12381 69
+
+#endif
+
+
+#if CURVE_SECURITY_BLS12381 == 128
+#define AESKEY_BLS12381 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_BLS12381 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BLS12381 == 192
+#define AESKEY_BLS12381 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_BLS12381 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BLS12381 == 256
+#define AESKEY_BLS12381 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_BLS12381 SHA512  /**< Hash type */
+#endif
+
+
+namespace BLS12381_BIG = B384_58;
+namespace BLS12381_FP = BLS12381;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_BLS12383.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_BLS12383.h
new file mode 100644
index 0000000..9c50bfc
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_BLS12383.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_BLS12383_H
+#define CONFIG_CURVE_BLS12383_H
+
+#include"core.h"
+#include"config_field_BLS12383.h"
+
+// ECP stuff
+
+#define CURVETYPE_BLS12383 WEIERSTRASS
+#define CURVE_A_BLS12383 0
+#define PAIRING_FRIENDLY_BLS12383 BLS12_CURVE
+#define CURVE_SECURITY_BLS12383 128
+#define HTC_ISO_BLS12383 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_BLS12383
+
+#if PAIRING_FRIENDLY_BLS12383 != NOT_PF
+
+#define HTC_ISO_G2_BLS12383 0
+
+#define USE_GLV_BLS12383   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_BLS12383 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_BLS12383 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_BLS12383 M_TYPE
+#define SIGN_OF_X_BLS12383 POSITIVEX
+
+#define ATE_BITS_BLS12383 65
+#define G2_TABLE_BLS12383 68
+
+#endif
+
+
+#if CURVE_SECURITY_BLS12383 == 128
+#define AESKEY_BLS12383 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_BLS12383 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BLS12383 == 192
+#define AESKEY_BLS12383 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_BLS12383 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BLS12383 == 256
+#define AESKEY_BLS12383 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_BLS12383 SHA512  /**< Hash type */
+#endif
+
+
+namespace BLS12383_BIG = B384_58;
+namespace BLS12383_FP = BLS12383;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_BLS12443.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_BLS12443.h
new file mode 100644
index 0000000..087b02f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_BLS12443.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_BLS12443_H
+#define CONFIG_CURVE_BLS12443_H
+
+#include"core.h"
+#include"config_field_BLS12443.h"
+
+// ECP stuff
+
+#define CURVETYPE_BLS12443 WEIERSTRASS
+#define CURVE_A_BLS12443 0
+#define PAIRING_FRIENDLY_BLS12443 BLS12_CURVE
+#define CURVE_SECURITY_BLS12443 128
+#define HTC_ISO_BLS12443 11
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_BLS12443
+
+#if PAIRING_FRIENDLY_BLS12443 != NOT_PF
+
+#define HTC_ISO_G2_BLS12443 3
+
+#define USE_GLV_BLS12443   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_BLS12443 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_BLS12443 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_BLS12443 M_TYPE
+#define SIGN_OF_X_BLS12443 POSITIVEX
+
+#define ATE_BITS_BLS12443 75
+#define G2_TABLE_BLS12443 78
+
+#endif
+
+
+#if CURVE_SECURITY_BLS12443 == 128
+#define AESKEY_BLS12443 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_BLS12443 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BLS12443 == 192
+#define AESKEY_BLS12443 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_BLS12443 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BLS12443 == 256
+#define AESKEY_BLS12443 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_BLS12443 SHA512  /**< Hash type */
+#endif
+
+
+namespace BLS12443_BIG = B448_60;
+namespace BLS12443_FP = BLS12443;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_BLS12461.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_BLS12461.h
new file mode 100644
index 0000000..1648b99
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_BLS12461.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_BLS12461_H
+#define CONFIG_CURVE_BLS12461_H
+
+#include"core.h"
+#include"config_field_BLS12461.h"
+
+// ECP stuff
+
+#define CURVETYPE_BLS12461 WEIERSTRASS
+#define CURVE_A_BLS12461 0
+#define PAIRING_FRIENDLY_BLS12461 BLS12_CURVE
+#define CURVE_SECURITY_BLS12461 128
+#define HTC_ISO_BLS12461 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_BLS12461
+
+#if PAIRING_FRIENDLY_BLS12461 != NOT_PF
+
+#define HTC_ISO_G2_BLS12461 0
+
+#define USE_GLV_BLS12461   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_BLS12461 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_BLS12461 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_BLS12461 M_TYPE
+#define SIGN_OF_X_BLS12461 NEGATIVEX
+
+#define ATE_BITS_BLS12461 78
+#define G2_TABLE_BLS12461 79
+
+#endif
+
+
+#if CURVE_SECURITY_BLS12461 == 128
+#define AESKEY_BLS12461 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_BLS12461 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BLS12461 == 192
+#define AESKEY_BLS12461 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_BLS12461 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BLS12461 == 256
+#define AESKEY_BLS12461 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_BLS12461 SHA512  /**< Hash type */
+#endif
+
+
+namespace BLS12461_BIG = B464_60;
+namespace BLS12461_FP = BLS12461;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_BLS24479.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_BLS24479.h
new file mode 100644
index 0000000..1c1735b
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_BLS24479.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_BLS24479_H
+#define CONFIG_CURVE_BLS24479_H
+
+#include"core.h"
+#include"config_field_BLS24479.h"
+
+// ECP stuff
+
+#define CURVETYPE_BLS24479 WEIERSTRASS
+#define CURVE_A_BLS24479 0
+#define PAIRING_FRIENDLY_BLS24479 BLS24_CURVE
+#define CURVE_SECURITY_BLS24479 192
+#define HTC_ISO_BLS24479 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_BLS24479
+
+#if PAIRING_FRIENDLY_BLS24479 != NOT_PF
+
+#define HTC_ISO_G2_BLS24479 0
+
+#define USE_GLV_BLS24479   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_BLS24479 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_BLS24479 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_BLS24479 M_TYPE
+#define SIGN_OF_X_BLS24479 POSITIVEX
+
+#define ATE_BITS_BLS24479 49
+#define G2_TABLE_BLS24479 52
+
+#endif
+
+
+#if CURVE_SECURITY_BLS24479 == 128
+#define AESKEY_BLS24479 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_BLS24479 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BLS24479 == 192
+#define AESKEY_BLS24479 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_BLS24479 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BLS24479 == 256
+#define AESKEY_BLS24479 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_BLS24479 SHA512  /**< Hash type */
+#endif
+
+
+namespace BLS24479_BIG = B480_56;
+namespace BLS24479_FP = BLS24479;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_BLS48286.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_BLS48286.h
new file mode 100644
index 0000000..792c00e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_BLS48286.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_BLS48286_H
+#define CONFIG_CURVE_BLS48286_H
+
+#include"core.h"
+#include"config_field_BLS48286.h"
+
+// ECP stuff
+
+#define CURVETYPE_BLS48286 WEIERSTRASS
+#define CURVE_A_BLS48286 0
+#define PAIRING_FRIENDLY_BLS48286 BLS48_CURVE
+#define CURVE_SECURITY_BLS48286 128
+#define HTC_ISO_BLS48286 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_BLS48286
+
+#if PAIRING_FRIENDLY_BLS48286 != NOT_PF
+
+#define HTC_ISO_G2_BLS48286 0
+
+#define USE_GLV_BLS48286   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_BLS48286 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_BLS48286 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_BLS48286 M_TYPE
+#define SIGN_OF_X_BLS48286 POSITIVEX
+
+#define ATE_BITS_BLS48286 17
+#define G2_TABLE_BLS48286 20
+
+#endif
+
+
+#if CURVE_SECURITY_BLS48286 == 128
+#define AESKEY_BLS48286 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_BLS48286 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BLS48286 == 192
+#define AESKEY_BLS48286 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_BLS48286 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BLS48286 == 256
+#define AESKEY_BLS48286 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_BLS48286 SHA512  /**< Hash type */
+#endif
+
+
+namespace BLS48286_BIG = B288_60;
+namespace BLS48286_FP = BLS48286;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_BLS48556.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_BLS48556.h
new file mode 100644
index 0000000..dd20b2a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_BLS48556.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_BLS48556_H
+#define CONFIG_CURVE_BLS48556_H
+
+#include"core.h"
+#include"config_field_BLS48556.h"
+
+// ECP stuff
+
+#define CURVETYPE_BLS48556 WEIERSTRASS
+#define CURVE_A_BLS48556 0
+#define PAIRING_FRIENDLY_BLS48556 BLS48_CURVE
+#define CURVE_SECURITY_BLS48556 256
+#define HTC_ISO_BLS48556 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_BLS48556
+
+#if PAIRING_FRIENDLY_BLS48556 != NOT_PF
+
+#define HTC_ISO_G2_BLS48556 0
+
+#define USE_GLV_BLS48556   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_BLS48556 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_BLS48556 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_BLS48556 M_TYPE
+#define SIGN_OF_X_BLS48556 POSITIVEX
+
+#define ATE_BITS_BLS48556 32
+#define G2_TABLE_BLS48556 35
+
+#endif
+
+
+#if CURVE_SECURITY_BLS48556 == 128
+#define AESKEY_BLS48556 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_BLS48556 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BLS48556 == 192
+#define AESKEY_BLS48556 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_BLS48556 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BLS48556 == 256
+#define AESKEY_BLS48556 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_BLS48556 SHA512  /**< Hash type */
+#endif
+
+
+namespace BLS48556_BIG = B560_58;
+namespace BLS48556_FP = BLS48556;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_BLS48581.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_BLS48581.h
new file mode 100644
index 0000000..fe21b47
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_BLS48581.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_BLS48581_H
+#define CONFIG_CURVE_BLS48581_H
+
+#include"core.h"
+#include"config_field_BLS48581.h"
+
+// ECP stuff
+
+#define CURVETYPE_BLS48581 WEIERSTRASS
+#define CURVE_A_BLS48581 0
+#define PAIRING_FRIENDLY_BLS48581 BLS48_CURVE
+#define CURVE_SECURITY_BLS48581 256
+#define HTC_ISO_BLS48581 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_BLS48581
+
+#if PAIRING_FRIENDLY_BLS48581 != NOT_PF
+
+#define HTC_ISO_G2_BLS48581 0
+
+#define USE_GLV_BLS48581   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_BLS48581 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_BLS48581 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_BLS48581 D_TYPE
+#define SIGN_OF_X_BLS48581 NEGATIVEX
+
+#define ATE_BITS_BLS48581 33
+#define G2_TABLE_BLS48581 36
+
+#endif
+
+
+#if CURVE_SECURITY_BLS48581 == 128
+#define AESKEY_BLS48581 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_BLS48581 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BLS48581 == 192
+#define AESKEY_BLS48581 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_BLS48581 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BLS48581 == 256
+#define AESKEY_BLS48581 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_BLS48581 SHA512  /**< Hash type */
+#endif
+
+
+namespace BLS48581_BIG = B584_60;
+namespace BLS48581_FP = BLS48581;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_BN158.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_BN158.h
new file mode 100644
index 0000000..821f6ac
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_BN158.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_BN158_H
+#define CONFIG_CURVE_BN158_H
+
+#include"core.h"
+#include"config_field_BN158.h"
+
+// ECP stuff
+
+#define CURVETYPE_BN158 WEIERSTRASS
+#define CURVE_A_BN158 0
+#define PAIRING_FRIENDLY_BN158 BN_CURVE
+#define CURVE_SECURITY_BN158 128
+#define HTC_ISO_BN158 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_BN158
+
+#if PAIRING_FRIENDLY_BN158 != NOT_PF
+
+#define HTC_ISO_G2_BN158 0
+
+#define USE_GLV_BN158   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_BN158 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_BN158 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_BN158 M_TYPE
+#define SIGN_OF_X_BN158 NEGATIVEX
+
+#define ATE_BITS_BN158 42
+#define G2_TABLE_BN158 49
+
+#endif
+
+
+#if CURVE_SECURITY_BN158 == 128
+#define AESKEY_BN158 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_BN158 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BN158 == 192
+#define AESKEY_BN158 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_BN158 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BN158 == 256
+#define AESKEY_BN158 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_BN158 SHA512  /**< Hash type */
+#endif
+
+
+namespace BN158_BIG = B160_56;
+namespace BN158_FP = BN158;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_BN254.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_BN254.h
new file mode 100644
index 0000000..f1bef15
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_BN254.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_BN254_H
+#define CONFIG_CURVE_BN254_H
+
+#include"core.h"
+#include"config_field_BN254.h"
+
+// ECP stuff
+
+#define CURVETYPE_BN254 WEIERSTRASS
+#define CURVE_A_BN254 0
+#define PAIRING_FRIENDLY_BN254 BN_CURVE
+#define CURVE_SECURITY_BN254 128
+#define HTC_ISO_BN254 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_BN254
+
+#if PAIRING_FRIENDLY_BN254 != NOT_PF
+
+#define HTC_ISO_G2_BN254 0
+
+#define USE_GLV_BN254   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_BN254 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_BN254 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_BN254 D_TYPE
+#define SIGN_OF_X_BN254 NEGATIVEX
+
+#define ATE_BITS_BN254 66
+#define G2_TABLE_BN254 71
+
+#endif
+
+
+#if CURVE_SECURITY_BN254 == 128
+#define AESKEY_BN254 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_BN254 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BN254 == 192
+#define AESKEY_BN254 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_BN254 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BN254 == 256
+#define AESKEY_BN254 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_BN254 SHA512  /**< Hash type */
+#endif
+
+
+namespace BN254_BIG = B256_56;
+namespace BN254_FP = BN254;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_BN254CX.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_BN254CX.h
new file mode 100644
index 0000000..f446cac
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_BN254CX.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_BN254CX_H
+#define CONFIG_CURVE_BN254CX_H
+
+#include"core.h"
+#include"config_field_BN254CX.h"
+
+// ECP stuff
+
+#define CURVETYPE_BN254CX WEIERSTRASS
+#define CURVE_A_BN254CX 0
+#define PAIRING_FRIENDLY_BN254CX BN_CURVE
+#define CURVE_SECURITY_BN254CX 128
+#define HTC_ISO_BN254CX 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_BN254CX
+
+#if PAIRING_FRIENDLY_BN254CX != NOT_PF
+
+#define HTC_ISO_G2_BN254CX 0
+
+#define USE_GLV_BN254CX   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_BN254CX /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_BN254CX /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_BN254CX D_TYPE
+#define SIGN_OF_X_BN254CX NEGATIVEX
+
+#define ATE_BITS_BN254CX 66
+#define G2_TABLE_BN254CX 76
+
+#endif
+
+
+#if CURVE_SECURITY_BN254CX == 128
+#define AESKEY_BN254CX 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_BN254CX SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BN254CX == 192
+#define AESKEY_BN254CX 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_BN254CX SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BN254CX == 256
+#define AESKEY_BN254CX 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_BN254CX SHA512  /**< Hash type */
+#endif
+
+
+namespace BN254CX_BIG = B256_56;
+namespace BN254CX_FP = BN254CX;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_BN462.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_BN462.h
new file mode 100644
index 0000000..51b4309
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_BN462.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_BN462_H
+#define CONFIG_CURVE_BN462_H
+
+#include"core.h"
+#include"config_field_BN462.h"
+
+// ECP stuff
+
+#define CURVETYPE_BN462 WEIERSTRASS
+#define CURVE_A_BN462 0
+#define PAIRING_FRIENDLY_BN462 BN_CURVE
+#define CURVE_SECURITY_BN462 128
+#define HTC_ISO_BN462 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_BN462
+
+#if PAIRING_FRIENDLY_BN462 != NOT_PF
+
+#define HTC_ISO_G2_BN462 0
+
+#define USE_GLV_BN462   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_BN462 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_BN462 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_BN462 D_TYPE
+#define SIGN_OF_X_BN462 POSITIVEX
+
+#define ATE_BITS_BN462 118
+#define G2_TABLE_BN462 125
+
+#endif
+
+
+#if CURVE_SECURITY_BN462 == 128
+#define AESKEY_BN462 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_BN462 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BN462 == 192
+#define AESKEY_BN462 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_BN462 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BN462 == 256
+#define AESKEY_BN462 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_BN462 SHA512  /**< Hash type */
+#endif
+
+
+namespace BN462_BIG = B464_60;
+namespace BN462_FP = BN462;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_BRAINPOOL.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_BRAINPOOL.h
new file mode 100644
index 0000000..29cd927
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_BRAINPOOL.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_BRAINPOOL_H
+#define CONFIG_CURVE_BRAINPOOL_H
+
+#include"core.h"
+#include"config_field_BRAINPOOL.h"
+
+// ECP stuff
+
+#define CURVETYPE_BRAINPOOL WEIERSTRASS
+#define CURVE_A_BRAINPOOL -3
+#define PAIRING_FRIENDLY_BRAINPOOL NOT_PF
+#define CURVE_SECURITY_BRAINPOOL 128
+#define HTC_ISO_BRAINPOOL 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_BRAINPOOL
+
+#if PAIRING_FRIENDLY_BRAINPOOL != NOT_PF
+
+#define HTC_ISO_G2_BRAINPOOL 0
+
+#define USE_GLV_BRAINPOOL   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_BRAINPOOL /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_BRAINPOOL /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_BRAINPOOL 
+#define SIGN_OF_X_BRAINPOOL 
+
+#define ATE_BITS_BRAINPOOL 
+#define G2_TABLE_BRAINPOOL 
+
+#endif
+
+
+#if CURVE_SECURITY_BRAINPOOL == 128
+#define AESKEY_BRAINPOOL 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_BRAINPOOL SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BRAINPOOL == 192
+#define AESKEY_BRAINPOOL 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_BRAINPOOL SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BRAINPOOL == 256
+#define AESKEY_BRAINPOOL 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_BRAINPOOL SHA512  /**< Hash type */
+#endif
+
+
+namespace BRAINPOOL_BIG = B256_56;
+namespace BRAINPOOL_FP = BRAINPOOL;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_C1174.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_C1174.h
new file mode 100644
index 0000000..d759ba7
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_C1174.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_C1174_H
+#define CONFIG_CURVE_C1174_H
+
+#include"core.h"
+#include"config_field_C1174.h"
+
+// ECP stuff
+
+#define CURVETYPE_C1174 EDWARDS
+#define CURVE_A_C1174 1
+#define PAIRING_FRIENDLY_C1174 NOT_PF
+#define CURVE_SECURITY_C1174 128
+#define HTC_ISO_C1174 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_C1174
+
+#if PAIRING_FRIENDLY_C1174 != NOT_PF
+
+#define HTC_ISO_G2_C1174 0
+
+#define USE_GLV_C1174   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_C1174 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_C1174 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_C1174 
+#define SIGN_OF_X_C1174 
+
+#define ATE_BITS_C1174 
+#define G2_TABLE_C1174 
+
+#endif
+
+
+#if CURVE_SECURITY_C1174 == 128
+#define AESKEY_C1174 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_C1174 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_C1174 == 192
+#define AESKEY_C1174 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_C1174 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_C1174 == 256
+#define AESKEY_C1174 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_C1174 SHA512  /**< Hash type */
+#endif
+
+
+namespace C1174_BIG = B256_56;
+namespace C1174_FP = C1174;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_C13318.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_C13318.h
new file mode 100644
index 0000000..eea03ff
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_C13318.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_C13318_H
+#define CONFIG_CURVE_C13318_H
+
+#include"core.h"
+#include"config_field_F25519.h"
+
+// ECP stuff
+
+#define CURVETYPE_C13318 WEIERSTRASS
+#define CURVE_A_C13318 -3
+#define PAIRING_FRIENDLY_C13318 NOT_PF
+#define CURVE_SECURITY_C13318 128
+#define HTC_ISO_C13318 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_C13318
+
+#if PAIRING_FRIENDLY_C13318 != NOT_PF
+
+#define HTC_ISO_G2_C13318 0
+
+#define USE_GLV_C13318   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_C13318 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_C13318 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_C13318 
+#define SIGN_OF_X_C13318 
+
+#define ATE_BITS_C13318 
+#define G2_TABLE_C13318 
+
+#endif
+
+
+#if CURVE_SECURITY_C13318 == 128
+#define AESKEY_C13318 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_C13318 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_C13318 == 192
+#define AESKEY_C13318 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_C13318 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_C13318 == 256
+#define AESKEY_C13318 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_C13318 SHA512  /**< Hash type */
+#endif
+
+
+namespace C13318_BIG = B256_56;
+namespace C13318_FP = F25519;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_C1665.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_C1665.h
new file mode 100644
index 0000000..f8239c7
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_C1665.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_C1665_H
+#define CONFIG_CURVE_C1665_H
+
+#include"core.h"
+#include"config_field_C1665.h"
+
+// ECP stuff
+
+#define CURVETYPE_C1665 EDWARDS
+#define CURVE_A_C1665 1
+#define PAIRING_FRIENDLY_C1665 NOT_PF
+#define CURVE_SECURITY_C1665 128
+#define HTC_ISO_C1665 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_C1665
+
+#if PAIRING_FRIENDLY_C1665 != NOT_PF
+
+#define HTC_ISO_G2_C1665 0
+
+#define USE_GLV_C1665   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_C1665 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_C1665 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_C1665 
+#define SIGN_OF_X_C1665 
+
+#define ATE_BITS_C1665 
+#define G2_TABLE_C1665 
+
+#endif
+
+
+#if CURVE_SECURITY_C1665 == 128
+#define AESKEY_C1665 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_C1665 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_C1665 == 192
+#define AESKEY_C1665 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_C1665 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_C1665 == 256
+#define AESKEY_C1665 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_C1665 SHA512  /**< Hash type */
+#endif
+
+
+namespace C1665_BIG = B168_60;
+namespace C1665_FP = C1665;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_C25519.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_C25519.h
new file mode 100644
index 0000000..ffa0325
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_C25519.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_C25519_H
+#define CONFIG_CURVE_C25519_H
+
+#include"core.h"
+#include"config_field_F25519.h"
+
+// ECP stuff
+
+#define CURVETYPE_C25519 MONTGOMERY
+#define CURVE_A_C25519 486662
+#define PAIRING_FRIENDLY_C25519 NOT_PF
+#define CURVE_SECURITY_C25519 128
+#define HTC_ISO_C25519 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_C25519
+
+#if PAIRING_FRIENDLY_C25519 != NOT_PF
+
+#define HTC_ISO_G2_C25519 0
+
+#define USE_GLV_C25519   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_C25519 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_C25519 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_C25519 
+#define SIGN_OF_X_C25519 
+
+#define ATE_BITS_C25519 
+#define G2_TABLE_C25519 
+
+#endif
+
+
+#if CURVE_SECURITY_C25519 == 128
+#define AESKEY_C25519 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_C25519 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_C25519 == 192
+#define AESKEY_C25519 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_C25519 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_C25519 == 256
+#define AESKEY_C25519 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_C25519 SHA512  /**< Hash type */
+#endif
+
+
+namespace C25519_BIG = B256_56;
+namespace C25519_FP = F25519;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_C41417.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_C41417.h
new file mode 100644
index 0000000..f66b588
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_C41417.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_C41417_H
+#define CONFIG_CURVE_C41417_H
+
+#include"core.h"
+#include"config_field_C41417.h"
+
+// ECP stuff
+
+#define CURVETYPE_C41417 EDWARDS
+#define CURVE_A_C41417 1
+#define PAIRING_FRIENDLY_C41417 NOT_PF
+#define CURVE_SECURITY_C41417 256
+#define HTC_ISO_C41417 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_C41417
+
+#if PAIRING_FRIENDLY_C41417 != NOT_PF
+
+#define HTC_ISO_G2_C41417 0
+
+#define USE_GLV_C41417   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_C41417 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_C41417 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_C41417 
+#define SIGN_OF_X_C41417 
+
+#define ATE_BITS_C41417 
+#define G2_TABLE_C41417 
+
+#endif
+
+
+#if CURVE_SECURITY_C41417 == 128
+#define AESKEY_C41417 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_C41417 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_C41417 == 192
+#define AESKEY_C41417 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_C41417 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_C41417 == 256
+#define AESKEY_C41417 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_C41417 SHA512  /**< Hash type */
+#endif
+
+
+namespace C41417_BIG = B416_60;
+namespace C41417_FP = C41417;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_Ed25519.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_Ed25519.h
new file mode 100644
index 0000000..3f5ace7
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_Ed25519.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_Ed25519_H
+#define CONFIG_CURVE_Ed25519_H
+
+#include"core.h"
+#include"config_field_F25519.h"
+
+// ECP stuff
+
+#define CURVETYPE_Ed25519 EDWARDS
+#define CURVE_A_Ed25519 -1
+#define PAIRING_FRIENDLY_Ed25519 NOT_PF
+#define CURVE_SECURITY_Ed25519 128
+#define HTC_ISO_Ed25519 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_Ed25519
+
+#if PAIRING_FRIENDLY_Ed25519 != NOT_PF
+
+#define HTC_ISO_G2_Ed25519 0
+
+#define USE_GLV_Ed25519   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_Ed25519 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_Ed25519 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_Ed25519 
+#define SIGN_OF_X_Ed25519 
+
+#define ATE_BITS_Ed25519 
+#define G2_TABLE_Ed25519 
+
+#endif
+
+
+#if CURVE_SECURITY_Ed25519 == 128
+#define AESKEY_Ed25519 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_Ed25519 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_Ed25519 == 192
+#define AESKEY_Ed25519 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_Ed25519 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_Ed25519 == 256
+#define AESKEY_Ed25519 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_Ed25519 SHA512  /**< Hash type */
+#endif
+
+
+namespace Ed25519_BIG = B256_56;
+namespace Ed25519_FP = F25519;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_Ed448.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_Ed448.h
new file mode 100644
index 0000000..f85c80e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_Ed448.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_Ed448_H
+#define CONFIG_CURVE_Ed448_H
+
+#include"core.h"
+#include"config_field_F448.h"
+
+// ECP stuff
+
+#define CURVETYPE_Ed448 EDWARDS
+#define CURVE_A_Ed448 1
+#define PAIRING_FRIENDLY_Ed448 NOT_PF
+#define CURVE_SECURITY_Ed448 256
+#define HTC_ISO_Ed448 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_Ed448
+
+#if PAIRING_FRIENDLY_Ed448 != NOT_PF
+
+#define HTC_ISO_G2_Ed448 0
+
+#define USE_GLV_Ed448   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_Ed448 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_Ed448 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_Ed448 
+#define SIGN_OF_X_Ed448 
+
+#define ATE_BITS_Ed448 
+#define G2_TABLE_Ed448 
+
+#endif
+
+
+#if CURVE_SECURITY_Ed448 == 128
+#define AESKEY_Ed448 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_Ed448 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_Ed448 == 192
+#define AESKEY_Ed448 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_Ed448 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_Ed448 == 256
+#define AESKEY_Ed448 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_Ed448 SHA512  /**< Hash type */
+#endif
+
+
+namespace Ed448_BIG = B448_58;
+namespace Ed448_FP = F448;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_FP256BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_FP256BN.h
new file mode 100644
index 0000000..3174557
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_FP256BN.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_FP256BN_H
+#define CONFIG_CURVE_FP256BN_H
+
+#include"core.h"
+#include"config_field_FP256BN.h"
+
+// ECP stuff
+
+#define CURVETYPE_FP256BN WEIERSTRASS
+#define CURVE_A_FP256BN 0
+#define PAIRING_FRIENDLY_FP256BN BN_CURVE
+#define CURVE_SECURITY_FP256BN 128
+#define HTC_ISO_FP256BN 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_FP256BN
+
+#if PAIRING_FRIENDLY_FP256BN != NOT_PF
+
+#define HTC_ISO_G2_FP256BN 0
+
+#define USE_GLV_FP256BN   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_FP256BN /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_FP256BN /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_FP256BN M_TYPE
+#define SIGN_OF_X_FP256BN NEGATIVEX
+
+#define ATE_BITS_FP256BN 66
+#define G2_TABLE_FP256BN 83
+
+#endif
+
+
+#if CURVE_SECURITY_FP256BN == 128
+#define AESKEY_FP256BN 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_FP256BN SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_FP256BN == 192
+#define AESKEY_FP256BN 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_FP256BN SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_FP256BN == 256
+#define AESKEY_FP256BN 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_FP256BN SHA512  /**< Hash type */
+#endif
+
+
+namespace FP256BN_BIG = B256_56;
+namespace FP256BN_FP = FP256BN;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_FP512BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_FP512BN.h
new file mode 100644
index 0000000..c66ae27
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_FP512BN.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_FP512BN_H
+#define CONFIG_CURVE_FP512BN_H
+
+#include"core.h"
+#include"config_field_FP512BN.h"
+
+// ECP stuff
+
+#define CURVETYPE_FP512BN WEIERSTRASS
+#define CURVE_A_FP512BN 0
+#define PAIRING_FRIENDLY_FP512BN BN_CURVE
+#define CURVE_SECURITY_FP512BN 128
+#define HTC_ISO_FP512BN 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_FP512BN
+
+#if PAIRING_FRIENDLY_FP512BN != NOT_PF
+
+#define HTC_ISO_G2_FP512BN 0
+
+#define USE_GLV_FP512BN   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_FP512BN /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_FP512BN /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_FP512BN M_TYPE
+#define SIGN_OF_X_FP512BN POSITIVEX
+
+#define ATE_BITS_FP512BN 130
+#define G2_TABLE_FP512BN 172
+
+#endif
+
+
+#if CURVE_SECURITY_FP512BN == 128
+#define AESKEY_FP512BN 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_FP512BN SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_FP512BN == 192
+#define AESKEY_FP512BN 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_FP512BN SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_FP512BN == 256
+#define AESKEY_FP512BN 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_FP512BN SHA512  /**< Hash type */
+#endif
+
+
+namespace FP512BN_BIG = B512_60;
+namespace FP512BN_FP = FP512BN;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_HIFIVE.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_HIFIVE.h
new file mode 100644
index 0000000..436a71f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_HIFIVE.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_HIFIVE_H
+#define CONFIG_CURVE_HIFIVE_H
+
+#include"core.h"
+#include"config_field_HIFIVE.h"
+
+// ECP stuff
+
+#define CURVETYPE_HIFIVE EDWARDS
+#define CURVE_A_HIFIVE 1
+#define PAIRING_FRIENDLY_HIFIVE NOT_PF
+#define CURVE_SECURITY_HIFIVE 192
+#define HTC_ISO_HIFIVE 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_HIFIVE
+
+#if PAIRING_FRIENDLY_HIFIVE != NOT_PF
+
+#define HTC_ISO_G2_HIFIVE 0
+
+#define USE_GLV_HIFIVE   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_HIFIVE /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_HIFIVE /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_HIFIVE 
+#define SIGN_OF_X_HIFIVE 
+
+#define ATE_BITS_HIFIVE 
+#define G2_TABLE_HIFIVE 
+
+#endif
+
+
+#if CURVE_SECURITY_HIFIVE == 128
+#define AESKEY_HIFIVE 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_HIFIVE SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_HIFIVE == 192
+#define AESKEY_HIFIVE 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_HIFIVE SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_HIFIVE == 256
+#define AESKEY_HIFIVE 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_HIFIVE SHA512  /**< Hash type */
+#endif
+
+
+namespace HIFIVE_BIG = B336_60;
+namespace HIFIVE_FP = HIFIVE;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_JUBJUB.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_JUBJUB.h
new file mode 100644
index 0000000..bfe0f80
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_JUBJUB.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_JUBJUB_H
+#define CONFIG_CURVE_JUBJUB_H
+
+#include"core.h"
+#include"config_field_JUBJUB.h"
+
+// ECP stuff
+
+#define CURVETYPE_JUBJUB EDWARDS
+#define CURVE_A_JUBJUB -1
+#define PAIRING_FRIENDLY_JUBJUB NOT_PF
+#define CURVE_SECURITY_JUBJUB 128
+#define HTC_ISO_JUBJUB 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_JUBJUB
+
+#if PAIRING_FRIENDLY_JUBJUB != NOT_PF
+
+#define HTC_ISO_G2_JUBJUB 0
+
+#define USE_GLV_JUBJUB   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_JUBJUB /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_JUBJUB /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_JUBJUB 
+#define SIGN_OF_X_JUBJUB 
+
+#define ATE_BITS_JUBJUB 
+#define G2_TABLE_JUBJUB 
+
+#endif
+
+
+#if CURVE_SECURITY_JUBJUB == 128
+#define AESKEY_JUBJUB 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_JUBJUB SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_JUBJUB == 192
+#define AESKEY_JUBJUB 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_JUBJUB SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_JUBJUB == 256
+#define AESKEY_JUBJUB 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_JUBJUB SHA512  /**< Hash type */
+#endif
+
+
+namespace JUBJUB_BIG = B256_56;
+namespace JUBJUB_FP = JUBJUB;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_MDC.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_MDC.h
new file mode 100644
index 0000000..6828668
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_MDC.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_MDC_H
+#define CONFIG_CURVE_MDC_H
+
+#include"core.h"
+#include"config_field_MDC.h"
+
+// ECP stuff
+
+#define CURVETYPE_MDC EDWARDS
+#define CURVE_A_MDC 1
+#define PAIRING_FRIENDLY_MDC NOT_PF
+#define CURVE_SECURITY_MDC 128
+#define HTC_ISO_MDC 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_MDC
+
+#if PAIRING_FRIENDLY_MDC != NOT_PF
+
+#define HTC_ISO_G2_MDC 0
+
+#define USE_GLV_MDC   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_MDC /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_MDC /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_MDC 
+#define SIGN_OF_X_MDC 
+
+#define ATE_BITS_MDC 
+#define G2_TABLE_MDC 
+
+#endif
+
+
+#if CURVE_SECURITY_MDC == 128
+#define AESKEY_MDC 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_MDC SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_MDC == 192
+#define AESKEY_MDC 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_MDC SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_MDC == 256
+#define AESKEY_MDC 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_MDC SHA512  /**< Hash type */
+#endif
+
+
+namespace MDC_BIG = B256_56;
+namespace MDC_FP = MDC;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_NIST256.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_NIST256.h
new file mode 100644
index 0000000..78c0807
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_NIST256.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_NIST256_H
+#define CONFIG_CURVE_NIST256_H
+
+#include"core.h"
+#include"config_field_NIST256.h"
+
+// ECP stuff
+
+#define CURVETYPE_NIST256 WEIERSTRASS
+#define CURVE_A_NIST256 -3
+#define PAIRING_FRIENDLY_NIST256 NOT_PF
+#define CURVE_SECURITY_NIST256 128
+#define HTC_ISO_NIST256 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_NIST256
+
+#if PAIRING_FRIENDLY_NIST256 != NOT_PF
+
+#define HTC_ISO_G2_NIST256 0
+
+#define USE_GLV_NIST256   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_NIST256 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_NIST256 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_NIST256 
+#define SIGN_OF_X_NIST256 
+
+#define ATE_BITS_NIST256 
+#define G2_TABLE_NIST256 
+
+#endif
+
+
+#if CURVE_SECURITY_NIST256 == 128
+#define AESKEY_NIST256 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_NIST256 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_NIST256 == 192
+#define AESKEY_NIST256 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_NIST256 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_NIST256 == 256
+#define AESKEY_NIST256 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_NIST256 SHA512  /**< Hash type */
+#endif
+
+
+namespace NIST256_BIG = B256_56;
+namespace NIST256_FP = NIST256;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_NIST384.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_NIST384.h
new file mode 100644
index 0000000..1a089b1
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_NIST384.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_NIST384_H
+#define CONFIG_CURVE_NIST384_H
+
+#include"core.h"
+#include"config_field_NIST384.h"
+
+// ECP stuff
+
+#define CURVETYPE_NIST384 WEIERSTRASS
+#define CURVE_A_NIST384 -3
+#define PAIRING_FRIENDLY_NIST384 NOT_PF
+#define CURVE_SECURITY_NIST384 192
+#define HTC_ISO_NIST384 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_NIST384
+
+#if PAIRING_FRIENDLY_NIST384 != NOT_PF
+
+#define HTC_ISO_G2_NIST384 0
+
+#define USE_GLV_NIST384   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_NIST384 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_NIST384 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_NIST384 
+#define SIGN_OF_X_NIST384 
+
+#define ATE_BITS_NIST384 
+#define G2_TABLE_NIST384 
+
+#endif
+
+
+#if CURVE_SECURITY_NIST384 == 128
+#define AESKEY_NIST384 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_NIST384 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_NIST384 == 192
+#define AESKEY_NIST384 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_NIST384 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_NIST384 == 256
+#define AESKEY_NIST384 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_NIST384 SHA512  /**< Hash type */
+#endif
+
+
+namespace NIST384_BIG = B384_56;
+namespace NIST384_FP = NIST384;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_NIST521.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_NIST521.h
new file mode 100644
index 0000000..9bad49d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_NIST521.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_NIST521_H
+#define CONFIG_CURVE_NIST521_H
+
+#include"core.h"
+#include"config_field_NIST521.h"
+
+// ECP stuff
+
+#define CURVETYPE_NIST521 WEIERSTRASS
+#define CURVE_A_NIST521 -3
+#define PAIRING_FRIENDLY_NIST521 NOT_PF
+#define CURVE_SECURITY_NIST521 256
+#define HTC_ISO_NIST521 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_NIST521
+
+#if PAIRING_FRIENDLY_NIST521 != NOT_PF
+
+#define HTC_ISO_G2_NIST521 0
+
+#define USE_GLV_NIST521   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_NIST521 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_NIST521 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_NIST521 
+#define SIGN_OF_X_NIST521 
+
+#define ATE_BITS_NIST521 
+#define G2_TABLE_NIST521 
+
+#endif
+
+
+#if CURVE_SECURITY_NIST521 == 128
+#define AESKEY_NIST521 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_NIST521 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_NIST521 == 192
+#define AESKEY_NIST521 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_NIST521 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_NIST521 == 256
+#define AESKEY_NIST521 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_NIST521 SHA512  /**< Hash type */
+#endif
+
+
+namespace NIST521_BIG = B528_60;
+namespace NIST521_FP = NIST521;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_NUMS256E.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_NUMS256E.h
new file mode 100644
index 0000000..765d71f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_NUMS256E.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_NUMS256E_H
+#define CONFIG_CURVE_NUMS256E_H
+
+#include"core.h"
+#include"config_field_F256PME.h"
+
+// ECP stuff
+
+#define CURVETYPE_NUMS256E EDWARDS
+#define CURVE_A_NUMS256E 1
+#define PAIRING_FRIENDLY_NUMS256E NOT_PF
+#define CURVE_SECURITY_NUMS256E 128
+#define HTC_ISO_NUMS256E 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_NUMS256E
+
+#if PAIRING_FRIENDLY_NUMS256E != NOT_PF
+
+#define HTC_ISO_G2_NUMS256E 0
+
+#define USE_GLV_NUMS256E   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_NUMS256E /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_NUMS256E /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_NUMS256E 
+#define SIGN_OF_X_NUMS256E 
+
+#define ATE_BITS_NUMS256E 
+#define G2_TABLE_NUMS256E 
+
+#endif
+
+
+#if CURVE_SECURITY_NUMS256E == 128
+#define AESKEY_NUMS256E 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_NUMS256E SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_NUMS256E == 192
+#define AESKEY_NUMS256E 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_NUMS256E SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_NUMS256E == 256
+#define AESKEY_NUMS256E 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_NUMS256E SHA512  /**< Hash type */
+#endif
+
+
+namespace NUMS256E_BIG = B256_56;
+namespace NUMS256E_FP = F256PME;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_NUMS256W.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_NUMS256W.h
new file mode 100644
index 0000000..3c7901f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_NUMS256W.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_NUMS256W_H
+#define CONFIG_CURVE_NUMS256W_H
+
+#include"core.h"
+#include"config_field_F256PMW.h"
+
+// ECP stuff
+
+#define CURVETYPE_NUMS256W WEIERSTRASS
+#define CURVE_A_NUMS256W -3
+#define PAIRING_FRIENDLY_NUMS256W NOT_PF
+#define CURVE_SECURITY_NUMS256W 128
+#define HTC_ISO_NUMS256W 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_NUMS256W
+
+#if PAIRING_FRIENDLY_NUMS256W != NOT_PF
+
+#define HTC_ISO_G2_NUMS256W 0
+
+#define USE_GLV_NUMS256W   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_NUMS256W /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_NUMS256W /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_NUMS256W 
+#define SIGN_OF_X_NUMS256W 
+
+#define ATE_BITS_NUMS256W 
+#define G2_TABLE_NUMS256W 
+
+#endif
+
+
+#if CURVE_SECURITY_NUMS256W == 128
+#define AESKEY_NUMS256W 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_NUMS256W SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_NUMS256W == 192
+#define AESKEY_NUMS256W 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_NUMS256W SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_NUMS256W == 256
+#define AESKEY_NUMS256W 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_NUMS256W SHA512  /**< Hash type */
+#endif
+
+
+namespace NUMS256W_BIG = B256_56;
+namespace NUMS256W_FP = F256PMW;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_NUMS384E.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_NUMS384E.h
new file mode 100644
index 0000000..db14475
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_NUMS384E.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_NUMS384E_H
+#define CONFIG_CURVE_NUMS384E_H
+
+#include"core.h"
+#include"config_field_F384PM.h"
+
+// ECP stuff
+
+#define CURVETYPE_NUMS384E EDWARDS
+#define CURVE_A_NUMS384E 1
+#define PAIRING_FRIENDLY_NUMS384E NOT_PF
+#define CURVE_SECURITY_NUMS384E 192
+#define HTC_ISO_NUMS384E 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_NUMS384E
+
+#if PAIRING_FRIENDLY_NUMS384E != NOT_PF
+
+#define HTC_ISO_G2_NUMS384E 0
+
+#define USE_GLV_NUMS384E   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_NUMS384E /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_NUMS384E /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_NUMS384E 
+#define SIGN_OF_X_NUMS384E 
+
+#define ATE_BITS_NUMS384E 
+#define G2_TABLE_NUMS384E 
+
+#endif
+
+
+#if CURVE_SECURITY_NUMS384E == 128
+#define AESKEY_NUMS384E 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_NUMS384E SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_NUMS384E == 192
+#define AESKEY_NUMS384E 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_NUMS384E SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_NUMS384E == 256
+#define AESKEY_NUMS384E 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_NUMS384E SHA512  /**< Hash type */
+#endif
+
+
+namespace NUMS384E_BIG = B384_58;
+namespace NUMS384E_FP = F384PM;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_NUMS384W.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_NUMS384W.h
new file mode 100644
index 0000000..83ea507
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_NUMS384W.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_NUMS384W_H
+#define CONFIG_CURVE_NUMS384W_H
+
+#include"core.h"
+#include"config_field_F384PM.h"
+
+// ECP stuff
+
+#define CURVETYPE_NUMS384W WEIERSTRASS
+#define CURVE_A_NUMS384W -3
+#define PAIRING_FRIENDLY_NUMS384W NOT_PF
+#define CURVE_SECURITY_NUMS384W 192
+#define HTC_ISO_NUMS384W 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_NUMS384W
+
+#if PAIRING_FRIENDLY_NUMS384W != NOT_PF
+
+#define HTC_ISO_G2_NUMS384W 0
+
+#define USE_GLV_NUMS384W   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_NUMS384W /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_NUMS384W /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_NUMS384W 
+#define SIGN_OF_X_NUMS384W 
+
+#define ATE_BITS_NUMS384W 
+#define G2_TABLE_NUMS384W 
+
+#endif
+
+
+#if CURVE_SECURITY_NUMS384W == 128
+#define AESKEY_NUMS384W 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_NUMS384W SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_NUMS384W == 192
+#define AESKEY_NUMS384W 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_NUMS384W SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_NUMS384W == 256
+#define AESKEY_NUMS384W 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_NUMS384W SHA512  /**< Hash type */
+#endif
+
+
+namespace NUMS384W_BIG = B384_58;
+namespace NUMS384W_FP = F384PM;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_NUMS512E.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_NUMS512E.h
new file mode 100644
index 0000000..6cc80c8
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_NUMS512E.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_NUMS512E_H
+#define CONFIG_CURVE_NUMS512E_H
+
+#include"core.h"
+#include"config_field_F512PM.h"
+
+// ECP stuff
+
+#define CURVETYPE_NUMS512E EDWARDS
+#define CURVE_A_NUMS512E 1
+#define PAIRING_FRIENDLY_NUMS512E NOT_PF
+#define CURVE_SECURITY_NUMS512E 256
+#define HTC_ISO_NUMS512E 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_NUMS512E
+
+#if PAIRING_FRIENDLY_NUMS512E != NOT_PF
+
+#define HTC_ISO_G2_NUMS512E 0
+
+#define USE_GLV_NUMS512E   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_NUMS512E /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_NUMS512E /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_NUMS512E 
+#define SIGN_OF_X_NUMS512E 
+
+#define ATE_BITS_NUMS512E 
+#define G2_TABLE_NUMS512E 
+
+#endif
+
+
+#if CURVE_SECURITY_NUMS512E == 128
+#define AESKEY_NUMS512E 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_NUMS512E SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_NUMS512E == 192
+#define AESKEY_NUMS512E 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_NUMS512E SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_NUMS512E == 256
+#define AESKEY_NUMS512E 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_NUMS512E SHA512  /**< Hash type */
+#endif
+
+
+namespace NUMS512E_BIG = B512_60;
+namespace NUMS512E_FP = F512PM;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_NUMS512W.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_NUMS512W.h
new file mode 100644
index 0000000..6d9d739
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_NUMS512W.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_NUMS512W_H
+#define CONFIG_CURVE_NUMS512W_H
+
+#include"core.h"
+#include"config_field_F512PM.h"
+
+// ECP stuff
+
+#define CURVETYPE_NUMS512W WEIERSTRASS
+#define CURVE_A_NUMS512W -3
+#define PAIRING_FRIENDLY_NUMS512W NOT_PF
+#define CURVE_SECURITY_NUMS512W 256
+#define HTC_ISO_NUMS512W 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_NUMS512W
+
+#if PAIRING_FRIENDLY_NUMS512W != NOT_PF
+
+#define HTC_ISO_G2_NUMS512W 0
+
+#define USE_GLV_NUMS512W   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_NUMS512W /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_NUMS512W /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_NUMS512W 
+#define SIGN_OF_X_NUMS512W 
+
+#define ATE_BITS_NUMS512W 
+#define G2_TABLE_NUMS512W 
+
+#endif
+
+
+#if CURVE_SECURITY_NUMS512W == 128
+#define AESKEY_NUMS512W 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_NUMS512W SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_NUMS512W == 192
+#define AESKEY_NUMS512W 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_NUMS512W SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_NUMS512W == 256
+#define AESKEY_NUMS512W 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_NUMS512W SHA512  /**< Hash type */
+#endif
+
+
+namespace NUMS512W_BIG = B512_60;
+namespace NUMS512W_FP = F512PM;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_SECP160R1.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_SECP160R1.h
new file mode 100644
index 0000000..21bdc09
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_SECP160R1.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_SECP160R1_H
+#define CONFIG_CURVE_SECP160R1_H
+
+#include"core.h"
+#include"config_field_SECP160R1.h"
+
+// ECP stuff
+
+#define CURVETYPE_SECP160R1 WEIERSTRASS
+#define CURVE_A_SECP160R1 -3
+#define PAIRING_FRIENDLY_SECP160R1 NOT_PF
+#define CURVE_SECURITY_SECP160R1 128
+#define HTC_ISO_SECP160R1 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_SECP160R1
+
+#if PAIRING_FRIENDLY_SECP160R1 != NOT_PF
+
+#define HTC_ISO_G2_SECP160R1 0
+
+#define USE_GLV_SECP160R1   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_SECP160R1 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_SECP160R1 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_SECP160R1 
+#define SIGN_OF_X_SECP160R1 
+
+#define ATE_BITS_SECP160R1 
+#define G2_TABLE_SECP160R1 
+
+#endif
+
+
+#if CURVE_SECURITY_SECP160R1 == 128
+#define AESKEY_SECP160R1 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_SECP160R1 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_SECP160R1 == 192
+#define AESKEY_SECP160R1 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_SECP160R1 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_SECP160R1 == 256
+#define AESKEY_SECP160R1 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_SECP160R1 SHA512  /**< Hash type */
+#endif
+
+
+namespace SECP160R1_BIG = B160_56;
+namespace SECP160R1_FP = SECP160R1;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_SECP256K1.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_SECP256K1.h
new file mode 100644
index 0000000..01676ab
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_SECP256K1.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_SECP256K1_H
+#define CONFIG_CURVE_SECP256K1_H
+
+#include"core.h"
+#include"config_field_SECP256K1.h"
+
+// ECP stuff
+
+#define CURVETYPE_SECP256K1 WEIERSTRASS
+#define CURVE_A_SECP256K1 0
+#define PAIRING_FRIENDLY_SECP256K1 NOT_PF
+#define CURVE_SECURITY_SECP256K1 128
+#define HTC_ISO_SECP256K1 3
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_SECP256K1
+
+#if PAIRING_FRIENDLY_SECP256K1 != NOT_PF
+
+#define HTC_ISO_G2_SECP256K1 0
+
+#define USE_GLV_SECP256K1   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_SECP256K1 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_SECP256K1 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_SECP256K1 
+#define SIGN_OF_X_SECP256K1 
+
+#define ATE_BITS_SECP256K1 
+#define G2_TABLE_SECP256K1 
+
+#endif
+
+
+#if CURVE_SECURITY_SECP256K1 == 128
+#define AESKEY_SECP256K1 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_SECP256K1 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_SECP256K1 == 192
+#define AESKEY_SECP256K1 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_SECP256K1 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_SECP256K1 == 256
+#define AESKEY_SECP256K1 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_SECP256K1 SHA512  /**< Hash type */
+#endif
+
+
+namespace SECP256K1_BIG = B256_56;
+namespace SECP256K1_FP = SECP256K1;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_SM2.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_SM2.h
new file mode 100644
index 0000000..6207f4f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_SM2.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_SM2_H
+#define CONFIG_CURVE_SM2_H
+
+#include"core.h"
+#include"config_field_SM2.h"
+
+// ECP stuff
+
+#define CURVETYPE_SM2 WEIERSTRASS
+#define CURVE_A_SM2 -3
+#define PAIRING_FRIENDLY_SM2 NOT_PF
+#define CURVE_SECURITY_SM2 128
+#define HTC_ISO_SM2 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_SM2
+
+#if PAIRING_FRIENDLY_SM2 != NOT_PF
+
+#define HTC_ISO_G2_SM2 0
+
+#define USE_GLV_SM2   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_SM2 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_SM2 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_SM2 
+#define SIGN_OF_X_SM2 
+
+#define ATE_BITS_SM2 
+#define G2_TABLE_SM2 
+
+#endif
+
+
+#if CURVE_SECURITY_SM2 == 128
+#define AESKEY_SM2 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_SM2 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_SM2 == 192
+#define AESKEY_SM2 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_SM2 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_SM2 == 256
+#define AESKEY_SM2 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_SM2 SHA512  /**< Hash type */
+#endif
+
+
+namespace SM2_BIG = B256_56;
+namespace SM2_FP = SM2;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_TWEEDLEDEE.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_TWEEDLEDEE.h
new file mode 100644
index 0000000..329e004
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_TWEEDLEDEE.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_TWEEDLEDEE_H
+#define CONFIG_CURVE_TWEEDLEDEE_H
+
+#include"core.h"
+#include"config_field_TWEEDLEDEE.h"
+
+// ECP stuff
+
+#define CURVETYPE_TWEEDLEDEE WEIERSTRASS
+#define CURVE_A_TWEEDLEDEE 0
+#define PAIRING_FRIENDLY_TWEEDLEDEE NOT_PF
+#define CURVE_SECURITY_TWEEDLEDEE 128
+#define HTC_ISO_TWEEDLEDEE 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_TWEEDLEDEE
+
+#if PAIRING_FRIENDLY_TWEEDLEDEE != NOT_PF
+
+#define HTC_ISO_G2_TWEEDLEDEE 0
+
+#define USE_GLV_TWEEDLEDEE   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_TWEEDLEDEE /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_TWEEDLEDEE /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_TWEEDLEDEE 
+#define SIGN_OF_X_TWEEDLEDEE 
+
+#define ATE_BITS_TWEEDLEDEE 
+#define G2_TABLE_TWEEDLEDEE 
+
+#endif
+
+
+#if CURVE_SECURITY_TWEEDLEDEE == 128
+#define AESKEY_TWEEDLEDEE 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_TWEEDLEDEE SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_TWEEDLEDEE == 192
+#define AESKEY_TWEEDLEDEE 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_TWEEDLEDEE SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_TWEEDLEDEE == 256
+#define AESKEY_TWEEDLEDEE 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_TWEEDLEDEE SHA512  /**< Hash type */
+#endif
+
+
+namespace TWEEDLEDEE_BIG = B256_56;
+namespace TWEEDLEDEE_FP = TWEEDLEDEE;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_TWEEDLEDUM.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_TWEEDLEDUM.h
new file mode 100644
index 0000000..07fb3d7
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_TWEEDLEDUM.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_TWEEDLEDUM_H
+#define CONFIG_CURVE_TWEEDLEDUM_H
+
+#include"core.h"
+#include"config_field_TWEEDLEDUM.h"
+
+// ECP stuff
+
+#define CURVETYPE_TWEEDLEDUM WEIERSTRASS
+#define CURVE_A_TWEEDLEDUM 0
+#define PAIRING_FRIENDLY_TWEEDLEDUM NOT_PF
+#define CURVE_SECURITY_TWEEDLEDUM 128
+#define HTC_ISO_TWEEDLEDUM 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_TWEEDLEDUM
+
+#if PAIRING_FRIENDLY_TWEEDLEDUM != NOT_PF
+
+#define HTC_ISO_G2_TWEEDLEDUM 0
+
+#define USE_GLV_TWEEDLEDUM   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_TWEEDLEDUM /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_TWEEDLEDUM /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_TWEEDLEDUM 
+#define SIGN_OF_X_TWEEDLEDUM 
+
+#define ATE_BITS_TWEEDLEDUM 
+#define G2_TABLE_TWEEDLEDUM 
+
+#endif
+
+
+#if CURVE_SECURITY_TWEEDLEDUM == 128
+#define AESKEY_TWEEDLEDUM 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_TWEEDLEDUM SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_TWEEDLEDUM == 192
+#define AESKEY_TWEEDLEDUM 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_TWEEDLEDUM SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_TWEEDLEDUM == 256
+#define AESKEY_TWEEDLEDUM 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_TWEEDLEDUM SHA512  /**< Hash type */
+#endif
+
+
+namespace TWEEDLEDUM_BIG = B256_56;
+namespace TWEEDLEDUM_FP = TWEEDLEDUM;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_X448.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_X448.h
new file mode 100644
index 0000000..aa8e596
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_curve_X448.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_X448_H
+#define CONFIG_CURVE_X448_H
+
+#include"core.h"
+#include"config_field_F448.h"
+
+// ECP stuff
+
+#define CURVETYPE_X448 MONTGOMERY
+#define CURVE_A_X448 156326
+#define PAIRING_FRIENDLY_X448 NOT_PF
+#define CURVE_SECURITY_X448 256
+#define HTC_ISO_X448 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_X448
+
+#if PAIRING_FRIENDLY_X448 != NOT_PF
+
+#define HTC_ISO_G2_X448 0
+
+#define USE_GLV_X448   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_X448 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_X448 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_X448 
+#define SIGN_OF_X_X448 
+
+#define ATE_BITS_X448 
+#define G2_TABLE_X448 
+
+#endif
+
+
+#if CURVE_SECURITY_X448 == 128
+#define AESKEY_X448 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_X448 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_X448 == 192
+#define AESKEY_X448 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_X448 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_X448 == 256
+#define AESKEY_X448 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_X448 SHA512  /**< Hash type */
+#endif
+
+
+namespace X448_BIG = B448_58;
+namespace X448_FP = F448;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_ff.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_ff.h
new file mode 100644
index 0000000..cc6744a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_ff.h
@@ -0,0 +1,32 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_RSA_WWW_H
+#define CONFIG_RSA_WWW_H
+
+#include "core.h"
+#include "config_big_XXX.h"
+
+// FF stuff
+
+#define FFLEN_WWW @ML@ /**< 2^n multiplier of BIGBITS to specify supported Finite Field size, e.g 2048=256*2^3 where BIGBITS=256 */
+
+namespace WWW_BIG = XXX;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_ff_RSA2048.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_ff_RSA2048.h
new file mode 100644
index 0000000..9295409
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_ff_RSA2048.h
@@ -0,0 +1,32 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_RSA_RSA2048_H
+#define CONFIG_RSA_RSA2048_H
+
+#include "core.h"
+#include "config_big_B512_60.h"
+
+// FF stuff
+
+#define FFLEN_RSA2048 4 /**< 2^n multiplier of BIGBITS to specify supported Finite Field size, e.g 2048=256*2^3 where BIGBITS=256 */
+
+namespace RSA2048_BIG = B512_60;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_ff_RSA3072.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_ff_RSA3072.h
new file mode 100644
index 0000000..aa73885
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_ff_RSA3072.h
@@ -0,0 +1,32 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_RSA_RSA3072_H
+#define CONFIG_RSA_RSA3072_H
+
+#include "core.h"
+#include "config_big_B384_56.h"
+
+// FF stuff
+
+#define FFLEN_RSA3072 8 /**< 2^n multiplier of BIGBITS to specify supported Finite Field size, e.g 2048=256*2^3 where BIGBITS=256 */
+
+namespace RSA3072_BIG = B384_56;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_ff_RSA4096.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_ff_RSA4096.h
new file mode 100644
index 0000000..8b0323c
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_ff_RSA4096.h
@@ -0,0 +1,32 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_RSA_RSA4096_H
+#define CONFIG_RSA_RSA4096_H
+
+#include "core.h"
+#include "config_big_B512_60.h"
+
+// FF stuff
+
+#define FFLEN_RSA4096 8 /**< 2^n multiplier of BIGBITS to specify supported Finite Field size, e.g 2048=256*2^3 where BIGBITS=256 */
+
+namespace RSA4096_BIG = B512_60;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field.h
new file mode 100644
index 0000000..88f4d7b
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_YYY_H
+#define CONFIG_FIELD_YYY_H
+
+#include"core.h"
+#include "config_big_XXX.h"
+
+// FP stuff
+
+#define MBITS_YYY @NBT@
+#define PM1D2_YYY @M8@
+#define MODTYPE_YYY @MT@
+#define MAXXES_YYY @SH@
+#define QNRI_YYY @QI@
+#define RIADZ_YYY @RZ@
+#define RIADZG2A_YYY @RZ2A@
+#define RIADZG2B_YYY @RZ2B@
+#define TOWER_YYY @TW@
+
+//#define BIG_ENDIAN_SIGN_YYY 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_ANSSI.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_ANSSI.h
new file mode 100644
index 0000000..e810e76
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_ANSSI.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_ANSSI_H
+#define CONFIG_FIELD_ANSSI_H
+
+#include"core.h"
+#include "config_big_B256_56.h"
+
+// FP stuff
+
+#define MBITS_ANSSI 256
+#define PM1D2_ANSSI 1
+#define MODTYPE_ANSSI NOT_SPECIAL
+#define MAXXES_ANSSI 24
+#define QNRI_ANSSI 0
+#define RIADZ_ANSSI -5
+#define RIADZG2A_ANSSI 0
+#define RIADZG2B_ANSSI 0
+#define TOWER_ANSSI NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_ANSSI 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_BLS12381.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_BLS12381.h
new file mode 100644
index 0000000..53923e3
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_BLS12381.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_BLS12381_H
+#define CONFIG_FIELD_BLS12381_H
+
+#include"core.h"
+#include "config_big_B384_58.h"
+
+// FP stuff
+
+#define MBITS_BLS12381 381
+#define PM1D2_BLS12381 1
+#define MODTYPE_BLS12381 NOT_SPECIAL
+#define MAXXES_BLS12381 25
+#define QNRI_BLS12381 0
+#define RIADZ_BLS12381 11
+#define RIADZG2A_BLS12381 -2
+#define RIADZG2B_BLS12381 -1
+#define TOWER_BLS12381 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_BLS12381 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_BLS12383.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_BLS12383.h
new file mode 100644
index 0000000..48fef18
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_BLS12383.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_BLS12383_H
+#define CONFIG_FIELD_BLS12383_H
+
+#include"core.h"
+#include "config_big_B384_58.h"
+
+// FP stuff
+
+#define MBITS_BLS12383 383
+#define PM1D2_BLS12383 1
+#define MODTYPE_BLS12383 NOT_SPECIAL
+#define MAXXES_BLS12383 23
+#define QNRI_BLS12383 0
+#define RIADZ_BLS12383 1
+#define RIADZG2A_BLS12383 1
+#define RIADZG2B_BLS12383 0
+#define TOWER_BLS12383 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_BLS12383 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_BLS12443.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_BLS12443.h
new file mode 100644
index 0000000..9201da4
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_BLS12443.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_BLS12443_H
+#define CONFIG_FIELD_BLS12443_H
+
+#include"core.h"
+#include "config_big_B448_60.h"
+
+// FP stuff
+
+#define MBITS_BLS12443 443
+#define PM1D2_BLS12443 1
+#define MODTYPE_BLS12443 NOT_SPECIAL
+#define MAXXES_BLS12443 30
+#define QNRI_BLS12443 0
+#define RIADZ_BLS12443 -7
+#define RIADZG2A_BLS12443 1
+#define RIADZG2B_BLS12443 1
+#define TOWER_BLS12443 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_BLS12443 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_BLS12461.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_BLS12461.h
new file mode 100644
index 0000000..08e8713
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_BLS12461.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_BLS12461_H
+#define CONFIG_FIELD_BLS12461_H
+
+#include"core.h"
+#include "config_big_B464_60.h"
+
+// FP stuff
+
+#define MBITS_BLS12461 461
+#define PM1D2_BLS12461 1
+#define MODTYPE_BLS12461 NOT_SPECIAL
+#define MAXXES_BLS12461 19
+#define QNRI_BLS12461 0
+#define RIADZ_BLS12461 1
+#define RIADZG2A_BLS12461 4
+#define RIADZG2B_BLS12461 0
+#define TOWER_BLS12461 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_BLS12461 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_BLS24479.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_BLS24479.h
new file mode 100644
index 0000000..2feefdc
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_BLS24479.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_BLS24479_H
+#define CONFIG_FIELD_BLS24479_H
+
+#include"core.h"
+#include "config_big_B480_56.h"
+
+// FP stuff
+
+#define MBITS_BLS24479 479
+#define PM1D2_BLS24479 1
+#define MODTYPE_BLS24479 NOT_SPECIAL
+#define MAXXES_BLS24479 25
+#define QNRI_BLS24479 0
+#define RIADZ_BLS24479 1
+#define RIADZG2A_BLS24479 4
+#define RIADZG2B_BLS24479 0
+#define TOWER_BLS24479 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_BLS24479 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_BLS48286.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_BLS48286.h
new file mode 100644
index 0000000..c7c8b56
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_BLS48286.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_BLS48286_H
+#define CONFIG_FIELD_BLS48286_H
+
+#include"core.h"
+#include "config_big_B288_60.h"
+
+// FP stuff
+
+#define MBITS_BLS48286 286
+#define PM1D2_BLS48286 1
+#define MODTYPE_BLS48286 NOT_SPECIAL
+#define MAXXES_BLS48286 14
+#define QNRI_BLS48286 0
+#define RIADZ_BLS48286 1
+#define RIADZG2A_BLS48286 1
+#define RIADZG2B_BLS48286 0
+#define TOWER_BLS48286 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_BLS48286 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_BLS48556.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_BLS48556.h
new file mode 100644
index 0000000..5837180
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_BLS48556.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_BLS48556_H
+#define CONFIG_FIELD_BLS48556_H
+
+#include"core.h"
+#include "config_big_B560_58.h"
+
+// FP stuff
+
+#define MBITS_BLS48556 556
+#define PM1D2_BLS48556 1
+#define MODTYPE_BLS48556 NOT_SPECIAL
+#define MAXXES_BLS48556 24
+#define QNRI_BLS48556 0
+#define RIADZ_BLS48556 -1
+#define RIADZG2A_BLS48556 2
+#define RIADZG2B_BLS48556 0
+#define TOWER_BLS48556 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_BLS48556 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_BLS48581.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_BLS48581.h
new file mode 100644
index 0000000..9250ec0
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_BLS48581.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_BLS48581_H
+#define CONFIG_FIELD_BLS48581_H
+
+#include"core.h"
+#include "config_big_B584_60.h"
+
+// FP stuff
+
+#define MBITS_BLS48581 581
+#define PM1D2_BLS48581 1
+#define MODTYPE_BLS48581 NOT_SPECIAL
+#define MAXXES_BLS48581 19
+#define QNRI_BLS48581 0
+#define RIADZ_BLS48581 2
+#define RIADZG2A_BLS48581 2
+#define RIADZG2B_BLS48581 0
+#define TOWER_BLS48581 POSITOWER
+
+//#define BIG_ENDIAN_SIGN_BLS48581 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_BN158.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_BN158.h
new file mode 100644
index 0000000..8ca6c82
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_BN158.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_BN158_H
+#define CONFIG_FIELD_BN158_H
+
+#include"core.h"
+#include "config_big_B160_56.h"
+
+// FP stuff
+
+#define MBITS_BN158 158
+#define PM1D2_BN158 1
+#define MODTYPE_BN158 NOT_SPECIAL
+#define MAXXES_BN158 10
+#define QNRI_BN158 0
+#define RIADZ_BN158 1
+#define RIADZG2A_BN158 1
+#define RIADZG2B_BN158 0
+#define TOWER_BN158 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_BN158 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_BN254.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_BN254.h
new file mode 100644
index 0000000..6f1849c
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_BN254.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_BN254_H
+#define CONFIG_FIELD_BN254_H
+
+#include"core.h"
+#include "config_big_B256_56.h"
+
+// FP stuff
+
+#define MBITS_BN254 254
+#define PM1D2_BN254 1
+#define MODTYPE_BN254 NOT_SPECIAL
+#define MAXXES_BN254 26
+#define QNRI_BN254 0
+#define RIADZ_BN254 -1
+#define RIADZG2A_BN254 -1
+#define RIADZG2B_BN254 0
+#define TOWER_BN254 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_BN254 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_BN254CX.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_BN254CX.h
new file mode 100644
index 0000000..5a65df1
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_BN254CX.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_BN254CX_H
+#define CONFIG_FIELD_BN254CX_H
+
+#include"core.h"
+#include "config_big_B256_56.h"
+
+// FP stuff
+
+#define MBITS_BN254CX 254
+#define PM1D2_BN254CX 1
+#define MODTYPE_BN254CX NOT_SPECIAL
+#define MAXXES_BN254CX 26
+#define QNRI_BN254CX 0
+#define RIADZ_BN254CX -1
+#define RIADZG2A_BN254CX -1
+#define RIADZG2B_BN254CX 0
+#define TOWER_BN254CX NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_BN254CX 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_BN462.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_BN462.h
new file mode 100644
index 0000000..8210e2f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_BN462.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_BN462_H
+#define CONFIG_FIELD_BN462_H
+
+#include"core.h"
+#include "config_big_B464_60.h"
+
+// FP stuff
+
+#define MBITS_BN462 462
+#define PM1D2_BN462 1
+#define MODTYPE_BN462 NOT_SPECIAL
+#define MAXXES_BN462 18
+#define QNRI_BN462 1
+#define RIADZ_BN462 1
+#define RIADZG2A_BN462 1
+#define RIADZG2B_BN462 0
+#define TOWER_BN462 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_BN462 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_BRAINPOOL.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_BRAINPOOL.h
new file mode 100644
index 0000000..3747fb2
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_BRAINPOOL.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_BRAINPOOL_H
+#define CONFIG_FIELD_BRAINPOOL_H
+
+#include"core.h"
+#include "config_big_B256_56.h"
+
+// FP stuff
+
+#define MBITS_BRAINPOOL 256
+#define PM1D2_BRAINPOOL 1
+#define MODTYPE_BRAINPOOL NOT_SPECIAL
+#define MAXXES_BRAINPOOL 24
+#define QNRI_BRAINPOOL 0
+#define RIADZ_BRAINPOOL -3
+#define RIADZG2A_BRAINPOOL 0
+#define RIADZG2B_BRAINPOOL 0
+#define TOWER_BRAINPOOL NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_BRAINPOOL 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_C1174.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_C1174.h
new file mode 100644
index 0000000..c7386c8
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_C1174.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_C1174_H
+#define CONFIG_FIELD_C1174_H
+
+#include"core.h"
+#include "config_big_B256_56.h"
+
+// FP stuff
+
+#define MBITS_C1174 251
+#define PM1D2_C1174 1
+#define MODTYPE_C1174 PSEUDO_MERSENNE
+#define MAXXES_C1174 29
+#define QNRI_C1174 0
+#define RIADZ_C1174 0
+#define RIADZG2A_C1174 0
+#define RIADZG2B_C1174 0
+#define TOWER_C1174 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_C1174 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_C1665.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_C1665.h
new file mode 100644
index 0000000..3759646
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_C1665.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_C1665_H
+#define CONFIG_FIELD_C1665_H
+
+#include"core.h"
+#include "config_big_B168_60.h"
+
+// FP stuff
+
+#define MBITS_C1665 166
+#define PM1D2_C1665 1
+#define MODTYPE_C1665 PSEUDO_MERSENNE
+#define MAXXES_C1665 14
+#define QNRI_C1665 0
+#define RIADZ_C1665 0
+#define RIADZG2A_C1665 0
+#define RIADZG2B_C1665 0
+#define TOWER_C1665 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_C1665 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_C41417.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_C41417.h
new file mode 100644
index 0000000..4424809
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_C41417.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_C41417_H
+#define CONFIG_FIELD_C41417_H
+
+#include"core.h"
+#include "config_big_B416_60.h"
+
+// FP stuff
+
+#define MBITS_C41417 414
+#define PM1D2_C41417 1
+#define MODTYPE_C41417 PSEUDO_MERSENNE
+#define MAXXES_C41417 6
+#define QNRI_C41417 0
+#define RIADZ_C41417 1
+#define RIADZG2A_C41417 0
+#define RIADZG2B_C41417 0
+#define TOWER_C41417 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_C41417 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_F25519.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_F25519.h
new file mode 100644
index 0000000..0546ad7
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_F25519.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_F25519_H
+#define CONFIG_FIELD_F25519_H
+
+#include"core.h"
+#include "config_big_B256_56.h"
+
+// FP stuff
+
+#define MBITS_F25519 255
+#define PM1D2_F25519 2
+#define MODTYPE_F25519 PSEUDO_MERSENNE
+#define MAXXES_F25519 25
+#define QNRI_F25519 0
+#define RIADZ_F25519 2
+#define RIADZG2A_F25519 0
+#define RIADZG2B_F25519 0
+#define TOWER_F25519 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_F25519 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_F256PME.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_F256PME.h
new file mode 100644
index 0000000..721f005
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_F256PME.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_F256PME_H
+#define CONFIG_FIELD_F256PME_H
+
+#include"core.h"
+#include "config_big_B256_56.h"
+
+// FP stuff
+
+#define MBITS_F256PME 256
+#define PM1D2_F256PME 1
+#define MODTYPE_F256PME PSEUDO_MERSENNE
+#define MAXXES_F256PME 24
+#define QNRI_F256PME 0
+#define RIADZ_F256PME 0
+#define RIADZG2A_F256PME 0
+#define RIADZG2B_F256PME 0
+#define TOWER_F256PME NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_F256PME 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_F256PMW.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_F256PMW.h
new file mode 100644
index 0000000..16e7daa
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_F256PMW.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_F256PMW_H
+#define CONFIG_FIELD_F256PMW_H
+
+#include"core.h"
+#include "config_big_B256_56.h"
+
+// FP stuff
+
+#define MBITS_F256PMW 256
+#define PM1D2_F256PMW 1
+#define MODTYPE_F256PMW PSEUDO_MERSENNE
+#define MAXXES_F256PMW 24
+#define QNRI_F256PMW 0
+#define RIADZ_F256PMW 7
+#define RIADZG2A_F256PMW 0
+#define RIADZG2B_F256PMW 0
+#define TOWER_F256PMW NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_F256PMW 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_F384PM.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_F384PM.h
new file mode 100644
index 0000000..014d251
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_F384PM.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_F384PM_H
+#define CONFIG_FIELD_F384PM_H
+
+#include"core.h"
+#include "config_big_B384_58.h"
+
+// FP stuff
+
+#define MBITS_F384PM 384
+#define PM1D2_F384PM 1
+#define MODTYPE_F384PM PSEUDO_MERSENNE
+#define MAXXES_F384PM 22
+#define QNRI_F384PM 0
+#define RIADZ_F384PM 0
+#define RIADZG2A_F384PM 0
+#define RIADZG2B_F384PM 0
+#define TOWER_F384PM NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_F384PM 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_F448.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_F448.h
new file mode 100644
index 0000000..bd806f0
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_F448.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_F448_H
+#define CONFIG_FIELD_F448_H
+
+#include"core.h"
+#include "config_big_B448_58.h"
+
+// FP stuff
+
+#define MBITS_F448 448
+#define PM1D2_F448 1
+#define MODTYPE_F448 GENERALISED_MERSENNE
+#define MAXXES_F448 16
+#define QNRI_F448 0
+#define RIADZ_F448 0
+#define RIADZG2A_F448 0
+#define RIADZG2B_F448 0
+#define TOWER_F448 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_F448 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_F512PM.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_F512PM.h
new file mode 100644
index 0000000..b39db70
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_F512PM.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_F512PM_H
+#define CONFIG_FIELD_F512PM_H
+
+#include"core.h"
+#include "config_big_B512_60.h"
+
+// FP stuff
+
+#define MBITS_F512PM 512
+#define PM1D2_F512PM 1
+#define MODTYPE_F512PM PSEUDO_MERSENNE
+#define MAXXES_F512PM 28
+#define QNRI_F512PM 0
+#define RIADZ_F512PM 0
+#define RIADZG2A_F512PM 0
+#define RIADZG2B_F512PM 0
+#define TOWER_F512PM NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_F512PM 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_FP256BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_FP256BN.h
new file mode 100644
index 0000000..45a6bb5
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_FP256BN.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_FP256BN_H
+#define CONFIG_FIELD_FP256BN_H
+
+#include"core.h"
+#include "config_big_B256_56.h"
+
+// FP stuff
+
+#define MBITS_FP256BN 256
+#define PM1D2_FP256BN 1
+#define MODTYPE_FP256BN NOT_SPECIAL
+#define MAXXES_FP256BN 24
+#define QNRI_FP256BN 0
+#define RIADZ_FP256BN 1
+#define RIADZG2A_FP256BN 1
+#define RIADZG2B_FP256BN 0
+#define TOWER_FP256BN NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_FP256BN 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_FP512BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_FP512BN.h
new file mode 100644
index 0000000..33b9c78
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_FP512BN.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_FP512BN_H
+#define CONFIG_FIELD_FP512BN_H
+
+#include"core.h"
+#include "config_big_B512_60.h"
+
+// FP stuff
+
+#define MBITS_FP512BN 512
+#define PM1D2_FP512BN 1
+#define MODTYPE_FP512BN NOT_SPECIAL
+#define MAXXES_FP512BN 28
+#define QNRI_FP512BN 0
+#define RIADZ_FP512BN 1
+#define RIADZG2A_FP512BN 1
+#define RIADZG2B_FP512BN 0
+#define TOWER_FP512BN NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_FP512BN 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_HIFIVE.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_HIFIVE.h
new file mode 100644
index 0000000..b5ed2e7
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_HIFIVE.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_HIFIVE_H
+#define CONFIG_FIELD_HIFIVE_H
+
+#include"core.h"
+#include "config_big_B336_60.h"
+
+// FP stuff
+
+#define MBITS_HIFIVE 336
+#define PM1D2_HIFIVE 2
+#define MODTYPE_HIFIVE PSEUDO_MERSENNE
+#define MAXXES_HIFIVE 24
+#define QNRI_HIFIVE 0
+#define RIADZ_HIFIVE 1
+#define RIADZG2A_HIFIVE 0
+#define RIADZG2B_HIFIVE 0
+#define TOWER_HIFIVE NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_HIFIVE 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_JUBJUB.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_JUBJUB.h
new file mode 100644
index 0000000..e6a1450
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_JUBJUB.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_JUBJUB_H
+#define CONFIG_FIELD_JUBJUB_H
+
+#include"core.h"
+#include "config_big_B256_56.h"
+
+// FP stuff
+
+#define MBITS_JUBJUB 255
+#define PM1D2_JUBJUB 32
+#define MODTYPE_JUBJUB NOT_SPECIAL
+#define MAXXES_JUBJUB 25
+#define QNRI_JUBJUB 5
+#define RIADZ_JUBJUB 1
+#define RIADZG2A_JUBJUB 0
+#define RIADZG2B_JUBJUB 0
+#define TOWER_JUBJUB NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_JUBJUB 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_MDC.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_MDC.h
new file mode 100644
index 0000000..995ae7f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_MDC.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_MDC_H
+#define CONFIG_FIELD_MDC_H
+
+#include"core.h"
+#include "config_big_B256_56.h"
+
+// FP stuff
+
+#define MBITS_MDC 256
+#define PM1D2_MDC 1
+#define MODTYPE_MDC NOT_SPECIAL
+#define MAXXES_MDC 24
+#define QNRI_MDC 0
+#define RIADZ_MDC 0
+#define RIADZG2A_MDC 0
+#define RIADZG2B_MDC 0
+#define TOWER_MDC NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_MDC 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_NIST256.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_NIST256.h
new file mode 100644
index 0000000..0923d5d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_NIST256.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_NIST256_H
+#define CONFIG_FIELD_NIST256_H
+
+#include"core.h"
+#include "config_big_B256_56.h"
+
+// FP stuff
+
+#define MBITS_NIST256 256
+#define PM1D2_NIST256 1
+#define MODTYPE_NIST256 NOT_SPECIAL
+#define MAXXES_NIST256 24
+#define QNRI_NIST256 0
+#define RIADZ_NIST256 -10
+#define RIADZG2A_NIST256 0
+#define RIADZG2B_NIST256 0
+#define TOWER_NIST256 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_NIST256 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_NIST384.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_NIST384.h
new file mode 100644
index 0000000..d3c7219
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_NIST384.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_NIST384_H
+#define CONFIG_FIELD_NIST384_H
+
+#include"core.h"
+#include "config_big_B384_56.h"
+
+// FP stuff
+
+#define MBITS_NIST384 384
+#define PM1D2_NIST384 1
+#define MODTYPE_NIST384 NOT_SPECIAL
+#define MAXXES_NIST384 8
+#define QNRI_NIST384 0
+#define RIADZ_NIST384 -12
+#define RIADZG2A_NIST384 0
+#define RIADZG2B_NIST384 0
+#define TOWER_NIST384 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_NIST384 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_NIST521.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_NIST521.h
new file mode 100644
index 0000000..b89d9ac
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_NIST521.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_NIST521_H
+#define CONFIG_FIELD_NIST521_H
+
+#include"core.h"
+#include "config_big_B528_60.h"
+
+// FP stuff
+
+#define MBITS_NIST521 521
+#define PM1D2_NIST521 1
+#define MODTYPE_NIST521 PSEUDO_MERSENNE
+#define MAXXES_NIST521 19
+#define QNRI_NIST521 0
+#define RIADZ_NIST521 -4
+#define RIADZG2A_NIST521 0
+#define RIADZG2B_NIST521 0
+#define TOWER_NIST521 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_NIST521 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_SECP160R1.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_SECP160R1.h
new file mode 100644
index 0000000..e32db36
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_SECP160R1.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_SECP160R1_H
+#define CONFIG_FIELD_SECP160R1_H
+
+#include"core.h"
+#include "config_big_B160_56.h"
+
+// FP stuff
+
+#define MBITS_SECP160R1 160
+#define PM1D2_SECP160R1 1
+#define MODTYPE_SECP160R1 NOT_SPECIAL
+#define MAXXES_SECP160R1 8
+#define QNRI_SECP160R1 0
+#define RIADZ_SECP160R1 3
+#define RIADZG2A_SECP160R1 0
+#define RIADZG2B_SECP160R1 0
+#define TOWER_SECP160R1 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_SECP160R1 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_SECP256K1.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_SECP256K1.h
new file mode 100644
index 0000000..5efff7a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_SECP256K1.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_SECP256K1_H
+#define CONFIG_FIELD_SECP256K1_H
+
+#include"core.h"
+#include "config_big_B256_56.h"
+
+// FP stuff
+
+#define MBITS_SECP256K1 256
+#define PM1D2_SECP256K1 1
+#define MODTYPE_SECP256K1 NOT_SPECIAL
+#define MAXXES_SECP256K1 24
+#define QNRI_SECP256K1 0
+#define RIADZ_SECP256K1 -11
+#define RIADZG2A_SECP256K1 0
+#define RIADZG2B_SECP256K1 0
+#define TOWER_SECP256K1 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_SECP256K1 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_SM2.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_SM2.h
new file mode 100644
index 0000000..951875f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_SM2.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_SM2_H
+#define CONFIG_FIELD_SM2_H
+
+#include"core.h"
+#include "config_big_B256_56.h"
+
+// FP stuff
+
+#define MBITS_SM2 256
+#define PM1D2_SM2 1
+#define MODTYPE_SM2 NOT_SPECIAL
+#define MAXXES_SM2 24
+#define QNRI_SM2 0
+#define RIADZ_SM2 -9
+#define RIADZG2A_SM2 0
+#define RIADZG2B_SM2 0
+#define TOWER_SM2 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_SM2 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_TWEEDLEDEE.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_TWEEDLEDEE.h
new file mode 100644
index 0000000..a29cb68
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_TWEEDLEDEE.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_TWEEDLEDEE_H
+#define CONFIG_FIELD_TWEEDLEDEE_H
+
+#include"core.h"
+#include "config_big_B256_56.h"
+
+// FP stuff
+
+#define MBITS_TWEEDLEDEE 255
+#define PM1D2_TWEEDLEDEE 34
+#define MODTYPE_TWEEDLEDEE NOT_SPECIAL
+#define MAXXES_TWEEDLEDEE 25
+#define QNRI_TWEEDLEDEE 5
+#define RIADZ_TWEEDLEDEE 1
+#define RIADZG2A_TWEEDLEDEE 0
+#define RIADZG2B_TWEEDLEDEE 0
+#define TOWER_TWEEDLEDEE NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_TWEEDLEDEE 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_TWEEDLEDUM.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_TWEEDLEDUM.h
new file mode 100644
index 0000000..68a6689
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/config_field_TWEEDLEDUM.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_TWEEDLEDUM_H
+#define CONFIG_FIELD_TWEEDLEDUM_H
+
+#include"core.h"
+#include "config_big_B256_56.h"
+
+// FP stuff
+
+#define MBITS_TWEEDLEDUM 255
+#define PM1D2_TWEEDLEDUM 33
+#define MODTYPE_TWEEDLEDUM NOT_SPECIAL
+#define MAXXES_TWEEDLEDUM 25
+#define QNRI_TWEEDLEDUM 5
+#define RIADZ_TWEEDLEDUM 1
+#define RIADZG2A_TWEEDLEDUM 0
+#define RIADZG2B_TWEEDLEDUM 0
+#define TOWER_TWEEDLEDUM NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_TWEEDLEDUM 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/core.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/core.h
new file mode 100644
index 0000000..a829258
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/core.h
@@ -0,0 +1,860 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CORE_H
+#define CORE_H
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <stdbool.h>
+#include <stdint.h>
+#include "arch.h"
+
+namespace core {
+
+//#define CORE_ARDUINO
+
+/* modulus types */
+
+#define NOT_SPECIAL 0	       /**< Modulus of no exploitable form */
+#define PSEUDO_MERSENNE 1      /**< Pseudo-mersenne modulus of form $2^n-c$  */
+#define MONTGOMERY_FRIENDLY 3  /**< Montgomery Friendly modulus of form $2^a(2^b-c)-1$  */
+#define GENERALISED_MERSENNE 2 /**< Generalised-mersenne modulus of form $2^n-2^m-1$, Ed448 only */
+
+/* Curve types */
+
+#define WEIERSTRASS 0 /**< Short Weierstrass form curve  */
+#define EDWARDS 1     /**< Edwards or Twisted Edwards curve  */
+#define MONTGOMERY 2  /**< Montgomery form curve  */
+
+/* Pairing-Friendly types */
+
+#define NOT_PF 0
+#define BN_CURVE 1
+#define BLS12_CURVE 2
+#define BLS24_CURVE 3
+#define BLS48_CURVE 4
+
+#define D_TYPE 0
+#define M_TYPE 1
+
+#define FP_ZILCH 0			// 0
+#define FP_UNITY 1			// 1
+#define FP_SPARSEST 2		// [[AB][c0][00]]
+#define FP_SPARSER 3		// [[AB][C0][00]]
+#define FP_SPARSE 4			// [[AB][CD][E0]]
+#define FP_DENSE 5			// [[AB][CD][EF]]
+
+#define NEGATOWER 0			// Extension field tower type
+#define POSITOWER 1
+
+/**
+ * @brief SHA256 hash function instance */
+typedef struct
+{
+    unsign32 length[2]; /**< 64-bit input length */
+    unsign32 h[8];      /**< Internal state */
+    unsign32 w[64];	/**< Internal state */
+    int hlen;		/**< Hash length in bytes */
+} hash256;
+
+/**
+ * @brief SHA384-512 hash function instance */
+typedef struct
+{
+    unsign64 length[2]; /**< 64-bit input length */
+    unsign64 h[8];      /**< Internal state */
+    unsign64 w[80];	/**< Internal state */
+    int hlen;           /**< Hash length in bytes */
+} hash512;
+
+/**
+ * @brief SHA384 hash function instance */
+typedef hash512 hash384;
+
+/**
+ * @brief SHA3 hash function instance */
+typedef struct {
+    int length;
+    unsign64 S[25];
+    int rate, len;
+} sha3;
+
+#define MC_SHA2 2
+#define MC_SHA3 3
+
+#define SHA256 32 /**< SHA-256 hashing */
+#define SHA384 48 /**< SHA-384 hashing */
+#define SHA512 64 /**< SHA-512 hashing */
+
+#define SHA3_HASH224 28 /**< SHA3 224 bit hash */
+#define SHA3_HASH256 32 /**< SHA3 256 bit hash */
+#define SHA3_HASH384 48 /**< SHA3 384 bit hash */
+#define SHA3_HASH512 64 /**< SHA3 512 bit hash */
+
+#define SHAKE128 16 /**< SHAKE128   hash */
+#define SHAKE256 32 /**< SHAKE256   hash */
+
+/* Symmetric Encryption AES structure */
+
+#define ECB   0  /**< Electronic Code Book */
+#define CBC   1  /**< Cipher Block Chaining */
+#define CFB1  2  /**< Cipher Feedback - 1 byte */
+#define CFB2  3  /**< Cipher Feedback - 2 bytes */
+#define CFB4  5  /**< Cipher Feedback - 4 bytes */
+#define OFB1  14 /**< Output Feedback - 1 byte */
+#define OFB2  15 /**< Output Feedback - 2 bytes */
+#define OFB4  17 /**< Output Feedback - 4 bytes */
+#define OFB8  21 /**< Output Feedback - 8 bytes */
+#define OFB16 29 /**< Output Feedback - 16 bytes */
+#define CTR1  30 /**< Counter Mode - 1 byte */
+#define CTR2  31 /**< Counter Mode - 2 bytes */
+#define CTR4  33 /**< Counter Mode - 4 bytes */
+#define CTR8  37 /**< Counter Mode - 8 bytes */
+#define CTR16 45 /**< Counter Mode - 16 bytes */
+
+#define uchar unsigned char  /**<  Unsigned char */
+
+/**
+	@brief AES instance
+*/
+
+
+typedef struct
+{
+    int Nk;            /**< AES Key Length */
+    int Nr;            /**< AES Number of rounds */
+    int mode;          /**< AES mode of operation */
+    unsign32 fkey[60]; /**< subkeys for encrypton */
+    unsign32 rkey[60]; /**< subkeys for decrypton */
+    char f[16];        /**< buffer for chaining vector */
+} aes;
+
+/* AES-GCM suppport.  */
+
+#define GCM_ACCEPTING_HEADER 0   /**< GCM status */
+#define GCM_ACCEPTING_CIPHER 1   /**< GCM status */
+#define GCM_NOT_ACCEPTING_MORE 2 /**< GCM status */
+#define GCM_FINISHED 3           /**< GCM status */
+#define GCM_ENCRYPTING 0         /**< GCM mode */
+#define GCM_DECRYPTING 1         /**< GCM mode */
+
+
+/**
+	@brief GCM mode instance, using AES internally
+*/
+
+typedef struct
+{
+    unsign32 table[128][4]; /**< 2k byte table */
+    uchar stateX[16];	    /**< GCM Internal State */
+    uchar Y_0[16];	    /**< GCM Internal State */
+    unsign32 lenA[2];	    /**< GCM 64-bit length of header */
+    unsign32 lenC[2];	    /**< GCM 64-bit length of ciphertext */
+    int status;		    /**< GCM Status */
+    aes a;		    /**< Internal Instance of aes cipher */
+} gcm;
+
+/* Marsaglia & Zaman Random number generator constants */
+
+#define NK   21 /**< PRNG constant */
+#define NJ   6  /**< PRNG constant */
+#define NV   8  /**< PRNG constant */
+
+
+/**
+	@brief Cryptographically secure pseudo-random number generator instance
+*/
+
+typedef struct
+{
+    unsign32 ira[NK]; /**< random number array   */
+    int      rndptr;  /**< pointer into array */
+    unsign32 borrow;  /**<  borrow as a result of subtraction */
+    int pool_ptr;     /**< pointer into random pool */
+    char pool[32];    /**< random pool */
+} csprng;
+
+
+/**
+	@brief Portable representation of a big positive number
+*/
+
+typedef struct
+{
+    int len;   /**< length in bytes  */
+    int max;   /**< max length allowed - enforce truncation  */
+    char *val; /**< byte array  */
+} octet;
+
+/**
+ * @brief Share instance */
+typedef struct
+{
+    int id;  /**< Unique Share ID */
+    int nsr; /**< number of shares required */
+    octet *B; /**< share as octet */
+} share;
+
+/* Octet string handlers */
+/**	@brief Formats and outputs an octet to the console in hex
+ *
+	@param O Octet to be output
+ */
+extern void OCT_output(octet *O);
+/**	@brief Formats and outputs an octet to the console as a character string
+ *
+	@param O Octet to be output
+ */
+extern void OCT_output_string(octet *O);
+/**	@brief Wipe clean an octet
+ *
+	@param O Octet to be cleaned
+ */
+extern void OCT_clear(octet *O);
+
+/**	@brief Reverse bytes in an octet
+ *
+	@param O Octet to be reversed
+ */
+extern void OCT_reverse(octet *O);
+
+/**	@brief Compare two octets
+ *
+	@param O first Octet to be compared
+	@param P second Octet to be compared
+	@return 1 if equal, else 0
+ */
+extern int  OCT_comp(octet *O, octet *P);
+
+
+/**	@brief Compare first n bytes of two octets
+ *
+	@param O first Octet to be compared
+	@param P second Octet to be compared
+	@param n number of bytes to compare
+	@return 1 if equal, else 0
+ */
+extern int  OCT_ncomp(octet *O, octet *P, int n);
+/**	@brief Join from a C string to end of an octet
+ *
+	Truncates if there is no room
+	@param O Octet to be written to
+	@param s zero terminated string to be joined to octet
+ */
+extern void OCT_jstring(octet *O, char *s);
+/**	@brief Join bytes to end of an octet
+ *
+	Truncates if there is no room
+	@param O Octet to be written to
+	@param s bytes to be joined to end of octet
+	@param n number of bytes to join
+ */
+extern void OCT_jbytes(octet *O, char *s, int n);
+/**	@brief Join single byte to end of an octet, repeated n times
+ *
+	Truncates if there is no room
+	@param O Octet to be written to
+	@param b byte to be joined to end of octet
+	@param n number of times b is to be joined
+ */
+extern void OCT_jbyte(octet *O, int b, int n);
+/**	@brief Join one octet to the end of another
+ *
+	Truncates if there is no room
+	@param O Octet to be written to
+	@param P Octet to be joined to the end of O
+ */
+extern void OCT_joctet(octet *O, octet *P);
+/**	@brief XOR common bytes of a pair of Octets
+ *
+	@param O Octet - on exit = O xor P
+	@param P Octet to be xored into O
+ */
+extern void OCT_xor(octet *O, octet *P);
+/**	@brief reset Octet to zero length
+ *
+	@param O Octet to be emptied
+ */
+extern void OCT_empty(octet *O);
+/**	@brief Pad out an Octet to the given length
+ *
+	Padding is done by inserting leading zeros, so abcd becomes 00abcd
+	@param O Octet to be padded
+	@param n new length of Octet
+ */
+extern int OCT_pad(octet *O, int n);
+/**	@brief Convert an Octet to printable base64 number
+ *
+	@param b zero terminated byte array to take base64 conversion
+	@param O Octet to be converted
+ */
+extern void OCT_tobase64(char *b, octet *O);
+/**	@brief Populate an Octet from base64 number
+ *
+ 	@param O Octet to be populated
+	@param b zero terminated base64 string
+
+ */
+extern void OCT_frombase64(octet *O, char *b);
+/**	@brief Copy one Octet into another
+ *
+ 	@param O Octet to be copied to
+	@param P Octet to be copied from
+
+ */
+extern void OCT_copy(octet *O, octet *P);
+/**	@brief XOR every byte of an octet with input m
+ *
+ 	@param O Octet
+	@param m byte to be XORed with every byte of O
+
+ */
+extern void OCT_xorbyte(octet *O, int m);
+/**	@brief Chops Octet into two, leaving first n bytes in O, moving the rest to P
+ *
+ 	@param O Octet to be chopped
+	@param P new Octet to be created
+	@param n number of bytes to chop off O
+
+ */
+extern void OCT_chop(octet *O, octet *P, int n);
+/**	@brief Join n bytes of integer m to end of Octet O (big endian)
+ *
+	Typically n is 4 for a 32-bit integer
+ 	@param O Octet to be appended to
+	@param m integer to be appended to O
+	@param n number of bytes in m
+
+ */
+extern void OCT_jint(octet *O, unsigned int m, int n);
+/**	@brief Create an Octet from bytes taken from a random number generator
+ *
+	Truncates if there is no room
+ 	@param O Octet to be populated
+	@param R an instance of a Cryptographically Secure Random Number Generator
+	@param n number of bytes to extracted from R
+
+ */
+extern void OCT_rand(octet *O, csprng *R, int n);
+/**	@brief Shifts Octet left by n bytes
+ *
+	Leftmost bytes disappear
+ 	@param O Octet to be shifted
+	@param n number of bytes to shift
+
+ */
+extern void OCT_shl(octet *O, int n);
+/**	@brief Convert a hex number to an Octet
+ *
+	@param dst Octet
+	@param src Hex string to be converted
+ */
+extern void OCT_fromHex(octet *dst, char *src);
+/**	@brief Convert an Octet to printable hex number
+ *
+	@param dst hex value
+	@param src Octet to be converted
+ */
+extern void OCT_toHex(octet *src, char *dst);
+/**	@brief Convert an Octet to string
+ *
+	@param dst string value
+	@param src Octet to be converted
+ */
+extern void OCT_toStr(octet *src, char *dst);
+
+
+
+/* Hash function */
+/**	@brief Initialise an instance of SHA256
+ *
+	@param H an instance SHA256
+ */
+extern void HASH256_init(hash256 *H);
+/**	@brief Add a byte to the hash
+ *
+	@param H an instance SHA256
+	@param b byte to be included in hash
+ */
+extern void HASH256_process(hash256 *H, int b);
+/**	@brief Generate 32-byte final hash
+ *
+	@param H an instance SHA256
+	@param h is the output 32-byte hash
+ */
+extern void HASH256_hash(hash256 *H, char *h);
+
+/**	@brief Generate 32-byte intermediate hash
+ *
+	@param H an instance SHA256
+	@param h is the output 32-byte hash
+ */
+extern void HASH256_continuing_hash(hash256 *H, char *h);
+
+/**	@brief Initialise an instance of SHA384
+ *
+	@param H an instance SHA384
+ */
+extern void HASH384_init(hash384 *H);
+/**	@brief Add a byte to the hash
+ *
+	@param H an instance SHA384
+	@param b byte to be included in hash
+ */
+extern void HASH384_process(hash384 *H, int b);
+/**	@brief Generate 48-byte final hash
+ *
+	@param H an instance SHA384
+	@param h is the output 48-byte hash
+ */
+extern void HASH384_hash(hash384 *H, char *h);
+
+/**	@brief Generate 48-byte intermediate hash
+ *
+	@param H an instance SHA384
+	@param h is the output 48-byte hash
+ */
+extern void HASH384_continuing_hash(hash384 *H, char *h);
+
+/**	@brief Initialise an instance of SHA512
+ *
+	@param H an instance SHA512
+ */
+extern void HASH512_init(hash512 *H);
+/**	@brief Add a byte to the hash
+ *
+	@param H an instance SHA512
+	@param b byte to be included in hash
+ */
+extern void HASH512_process(hash512 *H, int b);
+/**	@brief Generate 64-byte final hash
+ *
+	@param H an instance SHA512
+	@param h is the output 64-byte hash
+ */
+extern void HASH512_hash(hash512 *H, char *h);
+
+/**	@brief Generate 64-byte intermediate hash
+ *
+	@param H an instance SHA512
+	@param h is the output 64-byte hash
+ */
+extern void HASH512_continuing_hash(hash512 *H, char *h);
+
+/**	@brief Initialise an instance of SHA3
+ *
+	@param H an instance SHA3
+	@param t the instance type
+ */
+extern void  SHA3_init(sha3 *H, int t);
+/**	@brief process a byte for SHA3
+ *
+	@param H an instance SHA3
+	@param b a byte of date to be processed
+ */
+extern void  SHA3_process(sha3 *H, int b);
+/**	@brief create fixed length final hash output of SHA3
+ *
+	@param H an instance SHA3
+	@param h a byte array to take hash
+ */
+extern void  SHA3_hash(sha3 *H, char *h);
+
+/**	@brief create fixed length intermediate hash output of SHA3
+ *
+	@param H an instance SHA3
+	@param h a byte array to take hash
+ */
+extern void  SHA3_continuing_hash(sha3 *H, char *h);
+
+/**	@brief create variable length final hash output of SHA3
+ *
+	@param H an instance SHA3
+	@param h a byte array to take hash
+	@param len is the length of the hash
+ */
+extern void  SHA3_shake(sha3 *H, char *h, int len);
+
+/**	@brief create variable length intermediate hash output of SHA3
+ *
+	@param H an instance SHA3
+	@param h a byte array to take hash
+	@param len is the length of the hash
+ */
+extern void  SHA3_continuing_shake(sha3 *H, char *h, int len);
+
+/**	@brief generate further hash output of SHA3
+ *
+	@param H an instance SHA3
+	@param h a byte array to take hash
+	@param len is the length of the hash
+ */
+extern void  SHA3_squeeze(sha3 *H, char *h, int len);
+
+/* MAC functions */
+
+/**	@brief General Purpose Hashing function
+ *
+    @param hash the hash family (SHA2 or SHA3)
+	@param hlen the hash function output length (32,48 or 64)
+	@param w an output octet
+    @param olen the output length
+    @param pad zero padding
+    @param p an input octet
+    @param n an input 32-bit integer
+    @param x an optional input octet
+ */
+extern void GPhash(int hash,int hlen,octet *w,int olen,int pad,octet *p,int n,octet *x);
+
+/**	@brief Simple purpose Hashing function
+ *
+    @param hash the hash family (SHA2 or SHA3)
+	@param hlen the hash function output length (32,48 or 64)
+	@param w an output octet
+    @param p an input octet
+ */
+extern void SPhash(int hash, int hlen,octet *w, octet *p);
+
+/**	@brief HMAC function
+ *
+	@param T an output tag
+    @param len the tag length
+    @param K an input key, or salt
+    @param M an input message
+    @param hash the hash family (SHA2 or SHA3)
+	@param hlen the hash function output length (32,48 or 64)
+ */
+extern void HMAC(int hash,int hlen,octet *T,int len,octet *K,octet *M);
+
+
+/**	@brief HKDF_Extract function
+ *
+    @param hash the hash family (SHA2 or SHA3)
+	@param hlen the hash function output length (32,48 or 64)
+	@param K an output Key
+    @param P public input salt
+    @param S raw secret keying material
+ */
+extern void HKDF_Extract(int hash,int hlen,octet *K,octet *P,octet *S);
+
+/**	@brief HKDF_Expand function
+ *
+    @param hash the hash family (SHA2 or SHA3)
+	@param hlen the hash function output length (32,48 or 64)
+	@param E an expanded output Key
+    @param olen is the desired length of the expanded key
+    @param K is the fixed length input key
+    @param I is public context information
+
+ */
+extern void HKDF_Expand(int hash,int hlen,octet *E,int olen,octet *K,octet *I);
+
+/**	@brief XOF_Expand function
+ *
+	@param hlen the SHA3 output length (16 or 32)
+	@param E an expanded messsage
+    @param olen is the desired length of the expanded key
+    @param P is Domain Separator
+    @param S input message
+
+ */
+extern void XOF_Expand(int hlen,octet *E,int olen,octet *P,octet *S);
+
+/**	@brief XOF_Expand function
+ *
+    @param hash the hash family (SHA2 or SHA3)
+	@param hlen the SHA3 output length (16 or 32)
+	@param E an expanded messsage
+    @param olen is the desired length of the expanded key
+    @param P is Domain Separator
+    @param S input message
+
+ */
+extern void XMD_Expand(int hash,int hlen,octet *E,int olen,octet *P,octet *S);
+
+
+/** @brief PKCS V1.5 padding of a message prior to RSA signature
+ *
+    @param h is the hash type
+    @param M is the input message
+    @param W is the output encoding, ready for RSA signature
+    @return 1 if OK, else 0
+ */
+extern int PKCS15(int h, octet *M, octet *W);
+
+/** @brief Alternative PKCS V1.5 padding of a message prior to RSA signature
+ *
+    @param h is the hash type
+    @param M is the input message
+    @param W is the output encoding, ready for RSA signature
+    @return 1 if OK, else 0
+ */
+extern int PKCS15b(int h, octet *M, octet *W);
+
+/** @brief PSS padding of a message prior to RSA signature
+ *
+    @param h is the hash type
+    @param M is the input message
+    @param R is a pointer to a cryptographically secure random number generator
+    @param W is the output encoding, ready for RSA signature
+    @return 1 if OK, else 0
+ */
+extern int PSS_ENCODE(int h, octet *M, csprng *R, octet *W);
+
+/** @brief PSS verification
+ *
+    @param h is the hash type
+    @param M is the message
+    @param W is the message encoding
+    @return 1 if OK, else 0
+ */
+extern int PSS_VERIFY(int h, octet *M, octet *W);
+
+
+/** @brief OAEP padding of a message prior to RSA encryption
+ *
+    @param h is the hash type
+    @param M is the input message
+    @param R is a pointer to a cryptographically secure random number generator
+    @param P are input encoding parameter string (could be NULL)
+    @param F is the output encoding, ready for RSA encryption
+    @return 1 if OK, else 0
+ */
+extern int  OAEP_ENCODE(int h, octet *M, csprng *R, octet *P, octet *F);
+/** @brief OAEP unpadding of a message after RSA decryption
+ *
+    Unpadding is done in-place
+    @param h is the hash type
+    @param P are input encoding parameter string (could be NULL)
+    @param F is input padded message, unpadded on output
+    @return 1 if OK, else 0
+ */
+extern int  OAEP_DECODE(int h, octet *P, octet *F);
+
+/**	@brief Key Derivation Function - generates key K from inputs Z and P
+ *
+	IEEE-1363 KDF2 Key Derivation Function. 
+	@param hash is the hash family (SHA2 or SHA3)
+    @param hlen the hash function output length (32,48 or 64)
+	@param Z input octet
+	@param P input key derivation parameters - can be NULL
+	@param len is output desired length of key
+	@param K is the derived key
+ */
+extern void KDF2(int hash, int hlen, octet *K, int len, octet *Z, octet *P);
+/**	@brief Password Based Key Derivation Function - generates key K from password, salt and repeat counter
+ *
+	PBKDF2 Password Based Key Derivation Function. 
+	@param hash is the hash family (SHA2 or SHA3)
+    @param hlen the hash function output length (32,48 or 64)
+	@param P input password
+	@param S input salt
+	@param rep Number of times to be iterated.
+	@param len is output desired length
+	@param K is the derived key
+ */
+extern void PBKDF2(int hash, int hlen, octet *K, int len, octet *P, octet *S, int rep);
+
+/* AES functions */
+/**	@brief Reset AES mode or IV
+ *
+	@param A an instance of the aes
+	@param m is the new active mode of operation (ECB, CBC, OFB, CFB etc)
+	@param iv the new Initialisation Vector
+ */
+extern void AES_reset(aes *A, int m, char *iv);
+/**	@brief Extract chaining vector from aes instance
+ *
+	@param A an instance of the aes
+	@param f the extracted chaining vector
+ */
+extern void AES_getreg(aes *A, char * f);
+/**	@brief Initialise an instance of aes and its mode of operation
+ *
+	@param A an instance aes
+	@param m is the active mode of operation (ECB, CBC, OFB, CFB etc)
+	@param n is the key length in bytes, 16, 24 or 32
+	@param k the AES key as an array of 16 bytes
+	@param iv the Initialisation Vector
+	@return 0 for invalid n
+ */
+extern int AES_init(aes *A, int m, int n, char *k, char *iv);
+/**	@brief Encrypt a single 16 byte block in ECB mode
+ *
+	@param A an instance of the aes
+	@param b is an array of 16 plaintext bytes, on exit becomes ciphertext
+ */
+extern void AES_ecb_encrypt(aes *A, uchar * b);
+/**	@brief Decrypt a single 16 byte block in ECB mode
+ *
+	@param A an instance of the aes
+	@param b is an array of 16 cipherext bytes, on exit becomes plaintext
+ */
+extern void AES_ecb_decrypt(aes *A, uchar * b);
+/**	@brief Encrypt a single 16 byte block in active mode
+ *
+	@param A an instance of the aes
+	@param b is an array of 16 plaintext bytes, on exit becomes ciphertext
+	@return 0, or overflow bytes from CFB mode
+ */
+extern unsign32 AES_encrypt(aes *A, char *b );
+/**	@brief Decrypt a single 16 byte block in active mode
+ *
+	@param A an instance of the aes
+	@param b is an array of 16 ciphertext bytes, on exit becomes plaintext
+	@return 0, or overflow bytes from CFB mode
+ */
+extern unsign32 AES_decrypt(aes *A, char *b);
+/**	@brief Clean up after application of AES
+ *
+	@param A an instance of the aes
+ */
+extern void AES_end(aes *A);
+
+/**	@brief AES encrypts a plaintext to a ciphtertext
+ *
+	IEEE-1363 AES_CBC_IV0_ENCRYPT function. Encrypts in CBC mode with a zero IV, padding as necessary to create a full final block.
+	@param K AES key
+	@param P input plaintext octet
+	@param C output ciphertext octet
+ */
+extern void AES_CBC_IV0_ENCRYPT(octet *K, octet *P, octet *C);
+/**	@brief AES encrypts a plaintext to a ciphtertext
+ *
+	IEEE-1363 AES_CBC_IV0_DECRYPT function. Decrypts in CBC mode with a zero IV.
+	@param K AES key
+	@param C input ciphertext octet
+	@param P output plaintext octet
+	@return 0 if bad input, else 1
+ */
+extern int AES_CBC_IV0_DECRYPT(octet *K, octet *C, octet *P);
+
+/* AES-GCM functions */
+/**	@brief Initialise an instance of AES-GCM mode
+ *
+	@param G an instance AES-GCM
+	@param nk is the key length in bytes, 16, 24 or 32
+	@param k the AES key as an array of 16 bytes
+	@param n the number of bytes in the Initialisation Vector (IV)
+	@param iv the IV
+ */
+extern void GCM_init(gcm *G, int nk, char *k, int n, char *iv);
+/**	@brief Add header (material to be authenticated but not encrypted)
+ *
+	Note that this function can be called any number of times with n a multiple of 16, and then one last time with any value for n
+	@param G an instance AES-GCM
+	@param b is the header material to be added
+	@param n the number of bytes in the header
+ */
+extern int GCM_add_header(gcm *G, char *b, int n);
+/**	@brief Add plaintext and extract ciphertext
+ *
+	Note that this function can be called any number of times with n a multiple of 16, and then one last time with any value for n
+	@param G an instance AES-GCM
+	@param c is the ciphertext generated
+	@param p is the plaintext material to be added
+	@param n the number of bytes in the plaintext
+ */
+extern int GCM_add_plain(gcm *G, char *c, char *p, int n);
+/**	@brief Add ciphertext and extract plaintext
+ *
+	Note that this function can be called any number of times with n a multiple of 16, and then one last time with any value for n
+	@param G an instance AES-GCM
+	@param p is the plaintext generated
+	@param c is the ciphertext material to be added
+	@param n the number of bytes in the ciphertext
+ */
+extern int GCM_add_cipher(gcm *G, char *p, char *c, int n);
+/**	@brief Finish off and extract authentication tag (HMAC)
+ *
+	@param G is an active instance AES-GCM
+	@param t is the output 16 byte authentication tag
+ */
+extern void GCM_finish(gcm *G, char *t);
+
+/**	@brief AES-GCM Encryption
+ *
+	@param K  AES key
+	@param IV Initialization vector
+	@param H Header
+	@param P Plaintext
+	@param C Ciphertext
+	@param T Checksum
+ */
+void AES_GCM_ENCRYPT(octet *K, octet *IV, octet *H, octet *P, octet *C, octet *T);
+
+/**	@brief AES-GCM Decryption
+ *
+	@param K  AES key
+	@param IV Initialization vector
+	@param H Header
+	@param P Plaintext
+	@param C Ciphertext
+	@param T Checksum
+ */
+void AES_GCM_DECRYPT(octet *K, octet *IV, octet *H, octet *C, octet *P, octet *T);
+
+
+/* secret sharing */
+
+/**	@brief Get a share of a message
+ *
+    @param id unique share ID
+    @param nsr number of shares needed for message recovery
+    @param S the output share as an octet
+    @param M the Message octet to be shared
+	@param R an octet of random seed bytes
+	@return a share structure
+
+ */
+extern share getshare(int id,int nsr,octet *S,octet *M,octet *R);
+/**	@brief Recover message from shares
+ *
+    @param M the recovered Message octet
+    @param S an array of sufficient shares
+    @return 0 on success else -1
+ */
+extern int recover(octet *M,share *S);
+
+/* random numbers */
+/**	@brief Seed a random number generator from an array of bytes
+ *
+	The provided seed should be truly random
+	@param R an instance of a Cryptographically Secure Random Number Generator
+	@param n the number of seed bytes provided
+	@param b an array of seed bytes
+
+ */
+extern void RAND_seed(csprng *R, int n, char *b);
+/**	@brief Delete all internal state of a random number generator
+ *
+	@param R an instance of a Cryptographically Secure Random Number Generator
+ */
+extern void RAND_clean(csprng *R);
+/**	@brief Return a random byte from a random number generator
+ *
+	@param R an instance of a Cryptographically Secure Random Number Generator
+	@return a random byte
+ */
+extern int RAND_byte(csprng *R);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/dilithium.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/dilithium.cpp
new file mode 100644
index 0000000..dfa9849
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/dilithium.cpp
@@ -0,0 +1,1224 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* Dilithium API implementation. Constant time where it matters. Spends nearly all of its time running SHA3. Small.
+
+The Matrix A is calculated on-the-fly to keep memory requirement minimal
+Note that 
+1. A precalculated A can be included in the public key, for use by signature and verification (which blows up public key size)
+2. Precalculating A for signature calculation means that the A does not have to re-calculated for each attempt to find a good signature
+
+Might be simpler to wait for hardware support for SHA3 before attempting further optimization!
+
+   M.Scott 30/09/2021
+*/
+
+#include "dilithium.h"
+
+using namespace core;
+
+#define round(a,b) (((a)+((b)/2))/(b))
+
+// parameters for each security level
+// tau,gamma1,gamma2,K,L,eta,lg(2*eta+1),omega
+const int PARAMS_2[8]={39,17,88,4,4,2,3,80};
+const int PARAMS_3[8]={49,19,32,6,5,4,4,55};
+const int PARAMS_5[8]={60,19,32,8,7,2,3,75};
+
+const sign32 roots[] = {0x3ffe00,0x64f7,0x581103,0x77f504,0x39e44,0x740119,0x728129,0x71e24,0x1bde2b,0x23e92b,0x7a64ae,0x5ff480,0x2f9a75,0x53db0a,0x2f7a49,0x28e527,0x299658,0xfa070,0x6f65a5,0x36b788,0x777d91,0x6ecaa1,0x27f968,0x5fb37c,0x5f8dd7,0x44fae8,0x6a84f8,0x4ddc99,0x1ad035,0x7f9423,0x3d3201,0x445c5,0x294a67,0x17620,0x2ef4cd,0x35dec5,0x668504,0x49102d,0x5927d5,0x3bbeaf,0x44f586,0x516e7d,0x368a96,0x541e42,0x360400,0x7b4a4e,0x23d69c,0x77a55e,0x65f23e,0x66cad7,0x357e1e,0x458f5a,0x35843f,0x5f3618,0x67745d,0x38738c,0xc63a8,0x81b9a,0xe8f76,0x3b3853,0x3b8534,0x58dc31,0x1f9d54,0x552f2e,0x43e6e6,0x688c82,0x47c1d0,0x51781a,0x69b65e,0x3509ee,0x2135c7,0x67afbc,0x6caf76,0x1d9772,0x419073,0x709cf7,0x4f3281,0x4fb2af,0x4870e1,0x1efca,0x3410f2,0x70de86,0x20c638,0x296e9f,0x5297a4,0x47844c,0x799a6e,0x5a140a,0x75a283,0x6d2114,0x7f863c,0x6be9f8,0x7a0bde,0x1495d4,0x1c4563,0x6a0c63,0x4cdbea,0x40af0,0x7c417,0x2f4588,0xad00,0x6f16bf,0xdcd44,0x3c675a,0x470bcb,0x7fbe7f,0x193948,0x4e49c1,0x24756c,0x7ca7e0,0xb98a1,0x6bc809,0x2e46c,0x49a809,0x3036c2,0x639ff7,0x5b1c94,0x7d2ae1,0x141305,0x147792,0x139e25,0x67b0e1,0x737945,0x69e803,0x51cea3,0x44a79d,0x488058,0x3a97d9,0x1fea93,0x33ff5a,0x2358d4,0x3a41f8,0x4cdf73,0x223dfb,0x5a8ba0,0x498423,0x412f5,0x252587,0x6d04f1,0x359b5d,0x4a28a1,0x4682fd,0x6d9b57,0x4f25df,0xdbe5e,0x1c5e1a,0xde0e6,0xc7f5a,0x78f83,0x67428b,0x7f3705,0x77e6fd,0x75e022,0x503af7,0x1f0084,0x30ef86,0x49997e,0x77dcd7,0x742593,0x4901c3,0x53919,0x4610c,0x5aad42,0x3eb01b,0x3472e7,0x4ce03c,0x1a7cc7,0x31924,0x2b5ee5,0x291199,0x585a3b,0x134d71,0x3de11c,0x130984,0x25f051,0x185a46,0x466519,0x1314be,0x283891,0x49bb91,0x52308a,0x1c853f,0x1d0b4b,0x6fd6a7,0x6b88bf,0x12e11b,0x4d3e3f,0x6a0d30,0x78fde5,0x1406c7,0x327283,0x61ed6f,0x6c5954,0x1d4099,0x590579,0x6ae5ae,0x16e405,0xbdbe7,0x221de8,0x33f8cf,0x779935,0x54aa0d,0x665ff9,0x63b158,0x58711c,0x470c13,0x910d8,0x463e20,0x612659,0x251d8b,0x2573b7,0x7d5c90,0x1ddd98,0x336898,0x2d4bb,0x6d73a8,0x4f4cbf,0x27c1c,0x18aa08,0x2dfd71,0xc5ca5,0x19379a,0x478168,0x646c3e,0x51813d,0x35c539,0x3b0115,0x41dc0,0x21c4f7,0x70fbf5,0x1a35e7,0x7340e,0x795d46,0x1a4cd0,0x645caf,0x1d2668,0x666e99,0x6f0634,0x7be5db,0x455fdc,0x530765,0x5dc1b0,0x7973de,0x5cfd0a,0x2cc93,0x70f806,0x189c2a,0x49c5aa,0x776a51,0x3bcf2c,0x7f234f,0x6b16e0,0x3c15ca,0x155e68,0x72f6b7,0x1e29ce};
+const sign32 iroots[] = {0x3ffe00,0x7f7b0a,0x7eafd,0x27cefe,0x78c1dd,0xd5ed8,0xbdee8,0x7c41bd,0x56fada,0x5065b8,0x2c04f7,0x50458c,0x1feb81,0x57b53,0x5bf6d6,0x6401d6,0x7b9a3c,0x42ae00,0x4bde,0x650fcc,0x320368,0x155b09,0x3ae519,0x20522a,0x202c85,0x57e699,0x111560,0x86270,0x492879,0x107a5c,0x703f91,0x5649a9,0x2ab0d3,0x6042ad,0x2703d0,0x445acd,0x44a7ae,0x71508b,0x77c467,0x737c59,0x476c75,0x186ba4,0x20a9e9,0x4a5bc2,0x3a50a7,0x4a61e3,0x19152a,0x19edc3,0x83aa3,0x5c0965,0x495b3,0x49dc01,0x2bc1bf,0x49556b,0x2e7184,0x3aea7b,0x442152,0x26b82c,0x36cfd4,0x195afd,0x4a013c,0x50eb34,0x7e69e1,0x56959a,0x454828,0x375fa9,0x3b3864,0x2e115e,0x15f7fe,0xc66bc,0x182f20,0x6c41dc,0x6b686f,0x6bccfc,0x2b520,0x24c36d,0x1c400a,0x4fa93f,0x3637f8,0x7cfb95,0x1417f8,0x744760,0x33821,0x5b6a95,0x319640,0x66a6b9,0x2182,0x38d436,0x4378a7,0x7212bd,0x10c942,0x7f3301,0x509a79,0x781bea,0x7bd511,0x330417,0x15d39e,0x639a9e,0x6b4a2d,0x5d423,0x13f609,0x59c5,0x12beed,0xa3d7e,0x25cbf7,0x64593,0x385bb5,0x2d485d,0x567162,0x5f19c9,0xf017b,0x4bcf0f,0x7df037,0x376f20,0x302d52,0x30ad80,0xf430a,0x3e4f8e,0x62488f,0x13308b,0x183045,0x5eaa3a,0x4ad613,0x1629a3,0x2e67e7,0x381e31,0x17537f,0x3bf91b,0x61b633,0xce94a,0x6a8199,0x43ca37,0x14c921,0xbcb2,0x4410d5,0x875b0,0x361a57,0x6743d7,0xee7fb,0x7d136e,0x22e2f7,0x66c23,0x221e51,0x2cd89c,0x3a8025,0x3fa26,0x10d9cd,0x197168,0x62b999,0x1b8352,0x659331,0x682bb,0x78abf3,0x65aa1a,0xee40c,0x5e1b0a,0x7bc241,0x44deec,0x4a1ac8,0x2e5ec4,0x1b73c3,0x385e99,0x66a867,0x73835c,0x51e290,0x6735f9,0x7d63e5,0x309342,0x126c59,0x7d0b46,0x4c7769,0x620269,0x28371,0x5a6c4a,0x5ac276,0x1eb9a8,0x39a1e1,0x76cf29,0x38d3ee,0x276ee5,0x1c2ea9,0x198008,0x2b35f4,0x846cc,0x4be732,0x5dc219,0x74041a,0x68fbfc,0x14fa53,0x26da88,0x629f68,0x1386ad,0x1df292,0x4d6d7e,0x6bd93a,0x6e21c,0x15d2d1,0x32a1c2,0x6cfee6,0x145742,0x10095a,0x62d4b6,0x635ac2,0x2daf77,0x362470,0x57a770,0x6ccb43,0x397ae8,0x6785bb,0x59efb0,0x6cd67d,0x41fee5,0x6c9290,0x2785c6,0x56ce68,0x54811c,0x7cc6dd,0x65633a,0x32ffc5,0x4b6d1a,0x412fe6,0x2532bf,0x7b7ef5,0x7aa6e8,0x36de3e,0xbba6e,0x8032a,0x364683,0x4ef07b,0x60df7d,0x2fa50a,0x9ffdf,0x7f904,0xa8fc,0x189d76,0x78507e,0x7360a7,0x71ff1b,0x6381e7,0x7221a3,0x30ba22,0x1244aa,0x395d04,0x35b760,0x4a44a4,0x12db10,0x5aba7a,0x7bcd0c,0x365bde,0x255461,0x5da206,0x33008e,0x459e09,0x5c872d,0x4be0a7,0x5ff56e};
+
+/* Montgomery stuff */
+
+static sign32 redc(unsign64 T)
+{
+    unsign32 m = (unsign32)T * (unsign32)DL_ND;
+    return ((unsign64)m * DL_PRIME + T) >> 32;
+}
+
+static sign32 nres(unsign32 x)
+{
+    return redc((unsign64)x * DL_R2MODP);
+}
+
+static sign32 modmul(unsign32 a, unsign32 b)
+{
+    return redc((unsign64)a * b);
+}
+
+// make all elements +ve
+static void poly_pos(sign32 *p)
+{
+    int i;
+    for (i=0;i<DL_DEGREE;i++)
+        p[i]+=(p[i]>>31)&DL_PRIME; 
+}
+
+// NTT code
+
+// Important!
+// nres(x); ntt(x)
+// nres(y); ntt(y)
+// z=x*y
+// intt(z);
+// redc(z);
+
+// is equivalent to (note that nres() and redc() cancel out)
+
+// ntt(x);
+// nres(y); ntt(y);
+// z=x*y
+// intt(z)
+
+// is equivalent to
+
+// ntt(x)
+// ntt(y)
+// z=x*y
+// intt(z)
+// nres(z)
+
+// In all cases z ends up in normal (non-Montgomery) form!
+// So the conversion to Montgomery form can be "pushed" through the calculation.
+
+// Here intt(z) <- intt(z);nres(z); 
+// Combining is more efficient
+// note that ntt() and intt() are not mutually inverse
+
+/* NTT code */
+/* Cooley-Tukey NTT */
+/* Excess of 2 allowed on input - coefficients must be < 2*PRIME */
+
+static void ntt(sign32 *x)
+{
+    int m, i, j, start, len = DL_DEGREE / 2;
+    sign32 S, V, q = DL_PRIME;
+
+    /* Make positive */
+    poly_pos(x);
+    m = 1;
+    while (m < DL_DEGREE)
+    {
+        start = 0;
+        for (i = 0; i < m; i++)
+        {
+            S = roots[m + i];
+            for (j = start; j < start + len; j++)
+            {
+                V = modmul(x[j + len], S);
+                x[j + len] = x[j] + 2 * q - V;
+                x[j] = x[j] + V;
+            }
+            start += 2 * len;
+        }
+        len /= 2;
+        m *= 2;
+    }
+}
+
+/* Gentleman-Sande INTT */
+/* Excess of 2 allowed on input - coefficients must be < 2*PRIME */
+/* Output fully reduced */
+#define NTTL 1 // maybe should be 2?
+
+static void intt(sign32 *x)
+{
+    int m, i, j, k, n,lim,t = 1;
+    sign32 S, U, V, W, q = DL_PRIME;
+
+    m = DL_DEGREE/2;
+    n=DL_LGN;
+    while (m >= 1)
+    {
+		lim=NTTL>>n;
+		n--;
+        k = 0;
+        for (i = 0; i < m; i++)
+        {
+            S = iroots[m + i];
+            for (j = k; j < k + t; j++)
+            {
+#if NTTL>1
+				if (m<NTTL && j<k+lim)   // This should be unwound for timings
+				{ // need to knock back excesses. Never used if NTTL=1.
+					U=modmul(x[j],DL_ONE);  
+					V=modmul(x[j+t],DL_ONE); 
+				} else {
+                    U = x[j];
+                    V = x[j + t];
+                }
+#else
+                U = x[j];
+                V = x[j + t];                
+#endif
+                x[j] = U + V;
+                W = U + (DL_DEGREE/NTTL) * q - V; 
+                x[j + t] = modmul(W, S); 
+            }
+            k += 2 * t;
+        }
+        t *= 2;
+        m /= 2;
+    }
+
+    for (j = 0; j < DL_DEGREE; j++)
+    { // fully reduce, nres combined with 1/DEGREE
+        x[j]=  modmul(x[j],DL_COMBO);
+        x[j] -= q;
+        x[j] += (x[j] >> 31)&q;
+    } 
+}
+
+static void nres_it(sign32 *p)
+{
+    int i;
+    for (i = 0; i < DL_DEGREE; i++)
+        p[i] = nres(p[i]);
+}
+
+static void redc_it(sign32 *p)
+{
+    int i;
+    for (i = 0; i < DL_DEGREE; i++)
+        p[i] = redc(p[i]);
+}
+
+// copy polynomial
+static void poly_copy(sign32 *p1, sign32 *p2)
+{
+    int i;
+    for (i = 0; i < DL_DEGREE; i++)
+        p1[i] = p2[i];
+}
+
+// copy from small polynomial
+static void poly_scopy(sign32 *p1, sign8 *p2)
+{
+    int i;
+    for (i = 0; i < DL_DEGREE; i++)
+        p1[i] = (sign32)p2[i];
+}
+
+// copy from medium polynomial
+static void poly_mcopy(sign32 *p1, sign16 *p2)
+{
+    int i;
+    for (i = 0; i < DL_DEGREE; i++)
+        p1[i] = (sign32)p2[i];
+}
+
+static void poly_zero(sign32 *p1)
+{
+    int i;
+    for (i = 0; i < DL_DEGREE; i++)
+        p1[i] = 0;
+}
+
+static void poly_negate(sign32 *p1,sign32 *p2)
+{
+    int i;
+    for (i = 0; i < DL_DEGREE; i++)
+        p1[i] = DL_PRIME-p2[i];
+}
+
+static void poly_mul(sign32 *p1, sign32 *p2, sign32 *p3)
+{
+    int i;
+    for (i = 0; i < DL_DEGREE; i++)
+        p1[i] = modmul(p2[i], p3[i]);
+}
+
+static void poly_add(sign32 *p1, sign32 *p2, sign32 *p3)
+{
+    int i;
+    for (i = 0; i < DL_DEGREE; i++)
+        p1[i] = (p2[i] + p3[i]);
+}
+
+static void poly_sub(sign32 *p1, sign32 *p2, sign32 *p3)
+{
+    int i;
+    for (i = 0; i < DL_DEGREE; i++)
+        p1[i] = (p2[i] + DL_PRIME - p3[i]);
+}
+
+/* reduces inputs that are already < 2q */
+static void poly_soft_reduce(sign32 *poly)
+{
+    int i;
+    sign32 e;
+    for (i = 0; i < DL_DEGREE; i++)
+    {
+        e = poly[i] - DL_PRIME;
+        poly[i] = e + ((e >> 31)&DL_PRIME);
+    }
+}
+
+/* fully reduces modulo q */
+static void poly_hard_reduce(sign32 *poly)
+{
+    int i;
+    sign32 e;
+    for (i = 0; i < DL_DEGREE; i++)
+    {
+        e = modmul(poly[i], DL_ONE); // reduces to < 2q
+        e = e - DL_PRIME;
+        poly[i] = e + ((e >> 31)&DL_PRIME); // finishes it off
+    }
+}
+
+// Generate A[i][j] from rho
+static void ExpandAij(byte rho[32],sign32 Aij[],int i,int j)
+{
+    sha3 sh;
+    int m,n;
+    unsign32 b0,b1,b2;
+    sign32 cf;
+    SHA3_init(&sh, SHAKE128);
+    byte buff[840];  // should be plenty
+    for (m=0;m<32;m++)
+        SHA3_process(&sh,rho[m]);
+    SHA3_process(&sh,j&0xff);
+    SHA3_process(&sh,i&0xff);
+    SHA3_shake(&sh,(char *)buff,840);
+    m=n=0;
+    while (m<DL_DEGREE)
+    {
+        b0=(unsign32)buff[n++]; b1=(unsign32)buff[n++]; b2=(unsign32)buff[n++]; 
+        cf=((b2&0x7F)<<16)+(b1<<8)+b0;
+        if (cf>=DL_PRIME) continue;
+        Aij[m++]=cf;
+    }
+}
+
+// array t has ab active bits per word
+// extract bytes from array of words
+// if max!=0 then -max<=t[i]<=+max
+static byte nextbyte32(int ab,int max,sign32 t[],int &ptr, int &bts)
+{
+    sign32 r,w;
+    int left=ab-bts; // number of bits left in this word
+    int i=0;
+    w=t[ptr];
+    if (max!=0)
+        w=max-w;
+    r=w>>bts;
+    while (left<8)
+    {
+        i++;
+        w=t[ptr+i];
+        if (max!=0)
+            w=max-w;
+        r|=w<<left;
+        left+=ab;
+    }
+
+    bts+=8;
+    while (bts>=ab)
+    {
+        bts-=ab;
+        ptr++;
+    }
+    return (byte)r&0xff;        
+}
+
+// array t has ab active bits per word
+// extract dense bytes from array of words
+// if max!=0 then -max<=t[i]<=+max
+static byte nextbyte16(int ab,int max,sign16 t[],int &ptr, int &bts)
+{
+    sign32 r,w;
+    int left=ab-bts; // number of bits left in this word
+    int i=0;
+    w=t[ptr];
+    if (max!=0)
+        w=max-w;
+    r=w>>bts;
+    while (left<8)
+    {
+        i++;
+        w=t[ptr+i];
+        if (max!=0)
+            w=max-w;
+        r|=w<<left;
+        left+=ab;
+    }
+
+    bts+=8;
+    while (bts>=ab)
+    {
+        bts-=ab;
+        ptr++;
+    }
+    return (byte)r&0xff;        
+}
+
+// array t has ab active bits per word
+// extract dense bytes from array of words
+// if max!=0 then -max<=t[i]<=+max
+static byte nextbyte8(int ab,int max,sign8 t[],int &ptr, int &bts)
+{
+    sign32 r,w;
+    int left=ab-bts; // number of bits left in this word
+    int i=0;
+    w=t[ptr];
+    if (max!=0)
+        w=max-w;
+    r=w>>bts;
+    while (left<8)
+    {
+        i++;
+        w=t[ptr+i];
+        if (max!=0)
+            w=max-w;
+        r|=w<<left;
+        left+=ab;
+    }
+
+    bts+=8;
+    while (bts>=ab)
+    {
+        bts-=ab;
+        ptr++;
+    }
+    return (byte)r&0xff;        
+}
+
+// extract ab bits into word from dense byte stream
+static sign32 nextword(const int ab,int max,byte t[],int &ptr, int &bts)
+{
+    sign32 r=t[ptr]>>bts;
+    sign32 mask=(1<<ab)-1;
+    sign32 w;
+    int i=0;
+    int gotbits=8-bts; // bits left in current byte
+    while (gotbits<ab)
+    {
+        i++;
+        w=(sign32)t[ptr+i];
+        r|=w<<gotbits;
+        gotbits+=8;
+    }
+    bts+=ab;
+    while (bts>=8)
+    {
+        bts-=8;
+        ptr++;
+    }
+    w=r&mask;
+    if (max!=0)
+        w=max-w;
+    return w;  
+}
+
+// pack public key
+static int pack_pk(const int *params,byte pk[],byte rho[32],sign16 t1[])
+{
+    int ptr,bts,i,n=0;
+    int ck=params[3];
+    for (i=0;i<32;i++)
+        pk[i]=rho[i];
+    n=32; ptr=bts=0;
+    for (i=0;i<(ck*DL_DEGREE*DL_TD)/8;i++ )
+        pk[n++]=nextbyte16(DL_TD,0,t1,ptr,bts);
+    return n;
+}
+
+// unpack public key
+static void unpack_pk(const int *params,byte rho[32],sign16 t1[],byte pk[])
+{
+    int ptr,bts,i;
+    int ck=params[3];
+    for (i=0;i<32;i++)
+        rho[i]=pk[i];
+    ptr=bts=0;
+    for (i=0;i<ck*DL_DEGREE;i++ )
+        t1[i]=(sign16)nextword(DL_TD,0,&pk[32],ptr,bts);
+}
+
+// secret key of size 32*3+DEGREE*(K*D+L*LG2ETA1+K*LG2ETA1)/8
+static int pack_sk(const int *params,byte sk[],byte rho[32],byte bK[32],byte tr[32],sign8 s1[],sign8 s2[],sign16 t0[])
+{
+    int ptr,bts,i,n=32;
+    int ck=params[3];
+    int el=params[4];
+    int eta=params[5];
+    int lg2eta1=params[6];
+
+    for (i=0;i<32;i++)
+        sk[i]=rho[i];
+    for (i=0;i<32;i++)
+        sk[n++]=bK[i];
+    for (i=0;i<32;i++)
+        sk[n++]=tr[i];
+    ptr=bts=0;
+    for (i=0;i<(el*DL_DEGREE*lg2eta1)/8;i++)
+        sk[n++]=nextbyte8(lg2eta1,eta,s1,ptr,bts);
+    ptr=bts=0;
+    for (i=0;i<(ck*DL_DEGREE*lg2eta1)/8;i++)
+        sk[n++]=nextbyte8(lg2eta1,eta,s2,ptr,bts);
+    ptr=bts=0;
+    for (i=0;i<(ck*DL_DEGREE*DL_D)/8;i++)
+        sk[n++]=nextbyte16(DL_D,(1<<(DL_D-1)),t0,ptr,bts);
+    return n;
+}
+
+static void unpack_sk(const int *params,byte rho[32],byte bK[32],byte tr[32],sign8 s1[],sign8 s2[],sign16 t0[],byte sk[])
+{
+    int ptr,bts,i,n=32;
+    int ck=params[3];
+    int el=params[4];
+    int eta=params[5];
+    int lg2eta1=params[6];
+
+    for (i=0;i<32;i++)
+        rho[i]=sk[i];
+    for (i=0;i<32;i++)
+        bK[i]=sk[n++];
+    for (i=0;i<32;i++)
+        tr[i]=sk[n++];
+    ptr=bts=0; 
+    for (i=0;i<el*DL_DEGREE;i++ )
+        s1[i]=(sign8)nextword(lg2eta1,eta,&sk[n],ptr,bts);
+    n+=ptr;
+    ptr=bts=0; 
+    for (i=0;i<ck*DL_DEGREE;i++ )
+        s2[i]=(sign8)nextword(lg2eta1,eta,&sk[n],ptr,bts);
+    n+=ptr;
+    ptr=bts=0;
+    for (i=0;i<ck*DL_DEGREE;i++ )
+        t0[i]=(sign16)nextword(DL_D,(1<<(DL_D-1)),&sk[n],ptr,bts);
+}
+
+// pack signature - changes z 
+static int pack_sig(const int *params,byte sig[],sign32 z[],byte ct[],byte h[])
+{
+    int lg=params[1];
+    int gamma1=1<<lg;
+    int ck=params[3];
+    int el=params[4];
+    int omega=params[7];
+    int ptr,bts,i,m,n,row,k=(el*DL_DEGREE*(lg+1))/8;
+    sign32 t;
+
+    for (i=0;i<32;i++)
+      sig[i]=ct[i];   
+    n=32;
+    ptr=bts=0;
+//pre-process z
+    for (i=0;i<el;i++)
+    {
+        row=DL_DEGREE*i;
+        for (m=0;m<DL_DEGREE;m++)
+        {
+            t=z[row+m];
+            if (t>DL_PRIME/2) t-=DL_PRIME;
+            t=gamma1-t;
+            z[row+m]=t;
+        }
+    }
+    for (i=0;i<k;i++) {
+        sig[n++]=nextbyte32(lg+1,0,z,ptr,bts);
+    }
+    for (i=0;i<omega+ck;i++)
+        sig[n++]=h[i];
+    return n;
+}
+
+static void unpack_sig(const int *params,sign32 z[],byte ct[],byte h[],byte sig[])
+{
+    int lg=params[1];
+    int gamma1=1<<lg;
+    int ck=params[3];
+    int el=params[4];
+    int omega=params[7];
+
+    int ptr,bts,i,n=el*DL_DEGREE;
+    sign32 t;
+    int m=32+(el*DL_DEGREE*(lg+1))/8;
+    for (i=0;i<32;i++)
+        ct[i]=sig[i];
+
+    ptr=bts=0;
+    for (i=0;i<n;i++) {
+        t=nextword(lg+1,0,&sig[32],ptr,bts);
+        t=gamma1-t;
+        if (t<0) t+=DL_PRIME;
+        z[i]=t;
+    }
+
+    for (i=0;i<omega+ck;i++)
+        h[i]=sig[m++];    
+}
+
+// rejection sampling in range -ETA to +ETA
+static void sample_Sn(const int *params,byte rhod[64],sign8 s[],int n)
+{
+    int m,ptr,bts;
+    int eta=params[5];
+    int lg2eta1=params[6];
+    sha3 sh;
+    byte buff[272];
+    SHA3_init(&sh, SHAKE256);
+    for (m=0;m<64;m++)
+        SHA3_process(&sh,rhod[m]);
+    SHA3_process(&sh,n&0xff);
+    SHA3_process(&sh,(n>>8)&0xff);
+    SHA3_shake(&sh,(char *)buff,272);
+    ptr=bts=0;
+    for (m=0;m<DL_DEGREE;m++)
+    {
+        do
+        {
+            s[m]=nextword(lg2eta1,0,buff,ptr,bts);
+        }
+        while (s[m]>2*eta);
+        s[m]=eta-s[m];
+    }
+}
+
+// uniform random sampling
+static void sample_Y(const int *params,int k,byte rhod[64],sign32 y[])
+{
+    int i,j,m,ki,row,ptr,bts;   // 2^n-1
+    int lg=params[1];
+    int gamma1=1<<lg;
+    int el=params[4];
+    sha3 sh;
+    sign32 w,t;
+    byte buff[DL_YBYTES];
+
+    for (i=0;i<el;i++)
+    {
+        row=DL_DEGREE*i;
+        SHA3_init(&sh, SHAKE256);
+        for (j=0;j<64;j++)
+            SHA3_process(&sh,rhod[j]);
+        ki=k+i;
+        SHA3_process(&sh,ki&0xff);
+        SHA3_process(&sh,ki>>8);
+        SHA3_shake(&sh,(char *)buff,DL_YBYTES);
+
+        ptr=bts=0;
+        for (m=0;m<DL_DEGREE;m++)
+        {  // take in LG+1 bits at a time
+            w=nextword(lg+1,0,buff,ptr,bts);  // 20 bits
+            w=gamma1-w;
+            t=w>>31;
+            y[row+m]=w+(DL_PRIME&t);
+        }
+    }
+}
+
+// CRH(rho,t1)
+static void CRH1(const int *params,byte H[32],byte rho[32],sign16 t1[])
+{
+    int i;
+    int ptr,bts;
+    int ck=params[3];
+    sha3 sh;
+    SHA3_init(&sh, SHAKE256);
+    for (i=0;i<32;i++)
+        SHA3_process(&sh,rho[i]);
+    ptr=bts=0;
+    for (i=0;i<(ck*DL_DEGREE*DL_TD)/8;i++)
+            SHA3_process(&sh,nextbyte16(DL_TD,0,t1,ptr,bts));
+    SHA3_shake(&sh,(char *)H,32);
+}
+
+// CRH(tr,M)
+static void CRH2(byte H[64],byte tr[32],byte mess[],int mlen)
+{
+    int i;
+    sha3 sh;
+    SHA3_init(&sh, SHAKE256);
+    for (i=0;i<32;i++)
+        SHA3_process(&sh,tr[i]);
+    for (i=0;i<mlen;i++)
+        SHA3_process(&sh,mess[i]);
+    SHA3_shake(&sh,(char *)H,64);
+}
+
+// CRH(K,mu)
+static void CRH3(byte H[64],byte bK[32],byte mu[64])
+{
+    int i;
+    sha3 sh;
+    SHA3_init(&sh, SHAKE256);
+    for (i=0;i<32;i++)
+        SHA3_process(&sh,bK[i]);
+    for (i=0;i<64;i++)
+        SHA3_process(&sh,mu[i]);
+    SHA3_shake(&sh,(char *)H,64);
+}
+
+// H(mu,w1)
+static void H4(const int *params,byte CT[32],byte mu[64],sign8 w1[])
+{
+    int i;
+    int ptr,bts;
+    int ck=params[3];
+    int dv=params[2];
+    sha3 sh;
+    int w1b=4;
+    if (dv==88) w1b=6;
+    SHA3_init(&sh, SHAKE256);
+    for (i=0;i<64;i++)
+        SHA3_process(&sh,mu[i]);
+    ptr=bts=0;
+    for (i=0;i<(ck*DL_DEGREE*w1b)/8;i++)
+        SHA3_process(&sh,nextbyte8(w1b,0,w1,ptr,bts));
+    SHA3_shake(&sh,(char *)CT,32);
+}
+
+static void SampleInBall(const int *params,byte ct[32],sign32 c[DL_DEGREE])
+{
+    int i,j,k,n,b,sn;
+    int tau=params[0];
+    byte signs[8],buff[136];
+    sha3 sh;
+    SHA3_init(&sh, SHAKE256);
+    for (i=0;i<32;i++)
+        SHA3_process(&sh,ct[i]);
+    SHA3_shake(&sh,(char *)buff,136);
+    for (i=0;i<8;i++)
+        signs[i]=buff[i];
+    k=8; 
+    b=0;
+    poly_zero(c);
+    sn=signs[0]; n=1;
+    for (i=DL_DEGREE-tau;i<DL_DEGREE;i++)
+    {
+        do
+        {
+            j=buff[k++];
+        } while (j>i);
+        c[i]=c[j];
+        c[j]=1-2*((sign32)sn&1);
+        sn>>=1; b++;
+        if (b==8) {
+            sn=signs[n++]; b=0;
+        }
+    }
+}
+
+static sign16 p2r(sign32 *r0)
+{
+    sign32 d=(1<<DL_D);
+    sign32 r1;
+    r1=(*r0+d/2-1)>>DL_D;  
+    *r0-=(r1 << DL_D);
+    return (sign16)r1;
+}
+
+static void Power2Round(sign32 t[],sign16 t0[],sign16 t1[])
+{
+    int m;
+    sign32 w;
+    for (m=0;m<DL_DEGREE;m++)
+    {   
+        w=t[m];
+        t1[m]=p2r(&w);
+        t0[m]=(sign16)w;
+    }
+}
+
+// ALPHA = (Q-1)/16 - borrowed from dilithium ref implementation
+static sign32 decompose_lo(const int *params,sign32 a) {
+    int gamma2,dv=params[2];
+    sign32 a0,a1;
+    a1  = (a + 127) >> 7;
+
+    if (dv==32)
+    {
+        a1  = (a1*1025 + (1 << 21)) >> 22;
+        a1 &= 15;
+        gamma2=(DL_PRIME-1)/32;
+    } else { // 88
+        a1  = (a1*11275 + (1 << 23)) >> 24;
+        a1 ^= ((43 - a1) >> 31) & a1;
+        gamma2=(DL_PRIME-1)/88;
+    }
+
+    a0  = a - a1*2*gamma2;  // (Q-1)/2R=alpha
+    a0 -= (((DL_PRIME-1)/2 - a0) >> 31) & DL_PRIME;
+    a0 += (a0>>31)&DL_PRIME;
+    return a0;
+}
+
+// ALPHA = (Q-1)/16
+static sign8 decompose_hi(const int *params,sign32 a) {
+    int dv=params[2];
+    sign32 a1;
+    a1  = (a + 127) >> 7;
+    if (dv==32) {
+        a1  = (a1*1025 + (1 << 21)) >> 22;
+        a1 &= 15;
+    } else {
+        a1  = (a1*11275 + (1 << 23)) >> 24;
+        a1 ^= ((43 - a1) >> 31) & a1;
+    }
+    return (sign8)a1;
+}
+
+static void lobits(const int *params,sign32 r0[],sign32 r[])
+{
+    int m;
+    for (m=0;m<DL_DEGREE;m++)
+            r0[m]=decompose_lo(params,r[m]);
+}
+
+static void hibits(const int *params,sign8 r1[],sign32 r[])
+{
+    int m;
+    for (m=0;m<DL_DEGREE;m++)
+        r1[m]=decompose_hi(params,r[m]);
+}    
+
+
+// before h initialised to zeros, hptr=0
+// after new hptr returned and h[OMEGA+i]= hptr
+static int MakePartialHint(const int *params,byte h[],int hptr,sign32 z[],sign32 r[])
+{
+    int m;
+    sign8 a0,a1;
+    sign32 rz;
+    int omega=params[7];
+    for (m=0;m<DL_DEGREE;m++)
+    {
+        a0=decompose_hi(params,r[m]);
+        rz=r[m]+z[m];
+        rz-=DL_PRIME;
+        rz=rz+((rz>>31)&DL_PRIME);
+        a1=decompose_hi(params,rz);
+        if (a0!=a1) {
+            if (hptr>=omega) return omega+1;
+            h[hptr++]=m&0xff;
+        }
+    }
+    return hptr;
+}
+
+static int UsePartialHint(const int *params,sign8 r[],byte h[],int hptr,int i,sign32 w[])
+{
+    int dv=(sign8)params[2];
+    int omega=params[7];
+    sign8 a1,md=dv/2;
+    sign32 a0;
+    int m;
+    for (m=0;m<DL_DEGREE;m++)
+    {
+        a1=decompose_hi(params,w[m]);
+        if (m==h[hptr] && hptr<h[omega+i])
+        {
+            hptr++;
+            a0=decompose_lo(params,w[m]);
+            if (a0<=DL_PRIME/2) {
+                a1++;
+                if (a1>=md) a1-=md;
+            } else {
+                a1--;
+                if (a1<0) a1+=md;
+            }
+        }
+        r[m]=a1;
+    }
+    return hptr;
+}
+
+static sign32 infinity_norm(sign32 w[])
+{
+    int m;
+    sign32 az,n=0;
+    for (m=0;m<DL_DEGREE;m++)
+    {
+        az=w[m];
+        if (az>DL_PRIME/2) az=DL_PRIME-az;
+        if (az>n) n=az;    
+    }
+    return n;
+}
+
+// Dilithium API
+
+static void keypair(const int *params,byte *tau,octet *sk,octet *pk)
+{
+    int i,row,j;
+    sha3 sh;
+    byte buff[128];
+    byte rho[32];
+    byte rhod[64];
+    byte bK[32];
+    byte tr[32];          // 320 bytes
+    sign32 Aij[DL_DEGREE];     // 1024 bytes
+    sign32 w[DL_DEGREE]; // work space  1024 bytes
+    sign32 r[DL_DEGREE]; // work space  1024 bytes total = 12352
+
+    int ck=params[3];
+    int el=params[4];
+
+#ifdef USE_VLAS
+    sign8 s1[el*DL_DEGREE];     // 1280 bytes
+    sign8 s2[ck*DL_DEGREE];     // 1536 bytes
+    sign16 t0[ck*DL_DEGREE];    // 3072 bytes
+    sign16 t1[ck*DL_DEGREE];    // 3072 bytes
+#else    
+    sign8 s1[DL_MAXL*DL_DEGREE];     // 1280 bytes
+    sign8 s2[DL_MAXK*DL_DEGREE];     // 1536 bytes
+    sign16 t0[DL_MAXK*DL_DEGREE];    // 3072 bytes
+    sign16 t1[DL_MAXK*DL_DEGREE];    // 3072 bytes
+#endif
+    SHA3_init(&sh, SHAKE256);
+  
+    for (i=0;i<32;i++)
+        SHA3_process(&sh,tau[i]); 
+    SHA3_shake(&sh,(char *)buff,128);
+    for (i=0;i<32;i++)
+    {
+        rho[i]=buff[i];
+        bK[i]=buff[i+96];
+    }
+    for (i=0;i<64;i++)
+        rhod[i]=buff[32+i];
+
+    for (i=0;i<el;i++)
+    {
+        row=DL_DEGREE*i;
+        sample_Sn(params,rhod,&s1[row],i);
+    }
+
+    for (i=0;i<ck;i++)
+    {
+        row=DL_DEGREE*i;
+        sample_Sn(params,rhod,&s2[row],el+i);
+        poly_zero(r);
+        for (j=0;j<el;j++)
+        {
+            poly_scopy(w,&s1[j*DL_DEGREE]);
+            ntt(w);  
+            ExpandAij(rho,Aij,i,j);  // This is bottleneck
+            poly_mul(w,w,Aij);
+            poly_add(r,r,w);
+            //poly_soft_reduce(r);  // be lazy
+        }
+        poly_hard_reduce(r);  
+        intt(r);
+        poly_scopy(w,&s2[row]);
+        poly_pos(w);
+        poly_add(r,r,w);
+        poly_soft_reduce(r);
+        Power2Round(r,&t0[row],&t1[row]);
+    }
+
+    CRH1(params,tr,rho,t1);
+
+    pk->len=pack_pk(params,(byte *)pk->val,rho,t1);
+    sk->len=pack_sk(params,(byte *)sk->val,rho,bK,tr,s1,s2,t0);
+}
+
+static int signature(const int *params,octet *sk,octet *M,octet *sig)
+{
+    int i,k,nh,fk,row,j;
+    bool badone;
+    byte rho[32];
+    byte bK[32];
+    byte ct[32];
+    byte tr[32];
+    byte mu[64];
+    byte rhod[64];   // 288 bytes
+    byte hint[100]; // 61 bytes
+
+    sign32 c[DL_DEGREE];  // 1024 bytes
+    sign32 w[DL_DEGREE];  // work space 1024 bytes
+    sign32 r[DL_DEGREE];  // work space 1024 bytes total= 21673 bytes
+    //sign32 Aij[DL_DEGREE]; // 1024 bytes
+
+    int ck=params[3];
+    int el=params[4];
+
+#ifdef USE_VLAS
+    sign8 s1[el*DL_DEGREE]; // 1280 bytes
+    sign8 s2[ck*DL_DEGREE]; // 1536 bytes
+    sign16 t0[ck*DL_DEGREE]; // 3072 bytes
+    sign32 y[el*DL_DEGREE];  // 5120 bytes
+    sign32 Ay[ck*DL_DEGREE]; // 6144 bytes
+    sign8 w1[ck*DL_DEGREE]; // 1280 bytes
+#else
+    sign8 s1[DL_MAXL*DL_DEGREE]; // 1280 bytes
+    sign8 s2[DL_MAXK*DL_DEGREE]; // 1536 bytes
+    sign16 t0[DL_MAXK*DL_DEGREE]; // 3072 bytes
+    sign32 y[DL_MAXL*DL_DEGREE];  // 5120 bytes
+    sign32 Ay[DL_MAXK*DL_DEGREE]; // 6144 bytes
+    sign8 w1[DL_MAXK*DL_DEGREE]; // 1280 bytes
+#endif
+    int tau=params[0];
+    int lg=params[1];
+    int gamma1=(sign32)(1<<lg);
+    int dv=(sign32)params[2];
+    int gamma2=(DL_PRIME-1)/dv;
+    int eta=params[5];
+    int beta=(sign32)(tau*eta);
+    int omega=params[7];
+    unpack_sk(params,rho,bK,tr,s1,s2,t0,(byte *)sk->val);
+
+// signature
+    CRH2(mu,tr,(byte*)M->val,M->len);
+    CRH3(rhod,bK,mu);
+
+    for (k=0; ;k++ )
+    {
+        fk=k*el;
+        sample_Y(params,fk,rhod,y);
+
+// NTT y
+        for (i=0;i<el;i++)
+        {
+            row=DL_DEGREE*i;
+            ntt(&y[row]);
+        }
+
+// Calculate Ay 
+        for (i=0;i<ck;i++)
+        {
+            row=DL_DEGREE*i;
+            poly_zero(r);
+            for (j=0;j<el;j++)
+            { // Note: no NTTs in here
+                poly_copy(w,&y[j*DL_DEGREE]);
+                ExpandAij(rho,c,i,j);  // This is bottleneck // re-use c for Aij 
+                poly_mul(w,w,c);
+                poly_add(r,r,w);
+                //poly_soft_reduce(r);  // be lazy
+            }
+            poly_hard_reduce(r);
+            intt(r);
+            poly_copy(&Ay[row],r);
+// Calculate w1
+            hibits(params,&w1[row],&Ay[row]);
+        }
+
+// Calculate c
+        H4(params,ct,mu,w1);
+        SampleInBall(params,ct,c);
+
+        badone=false;
+// Calculate z=y+c.s1
+        ntt(c);
+        for (i=0;i<el;i++)
+        {
+            row=DL_DEGREE*i;
+            poly_scopy(w,&s1[row]);
+            ntt(w);
+            poly_mul(w,w,c);
+            nres_it(w);
+            poly_add(&y[row],&y[row],w);  // re-use y for z 
+            redc_it(&y[row]);  // unNTT y
+            intt(&y[row]);
+            poly_soft_reduce(&y[row]);
+            if (infinity_norm(&y[row])>=gamma1-beta)
+            {
+                badone=true;
+                break;
+            }
+        }
+
+        if (badone) continue;
+ 
+// Calculate Ay=w-c.s2 and r0=lobits(w-c.s2)
+        nh=0;
+        for (i=0;i<omega+ck;i++)
+            hint[i]=0;
+        for (i=0;i<ck;i++)
+        {
+            row=DL_DEGREE*i;
+            poly_scopy(w,&s2[row]);
+            ntt(w);
+            poly_mul(w,w,c);
+            
+            intt(w);
+            poly_sub(&Ay[row],&Ay[row],w);
+            poly_soft_reduce(&Ay[row]);   //Ay=w-cs2
+            lobits(params,w,&Ay[row]);    // r0
+            if (infinity_norm(w)>=gamma2-beta)
+            {
+                badone=true;
+                break;
+            }
+            poly_mcopy(w,&t0[row]);
+            ntt(w);
+            poly_mul(w,w,c);
+            
+            intt(w);
+            poly_negate(r,w);  // -ct0
+            if (infinity_norm(r)>=gamma2)
+            {
+                badone=true;
+                break;
+            }
+            poly_sub(&Ay[row],&Ay[row],r);
+            poly_soft_reduce(&Ay[row]);
+
+            nh=MakePartialHint(params,hint,nh,r,&Ay[row]);
+            if (nh>omega)
+            {
+                badone=true;
+                break;
+            }
+            hint[omega+i]=nh;
+        }
+        if (badone) continue;
+        break;
+    }
+    sig->len=pack_sig(params,(byte *)sig->val,y,ct,hint);
+    return k+1;      
+}
+
+static bool verify(const int *params,octet *pk,octet *M,octet *sig)
+{
+    int i,row,j,m,hints;
+    byte rho[32];
+    byte mu[64];
+    byte ct[32];
+    byte cct[32];
+    byte tr[32];         // 192 bytes
+    byte hint[100];  // 61 bytes
+
+
+    sign32 Aij[DL_DEGREE];  // 1024 bytes
+    sign32 c[DL_DEGREE];    // 1024 bytes
+    sign32 w[DL_DEGREE]; // work space // 1024 bytes
+    sign32 r[DL_DEGREE]; // work space // 1024 bytes total=14077 bytes
+
+    int ck=params[3];
+    int el=params[4];
+
+#ifdef USE_VLAS
+    sign32 z[el*DL_DEGREE];  // 5120 bytes
+    sign16 t1[ck*DL_DEGREE]; // 3072 bytes
+    sign8 w1d[ck*DL_DEGREE]; // 1536 bytes 
+#else
+    sign32 z[DL_MAXL*DL_DEGREE];  // 5120 bytes
+    sign16 t1[DL_MAXK*DL_DEGREE]; // 3072 bytes
+    sign8 w1d[DL_MAXK*DL_DEGREE]; // 1536 bytes 
+#endif
+    int tau=params[0];
+    int lg=params[1];
+    int gamma1=(sign32)(1<<lg);
+    int eta=params[5];
+    int beta=(sign32)(tau*eta);
+    int omega=params[7];
+
+// unpack public key and signature
+    unpack_pk(params,rho,t1,(byte *)pk->val);
+    unpack_sig(params,z,ct,hint,(byte *)sig->val);
+
+    for (i=0;i<el;i++)
+    {
+        row=DL_DEGREE*i;
+        if (infinity_norm(&z[row])>=gamma1-beta)
+            return false;
+        ntt(&z[row]); // convert to ntt form
+    }
+
+    CRH1(params,tr,rho,t1);
+    CRH2(mu,tr,(byte *)M->val,M->len);
+    SampleInBall(params,ct,c);
+    ntt(c);
+
+// Calculate Az
+    hints=0;
+    for (i=0;i<ck;i++)
+    {
+        row=DL_DEGREE*i;
+        poly_zero(r);
+        for (j=0;j<el;j++)
+        { // Note: no NTTs in here
+            poly_copy(w,&z[j*DL_DEGREE]);
+            ExpandAij(rho,Aij,i,j);    // This is bottleneck
+            poly_mul(w,w,Aij);
+            poly_add(r,r,w);
+            //poly_soft_reduce(r);  // be lazy
+        }
+        poly_hard_reduce(r);
+
+// Calculate Az-ct1.2^d
+        for (m=0;m<DL_DEGREE;m++)
+            w[m]=(sign32)(t1[row+m])<<DL_D;
+        ntt(w);
+        poly_mul(w,w,c);
+        poly_sub(r,r,w);
+        intt(r);
+
+        hints=UsePartialHint(params,&w1d[row],hint,hints,i,r);
+        if (hints>omega) return false;
+    }
+
+    H4(params,cct,mu,w1d);
+
+    for (i=0;i<32;i++)
+        if (ct[i]!=cct[i])
+            return false;
+    return true;
+}
+
+void core::DLTHM_keypair_2(byte *tau,octet *sk,octet *pk)
+{
+    keypair(PARAMS_2,tau,sk,pk);
+}
+
+int core::DLTHM_signature_2(octet *sk,octet *M,octet *sig)
+{
+    return signature(PARAMS_2,sk,M,sig);
+}
+
+bool core::DLTHM_verify_2(octet *pk,octet *M,octet *sig)
+{
+    return verify(PARAMS_2,pk,M,sig);
+}
+
+
+void core::DLTHM_keypair_3(byte *tau,octet *sk,octet *pk)
+{
+    keypair(PARAMS_3,tau,sk,pk);
+}
+
+int core::DLTHM_signature_3(octet *sk,octet *M,octet *sig)
+{
+    return signature(PARAMS_3,sk,M,sig);
+}
+
+bool core::DLTHM_verify_3(octet *pk,octet *M,octet *sig)
+{
+    return verify(PARAMS_3,pk,M,sig);
+}
+
+void core::DLTHM_keypair_5(byte *tau,octet *sk,octet *pk)
+{
+    keypair(PARAMS_5,tau,sk,pk);
+}
+
+int core::DLTHM_signature_5(octet *sk,octet *M,octet *sig)
+{
+    return signature(PARAMS_5,sk,M,sig);
+}
+
+bool core::DLTHM_verify_5(octet *pk,octet *M,octet *sig)
+{
+    return verify(PARAMS_5,pk,M,sig);
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/dilithium.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/dilithium.h
new file mode 100644
index 0000000..73ccbb1
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/dilithium.h
@@ -0,0 +1,151 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* Dilithium API */
+
+#ifndef DILITHIUM_H
+#define DILITHIUM_H
+
+#include "core.h"
+
+/* DILITHIUM parameters */
+
+//q= 8380417
+#define DL_LGN 8
+#define DL_DEGREE (1 << DL_LGN)
+#define DL_PRIME 0x7fe001
+#define DL_D 13
+#define DL_TD (23-DL_D)
+
+#define DL_ONE 0x3FFE00    // R mod Q
+#define DL_COMBO 0xA3FA    // ONE*inv mod Q
+#define DL_R2MODP 0x2419FF // R^2 mod Q
+#define DL_ND 0xFC7FDFFF   // 1/(R-Q) mod R
+
+#define DL_MAXLG 19
+#define DL_MAXK 8     // could reduce these if not using highest security
+#define DL_MAXL 7
+#define DL_YBYTES (((DL_MAXLG+1)*DL_DEGREE)/8)
+
+#define DL_SK_SIZE_2 (32*3+DL_DEGREE*(4*13+4*3+4*3)/8)
+#define DL_PK_SIZE_2 ((4*DL_DEGREE*DL_TD)/8+32)
+#define DL_SIG_SIZE_2 ((DL_DEGREE*4*(17+1))/8+80+4+32)
+
+#define DL_SK_SIZE_3 (32*3+DL_DEGREE*(6*13+5*4+6*4)/8)
+#define DL_PK_SIZE_3 ((6*DL_DEGREE*DL_TD)/8+32)
+#define DL_SIG_SIZE_3 ((DL_DEGREE*5*(19+1))/8+55+6+32)
+
+#define DL_SK_SIZE_5 (32*3+DL_DEGREE*(8*13+7*3+8*3)/8)
+#define DL_PK_SIZE_5 ((8*DL_DEGREE*DL_TD)/8+32)
+#define DL_SIG_SIZE_5 ((DL_DEGREE*7*(19+1))/8+75+8+32)
+
+
+namespace core {
+
+/** @brief Dilithium signature key pair generation
+ *
+    @param tau Random Numbers
+    @param SK secret key
+    @param PK public key
+
+ */
+extern void DLTHM_keypair_2(byte *tau,octet *SK,octet *PK);
+
+/** @brief Dilithium create signature on a message 
+ *
+    @param SK secret key
+    @param M the message to be signed
+    @param SIG the output signature
+    @return numbers of attempts needed to create signature
+
+ */
+extern int DLTHM_signature_2(octet *SK,octet *M, octet *SIG);
+
+/** @brief Dilithium verify signature on a message 
+ *
+    @param PK public key key
+    @param M the signed message
+    @param SIG the signature
+    @return true if signature is good, else false
+
+ */
+extern bool DLTHM_verify_2(octet *PK,octet *M,octet *SIG);
+
+
+/** @brief Dilithium signature key pair generation
+ *
+    @param tau Random Numbers
+    @param SK secret key
+    @param PK public key
+
+ */
+extern void DLTHM_keypair_3(byte *tau,octet *SK,octet *PK);
+
+/** @brief Dilithium create signature on a message 
+ *
+    @param SK secret key
+    @param M the message to be signed
+    @param SIG the output signature
+    @return numbers of attempts needed to create signature
+
+ */
+extern int DLTHM_signature_3(octet *SK,octet *M, octet *SIG);
+
+/** @brief Dilithium verify signature on a message 
+ *
+    @param PK public key key
+    @param M the signed message
+    @param SIG the signature
+    @return true if signature is good, else false
+
+ */
+extern bool DLTHM_verify_3(octet *PK,octet *M,octet *SIG);
+
+
+/** @brief Dilithium signature key pair generation
+ *
+    @param tau Random Numbers
+    @param SK secret key
+    @param PK public key
+
+ */
+extern void DLTHM_keypair_5(byte *tau,octet *SK,octet *PK);
+
+/** @brief Dilithium create signature on a message 
+ *
+    @param SK secret key
+    @param M the message to be signed
+    @param SIG the output signature
+    @return numbers of attempts needed to create signature
+
+ */
+extern int DLTHM_signature_5(octet *SK,octet *M, octet *SIG);
+
+/** @brief Dilithium verify signature on a message 
+ *
+    @param PK public key key
+    @param M the signed message
+    @param SIG the signature
+    @return true if signature is good, else false
+
+ */
+extern bool DLTHM_verify_5(octet *PK,octet *M,octet *SIG);
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh.cpp
new file mode 100644
index 0000000..dcba8b4
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh.cpp
@@ -0,0 +1,394 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* ECDH/ECIES/ECDSA API Functions */
+
+#include <stdio.h>
+#include <string.h>
+#include <stdlib.h>
+#include <time.h>
+
+#include "ecdh_ZZZ.h"
+
+using namespace XXX;
+using namespace YYY;
+
+#if CURVETYPE_ZZZ!=WEIERSTRASS
+// Process a random BIG r by RFC7748 (for Montgomery & Edwards curves only)
+static void RFC7748(BIG r)
+{
+    int c,lg=0;
+    BIG t;
+    c=ZZZ::CURVE_Cof_I;
+    while (c!=1)
+    {
+        lg++;
+        c/=2;
+    }
+    int n=8*EGS_ZZZ-lg+1;
+    BIG_mod2m(r,n);
+    BIG_zero(t); BIG_inc(t,1); BIG_shl(t,n);
+    BIG_add(r,r,t);
+    c=BIG_lastbits(r,lg);
+    BIG_dec(r,c);
+//    printf("lg= %d n=%d\n",lg,n);
+}
+#endif
+
+/* return 1 if S is in ranger 0 < S < order , else return 0 */
+int ZZZ::ECP_IN_RANGE(octet* S)
+{
+    BIG r,s;
+    BIG_rcopy(r, CURVE_Order);
+    BIG_fromBytes(s,S->val);
+    if (BIG_iszilch(s)) return 0;
+    if (BIG_comp(s,r)>=0) return 0;
+    return 1;
+}
+ 
+/* Calculate a public/private EC GF(p) key pair. W=S.G mod EC(p),
+ * where S is the secret key and W is the public key
+ * and G is fixed generator.
+ * If RNG is NULL then the private key is provided externally in S
+ * otherwise it is generated randomly internally */
+int ZZZ::ECP_KEY_PAIR_GENERATE(csprng *RNG, octet* S, octet *W)
+{
+    BIG r, gx, gy, s;
+    ECP G;
+    int res = 0;
+
+    ECP_generator(&G);
+    BIG_rcopy(r, CURVE_Order);
+
+    if (RNG != NULL)
+    {
+#if CURVETYPE_ZZZ!=WEIERSTRASS
+        BIG_random(s,RNG);          // from random bytes
+#else
+        BIG_randomnum(s, r, RNG);   // Removes biases
+#endif
+    }
+    else
+    {
+        BIG_fromBytes(s, S->val);
+    }
+
+#if CURVETYPE_ZZZ!=WEIERSTRASS
+    RFC7748(s);                     // For Montgomery or Edwards, apply RFC7748 transformation
+#endif
+    S->len = EGS_ZZZ;
+    BIG_toBytes(S->val, s);
+
+    ECP_clmul(&G, s, r);
+    ECP_toOctet(W, &G, false);      // To use point compression on public keys, change to true
+
+    return res;
+}
+
+/* Validate public key */
+int ZZZ::ECP_PUBLIC_KEY_VALIDATE(octet *W)
+{
+    BIG q, r, wx, k;
+    ECP WP;
+    int valid, nb;
+    int res = 0;
+
+    BIG_rcopy(q, Modulus);
+    BIG_rcopy(r, CURVE_Order);
+
+    valid = ECP_fromOctet(&WP, W);
+    if (!valid) res = ECDH_INVALID_PUBLIC_KEY;
+
+    if (res == 0)
+    {
+
+        nb = BIG_nbits(q);
+        BIG_one(k);
+        BIG_shl(k, (nb + 4) / 2);
+        BIG_add(k, q, k);
+        BIG_sdiv(k, r); /* get co-factor */
+        while (BIG_parity(k) == 0)
+        {
+            ECP_dbl(&WP);
+            BIG_fshr(k, 1);
+        }
+
+        if (!BIG_isunity(k)) ECP_mul(&WP, k);
+        if (ECP_isinf(&WP)) res = ECDH_INVALID_PUBLIC_KEY;
+    }
+
+    return res;
+}
+
+/* IEEE-1363 Diffie-Hellman online calculation Z=S.WD */
+// type = 0 is just x coordinate output
+// type = 1 for standard compressed output
+// type = 2 for standard uncompress output 04|x|y
+int ZZZ::ECP_SVDP_DH(octet *S, octet *WD, octet *Z,int type)
+{
+    BIG r, s, wx;
+    int valid;
+    ECP W;
+    int res = 0;
+
+    BIG_fromBytes(s, S->val);
+    valid = ECP_fromOctet(&W, WD);
+
+    if (!valid) res = ECDH_ERROR;
+    if (res == 0)
+    {
+        BIG_rcopy(r, CURVE_Order);
+        ECP_clmul(&W, s, r);
+        if (ECP_isinf(&W)) res = ECDH_ERROR;
+        else
+        {
+#if CURVETYPE_ZZZ!=MONTGOMERY
+            if (type>0)
+            {
+                if (type==1) ECP_toOctet(Z,&W,true);
+                else ECP_toOctet(Z,&W,false);
+                return res;
+            }
+            else
+                ECP_get(wx, wx, &W);
+#else
+            ECP_get(wx, &W);
+#endif
+        }
+        Z->len = EFS_ZZZ;
+        BIG_toBytes(Z->val, wx);
+    }
+    return res;
+}
+
+#if CURVETYPE_ZZZ!=MONTGOMERY
+
+/* IEEE ECDSA Signature, C and D are signature on F using private key S */
+int ZZZ::ECP_SP_DSA(int hlen, csprng *RNG, octet *K, octet *S, octet *F, octet *C, octet *D)
+{
+    char h[128];
+    octet H = {0, sizeof(h), h};
+
+    BIG r, s, f, c, d, u, vx, w;
+    ECP G, V;
+
+    SPhash(MC_SHA2, hlen, &H, F);
+
+    ECP_generator(&G);
+    BIG_rcopy(r, CURVE_Order);
+
+    BIG_fromBytes(s, S->val);
+
+    int blen = H.len;
+    if (H.len > EGS_ZZZ) blen = EGS_ZZZ;
+    BIG_fromBytesLen(f, H.val, blen);
+
+    if (RNG != NULL)
+    {
+        do
+        {
+            BIG_randomnum(u, r, RNG);
+            BIG_randomnum(w, r, RNG); /* IMPORTANT - side channel masking to protect invmodp() */
+
+            ECP_copy(&V, &G);
+            ECP_clmul(&V, u, r);
+
+            ECP_get(vx, vx, &V);
+
+            BIG_copy(c, vx);
+            BIG_mod(c, r);
+            if (BIG_iszilch(c)) continue;
+
+            BIG_modmul(u, u, w, r);
+
+            BIG_invmodp(u, u, r);
+            BIG_modmul(d, s, c, r);
+
+            BIG_modadd(d, f, d, r);
+            BIG_modmul(d, d, w, r);
+            BIG_modmul(d, u, d, r);
+
+        }
+        while (BIG_iszilch(d));
+    }
+    else
+    {
+        BIG_fromBytes(u, K->val);
+
+        ECP_copy(&V, &G);
+        ECP_clmul(&V, u, r);
+
+        ECP_get(vx, vx, &V);
+
+        BIG_copy(c, vx);
+        BIG_mod(c, r);
+        if (BIG_iszilch(c)) return ECDH_ERROR;
+
+        BIG_invmodp(u, u, r);
+        BIG_modmul(d, s, c, r);
+
+        BIG_modadd(d, f, d, r);
+        BIG_modmul(d, u, d, r);
+        if (BIG_iszilch(d)) return ECDH_ERROR;
+    }
+
+    C->len = D->len = EGS_ZZZ;
+
+    BIG_toBytes(C->val, c);
+    BIG_toBytes(D->val, d);
+
+    return 0;
+}
+
+/* IEEE1363 ECDSA Signature Verification. Signature C and D on F is verified using public key W */
+int ZZZ::ECP_VP_DSA(int hlen, octet *W, octet *F, octet *C, octet *D)
+{
+    char h[128];
+    octet H = {0, sizeof(h), h};
+
+    BIG r, wx, wy, f, c, d, h2;
+    int res = 0;
+    ECP G, WP;
+    int valid;
+
+    SPhash(MC_SHA2, hlen, &H, F);
+
+    ECP_generator(&G);
+    BIG_rcopy(r, CURVE_Order);
+
+    BIG_fromBytes(c, C->val);
+    BIG_fromBytes(d, D->val);
+
+    int blen = H.len;
+    if (blen > EGS_ZZZ) blen = EGS_ZZZ;
+
+    BIG_fromBytesLen(f, H.val, blen);
+
+    if (BIG_iszilch(c) || BIG_comp(c, r) >= 0 || BIG_iszilch(d) || BIG_comp(d, r) >= 0)
+        res = ECDH_ERROR;
+
+    if (res == 0)
+    {
+        BIG_invmodp(d, d, r);
+        BIG_modmul(f, f, d, r);
+        BIG_modmul(h2, c, d, r);
+
+        valid = ECP_fromOctet(&WP, W);
+        if (!valid) res = ECDH_ERROR;
+        else
+        {
+            ECP_mul2(&WP, &G, h2, f);
+            if (ECP_isinf(&WP)) res = ECDH_ERROR;
+            else
+            {
+                ECP_get(d, d, &WP);
+                BIG_mod(d, r);
+                if (BIG_comp(d, c) != 0) res = ECDH_ERROR;
+            }
+        }
+    }
+
+    return res;
+}
+
+/* IEEE1363 ECIES encryption. Encryption of plaintext M uses public key W and produces ciphertext V,C,T */
+void ZZZ::ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *RNG, octet *W, octet *M, int tlen, octet *V, octet *C, octet *T)
+{
+
+    int i, len;
+    char z[EFS_ZZZ], vz[3 * EFS_ZZZ + 1], k[2 * AESKEY_ZZZ], k1[AESKEY_ZZZ], k2[AESKEY_ZZZ], l2[8], u[EFS_ZZZ];
+    octet Z = {0, sizeof(z), z};
+    octet VZ = {0, sizeof(vz), vz};
+    octet K = {0, sizeof(k), k};
+    octet K1 = {0, sizeof(k1), k1};
+    octet K2 = {0, sizeof(k2), k2};
+    octet L2 = {0, sizeof(l2), l2};
+    octet U = {0, sizeof(u), u};
+
+    if (ECP_KEY_PAIR_GENERATE(RNG, &U, V) != 0) return;
+    if (ECP_SVDP_DH(&U, W, &Z,0) != 0) return;
+
+    OCT_copy(&VZ, V);
+    OCT_joctet(&VZ, &Z);
+
+    KDF2(MC_SHA2, hlen, &K, 2 * AESKEY_ZZZ, &VZ, P1);
+
+    K1.len = K2.len = AESKEY_ZZZ;
+    for (i = 0; i < AESKEY_ZZZ; i++)
+    {
+        K1.val[i] = K.val[i];
+        K2.val[i] = K.val[AESKEY_ZZZ + i];
+    }
+
+    AES_CBC_IV0_ENCRYPT(&K1, M, C);
+
+    OCT_jint(&L2, P2->len, 8);
+
+    len = C->len;
+    OCT_joctet(C, P2);
+    OCT_joctet(C, &L2);
+    HMAC(MC_SHA2, hlen, T, tlen, &K2, C);
+    C->len = len;
+}
+
+/* IEEE1363 ECIES decryption. Decryption of ciphertext V,C,T using private key U outputs plaintext M */
+int ZZZ::ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M)
+{
+
+    int i, len;
+    char z[EFS_ZZZ], vz[3 * EFS_ZZZ + 1], k[2 * AESKEY_ZZZ], k1[AESKEY_ZZZ], k2[AESKEY_ZZZ], l2[8], tag[32];
+    octet Z = {0, sizeof(z), z};
+    octet VZ = {0, sizeof(vz), vz};
+    octet K = {0, sizeof(k), k};
+    octet K1 = {0, sizeof(k1), k1};
+    octet K2 = {0, sizeof(k2), k2};
+    octet L2 = {0, sizeof(l2), l2};
+    octet TAG = {0, sizeof(tag), tag};
+
+    if (ECP_SVDP_DH(U, V, &Z,0) != 0) return 0;
+
+    OCT_copy(&VZ, V);
+    OCT_joctet(&VZ, &Z);
+
+    KDF2(MC_SHA2, hlen, &K, 2 * AESKEY_ZZZ, &VZ, P1);
+
+    K1.len = K2.len = AESKEY_ZZZ;
+    for (i = 0; i < AESKEY_ZZZ; i++)
+    {
+        K1.val[i] = K.val[i];
+        K2.val[i] = K.val[AESKEY_ZZZ + i];
+    }
+
+    if (!AES_CBC_IV0_DECRYPT(&K1, C, M)) return 0;
+
+    OCT_jint(&L2, P2->len, 8);
+
+    len = C->len;
+    OCT_joctet(C, P2);
+    OCT_joctet(C, &L2);
+    HMAC(MC_SHA2, hlen, &TAG, T->len, &K2, C);
+    C->len = len;
+
+    if (!OCT_ncomp(T, &TAG, T->len)) return 0;
+
+    return 1;
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh.h
new file mode 100644
index 0000000..9e1bad1
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_ZZZ_H
+#define ECDH_ZZZ_H
+
+#include "ecp_ZZZ.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_ZZZ MODBYTES_XXX  /**< ECC Group Size in bytes */
+#define EFS_ZZZ MODBYTES_XXX  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace ZZZ {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_ANSSI.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_ANSSI.h
new file mode 100644
index 0000000..53c64d9
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_ANSSI.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_ANSSI_H
+#define ECDH_ANSSI_H
+
+#include "ecp_ANSSI.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_ANSSI MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_ANSSI MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace ANSSI {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_BLS12381.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_BLS12381.h
new file mode 100644
index 0000000..a115148
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_BLS12381.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_BLS12381_H
+#define ECDH_BLS12381_H
+
+#include "ecp_BLS12381.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_BLS12381 MODBYTES_B384_58  /**< ECC Group Size in bytes */
+#define EFS_BLS12381 MODBYTES_B384_58  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace BLS12381 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_BLS12383.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_BLS12383.h
new file mode 100644
index 0000000..838aee2
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_BLS12383.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_BLS12383_H
+#define ECDH_BLS12383_H
+
+#include "ecp_BLS12383.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_BLS12383 MODBYTES_B384_58  /**< ECC Group Size in bytes */
+#define EFS_BLS12383 MODBYTES_B384_58  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace BLS12383 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_BLS12443.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_BLS12443.h
new file mode 100644
index 0000000..b274db0
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_BLS12443.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_BLS12443_H
+#define ECDH_BLS12443_H
+
+#include "ecp_BLS12443.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_BLS12443 MODBYTES_B448_60  /**< ECC Group Size in bytes */
+#define EFS_BLS12443 MODBYTES_B448_60  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace BLS12443 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_BLS12461.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_BLS12461.h
new file mode 100644
index 0000000..6bd3804
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_BLS12461.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_BLS12461_H
+#define ECDH_BLS12461_H
+
+#include "ecp_BLS12461.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_BLS12461 MODBYTES_B464_60  /**< ECC Group Size in bytes */
+#define EFS_BLS12461 MODBYTES_B464_60  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace BLS12461 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_BLS24479.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_BLS24479.h
new file mode 100644
index 0000000..b889779
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_BLS24479.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_BLS24479_H
+#define ECDH_BLS24479_H
+
+#include "ecp_BLS24479.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_BLS24479 MODBYTES_B480_56  /**< ECC Group Size in bytes */
+#define EFS_BLS24479 MODBYTES_B480_56  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace BLS24479 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_BLS48286.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_BLS48286.h
new file mode 100644
index 0000000..5505bca
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_BLS48286.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_BLS48286_H
+#define ECDH_BLS48286_H
+
+#include "ecp_BLS48286.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_BLS48286 MODBYTES_B288_60  /**< ECC Group Size in bytes */
+#define EFS_BLS48286 MODBYTES_B288_60  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace BLS48286 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_BLS48556.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_BLS48556.h
new file mode 100644
index 0000000..625a80a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_BLS48556.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_BLS48556_H
+#define ECDH_BLS48556_H
+
+#include "ecp_BLS48556.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_BLS48556 MODBYTES_B560_58  /**< ECC Group Size in bytes */
+#define EFS_BLS48556 MODBYTES_B560_58  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace BLS48556 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_BLS48581.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_BLS48581.h
new file mode 100644
index 0000000..87f3972
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_BLS48581.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_BLS48581_H
+#define ECDH_BLS48581_H
+
+#include "ecp_BLS48581.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_BLS48581 MODBYTES_B584_60  /**< ECC Group Size in bytes */
+#define EFS_BLS48581 MODBYTES_B584_60  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace BLS48581 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_BN158.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_BN158.h
new file mode 100644
index 0000000..ddcba94
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_BN158.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_BN158_H
+#define ECDH_BN158_H
+
+#include "ecp_BN158.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_BN158 MODBYTES_B160_56  /**< ECC Group Size in bytes */
+#define EFS_BN158 MODBYTES_B160_56  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace BN158 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_BN254.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_BN254.h
new file mode 100644
index 0000000..6c86d75
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_BN254.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_BN254_H
+#define ECDH_BN254_H
+
+#include "ecp_BN254.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_BN254 MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_BN254 MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace BN254 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_BN254CX.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_BN254CX.h
new file mode 100644
index 0000000..08c88a2
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_BN254CX.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_BN254CX_H
+#define ECDH_BN254CX_H
+
+#include "ecp_BN254CX.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_BN254CX MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_BN254CX MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace BN254CX {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_BN462.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_BN462.h
new file mode 100644
index 0000000..c54dcdf
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_BN462.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_BN462_H
+#define ECDH_BN462_H
+
+#include "ecp_BN462.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_BN462 MODBYTES_B464_60  /**< ECC Group Size in bytes */
+#define EFS_BN462 MODBYTES_B464_60  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace BN462 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_BRAINPOOL.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_BRAINPOOL.h
new file mode 100644
index 0000000..7e7fdc8
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_BRAINPOOL.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_BRAINPOOL_H
+#define ECDH_BRAINPOOL_H
+
+#include "ecp_BRAINPOOL.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_BRAINPOOL MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_BRAINPOOL MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace BRAINPOOL {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_C1174.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_C1174.h
new file mode 100644
index 0000000..29386f2
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_C1174.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_C1174_H
+#define ECDH_C1174_H
+
+#include "ecp_C1174.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_C1174 MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_C1174 MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace C1174 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_C13318.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_C13318.h
new file mode 100644
index 0000000..fd60112
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_C13318.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_C13318_H
+#define ECDH_C13318_H
+
+#include "ecp_C13318.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_C13318 MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_C13318 MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace C13318 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_C1665.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_C1665.h
new file mode 100644
index 0000000..bd74dc9
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_C1665.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_C1665_H
+#define ECDH_C1665_H
+
+#include "ecp_C1665.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_C1665 MODBYTES_B168_60  /**< ECC Group Size in bytes */
+#define EFS_C1665 MODBYTES_B168_60  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace C1665 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_C25519.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_C25519.h
new file mode 100644
index 0000000..f4bc2a2
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_C25519.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_C25519_H
+#define ECDH_C25519_H
+
+#include "ecp_C25519.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_C25519 MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_C25519 MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace C25519 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_C41417.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_C41417.h
new file mode 100644
index 0000000..d7ba0ab
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_C41417.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_C41417_H
+#define ECDH_C41417_H
+
+#include "ecp_C41417.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_C41417 MODBYTES_B416_60  /**< ECC Group Size in bytes */
+#define EFS_C41417 MODBYTES_B416_60  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace C41417 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_Ed25519.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_Ed25519.h
new file mode 100644
index 0000000..b5dcd9e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_Ed25519.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_Ed25519_H
+#define ECDH_Ed25519_H
+
+#include "ecp_Ed25519.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_Ed25519 MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_Ed25519 MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace Ed25519 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_Ed448.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_Ed448.h
new file mode 100644
index 0000000..e18a67d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_Ed448.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_Ed448_H
+#define ECDH_Ed448_H
+
+#include "ecp_Ed448.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_Ed448 MODBYTES_B448_58  /**< ECC Group Size in bytes */
+#define EFS_Ed448 MODBYTES_B448_58  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace Ed448 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_FP256BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_FP256BN.h
new file mode 100644
index 0000000..5667ae1
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_FP256BN.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_FP256BN_H
+#define ECDH_FP256BN_H
+
+#include "ecp_FP256BN.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_FP256BN MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_FP256BN MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace FP256BN {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_FP512BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_FP512BN.h
new file mode 100644
index 0000000..9d05890
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_FP512BN.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_FP512BN_H
+#define ECDH_FP512BN_H
+
+#include "ecp_FP512BN.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_FP512BN MODBYTES_B512_60  /**< ECC Group Size in bytes */
+#define EFS_FP512BN MODBYTES_B512_60  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace FP512BN {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_HIFIVE.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_HIFIVE.h
new file mode 100644
index 0000000..cfbb6eb
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_HIFIVE.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_HIFIVE_H
+#define ECDH_HIFIVE_H
+
+#include "ecp_HIFIVE.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_HIFIVE MODBYTES_B336_60  /**< ECC Group Size in bytes */
+#define EFS_HIFIVE MODBYTES_B336_60  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace HIFIVE {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_JUBJUB.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_JUBJUB.h
new file mode 100644
index 0000000..8942a38
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_JUBJUB.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_JUBJUB_H
+#define ECDH_JUBJUB_H
+
+#include "ecp_JUBJUB.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_JUBJUB MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_JUBJUB MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace JUBJUB {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_MDC.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_MDC.h
new file mode 100644
index 0000000..0eca124
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_MDC.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_MDC_H
+#define ECDH_MDC_H
+
+#include "ecp_MDC.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_MDC MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_MDC MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace MDC {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_NIST256.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_NIST256.h
new file mode 100644
index 0000000..bd35741
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_NIST256.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_NIST256_H
+#define ECDH_NIST256_H
+
+#include "ecp_NIST256.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_NIST256 MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_NIST256 MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace NIST256 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_NIST384.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_NIST384.h
new file mode 100644
index 0000000..4855851
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_NIST384.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_NIST384_H
+#define ECDH_NIST384_H
+
+#include "ecp_NIST384.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_NIST384 MODBYTES_B384_56  /**< ECC Group Size in bytes */
+#define EFS_NIST384 MODBYTES_B384_56  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace NIST384 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_NIST521.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_NIST521.h
new file mode 100644
index 0000000..fdfb94c
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_NIST521.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_NIST521_H
+#define ECDH_NIST521_H
+
+#include "ecp_NIST521.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_NIST521 MODBYTES_B528_60  /**< ECC Group Size in bytes */
+#define EFS_NIST521 MODBYTES_B528_60  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace NIST521 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_NUMS256E.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_NUMS256E.h
new file mode 100644
index 0000000..c0b0e30
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_NUMS256E.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_NUMS256E_H
+#define ECDH_NUMS256E_H
+
+#include "ecp_NUMS256E.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_NUMS256E MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_NUMS256E MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace NUMS256E {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_NUMS256W.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_NUMS256W.h
new file mode 100644
index 0000000..5049996
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_NUMS256W.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_NUMS256W_H
+#define ECDH_NUMS256W_H
+
+#include "ecp_NUMS256W.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_NUMS256W MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_NUMS256W MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace NUMS256W {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_NUMS384E.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_NUMS384E.h
new file mode 100644
index 0000000..bab56d8
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_NUMS384E.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_NUMS384E_H
+#define ECDH_NUMS384E_H
+
+#include "ecp_NUMS384E.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_NUMS384E MODBYTES_B384_58  /**< ECC Group Size in bytes */
+#define EFS_NUMS384E MODBYTES_B384_58  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace NUMS384E {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_NUMS384W.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_NUMS384W.h
new file mode 100644
index 0000000..fc360dc
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_NUMS384W.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_NUMS384W_H
+#define ECDH_NUMS384W_H
+
+#include "ecp_NUMS384W.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_NUMS384W MODBYTES_B384_58  /**< ECC Group Size in bytes */
+#define EFS_NUMS384W MODBYTES_B384_58  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace NUMS384W {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_NUMS512E.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_NUMS512E.h
new file mode 100644
index 0000000..61da8c2
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_NUMS512E.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_NUMS512E_H
+#define ECDH_NUMS512E_H
+
+#include "ecp_NUMS512E.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_NUMS512E MODBYTES_B512_60  /**< ECC Group Size in bytes */
+#define EFS_NUMS512E MODBYTES_B512_60  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace NUMS512E {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_NUMS512W.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_NUMS512W.h
new file mode 100644
index 0000000..685b0bf
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_NUMS512W.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_NUMS512W_H
+#define ECDH_NUMS512W_H
+
+#include "ecp_NUMS512W.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_NUMS512W MODBYTES_B512_60  /**< ECC Group Size in bytes */
+#define EFS_NUMS512W MODBYTES_B512_60  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace NUMS512W {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_SECP160R1.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_SECP160R1.h
new file mode 100644
index 0000000..ad71565
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_SECP160R1.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_SECP160R1_H
+#define ECDH_SECP160R1_H
+
+#include "ecp_SECP160R1.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_SECP160R1 MODBYTES_B160_56  /**< ECC Group Size in bytes */
+#define EFS_SECP160R1 MODBYTES_B160_56  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace SECP160R1 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_SECP256K1.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_SECP256K1.h
new file mode 100644
index 0000000..17a8e9c
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_SECP256K1.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_SECP256K1_H
+#define ECDH_SECP256K1_H
+
+#include "ecp_SECP256K1.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_SECP256K1 MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_SECP256K1 MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace SECP256K1 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_SM2.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_SM2.h
new file mode 100644
index 0000000..bf8fa02
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_SM2.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_SM2_H
+#define ECDH_SM2_H
+
+#include "ecp_SM2.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_SM2 MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_SM2 MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace SM2 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_TWEEDLEDEE.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_TWEEDLEDEE.h
new file mode 100644
index 0000000..efe1212
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_TWEEDLEDEE.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_TWEEDLEDEE_H
+#define ECDH_TWEEDLEDEE_H
+
+#include "ecp_TWEEDLEDEE.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_TWEEDLEDEE MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_TWEEDLEDEE MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace TWEEDLEDEE {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_TWEEDLEDUM.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_TWEEDLEDUM.h
new file mode 100644
index 0000000..d75dc9d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_TWEEDLEDUM.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_TWEEDLEDUM_H
+#define ECDH_TWEEDLEDUM_H
+
+#include "ecp_TWEEDLEDUM.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_TWEEDLEDUM MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_TWEEDLEDUM MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace TWEEDLEDUM {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_X448.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_X448.h
new file mode 100644
index 0000000..e171dc5
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecdh_X448.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_X448_H
+#define ECDH_X448_H
+
+#include "ecp_X448.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_X448 MODBYTES_B448_58  /**< ECC Group Size in bytes */
+#define EFS_X448 MODBYTES_B448_58  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace X448 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp.cpp
new file mode 100644
index 0000000..1ea8a2d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp.cpp
@@ -0,0 +1,1798 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* CORE Elliptic Curve Functions */
+/* SU=m, SU is Stack Usage (Weierstrass Curves) */
+
+//#define HAS_MAIN
+
+#include "ecp_ZZZ.h"
+
+using namespace XXX;
+using namespace YYY;
+
+/* test for P=O point-at-infinity */
+int ZZZ::ECP_isinf(ECP *P)
+{
+
+#if CURVETYPE_ZZZ==EDWARDS
+    return (FP_iszilch(&(P->x)) && FP_equals(&(P->y), &(P->z)));
+#endif
+#if CURVETYPE_ZZZ==WEIERSTRASS
+    return (FP_iszilch(&(P->x)) && FP_iszilch(&(P->z)));
+#endif
+#if CURVETYPE_ZZZ==MONTGOMERY
+    return FP_iszilch(&(P->z));
+#endif
+
+}
+
+/* Conditional swap of P and Q dependant on d */
+static void ECP_cswap(ZZZ::ECP *P, ZZZ::ECP *Q, int d)
+{
+    FP_cswap(&(P->x), &(Q->x), d);
+#if CURVETYPE_ZZZ!=MONTGOMERY
+    FP_cswap(&(P->y), &(Q->y), d);
+#endif
+    FP_cswap(&(P->z), &(Q->z), d);
+
+}
+
+#if CURVETYPE_ZZZ!=MONTGOMERY
+/* Conditional move Q to P dependant on d */
+static void ECP_cmove(ZZZ::ECP *P, ZZZ::ECP *Q, int d)
+{
+    FP_cmove(&(P->x), &(Q->x), d);
+#if CURVETYPE_ZZZ!=MONTGOMERY
+    FP_cmove(&(P->y), &(Q->y), d);
+#endif
+    FP_cmove(&(P->z), &(Q->z), d);
+
+}
+
+/* return 1 if b==c, no branching */
+static int teq(sign32 b, sign32 c)
+{
+    sign32 x = b ^ c;
+    x -= 1; // if x=0, x now -1
+    return (int)((x >> 31) & 1);
+}
+#endif // CURVETYPE_ZZZ!=MONTGOMERY
+
+#if CURVETYPE_ZZZ!=MONTGOMERY
+/* Constant time select from pre-computed table */
+static void ECP_select(ZZZ::ECP *P, ZZZ::ECP W[], sign32 b)
+{
+    ZZZ::ECP MP;
+    sign32 m = b >> 31;
+    sign32 babs = (b ^ m) - m;
+
+    babs = (babs - 1) / 2;
+
+    ECP_cmove(P, &W[0], teq(babs, 0)); // conditional move
+    ECP_cmove(P, &W[1], teq(babs, 1));
+    ECP_cmove(P, &W[2], teq(babs, 2));
+    ECP_cmove(P, &W[3], teq(babs, 3));
+    ECP_cmove(P, &W[4], teq(babs, 4));
+    ECP_cmove(P, &W[5], teq(babs, 5));
+    ECP_cmove(P, &W[6], teq(babs, 6));
+    ECP_cmove(P, &W[7], teq(babs, 7));
+
+    ECP_copy(&MP, P);
+    ECP_neg(&MP);  // minus P
+    ECP_cmove(P, &MP, (int)(m & 1));
+}
+#endif
+
+/* Test P == Q */
+/* SU=168 */
+int ZZZ::ECP_equals(ECP *P, ECP *Q)
+{
+    FP a, b;
+    FP_mul(&a, &(P->x), &(Q->z));
+    FP_mul(&b, &(Q->x), &(P->z));
+    if (!FP_equals(&a, &b)) return 0;
+
+#if CURVETYPE_ZZZ!=MONTGOMERY
+    FP_mul(&a, &(P->y), &(Q->z));
+    FP_mul(&b, &(Q->y), &(P->z));
+    if (!FP_equals(&a, &b)) return 0;
+#endif
+
+    return 1;
+}
+
+/* Set P=Q */
+/* SU=16 */
+void ZZZ::ECP_copy(ECP *P, ECP *Q)
+{
+    FP_copy(&(P->x), &(Q->x));
+#if CURVETYPE_ZZZ!=MONTGOMERY
+    FP_copy(&(P->y), &(Q->y));
+#endif
+    FP_copy(&(P->z), &(Q->z));
+}
+
+/* Set P=-Q */
+#if CURVETYPE_ZZZ!=MONTGOMERY
+/* SU=8 */
+void ZZZ::ECP_neg(ECP *P)
+{
+#if CURVETYPE_ZZZ==WEIERSTRASS
+    FP_neg(&(P->y), &(P->y));
+    FP_norm(&(P->y));
+#else
+    FP_neg(&(P->x), &(P->x));
+    FP_norm(&(P->x));
+#endif
+
+}
+#endif
+
+/* Set P=O */
+void ZZZ::ECP_inf(ECP *P)
+{
+    FP_zero(&(P->x));
+#if CURVETYPE_ZZZ!=MONTGOMERY
+    FP_one(&(P->y));
+#endif
+#if CURVETYPE_ZZZ!=EDWARDS
+    FP_zero(&(P->z));
+#else
+    FP_one(&(P->z));
+#endif
+}
+
+/* Calculate right Hand Side of curve equation y^2=RHS */
+/* SU=56 */
+void ZZZ::ECP_rhs(FP *v, FP *x)
+{
+#if CURVETYPE_ZZZ==WEIERSTRASS
+    /* x^3+Ax+B */
+    FP t;
+    FP_sqr(&t, x);
+    FP_mul(&t, &t, x);
+
+#if CURVE_A_ZZZ == -3    
+
+    FP_neg(v, x);
+    FP_norm(v);
+    FP_imul(v, v, -CURVE_A_ZZZ);
+    FP_norm(v);
+    FP_add(v, &t, v);
+#else
+    FP_copy(v, &t);
+#endif
+    FP_rcopy(&t, CURVE_B);
+
+    FP_add(v, &t, v);
+    FP_reduce(v);
+#endif
+
+#if CURVETYPE_ZZZ==EDWARDS
+    /* (Ax^2-1)/(Bx^2-1) */
+    FP t, one;
+    FP_sqr(v, x);
+    FP_one(&one);
+    FP_rcopy(&t, CURVE_B);
+
+    FP_mul(&t, v, &t);
+    FP_sub(&t, &t, &one);
+    FP_norm(&t);
+#if CURVE_A_ZZZ == 1
+    FP_sub(v, v, &one);
+#endif
+#if CURVE_A_ZZZ == -1
+    FP_add(v, v, &one);
+    FP_norm(v);
+    FP_neg(v, v);
+#endif
+    FP_norm(v);
+    FP_inv(&t, &t, NULL);
+    FP_mul(v, v, &t);
+    FP_reduce(v);
+#endif
+
+#if CURVETYPE_ZZZ==MONTGOMERY
+    /* x^3+Ax^2+x */
+    FP x2, x3;
+    FP_sqr(&x2, x);
+    FP_mul(&x3, &x2, x);
+    FP_copy(v, x);
+    FP_imul(&x2, &x2, CURVE_A_ZZZ);
+    FP_add(v, v, &x2);
+    FP_add(v, v, &x3);
+    FP_reduce(v);
+#endif
+}
+
+/* Set P=(x,y) */
+
+#if CURVETYPE_ZZZ==MONTGOMERY
+
+/* Set P=(x,{y}) */
+
+int ZZZ::ECP_set(ECP *P, BIG x)
+{
+    FP rhs;
+    FP_nres(&rhs, x);
+
+    ECP_rhs(&rhs, &rhs);
+
+    if (!FP_qr(&rhs,NULL))
+    {
+        ECP_inf(P);
+        return 0;
+    }
+
+    FP_nres(&(P->x), x);
+    FP_one(&(P->z));
+    return 1;
+}
+
+/* Extract x coordinate as BIG */
+int ZZZ::ECP_get(BIG x, ECP *P)
+{
+    ECP W;
+    ECP_copy(&W, P);
+    ECP_affine(&W);
+    if (ECP_isinf(&W)) return -1;
+    FP_redc(x, &(W.x));
+    return 0;
+}
+
+
+#else
+/* Extract (x,y) and return sign of y. If x and y are the same return only x */
+/* SU=16 */
+int ZZZ::ECP_get(BIG x, BIG y, ECP *P)
+{
+    ECP W;
+    ECP_copy(&W, P);
+    ECP_affine(&W);
+    if (ECP_isinf(&W)) return -1;
+    FP_redc(y, &(W.y));
+    FP_redc(x, &(W.x));
+    return FP_sign(&(W.y));
+}
+
+/* Set P=(x,{y}) */
+/* SU=96 */
+int ZZZ::ECP_set(ECP *P, BIG x, BIG y)
+{
+    FP rhs, y2;
+
+    FP_nres(&y2, y);
+    FP_sqr(&y2, &y2);
+    FP_reduce(&y2);
+
+    FP_nres(&rhs, x);
+    ECP_rhs(&rhs, &rhs);
+
+    if (!FP_equals(&y2, &rhs))
+    {
+        ECP_inf(P);
+        return 0;
+    }
+
+    FP_nres(&(P->x), x);
+    FP_nres(&(P->y), y);
+    FP_one(&(P->z));
+    return 1;
+}
+
+/* Set P=(x,y), where y is calculated from x with sign s */
+/* SU=136 */
+int ZZZ::ECP_setx(ECP *P, BIG x, int s)
+{
+    FP rhs,hint;
+    FP_nres(&rhs, x);
+
+    ECP_rhs(&rhs, &rhs);
+
+    if (!FP_qr(&rhs,&hint))
+    {
+        ECP_inf(P);
+        return 0;
+    }
+
+    FP_nres(&(P->x), x);
+    FP_sqrt(&(P->y), &rhs, &hint);
+
+    if (FP_sign(&(P->y))!=s)
+        FP_neg(&(P->y), &(P->y));
+    FP_reduce(&(P->y));
+    FP_one(&(P->z));
+    return 1;
+}
+
+#endif
+
+/* Convert P to Affine, from (x,y,z) to (x,y) */
+/* SU=160 */
+void ZZZ::ECP_affine(ECP *P)
+{
+    FP one, iz;
+    if (ECP_isinf(P)) return;
+    FP_one(&one);
+    if (FP_equals(&(P->z), &one)) return;
+
+    FP_inv(&iz, &(P->z), NULL);
+    FP_mul(&(P->x), &(P->x), &iz);
+
+#if CURVETYPE_ZZZ==EDWARDS || CURVETYPE_ZZZ==WEIERSTRASS
+
+    FP_mul(&(P->y), &(P->y), &iz);
+    FP_reduce(&(P->y));
+
+#endif
+
+    FP_reduce(&(P->x));
+    FP_copy(&(P->z), &one);
+}
+
+/* SU=120 */
+void ZZZ::ECP_outputxyz(ECP *P)
+{
+    BIG x, z;
+    if (ECP_isinf(P))
+    {
+        printf("Infinity\n");
+        return;
+    }
+    FP_reduce(&(P->x));
+    FP_redc(x, &(P->x));
+    FP_reduce(&(P->z));
+    FP_redc(z, &(P->z));
+
+#if CURVETYPE_ZZZ!=MONTGOMERY
+    BIG y;
+    FP_reduce(&(P->y));
+    FP_redc(y, &(P->y));
+    printf("(");
+    BIG_output(x);
+    printf(",");
+    BIG_output(y);
+    printf(",");
+    BIG_output(z);
+    printf(")\n");
+
+#else
+    printf("(");
+    BIG_output(x);
+    printf(",");
+    BIG_output(z);
+    printf(")\n");
+#endif
+}
+
+/* SU=16 */
+/* Output point P */
+void ZZZ::ECP_output(ECP *P)
+{
+    BIG x, y;
+    if (ECP_isinf(P))
+    {
+        printf("Infinity\n");
+        return;
+    }
+    ECP_affine(P);
+#if CURVETYPE_ZZZ!=MONTGOMERY
+    FP_reduce(&(P->x));
+    FP_reduce(&(P->y));
+    FP_redc(x, &(P->x));
+    FP_redc(y, &(P->y));
+    printf("(");
+    BIG_output(x);
+    printf(",");
+    BIG_output(y);
+    printf(")\n");
+#else
+    FP_reduce(&(P->x));
+    FP_redc(x, &(P->x));
+    printf("(");
+    BIG_output(x);
+    printf(")\n");
+#endif
+}
+
+/* SU=16 */
+/* Output point P */
+void ZZZ::ECP_rawoutput(ECP *P)
+{
+    BIG x, y, z;
+
+#if CURVETYPE_ZZZ!=MONTGOMERY
+    FP_redc(x, &(P->x));
+    FP_redc(y, &(P->y));
+    FP_redc(z, &(P->z));
+    printf("(");
+    BIG_output(x);
+    printf(",");
+    BIG_output(y);
+    printf(",");
+    BIG_output(z);
+    printf(")\n");
+#else
+    FP_redc(x, &(P->x));
+    FP_redc(z, &(P->z));
+    printf("(");
+    BIG_output(x);
+    printf(",");
+    BIG_output(z);
+    printf(")\n");
+#endif
+}
+
+/* SU=88 */
+/* Convert P to octet string, compressing if desired */
+void ZZZ::ECP_toOctet(octet *W, ECP *P, bool compress)
+{
+#if CURVETYPE_ZZZ==MONTGOMERY
+    BIG x;
+    ECP_get(x, P);
+    W->len = MODBYTES_XXX; // + 1;
+    BIG_toBytes(&(W->val[0]), x);
+#else
+    BIG x, y;
+    bool alt=false;
+    ECP_affine(P);
+    ECP_get(x, y, P);
+
+#if (MBITS-1)%8 <= 4
+#ifdef ALLOW_ALT_COMPRESS_ZZZ
+    alt=true;
+#endif
+#endif
+
+    if (alt)
+    {
+        BIG_toBytes(&(W->val[0]), x);
+        if (compress)
+        {
+            W->len = MODBYTES_XXX;
+            W->val[0]|=0x80;
+            if (FP_islarger(&(P->y))==1) W->val[0]|=0x20;
+        } else {
+            W->len = 2 * MODBYTES_XXX;
+            BIG_toBytes(&(W->val[MODBYTES_XXX]), y);
+        }
+    } else {
+        BIG_toBytes(&(W->val[1]), x);
+        if (compress)
+        {
+            W->val[0] = 0x02;
+            if (FP_sign(&(P->y)) == 1) W->val[0] = 0x03;
+            W->len = MODBYTES_XXX + 1;
+        } else {
+            W->val[0] = 0x04;
+            W->len = 2 * MODBYTES_XXX + 1;
+            BIG_toBytes(&(W->val[MODBYTES_XXX + 1]), y);
+        }
+    }
+#endif
+}
+
+/* SU=88 */
+/* Restore P from octet string */
+int ZZZ::ECP_fromOctet(ECP *P, octet *W)
+{
+#if CURVETYPE_ZZZ==MONTGOMERY
+    BIG x;
+    BIG_fromBytes(x, &(W->val[0]));
+    if (ECP_set(P, x)) return 1;
+    return 0;
+#else
+    BIG x, y;
+    bool alt=false;
+    int sgn,cmp,typ = W->val[0];
+
+#if (MBITS-1)%8 <= 4
+#ifdef ALLOW_ALT_COMPRESS_ZZZ
+    alt=true;
+#endif
+#endif
+
+    if (alt)
+    {
+        W->val[0]&=0x1f;
+        BIG_fromBytes(x, &(W->val[0]));
+        W->val[0]=typ;
+        if ((typ&0x80)==0)
+        {
+            BIG_fromBytes(y, &(W->val[MODBYTES_XXX]));
+            if (ECP_set(P, x, y)) return 1;
+            return 0;
+        } else {
+            if (!ECP_setx(P,x,0)) return 0;
+            sgn=(typ&0x20)>>5;
+            cmp=FP_islarger(&(P->y));
+            if ((sgn==1 && cmp!=1) || (sgn==0 && cmp==1)) ECP_neg(P);
+            return 1;
+        }
+
+    } else {
+        BIG_fromBytes(x, &(W->val[1]));
+        if (typ == 0x04)
+        {
+            BIG_fromBytes(y, &(W->val[MODBYTES_XXX + 1]));
+            if (ECP_set(P, x, y)) return 1;
+        }
+        if (typ == 0x02 || typ == 0x03)
+        {
+            if (ECP_setx(P, x, typ & 1)) return 1;
+        }
+    }
+    return 0;
+#endif
+}
+
+
+/* Set P=2P */
+/* SU=272 */
+void ZZZ::ECP_dbl(ECP *P)
+{
+#if CURVETYPE_ZZZ==WEIERSTRASS
+    FP t0, t1, t2, t3, x3, y3, z3, b;
+
+#if CURVE_A_ZZZ == 0
+
+        FP_sqr(&t0, &(P->y));                   //t0.sqr();
+        FP_mul(&t1, &(P->y), &(P->z));          //t1.mul(z);
+
+        FP_sqr(&t2, &(P->z));                   //t2.sqr();
+
+        FP_add(&(P->z), &t0, &t0);          //z.add(t0);
+        FP_norm(&(P->z));                   //z.norm();
+        FP_add(&(P->z), &(P->z), &(P->z));  //z.add(z);
+        FP_add(&(P->z), &(P->z), &(P->z));  //z.add(z);
+        FP_norm(&(P->z));                   //z.norm();
+
+        FP_imul(&t2, &t2, 3 * CURVE_B_I);   //t2.imul(3*ROM.CURVE_B_I);
+        FP_mul(&x3, &t2, &(P->z));          //x3.mul(z);
+
+        FP_add(&y3, &t0, &t2);              //y3.add(t2);
+        FP_norm(&y3);                       //y3.norm();
+        FP_mul(&(P->z), &(P->z), &t1);      //z.mul(t1);
+
+        FP_add(&t1, &t2, &t2);              //t1.add(t2);
+        FP_add(&t2, &t2, &t1);              //t2.add(t1);
+        FP_sub(&t0, &t0, &t2);              //t0.sub(t2);
+        FP_norm(&t0);                       //t0.norm();
+        FP_mul(&y3, &y3, &t0);              //y3.mul(t0);
+        FP_add(&y3, &y3, &x3);              //y3.add(x3);
+
+        FP_mul(&t1, &(P->x), &(P->y));          //t1.mul(y);
+        FP_norm(&t0);                   //x.norm();
+        FP_mul(&(P->x), &t0, &t1);      //x.mul(t1);
+        FP_add(&(P->x), &(P->x), &(P->x));  //x.add(x);
+        FP_norm(&(P->x));                   //x.norm();
+        FP_copy(&(P->y), &y3);              //y.copy(y3);
+        FP_norm(&(P->y));                   //y.norm();
+#else
+
+        if (CURVE_B_I == 0)                 //if (ROM.CURVE_B_I==0)
+            FP_rcopy(&b, CURVE_B);          //b.copy(new FP(new BIG(ROM.CURVE_B)));
+
+        FP_sqr(&t0, &(P->x));                   //t0.sqr();  //1    x^2
+        FP_sqr(&t1, &(P->y));                   //t1.sqr();  //2    y^2
+        FP_sqr(&t2, &(P->z));                   //t2.sqr();  //3
+
+        FP_mul(&t3, &(P->x), &(P->y));          //t3.mul(y); //4
+        FP_add(&t3, &t3, &t3);              //t3.add(t3);
+        FP_norm(&t3);                       //t3.norm();//5
+
+        FP_mul(&z3, &(P->z), &(P->x));          //z3.mul(x);   //6
+        FP_add(&z3, &z3, &z3);              //z3.add(z3);
+        FP_norm(&z3);                       //z3.norm();//7
+
+        if (CURVE_B_I == 0)                     //if (ROM.CURVE_B_I==0)
+            FP_mul(&y3, &t2, &b);           //y3.mul(b); //8
+        else
+            FP_imul(&y3, &t2, CURVE_B_I);   //y3.imul(ROM.CURVE_B_I);
+
+        FP_sub(&y3, &y3, &z3);              //y3.sub(z3); //y3.norm(); //9  ***
+        FP_add(&x3, &y3, &y3);              //x3.add(y3);
+        FP_norm(&x3);                       //x3.norm();//10
+
+        FP_add(&y3, &y3, &x3);              //y3.add(x3); //y3.norm();//11
+        FP_sub(&x3, &t1, &y3);              //x3.sub(y3);
+        FP_norm(&x3);                       //x3.norm();//12
+        FP_add(&y3, &y3, &t1);              //y3.add(t1);
+        FP_norm(&y3);                       //y3.norm();//13
+        FP_mul(&y3, &y3, &x3);              //y3.mul(x3); //14
+        FP_mul(&x3, &x3, &t3);              //x3.mul(t3); //15
+        FP_add(&t3, &t2, &t2);              //t3.add(t2);  //16
+        FP_add(&t2, &t2, &t3);              //t2.add(t3); //17
+
+        if (CURVE_B_I == 0)                 //if (ROM.CURVE_B_I==0)
+            FP_mul(&z3, &z3, &b);           //z3.mul(b); //18
+        else
+            FP_imul(&z3, &z3, CURVE_B_I); //z3.imul(ROM.CURVE_B_I);
+
+        FP_sub(&z3, &z3, &t2);              //z3.sub(t2); //z3.norm();//19
+        FP_sub(&z3, &z3, &t0);              //z3.sub(t0);
+        FP_norm(&z3);                       //z3.norm();//20  ***
+        FP_add(&t3, &z3, &z3);              //t3.add(z3); //t3.norm();//21
+
+        FP_add(&z3, &z3, &t3);              //z3.add(t3);
+        FP_norm(&z3);                       //z3.norm(); //22
+        FP_add(&t3, &t0, &t0);              //t3.add(t0); //t3.norm(); //23
+        FP_add(&t0, &t0, &t3);              //t0.add(t3); //t0.norm();//24
+        FP_sub(&t0, &t0, &t2);              //t0.sub(t2);
+        FP_norm(&t0);                       //t0.norm();//25
+
+        FP_mul(&t0, &t0, &z3);              //t0.mul(z3);//26
+        FP_add(&y3, &y3, &t0);              //y3.add(t0); //y3.norm();//27
+        FP_mul(&t0, &(P->y), &(P->z));          //t0.mul(z);//28
+        FP_add(&t0, &t0, &t0);              //t0.add(t0);
+        FP_norm(&t0);                       //t0.norm(); //29
+        FP_mul(&z3, &z3, &t0);              //z3.mul(t0);//30
+        FP_sub(&(P->x), &x3, &z3);              //x3.sub(z3); //x3.norm();//31
+        FP_add(&t0, &t0, &t0);              //t0.add(t0);
+        FP_norm(&t0);                       //t0.norm();//32
+        FP_add(&t1, &t1, &t1);              //t1.add(t1);
+        FP_norm(&t1);                       //t1.norm();//33
+        FP_mul(&(P->z), &t0, &t1);              //z3.mul(t1);//34
+
+        FP_norm(&(P->x));                   //x.norm();
+        FP_copy(&(P->y), &y3);              //y.copy(y3);
+        FP_norm(&(P->y));                   //y.norm();
+        FP_norm(&(P->z));                   //z.norm();
+#endif
+#endif
+
+#if CURVETYPE_ZZZ==EDWARDS
+    /* Not using square for multiplication swap, as (1) it needs more adds, and (2) it triggers more reductions */
+
+    FP C, D, H, J;
+    FP_sqr(&C, &(P->x));                    //C.sqr();
+    FP_mul(&(P->x), &(P->x), &(P->y));      //x.mul(y);
+    FP_add(&(P->x), &(P->x), &(P->x));      //x.add(x);
+    FP_norm(&(P->x));                       //x.norm();
+
+    FP_sqr(&D, &(P->y));                        //D.sqr();
+
+#if CURVE_A_ZZZ == -1    
+    FP_neg(&C, &C);             //  C.neg();
+#endif
+    FP_add(&(P->y), &C, &D);    //y.add(D);
+    FP_norm(&(P->y));               //y.norm();
+    FP_sqr(&H, &(P->z));                //H.sqr();
+    FP_add(&H, &H, &H);             //H.add(H);
+
+    FP_sub(&J, &(P->y), &H);            //J.sub(H);
+    FP_norm(&J);                    //J.norm();
+
+    FP_mul(&(P->x), &(P->x), &J);   //x.mul(J);
+    FP_sub(&C, &C, &D);             //C.sub(D);
+    FP_norm(&C);                    //C.norm();
+    FP_mul(&(P->z), &(P->y), &J);   //z.mul(J);
+    FP_mul(&(P->y), &(P->y), &C);   //y.mul(C);
+
+
+#endif
+
+#if CURVETYPE_ZZZ==MONTGOMERY
+    FP A, B, AA, BB, C;
+
+    FP_add(&A, &(P->x), &(P->z));   //A.add(z);
+    FP_norm(&A);                    //A.norm();
+    FP_sqr(&AA, &A);                //AA.sqr();
+    FP_sub(&B, &(P->x), &(P->z));   //B.sub(z);
+    FP_norm(&B);                    //B.norm();
+    FP_sqr(&BB, &B);                //BB.sqr();
+    FP_sub(&C, &AA, &BB);           //C.sub(BB);
+    FP_norm(&C);                    //C.norm();
+    FP_mul(&(P->x), &AA, &BB);      //x.mul(BB);
+
+    FP_imul(&A, &C, (CURVE_A_ZZZ + 2) / 4); //A.imul((ROM.CURVE_A+2)/4);
+
+    FP_add(&BB, &BB, &A);           //BB.add(A);
+    FP_norm(&BB);                   //BB.norm();
+    FP_mul(&(P->z), &BB, &C);   //z.mul(C);
+
+#endif
+}
+
+#if CURVETYPE_ZZZ==MONTGOMERY
+
+/* Set P+=Q. W is difference between P and Q and is affine */
+void ZZZ::ECP_add(ECP *P, ECP *Q, ECP *W)
+{
+    FP A, B, C, D, DA, CB;
+
+    FP_add(&A, &(P->x), &(P->z)); //A.add(z);
+    FP_sub(&B, &(P->x), &(P->z)); //B.sub(z);
+
+    FP_add(&C, &(Q->x), &(Q->z)); //C.add(Q.z);
+    FP_sub(&D, &(Q->x), &(Q->z)); //D.sub(Q.z);
+
+    FP_norm(&A);            //A.norm();
+    FP_norm(&D);            //D.norm();
+    FP_mul(&DA, &D, &A);    //DA.mul(A);
+
+    FP_norm(&C);            //C.norm();
+    FP_norm(&B);            //B.norm();
+    FP_mul(&CB, &C, &B);    //CB.mul(B);
+
+    FP_add(&A, &DA, &CB);   //A.add(CB);
+    FP_norm(&A);            //A.norm();
+    FP_sqr(&(P->x), &A);    //A.sqr();
+    FP_sub(&B, &DA, &CB);   //B.sub(CB);
+    FP_norm(&B);            //B.norm();
+    FP_sqr(&B, &B);         //B.sqr();
+
+    FP_mul(&(P->z), &(W->x), &B); //z.mul(B);
+}
+
+#else
+
+/* Set P+=Q */
+/* SU=248 */
+void ZZZ::ECP_add(ECP *P, ECP *Q)
+{
+#if CURVETYPE_ZZZ==WEIERSTRASS
+
+    int b3;
+    FP t0, t1, t2, t3, t4, x3, y3, z3, b;
+
+#if CURVE_A_ZZZ == 0
+        b3 = 3 * CURVE_B_I;             //int b=3*ROM.CURVE_B_I;
+        FP_mul(&t0, &(P->x), &(Q->x));      //t0.mul(Q.x);
+        FP_mul(&t1, &(P->y), &(Q->y));      //t1.mul(Q.y);
+        FP_mul(&t2, &(P->z), &(Q->z));      //t2.mul(Q.z);
+        FP_add(&t3, &(P->x), &(P->y));      //t3.add(y);
+        FP_norm(&t3);                   //t3.norm();
+        FP_add(&t4, &(Q->x), &(Q->y));      //t4.add(Q.y);
+        FP_norm(&t4);                   //t4.norm();
+        FP_mul(&t3, &t3, &t4);          //t3.mul(t4);
+        FP_add(&t4, &t0, &t1);          //t4.add(t1);
+
+        FP_sub(&t3, &t3, &t4);          //t3.sub(t4);
+        FP_norm(&t3);                   //t3.norm();
+        FP_add(&t4, &(P->y), &(P->z));      //t4.add(z);
+        FP_norm(&t4);                   //t4.norm();
+        FP_add(&x3, &(Q->y), &(Q->z));      //x3.add(Q.z);
+        FP_norm(&x3);                   //x3.norm();
+
+        FP_mul(&t4, &t4, &x3);          //t4.mul(x3);
+        FP_add(&x3, &t1, &t2);          //x3.add(t2);
+
+        FP_sub(&t4, &t4, &x3);          //t4.sub(x3);
+        FP_norm(&t4);                   //t4.norm();
+        FP_add(&x3, &(P->x), &(P->z));      //x3.add(z);
+        FP_norm(&x3);                   //x3.norm();
+        FP_add(&y3, &(Q->x), &(Q->z));      //y3.add(Q.z);
+        FP_norm(&y3);                   //y3.norm();
+        FP_mul(&x3, &x3, &y3);          //x3.mul(y3);
+        FP_add(&y3, &t0, &t2);          //y3.add(t2);
+        FP_sub(&y3, &x3, &y3);          //y3.rsub(x3);
+        FP_norm(&y3);                   //y3.norm();
+        FP_add(&x3, &t0, &t0);          //x3.add(t0);
+        FP_add(&t0, &t0, &x3);          //t0.add(x3);
+        FP_norm(&t0);                   //t0.norm();
+        FP_imul(&t2, &t2, b3);          //t2.imul(b);
+
+        FP_add(&z3, &t1, &t2);          //z3.add(t2);
+        FP_norm(&z3);                   //z3.norm();
+        FP_sub(&t1, &t1, &t2);          //t1.sub(t2);
+        FP_norm(&t1);                   //t1.norm();
+        FP_imul(&y3, &y3, b3);          //y3.imul(b);
+
+        FP_mul(&x3, &y3, &t4);          //x3.mul(t4);
+        FP_mul(&t2, &t3, &t1);          //t2.mul(t1);
+        FP_sub(&(P->x), &t2, &x3);          //x3.rsub(t2);
+        FP_mul(&y3, &y3, &t0);          //y3.mul(t0);
+        FP_mul(&t1, &t1, &z3);          //t1.mul(z3);
+        FP_add(&(P->y), &y3, &t1);          //y3.add(t1);
+        FP_mul(&t0, &t0, &t3);          //t0.mul(t3);
+        FP_mul(&z3, &z3, &t4);          //z3.mul(t4);
+        FP_add(&(P->z), &z3, &t0);          //z3.add(t0);
+
+        FP_norm(&(P->x));               //x.norm();
+        FP_norm(&(P->y));               //y.norm();
+        FP_norm(&(P->z));               //z.norm();
+#else
+
+        if (CURVE_B_I == 0)             //if (ROM.CURVE_B_I==0)
+            FP_rcopy(&b, CURVE_B);  //b.copy(new FP(new BIG(ROM.CURVE_B)));
+
+        FP_mul(&t0, &(P->x), &(Q->x));      //t0.mul(Q.x); //1
+        FP_mul(&t1, &(P->y), &(Q->y));      //t1.mul(Q.y); //2
+        FP_mul(&t2, &(P->z), &(Q->z));      //t2.mul(Q.z); //3
+
+        FP_add(&t3, &(P->x), &(P->y));      //t3.add(y);
+        FP_norm(&t3);                   //t3.norm(); //4
+        FP_add(&t4, &(Q->x), &(Q->y));      //t4.add(Q.y);
+        FP_norm(&t4);                   //t4.norm();//5
+        FP_mul(&t3, &t3, &t4);          //t3.mul(t4);//6
+        FP_add(&t4, &t0, &t1);          //t4.add(t1); //t4.norm(); //7
+        FP_sub(&t3, &t3, &t4);          //t3.sub(t4);
+        FP_norm(&t3);                   //t3.norm(); //8
+        FP_add(&t4, &(P->y), &(P->z));      //t4.add(z);
+        FP_norm(&t4);                   //t4.norm();//9
+        FP_add(&x3, &(Q->y), &(Q->z));      //x3.add(Q.z);
+        FP_norm(&x3);                   //x3.norm();//10
+        FP_mul(&t4, &t4, &x3);          //t4.mul(x3); //11
+        FP_add(&x3, &t1, &t2);          //x3.add(t2); //x3.norm();//12
+
+        FP_sub(&t4, &t4, &x3);          //t4.sub(x3);
+        FP_norm(&t4);                   //t4.norm();//13
+        FP_add(&x3, &(P->x), &(P->z));      //x3.add(z);
+        FP_norm(&x3);                   //x3.norm(); //14
+        FP_add(&y3, &(Q->x), &(Q->z));      //y3.add(Q.z);
+        FP_norm(&y3);                   //y3.norm();//15
+
+        FP_mul(&x3, &x3, &y3);          //x3.mul(y3); //16
+        FP_add(&y3, &t0, &t2);          //y3.add(t2); //y3.norm();//17
+
+        FP_sub(&y3, &x3, &y3);          //y3.rsub(x3);
+        FP_norm(&y3);                   //y3.norm(); //18
+
+        if (CURVE_B_I == 0)             //if (ROM.CURVE_B_I==0)
+            FP_mul(&z3, &t2, &b);       //z3.mul(b); //18
+        else
+            FP_imul(&z3, &t2, CURVE_B_I); //z3.imul(ROM.CURVE_B_I);
+
+        FP_sub(&x3, &y3, &z3);          //x3.sub(z3);
+        FP_norm(&x3);                   //x3.norm(); //20
+        FP_add(&z3, &x3, &x3);          //z3.add(x3); //z3.norm(); //21
+
+        FP_add(&x3, &x3, &z3);          //x3.add(z3); //x3.norm(); //22
+        FP_sub(&z3, &t1, &x3);          //z3.sub(x3);
+        FP_norm(&z3);                   //z3.norm(); //23
+        FP_add(&x3, &x3, &t1);          //x3.add(t1);
+        FP_norm(&x3);                   //x3.norm(); //24
+
+        if (CURVE_B_I == 0)             //if (ROM.CURVE_B_I==0)
+            FP_mul(&y3, &y3, &b);       //y3.mul(b); //18
+        else
+            FP_imul(&y3, &y3, CURVE_B_I); //y3.imul(ROM.CURVE_B_I);
+
+        FP_add(&t1, &t2, &t2);          //t1.add(t2); //t1.norm();//26
+        FP_add(&t2, &t2, &t1);          //t2.add(t1); //t2.norm();//27
+
+        FP_sub(&y3, &y3, &t2);          //y3.sub(t2); //y3.norm(); //28
+
+        FP_sub(&y3, &y3, &t0);          //y3.sub(t0);
+        FP_norm(&y3);                   //y3.norm(); //29
+        FP_add(&t1, &y3, &y3);          //t1.add(y3); //t1.norm();//30
+        FP_add(&y3, &y3, &t1);          //y3.add(t1);
+        FP_norm(&y3);                   //y3.norm(); //31
+
+        FP_add(&t1, &t0, &t0);          //t1.add(t0); //t1.norm(); //32
+        FP_add(&t0, &t0, &t1);          //t0.add(t1); //t0.norm();//33
+        FP_sub(&t0, &t0, &t2);          //t0.sub(t2);
+        FP_norm(&t0);                   //t0.norm();//34
+        FP_mul(&t1, &t4, &y3);          //t1.mul(y3);//35
+        FP_mul(&t2, &t0, &y3);          //t2.mul(y3);//36
+        FP_mul(&y3, &x3, &z3);          //y3.mul(z3);//37
+        FP_add(&(P->y), &y3, &t2);          //y3.add(t2); //y3.norm();//38
+        FP_mul(&x3, &x3, &t3);          //x3.mul(t3);//39
+        FP_sub(&(P->x), &x3, &t1);          //x3.sub(t1);//40
+        FP_mul(&z3, &z3, &t4);          //z3.mul(t4);//41
+
+        FP_mul(&t1, &t3, &t0);          //t1.mul(t0);//42
+        FP_add(&(P->z), &z3, &t1);          //z3.add(t1);
+        FP_norm(&(P->x));               //x.norm();
+        FP_norm(&(P->y));               //y.norm();
+        FP_norm(&(P->z));               //z.norm();
+#endif
+
+#else
+    FP A, B, C, D, E, F, G, b;
+
+    FP_mul(&A, &(P->z), &(Q->z));   //A.mul(Q.z);
+    FP_sqr(&B, &A);                 //B.sqr();
+    FP_mul(&C, &(P->x), &(Q->x));   //C.mul(Q.x);
+    FP_mul(&D, &(P->y), &(Q->y));   //D.mul(Q.y);
+
+    FP_mul(&E, &C, &D);             //E.mul(D);
+
+    if (CURVE_B_I == 0)         //if (ROM.CURVE_B_I==0)
+    {
+        FP_rcopy(&b, CURVE_B);  //FP b=new FP(new BIG(ROM.CURVE_B));
+        FP_mul(&E, &E, &b);         //E.mul(b);
+    }
+    else
+        FP_imul(&E, &E, CURVE_B_I); //E.imul(ROM.CURVE_B_I);
+
+    FP_sub(&F, &B, &E);         //F.sub(E);
+    FP_add(&G, &B, &E);         //G.add(E);
+
+#if CURVE_A_ZZZ == 1
+    FP_sub(&E, &D, &C);     //E.sub(C);
+#endif
+    FP_add(&C, &C, &D);         //C.add(D);
+
+    FP_add(&B, &(P->x), &(P->y));   //B.add(y);
+    FP_add(&D, &(Q->x), &(Q->y));   //D.add(Q.y);
+    FP_norm(&B);                //B.norm();
+    FP_norm(&D);                //D.norm();
+    FP_mul(&B, &B, &D);         //B.mul(D);
+    FP_sub(&B, &B, &C);         //B.sub(C);
+    FP_norm(&B);                //B.norm();
+    FP_norm(&F);                //F.norm();
+    FP_mul(&B, &B, &F);         //B.mul(F);
+    FP_mul(&(P->x), &A, &B); //x.mul(B);
+    FP_norm(&G);                //G.norm();
+
+#if CURVE_A_ZZZ == 1
+    FP_norm(&E);            //E.norm();
+    FP_mul(&C, &E, &G);     //C.mul(G);
+#endif
+
+#if CURVE_A_ZZZ == -1
+    FP_norm(&C);            //C.norm();
+    FP_mul(&C, &C, &G);     //C.mul(G);
+#endif
+    FP_mul(&(P->y), &A, &C); //y.mul(C);
+    FP_mul(&(P->z), &F, &G); //z.mul(G);
+
+#endif
+}
+
+/* Set P-=Q */
+/* SU=16 */
+void  ZZZ::ECP_sub(ECP *P, ECP *Q)
+{
+    ECP NQ;
+    ECP_copy(&NQ, Q);
+    ECP_neg(&NQ);
+    ECP_add(P, &NQ);
+}
+
+#endif
+
+#if CURVETYPE_ZZZ!=MONTGOMERY
+/* constant time multiply by small integer of length bts - use ladder */
+void ZZZ::ECP_pinmul(ECP *P, int e, int bts)
+{
+    int i, b;
+    ECP R0, R1;
+
+    ECP_affine(P);
+    ECP_inf(&R0);
+    ECP_copy(&R1, P);
+
+    for (i = bts - 1; i >= 0; i--)
+    {
+        b = (e >> i) & 1;
+        ECP_copy(P, &R1);
+        ECP_add(P, &R0);
+        ECP_cswap(&R0, &R1, b);
+        ECP_copy(&R1, P);
+        ECP_dbl(&R0);
+        ECP_cswap(&R0, &R1, b);
+    }
+    ECP_copy(P, &R0);
+}
+#endif
+
+// Point multiplication, multiplies a point P by a scalar e
+// This code has no inherent awareness of the order of the curve, or the order of the point.
+// The order of the curve will be h.r, where h is a cofactor, and r is a large prime
+// Typically P will be of order r (but not always), and typically e will be less than r (but not always)
+// A problem can arise if a secret e is a few bits less than r, as the leading zeros in e will leak via a timing attack
+// The secret e may however be greater than r (see RFC7748 which combines elimination of a small cofactor h with the point multiplication, using an e>r)
+// Our solution is to use as a multiplier an e, whose length in bits is that of the logical OR of e and r, hence allowing e>r while forcing inclusion of leading zeros if e<r. 
+// The point multiplication methods used will process leading zeros correctly.
+
+// So this function leaks information about the length of e...
+void ZZZ::ECP_mul(ECP *P,BIG e)
+{
+    ECP_clmul(P,e,e);
+}
+
+// .. but this one does not (typically set maxe=r)
+// Set P=e*P 
+void ZZZ::ECP_clmul(ECP *P, BIG e, BIG maxe)
+{
+    BIG cm;
+    BIG_or(cm,e,maxe);
+    int max=BIG_nbits(cm);
+#if CURVETYPE_ZZZ==MONTGOMERY
+    /* Montgomery ladder */
+    int nb, i, b;
+    ECP R0, R1, D;
+    if (ECP_isinf(P)) return;
+    if (BIG_iszilch(e))
+    {
+        ECP_inf(P);
+        return;
+    }
+
+    ECP_copy(&R0, P);
+    ECP_copy(&R1, P);
+    ECP_dbl(&R1);
+
+    ECP_copy(&D, P);
+    ECP_affine(&D);
+
+    nb = max;
+    for (i = nb - 2; i >= 0; i--)
+    {
+        b = BIG_bit(e, i);
+        ECP_copy(P, &R1);
+        ECP_add(P, &R0, &D);
+        ECP_cswap(&R0, &R1, b);
+        ECP_copy(&R1, P);
+        ECP_dbl(&R0);
+
+        ECP_cswap(&R0, &R1, b);
+    }
+
+    ECP_copy(P, &R0);
+
+#else
+    /* fixed size windows */
+    int i, nb, s, ns;
+    BIG mt, t;
+    ECP Q, W[8], C;
+    sign8 w[1 + (NLEN_XXX * BASEBITS_XXX + 3) / 4];
+
+    if (ECP_isinf(P)) return;
+    if (BIG_iszilch(e))
+    {
+        ECP_inf(P);
+        return;
+    }
+
+    /* precompute table */
+    ECP_copy(&Q, P);
+    ECP_dbl(&Q);
+    ECP_copy(&W[0], P);
+
+    for (i = 1; i < 8; i++)
+    {
+        ECP_copy(&W[i], &W[i - 1]);
+        ECP_add(&W[i], &Q);
+    }
+
+    /* make exponent odd - add 2P if even, P if odd */
+    BIG_copy(t, e);
+    s = BIG_parity(t);
+    BIG_inc(t, 1);
+    BIG_norm(t);
+    ns = BIG_parity(t);
+    BIG_copy(mt, t);
+    BIG_inc(mt, 1);
+    BIG_norm(mt);
+    BIG_cmove(t, mt, s);
+    ECP_cmove(&Q, P, ns);
+    ECP_copy(&C, &Q);
+
+    nb = 1 + (max + 3) / 4;
+    /* convert exponent to signed 4-bit window */
+    for (i = 0; i < nb; i++)
+    {
+        w[i] = BIG_lastbits(t, 5) - 16;
+        BIG_dec(t, w[i]);
+        BIG_norm(t);
+        BIG_fshr(t, 4);
+    }
+    w[nb] = BIG_lastbits(t, 5);
+
+    ECP_select(P, W, w[nb]);
+    for (i = nb - 1; i >= 0; i--)
+    {
+        ECP_select(&Q, W, w[i]);
+        ECP_dbl(P);
+        ECP_dbl(P);
+        ECP_dbl(P);
+        ECP_dbl(P);
+        ECP_add(P, &Q);
+    }
+    ECP_sub(P, &C); /* apply correction */
+#endif
+}
+
+#if CURVETYPE_ZZZ!=MONTGOMERY
+
+// Generic multi-multiplication, fixed 4-bit window, P=Sigma e_i*X_i
+// m point doublings
+void ZZZ::ECP_muln(ECP *P,int n,ECP X[],BIG e[])
+{
+    int i,j,k,nb;
+    BIG t,mt;
+    ECP S,R,B[16];
+    ECP_inf(P);
+
+    BIG_copy(mt,e[0]); BIG_norm(mt);
+    for (i=1;i<n;i++)
+    { // find biggest
+        BIG_copy(t,e[i]); BIG_norm(t);
+        k=BIG_comp(t,mt);
+        BIG_cmove(mt,t,(k+1)/2);
+    }
+    nb=(BIG_nbits(mt)+3)/4;
+    for (int i=nb-1;i>=0;i--)
+    { // Pippenger's algorithm
+        for (j=0;j<16;j++)
+            ECP_inf(&B[j]);
+        for (j=0;j<n;j++)
+        { 
+            BIG_copy(mt,e[j]); BIG_norm(mt);
+            BIG_shr(mt,4*i);
+            k=BIG_lastbits(mt,4);
+            ECP_add(&B[k],&X[j]);  // side channel risky
+        }
+        ECP_inf(&R); ECP_inf(&S);
+        for (j=15;j>=1;j--)
+        {
+            ECP_add(&R,&B[j]);
+            ECP_add(&S,&R);
+        }
+        for (j=0;j<4;j++)
+            ECP_dbl(P);
+        ECP_add(P,&S);
+    }
+}
+
+void ZZZ::ECP_mul2(ECP *P, ECP *Q, BIG e, BIG f)
+{
+    ECP_clmul2(P,Q,e,f,e);
+}
+
+/* Set P=eP+fQ double multiplication */
+/* constant time - as useful for GLV method in pairings */
+/* SU=456 */
+
+void ZZZ::ECP_clmul2(ECP *P, ECP *Q, BIG e, BIG f, BIG maxe)
+{
+    BIG cm;
+    BIG te, tf, mt;
+    ECP S, T, W[8], C;
+    sign8 w[1 + (NLEN_XXX * BASEBITS_XXX + 1) / 2];
+    int i, a, b, s, ns, nb;
+
+    BIG_copy(cm,maxe); BIG_or(cm,cm,e); BIG_or(cm,cm,f);
+    int max=BIG_nbits(cm);
+
+    BIG_copy(te, e);
+    BIG_copy(tf, f);
+
+    /* precompute table */
+    ECP_copy(&W[1], P);
+    ECP_sub(&W[1], Q); /* P+Q */
+    ECP_copy(&W[2], P);
+    ECP_add(&W[2], Q); /* P-Q */
+    ECP_copy(&S, Q);
+    ECP_dbl(&S);  /* S=2Q */
+    ECP_copy(&W[0], &W[1]);
+    ECP_sub(&W[0], &S);
+    ECP_copy(&W[3], &W[2]);
+    ECP_add(&W[3], &S);
+    ECP_copy(&T, P);
+    ECP_dbl(&T); /* T=2P */
+    ECP_copy(&W[5], &W[1]);
+    ECP_add(&W[5], &T);
+    ECP_copy(&W[6], &W[2]);
+    ECP_add(&W[6], &T);
+    ECP_copy(&W[4], &W[5]);
+    ECP_sub(&W[4], &S);
+    ECP_copy(&W[7], &W[6]);
+    ECP_add(&W[7], &S);
+
+    /* if multiplier is odd, add 2, else add 1 to multiplier, and add 2P or P to correction */
+
+    s = BIG_parity(te);
+    BIG_inc(te, 1);
+    BIG_norm(te);
+    ns = BIG_parity(te);
+    BIG_copy(mt, te);
+    BIG_inc(mt, 1);
+    BIG_norm(mt);
+    BIG_cmove(te, mt, s);
+    ECP_cmove(&T, P, ns);
+    ECP_copy(&C, &T);
+
+    s = BIG_parity(tf);
+    BIG_inc(tf, 1);
+    BIG_norm(tf);
+    ns = BIG_parity(tf);
+    BIG_copy(mt, tf);
+    BIG_inc(mt, 1);
+    BIG_norm(mt);
+    BIG_cmove(tf, mt, s);
+    ECP_cmove(&S, Q, ns);
+    ECP_add(&C, &S);
+
+    //BIG_add(mt, te, tf);
+    //BIG_norm(mt);
+    nb = 1 + (max + 1) / 2;
+
+    /* convert exponent to signed 2-bit window */
+    for (i = 0; i < nb; i++)
+    {
+        a = BIG_lastbits(te, 3) - 4;
+        BIG_dec(te, a);
+        BIG_norm(te);
+        BIG_fshr(te, 2);
+        b = BIG_lastbits(tf, 3) - 4;
+        BIG_dec(tf, b);
+        BIG_norm(tf);
+        BIG_fshr(tf, 2);
+        w[i] = 4 * a + b;
+    }
+    w[nb] = (4 * BIG_lastbits(te, 3) + BIG_lastbits(tf, 3));
+
+    //ECP_copy(P, &W[(w[nb] - 1) / 2]);
+    ECP_select(P, W, w[nb]);
+    for (i = nb - 1; i >= 0; i--)
+    {
+        ECP_select(&T, W, w[i]);
+        ECP_dbl(P);
+        ECP_dbl(P);
+        ECP_add(P, &T);
+    }
+    ECP_sub(P, &C); /* apply correction */
+}
+
+#endif
+
+void ZZZ::ECP_cfp(ECP *P)
+{   /* multiply point by curves cofactor */
+    BIG c;
+    int cf = CURVE_Cof_I;
+    if (cf == 1) return;
+    if (cf == 4)
+    {
+        ECP_dbl(P);
+        ECP_dbl(P);
+        return;
+    }
+    if (cf == 8)
+    {
+        ECP_dbl(P);
+        ECP_dbl(P);
+        ECP_dbl(P);
+        return;
+    }
+    BIG_rcopy(c, CURVE_Cof);
+    ECP_mul(P, c);
+    return;
+}
+
+/* Constant time Map to Point */
+void ZZZ::ECP_map2point(ECP *P,FP *h)
+{
+#if CURVETYPE_ZZZ==MONTGOMERY
+// Elligator 2
+    int qres;
+    BIG a;
+    FP X1,X2,w,N,t,one,A,D,hint;
+    //BIG_zero(a); BIG_inc(a,CURVE_A); BIG_norm(a); FP_nres(&A,a);
+    FP_from_int(&A,CURVE_A_ZZZ);
+    FP_copy(&t,h);
+    FP_sqr(&t,&t);   // t^2
+
+    if (PM1D2_YYY == 2)
+         FP_add(&t,&t,&t);  // 2t^2
+    if (PM1D2_YYY == 1)
+        FP_neg(&t,&t);      // -t^2
+    if (PM1D2_YYY > 2)
+        FP_imul(&t,&t,QNRI_YYY); // precomputed QNR
+    FP_norm(&t);  // z.t^2
+
+    FP_one(&one);
+    FP_add(&D,&t,&one); FP_norm(&D);  // Denominator D=1+z.t^2
+
+    FP_copy(&X1,&A);
+    FP_neg(&X1,&X1);  FP_norm(&X1);  // X1 = -A/D
+    FP_copy(&X2,&X1);
+    FP_mul(&X2,&X2,&t);             // X2 = -At/D
+
+    FP_sqr(&w,&X1); FP_mul(&N,&w,&X1);  // w=X1^2, N=X1^3
+    FP_mul(&w,&w,&A); FP_mul(&w,&w,&D); FP_add(&N,&N,&w);  // N = X1^3+ADX1^2
+    FP_sqr(&t,&D);
+    FP_mul(&t,&t,&X1);  
+    FP_add(&N,&N,&t);  // N=X1^3+ADX1^2+D^2X1  // Numerator of gx =  N/D^3
+    FP_norm(&N);
+
+    FP_mul(&t,&N,&D);                   // N.D
+    qres=FP_qr(&t,&hint);  // *** exp
+    FP_inv(&w,&t,&hint);
+    FP_mul(&D,&w,&N);     // 1/D
+    FP_mul(&X1,&X1,&D);    // get X1
+    FP_mul(&X2,&X2,&D);    // get X2
+    FP_cmove(&X1,&X2,1-qres);
+    FP_redc(a,&X1);
+
+    ECP_set(P,a);
+    return;
+#endif
+#if CURVETYPE_ZZZ==EDWARDS
+// Elligator 2 - map to Montgomery, place point, map back
+    int qres,ne,rfc,qnr;
+    BIG x,y;
+    FP X1,X2,t,w,one,A,w1,w2,B,Y,K,D,hint;
+    FP_one(&one);
+
+#if MODTYPE_YYY != GENERALISED_MERSENNE
+// its NOT ed448!
+// Figure out the Montgomery curve parameters
+
+    FP_rcopy(&B,CURVE_B);
+
+#if CURVE_A_ZZZ == 1
+    FP_add(&A,&B,&one);  // A=B+1  // A = a+d
+    FP_sub(&B,&B,&one);  // B=B-1  // B = -a+d
+#else
+    FP_sub(&A,&B,&one);  // A=B-1
+    FP_add(&B,&B,&one);  // B=B+1
+#endif
+    FP_norm(&A); FP_norm(&B);
+
+    FP_div2(&A,&A);    // (A+B)/2     // (a+d)/2  = J/K
+    FP_div2(&B,&B);    // (B-A)/2     // (-a+d)/2
+    FP_div2(&B,&B);    // (B-A)/4     // (-a+d)/4 = -1/K
+
+    FP_neg(&K,&B); FP_norm(&K);
+    //FP_inv(&K,&K,NULL);    // K
+    FP_invsqrt(&K,&w1,&K);                      // *** return K, w1=sqrt(1/K) - - could be precalculated!
+
+    rfc=RIADZ_YYY;
+    if (rfc)
+    { // RFC7748 method applies
+        FP_mul(&A,&A,&K);   // = J
+        FP_mul(&K,&K,&w1);
+//        FP_sqrt(&K,&K,NULL);
+    } else { // generic method
+        FP_sqr(&B,&B);
+    }
+#else
+    FP_from_int(&A,156326);
+    rfc=1;
+#endif
+// Map to this Montgomery curve X^2=X^3+AX^2+BX
+
+    FP_copy(&t,h); 
+    FP_sqr(&t,&t);   // t^2
+
+    if (PM1D2_YYY == 2)
+    {
+        FP_add(&t,&t,&t);  // 2t^2
+        qnr=2;
+    }
+    if (PM1D2_YYY == 1)
+    {
+        FP_neg(&t,&t);      // -t^2
+        qnr=-1;
+    }
+    if (PM1D2_YYY > 2)
+    {
+        FP_imul(&t,&t,QNRI_YYY);  // precomputed QNR
+        qnr=QNRI_YYY;
+    }
+    FP_norm(&t);
+    FP_add(&D,&t,&one); FP_norm(&D);  // Denominator=(1+z.u^2)
+
+    FP_copy(&X1,&A);
+    FP_neg(&X1,&X1);   FP_norm(&X1);  // X1=-(J/K).inv(1+z.u^2)
+    FP_mul(&X2,&X1,&t);  // X2=X1*z.u^2
+
+// Figure out RHS of Montgomery curve in rational form gx1/d^3
+
+    FP_sqr(&w,&X1); FP_mul(&w1,&w,&X1);  // w=X1^2, w1=X1^3
+    FP_mul(&w,&w,&A); FP_mul(&w,&w,&D); FP_add(&w1,&w1,&w);  // w1 = X1^3+ADX1^2
+    FP_sqr(&w2,&D);
+    if (!rfc)
+    {
+        FP_mul(&w,&X1,&B);
+        FP_mul(&w2,&w2,&w); //
+        FP_add(&w1,&w1,&w2);   // w1=X1^3+ADX1^2+BD^2X1
+    } else {
+        FP_mul(&w2,&w2,&X1);  
+        FP_add(&w1,&w1,&w2);  // w1=X1^3+ADX1^2+D^2X1  // was &X1
+    }
+    FP_norm(&w1);
+
+    FP_mul(&B,&w1,&D);     // gx1=num/den^3 - is_qr num*den (same as num/den, same as num/den^3)
+    qres=FP_qr(&B,&hint);  // ***
+    FP_inv(&w,&B,&hint);
+    FP_mul(&D,&w,&w1);     // 1/D
+    FP_mul(&X1,&X1,&D);    // get X1
+    FP_mul(&X2,&X2,&D);    // get X2
+    FP_sqr(&D,&D);
+
+    FP_imul(&w1,&B,qnr);       // now for gx2 = Z.u^2.gx1
+    FP_rcopy(&w,CURVE_HTPC);   // qnr^C3  
+    FP_mul(&w,&w,&hint);    // modify hint for gx2
+    FP_mul(&w2,&D,h);
+
+    FP_cmove(&X1,&X2,1-qres);  // pick correct one
+    FP_cmove(&B,&w1,1-qres);
+    FP_cmove(&hint,&w,1-qres);
+    FP_cmove(&D,&w2,1-qres);
+     
+    FP_sqrt(&Y,&B,&hint);   // sqrt(num*den)
+    FP_mul(&Y,&Y,&D);       // sqrt(num/den^3)
+
+// correct sign of Y
+    FP_neg(&w,&Y); FP_norm(&w);
+    FP_cmove(&Y,&w,qres^FP_sign(&Y));
+
+    if (!rfc)
+    {
+        FP_mul(&X1,&X1,&K);
+        FP_mul(&Y,&Y,&K);
+    }
+
+#if MODTYPE_YYY == GENERALISED_MERSENNE
+// Ed448 isogeny
+    FP_sqr(&t,&X1);  // t=u^2
+    FP_add(&w,&t,&one); // w=u^2+1
+    FP_norm(&w);
+    FP_sub(&t,&t,&one); // t=u^2-1
+    FP_norm(&t);
+    FP_mul(&w1,&t,&Y);  // w1=v(u^2-1)
+    FP_add(&w1,&w1,&w1);
+    FP_add(&X2,&w1,&w1);
+    FP_norm(&X2);       // w1=4v(u^2-1)
+    FP_sqr(&t,&t);      // t=(u^2-1)^2
+    FP_sqr(&Y,&Y);      // v^2
+    FP_add(&Y,&Y,&Y);
+    FP_add(&Y,&Y,&Y);
+    FP_norm(&Y);        // 4v^2
+    FP_add(&B,&t,&Y);  // w2=(u^2-1)^2+4v^2
+    FP_norm(&B);                                   // X1=w1/w2 - X2=w1, B=w2
+
+    FP_sub(&w2,&Y,&t);   // w2=4v^2-(u^2-1)^2
+    FP_norm(&w2);
+    FP_mul(&w2,&w2,&X1); // w2=u(4v^2-(u^2-1)^2)
+    FP_mul(&t,&t,&X1);   // t=u(u^2-1)^2
+    FP_div2(&Y,&Y);      // 2v^2
+    FP_mul(&w1,&Y,&w);  // w1=2v^2(u^2+1)
+    FP_sub(&w1,&t,&w1);  // w1=u(u^2-1)^2 - 2v^2(u^2+1)
+    FP_norm(&w1);                                   // Y=w2/w1
+
+    FP_mul(&t,&X2,&w1);    // output in projective to avoid inversion
+    FP_copy(&(P->x),&t);
+    FP_mul(&t,&w2,&B);
+    FP_copy(&(P->y),&t);
+    FP_mul(&t,&w1,&B);
+    FP_copy(&(P->z),&t);
+
+    return;
+
+#else
+    FP_add(&w1,&X1,&one); FP_norm(&w1); // (s+1)
+    FP_sub(&w2,&X1,&one); FP_norm(&w2); // (s-1)
+    FP_mul(&t,&w1,&Y);
+    FP_mul(&X1,&X1,&w1);
+
+    if (rfc)
+        FP_mul(&X1,&X1,&K);
+
+    FP_mul(&Y,&Y,&w2);      // output in projective to avoid inversion
+    FP_copy(&(P->x),&X1);
+    FP_copy(&(P->y),&Y);
+    FP_copy(&(P->z),&t);
+    return;
+#endif
+
+#endif
+
+#if CURVETYPE_ZZZ==WEIERSTRASS
+// SSWU or SVDW method
+    int sgn,ne;
+    BIG a,x,y;
+    FP X1,X2,X3,t,w,one,A,B,Y,D;
+    FP D2,hint,GX1;
+
+#if HTC_ISO_ZZZ != 0
+// Map to point on isogenous curve
+    int i,k,isox,isoy,iso=HTC_ISO_ZZZ;
+    FP xnum,xden,ynum,yden;
+    BIG z;
+    FP_rcopy(&A,CURVE_Ad);
+    FP_rcopy(&B,CURVE_Bd);
+#else
+    FP_from_int(&A,CURVE_A_ZZZ);
+    FP_rcopy(&B,CURVE_B);
+#endif
+
+    FP_one(&one);
+    FP_copy(&t,h);
+    sgn=FP_sign(&t);
+
+#if CURVE_A_ZZZ != 0 || HTC_ISO_ZZZ != 0
+
+        FP_sqr(&t,&t);
+        FP_imul(&t,&t,RIADZ_YYY);  // Z from hash-to-point draft standard
+        FP_add(&w,&t,&one);     // w=Zt^2+1
+        FP_norm(&w);
+
+        FP_mul(&w,&w,&t);      // w=Z^2*t^4+Zt^2
+        FP_mul(&D,&A,&w);      // A=Aw
+                               
+        FP_add(&w,&w,&one); FP_norm(&w);
+        FP_mul(&w,&w,&B);
+        FP_neg(&w,&w);          // -B(w+1)
+        FP_norm(&w);
+
+        FP_copy(&X2,&w);        // Numerators
+        FP_mul(&X3,&t,&X2);
+
+// x^3+Ad^2x+Bd^3
+        FP_sqr(&GX1,&X2);
+        FP_sqr(&D2,&D); FP_mul(&w,&A,&D2); FP_add(&GX1,&GX1,&w); FP_norm(&GX1); FP_mul(&GX1,&GX1,&X2); FP_mul(&D2,&D2,&D); FP_mul(&w,&B,&D2); FP_add(&GX1,&GX1,&w); FP_norm(&GX1);
+
+        FP_mul(&w,&GX1,&D);
+        int qr=FP_qr(&w,&hint);   // qr(ad) - only exp happens here
+        FP_inv(&D,&w,&hint);     // d=1/(ad)
+        FP_mul(&D,&D,&GX1);     // 1/d
+        FP_mul(&X2,&X2,&D);     // X2/=D
+        FP_mul(&X3,&X3,&D);     // X3/=D
+        FP_mul(&t,&t,h);        // t=Z.u^3
+        FP_sqr(&D2,&D);
+
+        FP_mul(&D,&D2,&t);
+        FP_imul(&t,&w,RIADZ_YYY);
+        FP_rcopy(&X1,CURVE_HTPC);     
+        FP_mul(&X1,&X1,&hint); // modify hint
+
+        FP_cmove(&X2,&X3,1-qr); 
+        FP_cmove(&D2,&D,1-qr);
+        FP_cmove(&w,&t,1-qr);
+        FP_cmove(&hint,&X1,1-qr);
+
+        FP_sqrt(&Y,&w,&hint);  // first candidate if X2 is correct
+        FP_mul(&Y,&Y,&D2);
+
+        ne=FP_sign(&Y)^sgn;
+        FP_neg(&w,&Y); FP_norm(&w);
+        FP_cmove(&Y,&w,ne);
+
+#if HTC_ISO_ZZZ != 0
+
+// (X2,Y) is on isogenous curve
+        k=0;
+        isox=iso;
+        isoy=3*(iso-1)/2;
+
+// xnum
+        FP_rcopy(&xnum,PC[k++]);
+        for (i=0;i<isox;i++)
+        {
+            FP_mul(&xnum,&xnum,&X2); 
+            FP_rcopy(&w,PC[k++]);
+            FP_add(&xnum,&xnum,&w); FP_norm(&xnum);
+        }
+
+// xden
+        FP_copy(&xden,&X2);
+        FP_rcopy(&w,PC[k++]);
+        FP_add(&xden,&xden,&w); FP_norm(&xden);
+ 
+        for (i=0;i<isox-2;i++)
+        {
+            FP_mul(&xden,&xden,&X2);
+            FP_rcopy(&w,PC[k++]);
+            FP_add(&xden,&xden,&w); FP_norm(&xden);
+        }
+
+// ynum
+        FP_rcopy(&ynum,PC[k++]);
+        for (i=0;i<isoy;i++)
+        {
+            FP_mul(&ynum,&ynum,&X2); 
+            FP_rcopy(&w,PC[k++]);
+            FP_add(&ynum,&ynum,&w); FP_norm(&ynum);
+        }
+
+// yden 
+        FP_copy(&yden,&X2);
+        FP_rcopy(&w,PC[k++]);
+        FP_add(&yden,&yden,&w); FP_norm(&yden);
+      
+        for (i=0;i<isoy-1;i++)
+        {
+            FP_mul(&yden,&yden,&X2); 
+            FP_rcopy(&w,PC[k++]);
+            FP_add(&yden,&yden,&w); FP_norm(&yden);
+        }
+
+        FP_mul(&ynum,&ynum,&Y);
+
+// return in projective coordinates
+        FP_mul(&t,&xnum,&yden);
+        FP_copy(&(P->x),&t);
+
+        FP_mul(&t,&ynum,&xden);
+        FP_copy(&(P->y),&t);
+
+        FP_mul(&t,&xden,&yden);
+        FP_copy(&(P->z),&t);
+        return;
+#else
+
+        FP_redc(x,&X2);
+        FP_redc(y,&Y);
+        ECP_set(P,x,y);
+        return;
+#endif
+#else 
+// SVDW - Shallue and van de Woestijne
+        FP_from_int(&Y,RIADZ_YYY);
+        ECP_rhs(&A,&Y);  // A=g(Z)
+        FP_rcopy(&B,SQRTm3);
+        FP_imul(&B,&B,RIADZ_YYY); // B=Z*sqrt(-3)
+
+        FP_sqr(&t,&t);
+        FP_mul(&Y,&A,&t);   // Y=tv1=u^2*g(Z)
+        FP_add(&t,&one,&Y); FP_norm(&t); // t=tv2=1+tv1
+        FP_sub(&Y,&one,&Y); FP_norm(&Y); // Y=tv1=1-tv1
+        FP_mul(&D,&t,&Y);
+        FP_mul(&D,&D,&B);
+
+        FP_copy(&w,&A);
+        FP_tpo(&D,&w);   // D=tv3=inv0(tv1*tv2*Z*sqrt(-3)) and w=sqrt(g(Z))   // ***
+
+        FP_mul(&w,&w,&B);  // w=tv4=Z.sqrt(-3).sqrt(g(Z))
+        if (FP_sign(&w)==1)
+        { // depends only on sign of constant RIADZ
+            FP_neg(&w,&w);
+            FP_norm(&w);
+        }
+        FP_mul(&w,&w,&B);  // Z.sqrt(-3)
+        FP_mul(&w,&w,h);    // u
+        FP_mul(&w,&w,&Y);   // tv1
+        FP_mul(&w,&w,&D);  // tv3   // tv5=u*tv1*tv3*tv4*Z*sqrt(-3)
+
+        FP_from_int(&X1,RIADZ_YYY);
+        FP_copy(&X3,&X1);
+        FP_neg(&X1,&X1); FP_norm(&X1); FP_div2(&X1,&X1); // -Z/2
+        FP_copy(&X2,&X1);
+        FP_sub(&X1,&X1,&w); FP_norm(&X1);
+        FP_add(&X2,&X2,&w); FP_norm(&X2);
+        FP_add(&A,&A,&A);
+        FP_add(&A,&A,&A);
+        FP_norm(&A);      // 4*g(Z)
+        FP_sqr(&t,&t);
+        FP_mul(&t,&t,&D);
+        FP_sqr(&t,&t);    // (tv2^2*tv3)^2
+        FP_mul(&A,&A,&t); // 4*g(Z)*(tv2^2*tv3)^2
+        FP_add(&X3,&X3,&A); FP_norm(&X3);
+
+        ECP_rhs(&w,&X2);
+        FP_cmove(&X3,&X2,FP_qr(&w,NULL));                           // ***
+        ECP_rhs(&w,&X1);
+        FP_cmove(&X3,&X1,FP_qr(&w,NULL));                           // ***
+        ECP_rhs(&w,&X3);
+        FP_sqrt(&Y,&w,NULL);                                        // ***
+
+        ne=FP_sign(&Y)^sgn;
+        FP_neg(&w,&Y); FP_norm(&w);
+        FP_cmove(&Y,&w,ne);
+
+        FP_redc(x,&X3);
+        FP_redc(y,&Y);
+        ECP_set(P,x,y);
+        return;
+#endif
+
+#endif
+}
+
+/* Hunt and Peck a BIG to a curve point */
+/*
+void ZZZ::ECP_hap2point(ECP *P,BIG h)
+{
+    BIG x;
+    BIG_copy(x,h);
+	for (;;)
+	{
+#if CURVETYPE_ZZZ!=MONTGOMERY
+		ECP_setx(P,x,0);
+#else
+		ECP_set(P,x);
+#endif
+		BIG_inc(x,1); BIG_norm(x);
+		if (!ECP_isinf(P)) break;
+	}
+}
+*/
+/* Map octet to point */
+/*
+void ZZZ::ECP_mapit(ECP *P, octet *W)
+{
+    BIG q, x;
+    DBIG dx;
+    BIG_rcopy(q, Modulus);
+
+    BIG_dfromBytesLen(dx,W->val,W->len);
+    BIG_dmod(x,dx,q);
+
+    ECP_hap2point(P,x);
+    ECP_cfp(P);
+}
+*/
+int ZZZ::ECP_generator(ECP *G)
+{
+    BIG x, y;
+    BIG_rcopy(x, CURVE_Gx);
+#if CURVETYPE_ZZZ!=MONTGOMERY
+    BIG_rcopy(y, CURVE_Gy);
+    return ECP_set(G, x, y);
+#else
+    return ECP_set(G, x);
+#endif
+}
+
+#ifdef HAS_MAIN
+
+using namespace ZZZ;
+
+int main()
+{
+    int i;
+    ECP G, P;
+    csprng RNG;
+    BIG r, s, x, y, b, m, w, q;
+    BIG_rcopy(x, CURVE_Gx);
+#if CURVETYPE_ZZZ!=MONTGOMERY
+    BIG_rcopy(y, CURVE_Gy);
+#endif
+    BIG_rcopy(m, Modulus);
+
+    printf("x= ");
+    BIG_output(x);
+    printf("\n");
+#if CURVETYPE_ZZZ!=MONTGOMERY
+    printf("y= ");
+    BIG_output(y);
+    printf("\n");
+#endif
+    RNG_seed(&RNG, 3, "abc");
+
+#if CURVETYPE_ZZZ!=MONTGOMERY
+    ECP_set(&G, x, y);
+#else
+    ECP_set(&G, x);
+#endif
+    if (ECP_isinf(&G)) printf("Failed to set - point not on curve\n");
+    else printf("set success\n");
+
+    ECP_output(&G);
+
+    BIG_rcopy(r, CURVE_Order); //BIG_dec(r,7);
+    printf("r= ");
+    BIG_output(r);
+    printf("\n");
+
+    ECP_copy(&P, &G);
+
+    ECP_mul(&P, r);
+
+    ECP_output(&P);
+    BIG_randomnum(w, &RNG);
+    BIG_mod(w, r);
+
+    ECP_copy(&P, &G);
+    ECP_mul(&P, w);
+
+    ECP_output(&P);
+
+    return 0;
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp.h
new file mode 100644
index 0000000..a78e2c1
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_ZZZ_H
+#define ECP_ZZZ_H
+
+#include "fp_YYY.h"
+#include "config_curve_ZZZ.h"
+
+using namespace core;
+
+namespace ZZZ {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const XXX::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const XXX::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const XXX::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const XXX::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const XXX::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const XXX::BIG CURVE_Ad;
+extern const XXX::BIG CURVE_Bd;
+extern const XXX::BIG PC[];
+
+extern const XXX::BIG CURVE_Adr;
+extern const XXX::BIG CURVE_Adi;
+extern const XXX::BIG CURVE_Bdr;
+extern const XXX::BIG CURVE_Bdi;
+extern const XXX::BIG PCR[];
+extern const XXX::BIG PCI[];
+
+/* Generator point on G1 */
+extern const XXX::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const XXX::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const XXX::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const XXX::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const XXX::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const XXX::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const XXX::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const XXX::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const XXX::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const XXX::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const XXX::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const XXX::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const XXX::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    YYY::FP x; /**< x-coordinate of point */
+#if CURVETYPE_ZZZ!=MONTGOMERY
+    YYY::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    YYY::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(YYY::FP *r, YYY::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, XXX::BIG x, int s);
+
+#if CURVETYPE_ZZZ==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, XXX::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(XXX::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, XXX::BIG x, XXX::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(XXX::BIG x, XXX::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, XXX::BIG e, XXX::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, XXX::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, XXX::BIG e, XXX::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, XXX::BIG e, XXX::BIG f, XXX::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],XXX::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, YYY::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, XXX::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp2.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp2.cpp
new file mode 100644
index 0000000..c76094a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp2.cpp
@@ -0,0 +1,998 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* CORE Weierstrass elliptic curve functions over FP2 */
+/* SU=m, m is Stack Usage */
+
+#include "ecp2_ZZZ.h"
+#include "ecp_ZZZ.h"
+
+using namespace XXX;
+using namespace YYY;
+
+int ZZZ::ECP2_isinf(ECP2 *P)
+{
+    return (FP2_iszilch(&(P->x)) & FP2_iszilch(&(P->z)));
+}
+
+/* Set P=Q */
+/* SU= 16 */
+void ZZZ::ECP2_copy(ECP2 *P, ECP2 *Q)
+{
+    FP2_copy(&(P->x), &(Q->x));
+    FP2_copy(&(P->y), &(Q->y));
+    FP2_copy(&(P->z), &(Q->z));
+}
+
+/* set P to Infinity */
+/* SU= 8 */
+void ZZZ::ECP2_inf(ECP2 *P)
+{
+    FP2_zero(&(P->x));
+    FP2_one(&(P->y));
+    FP2_zero(&(P->z));
+}
+
+/* Conditional move Q to P dependant on d */
+static void ECP2_cmove(ZZZ::ECP2 *P, ZZZ::ECP2 *Q, int d)
+{
+    FP2_cmove(&(P->x), &(Q->x), d);
+    FP2_cmove(&(P->y), &(Q->y), d);
+    FP2_cmove(&(P->z), &(Q->z), d);
+}
+
+/* return 1 if b==c, no branching */
+static int teq(sign32 b, sign32 c)
+{
+    sign32 x = b ^ c;
+    x -= 1; // if x=0, x now -1
+    return (int)((x >> 31) & 1);
+}
+
+/* Constant time select from pre-computed table */
+static void ECP2_select(ZZZ::ECP2 *P, ZZZ::ECP2 W[], sign32 b)
+{
+    ZZZ::ECP2 MP;
+    sign32 m = b >> 31;
+    sign32 babs = (b ^ m) - m;
+
+    babs = (babs - 1) / 2;
+
+    ECP2_cmove(P, &W[0], teq(babs, 0)); // conditional move
+    ECP2_cmove(P, &W[1], teq(babs, 1));
+    ECP2_cmove(P, &W[2], teq(babs, 2));
+    ECP2_cmove(P, &W[3], teq(babs, 3));
+    ECP2_cmove(P, &W[4], teq(babs, 4));
+    ECP2_cmove(P, &W[5], teq(babs, 5));
+    ECP2_cmove(P, &W[6], teq(babs, 6));
+    ECP2_cmove(P, &W[7], teq(babs, 7));
+
+    ECP2_copy(&MP, P);
+    ECP2_neg(&MP);  // minus P
+    ECP2_cmove(P, &MP, (int)(m & 1));
+}
+
+/* return 1 if P==Q, else 0 */
+/* SU= 312 */
+int ZZZ::ECP2_equals(ECP2 *P, ECP2 *Q)
+{
+    FP2 a, b;
+
+    FP2_mul(&a, &(P->x), &(Q->z));
+    FP2_mul(&b, &(Q->x), &(P->z));
+    if (!FP2_equals(&a, &b)) return 0;
+
+    FP2_mul(&a, &(P->y), &(Q->z));
+    FP2_mul(&b, &(Q->y), &(P->z));
+    if (!FP2_equals(&a, &b)) return 0;
+    return 1;
+}
+
+/* Make P affine (so z=1) */
+/* SU= 232 */
+void ZZZ::ECP2_affine(ECP2 *P)
+{
+    FP2 one, iz;
+    if (ECP2_isinf(P)) return;
+
+    FP2_one(&one);
+    if (FP2_isunity(&(P->z)))
+    {
+        FP2_reduce(&(P->x));
+        FP2_reduce(&(P->y));
+        return;
+    }
+
+    FP2_inv(&iz, &(P->z), NULL);
+    FP2_mul(&(P->x), &(P->x), &iz);
+    FP2_mul(&(P->y), &(P->y), &iz);
+
+    FP2_reduce(&(P->x));
+    FP2_reduce(&(P->y));
+    FP2_copy(&(P->z), &one);
+}
+
+/* extract x, y from point P */
+/* SU= 16 */
+int ZZZ::ECP2_get(FP2 *x, FP2 *y, ECP2 *P)
+{
+    ECP2 W;
+    ECP2_copy(&W, P);
+    ECP2_affine(&W);
+    if (ECP2_isinf(&W)) return -1;
+
+    FP2_copy(y, &(W.y));
+    FP2_copy(x, &(W.x));
+    return 0;
+}
+
+/* SU= 152 */
+/* Output point P */
+void ZZZ::ECP2_output(ECP2 *P)
+{
+    FP2 x, y;
+    if (ECP2_isinf(P))
+    {
+        printf("Infinity\n");
+        return;
+    }
+    ECP2_get(&x, &y, P);
+    printf("(");
+    FP2_output(&x);
+    printf(",");
+    FP2_output(&y);
+    printf(")\n");
+}
+
+/* SU= 232 */
+void ZZZ::ECP2_outputxyz(ECP2 *P)
+{
+    ECP2 Q;
+    if (ECP2_isinf(P))
+    {
+        printf("Infinity\n");
+        return;
+    }
+    ECP2_copy(&Q, P);
+    printf("(");
+    FP2_output(&(Q.x));
+    printf(",");
+    FP2_output(&(Q.y));
+    printf(",");
+    FP2_output(&(Q.z));
+    printf(")\n");
+}
+
+/* SU= 168 */
+/* Convert Q to octet string */
+void ZZZ::ECP2_toOctet(octet *W, ECP2 *Q, bool compress)
+{
+    FP2 qx, qy;
+    bool alt=false;
+    ECP2_get(&qx, &qy, Q);
+
+#if (MBITS-1)%8 <= 4
+#ifdef ALLOW_ALT_COMPRESS_ZZZ
+    alt=true;
+#endif
+#endif
+
+    if (alt)
+    {
+        FP2_toBytes(&(W->val[0]),&qx);
+        if (!compress)
+        {
+            W->len=4*MODBYTES_XXX;
+            FP2_toBytes(&(W->val[2*MODBYTES_XXX]), &qy);
+        } else {
+            W->val[0]|=0x80;
+            if (FP2_islarger(&qy)==1) W->val[0]|=0x20;
+            W->len=2*MODBYTES_XXX;
+        }
+    } else {
+        FP2_toBytes(&(W->val[1]),&qx);
+        if (!compress)
+        {
+            W->val[0] = 0x04;
+            FP2_toBytes(&(W->val[2 * MODBYTES_XXX+1]), &qy);
+            W->len = 4 * MODBYTES_XXX + 1;
+        } else {
+            W->val[0]=0x02;
+            if (FP2_sign(&qy)==1) W->val[0] = 0x03;
+            W->len = 2 * MODBYTES_XXX + 1;
+        }
+    }
+}
+/* SU= 176 */
+/* restore Q from octet string */
+int ZZZ::ECP2_fromOctet(ECP2 *Q, octet *W)
+{
+    FP2 qx, qy;
+    bool alt=false;
+    int sgn,cmp,typ = W->val[0];
+
+#if (MBITS-1)%8 <= 4
+#ifdef ALLOW_ALT_COMPRESS_ZZZ
+    alt=true;
+#endif
+#endif
+
+    if (alt)
+    {
+        W->val[0]&=0x1f;
+        FP2_fromBytes(&qx,&(W->val[0]));
+        W->val[0]=typ;
+        if ((typ&0x80)==0)
+        {
+            FP2_fromBytes(&qy,&(W->val[2*MODBYTES_XXX]));
+            if (ECP2_set(Q, &qx, &qy)) return 1;
+            return 0;
+        } else {
+            if (!ECP2_setx(Q,&qx,0)) return 0;
+            sgn=(typ&0x20)>>5;
+            cmp=FP2_islarger(&(Q->y));
+            if ((sgn==1 && cmp!=1) || (sgn==0 && cmp==1)) ECP2_neg(Q);
+            return 1;
+        }
+
+    } else {
+        FP2_fromBytes(&qx,&(W->val[1]));
+        if (typ == 0x04)
+        {
+            FP2_fromBytes(&qy,&(W->val[2 * MODBYTES_XXX+1]));
+            if (ECP2_set(Q, &qx, &qy)) return 1;
+        } else {
+            if (ECP2_setx(Q, &qx, typ&1)) return 1;
+        }
+    }
+    return 0;
+}
+
+/* SU= 128 */
+/* Calculate RHS of twisted curve equation x^3+B/i or x^3+Bi*/
+void ZZZ::ECP2_rhs(FP2 *rhs, FP2 *x)
+{
+    /* calculate RHS of elliptic curve equation */
+    FP2 t;
+    BIG b;
+
+    FP2_sqr(&t, x);
+    FP2_mul(rhs, &t, x);
+
+    /* Assuming CURVE_A=0 */
+
+    BIG_rcopy(b, CURVE_B);
+    FP2_from_BIG(&t, b);
+#if SEXTIC_TWIST_ZZZ == D_TYPE
+    FP2_div_ip(&t);   /* IMPORTANT - here we use the correct SEXTIC twist of the curve */
+#endif
+
+#if SEXTIC_TWIST_ZZZ == M_TYPE
+    FP2_norm(&t);
+    FP2_mul_ip(&t);   /* IMPORTANT - here we use the correct SEXTIC twist of the curve */
+    FP2_norm(&t);
+
+#endif
+
+    FP2_add(rhs, &t, rhs);
+    FP2_reduce(rhs);
+}
+
+
+/* Set P=(x,y). Return 1 if (x,y) is on the curve, else return 0*/
+/* SU= 232 */
+int ZZZ::ECP2_set(ECP2 *P, FP2 *x, FP2 *y)
+{
+    FP2 rhs, y2;
+    FP2_sqr(&y2, y);
+    ECP2_rhs(&rhs, x);
+
+    if (!FP2_equals(&y2, &rhs))
+    {
+        ECP2_inf(P);
+        return 0;
+    }
+
+    FP2_copy(&(P->x), x);
+    FP2_copy(&(P->y), y);
+
+    FP2_one(&(P->z));
+    return 1;
+}
+
+/* Set P=(x,y). Return 1 if (x,.) is on the curve, else return 0 */
+/* SU= 232 */
+int ZZZ::ECP2_setx(ECP2 *P, FP2 *x, int s)
+{
+    FP2 y;
+    FP hint;
+    ECP2_rhs(&y, x);
+
+    if (!FP2_qr(&y,&hint))
+    {
+        ECP2_inf(P);
+        return 0;
+    }
+
+    FP2_sqrt(&y,&y,&hint);
+
+    FP2_copy(&(P->x), x);
+    FP2_copy(&(P->y), &y);
+    FP2_one(&(P->z));
+
+    if (FP2_sign(&(P->y)) != s)
+        FP2_neg(&(P->y),&(P->y));
+    FP2_reduce(&(P->y));
+    return 1;
+}
+
+/* Set P=-P */
+/* SU= 8 */
+void ZZZ::ECP2_neg(ECP2 *P)
+{
+    FP2_norm(&(P->y));
+    FP2_neg(&(P->y), &(P->y));
+    FP2_norm(&(P->y));
+}
+
+/* R+=R */
+/* return -1 for Infinity, 0 for addition, 1 for doubling */
+/* SU= 448 */
+int ZZZ::ECP2_dbl(ECP2 *P)
+{
+    FP2 t0, t1, t2, iy, x3, y3;
+
+    FP2_copy(&iy, &(P->y));     //FP2 iy=new FP2(y);
+#if SEXTIC_TWIST_ZZZ==D_TYPE
+    FP2_mul_ip(&iy);            //iy.mul_ip();
+    FP2_norm(&iy);              //iy.norm();
+#endif
+    FP2_sqr(&t0, &(P->y));          //t0.sqr();
+#if SEXTIC_TWIST_ZZZ==D_TYPE
+    FP2_mul_ip(&t0);            //t0.mul_ip();
+#endif
+    FP2_mul(&t1, &iy, &(P->z)); //t1.mul(z);
+    FP2_sqr(&t2, &(P->z));              //t2.sqr();
+
+    FP2_add(&(P->z), &t0, &t0); //z.add(t0);
+    FP2_norm(&(P->z));              //z.norm();
+    FP2_add(&(P->z), &(P->z), &(P->z)); //z.add(z);
+    FP2_add(&(P->z), &(P->z), &(P->z)); //z.add(z);
+    FP2_norm(&(P->z));          //z.norm();
+
+    FP2_imul(&t2, &t2, 3 * CURVE_B_I); //t2.imul(3*ROM.CURVE_B_I);
+#if SEXTIC_TWIST_ZZZ==M_TYPE
+    FP2_mul_ip(&t2);
+    FP2_norm(&t2);
+#endif
+
+    FP2_mul(&x3, &t2, &(P->z)); //x3.mul(z);
+
+    FP2_add(&y3, &t0, &t2);     //y3.add(t2);
+    FP2_norm(&y3);              //y3.norm();
+    FP2_mul(&(P->z), &(P->z), &t1); //z.mul(t1);
+
+    FP2_add(&t1, &t2, &t2);     //t1.add(t2);
+    FP2_add(&t2, &t2, &t1);     //t2.add(t1);
+    FP2_norm(&t2);              //t2.norm();
+    FP2_sub(&t0, &t0, &t2);     //t0.sub(t2);
+    FP2_norm(&t0);              //t0.norm();                           //y^2-9bz^2
+    FP2_mul(&y3, &y3, &t0);     //y3.mul(t0);
+    FP2_add(&(P->y), &y3, &x3);     //y3.add(x3);                      //(y^2+3z*2)(y^2-9z^2)+3b.z^2.8y^2
+    FP2_mul(&t1, &(P->x), &iy);     //t1.mul(iy);
+
+    FP2_norm(&t0);          //x.norm();
+    FP2_mul(&(P->x), &t0, &t1); //x.mul(t1);
+    FP2_add(&(P->x), &(P->x), &(P->x)); //x.add(x);       //(y^2-9bz^2)xy2
+
+    FP2_norm(&(P->x));          //x.norm();
+    FP2_norm(&(P->y));          //y.norm();
+
+    return 1;
+}
+
+/* Set P+=Q */
+/* SU= 400 */
+int ZZZ::ECP2_add(ECP2 *P, ECP2 *Q)
+{
+    FP2 t0, t1, t2, t3, t4, x3, y3, z3;
+    int b3 = 3 * CURVE_B_I;
+
+    FP2_mul(&t0, &(P->x), &(Q->x)); //t0.mul(Q.x);         // x.Q.x
+    FP2_mul(&t1, &(P->y), &(Q->y)); //t1.mul(Q.y);       // y.Q.y
+
+    FP2_mul(&t2, &(P->z), &(Q->z)); //t2.mul(Q.z);
+
+    FP2_add(&t3, &(P->x), &(P->y)); //t3.add(y);
+    FP2_norm(&t3);              //t3.norm();          //t3=X1+Y1
+    FP2_add(&t4, &(Q->x), &(Q->y)); //t4.add(Q.y);
+    FP2_norm(&t4);              //t4.norm();            //t4=X2+Y2
+    FP2_mul(&t3, &t3, &t4);     //t3.mul(t4);                       //t3=(X1+Y1)(X2+Y2)
+
+    FP2_add(&t4, &t0, &t1);     //t4.add(t1);       //t4=X1.X2+Y1.Y2
+
+    FP2_sub(&t3, &t3, &t4);     //t3.sub(t4);
+    FP2_norm(&t3);              //t3.norm();
+#if SEXTIC_TWIST_ZZZ==D_TYPE
+    FP2_mul_ip(&t3);            //t3.mul_ip();
+    FP2_norm(&t3);              //t3.norm();         //t3=(X1+Y1)(X2+Y2)-(X1.X2+Y1.Y2) = X1.Y2+X2.Y1
+#endif
+    FP2_add(&t4, &(P->y), &(P->z)); //t4.add(z);
+    FP2_norm(&t4);              //t4.norm();            //t4=Y1+Z1
+    FP2_add(&x3, &(Q->y), &(Q->z)); //x3.add(Q.z);
+    FP2_norm(&x3);              //x3.norm();            //x3=Y2+Z2
+
+    FP2_mul(&t4, &t4, &x3);     //t4.mul(x3);                       //t4=(Y1+Z1)(Y2+Z2)
+    FP2_add(&x3, &t1, &t2);     //x3.add(t2);                       //X3=Y1.Y2+Z1.Z2
+
+    FP2_sub(&t4, &t4, &x3);     //t4.sub(x3);
+    FP2_norm(&t4);              //t4.norm();
+#if SEXTIC_TWIST_ZZZ==D_TYPE
+    FP2_mul_ip(&t4);            //t4.mul_ip();
+    FP2_norm(&t4);              //t4.norm();          //t4=(Y1+Z1)(Y2+Z2) - (Y1.Y2+Z1.Z2) = Y1.Z2+Y2.Z1
+#endif
+    FP2_add(&x3, &(P->x), &(P->z)); //x3.add(z);
+    FP2_norm(&x3);              //x3.norm();    // x3=X1+Z1
+    FP2_add(&y3, &(Q->x), &(Q->z)); //y3.add(Q.z);
+    FP2_norm(&y3);              //y3.norm();                // y3=X2+Z2
+    FP2_mul(&x3, &x3, &y3);     //x3.mul(y3);                           // x3=(X1+Z1)(X2+Z2)
+    FP2_add(&y3, &t0, &t2);     //y3.add(t2);                           // y3=X1.X2+Z1+Z2
+    FP2_sub(&y3, &x3, &y3);     //y3.rsub(x3);
+    FP2_norm(&y3);              //y3.norm();                // y3=(X1+Z1)(X2+Z2) - (X1.X2+Z1.Z2) = X1.Z2+X2.Z1
+#if SEXTIC_TWIST_ZZZ==D_TYPE
+    FP2_mul_ip(&t0);            //t0.mul_ip();
+    FP2_norm(&t0);              //t0.norm(); // x.Q.x
+    FP2_mul_ip(&t1);            //t1.mul_ip();
+    FP2_norm(&t1);              //t1.norm(); // y.Q.y
+#endif
+
+    FP2_add(&x3, &t0, &t0);     //x3.add(t0);
+    FP2_add(&t0, &t0, &x3);     //t0.add(x3);
+    FP2_norm(&t0);              //t0.norm();
+    FP2_imul(&t2, &t2, b3);     //t2.imul(b);
+#if SEXTIC_TWIST_ZZZ==M_TYPE
+    FP2_mul_ip(&t2);
+    FP2_norm(&t2);
+#endif
+
+    FP2_add(&z3, &t1, &t2);     //z3.add(t2);
+    FP2_norm(&z3);              //z3.norm();
+    FP2_sub(&t1, &t1, &t2);     //t1.sub(t2);
+    FP2_norm(&t1);              //t1.norm();
+
+    FP2_imul(&y3, &y3, b3);     //y3.imul(b);
+#if SEXTIC_TWIST_ZZZ==M_TYPE
+    FP2_mul_ip(&y3);
+    FP2_norm(&y3);
+#endif
+
+    FP2_mul(&x3, &y3, &t4);     //x3.mul(t4);
+    FP2_mul(&t2, &t3, &t1);     //t2.mul(t1);
+    FP2_sub(&(P->x), &t2, &x3);     //x3.rsub(t2);
+    FP2_mul(&y3, &y3, &t0);     //y3.mul(t0);
+    FP2_mul(&t1, &t1, &z3);     //t1.mul(z3);
+    FP2_add(&(P->y), &y3, &t1);     //y3.add(t1);
+
+    FP2_mul(&t0, &t0, &t3);     //t0.mul(t3);
+    FP2_mul(&z3, &z3, &t4);     //z3.mul(t4);
+    FP2_add(&(P->z), &z3, &t0);     //z3.add(t0);
+
+    FP2_norm(&(P->x));          //x.norm();
+    FP2_norm(&(P->y));          //y.norm();
+    FP2_norm(&(P->z));          //z.norm();
+
+    return 0;
+}
+
+/* Set P-=Q */
+/* SU= 16 */
+void ZZZ::ECP2_sub(ECP2 *P, ECP2 *Q)
+{
+    ECP2 NQ;
+    ECP2_copy(&NQ, Q);
+    ECP2_neg(&NQ);
+    ECP2_add(P, &NQ);
+}
+
+/* P*=e */
+/* SU= 280 */
+void ZZZ::ECP2_mul(ECP2 *P, BIG e)
+{
+    /* fixed size windows */
+    int i, nb, s, ns;
+    BIG mt, t;
+    ECP2 Q, W[8], C;
+    sign8 w[1 + (NLEN_XXX * BASEBITS_XXX + 3) / 4];
+
+    if (ECP2_isinf(P)) return;
+
+    /* precompute table */
+
+    ECP2_copy(&Q, P);
+    ECP2_dbl(&Q);
+    ECP2_copy(&W[0], P);
+
+    for (i = 1; i < 8; i++)
+    {
+        ECP2_copy(&W[i], &W[i - 1]);
+        ECP2_add(&W[i], &Q);
+    }
+
+    /* make exponent odd - add 2P if even, P if odd */
+    BIG_copy(t, e);
+    s = BIG_parity(t);
+    BIG_inc(t, 1);
+    BIG_norm(t);
+    ns = BIG_parity(t);
+    BIG_copy(mt, t);
+    BIG_inc(mt, 1);
+    BIG_norm(mt);
+    BIG_cmove(t, mt, s);
+    ECP2_cmove(&Q, P, ns);
+    ECP2_copy(&C, &Q);
+
+    nb = 1 + (BIG_nbits(t) + 3) / 4;
+
+    /* convert exponent to signed 4-bit window */
+    for (i = 0; i < nb; i++)
+    {
+        w[i] = BIG_lastbits(t, 5) - 16;
+        BIG_dec(t, w[i]);
+        BIG_norm(t);
+        BIG_fshr(t, 4);
+    }
+    w[nb] = BIG_lastbits(t, 5);
+
+    //ECP2_copy(P, &W[(w[nb] - 1) / 2]);
+    ECP2_select(P, W, w[nb]);
+    for (i = nb - 1; i >= 0; i--)
+    {
+        ECP2_select(&Q, W, w[i]);
+        ECP2_dbl(P);
+        ECP2_dbl(P);
+        ECP2_dbl(P);
+        ECP2_dbl(P);
+        ECP2_add(P, &Q);
+    }
+    ECP2_sub(P, &C); /* apply correction */
+}
+
+/* Calculates q.P using Frobenius constant X */
+/* SU= 96 */
+void ZZZ::ECP2_frob(ECP2 *P, FP2 *X)
+{
+    FP2 X2;
+    FP2_sqr(&X2, X);
+    FP2_conj(&(P->x), &(P->x));
+    FP2_conj(&(P->y), &(P->y));
+    FP2_conj(&(P->z), &(P->z));
+    FP2_reduce(&(P->z));
+    FP2_mul(&(P->x), &X2, &(P->x));
+    FP2_mul(&(P->y), &X2, &(P->y));
+    FP2_mul(&(P->y), X, &(P->y));
+}
+
+// Bos & Costello https://eprint.iacr.org/2013/458.pdf
+// Faz-Hernandez & Longa & Sanchez  https://eprint.iacr.org/2013/158.pdf
+// Side channel attack secure
+
+void ZZZ::ECP2_mul4(ECP2 *P, ECP2 Q[4], BIG u[4])
+{
+    int i, j, k, nb, pb, bt;
+    ECP2 T[8], W;
+    BIG t[4], mt;
+    sign8 w[NLEN_XXX * BASEBITS_XXX + 1];
+    sign8 s[NLEN_XXX * BASEBITS_XXX + 1];
+
+    for (i = 0; i < 4; i++)
+    {
+        BIG_copy(t[i], u[i]);
+    }
+
+// Precomputed table
+    ECP2_copy(&T[0], &Q[0]); // Q[0]
+    ECP2_copy(&T[1], &T[0]);
+    ECP2_add(&T[1], &Q[1]); // Q[0]+Q[1]
+    ECP2_copy(&T[2], &T[0]);
+    ECP2_add(&T[2], &Q[2]); // Q[0]+Q[2]
+    ECP2_copy(&T[3], &T[1]);
+    ECP2_add(&T[3], &Q[2]); // Q[0]+Q[1]+Q[2]
+    ECP2_copy(&T[4], &T[0]);
+    ECP2_add(&T[4], &Q[3]); // Q[0]+Q[3]
+    ECP2_copy(&T[5], &T[1]);
+    ECP2_add(&T[5], &Q[3]); // Q[0]+Q[1]+Q[3]
+    ECP2_copy(&T[6], &T[2]);
+    ECP2_add(&T[6], &Q[3]); // Q[0]+Q[2]+Q[3]
+    ECP2_copy(&T[7], &T[3]);
+    ECP2_add(&T[7], &Q[3]); // Q[0]+Q[1]+Q[2]+Q[3]
+
+// Make it odd
+    pb = 1 - BIG_parity(t[0]);
+    BIG_inc(t[0], pb);
+    BIG_norm(t[0]);
+
+// Number of bits
+    BIG_zero(mt);
+    for (i = 0; i < 4; i++)
+    {
+        BIG_or(mt, mt, t[i]);
+    }
+    nb = 1 + BIG_nbits(mt);
+
+// Sign pivot
+    s[nb - 1] = 1;
+    for (i = 0; i < nb - 1; i++)
+    {
+        BIG_fshr(t[0], 1);
+        s[i] = 2 * BIG_parity(t[0]) - 1;
+    }
+
+// Recoded exponent
+    for (i = 0; i < nb; i++)
+    {
+        w[i] = 0;
+        k = 1;
+        for (j = 1; j < 4; j++)
+        {
+            bt = s[i] * BIG_parity(t[j]);
+            BIG_fshr(t[j], 1);
+
+            BIG_dec(t[j], (bt >> 1));
+            BIG_norm(t[j]);
+            w[i] += bt * k;
+            k *= 2;
+        }
+    }
+
+// Main loop
+    ECP2_select(P, T, 2 * w[nb - 1] + 1);
+    for (i = nb - 2; i >= 0; i--)
+    {
+        ECP2_select(&W, T, 2 * w[i] + s[i]);
+        ECP2_dbl(P);
+        ECP2_add(P, &W);
+    }
+
+// apply correction
+    ECP2_copy(&W, P);
+    ECP2_sub(&W, &Q[0]);
+    ECP2_cmove(P, &W, pb);
+}
+
+/* Hunt and Peck a BIG to G2 curve point */
+/*
+void ZZZ::ECP2_hap2point(ECP2 *Q,BIG h)
+{
+    BIG one,hv;
+    FP2 X;
+    BIG_one(one);
+    BIG_copy(hv,h);
+    for (;;)
+    {
+        FP2_from_BIGs(&X,one,hv);
+        if (ECP2_setx(Q,&X,0)) break;
+        BIG_inc(hv,1);
+        BIG_norm(hv);
+    }
+}
+*/
+
+/* Constant time Map FP2 to Point in G2 */
+void ZZZ::ECP2_map2point(ECP2 *Q,FP2 *H)
+{
+// SSWU plus isogenies method
+    int i,k,sgn,ne,isox,isoy,iso=HTC_ISO_G2_ZZZ;
+    FP2 X1,X2,X3,W,Y,T,A,NY;
+    FP s;
+#if HTC_ISO_G2_ZZZ != 0
+    FP hint;
+    FP2 ZZ,Ad,Bd,D,D2,GX1;
+    FP2 xnum,xden,ynum,yden;
+    FP2_from_ints(&ZZ,RIADZG2A_ZZZ,RIADZG2B_ZZZ);
+
+    FP2_rcopy(&Ad,CURVE_Adr,CURVE_Adi);
+    FP2_rcopy(&Bd,CURVE_Bdr,CURVE_Bdi);
+
+    FP2_one(&NY);
+    FP2_copy(&T,H);
+    sgn=FP2_sign(&T);
+
+    FP2_sqr(&T,&T);
+    FP2_mul(&T,&T,&ZZ);
+    FP2_add(&W,&T,&NY);
+    FP2_norm(&W);
+
+    FP2_mul(&W,&W,&T);
+    FP2_mul(&D,&Ad,&W);
+
+    FP2_add(&W,&W,&NY);
+    FP2_norm(&W);
+    FP2_mul(&W,&W,&Bd);
+    FP2_neg(&W,&W);
+    FP2_norm(&W);
+
+    FP2_copy(&X2,&W);        // Numerators
+    FP2_mul(&X3,&T,&X2);
+
+// x^3+Ad^2x+Bd^3
+    FP2_sqr(&GX1,&X2);
+    FP2_sqr(&D2,&D); FP2_mul(&W,&Ad,&D2); FP2_add(&GX1,&GX1,&W); FP2_norm(&GX1); FP2_mul(&GX1,&GX1,&X2); FP2_mul(&D2,&D2,&D); FP2_mul(&W,&Bd,&D2); FP2_add(&GX1,&GX1,&W); FP2_norm(&GX1);
+
+    FP2_mul(&W,&GX1,&D);
+    int qr=FP2_qr(&W,&hint);   // qr(ad) - only exp happens here
+    FP2_inv(&D,&W,&hint);     // d=1/(ad)
+    FP2_mul(&D,&D,&GX1);     // 1/d
+    FP2_mul(&X2,&X2,&D);     // X2/=D
+    FP2_mul(&X3,&X3,&D);     // X3/=D
+    FP2_mul(&T,&T,H);        // t=Z.u^3
+    FP2_sqr(&D2,&D);
+
+// first solution - X2, W, hint, D2
+
+    FP2_mul(&D,&D2,&T);     // second candidate if X3 is correct
+    FP2_mul(&T,&W,&ZZ); 
+
+    FP_rcopy(&s,CURVE_HTPC2);     
+    FP_mul(&s,&s,&hint); // modify hint
+
+    FP2_cmove(&X2,&X3,1-qr); 
+    FP2_cmove(&W,&T,1-qr);
+    FP2_cmove(&D2,&D,1-qr);
+    FP_cmove(&hint,&s,1-qr);
+
+    FP2_sqrt(&Y,&W,&hint);  // first candidate if X2 is correct
+    FP2_mul(&Y,&Y,&D2);
+
+    ne=FP2_sign(&Y)^sgn;
+    FP2_neg(&NY,&Y); FP2_norm(&NY);
+    FP2_cmove(&Y,&NY,ne);
+
+// (X2,Y) is on isogenous curve
+
+    k=0;
+    isox=iso;
+    isoy=3*(iso-1)/2;
+
+// xnum
+    FP2_rcopy(&xnum,PCR[k],PCI[k]); k++;
+    for (i=0;i<isox;i++)
+    {
+        FP2_mul(&xnum,&xnum,&X2); 
+        FP2_rcopy(&W,PCR[k],PCI[k]); k++;
+        FP2_add(&xnum,&xnum,&W); FP2_norm(&xnum);
+    }
+
+// xden
+    FP2_copy(&xden,&X2);
+    FP2_rcopy(&W,PCR[k],PCI[k]); k++;
+    FP2_add(&xden,&xden,&W); FP2_norm(&xden);
+    for (i=0;i<isox-2;i++)
+    {
+        FP2_mul(&xden,&xden,&X2);
+        FP2_rcopy(&W,PCR[k],PCI[k]); k++;
+        FP2_add(&xden,&xden,&W); FP2_norm(&xden);
+    }
+
+// ynum
+        FP2_rcopy(&ynum,PCR[k],PCI[k]); k++;
+        for (i=0;i<isoy;i++)
+        {
+            FP2_mul(&ynum,&ynum,&X2); 
+            FP2_rcopy(&W,PCR[k],PCI[k]); k++;
+            FP2_add(&ynum,&ynum,&W); FP2_norm(&ynum);
+        }
+
+// yden 
+        FP2_copy(&yden,&X2);
+        FP2_rcopy(&W,PCR[k],PCI[k]); k++;
+        FP2_add(&yden,&yden,&W); FP2_norm(&yden);
+      
+        for (i=0;i<isoy-1;i++)
+        {
+            FP2_mul(&yden,&yden,&X2); 
+            FP2_rcopy(&W,PCR[k],PCI[k]); k++;
+            FP2_add(&yden,&yden,&W); FP2_norm(&yden);
+        }
+
+        FP2_mul(&ynum,&ynum,&Y);
+
+        FP2_mul(&T,&xnum,&yden);
+        FP2_copy(&(Q->x),&T);
+
+        FP2_mul(&T,&ynum,&xden);
+        FP2_copy(&(Q->y),&T);
+
+        FP2_mul(&T,&xden,&yden);
+        FP2_copy(&(Q->z),&T);
+
+#else
+// SVDW - Shallue and van de Woestijne method.
+    FP Z;
+    FP2_one(&NY);
+    FP2_copy(&T,H);
+    sgn=FP2_sign(&T);
+
+    FP_from_int(&Z,RIADZG2A_YYY);
+    FP2_from_FP(&A,&Z);
+    ECP2_rhs(&A,&A);  // A=g(Z)
+
+    if (CURVE_B_I==4 && SEXTIC_TWIST_ZZZ==M_TYPE && RIADZG2A_YYY==-1 && RIADZG2B_YYY==0)
+    { // special case for BLS12381
+        FP2_from_ints(&W,2,1);
+    } else {
+        FP2_sqrt(&W,&A,NULL);   // sqrt(g(Z))
+    }
+    FP_rcopy(&s,SQRTm3);
+
+    FP_mul(&Z,&Z,&s);     // Z.sqrt(-3)
+
+    FP2_sqr(&T,&T);
+    FP2_mul(&Y,&A,&T);   // tv1=u^2*g(Z)
+    FP2_add(&T,&NY,&Y); FP2_norm(&T); // tv2=1+tv1
+    FP2_sub(&Y,&NY,&Y); FP2_norm(&Y); // tv1=1-tv1
+    FP2_mul(&NY,&T,&Y);
+
+    FP2_pmul(&NY,&NY,&Z);
+    FP2_inv(&NY,&NY,NULL);     // tv3=inv0(tv1*tv2*Z*sqrt(-3))
+
+    FP2_pmul(&W,&W,&Z); // tv4=Z*sqrt(-3).sqrt(g(Z))
+    if (FP2_sign(&W)==1)
+    {
+        FP2_neg(&W,&W);
+        FP2_norm(&W);
+    }
+    FP2_pmul(&W,&W,&Z);
+    FP2_mul(&W,&W,H);
+    FP2_mul(&W,&W,&Y);
+    FP2_mul(&W,&W,&NY);     // tv5=u*tv1*tv3*tv4*Z*sqrt(-3)
+   
+    FP2_from_ints(&X1,RIADZG2A_YYY,RIADZG2B_YYY);
+    FP2_copy(&X3,&X1);
+    FP2_neg(&X1,&X1); FP2_norm(&X1); FP2_div2(&X1,&X1); // -Z/2
+    FP2_copy(&X2,&X1);
+    FP2_sub(&X1,&X1,&W); FP2_norm(&X1);
+    FP2_add(&X2,&X2,&W); FP2_norm(&X2);
+    FP2_add(&A,&A,&A);
+    FP2_add(&A,&A,&A);
+    FP2_norm(&A);      // 4*g(Z)
+    FP2_sqr(&T,&T);
+    FP2_mul(&T,&T,&NY);
+    FP2_sqr(&T,&T);    // (tv2^2*tv3)^2
+    FP2_mul(&A,&A,&T); // 4*g(Z)*(tv2^2*tv3)^2
+    FP2_add(&X3,&X3,&A); FP2_norm(&X3);
+
+    ECP2_rhs(&W,&X2);
+    FP2_cmove(&X3,&X2,FP2_qr(&W,NULL));
+    ECP2_rhs(&W,&X1);
+    FP2_cmove(&X3,&X1,FP2_qr(&W,NULL));
+    ECP2_rhs(&W,&X3);
+    FP2_sqrt(&Y,&W,NULL);
+
+    ne=FP2_sign(&Y)^sgn;
+    FP2_neg(&W,&Y); FP2_norm(&W);
+    FP2_cmove(&Y,&W,ne);
+
+    ECP2_set(Q,&X3,&Y);
+#endif
+}
+
+/* Map octet to point on G2 */
+/*
+void ZZZ::ECP2_mapit(ECP2 *Q, octet *W)
+{
+    BIG q, x;
+    DBIG dx;
+    BIG_rcopy(q, Modulus);
+
+    BIG_dfromBytesLen(dx,W->val,W->len);
+    BIG_dmod(x,dx,q);
+
+    ECP2_hap2point(Q,x);
+    ECP2_cfp(Q);
+}
+*/
+/* cofactor product */
+void ZZZ::ECP2_cfp(ECP2 *Q)
+{
+//    FP Fx, Fy;
+    FP2 X;
+    BIG x;
+#if (PAIRING_FRIENDLY_ZZZ == BN_CURVE)
+    ECP2 T, K;
+#elif (PAIRING_FRIENDLY_ZZZ > BN_CURVE)
+    ECP2 xQ, x2Q;
+#endif
+//    FP_rcopy(&Fx, Fra);
+//    FP_rcopy(&Fy, Frb);
+//    FP2_from_FPs(&X, &Fx, &Fy);
+
+    FP2_rcopy(&X,Fra,Frb);
+
+#if SEXTIC_TWIST_ZZZ==M_TYPE
+    FP2_inv(&X, &X,NULL);
+    FP2_norm(&X);
+#endif
+
+    BIG_rcopy(x, CURVE_Bnx);
+
+#if (PAIRING_FRIENDLY_ZZZ == BN_CURVE)
+
+    // Faster Hashing to G2 - Fuentes-Castaneda, Knapp and Rodriguez-Henriquez
+    // Q -> xQ + F(3xQ) + F(F(xQ)) + F(F(F(Q))).
+    ECP2_copy(&T, Q);
+    ECP2_mul(&T, x);
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    ECP2_neg(&T);   // our x is negative
+#endif
+    ECP2_copy(&K, &T);
+    ECP2_dbl(&K);
+    ECP2_add(&K, &T);
+
+    ECP2_frob(&K, &X);
+    ECP2_frob(Q, &X);
+    ECP2_frob(Q, &X);
+    ECP2_frob(Q, &X);
+    ECP2_add(Q, &T);
+    ECP2_add(Q, &K);
+    ECP2_frob(&T, &X);
+    ECP2_frob(&T, &X);
+    ECP2_add(Q, &T);
+#elif (PAIRING_FRIENDLY_ZZZ > BN_CURVE)
+
+    // Efficient hash maps to G2 on BLS curves - Budroni, Pintore
+    // Q -> x2Q -xQ -Q +F(xQ -Q) +F(F(2Q))
+
+    ECP2_copy(&xQ, Q);
+    ECP2_mul(&xQ, x);
+    ECP2_copy(&x2Q, &xQ);
+    ECP2_mul(&x2Q, x);
+
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    ECP2_neg(&xQ);
+#endif
+
+    ECP2_sub(&x2Q, &xQ);
+    ECP2_sub(&x2Q, Q);
+
+    ECP2_sub(&xQ, Q);
+    ECP2_frob(&xQ, &X);
+
+    ECP2_dbl(Q);
+    ECP2_frob(Q, &X);
+    ECP2_frob(Q, &X);
+
+    ECP2_add(Q, &x2Q);
+    ECP2_add(Q, &xQ);
+
+#endif
+}
+
+int ZZZ::ECP2_generator(ECP2 *G)
+{
+    FP2 wx, wy;
+    FP2_rcopy(&wx,CURVE_Pxa,CURVE_Pxb);
+    FP2_rcopy(&wy,CURVE_Pya,CURVE_Pyb);
+//    FP_rcopy(&(wx.a), CURVE_Pxa);
+//    FP_rcopy(&(wx.b), CURVE_Pxb);
+//    FP_rcopy(&(wy.a), CURVE_Pya);
+//    FP_rcopy(&(wy.b), CURVE_Pyb);
+    return ECP2_set(G, &wx, &wy);
+}
+
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp2.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp2.h
new file mode 100644
index 0000000..d4daa30
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp2.h
@@ -0,0 +1,249 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP2_ZZZ_H
+#define ECP2_ZZZ_H
+
+#include "fp2_YYY.h"
+#include "config_curve_ZZZ.h"
+
+using namespace core;
+
+
+namespace YYY {
+
+extern const XXX::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const XXX::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+}
+
+namespace ZZZ {
+
+/**
+	@brief ECP2 Structure - Elliptic Curve Point over quadratic extension field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag */
+    YYY::FP2 x;   /**< x-coordinate of point */
+    YYY::FP2 y;   /**< y-coordinate of point */
+    YYY::FP2 z;   /**< z-coordinate of point */
+} ECP2;
+
+
+/* Curve Params - see rom*.cpp */
+
+extern const int CURVE_B_I;		/**< Elliptic curve B parameter */
+extern const XXX::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const XXX::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const XXX::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const XXX::BIG CURVE_Bnx;   /**< Elliptic curve parameter */
+extern const XXX::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+
+/* Generator point on G1 */
+extern const XXX::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const XXX::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const XXX::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+/* ECP2 E(Fp2) prototypes */
+/**	@brief Tests for ECP2 point equal to infinity
+ *
+	@param P ECP2 point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP2_isinf(ECP2 *P);
+/**	@brief Copy ECP2 point to another ECP2 point
+ *
+	@param P ECP2 instance, on exit = Q
+	@param Q ECP2 instance to be copied
+ */
+extern void ECP2_copy(ECP2 *P, ECP2 *Q);
+/**	@brief Set ECP2 to point-at-infinity
+ *
+	@param P ECP2 instance to be set to infinity
+ */
+extern void ECP2_inf(ECP2 *P);
+/**	@brief Tests for equality of two ECP2s
+ *
+	@param P ECP2 instance to be compared
+	@param Q ECP2 instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP2_equals(ECP2 *P, ECP2 *Q);
+/**	@brief Converts an ECP2 point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP2 instance to be converted to affine form
+ */
+extern void ECP2_affine(ECP2 *P);
+/**	@brief Extract x and y coordinates of an ECP2 point P
+ *
+	If x=y, returns only x
+	@param x FP2 on exit = x coordinate of point
+	@param y FP2 on exit = y coordinate of point (unless x=y)
+	@param P ECP2 instance (x,y)
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP2_get(YYY::FP2 *x, YYY::FP2 *y, ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, converted to affine coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_output(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, in projective coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_outputxyz(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to an octet string
+ *
+	The octet string is created in the form x|y or just x if compressed
+	Convert the real and imaginary parts of the x and y coordinates to big-endian base 256 form.
+    If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param S output octet string
+	@param P ECP2 instance to be converted to an octet string
+    @param c true for compression
+ */
+extern void ECP2_toOctet(octet *S, ECP2 *P, bool c);
+/**	@brief Creates an ECP2 point from an octet string
+ *
+	The octet string is in the form x|y
+	The real and imaginary parts of the x and y coordinates are in big-endian base 256 form.
+    If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP2 instance to be created from the octet string
+	@param S input octet string
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP2_fromOctet(ECP2 *P, octet *S);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x)=x^3+Ax+B
+	Used internally.
+	@param r FP2 value of f(x)
+	@param x FP2 instance
+ */
+extern void ECP2_rhs(YYY::FP2 *r, YYY::FP2 *x);
+/**	@brief Set ECP2 to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP2 instance to be set (x,y)
+	@param x FP2 x coordinate of point
+	@param y FP2 y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_set(ECP2 *P, YYY::FP2 *x, YYY::FP2 *y);
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Otherwise y coordinate is calculated from x.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+    @param s sign of y
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_setx(ECP2 *P, YYY::FP2 *x, int s);
+/**	@brief Negation of an ECP2 point
+ *
+	@param P ECP2 instance, on exit = -P
+ */
+extern void ECP2_neg(ECP2 *P);
+/**	@brief Doubles an ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =2*P
+ */
+extern int ECP2_dbl(ECP2 *P);
+/**	@brief Adds ECP2 instance Q to ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P+Q
+	@param Q ECP2 instance to be added to P
+ */
+extern int ECP2_add(ECP2 *P, ECP2 *Q);
+/**	@brief Subtracts ECP instance Q from ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P-Q
+	@param Q ECP2 instance to be subtracted from P
+ */
+extern void ECP2_sub(ECP2 *P, ECP2 *Q);
+/**	@brief Multiplies an ECP2 instance P by a BIG, side-channel resistant
+ *
+	Uses fixed sized windows.
+	@param P ECP2 instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP2_mul(ECP2 *P, XXX::BIG b);
+/**	@brief Multiplies an ECP2 instance P by the internal modulus p, using precalculated Frobenius constant f
+ *
+	Fast point multiplication using Frobenius
+	@param P ECP2 instance, on exit = p*P
+	@param f FP2 precalculated Frobenius constant
+
+ */
+extern void ECP2_frob(ECP2 *P, YYY::FP2 *f);
+/**	@brief Calculates P=b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+ *
+	@param P ECP2 instance, on exit = b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+	@param Q ECP2 array of 4 points
+	@param b BIG array of 4 multipliers
+ */
+extern void ECP2_mul4(ECP2 *P, ECP2 *Q, XXX::BIG *b);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP2 multiplied by co-factor
+ */
+extern void ECP2_cfp(ECP2 *Q);
+
+/**	@brief Maps random FP2 to curve point in constant time
+ *
+	@param Q ECP2 instance 
+	@param x FP2 derived from hash
+ */
+extern void ECP2_map2point(ECP2 *Q, YYY::FP2 *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP2 instance 
+	@param x Fp derived from hash
+ */
+extern void ECP2_hap2point(ECP2 *Q, XXX::BIG  x);
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param P ECP2 instance of correct order
+	@param W OCTET byte array to be mapped
+ */
+extern void ECP2_mapit(ECP2 *P, octet *w);
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP2 instance
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_generator(ECP2 *G);
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp2_BLS12381.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp2_BLS12381.h
new file mode 100644
index 0000000..0e31bcb
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp2_BLS12381.h
@@ -0,0 +1,249 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP2_BLS12381_H
+#define ECP2_BLS12381_H
+
+#include "fp2_BLS12381.h"
+#include "config_curve_BLS12381.h"
+
+using namespace core;
+
+
+namespace BLS12381 {
+
+extern const B384_58::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B384_58::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+}
+
+namespace BLS12381 {
+
+/**
+	@brief ECP2 Structure - Elliptic Curve Point over quadratic extension field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag */
+    BLS12381::FP2 x;   /**< x-coordinate of point */
+    BLS12381::FP2 y;   /**< y-coordinate of point */
+    BLS12381::FP2 z;   /**< z-coordinate of point */
+} ECP2;
+
+
+/* Curve Params - see rom*.cpp */
+
+extern const int CURVE_B_I;		/**< Elliptic curve B parameter */
+extern const B384_58::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B384_58::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B384_58::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B384_58::BIG CURVE_Bnx;   /**< Elliptic curve parameter */
+extern const B384_58::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+
+/* Generator point on G1 */
+extern const B384_58::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B384_58::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B384_58::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+/* ECP2 E(Fp2) prototypes */
+/**	@brief Tests for ECP2 point equal to infinity
+ *
+	@param P ECP2 point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP2_isinf(ECP2 *P);
+/**	@brief Copy ECP2 point to another ECP2 point
+ *
+	@param P ECP2 instance, on exit = Q
+	@param Q ECP2 instance to be copied
+ */
+extern void ECP2_copy(ECP2 *P, ECP2 *Q);
+/**	@brief Set ECP2 to point-at-infinity
+ *
+	@param P ECP2 instance to be set to infinity
+ */
+extern void ECP2_inf(ECP2 *P);
+/**	@brief Tests for equality of two ECP2s
+ *
+	@param P ECP2 instance to be compared
+	@param Q ECP2 instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP2_equals(ECP2 *P, ECP2 *Q);
+/**	@brief Converts an ECP2 point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP2 instance to be converted to affine form
+ */
+extern void ECP2_affine(ECP2 *P);
+/**	@brief Extract x and y coordinates of an ECP2 point P
+ *
+	If x=y, returns only x
+	@param x FP2 on exit = x coordinate of point
+	@param y FP2 on exit = y coordinate of point (unless x=y)
+	@param P ECP2 instance (x,y)
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP2_get(BLS12381::FP2 *x, BLS12381::FP2 *y, ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, converted to affine coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_output(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, in projective coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_outputxyz(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to an octet string
+ *
+	The octet string is created in the form x|y or just x if compressed
+	Convert the real and imaginary parts of the x and y coordinates to big-endian base 256 form.
+    If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param S output octet string
+	@param P ECP2 instance to be converted to an octet string
+    @param c true for compression
+ */
+extern void ECP2_toOctet(octet *S, ECP2 *P, bool c);
+/**	@brief Creates an ECP2 point from an octet string
+ *
+	The octet string is in the form x|y
+	The real and imaginary parts of the x and y coordinates are in big-endian base 256 form.
+    If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP2 instance to be created from the octet string
+	@param S input octet string
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP2_fromOctet(ECP2 *P, octet *S);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x)=x^3+Ax+B
+	Used internally.
+	@param r FP2 value of f(x)
+	@param x FP2 instance
+ */
+extern void ECP2_rhs(BLS12381::FP2 *r, BLS12381::FP2 *x);
+/**	@brief Set ECP2 to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP2 instance to be set (x,y)
+	@param x FP2 x coordinate of point
+	@param y FP2 y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_set(ECP2 *P, BLS12381::FP2 *x, BLS12381::FP2 *y);
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Otherwise y coordinate is calculated from x.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+    @param s sign of y
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_setx(ECP2 *P, BLS12381::FP2 *x, int s);
+/**	@brief Negation of an ECP2 point
+ *
+	@param P ECP2 instance, on exit = -P
+ */
+extern void ECP2_neg(ECP2 *P);
+/**	@brief Doubles an ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =2*P
+ */
+extern int ECP2_dbl(ECP2 *P);
+/**	@brief Adds ECP2 instance Q to ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P+Q
+	@param Q ECP2 instance to be added to P
+ */
+extern int ECP2_add(ECP2 *P, ECP2 *Q);
+/**	@brief Subtracts ECP instance Q from ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P-Q
+	@param Q ECP2 instance to be subtracted from P
+ */
+extern void ECP2_sub(ECP2 *P, ECP2 *Q);
+/**	@brief Multiplies an ECP2 instance P by a BIG, side-channel resistant
+ *
+	Uses fixed sized windows.
+	@param P ECP2 instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP2_mul(ECP2 *P, B384_58::BIG b);
+/**	@brief Multiplies an ECP2 instance P by the internal modulus p, using precalculated Frobenius constant f
+ *
+	Fast point multiplication using Frobenius
+	@param P ECP2 instance, on exit = p*P
+	@param f FP2 precalculated Frobenius constant
+
+ */
+extern void ECP2_frob(ECP2 *P, BLS12381::FP2 *f);
+/**	@brief Calculates P=b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+ *
+	@param P ECP2 instance, on exit = b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+	@param Q ECP2 array of 4 points
+	@param b BIG array of 4 multipliers
+ */
+extern void ECP2_mul4(ECP2 *P, ECP2 *Q, B384_58::BIG *b);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP2 multiplied by co-factor
+ */
+extern void ECP2_cfp(ECP2 *Q);
+
+/**	@brief Maps random FP2 to curve point in constant time
+ *
+	@param Q ECP2 instance 
+	@param x FP2 derived from hash
+ */
+extern void ECP2_map2point(ECP2 *Q, BLS12381::FP2 *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP2 instance 
+	@param x Fp derived from hash
+ */
+extern void ECP2_hap2point(ECP2 *Q, B384_58::BIG  x);
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param P ECP2 instance of correct order
+	@param W OCTET byte array to be mapped
+ */
+extern void ECP2_mapit(ECP2 *P, octet *w);
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP2 instance
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_generator(ECP2 *G);
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp2_BLS12383.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp2_BLS12383.h
new file mode 100644
index 0000000..101c09f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp2_BLS12383.h
@@ -0,0 +1,249 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP2_BLS12383_H
+#define ECP2_BLS12383_H
+
+#include "fp2_BLS12383.h"
+#include "config_curve_BLS12383.h"
+
+using namespace core;
+
+
+namespace BLS12383 {
+
+extern const B384_58::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B384_58::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+}
+
+namespace BLS12383 {
+
+/**
+	@brief ECP2 Structure - Elliptic Curve Point over quadratic extension field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag */
+    BLS12383::FP2 x;   /**< x-coordinate of point */
+    BLS12383::FP2 y;   /**< y-coordinate of point */
+    BLS12383::FP2 z;   /**< z-coordinate of point */
+} ECP2;
+
+
+/* Curve Params - see rom*.cpp */
+
+extern const int CURVE_B_I;		/**< Elliptic curve B parameter */
+extern const B384_58::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B384_58::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B384_58::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B384_58::BIG CURVE_Bnx;   /**< Elliptic curve parameter */
+extern const B384_58::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+
+/* Generator point on G1 */
+extern const B384_58::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B384_58::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B384_58::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+/* ECP2 E(Fp2) prototypes */
+/**	@brief Tests for ECP2 point equal to infinity
+ *
+	@param P ECP2 point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP2_isinf(ECP2 *P);
+/**	@brief Copy ECP2 point to another ECP2 point
+ *
+	@param P ECP2 instance, on exit = Q
+	@param Q ECP2 instance to be copied
+ */
+extern void ECP2_copy(ECP2 *P, ECP2 *Q);
+/**	@brief Set ECP2 to point-at-infinity
+ *
+	@param P ECP2 instance to be set to infinity
+ */
+extern void ECP2_inf(ECP2 *P);
+/**	@brief Tests for equality of two ECP2s
+ *
+	@param P ECP2 instance to be compared
+	@param Q ECP2 instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP2_equals(ECP2 *P, ECP2 *Q);
+/**	@brief Converts an ECP2 point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP2 instance to be converted to affine form
+ */
+extern void ECP2_affine(ECP2 *P);
+/**	@brief Extract x and y coordinates of an ECP2 point P
+ *
+	If x=y, returns only x
+	@param x FP2 on exit = x coordinate of point
+	@param y FP2 on exit = y coordinate of point (unless x=y)
+	@param P ECP2 instance (x,y)
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP2_get(BLS12383::FP2 *x, BLS12383::FP2 *y, ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, converted to affine coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_output(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, in projective coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_outputxyz(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to an octet string
+ *
+	The octet string is created in the form x|y or just x if compressed
+	Convert the real and imaginary parts of the x and y coordinates to big-endian base 256 form.
+    If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param S output octet string
+	@param P ECP2 instance to be converted to an octet string
+    @param c true for compression
+ */
+extern void ECP2_toOctet(octet *S, ECP2 *P, bool c);
+/**	@brief Creates an ECP2 point from an octet string
+ *
+	The octet string is in the form x|y
+	The real and imaginary parts of the x and y coordinates are in big-endian base 256 form.
+    If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP2 instance to be created from the octet string
+	@param S input octet string
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP2_fromOctet(ECP2 *P, octet *S);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x)=x^3+Ax+B
+	Used internally.
+	@param r FP2 value of f(x)
+	@param x FP2 instance
+ */
+extern void ECP2_rhs(BLS12383::FP2 *r, BLS12383::FP2 *x);
+/**	@brief Set ECP2 to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP2 instance to be set (x,y)
+	@param x FP2 x coordinate of point
+	@param y FP2 y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_set(ECP2 *P, BLS12383::FP2 *x, BLS12383::FP2 *y);
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Otherwise y coordinate is calculated from x.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+    @param s sign of y
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_setx(ECP2 *P, BLS12383::FP2 *x, int s);
+/**	@brief Negation of an ECP2 point
+ *
+	@param P ECP2 instance, on exit = -P
+ */
+extern void ECP2_neg(ECP2 *P);
+/**	@brief Doubles an ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =2*P
+ */
+extern int ECP2_dbl(ECP2 *P);
+/**	@brief Adds ECP2 instance Q to ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P+Q
+	@param Q ECP2 instance to be added to P
+ */
+extern int ECP2_add(ECP2 *P, ECP2 *Q);
+/**	@brief Subtracts ECP instance Q from ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P-Q
+	@param Q ECP2 instance to be subtracted from P
+ */
+extern void ECP2_sub(ECP2 *P, ECP2 *Q);
+/**	@brief Multiplies an ECP2 instance P by a BIG, side-channel resistant
+ *
+	Uses fixed sized windows.
+	@param P ECP2 instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP2_mul(ECP2 *P, B384_58::BIG b);
+/**	@brief Multiplies an ECP2 instance P by the internal modulus p, using precalculated Frobenius constant f
+ *
+	Fast point multiplication using Frobenius
+	@param P ECP2 instance, on exit = p*P
+	@param f FP2 precalculated Frobenius constant
+
+ */
+extern void ECP2_frob(ECP2 *P, BLS12383::FP2 *f);
+/**	@brief Calculates P=b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+ *
+	@param P ECP2 instance, on exit = b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+	@param Q ECP2 array of 4 points
+	@param b BIG array of 4 multipliers
+ */
+extern void ECP2_mul4(ECP2 *P, ECP2 *Q, B384_58::BIG *b);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP2 multiplied by co-factor
+ */
+extern void ECP2_cfp(ECP2 *Q);
+
+/**	@brief Maps random FP2 to curve point in constant time
+ *
+	@param Q ECP2 instance 
+	@param x FP2 derived from hash
+ */
+extern void ECP2_map2point(ECP2 *Q, BLS12383::FP2 *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP2 instance 
+	@param x Fp derived from hash
+ */
+extern void ECP2_hap2point(ECP2 *Q, B384_58::BIG  x);
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param P ECP2 instance of correct order
+	@param W OCTET byte array to be mapped
+ */
+extern void ECP2_mapit(ECP2 *P, octet *w);
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP2 instance
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_generator(ECP2 *G);
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp2_BLS12443.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp2_BLS12443.h
new file mode 100644
index 0000000..d99989b
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp2_BLS12443.h
@@ -0,0 +1,249 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP2_BLS12443_H
+#define ECP2_BLS12443_H
+
+#include "fp2_BLS12443.h"
+#include "config_curve_BLS12443.h"
+
+using namespace core;
+
+
+namespace BLS12443 {
+
+extern const B448_60::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B448_60::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+}
+
+namespace BLS12443 {
+
+/**
+	@brief ECP2 Structure - Elliptic Curve Point over quadratic extension field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag */
+    BLS12443::FP2 x;   /**< x-coordinate of point */
+    BLS12443::FP2 y;   /**< y-coordinate of point */
+    BLS12443::FP2 z;   /**< z-coordinate of point */
+} ECP2;
+
+
+/* Curve Params - see rom*.cpp */
+
+extern const int CURVE_B_I;		/**< Elliptic curve B parameter */
+extern const B448_60::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B448_60::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B448_60::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B448_60::BIG CURVE_Bnx;   /**< Elliptic curve parameter */
+extern const B448_60::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+
+/* Generator point on G1 */
+extern const B448_60::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B448_60::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B448_60::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+/* ECP2 E(Fp2) prototypes */
+/**	@brief Tests for ECP2 point equal to infinity
+ *
+	@param P ECP2 point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP2_isinf(ECP2 *P);
+/**	@brief Copy ECP2 point to another ECP2 point
+ *
+	@param P ECP2 instance, on exit = Q
+	@param Q ECP2 instance to be copied
+ */
+extern void ECP2_copy(ECP2 *P, ECP2 *Q);
+/**	@brief Set ECP2 to point-at-infinity
+ *
+	@param P ECP2 instance to be set to infinity
+ */
+extern void ECP2_inf(ECP2 *P);
+/**	@brief Tests for equality of two ECP2s
+ *
+	@param P ECP2 instance to be compared
+	@param Q ECP2 instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP2_equals(ECP2 *P, ECP2 *Q);
+/**	@brief Converts an ECP2 point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP2 instance to be converted to affine form
+ */
+extern void ECP2_affine(ECP2 *P);
+/**	@brief Extract x and y coordinates of an ECP2 point P
+ *
+	If x=y, returns only x
+	@param x FP2 on exit = x coordinate of point
+	@param y FP2 on exit = y coordinate of point (unless x=y)
+	@param P ECP2 instance (x,y)
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP2_get(BLS12443::FP2 *x, BLS12443::FP2 *y, ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, converted to affine coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_output(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, in projective coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_outputxyz(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to an octet string
+ *
+	The octet string is created in the form x|y or just x if compressed
+	Convert the real and imaginary parts of the x and y coordinates to big-endian base 256 form.
+    If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param S output octet string
+	@param P ECP2 instance to be converted to an octet string
+    @param c true for compression
+ */
+extern void ECP2_toOctet(octet *S, ECP2 *P, bool c);
+/**	@brief Creates an ECP2 point from an octet string
+ *
+	The octet string is in the form x|y
+	The real and imaginary parts of the x and y coordinates are in big-endian base 256 form.
+    If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP2 instance to be created from the octet string
+	@param S input octet string
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP2_fromOctet(ECP2 *P, octet *S);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x)=x^3+Ax+B
+	Used internally.
+	@param r FP2 value of f(x)
+	@param x FP2 instance
+ */
+extern void ECP2_rhs(BLS12443::FP2 *r, BLS12443::FP2 *x);
+/**	@brief Set ECP2 to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP2 instance to be set (x,y)
+	@param x FP2 x coordinate of point
+	@param y FP2 y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_set(ECP2 *P, BLS12443::FP2 *x, BLS12443::FP2 *y);
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Otherwise y coordinate is calculated from x.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+    @param s sign of y
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_setx(ECP2 *P, BLS12443::FP2 *x, int s);
+/**	@brief Negation of an ECP2 point
+ *
+	@param P ECP2 instance, on exit = -P
+ */
+extern void ECP2_neg(ECP2 *P);
+/**	@brief Doubles an ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =2*P
+ */
+extern int ECP2_dbl(ECP2 *P);
+/**	@brief Adds ECP2 instance Q to ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P+Q
+	@param Q ECP2 instance to be added to P
+ */
+extern int ECP2_add(ECP2 *P, ECP2 *Q);
+/**	@brief Subtracts ECP instance Q from ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P-Q
+	@param Q ECP2 instance to be subtracted from P
+ */
+extern void ECP2_sub(ECP2 *P, ECP2 *Q);
+/**	@brief Multiplies an ECP2 instance P by a BIG, side-channel resistant
+ *
+	Uses fixed sized windows.
+	@param P ECP2 instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP2_mul(ECP2 *P, B448_60::BIG b);
+/**	@brief Multiplies an ECP2 instance P by the internal modulus p, using precalculated Frobenius constant f
+ *
+	Fast point multiplication using Frobenius
+	@param P ECP2 instance, on exit = p*P
+	@param f FP2 precalculated Frobenius constant
+
+ */
+extern void ECP2_frob(ECP2 *P, BLS12443::FP2 *f);
+/**	@brief Calculates P=b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+ *
+	@param P ECP2 instance, on exit = b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+	@param Q ECP2 array of 4 points
+	@param b BIG array of 4 multipliers
+ */
+extern void ECP2_mul4(ECP2 *P, ECP2 *Q, B448_60::BIG *b);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP2 multiplied by co-factor
+ */
+extern void ECP2_cfp(ECP2 *Q);
+
+/**	@brief Maps random FP2 to curve point in constant time
+ *
+	@param Q ECP2 instance 
+	@param x FP2 derived from hash
+ */
+extern void ECP2_map2point(ECP2 *Q, BLS12443::FP2 *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP2 instance 
+	@param x Fp derived from hash
+ */
+extern void ECP2_hap2point(ECP2 *Q, B448_60::BIG  x);
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param P ECP2 instance of correct order
+	@param W OCTET byte array to be mapped
+ */
+extern void ECP2_mapit(ECP2 *P, octet *w);
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP2 instance
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_generator(ECP2 *G);
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp2_BLS12461.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp2_BLS12461.h
new file mode 100644
index 0000000..00d03f9
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp2_BLS12461.h
@@ -0,0 +1,249 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP2_BLS12461_H
+#define ECP2_BLS12461_H
+
+#include "fp2_BLS12461.h"
+#include "config_curve_BLS12461.h"
+
+using namespace core;
+
+
+namespace BLS12461 {
+
+extern const B464_60::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B464_60::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+}
+
+namespace BLS12461 {
+
+/**
+	@brief ECP2 Structure - Elliptic Curve Point over quadratic extension field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag */
+    BLS12461::FP2 x;   /**< x-coordinate of point */
+    BLS12461::FP2 y;   /**< y-coordinate of point */
+    BLS12461::FP2 z;   /**< z-coordinate of point */
+} ECP2;
+
+
+/* Curve Params - see rom*.cpp */
+
+extern const int CURVE_B_I;		/**< Elliptic curve B parameter */
+extern const B464_60::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B464_60::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B464_60::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B464_60::BIG CURVE_Bnx;   /**< Elliptic curve parameter */
+extern const B464_60::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+
+/* Generator point on G1 */
+extern const B464_60::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B464_60::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B464_60::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+/* ECP2 E(Fp2) prototypes */
+/**	@brief Tests for ECP2 point equal to infinity
+ *
+	@param P ECP2 point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP2_isinf(ECP2 *P);
+/**	@brief Copy ECP2 point to another ECP2 point
+ *
+	@param P ECP2 instance, on exit = Q
+	@param Q ECP2 instance to be copied
+ */
+extern void ECP2_copy(ECP2 *P, ECP2 *Q);
+/**	@brief Set ECP2 to point-at-infinity
+ *
+	@param P ECP2 instance to be set to infinity
+ */
+extern void ECP2_inf(ECP2 *P);
+/**	@brief Tests for equality of two ECP2s
+ *
+	@param P ECP2 instance to be compared
+	@param Q ECP2 instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP2_equals(ECP2 *P, ECP2 *Q);
+/**	@brief Converts an ECP2 point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP2 instance to be converted to affine form
+ */
+extern void ECP2_affine(ECP2 *P);
+/**	@brief Extract x and y coordinates of an ECP2 point P
+ *
+	If x=y, returns only x
+	@param x FP2 on exit = x coordinate of point
+	@param y FP2 on exit = y coordinate of point (unless x=y)
+	@param P ECP2 instance (x,y)
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP2_get(BLS12461::FP2 *x, BLS12461::FP2 *y, ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, converted to affine coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_output(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, in projective coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_outputxyz(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to an octet string
+ *
+	The octet string is created in the form x|y or just x if compressed
+	Convert the real and imaginary parts of the x and y coordinates to big-endian base 256 form.
+    If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param S output octet string
+	@param P ECP2 instance to be converted to an octet string
+    @param c true for compression
+ */
+extern void ECP2_toOctet(octet *S, ECP2 *P, bool c);
+/**	@brief Creates an ECP2 point from an octet string
+ *
+	The octet string is in the form x|y
+	The real and imaginary parts of the x and y coordinates are in big-endian base 256 form.
+    If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP2 instance to be created from the octet string
+	@param S input octet string
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP2_fromOctet(ECP2 *P, octet *S);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x)=x^3+Ax+B
+	Used internally.
+	@param r FP2 value of f(x)
+	@param x FP2 instance
+ */
+extern void ECP2_rhs(BLS12461::FP2 *r, BLS12461::FP2 *x);
+/**	@brief Set ECP2 to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP2 instance to be set (x,y)
+	@param x FP2 x coordinate of point
+	@param y FP2 y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_set(ECP2 *P, BLS12461::FP2 *x, BLS12461::FP2 *y);
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Otherwise y coordinate is calculated from x.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+    @param s sign of y
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_setx(ECP2 *P, BLS12461::FP2 *x, int s);
+/**	@brief Negation of an ECP2 point
+ *
+	@param P ECP2 instance, on exit = -P
+ */
+extern void ECP2_neg(ECP2 *P);
+/**	@brief Doubles an ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =2*P
+ */
+extern int ECP2_dbl(ECP2 *P);
+/**	@brief Adds ECP2 instance Q to ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P+Q
+	@param Q ECP2 instance to be added to P
+ */
+extern int ECP2_add(ECP2 *P, ECP2 *Q);
+/**	@brief Subtracts ECP instance Q from ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P-Q
+	@param Q ECP2 instance to be subtracted from P
+ */
+extern void ECP2_sub(ECP2 *P, ECP2 *Q);
+/**	@brief Multiplies an ECP2 instance P by a BIG, side-channel resistant
+ *
+	Uses fixed sized windows.
+	@param P ECP2 instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP2_mul(ECP2 *P, B464_60::BIG b);
+/**	@brief Multiplies an ECP2 instance P by the internal modulus p, using precalculated Frobenius constant f
+ *
+	Fast point multiplication using Frobenius
+	@param P ECP2 instance, on exit = p*P
+	@param f FP2 precalculated Frobenius constant
+
+ */
+extern void ECP2_frob(ECP2 *P, BLS12461::FP2 *f);
+/**	@brief Calculates P=b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+ *
+	@param P ECP2 instance, on exit = b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+	@param Q ECP2 array of 4 points
+	@param b BIG array of 4 multipliers
+ */
+extern void ECP2_mul4(ECP2 *P, ECP2 *Q, B464_60::BIG *b);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP2 multiplied by co-factor
+ */
+extern void ECP2_cfp(ECP2 *Q);
+
+/**	@brief Maps random FP2 to curve point in constant time
+ *
+	@param Q ECP2 instance 
+	@param x FP2 derived from hash
+ */
+extern void ECP2_map2point(ECP2 *Q, BLS12461::FP2 *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP2 instance 
+	@param x Fp derived from hash
+ */
+extern void ECP2_hap2point(ECP2 *Q, B464_60::BIG  x);
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param P ECP2 instance of correct order
+	@param W OCTET byte array to be mapped
+ */
+extern void ECP2_mapit(ECP2 *P, octet *w);
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP2 instance
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_generator(ECP2 *G);
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp2_BN158.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp2_BN158.h
new file mode 100644
index 0000000..63fe5ba
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp2_BN158.h
@@ -0,0 +1,249 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP2_BN158_H
+#define ECP2_BN158_H
+
+#include "fp2_BN158.h"
+#include "config_curve_BN158.h"
+
+using namespace core;
+
+
+namespace BN158 {
+
+extern const B160_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B160_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+}
+
+namespace BN158 {
+
+/**
+	@brief ECP2 Structure - Elliptic Curve Point over quadratic extension field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag */
+    BN158::FP2 x;   /**< x-coordinate of point */
+    BN158::FP2 y;   /**< y-coordinate of point */
+    BN158::FP2 z;   /**< z-coordinate of point */
+} ECP2;
+
+
+/* Curve Params - see rom*.cpp */
+
+extern const int CURVE_B_I;		/**< Elliptic curve B parameter */
+extern const B160_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B160_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B160_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B160_56::BIG CURVE_Bnx;   /**< Elliptic curve parameter */
+extern const B160_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+
+/* Generator point on G1 */
+extern const B160_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B160_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B160_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+/* ECP2 E(Fp2) prototypes */
+/**	@brief Tests for ECP2 point equal to infinity
+ *
+	@param P ECP2 point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP2_isinf(ECP2 *P);
+/**	@brief Copy ECP2 point to another ECP2 point
+ *
+	@param P ECP2 instance, on exit = Q
+	@param Q ECP2 instance to be copied
+ */
+extern void ECP2_copy(ECP2 *P, ECP2 *Q);
+/**	@brief Set ECP2 to point-at-infinity
+ *
+	@param P ECP2 instance to be set to infinity
+ */
+extern void ECP2_inf(ECP2 *P);
+/**	@brief Tests for equality of two ECP2s
+ *
+	@param P ECP2 instance to be compared
+	@param Q ECP2 instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP2_equals(ECP2 *P, ECP2 *Q);
+/**	@brief Converts an ECP2 point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP2 instance to be converted to affine form
+ */
+extern void ECP2_affine(ECP2 *P);
+/**	@brief Extract x and y coordinates of an ECP2 point P
+ *
+	If x=y, returns only x
+	@param x FP2 on exit = x coordinate of point
+	@param y FP2 on exit = y coordinate of point (unless x=y)
+	@param P ECP2 instance (x,y)
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP2_get(BN158::FP2 *x, BN158::FP2 *y, ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, converted to affine coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_output(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, in projective coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_outputxyz(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to an octet string
+ *
+	The octet string is created in the form x|y or just x if compressed
+	Convert the real and imaginary parts of the x and y coordinates to big-endian base 256 form.
+    If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param S output octet string
+	@param P ECP2 instance to be converted to an octet string
+    @param c true for compression
+ */
+extern void ECP2_toOctet(octet *S, ECP2 *P, bool c);
+/**	@brief Creates an ECP2 point from an octet string
+ *
+	The octet string is in the form x|y
+	The real and imaginary parts of the x and y coordinates are in big-endian base 256 form.
+    If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP2 instance to be created from the octet string
+	@param S input octet string
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP2_fromOctet(ECP2 *P, octet *S);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x)=x^3+Ax+B
+	Used internally.
+	@param r FP2 value of f(x)
+	@param x FP2 instance
+ */
+extern void ECP2_rhs(BN158::FP2 *r, BN158::FP2 *x);
+/**	@brief Set ECP2 to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP2 instance to be set (x,y)
+	@param x FP2 x coordinate of point
+	@param y FP2 y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_set(ECP2 *P, BN158::FP2 *x, BN158::FP2 *y);
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Otherwise y coordinate is calculated from x.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+    @param s sign of y
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_setx(ECP2 *P, BN158::FP2 *x, int s);
+/**	@brief Negation of an ECP2 point
+ *
+	@param P ECP2 instance, on exit = -P
+ */
+extern void ECP2_neg(ECP2 *P);
+/**	@brief Doubles an ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =2*P
+ */
+extern int ECP2_dbl(ECP2 *P);
+/**	@brief Adds ECP2 instance Q to ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P+Q
+	@param Q ECP2 instance to be added to P
+ */
+extern int ECP2_add(ECP2 *P, ECP2 *Q);
+/**	@brief Subtracts ECP instance Q from ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P-Q
+	@param Q ECP2 instance to be subtracted from P
+ */
+extern void ECP2_sub(ECP2 *P, ECP2 *Q);
+/**	@brief Multiplies an ECP2 instance P by a BIG, side-channel resistant
+ *
+	Uses fixed sized windows.
+	@param P ECP2 instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP2_mul(ECP2 *P, B160_56::BIG b);
+/**	@brief Multiplies an ECP2 instance P by the internal modulus p, using precalculated Frobenius constant f
+ *
+	Fast point multiplication using Frobenius
+	@param P ECP2 instance, on exit = p*P
+	@param f FP2 precalculated Frobenius constant
+
+ */
+extern void ECP2_frob(ECP2 *P, BN158::FP2 *f);
+/**	@brief Calculates P=b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+ *
+	@param P ECP2 instance, on exit = b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+	@param Q ECP2 array of 4 points
+	@param b BIG array of 4 multipliers
+ */
+extern void ECP2_mul4(ECP2 *P, ECP2 *Q, B160_56::BIG *b);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP2 multiplied by co-factor
+ */
+extern void ECP2_cfp(ECP2 *Q);
+
+/**	@brief Maps random FP2 to curve point in constant time
+ *
+	@param Q ECP2 instance 
+	@param x FP2 derived from hash
+ */
+extern void ECP2_map2point(ECP2 *Q, BN158::FP2 *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP2 instance 
+	@param x Fp derived from hash
+ */
+extern void ECP2_hap2point(ECP2 *Q, B160_56::BIG  x);
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param P ECP2 instance of correct order
+	@param W OCTET byte array to be mapped
+ */
+extern void ECP2_mapit(ECP2 *P, octet *w);
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP2 instance
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_generator(ECP2 *G);
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp2_BN254.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp2_BN254.h
new file mode 100644
index 0000000..3a14b73
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp2_BN254.h
@@ -0,0 +1,249 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP2_BN254_H
+#define ECP2_BN254_H
+
+#include "fp2_BN254.h"
+#include "config_curve_BN254.h"
+
+using namespace core;
+
+
+namespace BN254 {
+
+extern const B256_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+}
+
+namespace BN254 {
+
+/**
+	@brief ECP2 Structure - Elliptic Curve Point over quadratic extension field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag */
+    BN254::FP2 x;   /**< x-coordinate of point */
+    BN254::FP2 y;   /**< y-coordinate of point */
+    BN254::FP2 z;   /**< z-coordinate of point */
+} ECP2;
+
+
+/* Curve Params - see rom*.cpp */
+
+extern const int CURVE_B_I;		/**< Elliptic curve B parameter */
+extern const B256_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_56::BIG CURVE_Bnx;   /**< Elliptic curve parameter */
+extern const B256_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+
+/* Generator point on G1 */
+extern const B256_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+/* ECP2 E(Fp2) prototypes */
+/**	@brief Tests for ECP2 point equal to infinity
+ *
+	@param P ECP2 point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP2_isinf(ECP2 *P);
+/**	@brief Copy ECP2 point to another ECP2 point
+ *
+	@param P ECP2 instance, on exit = Q
+	@param Q ECP2 instance to be copied
+ */
+extern void ECP2_copy(ECP2 *P, ECP2 *Q);
+/**	@brief Set ECP2 to point-at-infinity
+ *
+	@param P ECP2 instance to be set to infinity
+ */
+extern void ECP2_inf(ECP2 *P);
+/**	@brief Tests for equality of two ECP2s
+ *
+	@param P ECP2 instance to be compared
+	@param Q ECP2 instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP2_equals(ECP2 *P, ECP2 *Q);
+/**	@brief Converts an ECP2 point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP2 instance to be converted to affine form
+ */
+extern void ECP2_affine(ECP2 *P);
+/**	@brief Extract x and y coordinates of an ECP2 point P
+ *
+	If x=y, returns only x
+	@param x FP2 on exit = x coordinate of point
+	@param y FP2 on exit = y coordinate of point (unless x=y)
+	@param P ECP2 instance (x,y)
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP2_get(BN254::FP2 *x, BN254::FP2 *y, ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, converted to affine coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_output(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, in projective coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_outputxyz(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to an octet string
+ *
+	The octet string is created in the form x|y or just x if compressed
+	Convert the real and imaginary parts of the x and y coordinates to big-endian base 256 form.
+    If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param S output octet string
+	@param P ECP2 instance to be converted to an octet string
+    @param c true for compression
+ */
+extern void ECP2_toOctet(octet *S, ECP2 *P, bool c);
+/**	@brief Creates an ECP2 point from an octet string
+ *
+	The octet string is in the form x|y
+	The real and imaginary parts of the x and y coordinates are in big-endian base 256 form.
+    If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP2 instance to be created from the octet string
+	@param S input octet string
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP2_fromOctet(ECP2 *P, octet *S);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x)=x^3+Ax+B
+	Used internally.
+	@param r FP2 value of f(x)
+	@param x FP2 instance
+ */
+extern void ECP2_rhs(BN254::FP2 *r, BN254::FP2 *x);
+/**	@brief Set ECP2 to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP2 instance to be set (x,y)
+	@param x FP2 x coordinate of point
+	@param y FP2 y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_set(ECP2 *P, BN254::FP2 *x, BN254::FP2 *y);
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Otherwise y coordinate is calculated from x.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+    @param s sign of y
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_setx(ECP2 *P, BN254::FP2 *x, int s);
+/**	@brief Negation of an ECP2 point
+ *
+	@param P ECP2 instance, on exit = -P
+ */
+extern void ECP2_neg(ECP2 *P);
+/**	@brief Doubles an ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =2*P
+ */
+extern int ECP2_dbl(ECP2 *P);
+/**	@brief Adds ECP2 instance Q to ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P+Q
+	@param Q ECP2 instance to be added to P
+ */
+extern int ECP2_add(ECP2 *P, ECP2 *Q);
+/**	@brief Subtracts ECP instance Q from ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P-Q
+	@param Q ECP2 instance to be subtracted from P
+ */
+extern void ECP2_sub(ECP2 *P, ECP2 *Q);
+/**	@brief Multiplies an ECP2 instance P by a BIG, side-channel resistant
+ *
+	Uses fixed sized windows.
+	@param P ECP2 instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP2_mul(ECP2 *P, B256_56::BIG b);
+/**	@brief Multiplies an ECP2 instance P by the internal modulus p, using precalculated Frobenius constant f
+ *
+	Fast point multiplication using Frobenius
+	@param P ECP2 instance, on exit = p*P
+	@param f FP2 precalculated Frobenius constant
+
+ */
+extern void ECP2_frob(ECP2 *P, BN254::FP2 *f);
+/**	@brief Calculates P=b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+ *
+	@param P ECP2 instance, on exit = b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+	@param Q ECP2 array of 4 points
+	@param b BIG array of 4 multipliers
+ */
+extern void ECP2_mul4(ECP2 *P, ECP2 *Q, B256_56::BIG *b);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP2 multiplied by co-factor
+ */
+extern void ECP2_cfp(ECP2 *Q);
+
+/**	@brief Maps random FP2 to curve point in constant time
+ *
+	@param Q ECP2 instance 
+	@param x FP2 derived from hash
+ */
+extern void ECP2_map2point(ECP2 *Q, BN254::FP2 *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP2 instance 
+	@param x Fp derived from hash
+ */
+extern void ECP2_hap2point(ECP2 *Q, B256_56::BIG  x);
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param P ECP2 instance of correct order
+	@param W OCTET byte array to be mapped
+ */
+extern void ECP2_mapit(ECP2 *P, octet *w);
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP2 instance
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_generator(ECP2 *G);
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp2_BN254CX.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp2_BN254CX.h
new file mode 100644
index 0000000..550fb25
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp2_BN254CX.h
@@ -0,0 +1,249 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP2_BN254CX_H
+#define ECP2_BN254CX_H
+
+#include "fp2_BN254CX.h"
+#include "config_curve_BN254CX.h"
+
+using namespace core;
+
+
+namespace BN254CX {
+
+extern const B256_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+}
+
+namespace BN254CX {
+
+/**
+	@brief ECP2 Structure - Elliptic Curve Point over quadratic extension field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag */
+    BN254CX::FP2 x;   /**< x-coordinate of point */
+    BN254CX::FP2 y;   /**< y-coordinate of point */
+    BN254CX::FP2 z;   /**< z-coordinate of point */
+} ECP2;
+
+
+/* Curve Params - see rom*.cpp */
+
+extern const int CURVE_B_I;		/**< Elliptic curve B parameter */
+extern const B256_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_56::BIG CURVE_Bnx;   /**< Elliptic curve parameter */
+extern const B256_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+
+/* Generator point on G1 */
+extern const B256_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+/* ECP2 E(Fp2) prototypes */
+/**	@brief Tests for ECP2 point equal to infinity
+ *
+	@param P ECP2 point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP2_isinf(ECP2 *P);
+/**	@brief Copy ECP2 point to another ECP2 point
+ *
+	@param P ECP2 instance, on exit = Q
+	@param Q ECP2 instance to be copied
+ */
+extern void ECP2_copy(ECP2 *P, ECP2 *Q);
+/**	@brief Set ECP2 to point-at-infinity
+ *
+	@param P ECP2 instance to be set to infinity
+ */
+extern void ECP2_inf(ECP2 *P);
+/**	@brief Tests for equality of two ECP2s
+ *
+	@param P ECP2 instance to be compared
+	@param Q ECP2 instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP2_equals(ECP2 *P, ECP2 *Q);
+/**	@brief Converts an ECP2 point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP2 instance to be converted to affine form
+ */
+extern void ECP2_affine(ECP2 *P);
+/**	@brief Extract x and y coordinates of an ECP2 point P
+ *
+	If x=y, returns only x
+	@param x FP2 on exit = x coordinate of point
+	@param y FP2 on exit = y coordinate of point (unless x=y)
+	@param P ECP2 instance (x,y)
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP2_get(BN254CX::FP2 *x, BN254CX::FP2 *y, ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, converted to affine coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_output(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, in projective coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_outputxyz(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to an octet string
+ *
+	The octet string is created in the form x|y or just x if compressed
+	Convert the real and imaginary parts of the x and y coordinates to big-endian base 256 form.
+    If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param S output octet string
+	@param P ECP2 instance to be converted to an octet string
+    @param c true for compression
+ */
+extern void ECP2_toOctet(octet *S, ECP2 *P, bool c);
+/**	@brief Creates an ECP2 point from an octet string
+ *
+	The octet string is in the form x|y
+	The real and imaginary parts of the x and y coordinates are in big-endian base 256 form.
+    If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP2 instance to be created from the octet string
+	@param S input octet string
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP2_fromOctet(ECP2 *P, octet *S);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x)=x^3+Ax+B
+	Used internally.
+	@param r FP2 value of f(x)
+	@param x FP2 instance
+ */
+extern void ECP2_rhs(BN254CX::FP2 *r, BN254CX::FP2 *x);
+/**	@brief Set ECP2 to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP2 instance to be set (x,y)
+	@param x FP2 x coordinate of point
+	@param y FP2 y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_set(ECP2 *P, BN254CX::FP2 *x, BN254CX::FP2 *y);
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Otherwise y coordinate is calculated from x.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+    @param s sign of y
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_setx(ECP2 *P, BN254CX::FP2 *x, int s);
+/**	@brief Negation of an ECP2 point
+ *
+	@param P ECP2 instance, on exit = -P
+ */
+extern void ECP2_neg(ECP2 *P);
+/**	@brief Doubles an ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =2*P
+ */
+extern int ECP2_dbl(ECP2 *P);
+/**	@brief Adds ECP2 instance Q to ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P+Q
+	@param Q ECP2 instance to be added to P
+ */
+extern int ECP2_add(ECP2 *P, ECP2 *Q);
+/**	@brief Subtracts ECP instance Q from ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P-Q
+	@param Q ECP2 instance to be subtracted from P
+ */
+extern void ECP2_sub(ECP2 *P, ECP2 *Q);
+/**	@brief Multiplies an ECP2 instance P by a BIG, side-channel resistant
+ *
+	Uses fixed sized windows.
+	@param P ECP2 instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP2_mul(ECP2 *P, B256_56::BIG b);
+/**	@brief Multiplies an ECP2 instance P by the internal modulus p, using precalculated Frobenius constant f
+ *
+	Fast point multiplication using Frobenius
+	@param P ECP2 instance, on exit = p*P
+	@param f FP2 precalculated Frobenius constant
+
+ */
+extern void ECP2_frob(ECP2 *P, BN254CX::FP2 *f);
+/**	@brief Calculates P=b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+ *
+	@param P ECP2 instance, on exit = b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+	@param Q ECP2 array of 4 points
+	@param b BIG array of 4 multipliers
+ */
+extern void ECP2_mul4(ECP2 *P, ECP2 *Q, B256_56::BIG *b);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP2 multiplied by co-factor
+ */
+extern void ECP2_cfp(ECP2 *Q);
+
+/**	@brief Maps random FP2 to curve point in constant time
+ *
+	@param Q ECP2 instance 
+	@param x FP2 derived from hash
+ */
+extern void ECP2_map2point(ECP2 *Q, BN254CX::FP2 *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP2 instance 
+	@param x Fp derived from hash
+ */
+extern void ECP2_hap2point(ECP2 *Q, B256_56::BIG  x);
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param P ECP2 instance of correct order
+	@param W OCTET byte array to be mapped
+ */
+extern void ECP2_mapit(ECP2 *P, octet *w);
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP2 instance
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_generator(ECP2 *G);
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp2_BN462.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp2_BN462.h
new file mode 100644
index 0000000..1fdd8bc
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp2_BN462.h
@@ -0,0 +1,249 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP2_BN462_H
+#define ECP2_BN462_H
+
+#include "fp2_BN462.h"
+#include "config_curve_BN462.h"
+
+using namespace core;
+
+
+namespace BN462 {
+
+extern const B464_60::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B464_60::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+}
+
+namespace BN462 {
+
+/**
+	@brief ECP2 Structure - Elliptic Curve Point over quadratic extension field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag */
+    BN462::FP2 x;   /**< x-coordinate of point */
+    BN462::FP2 y;   /**< y-coordinate of point */
+    BN462::FP2 z;   /**< z-coordinate of point */
+} ECP2;
+
+
+/* Curve Params - see rom*.cpp */
+
+extern const int CURVE_B_I;		/**< Elliptic curve B parameter */
+extern const B464_60::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B464_60::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B464_60::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B464_60::BIG CURVE_Bnx;   /**< Elliptic curve parameter */
+extern const B464_60::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+
+/* Generator point on G1 */
+extern const B464_60::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B464_60::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B464_60::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+/* ECP2 E(Fp2) prototypes */
+/**	@brief Tests for ECP2 point equal to infinity
+ *
+	@param P ECP2 point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP2_isinf(ECP2 *P);
+/**	@brief Copy ECP2 point to another ECP2 point
+ *
+	@param P ECP2 instance, on exit = Q
+	@param Q ECP2 instance to be copied
+ */
+extern void ECP2_copy(ECP2 *P, ECP2 *Q);
+/**	@brief Set ECP2 to point-at-infinity
+ *
+	@param P ECP2 instance to be set to infinity
+ */
+extern void ECP2_inf(ECP2 *P);
+/**	@brief Tests for equality of two ECP2s
+ *
+	@param P ECP2 instance to be compared
+	@param Q ECP2 instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP2_equals(ECP2 *P, ECP2 *Q);
+/**	@brief Converts an ECP2 point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP2 instance to be converted to affine form
+ */
+extern void ECP2_affine(ECP2 *P);
+/**	@brief Extract x and y coordinates of an ECP2 point P
+ *
+	If x=y, returns only x
+	@param x FP2 on exit = x coordinate of point
+	@param y FP2 on exit = y coordinate of point (unless x=y)
+	@param P ECP2 instance (x,y)
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP2_get(BN462::FP2 *x, BN462::FP2 *y, ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, converted to affine coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_output(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, in projective coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_outputxyz(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to an octet string
+ *
+	The octet string is created in the form x|y or just x if compressed
+	Convert the real and imaginary parts of the x and y coordinates to big-endian base 256 form.
+    If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param S output octet string
+	@param P ECP2 instance to be converted to an octet string
+    @param c true for compression
+ */
+extern void ECP2_toOctet(octet *S, ECP2 *P, bool c);
+/**	@brief Creates an ECP2 point from an octet string
+ *
+	The octet string is in the form x|y
+	The real and imaginary parts of the x and y coordinates are in big-endian base 256 form.
+    If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP2 instance to be created from the octet string
+	@param S input octet string
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP2_fromOctet(ECP2 *P, octet *S);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x)=x^3+Ax+B
+	Used internally.
+	@param r FP2 value of f(x)
+	@param x FP2 instance
+ */
+extern void ECP2_rhs(BN462::FP2 *r, BN462::FP2 *x);
+/**	@brief Set ECP2 to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP2 instance to be set (x,y)
+	@param x FP2 x coordinate of point
+	@param y FP2 y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_set(ECP2 *P, BN462::FP2 *x, BN462::FP2 *y);
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Otherwise y coordinate is calculated from x.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+    @param s sign of y
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_setx(ECP2 *P, BN462::FP2 *x, int s);
+/**	@brief Negation of an ECP2 point
+ *
+	@param P ECP2 instance, on exit = -P
+ */
+extern void ECP2_neg(ECP2 *P);
+/**	@brief Doubles an ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =2*P
+ */
+extern int ECP2_dbl(ECP2 *P);
+/**	@brief Adds ECP2 instance Q to ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P+Q
+	@param Q ECP2 instance to be added to P
+ */
+extern int ECP2_add(ECP2 *P, ECP2 *Q);
+/**	@brief Subtracts ECP instance Q from ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P-Q
+	@param Q ECP2 instance to be subtracted from P
+ */
+extern void ECP2_sub(ECP2 *P, ECP2 *Q);
+/**	@brief Multiplies an ECP2 instance P by a BIG, side-channel resistant
+ *
+	Uses fixed sized windows.
+	@param P ECP2 instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP2_mul(ECP2 *P, B464_60::BIG b);
+/**	@brief Multiplies an ECP2 instance P by the internal modulus p, using precalculated Frobenius constant f
+ *
+	Fast point multiplication using Frobenius
+	@param P ECP2 instance, on exit = p*P
+	@param f FP2 precalculated Frobenius constant
+
+ */
+extern void ECP2_frob(ECP2 *P, BN462::FP2 *f);
+/**	@brief Calculates P=b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+ *
+	@param P ECP2 instance, on exit = b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+	@param Q ECP2 array of 4 points
+	@param b BIG array of 4 multipliers
+ */
+extern void ECP2_mul4(ECP2 *P, ECP2 *Q, B464_60::BIG *b);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP2 multiplied by co-factor
+ */
+extern void ECP2_cfp(ECP2 *Q);
+
+/**	@brief Maps random FP2 to curve point in constant time
+ *
+	@param Q ECP2 instance 
+	@param x FP2 derived from hash
+ */
+extern void ECP2_map2point(ECP2 *Q, BN462::FP2 *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP2 instance 
+	@param x Fp derived from hash
+ */
+extern void ECP2_hap2point(ECP2 *Q, B464_60::BIG  x);
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param P ECP2 instance of correct order
+	@param W OCTET byte array to be mapped
+ */
+extern void ECP2_mapit(ECP2 *P, octet *w);
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP2 instance
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_generator(ECP2 *G);
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp2_FP256BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp2_FP256BN.h
new file mode 100644
index 0000000..981ea27
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp2_FP256BN.h
@@ -0,0 +1,249 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP2_FP256BN_H
+#define ECP2_FP256BN_H
+
+#include "fp2_FP256BN.h"
+#include "config_curve_FP256BN.h"
+
+using namespace core;
+
+
+namespace FP256BN {
+
+extern const B256_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+}
+
+namespace FP256BN {
+
+/**
+	@brief ECP2 Structure - Elliptic Curve Point over quadratic extension field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag */
+    FP256BN::FP2 x;   /**< x-coordinate of point */
+    FP256BN::FP2 y;   /**< y-coordinate of point */
+    FP256BN::FP2 z;   /**< z-coordinate of point */
+} ECP2;
+
+
+/* Curve Params - see rom*.cpp */
+
+extern const int CURVE_B_I;		/**< Elliptic curve B parameter */
+extern const B256_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_56::BIG CURVE_Bnx;   /**< Elliptic curve parameter */
+extern const B256_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+
+/* Generator point on G1 */
+extern const B256_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+/* ECP2 E(Fp2) prototypes */
+/**	@brief Tests for ECP2 point equal to infinity
+ *
+	@param P ECP2 point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP2_isinf(ECP2 *P);
+/**	@brief Copy ECP2 point to another ECP2 point
+ *
+	@param P ECP2 instance, on exit = Q
+	@param Q ECP2 instance to be copied
+ */
+extern void ECP2_copy(ECP2 *P, ECP2 *Q);
+/**	@brief Set ECP2 to point-at-infinity
+ *
+	@param P ECP2 instance to be set to infinity
+ */
+extern void ECP2_inf(ECP2 *P);
+/**	@brief Tests for equality of two ECP2s
+ *
+	@param P ECP2 instance to be compared
+	@param Q ECP2 instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP2_equals(ECP2 *P, ECP2 *Q);
+/**	@brief Converts an ECP2 point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP2 instance to be converted to affine form
+ */
+extern void ECP2_affine(ECP2 *P);
+/**	@brief Extract x and y coordinates of an ECP2 point P
+ *
+	If x=y, returns only x
+	@param x FP2 on exit = x coordinate of point
+	@param y FP2 on exit = y coordinate of point (unless x=y)
+	@param P ECP2 instance (x,y)
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP2_get(FP256BN::FP2 *x, FP256BN::FP2 *y, ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, converted to affine coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_output(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, in projective coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_outputxyz(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to an octet string
+ *
+	The octet string is created in the form x|y or just x if compressed
+	Convert the real and imaginary parts of the x and y coordinates to big-endian base 256 form.
+    If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param S output octet string
+	@param P ECP2 instance to be converted to an octet string
+    @param c true for compression
+ */
+extern void ECP2_toOctet(octet *S, ECP2 *P, bool c);
+/**	@brief Creates an ECP2 point from an octet string
+ *
+	The octet string is in the form x|y
+	The real and imaginary parts of the x and y coordinates are in big-endian base 256 form.
+    If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP2 instance to be created from the octet string
+	@param S input octet string
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP2_fromOctet(ECP2 *P, octet *S);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x)=x^3+Ax+B
+	Used internally.
+	@param r FP2 value of f(x)
+	@param x FP2 instance
+ */
+extern void ECP2_rhs(FP256BN::FP2 *r, FP256BN::FP2 *x);
+/**	@brief Set ECP2 to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP2 instance to be set (x,y)
+	@param x FP2 x coordinate of point
+	@param y FP2 y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_set(ECP2 *P, FP256BN::FP2 *x, FP256BN::FP2 *y);
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Otherwise y coordinate is calculated from x.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+    @param s sign of y
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_setx(ECP2 *P, FP256BN::FP2 *x, int s);
+/**	@brief Negation of an ECP2 point
+ *
+	@param P ECP2 instance, on exit = -P
+ */
+extern void ECP2_neg(ECP2 *P);
+/**	@brief Doubles an ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =2*P
+ */
+extern int ECP2_dbl(ECP2 *P);
+/**	@brief Adds ECP2 instance Q to ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P+Q
+	@param Q ECP2 instance to be added to P
+ */
+extern int ECP2_add(ECP2 *P, ECP2 *Q);
+/**	@brief Subtracts ECP instance Q from ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P-Q
+	@param Q ECP2 instance to be subtracted from P
+ */
+extern void ECP2_sub(ECP2 *P, ECP2 *Q);
+/**	@brief Multiplies an ECP2 instance P by a BIG, side-channel resistant
+ *
+	Uses fixed sized windows.
+	@param P ECP2 instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP2_mul(ECP2 *P, B256_56::BIG b);
+/**	@brief Multiplies an ECP2 instance P by the internal modulus p, using precalculated Frobenius constant f
+ *
+	Fast point multiplication using Frobenius
+	@param P ECP2 instance, on exit = p*P
+	@param f FP2 precalculated Frobenius constant
+
+ */
+extern void ECP2_frob(ECP2 *P, FP256BN::FP2 *f);
+/**	@brief Calculates P=b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+ *
+	@param P ECP2 instance, on exit = b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+	@param Q ECP2 array of 4 points
+	@param b BIG array of 4 multipliers
+ */
+extern void ECP2_mul4(ECP2 *P, ECP2 *Q, B256_56::BIG *b);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP2 multiplied by co-factor
+ */
+extern void ECP2_cfp(ECP2 *Q);
+
+/**	@brief Maps random FP2 to curve point in constant time
+ *
+	@param Q ECP2 instance 
+	@param x FP2 derived from hash
+ */
+extern void ECP2_map2point(ECP2 *Q, FP256BN::FP2 *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP2 instance 
+	@param x Fp derived from hash
+ */
+extern void ECP2_hap2point(ECP2 *Q, B256_56::BIG  x);
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param P ECP2 instance of correct order
+	@param W OCTET byte array to be mapped
+ */
+extern void ECP2_mapit(ECP2 *P, octet *w);
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP2 instance
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_generator(ECP2 *G);
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp2_FP512BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp2_FP512BN.h
new file mode 100644
index 0000000..643426b
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp2_FP512BN.h
@@ -0,0 +1,249 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP2_FP512BN_H
+#define ECP2_FP512BN_H
+
+#include "fp2_FP512BN.h"
+#include "config_curve_FP512BN.h"
+
+using namespace core;
+
+
+namespace FP512BN {
+
+extern const B512_60::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B512_60::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+}
+
+namespace FP512BN {
+
+/**
+	@brief ECP2 Structure - Elliptic Curve Point over quadratic extension field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag */
+    FP512BN::FP2 x;   /**< x-coordinate of point */
+    FP512BN::FP2 y;   /**< y-coordinate of point */
+    FP512BN::FP2 z;   /**< z-coordinate of point */
+} ECP2;
+
+
+/* Curve Params - see rom*.cpp */
+
+extern const int CURVE_B_I;		/**< Elliptic curve B parameter */
+extern const B512_60::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B512_60::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B512_60::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B512_60::BIG CURVE_Bnx;   /**< Elliptic curve parameter */
+extern const B512_60::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+
+/* Generator point on G1 */
+extern const B512_60::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B512_60::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B512_60::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+/* ECP2 E(Fp2) prototypes */
+/**	@brief Tests for ECP2 point equal to infinity
+ *
+	@param P ECP2 point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP2_isinf(ECP2 *P);
+/**	@brief Copy ECP2 point to another ECP2 point
+ *
+	@param P ECP2 instance, on exit = Q
+	@param Q ECP2 instance to be copied
+ */
+extern void ECP2_copy(ECP2 *P, ECP2 *Q);
+/**	@brief Set ECP2 to point-at-infinity
+ *
+	@param P ECP2 instance to be set to infinity
+ */
+extern void ECP2_inf(ECP2 *P);
+/**	@brief Tests for equality of two ECP2s
+ *
+	@param P ECP2 instance to be compared
+	@param Q ECP2 instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP2_equals(ECP2 *P, ECP2 *Q);
+/**	@brief Converts an ECP2 point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP2 instance to be converted to affine form
+ */
+extern void ECP2_affine(ECP2 *P);
+/**	@brief Extract x and y coordinates of an ECP2 point P
+ *
+	If x=y, returns only x
+	@param x FP2 on exit = x coordinate of point
+	@param y FP2 on exit = y coordinate of point (unless x=y)
+	@param P ECP2 instance (x,y)
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP2_get(FP512BN::FP2 *x, FP512BN::FP2 *y, ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, converted to affine coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_output(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, in projective coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_outputxyz(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to an octet string
+ *
+	The octet string is created in the form x|y or just x if compressed
+	Convert the real and imaginary parts of the x and y coordinates to big-endian base 256 form.
+    If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param S output octet string
+	@param P ECP2 instance to be converted to an octet string
+    @param c true for compression
+ */
+extern void ECP2_toOctet(octet *S, ECP2 *P, bool c);
+/**	@brief Creates an ECP2 point from an octet string
+ *
+	The octet string is in the form x|y
+	The real and imaginary parts of the x and y coordinates are in big-endian base 256 form.
+    If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP2 instance to be created from the octet string
+	@param S input octet string
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP2_fromOctet(ECP2 *P, octet *S);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x)=x^3+Ax+B
+	Used internally.
+	@param r FP2 value of f(x)
+	@param x FP2 instance
+ */
+extern void ECP2_rhs(FP512BN::FP2 *r, FP512BN::FP2 *x);
+/**	@brief Set ECP2 to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP2 instance to be set (x,y)
+	@param x FP2 x coordinate of point
+	@param y FP2 y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_set(ECP2 *P, FP512BN::FP2 *x, FP512BN::FP2 *y);
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Otherwise y coordinate is calculated from x.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+    @param s sign of y
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_setx(ECP2 *P, FP512BN::FP2 *x, int s);
+/**	@brief Negation of an ECP2 point
+ *
+	@param P ECP2 instance, on exit = -P
+ */
+extern void ECP2_neg(ECP2 *P);
+/**	@brief Doubles an ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =2*P
+ */
+extern int ECP2_dbl(ECP2 *P);
+/**	@brief Adds ECP2 instance Q to ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P+Q
+	@param Q ECP2 instance to be added to P
+ */
+extern int ECP2_add(ECP2 *P, ECP2 *Q);
+/**	@brief Subtracts ECP instance Q from ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P-Q
+	@param Q ECP2 instance to be subtracted from P
+ */
+extern void ECP2_sub(ECP2 *P, ECP2 *Q);
+/**	@brief Multiplies an ECP2 instance P by a BIG, side-channel resistant
+ *
+	Uses fixed sized windows.
+	@param P ECP2 instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP2_mul(ECP2 *P, B512_60::BIG b);
+/**	@brief Multiplies an ECP2 instance P by the internal modulus p, using precalculated Frobenius constant f
+ *
+	Fast point multiplication using Frobenius
+	@param P ECP2 instance, on exit = p*P
+	@param f FP2 precalculated Frobenius constant
+
+ */
+extern void ECP2_frob(ECP2 *P, FP512BN::FP2 *f);
+/**	@brief Calculates P=b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+ *
+	@param P ECP2 instance, on exit = b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+	@param Q ECP2 array of 4 points
+	@param b BIG array of 4 multipliers
+ */
+extern void ECP2_mul4(ECP2 *P, ECP2 *Q, B512_60::BIG *b);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP2 multiplied by co-factor
+ */
+extern void ECP2_cfp(ECP2 *Q);
+
+/**	@brief Maps random FP2 to curve point in constant time
+ *
+	@param Q ECP2 instance 
+	@param x FP2 derived from hash
+ */
+extern void ECP2_map2point(ECP2 *Q, FP512BN::FP2 *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP2 instance 
+	@param x Fp derived from hash
+ */
+extern void ECP2_hap2point(ECP2 *Q, B512_60::BIG  x);
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param P ECP2 instance of correct order
+	@param W OCTET byte array to be mapped
+ */
+extern void ECP2_mapit(ECP2 *P, octet *w);
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP2 instance
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_generator(ECP2 *G);
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp4.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp4.cpp
new file mode 100644
index 0000000..cdcfd15
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp4.cpp
@@ -0,0 +1,952 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* CORE Weierstrass elliptic curve functions over FP2 */
+
+//#include <iostream>
+#include "ecp4_ZZZ.h"
+
+using namespace std;
+using namespace XXX;
+using namespace YYY;
+
+int ZZZ::ECP4_isinf(ECP4 *P)
+{
+    return (FP4_iszilch(&(P->x)) & FP4_iszilch(&(P->z)));
+}
+
+/* Set P=Q */
+void ZZZ::ECP4_copy(ECP4 *P, ECP4 *Q)
+{
+    FP4_copy(&(P->x), &(Q->x));
+    FP4_copy(&(P->y), &(Q->y));
+    FP4_copy(&(P->z), &(Q->z));
+}
+
+/* set P to Infinity */
+void ZZZ::ECP4_inf(ECP4 *P)
+{
+    FP4_zero(&(P->x));
+    FP4_one(&(P->y));
+    FP4_zero(&(P->z));
+}
+
+/* Conditional move Q to P dependant on d */
+static void ECP4_cmove(ZZZ::ECP4 *P, ZZZ::ECP4 *Q, int d)
+{
+    FP4_cmove(&(P->x), &(Q->x), d);
+    FP4_cmove(&(P->y), &(Q->y), d);
+    FP4_cmove(&(P->z), &(Q->z), d);
+}
+
+/* return 1 if b==c, no branching */
+static int teq(sign32 b, sign32 c)
+{
+    sign32 x = b ^ c;
+    x -= 1; // if x=0, x now -1
+    return (int)((x >> 31) & 1);
+}
+
+/* Constant time select from pre-computed table */
+static void ECP4_select(ZZZ::ECP4 *P, ZZZ::ECP4 W[], sign32 b)
+{
+    ZZZ::ECP4 MP;
+    sign32 m = b >> 31;
+    sign32 babs = (b ^ m) - m;
+
+    babs = (babs - 1) / 2;
+
+    ECP4_cmove(P, &W[0], teq(babs, 0)); // conditional move
+    ECP4_cmove(P, &W[1], teq(babs, 1));
+    ECP4_cmove(P, &W[2], teq(babs, 2));
+    ECP4_cmove(P, &W[3], teq(babs, 3));
+    ECP4_cmove(P, &W[4], teq(babs, 4));
+    ECP4_cmove(P, &W[5], teq(babs, 5));
+    ECP4_cmove(P, &W[6], teq(babs, 6));
+    ECP4_cmove(P, &W[7], teq(babs, 7));
+
+    ECP4_copy(&MP, P);
+    ECP4_neg(&MP);  // minus P
+    ECP4_cmove(P, &MP, (int)(m & 1));
+}
+
+/* Make P affine (so z=1) */
+void ZZZ::ECP4_affine(ECP4 *P)
+{
+    FP4 one, iz;
+    if (ECP4_isinf(P)) return;
+
+    FP4_one(&one);
+    if (FP4_isunity(&(P->z)))
+    {
+        FP4_reduce(&(P->x));
+        FP4_reduce(&(P->y));
+        return;
+    }
+
+    FP4_inv(&iz, &(P->z),NULL);
+    FP4_mul(&(P->x), &(P->x), &iz);
+    FP4_mul(&(P->y), &(P->y), &iz);
+
+    FP4_reduce(&(P->x));
+    FP4_reduce(&(P->y));
+    FP4_copy(&(P->z), &one);
+}
+
+/* return 1 if P==Q, else 0 */
+/* SU= 312 */
+int ZZZ::ECP4_equals(ECP4 *P, ECP4 *Q)
+{
+    FP4 a, b;
+
+    FP4_mul(&a, &(P->x), &(Q->z));
+    FP4_mul(&b, &(Q->x), &(P->z));
+    if (!FP4_equals(&a, &b)) return 0;
+
+    FP4_mul(&a, &(P->y), &(Q->z));
+    FP4_mul(&b, &(Q->y), &(P->z));
+    if (!FP4_equals(&a, &b)) return 0;
+    return 1;
+
+}
+
+/* extract x, y from point P */
+int ZZZ::ECP4_get(FP4 *x, FP4 *y, ECP4 *P)
+{
+    ECP4 W;
+    ECP4_copy(&W, P);
+    ECP4_affine(&W);
+    if (ECP4_isinf(&W)) return -1;
+    FP4_copy(y, &(W.y));
+    FP4_copy(x, &(W.x));
+    return 0;
+}
+
+/* Output point P */
+void ZZZ::ECP4_output(ECP4 *P)
+{
+    FP4 x, y;
+    if (ECP4_isinf(P))
+    {
+        printf("Infinity\n");
+        return;
+    }
+    ECP4_get(&x, &y, P);
+    printf("(");
+    FP4_output(&x);
+    printf(",");
+    FP4_output(&y);
+    printf(")\n");
+}
+
+/* Convert Q to octet string */
+void ZZZ::ECP4_toOctet(octet *W, ECP4 *Q,bool compress)
+{
+    FP4 qx, qy;
+    bool alt=false;
+    ECP4_get(&qx, &qy, Q);
+  
+#if (MBITS-1)%8 <= 4
+#ifdef ALLOW_ALT_COMPRESS_ZZZ
+    alt=true;
+#endif
+#endif
+
+    if (alt)
+    {
+        FP4_toBytes(&(W->val[0]),&qx);
+        if (!compress)
+        {
+            W->len=8*MODBYTES_XXX;
+            FP4_toBytes(&(W->val[4*MODBYTES_XXX]), &qy);
+        } else {
+            W->val[0]|=0x80;
+            if (FP4_islarger(&qy)==1) W->val[0]|=0x20;
+            W->len=4*MODBYTES_XXX;
+        }
+    } else {
+        FP4_toBytes(&(W->val[1]),&qx);
+        if (!compress)
+        {
+            W->val[0] = 0x04;
+            FP4_toBytes(&(W->val[4 * MODBYTES_XXX+1]), &qy);
+            W->len = 8 * MODBYTES_XXX+1;
+        } else {
+            W->val[0]=0x02;
+            if (FP4_sign(&qy)==1) W->val[0] = 0x03;
+            W->len = 4 * MODBYTES_XXX+1;
+        }
+    }
+}
+
+/* restore Q from octet string */
+int ZZZ::ECP4_fromOctet(ECP4 *Q, octet *W)
+{
+    FP4 qx, qy;
+    bool alt=false;
+    int sgn,cmp,typ = W->val[0];
+
+#if (MBITS-1)%8 <= 4
+#ifdef ALLOW_ALT_COMPRESS_ZZZ
+    alt=true;
+#endif
+#endif
+
+    if (alt)
+    {
+        W->val[0]&=0x1f;
+        FP4_fromBytes(&qx,&(W->val[0]));
+        W->val[0]=typ;
+        if ((typ&0x80)==0)
+        {
+            FP4_fromBytes(&qy,&(W->val[4*MODBYTES_XXX]));
+            if (ECP4_set(Q, &qx, &qy)) return 1;
+            return 0;
+        } else {
+            if (!ECP4_setx(Q,&qx,0)) return 0;
+            sgn=(typ&0x20)>>5;
+            cmp=FP4_islarger(&(Q->y));
+            if ((sgn==1 && cmp!=1) || (sgn==0 && cmp==1)) ECP4_neg(Q);
+            return 1;
+        }
+    } else {
+        FP4_fromBytes(&qx,&(W->val[1]));
+        if (typ == 0x04)
+        {
+            FP4_fromBytes(&qy,&(W->val[4 * MODBYTES_XXX+1]));
+            if (ECP4_set(Q, &qx, &qy)) return 1;
+        } else {
+            if (ECP4_setx(Q, &qx, typ&1)) return 1;
+        }
+    }
+    return 0;
+}
+
+/* Calculate RHS of twisted curve equation x^3+B/i or x^3+Bi*/
+void ZZZ::ECP4_rhs(FP4 *rhs, FP4 *x)
+{
+    /* calculate RHS of elliptic curve equation */
+    FP4 t;
+    FP2 t2;
+    BIG b;
+    FP4_sqr(&t, x);
+
+    FP4_mul(rhs, &t, x);
+
+    /* Assuming CURVE_A=0 */
+
+    BIG_rcopy(b, CURVE_B);
+
+    FP2_from_BIG(&t2, b);
+    FP4_from_FP2(&t, &t2);
+
+#if SEXTIC_TWIST_ZZZ == D_TYPE
+    FP4_div_i(&t);   /* IMPORTANT - here we use the correct SEXTIC twist of the curve */
+#endif
+
+#if SEXTIC_TWIST_ZZZ == M_TYPE
+    FP4_times_i(&t);   /* IMPORTANT - here we use the correct SEXTIC twist of the curve */
+#endif
+
+    FP4_add(rhs, &t, rhs);
+    FP4_reduce(rhs);
+}
+
+/* Set P=(x,y). Return 1 if (x,y) is on the curve, else return 0*/
+/* SU= 232 */
+int ZZZ::ECP4_set(ECP4 *P, FP4 *x, FP4 *y)
+{
+    FP4 rhs, y2;
+
+    FP4_sqr(&y2, y);
+    ECP4_rhs(&rhs, x);
+
+    if (!FP4_equals(&y2, &rhs))
+    {
+        ECP4_inf(P);
+        return 0;
+    }
+
+    FP4_copy(&(P->x), x);
+    FP4_copy(&(P->y), y);
+
+    FP4_one(&(P->z));
+    return 1;
+}
+
+/* Set P=(x,y). Return 1 if (x,.) is on the curve, else return 0 */
+/* SU= 232 */
+int ZZZ::ECP4_setx(ECP4 *P, FP4 *x, int s)
+{
+    FP4 y;
+    FP hint;
+    ECP4_rhs(&y, x);
+
+    if (!FP4_qr(&y,&hint))
+    {
+        ECP4_inf(P);
+        return 0;
+    }
+    FP4_sqrt(&y, &y, &hint);
+    
+    FP4_copy(&(P->x), x);
+    FP4_copy(&(P->y), &y);
+    FP4_one(&(P->z));
+
+    if (FP4_sign(&(P->y)) != s)
+        FP4_neg(&(P->y),&(P->y));
+    FP4_reduce(&(P->y));
+
+    return 1;
+}
+
+/* Set P=-P */
+/* SU= 8 */
+void ZZZ::ECP4_neg(ECP4 *P)
+{
+    FP4_norm(&(P->y));
+    FP4_neg(&(P->y), &(P->y));
+    FP4_norm(&(P->y));
+}
+
+/* R+=R */
+/* return -1 for Infinity, 0 for addition, 1 for doubling */
+int ZZZ::ECP4_dbl(ECP4 *P)
+{
+    FP4 t0, t1, t2, t3, iy, x3, y3;
+
+    FP4_copy(&iy, &(P->y));     //FP4 iy=new FP4(y);
+#if SEXTIC_TWIST_ZZZ==D_TYPE
+    FP4_times_i(&iy);           //iy.mul_ip();
+#endif
+
+    FP4_sqr(&t0, &(P->y));          //t0.sqr();
+#if SEXTIC_TWIST_ZZZ==D_TYPE
+    FP4_times_i(&t0);           //t0.mul_ip();
+#endif
+
+    FP4_mul(&t1, &iy, &(P->z)); //t1.mul(z);
+    FP4_sqr(&t2, &(P->z));              //t2.sqr();
+
+    FP4_add(&(P->z), &t0, &t0); //z.add(t0);
+    FP4_norm(&(P->z));              //z.norm();
+    FP4_add(&(P->z), &(P->z), &(P->z)); //z.add(z);
+    FP4_add(&(P->z), &(P->z), &(P->z)); //z.add(z);
+    FP4_norm(&(P->z));          //z.norm();
+
+    FP4_imul(&t2, &t2, 3 * CURVE_B_I); //t2.imul(3*ROM.CURVE_B_I);
+#if SEXTIC_TWIST_ZZZ==M_TYPE
+    FP4_times_i(&t2);
+#endif
+
+    FP4_mul(&x3, &t2, &(P->z)); //x3.mul(z);
+
+    FP4_add(&y3, &t0, &t2);     //y3.add(t2);
+    FP4_norm(&y3);              //y3.norm();
+    FP4_mul(&(P->z), &(P->z), &t1); //z.mul(t1);
+
+    FP4_add(&t1, &t2, &t2);     //t1.add(t2);
+    FP4_add(&t2, &t2, &t1);     //t2.add(t1);
+    FP4_norm(&t2);              //t2.norm();
+    FP4_sub(&t0, &t0, &t2);     //t0.sub(t2);
+    FP4_norm(&t0);              //t0.norm();                           //y^2-9bz^2
+    FP4_mul(&y3, &y3, &t0);     //y3.mul(t0);
+    FP4_add(&(P->y), &y3, &x3);     //y3.add(x3);                          //(y^2+3z*2)(y^2-9z^2)+3b.z^2.8y^2
+
+    FP4_mul(&t1, &(P->x), &iy);     //t1.mul(iy);                       //
+
+    FP4_norm(&t0);          //x.norm();
+    FP4_mul(&(P->x), &t0, &t1); //x.mul(t1);
+    FP4_add(&(P->x), &(P->x), &(P->x)); //x.add(x);       //(y^2-9bz^2)xy2
+
+    FP4_norm(&(P->x));          //x.norm();
+
+    FP4_norm(&(P->y));          //y.norm();
+
+    return 1;
+}
+
+/* Set P+=Q */
+
+int ZZZ::ECP4_add(ECP4 *P, ECP4 *Q)
+{
+    FP4 t0, t1, t2, t3, t4, x3, y3, z3;
+    int b3 = 3 * CURVE_B_I;
+
+    FP4_mul(&t0, &(P->x), &(Q->x)); //t0.mul(Q.x);         // x.Q.x
+    FP4_mul(&t1, &(P->y), &(Q->y)); //t1.mul(Q.y);       // y.Q.y
+
+    FP4_mul(&t2, &(P->z), &(Q->z)); //t2.mul(Q.z);
+    FP4_add(&t3, &(P->x), &(P->y)); //t3.add(y);
+    FP4_norm(&t3);              //t3.norm();          //t3=X1+Y1
+    FP4_add(&t4, &(Q->x), &(Q->y)); //t4.add(Q.y);
+    FP4_norm(&t4);              //t4.norm();            //t4=X2+Y2
+    FP4_mul(&t3, &t3, &t4);     //t3.mul(t4);                       //t3=(X1+Y1)(X2+Y2)
+    FP4_add(&t4, &t0, &t1);     //t4.add(t1);       //t4=X1.X2+Y1.Y2
+
+    FP4_sub(&t3, &t3, &t4);     //t3.sub(t4);
+    FP4_norm(&t3);              //t3.norm();
+#if SEXTIC_TWIST_ZZZ==D_TYPE
+    FP4_times_i(&t3);           //t3.mul_ip();
+#endif
+
+    FP4_add(&t4, &(P->y), &(P->z)); //t4.add(z);
+    FP4_norm(&t4);              //t4.norm();            //t4=Y1+Z1
+
+    FP4_add(&x3, &(Q->y), &(Q->z)); //x3.add(Q.z);
+    FP4_norm(&x3);              //x3.norm();            //x3=Y2+Z2
+
+    FP4_mul(&t4, &t4, &x3);     //t4.mul(x3);                       //t4=(Y1+Z1)(Y2+Z2)
+
+    FP4_add(&x3, &t1, &t2);     //x3.add(t2);                       //X3=Y1.Y2+Z1.Z2
+
+    FP4_sub(&t4, &t4, &x3);     //t4.sub(x3);
+    FP4_norm(&t4);              //t4.norm();
+#if SEXTIC_TWIST_ZZZ==D_TYPE
+    FP4_times_i(&t4);           //t4.mul_ip();
+#endif
+
+    FP4_add(&x3, &(P->x), &(P->z)); //x3.add(z);
+    FP4_norm(&x3);              //x3.norm();    // x3=X1+Z1
+
+    FP4_add(&y3, &(Q->x), &(Q->z)); //y3.add(Q.z);
+    FP4_norm(&y3);              //y3.norm();                // y3=X2+Z2
+    FP4_mul(&x3, &x3, &y3);     //x3.mul(y3);                           // x3=(X1+Z1)(X2+Z2)
+
+    FP4_add(&y3, &t0, &t2);     //y3.add(t2);                           // y3=X1.X2+Z1+Z2
+    FP4_sub(&y3, &x3, &y3);     //y3.rsub(x3);
+    FP4_norm(&y3);              //y3.norm();                // y3=(X1+Z1)(X2+Z2) - (X1.X2+Z1.Z2) = X1.Z2+X2.Z1
+#if SEXTIC_TWIST_ZZZ==D_TYPE
+    FP4_times_i(&t0);           //t0.mul_ip();
+    FP4_times_i(&t1);           //t1.mul_ip();
+#endif
+
+    FP4_add(&x3, &t0, &t0);     //x3.add(t0);
+    FP4_add(&t0, &t0, &x3);     //t0.add(x3);
+    FP4_norm(&t0);              //t0.norm();
+    FP4_imul(&t2, &t2, b3);     //t2.imul(b);
+#if SEXTIC_TWIST_ZZZ==M_TYPE
+    FP4_times_i(&t2);
+#endif
+
+    FP4_add(&z3, &t1, &t2);     //z3.add(t2);
+    FP4_norm(&z3);              //z3.norm();
+    FP4_sub(&t1, &t1, &t2);     //t1.sub(t2);
+    FP4_norm(&t1);              //t1.norm();
+    FP4_imul(&y3, &y3, b3);     //y3.imul(b);
+#if SEXTIC_TWIST_ZZZ==M_TYPE
+    FP4_times_i(&y3);
+#endif
+
+    FP4_mul(&x3, &y3, &t4);     //x3.mul(t4);
+
+    FP4_mul(&t2, &t3, &t1);     //t2.mul(t1);
+    FP4_sub(&(P->x), &t2, &x3);     //x3.rsub(t2);
+    FP4_mul(&y3, &y3, &t0);     //y3.mul(t0);
+    FP4_mul(&t1, &t1, &z3);     //t1.mul(z3);
+    FP4_add(&(P->y), &y3, &t1);     //y3.add(t1);
+    FP4_mul(&t0, &t0, &t3);     //t0.mul(t3);
+    FP4_mul(&z3, &z3, &t4);     //z3.mul(t4);
+    FP4_add(&(P->z), &z3, &t0);     //z3.add(t0);
+
+    FP4_norm(&(P->x));          //x.norm();
+    FP4_norm(&(P->y));          //y.norm();
+    FP4_norm(&(P->z));          //z.norm();
+
+    return 0;
+}
+
+/* Set P-=Q */
+/* SU= 16 */
+void ZZZ::ECP4_sub(ECP4 *P, ECP4 *Q)
+{
+    ECP4 NQ;
+    ECP4_copy(&NQ, Q);
+    ECP4_neg(&NQ);
+    ECP4_add(P, &NQ);
+}
+
+
+void ZZZ::ECP4_reduce(ECP4 *P)
+{
+    FP4_reduce(&(P->x));
+    FP4_reduce(&(P->y));
+    FP4_reduce(&(P->z));
+}
+
+/* P*=e */
+/* SU= 280 */
+void ZZZ::ECP4_mul(ECP4 *P, BIG e)
+{
+    /* fixed size windows */
+    int i, nb, s, ns;
+    BIG mt, t;
+    ECP4 Q, W[8], C;
+    sign8 w[1 + (NLEN_XXX * BASEBITS_XXX + 3) / 4];
+
+    if (ECP4_isinf(P)) return;
+
+    /* precompute table */
+
+    ECP4_copy(&Q, P);
+    ECP4_dbl(&Q);
+    ECP4_copy(&W[0], P);
+
+    for (i = 1; i < 8; i++)
+    {
+        ECP4_copy(&W[i], &W[i - 1]);
+        ECP4_add(&W[i], &Q);
+    }
+
+    /* make exponent odd - add 2P if even, P if odd */
+    BIG_copy(t, e);
+    s = BIG_parity(t);
+    BIG_inc(t, 1);
+    BIG_norm(t);
+    ns = BIG_parity(t);
+    BIG_copy(mt, t);
+    BIG_inc(mt, 1);
+    BIG_norm(mt);
+    BIG_cmove(t, mt, s);
+    ECP4_cmove(&Q, P, ns);
+    ECP4_copy(&C, &Q);
+
+    nb = 1 + (BIG_nbits(t) + 3) / 4;
+
+    /* convert exponent to signed 4-bit window */
+    for (i = 0; i < nb; i++)
+    {
+        w[i] = BIG_lastbits(t, 5) - 16;
+        BIG_dec(t, w[i]);
+        BIG_norm(t);
+        BIG_fshr(t, 4);
+    }
+    w[nb] = BIG_lastbits(t, 5);
+
+    //ECP4_copy(P, &W[(w[nb] - 1) / 2]);
+    ECP4_select(P, W, w[nb]);
+    for (i = nb - 1; i >= 0; i--)
+    {
+        ECP4_select(&Q, W, w[i]);
+        ECP4_dbl(P);
+        ECP4_dbl(P);
+        ECP4_dbl(P);
+        ECP4_dbl(P);
+        ECP4_add(P, &Q);
+    }
+    ECP4_sub(P, &C); /* apply correction */
+    ECP4_affine(P);
+}
+
+// calculate frobenius constants
+void ZZZ::ECP4_frob_constants(FP2 F[3])
+{
+    FP fx, fy;
+    FP2 X;
+
+    FP_rcopy(&fx, Fra);
+    FP_rcopy(&fy, Frb);
+    FP2_from_FPs(&X, &fx, &fy);
+
+    FP2_sqr(&F[0], &X);     // FF=F^2=(1+i)^(p-7)/6
+    FP2_copy(&F[2], &F[0]);
+    FP2_mul_ip(&F[2]);      // W=(1+i)^6/6.(1+i)^(p-7)/6 = (1+i)^(p-1)/6
+    FP2_norm(&F[2]);
+    FP2_sqr(&F[1], &F[2]);
+    FP2_mul(&F[2], &F[2], &F[1]); // W=(1+i)^(p-1)/2
+
+    FP2_copy(&F[1], &X);
+
+#if SEXTIC_TWIST_ZZZ == M_TYPE
+    FP2_mul_ip(&F[1]);      // (1+i)^12/12.(1+i)^(p-7)/12 = (1+i)^(p+5)/12
+    FP2_inv(&F[1], &F[1], NULL);      // (1+i)^-(p+5)/12
+    FP2_sqr(&F[0], &F[1]);      // (1+i)^-(p+5)/6
+#endif
+
+    FP2_mul_ip(&F[0]);      // FF=(1+i)^(p-7)/6.(1+i) = (1+i)^(p-1)/6                   // (1+i)^6/6.(1+i)^-(p+5)/6 = (1+i)^-(p-1)/6
+    FP2_norm(&F[0]);
+    FP2_mul(&F[1], &F[1], &F[0]); // FFF = (1+i)^(p-7)/12 . (1+i)^(p-1)/6 = (1+i)^(p-3)/4    // (1+i)^-(p+5)/12 . (1+i)^-(p-1)/6 = (1+i)^-(p+1)/4
+
+}
+
+/* Calculates q^n.P using Frobenius constants */
+void ZZZ::ECP4_frob(ECP4 *P, FP2 F[3], int n)
+{
+    int i;
+    FP4 X, Y, Z;
+
+    FP4_copy(&X, &(P->x));
+    FP4_copy(&Y, &(P->y));
+    FP4_copy(&Z, &(P->z));
+
+    for (i = 0; i < n; i++)
+    {
+        FP4_frob(&X, &F[2]);    // X^p
+        FP4_pmul(&X, &X, &F[0]); // X^p.(1+i)^(p-1)/6                                    // X^p.(1+i)^-(p-1)/6
+
+        FP4_frob(&Y, &F[2]);    // Y^p
+        FP4_pmul(&Y, &Y, &F[1]);
+        FP4_times_i(&Y);        // Y.p.(1+i)^(p-3)/4.(1+i)^(2/4) = Y^p.(1+i)^(p-1)/4    // (1+i)^-(p+1)/4 .(1+i)^2/4 = Y^p.(1+i)^-(p-1)/4
+
+        FP4_frob(&Z, &F[2]);
+    }
+
+    FP4_copy(&(P->x), &X);
+    FP4_copy(&(P->y), &Y);
+    FP4_copy(&(P->z), &Z);
+
+
+    //ECP4_set(P,&X,&Y);
+}
+
+/* Side channel attack secure */
+// Bos & Costello https://eprint.iacr.org/2013/458.pdf
+// Faz-Hernandez & Longa & Sanchez  https://eprint.iacr.org/2013/158.pdf
+
+void ZZZ::ECP4_mul8(ECP4 *P, ECP4 Q[8], BIG u[8])
+{
+    int i, j, k, nb, pb1, pb2, bt;
+    ECP4 T1[8], T2[8], W;
+    BIG mt, t[8];
+    sign8 w1[NLEN_XXX * BASEBITS_XXX + 1];
+    sign8 s1[NLEN_XXX * BASEBITS_XXX + 1];
+    sign8 w2[NLEN_XXX * BASEBITS_XXX + 1];
+    sign8 s2[NLEN_XXX * BASEBITS_XXX + 1];
+//  FP2 X[3];
+    /*
+        ECP4_frob_constants(X);
+    */
+    for (i = 0; i < 8; i++)
+    {
+        BIG_copy(t[i], u[i]);
+    }
+// Precomputed tables
+    ECP4_copy(&T1[0], &Q[0]); // Q[0]
+    ECP4_copy(&T1[1], &T1[0]);
+    ECP4_add(&T1[1], &Q[1]); // Q[0]+Q[1]
+    ECP4_copy(&T1[2], &T1[0]);
+    ECP4_add(&T1[2], &Q[2]); // Q[0]+Q[2]
+    ECP4_copy(&T1[3], &T1[1]);
+    ECP4_add(&T1[3], &Q[2]); // Q[0]+Q[1]+Q[2]
+    ECP4_copy(&T1[4], &T1[0]);
+    ECP4_add(&T1[4], &Q[3]); // Q[0]+Q[3]
+    ECP4_copy(&T1[5], &T1[1]);
+    ECP4_add(&T1[5], &Q[3]); // Q[0]+Q[1]+Q[3]
+    ECP4_copy(&T1[6], &T1[2]);
+    ECP4_add(&T1[6], &Q[3]); // Q[0]+Q[2]+Q[3]
+    ECP4_copy(&T1[7], &T1[3]);
+    ECP4_add(&T1[7], &Q[3]); // Q[0]+Q[1]+Q[2]+Q[3]
+
+    ECP4_copy(&T2[0], &Q[4]); // Q[0]
+    ECP4_copy(&T2[1], &T2[0]);
+    ECP4_add(&T2[1], &Q[5]); // Q[0]+Q[1]
+    ECP4_copy(&T2[2], &T2[0]);
+    ECP4_add(&T2[2], &Q[6]); // Q[0]+Q[2]
+    ECP4_copy(&T2[3], &T2[1]);
+    ECP4_add(&T2[3], &Q[6]); // Q[0]+Q[1]+Q[2]
+    ECP4_copy(&T2[4], &T2[0]);
+    ECP4_add(&T2[4], &Q[7]); // Q[0]+Q[3]
+    ECP4_copy(&T2[5], &T2[1]);
+    ECP4_add(&T2[5], &Q[7]); // Q[0]+Q[1]+Q[3]
+    ECP4_copy(&T2[6], &T2[2]);
+    ECP4_add(&T2[6], &Q[7]); // Q[0]+Q[2]+Q[3]
+    ECP4_copy(&T2[7], &T2[3]);
+    ECP4_add(&T2[7], &Q[7]); // Q[0]+Q[1]+Q[2]+Q[3]
+
+//  Use Frobenius
+    /*
+        for (i=0;i<8;i++)
+        {
+            ECP4_copy(&T2[i],&T1[i]);
+            ECP4_frob(&T2[i],X,4);
+        }
+    */
+// Make them odd
+    pb1 = 1 - BIG_parity(t[0]);
+    BIG_inc(t[0], pb1);
+    BIG_norm(t[0]);
+
+    pb2 = 1 - BIG_parity(t[4]);
+    BIG_inc(t[4], pb2);
+    BIG_norm(t[4]);
+
+// Number of bits
+    BIG_zero(mt);
+    for (i = 0; i < 8; i++)
+    {
+        BIG_or(mt, mt, t[i]);
+    }
+    nb = 1 + BIG_nbits(mt);
+
+// Sign pivot
+    s1[nb - 1] = 1;
+    s2[nb - 1] = 1;
+    for (i = 0; i < nb - 1; i++)
+    {
+        BIG_fshr(t[0], 1);
+        s1[i] = 2 * BIG_parity(t[0]) - 1;
+        BIG_fshr(t[4], 1);
+        s2[i] = 2 * BIG_parity(t[4]) - 1;
+    }
+
+
+// Recoded exponents
+    for (i = 0; i < nb; i++)
+    {
+        w1[i] = 0;
+        k = 1;
+        for (j = 1; j < 4; j++)
+        {
+            bt = s1[i] * BIG_parity(t[j]);
+            BIG_fshr(t[j], 1);
+
+            BIG_dec(t[j], (bt >> 1));
+            BIG_norm(t[j]);
+            w1[i] += bt * k;
+            k *= 2;
+        }
+
+        w2[i] = 0;
+        k = 1;
+        for (j = 5; j < 8; j++)
+        {
+            bt = s2[i] * BIG_parity(t[j]);
+            BIG_fshr(t[j], 1);
+
+            BIG_dec(t[j], (bt >> 1));
+            BIG_norm(t[j]);
+            w2[i] += bt * k;
+            k *= 2;
+        }
+    }
+
+// Main loop
+    ECP4_select(P, T1, 2 * w1[nb - 1] + 1);
+    ECP4_select(&W, T2, 2 * w2[nb - 1] + 1);
+    ECP4_add(P, &W);
+    for (i = nb - 2; i >= 0; i--)
+    {
+        ECP4_dbl(P);
+        ECP4_select(&W, T1, 2 * w1[i] + s1[i]);
+        ECP4_add(P, &W);
+        ECP4_select(&W, T2, 2 * w2[i] + s2[i]);
+        ECP4_add(P, &W);
+    }
+
+// apply corrections
+    ECP4_copy(&W, P);
+    ECP4_sub(&W, &Q[0]);
+    ECP4_cmove(P, &W, pb1);
+    ECP4_copy(&W, P);
+    ECP4_sub(&W, &Q[4]);
+    ECP4_cmove(P, &W, pb2);
+
+    ECP4_affine(P);
+}
+
+/* Hunt and Peck a BIG to G2 curve point */
+/*
+void ZZZ::ECP4_hap2point(ECP4 *Q,BIG h)
+{
+    BIG one,hv;
+    FP2 X2;
+    FP4 X4;
+    BIG_one(one);
+    BIG_copy(hv,h);
+
+    for (;;)
+    {
+        FP2_from_BIGs(&X2,one,hv); 
+		FP4_from_FP2(&X4,&X2);
+        if (ECP4_setx(Q,&X4,0)) break;
+        BIG_inc(hv,1);
+        BIG_norm(hv);
+    }
+}
+*/
+/* Constant time Map BIG to Point in G2 */
+void ZZZ::ECP4_map2point(ECP4 *Q,FP4 *H)
+{
+    int sgn,ne;
+    FP4 X1,X2,X3,W,Y,T,A,NY;
+    FP Z,s;
+
+    FP4_one(&NY);
+    FP4_copy(&T,H);
+    sgn=FP4_sign(&T);
+     
+    FP_from_int(&Z,RIADZG2A_YYY);
+    FP4_from_FP(&A,&Z);
+    ECP4_rhs(&A,&A);  // A=g(Z)
+
+    FP4_sqrt(&W,&A,NULL);
+    FP_rcopy(&s,SQRTm3);
+
+    FP_mul(&Z,&Z,&s);
+
+    FP4_sqr(&T,&T);   
+    FP4_mul(&Y,&A,&T);   // tv1=u^2*g(Z)
+    FP4_add(&T,&NY,&Y); FP4_norm(&T); // tv2=1+tv1
+    FP4_sub(&Y,&NY,&Y); FP4_norm(&Y); // tv1=1-tv1 
+    FP4_mul(&NY,&T,&Y);
+
+    FP4_qmul(&NY,&NY,&Z);
+
+    FP4_inv(&NY,&NY,NULL);     // tv3=inv0(tv1*tv2*Z*sqrt(-3))
+    FP4_qmul(&W,&W,&Z); // tv4=Z*sqrt(-3).sqrt(g(Z))
+    if (FP4_sign(&W)==1)
+    {
+        FP4_neg(&W,&W);
+        FP4_norm(&W);
+    }
+    FP4_qmul(&W,&W,&Z);
+    FP4_mul(&W,&W,H);
+    FP4_mul(&W,&W,&Y);
+    FP4_mul(&W,&W,&NY);     // tv5=u*tv1*tv3*tv4*Z*sqrt(-3)
+   
+    FP_from_int(&s,RIADZG2A_YYY);
+    FP4_from_FP(&X1,&s);
+
+    FP4_copy(&X3,&X1);
+    FP4_neg(&X1,&X1); FP4_norm(&X1); FP4_div2(&X1,&X1); // -Z/2
+    FP4_copy(&X2,&X1);
+    FP4_sub(&X1,&X1,&W); FP4_norm(&X1);
+    FP4_add(&X2,&X2,&W); FP4_norm(&X2);
+    FP4_add(&A,&A,&A);
+    FP4_add(&A,&A,&A); 
+    FP4_norm(&A);      // 4*g(Z)
+    FP4_sqr(&T,&T);
+    FP4_mul(&T,&T,&NY);
+    FP4_sqr(&T,&T);    // (tv2^2*tv3)^2
+    FP4_mul(&A,&A,&T); // -4*g(Z)*(tv2^2*tv3)^2
+
+    FP4_add(&X3,&X3,&A); FP4_norm(&X3);
+
+    ECP4_rhs(&W,&X2);
+    FP4_cmove(&X3,&X2,FP4_qr(&W,NULL));
+    ECP4_rhs(&W,&X1);
+    FP4_cmove(&X3,&X1,FP4_qr(&W,NULL));
+    ECP4_rhs(&W,&X3);
+    FP4_sqrt(&Y,&W,NULL);
+    
+    ne=FP4_sign(&Y)^sgn;
+    FP4_neg(&W,&Y); FP4_norm(&W);
+    FP4_cmove(&Y,&W,ne);
+ 
+    ECP4_set(Q,&X3,&Y);
+}
+
+/* Map octet to point on G2 */
+/*
+void ZZZ::ECP4_mapit(ECP4 *Q, octet *W)
+{
+    BIG q, x;
+    DBIG dx;
+    BIG_rcopy(q, Modulus);
+
+    BIG_dfromBytesLen(dx,W->val,W->len);
+    BIG_dmod(x,dx,q);
+
+    ECP4_hap2point(Q,x);   
+    ECP4_cfp(Q);
+}
+*/
+/* cofactor product */
+void ZZZ::ECP4_cfp(ECP4 *Q)
+{
+    FP2 X[3];
+    ECP4 xQ, x2Q, x3Q, x4Q;
+    BIG x;
+
+    ECP4_frob_constants(X);
+
+    BIG_rcopy(x, CURVE_Bnx);
+
+    // Efficient hash maps to G2 on BLS24 curves - Budroni, Pintore
+    // Q -> x4Q -x3Q -Q + F(x3Q-x2Q) + F(F(x2Q-xQ)) + F(F(F(xQ-Q))) +F(F(F(F(2Q))))
+
+    ECP4_copy(&xQ, Q);
+    ECP4_mul(&xQ, x);
+    ECP4_copy(&x2Q, &xQ);
+    ECP4_mul(&x2Q, x);
+    ECP4_copy(&x3Q, &x2Q);
+    ECP4_mul(&x3Q, x);
+    ECP4_copy(&x4Q, &x3Q);
+    ECP4_mul(&x4Q, x);
+
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    ECP4_neg(&xQ);
+    ECP4_neg(&x3Q);
+#endif
+
+    ECP4_sub(&x4Q, &x3Q);
+    ECP4_sub(&x4Q, Q);
+
+    ECP4_sub(&x3Q, &x2Q);
+    ECP4_frob(&x3Q, X, 1);
+
+    ECP4_sub(&x2Q, &xQ);
+    ECP4_frob(&x2Q, X, 2);
+
+    ECP4_sub(&xQ, Q);
+    ECP4_frob(&xQ, X, 3);
+
+    ECP4_dbl(Q);
+    ECP4_frob(Q, X, 4);
+
+    ECP4_add(Q, &x4Q);
+    ECP4_add(Q, &x3Q);
+    ECP4_add(Q, &x2Q);
+    ECP4_add(Q, &xQ);
+
+    ECP4_affine(Q);
+
+}
+
+// ECP$ Get Group Generator
+
+int ZZZ::ECP4_generator(ECP4 *G)
+{
+    BIG a, b;
+    FP2 Aa, Bb;
+    FP4 X, Y;
+
+    BIG_rcopy(a, CURVE_Pxaa);
+    BIG_rcopy(b, CURVE_Pxab);
+    FP2_from_BIGs(&Aa, a, b);
+
+    BIG_rcopy(a, CURVE_Pxba);
+    BIG_rcopy(b, CURVE_Pxbb);
+    FP2_from_BIGs(&Bb, a, b);
+
+    FP4_from_FP2s(&X, &Aa, &Bb);
+
+    BIG_rcopy(a, CURVE_Pyaa);
+    BIG_rcopy(b, CURVE_Pyab);
+    FP2_from_BIGs(&Aa, a, b);
+
+    BIG_rcopy(a, CURVE_Pyba);
+    BIG_rcopy(b, CURVE_Pybb);
+    FP2_from_BIGs(&Bb, a, b);
+
+    FP4_from_FP2s(&Y, &Aa, &Bb);
+
+    return ECP4_set(G, &X, &Y);
+}
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp4.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp4.h
new file mode 100644
index 0000000..27b6475
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp4.h
@@ -0,0 +1,268 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP4_ZZZ_H
+#define ECP4_ZZZ_H
+
+#include "fp4_YYY.h"
+#include "config_curve_ZZZ.h"
+
+using namespace core;
+
+namespace YYY {
+
+extern const XXX::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const XXX::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+}
+
+namespace ZZZ {
+
+/**
+	@brief ECP4 Structure - Elliptic Curve Point over quadratic extension field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag */
+    YYY::FP4 x;   /**< x-coordinate of point */
+    YYY::FP4 y;   /**< y-coordinate of point */
+    YYY::FP4 z;   /**< z-coordinate of point */
+} ECP4;
+
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;		/**< Elliptic curve B parameter */
+extern const XXX::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const XXX::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const XXX::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const XXX::BIG CURVE_Bnx;   /**< Elliptic curve parameter */
+extern const XXX::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+
+/* Generator point on G1 */
+extern const XXX::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const XXX::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const XXX::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/* ECP4 E(FP4) prototypes */
+/**	@brief Tests for ECP4 point equal to infinity
+ *
+	@param P ECP4 point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP4_isinf(ECP4 *P);
+/**	@brief Copy ECP4 point to another ECP4 point
+ *
+	@param P ECP4 instance, on exit = Q
+	@param Q ECP4 instance to be copied
+ */
+extern void ECP4_copy(ECP4 *P, ECP4 *Q);
+/**	@brief Set ECP4 to point-at-infinity
+ *
+	@param P ECP4 instance to be set to infinity
+ */
+extern void ECP4_inf(ECP4 *P);
+/**	@brief Tests for equality of two ECP4s
+ *
+	@param P ECP4 instance to be compared
+	@param Q ECP4 instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP4_equals(ECP4 *P, ECP4 *Q);
+
+/**	@brief Converts an ECP4 point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP4 instance to be converted to affine form
+ */
+extern void ECP4_affine(ECP4 *P);
+
+
+/**	@brief Extract x and y coordinates of an ECP4 point P
+ *
+	If x=y, returns only x
+	@param x FP4 on exit = x coordinate of point
+	@param y FP4 on exit = y coordinate of point (unless x=y)
+	@param P ECP4 instance (x,y)
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP4_get(YYY::FP4 *x, YYY::FP4 *y, ECP4 *P);
+/**	@brief Formats and outputs an ECP4 point to the console, converted to affine coordinates
+ *
+	@param P ECP4 instance to be printed
+ */
+extern void ECP4_output(ECP4 *P);
+
+/**	@brief Formats and outputs an ECP4 point to an octet string
+ *
+	The octet string is created in the form x|y or just x if compressed
+	Convert the real and imaginary parts of the x and y coordinates to big-endian base 256 form.
+	@param S output octet string
+	@param P ECP4 instance to be converted to an octet string
+    @param c true for compression
+ */
+extern void ECP4_toOctet(octet *S, ECP4 *P, bool c);
+/**	@brief Creates an ECP4 point from an octet string
+ *
+	The octet string is in the form x|y
+	The real and imaginary parts of the x and y coordinates are in big-endian base 256 form.
+	@param P ECP4 instance to be created from the octet string
+	@param S input octet string
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP4_fromOctet(ECP4 *P, octet *S);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x)=x^3+Ax+B
+	Used internally.
+	@param r FP4 value of f(x)
+	@param x FP4 instance
+ */
+extern void ECP4_rhs(YYY::FP4 *r, YYY::FP4 *x);
+/**	@brief Set ECP4 to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP4 instance to be set (x,y)
+	@param x FP4 x coordinate of point
+	@param y FP4 y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP4_set(ECP4 *P, YYY::FP4 *x, YYY::FP4 *y);
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Otherwise y coordinate is calculated from x.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+    @param s sign of y
+	@return 1 if point exists, else 0
+ */
+extern int ECP4_setx(ECP4 *P, YYY::FP4 *x, int s);
+/**	@brief Negation of an ECP4 point
+ *
+	@param P ECP4 instance, on exit = -P
+ */
+extern void ECP4_neg(ECP4 *P);
+
+/**	@brief Reduction of an ECP4 point
+ *
+	@param P ECP4 instance, on exit (x,y) are reduced wrt the modulus
+ */
+extern void ECP4_reduce(ECP4 *P);
+
+
+/**	@brief Doubles an ECP4 instance P
+ *
+	@param P ECP4 instance, on exit =2*P
+ */
+extern int ECP4_dbl(ECP4 *P);
+/**	@brief Adds ECP4 instance Q to ECP4 instance P
+ *
+	@param P ECP4 instance, on exit =P+Q
+	@param Q ECP4 instance to be added to P
+ */
+extern int ECP4_add(ECP4 *P, ECP4 *Q);
+/**	@brief Subtracts ECP instance Q from ECP4 instance P
+ *
+	@param P ECP4 instance, on exit =P-Q
+	@param Q ECP4 instance to be subtracted from P
+ */
+extern void ECP4_sub(ECP4 *P, ECP4 *Q);
+/**	@brief Multiplies an ECP4 instance P by a BIG, side-channel resistant
+ *
+	Uses fixed sized windows.
+	@param P ECP4 instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP4_mul(ECP4 *P, XXX::BIG b);
+
+/**	@brief Calculates required Frobenius constants
+ *
+	Calculate Frobenius constants
+	@param F array of FP2 precalculated constants
+
+ */
+extern void ECP4_frob_constants(YYY::FP2 F[3]);
+
+/**	@brief Multiplies an ECP4 instance P by the internal modulus p^n, using precalculated Frobenius constants
+ *
+	Fast point multiplication using Frobenius
+	@param P ECP4 instance, on exit = p^n*P
+	@param F array of FP2 precalculated Frobenius constant
+	@param n power of prime
+
+ */
+extern void ECP4_frob(ECP4 *P, YYY::FP2 F[3], int n);
+
+/**	@brief Calculates P=Sigma b[i]*Q[i] for i=0 to 7
+ *
+	@param P ECP4 instance, on exit = Sigma b[i]*Q[i] for i=0 to 7
+	@param Q ECP4 array of 4 points
+	@param b BIG array of 4 multipliers
+ */
+extern void ECP4_mul8(ECP4 *P, ECP4 *Q, XXX::BIG *b);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP4 multiplied by co-factor
+ */
+extern void ECP4_cfp(ECP4 *Q);
+
+/**	@brief Maps random FP4 to curve point in constant time
+ *
+	@param Q ECP4 instance 
+	@param x FP4 derived from hash
+ */
+extern void ECP4_map2point(ECP4 *Q, YYY::FP4 *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP4 instance 
+	@param x Fp derived from hash
+ */
+extern void ECP4_hap2point(ECP4 *Q, XXX::BIG  x);
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param P ECP4 instance of correct order
+	@param W OCTET byte array to be mapped
+ */
+extern void ECP4_mapit(ECP4 *P, octet *W);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP4 instance
+	@return 1 if point exists, else 0
+ */
+extern int ECP4_generator(ECP4 *G);
+
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp4_BLS24479.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp4_BLS24479.h
new file mode 100644
index 0000000..f962546
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp4_BLS24479.h
@@ -0,0 +1,268 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP4_BLS24479_H
+#define ECP4_BLS24479_H
+
+#include "fp4_BLS24479.h"
+#include "config_curve_BLS24479.h"
+
+using namespace core;
+
+namespace BLS24479 {
+
+extern const B480_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B480_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+}
+
+namespace BLS24479 {
+
+/**
+	@brief ECP4 Structure - Elliptic Curve Point over quadratic extension field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag */
+    BLS24479::FP4 x;   /**< x-coordinate of point */
+    BLS24479::FP4 y;   /**< y-coordinate of point */
+    BLS24479::FP4 z;   /**< z-coordinate of point */
+} ECP4;
+
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;		/**< Elliptic curve B parameter */
+extern const B480_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B480_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B480_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B480_56::BIG CURVE_Bnx;   /**< Elliptic curve parameter */
+extern const B480_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+
+/* Generator point on G1 */
+extern const B480_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B480_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B480_56::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/* ECP4 E(FP4) prototypes */
+/**	@brief Tests for ECP4 point equal to infinity
+ *
+	@param P ECP4 point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP4_isinf(ECP4 *P);
+/**	@brief Copy ECP4 point to another ECP4 point
+ *
+	@param P ECP4 instance, on exit = Q
+	@param Q ECP4 instance to be copied
+ */
+extern void ECP4_copy(ECP4 *P, ECP4 *Q);
+/**	@brief Set ECP4 to point-at-infinity
+ *
+	@param P ECP4 instance to be set to infinity
+ */
+extern void ECP4_inf(ECP4 *P);
+/**	@brief Tests for equality of two ECP4s
+ *
+	@param P ECP4 instance to be compared
+	@param Q ECP4 instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP4_equals(ECP4 *P, ECP4 *Q);
+
+/**	@brief Converts an ECP4 point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP4 instance to be converted to affine form
+ */
+extern void ECP4_affine(ECP4 *P);
+
+
+/**	@brief Extract x and y coordinates of an ECP4 point P
+ *
+	If x=y, returns only x
+	@param x FP4 on exit = x coordinate of point
+	@param y FP4 on exit = y coordinate of point (unless x=y)
+	@param P ECP4 instance (x,y)
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP4_get(BLS24479::FP4 *x, BLS24479::FP4 *y, ECP4 *P);
+/**	@brief Formats and outputs an ECP4 point to the console, converted to affine coordinates
+ *
+	@param P ECP4 instance to be printed
+ */
+extern void ECP4_output(ECP4 *P);
+
+/**	@brief Formats and outputs an ECP4 point to an octet string
+ *
+	The octet string is created in the form x|y or just x if compressed
+	Convert the real and imaginary parts of the x and y coordinates to big-endian base 256 form.
+	@param S output octet string
+	@param P ECP4 instance to be converted to an octet string
+    @param c true for compression
+ */
+extern void ECP4_toOctet(octet *S, ECP4 *P, bool c);
+/**	@brief Creates an ECP4 point from an octet string
+ *
+	The octet string is in the form x|y
+	The real and imaginary parts of the x and y coordinates are in big-endian base 256 form.
+	@param P ECP4 instance to be created from the octet string
+	@param S input octet string
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP4_fromOctet(ECP4 *P, octet *S);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x)=x^3+Ax+B
+	Used internally.
+	@param r FP4 value of f(x)
+	@param x FP4 instance
+ */
+extern void ECP4_rhs(BLS24479::FP4 *r, BLS24479::FP4 *x);
+/**	@brief Set ECP4 to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP4 instance to be set (x,y)
+	@param x FP4 x coordinate of point
+	@param y FP4 y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP4_set(ECP4 *P, BLS24479::FP4 *x, BLS24479::FP4 *y);
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Otherwise y coordinate is calculated from x.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+    @param s sign of y
+	@return 1 if point exists, else 0
+ */
+extern int ECP4_setx(ECP4 *P, BLS24479::FP4 *x, int s);
+/**	@brief Negation of an ECP4 point
+ *
+	@param P ECP4 instance, on exit = -P
+ */
+extern void ECP4_neg(ECP4 *P);
+
+/**	@brief Reduction of an ECP4 point
+ *
+	@param P ECP4 instance, on exit (x,y) are reduced wrt the modulus
+ */
+extern void ECP4_reduce(ECP4 *P);
+
+
+/**	@brief Doubles an ECP4 instance P
+ *
+	@param P ECP4 instance, on exit =2*P
+ */
+extern int ECP4_dbl(ECP4 *P);
+/**	@brief Adds ECP4 instance Q to ECP4 instance P
+ *
+	@param P ECP4 instance, on exit =P+Q
+	@param Q ECP4 instance to be added to P
+ */
+extern int ECP4_add(ECP4 *P, ECP4 *Q);
+/**	@brief Subtracts ECP instance Q from ECP4 instance P
+ *
+	@param P ECP4 instance, on exit =P-Q
+	@param Q ECP4 instance to be subtracted from P
+ */
+extern void ECP4_sub(ECP4 *P, ECP4 *Q);
+/**	@brief Multiplies an ECP4 instance P by a BIG, side-channel resistant
+ *
+	Uses fixed sized windows.
+	@param P ECP4 instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP4_mul(ECP4 *P, B480_56::BIG b);
+
+/**	@brief Calculates required Frobenius constants
+ *
+	Calculate Frobenius constants
+	@param F array of FP2 precalculated constants
+
+ */
+extern void ECP4_frob_constants(BLS24479::FP2 F[3]);
+
+/**	@brief Multiplies an ECP4 instance P by the internal modulus p^n, using precalculated Frobenius constants
+ *
+	Fast point multiplication using Frobenius
+	@param P ECP4 instance, on exit = p^n*P
+	@param F array of FP2 precalculated Frobenius constant
+	@param n power of prime
+
+ */
+extern void ECP4_frob(ECP4 *P, BLS24479::FP2 F[3], int n);
+
+/**	@brief Calculates P=Sigma b[i]*Q[i] for i=0 to 7
+ *
+	@param P ECP4 instance, on exit = Sigma b[i]*Q[i] for i=0 to 7
+	@param Q ECP4 array of 4 points
+	@param b BIG array of 4 multipliers
+ */
+extern void ECP4_mul8(ECP4 *P, ECP4 *Q, B480_56::BIG *b);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP4 multiplied by co-factor
+ */
+extern void ECP4_cfp(ECP4 *Q);
+
+/**	@brief Maps random FP4 to curve point in constant time
+ *
+	@param Q ECP4 instance 
+	@param x FP4 derived from hash
+ */
+extern void ECP4_map2point(ECP4 *Q, BLS24479::FP4 *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP4 instance 
+	@param x Fp derived from hash
+ */
+extern void ECP4_hap2point(ECP4 *Q, B480_56::BIG  x);
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param P ECP4 instance of correct order
+	@param W OCTET byte array to be mapped
+ */
+extern void ECP4_mapit(ECP4 *P, octet *W);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP4 instance
+	@return 1 if point exists, else 0
+ */
+extern int ECP4_generator(ECP4 *G);
+
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp8.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp8.cpp
new file mode 100644
index 0000000..17de76a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp8.cpp
@@ -0,0 +1,1118 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* CORE Weierstrass elliptic curve functions over FP2 */
+
+//#include <iostream>
+#include "ecp8_ZZZ.h"
+
+using namespace std;
+using namespace XXX;
+using namespace YYY;
+
+int ZZZ::ECP8_isinf(ECP8 *P)
+{
+    return (FP8_iszilch(&(P->x)) & FP8_iszilch(&(P->z)));
+}
+
+/* Set P=Q */
+void ZZZ::ECP8_copy(ECP8 *P, ECP8 *Q)
+{
+    FP8_copy(&(P->x), &(Q->x));
+    FP8_copy(&(P->y), &(Q->y));
+    FP8_copy(&(P->z), &(Q->z));
+}
+
+/* set P to Infinity */
+void ZZZ::ECP8_inf(ECP8 *P)
+{
+    FP8_zero(&(P->x));
+    FP8_one(&(P->y));
+    FP8_zero(&(P->z));
+}
+
+/* Conditional move Q to P dependant on d */
+static void ECP8_cmove(ZZZ::ECP8 *P, ZZZ::ECP8 *Q, int d)
+{
+    FP8_cmove(&(P->x), &(Q->x), d);
+    FP8_cmove(&(P->y), &(Q->y), d);
+    FP8_cmove(&(P->z), &(Q->z), d);
+}
+
+/* return 1 if b==c, no branching */
+static int teq(sign32 b, sign32 c)
+{
+    sign32 x = b ^ c;
+    x -= 1; // if x=0, x now -1
+    return (int)((x >> 31) & 1);
+}
+
+/* Constant time select from pre-computed table */
+static void ECP8_select(ZZZ::ECP8 *P, ZZZ::ECP8 W[], sign32 b)
+{
+    ZZZ::ECP8 MP;
+    sign32 m = b >> 31;
+    sign32 babs = (b ^ m) - m;
+
+    babs = (babs - 1) / 2;
+
+    ECP8_cmove(P, &W[0], teq(babs, 0)); // conditional move
+    ECP8_cmove(P, &W[1], teq(babs, 1));
+    ECP8_cmove(P, &W[2], teq(babs, 2));
+    ECP8_cmove(P, &W[3], teq(babs, 3));
+    ECP8_cmove(P, &W[4], teq(babs, 4));
+    ECP8_cmove(P, &W[5], teq(babs, 5));
+    ECP8_cmove(P, &W[6], teq(babs, 6));
+    ECP8_cmove(P, &W[7], teq(babs, 7));
+
+    ECP8_copy(&MP, P);
+    ECP8_neg(&MP);  // minus P
+    ECP8_cmove(P, &MP, (int)(m & 1));
+}
+
+/* Make P affine (so z=1) */
+void ZZZ::ECP8_affine(ECP8 *P)
+{
+    FP8 one, iz;
+    if (ECP8_isinf(P)) return;
+
+    FP8_one(&one);
+    if (FP8_isunity(&(P->z)))
+    {
+        FP8_reduce(&(P->x));
+        FP8_reduce(&(P->y));
+        return;
+    }
+
+    FP8_inv(&iz, &(P->z),NULL);
+    FP8_mul(&(P->x), &(P->x), &iz);
+    FP8_mul(&(P->y), &(P->y), &iz);
+
+    FP8_reduce(&(P->x));
+    FP8_reduce(&(P->y));
+    FP8_copy(&(P->z), &one);
+}
+
+/* return 1 if P==Q, else 0 */
+/* SU= 312 */
+int ZZZ::ECP8_equals(ECP8 *P, ECP8 *Q)
+{
+    FP8 a, b;
+
+    FP8_mul(&a, &(P->x), &(Q->z));
+    FP8_mul(&b, &(Q->x), &(P->z));
+    if (!FP8_equals(&a, &b)) return 0;
+
+    FP8_mul(&a, &(P->y), &(Q->z));
+    FP8_mul(&b, &(Q->y), &(P->z));
+    if (!FP8_equals(&a, &b)) return 0;
+    return 1;
+}
+
+/* extract x, y from point P */
+int ZZZ::ECP8_get(FP8 *x, FP8 *y, ECP8 *P)
+{
+    ECP8 W;
+    ECP8_copy(&W, P);
+    ECP8_affine(&W);
+    if (ECP8_isinf(&W)) return -1;
+    FP8_copy(y, &(W.y));
+    FP8_copy(x, &(W.x));
+    return 0;
+}
+
+/* Output point P */
+void ZZZ::ECP8_output(ECP8 *P)
+{
+    FP8 x, y;
+    if (ECP8_isinf(P))
+    {
+        printf("Infinity\n");
+        return;
+    }
+    ECP8_get(&x, &y, P);
+    printf("(");
+    FP8_output(&x);
+    printf(",");
+    FP8_output(&y);
+    printf(")\n");
+}
+
+/* Convert Q to octet string */
+void ZZZ::ECP8_toOctet(octet *W, ECP8 *Q,bool compress)
+{
+    FP8 qx, qy;
+    bool alt=false;
+    ECP8_get(&qx, &qy, Q);
+  
+#if (MBITS-1)%8 <= 4
+#ifdef ALLOW_ALT_COMPRESS_ZZZ
+    alt=true;
+#endif
+#endif
+
+    if (alt)
+    {
+        FP8_toBytes(&(W->val[0]),&qx);
+        if (!compress)
+        {
+            W->len=16*MODBYTES_XXX;
+            FP8_toBytes(&(W->val[8*MODBYTES_XXX]), &qy);
+        } else {
+            W->val[0]|=0x80;
+            if (FP8_islarger(&qy)==1) W->val[0]|=0x20;
+            W->len=8*MODBYTES_XXX;
+        }
+    } else {
+        FP8_toBytes(&(W->val[1]),&qx);
+        if (!compress)
+        {
+            W->val[0] = 0x04;
+
+            FP8_toBytes(&(W->val[8 * MODBYTES_XXX+1]), &qy);
+            W->len = 16 * MODBYTES_XXX+1;
+        } else {
+            W->val[0]=0x02;
+            if (FP8_sign(&qy)==1) W->val[0] = 0x03;
+            W->len = 8 * MODBYTES_XXX+1;
+        }
+    }
+}
+
+/* restore Q from octet string */
+int ZZZ::ECP8_fromOctet(ECP8 *Q, octet *W)
+{
+    FP8 qx, qy;
+    bool alt=false;
+    int sgn,cmp,typ = W->val[0];
+
+#if (MBITS-1)%8 <= 4
+#ifdef ALLOW_ALT_COMPRESS_ZZZ
+    alt=true;
+#endif
+#endif
+
+    if (alt)
+    {
+        W->val[0]&=0x1f;
+        FP8_fromBytes(&qx,&(W->val[0]));
+        W->val[0]=typ;
+        if ((typ&0x80)==0)
+        {
+            FP8_fromBytes(&qy,&(W->val[8*MODBYTES_XXX]));
+            if (ECP8_set(Q, &qx, &qy)) return 1;
+            return 0;
+        } else {
+            if (!ECP8_setx(Q,&qx,0)) return 0;
+            sgn=(typ&0x20)>>5;
+            cmp=FP8_islarger(&(Q->y));
+            if ((sgn==1 && cmp!=1) || (sgn==0 && cmp==1)) ECP8_neg(Q);
+            return 1;
+        }
+    } else {
+        FP8_fromBytes(&qx,&(W->val[1]));
+
+        if (typ == 0x04)
+        {
+            FP8_fromBytes(&qy,&(W->val[8 * MODBYTES_XXX+1]));
+            if (ECP8_set(Q, &qx, &qy)) return 1;
+        } else {
+            if (ECP8_setx(Q, &qx, typ&1)) return 1;
+        }
+    }
+    return 0;
+}
+
+/* Calculate RHS of twisted curve equation x^3+B/i or x^3+Bi*/
+void ZZZ::ECP8_rhs(FP8 *rhs, FP8 *x)
+{
+    /* calculate RHS of elliptic curve equation */
+    FP8 t;
+    FP4 t4;
+    FP2 t2;
+    BIG b;
+    FP8_sqr(&t, x);
+
+    FP8_mul(rhs, &t, x);
+
+    /* Assuming CURVE_A=0 */
+
+    BIG_rcopy(b, CURVE_B);
+
+    FP2_from_BIG(&t2, b);
+    FP4_from_FP2(&t4, &t2);
+    FP8_from_FP4(&t, &t4);
+
+#if SEXTIC_TWIST_ZZZ == D_TYPE
+    FP8_div_i(&t);   /* IMPORTANT - here we use the correct SEXTIC twist of the curve */
+#endif
+
+#if SEXTIC_TWIST_ZZZ == M_TYPE
+    FP8_times_i(&t);   /* IMPORTANT - here we use the correct SEXTIC twist of the curve */
+#endif
+
+    FP8_add(rhs, &t, rhs);
+    FP8_reduce(rhs);
+}
+
+/* Set P=(x,y). Return 1 if (x,y) is on the curve, else return 0*/
+/* SU= 232 */
+int ZZZ::ECP8_set(ECP8 *P, FP8 *x, FP8 *y)
+{
+    FP8 rhs, y2;
+
+    FP8_sqr(&y2, y);
+    ECP8_rhs(&rhs, x);
+
+    if (!FP8_equals(&y2, &rhs))
+    {
+        ECP8_inf(P);
+        return 0;
+    }
+
+    FP8_copy(&(P->x), x);
+    FP8_copy(&(P->y), y);
+    FP8_one(&(P->z));
+    return 1;
+}
+
+/* Set P=(x,y). Return 1 if (x,.) is on the curve, else return 0 */
+/* SU= 232 */
+int ZZZ::ECP8_setx(ECP8 *P, FP8 *x, int s)
+{
+    FP8 y;
+    FP hint;
+    ECP8_rhs(&y, x);
+
+    if (!FP8_qr(&y,&hint))
+    {
+        ECP8_inf(P);
+        return 0;
+    }
+    FP8_sqrt(&y,&y,&hint);
+
+    FP8_copy(&(P->x), x);
+    FP8_copy(&(P->y), &y);
+    FP8_one(&(P->z));
+
+    if (FP8_sign(&(P->y)) != s)
+        FP8_neg(&(P->y),&(P->y));
+    FP8_reduce(&(P->y));
+
+    return 1;
+}
+
+/* Set P=-P */
+/* SU= 8 */
+void ZZZ::ECP8_neg(ECP8 *P)
+{
+    FP8_norm(&(P->y));
+    FP8_neg(&(P->y), &(P->y));
+    FP8_norm(&(P->y));
+}
+
+
+/* R+=R */
+/* return -1 for Infinity, 0 for addition, 1 for doubling */
+int ZZZ::ECP8_dbl(ECP8 *P)
+{
+    FP8 t0, t1, t2, t3, iy, x3, y3;
+
+    FP8_copy(&iy, &(P->y));     //FP8 iy=new FP8(y);
+#if SEXTIC_TWIST_ZZZ==D_TYPE
+    FP8_times_i(&iy);           //iy.mul_ip();
+#endif
+
+    FP8_sqr(&t0, &(P->y));          //t0.sqr();
+#if SEXTIC_TWIST_ZZZ==D_TYPE
+    FP8_times_i(&t0);           //t0.mul_ip();
+#endif
+
+    FP8_mul(&t1, &iy, &(P->z)); //t1.mul(z);
+    FP8_sqr(&t2, &(P->z));              //t2.sqr();
+
+    FP8_add(&(P->z), &t0, &t0); //z.add(t0);
+    FP8_norm(&(P->z));              //z.norm();
+    FP8_add(&(P->z), &(P->z), &(P->z)); //z.add(z);
+    FP8_add(&(P->z), &(P->z), &(P->z)); //z.add(z);
+    FP8_norm(&(P->z));          //z.norm();
+
+    FP8_imul(&t2, &t2, 3 * CURVE_B_I); //t2.imul(3*ROM.CURVE_B_I);
+#if SEXTIC_TWIST_ZZZ==M_TYPE
+    FP8_times_i(&t2);
+#endif
+
+    FP8_mul(&x3, &t2, &(P->z)); //x3.mul(z);
+
+    FP8_add(&y3, &t0, &t2);     //y3.add(t2);
+    FP8_norm(&y3);              //y3.norm();
+    FP8_mul(&(P->z), &(P->z), &t1); //z.mul(t1);
+
+    FP8_add(&t1, &t2, &t2);     //t1.add(t2);
+    FP8_add(&t2, &t2, &t1);     //t2.add(t1);
+    FP8_norm(&t2);              //t2.norm();
+    FP8_sub(&t0, &t0, &t2);     //t0.sub(t2);
+    FP8_norm(&t0);              //t0.norm();                           //y^2-9bz^2
+    FP8_mul(&y3, &y3, &t0);     //y3.mul(t0);
+    FP8_add(&(P->y), &y3, &x3);     //y3.add(x3);                          //(y^2+3z*2)(y^2-9z^2)+3b.z^2.8y^2
+
+    FP8_mul(&t1, &(P->x), &iy);     //t1.mul(iy);                       //
+
+    FP8_norm(&t0);          //x.norm();
+    FP8_mul(&(P->x), &t0, &t1); //x.mul(t1);
+    FP8_add(&(P->x), &(P->x), &(P->x)); //x.add(x);       //(y^2-9bz^2)xy2
+
+    FP8_norm(&(P->x));          //x.norm();
+
+    FP8_norm(&(P->y));          //y.norm();
+
+    return 1;
+}
+
+/* Set P+=Q */
+
+int ZZZ::ECP8_add(ECP8 *P, ECP8 *Q)
+{
+    FP8 t0, t1, t2, t3, t4, x3, y3, z3;
+    int b3 = 3 * CURVE_B_I;
+
+    FP8_mul(&t0, &(P->x), &(Q->x)); //t0.mul(Q.x);         // x.Q.x
+    FP8_mul(&t1, &(P->y), &(Q->y)); //t1.mul(Q.y);       // y.Q.y
+
+    FP8_mul(&t2, &(P->z), &(Q->z)); //t2.mul(Q.z);
+    FP8_add(&t3, &(P->x), &(P->y)); //t3.add(y);
+    FP8_norm(&t3);              //t3.norm();          //t3=X1+Y1
+    FP8_add(&t4, &(Q->x), &(Q->y)); //t4.add(Q.y);
+    FP8_norm(&t4);              //t4.norm();            //t4=X2+Y2
+    FP8_mul(&t3, &t3, &t4);     //t3.mul(t4);                       //t3=(X1+Y1)(X2+Y2)
+    FP8_add(&t4, &t0, &t1);     //t4.add(t1);       //t4=X1.X2+Y1.Y2
+
+    FP8_sub(&t3, &t3, &t4);     //t3.sub(t4);
+    FP8_norm(&t3);              //t3.norm();
+#if SEXTIC_TWIST_ZZZ==D_TYPE
+    FP8_times_i(&t3);           //t3.mul_ip();
+#endif
+
+    FP8_add(&t4, &(P->y), &(P->z)); //t4.add(z);
+    FP8_norm(&t4);              //t4.norm();            //t4=Y1+Z1
+
+    FP8_add(&x3, &(Q->y), &(Q->z)); //x3.add(Q.z);
+    FP8_norm(&x3);              //x3.norm();            //x3=Y2+Z2
+
+    FP8_mul(&t4, &t4, &x3);     //t4.mul(x3);                       //t4=(Y1+Z1)(Y2+Z2)
+
+    FP8_add(&x3, &t1, &t2);     //x3.add(t2);                       //X3=Y1.Y2+Z1.Z2
+
+    FP8_sub(&t4, &t4, &x3);     //t4.sub(x3);
+    FP8_norm(&t4);              //t4.norm();
+#if SEXTIC_TWIST_ZZZ==D_TYPE
+    FP8_times_i(&t4);           //t4.mul_ip(); //t4=(Y1+Z1)(Y2+Z2) - (Y1.Y2+Z1.Z2) = Y1.Z2+Y2.Z1
+#endif
+
+    FP8_add(&x3, &(P->x), &(P->z)); //x3.add(z);
+    FP8_norm(&x3);              //x3.norm();    // x3=X1+Z1
+
+    FP8_add(&y3, &(Q->x), &(Q->z)); //y3.add(Q.z);
+    FP8_norm(&y3);              //y3.norm();                // y3=X2+Z2
+    FP8_mul(&x3, &x3, &y3);     //x3.mul(y3);                           // x3=(X1+Z1)(X2+Z2)
+
+    FP8_add(&y3, &t0, &t2);     //y3.add(t2);                           // y3=X1.X2+Z1+Z2
+    FP8_sub(&y3, &x3, &y3);     //y3.rsub(x3);
+    FP8_norm(&y3);              //y3.norm();                // y3=(X1+Z1)(X2+Z2) - (X1.X2+Z1.Z2) = X1.Z2+X2.Z1
+#if SEXTIC_TWIST_ZZZ==D_TYPE
+    FP8_times_i(&t0);           //t0.mul_ip();
+    FP8_times_i(&t1);           //t1.mul_ip();
+#endif
+
+    FP8_add(&x3, &t0, &t0);     //x3.add(t0);
+    FP8_add(&t0, &t0, &x3);     //t0.add(x3);
+    FP8_norm(&t0);              //t0.norm();
+    FP8_imul(&t2, &t2, b3);     //t2.imul(b);
+#if SEXTIC_TWIST_ZZZ==M_TYPE
+    FP8_times_i(&t2);
+#endif
+
+    FP8_add(&z3, &t1, &t2);     //z3.add(t2);
+    FP8_norm(&z3);              //z3.norm();
+    FP8_sub(&t1, &t1, &t2);     //t1.sub(t2);
+    FP8_norm(&t1);              //t1.norm();
+    FP8_imul(&y3, &y3, b3);     //y3.imul(b);
+#if SEXTIC_TWIST_ZZZ==M_TYPE
+    FP8_times_i(&y3);
+#endif
+
+    FP8_mul(&x3, &y3, &t4);     //x3.mul(t4);
+
+    FP8_mul(&t2, &t3, &t1);     //t2.mul(t1);
+    FP8_sub(&(P->x), &t2, &x3);     //x3.rsub(t2);
+    FP8_mul(&y3, &y3, &t0);     //y3.mul(t0);
+    FP8_mul(&t1, &t1, &z3);     //t1.mul(z3);
+    FP8_add(&(P->y), &y3, &t1);     //y3.add(t1);
+    FP8_mul(&t0, &t0, &t3);     //t0.mul(t3);
+    FP8_mul(&z3, &z3, &t4);     //z3.mul(t4);
+    FP8_add(&(P->z), &z3, &t0);     //z3.add(t0);
+
+
+    FP8_norm(&(P->x));          //x.norm();
+    FP8_norm(&(P->y));          //y.norm();
+    FP8_norm(&(P->z));          //z.norm();
+
+    return 0;
+}
+
+/* Set P-=Q */
+/* SU= 16 */
+void ZZZ::ECP8_sub(ECP8 *P, ECP8 *Q)
+{
+    ECP8 NQ;
+    ECP8_copy(&NQ, Q);
+    ECP8_neg(&NQ);
+    ECP8_add(P, &NQ);
+}
+
+
+void ZZZ::ECP8_reduce(ECP8 *P)
+{
+    FP8_reduce(&(P->x));
+    FP8_reduce(&(P->y));
+}
+
+/* P*=e */
+/* SU= 280 */
+void ZZZ::ECP8_mul(ECP8 *P, BIG e)
+{
+    /* fixed size windows */
+    int i, nb, s, ns;
+    BIG mt, t;
+    ECP8 Q, W[8], C;
+    sign8 w[1 + (NLEN_XXX * BASEBITS_XXX + 3) / 4];
+
+    if (ECP8_isinf(P)) return;
+
+    /* precompute table */
+
+    ECP8_copy(&Q, P);
+    ECP8_dbl(&Q);
+    ECP8_copy(&W[0], P);
+
+    for (i = 1; i < 8; i++)
+    {
+        ECP8_copy(&W[i], &W[i - 1]);
+        ECP8_add(&W[i], &Q);
+    }
+
+    /* make exponent odd - add 2P if even, P if odd */
+    BIG_copy(t, e);
+    s = BIG_parity(t);
+    BIG_inc(t, 1);
+    BIG_norm(t);
+    ns = BIG_parity(t);
+    BIG_copy(mt, t);
+    BIG_inc(mt, 1);
+    BIG_norm(mt);
+    BIG_cmove(t, mt, s);
+    ECP8_cmove(&Q, P, ns);
+    ECP8_copy(&C, &Q);
+
+    nb = 1 + (BIG_nbits(t) + 3) / 4;
+
+    /* convert exponent to signed 4-bit window */
+    for (i = 0; i < nb; i++)
+    {
+        w[i] = BIG_lastbits(t, 5) - 16;
+        BIG_dec(t, w[i]);
+        BIG_norm(t);
+        BIG_fshr(t, 4);
+    }
+    w[nb] = BIG_lastbits(t, 5);
+
+    //ECP8_copy(P, &W[(w[nb] - 1) / 2]);
+    ECP8_select(P, W, w[nb]);
+    for (i = nb - 1; i >= 0; i--)
+    {
+        ECP8_select(&Q, W, w[i]);
+        ECP8_dbl(P);
+        ECP8_dbl(P);
+        ECP8_dbl(P);
+        ECP8_dbl(P);
+        ECP8_add(P, &Q);
+    }
+    ECP8_sub(P, &C); /* apply correction */
+    ECP8_affine(P);
+}
+
+void ZZZ::ECP8_frob_constants(FP2 F[3])
+{
+    FP fx, fy;
+    FP2 X;
+
+    FP_rcopy(&fx, Fra);
+    FP_rcopy(&fy, Frb);
+    FP2_from_FPs(&X, &fx, &fy); // u^(p-19)/24
+
+    FP2_sqr(&F[0], &X);     // F[0]=u^(p-19)/12
+    FP2_copy(&F[2], &F[0]);
+    FP2_mul_ip(&F[2]);          // W=u^12/12.u^(p-19)/12 = u^(p-7)/12
+    FP2_norm(&F[2]);
+    FP2_sqr(&F[1], &F[2]);
+    FP2_mul(&F[2], &F[2], &F[1]); // W=u^(p-7)/4
+
+    FP2_mul_ip(&F[2]);          // W=u^4/4.W=u^(p-7)/4 = u^(p-3)/4
+    FP2_norm(&F[2]);
+
+    FP2_copy(&F[1], &X);
+
+#if SEXTIC_TWIST_ZZZ == M_TYPE
+    FP2_mul_ip(&F[1]);      // u^24/24.u^(p-19)/24 = u^(p+5)/24
+    FP2_norm(&F[1]);
+    FP2_inv(&F[1], &F[1], NULL);      // u^-(p+5)/24
+    FP2_sqr(&F[0], &F[1]);      // u^-(p+5)/12 - ***
+    FP2_mul(&F[1], &F[1], &F[0]); // u^-(p+5)/8  - ***
+#endif
+
+#if SEXTIC_TWIST_ZZZ == D_TYPE
+    FP2_sqr(&F[0], &F[1]);  // u^(p-19)/12
+    FP2_mul(&F[1], &F[1], &F[0]); // u^(p-19)/8
+    FP2_mul_ip(&F[0]);      // u^(p-7)/12  - ***
+    FP2_norm(&F[0]);
+    FP2_mul_ip(&F[1]);      // u^(p-11)/8
+    FP2_norm(&F[1]);
+    FP2_mul_ip(&F[1]);      // u^(p-3)/8   - ***
+    FP2_norm(&F[1]);
+#endif
+
+}
+
+/* Calculates q^n.P using Frobenius constant X */
+void ZZZ::ECP8_frob(ECP8 *P, FP2 F[3], int n)
+{
+    int i;
+    FP8 X, Y, Z;
+// F=u^(p-19)/24
+
+    FP8_copy(&X, &(P->x));
+    FP8_copy(&Y, &(P->y));
+    FP8_copy(&Z, &(P->z));
+
+    for (i = 0; i < n; i++)
+    {
+        FP8_frob(&X, &F[2]);    // X^p
+
+#if SEXTIC_TWIST_ZZZ == M_TYPE
+        FP8_qmul(&X, &X, &F[0]); // X^p.u^-(p+5)/12
+        FP8_times_i2(&X);       // X^p.u^{1/2}.u^-(p+5)/12 = X^p.u^-(p-1)/12
+#endif
+#if SEXTIC_TWIST_ZZZ == D_TYPE
+        FP8_qmul(&X, &X, &F[0]); // X^p.u^(p-7)/12
+        FP8_times_i2(&X);       // X^p.u^{1/2}.u^(p-7)/12 = X^p.u^(p-1)/12
+#endif
+
+        FP8_frob(&Y, &F[2]);    // Y^p
+
+
+#if SEXTIC_TWIST_ZZZ == M_TYPE
+        FP8_qmul(&Y, &Y, &F[1]); // Y^p.u^-(p+5)/8
+        FP8_times_i2(&Y);
+        FP8_times_i(&Y);        // Y^p.u^(3/4}.u^-(p+5)/8 = Y.p.u^(p-1)/8
+
+#endif
+#if SEXTIC_TWIST_ZZZ == D_TYPE
+        FP8_qmul(&Y, &Y, &F[1]); // Y^p.u^(p-3)/8
+        FP8_times_i(&Y);        // Y^p.u^(1/4}.u^(p-3)/8 = Y^p.u^(p-1)/8
+#endif
+        FP8_frob(&Z, &F[2]);
+    }
+
+    FP8_copy(&(P->x), &X);
+    FP8_copy(&(P->y), &Y);
+    FP8_copy(&(P->z), &Z);
+
+}
+
+/* Side channel attack secure */
+// Bos & Costello https://eprint.iacr.org/2013/458.pdf
+// Faz-Hernandez & Longa & Sanchez  https://eprint.iacr.org/2013/158.pdf
+
+void ZZZ::ECP8_mul16(ECP8 *P, ECP8 Q[16], BIG u[16])
+{
+    int i, j, k, nb, pb1, pb2, pb3, pb4, bt;
+    ECP8 T1[8], T2[8], T3[8], T4[8], W;
+    BIG mt, t[16];
+    sign8 w1[NLEN_XXX * BASEBITS_XXX + 1];
+    sign8 s1[NLEN_XXX * BASEBITS_XXX + 1];
+    sign8 w2[NLEN_XXX * BASEBITS_XXX + 1];
+    sign8 s2[NLEN_XXX * BASEBITS_XXX + 1];
+    sign8 w3[NLEN_XXX * BASEBITS_XXX + 1];
+    sign8 s3[NLEN_XXX * BASEBITS_XXX + 1];
+    sign8 w4[NLEN_XXX * BASEBITS_XXX + 1];
+    sign8 s4[NLEN_XXX * BASEBITS_XXX + 1];
+
+    for (i = 0; i < 16; i++)
+    {
+        BIG_copy(t[i], u[i]);
+    }
+// Precomputed tables
+    ECP8_copy(&T1[0], &Q[0]); // Q[0]
+    ECP8_copy(&T1[1], &T1[0]);
+    ECP8_add(&T1[1], &Q[1]); // Q[0]+Q[1]
+    ECP8_copy(&T1[2], &T1[0]);
+    ECP8_add(&T1[2], &Q[2]); // Q[0]+Q[2]
+    ECP8_copy(&T1[3], &T1[1]);
+    ECP8_add(&T1[3], &Q[2]); // Q[0]+Q[1]+Q[2]
+    ECP8_copy(&T1[4], &T1[0]);
+    ECP8_add(&T1[4], &Q[3]); // Q[0]+Q[3]
+    ECP8_copy(&T1[5], &T1[1]);
+    ECP8_add(&T1[5], &Q[3]); // Q[0]+Q[1]+Q[3]
+    ECP8_copy(&T1[6], &T1[2]);
+    ECP8_add(&T1[6], &Q[3]); // Q[0]+Q[2]+Q[3]
+    ECP8_copy(&T1[7], &T1[3]);
+    ECP8_add(&T1[7], &Q[3]); // Q[0]+Q[1]+Q[2]+Q[3]
+
+    ECP8_copy(&T2[0], &Q[4]); // Q[0]
+    ECP8_copy(&T2[1], &T2[0]);
+    ECP8_add(&T2[1], &Q[5]); // Q[0]+Q[1]
+    ECP8_copy(&T2[2], &T2[0]);
+    ECP8_add(&T2[2], &Q[6]); // Q[0]+Q[2]
+    ECP8_copy(&T2[3], &T2[1]);
+    ECP8_add(&T2[3], &Q[6]); // Q[0]+Q[1]+Q[2]
+    ECP8_copy(&T2[4], &T2[0]);
+    ECP8_add(&T2[4], &Q[7]); // Q[0]+Q[3]
+    ECP8_copy(&T2[5], &T2[1]);
+    ECP8_add(&T2[5], &Q[7]); // Q[0]+Q[1]+Q[3]
+    ECP8_copy(&T2[6], &T2[2]);
+    ECP8_add(&T2[6], &Q[7]); // Q[0]+Q[2]+Q[3]
+    ECP8_copy(&T2[7], &T2[3]);
+    ECP8_add(&T2[7], &Q[7]); // Q[0]+Q[1]+Q[2]+Q[3]
+
+    ECP8_copy(&T3[0], &Q[8]); // Q[0]
+    ECP8_copy(&T3[1], &T3[0]);
+    ECP8_add(&T3[1], &Q[9]); // Q[0]+Q[1]
+    ECP8_copy(&T3[2], &T3[0]);
+    ECP8_add(&T3[2], &Q[10]);   // Q[0]+Q[2]
+    ECP8_copy(&T3[3], &T3[1]);
+    ECP8_add(&T3[3], &Q[10]);   // Q[0]+Q[1]+Q[2]
+    ECP8_copy(&T3[4], &T3[0]);
+    ECP8_add(&T3[4], &Q[11]); // Q[0]+Q[3]
+    ECP8_copy(&T3[5], &T3[1]);
+    ECP8_add(&T3[5], &Q[11]);   // Q[0]+Q[1]+Q[3]
+    ECP8_copy(&T3[6], &T3[2]);
+    ECP8_add(&T3[6], &Q[11]);   // Q[0]+Q[2]+Q[3]
+    ECP8_copy(&T3[7], &T3[3]);
+    ECP8_add(&T3[7], &Q[11]);   // Q[0]+Q[1]+Q[2]+Q[3]
+
+    ECP8_copy(&T4[0], &Q[12]); // Q[0]
+    ECP8_copy(&T4[1], &T4[0]);
+    ECP8_add(&T4[1], &Q[13]);   // Q[0]+Q[1]
+    ECP8_copy(&T4[2], &T4[0]);
+    ECP8_add(&T4[2], &Q[14]);   // Q[0]+Q[2]
+    ECP8_copy(&T4[3], &T4[1]);
+    ECP8_add(&T4[3], &Q[14]);   // Q[0]+Q[1]+Q[2]
+    ECP8_copy(&T4[4], &T4[0]);
+    ECP8_add(&T4[4], &Q[15]); // Q[0]+Q[3]
+    ECP8_copy(&T4[5], &T4[1]);
+    ECP8_add(&T4[5], &Q[15]);   // Q[0]+Q[1]+Q[3]
+    ECP8_copy(&T4[6], &T4[2]);
+    ECP8_add(&T4[6], &Q[15]);   // Q[0]+Q[2]+Q[3]
+    ECP8_copy(&T4[7], &T4[3]);
+    ECP8_add(&T4[7], &Q[15]);   // Q[0]+Q[1]+Q[2]+Q[3]
+
+// Make them odd
+    pb1 = 1 - BIG_parity(t[0]);
+    BIG_inc(t[0], pb1);
+    BIG_norm(t[0]);
+
+    pb2 = 1 - BIG_parity(t[4]);
+    BIG_inc(t[4], pb2);
+    BIG_norm(t[4]);
+
+    pb3 = 1 - BIG_parity(t[8]);
+    BIG_inc(t[8], pb3);
+    BIG_norm(t[8]);
+
+    pb4 = 1 - BIG_parity(t[12]);
+    BIG_inc(t[12], pb4);
+    BIG_norm(t[12]);
+
+// Number of bits
+    BIG_zero(mt);
+    for (i = 0; i < 16; i++)
+    {
+        BIG_or(mt, mt, t[i]);
+    }
+    nb = 1 + BIG_nbits(mt);
+
+// Sign pivot
+    s1[nb - 1] = 1;
+    s2[nb - 1] = 1;
+    s3[nb - 1] = 1;
+    s4[nb - 1] = 1;
+    for (i = 0; i < nb - 1; i++)
+    {
+        BIG_fshr(t[0], 1);
+        s1[i] = 2 * BIG_parity(t[0]) - 1;
+        BIG_fshr(t[4], 1);
+        s2[i] = 2 * BIG_parity(t[4]) - 1;
+        BIG_fshr(t[8], 1);
+        s3[i] = 2 * BIG_parity(t[8]) - 1;
+        BIG_fshr(t[12], 1);
+        s4[i] = 2 * BIG_parity(t[12]) - 1;
+    }
+
+// Recoded exponents
+    for (i = 0; i < nb; i++)
+    {
+        w1[i] = 0;
+        k = 1;
+        for (j = 1; j < 4; j++)
+        {
+            bt = s1[i] * BIG_parity(t[j]);
+            BIG_fshr(t[j], 1);
+
+            BIG_dec(t[j], (bt >> 1));
+            BIG_norm(t[j]);
+            w1[i] += bt * k;
+            k *= 2;
+        }
+
+        w2[i] = 0;
+        k = 1;
+        for (j = 5; j < 8; j++)
+        {
+            bt = s2[i] * BIG_parity(t[j]);
+            BIG_fshr(t[j], 1);
+
+            BIG_dec(t[j], (bt >> 1));
+            BIG_norm(t[j]);
+            w2[i] += bt * k;
+            k *= 2;
+        }
+
+        w3[i] = 0;
+        k = 1;
+        for (j = 9; j < 12; j++)
+        {
+            bt = s3[i] * BIG_parity(t[j]);
+            BIG_fshr(t[j], 1);
+
+            BIG_dec(t[j], (bt >> 1));
+            BIG_norm(t[j]);
+            w3[i] += bt * k;
+            k *= 2;
+        }
+
+        w4[i] = 0;
+        k = 1;
+        for (j = 13; j < 16; j++)
+        {
+            bt = s4[i] * BIG_parity(t[j]);
+            BIG_fshr(t[j], 1);
+
+            BIG_dec(t[j], (bt >> 1));
+            BIG_norm(t[j]);
+            w4[i] += bt * k;
+            k *= 2;
+        }
+    }
+
+// Main loop
+
+    ECP8_select(P, T1, 2 * w1[nb - 1] + 1);
+    ECP8_select(&W, T2, 2 * w2[nb - 1] + 1);
+    ECP8_add(P, &W);
+    ECP8_select(&W, T3, 2 * w3[nb - 1] + 1);
+    ECP8_add(P, &W);
+    ECP8_select(&W, T4, 2 * w4[nb - 1] + 1);
+    ECP8_add(P, &W);
+
+    for (i = nb - 2; i >= 0; i--)
+    {
+        ECP8_dbl(P);
+        ECP8_select(&W, T1, 2 * w1[i] + s1[i]);
+        ECP8_add(P, &W);
+        ECP8_select(&W, T2, 2 * w2[i] + s2[i]);
+        ECP8_add(P, &W);
+        ECP8_select(&W, T3, 2 * w3[i] + s3[i]);
+        ECP8_add(P, &W);
+        ECP8_select(&W, T4, 2 * w4[i] + s4[i]);
+        ECP8_add(P, &W);
+    }
+
+// apply corrections
+    ECP8_copy(&W, P);
+    ECP8_sub(&W, &Q[0]);
+    ECP8_cmove(P, &W, pb1);
+    ECP8_copy(&W, P);
+    ECP8_sub(&W, &Q[4]);
+    ECP8_cmove(P, &W, pb2);
+
+    ECP8_copy(&W, P);
+    ECP8_sub(&W, &Q[8]);
+    ECP8_cmove(P, &W, pb3);
+    ECP8_copy(&W, P);
+    ECP8_sub(&W, &Q[12]);
+    ECP8_cmove(P, &W, pb4);
+
+    ECP8_affine(P);
+}
+
+/* Hunt and Peck a BIG to G2 curve point */
+/*
+void ZZZ::ECP8_hap2point(ECP8 *Q,BIG h)
+{
+    BIG one,hv;
+    FP2 X2;
+    FP4 X4;
+    FP8 X8;
+    BIG_one(one);
+    BIG_copy(hv,h);
+
+    for (;;)
+    {
+        FP2_from_BIGs(&X2,one,hv);  
+		FP4_from_FP2(&X4,&X2);
+		FP8_from_FP4(&X8,&X4);
+        if (ECP8_setx(Q,&X8,0)) break;
+        BIG_inc(hv,1);
+        BIG_norm(hv);
+    }
+}
+*/
+/* Constant time Map BIG to Point in G2 */
+void ZZZ::ECP8_map2point(ECP8 *Q,FP8 *H)
+{
+    int sgn,ne;
+    FP8 X1,X2,X3,W,Y,T,A,NY;
+    FP Z,s;
+
+    FP8_one(&NY);
+    FP8_copy(&T,H);
+    sgn=FP8_sign(&T);
+ 
+    FP_from_int(&Z,RIADZG2A_YYY);
+    FP8_from_FP(&A,&Z);
+    ECP8_rhs(&A,&A);  // A=g(Z)
+
+    FP8_sqrt(&W,&A,NULL);
+    FP_rcopy(&s,SQRTm3);
+
+    FP_mul(&Z,&Z,&s);
+
+    FP8_sqr(&T,&T);   
+    FP8_mul(&Y,&A,&T);   // tv1=u^2*g(Z)
+    FP8_add(&T,&NY,&Y); FP8_norm(&T); // tv2=1+tv1
+    FP8_sub(&Y,&NY,&Y); FP8_norm(&Y); // tv1=1-tv1 
+    FP8_mul(&NY,&T,&Y);
+
+    FP8_tmul(&NY,&NY,&Z);
+
+    FP8_inv(&NY,&NY,NULL);     // tv3=inv0(tv1*tv2*Z*sqrt(-3))
+    FP8_tmul(&W,&W,&Z); // tv4=Z*sqrt(-3).sqrt(g(Z))
+    if (FP8_sign(&W)==1)
+    {
+        FP8_neg(&W,&W);
+        FP8_norm(&W);
+    }
+    FP8_tmul(&W,&W,&Z);
+    FP8_mul(&W,&W,H);
+    FP8_mul(&W,&W,&Y);
+    FP8_mul(&W,&W,&NY);     // tv5=u*tv1*tv3*tv4
+
+    FP_from_int(&s,RIADZG2A_YYY);
+    FP8_from_FP(&X1,&s);
+
+    FP8_copy(&X3,&X1);
+    FP8_neg(&X1,&X1); FP8_norm(&X1); FP8_div2(&X1,&X1); // -Z/2
+    FP8_copy(&X2,&X1);
+    FP8_sub(&X1,&X1,&W); FP8_norm(&X1);
+    FP8_add(&X2,&X2,&W); FP8_norm(&X2);
+    FP8_add(&A,&A,&A);
+    FP8_add(&A,&A,&A); 
+    FP8_norm(&A);      // 4*g(Z)
+    FP8_sqr(&T,&T);
+    FP8_mul(&T,&T,&NY);
+    FP8_sqr(&T,&T);    // (tv2^2*tv3)^2
+    FP8_mul(&A,&A,&T); // -4*g(Z)*(tv2^2*tv3)^2
+
+    FP8_add(&X3,&X3,&A); FP8_norm(&X3);   
+
+    ECP8_rhs(&W,&X2);
+    FP8_cmove(&X3,&X2,FP8_qr(&W,NULL));
+    ECP8_rhs(&W,&X1);
+    FP8_cmove(&X3,&X1,FP8_qr(&W,NULL));
+    ECP8_rhs(&W,&X3);
+    FP8_sqrt(&Y,&W,NULL);
+    
+    ne=FP8_sign(&Y)^sgn;
+    FP8_neg(&W,&Y); FP8_norm(&W);
+    FP8_cmove(&Y,&W,ne);
+ 
+    ECP8_set(Q,&X3,&Y);
+}
+
+/* Map octet to point on G2 */
+/*
+void ZZZ::ECP8_mapit(ECP8 *Q, octet *W)
+{
+    BIG q, x;
+    DBIG dx;
+    BIG_rcopy(q, Modulus);
+
+    BIG_dfromBytesLen(dx,W->val,W->len);
+    BIG_dmod(x,dx,q);
+
+    ECP8_hap2point(Q,x);   
+    ECP8_cfp(Q);
+}
+*/
+/* cofactor product */
+void ZZZ::ECP8_cfp(ECP8 *Q)
+{
+    FP2 X[3];
+    ECP8 xQ, x2Q, x3Q, x4Q , x5Q, x6Q, x7Q, x8Q;
+    BIG x;
+
+    ECP8_frob_constants(X);
+
+    BIG_rcopy(x, CURVE_Bnx);
+
+    // Efficient hash maps to G2 on BLS48 curves - Budroni, Pintore
+    // Q -> x8Q -x7Q -Q +  F(x7Q-x6Q) + F(F(x6Q-x5Q)) +F(F(F(x5Q-x4Q))) +F(F(F(F(x4Q-x3Q)))) + F(F(F(F(F(x3Q-x2Q))))) + F(F(F(F(F(F(x2Q-xQ)))))) + F(F(F(F(F(F(F(xQ-Q))))))) +F(F(F(F(F(F(F(F(2Q))))))))
+
+    ECP8_copy(&xQ, Q);
+    ECP8_mul(&xQ, x);
+    ECP8_copy(&x2Q, &xQ);
+    ECP8_mul(&x2Q, x);
+    ECP8_copy(&x3Q, &x2Q);
+    ECP8_mul(&x3Q, x);
+    ECP8_copy(&x4Q, &x3Q);
+
+    ECP8_mul(&x4Q, x);
+    ECP8_copy(&x5Q, &x4Q);
+    ECP8_mul(&x5Q, x);
+    ECP8_copy(&x6Q, &x5Q);
+    ECP8_mul(&x6Q, x);
+    ECP8_copy(&x7Q, &x6Q);
+    ECP8_mul(&x7Q, x);
+    ECP8_copy(&x8Q, &x7Q);
+    ECP8_mul(&x8Q, x);
+
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    ECP8_neg(&xQ);
+    ECP8_neg(&x3Q);
+    ECP8_neg(&x5Q);
+    ECP8_neg(&x7Q);
+#endif
+
+    ECP8_sub(&x8Q, &x7Q);
+    ECP8_sub(&x8Q, Q);
+
+    ECP8_sub(&x7Q, &x6Q);
+    ECP8_frob(&x7Q, X, 1);
+
+    ECP8_sub(&x6Q, &x5Q);
+    ECP8_frob(&x6Q, X, 2);
+
+    ECP8_sub(&x5Q, &x4Q);
+    ECP8_frob(&x5Q, X, 3);
+
+    ECP8_sub(&x4Q, &x3Q);
+    ECP8_frob(&x4Q, X, 4);
+
+    ECP8_sub(&x3Q, &x2Q);
+    ECP8_frob(&x3Q, X, 5);
+
+    ECP8_sub(&x2Q, &xQ);
+    ECP8_frob(&x2Q, X, 6);
+
+    ECP8_sub(&xQ, Q);
+    ECP8_frob(&xQ, X, 7);
+
+    ECP8_dbl(Q);
+    ECP8_frob(Q, X, 8);
+
+
+    ECP8_add(Q, &x8Q);
+    ECP8_add(Q, &x7Q);
+    ECP8_add(Q, &x6Q);
+    ECP8_add(Q, &x5Q);
+
+    ECP8_add(Q, &x4Q);
+    ECP8_add(Q, &x3Q);
+    ECP8_add(Q, &x2Q);
+    ECP8_add(Q, &xQ);
+
+    ECP8_affine(Q);
+
+}
+
+// ECP$ Get Group Generator
+
+int ZZZ::ECP8_generator(ECP8 *G)
+{
+    BIG a, b;
+    FP2 Aa, Bb;
+    FP4 A, B;
+    FP8 X, Y;
+
+    BIG_rcopy(a, CURVE_Pxaaa);
+    BIG_rcopy(b, CURVE_Pxaab);
+    FP2_from_BIGs(&Aa, a, b);
+
+    BIG_rcopy(a, CURVE_Pxaba);
+    BIG_rcopy(b, CURVE_Pxabb);
+    FP2_from_BIGs(&Bb, a, b);
+
+    FP4_from_FP2s(&A, &Aa, &Bb);
+
+    BIG_rcopy(a, CURVE_Pxbaa);
+    BIG_rcopy(b, CURVE_Pxbab);
+    FP2_from_BIGs(&Aa, a, b);
+
+    BIG_rcopy(a, CURVE_Pxbba);
+    BIG_rcopy(b, CURVE_Pxbbb);
+    FP2_from_BIGs(&Bb, a, b);
+
+    FP4_from_FP2s(&B, &Aa, &Bb);
+
+    FP8_from_FP4s(&X, &A, &B);
+
+    BIG_rcopy(a, CURVE_Pyaaa);
+    BIG_rcopy(b, CURVE_Pyaab);
+    FP2_from_BIGs(&Aa, a, b);
+
+    BIG_rcopy(a, CURVE_Pyaba);
+    BIG_rcopy(b, CURVE_Pyabb);
+    FP2_from_BIGs(&Bb, a, b);
+
+    FP4_from_FP2s(&A, &Aa, &Bb);
+
+    BIG_rcopy(a, CURVE_Pybaa);
+    BIG_rcopy(b, CURVE_Pybab);
+    FP2_from_BIGs(&Aa, a, b);
+
+    BIG_rcopy(a, CURVE_Pybba);
+    BIG_rcopy(b, CURVE_Pybbb);
+    FP2_from_BIGs(&Bb, a, b);
+
+    FP4_from_FP2s(&B, &Aa, &Bb);
+
+    FP8_from_FP4s(&Y, &A, &B);
+
+    return ECP8_set(G, &X, &Y);
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp8.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp8.h
new file mode 100644
index 0000000..bf67972
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp8.h
@@ -0,0 +1,278 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP8_ZZZ_H
+#define ECP8_ZZZ_H
+
+#include "fp8_YYY.h"
+#include "config_curve_ZZZ.h"
+
+using namespace core;
+
+namespace YYY {
+
+extern const XXX::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const XXX::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+}
+
+namespace ZZZ {
+
+/**
+	@brief ECP8 Structure - Elliptic Curve Point over quadratic extension field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag */
+    YYY::FP8 x;   /**< x-coordinate of point */
+    YYY::FP8 y;   /**< y-coordinate of point */
+    YYY::FP8 z;   /**< z-coordinate of point */
+} ECP8;
+
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;		/**< Elliptic curve B parameter */
+extern const XXX::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const XXX::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const XXX::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const XXX::BIG CURVE_Bnx;   /**< Elliptic curve parameter */
+extern const XXX::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+
+/* Generator point on G1 */
+extern const XXX::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const XXX::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const XXX::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const XXX::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+/* ECP8 E(FP8) prototypes */
+/**	@brief Tests for ECP8 point equal to infinity
+ *
+	@param P ECP8 point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP8_isinf(ECP8 *P);
+/**	@brief Copy ECP8 point to another ECP8 point
+ *
+	@param P ECP8 instance, on exit = Q
+	@param Q ECP8 instance to be copied
+ */
+extern void ECP8_copy(ECP8 *P, ECP8 *Q);
+/**	@brief Set ECP8 to point-at-infinity
+ *
+	@param P ECP8 instance to be set to infinity
+ */
+extern void ECP8_inf(ECP8 *P);
+/**	@brief Tests for equality of two ECP8s
+ *
+	@param P ECP8 instance to be compared
+	@param Q ECP8 instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP8_equals(ECP8 *P, ECP8 *Q);
+
+/**	@brief Converts an ECP8 point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP8 instance to be converted to affine form
+ */
+extern void ECP8_affine(ECP8 *P);
+
+
+/**	@brief Extract x and y coordinates of an ECP8 point P
+ *
+	If x=y, returns only x
+	@param x FP8 on exit = x coordinate of point
+	@param y FP8 on exit = y coordinate of point (unless x=y)
+	@param P ECP8 instance (x,y)
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP8_get(YYY::FP8 *x, YYY::FP8 *y, ECP8 *P);
+/**	@brief Formats and outputs an ECP8 point to the console, converted to affine coordinates
+ *
+	@param P ECP8 instance to be printed
+ */
+extern void ECP8_output(ECP8 *P);
+
+/**	@brief Formats and outputs an ECP8 point to an octet string
+ *
+	The octet string is created in the form x|y or just x if compressed
+	Convert the real and imaginary parts of the x and y coordinates to big-endian base 256 form.
+	@param S output octet string
+	@param P ECP8 instance to be converted to an octet string
+    @param c true for compression
+ */
+extern void ECP8_toOctet(octet *S, ECP8 *P, bool c);
+/**	@brief Creates an ECP8 point from an octet string
+ *
+	The octet string is in the form x|y
+	The real and imaginary parts of the x and y coordinates are in big-endian base 256 form.
+	@param P ECP8 instance to be created from the octet string
+	@param S input octet string
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP8_fromOctet(ECP8 *P, octet *S);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x)=x^3+Ax+B
+	Used internally.
+	@param r FP8 value of f(x)
+	@param x FP8 instance
+ */
+extern void ECP8_rhs(YYY::FP8 *r, YYY::FP8 *x);
+/**	@brief Set ECP8 to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP8 instance to be set (x,y)
+	@param x FP8 x coordinate of point
+	@param y FP8 y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP8_set(ECP8 *P, YYY::FP8 *x, YYY::FP8 *y);
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Otherwise y coordinate is calculated from x.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+    @param s sign of y
+	@return 1 if point exists, else 0
+ */
+extern int ECP8_setx(ECP8 *P, YYY::FP8 *x,int s);
+/**	@brief Negation of an ECP8 point
+ *
+	@param P ECP8 instance, on exit = -P
+ */
+extern void ECP8_neg(ECP8 *P);
+
+/**	@brief Reduction of an ECP8 point
+ *
+	@param P ECP8 instance, on exit (x,y) are reduced wrt the modulus
+ */
+extern void ECP8_reduce(ECP8 *P);
+
+
+/**	@brief Doubles an ECP8 instance P
+ *
+	@param P ECP8 instance, on exit =2*P
+ */
+extern int ECP8_dbl(ECP8 *P);
+/**	@brief Adds ECP8 instance Q to ECP8 instance P
+ *
+	@param P ECP8 instance, on exit =P+Q
+	@param Q ECP8 instance to be added to P
+ */
+extern int ECP8_add(ECP8 *P, ECP8 *Q);
+/**	@brief Subtracts ECP instance Q from ECP8 instance P
+ *
+	@param P ECP8 instance, on exit =P-Q
+	@param Q ECP8 instance to be subtracted from P
+ */
+extern void ECP8_sub(ECP8 *P, ECP8 *Q);
+/**	@brief Multiplies an ECP8 instance P by a BIG, side-channel resistant
+ *
+	Uses fixed sized windows.
+	@param P ECP8 instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP8_mul(ECP8 *P, XXX::BIG b);
+
+/**	@brief Calculates required Frobenius constants
+ *
+	Calculate Frobenius constants
+	@param F array of FP2 precalculated constants
+
+ */
+extern void ECP8_frob_constants(YYY::FP2 F[3]);
+
+/**	@brief Multiplies an ECP8 instance P by the internal modulus p^n, using precalculated Frobenius constants
+ *
+	Fast point multiplication using Frobenius
+	@param P ECP8 instance, on exit = p^n*P
+	@param F array of FP2 precalculated Frobenius constant
+	@param n power of prime
+
+ */
+extern void ECP8_frob(ECP8 *P, YYY::FP2 F[3], int n);
+
+/**	@brief Calculates P=Sigma b[i]*Q[i] for i=0 to 7
+ *
+	@param P ECP8 instance, on exit = Sigma b[i]*Q[i] for i=0 to 7
+	@param Q ECP8 array of 4 points
+	@param b BIG array of 4 multipliers
+ */
+extern void ECP8_mul16(ECP8 *P, ECP8 *Q, XXX::BIG *b);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP8 multiplied by co-factor
+ */
+extern void ECP8_cfp(ECP8 *Q);
+
+/**	@brief Maps random FP8 to curve point in constant time
+ *
+	@param Q ECP8 instance 
+	@param x FP8 derived from hash
+ */
+extern void ECP8_map2point(ECP8 *Q, YYY::FP8 *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck 
+ *
+	@param Q ECP8 instance 
+	@param x Fp derived from hash
+ */
+extern void ECP8_hap2point(ECP8 *Q, XXX::BIG  x);
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param P ECP8 instance of correct order
+	@param W OCTET byte array to be mapped
+ */
+extern void ECP8_mapit(ECP8 *P, octet *W);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP8 instance
+	@return 1 if point exists, else 0
+ */
+extern int ECP8_generator(ECP8 *G);
+
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp8_BLS48286.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp8_BLS48286.h
new file mode 100644
index 0000000..b8dc3b0
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp8_BLS48286.h
@@ -0,0 +1,278 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP8_BLS48286_H
+#define ECP8_BLS48286_H
+
+#include "fp8_BLS48286.h"
+#include "config_curve_BLS48286.h"
+
+using namespace core;
+
+namespace BLS48286 {
+
+extern const B288_60::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B288_60::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+}
+
+namespace BLS48286 {
+
+/**
+	@brief ECP8 Structure - Elliptic Curve Point over quadratic extension field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag */
+    BLS48286::FP8 x;   /**< x-coordinate of point */
+    BLS48286::FP8 y;   /**< y-coordinate of point */
+    BLS48286::FP8 z;   /**< z-coordinate of point */
+} ECP8;
+
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;		/**< Elliptic curve B parameter */
+extern const B288_60::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B288_60::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B288_60::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B288_60::BIG CURVE_Bnx;   /**< Elliptic curve parameter */
+extern const B288_60::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+
+/* Generator point on G1 */
+extern const B288_60::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B288_60::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B288_60::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B288_60::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+/* ECP8 E(FP8) prototypes */
+/**	@brief Tests for ECP8 point equal to infinity
+ *
+	@param P ECP8 point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP8_isinf(ECP8 *P);
+/**	@brief Copy ECP8 point to another ECP8 point
+ *
+	@param P ECP8 instance, on exit = Q
+	@param Q ECP8 instance to be copied
+ */
+extern void ECP8_copy(ECP8 *P, ECP8 *Q);
+/**	@brief Set ECP8 to point-at-infinity
+ *
+	@param P ECP8 instance to be set to infinity
+ */
+extern void ECP8_inf(ECP8 *P);
+/**	@brief Tests for equality of two ECP8s
+ *
+	@param P ECP8 instance to be compared
+	@param Q ECP8 instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP8_equals(ECP8 *P, ECP8 *Q);
+
+/**	@brief Converts an ECP8 point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP8 instance to be converted to affine form
+ */
+extern void ECP8_affine(ECP8 *P);
+
+
+/**	@brief Extract x and y coordinates of an ECP8 point P
+ *
+	If x=y, returns only x
+	@param x FP8 on exit = x coordinate of point
+	@param y FP8 on exit = y coordinate of point (unless x=y)
+	@param P ECP8 instance (x,y)
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP8_get(BLS48286::FP8 *x, BLS48286::FP8 *y, ECP8 *P);
+/**	@brief Formats and outputs an ECP8 point to the console, converted to affine coordinates
+ *
+	@param P ECP8 instance to be printed
+ */
+extern void ECP8_output(ECP8 *P);
+
+/**	@brief Formats and outputs an ECP8 point to an octet string
+ *
+	The octet string is created in the form x|y or just x if compressed
+	Convert the real and imaginary parts of the x and y coordinates to big-endian base 256 form.
+	@param S output octet string
+	@param P ECP8 instance to be converted to an octet string
+    @param c true for compression
+ */
+extern void ECP8_toOctet(octet *S, ECP8 *P, bool c);
+/**	@brief Creates an ECP8 point from an octet string
+ *
+	The octet string is in the form x|y
+	The real and imaginary parts of the x and y coordinates are in big-endian base 256 form.
+	@param P ECP8 instance to be created from the octet string
+	@param S input octet string
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP8_fromOctet(ECP8 *P, octet *S);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x)=x^3+Ax+B
+	Used internally.
+	@param r FP8 value of f(x)
+	@param x FP8 instance
+ */
+extern void ECP8_rhs(BLS48286::FP8 *r, BLS48286::FP8 *x);
+/**	@brief Set ECP8 to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP8 instance to be set (x,y)
+	@param x FP8 x coordinate of point
+	@param y FP8 y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP8_set(ECP8 *P, BLS48286::FP8 *x, BLS48286::FP8 *y);
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Otherwise y coordinate is calculated from x.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+    @param s sign of y
+	@return 1 if point exists, else 0
+ */
+extern int ECP8_setx(ECP8 *P, BLS48286::FP8 *x,int s);
+/**	@brief Negation of an ECP8 point
+ *
+	@param P ECP8 instance, on exit = -P
+ */
+extern void ECP8_neg(ECP8 *P);
+
+/**	@brief Reduction of an ECP8 point
+ *
+	@param P ECP8 instance, on exit (x,y) are reduced wrt the modulus
+ */
+extern void ECP8_reduce(ECP8 *P);
+
+
+/**	@brief Doubles an ECP8 instance P
+ *
+	@param P ECP8 instance, on exit =2*P
+ */
+extern int ECP8_dbl(ECP8 *P);
+/**	@brief Adds ECP8 instance Q to ECP8 instance P
+ *
+	@param P ECP8 instance, on exit =P+Q
+	@param Q ECP8 instance to be added to P
+ */
+extern int ECP8_add(ECP8 *P, ECP8 *Q);
+/**	@brief Subtracts ECP instance Q from ECP8 instance P
+ *
+	@param P ECP8 instance, on exit =P-Q
+	@param Q ECP8 instance to be subtracted from P
+ */
+extern void ECP8_sub(ECP8 *P, ECP8 *Q);
+/**	@brief Multiplies an ECP8 instance P by a BIG, side-channel resistant
+ *
+	Uses fixed sized windows.
+	@param P ECP8 instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP8_mul(ECP8 *P, B288_60::BIG b);
+
+/**	@brief Calculates required Frobenius constants
+ *
+	Calculate Frobenius constants
+	@param F array of FP2 precalculated constants
+
+ */
+extern void ECP8_frob_constants(BLS48286::FP2 F[3]);
+
+/**	@brief Multiplies an ECP8 instance P by the internal modulus p^n, using precalculated Frobenius constants
+ *
+	Fast point multiplication using Frobenius
+	@param P ECP8 instance, on exit = p^n*P
+	@param F array of FP2 precalculated Frobenius constant
+	@param n power of prime
+
+ */
+extern void ECP8_frob(ECP8 *P, BLS48286::FP2 F[3], int n);
+
+/**	@brief Calculates P=Sigma b[i]*Q[i] for i=0 to 7
+ *
+	@param P ECP8 instance, on exit = Sigma b[i]*Q[i] for i=0 to 7
+	@param Q ECP8 array of 4 points
+	@param b BIG array of 4 multipliers
+ */
+extern void ECP8_mul16(ECP8 *P, ECP8 *Q, B288_60::BIG *b);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP8 multiplied by co-factor
+ */
+extern void ECP8_cfp(ECP8 *Q);
+
+/**	@brief Maps random FP8 to curve point in constant time
+ *
+	@param Q ECP8 instance 
+	@param x FP8 derived from hash
+ */
+extern void ECP8_map2point(ECP8 *Q, BLS48286::FP8 *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck 
+ *
+	@param Q ECP8 instance 
+	@param x Fp derived from hash
+ */
+extern void ECP8_hap2point(ECP8 *Q, B288_60::BIG  x);
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param P ECP8 instance of correct order
+	@param W OCTET byte array to be mapped
+ */
+extern void ECP8_mapit(ECP8 *P, octet *W);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP8 instance
+	@return 1 if point exists, else 0
+ */
+extern int ECP8_generator(ECP8 *G);
+
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp8_BLS48556.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp8_BLS48556.h
new file mode 100644
index 0000000..14d4041
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp8_BLS48556.h
@@ -0,0 +1,278 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP8_BLS48556_H
+#define ECP8_BLS48556_H
+
+#include "fp8_BLS48556.h"
+#include "config_curve_BLS48556.h"
+
+using namespace core;
+
+namespace BLS48556 {
+
+extern const B560_58::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B560_58::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+}
+
+namespace BLS48556 {
+
+/**
+	@brief ECP8 Structure - Elliptic Curve Point over quadratic extension field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag */
+    BLS48556::FP8 x;   /**< x-coordinate of point */
+    BLS48556::FP8 y;   /**< y-coordinate of point */
+    BLS48556::FP8 z;   /**< z-coordinate of point */
+} ECP8;
+
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;		/**< Elliptic curve B parameter */
+extern const B560_58::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B560_58::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B560_58::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B560_58::BIG CURVE_Bnx;   /**< Elliptic curve parameter */
+extern const B560_58::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+
+/* Generator point on G1 */
+extern const B560_58::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B560_58::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B560_58::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B560_58::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+/* ECP8 E(FP8) prototypes */
+/**	@brief Tests for ECP8 point equal to infinity
+ *
+	@param P ECP8 point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP8_isinf(ECP8 *P);
+/**	@brief Copy ECP8 point to another ECP8 point
+ *
+	@param P ECP8 instance, on exit = Q
+	@param Q ECP8 instance to be copied
+ */
+extern void ECP8_copy(ECP8 *P, ECP8 *Q);
+/**	@brief Set ECP8 to point-at-infinity
+ *
+	@param P ECP8 instance to be set to infinity
+ */
+extern void ECP8_inf(ECP8 *P);
+/**	@brief Tests for equality of two ECP8s
+ *
+	@param P ECP8 instance to be compared
+	@param Q ECP8 instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP8_equals(ECP8 *P, ECP8 *Q);
+
+/**	@brief Converts an ECP8 point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP8 instance to be converted to affine form
+ */
+extern void ECP8_affine(ECP8 *P);
+
+
+/**	@brief Extract x and y coordinates of an ECP8 point P
+ *
+	If x=y, returns only x
+	@param x FP8 on exit = x coordinate of point
+	@param y FP8 on exit = y coordinate of point (unless x=y)
+	@param P ECP8 instance (x,y)
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP8_get(BLS48556::FP8 *x, BLS48556::FP8 *y, ECP8 *P);
+/**	@brief Formats and outputs an ECP8 point to the console, converted to affine coordinates
+ *
+	@param P ECP8 instance to be printed
+ */
+extern void ECP8_output(ECP8 *P);
+
+/**	@brief Formats and outputs an ECP8 point to an octet string
+ *
+	The octet string is created in the form x|y or just x if compressed
+	Convert the real and imaginary parts of the x and y coordinates to big-endian base 256 form.
+	@param S output octet string
+	@param P ECP8 instance to be converted to an octet string
+    @param c true for compression
+ */
+extern void ECP8_toOctet(octet *S, ECP8 *P, bool c);
+/**	@brief Creates an ECP8 point from an octet string
+ *
+	The octet string is in the form x|y
+	The real and imaginary parts of the x and y coordinates are in big-endian base 256 form.
+	@param P ECP8 instance to be created from the octet string
+	@param S input octet string
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP8_fromOctet(ECP8 *P, octet *S);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x)=x^3+Ax+B
+	Used internally.
+	@param r FP8 value of f(x)
+	@param x FP8 instance
+ */
+extern void ECP8_rhs(BLS48556::FP8 *r, BLS48556::FP8 *x);
+/**	@brief Set ECP8 to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP8 instance to be set (x,y)
+	@param x FP8 x coordinate of point
+	@param y FP8 y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP8_set(ECP8 *P, BLS48556::FP8 *x, BLS48556::FP8 *y);
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Otherwise y coordinate is calculated from x.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+    @param s sign of y
+	@return 1 if point exists, else 0
+ */
+extern int ECP8_setx(ECP8 *P, BLS48556::FP8 *x,int s);
+/**	@brief Negation of an ECP8 point
+ *
+	@param P ECP8 instance, on exit = -P
+ */
+extern void ECP8_neg(ECP8 *P);
+
+/**	@brief Reduction of an ECP8 point
+ *
+	@param P ECP8 instance, on exit (x,y) are reduced wrt the modulus
+ */
+extern void ECP8_reduce(ECP8 *P);
+
+
+/**	@brief Doubles an ECP8 instance P
+ *
+	@param P ECP8 instance, on exit =2*P
+ */
+extern int ECP8_dbl(ECP8 *P);
+/**	@brief Adds ECP8 instance Q to ECP8 instance P
+ *
+	@param P ECP8 instance, on exit =P+Q
+	@param Q ECP8 instance to be added to P
+ */
+extern int ECP8_add(ECP8 *P, ECP8 *Q);
+/**	@brief Subtracts ECP instance Q from ECP8 instance P
+ *
+	@param P ECP8 instance, on exit =P-Q
+	@param Q ECP8 instance to be subtracted from P
+ */
+extern void ECP8_sub(ECP8 *P, ECP8 *Q);
+/**	@brief Multiplies an ECP8 instance P by a BIG, side-channel resistant
+ *
+	Uses fixed sized windows.
+	@param P ECP8 instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP8_mul(ECP8 *P, B560_58::BIG b);
+
+/**	@brief Calculates required Frobenius constants
+ *
+	Calculate Frobenius constants
+	@param F array of FP2 precalculated constants
+
+ */
+extern void ECP8_frob_constants(BLS48556::FP2 F[3]);
+
+/**	@brief Multiplies an ECP8 instance P by the internal modulus p^n, using precalculated Frobenius constants
+ *
+	Fast point multiplication using Frobenius
+	@param P ECP8 instance, on exit = p^n*P
+	@param F array of FP2 precalculated Frobenius constant
+	@param n power of prime
+
+ */
+extern void ECP8_frob(ECP8 *P, BLS48556::FP2 F[3], int n);
+
+/**	@brief Calculates P=Sigma b[i]*Q[i] for i=0 to 7
+ *
+	@param P ECP8 instance, on exit = Sigma b[i]*Q[i] for i=0 to 7
+	@param Q ECP8 array of 4 points
+	@param b BIG array of 4 multipliers
+ */
+extern void ECP8_mul16(ECP8 *P, ECP8 *Q, B560_58::BIG *b);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP8 multiplied by co-factor
+ */
+extern void ECP8_cfp(ECP8 *Q);
+
+/**	@brief Maps random FP8 to curve point in constant time
+ *
+	@param Q ECP8 instance 
+	@param x FP8 derived from hash
+ */
+extern void ECP8_map2point(ECP8 *Q, BLS48556::FP8 *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck 
+ *
+	@param Q ECP8 instance 
+	@param x Fp derived from hash
+ */
+extern void ECP8_hap2point(ECP8 *Q, B560_58::BIG  x);
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param P ECP8 instance of correct order
+	@param W OCTET byte array to be mapped
+ */
+extern void ECP8_mapit(ECP8 *P, octet *W);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP8 instance
+	@return 1 if point exists, else 0
+ */
+extern int ECP8_generator(ECP8 *G);
+
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp8_BLS48581.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp8_BLS48581.h
new file mode 100644
index 0000000..ddebefe
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp8_BLS48581.h
@@ -0,0 +1,278 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP8_BLS48581_H
+#define ECP8_BLS48581_H
+
+#include "fp8_BLS48581.h"
+#include "config_curve_BLS48581.h"
+
+using namespace core;
+
+namespace BLS48581 {
+
+extern const B584_60::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B584_60::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+}
+
+namespace BLS48581 {
+
+/**
+	@brief ECP8 Structure - Elliptic Curve Point over quadratic extension field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag */
+    BLS48581::FP8 x;   /**< x-coordinate of point */
+    BLS48581::FP8 y;   /**< y-coordinate of point */
+    BLS48581::FP8 z;   /**< z-coordinate of point */
+} ECP8;
+
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;		/**< Elliptic curve B parameter */
+extern const B584_60::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B584_60::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B584_60::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B584_60::BIG CURVE_Bnx;   /**< Elliptic curve parameter */
+extern const B584_60::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+
+/* Generator point on G1 */
+extern const B584_60::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B584_60::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B584_60::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B584_60::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+/* ECP8 E(FP8) prototypes */
+/**	@brief Tests for ECP8 point equal to infinity
+ *
+	@param P ECP8 point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP8_isinf(ECP8 *P);
+/**	@brief Copy ECP8 point to another ECP8 point
+ *
+	@param P ECP8 instance, on exit = Q
+	@param Q ECP8 instance to be copied
+ */
+extern void ECP8_copy(ECP8 *P, ECP8 *Q);
+/**	@brief Set ECP8 to point-at-infinity
+ *
+	@param P ECP8 instance to be set to infinity
+ */
+extern void ECP8_inf(ECP8 *P);
+/**	@brief Tests for equality of two ECP8s
+ *
+	@param P ECP8 instance to be compared
+	@param Q ECP8 instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP8_equals(ECP8 *P, ECP8 *Q);
+
+/**	@brief Converts an ECP8 point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP8 instance to be converted to affine form
+ */
+extern void ECP8_affine(ECP8 *P);
+
+
+/**	@brief Extract x and y coordinates of an ECP8 point P
+ *
+	If x=y, returns only x
+	@param x FP8 on exit = x coordinate of point
+	@param y FP8 on exit = y coordinate of point (unless x=y)
+	@param P ECP8 instance (x,y)
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP8_get(BLS48581::FP8 *x, BLS48581::FP8 *y, ECP8 *P);
+/**	@brief Formats and outputs an ECP8 point to the console, converted to affine coordinates
+ *
+	@param P ECP8 instance to be printed
+ */
+extern void ECP8_output(ECP8 *P);
+
+/**	@brief Formats and outputs an ECP8 point to an octet string
+ *
+	The octet string is created in the form x|y or just x if compressed
+	Convert the real and imaginary parts of the x and y coordinates to big-endian base 256 form.
+	@param S output octet string
+	@param P ECP8 instance to be converted to an octet string
+    @param c true for compression
+ */
+extern void ECP8_toOctet(octet *S, ECP8 *P, bool c);
+/**	@brief Creates an ECP8 point from an octet string
+ *
+	The octet string is in the form x|y
+	The real and imaginary parts of the x and y coordinates are in big-endian base 256 form.
+	@param P ECP8 instance to be created from the octet string
+	@param S input octet string
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP8_fromOctet(ECP8 *P, octet *S);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x)=x^3+Ax+B
+	Used internally.
+	@param r FP8 value of f(x)
+	@param x FP8 instance
+ */
+extern void ECP8_rhs(BLS48581::FP8 *r, BLS48581::FP8 *x);
+/**	@brief Set ECP8 to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP8 instance to be set (x,y)
+	@param x FP8 x coordinate of point
+	@param y FP8 y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP8_set(ECP8 *P, BLS48581::FP8 *x, BLS48581::FP8 *y);
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Otherwise y coordinate is calculated from x.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+    @param s sign of y
+	@return 1 if point exists, else 0
+ */
+extern int ECP8_setx(ECP8 *P, BLS48581::FP8 *x,int s);
+/**	@brief Negation of an ECP8 point
+ *
+	@param P ECP8 instance, on exit = -P
+ */
+extern void ECP8_neg(ECP8 *P);
+
+/**	@brief Reduction of an ECP8 point
+ *
+	@param P ECP8 instance, on exit (x,y) are reduced wrt the modulus
+ */
+extern void ECP8_reduce(ECP8 *P);
+
+
+/**	@brief Doubles an ECP8 instance P
+ *
+	@param P ECP8 instance, on exit =2*P
+ */
+extern int ECP8_dbl(ECP8 *P);
+/**	@brief Adds ECP8 instance Q to ECP8 instance P
+ *
+	@param P ECP8 instance, on exit =P+Q
+	@param Q ECP8 instance to be added to P
+ */
+extern int ECP8_add(ECP8 *P, ECP8 *Q);
+/**	@brief Subtracts ECP instance Q from ECP8 instance P
+ *
+	@param P ECP8 instance, on exit =P-Q
+	@param Q ECP8 instance to be subtracted from P
+ */
+extern void ECP8_sub(ECP8 *P, ECP8 *Q);
+/**	@brief Multiplies an ECP8 instance P by a BIG, side-channel resistant
+ *
+	Uses fixed sized windows.
+	@param P ECP8 instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP8_mul(ECP8 *P, B584_60::BIG b);
+
+/**	@brief Calculates required Frobenius constants
+ *
+	Calculate Frobenius constants
+	@param F array of FP2 precalculated constants
+
+ */
+extern void ECP8_frob_constants(BLS48581::FP2 F[3]);
+
+/**	@brief Multiplies an ECP8 instance P by the internal modulus p^n, using precalculated Frobenius constants
+ *
+	Fast point multiplication using Frobenius
+	@param P ECP8 instance, on exit = p^n*P
+	@param F array of FP2 precalculated Frobenius constant
+	@param n power of prime
+
+ */
+extern void ECP8_frob(ECP8 *P, BLS48581::FP2 F[3], int n);
+
+/**	@brief Calculates P=Sigma b[i]*Q[i] for i=0 to 7
+ *
+	@param P ECP8 instance, on exit = Sigma b[i]*Q[i] for i=0 to 7
+	@param Q ECP8 array of 4 points
+	@param b BIG array of 4 multipliers
+ */
+extern void ECP8_mul16(ECP8 *P, ECP8 *Q, B584_60::BIG *b);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP8 multiplied by co-factor
+ */
+extern void ECP8_cfp(ECP8 *Q);
+
+/**	@brief Maps random FP8 to curve point in constant time
+ *
+	@param Q ECP8 instance 
+	@param x FP8 derived from hash
+ */
+extern void ECP8_map2point(ECP8 *Q, BLS48581::FP8 *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck 
+ *
+	@param Q ECP8 instance 
+	@param x Fp derived from hash
+ */
+extern void ECP8_hap2point(ECP8 *Q, B584_60::BIG  x);
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param P ECP8 instance of correct order
+	@param W OCTET byte array to be mapped
+ */
+extern void ECP8_mapit(ECP8 *P, octet *W);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP8 instance
+	@return 1 if point exists, else 0
+ */
+extern int ECP8_generator(ECP8 *G);
+
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_ANSSI.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_ANSSI.h
new file mode 100644
index 0000000..176ee14
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_ANSSI.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_ANSSI_H
+#define ECP_ANSSI_H
+
+#include "fp_ANSSI.h"
+#include "config_curve_ANSSI.h"
+
+using namespace core;
+
+namespace ANSSI {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B256_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B256_56::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B256_56::BIG CURVE_Ad;
+extern const B256_56::BIG CURVE_Bd;
+extern const B256_56::BIG PC[];
+
+extern const B256_56::BIG CURVE_Adr;
+extern const B256_56::BIG CURVE_Adi;
+extern const B256_56::BIG CURVE_Bdr;
+extern const B256_56::BIG CURVE_Bdi;
+extern const B256_56::BIG PCR[];
+extern const B256_56::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B256_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B256_56::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B256_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B256_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B256_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    ANSSI::FP x; /**< x-coordinate of point */
+#if CURVETYPE_ANSSI!=MONTGOMERY
+    ANSSI::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    ANSSI::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(ANSSI::FP *r, ANSSI::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B256_56::BIG x, int s);
+
+#if CURVETYPE_ANSSI==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B256_56::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x, B256_56::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B256_56::BIG x, B256_56::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B256_56::BIG e, B256_56::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B256_56::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f, B256_56::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B256_56::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, ANSSI::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B256_56::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_BLS12381.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_BLS12381.h
new file mode 100644
index 0000000..8a5f68e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_BLS12381.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_BLS12381_H
+#define ECP_BLS12381_H
+
+#include "fp_BLS12381.h"
+#include "config_curve_BLS12381.h"
+
+using namespace core;
+
+namespace BLS12381 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B384_58::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B384_58::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B384_58::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B384_58::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B384_58::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B384_58::BIG CURVE_Ad;
+extern const B384_58::BIG CURVE_Bd;
+extern const B384_58::BIG PC[];
+
+extern const B384_58::BIG CURVE_Adr;
+extern const B384_58::BIG CURVE_Adi;
+extern const B384_58::BIG CURVE_Bdr;
+extern const B384_58::BIG CURVE_Bdi;
+extern const B384_58::BIG PCR[];
+extern const B384_58::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B384_58::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B384_58::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B384_58::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B384_58::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B384_58::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B384_58::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B384_58::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B384_58::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B384_58::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B384_58::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B384_58::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B384_58::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B384_58::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    BLS12381::FP x; /**< x-coordinate of point */
+#if CURVETYPE_BLS12381!=MONTGOMERY
+    BLS12381::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    BLS12381::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(BLS12381::FP *r, BLS12381::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B384_58::BIG x, int s);
+
+#if CURVETYPE_BLS12381==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B384_58::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B384_58::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B384_58::BIG x, B384_58::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B384_58::BIG x, B384_58::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B384_58::BIG e, B384_58::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B384_58::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B384_58::BIG e, B384_58::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B384_58::BIG e, B384_58::BIG f, B384_58::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B384_58::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, BLS12381::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B384_58::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_BLS12383.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_BLS12383.h
new file mode 100644
index 0000000..733fde1
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_BLS12383.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_BLS12383_H
+#define ECP_BLS12383_H
+
+#include "fp_BLS12383.h"
+#include "config_curve_BLS12383.h"
+
+using namespace core;
+
+namespace BLS12383 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B384_58::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B384_58::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B384_58::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B384_58::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B384_58::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B384_58::BIG CURVE_Ad;
+extern const B384_58::BIG CURVE_Bd;
+extern const B384_58::BIG PC[];
+
+extern const B384_58::BIG CURVE_Adr;
+extern const B384_58::BIG CURVE_Adi;
+extern const B384_58::BIG CURVE_Bdr;
+extern const B384_58::BIG CURVE_Bdi;
+extern const B384_58::BIG PCR[];
+extern const B384_58::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B384_58::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B384_58::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B384_58::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B384_58::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B384_58::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B384_58::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B384_58::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B384_58::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B384_58::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B384_58::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B384_58::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B384_58::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B384_58::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    BLS12383::FP x; /**< x-coordinate of point */
+#if CURVETYPE_BLS12383!=MONTGOMERY
+    BLS12383::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    BLS12383::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(BLS12383::FP *r, BLS12383::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B384_58::BIG x, int s);
+
+#if CURVETYPE_BLS12383==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B384_58::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B384_58::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B384_58::BIG x, B384_58::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B384_58::BIG x, B384_58::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B384_58::BIG e, B384_58::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B384_58::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B384_58::BIG e, B384_58::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B384_58::BIG e, B384_58::BIG f, B384_58::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B384_58::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, BLS12383::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B384_58::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_BLS12443.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_BLS12443.h
new file mode 100644
index 0000000..b2c1265
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_BLS12443.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_BLS12443_H
+#define ECP_BLS12443_H
+
+#include "fp_BLS12443.h"
+#include "config_curve_BLS12443.h"
+
+using namespace core;
+
+namespace BLS12443 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B448_60::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B448_60::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B448_60::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B448_60::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B448_60::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B448_60::BIG CURVE_Ad;
+extern const B448_60::BIG CURVE_Bd;
+extern const B448_60::BIG PC[];
+
+extern const B448_60::BIG CURVE_Adr;
+extern const B448_60::BIG CURVE_Adi;
+extern const B448_60::BIG CURVE_Bdr;
+extern const B448_60::BIG CURVE_Bdi;
+extern const B448_60::BIG PCR[];
+extern const B448_60::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B448_60::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B448_60::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B448_60::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B448_60::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B448_60::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B448_60::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B448_60::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B448_60::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B448_60::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B448_60::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B448_60::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B448_60::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B448_60::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    BLS12443::FP x; /**< x-coordinate of point */
+#if CURVETYPE_BLS12443!=MONTGOMERY
+    BLS12443::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    BLS12443::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(BLS12443::FP *r, BLS12443::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B448_60::BIG x, int s);
+
+#if CURVETYPE_BLS12443==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B448_60::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B448_60::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B448_60::BIG x, B448_60::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B448_60::BIG x, B448_60::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B448_60::BIG e, B448_60::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B448_60::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B448_60::BIG e, B448_60::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B448_60::BIG e, B448_60::BIG f, B448_60::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B448_60::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, BLS12443::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B448_60::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_BLS12461.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_BLS12461.h
new file mode 100644
index 0000000..1018610
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_BLS12461.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_BLS12461_H
+#define ECP_BLS12461_H
+
+#include "fp_BLS12461.h"
+#include "config_curve_BLS12461.h"
+
+using namespace core;
+
+namespace BLS12461 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B464_60::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B464_60::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B464_60::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B464_60::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B464_60::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B464_60::BIG CURVE_Ad;
+extern const B464_60::BIG CURVE_Bd;
+extern const B464_60::BIG PC[];
+
+extern const B464_60::BIG CURVE_Adr;
+extern const B464_60::BIG CURVE_Adi;
+extern const B464_60::BIG CURVE_Bdr;
+extern const B464_60::BIG CURVE_Bdi;
+extern const B464_60::BIG PCR[];
+extern const B464_60::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B464_60::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B464_60::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B464_60::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B464_60::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B464_60::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B464_60::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B464_60::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B464_60::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B464_60::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B464_60::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B464_60::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B464_60::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B464_60::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    BLS12461::FP x; /**< x-coordinate of point */
+#if CURVETYPE_BLS12461!=MONTGOMERY
+    BLS12461::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    BLS12461::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(BLS12461::FP *r, BLS12461::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B464_60::BIG x, int s);
+
+#if CURVETYPE_BLS12461==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B464_60::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B464_60::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B464_60::BIG x, B464_60::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B464_60::BIG x, B464_60::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B464_60::BIG e, B464_60::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B464_60::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B464_60::BIG e, B464_60::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B464_60::BIG e, B464_60::BIG f, B464_60::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B464_60::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, BLS12461::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B464_60::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_BLS24479.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_BLS24479.h
new file mode 100644
index 0000000..e68501f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_BLS24479.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_BLS24479_H
+#define ECP_BLS24479_H
+
+#include "fp_BLS24479.h"
+#include "config_curve_BLS24479.h"
+
+using namespace core;
+
+namespace BLS24479 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B480_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B480_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B480_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B480_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B480_56::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B480_56::BIG CURVE_Ad;
+extern const B480_56::BIG CURVE_Bd;
+extern const B480_56::BIG PC[];
+
+extern const B480_56::BIG CURVE_Adr;
+extern const B480_56::BIG CURVE_Adi;
+extern const B480_56::BIG CURVE_Bdr;
+extern const B480_56::BIG CURVE_Bdi;
+extern const B480_56::BIG PCR[];
+extern const B480_56::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B480_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B480_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B480_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B480_56::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B480_56::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B480_56::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B480_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B480_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B480_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B480_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B480_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B480_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B480_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    BLS24479::FP x; /**< x-coordinate of point */
+#if CURVETYPE_BLS24479!=MONTGOMERY
+    BLS24479::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    BLS24479::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(BLS24479::FP *r, BLS24479::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B480_56::BIG x, int s);
+
+#if CURVETYPE_BLS24479==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B480_56::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B480_56::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B480_56::BIG x, B480_56::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B480_56::BIG x, B480_56::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B480_56::BIG e, B480_56::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B480_56::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B480_56::BIG e, B480_56::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B480_56::BIG e, B480_56::BIG f, B480_56::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B480_56::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, BLS24479::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B480_56::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_BLS48286.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_BLS48286.h
new file mode 100644
index 0000000..0647689
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_BLS48286.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_BLS48286_H
+#define ECP_BLS48286_H
+
+#include "fp_BLS48286.h"
+#include "config_curve_BLS48286.h"
+
+using namespace core;
+
+namespace BLS48286 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B288_60::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B288_60::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B288_60::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B288_60::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B288_60::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B288_60::BIG CURVE_Ad;
+extern const B288_60::BIG CURVE_Bd;
+extern const B288_60::BIG PC[];
+
+extern const B288_60::BIG CURVE_Adr;
+extern const B288_60::BIG CURVE_Adi;
+extern const B288_60::BIG CURVE_Bdr;
+extern const B288_60::BIG CURVE_Bdi;
+extern const B288_60::BIG PCR[];
+extern const B288_60::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B288_60::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B288_60::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B288_60::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B288_60::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B288_60::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B288_60::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B288_60::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B288_60::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B288_60::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B288_60::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B288_60::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B288_60::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B288_60::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    BLS48286::FP x; /**< x-coordinate of point */
+#if CURVETYPE_BLS48286!=MONTGOMERY
+    BLS48286::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    BLS48286::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(BLS48286::FP *r, BLS48286::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B288_60::BIG x, int s);
+
+#if CURVETYPE_BLS48286==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B288_60::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B288_60::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B288_60::BIG x, B288_60::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B288_60::BIG x, B288_60::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B288_60::BIG e, B288_60::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B288_60::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B288_60::BIG e, B288_60::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B288_60::BIG e, B288_60::BIG f, B288_60::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B288_60::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, BLS48286::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B288_60::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_BLS48556.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_BLS48556.h
new file mode 100644
index 0000000..7834b20
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_BLS48556.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_BLS48556_H
+#define ECP_BLS48556_H
+
+#include "fp_BLS48556.h"
+#include "config_curve_BLS48556.h"
+
+using namespace core;
+
+namespace BLS48556 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B560_58::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B560_58::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B560_58::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B560_58::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B560_58::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B560_58::BIG CURVE_Ad;
+extern const B560_58::BIG CURVE_Bd;
+extern const B560_58::BIG PC[];
+
+extern const B560_58::BIG CURVE_Adr;
+extern const B560_58::BIG CURVE_Adi;
+extern const B560_58::BIG CURVE_Bdr;
+extern const B560_58::BIG CURVE_Bdi;
+extern const B560_58::BIG PCR[];
+extern const B560_58::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B560_58::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B560_58::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B560_58::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B560_58::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B560_58::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B560_58::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B560_58::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B560_58::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B560_58::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B560_58::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B560_58::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B560_58::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B560_58::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    BLS48556::FP x; /**< x-coordinate of point */
+#if CURVETYPE_BLS48556!=MONTGOMERY
+    BLS48556::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    BLS48556::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(BLS48556::FP *r, BLS48556::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B560_58::BIG x, int s);
+
+#if CURVETYPE_BLS48556==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B560_58::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B560_58::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B560_58::BIG x, B560_58::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B560_58::BIG x, B560_58::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B560_58::BIG e, B560_58::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B560_58::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B560_58::BIG e, B560_58::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B560_58::BIG e, B560_58::BIG f, B560_58::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B560_58::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, BLS48556::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B560_58::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_BLS48581.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_BLS48581.h
new file mode 100644
index 0000000..9c3e94b
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_BLS48581.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_BLS48581_H
+#define ECP_BLS48581_H
+
+#include "fp_BLS48581.h"
+#include "config_curve_BLS48581.h"
+
+using namespace core;
+
+namespace BLS48581 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B584_60::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B584_60::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B584_60::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B584_60::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B584_60::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B584_60::BIG CURVE_Ad;
+extern const B584_60::BIG CURVE_Bd;
+extern const B584_60::BIG PC[];
+
+extern const B584_60::BIG CURVE_Adr;
+extern const B584_60::BIG CURVE_Adi;
+extern const B584_60::BIG CURVE_Bdr;
+extern const B584_60::BIG CURVE_Bdi;
+extern const B584_60::BIG PCR[];
+extern const B584_60::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B584_60::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B584_60::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B584_60::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B584_60::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B584_60::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B584_60::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B584_60::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B584_60::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B584_60::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B584_60::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B584_60::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B584_60::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B584_60::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    BLS48581::FP x; /**< x-coordinate of point */
+#if CURVETYPE_BLS48581!=MONTGOMERY
+    BLS48581::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    BLS48581::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(BLS48581::FP *r, BLS48581::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B584_60::BIG x, int s);
+
+#if CURVETYPE_BLS48581==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B584_60::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B584_60::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B584_60::BIG x, B584_60::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B584_60::BIG x, B584_60::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B584_60::BIG e, B584_60::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B584_60::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B584_60::BIG e, B584_60::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B584_60::BIG e, B584_60::BIG f, B584_60::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B584_60::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, BLS48581::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B584_60::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_BN158.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_BN158.h
new file mode 100644
index 0000000..1d926de
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_BN158.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_BN158_H
+#define ECP_BN158_H
+
+#include "fp_BN158.h"
+#include "config_curve_BN158.h"
+
+using namespace core;
+
+namespace BN158 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B160_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B160_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B160_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B160_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B160_56::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B160_56::BIG CURVE_Ad;
+extern const B160_56::BIG CURVE_Bd;
+extern const B160_56::BIG PC[];
+
+extern const B160_56::BIG CURVE_Adr;
+extern const B160_56::BIG CURVE_Adi;
+extern const B160_56::BIG CURVE_Bdr;
+extern const B160_56::BIG CURVE_Bdi;
+extern const B160_56::BIG PCR[];
+extern const B160_56::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B160_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B160_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B160_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B160_56::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B160_56::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B160_56::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B160_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B160_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B160_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B160_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B160_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B160_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B160_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    BN158::FP x; /**< x-coordinate of point */
+#if CURVETYPE_BN158!=MONTGOMERY
+    BN158::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    BN158::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(BN158::FP *r, BN158::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B160_56::BIG x, int s);
+
+#if CURVETYPE_BN158==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B160_56::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B160_56::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B160_56::BIG x, B160_56::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B160_56::BIG x, B160_56::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B160_56::BIG e, B160_56::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B160_56::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B160_56::BIG e, B160_56::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B160_56::BIG e, B160_56::BIG f, B160_56::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B160_56::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, BN158::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B160_56::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_BN254.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_BN254.h
new file mode 100644
index 0000000..ce46807
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_BN254.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_BN254_H
+#define ECP_BN254_H
+
+#include "fp_BN254.h"
+#include "config_curve_BN254.h"
+
+using namespace core;
+
+namespace BN254 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B256_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B256_56::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B256_56::BIG CURVE_Ad;
+extern const B256_56::BIG CURVE_Bd;
+extern const B256_56::BIG PC[];
+
+extern const B256_56::BIG CURVE_Adr;
+extern const B256_56::BIG CURVE_Adi;
+extern const B256_56::BIG CURVE_Bdr;
+extern const B256_56::BIG CURVE_Bdi;
+extern const B256_56::BIG PCR[];
+extern const B256_56::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B256_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B256_56::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B256_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B256_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B256_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    BN254::FP x; /**< x-coordinate of point */
+#if CURVETYPE_BN254!=MONTGOMERY
+    BN254::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    BN254::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(BN254::FP *r, BN254::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B256_56::BIG x, int s);
+
+#if CURVETYPE_BN254==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B256_56::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x, B256_56::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B256_56::BIG x, B256_56::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B256_56::BIG e, B256_56::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B256_56::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f, B256_56::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B256_56::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, BN254::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B256_56::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_BN254CX.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_BN254CX.h
new file mode 100644
index 0000000..5430206
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_BN254CX.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_BN254CX_H
+#define ECP_BN254CX_H
+
+#include "fp_BN254CX.h"
+#include "config_curve_BN254CX.h"
+
+using namespace core;
+
+namespace BN254CX {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B256_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B256_56::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B256_56::BIG CURVE_Ad;
+extern const B256_56::BIG CURVE_Bd;
+extern const B256_56::BIG PC[];
+
+extern const B256_56::BIG CURVE_Adr;
+extern const B256_56::BIG CURVE_Adi;
+extern const B256_56::BIG CURVE_Bdr;
+extern const B256_56::BIG CURVE_Bdi;
+extern const B256_56::BIG PCR[];
+extern const B256_56::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B256_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B256_56::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B256_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B256_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B256_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    BN254CX::FP x; /**< x-coordinate of point */
+#if CURVETYPE_BN254CX!=MONTGOMERY
+    BN254CX::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    BN254CX::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(BN254CX::FP *r, BN254CX::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B256_56::BIG x, int s);
+
+#if CURVETYPE_BN254CX==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B256_56::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x, B256_56::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B256_56::BIG x, B256_56::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B256_56::BIG e, B256_56::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B256_56::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f, B256_56::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B256_56::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, BN254CX::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B256_56::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_BN462.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_BN462.h
new file mode 100644
index 0000000..ebbb40e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_BN462.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_BN462_H
+#define ECP_BN462_H
+
+#include "fp_BN462.h"
+#include "config_curve_BN462.h"
+
+using namespace core;
+
+namespace BN462 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B464_60::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B464_60::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B464_60::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B464_60::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B464_60::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B464_60::BIG CURVE_Ad;
+extern const B464_60::BIG CURVE_Bd;
+extern const B464_60::BIG PC[];
+
+extern const B464_60::BIG CURVE_Adr;
+extern const B464_60::BIG CURVE_Adi;
+extern const B464_60::BIG CURVE_Bdr;
+extern const B464_60::BIG CURVE_Bdi;
+extern const B464_60::BIG PCR[];
+extern const B464_60::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B464_60::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B464_60::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B464_60::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B464_60::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B464_60::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B464_60::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B464_60::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B464_60::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B464_60::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B464_60::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B464_60::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B464_60::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B464_60::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    BN462::FP x; /**< x-coordinate of point */
+#if CURVETYPE_BN462!=MONTGOMERY
+    BN462::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    BN462::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(BN462::FP *r, BN462::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B464_60::BIG x, int s);
+
+#if CURVETYPE_BN462==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B464_60::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B464_60::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B464_60::BIG x, B464_60::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B464_60::BIG x, B464_60::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B464_60::BIG e, B464_60::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B464_60::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B464_60::BIG e, B464_60::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B464_60::BIG e, B464_60::BIG f, B464_60::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B464_60::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, BN462::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B464_60::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_BRAINPOOL.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_BRAINPOOL.h
new file mode 100644
index 0000000..75e9eb9
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_BRAINPOOL.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_BRAINPOOL_H
+#define ECP_BRAINPOOL_H
+
+#include "fp_BRAINPOOL.h"
+#include "config_curve_BRAINPOOL.h"
+
+using namespace core;
+
+namespace BRAINPOOL {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B256_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B256_56::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B256_56::BIG CURVE_Ad;
+extern const B256_56::BIG CURVE_Bd;
+extern const B256_56::BIG PC[];
+
+extern const B256_56::BIG CURVE_Adr;
+extern const B256_56::BIG CURVE_Adi;
+extern const B256_56::BIG CURVE_Bdr;
+extern const B256_56::BIG CURVE_Bdi;
+extern const B256_56::BIG PCR[];
+extern const B256_56::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B256_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B256_56::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B256_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B256_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B256_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    BRAINPOOL::FP x; /**< x-coordinate of point */
+#if CURVETYPE_BRAINPOOL!=MONTGOMERY
+    BRAINPOOL::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    BRAINPOOL::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(BRAINPOOL::FP *r, BRAINPOOL::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B256_56::BIG x, int s);
+
+#if CURVETYPE_BRAINPOOL==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B256_56::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x, B256_56::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B256_56::BIG x, B256_56::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B256_56::BIG e, B256_56::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B256_56::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f, B256_56::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B256_56::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, BRAINPOOL::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B256_56::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_C1174.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_C1174.h
new file mode 100644
index 0000000..86ce027
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_C1174.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_C1174_H
+#define ECP_C1174_H
+
+#include "fp_C1174.h"
+#include "config_curve_C1174.h"
+
+using namespace core;
+
+namespace C1174 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B256_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B256_56::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B256_56::BIG CURVE_Ad;
+extern const B256_56::BIG CURVE_Bd;
+extern const B256_56::BIG PC[];
+
+extern const B256_56::BIG CURVE_Adr;
+extern const B256_56::BIG CURVE_Adi;
+extern const B256_56::BIG CURVE_Bdr;
+extern const B256_56::BIG CURVE_Bdi;
+extern const B256_56::BIG PCR[];
+extern const B256_56::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B256_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B256_56::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B256_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B256_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B256_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    C1174::FP x; /**< x-coordinate of point */
+#if CURVETYPE_C1174!=MONTGOMERY
+    C1174::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    C1174::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(C1174::FP *r, C1174::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B256_56::BIG x, int s);
+
+#if CURVETYPE_C1174==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B256_56::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x, B256_56::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B256_56::BIG x, B256_56::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B256_56::BIG e, B256_56::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B256_56::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f, B256_56::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B256_56::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, C1174::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B256_56::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_C13318.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_C13318.h
new file mode 100644
index 0000000..8e8e598
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_C13318.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_C13318_H
+#define ECP_C13318_H
+
+#include "fp_F25519.h"
+#include "config_curve_C13318.h"
+
+using namespace core;
+
+namespace C13318 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B256_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B256_56::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B256_56::BIG CURVE_Ad;
+extern const B256_56::BIG CURVE_Bd;
+extern const B256_56::BIG PC[];
+
+extern const B256_56::BIG CURVE_Adr;
+extern const B256_56::BIG CURVE_Adi;
+extern const B256_56::BIG CURVE_Bdr;
+extern const B256_56::BIG CURVE_Bdi;
+extern const B256_56::BIG PCR[];
+extern const B256_56::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B256_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B256_56::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B256_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B256_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B256_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    F25519::FP x; /**< x-coordinate of point */
+#if CURVETYPE_C13318!=MONTGOMERY
+    F25519::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    F25519::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(F25519::FP *r, F25519::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B256_56::BIG x, int s);
+
+#if CURVETYPE_C13318==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B256_56::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x, B256_56::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B256_56::BIG x, B256_56::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B256_56::BIG e, B256_56::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B256_56::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f, B256_56::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B256_56::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, F25519::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B256_56::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_C1665.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_C1665.h
new file mode 100644
index 0000000..9b9e8a9
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_C1665.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_C1665_H
+#define ECP_C1665_H
+
+#include "fp_C1665.h"
+#include "config_curve_C1665.h"
+
+using namespace core;
+
+namespace C1665 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B168_60::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B168_60::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B168_60::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B168_60::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B168_60::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B168_60::BIG CURVE_Ad;
+extern const B168_60::BIG CURVE_Bd;
+extern const B168_60::BIG PC[];
+
+extern const B168_60::BIG CURVE_Adr;
+extern const B168_60::BIG CURVE_Adi;
+extern const B168_60::BIG CURVE_Bdr;
+extern const B168_60::BIG CURVE_Bdi;
+extern const B168_60::BIG PCR[];
+extern const B168_60::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B168_60::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B168_60::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B168_60::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B168_60::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B168_60::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B168_60::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B168_60::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B168_60::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B168_60::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B168_60::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B168_60::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B168_60::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B168_60::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B168_60::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B168_60::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B168_60::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B168_60::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B168_60::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B168_60::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B168_60::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B168_60::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B168_60::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B168_60::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B168_60::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B168_60::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B168_60::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B168_60::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B168_60::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B168_60::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B168_60::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B168_60::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B168_60::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B168_60::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B168_60::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B168_60::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B168_60::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B168_60::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    C1665::FP x; /**< x-coordinate of point */
+#if CURVETYPE_C1665!=MONTGOMERY
+    C1665::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    C1665::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(C1665::FP *r, C1665::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B168_60::BIG x, int s);
+
+#if CURVETYPE_C1665==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B168_60::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B168_60::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B168_60::BIG x, B168_60::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B168_60::BIG x, B168_60::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B168_60::BIG e, B168_60::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B168_60::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B168_60::BIG e, B168_60::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B168_60::BIG e, B168_60::BIG f, B168_60::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B168_60::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, C1665::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B168_60::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_C25519.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_C25519.h
new file mode 100644
index 0000000..7079636
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_C25519.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_C25519_H
+#define ECP_C25519_H
+
+#include "fp_F25519.h"
+#include "config_curve_C25519.h"
+
+using namespace core;
+
+namespace C25519 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B256_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B256_56::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B256_56::BIG CURVE_Ad;
+extern const B256_56::BIG CURVE_Bd;
+extern const B256_56::BIG PC[];
+
+extern const B256_56::BIG CURVE_Adr;
+extern const B256_56::BIG CURVE_Adi;
+extern const B256_56::BIG CURVE_Bdr;
+extern const B256_56::BIG CURVE_Bdi;
+extern const B256_56::BIG PCR[];
+extern const B256_56::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B256_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B256_56::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B256_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B256_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B256_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    F25519::FP x; /**< x-coordinate of point */
+#if CURVETYPE_C25519!=MONTGOMERY
+    F25519::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    F25519::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(F25519::FP *r, F25519::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B256_56::BIG x, int s);
+
+#if CURVETYPE_C25519==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B256_56::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x, B256_56::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B256_56::BIG x, B256_56::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B256_56::BIG e, B256_56::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B256_56::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f, B256_56::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B256_56::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, F25519::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B256_56::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_C41417.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_C41417.h
new file mode 100644
index 0000000..5e7ada0
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_C41417.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_C41417_H
+#define ECP_C41417_H
+
+#include "fp_C41417.h"
+#include "config_curve_C41417.h"
+
+using namespace core;
+
+namespace C41417 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B416_60::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B416_60::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B416_60::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B416_60::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B416_60::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B416_60::BIG CURVE_Ad;
+extern const B416_60::BIG CURVE_Bd;
+extern const B416_60::BIG PC[];
+
+extern const B416_60::BIG CURVE_Adr;
+extern const B416_60::BIG CURVE_Adi;
+extern const B416_60::BIG CURVE_Bdr;
+extern const B416_60::BIG CURVE_Bdi;
+extern const B416_60::BIG PCR[];
+extern const B416_60::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B416_60::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B416_60::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B416_60::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B416_60::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B416_60::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B416_60::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B416_60::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B416_60::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B416_60::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B416_60::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B416_60::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B416_60::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B416_60::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B416_60::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B416_60::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B416_60::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B416_60::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B416_60::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B416_60::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B416_60::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B416_60::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B416_60::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B416_60::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B416_60::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B416_60::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B416_60::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B416_60::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B416_60::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B416_60::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B416_60::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B416_60::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B416_60::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B416_60::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B416_60::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B416_60::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B416_60::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B416_60::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    C41417::FP x; /**< x-coordinate of point */
+#if CURVETYPE_C41417!=MONTGOMERY
+    C41417::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    C41417::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(C41417::FP *r, C41417::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B416_60::BIG x, int s);
+
+#if CURVETYPE_C41417==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B416_60::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B416_60::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B416_60::BIG x, B416_60::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B416_60::BIG x, B416_60::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B416_60::BIG e, B416_60::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B416_60::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B416_60::BIG e, B416_60::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B416_60::BIG e, B416_60::BIG f, B416_60::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B416_60::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, C41417::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B416_60::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_Ed25519.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_Ed25519.h
new file mode 100644
index 0000000..99b699b
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_Ed25519.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_Ed25519_H
+#define ECP_Ed25519_H
+
+#include "fp_F25519.h"
+#include "config_curve_Ed25519.h"
+
+using namespace core;
+
+namespace Ed25519 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B256_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B256_56::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B256_56::BIG CURVE_Ad;
+extern const B256_56::BIG CURVE_Bd;
+extern const B256_56::BIG PC[];
+
+extern const B256_56::BIG CURVE_Adr;
+extern const B256_56::BIG CURVE_Adi;
+extern const B256_56::BIG CURVE_Bdr;
+extern const B256_56::BIG CURVE_Bdi;
+extern const B256_56::BIG PCR[];
+extern const B256_56::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B256_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B256_56::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B256_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B256_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B256_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    F25519::FP x; /**< x-coordinate of point */
+#if CURVETYPE_Ed25519!=MONTGOMERY
+    F25519::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    F25519::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(F25519::FP *r, F25519::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B256_56::BIG x, int s);
+
+#if CURVETYPE_Ed25519==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B256_56::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x, B256_56::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B256_56::BIG x, B256_56::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B256_56::BIG e, B256_56::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B256_56::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f, B256_56::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B256_56::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, F25519::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B256_56::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_Ed448.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_Ed448.h
new file mode 100644
index 0000000..c42afc3
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_Ed448.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_Ed448_H
+#define ECP_Ed448_H
+
+#include "fp_F448.h"
+#include "config_curve_Ed448.h"
+
+using namespace core;
+
+namespace Ed448 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B448_58::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B448_58::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B448_58::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B448_58::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B448_58::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B448_58::BIG CURVE_Ad;
+extern const B448_58::BIG CURVE_Bd;
+extern const B448_58::BIG PC[];
+
+extern const B448_58::BIG CURVE_Adr;
+extern const B448_58::BIG CURVE_Adi;
+extern const B448_58::BIG CURVE_Bdr;
+extern const B448_58::BIG CURVE_Bdi;
+extern const B448_58::BIG PCR[];
+extern const B448_58::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B448_58::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B448_58::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B448_58::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B448_58::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B448_58::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B448_58::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B448_58::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B448_58::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B448_58::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B448_58::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B448_58::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B448_58::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B448_58::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    F448::FP x; /**< x-coordinate of point */
+#if CURVETYPE_Ed448!=MONTGOMERY
+    F448::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    F448::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(F448::FP *r, F448::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B448_58::BIG x, int s);
+
+#if CURVETYPE_Ed448==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B448_58::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B448_58::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B448_58::BIG x, B448_58::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B448_58::BIG x, B448_58::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B448_58::BIG e, B448_58::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B448_58::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B448_58::BIG e, B448_58::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B448_58::BIG e, B448_58::BIG f, B448_58::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B448_58::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, F448::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B448_58::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_FP256BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_FP256BN.h
new file mode 100644
index 0000000..9d2a861
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_FP256BN.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_FP256BN_H
+#define ECP_FP256BN_H
+
+#include "fp_FP256BN.h"
+#include "config_curve_FP256BN.h"
+
+using namespace core;
+
+namespace FP256BN {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B256_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B256_56::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B256_56::BIG CURVE_Ad;
+extern const B256_56::BIG CURVE_Bd;
+extern const B256_56::BIG PC[];
+
+extern const B256_56::BIG CURVE_Adr;
+extern const B256_56::BIG CURVE_Adi;
+extern const B256_56::BIG CURVE_Bdr;
+extern const B256_56::BIG CURVE_Bdi;
+extern const B256_56::BIG PCR[];
+extern const B256_56::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B256_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B256_56::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B256_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B256_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B256_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    FP256BN::FP x; /**< x-coordinate of point */
+#if CURVETYPE_FP256BN!=MONTGOMERY
+    FP256BN::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    FP256BN::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(FP256BN::FP *r, FP256BN::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B256_56::BIG x, int s);
+
+#if CURVETYPE_FP256BN==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B256_56::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x, B256_56::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B256_56::BIG x, B256_56::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B256_56::BIG e, B256_56::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B256_56::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f, B256_56::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B256_56::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, FP256BN::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B256_56::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_FP512BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_FP512BN.h
new file mode 100644
index 0000000..975dfe1
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_FP512BN.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_FP512BN_H
+#define ECP_FP512BN_H
+
+#include "fp_FP512BN.h"
+#include "config_curve_FP512BN.h"
+
+using namespace core;
+
+namespace FP512BN {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B512_60::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B512_60::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B512_60::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B512_60::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B512_60::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B512_60::BIG CURVE_Ad;
+extern const B512_60::BIG CURVE_Bd;
+extern const B512_60::BIG PC[];
+
+extern const B512_60::BIG CURVE_Adr;
+extern const B512_60::BIG CURVE_Adi;
+extern const B512_60::BIG CURVE_Bdr;
+extern const B512_60::BIG CURVE_Bdi;
+extern const B512_60::BIG PCR[];
+extern const B512_60::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B512_60::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B512_60::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B512_60::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B512_60::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B512_60::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B512_60::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B512_60::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B512_60::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B512_60::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B512_60::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B512_60::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B512_60::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B512_60::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    FP512BN::FP x; /**< x-coordinate of point */
+#if CURVETYPE_FP512BN!=MONTGOMERY
+    FP512BN::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    FP512BN::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(FP512BN::FP *r, FP512BN::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B512_60::BIG x, int s);
+
+#if CURVETYPE_FP512BN==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B512_60::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B512_60::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B512_60::BIG x, B512_60::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B512_60::BIG x, B512_60::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B512_60::BIG e, B512_60::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B512_60::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B512_60::BIG e, B512_60::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B512_60::BIG e, B512_60::BIG f, B512_60::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B512_60::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, FP512BN::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B512_60::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_HIFIVE.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_HIFIVE.h
new file mode 100644
index 0000000..ed58119
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_HIFIVE.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_HIFIVE_H
+#define ECP_HIFIVE_H
+
+#include "fp_HIFIVE.h"
+#include "config_curve_HIFIVE.h"
+
+using namespace core;
+
+namespace HIFIVE {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B336_60::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B336_60::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B336_60::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B336_60::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B336_60::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B336_60::BIG CURVE_Ad;
+extern const B336_60::BIG CURVE_Bd;
+extern const B336_60::BIG PC[];
+
+extern const B336_60::BIG CURVE_Adr;
+extern const B336_60::BIG CURVE_Adi;
+extern const B336_60::BIG CURVE_Bdr;
+extern const B336_60::BIG CURVE_Bdi;
+extern const B336_60::BIG PCR[];
+extern const B336_60::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B336_60::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B336_60::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B336_60::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B336_60::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B336_60::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B336_60::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B336_60::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B336_60::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B336_60::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B336_60::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B336_60::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B336_60::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B336_60::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B336_60::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B336_60::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B336_60::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B336_60::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B336_60::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B336_60::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B336_60::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B336_60::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B336_60::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B336_60::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B336_60::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B336_60::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B336_60::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B336_60::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B336_60::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B336_60::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B336_60::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B336_60::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B336_60::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B336_60::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B336_60::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B336_60::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B336_60::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B336_60::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    HIFIVE::FP x; /**< x-coordinate of point */
+#if CURVETYPE_HIFIVE!=MONTGOMERY
+    HIFIVE::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    HIFIVE::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(HIFIVE::FP *r, HIFIVE::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B336_60::BIG x, int s);
+
+#if CURVETYPE_HIFIVE==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B336_60::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B336_60::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B336_60::BIG x, B336_60::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B336_60::BIG x, B336_60::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B336_60::BIG e, B336_60::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B336_60::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B336_60::BIG e, B336_60::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B336_60::BIG e, B336_60::BIG f, B336_60::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B336_60::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, HIFIVE::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B336_60::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_JUBJUB.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_JUBJUB.h
new file mode 100644
index 0000000..bb5a575
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_JUBJUB.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_JUBJUB_H
+#define ECP_JUBJUB_H
+
+#include "fp_JUBJUB.h"
+#include "config_curve_JUBJUB.h"
+
+using namespace core;
+
+namespace JUBJUB {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B256_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B256_56::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B256_56::BIG CURVE_Ad;
+extern const B256_56::BIG CURVE_Bd;
+extern const B256_56::BIG PC[];
+
+extern const B256_56::BIG CURVE_Adr;
+extern const B256_56::BIG CURVE_Adi;
+extern const B256_56::BIG CURVE_Bdr;
+extern const B256_56::BIG CURVE_Bdi;
+extern const B256_56::BIG PCR[];
+extern const B256_56::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B256_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B256_56::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B256_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B256_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B256_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    JUBJUB::FP x; /**< x-coordinate of point */
+#if CURVETYPE_JUBJUB!=MONTGOMERY
+    JUBJUB::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    JUBJUB::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(JUBJUB::FP *r, JUBJUB::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B256_56::BIG x, int s);
+
+#if CURVETYPE_JUBJUB==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B256_56::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x, B256_56::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B256_56::BIG x, B256_56::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B256_56::BIG e, B256_56::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B256_56::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f, B256_56::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B256_56::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, JUBJUB::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B256_56::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_MDC.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_MDC.h
new file mode 100644
index 0000000..15a221c
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_MDC.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_MDC_H
+#define ECP_MDC_H
+
+#include "fp_MDC.h"
+#include "config_curve_MDC.h"
+
+using namespace core;
+
+namespace MDC {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B256_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B256_56::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B256_56::BIG CURVE_Ad;
+extern const B256_56::BIG CURVE_Bd;
+extern const B256_56::BIG PC[];
+
+extern const B256_56::BIG CURVE_Adr;
+extern const B256_56::BIG CURVE_Adi;
+extern const B256_56::BIG CURVE_Bdr;
+extern const B256_56::BIG CURVE_Bdi;
+extern const B256_56::BIG PCR[];
+extern const B256_56::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B256_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B256_56::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B256_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B256_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B256_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    MDC::FP x; /**< x-coordinate of point */
+#if CURVETYPE_MDC!=MONTGOMERY
+    MDC::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    MDC::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(MDC::FP *r, MDC::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B256_56::BIG x, int s);
+
+#if CURVETYPE_MDC==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B256_56::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x, B256_56::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B256_56::BIG x, B256_56::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B256_56::BIG e, B256_56::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B256_56::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f, B256_56::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B256_56::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, MDC::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B256_56::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_NIST256.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_NIST256.h
new file mode 100644
index 0000000..4ba5005
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_NIST256.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_NIST256_H
+#define ECP_NIST256_H
+
+#include "fp_NIST256.h"
+#include "config_curve_NIST256.h"
+
+using namespace core;
+
+namespace NIST256 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B256_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B256_56::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B256_56::BIG CURVE_Ad;
+extern const B256_56::BIG CURVE_Bd;
+extern const B256_56::BIG PC[];
+
+extern const B256_56::BIG CURVE_Adr;
+extern const B256_56::BIG CURVE_Adi;
+extern const B256_56::BIG CURVE_Bdr;
+extern const B256_56::BIG CURVE_Bdi;
+extern const B256_56::BIG PCR[];
+extern const B256_56::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B256_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B256_56::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B256_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B256_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B256_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    NIST256::FP x; /**< x-coordinate of point */
+#if CURVETYPE_NIST256!=MONTGOMERY
+    NIST256::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    NIST256::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(NIST256::FP *r, NIST256::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B256_56::BIG x, int s);
+
+#if CURVETYPE_NIST256==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B256_56::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x, B256_56::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B256_56::BIG x, B256_56::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B256_56::BIG e, B256_56::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B256_56::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f, B256_56::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B256_56::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, NIST256::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B256_56::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_NIST384.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_NIST384.h
new file mode 100644
index 0000000..e011082
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_NIST384.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_NIST384_H
+#define ECP_NIST384_H
+
+#include "fp_NIST384.h"
+#include "config_curve_NIST384.h"
+
+using namespace core;
+
+namespace NIST384 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B384_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B384_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B384_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B384_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B384_56::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B384_56::BIG CURVE_Ad;
+extern const B384_56::BIG CURVE_Bd;
+extern const B384_56::BIG PC[];
+
+extern const B384_56::BIG CURVE_Adr;
+extern const B384_56::BIG CURVE_Adi;
+extern const B384_56::BIG CURVE_Bdr;
+extern const B384_56::BIG CURVE_Bdi;
+extern const B384_56::BIG PCR[];
+extern const B384_56::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B384_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B384_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B384_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B384_56::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_56::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_56::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_56::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_56::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_56::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_56::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_56::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B384_56::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_56::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_56::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_56::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_56::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_56::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_56::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_56::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B384_56::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_56::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_56::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_56::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_56::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_56::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_56::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_56::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B384_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B384_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B384_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B384_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B384_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B384_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B384_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    NIST384::FP x; /**< x-coordinate of point */
+#if CURVETYPE_NIST384!=MONTGOMERY
+    NIST384::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    NIST384::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(NIST384::FP *r, NIST384::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B384_56::BIG x, int s);
+
+#if CURVETYPE_NIST384==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B384_56::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B384_56::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B384_56::BIG x, B384_56::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B384_56::BIG x, B384_56::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B384_56::BIG e, B384_56::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B384_56::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B384_56::BIG e, B384_56::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B384_56::BIG e, B384_56::BIG f, B384_56::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B384_56::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, NIST384::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B384_56::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_NIST521.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_NIST521.h
new file mode 100644
index 0000000..82e0f0f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_NIST521.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_NIST521_H
+#define ECP_NIST521_H
+
+#include "fp_NIST521.h"
+#include "config_curve_NIST521.h"
+
+using namespace core;
+
+namespace NIST521 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B528_60::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B528_60::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B528_60::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B528_60::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B528_60::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B528_60::BIG CURVE_Ad;
+extern const B528_60::BIG CURVE_Bd;
+extern const B528_60::BIG PC[];
+
+extern const B528_60::BIG CURVE_Adr;
+extern const B528_60::BIG CURVE_Adi;
+extern const B528_60::BIG CURVE_Bdr;
+extern const B528_60::BIG CURVE_Bdi;
+extern const B528_60::BIG PCR[];
+extern const B528_60::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B528_60::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B528_60::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B528_60::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B528_60::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B528_60::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B528_60::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B528_60::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B528_60::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B528_60::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B528_60::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B528_60::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B528_60::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B528_60::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B528_60::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B528_60::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B528_60::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B528_60::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B528_60::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B528_60::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B528_60::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B528_60::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B528_60::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B528_60::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B528_60::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B528_60::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B528_60::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B528_60::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B528_60::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B528_60::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B528_60::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B528_60::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B528_60::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B528_60::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B528_60::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B528_60::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B528_60::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B528_60::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    NIST521::FP x; /**< x-coordinate of point */
+#if CURVETYPE_NIST521!=MONTGOMERY
+    NIST521::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    NIST521::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(NIST521::FP *r, NIST521::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B528_60::BIG x, int s);
+
+#if CURVETYPE_NIST521==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B528_60::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B528_60::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B528_60::BIG x, B528_60::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B528_60::BIG x, B528_60::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B528_60::BIG e, B528_60::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B528_60::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B528_60::BIG e, B528_60::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B528_60::BIG e, B528_60::BIG f, B528_60::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B528_60::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, NIST521::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B528_60::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_NUMS256E.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_NUMS256E.h
new file mode 100644
index 0000000..dada781
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_NUMS256E.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_NUMS256E_H
+#define ECP_NUMS256E_H
+
+#include "fp_F256PME.h"
+#include "config_curve_NUMS256E.h"
+
+using namespace core;
+
+namespace NUMS256E {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B256_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B256_56::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B256_56::BIG CURVE_Ad;
+extern const B256_56::BIG CURVE_Bd;
+extern const B256_56::BIG PC[];
+
+extern const B256_56::BIG CURVE_Adr;
+extern const B256_56::BIG CURVE_Adi;
+extern const B256_56::BIG CURVE_Bdr;
+extern const B256_56::BIG CURVE_Bdi;
+extern const B256_56::BIG PCR[];
+extern const B256_56::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B256_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B256_56::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B256_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B256_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B256_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    F256PME::FP x; /**< x-coordinate of point */
+#if CURVETYPE_NUMS256E!=MONTGOMERY
+    F256PME::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    F256PME::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(F256PME::FP *r, F256PME::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B256_56::BIG x, int s);
+
+#if CURVETYPE_NUMS256E==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B256_56::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x, B256_56::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B256_56::BIG x, B256_56::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B256_56::BIG e, B256_56::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B256_56::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f, B256_56::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B256_56::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, F256PME::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B256_56::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_NUMS256W.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_NUMS256W.h
new file mode 100644
index 0000000..7670540
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_NUMS256W.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_NUMS256W_H
+#define ECP_NUMS256W_H
+
+#include "fp_F256PMW.h"
+#include "config_curve_NUMS256W.h"
+
+using namespace core;
+
+namespace NUMS256W {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B256_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B256_56::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B256_56::BIG CURVE_Ad;
+extern const B256_56::BIG CURVE_Bd;
+extern const B256_56::BIG PC[];
+
+extern const B256_56::BIG CURVE_Adr;
+extern const B256_56::BIG CURVE_Adi;
+extern const B256_56::BIG CURVE_Bdr;
+extern const B256_56::BIG CURVE_Bdi;
+extern const B256_56::BIG PCR[];
+extern const B256_56::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B256_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B256_56::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B256_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B256_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B256_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    F256PMW::FP x; /**< x-coordinate of point */
+#if CURVETYPE_NUMS256W!=MONTGOMERY
+    F256PMW::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    F256PMW::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(F256PMW::FP *r, F256PMW::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B256_56::BIG x, int s);
+
+#if CURVETYPE_NUMS256W==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B256_56::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x, B256_56::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B256_56::BIG x, B256_56::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B256_56::BIG e, B256_56::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B256_56::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f, B256_56::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B256_56::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, F256PMW::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B256_56::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_NUMS384E.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_NUMS384E.h
new file mode 100644
index 0000000..61573b8
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_NUMS384E.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_NUMS384E_H
+#define ECP_NUMS384E_H
+
+#include "fp_F384PM.h"
+#include "config_curve_NUMS384E.h"
+
+using namespace core;
+
+namespace NUMS384E {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B384_58::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B384_58::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B384_58::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B384_58::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B384_58::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B384_58::BIG CURVE_Ad;
+extern const B384_58::BIG CURVE_Bd;
+extern const B384_58::BIG PC[];
+
+extern const B384_58::BIG CURVE_Adr;
+extern const B384_58::BIG CURVE_Adi;
+extern const B384_58::BIG CURVE_Bdr;
+extern const B384_58::BIG CURVE_Bdi;
+extern const B384_58::BIG PCR[];
+extern const B384_58::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B384_58::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B384_58::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B384_58::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B384_58::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B384_58::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B384_58::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B384_58::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B384_58::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B384_58::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B384_58::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B384_58::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B384_58::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B384_58::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    F384PM::FP x; /**< x-coordinate of point */
+#if CURVETYPE_NUMS384E!=MONTGOMERY
+    F384PM::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    F384PM::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(F384PM::FP *r, F384PM::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B384_58::BIG x, int s);
+
+#if CURVETYPE_NUMS384E==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B384_58::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B384_58::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B384_58::BIG x, B384_58::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B384_58::BIG x, B384_58::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B384_58::BIG e, B384_58::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B384_58::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B384_58::BIG e, B384_58::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B384_58::BIG e, B384_58::BIG f, B384_58::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B384_58::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, F384PM::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B384_58::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_NUMS384W.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_NUMS384W.h
new file mode 100644
index 0000000..6fe0051
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_NUMS384W.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_NUMS384W_H
+#define ECP_NUMS384W_H
+
+#include "fp_F384PM.h"
+#include "config_curve_NUMS384W.h"
+
+using namespace core;
+
+namespace NUMS384W {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B384_58::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B384_58::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B384_58::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B384_58::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B384_58::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B384_58::BIG CURVE_Ad;
+extern const B384_58::BIG CURVE_Bd;
+extern const B384_58::BIG PC[];
+
+extern const B384_58::BIG CURVE_Adr;
+extern const B384_58::BIG CURVE_Adi;
+extern const B384_58::BIG CURVE_Bdr;
+extern const B384_58::BIG CURVE_Bdi;
+extern const B384_58::BIG PCR[];
+extern const B384_58::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B384_58::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B384_58::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B384_58::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B384_58::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B384_58::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B384_58::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B384_58::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B384_58::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B384_58::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B384_58::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B384_58::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B384_58::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B384_58::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    F384PM::FP x; /**< x-coordinate of point */
+#if CURVETYPE_NUMS384W!=MONTGOMERY
+    F384PM::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    F384PM::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(F384PM::FP *r, F384PM::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B384_58::BIG x, int s);
+
+#if CURVETYPE_NUMS384W==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B384_58::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B384_58::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B384_58::BIG x, B384_58::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B384_58::BIG x, B384_58::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B384_58::BIG e, B384_58::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B384_58::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B384_58::BIG e, B384_58::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B384_58::BIG e, B384_58::BIG f, B384_58::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B384_58::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, F384PM::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B384_58::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_NUMS512E.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_NUMS512E.h
new file mode 100644
index 0000000..b4333f8
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_NUMS512E.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_NUMS512E_H
+#define ECP_NUMS512E_H
+
+#include "fp_F512PM.h"
+#include "config_curve_NUMS512E.h"
+
+using namespace core;
+
+namespace NUMS512E {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B512_60::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B512_60::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B512_60::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B512_60::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B512_60::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B512_60::BIG CURVE_Ad;
+extern const B512_60::BIG CURVE_Bd;
+extern const B512_60::BIG PC[];
+
+extern const B512_60::BIG CURVE_Adr;
+extern const B512_60::BIG CURVE_Adi;
+extern const B512_60::BIG CURVE_Bdr;
+extern const B512_60::BIG CURVE_Bdi;
+extern const B512_60::BIG PCR[];
+extern const B512_60::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B512_60::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B512_60::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B512_60::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B512_60::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B512_60::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B512_60::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B512_60::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B512_60::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B512_60::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B512_60::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B512_60::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B512_60::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B512_60::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    F512PM::FP x; /**< x-coordinate of point */
+#if CURVETYPE_NUMS512E!=MONTGOMERY
+    F512PM::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    F512PM::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(F512PM::FP *r, F512PM::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B512_60::BIG x, int s);
+
+#if CURVETYPE_NUMS512E==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B512_60::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B512_60::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B512_60::BIG x, B512_60::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B512_60::BIG x, B512_60::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B512_60::BIG e, B512_60::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B512_60::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B512_60::BIG e, B512_60::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B512_60::BIG e, B512_60::BIG f, B512_60::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B512_60::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, F512PM::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B512_60::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_NUMS512W.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_NUMS512W.h
new file mode 100644
index 0000000..a791911
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_NUMS512W.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_NUMS512W_H
+#define ECP_NUMS512W_H
+
+#include "fp_F512PM.h"
+#include "config_curve_NUMS512W.h"
+
+using namespace core;
+
+namespace NUMS512W {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B512_60::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B512_60::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B512_60::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B512_60::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B512_60::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B512_60::BIG CURVE_Ad;
+extern const B512_60::BIG CURVE_Bd;
+extern const B512_60::BIG PC[];
+
+extern const B512_60::BIG CURVE_Adr;
+extern const B512_60::BIG CURVE_Adi;
+extern const B512_60::BIG CURVE_Bdr;
+extern const B512_60::BIG CURVE_Bdi;
+extern const B512_60::BIG PCR[];
+extern const B512_60::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B512_60::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B512_60::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B512_60::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B512_60::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B512_60::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B512_60::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B512_60::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B512_60::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B512_60::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B512_60::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B512_60::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B512_60::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B512_60::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    F512PM::FP x; /**< x-coordinate of point */
+#if CURVETYPE_NUMS512W!=MONTGOMERY
+    F512PM::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    F512PM::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(F512PM::FP *r, F512PM::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B512_60::BIG x, int s);
+
+#if CURVETYPE_NUMS512W==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B512_60::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B512_60::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B512_60::BIG x, B512_60::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B512_60::BIG x, B512_60::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B512_60::BIG e, B512_60::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B512_60::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B512_60::BIG e, B512_60::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B512_60::BIG e, B512_60::BIG f, B512_60::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B512_60::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, F512PM::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B512_60::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_SECP160R1.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_SECP160R1.h
new file mode 100644
index 0000000..b31d8ab
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_SECP160R1.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_SECP160R1_H
+#define ECP_SECP160R1_H
+
+#include "fp_SECP160R1.h"
+#include "config_curve_SECP160R1.h"
+
+using namespace core;
+
+namespace SECP160R1 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B160_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B160_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B160_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B160_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B160_56::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B160_56::BIG CURVE_Ad;
+extern const B160_56::BIG CURVE_Bd;
+extern const B160_56::BIG PC[];
+
+extern const B160_56::BIG CURVE_Adr;
+extern const B160_56::BIG CURVE_Adi;
+extern const B160_56::BIG CURVE_Bdr;
+extern const B160_56::BIG CURVE_Bdi;
+extern const B160_56::BIG PCR[];
+extern const B160_56::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B160_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B160_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B160_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B160_56::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B160_56::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B160_56::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B160_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B160_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B160_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B160_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B160_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B160_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B160_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    SECP160R1::FP x; /**< x-coordinate of point */
+#if CURVETYPE_SECP160R1!=MONTGOMERY
+    SECP160R1::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    SECP160R1::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(SECP160R1::FP *r, SECP160R1::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B160_56::BIG x, int s);
+
+#if CURVETYPE_SECP160R1==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B160_56::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B160_56::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B160_56::BIG x, B160_56::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B160_56::BIG x, B160_56::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B160_56::BIG e, B160_56::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B160_56::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B160_56::BIG e, B160_56::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B160_56::BIG e, B160_56::BIG f, B160_56::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B160_56::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, SECP160R1::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B160_56::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_SECP256K1.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_SECP256K1.h
new file mode 100644
index 0000000..642f10e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_SECP256K1.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_SECP256K1_H
+#define ECP_SECP256K1_H
+
+#include "fp_SECP256K1.h"
+#include "config_curve_SECP256K1.h"
+
+using namespace core;
+
+namespace SECP256K1 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B256_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B256_56::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B256_56::BIG CURVE_Ad;
+extern const B256_56::BIG CURVE_Bd;
+extern const B256_56::BIG PC[];
+
+extern const B256_56::BIG CURVE_Adr;
+extern const B256_56::BIG CURVE_Adi;
+extern const B256_56::BIG CURVE_Bdr;
+extern const B256_56::BIG CURVE_Bdi;
+extern const B256_56::BIG PCR[];
+extern const B256_56::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B256_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B256_56::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B256_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B256_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B256_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    SECP256K1::FP x; /**< x-coordinate of point */
+#if CURVETYPE_SECP256K1!=MONTGOMERY
+    SECP256K1::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    SECP256K1::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(SECP256K1::FP *r, SECP256K1::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B256_56::BIG x, int s);
+
+#if CURVETYPE_SECP256K1==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B256_56::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x, B256_56::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B256_56::BIG x, B256_56::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B256_56::BIG e, B256_56::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B256_56::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f, B256_56::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B256_56::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, SECP256K1::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B256_56::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_SM2.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_SM2.h
new file mode 100644
index 0000000..236495e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_SM2.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_SM2_H
+#define ECP_SM2_H
+
+#include "fp_SM2.h"
+#include "config_curve_SM2.h"
+
+using namespace core;
+
+namespace SM2 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B256_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B256_56::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B256_56::BIG CURVE_Ad;
+extern const B256_56::BIG CURVE_Bd;
+extern const B256_56::BIG PC[];
+
+extern const B256_56::BIG CURVE_Adr;
+extern const B256_56::BIG CURVE_Adi;
+extern const B256_56::BIG CURVE_Bdr;
+extern const B256_56::BIG CURVE_Bdi;
+extern const B256_56::BIG PCR[];
+extern const B256_56::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B256_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B256_56::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B256_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B256_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B256_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    SM2::FP x; /**< x-coordinate of point */
+#if CURVETYPE_SM2!=MONTGOMERY
+    SM2::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    SM2::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(SM2::FP *r, SM2::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B256_56::BIG x, int s);
+
+#if CURVETYPE_SM2==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B256_56::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x, B256_56::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B256_56::BIG x, B256_56::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B256_56::BIG e, B256_56::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B256_56::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f, B256_56::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B256_56::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, SM2::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B256_56::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_TWEEDLEDEE.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_TWEEDLEDEE.h
new file mode 100644
index 0000000..9e4d19e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_TWEEDLEDEE.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_TWEEDLEDEE_H
+#define ECP_TWEEDLEDEE_H
+
+#include "fp_TWEEDLEDEE.h"
+#include "config_curve_TWEEDLEDEE.h"
+
+using namespace core;
+
+namespace TWEEDLEDEE {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B256_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B256_56::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B256_56::BIG CURVE_Ad;
+extern const B256_56::BIG CURVE_Bd;
+extern const B256_56::BIG PC[];
+
+extern const B256_56::BIG CURVE_Adr;
+extern const B256_56::BIG CURVE_Adi;
+extern const B256_56::BIG CURVE_Bdr;
+extern const B256_56::BIG CURVE_Bdi;
+extern const B256_56::BIG PCR[];
+extern const B256_56::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B256_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B256_56::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B256_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B256_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B256_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    TWEEDLEDEE::FP x; /**< x-coordinate of point */
+#if CURVETYPE_TWEEDLEDEE!=MONTGOMERY
+    TWEEDLEDEE::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    TWEEDLEDEE::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(TWEEDLEDEE::FP *r, TWEEDLEDEE::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B256_56::BIG x, int s);
+
+#if CURVETYPE_TWEEDLEDEE==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B256_56::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x, B256_56::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B256_56::BIG x, B256_56::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B256_56::BIG e, B256_56::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B256_56::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f, B256_56::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B256_56::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, TWEEDLEDEE::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B256_56::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_TWEEDLEDUM.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_TWEEDLEDUM.h
new file mode 100644
index 0000000..fcb9fd1
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_TWEEDLEDUM.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_TWEEDLEDUM_H
+#define ECP_TWEEDLEDUM_H
+
+#include "fp_TWEEDLEDUM.h"
+#include "config_curve_TWEEDLEDUM.h"
+
+using namespace core;
+
+namespace TWEEDLEDUM {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B256_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B256_56::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B256_56::BIG CURVE_Ad;
+extern const B256_56::BIG CURVE_Bd;
+extern const B256_56::BIG PC[];
+
+extern const B256_56::BIG CURVE_Adr;
+extern const B256_56::BIG CURVE_Adi;
+extern const B256_56::BIG CURVE_Bdr;
+extern const B256_56::BIG CURVE_Bdi;
+extern const B256_56::BIG PCR[];
+extern const B256_56::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B256_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B256_56::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B256_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B256_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B256_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    TWEEDLEDUM::FP x; /**< x-coordinate of point */
+#if CURVETYPE_TWEEDLEDUM!=MONTGOMERY
+    TWEEDLEDUM::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    TWEEDLEDUM::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(TWEEDLEDUM::FP *r, TWEEDLEDUM::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B256_56::BIG x, int s);
+
+#if CURVETYPE_TWEEDLEDUM==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B256_56::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x, B256_56::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B256_56::BIG x, B256_56::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B256_56::BIG e, B256_56::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B256_56::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f, B256_56::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B256_56::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, TWEEDLEDUM::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B256_56::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_X448.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_X448.h
new file mode 100644
index 0000000..5507d98
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ecp_X448.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_X448_H
+#define ECP_X448_H
+
+#include "fp_F448.h"
+#include "config_curve_X448.h"
+
+using namespace core;
+
+namespace X448 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B448_58::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B448_58::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B448_58::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B448_58::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B448_58::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B448_58::BIG CURVE_Ad;
+extern const B448_58::BIG CURVE_Bd;
+extern const B448_58::BIG PC[];
+
+extern const B448_58::BIG CURVE_Adr;
+extern const B448_58::BIG CURVE_Adi;
+extern const B448_58::BIG CURVE_Bdr;
+extern const B448_58::BIG CURVE_Bdi;
+extern const B448_58::BIG PCR[];
+extern const B448_58::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B448_58::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B448_58::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B448_58::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B448_58::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B448_58::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B448_58::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B448_58::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B448_58::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B448_58::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B448_58::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B448_58::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B448_58::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B448_58::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    F448::FP x; /**< x-coordinate of point */
+#if CURVETYPE_X448!=MONTGOMERY
+    F448::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    F448::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(F448::FP *r, F448::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B448_58::BIG x, int s);
+
+#if CURVETYPE_X448==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B448_58::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B448_58::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B448_58::BIG x, B448_58::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B448_58::BIG x, B448_58::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B448_58::BIG e, B448_58::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B448_58::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B448_58::BIG e, B448_58::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B448_58::BIG e, B448_58::BIG f, B448_58::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B448_58::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, F448::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B448_58::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa.cpp
new file mode 100644
index 0000000..22b890b
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa.cpp
@@ -0,0 +1,409 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+// EDDSA API functions
+
+// see https://nvlpubs.nist.gov/nistpubs/FIPS/NIST.FIPS.186-5.pdf
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <time.h>
+
+#include "eddsa_ZZZ.h"
+
+#if CURVETYPE_ZZZ == EDWARDS
+
+using namespace XXX;
+using namespace YYY;
+
+// Process a random BIG r by RFC7748 (for Montgomery & Edwards curves only)
+static void RFC7748(BIG r)
+{
+    int c,lg=0;
+    BIG t;
+    c=ZZZ::CURVE_Cof_I;
+    while (c!=1)
+    {
+        lg++;
+        c/=2;
+    }
+    int n=8*MODBYTES_XXX-lg+1;
+    BIG_mod2m(r,n);
+    BIG_zero(t); BIG_inc(t,1); BIG_shl(t,n);
+    BIG_add(r,r,t);
+    c=BIG_lastbits(r,lg);
+    BIG_dec(r,c);
+//    printf("lg= %d n=%d\n",lg,n);
+}
+
+// reverse first n bytes of buff - for little endian
+static void reverse(int n,char *buff) {
+    for (int i = 0; i < n/2; i++) { 
+        char ch = buff[i]; 
+        buff[i] = buff[n - i - 1]; 
+        buff[n - i - 1] = ch; 
+    } 
+}
+
+// dom2 - context still needs to be appended
+static void dom2(bool ph,int cl,octet *DOM) {
+    OCT_jstring(DOM,(char *)"SigZZZ no ZZZ collisions");
+    if (ph)
+        OCT_jbyte(DOM,1,1);
+    else 
+        OCT_jbyte(DOM,0,1);
+    OCT_jbyte(DOM,cl,1); // context length
+}
+
+// dom4 - context still needs to be appended
+static void dom4(bool ph,int cl,octet *DOM) {
+    OCT_jstring(DOM,(char *)"SigZZZ");
+    if (ph)
+        OCT_jbyte(DOM,1,1);
+    else 
+        OCT_jbyte(DOM,0,1);
+    OCT_jbyte(DOM,cl,1); // context length
+}
+
+static void H(octet *S,char *digest)
+{
+#if CURVE_SECURITY_ZZZ <= 128  // for ed25519?
+    hash512 sh512;
+    HASH512_init(&sh512);
+    for (int i=0;i<S->len;i++ )
+        HASH512_process(&sh512,S->val[i]);
+    HASH512_hash(&sh512,digest);
+#else                          // for ed448?
+    sha3 SHA3;
+    SHA3_init(&SHA3,SHAKE256);
+    for (int i=0;i<S->len;i++) 
+        SHA3_process(&SHA3,S->val[i]);
+    SHA3_shake(&SHA3,digest,2*S->len); 
+#endif
+}
+
+static int H2(bool ph,octet *context,octet *R,octet *Q,octet *M,DBIG dr)
+{
+    char h[128];
+    int b=Q->len;
+    char dom[64];
+    octet DOM={0,sizeof(dom),dom};
+    int cl;
+    if (context==NULL) cl=0;
+    else cl=context->len&0xff;
+#if CURVE_SECURITY_ZZZ <= 128  // for ed25519?
+    hash512 sh512;
+    HASH512_init(&sh512);
+    if (ph || cl>0)
+    {                   // if not prehash and no context, omit dom2()
+        dom2(ph,cl,&DOM);
+        for (int i=0;i<DOM.len;i++)
+            HASH512_process(&sh512,DOM.val[i]);
+        for (int i=0;i<cl;i++)
+            HASH512_process(&sh512,context->val[i]);
+    }
+    for (int i=0;i<b;i++ )
+        HASH512_process(&sh512,R->val[i]);
+    for (int i=0;i<b;i++ )
+        HASH512_process(&sh512,Q->val[i]);
+    for (int i=0;i<M->len;i++ )
+        HASH512_process(&sh512,M->val[i]);
+    HASH512_hash(&sh512,h);
+#else                          // for ed448?
+    dom4(ph,cl,&DOM);
+    sha3 SHA3;
+    SHA3_init(&SHA3,SHAKE256);
+    for (int i=0;i<DOM.len;i++)
+        SHA3_process(&SHA3,DOM.val[i]);
+    for (int i=0;i<cl;i++)
+        SHA3_process(&SHA3,context->val[i]);
+    for (int i=0;i<b;i++) 
+        SHA3_process(&SHA3,R->val[i]);
+    for (int i=0;i<b;i++) 
+        SHA3_process(&SHA3,Q->val[i]);
+    for (int i=0;i<M->len;i++) 
+        SHA3_process(&SHA3,M->val[i]);
+    SHA3_shake(&SHA3,h,2*b);
+#endif
+    reverse(2*b,h);
+    BIG_dfromBytesLen(dr,h,2*b);
+    return 2*b;
+}
+
+static void getR(bool ph,int b,char *digest,octet *context,octet *M,DBIG dr) {
+    char h[128];
+    char dom[64];
+    octet DOM={0,sizeof(dom),dom};
+    int cl;
+    if (context==NULL) cl=0;
+    else cl=context->len&0xff;
+
+#if CURVE_SECURITY_ZZZ <= 128  // for ed25519?
+    hash512 sh512;
+    HASH512_init(&sh512);
+    if (ph || cl>0)
+    {                   // if not prehash and no context, omit dom2()
+        dom2(ph,cl,&DOM);
+        for (int i=0;i<DOM.len;i++)
+            HASH512_process(&sh512,DOM.val[i]);
+        for (int i=0;i<cl;i++)
+            HASH512_process(&sh512,context->val[i]);
+    }
+    for (int i=b;i<2*b;i++ )
+        HASH512_process(&sh512,digest[i]);
+    for (int i=0;i<M->len;i++)
+        HASH512_process(&sh512,M->val[i]);
+    HASH512_hash(&sh512,h);
+
+#else                       // for ed448?
+    dom4(ph,cl,&DOM);
+    sha3 SHA3;
+    SHA3_init(&SHA3,SHAKE256);
+    for (int i=0;i<DOM.len;i++)
+        SHA3_process(&SHA3,DOM.val[i]);
+    for (int i=0;i<cl;i++)
+        SHA3_process(&SHA3,context->val[i]);
+    for (int i=b;i<2*b;i++ )
+        SHA3_process(&SHA3,digest[i]);
+    for (int i=0;i<M->len;i++) 
+        SHA3_process(&SHA3,M->val[i]);
+    SHA3_shake(&SHA3,h,2*b); 
+#endif
+
+    reverse(2*b,h);
+    BIG_dfromBytesLen(dr,h,2*b);
+}
+// encode integer (little endian)
+static int encode_int(XXX::BIG x,char *ei) {
+    int b,index=0;
+
+    if (8*MODBYTES_XXX==MBITS_YYY) index=1; // extra byte needed for compression        
+    b=MODBYTES_XXX+index;
+
+    ei[0]=0;
+    BIG_toBytes(&ei[index],x);
+    reverse(b,ei);
+    return b;
+}
+
+// encode point
+static void encode(ZZZ::ECP *P,octet *W) {
+    BIG x,y;
+    int b,index=0;
+
+    if (8*MODBYTES_XXX==MBITS_YYY) index=1; // extra byte needed for compression        
+    b=MODBYTES_XXX+index;
+
+    ECP_get(x, y, P);
+    b=encode_int(y,W->val);
+    W->val[b-1]|=BIG_parity(x)<<7;
+    W->len=b;
+}
+
+// decode integer (little endian)
+static int decode_int(bool strip_sign,char *ei,XXX::BIG x) {
+    int b,index=0;
+    int sign=0;
+    char r[MODBYTES_XXX+1];
+
+    if (8*MODBYTES_XXX==MBITS_YYY) index=1; // extra byte needed for compression        
+    b=MODBYTES_XXX+index;
+
+    for (int i=0;i<b;i++)
+        r[i]=ei[i];
+  
+    reverse(b,r);
+    if ((r[0]&0x80)!=0)
+        sign=1;
+    if (strip_sign)
+        r[0]&=0x7f;
+
+    if (r[0]==0) // remove leading zero
+        BIG_fromBytesLen(x,&r[1],b-1);
+    else
+        BIG_fromBytesLen(x,&r[0],b);
+    return sign;
+}
+
+// decode compressed point
+static void decode(octet *W,ZZZ::ECP *P) {
+    BIG X,Y;
+    FP x,d,t,one,hint;
+    int sign=decode_int(true,W->val,Y); // LSB of x
+    FP_nres(&x,Y); 
+    FP_sqr(&x,&x);
+    FP_copy(&d,&x); FP_one(&one);
+    FP_sub(&x,&x,&one);
+    FP_norm(&x);
+    FP_rcopy(&t, ZZZ::CURVE_B);
+
+    FP_mul(&d,&d,&t);
+#if CURVE_A_ZZZ == 1
+    FP_sub(&d,&d,&one);
+#else
+    FP_add(&d,&d,&one);
+#endif  
+    FP_norm(&d);
+// inverse square root trick for sqrt(x/d)
+    FP_sqr(&t,&x);
+    FP_mul(&x,&x,&t);
+    FP_mul(&x,&x,&d);
+    if (!FP_qr(&x,&hint))
+    {
+        ECP_inf(P);
+        return;
+    }
+    FP_sqrt(&d,&x,&hint);
+    FP_inv(&x,&x,&hint);
+    FP_mul(&x,&x,&d);
+    FP_mul(&x,&x,&t);
+
+    FP_reduce(&x);
+    FP_redc(X,&x);
+    if (BIG_parity(X)!=sign)
+        FP_neg(&x,&x);
+    FP_norm(&x);
+    FP_redc(X,&x);
+    ECP_set(P,X,Y);
+}
+
+/* Calculate a public/private EC GF(p) key pair. Q=D.G mod EC(p),
+ * where D is the secret key and Q is the public key
+ * and G is fixed generator.
+ * RNG is a cryptographically strong RNG 
+ * If RNG==NULL, D is generated externally 
+ */
+int ZZZ::EDDSA_KEY_PAIR_GENERATE(csprng *RNG,octet* D,octet *Q)
+{
+    BIG r, x, y, s;
+    ECP G;
+    char digest[128];
+    int res = EDDSA_OK;
+    int b,index=0;
+
+    if (8*MODBYTES_XXX==MBITS_YYY) index=1; // extra byte needed for compression        
+    b=MODBYTES_XXX+index;
+
+    ECP_generator(&G);
+
+    if (RNG != NULL)
+        OCT_rand(D, RNG, b); // create random private key
+
+    H(D,digest);
+
+// reverse bytes for little endian
+    reverse(b,digest);
+    BIG_fromBytes(s,&digest[index]);
+    RFC7748(s);
+    ECP_mul(&G, s);
+
+    encode(&G,Q);
+    return res;
+}
+
+// Generate a signature using key pair (D,Q) on message M
+// Set ph=true if message has already been pre-hashed
+// if ph=false, then context should be NULL for ed25519. However RFC8032 mode ed25519ctx is supported by supplying a non-NULL or non-empty context
+int ZZZ::EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG)
+{
+    DBIG dr;
+    BIG s,sr,sd,q;
+    ECP R;
+    char digest[128];
+    char pq[MODBYTES_XXX+1];
+    octet Q={0,sizeof(pq),pq};
+    H(D,digest);   // hash of private key
+    int res = EDDSA_OK;
+    int b,index=0;
+    if (8*MODBYTES_XXX==MBITS_YYY) index=1; // extra byte needed for compression        
+    b=MODBYTES_XXX+index;
+
+    EDDSA_KEY_PAIR_GENERATE(NULL,D,&Q);
+
+    BIG_rcopy(q, CURVE_Order);
+    ECP_generator(&R);
+
+    if (D->len!=Q.len || D->len!=b)
+        res=EDDSA_INVALID_PUBLIC_KEY;
+    if (res==EDDSA_OK)
+    {
+        getR(ph,b,digest,context,M,dr);
+        BIG_dmod(sr,dr,q);
+        ECP_mul(&R,sr);
+        encode(&R,SIG);
+// reverse bytes for little endian        
+        reverse(b,digest);
+        BIG_fromBytes(s,&digest[index]);
+        RFC7748(s);
+        H2(ph,context,SIG,&Q,M,dr);
+        BIG_dmod(sd,dr,q);
+        BIG_modmul(s,s,sd,q);
+        BIG_modadd(s,s,sr,q);
+        encode_int(s,&SIG->val[b]);
+        SIG->len=2*b;
+    }
+    return res;
+}
+
+// verify a signature using public key Q
+// same context (if any) as used for signature
+bool ZZZ::EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG) 
+{
+    DBIG du;
+    BIG q,t,su;
+    ECP R,QD,G;
+    int res = EDDSA_OK;
+    bool dr,dq;
+    int lg=0;
+    int c,b,index=0;
+    if (8*MODBYTES_XXX==MBITS_YYY) index=1; // extra byte needed for compression        
+    b=MODBYTES_XXX+index;
+
+    c=ZZZ::CURVE_Cof_I;
+    while (c!=1)
+    {
+        lg++;
+        c/=2;
+    }
+    BIG_rcopy(q, CURVE_Order);
+
+    decode(SIG,&R);
+    if (ECP_isinf(&R)) return false;
+    decode_int(false,&SIG->val[b],t);
+    if (BIG_comp(t,q)>=0) return false;
+    decode(Q,&QD);
+    if (ECP_isinf(&QD)) return false;
+
+    H2(ph,context,SIG,Q,M,du);
+    BIG_dmod(su,du,q);
+    ECP_generator(&G);
+    for (int i=0;i<lg;i++)
+    { // use cofactor 2^c
+        ECP_dbl(&G); ECP_dbl(&QD); ECP_dbl(&R);
+    }
+
+    ECP_neg(&QD);
+    ECP_mul2(&G,&QD,t,su);
+
+    if (!ECP_equals(&G,&R)) return false;
+
+    return true;
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa.h
new file mode 100644
index 0000000..a7cb9ab
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_ZZZ_H
+#define EDDSA_ZZZ_H
+
+#include "ecp_ZZZ.h"
+
+using namespace core;
+
+#define EGS_ZZZ MODBYTES_XXX  /**< ECC Group Size in bytes */
+#define EFS_ZZZ MODBYTES_XXX  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace ZZZ {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_ANSSI.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_ANSSI.h
new file mode 100644
index 0000000..603b6a4
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_ANSSI.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_ANSSI_H
+#define EDDSA_ANSSI_H
+
+#include "ecp_ANSSI.h"
+
+using namespace core;
+
+#define EGS_ANSSI MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_ANSSI MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace ANSSI {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_BLS12381.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_BLS12381.h
new file mode 100644
index 0000000..096a4dc
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_BLS12381.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_BLS12381_H
+#define EDDSA_BLS12381_H
+
+#include "ecp_BLS12381.h"
+
+using namespace core;
+
+#define EGS_BLS12381 MODBYTES_B384_58  /**< ECC Group Size in bytes */
+#define EFS_BLS12381 MODBYTES_B384_58  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace BLS12381 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_BLS12383.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_BLS12383.h
new file mode 100644
index 0000000..b7058db
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_BLS12383.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_BLS12383_H
+#define EDDSA_BLS12383_H
+
+#include "ecp_BLS12383.h"
+
+using namespace core;
+
+#define EGS_BLS12383 MODBYTES_B384_58  /**< ECC Group Size in bytes */
+#define EFS_BLS12383 MODBYTES_B384_58  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace BLS12383 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_BLS12443.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_BLS12443.h
new file mode 100644
index 0000000..3412e90
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_BLS12443.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_BLS12443_H
+#define EDDSA_BLS12443_H
+
+#include "ecp_BLS12443.h"
+
+using namespace core;
+
+#define EGS_BLS12443 MODBYTES_B448_60  /**< ECC Group Size in bytes */
+#define EFS_BLS12443 MODBYTES_B448_60  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace BLS12443 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_BLS12461.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_BLS12461.h
new file mode 100644
index 0000000..751cf70
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_BLS12461.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_BLS12461_H
+#define EDDSA_BLS12461_H
+
+#include "ecp_BLS12461.h"
+
+using namespace core;
+
+#define EGS_BLS12461 MODBYTES_B464_60  /**< ECC Group Size in bytes */
+#define EFS_BLS12461 MODBYTES_B464_60  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace BLS12461 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_BLS24479.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_BLS24479.h
new file mode 100644
index 0000000..0cc685a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_BLS24479.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_BLS24479_H
+#define EDDSA_BLS24479_H
+
+#include "ecp_BLS24479.h"
+
+using namespace core;
+
+#define EGS_BLS24479 MODBYTES_B480_56  /**< ECC Group Size in bytes */
+#define EFS_BLS24479 MODBYTES_B480_56  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace BLS24479 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_BLS48286.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_BLS48286.h
new file mode 100644
index 0000000..790104a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_BLS48286.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_BLS48286_H
+#define EDDSA_BLS48286_H
+
+#include "ecp_BLS48286.h"
+
+using namespace core;
+
+#define EGS_BLS48286 MODBYTES_B288_60  /**< ECC Group Size in bytes */
+#define EFS_BLS48286 MODBYTES_B288_60  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace BLS48286 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_BLS48556.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_BLS48556.h
new file mode 100644
index 0000000..d1e8fc2
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_BLS48556.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_BLS48556_H
+#define EDDSA_BLS48556_H
+
+#include "ecp_BLS48556.h"
+
+using namespace core;
+
+#define EGS_BLS48556 MODBYTES_B560_58  /**< ECC Group Size in bytes */
+#define EFS_BLS48556 MODBYTES_B560_58  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace BLS48556 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_BLS48581.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_BLS48581.h
new file mode 100644
index 0000000..1e847e9
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_BLS48581.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_BLS48581_H
+#define EDDSA_BLS48581_H
+
+#include "ecp_BLS48581.h"
+
+using namespace core;
+
+#define EGS_BLS48581 MODBYTES_B584_60  /**< ECC Group Size in bytes */
+#define EFS_BLS48581 MODBYTES_B584_60  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace BLS48581 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_BN158.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_BN158.h
new file mode 100644
index 0000000..690089e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_BN158.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_BN158_H
+#define EDDSA_BN158_H
+
+#include "ecp_BN158.h"
+
+using namespace core;
+
+#define EGS_BN158 MODBYTES_B160_56  /**< ECC Group Size in bytes */
+#define EFS_BN158 MODBYTES_B160_56  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace BN158 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_BN254.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_BN254.h
new file mode 100644
index 0000000..c480692
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_BN254.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_BN254_H
+#define EDDSA_BN254_H
+
+#include "ecp_BN254.h"
+
+using namespace core;
+
+#define EGS_BN254 MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_BN254 MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace BN254 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_BN254CX.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_BN254CX.h
new file mode 100644
index 0000000..4efb2c6
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_BN254CX.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_BN254CX_H
+#define EDDSA_BN254CX_H
+
+#include "ecp_BN254CX.h"
+
+using namespace core;
+
+#define EGS_BN254CX MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_BN254CX MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace BN254CX {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_BN462.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_BN462.h
new file mode 100644
index 0000000..d6ea2f6
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_BN462.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_BN462_H
+#define EDDSA_BN462_H
+
+#include "ecp_BN462.h"
+
+using namespace core;
+
+#define EGS_BN462 MODBYTES_B464_60  /**< ECC Group Size in bytes */
+#define EFS_BN462 MODBYTES_B464_60  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace BN462 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_BRAINPOOL.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_BRAINPOOL.h
new file mode 100644
index 0000000..9060701
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_BRAINPOOL.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_BRAINPOOL_H
+#define EDDSA_BRAINPOOL_H
+
+#include "ecp_BRAINPOOL.h"
+
+using namespace core;
+
+#define EGS_BRAINPOOL MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_BRAINPOOL MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace BRAINPOOL {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_C1174.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_C1174.h
new file mode 100644
index 0000000..c0ad055
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_C1174.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_C1174_H
+#define EDDSA_C1174_H
+
+#include "ecp_C1174.h"
+
+using namespace core;
+
+#define EGS_C1174 MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_C1174 MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace C1174 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_C13318.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_C13318.h
new file mode 100644
index 0000000..1748c9d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_C13318.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_C13318_H
+#define EDDSA_C13318_H
+
+#include "ecp_C13318.h"
+
+using namespace core;
+
+#define EGS_C13318 MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_C13318 MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace C13318 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_C1665.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_C1665.h
new file mode 100644
index 0000000..8ec25ee
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_C1665.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_C1665_H
+#define EDDSA_C1665_H
+
+#include "ecp_C1665.h"
+
+using namespace core;
+
+#define EGS_C1665 MODBYTES_B168_60  /**< ECC Group Size in bytes */
+#define EFS_C1665 MODBYTES_B168_60  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace C1665 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_C25519.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_C25519.h
new file mode 100644
index 0000000..3617524
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_C25519.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_C25519_H
+#define EDDSA_C25519_H
+
+#include "ecp_C25519.h"
+
+using namespace core;
+
+#define EGS_C25519 MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_C25519 MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace C25519 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_C41417.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_C41417.h
new file mode 100644
index 0000000..de4b76c
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_C41417.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_C41417_H
+#define EDDSA_C41417_H
+
+#include "ecp_C41417.h"
+
+using namespace core;
+
+#define EGS_C41417 MODBYTES_B416_60  /**< ECC Group Size in bytes */
+#define EFS_C41417 MODBYTES_B416_60  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace C41417 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_Ed25519.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_Ed25519.h
new file mode 100644
index 0000000..3e8edda
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_Ed25519.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_Ed25519_H
+#define EDDSA_Ed25519_H
+
+#include "ecp_Ed25519.h"
+
+using namespace core;
+
+#define EGS_Ed25519 MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_Ed25519 MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace Ed25519 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_Ed448.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_Ed448.h
new file mode 100644
index 0000000..6893ad8
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_Ed448.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_Ed448_H
+#define EDDSA_Ed448_H
+
+#include "ecp_Ed448.h"
+
+using namespace core;
+
+#define EGS_Ed448 MODBYTES_B448_58  /**< ECC Group Size in bytes */
+#define EFS_Ed448 MODBYTES_B448_58  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace Ed448 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_FP256BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_FP256BN.h
new file mode 100644
index 0000000..d6e38b5
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_FP256BN.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_FP256BN_H
+#define EDDSA_FP256BN_H
+
+#include "ecp_FP256BN.h"
+
+using namespace core;
+
+#define EGS_FP256BN MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_FP256BN MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace FP256BN {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_FP512BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_FP512BN.h
new file mode 100644
index 0000000..2550f15
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_FP512BN.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_FP512BN_H
+#define EDDSA_FP512BN_H
+
+#include "ecp_FP512BN.h"
+
+using namespace core;
+
+#define EGS_FP512BN MODBYTES_B512_60  /**< ECC Group Size in bytes */
+#define EFS_FP512BN MODBYTES_B512_60  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace FP512BN {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_HIFIVE.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_HIFIVE.h
new file mode 100644
index 0000000..4c189f7
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_HIFIVE.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_HIFIVE_H
+#define EDDSA_HIFIVE_H
+
+#include "ecp_HIFIVE.h"
+
+using namespace core;
+
+#define EGS_HIFIVE MODBYTES_B336_60  /**< ECC Group Size in bytes */
+#define EFS_HIFIVE MODBYTES_B336_60  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace HIFIVE {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_JUBJUB.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_JUBJUB.h
new file mode 100644
index 0000000..0c2ce16
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_JUBJUB.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_JUBJUB_H
+#define EDDSA_JUBJUB_H
+
+#include "ecp_JUBJUB.h"
+
+using namespace core;
+
+#define EGS_JUBJUB MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_JUBJUB MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace JUBJUB {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_MDC.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_MDC.h
new file mode 100644
index 0000000..8ac00c0
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_MDC.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_MDC_H
+#define EDDSA_MDC_H
+
+#include "ecp_MDC.h"
+
+using namespace core;
+
+#define EGS_MDC MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_MDC MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace MDC {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_NIST256.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_NIST256.h
new file mode 100644
index 0000000..14b5908
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_NIST256.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_NIST256_H
+#define EDDSA_NIST256_H
+
+#include "ecp_NIST256.h"
+
+using namespace core;
+
+#define EGS_NIST256 MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_NIST256 MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace NIST256 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_NIST384.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_NIST384.h
new file mode 100644
index 0000000..4ab51fd
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_NIST384.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_NIST384_H
+#define EDDSA_NIST384_H
+
+#include "ecp_NIST384.h"
+
+using namespace core;
+
+#define EGS_NIST384 MODBYTES_B384_56  /**< ECC Group Size in bytes */
+#define EFS_NIST384 MODBYTES_B384_56  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace NIST384 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_NIST521.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_NIST521.h
new file mode 100644
index 0000000..817ab61
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_NIST521.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_NIST521_H
+#define EDDSA_NIST521_H
+
+#include "ecp_NIST521.h"
+
+using namespace core;
+
+#define EGS_NIST521 MODBYTES_B528_60  /**< ECC Group Size in bytes */
+#define EFS_NIST521 MODBYTES_B528_60  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace NIST521 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_NUMS256E.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_NUMS256E.h
new file mode 100644
index 0000000..a9eee5d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_NUMS256E.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_NUMS256E_H
+#define EDDSA_NUMS256E_H
+
+#include "ecp_NUMS256E.h"
+
+using namespace core;
+
+#define EGS_NUMS256E MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_NUMS256E MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace NUMS256E {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_NUMS256W.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_NUMS256W.h
new file mode 100644
index 0000000..bd9a769
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_NUMS256W.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_NUMS256W_H
+#define EDDSA_NUMS256W_H
+
+#include "ecp_NUMS256W.h"
+
+using namespace core;
+
+#define EGS_NUMS256W MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_NUMS256W MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace NUMS256W {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_NUMS384E.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_NUMS384E.h
new file mode 100644
index 0000000..cd9872f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_NUMS384E.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_NUMS384E_H
+#define EDDSA_NUMS384E_H
+
+#include "ecp_NUMS384E.h"
+
+using namespace core;
+
+#define EGS_NUMS384E MODBYTES_B384_58  /**< ECC Group Size in bytes */
+#define EFS_NUMS384E MODBYTES_B384_58  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace NUMS384E {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_NUMS384W.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_NUMS384W.h
new file mode 100644
index 0000000..c7467b3
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_NUMS384W.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_NUMS384W_H
+#define EDDSA_NUMS384W_H
+
+#include "ecp_NUMS384W.h"
+
+using namespace core;
+
+#define EGS_NUMS384W MODBYTES_B384_58  /**< ECC Group Size in bytes */
+#define EFS_NUMS384W MODBYTES_B384_58  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace NUMS384W {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_NUMS512E.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_NUMS512E.h
new file mode 100644
index 0000000..89591b9
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_NUMS512E.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_NUMS512E_H
+#define EDDSA_NUMS512E_H
+
+#include "ecp_NUMS512E.h"
+
+using namespace core;
+
+#define EGS_NUMS512E MODBYTES_B512_60  /**< ECC Group Size in bytes */
+#define EFS_NUMS512E MODBYTES_B512_60  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace NUMS512E {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_NUMS512W.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_NUMS512W.h
new file mode 100644
index 0000000..a5bddd7
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_NUMS512W.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_NUMS512W_H
+#define EDDSA_NUMS512W_H
+
+#include "ecp_NUMS512W.h"
+
+using namespace core;
+
+#define EGS_NUMS512W MODBYTES_B512_60  /**< ECC Group Size in bytes */
+#define EFS_NUMS512W MODBYTES_B512_60  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace NUMS512W {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_SECP160R1.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_SECP160R1.h
new file mode 100644
index 0000000..1baad57
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_SECP160R1.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_SECP160R1_H
+#define EDDSA_SECP160R1_H
+
+#include "ecp_SECP160R1.h"
+
+using namespace core;
+
+#define EGS_SECP160R1 MODBYTES_B160_56  /**< ECC Group Size in bytes */
+#define EFS_SECP160R1 MODBYTES_B160_56  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace SECP160R1 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_SECP256K1.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_SECP256K1.h
new file mode 100644
index 0000000..f72a77e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_SECP256K1.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_SECP256K1_H
+#define EDDSA_SECP256K1_H
+
+#include "ecp_SECP256K1.h"
+
+using namespace core;
+
+#define EGS_SECP256K1 MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_SECP256K1 MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace SECP256K1 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_SM2.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_SM2.h
new file mode 100644
index 0000000..c292cc5
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_SM2.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_SM2_H
+#define EDDSA_SM2_H
+
+#include "ecp_SM2.h"
+
+using namespace core;
+
+#define EGS_SM2 MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_SM2 MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace SM2 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_TWEEDLEDEE.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_TWEEDLEDEE.h
new file mode 100644
index 0000000..21685e3
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_TWEEDLEDEE.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_TWEEDLEDEE_H
+#define EDDSA_TWEEDLEDEE_H
+
+#include "ecp_TWEEDLEDEE.h"
+
+using namespace core;
+
+#define EGS_TWEEDLEDEE MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_TWEEDLEDEE MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace TWEEDLEDEE {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_TWEEDLEDUM.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_TWEEDLEDUM.h
new file mode 100644
index 0000000..8eb3b4d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_TWEEDLEDUM.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_TWEEDLEDUM_H
+#define EDDSA_TWEEDLEDUM_H
+
+#include "ecp_TWEEDLEDUM.h"
+
+using namespace core;
+
+#define EGS_TWEEDLEDUM MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_TWEEDLEDUM MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace TWEEDLEDUM {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_X448.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_X448.h
new file mode 100644
index 0000000..7251cd8
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/eddsa_X448.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_X448_H
+#define EDDSA_X448_H
+
+#include "ecp_X448.h"
+
+using namespace core;
+
+#define EGS_X448 MODBYTES_B448_58  /**< ECC Group Size in bytes */
+#define EFS_X448 MODBYTES_B448_58  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace X448 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ff.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ff.cpp
new file mode 100644
index 0000000..df30ac2
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ff.cpp
@@ -0,0 +1,1039 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* CORE basic functions for Large Finite Field support */
+
+#include "ff_WWW.h"
+
+using namespace XXX;
+
+namespace WWW {
+static void FF_dsucopy(BIG x[], BIG y[], int);
+static void FF_dscopy(BIG x[], BIG y[], int);
+static void FF_sducopy(BIG x[], BIG y[], int);
+static void FF_shrw(BIG a[], int);
+static void FF_shlw(BIG a[], int);
+static void FF_radd(BIG z[], int, BIG x[], int, BIG y[], int, int);
+static void FF_rinc(BIG z[], int, BIG y[], int, int);
+static void FF_rdec(BIG z[], int, BIG y[], int, int);
+static void FF_rnorm(BIG z[], int, int);
+static void FF_cswap(BIG a[], BIG b[], int, int);
+static void FF_karmul(BIG z[], int, BIG x[], int, BIG y[], int, BIG t[], int, int);
+static void FF_karsqr(BIG z[], int, BIG x[], int, BIG t[], int, int);
+static void FF_karmul_lower(BIG z[], int, BIG x[], int, BIG y[], int, BIG t[], int, int);
+static void FF_karmul_upper(BIG z[], BIG x[], BIG y[], BIG t[], int);
+static void FF_lmul(BIG z[], BIG x[], BIG y[], int);
+static void FF_reduce(BIG r[], BIG T[], BIG N[], BIG ND[], int);
+static void FF_nres(BIG a[], BIG m[], int);
+static void FF_redc(BIG a[], BIG m[], BIG ND[], int);
+static void FF_invmod2m(BIG U[], BIG a[], int);
+static void FF_modmul(BIG z[], BIG x[], BIG y[], BIG p[], BIG ND[], int);
+static void FF_modsqr(BIG z[], BIG x[], BIG p[], BIG ND[], int);
+}
+
+/* x=y */
+void WWW::FF_copy(BIG x[], BIG y[], int n)
+{
+    int i;
+    for (i = 0; i < n; i++)
+        BIG_copy(x[i], y[i]);
+}
+
+/* x=y<<n */
+static void WWW::FF_dsucopy(BIG x[], BIG y[], int n)
+{
+    int i;
+    for (i = 0; i < n; i++)
+    {
+        BIG_copy(x[n + i], y[i]);
+        BIG_zero(x[i]);
+    }
+}
+
+/* x=y */
+static void WWW::FF_dscopy(BIG x[], BIG y[], int n)
+{
+    int i;
+    for (i = 0; i < n; i++)
+    {
+        BIG_copy(x[i], y[i]);
+        BIG_zero(x[n + i]);
+    }
+}
+
+/* x=y>>n */
+static void WWW::FF_sducopy(BIG x[], BIG y[], int n)
+{
+    int i;
+    for (i = 0; i < n; i++)
+        BIG_copy(x[i], y[n + i]);
+}
+
+/* set to zero */
+void WWW::FF_zero(BIG x[], int n)
+{
+    int i;
+    for (i = 0; i < n; i++)
+        BIG_zero(x[i]);
+}
+
+/* test equals 0 */
+int WWW::FF_iszilch(BIG x[], int n)
+{
+    int i;
+    for (i = 0; i < n; i++)
+        if (!BIG_iszilch(x[i])) return 0;
+    return 1;
+}
+
+/* shift right by BIGBITS_XXX-bit words */
+static void WWW::FF_shrw(BIG a[], int n)
+{
+    int i;
+    for (i = 0; i < n; i++)
+    {
+        BIG_copy(a[i], a[i + n]);
+        BIG_zero(a[i + n]);
+    }
+}
+
+/* shift left by BIGBITS_XXX-bit words */
+static void WWW::FF_shlw(BIG a[], int n)
+{
+    int i;
+    for (i = 0; i < n; i++)
+    {
+        BIG_copy(a[i + n], a[i]);
+        BIG_zero(a[i]);
+    }
+}
+
+/* extract last bit */
+int WWW::FF_parity(BIG x[])
+{
+    return BIG_parity(x[0]);
+}
+
+/* extract last m bits */
+int WWW::FF_lastbits(BIG x[], int m)
+{
+    return BIG_lastbits(x[0], m);
+}
+
+/* x=1 */
+void WWW::FF_one(BIG x[], int n)
+{
+    int i;
+    BIG_one(x[0]);
+    for (i = 1; i < n; i++)
+        BIG_zero(x[i]);
+}
+
+/* x=m, where m is 32-bit int */
+void WWW::FF_init(BIG x[], sign32 m, int n)
+{
+    int i;
+    BIG_zero(x[0]);
+#if CHUNK<64
+    x[0][0] = (chunk)(m & BMASK_XXX);
+    x[0][1] = (chunk)(m >> BASEBITS_XXX);
+#else
+    x[0][0] = (chunk)m;
+#endif
+    for (i = 1; i < n; i++)
+        BIG_zero(x[i]);
+}
+
+/* compare x and y - must be normalised */
+int WWW::FF_comp(BIG x[], BIG y[], int n)
+{
+    int i, j;
+    for (i = n - 1; i >= 0; i--)
+    {
+        j = BIG_comp(x[i], y[i]);
+        if (j != 0) return j;
+    }
+    return 0;
+}
+
+/* recursive add */
+static void WWW::FF_radd(BIG z[], int zp, BIG x[], int xp, BIG y[], int yp, int n)
+{
+    int i;
+    for (i = 0; i < n; i++)
+        BIG_add(z[zp + i], x[xp + i], y[yp + i]);
+}
+
+/* recursive inc */
+static void WWW::FF_rinc(BIG z[], int zp, BIG y[], int yp, int n)
+{
+    int i;
+    for (i = 0; i < n; i++)
+        BIG_add(z[zp + i], z[zp + i], y[yp + i]);
+}
+
+/* recursive dec */
+static void WWW::FF_rdec(BIG z[], int zp, BIG y[], int yp, int n)
+{
+    int i;
+    for (i = 0; i < n; i++)
+        BIG_sub(z[zp + i], z[zp + i], y[yp + i]);
+}
+
+/* simple add */
+void WWW::FF_add(BIG z[], BIG x[], BIG y[], int n)
+{
+    int i;
+    for (i = 0; i < n; i++)
+        BIG_add(z[i], x[i], y[i]);
+}
+
+/* simple sub */
+void WWW::FF_sub(BIG z[], BIG x[], BIG y[], int n)
+{
+    int i;
+    for (i = 0; i < n; i++)
+        BIG_sub(z[i], x[i], y[i]);
+}
+
+/* increment/decrement by a small integer */
+void WWW::FF_inc(BIG x[], int m, int n)
+{
+    BIG_inc(x[0], m);
+    FF_norm(x, n);
+}
+
+void WWW::FF_dec(BIG x[], int m, int n)
+{
+    BIG_dec(x[0], m);
+    FF_norm(x, n);
+}
+
+/* normalise - but hold any overflow in top part unless n<0 */
+static void WWW::FF_rnorm(BIG z[], int zp, int n)
+{
+    int i, trunc = 0;
+    chunk carry;
+    if (n < 0)
+    {
+        /* -v n signals to do truncation */
+        n = -n;
+        trunc = 1;
+    }
+    for (i = 0; i < n - 1; i++)
+    {
+        carry = BIG_norm(z[zp + i]);
+
+        z[zp + i][NLEN_XXX - 1] ^= carry << P_TBITS_WWW; /* remove it */
+        z[zp + i + 1][0] += carry;
+    }
+    carry = BIG_norm(z[zp + n - 1]);
+    if (trunc) z[zp + n - 1][NLEN_XXX - 1] ^= carry << P_TBITS_WWW;
+}
+
+void WWW::FF_norm(BIG z[], int n)
+{
+    FF_rnorm(z, 0, n);
+}
+
+/* shift left by one bit */
+void WWW::FF_shl(BIG x[], int n)
+{
+    int i;
+    int carry, delay_carry = 0;
+    for (i = 0; i < n - 1; i++)
+    {
+        carry = BIG_fshl(x[i], 1);
+        x[i][0] |= delay_carry;
+        x[i][NLEN_XXX - 1] ^= (chunk)carry << P_TBITS_WWW;
+        delay_carry = carry;
+    }
+    BIG_fshl(x[n - 1], 1);
+    x[n - 1][0] |= delay_carry;
+}
+
+/* shift right by one bit */
+void WWW::FF_shr(BIG x[], int n)
+{
+    int i;
+    int carry;
+    for (i = n - 1; i > 0; i--)
+    {
+        carry = BIG_fshr(x[i], 1);
+        x[i - 1][NLEN_XXX - 1] |= (chunk)carry << P_TBITS_WWW;
+    }
+    BIG_fshr(x[0], 1);
+}
+
+void WWW::FF_output(BIG x[], int n)
+{
+    int i;
+    FF_norm(x, n);
+    for (i = n - 1; i >= 0; i--)
+    {
+        BIG_output(x[i]);
+        printf(" ");
+    }
+}
+
+void WWW::FF_rawoutput(BIG x[], int n)
+{
+    int i;
+    for (i = n - 1; i >= 0; i--)
+    {
+        BIG_rawoutput(x[i]);
+        printf(" ");
+    }
+}
+
+/* Convert FFs to/from octet strings */
+void WWW::FF_toOctet(octet *w, BIG x[], int n)
+{
+    int i;
+    w->len = n * MODBYTES_XXX;
+    for (i = 0; i < n; i++)
+    {
+        BIG_toBytes(&(w->val[(n - i - 1)*MODBYTES_XXX]), x[i]);
+    }
+}
+
+void WWW::FF_fromOctet(BIG x[], octet *w, int n)
+{
+    int i;
+    for (i = 0; i < n; i++)
+    {
+        BIG_fromBytes(x[i], &(w->val[(n - i - 1)*MODBYTES_XXX]));
+    }
+}
+
+/* in-place swapping using xor - side channel resistant */
+static void WWW::FF_cswap(BIG a[], BIG b[], int d, int n)
+{
+    int i;
+    for (i = 0; i < n; i++)
+        BIG_cswap(a[i], b[i], d);
+    return;
+}
+
+/* z=x*y, t is workspace */
+static void WWW::FF_karmul(BIG z[], int zp, BIG x[], int xp, BIG y[], int yp, BIG t[], int tp, int n)
+{
+    int nd2;
+    if (n == 1)
+    {
+        BIG_norm(x[xp]);
+        BIG_norm(y[yp]);
+        BIG_mul(t[tp], x[xp], y[yp]);
+        BIG_split(z[zp + 1], z[zp], t[tp], BIGBITS_XXX);
+        return;
+    }
+
+    nd2 = n / 2;
+    FF_radd(z, zp, x, xp, x, xp + nd2, nd2);
+    FF_rnorm(z, zp, nd2); /* needs this if recursion level too deep */
+
+    FF_radd(z, zp + nd2, y, yp, y, yp + nd2, nd2);
+    FF_rnorm(z, zp + nd2, nd2);
+    FF_karmul(t, tp, z, zp, z, zp + nd2, t, tp + n, nd2);
+    FF_karmul(z, zp, x, xp, y, yp, t, tp + n, nd2);
+    FF_karmul(z, zp + n, x, xp + nd2, y, yp + nd2, t, tp + n, nd2);
+    FF_rdec(t, tp, z, zp, n);
+    FF_rdec(t, tp, z, zp + n, n);
+    FF_rinc(z, zp + nd2, t, tp, n);
+    FF_rnorm(z, zp, 2 * n);
+}
+
+static void WWW::FF_karsqr(BIG z[], int zp, BIG x[], int xp, BIG t[], int tp, int n)
+{
+    int nd2;
+    if (n == 1)
+    {
+        BIG_norm(x[xp]);
+        BIG_sqr(t[tp], x[xp]);
+        BIG_split(z[zp + 1], z[zp], t[tp], BIGBITS_XXX);
+        return;
+    }
+    nd2 = n / 2;
+    FF_karsqr(z, zp, x, xp, t, tp + n, nd2);
+    FF_karsqr(z, zp + n, x, xp + nd2, t, tp + n, nd2);
+    FF_karmul(t, tp, x, xp, x, xp + nd2, t, tp + n, nd2);
+    FF_rinc(z, zp + nd2, t, tp, n);
+    FF_rinc(z, zp + nd2, t, tp, n);
+
+    FF_rnorm(z, zp + nd2, n); /* was FF_rnorm(z,zp,2*n)  */
+}
+
+static void WWW::FF_karmul_lower(BIG z[], int zp, BIG x[], int xp, BIG y[], int yp, BIG t[], int tp, int n)
+{
+    /* Calculates Least Significant bottom half of x*y */
+    int nd2;
+    if (n == 1)
+    {
+        /* only calculate bottom half of product */
+        BIG_norm(x[xp]);
+        BIG_norm(y[yp]);
+        BIG_smul(z[zp], x[xp], y[yp]);
+        return;
+    }
+    nd2 = n / 2;
+    FF_karmul(z, zp, x, xp, y, yp, t, tp + n, nd2);
+    FF_karmul_lower(t, tp, x, xp + nd2, y, yp, t, tp + n, nd2);
+    FF_rinc(z, zp + nd2, t, tp, nd2);
+    FF_karmul_lower(t, tp, x, xp, y, yp + nd2, t, tp + n, nd2);
+    FF_rinc(z, zp + nd2, t, tp, nd2);
+    FF_rnorm(z, zp + nd2, -nd2); /* truncate it */
+}
+
+static void WWW::FF_karmul_upper(BIG z[], BIG x[], BIG y[], BIG t[], int n)
+{
+    /* Calculates Most Significant upper half of x*y, given lower part */
+    int nd2;
+
+    nd2 = n / 2;
+    FF_radd(z, n, x, 0, x, nd2, nd2);
+    FF_radd(z, n + nd2, y, 0, y, nd2, nd2);
+    FF_rnorm(z, n, nd2);
+    FF_rnorm(z, n + nd2, nd2);
+
+    FF_karmul(t, 0, z, n + nd2, z, n, t, n, nd2); /* t = (a0+a1)(b0+b1) */
+    FF_karmul(z, n, x, nd2, y, nd2, t, n, nd2); /* z[n]= a1*b1 */
+    /* z[0-nd2]=l(a0b0) z[nd2-n]= h(a0b0)+l(t)-l(a0b0)-l(a1b1) */
+    FF_rdec(t, 0, z, n, n);          /* t=t-a1b1  */
+    FF_rinc(z, nd2, z, 0, nd2); /* z[nd2-n]+=l(a0b0) = h(a0b0)+l(t)-l(a1b1)  */
+    FF_rdec(z, nd2, t, 0, nd2); /* z[nd2-n]=h(a0b0)+l(t)-l(a1b1)-l(t-a1b1)=h(a0b0) */
+    FF_rnorm(z, 0, -n);                 /* a0b0 now in z - truncate it */
+    FF_rdec(t, 0, z, 0, n);     /* (a0+a1)(b0+b1) - a0b0 */
+    FF_rinc(z, nd2, t, 0, n);
+
+    FF_rnorm(z, nd2, n);
+}
+
+/* z=x*y */
+void WWW::FF_mul(BIG z[], BIG x[], BIG y[], int n)
+{
+#ifndef USE_VLAS
+    BIG t[2 * FFLEN_WWW];
+#else
+    BIG t[2 * n];
+#endif
+    FF_karmul(z, 0, x, 0, y, 0, t, 0, n);
+}
+
+/* return low part of product */
+static void WWW::FF_lmul(BIG z[], BIG x[], BIG y[], int n)
+{
+#ifndef USE_VLAS
+    BIG t[2 * FFLEN_WWW];
+#else
+    BIG t[2 * n];
+#endif
+    FF_karmul_lower(z, 0, x, 0, y, 0, t, 0, n);
+}
+
+/* Set b=b mod c */
+void WWW::FF_mod(BIG b[], BIG c[], int n)
+{
+    int k = 0;
+
+    FF_norm(b, n);
+    if (FF_comp(b, c, n) < 0)
+        return;
+    do
+    {
+        FF_shl(c, n);
+        k++;
+    }
+    while (FF_comp(b, c, n) >= 0);
+
+    while (k > 0)
+    {
+        FF_shr(c, n);
+        if (FF_comp(b, c, n) >= 0)
+        {
+            FF_sub(b, b, c, n);
+            FF_norm(b, n);
+        }
+        k--;
+    }
+}
+
+/* z=x^2 */
+void WWW::FF_sqr(BIG z[], BIG x[], int n)
+{
+#ifndef USE_VLAS
+    BIG t[2 * FFLEN_WWW];
+#else
+    BIG t[2 * n];
+#endif
+    FF_karsqr(z, 0, x, 0, t, 0, n);
+}
+
+/* r=t mod modulus, N is modulus, ND is Montgomery Constant */
+static void WWW::FF_reduce(BIG r[], BIG T[], BIG N[], BIG ND[], int n)
+{
+    /* fast karatsuba Montgomery reduction */
+#ifndef USE_VLAS
+    BIG t[2 * FFLEN_WWW];
+    BIG m[FFLEN_WWW];
+#else
+    BIG t[2 * n];
+    BIG m[n];
+#endif
+    WWW::FF_sducopy(r, T, n); /* keep top half of T */
+    FF_karmul_lower(m, 0, T, 0, ND, 0, t, 0, n); /* m=T.(1/N) mod R */
+
+    FF_karmul_upper(T, N, m, t, n); /* T=mN */
+    FF_sducopy(m, T, n);
+
+    FF_add(r, r, N, n);
+    FF_sub(r, r, m, n);
+    FF_norm(r, n);
+}
+
+
+/* Set r=a mod b */
+/* a is of length - 2*n */
+/* r,b is of length - n */
+void WWW::FF_dmod(BIG r[], BIG a[], BIG b[], int n)
+{
+    int k;
+#ifndef USE_VLAS
+    BIG m[2 * FFLEN_WWW];
+    BIG x[2 * FFLEN_WWW];
+#else
+    BIG m[2 * n];
+    BIG x[2 * n];
+#endif
+    FF_copy(x, a, 2 * n);
+    FF_norm(x, 2 * n);
+    FF_dsucopy(m, b, n);
+    k = BIGBITS_XXX * n;
+
+    while (FF_comp(x, m, 2 * n) >= 0)
+    {
+        FF_sub(x, x, m, 2 * n);
+        FF_norm(x, 2 * n);
+    }
+
+    while (k > 0)
+    {
+        FF_shr(m, 2 * n);
+
+        if (FF_comp(x, m, 2 * n) >= 0)
+        {
+            FF_sub(x, x, m, 2 * n);
+            FF_norm(x, 2 * n);
+        }
+
+        k--;
+    }
+    FF_copy(r, x, n);
+    FF_mod(r, b, n);
+}
+
+/* Set r=1/a mod p. Binary method - a<p on entry */
+
+void WWW::FF_invmodp(BIG r[], BIG a[], BIG p[], int n)
+{
+#ifndef USE_VLAS
+    BIG u[FFLEN_WWW], v[FFLEN_WWW], x1[FFLEN_WWW], x2[FFLEN_WWW], t[FFLEN_WWW], one[FFLEN_WWW];
+#else
+    BIG u[n], v[n], x1[n], x2[n], t[n], one[n];
+#endif
+    FF_copy(u, a, n);
+    FF_copy(v, p, n);
+    FF_one(one, n);
+    FF_copy(x1, one, n);
+    FF_zero(x2, n);
+
+// reduce n in here as well!
+    while (FF_comp(u, one, n) != 0 && FF_comp(v, one, n) != 0)
+    {
+        while (FF_parity(u) == 0)
+        {
+            FF_shr(u, n);
+            if (FF_parity(x1) != 0)
+            {
+                FF_add(x1, p, x1, n);
+                FF_norm(x1, n);
+            }
+            FF_shr(x1, n);
+        }
+        while (FF_parity(v) == 0)
+        {
+            FF_shr(v, n);
+            if (FF_parity(x2) != 0)
+            {
+                FF_add(x2, p, x2, n);
+                FF_norm(x2, n);
+            }
+            FF_shr(x2, n);
+        }
+        if (FF_comp(u, v, n) >= 0)
+        {
+
+            FF_sub(u, u, v, n);
+            FF_norm(u, n);
+            if (FF_comp(x1, x2, n) >= 0) FF_sub(x1, x1, x2, n);
+            else
+            {
+                FF_sub(t, p, x2, n);
+                FF_add(x1, x1, t, n);
+            }
+            FF_norm(x1, n);
+        }
+        else
+        {
+            FF_sub(v, v, u, n);
+            FF_norm(v, n);
+            if (FF_comp(x2, x1, n) >= 0) FF_sub(x2, x2, x1, n);
+            else
+            {
+                FF_sub(t, p, x1, n);
+                FF_add(x2, x2, t, n);
+            }
+            FF_norm(x2, n);
+        }
+    }
+    if (FF_comp(u, one, n) == 0)
+        FF_copy(r, x1, n);
+    else
+        FF_copy(r, x2, n);
+}
+
+/* nesidue mod m */
+static void WWW::FF_nres(BIG a[], BIG m[], int n)
+{
+#ifndef USE_VLAS
+    BIG d[2 * FFLEN_WWW];
+#else
+    BIG d[2 * n];
+#endif
+    if (n == 1)
+    {
+        BIG_dscopy(d[0], a[0]);
+        BIG_dshl(d[0], NLEN_XXX * BASEBITS_XXX);
+        BIG_dmod(a[0], d[0], m[0]);
+    }
+    else
+    {
+        FF_dsucopy(d, a, n);
+        FF_dmod(a, d, m, n);
+    }
+}
+
+static void WWW::FF_redc(BIG a[], BIG m[], BIG ND[], int n)
+{
+#ifndef USE_VLAS
+    BIG d[2 * FFLEN_WWW];
+#else
+    BIG d[2 * n];
+#endif
+    if (n == 1)
+    {
+        BIG_dzero(d[0]);
+        BIG_dscopy(d[0], a[0]);
+        BIG_monty(a[0], m[0], ((chunk)1 << BASEBITS_XXX) - ND[0][0], d[0]);
+    }
+    else
+    {
+        FF_mod(a, m, n);
+        FF_dscopy(d, a, n);
+        FF_reduce(a, d, m, ND, n);
+        FF_mod(a, m, n);
+    }
+}
+
+/* U=1/a mod 2^m - Arazi & Qi */
+static void WWW::FF_invmod2m(BIG U[], BIG a[], int n)
+{
+    int i;
+#ifndef USE_VLAS
+    BIG t1[2*FFLEN_WWW], b[FFLEN_WWW], c[FFLEN_WWW];
+#else
+    BIG t1[2 * n], b[n], c[n];
+#endif
+
+    FF_zero(U, n);
+    FF_zero(b, n);
+    FF_zero(c, n);
+    FF_zero(t1, 2 * n);
+
+    BIG_copy(U[0], a[0]);
+    BIG_invmod2m(U[0]);
+    for (i = 1; i < n; i <<= 1)
+    {
+        FF_copy(b, a, i);
+        FF_mul(t1, U, b, i);
+        FF_shrw(t1, i); // top half to bottom half, top half=0
+
+        FF_copy(c, a, 2 * i);
+        FF_shrw(c, i); // top half of c
+        FF_lmul(b, U, c, i); // should set top half of b=0
+        FF_add(t1, t1, b, i);
+        FF_norm(t1, 2 * i);
+        FF_lmul(b, t1, U, i);
+        FF_copy(t1, b, i);
+        FF_one(b, i);
+        FF_shlw(b, i);
+        FF_sub(t1, b, t1, 2 * i);
+        FF_norm(t1, 2 * i);
+        FF_shlw(t1, i);
+        FF_add(U, U, t1, 2 * i);
+    }
+
+    FF_norm(U, n);
+}
+
+void WWW::FF_random(BIG x[], csprng *rng, int n)
+{
+    int i;
+    for (i = 0; i < n; i++)
+    {
+        BIG_random(x[i], rng);
+    }
+    /* make sure top bit is 1 */
+    while (BIG_nbits(x[n - 1]) < MODBYTES_XXX * 8) BIG_random(x[n - 1], rng);
+}
+
+/* generate random x mod p */
+void WWW::FF_randomnum(BIG x[], BIG p[], csprng *rng, int n)
+{
+    int i;
+#ifndef USE_VLAS
+    BIG d[2 * FFLEN_WWW];
+#else
+    BIG d[2 * n];
+#endif
+    for (i = 0; i < 2 * n; i++)
+    {
+        BIG_random(d[i], rng);
+    }
+    FF_dmod(x, d, p, n);
+}
+
+static void WWW::FF_modmul(BIG z[], BIG x[], BIG y[], BIG p[], BIG ND[], int n)
+{
+#ifndef USE_VLAS
+    BIG d[2 * FFLEN_WWW];
+#else
+    BIG d[2 * n];
+#endif
+    chunk ex = P_EXCESS_WWW(x[n - 1]);
+    chunk ey = P_EXCESS_WWW(y[n - 1]);
+#ifdef dchunk
+    if ((dchunk)(ex + 1) * (ey + 1) > (dchunk)P_FEXCESS_WWW)
+#else
+    if ((ex + 1) > P_FEXCESS_WWW / (ey + 1))
+#endif
+    {
+#ifdef DEBUG_REDUCE
+        printf("Product too large - reducing it %d %d\n", ex, ey);
+#endif
+        FF_mod(x, p, n);
+    }
+
+    if (n == 1)
+    {
+        BIG_mul(d[0], x[0], y[0]);
+        BIG_monty(z[0], p[0], ((chunk)1 << BASEBITS_XXX) - ND[0][0], d[0]);
+    }
+    else
+    {
+        FF_mul(d, x, y, n);
+        FF_reduce(z, d, p, ND, n);
+    }
+}
+
+static void WWW::FF_modsqr(BIG z[], BIG x[], BIG p[], BIG ND[], int n)
+{
+#ifndef USE_VLAS
+    BIG d[2 * FFLEN_WWW];
+#else
+    BIG d[2 * n];
+#endif
+    chunk ex = P_EXCESS_WWW(x[n - 1]);
+#ifdef dchunk
+    if ((dchunk)(ex + 1) * (ex + 1) > (dchunk)P_FEXCESS_WWW)
+#else
+    if ((ex + 1) > P_FEXCESS_WWW / (ex + 1))
+#endif
+    {
+#ifdef DEBUG_REDUCE
+        printf("Product too large - reducing it %d\n", ex);
+#endif
+        FF_mod(x, p, n);
+    }
+    if (n == 1)
+    {
+        BIG_sqr(d[0], x[0]);
+        BIG_monty(z[0], p[0], ((chunk)1 << BASEBITS_XXX) - ND[0][0], d[0]);
+    }
+    else
+    {
+        FF_sqr(d, x, n);
+        FF_reduce(z, d, p, ND, n);
+    }
+}
+
+/* r=x^e mod p using side-channel resistant Montgomery Ladder, for large e */
+void WWW::FF_skpow(BIG r[], BIG x[], BIG e[], BIG p[], int n)
+{
+    int i, b;
+#ifndef USE_VLAS
+    BIG R0[FFLEN_WWW], R1[FFLEN_WWW], ND[FFLEN_WWW];
+#else
+    BIG R0[n], R1[n], ND[n];
+#endif
+    FF_invmod2m(ND, p, n);
+
+    FF_one(R0, n);
+    FF_copy(R1, x, n);
+    FF_nres(R0, p, n);
+    FF_nres(R1, p, n);
+
+    for (i = 8 * MODBYTES_XXX * n - 1; i >= 0; i--)
+    {
+        b = BIG_bit(e[i / BIGBITS_XXX], i % BIGBITS_XXX);
+        FF_modmul(r, R0, R1, p, ND, n);
+
+        FF_cswap(R0, R1, b, n);
+        FF_modsqr(R0, R0, p, ND, n);
+
+        FF_copy(R1, r, n);
+        FF_cswap(R0, R1, b, n);
+    }
+    FF_copy(r, R0, n);
+    FF_redc(r, p, ND, n);
+}
+
+/* r=x^e mod p using side-channel resistant Montgomery Ladder, for short e */
+void WWW::FF_skspow(BIG r[], BIG x[], BIG e, BIG p[], int n)
+{
+    int i, b;
+#ifndef USE_VLAS
+    BIG R0[FFLEN_WWW], R1[FFLEN_WWW], ND[FFLEN_WWW];
+#else
+    BIG R0[n], R1[n], ND[n];
+#endif
+    FF_invmod2m(ND, p, n);
+    FF_one(R0, n);
+    FF_copy(R1, x, n);
+    FF_nres(R0, p, n);
+    FF_nres(R1, p, n);
+    for (i = 8 * MODBYTES_XXX - 1; i >= 0; i--)
+    {
+        b = BIG_bit(e, i);
+        FF_modmul(r, R0, R1, p, ND, n);
+        FF_cswap(R0, R1, b, n);
+        FF_modsqr(R0, R0, p, ND, n);
+        FF_copy(R1, r, n);
+        FF_cswap(R0, R1, b, n);
+    }
+    FF_copy(r, R0, n);
+    FF_redc(r, p, ND, n);
+}
+
+/* raise to an integer power - right-to-left method */
+void WWW::FF_power(BIG r[], BIG x[], int e, BIG p[], int n)
+{
+    int f = 1;
+#ifndef USE_VLAS
+    BIG w[FFLEN_WWW], ND[FFLEN_WWW];
+#else
+    BIG w[n], ND[n];
+#endif
+    FF_invmod2m(ND, p, n);
+
+    FF_copy(w, x, n);
+    FF_nres(w, p, n);
+
+    if (e == 2)
+    {
+        FF_modsqr(r, w, p, ND, n);
+    }
+    else for (;;)
+        {
+            if (e % 2 == 1)
+            {
+                if (f) FF_copy(r, w, n);
+                else FF_modmul(r, r, w, p, ND, n);
+                f = 0;
+            }
+            e >>= 1;
+            if (e == 0) break;
+            FF_modsqr(w, w, p, ND, n);
+        }
+
+    FF_redc(r, p, ND, n);
+}
+
+/* r=x^e mod p, faster but not side channel resistant */
+void WWW::FF_pow(BIG r[], BIG x[], BIG e[], BIG p[], int n)
+{
+    int i, b;
+#ifndef USE_VLAS
+    BIG w[FFLEN_WWW], ND[FFLEN_WWW];
+#else
+    BIG w[n], ND[n];
+#endif
+    FF_invmod2m(ND, p, n);
+
+    FF_copy(w, x, n);
+    FF_one(r, n);
+    FF_nres(r, p, n);
+    FF_nres(w, p, n);
+
+    for (i = 8 * MODBYTES_XXX * n - 1; i >= 0; i--)
+    {
+        FF_modsqr(r, r, p, ND, n);
+        b = BIG_bit(e[i / BIGBITS_XXX], i % BIGBITS_XXX);
+        if (b == 1) FF_modmul(r, r, w, p, ND, n);
+    }
+    FF_redc(r, p, ND, n);
+}
+
+/* double exponentiation r=x^e.y^f mod p */
+void WWW::FF_pow2(BIG r[], BIG x[], BIG e, BIG y[], BIG f, BIG p[], int n)
+{
+    int i, eb, fb;
+#ifndef USE_VLAS
+    BIG xn[FFLEN_WWW], yn[FFLEN_WWW], xy[FFLEN_WWW], ND[FFLEN_WWW];
+#else
+    BIG xn[n], yn[n], xy[n], ND[n];
+#endif
+
+    FF_invmod2m(ND, p, n);
+
+    FF_copy(xn, x, n);
+    FF_copy(yn, y, n);
+    FF_nres(xn, p, n);
+    FF_nres(yn, p, n);
+    FF_modmul(xy, xn, yn, p, ND, n);
+    FF_one(r, n);
+    FF_nres(r, p, n);
+
+    for (i = 8 * MODBYTES_XXX - 1; i >= 0; i--)
+    {
+        eb = BIG_bit(e, i);
+        fb = BIG_bit(f, i);
+        FF_modsqr(r, r, p, ND, n);
+        if (eb == 1)
+        {
+            if (fb == 1) FF_modmul(r, r, xy, p, ND, n);
+            else FF_modmul(r, r, xn, p, ND, n);
+        }
+        else
+        {
+            if (fb == 1) FF_modmul(r, r, yn, p, ND, n);
+        }
+    }
+    FF_redc(r, p, ND, n);
+}
+
+static sign32 igcd(sign32 x, sign32 y)
+{
+    /* integer GCD, returns GCD of x and y */
+    sign32 r;
+    if (y == 0) return x;
+    while ((r = x % y) != 0)
+        x = y, y = r;
+    return y;
+}
+
+/* quick and dirty check for common factor with s */
+int WWW::FF_cfactor(BIG w[], sign32 s, int n)
+{
+    int r;
+    sign32 g;
+#ifndef USE_VLAS
+    BIG x[FFLEN_WWW], y[FFLEN_WWW];
+#else
+    BIG x[n], y[n];
+#endif
+    FF_init(y, s, n);
+    FF_copy(x, w, n);
+    FF_norm(x, n);
+
+    do
+    {
+        FF_sub(x, x, y, n);
+        FF_norm(x, n);
+        while (!FF_iszilch(x, n) && FF_parity(x) == 0) FF_shr(x, n);
+    }
+    while (FF_comp(x, y, n) > 0);
+#if CHUNK<32
+    g = x[0][0] + ((sign32)(x[0][1]) << BASEBITS_XXX);
+#else
+    g = (sign32)x[0][0];
+#endif
+    r = igcd(s, g);
+    if (r > 1) return 1;
+    return 0;
+}
+
+/* Miller-Rabin test for primality. Slow. */
+int WWW::FF_prime(BIG p[], csprng *rng, int n)
+{
+    int i, j, loop, s = 0;
+#ifndef USE_VLAS
+    BIG d[FFLEN_WWW], x[FFLEN_WWW], unity[FFLEN_WWW], nm1[FFLEN_WWW];
+#else
+    BIG d[n], x[n], unity[n], nm1[n];
+#endif
+    sign32 sf = 4849845; /* 3*5*.. *19 */
+
+    FF_norm(p, n);
+
+    if (FF_cfactor(p, sf, n)) return 0;
+
+    FF_one(unity, n);
+    FF_sub(nm1, p, unity, n);
+    FF_norm(nm1, n);
+    FF_copy(d, nm1, n);
+    while (FF_parity(d) == 0)
+    {
+        FF_shr(d, n);
+        s++;
+    }
+    if (s == 0) return 0;
+
+    for (i = 0; i < 10; i++)
+    {
+        FF_randomnum(x, p, rng, n);
+        FF_pow(x, x, d, p, n);
+        if (FF_comp(x, unity, n) == 0 || FF_comp(x, nm1, n) == 0) continue;
+        loop = 0;
+        for (j = 1; j < s; j++)
+        {
+            FF_power(x, x, 2, p, n);
+            if (FF_comp(x, unity, n) == 0) return 0;
+            if (FF_comp(x, nm1, n) == 0 )
+            {
+                loop = 1;
+                break;
+            }
+        }
+        if (loop) continue;
+        return 0;
+    }
+
+    return 1;
+}
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ff.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ff.h
new file mode 100644
index 0000000..8220fa0
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ff.h
@@ -0,0 +1,295 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FF_WWW_H
+#define FF_WWW_H
+
+#include "big_XXX.h"
+#include "config_ff_WWW.h"
+
+using namespace core;
+
+#define HFLEN_WWW (FFLEN_WWW/2) /**< Useful for half-size RSA private key operations */
+#define P_MBITS_WWW (MODBYTES_XXX*8)
+#define P_TBITS_WWW (P_MBITS_WWW%BASEBITS_XXX)
+#define P_EXCESS_WWW(a) (((a[NLEN_XXX-1])>>(P_TBITS_WWW))+1)
+#define P_FEXCESS_WWW ((chunk)1<<(BASEBITS_XXX*NLEN_XXX-P_MBITS_WWW-1))
+
+
+namespace WWW {
+
+/* Finite Field Prototypes */
+/**	@brief Copy one FF element of given length to another
+ *
+	@param x FF instance to be copied to, on exit = y
+	@param y FF instance to be copied from
+	@param n size of FF in BIGs
+
+ */
+extern void FF_copy(XXX::BIG *x, XXX::BIG *y, int n);
+/**	@brief Initialize an FF element of given length from a 32-bit integer m
+ *
+	@param x FF instance to be copied to, on exit = m
+	@param m integer
+	@param n size of FF in BIGs
+ */
+extern void FF_init(XXX::BIG *x, sign32 m, int n);
+/**	@brief Set FF element of given size to zero
+ *
+	@param x FF instance to be set to zero
+	@param n size of FF in BIGs
+ */
+extern void FF_zero(XXX::BIG *x, int n);
+/**	@brief Tests for FF element equal to zero
+ *
+	@param x FF number to be tested
+	@param n size of FF in BIGs
+	@return 1 if zero, else returns 0
+ */
+extern int FF_iszilch(XXX::BIG *x, int n);
+/**	@brief  return parity of an FF, that is the least significant bit
+ *
+	@param x FF number
+	@return 0 or 1
+ */
+extern int FF_parity(XXX::BIG *x);
+/**	@brief  return least significant m bits of an FF
+ *
+	@param x FF number
+	@param m number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int FF_lastbits(XXX::BIG *x, int m);
+/**	@brief Set FF element of given size to unity
+ *
+	@param x FF instance to be set to unity
+	@param n size of FF in BIGs
+ */
+extern void FF_one(XXX::BIG *x, int n);
+/**	@brief Compares two FF numbers. Inputs must be normalised externally
+ *
+	@param x first FF number to be compared
+	@param y second FF number to be compared
+	@param n size of FF in BIGs
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int FF_comp(XXX::BIG *x, XXX::BIG *y, int n);
+/**	@brief addition of two FFs
+ *
+	@param x FF instance, on exit = y+z
+	@param y FF instance
+	@param z FF instance
+	@param n size of FF in BIGs
+ */
+extern void FF_add(XXX::BIG *x, XXX::BIG *y, XXX::BIG *z, int n);
+/**	@brief subtraction of two FFs
+ *
+	@param x FF instance, on exit = y-z
+	@param y FF instance
+	@param z FF instance
+	@param n size of FF in BIGs
+ */
+extern void FF_sub(XXX::BIG *x, XXX::BIG *y, XXX::BIG *z, int n);
+/**	@brief increment an FF by an integer,and normalise
+ *
+	@param x FF instance, on exit = x+m
+	@param m an integer to be added to x
+	@param n size of FF in BIGs
+ */
+extern void FF_inc(XXX::BIG *x, int m, int n);
+/**	@brief Decrement an FF by an integer,and normalise
+ *
+	@param x FF instance, on exit = x-m
+	@param m an integer to be subtracted from x
+	@param n size of FF in BIGs
+ */
+extern void FF_dec(XXX::BIG *x, int m, int n);
+/**	@brief Normalises the components of an FF
+ *
+	@param x FF instance to be normalised
+	@param n size of FF in BIGs
+ */
+extern void FF_norm(XXX::BIG *x, int n);
+/**	@brief Shift left an FF by 1 bit
+ *
+	@param x FF instance to be shifted left
+	@param n size of FF in BIGs
+ */
+extern void FF_shl(XXX::BIG *x, int n);
+/**	@brief Shift right an FF by 1 bit
+ *
+	@param x FF instance to be shifted right
+	@param n size of FF in BIGs
+ */
+extern void FF_shr(XXX::BIG *x, int n);
+/**	@brief Formats and outputs an FF to the console
+ *
+	@param x FF instance to be printed
+	@param n size of FF in BIGs
+ */
+extern void FF_output(XXX::BIG *x, int n);
+/**	@brief Formats and outputs an FF to the console, in raw form
+ *
+ 	@param x FF instance to be printed
+ 	@param n size of FF in BIGs
+ */
+extern void FF_rawoutput(XXX::BIG *x, int n);
+/**	@brief Formats and outputs an FF instance to an octet string
+ *
+	Converts an FF to big-endian base 256 form.
+	@param S output octet string
+	@param x FF instance to be converted to an octet string
+	@param n size of FF in BIGs
+ */
+extern void FF_toOctet(octet *S, XXX::BIG *x, int n);
+/**	@brief Populates an FF instance from an octet string
+ *
+	Creates FF from big-endian base 256 form.
+	@param x FF instance to be created from an octet string
+	@param S input octet string
+	@param n size of FF in BIGs
+ */
+extern void FF_fromOctet(XXX::BIG *x, octet *S, int n);
+/**	@brief Multiplication of two FFs
+ *
+	Uses Karatsuba method internally
+	@param x FF instance, on exit = y*z
+	@param y FF instance
+	@param z FF instance
+	@param n size of FF in BIGs
+ */
+extern void FF_mul(XXX::BIG *x, XXX::BIG *y, XXX::BIG *z, int n);
+/**	@brief Reduce FF mod a modulus
+ *
+	This is slow
+	@param x FF instance to be reduced mod m - on exit = x mod m
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_mod(XXX::BIG *x, XXX::BIG *m, int n);
+/**	@brief Square an FF
+ *
+	Uses Karatsuba method internally
+	@param x FF instance, on exit = y^2
+	@param y FF instance to be squared
+	@param n size of FF in BIGs
+ */
+extern void FF_sqr(XXX::BIG *x, XXX::BIG *y, int n);
+/**	@brief Reduces a double-length FF with respect to a given modulus
+ *
+	This is slow
+	@param x FF instance, on exit = y mod z
+	@param y FF instance, of double length 2*n
+	@param z FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_dmod(XXX::BIG *x, XXX::BIG *y, XXX::BIG *z, int n);
+/**	@brief Invert an FF mod a prime modulus
+ *
+	@param x FF instance, on exit = 1/y mod z
+	@param y FF instance
+	@param z FF prime modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_invmodp(XXX::BIG *x, XXX::BIG *y, XXX::BIG *z, int n);
+/**	@brief Create an FF from a random number generator
+ *
+	@param x FF instance, on exit x is a random number of length n BIGs with most significant bit a 1
+	@param R an instance of a Cryptographically Secure Random Number Generator
+	@param n size of FF in BIGs
+ */
+extern void FF_random(XXX::BIG *x, csprng *R, int n);
+/**	@brief Create a random FF less than a given modulus from a random number generator
+ *
+	@param x FF instance, on exit x is a random number < y
+	@param y FF instance, the modulus
+	@param R an instance of a Cryptographically Secure Random Number Generator
+	@param n size of FF in BIGs
+ */
+extern void FF_randomnum(XXX::BIG *x, XXX::BIG *y, csprng *R, int n);
+/**	@brief Calculate r=x^e mod m, side channel resistant
+ *
+	@param r FF instance, on exit = x^e mod p
+	@param x FF instance
+	@param e FF exponent
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_skpow(XXX::BIG *r, XXX::BIG *x, XXX::BIG * e, XXX::BIG *m, int n);
+/**	@brief Calculate r=x^e mod m, side channel resistant
+ *
+	For short BIG exponent
+	@param r FF instance, on exit = x^e mod p
+	@param x FF instance
+	@param e BIG exponent
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_skspow(XXX::BIG *r, XXX::BIG *x, XXX::BIG e, XXX::BIG *m, int n);
+/**	@brief Calculate r=x^e mod m
+ *
+	For very short integer exponent
+	@param r FF instance, on exit = x^e mod p
+	@param x FF instance
+	@param e integer exponent
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_power(XXX::BIG *r, XXX::BIG *x, int e, XXX::BIG *m, int n);
+/**	@brief Calculate r=x^e mod m
+ *
+	@param r FF instance, on exit = x^e mod p
+	@param x FF instance
+	@param e FF exponent
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_pow(XXX::BIG *r, XXX::BIG *x, XXX::BIG *e, XXX::BIG *m, int n);
+/**	@brief Test if an FF has factor in common with integer s
+ *
+	@param x FF instance to be tested
+	@param s the supplied integer
+	@param n size of FF in BIGs
+	@return 1 if gcd(x,s)!=1, else return 0
+ */
+extern int FF_cfactor(XXX::BIG *x, sign32 s, int n);
+/**	@brief Test if an FF is prime
+ *
+	Uses Miller-Rabin Method
+	@param x FF instance to be tested
+	@param R an instance of a Cryptographically Secure Random Number Generator
+	@param n size of FF in BIGs
+	@return 1 if x is (almost certainly) prime, else return 0
+ */
+extern int FF_prime(XXX::BIG *x, csprng *R, int n);
+/**	@brief Calculate r=x^e.y^f mod m
+ *
+	@param r FF instance, on exit = x^e.y^f mod p
+	@param x FF instance
+	@param e BIG exponent
+	@param y FF instance
+	@param f BIG exponent
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_pow2(XXX::BIG *r, XXX::BIG *x, XXX::BIG e, XXX::BIG *y, XXX::BIG f, XXX::BIG *m, int n);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ff_RSA2048.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ff_RSA2048.h
new file mode 100644
index 0000000..55adf04
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ff_RSA2048.h
@@ -0,0 +1,295 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FF_RSA2048_H
+#define FF_RSA2048_H
+
+#include "big_B512_60.h"
+#include "config_ff_RSA2048.h"
+
+using namespace core;
+
+#define HFLEN_RSA2048 (FFLEN_RSA2048/2) /**< Useful for half-size RSA private key operations */
+#define P_MBITS_RSA2048 (MODBYTES_B512_60*8)
+#define P_TBITS_RSA2048 (P_MBITS_RSA2048%BASEBITS_B512_60)
+#define P_EXCESS_RSA2048(a) (((a[NLEN_B512_60-1])>>(P_TBITS_RSA2048))+1)
+#define P_FEXCESS_RSA2048 ((chunk)1<<(BASEBITS_B512_60*NLEN_B512_60-P_MBITS_RSA2048-1))
+
+
+namespace RSA2048 {
+
+/* Finite Field Prototypes */
+/**	@brief Copy one FF element of given length to another
+ *
+	@param x FF instance to be copied to, on exit = y
+	@param y FF instance to be copied from
+	@param n size of FF in BIGs
+
+ */
+extern void FF_copy(B512_60::BIG *x, B512_60::BIG *y, int n);
+/**	@brief Initialize an FF element of given length from a 32-bit integer m
+ *
+	@param x FF instance to be copied to, on exit = m
+	@param m integer
+	@param n size of FF in BIGs
+ */
+extern void FF_init(B512_60::BIG *x, sign32 m, int n);
+/**	@brief Set FF element of given size to zero
+ *
+	@param x FF instance to be set to zero
+	@param n size of FF in BIGs
+ */
+extern void FF_zero(B512_60::BIG *x, int n);
+/**	@brief Tests for FF element equal to zero
+ *
+	@param x FF number to be tested
+	@param n size of FF in BIGs
+	@return 1 if zero, else returns 0
+ */
+extern int FF_iszilch(B512_60::BIG *x, int n);
+/**	@brief  return parity of an FF, that is the least significant bit
+ *
+	@param x FF number
+	@return 0 or 1
+ */
+extern int FF_parity(B512_60::BIG *x);
+/**	@brief  return least significant m bits of an FF
+ *
+	@param x FF number
+	@param m number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int FF_lastbits(B512_60::BIG *x, int m);
+/**	@brief Set FF element of given size to unity
+ *
+	@param x FF instance to be set to unity
+	@param n size of FF in BIGs
+ */
+extern void FF_one(B512_60::BIG *x, int n);
+/**	@brief Compares two FF numbers. Inputs must be normalised externally
+ *
+	@param x first FF number to be compared
+	@param y second FF number to be compared
+	@param n size of FF in BIGs
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int FF_comp(B512_60::BIG *x, B512_60::BIG *y, int n);
+/**	@brief addition of two FFs
+ *
+	@param x FF instance, on exit = y+z
+	@param y FF instance
+	@param z FF instance
+	@param n size of FF in BIGs
+ */
+extern void FF_add(B512_60::BIG *x, B512_60::BIG *y, B512_60::BIG *z, int n);
+/**	@brief subtraction of two FFs
+ *
+	@param x FF instance, on exit = y-z
+	@param y FF instance
+	@param z FF instance
+	@param n size of FF in BIGs
+ */
+extern void FF_sub(B512_60::BIG *x, B512_60::BIG *y, B512_60::BIG *z, int n);
+/**	@brief increment an FF by an integer,and normalise
+ *
+	@param x FF instance, on exit = x+m
+	@param m an integer to be added to x
+	@param n size of FF in BIGs
+ */
+extern void FF_inc(B512_60::BIG *x, int m, int n);
+/**	@brief Decrement an FF by an integer,and normalise
+ *
+	@param x FF instance, on exit = x-m
+	@param m an integer to be subtracted from x
+	@param n size of FF in BIGs
+ */
+extern void FF_dec(B512_60::BIG *x, int m, int n);
+/**	@brief Normalises the components of an FF
+ *
+	@param x FF instance to be normalised
+	@param n size of FF in BIGs
+ */
+extern void FF_norm(B512_60::BIG *x, int n);
+/**	@brief Shift left an FF by 1 bit
+ *
+	@param x FF instance to be shifted left
+	@param n size of FF in BIGs
+ */
+extern void FF_shl(B512_60::BIG *x, int n);
+/**	@brief Shift right an FF by 1 bit
+ *
+	@param x FF instance to be shifted right
+	@param n size of FF in BIGs
+ */
+extern void FF_shr(B512_60::BIG *x, int n);
+/**	@brief Formats and outputs an FF to the console
+ *
+	@param x FF instance to be printed
+	@param n size of FF in BIGs
+ */
+extern void FF_output(B512_60::BIG *x, int n);
+/**	@brief Formats and outputs an FF to the console, in raw form
+ *
+ 	@param x FF instance to be printed
+ 	@param n size of FF in BIGs
+ */
+extern void FF_rawoutput(B512_60::BIG *x, int n);
+/**	@brief Formats and outputs an FF instance to an octet string
+ *
+	Converts an FF to big-endian base 256 form.
+	@param S output octet string
+	@param x FF instance to be converted to an octet string
+	@param n size of FF in BIGs
+ */
+extern void FF_toOctet(octet *S, B512_60::BIG *x, int n);
+/**	@brief Populates an FF instance from an octet string
+ *
+	Creates FF from big-endian base 256 form.
+	@param x FF instance to be created from an octet string
+	@param S input octet string
+	@param n size of FF in BIGs
+ */
+extern void FF_fromOctet(B512_60::BIG *x, octet *S, int n);
+/**	@brief Multiplication of two FFs
+ *
+	Uses Karatsuba method internally
+	@param x FF instance, on exit = y*z
+	@param y FF instance
+	@param z FF instance
+	@param n size of FF in BIGs
+ */
+extern void FF_mul(B512_60::BIG *x, B512_60::BIG *y, B512_60::BIG *z, int n);
+/**	@brief Reduce FF mod a modulus
+ *
+	This is slow
+	@param x FF instance to be reduced mod m - on exit = x mod m
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_mod(B512_60::BIG *x, B512_60::BIG *m, int n);
+/**	@brief Square an FF
+ *
+	Uses Karatsuba method internally
+	@param x FF instance, on exit = y^2
+	@param y FF instance to be squared
+	@param n size of FF in BIGs
+ */
+extern void FF_sqr(B512_60::BIG *x, B512_60::BIG *y, int n);
+/**	@brief Reduces a double-length FF with respect to a given modulus
+ *
+	This is slow
+	@param x FF instance, on exit = y mod z
+	@param y FF instance, of double length 2*n
+	@param z FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_dmod(B512_60::BIG *x, B512_60::BIG *y, B512_60::BIG *z, int n);
+/**	@brief Invert an FF mod a prime modulus
+ *
+	@param x FF instance, on exit = 1/y mod z
+	@param y FF instance
+	@param z FF prime modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_invmodp(B512_60::BIG *x, B512_60::BIG *y, B512_60::BIG *z, int n);
+/**	@brief Create an FF from a random number generator
+ *
+	@param x FF instance, on exit x is a random number of length n BIGs with most significant bit a 1
+	@param R an instance of a Cryptographically Secure Random Number Generator
+	@param n size of FF in BIGs
+ */
+extern void FF_random(B512_60::BIG *x, csprng *R, int n);
+/**	@brief Create a random FF less than a given modulus from a random number generator
+ *
+	@param x FF instance, on exit x is a random number < y
+	@param y FF instance, the modulus
+	@param R an instance of a Cryptographically Secure Random Number Generator
+	@param n size of FF in BIGs
+ */
+extern void FF_randomnum(B512_60::BIG *x, B512_60::BIG *y, csprng *R, int n);
+/**	@brief Calculate r=x^e mod m, side channel resistant
+ *
+	@param r FF instance, on exit = x^e mod p
+	@param x FF instance
+	@param e FF exponent
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_skpow(B512_60::BIG *r, B512_60::BIG *x, B512_60::BIG * e, B512_60::BIG *m, int n);
+/**	@brief Calculate r=x^e mod m, side channel resistant
+ *
+	For short BIG exponent
+	@param r FF instance, on exit = x^e mod p
+	@param x FF instance
+	@param e BIG exponent
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_skspow(B512_60::BIG *r, B512_60::BIG *x, B512_60::BIG e, B512_60::BIG *m, int n);
+/**	@brief Calculate r=x^e mod m
+ *
+	For very short integer exponent
+	@param r FF instance, on exit = x^e mod p
+	@param x FF instance
+	@param e integer exponent
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_power(B512_60::BIG *r, B512_60::BIG *x, int e, B512_60::BIG *m, int n);
+/**	@brief Calculate r=x^e mod m
+ *
+	@param r FF instance, on exit = x^e mod p
+	@param x FF instance
+	@param e FF exponent
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_pow(B512_60::BIG *r, B512_60::BIG *x, B512_60::BIG *e, B512_60::BIG *m, int n);
+/**	@brief Test if an FF has factor in common with integer s
+ *
+	@param x FF instance to be tested
+	@param s the supplied integer
+	@param n size of FF in BIGs
+	@return 1 if gcd(x,s)!=1, else return 0
+ */
+extern int FF_cfactor(B512_60::BIG *x, sign32 s, int n);
+/**	@brief Test if an FF is prime
+ *
+	Uses Miller-Rabin Method
+	@param x FF instance to be tested
+	@param R an instance of a Cryptographically Secure Random Number Generator
+	@param n size of FF in BIGs
+	@return 1 if x is (almost certainly) prime, else return 0
+ */
+extern int FF_prime(B512_60::BIG *x, csprng *R, int n);
+/**	@brief Calculate r=x^e.y^f mod m
+ *
+	@param r FF instance, on exit = x^e.y^f mod p
+	@param x FF instance
+	@param e BIG exponent
+	@param y FF instance
+	@param f BIG exponent
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_pow2(B512_60::BIG *r, B512_60::BIG *x, B512_60::BIG e, B512_60::BIG *y, B512_60::BIG f, B512_60::BIG *m, int n);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ff_RSA3072.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ff_RSA3072.h
new file mode 100644
index 0000000..82554cf
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ff_RSA3072.h
@@ -0,0 +1,295 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FF_RSA3072_H
+#define FF_RSA3072_H
+
+#include "big_B384_56.h"
+#include "config_ff_RSA3072.h"
+
+using namespace core;
+
+#define HFLEN_RSA3072 (FFLEN_RSA3072/2) /**< Useful for half-size RSA private key operations */
+#define P_MBITS_RSA3072 (MODBYTES_B384_56*8)
+#define P_TBITS_RSA3072 (P_MBITS_RSA3072%BASEBITS_B384_56)
+#define P_EXCESS_RSA3072(a) (((a[NLEN_B384_56-1])>>(P_TBITS_RSA3072))+1)
+#define P_FEXCESS_RSA3072 ((chunk)1<<(BASEBITS_B384_56*NLEN_B384_56-P_MBITS_RSA3072-1))
+
+
+namespace RSA3072 {
+
+/* Finite Field Prototypes */
+/**	@brief Copy one FF element of given length to another
+ *
+	@param x FF instance to be copied to, on exit = y
+	@param y FF instance to be copied from
+	@param n size of FF in BIGs
+
+ */
+extern void FF_copy(B384_56::BIG *x, B384_56::BIG *y, int n);
+/**	@brief Initialize an FF element of given length from a 32-bit integer m
+ *
+	@param x FF instance to be copied to, on exit = m
+	@param m integer
+	@param n size of FF in BIGs
+ */
+extern void FF_init(B384_56::BIG *x, sign32 m, int n);
+/**	@brief Set FF element of given size to zero
+ *
+	@param x FF instance to be set to zero
+	@param n size of FF in BIGs
+ */
+extern void FF_zero(B384_56::BIG *x, int n);
+/**	@brief Tests for FF element equal to zero
+ *
+	@param x FF number to be tested
+	@param n size of FF in BIGs
+	@return 1 if zero, else returns 0
+ */
+extern int FF_iszilch(B384_56::BIG *x, int n);
+/**	@brief  return parity of an FF, that is the least significant bit
+ *
+	@param x FF number
+	@return 0 or 1
+ */
+extern int FF_parity(B384_56::BIG *x);
+/**	@brief  return least significant m bits of an FF
+ *
+	@param x FF number
+	@param m number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int FF_lastbits(B384_56::BIG *x, int m);
+/**	@brief Set FF element of given size to unity
+ *
+	@param x FF instance to be set to unity
+	@param n size of FF in BIGs
+ */
+extern void FF_one(B384_56::BIG *x, int n);
+/**	@brief Compares two FF numbers. Inputs must be normalised externally
+ *
+	@param x first FF number to be compared
+	@param y second FF number to be compared
+	@param n size of FF in BIGs
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int FF_comp(B384_56::BIG *x, B384_56::BIG *y, int n);
+/**	@brief addition of two FFs
+ *
+	@param x FF instance, on exit = y+z
+	@param y FF instance
+	@param z FF instance
+	@param n size of FF in BIGs
+ */
+extern void FF_add(B384_56::BIG *x, B384_56::BIG *y, B384_56::BIG *z, int n);
+/**	@brief subtraction of two FFs
+ *
+	@param x FF instance, on exit = y-z
+	@param y FF instance
+	@param z FF instance
+	@param n size of FF in BIGs
+ */
+extern void FF_sub(B384_56::BIG *x, B384_56::BIG *y, B384_56::BIG *z, int n);
+/**	@brief increment an FF by an integer,and normalise
+ *
+	@param x FF instance, on exit = x+m
+	@param m an integer to be added to x
+	@param n size of FF in BIGs
+ */
+extern void FF_inc(B384_56::BIG *x, int m, int n);
+/**	@brief Decrement an FF by an integer,and normalise
+ *
+	@param x FF instance, on exit = x-m
+	@param m an integer to be subtracted from x
+	@param n size of FF in BIGs
+ */
+extern void FF_dec(B384_56::BIG *x, int m, int n);
+/**	@brief Normalises the components of an FF
+ *
+	@param x FF instance to be normalised
+	@param n size of FF in BIGs
+ */
+extern void FF_norm(B384_56::BIG *x, int n);
+/**	@brief Shift left an FF by 1 bit
+ *
+	@param x FF instance to be shifted left
+	@param n size of FF in BIGs
+ */
+extern void FF_shl(B384_56::BIG *x, int n);
+/**	@brief Shift right an FF by 1 bit
+ *
+	@param x FF instance to be shifted right
+	@param n size of FF in BIGs
+ */
+extern void FF_shr(B384_56::BIG *x, int n);
+/**	@brief Formats and outputs an FF to the console
+ *
+	@param x FF instance to be printed
+	@param n size of FF in BIGs
+ */
+extern void FF_output(B384_56::BIG *x, int n);
+/**	@brief Formats and outputs an FF to the console, in raw form
+ *
+ 	@param x FF instance to be printed
+ 	@param n size of FF in BIGs
+ */
+extern void FF_rawoutput(B384_56::BIG *x, int n);
+/**	@brief Formats and outputs an FF instance to an octet string
+ *
+	Converts an FF to big-endian base 256 form.
+	@param S output octet string
+	@param x FF instance to be converted to an octet string
+	@param n size of FF in BIGs
+ */
+extern void FF_toOctet(octet *S, B384_56::BIG *x, int n);
+/**	@brief Populates an FF instance from an octet string
+ *
+	Creates FF from big-endian base 256 form.
+	@param x FF instance to be created from an octet string
+	@param S input octet string
+	@param n size of FF in BIGs
+ */
+extern void FF_fromOctet(B384_56::BIG *x, octet *S, int n);
+/**	@brief Multiplication of two FFs
+ *
+	Uses Karatsuba method internally
+	@param x FF instance, on exit = y*z
+	@param y FF instance
+	@param z FF instance
+	@param n size of FF in BIGs
+ */
+extern void FF_mul(B384_56::BIG *x, B384_56::BIG *y, B384_56::BIG *z, int n);
+/**	@brief Reduce FF mod a modulus
+ *
+	This is slow
+	@param x FF instance to be reduced mod m - on exit = x mod m
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_mod(B384_56::BIG *x, B384_56::BIG *m, int n);
+/**	@brief Square an FF
+ *
+	Uses Karatsuba method internally
+	@param x FF instance, on exit = y^2
+	@param y FF instance to be squared
+	@param n size of FF in BIGs
+ */
+extern void FF_sqr(B384_56::BIG *x, B384_56::BIG *y, int n);
+/**	@brief Reduces a double-length FF with respect to a given modulus
+ *
+	This is slow
+	@param x FF instance, on exit = y mod z
+	@param y FF instance, of double length 2*n
+	@param z FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_dmod(B384_56::BIG *x, B384_56::BIG *y, B384_56::BIG *z, int n);
+/**	@brief Invert an FF mod a prime modulus
+ *
+	@param x FF instance, on exit = 1/y mod z
+	@param y FF instance
+	@param z FF prime modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_invmodp(B384_56::BIG *x, B384_56::BIG *y, B384_56::BIG *z, int n);
+/**	@brief Create an FF from a random number generator
+ *
+	@param x FF instance, on exit x is a random number of length n BIGs with most significant bit a 1
+	@param R an instance of a Cryptographically Secure Random Number Generator
+	@param n size of FF in BIGs
+ */
+extern void FF_random(B384_56::BIG *x, csprng *R, int n);
+/**	@brief Create a random FF less than a given modulus from a random number generator
+ *
+	@param x FF instance, on exit x is a random number < y
+	@param y FF instance, the modulus
+	@param R an instance of a Cryptographically Secure Random Number Generator
+	@param n size of FF in BIGs
+ */
+extern void FF_randomnum(B384_56::BIG *x, B384_56::BIG *y, csprng *R, int n);
+/**	@brief Calculate r=x^e mod m, side channel resistant
+ *
+	@param r FF instance, on exit = x^e mod p
+	@param x FF instance
+	@param e FF exponent
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_skpow(B384_56::BIG *r, B384_56::BIG *x, B384_56::BIG * e, B384_56::BIG *m, int n);
+/**	@brief Calculate r=x^e mod m, side channel resistant
+ *
+	For short BIG exponent
+	@param r FF instance, on exit = x^e mod p
+	@param x FF instance
+	@param e BIG exponent
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_skspow(B384_56::BIG *r, B384_56::BIG *x, B384_56::BIG e, B384_56::BIG *m, int n);
+/**	@brief Calculate r=x^e mod m
+ *
+	For very short integer exponent
+	@param r FF instance, on exit = x^e mod p
+	@param x FF instance
+	@param e integer exponent
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_power(B384_56::BIG *r, B384_56::BIG *x, int e, B384_56::BIG *m, int n);
+/**	@brief Calculate r=x^e mod m
+ *
+	@param r FF instance, on exit = x^e mod p
+	@param x FF instance
+	@param e FF exponent
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_pow(B384_56::BIG *r, B384_56::BIG *x, B384_56::BIG *e, B384_56::BIG *m, int n);
+/**	@brief Test if an FF has factor in common with integer s
+ *
+	@param x FF instance to be tested
+	@param s the supplied integer
+	@param n size of FF in BIGs
+	@return 1 if gcd(x,s)!=1, else return 0
+ */
+extern int FF_cfactor(B384_56::BIG *x, sign32 s, int n);
+/**	@brief Test if an FF is prime
+ *
+	Uses Miller-Rabin Method
+	@param x FF instance to be tested
+	@param R an instance of a Cryptographically Secure Random Number Generator
+	@param n size of FF in BIGs
+	@return 1 if x is (almost certainly) prime, else return 0
+ */
+extern int FF_prime(B384_56::BIG *x, csprng *R, int n);
+/**	@brief Calculate r=x^e.y^f mod m
+ *
+	@param r FF instance, on exit = x^e.y^f mod p
+	@param x FF instance
+	@param e BIG exponent
+	@param y FF instance
+	@param f BIG exponent
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_pow2(B384_56::BIG *r, B384_56::BIG *x, B384_56::BIG e, B384_56::BIG *y, B384_56::BIG f, B384_56::BIG *m, int n);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ff_RSA4096.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ff_RSA4096.h
new file mode 100644
index 0000000..91b37ae
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/ff_RSA4096.h
@@ -0,0 +1,295 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FF_RSA4096_H
+#define FF_RSA4096_H
+
+#include "big_B512_60.h"
+#include "config_ff_RSA4096.h"
+
+using namespace core;
+
+#define HFLEN_RSA4096 (FFLEN_RSA4096/2) /**< Useful for half-size RSA private key operations */
+#define P_MBITS_RSA4096 (MODBYTES_B512_60*8)
+#define P_TBITS_RSA4096 (P_MBITS_RSA4096%BASEBITS_B512_60)
+#define P_EXCESS_RSA4096(a) (((a[NLEN_B512_60-1])>>(P_TBITS_RSA4096))+1)
+#define P_FEXCESS_RSA4096 ((chunk)1<<(BASEBITS_B512_60*NLEN_B512_60-P_MBITS_RSA4096-1))
+
+
+namespace RSA4096 {
+
+/* Finite Field Prototypes */
+/**	@brief Copy one FF element of given length to another
+ *
+	@param x FF instance to be copied to, on exit = y
+	@param y FF instance to be copied from
+	@param n size of FF in BIGs
+
+ */
+extern void FF_copy(B512_60::BIG *x, B512_60::BIG *y, int n);
+/**	@brief Initialize an FF element of given length from a 32-bit integer m
+ *
+	@param x FF instance to be copied to, on exit = m
+	@param m integer
+	@param n size of FF in BIGs
+ */
+extern void FF_init(B512_60::BIG *x, sign32 m, int n);
+/**	@brief Set FF element of given size to zero
+ *
+	@param x FF instance to be set to zero
+	@param n size of FF in BIGs
+ */
+extern void FF_zero(B512_60::BIG *x, int n);
+/**	@brief Tests for FF element equal to zero
+ *
+	@param x FF number to be tested
+	@param n size of FF in BIGs
+	@return 1 if zero, else returns 0
+ */
+extern int FF_iszilch(B512_60::BIG *x, int n);
+/**	@brief  return parity of an FF, that is the least significant bit
+ *
+	@param x FF number
+	@return 0 or 1
+ */
+extern int FF_parity(B512_60::BIG *x);
+/**	@brief  return least significant m bits of an FF
+ *
+	@param x FF number
+	@param m number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int FF_lastbits(B512_60::BIG *x, int m);
+/**	@brief Set FF element of given size to unity
+ *
+	@param x FF instance to be set to unity
+	@param n size of FF in BIGs
+ */
+extern void FF_one(B512_60::BIG *x, int n);
+/**	@brief Compares two FF numbers. Inputs must be normalised externally
+ *
+	@param x first FF number to be compared
+	@param y second FF number to be compared
+	@param n size of FF in BIGs
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int FF_comp(B512_60::BIG *x, B512_60::BIG *y, int n);
+/**	@brief addition of two FFs
+ *
+	@param x FF instance, on exit = y+z
+	@param y FF instance
+	@param z FF instance
+	@param n size of FF in BIGs
+ */
+extern void FF_add(B512_60::BIG *x, B512_60::BIG *y, B512_60::BIG *z, int n);
+/**	@brief subtraction of two FFs
+ *
+	@param x FF instance, on exit = y-z
+	@param y FF instance
+	@param z FF instance
+	@param n size of FF in BIGs
+ */
+extern void FF_sub(B512_60::BIG *x, B512_60::BIG *y, B512_60::BIG *z, int n);
+/**	@brief increment an FF by an integer,and normalise
+ *
+	@param x FF instance, on exit = x+m
+	@param m an integer to be added to x
+	@param n size of FF in BIGs
+ */
+extern void FF_inc(B512_60::BIG *x, int m, int n);
+/**	@brief Decrement an FF by an integer,and normalise
+ *
+	@param x FF instance, on exit = x-m
+	@param m an integer to be subtracted from x
+	@param n size of FF in BIGs
+ */
+extern void FF_dec(B512_60::BIG *x, int m, int n);
+/**	@brief Normalises the components of an FF
+ *
+	@param x FF instance to be normalised
+	@param n size of FF in BIGs
+ */
+extern void FF_norm(B512_60::BIG *x, int n);
+/**	@brief Shift left an FF by 1 bit
+ *
+	@param x FF instance to be shifted left
+	@param n size of FF in BIGs
+ */
+extern void FF_shl(B512_60::BIG *x, int n);
+/**	@brief Shift right an FF by 1 bit
+ *
+	@param x FF instance to be shifted right
+	@param n size of FF in BIGs
+ */
+extern void FF_shr(B512_60::BIG *x, int n);
+/**	@brief Formats and outputs an FF to the console
+ *
+	@param x FF instance to be printed
+	@param n size of FF in BIGs
+ */
+extern void FF_output(B512_60::BIG *x, int n);
+/**	@brief Formats and outputs an FF to the console, in raw form
+ *
+ 	@param x FF instance to be printed
+ 	@param n size of FF in BIGs
+ */
+extern void FF_rawoutput(B512_60::BIG *x, int n);
+/**	@brief Formats and outputs an FF instance to an octet string
+ *
+	Converts an FF to big-endian base 256 form.
+	@param S output octet string
+	@param x FF instance to be converted to an octet string
+	@param n size of FF in BIGs
+ */
+extern void FF_toOctet(octet *S, B512_60::BIG *x, int n);
+/**	@brief Populates an FF instance from an octet string
+ *
+	Creates FF from big-endian base 256 form.
+	@param x FF instance to be created from an octet string
+	@param S input octet string
+	@param n size of FF in BIGs
+ */
+extern void FF_fromOctet(B512_60::BIG *x, octet *S, int n);
+/**	@brief Multiplication of two FFs
+ *
+	Uses Karatsuba method internally
+	@param x FF instance, on exit = y*z
+	@param y FF instance
+	@param z FF instance
+	@param n size of FF in BIGs
+ */
+extern void FF_mul(B512_60::BIG *x, B512_60::BIG *y, B512_60::BIG *z, int n);
+/**	@brief Reduce FF mod a modulus
+ *
+	This is slow
+	@param x FF instance to be reduced mod m - on exit = x mod m
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_mod(B512_60::BIG *x, B512_60::BIG *m, int n);
+/**	@brief Square an FF
+ *
+	Uses Karatsuba method internally
+	@param x FF instance, on exit = y^2
+	@param y FF instance to be squared
+	@param n size of FF in BIGs
+ */
+extern void FF_sqr(B512_60::BIG *x, B512_60::BIG *y, int n);
+/**	@brief Reduces a double-length FF with respect to a given modulus
+ *
+	This is slow
+	@param x FF instance, on exit = y mod z
+	@param y FF instance, of double length 2*n
+	@param z FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_dmod(B512_60::BIG *x, B512_60::BIG *y, B512_60::BIG *z, int n);
+/**	@brief Invert an FF mod a prime modulus
+ *
+	@param x FF instance, on exit = 1/y mod z
+	@param y FF instance
+	@param z FF prime modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_invmodp(B512_60::BIG *x, B512_60::BIG *y, B512_60::BIG *z, int n);
+/**	@brief Create an FF from a random number generator
+ *
+	@param x FF instance, on exit x is a random number of length n BIGs with most significant bit a 1
+	@param R an instance of a Cryptographically Secure Random Number Generator
+	@param n size of FF in BIGs
+ */
+extern void FF_random(B512_60::BIG *x, csprng *R, int n);
+/**	@brief Create a random FF less than a given modulus from a random number generator
+ *
+	@param x FF instance, on exit x is a random number < y
+	@param y FF instance, the modulus
+	@param R an instance of a Cryptographically Secure Random Number Generator
+	@param n size of FF in BIGs
+ */
+extern void FF_randomnum(B512_60::BIG *x, B512_60::BIG *y, csprng *R, int n);
+/**	@brief Calculate r=x^e mod m, side channel resistant
+ *
+	@param r FF instance, on exit = x^e mod p
+	@param x FF instance
+	@param e FF exponent
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_skpow(B512_60::BIG *r, B512_60::BIG *x, B512_60::BIG * e, B512_60::BIG *m, int n);
+/**	@brief Calculate r=x^e mod m, side channel resistant
+ *
+	For short BIG exponent
+	@param r FF instance, on exit = x^e mod p
+	@param x FF instance
+	@param e BIG exponent
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_skspow(B512_60::BIG *r, B512_60::BIG *x, B512_60::BIG e, B512_60::BIG *m, int n);
+/**	@brief Calculate r=x^e mod m
+ *
+	For very short integer exponent
+	@param r FF instance, on exit = x^e mod p
+	@param x FF instance
+	@param e integer exponent
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_power(B512_60::BIG *r, B512_60::BIG *x, int e, B512_60::BIG *m, int n);
+/**	@brief Calculate r=x^e mod m
+ *
+	@param r FF instance, on exit = x^e mod p
+	@param x FF instance
+	@param e FF exponent
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_pow(B512_60::BIG *r, B512_60::BIG *x, B512_60::BIG *e, B512_60::BIG *m, int n);
+/**	@brief Test if an FF has factor in common with integer s
+ *
+	@param x FF instance to be tested
+	@param s the supplied integer
+	@param n size of FF in BIGs
+	@return 1 if gcd(x,s)!=1, else return 0
+ */
+extern int FF_cfactor(B512_60::BIG *x, sign32 s, int n);
+/**	@brief Test if an FF is prime
+ *
+	Uses Miller-Rabin Method
+	@param x FF instance to be tested
+	@param R an instance of a Cryptographically Secure Random Number Generator
+	@param n size of FF in BIGs
+	@return 1 if x is (almost certainly) prime, else return 0
+ */
+extern int FF_prime(B512_60::BIG *x, csprng *R, int n);
+/**	@brief Calculate r=x^e.y^f mod m
+ *
+	@param r FF instance, on exit = x^e.y^f mod p
+	@param x FF instance
+	@param e BIG exponent
+	@param y FF instance
+	@param f BIG exponent
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_pow2(B512_60::BIG *r, B512_60::BIG *x, B512_60::BIG e, B512_60::BIG *y, B512_60::BIG f, B512_60::BIG *m, int n);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp.cpp
new file mode 100644
index 0000000..a646c57
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp.cpp
@@ -0,0 +1,940 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* CORE mod p functions */
+/* Small Finite Field arithmetic */
+/* SU=m, SU is Stack Usage (NOT_SPECIAL Modulus) */
+
+#include "fp_YYY.h"
+
+using namespace XXX;
+
+/* Fast Modular Reduction Methods */
+
+/* r=d mod m */
+/* d MUST be normalised */
+/* Products must be less than pR in all cases !!! */
+/* So when multiplying two numbers, their product *must* be less than MODBITS_YYY+BASEBITS_XXX*NLEN_XXX */
+/* Results *may* be one bit bigger than MODBITS_YYY */
+
+#if MODTYPE_YYY == PSEUDO_MERSENNE
+/* r=d mod m */
+
+/* Converts from BIG integer to residue form mod Modulus */
+void YYY::FP_nres(FP *y, BIG x)
+{
+    BIG mdls;
+    BIG_rcopy(mdls, Modulus);
+    BIG_copy(y->g, x);
+    BIG_mod(y->g,mdls);
+    y->XES = 1;
+}
+
+/* Converts from residue form back to BIG integer form */
+void YYY::FP_redc(BIG x, FP *y)
+{
+    BIG_copy(x, y->g);
+}
+
+/* reduce a DBIG to a BIG exploiting the special form of the modulus */
+void YYY::FP_mod(BIG r, DBIG d)
+{
+    BIG t, b;
+    chunk v, tw;
+    BIG_split(t, b, d, MODBITS_YYY);
+
+    /* Note that all of the excess gets pushed into t. So if squaring a value with a 4-bit excess, this results in
+       t getting all 8 bits of the excess product! So products must be less than pR which is Montgomery compatible */
+
+    if (MConst < NEXCESS_XXX)
+    {
+        BIG_imul(t, t, MConst);
+        BIG_norm(t);
+        BIG_add(r, t, b);
+        BIG_norm(r);
+        tw = r[NLEN_XXX - 1];
+        r[NLEN_XXX - 1] &= TMASK_YYY;
+        r[0] += MConst * ((tw >> TBITS_YYY));
+    }
+    else
+    {
+        v = BIG_pmul(t, t, MConst);
+        BIG_add(r, t, b);
+        BIG_norm(r);
+        tw = r[NLEN_XXX - 1];
+        r[NLEN_XXX - 1] &= TMASK_YYY;
+#if CHUNK == 16
+        r[1] += muladd(MConst, ((tw >> TBITS_YYY) + (v << (BASEBITS_XXX - TBITS_YYY))), 0, &r[0]);
+#else
+        r[0] += MConst * ((tw >> TBITS_YYY) + (v << (BASEBITS_XXX - TBITS_YYY)));
+#endif
+    }
+    BIG_norm(r);
+}
+#endif
+
+/* This only applies to Curve C448, so specialised (for now) */
+#if MODTYPE_YYY == GENERALISED_MERSENNE
+
+void YYY::FP_nres(FP *y, BIG x)
+{
+    BIG mdls;
+    BIG_rcopy(mdls, Modulus);
+    BIG_copy(y->g, x);
+    BIG_mod(y->g,mdls);
+    y->XES = 1;
+}
+
+/* Converts from residue form back to BIG integer form */
+void YYY::FP_redc(BIG x, FP *y)
+{
+    BIG_copy(x, y->g);
+}
+
+/* reduce a DBIG to a BIG exploiting the special form of a modulus 2^m - 2^n -c */
+void YYY::FP_mod(BIG r, DBIG d)
+{
+
+    BIG t, b;
+    chunk carry;
+    BIG_split(t, b, d, MBITS_YYY);
+
+    BIG_add(r, t, b);
+
+    BIG_dscopy(d, t);
+    BIG_dshl(d, MBITS_YYY / 2);
+
+    BIG_split(t, b, d, MBITS_YYY);
+
+    BIG_add(r, r, t);
+    BIG_add(r, r, b);
+    BIG_norm(r);
+    BIG_shl(t, MBITS_YYY / 2);
+
+    BIG_add(r, r, t);
+
+    carry = r[NLEN_XXX - 1] >> TBITS_YYY;
+
+    r[NLEN_XXX - 1] &= TMASK_YYY;
+    r[0] += carry;
+
+    r[224 / BASEBITS_XXX] += carry << (224 % BASEBITS_XXX); /* need to check that this falls mid-word */
+    BIG_norm(r);
+
+/*
+
+    BIG t, b, t2, b2;
+    int BTset = MBITS_YYY / 2;
+    chunk carry;
+    BIG_split(t, b, d, MBITS_YYY);
+
+    BIG_dscopy(d, t);
+    BIG_dshl(d, BTset);
+
+    BIG_split(t2, b2, d, MBITS_YYY);
+
+    BIG_add(b, b, b2); // 2
+    BIG_add(t, t, t2); // 2
+
+    BIG_shl(t2, BTset);
+
+    BIG_add(b, b, t2); // 3
+    BIG_norm(t);
+
+//  carry=0;
+// Now multiply t by MConst..(?) and extract carry
+//  if (MConst!=1)
+//      carry=BIG_pmul(t,t,MConst);
+
+    BIG_add(r, t, b);
+    BIG_norm(r);
+
+    carry = r[NLEN_XXX - 1] >> TBITS_YYY; // + (carry<<(BASEBITS_XXX-TBITS_YYY));
+    r[NLEN_XXX - 1] &= TMASK_YYY;
+
+    r[BTset / BASEBITS_XXX] += carry << (BTset % BASEBITS_XXX); // need to check that this falls mid-word 
+//  if (MConst!=1) carry*=MConst;
+    r[0] += carry;
+
+    BIG_norm(r);
+*/
+}
+
+#endif
+
+#if MODTYPE_YYY == MONTGOMERY_FRIENDLY
+
+/* convert to Montgomery n-residue form */
+void YYY::FP_nres(FP *y, BIG x)
+{
+    DBIG d;
+    BIG r;
+    BIG_rcopy(r, R2modp);
+    BIG_mul(d, x, r);
+    FP_mod(y->g, d);
+    y->XES = 2;
+}
+
+/* convert back to regular form */
+void YYY::FP_redc(BIG x, FP *y)
+{
+    DBIG d;
+    BIG_dzero(d);
+    BIG_dscopy(d, y->g);
+    FP_mod(x, d);
+}
+
+/* fast modular reduction from DBIG to BIG exploiting special form of the modulus */
+void YYY::FP_mod(BIG a, DBIG d)
+{
+    int i;
+
+    for (i = 0; i < NLEN_XXX; i++)
+        d[NLEN_XXX + i] += muladd(d[i], MConst - 1, d[i], &d[NLEN_XXX + i - 1]);
+
+    BIG_sducopy(a, d);
+    BIG_norm(a);
+}
+
+#endif
+
+#if MODTYPE_YYY == NOT_SPECIAL
+
+/* convert to Montgomery n-residue form */
+void YYY::FP_nres(FP *y, BIG x)
+{
+    DBIG d;
+    BIG r;
+    BIG_rcopy(r, R2modp);
+    BIG_mul(d, x, r);
+    FP_mod(y->g, d);
+    y->XES = 2;
+}
+
+/* convert back to regular form */
+void YYY::FP_redc(BIG x, FP *y)
+{
+    DBIG d;
+    BIG_dzero(d);
+    BIG_dscopy(d, y->g);
+    FP_mod(x, d);
+}
+
+
+/* reduce a DBIG to a BIG using Montgomery's no trial division method */
+/* d is expected to be dnormed before entry */
+/* SU= 112 */
+void YYY::FP_mod(BIG a, DBIG d)
+{
+    BIG mdls;
+    BIG_rcopy(mdls, Modulus);
+    BIG_monty(a, mdls, MConst, d);
+}
+
+#endif
+
+void YYY::FP_from_int(FP *x,int a)
+{
+    BIG w;
+    if (a<0) BIG_rcopy(w, Modulus);
+    else BIG_zero(w); 
+    BIG_inc(w,a); BIG_norm(w); 
+    FP_nres(x,w);
+}
+
+/* test x==0 ? */
+/* SU= 48 */
+int YYY::FP_iszilch(FP *x)
+{
+    BIG m;
+    FP y;
+    FP_copy(&y,x);
+    FP_reduce(&y);
+    FP_redc(m,&y);
+    return BIG_iszilch(m);
+}
+
+/* input must be reduced */
+int YYY::FP_isunity(FP *x)
+{
+    BIG m;
+    FP y;
+    FP_copy(&y,x);
+    FP_reduce(&y);
+    FP_redc(m,&y);
+    return BIG_isunity(m);
+}
+
+void YYY::FP_copy(FP *y, FP *x)
+{
+    BIG_copy(y->g, x->g);
+    y->XES = x->XES;
+}
+
+void YYY::FP_rcopy(FP *y, const BIG c)
+{
+    BIG b;
+    BIG_rcopy(b, c);
+    FP_nres(y, b);
+}
+
+/* Swap a and b if d=1 */
+void YYY::FP_cswap(FP *a, FP *b, int d)
+{
+    sign32 t, c = d;
+    BIG_cswap(a->g, b->g, d);
+
+    c = ~(c - 1);
+    t = c & ((a->XES) ^ (b->XES));
+    a->XES ^= t;
+    b->XES ^= t;
+
+}
+
+/* Move b to a if d=1 */
+void YYY::FP_cmove(FP *a, FP *b, int d)
+{
+    sign32 c = -d;
+
+    BIG_cmove(a->g, b->g, d);
+    a->XES ^= (a->XES ^ b->XES)&c;
+}
+
+void YYY::FP_zero(FP *x)
+{
+    BIG_zero(x->g);
+    x->XES = 1;
+}
+
+int YYY::FP_equals(FP *x, FP *y)
+{
+    FP xg, yg;
+    FP_copy(&xg, x);
+    FP_copy(&yg, y);
+    FP_reduce(&xg); FP_reduce(&yg);
+
+    if (BIG_comp(xg.g, yg.g) == 0) return 1;
+    return 0;
+}
+
+// Is x lexically larger than p-x?
+// return -1 for no, 0 if x=0, 1 for yes
+int YYY::FP_islarger(FP *x)
+{
+    BIG p,fx,sx;
+    if (FP_iszilch(x)) return 0;
+    BIG_rcopy(p,Modulus);
+    FP_redc(fx,x);
+    BIG_sub(sx,p,fx);  BIG_norm(sx); 
+    return BIG_comp(fx,sx);
+}
+
+void YYY::FP_toBytes(char *b,FP *x)
+{
+    BIG t;
+    FP_redc(t, x);
+    BIG_toBytes(b, t);
+}
+
+void YYY::FP_fromBytes(FP *x,char *b)
+{
+    BIG t;
+    BIG_fromBytes(t, b);
+    FP_nres(x, t);
+}
+
+/* output FP */
+/* SU= 48 */
+void YYY::FP_output(FP *r)
+{
+    BIG c;
+    FP_reduce(r);
+    FP_redc(c, r);
+    BIG_output(c);
+}
+
+void YYY::FP_rawoutput(FP *r)
+{
+    BIG_rawoutput(r->g);
+}
+
+#ifdef GET_STATS
+int tsqr = 0, rsqr = 0, tmul = 0, rmul = 0;
+int tadd = 0, radd = 0, tneg = 0, rneg = 0;
+int tdadd = 0, rdadd = 0, tdneg = 0, rdneg = 0;
+#endif
+
+#ifdef FUSED_MODMUL
+
+/* Insert fastest code here */
+
+#endif
+
+/* r=a*b mod Modulus */
+/* product must be less that p.R - and we need to know this in advance! */
+/* SU= 88 */
+void YYY::FP_mul(FP *r, FP *a, FP *b)
+{
+    DBIG d;
+
+    if ((sign64)a->XES * b->XES > (sign64)FEXCESS_YYY)
+    {
+#ifdef DEBUG_REDUCE
+        printf("Product too large - reducing it\n");
+#endif
+        FP_reduce(a);  /* it is sufficient to fully reduce just one of them < p */
+    }
+
+#ifdef FUSED_MODMUL
+    FP_modmul(r->g, a->g, b->g);
+#else
+    BIG_mul(d, a->g, b->g);
+    FP_mod(r->g, d);
+#endif
+    r->XES = 2;
+}
+
+
+/* multiplication by an integer, r=a*c */
+/* SU= 136 */
+void YYY::FP_imul(FP *r, FP *a, int c)
+{
+    DBIG d;
+    BIG k;
+    FP f;
+
+    int s = 0;
+
+    if (c < 0)
+    {
+        c = -c;
+        s = 1;
+    }
+
+#if MODTYPE_YYY==PSEUDO_MERSENNE || MODTYPE_YYY==GENERALISED_MERSENNE
+
+    BIG_pxmul(d, a->g, c);
+    FP_mod(r->g, d);
+    r->XES = 2;
+
+#else
+    //Montgomery
+    if (a->XES * c <= FEXCESS_YYY)
+    {
+        BIG_pmul(r->g, a->g, c);
+        r->XES = a->XES * c; // careful here - XES jumps!
+    }
+    else
+    {   // don't want to do this - only a problem for Montgomery modulus and larger constants
+        BIG_zero(k);
+        BIG_inc(k, c);
+        BIG_norm(k);
+        FP_nres(&f, k);
+        FP_mul(r, a, &f);
+    }
+#endif
+
+    if (s)
+    {
+        FP_neg(r, r);
+        FP_norm(r);
+    }
+}
+
+/* Set r=a^2 mod m */
+/* SU= 88 */
+void YYY::FP_sqr(FP *r, FP *a)
+{
+    DBIG d;
+
+    if ((sign64)a->XES * a->XES > (sign64)FEXCESS_YYY)
+    {
+#ifdef DEBUG_REDUCE
+        printf("Product too large - reducing it\n");
+#endif
+        FP_reduce(a);
+    }
+
+    BIG_sqr(d, a->g);
+    FP_mod(r->g, d);
+    r->XES = 2;
+}
+
+/* SU= 16 */
+/* Set r=a+b */
+void YYY::FP_add(FP *r, FP *a, FP *b)
+{
+    BIG_add(r->g, a->g, b->g);
+    r->XES = a->XES + b->XES;
+    if (r->XES > FEXCESS_YYY)
+    {
+#ifdef DEBUG_REDUCE
+        printf("Sum too large - reducing it \n");
+#endif
+        FP_reduce(r);
+    }
+}
+
+/* Set r=a-b mod m */
+/* SU= 56 */
+void YYY::FP_sub(FP *r, FP *a, FP *b)
+{
+    FP n;
+    FP_neg(&n, b);
+    FP_add(r, a, &n);
+}
+
+// https://graphics.stanford.edu/~seander/bithacks.html
+// constant time log to base 2 (or number of bits in)
+
+static int logb2(unsign32 v)
+{
+    int r;
+    v |= v >> 1;
+    v |= v >> 2;
+    v |= v >> 4;
+    v |= v >> 8;
+    v |= v >> 16;
+
+    v = v - ((v >> 1) & 0x55555555);
+    v = (v & 0x33333333) + ((v >> 2) & 0x33333333);
+    r = (((v + (v >> 4)) & 0xF0F0F0F) * 0x1010101) >> 24;
+    return r;
+}
+
+// find appoximation to quotient of a/m
+// Out by at most 2.
+// Note that MAXXES is bounded to be 2-bits less than half a word
+static int quo(BIG n, BIG m)
+{
+    int sh;
+    chunk num, den;
+    int hb = CHUNK / 2;
+    if (TBITS_YYY < hb)
+    {
+        sh = hb - TBITS_YYY;
+        num = (n[NLEN_XXX - 1] << sh) | (n[NLEN_XXX - 2] >> (BASEBITS_XXX - sh));
+        den = (m[NLEN_XXX - 1] << sh) | (m[NLEN_XXX - 2] >> (BASEBITS_XXX - sh));
+    }
+    else
+    {
+        num = n[NLEN_XXX - 1];
+        den = m[NLEN_XXX - 1];
+    }
+    return (int)(num / (den + 1));
+}
+
+/* SU= 48 */
+/* Fully reduce a mod Modulus */
+void YYY::FP_reduce(FP *a)
+{
+    BIG m, r;
+    int sr, sb, q;
+    chunk carry;
+
+    BIG_rcopy(m, Modulus);
+    BIG_norm(a->g);
+
+    if (a->XES > 16)
+    {
+        q = quo(a->g, m);
+        carry = BIG_pmul(r, m, q);
+        r[NLEN_XXX - 1] += (carry << BASEBITS_XXX); // correction - put any carry out back in again
+        BIG_sub(a->g, a->g, r);
+        BIG_norm(a->g);
+        sb = 2;
+    }
+    else sb = logb2(a->XES - 1); // sb does not depend on the actual data
+
+    BIG_fshl(m, sb);
+    while (sb > 0)
+    {
+// constant time...
+        sr = BIG_ssn(r, a->g, m); // optimized combined shift, subtract and norm
+        BIG_cmove(a->g, r, 1 - sr);
+        sb--;
+    }
+
+    a->XES = 1;
+}
+
+void YYY::FP_norm(FP *x)
+{
+    BIG_norm(x->g);
+}
+
+/* Set r=-a mod Modulus */
+/* SU= 64 */
+void YYY::FP_neg(FP *r, FP *a)
+{
+    int sb;
+    BIG m;
+
+    BIG_rcopy(m, Modulus);
+
+    sb = logb2(a->XES - 1);
+    BIG_fshl(m, sb);
+    BIG_sub(r->g, m, a->g);
+    r->XES = ((sign32)1 << sb) + 1; // +1 to cover case where a is zero ?
+
+    if (r->XES > FEXCESS_YYY)
+    {
+#ifdef DEBUG_REDUCE
+        printf("Negation too large -  reducing it \n");
+#endif
+        FP_reduce(r);
+    }
+
+}
+
+/* Set r=a/2. */
+/* SU= 56 */
+void YYY::FP_div2(FP *r, FP *a)
+{
+    BIG m;
+    BIG w;
+    BIG_rcopy(m, Modulus);
+    int pr=BIG_parity(a->g);
+
+    FP_copy(r, a);
+    BIG_copy(w,r->g);
+    BIG_fshr(r->g,1);
+    BIG_add(w, w, m);
+    BIG_norm(w);
+    BIG_fshr(w, 1);   
+    
+    BIG_cmove(r->g,w,pr);
+}
+
+// Could leak size of b
+// but not used here with secret exponent b
+void YYY::FP_pow(FP *r, FP *a, BIG b)
+{
+    sign8 w[1 + (NLEN_XXX * BASEBITS_XXX + 3) / 4];
+    FP tb[16];
+    BIG t;
+    int i, nb;
+
+    FP_copy(r,a);
+    FP_norm(r);
+    BIG_copy(t, b);
+    BIG_norm(t);
+    nb = 1 + (BIG_nbits(t) + 3) / 4;
+    // convert exponent to 4-bit window
+    for (i = 0; i < nb; i++)
+    {
+        w[i] = BIG_lastbits(t, 4);
+        BIG_dec(t, w[i]);
+        BIG_norm(t);
+        BIG_fshr(t, 4);
+    }
+
+    FP_one(&tb[0]);
+    FP_copy(&tb[1], r);
+    for (i = 2; i < 16; i++)
+        FP_mul(&tb[i], &tb[i - 1], r);
+
+    FP_copy(r, &tb[w[nb - 1]]);
+    for (i = nb - 2; i >= 0; i--)
+    {
+        FP_sqr(r, r);
+        FP_sqr(r, r);
+        FP_sqr(r, r);
+        FP_sqr(r, r);
+        FP_mul(r, r, &tb[w[i]]);
+    }
+    FP_reduce(r);
+}
+
+#if MODTYPE_YYY==PSEUDO_MERSENNE  || MODTYPE_YYY==GENERALISED_MERSENNE
+
+// See eprint paper https://eprint.iacr.org/2018/1038
+// e.g. If p=3 mod 4 r= x^{(p-3)/4}, if p=5 mod 8 r=x^{(p-5)/8}
+
+void YYY::FP_fpow(FP *r, FP *x)
+{
+    int i, j, k, bw, w, nw, lo, m, n, c, nd, e=PM1D2_YYY;
+    FP xp[11], t, key;
+    const int ac[] = {1, 2, 3, 6, 12, 15, 30, 60, 120, 240, 255};
+// phase 1
+    FP_copy(&xp[0], x); // 1
+    FP_sqr(&xp[1], x); // 2
+    FP_mul(&xp[2], &xp[1], x); //3
+    FP_sqr(&xp[3], &xp[2]); // 6
+    FP_sqr(&xp[4], &xp[3]); // 12
+    FP_mul(&xp[5], &xp[4], &xp[2]); // 15
+    FP_sqr(&xp[6], &xp[5]); // 30
+    FP_sqr(&xp[7], &xp[6]); // 60
+    FP_sqr(&xp[8], &xp[7]); // 120
+    FP_sqr(&xp[9], &xp[8]); // 240
+    FP_mul(&xp[10], &xp[9], &xp[5]); // 255
+
+#if MODTYPE_YYY==PSEUDO_MERSENNE
+    n = MODBITS_YYY;
+#endif
+#if MODTYPE_YYY==GENERALISED_MERSENNE  // Ed448 ONLY
+    n = MODBITS_YYY / 2;
+#endif
+
+    n-=(e+1);
+    c=(MConst+(1<<e)+1)/(1<<(e+1));
+
+// need c to be odd
+    nd=0;
+    while (c%2==0)
+    {
+        c/=2;
+        n-=1;
+        nd++;
+    }
+
+    bw = 0; w = 1; while (w < c) {w *= 2; bw += 1;}
+    k = w - c;
+
+    if (k != 0)
+    {
+        i = 10; while (ac[i] > k) i--;
+        FP_copy(&key, &xp[i]);
+        k -= ac[i];
+    }
+    while (k != 0)
+    {
+        i--;
+        if (ac[i] > k) continue;
+        FP_mul(&key, &key, &xp[i]);
+        k -= ac[i];
+    }
+
+// phase 2
+    FP_copy(&xp[1], &xp[2]);
+    FP_copy(&xp[2], &xp[5]);
+    FP_copy(&xp[3], &xp[10]);
+
+    j = 3; m = 8;
+    nw = n - bw;
+    while (2 * m < nw)
+    {
+        FP_copy(&t, &xp[j++]);
+        for (i = 0; i < m; i++)
+            FP_sqr(&t, &t);
+        FP_mul(&xp[j], &xp[j - 1], &t);
+        m *= 2;
+    }
+
+    lo = nw - m;
+    FP_copy(r, &xp[j]);
+
+    while (lo != 0)
+    {
+        m /= 2; j--;
+        if (lo < m) continue;
+        lo -= m;
+        FP_copy(&t, r);
+        for (i = 0; i < m; i++)
+            FP_sqr(&t, &t);
+        FP_mul(r, &t, &xp[j]);
+    }
+// phase 3
+
+    if (bw != 0)
+    {
+        for (i = 0; i < bw; i++ )
+            FP_sqr(r, r);
+        FP_mul(r, r, &key);
+    }
+
+#if MODTYPE_YYY==GENERALISED_MERSENNE  // Ed448 ONLY
+    FP_copy(&key, r);
+    FP_sqr(&t, &key);
+    FP_mul(r, &t, &xp[0]);
+    for (i = 0; i < n + 1; i++)
+        FP_sqr(r, r);
+    FP_mul(r, r, &key);
+#endif
+
+    for (i=0;i<nd;i++)
+        FP_sqr(r,r);
+
+}
+
+#endif
+
+// calculates r=x^(p-1-2^e)/2^{e+1) where 2^e|p-1
+void YYY::FP_progen(FP *r,FP *x)
+{
+#if MODTYPE_YYY==PSEUDO_MERSENNE  || MODTYPE_YYY==GENERALISED_MERSENNE
+    FP_fpow(r, x);  
+#else
+    int e=PM1D2_YYY;
+    BIG m;
+    BIG_rcopy(m, Modulus);
+    BIG_dec(m,1);
+    BIG_shr(m,e);
+    BIG_dec(m,1);
+    BIG_fshr(m,1);
+    FP_pow(r,x,m);
+#endif
+}
+
+/* Is x a QR? return optional hint for fast follow-up square root */
+int YYY::FP_qr(FP *x,FP *h)
+{
+    FP r;
+    int i,e=PM1D2_YYY;
+    FP_progen(&r,x);
+    if (h!=NULL)
+        FP_copy(h,&r);
+
+    FP_sqr(&r,&r);
+    FP_mul(&r,x,&r);
+    for (i=0;i<e-1;i++ )
+        FP_sqr(&r,&r);
+
+    return FP_isunity(&r);
+}
+
+/* Modular inversion */
+void YYY::FP_inv(FP *r,FP *x,FP *h)
+{
+    int i,e=PM1D2_YYY;
+    FP s,t;
+    FP_norm(x);
+    FP_copy(&s,x);
+
+    if (h==NULL)
+        FP_progen(&t,x);
+    else
+        FP_copy(&t,h);
+
+    for (i=0;i<e-1;i++)
+    {  
+        FP_sqr(&s,&s);
+        FP_mul(&s,&s,x);
+    }
+    for (i=0;i<=e;i++)
+        FP_sqr(&t,&t);
+
+    FP_mul(r,&t,&s);
+    FP_reduce(r);
+}
+
+// Tonelli-Shanks constant time
+void YYY::FP_sqrt(FP *r, FP *a, FP* h)
+{
+    int i,j,k,u,e=PM1D2_YYY;
+    FP v,g,t,b;
+    BIG m;
+
+    if (h==NULL)
+        FP_progen(&g,a);
+    else
+        FP_copy(&g,h);
+
+    BIG_rcopy(m,ROI);
+    FP_nres(&v,m);
+
+    FP_sqr(&t,&g);
+    FP_mul(&t,&t,a);
+   
+    FP_mul(r,&g,a);
+    FP_copy(&b,&t);
+    for (k=e;k>1;k--)
+    {
+        for (j=1;j<k-1;j++)
+            FP_sqr(&b,&b);
+        u=1-FP_isunity(&b);
+        FP_mul(&g,r,&v);
+        FP_cmove(r,&g,u);
+        FP_sqr(&v,&v);
+        FP_mul(&g,&t,&v);
+        FP_cmove(&t,&g,u);
+        FP_copy(&b,&t);
+    }
+// always return +ve square root
+    k=FP_sign(r);
+    FP_neg(&v,r); FP_norm(&v);
+    FP_cmove(r,&v,k);
+}
+
+// Calculate both inverse and square root of x, return QR
+int YYY::FP_invsqrt(FP *i, FP *s, FP *x)
+{
+    FP h;
+    int qr=FP_qr(x,&h);
+    FP_sqrt(s,x,&h);
+    FP_inv(i,x,&h);
+    return qr;
+}
+
+// Two for Price of One - See Hamburg https://eprint.iacr.org/2012/309.pdf
+// Calculate inverse of i and square root of s, return QR
+int YYY::FP_tpo(FP* i, FP* s)
+{
+    int qr;
+    FP w,t;
+    FP_mul(&w,s,i);
+    FP_mul(&t,&w,i);
+    qr=FP_invsqrt(i,s,&t);
+    FP_mul(i,i,&w);
+    FP_mul(s,s,i);
+    return qr;
+}
+
+/* SU=8 */
+/* set n=1 */
+void YYY::FP_one(FP *n)
+{
+    BIG b;
+    BIG_one(b);
+    FP_nres(n, b);
+}
+
+int YYY::FP_sign(FP *x)
+{
+#ifdef BIG_ENDIAN_SIGN_YYY
+    int cp;
+    BIG m,pm1d2;
+    FP y;
+    BIG_rcopy(pm1d2, Modulus);
+    BIG_dec(pm1d2,1);
+    BIG_fshr(pm1d2,1); //(p-1)/2
+     
+    FP_copy(&y,x);
+    FP_reduce(&y);
+    FP_redc(m,&y);
+    cp=BIG_comp(m,pm1d2);
+    return ((cp+1)&2)>>1;
+
+#else
+    BIG m;
+    FP y;
+    FP_copy(&y,x);
+    FP_reduce(&y);
+    FP_redc(m,&y);
+    return BIG_parity(m);
+#endif
+}
+
+void YYY::FP_rand(FP *x,csprng *rng)
+{
+    BIG w,m;
+    BIG_rcopy(m,Modulus);
+    BIG_randomnum(w,m,rng);
+    FP_nres(x,w);
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp.h
new file mode 100644
index 0000000..4392395
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_YYY_H
+#define FP_YYY_H
+
+#include "big_XXX.h"
+#include "config_field_YYY.h"
+
+using namespace core;
+
+#define MODBITS_YYY MBITS_YYY
+#define TBITS_YYY (MBITS_YYY%BASEBITS_XXX)              /**< Number of active bits in top word */
+#define TMASK_YYY (((chunk)1<<TBITS_YYY)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_YYY (((sign32)1<<MAXXES_YYY)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_YYY (-((chunk)(1)<<TBITS_YYY))            /**<  for masking out overflow bits */
+
+namespace YYY {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    XXX::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const XXX::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const XXX::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const XXX::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const XXX::BIG SQRTm3;      /**< Square root of -3 */
+extern const XXX::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const XXX::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const XXX::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const XXX::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const XXX::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, XXX::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(XXX::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(XXX::BIG r, XXX::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(XXX::BIG, XXX::BIG, XXX::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, XXX::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp12.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp12.cpp
new file mode 100644
index 0000000..61ac4f3
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp12.cpp
@@ -0,0 +1,952 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* CORE Fp^12 functions */
+/* SU=m, m is Stack Usage (no lazy )*/
+/* FP12 elements are of the form a+i.b+i^2.c */
+
+#include "fp12_YYY.h"
+#include "config_curve_ZZZ.h"
+
+using namespace XXX;
+
+/* return 1 if b==c, no branching */
+static int teq(sign32 b, sign32 c)
+{
+    sign32 x = b ^ c;
+    x -= 1; // if x=0, x now -1
+    return (int)((x >> 31) & 1);
+}
+
+
+/* Constant time select from pre-computed table */
+static void FP12_select(YYY::FP12 *f, YYY::FP12 g[], sign32 b)
+{
+    YYY::FP12 invf;
+    sign32 m = b >> 31;
+    sign32 babs = (b ^ m) - m;
+
+    babs = (babs - 1) / 2;
+
+    FP12_cmove(f, &g[0], teq(babs, 0)); // conditional move
+    FP12_cmove(f, &g[1], teq(babs, 1));
+    FP12_cmove(f, &g[2], teq(babs, 2));
+    FP12_cmove(f, &g[3], teq(babs, 3));
+    FP12_cmove(f, &g[4], teq(babs, 4));
+    FP12_cmove(f, &g[5], teq(babs, 5));
+    FP12_cmove(f, &g[6], teq(babs, 6));
+    FP12_cmove(f, &g[7], teq(babs, 7));
+
+    FP12_copy(&invf, f);
+    FP12_conj(&invf, &invf); // 1/f
+    FP12_cmove(f, &invf, (int)(m & 1));
+}
+
+/* test x==0 ? */
+/* SU= 8 */
+int YYY::FP12_iszilch(FP12 *x)
+{
+    if (FP4_iszilch(&(x->a)) && FP4_iszilch(&(x->b)) && FP4_iszilch(&(x->c))) return 1;
+    return 0;
+}
+
+/* test x==1 ? */
+/* SU= 8 */
+int YYY::FP12_isunity(FP12 *x)
+{
+    if (FP4_isunity(&(x->a)) && FP4_iszilch(&(x->b)) && FP4_iszilch(&(x->c))) return 1;
+    return 0;
+}
+
+/* FP12 copy w=x */
+/* SU= 16 */
+void YYY::FP12_copy(FP12 *w, FP12 *x)
+{
+    if (x == w) return;
+    FP4_copy(&(w->a), &(x->a));
+    FP4_copy(&(w->b), &(x->b));
+    FP4_copy(&(w->c), &(x->c));
+    w->type = x->type;
+}
+
+/* FP12 w=1 */
+/* SU= 8 */
+void YYY::FP12_one(FP12 *w)
+{
+    FP4_one(&(w->a));
+    FP4_zero(&(w->b));
+    FP4_zero(&(w->c));
+    w->type = FP_UNITY;
+}
+
+void YYY::FP12_zero(FP12 *w)
+{
+    FP4_zero(&(w->a));
+    FP4_zero(&(w->b));
+    FP4_zero(&(w->c));
+    w->type = FP_ZILCH;
+}
+
+/* return 1 if x==y, else 0 */
+/* SU= 16 */
+int YYY::FP12_equals(FP12 *x, FP12 *y)
+{
+    if (FP4_equals(&(x->a), &(y->a)) && FP4_equals(&(x->b), &(y->b)) && FP4_equals(&(x->c), &(y->c)))
+        return 1;
+    return 0;
+}
+
+/* Set w=conj(x) */
+/* SU= 8 */
+void YYY::FP12_conj(FP12 *w, FP12 *x)
+{
+    FP12_copy(w, x);
+    FP4_conj(&(w->a), &(w->a));
+    FP4_nconj(&(w->b), &(w->b));
+    FP4_conj(&(w->c), &(w->c));
+}
+
+/* Create FP12 from FP4 */
+/* SU= 8 */
+void YYY::FP12_from_FP4(FP12 *w, FP4 *a)
+{
+    FP4_copy(&(w->a), a);
+    FP4_zero(&(w->b));
+    FP4_zero(&(w->c));
+    w->type = FP_SPARSEST;
+}
+
+/* Create FP12 from 3 FP4's */
+/* SU= 16 */
+void YYY::FP12_from_FP4s(FP12 *w, FP4 *a, FP4 *b, FP4 *c)
+{
+    FP4_copy(&(w->a), a);
+    FP4_copy(&(w->b), b);
+    FP4_copy(&(w->c), c);
+    w->type = FP_DENSE;
+}
+
+/* Granger-Scott Unitary Squaring. This does not benefit from lazy reduction */
+/* SU= 600 */
+void YYY::FP12_usqr(FP12 *w, FP12 *x)
+{
+    FP4 A, B, C, D;
+
+    FP4_copy(&A, &(x->a));
+
+    FP4_sqr(&(w->a), &(x->a)); // Wa XES=2
+    FP4_add(&D, &(w->a), &(w->a)); // Wa XES=4
+    FP4_add(&(w->a), &D, &(w->a)); // Wa XES=6
+
+    FP4_norm(&(w->a));
+    FP4_nconj(&A, &A);
+
+    FP4_add(&A, &A, &A);
+    FP4_add(&(w->a), &(w->a), &A); // Wa XES=8
+    FP4_sqr(&B, &(x->c));
+    FP4_times_i(&B);
+
+    FP4_add(&D, &B, &B);
+    FP4_add(&B, &B, &D);
+    FP4_norm(&B);
+
+    FP4_sqr(&C, &(x->b));
+
+    FP4_add(&D, &C, &C);
+    FP4_add(&C, &C, &D);
+
+    FP4_norm(&C);
+    FP4_conj(&(w->b), &(x->b));
+    FP4_add(&(w->b), &(w->b), &(w->b));
+    FP4_nconj(&(w->c), &(x->c));
+
+    FP4_add(&(w->c), &(w->c), &(w->c));
+    FP4_add(&(w->b), &B, &(w->b));
+    FP4_add(&(w->c), &C, &(w->c));
+
+    w->type = FP_DENSE;
+    //FP12_norm(w);
+    FP12_reduce(w);     /* reduce here as in pow function repeated squarings would trigger multiple reductions */
+}
+
+/* FP12 squaring w=x^2 */
+/* SU= 600 */
+void YYY::FP12_sqr(FP12 *w, FP12 *x)
+{
+    /* Use Chung-Hasan SQR2 method from http://cacr.uwaterloo.ca/techreports/2006/cacr2006-24.pdf */
+
+    FP4 A, B, C, D;
+
+    if (x->type <= FP_UNITY)
+    {
+        FP12_copy(w, x);
+        return;
+    }
+
+    FP4_sqr(&A, &(x->a));
+    FP4_mul(&B, &(x->b), &(x->c));
+    FP4_add(&B, &B, &B);
+    FP4_norm(&B);
+    FP4_sqr(&C, &(x->c));
+
+    FP4_mul(&D, &(x->a), &(x->b));
+    FP4_add(&D, &D, &D);
+    FP4_add(&(w->c), &(x->a), &(x->c));
+    FP4_add(&(w->c), &(x->b), &(w->c));
+    FP4_norm(&(w->c));
+
+    FP4_sqr(&(w->c), &(w->c));
+
+    FP4_copy(&(w->a), &A);
+    FP4_add(&A, &A, &B);
+
+    FP4_norm(&A);
+
+    FP4_add(&A, &A, &C);
+    FP4_add(&A, &A, &D);
+
+    FP4_norm(&A);
+    FP4_neg(&A, &A);
+    FP4_times_i(&B);
+    FP4_times_i(&C);
+
+    FP4_add(&(w->a), &(w->a), &B);
+    FP4_add(&(w->b), &C, &D);
+    FP4_add(&(w->c), &(w->c), &A);
+
+    if (x->type == FP_SPARSER || x->type == FP_SPARSEST)
+        w->type = FP_SPARSE;
+    else
+        w->type = FP_DENSE;
+    FP12_norm(w);
+}
+
+// Use FP12_mul when both multiplicands are dense
+// Use FP12smul when it is known that both multiplicands are line functions
+// Use FP12ssmul when it is suspected that one or both multiplicands could have some sparsity
+
+
+/* FP12 full multiplication w=w*y */
+void YYY::FP12_mul(FP12 *w, FP12 *y)
+{
+    FP4 z0, z1, z2, z3, t0, t1;
+
+    FP4_mul(&z0, &(w->a), &(y->a)); // xa.ya   always 11x11
+
+    FP4_mul(&z2, &(w->b), &(y->b)); // xb.yb  could be 00x00 or 01x01 or or 10x10 or 11x00 or 11x10 or 11x01 or 11x11
+
+    FP4_add(&t0, &(w->a), &(w->b)); // (xa+xb)
+    FP4_add(&t1, &(y->a), &(y->b)); // (ya+yb)
+
+    FP4_norm(&t0);
+    FP4_norm(&t1);
+
+    FP4_mul(&z1, &t0, &t1); // (xa+xb)(ya+yb)  always 11x11
+    FP4_add(&t0, &(w->b), &(w->c)); // (xb+xc)
+    FP4_add(&t1, &(y->b), &(y->c)); // (yb+yc)
+
+    FP4_norm(&t0);
+    FP4_norm(&t1);
+
+    FP4_mul(&z3, &t0, &t1); // (xb+xc)(yb+yc)   could be anything...
+    FP4_neg(&t0, &z0);      // -(xa.ya)
+    FP4_neg(&t1, &z2);      // -(xb.yb)
+
+    FP4_add(&z1, &z1, &t0);
+    FP4_add(&(w->b), &z1, &t1); // /wb = (xa+xb)(ya+yb) -(xa.ya) -(xb.yb)                     = xa.yb + xb.ya
+
+    FP4_add(&z3, &z3, &t1);      // (xb+xc)(yb+yc) -(xb.yb)
+    FP4_add(&z2, &z2, &t0);      // (xb.yb) - (xa.ya)
+
+    FP4_add(&t0, &(w->a), &(w->c)); // (xa+xc)
+    FP4_add(&t1, &(y->a), &(y->c)); // (ya+yc)
+
+    FP4_norm(&t0);
+    FP4_norm(&t1);
+
+    FP4_mul(&t0, &t1, &t0); // (xa+xc)(ya+yc)    always 11x11
+    FP4_add(&z2, &z2, &t0); // (xb.yb) - (xa.ya) + (xa+xc)(ya+yc)
+
+    FP4_mul(&t0, &(w->c), &(y->c)); // (xc.yc)  could be anything
+    FP4_neg(&t1, &t0);            // -(xc.yc)
+
+    FP4_add(&(w->c), &z2, &t1);     // wc = (xb.yb) - (xa.ya) + (xa+xc)(ya+yc) - (xc.yc)    =  xb.yb + xc.ya + xa.yc
+    FP4_add(&z3, &z3, &t1);         // (xb+xc)(yb+yc) -(xb.yb) - (xc.yc)                    =  xb.yc + xc.yb
+    FP4_times_i(&t0);               // i.(xc.yc)
+    FP4_add(&(w->b), &(w->b), &t0); // wb = (xa+xb)(ya+yb) -(xa.ya) -(xb.yb) +i(xc.yc)
+    FP4_norm(&z3);
+    FP4_times_i(&z3);               // i[(xb+xc)(yb+yc) -(xb.yb) - (xc.yc)]                 = i(xb.yc + xc.yb)
+    FP4_add(&(w->a), &z0, &z3);     // wa = xa.ya + i(xb.yc + xc.yb)
+
+    FP12_norm(w);
+    w->type = FP_DENSE;
+}
+
+/* FP12 full multiplication w=w*y */
+/* Supports sparse multiplicands */
+/* Usually w is denser than y */
+void YYY::FP12_ssmul(FP12 *w, FP12 *y)
+{
+    FP4 z0, z1, z2, z3, t0, t1;
+    if (w->type == FP_UNITY)
+    {
+        FP12_copy(w, y);
+        return;
+    }
+    if (y->type == FP_UNITY)
+        return;
+
+    if (y->type >= FP_SPARSE)
+    {
+        FP4_mul(&z0, &(w->a), &(y->a)); // xa.ya   always 11x11
+
+#if SEXTIC_TWIST_ZZZ == M_TYPE
+        if (y->type == FP_SPARSE || w->type == FP_SPARSE)
+        {
+            FP2_mul(&z2.b, &(w->b).b, &(y->b).b);
+            FP2_zero(&z2.a);
+            if (y->type != FP_SPARSE)
+                FP2_mul(&z2.a, &(w->b).b, &(y->b).a);
+            if (w->type != FP_SPARSE)
+                FP2_mul(&z2.a, &(w->b).a, &(y->b).b);
+            FP4_times_i(&z2);
+        }
+        else
+#endif
+            FP4_mul(&z2, &(w->b), &(y->b)); // xb.yb  could be 00x00 or 01x01 or or 10x10 or 11x00 or 11x10 or 11x01 or 11x11
+
+        FP4_add(&t0, &(w->a), &(w->b)); // (xa+xb)
+        FP4_add(&t1, &(y->a), &(y->b)); // (ya+yb)
+
+        FP4_norm(&t0);
+        FP4_norm(&t1);
+
+        FP4_mul(&z1, &t0, &t1); // (xa+xb)(ya+yb)  always 11x11
+        FP4_add(&t0, &(w->b), &(w->c)); // (xb+xc)
+        FP4_add(&t1, &(y->b), &(y->c)); // (yb+yc)
+
+        FP4_norm(&t0);
+        FP4_norm(&t1);
+
+        FP4_mul(&z3, &t0, &t1); // (xb+xc)(yb+yc)   could be anything...
+        FP4_neg(&t0, &z0);      // -(xa.ya)
+        FP4_neg(&t1, &z2);      // -(xb.yb)
+
+        FP4_add(&z1, &z1, &t0);
+        FP4_add(&(w->b), &z1, &t1); // /wb = (xa+xb)(ya+yb) -(xa.ya) -(xb.yb)                     = xa.yb + xb.ya
+
+        FP4_add(&z3, &z3, &t1);      // (xb+xc)(yb+yc) -(xb.yb)
+        FP4_add(&z2, &z2, &t0);      // (xb.yb) - (xa.ya)
+
+        FP4_add(&t0, &(w->a), &(w->c)); // (xa+xc)
+        FP4_add(&t1, &(y->a), &(y->c)); // (ya+yc)
+
+        FP4_norm(&t0);
+        FP4_norm(&t1);
+
+        FP4_mul(&t0, &t1, &t0); // (xa+xc)(ya+yc)    always 11x11
+        FP4_add(&z2, &z2, &t0); // (xb.yb) - (xa.ya) + (xa+xc)(ya+yc)
+
+#if SEXTIC_TWIST_ZZZ == D_TYPE
+        if (y->type == FP_SPARSE || w->type == FP_SPARSE)
+        {
+            FP2_mul(&t0.a, &(w->c).a, &(y->c).a);
+            FP2_zero(&t0.b);
+            if (y->type != FP_SPARSE)
+                FP2_mul(&t0.b, &(w->c).a, &(y->c).b);
+            if (w->type != FP_SPARSE)
+                FP2_mul(&t0.b, &(w->c).b, &(y->c).a);
+        }
+        else
+#endif
+            FP4_mul(&t0, &(w->c), &(y->c)); // (xc.yc)  could be anything
+
+        FP4_neg(&t1, &t0);            // -(xc.yc)
+
+        FP4_add(&(w->c), &z2, &t1);     // wc = (xb.yb) - (xa.ya) + (xa+xc)(ya+yc) - (xc.yc)    =  xb.yb + xc.ya + xa.yc
+        FP4_add(&z3, &z3, &t1);         // (xb+xc)(yb+yc) -(xb.yb) - (xc.yc)                    =  xb.yc + xc.yb
+        FP4_times_i(&t0);               // i.(xc.yc)
+        FP4_add(&(w->b), &(w->b), &t0); // wb = (xa+xb)(ya+yb) -(xa.ya) -(xb.yb) +i(xc.yc)
+        FP4_norm(&z3);
+        FP4_times_i(&z3);               // i[(xb+xc)(yb+yc) -(xb.yb) - (xc.yc)]                 = i(xb.yc + xc.yb)
+        FP4_add(&(w->a), &z0, &z3);     // wa = xa.ya + i(xb.yc + xc.yb)
+    } else {
+        if (w->type == FP_SPARSER || w->type == FP_SPARSEST)
+        {
+            FP12_smul(w, y);
+            return;
+        }
+// dense by sparser or sparsest - 13m
+#if SEXTIC_TWIST_ZZZ == D_TYPE
+        FP4_copy(&z3, &(w->b));
+        FP4_mul(&z0, &(w->a), &(y->a));
+
+        if (y->type == FP_SPARSEST)
+            FP4_qmul(&z2, &(w->b), &(y->b).a.a);
+        else
+            FP4_pmul(&z2, &(w->b), &(y->b).a);
+
+        FP4_add(&(w->b), &(w->a), &(w->b));
+        FP4_copy(&t1, &(y->a));
+        FP2_add(&t1.a, &t1.a, &(y->b).a);
+
+        FP4_norm(&t1);
+        FP4_norm(&(w->b));
+
+        FP4_mul(&(w->b), &(w->b), &t1);
+        FP4_add(&z3, &z3, &(w->c));
+        FP4_norm(&z3);
+
+        if (y->type == FP_SPARSEST)
+            FP4_qmul(&z3, &z3, &(y->b).a.a);
+        else
+            FP4_pmul(&z3, &z3, &(y->b).a);
+
+        FP4_neg(&t0, &z0);
+        FP4_neg(&t1, &z2);
+
+        FP4_add(&(w->b), &(w->b), &t0); // z1=z1-z0
+        FP4_add(&(w->b), &(w->b), &t1); // z1=z1-z2
+
+        FP4_add(&z3, &z3, &t1);      // z3=z3-z2
+        FP4_add(&z2, &z2, &t0);      // z2=z2-z0
+
+        FP4_add(&t0, &(w->a), &(w->c));
+        FP4_norm(&t0);
+        FP4_norm(&z3);
+
+        FP4_mul(&t0, &(y->a), &t0);
+        FP4_add(&(w->c), &z2, &t0);
+
+        FP4_times_i(&z3);
+        FP4_add(&(w->a), &z0, &z3);
+#endif
+#if SEXTIC_TWIST_ZZZ == M_TYPE
+        FP4_mul(&z0, &(w->a), &(y->a));
+        FP4_add(&t0, &(w->a), &(w->b));
+        FP4_norm(&t0);
+
+        FP4_mul(&z1, &t0, &(y->a));
+        FP4_add(&t0, &(w->b), &(w->c));
+        FP4_norm(&t0);
+
+        if (y->type == FP_SPARSEST)
+            FP4_qmul(&z3, &t0, &(y->c).b.a);
+        else
+            FP4_pmul(&z3, &t0, &(y->c).b);
+
+        FP4_times_i(&z3);
+
+        FP4_neg(&t0, &z0);
+        FP4_add(&z1, &z1, &t0); // z1=z1-z0
+
+        FP4_copy(&(w->b), &z1);
+        FP4_copy(&z2, &t0);
+
+        FP4_add(&t0, &(w->a), &(w->c));
+        FP4_add(&t1, &(y->a), &(y->c));
+
+        FP4_norm(&t0);
+        FP4_norm(&t1);
+
+        FP4_mul(&t0, &t1, &t0);
+        FP4_add(&z2, &z2, &t0);
+
+        if (y->type == FP_SPARSEST)
+            FP4_qmul(&t0, &(w->c), &(y->c).b.a);
+        else
+            FP4_pmul(&t0, &(w->c), &(y->c).b);
+
+        FP4_times_i(&t0);
+        FP4_neg(&t1, &t0);
+        FP4_times_i(&t0);
+
+        FP4_add(&(w->c), &z2, &t1);
+        FP4_add(&z3, &z3, &t1);
+
+        FP4_add(&(w->b), &(w->b), &t0);
+        FP4_norm(&z3);
+        FP4_times_i(&z3);
+        FP4_add(&(w->a), &z0, &z3);
+
+#endif
+    }
+    w->type = FP_DENSE;
+    FP12_norm(w);
+}
+
+/* FP12 multiplication w=w*y */
+/* catering for special case that arises from special form of ATE pairing line function */
+/* w and y are both sparser or sparsest line functions - cost = 6m */
+void YYY::FP12_smul(FP12 *w, FP12 *y)
+{
+    FP2 w1, w2, w3, ta, tb, tc, td, te, t;
+
+#if SEXTIC_TWIST_ZZZ == D_TYPE
+    FP2_mul(&w1, &(w->a).a, &(y->a).a); // A1.A2
+    FP2_mul(&w2, &(w->a).b, &(y->a).b); // B1.B2
+
+    if (y->type == FP_SPARSEST || w->type == FP_SPARSEST)
+    {
+        if (y->type == FP_SPARSEST && w->type == FP_SPARSEST)
+        {
+            FP_mul(&w3.a, &(w->b).a.a, &(y->b).a.a);
+            FP_zero(&w3.b);
+        } else {
+            if (y->type != FP_SPARSEST)
+                FP2_pmul(&w3, &(y->b).a, &(w->b).a.a);
+            if (w->type != FP_SPARSEST)
+                FP2_pmul(&w3, &(w->b).a, &(y->b).a.a);
+        }
+    }
+    else
+        FP2_mul(&w3, &(w->b).a, &(y->b).a); // C1.C2
+
+    FP2_add(&ta, &(w->a).a, &(w->a).b); // A1+B1
+    FP2_add(&tb, &(y->a).a, &(y->a).b); // A2+B2
+    FP2_norm(&ta);
+    FP2_norm(&tb);
+    FP2_mul(&tc, &ta, &tb);         // (A1+B1)(A2+B2)
+    FP2_add(&t, &w1, &w2);
+    FP2_neg(&t, &t);
+    FP2_add(&tc, &tc, &t);          // (A1+B1)(A2+B2)-A1.A2-B1*B2 =  (A1.B2+A2.B1)
+
+    FP2_add(&ta, &(w->a).a, &(w->b).a); // A1+C1
+    FP2_add(&tb, &(y->a).a, &(y->b).a); // A2+C2
+    FP2_norm(&ta);
+    FP2_norm(&tb);
+    FP2_mul(&td, &ta, &tb);         // (A1+C1)(A2+C2)
+    FP2_add(&t, &w1, &w3);
+    FP2_neg(&t, &t);
+    FP2_add(&td, &td, &t);          // (A1+C1)(A2+C2)-A1.A2-C1*C2 =  (A1.C2+A2.C1)
+
+    FP2_add(&ta, &(w->a).b, &(w->b).a); // B1+C1
+    FP2_add(&tb, &(y->a).b, &(y->b).a); // B2+C2
+    FP2_norm(&ta);
+    FP2_norm(&tb);
+    FP2_mul(&te, &ta, &tb);         // (B1+C1)(B2+C2)
+    FP2_add(&t, &w2, &w3);
+    FP2_neg(&t, &t);
+    FP2_add(&te, &te, &t);          // (B1+C1)(B2+C2)-B1.B2-C1*C2 =  (B1.C2+B2.C1)
+
+    FP2_mul_ip(&w2);
+    FP2_add(&w1, &w1, &w2);
+    FP4_from_FP2s(&(w->a), &w1, &tc);
+    FP4_from_FP2s(&(w->b), &td, &te); // only norm these 2
+    FP4_from_FP2(&(w->c), &w3);
+
+    FP4_norm(&(w->a));
+    FP4_norm(&(w->b));
+#endif
+//  } else {
+#if SEXTIC_TWIST_ZZZ == M_TYPE
+    FP2_mul(&w1, &(w->a).a, &(y->a).a); // A1.A2
+    FP2_mul(&w2, &(w->a).b, &(y->a).b); // B1.B2
+
+    if (y->type == FP_SPARSEST || w->type == FP_SPARSEST)
+    {
+        if (y->type == FP_SPARSEST && w->type == FP_SPARSEST)
+        {
+            FP_mul(&w3.a, &(w->c).b.a, &(y->c).b.a);
+            FP_zero(&w3.b);
+        } else {
+            if (y->type != FP_SPARSEST)
+                FP2_pmul(&w3, &(y->c).b, &(w->c).b.a);
+            if (w->type != FP_SPARSEST)
+                FP2_pmul(&w3, &(w->c).b, &(y->c).b.a);
+        }
+    }
+    else
+        FP2_mul(&w3, &(w->c).b, &(y->c).b); // F1.F2
+
+    FP2_add(&ta, &(w->a).a, &(w->a).b); // A1+B1
+    FP2_add(&tb, &(y->a).a, &(y->a).b); // A2+B2
+    FP2_norm(&ta);
+    FP2_norm(&tb);
+    FP2_mul(&tc, &ta, &tb);         // (A1+B1)(A2+B2)
+    FP2_add(&t, &w1, &w2);
+    FP2_neg(&t, &t);
+    FP2_add(&tc, &tc, &t);          // (A1+B1)(A2+B2)-A1.A2-B1*B2 =  (A1.B2+A2.B1)
+
+    FP2_add(&ta, &(w->a).a, &(w->c).b); // A1+F1
+    FP2_add(&tb, &(y->a).a, &(y->c).b); // A2+F2
+    FP2_norm(&ta);
+    FP2_norm(&tb);
+    FP2_mul(&td, &ta, &tb);         // (A1+F1)(A2+F2)
+    FP2_add(&t, &w1, &w3);
+    FP2_neg(&t, &t);
+    FP2_add(&td, &td, &t);          // (A1+F1)(A2+F2)-A1.A2-F1*F2 =  (A1.F2+A2.F1)
+
+    FP2_add(&ta, &(w->a).b, &(w->c).b); // B1+F1
+    FP2_add(&tb, &(y->a).b, &(y->c).b); // B2+F2
+    FP2_norm(&ta);
+    FP2_norm(&tb);
+    FP2_mul(&te, &ta, &tb);         // (B1+F1)(B2+F2)
+    FP2_add(&t, &w2, &w3);
+    FP2_neg(&t, &t);
+    FP2_add(&te, &te, &t);          // (B1+F1)(B2+F2)-B1.B2-F1*F2 =  (B1.F2+B2.F1)
+
+    FP2_mul_ip(&w2);
+    FP2_add(&w1, &w1, &w2);
+    FP4_from_FP2s(&(w->a), &w1, &tc);
+
+    FP2_mul_ip(&w3);
+    FP2_norm(&w3);
+    FP4_from_FP2H(&(w->b), &w3);
+
+    FP2_norm(&te);
+    FP2_mul_ip(&te);
+    FP4_from_FP2s(&(w->c), &te, &td);
+
+    FP4_norm(&(w->a));
+    FP4_norm(&(w->c));
+#endif
+
+//  }
+    w->type = FP_SPARSE;
+}
+
+/* Set w=1/x */
+/* SU= 600 */
+void YYY::FP12_inv(FP12 *w, FP12 *x)
+{
+    FP4 f0, f1, f2, f3;
+
+    FP4_sqr(&f0, &(x->a));
+    FP4_mul(&f1, &(x->b), &(x->c));
+    FP4_times_i(&f1);
+    FP4_sub(&f0, &f0, &f1); /* y.a */
+    FP4_norm(&f0);
+
+    FP4_sqr(&f1, &(x->c));
+    FP4_times_i(&f1);
+    FP4_mul(&f2, &(x->a), &(x->b));
+    FP4_sub(&f1, &f1, &f2); /* y.b */
+    FP4_norm(&f1);
+
+    FP4_sqr(&f2, &(x->b));
+    FP4_mul(&f3, &(x->a), &(x->c));
+    FP4_sub(&f2, &f2, &f3); /* y.c */
+    FP4_norm(&f2);
+
+    FP4_mul(&f3, &(x->b), &f2);
+    FP4_times_i(&f3);
+    FP4_mul(&(w->a), &f0, &(x->a));
+    FP4_add(&f3, &(w->a), &f3);
+    FP4_mul(&(w->c), &f1, &(x->c));
+    FP4_times_i(&(w->c));
+
+    FP4_add(&f3, &(w->c), &f3);
+    FP4_norm(&f3);
+
+    FP4_inv(&f3, &f3, NULL);
+
+    FP4_mul(&(w->a), &f0, &f3);
+    FP4_mul(&(w->b), &f1, &f3);
+    FP4_mul(&(w->c), &f2, &f3);
+    w->type = FP_DENSE;
+}
+
+/* constant time powering by small integer of max length bts */
+
+void YYY::FP12_pinpow(FP12 *r, int e, int bts)
+{
+    int i, b;
+    FP12 R[2];
+
+    FP12_one(&R[0]);
+    FP12_copy(&R[1], r);
+
+    for (i = bts - 1; i >= 0; i--)
+    {
+        b = (e >> i) & 1;
+        FP12_mul(&R[1 - b], &R[b]);
+        FP12_usqr(&R[b], &R[b]);
+    }
+    FP12_copy(r, &R[0]);
+}
+
+/* Compressed powering of unitary elements y=x^(e mod r) */
+
+void YYY::FP12_compow(FP4 *c, FP12 *x, BIG e, BIG r)
+{
+    FP12 g1, g2;
+    FP4 cp, cpm1, cpm2;
+    FP2 f;
+    BIG q, a, b, m;
+
+    BIG_rcopy(a, Fra);
+    BIG_rcopy(b, Frb);
+    FP2_from_BIGs(&f, a, b);
+
+    BIG_rcopy(q, Modulus);
+
+    FP12_copy(&g1, x);
+    FP12_copy(&g2, x);
+
+    BIG_copy(m, q);
+    BIG_mod(m, r);
+
+    BIG_copy(a, e);
+    BIG_mod(a, m);
+
+    BIG_copy(b, e);
+    BIG_sdiv(b, m);
+
+    FP12_trace(c, &g1);
+
+    if (BIG_iszilch(b))
+    {
+        FP4_xtr_pow(c, c, e);
+        return;
+    }
+
+    FP12_frob(&g2, &f);
+    FP12_trace(&cp, &g2);
+
+    FP12_conj(&g1, &g1);
+    FP12_mul(&g2, &g1);
+    FP12_trace(&cpm1, &g2);
+    FP12_mul(&g2, &g1);
+    FP12_trace(&cpm2, &g2);
+
+    FP4_xtr_pow2(c, &cp, c, &cpm1, &cpm2, a, b);
+
+}
+
+/* Note this is simple square and multiply, so not side-channel safe */
+/* But fast for final exponentiation where exponent is not a secret */
+
+void YYY::FP12_pow(FP12 *r, FP12 *a, BIG b)
+{
+    FP12 w, sf;
+    BIG b1, b3;
+    int i, nb, bt;
+    BIG_copy(b1, b);
+    BIG_norm(b1);
+    BIG_pmul(b3, b1, 3);
+    BIG_norm(b3);
+    FP12_copy(&sf, a);
+    FP12_norm(&sf);
+    FP12_copy(&w, &sf);
+
+    if (BIG_iszilch(b3))
+    {
+        FP12_one(r);
+        return;
+    }
+
+    nb = BIG_nbits(b3);
+    for (i = nb - 2; i >= 1; i--)
+    {
+        FP12_usqr(&w, &w);
+        bt = BIG_bit(b3, i) - BIG_bit(b1, i);
+        if (bt == 1)
+            FP12_mul(&w, &sf);
+        if (bt == -1)
+        {
+            FP12_conj(&sf, &sf);
+            FP12_mul(&w, &sf);
+            FP12_conj(&sf, &sf);
+        }
+    }
+
+    FP12_copy(r, &w);
+    FP12_reduce(r);
+
+
+}
+
+
+/* p=q0^u0.q1^u1.q2^u2.q3^u3 */
+/* Side channel attack secure */
+// Bos & Costello https://eprint.iacr.org/2013/458.pdf
+// Faz-Hernandez & Longa & Sanchez  https://eprint.iacr.org/2013/158.pdf
+
+void YYY::FP12_pow4(FP12 *p, FP12 *q, BIG u[4])
+{
+    int i, j, k, nb, pb, bt;
+    FP12 g[8], r;
+    BIG t[4], mt;
+    sign8 w[NLEN_XXX * BASEBITS_XXX + 1];
+    sign8 s[NLEN_XXX * BASEBITS_XXX + 1];
+
+    for (i = 0; i < 4; i++)
+        BIG_copy(t[i], u[i]);
+
+
+// Precomputed table
+    FP12_copy(&g[0], &q[0]); // q[0]
+    FP12_copy(&g[1], &g[0]);
+    FP12_mul(&g[1], &q[1]); // q[0].q[1]
+    FP12_copy(&g[2], &g[0]);
+    FP12_mul(&g[2], &q[2]); // q[0].q[2]
+    FP12_copy(&g[3], &g[1]);
+    FP12_mul(&g[3], &q[2]); // q[0].q[1].q[2]
+    FP12_copy(&g[4], &g[0]);
+    FP12_mul(&g[4], &q[3]); // q[0].q[3]
+    FP12_copy(&g[5], &g[1]);
+    FP12_mul(&g[5], &q[3]); // q[0].q[1].q[3]
+    FP12_copy(&g[6], &g[2]);
+    FP12_mul(&g[6], &q[3]); // q[0].q[2].q[3]
+    FP12_copy(&g[7], &g[3]);
+    FP12_mul(&g[7], &q[3]); // q[0].q[1].q[2].q[3]
+
+// Make it odd
+    pb = 1 - BIG_parity(t[0]);
+    BIG_inc(t[0], pb);
+    BIG_norm(t[0]);
+
+// Number of bits
+    BIG_zero(mt);
+    for (i = 0; i < 4; i++)
+    {
+        BIG_or(mt, mt, t[i]);
+    }
+    nb = 1 + BIG_nbits(mt);
+
+// Sign pivot
+    s[nb - 1] = 1;
+    for (i = 0; i < nb - 1; i++)
+    {
+        BIG_fshr(t[0], 1);
+        s[i] = 2 * BIG_parity(t[0]) - 1;
+    }
+
+// Recoded exponent
+    for (i = 0; i < nb; i++)
+    {
+        w[i] = 0;
+        k = 1;
+        for (j = 1; j < 4; j++)
+        {
+            bt = s[i] * BIG_parity(t[j]);
+            BIG_fshr(t[j], 1);
+
+            BIG_dec(t[j], (bt >> 1));
+            BIG_norm(t[j]);
+            w[i] += bt * k;
+            k *= 2;
+        }
+    }
+
+// Main loop
+    FP12_select(p, g, 2 * w[nb - 1] + 1);
+    for (i = nb - 2; i >= 0; i--)
+    {
+        FP12_select(&r, g, 2 * w[i] + s[i]);
+        FP12_usqr(p, p);
+        FP12_mul(p, &r);
+    }
+// apply correction
+    FP12_conj(&r, &q[0]);
+    FP12_mul(&r, p);
+    FP12_cmove(p, &r, pb);
+
+    FP12_reduce(p);
+}
+
+/* Set w=w^p using Frobenius */
+/* SU= 160 */
+void YYY::FP12_frob(FP12 *w, FP2 *f)
+{
+    FP2 f2, f3;
+    FP2_sqr(&f2, f);    /* f2=f^2 */
+    FP2_mul(&f3, &f2, f); /* f3=f^3 */
+
+    FP4_frob(&(w->a), &f3);
+    FP4_frob(&(w->b), &f3);
+    FP4_frob(&(w->c), &f3);
+
+    FP4_pmul(&(w->b), &(w->b), f);
+    FP4_pmul(&(w->c), &(w->c), &f2);
+    w->type = FP_DENSE;
+}
+
+/* SU= 8 */
+/* normalise all components of w */
+void YYY::FP12_norm(FP12 *w)
+{
+    FP4_norm(&(w->a));
+    FP4_norm(&(w->b));
+    FP4_norm(&(w->c));
+}
+
+/* SU= 8 */
+/* reduce all components of w */
+void YYY::FP12_reduce(FP12 *w)
+{
+    FP4_reduce(&(w->a));
+    FP4_reduce(&(w->b));
+    FP4_reduce(&(w->c));
+}
+
+/* trace function w=trace(x) */
+/* SU= 8 */
+void YYY::FP12_trace(FP4 *w, FP12 *x)
+{
+    FP4_imul(w, &(x->a), 3);
+    FP4_reduce(w);
+}
+
+/* SU= 8 */
+/* Output w in hex */
+void YYY::FP12_output(FP12 *w)
+{
+    printf("[");
+    FP4_output(&(w->a));
+    printf(",");
+    FP4_output(&(w->b));
+    printf(",");
+    FP4_output(&(w->c));
+    printf("]");
+}
+
+/* SU= 64 */
+/* Convert g to octet string w */
+void YYY::FP12_toOctet(octet *W, FP12 *g)
+{
+    W->len = 12 * MODBYTES_XXX;
+    FP4_toBytes(&(W->val[0]),&(g->c));
+    FP4_toBytes(&(W->val[4 * MODBYTES_XXX]),&(g->b));
+    FP4_toBytes(&(W->val[8 * MODBYTES_XXX]),&(g->a));
+}
+
+/* SU= 24 */
+/* Restore g from octet string w */
+void YYY::FP12_fromOctet(FP12 *g, octet *W)
+{
+    FP4_fromBytes(&(g->c),&(W->val[0]));
+    FP4_fromBytes(&(g->b),&(W->val[4 * MODBYTES_XXX]));
+    FP4_fromBytes(&(g->a),&(W->val[8 * MODBYTES_XXX]));
+
+}
+
+/* Move g to f
+if d=1 */
+void YYY::FP12_cmove(FP12 *f, FP12 *g, int d)
+{
+    FP4_cmove(&(f->a), &(g->a), d);
+    FP4_cmove(&(f->b), &(g->b), d);
+    FP4_cmove(&(f->c), &(g->c), d);
+    d = ~(d - 1);
+    f->type ^= (f->type ^ g->type)&d;
+}
+
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp12.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp12.h
new file mode 100644
index 0000000..5bd7b69
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp12.h
@@ -0,0 +1,230 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP12_YYY_H
+#define FP12_YYY_H
+
+#include "fp4_YYY.h"
+
+using namespace core;
+
+namespace YYY {
+/**
+	@brief FP12 Structure - towered over three FP4
+*/
+
+typedef struct
+{
+    FP4 a; /**< first part of FP12 */
+    FP4 b; /**< second part of FP12 */
+    FP4 c; /**< third part of FP12 */
+    int type;
+} FP12;
+
+extern const XXX::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const XXX::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+/* FP12 prototypes */
+/**	@brief Tests for FP12 equal to zero
+ *
+	@param x FP12 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP12_iszilch(FP12 *x);
+/**	@brief Tests for FP12 equal to unity
+ *
+	@param x FP12 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP12_isunity(FP12 *x);
+/**	@brief Copy FP12 to another FP12
+ *
+	@param x FP12 instance, on exit = y
+	@param y FP12 instance to be copied
+ */
+extern void FP12_copy(FP12 *x, FP12 *y);
+/**	@brief Set FP12 to unity
+ *
+	@param x FP12 instance to be set to one
+ */
+extern void FP12_one(FP12 *x);
+
+/**	@brief Set FP12 to zero
+ *
+	@param x FP12 instance to be set to zero
+ */
+extern void FP12_zero(FP12 *x);
+
+/**	@brief Tests for equality of two FP12s
+ *
+	@param x FP12 instance to be compared
+	@param y FP12 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP12_equals(FP12 *x, FP12 *y);
+/**	@brief Conjugation of FP12
+ *
+	If y=(a,b,c) (where a,b,c are its three FP4 components) on exit x=(conj(a),-conj(b),conj(c))
+	@param x FP12 instance, on exit = conj(y)
+	@param y FP12 instance
+ */
+extern void FP12_conj(FP12 *x, FP12 *y);
+/**	@brief Initialise FP12 from single FP4
+ *
+	Sets first FP4 component of an FP12, other components set to zero
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP4
+ */
+extern void FP12_from_FP4(FP12 *x, FP4 *a);
+/**	@brief Initialise FP12 from three FP4s
+ *
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP12
+	@param b FP4 to form second part of FP12
+	@param c FP4 to form third part of FP12
+ */
+extern void FP12_from_FP4s(FP12 *x, FP4 *a, FP4* b, FP4 *c);
+/**	@brief Fast Squaring of an FP12 in "unitary" form
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP4 instance, must be unitary
+ */
+extern void FP12_usqr(FP12 *x, FP12 *y);
+/**	@brief Squaring an FP12
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP12 instance
+ */
+extern void FP12_sqr(FP12 *x, FP12 *y);
+/**	@brief Fast multiplication of two sparse FP12s that arises from ATE pairing line functions
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_smul(FP12 *x, FP12 *y);
+
+/**	@brief Fast multiplication of what may be sparse multiplicands
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_ssmul(FP12 *x, FP12 *y);
+
+
+/**	@brief Full unconditional Multiplication of two FP12s
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, the multiplier
+ */
+extern void FP12_mul(FP12 *x, FP12 *y);
+
+/**	@brief Inverting an FP12
+ *
+	@param x FP12 instance, on exit = 1/y
+	@param y FP12 instance
+	@param t D_TYPE or M_TYPE twist
+ */
+extern void FP12_inv(FP12 *x, FP12 *y);
+/**	@brief Raises an FP12 to the power of a BIG
+ *
+	@param r FP12 instance, on exit = y^b
+	@param x FP12 instance
+	@param b BIG number
+ */
+extern void FP12_pow(FP12 *r, FP12 *x, XXX::BIG b);
+/**	@brief Raises an FP12 instance x to a small integer power, side-channel resistant
+ *
+	@param x FP12 instance, on exit = x^i
+	@param i small integer exponent
+	@param b maximum number of bits in exponent
+ */
+extern void FP12_pinpow(FP12 *x, int i, int b);
+
+/**	@brief Raises an FP12 instance x to a BIG power, compressed to FP4
+ *
+	@param c FP4 instance, on exit = x^(e mod r) as FP4
+	@param x FP12 input
+	@param e BIG exponent
+	@param r BIG group order
+ */
+extern void FP12_compow(FP4 *c, FP12 *x, XXX::BIG e, XXX::BIG r);
+
+/**	@brief Calculate x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3], side-channel resistant
+ *
+	@param r FP12 instance, on exit = x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3]
+	@param x FP12 array with 4 FP12s
+	@param b BIG array of 4 exponents
+ */
+extern void FP12_pow4(FP12 *r, FP12 *x, XXX::BIG *b);
+/**	@brief Raises an FP12 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP12 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP12_frob(FP12 *x, FP2 *f);
+/**	@brief Reduces all components of possibly unreduced FP12 mod Modulus
+ *
+	@param x FP12 instance, on exit reduced mod Modulus
+ */
+extern void FP12_reduce(FP12 *x);
+/**	@brief Normalises the components of an FP12
+ *
+	@param x FP12 instance to be normalised
+ */
+extern void FP12_norm(FP12 *x);
+/**	@brief Formats and outputs an FP12 to the console
+ *
+	@param x FP12 instance to be printed
+ */
+extern void FP12_output(FP12 *x);
+/**	@brief Formats and outputs an FP12 instance to an octet string
+ *
+	Serializes the components of an FP12 to big-endian base 256 form.
+	@param S output octet string
+	@param x FP12 instance to be converted to an octet string
+ */
+extern void FP12_toOctet(octet *S, FP12 *x);
+/**	@brief Creates an FP12 instance from an octet string
+ *
+	De-serializes the components of an FP12 to create an FP12 from big-endian base 256 components.
+	@param x FP12 instance to be created from an octet string
+	@param S input octet string
+
+ */
+extern void FP12_fromOctet(FP12 *x, octet *S);
+/**	@brief Calculate the trace of an FP12
+ *
+	@param t FP4 trace of x, on exit = tr(x)
+	@param x FP12 instance
+
+ */
+extern void FP12_trace(FP4 *t, FP12 *x);
+
+/**	@brief Conditional copy of FP12 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP12 instance, set to y if s!=0
+	@param y another FP12 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP12_cmove(FP12 *x, FP12 *y, int s);
+
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp12_BLS12381.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp12_BLS12381.h
new file mode 100644
index 0000000..9e5135a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp12_BLS12381.h
@@ -0,0 +1,230 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP12_BLS12381_H
+#define FP12_BLS12381_H
+
+#include "fp4_BLS12381.h"
+
+using namespace core;
+
+namespace BLS12381 {
+/**
+	@brief FP12 Structure - towered over three FP4
+*/
+
+typedef struct
+{
+    FP4 a; /**< first part of FP12 */
+    FP4 b; /**< second part of FP12 */
+    FP4 c; /**< third part of FP12 */
+    int type;
+} FP12;
+
+extern const B384_58::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B384_58::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+/* FP12 prototypes */
+/**	@brief Tests for FP12 equal to zero
+ *
+	@param x FP12 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP12_iszilch(FP12 *x);
+/**	@brief Tests for FP12 equal to unity
+ *
+	@param x FP12 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP12_isunity(FP12 *x);
+/**	@brief Copy FP12 to another FP12
+ *
+	@param x FP12 instance, on exit = y
+	@param y FP12 instance to be copied
+ */
+extern void FP12_copy(FP12 *x, FP12 *y);
+/**	@brief Set FP12 to unity
+ *
+	@param x FP12 instance to be set to one
+ */
+extern void FP12_one(FP12 *x);
+
+/**	@brief Set FP12 to zero
+ *
+	@param x FP12 instance to be set to zero
+ */
+extern void FP12_zero(FP12 *x);
+
+/**	@brief Tests for equality of two FP12s
+ *
+	@param x FP12 instance to be compared
+	@param y FP12 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP12_equals(FP12 *x, FP12 *y);
+/**	@brief Conjugation of FP12
+ *
+	If y=(a,b,c) (where a,b,c are its three FP4 components) on exit x=(conj(a),-conj(b),conj(c))
+	@param x FP12 instance, on exit = conj(y)
+	@param y FP12 instance
+ */
+extern void FP12_conj(FP12 *x, FP12 *y);
+/**	@brief Initialise FP12 from single FP4
+ *
+	Sets first FP4 component of an FP12, other components set to zero
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP4
+ */
+extern void FP12_from_FP4(FP12 *x, FP4 *a);
+/**	@brief Initialise FP12 from three FP4s
+ *
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP12
+	@param b FP4 to form second part of FP12
+	@param c FP4 to form third part of FP12
+ */
+extern void FP12_from_FP4s(FP12 *x, FP4 *a, FP4* b, FP4 *c);
+/**	@brief Fast Squaring of an FP12 in "unitary" form
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP4 instance, must be unitary
+ */
+extern void FP12_usqr(FP12 *x, FP12 *y);
+/**	@brief Squaring an FP12
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP12 instance
+ */
+extern void FP12_sqr(FP12 *x, FP12 *y);
+/**	@brief Fast multiplication of two sparse FP12s that arises from ATE pairing line functions
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_smul(FP12 *x, FP12 *y);
+
+/**	@brief Fast multiplication of what may be sparse multiplicands
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_ssmul(FP12 *x, FP12 *y);
+
+
+/**	@brief Full unconditional Multiplication of two FP12s
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, the multiplier
+ */
+extern void FP12_mul(FP12 *x, FP12 *y);
+
+/**	@brief Inverting an FP12
+ *
+	@param x FP12 instance, on exit = 1/y
+	@param y FP12 instance
+	@param t D_TYPE or M_TYPE twist
+ */
+extern void FP12_inv(FP12 *x, FP12 *y);
+/**	@brief Raises an FP12 to the power of a BIG
+ *
+	@param r FP12 instance, on exit = y^b
+	@param x FP12 instance
+	@param b BIG number
+ */
+extern void FP12_pow(FP12 *r, FP12 *x, B384_58::BIG b);
+/**	@brief Raises an FP12 instance x to a small integer power, side-channel resistant
+ *
+	@param x FP12 instance, on exit = x^i
+	@param i small integer exponent
+	@param b maximum number of bits in exponent
+ */
+extern void FP12_pinpow(FP12 *x, int i, int b);
+
+/**	@brief Raises an FP12 instance x to a BIG power, compressed to FP4
+ *
+	@param c FP4 instance, on exit = x^(e mod r) as FP4
+	@param x FP12 input
+	@param e BIG exponent
+	@param r BIG group order
+ */
+extern void FP12_compow(FP4 *c, FP12 *x, B384_58::BIG e, B384_58::BIG r);
+
+/**	@brief Calculate x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3], side-channel resistant
+ *
+	@param r FP12 instance, on exit = x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3]
+	@param x FP12 array with 4 FP12s
+	@param b BIG array of 4 exponents
+ */
+extern void FP12_pow4(FP12 *r, FP12 *x, B384_58::BIG *b);
+/**	@brief Raises an FP12 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP12 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP12_frob(FP12 *x, FP2 *f);
+/**	@brief Reduces all components of possibly unreduced FP12 mod Modulus
+ *
+	@param x FP12 instance, on exit reduced mod Modulus
+ */
+extern void FP12_reduce(FP12 *x);
+/**	@brief Normalises the components of an FP12
+ *
+	@param x FP12 instance to be normalised
+ */
+extern void FP12_norm(FP12 *x);
+/**	@brief Formats and outputs an FP12 to the console
+ *
+	@param x FP12 instance to be printed
+ */
+extern void FP12_output(FP12 *x);
+/**	@brief Formats and outputs an FP12 instance to an octet string
+ *
+	Serializes the components of an FP12 to big-endian base 256 form.
+	@param S output octet string
+	@param x FP12 instance to be converted to an octet string
+ */
+extern void FP12_toOctet(octet *S, FP12 *x);
+/**	@brief Creates an FP12 instance from an octet string
+ *
+	De-serializes the components of an FP12 to create an FP12 from big-endian base 256 components.
+	@param x FP12 instance to be created from an octet string
+	@param S input octet string
+
+ */
+extern void FP12_fromOctet(FP12 *x, octet *S);
+/**	@brief Calculate the trace of an FP12
+ *
+	@param t FP4 trace of x, on exit = tr(x)
+	@param x FP12 instance
+
+ */
+extern void FP12_trace(FP4 *t, FP12 *x);
+
+/**	@brief Conditional copy of FP12 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP12 instance, set to y if s!=0
+	@param y another FP12 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP12_cmove(FP12 *x, FP12 *y, int s);
+
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp12_BLS12383.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp12_BLS12383.h
new file mode 100644
index 0000000..5fd942b
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp12_BLS12383.h
@@ -0,0 +1,230 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP12_BLS12383_H
+#define FP12_BLS12383_H
+
+#include "fp4_BLS12383.h"
+
+using namespace core;
+
+namespace BLS12383 {
+/**
+	@brief FP12 Structure - towered over three FP4
+*/
+
+typedef struct
+{
+    FP4 a; /**< first part of FP12 */
+    FP4 b; /**< second part of FP12 */
+    FP4 c; /**< third part of FP12 */
+    int type;
+} FP12;
+
+extern const B384_58::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B384_58::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+/* FP12 prototypes */
+/**	@brief Tests for FP12 equal to zero
+ *
+	@param x FP12 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP12_iszilch(FP12 *x);
+/**	@brief Tests for FP12 equal to unity
+ *
+	@param x FP12 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP12_isunity(FP12 *x);
+/**	@brief Copy FP12 to another FP12
+ *
+	@param x FP12 instance, on exit = y
+	@param y FP12 instance to be copied
+ */
+extern void FP12_copy(FP12 *x, FP12 *y);
+/**	@brief Set FP12 to unity
+ *
+	@param x FP12 instance to be set to one
+ */
+extern void FP12_one(FP12 *x);
+
+/**	@brief Set FP12 to zero
+ *
+	@param x FP12 instance to be set to zero
+ */
+extern void FP12_zero(FP12 *x);
+
+/**	@brief Tests for equality of two FP12s
+ *
+	@param x FP12 instance to be compared
+	@param y FP12 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP12_equals(FP12 *x, FP12 *y);
+/**	@brief Conjugation of FP12
+ *
+	If y=(a,b,c) (where a,b,c are its three FP4 components) on exit x=(conj(a),-conj(b),conj(c))
+	@param x FP12 instance, on exit = conj(y)
+	@param y FP12 instance
+ */
+extern void FP12_conj(FP12 *x, FP12 *y);
+/**	@brief Initialise FP12 from single FP4
+ *
+	Sets first FP4 component of an FP12, other components set to zero
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP4
+ */
+extern void FP12_from_FP4(FP12 *x, FP4 *a);
+/**	@brief Initialise FP12 from three FP4s
+ *
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP12
+	@param b FP4 to form second part of FP12
+	@param c FP4 to form third part of FP12
+ */
+extern void FP12_from_FP4s(FP12 *x, FP4 *a, FP4* b, FP4 *c);
+/**	@brief Fast Squaring of an FP12 in "unitary" form
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP4 instance, must be unitary
+ */
+extern void FP12_usqr(FP12 *x, FP12 *y);
+/**	@brief Squaring an FP12
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP12 instance
+ */
+extern void FP12_sqr(FP12 *x, FP12 *y);
+/**	@brief Fast multiplication of two sparse FP12s that arises from ATE pairing line functions
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_smul(FP12 *x, FP12 *y);
+
+/**	@brief Fast multiplication of what may be sparse multiplicands
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_ssmul(FP12 *x, FP12 *y);
+
+
+/**	@brief Full unconditional Multiplication of two FP12s
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, the multiplier
+ */
+extern void FP12_mul(FP12 *x, FP12 *y);
+
+/**	@brief Inverting an FP12
+ *
+	@param x FP12 instance, on exit = 1/y
+	@param y FP12 instance
+	@param t D_TYPE or M_TYPE twist
+ */
+extern void FP12_inv(FP12 *x, FP12 *y);
+/**	@brief Raises an FP12 to the power of a BIG
+ *
+	@param r FP12 instance, on exit = y^b
+	@param x FP12 instance
+	@param b BIG number
+ */
+extern void FP12_pow(FP12 *r, FP12 *x, B384_58::BIG b);
+/**	@brief Raises an FP12 instance x to a small integer power, side-channel resistant
+ *
+	@param x FP12 instance, on exit = x^i
+	@param i small integer exponent
+	@param b maximum number of bits in exponent
+ */
+extern void FP12_pinpow(FP12 *x, int i, int b);
+
+/**	@brief Raises an FP12 instance x to a BIG power, compressed to FP4
+ *
+	@param c FP4 instance, on exit = x^(e mod r) as FP4
+	@param x FP12 input
+	@param e BIG exponent
+	@param r BIG group order
+ */
+extern void FP12_compow(FP4 *c, FP12 *x, B384_58::BIG e, B384_58::BIG r);
+
+/**	@brief Calculate x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3], side-channel resistant
+ *
+	@param r FP12 instance, on exit = x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3]
+	@param x FP12 array with 4 FP12s
+	@param b BIG array of 4 exponents
+ */
+extern void FP12_pow4(FP12 *r, FP12 *x, B384_58::BIG *b);
+/**	@brief Raises an FP12 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP12 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP12_frob(FP12 *x, FP2 *f);
+/**	@brief Reduces all components of possibly unreduced FP12 mod Modulus
+ *
+	@param x FP12 instance, on exit reduced mod Modulus
+ */
+extern void FP12_reduce(FP12 *x);
+/**	@brief Normalises the components of an FP12
+ *
+	@param x FP12 instance to be normalised
+ */
+extern void FP12_norm(FP12 *x);
+/**	@brief Formats and outputs an FP12 to the console
+ *
+	@param x FP12 instance to be printed
+ */
+extern void FP12_output(FP12 *x);
+/**	@brief Formats and outputs an FP12 instance to an octet string
+ *
+	Serializes the components of an FP12 to big-endian base 256 form.
+	@param S output octet string
+	@param x FP12 instance to be converted to an octet string
+ */
+extern void FP12_toOctet(octet *S, FP12 *x);
+/**	@brief Creates an FP12 instance from an octet string
+ *
+	De-serializes the components of an FP12 to create an FP12 from big-endian base 256 components.
+	@param x FP12 instance to be created from an octet string
+	@param S input octet string
+
+ */
+extern void FP12_fromOctet(FP12 *x, octet *S);
+/**	@brief Calculate the trace of an FP12
+ *
+	@param t FP4 trace of x, on exit = tr(x)
+	@param x FP12 instance
+
+ */
+extern void FP12_trace(FP4 *t, FP12 *x);
+
+/**	@brief Conditional copy of FP12 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP12 instance, set to y if s!=0
+	@param y another FP12 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP12_cmove(FP12 *x, FP12 *y, int s);
+
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp12_BLS12443.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp12_BLS12443.h
new file mode 100644
index 0000000..d2b98bd
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp12_BLS12443.h
@@ -0,0 +1,230 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP12_BLS12443_H
+#define FP12_BLS12443_H
+
+#include "fp4_BLS12443.h"
+
+using namespace core;
+
+namespace BLS12443 {
+/**
+	@brief FP12 Structure - towered over three FP4
+*/
+
+typedef struct
+{
+    FP4 a; /**< first part of FP12 */
+    FP4 b; /**< second part of FP12 */
+    FP4 c; /**< third part of FP12 */
+    int type;
+} FP12;
+
+extern const B448_60::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B448_60::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+/* FP12 prototypes */
+/**	@brief Tests for FP12 equal to zero
+ *
+	@param x FP12 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP12_iszilch(FP12 *x);
+/**	@brief Tests for FP12 equal to unity
+ *
+	@param x FP12 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP12_isunity(FP12 *x);
+/**	@brief Copy FP12 to another FP12
+ *
+	@param x FP12 instance, on exit = y
+	@param y FP12 instance to be copied
+ */
+extern void FP12_copy(FP12 *x, FP12 *y);
+/**	@brief Set FP12 to unity
+ *
+	@param x FP12 instance to be set to one
+ */
+extern void FP12_one(FP12 *x);
+
+/**	@brief Set FP12 to zero
+ *
+	@param x FP12 instance to be set to zero
+ */
+extern void FP12_zero(FP12 *x);
+
+/**	@brief Tests for equality of two FP12s
+ *
+	@param x FP12 instance to be compared
+	@param y FP12 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP12_equals(FP12 *x, FP12 *y);
+/**	@brief Conjugation of FP12
+ *
+	If y=(a,b,c) (where a,b,c are its three FP4 components) on exit x=(conj(a),-conj(b),conj(c))
+	@param x FP12 instance, on exit = conj(y)
+	@param y FP12 instance
+ */
+extern void FP12_conj(FP12 *x, FP12 *y);
+/**	@brief Initialise FP12 from single FP4
+ *
+	Sets first FP4 component of an FP12, other components set to zero
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP4
+ */
+extern void FP12_from_FP4(FP12 *x, FP4 *a);
+/**	@brief Initialise FP12 from three FP4s
+ *
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP12
+	@param b FP4 to form second part of FP12
+	@param c FP4 to form third part of FP12
+ */
+extern void FP12_from_FP4s(FP12 *x, FP4 *a, FP4* b, FP4 *c);
+/**	@brief Fast Squaring of an FP12 in "unitary" form
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP4 instance, must be unitary
+ */
+extern void FP12_usqr(FP12 *x, FP12 *y);
+/**	@brief Squaring an FP12
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP12 instance
+ */
+extern void FP12_sqr(FP12 *x, FP12 *y);
+/**	@brief Fast multiplication of two sparse FP12s that arises from ATE pairing line functions
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_smul(FP12 *x, FP12 *y);
+
+/**	@brief Fast multiplication of what may be sparse multiplicands
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_ssmul(FP12 *x, FP12 *y);
+
+
+/**	@brief Full unconditional Multiplication of two FP12s
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, the multiplier
+ */
+extern void FP12_mul(FP12 *x, FP12 *y);
+
+/**	@brief Inverting an FP12
+ *
+	@param x FP12 instance, on exit = 1/y
+	@param y FP12 instance
+	@param t D_TYPE or M_TYPE twist
+ */
+extern void FP12_inv(FP12 *x, FP12 *y);
+/**	@brief Raises an FP12 to the power of a BIG
+ *
+	@param r FP12 instance, on exit = y^b
+	@param x FP12 instance
+	@param b BIG number
+ */
+extern void FP12_pow(FP12 *r, FP12 *x, B448_60::BIG b);
+/**	@brief Raises an FP12 instance x to a small integer power, side-channel resistant
+ *
+	@param x FP12 instance, on exit = x^i
+	@param i small integer exponent
+	@param b maximum number of bits in exponent
+ */
+extern void FP12_pinpow(FP12 *x, int i, int b);
+
+/**	@brief Raises an FP12 instance x to a BIG power, compressed to FP4
+ *
+	@param c FP4 instance, on exit = x^(e mod r) as FP4
+	@param x FP12 input
+	@param e BIG exponent
+	@param r BIG group order
+ */
+extern void FP12_compow(FP4 *c, FP12 *x, B448_60::BIG e, B448_60::BIG r);
+
+/**	@brief Calculate x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3], side-channel resistant
+ *
+	@param r FP12 instance, on exit = x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3]
+	@param x FP12 array with 4 FP12s
+	@param b BIG array of 4 exponents
+ */
+extern void FP12_pow4(FP12 *r, FP12 *x, B448_60::BIG *b);
+/**	@brief Raises an FP12 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP12 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP12_frob(FP12 *x, FP2 *f);
+/**	@brief Reduces all components of possibly unreduced FP12 mod Modulus
+ *
+	@param x FP12 instance, on exit reduced mod Modulus
+ */
+extern void FP12_reduce(FP12 *x);
+/**	@brief Normalises the components of an FP12
+ *
+	@param x FP12 instance to be normalised
+ */
+extern void FP12_norm(FP12 *x);
+/**	@brief Formats and outputs an FP12 to the console
+ *
+	@param x FP12 instance to be printed
+ */
+extern void FP12_output(FP12 *x);
+/**	@brief Formats and outputs an FP12 instance to an octet string
+ *
+	Serializes the components of an FP12 to big-endian base 256 form.
+	@param S output octet string
+	@param x FP12 instance to be converted to an octet string
+ */
+extern void FP12_toOctet(octet *S, FP12 *x);
+/**	@brief Creates an FP12 instance from an octet string
+ *
+	De-serializes the components of an FP12 to create an FP12 from big-endian base 256 components.
+	@param x FP12 instance to be created from an octet string
+	@param S input octet string
+
+ */
+extern void FP12_fromOctet(FP12 *x, octet *S);
+/**	@brief Calculate the trace of an FP12
+ *
+	@param t FP4 trace of x, on exit = tr(x)
+	@param x FP12 instance
+
+ */
+extern void FP12_trace(FP4 *t, FP12 *x);
+
+/**	@brief Conditional copy of FP12 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP12 instance, set to y if s!=0
+	@param y another FP12 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP12_cmove(FP12 *x, FP12 *y, int s);
+
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp12_BLS12461.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp12_BLS12461.h
new file mode 100644
index 0000000..7717d3f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp12_BLS12461.h
@@ -0,0 +1,230 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP12_BLS12461_H
+#define FP12_BLS12461_H
+
+#include "fp4_BLS12461.h"
+
+using namespace core;
+
+namespace BLS12461 {
+/**
+	@brief FP12 Structure - towered over three FP4
+*/
+
+typedef struct
+{
+    FP4 a; /**< first part of FP12 */
+    FP4 b; /**< second part of FP12 */
+    FP4 c; /**< third part of FP12 */
+    int type;
+} FP12;
+
+extern const B464_60::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B464_60::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+/* FP12 prototypes */
+/**	@brief Tests for FP12 equal to zero
+ *
+	@param x FP12 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP12_iszilch(FP12 *x);
+/**	@brief Tests for FP12 equal to unity
+ *
+	@param x FP12 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP12_isunity(FP12 *x);
+/**	@brief Copy FP12 to another FP12
+ *
+	@param x FP12 instance, on exit = y
+	@param y FP12 instance to be copied
+ */
+extern void FP12_copy(FP12 *x, FP12 *y);
+/**	@brief Set FP12 to unity
+ *
+	@param x FP12 instance to be set to one
+ */
+extern void FP12_one(FP12 *x);
+
+/**	@brief Set FP12 to zero
+ *
+	@param x FP12 instance to be set to zero
+ */
+extern void FP12_zero(FP12 *x);
+
+/**	@brief Tests for equality of two FP12s
+ *
+	@param x FP12 instance to be compared
+	@param y FP12 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP12_equals(FP12 *x, FP12 *y);
+/**	@brief Conjugation of FP12
+ *
+	If y=(a,b,c) (where a,b,c are its three FP4 components) on exit x=(conj(a),-conj(b),conj(c))
+	@param x FP12 instance, on exit = conj(y)
+	@param y FP12 instance
+ */
+extern void FP12_conj(FP12 *x, FP12 *y);
+/**	@brief Initialise FP12 from single FP4
+ *
+	Sets first FP4 component of an FP12, other components set to zero
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP4
+ */
+extern void FP12_from_FP4(FP12 *x, FP4 *a);
+/**	@brief Initialise FP12 from three FP4s
+ *
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP12
+	@param b FP4 to form second part of FP12
+	@param c FP4 to form third part of FP12
+ */
+extern void FP12_from_FP4s(FP12 *x, FP4 *a, FP4* b, FP4 *c);
+/**	@brief Fast Squaring of an FP12 in "unitary" form
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP4 instance, must be unitary
+ */
+extern void FP12_usqr(FP12 *x, FP12 *y);
+/**	@brief Squaring an FP12
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP12 instance
+ */
+extern void FP12_sqr(FP12 *x, FP12 *y);
+/**	@brief Fast multiplication of two sparse FP12s that arises from ATE pairing line functions
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_smul(FP12 *x, FP12 *y);
+
+/**	@brief Fast multiplication of what may be sparse multiplicands
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_ssmul(FP12 *x, FP12 *y);
+
+
+/**	@brief Full unconditional Multiplication of two FP12s
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, the multiplier
+ */
+extern void FP12_mul(FP12 *x, FP12 *y);
+
+/**	@brief Inverting an FP12
+ *
+	@param x FP12 instance, on exit = 1/y
+	@param y FP12 instance
+	@param t D_TYPE or M_TYPE twist
+ */
+extern void FP12_inv(FP12 *x, FP12 *y);
+/**	@brief Raises an FP12 to the power of a BIG
+ *
+	@param r FP12 instance, on exit = y^b
+	@param x FP12 instance
+	@param b BIG number
+ */
+extern void FP12_pow(FP12 *r, FP12 *x, B464_60::BIG b);
+/**	@brief Raises an FP12 instance x to a small integer power, side-channel resistant
+ *
+	@param x FP12 instance, on exit = x^i
+	@param i small integer exponent
+	@param b maximum number of bits in exponent
+ */
+extern void FP12_pinpow(FP12 *x, int i, int b);
+
+/**	@brief Raises an FP12 instance x to a BIG power, compressed to FP4
+ *
+	@param c FP4 instance, on exit = x^(e mod r) as FP4
+	@param x FP12 input
+	@param e BIG exponent
+	@param r BIG group order
+ */
+extern void FP12_compow(FP4 *c, FP12 *x, B464_60::BIG e, B464_60::BIG r);
+
+/**	@brief Calculate x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3], side-channel resistant
+ *
+	@param r FP12 instance, on exit = x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3]
+	@param x FP12 array with 4 FP12s
+	@param b BIG array of 4 exponents
+ */
+extern void FP12_pow4(FP12 *r, FP12 *x, B464_60::BIG *b);
+/**	@brief Raises an FP12 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP12 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP12_frob(FP12 *x, FP2 *f);
+/**	@brief Reduces all components of possibly unreduced FP12 mod Modulus
+ *
+	@param x FP12 instance, on exit reduced mod Modulus
+ */
+extern void FP12_reduce(FP12 *x);
+/**	@brief Normalises the components of an FP12
+ *
+	@param x FP12 instance to be normalised
+ */
+extern void FP12_norm(FP12 *x);
+/**	@brief Formats and outputs an FP12 to the console
+ *
+	@param x FP12 instance to be printed
+ */
+extern void FP12_output(FP12 *x);
+/**	@brief Formats and outputs an FP12 instance to an octet string
+ *
+	Serializes the components of an FP12 to big-endian base 256 form.
+	@param S output octet string
+	@param x FP12 instance to be converted to an octet string
+ */
+extern void FP12_toOctet(octet *S, FP12 *x);
+/**	@brief Creates an FP12 instance from an octet string
+ *
+	De-serializes the components of an FP12 to create an FP12 from big-endian base 256 components.
+	@param x FP12 instance to be created from an octet string
+	@param S input octet string
+
+ */
+extern void FP12_fromOctet(FP12 *x, octet *S);
+/**	@brief Calculate the trace of an FP12
+ *
+	@param t FP4 trace of x, on exit = tr(x)
+	@param x FP12 instance
+
+ */
+extern void FP12_trace(FP4 *t, FP12 *x);
+
+/**	@brief Conditional copy of FP12 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP12 instance, set to y if s!=0
+	@param y another FP12 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP12_cmove(FP12 *x, FP12 *y, int s);
+
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp12_BN158.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp12_BN158.h
new file mode 100644
index 0000000..aa89990
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp12_BN158.h
@@ -0,0 +1,230 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP12_BN158_H
+#define FP12_BN158_H
+
+#include "fp4_BN158.h"
+
+using namespace core;
+
+namespace BN158 {
+/**
+	@brief FP12 Structure - towered over three FP4
+*/
+
+typedef struct
+{
+    FP4 a; /**< first part of FP12 */
+    FP4 b; /**< second part of FP12 */
+    FP4 c; /**< third part of FP12 */
+    int type;
+} FP12;
+
+extern const B160_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B160_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+/* FP12 prototypes */
+/**	@brief Tests for FP12 equal to zero
+ *
+	@param x FP12 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP12_iszilch(FP12 *x);
+/**	@brief Tests for FP12 equal to unity
+ *
+	@param x FP12 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP12_isunity(FP12 *x);
+/**	@brief Copy FP12 to another FP12
+ *
+	@param x FP12 instance, on exit = y
+	@param y FP12 instance to be copied
+ */
+extern void FP12_copy(FP12 *x, FP12 *y);
+/**	@brief Set FP12 to unity
+ *
+	@param x FP12 instance to be set to one
+ */
+extern void FP12_one(FP12 *x);
+
+/**	@brief Set FP12 to zero
+ *
+	@param x FP12 instance to be set to zero
+ */
+extern void FP12_zero(FP12 *x);
+
+/**	@brief Tests for equality of two FP12s
+ *
+	@param x FP12 instance to be compared
+	@param y FP12 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP12_equals(FP12 *x, FP12 *y);
+/**	@brief Conjugation of FP12
+ *
+	If y=(a,b,c) (where a,b,c are its three FP4 components) on exit x=(conj(a),-conj(b),conj(c))
+	@param x FP12 instance, on exit = conj(y)
+	@param y FP12 instance
+ */
+extern void FP12_conj(FP12 *x, FP12 *y);
+/**	@brief Initialise FP12 from single FP4
+ *
+	Sets first FP4 component of an FP12, other components set to zero
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP4
+ */
+extern void FP12_from_FP4(FP12 *x, FP4 *a);
+/**	@brief Initialise FP12 from three FP4s
+ *
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP12
+	@param b FP4 to form second part of FP12
+	@param c FP4 to form third part of FP12
+ */
+extern void FP12_from_FP4s(FP12 *x, FP4 *a, FP4* b, FP4 *c);
+/**	@brief Fast Squaring of an FP12 in "unitary" form
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP4 instance, must be unitary
+ */
+extern void FP12_usqr(FP12 *x, FP12 *y);
+/**	@brief Squaring an FP12
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP12 instance
+ */
+extern void FP12_sqr(FP12 *x, FP12 *y);
+/**	@brief Fast multiplication of two sparse FP12s that arises from ATE pairing line functions
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_smul(FP12 *x, FP12 *y);
+
+/**	@brief Fast multiplication of what may be sparse multiplicands
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_ssmul(FP12 *x, FP12 *y);
+
+
+/**	@brief Full unconditional Multiplication of two FP12s
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, the multiplier
+ */
+extern void FP12_mul(FP12 *x, FP12 *y);
+
+/**	@brief Inverting an FP12
+ *
+	@param x FP12 instance, on exit = 1/y
+	@param y FP12 instance
+	@param t D_TYPE or M_TYPE twist
+ */
+extern void FP12_inv(FP12 *x, FP12 *y);
+/**	@brief Raises an FP12 to the power of a BIG
+ *
+	@param r FP12 instance, on exit = y^b
+	@param x FP12 instance
+	@param b BIG number
+ */
+extern void FP12_pow(FP12 *r, FP12 *x, B160_56::BIG b);
+/**	@brief Raises an FP12 instance x to a small integer power, side-channel resistant
+ *
+	@param x FP12 instance, on exit = x^i
+	@param i small integer exponent
+	@param b maximum number of bits in exponent
+ */
+extern void FP12_pinpow(FP12 *x, int i, int b);
+
+/**	@brief Raises an FP12 instance x to a BIG power, compressed to FP4
+ *
+	@param c FP4 instance, on exit = x^(e mod r) as FP4
+	@param x FP12 input
+	@param e BIG exponent
+	@param r BIG group order
+ */
+extern void FP12_compow(FP4 *c, FP12 *x, B160_56::BIG e, B160_56::BIG r);
+
+/**	@brief Calculate x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3], side-channel resistant
+ *
+	@param r FP12 instance, on exit = x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3]
+	@param x FP12 array with 4 FP12s
+	@param b BIG array of 4 exponents
+ */
+extern void FP12_pow4(FP12 *r, FP12 *x, B160_56::BIG *b);
+/**	@brief Raises an FP12 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP12 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP12_frob(FP12 *x, FP2 *f);
+/**	@brief Reduces all components of possibly unreduced FP12 mod Modulus
+ *
+	@param x FP12 instance, on exit reduced mod Modulus
+ */
+extern void FP12_reduce(FP12 *x);
+/**	@brief Normalises the components of an FP12
+ *
+	@param x FP12 instance to be normalised
+ */
+extern void FP12_norm(FP12 *x);
+/**	@brief Formats and outputs an FP12 to the console
+ *
+	@param x FP12 instance to be printed
+ */
+extern void FP12_output(FP12 *x);
+/**	@brief Formats and outputs an FP12 instance to an octet string
+ *
+	Serializes the components of an FP12 to big-endian base 256 form.
+	@param S output octet string
+	@param x FP12 instance to be converted to an octet string
+ */
+extern void FP12_toOctet(octet *S, FP12 *x);
+/**	@brief Creates an FP12 instance from an octet string
+ *
+	De-serializes the components of an FP12 to create an FP12 from big-endian base 256 components.
+	@param x FP12 instance to be created from an octet string
+	@param S input octet string
+
+ */
+extern void FP12_fromOctet(FP12 *x, octet *S);
+/**	@brief Calculate the trace of an FP12
+ *
+	@param t FP4 trace of x, on exit = tr(x)
+	@param x FP12 instance
+
+ */
+extern void FP12_trace(FP4 *t, FP12 *x);
+
+/**	@brief Conditional copy of FP12 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP12 instance, set to y if s!=0
+	@param y another FP12 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP12_cmove(FP12 *x, FP12 *y, int s);
+
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp12_BN254.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp12_BN254.h
new file mode 100644
index 0000000..15a03d8
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp12_BN254.h
@@ -0,0 +1,230 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP12_BN254_H
+#define FP12_BN254_H
+
+#include "fp4_BN254.h"
+
+using namespace core;
+
+namespace BN254 {
+/**
+	@brief FP12 Structure - towered over three FP4
+*/
+
+typedef struct
+{
+    FP4 a; /**< first part of FP12 */
+    FP4 b; /**< second part of FP12 */
+    FP4 c; /**< third part of FP12 */
+    int type;
+} FP12;
+
+extern const B256_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+/* FP12 prototypes */
+/**	@brief Tests for FP12 equal to zero
+ *
+	@param x FP12 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP12_iszilch(FP12 *x);
+/**	@brief Tests for FP12 equal to unity
+ *
+	@param x FP12 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP12_isunity(FP12 *x);
+/**	@brief Copy FP12 to another FP12
+ *
+	@param x FP12 instance, on exit = y
+	@param y FP12 instance to be copied
+ */
+extern void FP12_copy(FP12 *x, FP12 *y);
+/**	@brief Set FP12 to unity
+ *
+	@param x FP12 instance to be set to one
+ */
+extern void FP12_one(FP12 *x);
+
+/**	@brief Set FP12 to zero
+ *
+	@param x FP12 instance to be set to zero
+ */
+extern void FP12_zero(FP12 *x);
+
+/**	@brief Tests for equality of two FP12s
+ *
+	@param x FP12 instance to be compared
+	@param y FP12 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP12_equals(FP12 *x, FP12 *y);
+/**	@brief Conjugation of FP12
+ *
+	If y=(a,b,c) (where a,b,c are its three FP4 components) on exit x=(conj(a),-conj(b),conj(c))
+	@param x FP12 instance, on exit = conj(y)
+	@param y FP12 instance
+ */
+extern void FP12_conj(FP12 *x, FP12 *y);
+/**	@brief Initialise FP12 from single FP4
+ *
+	Sets first FP4 component of an FP12, other components set to zero
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP4
+ */
+extern void FP12_from_FP4(FP12 *x, FP4 *a);
+/**	@brief Initialise FP12 from three FP4s
+ *
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP12
+	@param b FP4 to form second part of FP12
+	@param c FP4 to form third part of FP12
+ */
+extern void FP12_from_FP4s(FP12 *x, FP4 *a, FP4* b, FP4 *c);
+/**	@brief Fast Squaring of an FP12 in "unitary" form
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP4 instance, must be unitary
+ */
+extern void FP12_usqr(FP12 *x, FP12 *y);
+/**	@brief Squaring an FP12
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP12 instance
+ */
+extern void FP12_sqr(FP12 *x, FP12 *y);
+/**	@brief Fast multiplication of two sparse FP12s that arises from ATE pairing line functions
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_smul(FP12 *x, FP12 *y);
+
+/**	@brief Fast multiplication of what may be sparse multiplicands
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_ssmul(FP12 *x, FP12 *y);
+
+
+/**	@brief Full unconditional Multiplication of two FP12s
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, the multiplier
+ */
+extern void FP12_mul(FP12 *x, FP12 *y);
+
+/**	@brief Inverting an FP12
+ *
+	@param x FP12 instance, on exit = 1/y
+	@param y FP12 instance
+	@param t D_TYPE or M_TYPE twist
+ */
+extern void FP12_inv(FP12 *x, FP12 *y);
+/**	@brief Raises an FP12 to the power of a BIG
+ *
+	@param r FP12 instance, on exit = y^b
+	@param x FP12 instance
+	@param b BIG number
+ */
+extern void FP12_pow(FP12 *r, FP12 *x, B256_56::BIG b);
+/**	@brief Raises an FP12 instance x to a small integer power, side-channel resistant
+ *
+	@param x FP12 instance, on exit = x^i
+	@param i small integer exponent
+	@param b maximum number of bits in exponent
+ */
+extern void FP12_pinpow(FP12 *x, int i, int b);
+
+/**	@brief Raises an FP12 instance x to a BIG power, compressed to FP4
+ *
+	@param c FP4 instance, on exit = x^(e mod r) as FP4
+	@param x FP12 input
+	@param e BIG exponent
+	@param r BIG group order
+ */
+extern void FP12_compow(FP4 *c, FP12 *x, B256_56::BIG e, B256_56::BIG r);
+
+/**	@brief Calculate x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3], side-channel resistant
+ *
+	@param r FP12 instance, on exit = x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3]
+	@param x FP12 array with 4 FP12s
+	@param b BIG array of 4 exponents
+ */
+extern void FP12_pow4(FP12 *r, FP12 *x, B256_56::BIG *b);
+/**	@brief Raises an FP12 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP12 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP12_frob(FP12 *x, FP2 *f);
+/**	@brief Reduces all components of possibly unreduced FP12 mod Modulus
+ *
+	@param x FP12 instance, on exit reduced mod Modulus
+ */
+extern void FP12_reduce(FP12 *x);
+/**	@brief Normalises the components of an FP12
+ *
+	@param x FP12 instance to be normalised
+ */
+extern void FP12_norm(FP12 *x);
+/**	@brief Formats and outputs an FP12 to the console
+ *
+	@param x FP12 instance to be printed
+ */
+extern void FP12_output(FP12 *x);
+/**	@brief Formats and outputs an FP12 instance to an octet string
+ *
+	Serializes the components of an FP12 to big-endian base 256 form.
+	@param S output octet string
+	@param x FP12 instance to be converted to an octet string
+ */
+extern void FP12_toOctet(octet *S, FP12 *x);
+/**	@brief Creates an FP12 instance from an octet string
+ *
+	De-serializes the components of an FP12 to create an FP12 from big-endian base 256 components.
+	@param x FP12 instance to be created from an octet string
+	@param S input octet string
+
+ */
+extern void FP12_fromOctet(FP12 *x, octet *S);
+/**	@brief Calculate the trace of an FP12
+ *
+	@param t FP4 trace of x, on exit = tr(x)
+	@param x FP12 instance
+
+ */
+extern void FP12_trace(FP4 *t, FP12 *x);
+
+/**	@brief Conditional copy of FP12 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP12 instance, set to y if s!=0
+	@param y another FP12 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP12_cmove(FP12 *x, FP12 *y, int s);
+
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp12_BN254CX.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp12_BN254CX.h
new file mode 100644
index 0000000..f795f5b
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp12_BN254CX.h
@@ -0,0 +1,230 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP12_BN254CX_H
+#define FP12_BN254CX_H
+
+#include "fp4_BN254CX.h"
+
+using namespace core;
+
+namespace BN254CX {
+/**
+	@brief FP12 Structure - towered over three FP4
+*/
+
+typedef struct
+{
+    FP4 a; /**< first part of FP12 */
+    FP4 b; /**< second part of FP12 */
+    FP4 c; /**< third part of FP12 */
+    int type;
+} FP12;
+
+extern const B256_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+/* FP12 prototypes */
+/**	@brief Tests for FP12 equal to zero
+ *
+	@param x FP12 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP12_iszilch(FP12 *x);
+/**	@brief Tests for FP12 equal to unity
+ *
+	@param x FP12 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP12_isunity(FP12 *x);
+/**	@brief Copy FP12 to another FP12
+ *
+	@param x FP12 instance, on exit = y
+	@param y FP12 instance to be copied
+ */
+extern void FP12_copy(FP12 *x, FP12 *y);
+/**	@brief Set FP12 to unity
+ *
+	@param x FP12 instance to be set to one
+ */
+extern void FP12_one(FP12 *x);
+
+/**	@brief Set FP12 to zero
+ *
+	@param x FP12 instance to be set to zero
+ */
+extern void FP12_zero(FP12 *x);
+
+/**	@brief Tests for equality of two FP12s
+ *
+	@param x FP12 instance to be compared
+	@param y FP12 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP12_equals(FP12 *x, FP12 *y);
+/**	@brief Conjugation of FP12
+ *
+	If y=(a,b,c) (where a,b,c are its three FP4 components) on exit x=(conj(a),-conj(b),conj(c))
+	@param x FP12 instance, on exit = conj(y)
+	@param y FP12 instance
+ */
+extern void FP12_conj(FP12 *x, FP12 *y);
+/**	@brief Initialise FP12 from single FP4
+ *
+	Sets first FP4 component of an FP12, other components set to zero
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP4
+ */
+extern void FP12_from_FP4(FP12 *x, FP4 *a);
+/**	@brief Initialise FP12 from three FP4s
+ *
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP12
+	@param b FP4 to form second part of FP12
+	@param c FP4 to form third part of FP12
+ */
+extern void FP12_from_FP4s(FP12 *x, FP4 *a, FP4* b, FP4 *c);
+/**	@brief Fast Squaring of an FP12 in "unitary" form
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP4 instance, must be unitary
+ */
+extern void FP12_usqr(FP12 *x, FP12 *y);
+/**	@brief Squaring an FP12
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP12 instance
+ */
+extern void FP12_sqr(FP12 *x, FP12 *y);
+/**	@brief Fast multiplication of two sparse FP12s that arises from ATE pairing line functions
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_smul(FP12 *x, FP12 *y);
+
+/**	@brief Fast multiplication of what may be sparse multiplicands
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_ssmul(FP12 *x, FP12 *y);
+
+
+/**	@brief Full unconditional Multiplication of two FP12s
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, the multiplier
+ */
+extern void FP12_mul(FP12 *x, FP12 *y);
+
+/**	@brief Inverting an FP12
+ *
+	@param x FP12 instance, on exit = 1/y
+	@param y FP12 instance
+	@param t D_TYPE or M_TYPE twist
+ */
+extern void FP12_inv(FP12 *x, FP12 *y);
+/**	@brief Raises an FP12 to the power of a BIG
+ *
+	@param r FP12 instance, on exit = y^b
+	@param x FP12 instance
+	@param b BIG number
+ */
+extern void FP12_pow(FP12 *r, FP12 *x, B256_56::BIG b);
+/**	@brief Raises an FP12 instance x to a small integer power, side-channel resistant
+ *
+	@param x FP12 instance, on exit = x^i
+	@param i small integer exponent
+	@param b maximum number of bits in exponent
+ */
+extern void FP12_pinpow(FP12 *x, int i, int b);
+
+/**	@brief Raises an FP12 instance x to a BIG power, compressed to FP4
+ *
+	@param c FP4 instance, on exit = x^(e mod r) as FP4
+	@param x FP12 input
+	@param e BIG exponent
+	@param r BIG group order
+ */
+extern void FP12_compow(FP4 *c, FP12 *x, B256_56::BIG e, B256_56::BIG r);
+
+/**	@brief Calculate x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3], side-channel resistant
+ *
+	@param r FP12 instance, on exit = x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3]
+	@param x FP12 array with 4 FP12s
+	@param b BIG array of 4 exponents
+ */
+extern void FP12_pow4(FP12 *r, FP12 *x, B256_56::BIG *b);
+/**	@brief Raises an FP12 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP12 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP12_frob(FP12 *x, FP2 *f);
+/**	@brief Reduces all components of possibly unreduced FP12 mod Modulus
+ *
+	@param x FP12 instance, on exit reduced mod Modulus
+ */
+extern void FP12_reduce(FP12 *x);
+/**	@brief Normalises the components of an FP12
+ *
+	@param x FP12 instance to be normalised
+ */
+extern void FP12_norm(FP12 *x);
+/**	@brief Formats and outputs an FP12 to the console
+ *
+	@param x FP12 instance to be printed
+ */
+extern void FP12_output(FP12 *x);
+/**	@brief Formats and outputs an FP12 instance to an octet string
+ *
+	Serializes the components of an FP12 to big-endian base 256 form.
+	@param S output octet string
+	@param x FP12 instance to be converted to an octet string
+ */
+extern void FP12_toOctet(octet *S, FP12 *x);
+/**	@brief Creates an FP12 instance from an octet string
+ *
+	De-serializes the components of an FP12 to create an FP12 from big-endian base 256 components.
+	@param x FP12 instance to be created from an octet string
+	@param S input octet string
+
+ */
+extern void FP12_fromOctet(FP12 *x, octet *S);
+/**	@brief Calculate the trace of an FP12
+ *
+	@param t FP4 trace of x, on exit = tr(x)
+	@param x FP12 instance
+
+ */
+extern void FP12_trace(FP4 *t, FP12 *x);
+
+/**	@brief Conditional copy of FP12 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP12 instance, set to y if s!=0
+	@param y another FP12 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP12_cmove(FP12 *x, FP12 *y, int s);
+
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp12_BN462.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp12_BN462.h
new file mode 100644
index 0000000..4130fc6
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp12_BN462.h
@@ -0,0 +1,230 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP12_BN462_H
+#define FP12_BN462_H
+
+#include "fp4_BN462.h"
+
+using namespace core;
+
+namespace BN462 {
+/**
+	@brief FP12 Structure - towered over three FP4
+*/
+
+typedef struct
+{
+    FP4 a; /**< first part of FP12 */
+    FP4 b; /**< second part of FP12 */
+    FP4 c; /**< third part of FP12 */
+    int type;
+} FP12;
+
+extern const B464_60::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B464_60::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+/* FP12 prototypes */
+/**	@brief Tests for FP12 equal to zero
+ *
+	@param x FP12 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP12_iszilch(FP12 *x);
+/**	@brief Tests for FP12 equal to unity
+ *
+	@param x FP12 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP12_isunity(FP12 *x);
+/**	@brief Copy FP12 to another FP12
+ *
+	@param x FP12 instance, on exit = y
+	@param y FP12 instance to be copied
+ */
+extern void FP12_copy(FP12 *x, FP12 *y);
+/**	@brief Set FP12 to unity
+ *
+	@param x FP12 instance to be set to one
+ */
+extern void FP12_one(FP12 *x);
+
+/**	@brief Set FP12 to zero
+ *
+	@param x FP12 instance to be set to zero
+ */
+extern void FP12_zero(FP12 *x);
+
+/**	@brief Tests for equality of two FP12s
+ *
+	@param x FP12 instance to be compared
+	@param y FP12 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP12_equals(FP12 *x, FP12 *y);
+/**	@brief Conjugation of FP12
+ *
+	If y=(a,b,c) (where a,b,c are its three FP4 components) on exit x=(conj(a),-conj(b),conj(c))
+	@param x FP12 instance, on exit = conj(y)
+	@param y FP12 instance
+ */
+extern void FP12_conj(FP12 *x, FP12 *y);
+/**	@brief Initialise FP12 from single FP4
+ *
+	Sets first FP4 component of an FP12, other components set to zero
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP4
+ */
+extern void FP12_from_FP4(FP12 *x, FP4 *a);
+/**	@brief Initialise FP12 from three FP4s
+ *
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP12
+	@param b FP4 to form second part of FP12
+	@param c FP4 to form third part of FP12
+ */
+extern void FP12_from_FP4s(FP12 *x, FP4 *a, FP4* b, FP4 *c);
+/**	@brief Fast Squaring of an FP12 in "unitary" form
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP4 instance, must be unitary
+ */
+extern void FP12_usqr(FP12 *x, FP12 *y);
+/**	@brief Squaring an FP12
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP12 instance
+ */
+extern void FP12_sqr(FP12 *x, FP12 *y);
+/**	@brief Fast multiplication of two sparse FP12s that arises from ATE pairing line functions
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_smul(FP12 *x, FP12 *y);
+
+/**	@brief Fast multiplication of what may be sparse multiplicands
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_ssmul(FP12 *x, FP12 *y);
+
+
+/**	@brief Full unconditional Multiplication of two FP12s
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, the multiplier
+ */
+extern void FP12_mul(FP12 *x, FP12 *y);
+
+/**	@brief Inverting an FP12
+ *
+	@param x FP12 instance, on exit = 1/y
+	@param y FP12 instance
+	@param t D_TYPE or M_TYPE twist
+ */
+extern void FP12_inv(FP12 *x, FP12 *y);
+/**	@brief Raises an FP12 to the power of a BIG
+ *
+	@param r FP12 instance, on exit = y^b
+	@param x FP12 instance
+	@param b BIG number
+ */
+extern void FP12_pow(FP12 *r, FP12 *x, B464_60::BIG b);
+/**	@brief Raises an FP12 instance x to a small integer power, side-channel resistant
+ *
+	@param x FP12 instance, on exit = x^i
+	@param i small integer exponent
+	@param b maximum number of bits in exponent
+ */
+extern void FP12_pinpow(FP12 *x, int i, int b);
+
+/**	@brief Raises an FP12 instance x to a BIG power, compressed to FP4
+ *
+	@param c FP4 instance, on exit = x^(e mod r) as FP4
+	@param x FP12 input
+	@param e BIG exponent
+	@param r BIG group order
+ */
+extern void FP12_compow(FP4 *c, FP12 *x, B464_60::BIG e, B464_60::BIG r);
+
+/**	@brief Calculate x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3], side-channel resistant
+ *
+	@param r FP12 instance, on exit = x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3]
+	@param x FP12 array with 4 FP12s
+	@param b BIG array of 4 exponents
+ */
+extern void FP12_pow4(FP12 *r, FP12 *x, B464_60::BIG *b);
+/**	@brief Raises an FP12 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP12 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP12_frob(FP12 *x, FP2 *f);
+/**	@brief Reduces all components of possibly unreduced FP12 mod Modulus
+ *
+	@param x FP12 instance, on exit reduced mod Modulus
+ */
+extern void FP12_reduce(FP12 *x);
+/**	@brief Normalises the components of an FP12
+ *
+	@param x FP12 instance to be normalised
+ */
+extern void FP12_norm(FP12 *x);
+/**	@brief Formats and outputs an FP12 to the console
+ *
+	@param x FP12 instance to be printed
+ */
+extern void FP12_output(FP12 *x);
+/**	@brief Formats and outputs an FP12 instance to an octet string
+ *
+	Serializes the components of an FP12 to big-endian base 256 form.
+	@param S output octet string
+	@param x FP12 instance to be converted to an octet string
+ */
+extern void FP12_toOctet(octet *S, FP12 *x);
+/**	@brief Creates an FP12 instance from an octet string
+ *
+	De-serializes the components of an FP12 to create an FP12 from big-endian base 256 components.
+	@param x FP12 instance to be created from an octet string
+	@param S input octet string
+
+ */
+extern void FP12_fromOctet(FP12 *x, octet *S);
+/**	@brief Calculate the trace of an FP12
+ *
+	@param t FP4 trace of x, on exit = tr(x)
+	@param x FP12 instance
+
+ */
+extern void FP12_trace(FP4 *t, FP12 *x);
+
+/**	@brief Conditional copy of FP12 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP12 instance, set to y if s!=0
+	@param y another FP12 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP12_cmove(FP12 *x, FP12 *y, int s);
+
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp12_FP256BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp12_FP256BN.h
new file mode 100644
index 0000000..621f981
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp12_FP256BN.h
@@ -0,0 +1,230 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP12_FP256BN_H
+#define FP12_FP256BN_H
+
+#include "fp4_FP256BN.h"
+
+using namespace core;
+
+namespace FP256BN {
+/**
+	@brief FP12 Structure - towered over three FP4
+*/
+
+typedef struct
+{
+    FP4 a; /**< first part of FP12 */
+    FP4 b; /**< second part of FP12 */
+    FP4 c; /**< third part of FP12 */
+    int type;
+} FP12;
+
+extern const B256_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+/* FP12 prototypes */
+/**	@brief Tests for FP12 equal to zero
+ *
+	@param x FP12 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP12_iszilch(FP12 *x);
+/**	@brief Tests for FP12 equal to unity
+ *
+	@param x FP12 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP12_isunity(FP12 *x);
+/**	@brief Copy FP12 to another FP12
+ *
+	@param x FP12 instance, on exit = y
+	@param y FP12 instance to be copied
+ */
+extern void FP12_copy(FP12 *x, FP12 *y);
+/**	@brief Set FP12 to unity
+ *
+	@param x FP12 instance to be set to one
+ */
+extern void FP12_one(FP12 *x);
+
+/**	@brief Set FP12 to zero
+ *
+	@param x FP12 instance to be set to zero
+ */
+extern void FP12_zero(FP12 *x);
+
+/**	@brief Tests for equality of two FP12s
+ *
+	@param x FP12 instance to be compared
+	@param y FP12 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP12_equals(FP12 *x, FP12 *y);
+/**	@brief Conjugation of FP12
+ *
+	If y=(a,b,c) (where a,b,c are its three FP4 components) on exit x=(conj(a),-conj(b),conj(c))
+	@param x FP12 instance, on exit = conj(y)
+	@param y FP12 instance
+ */
+extern void FP12_conj(FP12 *x, FP12 *y);
+/**	@brief Initialise FP12 from single FP4
+ *
+	Sets first FP4 component of an FP12, other components set to zero
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP4
+ */
+extern void FP12_from_FP4(FP12 *x, FP4 *a);
+/**	@brief Initialise FP12 from three FP4s
+ *
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP12
+	@param b FP4 to form second part of FP12
+	@param c FP4 to form third part of FP12
+ */
+extern void FP12_from_FP4s(FP12 *x, FP4 *a, FP4* b, FP4 *c);
+/**	@brief Fast Squaring of an FP12 in "unitary" form
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP4 instance, must be unitary
+ */
+extern void FP12_usqr(FP12 *x, FP12 *y);
+/**	@brief Squaring an FP12
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP12 instance
+ */
+extern void FP12_sqr(FP12 *x, FP12 *y);
+/**	@brief Fast multiplication of two sparse FP12s that arises from ATE pairing line functions
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_smul(FP12 *x, FP12 *y);
+
+/**	@brief Fast multiplication of what may be sparse multiplicands
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_ssmul(FP12 *x, FP12 *y);
+
+
+/**	@brief Full unconditional Multiplication of two FP12s
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, the multiplier
+ */
+extern void FP12_mul(FP12 *x, FP12 *y);
+
+/**	@brief Inverting an FP12
+ *
+	@param x FP12 instance, on exit = 1/y
+	@param y FP12 instance
+	@param t D_TYPE or M_TYPE twist
+ */
+extern void FP12_inv(FP12 *x, FP12 *y);
+/**	@brief Raises an FP12 to the power of a BIG
+ *
+	@param r FP12 instance, on exit = y^b
+	@param x FP12 instance
+	@param b BIG number
+ */
+extern void FP12_pow(FP12 *r, FP12 *x, B256_56::BIG b);
+/**	@brief Raises an FP12 instance x to a small integer power, side-channel resistant
+ *
+	@param x FP12 instance, on exit = x^i
+	@param i small integer exponent
+	@param b maximum number of bits in exponent
+ */
+extern void FP12_pinpow(FP12 *x, int i, int b);
+
+/**	@brief Raises an FP12 instance x to a BIG power, compressed to FP4
+ *
+	@param c FP4 instance, on exit = x^(e mod r) as FP4
+	@param x FP12 input
+	@param e BIG exponent
+	@param r BIG group order
+ */
+extern void FP12_compow(FP4 *c, FP12 *x, B256_56::BIG e, B256_56::BIG r);
+
+/**	@brief Calculate x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3], side-channel resistant
+ *
+	@param r FP12 instance, on exit = x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3]
+	@param x FP12 array with 4 FP12s
+	@param b BIG array of 4 exponents
+ */
+extern void FP12_pow4(FP12 *r, FP12 *x, B256_56::BIG *b);
+/**	@brief Raises an FP12 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP12 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP12_frob(FP12 *x, FP2 *f);
+/**	@brief Reduces all components of possibly unreduced FP12 mod Modulus
+ *
+	@param x FP12 instance, on exit reduced mod Modulus
+ */
+extern void FP12_reduce(FP12 *x);
+/**	@brief Normalises the components of an FP12
+ *
+	@param x FP12 instance to be normalised
+ */
+extern void FP12_norm(FP12 *x);
+/**	@brief Formats and outputs an FP12 to the console
+ *
+	@param x FP12 instance to be printed
+ */
+extern void FP12_output(FP12 *x);
+/**	@brief Formats and outputs an FP12 instance to an octet string
+ *
+	Serializes the components of an FP12 to big-endian base 256 form.
+	@param S output octet string
+	@param x FP12 instance to be converted to an octet string
+ */
+extern void FP12_toOctet(octet *S, FP12 *x);
+/**	@brief Creates an FP12 instance from an octet string
+ *
+	De-serializes the components of an FP12 to create an FP12 from big-endian base 256 components.
+	@param x FP12 instance to be created from an octet string
+	@param S input octet string
+
+ */
+extern void FP12_fromOctet(FP12 *x, octet *S);
+/**	@brief Calculate the trace of an FP12
+ *
+	@param t FP4 trace of x, on exit = tr(x)
+	@param x FP12 instance
+
+ */
+extern void FP12_trace(FP4 *t, FP12 *x);
+
+/**	@brief Conditional copy of FP12 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP12 instance, set to y if s!=0
+	@param y another FP12 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP12_cmove(FP12 *x, FP12 *y, int s);
+
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp12_FP512BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp12_FP512BN.h
new file mode 100644
index 0000000..30c0522
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp12_FP512BN.h
@@ -0,0 +1,230 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP12_FP512BN_H
+#define FP12_FP512BN_H
+
+#include "fp4_FP512BN.h"
+
+using namespace core;
+
+namespace FP512BN {
+/**
+	@brief FP12 Structure - towered over three FP4
+*/
+
+typedef struct
+{
+    FP4 a; /**< first part of FP12 */
+    FP4 b; /**< second part of FP12 */
+    FP4 c; /**< third part of FP12 */
+    int type;
+} FP12;
+
+extern const B512_60::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B512_60::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+/* FP12 prototypes */
+/**	@brief Tests for FP12 equal to zero
+ *
+	@param x FP12 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP12_iszilch(FP12 *x);
+/**	@brief Tests for FP12 equal to unity
+ *
+	@param x FP12 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP12_isunity(FP12 *x);
+/**	@brief Copy FP12 to another FP12
+ *
+	@param x FP12 instance, on exit = y
+	@param y FP12 instance to be copied
+ */
+extern void FP12_copy(FP12 *x, FP12 *y);
+/**	@brief Set FP12 to unity
+ *
+	@param x FP12 instance to be set to one
+ */
+extern void FP12_one(FP12 *x);
+
+/**	@brief Set FP12 to zero
+ *
+	@param x FP12 instance to be set to zero
+ */
+extern void FP12_zero(FP12 *x);
+
+/**	@brief Tests for equality of two FP12s
+ *
+	@param x FP12 instance to be compared
+	@param y FP12 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP12_equals(FP12 *x, FP12 *y);
+/**	@brief Conjugation of FP12
+ *
+	If y=(a,b,c) (where a,b,c are its three FP4 components) on exit x=(conj(a),-conj(b),conj(c))
+	@param x FP12 instance, on exit = conj(y)
+	@param y FP12 instance
+ */
+extern void FP12_conj(FP12 *x, FP12 *y);
+/**	@brief Initialise FP12 from single FP4
+ *
+	Sets first FP4 component of an FP12, other components set to zero
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP4
+ */
+extern void FP12_from_FP4(FP12 *x, FP4 *a);
+/**	@brief Initialise FP12 from three FP4s
+ *
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP12
+	@param b FP4 to form second part of FP12
+	@param c FP4 to form third part of FP12
+ */
+extern void FP12_from_FP4s(FP12 *x, FP4 *a, FP4* b, FP4 *c);
+/**	@brief Fast Squaring of an FP12 in "unitary" form
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP4 instance, must be unitary
+ */
+extern void FP12_usqr(FP12 *x, FP12 *y);
+/**	@brief Squaring an FP12
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP12 instance
+ */
+extern void FP12_sqr(FP12 *x, FP12 *y);
+/**	@brief Fast multiplication of two sparse FP12s that arises from ATE pairing line functions
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_smul(FP12 *x, FP12 *y);
+
+/**	@brief Fast multiplication of what may be sparse multiplicands
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_ssmul(FP12 *x, FP12 *y);
+
+
+/**	@brief Full unconditional Multiplication of two FP12s
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, the multiplier
+ */
+extern void FP12_mul(FP12 *x, FP12 *y);
+
+/**	@brief Inverting an FP12
+ *
+	@param x FP12 instance, on exit = 1/y
+	@param y FP12 instance
+	@param t D_TYPE or M_TYPE twist
+ */
+extern void FP12_inv(FP12 *x, FP12 *y);
+/**	@brief Raises an FP12 to the power of a BIG
+ *
+	@param r FP12 instance, on exit = y^b
+	@param x FP12 instance
+	@param b BIG number
+ */
+extern void FP12_pow(FP12 *r, FP12 *x, B512_60::BIG b);
+/**	@brief Raises an FP12 instance x to a small integer power, side-channel resistant
+ *
+	@param x FP12 instance, on exit = x^i
+	@param i small integer exponent
+	@param b maximum number of bits in exponent
+ */
+extern void FP12_pinpow(FP12 *x, int i, int b);
+
+/**	@brief Raises an FP12 instance x to a BIG power, compressed to FP4
+ *
+	@param c FP4 instance, on exit = x^(e mod r) as FP4
+	@param x FP12 input
+	@param e BIG exponent
+	@param r BIG group order
+ */
+extern void FP12_compow(FP4 *c, FP12 *x, B512_60::BIG e, B512_60::BIG r);
+
+/**	@brief Calculate x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3], side-channel resistant
+ *
+	@param r FP12 instance, on exit = x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3]
+	@param x FP12 array with 4 FP12s
+	@param b BIG array of 4 exponents
+ */
+extern void FP12_pow4(FP12 *r, FP12 *x, B512_60::BIG *b);
+/**	@brief Raises an FP12 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP12 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP12_frob(FP12 *x, FP2 *f);
+/**	@brief Reduces all components of possibly unreduced FP12 mod Modulus
+ *
+	@param x FP12 instance, on exit reduced mod Modulus
+ */
+extern void FP12_reduce(FP12 *x);
+/**	@brief Normalises the components of an FP12
+ *
+	@param x FP12 instance to be normalised
+ */
+extern void FP12_norm(FP12 *x);
+/**	@brief Formats and outputs an FP12 to the console
+ *
+	@param x FP12 instance to be printed
+ */
+extern void FP12_output(FP12 *x);
+/**	@brief Formats and outputs an FP12 instance to an octet string
+ *
+	Serializes the components of an FP12 to big-endian base 256 form.
+	@param S output octet string
+	@param x FP12 instance to be converted to an octet string
+ */
+extern void FP12_toOctet(octet *S, FP12 *x);
+/**	@brief Creates an FP12 instance from an octet string
+ *
+	De-serializes the components of an FP12 to create an FP12 from big-endian base 256 components.
+	@param x FP12 instance to be created from an octet string
+	@param S input octet string
+
+ */
+extern void FP12_fromOctet(FP12 *x, octet *S);
+/**	@brief Calculate the trace of an FP12
+ *
+	@param t FP4 trace of x, on exit = tr(x)
+	@param x FP12 instance
+
+ */
+extern void FP12_trace(FP4 *t, FP12 *x);
+
+/**	@brief Conditional copy of FP12 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP12 instance, set to y if s!=0
+	@param y another FP12 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP12_cmove(FP12 *x, FP12 *y, int s);
+
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp16.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp16.cpp
new file mode 100644
index 0000000..cb257aa
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp16.cpp
@@ -0,0 +1,610 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* CORE Fp^8 functions */
+
+/* FP16 elements are of the form a+ib, where i is sqrt(sqrt(-1+sqrt(-1))) */
+
+#include "fp16_YYY.h"
+
+using namespace XXX;
+
+/* test x==0 ? */
+int YYY::FP16_iszilch(FP16 *x)
+{
+    if (FP8_iszilch(&(x->a)) && FP8_iszilch(&(x->b))) return 1;
+    return 0;
+}
+
+/* test x==1 ? */
+int YYY::FP16_isunity(FP16 *x)
+{
+    if (FP8_isunity(&(x->a)) && FP8_iszilch(&(x->b))) return 1;
+    return 0;
+}
+
+/* test is w real? That is in a+ib test b is zero */
+int YYY::FP16_isreal(FP16 *w)
+{
+    return FP8_iszilch(&(w->b));
+}
+
+/* return 1 if x==y, else 0 */
+int YYY::FP16_equals(FP16 *x, FP16 *y)
+{
+    if (FP8_equals(&(x->a), &(y->a)) && FP8_equals(&(x->b), &(y->b)))
+        return 1;
+    return 0;
+}
+
+
+void YYY::FP16_toBytes(char *b,FP16 *x)
+{
+    FP8_toBytes(b,&(x->b));
+    FP8_toBytes(&b[8*MODBYTES_XXX],&(x->a));
+}
+
+void YYY::FP16_fromBytes(FP16 *x,char *b)
+{
+    FP8_fromBytes(&(x->b),b);
+    FP8_fromBytes(&(x->a),&b[8*MODBYTES_XXX]);
+}
+
+
+/* set FP16 from two FP8s */
+void YYY::FP16_from_FP8s(FP16 *w, FP8 * x, FP8* y)
+{
+    FP8_copy(&(w->a), x);
+    FP8_copy(&(w->b), y);
+}
+
+/* set FP16 from FP8 */
+void YYY::FP16_from_FP8(FP16 *w, FP8 *x)
+{
+    FP8_copy(&(w->a), x);
+    FP8_zero(&(w->b));
+}
+
+/* set high part of FP16 from FP8 */
+void YYY::FP16_from_FP8H(FP16 *w, FP8 *x)
+{
+    FP8_copy(&(w->b), x);
+    FP8_zero(&(w->a));
+}
+
+/* FP16 copy w=x */
+void YYY::FP16_copy(FP16 *w, FP16 *x)
+{
+    if (w == x) return;
+    FP8_copy(&(w->a), &(x->a));
+    FP8_copy(&(w->b), &(x->b));
+}
+
+/* FP16 w=0 */
+void YYY::FP16_zero(FP16 *w)
+{
+    FP8_zero(&(w->a));
+    FP8_zero(&(w->b));
+}
+
+/* FP16 w=1 */
+void YYY::FP16_one(FP16 *w)
+{
+    FP8_one(&(w->a));
+    FP8_zero(&(w->b));
+}
+
+/* Set w=-x */
+void YYY::FP16_neg(FP16 *w, FP16 *x)
+{
+    /* Just one field neg */
+    FP8 m, t;
+    FP16_norm(x);
+    FP8_add(&m, &(x->a), &(x->b));
+    FP8_norm(&m);
+    FP8_neg(&m, &m);
+    FP8_add(&t, &m, &(x->b));
+    FP8_add(&(w->b), &m, &(x->a));
+    FP8_copy(&(w->a), &t);
+    FP16_norm(w);
+}
+
+/* Set w=conj(x) */
+void YYY::FP16_conj(FP16 *w, FP16 *x)
+{
+    FP8_copy(&(w->a), &(x->a));
+    FP8_neg(&(w->b), &(x->b));
+    FP16_norm(w);
+}
+
+/* Set w=-conj(x) */
+void YYY::FP16_nconj(FP16 *w, FP16 *x)
+{
+    FP8_copy(&(w->b), &(x->b));
+    FP8_neg(&(w->a), &(x->a));
+    FP16_norm(w);
+}
+
+/* Set w=x+y */
+void YYY::FP16_add(FP16 *w, FP16 *x, FP16 *y)
+{
+    FP8_add(&(w->a), &(x->a), &(y->a));
+    FP8_add(&(w->b), &(x->b), &(y->b));
+}
+
+/* Set w=x-y */
+/* Input y MUST be normed */
+void YYY::FP16_sub(FP16 *w, FP16 *x, FP16 *y)
+{
+    FP16 my;
+
+    FP16_neg(&my, y);
+    FP16_add(w, x, &my);
+
+}
+
+/* reduce all components of w mod Modulus */
+void YYY::FP16_reduce(FP16 *w)
+{
+    FP8_reduce(&(w->a));
+    FP8_reduce(&(w->b));
+}
+
+/* normalise all elements of w */
+void YYY::FP16_norm(FP16 *w)
+{
+    FP8_norm(&(w->a));
+    FP8_norm(&(w->b));
+}
+
+/* Set w=s*x, where s is FP8 */
+void YYY::FP16_pmul(FP16 *w, FP16 *x, FP8 *s)
+{
+    FP8_mul(&(w->a), &(x->a), s);
+    FP8_mul(&(w->b), &(x->b), s);
+}
+
+/* Set w=s*x, where s is FP2 */
+void YYY::FP16_qmul(FP16 *w, FP16 *x, FP2 *s)
+{
+    FP8_qmul(&(w->a), &(x->a), s);
+    FP8_qmul(&(w->b), &(x->b), s);
+}
+
+/* Set w=s*x, where s is FP */
+void YYY::FP16_tmul(FP16 *w, FP16 *x, FP *s)
+{
+    FP8_tmul(&(w->a), &(x->a), s);
+    FP8_tmul(&(w->b), &(x->b), s);
+}
+
+/* Set w=s*x, where s is int */
+void YYY::FP16_imul(FP16 *w, FP16 *x, int s)
+{
+    FP8_imul(&(w->a), &(x->a), s);
+    FP8_imul(&(w->b), &(x->b), s);
+}
+
+/* Set w=x^2 */
+/* Input MUST be normed  */
+void YYY::FP16_sqr(FP16 *w, FP16 *x)
+{
+    FP8 t1, t2, t3;
+
+    FP8_mul(&t3, &(x->a), &(x->b)); /* norms x */
+    FP8_copy(&t2, &(x->b));
+    FP8_add(&t1, &(x->a), &(x->b));
+    FP8_times_i(&t2);
+
+    FP8_add(&t2, &(x->a), &t2);
+
+    FP8_norm(&t1);  // 2
+    FP8_norm(&t2);  // 2
+
+    FP8_mul(&(w->a), &t1, &t2);
+
+    FP8_copy(&t2, &t3);
+    FP8_times_i(&t2);
+
+    FP8_add(&t2, &t2, &t3);
+
+    FP8_norm(&t2);  // 2
+    FP8_neg(&t2, &t2);
+    FP8_add(&(w->a), &(w->a), &t2); /* a=(a+b)(a+i^2.b)-i^2.ab-ab = a*a+ib*ib */
+    FP8_add(&(w->b), &t3, &t3); /* b=2ab */
+
+    FP16_norm(w);
+}
+
+/* Set w=x*y */
+/* Inputs MUST be normed  */
+void YYY::FP16_mul(FP16 *w, FP16 *x, FP16 *y)
+{
+
+    FP8 t1, t2, t3, t4;
+    FP8_mul(&t1, &(x->a), &(y->a));
+    FP8_mul(&t2, &(x->b), &(y->b));
+
+    FP8_add(&t3, &(y->b), &(y->a));
+    FP8_add(&t4, &(x->b), &(x->a));
+
+    FP8_norm(&t4); // 2
+    FP8_norm(&t3); // 2
+
+    FP8_mul(&t4, &t4, &t3); /* (xa+xb)(ya+yb) */
+    FP8_neg(&t3, &t1); // 1
+    FP8_add(&t4, &t4, &t3); //t4E=3
+    FP8_norm(&t4);
+
+    FP8_neg(&t3, &t2); // 1
+    FP8_add(&(w->b), &t4, &t3); //wbE=3
+
+    FP8_times_i(&t2);
+    FP8_add(&(w->a), &t2, &t1);
+
+    FP16_norm(w);
+}
+
+/* output FP16 in format [a,b] */
+void YYY::FP16_output(FP16 *w)
+{
+    printf("[");
+    FP8_output(&(w->a));
+    printf(",");
+    FP8_output(&(w->b));
+    printf("]");
+}
+
+void YYY::FP16_rawoutput(FP16 *w)
+{
+    printf("[");
+    FP8_rawoutput(&(w->a));
+    printf(",");
+    FP8_rawoutput(&(w->b));
+    printf("]");
+}
+
+/* Set w=1/x */
+void YYY::FP16_inv(FP16 *w, FP16 *x)
+{
+    FP8 t1, t2;
+    FP8_sqr(&t1, &(x->a));
+    FP8_sqr(&t2, &(x->b));
+    FP8_times_i(&t2);
+    FP8_norm(&t2);
+
+    FP8_sub(&t1, &t1, &t2);
+    FP8_norm(&t1);
+
+    FP8_inv(&t1, &t1, NULL);
+
+    FP8_mul(&(w->a), &t1, &(x->a));
+    FP8_neg(&t1, &t1);
+    FP8_norm(&t1);
+    FP8_mul(&(w->b), &t1, &(x->b));
+}
+
+/* w*=i where i = sqrt(sqrt(-1+sqrt(-1))) */
+void YYY::FP16_times_i(FP16 *w)
+{
+    FP8 s, t;
+    FP8_copy(&s, &(w->b));
+    FP8_copy(&t, &(w->a));
+    FP8_times_i(&s);
+    FP8_copy(&(w->a), &s);
+    FP8_copy(&(w->b), &t);
+    FP16_norm(w);
+
+    //FP16_neg(w,w);   // ***
+    //FP16_norm(w);
+}
+
+void YYY::FP16_times_i2(FP16 *w)
+{
+    FP8_times_i(&(w->a));
+    FP8_times_i(&(w->b));
+}
+
+void YYY::FP16_times_i4(FP16 *w)
+{
+    FP8_times_i2(&(w->a));
+    FP8_times_i2(&(w->b));
+}
+
+/* Set w=w^p using Frobenius */
+void YYY::FP16_frob(FP16 *w, FP2 *f)
+{   // f=(i+1)^(p-3)/8
+    FP2 ff;
+    FP2_sqr(&ff, f); // (i+1)^(p-3)/4
+    FP2_norm(&ff);
+
+    FP8_frob(&(w->a), &ff);
+    FP8_frob(&(w->b), &ff);
+
+    FP8_qmul(&(w->b), &(w->b), f); // times (1+i)^(p-3)/8
+    FP8_times_i(&(w->b));       // (i+1)^(p-1)/8
+}
+
+/* Set r=a^b mod m */
+void YYY::FP16_pow(FP16 *r, FP16* a, BIG b)
+{
+    FP16 w;
+    BIG z, zilch;
+    int bt;
+
+    BIG_zero(zilch);
+
+    BIG_copy(z, b);
+    FP16_copy(&w, a);
+    FP16_one(r);
+    BIG_norm(z);
+    while (1)
+    {
+        bt = BIG_parity(z);
+        BIG_shr(z, 1);
+        if (bt) FP16_mul(r, r, &w);
+        if (BIG_comp(z, zilch) == 0) break;
+        FP16_sqr(&w, &w);
+    }
+    FP16_reduce(r);
+}
+
+/* Move b to a if d=1 */
+void YYY::FP16_cmove(FP16 *f, FP16 *g, int d)
+{
+    FP8_cmove(&(f->a), &(g->a), d);
+    FP8_cmove(&(f->b), &(g->b), d);
+}
+
+//#if CURVE_SECURITY_ZZZ == 256
+
+/* XTR xtr_a function */
+/*
+void YYY::FP16_xtr_A(FP16 *r, FP16 *w, FP16 *x, FP16 *y, FP16 *z)
+{
+    FP16 t1, t2;
+
+    FP16_copy(r, x);
+    FP16_sub(&t1, w, y);
+    FP16_norm(&t1);
+    FP16_pmul(&t1, &t1, &(r->a));
+    FP16_add(&t2, w, y);
+    FP16_norm(&t2);
+    FP16_pmul(&t2, &t2, &(r->b));
+    FP16_times_i(&t2);
+
+    FP16_add(r, &t1, &t2);
+    FP16_add(r, r, z);
+
+    FP16_reduce(r);
+}
+*/
+/* XTR xtr_d function */
+/*
+void YYY::FP16_xtr_D(FP16 *r, FP16 *x)
+{
+    FP16 w;
+    FP16_copy(r, x);
+    FP16_conj(&w, r);
+    FP16_add(&w, &w, &w);
+    FP16_sqr(r, r);
+    FP16_norm(&w);
+    FP16_sub(r, r, &w);
+    FP16_reduce(r);    // reduce here as multiple calls trigger automatic reductions
+}
+*/
+
+/* r=x^n using XTR method on traces of FP48s */
+/*
+void YYY::FP16_xtr_pow(FP16 *r, FP16 *x, BIG n)
+{
+    int i, par, nb;
+    BIG v;
+    FP2 w2;
+    FP4 w4;
+    FP8 w8;
+    FP16 t, a, b, c, sf;
+
+    FP16_copy(&sf, x);
+    FP16_norm(&sf);
+    BIG_zero(v);
+    BIG_inc(v, 3);
+    BIG_norm(v);
+    FP2_from_BIG(&w2, v);
+    FP4_from_FP2(&w4, &w2);
+    FP8_from_FP4(&w8, &w4);
+    FP16_from_FP8(&a, &w8);
+
+    FP16_copy(&b, &sf);
+    FP16_xtr_D(&c, &sf);
+
+
+    par = BIG_parity(n);
+    BIG_copy(v, n);
+    BIG_norm(v);
+    BIG_shr(v, 1);
+    if (par == 0)
+    {
+        BIG_dec(v, 1);
+        BIG_norm(v);
+    }
+
+    nb = BIG_nbits(v);
+    for (i = nb - 1; i >= 0; i--)
+    {
+        if (!BIG_bit(v, i))
+        {
+            FP16_copy(&t, &b);
+            FP16_conj(&sf, &sf);
+            FP16_conj(&c, &c);
+            FP16_xtr_A(&b, &a, &b, &sf, &c);
+            FP16_conj(&sf, &sf);
+            FP16_xtr_D(&c, &t);
+            FP16_xtr_D(&a, &a);
+        }
+        else
+        {
+            FP16_conj(&t, &a);
+            FP16_xtr_D(&a, &b);
+            FP16_xtr_A(&b, &c, &b, &sf, &t);
+            FP16_xtr_D(&c, &c);
+        }
+    }
+
+    if (par == 0) FP16_copy(r, &c);
+    else FP16_copy(r, &b);
+    FP16_reduce(r);
+}
+*/
+/* r=ck^a.cl^n using XTR double exponentiation method on traces of FP48s. See Stam thesis. */
+/*
+void YYY::FP16_xtr_pow2(FP16 *r, FP16 *ck, FP16 *cl, FP16 *ckml, FP16 *ckm2l, BIG a, BIG b)
+{
+    int i, f2;
+    BIG d, e, w;
+    FP16 t, cu, cv, cumv, cum2v;
+
+
+    BIG_copy(e, a);
+    BIG_copy(d, b);
+    BIG_norm(d);
+    BIG_norm(e);
+    FP16_copy(&cu, ck);
+    FP16_copy(&cv, cl);
+    FP16_copy(&cumv, ckml);
+    FP16_copy(&cum2v, ckm2l);
+
+    f2 = 0;
+    while (BIG_parity(d) == 0 && BIG_parity(e) == 0)
+    {
+        BIG_shr(d, 1);
+        BIG_shr(e, 1);
+        f2++;
+    }
+    while (BIG_comp(d, e) != 0)
+    {
+        if (BIG_comp(d, e) > 0)
+        {
+            BIG_imul(w, e, 4);
+            BIG_norm(w);
+            if (BIG_comp(d, w) <= 0)
+            {
+                BIG_copy(w, d);
+                BIG_copy(d, e);
+                BIG_sub(e, w, e);
+                BIG_norm(e);
+                FP16_xtr_A(&t, &cu, &cv, &cumv, &cum2v);
+                FP16_conj(&cum2v, &cumv);
+                FP16_copy(&cumv, &cv);
+                FP16_copy(&cv, &cu);
+                FP16_copy(&cu, &t);
+            }
+            else if (BIG_parity(d) == 0)
+            {
+                BIG_shr(d, 1);
+                FP16_conj(r, &cum2v);
+                FP16_xtr_A(&t, &cu, &cumv, &cv, r);
+                FP16_xtr_D(&cum2v, &cumv);
+                FP16_copy(&cumv, &t);
+                FP16_xtr_D(&cu, &cu);
+            }
+            else if (BIG_parity(e) == 1)
+            {
+                BIG_sub(d, d, e);
+                BIG_norm(d);
+                BIG_shr(d, 1);
+                FP16_xtr_A(&t, &cu, &cv, &cumv, &cum2v);
+                FP16_xtr_D(&cu, &cu);
+                FP16_xtr_D(&cum2v, &cv);
+                FP16_conj(&cum2v, &cum2v);
+                FP16_copy(&cv, &t);
+            }
+            else
+            {
+                BIG_copy(w, d);
+                BIG_copy(d, e);
+                BIG_shr(d, 1);
+                BIG_copy(e, w);
+                FP16_xtr_D(&t, &cumv);
+                FP16_conj(&cumv, &cum2v);
+                FP16_conj(&cum2v, &t);
+                FP16_xtr_D(&t, &cv);
+                FP16_copy(&cv, &cu);
+                FP16_copy(&cu, &t);
+            }
+        }
+        if (BIG_comp(d, e) < 0)
+        {
+            BIG_imul(w, d, 4);
+            BIG_norm(w);
+            if (BIG_comp(e, w) <= 0)
+            {
+                BIG_sub(e, e, d);
+                BIG_norm(e);
+                FP16_xtr_A(&t, &cu, &cv, &cumv, &cum2v);
+                FP16_copy(&cum2v, &cumv);
+                FP16_copy(&cumv, &cu);
+                FP16_copy(&cu, &t);
+            }
+            else if (BIG_parity(e) == 0)
+            {
+                BIG_copy(w, d);
+                BIG_copy(d, e);
+                BIG_shr(d, 1);
+                BIG_copy(e, w);
+                FP16_xtr_D(&t, &cumv);
+                FP16_conj(&cumv, &cum2v);
+                FP16_conj(&cum2v, &t);
+                FP16_xtr_D(&t, &cv);
+                FP16_copy(&cv, &cu);
+                FP16_copy(&cu, &t);
+            }
+            else if (BIG_parity(d) == 1)
+            {
+                BIG_copy(w, e);
+                BIG_copy(e, d);
+                BIG_sub(w, w, d);
+                BIG_norm(w);
+                BIG_copy(d, w);
+                BIG_shr(d, 1);
+                FP16_xtr_A(&t, &cu, &cv, &cumv, &cum2v);
+                FP16_conj(&cumv, &cumv);
+                FP16_xtr_D(&cum2v, &cu);
+                FP16_conj(&cum2v, &cum2v);
+                FP16_xtr_D(&cu, &cv);
+                FP16_copy(&cv, &t);
+            }
+            else
+            {
+                BIG_shr(d, 1);
+                FP16_conj(r, &cum2v);
+                FP16_xtr_A(&t, &cu, &cumv, &cv, r);
+                FP16_xtr_D(&cum2v, &cumv);
+                FP16_copy(&cumv, &t);
+                FP16_xtr_D(&cu, &cu);
+            }
+        }
+    }
+    FP16_xtr_A(r, &cu, &cv, &cumv, &cum2v);
+    for (i = 0; i < f2; i++)    FP16_xtr_D(r, r);
+    FP16_xtr_pow(r, r, d);
+}
+
+#endif
+*/
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp16.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp16.h
new file mode 100644
index 0000000..348ac92
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp16.h
@@ -0,0 +1,308 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP16_YYY_H
+#define FP16_YYY_H
+
+#include "fp8_YYY.h"
+#include "config_curve_ZZZ.h"
+
+using namespace core;
+
+namespace YYY {
+
+/**
+	@brief FP16 Structure - towered over two FP4
+*/
+
+typedef struct
+{
+    FP8 a; /**< real part of FP16 */
+    FP8 b; /**< imaginary part of FP16 */
+} FP16;
+
+
+/* FP16 prototypes */
+/**	@brief Tests for FP16 equal to zero
+ *
+	@param x FP16 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP16_iszilch(FP16 *x);
+/**	@brief Tests for FP16 equal to unity
+ *
+	@param x FP16 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP16_isunity(FP16 *x);
+/**	@brief Tests for equality of two FP16s
+ *
+	@param x FP16 instance to be compared
+	@param y FP16 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP16_equals(FP16 *x, FP16 *y);
+
+/**	@brief Serialize in FP16  
+ *
+    @param b buffer for output
+	@param x FP16 number to be serialized
+ */
+extern void FP16_toBytes(char *b,FP16 *x);
+/**	@brief Serialize out FP16  
+ *
+	@param x FP16 number to be serialized
+    @param b buffer for input
+ */
+extern void FP16_fromBytes(FP16 *x,char *b);
+
+/**	@brief Tests for FP16 having only a real part and no imaginary part
+ *
+	@param x FP16 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP16_isreal(FP16 *x);
+/**	@brief Initialise FP16 from two FP8s
+ *
+	@param x FP16 instance to be initialised
+	@param a FP8 to form real part of FP16
+	@param b FP8 to form imaginary part of FP16
+ */
+extern void FP16_from_FP8s(FP16 *x, FP8 *a, FP8 *b);
+/**	@brief Initialise FP16 from single FP8
+ *
+	Imaginary part is set to zero
+	@param x FP16 instance to be initialised
+	@param a FP8 to form real part of FP16
+ */
+extern void FP16_from_FP8(FP16 *x, FP8 *a);
+
+/**	@brief Initialise FP16 from single FP8
+ *
+	real part is set to zero
+	@param x FP16 instance to be initialised
+	@param a FP8 to form imaginary part of FP16
+ */
+extern void FP16_from_FP8H(FP16 *x, FP8 *a);
+
+
+/**	@brief Copy FP16 to another FP16
+ *
+	@param x FP16 instance, on exit = y
+	@param y FP16 instance to be copied
+ */
+extern void FP16_copy(FP16 *x, FP16 *y);
+/**	@brief Set FP16 to zero
+ *
+	@param x FP16 instance to be set to zero
+ */
+extern void FP16_zero(FP16 *x);
+/**	@brief Set FP16 to unity
+ *
+	@param x FP16 instance to be set to one
+ */
+extern void FP16_one(FP16 *x);
+/**	@brief Negation of FP16
+ *
+	@param x FP16 instance, on exit = -y
+	@param y FP16 instance
+ */
+extern void FP16_neg(FP16 *x, FP16 *y);
+/**	@brief Conjugation of FP16
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP16 instance, on exit = conj(y)
+	@param y FP16 instance
+ */
+extern void FP16_conj(FP16 *x, FP16 *y);
+/**	@brief Negative conjugation of FP16
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP16 instance, on exit = -conj(y)
+	@param y FP16 instance
+ */
+extern void FP16_nconj(FP16 *x, FP16 *y);
+/**	@brief addition of two FP16s
+ *
+	@param x FP16 instance, on exit = y+z
+	@param y FP16 instance
+	@param z FP16 instance
+ */
+extern void FP16_add(FP16 *x, FP16 *y, FP16 *z);
+/**	@brief subtraction of two FP16s
+ *
+	@param x FP16 instance, on exit = y-z
+	@param y FP16 instance
+	@param z FP16 instance
+ */
+extern void FP16_sub(FP16 *x, FP16 *y, FP16 *z);
+/**	@brief Multiplication of an FP16 by an FP8
+ *
+	@param x FP16 instance, on exit = y*a
+	@param y FP16 instance
+	@param a FP4 multiplier
+ */
+extern void FP16_pmul(FP16 *x, FP16 *y, FP8 *a);
+
+/**	@brief Multiplication of an FP16 by an FP2
+ *
+	@param x FP16 instance, on exit = y*a
+	@param y FP16 instance
+	@param a FP2 multiplier
+ */
+extern void FP16_qmul(FP16 *x, FP16 *y, FP2 *a);
+
+
+/**	@brief Multiplication of an FP16 by an FP
+ *
+	@param x FP16 instance, on exit = y*a
+	@param y FP16 instance
+	@param a FP multiplier
+ */
+extern void FP16_tmul(FP16 *x, FP16 *y, FP *a);
+
+
+
+/**	@brief Multiplication of an FP16 by a small integer
+ *
+	@param x FP16 instance, on exit = y*i
+	@param y FP16 instance
+	@param i an integer
+ */
+extern void FP16_imul(FP16 *x, FP16 *y, int i);
+/**	@brief Squaring an FP16
+ *
+	@param x FP16 instance, on exit = y^2
+	@param y FP16 instance
+ */
+extern void FP16_sqr(FP16 *x, FP16 *y);
+/**	@brief Multiplication of two FP16s
+ *
+	@param x FP16 instance, on exit = y*z
+	@param y FP16 instance
+	@param z FP16 instance
+ */
+extern void FP16_mul(FP16 *x, FP16 *y, FP16 *z);
+/**	@brief Inverting an FP16
+ *
+	@param x FP16 instance, on exit = 1/y
+	@param y FP16 instance
+ */
+extern void FP16_inv(FP16 *x, FP16 *y);
+/**	@brief Formats and outputs an FP16 to the console
+ *
+	@param x FP16 instance to be printed
+ */
+extern void FP16_output(FP16 *x);
+/**	@brief Formats and outputs an FP16 to the console in raw form (for debugging)
+ *
+	@param x FP16 instance to be printed
+ */
+extern void FP16_rawoutput(FP16 *x);
+/**	@brief multiplies an FP16 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP16 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP16_times_i(FP16 *x);
+/**	@brief multiplies an FP16 instance by irreducible polynomial (1+sqrt(-1))
+ *
+	@param x FP16 instance, on exit = sqrt(1+sqrt(-1))^2*x
+ */
+extern void FP16_times_i2(FP16 *x);
+
+/**	@brief multiplies an FP16 instance by irreducible polynomial (1+sqrt(-1))
+ *
+	@param x FP16 instance, on exit = sqrt(1+sqrt(-1))^4*x
+ */
+extern void FP16_times_i4(FP16 *x);
+
+
+/**	@brief Normalises the components of an FP16
+ *
+	@param x FP16 instance to be normalised
+ */
+extern void FP16_norm(FP16 *x);
+/**	@brief Reduces all components of possibly unreduced FP16 mod Modulus
+ *
+	@param x FP16 instance, on exit reduced mod Modulus
+ */
+extern void FP16_reduce(FP16 *x);
+/**	@brief Raises an FP16 to the power of a BIG
+ *
+	@param x FP16 instance, on exit = y^b
+	@param y FP16 instance
+	@param b BIG number
+ */
+extern void FP16_pow(FP16 *x, FP16 *y, XXX::BIG b);
+/**	@brief Raises an FP16 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP16 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP16_frob(FP16 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP16 instance, on exit = w*x-conj(x)*y+z
+	@param w FP16 instance
+	@param x FP16 instance
+	@param y FP16 instance
+	@param z FP16 instance
+ */
+extern void FP16_xtr_A(FP16 *r, FP16 *w, FP16 *x, FP16 *y, FP16 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP16 instance, on exit = x^2-2*conj(x)
+	@param x FP16 instance
+ */
+extern void FP16_xtr_D(FP16 *r, FP16 *x);
+/**	@brief Calculates FP16 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP16 instance, on exit = trace(w^b)
+	@param x FP16 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP16_xtr_pow(FP16 *r, FP16 *x, XXX::BIG b);
+/**	@brief Calculates FP16 trace of c^a.d^b, where c and d are derived from FP16 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP16 instance, on exit = trace(c^a.d^b)
+	@param c FP16 instance, trace of an FP12
+	@param d FP16 instance, trace of an FP12
+	@param e FP16 instance, trace of an FP12
+	@param f FP16 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP16_xtr_pow2(FP16 *r, FP16 *c, FP16 *d, FP16 *e, FP16 *f, XXX::BIG a, XXX::BIG b);
+
+/**	@brief Conditional copy of FP16 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP16 instance, set to y if s!=0
+	@param y another FP16 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP16_cmove(FP16 *x, FP16 *y, int s);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp16_BLS48286.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp16_BLS48286.h
new file mode 100644
index 0000000..36a9cb9
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp16_BLS48286.h
@@ -0,0 +1,308 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP16_BLS48286_H
+#define FP16_BLS48286_H
+
+#include "fp8_BLS48286.h"
+#include "config_curve_BLS48286.h"
+
+using namespace core;
+
+namespace BLS48286 {
+
+/**
+	@brief FP16 Structure - towered over two FP4
+*/
+
+typedef struct
+{
+    FP8 a; /**< real part of FP16 */
+    FP8 b; /**< imaginary part of FP16 */
+} FP16;
+
+
+/* FP16 prototypes */
+/**	@brief Tests for FP16 equal to zero
+ *
+	@param x FP16 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP16_iszilch(FP16 *x);
+/**	@brief Tests for FP16 equal to unity
+ *
+	@param x FP16 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP16_isunity(FP16 *x);
+/**	@brief Tests for equality of two FP16s
+ *
+	@param x FP16 instance to be compared
+	@param y FP16 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP16_equals(FP16 *x, FP16 *y);
+
+/**	@brief Serialize in FP16  
+ *
+    @param b buffer for output
+	@param x FP16 number to be serialized
+ */
+extern void FP16_toBytes(char *b,FP16 *x);
+/**	@brief Serialize out FP16  
+ *
+	@param x FP16 number to be serialized
+    @param b buffer for input
+ */
+extern void FP16_fromBytes(FP16 *x,char *b);
+
+/**	@brief Tests for FP16 having only a real part and no imaginary part
+ *
+	@param x FP16 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP16_isreal(FP16 *x);
+/**	@brief Initialise FP16 from two FP8s
+ *
+	@param x FP16 instance to be initialised
+	@param a FP8 to form real part of FP16
+	@param b FP8 to form imaginary part of FP16
+ */
+extern void FP16_from_FP8s(FP16 *x, FP8 *a, FP8 *b);
+/**	@brief Initialise FP16 from single FP8
+ *
+	Imaginary part is set to zero
+	@param x FP16 instance to be initialised
+	@param a FP8 to form real part of FP16
+ */
+extern void FP16_from_FP8(FP16 *x, FP8 *a);
+
+/**	@brief Initialise FP16 from single FP8
+ *
+	real part is set to zero
+	@param x FP16 instance to be initialised
+	@param a FP8 to form imaginary part of FP16
+ */
+extern void FP16_from_FP8H(FP16 *x, FP8 *a);
+
+
+/**	@brief Copy FP16 to another FP16
+ *
+	@param x FP16 instance, on exit = y
+	@param y FP16 instance to be copied
+ */
+extern void FP16_copy(FP16 *x, FP16 *y);
+/**	@brief Set FP16 to zero
+ *
+	@param x FP16 instance to be set to zero
+ */
+extern void FP16_zero(FP16 *x);
+/**	@brief Set FP16 to unity
+ *
+	@param x FP16 instance to be set to one
+ */
+extern void FP16_one(FP16 *x);
+/**	@brief Negation of FP16
+ *
+	@param x FP16 instance, on exit = -y
+	@param y FP16 instance
+ */
+extern void FP16_neg(FP16 *x, FP16 *y);
+/**	@brief Conjugation of FP16
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP16 instance, on exit = conj(y)
+	@param y FP16 instance
+ */
+extern void FP16_conj(FP16 *x, FP16 *y);
+/**	@brief Negative conjugation of FP16
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP16 instance, on exit = -conj(y)
+	@param y FP16 instance
+ */
+extern void FP16_nconj(FP16 *x, FP16 *y);
+/**	@brief addition of two FP16s
+ *
+	@param x FP16 instance, on exit = y+z
+	@param y FP16 instance
+	@param z FP16 instance
+ */
+extern void FP16_add(FP16 *x, FP16 *y, FP16 *z);
+/**	@brief subtraction of two FP16s
+ *
+	@param x FP16 instance, on exit = y-z
+	@param y FP16 instance
+	@param z FP16 instance
+ */
+extern void FP16_sub(FP16 *x, FP16 *y, FP16 *z);
+/**	@brief Multiplication of an FP16 by an FP8
+ *
+	@param x FP16 instance, on exit = y*a
+	@param y FP16 instance
+	@param a FP4 multiplier
+ */
+extern void FP16_pmul(FP16 *x, FP16 *y, FP8 *a);
+
+/**	@brief Multiplication of an FP16 by an FP2
+ *
+	@param x FP16 instance, on exit = y*a
+	@param y FP16 instance
+	@param a FP2 multiplier
+ */
+extern void FP16_qmul(FP16 *x, FP16 *y, FP2 *a);
+
+
+/**	@brief Multiplication of an FP16 by an FP
+ *
+	@param x FP16 instance, on exit = y*a
+	@param y FP16 instance
+	@param a FP multiplier
+ */
+extern void FP16_tmul(FP16 *x, FP16 *y, FP *a);
+
+
+
+/**	@brief Multiplication of an FP16 by a small integer
+ *
+	@param x FP16 instance, on exit = y*i
+	@param y FP16 instance
+	@param i an integer
+ */
+extern void FP16_imul(FP16 *x, FP16 *y, int i);
+/**	@brief Squaring an FP16
+ *
+	@param x FP16 instance, on exit = y^2
+	@param y FP16 instance
+ */
+extern void FP16_sqr(FP16 *x, FP16 *y);
+/**	@brief Multiplication of two FP16s
+ *
+	@param x FP16 instance, on exit = y*z
+	@param y FP16 instance
+	@param z FP16 instance
+ */
+extern void FP16_mul(FP16 *x, FP16 *y, FP16 *z);
+/**	@brief Inverting an FP16
+ *
+	@param x FP16 instance, on exit = 1/y
+	@param y FP16 instance
+ */
+extern void FP16_inv(FP16 *x, FP16 *y);
+/**	@brief Formats and outputs an FP16 to the console
+ *
+	@param x FP16 instance to be printed
+ */
+extern void FP16_output(FP16 *x);
+/**	@brief Formats and outputs an FP16 to the console in raw form (for debugging)
+ *
+	@param x FP16 instance to be printed
+ */
+extern void FP16_rawoutput(FP16 *x);
+/**	@brief multiplies an FP16 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP16 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP16_times_i(FP16 *x);
+/**	@brief multiplies an FP16 instance by irreducible polynomial (1+sqrt(-1))
+ *
+	@param x FP16 instance, on exit = sqrt(1+sqrt(-1))^2*x
+ */
+extern void FP16_times_i2(FP16 *x);
+
+/**	@brief multiplies an FP16 instance by irreducible polynomial (1+sqrt(-1))
+ *
+	@param x FP16 instance, on exit = sqrt(1+sqrt(-1))^4*x
+ */
+extern void FP16_times_i4(FP16 *x);
+
+
+/**	@brief Normalises the components of an FP16
+ *
+	@param x FP16 instance to be normalised
+ */
+extern void FP16_norm(FP16 *x);
+/**	@brief Reduces all components of possibly unreduced FP16 mod Modulus
+ *
+	@param x FP16 instance, on exit reduced mod Modulus
+ */
+extern void FP16_reduce(FP16 *x);
+/**	@brief Raises an FP16 to the power of a BIG
+ *
+	@param x FP16 instance, on exit = y^b
+	@param y FP16 instance
+	@param b BIG number
+ */
+extern void FP16_pow(FP16 *x, FP16 *y, B288_60::BIG b);
+/**	@brief Raises an FP16 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP16 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP16_frob(FP16 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP16 instance, on exit = w*x-conj(x)*y+z
+	@param w FP16 instance
+	@param x FP16 instance
+	@param y FP16 instance
+	@param z FP16 instance
+ */
+extern void FP16_xtr_A(FP16 *r, FP16 *w, FP16 *x, FP16 *y, FP16 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP16 instance, on exit = x^2-2*conj(x)
+	@param x FP16 instance
+ */
+extern void FP16_xtr_D(FP16 *r, FP16 *x);
+/**	@brief Calculates FP16 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP16 instance, on exit = trace(w^b)
+	@param x FP16 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP16_xtr_pow(FP16 *r, FP16 *x, B288_60::BIG b);
+/**	@brief Calculates FP16 trace of c^a.d^b, where c and d are derived from FP16 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP16 instance, on exit = trace(c^a.d^b)
+	@param c FP16 instance, trace of an FP12
+	@param d FP16 instance, trace of an FP12
+	@param e FP16 instance, trace of an FP12
+	@param f FP16 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP16_xtr_pow2(FP16 *r, FP16 *c, FP16 *d, FP16 *e, FP16 *f, B288_60::BIG a, B288_60::BIG b);
+
+/**	@brief Conditional copy of FP16 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP16 instance, set to y if s!=0
+	@param y another FP16 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP16_cmove(FP16 *x, FP16 *y, int s);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp16_BLS48556.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp16_BLS48556.h
new file mode 100644
index 0000000..e3811dc
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp16_BLS48556.h
@@ -0,0 +1,308 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP16_BLS48556_H
+#define FP16_BLS48556_H
+
+#include "fp8_BLS48556.h"
+#include "config_curve_BLS48556.h"
+
+using namespace core;
+
+namespace BLS48556 {
+
+/**
+	@brief FP16 Structure - towered over two FP4
+*/
+
+typedef struct
+{
+    FP8 a; /**< real part of FP16 */
+    FP8 b; /**< imaginary part of FP16 */
+} FP16;
+
+
+/* FP16 prototypes */
+/**	@brief Tests for FP16 equal to zero
+ *
+	@param x FP16 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP16_iszilch(FP16 *x);
+/**	@brief Tests for FP16 equal to unity
+ *
+	@param x FP16 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP16_isunity(FP16 *x);
+/**	@brief Tests for equality of two FP16s
+ *
+	@param x FP16 instance to be compared
+	@param y FP16 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP16_equals(FP16 *x, FP16 *y);
+
+/**	@brief Serialize in FP16  
+ *
+    @param b buffer for output
+	@param x FP16 number to be serialized
+ */
+extern void FP16_toBytes(char *b,FP16 *x);
+/**	@brief Serialize out FP16  
+ *
+	@param x FP16 number to be serialized
+    @param b buffer for input
+ */
+extern void FP16_fromBytes(FP16 *x,char *b);
+
+/**	@brief Tests for FP16 having only a real part and no imaginary part
+ *
+	@param x FP16 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP16_isreal(FP16 *x);
+/**	@brief Initialise FP16 from two FP8s
+ *
+	@param x FP16 instance to be initialised
+	@param a FP8 to form real part of FP16
+	@param b FP8 to form imaginary part of FP16
+ */
+extern void FP16_from_FP8s(FP16 *x, FP8 *a, FP8 *b);
+/**	@brief Initialise FP16 from single FP8
+ *
+	Imaginary part is set to zero
+	@param x FP16 instance to be initialised
+	@param a FP8 to form real part of FP16
+ */
+extern void FP16_from_FP8(FP16 *x, FP8 *a);
+
+/**	@brief Initialise FP16 from single FP8
+ *
+	real part is set to zero
+	@param x FP16 instance to be initialised
+	@param a FP8 to form imaginary part of FP16
+ */
+extern void FP16_from_FP8H(FP16 *x, FP8 *a);
+
+
+/**	@brief Copy FP16 to another FP16
+ *
+	@param x FP16 instance, on exit = y
+	@param y FP16 instance to be copied
+ */
+extern void FP16_copy(FP16 *x, FP16 *y);
+/**	@brief Set FP16 to zero
+ *
+	@param x FP16 instance to be set to zero
+ */
+extern void FP16_zero(FP16 *x);
+/**	@brief Set FP16 to unity
+ *
+	@param x FP16 instance to be set to one
+ */
+extern void FP16_one(FP16 *x);
+/**	@brief Negation of FP16
+ *
+	@param x FP16 instance, on exit = -y
+	@param y FP16 instance
+ */
+extern void FP16_neg(FP16 *x, FP16 *y);
+/**	@brief Conjugation of FP16
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP16 instance, on exit = conj(y)
+	@param y FP16 instance
+ */
+extern void FP16_conj(FP16 *x, FP16 *y);
+/**	@brief Negative conjugation of FP16
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP16 instance, on exit = -conj(y)
+	@param y FP16 instance
+ */
+extern void FP16_nconj(FP16 *x, FP16 *y);
+/**	@brief addition of two FP16s
+ *
+	@param x FP16 instance, on exit = y+z
+	@param y FP16 instance
+	@param z FP16 instance
+ */
+extern void FP16_add(FP16 *x, FP16 *y, FP16 *z);
+/**	@brief subtraction of two FP16s
+ *
+	@param x FP16 instance, on exit = y-z
+	@param y FP16 instance
+	@param z FP16 instance
+ */
+extern void FP16_sub(FP16 *x, FP16 *y, FP16 *z);
+/**	@brief Multiplication of an FP16 by an FP8
+ *
+	@param x FP16 instance, on exit = y*a
+	@param y FP16 instance
+	@param a FP4 multiplier
+ */
+extern void FP16_pmul(FP16 *x, FP16 *y, FP8 *a);
+
+/**	@brief Multiplication of an FP16 by an FP2
+ *
+	@param x FP16 instance, on exit = y*a
+	@param y FP16 instance
+	@param a FP2 multiplier
+ */
+extern void FP16_qmul(FP16 *x, FP16 *y, FP2 *a);
+
+
+/**	@brief Multiplication of an FP16 by an FP
+ *
+	@param x FP16 instance, on exit = y*a
+	@param y FP16 instance
+	@param a FP multiplier
+ */
+extern void FP16_tmul(FP16 *x, FP16 *y, FP *a);
+
+
+
+/**	@brief Multiplication of an FP16 by a small integer
+ *
+	@param x FP16 instance, on exit = y*i
+	@param y FP16 instance
+	@param i an integer
+ */
+extern void FP16_imul(FP16 *x, FP16 *y, int i);
+/**	@brief Squaring an FP16
+ *
+	@param x FP16 instance, on exit = y^2
+	@param y FP16 instance
+ */
+extern void FP16_sqr(FP16 *x, FP16 *y);
+/**	@brief Multiplication of two FP16s
+ *
+	@param x FP16 instance, on exit = y*z
+	@param y FP16 instance
+	@param z FP16 instance
+ */
+extern void FP16_mul(FP16 *x, FP16 *y, FP16 *z);
+/**	@brief Inverting an FP16
+ *
+	@param x FP16 instance, on exit = 1/y
+	@param y FP16 instance
+ */
+extern void FP16_inv(FP16 *x, FP16 *y);
+/**	@brief Formats and outputs an FP16 to the console
+ *
+	@param x FP16 instance to be printed
+ */
+extern void FP16_output(FP16 *x);
+/**	@brief Formats and outputs an FP16 to the console in raw form (for debugging)
+ *
+	@param x FP16 instance to be printed
+ */
+extern void FP16_rawoutput(FP16 *x);
+/**	@brief multiplies an FP16 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP16 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP16_times_i(FP16 *x);
+/**	@brief multiplies an FP16 instance by irreducible polynomial (1+sqrt(-1))
+ *
+	@param x FP16 instance, on exit = sqrt(1+sqrt(-1))^2*x
+ */
+extern void FP16_times_i2(FP16 *x);
+
+/**	@brief multiplies an FP16 instance by irreducible polynomial (1+sqrt(-1))
+ *
+	@param x FP16 instance, on exit = sqrt(1+sqrt(-1))^4*x
+ */
+extern void FP16_times_i4(FP16 *x);
+
+
+/**	@brief Normalises the components of an FP16
+ *
+	@param x FP16 instance to be normalised
+ */
+extern void FP16_norm(FP16 *x);
+/**	@brief Reduces all components of possibly unreduced FP16 mod Modulus
+ *
+	@param x FP16 instance, on exit reduced mod Modulus
+ */
+extern void FP16_reduce(FP16 *x);
+/**	@brief Raises an FP16 to the power of a BIG
+ *
+	@param x FP16 instance, on exit = y^b
+	@param y FP16 instance
+	@param b BIG number
+ */
+extern void FP16_pow(FP16 *x, FP16 *y, B560_58::BIG b);
+/**	@brief Raises an FP16 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP16 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP16_frob(FP16 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP16 instance, on exit = w*x-conj(x)*y+z
+	@param w FP16 instance
+	@param x FP16 instance
+	@param y FP16 instance
+	@param z FP16 instance
+ */
+extern void FP16_xtr_A(FP16 *r, FP16 *w, FP16 *x, FP16 *y, FP16 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP16 instance, on exit = x^2-2*conj(x)
+	@param x FP16 instance
+ */
+extern void FP16_xtr_D(FP16 *r, FP16 *x);
+/**	@brief Calculates FP16 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP16 instance, on exit = trace(w^b)
+	@param x FP16 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP16_xtr_pow(FP16 *r, FP16 *x, B560_58::BIG b);
+/**	@brief Calculates FP16 trace of c^a.d^b, where c and d are derived from FP16 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP16 instance, on exit = trace(c^a.d^b)
+	@param c FP16 instance, trace of an FP12
+	@param d FP16 instance, trace of an FP12
+	@param e FP16 instance, trace of an FP12
+	@param f FP16 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP16_xtr_pow2(FP16 *r, FP16 *c, FP16 *d, FP16 *e, FP16 *f, B560_58::BIG a, B560_58::BIG b);
+
+/**	@brief Conditional copy of FP16 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP16 instance, set to y if s!=0
+	@param y another FP16 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP16_cmove(FP16 *x, FP16 *y, int s);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp16_BLS48581.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp16_BLS48581.h
new file mode 100644
index 0000000..d0e7754
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp16_BLS48581.h
@@ -0,0 +1,308 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP16_BLS48581_H
+#define FP16_BLS48581_H
+
+#include "fp8_BLS48581.h"
+#include "config_curve_BLS48581.h"
+
+using namespace core;
+
+namespace BLS48581 {
+
+/**
+	@brief FP16 Structure - towered over two FP4
+*/
+
+typedef struct
+{
+    FP8 a; /**< real part of FP16 */
+    FP8 b; /**< imaginary part of FP16 */
+} FP16;
+
+
+/* FP16 prototypes */
+/**	@brief Tests for FP16 equal to zero
+ *
+	@param x FP16 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP16_iszilch(FP16 *x);
+/**	@brief Tests for FP16 equal to unity
+ *
+	@param x FP16 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP16_isunity(FP16 *x);
+/**	@brief Tests for equality of two FP16s
+ *
+	@param x FP16 instance to be compared
+	@param y FP16 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP16_equals(FP16 *x, FP16 *y);
+
+/**	@brief Serialize in FP16  
+ *
+    @param b buffer for output
+	@param x FP16 number to be serialized
+ */
+extern void FP16_toBytes(char *b,FP16 *x);
+/**	@brief Serialize out FP16  
+ *
+	@param x FP16 number to be serialized
+    @param b buffer for input
+ */
+extern void FP16_fromBytes(FP16 *x,char *b);
+
+/**	@brief Tests for FP16 having only a real part and no imaginary part
+ *
+	@param x FP16 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP16_isreal(FP16 *x);
+/**	@brief Initialise FP16 from two FP8s
+ *
+	@param x FP16 instance to be initialised
+	@param a FP8 to form real part of FP16
+	@param b FP8 to form imaginary part of FP16
+ */
+extern void FP16_from_FP8s(FP16 *x, FP8 *a, FP8 *b);
+/**	@brief Initialise FP16 from single FP8
+ *
+	Imaginary part is set to zero
+	@param x FP16 instance to be initialised
+	@param a FP8 to form real part of FP16
+ */
+extern void FP16_from_FP8(FP16 *x, FP8 *a);
+
+/**	@brief Initialise FP16 from single FP8
+ *
+	real part is set to zero
+	@param x FP16 instance to be initialised
+	@param a FP8 to form imaginary part of FP16
+ */
+extern void FP16_from_FP8H(FP16 *x, FP8 *a);
+
+
+/**	@brief Copy FP16 to another FP16
+ *
+	@param x FP16 instance, on exit = y
+	@param y FP16 instance to be copied
+ */
+extern void FP16_copy(FP16 *x, FP16 *y);
+/**	@brief Set FP16 to zero
+ *
+	@param x FP16 instance to be set to zero
+ */
+extern void FP16_zero(FP16 *x);
+/**	@brief Set FP16 to unity
+ *
+	@param x FP16 instance to be set to one
+ */
+extern void FP16_one(FP16 *x);
+/**	@brief Negation of FP16
+ *
+	@param x FP16 instance, on exit = -y
+	@param y FP16 instance
+ */
+extern void FP16_neg(FP16 *x, FP16 *y);
+/**	@brief Conjugation of FP16
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP16 instance, on exit = conj(y)
+	@param y FP16 instance
+ */
+extern void FP16_conj(FP16 *x, FP16 *y);
+/**	@brief Negative conjugation of FP16
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP16 instance, on exit = -conj(y)
+	@param y FP16 instance
+ */
+extern void FP16_nconj(FP16 *x, FP16 *y);
+/**	@brief addition of two FP16s
+ *
+	@param x FP16 instance, on exit = y+z
+	@param y FP16 instance
+	@param z FP16 instance
+ */
+extern void FP16_add(FP16 *x, FP16 *y, FP16 *z);
+/**	@brief subtraction of two FP16s
+ *
+	@param x FP16 instance, on exit = y-z
+	@param y FP16 instance
+	@param z FP16 instance
+ */
+extern void FP16_sub(FP16 *x, FP16 *y, FP16 *z);
+/**	@brief Multiplication of an FP16 by an FP8
+ *
+	@param x FP16 instance, on exit = y*a
+	@param y FP16 instance
+	@param a FP4 multiplier
+ */
+extern void FP16_pmul(FP16 *x, FP16 *y, FP8 *a);
+
+/**	@brief Multiplication of an FP16 by an FP2
+ *
+	@param x FP16 instance, on exit = y*a
+	@param y FP16 instance
+	@param a FP2 multiplier
+ */
+extern void FP16_qmul(FP16 *x, FP16 *y, FP2 *a);
+
+
+/**	@brief Multiplication of an FP16 by an FP
+ *
+	@param x FP16 instance, on exit = y*a
+	@param y FP16 instance
+	@param a FP multiplier
+ */
+extern void FP16_tmul(FP16 *x, FP16 *y, FP *a);
+
+
+
+/**	@brief Multiplication of an FP16 by a small integer
+ *
+	@param x FP16 instance, on exit = y*i
+	@param y FP16 instance
+	@param i an integer
+ */
+extern void FP16_imul(FP16 *x, FP16 *y, int i);
+/**	@brief Squaring an FP16
+ *
+	@param x FP16 instance, on exit = y^2
+	@param y FP16 instance
+ */
+extern void FP16_sqr(FP16 *x, FP16 *y);
+/**	@brief Multiplication of two FP16s
+ *
+	@param x FP16 instance, on exit = y*z
+	@param y FP16 instance
+	@param z FP16 instance
+ */
+extern void FP16_mul(FP16 *x, FP16 *y, FP16 *z);
+/**	@brief Inverting an FP16
+ *
+	@param x FP16 instance, on exit = 1/y
+	@param y FP16 instance
+ */
+extern void FP16_inv(FP16 *x, FP16 *y);
+/**	@brief Formats and outputs an FP16 to the console
+ *
+	@param x FP16 instance to be printed
+ */
+extern void FP16_output(FP16 *x);
+/**	@brief Formats and outputs an FP16 to the console in raw form (for debugging)
+ *
+	@param x FP16 instance to be printed
+ */
+extern void FP16_rawoutput(FP16 *x);
+/**	@brief multiplies an FP16 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP16 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP16_times_i(FP16 *x);
+/**	@brief multiplies an FP16 instance by irreducible polynomial (1+sqrt(-1))
+ *
+	@param x FP16 instance, on exit = sqrt(1+sqrt(-1))^2*x
+ */
+extern void FP16_times_i2(FP16 *x);
+
+/**	@brief multiplies an FP16 instance by irreducible polynomial (1+sqrt(-1))
+ *
+	@param x FP16 instance, on exit = sqrt(1+sqrt(-1))^4*x
+ */
+extern void FP16_times_i4(FP16 *x);
+
+
+/**	@brief Normalises the components of an FP16
+ *
+	@param x FP16 instance to be normalised
+ */
+extern void FP16_norm(FP16 *x);
+/**	@brief Reduces all components of possibly unreduced FP16 mod Modulus
+ *
+	@param x FP16 instance, on exit reduced mod Modulus
+ */
+extern void FP16_reduce(FP16 *x);
+/**	@brief Raises an FP16 to the power of a BIG
+ *
+	@param x FP16 instance, on exit = y^b
+	@param y FP16 instance
+	@param b BIG number
+ */
+extern void FP16_pow(FP16 *x, FP16 *y, B584_60::BIG b);
+/**	@brief Raises an FP16 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP16 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP16_frob(FP16 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP16 instance, on exit = w*x-conj(x)*y+z
+	@param w FP16 instance
+	@param x FP16 instance
+	@param y FP16 instance
+	@param z FP16 instance
+ */
+extern void FP16_xtr_A(FP16 *r, FP16 *w, FP16 *x, FP16 *y, FP16 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP16 instance, on exit = x^2-2*conj(x)
+	@param x FP16 instance
+ */
+extern void FP16_xtr_D(FP16 *r, FP16 *x);
+/**	@brief Calculates FP16 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP16 instance, on exit = trace(w^b)
+	@param x FP16 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP16_xtr_pow(FP16 *r, FP16 *x, B584_60::BIG b);
+/**	@brief Calculates FP16 trace of c^a.d^b, where c and d are derived from FP16 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP16 instance, on exit = trace(c^a.d^b)
+	@param c FP16 instance, trace of an FP12
+	@param d FP16 instance, trace of an FP12
+	@param e FP16 instance, trace of an FP12
+	@param f FP16 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP16_xtr_pow2(FP16 *r, FP16 *c, FP16 *d, FP16 *e, FP16 *f, B584_60::BIG a, B584_60::BIG b);
+
+/**	@brief Conditional copy of FP16 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP16 instance, set to y if s!=0
+	@param y another FP16 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP16_cmove(FP16 *x, FP16 *y, int s);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp2.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp2.cpp
new file mode 100644
index 0000000..4c8fc67
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp2.cpp
@@ -0,0 +1,527 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* CORE Fp^2 functions */
+/* SU=m, m is Stack Usage (no lazy )*/
+
+/* FP2 elements are of the form a+ib, where i is sqrt(-1) */
+
+#include "fp2_YYY.h"
+
+//namespace YYY {
+//extern int fp2muls;
+//extern int fp2sqrs;
+//}
+
+using namespace XXX;
+
+/* test x==0 ? */
+/* SU= 8 */
+int YYY::FP2_iszilch(FP2 *x)
+{
+    return (FP_iszilch(&(x->a)) & FP_iszilch(&(x->b)));
+}
+
+/* Move g to f if d=1 */
+void YYY::FP2_cmove(FP2 *f, FP2 *g, int d)
+{
+    FP_cmove(&(f->a), &(g->a), d);
+    FP_cmove(&(f->b), &(g->b), d);
+}
+
+/* test x==1 ? */
+/* SU= 48 */
+int YYY::FP2_isunity(FP2 *x)
+{
+    FP one;
+    FP_one(&one);
+    return (FP_equals(&(x->a), &one) & FP_iszilch(&(x->b)));
+}
+
+/* SU= 8 */
+/* Fully reduce a and b mod Modulus */
+void YYY::FP2_reduce(FP2 *w)
+{
+    FP_reduce(&(w->a));
+    FP_reduce(&(w->b));
+}
+
+/* return 1 if x==y, else 0 */
+/* SU= 16 */
+int YYY::FP2_equals(FP2 *x, FP2 *y)
+{
+    return (FP_equals(&(x->a), &(y->a)) & FP_equals(&(x->b), &(y->b)));
+}
+
+// Is x lexically larger than p-x?
+// return -1 for no, 0 if x=0, 1 for yes
+int YYY::FP2_islarger(FP2 *x)
+{
+    int cmp;
+    if (FP2_iszilch(x)) return 0;
+    cmp=FP_islarger(&(x->b));
+    if (cmp!=0) return cmp;
+    return FP_islarger(&(x->a));
+}
+
+void YYY::FP2_toBytes(char *b,FP2 *x)
+{
+    FP_toBytes(b,&(x->b));
+    FP_toBytes(&b[MODBYTES_XXX],&(x->a));
+}
+
+void YYY::FP2_fromBytes(FP2 *x,char *b)
+{
+    FP_fromBytes(&(x->b),b);
+    FP_fromBytes(&(x->a),&b[MODBYTES_XXX]);
+}
+
+/* Create FP2 from two FPs */
+/* SU= 16 */
+void YYY::FP2_from_FPs(FP2 *w, FP *x, FP *y)
+{
+    FP_copy(&(w->a), x);
+    FP_copy(&(w->b), y);
+}
+
+/* Create FP2 from two BIGS */
+/* SU= 16 */
+void YYY::FP2_from_BIGs(FP2 *w, BIG x, BIG y)
+{
+    FP_nres(&(w->a), x);
+    FP_nres(&(w->b), y);
+}
+
+/* Create FP2 from two ints */
+void YYY::FP2_from_ints(FP2 *w, int xa, int xb)
+{
+    FP a,b;
+    FP_from_int(&a,xa);
+    FP_from_int(&b,xb);
+    FP2_from_FPs(w,&a,&b);
+}
+
+/* Create FP2 from FP */
+/* SU= 8 */
+void YYY::FP2_from_FP(FP2 *w, FP *x)
+{
+    FP_copy(&(w->a), x);
+    FP_zero(&(w->b));
+}
+
+/* Create FP2 from BIG */
+/* SU= 8 */
+void YYY::FP2_from_BIG(FP2 *w, BIG x)
+{
+    FP_nres(&(w->a), x);
+    FP_zero(&(w->b));
+}
+
+/* FP2 copy w=x */
+/* SU= 16 */
+void YYY::FP2_copy(FP2 *w, FP2 *x)
+{
+    if (w == x) return;
+    FP_copy(&(w->a), &(x->a));
+    FP_copy(&(w->b), &(x->b));
+}
+
+/* FP2 set w=0 */
+/* SU= 8 */
+void YYY::FP2_zero(FP2 *w)
+{
+    FP_zero(&(w->a));
+    FP_zero(&(w->b));
+}
+
+/* FP2 set w=1 */
+/* SU= 48 */
+void YYY::FP2_one(FP2 *w)
+{
+    FP one;
+    FP_one(&one);
+    FP2_from_FP(w, &one);
+}
+
+void YYY::FP2_rcopy(FP2 *w,const BIG a,const BIG b)
+{
+    FP_rcopy(&(w->a),a);
+    FP_rcopy(&(w->b),b);
+}
+
+int YYY::FP2_sign(FP2 *w)
+{
+    int p1,p2;
+    p1=FP_sign(&(w->a));
+    p2=FP_sign(&(w->b));
+#ifdef BIG_ENDIAN_SIGN_YYY
+    p2 ^= (p1 ^ p2)&FP_iszilch(&(w->b));
+    return p2;
+#else
+    p1 ^= (p1 ^ p2)&FP_iszilch(&(w->a));
+    return p1;
+#endif
+
+}
+
+/* Set w=-x */
+/* SU= 88 */
+void YYY::FP2_neg(FP2 *w, FP2 *x)
+{
+    /* Just one neg! */
+    FP m, t;
+    FP_add(&m, &(x->a), &(x->b));
+    FP_neg(&m, &m);
+    FP_add(&t, &m, &(x->b));
+    FP_add(&(w->b), &m, &(x->a));
+    FP_copy(&(w->a), &t);
+
+}
+
+/* Set w=conj(x) */
+/* SU= 16 */
+void YYY::FP2_conj(FP2 *w, FP2 *x)
+{
+    FP_copy(&(w->a), &(x->a));
+    FP_neg(&(w->b), &(x->b));
+    FP_norm(&(w->b));
+}
+
+/* Set w=x+y */
+/* SU= 16 */
+void YYY::FP2_add(FP2 *w, FP2 *x, FP2 *y)
+{
+    FP_add(&(w->a), &(x->a), &(y->a));
+    FP_add(&(w->b), &(x->b), &(y->b));
+}
+
+/* Set w=x-y */
+/* Input y MUST be normed */
+void YYY::FP2_sub(FP2 *w, FP2 *x, FP2 *y)
+{
+    FP2 m;
+    FP2_neg(&m, y);
+    FP2_add(w, x, &m);
+}
+
+/* Set w=s*x, where s is FP */
+/* SU= 16 */
+void YYY::FP2_pmul(FP2 *w, FP2 *x, FP *s)
+{
+    FP_mul(&(w->a), &(x->a), s);
+    FP_mul(&(w->b), &(x->b), s);
+}
+
+/* SU= 16 */
+/* Set w=s*x, where s is int */
+void YYY::FP2_imul(FP2 *w, FP2 *x, int s)
+{
+    FP_imul(&(w->a), &(x->a), s);
+    FP_imul(&(w->b), &(x->b), s);
+}
+
+/* Set w=x^2 */
+/* SU= 128 */
+void YYY::FP2_sqr(FP2 *w, FP2 *x)
+{
+    FP w1, w3, mb;
+
+    FP_add(&w1, &(x->a), &(x->b));
+    FP_neg(&mb, &(x->b));
+
+    FP_add(&w3, &(x->a), &(x->a));
+    FP_norm(&w3);
+    FP_mul(&(w->b), &w3, &(x->b));
+
+    FP_add(&(w->a), &(x->a), &mb);
+
+    FP_norm(&w1);
+    FP_norm(&(w->a));
+
+    FP_mul(&(w->a), &w1, &(w->a));   /* w->a#2 w->a=1 w1&w2=6 w1*w2=2 */
+
+//  YYY::fp2sqrs++;
+}
+
+
+/* Set w=x*y */
+/* Inputs MUST be normed  */
+/* Now uses Lazy reduction */
+void YYY::FP2_mul(FP2 *w, FP2 *x, FP2 *y)
+{
+    DBIG A, B, E, F, pR;
+    BIG C, D, p;
+
+    BIG_rcopy(p, Modulus);
+    BIG_dsucopy(pR, p);
+
+// reduce excesses of a and b as required (so product < pR)
+
+    if ((sign64)(x->a.XES + x->b.XES) * (y->a.XES + y->b.XES) > (sign64)FEXCESS_YYY)
+    {
+#ifdef DEBUG_REDUCE
+        printf("FP2 Product too large - reducing it\n");
+#endif
+        if (x->a.XES > 1) FP_reduce(&(x->a));
+        if (x->b.XES > 1) FP_reduce(&(x->b));
+    }
+
+    BIG_mul(A, x->a.g, y->a.g);
+    BIG_mul(B, x->b.g, y->b.g);
+
+    BIG_add(C, x->a.g, x->b.g); BIG_norm(C);
+    BIG_add(D, y->a.g, y->b.g); BIG_norm(D);
+
+    BIG_mul(E, C, D);
+    BIG_dadd(F, A, B);
+    BIG_dsub(B, pR, B); //
+
+    BIG_dadd(A, A, B);  // A<pR? Not necessarily, but <2pR
+    BIG_dsub(E, E, F);  // E<pR ? Yes
+
+    BIG_dnorm(A); FP_mod(w->a.g, A);  w->a.XES = 3; // may drift above 2p...
+    BIG_dnorm(E); FP_mod(w->b.g, E);  w->b.XES = 2;
+
+//  YYY::fp2muls++;
+}
+
+/* output FP2 in hex format [a,b] */
+/* SU= 16 */
+void YYY::FP2_output(FP2 *w)
+{
+    BIG bx, by;
+    FP2_reduce(w);
+    FP_redc(bx, &(w->a));
+    FP_redc(by, &(w->b));
+    printf("[");
+    BIG_output(bx);
+    printf(",");
+    BIG_output(by);
+    printf("]");
+    FP_nres(&(w->a), bx);
+    FP_nres(&(w->b), by);
+}
+
+/* SU= 8 */
+void YYY::FP2_rawoutput(FP2 *w)
+{
+    printf("[");
+    BIG_rawoutput(w->a.g);
+    printf(",");
+    BIG_rawoutput(w->b.g);
+    printf("]");
+}
+
+
+/* Set w=1/x */
+/* SU= 128 */
+void YYY::FP2_inv(FP2 *w, FP2 *x, FP *h)
+{
+    FP w1, w2;
+
+    FP2_norm(x);
+    FP_sqr(&w1, &(x->a));
+    FP_sqr(&w2, &(x->b));
+    FP_add(&w1, &w1, &w2);
+    FP_inv(&w1, &w1, h);
+    FP_mul(&(w->a), &(x->a), &w1);
+    FP_neg(&w1, &w1);
+    FP_norm(&w1);
+    FP_mul(&(w->b), &(x->b), &w1);
+}
+
+
+/* Set w=x/2 */
+/* SU= 16 */
+void YYY::FP2_div2(FP2 *w, FP2 *x)
+{
+    FP_div2(&(w->a), &(x->a));
+    FP_div2(&(w->b), &(x->b));
+}
+
+/* Input MUST be normed */
+void YYY::FP2_times_i(FP2 *w)
+{
+    FP z;
+    FP_copy(&z, &(w->a));
+    FP_neg(&(w->a), &(w->b));
+    FP_copy(&(w->b), &z);
+
+//    Output NOT normed, so use with care
+}
+
+/* Set w*=(2^i+sqrt(-1)) */
+/* where X^2-(2^i+sqrt(-1)) is irreducible for FP4 */
+
+/* Input MUST be normed */
+void YYY::FP2_mul_ip(FP2 *w)
+{
+    FP2 t;
+    int i = QNRI_YYY;
+
+    FP2_copy(&t, w);
+    FP2_times_i(w);
+
+// add 2^i.t
+    while (i > 0)
+    {
+        FP2_add(&t, &t, &t);
+        FP2_norm(&t);
+        i--;
+    }
+    FP2_add(w, &t, w);
+
+#if TOWER_YYY == POSITOWER
+    FP2_norm(w);
+    FP2_neg(w, w);  // ***
+#endif
+
+//    Output NOT normed, so use with care
+}
+
+/* Set w/=(2^i+sqrt(-1)) */
+/* Slow */
+void YYY::FP2_div_ip(FP2 *w)
+{
+    FP2 z;
+    FP2_norm(w);
+    FP2_from_ints(&z, (1 << QNRI_YYY), 1);
+    FP2_inv(&z, &z, NULL);
+    FP2_mul(w, &z, w);
+#if TOWER_YYY == POSITOWER
+    FP2_neg(w, w);  // ***
+#endif
+}
+
+/* SU= 8 */
+/* normalise a and b components of w */
+void YYY::FP2_norm(FP2 *w)
+{
+    FP_norm(&(w->a));
+    FP_norm(&(w->b));
+}
+
+/* Set w=a^b mod m */
+/* SU= 208 */
+/*
+void YYY::FP2_pow(FP2 *r, FP2* a, BIG b)
+{
+    FP2 w;
+    FP one;
+    BIG z, zilch;
+    int bt;
+
+    BIG_norm(b);
+    BIG_copy(z, b);
+    FP2_copy(&w, a);
+    FP_one(&one);
+    BIG_zero(zilch);
+    FP2_from_FP(r, &one);
+    while (1)
+    {
+        bt = BIG_parity(z);
+        BIG_shr(z, 1);
+        if (bt) FP2_mul(r, r, &w);
+        if (BIG_comp(z, zilch) == 0) break;
+        FP2_sqr(&w, &w);
+    }
+    FP2_reduce(r);
+} */
+
+/* test for x a QR */
+int YYY::FP2_qr(FP2 *x,FP *h)
+{ /* test x^(p^2-1)/2 = 1 */
+
+    FP2 c;
+    FP2_conj(&c,x);
+    FP2_mul(&c,&c,x);
+
+    return FP_qr(&(c.a),h);
+}
+
+/* sqrt(a+ib) = sqrt(a+sqrt(a*a-n*b*b))/2+ib/(2*sqrt(a+sqrt(a*a-n*b*b))/2) */
+
+void YYY::FP2_sqrt(FP2 *w, FP2 *u, FP *h)
+{
+    FP w1, w2, w3, w4, hint;
+    FP2 nw;
+    int sgn,qr;
+    FP2_copy(w, u);
+    if (FP2_iszilch(w)) return;
+
+    FP_sqr(&w1, &(w->b));  // b^2
+    FP_sqr(&w2, &(w->a));  // a^2
+    FP_add(&w1, &w1, &w2); FP_norm(&w1);  // a^2+b^2
+
+    FP_sqrt(&w1, &w1, h);              // sqrt(a^2+b^2)  - could use an input hint to avoid exp!
+
+    FP_add(&w2, &(w->a), &w1);            // a+sqrt(a^2+b^2)
+    FP_norm(&w2);
+    FP_div2(&w2, &w2);                    // w2=(a+sqrt(a^2+b^2))/2
+// **
+    FP_div2(&w1,&(w->b));                   // w1=b/2
+    qr=FP_qr(&w2,&hint);                    // only exp!
+
+// tweak hint
+    FP_neg(&w3,&hint); FP_norm(&w3);    // QNR = -1
+    FP_neg(&w4,&w2); FP_norm(&w4);
+
+    FP_cmove(&w2,&w4,1-qr);
+    FP_cmove(&hint,&w3,1-qr);
+
+    FP_sqrt(&(w->a),&w2,&hint);             // a=sqrt(w2)
+    FP_inv(&w3,&w2,&hint);                  // w3=1/w2
+    FP_mul(&w3,&w3,&(w->a));                // w3=1/sqrt(w2)
+    FP_mul(&(w->b),&w3,&w1);                // b=(b/2)*1/sqrt(w2)
+    FP_copy(&w4,&(w->a));
+
+    FP_cmove(&(w->a),&(w->b),1-qr);
+    FP_cmove(&(w->b),&w4,1-qr);
+
+
+/*
+
+    FP_sqrt(&(w->a),&w2,&hint);             // a=sqrt(w2)
+    FP_inv(&w3,&w2,&hint);                  // w3=1/w2
+    FP_mul(&w3,&w3,&(w->a));                // w3=1/sqrt(w2)
+    FP_mul(&(w->b),&w3,&w1);                // b=(b/2)*1/sqrt(w2)
+
+// tweak hint
+    FP_neg(&hint,&hint); FP_norm(&hint);    // QNR = -1
+    FP_neg(&w2,&w2); FP_norm(&w2);
+
+    FP_sqrt(&w4,&w2,&hint);                 // w4=sqrt(w2)
+    FP_inv(&w3,&w2,&hint);                  // w3=1/w2    
+    FP_mul(&w3,&w3,&w4);                    // w3=1/sqrt(w2)
+    FP_mul(&w3,&w3,&w1);                    // w3=(b/2)*1/sqrt(w2)
+
+    FP_cmove(&(w->a),&w3,1-qr);
+    FP_cmove(&(w->b),&w4,1-qr);
+*/
+// return +ve root
+    sgn=FP2_sign(w);
+    FP2_neg(&nw,w); FP2_norm(&nw);
+    FP2_cmove(w,&nw,sgn);
+}
+
+void YYY::FP2_rand(FP2 *x,csprng *rng)
+{
+    FP_rand(&(x->a),rng);
+    FP_rand(&(x->b),rng);
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp2.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp2.h
new file mode 100644
index 0000000..58c03fd
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp2.h
@@ -0,0 +1,306 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP2_YYY_H
+#define FP2_YYY_H
+
+#include "fp_YYY.h"
+
+using namespace core;
+
+namespace YYY {
+
+/**
+	@brief FP2 Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    FP a; /**< real part of FP2 */
+    FP b; /**< imaginary part of FP2 */
+} FP2;
+
+/* FP2 prototypes */
+
+/**	@brief Tests for FP2 equal to zero
+ *
+	@param x FP2 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP2_iszilch(FP2 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP2 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP2_islarger(FP2 *x);
+
+
+/**	@brief Serialize out FP2  
+ *
+    @param b buffer for output
+	@param x FP2 number to be serialized
+ */
+extern void FP2_toBytes(char *b,FP2 *x);
+
+/**	@brief Serialize in FP2  
+ *
+	@param x FP2 number to be serialized
+    @param b buffer for input
+ */
+extern void FP2_fromBytes(FP2 *x,char *b);
+
+/**	@brief Conditional copy of FP2 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP2 instance, set to y if s!=0
+	@param y another FP2 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP2_cmove(FP2 *x, FP2 *y, int s);
+/**	@brief Tests for FP2 equal to one
+ *
+	@param x FP2 instance to be tested
+	@return 1 if x=1, else returns 0
+ */
+extern int FP2_isunity(FP2 *x);
+/**	@brief Tests for equality of two FP2s
+ *
+	@param x FP2 instance to be compared
+	@param y FP2 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP2_equals(FP2 *x, FP2 *y);
+/**	@brief Initialise FP2 from two FP numbers
+ *
+	@param x FP2 instance to be initialised
+	@param a FP to form real part of FP2
+	@param b FP to form imaginary part of FP2
+ */
+extern void FP2_from_FPs(FP2 *x, FP *a, FP *b);
+/**	@brief Initialise FP2 from two BIG integers
+ *
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+	@param b BIG to form imaginary part of FP2
+ */
+extern void FP2_from_BIGs(FP2 *x, XXX::BIG a, XXX::BIG b);
+
+
+/**	@brief Initialise FP2 from two integers
+ *
+	@param x FP2 instance to be initialised
+	@param a int to form real part of FP2
+	@param b int to form imaginary part of FP2
+ */
+extern void FP2_from_ints(FP2 *x, int a, int b);
+
+
+
+/**	@brief Initialise FP2 from single FP
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param an FP to form real part of FP2
+ */
+extern void FP2_from_FP(FP2 *x, FP *a);
+/**	@brief Initialise FP2 from single BIG
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+ */
+extern void FP2_from_BIG(FP2 *x, XXX::BIG a);
+/**	@brief Copy FP2 to another FP2
+ *
+	@param x FP2 instance, on exit = y
+	@param y FP2 instance to be copied
+ */
+extern void FP2_copy(FP2 *x, FP2 *y);
+/**	@brief Set FP2 to zero
+ *
+	@param x FP2 instance to be set to zero
+ */
+extern void FP2_zero(FP2 *x);
+/**	@brief Set FP2 to unity
+ *
+	@param x FP2 instance to be set to one
+ */
+extern void FP2_one(FP2 *x);
+
+/**	@brief Copy from ROM to an FP2
+ *
+	@param w FP2 number to be copied to
+	@param a BIG real part to be copied from ROM
+	@param b BIG imag part to be copied from ROM
+ */
+extern void FP2_rcopy(FP2 *w,const XXX::BIG a,const XXX::BIG b);
+
+/**	@brief Sign of FP2
+ *
+	@param x FP2 instance
+	@return "sign" of FP2
+ */
+extern int FP2_sign(FP2 *x);
+
+/**	@brief Negation of FP2
+ *
+	@param x FP2 instance, on exit = -y
+	@param y FP2 instance
+ */
+extern void FP2_neg(FP2 *x, FP2 *y);
+
+
+/**	@brief Conjugation of FP2
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP2 instance, on exit = conj(y)
+	@param y FP2 instance
+ */
+extern void FP2_conj(FP2 *x, FP2 *y);
+/**	@brief addition of two FP2s
+ *
+	@param x FP2 instance, on exit = y+z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_add(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief subtraction of two FP2s
+ *
+	@param x FP2 instance, on exit = y-z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_sub(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Multiplication of an FP2 by an FP
+ *
+	@param x FP2 instance, on exit = y*b
+	@param y FP2 instance
+	@param b FP residue
+ */
+extern void FP2_pmul(FP2 *x, FP2 *y, FP *b);
+/**	@brief Multiplication of an FP2 by a small integer
+ *
+	@param x FP2 instance, on exit = y*i
+	@param y FP2 instance
+	@param i an integer
+ */
+extern void FP2_imul(FP2 *x, FP2 *y, int i);
+/**	@brief Squaring an FP2
+ *
+	@param x FP2 instance, on exit = y^2
+	@param y FP2 instance
+ */
+extern void FP2_sqr(FP2 *x, FP2 *y);
+/**	@brief Multiplication of two FP2s
+ *
+	@param x FP2 instance, on exit = y*z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_mul(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Formats and outputs an FP2 to the console
+ *
+	@param x FP2 instance
+ */
+extern void FP2_output(FP2 *x);
+/**	@brief Formats and outputs an FP2 to the console in raw form (for debugging)
+ *
+	@param x FP2 instance
+ */
+extern void FP2_rawoutput(FP2 *x);
+/**	@brief Inverting an FP2
+ *
+	@param x FP2 instance, on exit = 1/y
+	@param y FP2 instance
+ */
+extern void FP2_inv(FP2 *x, FP2 *y, FP *h);
+/**	@brief Divide an FP2 by 2
+ *
+	@param x FP2 instance, on exit = y/2
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_div2(FP2 *x, FP2 *y);
+/**	@brief Multiply an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x*(1+sqrt(-1))
+ */
+extern void FP2_mul_ip(FP2 *x);
+
+/**	@brief Divide an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x/(1+sqrt(-1))
+ */
+extern void FP2_div_ip(FP2 *x);
+/**	@brief Normalises the components of an FP2
+ *
+	@param x FP2 instance to be normalised
+ */
+extern void FP2_norm(FP2 *x);
+/**	@brief Reduces all components of possibly unreduced FP2 mod Modulus
+ *
+	@param x FP2 instance, on exit reduced mod Modulus
+ */
+extern void FP2_reduce(FP2 *x);
+/**	@brief Raises an FP2 to the power of a BIG
+ *
+	@param x FP2 instance, on exit = y^b
+	@param y FP2 instance
+	@param b BIG number
+ */
+extern void FP2_pow(FP2 *x, FP2 *y, XXX::BIG b);
+
+/**	@brief Test FP2 for QR
+ *
+	@param x FP2 instance
+    @param h optional generated hint
+	@return true or false
+ */
+extern int FP2_qr(FP2 *x,FP *h);
+
+
+/**	@brief Square root of an FP2
+ *
+	@param x FP2 instance, on exit = sqrt(y)
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_sqrt(FP2 *x, FP2 *y, FP *h);
+
+/**	@brief Multiply an FP2 by sqrt(-1)
+ *
+	Note that -1 is QNR
+	@param x FP2 instance, on exit = x*sqrt(-1)
+ */
+extern void FP2_times_i(FP2 *x);
+
+/**	@brief Generate random FP2
+ *
+	@param x random FP2 number
+	@param rng random number generator
+ */
+extern void FP2_rand(FP2 *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp24.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp24.cpp
new file mode 100644
index 0000000..5c821dc
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp24.cpp
@@ -0,0 +1,1018 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* CORE Fp^24 functions */
+/* SU=m, m is Stack Usage (no lazy )*/
+/* FP24 elements are of the form a+i.b+i^2.c */
+
+#include "fp24_YYY.h"
+#include "config_curve_ZZZ.h"
+
+using namespace XXX;
+
+/* return 1 if b==c, no branching */
+static int teq(sign32 b, sign32 c)
+{
+    sign32 x = b ^ c;
+    x -= 1; // if x=0, x now -1
+    return (int)((x >> 31) & 1);
+}
+
+
+/* Constant time select from pre-computed table */
+static void FP24_select(YYY::FP24 *f, YYY::FP24 g[], sign32 b)
+{
+    YYY::FP24 invf;
+    sign32 m = b >> 31;
+    sign32 babs = (b ^ m) - m;
+
+    babs = (babs - 1) / 2;
+
+    FP24_cmove(f, &g[0], teq(babs, 0)); // conditional move
+    FP24_cmove(f, &g[1], teq(babs, 1));
+    FP24_cmove(f, &g[2], teq(babs, 2));
+    FP24_cmove(f, &g[3], teq(babs, 3));
+    FP24_cmove(f, &g[4], teq(babs, 4));
+    FP24_cmove(f, &g[5], teq(babs, 5));
+    FP24_cmove(f, &g[6], teq(babs, 6));
+    FP24_cmove(f, &g[7], teq(babs, 7));
+
+    FP24_copy(&invf, f);
+    FP24_conj(&invf, &invf); // 1/f
+    FP24_cmove(f, &invf, (int)(m & 1));
+}
+
+/* test x==0 ? */
+/* SU= 8 */
+int YYY::FP24_iszilch(FP24 *x)
+{
+    if (FP8_iszilch(&(x->a)) && FP8_iszilch(&(x->b)) && FP8_iszilch(&(x->c))) return 1;
+    return 0;
+}
+
+/* test x==1 ? */
+/* SU= 8 */
+int YYY::FP24_isunity(FP24 *x)
+{
+    if (FP8_isunity(&(x->a)) && FP8_iszilch(&(x->b)) && FP8_iszilch(&(x->c))) return 1;
+    return 0;
+}
+
+/* FP24 copy w=x */
+/* SU= 16 */
+void YYY::FP24_copy(FP24 *w, FP24 *x)
+{
+    if (x == w) return;
+    FP8_copy(&(w->a), &(x->a));
+    FP8_copy(&(w->b), &(x->b));
+    FP8_copy(&(w->c), &(x->c));
+    w->type = x->type;
+}
+
+/* FP24 w=1 */
+/* SU= 8 */
+void YYY::FP24_one(FP24 *w)
+{
+    FP8_one(&(w->a));
+    FP8_zero(&(w->b));
+    FP8_zero(&(w->c));
+    w->type = FP_UNITY;
+
+}
+
+void YYY::FP24_zero(FP24 *w)
+{
+    FP8_zero(&(w->a));
+    FP8_zero(&(w->b));
+    FP8_zero(&(w->c));
+    w->type = FP_ZILCH;
+
+}
+
+/* return 1 if x==y, else 0 */
+/* SU= 16 */
+int YYY::FP24_equals(FP24 *x, FP24 *y)
+{
+    if (FP8_equals(&(x->a), &(y->a)) && FP8_equals(&(x->b), &(y->b)) && FP8_equals(&(x->c), &(y->c)))
+        return 1;
+    return 0;
+}
+
+/* Set w=conj(x) */
+/* SU= 8 */
+void YYY::FP24_conj(FP24 *w, FP24 *x)
+{
+    FP24_copy(w, x);
+    FP8_conj(&(w->a), &(w->a));
+    FP8_nconj(&(w->b), &(w->b));
+    FP8_conj(&(w->c), &(w->c));
+}
+
+/* Create FP24 from FP8 */
+/* SU= 8 */
+void YYY::FP24_from_FP8(FP24 *w, FP8 *a)
+{
+    FP8_copy(&(w->a), a);
+    FP8_zero(&(w->b));
+    FP8_zero(&(w->c));
+    w->type = FP_SPARSEST;
+}
+
+/* Create FP24 from 3 FP8's */
+/* SU= 16 */
+void YYY::FP24_from_FP8s(FP24 *w, FP8 *a, FP8 *b, FP8 *c)
+{
+    FP8_copy(&(w->a), a);
+    FP8_copy(&(w->b), b);
+    FP8_copy(&(w->c), c);
+    w->type = FP_DENSE;
+}
+
+/* Granger-Scott Unitary Squaring. This does not benefit from lazy reduction */
+/* SU= 600 */
+void YYY::FP24_usqr(FP24 *w, FP24 *x)
+{
+    FP8 A, B, C, D;
+
+    FP8_copy(&A, &(x->a));
+
+    FP8_sqr(&(w->a), &(x->a));
+    FP8_add(&D, &(w->a), &(w->a));
+    FP8_add(&(w->a), &D, &(w->a));
+
+    FP8_norm(&(w->a));
+    FP8_nconj(&A, &A);
+
+    FP8_add(&A, &A, &A);
+    FP8_add(&(w->a), &(w->a), &A);
+    FP8_sqr(&B, &(x->c));
+    FP8_times_i(&B);
+
+    FP8_add(&D, &B, &B);
+    FP8_add(&B, &B, &D);
+    FP8_norm(&B);
+
+    FP8_sqr(&C, &(x->b));
+
+    FP8_add(&D, &C, &C);
+    FP8_add(&C, &C, &D);
+
+    FP8_norm(&C);
+    FP8_conj(&(w->b), &(x->b));
+    FP8_add(&(w->b), &(w->b), &(w->b));
+    FP8_nconj(&(w->c), &(x->c));
+
+    FP8_add(&(w->c), &(w->c), &(w->c));
+    FP8_add(&(w->b), &B, &(w->b));
+    FP8_add(&(w->c), &C, &(w->c));
+    w->type = FP_DENSE;
+
+    FP24_reduce(w);     /* reduce here as in pow function repeated squarings would trigger multiple reductions */
+}
+
+/* FP24 squaring w=x^2 */
+/* SU= 600 */
+void YYY::FP24_sqr(FP24 *w, FP24 *x)
+{
+    /* Use Chung-Hasan SQR2 method from http://cacr.uwaterloo.ca/techreports/2006/cacr2006-24.pdf */
+
+    FP8 A, B, C, D;
+
+    if (x->type <= FP_UNITY)
+    {
+        FP24_copy(w, x);
+        return;
+    }
+
+    FP8_sqr(&A, &(x->a));
+    FP8_mul(&B, &(x->b), &(x->c));
+    FP8_add(&B, &B, &B);
+    FP8_norm(&B);
+    FP8_sqr(&C, &(x->c));
+
+    FP8_mul(&D, &(x->a), &(x->b));
+    FP8_add(&D, &D, &D);
+
+    FP8_add(&(w->c), &(x->a), &(x->c));
+    FP8_add(&(w->c), &(x->b), &(w->c));
+    FP8_norm(&(w->c));
+
+    FP8_sqr(&(w->c), &(w->c));
+
+    FP8_copy(&(w->a), &A);
+    FP8_add(&A, &A, &B);
+
+    FP8_norm(&A);
+
+    FP8_add(&A, &A, &C);
+    FP8_add(&A, &A, &D);
+
+    FP8_norm(&A);
+
+    FP8_neg(&A, &A);
+    FP8_times_i(&B);
+    FP8_times_i(&C);
+
+    FP8_add(&(w->a), &(w->a), &B);
+    FP8_add(&(w->b), &C, &D);
+    FP8_add(&(w->c), &(w->c), &A);
+
+    if (x->type == FP_SPARSER || x->type == FP_SPARSEST)
+        w->type = FP_SPARSE;
+    else
+        w->type = FP_DENSE;
+
+    FP24_norm(w);
+}
+
+// Use FP24_mul when both multiplicands are dense
+// Use FP24smul when it is known that both multiplicands are line functions
+// Use FP24ssmul when it is suspected that one or both multiplicands could have some sparsity
+
+
+/* FP24 full multiplication w=w*y */
+void YYY::FP24_mul(FP24 *w, FP24 *y)
+{
+    FP8 z0, z1, z2, z3, t0, t1;
+
+    FP8_mul(&z0, &(w->a), &(y->a));
+    FP8_mul(&z2, &(w->b), &(y->b)); //
+
+    FP8_add(&t0, &(w->a), &(w->b));
+    FP8_add(&t1, &(y->a), &(y->b)); //
+
+    FP8_norm(&t0);
+    FP8_norm(&t1);
+
+    FP8_mul(&z1, &t0, &t1);
+    FP8_add(&t0, &(w->b), &(w->c));
+    FP8_add(&t1, &(y->b), &(y->c)); //
+
+    FP8_norm(&t0);
+    FP8_norm(&t1);
+
+    FP8_mul(&z3, &t0, &t1);
+
+    FP8_neg(&t0, &z0);
+    FP8_neg(&t1, &z2);
+
+    FP8_add(&z1, &z1, &t0); // z1=z1-z0
+    FP8_add(&(w->b), &z1, &t1); // z1=z1-z2
+    FP8_add(&z3, &z3, &t1);      // z3=z3-z2
+    FP8_add(&z2, &z2, &t0);      // z2=z2-z0
+
+    FP8_add(&t0, &(w->a), &(w->c));
+    FP8_add(&t1, &(y->a), &(y->c));
+
+    FP8_norm(&t0);
+    FP8_norm(&t1);
+
+    FP8_mul(&t0, &t1, &t0);
+    FP8_add(&z2, &z2, &t0);
+
+    FP8_mul(&t0, &(w->c), &(y->c));
+    FP8_neg(&t1, &t0);
+
+    FP8_add(&(w->c), &z2, &t1);
+    FP8_add(&z3, &z3, &t1);
+    FP8_times_i(&t0);
+    FP8_add(&(w->b), &(w->b), &t0);
+    FP8_norm(&z3);
+    FP8_times_i(&z3);
+    FP8_add(&(w->a), &z0, &z3);
+
+    FP24_norm(w);
+    w->type = FP_DENSE;
+}
+
+/* FP24 full multiplication w=w*y */
+/* Supports sparse multiplicands */
+/* Usually w is denser than y */
+void YYY::FP24_ssmul(FP24 *w, FP24 *y)
+{
+    FP8 z0, z1, z2, z3, t0, t1;
+    if (w->type == FP_UNITY)
+    {
+        FP24_copy(w, y);
+        return;
+    }
+    if (y->type == FP_UNITY)
+        return;
+
+    if (y->type >= FP_SPARSE)
+    {
+        FP8_mul(&z0, &(w->a), &(y->a)); // xa.ya   always 11x11
+
+#if SEXTIC_TWIST_ZZZ == M_TYPE
+        if (y->type == FP_SPARSE || w->type == FP_SPARSE)
+        {
+            FP4_mul(&z2.b, &(w->b).b, &(y->b).b);
+            FP4_zero(&z2.a);
+            if (y->type != FP_SPARSE)
+                FP4_mul(&z2.a, &(w->b).b, &(y->b).a);
+            if (w->type != FP_SPARSE)
+                FP4_mul(&z2.a, &(w->b).a, &(y->b).b);
+            FP8_times_i(&z2);
+        }
+        else
+#endif
+            FP8_mul(&z2, &(w->b), &(y->b)); // xb.yb  could be 00x00 or 01x01 or or 10x10 or 11x00 or 11x10 or 11x01 or 11x11
+
+        FP8_add(&t0, &(w->a), &(w->b)); // (xa+xb)
+        FP8_add(&t1, &(y->a), &(y->b)); // (ya+yb)
+
+        FP8_norm(&t0);
+        FP8_norm(&t1);
+
+        FP8_mul(&z1, &t0, &t1); // (xa+xb)(ya+yb)  always 11x11
+        FP8_add(&t0, &(w->b), &(w->c)); // (xb+xc)
+        FP8_add(&t1, &(y->b), &(y->c)); // (yb+yc)
+
+        FP8_norm(&t0);
+        FP8_norm(&t1);
+
+        FP8_mul(&z3, &t0, &t1); // (xb+xc)(yb+yc)   could be anything...
+        FP8_neg(&t0, &z0);      // -(xa.ya)
+        FP8_neg(&t1, &z2);      // -(xb.yb)
+
+        FP8_add(&z1, &z1, &t0);
+        FP8_add(&(w->b), &z1, &t1); // /wb = (xa+xb)(ya+yb) -(xa.ya) -(xb.yb)                     = xa.yb + xb.ya
+
+        FP8_add(&z3, &z3, &t1);      // (xb+xc)(yb+yc) -(xb.yb)
+        FP8_add(&z2, &z2, &t0);      // (xb.yb) - (xa.ya)
+
+        FP8_add(&t0, &(w->a), &(w->c)); // (xa+xc)
+        FP8_add(&t1, &(y->a), &(y->c)); // (ya+yc)
+
+        FP8_norm(&t0);
+        FP8_norm(&t1);
+
+        FP8_mul(&t0, &t1, &t0); // (xa+xc)(ya+yc)    always 11x11
+        FP8_add(&z2, &z2, &t0); // (xb.yb) - (xa.ya) + (xa+xc)(ya+yc)
+
+#if SEXTIC_TWIST_ZZZ == D_TYPE
+        if (y->type == FP_SPARSE || w->type == FP_SPARSE)
+        {
+            FP4_mul(&t0.a, &(w->c).a, &(y->c).a);
+            FP4_zero(&t0.b);
+            if (y->type != FP_SPARSE)
+                FP4_mul(&t0.b, &(w->c).a, &(y->c).b);
+            if (w->type != FP_SPARSE)
+                FP4_mul(&t0.b, &(w->c).b, &(y->c).a);
+        }
+        else
+#endif
+            FP8_mul(&t0, &(w->c), &(y->c)); // (xc.yc)  could be anything
+
+        FP8_neg(&t1, &t0);            // -(xc.yc)
+
+        FP8_add(&(w->c), &z2, &t1);     // wc = (xb.yb) - (xa.ya) + (xa+xc)(ya+yc) - (xc.yc)    =  xb.yb + xc.ya + xa.yc
+        FP8_add(&z3, &z3, &t1);         // (xb+xc)(yb+yc) -(xb.yb) - (xc.yc)                    =  xb.yc + xc.yb
+        FP8_times_i(&t0);               // i.(xc.yc)
+        FP8_add(&(w->b), &(w->b), &t0); // wb = (xa+xb)(ya+yb) -(xa.ya) -(xb.yb) +i(xc.yc)
+        FP8_norm(&z3);
+        FP8_times_i(&z3);               // i[(xb+xc)(yb+yc) -(xb.yb) - (xc.yc)]                 = i(xb.yc + xc.yb)
+        FP8_add(&(w->a), &z0, &z3);     // wa = xa.ya + i(xb.yc + xc.yb)
+    } else {
+        if (w->type == FP_SPARSER || w->type == FP_SPARSEST)
+        {
+            FP24_smul(w, y);
+            return;
+        }
+// dense by sparser - 13m
+#if SEXTIC_TWIST_ZZZ == D_TYPE
+        FP8_copy(&z3, &(w->b));
+        FP8_mul(&z0, &(w->a), &(y->a));
+
+        if (y->type == FP_SPARSEST)
+            FP8_tmul(&z2, &(w->b), &(y->b).a.a.a);
+        else
+            FP8_pmul(&z2, &(w->b), &(y->b).a);
+
+
+        FP8_add(&(w->b), &(w->a), &(w->b));
+        FP8_copy(&t1, &(y->a));
+        FP4_add(&t1.a, &t1.a, &(y->b).a);
+
+        FP8_norm(&t1);
+        FP8_norm(&(w->b));
+
+        FP8_mul(&(w->b), &(w->b), &t1);
+        FP8_add(&z3, &z3, &(w->c));
+        FP8_norm(&z3);
+
+        if (y->type == FP_SPARSEST)
+            FP8_tmul(&z3, &z3, &(y->b).a.a.a);
+        else
+            FP8_pmul(&z3, &z3, &(y->b).a);
+
+        FP8_neg(&t0, &z0);
+        FP8_neg(&t1, &z2);
+
+        FP8_add(&(w->b), &(w->b), &t0); // z1=z1-z0
+        FP8_add(&(w->b), &(w->b), &t1); // z1=z1-z2
+
+        FP8_add(&z3, &z3, &t1);      // z3=z3-z2
+        FP8_add(&z2, &z2, &t0);      // z2=z2-z0
+
+        FP8_add(&t0, &(w->a), &(w->c));
+        FP8_norm(&t0);
+        FP8_norm(&z3);
+
+        FP8_mul(&t0, &(y->a), &t0);
+        FP8_add(&(w->c), &z2, &t0);
+
+        FP8_times_i(&z3);
+        FP8_add(&(w->a), &z0, &z3);
+#endif
+#if SEXTIC_TWIST_ZZZ == M_TYPE
+        FP8_mul(&z0, &(w->a), &(y->a));
+        FP8_add(&t0, &(w->a), &(w->b));
+        FP8_norm(&t0);
+
+        FP8_mul(&z1, &t0, &(y->a));
+        FP8_add(&t0, &(w->b), &(w->c));
+        FP8_norm(&t0);
+
+
+        if (y->type == FP_SPARSEST)
+            FP8_tmul(&z3, &t0, &(y->c).b.a.a);
+        else
+            FP8_pmul(&z3, &t0, &(y->c).b);
+
+
+        FP8_times_i(&z3);
+
+        FP8_neg(&t0, &z0);
+        FP8_add(&z1, &z1, &t0); // z1=z1-z0
+
+        FP8_copy(&(w->b), &z1);
+        FP8_copy(&z2, &t0);
+
+        FP8_add(&t0, &(w->a), &(w->c));
+        FP8_add(&t1, &(y->a), &(y->c));
+
+        FP8_norm(&t0);
+        FP8_norm(&t1);
+
+        FP8_mul(&t0, &t1, &t0);
+        FP8_add(&z2, &z2, &t0);
+
+        if (y->type == FP_SPARSEST)
+            FP8_tmul(&t0, &(w->c), &(y->c).b.a.a);
+        else
+            FP8_pmul(&t0, &(w->c), &(y->c).b);
+
+
+        FP8_times_i(&t0);
+        FP8_neg(&t1, &t0);
+        FP8_times_i(&t0);
+
+        FP8_add(&(w->c), &z2, &t1);
+        FP8_add(&z3, &z3, &t1);
+
+        FP8_add(&(w->b), &(w->b), &t0);
+        FP8_norm(&z3);
+        FP8_times_i(&z3);
+        FP8_add(&(w->a), &z0, &z3);
+#endif
+    }
+    w->type = FP_DENSE;
+    FP24_norm(w);
+}
+
+/* FP24 multiplication w=w*y */
+/* catering for special case that arises from special form of ATE pairing line function */
+/* w and y are both sparser line functions - cost = 6m */
+void YYY::FP24_smul(FP24 *w, FP24 *y)
+{
+    FP4 w1, w2, w3, ta, tb, tc, td, te, t;
+
+
+#if SEXTIC_TWIST_ZZZ == D_TYPE
+    FP4_mul(&w1, &(w->a).a, &(y->a).a); // A1.A2
+    FP4_mul(&w2, &(w->a).b, &(y->a).b); // B1.B2
+
+    if (y->type == FP_SPARSEST || w->type == FP_SPARSEST)
+    {
+        if (y->type == FP_SPARSEST && w->type == FP_SPARSEST)
+        {
+            FP4_zero(&w3);
+            FP_mul(&w3.a.a, &(w->b).a.a.a, &(y->b).a.a.a);
+        } else {
+            if (y->type != FP_SPARSEST)
+                FP4_qmul(&w3, &(y->b).a, &(w->b).a.a.a);
+            if (w->type != FP_SPARSEST)
+                FP4_qmul(&w3, &(w->b).a, &(y->b).a.a.a);
+        }
+    }
+    else
+        FP4_mul(&w3, &(w->b).a, &(y->b).a); // C1.C2
+
+    FP4_add(&ta, &(w->a).a, &(w->a).b); // A1+B1
+    FP4_add(&tb, &(y->a).a, &(y->a).b); // A2+B2
+    FP4_norm(&ta);
+    FP4_norm(&tb);
+    FP4_mul(&tc, &ta, &tb);         // (A1+B1)(A2+B2)
+    FP4_add(&t, &w1, &w2);
+    FP4_neg(&t, &t);
+    FP4_add(&tc, &tc, &t);          // (A1+B1)(A2+B2)-A1.A2-B1*B2 =  (A1.B2+A2.B1)
+
+    FP4_add(&ta, &(w->a).a, &(w->b).a); // A1+C1
+    FP4_add(&tb, &(y->a).a, &(y->b).a); // A2+C2
+    FP4_norm(&ta);
+    FP4_norm(&tb);
+    FP4_mul(&td, &ta, &tb);         // (A1+C1)(A2+C2)
+    FP4_add(&t, &w1, &w3);
+    FP4_neg(&t, &t);
+    FP4_add(&td, &td, &t);          // (A1+C1)(A2+C2)-A1.A2-C1*C2 =  (A1.C2+A2.C1)
+
+    FP4_add(&ta, &(w->a).b, &(w->b).a); // B1+C1
+    FP4_add(&tb, &(y->a).b, &(y->b).a); // B2+C2
+    FP4_norm(&ta);
+    FP4_norm(&tb);
+    FP4_mul(&te, &ta, &tb);         // (B1+C1)(B2+C2)
+    FP4_add(&t, &w2, &w3);
+    FP4_neg(&t, &t);
+    FP4_add(&te, &te, &t);          // (B1+C1)(B2+C2)-B1.B2-C1*C2 =  (B1.C2+B2.C1)
+
+    FP4_times_i(&w2);
+    FP4_add(&w1, &w1, &w2);
+    FP8_from_FP4s(&(w->a), &w1, &tc);
+    FP8_from_FP4s(&(w->b), &td, &te); // only norm these 2
+    FP8_from_FP4(&(w->c), &w3);
+
+    FP8_norm(&(w->a));
+    FP8_norm(&(w->b));
+#endif
+#if SEXTIC_TWIST_ZZZ == M_TYPE
+    FP4_mul(&w1, &(w->a).a, &(y->a).a); // A1.A2
+    FP4_mul(&w2, &(w->a).b, &(y->a).b); // B1.B2
+
+    if (y->type == FP_SPARSEST || w->type == FP_SPARSEST)
+    {
+        if (y->type == FP_SPARSEST && w->type == FP_SPARSEST)
+        {
+            FP4_zero(&w3);
+            FP_mul(&w3.a.a, &(w->c).b.a.a, &(y->c).b.a.a);
+        } else {
+            if (y->type != FP_SPARSEST)
+                FP4_qmul(&w3, &(y->c).b, &(w->c).b.a.a);
+            if (w->type != FP_SPARSEST)
+                FP4_qmul(&w3, &(w->c).b, &(y->c).b.a.a);
+        }
+    }
+    else
+        FP4_mul(&w3, &(w->c).b, &(y->c).b); // F1.F2
+
+    FP4_add(&ta, &(w->a).a, &(w->a).b); // A1+B1
+    FP4_add(&tb, &(y->a).a, &(y->a).b); // A2+B2
+    FP4_norm(&ta);
+    FP4_norm(&tb);
+    FP4_mul(&tc, &ta, &tb);         // (A1+B1)(A2+B2)
+    FP4_add(&t, &w1, &w2);
+    FP4_neg(&t, &t);
+    FP4_add(&tc, &tc, &t);          // (A1+B1)(A2+B2)-A1.A2-B1*B2 =  (A1.B2+A2.B1)
+
+    FP4_add(&ta, &(w->a).a, &(w->c).b); // A1+F1
+    FP4_add(&tb, &(y->a).a, &(y->c).b); // A2+F2
+    FP4_norm(&ta);
+    FP4_norm(&tb);
+    FP4_mul(&td, &ta, &tb);         // (A1+F1)(A2+F2)
+    FP4_add(&t, &w1, &w3);
+    FP4_neg(&t, &t);
+    FP4_add(&td, &td, &t);          // (A1+F1)(A2+F2)-A1.A2-F1*F2 =  (A1.F2+A2.F1)
+
+    FP4_add(&ta, &(w->a).b, &(w->c).b); // B1+F1
+    FP4_add(&tb, &(y->a).b, &(y->c).b); // B2+F2
+    FP4_norm(&ta);
+    FP4_norm(&tb);
+    FP4_mul(&te, &ta, &tb);         // (B1+F1)(B2+F2)
+    FP4_add(&t, &w2, &w3);
+    FP4_neg(&t, &t);
+    FP4_add(&te, &te, &t);          // (B1+F1)(B2+F2)-B1.B2-F1*F2 =  (B1.F2+B2.F1)
+
+    FP4_times_i(&w2);
+    FP4_add(&w1, &w1, &w2);
+    FP8_from_FP4s(&(w->a), &w1, &tc);
+
+    FP4_times_i(&w3);
+    FP4_norm(&w3);
+    FP8_from_FP4H(&(w->b), &w3);
+
+    FP4_norm(&te);
+    FP4_times_i(&te);
+    FP8_from_FP4s(&(w->c), &te, &td);
+
+    FP8_norm(&(w->a));
+    FP8_norm(&(w->c));
+#endif
+
+    w->type = FP_SPARSE;
+}
+
+/* Set w=1/x */
+/* SU= 600 */
+void YYY::FP24_inv(FP24 *w, FP24 *x)
+{
+    FP8 f0, f1, f2, f3;
+
+    FP8_sqr(&f0, &(x->a));
+    FP8_mul(&f1, &(x->b), &(x->c));
+    FP8_times_i(&f1);
+    FP8_sub(&f0, &f0, &f1); /* y.a */
+    FP8_norm(&f0);
+
+    FP8_sqr(&f1, &(x->c));
+    FP8_times_i(&f1);
+    FP8_mul(&f2, &(x->a), &(x->b));
+    FP8_sub(&f1, &f1, &f2); /* y.b */
+    FP8_norm(&f1);
+
+    FP8_sqr(&f2, &(x->b));
+    FP8_mul(&f3, &(x->a), &(x->c));
+    FP8_sub(&f2, &f2, &f3); /* y.c */
+    FP8_norm(&f2);
+
+    FP8_mul(&f3, &(x->b), &f2);
+    FP8_times_i(&f3);
+    FP8_mul(&(w->a), &f0, &(x->a));
+    FP8_add(&f3, &(w->a), &f3);
+    FP8_mul(&(w->c), &f1, &(x->c));
+    FP8_times_i(&(w->c));
+
+    FP8_add(&f3, &(w->c), &f3);
+    FP8_norm(&f3);
+
+    FP8_inv(&f3, &f3, NULL);
+    FP8_mul(&(w->a), &f0, &f3);
+    FP8_mul(&(w->b), &f1, &f3);
+    FP8_mul(&(w->c), &f2, &f3);
+    w->type = FP_DENSE;
+}
+
+/* constant time powering by small integer of max length bts */
+
+void YYY::FP24_pinpow(FP24 *r, int e, int bts)
+{
+    int i, b;
+    FP24 R[2];
+
+    FP24_one(&R[0]);
+    FP24_copy(&R[1], r);
+
+    for (i = bts - 1; i >= 0; i--)
+    {
+        b = (e >> i) & 1;
+        FP24_mul(&R[1 - b], &R[b]);
+        FP24_usqr(&R[b], &R[b]);
+    }
+    FP24_copy(r, &R[0]);
+}
+
+/* Compressed powering of unitary elements y=x^(e mod r) */
+
+/*
+void YYY::FP24_compow(FP8 *c, FP24 *x, BIG e, BIG r)
+{
+    FP24 g1, g2;
+    FP8 cp, cpm1, cpm2;
+    FP2 f;
+    BIG q, a, b, m;
+
+    BIG_rcopy(a, Fra);
+    BIG_rcopy(b, Frb);
+    FP2_from_BIGs(&f, a, b);
+
+    BIG_rcopy(q, Modulus);
+
+    FP24_copy(&g1, x);
+    FP24_copy(&g2, x);
+
+    BIG_copy(m, q);
+    BIG_mod(m, r);
+
+    BIG_copy(a, e);
+    BIG_mod(a, m);
+
+    BIG_copy(b, e);
+    BIG_sdiv(b, m);
+
+    FP24_trace(c, &g1);
+
+    if (BIG_iszilch(b))
+    {
+        FP8_xtr_pow(c, c, e);
+        return;
+    }
+
+    FP24_frob(&g2, &f, 1);
+    FP24_trace(&cp, &g2);
+    FP24_conj(&g1, &g1);
+    FP24_mul(&g2, &g1);
+    FP24_trace(&cpm1, &g2);
+    FP24_mul(&g2, &g1);
+
+    FP24_trace(&cpm2, &g2);
+
+    FP8_xtr_pow2(c, &cp, c, &cpm1, &cpm2, a, b);
+
+}
+*/
+/* Note this is simple square and multiply, so not side-channel safe */
+
+void YYY::FP24_pow(FP24 *r, FP24 *a, BIG b)
+{
+    FP24 w, sf;
+    BIG b1, b3;
+    int i, nb, bt;
+    BIG_copy(b1, b);
+    BIG_norm(b1);
+    BIG_pmul(b3, b1, 3);
+    BIG_norm(b3);
+
+    FP24_copy(&sf, a);
+    FP24_norm(&sf);
+    FP24_copy(&w, &sf);
+
+    if (BIG_iszilch(b3))
+    {
+        FP24_one(r);
+        return;
+    }
+
+    nb = BIG_nbits(b3);
+    for (i = nb - 2; i >= 1; i--)
+    {
+        FP24_usqr(&w, &w);
+        bt = BIG_bit(b3, i) - BIG_bit(b1, i);
+        if (bt == 1)
+            FP24_mul(&w, &sf);
+        if (bt == -1)
+        {
+            FP24_conj(&sf, &sf);
+            FP24_mul(&w, &sf);
+            FP24_conj(&sf, &sf);
+        }
+    }
+
+    FP24_copy(r, &w);
+    FP24_reduce(r);
+}
+
+/* p=q0^u0.q1^u1.q2^u2.q3^u3... */
+/* Side channel attack secure */
+// Bos & Costello https://eprint.iacr.org/2013/458.pdf
+// Faz-Hernandez & Longa & Sanchez  https://eprint.iacr.org/2013/158.pdf
+
+void YYY::FP24_pow8(FP24 *p, FP24 *q, BIG u[8])
+{
+    int i, j, k, nb, pb1, pb2, bt;
+    FP24 g1[8], g2[8], r;
+    BIG t[8], mt;
+    sign8 w1[NLEN_XXX * BASEBITS_XXX + 1];
+    sign8 s1[NLEN_XXX * BASEBITS_XXX + 1];
+    sign8 w2[NLEN_XXX * BASEBITS_XXX + 1];
+    sign8 s2[NLEN_XXX * BASEBITS_XXX + 1];
+//    FP fx,fy;
+//  FP2 X;
+    /*
+        FP_rcopy(&fx,Fra);
+        FP_rcopy(&fy,Frb);
+        FP2_from_FPs(&X,&fx,&fy);
+    */
+    for (i = 0; i < 8; i++)
+        BIG_copy(t[i], u[i]);
+
+// Precomputed table
+    FP24_copy(&g1[0], &q[0]); // q[0]
+    FP24_copy(&g1[1], &g1[0]);
+    FP24_mul(&g1[1], &q[1]); // q[0].q[1]
+    FP24_copy(&g1[2], &g1[0]);
+    FP24_mul(&g1[2], &q[2]); // q[0].q[2]
+    FP24_copy(&g1[3], &g1[1]);
+    FP24_mul(&g1[3], &q[2]); // q[0].q[1].q[2]
+    FP24_copy(&g1[4], &g1[0]);
+    FP24_mul(&g1[4], &q[3]); // q[0].q[3]
+    FP24_copy(&g1[5], &g1[1]);
+    FP24_mul(&g1[5], &q[3]); // q[0].q[1].q[3]
+    FP24_copy(&g1[6], &g1[2]);
+    FP24_mul(&g1[6], &q[3]); // q[0].q[2].q[3]
+    FP24_copy(&g1[7], &g1[3]);
+    FP24_mul(&g1[7], &q[3]); // q[0].q[1].q[2].q[3]
+
+    FP24_copy(&g2[0], &q[4]); // q[0]
+    FP24_copy(&g2[1], &g2[0]);
+    FP24_mul(&g2[1], &q[5]); // q[0].q[1]
+    FP24_copy(&g2[2], &g2[0]);
+    FP24_mul(&g2[2], &q[6]); // q[0].q[2]
+    FP24_copy(&g2[3], &g2[1]);
+    FP24_mul(&g2[3], &q[6]); // q[0].q[1].q[2]
+    FP24_copy(&g2[4], &g2[0]);
+    FP24_mul(&g2[4], &q[7]); // q[0].q[3]
+    FP24_copy(&g2[5], &g2[1]);
+    FP24_mul(&g2[5], &q[7]); // q[0].q[1].q[3]
+    FP24_copy(&g2[6], &g2[2]);
+    FP24_mul(&g2[6], &q[7]); // q[0].q[2].q[3]
+    FP24_copy(&g2[7], &g2[3]);
+    FP24_mul(&g2[7], &q[7]); // q[0].q[1].q[2].q[3]
+
+// Use Frobenius
+    /*
+        for (i=0;i<8;i++)
+        {
+            FP24_copy(&g2[i],&g1[i]);
+            FP24_frob(&g2[i],&X,4);
+        }
+    */
+// Make it odd
+    pb1 = 1 - BIG_parity(t[0]);
+    BIG_inc(t[0], pb1);
+    BIG_norm(t[0]);
+
+    pb2 = 1 - BIG_parity(t[4]);
+    BIG_inc(t[4], pb2);
+    BIG_norm(t[4]);
+
+// Number of bits
+    BIG_zero(mt);
+    for (i = 0; i < 8; i++)
+    {
+        BIG_or(mt, mt, t[i]);
+    }
+    nb = 1 + BIG_nbits(mt);
+
+// Sign pivot
+    s1[nb - 1] = 1;
+    s2[nb - 1] = 1;
+    for (i = 0; i < nb - 1; i++)
+    {
+        BIG_fshr(t[0], 1);
+        s1[i] = 2 * BIG_parity(t[0]) - 1;
+        BIG_fshr(t[4], 1);
+        s2[i] = 2 * BIG_parity(t[4]) - 1;
+    }
+
+// Recoded exponents
+    for (i = 0; i < nb; i++)
+    {
+        w1[i] = 0;
+        k = 1;
+        for (j = 1; j < 4; j++)
+        {
+            bt = s1[i] * BIG_parity(t[j]);
+            BIG_fshr(t[j], 1);
+
+            BIG_dec(t[j], (bt >> 1));
+            BIG_norm(t[j]);
+            w1[i] += bt * k;
+            k *= 2;
+        }
+
+        w2[i] = 0;
+        k = 1;
+        for (j = 5; j < 8; j++)
+        {
+            bt = s2[i] * BIG_parity(t[j]);
+            BIG_fshr(t[j], 1);
+
+            BIG_dec(t[j], (bt >> 1));
+            BIG_norm(t[j]);
+            w2[i] += bt * k;
+            k *= 2;
+        }
+    }
+
+// Main loop
+    FP24_select(p, g1, 2 * w1[nb - 1] + 1);
+    FP24_select(&r, g2, 2 * w2[nb - 1] + 1);
+    FP24_mul(p, &r);
+    for (i = nb - 2; i >= 0; i--)
+    {
+        FP24_usqr(p, p);
+        FP24_select(&r, g1, 2 * w1[i] + s1[i]);
+        FP24_mul(p, &r);
+        FP24_select(&r, g2, 2 * w2[i] + s2[i]);
+        FP24_mul(p, &r);
+    }
+
+// apply correction
+    FP24_conj(&r, &q[0]);
+    FP24_mul(&r, p);
+    FP24_cmove(p, &r, pb1);
+    FP24_conj(&r, &q[4]);
+    FP24_mul(&r, p);
+    FP24_cmove(p, &r, pb2);
+
+    FP24_reduce(p);
+}
+
+/* Set w=w^p using Frobenius */
+/* SU= 160 */
+void YYY::FP24_frob(FP24 *w, FP2 *f, int n)
+{
+    int i;
+    FP4 X2, X4;
+    FP2 f3, f2;             // f=(1+i)^(p-7)/12
+    FP2_sqr(&f2, f);    //
+    FP2_mul(&f3, &f2, f); // f3=f^3=(1+i)^(p-7)/4
+
+    FP2_mul_ip(&f3);    // f3 = (1+i).f3 = (1+i)^(p-3)/4
+    FP2_norm(&f3);
+
+    for (i = 0; i < n; i++)
+    {
+        FP8_frob(&(w->a), &f3);  // a=a^p
+        FP8_frob(&(w->b), &f3);  // b=b^p
+        FP8_frob(&(w->c), &f3);  // c=c^p
+
+        FP8_qmul(&(w->b), &(w->b), f); FP8_times_i2(&(w->b));
+        FP8_qmul(&(w->c), &(w->c), &f2); FP8_times_i2(&(w->c)); FP8_times_i2(&(w->c));
+    }
+    w->type = FP_DENSE;
+}
+
+
+/* SU= 8 */
+/* normalise all components of w */
+void YYY::FP24_norm(FP24 *w)
+{
+    FP8_norm(&(w->a));
+    FP8_norm(&(w->b));
+    FP8_norm(&(w->c));
+}
+
+/* SU= 8 */
+/* reduce all components of w */
+void YYY::FP24_reduce(FP24 *w)
+{
+    FP8_reduce(&(w->a));
+    FP8_reduce(&(w->b));
+    FP8_reduce(&(w->c));
+}
+
+/* trace function w=trace(x) */
+/* SU= 8 */
+void YYY::FP24_trace(FP8 *w, FP24 *x)
+{
+    FP8_imul(w, &(x->a), 3);
+    FP8_reduce(w);
+}
+
+/* SU= 8 */
+/* Output w in hex */
+void YYY::FP24_output(FP24 *w)
+{
+    printf("[");
+    FP8_output(&(w->a));
+    printf(",");
+    FP8_output(&(w->b));
+    printf(",");
+    FP8_output(&(w->c));
+    printf("]");
+}
+
+/* SU= 64 */
+/* Convert g to octet string w */
+void YYY::FP24_toOctet(octet *W, FP24 *g)
+{
+    W->len = 24 * MODBYTES_XXX;
+    FP8_toBytes(&(W->val[0]),&(g->c));
+    FP8_toBytes(&(W->val[8 * MODBYTES_XXX]),&(g->b));
+    FP8_toBytes(&(W->val[16 * MODBYTES_XXX]),&(g->a));
+}
+
+/* SU= 24 */
+/* Restore g from octet string w */
+void YYY::FP24_fromOctet(FP24 *g, octet *W)
+{
+    FP8_fromBytes(&(g->c),&(W->val[0]));
+    FP8_fromBytes(&(g->b),&(W->val[8 * MODBYTES_XXX]));
+    FP8_fromBytes(&(g->a),&(W->val[16 * MODBYTES_XXX]));
+}
+
+/* Move b to a if d=1 */
+void YYY::FP24_cmove(FP24 *f, FP24 *g, int d)
+{
+    FP8_cmove(&(f->a), &(g->a), d);
+    FP8_cmove(&(f->b), &(g->b), d);
+    FP8_cmove(&(f->c), &(g->c), d);
+    d = ~(d - 1);
+    f->type ^= (f->type ^ g->type)&d;
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp24.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp24.h
new file mode 100644
index 0000000..1b4b3c9
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp24.h
@@ -0,0 +1,236 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP24_YYY_H
+#define FP24_YYY_H
+
+#include "fp8_YYY.h"
+
+using namespace core;
+
+namespace YYY {
+/**
+	@brief FP12 Structure - towered over three FP8
+*/
+
+
+typedef struct
+{
+    FP8 a; /**< first part of FP12 */
+    FP8 b; /**< second part of FP12 */
+    FP8 c; /**< third part of FP12 */
+    int type;
+} FP24;
+
+extern const XXX::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const XXX::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+/* FP24 prototypes */
+/**	@brief Tests for FP24 equal to zero
+ *
+	@param x FP24 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP24_iszilch(FP24 *x);
+/**	@brief Tests for FP24 equal to unity
+ *
+	@param x FP24 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP24_isunity(FP24 *x);
+/**	@brief Copy FP24 to another FP24
+ *
+	@param x FP24 instance, on exit = y
+	@param y FP24 instance to be copied
+ */
+extern void FP24_copy(FP24 *x, FP24 *y);
+/**	@brief Set FP24 to unity
+ *
+	@param x FP24 instance to be set to one
+ */
+extern void FP24_one(FP24 *x);
+
+/**	@brief Set FP24 to zero
+ *
+	@param x FP24 instance to be set to zero
+ */
+extern void FP24_zero(FP24 *x);
+
+
+/**	@brief Tests for equality of two FP24s
+ *
+	@param x FP24 instance to be compared
+	@param y FP24 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP24_equals(FP24 *x, FP24 *y);
+/**	@brief Conjugation of FP24
+ *
+	If y=(a,b,c) (where a,b,c are its three FP8 components) on exit x=(conj(a),-conj(b),conj(c))
+	@param x FP24 instance, on exit = conj(y)
+	@param y FP24 instance
+ */
+extern void FP24_conj(FP24 *x, FP24 *y);
+/**	@brief Initialise FP24 from single FP8
+ *
+	Sets first FP8 component of an FP24, other components set to zero
+	@param x FP24 instance to be initialised
+	@param a FP8 to form first part of FP8
+ */
+extern void FP24_from_FP8(FP24 *x, FP8 *a);
+/**	@brief Initialise FP24 from three FP8s
+ *
+	@param x FP24 instance to be initialised
+	@param a FP8 to form first part of FP24
+	@param b FP8 to form second part of FP24
+	@param c FP8 to form third part of FP24
+ */
+extern void FP24_from_FP8s(FP24 *x, FP8 *a, FP8* b, FP8 *c);
+/**	@brief Fast Squaring of an FP24 in "unitary" form
+ *
+	@param x FP24 instance, on exit = y^2
+	@param y FP8 instance, must be unitary
+ */
+extern void FP24_usqr(FP24 *x, FP24 *y);
+/**	@brief Squaring an FP24
+ *
+	@param x FP24 instance, on exit = y^2
+	@param y FP24 instance
+ */
+extern void FP24_sqr(FP24 *x, FP24 *y);
+
+/**	@brief Fast multiplication of two sparse FP24s that arises from ATE pairing line functions
+ *
+	@param x FP24 instance, on exit = x*y
+	@param y FP24 instance, of special form
+ */
+extern void FP24_smul(FP24 *x, FP24 *y);
+
+/**	@brief Fast multiplication of what may be sparse multiplicands
+ *
+	@param x FP24 instance, on exit = x*y
+	@param y FP24 instance, of special form
+ */
+extern void FP24_ssmul(FP24 *x, FP24 *y);
+/**	@brief Full unconditional Multiplication of two FP24s
+ *
+	@param x FP24 instance, on exit = x*y
+	@param y FP24 instance, the multiplier
+ */
+extern void FP24_mul(FP24 *x, FP24 *y);
+
+/**	@brief Inverting an FP24
+ *
+	@param x FP24 instance, on exit = 1/y
+	@param y FP24 instance
+ */
+extern void FP24_inv(FP24 *x, FP24 *y);
+/**	@brief Raises an FP24 to the power of a BIG
+ *
+	@param r FP24 instance, on exit = y^b
+	@param x FP24 instance
+	@param b BIG number
+ */
+extern void FP24_pow(FP24 *r, FP24 *x, XXX::BIG b);
+
+//extern void FP24_ppow(FP24 *r,FP24 *x,XXX::BIG b);
+
+/**	@brief Raises an FP24 instance x to a small integer power, side-channel resistant
+ *
+	@param x FP24 instance, on exit = x^i
+	@param i small integer exponent
+	@param b maximum number of bits in exponent
+ */
+extern void FP24_pinpow(FP24 *x, int i, int b);
+
+/**	@brief Raises an FP24 instance x to a BIG power, compressed to FP8
+ *
+	@param c FP8 instance, on exit = x^(e mod r) as FP8
+	@param x FP24 input
+	@param e BIG exponent
+	@param r BIG group order
+ */
+extern void FP24_compow(FP8 *c, FP24 *x, XXX::BIG e, XXX::BIG r);
+
+/**	@brief Calculate Pi x[i]^b[i] for i=0 to 7, side-channel resistant
+ *
+	@param r FP24 instance, on exit = Pi x[i]^b[i] for i=0 to 7
+	@param x FP24 array with 4 FP24s
+	@param b BIG array of 4 exponents
+ */
+extern void FP24_pow8(FP24 *r, FP24 *x, XXX::BIG *b);
+
+
+/**	@brief Raises an FP24 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP24 instance, on exit = x^p^n
+	@param f FP2 precalculated Frobenius constant
+	@param n power of p
+ */
+extern void FP24_frob(FP24 *x, FP2 *f, int n);
+
+/**	@brief Reduces all components of possibly unreduced FP24 mod Modulus
+ *
+	@param x FP24 instance, on exit reduced mod Modulus
+ */
+extern void FP24_reduce(FP24 *x);
+/**	@brief Normalises the components of an FP24
+ *
+	@param x FP24 instance to be normalised
+ */
+extern void FP24_norm(FP24 *x);
+/**	@brief Formats and outputs an FP24 to the console
+ *
+	@param x FP24 instance to be printed
+ */
+extern void FP24_output(FP24 *x);
+/**	@brief Formats and outputs an FP24 instance to an octet string
+ *
+	Serializes the components of an FP24 to big-endian base 256 form.
+	@param S output octet string
+	@param x FP24 instance to be converted to an octet string
+ */
+extern void FP24_toOctet(octet *S, FP24 *x);
+/**	@brief Creates an FP24 instance from an octet string
+ *
+	De-serializes the components of an FP24 to create an FP24 from big-endian base 256 components.
+	@param x FP24 instance to be created from an octet string
+	@param S input octet string
+
+ */
+extern void FP24_fromOctet(FP24 *x, octet *S);
+/**	@brief Calculate the trace of an FP24
+ *
+	@param t FP8 trace of x, on exit = tr(x)
+	@param x FP24 instance
+
+ */
+extern void FP24_trace(FP8 *t, FP24 *x);
+
+/**	@brief Conditional copy of FP24 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP24 instance, set to y if s!=0
+	@param y another FP24 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP24_cmove(FP24 *x, FP24 *y, int s);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp24_BLS24479.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp24_BLS24479.h
new file mode 100644
index 0000000..1c75a26
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp24_BLS24479.h
@@ -0,0 +1,236 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP24_BLS24479_H
+#define FP24_BLS24479_H
+
+#include "fp8_BLS24479.h"
+
+using namespace core;
+
+namespace BLS24479 {
+/**
+	@brief FP12 Structure - towered over three FP8
+*/
+
+
+typedef struct
+{
+    FP8 a; /**< first part of FP12 */
+    FP8 b; /**< second part of FP12 */
+    FP8 c; /**< third part of FP12 */
+    int type;
+} FP24;
+
+extern const B480_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B480_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+/* FP24 prototypes */
+/**	@brief Tests for FP24 equal to zero
+ *
+	@param x FP24 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP24_iszilch(FP24 *x);
+/**	@brief Tests for FP24 equal to unity
+ *
+	@param x FP24 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP24_isunity(FP24 *x);
+/**	@brief Copy FP24 to another FP24
+ *
+	@param x FP24 instance, on exit = y
+	@param y FP24 instance to be copied
+ */
+extern void FP24_copy(FP24 *x, FP24 *y);
+/**	@brief Set FP24 to unity
+ *
+	@param x FP24 instance to be set to one
+ */
+extern void FP24_one(FP24 *x);
+
+/**	@brief Set FP24 to zero
+ *
+	@param x FP24 instance to be set to zero
+ */
+extern void FP24_zero(FP24 *x);
+
+
+/**	@brief Tests for equality of two FP24s
+ *
+	@param x FP24 instance to be compared
+	@param y FP24 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP24_equals(FP24 *x, FP24 *y);
+/**	@brief Conjugation of FP24
+ *
+	If y=(a,b,c) (where a,b,c are its three FP8 components) on exit x=(conj(a),-conj(b),conj(c))
+	@param x FP24 instance, on exit = conj(y)
+	@param y FP24 instance
+ */
+extern void FP24_conj(FP24 *x, FP24 *y);
+/**	@brief Initialise FP24 from single FP8
+ *
+	Sets first FP8 component of an FP24, other components set to zero
+	@param x FP24 instance to be initialised
+	@param a FP8 to form first part of FP8
+ */
+extern void FP24_from_FP8(FP24 *x, FP8 *a);
+/**	@brief Initialise FP24 from three FP8s
+ *
+	@param x FP24 instance to be initialised
+	@param a FP8 to form first part of FP24
+	@param b FP8 to form second part of FP24
+	@param c FP8 to form third part of FP24
+ */
+extern void FP24_from_FP8s(FP24 *x, FP8 *a, FP8* b, FP8 *c);
+/**	@brief Fast Squaring of an FP24 in "unitary" form
+ *
+	@param x FP24 instance, on exit = y^2
+	@param y FP8 instance, must be unitary
+ */
+extern void FP24_usqr(FP24 *x, FP24 *y);
+/**	@brief Squaring an FP24
+ *
+	@param x FP24 instance, on exit = y^2
+	@param y FP24 instance
+ */
+extern void FP24_sqr(FP24 *x, FP24 *y);
+
+/**	@brief Fast multiplication of two sparse FP24s that arises from ATE pairing line functions
+ *
+	@param x FP24 instance, on exit = x*y
+	@param y FP24 instance, of special form
+ */
+extern void FP24_smul(FP24 *x, FP24 *y);
+
+/**	@brief Fast multiplication of what may be sparse multiplicands
+ *
+	@param x FP24 instance, on exit = x*y
+	@param y FP24 instance, of special form
+ */
+extern void FP24_ssmul(FP24 *x, FP24 *y);
+/**	@brief Full unconditional Multiplication of two FP24s
+ *
+	@param x FP24 instance, on exit = x*y
+	@param y FP24 instance, the multiplier
+ */
+extern void FP24_mul(FP24 *x, FP24 *y);
+
+/**	@brief Inverting an FP24
+ *
+	@param x FP24 instance, on exit = 1/y
+	@param y FP24 instance
+ */
+extern void FP24_inv(FP24 *x, FP24 *y);
+/**	@brief Raises an FP24 to the power of a BIG
+ *
+	@param r FP24 instance, on exit = y^b
+	@param x FP24 instance
+	@param b BIG number
+ */
+extern void FP24_pow(FP24 *r, FP24 *x, B480_56::BIG b);
+
+//extern void FP24_ppow(FP24 *r,FP24 *x,B480_56::BIG b);
+
+/**	@brief Raises an FP24 instance x to a small integer power, side-channel resistant
+ *
+	@param x FP24 instance, on exit = x^i
+	@param i small integer exponent
+	@param b maximum number of bits in exponent
+ */
+extern void FP24_pinpow(FP24 *x, int i, int b);
+
+/**	@brief Raises an FP24 instance x to a BIG power, compressed to FP8
+ *
+	@param c FP8 instance, on exit = x^(e mod r) as FP8
+	@param x FP24 input
+	@param e BIG exponent
+	@param r BIG group order
+ */
+extern void FP24_compow(FP8 *c, FP24 *x, B480_56::BIG e, B480_56::BIG r);
+
+/**	@brief Calculate Pi x[i]^b[i] for i=0 to 7, side-channel resistant
+ *
+	@param r FP24 instance, on exit = Pi x[i]^b[i] for i=0 to 7
+	@param x FP24 array with 4 FP24s
+	@param b BIG array of 4 exponents
+ */
+extern void FP24_pow8(FP24 *r, FP24 *x, B480_56::BIG *b);
+
+
+/**	@brief Raises an FP24 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP24 instance, on exit = x^p^n
+	@param f FP2 precalculated Frobenius constant
+	@param n power of p
+ */
+extern void FP24_frob(FP24 *x, FP2 *f, int n);
+
+/**	@brief Reduces all components of possibly unreduced FP24 mod Modulus
+ *
+	@param x FP24 instance, on exit reduced mod Modulus
+ */
+extern void FP24_reduce(FP24 *x);
+/**	@brief Normalises the components of an FP24
+ *
+	@param x FP24 instance to be normalised
+ */
+extern void FP24_norm(FP24 *x);
+/**	@brief Formats and outputs an FP24 to the console
+ *
+	@param x FP24 instance to be printed
+ */
+extern void FP24_output(FP24 *x);
+/**	@brief Formats and outputs an FP24 instance to an octet string
+ *
+	Serializes the components of an FP24 to big-endian base 256 form.
+	@param S output octet string
+	@param x FP24 instance to be converted to an octet string
+ */
+extern void FP24_toOctet(octet *S, FP24 *x);
+/**	@brief Creates an FP24 instance from an octet string
+ *
+	De-serializes the components of an FP24 to create an FP24 from big-endian base 256 components.
+	@param x FP24 instance to be created from an octet string
+	@param S input octet string
+
+ */
+extern void FP24_fromOctet(FP24 *x, octet *S);
+/**	@brief Calculate the trace of an FP24
+ *
+	@param t FP8 trace of x, on exit = tr(x)
+	@param x FP24 instance
+
+ */
+extern void FP24_trace(FP8 *t, FP24 *x);
+
+/**	@brief Conditional copy of FP24 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP24 instance, set to y if s!=0
+	@param y another FP24 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP24_cmove(FP24 *x, FP24 *y, int s);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp2_BLS12381.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp2_BLS12381.h
new file mode 100644
index 0000000..1ce1489
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp2_BLS12381.h
@@ -0,0 +1,306 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP2_BLS12381_H
+#define FP2_BLS12381_H
+
+#include "fp_BLS12381.h"
+
+using namespace core;
+
+namespace BLS12381 {
+
+/**
+	@brief FP2 Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    FP a; /**< real part of FP2 */
+    FP b; /**< imaginary part of FP2 */
+} FP2;
+
+/* FP2 prototypes */
+
+/**	@brief Tests for FP2 equal to zero
+ *
+	@param x FP2 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP2_iszilch(FP2 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP2 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP2_islarger(FP2 *x);
+
+
+/**	@brief Serialize out FP2  
+ *
+    @param b buffer for output
+	@param x FP2 number to be serialized
+ */
+extern void FP2_toBytes(char *b,FP2 *x);
+
+/**	@brief Serialize in FP2  
+ *
+	@param x FP2 number to be serialized
+    @param b buffer for input
+ */
+extern void FP2_fromBytes(FP2 *x,char *b);
+
+/**	@brief Conditional copy of FP2 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP2 instance, set to y if s!=0
+	@param y another FP2 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP2_cmove(FP2 *x, FP2 *y, int s);
+/**	@brief Tests for FP2 equal to one
+ *
+	@param x FP2 instance to be tested
+	@return 1 if x=1, else returns 0
+ */
+extern int FP2_isunity(FP2 *x);
+/**	@brief Tests for equality of two FP2s
+ *
+	@param x FP2 instance to be compared
+	@param y FP2 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP2_equals(FP2 *x, FP2 *y);
+/**	@brief Initialise FP2 from two FP numbers
+ *
+	@param x FP2 instance to be initialised
+	@param a FP to form real part of FP2
+	@param b FP to form imaginary part of FP2
+ */
+extern void FP2_from_FPs(FP2 *x, FP *a, FP *b);
+/**	@brief Initialise FP2 from two BIG integers
+ *
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+	@param b BIG to form imaginary part of FP2
+ */
+extern void FP2_from_BIGs(FP2 *x, B384_58::BIG a, B384_58::BIG b);
+
+
+/**	@brief Initialise FP2 from two integers
+ *
+	@param x FP2 instance to be initialised
+	@param a int to form real part of FP2
+	@param b int to form imaginary part of FP2
+ */
+extern void FP2_from_ints(FP2 *x, int a, int b);
+
+
+
+/**	@brief Initialise FP2 from single FP
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param an FP to form real part of FP2
+ */
+extern void FP2_from_FP(FP2 *x, FP *a);
+/**	@brief Initialise FP2 from single BIG
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+ */
+extern void FP2_from_BIG(FP2 *x, B384_58::BIG a);
+/**	@brief Copy FP2 to another FP2
+ *
+	@param x FP2 instance, on exit = y
+	@param y FP2 instance to be copied
+ */
+extern void FP2_copy(FP2 *x, FP2 *y);
+/**	@brief Set FP2 to zero
+ *
+	@param x FP2 instance to be set to zero
+ */
+extern void FP2_zero(FP2 *x);
+/**	@brief Set FP2 to unity
+ *
+	@param x FP2 instance to be set to one
+ */
+extern void FP2_one(FP2 *x);
+
+/**	@brief Copy from ROM to an FP2
+ *
+	@param w FP2 number to be copied to
+	@param a BIG real part to be copied from ROM
+	@param b BIG imag part to be copied from ROM
+ */
+extern void FP2_rcopy(FP2 *w,const B384_58::BIG a,const B384_58::BIG b);
+
+/**	@brief Sign of FP2
+ *
+	@param x FP2 instance
+	@return "sign" of FP2
+ */
+extern int FP2_sign(FP2 *x);
+
+/**	@brief Negation of FP2
+ *
+	@param x FP2 instance, on exit = -y
+	@param y FP2 instance
+ */
+extern void FP2_neg(FP2 *x, FP2 *y);
+
+
+/**	@brief Conjugation of FP2
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP2 instance, on exit = conj(y)
+	@param y FP2 instance
+ */
+extern void FP2_conj(FP2 *x, FP2 *y);
+/**	@brief addition of two FP2s
+ *
+	@param x FP2 instance, on exit = y+z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_add(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief subtraction of two FP2s
+ *
+	@param x FP2 instance, on exit = y-z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_sub(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Multiplication of an FP2 by an FP
+ *
+	@param x FP2 instance, on exit = y*b
+	@param y FP2 instance
+	@param b FP residue
+ */
+extern void FP2_pmul(FP2 *x, FP2 *y, FP *b);
+/**	@brief Multiplication of an FP2 by a small integer
+ *
+	@param x FP2 instance, on exit = y*i
+	@param y FP2 instance
+	@param i an integer
+ */
+extern void FP2_imul(FP2 *x, FP2 *y, int i);
+/**	@brief Squaring an FP2
+ *
+	@param x FP2 instance, on exit = y^2
+	@param y FP2 instance
+ */
+extern void FP2_sqr(FP2 *x, FP2 *y);
+/**	@brief Multiplication of two FP2s
+ *
+	@param x FP2 instance, on exit = y*z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_mul(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Formats and outputs an FP2 to the console
+ *
+	@param x FP2 instance
+ */
+extern void FP2_output(FP2 *x);
+/**	@brief Formats and outputs an FP2 to the console in raw form (for debugging)
+ *
+	@param x FP2 instance
+ */
+extern void FP2_rawoutput(FP2 *x);
+/**	@brief Inverting an FP2
+ *
+	@param x FP2 instance, on exit = 1/y
+	@param y FP2 instance
+ */
+extern void FP2_inv(FP2 *x, FP2 *y, FP *h);
+/**	@brief Divide an FP2 by 2
+ *
+	@param x FP2 instance, on exit = y/2
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_div2(FP2 *x, FP2 *y);
+/**	@brief Multiply an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x*(1+sqrt(-1))
+ */
+extern void FP2_mul_ip(FP2 *x);
+
+/**	@brief Divide an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x/(1+sqrt(-1))
+ */
+extern void FP2_div_ip(FP2 *x);
+/**	@brief Normalises the components of an FP2
+ *
+	@param x FP2 instance to be normalised
+ */
+extern void FP2_norm(FP2 *x);
+/**	@brief Reduces all components of possibly unreduced FP2 mod Modulus
+ *
+	@param x FP2 instance, on exit reduced mod Modulus
+ */
+extern void FP2_reduce(FP2 *x);
+/**	@brief Raises an FP2 to the power of a BIG
+ *
+	@param x FP2 instance, on exit = y^b
+	@param y FP2 instance
+	@param b BIG number
+ */
+extern void FP2_pow(FP2 *x, FP2 *y, B384_58::BIG b);
+
+/**	@brief Test FP2 for QR
+ *
+	@param x FP2 instance
+    @param h optional generated hint
+	@return true or false
+ */
+extern int FP2_qr(FP2 *x,FP *h);
+
+
+/**	@brief Square root of an FP2
+ *
+	@param x FP2 instance, on exit = sqrt(y)
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_sqrt(FP2 *x, FP2 *y, FP *h);
+
+/**	@brief Multiply an FP2 by sqrt(-1)
+ *
+	Note that -1 is QNR
+	@param x FP2 instance, on exit = x*sqrt(-1)
+ */
+extern void FP2_times_i(FP2 *x);
+
+/**	@brief Generate random FP2
+ *
+	@param x random FP2 number
+	@param rng random number generator
+ */
+extern void FP2_rand(FP2 *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp2_BLS12383.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp2_BLS12383.h
new file mode 100644
index 0000000..cc7c945
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp2_BLS12383.h
@@ -0,0 +1,306 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP2_BLS12383_H
+#define FP2_BLS12383_H
+
+#include "fp_BLS12383.h"
+
+using namespace core;
+
+namespace BLS12383 {
+
+/**
+	@brief FP2 Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    FP a; /**< real part of FP2 */
+    FP b; /**< imaginary part of FP2 */
+} FP2;
+
+/* FP2 prototypes */
+
+/**	@brief Tests for FP2 equal to zero
+ *
+	@param x FP2 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP2_iszilch(FP2 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP2 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP2_islarger(FP2 *x);
+
+
+/**	@brief Serialize out FP2  
+ *
+    @param b buffer for output
+	@param x FP2 number to be serialized
+ */
+extern void FP2_toBytes(char *b,FP2 *x);
+
+/**	@brief Serialize in FP2  
+ *
+	@param x FP2 number to be serialized
+    @param b buffer for input
+ */
+extern void FP2_fromBytes(FP2 *x,char *b);
+
+/**	@brief Conditional copy of FP2 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP2 instance, set to y if s!=0
+	@param y another FP2 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP2_cmove(FP2 *x, FP2 *y, int s);
+/**	@brief Tests for FP2 equal to one
+ *
+	@param x FP2 instance to be tested
+	@return 1 if x=1, else returns 0
+ */
+extern int FP2_isunity(FP2 *x);
+/**	@brief Tests for equality of two FP2s
+ *
+	@param x FP2 instance to be compared
+	@param y FP2 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP2_equals(FP2 *x, FP2 *y);
+/**	@brief Initialise FP2 from two FP numbers
+ *
+	@param x FP2 instance to be initialised
+	@param a FP to form real part of FP2
+	@param b FP to form imaginary part of FP2
+ */
+extern void FP2_from_FPs(FP2 *x, FP *a, FP *b);
+/**	@brief Initialise FP2 from two BIG integers
+ *
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+	@param b BIG to form imaginary part of FP2
+ */
+extern void FP2_from_BIGs(FP2 *x, B384_58::BIG a, B384_58::BIG b);
+
+
+/**	@brief Initialise FP2 from two integers
+ *
+	@param x FP2 instance to be initialised
+	@param a int to form real part of FP2
+	@param b int to form imaginary part of FP2
+ */
+extern void FP2_from_ints(FP2 *x, int a, int b);
+
+
+
+/**	@brief Initialise FP2 from single FP
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param an FP to form real part of FP2
+ */
+extern void FP2_from_FP(FP2 *x, FP *a);
+/**	@brief Initialise FP2 from single BIG
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+ */
+extern void FP2_from_BIG(FP2 *x, B384_58::BIG a);
+/**	@brief Copy FP2 to another FP2
+ *
+	@param x FP2 instance, on exit = y
+	@param y FP2 instance to be copied
+ */
+extern void FP2_copy(FP2 *x, FP2 *y);
+/**	@brief Set FP2 to zero
+ *
+	@param x FP2 instance to be set to zero
+ */
+extern void FP2_zero(FP2 *x);
+/**	@brief Set FP2 to unity
+ *
+	@param x FP2 instance to be set to one
+ */
+extern void FP2_one(FP2 *x);
+
+/**	@brief Copy from ROM to an FP2
+ *
+	@param w FP2 number to be copied to
+	@param a BIG real part to be copied from ROM
+	@param b BIG imag part to be copied from ROM
+ */
+extern void FP2_rcopy(FP2 *w,const B384_58::BIG a,const B384_58::BIG b);
+
+/**	@brief Sign of FP2
+ *
+	@param x FP2 instance
+	@return "sign" of FP2
+ */
+extern int FP2_sign(FP2 *x);
+
+/**	@brief Negation of FP2
+ *
+	@param x FP2 instance, on exit = -y
+	@param y FP2 instance
+ */
+extern void FP2_neg(FP2 *x, FP2 *y);
+
+
+/**	@brief Conjugation of FP2
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP2 instance, on exit = conj(y)
+	@param y FP2 instance
+ */
+extern void FP2_conj(FP2 *x, FP2 *y);
+/**	@brief addition of two FP2s
+ *
+	@param x FP2 instance, on exit = y+z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_add(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief subtraction of two FP2s
+ *
+	@param x FP2 instance, on exit = y-z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_sub(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Multiplication of an FP2 by an FP
+ *
+	@param x FP2 instance, on exit = y*b
+	@param y FP2 instance
+	@param b FP residue
+ */
+extern void FP2_pmul(FP2 *x, FP2 *y, FP *b);
+/**	@brief Multiplication of an FP2 by a small integer
+ *
+	@param x FP2 instance, on exit = y*i
+	@param y FP2 instance
+	@param i an integer
+ */
+extern void FP2_imul(FP2 *x, FP2 *y, int i);
+/**	@brief Squaring an FP2
+ *
+	@param x FP2 instance, on exit = y^2
+	@param y FP2 instance
+ */
+extern void FP2_sqr(FP2 *x, FP2 *y);
+/**	@brief Multiplication of two FP2s
+ *
+	@param x FP2 instance, on exit = y*z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_mul(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Formats and outputs an FP2 to the console
+ *
+	@param x FP2 instance
+ */
+extern void FP2_output(FP2 *x);
+/**	@brief Formats and outputs an FP2 to the console in raw form (for debugging)
+ *
+	@param x FP2 instance
+ */
+extern void FP2_rawoutput(FP2 *x);
+/**	@brief Inverting an FP2
+ *
+	@param x FP2 instance, on exit = 1/y
+	@param y FP2 instance
+ */
+extern void FP2_inv(FP2 *x, FP2 *y, FP *h);
+/**	@brief Divide an FP2 by 2
+ *
+	@param x FP2 instance, on exit = y/2
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_div2(FP2 *x, FP2 *y);
+/**	@brief Multiply an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x*(1+sqrt(-1))
+ */
+extern void FP2_mul_ip(FP2 *x);
+
+/**	@brief Divide an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x/(1+sqrt(-1))
+ */
+extern void FP2_div_ip(FP2 *x);
+/**	@brief Normalises the components of an FP2
+ *
+	@param x FP2 instance to be normalised
+ */
+extern void FP2_norm(FP2 *x);
+/**	@brief Reduces all components of possibly unreduced FP2 mod Modulus
+ *
+	@param x FP2 instance, on exit reduced mod Modulus
+ */
+extern void FP2_reduce(FP2 *x);
+/**	@brief Raises an FP2 to the power of a BIG
+ *
+	@param x FP2 instance, on exit = y^b
+	@param y FP2 instance
+	@param b BIG number
+ */
+extern void FP2_pow(FP2 *x, FP2 *y, B384_58::BIG b);
+
+/**	@brief Test FP2 for QR
+ *
+	@param x FP2 instance
+    @param h optional generated hint
+	@return true or false
+ */
+extern int FP2_qr(FP2 *x,FP *h);
+
+
+/**	@brief Square root of an FP2
+ *
+	@param x FP2 instance, on exit = sqrt(y)
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_sqrt(FP2 *x, FP2 *y, FP *h);
+
+/**	@brief Multiply an FP2 by sqrt(-1)
+ *
+	Note that -1 is QNR
+	@param x FP2 instance, on exit = x*sqrt(-1)
+ */
+extern void FP2_times_i(FP2 *x);
+
+/**	@brief Generate random FP2
+ *
+	@param x random FP2 number
+	@param rng random number generator
+ */
+extern void FP2_rand(FP2 *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp2_BLS12443.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp2_BLS12443.h
new file mode 100644
index 0000000..a4e8fd2
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp2_BLS12443.h
@@ -0,0 +1,306 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP2_BLS12443_H
+#define FP2_BLS12443_H
+
+#include "fp_BLS12443.h"
+
+using namespace core;
+
+namespace BLS12443 {
+
+/**
+	@brief FP2 Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    FP a; /**< real part of FP2 */
+    FP b; /**< imaginary part of FP2 */
+} FP2;
+
+/* FP2 prototypes */
+
+/**	@brief Tests for FP2 equal to zero
+ *
+	@param x FP2 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP2_iszilch(FP2 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP2 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP2_islarger(FP2 *x);
+
+
+/**	@brief Serialize out FP2  
+ *
+    @param b buffer for output
+	@param x FP2 number to be serialized
+ */
+extern void FP2_toBytes(char *b,FP2 *x);
+
+/**	@brief Serialize in FP2  
+ *
+	@param x FP2 number to be serialized
+    @param b buffer for input
+ */
+extern void FP2_fromBytes(FP2 *x,char *b);
+
+/**	@brief Conditional copy of FP2 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP2 instance, set to y if s!=0
+	@param y another FP2 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP2_cmove(FP2 *x, FP2 *y, int s);
+/**	@brief Tests for FP2 equal to one
+ *
+	@param x FP2 instance to be tested
+	@return 1 if x=1, else returns 0
+ */
+extern int FP2_isunity(FP2 *x);
+/**	@brief Tests for equality of two FP2s
+ *
+	@param x FP2 instance to be compared
+	@param y FP2 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP2_equals(FP2 *x, FP2 *y);
+/**	@brief Initialise FP2 from two FP numbers
+ *
+	@param x FP2 instance to be initialised
+	@param a FP to form real part of FP2
+	@param b FP to form imaginary part of FP2
+ */
+extern void FP2_from_FPs(FP2 *x, FP *a, FP *b);
+/**	@brief Initialise FP2 from two BIG integers
+ *
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+	@param b BIG to form imaginary part of FP2
+ */
+extern void FP2_from_BIGs(FP2 *x, B448_60::BIG a, B448_60::BIG b);
+
+
+/**	@brief Initialise FP2 from two integers
+ *
+	@param x FP2 instance to be initialised
+	@param a int to form real part of FP2
+	@param b int to form imaginary part of FP2
+ */
+extern void FP2_from_ints(FP2 *x, int a, int b);
+
+
+
+/**	@brief Initialise FP2 from single FP
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param an FP to form real part of FP2
+ */
+extern void FP2_from_FP(FP2 *x, FP *a);
+/**	@brief Initialise FP2 from single BIG
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+ */
+extern void FP2_from_BIG(FP2 *x, B448_60::BIG a);
+/**	@brief Copy FP2 to another FP2
+ *
+	@param x FP2 instance, on exit = y
+	@param y FP2 instance to be copied
+ */
+extern void FP2_copy(FP2 *x, FP2 *y);
+/**	@brief Set FP2 to zero
+ *
+	@param x FP2 instance to be set to zero
+ */
+extern void FP2_zero(FP2 *x);
+/**	@brief Set FP2 to unity
+ *
+	@param x FP2 instance to be set to one
+ */
+extern void FP2_one(FP2 *x);
+
+/**	@brief Copy from ROM to an FP2
+ *
+	@param w FP2 number to be copied to
+	@param a BIG real part to be copied from ROM
+	@param b BIG imag part to be copied from ROM
+ */
+extern void FP2_rcopy(FP2 *w,const B448_60::BIG a,const B448_60::BIG b);
+
+/**	@brief Sign of FP2
+ *
+	@param x FP2 instance
+	@return "sign" of FP2
+ */
+extern int FP2_sign(FP2 *x);
+
+/**	@brief Negation of FP2
+ *
+	@param x FP2 instance, on exit = -y
+	@param y FP2 instance
+ */
+extern void FP2_neg(FP2 *x, FP2 *y);
+
+
+/**	@brief Conjugation of FP2
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP2 instance, on exit = conj(y)
+	@param y FP2 instance
+ */
+extern void FP2_conj(FP2 *x, FP2 *y);
+/**	@brief addition of two FP2s
+ *
+	@param x FP2 instance, on exit = y+z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_add(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief subtraction of two FP2s
+ *
+	@param x FP2 instance, on exit = y-z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_sub(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Multiplication of an FP2 by an FP
+ *
+	@param x FP2 instance, on exit = y*b
+	@param y FP2 instance
+	@param b FP residue
+ */
+extern void FP2_pmul(FP2 *x, FP2 *y, FP *b);
+/**	@brief Multiplication of an FP2 by a small integer
+ *
+	@param x FP2 instance, on exit = y*i
+	@param y FP2 instance
+	@param i an integer
+ */
+extern void FP2_imul(FP2 *x, FP2 *y, int i);
+/**	@brief Squaring an FP2
+ *
+	@param x FP2 instance, on exit = y^2
+	@param y FP2 instance
+ */
+extern void FP2_sqr(FP2 *x, FP2 *y);
+/**	@brief Multiplication of two FP2s
+ *
+	@param x FP2 instance, on exit = y*z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_mul(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Formats and outputs an FP2 to the console
+ *
+	@param x FP2 instance
+ */
+extern void FP2_output(FP2 *x);
+/**	@brief Formats and outputs an FP2 to the console in raw form (for debugging)
+ *
+	@param x FP2 instance
+ */
+extern void FP2_rawoutput(FP2 *x);
+/**	@brief Inverting an FP2
+ *
+	@param x FP2 instance, on exit = 1/y
+	@param y FP2 instance
+ */
+extern void FP2_inv(FP2 *x, FP2 *y, FP *h);
+/**	@brief Divide an FP2 by 2
+ *
+	@param x FP2 instance, on exit = y/2
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_div2(FP2 *x, FP2 *y);
+/**	@brief Multiply an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x*(1+sqrt(-1))
+ */
+extern void FP2_mul_ip(FP2 *x);
+
+/**	@brief Divide an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x/(1+sqrt(-1))
+ */
+extern void FP2_div_ip(FP2 *x);
+/**	@brief Normalises the components of an FP2
+ *
+	@param x FP2 instance to be normalised
+ */
+extern void FP2_norm(FP2 *x);
+/**	@brief Reduces all components of possibly unreduced FP2 mod Modulus
+ *
+	@param x FP2 instance, on exit reduced mod Modulus
+ */
+extern void FP2_reduce(FP2 *x);
+/**	@brief Raises an FP2 to the power of a BIG
+ *
+	@param x FP2 instance, on exit = y^b
+	@param y FP2 instance
+	@param b BIG number
+ */
+extern void FP2_pow(FP2 *x, FP2 *y, B448_60::BIG b);
+
+/**	@brief Test FP2 for QR
+ *
+	@param x FP2 instance
+    @param h optional generated hint
+	@return true or false
+ */
+extern int FP2_qr(FP2 *x,FP *h);
+
+
+/**	@brief Square root of an FP2
+ *
+	@param x FP2 instance, on exit = sqrt(y)
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_sqrt(FP2 *x, FP2 *y, FP *h);
+
+/**	@brief Multiply an FP2 by sqrt(-1)
+ *
+	Note that -1 is QNR
+	@param x FP2 instance, on exit = x*sqrt(-1)
+ */
+extern void FP2_times_i(FP2 *x);
+
+/**	@brief Generate random FP2
+ *
+	@param x random FP2 number
+	@param rng random number generator
+ */
+extern void FP2_rand(FP2 *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp2_BLS12461.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp2_BLS12461.h
new file mode 100644
index 0000000..b1479eb
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp2_BLS12461.h
@@ -0,0 +1,306 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP2_BLS12461_H
+#define FP2_BLS12461_H
+
+#include "fp_BLS12461.h"
+
+using namespace core;
+
+namespace BLS12461 {
+
+/**
+	@brief FP2 Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    FP a; /**< real part of FP2 */
+    FP b; /**< imaginary part of FP2 */
+} FP2;
+
+/* FP2 prototypes */
+
+/**	@brief Tests for FP2 equal to zero
+ *
+	@param x FP2 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP2_iszilch(FP2 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP2 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP2_islarger(FP2 *x);
+
+
+/**	@brief Serialize out FP2  
+ *
+    @param b buffer for output
+	@param x FP2 number to be serialized
+ */
+extern void FP2_toBytes(char *b,FP2 *x);
+
+/**	@brief Serialize in FP2  
+ *
+	@param x FP2 number to be serialized
+    @param b buffer for input
+ */
+extern void FP2_fromBytes(FP2 *x,char *b);
+
+/**	@brief Conditional copy of FP2 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP2 instance, set to y if s!=0
+	@param y another FP2 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP2_cmove(FP2 *x, FP2 *y, int s);
+/**	@brief Tests for FP2 equal to one
+ *
+	@param x FP2 instance to be tested
+	@return 1 if x=1, else returns 0
+ */
+extern int FP2_isunity(FP2 *x);
+/**	@brief Tests for equality of two FP2s
+ *
+	@param x FP2 instance to be compared
+	@param y FP2 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP2_equals(FP2 *x, FP2 *y);
+/**	@brief Initialise FP2 from two FP numbers
+ *
+	@param x FP2 instance to be initialised
+	@param a FP to form real part of FP2
+	@param b FP to form imaginary part of FP2
+ */
+extern void FP2_from_FPs(FP2 *x, FP *a, FP *b);
+/**	@brief Initialise FP2 from two BIG integers
+ *
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+	@param b BIG to form imaginary part of FP2
+ */
+extern void FP2_from_BIGs(FP2 *x, B464_60::BIG a, B464_60::BIG b);
+
+
+/**	@brief Initialise FP2 from two integers
+ *
+	@param x FP2 instance to be initialised
+	@param a int to form real part of FP2
+	@param b int to form imaginary part of FP2
+ */
+extern void FP2_from_ints(FP2 *x, int a, int b);
+
+
+
+/**	@brief Initialise FP2 from single FP
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param an FP to form real part of FP2
+ */
+extern void FP2_from_FP(FP2 *x, FP *a);
+/**	@brief Initialise FP2 from single BIG
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+ */
+extern void FP2_from_BIG(FP2 *x, B464_60::BIG a);
+/**	@brief Copy FP2 to another FP2
+ *
+	@param x FP2 instance, on exit = y
+	@param y FP2 instance to be copied
+ */
+extern void FP2_copy(FP2 *x, FP2 *y);
+/**	@brief Set FP2 to zero
+ *
+	@param x FP2 instance to be set to zero
+ */
+extern void FP2_zero(FP2 *x);
+/**	@brief Set FP2 to unity
+ *
+	@param x FP2 instance to be set to one
+ */
+extern void FP2_one(FP2 *x);
+
+/**	@brief Copy from ROM to an FP2
+ *
+	@param w FP2 number to be copied to
+	@param a BIG real part to be copied from ROM
+	@param b BIG imag part to be copied from ROM
+ */
+extern void FP2_rcopy(FP2 *w,const B464_60::BIG a,const B464_60::BIG b);
+
+/**	@brief Sign of FP2
+ *
+	@param x FP2 instance
+	@return "sign" of FP2
+ */
+extern int FP2_sign(FP2 *x);
+
+/**	@brief Negation of FP2
+ *
+	@param x FP2 instance, on exit = -y
+	@param y FP2 instance
+ */
+extern void FP2_neg(FP2 *x, FP2 *y);
+
+
+/**	@brief Conjugation of FP2
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP2 instance, on exit = conj(y)
+	@param y FP2 instance
+ */
+extern void FP2_conj(FP2 *x, FP2 *y);
+/**	@brief addition of two FP2s
+ *
+	@param x FP2 instance, on exit = y+z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_add(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief subtraction of two FP2s
+ *
+	@param x FP2 instance, on exit = y-z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_sub(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Multiplication of an FP2 by an FP
+ *
+	@param x FP2 instance, on exit = y*b
+	@param y FP2 instance
+	@param b FP residue
+ */
+extern void FP2_pmul(FP2 *x, FP2 *y, FP *b);
+/**	@brief Multiplication of an FP2 by a small integer
+ *
+	@param x FP2 instance, on exit = y*i
+	@param y FP2 instance
+	@param i an integer
+ */
+extern void FP2_imul(FP2 *x, FP2 *y, int i);
+/**	@brief Squaring an FP2
+ *
+	@param x FP2 instance, on exit = y^2
+	@param y FP2 instance
+ */
+extern void FP2_sqr(FP2 *x, FP2 *y);
+/**	@brief Multiplication of two FP2s
+ *
+	@param x FP2 instance, on exit = y*z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_mul(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Formats and outputs an FP2 to the console
+ *
+	@param x FP2 instance
+ */
+extern void FP2_output(FP2 *x);
+/**	@brief Formats and outputs an FP2 to the console in raw form (for debugging)
+ *
+	@param x FP2 instance
+ */
+extern void FP2_rawoutput(FP2 *x);
+/**	@brief Inverting an FP2
+ *
+	@param x FP2 instance, on exit = 1/y
+	@param y FP2 instance
+ */
+extern void FP2_inv(FP2 *x, FP2 *y, FP *h);
+/**	@brief Divide an FP2 by 2
+ *
+	@param x FP2 instance, on exit = y/2
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_div2(FP2 *x, FP2 *y);
+/**	@brief Multiply an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x*(1+sqrt(-1))
+ */
+extern void FP2_mul_ip(FP2 *x);
+
+/**	@brief Divide an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x/(1+sqrt(-1))
+ */
+extern void FP2_div_ip(FP2 *x);
+/**	@brief Normalises the components of an FP2
+ *
+	@param x FP2 instance to be normalised
+ */
+extern void FP2_norm(FP2 *x);
+/**	@brief Reduces all components of possibly unreduced FP2 mod Modulus
+ *
+	@param x FP2 instance, on exit reduced mod Modulus
+ */
+extern void FP2_reduce(FP2 *x);
+/**	@brief Raises an FP2 to the power of a BIG
+ *
+	@param x FP2 instance, on exit = y^b
+	@param y FP2 instance
+	@param b BIG number
+ */
+extern void FP2_pow(FP2 *x, FP2 *y, B464_60::BIG b);
+
+/**	@brief Test FP2 for QR
+ *
+	@param x FP2 instance
+    @param h optional generated hint
+	@return true or false
+ */
+extern int FP2_qr(FP2 *x,FP *h);
+
+
+/**	@brief Square root of an FP2
+ *
+	@param x FP2 instance, on exit = sqrt(y)
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_sqrt(FP2 *x, FP2 *y, FP *h);
+
+/**	@brief Multiply an FP2 by sqrt(-1)
+ *
+	Note that -1 is QNR
+	@param x FP2 instance, on exit = x*sqrt(-1)
+ */
+extern void FP2_times_i(FP2 *x);
+
+/**	@brief Generate random FP2
+ *
+	@param x random FP2 number
+	@param rng random number generator
+ */
+extern void FP2_rand(FP2 *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp2_BLS24479.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp2_BLS24479.h
new file mode 100644
index 0000000..a67e351
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp2_BLS24479.h
@@ -0,0 +1,306 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP2_BLS24479_H
+#define FP2_BLS24479_H
+
+#include "fp_BLS24479.h"
+
+using namespace core;
+
+namespace BLS24479 {
+
+/**
+	@brief FP2 Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    FP a; /**< real part of FP2 */
+    FP b; /**< imaginary part of FP2 */
+} FP2;
+
+/* FP2 prototypes */
+
+/**	@brief Tests for FP2 equal to zero
+ *
+	@param x FP2 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP2_iszilch(FP2 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP2 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP2_islarger(FP2 *x);
+
+
+/**	@brief Serialize out FP2  
+ *
+    @param b buffer for output
+	@param x FP2 number to be serialized
+ */
+extern void FP2_toBytes(char *b,FP2 *x);
+
+/**	@brief Serialize in FP2  
+ *
+	@param x FP2 number to be serialized
+    @param b buffer for input
+ */
+extern void FP2_fromBytes(FP2 *x,char *b);
+
+/**	@brief Conditional copy of FP2 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP2 instance, set to y if s!=0
+	@param y another FP2 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP2_cmove(FP2 *x, FP2 *y, int s);
+/**	@brief Tests for FP2 equal to one
+ *
+	@param x FP2 instance to be tested
+	@return 1 if x=1, else returns 0
+ */
+extern int FP2_isunity(FP2 *x);
+/**	@brief Tests for equality of two FP2s
+ *
+	@param x FP2 instance to be compared
+	@param y FP2 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP2_equals(FP2 *x, FP2 *y);
+/**	@brief Initialise FP2 from two FP numbers
+ *
+	@param x FP2 instance to be initialised
+	@param a FP to form real part of FP2
+	@param b FP to form imaginary part of FP2
+ */
+extern void FP2_from_FPs(FP2 *x, FP *a, FP *b);
+/**	@brief Initialise FP2 from two BIG integers
+ *
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+	@param b BIG to form imaginary part of FP2
+ */
+extern void FP2_from_BIGs(FP2 *x, B480_56::BIG a, B480_56::BIG b);
+
+
+/**	@brief Initialise FP2 from two integers
+ *
+	@param x FP2 instance to be initialised
+	@param a int to form real part of FP2
+	@param b int to form imaginary part of FP2
+ */
+extern void FP2_from_ints(FP2 *x, int a, int b);
+
+
+
+/**	@brief Initialise FP2 from single FP
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param an FP to form real part of FP2
+ */
+extern void FP2_from_FP(FP2 *x, FP *a);
+/**	@brief Initialise FP2 from single BIG
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+ */
+extern void FP2_from_BIG(FP2 *x, B480_56::BIG a);
+/**	@brief Copy FP2 to another FP2
+ *
+	@param x FP2 instance, on exit = y
+	@param y FP2 instance to be copied
+ */
+extern void FP2_copy(FP2 *x, FP2 *y);
+/**	@brief Set FP2 to zero
+ *
+	@param x FP2 instance to be set to zero
+ */
+extern void FP2_zero(FP2 *x);
+/**	@brief Set FP2 to unity
+ *
+	@param x FP2 instance to be set to one
+ */
+extern void FP2_one(FP2 *x);
+
+/**	@brief Copy from ROM to an FP2
+ *
+	@param w FP2 number to be copied to
+	@param a BIG real part to be copied from ROM
+	@param b BIG imag part to be copied from ROM
+ */
+extern void FP2_rcopy(FP2 *w,const B480_56::BIG a,const B480_56::BIG b);
+
+/**	@brief Sign of FP2
+ *
+	@param x FP2 instance
+	@return "sign" of FP2
+ */
+extern int FP2_sign(FP2 *x);
+
+/**	@brief Negation of FP2
+ *
+	@param x FP2 instance, on exit = -y
+	@param y FP2 instance
+ */
+extern void FP2_neg(FP2 *x, FP2 *y);
+
+
+/**	@brief Conjugation of FP2
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP2 instance, on exit = conj(y)
+	@param y FP2 instance
+ */
+extern void FP2_conj(FP2 *x, FP2 *y);
+/**	@brief addition of two FP2s
+ *
+	@param x FP2 instance, on exit = y+z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_add(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief subtraction of two FP2s
+ *
+	@param x FP2 instance, on exit = y-z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_sub(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Multiplication of an FP2 by an FP
+ *
+	@param x FP2 instance, on exit = y*b
+	@param y FP2 instance
+	@param b FP residue
+ */
+extern void FP2_pmul(FP2 *x, FP2 *y, FP *b);
+/**	@brief Multiplication of an FP2 by a small integer
+ *
+	@param x FP2 instance, on exit = y*i
+	@param y FP2 instance
+	@param i an integer
+ */
+extern void FP2_imul(FP2 *x, FP2 *y, int i);
+/**	@brief Squaring an FP2
+ *
+	@param x FP2 instance, on exit = y^2
+	@param y FP2 instance
+ */
+extern void FP2_sqr(FP2 *x, FP2 *y);
+/**	@brief Multiplication of two FP2s
+ *
+	@param x FP2 instance, on exit = y*z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_mul(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Formats and outputs an FP2 to the console
+ *
+	@param x FP2 instance
+ */
+extern void FP2_output(FP2 *x);
+/**	@brief Formats and outputs an FP2 to the console in raw form (for debugging)
+ *
+	@param x FP2 instance
+ */
+extern void FP2_rawoutput(FP2 *x);
+/**	@brief Inverting an FP2
+ *
+	@param x FP2 instance, on exit = 1/y
+	@param y FP2 instance
+ */
+extern void FP2_inv(FP2 *x, FP2 *y, FP *h);
+/**	@brief Divide an FP2 by 2
+ *
+	@param x FP2 instance, on exit = y/2
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_div2(FP2 *x, FP2 *y);
+/**	@brief Multiply an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x*(1+sqrt(-1))
+ */
+extern void FP2_mul_ip(FP2 *x);
+
+/**	@brief Divide an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x/(1+sqrt(-1))
+ */
+extern void FP2_div_ip(FP2 *x);
+/**	@brief Normalises the components of an FP2
+ *
+	@param x FP2 instance to be normalised
+ */
+extern void FP2_norm(FP2 *x);
+/**	@brief Reduces all components of possibly unreduced FP2 mod Modulus
+ *
+	@param x FP2 instance, on exit reduced mod Modulus
+ */
+extern void FP2_reduce(FP2 *x);
+/**	@brief Raises an FP2 to the power of a BIG
+ *
+	@param x FP2 instance, on exit = y^b
+	@param y FP2 instance
+	@param b BIG number
+ */
+extern void FP2_pow(FP2 *x, FP2 *y, B480_56::BIG b);
+
+/**	@brief Test FP2 for QR
+ *
+	@param x FP2 instance
+    @param h optional generated hint
+	@return true or false
+ */
+extern int FP2_qr(FP2 *x,FP *h);
+
+
+/**	@brief Square root of an FP2
+ *
+	@param x FP2 instance, on exit = sqrt(y)
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_sqrt(FP2 *x, FP2 *y, FP *h);
+
+/**	@brief Multiply an FP2 by sqrt(-1)
+ *
+	Note that -1 is QNR
+	@param x FP2 instance, on exit = x*sqrt(-1)
+ */
+extern void FP2_times_i(FP2 *x);
+
+/**	@brief Generate random FP2
+ *
+	@param x random FP2 number
+	@param rng random number generator
+ */
+extern void FP2_rand(FP2 *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp2_BLS48286.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp2_BLS48286.h
new file mode 100644
index 0000000..a5c6fce
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp2_BLS48286.h
@@ -0,0 +1,306 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP2_BLS48286_H
+#define FP2_BLS48286_H
+
+#include "fp_BLS48286.h"
+
+using namespace core;
+
+namespace BLS48286 {
+
+/**
+	@brief FP2 Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    FP a; /**< real part of FP2 */
+    FP b; /**< imaginary part of FP2 */
+} FP2;
+
+/* FP2 prototypes */
+
+/**	@brief Tests for FP2 equal to zero
+ *
+	@param x FP2 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP2_iszilch(FP2 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP2 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP2_islarger(FP2 *x);
+
+
+/**	@brief Serialize out FP2  
+ *
+    @param b buffer for output
+	@param x FP2 number to be serialized
+ */
+extern void FP2_toBytes(char *b,FP2 *x);
+
+/**	@brief Serialize in FP2  
+ *
+	@param x FP2 number to be serialized
+    @param b buffer for input
+ */
+extern void FP2_fromBytes(FP2 *x,char *b);
+
+/**	@brief Conditional copy of FP2 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP2 instance, set to y if s!=0
+	@param y another FP2 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP2_cmove(FP2 *x, FP2 *y, int s);
+/**	@brief Tests for FP2 equal to one
+ *
+	@param x FP2 instance to be tested
+	@return 1 if x=1, else returns 0
+ */
+extern int FP2_isunity(FP2 *x);
+/**	@brief Tests for equality of two FP2s
+ *
+	@param x FP2 instance to be compared
+	@param y FP2 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP2_equals(FP2 *x, FP2 *y);
+/**	@brief Initialise FP2 from two FP numbers
+ *
+	@param x FP2 instance to be initialised
+	@param a FP to form real part of FP2
+	@param b FP to form imaginary part of FP2
+ */
+extern void FP2_from_FPs(FP2 *x, FP *a, FP *b);
+/**	@brief Initialise FP2 from two BIG integers
+ *
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+	@param b BIG to form imaginary part of FP2
+ */
+extern void FP2_from_BIGs(FP2 *x, B288_60::BIG a, B288_60::BIG b);
+
+
+/**	@brief Initialise FP2 from two integers
+ *
+	@param x FP2 instance to be initialised
+	@param a int to form real part of FP2
+	@param b int to form imaginary part of FP2
+ */
+extern void FP2_from_ints(FP2 *x, int a, int b);
+
+
+
+/**	@brief Initialise FP2 from single FP
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param an FP to form real part of FP2
+ */
+extern void FP2_from_FP(FP2 *x, FP *a);
+/**	@brief Initialise FP2 from single BIG
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+ */
+extern void FP2_from_BIG(FP2 *x, B288_60::BIG a);
+/**	@brief Copy FP2 to another FP2
+ *
+	@param x FP2 instance, on exit = y
+	@param y FP2 instance to be copied
+ */
+extern void FP2_copy(FP2 *x, FP2 *y);
+/**	@brief Set FP2 to zero
+ *
+	@param x FP2 instance to be set to zero
+ */
+extern void FP2_zero(FP2 *x);
+/**	@brief Set FP2 to unity
+ *
+	@param x FP2 instance to be set to one
+ */
+extern void FP2_one(FP2 *x);
+
+/**	@brief Copy from ROM to an FP2
+ *
+	@param w FP2 number to be copied to
+	@param a BIG real part to be copied from ROM
+	@param b BIG imag part to be copied from ROM
+ */
+extern void FP2_rcopy(FP2 *w,const B288_60::BIG a,const B288_60::BIG b);
+
+/**	@brief Sign of FP2
+ *
+	@param x FP2 instance
+	@return "sign" of FP2
+ */
+extern int FP2_sign(FP2 *x);
+
+/**	@brief Negation of FP2
+ *
+	@param x FP2 instance, on exit = -y
+	@param y FP2 instance
+ */
+extern void FP2_neg(FP2 *x, FP2 *y);
+
+
+/**	@brief Conjugation of FP2
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP2 instance, on exit = conj(y)
+	@param y FP2 instance
+ */
+extern void FP2_conj(FP2 *x, FP2 *y);
+/**	@brief addition of two FP2s
+ *
+	@param x FP2 instance, on exit = y+z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_add(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief subtraction of two FP2s
+ *
+	@param x FP2 instance, on exit = y-z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_sub(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Multiplication of an FP2 by an FP
+ *
+	@param x FP2 instance, on exit = y*b
+	@param y FP2 instance
+	@param b FP residue
+ */
+extern void FP2_pmul(FP2 *x, FP2 *y, FP *b);
+/**	@brief Multiplication of an FP2 by a small integer
+ *
+	@param x FP2 instance, on exit = y*i
+	@param y FP2 instance
+	@param i an integer
+ */
+extern void FP2_imul(FP2 *x, FP2 *y, int i);
+/**	@brief Squaring an FP2
+ *
+	@param x FP2 instance, on exit = y^2
+	@param y FP2 instance
+ */
+extern void FP2_sqr(FP2 *x, FP2 *y);
+/**	@brief Multiplication of two FP2s
+ *
+	@param x FP2 instance, on exit = y*z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_mul(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Formats and outputs an FP2 to the console
+ *
+	@param x FP2 instance
+ */
+extern void FP2_output(FP2 *x);
+/**	@brief Formats and outputs an FP2 to the console in raw form (for debugging)
+ *
+	@param x FP2 instance
+ */
+extern void FP2_rawoutput(FP2 *x);
+/**	@brief Inverting an FP2
+ *
+	@param x FP2 instance, on exit = 1/y
+	@param y FP2 instance
+ */
+extern void FP2_inv(FP2 *x, FP2 *y, FP *h);
+/**	@brief Divide an FP2 by 2
+ *
+	@param x FP2 instance, on exit = y/2
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_div2(FP2 *x, FP2 *y);
+/**	@brief Multiply an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x*(1+sqrt(-1))
+ */
+extern void FP2_mul_ip(FP2 *x);
+
+/**	@brief Divide an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x/(1+sqrt(-1))
+ */
+extern void FP2_div_ip(FP2 *x);
+/**	@brief Normalises the components of an FP2
+ *
+	@param x FP2 instance to be normalised
+ */
+extern void FP2_norm(FP2 *x);
+/**	@brief Reduces all components of possibly unreduced FP2 mod Modulus
+ *
+	@param x FP2 instance, on exit reduced mod Modulus
+ */
+extern void FP2_reduce(FP2 *x);
+/**	@brief Raises an FP2 to the power of a BIG
+ *
+	@param x FP2 instance, on exit = y^b
+	@param y FP2 instance
+	@param b BIG number
+ */
+extern void FP2_pow(FP2 *x, FP2 *y, B288_60::BIG b);
+
+/**	@brief Test FP2 for QR
+ *
+	@param x FP2 instance
+    @param h optional generated hint
+	@return true or false
+ */
+extern int FP2_qr(FP2 *x,FP *h);
+
+
+/**	@brief Square root of an FP2
+ *
+	@param x FP2 instance, on exit = sqrt(y)
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_sqrt(FP2 *x, FP2 *y, FP *h);
+
+/**	@brief Multiply an FP2 by sqrt(-1)
+ *
+	Note that -1 is QNR
+	@param x FP2 instance, on exit = x*sqrt(-1)
+ */
+extern void FP2_times_i(FP2 *x);
+
+/**	@brief Generate random FP2
+ *
+	@param x random FP2 number
+	@param rng random number generator
+ */
+extern void FP2_rand(FP2 *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp2_BLS48556.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp2_BLS48556.h
new file mode 100644
index 0000000..a569c2d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp2_BLS48556.h
@@ -0,0 +1,306 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP2_BLS48556_H
+#define FP2_BLS48556_H
+
+#include "fp_BLS48556.h"
+
+using namespace core;
+
+namespace BLS48556 {
+
+/**
+	@brief FP2 Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    FP a; /**< real part of FP2 */
+    FP b; /**< imaginary part of FP2 */
+} FP2;
+
+/* FP2 prototypes */
+
+/**	@brief Tests for FP2 equal to zero
+ *
+	@param x FP2 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP2_iszilch(FP2 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP2 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP2_islarger(FP2 *x);
+
+
+/**	@brief Serialize out FP2  
+ *
+    @param b buffer for output
+	@param x FP2 number to be serialized
+ */
+extern void FP2_toBytes(char *b,FP2 *x);
+
+/**	@brief Serialize in FP2  
+ *
+	@param x FP2 number to be serialized
+    @param b buffer for input
+ */
+extern void FP2_fromBytes(FP2 *x,char *b);
+
+/**	@brief Conditional copy of FP2 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP2 instance, set to y if s!=0
+	@param y another FP2 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP2_cmove(FP2 *x, FP2 *y, int s);
+/**	@brief Tests for FP2 equal to one
+ *
+	@param x FP2 instance to be tested
+	@return 1 if x=1, else returns 0
+ */
+extern int FP2_isunity(FP2 *x);
+/**	@brief Tests for equality of two FP2s
+ *
+	@param x FP2 instance to be compared
+	@param y FP2 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP2_equals(FP2 *x, FP2 *y);
+/**	@brief Initialise FP2 from two FP numbers
+ *
+	@param x FP2 instance to be initialised
+	@param a FP to form real part of FP2
+	@param b FP to form imaginary part of FP2
+ */
+extern void FP2_from_FPs(FP2 *x, FP *a, FP *b);
+/**	@brief Initialise FP2 from two BIG integers
+ *
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+	@param b BIG to form imaginary part of FP2
+ */
+extern void FP2_from_BIGs(FP2 *x, B560_58::BIG a, B560_58::BIG b);
+
+
+/**	@brief Initialise FP2 from two integers
+ *
+	@param x FP2 instance to be initialised
+	@param a int to form real part of FP2
+	@param b int to form imaginary part of FP2
+ */
+extern void FP2_from_ints(FP2 *x, int a, int b);
+
+
+
+/**	@brief Initialise FP2 from single FP
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param an FP to form real part of FP2
+ */
+extern void FP2_from_FP(FP2 *x, FP *a);
+/**	@brief Initialise FP2 from single BIG
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+ */
+extern void FP2_from_BIG(FP2 *x, B560_58::BIG a);
+/**	@brief Copy FP2 to another FP2
+ *
+	@param x FP2 instance, on exit = y
+	@param y FP2 instance to be copied
+ */
+extern void FP2_copy(FP2 *x, FP2 *y);
+/**	@brief Set FP2 to zero
+ *
+	@param x FP2 instance to be set to zero
+ */
+extern void FP2_zero(FP2 *x);
+/**	@brief Set FP2 to unity
+ *
+	@param x FP2 instance to be set to one
+ */
+extern void FP2_one(FP2 *x);
+
+/**	@brief Copy from ROM to an FP2
+ *
+	@param w FP2 number to be copied to
+	@param a BIG real part to be copied from ROM
+	@param b BIG imag part to be copied from ROM
+ */
+extern void FP2_rcopy(FP2 *w,const B560_58::BIG a,const B560_58::BIG b);
+
+/**	@brief Sign of FP2
+ *
+	@param x FP2 instance
+	@return "sign" of FP2
+ */
+extern int FP2_sign(FP2 *x);
+
+/**	@brief Negation of FP2
+ *
+	@param x FP2 instance, on exit = -y
+	@param y FP2 instance
+ */
+extern void FP2_neg(FP2 *x, FP2 *y);
+
+
+/**	@brief Conjugation of FP2
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP2 instance, on exit = conj(y)
+	@param y FP2 instance
+ */
+extern void FP2_conj(FP2 *x, FP2 *y);
+/**	@brief addition of two FP2s
+ *
+	@param x FP2 instance, on exit = y+z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_add(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief subtraction of two FP2s
+ *
+	@param x FP2 instance, on exit = y-z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_sub(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Multiplication of an FP2 by an FP
+ *
+	@param x FP2 instance, on exit = y*b
+	@param y FP2 instance
+	@param b FP residue
+ */
+extern void FP2_pmul(FP2 *x, FP2 *y, FP *b);
+/**	@brief Multiplication of an FP2 by a small integer
+ *
+	@param x FP2 instance, on exit = y*i
+	@param y FP2 instance
+	@param i an integer
+ */
+extern void FP2_imul(FP2 *x, FP2 *y, int i);
+/**	@brief Squaring an FP2
+ *
+	@param x FP2 instance, on exit = y^2
+	@param y FP2 instance
+ */
+extern void FP2_sqr(FP2 *x, FP2 *y);
+/**	@brief Multiplication of two FP2s
+ *
+	@param x FP2 instance, on exit = y*z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_mul(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Formats and outputs an FP2 to the console
+ *
+	@param x FP2 instance
+ */
+extern void FP2_output(FP2 *x);
+/**	@brief Formats and outputs an FP2 to the console in raw form (for debugging)
+ *
+	@param x FP2 instance
+ */
+extern void FP2_rawoutput(FP2 *x);
+/**	@brief Inverting an FP2
+ *
+	@param x FP2 instance, on exit = 1/y
+	@param y FP2 instance
+ */
+extern void FP2_inv(FP2 *x, FP2 *y, FP *h);
+/**	@brief Divide an FP2 by 2
+ *
+	@param x FP2 instance, on exit = y/2
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_div2(FP2 *x, FP2 *y);
+/**	@brief Multiply an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x*(1+sqrt(-1))
+ */
+extern void FP2_mul_ip(FP2 *x);
+
+/**	@brief Divide an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x/(1+sqrt(-1))
+ */
+extern void FP2_div_ip(FP2 *x);
+/**	@brief Normalises the components of an FP2
+ *
+	@param x FP2 instance to be normalised
+ */
+extern void FP2_norm(FP2 *x);
+/**	@brief Reduces all components of possibly unreduced FP2 mod Modulus
+ *
+	@param x FP2 instance, on exit reduced mod Modulus
+ */
+extern void FP2_reduce(FP2 *x);
+/**	@brief Raises an FP2 to the power of a BIG
+ *
+	@param x FP2 instance, on exit = y^b
+	@param y FP2 instance
+	@param b BIG number
+ */
+extern void FP2_pow(FP2 *x, FP2 *y, B560_58::BIG b);
+
+/**	@brief Test FP2 for QR
+ *
+	@param x FP2 instance
+    @param h optional generated hint
+	@return true or false
+ */
+extern int FP2_qr(FP2 *x,FP *h);
+
+
+/**	@brief Square root of an FP2
+ *
+	@param x FP2 instance, on exit = sqrt(y)
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_sqrt(FP2 *x, FP2 *y, FP *h);
+
+/**	@brief Multiply an FP2 by sqrt(-1)
+ *
+	Note that -1 is QNR
+	@param x FP2 instance, on exit = x*sqrt(-1)
+ */
+extern void FP2_times_i(FP2 *x);
+
+/**	@brief Generate random FP2
+ *
+	@param x random FP2 number
+	@param rng random number generator
+ */
+extern void FP2_rand(FP2 *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp2_BLS48581.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp2_BLS48581.h
new file mode 100644
index 0000000..ef3b7fd
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp2_BLS48581.h
@@ -0,0 +1,306 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP2_BLS48581_H
+#define FP2_BLS48581_H
+
+#include "fp_BLS48581.h"
+
+using namespace core;
+
+namespace BLS48581 {
+
+/**
+	@brief FP2 Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    FP a; /**< real part of FP2 */
+    FP b; /**< imaginary part of FP2 */
+} FP2;
+
+/* FP2 prototypes */
+
+/**	@brief Tests for FP2 equal to zero
+ *
+	@param x FP2 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP2_iszilch(FP2 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP2 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP2_islarger(FP2 *x);
+
+
+/**	@brief Serialize out FP2  
+ *
+    @param b buffer for output
+	@param x FP2 number to be serialized
+ */
+extern void FP2_toBytes(char *b,FP2 *x);
+
+/**	@brief Serialize in FP2  
+ *
+	@param x FP2 number to be serialized
+    @param b buffer for input
+ */
+extern void FP2_fromBytes(FP2 *x,char *b);
+
+/**	@brief Conditional copy of FP2 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP2 instance, set to y if s!=0
+	@param y another FP2 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP2_cmove(FP2 *x, FP2 *y, int s);
+/**	@brief Tests for FP2 equal to one
+ *
+	@param x FP2 instance to be tested
+	@return 1 if x=1, else returns 0
+ */
+extern int FP2_isunity(FP2 *x);
+/**	@brief Tests for equality of two FP2s
+ *
+	@param x FP2 instance to be compared
+	@param y FP2 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP2_equals(FP2 *x, FP2 *y);
+/**	@brief Initialise FP2 from two FP numbers
+ *
+	@param x FP2 instance to be initialised
+	@param a FP to form real part of FP2
+	@param b FP to form imaginary part of FP2
+ */
+extern void FP2_from_FPs(FP2 *x, FP *a, FP *b);
+/**	@brief Initialise FP2 from two BIG integers
+ *
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+	@param b BIG to form imaginary part of FP2
+ */
+extern void FP2_from_BIGs(FP2 *x, B584_60::BIG a, B584_60::BIG b);
+
+
+/**	@brief Initialise FP2 from two integers
+ *
+	@param x FP2 instance to be initialised
+	@param a int to form real part of FP2
+	@param b int to form imaginary part of FP2
+ */
+extern void FP2_from_ints(FP2 *x, int a, int b);
+
+
+
+/**	@brief Initialise FP2 from single FP
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param an FP to form real part of FP2
+ */
+extern void FP2_from_FP(FP2 *x, FP *a);
+/**	@brief Initialise FP2 from single BIG
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+ */
+extern void FP2_from_BIG(FP2 *x, B584_60::BIG a);
+/**	@brief Copy FP2 to another FP2
+ *
+	@param x FP2 instance, on exit = y
+	@param y FP2 instance to be copied
+ */
+extern void FP2_copy(FP2 *x, FP2 *y);
+/**	@brief Set FP2 to zero
+ *
+	@param x FP2 instance to be set to zero
+ */
+extern void FP2_zero(FP2 *x);
+/**	@brief Set FP2 to unity
+ *
+	@param x FP2 instance to be set to one
+ */
+extern void FP2_one(FP2 *x);
+
+/**	@brief Copy from ROM to an FP2
+ *
+	@param w FP2 number to be copied to
+	@param a BIG real part to be copied from ROM
+	@param b BIG imag part to be copied from ROM
+ */
+extern void FP2_rcopy(FP2 *w,const B584_60::BIG a,const B584_60::BIG b);
+
+/**	@brief Sign of FP2
+ *
+	@param x FP2 instance
+	@return "sign" of FP2
+ */
+extern int FP2_sign(FP2 *x);
+
+/**	@brief Negation of FP2
+ *
+	@param x FP2 instance, on exit = -y
+	@param y FP2 instance
+ */
+extern void FP2_neg(FP2 *x, FP2 *y);
+
+
+/**	@brief Conjugation of FP2
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP2 instance, on exit = conj(y)
+	@param y FP2 instance
+ */
+extern void FP2_conj(FP2 *x, FP2 *y);
+/**	@brief addition of two FP2s
+ *
+	@param x FP2 instance, on exit = y+z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_add(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief subtraction of two FP2s
+ *
+	@param x FP2 instance, on exit = y-z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_sub(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Multiplication of an FP2 by an FP
+ *
+	@param x FP2 instance, on exit = y*b
+	@param y FP2 instance
+	@param b FP residue
+ */
+extern void FP2_pmul(FP2 *x, FP2 *y, FP *b);
+/**	@brief Multiplication of an FP2 by a small integer
+ *
+	@param x FP2 instance, on exit = y*i
+	@param y FP2 instance
+	@param i an integer
+ */
+extern void FP2_imul(FP2 *x, FP2 *y, int i);
+/**	@brief Squaring an FP2
+ *
+	@param x FP2 instance, on exit = y^2
+	@param y FP2 instance
+ */
+extern void FP2_sqr(FP2 *x, FP2 *y);
+/**	@brief Multiplication of two FP2s
+ *
+	@param x FP2 instance, on exit = y*z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_mul(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Formats and outputs an FP2 to the console
+ *
+	@param x FP2 instance
+ */
+extern void FP2_output(FP2 *x);
+/**	@brief Formats and outputs an FP2 to the console in raw form (for debugging)
+ *
+	@param x FP2 instance
+ */
+extern void FP2_rawoutput(FP2 *x);
+/**	@brief Inverting an FP2
+ *
+	@param x FP2 instance, on exit = 1/y
+	@param y FP2 instance
+ */
+extern void FP2_inv(FP2 *x, FP2 *y, FP *h);
+/**	@brief Divide an FP2 by 2
+ *
+	@param x FP2 instance, on exit = y/2
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_div2(FP2 *x, FP2 *y);
+/**	@brief Multiply an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x*(1+sqrt(-1))
+ */
+extern void FP2_mul_ip(FP2 *x);
+
+/**	@brief Divide an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x/(1+sqrt(-1))
+ */
+extern void FP2_div_ip(FP2 *x);
+/**	@brief Normalises the components of an FP2
+ *
+	@param x FP2 instance to be normalised
+ */
+extern void FP2_norm(FP2 *x);
+/**	@brief Reduces all components of possibly unreduced FP2 mod Modulus
+ *
+	@param x FP2 instance, on exit reduced mod Modulus
+ */
+extern void FP2_reduce(FP2 *x);
+/**	@brief Raises an FP2 to the power of a BIG
+ *
+	@param x FP2 instance, on exit = y^b
+	@param y FP2 instance
+	@param b BIG number
+ */
+extern void FP2_pow(FP2 *x, FP2 *y, B584_60::BIG b);
+
+/**	@brief Test FP2 for QR
+ *
+	@param x FP2 instance
+    @param h optional generated hint
+	@return true or false
+ */
+extern int FP2_qr(FP2 *x,FP *h);
+
+
+/**	@brief Square root of an FP2
+ *
+	@param x FP2 instance, on exit = sqrt(y)
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_sqrt(FP2 *x, FP2 *y, FP *h);
+
+/**	@brief Multiply an FP2 by sqrt(-1)
+ *
+	Note that -1 is QNR
+	@param x FP2 instance, on exit = x*sqrt(-1)
+ */
+extern void FP2_times_i(FP2 *x);
+
+/**	@brief Generate random FP2
+ *
+	@param x random FP2 number
+	@param rng random number generator
+ */
+extern void FP2_rand(FP2 *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp2_BN158.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp2_BN158.h
new file mode 100644
index 0000000..5904174
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp2_BN158.h
@@ -0,0 +1,306 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP2_BN158_H
+#define FP2_BN158_H
+
+#include "fp_BN158.h"
+
+using namespace core;
+
+namespace BN158 {
+
+/**
+	@brief FP2 Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    FP a; /**< real part of FP2 */
+    FP b; /**< imaginary part of FP2 */
+} FP2;
+
+/* FP2 prototypes */
+
+/**	@brief Tests for FP2 equal to zero
+ *
+	@param x FP2 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP2_iszilch(FP2 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP2 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP2_islarger(FP2 *x);
+
+
+/**	@brief Serialize out FP2  
+ *
+    @param b buffer for output
+	@param x FP2 number to be serialized
+ */
+extern void FP2_toBytes(char *b,FP2 *x);
+
+/**	@brief Serialize in FP2  
+ *
+	@param x FP2 number to be serialized
+    @param b buffer for input
+ */
+extern void FP2_fromBytes(FP2 *x,char *b);
+
+/**	@brief Conditional copy of FP2 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP2 instance, set to y if s!=0
+	@param y another FP2 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP2_cmove(FP2 *x, FP2 *y, int s);
+/**	@brief Tests for FP2 equal to one
+ *
+	@param x FP2 instance to be tested
+	@return 1 if x=1, else returns 0
+ */
+extern int FP2_isunity(FP2 *x);
+/**	@brief Tests for equality of two FP2s
+ *
+	@param x FP2 instance to be compared
+	@param y FP2 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP2_equals(FP2 *x, FP2 *y);
+/**	@brief Initialise FP2 from two FP numbers
+ *
+	@param x FP2 instance to be initialised
+	@param a FP to form real part of FP2
+	@param b FP to form imaginary part of FP2
+ */
+extern void FP2_from_FPs(FP2 *x, FP *a, FP *b);
+/**	@brief Initialise FP2 from two BIG integers
+ *
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+	@param b BIG to form imaginary part of FP2
+ */
+extern void FP2_from_BIGs(FP2 *x, B160_56::BIG a, B160_56::BIG b);
+
+
+/**	@brief Initialise FP2 from two integers
+ *
+	@param x FP2 instance to be initialised
+	@param a int to form real part of FP2
+	@param b int to form imaginary part of FP2
+ */
+extern void FP2_from_ints(FP2 *x, int a, int b);
+
+
+
+/**	@brief Initialise FP2 from single FP
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param an FP to form real part of FP2
+ */
+extern void FP2_from_FP(FP2 *x, FP *a);
+/**	@brief Initialise FP2 from single BIG
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+ */
+extern void FP2_from_BIG(FP2 *x, B160_56::BIG a);
+/**	@brief Copy FP2 to another FP2
+ *
+	@param x FP2 instance, on exit = y
+	@param y FP2 instance to be copied
+ */
+extern void FP2_copy(FP2 *x, FP2 *y);
+/**	@brief Set FP2 to zero
+ *
+	@param x FP2 instance to be set to zero
+ */
+extern void FP2_zero(FP2 *x);
+/**	@brief Set FP2 to unity
+ *
+	@param x FP2 instance to be set to one
+ */
+extern void FP2_one(FP2 *x);
+
+/**	@brief Copy from ROM to an FP2
+ *
+	@param w FP2 number to be copied to
+	@param a BIG real part to be copied from ROM
+	@param b BIG imag part to be copied from ROM
+ */
+extern void FP2_rcopy(FP2 *w,const B160_56::BIG a,const B160_56::BIG b);
+
+/**	@brief Sign of FP2
+ *
+	@param x FP2 instance
+	@return "sign" of FP2
+ */
+extern int FP2_sign(FP2 *x);
+
+/**	@brief Negation of FP2
+ *
+	@param x FP2 instance, on exit = -y
+	@param y FP2 instance
+ */
+extern void FP2_neg(FP2 *x, FP2 *y);
+
+
+/**	@brief Conjugation of FP2
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP2 instance, on exit = conj(y)
+	@param y FP2 instance
+ */
+extern void FP2_conj(FP2 *x, FP2 *y);
+/**	@brief addition of two FP2s
+ *
+	@param x FP2 instance, on exit = y+z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_add(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief subtraction of two FP2s
+ *
+	@param x FP2 instance, on exit = y-z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_sub(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Multiplication of an FP2 by an FP
+ *
+	@param x FP2 instance, on exit = y*b
+	@param y FP2 instance
+	@param b FP residue
+ */
+extern void FP2_pmul(FP2 *x, FP2 *y, FP *b);
+/**	@brief Multiplication of an FP2 by a small integer
+ *
+	@param x FP2 instance, on exit = y*i
+	@param y FP2 instance
+	@param i an integer
+ */
+extern void FP2_imul(FP2 *x, FP2 *y, int i);
+/**	@brief Squaring an FP2
+ *
+	@param x FP2 instance, on exit = y^2
+	@param y FP2 instance
+ */
+extern void FP2_sqr(FP2 *x, FP2 *y);
+/**	@brief Multiplication of two FP2s
+ *
+	@param x FP2 instance, on exit = y*z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_mul(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Formats and outputs an FP2 to the console
+ *
+	@param x FP2 instance
+ */
+extern void FP2_output(FP2 *x);
+/**	@brief Formats and outputs an FP2 to the console in raw form (for debugging)
+ *
+	@param x FP2 instance
+ */
+extern void FP2_rawoutput(FP2 *x);
+/**	@brief Inverting an FP2
+ *
+	@param x FP2 instance, on exit = 1/y
+	@param y FP2 instance
+ */
+extern void FP2_inv(FP2 *x, FP2 *y, FP *h);
+/**	@brief Divide an FP2 by 2
+ *
+	@param x FP2 instance, on exit = y/2
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_div2(FP2 *x, FP2 *y);
+/**	@brief Multiply an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x*(1+sqrt(-1))
+ */
+extern void FP2_mul_ip(FP2 *x);
+
+/**	@brief Divide an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x/(1+sqrt(-1))
+ */
+extern void FP2_div_ip(FP2 *x);
+/**	@brief Normalises the components of an FP2
+ *
+	@param x FP2 instance to be normalised
+ */
+extern void FP2_norm(FP2 *x);
+/**	@brief Reduces all components of possibly unreduced FP2 mod Modulus
+ *
+	@param x FP2 instance, on exit reduced mod Modulus
+ */
+extern void FP2_reduce(FP2 *x);
+/**	@brief Raises an FP2 to the power of a BIG
+ *
+	@param x FP2 instance, on exit = y^b
+	@param y FP2 instance
+	@param b BIG number
+ */
+extern void FP2_pow(FP2 *x, FP2 *y, B160_56::BIG b);
+
+/**	@brief Test FP2 for QR
+ *
+	@param x FP2 instance
+    @param h optional generated hint
+	@return true or false
+ */
+extern int FP2_qr(FP2 *x,FP *h);
+
+
+/**	@brief Square root of an FP2
+ *
+	@param x FP2 instance, on exit = sqrt(y)
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_sqrt(FP2 *x, FP2 *y, FP *h);
+
+/**	@brief Multiply an FP2 by sqrt(-1)
+ *
+	Note that -1 is QNR
+	@param x FP2 instance, on exit = x*sqrt(-1)
+ */
+extern void FP2_times_i(FP2 *x);
+
+/**	@brief Generate random FP2
+ *
+	@param x random FP2 number
+	@param rng random number generator
+ */
+extern void FP2_rand(FP2 *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp2_BN254.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp2_BN254.h
new file mode 100644
index 0000000..2e2f476
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp2_BN254.h
@@ -0,0 +1,306 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP2_BN254_H
+#define FP2_BN254_H
+
+#include "fp_BN254.h"
+
+using namespace core;
+
+namespace BN254 {
+
+/**
+	@brief FP2 Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    FP a; /**< real part of FP2 */
+    FP b; /**< imaginary part of FP2 */
+} FP2;
+
+/* FP2 prototypes */
+
+/**	@brief Tests for FP2 equal to zero
+ *
+	@param x FP2 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP2_iszilch(FP2 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP2 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP2_islarger(FP2 *x);
+
+
+/**	@brief Serialize out FP2  
+ *
+    @param b buffer for output
+	@param x FP2 number to be serialized
+ */
+extern void FP2_toBytes(char *b,FP2 *x);
+
+/**	@brief Serialize in FP2  
+ *
+	@param x FP2 number to be serialized
+    @param b buffer for input
+ */
+extern void FP2_fromBytes(FP2 *x,char *b);
+
+/**	@brief Conditional copy of FP2 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP2 instance, set to y if s!=0
+	@param y another FP2 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP2_cmove(FP2 *x, FP2 *y, int s);
+/**	@brief Tests for FP2 equal to one
+ *
+	@param x FP2 instance to be tested
+	@return 1 if x=1, else returns 0
+ */
+extern int FP2_isunity(FP2 *x);
+/**	@brief Tests for equality of two FP2s
+ *
+	@param x FP2 instance to be compared
+	@param y FP2 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP2_equals(FP2 *x, FP2 *y);
+/**	@brief Initialise FP2 from two FP numbers
+ *
+	@param x FP2 instance to be initialised
+	@param a FP to form real part of FP2
+	@param b FP to form imaginary part of FP2
+ */
+extern void FP2_from_FPs(FP2 *x, FP *a, FP *b);
+/**	@brief Initialise FP2 from two BIG integers
+ *
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+	@param b BIG to form imaginary part of FP2
+ */
+extern void FP2_from_BIGs(FP2 *x, B256_56::BIG a, B256_56::BIG b);
+
+
+/**	@brief Initialise FP2 from two integers
+ *
+	@param x FP2 instance to be initialised
+	@param a int to form real part of FP2
+	@param b int to form imaginary part of FP2
+ */
+extern void FP2_from_ints(FP2 *x, int a, int b);
+
+
+
+/**	@brief Initialise FP2 from single FP
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param an FP to form real part of FP2
+ */
+extern void FP2_from_FP(FP2 *x, FP *a);
+/**	@brief Initialise FP2 from single BIG
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+ */
+extern void FP2_from_BIG(FP2 *x, B256_56::BIG a);
+/**	@brief Copy FP2 to another FP2
+ *
+	@param x FP2 instance, on exit = y
+	@param y FP2 instance to be copied
+ */
+extern void FP2_copy(FP2 *x, FP2 *y);
+/**	@brief Set FP2 to zero
+ *
+	@param x FP2 instance to be set to zero
+ */
+extern void FP2_zero(FP2 *x);
+/**	@brief Set FP2 to unity
+ *
+	@param x FP2 instance to be set to one
+ */
+extern void FP2_one(FP2 *x);
+
+/**	@brief Copy from ROM to an FP2
+ *
+	@param w FP2 number to be copied to
+	@param a BIG real part to be copied from ROM
+	@param b BIG imag part to be copied from ROM
+ */
+extern void FP2_rcopy(FP2 *w,const B256_56::BIG a,const B256_56::BIG b);
+
+/**	@brief Sign of FP2
+ *
+	@param x FP2 instance
+	@return "sign" of FP2
+ */
+extern int FP2_sign(FP2 *x);
+
+/**	@brief Negation of FP2
+ *
+	@param x FP2 instance, on exit = -y
+	@param y FP2 instance
+ */
+extern void FP2_neg(FP2 *x, FP2 *y);
+
+
+/**	@brief Conjugation of FP2
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP2 instance, on exit = conj(y)
+	@param y FP2 instance
+ */
+extern void FP2_conj(FP2 *x, FP2 *y);
+/**	@brief addition of two FP2s
+ *
+	@param x FP2 instance, on exit = y+z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_add(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief subtraction of two FP2s
+ *
+	@param x FP2 instance, on exit = y-z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_sub(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Multiplication of an FP2 by an FP
+ *
+	@param x FP2 instance, on exit = y*b
+	@param y FP2 instance
+	@param b FP residue
+ */
+extern void FP2_pmul(FP2 *x, FP2 *y, FP *b);
+/**	@brief Multiplication of an FP2 by a small integer
+ *
+	@param x FP2 instance, on exit = y*i
+	@param y FP2 instance
+	@param i an integer
+ */
+extern void FP2_imul(FP2 *x, FP2 *y, int i);
+/**	@brief Squaring an FP2
+ *
+	@param x FP2 instance, on exit = y^2
+	@param y FP2 instance
+ */
+extern void FP2_sqr(FP2 *x, FP2 *y);
+/**	@brief Multiplication of two FP2s
+ *
+	@param x FP2 instance, on exit = y*z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_mul(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Formats and outputs an FP2 to the console
+ *
+	@param x FP2 instance
+ */
+extern void FP2_output(FP2 *x);
+/**	@brief Formats and outputs an FP2 to the console in raw form (for debugging)
+ *
+	@param x FP2 instance
+ */
+extern void FP2_rawoutput(FP2 *x);
+/**	@brief Inverting an FP2
+ *
+	@param x FP2 instance, on exit = 1/y
+	@param y FP2 instance
+ */
+extern void FP2_inv(FP2 *x, FP2 *y, FP *h);
+/**	@brief Divide an FP2 by 2
+ *
+	@param x FP2 instance, on exit = y/2
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_div2(FP2 *x, FP2 *y);
+/**	@brief Multiply an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x*(1+sqrt(-1))
+ */
+extern void FP2_mul_ip(FP2 *x);
+
+/**	@brief Divide an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x/(1+sqrt(-1))
+ */
+extern void FP2_div_ip(FP2 *x);
+/**	@brief Normalises the components of an FP2
+ *
+	@param x FP2 instance to be normalised
+ */
+extern void FP2_norm(FP2 *x);
+/**	@brief Reduces all components of possibly unreduced FP2 mod Modulus
+ *
+	@param x FP2 instance, on exit reduced mod Modulus
+ */
+extern void FP2_reduce(FP2 *x);
+/**	@brief Raises an FP2 to the power of a BIG
+ *
+	@param x FP2 instance, on exit = y^b
+	@param y FP2 instance
+	@param b BIG number
+ */
+extern void FP2_pow(FP2 *x, FP2 *y, B256_56::BIG b);
+
+/**	@brief Test FP2 for QR
+ *
+	@param x FP2 instance
+    @param h optional generated hint
+	@return true or false
+ */
+extern int FP2_qr(FP2 *x,FP *h);
+
+
+/**	@brief Square root of an FP2
+ *
+	@param x FP2 instance, on exit = sqrt(y)
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_sqrt(FP2 *x, FP2 *y, FP *h);
+
+/**	@brief Multiply an FP2 by sqrt(-1)
+ *
+	Note that -1 is QNR
+	@param x FP2 instance, on exit = x*sqrt(-1)
+ */
+extern void FP2_times_i(FP2 *x);
+
+/**	@brief Generate random FP2
+ *
+	@param x random FP2 number
+	@param rng random number generator
+ */
+extern void FP2_rand(FP2 *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp2_BN254CX.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp2_BN254CX.h
new file mode 100644
index 0000000..e3b65b2
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp2_BN254CX.h
@@ -0,0 +1,306 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP2_BN254CX_H
+#define FP2_BN254CX_H
+
+#include "fp_BN254CX.h"
+
+using namespace core;
+
+namespace BN254CX {
+
+/**
+	@brief FP2 Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    FP a; /**< real part of FP2 */
+    FP b; /**< imaginary part of FP2 */
+} FP2;
+
+/* FP2 prototypes */
+
+/**	@brief Tests for FP2 equal to zero
+ *
+	@param x FP2 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP2_iszilch(FP2 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP2 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP2_islarger(FP2 *x);
+
+
+/**	@brief Serialize out FP2  
+ *
+    @param b buffer for output
+	@param x FP2 number to be serialized
+ */
+extern void FP2_toBytes(char *b,FP2 *x);
+
+/**	@brief Serialize in FP2  
+ *
+	@param x FP2 number to be serialized
+    @param b buffer for input
+ */
+extern void FP2_fromBytes(FP2 *x,char *b);
+
+/**	@brief Conditional copy of FP2 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP2 instance, set to y if s!=0
+	@param y another FP2 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP2_cmove(FP2 *x, FP2 *y, int s);
+/**	@brief Tests for FP2 equal to one
+ *
+	@param x FP2 instance to be tested
+	@return 1 if x=1, else returns 0
+ */
+extern int FP2_isunity(FP2 *x);
+/**	@brief Tests for equality of two FP2s
+ *
+	@param x FP2 instance to be compared
+	@param y FP2 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP2_equals(FP2 *x, FP2 *y);
+/**	@brief Initialise FP2 from two FP numbers
+ *
+	@param x FP2 instance to be initialised
+	@param a FP to form real part of FP2
+	@param b FP to form imaginary part of FP2
+ */
+extern void FP2_from_FPs(FP2 *x, FP *a, FP *b);
+/**	@brief Initialise FP2 from two BIG integers
+ *
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+	@param b BIG to form imaginary part of FP2
+ */
+extern void FP2_from_BIGs(FP2 *x, B256_56::BIG a, B256_56::BIG b);
+
+
+/**	@brief Initialise FP2 from two integers
+ *
+	@param x FP2 instance to be initialised
+	@param a int to form real part of FP2
+	@param b int to form imaginary part of FP2
+ */
+extern void FP2_from_ints(FP2 *x, int a, int b);
+
+
+
+/**	@brief Initialise FP2 from single FP
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param an FP to form real part of FP2
+ */
+extern void FP2_from_FP(FP2 *x, FP *a);
+/**	@brief Initialise FP2 from single BIG
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+ */
+extern void FP2_from_BIG(FP2 *x, B256_56::BIG a);
+/**	@brief Copy FP2 to another FP2
+ *
+	@param x FP2 instance, on exit = y
+	@param y FP2 instance to be copied
+ */
+extern void FP2_copy(FP2 *x, FP2 *y);
+/**	@brief Set FP2 to zero
+ *
+	@param x FP2 instance to be set to zero
+ */
+extern void FP2_zero(FP2 *x);
+/**	@brief Set FP2 to unity
+ *
+	@param x FP2 instance to be set to one
+ */
+extern void FP2_one(FP2 *x);
+
+/**	@brief Copy from ROM to an FP2
+ *
+	@param w FP2 number to be copied to
+	@param a BIG real part to be copied from ROM
+	@param b BIG imag part to be copied from ROM
+ */
+extern void FP2_rcopy(FP2 *w,const B256_56::BIG a,const B256_56::BIG b);
+
+/**	@brief Sign of FP2
+ *
+	@param x FP2 instance
+	@return "sign" of FP2
+ */
+extern int FP2_sign(FP2 *x);
+
+/**	@brief Negation of FP2
+ *
+	@param x FP2 instance, on exit = -y
+	@param y FP2 instance
+ */
+extern void FP2_neg(FP2 *x, FP2 *y);
+
+
+/**	@brief Conjugation of FP2
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP2 instance, on exit = conj(y)
+	@param y FP2 instance
+ */
+extern void FP2_conj(FP2 *x, FP2 *y);
+/**	@brief addition of two FP2s
+ *
+	@param x FP2 instance, on exit = y+z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_add(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief subtraction of two FP2s
+ *
+	@param x FP2 instance, on exit = y-z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_sub(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Multiplication of an FP2 by an FP
+ *
+	@param x FP2 instance, on exit = y*b
+	@param y FP2 instance
+	@param b FP residue
+ */
+extern void FP2_pmul(FP2 *x, FP2 *y, FP *b);
+/**	@brief Multiplication of an FP2 by a small integer
+ *
+	@param x FP2 instance, on exit = y*i
+	@param y FP2 instance
+	@param i an integer
+ */
+extern void FP2_imul(FP2 *x, FP2 *y, int i);
+/**	@brief Squaring an FP2
+ *
+	@param x FP2 instance, on exit = y^2
+	@param y FP2 instance
+ */
+extern void FP2_sqr(FP2 *x, FP2 *y);
+/**	@brief Multiplication of two FP2s
+ *
+	@param x FP2 instance, on exit = y*z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_mul(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Formats and outputs an FP2 to the console
+ *
+	@param x FP2 instance
+ */
+extern void FP2_output(FP2 *x);
+/**	@brief Formats and outputs an FP2 to the console in raw form (for debugging)
+ *
+	@param x FP2 instance
+ */
+extern void FP2_rawoutput(FP2 *x);
+/**	@brief Inverting an FP2
+ *
+	@param x FP2 instance, on exit = 1/y
+	@param y FP2 instance
+ */
+extern void FP2_inv(FP2 *x, FP2 *y, FP *h);
+/**	@brief Divide an FP2 by 2
+ *
+	@param x FP2 instance, on exit = y/2
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_div2(FP2 *x, FP2 *y);
+/**	@brief Multiply an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x*(1+sqrt(-1))
+ */
+extern void FP2_mul_ip(FP2 *x);
+
+/**	@brief Divide an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x/(1+sqrt(-1))
+ */
+extern void FP2_div_ip(FP2 *x);
+/**	@brief Normalises the components of an FP2
+ *
+	@param x FP2 instance to be normalised
+ */
+extern void FP2_norm(FP2 *x);
+/**	@brief Reduces all components of possibly unreduced FP2 mod Modulus
+ *
+	@param x FP2 instance, on exit reduced mod Modulus
+ */
+extern void FP2_reduce(FP2 *x);
+/**	@brief Raises an FP2 to the power of a BIG
+ *
+	@param x FP2 instance, on exit = y^b
+	@param y FP2 instance
+	@param b BIG number
+ */
+extern void FP2_pow(FP2 *x, FP2 *y, B256_56::BIG b);
+
+/**	@brief Test FP2 for QR
+ *
+	@param x FP2 instance
+    @param h optional generated hint
+	@return true or false
+ */
+extern int FP2_qr(FP2 *x,FP *h);
+
+
+/**	@brief Square root of an FP2
+ *
+	@param x FP2 instance, on exit = sqrt(y)
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_sqrt(FP2 *x, FP2 *y, FP *h);
+
+/**	@brief Multiply an FP2 by sqrt(-1)
+ *
+	Note that -1 is QNR
+	@param x FP2 instance, on exit = x*sqrt(-1)
+ */
+extern void FP2_times_i(FP2 *x);
+
+/**	@brief Generate random FP2
+ *
+	@param x random FP2 number
+	@param rng random number generator
+ */
+extern void FP2_rand(FP2 *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp2_BN462.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp2_BN462.h
new file mode 100644
index 0000000..eb096e0
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp2_BN462.h
@@ -0,0 +1,306 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP2_BN462_H
+#define FP2_BN462_H
+
+#include "fp_BN462.h"
+
+using namespace core;
+
+namespace BN462 {
+
+/**
+	@brief FP2 Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    FP a; /**< real part of FP2 */
+    FP b; /**< imaginary part of FP2 */
+} FP2;
+
+/* FP2 prototypes */
+
+/**	@brief Tests for FP2 equal to zero
+ *
+	@param x FP2 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP2_iszilch(FP2 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP2 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP2_islarger(FP2 *x);
+
+
+/**	@brief Serialize out FP2  
+ *
+    @param b buffer for output
+	@param x FP2 number to be serialized
+ */
+extern void FP2_toBytes(char *b,FP2 *x);
+
+/**	@brief Serialize in FP2  
+ *
+	@param x FP2 number to be serialized
+    @param b buffer for input
+ */
+extern void FP2_fromBytes(FP2 *x,char *b);
+
+/**	@brief Conditional copy of FP2 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP2 instance, set to y if s!=0
+	@param y another FP2 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP2_cmove(FP2 *x, FP2 *y, int s);
+/**	@brief Tests for FP2 equal to one
+ *
+	@param x FP2 instance to be tested
+	@return 1 if x=1, else returns 0
+ */
+extern int FP2_isunity(FP2 *x);
+/**	@brief Tests for equality of two FP2s
+ *
+	@param x FP2 instance to be compared
+	@param y FP2 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP2_equals(FP2 *x, FP2 *y);
+/**	@brief Initialise FP2 from two FP numbers
+ *
+	@param x FP2 instance to be initialised
+	@param a FP to form real part of FP2
+	@param b FP to form imaginary part of FP2
+ */
+extern void FP2_from_FPs(FP2 *x, FP *a, FP *b);
+/**	@brief Initialise FP2 from two BIG integers
+ *
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+	@param b BIG to form imaginary part of FP2
+ */
+extern void FP2_from_BIGs(FP2 *x, B464_60::BIG a, B464_60::BIG b);
+
+
+/**	@brief Initialise FP2 from two integers
+ *
+	@param x FP2 instance to be initialised
+	@param a int to form real part of FP2
+	@param b int to form imaginary part of FP2
+ */
+extern void FP2_from_ints(FP2 *x, int a, int b);
+
+
+
+/**	@brief Initialise FP2 from single FP
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param an FP to form real part of FP2
+ */
+extern void FP2_from_FP(FP2 *x, FP *a);
+/**	@brief Initialise FP2 from single BIG
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+ */
+extern void FP2_from_BIG(FP2 *x, B464_60::BIG a);
+/**	@brief Copy FP2 to another FP2
+ *
+	@param x FP2 instance, on exit = y
+	@param y FP2 instance to be copied
+ */
+extern void FP2_copy(FP2 *x, FP2 *y);
+/**	@brief Set FP2 to zero
+ *
+	@param x FP2 instance to be set to zero
+ */
+extern void FP2_zero(FP2 *x);
+/**	@brief Set FP2 to unity
+ *
+	@param x FP2 instance to be set to one
+ */
+extern void FP2_one(FP2 *x);
+
+/**	@brief Copy from ROM to an FP2
+ *
+	@param w FP2 number to be copied to
+	@param a BIG real part to be copied from ROM
+	@param b BIG imag part to be copied from ROM
+ */
+extern void FP2_rcopy(FP2 *w,const B464_60::BIG a,const B464_60::BIG b);
+
+/**	@brief Sign of FP2
+ *
+	@param x FP2 instance
+	@return "sign" of FP2
+ */
+extern int FP2_sign(FP2 *x);
+
+/**	@brief Negation of FP2
+ *
+	@param x FP2 instance, on exit = -y
+	@param y FP2 instance
+ */
+extern void FP2_neg(FP2 *x, FP2 *y);
+
+
+/**	@brief Conjugation of FP2
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP2 instance, on exit = conj(y)
+	@param y FP2 instance
+ */
+extern void FP2_conj(FP2 *x, FP2 *y);
+/**	@brief addition of two FP2s
+ *
+	@param x FP2 instance, on exit = y+z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_add(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief subtraction of two FP2s
+ *
+	@param x FP2 instance, on exit = y-z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_sub(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Multiplication of an FP2 by an FP
+ *
+	@param x FP2 instance, on exit = y*b
+	@param y FP2 instance
+	@param b FP residue
+ */
+extern void FP2_pmul(FP2 *x, FP2 *y, FP *b);
+/**	@brief Multiplication of an FP2 by a small integer
+ *
+	@param x FP2 instance, on exit = y*i
+	@param y FP2 instance
+	@param i an integer
+ */
+extern void FP2_imul(FP2 *x, FP2 *y, int i);
+/**	@brief Squaring an FP2
+ *
+	@param x FP2 instance, on exit = y^2
+	@param y FP2 instance
+ */
+extern void FP2_sqr(FP2 *x, FP2 *y);
+/**	@brief Multiplication of two FP2s
+ *
+	@param x FP2 instance, on exit = y*z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_mul(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Formats and outputs an FP2 to the console
+ *
+	@param x FP2 instance
+ */
+extern void FP2_output(FP2 *x);
+/**	@brief Formats and outputs an FP2 to the console in raw form (for debugging)
+ *
+	@param x FP2 instance
+ */
+extern void FP2_rawoutput(FP2 *x);
+/**	@brief Inverting an FP2
+ *
+	@param x FP2 instance, on exit = 1/y
+	@param y FP2 instance
+ */
+extern void FP2_inv(FP2 *x, FP2 *y, FP *h);
+/**	@brief Divide an FP2 by 2
+ *
+	@param x FP2 instance, on exit = y/2
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_div2(FP2 *x, FP2 *y);
+/**	@brief Multiply an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x*(1+sqrt(-1))
+ */
+extern void FP2_mul_ip(FP2 *x);
+
+/**	@brief Divide an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x/(1+sqrt(-1))
+ */
+extern void FP2_div_ip(FP2 *x);
+/**	@brief Normalises the components of an FP2
+ *
+	@param x FP2 instance to be normalised
+ */
+extern void FP2_norm(FP2 *x);
+/**	@brief Reduces all components of possibly unreduced FP2 mod Modulus
+ *
+	@param x FP2 instance, on exit reduced mod Modulus
+ */
+extern void FP2_reduce(FP2 *x);
+/**	@brief Raises an FP2 to the power of a BIG
+ *
+	@param x FP2 instance, on exit = y^b
+	@param y FP2 instance
+	@param b BIG number
+ */
+extern void FP2_pow(FP2 *x, FP2 *y, B464_60::BIG b);
+
+/**	@brief Test FP2 for QR
+ *
+	@param x FP2 instance
+    @param h optional generated hint
+	@return true or false
+ */
+extern int FP2_qr(FP2 *x,FP *h);
+
+
+/**	@brief Square root of an FP2
+ *
+	@param x FP2 instance, on exit = sqrt(y)
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_sqrt(FP2 *x, FP2 *y, FP *h);
+
+/**	@brief Multiply an FP2 by sqrt(-1)
+ *
+	Note that -1 is QNR
+	@param x FP2 instance, on exit = x*sqrt(-1)
+ */
+extern void FP2_times_i(FP2 *x);
+
+/**	@brief Generate random FP2
+ *
+	@param x random FP2 number
+	@param rng random number generator
+ */
+extern void FP2_rand(FP2 *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp2_FP256BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp2_FP256BN.h
new file mode 100644
index 0000000..9b6d01f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp2_FP256BN.h
@@ -0,0 +1,306 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP2_FP256BN_H
+#define FP2_FP256BN_H
+
+#include "fp_FP256BN.h"
+
+using namespace core;
+
+namespace FP256BN {
+
+/**
+	@brief FP2 Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    FP a; /**< real part of FP2 */
+    FP b; /**< imaginary part of FP2 */
+} FP2;
+
+/* FP2 prototypes */
+
+/**	@brief Tests for FP2 equal to zero
+ *
+	@param x FP2 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP2_iszilch(FP2 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP2 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP2_islarger(FP2 *x);
+
+
+/**	@brief Serialize out FP2  
+ *
+    @param b buffer for output
+	@param x FP2 number to be serialized
+ */
+extern void FP2_toBytes(char *b,FP2 *x);
+
+/**	@brief Serialize in FP2  
+ *
+	@param x FP2 number to be serialized
+    @param b buffer for input
+ */
+extern void FP2_fromBytes(FP2 *x,char *b);
+
+/**	@brief Conditional copy of FP2 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP2 instance, set to y if s!=0
+	@param y another FP2 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP2_cmove(FP2 *x, FP2 *y, int s);
+/**	@brief Tests for FP2 equal to one
+ *
+	@param x FP2 instance to be tested
+	@return 1 if x=1, else returns 0
+ */
+extern int FP2_isunity(FP2 *x);
+/**	@brief Tests for equality of two FP2s
+ *
+	@param x FP2 instance to be compared
+	@param y FP2 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP2_equals(FP2 *x, FP2 *y);
+/**	@brief Initialise FP2 from two FP numbers
+ *
+	@param x FP2 instance to be initialised
+	@param a FP to form real part of FP2
+	@param b FP to form imaginary part of FP2
+ */
+extern void FP2_from_FPs(FP2 *x, FP *a, FP *b);
+/**	@brief Initialise FP2 from two BIG integers
+ *
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+	@param b BIG to form imaginary part of FP2
+ */
+extern void FP2_from_BIGs(FP2 *x, B256_56::BIG a, B256_56::BIG b);
+
+
+/**	@brief Initialise FP2 from two integers
+ *
+	@param x FP2 instance to be initialised
+	@param a int to form real part of FP2
+	@param b int to form imaginary part of FP2
+ */
+extern void FP2_from_ints(FP2 *x, int a, int b);
+
+
+
+/**	@brief Initialise FP2 from single FP
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param an FP to form real part of FP2
+ */
+extern void FP2_from_FP(FP2 *x, FP *a);
+/**	@brief Initialise FP2 from single BIG
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+ */
+extern void FP2_from_BIG(FP2 *x, B256_56::BIG a);
+/**	@brief Copy FP2 to another FP2
+ *
+	@param x FP2 instance, on exit = y
+	@param y FP2 instance to be copied
+ */
+extern void FP2_copy(FP2 *x, FP2 *y);
+/**	@brief Set FP2 to zero
+ *
+	@param x FP2 instance to be set to zero
+ */
+extern void FP2_zero(FP2 *x);
+/**	@brief Set FP2 to unity
+ *
+	@param x FP2 instance to be set to one
+ */
+extern void FP2_one(FP2 *x);
+
+/**	@brief Copy from ROM to an FP2
+ *
+	@param w FP2 number to be copied to
+	@param a BIG real part to be copied from ROM
+	@param b BIG imag part to be copied from ROM
+ */
+extern void FP2_rcopy(FP2 *w,const B256_56::BIG a,const B256_56::BIG b);
+
+/**	@brief Sign of FP2
+ *
+	@param x FP2 instance
+	@return "sign" of FP2
+ */
+extern int FP2_sign(FP2 *x);
+
+/**	@brief Negation of FP2
+ *
+	@param x FP2 instance, on exit = -y
+	@param y FP2 instance
+ */
+extern void FP2_neg(FP2 *x, FP2 *y);
+
+
+/**	@brief Conjugation of FP2
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP2 instance, on exit = conj(y)
+	@param y FP2 instance
+ */
+extern void FP2_conj(FP2 *x, FP2 *y);
+/**	@brief addition of two FP2s
+ *
+	@param x FP2 instance, on exit = y+z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_add(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief subtraction of two FP2s
+ *
+	@param x FP2 instance, on exit = y-z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_sub(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Multiplication of an FP2 by an FP
+ *
+	@param x FP2 instance, on exit = y*b
+	@param y FP2 instance
+	@param b FP residue
+ */
+extern void FP2_pmul(FP2 *x, FP2 *y, FP *b);
+/**	@brief Multiplication of an FP2 by a small integer
+ *
+	@param x FP2 instance, on exit = y*i
+	@param y FP2 instance
+	@param i an integer
+ */
+extern void FP2_imul(FP2 *x, FP2 *y, int i);
+/**	@brief Squaring an FP2
+ *
+	@param x FP2 instance, on exit = y^2
+	@param y FP2 instance
+ */
+extern void FP2_sqr(FP2 *x, FP2 *y);
+/**	@brief Multiplication of two FP2s
+ *
+	@param x FP2 instance, on exit = y*z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_mul(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Formats and outputs an FP2 to the console
+ *
+	@param x FP2 instance
+ */
+extern void FP2_output(FP2 *x);
+/**	@brief Formats and outputs an FP2 to the console in raw form (for debugging)
+ *
+	@param x FP2 instance
+ */
+extern void FP2_rawoutput(FP2 *x);
+/**	@brief Inverting an FP2
+ *
+	@param x FP2 instance, on exit = 1/y
+	@param y FP2 instance
+ */
+extern void FP2_inv(FP2 *x, FP2 *y, FP *h);
+/**	@brief Divide an FP2 by 2
+ *
+	@param x FP2 instance, on exit = y/2
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_div2(FP2 *x, FP2 *y);
+/**	@brief Multiply an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x*(1+sqrt(-1))
+ */
+extern void FP2_mul_ip(FP2 *x);
+
+/**	@brief Divide an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x/(1+sqrt(-1))
+ */
+extern void FP2_div_ip(FP2 *x);
+/**	@brief Normalises the components of an FP2
+ *
+	@param x FP2 instance to be normalised
+ */
+extern void FP2_norm(FP2 *x);
+/**	@brief Reduces all components of possibly unreduced FP2 mod Modulus
+ *
+	@param x FP2 instance, on exit reduced mod Modulus
+ */
+extern void FP2_reduce(FP2 *x);
+/**	@brief Raises an FP2 to the power of a BIG
+ *
+	@param x FP2 instance, on exit = y^b
+	@param y FP2 instance
+	@param b BIG number
+ */
+extern void FP2_pow(FP2 *x, FP2 *y, B256_56::BIG b);
+
+/**	@brief Test FP2 for QR
+ *
+	@param x FP2 instance
+    @param h optional generated hint
+	@return true or false
+ */
+extern int FP2_qr(FP2 *x,FP *h);
+
+
+/**	@brief Square root of an FP2
+ *
+	@param x FP2 instance, on exit = sqrt(y)
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_sqrt(FP2 *x, FP2 *y, FP *h);
+
+/**	@brief Multiply an FP2 by sqrt(-1)
+ *
+	Note that -1 is QNR
+	@param x FP2 instance, on exit = x*sqrt(-1)
+ */
+extern void FP2_times_i(FP2 *x);
+
+/**	@brief Generate random FP2
+ *
+	@param x random FP2 number
+	@param rng random number generator
+ */
+extern void FP2_rand(FP2 *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp2_FP512BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp2_FP512BN.h
new file mode 100644
index 0000000..f7dc57d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp2_FP512BN.h
@@ -0,0 +1,306 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP2_FP512BN_H
+#define FP2_FP512BN_H
+
+#include "fp_FP512BN.h"
+
+using namespace core;
+
+namespace FP512BN {
+
+/**
+	@brief FP2 Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    FP a; /**< real part of FP2 */
+    FP b; /**< imaginary part of FP2 */
+} FP2;
+
+/* FP2 prototypes */
+
+/**	@brief Tests for FP2 equal to zero
+ *
+	@param x FP2 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP2_iszilch(FP2 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP2 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP2_islarger(FP2 *x);
+
+
+/**	@brief Serialize out FP2  
+ *
+    @param b buffer for output
+	@param x FP2 number to be serialized
+ */
+extern void FP2_toBytes(char *b,FP2 *x);
+
+/**	@brief Serialize in FP2  
+ *
+	@param x FP2 number to be serialized
+    @param b buffer for input
+ */
+extern void FP2_fromBytes(FP2 *x,char *b);
+
+/**	@brief Conditional copy of FP2 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP2 instance, set to y if s!=0
+	@param y another FP2 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP2_cmove(FP2 *x, FP2 *y, int s);
+/**	@brief Tests for FP2 equal to one
+ *
+	@param x FP2 instance to be tested
+	@return 1 if x=1, else returns 0
+ */
+extern int FP2_isunity(FP2 *x);
+/**	@brief Tests for equality of two FP2s
+ *
+	@param x FP2 instance to be compared
+	@param y FP2 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP2_equals(FP2 *x, FP2 *y);
+/**	@brief Initialise FP2 from two FP numbers
+ *
+	@param x FP2 instance to be initialised
+	@param a FP to form real part of FP2
+	@param b FP to form imaginary part of FP2
+ */
+extern void FP2_from_FPs(FP2 *x, FP *a, FP *b);
+/**	@brief Initialise FP2 from two BIG integers
+ *
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+	@param b BIG to form imaginary part of FP2
+ */
+extern void FP2_from_BIGs(FP2 *x, B512_60::BIG a, B512_60::BIG b);
+
+
+/**	@brief Initialise FP2 from two integers
+ *
+	@param x FP2 instance to be initialised
+	@param a int to form real part of FP2
+	@param b int to form imaginary part of FP2
+ */
+extern void FP2_from_ints(FP2 *x, int a, int b);
+
+
+
+/**	@brief Initialise FP2 from single FP
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param an FP to form real part of FP2
+ */
+extern void FP2_from_FP(FP2 *x, FP *a);
+/**	@brief Initialise FP2 from single BIG
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+ */
+extern void FP2_from_BIG(FP2 *x, B512_60::BIG a);
+/**	@brief Copy FP2 to another FP2
+ *
+	@param x FP2 instance, on exit = y
+	@param y FP2 instance to be copied
+ */
+extern void FP2_copy(FP2 *x, FP2 *y);
+/**	@brief Set FP2 to zero
+ *
+	@param x FP2 instance to be set to zero
+ */
+extern void FP2_zero(FP2 *x);
+/**	@brief Set FP2 to unity
+ *
+	@param x FP2 instance to be set to one
+ */
+extern void FP2_one(FP2 *x);
+
+/**	@brief Copy from ROM to an FP2
+ *
+	@param w FP2 number to be copied to
+	@param a BIG real part to be copied from ROM
+	@param b BIG imag part to be copied from ROM
+ */
+extern void FP2_rcopy(FP2 *w,const B512_60::BIG a,const B512_60::BIG b);
+
+/**	@brief Sign of FP2
+ *
+	@param x FP2 instance
+	@return "sign" of FP2
+ */
+extern int FP2_sign(FP2 *x);
+
+/**	@brief Negation of FP2
+ *
+	@param x FP2 instance, on exit = -y
+	@param y FP2 instance
+ */
+extern void FP2_neg(FP2 *x, FP2 *y);
+
+
+/**	@brief Conjugation of FP2
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP2 instance, on exit = conj(y)
+	@param y FP2 instance
+ */
+extern void FP2_conj(FP2 *x, FP2 *y);
+/**	@brief addition of two FP2s
+ *
+	@param x FP2 instance, on exit = y+z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_add(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief subtraction of two FP2s
+ *
+	@param x FP2 instance, on exit = y-z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_sub(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Multiplication of an FP2 by an FP
+ *
+	@param x FP2 instance, on exit = y*b
+	@param y FP2 instance
+	@param b FP residue
+ */
+extern void FP2_pmul(FP2 *x, FP2 *y, FP *b);
+/**	@brief Multiplication of an FP2 by a small integer
+ *
+	@param x FP2 instance, on exit = y*i
+	@param y FP2 instance
+	@param i an integer
+ */
+extern void FP2_imul(FP2 *x, FP2 *y, int i);
+/**	@brief Squaring an FP2
+ *
+	@param x FP2 instance, on exit = y^2
+	@param y FP2 instance
+ */
+extern void FP2_sqr(FP2 *x, FP2 *y);
+/**	@brief Multiplication of two FP2s
+ *
+	@param x FP2 instance, on exit = y*z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_mul(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Formats and outputs an FP2 to the console
+ *
+	@param x FP2 instance
+ */
+extern void FP2_output(FP2 *x);
+/**	@brief Formats and outputs an FP2 to the console in raw form (for debugging)
+ *
+	@param x FP2 instance
+ */
+extern void FP2_rawoutput(FP2 *x);
+/**	@brief Inverting an FP2
+ *
+	@param x FP2 instance, on exit = 1/y
+	@param y FP2 instance
+ */
+extern void FP2_inv(FP2 *x, FP2 *y, FP *h);
+/**	@brief Divide an FP2 by 2
+ *
+	@param x FP2 instance, on exit = y/2
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_div2(FP2 *x, FP2 *y);
+/**	@brief Multiply an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x*(1+sqrt(-1))
+ */
+extern void FP2_mul_ip(FP2 *x);
+
+/**	@brief Divide an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x/(1+sqrt(-1))
+ */
+extern void FP2_div_ip(FP2 *x);
+/**	@brief Normalises the components of an FP2
+ *
+	@param x FP2 instance to be normalised
+ */
+extern void FP2_norm(FP2 *x);
+/**	@brief Reduces all components of possibly unreduced FP2 mod Modulus
+ *
+	@param x FP2 instance, on exit reduced mod Modulus
+ */
+extern void FP2_reduce(FP2 *x);
+/**	@brief Raises an FP2 to the power of a BIG
+ *
+	@param x FP2 instance, on exit = y^b
+	@param y FP2 instance
+	@param b BIG number
+ */
+extern void FP2_pow(FP2 *x, FP2 *y, B512_60::BIG b);
+
+/**	@brief Test FP2 for QR
+ *
+	@param x FP2 instance
+    @param h optional generated hint
+	@return true or false
+ */
+extern int FP2_qr(FP2 *x,FP *h);
+
+
+/**	@brief Square root of an FP2
+ *
+	@param x FP2 instance, on exit = sqrt(y)
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_sqrt(FP2 *x, FP2 *y, FP *h);
+
+/**	@brief Multiply an FP2 by sqrt(-1)
+ *
+	Note that -1 is QNR
+	@param x FP2 instance, on exit = x*sqrt(-1)
+ */
+extern void FP2_times_i(FP2 *x);
+
+/**	@brief Generate random FP2
+ *
+	@param x random FP2 number
+	@param rng random number generator
+ */
+extern void FP2_rand(FP2 *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp4.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp4.cpp
new file mode 100644
index 0000000..2b0650e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp4.cpp
@@ -0,0 +1,729 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* CORE Fp^4 functions */
+/* SU=m, m is Stack Usage (no lazy )*/
+
+/* FP4 elements are of the form a+ib, where i is sqrt(-1+sqrt(-1)) */
+
+#include "fp4_YYY.h"
+
+using namespace XXX;
+
+/* test x==0 ? */
+/* SU= 8 */
+int YYY::FP4_iszilch(FP4 *x)
+{
+    return (FP2_iszilch(&(x->a)) & FP2_iszilch(&(x->b)));
+}
+
+/* test x==1 ? */
+/* SU= 8 */
+int YYY::FP4_isunity(FP4 *x)
+{
+    return (FP2_isunity(&(x->a)) & FP2_iszilch(&(x->b)));
+}
+
+/* test is w real? That is in a+ib test b is zero */
+int YYY::FP4_isreal(FP4 *w)
+{
+    return FP2_iszilch(&(w->b));
+}
+
+
+// Is x lexically larger than p-x?
+// return -1 for no, 0 if x=0, 1 for yes
+int YYY::FP4_islarger(FP4 *x)
+{
+    int cmp;
+    if (FP4_iszilch(x)) return 0;
+    cmp=FP2_islarger(&(x->b));
+    if (cmp!=0) return cmp;
+    return FP2_islarger(&(x->a));
+}
+
+void YYY::FP4_toBytes(char *b,FP4 *x)
+{
+    FP2_toBytes(b,&(x->b));
+    FP2_toBytes(&b[2*MODBYTES_XXX],&(x->a));
+}
+
+void YYY::FP4_fromBytes(FP4 *x,char *b)
+{
+    FP2_fromBytes(&(x->b),b);
+    FP2_fromBytes(&(x->a),&b[2*MODBYTES_XXX]);
+}
+
+/* return 1 if x==y, else 0 */
+/* SU= 16 */
+int YYY::FP4_equals(FP4 *x, FP4 *y)
+{
+    return (FP2_equals(&(x->a), &(y->a)) & FP2_equals(&(x->b), &(y->b)));
+}
+
+/* set FP4 from two FP2s */
+/* SU= 16 */
+void YYY::FP4_from_FP2s(FP4 *w, FP2 * x, FP2* y)
+{
+    FP2_copy(&(w->a), x);
+    FP2_copy(&(w->b), y);
+}
+
+/* set FP4 from FP2 */
+/* SU= 8 */
+void YYY::FP4_from_FP2(FP4 *w, FP2 *x)
+{
+    FP2_copy(&(w->a), x);
+    FP2_zero(&(w->b));
+}
+
+/* set high part of FP4 from FP2 */
+/* SU= 8 */
+void YYY::FP4_from_FP2H(FP4 *w, FP2 *x)
+{
+    FP2_copy(&(w->b), x);
+    FP2_zero(&(w->a));
+}
+
+/* set FP4 from FP */
+void YYY::FP4_from_FP(FP4 *w, FP *x)
+{
+    FP2 t;
+    FP2_from_FP(&t, x);
+    FP4_from_FP2(w, &t);
+}
+
+/* FP4 copy w=x */
+/* SU= 16 */
+void YYY::FP4_copy(FP4 *w, FP4 *x)
+{
+    if (w == x) return;
+    FP2_copy(&(w->a), &(x->a));
+    FP2_copy(&(w->b), &(x->b));
+}
+
+/* FP4 w=0 */
+/* SU= 8 */
+void YYY::FP4_zero(FP4 *w)
+{
+    FP2_zero(&(w->a));
+    FP2_zero(&(w->b));
+}
+
+/* FP4 w=1 */
+/* SU= 8 */
+void YYY::FP4_one(FP4 *w)
+{
+    FP2_one(&(w->a));
+    FP2_zero(&(w->b));
+}
+
+int YYY::FP4_sign(FP4 *w)
+{
+    int p1,p2;
+    p1=FP2_sign(&(w->a));
+    p2=FP2_sign(&(w->b));
+#ifdef BIG_ENDIAN_SIGN_YYY
+    p2 ^= (p1 ^ p2)&FP2_iszilch(&(w->b));
+    return p2;
+#else
+    p1 ^= (p1 ^ p2)&FP2_iszilch(&(w->a));
+    return p1;
+#endif
+
+}
+
+/* Set w=-x */
+/* SU= 160 */
+void YYY::FP4_neg(FP4 *w, FP4 *x)
+{
+    /* Just one field neg */
+    FP2 m, t;
+    FP4_norm(x);
+
+    FP2_add(&m, &(x->a), &(x->b));
+    FP2_neg(&m, &m);
+    FP2_add(&t, &m, &(x->b));
+    FP2_add(&(w->b), &m, &(x->a));
+    FP2_copy(&(w->a), &t);
+    FP4_norm(w);
+}
+
+/* Set w=conj(x) */
+/* SU= 16 */
+void YYY::FP4_conj(FP4 *w, FP4 *x)
+{
+    FP2_copy(&(w->a), &(x->a));
+    FP2_neg(&(w->b), &(x->b));
+    FP4_norm(w);
+}
+
+/* Set w=-conj(x) */
+/* SU= 16 */
+void YYY::FP4_nconj(FP4 *w, FP4 *x)
+{
+    FP2_copy(&(w->b), &(x->b));
+    FP2_neg(&(w->a), &(x->a));
+    FP4_norm(w);
+}
+
+/* Set w=x+y */
+/* SU= 16 */
+void YYY::FP4_add(FP4 *w, FP4 *x, FP4 *y)
+{
+    FP2_add(&(w->a), &(x->a), &(y->a));
+    FP2_add(&(w->b), &(x->b), &(y->b));
+}
+
+/* Set w=x-y */
+/* Input y MUST be normed */
+void YYY::FP4_sub(FP4 *w, FP4 *x, FP4 *y)
+{
+    FP4 my;
+    FP4_neg(&my, y);
+    FP4_add(w, x, &my);
+}
+/* SU= 8 */
+/* reduce all components of w mod Modulus */
+void YYY::FP4_reduce(FP4 *w)
+{
+    FP2_reduce(&(w->a));
+    FP2_reduce(&(w->b));
+}
+
+/* SU= 8 */
+/* normalise all elements of w */
+void YYY::FP4_norm(FP4 *w)
+{
+    FP2_norm(&(w->a));
+    FP2_norm(&(w->b));
+}
+
+/* Set w=s*x, where s is FP2 */
+/* SU= 16 */
+void YYY::FP4_pmul(FP4 *w, FP4 *x, FP2 *s)
+{
+    FP2_mul(&(w->a), &(x->a), s);
+    FP2_mul(&(w->b), &(x->b), s);
+}
+
+/* Set w=s*x, where s is FP */
+void YYY::FP4_qmul(FP4 *w, FP4 *x, FP *s)
+{
+    FP2_pmul(&(w->a), &(x->a), s);
+    FP2_pmul(&(w->b), &(x->b), s);
+}
+
+/* SU= 16 */
+/* Set w=s*x, where s is int */
+void YYY::FP4_imul(FP4 *w, FP4 *x, int s)
+{
+    FP2_imul(&(w->a), &(x->a), s);
+    FP2_imul(&(w->b), &(x->b), s);
+}
+
+/* Set w=x^2 */
+/* Input MUST be normed  */
+void YYY::FP4_sqr(FP4 *w, FP4 *x)
+{
+    FP2 t1, t2, t3;
+
+    FP2_mul(&t3, &(x->a), &(x->b)); /* norms x */
+    FP2_copy(&t2, &(x->b));
+    FP2_add(&t1, &(x->a), &(x->b));
+    FP2_mul_ip(&t2);
+
+    FP2_add(&t2, &(x->a), &t2);
+
+    FP2_norm(&t1);  // 2
+    FP2_norm(&t2);  // 2
+
+    FP2_mul(&(w->a), &t1, &t2);
+
+    FP2_copy(&t2, &t3);
+    FP2_mul_ip(&t2);
+
+    FP2_add(&t2, &t2, &t3);
+
+    FP2_norm(&t2);  // 2
+    FP2_neg(&t2, &t2);
+    FP2_add(&(w->a), &(w->a), &t2); /* a=(a+b)(a+i^2.b)-i^2.ab-ab = a*a+ib*ib */
+    FP2_add(&(w->b), &t3, &t3); /* b=2ab */
+
+    FP4_norm(w);
+}
+
+/* Set w=x*y */
+/* Inputs MUST be normed  */
+void YYY::FP4_mul(FP4 *w, FP4 *x, FP4 *y)
+{
+
+    FP2 t1, t2, t3, t4;
+
+    FP2_mul(&t1, &(x->a), &(y->a));
+
+    FP2_mul(&t2, &(x->b), &(y->b));
+    FP2_add(&t3, &(y->b), &(y->a));
+    FP2_add(&t4, &(x->b), &(x->a));
+
+    FP2_norm(&t4); // 2
+    FP2_norm(&t3); // 2
+
+    FP2_mul(&t4, &t4, &t3); /* (xa+xb)(ya+yb) */
+
+    FP2_neg(&t3, &t1); // 1
+    FP2_add(&t4, &t4, &t3); //t4E=3
+    FP2_norm(&t4);
+
+    FP2_neg(&t3, &t2); // 1
+    FP2_add(&(w->b), &t4, &t3); //wbE=3
+
+    FP2_mul_ip(&t2);
+    FP2_add(&(w->a), &t2, &t1);
+
+    FP4_norm(w);
+}
+
+/* output FP4 in format [a,b] */
+/* SU= 8 */
+void YYY::FP4_output(FP4 *w)
+{
+    printf("[");
+    FP2_output(&(w->a));
+    printf(",");
+    FP2_output(&(w->b));
+    printf("]");
+}
+
+/* SU= 8 */
+void YYY::FP4_rawoutput(FP4 *w)
+{
+    printf("[");
+    FP2_rawoutput(&(w->a));
+    printf(",");
+    FP2_rawoutput(&(w->b));
+    printf("]");
+}
+
+/* Set w=1/x */
+/* SU= 160 */
+void YYY::FP4_inv(FP4 *w, FP4 *x, FP *h)
+{
+    FP2 t1, t2;
+    FP2_sqr(&t1, &(x->a));
+    FP2_sqr(&t2, &(x->b));
+    FP2_mul_ip(&t2);
+    FP2_norm(&t2);
+    FP2_sub(&t1, &t1, &t2);
+    FP2_inv(&t1, &t1, h);
+    FP2_mul(&(w->a), &t1, &(x->a));
+    FP2_neg(&t1, &t1);
+    FP2_norm(&t1);
+    FP2_mul(&(w->b), &t1, &(x->b));
+}
+
+/* w*=i where i = sqrt(2^i+sqrt(-1)) */
+/* SU= 200 */
+void YYY::FP4_times_i(FP4 *w)
+{
+    FP2 t;
+    FP2_copy(&t, &(w->b));
+    FP2_copy(&(w->b), &(w->a));
+    FP2_mul_ip(&t);
+    FP2_copy(&(w->a), &t);
+    FP4_norm(w);
+#if TOWER_YYY == POSITOWER
+    FP4_neg(w, w);  // ***
+    FP4_norm(w);
+#endif
+}
+
+/* Set w=w^p using Frobenius */
+/* SU= 16 */
+void YYY::FP4_frob(FP4 *w, FP2 *f)
+{
+    FP2_conj(&(w->a), &(w->a));
+    FP2_conj(&(w->b), &(w->b));
+    FP2_mul( &(w->b), f, &(w->b));
+}
+
+/* Set r=a^b mod m */
+/* SU= 240 */
+/*
+void YYY::FP4_pow(FP4 *r, FP4* a, BIG b)
+{
+    FP4 w;
+    BIG z, zilch;
+    int bt;
+
+    BIG_zero(zilch);
+    BIG_copy(z, b);
+    BIG_norm(z);
+    FP4_copy(&w, a);
+    FP4_norm(&w);
+    FP4_one(r);
+
+    while (1)
+    {
+        bt = BIG_parity(z);
+        BIG_shr(z, 1);
+        if (bt) FP4_mul(r, r, &w);
+        if (BIG_comp(z, zilch) == 0) break;
+        FP4_sqr(&w, &w);
+    }
+    FP4_reduce(r);
+}
+*/
+#if CURVE_SECURITY_ZZZ == 128
+
+/* SU= 304 */
+/* XTR xtr_a function */
+void YYY::FP4_xtr_A(FP4 *r, FP4 *w, FP4 *x, FP4 *y, FP4 *z)
+{
+    FP4 t1, t2;
+
+    FP4_copy(r, x);
+    FP4_sub(&t1, w, y);
+    FP4_norm(&t1);
+    FP4_pmul(&t1, &t1, &(r->a));
+    FP4_add(&t2, w, y);
+    FP4_norm(&t2);
+    FP4_pmul(&t2, &t2, &(r->b));
+    FP4_times_i(&t2);
+
+    FP4_add(r, &t1, &t2);
+    FP4_add(r, r, z);
+
+    FP4_reduce(r);
+}
+
+/* SU= 152 */
+/* XTR xtr_d function */
+void YYY::FP4_xtr_D(FP4 *r, FP4 *x)
+{
+    FP4 w;
+    FP4_copy(r, x);
+    FP4_conj(&w, r);
+    FP4_add(&w, &w, &w);
+    FP4_sqr(r, r);
+    FP4_norm(&w);
+    FP4_sub(r, r, &w);
+    FP4_reduce(r);    /* reduce here as multiple calls trigger automatic reductions */
+}
+
+/* SU= 728 */
+/* r=x^n using XTR method on traces of FP12s */
+void YYY::FP4_xtr_pow(FP4 *r, FP4 *x, BIG n)
+{
+    int i, par, nb;
+    BIG v;
+    FP2 w;
+    FP4 t, a, b, c, sf;
+
+    BIG_zero(v);
+    BIG_inc(v, 3);
+    BIG_norm(v);
+    FP2_from_BIG(&w, v);
+    FP4_from_FP2(&a, &w);
+    FP4_copy(&sf, x);
+    FP4_norm(&sf);
+    FP4_copy(&b, &sf);
+    FP4_xtr_D(&c, &sf);
+
+    par = BIG_parity(n);
+    BIG_copy(v, n);
+    BIG_norm(v);
+    BIG_shr(v, 1);
+    if (par == 0)
+    {
+        BIG_dec(v, 1);
+        BIG_norm(v);
+    }
+
+    nb = BIG_nbits(v);
+    for (i = nb - 1; i >= 0; i--)
+    {
+        if (!BIG_bit(v, i))
+        {
+            FP4_copy(&t, &b);
+            FP4_conj(&sf, &sf);
+            FP4_conj(&c, &c);
+            FP4_xtr_A(&b, &a, &b, &sf, &c);
+            FP4_conj(&sf, &sf);
+            FP4_xtr_D(&c, &t);
+            FP4_xtr_D(&a, &a);
+        }
+        else
+        {
+            FP4_conj(&t, &a);
+            FP4_xtr_D(&a, &b);
+            FP4_xtr_A(&b, &c, &b, &sf, &t);
+            FP4_xtr_D(&c, &c);
+        }
+    }
+
+    if (par == 0) FP4_copy(r, &c);
+    else FP4_copy(r, &b);
+    FP4_reduce(r);
+}
+
+/* SU= 872 */
+/* r=ck^a.cl^n using XTR double exponentiation method on traces of FP12s. See Stam thesis. */
+void YYY::FP4_xtr_pow2(FP4 *r, FP4 *ck, FP4 *cl, FP4 *ckml, FP4 *ckm2l, BIG a, BIG b)
+{
+    int i, f2;
+    BIG d, e, w;
+    FP4 t, cu, cv, cumv, cum2v;
+
+
+    BIG_copy(e, a);
+    BIG_copy(d, b);
+    BIG_norm(e);
+    BIG_norm(d);
+    FP4_copy(&cu, ck);
+    FP4_copy(&cv, cl);
+    FP4_copy(&cumv, ckml);
+    FP4_copy(&cum2v, ckm2l);
+
+    f2 = 0;
+    while (BIG_parity(d) == 0 && BIG_parity(e) == 0)
+    {
+        BIG_shr(d, 1);
+        BIG_shr(e, 1);
+        f2++;
+    }
+    while (BIG_comp(d, e) != 0)
+    {
+        if (BIG_comp(d, e) > 0)
+        {
+            BIG_imul(w, e, 4);
+            BIG_norm(w);
+            if (BIG_comp(d, w) <= 0)
+            {
+                BIG_copy(w, d);
+                BIG_copy(d, e);
+                BIG_sub(e, w, e);
+                BIG_norm(e);
+                FP4_xtr_A(&t, &cu, &cv, &cumv, &cum2v);
+                FP4_conj(&cum2v, &cumv);
+                FP4_copy(&cumv, &cv);
+                FP4_copy(&cv, &cu);
+                FP4_copy(&cu, &t);
+            }
+            else if (BIG_parity(d) == 0)
+            {
+                BIG_shr(d, 1);
+                FP4_conj(r, &cum2v);
+                FP4_xtr_A(&t, &cu, &cumv, &cv, r);
+                FP4_xtr_D(&cum2v, &cumv);
+                FP4_copy(&cumv, &t);
+                FP4_xtr_D(&cu, &cu);
+            }
+            else if (BIG_parity(e) == 1)
+            {
+                BIG_sub(d, d, e);
+                BIG_norm(d);
+                BIG_shr(d, 1);
+                FP4_xtr_A(&t, &cu, &cv, &cumv, &cum2v);
+                FP4_xtr_D(&cu, &cu);
+                FP4_xtr_D(&cum2v, &cv);
+                FP4_conj(&cum2v, &cum2v);
+                FP4_copy(&cv, &t);
+            }
+            else
+            {
+                BIG_copy(w, d);
+                BIG_copy(d, e);
+                BIG_shr(d, 1);
+                BIG_copy(e, w);
+                FP4_xtr_D(&t, &cumv);
+                FP4_conj(&cumv, &cum2v);
+                FP4_conj(&cum2v, &t);
+                FP4_xtr_D(&t, &cv);
+                FP4_copy(&cv, &cu);
+                FP4_copy(&cu, &t);
+            }
+        }
+        if (BIG_comp(d, e) < 0)
+        {
+            BIG_imul(w, d, 4);
+            BIG_norm(w);
+            if (BIG_comp(e, w) <= 0)
+            {
+                BIG_sub(e, e, d);
+                BIG_norm(e);
+                FP4_xtr_A(&t, &cu, &cv, &cumv, &cum2v);
+                FP4_copy(&cum2v, &cumv);
+                FP4_copy(&cumv, &cu);
+                FP4_copy(&cu, &t);
+            }
+            else if (BIG_parity(e) == 0)
+            {
+                BIG_copy(w, d);
+                BIG_copy(d, e);
+                BIG_shr(d, 1);
+                BIG_copy(e, w);
+                FP4_xtr_D(&t, &cumv);
+                FP4_conj(&cumv, &cum2v);
+                FP4_conj(&cum2v, &t);
+                FP4_xtr_D(&t, &cv);
+                FP4_copy(&cv, &cu);
+                FP4_copy(&cu, &t);
+            }
+            else if (BIG_parity(d) == 1)
+            {
+                BIG_copy(w, e);
+                BIG_copy(e, d);
+                BIG_sub(w, w, d);
+                BIG_norm(w);
+                BIG_copy(d, w);
+                BIG_shr(d, 1);
+                FP4_xtr_A(&t, &cu, &cv, &cumv, &cum2v);
+                FP4_conj(&cumv, &cumv);
+                FP4_xtr_D(&cum2v, &cu);
+                FP4_conj(&cum2v, &cum2v);
+                FP4_xtr_D(&cu, &cv);
+                FP4_copy(&cv, &t);
+            }
+            else
+            {
+                BIG_shr(d, 1);
+                FP4_conj(r, &cum2v);
+                FP4_xtr_A(&t, &cu, &cumv, &cv, r);
+                FP4_xtr_D(&cum2v, &cumv);
+                FP4_copy(&cumv, &t);
+                FP4_xtr_D(&cu, &cu);
+            }
+        }
+    }
+    FP4_xtr_A(r, &cu, &cv, &cumv, &cum2v);
+    for (i = 0; i < f2; i++)    FP4_xtr_D(r, r);
+    FP4_xtr_pow(r, r, d);
+}
+
+#endif
+
+/* New stuff for ECp4 support */
+
+/* Set w=x/2 */
+void YYY::FP4_div2(FP4 *w, FP4 *x)
+{
+    FP2_div2(&(w->a), &(x->a));
+    FP2_div2(&(w->b), &(x->b));
+}
+
+/* Move b to a if d=1 */
+void YYY::FP4_cmove(FP4 *f, FP4 *g, int d)
+{
+    FP2_cmove(&(f->a), &(g->a), d);
+    FP2_cmove(&(f->b), &(g->b), d);
+}
+
+void YYY::FP4_rand(FP4 *x,csprng *rng)
+{
+    FP2_rand(&(x->a),rng);
+    FP2_rand(&(x->b),rng);
+}
+
+#if PAIRING_FRIENDLY_ZZZ >= BLS24_CURVE
+
+/* test for x a QR */
+int YYY::FP4_qr(FP4 *x, FP *h)
+{ /* test x^(p^4-1)/2 = 1 */
+    
+    FP4 c;
+    FP4_conj(&c,x);
+    FP4_mul(&c,&c,x);
+
+    return FP2_qr(&(c.a),h);
+}
+
+/* sqrt(a+xb) = sqrt((a+sqrt(a*a-n*b*b))/2)+x.b/(2*sqrt((a+sqrt(a*a-n*b*b))/2)) */
+
+void YYY::FP4_sqrt(FP4 *r, FP4* x, FP *h)
+{
+    FP2 a, b, s, t;
+    FP hint,twk;
+    FP4 nr;
+    int sgn,qr;
+
+    FP4_copy(r, x);
+    if (FP4_iszilch(x)) return;
+
+    FP2_copy(&a, &(x->a));
+    FP2_copy(&s, &(x->b));
+
+    FP2_sqr(&s, &s); // s*=s
+    FP2_sqr(&a, &a); // a*=a
+    FP2_mul_ip(&s);
+    FP2_norm(&s);
+    FP2_sub(&a, &a, &s); // a-=txx(s)
+    FP2_norm(&a); // **
+
+    FP2_sqrt(&s, &a, h);            // Cost = +1
+
+    FP2_add(&a, &(r->a), &s);
+    FP2_norm(&a);
+    FP2_div2(&a, &a);
+
+    FP2_div2(&b,&(r->b));                   // w1=b/2
+    qr=FP2_qr(&a,&hint);                    // only exp! Cost=+1
+
+// tweak hint - multiply old hint by Norm(1/Beta)^e where Beta is irreducible polynomial
+    FP2_copy(&s,&a);
+    FP_rcopy(&twk,TWK);
+    FP_mul(&twk,&twk,&hint);
+    FP2_div_ip(&s); FP2_norm(&s); // switch to other candidate
+
+    FP2_cmove(&a,&s,1-qr);
+    FP_cmove(&hint,&twk,1-qr);
+
+    FP2_sqrt(&(r->a),&a,&hint);             // a=sqrt(w2)  Cost=+1
+    FP2_inv(&s,&a,&hint);                  // w3=1/w2
+    FP2_mul(&s,&s,&(r->a));                // w3=1/sqrt(w2)
+    FP2_mul(&(r->b),&s,&b);                // b=(b/2)*1/sqrt(w2)
+    FP2_copy(&t,&(r->a));
+
+    FP2_cmove(&(r->a),&(r->b),1-qr);
+    FP2_cmove(&(r->b),&t,1-qr);
+
+    sgn=FP4_sign(r);
+    FP4_neg(&nr,r); FP4_norm(&nr);
+    FP4_cmove(r,&nr,sgn);
+}
+
+void YYY::FP4_div_i(FP4 *f)
+{
+    FP2 u, v;
+    FP2_copy(&u, &(f->a));
+    FP2_copy(&v, &(f->b));
+
+    FP2_div_ip(&u);
+
+    FP2_copy(&(f->a), &v);
+    FP2_copy(&(f->b), &u);
+
+#if TOWER_YYY == POSITOWER
+    FP4_neg(f, f);  // ***
+    FP4_norm(f);
+#endif
+}
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp4.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp4.h
new file mode 100644
index 0000000..b889fa3
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp4.h
@@ -0,0 +1,349 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP4_YYY_H
+#define FP4_YYY_H
+
+#include "fp2_YYY.h"
+#include "config_curve_ZZZ.h"
+
+using namespace core;
+
+namespace YYY {
+
+/**
+	@brief FP4 Structure - towered over two FP2
+*/
+
+typedef struct
+{
+    FP2 a; /**< real part of FP4 */
+    FP2 b; /**< imaginary part of FP4 */
+} FP4;
+
+
+/* FP4 prototypes */
+/**	@brief Tests for FP4 equal to zero
+ *
+	@param x FP4 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP4_iszilch(FP4 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP4 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP4_islarger(FP4 *x);
+
+/**	@brief Serialize out FP4  
+ *
+    @param b buffer for output
+	@param x FP4 number to be serialized
+ */
+extern void FP4_toBytes(char *b,FP4 *x);
+
+/**	@brief Serialize in FP4  
+ *
+	@param x FP4 number to be serialized
+    @param b buffer for input
+ */
+extern void FP4_fromBytes(FP4 *x,char *b);
+
+/**	@brief Tests for FP4 equal to unity
+ *
+	@param x FP4 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP4_isunity(FP4 *x);
+/**	@brief Tests for equality of two FP4s
+ *
+	@param x FP4 instance to be compared
+	@param y FP4 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP4_equals(FP4 *x, FP4 *y);
+/**	@brief Tests for FP4 having only a real part and no imaginary part
+ *
+	@param x FP4 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP4_isreal(FP4 *x);
+/**	@brief Initialise FP4 from two FP2s
+ *
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+	@param b FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2s(FP4 *x, FP2 *a, FP2 *b);
+/**	@brief Initialise FP4 from single FP2
+ *
+	Imaginary part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+ */
+extern void FP4_from_FP2(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP2
+ *
+	real part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2H(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP
+ *
+	@param x FP4 instance to be initialised
+	@param a FP to form real part of FP4
+ */
+extern void FP4_from_FP(FP4 *x, FP *a);
+
+/**	@brief Copy FP4 to another FP4
+ *
+	@param x FP4 instance, on exit = y
+	@param y FP4 instance to be copied
+ */
+extern void FP4_copy(FP4 *x, FP4 *y);
+/**	@brief Set FP4 to zero
+ *
+	@param x FP4 instance to be set to zero
+ */
+extern void FP4_zero(FP4 *x);
+/**	@brief Set FP4 to unity
+ *
+	@param x FP4 instance to be set to one
+ */
+extern void FP4_one(FP4 *x);
+
+/**	@brief Sign of FP4
+ *
+	@param x FP4 instance
+	@return "sign" of FP4
+ */
+extern int FP4_sign(FP4 *x);
+
+/**	@brief Negation of FP4
+ *
+	@param x FP4 instance, on exit = -y
+	@param y FP4 instance
+ */
+extern void FP4_neg(FP4 *x, FP4 *y);
+/**	@brief Conjugation of FP4
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP4 instance, on exit = conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_conj(FP4 *x, FP4 *y);
+/**	@brief Negative conjugation of FP4
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP4 instance, on exit = -conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_nconj(FP4 *x, FP4 *y);
+/**	@brief addition of two FP4s
+ *
+	@param x FP4 instance, on exit = y+z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_add(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief subtraction of two FP4s
+ *
+	@param x FP4 instance, on exit = y-z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_sub(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Multiplication of an FP4 by an FP2
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP2 multiplier
+ */
+extern void FP4_pmul(FP4 *x, FP4 *y, FP2 *a);
+
+
+/**	@brief Multiplication of an FP4 by an FP
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP multiplier
+ */
+extern void FP4_qmul(FP4 *x, FP4 *y, FP *a);
+
+/**	@brief Multiplication of an FP4 by a small integer
+ *
+	@param x FP4 instance, on exit = y*i
+	@param y FP4 instance
+	@param i an integer
+ */
+extern void FP4_imul(FP4 *x, FP4 *y, int i);
+/**	@brief Squaring an FP4
+ *
+	@param x FP4 instance, on exit = y^2
+	@param y FP4 instance
+ */
+extern void FP4_sqr(FP4 *x, FP4 *y);
+/**	@brief Multiplication of two FP4s
+ *
+	@param x FP4 instance, on exit = y*z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_mul(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Inverting an FP4
+ *
+	@param x FP4 instance, on exit = 1/y
+	@param y FP4 instance
+    @param h optional input hint
+ */
+extern void FP4_inv(FP4 *x, FP4 *y, FP *h);
+
+/**	@brief Divide an FP4 by 2
+ *
+	@param x FP4 instance, on exit = y/2
+	@param y FP4 instance
+ */
+extern void FP4_div2(FP4 *x, FP4 *y);
+
+
+/**	@brief Formats and outputs an FP4 to the console
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_output(FP4 *x);
+/**	@brief Formats and outputs an FP4 to the console in raw form (for debugging)
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_rawoutput(FP4 *x);
+/**	@brief multiplies an FP4 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP4 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP4_times_i(FP4 *x);
+/**	@brief Normalises the components of an FP4
+ *
+	@param x FP4 instance to be normalised
+ */
+extern void FP4_norm(FP4 *x);
+/**	@brief Reduces all components of possibly unreduced FP4 mod Modulus
+ *
+	@param x FP4 instance, on exit reduced mod Modulus
+ */
+extern void FP4_reduce(FP4 *x);
+/**	@brief Raises an FP4 to the power of a BIG
+ *
+	@param x FP4 instance, on exit = y^b
+	@param y FP4 instance
+	@param b BIG number
+ */
+extern void FP4_pow(FP4 *x, FP4 *y, XXX::BIG b);
+/**	@brief Raises an FP4 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP4 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP4_frob(FP4 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP4 instance, on exit = w*x-conj(x)*y+z
+	@param w FP4 instance
+	@param x FP4 instance
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_xtr_A(FP4 *r, FP4 *w, FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP4 instance, on exit = x^2-2*conj(x)
+	@param x FP4 instance
+ */
+extern void FP4_xtr_D(FP4 *r, FP4 *x);
+/**	@brief Calculates FP4 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP4 instance, on exit = trace(w^b)
+	@param x FP4 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP4_xtr_pow(FP4 *r, FP4 *x, XXX::BIG b);
+/**	@brief Calculates FP4 trace of c^a.d^b, where c and d are derived from FP4 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP4 instance, on exit = trace(c^a.d^b)
+	@param c FP4 instance, trace of an FP12
+	@param d FP4 instance, trace of an FP12
+	@param e FP4 instance, trace of an FP12
+	@param f FP4 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP4_xtr_pow2(FP4 *r, FP4 *c, FP4 *d, FP4 *e, FP4 *f, XXX::BIG a, XXX::BIG b);
+
+/**	@brief Test FP4 for QR
+ * 
+	@param r FP4 instance
+    @param h optional generated hint
+	@return 1 x is a QR, otherwise 0
+ */
+extern int  FP4_qr(FP4 *r, FP *h);
+
+/**	@brief Calculate square root of an FP4
+ *
+	Square root
+	@param r FP4 instance, on exit = sqrt(x)
+	@param x FP4 instance
+    @param h optional input hint
+ */
+extern void  FP4_sqrt(FP4 *r, FP4 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP4 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP4 instance, set to y if s!=0
+	@param y another FP4 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP4_cmove(FP4 *x, FP4 *y, int s);
+
+
+/**	@brief Divide FP4 number by QNR
+ *
+	Divide FP4 by the QNR
+	@param x FP4 instance
+ */
+extern void FP4_div_i(FP4 *x);
+
+/**	@brief Generate random FP4
+ *
+	@param x random FP4 number
+	@param rng random number generator
+ */
+extern void FP4_rand(FP4 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp48.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp48.cpp
new file mode 100644
index 0000000..9f0905c
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp48.cpp
@@ -0,0 +1,1092 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* CORE Fp^12 functions */
+/* SU=m, m is Stack Usage (no lazy )*/
+/* FP48 elements are of the form a+i.b+i^2.c */
+
+#include "fp48_YYY.h"
+#include "config_curve_ZZZ.h"
+
+using namespace XXX;
+
+/* return 1 if b==c, no branching */
+static int teq(sign32 b, sign32 c)
+{
+    sign32 x = b ^ c;
+    x -= 1; // if x=0, x now -1
+    return (int)((x >> 31) & 1);
+}
+
+
+/* Constant time select from pre-computed table */
+static void FP48_select(YYY::FP48 *f, YYY::FP48 g[], sign32 b)
+{
+    YYY::FP48 invf;
+    sign32 m = b >> 31;
+    sign32 babs = (b ^ m) - m;
+
+    babs = (babs - 1) / 2;
+
+    FP48_cmove(f, &g[0], teq(babs, 0)); // conditional move
+    FP48_cmove(f, &g[1], teq(babs, 1));
+    FP48_cmove(f, &g[2], teq(babs, 2));
+    FP48_cmove(f, &g[3], teq(babs, 3));
+    FP48_cmove(f, &g[4], teq(babs, 4));
+    FP48_cmove(f, &g[5], teq(babs, 5));
+    FP48_cmove(f, &g[6], teq(babs, 6));
+    FP48_cmove(f, &g[7], teq(babs, 7));
+
+    FP48_copy(&invf, f);
+    FP48_conj(&invf, &invf); // 1/f
+    FP48_cmove(f, &invf, (int)(m & 1));
+}
+
+
+/* test x==0 ? */
+/* SU= 8 */
+int YYY::FP48_iszilch(FP48 *x)
+{
+    if (FP16_iszilch(&(x->a)) && FP16_iszilch(&(x->b)) && FP16_iszilch(&(x->c))) return 1;
+    return 0;
+}
+
+/* test x==1 ? */
+/* SU= 8 */
+int YYY::FP48_isunity(FP48 *x)
+{
+    if (FP16_isunity(&(x->a)) && FP16_iszilch(&(x->b)) && FP16_iszilch(&(x->c))) return 1;
+    return 0;
+}
+
+/* FP48 copy w=x */
+/* SU= 16 */
+void YYY::FP48_copy(FP48 *w, FP48 *x)
+{
+    if (x == w) return;
+    FP16_copy(&(w->a), &(x->a));
+    FP16_copy(&(w->b), &(x->b));
+    FP16_copy(&(w->c), &(x->c));
+    w->type = x->type;
+}
+
+/* FP48 w=1 */
+/* SU= 8 */
+void YYY::FP48_one(FP48 *w)
+{
+    FP16_one(&(w->a));
+    FP16_zero(&(w->b));
+    FP16_zero(&(w->c));
+    w->type = FP_UNITY;
+}
+
+void YYY::FP48_zero(FP48 *w)
+{
+    FP16_zero(&(w->a));
+    FP16_zero(&(w->b));
+    FP16_zero(&(w->c));
+    w->type = FP_ZILCH;
+}
+
+/* return 1 if x==y, else 0 */
+/* SU= 16 */
+int YYY::FP48_equals(FP48 *x, FP48 *y)
+{
+    if (FP16_equals(&(x->a), &(y->a)) && FP16_equals(&(x->b), &(y->b)) && FP16_equals(&(x->c), &(y->c)))
+        return 1;
+    return 0;
+}
+
+/* Set w=conj(x) */
+/* SU= 8 */
+void YYY::FP48_conj(FP48 *w, FP48 *x)
+{
+    FP48_copy(w, x);
+    FP16_conj(&(w->a), &(w->a));
+    FP16_nconj(&(w->b), &(w->b));
+    FP16_conj(&(w->c), &(w->c));
+}
+
+/* Create FP48 from FP16 */
+/* SU= 8 */
+void YYY::FP48_from_FP16(FP48 *w, FP16 *a)
+{
+    FP16_copy(&(w->a), a);
+    FP16_zero(&(w->b));
+    FP16_zero(&(w->c));
+    w->type = FP_SPARSEST;
+}
+
+/* Create FP48 from 3 FP16's */
+/* SU= 16 */
+void YYY::FP48_from_FP16s(FP48 *w, FP16 *a, FP16 *b, FP16 *c)
+{
+    FP16_copy(&(w->a), a);
+    FP16_copy(&(w->b), b);
+    FP16_copy(&(w->c), c);
+    w->type = FP_DENSE;
+}
+
+/* Granger-Scott Unitary Squaring. This does not benefit from lazy reduction */
+/* SU= 600 */
+void YYY::FP48_usqr(FP48 *w, FP48 *x)
+{
+    FP16 A, B, C, D;
+
+    FP16_copy(&A, &(x->a));
+
+    FP16_sqr(&(w->a), &(x->a));
+    FP16_add(&D, &(w->a), &(w->a));
+    FP16_add(&(w->a), &D, &(w->a));
+
+    FP16_norm(&(w->a));
+    FP16_nconj(&A, &A);
+
+    FP16_add(&A, &A, &A);
+    FP16_add(&(w->a), &(w->a), &A);
+    FP16_sqr(&B, &(x->c));
+    FP16_times_i(&B);
+
+    FP16_add(&D, &B, &B);
+    FP16_add(&B, &B, &D);
+    FP16_norm(&B);
+
+    FP16_sqr(&C, &(x->b));
+
+    FP16_add(&D, &C, &C);
+    FP16_add(&C, &C, &D);
+
+    FP16_norm(&C);
+    FP16_conj(&(w->b), &(x->b));
+    FP16_add(&(w->b), &(w->b), &(w->b));
+    FP16_nconj(&(w->c), &(x->c));
+
+    FP16_add(&(w->c), &(w->c), &(w->c));
+    FP16_add(&(w->b), &B, &(w->b));
+    FP16_add(&(w->c), &C, &(w->c));
+    w->type = FP_DENSE;
+
+    FP48_reduce(w);     /* reduce here as in pow function repeated squarings would trigger multiple reductions */
+}
+
+/* FP48 squaring w=x^2 */
+/* SU= 600 */
+void YYY::FP48_sqr(FP48 *w, FP48 *x)
+{
+    /* Use Chung-Hasan SQR2 method from http://cacr.uwaterloo.ca/techreports/2006/cacr2006-24.pdf */
+
+    FP16 A, B, C, D;
+
+    if (x->type <= FP_UNITY)
+    {
+        FP48_copy(w, x);
+        return;
+    }
+
+    FP16_sqr(&A, &(x->a));
+    FP16_mul(&B, &(x->b), &(x->c));
+    FP16_add(&B, &B, &B);
+    FP16_norm(&B);
+    FP16_sqr(&C, &(x->c));
+
+    FP16_mul(&D, &(x->a), &(x->b));
+    FP16_add(&D, &D, &D);
+
+    FP16_add(&(w->c), &(x->a), &(x->c));
+    FP16_add(&(w->c), &(x->b), &(w->c));
+    FP16_norm(&(w->c));
+
+    FP16_sqr(&(w->c), &(w->c));
+
+    FP16_copy(&(w->a), &A);
+    FP16_add(&A, &A, &B);
+
+    FP16_norm(&A);
+
+    FP16_add(&A, &A, &C);
+    FP16_add(&A, &A, &D);
+
+    FP16_norm(&A);
+
+    FP16_neg(&A, &A);
+    FP16_times_i(&B);
+    FP16_times_i(&C);
+
+    FP16_add(&(w->a), &(w->a), &B);
+    FP16_add(&(w->b), &C, &D);
+    FP16_add(&(w->c), &(w->c), &A);
+
+    if (x->type == FP_SPARSER || x->type == FP_SPARSEST)
+        w->type = FP_SPARSE;
+    else
+        w->type = FP_DENSE;
+
+    FP48_norm(w);
+}
+
+/* FP48 full multiplication w=w*y */
+
+
+/* SU= 896 */
+/* FP48 full multiplication w=w*y */
+void YYY::FP48_mul(FP48 *w, FP48 *y)
+{
+    FP16 z0, z1, z2, z3, t0, t1;
+
+    FP16_mul(&z0, &(w->a), &(y->a));
+    FP16_mul(&z2, &(w->b), &(y->b)); //
+
+    FP16_add(&t0, &(w->a), &(w->b));
+    FP16_add(&t1, &(y->a), &(y->b)); //
+
+    FP16_norm(&t0);
+    FP16_norm(&t1);
+
+    FP16_mul(&z1, &t0, &t1);
+    FP16_add(&t0, &(w->b), &(w->c));
+    FP16_add(&t1, &(y->b), &(y->c)); //
+
+    FP16_norm(&t0);
+    FP16_norm(&t1);
+
+    FP16_mul(&z3, &t0, &t1);
+
+    FP16_neg(&t0, &z0);
+    FP16_neg(&t1, &z2);
+
+    FP16_add(&z1, &z1, &t0); // z1=z1-z0
+    FP16_add(&(w->b), &z1, &t1); // z1=z1-z2
+    FP16_add(&z3, &z3, &t1);      // z3=z3-z2
+    FP16_add(&z2, &z2, &t0);      // z2=z2-z0
+
+    FP16_add(&t0, &(w->a), &(w->c));
+    FP16_add(&t1, &(y->a), &(y->c));
+
+    FP16_norm(&t0);
+    FP16_norm(&t1);
+
+    FP16_mul(&t0, &t1, &t0);
+    FP16_add(&z2, &z2, &t0);
+
+    FP16_mul(&t0, &(w->c), &(y->c));
+    FP16_neg(&t1, &t0);
+
+    FP16_add(&(w->c), &z2, &t1);
+    FP16_add(&z3, &z3, &t1);
+    FP16_times_i(&t0);
+    FP16_add(&(w->b), &(w->b), &t0);
+    FP16_norm(&z3);
+    FP16_times_i(&z3);
+    FP16_add(&(w->a), &z0, &z3);
+
+    FP48_norm(w);
+    w->type = FP_DENSE;
+}
+
+/* FP48 full multiplication w=w*y */
+/* Supports sparse multiplicands */
+/* Usually w is denser than y */
+void YYY::FP48_ssmul(FP48 *w, FP48 *y)
+{
+    FP16 z0, z1, z2, z3, t0, t1;
+    if (w->type == FP_UNITY)
+    {
+        FP48_copy(w, y);
+        return;
+    }
+    if (y->type == FP_UNITY)
+        return;
+
+//  FP48_mul(w,y); return;
+
+    if (y->type >= FP_SPARSE)
+    {
+        FP16_mul(&z0, &(w->a), &(y->a)); // xa.ya   always 11x11
+
+#if SEXTIC_TWIST_ZZZ == M_TYPE
+        if (y->type == FP_SPARSE || w->type == FP_SPARSE)
+        {
+            FP8_mul(&z2.b, &(w->b).b, &(y->b).b);
+            FP8_zero(&z2.a);
+            if (y->type != FP_SPARSE)
+                FP8_mul(&z2.a, &(w->b).b, &(y->b).a);
+            if (w->type != FP_SPARSE)
+                FP8_mul(&z2.a, &(w->b).a, &(y->b).b);
+            FP16_times_i(&z2);
+        }
+        else
+#endif
+            FP16_mul(&z2, &(w->b), &(y->b)); // xb.yb  could be 00x00 or 01x01 or or 10x10 or 11x00 or 11x10 or 11x01 or 11x11
+
+        FP16_add(&t0, &(w->a), &(w->b)); // (xa+xb)
+        FP16_add(&t1, &(y->a), &(y->b)); // (ya+yb)
+
+        FP16_norm(&t0);
+        FP16_norm(&t1);
+
+        FP16_mul(&z1, &t0, &t1); // (xa+xb)(ya+yb)  always 11x11
+        FP16_add(&t0, &(w->b), &(w->c)); // (xb+xc)
+        FP16_add(&t1, &(y->b), &(y->c)); // (yb+yc)
+
+        FP16_norm(&t0);
+        FP16_norm(&t1);
+
+        FP16_mul(&z3, &t0, &t1); // (xb+xc)(yb+yc)   could be anything...
+        FP16_neg(&t0, &z0);     // -(xa.ya)
+        FP16_neg(&t1, &z2);     // -(xb.yb)
+
+        FP16_add(&z1, &z1, &t0);
+        FP16_add(&(w->b), &z1, &t1); // /wb = (xa+xb)(ya+yb) -(xa.ya) -(xb.yb)                        = xa.yb + xb.ya
+
+        FP16_add(&z3, &z3, &t1);      // (xb+xc)(yb+yc) -(xb.yb)
+        FP16_add(&z2, &z2, &t0);      // (xb.yb) - (xa.ya)
+
+        FP16_add(&t0, &(w->a), &(w->c)); // (xa+xc)
+        FP16_add(&t1, &(y->a), &(y->c)); // (ya+yc)
+
+        FP16_norm(&t0);
+        FP16_norm(&t1);
+
+        FP16_mul(&t0, &t1, &t0); // (xa+xc)(ya+yc)    always 11x11
+        FP16_add(&z2, &z2, &t0); // (xb.yb) - (xa.ya) + (xa+xc)(ya+yc)
+
+#if SEXTIC_TWIST_ZZZ == D_TYPE
+        if (y->type == FP_SPARSE || w->type == FP_SPARSE)
+        {
+            FP8_mul(&t0.a, &(w->c).a, &(y->c).a);
+            FP8_zero(&t0.b);
+            if (y->type != FP_SPARSE)
+                FP8_mul(&t0.b, &(w->c).a, &(y->c).b);
+            if (w->type != FP_SPARSE)
+                FP8_mul(&t0.b, &(w->c).b, &(y->c).a);
+        }
+        else
+#endif
+            FP16_mul(&t0, &(w->c), &(y->c)); // (xc.yc)  could be anything
+
+        FP16_neg(&t1, &t0);           // -(xc.yc)
+
+        FP16_add(&(w->c), &z2, &t1);    // wc = (xb.yb) - (xa.ya) + (xa+xc)(ya+yc) - (xc.yc)    =  xb.yb + xc.ya + xa.yc
+        FP16_add(&z3, &z3, &t1);        // (xb+xc)(yb+yc) -(xb.yb) - (xc.yc)                    =  xb.yc + xc.yb
+        FP16_times_i(&t0);              // i.(xc.yc)
+        FP16_add(&(w->b), &(w->b), &t0); // wb = (xa+xb)(ya+yb) -(xa.ya) -(xb.yb) +i(xc.yc)
+        FP16_norm(&z3);
+        FP16_times_i(&z3);              // i[(xb+xc)(yb+yc) -(xb.yb) - (xc.yc)]                 = i(xb.yc + xc.yb)
+        FP16_add(&(w->a), &z0, &z3);    // wa = xa.ya + i(xb.yc + xc.yb)
+    } else {
+        if (w->type == FP_SPARSER || w->type == FP_SPARSEST)
+        {
+            FP48_smul(w, y);
+            return;
+        }
+// dense by sparser - 13m
+#if SEXTIC_TWIST_ZZZ == D_TYPE
+        FP16_copy(&z3, &(w->b));
+        FP16_mul(&z0, &(w->a), &(y->a));
+
+        if (y->type == FP_SPARSEST)
+            FP16_tmul(&z2, &(w->b), &(y->b).a.a.a.a);
+        else
+            FP16_pmul(&z2, &(w->b), &(y->b).a);
+
+        FP16_add(&(w->b), &(w->a), &(w->b));
+        FP16_copy(&t1, &(y->a));
+        FP8_add(&t1.a, &t1.a, &(y->b).a);
+
+        FP16_norm(&t1);
+        FP16_norm(&(w->b));
+
+        FP16_mul(&(w->b), &(w->b), &t1);
+        FP16_add(&z3, &z3, &(w->c));
+        FP16_norm(&z3);
+
+        if (y->type == FP_SPARSEST)
+            FP16_tmul(&z3, &z3, &(y->b).a.a.a.a);
+        else
+            FP16_pmul(&z3, &z3, &(y->b).a);
+
+        FP16_neg(&t0, &z0);
+        FP16_neg(&t1, &z2);
+
+        FP16_add(&(w->b), &(w->b), &t0); // z1=z1-z0
+        FP16_add(&(w->b), &(w->b), &t1); // z1=z1-z2
+
+        FP16_add(&z3, &z3, &t1);      // z3=z3-z2
+        FP16_add(&z2, &z2, &t0);      // z2=z2-z0
+
+        FP16_add(&t0, &(w->a), &(w->c));
+        FP16_norm(&t0);
+        FP16_norm(&z3);
+
+        FP16_mul(&t0, &(y->a), &t0);
+        FP16_add(&(w->c), &z2, &t0);
+
+        FP16_times_i(&z3);
+        FP16_add(&(w->a), &z0, &z3);
+#endif
+#if SEXTIC_TWIST_ZZZ == M_TYPE
+        FP16_mul(&z0, &(w->a), &(y->a));
+        FP16_add(&t0, &(w->a), &(w->b));
+        FP16_norm(&t0);
+
+        FP16_mul(&z1, &t0, &(y->a));
+        FP16_add(&t0, &(w->b), &(w->c));
+        FP16_norm(&t0);
+
+        if (y->type == FP_SPARSEST)
+            FP16_tmul(&z3, &t0, &(y->c).b.a.a.a);
+        else
+            FP16_pmul(&z3, &t0, &(y->c).b);
+
+        FP16_times_i(&z3);
+
+        FP16_neg(&t0, &z0);
+        FP16_add(&z1, &z1, &t0); // z1=z1-z0
+
+        FP16_copy(&(w->b), &z1);
+        FP16_copy(&z2, &t0);
+
+        FP16_add(&t0, &(w->a), &(w->c));
+        FP16_add(&t1, &(y->a), &(y->c));
+
+        FP16_norm(&t0);
+        FP16_norm(&t1);
+
+        FP16_mul(&t0, &t1, &t0);
+        FP16_add(&z2, &z2, &t0);
+
+        if (y->type == FP_SPARSEST)
+            FP16_tmul(&t0, &(w->c), &(y->c).b.a.a.a);
+        else
+            FP16_pmul(&t0, &(w->c), &(y->c).b);
+
+        FP16_times_i(&t0);
+        FP16_neg(&t1, &t0);
+        FP16_times_i(&t0);
+
+        FP16_add(&(w->c), &z2, &t1);
+        FP16_add(&z3, &z3, &t1);
+
+        FP16_add(&(w->b), &(w->b), &t0);
+        FP16_norm(&z3);
+        FP16_times_i(&z3);
+        FP16_add(&(w->a), &z0, &z3);
+#endif
+    }
+    w->type = FP_DENSE;
+    FP48_norm(w);
+}
+
+/* FP48 multiplication w=w*y */
+/* catering for special case that arises from special form of ATE pairing line function */
+/* w and y are both sparser line functions - cost = 6m */
+void YYY::FP48_smul(FP48 *w, FP48 *y)
+{
+    FP8 w1, w2, w3, ta, tb, tc, td, te, t;
+
+//  FP48_mul(w,y); return;
+
+#if SEXTIC_TWIST_ZZZ == D_TYPE
+    FP8_mul(&w1, &(w->a).a, &(y->a).a); // A1.A2
+    FP8_mul(&w2, &(w->a).b, &(y->a).b); // B1.B2
+
+    if (y->type == FP_SPARSEST || w->type == FP_SPARSEST)
+    {
+        if (y->type == FP_SPARSEST && w->type == FP_SPARSEST)
+        {
+            FP8_zero(&w3);
+            FP_mul(&w3.a.a.a, &(w->b).a.a.a.a, &(y->b).a.a.a.a);
+        } else {
+            if (y->type != FP_SPARSEST)
+                FP8_tmul(&w3, &(y->b).a, &(w->b).a.a.a.a);
+            if (w->type != FP_SPARSEST)
+                FP8_tmul(&w3, &(w->b).a, &(y->b).a.a.a.a);
+        }
+    }
+    else
+        FP8_mul(&w3, &(w->b).a, &(y->b).a); // C1.C2
+
+    FP8_add(&ta, &(w->a).a, &(w->a).b); // A1+B1
+    FP8_add(&tb, &(y->a).a, &(y->a).b); // A2+B2
+    FP8_norm(&ta);
+    FP8_norm(&tb);
+    FP8_mul(&tc, &ta, &tb);         // (A1+B1)(A2+B2)
+    FP8_add(&t, &w1, &w2);
+    FP8_neg(&t, &t);
+    FP8_add(&tc, &tc, &t);          // (A1+B1)(A2+B2)-A1.A2-B1*B2 =  (A1.B2+A2.B1)
+
+    FP8_add(&ta, &(w->a).a, &(w->b).a); // A1+C1
+    FP8_add(&tb, &(y->a).a, &(y->b).a); // A2+C2
+    FP8_norm(&ta);
+    FP8_norm(&tb);
+    FP8_mul(&td, &ta, &tb);         // (A1+C1)(A2+C2)
+    FP8_add(&t, &w1, &w3);
+    FP8_neg(&t, &t);
+    FP8_add(&td, &td, &t);          // (A1+C1)(A2+C2)-A1.A2-C1*C2 =  (A1.C2+A2.C1)
+
+    FP8_add(&ta, &(w->a).b, &(w->b).a); // B1+C1
+    FP8_add(&tb, &(y->a).b, &(y->b).a); // B2+C2
+    FP8_norm(&ta);
+    FP8_norm(&tb);
+    FP8_mul(&te, &ta, &tb);         // (B1+C1)(B2+C2)
+    FP8_add(&t, &w2, &w3);
+    FP8_neg(&t, &t);
+    FP8_add(&te, &te, &t);          // (B1+C1)(B2+C2)-B1.B2-C1*C2 =  (B1.C2+B2.C1)
+
+    FP8_times_i(&w2);
+    FP8_add(&w1, &w1, &w2);
+    FP16_from_FP8s(&(w->a), &w1, &tc);
+    FP16_from_FP8s(&(w->b), &td, &te); // only norm these 2
+    FP16_from_FP8(&(w->c), &w3);
+
+    FP16_norm(&(w->a));
+    FP16_norm(&(w->b));
+#endif
+#if SEXTIC_TWIST_ZZZ == M_TYPE
+    FP8_mul(&w1, &(w->a).a, &(y->a).a); // A1.A2
+    FP8_mul(&w2, &(w->a).b, &(y->a).b); // B1.B2
+
+    if (y->type == FP_SPARSEST || w->type == FP_SPARSEST)
+    {
+        if (y->type == FP_SPARSEST && w->type == FP_SPARSEST)
+        {
+            FP8_zero(&w3);
+            FP_mul(&w3.a.a.a, &(w->c).b.a.a.a, &(y->c).b.a.a.a);
+        } else {
+            if (y->type != FP_SPARSEST)
+                FP8_tmul(&w3, &(y->c).b, &(w->c).b.a.a.a);
+            if (w->type != FP_SPARSEST)
+                FP8_tmul(&w3, &(w->c).b, &(y->c).b.a.a.a);
+        }
+    }
+    else
+        FP8_mul(&w3, &(w->c).b, &(y->c).b); // F1.F2
+
+    FP8_add(&ta, &(w->a).a, &(w->a).b); // A1+B1
+    FP8_add(&tb, &(y->a).a, &(y->a).b); // A2+B2
+    FP8_norm(&ta);
+    FP8_norm(&tb);
+    FP8_mul(&tc, &ta, &tb);         // (A1+B1)(A2+B2)
+    FP8_add(&t, &w1, &w2);
+    FP8_neg(&t, &t);
+    FP8_add(&tc, &tc, &t);          // (A1+B1)(A2+B2)-A1.A2-B1*B2 =  (A1.B2+A2.B1)
+
+    FP8_add(&ta, &(w->a).a, &(w->c).b); // A1+F1
+    FP8_add(&tb, &(y->a).a, &(y->c).b); // A2+F2
+    FP8_norm(&ta);
+    FP8_norm(&tb);
+    FP8_mul(&td, &ta, &tb);         // (A1+F1)(A2+F2)
+    FP8_add(&t, &w1, &w3);
+    FP8_neg(&t, &t);
+    FP8_add(&td, &td, &t);          // (A1+F1)(A2+F2)-A1.A2-F1*F2 =  (A1.F2+A2.F1)
+
+    FP8_add(&ta, &(w->a).b, &(w->c).b); // B1+F1
+    FP8_add(&tb, &(y->a).b, &(y->c).b); // B2+F2
+    FP8_norm(&ta);
+    FP8_norm(&tb);
+    FP8_mul(&te, &ta, &tb);         // (B1+F1)(B2+F2)
+    FP8_add(&t, &w2, &w3);
+    FP8_neg(&t, &t);
+    FP8_add(&te, &te, &t);          // (B1+F1)(B2+F2)-B1.B2-F1*F2 =  (B1.F2+B2.F1)
+
+    FP8_times_i(&w2);
+    FP8_add(&w1, &w1, &w2);
+    FP16_from_FP8s(&(w->a), &w1, &tc);
+
+    FP8_times_i(&w3);
+    FP8_norm(&w3);
+    FP16_from_FP8H(&(w->b), &w3);
+
+    FP8_norm(&te);
+    FP8_times_i(&te);
+    FP16_from_FP8s(&(w->c), &te, &td);
+
+    FP16_norm(&(w->a));
+    FP16_norm(&(w->c));
+#endif
+
+    w->type = FP_SPARSE;
+}
+
+/* Set w=1/x */
+/* SU= 600 */
+void YYY::FP48_inv(FP48 *w, FP48 *x)
+{
+    FP16 f0, f1, f2, f3;
+
+    FP16_sqr(&f0, &(x->a));
+    FP16_mul(&f1, &(x->b), &(x->c));
+    FP16_times_i(&f1);
+    FP16_sub(&f0, &f0, &f1); /* y.a */
+    FP16_norm(&f0);
+
+    FP16_sqr(&f1, &(x->c));
+    FP16_times_i(&f1);
+    FP16_mul(&f2, &(x->a), &(x->b));
+    FP16_sub(&f1, &f1, &f2); /* y.b */
+    FP16_norm(&f1);
+
+    FP16_sqr(&f2, &(x->b));
+    FP16_mul(&f3, &(x->a), &(x->c));
+    FP16_sub(&f2, &f2, &f3); /* y.c */
+    FP16_norm(&f2);
+
+    FP16_mul(&f3, &(x->b), &f2);
+    FP16_times_i(&f3);
+    FP16_mul(&(w->a), &f0, &(x->a));
+    FP16_add(&f3, &(w->a), &f3);
+    FP16_mul(&(w->c), &f1, &(x->c));
+    FP16_times_i(&(w->c));
+
+    FP16_add(&f3, &(w->c), &f3);
+    FP16_norm(&f3);
+
+    FP16_inv(&f3, &f3);
+    FP16_mul(&(w->a), &f0, &f3);
+    FP16_mul(&(w->b), &f1, &f3);
+    FP16_mul(&(w->c), &f2, &f3);
+    w->type = FP_DENSE;
+}
+
+/* constant time powering by small integer of max length bts */
+
+void YYY::FP48_pinpow(FP48 *r, int e, int bts)
+{
+    int i, b;
+    FP48 R[2];
+
+    FP48_one(&R[0]);
+    FP48_copy(&R[1], r);
+
+    for (i = bts - 1; i >= 0; i--)
+    {
+        b = (e >> i) & 1;
+        FP48_mul(&R[1 - b], &R[b]);
+        FP48_usqr(&R[b], &R[b]);
+    }
+    FP48_copy(r, &R[0]);
+}
+
+/* Compressed powering of unitary elements y=x^(e mod r) */
+/*
+void YYY::FP48_compow(FP16 *c, FP48 *x, BIG e, BIG r)
+{
+    FP48 g1, g2;
+    FP16 cp, cpm1, cpm2;
+    FP2 f;
+    BIG q, a, b, m;
+
+    BIG_rcopy(a, Fra);
+    BIG_rcopy(b, Frb);
+    FP2_from_BIGs(&f, a, b);
+
+    BIG_rcopy(q, Modulus);
+
+    FP48_copy(&g1, x);
+    FP48_copy(&g2, x);
+
+    BIG_copy(m, q);
+    BIG_mod(m, r);
+
+    BIG_copy(a, e);
+    BIG_mod(a, m);
+
+    BIG_copy(b, e);
+    BIG_sdiv(b, m);
+
+    FP48_trace(c, &g1);
+
+    if (BIG_iszilch(b))
+    {
+        FP16_xtr_pow(c, c, e);
+        return;
+    }
+
+    FP48_frob(&g2, &f, 1);
+    FP48_trace(&cp, &g2);
+    FP48_conj(&g1, &g1);
+    FP48_mul(&g2, &g1);
+    FP48_trace(&cpm1, &g2);
+    FP48_mul(&g2, &g1);
+
+    FP48_trace(&cpm2, &g2);
+
+    FP16_xtr_pow2(c, &cp, c, &cpm1, &cpm2, a, b);
+
+}
+*/
+/* Note this is simple square and multiply, so not side-channel safe */
+
+void YYY::FP48_pow(FP48 *r, FP48 *a, BIG b)
+{
+    FP48 w, sf;
+    BIG b1, b3;
+    int i, nb, bt;
+    BIG_copy(b1, b);
+    BIG_norm(b1);
+    BIG_pmul(b3, b1, 3);
+    BIG_norm(b3);
+
+    FP48_copy(&sf, a);
+    FP48_norm(&sf);
+    FP48_copy(&w, &sf);
+
+    if (BIG_iszilch(b3))
+    {
+        FP48_one(r);
+        return;
+    }
+
+    nb = BIG_nbits(b3);
+    for (i = nb - 2; i >= 1; i--)
+    {
+        FP48_usqr(&w, &w);
+        bt = BIG_bit(b3, i) - BIG_bit(b1, i);
+        if (bt == 1)
+            FP48_mul(&w, &sf);
+        if (bt == -1)
+        {
+            FP48_conj(&sf, &sf);
+            FP48_mul(&w, &sf);
+            FP48_conj(&sf, &sf);
+        }
+    }
+
+    FP48_copy(r, &w);
+    FP48_reduce(r);
+}
+
+/* p=q0^u0.q1^u1.q2^u2.q3^u3... */
+/* Side channel attack secure */
+// Bos & Costello https://eprint.iacr.org/2013/458.pdf
+// Faz-Hernandez & Longa & Sanchez  https://eprint.iacr.org/2013/158.pdf
+
+void YYY::FP48_pow16(FP48 *p, FP48 *q, BIG u[16])
+{
+    int i, j, k, nb, pb1, pb2, pb3, pb4, bt;
+    FP48 g1[8], g2[8], g3[8], g4[8], r;
+    BIG t[16], mt;
+    sign8 w1[NLEN_XXX * BASEBITS_XXX + 1];
+    sign8 s1[NLEN_XXX * BASEBITS_XXX + 1];
+    sign8 w2[NLEN_XXX * BASEBITS_XXX + 1];
+    sign8 s2[NLEN_XXX * BASEBITS_XXX + 1];
+    sign8 w3[NLEN_XXX * BASEBITS_XXX + 1];
+    sign8 s3[NLEN_XXX * BASEBITS_XXX + 1];
+    sign8 w4[NLEN_XXX * BASEBITS_XXX + 1];
+    sign8 s4[NLEN_XXX * BASEBITS_XXX + 1];
+
+    for (i = 0; i < 16; i++)
+        BIG_copy(t[i], u[i]);
+
+// Precomputed tables
+    FP48_copy(&g1[0], &q[0]); // q[0]
+    FP48_copy(&g1[1], &g1[0]);
+    FP48_mul(&g1[1], &q[1]); // q[0].q[1]
+    FP48_copy(&g1[2], &g1[0]);
+    FP48_mul(&g1[2], &q[2]); // q[0].q[2]
+    FP48_copy(&g1[3], &g1[1]);
+    FP48_mul(&g1[3], &q[2]); // q[0].q[1].q[2]
+    FP48_copy(&g1[4], &g1[0]);
+    FP48_mul(&g1[4], &q[3]); // q[0].q[3]
+    FP48_copy(&g1[5], &g1[1]);
+    FP48_mul(&g1[5], &q[3]); // q[0].q[1].q[3]
+    FP48_copy(&g1[6], &g1[2]);
+    FP48_mul(&g1[6], &q[3]); // q[0].q[2].q[3]
+    FP48_copy(&g1[7], &g1[3]);
+    FP48_mul(&g1[7], &q[3]); // q[0].q[1].q[2].q[3]
+
+    FP48_copy(&g2[0], &q[4]); // q[0]
+    FP48_copy(&g2[1], &g2[0]);
+    FP48_mul(&g2[1], &q[5]); // q[0].q[1]
+    FP48_copy(&g2[2], &g2[0]);
+    FP48_mul(&g2[2], &q[6]); // q[0].q[2]
+    FP48_copy(&g2[3], &g2[1]);
+    FP48_mul(&g2[3], &q[6]); // q[0].q[1].q[2]
+    FP48_copy(&g2[4], &g2[0]);
+    FP48_mul(&g2[4], &q[7]); // q[0].q[3]
+    FP48_copy(&g2[5], &g2[1]);
+    FP48_mul(&g2[5], &q[7]); // q[0].q[1].q[3]
+    FP48_copy(&g2[6], &g2[2]);
+    FP48_mul(&g2[6], &q[7]); // q[0].q[2].q[3]
+    FP48_copy(&g2[7], &g2[3]);
+    FP48_mul(&g2[7], &q[7]); // q[0].q[1].q[2].q[3]
+
+    FP48_copy(&g3[0], &q[8]); // q[0]
+    FP48_copy(&g3[1], &g3[0]);
+    FP48_mul(&g3[1], &q[9]); // q[0].q[1]
+    FP48_copy(&g3[2], &g3[0]);
+    FP48_mul(&g3[2], &q[10]);   // q[0].q[2]
+    FP48_copy(&g3[3], &g3[1]);
+    FP48_mul(&g3[3], &q[10]);   // q[0].q[1].q[2]
+    FP48_copy(&g3[4], &g3[0]);
+    FP48_mul(&g3[4], &q[11]); // q[0].q[3]
+    FP48_copy(&g3[5], &g3[1]);
+    FP48_mul(&g3[5], &q[11]);   // q[0].q[1].q[3]
+    FP48_copy(&g3[6], &g3[2]);
+    FP48_mul(&g3[6], &q[11]);   // q[0].q[2].q[3]
+    FP48_copy(&g3[7], &g3[3]);
+    FP48_mul(&g3[7], &q[11]);   // q[0].q[1].q[2].q[3]
+
+    FP48_copy(&g4[0], &q[12]); // q[0]
+    FP48_copy(&g4[1], &g4[0]);
+    FP48_mul(&g4[1], &q[13]);   // q[0].q[1]
+    FP48_copy(&g4[2], &g4[0]);
+    FP48_mul(&g4[2], &q[14]);   // q[0].q[2]
+    FP48_copy(&g4[3], &g4[1]);
+    FP48_mul(&g4[3], &q[14]);   // q[0].q[1].q[2]
+    FP48_copy(&g4[4], &g4[0]);
+    FP48_mul(&g4[4], &q[15]); // q[0].q[3]
+    FP48_copy(&g4[5], &g4[1]);
+    FP48_mul(&g4[5], &q[15]);   // q[0].q[1].q[3]
+    FP48_copy(&g4[6], &g4[2]);
+    FP48_mul(&g4[6], &q[15]);   // q[0].q[2].q[3]
+    FP48_copy(&g4[7], &g4[3]);
+    FP48_mul(&g4[7], &q[15]);   // q[0].q[1].q[2].q[3]
+
+// Make them odd
+    pb1 = 1 - BIG_parity(t[0]);
+    BIG_inc(t[0], pb1);
+    BIG_norm(t[0]);
+
+    pb2 = 1 - BIG_parity(t[4]);
+    BIG_inc(t[4], pb2);
+    BIG_norm(t[4]);
+
+    pb3 = 1 - BIG_parity(t[8]);
+    BIG_inc(t[8], pb3);
+    BIG_norm(t[8]);
+
+    pb4 = 1 - BIG_parity(t[12]);
+    BIG_inc(t[12], pb4);
+    BIG_norm(t[12]);
+
+// Number of bits
+    BIG_zero(mt);
+    for (i = 0; i < 16; i++)
+    {
+        BIG_or(mt, mt, t[i]);
+    }
+    nb = 1 + BIG_nbits(mt);
+
+// Sign pivot
+    s1[nb - 1] = 1;
+    s2[nb - 1] = 1;
+    s3[nb - 1] = 1;
+    s4[nb - 1] = 1;
+    for (i = 0; i < nb - 1; i++)
+    {
+        BIG_fshr(t[0], 1);
+        s1[i] = 2 * BIG_parity(t[0]) - 1;
+        BIG_fshr(t[4], 1);
+        s2[i] = 2 * BIG_parity(t[4]) - 1;
+        BIG_fshr(t[8], 1);
+        s3[i] = 2 * BIG_parity(t[8]) - 1;
+        BIG_fshr(t[12], 1);
+        s4[i] = 2 * BIG_parity(t[12]) - 1;
+    }
+
+// Recoded exponents
+    for (i = 0; i < nb; i++)
+    {
+        w1[i] = 0;
+        k = 1;
+        for (j = 1; j < 4; j++)
+        {
+            bt = s1[i] * BIG_parity(t[j]);
+            BIG_fshr(t[j], 1);
+
+            BIG_dec(t[j], (bt >> 1));
+            BIG_norm(t[j]);
+            w1[i] += bt * k;
+            k *= 2;
+        }
+
+        w2[i] = 0;
+        k = 1;
+        for (j = 5; j < 8; j++)
+        {
+            bt = s2[i] * BIG_parity(t[j]);
+            BIG_fshr(t[j], 1);
+
+            BIG_dec(t[j], (bt >> 1));
+            BIG_norm(t[j]);
+            w2[i] += bt * k;
+            k *= 2;
+        }
+
+        w3[i] = 0;
+        k = 1;
+        for (j = 9; j < 12; j++)
+        {
+            bt = s3[i] * BIG_parity(t[j]);
+            BIG_fshr(t[j], 1);
+
+            BIG_dec(t[j], (bt >> 1));
+            BIG_norm(t[j]);
+            w3[i] += bt * k;
+            k *= 2;
+        }
+
+        w4[i] = 0;
+        k = 1;
+        for (j = 13; j < 16; j++)
+        {
+            bt = s4[i] * BIG_parity(t[j]);
+            BIG_fshr(t[j], 1);
+
+            BIG_dec(t[j], (bt >> 1));
+            BIG_norm(t[j]);
+            w4[i] += bt * k;
+            k *= 2;
+        }
+    }
+
+// Main loop
+    FP48_select(p, g1, 2 * w1[nb - 1] + 1);
+    FP48_select(&r, g2, 2 * w2[nb - 1] + 1);
+    FP48_mul(p, &r);
+    FP48_select(&r, g3, 2 * w3[nb - 1] + 1);
+    FP48_mul(p, &r);
+    FP48_select(&r, g4, 2 * w4[nb - 1] + 1);
+    FP48_mul(p, &r);
+    for (i = nb - 2; i >= 0; i--)
+    {
+        FP48_usqr(p, p);
+        FP48_select(&r, g1, 2 * w1[i] + s1[i]);
+        FP48_mul(p, &r);
+        FP48_select(&r, g2, 2 * w2[i] + s2[i]);
+        FP48_mul(p, &r);
+        FP48_select(&r, g3, 2 * w3[i] + s3[i]);
+        FP48_mul(p, &r);
+        FP48_select(&r, g4, 2 * w4[i] + s4[i]);
+        FP48_mul(p, &r);
+    }
+
+// apply correction
+    FP48_conj(&r, &q[0]);
+    FP48_mul(&r, p);
+    FP48_cmove(p, &r, pb1);
+    FP48_conj(&r, &q[4]);
+    FP48_mul(&r, p);
+    FP48_cmove(p, &r, pb2);
+
+    FP48_conj(&r, &q[8]);
+    FP48_mul(&r, p);
+    FP48_cmove(p, &r, pb3);
+    FP48_conj(&r, &q[12]);
+    FP48_mul(&r, p);
+    FP48_cmove(p, &r, pb4);
+
+    FP48_reduce(p);
+}
+
+/* Set w=w^p using Frobenius */
+/* SU= 160 */
+void YYY::FP48_frob(FP48 *w, FP2 *f, int n)
+{
+    int i;
+    FP8 X2, X4;
+    FP4 F;
+    FP2 f3, f2;             // f=(1+i)^(p-19)/24
+    FP2_sqr(&f2, f);    //
+    FP2_mul(&f3, &f2, f); // f3=f^3=(1+i)^(p-19)/8
+
+    FP2_mul_ip(&f3);
+    FP2_norm(&f3);
+    FP2_mul_ip(&f3);    // f3 = (1+i)^16/8.(1+i)^(p-19)/8 = (1+i)^(p-3)/8
+    FP2_norm(&f3);
+
+    for (i = 0; i < n; i++)
+    {
+        FP16_frob(&(w->a), &f3);  // a=a^p
+        FP16_frob(&(w->b), &f3);  // b=b^p
+        FP16_frob(&(w->c), &f3);  // c=c^p
+
+        FP16_qmul(&(w->b), &(w->b), f); FP16_times_i4(&(w->b)); FP16_times_i2(&(w->b));
+        FP16_qmul(&(w->c), &(w->c), &f2); FP16_times_i4(&(w->c)); FP16_times_i4(&(w->c)); FP16_times_i4(&(w->c));
+    }
+    w->type = FP_DENSE;
+}
+
+/* SU= 8 */
+/* normalise all components of w */
+void YYY::FP48_norm(FP48 *w)
+{
+    FP16_norm(&(w->a));
+    FP16_norm(&(w->b));
+    FP16_norm(&(w->c));
+}
+
+/* SU= 8 */
+/* reduce all components of w */
+void YYY::FP48_reduce(FP48 *w)
+{
+    FP16_reduce(&(w->a));
+    FP16_reduce(&(w->b));
+    FP16_reduce(&(w->c));
+}
+
+/* trace function w=trace(x) */
+/* SU= 8 */
+void YYY::FP48_trace(FP16 *w, FP48 *x)
+{
+    FP16_imul(w, &(x->a), 3);
+    FP16_reduce(w);
+}
+
+/* SU= 8 */
+/* Output w in hex */
+void YYY::FP48_output(FP48 *w)
+{
+    printf("[");
+    FP16_output(&(w->a));
+    printf(",");
+    FP16_output(&(w->b));
+    printf(",");
+    FP16_output(&(w->c));
+    printf("]");
+}
+
+/* Convert g to octet string w */
+void YYY::FP48_toOctet(octet *W, FP48 *g)
+{
+    W->len = 48 * MODBYTES_XXX;
+    FP16_toBytes(&(W->val[0]),&(g->c));
+    FP16_toBytes(&(W->val[16 * MODBYTES_XXX]),&(g->b));
+    FP16_toBytes(&(W->val[32 * MODBYTES_XXX]),&(g->a));
+}
+
+/* Restore g from octet string w */
+void YYY::FP48_fromOctet(FP48 *g, octet *W)
+{
+    FP16_fromBytes(&(g->c),&(W->val[0]));
+    FP16_fromBytes(&(g->b),&(W->val[16 * MODBYTES_XXX]));
+    FP16_fromBytes(&(g->a),&(W->val[32 * MODBYTES_XXX]));
+}
+
+/* Move b to a if d=1 */
+void YYY::FP48_cmove(FP48 *f, FP48 *g, int d)
+{
+    FP16_cmove(&(f->a), &(g->a), d);
+    FP16_cmove(&(f->b), &(g->b), d);
+    FP16_cmove(&(f->c), &(g->c), d);
+    d = ~(d - 1);
+    f->type ^= (f->type ^ g->type)&d;
+}
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp48.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp48.h
new file mode 100644
index 0000000..b1095f9
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp48.h
@@ -0,0 +1,231 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP48_YYY_H
+#define FP48_YYY_H
+
+#include "fp16_YYY.h"
+
+using namespace core;
+
+namespace YYY {
+/**
+	@brief FP12 Structure - towered over three FP16
+*/
+
+typedef struct
+{
+    FP16 a; /**< first part of FP12 */
+    FP16 b; /**< second part of FP12 */
+    FP16 c; /**< third part of FP12 */
+    int type;
+} FP48;
+
+extern const XXX::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const XXX::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+/* FP48 prototypes */
+/**	@brief Tests for FP48 equal to zero
+ *
+	@param x FP48 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP48_iszilch(FP48 *x);
+/**	@brief Tests for FP48 equal to unity
+ *
+	@param x FP48 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP48_isunity(FP48 *x);
+/**	@brief Copy FP48 to another FP48
+ *
+	@param x FP48 instance, on exit = y
+	@param y FP48 instance to be copied
+ */
+extern void FP48_copy(FP48 *x, FP48 *y);
+/**	@brief Set FP48 to unity
+ *
+	@param x FP48 instance to be set to one
+ */
+extern void FP48_one(FP48 *x);
+
+/**	@brief Set FP48 to zero
+ *
+	@param x FP48 instance to be set to zero
+ */
+extern void FP48_zero(FP48 *x);
+
+/**	@brief Tests for equality of two FP48s
+ *
+	@param x FP48 instance to be compared
+	@param y FP48 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP48_equals(FP48 *x, FP48 *y);
+/**	@brief Conjugation of FP48
+ *
+	If y=(a,b,c) (where a,b,c are its three FP16 components) on exit x=(conj(a),-conj(b),conj(c))
+	@param x FP48 instance, on exit = conj(y)
+	@param y FP48 instance
+ */
+extern void FP48_conj(FP48 *x, FP48 *y);
+/**	@brief Initialise FP48 from single FP16
+ *
+	Sets first FP16 component of an FP48, other components set to zero
+	@param x FP48 instance to be initialised
+	@param a FP16 to form first part of FP48
+ */
+extern void FP48_from_FP16(FP48 *x, FP16 *a);
+/**	@brief Initialise FP48 from three FP16s
+ *
+	@param x FP48 instance to be initialised
+	@param a FP16 to form first part of FP48
+	@param b FP16 to form second part of FP48
+	@param c FP16 to form third part of FP48
+ */
+extern void FP48_from_FP16s(FP48 *x, FP16 *a, FP16* b, FP16 *c);
+/**	@brief Fast Squaring of an FP48 in "unitary" form
+ *
+	@param x FP48 instance, on exit = y^2
+	@param y FP16 instance, must be unitary
+ */
+extern void FP48_usqr(FP48 *x, FP48 *y);
+/**	@brief Squaring an FP48
+ *
+	@param x FP48 instance, on exit = y^2
+	@param y FP48 instance
+ */
+extern void FP48_sqr(FP48 *x, FP48 *y);
+/**	@brief Fast multiplication of two sparse FP24s that arises from ATE pairing line functions
+ *
+	@param x FP48 instance, on exit = x*y
+	@param y FP48 instance, of special form
+ */
+extern void FP48_smul(FP48 *x, FP48 *y);
+
+/**	@brief Fast multiplication of what may be sparse multiplicands
+ *
+	@param x FP48 instance, on exit = x*y
+	@param y FP48 instance, of special form
+ */
+extern void FP48_ssmul(FP48 *x, FP48 *y);
+/**	@brief Full unconditional Multiplication of two FP24s
+ *
+	@param x FP48 instance, on exit = x*y
+	@param y FP48 instance, the multiplier
+ */
+extern void FP48_mul(FP48 *x, FP48 *y);
+/**	@brief Inverting an FP48
+ *
+	@param x FP48 instance, on exit = 1/y
+	@param y FP48 instance
+ */
+extern void FP48_inv(FP48 *x, FP48 *y);
+/**	@brief Raises an FP48 to the power of a BIG
+ *
+	@param r FP48 instance, on exit = y^b
+	@param x FP48 instance
+	@param b BIG number
+ */
+extern void FP48_pow(FP48 *r, FP48 *x, XXX::BIG b);
+
+//extern void FP48_ppow(FP48 *r,FP48 *x,XXX::BIG b);
+
+/**	@brief Raises an FP48 instance x to a small integer power, side-channel resistant
+ *
+	@param x FP48 instance, on exit = x^i
+	@param i small integer exponent
+	@param b maximum number of bits in exponent
+ */
+extern void FP48_pinpow(FP48 *x, int i, int b);
+
+/**	@brief Raises an FP48 instance x to a BIG power, compressed to FP16
+ *
+	@param c FP16 instance, on exit = x^(e mod r) as FP16
+	@param x FP48 input
+	@param e BIG exponent
+	@param r BIG group order
+ */
+extern void FP48_compow(FP16 *c, FP48 *x, XXX::BIG e, XXX::BIG r);
+
+/**	@brief Calculate Pi x[i]^b[i] for i=0 to 15, side-channel resistant
+ *
+	@param r FP48 instance, on exit = Pi x[i]^b[i] for i=0 to 15
+	@param x FP48 array with 16 FP48s
+	@param b BIG array of 16 exponents
+ */
+extern void FP48_pow16(FP48 *r, FP48 *x, XXX::BIG *b);
+
+
+/**	@brief Raises an FP48 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP48 instance, on exit = x^p^n
+	@param f FP2 precalculated Frobenius constant
+	@param n power of p
+ */
+extern void FP48_frob(FP48 *x, FP2 *f, int n);
+
+/**	@brief Reduces all components of possibly unreduced FP48 mod Modulus
+ *
+	@param x FP48 instance, on exit reduced mod Modulus
+ */
+extern void FP48_reduce(FP48 *x);
+/**	@brief Normalises the components of an FP48
+ *
+	@param x FP48 instance to be normalised
+ */
+extern void FP48_norm(FP48 *x);
+/**	@brief Formats and outputs an FP48 to the console
+ *
+	@param x FP48 instance to be printed
+ */
+extern void FP48_output(FP48 *x);
+/**	@brief Formats and outputs an FP48 instance to an octet string
+ *
+	Serializes the components of an FP48 to big-endian base 256 form.
+	@param S output octet string
+	@param x FP48 instance to be converted to an octet string
+ */
+extern void FP48_toOctet(octet *S, FP48 *x);
+/**	@brief Creates an FP48 instance from an octet string
+ *
+	De-serializes the components of an FP48 to create an FP48 from big-endian base 256 components.
+	@param x FP48 instance to be created from an octet string
+	@param S input octet string
+
+ */
+extern void FP48_fromOctet(FP48 *x, octet *S);
+/**	@brief Calculate the trace of an FP48
+ *
+	@param t FP16 trace of x, on exit = tr(x)
+	@param x FP48 instance
+
+ */
+extern void FP48_trace(FP16 *t, FP48 *x);
+
+/**	@brief Conditional copy of FP48 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP48 instance, set to y if s!=0
+	@param y another FP48 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP48_cmove(FP48 *x, FP48 *y, int s);
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp48_BLS48286.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp48_BLS48286.h
new file mode 100644
index 0000000..3179845
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp48_BLS48286.h
@@ -0,0 +1,231 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP48_BLS48286_H
+#define FP48_BLS48286_H
+
+#include "fp16_BLS48286.h"
+
+using namespace core;
+
+namespace BLS48286 {
+/**
+	@brief FP12 Structure - towered over three FP16
+*/
+
+typedef struct
+{
+    FP16 a; /**< first part of FP12 */
+    FP16 b; /**< second part of FP12 */
+    FP16 c; /**< third part of FP12 */
+    int type;
+} FP48;
+
+extern const B288_60::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B288_60::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+/* FP48 prototypes */
+/**	@brief Tests for FP48 equal to zero
+ *
+	@param x FP48 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP48_iszilch(FP48 *x);
+/**	@brief Tests for FP48 equal to unity
+ *
+	@param x FP48 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP48_isunity(FP48 *x);
+/**	@brief Copy FP48 to another FP48
+ *
+	@param x FP48 instance, on exit = y
+	@param y FP48 instance to be copied
+ */
+extern void FP48_copy(FP48 *x, FP48 *y);
+/**	@brief Set FP48 to unity
+ *
+	@param x FP48 instance to be set to one
+ */
+extern void FP48_one(FP48 *x);
+
+/**	@brief Set FP48 to zero
+ *
+	@param x FP48 instance to be set to zero
+ */
+extern void FP48_zero(FP48 *x);
+
+/**	@brief Tests for equality of two FP48s
+ *
+	@param x FP48 instance to be compared
+	@param y FP48 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP48_equals(FP48 *x, FP48 *y);
+/**	@brief Conjugation of FP48
+ *
+	If y=(a,b,c) (where a,b,c are its three FP16 components) on exit x=(conj(a),-conj(b),conj(c))
+	@param x FP48 instance, on exit = conj(y)
+	@param y FP48 instance
+ */
+extern void FP48_conj(FP48 *x, FP48 *y);
+/**	@brief Initialise FP48 from single FP16
+ *
+	Sets first FP16 component of an FP48, other components set to zero
+	@param x FP48 instance to be initialised
+	@param a FP16 to form first part of FP48
+ */
+extern void FP48_from_FP16(FP48 *x, FP16 *a);
+/**	@brief Initialise FP48 from three FP16s
+ *
+	@param x FP48 instance to be initialised
+	@param a FP16 to form first part of FP48
+	@param b FP16 to form second part of FP48
+	@param c FP16 to form third part of FP48
+ */
+extern void FP48_from_FP16s(FP48 *x, FP16 *a, FP16* b, FP16 *c);
+/**	@brief Fast Squaring of an FP48 in "unitary" form
+ *
+	@param x FP48 instance, on exit = y^2
+	@param y FP16 instance, must be unitary
+ */
+extern void FP48_usqr(FP48 *x, FP48 *y);
+/**	@brief Squaring an FP48
+ *
+	@param x FP48 instance, on exit = y^2
+	@param y FP48 instance
+ */
+extern void FP48_sqr(FP48 *x, FP48 *y);
+/**	@brief Fast multiplication of two sparse FP24s that arises from ATE pairing line functions
+ *
+	@param x FP48 instance, on exit = x*y
+	@param y FP48 instance, of special form
+ */
+extern void FP48_smul(FP48 *x, FP48 *y);
+
+/**	@brief Fast multiplication of what may be sparse multiplicands
+ *
+	@param x FP48 instance, on exit = x*y
+	@param y FP48 instance, of special form
+ */
+extern void FP48_ssmul(FP48 *x, FP48 *y);
+/**	@brief Full unconditional Multiplication of two FP24s
+ *
+	@param x FP48 instance, on exit = x*y
+	@param y FP48 instance, the multiplier
+ */
+extern void FP48_mul(FP48 *x, FP48 *y);
+/**	@brief Inverting an FP48
+ *
+	@param x FP48 instance, on exit = 1/y
+	@param y FP48 instance
+ */
+extern void FP48_inv(FP48 *x, FP48 *y);
+/**	@brief Raises an FP48 to the power of a BIG
+ *
+	@param r FP48 instance, on exit = y^b
+	@param x FP48 instance
+	@param b BIG number
+ */
+extern void FP48_pow(FP48 *r, FP48 *x, B288_60::BIG b);
+
+//extern void FP48_ppow(FP48 *r,FP48 *x,B288_60::BIG b);
+
+/**	@brief Raises an FP48 instance x to a small integer power, side-channel resistant
+ *
+	@param x FP48 instance, on exit = x^i
+	@param i small integer exponent
+	@param b maximum number of bits in exponent
+ */
+extern void FP48_pinpow(FP48 *x, int i, int b);
+
+/**	@brief Raises an FP48 instance x to a BIG power, compressed to FP16
+ *
+	@param c FP16 instance, on exit = x^(e mod r) as FP16
+	@param x FP48 input
+	@param e BIG exponent
+	@param r BIG group order
+ */
+extern void FP48_compow(FP16 *c, FP48 *x, B288_60::BIG e, B288_60::BIG r);
+
+/**	@brief Calculate Pi x[i]^b[i] for i=0 to 15, side-channel resistant
+ *
+	@param r FP48 instance, on exit = Pi x[i]^b[i] for i=0 to 15
+	@param x FP48 array with 16 FP48s
+	@param b BIG array of 16 exponents
+ */
+extern void FP48_pow16(FP48 *r, FP48 *x, B288_60::BIG *b);
+
+
+/**	@brief Raises an FP48 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP48 instance, on exit = x^p^n
+	@param f FP2 precalculated Frobenius constant
+	@param n power of p
+ */
+extern void FP48_frob(FP48 *x, FP2 *f, int n);
+
+/**	@brief Reduces all components of possibly unreduced FP48 mod Modulus
+ *
+	@param x FP48 instance, on exit reduced mod Modulus
+ */
+extern void FP48_reduce(FP48 *x);
+/**	@brief Normalises the components of an FP48
+ *
+	@param x FP48 instance to be normalised
+ */
+extern void FP48_norm(FP48 *x);
+/**	@brief Formats and outputs an FP48 to the console
+ *
+	@param x FP48 instance to be printed
+ */
+extern void FP48_output(FP48 *x);
+/**	@brief Formats and outputs an FP48 instance to an octet string
+ *
+	Serializes the components of an FP48 to big-endian base 256 form.
+	@param S output octet string
+	@param x FP48 instance to be converted to an octet string
+ */
+extern void FP48_toOctet(octet *S, FP48 *x);
+/**	@brief Creates an FP48 instance from an octet string
+ *
+	De-serializes the components of an FP48 to create an FP48 from big-endian base 256 components.
+	@param x FP48 instance to be created from an octet string
+	@param S input octet string
+
+ */
+extern void FP48_fromOctet(FP48 *x, octet *S);
+/**	@brief Calculate the trace of an FP48
+ *
+	@param t FP16 trace of x, on exit = tr(x)
+	@param x FP48 instance
+
+ */
+extern void FP48_trace(FP16 *t, FP48 *x);
+
+/**	@brief Conditional copy of FP48 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP48 instance, set to y if s!=0
+	@param y another FP48 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP48_cmove(FP48 *x, FP48 *y, int s);
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp48_BLS48556.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp48_BLS48556.h
new file mode 100644
index 0000000..c473883
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp48_BLS48556.h
@@ -0,0 +1,231 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP48_BLS48556_H
+#define FP48_BLS48556_H
+
+#include "fp16_BLS48556.h"
+
+using namespace core;
+
+namespace BLS48556 {
+/**
+	@brief FP12 Structure - towered over three FP16
+*/
+
+typedef struct
+{
+    FP16 a; /**< first part of FP12 */
+    FP16 b; /**< second part of FP12 */
+    FP16 c; /**< third part of FP12 */
+    int type;
+} FP48;
+
+extern const B560_58::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B560_58::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+/* FP48 prototypes */
+/**	@brief Tests for FP48 equal to zero
+ *
+	@param x FP48 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP48_iszilch(FP48 *x);
+/**	@brief Tests for FP48 equal to unity
+ *
+	@param x FP48 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP48_isunity(FP48 *x);
+/**	@brief Copy FP48 to another FP48
+ *
+	@param x FP48 instance, on exit = y
+	@param y FP48 instance to be copied
+ */
+extern void FP48_copy(FP48 *x, FP48 *y);
+/**	@brief Set FP48 to unity
+ *
+	@param x FP48 instance to be set to one
+ */
+extern void FP48_one(FP48 *x);
+
+/**	@brief Set FP48 to zero
+ *
+	@param x FP48 instance to be set to zero
+ */
+extern void FP48_zero(FP48 *x);
+
+/**	@brief Tests for equality of two FP48s
+ *
+	@param x FP48 instance to be compared
+	@param y FP48 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP48_equals(FP48 *x, FP48 *y);
+/**	@brief Conjugation of FP48
+ *
+	If y=(a,b,c) (where a,b,c are its three FP16 components) on exit x=(conj(a),-conj(b),conj(c))
+	@param x FP48 instance, on exit = conj(y)
+	@param y FP48 instance
+ */
+extern void FP48_conj(FP48 *x, FP48 *y);
+/**	@brief Initialise FP48 from single FP16
+ *
+	Sets first FP16 component of an FP48, other components set to zero
+	@param x FP48 instance to be initialised
+	@param a FP16 to form first part of FP48
+ */
+extern void FP48_from_FP16(FP48 *x, FP16 *a);
+/**	@brief Initialise FP48 from three FP16s
+ *
+	@param x FP48 instance to be initialised
+	@param a FP16 to form first part of FP48
+	@param b FP16 to form second part of FP48
+	@param c FP16 to form third part of FP48
+ */
+extern void FP48_from_FP16s(FP48 *x, FP16 *a, FP16* b, FP16 *c);
+/**	@brief Fast Squaring of an FP48 in "unitary" form
+ *
+	@param x FP48 instance, on exit = y^2
+	@param y FP16 instance, must be unitary
+ */
+extern void FP48_usqr(FP48 *x, FP48 *y);
+/**	@brief Squaring an FP48
+ *
+	@param x FP48 instance, on exit = y^2
+	@param y FP48 instance
+ */
+extern void FP48_sqr(FP48 *x, FP48 *y);
+/**	@brief Fast multiplication of two sparse FP24s that arises from ATE pairing line functions
+ *
+	@param x FP48 instance, on exit = x*y
+	@param y FP48 instance, of special form
+ */
+extern void FP48_smul(FP48 *x, FP48 *y);
+
+/**	@brief Fast multiplication of what may be sparse multiplicands
+ *
+	@param x FP48 instance, on exit = x*y
+	@param y FP48 instance, of special form
+ */
+extern void FP48_ssmul(FP48 *x, FP48 *y);
+/**	@brief Full unconditional Multiplication of two FP24s
+ *
+	@param x FP48 instance, on exit = x*y
+	@param y FP48 instance, the multiplier
+ */
+extern void FP48_mul(FP48 *x, FP48 *y);
+/**	@brief Inverting an FP48
+ *
+	@param x FP48 instance, on exit = 1/y
+	@param y FP48 instance
+ */
+extern void FP48_inv(FP48 *x, FP48 *y);
+/**	@brief Raises an FP48 to the power of a BIG
+ *
+	@param r FP48 instance, on exit = y^b
+	@param x FP48 instance
+	@param b BIG number
+ */
+extern void FP48_pow(FP48 *r, FP48 *x, B560_58::BIG b);
+
+//extern void FP48_ppow(FP48 *r,FP48 *x,B560_58::BIG b);
+
+/**	@brief Raises an FP48 instance x to a small integer power, side-channel resistant
+ *
+	@param x FP48 instance, on exit = x^i
+	@param i small integer exponent
+	@param b maximum number of bits in exponent
+ */
+extern void FP48_pinpow(FP48 *x, int i, int b);
+
+/**	@brief Raises an FP48 instance x to a BIG power, compressed to FP16
+ *
+	@param c FP16 instance, on exit = x^(e mod r) as FP16
+	@param x FP48 input
+	@param e BIG exponent
+	@param r BIG group order
+ */
+extern void FP48_compow(FP16 *c, FP48 *x, B560_58::BIG e, B560_58::BIG r);
+
+/**	@brief Calculate Pi x[i]^b[i] for i=0 to 15, side-channel resistant
+ *
+	@param r FP48 instance, on exit = Pi x[i]^b[i] for i=0 to 15
+	@param x FP48 array with 16 FP48s
+	@param b BIG array of 16 exponents
+ */
+extern void FP48_pow16(FP48 *r, FP48 *x, B560_58::BIG *b);
+
+
+/**	@brief Raises an FP48 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP48 instance, on exit = x^p^n
+	@param f FP2 precalculated Frobenius constant
+	@param n power of p
+ */
+extern void FP48_frob(FP48 *x, FP2 *f, int n);
+
+/**	@brief Reduces all components of possibly unreduced FP48 mod Modulus
+ *
+	@param x FP48 instance, on exit reduced mod Modulus
+ */
+extern void FP48_reduce(FP48 *x);
+/**	@brief Normalises the components of an FP48
+ *
+	@param x FP48 instance to be normalised
+ */
+extern void FP48_norm(FP48 *x);
+/**	@brief Formats and outputs an FP48 to the console
+ *
+	@param x FP48 instance to be printed
+ */
+extern void FP48_output(FP48 *x);
+/**	@brief Formats and outputs an FP48 instance to an octet string
+ *
+	Serializes the components of an FP48 to big-endian base 256 form.
+	@param S output octet string
+	@param x FP48 instance to be converted to an octet string
+ */
+extern void FP48_toOctet(octet *S, FP48 *x);
+/**	@brief Creates an FP48 instance from an octet string
+ *
+	De-serializes the components of an FP48 to create an FP48 from big-endian base 256 components.
+	@param x FP48 instance to be created from an octet string
+	@param S input octet string
+
+ */
+extern void FP48_fromOctet(FP48 *x, octet *S);
+/**	@brief Calculate the trace of an FP48
+ *
+	@param t FP16 trace of x, on exit = tr(x)
+	@param x FP48 instance
+
+ */
+extern void FP48_trace(FP16 *t, FP48 *x);
+
+/**	@brief Conditional copy of FP48 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP48 instance, set to y if s!=0
+	@param y another FP48 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP48_cmove(FP48 *x, FP48 *y, int s);
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp48_BLS48581.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp48_BLS48581.h
new file mode 100644
index 0000000..c00bcd1
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp48_BLS48581.h
@@ -0,0 +1,231 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP48_BLS48581_H
+#define FP48_BLS48581_H
+
+#include "fp16_BLS48581.h"
+
+using namespace core;
+
+namespace BLS48581 {
+/**
+	@brief FP12 Structure - towered over three FP16
+*/
+
+typedef struct
+{
+    FP16 a; /**< first part of FP12 */
+    FP16 b; /**< second part of FP12 */
+    FP16 c; /**< third part of FP12 */
+    int type;
+} FP48;
+
+extern const B584_60::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B584_60::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+/* FP48 prototypes */
+/**	@brief Tests for FP48 equal to zero
+ *
+	@param x FP48 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP48_iszilch(FP48 *x);
+/**	@brief Tests for FP48 equal to unity
+ *
+	@param x FP48 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP48_isunity(FP48 *x);
+/**	@brief Copy FP48 to another FP48
+ *
+	@param x FP48 instance, on exit = y
+	@param y FP48 instance to be copied
+ */
+extern void FP48_copy(FP48 *x, FP48 *y);
+/**	@brief Set FP48 to unity
+ *
+	@param x FP48 instance to be set to one
+ */
+extern void FP48_one(FP48 *x);
+
+/**	@brief Set FP48 to zero
+ *
+	@param x FP48 instance to be set to zero
+ */
+extern void FP48_zero(FP48 *x);
+
+/**	@brief Tests for equality of two FP48s
+ *
+	@param x FP48 instance to be compared
+	@param y FP48 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP48_equals(FP48 *x, FP48 *y);
+/**	@brief Conjugation of FP48
+ *
+	If y=(a,b,c) (where a,b,c are its three FP16 components) on exit x=(conj(a),-conj(b),conj(c))
+	@param x FP48 instance, on exit = conj(y)
+	@param y FP48 instance
+ */
+extern void FP48_conj(FP48 *x, FP48 *y);
+/**	@brief Initialise FP48 from single FP16
+ *
+	Sets first FP16 component of an FP48, other components set to zero
+	@param x FP48 instance to be initialised
+	@param a FP16 to form first part of FP48
+ */
+extern void FP48_from_FP16(FP48 *x, FP16 *a);
+/**	@brief Initialise FP48 from three FP16s
+ *
+	@param x FP48 instance to be initialised
+	@param a FP16 to form first part of FP48
+	@param b FP16 to form second part of FP48
+	@param c FP16 to form third part of FP48
+ */
+extern void FP48_from_FP16s(FP48 *x, FP16 *a, FP16* b, FP16 *c);
+/**	@brief Fast Squaring of an FP48 in "unitary" form
+ *
+	@param x FP48 instance, on exit = y^2
+	@param y FP16 instance, must be unitary
+ */
+extern void FP48_usqr(FP48 *x, FP48 *y);
+/**	@brief Squaring an FP48
+ *
+	@param x FP48 instance, on exit = y^2
+	@param y FP48 instance
+ */
+extern void FP48_sqr(FP48 *x, FP48 *y);
+/**	@brief Fast multiplication of two sparse FP24s that arises from ATE pairing line functions
+ *
+	@param x FP48 instance, on exit = x*y
+	@param y FP48 instance, of special form
+ */
+extern void FP48_smul(FP48 *x, FP48 *y);
+
+/**	@brief Fast multiplication of what may be sparse multiplicands
+ *
+	@param x FP48 instance, on exit = x*y
+	@param y FP48 instance, of special form
+ */
+extern void FP48_ssmul(FP48 *x, FP48 *y);
+/**	@brief Full unconditional Multiplication of two FP24s
+ *
+	@param x FP48 instance, on exit = x*y
+	@param y FP48 instance, the multiplier
+ */
+extern void FP48_mul(FP48 *x, FP48 *y);
+/**	@brief Inverting an FP48
+ *
+	@param x FP48 instance, on exit = 1/y
+	@param y FP48 instance
+ */
+extern void FP48_inv(FP48 *x, FP48 *y);
+/**	@brief Raises an FP48 to the power of a BIG
+ *
+	@param r FP48 instance, on exit = y^b
+	@param x FP48 instance
+	@param b BIG number
+ */
+extern void FP48_pow(FP48 *r, FP48 *x, B584_60::BIG b);
+
+//extern void FP48_ppow(FP48 *r,FP48 *x,B584_60::BIG b);
+
+/**	@brief Raises an FP48 instance x to a small integer power, side-channel resistant
+ *
+	@param x FP48 instance, on exit = x^i
+	@param i small integer exponent
+	@param b maximum number of bits in exponent
+ */
+extern void FP48_pinpow(FP48 *x, int i, int b);
+
+/**	@brief Raises an FP48 instance x to a BIG power, compressed to FP16
+ *
+	@param c FP16 instance, on exit = x^(e mod r) as FP16
+	@param x FP48 input
+	@param e BIG exponent
+	@param r BIG group order
+ */
+extern void FP48_compow(FP16 *c, FP48 *x, B584_60::BIG e, B584_60::BIG r);
+
+/**	@brief Calculate Pi x[i]^b[i] for i=0 to 15, side-channel resistant
+ *
+	@param r FP48 instance, on exit = Pi x[i]^b[i] for i=0 to 15
+	@param x FP48 array with 16 FP48s
+	@param b BIG array of 16 exponents
+ */
+extern void FP48_pow16(FP48 *r, FP48 *x, B584_60::BIG *b);
+
+
+/**	@brief Raises an FP48 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP48 instance, on exit = x^p^n
+	@param f FP2 precalculated Frobenius constant
+	@param n power of p
+ */
+extern void FP48_frob(FP48 *x, FP2 *f, int n);
+
+/**	@brief Reduces all components of possibly unreduced FP48 mod Modulus
+ *
+	@param x FP48 instance, on exit reduced mod Modulus
+ */
+extern void FP48_reduce(FP48 *x);
+/**	@brief Normalises the components of an FP48
+ *
+	@param x FP48 instance to be normalised
+ */
+extern void FP48_norm(FP48 *x);
+/**	@brief Formats and outputs an FP48 to the console
+ *
+	@param x FP48 instance to be printed
+ */
+extern void FP48_output(FP48 *x);
+/**	@brief Formats and outputs an FP48 instance to an octet string
+ *
+	Serializes the components of an FP48 to big-endian base 256 form.
+	@param S output octet string
+	@param x FP48 instance to be converted to an octet string
+ */
+extern void FP48_toOctet(octet *S, FP48 *x);
+/**	@brief Creates an FP48 instance from an octet string
+ *
+	De-serializes the components of an FP48 to create an FP48 from big-endian base 256 components.
+	@param x FP48 instance to be created from an octet string
+	@param S input octet string
+
+ */
+extern void FP48_fromOctet(FP48 *x, octet *S);
+/**	@brief Calculate the trace of an FP48
+ *
+	@param t FP16 trace of x, on exit = tr(x)
+	@param x FP48 instance
+
+ */
+extern void FP48_trace(FP16 *t, FP48 *x);
+
+/**	@brief Conditional copy of FP48 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP48 instance, set to y if s!=0
+	@param y another FP48 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP48_cmove(FP48 *x, FP48 *y, int s);
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp4_BLS12381.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp4_BLS12381.h
new file mode 100644
index 0000000..2397117
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp4_BLS12381.h
@@ -0,0 +1,349 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP4_BLS12381_H
+#define FP4_BLS12381_H
+
+#include "fp2_BLS12381.h"
+#include "config_curve_BLS12381.h"
+
+using namespace core;
+
+namespace BLS12381 {
+
+/**
+	@brief FP4 Structure - towered over two FP2
+*/
+
+typedef struct
+{
+    FP2 a; /**< real part of FP4 */
+    FP2 b; /**< imaginary part of FP4 */
+} FP4;
+
+
+/* FP4 prototypes */
+/**	@brief Tests for FP4 equal to zero
+ *
+	@param x FP4 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP4_iszilch(FP4 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP4 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP4_islarger(FP4 *x);
+
+/**	@brief Serialize out FP4  
+ *
+    @param b buffer for output
+	@param x FP4 number to be serialized
+ */
+extern void FP4_toBytes(char *b,FP4 *x);
+
+/**	@brief Serialize in FP4  
+ *
+	@param x FP4 number to be serialized
+    @param b buffer for input
+ */
+extern void FP4_fromBytes(FP4 *x,char *b);
+
+/**	@brief Tests for FP4 equal to unity
+ *
+	@param x FP4 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP4_isunity(FP4 *x);
+/**	@brief Tests for equality of two FP4s
+ *
+	@param x FP4 instance to be compared
+	@param y FP4 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP4_equals(FP4 *x, FP4 *y);
+/**	@brief Tests for FP4 having only a real part and no imaginary part
+ *
+	@param x FP4 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP4_isreal(FP4 *x);
+/**	@brief Initialise FP4 from two FP2s
+ *
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+	@param b FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2s(FP4 *x, FP2 *a, FP2 *b);
+/**	@brief Initialise FP4 from single FP2
+ *
+	Imaginary part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+ */
+extern void FP4_from_FP2(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP2
+ *
+	real part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2H(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP
+ *
+	@param x FP4 instance to be initialised
+	@param a FP to form real part of FP4
+ */
+extern void FP4_from_FP(FP4 *x, FP *a);
+
+/**	@brief Copy FP4 to another FP4
+ *
+	@param x FP4 instance, on exit = y
+	@param y FP4 instance to be copied
+ */
+extern void FP4_copy(FP4 *x, FP4 *y);
+/**	@brief Set FP4 to zero
+ *
+	@param x FP4 instance to be set to zero
+ */
+extern void FP4_zero(FP4 *x);
+/**	@brief Set FP4 to unity
+ *
+	@param x FP4 instance to be set to one
+ */
+extern void FP4_one(FP4 *x);
+
+/**	@brief Sign of FP4
+ *
+	@param x FP4 instance
+	@return "sign" of FP4
+ */
+extern int FP4_sign(FP4 *x);
+
+/**	@brief Negation of FP4
+ *
+	@param x FP4 instance, on exit = -y
+	@param y FP4 instance
+ */
+extern void FP4_neg(FP4 *x, FP4 *y);
+/**	@brief Conjugation of FP4
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP4 instance, on exit = conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_conj(FP4 *x, FP4 *y);
+/**	@brief Negative conjugation of FP4
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP4 instance, on exit = -conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_nconj(FP4 *x, FP4 *y);
+/**	@brief addition of two FP4s
+ *
+	@param x FP4 instance, on exit = y+z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_add(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief subtraction of two FP4s
+ *
+	@param x FP4 instance, on exit = y-z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_sub(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Multiplication of an FP4 by an FP2
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP2 multiplier
+ */
+extern void FP4_pmul(FP4 *x, FP4 *y, FP2 *a);
+
+
+/**	@brief Multiplication of an FP4 by an FP
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP multiplier
+ */
+extern void FP4_qmul(FP4 *x, FP4 *y, FP *a);
+
+/**	@brief Multiplication of an FP4 by a small integer
+ *
+	@param x FP4 instance, on exit = y*i
+	@param y FP4 instance
+	@param i an integer
+ */
+extern void FP4_imul(FP4 *x, FP4 *y, int i);
+/**	@brief Squaring an FP4
+ *
+	@param x FP4 instance, on exit = y^2
+	@param y FP4 instance
+ */
+extern void FP4_sqr(FP4 *x, FP4 *y);
+/**	@brief Multiplication of two FP4s
+ *
+	@param x FP4 instance, on exit = y*z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_mul(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Inverting an FP4
+ *
+	@param x FP4 instance, on exit = 1/y
+	@param y FP4 instance
+    @param h optional input hint
+ */
+extern void FP4_inv(FP4 *x, FP4 *y, FP *h);
+
+/**	@brief Divide an FP4 by 2
+ *
+	@param x FP4 instance, on exit = y/2
+	@param y FP4 instance
+ */
+extern void FP4_div2(FP4 *x, FP4 *y);
+
+
+/**	@brief Formats and outputs an FP4 to the console
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_output(FP4 *x);
+/**	@brief Formats and outputs an FP4 to the console in raw form (for debugging)
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_rawoutput(FP4 *x);
+/**	@brief multiplies an FP4 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP4 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP4_times_i(FP4 *x);
+/**	@brief Normalises the components of an FP4
+ *
+	@param x FP4 instance to be normalised
+ */
+extern void FP4_norm(FP4 *x);
+/**	@brief Reduces all components of possibly unreduced FP4 mod Modulus
+ *
+	@param x FP4 instance, on exit reduced mod Modulus
+ */
+extern void FP4_reduce(FP4 *x);
+/**	@brief Raises an FP4 to the power of a BIG
+ *
+	@param x FP4 instance, on exit = y^b
+	@param y FP4 instance
+	@param b BIG number
+ */
+extern void FP4_pow(FP4 *x, FP4 *y, B384_58::BIG b);
+/**	@brief Raises an FP4 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP4 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP4_frob(FP4 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP4 instance, on exit = w*x-conj(x)*y+z
+	@param w FP4 instance
+	@param x FP4 instance
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_xtr_A(FP4 *r, FP4 *w, FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP4 instance, on exit = x^2-2*conj(x)
+	@param x FP4 instance
+ */
+extern void FP4_xtr_D(FP4 *r, FP4 *x);
+/**	@brief Calculates FP4 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP4 instance, on exit = trace(w^b)
+	@param x FP4 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP4_xtr_pow(FP4 *r, FP4 *x, B384_58::BIG b);
+/**	@brief Calculates FP4 trace of c^a.d^b, where c and d are derived from FP4 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP4 instance, on exit = trace(c^a.d^b)
+	@param c FP4 instance, trace of an FP12
+	@param d FP4 instance, trace of an FP12
+	@param e FP4 instance, trace of an FP12
+	@param f FP4 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP4_xtr_pow2(FP4 *r, FP4 *c, FP4 *d, FP4 *e, FP4 *f, B384_58::BIG a, B384_58::BIG b);
+
+/**	@brief Test FP4 for QR
+ * 
+	@param r FP4 instance
+    @param h optional generated hint
+	@return 1 x is a QR, otherwise 0
+ */
+extern int  FP4_qr(FP4 *r, FP *h);
+
+/**	@brief Calculate square root of an FP4
+ *
+	Square root
+	@param r FP4 instance, on exit = sqrt(x)
+	@param x FP4 instance
+    @param h optional input hint
+ */
+extern void  FP4_sqrt(FP4 *r, FP4 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP4 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP4 instance, set to y if s!=0
+	@param y another FP4 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP4_cmove(FP4 *x, FP4 *y, int s);
+
+
+/**	@brief Divide FP4 number by QNR
+ *
+	Divide FP4 by the QNR
+	@param x FP4 instance
+ */
+extern void FP4_div_i(FP4 *x);
+
+/**	@brief Generate random FP4
+ *
+	@param x random FP4 number
+	@param rng random number generator
+ */
+extern void FP4_rand(FP4 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp4_BLS12383.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp4_BLS12383.h
new file mode 100644
index 0000000..0a944fe
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp4_BLS12383.h
@@ -0,0 +1,349 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP4_BLS12383_H
+#define FP4_BLS12383_H
+
+#include "fp2_BLS12383.h"
+#include "config_curve_BLS12383.h"
+
+using namespace core;
+
+namespace BLS12383 {
+
+/**
+	@brief FP4 Structure - towered over two FP2
+*/
+
+typedef struct
+{
+    FP2 a; /**< real part of FP4 */
+    FP2 b; /**< imaginary part of FP4 */
+} FP4;
+
+
+/* FP4 prototypes */
+/**	@brief Tests for FP4 equal to zero
+ *
+	@param x FP4 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP4_iszilch(FP4 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP4 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP4_islarger(FP4 *x);
+
+/**	@brief Serialize out FP4  
+ *
+    @param b buffer for output
+	@param x FP4 number to be serialized
+ */
+extern void FP4_toBytes(char *b,FP4 *x);
+
+/**	@brief Serialize in FP4  
+ *
+	@param x FP4 number to be serialized
+    @param b buffer for input
+ */
+extern void FP4_fromBytes(FP4 *x,char *b);
+
+/**	@brief Tests for FP4 equal to unity
+ *
+	@param x FP4 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP4_isunity(FP4 *x);
+/**	@brief Tests for equality of two FP4s
+ *
+	@param x FP4 instance to be compared
+	@param y FP4 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP4_equals(FP4 *x, FP4 *y);
+/**	@brief Tests for FP4 having only a real part and no imaginary part
+ *
+	@param x FP4 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP4_isreal(FP4 *x);
+/**	@brief Initialise FP4 from two FP2s
+ *
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+	@param b FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2s(FP4 *x, FP2 *a, FP2 *b);
+/**	@brief Initialise FP4 from single FP2
+ *
+	Imaginary part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+ */
+extern void FP4_from_FP2(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP2
+ *
+	real part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2H(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP
+ *
+	@param x FP4 instance to be initialised
+	@param a FP to form real part of FP4
+ */
+extern void FP4_from_FP(FP4 *x, FP *a);
+
+/**	@brief Copy FP4 to another FP4
+ *
+	@param x FP4 instance, on exit = y
+	@param y FP4 instance to be copied
+ */
+extern void FP4_copy(FP4 *x, FP4 *y);
+/**	@brief Set FP4 to zero
+ *
+	@param x FP4 instance to be set to zero
+ */
+extern void FP4_zero(FP4 *x);
+/**	@brief Set FP4 to unity
+ *
+	@param x FP4 instance to be set to one
+ */
+extern void FP4_one(FP4 *x);
+
+/**	@brief Sign of FP4
+ *
+	@param x FP4 instance
+	@return "sign" of FP4
+ */
+extern int FP4_sign(FP4 *x);
+
+/**	@brief Negation of FP4
+ *
+	@param x FP4 instance, on exit = -y
+	@param y FP4 instance
+ */
+extern void FP4_neg(FP4 *x, FP4 *y);
+/**	@brief Conjugation of FP4
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP4 instance, on exit = conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_conj(FP4 *x, FP4 *y);
+/**	@brief Negative conjugation of FP4
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP4 instance, on exit = -conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_nconj(FP4 *x, FP4 *y);
+/**	@brief addition of two FP4s
+ *
+	@param x FP4 instance, on exit = y+z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_add(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief subtraction of two FP4s
+ *
+	@param x FP4 instance, on exit = y-z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_sub(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Multiplication of an FP4 by an FP2
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP2 multiplier
+ */
+extern void FP4_pmul(FP4 *x, FP4 *y, FP2 *a);
+
+
+/**	@brief Multiplication of an FP4 by an FP
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP multiplier
+ */
+extern void FP4_qmul(FP4 *x, FP4 *y, FP *a);
+
+/**	@brief Multiplication of an FP4 by a small integer
+ *
+	@param x FP4 instance, on exit = y*i
+	@param y FP4 instance
+	@param i an integer
+ */
+extern void FP4_imul(FP4 *x, FP4 *y, int i);
+/**	@brief Squaring an FP4
+ *
+	@param x FP4 instance, on exit = y^2
+	@param y FP4 instance
+ */
+extern void FP4_sqr(FP4 *x, FP4 *y);
+/**	@brief Multiplication of two FP4s
+ *
+	@param x FP4 instance, on exit = y*z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_mul(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Inverting an FP4
+ *
+	@param x FP4 instance, on exit = 1/y
+	@param y FP4 instance
+    @param h optional input hint
+ */
+extern void FP4_inv(FP4 *x, FP4 *y, FP *h);
+
+/**	@brief Divide an FP4 by 2
+ *
+	@param x FP4 instance, on exit = y/2
+	@param y FP4 instance
+ */
+extern void FP4_div2(FP4 *x, FP4 *y);
+
+
+/**	@brief Formats and outputs an FP4 to the console
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_output(FP4 *x);
+/**	@brief Formats and outputs an FP4 to the console in raw form (for debugging)
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_rawoutput(FP4 *x);
+/**	@brief multiplies an FP4 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP4 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP4_times_i(FP4 *x);
+/**	@brief Normalises the components of an FP4
+ *
+	@param x FP4 instance to be normalised
+ */
+extern void FP4_norm(FP4 *x);
+/**	@brief Reduces all components of possibly unreduced FP4 mod Modulus
+ *
+	@param x FP4 instance, on exit reduced mod Modulus
+ */
+extern void FP4_reduce(FP4 *x);
+/**	@brief Raises an FP4 to the power of a BIG
+ *
+	@param x FP4 instance, on exit = y^b
+	@param y FP4 instance
+	@param b BIG number
+ */
+extern void FP4_pow(FP4 *x, FP4 *y, B384_58::BIG b);
+/**	@brief Raises an FP4 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP4 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP4_frob(FP4 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP4 instance, on exit = w*x-conj(x)*y+z
+	@param w FP4 instance
+	@param x FP4 instance
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_xtr_A(FP4 *r, FP4 *w, FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP4 instance, on exit = x^2-2*conj(x)
+	@param x FP4 instance
+ */
+extern void FP4_xtr_D(FP4 *r, FP4 *x);
+/**	@brief Calculates FP4 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP4 instance, on exit = trace(w^b)
+	@param x FP4 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP4_xtr_pow(FP4 *r, FP4 *x, B384_58::BIG b);
+/**	@brief Calculates FP4 trace of c^a.d^b, where c and d are derived from FP4 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP4 instance, on exit = trace(c^a.d^b)
+	@param c FP4 instance, trace of an FP12
+	@param d FP4 instance, trace of an FP12
+	@param e FP4 instance, trace of an FP12
+	@param f FP4 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP4_xtr_pow2(FP4 *r, FP4 *c, FP4 *d, FP4 *e, FP4 *f, B384_58::BIG a, B384_58::BIG b);
+
+/**	@brief Test FP4 for QR
+ * 
+	@param r FP4 instance
+    @param h optional generated hint
+	@return 1 x is a QR, otherwise 0
+ */
+extern int  FP4_qr(FP4 *r, FP *h);
+
+/**	@brief Calculate square root of an FP4
+ *
+	Square root
+	@param r FP4 instance, on exit = sqrt(x)
+	@param x FP4 instance
+    @param h optional input hint
+ */
+extern void  FP4_sqrt(FP4 *r, FP4 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP4 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP4 instance, set to y if s!=0
+	@param y another FP4 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP4_cmove(FP4 *x, FP4 *y, int s);
+
+
+/**	@brief Divide FP4 number by QNR
+ *
+	Divide FP4 by the QNR
+	@param x FP4 instance
+ */
+extern void FP4_div_i(FP4 *x);
+
+/**	@brief Generate random FP4
+ *
+	@param x random FP4 number
+	@param rng random number generator
+ */
+extern void FP4_rand(FP4 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp4_BLS12443.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp4_BLS12443.h
new file mode 100644
index 0000000..51b5803
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp4_BLS12443.h
@@ -0,0 +1,349 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP4_BLS12443_H
+#define FP4_BLS12443_H
+
+#include "fp2_BLS12443.h"
+#include "config_curve_BLS12443.h"
+
+using namespace core;
+
+namespace BLS12443 {
+
+/**
+	@brief FP4 Structure - towered over two FP2
+*/
+
+typedef struct
+{
+    FP2 a; /**< real part of FP4 */
+    FP2 b; /**< imaginary part of FP4 */
+} FP4;
+
+
+/* FP4 prototypes */
+/**	@brief Tests for FP4 equal to zero
+ *
+	@param x FP4 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP4_iszilch(FP4 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP4 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP4_islarger(FP4 *x);
+
+/**	@brief Serialize out FP4  
+ *
+    @param b buffer for output
+	@param x FP4 number to be serialized
+ */
+extern void FP4_toBytes(char *b,FP4 *x);
+
+/**	@brief Serialize in FP4  
+ *
+	@param x FP4 number to be serialized
+    @param b buffer for input
+ */
+extern void FP4_fromBytes(FP4 *x,char *b);
+
+/**	@brief Tests for FP4 equal to unity
+ *
+	@param x FP4 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP4_isunity(FP4 *x);
+/**	@brief Tests for equality of two FP4s
+ *
+	@param x FP4 instance to be compared
+	@param y FP4 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP4_equals(FP4 *x, FP4 *y);
+/**	@brief Tests for FP4 having only a real part and no imaginary part
+ *
+	@param x FP4 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP4_isreal(FP4 *x);
+/**	@brief Initialise FP4 from two FP2s
+ *
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+	@param b FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2s(FP4 *x, FP2 *a, FP2 *b);
+/**	@brief Initialise FP4 from single FP2
+ *
+	Imaginary part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+ */
+extern void FP4_from_FP2(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP2
+ *
+	real part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2H(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP
+ *
+	@param x FP4 instance to be initialised
+	@param a FP to form real part of FP4
+ */
+extern void FP4_from_FP(FP4 *x, FP *a);
+
+/**	@brief Copy FP4 to another FP4
+ *
+	@param x FP4 instance, on exit = y
+	@param y FP4 instance to be copied
+ */
+extern void FP4_copy(FP4 *x, FP4 *y);
+/**	@brief Set FP4 to zero
+ *
+	@param x FP4 instance to be set to zero
+ */
+extern void FP4_zero(FP4 *x);
+/**	@brief Set FP4 to unity
+ *
+	@param x FP4 instance to be set to one
+ */
+extern void FP4_one(FP4 *x);
+
+/**	@brief Sign of FP4
+ *
+	@param x FP4 instance
+	@return "sign" of FP4
+ */
+extern int FP4_sign(FP4 *x);
+
+/**	@brief Negation of FP4
+ *
+	@param x FP4 instance, on exit = -y
+	@param y FP4 instance
+ */
+extern void FP4_neg(FP4 *x, FP4 *y);
+/**	@brief Conjugation of FP4
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP4 instance, on exit = conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_conj(FP4 *x, FP4 *y);
+/**	@brief Negative conjugation of FP4
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP4 instance, on exit = -conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_nconj(FP4 *x, FP4 *y);
+/**	@brief addition of two FP4s
+ *
+	@param x FP4 instance, on exit = y+z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_add(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief subtraction of two FP4s
+ *
+	@param x FP4 instance, on exit = y-z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_sub(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Multiplication of an FP4 by an FP2
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP2 multiplier
+ */
+extern void FP4_pmul(FP4 *x, FP4 *y, FP2 *a);
+
+
+/**	@brief Multiplication of an FP4 by an FP
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP multiplier
+ */
+extern void FP4_qmul(FP4 *x, FP4 *y, FP *a);
+
+/**	@brief Multiplication of an FP4 by a small integer
+ *
+	@param x FP4 instance, on exit = y*i
+	@param y FP4 instance
+	@param i an integer
+ */
+extern void FP4_imul(FP4 *x, FP4 *y, int i);
+/**	@brief Squaring an FP4
+ *
+	@param x FP4 instance, on exit = y^2
+	@param y FP4 instance
+ */
+extern void FP4_sqr(FP4 *x, FP4 *y);
+/**	@brief Multiplication of two FP4s
+ *
+	@param x FP4 instance, on exit = y*z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_mul(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Inverting an FP4
+ *
+	@param x FP4 instance, on exit = 1/y
+	@param y FP4 instance
+    @param h optional input hint
+ */
+extern void FP4_inv(FP4 *x, FP4 *y, FP *h);
+
+/**	@brief Divide an FP4 by 2
+ *
+	@param x FP4 instance, on exit = y/2
+	@param y FP4 instance
+ */
+extern void FP4_div2(FP4 *x, FP4 *y);
+
+
+/**	@brief Formats and outputs an FP4 to the console
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_output(FP4 *x);
+/**	@brief Formats and outputs an FP4 to the console in raw form (for debugging)
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_rawoutput(FP4 *x);
+/**	@brief multiplies an FP4 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP4 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP4_times_i(FP4 *x);
+/**	@brief Normalises the components of an FP4
+ *
+	@param x FP4 instance to be normalised
+ */
+extern void FP4_norm(FP4 *x);
+/**	@brief Reduces all components of possibly unreduced FP4 mod Modulus
+ *
+	@param x FP4 instance, on exit reduced mod Modulus
+ */
+extern void FP4_reduce(FP4 *x);
+/**	@brief Raises an FP4 to the power of a BIG
+ *
+	@param x FP4 instance, on exit = y^b
+	@param y FP4 instance
+	@param b BIG number
+ */
+extern void FP4_pow(FP4 *x, FP4 *y, B448_60::BIG b);
+/**	@brief Raises an FP4 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP4 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP4_frob(FP4 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP4 instance, on exit = w*x-conj(x)*y+z
+	@param w FP4 instance
+	@param x FP4 instance
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_xtr_A(FP4 *r, FP4 *w, FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP4 instance, on exit = x^2-2*conj(x)
+	@param x FP4 instance
+ */
+extern void FP4_xtr_D(FP4 *r, FP4 *x);
+/**	@brief Calculates FP4 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP4 instance, on exit = trace(w^b)
+	@param x FP4 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP4_xtr_pow(FP4 *r, FP4 *x, B448_60::BIG b);
+/**	@brief Calculates FP4 trace of c^a.d^b, where c and d are derived from FP4 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP4 instance, on exit = trace(c^a.d^b)
+	@param c FP4 instance, trace of an FP12
+	@param d FP4 instance, trace of an FP12
+	@param e FP4 instance, trace of an FP12
+	@param f FP4 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP4_xtr_pow2(FP4 *r, FP4 *c, FP4 *d, FP4 *e, FP4 *f, B448_60::BIG a, B448_60::BIG b);
+
+/**	@brief Test FP4 for QR
+ * 
+	@param r FP4 instance
+    @param h optional generated hint
+	@return 1 x is a QR, otherwise 0
+ */
+extern int  FP4_qr(FP4 *r, FP *h);
+
+/**	@brief Calculate square root of an FP4
+ *
+	Square root
+	@param r FP4 instance, on exit = sqrt(x)
+	@param x FP4 instance
+    @param h optional input hint
+ */
+extern void  FP4_sqrt(FP4 *r, FP4 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP4 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP4 instance, set to y if s!=0
+	@param y another FP4 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP4_cmove(FP4 *x, FP4 *y, int s);
+
+
+/**	@brief Divide FP4 number by QNR
+ *
+	Divide FP4 by the QNR
+	@param x FP4 instance
+ */
+extern void FP4_div_i(FP4 *x);
+
+/**	@brief Generate random FP4
+ *
+	@param x random FP4 number
+	@param rng random number generator
+ */
+extern void FP4_rand(FP4 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp4_BLS12461.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp4_BLS12461.h
new file mode 100644
index 0000000..68244fc
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp4_BLS12461.h
@@ -0,0 +1,349 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP4_BLS12461_H
+#define FP4_BLS12461_H
+
+#include "fp2_BLS12461.h"
+#include "config_curve_BLS12461.h"
+
+using namespace core;
+
+namespace BLS12461 {
+
+/**
+	@brief FP4 Structure - towered over two FP2
+*/
+
+typedef struct
+{
+    FP2 a; /**< real part of FP4 */
+    FP2 b; /**< imaginary part of FP4 */
+} FP4;
+
+
+/* FP4 prototypes */
+/**	@brief Tests for FP4 equal to zero
+ *
+	@param x FP4 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP4_iszilch(FP4 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP4 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP4_islarger(FP4 *x);
+
+/**	@brief Serialize out FP4  
+ *
+    @param b buffer for output
+	@param x FP4 number to be serialized
+ */
+extern void FP4_toBytes(char *b,FP4 *x);
+
+/**	@brief Serialize in FP4  
+ *
+	@param x FP4 number to be serialized
+    @param b buffer for input
+ */
+extern void FP4_fromBytes(FP4 *x,char *b);
+
+/**	@brief Tests for FP4 equal to unity
+ *
+	@param x FP4 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP4_isunity(FP4 *x);
+/**	@brief Tests for equality of two FP4s
+ *
+	@param x FP4 instance to be compared
+	@param y FP4 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP4_equals(FP4 *x, FP4 *y);
+/**	@brief Tests for FP4 having only a real part and no imaginary part
+ *
+	@param x FP4 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP4_isreal(FP4 *x);
+/**	@brief Initialise FP4 from two FP2s
+ *
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+	@param b FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2s(FP4 *x, FP2 *a, FP2 *b);
+/**	@brief Initialise FP4 from single FP2
+ *
+	Imaginary part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+ */
+extern void FP4_from_FP2(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP2
+ *
+	real part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2H(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP
+ *
+	@param x FP4 instance to be initialised
+	@param a FP to form real part of FP4
+ */
+extern void FP4_from_FP(FP4 *x, FP *a);
+
+/**	@brief Copy FP4 to another FP4
+ *
+	@param x FP4 instance, on exit = y
+	@param y FP4 instance to be copied
+ */
+extern void FP4_copy(FP4 *x, FP4 *y);
+/**	@brief Set FP4 to zero
+ *
+	@param x FP4 instance to be set to zero
+ */
+extern void FP4_zero(FP4 *x);
+/**	@brief Set FP4 to unity
+ *
+	@param x FP4 instance to be set to one
+ */
+extern void FP4_one(FP4 *x);
+
+/**	@brief Sign of FP4
+ *
+	@param x FP4 instance
+	@return "sign" of FP4
+ */
+extern int FP4_sign(FP4 *x);
+
+/**	@brief Negation of FP4
+ *
+	@param x FP4 instance, on exit = -y
+	@param y FP4 instance
+ */
+extern void FP4_neg(FP4 *x, FP4 *y);
+/**	@brief Conjugation of FP4
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP4 instance, on exit = conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_conj(FP4 *x, FP4 *y);
+/**	@brief Negative conjugation of FP4
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP4 instance, on exit = -conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_nconj(FP4 *x, FP4 *y);
+/**	@brief addition of two FP4s
+ *
+	@param x FP4 instance, on exit = y+z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_add(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief subtraction of two FP4s
+ *
+	@param x FP4 instance, on exit = y-z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_sub(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Multiplication of an FP4 by an FP2
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP2 multiplier
+ */
+extern void FP4_pmul(FP4 *x, FP4 *y, FP2 *a);
+
+
+/**	@brief Multiplication of an FP4 by an FP
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP multiplier
+ */
+extern void FP4_qmul(FP4 *x, FP4 *y, FP *a);
+
+/**	@brief Multiplication of an FP4 by a small integer
+ *
+	@param x FP4 instance, on exit = y*i
+	@param y FP4 instance
+	@param i an integer
+ */
+extern void FP4_imul(FP4 *x, FP4 *y, int i);
+/**	@brief Squaring an FP4
+ *
+	@param x FP4 instance, on exit = y^2
+	@param y FP4 instance
+ */
+extern void FP4_sqr(FP4 *x, FP4 *y);
+/**	@brief Multiplication of two FP4s
+ *
+	@param x FP4 instance, on exit = y*z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_mul(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Inverting an FP4
+ *
+	@param x FP4 instance, on exit = 1/y
+	@param y FP4 instance
+    @param h optional input hint
+ */
+extern void FP4_inv(FP4 *x, FP4 *y, FP *h);
+
+/**	@brief Divide an FP4 by 2
+ *
+	@param x FP4 instance, on exit = y/2
+	@param y FP4 instance
+ */
+extern void FP4_div2(FP4 *x, FP4 *y);
+
+
+/**	@brief Formats and outputs an FP4 to the console
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_output(FP4 *x);
+/**	@brief Formats and outputs an FP4 to the console in raw form (for debugging)
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_rawoutput(FP4 *x);
+/**	@brief multiplies an FP4 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP4 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP4_times_i(FP4 *x);
+/**	@brief Normalises the components of an FP4
+ *
+	@param x FP4 instance to be normalised
+ */
+extern void FP4_norm(FP4 *x);
+/**	@brief Reduces all components of possibly unreduced FP4 mod Modulus
+ *
+	@param x FP4 instance, on exit reduced mod Modulus
+ */
+extern void FP4_reduce(FP4 *x);
+/**	@brief Raises an FP4 to the power of a BIG
+ *
+	@param x FP4 instance, on exit = y^b
+	@param y FP4 instance
+	@param b BIG number
+ */
+extern void FP4_pow(FP4 *x, FP4 *y, B464_60::BIG b);
+/**	@brief Raises an FP4 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP4 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP4_frob(FP4 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP4 instance, on exit = w*x-conj(x)*y+z
+	@param w FP4 instance
+	@param x FP4 instance
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_xtr_A(FP4 *r, FP4 *w, FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP4 instance, on exit = x^2-2*conj(x)
+	@param x FP4 instance
+ */
+extern void FP4_xtr_D(FP4 *r, FP4 *x);
+/**	@brief Calculates FP4 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP4 instance, on exit = trace(w^b)
+	@param x FP4 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP4_xtr_pow(FP4 *r, FP4 *x, B464_60::BIG b);
+/**	@brief Calculates FP4 trace of c^a.d^b, where c and d are derived from FP4 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP4 instance, on exit = trace(c^a.d^b)
+	@param c FP4 instance, trace of an FP12
+	@param d FP4 instance, trace of an FP12
+	@param e FP4 instance, trace of an FP12
+	@param f FP4 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP4_xtr_pow2(FP4 *r, FP4 *c, FP4 *d, FP4 *e, FP4 *f, B464_60::BIG a, B464_60::BIG b);
+
+/**	@brief Test FP4 for QR
+ * 
+	@param r FP4 instance
+    @param h optional generated hint
+	@return 1 x is a QR, otherwise 0
+ */
+extern int  FP4_qr(FP4 *r, FP *h);
+
+/**	@brief Calculate square root of an FP4
+ *
+	Square root
+	@param r FP4 instance, on exit = sqrt(x)
+	@param x FP4 instance
+    @param h optional input hint
+ */
+extern void  FP4_sqrt(FP4 *r, FP4 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP4 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP4 instance, set to y if s!=0
+	@param y another FP4 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP4_cmove(FP4 *x, FP4 *y, int s);
+
+
+/**	@brief Divide FP4 number by QNR
+ *
+	Divide FP4 by the QNR
+	@param x FP4 instance
+ */
+extern void FP4_div_i(FP4 *x);
+
+/**	@brief Generate random FP4
+ *
+	@param x random FP4 number
+	@param rng random number generator
+ */
+extern void FP4_rand(FP4 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp4_BLS24479.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp4_BLS24479.h
new file mode 100644
index 0000000..eb8af81
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp4_BLS24479.h
@@ -0,0 +1,349 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP4_BLS24479_H
+#define FP4_BLS24479_H
+
+#include "fp2_BLS24479.h"
+#include "config_curve_BLS24479.h"
+
+using namespace core;
+
+namespace BLS24479 {
+
+/**
+	@brief FP4 Structure - towered over two FP2
+*/
+
+typedef struct
+{
+    FP2 a; /**< real part of FP4 */
+    FP2 b; /**< imaginary part of FP4 */
+} FP4;
+
+
+/* FP4 prototypes */
+/**	@brief Tests for FP4 equal to zero
+ *
+	@param x FP4 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP4_iszilch(FP4 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP4 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP4_islarger(FP4 *x);
+
+/**	@brief Serialize out FP4  
+ *
+    @param b buffer for output
+	@param x FP4 number to be serialized
+ */
+extern void FP4_toBytes(char *b,FP4 *x);
+
+/**	@brief Serialize in FP4  
+ *
+	@param x FP4 number to be serialized
+    @param b buffer for input
+ */
+extern void FP4_fromBytes(FP4 *x,char *b);
+
+/**	@brief Tests for FP4 equal to unity
+ *
+	@param x FP4 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP4_isunity(FP4 *x);
+/**	@brief Tests for equality of two FP4s
+ *
+	@param x FP4 instance to be compared
+	@param y FP4 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP4_equals(FP4 *x, FP4 *y);
+/**	@brief Tests for FP4 having only a real part and no imaginary part
+ *
+	@param x FP4 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP4_isreal(FP4 *x);
+/**	@brief Initialise FP4 from two FP2s
+ *
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+	@param b FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2s(FP4 *x, FP2 *a, FP2 *b);
+/**	@brief Initialise FP4 from single FP2
+ *
+	Imaginary part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+ */
+extern void FP4_from_FP2(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP2
+ *
+	real part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2H(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP
+ *
+	@param x FP4 instance to be initialised
+	@param a FP to form real part of FP4
+ */
+extern void FP4_from_FP(FP4 *x, FP *a);
+
+/**	@brief Copy FP4 to another FP4
+ *
+	@param x FP4 instance, on exit = y
+	@param y FP4 instance to be copied
+ */
+extern void FP4_copy(FP4 *x, FP4 *y);
+/**	@brief Set FP4 to zero
+ *
+	@param x FP4 instance to be set to zero
+ */
+extern void FP4_zero(FP4 *x);
+/**	@brief Set FP4 to unity
+ *
+	@param x FP4 instance to be set to one
+ */
+extern void FP4_one(FP4 *x);
+
+/**	@brief Sign of FP4
+ *
+	@param x FP4 instance
+	@return "sign" of FP4
+ */
+extern int FP4_sign(FP4 *x);
+
+/**	@brief Negation of FP4
+ *
+	@param x FP4 instance, on exit = -y
+	@param y FP4 instance
+ */
+extern void FP4_neg(FP4 *x, FP4 *y);
+/**	@brief Conjugation of FP4
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP4 instance, on exit = conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_conj(FP4 *x, FP4 *y);
+/**	@brief Negative conjugation of FP4
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP4 instance, on exit = -conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_nconj(FP4 *x, FP4 *y);
+/**	@brief addition of two FP4s
+ *
+	@param x FP4 instance, on exit = y+z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_add(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief subtraction of two FP4s
+ *
+	@param x FP4 instance, on exit = y-z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_sub(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Multiplication of an FP4 by an FP2
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP2 multiplier
+ */
+extern void FP4_pmul(FP4 *x, FP4 *y, FP2 *a);
+
+
+/**	@brief Multiplication of an FP4 by an FP
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP multiplier
+ */
+extern void FP4_qmul(FP4 *x, FP4 *y, FP *a);
+
+/**	@brief Multiplication of an FP4 by a small integer
+ *
+	@param x FP4 instance, on exit = y*i
+	@param y FP4 instance
+	@param i an integer
+ */
+extern void FP4_imul(FP4 *x, FP4 *y, int i);
+/**	@brief Squaring an FP4
+ *
+	@param x FP4 instance, on exit = y^2
+	@param y FP4 instance
+ */
+extern void FP4_sqr(FP4 *x, FP4 *y);
+/**	@brief Multiplication of two FP4s
+ *
+	@param x FP4 instance, on exit = y*z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_mul(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Inverting an FP4
+ *
+	@param x FP4 instance, on exit = 1/y
+	@param y FP4 instance
+    @param h optional input hint
+ */
+extern void FP4_inv(FP4 *x, FP4 *y, FP *h);
+
+/**	@brief Divide an FP4 by 2
+ *
+	@param x FP4 instance, on exit = y/2
+	@param y FP4 instance
+ */
+extern void FP4_div2(FP4 *x, FP4 *y);
+
+
+/**	@brief Formats and outputs an FP4 to the console
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_output(FP4 *x);
+/**	@brief Formats and outputs an FP4 to the console in raw form (for debugging)
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_rawoutput(FP4 *x);
+/**	@brief multiplies an FP4 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP4 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP4_times_i(FP4 *x);
+/**	@brief Normalises the components of an FP4
+ *
+	@param x FP4 instance to be normalised
+ */
+extern void FP4_norm(FP4 *x);
+/**	@brief Reduces all components of possibly unreduced FP4 mod Modulus
+ *
+	@param x FP4 instance, on exit reduced mod Modulus
+ */
+extern void FP4_reduce(FP4 *x);
+/**	@brief Raises an FP4 to the power of a BIG
+ *
+	@param x FP4 instance, on exit = y^b
+	@param y FP4 instance
+	@param b BIG number
+ */
+extern void FP4_pow(FP4 *x, FP4 *y, B480_56::BIG b);
+/**	@brief Raises an FP4 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP4 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP4_frob(FP4 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP4 instance, on exit = w*x-conj(x)*y+z
+	@param w FP4 instance
+	@param x FP4 instance
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_xtr_A(FP4 *r, FP4 *w, FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP4 instance, on exit = x^2-2*conj(x)
+	@param x FP4 instance
+ */
+extern void FP4_xtr_D(FP4 *r, FP4 *x);
+/**	@brief Calculates FP4 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP4 instance, on exit = trace(w^b)
+	@param x FP4 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP4_xtr_pow(FP4 *r, FP4 *x, B480_56::BIG b);
+/**	@brief Calculates FP4 trace of c^a.d^b, where c and d are derived from FP4 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP4 instance, on exit = trace(c^a.d^b)
+	@param c FP4 instance, trace of an FP12
+	@param d FP4 instance, trace of an FP12
+	@param e FP4 instance, trace of an FP12
+	@param f FP4 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP4_xtr_pow2(FP4 *r, FP4 *c, FP4 *d, FP4 *e, FP4 *f, B480_56::BIG a, B480_56::BIG b);
+
+/**	@brief Test FP4 for QR
+ * 
+	@param r FP4 instance
+    @param h optional generated hint
+	@return 1 x is a QR, otherwise 0
+ */
+extern int  FP4_qr(FP4 *r, FP *h);
+
+/**	@brief Calculate square root of an FP4
+ *
+	Square root
+	@param r FP4 instance, on exit = sqrt(x)
+	@param x FP4 instance
+    @param h optional input hint
+ */
+extern void  FP4_sqrt(FP4 *r, FP4 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP4 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP4 instance, set to y if s!=0
+	@param y another FP4 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP4_cmove(FP4 *x, FP4 *y, int s);
+
+
+/**	@brief Divide FP4 number by QNR
+ *
+	Divide FP4 by the QNR
+	@param x FP4 instance
+ */
+extern void FP4_div_i(FP4 *x);
+
+/**	@brief Generate random FP4
+ *
+	@param x random FP4 number
+	@param rng random number generator
+ */
+extern void FP4_rand(FP4 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp4_BLS48286.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp4_BLS48286.h
new file mode 100644
index 0000000..bd2be86
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp4_BLS48286.h
@@ -0,0 +1,349 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP4_BLS48286_H
+#define FP4_BLS48286_H
+
+#include "fp2_BLS48286.h"
+#include "config_curve_BLS48286.h"
+
+using namespace core;
+
+namespace BLS48286 {
+
+/**
+	@brief FP4 Structure - towered over two FP2
+*/
+
+typedef struct
+{
+    FP2 a; /**< real part of FP4 */
+    FP2 b; /**< imaginary part of FP4 */
+} FP4;
+
+
+/* FP4 prototypes */
+/**	@brief Tests for FP4 equal to zero
+ *
+	@param x FP4 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP4_iszilch(FP4 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP4 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP4_islarger(FP4 *x);
+
+/**	@brief Serialize out FP4  
+ *
+    @param b buffer for output
+	@param x FP4 number to be serialized
+ */
+extern void FP4_toBytes(char *b,FP4 *x);
+
+/**	@brief Serialize in FP4  
+ *
+	@param x FP4 number to be serialized
+    @param b buffer for input
+ */
+extern void FP4_fromBytes(FP4 *x,char *b);
+
+/**	@brief Tests for FP4 equal to unity
+ *
+	@param x FP4 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP4_isunity(FP4 *x);
+/**	@brief Tests for equality of two FP4s
+ *
+	@param x FP4 instance to be compared
+	@param y FP4 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP4_equals(FP4 *x, FP4 *y);
+/**	@brief Tests for FP4 having only a real part and no imaginary part
+ *
+	@param x FP4 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP4_isreal(FP4 *x);
+/**	@brief Initialise FP4 from two FP2s
+ *
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+	@param b FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2s(FP4 *x, FP2 *a, FP2 *b);
+/**	@brief Initialise FP4 from single FP2
+ *
+	Imaginary part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+ */
+extern void FP4_from_FP2(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP2
+ *
+	real part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2H(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP
+ *
+	@param x FP4 instance to be initialised
+	@param a FP to form real part of FP4
+ */
+extern void FP4_from_FP(FP4 *x, FP *a);
+
+/**	@brief Copy FP4 to another FP4
+ *
+	@param x FP4 instance, on exit = y
+	@param y FP4 instance to be copied
+ */
+extern void FP4_copy(FP4 *x, FP4 *y);
+/**	@brief Set FP4 to zero
+ *
+	@param x FP4 instance to be set to zero
+ */
+extern void FP4_zero(FP4 *x);
+/**	@brief Set FP4 to unity
+ *
+	@param x FP4 instance to be set to one
+ */
+extern void FP4_one(FP4 *x);
+
+/**	@brief Sign of FP4
+ *
+	@param x FP4 instance
+	@return "sign" of FP4
+ */
+extern int FP4_sign(FP4 *x);
+
+/**	@brief Negation of FP4
+ *
+	@param x FP4 instance, on exit = -y
+	@param y FP4 instance
+ */
+extern void FP4_neg(FP4 *x, FP4 *y);
+/**	@brief Conjugation of FP4
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP4 instance, on exit = conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_conj(FP4 *x, FP4 *y);
+/**	@brief Negative conjugation of FP4
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP4 instance, on exit = -conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_nconj(FP4 *x, FP4 *y);
+/**	@brief addition of two FP4s
+ *
+	@param x FP4 instance, on exit = y+z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_add(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief subtraction of two FP4s
+ *
+	@param x FP4 instance, on exit = y-z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_sub(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Multiplication of an FP4 by an FP2
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP2 multiplier
+ */
+extern void FP4_pmul(FP4 *x, FP4 *y, FP2 *a);
+
+
+/**	@brief Multiplication of an FP4 by an FP
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP multiplier
+ */
+extern void FP4_qmul(FP4 *x, FP4 *y, FP *a);
+
+/**	@brief Multiplication of an FP4 by a small integer
+ *
+	@param x FP4 instance, on exit = y*i
+	@param y FP4 instance
+	@param i an integer
+ */
+extern void FP4_imul(FP4 *x, FP4 *y, int i);
+/**	@brief Squaring an FP4
+ *
+	@param x FP4 instance, on exit = y^2
+	@param y FP4 instance
+ */
+extern void FP4_sqr(FP4 *x, FP4 *y);
+/**	@brief Multiplication of two FP4s
+ *
+	@param x FP4 instance, on exit = y*z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_mul(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Inverting an FP4
+ *
+	@param x FP4 instance, on exit = 1/y
+	@param y FP4 instance
+    @param h optional input hint
+ */
+extern void FP4_inv(FP4 *x, FP4 *y, FP *h);
+
+/**	@brief Divide an FP4 by 2
+ *
+	@param x FP4 instance, on exit = y/2
+	@param y FP4 instance
+ */
+extern void FP4_div2(FP4 *x, FP4 *y);
+
+
+/**	@brief Formats and outputs an FP4 to the console
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_output(FP4 *x);
+/**	@brief Formats and outputs an FP4 to the console in raw form (for debugging)
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_rawoutput(FP4 *x);
+/**	@brief multiplies an FP4 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP4 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP4_times_i(FP4 *x);
+/**	@brief Normalises the components of an FP4
+ *
+	@param x FP4 instance to be normalised
+ */
+extern void FP4_norm(FP4 *x);
+/**	@brief Reduces all components of possibly unreduced FP4 mod Modulus
+ *
+	@param x FP4 instance, on exit reduced mod Modulus
+ */
+extern void FP4_reduce(FP4 *x);
+/**	@brief Raises an FP4 to the power of a BIG
+ *
+	@param x FP4 instance, on exit = y^b
+	@param y FP4 instance
+	@param b BIG number
+ */
+extern void FP4_pow(FP4 *x, FP4 *y, B288_60::BIG b);
+/**	@brief Raises an FP4 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP4 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP4_frob(FP4 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP4 instance, on exit = w*x-conj(x)*y+z
+	@param w FP4 instance
+	@param x FP4 instance
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_xtr_A(FP4 *r, FP4 *w, FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP4 instance, on exit = x^2-2*conj(x)
+	@param x FP4 instance
+ */
+extern void FP4_xtr_D(FP4 *r, FP4 *x);
+/**	@brief Calculates FP4 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP4 instance, on exit = trace(w^b)
+	@param x FP4 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP4_xtr_pow(FP4 *r, FP4 *x, B288_60::BIG b);
+/**	@brief Calculates FP4 trace of c^a.d^b, where c and d are derived from FP4 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP4 instance, on exit = trace(c^a.d^b)
+	@param c FP4 instance, trace of an FP12
+	@param d FP4 instance, trace of an FP12
+	@param e FP4 instance, trace of an FP12
+	@param f FP4 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP4_xtr_pow2(FP4 *r, FP4 *c, FP4 *d, FP4 *e, FP4 *f, B288_60::BIG a, B288_60::BIG b);
+
+/**	@brief Test FP4 for QR
+ * 
+	@param r FP4 instance
+    @param h optional generated hint
+	@return 1 x is a QR, otherwise 0
+ */
+extern int  FP4_qr(FP4 *r, FP *h);
+
+/**	@brief Calculate square root of an FP4
+ *
+	Square root
+	@param r FP4 instance, on exit = sqrt(x)
+	@param x FP4 instance
+    @param h optional input hint
+ */
+extern void  FP4_sqrt(FP4 *r, FP4 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP4 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP4 instance, set to y if s!=0
+	@param y another FP4 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP4_cmove(FP4 *x, FP4 *y, int s);
+
+
+/**	@brief Divide FP4 number by QNR
+ *
+	Divide FP4 by the QNR
+	@param x FP4 instance
+ */
+extern void FP4_div_i(FP4 *x);
+
+/**	@brief Generate random FP4
+ *
+	@param x random FP4 number
+	@param rng random number generator
+ */
+extern void FP4_rand(FP4 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp4_BLS48556.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp4_BLS48556.h
new file mode 100644
index 0000000..673d738
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp4_BLS48556.h
@@ -0,0 +1,349 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP4_BLS48556_H
+#define FP4_BLS48556_H
+
+#include "fp2_BLS48556.h"
+#include "config_curve_BLS48556.h"
+
+using namespace core;
+
+namespace BLS48556 {
+
+/**
+	@brief FP4 Structure - towered over two FP2
+*/
+
+typedef struct
+{
+    FP2 a; /**< real part of FP4 */
+    FP2 b; /**< imaginary part of FP4 */
+} FP4;
+
+
+/* FP4 prototypes */
+/**	@brief Tests for FP4 equal to zero
+ *
+	@param x FP4 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP4_iszilch(FP4 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP4 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP4_islarger(FP4 *x);
+
+/**	@brief Serialize out FP4  
+ *
+    @param b buffer for output
+	@param x FP4 number to be serialized
+ */
+extern void FP4_toBytes(char *b,FP4 *x);
+
+/**	@brief Serialize in FP4  
+ *
+	@param x FP4 number to be serialized
+    @param b buffer for input
+ */
+extern void FP4_fromBytes(FP4 *x,char *b);
+
+/**	@brief Tests for FP4 equal to unity
+ *
+	@param x FP4 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP4_isunity(FP4 *x);
+/**	@brief Tests for equality of two FP4s
+ *
+	@param x FP4 instance to be compared
+	@param y FP4 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP4_equals(FP4 *x, FP4 *y);
+/**	@brief Tests for FP4 having only a real part and no imaginary part
+ *
+	@param x FP4 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP4_isreal(FP4 *x);
+/**	@brief Initialise FP4 from two FP2s
+ *
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+	@param b FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2s(FP4 *x, FP2 *a, FP2 *b);
+/**	@brief Initialise FP4 from single FP2
+ *
+	Imaginary part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+ */
+extern void FP4_from_FP2(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP2
+ *
+	real part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2H(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP
+ *
+	@param x FP4 instance to be initialised
+	@param a FP to form real part of FP4
+ */
+extern void FP4_from_FP(FP4 *x, FP *a);
+
+/**	@brief Copy FP4 to another FP4
+ *
+	@param x FP4 instance, on exit = y
+	@param y FP4 instance to be copied
+ */
+extern void FP4_copy(FP4 *x, FP4 *y);
+/**	@brief Set FP4 to zero
+ *
+	@param x FP4 instance to be set to zero
+ */
+extern void FP4_zero(FP4 *x);
+/**	@brief Set FP4 to unity
+ *
+	@param x FP4 instance to be set to one
+ */
+extern void FP4_one(FP4 *x);
+
+/**	@brief Sign of FP4
+ *
+	@param x FP4 instance
+	@return "sign" of FP4
+ */
+extern int FP4_sign(FP4 *x);
+
+/**	@brief Negation of FP4
+ *
+	@param x FP4 instance, on exit = -y
+	@param y FP4 instance
+ */
+extern void FP4_neg(FP4 *x, FP4 *y);
+/**	@brief Conjugation of FP4
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP4 instance, on exit = conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_conj(FP4 *x, FP4 *y);
+/**	@brief Negative conjugation of FP4
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP4 instance, on exit = -conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_nconj(FP4 *x, FP4 *y);
+/**	@brief addition of two FP4s
+ *
+	@param x FP4 instance, on exit = y+z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_add(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief subtraction of two FP4s
+ *
+	@param x FP4 instance, on exit = y-z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_sub(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Multiplication of an FP4 by an FP2
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP2 multiplier
+ */
+extern void FP4_pmul(FP4 *x, FP4 *y, FP2 *a);
+
+
+/**	@brief Multiplication of an FP4 by an FP
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP multiplier
+ */
+extern void FP4_qmul(FP4 *x, FP4 *y, FP *a);
+
+/**	@brief Multiplication of an FP4 by a small integer
+ *
+	@param x FP4 instance, on exit = y*i
+	@param y FP4 instance
+	@param i an integer
+ */
+extern void FP4_imul(FP4 *x, FP4 *y, int i);
+/**	@brief Squaring an FP4
+ *
+	@param x FP4 instance, on exit = y^2
+	@param y FP4 instance
+ */
+extern void FP4_sqr(FP4 *x, FP4 *y);
+/**	@brief Multiplication of two FP4s
+ *
+	@param x FP4 instance, on exit = y*z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_mul(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Inverting an FP4
+ *
+	@param x FP4 instance, on exit = 1/y
+	@param y FP4 instance
+    @param h optional input hint
+ */
+extern void FP4_inv(FP4 *x, FP4 *y, FP *h);
+
+/**	@brief Divide an FP4 by 2
+ *
+	@param x FP4 instance, on exit = y/2
+	@param y FP4 instance
+ */
+extern void FP4_div2(FP4 *x, FP4 *y);
+
+
+/**	@brief Formats and outputs an FP4 to the console
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_output(FP4 *x);
+/**	@brief Formats and outputs an FP4 to the console in raw form (for debugging)
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_rawoutput(FP4 *x);
+/**	@brief multiplies an FP4 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP4 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP4_times_i(FP4 *x);
+/**	@brief Normalises the components of an FP4
+ *
+	@param x FP4 instance to be normalised
+ */
+extern void FP4_norm(FP4 *x);
+/**	@brief Reduces all components of possibly unreduced FP4 mod Modulus
+ *
+	@param x FP4 instance, on exit reduced mod Modulus
+ */
+extern void FP4_reduce(FP4 *x);
+/**	@brief Raises an FP4 to the power of a BIG
+ *
+	@param x FP4 instance, on exit = y^b
+	@param y FP4 instance
+	@param b BIG number
+ */
+extern void FP4_pow(FP4 *x, FP4 *y, B560_58::BIG b);
+/**	@brief Raises an FP4 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP4 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP4_frob(FP4 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP4 instance, on exit = w*x-conj(x)*y+z
+	@param w FP4 instance
+	@param x FP4 instance
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_xtr_A(FP4 *r, FP4 *w, FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP4 instance, on exit = x^2-2*conj(x)
+	@param x FP4 instance
+ */
+extern void FP4_xtr_D(FP4 *r, FP4 *x);
+/**	@brief Calculates FP4 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP4 instance, on exit = trace(w^b)
+	@param x FP4 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP4_xtr_pow(FP4 *r, FP4 *x, B560_58::BIG b);
+/**	@brief Calculates FP4 trace of c^a.d^b, where c and d are derived from FP4 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP4 instance, on exit = trace(c^a.d^b)
+	@param c FP4 instance, trace of an FP12
+	@param d FP4 instance, trace of an FP12
+	@param e FP4 instance, trace of an FP12
+	@param f FP4 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP4_xtr_pow2(FP4 *r, FP4 *c, FP4 *d, FP4 *e, FP4 *f, B560_58::BIG a, B560_58::BIG b);
+
+/**	@brief Test FP4 for QR
+ * 
+	@param r FP4 instance
+    @param h optional generated hint
+	@return 1 x is a QR, otherwise 0
+ */
+extern int  FP4_qr(FP4 *r, FP *h);
+
+/**	@brief Calculate square root of an FP4
+ *
+	Square root
+	@param r FP4 instance, on exit = sqrt(x)
+	@param x FP4 instance
+    @param h optional input hint
+ */
+extern void  FP4_sqrt(FP4 *r, FP4 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP4 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP4 instance, set to y if s!=0
+	@param y another FP4 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP4_cmove(FP4 *x, FP4 *y, int s);
+
+
+/**	@brief Divide FP4 number by QNR
+ *
+	Divide FP4 by the QNR
+	@param x FP4 instance
+ */
+extern void FP4_div_i(FP4 *x);
+
+/**	@brief Generate random FP4
+ *
+	@param x random FP4 number
+	@param rng random number generator
+ */
+extern void FP4_rand(FP4 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp4_BLS48581.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp4_BLS48581.h
new file mode 100644
index 0000000..775f4b5
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp4_BLS48581.h
@@ -0,0 +1,349 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP4_BLS48581_H
+#define FP4_BLS48581_H
+
+#include "fp2_BLS48581.h"
+#include "config_curve_BLS48581.h"
+
+using namespace core;
+
+namespace BLS48581 {
+
+/**
+	@brief FP4 Structure - towered over two FP2
+*/
+
+typedef struct
+{
+    FP2 a; /**< real part of FP4 */
+    FP2 b; /**< imaginary part of FP4 */
+} FP4;
+
+
+/* FP4 prototypes */
+/**	@brief Tests for FP4 equal to zero
+ *
+	@param x FP4 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP4_iszilch(FP4 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP4 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP4_islarger(FP4 *x);
+
+/**	@brief Serialize out FP4  
+ *
+    @param b buffer for output
+	@param x FP4 number to be serialized
+ */
+extern void FP4_toBytes(char *b,FP4 *x);
+
+/**	@brief Serialize in FP4  
+ *
+	@param x FP4 number to be serialized
+    @param b buffer for input
+ */
+extern void FP4_fromBytes(FP4 *x,char *b);
+
+/**	@brief Tests for FP4 equal to unity
+ *
+	@param x FP4 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP4_isunity(FP4 *x);
+/**	@brief Tests for equality of two FP4s
+ *
+	@param x FP4 instance to be compared
+	@param y FP4 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP4_equals(FP4 *x, FP4 *y);
+/**	@brief Tests for FP4 having only a real part and no imaginary part
+ *
+	@param x FP4 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP4_isreal(FP4 *x);
+/**	@brief Initialise FP4 from two FP2s
+ *
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+	@param b FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2s(FP4 *x, FP2 *a, FP2 *b);
+/**	@brief Initialise FP4 from single FP2
+ *
+	Imaginary part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+ */
+extern void FP4_from_FP2(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP2
+ *
+	real part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2H(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP
+ *
+	@param x FP4 instance to be initialised
+	@param a FP to form real part of FP4
+ */
+extern void FP4_from_FP(FP4 *x, FP *a);
+
+/**	@brief Copy FP4 to another FP4
+ *
+	@param x FP4 instance, on exit = y
+	@param y FP4 instance to be copied
+ */
+extern void FP4_copy(FP4 *x, FP4 *y);
+/**	@brief Set FP4 to zero
+ *
+	@param x FP4 instance to be set to zero
+ */
+extern void FP4_zero(FP4 *x);
+/**	@brief Set FP4 to unity
+ *
+	@param x FP4 instance to be set to one
+ */
+extern void FP4_one(FP4 *x);
+
+/**	@brief Sign of FP4
+ *
+	@param x FP4 instance
+	@return "sign" of FP4
+ */
+extern int FP4_sign(FP4 *x);
+
+/**	@brief Negation of FP4
+ *
+	@param x FP4 instance, on exit = -y
+	@param y FP4 instance
+ */
+extern void FP4_neg(FP4 *x, FP4 *y);
+/**	@brief Conjugation of FP4
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP4 instance, on exit = conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_conj(FP4 *x, FP4 *y);
+/**	@brief Negative conjugation of FP4
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP4 instance, on exit = -conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_nconj(FP4 *x, FP4 *y);
+/**	@brief addition of two FP4s
+ *
+	@param x FP4 instance, on exit = y+z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_add(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief subtraction of two FP4s
+ *
+	@param x FP4 instance, on exit = y-z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_sub(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Multiplication of an FP4 by an FP2
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP2 multiplier
+ */
+extern void FP4_pmul(FP4 *x, FP4 *y, FP2 *a);
+
+
+/**	@brief Multiplication of an FP4 by an FP
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP multiplier
+ */
+extern void FP4_qmul(FP4 *x, FP4 *y, FP *a);
+
+/**	@brief Multiplication of an FP4 by a small integer
+ *
+	@param x FP4 instance, on exit = y*i
+	@param y FP4 instance
+	@param i an integer
+ */
+extern void FP4_imul(FP4 *x, FP4 *y, int i);
+/**	@brief Squaring an FP4
+ *
+	@param x FP4 instance, on exit = y^2
+	@param y FP4 instance
+ */
+extern void FP4_sqr(FP4 *x, FP4 *y);
+/**	@brief Multiplication of two FP4s
+ *
+	@param x FP4 instance, on exit = y*z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_mul(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Inverting an FP4
+ *
+	@param x FP4 instance, on exit = 1/y
+	@param y FP4 instance
+    @param h optional input hint
+ */
+extern void FP4_inv(FP4 *x, FP4 *y, FP *h);
+
+/**	@brief Divide an FP4 by 2
+ *
+	@param x FP4 instance, on exit = y/2
+	@param y FP4 instance
+ */
+extern void FP4_div2(FP4 *x, FP4 *y);
+
+
+/**	@brief Formats and outputs an FP4 to the console
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_output(FP4 *x);
+/**	@brief Formats and outputs an FP4 to the console in raw form (for debugging)
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_rawoutput(FP4 *x);
+/**	@brief multiplies an FP4 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP4 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP4_times_i(FP4 *x);
+/**	@brief Normalises the components of an FP4
+ *
+	@param x FP4 instance to be normalised
+ */
+extern void FP4_norm(FP4 *x);
+/**	@brief Reduces all components of possibly unreduced FP4 mod Modulus
+ *
+	@param x FP4 instance, on exit reduced mod Modulus
+ */
+extern void FP4_reduce(FP4 *x);
+/**	@brief Raises an FP4 to the power of a BIG
+ *
+	@param x FP4 instance, on exit = y^b
+	@param y FP4 instance
+	@param b BIG number
+ */
+extern void FP4_pow(FP4 *x, FP4 *y, B584_60::BIG b);
+/**	@brief Raises an FP4 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP4 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP4_frob(FP4 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP4 instance, on exit = w*x-conj(x)*y+z
+	@param w FP4 instance
+	@param x FP4 instance
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_xtr_A(FP4 *r, FP4 *w, FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP4 instance, on exit = x^2-2*conj(x)
+	@param x FP4 instance
+ */
+extern void FP4_xtr_D(FP4 *r, FP4 *x);
+/**	@brief Calculates FP4 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP4 instance, on exit = trace(w^b)
+	@param x FP4 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP4_xtr_pow(FP4 *r, FP4 *x, B584_60::BIG b);
+/**	@brief Calculates FP4 trace of c^a.d^b, where c and d are derived from FP4 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP4 instance, on exit = trace(c^a.d^b)
+	@param c FP4 instance, trace of an FP12
+	@param d FP4 instance, trace of an FP12
+	@param e FP4 instance, trace of an FP12
+	@param f FP4 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP4_xtr_pow2(FP4 *r, FP4 *c, FP4 *d, FP4 *e, FP4 *f, B584_60::BIG a, B584_60::BIG b);
+
+/**	@brief Test FP4 for QR
+ * 
+	@param r FP4 instance
+    @param h optional generated hint
+	@return 1 x is a QR, otherwise 0
+ */
+extern int  FP4_qr(FP4 *r, FP *h);
+
+/**	@brief Calculate square root of an FP4
+ *
+	Square root
+	@param r FP4 instance, on exit = sqrt(x)
+	@param x FP4 instance
+    @param h optional input hint
+ */
+extern void  FP4_sqrt(FP4 *r, FP4 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP4 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP4 instance, set to y if s!=0
+	@param y another FP4 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP4_cmove(FP4 *x, FP4 *y, int s);
+
+
+/**	@brief Divide FP4 number by QNR
+ *
+	Divide FP4 by the QNR
+	@param x FP4 instance
+ */
+extern void FP4_div_i(FP4 *x);
+
+/**	@brief Generate random FP4
+ *
+	@param x random FP4 number
+	@param rng random number generator
+ */
+extern void FP4_rand(FP4 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp4_BN158.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp4_BN158.h
new file mode 100644
index 0000000..c1f625c
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp4_BN158.h
@@ -0,0 +1,349 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP4_BN158_H
+#define FP4_BN158_H
+
+#include "fp2_BN158.h"
+#include "config_curve_BN158.h"
+
+using namespace core;
+
+namespace BN158 {
+
+/**
+	@brief FP4 Structure - towered over two FP2
+*/
+
+typedef struct
+{
+    FP2 a; /**< real part of FP4 */
+    FP2 b; /**< imaginary part of FP4 */
+} FP4;
+
+
+/* FP4 prototypes */
+/**	@brief Tests for FP4 equal to zero
+ *
+	@param x FP4 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP4_iszilch(FP4 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP4 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP4_islarger(FP4 *x);
+
+/**	@brief Serialize out FP4  
+ *
+    @param b buffer for output
+	@param x FP4 number to be serialized
+ */
+extern void FP4_toBytes(char *b,FP4 *x);
+
+/**	@brief Serialize in FP4  
+ *
+	@param x FP4 number to be serialized
+    @param b buffer for input
+ */
+extern void FP4_fromBytes(FP4 *x,char *b);
+
+/**	@brief Tests for FP4 equal to unity
+ *
+	@param x FP4 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP4_isunity(FP4 *x);
+/**	@brief Tests for equality of two FP4s
+ *
+	@param x FP4 instance to be compared
+	@param y FP4 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP4_equals(FP4 *x, FP4 *y);
+/**	@brief Tests for FP4 having only a real part and no imaginary part
+ *
+	@param x FP4 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP4_isreal(FP4 *x);
+/**	@brief Initialise FP4 from two FP2s
+ *
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+	@param b FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2s(FP4 *x, FP2 *a, FP2 *b);
+/**	@brief Initialise FP4 from single FP2
+ *
+	Imaginary part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+ */
+extern void FP4_from_FP2(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP2
+ *
+	real part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2H(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP
+ *
+	@param x FP4 instance to be initialised
+	@param a FP to form real part of FP4
+ */
+extern void FP4_from_FP(FP4 *x, FP *a);
+
+/**	@brief Copy FP4 to another FP4
+ *
+	@param x FP4 instance, on exit = y
+	@param y FP4 instance to be copied
+ */
+extern void FP4_copy(FP4 *x, FP4 *y);
+/**	@brief Set FP4 to zero
+ *
+	@param x FP4 instance to be set to zero
+ */
+extern void FP4_zero(FP4 *x);
+/**	@brief Set FP4 to unity
+ *
+	@param x FP4 instance to be set to one
+ */
+extern void FP4_one(FP4 *x);
+
+/**	@brief Sign of FP4
+ *
+	@param x FP4 instance
+	@return "sign" of FP4
+ */
+extern int FP4_sign(FP4 *x);
+
+/**	@brief Negation of FP4
+ *
+	@param x FP4 instance, on exit = -y
+	@param y FP4 instance
+ */
+extern void FP4_neg(FP4 *x, FP4 *y);
+/**	@brief Conjugation of FP4
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP4 instance, on exit = conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_conj(FP4 *x, FP4 *y);
+/**	@brief Negative conjugation of FP4
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP4 instance, on exit = -conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_nconj(FP4 *x, FP4 *y);
+/**	@brief addition of two FP4s
+ *
+	@param x FP4 instance, on exit = y+z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_add(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief subtraction of two FP4s
+ *
+	@param x FP4 instance, on exit = y-z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_sub(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Multiplication of an FP4 by an FP2
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP2 multiplier
+ */
+extern void FP4_pmul(FP4 *x, FP4 *y, FP2 *a);
+
+
+/**	@brief Multiplication of an FP4 by an FP
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP multiplier
+ */
+extern void FP4_qmul(FP4 *x, FP4 *y, FP *a);
+
+/**	@brief Multiplication of an FP4 by a small integer
+ *
+	@param x FP4 instance, on exit = y*i
+	@param y FP4 instance
+	@param i an integer
+ */
+extern void FP4_imul(FP4 *x, FP4 *y, int i);
+/**	@brief Squaring an FP4
+ *
+	@param x FP4 instance, on exit = y^2
+	@param y FP4 instance
+ */
+extern void FP4_sqr(FP4 *x, FP4 *y);
+/**	@brief Multiplication of two FP4s
+ *
+	@param x FP4 instance, on exit = y*z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_mul(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Inverting an FP4
+ *
+	@param x FP4 instance, on exit = 1/y
+	@param y FP4 instance
+    @param h optional input hint
+ */
+extern void FP4_inv(FP4 *x, FP4 *y, FP *h);
+
+/**	@brief Divide an FP4 by 2
+ *
+	@param x FP4 instance, on exit = y/2
+	@param y FP4 instance
+ */
+extern void FP4_div2(FP4 *x, FP4 *y);
+
+
+/**	@brief Formats and outputs an FP4 to the console
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_output(FP4 *x);
+/**	@brief Formats and outputs an FP4 to the console in raw form (for debugging)
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_rawoutput(FP4 *x);
+/**	@brief multiplies an FP4 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP4 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP4_times_i(FP4 *x);
+/**	@brief Normalises the components of an FP4
+ *
+	@param x FP4 instance to be normalised
+ */
+extern void FP4_norm(FP4 *x);
+/**	@brief Reduces all components of possibly unreduced FP4 mod Modulus
+ *
+	@param x FP4 instance, on exit reduced mod Modulus
+ */
+extern void FP4_reduce(FP4 *x);
+/**	@brief Raises an FP4 to the power of a BIG
+ *
+	@param x FP4 instance, on exit = y^b
+	@param y FP4 instance
+	@param b BIG number
+ */
+extern void FP4_pow(FP4 *x, FP4 *y, B160_56::BIG b);
+/**	@brief Raises an FP4 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP4 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP4_frob(FP4 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP4 instance, on exit = w*x-conj(x)*y+z
+	@param w FP4 instance
+	@param x FP4 instance
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_xtr_A(FP4 *r, FP4 *w, FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP4 instance, on exit = x^2-2*conj(x)
+	@param x FP4 instance
+ */
+extern void FP4_xtr_D(FP4 *r, FP4 *x);
+/**	@brief Calculates FP4 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP4 instance, on exit = trace(w^b)
+	@param x FP4 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP4_xtr_pow(FP4 *r, FP4 *x, B160_56::BIG b);
+/**	@brief Calculates FP4 trace of c^a.d^b, where c and d are derived from FP4 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP4 instance, on exit = trace(c^a.d^b)
+	@param c FP4 instance, trace of an FP12
+	@param d FP4 instance, trace of an FP12
+	@param e FP4 instance, trace of an FP12
+	@param f FP4 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP4_xtr_pow2(FP4 *r, FP4 *c, FP4 *d, FP4 *e, FP4 *f, B160_56::BIG a, B160_56::BIG b);
+
+/**	@brief Test FP4 for QR
+ * 
+	@param r FP4 instance
+    @param h optional generated hint
+	@return 1 x is a QR, otherwise 0
+ */
+extern int  FP4_qr(FP4 *r, FP *h);
+
+/**	@brief Calculate square root of an FP4
+ *
+	Square root
+	@param r FP4 instance, on exit = sqrt(x)
+	@param x FP4 instance
+    @param h optional input hint
+ */
+extern void  FP4_sqrt(FP4 *r, FP4 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP4 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP4 instance, set to y if s!=0
+	@param y another FP4 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP4_cmove(FP4 *x, FP4 *y, int s);
+
+
+/**	@brief Divide FP4 number by QNR
+ *
+	Divide FP4 by the QNR
+	@param x FP4 instance
+ */
+extern void FP4_div_i(FP4 *x);
+
+/**	@brief Generate random FP4
+ *
+	@param x random FP4 number
+	@param rng random number generator
+ */
+extern void FP4_rand(FP4 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp4_BN254.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp4_BN254.h
new file mode 100644
index 0000000..dfcf3b6
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp4_BN254.h
@@ -0,0 +1,349 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP4_BN254_H
+#define FP4_BN254_H
+
+#include "fp2_BN254.h"
+#include "config_curve_BN254.h"
+
+using namespace core;
+
+namespace BN254 {
+
+/**
+	@brief FP4 Structure - towered over two FP2
+*/
+
+typedef struct
+{
+    FP2 a; /**< real part of FP4 */
+    FP2 b; /**< imaginary part of FP4 */
+} FP4;
+
+
+/* FP4 prototypes */
+/**	@brief Tests for FP4 equal to zero
+ *
+	@param x FP4 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP4_iszilch(FP4 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP4 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP4_islarger(FP4 *x);
+
+/**	@brief Serialize out FP4  
+ *
+    @param b buffer for output
+	@param x FP4 number to be serialized
+ */
+extern void FP4_toBytes(char *b,FP4 *x);
+
+/**	@brief Serialize in FP4  
+ *
+	@param x FP4 number to be serialized
+    @param b buffer for input
+ */
+extern void FP4_fromBytes(FP4 *x,char *b);
+
+/**	@brief Tests for FP4 equal to unity
+ *
+	@param x FP4 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP4_isunity(FP4 *x);
+/**	@brief Tests for equality of two FP4s
+ *
+	@param x FP4 instance to be compared
+	@param y FP4 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP4_equals(FP4 *x, FP4 *y);
+/**	@brief Tests for FP4 having only a real part and no imaginary part
+ *
+	@param x FP4 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP4_isreal(FP4 *x);
+/**	@brief Initialise FP4 from two FP2s
+ *
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+	@param b FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2s(FP4 *x, FP2 *a, FP2 *b);
+/**	@brief Initialise FP4 from single FP2
+ *
+	Imaginary part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+ */
+extern void FP4_from_FP2(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP2
+ *
+	real part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2H(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP
+ *
+	@param x FP4 instance to be initialised
+	@param a FP to form real part of FP4
+ */
+extern void FP4_from_FP(FP4 *x, FP *a);
+
+/**	@brief Copy FP4 to another FP4
+ *
+	@param x FP4 instance, on exit = y
+	@param y FP4 instance to be copied
+ */
+extern void FP4_copy(FP4 *x, FP4 *y);
+/**	@brief Set FP4 to zero
+ *
+	@param x FP4 instance to be set to zero
+ */
+extern void FP4_zero(FP4 *x);
+/**	@brief Set FP4 to unity
+ *
+	@param x FP4 instance to be set to one
+ */
+extern void FP4_one(FP4 *x);
+
+/**	@brief Sign of FP4
+ *
+	@param x FP4 instance
+	@return "sign" of FP4
+ */
+extern int FP4_sign(FP4 *x);
+
+/**	@brief Negation of FP4
+ *
+	@param x FP4 instance, on exit = -y
+	@param y FP4 instance
+ */
+extern void FP4_neg(FP4 *x, FP4 *y);
+/**	@brief Conjugation of FP4
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP4 instance, on exit = conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_conj(FP4 *x, FP4 *y);
+/**	@brief Negative conjugation of FP4
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP4 instance, on exit = -conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_nconj(FP4 *x, FP4 *y);
+/**	@brief addition of two FP4s
+ *
+	@param x FP4 instance, on exit = y+z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_add(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief subtraction of two FP4s
+ *
+	@param x FP4 instance, on exit = y-z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_sub(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Multiplication of an FP4 by an FP2
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP2 multiplier
+ */
+extern void FP4_pmul(FP4 *x, FP4 *y, FP2 *a);
+
+
+/**	@brief Multiplication of an FP4 by an FP
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP multiplier
+ */
+extern void FP4_qmul(FP4 *x, FP4 *y, FP *a);
+
+/**	@brief Multiplication of an FP4 by a small integer
+ *
+	@param x FP4 instance, on exit = y*i
+	@param y FP4 instance
+	@param i an integer
+ */
+extern void FP4_imul(FP4 *x, FP4 *y, int i);
+/**	@brief Squaring an FP4
+ *
+	@param x FP4 instance, on exit = y^2
+	@param y FP4 instance
+ */
+extern void FP4_sqr(FP4 *x, FP4 *y);
+/**	@brief Multiplication of two FP4s
+ *
+	@param x FP4 instance, on exit = y*z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_mul(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Inverting an FP4
+ *
+	@param x FP4 instance, on exit = 1/y
+	@param y FP4 instance
+    @param h optional input hint
+ */
+extern void FP4_inv(FP4 *x, FP4 *y, FP *h);
+
+/**	@brief Divide an FP4 by 2
+ *
+	@param x FP4 instance, on exit = y/2
+	@param y FP4 instance
+ */
+extern void FP4_div2(FP4 *x, FP4 *y);
+
+
+/**	@brief Formats and outputs an FP4 to the console
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_output(FP4 *x);
+/**	@brief Formats and outputs an FP4 to the console in raw form (for debugging)
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_rawoutput(FP4 *x);
+/**	@brief multiplies an FP4 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP4 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP4_times_i(FP4 *x);
+/**	@brief Normalises the components of an FP4
+ *
+	@param x FP4 instance to be normalised
+ */
+extern void FP4_norm(FP4 *x);
+/**	@brief Reduces all components of possibly unreduced FP4 mod Modulus
+ *
+	@param x FP4 instance, on exit reduced mod Modulus
+ */
+extern void FP4_reduce(FP4 *x);
+/**	@brief Raises an FP4 to the power of a BIG
+ *
+	@param x FP4 instance, on exit = y^b
+	@param y FP4 instance
+	@param b BIG number
+ */
+extern void FP4_pow(FP4 *x, FP4 *y, B256_56::BIG b);
+/**	@brief Raises an FP4 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP4 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP4_frob(FP4 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP4 instance, on exit = w*x-conj(x)*y+z
+	@param w FP4 instance
+	@param x FP4 instance
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_xtr_A(FP4 *r, FP4 *w, FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP4 instance, on exit = x^2-2*conj(x)
+	@param x FP4 instance
+ */
+extern void FP4_xtr_D(FP4 *r, FP4 *x);
+/**	@brief Calculates FP4 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP4 instance, on exit = trace(w^b)
+	@param x FP4 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP4_xtr_pow(FP4 *r, FP4 *x, B256_56::BIG b);
+/**	@brief Calculates FP4 trace of c^a.d^b, where c and d are derived from FP4 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP4 instance, on exit = trace(c^a.d^b)
+	@param c FP4 instance, trace of an FP12
+	@param d FP4 instance, trace of an FP12
+	@param e FP4 instance, trace of an FP12
+	@param f FP4 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP4_xtr_pow2(FP4 *r, FP4 *c, FP4 *d, FP4 *e, FP4 *f, B256_56::BIG a, B256_56::BIG b);
+
+/**	@brief Test FP4 for QR
+ * 
+	@param r FP4 instance
+    @param h optional generated hint
+	@return 1 x is a QR, otherwise 0
+ */
+extern int  FP4_qr(FP4 *r, FP *h);
+
+/**	@brief Calculate square root of an FP4
+ *
+	Square root
+	@param r FP4 instance, on exit = sqrt(x)
+	@param x FP4 instance
+    @param h optional input hint
+ */
+extern void  FP4_sqrt(FP4 *r, FP4 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP4 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP4 instance, set to y if s!=0
+	@param y another FP4 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP4_cmove(FP4 *x, FP4 *y, int s);
+
+
+/**	@brief Divide FP4 number by QNR
+ *
+	Divide FP4 by the QNR
+	@param x FP4 instance
+ */
+extern void FP4_div_i(FP4 *x);
+
+/**	@brief Generate random FP4
+ *
+	@param x random FP4 number
+	@param rng random number generator
+ */
+extern void FP4_rand(FP4 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp4_BN254CX.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp4_BN254CX.h
new file mode 100644
index 0000000..005dc0a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp4_BN254CX.h
@@ -0,0 +1,349 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP4_BN254CX_H
+#define FP4_BN254CX_H
+
+#include "fp2_BN254CX.h"
+#include "config_curve_BN254CX.h"
+
+using namespace core;
+
+namespace BN254CX {
+
+/**
+	@brief FP4 Structure - towered over two FP2
+*/
+
+typedef struct
+{
+    FP2 a; /**< real part of FP4 */
+    FP2 b; /**< imaginary part of FP4 */
+} FP4;
+
+
+/* FP4 prototypes */
+/**	@brief Tests for FP4 equal to zero
+ *
+	@param x FP4 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP4_iszilch(FP4 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP4 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP4_islarger(FP4 *x);
+
+/**	@brief Serialize out FP4  
+ *
+    @param b buffer for output
+	@param x FP4 number to be serialized
+ */
+extern void FP4_toBytes(char *b,FP4 *x);
+
+/**	@brief Serialize in FP4  
+ *
+	@param x FP4 number to be serialized
+    @param b buffer for input
+ */
+extern void FP4_fromBytes(FP4 *x,char *b);
+
+/**	@brief Tests for FP4 equal to unity
+ *
+	@param x FP4 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP4_isunity(FP4 *x);
+/**	@brief Tests for equality of two FP4s
+ *
+	@param x FP4 instance to be compared
+	@param y FP4 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP4_equals(FP4 *x, FP4 *y);
+/**	@brief Tests for FP4 having only a real part and no imaginary part
+ *
+	@param x FP4 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP4_isreal(FP4 *x);
+/**	@brief Initialise FP4 from two FP2s
+ *
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+	@param b FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2s(FP4 *x, FP2 *a, FP2 *b);
+/**	@brief Initialise FP4 from single FP2
+ *
+	Imaginary part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+ */
+extern void FP4_from_FP2(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP2
+ *
+	real part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2H(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP
+ *
+	@param x FP4 instance to be initialised
+	@param a FP to form real part of FP4
+ */
+extern void FP4_from_FP(FP4 *x, FP *a);
+
+/**	@brief Copy FP4 to another FP4
+ *
+	@param x FP4 instance, on exit = y
+	@param y FP4 instance to be copied
+ */
+extern void FP4_copy(FP4 *x, FP4 *y);
+/**	@brief Set FP4 to zero
+ *
+	@param x FP4 instance to be set to zero
+ */
+extern void FP4_zero(FP4 *x);
+/**	@brief Set FP4 to unity
+ *
+	@param x FP4 instance to be set to one
+ */
+extern void FP4_one(FP4 *x);
+
+/**	@brief Sign of FP4
+ *
+	@param x FP4 instance
+	@return "sign" of FP4
+ */
+extern int FP4_sign(FP4 *x);
+
+/**	@brief Negation of FP4
+ *
+	@param x FP4 instance, on exit = -y
+	@param y FP4 instance
+ */
+extern void FP4_neg(FP4 *x, FP4 *y);
+/**	@brief Conjugation of FP4
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP4 instance, on exit = conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_conj(FP4 *x, FP4 *y);
+/**	@brief Negative conjugation of FP4
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP4 instance, on exit = -conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_nconj(FP4 *x, FP4 *y);
+/**	@brief addition of two FP4s
+ *
+	@param x FP4 instance, on exit = y+z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_add(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief subtraction of two FP4s
+ *
+	@param x FP4 instance, on exit = y-z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_sub(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Multiplication of an FP4 by an FP2
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP2 multiplier
+ */
+extern void FP4_pmul(FP4 *x, FP4 *y, FP2 *a);
+
+
+/**	@brief Multiplication of an FP4 by an FP
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP multiplier
+ */
+extern void FP4_qmul(FP4 *x, FP4 *y, FP *a);
+
+/**	@brief Multiplication of an FP4 by a small integer
+ *
+	@param x FP4 instance, on exit = y*i
+	@param y FP4 instance
+	@param i an integer
+ */
+extern void FP4_imul(FP4 *x, FP4 *y, int i);
+/**	@brief Squaring an FP4
+ *
+	@param x FP4 instance, on exit = y^2
+	@param y FP4 instance
+ */
+extern void FP4_sqr(FP4 *x, FP4 *y);
+/**	@brief Multiplication of two FP4s
+ *
+	@param x FP4 instance, on exit = y*z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_mul(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Inverting an FP4
+ *
+	@param x FP4 instance, on exit = 1/y
+	@param y FP4 instance
+    @param h optional input hint
+ */
+extern void FP4_inv(FP4 *x, FP4 *y, FP *h);
+
+/**	@brief Divide an FP4 by 2
+ *
+	@param x FP4 instance, on exit = y/2
+	@param y FP4 instance
+ */
+extern void FP4_div2(FP4 *x, FP4 *y);
+
+
+/**	@brief Formats and outputs an FP4 to the console
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_output(FP4 *x);
+/**	@brief Formats and outputs an FP4 to the console in raw form (for debugging)
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_rawoutput(FP4 *x);
+/**	@brief multiplies an FP4 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP4 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP4_times_i(FP4 *x);
+/**	@brief Normalises the components of an FP4
+ *
+	@param x FP4 instance to be normalised
+ */
+extern void FP4_norm(FP4 *x);
+/**	@brief Reduces all components of possibly unreduced FP4 mod Modulus
+ *
+	@param x FP4 instance, on exit reduced mod Modulus
+ */
+extern void FP4_reduce(FP4 *x);
+/**	@brief Raises an FP4 to the power of a BIG
+ *
+	@param x FP4 instance, on exit = y^b
+	@param y FP4 instance
+	@param b BIG number
+ */
+extern void FP4_pow(FP4 *x, FP4 *y, B256_56::BIG b);
+/**	@brief Raises an FP4 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP4 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP4_frob(FP4 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP4 instance, on exit = w*x-conj(x)*y+z
+	@param w FP4 instance
+	@param x FP4 instance
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_xtr_A(FP4 *r, FP4 *w, FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP4 instance, on exit = x^2-2*conj(x)
+	@param x FP4 instance
+ */
+extern void FP4_xtr_D(FP4 *r, FP4 *x);
+/**	@brief Calculates FP4 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP4 instance, on exit = trace(w^b)
+	@param x FP4 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP4_xtr_pow(FP4 *r, FP4 *x, B256_56::BIG b);
+/**	@brief Calculates FP4 trace of c^a.d^b, where c and d are derived from FP4 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP4 instance, on exit = trace(c^a.d^b)
+	@param c FP4 instance, trace of an FP12
+	@param d FP4 instance, trace of an FP12
+	@param e FP4 instance, trace of an FP12
+	@param f FP4 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP4_xtr_pow2(FP4 *r, FP4 *c, FP4 *d, FP4 *e, FP4 *f, B256_56::BIG a, B256_56::BIG b);
+
+/**	@brief Test FP4 for QR
+ * 
+	@param r FP4 instance
+    @param h optional generated hint
+	@return 1 x is a QR, otherwise 0
+ */
+extern int  FP4_qr(FP4 *r, FP *h);
+
+/**	@brief Calculate square root of an FP4
+ *
+	Square root
+	@param r FP4 instance, on exit = sqrt(x)
+	@param x FP4 instance
+    @param h optional input hint
+ */
+extern void  FP4_sqrt(FP4 *r, FP4 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP4 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP4 instance, set to y if s!=0
+	@param y another FP4 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP4_cmove(FP4 *x, FP4 *y, int s);
+
+
+/**	@brief Divide FP4 number by QNR
+ *
+	Divide FP4 by the QNR
+	@param x FP4 instance
+ */
+extern void FP4_div_i(FP4 *x);
+
+/**	@brief Generate random FP4
+ *
+	@param x random FP4 number
+	@param rng random number generator
+ */
+extern void FP4_rand(FP4 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp4_BN462.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp4_BN462.h
new file mode 100644
index 0000000..f6726b6
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp4_BN462.h
@@ -0,0 +1,349 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP4_BN462_H
+#define FP4_BN462_H
+
+#include "fp2_BN462.h"
+#include "config_curve_BN462.h"
+
+using namespace core;
+
+namespace BN462 {
+
+/**
+	@brief FP4 Structure - towered over two FP2
+*/
+
+typedef struct
+{
+    FP2 a; /**< real part of FP4 */
+    FP2 b; /**< imaginary part of FP4 */
+} FP4;
+
+
+/* FP4 prototypes */
+/**	@brief Tests for FP4 equal to zero
+ *
+	@param x FP4 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP4_iszilch(FP4 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP4 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP4_islarger(FP4 *x);
+
+/**	@brief Serialize out FP4  
+ *
+    @param b buffer for output
+	@param x FP4 number to be serialized
+ */
+extern void FP4_toBytes(char *b,FP4 *x);
+
+/**	@brief Serialize in FP4  
+ *
+	@param x FP4 number to be serialized
+    @param b buffer for input
+ */
+extern void FP4_fromBytes(FP4 *x,char *b);
+
+/**	@brief Tests for FP4 equal to unity
+ *
+	@param x FP4 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP4_isunity(FP4 *x);
+/**	@brief Tests for equality of two FP4s
+ *
+	@param x FP4 instance to be compared
+	@param y FP4 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP4_equals(FP4 *x, FP4 *y);
+/**	@brief Tests for FP4 having only a real part and no imaginary part
+ *
+	@param x FP4 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP4_isreal(FP4 *x);
+/**	@brief Initialise FP4 from two FP2s
+ *
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+	@param b FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2s(FP4 *x, FP2 *a, FP2 *b);
+/**	@brief Initialise FP4 from single FP2
+ *
+	Imaginary part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+ */
+extern void FP4_from_FP2(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP2
+ *
+	real part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2H(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP
+ *
+	@param x FP4 instance to be initialised
+	@param a FP to form real part of FP4
+ */
+extern void FP4_from_FP(FP4 *x, FP *a);
+
+/**	@brief Copy FP4 to another FP4
+ *
+	@param x FP4 instance, on exit = y
+	@param y FP4 instance to be copied
+ */
+extern void FP4_copy(FP4 *x, FP4 *y);
+/**	@brief Set FP4 to zero
+ *
+	@param x FP4 instance to be set to zero
+ */
+extern void FP4_zero(FP4 *x);
+/**	@brief Set FP4 to unity
+ *
+	@param x FP4 instance to be set to one
+ */
+extern void FP4_one(FP4 *x);
+
+/**	@brief Sign of FP4
+ *
+	@param x FP4 instance
+	@return "sign" of FP4
+ */
+extern int FP4_sign(FP4 *x);
+
+/**	@brief Negation of FP4
+ *
+	@param x FP4 instance, on exit = -y
+	@param y FP4 instance
+ */
+extern void FP4_neg(FP4 *x, FP4 *y);
+/**	@brief Conjugation of FP4
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP4 instance, on exit = conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_conj(FP4 *x, FP4 *y);
+/**	@brief Negative conjugation of FP4
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP4 instance, on exit = -conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_nconj(FP4 *x, FP4 *y);
+/**	@brief addition of two FP4s
+ *
+	@param x FP4 instance, on exit = y+z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_add(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief subtraction of two FP4s
+ *
+	@param x FP4 instance, on exit = y-z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_sub(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Multiplication of an FP4 by an FP2
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP2 multiplier
+ */
+extern void FP4_pmul(FP4 *x, FP4 *y, FP2 *a);
+
+
+/**	@brief Multiplication of an FP4 by an FP
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP multiplier
+ */
+extern void FP4_qmul(FP4 *x, FP4 *y, FP *a);
+
+/**	@brief Multiplication of an FP4 by a small integer
+ *
+	@param x FP4 instance, on exit = y*i
+	@param y FP4 instance
+	@param i an integer
+ */
+extern void FP4_imul(FP4 *x, FP4 *y, int i);
+/**	@brief Squaring an FP4
+ *
+	@param x FP4 instance, on exit = y^2
+	@param y FP4 instance
+ */
+extern void FP4_sqr(FP4 *x, FP4 *y);
+/**	@brief Multiplication of two FP4s
+ *
+	@param x FP4 instance, on exit = y*z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_mul(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Inverting an FP4
+ *
+	@param x FP4 instance, on exit = 1/y
+	@param y FP4 instance
+    @param h optional input hint
+ */
+extern void FP4_inv(FP4 *x, FP4 *y, FP *h);
+
+/**	@brief Divide an FP4 by 2
+ *
+	@param x FP4 instance, on exit = y/2
+	@param y FP4 instance
+ */
+extern void FP4_div2(FP4 *x, FP4 *y);
+
+
+/**	@brief Formats and outputs an FP4 to the console
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_output(FP4 *x);
+/**	@brief Formats and outputs an FP4 to the console in raw form (for debugging)
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_rawoutput(FP4 *x);
+/**	@brief multiplies an FP4 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP4 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP4_times_i(FP4 *x);
+/**	@brief Normalises the components of an FP4
+ *
+	@param x FP4 instance to be normalised
+ */
+extern void FP4_norm(FP4 *x);
+/**	@brief Reduces all components of possibly unreduced FP4 mod Modulus
+ *
+	@param x FP4 instance, on exit reduced mod Modulus
+ */
+extern void FP4_reduce(FP4 *x);
+/**	@brief Raises an FP4 to the power of a BIG
+ *
+	@param x FP4 instance, on exit = y^b
+	@param y FP4 instance
+	@param b BIG number
+ */
+extern void FP4_pow(FP4 *x, FP4 *y, B464_60::BIG b);
+/**	@brief Raises an FP4 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP4 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP4_frob(FP4 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP4 instance, on exit = w*x-conj(x)*y+z
+	@param w FP4 instance
+	@param x FP4 instance
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_xtr_A(FP4 *r, FP4 *w, FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP4 instance, on exit = x^2-2*conj(x)
+	@param x FP4 instance
+ */
+extern void FP4_xtr_D(FP4 *r, FP4 *x);
+/**	@brief Calculates FP4 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP4 instance, on exit = trace(w^b)
+	@param x FP4 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP4_xtr_pow(FP4 *r, FP4 *x, B464_60::BIG b);
+/**	@brief Calculates FP4 trace of c^a.d^b, where c and d are derived from FP4 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP4 instance, on exit = trace(c^a.d^b)
+	@param c FP4 instance, trace of an FP12
+	@param d FP4 instance, trace of an FP12
+	@param e FP4 instance, trace of an FP12
+	@param f FP4 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP4_xtr_pow2(FP4 *r, FP4 *c, FP4 *d, FP4 *e, FP4 *f, B464_60::BIG a, B464_60::BIG b);
+
+/**	@brief Test FP4 for QR
+ * 
+	@param r FP4 instance
+    @param h optional generated hint
+	@return 1 x is a QR, otherwise 0
+ */
+extern int  FP4_qr(FP4 *r, FP *h);
+
+/**	@brief Calculate square root of an FP4
+ *
+	Square root
+	@param r FP4 instance, on exit = sqrt(x)
+	@param x FP4 instance
+    @param h optional input hint
+ */
+extern void  FP4_sqrt(FP4 *r, FP4 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP4 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP4 instance, set to y if s!=0
+	@param y another FP4 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP4_cmove(FP4 *x, FP4 *y, int s);
+
+
+/**	@brief Divide FP4 number by QNR
+ *
+	Divide FP4 by the QNR
+	@param x FP4 instance
+ */
+extern void FP4_div_i(FP4 *x);
+
+/**	@brief Generate random FP4
+ *
+	@param x random FP4 number
+	@param rng random number generator
+ */
+extern void FP4_rand(FP4 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp4_FP256BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp4_FP256BN.h
new file mode 100644
index 0000000..b53223a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp4_FP256BN.h
@@ -0,0 +1,349 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP4_FP256BN_H
+#define FP4_FP256BN_H
+
+#include "fp2_FP256BN.h"
+#include "config_curve_FP256BN.h"
+
+using namespace core;
+
+namespace FP256BN {
+
+/**
+	@brief FP4 Structure - towered over two FP2
+*/
+
+typedef struct
+{
+    FP2 a; /**< real part of FP4 */
+    FP2 b; /**< imaginary part of FP4 */
+} FP4;
+
+
+/* FP4 prototypes */
+/**	@brief Tests for FP4 equal to zero
+ *
+	@param x FP4 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP4_iszilch(FP4 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP4 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP4_islarger(FP4 *x);
+
+/**	@brief Serialize out FP4  
+ *
+    @param b buffer for output
+	@param x FP4 number to be serialized
+ */
+extern void FP4_toBytes(char *b,FP4 *x);
+
+/**	@brief Serialize in FP4  
+ *
+	@param x FP4 number to be serialized
+    @param b buffer for input
+ */
+extern void FP4_fromBytes(FP4 *x,char *b);
+
+/**	@brief Tests for FP4 equal to unity
+ *
+	@param x FP4 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP4_isunity(FP4 *x);
+/**	@brief Tests for equality of two FP4s
+ *
+	@param x FP4 instance to be compared
+	@param y FP4 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP4_equals(FP4 *x, FP4 *y);
+/**	@brief Tests for FP4 having only a real part and no imaginary part
+ *
+	@param x FP4 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP4_isreal(FP4 *x);
+/**	@brief Initialise FP4 from two FP2s
+ *
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+	@param b FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2s(FP4 *x, FP2 *a, FP2 *b);
+/**	@brief Initialise FP4 from single FP2
+ *
+	Imaginary part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+ */
+extern void FP4_from_FP2(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP2
+ *
+	real part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2H(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP
+ *
+	@param x FP4 instance to be initialised
+	@param a FP to form real part of FP4
+ */
+extern void FP4_from_FP(FP4 *x, FP *a);
+
+/**	@brief Copy FP4 to another FP4
+ *
+	@param x FP4 instance, on exit = y
+	@param y FP4 instance to be copied
+ */
+extern void FP4_copy(FP4 *x, FP4 *y);
+/**	@brief Set FP4 to zero
+ *
+	@param x FP4 instance to be set to zero
+ */
+extern void FP4_zero(FP4 *x);
+/**	@brief Set FP4 to unity
+ *
+	@param x FP4 instance to be set to one
+ */
+extern void FP4_one(FP4 *x);
+
+/**	@brief Sign of FP4
+ *
+	@param x FP4 instance
+	@return "sign" of FP4
+ */
+extern int FP4_sign(FP4 *x);
+
+/**	@brief Negation of FP4
+ *
+	@param x FP4 instance, on exit = -y
+	@param y FP4 instance
+ */
+extern void FP4_neg(FP4 *x, FP4 *y);
+/**	@brief Conjugation of FP4
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP4 instance, on exit = conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_conj(FP4 *x, FP4 *y);
+/**	@brief Negative conjugation of FP4
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP4 instance, on exit = -conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_nconj(FP4 *x, FP4 *y);
+/**	@brief addition of two FP4s
+ *
+	@param x FP4 instance, on exit = y+z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_add(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief subtraction of two FP4s
+ *
+	@param x FP4 instance, on exit = y-z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_sub(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Multiplication of an FP4 by an FP2
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP2 multiplier
+ */
+extern void FP4_pmul(FP4 *x, FP4 *y, FP2 *a);
+
+
+/**	@brief Multiplication of an FP4 by an FP
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP multiplier
+ */
+extern void FP4_qmul(FP4 *x, FP4 *y, FP *a);
+
+/**	@brief Multiplication of an FP4 by a small integer
+ *
+	@param x FP4 instance, on exit = y*i
+	@param y FP4 instance
+	@param i an integer
+ */
+extern void FP4_imul(FP4 *x, FP4 *y, int i);
+/**	@brief Squaring an FP4
+ *
+	@param x FP4 instance, on exit = y^2
+	@param y FP4 instance
+ */
+extern void FP4_sqr(FP4 *x, FP4 *y);
+/**	@brief Multiplication of two FP4s
+ *
+	@param x FP4 instance, on exit = y*z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_mul(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Inverting an FP4
+ *
+	@param x FP4 instance, on exit = 1/y
+	@param y FP4 instance
+    @param h optional input hint
+ */
+extern void FP4_inv(FP4 *x, FP4 *y, FP *h);
+
+/**	@brief Divide an FP4 by 2
+ *
+	@param x FP4 instance, on exit = y/2
+	@param y FP4 instance
+ */
+extern void FP4_div2(FP4 *x, FP4 *y);
+
+
+/**	@brief Formats and outputs an FP4 to the console
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_output(FP4 *x);
+/**	@brief Formats and outputs an FP4 to the console in raw form (for debugging)
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_rawoutput(FP4 *x);
+/**	@brief multiplies an FP4 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP4 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP4_times_i(FP4 *x);
+/**	@brief Normalises the components of an FP4
+ *
+	@param x FP4 instance to be normalised
+ */
+extern void FP4_norm(FP4 *x);
+/**	@brief Reduces all components of possibly unreduced FP4 mod Modulus
+ *
+	@param x FP4 instance, on exit reduced mod Modulus
+ */
+extern void FP4_reduce(FP4 *x);
+/**	@brief Raises an FP4 to the power of a BIG
+ *
+	@param x FP4 instance, on exit = y^b
+	@param y FP4 instance
+	@param b BIG number
+ */
+extern void FP4_pow(FP4 *x, FP4 *y, B256_56::BIG b);
+/**	@brief Raises an FP4 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP4 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP4_frob(FP4 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP4 instance, on exit = w*x-conj(x)*y+z
+	@param w FP4 instance
+	@param x FP4 instance
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_xtr_A(FP4 *r, FP4 *w, FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP4 instance, on exit = x^2-2*conj(x)
+	@param x FP4 instance
+ */
+extern void FP4_xtr_D(FP4 *r, FP4 *x);
+/**	@brief Calculates FP4 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP4 instance, on exit = trace(w^b)
+	@param x FP4 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP4_xtr_pow(FP4 *r, FP4 *x, B256_56::BIG b);
+/**	@brief Calculates FP4 trace of c^a.d^b, where c and d are derived from FP4 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP4 instance, on exit = trace(c^a.d^b)
+	@param c FP4 instance, trace of an FP12
+	@param d FP4 instance, trace of an FP12
+	@param e FP4 instance, trace of an FP12
+	@param f FP4 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP4_xtr_pow2(FP4 *r, FP4 *c, FP4 *d, FP4 *e, FP4 *f, B256_56::BIG a, B256_56::BIG b);
+
+/**	@brief Test FP4 for QR
+ * 
+	@param r FP4 instance
+    @param h optional generated hint
+	@return 1 x is a QR, otherwise 0
+ */
+extern int  FP4_qr(FP4 *r, FP *h);
+
+/**	@brief Calculate square root of an FP4
+ *
+	Square root
+	@param r FP4 instance, on exit = sqrt(x)
+	@param x FP4 instance
+    @param h optional input hint
+ */
+extern void  FP4_sqrt(FP4 *r, FP4 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP4 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP4 instance, set to y if s!=0
+	@param y another FP4 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP4_cmove(FP4 *x, FP4 *y, int s);
+
+
+/**	@brief Divide FP4 number by QNR
+ *
+	Divide FP4 by the QNR
+	@param x FP4 instance
+ */
+extern void FP4_div_i(FP4 *x);
+
+/**	@brief Generate random FP4
+ *
+	@param x random FP4 number
+	@param rng random number generator
+ */
+extern void FP4_rand(FP4 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp4_FP512BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp4_FP512BN.h
new file mode 100644
index 0000000..b3d88c0
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp4_FP512BN.h
@@ -0,0 +1,349 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP4_FP512BN_H
+#define FP4_FP512BN_H
+
+#include "fp2_FP512BN.h"
+#include "config_curve_FP512BN.h"
+
+using namespace core;
+
+namespace FP512BN {
+
+/**
+	@brief FP4 Structure - towered over two FP2
+*/
+
+typedef struct
+{
+    FP2 a; /**< real part of FP4 */
+    FP2 b; /**< imaginary part of FP4 */
+} FP4;
+
+
+/* FP4 prototypes */
+/**	@brief Tests for FP4 equal to zero
+ *
+	@param x FP4 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP4_iszilch(FP4 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP4 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP4_islarger(FP4 *x);
+
+/**	@brief Serialize out FP4  
+ *
+    @param b buffer for output
+	@param x FP4 number to be serialized
+ */
+extern void FP4_toBytes(char *b,FP4 *x);
+
+/**	@brief Serialize in FP4  
+ *
+	@param x FP4 number to be serialized
+    @param b buffer for input
+ */
+extern void FP4_fromBytes(FP4 *x,char *b);
+
+/**	@brief Tests for FP4 equal to unity
+ *
+	@param x FP4 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP4_isunity(FP4 *x);
+/**	@brief Tests for equality of two FP4s
+ *
+	@param x FP4 instance to be compared
+	@param y FP4 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP4_equals(FP4 *x, FP4 *y);
+/**	@brief Tests for FP4 having only a real part and no imaginary part
+ *
+	@param x FP4 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP4_isreal(FP4 *x);
+/**	@brief Initialise FP4 from two FP2s
+ *
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+	@param b FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2s(FP4 *x, FP2 *a, FP2 *b);
+/**	@brief Initialise FP4 from single FP2
+ *
+	Imaginary part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+ */
+extern void FP4_from_FP2(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP2
+ *
+	real part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2H(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP
+ *
+	@param x FP4 instance to be initialised
+	@param a FP to form real part of FP4
+ */
+extern void FP4_from_FP(FP4 *x, FP *a);
+
+/**	@brief Copy FP4 to another FP4
+ *
+	@param x FP4 instance, on exit = y
+	@param y FP4 instance to be copied
+ */
+extern void FP4_copy(FP4 *x, FP4 *y);
+/**	@brief Set FP4 to zero
+ *
+	@param x FP4 instance to be set to zero
+ */
+extern void FP4_zero(FP4 *x);
+/**	@brief Set FP4 to unity
+ *
+	@param x FP4 instance to be set to one
+ */
+extern void FP4_one(FP4 *x);
+
+/**	@brief Sign of FP4
+ *
+	@param x FP4 instance
+	@return "sign" of FP4
+ */
+extern int FP4_sign(FP4 *x);
+
+/**	@brief Negation of FP4
+ *
+	@param x FP4 instance, on exit = -y
+	@param y FP4 instance
+ */
+extern void FP4_neg(FP4 *x, FP4 *y);
+/**	@brief Conjugation of FP4
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP4 instance, on exit = conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_conj(FP4 *x, FP4 *y);
+/**	@brief Negative conjugation of FP4
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP4 instance, on exit = -conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_nconj(FP4 *x, FP4 *y);
+/**	@brief addition of two FP4s
+ *
+	@param x FP4 instance, on exit = y+z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_add(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief subtraction of two FP4s
+ *
+	@param x FP4 instance, on exit = y-z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_sub(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Multiplication of an FP4 by an FP2
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP2 multiplier
+ */
+extern void FP4_pmul(FP4 *x, FP4 *y, FP2 *a);
+
+
+/**	@brief Multiplication of an FP4 by an FP
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP multiplier
+ */
+extern void FP4_qmul(FP4 *x, FP4 *y, FP *a);
+
+/**	@brief Multiplication of an FP4 by a small integer
+ *
+	@param x FP4 instance, on exit = y*i
+	@param y FP4 instance
+	@param i an integer
+ */
+extern void FP4_imul(FP4 *x, FP4 *y, int i);
+/**	@brief Squaring an FP4
+ *
+	@param x FP4 instance, on exit = y^2
+	@param y FP4 instance
+ */
+extern void FP4_sqr(FP4 *x, FP4 *y);
+/**	@brief Multiplication of two FP4s
+ *
+	@param x FP4 instance, on exit = y*z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_mul(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Inverting an FP4
+ *
+	@param x FP4 instance, on exit = 1/y
+	@param y FP4 instance
+    @param h optional input hint
+ */
+extern void FP4_inv(FP4 *x, FP4 *y, FP *h);
+
+/**	@brief Divide an FP4 by 2
+ *
+	@param x FP4 instance, on exit = y/2
+	@param y FP4 instance
+ */
+extern void FP4_div2(FP4 *x, FP4 *y);
+
+
+/**	@brief Formats and outputs an FP4 to the console
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_output(FP4 *x);
+/**	@brief Formats and outputs an FP4 to the console in raw form (for debugging)
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_rawoutput(FP4 *x);
+/**	@brief multiplies an FP4 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP4 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP4_times_i(FP4 *x);
+/**	@brief Normalises the components of an FP4
+ *
+	@param x FP4 instance to be normalised
+ */
+extern void FP4_norm(FP4 *x);
+/**	@brief Reduces all components of possibly unreduced FP4 mod Modulus
+ *
+	@param x FP4 instance, on exit reduced mod Modulus
+ */
+extern void FP4_reduce(FP4 *x);
+/**	@brief Raises an FP4 to the power of a BIG
+ *
+	@param x FP4 instance, on exit = y^b
+	@param y FP4 instance
+	@param b BIG number
+ */
+extern void FP4_pow(FP4 *x, FP4 *y, B512_60::BIG b);
+/**	@brief Raises an FP4 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP4 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP4_frob(FP4 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP4 instance, on exit = w*x-conj(x)*y+z
+	@param w FP4 instance
+	@param x FP4 instance
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_xtr_A(FP4 *r, FP4 *w, FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP4 instance, on exit = x^2-2*conj(x)
+	@param x FP4 instance
+ */
+extern void FP4_xtr_D(FP4 *r, FP4 *x);
+/**	@brief Calculates FP4 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP4 instance, on exit = trace(w^b)
+	@param x FP4 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP4_xtr_pow(FP4 *r, FP4 *x, B512_60::BIG b);
+/**	@brief Calculates FP4 trace of c^a.d^b, where c and d are derived from FP4 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP4 instance, on exit = trace(c^a.d^b)
+	@param c FP4 instance, trace of an FP12
+	@param d FP4 instance, trace of an FP12
+	@param e FP4 instance, trace of an FP12
+	@param f FP4 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP4_xtr_pow2(FP4 *r, FP4 *c, FP4 *d, FP4 *e, FP4 *f, B512_60::BIG a, B512_60::BIG b);
+
+/**	@brief Test FP4 for QR
+ * 
+	@param r FP4 instance
+    @param h optional generated hint
+	@return 1 x is a QR, otherwise 0
+ */
+extern int  FP4_qr(FP4 *r, FP *h);
+
+/**	@brief Calculate square root of an FP4
+ *
+	Square root
+	@param r FP4 instance, on exit = sqrt(x)
+	@param x FP4 instance
+    @param h optional input hint
+ */
+extern void  FP4_sqrt(FP4 *r, FP4 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP4 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP4 instance, set to y if s!=0
+	@param y another FP4 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP4_cmove(FP4 *x, FP4 *y, int s);
+
+
+/**	@brief Divide FP4 number by QNR
+ *
+	Divide FP4 by the QNR
+	@param x FP4 instance
+ */
+extern void FP4_div_i(FP4 *x);
+
+/**	@brief Generate random FP4
+ *
+	@param x random FP4 number
+	@param rng random number generator
+ */
+extern void FP4_rand(FP4 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp8.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp8.cpp
new file mode 100644
index 0000000..d6a628c
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp8.cpp
@@ -0,0 +1,732 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* CORE Fp^8 functions */
+
+/* FP8 elements are of the form a+ib, where i is sqrt(sqrt(-1+sqrt(-1))) */
+
+#include "fp8_YYY.h"
+
+using namespace XXX;
+
+/* test x==0 ? */
+int YYY::FP8_iszilch(FP8 *x)
+{
+    return (FP4_iszilch(&(x->a)) & FP4_iszilch(&(x->b)));
+}
+
+/* test x==1 ? */
+int YYY::FP8_isunity(FP8 *x)
+{
+    return (FP4_isunity(&(x->a)) & FP4_iszilch(&(x->b)));
+}
+
+/* test is w real? That is in a+ib test b is zero */
+int YYY::FP8_isreal(FP8 *w)
+{
+    return FP4_iszilch(&(w->b));
+}
+
+// Is x lexically larger than p-x?
+// return -1 for no, 0 if x=0, 1 for yes
+int YYY::FP8_islarger(FP8 *x)
+{
+    int cmp;
+    if (FP8_iszilch(x)) return 0;
+    cmp=FP4_islarger(&(x->b));
+    if (cmp!=0) return cmp;
+    return FP4_islarger(&(x->a));
+}
+
+void YYY::FP8_toBytes(char *b,FP8 *x)
+{
+    FP4_toBytes(b,&(x->b));
+    FP4_toBytes(&b[4*MODBYTES_XXX],&(x->a));
+}
+
+void YYY::FP8_fromBytes(FP8 *x,char *b)
+{
+    FP4_fromBytes(&(x->b),b);
+    FP4_fromBytes(&(x->a),&b[4*MODBYTES_XXX]);
+}
+
+/* return 1 if x==y, else 0 */
+int YYY::FP8_equals(FP8 *x, FP8 *y)
+{
+    return (FP4_equals(&(x->a), &(y->a)) & FP4_equals(&(x->b), &(y->b)));
+}
+
+/* set FP8 from two FP4s */
+void YYY::FP8_from_FP4s(FP8 *w, FP4 * x, FP4* y)
+{
+    FP4_copy(&(w->a), x);
+    FP4_copy(&(w->b), y);
+}
+
+/* set FP8 from FP4 */
+void YYY::FP8_from_FP4(FP8 *w, FP4 *x)
+{
+    FP4_copy(&(w->a), x);
+    FP4_zero(&(w->b));
+}
+
+/* set high part of FP8 from FP4 */
+void YYY::FP8_from_FP4H(FP8 *w, FP4 *x)
+{
+    FP4_copy(&(w->b), x);
+    FP4_zero(&(w->a));
+}
+
+/* set FP8 from FP */
+void YYY::FP8_from_FP(FP8 *w, FP *x)
+{
+    FP2 t;
+    FP4 t4;
+    FP2_from_FP(&t, x);
+    FP4_from_FP2(&t4, &t);
+    FP8_from_FP4(w, &t4);
+}
+
+/* FP8 copy w=x */
+void YYY::FP8_copy(FP8 *w, FP8 *x)
+{
+    if (w == x) return;
+    FP4_copy(&(w->a), &(x->a));
+    FP4_copy(&(w->b), &(x->b));
+}
+
+/* FP8 w=0 */
+void YYY::FP8_zero(FP8 *w)
+{
+    FP4_zero(&(w->a));
+    FP4_zero(&(w->b));
+}
+
+/* FP8 w=1 */
+void YYY::FP8_one(FP8 *w)
+{
+    FP4_one(&(w->a));
+    FP4_zero(&(w->b));
+}
+
+int YYY::FP8_sign(FP8 *w)
+{
+    int p1,p2;
+    p1=FP4_sign(&(w->a));
+    p2=FP4_sign(&(w->b));
+#ifdef BIG_ENDIAN_SIGN_YYY
+    p2 ^= (p1 ^ p2)&FP4_iszilch(&(w->b));
+    return p2;
+#else
+    p1 ^= (p1 ^ p2)&FP4_iszilch(&(w->a));
+    return p1;
+#endif
+
+}
+
+/* Set w=-x */
+void YYY::FP8_neg(FP8 *w, FP8 *x)
+{
+    /* Just one field neg */
+    FP4 m, t;
+    FP8_norm(x);
+    FP4_add(&m, &(x->a), &(x->b));
+    FP4_norm(&m);
+    FP4_neg(&m, &m);
+    FP4_add(&t, &m, &(x->b));
+    FP4_add(&(w->b), &m, &(x->a));
+    FP4_copy(&(w->a), &t);
+    FP8_norm(w);
+}
+
+/* Set w=conj(x) */
+void YYY::FP8_conj(FP8 *w, FP8 *x)
+{
+    FP4_copy(&(w->a), &(x->a));
+    FP4_neg(&(w->b), &(x->b));
+    FP8_norm(w);
+}
+
+/* Set w=-conj(x) */
+void YYY::FP8_nconj(FP8 *w, FP8 *x)
+{
+    FP4_copy(&(w->b), &(x->b));
+    FP4_neg(&(w->a), &(x->a));
+    FP8_norm(w);
+}
+
+/* Set w=x+y */
+void YYY::FP8_add(FP8 *w, FP8 *x, FP8 *y)
+{
+    FP4_add(&(w->a), &(x->a), &(y->a));
+    FP4_add(&(w->b), &(x->b), &(y->b));
+}
+
+/* Set w=x-y */
+/* Input y MUST be normed */
+void YYY::FP8_sub(FP8 *w, FP8 *x, FP8 *y)
+{
+    FP8 my;
+
+    FP8_neg(&my, y);
+    FP8_add(w, x, &my);
+
+}
+
+/* reduce all components of w mod Modulus */
+void YYY::FP8_reduce(FP8 *w)
+{
+    FP4_reduce(&(w->a));
+    FP4_reduce(&(w->b));
+}
+
+/* normalise all elements of w */
+void YYY::FP8_norm(FP8 *w)
+{
+    FP4_norm(&(w->a));
+    FP4_norm(&(w->b));
+}
+
+/* Set w=s*x, where s is FP4 */
+void YYY::FP8_pmul(FP8 *w, FP8 *x, FP4 *s)
+{
+    FP4_mul(&(w->a), &(x->a), s);
+    FP4_mul(&(w->b), &(x->b), s);
+}
+
+/* Set w=s*x, where s is FP2 */
+void YYY::FP8_qmul(FP8 *w, FP8 *x, FP2 *s)
+{
+    FP4_pmul(&(w->a), &(x->a), s);
+    FP4_pmul(&(w->b), &(x->b), s);
+}
+
+/* Set w=s*x, where s is FP */
+void YYY::FP8_tmul(FP8 *w, FP8 *x, FP *s)
+{
+    FP4_qmul(&(w->a), &(x->a), s);
+    FP4_qmul(&(w->b), &(x->b), s);
+}
+
+/* Set w=s*x, where s is int */
+void YYY::FP8_imul(FP8 *w, FP8 *x, int s)
+{
+    FP4_imul(&(w->a), &(x->a), s);
+    FP4_imul(&(w->b), &(x->b), s);
+}
+
+/* Set w=x^2 */
+/* Input MUST be normed  */
+void YYY::FP8_sqr(FP8 *w, FP8 *x)
+{
+    FP4 t1, t2, t3;
+
+    FP4_mul(&t3, &(x->a), &(x->b)); /* norms x */
+    FP4_copy(&t2, &(x->b));
+    FP4_add(&t1, &(x->a), &(x->b));
+    FP4_times_i(&t2);
+
+    FP4_add(&t2, &(x->a), &t2);
+
+    FP4_norm(&t1);  // 2
+    FP4_norm(&t2);  // 2
+
+    FP4_mul(&(w->a), &t1, &t2);
+
+    FP4_copy(&t2, &t3);
+    FP4_times_i(&t2);
+
+    FP4_add(&t2, &t2, &t3);
+
+    FP4_norm(&t2);  // 2
+    FP4_neg(&t2, &t2);
+    FP4_add(&(w->a), &(w->a), &t2); /* a=(a+b)(a+i^2.b)-i^2.ab-ab = a*a+ib*ib */
+    FP4_add(&(w->b), &t3, &t3); /* b=2ab */
+
+    FP8_norm(w);
+}
+
+/* Set w=x*y */
+/* Inputs MUST be normed  */
+void YYY::FP8_mul(FP8 *w, FP8 *x, FP8 *y)
+{
+
+    FP4 t1, t2, t3, t4;
+
+    FP4_mul(&t1, &(x->a), &(y->a));
+    FP4_mul(&t2, &(x->b), &(y->b));
+    FP4_add(&t3, &(y->b), &(y->a));
+    FP4_add(&t4, &(x->b), &(x->a));
+
+    FP4_norm(&t4); // 2
+    FP4_norm(&t3); // 2
+
+    FP4_mul(&t4, &t4, &t3); /* (xa+xb)(ya+yb) */
+    FP4_neg(&t3, &t1); // 1
+    FP4_add(&t4, &t4, &t3); //t4E=3
+    FP4_norm(&t4);
+
+    FP4_neg(&t3, &t2); // 1
+    FP4_add(&(w->b), &t4, &t3); //wbE=3
+
+    FP4_times_i(&t2);
+    FP4_add(&(w->a), &t2, &t1);
+
+    FP8_norm(w);
+}
+
+/* output FP8 in format [a,b] */
+void YYY::FP8_output(FP8 *w)
+{
+    printf("[");
+    FP4_output(&(w->a));
+    printf(",");
+    FP4_output(&(w->b));
+    printf("]");
+}
+
+void YYY::FP8_rawoutput(FP8 *w)
+{
+    printf("[");
+    FP4_rawoutput(&(w->a));
+    printf(",");
+    FP4_rawoutput(&(w->b));
+    printf("]");
+}
+
+/* Set w=1/x */
+void YYY::FP8_inv(FP8 *w, FP8 *x, FP *h)
+{
+    FP4 t1, t2;
+    FP4_sqr(&t1, &(x->a));
+    FP4_sqr(&t2, &(x->b));
+    FP4_times_i(&t2);
+    FP4_norm(&t2);
+
+    FP4_sub(&t1, &t1, &t2);
+    FP4_norm(&t1);
+    FP4_inv(&t1, &t1, h);
+
+    FP4_mul(&(w->a), &t1, &(x->a));
+    FP4_neg(&t1, &t1);
+    FP4_norm(&t1);
+    FP4_mul(&(w->b), &t1, &(x->b));
+}
+
+/* w*=i where i = sqrt(sqrt(-1+sqrt(-1))) */
+void YYY::FP8_times_i(FP8 *w)
+{
+    FP4 s, t;
+    FP4_copy(&s, &(w->b));
+    FP4_copy(&t, &(w->a));
+    FP4_times_i(&s);
+    FP4_copy(&(w->a), &s);
+    FP4_copy(&(w->b), &t);
+    FP8_norm(w);
+#if TOWER_YYY == POSITOWER
+    FP8_neg(w, w);  // ***
+    FP8_norm(w);
+#endif
+}
+
+void YYY::FP8_times_i2(FP8 *w)
+{
+    FP4_times_i(&(w->a));
+    FP4_times_i(&(w->b));
+}
+
+/* Set w=w^p using Frobenius */
+void YYY::FP8_frob(FP8 *w, FP2 *f)
+{   // f=(i+1)^(p-3)/4
+    FP2 ff;
+    FP2_sqr(&ff, f); // (i+1)^(p-3)/2
+    FP2_mul_ip(&ff); // (i+1)^(p-1)/2
+    FP2_norm(&ff);
+    FP4_frob(&(w->a), &ff);
+    FP4_frob(&(w->b), &ff);
+    FP4_pmul(&(w->b), &(w->b), f); // times (1+i)^(p-3)/4
+    FP4_times_i(&(w->b));       // (i+1)^(p-1)/4
+}
+
+/* Set r=a^b mod m */
+/*
+void YYY::FP8_pow(FP8 *r, FP8* a, BIG b)
+{
+    FP8 w;
+    BIG z, zilch;
+    int bt;
+
+    BIG_zero(zilch);
+
+    BIG_copy(z, b);
+    FP8_copy(&w, a);
+    FP8_one(r);
+    BIG_norm(z);
+
+    while (1)
+    {
+        bt = BIG_parity(z);
+        BIG_shr(z, 1);
+        if (bt) FP8_mul(r, r, &w);
+        if (BIG_comp(z, zilch) == 0) break;
+        FP8_sqr(&w, &w);
+    }
+    FP8_reduce(r);
+}*/
+/*
+#if CURVE_SECURITY_ZZZ == 192
+*/
+/* XTR xtr_a function */
+/*
+void YYY::FP8_xtr_A(FP8 *r, FP8 *w, FP8 *x, FP8 *y, FP8 *z)
+{
+    FP8 t1, t2;
+
+    FP8_copy(r, x);
+    FP8_sub(&t1, w, y);
+    FP8_norm(&t1);
+    FP8_pmul(&t1, &t1, &(r->a));
+    FP8_add(&t2, w, y);
+    FP8_norm(&t2);
+    FP8_pmul(&t2, &t2, &(r->b));
+    FP8_times_i(&t2);
+
+    FP8_add(r, &t1, &t2);
+    FP8_add(r, r, z);
+
+    FP8_reduce(r);
+}
+*/
+/* XTR xtr_d function */
+/*
+void YYY::FP8_xtr_D(FP8 *r, FP8 *x)
+{
+    FP8 w;
+    FP8_copy(r, x);
+    FP8_conj(&w, r);
+    FP8_add(&w, &w, &w);
+    FP8_sqr(r, r);
+    FP8_norm(&w);
+    FP8_sub(r, r, &w);
+    FP8_reduce(r);    // reduce here as multiple calls trigger automatic reductions
+}
+*/
+/* r=x^n using XTR method on traces of FP24s */
+/*
+void YYY::FP8_xtr_pow(FP8 *r, FP8 *x, BIG n)
+{
+    int i, par, nb;
+    BIG v;
+    FP2 w2;
+    FP4 w4;
+    FP8 t, a, b, c, sf;
+
+    BIG_zero(v);
+    BIG_inc(v, 3);
+    BIG_norm(v);
+    FP2_from_BIG(&w2, v);
+    FP4_from_FP2(&w4, &w2);
+    FP8_from_FP4(&a, &w4);
+
+    FP8_copy(&sf, x);
+    FP8_norm(&sf);
+    FP8_copy(&b, &sf);
+    FP8_xtr_D(&c, &sf);
+
+    par = BIG_parity(n);
+    BIG_copy(v, n);
+    BIG_norm(v);
+    BIG_shr(v, 1);
+    if (par == 0)
+    {
+        BIG_dec(v, 1);
+        BIG_norm(v);
+    }
+
+    nb = BIG_nbits(v);
+    for (i = nb - 1; i >= 0; i--)
+    {
+        if (!BIG_bit(v, i))
+        {
+            FP8_copy(&t, &b);
+            FP8_conj(&sf, &sf);
+            FP8_conj(&c, &c);
+            FP8_xtr_A(&b, &a, &b, &sf, &c);
+            FP8_conj(&sf, &sf);
+            FP8_xtr_D(&c, &t);
+            FP8_xtr_D(&a, &a);
+        }
+        else
+        {
+            FP8_conj(&t, &a);
+            FP8_xtr_D(&a, &b);
+            FP8_xtr_A(&b, &c, &b, &sf, &t);
+            FP8_xtr_D(&c, &c);
+        }
+    }
+
+    if (par == 0) FP8_copy(r, &c);
+    else FP8_copy(r, &b);
+    FP8_reduce(r);
+}
+*/
+/* r=ck^a.cl^n using XTR double exponentiation method on traces of FP24s. See Stam thesis. */
+/*
+void YYY::FP8_xtr_pow2(FP8 *r, FP8 *ck, FP8 *cl, FP8 *ckml, FP8 *ckm2l, BIG a, BIG b)
+{
+    int i, f2;
+    BIG d, e, w;
+    FP8 t, cu, cv, cumv, cum2v;
+
+
+    BIG_copy(e, a);
+    BIG_copy(d, b);
+    BIG_norm(e);
+    BIG_norm(d);
+
+    FP8_copy(&cu, ck);
+    FP8_copy(&cv, cl);
+    FP8_copy(&cumv, ckml);
+    FP8_copy(&cum2v, ckm2l);
+
+    f2 = 0;
+    while (BIG_parity(d) == 0 && BIG_parity(e) == 0)
+    {
+        BIG_shr(d, 1);
+        BIG_shr(e, 1);
+        f2++;
+    }
+    while (BIG_comp(d, e) != 0)
+    {
+        if (BIG_comp(d, e) > 0)
+        {
+            BIG_imul(w, e, 4);
+            BIG_norm(w);
+            if (BIG_comp(d, w) <= 0)
+            {
+                BIG_copy(w, d);
+                BIG_copy(d, e);
+                BIG_sub(e, w, e);
+                BIG_norm(e);
+                FP8_xtr_A(&t, &cu, &cv, &cumv, &cum2v);
+                FP8_conj(&cum2v, &cumv);
+                FP8_copy(&cumv, &cv);
+                FP8_copy(&cv, &cu);
+                FP8_copy(&cu, &t);
+            }
+            else if (BIG_parity(d) == 0)
+            {
+                BIG_shr(d, 1);
+                FP8_conj(r, &cum2v);
+                FP8_xtr_A(&t, &cu, &cumv, &cv, r);
+                FP8_xtr_D(&cum2v, &cumv);
+                FP8_copy(&cumv, &t);
+                FP8_xtr_D(&cu, &cu);
+            }
+            else if (BIG_parity(e) == 1)
+            {
+                BIG_sub(d, d, e);
+                BIG_norm(d);
+                BIG_shr(d, 1);
+                FP8_xtr_A(&t, &cu, &cv, &cumv, &cum2v);
+                FP8_xtr_D(&cu, &cu);
+                FP8_xtr_D(&cum2v, &cv);
+                FP8_conj(&cum2v, &cum2v);
+                FP8_copy(&cv, &t);
+            }
+            else
+            {
+                BIG_copy(w, d);
+                BIG_copy(d, e);
+                BIG_shr(d, 1);
+                BIG_copy(e, w);
+                FP8_xtr_D(&t, &cumv);
+                FP8_conj(&cumv, &cum2v);
+                FP8_conj(&cum2v, &t);
+                FP8_xtr_D(&t, &cv);
+                FP8_copy(&cv, &cu);
+                FP8_copy(&cu, &t);
+            }
+        }
+        if (BIG_comp(d, e) < 0)
+        {
+            BIG_imul(w, d, 4);
+            BIG_norm(w);
+            if (BIG_comp(e, w) <= 0)
+            {
+                BIG_sub(e, e, d);
+                BIG_norm(e);
+                FP8_xtr_A(&t, &cu, &cv, &cumv, &cum2v);
+                FP8_copy(&cum2v, &cumv);
+                FP8_copy(&cumv, &cu);
+                FP8_copy(&cu, &t);
+            }
+            else if (BIG_parity(e) == 0)
+            {
+                BIG_copy(w, d);
+                BIG_copy(d, e);
+                BIG_shr(d, 1);
+                BIG_copy(e, w);
+                FP8_xtr_D(&t, &cumv);
+                FP8_conj(&cumv, &cum2v);
+                FP8_conj(&cum2v, &t);
+                FP8_xtr_D(&t, &cv);
+                FP8_copy(&cv, &cu);
+                FP8_copy(&cu, &t);
+            }
+            else if (BIG_parity(d) == 1)
+            {
+                BIG_copy(w, e);
+                BIG_copy(e, d);
+                BIG_sub(w, w, d);
+                BIG_norm(w);
+                BIG_copy(d, w);
+                BIG_shr(d, 1);
+                FP8_xtr_A(&t, &cu, &cv, &cumv, &cum2v);
+                FP8_conj(&cumv, &cumv);
+                FP8_xtr_D(&cum2v, &cu);
+                FP8_conj(&cum2v, &cum2v);
+                FP8_xtr_D(&cu, &cv);
+                FP8_copy(&cv, &t);
+            }
+            else
+            {
+                BIG_shr(d, 1);
+                FP8_conj(r, &cum2v);
+                FP8_xtr_A(&t, &cu, &cumv, &cv, r);
+                FP8_xtr_D(&cum2v, &cumv);
+                FP8_copy(&cumv, &t);
+                FP8_xtr_D(&cu, &cu);
+            }
+        }
+    }
+    FP8_xtr_A(r, &cu, &cv, &cumv, &cum2v);
+    for (i = 0; i < f2; i++)    FP8_xtr_D(r, r);
+    FP8_xtr_pow(r, r, d);
+}
+
+#endif
+*/
+
+/* New stuff for ECp8 support */
+
+/* Set w=x/2 */
+void YYY::FP8_div2(FP8 *w, FP8 *x)
+{
+    FP4_div2(&(w->a), &(x->a));
+    FP4_div2(&(w->b), &(x->b));
+}
+
+/* Move b to a if d=1 */
+void YYY::FP8_cmove(FP8 *f, FP8 *g, int d)
+{
+    FP4_cmove(&(f->a), &(g->a), d);
+    FP4_cmove(&(f->b), &(g->b), d);
+}
+
+void YYY::FP8_rand(FP8 *x,csprng *rng)
+{
+    FP4_rand(&(x->a),rng);
+    FP4_rand(&(x->b),rng);
+}
+
+#if PAIRING_FRIENDLY_ZZZ == BLS48_CURVE
+
+/* test for x a QR */
+int YYY::FP8_qr(FP8 *x,FP *h)
+{ /* test x^(p^4-1)/2 = 1 */
+    FP8 c;
+    FP8_conj(&c,x);
+    FP8_mul(&c,&c,x);
+
+    return FP4_qr(&(c.a),h);
+}
+
+/* sqrt(a+xb) = sqrt((a+sqrt(a*a-n*b*b))/2)+x.b/(2*sqrt((a+sqrt(a*a-n*b*b))/2)) */
+
+void YYY::FP8_sqrt(FP8 *r, FP8* x, FP *h)
+{
+    FP4 a, b, s, t;
+    FP8 nr;
+    FP hint,twk;
+    int sgn,qr;
+    FP8_copy(r, x);
+    if (FP8_iszilch(x)) return;
+
+    FP4_copy(&a, &(x->a));
+    FP4_copy(&s, &(x->b));
+
+    FP4_sqr(&s, &s); // s*=s
+    FP4_sqr(&a, &a); // a*=a
+    FP4_times_i(&s);
+    FP4_norm(&s);
+    FP4_sub(&a, &a, &s); // a-=txx(s)
+    FP4_norm(&a);  // **
+    FP4_sqrt(&s, &a, h);
+
+    FP4_copy(&t, &(x->a));
+    FP4_add(&a, &t, &s);
+    FP4_norm(&a);
+    FP4_div2(&a, &a);
+
+    FP4_div2(&b,&(r->b));                   // w1=b/2
+    qr=FP4_qr(&a,&hint);                    // only exp! Cost=+1
+
+// tweak hint - multiply old hint by Norm(1/Beta)^e where Beta is irreducible polynomial
+    FP4_copy(&s,&a);
+    FP_rcopy(&twk,TWK);
+    FP_mul(&twk,&twk,&hint);
+    FP4_div_i(&s); FP4_norm(&s); // switch to other candidate
+
+    FP4_cmove(&a,&s,1-qr);
+    FP_cmove(&hint,&twk,1-qr);
+
+    FP4_sqrt(&(r->a),&a,&hint);             // a=sqrt(w2)  Cost=+1
+    FP4_inv(&s,&a,&hint);                  // w3=1/w2
+    FP4_mul(&s,&s,&(r->a));                // w3=1/sqrt(w2)
+    FP4_mul(&(r->b),&s,&b);                // b=(b/2)*1/sqrt(w2)
+    FP4_copy(&t,&(r->a));
+
+    FP4_cmove(&(r->a),&(r->b),1-qr);
+    FP4_cmove(&(r->b),&t,1-qr);
+
+    sgn=FP8_sign(r);
+    FP8_neg(&nr,r); FP8_norm(&nr);
+    FP8_cmove(r,&nr,sgn);
+}
+
+void YYY::FP8_div_i(FP8 *f)
+{
+    FP4 u, v;
+    FP4_copy(&u, &(f->a));
+    FP4_copy(&v, &(f->b));
+
+    FP4_div_i(&u);
+
+    FP4_copy(&(f->a), &v);
+    FP4_copy(&(f->b), &u);
+#if TOWER_YYY == POSITOWER
+    FP8_neg(f, f);  // ***
+    FP8_norm(f);
+#endif
+}
+
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp8.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp8.h
new file mode 100644
index 0000000..e9ed770
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp8.h
@@ -0,0 +1,365 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP8_YYY_H
+#define FP8_YYY_H
+
+#include "fp4_YYY.h"
+#include "config_curve_ZZZ.h"
+
+using namespace core;
+
+namespace YYY {
+
+/**
+	@brief FP8 Structure - towered over two FP4
+*/
+
+typedef struct
+{
+    FP4 a; /**< real part of FP8 */
+    FP4 b; /**< imaginary part of FP8 */
+} FP8;
+
+
+/* FP8 prototypes */
+/**	@brief Tests for FP8 equal to zero
+ *
+	@param x FP8 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP8_iszilch(FP8 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP8 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP8_islarger(FP8 *x);
+
+/**	@brief Serialize in FP8  
+ *
+    @param b buffer for output
+	@param x FP8 number to be serialized
+ */
+extern void FP8_toBytes(char *b,FP8 *x);
+/**	@brief Serialize out FP8  
+ *
+	@param x FP8 number to be serialized
+    @param b buffer for input
+ */
+extern void FP8_fromBytes(FP8 *x,char *b);
+
+
+/**	@brief Tests for FP8 equal to unity
+ *
+	@param x FP8 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP8_isunity(FP8 *x);
+/**	@brief Tests for equality of two FP8s
+ *
+	@param x FP8 instance to be compared
+	@param y FP8 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP8_equals(FP8 *x, FP8 *y);
+/**	@brief Tests for FP8 having only a real part and no imaginary part
+ *
+	@param x FP8 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP8_isreal(FP8 *x);
+/**	@brief Initialise FP8 from two FP4s
+ *
+	@param x FP8 instance to be initialised
+	@param a FP4 to form real part of FP8
+	@param b FP4 to form imaginary part of FP8
+ */
+extern void FP8_from_FP4s(FP8 *x, FP4 *a, FP4 *b);
+/**	@brief Initialise FP8 from single FP4
+ *
+	Imaginary part is set to zero
+	@param x FP8 instance to be initialised
+	@param a FP4 to form real part of FP8
+ */
+extern void FP8_from_FP4(FP8 *x, FP4 *a);
+
+/**	@brief Initialise FP8 from single FP4
+ *
+	real part is set to zero
+	@param x FP8 instance to be initialised
+	@param a FP4 to form imaginary part of FP8
+ */
+extern void FP8_from_FP4H(FP8 *x, FP4 *a);
+
+/**	@brief Initialise FP8 from single FP
+ *
+	@param x FP8 instance to be initialised
+	@param a FP to form real part of FP8
+ */
+extern void FP8_from_FP(FP8 *x, FP *a);
+
+/**	@brief Copy FP8 to another FP8
+ *
+	@param x FP8 instance, on exit = y
+	@param y FP8 instance to be copied
+ */
+extern void FP8_copy(FP8 *x, FP8 *y);
+
+/**	@brief Set FP8 to zero
+ *
+	@param x FP8 instance to be set to zero
+ */
+extern void FP8_zero(FP8 *x);
+/**	@brief Set FP8 to unity
+ *
+	@param x FP8 instance to be set to one
+ */
+extern void FP8_one(FP8 *x);
+
+/**	@brief Sign of FP8
+ *
+	@param x FP8 instance
+	@return "sign" of FP8
+ */
+extern int FP8_sign(FP8 *x);
+
+/**	@brief Negation of FP8
+ *
+	@param x FP8 instance, on exit = -y
+	@param y FP8 instance
+ */
+extern void FP8_neg(FP8 *x, FP8 *y);
+/**	@brief Conjugation of FP8
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP8 instance, on exit = conj(y)
+	@param y FP8 instance
+ */
+extern void FP8_conj(FP8 *x, FP8 *y);
+/**	@brief Negative conjugation of FP8
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP8 instance, on exit = -conj(y)
+	@param y FP8 instance
+ */
+extern void FP8_nconj(FP8 *x, FP8 *y);
+/**	@brief addition of two FP8s
+ *
+	@param x FP8 instance, on exit = y+z
+	@param y FP8 instance
+	@param z FP8 instance
+ */
+extern void FP8_add(FP8 *x, FP8 *y, FP8 *z);
+/**	@brief subtraction of two FP8s
+ *
+	@param x FP8 instance, on exit = y-z
+	@param y FP8 instance
+	@param z FP8 instance
+ */
+extern void FP8_sub(FP8 *x, FP8 *y, FP8 *z);
+/**	@brief Multiplication of an FP8 by an FP4
+ *
+	@param x FP8 instance, on exit = y*a
+	@param y FP8 instance
+	@param a FP4 multiplier
+ */
+extern void FP8_pmul(FP8 *x, FP8 *y, FP4 *a);
+
+/**	@brief Multiplication of an FP8 by an FP2
+ *
+	@param x FP8 instance, on exit = y*a
+	@param y FP8 instance
+	@param a FP2 multiplier
+ */
+extern void FP8_qmul(FP8 *x, FP8 *y, FP2 *a);
+
+/**	@brief Multiplication of an FP8 by an FP
+ *
+	@param x FP8 instance, on exit = y*a
+	@param y FP8 instance
+	@param a FP multiplier
+ */
+extern void FP8_tmul(FP8 *x, FP8 *y, FP *a);
+
+
+
+/**	@brief Multiplication of an FP8 by a small integer
+ *
+	@param x FP8 instance, on exit = y*i
+	@param y FP8 instance
+	@param i an integer
+ */
+extern void FP8_imul(FP8 *x, FP8 *y, int i);
+/**	@brief Squaring an FP8
+ *
+	@param x FP8 instance, on exit = y^2
+	@param y FP8 instance
+ */
+extern void FP8_sqr(FP8 *x, FP8 *y);
+/**	@brief Multiplication of two FP8s
+ *
+	@param x FP8 instance, on exit = y*z
+	@param y FP8 instance
+	@param z FP8 instance
+ */
+extern void FP8_mul(FP8 *x, FP8 *y, FP8 *z);
+/**	@brief Inverting an FP8
+ *
+	@param x FP8 instance, on exit = 1/y
+	@param y FP8 instance
+    @param h optional input hint
+ */
+extern void FP8_inv(FP8 *x, FP8 *y, FP *h);
+/**	@brief Formats and outputs an FP8 to the console
+ *
+	@param x FP8 instance to be printed
+ */
+extern void FP8_output(FP8 *x);
+/**	@brief Divide an FP8 by 2
+ *
+	@param x FP8 instance, on exit = y/2
+	@param y FP8 instance
+ */
+extern void FP8_div2(FP8 *x, FP8 *y);
+
+/**	@brief Formats and outputs an FP8 to the console in raw form (for debugging)
+ *
+	@param x FP8 instance to be printed
+ */
+extern void FP8_rawoutput(FP8 *x);
+/**	@brief multiplies an FP8 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP8 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP8_times_i(FP8 *x);
+/**	@brief multiplies an FP8 instance by irreducible polynomial (1+sqrt(-1))
+ *
+	@param x FP8 instance, on exit = (1+sqrt(-1)*x
+ */
+extern void FP8_times_i2(FP8 *x);
+
+/**	@brief Normalises the components of an FP8
+ *
+	@param x FP8 instance to be normalised
+ */
+extern void FP8_norm(FP8 *x);
+/**	@brief Reduces all components of possibly unreduced FP8 mod Modulus
+ *
+	@param x FP8 instance, on exit reduced mod Modulus
+ */
+extern void FP8_reduce(FP8 *x);
+/**	@brief Raises an FP8 to the power of a BIG
+ *
+	@param x FP8 instance, on exit = y^b
+	@param y FP8 instance
+	@param b BIG number
+ */
+extern void FP8_pow(FP8 *x, FP8 *y, XXX::BIG b);
+/**	@brief Raises an FP8 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP8 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP8_frob(FP8 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP8 instance, on exit = w*x-conj(x)*y+z
+	@param w FP8 instance
+	@param x FP8 instance
+	@param y FP8 instance
+	@param z FP8 instance
+ */
+extern void FP8_xtr_A(FP8 *r, FP8 *w, FP8 *x, FP8 *y, FP8 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP8 instance, on exit = x^2-2*conj(x)
+	@param x FP8 instance
+ */
+extern void FP8_xtr_D(FP8 *r, FP8 *x);
+/**	@brief Calculates FP8 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP8 instance, on exit = trace(w^b)
+	@param x FP8 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP8_xtr_pow(FP8 *r, FP8 *x, XXX::BIG b);
+/**	@brief Calculates FP8 trace of c^a.d^b, where c and d are derived from FP8 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP8 instance, on exit = trace(c^a.d^b)
+	@param c FP8 instance, trace of an FP12
+	@param d FP8 instance, trace of an FP12
+	@param e FP8 instance, trace of an FP12
+	@param f FP8 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP8_xtr_pow2(FP8 *r, FP8 *c, FP8 *d, FP8 *e, FP8 *f, XXX::BIG a, XXX::BIG b);
+
+/**	@brief Test FP8 for QR
+ *
+	Square root
+	@param r FP8 instance
+    @param h optional generated hint
+	@return 1 r is a QR, otherwise 0
+ */
+extern int  FP8_qr(FP8 *r, FP *h);
+
+
+/**	@brief Calculate square root of an FP8
+ *
+	Square root
+	@param r FP8 instance, on exit = sqrt(x)
+	@param x FP8 instance
+    @param h optional input hint
+ */
+extern void  FP8_sqrt(FP8 *r, FP8 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP8 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP8 instance, set to y if s!=0
+	@param y another FP8 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP8_cmove(FP8 *x, FP8 *y, int s);
+
+
+/**	@brief Divide FP8 number by QNR
+ *
+	Divide FP8 by the QNR
+	@param x FP8 instance
+ */
+extern void FP8_div_i(FP8 *x);
+
+/**	@brief Generate random FP8
+ *
+	@param x random FP8 number
+	@param rng random number generator
+ */
+extern void FP8_rand(FP8 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp8_BLS24479.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp8_BLS24479.h
new file mode 100644
index 0000000..03ebc33
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp8_BLS24479.h
@@ -0,0 +1,365 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP8_BLS24479_H
+#define FP8_BLS24479_H
+
+#include "fp4_BLS24479.h"
+#include "config_curve_BLS24479.h"
+
+using namespace core;
+
+namespace BLS24479 {
+
+/**
+	@brief FP8 Structure - towered over two FP4
+*/
+
+typedef struct
+{
+    FP4 a; /**< real part of FP8 */
+    FP4 b; /**< imaginary part of FP8 */
+} FP8;
+
+
+/* FP8 prototypes */
+/**	@brief Tests for FP8 equal to zero
+ *
+	@param x FP8 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP8_iszilch(FP8 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP8 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP8_islarger(FP8 *x);
+
+/**	@brief Serialize in FP8  
+ *
+    @param b buffer for output
+	@param x FP8 number to be serialized
+ */
+extern void FP8_toBytes(char *b,FP8 *x);
+/**	@brief Serialize out FP8  
+ *
+	@param x FP8 number to be serialized
+    @param b buffer for input
+ */
+extern void FP8_fromBytes(FP8 *x,char *b);
+
+
+/**	@brief Tests for FP8 equal to unity
+ *
+	@param x FP8 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP8_isunity(FP8 *x);
+/**	@brief Tests for equality of two FP8s
+ *
+	@param x FP8 instance to be compared
+	@param y FP8 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP8_equals(FP8 *x, FP8 *y);
+/**	@brief Tests for FP8 having only a real part and no imaginary part
+ *
+	@param x FP8 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP8_isreal(FP8 *x);
+/**	@brief Initialise FP8 from two FP4s
+ *
+	@param x FP8 instance to be initialised
+	@param a FP4 to form real part of FP8
+	@param b FP4 to form imaginary part of FP8
+ */
+extern void FP8_from_FP4s(FP8 *x, FP4 *a, FP4 *b);
+/**	@brief Initialise FP8 from single FP4
+ *
+	Imaginary part is set to zero
+	@param x FP8 instance to be initialised
+	@param a FP4 to form real part of FP8
+ */
+extern void FP8_from_FP4(FP8 *x, FP4 *a);
+
+/**	@brief Initialise FP8 from single FP4
+ *
+	real part is set to zero
+	@param x FP8 instance to be initialised
+	@param a FP4 to form imaginary part of FP8
+ */
+extern void FP8_from_FP4H(FP8 *x, FP4 *a);
+
+/**	@brief Initialise FP8 from single FP
+ *
+	@param x FP8 instance to be initialised
+	@param a FP to form real part of FP8
+ */
+extern void FP8_from_FP(FP8 *x, FP *a);
+
+/**	@brief Copy FP8 to another FP8
+ *
+	@param x FP8 instance, on exit = y
+	@param y FP8 instance to be copied
+ */
+extern void FP8_copy(FP8 *x, FP8 *y);
+
+/**	@brief Set FP8 to zero
+ *
+	@param x FP8 instance to be set to zero
+ */
+extern void FP8_zero(FP8 *x);
+/**	@brief Set FP8 to unity
+ *
+	@param x FP8 instance to be set to one
+ */
+extern void FP8_one(FP8 *x);
+
+/**	@brief Sign of FP8
+ *
+	@param x FP8 instance
+	@return "sign" of FP8
+ */
+extern int FP8_sign(FP8 *x);
+
+/**	@brief Negation of FP8
+ *
+	@param x FP8 instance, on exit = -y
+	@param y FP8 instance
+ */
+extern void FP8_neg(FP8 *x, FP8 *y);
+/**	@brief Conjugation of FP8
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP8 instance, on exit = conj(y)
+	@param y FP8 instance
+ */
+extern void FP8_conj(FP8 *x, FP8 *y);
+/**	@brief Negative conjugation of FP8
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP8 instance, on exit = -conj(y)
+	@param y FP8 instance
+ */
+extern void FP8_nconj(FP8 *x, FP8 *y);
+/**	@brief addition of two FP8s
+ *
+	@param x FP8 instance, on exit = y+z
+	@param y FP8 instance
+	@param z FP8 instance
+ */
+extern void FP8_add(FP8 *x, FP8 *y, FP8 *z);
+/**	@brief subtraction of two FP8s
+ *
+	@param x FP8 instance, on exit = y-z
+	@param y FP8 instance
+	@param z FP8 instance
+ */
+extern void FP8_sub(FP8 *x, FP8 *y, FP8 *z);
+/**	@brief Multiplication of an FP8 by an FP4
+ *
+	@param x FP8 instance, on exit = y*a
+	@param y FP8 instance
+	@param a FP4 multiplier
+ */
+extern void FP8_pmul(FP8 *x, FP8 *y, FP4 *a);
+
+/**	@brief Multiplication of an FP8 by an FP2
+ *
+	@param x FP8 instance, on exit = y*a
+	@param y FP8 instance
+	@param a FP2 multiplier
+ */
+extern void FP8_qmul(FP8 *x, FP8 *y, FP2 *a);
+
+/**	@brief Multiplication of an FP8 by an FP
+ *
+	@param x FP8 instance, on exit = y*a
+	@param y FP8 instance
+	@param a FP multiplier
+ */
+extern void FP8_tmul(FP8 *x, FP8 *y, FP *a);
+
+
+
+/**	@brief Multiplication of an FP8 by a small integer
+ *
+	@param x FP8 instance, on exit = y*i
+	@param y FP8 instance
+	@param i an integer
+ */
+extern void FP8_imul(FP8 *x, FP8 *y, int i);
+/**	@brief Squaring an FP8
+ *
+	@param x FP8 instance, on exit = y^2
+	@param y FP8 instance
+ */
+extern void FP8_sqr(FP8 *x, FP8 *y);
+/**	@brief Multiplication of two FP8s
+ *
+	@param x FP8 instance, on exit = y*z
+	@param y FP8 instance
+	@param z FP8 instance
+ */
+extern void FP8_mul(FP8 *x, FP8 *y, FP8 *z);
+/**	@brief Inverting an FP8
+ *
+	@param x FP8 instance, on exit = 1/y
+	@param y FP8 instance
+    @param h optional input hint
+ */
+extern void FP8_inv(FP8 *x, FP8 *y, FP *h);
+/**	@brief Formats and outputs an FP8 to the console
+ *
+	@param x FP8 instance to be printed
+ */
+extern void FP8_output(FP8 *x);
+/**	@brief Divide an FP8 by 2
+ *
+	@param x FP8 instance, on exit = y/2
+	@param y FP8 instance
+ */
+extern void FP8_div2(FP8 *x, FP8 *y);
+
+/**	@brief Formats and outputs an FP8 to the console in raw form (for debugging)
+ *
+	@param x FP8 instance to be printed
+ */
+extern void FP8_rawoutput(FP8 *x);
+/**	@brief multiplies an FP8 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP8 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP8_times_i(FP8 *x);
+/**	@brief multiplies an FP8 instance by irreducible polynomial (1+sqrt(-1))
+ *
+	@param x FP8 instance, on exit = (1+sqrt(-1)*x
+ */
+extern void FP8_times_i2(FP8 *x);
+
+/**	@brief Normalises the components of an FP8
+ *
+	@param x FP8 instance to be normalised
+ */
+extern void FP8_norm(FP8 *x);
+/**	@brief Reduces all components of possibly unreduced FP8 mod Modulus
+ *
+	@param x FP8 instance, on exit reduced mod Modulus
+ */
+extern void FP8_reduce(FP8 *x);
+/**	@brief Raises an FP8 to the power of a BIG
+ *
+	@param x FP8 instance, on exit = y^b
+	@param y FP8 instance
+	@param b BIG number
+ */
+extern void FP8_pow(FP8 *x, FP8 *y, B480_56::BIG b);
+/**	@brief Raises an FP8 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP8 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP8_frob(FP8 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP8 instance, on exit = w*x-conj(x)*y+z
+	@param w FP8 instance
+	@param x FP8 instance
+	@param y FP8 instance
+	@param z FP8 instance
+ */
+extern void FP8_xtr_A(FP8 *r, FP8 *w, FP8 *x, FP8 *y, FP8 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP8 instance, on exit = x^2-2*conj(x)
+	@param x FP8 instance
+ */
+extern void FP8_xtr_D(FP8 *r, FP8 *x);
+/**	@brief Calculates FP8 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP8 instance, on exit = trace(w^b)
+	@param x FP8 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP8_xtr_pow(FP8 *r, FP8 *x, B480_56::BIG b);
+/**	@brief Calculates FP8 trace of c^a.d^b, where c and d are derived from FP8 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP8 instance, on exit = trace(c^a.d^b)
+	@param c FP8 instance, trace of an FP12
+	@param d FP8 instance, trace of an FP12
+	@param e FP8 instance, trace of an FP12
+	@param f FP8 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP8_xtr_pow2(FP8 *r, FP8 *c, FP8 *d, FP8 *e, FP8 *f, B480_56::BIG a, B480_56::BIG b);
+
+/**	@brief Test FP8 for QR
+ *
+	Square root
+	@param r FP8 instance
+    @param h optional generated hint
+	@return 1 r is a QR, otherwise 0
+ */
+extern int  FP8_qr(FP8 *r, FP *h);
+
+
+/**	@brief Calculate square root of an FP8
+ *
+	Square root
+	@param r FP8 instance, on exit = sqrt(x)
+	@param x FP8 instance
+    @param h optional input hint
+ */
+extern void  FP8_sqrt(FP8 *r, FP8 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP8 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP8 instance, set to y if s!=0
+	@param y another FP8 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP8_cmove(FP8 *x, FP8 *y, int s);
+
+
+/**	@brief Divide FP8 number by QNR
+ *
+	Divide FP8 by the QNR
+	@param x FP8 instance
+ */
+extern void FP8_div_i(FP8 *x);
+
+/**	@brief Generate random FP8
+ *
+	@param x random FP8 number
+	@param rng random number generator
+ */
+extern void FP8_rand(FP8 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp8_BLS48286.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp8_BLS48286.h
new file mode 100644
index 0000000..36279fb
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp8_BLS48286.h
@@ -0,0 +1,365 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP8_BLS48286_H
+#define FP8_BLS48286_H
+
+#include "fp4_BLS48286.h"
+#include "config_curve_BLS48286.h"
+
+using namespace core;
+
+namespace BLS48286 {
+
+/**
+	@brief FP8 Structure - towered over two FP4
+*/
+
+typedef struct
+{
+    FP4 a; /**< real part of FP8 */
+    FP4 b; /**< imaginary part of FP8 */
+} FP8;
+
+
+/* FP8 prototypes */
+/**	@brief Tests for FP8 equal to zero
+ *
+	@param x FP8 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP8_iszilch(FP8 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP8 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP8_islarger(FP8 *x);
+
+/**	@brief Serialize in FP8  
+ *
+    @param b buffer for output
+	@param x FP8 number to be serialized
+ */
+extern void FP8_toBytes(char *b,FP8 *x);
+/**	@brief Serialize out FP8  
+ *
+	@param x FP8 number to be serialized
+    @param b buffer for input
+ */
+extern void FP8_fromBytes(FP8 *x,char *b);
+
+
+/**	@brief Tests for FP8 equal to unity
+ *
+	@param x FP8 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP8_isunity(FP8 *x);
+/**	@brief Tests for equality of two FP8s
+ *
+	@param x FP8 instance to be compared
+	@param y FP8 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP8_equals(FP8 *x, FP8 *y);
+/**	@brief Tests for FP8 having only a real part and no imaginary part
+ *
+	@param x FP8 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP8_isreal(FP8 *x);
+/**	@brief Initialise FP8 from two FP4s
+ *
+	@param x FP8 instance to be initialised
+	@param a FP4 to form real part of FP8
+	@param b FP4 to form imaginary part of FP8
+ */
+extern void FP8_from_FP4s(FP8 *x, FP4 *a, FP4 *b);
+/**	@brief Initialise FP8 from single FP4
+ *
+	Imaginary part is set to zero
+	@param x FP8 instance to be initialised
+	@param a FP4 to form real part of FP8
+ */
+extern void FP8_from_FP4(FP8 *x, FP4 *a);
+
+/**	@brief Initialise FP8 from single FP4
+ *
+	real part is set to zero
+	@param x FP8 instance to be initialised
+	@param a FP4 to form imaginary part of FP8
+ */
+extern void FP8_from_FP4H(FP8 *x, FP4 *a);
+
+/**	@brief Initialise FP8 from single FP
+ *
+	@param x FP8 instance to be initialised
+	@param a FP to form real part of FP8
+ */
+extern void FP8_from_FP(FP8 *x, FP *a);
+
+/**	@brief Copy FP8 to another FP8
+ *
+	@param x FP8 instance, on exit = y
+	@param y FP8 instance to be copied
+ */
+extern void FP8_copy(FP8 *x, FP8 *y);
+
+/**	@brief Set FP8 to zero
+ *
+	@param x FP8 instance to be set to zero
+ */
+extern void FP8_zero(FP8 *x);
+/**	@brief Set FP8 to unity
+ *
+	@param x FP8 instance to be set to one
+ */
+extern void FP8_one(FP8 *x);
+
+/**	@brief Sign of FP8
+ *
+	@param x FP8 instance
+	@return "sign" of FP8
+ */
+extern int FP8_sign(FP8 *x);
+
+/**	@brief Negation of FP8
+ *
+	@param x FP8 instance, on exit = -y
+	@param y FP8 instance
+ */
+extern void FP8_neg(FP8 *x, FP8 *y);
+/**	@brief Conjugation of FP8
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP8 instance, on exit = conj(y)
+	@param y FP8 instance
+ */
+extern void FP8_conj(FP8 *x, FP8 *y);
+/**	@brief Negative conjugation of FP8
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP8 instance, on exit = -conj(y)
+	@param y FP8 instance
+ */
+extern void FP8_nconj(FP8 *x, FP8 *y);
+/**	@brief addition of two FP8s
+ *
+	@param x FP8 instance, on exit = y+z
+	@param y FP8 instance
+	@param z FP8 instance
+ */
+extern void FP8_add(FP8 *x, FP8 *y, FP8 *z);
+/**	@brief subtraction of two FP8s
+ *
+	@param x FP8 instance, on exit = y-z
+	@param y FP8 instance
+	@param z FP8 instance
+ */
+extern void FP8_sub(FP8 *x, FP8 *y, FP8 *z);
+/**	@brief Multiplication of an FP8 by an FP4
+ *
+	@param x FP8 instance, on exit = y*a
+	@param y FP8 instance
+	@param a FP4 multiplier
+ */
+extern void FP8_pmul(FP8 *x, FP8 *y, FP4 *a);
+
+/**	@brief Multiplication of an FP8 by an FP2
+ *
+	@param x FP8 instance, on exit = y*a
+	@param y FP8 instance
+	@param a FP2 multiplier
+ */
+extern void FP8_qmul(FP8 *x, FP8 *y, FP2 *a);
+
+/**	@brief Multiplication of an FP8 by an FP
+ *
+	@param x FP8 instance, on exit = y*a
+	@param y FP8 instance
+	@param a FP multiplier
+ */
+extern void FP8_tmul(FP8 *x, FP8 *y, FP *a);
+
+
+
+/**	@brief Multiplication of an FP8 by a small integer
+ *
+	@param x FP8 instance, on exit = y*i
+	@param y FP8 instance
+	@param i an integer
+ */
+extern void FP8_imul(FP8 *x, FP8 *y, int i);
+/**	@brief Squaring an FP8
+ *
+	@param x FP8 instance, on exit = y^2
+	@param y FP8 instance
+ */
+extern void FP8_sqr(FP8 *x, FP8 *y);
+/**	@brief Multiplication of two FP8s
+ *
+	@param x FP8 instance, on exit = y*z
+	@param y FP8 instance
+	@param z FP8 instance
+ */
+extern void FP8_mul(FP8 *x, FP8 *y, FP8 *z);
+/**	@brief Inverting an FP8
+ *
+	@param x FP8 instance, on exit = 1/y
+	@param y FP8 instance
+    @param h optional input hint
+ */
+extern void FP8_inv(FP8 *x, FP8 *y, FP *h);
+/**	@brief Formats and outputs an FP8 to the console
+ *
+	@param x FP8 instance to be printed
+ */
+extern void FP8_output(FP8 *x);
+/**	@brief Divide an FP8 by 2
+ *
+	@param x FP8 instance, on exit = y/2
+	@param y FP8 instance
+ */
+extern void FP8_div2(FP8 *x, FP8 *y);
+
+/**	@brief Formats and outputs an FP8 to the console in raw form (for debugging)
+ *
+	@param x FP8 instance to be printed
+ */
+extern void FP8_rawoutput(FP8 *x);
+/**	@brief multiplies an FP8 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP8 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP8_times_i(FP8 *x);
+/**	@brief multiplies an FP8 instance by irreducible polynomial (1+sqrt(-1))
+ *
+	@param x FP8 instance, on exit = (1+sqrt(-1)*x
+ */
+extern void FP8_times_i2(FP8 *x);
+
+/**	@brief Normalises the components of an FP8
+ *
+	@param x FP8 instance to be normalised
+ */
+extern void FP8_norm(FP8 *x);
+/**	@brief Reduces all components of possibly unreduced FP8 mod Modulus
+ *
+	@param x FP8 instance, on exit reduced mod Modulus
+ */
+extern void FP8_reduce(FP8 *x);
+/**	@brief Raises an FP8 to the power of a BIG
+ *
+	@param x FP8 instance, on exit = y^b
+	@param y FP8 instance
+	@param b BIG number
+ */
+extern void FP8_pow(FP8 *x, FP8 *y, B288_60::BIG b);
+/**	@brief Raises an FP8 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP8 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP8_frob(FP8 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP8 instance, on exit = w*x-conj(x)*y+z
+	@param w FP8 instance
+	@param x FP8 instance
+	@param y FP8 instance
+	@param z FP8 instance
+ */
+extern void FP8_xtr_A(FP8 *r, FP8 *w, FP8 *x, FP8 *y, FP8 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP8 instance, on exit = x^2-2*conj(x)
+	@param x FP8 instance
+ */
+extern void FP8_xtr_D(FP8 *r, FP8 *x);
+/**	@brief Calculates FP8 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP8 instance, on exit = trace(w^b)
+	@param x FP8 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP8_xtr_pow(FP8 *r, FP8 *x, B288_60::BIG b);
+/**	@brief Calculates FP8 trace of c^a.d^b, where c and d are derived from FP8 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP8 instance, on exit = trace(c^a.d^b)
+	@param c FP8 instance, trace of an FP12
+	@param d FP8 instance, trace of an FP12
+	@param e FP8 instance, trace of an FP12
+	@param f FP8 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP8_xtr_pow2(FP8 *r, FP8 *c, FP8 *d, FP8 *e, FP8 *f, B288_60::BIG a, B288_60::BIG b);
+
+/**	@brief Test FP8 for QR
+ *
+	Square root
+	@param r FP8 instance
+    @param h optional generated hint
+	@return 1 r is a QR, otherwise 0
+ */
+extern int  FP8_qr(FP8 *r, FP *h);
+
+
+/**	@brief Calculate square root of an FP8
+ *
+	Square root
+	@param r FP8 instance, on exit = sqrt(x)
+	@param x FP8 instance
+    @param h optional input hint
+ */
+extern void  FP8_sqrt(FP8 *r, FP8 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP8 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP8 instance, set to y if s!=0
+	@param y another FP8 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP8_cmove(FP8 *x, FP8 *y, int s);
+
+
+/**	@brief Divide FP8 number by QNR
+ *
+	Divide FP8 by the QNR
+	@param x FP8 instance
+ */
+extern void FP8_div_i(FP8 *x);
+
+/**	@brief Generate random FP8
+ *
+	@param x random FP8 number
+	@param rng random number generator
+ */
+extern void FP8_rand(FP8 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp8_BLS48556.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp8_BLS48556.h
new file mode 100644
index 0000000..c6d00fe
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp8_BLS48556.h
@@ -0,0 +1,365 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP8_BLS48556_H
+#define FP8_BLS48556_H
+
+#include "fp4_BLS48556.h"
+#include "config_curve_BLS48556.h"
+
+using namespace core;
+
+namespace BLS48556 {
+
+/**
+	@brief FP8 Structure - towered over two FP4
+*/
+
+typedef struct
+{
+    FP4 a; /**< real part of FP8 */
+    FP4 b; /**< imaginary part of FP8 */
+} FP8;
+
+
+/* FP8 prototypes */
+/**	@brief Tests for FP8 equal to zero
+ *
+	@param x FP8 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP8_iszilch(FP8 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP8 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP8_islarger(FP8 *x);
+
+/**	@brief Serialize in FP8  
+ *
+    @param b buffer for output
+	@param x FP8 number to be serialized
+ */
+extern void FP8_toBytes(char *b,FP8 *x);
+/**	@brief Serialize out FP8  
+ *
+	@param x FP8 number to be serialized
+    @param b buffer for input
+ */
+extern void FP8_fromBytes(FP8 *x,char *b);
+
+
+/**	@brief Tests for FP8 equal to unity
+ *
+	@param x FP8 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP8_isunity(FP8 *x);
+/**	@brief Tests for equality of two FP8s
+ *
+	@param x FP8 instance to be compared
+	@param y FP8 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP8_equals(FP8 *x, FP8 *y);
+/**	@brief Tests for FP8 having only a real part and no imaginary part
+ *
+	@param x FP8 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP8_isreal(FP8 *x);
+/**	@brief Initialise FP8 from two FP4s
+ *
+	@param x FP8 instance to be initialised
+	@param a FP4 to form real part of FP8
+	@param b FP4 to form imaginary part of FP8
+ */
+extern void FP8_from_FP4s(FP8 *x, FP4 *a, FP4 *b);
+/**	@brief Initialise FP8 from single FP4
+ *
+	Imaginary part is set to zero
+	@param x FP8 instance to be initialised
+	@param a FP4 to form real part of FP8
+ */
+extern void FP8_from_FP4(FP8 *x, FP4 *a);
+
+/**	@brief Initialise FP8 from single FP4
+ *
+	real part is set to zero
+	@param x FP8 instance to be initialised
+	@param a FP4 to form imaginary part of FP8
+ */
+extern void FP8_from_FP4H(FP8 *x, FP4 *a);
+
+/**	@brief Initialise FP8 from single FP
+ *
+	@param x FP8 instance to be initialised
+	@param a FP to form real part of FP8
+ */
+extern void FP8_from_FP(FP8 *x, FP *a);
+
+/**	@brief Copy FP8 to another FP8
+ *
+	@param x FP8 instance, on exit = y
+	@param y FP8 instance to be copied
+ */
+extern void FP8_copy(FP8 *x, FP8 *y);
+
+/**	@brief Set FP8 to zero
+ *
+	@param x FP8 instance to be set to zero
+ */
+extern void FP8_zero(FP8 *x);
+/**	@brief Set FP8 to unity
+ *
+	@param x FP8 instance to be set to one
+ */
+extern void FP8_one(FP8 *x);
+
+/**	@brief Sign of FP8
+ *
+	@param x FP8 instance
+	@return "sign" of FP8
+ */
+extern int FP8_sign(FP8 *x);
+
+/**	@brief Negation of FP8
+ *
+	@param x FP8 instance, on exit = -y
+	@param y FP8 instance
+ */
+extern void FP8_neg(FP8 *x, FP8 *y);
+/**	@brief Conjugation of FP8
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP8 instance, on exit = conj(y)
+	@param y FP8 instance
+ */
+extern void FP8_conj(FP8 *x, FP8 *y);
+/**	@brief Negative conjugation of FP8
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP8 instance, on exit = -conj(y)
+	@param y FP8 instance
+ */
+extern void FP8_nconj(FP8 *x, FP8 *y);
+/**	@brief addition of two FP8s
+ *
+	@param x FP8 instance, on exit = y+z
+	@param y FP8 instance
+	@param z FP8 instance
+ */
+extern void FP8_add(FP8 *x, FP8 *y, FP8 *z);
+/**	@brief subtraction of two FP8s
+ *
+	@param x FP8 instance, on exit = y-z
+	@param y FP8 instance
+	@param z FP8 instance
+ */
+extern void FP8_sub(FP8 *x, FP8 *y, FP8 *z);
+/**	@brief Multiplication of an FP8 by an FP4
+ *
+	@param x FP8 instance, on exit = y*a
+	@param y FP8 instance
+	@param a FP4 multiplier
+ */
+extern void FP8_pmul(FP8 *x, FP8 *y, FP4 *a);
+
+/**	@brief Multiplication of an FP8 by an FP2
+ *
+	@param x FP8 instance, on exit = y*a
+	@param y FP8 instance
+	@param a FP2 multiplier
+ */
+extern void FP8_qmul(FP8 *x, FP8 *y, FP2 *a);
+
+/**	@brief Multiplication of an FP8 by an FP
+ *
+	@param x FP8 instance, on exit = y*a
+	@param y FP8 instance
+	@param a FP multiplier
+ */
+extern void FP8_tmul(FP8 *x, FP8 *y, FP *a);
+
+
+
+/**	@brief Multiplication of an FP8 by a small integer
+ *
+	@param x FP8 instance, on exit = y*i
+	@param y FP8 instance
+	@param i an integer
+ */
+extern void FP8_imul(FP8 *x, FP8 *y, int i);
+/**	@brief Squaring an FP8
+ *
+	@param x FP8 instance, on exit = y^2
+	@param y FP8 instance
+ */
+extern void FP8_sqr(FP8 *x, FP8 *y);
+/**	@brief Multiplication of two FP8s
+ *
+	@param x FP8 instance, on exit = y*z
+	@param y FP8 instance
+	@param z FP8 instance
+ */
+extern void FP8_mul(FP8 *x, FP8 *y, FP8 *z);
+/**	@brief Inverting an FP8
+ *
+	@param x FP8 instance, on exit = 1/y
+	@param y FP8 instance
+    @param h optional input hint
+ */
+extern void FP8_inv(FP8 *x, FP8 *y, FP *h);
+/**	@brief Formats and outputs an FP8 to the console
+ *
+	@param x FP8 instance to be printed
+ */
+extern void FP8_output(FP8 *x);
+/**	@brief Divide an FP8 by 2
+ *
+	@param x FP8 instance, on exit = y/2
+	@param y FP8 instance
+ */
+extern void FP8_div2(FP8 *x, FP8 *y);
+
+/**	@brief Formats and outputs an FP8 to the console in raw form (for debugging)
+ *
+	@param x FP8 instance to be printed
+ */
+extern void FP8_rawoutput(FP8 *x);
+/**	@brief multiplies an FP8 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP8 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP8_times_i(FP8 *x);
+/**	@brief multiplies an FP8 instance by irreducible polynomial (1+sqrt(-1))
+ *
+	@param x FP8 instance, on exit = (1+sqrt(-1)*x
+ */
+extern void FP8_times_i2(FP8 *x);
+
+/**	@brief Normalises the components of an FP8
+ *
+	@param x FP8 instance to be normalised
+ */
+extern void FP8_norm(FP8 *x);
+/**	@brief Reduces all components of possibly unreduced FP8 mod Modulus
+ *
+	@param x FP8 instance, on exit reduced mod Modulus
+ */
+extern void FP8_reduce(FP8 *x);
+/**	@brief Raises an FP8 to the power of a BIG
+ *
+	@param x FP8 instance, on exit = y^b
+	@param y FP8 instance
+	@param b BIG number
+ */
+extern void FP8_pow(FP8 *x, FP8 *y, B560_58::BIG b);
+/**	@brief Raises an FP8 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP8 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP8_frob(FP8 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP8 instance, on exit = w*x-conj(x)*y+z
+	@param w FP8 instance
+	@param x FP8 instance
+	@param y FP8 instance
+	@param z FP8 instance
+ */
+extern void FP8_xtr_A(FP8 *r, FP8 *w, FP8 *x, FP8 *y, FP8 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP8 instance, on exit = x^2-2*conj(x)
+	@param x FP8 instance
+ */
+extern void FP8_xtr_D(FP8 *r, FP8 *x);
+/**	@brief Calculates FP8 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP8 instance, on exit = trace(w^b)
+	@param x FP8 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP8_xtr_pow(FP8 *r, FP8 *x, B560_58::BIG b);
+/**	@brief Calculates FP8 trace of c^a.d^b, where c and d are derived from FP8 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP8 instance, on exit = trace(c^a.d^b)
+	@param c FP8 instance, trace of an FP12
+	@param d FP8 instance, trace of an FP12
+	@param e FP8 instance, trace of an FP12
+	@param f FP8 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP8_xtr_pow2(FP8 *r, FP8 *c, FP8 *d, FP8 *e, FP8 *f, B560_58::BIG a, B560_58::BIG b);
+
+/**	@brief Test FP8 for QR
+ *
+	Square root
+	@param r FP8 instance
+    @param h optional generated hint
+	@return 1 r is a QR, otherwise 0
+ */
+extern int  FP8_qr(FP8 *r, FP *h);
+
+
+/**	@brief Calculate square root of an FP8
+ *
+	Square root
+	@param r FP8 instance, on exit = sqrt(x)
+	@param x FP8 instance
+    @param h optional input hint
+ */
+extern void  FP8_sqrt(FP8 *r, FP8 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP8 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP8 instance, set to y if s!=0
+	@param y another FP8 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP8_cmove(FP8 *x, FP8 *y, int s);
+
+
+/**	@brief Divide FP8 number by QNR
+ *
+	Divide FP8 by the QNR
+	@param x FP8 instance
+ */
+extern void FP8_div_i(FP8 *x);
+
+/**	@brief Generate random FP8
+ *
+	@param x random FP8 number
+	@param rng random number generator
+ */
+extern void FP8_rand(FP8 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp8_BLS48581.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp8_BLS48581.h
new file mode 100644
index 0000000..91c6ff6
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp8_BLS48581.h
@@ -0,0 +1,365 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP8_BLS48581_H
+#define FP8_BLS48581_H
+
+#include "fp4_BLS48581.h"
+#include "config_curve_BLS48581.h"
+
+using namespace core;
+
+namespace BLS48581 {
+
+/**
+	@brief FP8 Structure - towered over two FP4
+*/
+
+typedef struct
+{
+    FP4 a; /**< real part of FP8 */
+    FP4 b; /**< imaginary part of FP8 */
+} FP8;
+
+
+/* FP8 prototypes */
+/**	@brief Tests for FP8 equal to zero
+ *
+	@param x FP8 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP8_iszilch(FP8 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP8 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP8_islarger(FP8 *x);
+
+/**	@brief Serialize in FP8  
+ *
+    @param b buffer for output
+	@param x FP8 number to be serialized
+ */
+extern void FP8_toBytes(char *b,FP8 *x);
+/**	@brief Serialize out FP8  
+ *
+	@param x FP8 number to be serialized
+    @param b buffer for input
+ */
+extern void FP8_fromBytes(FP8 *x,char *b);
+
+
+/**	@brief Tests for FP8 equal to unity
+ *
+	@param x FP8 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP8_isunity(FP8 *x);
+/**	@brief Tests for equality of two FP8s
+ *
+	@param x FP8 instance to be compared
+	@param y FP8 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP8_equals(FP8 *x, FP8 *y);
+/**	@brief Tests for FP8 having only a real part and no imaginary part
+ *
+	@param x FP8 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP8_isreal(FP8 *x);
+/**	@brief Initialise FP8 from two FP4s
+ *
+	@param x FP8 instance to be initialised
+	@param a FP4 to form real part of FP8
+	@param b FP4 to form imaginary part of FP8
+ */
+extern void FP8_from_FP4s(FP8 *x, FP4 *a, FP4 *b);
+/**	@brief Initialise FP8 from single FP4
+ *
+	Imaginary part is set to zero
+	@param x FP8 instance to be initialised
+	@param a FP4 to form real part of FP8
+ */
+extern void FP8_from_FP4(FP8 *x, FP4 *a);
+
+/**	@brief Initialise FP8 from single FP4
+ *
+	real part is set to zero
+	@param x FP8 instance to be initialised
+	@param a FP4 to form imaginary part of FP8
+ */
+extern void FP8_from_FP4H(FP8 *x, FP4 *a);
+
+/**	@brief Initialise FP8 from single FP
+ *
+	@param x FP8 instance to be initialised
+	@param a FP to form real part of FP8
+ */
+extern void FP8_from_FP(FP8 *x, FP *a);
+
+/**	@brief Copy FP8 to another FP8
+ *
+	@param x FP8 instance, on exit = y
+	@param y FP8 instance to be copied
+ */
+extern void FP8_copy(FP8 *x, FP8 *y);
+
+/**	@brief Set FP8 to zero
+ *
+	@param x FP8 instance to be set to zero
+ */
+extern void FP8_zero(FP8 *x);
+/**	@brief Set FP8 to unity
+ *
+	@param x FP8 instance to be set to one
+ */
+extern void FP8_one(FP8 *x);
+
+/**	@brief Sign of FP8
+ *
+	@param x FP8 instance
+	@return "sign" of FP8
+ */
+extern int FP8_sign(FP8 *x);
+
+/**	@brief Negation of FP8
+ *
+	@param x FP8 instance, on exit = -y
+	@param y FP8 instance
+ */
+extern void FP8_neg(FP8 *x, FP8 *y);
+/**	@brief Conjugation of FP8
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP8 instance, on exit = conj(y)
+	@param y FP8 instance
+ */
+extern void FP8_conj(FP8 *x, FP8 *y);
+/**	@brief Negative conjugation of FP8
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP8 instance, on exit = -conj(y)
+	@param y FP8 instance
+ */
+extern void FP8_nconj(FP8 *x, FP8 *y);
+/**	@brief addition of two FP8s
+ *
+	@param x FP8 instance, on exit = y+z
+	@param y FP8 instance
+	@param z FP8 instance
+ */
+extern void FP8_add(FP8 *x, FP8 *y, FP8 *z);
+/**	@brief subtraction of two FP8s
+ *
+	@param x FP8 instance, on exit = y-z
+	@param y FP8 instance
+	@param z FP8 instance
+ */
+extern void FP8_sub(FP8 *x, FP8 *y, FP8 *z);
+/**	@brief Multiplication of an FP8 by an FP4
+ *
+	@param x FP8 instance, on exit = y*a
+	@param y FP8 instance
+	@param a FP4 multiplier
+ */
+extern void FP8_pmul(FP8 *x, FP8 *y, FP4 *a);
+
+/**	@brief Multiplication of an FP8 by an FP2
+ *
+	@param x FP8 instance, on exit = y*a
+	@param y FP8 instance
+	@param a FP2 multiplier
+ */
+extern void FP8_qmul(FP8 *x, FP8 *y, FP2 *a);
+
+/**	@brief Multiplication of an FP8 by an FP
+ *
+	@param x FP8 instance, on exit = y*a
+	@param y FP8 instance
+	@param a FP multiplier
+ */
+extern void FP8_tmul(FP8 *x, FP8 *y, FP *a);
+
+
+
+/**	@brief Multiplication of an FP8 by a small integer
+ *
+	@param x FP8 instance, on exit = y*i
+	@param y FP8 instance
+	@param i an integer
+ */
+extern void FP8_imul(FP8 *x, FP8 *y, int i);
+/**	@brief Squaring an FP8
+ *
+	@param x FP8 instance, on exit = y^2
+	@param y FP8 instance
+ */
+extern void FP8_sqr(FP8 *x, FP8 *y);
+/**	@brief Multiplication of two FP8s
+ *
+	@param x FP8 instance, on exit = y*z
+	@param y FP8 instance
+	@param z FP8 instance
+ */
+extern void FP8_mul(FP8 *x, FP8 *y, FP8 *z);
+/**	@brief Inverting an FP8
+ *
+	@param x FP8 instance, on exit = 1/y
+	@param y FP8 instance
+    @param h optional input hint
+ */
+extern void FP8_inv(FP8 *x, FP8 *y, FP *h);
+/**	@brief Formats and outputs an FP8 to the console
+ *
+	@param x FP8 instance to be printed
+ */
+extern void FP8_output(FP8 *x);
+/**	@brief Divide an FP8 by 2
+ *
+	@param x FP8 instance, on exit = y/2
+	@param y FP8 instance
+ */
+extern void FP8_div2(FP8 *x, FP8 *y);
+
+/**	@brief Formats and outputs an FP8 to the console in raw form (for debugging)
+ *
+	@param x FP8 instance to be printed
+ */
+extern void FP8_rawoutput(FP8 *x);
+/**	@brief multiplies an FP8 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP8 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP8_times_i(FP8 *x);
+/**	@brief multiplies an FP8 instance by irreducible polynomial (1+sqrt(-1))
+ *
+	@param x FP8 instance, on exit = (1+sqrt(-1)*x
+ */
+extern void FP8_times_i2(FP8 *x);
+
+/**	@brief Normalises the components of an FP8
+ *
+	@param x FP8 instance to be normalised
+ */
+extern void FP8_norm(FP8 *x);
+/**	@brief Reduces all components of possibly unreduced FP8 mod Modulus
+ *
+	@param x FP8 instance, on exit reduced mod Modulus
+ */
+extern void FP8_reduce(FP8 *x);
+/**	@brief Raises an FP8 to the power of a BIG
+ *
+	@param x FP8 instance, on exit = y^b
+	@param y FP8 instance
+	@param b BIG number
+ */
+extern void FP8_pow(FP8 *x, FP8 *y, B584_60::BIG b);
+/**	@brief Raises an FP8 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP8 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP8_frob(FP8 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP8 instance, on exit = w*x-conj(x)*y+z
+	@param w FP8 instance
+	@param x FP8 instance
+	@param y FP8 instance
+	@param z FP8 instance
+ */
+extern void FP8_xtr_A(FP8 *r, FP8 *w, FP8 *x, FP8 *y, FP8 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP8 instance, on exit = x^2-2*conj(x)
+	@param x FP8 instance
+ */
+extern void FP8_xtr_D(FP8 *r, FP8 *x);
+/**	@brief Calculates FP8 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP8 instance, on exit = trace(w^b)
+	@param x FP8 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP8_xtr_pow(FP8 *r, FP8 *x, B584_60::BIG b);
+/**	@brief Calculates FP8 trace of c^a.d^b, where c and d are derived from FP8 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP8 instance, on exit = trace(c^a.d^b)
+	@param c FP8 instance, trace of an FP12
+	@param d FP8 instance, trace of an FP12
+	@param e FP8 instance, trace of an FP12
+	@param f FP8 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP8_xtr_pow2(FP8 *r, FP8 *c, FP8 *d, FP8 *e, FP8 *f, B584_60::BIG a, B584_60::BIG b);
+
+/**	@brief Test FP8 for QR
+ *
+	Square root
+	@param r FP8 instance
+    @param h optional generated hint
+	@return 1 r is a QR, otherwise 0
+ */
+extern int  FP8_qr(FP8 *r, FP *h);
+
+
+/**	@brief Calculate square root of an FP8
+ *
+	Square root
+	@param r FP8 instance, on exit = sqrt(x)
+	@param x FP8 instance
+    @param h optional input hint
+ */
+extern void  FP8_sqrt(FP8 *r, FP8 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP8 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP8 instance, set to y if s!=0
+	@param y another FP8 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP8_cmove(FP8 *x, FP8 *y, int s);
+
+
+/**	@brief Divide FP8 number by QNR
+ *
+	Divide FP8 by the QNR
+	@param x FP8 instance
+ */
+extern void FP8_div_i(FP8 *x);
+
+/**	@brief Generate random FP8
+ *
+	@param x random FP8 number
+	@param rng random number generator
+ */
+extern void FP8_rand(FP8 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_ANSSI.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_ANSSI.h
new file mode 100644
index 0000000..05670eb
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_ANSSI.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_ANSSI_H
+#define FP_ANSSI_H
+
+#include "big_B256_56.h"
+#include "config_field_ANSSI.h"
+
+using namespace core;
+
+#define MODBITS_ANSSI MBITS_ANSSI
+#define TBITS_ANSSI (MBITS_ANSSI%BASEBITS_B256_56)              /**< Number of active bits in top word */
+#define TMASK_ANSSI (((chunk)1<<TBITS_ANSSI)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_ANSSI (((sign32)1<<MAXXES_ANSSI)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_ANSSI (-((chunk)(1)<<TBITS_ANSSI))            /**<  for masking out overflow bits */
+
+namespace ANSSI {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B256_56::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B256_56::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B256_56::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B256_56::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B256_56::BIG SQRTm3;      /**< Square root of -3 */
+extern const B256_56::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B256_56::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B256_56::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B256_56::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B256_56::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B256_56::BIG r, B256_56::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B256_56::BIG, B256_56::BIG, B256_56::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B256_56::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_BLS12381.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_BLS12381.h
new file mode 100644
index 0000000..6b3cdef
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_BLS12381.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_BLS12381_H
+#define FP_BLS12381_H
+
+#include "big_B384_58.h"
+#include "config_field_BLS12381.h"
+
+using namespace core;
+
+#define MODBITS_BLS12381 MBITS_BLS12381
+#define TBITS_BLS12381 (MBITS_BLS12381%BASEBITS_B384_58)              /**< Number of active bits in top word */
+#define TMASK_BLS12381 (((chunk)1<<TBITS_BLS12381)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_BLS12381 (((sign32)1<<MAXXES_BLS12381)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_BLS12381 (-((chunk)(1)<<TBITS_BLS12381))            /**<  for masking out overflow bits */
+
+namespace BLS12381 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B384_58::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B384_58::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B384_58::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B384_58::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B384_58::BIG SQRTm3;      /**< Square root of -3 */
+extern const B384_58::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B384_58::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B384_58::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B384_58::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B384_58::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B384_58::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B384_58::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B384_58::BIG r, B384_58::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B384_58::BIG, B384_58::BIG, B384_58::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B384_58::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_BLS12383.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_BLS12383.h
new file mode 100644
index 0000000..9d29cf8
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_BLS12383.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_BLS12383_H
+#define FP_BLS12383_H
+
+#include "big_B384_58.h"
+#include "config_field_BLS12383.h"
+
+using namespace core;
+
+#define MODBITS_BLS12383 MBITS_BLS12383
+#define TBITS_BLS12383 (MBITS_BLS12383%BASEBITS_B384_58)              /**< Number of active bits in top word */
+#define TMASK_BLS12383 (((chunk)1<<TBITS_BLS12383)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_BLS12383 (((sign32)1<<MAXXES_BLS12383)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_BLS12383 (-((chunk)(1)<<TBITS_BLS12383))            /**<  for masking out overflow bits */
+
+namespace BLS12383 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B384_58::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B384_58::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B384_58::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B384_58::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B384_58::BIG SQRTm3;      /**< Square root of -3 */
+extern const B384_58::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B384_58::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B384_58::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B384_58::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B384_58::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B384_58::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B384_58::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B384_58::BIG r, B384_58::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B384_58::BIG, B384_58::BIG, B384_58::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B384_58::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_BLS12443.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_BLS12443.h
new file mode 100644
index 0000000..a52850b
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_BLS12443.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_BLS12443_H
+#define FP_BLS12443_H
+
+#include "big_B448_60.h"
+#include "config_field_BLS12443.h"
+
+using namespace core;
+
+#define MODBITS_BLS12443 MBITS_BLS12443
+#define TBITS_BLS12443 (MBITS_BLS12443%BASEBITS_B448_60)              /**< Number of active bits in top word */
+#define TMASK_BLS12443 (((chunk)1<<TBITS_BLS12443)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_BLS12443 (((sign32)1<<MAXXES_BLS12443)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_BLS12443 (-((chunk)(1)<<TBITS_BLS12443))            /**<  for masking out overflow bits */
+
+namespace BLS12443 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B448_60::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B448_60::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B448_60::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B448_60::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B448_60::BIG SQRTm3;      /**< Square root of -3 */
+extern const B448_60::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B448_60::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B448_60::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B448_60::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B448_60::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B448_60::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B448_60::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B448_60::BIG r, B448_60::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B448_60::BIG, B448_60::BIG, B448_60::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B448_60::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_BLS12461.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_BLS12461.h
new file mode 100644
index 0000000..c163c46
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_BLS12461.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_BLS12461_H
+#define FP_BLS12461_H
+
+#include "big_B464_60.h"
+#include "config_field_BLS12461.h"
+
+using namespace core;
+
+#define MODBITS_BLS12461 MBITS_BLS12461
+#define TBITS_BLS12461 (MBITS_BLS12461%BASEBITS_B464_60)              /**< Number of active bits in top word */
+#define TMASK_BLS12461 (((chunk)1<<TBITS_BLS12461)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_BLS12461 (((sign32)1<<MAXXES_BLS12461)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_BLS12461 (-((chunk)(1)<<TBITS_BLS12461))            /**<  for masking out overflow bits */
+
+namespace BLS12461 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B464_60::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B464_60::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B464_60::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B464_60::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B464_60::BIG SQRTm3;      /**< Square root of -3 */
+extern const B464_60::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B464_60::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B464_60::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B464_60::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B464_60::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B464_60::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B464_60::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B464_60::BIG r, B464_60::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B464_60::BIG, B464_60::BIG, B464_60::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B464_60::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_BLS24479.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_BLS24479.h
new file mode 100644
index 0000000..569afce
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_BLS24479.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_BLS24479_H
+#define FP_BLS24479_H
+
+#include "big_B480_56.h"
+#include "config_field_BLS24479.h"
+
+using namespace core;
+
+#define MODBITS_BLS24479 MBITS_BLS24479
+#define TBITS_BLS24479 (MBITS_BLS24479%BASEBITS_B480_56)              /**< Number of active bits in top word */
+#define TMASK_BLS24479 (((chunk)1<<TBITS_BLS24479)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_BLS24479 (((sign32)1<<MAXXES_BLS24479)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_BLS24479 (-((chunk)(1)<<TBITS_BLS24479))            /**<  for masking out overflow bits */
+
+namespace BLS24479 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B480_56::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B480_56::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B480_56::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B480_56::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B480_56::BIG SQRTm3;      /**< Square root of -3 */
+extern const B480_56::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B480_56::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B480_56::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B480_56::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B480_56::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B480_56::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B480_56::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B480_56::BIG r, B480_56::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B480_56::BIG, B480_56::BIG, B480_56::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B480_56::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_BLS48286.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_BLS48286.h
new file mode 100644
index 0000000..5ad0012
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_BLS48286.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_BLS48286_H
+#define FP_BLS48286_H
+
+#include "big_B288_60.h"
+#include "config_field_BLS48286.h"
+
+using namespace core;
+
+#define MODBITS_BLS48286 MBITS_BLS48286
+#define TBITS_BLS48286 (MBITS_BLS48286%BASEBITS_B288_60)              /**< Number of active bits in top word */
+#define TMASK_BLS48286 (((chunk)1<<TBITS_BLS48286)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_BLS48286 (((sign32)1<<MAXXES_BLS48286)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_BLS48286 (-((chunk)(1)<<TBITS_BLS48286))            /**<  for masking out overflow bits */
+
+namespace BLS48286 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B288_60::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B288_60::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B288_60::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B288_60::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B288_60::BIG SQRTm3;      /**< Square root of -3 */
+extern const B288_60::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B288_60::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B288_60::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B288_60::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B288_60::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B288_60::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B288_60::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B288_60::BIG r, B288_60::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B288_60::BIG, B288_60::BIG, B288_60::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B288_60::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_BLS48556.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_BLS48556.h
new file mode 100644
index 0000000..e485183
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_BLS48556.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_BLS48556_H
+#define FP_BLS48556_H
+
+#include "big_B560_58.h"
+#include "config_field_BLS48556.h"
+
+using namespace core;
+
+#define MODBITS_BLS48556 MBITS_BLS48556
+#define TBITS_BLS48556 (MBITS_BLS48556%BASEBITS_B560_58)              /**< Number of active bits in top word */
+#define TMASK_BLS48556 (((chunk)1<<TBITS_BLS48556)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_BLS48556 (((sign32)1<<MAXXES_BLS48556)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_BLS48556 (-((chunk)(1)<<TBITS_BLS48556))            /**<  for masking out overflow bits */
+
+namespace BLS48556 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B560_58::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B560_58::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B560_58::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B560_58::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B560_58::BIG SQRTm3;      /**< Square root of -3 */
+extern const B560_58::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B560_58::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B560_58::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B560_58::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B560_58::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B560_58::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B560_58::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B560_58::BIG r, B560_58::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B560_58::BIG, B560_58::BIG, B560_58::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B560_58::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_BLS48581.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_BLS48581.h
new file mode 100644
index 0000000..2bc8d01
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_BLS48581.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_BLS48581_H
+#define FP_BLS48581_H
+
+#include "big_B584_60.h"
+#include "config_field_BLS48581.h"
+
+using namespace core;
+
+#define MODBITS_BLS48581 MBITS_BLS48581
+#define TBITS_BLS48581 (MBITS_BLS48581%BASEBITS_B584_60)              /**< Number of active bits in top word */
+#define TMASK_BLS48581 (((chunk)1<<TBITS_BLS48581)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_BLS48581 (((sign32)1<<MAXXES_BLS48581)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_BLS48581 (-((chunk)(1)<<TBITS_BLS48581))            /**<  for masking out overflow bits */
+
+namespace BLS48581 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B584_60::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B584_60::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B584_60::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B584_60::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B584_60::BIG SQRTm3;      /**< Square root of -3 */
+extern const B584_60::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B584_60::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B584_60::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B584_60::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B584_60::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B584_60::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B584_60::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B584_60::BIG r, B584_60::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B584_60::BIG, B584_60::BIG, B584_60::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B584_60::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_BN158.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_BN158.h
new file mode 100644
index 0000000..cefa4f1
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_BN158.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_BN158_H
+#define FP_BN158_H
+
+#include "big_B160_56.h"
+#include "config_field_BN158.h"
+
+using namespace core;
+
+#define MODBITS_BN158 MBITS_BN158
+#define TBITS_BN158 (MBITS_BN158%BASEBITS_B160_56)              /**< Number of active bits in top word */
+#define TMASK_BN158 (((chunk)1<<TBITS_BN158)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_BN158 (((sign32)1<<MAXXES_BN158)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_BN158 (-((chunk)(1)<<TBITS_BN158))            /**<  for masking out overflow bits */
+
+namespace BN158 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B160_56::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B160_56::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B160_56::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B160_56::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B160_56::BIG SQRTm3;      /**< Square root of -3 */
+extern const B160_56::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B160_56::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B160_56::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B160_56::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B160_56::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B160_56::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B160_56::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B160_56::BIG r, B160_56::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B160_56::BIG, B160_56::BIG, B160_56::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B160_56::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_BN254.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_BN254.h
new file mode 100644
index 0000000..e6279fd
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_BN254.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_BN254_H
+#define FP_BN254_H
+
+#include "big_B256_56.h"
+#include "config_field_BN254.h"
+
+using namespace core;
+
+#define MODBITS_BN254 MBITS_BN254
+#define TBITS_BN254 (MBITS_BN254%BASEBITS_B256_56)              /**< Number of active bits in top word */
+#define TMASK_BN254 (((chunk)1<<TBITS_BN254)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_BN254 (((sign32)1<<MAXXES_BN254)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_BN254 (-((chunk)(1)<<TBITS_BN254))            /**<  for masking out overflow bits */
+
+namespace BN254 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B256_56::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B256_56::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B256_56::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B256_56::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B256_56::BIG SQRTm3;      /**< Square root of -3 */
+extern const B256_56::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B256_56::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B256_56::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B256_56::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B256_56::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B256_56::BIG r, B256_56::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B256_56::BIG, B256_56::BIG, B256_56::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B256_56::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_BN254CX.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_BN254CX.h
new file mode 100644
index 0000000..29175a5
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_BN254CX.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_BN254CX_H
+#define FP_BN254CX_H
+
+#include "big_B256_56.h"
+#include "config_field_BN254CX.h"
+
+using namespace core;
+
+#define MODBITS_BN254CX MBITS_BN254CX
+#define TBITS_BN254CX (MBITS_BN254CX%BASEBITS_B256_56)              /**< Number of active bits in top word */
+#define TMASK_BN254CX (((chunk)1<<TBITS_BN254CX)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_BN254CX (((sign32)1<<MAXXES_BN254CX)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_BN254CX (-((chunk)(1)<<TBITS_BN254CX))            /**<  for masking out overflow bits */
+
+namespace BN254CX {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B256_56::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B256_56::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B256_56::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B256_56::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B256_56::BIG SQRTm3;      /**< Square root of -3 */
+extern const B256_56::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B256_56::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B256_56::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B256_56::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B256_56::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B256_56::BIG r, B256_56::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B256_56::BIG, B256_56::BIG, B256_56::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B256_56::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_BN462.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_BN462.h
new file mode 100644
index 0000000..02c9de8
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_BN462.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_BN462_H
+#define FP_BN462_H
+
+#include "big_B464_60.h"
+#include "config_field_BN462.h"
+
+using namespace core;
+
+#define MODBITS_BN462 MBITS_BN462
+#define TBITS_BN462 (MBITS_BN462%BASEBITS_B464_60)              /**< Number of active bits in top word */
+#define TMASK_BN462 (((chunk)1<<TBITS_BN462)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_BN462 (((sign32)1<<MAXXES_BN462)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_BN462 (-((chunk)(1)<<TBITS_BN462))            /**<  for masking out overflow bits */
+
+namespace BN462 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B464_60::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B464_60::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B464_60::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B464_60::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B464_60::BIG SQRTm3;      /**< Square root of -3 */
+extern const B464_60::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B464_60::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B464_60::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B464_60::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B464_60::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B464_60::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B464_60::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B464_60::BIG r, B464_60::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B464_60::BIG, B464_60::BIG, B464_60::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B464_60::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_BRAINPOOL.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_BRAINPOOL.h
new file mode 100644
index 0000000..5a44e32
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_BRAINPOOL.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_BRAINPOOL_H
+#define FP_BRAINPOOL_H
+
+#include "big_B256_56.h"
+#include "config_field_BRAINPOOL.h"
+
+using namespace core;
+
+#define MODBITS_BRAINPOOL MBITS_BRAINPOOL
+#define TBITS_BRAINPOOL (MBITS_BRAINPOOL%BASEBITS_B256_56)              /**< Number of active bits in top word */
+#define TMASK_BRAINPOOL (((chunk)1<<TBITS_BRAINPOOL)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_BRAINPOOL (((sign32)1<<MAXXES_BRAINPOOL)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_BRAINPOOL (-((chunk)(1)<<TBITS_BRAINPOOL))            /**<  for masking out overflow bits */
+
+namespace BRAINPOOL {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B256_56::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B256_56::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B256_56::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B256_56::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B256_56::BIG SQRTm3;      /**< Square root of -3 */
+extern const B256_56::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B256_56::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B256_56::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B256_56::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B256_56::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B256_56::BIG r, B256_56::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B256_56::BIG, B256_56::BIG, B256_56::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B256_56::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_C1174.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_C1174.h
new file mode 100644
index 0000000..139c316
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_C1174.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_C1174_H
+#define FP_C1174_H
+
+#include "big_B256_56.h"
+#include "config_field_C1174.h"
+
+using namespace core;
+
+#define MODBITS_C1174 MBITS_C1174
+#define TBITS_C1174 (MBITS_C1174%BASEBITS_B256_56)              /**< Number of active bits in top word */
+#define TMASK_C1174 (((chunk)1<<TBITS_C1174)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_C1174 (((sign32)1<<MAXXES_C1174)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_C1174 (-((chunk)(1)<<TBITS_C1174))            /**<  for masking out overflow bits */
+
+namespace C1174 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B256_56::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B256_56::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B256_56::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B256_56::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B256_56::BIG SQRTm3;      /**< Square root of -3 */
+extern const B256_56::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B256_56::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B256_56::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B256_56::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B256_56::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B256_56::BIG r, B256_56::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B256_56::BIG, B256_56::BIG, B256_56::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B256_56::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_C1665.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_C1665.h
new file mode 100644
index 0000000..3413c2b
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_C1665.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_C1665_H
+#define FP_C1665_H
+
+#include "big_B168_60.h"
+#include "config_field_C1665.h"
+
+using namespace core;
+
+#define MODBITS_C1665 MBITS_C1665
+#define TBITS_C1665 (MBITS_C1665%BASEBITS_B168_60)              /**< Number of active bits in top word */
+#define TMASK_C1665 (((chunk)1<<TBITS_C1665)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_C1665 (((sign32)1<<MAXXES_C1665)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_C1665 (-((chunk)(1)<<TBITS_C1665))            /**<  for masking out overflow bits */
+
+namespace C1665 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B168_60::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B168_60::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B168_60::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B168_60::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B168_60::BIG SQRTm3;      /**< Square root of -3 */
+extern const B168_60::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B168_60::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B168_60::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B168_60::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B168_60::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B168_60::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B168_60::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B168_60::BIG r, B168_60::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B168_60::BIG, B168_60::BIG, B168_60::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B168_60::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_C41417.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_C41417.h
new file mode 100644
index 0000000..d9d0a79
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_C41417.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_C41417_H
+#define FP_C41417_H
+
+#include "big_B416_60.h"
+#include "config_field_C41417.h"
+
+using namespace core;
+
+#define MODBITS_C41417 MBITS_C41417
+#define TBITS_C41417 (MBITS_C41417%BASEBITS_B416_60)              /**< Number of active bits in top word */
+#define TMASK_C41417 (((chunk)1<<TBITS_C41417)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_C41417 (((sign32)1<<MAXXES_C41417)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_C41417 (-((chunk)(1)<<TBITS_C41417))            /**<  for masking out overflow bits */
+
+namespace C41417 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B416_60::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B416_60::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B416_60::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B416_60::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B416_60::BIG SQRTm3;      /**< Square root of -3 */
+extern const B416_60::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B416_60::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B416_60::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B416_60::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B416_60::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B416_60::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B416_60::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B416_60::BIG r, B416_60::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B416_60::BIG, B416_60::BIG, B416_60::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B416_60::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_F25519.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_F25519.h
new file mode 100644
index 0000000..c1c24eb
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_F25519.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_F25519_H
+#define FP_F25519_H
+
+#include "big_B256_56.h"
+#include "config_field_F25519.h"
+
+using namespace core;
+
+#define MODBITS_F25519 MBITS_F25519
+#define TBITS_F25519 (MBITS_F25519%BASEBITS_B256_56)              /**< Number of active bits in top word */
+#define TMASK_F25519 (((chunk)1<<TBITS_F25519)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_F25519 (((sign32)1<<MAXXES_F25519)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_F25519 (-((chunk)(1)<<TBITS_F25519))            /**<  for masking out overflow bits */
+
+namespace F25519 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B256_56::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B256_56::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B256_56::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B256_56::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B256_56::BIG SQRTm3;      /**< Square root of -3 */
+extern const B256_56::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B256_56::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B256_56::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B256_56::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B256_56::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B256_56::BIG r, B256_56::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B256_56::BIG, B256_56::BIG, B256_56::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B256_56::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_F256PME.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_F256PME.h
new file mode 100644
index 0000000..6bdba2f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_F256PME.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_F256PME_H
+#define FP_F256PME_H
+
+#include "big_B256_56.h"
+#include "config_field_F256PME.h"
+
+using namespace core;
+
+#define MODBITS_F256PME MBITS_F256PME
+#define TBITS_F256PME (MBITS_F256PME%BASEBITS_B256_56)              /**< Number of active bits in top word */
+#define TMASK_F256PME (((chunk)1<<TBITS_F256PME)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_F256PME (((sign32)1<<MAXXES_F256PME)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_F256PME (-((chunk)(1)<<TBITS_F256PME))            /**<  for masking out overflow bits */
+
+namespace F256PME {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B256_56::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B256_56::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B256_56::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B256_56::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B256_56::BIG SQRTm3;      /**< Square root of -3 */
+extern const B256_56::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B256_56::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B256_56::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B256_56::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B256_56::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B256_56::BIG r, B256_56::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B256_56::BIG, B256_56::BIG, B256_56::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B256_56::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_F256PMW.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_F256PMW.h
new file mode 100644
index 0000000..5d2548f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_F256PMW.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_F256PMW_H
+#define FP_F256PMW_H
+
+#include "big_B256_56.h"
+#include "config_field_F256PMW.h"
+
+using namespace core;
+
+#define MODBITS_F256PMW MBITS_F256PMW
+#define TBITS_F256PMW (MBITS_F256PMW%BASEBITS_B256_56)              /**< Number of active bits in top word */
+#define TMASK_F256PMW (((chunk)1<<TBITS_F256PMW)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_F256PMW (((sign32)1<<MAXXES_F256PMW)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_F256PMW (-((chunk)(1)<<TBITS_F256PMW))            /**<  for masking out overflow bits */
+
+namespace F256PMW {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B256_56::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B256_56::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B256_56::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B256_56::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B256_56::BIG SQRTm3;      /**< Square root of -3 */
+extern const B256_56::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B256_56::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B256_56::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B256_56::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B256_56::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B256_56::BIG r, B256_56::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B256_56::BIG, B256_56::BIG, B256_56::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B256_56::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_F384PM.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_F384PM.h
new file mode 100644
index 0000000..a025924
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_F384PM.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_F384PM_H
+#define FP_F384PM_H
+
+#include "big_B384_58.h"
+#include "config_field_F384PM.h"
+
+using namespace core;
+
+#define MODBITS_F384PM MBITS_F384PM
+#define TBITS_F384PM (MBITS_F384PM%BASEBITS_B384_58)              /**< Number of active bits in top word */
+#define TMASK_F384PM (((chunk)1<<TBITS_F384PM)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_F384PM (((sign32)1<<MAXXES_F384PM)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_F384PM (-((chunk)(1)<<TBITS_F384PM))            /**<  for masking out overflow bits */
+
+namespace F384PM {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B384_58::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B384_58::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B384_58::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B384_58::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B384_58::BIG SQRTm3;      /**< Square root of -3 */
+extern const B384_58::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B384_58::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B384_58::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B384_58::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B384_58::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B384_58::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B384_58::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B384_58::BIG r, B384_58::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B384_58::BIG, B384_58::BIG, B384_58::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B384_58::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_F448.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_F448.h
new file mode 100644
index 0000000..ed477a4
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_F448.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_F448_H
+#define FP_F448_H
+
+#include "big_B448_58.h"
+#include "config_field_F448.h"
+
+using namespace core;
+
+#define MODBITS_F448 MBITS_F448
+#define TBITS_F448 (MBITS_F448%BASEBITS_B448_58)              /**< Number of active bits in top word */
+#define TMASK_F448 (((chunk)1<<TBITS_F448)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_F448 (((sign32)1<<MAXXES_F448)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_F448 (-((chunk)(1)<<TBITS_F448))            /**<  for masking out overflow bits */
+
+namespace F448 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B448_58::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B448_58::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B448_58::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B448_58::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B448_58::BIG SQRTm3;      /**< Square root of -3 */
+extern const B448_58::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B448_58::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B448_58::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B448_58::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B448_58::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B448_58::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B448_58::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B448_58::BIG r, B448_58::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B448_58::BIG, B448_58::BIG, B448_58::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B448_58::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_F512PM.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_F512PM.h
new file mode 100644
index 0000000..0ef3e36
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_F512PM.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_F512PM_H
+#define FP_F512PM_H
+
+#include "big_B512_60.h"
+#include "config_field_F512PM.h"
+
+using namespace core;
+
+#define MODBITS_F512PM MBITS_F512PM
+#define TBITS_F512PM (MBITS_F512PM%BASEBITS_B512_60)              /**< Number of active bits in top word */
+#define TMASK_F512PM (((chunk)1<<TBITS_F512PM)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_F512PM (((sign32)1<<MAXXES_F512PM)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_F512PM (-((chunk)(1)<<TBITS_F512PM))            /**<  for masking out overflow bits */
+
+namespace F512PM {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B512_60::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B512_60::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B512_60::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B512_60::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B512_60::BIG SQRTm3;      /**< Square root of -3 */
+extern const B512_60::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B512_60::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B512_60::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B512_60::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B512_60::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B512_60::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B512_60::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B512_60::BIG r, B512_60::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B512_60::BIG, B512_60::BIG, B512_60::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B512_60::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_FP256BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_FP256BN.h
new file mode 100644
index 0000000..dd35ed7
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_FP256BN.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_FP256BN_H
+#define FP_FP256BN_H
+
+#include "big_B256_56.h"
+#include "config_field_FP256BN.h"
+
+using namespace core;
+
+#define MODBITS_FP256BN MBITS_FP256BN
+#define TBITS_FP256BN (MBITS_FP256BN%BASEBITS_B256_56)              /**< Number of active bits in top word */
+#define TMASK_FP256BN (((chunk)1<<TBITS_FP256BN)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_FP256BN (((sign32)1<<MAXXES_FP256BN)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_FP256BN (-((chunk)(1)<<TBITS_FP256BN))            /**<  for masking out overflow bits */
+
+namespace FP256BN {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B256_56::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B256_56::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B256_56::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B256_56::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B256_56::BIG SQRTm3;      /**< Square root of -3 */
+extern const B256_56::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B256_56::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B256_56::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B256_56::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B256_56::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B256_56::BIG r, B256_56::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B256_56::BIG, B256_56::BIG, B256_56::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B256_56::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_FP512BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_FP512BN.h
new file mode 100644
index 0000000..12818ea
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_FP512BN.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_FP512BN_H
+#define FP_FP512BN_H
+
+#include "big_B512_60.h"
+#include "config_field_FP512BN.h"
+
+using namespace core;
+
+#define MODBITS_FP512BN MBITS_FP512BN
+#define TBITS_FP512BN (MBITS_FP512BN%BASEBITS_B512_60)              /**< Number of active bits in top word */
+#define TMASK_FP512BN (((chunk)1<<TBITS_FP512BN)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_FP512BN (((sign32)1<<MAXXES_FP512BN)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_FP512BN (-((chunk)(1)<<TBITS_FP512BN))            /**<  for masking out overflow bits */
+
+namespace FP512BN {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B512_60::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B512_60::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B512_60::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B512_60::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B512_60::BIG SQRTm3;      /**< Square root of -3 */
+extern const B512_60::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B512_60::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B512_60::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B512_60::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B512_60::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B512_60::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B512_60::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B512_60::BIG r, B512_60::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B512_60::BIG, B512_60::BIG, B512_60::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B512_60::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_HIFIVE.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_HIFIVE.h
new file mode 100644
index 0000000..98fc314
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_HIFIVE.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_HIFIVE_H
+#define FP_HIFIVE_H
+
+#include "big_B336_60.h"
+#include "config_field_HIFIVE.h"
+
+using namespace core;
+
+#define MODBITS_HIFIVE MBITS_HIFIVE
+#define TBITS_HIFIVE (MBITS_HIFIVE%BASEBITS_B336_60)              /**< Number of active bits in top word */
+#define TMASK_HIFIVE (((chunk)1<<TBITS_HIFIVE)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_HIFIVE (((sign32)1<<MAXXES_HIFIVE)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_HIFIVE (-((chunk)(1)<<TBITS_HIFIVE))            /**<  for masking out overflow bits */
+
+namespace HIFIVE {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B336_60::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B336_60::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B336_60::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B336_60::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B336_60::BIG SQRTm3;      /**< Square root of -3 */
+extern const B336_60::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B336_60::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B336_60::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B336_60::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B336_60::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B336_60::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B336_60::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B336_60::BIG r, B336_60::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B336_60::BIG, B336_60::BIG, B336_60::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B336_60::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_JUBJUB.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_JUBJUB.h
new file mode 100644
index 0000000..500826f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_JUBJUB.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_JUBJUB_H
+#define FP_JUBJUB_H
+
+#include "big_B256_56.h"
+#include "config_field_JUBJUB.h"
+
+using namespace core;
+
+#define MODBITS_JUBJUB MBITS_JUBJUB
+#define TBITS_JUBJUB (MBITS_JUBJUB%BASEBITS_B256_56)              /**< Number of active bits in top word */
+#define TMASK_JUBJUB (((chunk)1<<TBITS_JUBJUB)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_JUBJUB (((sign32)1<<MAXXES_JUBJUB)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_JUBJUB (-((chunk)(1)<<TBITS_JUBJUB))            /**<  for masking out overflow bits */
+
+namespace JUBJUB {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B256_56::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B256_56::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B256_56::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B256_56::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B256_56::BIG SQRTm3;      /**< Square root of -3 */
+extern const B256_56::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B256_56::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B256_56::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B256_56::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B256_56::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B256_56::BIG r, B256_56::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B256_56::BIG, B256_56::BIG, B256_56::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B256_56::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_MDC.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_MDC.h
new file mode 100644
index 0000000..f64f0fa
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_MDC.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_MDC_H
+#define FP_MDC_H
+
+#include "big_B256_56.h"
+#include "config_field_MDC.h"
+
+using namespace core;
+
+#define MODBITS_MDC MBITS_MDC
+#define TBITS_MDC (MBITS_MDC%BASEBITS_B256_56)              /**< Number of active bits in top word */
+#define TMASK_MDC (((chunk)1<<TBITS_MDC)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_MDC (((sign32)1<<MAXXES_MDC)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_MDC (-((chunk)(1)<<TBITS_MDC))            /**<  for masking out overflow bits */
+
+namespace MDC {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B256_56::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B256_56::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B256_56::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B256_56::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B256_56::BIG SQRTm3;      /**< Square root of -3 */
+extern const B256_56::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B256_56::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B256_56::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B256_56::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B256_56::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B256_56::BIG r, B256_56::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B256_56::BIG, B256_56::BIG, B256_56::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B256_56::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_NIST256.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_NIST256.h
new file mode 100644
index 0000000..182f6ac
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_NIST256.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_NIST256_H
+#define FP_NIST256_H
+
+#include "big_B256_56.h"
+#include "config_field_NIST256.h"
+
+using namespace core;
+
+#define MODBITS_NIST256 MBITS_NIST256
+#define TBITS_NIST256 (MBITS_NIST256%BASEBITS_B256_56)              /**< Number of active bits in top word */
+#define TMASK_NIST256 (((chunk)1<<TBITS_NIST256)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_NIST256 (((sign32)1<<MAXXES_NIST256)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_NIST256 (-((chunk)(1)<<TBITS_NIST256))            /**<  for masking out overflow bits */
+
+namespace NIST256 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B256_56::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B256_56::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B256_56::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B256_56::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B256_56::BIG SQRTm3;      /**< Square root of -3 */
+extern const B256_56::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B256_56::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B256_56::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B256_56::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B256_56::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B256_56::BIG r, B256_56::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B256_56::BIG, B256_56::BIG, B256_56::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B256_56::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_NIST384.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_NIST384.h
new file mode 100644
index 0000000..f9d6a0c
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_NIST384.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_NIST384_H
+#define FP_NIST384_H
+
+#include "big_B384_56.h"
+#include "config_field_NIST384.h"
+
+using namespace core;
+
+#define MODBITS_NIST384 MBITS_NIST384
+#define TBITS_NIST384 (MBITS_NIST384%BASEBITS_B384_56)              /**< Number of active bits in top word */
+#define TMASK_NIST384 (((chunk)1<<TBITS_NIST384)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_NIST384 (((sign32)1<<MAXXES_NIST384)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_NIST384 (-((chunk)(1)<<TBITS_NIST384))            /**<  for masking out overflow bits */
+
+namespace NIST384 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B384_56::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B384_56::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B384_56::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B384_56::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B384_56::BIG SQRTm3;      /**< Square root of -3 */
+extern const B384_56::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B384_56::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B384_56::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B384_56::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B384_56::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B384_56::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B384_56::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B384_56::BIG r, B384_56::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B384_56::BIG, B384_56::BIG, B384_56::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B384_56::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_NIST521.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_NIST521.h
new file mode 100644
index 0000000..618166e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_NIST521.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_NIST521_H
+#define FP_NIST521_H
+
+#include "big_B528_60.h"
+#include "config_field_NIST521.h"
+
+using namespace core;
+
+#define MODBITS_NIST521 MBITS_NIST521
+#define TBITS_NIST521 (MBITS_NIST521%BASEBITS_B528_60)              /**< Number of active bits in top word */
+#define TMASK_NIST521 (((chunk)1<<TBITS_NIST521)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_NIST521 (((sign32)1<<MAXXES_NIST521)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_NIST521 (-((chunk)(1)<<TBITS_NIST521))            /**<  for masking out overflow bits */
+
+namespace NIST521 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B528_60::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B528_60::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B528_60::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B528_60::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B528_60::BIG SQRTm3;      /**< Square root of -3 */
+extern const B528_60::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B528_60::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B528_60::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B528_60::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B528_60::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B528_60::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B528_60::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B528_60::BIG r, B528_60::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B528_60::BIG, B528_60::BIG, B528_60::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B528_60::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_SECP160R1.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_SECP160R1.h
new file mode 100644
index 0000000..6dda085
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_SECP160R1.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_SECP160R1_H
+#define FP_SECP160R1_H
+
+#include "big_B160_56.h"
+#include "config_field_SECP160R1.h"
+
+using namespace core;
+
+#define MODBITS_SECP160R1 MBITS_SECP160R1
+#define TBITS_SECP160R1 (MBITS_SECP160R1%BASEBITS_B160_56)              /**< Number of active bits in top word */
+#define TMASK_SECP160R1 (((chunk)1<<TBITS_SECP160R1)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_SECP160R1 (((sign32)1<<MAXXES_SECP160R1)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_SECP160R1 (-((chunk)(1)<<TBITS_SECP160R1))            /**<  for masking out overflow bits */
+
+namespace SECP160R1 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B160_56::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B160_56::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B160_56::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B160_56::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B160_56::BIG SQRTm3;      /**< Square root of -3 */
+extern const B160_56::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B160_56::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B160_56::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B160_56::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B160_56::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B160_56::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B160_56::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B160_56::BIG r, B160_56::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B160_56::BIG, B160_56::BIG, B160_56::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B160_56::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_SECP256K1.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_SECP256K1.h
new file mode 100644
index 0000000..4bbfc83
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_SECP256K1.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_SECP256K1_H
+#define FP_SECP256K1_H
+
+#include "big_B256_56.h"
+#include "config_field_SECP256K1.h"
+
+using namespace core;
+
+#define MODBITS_SECP256K1 MBITS_SECP256K1
+#define TBITS_SECP256K1 (MBITS_SECP256K1%BASEBITS_B256_56)              /**< Number of active bits in top word */
+#define TMASK_SECP256K1 (((chunk)1<<TBITS_SECP256K1)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_SECP256K1 (((sign32)1<<MAXXES_SECP256K1)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_SECP256K1 (-((chunk)(1)<<TBITS_SECP256K1))            /**<  for masking out overflow bits */
+
+namespace SECP256K1 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B256_56::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B256_56::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B256_56::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B256_56::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B256_56::BIG SQRTm3;      /**< Square root of -3 */
+extern const B256_56::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B256_56::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B256_56::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B256_56::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B256_56::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B256_56::BIG r, B256_56::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B256_56::BIG, B256_56::BIG, B256_56::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B256_56::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_SM2.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_SM2.h
new file mode 100644
index 0000000..f0c0354
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_SM2.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_SM2_H
+#define FP_SM2_H
+
+#include "big_B256_56.h"
+#include "config_field_SM2.h"
+
+using namespace core;
+
+#define MODBITS_SM2 MBITS_SM2
+#define TBITS_SM2 (MBITS_SM2%BASEBITS_B256_56)              /**< Number of active bits in top word */
+#define TMASK_SM2 (((chunk)1<<TBITS_SM2)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_SM2 (((sign32)1<<MAXXES_SM2)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_SM2 (-((chunk)(1)<<TBITS_SM2))            /**<  for masking out overflow bits */
+
+namespace SM2 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B256_56::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B256_56::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B256_56::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B256_56::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B256_56::BIG SQRTm3;      /**< Square root of -3 */
+extern const B256_56::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B256_56::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B256_56::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B256_56::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B256_56::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B256_56::BIG r, B256_56::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B256_56::BIG, B256_56::BIG, B256_56::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B256_56::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_TWEEDLEDEE.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_TWEEDLEDEE.h
new file mode 100644
index 0000000..7187183
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_TWEEDLEDEE.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_TWEEDLEDEE_H
+#define FP_TWEEDLEDEE_H
+
+#include "big_B256_56.h"
+#include "config_field_TWEEDLEDEE.h"
+
+using namespace core;
+
+#define MODBITS_TWEEDLEDEE MBITS_TWEEDLEDEE
+#define TBITS_TWEEDLEDEE (MBITS_TWEEDLEDEE%BASEBITS_B256_56)              /**< Number of active bits in top word */
+#define TMASK_TWEEDLEDEE (((chunk)1<<TBITS_TWEEDLEDEE)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_TWEEDLEDEE (((sign32)1<<MAXXES_TWEEDLEDEE)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_TWEEDLEDEE (-((chunk)(1)<<TBITS_TWEEDLEDEE))            /**<  for masking out overflow bits */
+
+namespace TWEEDLEDEE {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B256_56::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B256_56::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B256_56::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B256_56::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B256_56::BIG SQRTm3;      /**< Square root of -3 */
+extern const B256_56::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B256_56::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B256_56::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B256_56::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B256_56::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B256_56::BIG r, B256_56::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B256_56::BIG, B256_56::BIG, B256_56::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B256_56::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_TWEEDLEDUM.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_TWEEDLEDUM.h
new file mode 100644
index 0000000..18f9b86
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/fp_TWEEDLEDUM.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_TWEEDLEDUM_H
+#define FP_TWEEDLEDUM_H
+
+#include "big_B256_56.h"
+#include "config_field_TWEEDLEDUM.h"
+
+using namespace core;
+
+#define MODBITS_TWEEDLEDUM MBITS_TWEEDLEDUM
+#define TBITS_TWEEDLEDUM (MBITS_TWEEDLEDUM%BASEBITS_B256_56)              /**< Number of active bits in top word */
+#define TMASK_TWEEDLEDUM (((chunk)1<<TBITS_TWEEDLEDUM)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_TWEEDLEDUM (((sign32)1<<MAXXES_TWEEDLEDUM)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_TWEEDLEDUM (-((chunk)(1)<<TBITS_TWEEDLEDUM))            /**<  for masking out overflow bits */
+
+namespace TWEEDLEDUM {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B256_56::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B256_56::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B256_56::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B256_56::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B256_56::BIG SQRTm3;      /**< Square root of -3 */
+extern const B256_56::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B256_56::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B256_56::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B256_56::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B256_56::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B256_56::BIG r, B256_56::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B256_56::BIG, B256_56::BIG, B256_56::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B256_56::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/gcm.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/gcm.cpp
new file mode 100644
index 0000000..843ab0f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/gcm.cpp
@@ -0,0 +1,440 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/*
+ * Implementation of the AES-GCM Encryption/Authentication
+ *
+ * Some restrictions..
+ * 1. Only for use with AES
+ * 2. Returned tag is always 128-bits. Truncate at your own risk.
+ * 3. The order of function calls must follow some rules
+ *
+ * Typical sequence of calls..
+ * 1. call GCM_init
+ * 2. call GCM_add_header any number of times, as long as length of header is multiple of 16 bytes (block size)
+ * 3. call GCM_add_header one last time with any length of header
+ * 4. call GCM_add_cipher any number of times, as long as length of cipher/plaintext is multiple of 16 bytes
+ * 5. call GCM_add_cipher one last time with any length of cipher/plaintext
+ * 6. call GCM_finish to extract the tag.
+ *
+ * See http://www.mindspring.com/~dmcgrew/gcm-nist-6.pdf
+ */
+/* SU=m, m is Stack Usage */
+
+#include <stdlib.h>
+#include <string.h>
+#include "arch.h"
+#include "core.h"
+
+using namespace core;
+
+#define NB 4
+#define MR_TOBYTE(x) ((uchar)((x)))
+
+static unsign32 pack(const uchar *b)
+{
+    /* pack bytes into a 32-bit Word */
+    return ((unsign32)b[0] << 24) | ((unsign32)b[1] << 16) | ((unsign32)b[2] << 8) | (unsign32)b[3];
+}
+
+static void unpack(unsign32 a, uchar *b)
+{
+    /* unpack bytes from a word */
+    b[3] = MR_TOBYTE(a);
+    b[2] = MR_TOBYTE(a >> 8);
+    b[1] = MR_TOBYTE(a >> 16);
+    b[0] = MR_TOBYTE(a >> 24);
+}
+
+static void precompute(gcm *g, uchar *H)
+{
+    /* precompute small 2k bytes gf2m table of x^n.H */
+    int i, j;
+    unsign32 *last, *next, b;
+
+    for (i = j = 0; i < NB; i++, j += 4) g->table[0][i] = pack((uchar *)&H[j]);
+
+    for (i = 1; i < 128; i++)
+    {
+        next = g->table[i];
+        last = g->table[i - 1];
+        b = 0;
+        for (j = 0; j < NB; j++)
+        {
+            next[j] = b | (last[j]) >> 1;
+            b = last[j] << 31;
+        }
+        if (b) next[0] ^= 0xE1000000; /* irreducible polynomial */
+    }
+}
+
+/* SU= 32 */
+static void gf2mul(gcm *g)
+{
+    /* gf2m mul - Z=H*X mod 2^128 */
+    int i, j, m, k;
+    unsign32 P[4];
+    unsign32 b;
+
+    P[0] = P[1] = P[2] = P[3] = 0;
+    j = 8;
+    m = 0;
+    for (i = 0; i < 128; i++)
+    {
+        b = (unsign32)(g->stateX[m] >> (--j)) & 1;
+        b = ~b + 1;
+        for (k = 0; k < NB; k++) P[k] ^= (g->table[i][k] & b);
+        if (j == 0)
+        {
+            j = 8;
+            m++;
+            if (m == 16) break;
+        }
+    }
+    for (i = j = 0; i < NB; i++, j += 4) unpack(P[i], (uchar *)&g->stateX[j]);
+}
+
+/* SU= 32 */
+static void GCM_wrap(gcm *g)
+{
+    /* Finish off GHASH */
+    int i, j;
+    unsign32 F[4];
+    uchar L[16];
+
+    /* convert lengths from bytes to bits */
+    F[0] = (g->lenA[0] << 3) | (g->lenA[1] & 0xE0000000) >> 29;
+    F[1] = g->lenA[1] << 3;
+    F[2] = (g->lenC[0] << 3) | (g->lenC[1] & 0xE0000000) >> 29;
+    F[3] = g->lenC[1] << 3;
+    for (i = j = 0; i < NB; i++, j += 4) unpack(F[i], (uchar *)&L[j]);
+
+    for (i = 0; i < 16; i++) g->stateX[i] ^= L[i];
+    gf2mul(g);
+}
+
+static int GCM_ghash(gcm *g, char *plain, int len)
+{
+    int i, j = 0;
+    if (g->status == GCM_ACCEPTING_HEADER) g->status = GCM_ACCEPTING_CIPHER;
+    if (g->status != GCM_ACCEPTING_CIPHER) return 0;
+
+    while (j < len)
+    {
+        for (i = 0; i < 16 && j < len; i++)
+        {
+            g->stateX[i] ^= plain[j++];
+            g->lenC[1]++;
+            if (g->lenC[1] == 0) g->lenC[0]++;
+        }
+        gf2mul(g);
+    }
+    if (len % 16 != 0) g->status = GCM_NOT_ACCEPTING_MORE;
+    return 1;
+}
+
+/* SU= 48 */
+/* Initialize GCM mode */
+void core::GCM_init(gcm* g, int nk, char *key, int niv, char *iv)
+{
+    /* iv size niv is usually 12 bytes (96 bits). AES key size nk can be 16,24 or 32 bytes */
+    int i;
+    uchar H[16];
+    for (i = 0; i < 16; i++)
+    {
+        H[i] = 0;
+        g->stateX[i] = 0;
+    }
+
+    AES_init(&(g->a), ECB, nk, key, iv);
+    AES_ecb_encrypt(&(g->a), H);    /* E(K,0) */
+    precompute(g, H);
+
+    g->lenA[0] = g->lenC[0] = g->lenA[1] = g->lenC[1] = 0;
+    if (niv == 12)
+    {
+        for (i = 0; i < 12; i++) g->a.f[i] = iv[i];
+        unpack((unsign32)1, (uchar *) & (g->a.f[12])); /* initialise IV */
+        for (i = 0; i < 16; i++) g->Y_0[i] = g->a.f[i];
+    }
+    else
+    {
+        g->status = GCM_ACCEPTING_CIPHER;
+        GCM_ghash(g, iv, niv); /* GHASH(H,0,IV) */
+        GCM_wrap(g);
+        for (i = 0; i < 16; i++)
+        {
+            g->a.f[i] = g->stateX[i];
+            g->Y_0[i] = g->a.f[i];
+            g->stateX[i] = 0;
+        }
+        g->lenA[0] = g->lenC[0] = g->lenA[1] = g->lenC[1] = 0;
+    }
+    g->status = GCM_ACCEPTING_HEADER;
+}
+
+/* SU= 24 */
+/* Add Header data - included but not encrypted */
+int core::GCM_add_header(gcm* g, char *header, int len)
+{
+    /* Add some header. Won't be encrypted, but will be authenticated. len is length of header */
+    int i, j = 0;
+    if (g->status != GCM_ACCEPTING_HEADER) return 0;
+
+    while (j < len)
+    {
+        for (i = 0; i < 16 && j < len; i++)
+        {
+            g->stateX[i] ^= header[j++];
+            g->lenA[1]++;
+            if (g->lenA[1] == 0) g->lenA[0]++;
+        }
+        gf2mul(g);
+    }
+    if (len % 16 != 0) g->status = GCM_ACCEPTING_CIPHER;
+    return 1;
+}
+
+/* SU= 48 */
+/* Add Plaintext - included and encrypted */
+int core::GCM_add_plain(gcm *g, char *cipher, char *plain, int len)
+{
+    /* Add plaintext to extract ciphertext, len is length of plaintext.  */
+    int i, j = 0;
+    unsign32 counter;
+    uchar B[16];
+    if (g->status == GCM_ACCEPTING_HEADER) g->status = GCM_ACCEPTING_CIPHER;
+    if (g->status != GCM_ACCEPTING_CIPHER) return 0;
+
+    while (j < len)
+    {
+        counter = pack((uchar *) & (g->a.f[12]));
+        counter++;
+        unpack(counter, (uchar *) & (g->a.f[12])); /* increment counter */
+        for (i = 0; i < 16; i++) B[i] = g->a.f[i];
+        AES_ecb_encrypt(&(g->a), B);       /* encrypt it  */
+
+        for (i = 0; i < 16 && j < len; i++)
+        {
+            cipher[j] = plain[j] ^ B[i];
+            g->stateX[i] ^= cipher[j++];
+            g->lenC[1]++;
+            if (g->lenC[1] == 0) g->lenC[0]++;
+        }
+        gf2mul(g);
+    }
+    if (len % 16 != 0) g->status = GCM_NOT_ACCEPTING_MORE;
+    return 1;
+}
+
+/* SU= 48 */
+/* Add Ciphertext - decrypts to plaintext */
+int core::GCM_add_cipher(gcm *g, char *plain, char *cipher, int len)
+{
+    /* Add ciphertext to extract plaintext, len is length of ciphertext. */
+    int i, j = 0;
+    unsign32 counter;
+    char oc;
+    uchar B[16];
+    if (g->status == GCM_ACCEPTING_HEADER) g->status = GCM_ACCEPTING_CIPHER;
+    if (g->status != GCM_ACCEPTING_CIPHER) return 0;
+
+    while (j < len)
+    {
+        counter = pack((uchar *) & (g->a.f[12]));
+        counter++;
+        unpack(counter, (uchar *) & (g->a.f[12])); /* increment counter */
+        for (i = 0; i < 16; i++) B[i] = g->a.f[i];
+        AES_ecb_encrypt(&(g->a), B);       /* encrypt it  */
+        for (i = 0; i < 16 && j < len; i++)
+        {
+            oc = cipher[j];
+            plain[j] = cipher[j] ^ B[i];
+            g->stateX[i] ^= oc;
+            j++;
+            g->lenC[1]++;
+            if (g->lenC[1] == 0) g->lenC[0]++;
+        }
+        gf2mul(g);
+    }
+    if (len % 16 != 0) g->status = GCM_NOT_ACCEPTING_MORE;
+    return 1;
+}
+
+/* SU= 16 */
+/* Finish and extract Tag */
+void core::GCM_finish(gcm *g, char *tag)
+{
+    /* Finish off GHASH and extract tag (MAC) */
+    int i;
+
+    GCM_wrap(g);
+
+    /* extract tag */
+    if (tag != NULL)
+    {
+        AES_ecb_encrypt(&(g->a), g->Y_0);       /* E(K,Y0) */
+        for (i = 0; i < 16; i++) g->Y_0[i] ^= g->stateX[i];
+        for (i = 0; i < 16; i++)
+        {
+            tag[i] = g->Y_0[i];
+            g->Y_0[i] = g->stateX[i] = 0;
+        }
+    }
+
+    g->status = GCM_FINISHED;
+    AES_end(&(g->a));
+}
+
+/* AES-GCM Encryption of octets, K is key, H is header,
+   P is plaintext, C is ciphertext, T is authentication tag */
+void core::AES_GCM_ENCRYPT(octet *K, octet *IV, octet *H, octet *P, octet *C, octet *T)
+{
+    gcm g;
+    GCM_init(&g, K->len, K->val, IV->len, IV->val);
+    GCM_add_header(&g, H->val, H->len);
+    GCM_add_plain(&g, C->val, P->val, P->len);
+    C->len = P->len;
+    GCM_finish(&g, T->val);
+    T->len = 16;
+}
+
+/* AES-GCM Decryption of octets, K is key, H is header,
+   P is plaintext, C is ciphertext, T is authentication tag */
+void core::AES_GCM_DECRYPT(octet *K, octet *IV, octet *H, octet *C, octet *P, octet *T)
+{
+    gcm g;
+    GCM_init(&g, K->len, K->val, IV->len, IV->val);
+    GCM_add_header(&g, H->val, H->len);
+    GCM_add_cipher(&g, P->val, C->val, C->len);
+    P->len = C->len;
+    GCM_finish(&g, T->val);
+    T->len = 16;
+}
+
+
+// Compile with
+// gcc -O2 gcm.c aes.c -o gcm.exe
+/* SU= 16
+*/
+
+/* static void hex2bytes(char *hex,char *bin) */
+/* { */
+/*  int i; */
+/*  char v; */
+/*  int len=strlen(hex); */
+/*  for (i = 0; i < len/2; i++) { */
+/*         char c = hex[2*i]; */
+/*         if (c >= '0' && c <= '9') { */
+/*             v = c - '0'; */
+/*         } else if (c >= 'A' && c <= 'F') { */
+/*             v = c - 'A' + 10; */
+/*         } else if (c >= 'a' && c <= 'f') { */
+/*             v = c - 'a' + 10; */
+/*         } else { */
+/*             v = 0; */
+/*         } */
+/*         v <<= 4; */
+/*         c = hex[2*i + 1]; */
+/*         if (c >= '0' && c <= '9') { */
+/*             v += c - '0'; */
+/*         } else if (c >= 'A' && c <= 'F') { */
+/*             v += c - 'A' + 10; */
+/*         } else if (c >= 'a' && c <= 'f') { */
+/*             v += c - 'a' + 10; */
+/*         } else { */
+/*             v = 0; */
+/*         } */
+/*         bin[i] = v; */
+/*     } */
+/* } */
+
+/*
+int main()
+{
+    int i;
+
+//  char* KT="feffe9928665731c6d6a8f9467308308";
+//  char* MT="d9313225f88406e5a55909c5aff5269a86a7a9531534f7da2e4c303d8a318a721c3c0c95956809532fcf0e2449a6b525b16aedf5aa0de657ba637b39";
+//  char* HT="feedfacedeadbeeffeedfacedeadbeefabaddad2";
+//  char* NT="cafebabefacedbaddecaf888";
+// Tag should be 5bc94fbc3221a5db94fae95ae7121a47
+//  char* NT="9313225df88406e555909c5aff5269aa6a7a9538534f7da1e4c303d2a318a728c3c0c95156809539fcf0e2429a6b525416aedbf5a0de6a57a637b39b";
+// Tag should be 619cc5aefffe0bfa462af43c1699d050
+
+  char* KT="6dfb5dc68af6ae2f3242e9184f100918";
+  char* MT="47809d16c2c6ec685962c90e53fe1bba";
+  char* HT="dd0fa6e494031139d71ee45f00d56fa4";
+  char* NT="37d36f5c54d53479d4745dd1";
+
+
+    int len=strlen(MT)/2;
+    int lenH=strlen(HT)/2;
+    int lenK=strlen(KT)/2;
+    int lenIV=strlen(NT)/2;
+
+    char T[16];   // Tag
+    char K[16];   // AES Key
+    char H[64];   // Header - to be included in Authentication, but not encrypted
+    char N[100];   // IV - Initialisation vector
+    char M[100];  // Plaintext to be encrypted/authenticated
+    char C[100];  // Ciphertext
+    char P[100];  // Recovered Plaintext
+
+    gcm g;
+
+    hex2bytes(MT, M);
+    hex2bytes(HT, H);
+    hex2bytes(NT, N);
+    hex2bytes(KT, K);
+
+    printf("lenK= %d\n",lenK);
+
+    printf("Plaintext=\n");
+    for (i=0;i<len;i++) printf("%02x",(unsigned char)M[i]);
+    printf("\n");
+
+    GCM_init(&g,16,K,lenIV,N);
+    GCM_add_header(&g,H,lenH);
+    GCM_add_plain(&g,C,M,len);
+    GCM_finish(&g,T);
+
+    printf("Ciphertext=\n");
+    for (i=0;i<len;i++) printf("%02x",(unsigned char)C[i]);
+    printf("\n");
+
+    printf("Tag=\n");
+    for (i=0;i<16;i++) printf("%02x",(unsigned char)T[i]);
+    printf("\n");
+
+    GCM_init(&g,16,K,lenIV,N);
+    GCM_add_header(&g,H,lenH);
+    GCM_add_cipher(&g,P,C,len);
+    GCM_finish(&g,T);
+
+    printf("Plaintext=\n");
+    for (i=0;i<len;i++) printf("%02x",(unsigned char)P[i]);
+    printf("\n");
+
+    printf("Tag=\n");
+    for (i=0;i<16;i++) printf("%02x",(unsigned char)T[i]);
+    printf("\n");
+}
+
+*/
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hash.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hash.cpp
new file mode 100644
index 0000000..5c1c3ac
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hash.cpp
@@ -0,0 +1,659 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/*
+ * Implementation of the Secure Hashing Algorithm (SHA-256/384/512 and SHA3)
+ *
+ * Generates a message digest. It should be impossible to come
+ * come up with two messages that hash to the same value ("collision free").
+ *
+ * For use with byte-oriented messages only. Could/Should be speeded
+ * up by unwinding loops in HASH_transform(), and assembly patches.
+ */
+
+#include "arch.h"
+#include "core.h"
+
+using namespace core;
+
+#define H0_256 0x6A09E667L
+#define H1_256 0xBB67AE85L
+#define H2_256 0x3C6EF372L
+#define H3_256 0xA54FF53AL
+#define H4_256 0x510E527FL
+#define H5_256 0x9B05688CL
+#define H6_256 0x1F83D9ABL
+#define H7_256 0x5BE0CD19L
+
+static const unsign32 K_256[64] =
+{
+    0x428a2f98L, 0x71374491L, 0xb5c0fbcfL, 0xe9b5dba5L, 0x3956c25bL, 0x59f111f1L, 0x923f82a4L, 0xab1c5ed5L,
+    0xd807aa98L, 0x12835b01L, 0x243185beL, 0x550c7dc3L, 0x72be5d74L, 0x80deb1feL, 0x9bdc06a7L, 0xc19bf174L,
+    0xe49b69c1L, 0xefbe4786L, 0x0fc19dc6L, 0x240ca1ccL, 0x2de92c6fL, 0x4a7484aaL, 0x5cb0a9dcL, 0x76f988daL,
+    0x983e5152L, 0xa831c66dL, 0xb00327c8L, 0xbf597fc7L, 0xc6e00bf3L, 0xd5a79147L, 0x06ca6351L, 0x14292967L,
+    0x27b70a85L, 0x2e1b2138L, 0x4d2c6dfcL, 0x53380d13L, 0x650a7354L, 0x766a0abbL, 0x81c2c92eL, 0x92722c85L,
+    0xa2bfe8a1L, 0xa81a664bL, 0xc24b8b70L, 0xc76c51a3L, 0xd192e819L, 0xd6990624L, 0xf40e3585L, 0x106aa070L,
+    0x19a4c116L, 0x1e376c08L, 0x2748774cL, 0x34b0bcb5L, 0x391c0cb3L, 0x4ed8aa4aL, 0x5b9cca4fL, 0x682e6ff3L,
+    0x748f82eeL, 0x78a5636fL, 0x84c87814L, 0x8cc70208L, 0x90befffaL, 0xa4506cebL, 0xbef9a3f7L, 0xc67178f2L
+};
+
+#define PAD  0x80
+#define ZERO 0
+
+/* functions */
+
+#define S(m,n,x) (((x)>>n) | ((x)<<(m-n)))
+#define R(n,x) ((x)>>n)
+
+#define Ch(x,y,z)  ((x&y)^(~(x)&z))
+#define Maj(x,y,z) ((x&y)^(x&z)^(y&z))
+#define Sig0_256(x)    (S(32,2,x)^S(32,13,x)^S(32,22,x))
+#define Sig1_256(x)    (S(32,6,x)^S(32,11,x)^S(32,25,x))
+#define theta0_256(x)  (S(32,7,x)^S(32,18,x)^R(3,x))
+#define theta1_256(x)  (S(32,17,x)^S(32,19,x)^R(10,x))
+
+#define Sig0_512(x)    (S(64,28,x)^S(64,34,x)^S(64,39,x))
+#define Sig1_512(x)    (S(64,14,x)^S(64,18,x)^S(64,41,x))
+#define theta0_512(x)  (S(64,1,x)^S(64,8,x)^R(7,x))
+#define theta1_512(x)  (S(64,19,x)^S(64,61,x)^R(6,x))
+
+
+/* SU= 72 */
+static void HASH256_transform(hash256 *sh)
+{
+    /* basic transformation step */
+    unsign32 a, b, c, d, e, f, g, h, t1, t2;
+    int j;
+    for (j = 16; j < 64; j++)
+        sh->w[j] = theta1_256(sh->w[j - 2]) + sh->w[j - 7] + theta0_256(sh->w[j - 15]) + sh->w[j - 16];
+
+    a = sh->h[0];
+    b = sh->h[1];
+    c = sh->h[2];
+    d = sh->h[3];
+    e = sh->h[4];
+    f = sh->h[5];
+    g = sh->h[6];
+    h = sh->h[7];
+
+    for (j = 0; j < 64; j++)
+    {
+        /* 64 times - mush it up */
+        t1 = h + Sig1_256(e) + Ch(e, f, g) + K_256[j] + sh->w[j];
+        t2 = Sig0_256(a) + Maj(a, b, c);
+        h = g;
+        g = f;
+        f = e;
+        e = d + t1;
+        d = c;
+        c = b;
+        b = a;
+        a = t1 + t2;
+    }
+
+    sh->h[0] += a;
+    sh->h[1] += b;
+    sh->h[2] += c;
+    sh->h[3] += d;
+    sh->h[4] += e;
+    sh->h[5] += f;
+    sh->h[6] += g;
+    sh->h[7] += h;
+}
+
+/* Initialise Hash function */
+void core::HASH256_init(hash256 *sh)
+{
+    /* re-initialise */
+    int i;
+    for (i = 0; i < 64; i++) sh->w[i] = 0L;
+    sh->length[0] = sh->length[1] = 0L;
+    sh->h[0] = H0_256;
+    sh->h[1] = H1_256;
+    sh->h[2] = H2_256;
+    sh->h[3] = H3_256;
+    sh->h[4] = H4_256;
+    sh->h[5] = H5_256;
+    sh->h[6] = H6_256;
+    sh->h[7] = H7_256;
+
+    sh->hlen = 32;
+}
+
+/* process a single byte */
+void core::HASH256_process(hash256 *sh, int byt)
+{
+    /* process the next message byte */
+    int cnt;
+    cnt = (int)((sh->length[0] / 32) % 16);
+
+    sh->w[cnt] <<= 8;
+    sh->w[cnt] |= (unsign32)(byt & 0xFF);
+
+    sh->length[0] += 8;
+    if (sh->length[0] == 0L)
+    {
+        sh->length[1]++;
+        sh->length[0] = 0L;
+    }
+    if ((sh->length[0] % 512) == 0) HASH256_transform(sh);
+}
+
+/* SU= 24 */
+/* Generate 32-byte final Hash */
+void core::HASH256_hash(hash256 *sh, char *digest)
+{
+    /* pad message and finish - supply digest */
+    int i;
+    unsign32 len0, len1;
+    len0 = sh->length[0];
+    len1 = sh->length[1];
+    HASH256_process(sh, PAD);
+    while ((sh->length[0] % 512) != 448) HASH256_process(sh, ZERO);
+    sh->w[14] = len1;
+    sh->w[15] = len0;
+    HASH256_transform(sh);
+    for (i = 0; i < sh->hlen; i++)
+    {
+        /* convert to bytes */
+        digest[i] = (char)((sh->h[i / 4] >> (8 * (3 - i % 4))) & 0xffL);
+    }
+    HASH256_init(sh);
+}
+
+/* return 32-byte intermediate hash */
+void core::HASH256_continuing_hash(hash256 *sh,char *digest)
+{
+    hash256 cp=*sh;
+    HASH256_hash(&cp,digest);
+}
+
+
+#define H0_512 0x6a09e667f3bcc908
+#define H1_512 0xbb67ae8584caa73b
+#define H2_512 0x3c6ef372fe94f82b
+#define H3_512 0xa54ff53a5f1d36f1
+#define H4_512 0x510e527fade682d1
+#define H5_512 0x9b05688c2b3e6c1f
+#define H6_512 0x1f83d9abfb41bd6b
+#define H7_512 0x5be0cd19137e2179
+
+#define H8_512 0xcbbb9d5dc1059ed8
+#define H9_512 0x629a292a367cd507
+#define HA_512 0x9159015a3070dd17
+#define HB_512 0x152fecd8f70e5939
+#define HC_512 0x67332667ffc00b31
+#define HD_512 0x8eb44a8768581511
+#define HE_512 0xdb0c2e0d64f98fa7
+#define HF_512 0x47b5481dbefa4fa4
+
+/* */
+
+static const unsign64 K_512[80] =
+{
+    0x428a2f98d728ae22 , 0x7137449123ef65cd , 0xb5c0fbcfec4d3b2f , 0xe9b5dba58189dbbc ,
+    0x3956c25bf348b538 , 0x59f111f1b605d019 , 0x923f82a4af194f9b , 0xab1c5ed5da6d8118 ,
+    0xd807aa98a3030242 , 0x12835b0145706fbe , 0x243185be4ee4b28c , 0x550c7dc3d5ffb4e2 ,
+    0x72be5d74f27b896f , 0x80deb1fe3b1696b1 , 0x9bdc06a725c71235 , 0xc19bf174cf692694 ,
+    0xe49b69c19ef14ad2 , 0xefbe4786384f25e3 , 0x0fc19dc68b8cd5b5 , 0x240ca1cc77ac9c65 ,
+    0x2de92c6f592b0275 , 0x4a7484aa6ea6e483 , 0x5cb0a9dcbd41fbd4 , 0x76f988da831153b5 ,
+    0x983e5152ee66dfab , 0xa831c66d2db43210 , 0xb00327c898fb213f , 0xbf597fc7beef0ee4 ,
+    0xc6e00bf33da88fc2 , 0xd5a79147930aa725 , 0x06ca6351e003826f , 0x142929670a0e6e70 ,
+    0x27b70a8546d22ffc , 0x2e1b21385c26c926 , 0x4d2c6dfc5ac42aed , 0x53380d139d95b3df ,
+    0x650a73548baf63de , 0x766a0abb3c77b2a8 , 0x81c2c92e47edaee6 , 0x92722c851482353b ,
+    0xa2bfe8a14cf10364 , 0xa81a664bbc423001 , 0xc24b8b70d0f89791 , 0xc76c51a30654be30 ,
+    0xd192e819d6ef5218 , 0xd69906245565a910 , 0xf40e35855771202a , 0x106aa07032bbd1b8 ,
+    0x19a4c116b8d2d0c8 , 0x1e376c085141ab53 , 0x2748774cdf8eeb99 , 0x34b0bcb5e19b48a8 ,
+    0x391c0cb3c5c95a63 , 0x4ed8aa4ae3418acb , 0x5b9cca4f7763e373 , 0x682e6ff3d6b2b8a3 ,
+    0x748f82ee5defb2fc , 0x78a5636f43172f60 , 0x84c87814a1f0ab72 , 0x8cc702081a6439ec ,
+    0x90befffa23631e28 , 0xa4506cebde82bde9 , 0xbef9a3f7b2c67915 , 0xc67178f2e372532b ,
+    0xca273eceea26619c , 0xd186b8c721c0c207 , 0xeada7dd6cde0eb1e , 0xf57d4f7fee6ed178 ,
+    0x06f067aa72176fba , 0x0a637dc5a2c898a6 , 0x113f9804bef90dae , 0x1b710b35131c471b ,
+    0x28db77f523047d84 , 0x32caab7b40c72493 , 0x3c9ebe0a15c9bebc , 0x431d67c49c100d4c ,
+    0x4cc5d4becb3e42b6 , 0x597f299cfc657e2a , 0x5fcb6fab3ad6faec , 0x6c44198c4a475817
+};
+
+static void HASH512_transform(hash512 *sh)
+{
+    /* basic transformation step */
+    unsign64 a, b, c, d, e, f, g, h, t1, t2;
+    int j;
+    for (j = 16; j < 80; j++)
+        sh->w[j] = theta1_512(sh->w[j - 2]) + sh->w[j - 7] + theta0_512(sh->w[j - 15]) + sh->w[j - 16];
+
+    a = sh->h[0];
+    b = sh->h[1];
+    c = sh->h[2];
+    d = sh->h[3];
+    e = sh->h[4];
+    f = sh->h[5];
+    g = sh->h[6];
+    h = sh->h[7];
+
+    for (j = 0; j < 80; j++)
+    {
+        /* 80 times - mush it up */
+        t1 = h + Sig1_512(e) + Ch(e, f, g) + K_512[j] + sh->w[j];
+        t2 = Sig0_512(a) + Maj(a, b, c);
+        h = g;
+        g = f;
+        f = e;
+        e = d + t1;
+        d = c;
+        c = b;
+        b = a;
+        a = t1 + t2;
+    }
+    sh->h[0] += a;
+    sh->h[1] += b;
+    sh->h[2] += c;
+    sh->h[3] += d;
+    sh->h[4] += e;
+    sh->h[5] += f;
+    sh->h[6] += g;
+    sh->h[7] += h;
+}
+
+void core::HASH384_init(hash384 *sh)
+{
+    /* re-initialise */
+    int i;
+    for (i = 0; i < 80; i++) sh->w[i] = 0;
+    sh->length[0] = sh->length[1] = 0;
+    sh->h[0] = H8_512;
+    sh->h[1] = H9_512;
+    sh->h[2] = HA_512;
+    sh->h[3] = HB_512;
+    sh->h[4] = HC_512;
+    sh->h[5] = HD_512;
+    sh->h[6] = HE_512;
+    sh->h[7] = HF_512;
+
+    sh->hlen = 48;
+}
+
+void core::HASH384_process(hash384 *sh, int byt)
+{
+    /* process the next message byte */
+    HASH512_process(sh, byt);
+}
+
+void core::HASH384_hash(hash384 *sh, char *digest)
+{
+    /* pad message and finish - supply digest */
+    HASH512_hash(sh, digest);
+}
+
+/* return intermediate hash */
+void core::HASH384_continuing_hash(hash384 *sh,char *digest)
+{
+    hash384 cp=*sh;
+    HASH384_hash(&cp,digest);
+}
+
+void core::HASH512_init(hash512 *sh)
+{
+    /* re-initialise */
+    int i;
+
+    for (i = 0; i < 80; i++) sh->w[i] = 0;
+    sh->length[0] = sh->length[1] = 0;
+    sh->h[0] = H0_512;
+    sh->h[1] = H1_512;
+    sh->h[2] = H2_512;
+    sh->h[3] = H3_512;
+    sh->h[4] = H4_512;
+    sh->h[5] = H5_512;
+    sh->h[6] = H6_512;
+    sh->h[7] = H7_512;
+
+    sh->hlen = 64;
+}
+
+void core::HASH512_process(hash512 *sh, int byt)
+{
+    /* process the next message byte */
+    int cnt;
+
+    cnt = (int)((sh->length[0] / 64) % 16);
+
+    sh->w[cnt] <<= 8;
+    sh->w[cnt] |= (unsign64)(byt & 0xFF);
+
+    sh->length[0] += 8;
+    if (sh->length[0] == 0L)
+    {
+        sh->length[1]++;
+        sh->length[0] = 0L;
+    }
+    if ((sh->length[0] % 1024) == 0) HASH512_transform(sh);
+}
+
+void core::HASH512_hash(hash512 *sh, char *digest)
+{
+    /* pad message and finish - supply digest */
+    int i;
+    unsign64 len0, len1;
+    len0 = sh->length[0];
+    len1 = sh->length[1];
+    HASH512_process(sh, PAD);
+    while ((sh->length[0] % 1024) != 896) HASH512_process(sh, ZERO);
+    sh->w[14] = len1;
+    sh->w[15] = len0;
+    HASH512_transform(sh);
+    for (i = 0; i < sh->hlen; i++)
+    {
+        /* convert to bytes */
+        digest[i] = (char)((sh->h[i / 8] >> (8 * (7 - i % 8))) & 0xffL);
+    }
+    HASH512_init(sh);
+}
+
+/* return intermediate hash */
+void core::HASH512_continuing_hash(hash512 *sh,char *digest)
+{
+    hash512 cp=*sh;
+    HASH512_hash(&cp,digest);
+}
+
+/* SHA3 */
+
+#define SHA3_ROUNDS 24
+#define rotl(x,n) (((x)<<n) | ((x)>>(64-n)))
+
+/* round constants */
+
+static const unsign64 RC[24] = {
+    0x0000000000000001UL, 0x0000000000008082UL, 0x800000000000808AUL, 0x8000000080008000UL,
+    0x000000000000808BUL, 0x0000000080000001UL, 0x8000000080008081UL, 0x8000000000008009UL,
+    0x000000000000008AUL, 0x0000000000000088UL, 0x0000000080008009UL, 0x000000008000000AUL,
+    0x000000008000808BUL, 0x800000000000008BUL, 0x8000000000008089UL, 0x8000000000008003UL,
+    0x8000000000008002UL, 0x8000000000000080UL, 0x000000000000800AUL, 0x800000008000000AUL,
+    0x8000000080008081UL, 0x8000000000008080UL, 0x0000000080000001UL, 0x8000000080008008UL
+};
+
+static void SHA3_transform(sha3 *sh)
+{
+    int k;
+    unsign64 B00,B01,B02,B03,B04,B10,B11,B12,B13,B14,B20,B21,B22,B23,B24,B30,B31,B32,B33,B34,B40,B41,B42,B43,B44;
+    unsign64 C0,C1,C2,C3,C4,D0,D1,D2,D3,D4;
+
+    for (k = 0; k < SHA3_ROUNDS; k++)
+    {
+
+        C0=sh->S[0] ^ sh->S[5] ^ sh->S[10] ^ sh->S[15] ^ sh->S[20];
+        C1=sh->S[1] ^ sh->S[6] ^ sh->S[11] ^ sh->S[16] ^ sh->S[21];
+        C2=sh->S[2] ^ sh->S[7] ^ sh->S[12] ^ sh->S[17] ^ sh->S[22];
+        C3=sh->S[3] ^ sh->S[8] ^ sh->S[13] ^ sh->S[18] ^ sh->S[23];
+        C4=sh->S[4] ^ sh->S[9] ^ sh->S[14] ^ sh->S[19] ^ sh->S[24];
+
+        D0 = C4 ^ rotl(C1, 1);
+        D1 = C0 ^ rotl(C2, 1);
+        D2 = C1 ^ rotl(C3, 1);
+        D3 = C2 ^ rotl(C4, 1);
+        D4 = C3 ^ rotl(C0, 1);
+
+        B00 =      sh->S[0]^D0;
+        B02 = rotl(sh->S[1]^D1, 1);
+        B04 = rotl(sh->S[2]^D2, 62);
+        B01 = rotl(sh->S[3]^D3, 28);
+        B03 = rotl(sh->S[4]^D4, 27);
+
+        B13 = rotl(sh->S[5]^D0, 36);
+        B10 = rotl(sh->S[6]^D1, 44);
+        B12 = rotl(sh->S[7]^D2, 6);
+        B14 = rotl(sh->S[8]^D3, 55);
+        B11 = rotl(sh->S[9]^D4, 20);
+
+        B21 = rotl(sh->S[10]^D0, 3);
+        B23 = rotl(sh->S[11]^D1, 10);
+        B20 = rotl(sh->S[12]^D2, 43);
+        B22 = rotl(sh->S[13]^D3, 25);
+        B24 = rotl(sh->S[14]^D4, 39);
+
+        B34 = rotl(sh->S[15]^D0, 41);
+        B31 = rotl(sh->S[16]^D1, 45);
+        B33 = rotl(sh->S[17]^D2, 15);
+        B30 = rotl(sh->S[18]^D3, 21);
+        B32 = rotl(sh->S[19]^D4, 8);
+
+        B42 = rotl(sh->S[20]^D0, 18);
+        B44 = rotl(sh->S[21]^D1, 2);
+        B41 = rotl(sh->S[22]^D2, 61);
+        B43 = rotl(sh->S[23]^D3, 56);
+        B40 = rotl(sh->S[24]^D4, 14);    
+
+        sh->S[0]=B00^(~B10&B20);
+        sh->S[1]=B10^(~B20&B30);
+        sh->S[2]=B20^(~B30&B40);
+        sh->S[3]=B30^(~B40&B00);
+        sh->S[4]=B40^(~B00&B10);
+
+        sh->S[5]=B01^(~B11&B21);
+        sh->S[6]=B11^(~B21&B31);
+        sh->S[7]=B21^(~B31&B41);
+        sh->S[8]=B31^(~B41&B01);
+        sh->S[9]=B41^(~B01&B11);
+
+        sh->S[10]=B02^(~B12&B22);
+        sh->S[11]=B12^(~B22&B32);
+        sh->S[12]=B22^(~B32&B42);
+        sh->S[13]=B32^(~B42&B02);
+        sh->S[14]=B42^(~B02&B12);
+
+        sh->S[15]=B03^(~B13&B23);
+        sh->S[16]=B13^(~B23&B33);
+        sh->S[17]=B23^(~B33&B43);
+        sh->S[18]=B33^(~B43&B03);
+        sh->S[19]=B43^(~B03&B13);
+
+        sh->S[20]=B04^(~B14&B24);
+        sh->S[21]=B14^(~B24&B34);
+        sh->S[22]=B24^(~B34&B44);
+        sh->S[23]=B34^(~B44&B04);
+        sh->S[24]=B44^(~B04&B14);
+
+        sh->S[0] ^= RC[k];
+    }
+}
+
+/* Re-Initialize. olen is output length in bytes -
+   should be 28, 32, 48 or 64 (224, 256, 384, 512 bits resp.) */
+
+void core::SHA3_init(sha3 *sh, int olen)
+{
+    int i;
+    for (i = 0; i < 25; i++)
+        sh->S[i] = 0;           /* 5x5x8 bytes = 200 bytes of state */
+
+    sh->length = 0;
+    sh->len = olen;
+    sh->rate = 200 - 2 * olen; /* number of bytes consumed in one gulp. Note that some bytes in the
+                            state ("capacity") are not touched. Gulps are smaller for larger digests.
+                            Important that olen<rate */
+}
+
+/* process a single byte */
+void core::SHA3_process(sha3 *sh, int byt)
+{
+    int cnt = (int)(sh->length);
+    int b = cnt % 8;
+    cnt /= 8;
+    sh->S[cnt] ^= ((unsign64)(byt & 0xff) << (8 * b));
+    sh->length++;
+    if (sh->length == sh->rate)
+    {
+        sh->length=0;
+        SHA3_transform(sh);
+    }
+}
+
+/* squeeze the sponge */
+void core::SHA3_squeeze(sha3 *sh, char *buff, int len)
+{
+    int i, j, k, m = 0;
+    unsign64 el;
+    int nb=len/sh->rate;
+// squeeze out full blocks
+    for (j=0;j<nb;j++ )
+    {
+        for (i=0;i<sh->rate/8;i++)
+        {
+            el=sh->S[i];
+            for (k=0;k<8;k++)
+            {
+               buff[m++] = (el & 0xff);
+               el >>= 8;
+            }
+        }
+        SHA3_transform(sh);    
+    }
+   
+// squeeze out whats left
+    i=0;
+    while (m<len)
+    {
+        el = sh->S[i++];
+        for (k = 0; k < 8; k++)
+        {
+            buff[m++] = (el & 0xff);
+            if (m >= len) break;
+            el >>= 8;
+        }    
+    } 
+}
+
+void core::SHA3_hash(sha3 *sh, char *digest)
+{   /* generate a SHA3 hash of appropriate size */
+    int q = sh->rate - sh->length;
+    if (q == 1) SHA3_process(sh, 0x86);
+    else
+    {
+        SHA3_process(sh, 0x06);  /* 0x06 for SHA-3 */
+        while (sh->length != sh->rate - 1) SHA3_process(sh, 0x00);
+        SHA3_process(sh, 0x80); /* this will force a final transform */
+    }
+    SHA3_squeeze(sh, digest, sh->len);
+}
+
+/* return intermediate hash */
+void core::SHA3_continuing_hash(sha3 *sh,char *digest)
+{
+    sha3 cp=*sh;
+    SHA3_hash(&cp,digest);
+}
+
+void core::SHA3_shake(sha3 *sh, char *digest, int len)
+{   /* SHAKE out a buffer of variable length len */
+    int q = sh->rate - sh->length;
+    if (q == 1) SHA3_process(sh, 0x9f);
+    else
+    {
+        SHA3_process(sh, 0x1f);  // 0x06 for SHA-3 !!!!
+        while (sh->length != sh->rate - 1) SHA3_process(sh, 0x00);
+        SHA3_process(sh, 0x80); /* this will force a final transform */
+    }
+    SHA3_squeeze(sh, digest, len);
+}
+
+/* return intermediate hash */
+void core::SHA3_continuing_shake(sha3 *sh,char *digest,int len)
+{
+    sha3 cp=*sh;
+    SHA3_shake(&cp,digest,len);
+}
+
+/* test program: should produce digest
+
+160 bit
+
+84983e44 1c3bd26e baae4aa1 f95129e5 e54670f1
+
+256 bit
+
+248d6a61 d20638b8 e5c02693 0c3e6039 a33ce459 64ff2167 f6ecedd4 19db06c1
+
+512 bit
+
+8e959b75dae313da 8cf4f72814fc143f 8f7779c6eb9f7fa1 7299aeadb6889018
+501d289e4900f7e4 331b99dec4b5433a c7d329eeb6dd2654 5e96e55b874be909
+
+384 bit
+
+09330c33f71147e8 3d192fc782cd1b47 53111b173b3b05d2 2fa08086e3b0f712
+fcc7c71a557e2db9 66c3e9fa91746039
+*/
+/*
+#include <stdio.h>
+
+char test160[]="abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq";
+char test256[]="abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq";
+char test512[]="abcdefghbcdefghicdefghijdefghijkefghijklfghijklmghijklmnhijklmnoijklmnopjklmnopqklmnopqrlmnopqrsmnopqrstnopqrstu";
+
+int main()
+{
+    char digest[100];
+    int i;
+
+    hash256 sh256;
+    hash384 sh384;
+    hash512 sh512;
+    sha3 SHA3;
+
+    HASH256_init(&sh256);
+    for (i=0;test256[i]!=0;i++) HASH256_process(&sh256,test256[i]);
+    HASH256_hash(&sh256,digest);
+    for (i=0;i<32;i++) printf("%02x",(unsigned char)digest[i]);
+    printf("\n");
+
+    HASH384_init(&sh384);
+    for (i=0;test512[i]!=0;i++) HASH384_process(&sh384,test512[i]);
+    HASH384_hash(&sh384,digest);
+    for (i=0;i<48;i++) printf("%02x",(unsigned char)digest[i]);
+    printf("\n");
+
+    HASH512_init(&sh512);
+    for (i=0;test512[i]!=0;i++) HASH512_process(&sh512,test512[i]);
+    HASH512_hash(&sh512,digest);
+    for (i=0;i<64;i++) printf("%02x",(unsigned char)digest[i]);
+    printf("\n");
+
+    SHA3_init(&SHA3,SHA3_HASH256);
+    for (i=0;test512[i]!=0;i++) SHA3_process(&SHA3,test512[i]);
+    SHA3_hash(&SHA3,digest);
+    for (i=0;i<32;i++) printf("%02x",(unsigned char)digest[i]);
+    printf("\n");
+
+    SHA3_init(&SHA3,SHA3_HASH512);
+    for (i=0;test512[i]!=0;i++) SHA3_process(&SHA3,test512[i]);
+    SHA3_hash(&SHA3,digest);
+    for (i=0;i<64;i++) printf("%02x",(unsigned char)digest[i]);
+    printf("\n");
+
+    SHA3_init(&SHA3,SHAKE256);
+    for (i=0;test512[i]!=0;i++) SHA3_process(&SHA3,test512[i]);
+    SHA3_shake(&SHA3,digest,72);
+    for (i=0;i<72;i++) printf("%02x",(unsigned char)digest[i]);
+    printf("\n");
+
+
+    return 0;
+}
+
+*/
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hmac.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hmac.cpp
new file mode 100644
index 0000000..37d221d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hmac.cpp
@@ -0,0 +1,701 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/*
+    HMAC functions
+*/
+
+#include "arch.h"
+#include "core.h"
+
+using namespace core;
+
+#define ROUNDUP(a,b) ((a)-1)/(b)+1
+#define CEIL(a,b) (((a)-1)/(b)+1)
+
+/* General Purpose hash function, padding with zeros, optional input octets p and x, optional integer n,hash to octet w of length olen */
+/* hash is the Hash family, either MC_SHA2 or MC_SHA3 */
+/* hlen should be 32,48 or 64 for MC_SHA2 (that is SHA256/384/512) */
+/* hlen should be 24,32,48,64 for MC_SHA3 */
+/* olen=0 -     output = hlen bytes */
+/* olen<=hlen -  output = olen bytes */
+/* olen>hlen  -  output is padded with leading zeros and then hlen bytes */
+
+void core::GPhash(int hash,int hlen,octet *w,int olen,int pad,octet *p,int n,octet *x)
+{
+    hash256 sh256;
+    hash384 sh384;
+    hash512 sh512;
+    sha3 sh3;
+    int i,c[4];
+    char hh[64];
+
+    if (n>=0)
+    {
+        c[0] = (n >> 24) & 0xff;
+        c[1] = (n >> 16) & 0xff;
+        c[2] = (n >> 8) & 0xff;
+        c[3] = (n) & 0xff;
+    }
+
+    switch (hash)
+    {
+    case MC_SHA2 :
+        switch (hlen)
+        {
+        case SHA256 :
+            HASH256_init(&sh256);
+            for (i=0;i<pad;i++) HASH256_process(&sh256,0);
+            if (p!=NULL)
+                for (i=0;i<p->len;i++) HASH256_process(&sh256,p->val[i]);
+            if (n>=0)
+                for (i=0;i<4;i++) HASH256_process(&sh256,c[i]);
+            if (x!=NULL)
+                for (i=0;i<x->len;i++) HASH256_process(&sh256,x->val[i]);
+            HASH256_hash(&sh256,hh);
+            break;
+        case SHA384 :
+            HASH384_init(&sh384);
+            for (i=0;i<pad;i++) HASH384_process(&sh384,0);
+            if (p!=NULL)
+                for (i=0;i<p->len;i++) HASH384_process(&sh384,p->val[i]);
+            if (n>=0)
+                for (i=0;i<4;i++) HASH384_process(&sh384,c[i]);
+            if (x!=NULL)
+                for (i=0;i<x->len;i++) HASH384_process(&sh384,x->val[i]);
+            HASH384_hash(&sh384,hh);
+            break;
+        case SHA512 :
+            HASH512_init(&sh512);
+            for (i=0;i<pad;i++) HASH512_process(&sh512,0);
+            if (p!=NULL)
+                for (i=0;i<p->len;i++) HASH512_process(&sh512,p->val[i]);
+            if (n>=0)
+                for (i=0;i<4;i++) HASH512_process(&sh512,c[i]);
+            if (x!=NULL)
+                for (i=0;i<x->len;i++) HASH512_process(&sh512,x->val[i]);
+            HASH512_hash(&sh512,hh);   
+            break;
+        }
+        break;
+    case MC_SHA3 :
+        SHA3_init(&sh3,hlen);
+        for (i=0;i<pad;i++) SHA3_process(&sh3,0);
+        if (p!=NULL)
+            for (i=0;p->len;i++) SHA3_process(&sh3,p->val[i]);
+        if (n>=0)
+            for (i=0;i<4;i++) SHA3_process(&sh3,c[i]);
+        if (x!=NULL)
+            for (i=0;x->len;i++) SHA3_process(&sh3,x->val[i]);
+        SHA3_hash(&sh3,hh);  
+        break;
+    default: return;
+    }
+    OCT_empty(w);
+    if (!olen)
+        OCT_jbytes(w,hh,hlen);
+    else
+    {
+        if (olen<=hlen)
+        {
+            OCT_jbytes(w,hh,olen);
+        } else {
+            OCT_jbyte(w, 0, olen - hlen);
+            OCT_jbytes(w, hh, hlen);
+        }
+    }
+}
+
+/* Simple hash octet p to octet w of length hlen */
+void core::SPhash(int hash, int hlen,octet *w, octet *p)
+{
+    GPhash(hash, hlen, w, 0, 0, p, -1, NULL);
+}
+
+static int blksize(int hash,int hlen)
+{
+    int blk=0;
+    switch (hash)
+    {
+    case MC_SHA2 :
+            blk=64;
+            if (hlen>32) blk=128;
+            break;
+    case MC_SHA3 :
+            blk=200-2*hlen;
+            break;
+    default: break;
+    }
+    return blk;
+}
+
+
+/* RFC 2104 */
+void core::HMAC(int hash,int hlen,octet *TAG,int olen,octet *K,octet *M)
+{
+    int blk;
+    char h[128],k0[200];   // assumes max block sizes
+    octet K0 = {0, sizeof(k0), k0};
+    octet H={0,sizeof(h),h};
+
+    blk=blksize(hash,hlen);
+    if (blk==0) return;
+
+    if (K->len > blk) SPhash(hash,hlen,&K0,K);
+    else              OCT_copy(&K0,K);
+
+    OCT_jbyte(&K0,0,blk-K0.len); 
+
+    OCT_xorbyte(&K0,0x36);
+
+
+    GPhash(hash,hlen,&H,0,0,&K0,-1,M); 
+
+    OCT_xorbyte(&K0,0x6a);   /* 0x6a = 0x36 ^ 0x5c */
+    GPhash(hash,hlen,&H,0,0,&K0,-1,&H);
+
+    OCT_empty(TAG);
+    OCT_jbytes(TAG,H.val,olen);
+
+    OCT_clear(&H);
+    OCT_clear(&K0);
+}
+
+/* RFC 5869 */
+
+void core::HKDF_Extract(int hash,int hlen,octet *PRK,octet *SALT,octet *IKM)
+{
+    char h[64];
+    octet H={0,sizeof(h),h};
+    if (SALT==NULL) {
+        OCT_jbyte(&H,0,hlen);
+        HMAC(hash,hlen,PRK,hlen,&H,IKM);
+    } else {
+        HMAC(hash,hlen,PRK,hlen,SALT,IKM);
+    }
+}
+
+void core::HKDF_Expand(int hash,int hlen,octet *OKM,int olen,octet *PRK,octet *INFO)
+{
+    int i;
+    char t[1024];  // >= info.length+hlen+1
+    octet T={0,sizeof(t),t};
+    int n=olen/hlen; 
+    int flen=olen%hlen;
+    OCT_empty(OKM);
+
+    for (i=1;i<=n;i++)
+    {
+        OCT_joctet(&T,INFO);
+        OCT_jbyte(&T,i,1);
+        HMAC(hash,hlen,&T,hlen,PRK,&T);
+        OCT_joctet(OKM,&T);
+    }
+    if (flen>0)
+    {
+        OCT_joctet(&T,INFO);
+        OCT_jbyte(&T,n+1,1);
+        HMAC(hash,hlen,&T,flen,PRK,&T);
+        OCT_joctet(OKM,&T);
+    }
+}
+
+/* https://datatracker.ietf.org/doc/draft-irtf-cfrg-hash-to-curve/ */
+
+void core::XOF_Expand(int hlen,octet *OKM,int olen,octet *DST,octet *M)
+{
+    int i;
+    sha3 SHA3;
+    SHA3_init(&SHA3,hlen);
+    for (i=0;i<M->len;i++) SHA3_process(&SHA3,M->val[i]);
+    SHA3_process(&SHA3,olen/256);
+    SHA3_process(&SHA3,olen%256);
+
+    for (i=0;i<DST->len;i++)
+        SHA3_process(&SHA3,DST->val[i]);
+    SHA3_process(&SHA3,DST->len);
+
+    SHA3_shake(&SHA3,OKM->val,olen);
+    OKM->len=olen;
+}
+
+static void XMD_Expand_Short_DST(int hash, int hlen,octet *OKM,int olen,octet *DST,octet *M)
+{
+    int i,blk;
+    int ell=CEIL(olen,hlen);
+    char tmp[260]; 
+    octet TMP={0,sizeof(tmp),tmp};
+    char h0[64];
+    octet H0 = {0, sizeof(h0), h0};
+    char h1[64];
+    octet H1 = {0, sizeof(h1), h1};
+
+    blk=blksize(hash,hlen);
+    OCT_jint(&TMP,olen,2);
+    OCT_jint(&TMP,0,1);
+    OCT_joctet(&TMP,DST);
+    OCT_jint(&TMP,DST->len,1);
+
+    GPhash(hash,hlen,&H0,0,blk,M,-1,&TMP);
+    OCT_empty(&TMP);
+    OCT_jint(&TMP,1,1);
+    OCT_joctet(&TMP,DST);
+    OCT_jint(&TMP,DST->len,1);
+
+    GPhash(hash,hlen,&H1,0,0,&H0,-1,&TMP);
+    OCT_empty(OKM);
+    OCT_joctet(OKM,&H1);
+    for (i=2;i<=ell;i++)
+    {
+        OCT_xor(&H1,&H0);
+        OCT_empty(&TMP);
+        OCT_jint(&TMP,i,1);
+        OCT_joctet(&TMP,DST);
+        OCT_jint(&TMP,DST->len,1);
+        GPhash(hash,hlen,&H1,0,0,&H1,-1,&TMP);
+        OCT_joctet(OKM,&H1);
+    }
+    OKM->len=olen; 
+}
+
+void core::XMD_Expand(int hash, int hlen,octet *OKM,int olen,octet *DST,octet *M)
+{
+    char w[64];
+    octet W = {0, sizeof(w), w};
+    char os[20];
+    octet OS={0,sizeof(os),os};
+    OCT_jstring(&OS,(char *)"H2C-OVERSIZE-DST-");
+    if (DST->len>=256)
+    {
+        GPhash(hash,hlen,&W,0,0,&OS,-1,DST);
+        XMD_Expand_Short_DST(hash,hlen,OKM,olen,&W,M);
+    } else {
+        XMD_Expand_Short_DST(hash,hlen,OKM,olen,DST,M);
+    }
+}
+
+/* Key Derivation Function */
+
+void core::KDF2(int hash, int hlen, octet *key, int olen, octet *z, octet *p)
+{
+    /* NOTE: the parameter olen is the length of the output k in bytes */
+    char h[64];
+    octet H = {0, sizeof(h), h};
+    int counter, cthreshold;
+
+    OCT_empty(key);
+
+    cthreshold = ROUNDUP(olen, hlen);
+
+    for (counter = 1; counter <= cthreshold; counter++)
+    {
+        GPhash(hash,hlen, &H, 0, 0, z, counter, p);
+        if (key->len + hlen > olen)  OCT_jbytes(key, H.val, olen % hlen);
+        else                     OCT_joctet(key, &H);
+    }
+
+}
+
+/* Password based Key Derivation Function */
+/* Input password p, salt s, and repeat count */
+/* Output key of length olen */
+void core::PBKDF2(int hash, int hlen, octet *key, int olen, octet *p, octet *s, int rep)
+{
+    int i, j, len, d = ROUNDUP(olen, hlen);
+    char f[64], u[64];
+    octet F = {0, sizeof(f), f};
+    octet U = {0, sizeof(u), u};
+    OCT_empty(key);
+
+    for (i = 1; i <= d; i++)
+    {
+        len = s->len;
+        OCT_jint(s, i, 4);
+
+        HMAC(hash, hlen, &F, hlen, s, p);
+
+        s->len = len;
+        OCT_copy(&U, &F);
+        for (j = 2; j <= rep; j++)
+        {
+            HMAC(hash, hlen, &U, hlen, &U, p);
+            OCT_xor(&F, &U);
+        }
+
+        OCT_joctet(key, &F);
+    }
+
+    OCT_chop(key, NULL, olen);
+}
+
+/* RSA Auxiliary Functions */
+
+#define MAX_RSA_BYTES 512 /**< Maximum of 4096 */
+
+/* Mask Generation Function */
+
+static void MGF1(int sha, octet *z, int olen, octet *mask)
+{
+    char h[64];
+    octet H = {0, sizeof(h), h};
+    int hlen = sha;
+    int counter, cthreshold;
+
+    OCT_empty(mask);
+
+    cthreshold = ROUNDUP(olen, hlen);
+    for (counter = 0; counter < cthreshold; counter++)
+    {
+        GPhash(MC_SHA2,sha,&H,0,0,z,counter,NULL);
+        //hashit(sha, z, counter, &H);
+        if (mask->len + hlen > olen) OCT_jbytes(mask, H.val, olen % hlen);
+        else                     OCT_joctet(mask, &H);
+    }
+    OCT_clear(&H);
+}
+
+/* MGF1 plus masking */
+static void MGF1XOR(int sha, octet *z, octet *w)
+{
+    char h[64];
+    octet H = {0, sizeof(h), h};
+    int i,len,wlen,hlen = sha;
+    int counter, cthreshold;
+
+    wlen=0;
+    cthreshold = ROUNDUP(w->len, hlen);
+    for (counter = 0; counter < cthreshold; counter++)
+    {
+        GPhash(MC_SHA2,sha,&H,0,0,z,counter,NULL);
+        if (wlen+hlen <= w->len)
+            len=hlen;
+        else 
+            len=w->len%hlen;
+  
+        for (i=0;i<len;i++)
+            w->val[wlen+i]^=H.val[i];
+        wlen+=len;
+    }      
+    OCT_clear(&H);
+}
+
+
+/* SHAXXX identifier strings */
+const unsigned char SHA256ID[] = {0x30, 0x31, 0x30, 0x0d, 0x06, 0x09, 0x60, 0x86, 0x48, 0x01, 0x65, 0x03, 0x04, 0x02, 0x01, 0x05, 0x00, 0x04, 0x20};
+const unsigned char SHA384ID[] = {0x30, 0x41, 0x30, 0x0d, 0x06, 0x09, 0x60, 0x86, 0x48, 0x01, 0x65, 0x03, 0x04, 0x02, 0x02, 0x05, 0x00, 0x04, 0x30};
+const unsigned char SHA512ID[] = {0x30, 0x51, 0x30, 0x0d, 0x06, 0x09, 0x60, 0x86, 0x48, 0x01, 0x65, 0x03, 0x04, 0x02, 0x03, 0x05, 0x00, 0x04, 0x40};
+
+/* PKCS 1.5 padding of a message to be signed */
+
+int core::PKCS15(int sha, octet *m, octet *w)
+{
+    int olen = w->max;
+    int hlen = sha;
+    int idlen = 19;
+    char h[64];
+    octet H = {0, sizeof(h), h};
+
+    if (olen < idlen + hlen + 10) return 0;
+    GPhash(MC_SHA2,sha,&H,0,0,m,-1,NULL);
+
+    OCT_empty(w);
+    OCT_jbyte(w, 0x00, 1);
+    OCT_jbyte(w, 0x01, 1);
+    OCT_jbyte(w, 0xff, olen - idlen - hlen - 3);
+    OCT_jbyte(w, 0x00, 1);
+
+    if (hlen == 32) OCT_jbytes(w, (char *)SHA256ID, idlen);
+    if (hlen == 48) OCT_jbytes(w, (char *)SHA384ID, idlen);
+    if (hlen == 64) OCT_jbytes(w, (char *)SHA512ID, idlen);
+
+    OCT_joctet(w, &H);
+
+    return 1;
+}
+
+/* Alternate form, without the NULL 0500 */
+
+/* SHAXXX identifier strings */
+const unsigned char SHA256IDb[] = {0x30, 0x2f, 0x30, 0x0b, 0x06, 0x09, 0x60, 0x86, 0x48, 0x01, 0x65, 0x03, 0x04, 0x02, 0x01, 0x04, 0x20};
+const unsigned char SHA384IDb[] = {0x30, 0x3f, 0x30, 0x0b, 0x06, 0x09, 0x60, 0x86, 0x48, 0x01, 0x65, 0x03, 0x04, 0x02, 0x02, 0x04, 0x30};
+const unsigned char SHA512IDb[] = {0x30, 0x4f, 0x30, 0x0b, 0x06, 0x09, 0x60, 0x86, 0x48, 0x01, 0x65, 0x03, 0x04, 0x02, 0x03, 0x04, 0x40};
+
+/* PKCS 1.5 padding of a message to be signed */
+
+int core::PKCS15b(int sha, octet *m, octet *w)
+{
+    int olen = w->max;
+    int hlen = sha;
+    int idlen = 17;
+    char h[64];
+    octet H = {0, sizeof(h), h};
+
+    if (olen < idlen + hlen + 10) return 0;
+    GPhash(MC_SHA2,sha,&H,0,0,m,-1,NULL);
+
+    OCT_empty(w);
+    OCT_jbyte(w, 0x00, 1);
+    OCT_jbyte(w, 0x01, 1);
+    OCT_jbyte(w, 0xff, olen - idlen - hlen - 3);
+    OCT_jbyte(w, 0x00, 1);
+
+    if (hlen == 32) OCT_jbytes(w, (char *)SHA256IDb, idlen);
+    if (hlen == 48) OCT_jbytes(w, (char *)SHA384IDb, idlen);
+    if (hlen == 64) OCT_jbytes(w, (char *)SHA512IDb, idlen);
+
+    OCT_joctet(w, &H);
+
+    return 1;
+}
+
+/* PSS Encoding of message to be signed. Salt is hlen */
+
+int core::PSS_ENCODE(int sha, octet *m, csprng *RNG, octet *w)
+{ 
+    unsigned char mask;
+    char h[64];
+    octet H = {0, sizeof(h), h};
+    char md[136];
+    octet MD={0,sizeof(md),md};
+    char  salt[64];
+    octet SALT={0,sizeof(salt),salt};
+    int hlen=sha;
+    int emlen=w->max;
+    int embits=8*emlen-1;
+
+    OCT_rand(&SALT, RNG, hlen);  
+
+    mask=(0xff)>>(8*emlen-embits);
+
+    GPhash(MC_SHA2,sha,&H,0,0,m,-1,NULL);
+    if (emlen < hlen + hlen +  2) return 0; 
+
+    OCT_jbyte(&MD,0,8);
+    OCT_joctet(&MD,&H);
+    OCT_joctet(&MD,&SALT);
+
+    GPhash(MC_SHA2,sha,&H,0,0,&MD,-1,NULL);
+    OCT_clear(w);
+    OCT_jbyte(w,0,emlen-hlen-hlen-2);
+    OCT_jbyte(w,0x01,1);
+    OCT_joctet(w,&SALT);
+    MGF1XOR(sha,&H,w);
+    w->val[0]&=mask;
+
+    OCT_joctet(w,&H);
+    OCT_jbyte(w,0xbc,1);
+
+    return 1;
+}
+
+int core::PSS_VERIFY(int sha, octet *m,octet *w)
+{
+    int i,k;
+    unsigned char mask;
+    char hmask[64];
+    octet HMASK = {0, sizeof(hmask), hmask};
+    char h[64];
+    octet H = {0, sizeof(h), h};
+    char db[MAX_RSA_BYTES];
+    octet DB = {0, sizeof(db), db};
+    char salt[64];
+    octet SALT={0,sizeof(salt),salt};
+    int hlen=sha;
+    int emlen=w->len;
+    int embits=8*emlen-1;
+
+    mask=(0xff)>>(8*emlen-embits);
+
+    GPhash(MC_SHA2,sha,&HMASK,0,0,m,-1,NULL);
+    if (emlen < hlen + hlen +  2) return 0; 
+    if (w->val[emlen-1]!=(char)0xbc) return 0;
+    if ((w->val[0]&(~mask))!=0) return 0;
+
+    OCT_jbytes(&DB,w->val,emlen-hlen-1);
+    OCT_jbytes(&H,&w->val[emlen-hlen-1],hlen);
+    
+    MGF1XOR(sha,&H,&DB);
+    DB.val[0]&=mask;
+
+    k=0;
+    for (i=0;i<emlen-hlen-hlen-2;i++)
+        k|=DB.val[i];
+    if (k!=0) return 0;
+    if (DB.val[emlen-hlen-hlen-2]!=0x01) return 0;
+    OCT_jbytes(&SALT,&DB.val[DB.len-hlen],hlen);
+    
+    OCT_clear(&DB);
+    OCT_jbyte(&DB,0,8);
+    OCT_joctet(&DB,&HMASK);
+    OCT_joctet(&DB,&SALT);
+    GPhash(MC_SHA2,sha,&HMASK,0,0,&DB,-1,NULL);
+
+    if (!OCT_ncomp(&H,&HMASK,H.len))
+        return 0;
+
+    return 1;
+}
+
+/* OAEP Message Encoding for Encryption */
+
+int core::OAEP_ENCODE(int sha, octet *m, csprng *RNG, octet *p, octet *f)
+{
+    int slen, olen = f->max - 1;
+    int mlen = m->len;
+    int hlen, seedlen;
+    char dbmask[MAX_RSA_BYTES], seed[64];
+    octet DBMASK = {0, sizeof(dbmask), dbmask};
+    octet SEED = {0, sizeof(seed), seed};
+
+    hlen = seedlen = sha;
+    if (mlen > olen - hlen - seedlen - 1) return 0;
+    if (m == f) return 0; /* must be distinct octets */
+
+    GPhash(MC_SHA2,sha,f,0,0,p,-1,NULL);
+    //hashit(sha, p, -1, f);
+
+    slen = olen - mlen - hlen - seedlen - 1;
+
+    OCT_jbyte(f, 0, slen);
+    OCT_jbyte(f, 0x1, 1);
+    OCT_joctet(f, m);
+
+    OCT_rand(&SEED, RNG, seedlen);
+
+    MGF1(sha, &SEED, olen - seedlen, &DBMASK);
+
+    OCT_xor(&DBMASK, f);
+    MGF1(sha, &DBMASK, seedlen, f);
+
+    OCT_xor(f, &SEED);
+
+    OCT_joctet(f, &DBMASK);
+
+    OCT_pad(f, f->max);
+    OCT_clear(&SEED);
+    OCT_clear(&DBMASK);
+
+    return 1;
+}
+
+/* OAEP Message Decoding for Decryption */
+
+int core::OAEP_DECODE(int sha, octet *p, octet *f)
+{
+    int comp, x, t;
+    int i, k, olen = f->max - 1;
+    int hlen, seedlen;
+    char dbmask[MAX_RSA_BYTES], seed[64], chash[64];
+    octet DBMASK = {0, sizeof(dbmask), dbmask};
+    octet SEED = {0, sizeof(seed), seed};
+    octet CHASH = {0, sizeof(chash), chash};
+
+    seedlen = hlen = sha;
+    if (olen < seedlen + hlen + 1) return 0;
+    if (!OCT_pad(f, olen + 1)) return 0;
+
+    GPhash(MC_SHA2,sha,&CHASH,0,0,p,-1,NULL);
+    //hashit(sha, p, -1, &CHASH);
+
+    x = f->val[0];
+    for (i = seedlen; i < olen; i++)
+        DBMASK.val[i - seedlen] = f->val[i + 1];
+    DBMASK.len = olen - seedlen;
+
+    MGF1(sha, &DBMASK, seedlen, &SEED);
+    for (i = 0; i < seedlen; i++) SEED.val[i] ^= f->val[i + 1];
+    MGF1(sha, &SEED, olen - seedlen, f);
+    OCT_xor(&DBMASK, f);
+
+    comp = OCT_ncomp(&CHASH, &DBMASK, hlen);
+
+    OCT_shl(&DBMASK, hlen);
+
+    OCT_clear(&SEED);
+    OCT_clear(&CHASH);
+
+// find first non-zero t in array
+    t=k=0;
+    for (i=0;i<DBMASK.len;i++)
+    {
+        if (t==0 && DBMASK.val[i]!=0) {
+            k=i;
+            t=DBMASK.val[i];
+        }
+    }
+
+    if (!comp || x != 0 || t != 0x01)
+    {
+        OCT_clear(&DBMASK);
+        return 0;
+    }
+
+    OCT_shl(&DBMASK, k + 1);
+    OCT_copy(f, &DBMASK);
+    OCT_clear(&DBMASK);
+
+    return 1;
+}
+
+
+
+/* g++ -O2 hmac.cpp oct.cpp hash.cpp rand.cpp -o hmac 
+
+int main()
+{
+    char dst[100],msg[100],okm[100];
+    octet DST={0,sizeof(dst),dst};
+    octet MSG={0,sizeof(msg),msg};
+    octet OKM={0,sizeof(okm),okm};
+
+    OCT_jstring(&MSG,(char *)"abc");
+    OCT_jstring(&DST,(char *)"P256_XMD:SHA-256_SSWU_RO_TESTGEN");
+//    XMD_Expand(MC_SHA2,32,&OKM,48,&DST,&MSG);
+    XOF_Expand(SHAKE128,&OKM,48,&DST,&MSG);
+
+    printf("OKM= %d ",OKM.len); OCT_output(&OKM);
+
+    char ikm[22],salt[13],prk[32],info[10],okm[50];  
+    octet IKM = {0, sizeof(ikm), ikm};
+    octet SALT={0,sizeof(salt),salt};
+    octet PRK={0,sizeof(prk),prk};
+    octet OKM={0,sizeof(okm),okm};
+    octet INFO={0,sizeof(info),info};
+    int i;
+    for (i=0;i<22;i++) IKM.val[i]=0x0b;
+    for (i=0;i<13;i++) SALT.val[i]=i;
+    for (i=0;i<10;i++) INFO.val[i]=0xf0+i;
+    
+    IKM.len=22; SALT.len=13; INFO.len=10;
+
+    printf("IKM= "); OCT_output(&IKM); 
+    printf("SALT= "); OCT_output(&SALT); 
+
+    HKDF_Extract(MC_SHA2,32,&PRK,&SALT,&IKM);
+
+    //HMAC(&PRK,32,&SALT,&IKM,SHA2,32);
+
+    printf("PRK= "); OCT_output(&PRK); 
+
+    HKDF_Expand(MC_SHA2,32,&OKM,42,&PRK,&INFO);
+
+    printf("OKM= %d ",OKM.len); OCT_output(&OKM);  
+}
+
+*/
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke.cpp
new file mode 100644
index 0000000..f9cd209
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke.cpp
@@ -0,0 +1,281 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* Hybrid Public Key Encryption */
+
+/* Following https://datatracker.ietf.org/doc/draft-irtf-cfrg-hpke/?include_text=1 */
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include "hpke_ZZZ.h"
+
+#define GROUP EGS_ZZZ
+#define POINT (2*EFS_ZZZ+1)
+#define MAX_HASH HASH_TYPE_ZZZ
+#define MAX_LABEL 20                // may need adjustment
+
+static void ZZZ::LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM)
+{
+    char likm[18+MAX_LABEL+2*POINT];
+    octet LIKM={0,sizeof(likm),likm};
+    OCT_jstring(&LIKM,(char *)"HPKE-v1");
+    OCT_joctet(&LIKM,SUITE_ID);
+    OCT_jstring(&LIKM,label);
+    if (IKM!=NULL)
+        OCT_joctet(&LIKM,IKM);
+    HKDF_Extract(MC_SHA2,HASH_TYPE_ZZZ,PRK,SALT,&LIKM);
+}
+
+static void ZZZ::LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L)
+{
+    char linfo[20+MAX_LABEL+3*POINT];
+    octet LINFO={0,sizeof(linfo),linfo};
+    OCT_jint(&LINFO,L,2);    
+    OCT_jstring(&LINFO,(char *)"HPKE-v1");
+    OCT_joctet(&LINFO,SUITE_ID);
+    OCT_jstring(&LINFO,label);
+    if (INFO!=NULL)
+        OCT_joctet(&LINFO,INFO);
+    HKDF_Expand(MC_SHA2,HASH_TYPE_ZZZ,OKM,L,PRK,&LINFO);
+}
+
+static void ZZZ::ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT)
+{
+    char prk[MAX_HASH];
+    octet PRK={0,sizeof(prk),prk};
+    char suite_id[10];
+    octet SUITE_ID={0,sizeof(suite_id),suite_id};
+
+    int kem_id=config_id&255;
+    OCT_jstring(&SUITE_ID,(char *)"KEM");
+    OCT_jint(&SUITE_ID,kem_id,2);
+
+    LabeledExtract(&PRK,NULL,&SUITE_ID,(char *)"eae_prk",DH);
+    LabeledExpand(OKM, &PRK,&SUITE_ID,(char *)"shared_secret",CONTEXT,HASH_TYPE_ZZZ);  
+}
+
+int ZZZ::DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED)
+{
+    int counter=0;
+    char prk[MAX_HASH];
+    octet PRK={0,sizeof(prk),prk};
+    char suite_id[10];
+    octet SUITE_ID={0,sizeof(suite_id),suite_id};
+    char info[2];
+    octet INFO={0,sizeof(info),info};
+    int bit_mask,kem=config_id&255;
+    OCT_jstring(&SUITE_ID,(char *)"KEM");
+    OCT_jint(&SUITE_ID,kem,2);
+    LabeledExtract(&PRK,NULL,&SUITE_ID,(char *)"dkp_prk",SEED);
+
+//printf("PRK= ");OCT_output(&PRK); printf("\n");
+
+    if (kem==32 || kem==33)
+    { // RFC7748
+        LabeledExpand(SK,&PRK,&SUITE_ID,(char *)"sk",NULL,GROUP);
+        OCT_reverse(SK);
+        if (kem==32)
+        {
+            SK->val[GROUP-1]&=248;  
+            SK->val[0]&=127;
+            SK->val[0]|=64;
+        } else {
+            SK->val[GROUP-1]&=252;
+            SK->val[0]|=128;
+        }
+
+    } else {
+        if (kem==18) bit_mask=1;
+        else bit_mask=0xFF;
+        OCT_clear(SK);
+        while (!ECP_IN_RANGE(SK) && counter<256)
+        {
+            OCT_empty(&INFO);
+            OCT_jbyte(&INFO,counter,1);
+            LabeledExpand(SK,&PRK,&SUITE_ID,(char *)"candidate",&INFO,GROUP);
+            SK->val[0]&=bit_mask;
+            counter++;
+        }
+    }
+//printf("SK= ");OCT_output(SK); printf("\n");
+//printf("kem= %d\n",kem);
+//printf("counter= %d\n",counter);
+    ECP_KEY_PAIR_GENERATE(NULL, SK, PK);
+    if (kem==32 || kem==33)
+        OCT_reverse(PK);
+ 
+    if (counter<256) return 1;
+    else return 0;
+}
+
+void ZZZ::HPKE_Encap(int config_id,octet *skE,octet *Z,octet *pkE,octet *pkR)
+{
+    int res,kem;
+    char dh[POINT];
+    octet DH={0,sizeof(dh),dh};
+    char kemcontext[2*POINT];
+    octet KEMCONTEXT={0,sizeof(kemcontext),kemcontext};
+    kem=config_id&255;
+
+    if (kem==32 || kem==33) 
+    {
+        OCT_reverse(pkR);
+        res=ECP_SVDP_DH(skE, pkR, &DH, 0);
+        OCT_reverse(pkR);
+        OCT_reverse(&DH);
+    } else {
+        res=ECP_SVDP_DH(skE, pkR, &DH, 0);
+    }
+
+    OCT_copy(&KEMCONTEXT,pkE);
+    OCT_joctet(&KEMCONTEXT,pkR);
+    ExtractAndExpand(config_id,Z,&DH,&KEMCONTEXT);
+}
+
+void ZZZ::HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR)
+{
+    int res,kem;
+    char dh[POINT];
+    octet DH={0,sizeof(dh),dh};
+    char kemcontext[2*POINT];
+    octet KEMCONTEXT={0,sizeof(kemcontext),kemcontext};
+    kem=config_id&255;
+
+    if (kem==32 || kem==33)
+    {
+        OCT_reverse(pkE);
+        ECP_SVDP_DH(skR, pkE, &DH, 0);
+        OCT_reverse(pkE);
+        OCT_reverse(&DH);
+    } else {
+        ECP_SVDP_DH(skR, pkE, &DH, 0);
+    }
+
+    OCT_copy(&KEMCONTEXT,pkE);
+    OCT_joctet(&KEMCONTEXT,pkR);
+
+    ExtractAndExpand(config_id,Z,&DH,&KEMCONTEXT);
+}
+
+void ZZZ::HPKE_AuthEncap(int config_id,octet *skE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS)
+{
+    int res,kem;
+    char dh[2*POINT];
+    octet DH={0,sizeof(dh),dh};
+    char dh1[POINT];
+    octet DH1={0,sizeof(dh1),dh1};
+    char kemcontext[3*POINT];
+    octet KEMCONTEXT={0,sizeof(kemcontext),kemcontext};
+
+    kem=config_id&255;
+
+    if (kem==32 || kem==33)
+    {
+        OCT_reverse(pkR);
+        ECP_SVDP_DH(skE, pkR, &DH,0);
+        ECP_SVDP_DH(skS, pkR, &DH1,0);
+        OCT_reverse(pkR);
+        OCT_reverse(&DH);
+        OCT_reverse(&DH1);
+    } else {
+        ECP_SVDP_DH(skE, pkR, &DH, 0);
+        ECP_SVDP_DH(skS, pkR, &DH1,0);
+    }
+
+    OCT_joctet(&DH,&DH1);
+    OCT_copy(&KEMCONTEXT,pkE);
+    OCT_joctet(&KEMCONTEXT,pkR);
+    OCT_joctet(&KEMCONTEXT,pkS);
+
+    ExtractAndExpand(config_id,Z,&DH,&KEMCONTEXT);
+}
+
+void ZZZ::HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS)
+{
+    int res,kem;
+    char dh[2*POINT];
+    octet DH={0,sizeof(dh),dh};
+    char dh1[POINT];
+    octet DH1={0,sizeof(dh1),dh1};
+    char kemcontext[3*POINT];
+    octet KEMCONTEXT={0,sizeof(kemcontext),kemcontext};
+
+    kem=config_id&255;
+
+    if (kem==32 || kem==33) {
+        OCT_reverse(pkE);
+        OCT_reverse(pkS);
+        ECP_SVDP_DH(skR, pkE, &DH,0);
+        ECP_SVDP_DH(skR, pkS, &DH1,0);
+        OCT_reverse(pkE);
+        OCT_reverse(pkS);
+        OCT_reverse(&DH);
+        OCT_reverse(&DH1);
+    } else {
+        ECP_SVDP_DH(skR, pkE, &DH, 0);
+        ECP_SVDP_DH(skR, pkS, &DH1, 0);
+    }
+    OCT_joctet(&DH,&DH1);
+
+    OCT_copy(&KEMCONTEXT,pkE);
+    OCT_joctet(&KEMCONTEXT,pkR);
+    OCT_joctet(&KEMCONTEXT,pkS);
+
+    ExtractAndExpand(config_id,Z,&DH,&KEMCONTEXT);
+}
+
+void ZZZ::HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID)
+{
+    char context[1+2*MAX_HASH];
+    octet CONTEXT={0,sizeof(context),context};
+
+    char h[MAX_HASH];
+    octet H={0,sizeof(h),h};
+    char secret_h[MAX_HASH];
+    octet secret={0,sizeof(secret_h),secret_h};
+
+    int kem_id=config_id&255;
+    int kdf_id=(config_id>>8)&3;
+    int aead_id=(config_id>>10)&3;
+
+    char suite_id[10];
+    octet SUITE_ID={0,sizeof(suite_id),suite_id};
+    OCT_jstring(&SUITE_ID,(char *)"HPKE");
+    OCT_jint(&SUITE_ID,kem_id,2);
+    OCT_jint(&SUITE_ID,kdf_id,2);
+    OCT_jint(&SUITE_ID,aead_id,2);
+
+    OCT_jint(&CONTEXT,mode,1);
+
+    LabeledExtract(&H,NULL,&SUITE_ID,(char *)"psk_id_hash",pskID);
+    OCT_joctet(&CONTEXT,&H);
+    LabeledExtract(&H,NULL,&SUITE_ID,(char *)"info_hash",info);
+    OCT_joctet(&CONTEXT,&H);
+
+    LabeledExtract(&secret,Z,&SUITE_ID,(char *)"secret",psk);
+
+    //LabeledExtract(&H,NULL,&SUITE_ID,(char *)"psk_hash",psk);
+    //LabeledExtract(&secret,&H,&SUITE_ID,(char *)"secret",Z);
+
+    LabeledExpand(key,&secret,&SUITE_ID,(char *)"key",&CONTEXT,AESKEY_ZZZ);
+    LabeledExpand(nonce,&secret,&SUITE_ID,(char *)"base_nonce",&CONTEXT,12);
+    if (exp_secret!=NULL)
+        LabeledExpand(exp_secret,&secret,&SUITE_ID,(char *)"exp",&CONTEXT,HASH_TYPE_ZZZ);
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke.h
new file mode 100644
index 0000000..db21187
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_ZZZ_H
+#define HPKE_ZZZ_H
+
+#include "ecdh_ZZZ.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace ZZZ {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_ANSSI.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_ANSSI.h
new file mode 100644
index 0000000..daeb126
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_ANSSI.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_ANSSI_H
+#define HPKE_ANSSI_H
+
+#include "ecdh_ANSSI.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace ANSSI {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_BLS12381.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_BLS12381.h
new file mode 100644
index 0000000..f8d4cc0
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_BLS12381.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_BLS12381_H
+#define HPKE_BLS12381_H
+
+#include "ecdh_BLS12381.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace BLS12381 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_BLS12383.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_BLS12383.h
new file mode 100644
index 0000000..ea309e5
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_BLS12383.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_BLS12383_H
+#define HPKE_BLS12383_H
+
+#include "ecdh_BLS12383.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace BLS12383 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_BLS12443.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_BLS12443.h
new file mode 100644
index 0000000..f42b80c
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_BLS12443.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_BLS12443_H
+#define HPKE_BLS12443_H
+
+#include "ecdh_BLS12443.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace BLS12443 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_BLS12461.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_BLS12461.h
new file mode 100644
index 0000000..012bdcb
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_BLS12461.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_BLS12461_H
+#define HPKE_BLS12461_H
+
+#include "ecdh_BLS12461.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace BLS12461 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_BLS24479.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_BLS24479.h
new file mode 100644
index 0000000..2fd5184
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_BLS24479.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_BLS24479_H
+#define HPKE_BLS24479_H
+
+#include "ecdh_BLS24479.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace BLS24479 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_BLS48286.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_BLS48286.h
new file mode 100644
index 0000000..a4d3dd5
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_BLS48286.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_BLS48286_H
+#define HPKE_BLS48286_H
+
+#include "ecdh_BLS48286.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace BLS48286 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_BLS48556.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_BLS48556.h
new file mode 100644
index 0000000..70621eb
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_BLS48556.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_BLS48556_H
+#define HPKE_BLS48556_H
+
+#include "ecdh_BLS48556.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace BLS48556 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_BLS48581.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_BLS48581.h
new file mode 100644
index 0000000..ad329fd
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_BLS48581.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_BLS48581_H
+#define HPKE_BLS48581_H
+
+#include "ecdh_BLS48581.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace BLS48581 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_BN158.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_BN158.h
new file mode 100644
index 0000000..5e10ae2
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_BN158.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_BN158_H
+#define HPKE_BN158_H
+
+#include "ecdh_BN158.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace BN158 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_BN254.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_BN254.h
new file mode 100644
index 0000000..57a1c9f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_BN254.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_BN254_H
+#define HPKE_BN254_H
+
+#include "ecdh_BN254.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace BN254 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_BN254CX.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_BN254CX.h
new file mode 100644
index 0000000..7808cc1
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_BN254CX.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_BN254CX_H
+#define HPKE_BN254CX_H
+
+#include "ecdh_BN254CX.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace BN254CX {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_BN462.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_BN462.h
new file mode 100644
index 0000000..99da642
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_BN462.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_BN462_H
+#define HPKE_BN462_H
+
+#include "ecdh_BN462.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace BN462 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_BRAINPOOL.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_BRAINPOOL.h
new file mode 100644
index 0000000..f5f98a1
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_BRAINPOOL.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_BRAINPOOL_H
+#define HPKE_BRAINPOOL_H
+
+#include "ecdh_BRAINPOOL.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace BRAINPOOL {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_C1174.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_C1174.h
new file mode 100644
index 0000000..231f891
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_C1174.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_C1174_H
+#define HPKE_C1174_H
+
+#include "ecdh_C1174.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace C1174 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_C13318.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_C13318.h
new file mode 100644
index 0000000..af67e5c
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_C13318.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_C13318_H
+#define HPKE_C13318_H
+
+#include "ecdh_C13318.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace C13318 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_C1665.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_C1665.h
new file mode 100644
index 0000000..4ee5c46
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_C1665.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_C1665_H
+#define HPKE_C1665_H
+
+#include "ecdh_C1665.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace C1665 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_C25519.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_C25519.h
new file mode 100644
index 0000000..3e92ef8
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_C25519.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_C25519_H
+#define HPKE_C25519_H
+
+#include "ecdh_C25519.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace C25519 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_C41417.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_C41417.h
new file mode 100644
index 0000000..734fc38
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_C41417.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_C41417_H
+#define HPKE_C41417_H
+
+#include "ecdh_C41417.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace C41417 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_Ed25519.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_Ed25519.h
new file mode 100644
index 0000000..91e6bf5
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_Ed25519.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_Ed25519_H
+#define HPKE_Ed25519_H
+
+#include "ecdh_Ed25519.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace Ed25519 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_Ed448.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_Ed448.h
new file mode 100644
index 0000000..0c61a15
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_Ed448.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_Ed448_H
+#define HPKE_Ed448_H
+
+#include "ecdh_Ed448.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace Ed448 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_FP256BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_FP256BN.h
new file mode 100644
index 0000000..2d0502d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_FP256BN.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_FP256BN_H
+#define HPKE_FP256BN_H
+
+#include "ecdh_FP256BN.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace FP256BN {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_FP512BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_FP512BN.h
new file mode 100644
index 0000000..951c23c
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_FP512BN.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_FP512BN_H
+#define HPKE_FP512BN_H
+
+#include "ecdh_FP512BN.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace FP512BN {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_HIFIVE.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_HIFIVE.h
new file mode 100644
index 0000000..4ef9302
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_HIFIVE.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_HIFIVE_H
+#define HPKE_HIFIVE_H
+
+#include "ecdh_HIFIVE.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace HIFIVE {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_JUBJUB.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_JUBJUB.h
new file mode 100644
index 0000000..7393f7f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_JUBJUB.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_JUBJUB_H
+#define HPKE_JUBJUB_H
+
+#include "ecdh_JUBJUB.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace JUBJUB {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_MDC.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_MDC.h
new file mode 100644
index 0000000..394f649
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_MDC.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_MDC_H
+#define HPKE_MDC_H
+
+#include "ecdh_MDC.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace MDC {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_NIST256.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_NIST256.h
new file mode 100644
index 0000000..48d077a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_NIST256.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_NIST256_H
+#define HPKE_NIST256_H
+
+#include "ecdh_NIST256.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace NIST256 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_NIST384.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_NIST384.h
new file mode 100644
index 0000000..d5cb821
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_NIST384.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_NIST384_H
+#define HPKE_NIST384_H
+
+#include "ecdh_NIST384.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace NIST384 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_NIST521.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_NIST521.h
new file mode 100644
index 0000000..0e6fa05
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_NIST521.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_NIST521_H
+#define HPKE_NIST521_H
+
+#include "ecdh_NIST521.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace NIST521 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_NUMS256E.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_NUMS256E.h
new file mode 100644
index 0000000..60b741a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_NUMS256E.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_NUMS256E_H
+#define HPKE_NUMS256E_H
+
+#include "ecdh_NUMS256E.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace NUMS256E {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_NUMS256W.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_NUMS256W.h
new file mode 100644
index 0000000..da77e24
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_NUMS256W.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_NUMS256W_H
+#define HPKE_NUMS256W_H
+
+#include "ecdh_NUMS256W.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace NUMS256W {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_NUMS384E.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_NUMS384E.h
new file mode 100644
index 0000000..24f53e3
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_NUMS384E.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_NUMS384E_H
+#define HPKE_NUMS384E_H
+
+#include "ecdh_NUMS384E.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace NUMS384E {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_NUMS384W.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_NUMS384W.h
new file mode 100644
index 0000000..8ac40c0
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_NUMS384W.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_NUMS384W_H
+#define HPKE_NUMS384W_H
+
+#include "ecdh_NUMS384W.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace NUMS384W {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_NUMS512E.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_NUMS512E.h
new file mode 100644
index 0000000..beb58a1
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_NUMS512E.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_NUMS512E_H
+#define HPKE_NUMS512E_H
+
+#include "ecdh_NUMS512E.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace NUMS512E {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_NUMS512W.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_NUMS512W.h
new file mode 100644
index 0000000..77b7724
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_NUMS512W.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_NUMS512W_H
+#define HPKE_NUMS512W_H
+
+#include "ecdh_NUMS512W.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace NUMS512W {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_SECP160R1.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_SECP160R1.h
new file mode 100644
index 0000000..5d4ea2e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_SECP160R1.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_SECP160R1_H
+#define HPKE_SECP160R1_H
+
+#include "ecdh_SECP160R1.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace SECP160R1 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_SECP256K1.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_SECP256K1.h
new file mode 100644
index 0000000..f459811
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_SECP256K1.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_SECP256K1_H
+#define HPKE_SECP256K1_H
+
+#include "ecdh_SECP256K1.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace SECP256K1 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_SM2.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_SM2.h
new file mode 100644
index 0000000..f1fee5e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_SM2.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_SM2_H
+#define HPKE_SM2_H
+
+#include "ecdh_SM2.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace SM2 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_TWEEDLEDEE.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_TWEEDLEDEE.h
new file mode 100644
index 0000000..84253c6
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_TWEEDLEDEE.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_TWEEDLEDEE_H
+#define HPKE_TWEEDLEDEE_H
+
+#include "ecdh_TWEEDLEDEE.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace TWEEDLEDEE {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_TWEEDLEDUM.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_TWEEDLEDUM.h
new file mode 100644
index 0000000..e5244d0
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_TWEEDLEDUM.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_TWEEDLEDUM_H
+#define HPKE_TWEEDLEDUM_H
+
+#include "ecdh_TWEEDLEDUM.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace TWEEDLEDUM {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_X448.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_X448.h
new file mode 100644
index 0000000..91efa1f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/hpke_X448.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_X448_H
+#define HPKE_X448_H
+
+#include "ecdh_X448.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace X448 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/kyber.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/kyber.cpp
new file mode 100644
index 0000000..3956e8c
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/kyber.cpp
@@ -0,0 +1,812 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* Kyber API implementation. Constant time where it matters. Spends nearly all of its time running SHA3. Small.
+
+   M.Scott 22/11/2021
+*/
+
+#include "kyber.h"
+
+using namespace core;
+
+// parameters for each security level
+// K,eta1,eta2,du,dv,shared secret
+const int PARAMS_512[6]={2,3,2,10,4,32};
+const int PARAMS_768[6]={3,2,2,10,4,32};
+const int PARAMS_1024[6]={4,2,2,11,5,32};
+
+/* Start of public domain reference implementation code - taken from https://github.com/pq-crystals/kyber */
+
+const sign16 zetas[128] = {
+  -1044,  -758,  -359, -1517,  1493,  1422,   287,   202,
+   -171,   622,  1577,   182,   962, -1202, -1474,  1468,
+    573, -1325,   264,   383,  -829,  1458, -1602,  -130,
+   -681,  1017,   732,   608, -1542,   411,  -205, -1571,
+   1223,   652,  -552,  1015, -1293,  1491,  -282, -1544,
+    516,    -8,  -320,  -666, -1618, -1162,   126,  1469,
+   -853,   -90,  -271,   830,   107, -1421,  -247,  -951,
+   -398,   961, -1508,  -725,   448, -1065,   677, -1275,
+  -1103,   430,   555,   843, -1251,   871,  1550,   105,
+    422,   587,   177,  -235,  -291,  -460,  1574,  1653,
+   -246,   778,  1159,  -147,  -777,  1483,  -602,  1119,
+  -1590,   644,  -872,   349,   418,   329,  -156,   -75,
+    817,  1097,   603,   610,  1322, -1285, -1465,   384,
+  -1215,  -136,  1218, -1335,  -874,   220, -1187, -1659,
+  -1185, -1530, -1278,   794, -1510,  -854,  -870,   478,
+   -108,  -308,   996,   991,   958, -1460,  1522,  1628
+};
+
+static int16_t montgomery_reduce(int32_t a)
+{
+  int16_t t;
+
+  t = (int16_t)a*KY_QINV;
+  t = (a - (int32_t)t*KY_PRIME) >> 16;
+  return t;
+}
+
+static int16_t barrett_reduce(int16_t a) {
+  int16_t t;
+  const int16_t v = ((1<<26) + KY_PRIME/2)/KY_PRIME;
+
+  t  = ((int32_t)v*a + (1<<25)) >> 26;
+  t *= KY_PRIME;
+  return a - t;
+}
+
+static sign16 fqmul(sign16 a, sign16 b) {
+  return montgomery_reduce((sign32)a*b);
+}
+
+static void ntt(int16_t r[256]) {
+  unsigned int len, start, j, k;
+  int16_t t, zeta;
+
+  k = 1;
+  for(len = 128; len >= 2; len >>= 1) {
+    for(start = 0; start < 256; start = j + len) {
+      zeta = zetas[k++];
+      for(j = start; j < start + len; j++) {
+        t = fqmul(zeta, r[j + len]);
+        r[j + len] = r[j] - t;
+        r[j] = r[j] + t;
+      }
+    }
+  }
+}
+
+static void invntt(int16_t r[256]) {
+  unsigned int start, len, j, k;
+  int16_t t, zeta;
+  const int16_t f = 1441; // mont^2/128
+
+  k = 127;
+  for(len = 2; len <= 128; len <<= 1) {
+    for(start = 0; start < 256; start = j + len) {
+      zeta = zetas[k--];
+      for(j = start; j < start + len; j++) {
+        t = r[j];
+        r[j] = barrett_reduce(t + r[j + len]);
+        r[j + len] = r[j + len] - t;
+        r[j + len] = fqmul(zeta, r[j + len]);
+      }
+    }
+  }
+
+  for(j = 0; j < 256; j++)
+    r[j] = fqmul(r[j], f);
+}
+
+static void basemul(sign16 r[2], const sign16 a[2], const sign16 b[2], sign16 zeta) {
+    r[0]  = fqmul(a[1], b[1]);
+    r[0]  = fqmul(r[0], zeta);
+    r[0] += fqmul(a[0], b[0]);
+    r[1]  = fqmul(a[0], b[1]);
+    r[1] += fqmul(a[1], b[0]);
+}
+
+static void poly_reduce(sign16 *r)
+{
+    int i;
+    for(i=0;i<KY_DEGREE;i++)
+        r[i] = barrett_reduce(r[i]);
+}
+
+static void poly_ntt(sign16 *r)
+{
+    ntt(r);
+    poly_reduce(r);
+}
+
+static void poly_invntt(sign16 *r)
+{
+    invntt(r);
+}
+
+// Note r must be distinct from a and b
+static void poly_mul(sign16 *r, const sign16 *a, const sign16 *b)
+{
+    int i;
+    for(i = 0; i < KY_DEGREE/4; i++) {
+        basemul(&r[4*i], &a[4*i], &b[4*i], zetas[64 + i]);
+        basemul(&r[4*i + 2], &a[4*i + 2], &b[4*i + 2], -zetas[64 + i]);
+    }
+}
+
+static void poly_tomont(sign16 *r)
+{
+    int i;
+    const sign16 f = KY_ONE;
+    for(i=0;i<KY_DEGREE;i++)
+        r[i] = montgomery_reduce((sign32)r[i]*f);
+}
+
+/* End of public domain reference code use */
+
+// copy polynomial
+static void poly_copy(sign16 *p1, sign16 *p2)
+{
+    int i;
+    for (i = 0; i < KY_DEGREE; i++)
+        p1[i] = p2[i];
+}
+
+// zero polynomial
+static void poly_zero(sign16 *p1)
+{
+    int i;
+    for (i = 0; i < KY_DEGREE; i++)
+        p1[i] = 0;
+}
+
+// add polynomials
+static void poly_add(sign16 *p1, sign16 *p2, sign16 *p3)
+{
+    int i;
+    for (i = 0; i < KY_DEGREE; i++)
+        p1[i] = (p2[i] + p3[i]);
+}
+
+// subtract polynomials
+static void poly_sub(sign16 *p1, sign16 *p2, sign16 *p3)
+{
+    int i;
+    for (i = 0; i < KY_DEGREE; i++)
+        p1[i] = (p2[i] - p3[i]);
+}
+
+// Generate A[i][j] from rho
+static void ExpandAij(byte rho[32],sign16 Aij[],int i,int j)
+{
+    int m;
+    sha3 sh;
+    SHA3_init(&sh, SHAKE128);
+    byte buff[640];  // should be plenty (?)
+    for (m=0;m<32;m++)
+        SHA3_process(&sh,rho[m]);
+    SHA3_process(&sh,j&0xff);
+    SHA3_process(&sh,i&0xff);
+    SHA3_shake(&sh,(char *)buff,640);
+    i=j=0;
+    while (j<KY_DEGREE)
+    {
+        int d1=buff[i]+256*(buff[i+1]&0x0F);
+        int d2=buff[i+1]/16+16*buff[i+2];
+        if (d1<KY_PRIME)
+            Aij[j++]=d1;
+        if (d2<KY_PRIME && j<KY_DEGREE)
+            Aij[j++]=d2;
+        i+=3;
+    }
+}
+
+// get n-th bit from byte array
+static int getbit(byte b[],int n)
+{
+    int wd=n/8;
+    int bt=n%8;
+    return (b[wd]>>bt)&1;
+}
+
+// centered binomial distribution
+static void CBD(byte bts[],int eta,sign16 f[KY_DEGREE])
+{
+    int a,b;
+    for (int i=0;i<KY_DEGREE;i++)
+    {
+        a=b=0;
+        for (int j=0;j<eta;j++)
+        {
+            a+=getbit(bts,2*i*eta+j);
+            b+=getbit(bts,2*i*eta+eta+j);
+        }
+        f[i]=a-b; 
+    }
+}
+
+// extract ab bits into word from dense byte stream
+static sign16 nextword(int ab,byte t[],int &ptr, int &bts)
+{
+    sign16 r=t[ptr]>>bts;
+    sign16 mask=(1<<ab)-1;
+    sign16 w;
+    int i=0;
+    int gotbits=8-bts; // bits left in current byte
+    while (gotbits<ab)
+    {
+        i++;
+        w=(sign16)t[ptr+i];
+        r|=w<<gotbits;
+        gotbits+=8;
+    }
+    bts+=ab;
+    while (bts>=8)
+    {
+        bts-=8;
+        ptr++;
+    }
+    w=r&mask;
+    return w;  
+}
+
+// array t has ab active bits per word
+// extract bytes from array of words
+// if max!=0 then -max<=t[i]<=+max
+static byte nextbyte16(int ab,sign16 t[],int &ptr, int &bts)
+{
+    sign16 r,w;
+    int left=ab-bts; // number of bits left in this word
+    int i=0;
+
+    w=t[ptr]; w+=(w>>15)&KY_PRIME;
+    r=w>>bts;
+    while (left<8)
+    {
+        i++;
+        w=t[ptr+i]; w+=(w>>15)&KY_PRIME;
+        r|=w<<left;
+        left+=ab;
+    }
+
+    bts+=8;
+    while (bts>=ab)
+    {
+        bts-=ab;
+        ptr++;
+    }
+    return (byte)r&0xff;        
+}
+
+// encode polynomial vector of length len with coefficients of length L, into packed bytes
+static void encode(sign16 t[],int len,int L,byte pack[])
+{
+    int ptr,bts,n;
+    ptr=bts=0;
+    for (n=0;n<len*(KY_DEGREE*L)/8;n++ ) {
+        pack[n]=nextbyte16(L,t,ptr,bts);
+    }
+}
+
+static byte chk_encode(sign16 t[],int len,int L,byte pack[])
+{
+    int ptr,bts,n;
+    byte m,diff=0;
+    ptr=bts=0;
+    for (n=0;n<len*(KY_DEGREE*L)/8;n++ ) {
+        m=nextbyte16(L,t,ptr,bts);
+        diff|=(m^pack[n]);
+    }    
+    return diff;
+}
+
+// decode packed bytes into polynomial vector of length len, with coefficients of length L
+static void decode(byte pack[],int L,sign16 t[],int len)
+{
+    int ptr,bts,i;
+    ptr=bts=0;
+    for (i=0;i<len*KY_DEGREE;i++ )
+        t[i]=nextword(L,pack,ptr,bts);
+}
+
+// Bernsteins safe division by 0xD01
+static int32_t safediv(int32_t x)
+{
+    int32_t qpart,q=0;    
+
+    qpart=(int32_t)(((int64_t)x*645083)>>31);
+    x-=qpart*0xD01; q += qpart;
+
+    qpart=(int32_t)(((int64_t)x*645083)>>31)+1;
+    x-=qpart*0xD01; q += qpart+(x>>31);
+
+    return q;
+}
+
+// compress polynomial coefficents in place, for polynomial vector of length len
+static void compress(sign16 t[],int len,int d)
+{
+    sign32 twod=(1<<d);
+    for (int i=0;i<len*KY_DEGREE;i++)
+    {
+        t[i]+=(t[i]>>15)&KY_PRIME;
+        t[i]= (sign16)(safediv(twod*t[i]+KY_PRIME/2)&(twod-1));
+    }
+}
+
+// decompress polynomial coefficents in place, for polynomial vector of length len
+static void decompress(sign16 t[],int len,int d)
+{
+    int twod1=(1<<(d-1));
+    for (int i=0;i<len*KY_DEGREE;i++)
+        t[i]=(KY_PRIME*t[i]+twod1)>>d;
+}
+
+// input entropy, output key pair
+static void KYBER_CPA_keypair(const int *params,byte *tau,octet *sk,octet *pk)
+{
+    int i,j,k,row;
+    sha3 sh;
+    byte rho[32];
+    byte sigma[33];
+    byte buff[256];
+
+    int ck=params[0];
+    sign16 r[KY_DEGREE];
+    sign16 w[KY_DEGREE];
+    sign16 Aij[KY_DEGREE]; 
+#ifdef USE_VLAS
+    sign16 s[ck*KY_DEGREE];
+    sign16 e[ck*KY_DEGREE];
+    sign16 p[ck*KY_DEGREE];
+#else
+    sign16 s[KY_MAXK*KY_DEGREE];
+    sign16 e[KY_MAXK*KY_DEGREE];
+    sign16 p[KY_MAXK*KY_DEGREE];
+#endif
+
+    int eta1=params[1];
+    int public_key_size=32+ck*(KY_DEGREE*3)/2;
+    int secret_cpa_key_size=ck*(KY_DEGREE*3)/2;
+
+    SHA3_init(&sh,SHA3_HASH512);
+   
+    for (i=0;i<32;i++)
+        SHA3_process(&sh,tau[i]); 
+    SHA3_hash(&sh,(char *)buff);
+    for (i=0;i<32;i++)
+    {
+        rho[i]=buff[i];
+        sigma[i]=buff[i+32];
+    }
+    sigma[32]=0;   // N
+
+// create s
+    for (i=0;i<ck;i++)
+    {
+        SHA3_init(&sh,SHAKE256);
+        for (j=0;j<33;j++)
+            SHA3_process(&sh,sigma[j]); 
+        SHA3_shake(&sh,(char *)buff,64*eta1);
+        CBD(buff,eta1,&s[i*KY_DEGREE]);
+        sigma[32]+=1;
+    }
+
+// create e
+    for (i=0;i<ck;i++)
+    {
+        SHA3_init(&sh,SHAKE256);
+        for (j=0;j<33;j++)
+            SHA3_process(&sh,sigma[j]); 
+        SHA3_shake(&sh,(char *)buff,64*eta1);
+        CBD(buff,eta1,&e[i*KY_DEGREE]);
+        sigma[32]+=1;
+    }
+
+    for (k=0;k<ck;k++)
+    {
+        row=KY_DEGREE*k;
+        poly_ntt(&s[row]);
+        poly_ntt(&e[row]);
+    }
+
+    for (i=0;i<ck;i++)
+    {
+        row=KY_DEGREE*i;
+        ExpandAij(rho,Aij,i,0);
+        poly_mul(r,Aij,s);
+        for (j=1;j<ck;j++)
+        {
+            ExpandAij(rho,Aij,i,j);
+            poly_mul(w,&s[j*KY_DEGREE],Aij);
+            poly_add(r,r,w);
+        }
+        poly_reduce(r);
+        poly_tomont(r);
+        poly_add(&p[row],r,&e[row]);
+        poly_reduce(&p[row]);
+    }
+
+    encode(s,ck,12,(byte *)sk->val);
+    sk->len=secret_cpa_key_size;
+    encode(p,ck,12,(byte *)pk->val);
+    pk->len=public_key_size;
+    for (i=0;i<32;i++)
+        pk->val[public_key_size-32+i]=rho[i];
+}
+
+// input 64 random bytes, output secret and public keys
+static void KYBER_CCA_keypair(const int *params,byte *randbytes64,octet *sk,octet *pk)
+{
+    int i;
+    sha3 sh;
+    byte h[32];
+
+    KYBER_CPA_keypair(params,randbytes64,sk,pk);
+    OCT_joctet(sk,pk);
+
+    SHA3_init(&sh,SHA3_HASH256);
+    for (i=0;i<pk->len;i++)
+        SHA3_process(&sh,(byte)pk->val[i]);
+    SHA3_hash(&sh,(char *)h);
+    OCT_jbytes(sk,(char *)h,32);
+    OCT_jbytes(sk,(char *)&randbytes64[32],32);
+}
+
+static void KYBER_CPA_base_encrypt(const int *params,byte *coins,octet *pk,octet *ss,sign16 *u, sign16* v)
+{
+    int i,row,j,len;
+    sha3 sh;
+    byte sigma[33];
+    byte buff[256];
+    byte rho[32];
+
+    int ck=params[0];
+    sign16 r[KY_DEGREE];
+    sign16 w[KY_DEGREE];
+    sign16 Aij[KY_DEGREE]; 
+#ifdef USE_VLAS
+    sign16 q[ck*KY_DEGREE];
+    sign16 p[ck*KY_DEGREE];
+#else
+    sign16 q[KY_MAXK*KY_DEGREE];
+    sign16 p[KY_MAXK*KY_DEGREE];
+#endif
+
+    int eta1=params[1];
+    int eta2=params[2];
+    int du=params[3];
+    int dv=params[4];
+    int public_key_size=32+ck*(KY_DEGREE*3)/2;
+
+    for (i=0;i<32;i++)
+        sigma[i]=coins[i];//i+6; //RAND_byte(RNG);
+    sigma[32]=0;
+
+    for (i=0;i<32;i++)
+        rho[i]=pk->val[pk->len-32+i];
+
+// create q
+    for (i=0;i<ck;i++)
+    {
+        SHA3_init(&sh,SHAKE256);
+        for (j=0;j<33;j++)
+            SHA3_process(&sh,sigma[j]); 
+        SHA3_shake(&sh,(char *)buff,64*eta1);
+        CBD(buff,eta1,&q[i*KY_DEGREE]);
+        sigma[32]+=1;
+    }
+
+// create e1
+    for (i=0;i<ck;i++)
+    {
+        SHA3_init(&sh,SHAKE256);
+        for (j=0;j<33;j++)
+            SHA3_process(&sh,sigma[j]); 
+        SHA3_shake(&sh,(char *)buff,64*eta2);
+        CBD(buff,eta1,&u[i*KY_DEGREE]);          // e1
+        sigma[32]+=1;
+    }
+
+    for (i=0;i<ck;i++)
+    {
+        row=KY_DEGREE*i;
+        poly_ntt(&q[row]);
+    }
+
+    for (i=0;i<ck;i++)
+    {
+        row=KY_DEGREE*i;
+        ExpandAij(rho,Aij,0,i);
+        poly_mul(r,Aij,q);
+        for (j=1;j<ck;j++)
+        {
+            ExpandAij(rho,Aij,j,i);
+            poly_mul(w,&q[j*KY_DEGREE],Aij);
+            poly_add(r,r,w);
+        }
+        poly_reduce(r);
+        poly_invntt(r);
+        poly_add(&u[row],&u[row],r);
+        poly_reduce(&u[row]);
+    }
+
+    decode((byte *)pk->val,12,p,ck);
+
+    poly_mul(v,p,q);
+    for (i=1;i<ck;i++)
+    {
+        row=KY_DEGREE*i;
+        poly_mul(r,&p[row],&q[row]);
+        poly_add(v,v,r);
+    }
+    poly_invntt(v);
+
+// create e2
+    SHA3_init(&sh,SHAKE256);
+    for (j=0;j<33;j++)
+        SHA3_process(&sh,sigma[j]); 
+    SHA3_shake(&sh,(char *)buff,64*eta2);
+    CBD(buff,eta1,w);  // e2
+
+    poly_add(v,v,w);
+    
+    decode((byte *)ss->val,1,r,1);
+    decompress(r,1,1);
+   
+    poly_add(v,v,r);
+    poly_reduce(v);
+
+    compress(u,ck,du);
+    compress(v,1,dv);
+}
+
+// Given input of entropy, public key and shared secret is an input, outputs ciphertext
+static void KYBER_CPA_encrypt(const int *params,byte *coins,octet *pk,octet *ss,octet *ct)
+{
+    int ck=params[0];
+    sign16 v[KY_DEGREE]; 
+#ifdef USE_VLAS
+    sign16 u[ck*KY_DEGREE];
+#else
+    sign16 u[KY_MAXK*KY_DEGREE];
+#endif
+
+    int du=params[3];
+    int dv=params[4];
+    int ciphertext_size=(du*ck+dv)*KY_DEGREE/8;
+    KYBER_CPA_base_encrypt(params,coins,pk,ss,u,v);
+    encode(u,ck,du,(byte *)ct->val);
+    encode(v,1,dv,(byte *)&ct->val[ciphertext_size-(dv*KY_DEGREE/8)]);
+    ct->len=ciphertext_size;
+}
+
+// Re-encrypt and check that ct is OK (if so return is zero)
+static byte KYBER_CPA_check_encrypt(const int *params,byte *coins,octet *pk,octet *ss,octet *ct)
+{
+    int ck=params[0];
+    sign16 v[KY_DEGREE]; 
+#ifdef USE_VLAS
+    sign16 u[ck*KY_DEGREE];
+#else
+    sign16 u[KY_MAXK*KY_DEGREE];
+#endif  
+    int du=params[3];
+    int dv=params[4];
+    int ciphertext_size=(du*ck+dv)*KY_DEGREE/8;
+    byte d1,d2;
+    KYBER_CPA_base_encrypt(params,coins,pk,ss,u,v);
+    d1=chk_encode(u,ck,du,(byte *)ct->val);
+    d2=chk_encode(v,1,dv,(byte *)&ct->val[ciphertext_size-(dv*KY_DEGREE/8)]);
+    if ((d1|d2)==0)
+        return 0;
+    else
+        return 0xff;
+}
+
+// Given entropy and public key, outputs 32-byte shared secret and ciphertext
+static void KYBER_CCA_encrypt(const int *params,byte *randbytes32,octet *pk,octet *ss,octet *ct)
+{
+    int i;
+    sha3 sh;
+    byte h[32],hm[32],g[64],coins[32];
+    octet HM={32,sizeof(hm),(char *)hm};
+    int ck=params[0];
+    int du=params[3];
+    int dv=params[4];
+    int shared_secret_size=params[5];
+
+    SHA3_init(&sh,SHA3_HASH256);               // H(m)
+    for (i=0;i<32;i++)
+        SHA3_process(&sh,randbytes32[i]);
+    SHA3_hash(&sh,(char *)hm);
+
+    SHA3_init(&sh,SHA3_HASH256);               // H(pk)
+    for (i=0;i<pk->len;i++)
+        SHA3_process(&sh,(byte)pk->val[i]);
+    SHA3_hash(&sh,(char *)h);
+
+    SHA3_init(&sh,SHA3_HASH512);               // Kb,r = G(H(m)|H(pk)
+    for (i=0;i<32;i++)
+        SHA3_process(&sh,hm[i]);
+    for (i=0;i<32;i++)
+        SHA3_process(&sh,h[i]);
+    SHA3_hash(&sh,(char *)g);
+
+    for (i=0;i<32;i++)
+        coins[i]=g[i+32];
+    KYBER_CPA_encrypt(params,coins,pk,&HM,ct);
+    
+    SHA3_init(&sh,SHA3_HASH256);              // H(ct)
+    for (i=0;i<ct->len;i++)
+        SHA3_process(&sh,(byte)ct->val[i]);
+    SHA3_hash(&sh,(char *)h);
+
+    SHA3_init(&sh,SHAKE256);                  // K=KDF(Kb|H(ct))
+    for (i=0;i<32;i++)
+        SHA3_process(&sh,g[i]);
+    for (i=0;i<32;i++)
+        SHA3_process(&sh,h[i]);
+
+    SHA3_shake(&sh,ss->val,shared_secret_size); // could be any length?
+    ss->len=shared_secret_size;
+}
+
+// Input secret key and ciphertext, outputs shared 32-byte secret
+static void KYBER_CPA_decrypt(const int *params,octet *sk,octet *ct,octet *ss)
+{
+    int i,j,row;
+    int ck=params[0];
+    sign16 w[KY_DEGREE];
+    sign16 v[KY_DEGREE];
+    sign16 r[KY_DEGREE];
+#ifdef USE_VLAS
+    sign16 u[ck*KY_DEGREE];
+    sign16 s[ck*KY_DEGREE];
+#else
+    sign16 u[KY_MAXK*KY_DEGREE];
+    sign16 s[KY_MAXK*KY_DEGREE];
+#endif
+
+    int du=params[3];
+    int dv=params[4];
+    int shared_secret_size=params[5];
+
+    decode((byte *)ct->val,du,u,ck);
+    decode((byte *)&ct->val[du*ck*KY_DEGREE/8],dv,v,1);
+    decompress(u,ck,du);
+    decompress(v,1,dv);
+    decode((byte *)sk->val,12,s,ck);
+
+    poly_ntt(u);
+    poly_mul(w,u,s);
+    for (i=1;i<ck;i++)
+    {
+        row=KY_DEGREE*i;
+        poly_ntt(&u[row]);
+        poly_mul(r,&u[row],&s[row]);
+        poly_add(w,w,r);
+    }
+    poly_reduce(w);
+    poly_invntt(w);
+    poly_sub(v,v,w);
+    compress(v,1,1);
+    encode(v,1,1,(byte *)ss->val); 
+    ss->len=shared_secret_size;
+}
+
+static void KYBER_CCA_decrypt(const int *params,octet *sk,octet *ct,octet *ss)
+{ 
+    int i,olen,same;
+    sha3 sh;
+    byte h[32],z[32],m[32],coins[32],g[64],mask;
+    octet M={32,sizeof(m),(char *)m};
+    int ck=params[0];
+    int du=params[3];
+    int dv=params[4];
+    int secret_cpa_key_size=ck*(KY_DEGREE*3)/2;
+    int public_key_size=32+ck*(KY_DEGREE*3)/2;
+    int shared_secret_size=params[5];
+    octet PK={public_key_size,public_key_size,&sk->val[secret_cpa_key_size]}; // public key is here
+
+    olen=sk->len;
+    sk->len=secret_cpa_key_size;  // chop off CPA secret
+    for (i=0;i<32;i++)
+        h[i]=sk->val[secret_cpa_key_size+public_key_size+i];
+    for (i=0;i<32;i++)
+        z[i]=sk->val[secret_cpa_key_size+public_key_size+32+i];
+
+    KYBER_CPA_decrypt(params,sk,ct,&M);
+
+    SHA3_init(&sh,SHA3_HASH512);               // Kb,r = G(H(m)|H(pk)
+    for (i=0;i<32;i++)
+        SHA3_process(&sh,m[i]);
+    for (i=0;i<32;i++)
+        SHA3_process(&sh,h[i]);
+    SHA3_hash(&sh,(char *)g);
+
+    for (i=0;i<32;i++)
+        coins[i]=g[i+32];
+    mask=KYBER_CPA_check_encrypt(params,coins,&PK,&M,ct);       // encrypt again with public key - FO transform CPA->CCA 
+
+    for (i=0;i<32;i++)
+        g[i]^=(g[i]^z[i])&mask;               // substitute z for Kb on failure
+
+    SHA3_init(&sh,SHA3_HASH256);              // H(ct)
+    for (i=0;i<ct->len;i++)
+        SHA3_process(&sh,(byte)ct->val[i]);
+    SHA3_hash(&sh,(char *)h);
+
+    SHA3_init(&sh,SHAKE256);                  // K=KDF(Kb|H(ct))
+    for (i=0;i<32;i++)
+        SHA3_process(&sh,g[i]);
+    for (i=0;i<32;i++)
+        SHA3_process(&sh,h[i]);
+    
+    SHA3_shake(&sh,ss->val,shared_secret_size); // could be any length?
+    ss->len=shared_secret_size;
+    sk->len=olen; // restore length
+}
+
+// ********************* Kyber API ******************************
+
+void core::KYBER512_keypair(byte *r64,octet *SK,octet *PK)
+{
+    KYBER_CCA_keypair(PARAMS_512,r64,SK,PK);
+}
+
+void core::KYBER768_keypair(byte *r64,octet *SK,octet *PK)
+{
+    KYBER_CCA_keypair(PARAMS_768,r64,SK,PK);
+}
+
+void core::KYBER1024_keypair(byte *r64,octet *SK,octet *PK)
+{
+    KYBER_CCA_keypair(PARAMS_1024,r64,SK,PK);
+}
+
+void core::KYBER512_encrypt(byte *r32,octet *PK,octet *SS,octet *CT)
+{
+    KYBER_CCA_encrypt(PARAMS_512,r32,PK,SS,CT);
+}
+
+void core::KYBER768_encrypt(byte *r32,octet *PK,octet *SS,octet *CT)
+{
+    KYBER_CCA_encrypt(PARAMS_768,r32,PK,SS,CT);
+}
+
+void core::KYBER1024_encrypt(byte *r32,octet *PK,octet *SS,octet *CT)
+{
+    KYBER_CCA_encrypt(PARAMS_1024,r32,PK,SS,CT);
+}
+
+void core::KYBER512_decrypt(octet *SK,octet *CT,octet *SS)
+{
+    KYBER_CCA_decrypt(PARAMS_512,SK,CT,SS);
+}
+
+void core::KYBER768_decrypt(octet *SK,octet *CT,octet *SS)
+{
+    KYBER_CCA_decrypt(PARAMS_768,SK,CT,SS);
+}
+
+void core::KYBER1024_decrypt(octet *SK,octet *CT,octet *SS)
+{
+    KYBER_CCA_decrypt(PARAMS_1024,SK,CT,SS);
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/kyber.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/kyber.h
new file mode 100644
index 0000000..08da3b8
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/kyber.h
@@ -0,0 +1,139 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* Kyber API */
+
+#ifndef KYBER_H
+#define KYBER_H
+
+#include "core.h"
+
+//q= 3329
+#define KY_LGN 8
+#define KY_DEGREE (1 << KY_LGN)
+#define KY_PRIME 0xD01
+
+#define KY_ONE 0x549		// R mod Q
+#define KY_QINV 62209   // q^(-1) mod 2^16
+
+#define KYBER_SECRET_CPA_SIZE_512 (2*(KY_DEGREE*3)/2)
+#define KYBER_PUBLIC_SIZE_512 (32+2*(KY_DEGREE*3)/2)
+#define KYBER_CIPHERTEXT_SIZE_512  ((10*2+4)*KY_DEGREE/8)
+#define KYBER_SECRET_CCA_SIZE_512 (KYBER_SECRET_CPA_SIZE_512+KYBER_PUBLIC_SIZE_512+64)
+#define KYBER_SHARED_SECRET_512 32
+
+#define KYBER_SECRET_CPA_SIZE_768 (3*(KY_DEGREE*3)/2)
+#define KYBER_PUBLIC_SIZE_768 (32+3*(KY_DEGREE*3)/2)
+#define KYBER_CIPHERTEXT_SIZE_768  ((10*3+4)*KY_DEGREE/8)
+#define KYBER_SECRET_CCA_SIZE_768 (KYBER_SECRET_CPA_SIZE_768+KYBER_PUBLIC_SIZE_768+64)
+#define KYBER_SHARED_SECRET_768 32
+
+#define KYBER_SECRET_CPA_SIZE_1024 (4*(KY_DEGREE*3)/2)
+#define KYBER_PUBLIC_SIZE_1024 (32+4*(KY_DEGREE*3)/2)
+#define KYBER_CIPHERTEXT_SIZE_1024  ((11*4+5)*KY_DEGREE/8)
+#define KYBER_SECRET_CCA_SIZE_1024 (KYBER_SECRET_CPA_SIZE_1024+KYBER_PUBLIC_SIZE_1024+64)
+#define KYBER_SHARED_SECRET_1024 32
+
+#define KY_MAXK 4
+
+namespace core {
+
+/** @brief Kyber KEM CCA key pair generation
+ *
+    @param r64 64 random bytes
+    @param SK secret key
+    @param PK public key
+
+ */
+extern void KYBER512_keypair(byte *r64,octet *SK,octet *PK);
+
+/** @brief Kyber KEM CCA encrypt
+ *
+    @param r32 32 random bytes
+    @param PK public key
+	@param SS random session key generated
+	@param CT ciphertext
+
+ */
+extern void KYBER512_encrypt(byte *r32,octet *PK,octet *SS,octet *CT);
+
+/** @brief Kyber KEM CCA decrypt
+ *
+    @param SK secret key
+	@param CT ciphertext
+	@param SS output session key 
+ */
+extern void KYBER512_decrypt(octet *SK,octet *CT,octet *SS);
+
+/** @brief Kyber KEM CCA key pair generation
+ *
+    @param r64 64 random bytes
+    @param SK secret key
+    @param PK public key
+
+ */
+extern void KYBER768_keypair(byte *r64,octet *SK,octet *PK);
+
+/** @brief Kyber KEM CCA encrypt
+ *
+    @param r32 32 random bytes
+    @param PK public key
+	@param SS random session key generated
+	@param CT ciphertext
+
+ */
+extern void KYBER768_encrypt(byte *r32,octet *PK,octet *SS,octet *CT);
+
+/** @brief Kyber KEM CCA decrypt
+ *
+    @param SK secret key
+	@param CT ciphertext
+	@param SS output session key 
+ */
+extern void KYBER768_decrypt(octet *SK,octet *CT,octet *SS);
+
+/** @brief Kyber KEM CCA key pair generation
+ *
+    @param r64 64 random bytes
+    @param SK secret key
+    @param PK public key
+
+ */
+extern void KYBER1024_keypair(byte *r64,octet *SK,octet *PK);
+
+/** @brief Kyber KEM CCA encrypt
+ *
+    @param r32 32 random bytes
+    @param PK public key
+	@param SS random session key generated
+	@param CT ciphertext
+
+ */
+extern void KYBER1024_encrypt(byte *r32,octet *PK,octet *SS,octet *CT);
+
+/** @brief Kyber KEM CCA decrypt
+ *
+    @param SK secret key
+	@param CT ciphertext
+	@param SS output session key 
+ */
+extern void KYBER1024_decrypt(octet *SK,octet *CT,octet *SS);
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/mpin.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/mpin.cpp
new file mode 100644
index 0000000..8261cf9
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/mpin.cpp
@@ -0,0 +1,229 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* MPIN 128-bit API Functions */
+
+/* Version 3.0  */
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include <time.h>
+#include "mpin_ZZZ.h"
+
+using namespace XXX;
+using namespace YYY;
+
+#define ROUNDUP(a,b) ((a)-1)/(b)+1
+
+/* Encode octet to curve point */
+void ZZZ::MPIN_ENCODE_TO_CURVE(octet *DST,octet *ID,octet *HCID)
+{
+    int j,k,m,L;
+    char okm[512],fd[256];
+    BIG q,r,w;
+    ECP P;
+    FP u;
+    DBIG dx;
+    octet OKM = {0,sizeof(okm),okm};
+    BIG_rcopy(q,Modulus);
+    k=BIG_nbits(q);
+    BIG_rcopy(r, CURVE_Order);
+    m=BIG_nbits(r);
+    L=ROUNDUP(k+ROUNDUP(m,2),8);
+    XMD_Expand(MC_SHA2,HASH_TYPE_ZZZ,&OKM,L,DST,ID);
+    for (j=0;j<L;j++)
+        fd[j]=OKM.val[j];
+        
+    BIG_dfromBytesLen(dx,fd,L);
+    BIG_dmod(w,dx,q);
+    FP_nres(&u,w);
+    ECP_map2point(&P,&u);
+    ECP_cfp(&P);
+    ECP_affine(&P);
+    ECP_toOctet(HCID, &P, false);
+}
+
+/* create random secret S */
+int ZZZ::MPIN_RANDOM_GENERATE(csprng *RNG, octet* S)
+{
+    BIG r, s;
+    BIG_rcopy(r, CURVE_Order);
+    BIG_randtrunc(s, r, 2 * CURVE_SECURITY_ZZZ, RNG);
+    BIG_toBytes(S->val, s);
+    S->len = MODBYTES_XXX;
+    return 0;
+}
+
+/* Extract PIN from TOKEN for identity CID */
+int ZZZ::MPIN_EXTRACT_PIN(octet *CID, int pin, octet *TOKEN)
+{
+    ECP P, R;
+    int res = 0;
+    pin %= MAXPIN;
+
+    if (!ECP_fromOctet(&P, TOKEN))  res = MPIN_INVALID_POINT;
+    if (res == 0)
+    {
+        if (!ECP_fromOctet(&R,CID)) res=MPIN_INVALID_POINT;
+    }
+    if (res==0)
+    {
+        ECP_pinmul(&R, pin, PBLEN);
+        ECP_sub(&P, &R);
+        ECP_toOctet(TOKEN, &P, false);
+    }
+    return res;
+}
+
+/* Implement step 2 on client side of MPin protocol - SEC=-(x+y)*SEC */
+int ZZZ::MPIN_CLIENT_2(octet *X, octet *Y, octet *SEC)
+{
+    BIG px, py, r;
+    ECP P;
+    int res = 0;
+    BIG_rcopy(r, CURVE_Order);
+    if (!ECP_fromOctet(&P, SEC)) res = MPIN_INVALID_POINT;
+    if (res == 0)
+    {
+        BIG_fromBytes(px, X->val);
+        BIG_fromBytes(py, Y->val);
+        BIG_add(px, px, py);
+        BIG_mod(px, r);
+        PAIR_G1mul(&P, px);
+        ECP_neg(&P);
+        ECP_toOctet(SEC, &P, false); /* change to TRUE for point compression */
+    }
+    return res;
+}
+
+/* Client secret CST=s*IDHTC where IDHTC is client ID hashed to a curve point, and s is the master secret */
+int ZZZ::MPIN_GET_CLIENT_SECRET(octet *S, octet *IDHTC, octet *CST)
+{
+    ECP P;
+    BIG s;
+    int res = 0;
+    BIG_fromBytes(s, S->val);
+    if (!ECP_fromOctet(&P, IDHTC)) res = MPIN_INVALID_POINT;
+  
+    if (res==0)
+    {
+        PAIR_G1mul(&P, s);
+        ECP_toOctet(CST, &P, false); /* change to TRUE for point compression */
+    }
+    return res;
+}
+
+/* Implement step 1 on client side of MPin protocol */
+int ZZZ::MPIN_CLIENT_1(octet *CID, csprng *RNG, octet *X, int pin, octet *TOKEN, octet *SEC, octet *xID)
+{
+    BIG r, x;
+    ECP P, T, W;
+    int res = 0;
+
+    BIG_rcopy(r, CURVE_Order);
+    if (RNG != NULL)
+    {
+        BIG_randtrunc(x, r, 2 * CURVE_SECURITY_ZZZ, RNG);
+        X->len = MODBYTES_XXX;
+        BIG_toBytes(X->val, x);
+    }
+    else
+        BIG_fromBytes(x, X->val);
+
+    if (!ECP_fromOctet(&P,CID)) res=MPIN_INVALID_POINT;
+
+    if (res==0)
+    {
+        if (!ECP_fromOctet(&T, TOKEN)) res = MPIN_INVALID_POINT;
+    }
+    if (res == 0)
+    {
+        pin %= MAXPIN;
+
+        ECP_copy(&W, &P);               // W=H(ID)
+        ECP_pinmul(&W, pin, PBLEN);     // W=alpha.H(ID)
+        ECP_add(&T, &W);                // T=Token+alpha.H(ID) = s.H(ID)
+        PAIR_G1mul(&P, x);              // P=x.H(ID)
+        ECP_toOctet(xID, &P, false);    // xID     /* change to TRUE for point compression */
+    }
+
+    if (res == 0)
+    {
+        ECP_toOctet(SEC, &T, false); // V    /* change to TRUE for point compression */
+    }
+    return res;
+}
+
+/* Extract Server Secret SST=S*Q where Q is fixed generator in G2 and S is master secret */
+int ZZZ::MPIN_GET_SERVER_SECRET(octet *S, octet *SST)
+{
+    BIG r, s;
+    ECP2 Q;
+    int res = 0;
+    BIG_rcopy(r, CURVE_Order);
+    ECP2_generator(&Q);
+    if (res == 0)
+    {
+        BIG_fromBytes(s, S->val);
+        PAIR_G2mul(&Q, s);
+        ECP2_toOctet(SST, &Q, false);
+    }
+    return res;
+}
+
+/* Implement M-Pin on server side */
+int ZZZ::MPIN_SERVER(octet *HID, octet *Y, octet *SST, octet *xID, octet *mSEC)
+{
+    BIG y;
+    FP12 g;
+    ECP2 Q, sQ;
+    ECP P, R;
+    int res = 0;
+
+    ECP2_generator(&Q);
+    if (!ECP2_fromOctet(&sQ, SST)) res = MPIN_INVALID_POINT;
+    if (res == 0)
+    {
+        if (!ECP_fromOctet(&R, xID))  res = MPIN_INVALID_POINT;
+    }
+    if (res == 0)
+    {
+        BIG_fromBytes(y, Y->val);
+        if (!ECP_fromOctet(&P, HID))  res = MPIN_INVALID_POINT;
+    }
+    if (res == 0)
+    {
+        PAIR_G1mul(&P, y); 
+        ECP_add(&P, &R); 
+        if (!ECP_fromOctet(&R, mSEC))  res = MPIN_INVALID_POINT; // V
+    }
+    if (res == 0)
+    {
+        PAIR_double_ate(&g, &Q, &R, &sQ, &P);
+        PAIR_fexp(&g);
+
+        if (!FP12_isunity(&g))
+        {
+            res = MPIN_BAD_PIN;
+        }
+    }
+    return res;
+}
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/mpin.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/mpin.h
new file mode 100644
index 0000000..2ed645d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/mpin.h
@@ -0,0 +1,136 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file mpin.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief M-Pin Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef MPIN_ZZZ_H
+#define MPIN_ZZZ_H
+
+#include "pair_ZZZ.h"
+//#include "pbc_support.h"
+
+using namespace core;
+
+
+namespace ZZZ {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define PGS_ZZZ MODBYTES_XXX  /**< MPIN Group Size */
+#define PFS_ZZZ MODBYTES_XXX  /**< MPIN Field Size */
+
+#define MPIN_OK             0   /**< Function completed without error */
+#define MPIN_INVALID_POINT  -14	/**< Point is NOT on the curve */
+#define MPIN_BAD_PIN        -19 /**< Bad PIN number entered */
+
+#define MAXPIN 10000         /**< max PIN */
+#define PBLEN 14             /**< max length of PIN in bits */
+
+//#define PAS_ZZZ 16        /**< MPIN Symmetric Key Size 128 bits */
+//#define HASH_TYPE_MPIN_ZZZ SHA256   /**< Choose Hash function */
+
+/* MPIN support functions */
+
+/* MPIN primitives */
+
+/**	@brief Encode a string to a curve point (in constant time)
+ *
+	@param DST is the Domain Separation Tag
+    @param ID is the input string
+    @param HID is the output point in G1
+*/
+void MPIN_ENCODE_TO_CURVE(octet *DST,octet *ID,octet *HID);
+
+/**	@brief Extract a PIN number from a client secret
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param pin is an input PIN number
+	@param CS is the client secret from which the PIN is to be extracted
+	@return 0 or an error code
+ */
+int MPIN_EXTRACT_PIN(octet *HID, int pin, octet *CS);
+
+/**	@brief Perform first pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param R is a pointer to a cryptographically secure random number generator
+	@param x an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param pin is the input PIN number
+	@param T is the input M-Pin token (the client secret with PIN portion removed)
+	@param S is the reconstructed client secret
+	@param U is output = x.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_1(octet *HID, csprng *R, octet *x, int pin, octet *T, octet *S, octet *U);
+/**	@brief Generate a random group element
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param S is the output random octet
+	@return 0 or an error code
+ */
+int MPIN_RANDOM_GENERATE(csprng *R, octet *S);
+/**	@brief Perform second pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param x an input, a locally generated random number
+	@param y an input random challenge from the server
+	@param V on output = -(x+y).V
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_2(octet *x, octet *y, octet *V);
+
+/**	@brief Perform final pass on the server side of the M-Pin protocol
+
+	@param HID is input H(ID), a hash of the client ID
+	@param y is the input server's randomly generated challenge
+	@param SS is the input server secret
+	@param U is input from the client = x.H(ID)
+	@param V is an input from the client
+	@return 0 or an error code
+ */
+int MPIN_SERVER(octet *HID, octet *y, octet *SS, octet *U, octet *V);
+
+/**	@brief Create a client secret in G1 from a master secret and the client ID
+ *
+	@param S is an input master secret
+	@param HID is the input client identity hashed to curve
+	@param CS is the full client secret = s.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_GET_CLIENT_SECRET(octet *S, octet *HID, octet *CS);
+
+/**	@brief Create a server secret in G2 from a master secret
+ *
+	@param S is an input master secret
+	@param SS is the server secret = s.Q where Q is a fixed generator of G2
+	@return 0 or an error code
+ */
+int MPIN_GET_SERVER_SECRET(octet *S, octet *SS);
+}
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/mpin192.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/mpin192.cpp
new file mode 100644
index 0000000..1aa6471
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/mpin192.cpp
@@ -0,0 +1,224 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* MPIN 192-bit API Functions */
+
+/* Version 3.0  */
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include <time.h>
+#include "mpin192_ZZZ.h"
+
+using namespace XXX;
+using namespace YYY;
+
+#define ROUNDUP(a,b) ((a)-1)/(b)+1
+
+void ZZZ::MPIN_ENCODE_TO_CURVE(octet *DST,octet *ID,octet *HCID)
+{
+    int j,k,m,L;
+    char okm[512],fd[256];
+    BIG q,r,w;
+    ECP P;
+    FP u;
+    DBIG dx;
+    octet OKM = {0,sizeof(okm),okm};
+    BIG_rcopy(q,Modulus);
+    k=BIG_nbits(q);
+    BIG_rcopy(r, CURVE_Order);
+    m=BIG_nbits(r);
+    L=ROUNDUP(k+ROUNDUP(m,2),8);
+    XMD_Expand(MC_SHA2,HASH_TYPE_ZZZ,&OKM,L,DST,ID);
+    for (j=0;j<L;j++)
+        fd[j]=OKM.val[j];
+        
+    BIG_dfromBytesLen(dx,fd,L);
+    BIG_dmod(w,dx,q);
+    FP_nres(&u,w);
+    ECP_map2point(&P,&u);
+    ECP_cfp(&P);
+    ECP_affine(&P);
+    ECP_toOctet(HCID, &P, false);
+}
+
+/* create random secret S */
+int ZZZ::MPIN_RANDOM_GENERATE(csprng *RNG, octet* S)
+{
+    BIG r, s;
+    BIG_rcopy(r, CURVE_Order);
+    BIG_randtrunc(s, r, 2 * CURVE_SECURITY_ZZZ, RNG);
+    BIG_toBytes(S->val, s);
+    S->len = MODBYTES_XXX;
+    return 0;
+}
+
+/* Extract PIN from TOKEN for identity CID */
+int ZZZ::MPIN_EXTRACT_PIN(octet *CID, int pin, octet *TOKEN)
+{
+    ECP P, R;
+    int res = 0;
+    pin %= MAXPIN;
+
+    if (!ECP_fromOctet(&P, TOKEN))  res = MPIN_INVALID_POINT;
+    if (res == 0)
+    {
+        if (!ECP_fromOctet(&R,CID)) res=MPIN_INVALID_POINT;
+    }
+    if (res==0)
+    {
+        ECP_pinmul(&R, pin, PBLEN);
+        ECP_sub(&P, &R);
+        ECP_toOctet(TOKEN, &P, false);
+    }
+    return res;
+}
+
+/* Implement step 2 on client side of MPin protocol - SEC=-(x+y)*SEC */
+int ZZZ::MPIN_CLIENT_2(octet *X, octet *Y, octet *SEC)
+{
+    BIG px, py, r;
+    ECP P;
+    int res = 0;
+    BIG_rcopy(r, CURVE_Order);
+    if (!ECP_fromOctet(&P, SEC)) res = MPIN_INVALID_POINT;
+    if (res == 0)
+    {
+        BIG_fromBytes(px, X->val);
+        BIG_fromBytes(py, Y->val);
+        BIG_add(px, px, py);
+        BIG_mod(px, r);
+        PAIR_G1mul(&P, px);
+        ECP_neg(&P);
+        ECP_toOctet(SEC, &P, false);
+    }
+    return res;
+}
+
+/* Client secret CST=s*IDHTC where IDHTC is client ID hashed to a curve point, and s is the master secret */
+int ZZZ::MPIN_GET_CLIENT_SECRET(octet *S, octet *IDHTC, octet *CST)
+{
+    ECP P;
+    BIG s;
+    int res = 0;
+    BIG_fromBytes(s, S->val);
+    if (!ECP_fromOctet(&P, IDHTC)) res = MPIN_INVALID_POINT;
+    if (res==0)
+    {
+        PAIR_G1mul(&P, s);
+        ECP_toOctet(CST, &P, false); /* change to TRUE for point compression */
+    }
+    return res;
+}
+
+/* Implement step 1 on client side of MPin protocol */
+int ZZZ::MPIN_CLIENT_1(octet *CID, csprng *RNG, octet *X, int pin, octet *TOKEN, octet *SEC, octet *xID)
+{
+    BIG r, x;
+    ECP P, T, W;
+    int res = 0;
+    BIG_rcopy(r, CURVE_Order);
+    if (RNG != NULL)
+    {
+        BIG_randtrunc(x, r, 2 * CURVE_SECURITY_ZZZ, RNG);
+        X->len = MODBYTES_XXX;
+        BIG_toBytes(X->val, x);
+    }
+    else
+        BIG_fromBytes(x, X->val);
+
+    if (!ECP_fromOctet(&P,CID)) res=MPIN_INVALID_POINT;
+
+    if (res==0)
+    {
+        if (!ECP_fromOctet(&T, TOKEN)) res = MPIN_INVALID_POINT;
+    }
+    if (res == 0)
+    {
+        pin %= MAXPIN;
+        ECP_copy(&W, &P);               // W=H(ID)
+        ECP_pinmul(&W, pin, PBLEN);         // W=alpha.H(ID)
+        ECP_add(&T, &W);                // T=Token+alpha.H(ID) = s.H(ID)
+        PAIR_G1mul(&P, x);              // P=x.H(ID)
+        ECP_toOctet(xID, &P, false); // xID
+    }
+
+    if (res == 0)
+    {
+        ECP_toOctet(SEC, &T, false); // V
+    }
+    return res;
+}
+
+/* Extract Server Secret SST=S*Q where Q is fixed generator in G2 and S is master secret */
+int ZZZ::MPIN_GET_SERVER_SECRET(octet *S, octet *SST)
+{
+    BIG r, s;
+    ECP4 Q;
+    int res = 0;
+    BIG_rcopy(r, CURVE_Order);
+    ECP4_generator(&Q);
+    if (res == 0)
+    {
+        BIG_fromBytes(s, S->val);
+        PAIR_G2mul(&Q, s);
+        ECP4_toOctet(SST, &Q, false);
+    }
+    return res;
+}
+
+/* Implement M-Pin on server side */
+int ZZZ::MPIN_SERVER(octet *HID, octet *Y, octet *SST, octet *xID, octet *mSEC)
+{
+    BIG y;
+    FP24 g;
+    ECP4 Q, sQ;
+    ECP P, R;
+    int res = 0;
+    ECP4_generator(&Q);
+
+    if (!ECP4_fromOctet(&sQ, SST)) res = MPIN_INVALID_POINT;
+    if (res == 0)
+    {
+        if (!ECP_fromOctet(&R, xID))  res = MPIN_INVALID_POINT;
+    }
+    if (res == 0)
+    {
+        BIG_fromBytes(y, Y->val);
+        if (!ECP_fromOctet(&P, HID))  res = MPIN_INVALID_POINT;
+    }
+    if (res == 0)
+    {
+        PAIR_G1mul(&P, y); // y(A+AT)
+        ECP_add(&P, &R); // x(A+AT)+y(A+T)
+        if (!ECP_fromOctet(&R, mSEC))  res = MPIN_INVALID_POINT; // V
+    }
+    if (res == 0)
+    {
+        PAIR_double_ate(&g, &Q, &R, &sQ, &P);
+        PAIR_fexp(&g);
+        if (!FP24_isunity(&g))
+        {
+            res = MPIN_BAD_PIN;
+        }
+    }
+    return res;
+}
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/mpin192.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/mpin192.h
new file mode 100644
index 0000000..6aac781
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/mpin192.h
@@ -0,0 +1,136 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file mpin.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief M-Pin Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef MPIN_ZZZ_H
+#define MPIN_ZZZ_H
+
+#include "pair4_ZZZ.h"
+//#include "pbc_support.h"
+
+using namespace core;
+
+
+namespace ZZZ {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define PGS_ZZZ MODBYTES_XXX  /**< MPIN Group Size */
+#define PFS_ZZZ MODBYTES_XXX  /**< MPIN Field Size */
+
+#define MPIN_OK             0   /**< Function completed without error */
+#define MPIN_INVALID_POINT  -14	/**< Point is NOT on the curve */
+#define MPIN_BAD_PIN        -19 /**< Bad PIN number entered */
+
+#define MAXPIN 10000         /**< max PIN */
+#define PBLEN 14             /**< max length of PIN in bits */
+
+//#define PAS_ZZZ 24        /**< MPIN Symmetric Key Size 192 bits  */
+//#define HASH_TYPE_MPIN_ZZZ SHA384   /**< Choose Hash function */
+
+/* MPIN support functions */
+
+/* MPIN primitives */
+
+/**	@brief Encode a string to a curve point (in constant time)
+ *
+	@param DST is the Domain Separation Tag
+    @param ID is the input string
+    @param HID is the output point in G1
+*/
+void MPIN_ENCODE_TO_CURVE(octet *DST,octet *ID,octet *HID);
+
+/**	@brief Extract a PIN number from a client secret
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param pin is an input PIN number
+	@param CS is the client secret from which the PIN is to be extracted
+	@return 0 or an error code
+ */
+int MPIN_EXTRACT_PIN(octet *HID, int pin, octet *CS);
+
+/**	@brief Perform first pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param R is a pointer to a cryptographically secure random number generator
+	@param x an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param pin is the input PIN number
+	@param T is the input M-Pin token (the client secret with PIN portion removed)
+	@param S is the reconstructed client secret
+	@param U is output = x.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_1(octet *HID, csprng *R, octet *x, int pin, octet *T, octet *S, octet *U);
+/**	@brief Generate a random group element
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param S is the output random octet
+	@return 0 or an error code
+ */
+int MPIN_RANDOM_GENERATE(csprng *R, octet *S);
+/**	@brief Perform second pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param x an input, a locally generated random number
+	@param y an input random challenge from the server
+	@param V on output = -(x+y).V
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_2(octet *x, octet *y, octet *V);
+
+/**	@brief Perform third pass on the server side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is input H(ID), a hash of the client ID
+	@param y is the input server's randomly generated challenge
+	@param SS is the input server secret
+	@param U is input from the client = x.H(ID)
+	@param V is an input from the client
+	@return 0 or an error code
+ */
+int MPIN_SERVER(octet *HID, octet *y, octet *SS, octet *U, octet *V);
+
+/**	@brief Create a client secret in G1 from a master secret and the client ID
+ *
+	@param S is an input master secret
+	@param HID is the input client identity hashed to point
+	@param CS is the full client secret = s.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_GET_CLIENT_SECRET(octet *S, octet *HID, octet *CS);
+
+/**	@brief Create a server secret in G2 from a master secret
+ *
+	@param S is an input master secret
+	@param SS is the server secret = s.Q where Q is a fixed generator of G2
+	@return 0 or an error code
+ */
+int MPIN_GET_SERVER_SECRET(octet *S, octet *SS);
+}
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/mpin192_BLS24479.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/mpin192_BLS24479.h
new file mode 100644
index 0000000..1656a0d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/mpin192_BLS24479.h
@@ -0,0 +1,136 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file mpin.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief M-Pin Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef MPIN_BLS24479_H
+#define MPIN_BLS24479_H
+
+#include "pair4_BLS24479.h"
+//#include "pbc_support.h"
+
+using namespace core;
+
+
+namespace BLS24479 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define PGS_BLS24479 MODBYTES_B480_56  /**< MPIN Group Size */
+#define PFS_BLS24479 MODBYTES_B480_56  /**< MPIN Field Size */
+
+#define MPIN_OK             0   /**< Function completed without error */
+#define MPIN_INVALID_POINT  -14	/**< Point is NOT on the curve */
+#define MPIN_BAD_PIN        -19 /**< Bad PIN number entered */
+
+#define MAXPIN 10000         /**< max PIN */
+#define PBLEN 14             /**< max length of PIN in bits */
+
+//#define PAS_BLS24479 24        /**< MPIN Symmetric Key Size 192 bits  */
+//#define HASH_TYPE_MPIN_BLS24479 SHA384   /**< Choose Hash function */
+
+/* MPIN support functions */
+
+/* MPIN primitives */
+
+/**	@brief Encode a string to a curve point (in constant time)
+ *
+	@param DST is the Domain Separation Tag
+    @param ID is the input string
+    @param HID is the output point in G1
+*/
+void MPIN_ENCODE_TO_CURVE(octet *DST,octet *ID,octet *HID);
+
+/**	@brief Extract a PIN number from a client secret
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param pin is an input PIN number
+	@param CS is the client secret from which the PIN is to be extracted
+	@return 0 or an error code
+ */
+int MPIN_EXTRACT_PIN(octet *HID, int pin, octet *CS);
+
+/**	@brief Perform first pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param R is a pointer to a cryptographically secure random number generator
+	@param x an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param pin is the input PIN number
+	@param T is the input M-Pin token (the client secret with PIN portion removed)
+	@param S is the reconstructed client secret
+	@param U is output = x.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_1(octet *HID, csprng *R, octet *x, int pin, octet *T, octet *S, octet *U);
+/**	@brief Generate a random group element
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param S is the output random octet
+	@return 0 or an error code
+ */
+int MPIN_RANDOM_GENERATE(csprng *R, octet *S);
+/**	@brief Perform second pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param x an input, a locally generated random number
+	@param y an input random challenge from the server
+	@param V on output = -(x+y).V
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_2(octet *x, octet *y, octet *V);
+
+/**	@brief Perform third pass on the server side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is input H(ID), a hash of the client ID
+	@param y is the input server's randomly generated challenge
+	@param SS is the input server secret
+	@param U is input from the client = x.H(ID)
+	@param V is an input from the client
+	@return 0 or an error code
+ */
+int MPIN_SERVER(octet *HID, octet *y, octet *SS, octet *U, octet *V);
+
+/**	@brief Create a client secret in G1 from a master secret and the client ID
+ *
+	@param S is an input master secret
+	@param HID is the input client identity hashed to point
+	@param CS is the full client secret = s.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_GET_CLIENT_SECRET(octet *S, octet *HID, octet *CS);
+
+/**	@brief Create a server secret in G2 from a master secret
+ *
+	@param S is an input master secret
+	@param SS is the server secret = s.Q where Q is a fixed generator of G2
+	@return 0 or an error code
+ */
+int MPIN_GET_SERVER_SECRET(octet *S, octet *SS);
+}
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/mpin256.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/mpin256.cpp
new file mode 100644
index 0000000..14230c6
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/mpin256.cpp
@@ -0,0 +1,224 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* MPIN 256-bit API Functions */
+
+/* Version 3.0  */
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include <time.h>
+#include "mpin256_ZZZ.h"
+
+using namespace XXX;
+using namespace YYY;
+
+#define ROUNDUP(a,b) ((a)-1)/(b)+1
+
+void ZZZ::MPIN_ENCODE_TO_CURVE(octet *DST,octet *ID,octet *HCID)
+{
+    int j,k,m,L;
+    char okm[512],fd[256];
+    BIG q,r,w;
+    ECP P;
+    FP u;
+    DBIG dx;
+    octet OKM = {0,sizeof(okm),okm};
+    BIG_rcopy(q,Modulus);
+    k=BIG_nbits(q);
+    BIG_rcopy(r, CURVE_Order);
+    m=BIG_nbits(r);
+    L=ROUNDUP(k+ROUNDUP(m,2),8);
+    XMD_Expand(MC_SHA2,HASH_TYPE_ZZZ,&OKM,L,DST,ID);
+    for (j=0;j<L;j++)
+        fd[j]=OKM.val[j];
+        
+    BIG_dfromBytesLen(dx,fd,L);
+    BIG_dmod(w,dx,q);
+    FP_nres(&u,w);
+    ECP_map2point(&P,&u);
+    ECP_cfp(&P);
+    ECP_affine(&P);
+    ECP_toOctet(HCID, &P, false);
+}
+
+/* create random secret S */
+int ZZZ::MPIN_RANDOM_GENERATE(csprng *RNG, octet* S)
+{
+    BIG r, s;
+
+    BIG_rcopy(r, CURVE_Order);
+    BIG_randtrunc(s, r, 2 * CURVE_SECURITY_ZZZ, RNG);
+    BIG_toBytes(S->val, s);
+    S->len = MODBYTES_XXX;
+    return 0;
+}
+
+/* Extract PIN from TOKEN for identity CID */
+int ZZZ::MPIN_EXTRACT_PIN(octet *CID, int pin, octet *TOKEN)
+{
+    ECP P, R;
+    int res = 0;
+    pin %= MAXPIN;
+    if (!ECP_fromOctet(&P, TOKEN))  res = MPIN_INVALID_POINT;
+    if (res == 0)
+    {
+        if (!ECP_fromOctet(&R,CID)) res=MPIN_INVALID_POINT;
+    }
+    if (res==0)
+    {
+        ECP_pinmul(&R, pin, PBLEN);
+        ECP_sub(&P, &R);
+        ECP_toOctet(TOKEN, &P, false);
+    }
+    return res;
+}
+
+/* Implement step 2 on client side of MPin protocol - SEC=-(x+y)*SEC */
+int ZZZ::MPIN_CLIENT_2(octet *X, octet *Y, octet *SEC)
+{
+    BIG px, py, r;
+    ECP P;
+    int res = 0;
+    BIG_rcopy(r, CURVE_Order);
+    if (!ECP_fromOctet(&P, SEC)) res = MPIN_INVALID_POINT;
+    if (res == 0)
+    {
+        BIG_fromBytes(px, X->val);
+        BIG_fromBytes(py, Y->val);
+        BIG_add(px, px, py);
+        BIG_mod(px, r);
+        PAIR_G1mul(&P, px);
+        ECP_neg(&P);
+        ECP_toOctet(SEC, &P, false);
+    }
+    return res;
+}
+
+/* Client secret CST=s*IDHTC where IDHTC is client ID hashed to a curve point, and s is the master secret */
+int ZZZ::MPIN_GET_CLIENT_SECRET(octet *S, octet *IDHTC, octet *CST)
+{
+    ECP P;
+    BIG s;
+    int res = 0;
+    BIG_fromBytes(s, S->val);
+    if (!ECP_fromOctet(&P, IDHTC)) res = MPIN_INVALID_POINT;
+    if (res==0)
+    {
+        PAIR_G1mul(&P, s);
+        ECP_toOctet(CST, &P, false); /* change to TRUE for point compression */
+    }
+    return res;
+}
+
+/* Implement step 1 on client side of MPin protocol */
+int ZZZ::MPIN_CLIENT_1(octet *CID, csprng *RNG, octet *X, int pin, octet *TOKEN, octet *SEC, octet *xID)
+{
+    BIG r, x;
+    ECP P, T, W;
+    int res = 0;
+    BIG_rcopy(r, CURVE_Order);
+    if (RNG != NULL)
+    {
+        BIG_randtrunc(x, r, 2 * CURVE_SECURITY_ZZZ, RNG);
+        X->len = MODBYTES_XXX;
+        BIG_toBytes(X->val, x);
+    }
+    else
+        BIG_fromBytes(x, X->val);
+
+    if (!ECP_fromOctet(&P,CID)) res=MPIN_INVALID_POINT;
+
+    if (res==0)
+    {    
+        if (!ECP_fromOctet(&T, TOKEN)) res = MPIN_INVALID_POINT;
+    }
+    if (res == 0)
+    {
+        pin %= MAXPIN;
+        ECP_copy(&W, &P);               // W=H(ID)
+        ECP_pinmul(&W, pin, PBLEN);         // W=alpha.H(ID)
+        ECP_add(&T, &W);                // T=Token+alpha.H(ID) = s.H(ID)
+        PAIR_G1mul(&P, x);              // P=x.H(ID)
+        ECP_toOctet(xID, &P, false); // xID
+    }
+    if (res == 0)
+    {
+        ECP_toOctet(SEC, &T, false); // V
+    }
+    return res;
+}
+
+/* Extract Server Secret SST=S*Q where Q is fixed generator in G2 and S is master secret */
+int ZZZ::MPIN_GET_SERVER_SECRET(octet *S, octet *SST)
+{
+    BIG r, s;
+    ECP8 Q;
+    int res = 0;
+    BIG_rcopy(r, CURVE_Order);
+    ECP8_generator(&Q);
+    if (res == 0)
+    {
+        BIG_fromBytes(s, S->val);
+        PAIR_G2mul(&Q, s);
+        ECP8_toOctet(SST, &Q, false);
+    }
+    return res;
+}
+
+/* Implement M-Pin on server side */
+int ZZZ::MPIN_SERVER(octet *HID, octet *Y, octet *SST, octet *xID, octet *mSEC)
+{
+    BIG y;
+    FP48 g;
+    ECP8 Q, sQ;
+    ECP P, R;
+    int res = 0;
+    ECP8_generator(&Q);
+
+    if (!ECP8_fromOctet(&sQ, SST)) res = MPIN_INVALID_POINT;
+
+    if (res == 0)
+    {
+        if (!ECP_fromOctet(&R, xID))  res = MPIN_INVALID_POINT;
+    }
+    if (res == 0)
+    {
+        BIG_fromBytes(y, Y->val);
+        if (!ECP_fromOctet(&P, HID))  res = MPIN_INVALID_POINT;
+    }
+    if (res == 0)
+    {
+        PAIR_G1mul(&P, y); // y(A+AT)
+        ECP_add(&P, &R); // x(A+AT)+y(A+T)
+        if (!ECP_fromOctet(&R, mSEC))  res = MPIN_INVALID_POINT; // V
+    }
+    if (res == 0)
+    {
+        PAIR_double_ate(&g, &Q, &R, &sQ, &P);
+        PAIR_fexp(&g);
+        if (!FP48_isunity(&g))
+        {
+            res = MPIN_BAD_PIN;
+        }
+    }
+    return res;
+}
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/mpin256.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/mpin256.h
new file mode 100644
index 0000000..0dfbbbb
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/mpin256.h
@@ -0,0 +1,133 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file mpin.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief M-Pin Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef MPIN_ZZZ_H
+#define MPIN_ZZZ_H
+
+#include "pair8_ZZZ.h"
+//#include "pbc_support.h"
+
+using namespace core;
+
+
+namespace ZZZ {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define PGS_ZZZ MODBYTES_XXX  /**< MPIN Group Size */
+#define PFS_ZZZ MODBYTES_XXX  /**< MPIN Field Size */
+
+#define MPIN_OK             0   /**< Function completed without error */
+#define MPIN_INVALID_POINT  -14	/**< Point is NOT on the curve */
+#define MPIN_BAD_PIN        -19 /**< Bad PIN number entered */
+
+#define MAXPIN 10000         /**< max PIN */
+#define PBLEN 14             /**< max length of PIN in bits */
+
+//#define PAS_ZZZ 24        /**< MPIN Symmetric Key Size 192 bits  */
+//#define HASH_TYPE_MPIN_ZZZ SHA384   /**< Choose Hash function */
+
+/* MPIN support functions */
+/* MPIN primitives */
+
+/**	@brief Encode a string to a curve point (in constant time)
+ *
+	@param DST is the Domain Separation Tag
+    @param ID is the input string
+    @param HCID is the output point in G1
+*/
+void MPIN_ENCODE_TO_CURVE(octet *DST,octet *ID,octet *HCID);
+
+/**	@brief Extract a PIN number from a client secret
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param pin is an input PIN number
+	@param CS is the client secret from which the PIN is to be extracted
+	@return 0 or an error code
+ */
+int MPIN_EXTRACT_PIN(octet *HID, int pin, octet *CS);
+
+/**	@brief Perform first pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param R is a pointer to a cryptographically secure random number generator
+	@param x an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param pin is the input PIN number
+	@param T is the input M-Pin token (the client secret with PIN portion removed)
+	@param S is output = CS+TP, where CS=is the reconstructed client secret, and TP is the time permit
+	@param U is output = x.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_1(octet *HID, csprng *R, octet *x, int pin, octet *T, octet *S, octet *U);
+/**	@brief Generate a random group element
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param S is the output random octet
+	@return 0 or an error code
+ */
+int MPIN_RANDOM_GENERATE(csprng *R, octet *S);
+/**	@brief Perform second pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param x an input, a locally generated random number
+	@param y an input random challenge from the server
+	@param V on output = -(x+y).V
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_2(octet *x, octet *y, octet *V);
+/**	@brief Perform third pass on the server side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is input H(ID), a hash of the client ID
+	@param y is the input server's randomly generated challenge
+	@param SS is the input server secret
+	@param U is input from the client = x.H(ID)
+	@param V is an input from the client
+	@return 0 or an error code
+ */
+int MPIN_SERVER(octet *HID, octet *y, octet *SS, octet *U, octet *V);
+/**	@brief Create a client secret in G1 from a master secret and the client ID
+ *
+	@param S is an input master secret
+	@param HID is the input client identity hashed to point
+	@param CS is the full client secret = s.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_GET_CLIENT_SECRET(octet *S, octet *HID, octet *CS);
+
+/**	@brief Create a server secret in G2 from a master secret
+ *
+	@param S is an input master secret
+	@param SS is the server secret = s.Q where Q is a fixed generator of G2
+	@return 0 or an error code
+ */
+int MPIN_GET_SERVER_SECRET(octet *S, octet *SS);
+}
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/mpin256_BLS48286.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/mpin256_BLS48286.h
new file mode 100644
index 0000000..127dd28
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/mpin256_BLS48286.h
@@ -0,0 +1,133 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file mpin.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief M-Pin Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef MPIN_BLS48286_H
+#define MPIN_BLS48286_H
+
+#include "pair8_BLS48286.h"
+//#include "pbc_support.h"
+
+using namespace core;
+
+
+namespace BLS48286 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define PGS_BLS48286 MODBYTES_B288_60  /**< MPIN Group Size */
+#define PFS_BLS48286 MODBYTES_B288_60  /**< MPIN Field Size */
+
+#define MPIN_OK             0   /**< Function completed without error */
+#define MPIN_INVALID_POINT  -14	/**< Point is NOT on the curve */
+#define MPIN_BAD_PIN        -19 /**< Bad PIN number entered */
+
+#define MAXPIN 10000         /**< max PIN */
+#define PBLEN 14             /**< max length of PIN in bits */
+
+//#define PAS_BLS48286 24        /**< MPIN Symmetric Key Size 192 bits  */
+//#define HASH_TYPE_MPIN_BLS48286 SHA384   /**< Choose Hash function */
+
+/* MPIN support functions */
+/* MPIN primitives */
+
+/**	@brief Encode a string to a curve point (in constant time)
+ *
+	@param DST is the Domain Separation Tag
+    @param ID is the input string
+    @param HCID is the output point in G1
+*/
+void MPIN_ENCODE_TO_CURVE(octet *DST,octet *ID,octet *HCID);
+
+/**	@brief Extract a PIN number from a client secret
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param pin is an input PIN number
+	@param CS is the client secret from which the PIN is to be extracted
+	@return 0 or an error code
+ */
+int MPIN_EXTRACT_PIN(octet *HID, int pin, octet *CS);
+
+/**	@brief Perform first pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param R is a pointer to a cryptographically secure random number generator
+	@param x an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param pin is the input PIN number
+	@param T is the input M-Pin token (the client secret with PIN portion removed)
+	@param S is output = CS+TP, where CS=is the reconstructed client secret, and TP is the time permit
+	@param U is output = x.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_1(octet *HID, csprng *R, octet *x, int pin, octet *T, octet *S, octet *U);
+/**	@brief Generate a random group element
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param S is the output random octet
+	@return 0 or an error code
+ */
+int MPIN_RANDOM_GENERATE(csprng *R, octet *S);
+/**	@brief Perform second pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param x an input, a locally generated random number
+	@param y an input random challenge from the server
+	@param V on output = -(x+y).V
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_2(octet *x, octet *y, octet *V);
+/**	@brief Perform third pass on the server side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is input H(ID), a hash of the client ID
+	@param y is the input server's randomly generated challenge
+	@param SS is the input server secret
+	@param U is input from the client = x.H(ID)
+	@param V is an input from the client
+	@return 0 or an error code
+ */
+int MPIN_SERVER(octet *HID, octet *y, octet *SS, octet *U, octet *V);
+/**	@brief Create a client secret in G1 from a master secret and the client ID
+ *
+	@param S is an input master secret
+	@param HID is the input client identity hashed to point
+	@param CS is the full client secret = s.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_GET_CLIENT_SECRET(octet *S, octet *HID, octet *CS);
+
+/**	@brief Create a server secret in G2 from a master secret
+ *
+	@param S is an input master secret
+	@param SS is the server secret = s.Q where Q is a fixed generator of G2
+	@return 0 or an error code
+ */
+int MPIN_GET_SERVER_SECRET(octet *S, octet *SS);
+}
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/mpin256_BLS48556.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/mpin256_BLS48556.h
new file mode 100644
index 0000000..46b77cd
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/mpin256_BLS48556.h
@@ -0,0 +1,133 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file mpin.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief M-Pin Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef MPIN_BLS48556_H
+#define MPIN_BLS48556_H
+
+#include "pair8_BLS48556.h"
+//#include "pbc_support.h"
+
+using namespace core;
+
+
+namespace BLS48556 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define PGS_BLS48556 MODBYTES_B560_58  /**< MPIN Group Size */
+#define PFS_BLS48556 MODBYTES_B560_58  /**< MPIN Field Size */
+
+#define MPIN_OK             0   /**< Function completed without error */
+#define MPIN_INVALID_POINT  -14	/**< Point is NOT on the curve */
+#define MPIN_BAD_PIN        -19 /**< Bad PIN number entered */
+
+#define MAXPIN 10000         /**< max PIN */
+#define PBLEN 14             /**< max length of PIN in bits */
+
+//#define PAS_BLS48556 24        /**< MPIN Symmetric Key Size 192 bits  */
+//#define HASH_TYPE_MPIN_BLS48556 SHA384   /**< Choose Hash function */
+
+/* MPIN support functions */
+/* MPIN primitives */
+
+/**	@brief Encode a string to a curve point (in constant time)
+ *
+	@param DST is the Domain Separation Tag
+    @param ID is the input string
+    @param HCID is the output point in G1
+*/
+void MPIN_ENCODE_TO_CURVE(octet *DST,octet *ID,octet *HCID);
+
+/**	@brief Extract a PIN number from a client secret
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param pin is an input PIN number
+	@param CS is the client secret from which the PIN is to be extracted
+	@return 0 or an error code
+ */
+int MPIN_EXTRACT_PIN(octet *HID, int pin, octet *CS);
+
+/**	@brief Perform first pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param R is a pointer to a cryptographically secure random number generator
+	@param x an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param pin is the input PIN number
+	@param T is the input M-Pin token (the client secret with PIN portion removed)
+	@param S is output = CS+TP, where CS=is the reconstructed client secret, and TP is the time permit
+	@param U is output = x.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_1(octet *HID, csprng *R, octet *x, int pin, octet *T, octet *S, octet *U);
+/**	@brief Generate a random group element
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param S is the output random octet
+	@return 0 or an error code
+ */
+int MPIN_RANDOM_GENERATE(csprng *R, octet *S);
+/**	@brief Perform second pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param x an input, a locally generated random number
+	@param y an input random challenge from the server
+	@param V on output = -(x+y).V
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_2(octet *x, octet *y, octet *V);
+/**	@brief Perform third pass on the server side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is input H(ID), a hash of the client ID
+	@param y is the input server's randomly generated challenge
+	@param SS is the input server secret
+	@param U is input from the client = x.H(ID)
+	@param V is an input from the client
+	@return 0 or an error code
+ */
+int MPIN_SERVER(octet *HID, octet *y, octet *SS, octet *U, octet *V);
+/**	@brief Create a client secret in G1 from a master secret and the client ID
+ *
+	@param S is an input master secret
+	@param HID is the input client identity hashed to point
+	@param CS is the full client secret = s.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_GET_CLIENT_SECRET(octet *S, octet *HID, octet *CS);
+
+/**	@brief Create a server secret in G2 from a master secret
+ *
+	@param S is an input master secret
+	@param SS is the server secret = s.Q where Q is a fixed generator of G2
+	@return 0 or an error code
+ */
+int MPIN_GET_SERVER_SECRET(octet *S, octet *SS);
+}
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/mpin256_BLS48581.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/mpin256_BLS48581.h
new file mode 100644
index 0000000..08ee9ad
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/mpin256_BLS48581.h
@@ -0,0 +1,133 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file mpin.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief M-Pin Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef MPIN_BLS48581_H
+#define MPIN_BLS48581_H
+
+#include "pair8_BLS48581.h"
+//#include "pbc_support.h"
+
+using namespace core;
+
+
+namespace BLS48581 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define PGS_BLS48581 MODBYTES_B584_60  /**< MPIN Group Size */
+#define PFS_BLS48581 MODBYTES_B584_60  /**< MPIN Field Size */
+
+#define MPIN_OK             0   /**< Function completed without error */
+#define MPIN_INVALID_POINT  -14	/**< Point is NOT on the curve */
+#define MPIN_BAD_PIN        -19 /**< Bad PIN number entered */
+
+#define MAXPIN 10000         /**< max PIN */
+#define PBLEN 14             /**< max length of PIN in bits */
+
+//#define PAS_BLS48581 24        /**< MPIN Symmetric Key Size 192 bits  */
+//#define HASH_TYPE_MPIN_BLS48581 SHA384   /**< Choose Hash function */
+
+/* MPIN support functions */
+/* MPIN primitives */
+
+/**	@brief Encode a string to a curve point (in constant time)
+ *
+	@param DST is the Domain Separation Tag
+    @param ID is the input string
+    @param HCID is the output point in G1
+*/
+void MPIN_ENCODE_TO_CURVE(octet *DST,octet *ID,octet *HCID);
+
+/**	@brief Extract a PIN number from a client secret
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param pin is an input PIN number
+	@param CS is the client secret from which the PIN is to be extracted
+	@return 0 or an error code
+ */
+int MPIN_EXTRACT_PIN(octet *HID, int pin, octet *CS);
+
+/**	@brief Perform first pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param R is a pointer to a cryptographically secure random number generator
+	@param x an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param pin is the input PIN number
+	@param T is the input M-Pin token (the client secret with PIN portion removed)
+	@param S is output = CS+TP, where CS=is the reconstructed client secret, and TP is the time permit
+	@param U is output = x.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_1(octet *HID, csprng *R, octet *x, int pin, octet *T, octet *S, octet *U);
+/**	@brief Generate a random group element
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param S is the output random octet
+	@return 0 or an error code
+ */
+int MPIN_RANDOM_GENERATE(csprng *R, octet *S);
+/**	@brief Perform second pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param x an input, a locally generated random number
+	@param y an input random challenge from the server
+	@param V on output = -(x+y).V
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_2(octet *x, octet *y, octet *V);
+/**	@brief Perform third pass on the server side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is input H(ID), a hash of the client ID
+	@param y is the input server's randomly generated challenge
+	@param SS is the input server secret
+	@param U is input from the client = x.H(ID)
+	@param V is an input from the client
+	@return 0 or an error code
+ */
+int MPIN_SERVER(octet *HID, octet *y, octet *SS, octet *U, octet *V);
+/**	@brief Create a client secret in G1 from a master secret and the client ID
+ *
+	@param S is an input master secret
+	@param HID is the input client identity hashed to point
+	@param CS is the full client secret = s.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_GET_CLIENT_SECRET(octet *S, octet *HID, octet *CS);
+
+/**	@brief Create a server secret in G2 from a master secret
+ *
+	@param S is an input master secret
+	@param SS is the server secret = s.Q where Q is a fixed generator of G2
+	@return 0 or an error code
+ */
+int MPIN_GET_SERVER_SECRET(octet *S, octet *SS);
+}
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/mpin_BLS12381.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/mpin_BLS12381.h
new file mode 100644
index 0000000..319c196
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/mpin_BLS12381.h
@@ -0,0 +1,136 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file mpin.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief M-Pin Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef MPIN_BLS12381_H
+#define MPIN_BLS12381_H
+
+#include "pair_BLS12381.h"
+//#include "pbc_support.h"
+
+using namespace core;
+
+
+namespace BLS12381 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define PGS_BLS12381 MODBYTES_B384_58  /**< MPIN Group Size */
+#define PFS_BLS12381 MODBYTES_B384_58  /**< MPIN Field Size */
+
+#define MPIN_OK             0   /**< Function completed without error */
+#define MPIN_INVALID_POINT  -14	/**< Point is NOT on the curve */
+#define MPIN_BAD_PIN        -19 /**< Bad PIN number entered */
+
+#define MAXPIN 10000         /**< max PIN */
+#define PBLEN 14             /**< max length of PIN in bits */
+
+//#define PAS_BLS12381 16        /**< MPIN Symmetric Key Size 128 bits */
+//#define HASH_TYPE_MPIN_BLS12381 SHA256   /**< Choose Hash function */
+
+/* MPIN support functions */
+
+/* MPIN primitives */
+
+/**	@brief Encode a string to a curve point (in constant time)
+ *
+	@param DST is the Domain Separation Tag
+    @param ID is the input string
+    @param HID is the output point in G1
+*/
+void MPIN_ENCODE_TO_CURVE(octet *DST,octet *ID,octet *HID);
+
+/**	@brief Extract a PIN number from a client secret
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param pin is an input PIN number
+	@param CS is the client secret from which the PIN is to be extracted
+	@return 0 or an error code
+ */
+int MPIN_EXTRACT_PIN(octet *HID, int pin, octet *CS);
+
+/**	@brief Perform first pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param R is a pointer to a cryptographically secure random number generator
+	@param x an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param pin is the input PIN number
+	@param T is the input M-Pin token (the client secret with PIN portion removed)
+	@param S is the reconstructed client secret
+	@param U is output = x.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_1(octet *HID, csprng *R, octet *x, int pin, octet *T, octet *S, octet *U);
+/**	@brief Generate a random group element
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param S is the output random octet
+	@return 0 or an error code
+ */
+int MPIN_RANDOM_GENERATE(csprng *R, octet *S);
+/**	@brief Perform second pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param x an input, a locally generated random number
+	@param y an input random challenge from the server
+	@param V on output = -(x+y).V
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_2(octet *x, octet *y, octet *V);
+
+/**	@brief Perform final pass on the server side of the M-Pin protocol
+
+	@param HID is input H(ID), a hash of the client ID
+	@param y is the input server's randomly generated challenge
+	@param SS is the input server secret
+	@param U is input from the client = x.H(ID)
+	@param V is an input from the client
+	@return 0 or an error code
+ */
+int MPIN_SERVER(octet *HID, octet *y, octet *SS, octet *U, octet *V);
+
+/**	@brief Create a client secret in G1 from a master secret and the client ID
+ *
+	@param S is an input master secret
+	@param HID is the input client identity hashed to curve
+	@param CS is the full client secret = s.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_GET_CLIENT_SECRET(octet *S, octet *HID, octet *CS);
+
+/**	@brief Create a server secret in G2 from a master secret
+ *
+	@param S is an input master secret
+	@param SS is the server secret = s.Q where Q is a fixed generator of G2
+	@return 0 or an error code
+ */
+int MPIN_GET_SERVER_SECRET(octet *S, octet *SS);
+}
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/mpin_BLS12383.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/mpin_BLS12383.h
new file mode 100644
index 0000000..4107a91
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/mpin_BLS12383.h
@@ -0,0 +1,136 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file mpin.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief M-Pin Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef MPIN_BLS12383_H
+#define MPIN_BLS12383_H
+
+#include "pair_BLS12383.h"
+//#include "pbc_support.h"
+
+using namespace core;
+
+
+namespace BLS12383 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define PGS_BLS12383 MODBYTES_B384_58  /**< MPIN Group Size */
+#define PFS_BLS12383 MODBYTES_B384_58  /**< MPIN Field Size */
+
+#define MPIN_OK             0   /**< Function completed without error */
+#define MPIN_INVALID_POINT  -14	/**< Point is NOT on the curve */
+#define MPIN_BAD_PIN        -19 /**< Bad PIN number entered */
+
+#define MAXPIN 10000         /**< max PIN */
+#define PBLEN 14             /**< max length of PIN in bits */
+
+//#define PAS_BLS12383 16        /**< MPIN Symmetric Key Size 128 bits */
+//#define HASH_TYPE_MPIN_BLS12383 SHA256   /**< Choose Hash function */
+
+/* MPIN support functions */
+
+/* MPIN primitives */
+
+/**	@brief Encode a string to a curve point (in constant time)
+ *
+	@param DST is the Domain Separation Tag
+    @param ID is the input string
+    @param HID is the output point in G1
+*/
+void MPIN_ENCODE_TO_CURVE(octet *DST,octet *ID,octet *HID);
+
+/**	@brief Extract a PIN number from a client secret
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param pin is an input PIN number
+	@param CS is the client secret from which the PIN is to be extracted
+	@return 0 or an error code
+ */
+int MPIN_EXTRACT_PIN(octet *HID, int pin, octet *CS);
+
+/**	@brief Perform first pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param R is a pointer to a cryptographically secure random number generator
+	@param x an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param pin is the input PIN number
+	@param T is the input M-Pin token (the client secret with PIN portion removed)
+	@param S is the reconstructed client secret
+	@param U is output = x.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_1(octet *HID, csprng *R, octet *x, int pin, octet *T, octet *S, octet *U);
+/**	@brief Generate a random group element
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param S is the output random octet
+	@return 0 or an error code
+ */
+int MPIN_RANDOM_GENERATE(csprng *R, octet *S);
+/**	@brief Perform second pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param x an input, a locally generated random number
+	@param y an input random challenge from the server
+	@param V on output = -(x+y).V
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_2(octet *x, octet *y, octet *V);
+
+/**	@brief Perform final pass on the server side of the M-Pin protocol
+
+	@param HID is input H(ID), a hash of the client ID
+	@param y is the input server's randomly generated challenge
+	@param SS is the input server secret
+	@param U is input from the client = x.H(ID)
+	@param V is an input from the client
+	@return 0 or an error code
+ */
+int MPIN_SERVER(octet *HID, octet *y, octet *SS, octet *U, octet *V);
+
+/**	@brief Create a client secret in G1 from a master secret and the client ID
+ *
+	@param S is an input master secret
+	@param HID is the input client identity hashed to curve
+	@param CS is the full client secret = s.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_GET_CLIENT_SECRET(octet *S, octet *HID, octet *CS);
+
+/**	@brief Create a server secret in G2 from a master secret
+ *
+	@param S is an input master secret
+	@param SS is the server secret = s.Q where Q is a fixed generator of G2
+	@return 0 or an error code
+ */
+int MPIN_GET_SERVER_SECRET(octet *S, octet *SS);
+}
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/mpin_BLS12443.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/mpin_BLS12443.h
new file mode 100644
index 0000000..c857955
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/mpin_BLS12443.h
@@ -0,0 +1,136 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file mpin.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief M-Pin Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef MPIN_BLS12443_H
+#define MPIN_BLS12443_H
+
+#include "pair_BLS12443.h"
+//#include "pbc_support.h"
+
+using namespace core;
+
+
+namespace BLS12443 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define PGS_BLS12443 MODBYTES_B448_60  /**< MPIN Group Size */
+#define PFS_BLS12443 MODBYTES_B448_60  /**< MPIN Field Size */
+
+#define MPIN_OK             0   /**< Function completed without error */
+#define MPIN_INVALID_POINT  -14	/**< Point is NOT on the curve */
+#define MPIN_BAD_PIN        -19 /**< Bad PIN number entered */
+
+#define MAXPIN 10000         /**< max PIN */
+#define PBLEN 14             /**< max length of PIN in bits */
+
+//#define PAS_BLS12443 16        /**< MPIN Symmetric Key Size 128 bits */
+//#define HASH_TYPE_MPIN_BLS12443 SHA256   /**< Choose Hash function */
+
+/* MPIN support functions */
+
+/* MPIN primitives */
+
+/**	@brief Encode a string to a curve point (in constant time)
+ *
+	@param DST is the Domain Separation Tag
+    @param ID is the input string
+    @param HID is the output point in G1
+*/
+void MPIN_ENCODE_TO_CURVE(octet *DST,octet *ID,octet *HID);
+
+/**	@brief Extract a PIN number from a client secret
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param pin is an input PIN number
+	@param CS is the client secret from which the PIN is to be extracted
+	@return 0 or an error code
+ */
+int MPIN_EXTRACT_PIN(octet *HID, int pin, octet *CS);
+
+/**	@brief Perform first pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param R is a pointer to a cryptographically secure random number generator
+	@param x an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param pin is the input PIN number
+	@param T is the input M-Pin token (the client secret with PIN portion removed)
+	@param S is the reconstructed client secret
+	@param U is output = x.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_1(octet *HID, csprng *R, octet *x, int pin, octet *T, octet *S, octet *U);
+/**	@brief Generate a random group element
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param S is the output random octet
+	@return 0 or an error code
+ */
+int MPIN_RANDOM_GENERATE(csprng *R, octet *S);
+/**	@brief Perform second pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param x an input, a locally generated random number
+	@param y an input random challenge from the server
+	@param V on output = -(x+y).V
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_2(octet *x, octet *y, octet *V);
+
+/**	@brief Perform final pass on the server side of the M-Pin protocol
+
+	@param HID is input H(ID), a hash of the client ID
+	@param y is the input server's randomly generated challenge
+	@param SS is the input server secret
+	@param U is input from the client = x.H(ID)
+	@param V is an input from the client
+	@return 0 or an error code
+ */
+int MPIN_SERVER(octet *HID, octet *y, octet *SS, octet *U, octet *V);
+
+/**	@brief Create a client secret in G1 from a master secret and the client ID
+ *
+	@param S is an input master secret
+	@param HID is the input client identity hashed to curve
+	@param CS is the full client secret = s.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_GET_CLIENT_SECRET(octet *S, octet *HID, octet *CS);
+
+/**	@brief Create a server secret in G2 from a master secret
+ *
+	@param S is an input master secret
+	@param SS is the server secret = s.Q where Q is a fixed generator of G2
+	@return 0 or an error code
+ */
+int MPIN_GET_SERVER_SECRET(octet *S, octet *SS);
+}
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/mpin_BLS12461.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/mpin_BLS12461.h
new file mode 100644
index 0000000..8491e09
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/mpin_BLS12461.h
@@ -0,0 +1,136 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file mpin.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief M-Pin Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef MPIN_BLS12461_H
+#define MPIN_BLS12461_H
+
+#include "pair_BLS12461.h"
+//#include "pbc_support.h"
+
+using namespace core;
+
+
+namespace BLS12461 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define PGS_BLS12461 MODBYTES_B464_60  /**< MPIN Group Size */
+#define PFS_BLS12461 MODBYTES_B464_60  /**< MPIN Field Size */
+
+#define MPIN_OK             0   /**< Function completed without error */
+#define MPIN_INVALID_POINT  -14	/**< Point is NOT on the curve */
+#define MPIN_BAD_PIN        -19 /**< Bad PIN number entered */
+
+#define MAXPIN 10000         /**< max PIN */
+#define PBLEN 14             /**< max length of PIN in bits */
+
+//#define PAS_BLS12461 16        /**< MPIN Symmetric Key Size 128 bits */
+//#define HASH_TYPE_MPIN_BLS12461 SHA256   /**< Choose Hash function */
+
+/* MPIN support functions */
+
+/* MPIN primitives */
+
+/**	@brief Encode a string to a curve point (in constant time)
+ *
+	@param DST is the Domain Separation Tag
+    @param ID is the input string
+    @param HID is the output point in G1
+*/
+void MPIN_ENCODE_TO_CURVE(octet *DST,octet *ID,octet *HID);
+
+/**	@brief Extract a PIN number from a client secret
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param pin is an input PIN number
+	@param CS is the client secret from which the PIN is to be extracted
+	@return 0 or an error code
+ */
+int MPIN_EXTRACT_PIN(octet *HID, int pin, octet *CS);
+
+/**	@brief Perform first pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param R is a pointer to a cryptographically secure random number generator
+	@param x an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param pin is the input PIN number
+	@param T is the input M-Pin token (the client secret with PIN portion removed)
+	@param S is the reconstructed client secret
+	@param U is output = x.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_1(octet *HID, csprng *R, octet *x, int pin, octet *T, octet *S, octet *U);
+/**	@brief Generate a random group element
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param S is the output random octet
+	@return 0 or an error code
+ */
+int MPIN_RANDOM_GENERATE(csprng *R, octet *S);
+/**	@brief Perform second pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param x an input, a locally generated random number
+	@param y an input random challenge from the server
+	@param V on output = -(x+y).V
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_2(octet *x, octet *y, octet *V);
+
+/**	@brief Perform final pass on the server side of the M-Pin protocol
+
+	@param HID is input H(ID), a hash of the client ID
+	@param y is the input server's randomly generated challenge
+	@param SS is the input server secret
+	@param U is input from the client = x.H(ID)
+	@param V is an input from the client
+	@return 0 or an error code
+ */
+int MPIN_SERVER(octet *HID, octet *y, octet *SS, octet *U, octet *V);
+
+/**	@brief Create a client secret in G1 from a master secret and the client ID
+ *
+	@param S is an input master secret
+	@param HID is the input client identity hashed to curve
+	@param CS is the full client secret = s.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_GET_CLIENT_SECRET(octet *S, octet *HID, octet *CS);
+
+/**	@brief Create a server secret in G2 from a master secret
+ *
+	@param S is an input master secret
+	@param SS is the server secret = s.Q where Q is a fixed generator of G2
+	@return 0 or an error code
+ */
+int MPIN_GET_SERVER_SECRET(octet *S, octet *SS);
+}
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/mpin_BN158.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/mpin_BN158.h
new file mode 100644
index 0000000..e10f187
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/mpin_BN158.h
@@ -0,0 +1,136 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file mpin.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief M-Pin Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef MPIN_BN158_H
+#define MPIN_BN158_H
+
+#include "pair_BN158.h"
+//#include "pbc_support.h"
+
+using namespace core;
+
+
+namespace BN158 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define PGS_BN158 MODBYTES_B160_56  /**< MPIN Group Size */
+#define PFS_BN158 MODBYTES_B160_56  /**< MPIN Field Size */
+
+#define MPIN_OK             0   /**< Function completed without error */
+#define MPIN_INVALID_POINT  -14	/**< Point is NOT on the curve */
+#define MPIN_BAD_PIN        -19 /**< Bad PIN number entered */
+
+#define MAXPIN 10000         /**< max PIN */
+#define PBLEN 14             /**< max length of PIN in bits */
+
+//#define PAS_BN158 16        /**< MPIN Symmetric Key Size 128 bits */
+//#define HASH_TYPE_MPIN_BN158 SHA256   /**< Choose Hash function */
+
+/* MPIN support functions */
+
+/* MPIN primitives */
+
+/**	@brief Encode a string to a curve point (in constant time)
+ *
+	@param DST is the Domain Separation Tag
+    @param ID is the input string
+    @param HID is the output point in G1
+*/
+void MPIN_ENCODE_TO_CURVE(octet *DST,octet *ID,octet *HID);
+
+/**	@brief Extract a PIN number from a client secret
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param pin is an input PIN number
+	@param CS is the client secret from which the PIN is to be extracted
+	@return 0 or an error code
+ */
+int MPIN_EXTRACT_PIN(octet *HID, int pin, octet *CS);
+
+/**	@brief Perform first pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param R is a pointer to a cryptographically secure random number generator
+	@param x an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param pin is the input PIN number
+	@param T is the input M-Pin token (the client secret with PIN portion removed)
+	@param S is the reconstructed client secret
+	@param U is output = x.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_1(octet *HID, csprng *R, octet *x, int pin, octet *T, octet *S, octet *U);
+/**	@brief Generate a random group element
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param S is the output random octet
+	@return 0 or an error code
+ */
+int MPIN_RANDOM_GENERATE(csprng *R, octet *S);
+/**	@brief Perform second pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param x an input, a locally generated random number
+	@param y an input random challenge from the server
+	@param V on output = -(x+y).V
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_2(octet *x, octet *y, octet *V);
+
+/**	@brief Perform final pass on the server side of the M-Pin protocol
+
+	@param HID is input H(ID), a hash of the client ID
+	@param y is the input server's randomly generated challenge
+	@param SS is the input server secret
+	@param U is input from the client = x.H(ID)
+	@param V is an input from the client
+	@return 0 or an error code
+ */
+int MPIN_SERVER(octet *HID, octet *y, octet *SS, octet *U, octet *V);
+
+/**	@brief Create a client secret in G1 from a master secret and the client ID
+ *
+	@param S is an input master secret
+	@param HID is the input client identity hashed to curve
+	@param CS is the full client secret = s.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_GET_CLIENT_SECRET(octet *S, octet *HID, octet *CS);
+
+/**	@brief Create a server secret in G2 from a master secret
+ *
+	@param S is an input master secret
+	@param SS is the server secret = s.Q where Q is a fixed generator of G2
+	@return 0 or an error code
+ */
+int MPIN_GET_SERVER_SECRET(octet *S, octet *SS);
+}
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/mpin_BN254.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/mpin_BN254.h
new file mode 100644
index 0000000..df3682a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/mpin_BN254.h
@@ -0,0 +1,136 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file mpin.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief M-Pin Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef MPIN_BN254_H
+#define MPIN_BN254_H
+
+#include "pair_BN254.h"
+//#include "pbc_support.h"
+
+using namespace core;
+
+
+namespace BN254 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define PGS_BN254 MODBYTES_B256_56  /**< MPIN Group Size */
+#define PFS_BN254 MODBYTES_B256_56  /**< MPIN Field Size */
+
+#define MPIN_OK             0   /**< Function completed without error */
+#define MPIN_INVALID_POINT  -14	/**< Point is NOT on the curve */
+#define MPIN_BAD_PIN        -19 /**< Bad PIN number entered */
+
+#define MAXPIN 10000         /**< max PIN */
+#define PBLEN 14             /**< max length of PIN in bits */
+
+//#define PAS_BN254 16        /**< MPIN Symmetric Key Size 128 bits */
+//#define HASH_TYPE_MPIN_BN254 SHA256   /**< Choose Hash function */
+
+/* MPIN support functions */
+
+/* MPIN primitives */
+
+/**	@brief Encode a string to a curve point (in constant time)
+ *
+	@param DST is the Domain Separation Tag
+    @param ID is the input string
+    @param HID is the output point in G1
+*/
+void MPIN_ENCODE_TO_CURVE(octet *DST,octet *ID,octet *HID);
+
+/**	@brief Extract a PIN number from a client secret
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param pin is an input PIN number
+	@param CS is the client secret from which the PIN is to be extracted
+	@return 0 or an error code
+ */
+int MPIN_EXTRACT_PIN(octet *HID, int pin, octet *CS);
+
+/**	@brief Perform first pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param R is a pointer to a cryptographically secure random number generator
+	@param x an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param pin is the input PIN number
+	@param T is the input M-Pin token (the client secret with PIN portion removed)
+	@param S is the reconstructed client secret
+	@param U is output = x.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_1(octet *HID, csprng *R, octet *x, int pin, octet *T, octet *S, octet *U);
+/**	@brief Generate a random group element
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param S is the output random octet
+	@return 0 or an error code
+ */
+int MPIN_RANDOM_GENERATE(csprng *R, octet *S);
+/**	@brief Perform second pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param x an input, a locally generated random number
+	@param y an input random challenge from the server
+	@param V on output = -(x+y).V
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_2(octet *x, octet *y, octet *V);
+
+/**	@brief Perform final pass on the server side of the M-Pin protocol
+
+	@param HID is input H(ID), a hash of the client ID
+	@param y is the input server's randomly generated challenge
+	@param SS is the input server secret
+	@param U is input from the client = x.H(ID)
+	@param V is an input from the client
+	@return 0 or an error code
+ */
+int MPIN_SERVER(octet *HID, octet *y, octet *SS, octet *U, octet *V);
+
+/**	@brief Create a client secret in G1 from a master secret and the client ID
+ *
+	@param S is an input master secret
+	@param HID is the input client identity hashed to curve
+	@param CS is the full client secret = s.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_GET_CLIENT_SECRET(octet *S, octet *HID, octet *CS);
+
+/**	@brief Create a server secret in G2 from a master secret
+ *
+	@param S is an input master secret
+	@param SS is the server secret = s.Q where Q is a fixed generator of G2
+	@return 0 or an error code
+ */
+int MPIN_GET_SERVER_SECRET(octet *S, octet *SS);
+}
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/mpin_BN254CX.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/mpin_BN254CX.h
new file mode 100644
index 0000000..0418b17
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/mpin_BN254CX.h
@@ -0,0 +1,136 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file mpin.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief M-Pin Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef MPIN_BN254CX_H
+#define MPIN_BN254CX_H
+
+#include "pair_BN254CX.h"
+//#include "pbc_support.h"
+
+using namespace core;
+
+
+namespace BN254CX {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define PGS_BN254CX MODBYTES_B256_56  /**< MPIN Group Size */
+#define PFS_BN254CX MODBYTES_B256_56  /**< MPIN Field Size */
+
+#define MPIN_OK             0   /**< Function completed without error */
+#define MPIN_INVALID_POINT  -14	/**< Point is NOT on the curve */
+#define MPIN_BAD_PIN        -19 /**< Bad PIN number entered */
+
+#define MAXPIN 10000         /**< max PIN */
+#define PBLEN 14             /**< max length of PIN in bits */
+
+//#define PAS_BN254CX 16        /**< MPIN Symmetric Key Size 128 bits */
+//#define HASH_TYPE_MPIN_BN254CX SHA256   /**< Choose Hash function */
+
+/* MPIN support functions */
+
+/* MPIN primitives */
+
+/**	@brief Encode a string to a curve point (in constant time)
+ *
+	@param DST is the Domain Separation Tag
+    @param ID is the input string
+    @param HID is the output point in G1
+*/
+void MPIN_ENCODE_TO_CURVE(octet *DST,octet *ID,octet *HID);
+
+/**	@brief Extract a PIN number from a client secret
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param pin is an input PIN number
+	@param CS is the client secret from which the PIN is to be extracted
+	@return 0 or an error code
+ */
+int MPIN_EXTRACT_PIN(octet *HID, int pin, octet *CS);
+
+/**	@brief Perform first pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param R is a pointer to a cryptographically secure random number generator
+	@param x an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param pin is the input PIN number
+	@param T is the input M-Pin token (the client secret with PIN portion removed)
+	@param S is the reconstructed client secret
+	@param U is output = x.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_1(octet *HID, csprng *R, octet *x, int pin, octet *T, octet *S, octet *U);
+/**	@brief Generate a random group element
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param S is the output random octet
+	@return 0 or an error code
+ */
+int MPIN_RANDOM_GENERATE(csprng *R, octet *S);
+/**	@brief Perform second pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param x an input, a locally generated random number
+	@param y an input random challenge from the server
+	@param V on output = -(x+y).V
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_2(octet *x, octet *y, octet *V);
+
+/**	@brief Perform final pass on the server side of the M-Pin protocol
+
+	@param HID is input H(ID), a hash of the client ID
+	@param y is the input server's randomly generated challenge
+	@param SS is the input server secret
+	@param U is input from the client = x.H(ID)
+	@param V is an input from the client
+	@return 0 or an error code
+ */
+int MPIN_SERVER(octet *HID, octet *y, octet *SS, octet *U, octet *V);
+
+/**	@brief Create a client secret in G1 from a master secret and the client ID
+ *
+	@param S is an input master secret
+	@param HID is the input client identity hashed to curve
+	@param CS is the full client secret = s.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_GET_CLIENT_SECRET(octet *S, octet *HID, octet *CS);
+
+/**	@brief Create a server secret in G2 from a master secret
+ *
+	@param S is an input master secret
+	@param SS is the server secret = s.Q where Q is a fixed generator of G2
+	@return 0 or an error code
+ */
+int MPIN_GET_SERVER_SECRET(octet *S, octet *SS);
+}
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/mpin_BN462.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/mpin_BN462.h
new file mode 100644
index 0000000..ae70918
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/mpin_BN462.h
@@ -0,0 +1,136 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file mpin.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief M-Pin Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef MPIN_BN462_H
+#define MPIN_BN462_H
+
+#include "pair_BN462.h"
+//#include "pbc_support.h"
+
+using namespace core;
+
+
+namespace BN462 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define PGS_BN462 MODBYTES_B464_60  /**< MPIN Group Size */
+#define PFS_BN462 MODBYTES_B464_60  /**< MPIN Field Size */
+
+#define MPIN_OK             0   /**< Function completed without error */
+#define MPIN_INVALID_POINT  -14	/**< Point is NOT on the curve */
+#define MPIN_BAD_PIN        -19 /**< Bad PIN number entered */
+
+#define MAXPIN 10000         /**< max PIN */
+#define PBLEN 14             /**< max length of PIN in bits */
+
+//#define PAS_BN462 16        /**< MPIN Symmetric Key Size 128 bits */
+//#define HASH_TYPE_MPIN_BN462 SHA256   /**< Choose Hash function */
+
+/* MPIN support functions */
+
+/* MPIN primitives */
+
+/**	@brief Encode a string to a curve point (in constant time)
+ *
+	@param DST is the Domain Separation Tag
+    @param ID is the input string
+    @param HID is the output point in G1
+*/
+void MPIN_ENCODE_TO_CURVE(octet *DST,octet *ID,octet *HID);
+
+/**	@brief Extract a PIN number from a client secret
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param pin is an input PIN number
+	@param CS is the client secret from which the PIN is to be extracted
+	@return 0 or an error code
+ */
+int MPIN_EXTRACT_PIN(octet *HID, int pin, octet *CS);
+
+/**	@brief Perform first pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param R is a pointer to a cryptographically secure random number generator
+	@param x an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param pin is the input PIN number
+	@param T is the input M-Pin token (the client secret with PIN portion removed)
+	@param S is the reconstructed client secret
+	@param U is output = x.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_1(octet *HID, csprng *R, octet *x, int pin, octet *T, octet *S, octet *U);
+/**	@brief Generate a random group element
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param S is the output random octet
+	@return 0 or an error code
+ */
+int MPIN_RANDOM_GENERATE(csprng *R, octet *S);
+/**	@brief Perform second pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param x an input, a locally generated random number
+	@param y an input random challenge from the server
+	@param V on output = -(x+y).V
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_2(octet *x, octet *y, octet *V);
+
+/**	@brief Perform final pass on the server side of the M-Pin protocol
+
+	@param HID is input H(ID), a hash of the client ID
+	@param y is the input server's randomly generated challenge
+	@param SS is the input server secret
+	@param U is input from the client = x.H(ID)
+	@param V is an input from the client
+	@return 0 or an error code
+ */
+int MPIN_SERVER(octet *HID, octet *y, octet *SS, octet *U, octet *V);
+
+/**	@brief Create a client secret in G1 from a master secret and the client ID
+ *
+	@param S is an input master secret
+	@param HID is the input client identity hashed to curve
+	@param CS is the full client secret = s.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_GET_CLIENT_SECRET(octet *S, octet *HID, octet *CS);
+
+/**	@brief Create a server secret in G2 from a master secret
+ *
+	@param S is an input master secret
+	@param SS is the server secret = s.Q where Q is a fixed generator of G2
+	@return 0 or an error code
+ */
+int MPIN_GET_SERVER_SECRET(octet *S, octet *SS);
+}
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/mpin_FP256BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/mpin_FP256BN.h
new file mode 100644
index 0000000..19a4d81
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/mpin_FP256BN.h
@@ -0,0 +1,136 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file mpin.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief M-Pin Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef MPIN_FP256BN_H
+#define MPIN_FP256BN_H
+
+#include "pair_FP256BN.h"
+//#include "pbc_support.h"
+
+using namespace core;
+
+
+namespace FP256BN {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define PGS_FP256BN MODBYTES_B256_56  /**< MPIN Group Size */
+#define PFS_FP256BN MODBYTES_B256_56  /**< MPIN Field Size */
+
+#define MPIN_OK             0   /**< Function completed without error */
+#define MPIN_INVALID_POINT  -14	/**< Point is NOT on the curve */
+#define MPIN_BAD_PIN        -19 /**< Bad PIN number entered */
+
+#define MAXPIN 10000         /**< max PIN */
+#define PBLEN 14             /**< max length of PIN in bits */
+
+//#define PAS_FP256BN 16        /**< MPIN Symmetric Key Size 128 bits */
+//#define HASH_TYPE_MPIN_FP256BN SHA256   /**< Choose Hash function */
+
+/* MPIN support functions */
+
+/* MPIN primitives */
+
+/**	@brief Encode a string to a curve point (in constant time)
+ *
+	@param DST is the Domain Separation Tag
+    @param ID is the input string
+    @param HID is the output point in G1
+*/
+void MPIN_ENCODE_TO_CURVE(octet *DST,octet *ID,octet *HID);
+
+/**	@brief Extract a PIN number from a client secret
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param pin is an input PIN number
+	@param CS is the client secret from which the PIN is to be extracted
+	@return 0 or an error code
+ */
+int MPIN_EXTRACT_PIN(octet *HID, int pin, octet *CS);
+
+/**	@brief Perform first pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param R is a pointer to a cryptographically secure random number generator
+	@param x an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param pin is the input PIN number
+	@param T is the input M-Pin token (the client secret with PIN portion removed)
+	@param S is the reconstructed client secret
+	@param U is output = x.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_1(octet *HID, csprng *R, octet *x, int pin, octet *T, octet *S, octet *U);
+/**	@brief Generate a random group element
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param S is the output random octet
+	@return 0 or an error code
+ */
+int MPIN_RANDOM_GENERATE(csprng *R, octet *S);
+/**	@brief Perform second pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param x an input, a locally generated random number
+	@param y an input random challenge from the server
+	@param V on output = -(x+y).V
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_2(octet *x, octet *y, octet *V);
+
+/**	@brief Perform final pass on the server side of the M-Pin protocol
+
+	@param HID is input H(ID), a hash of the client ID
+	@param y is the input server's randomly generated challenge
+	@param SS is the input server secret
+	@param U is input from the client = x.H(ID)
+	@param V is an input from the client
+	@return 0 or an error code
+ */
+int MPIN_SERVER(octet *HID, octet *y, octet *SS, octet *U, octet *V);
+
+/**	@brief Create a client secret in G1 from a master secret and the client ID
+ *
+	@param S is an input master secret
+	@param HID is the input client identity hashed to curve
+	@param CS is the full client secret = s.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_GET_CLIENT_SECRET(octet *S, octet *HID, octet *CS);
+
+/**	@brief Create a server secret in G2 from a master secret
+ *
+	@param S is an input master secret
+	@param SS is the server secret = s.Q where Q is a fixed generator of G2
+	@return 0 or an error code
+ */
+int MPIN_GET_SERVER_SECRET(octet *S, octet *SS);
+}
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/mpin_FP512BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/mpin_FP512BN.h
new file mode 100644
index 0000000..f21ac4c
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/mpin_FP512BN.h
@@ -0,0 +1,136 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file mpin.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief M-Pin Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef MPIN_FP512BN_H
+#define MPIN_FP512BN_H
+
+#include "pair_FP512BN.h"
+//#include "pbc_support.h"
+
+using namespace core;
+
+
+namespace FP512BN {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define PGS_FP512BN MODBYTES_B512_60  /**< MPIN Group Size */
+#define PFS_FP512BN MODBYTES_B512_60  /**< MPIN Field Size */
+
+#define MPIN_OK             0   /**< Function completed without error */
+#define MPIN_INVALID_POINT  -14	/**< Point is NOT on the curve */
+#define MPIN_BAD_PIN        -19 /**< Bad PIN number entered */
+
+#define MAXPIN 10000         /**< max PIN */
+#define PBLEN 14             /**< max length of PIN in bits */
+
+//#define PAS_FP512BN 16        /**< MPIN Symmetric Key Size 128 bits */
+//#define HASH_TYPE_MPIN_FP512BN SHA256   /**< Choose Hash function */
+
+/* MPIN support functions */
+
+/* MPIN primitives */
+
+/**	@brief Encode a string to a curve point (in constant time)
+ *
+	@param DST is the Domain Separation Tag
+    @param ID is the input string
+    @param HID is the output point in G1
+*/
+void MPIN_ENCODE_TO_CURVE(octet *DST,octet *ID,octet *HID);
+
+/**	@brief Extract a PIN number from a client secret
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param pin is an input PIN number
+	@param CS is the client secret from which the PIN is to be extracted
+	@return 0 or an error code
+ */
+int MPIN_EXTRACT_PIN(octet *HID, int pin, octet *CS);
+
+/**	@brief Perform first pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param R is a pointer to a cryptographically secure random number generator
+	@param x an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param pin is the input PIN number
+	@param T is the input M-Pin token (the client secret with PIN portion removed)
+	@param S is the reconstructed client secret
+	@param U is output = x.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_1(octet *HID, csprng *R, octet *x, int pin, octet *T, octet *S, octet *U);
+/**	@brief Generate a random group element
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param S is the output random octet
+	@return 0 or an error code
+ */
+int MPIN_RANDOM_GENERATE(csprng *R, octet *S);
+/**	@brief Perform second pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param x an input, a locally generated random number
+	@param y an input random challenge from the server
+	@param V on output = -(x+y).V
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_2(octet *x, octet *y, octet *V);
+
+/**	@brief Perform final pass on the server side of the M-Pin protocol
+
+	@param HID is input H(ID), a hash of the client ID
+	@param y is the input server's randomly generated challenge
+	@param SS is the input server secret
+	@param U is input from the client = x.H(ID)
+	@param V is an input from the client
+	@return 0 or an error code
+ */
+int MPIN_SERVER(octet *HID, octet *y, octet *SS, octet *U, octet *V);
+
+/**	@brief Create a client secret in G1 from a master secret and the client ID
+ *
+	@param S is an input master secret
+	@param HID is the input client identity hashed to curve
+	@param CS is the full client secret = s.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_GET_CLIENT_SECRET(octet *S, octet *HID, octet *CS);
+
+/**	@brief Create a server secret in G2 from a master secret
+ *
+	@param S is an input master secret
+	@param SS is the server secret = s.Q where Q is a fixed generator of G2
+	@return 0 or an error code
+ */
+int MPIN_GET_SERVER_SECRET(octet *S, octet *SS);
+}
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/newhope.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/newhope.cpp
new file mode 100644
index 0000000..b3b4c4c
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/newhope.cpp
@@ -0,0 +1,517 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* NewHope API implementation. Constant time.
+
+    LOOK - no if statements!
+
+   M.Scott 21/07/2017
+*/
+
+#include "newhope.h"
+
+using namespace core;
+
+const sign16 roots[] = {0x2ac8, 0x2baf, 0x299b, 0x685, 0x2f04, 0x158d, 0x2d49, 0x24b5, 0x1edc, 0xab3, 0x2a95, 0x24d, 0x3cb, 0x6a8, 0x12f9, 0x15ba, 0x1861, 0x2a89, 0x1c5c, 0xbe6, 0xc1e, 0x2024, 0x207, 0x19ce, 0x2710, 0x1744, 0x18bc, 0x2cd7, 0x396, 0x18d5, 0x1c45, 0xc4, 0x21a6, 0xe03, 0x2b3c, 0x2d91, 0xc5d, 0x432, 0x1fbc, 0xcae, 0x2512, 0x2979, 0x3b2, 0x714, 0xb2e, 0x1a97, 0x1a03, 0x1bcd, 0x2216, 0x2701, 0xa, 0x263c, 0x1179, 0x200c, 0x2d08, 0x1c34, 0x291, 0x2c99, 0x2a5a, 0x723, 0xb1d, 0x1ccc, 0x1fb6, 0x2f58, 0x2bfe, 0x1cda, 0x2a0, 0x5f1, 0x2de, 0x1fc7, 0x1ea8, 0x1719, 0x2fa7, 0x27ec, 0x20ff, 0x12c0, 0x1ac1, 0x2232, 0x2f9b, 0xd3e, 0x2aed, 0x15f0, 0x11e8, 0xed0, 0x26a, 0x1de5, 0xa3f, 0xf43, 0xebf, 0x204e, 0xac7, 0x2d9c, 0x5ea, 0x25d1, 0xb6, 0x49c, 0x995, 0x2555, 0x26e2, 0x100, 0x1878, 0x5aa, 0x2e10, 0x271c, 0xcb, 0x1b4c, 0x2fb8, 0x25b7, 0x1543, 0x2c7b, 0x241a, 0x2223, 0x20ca, 0x24ed, 0x137, 0x1b65, 0x1dc2, 0x7c7, 0x2ec3, 0xd0c, 0x1169, 0x1c7a, 0x1ea1, 0xf89, 0x2199, 0x291d, 0x1088, 0x2046, 0x256d, 0x2bc7, 0x2e9b, 0x41f, 0x1b55, 0x2b38, 0xd0, 0x2e6a, 0x1755, 0x6bc, 0x2724, 0x3ba, 0x222e, 0x2c5c, 0x2da5, 0x213c, 0x10fe, 0x169a, 0x1552, 0x5d3, 0x300, 0x1b5d, 0x1342, 0x2004, 0x256f, 0x2039, 0x667, 0x23b5, 0x1123, 0xdb, 0x2da0, 0xe1e, 0x2f54, 0x2767, 0x154a, 0x40a, 0x11d3, 0x2821, 0xc09, 0x974, 0x694, 0xfbf, 0x27ba, 0x132, 0x83f, 0x2d06, 0x10e, 0x183f, 0x29ae, 0x28c3, 0x2dc9, 0x1144, 0x2c70, 0x2a4a, 0xf3c, 0x1e32, 0x1171, 0x1e43, 0xdd4, 0x2ddf, 0x28d2, 0xfac, 0x3c4, 0x2f19, 0x10a6, 0x2f7, 0xe1d, 0x828, 0x138f, 0x1332, 0xfab, 0xcf6, 0x13f8, 0x24a0, 0x112d, 0x2717, 0x6e7, 0x1044, 0x36e, 0xfe8, 0x6a, 0xba7, 0x1d69, 0x29ec, 0x23b2, 0xaee, 0x16df, 0x1068, 0x1a7e, 0x253f, 0x24c, 0xb33, 0x2683, 0x15ce, 0x1ad3, 0x1a36, 0xc96, 0xaea, 0x260a, 0xce, 0x28b1, 0xe4f, 0x2b11, 0x5f8, 0x1fc4, 0xe77, 0x2366, 0x11f9, 0x153c, 0x24eb, 0x20cd, 0x1398, 0x22, 0x2b97, 0x249b, 0x8eb, 0x12b2, 0x2fe3, 0x29c1, 0x1b00, 0x2663, 0xeaa, 0x2e06, 0xe0, 0x1569, 0x10f5, 0x284e, 0xa38, 0x201d, 0x1c53, 0x1681, 0x1f6f, 0x2f95, 0x2fe8, 0xacb, 0x1680, 0x17fd, 0x2c39, 0x165a, 0x10bb, 0x29d8, 0x2622, 0x1196, 0x884, 0x2a79, 0x140e, 0x2d80, 0x6fa, 0x11b2, 0x26c4, 0x355, 0x1054, 0x29e9, 0x23ed, 0xbe3, 0x24fa, 0x1fb3, 0x10ac, 0x2919, 0x2584, 0x10a4, 0xe85, 0x650, 0x1893, 0x1dc1, 0xd8e, 0x12dc, 0x2d42, 0x284d, 0xfff, 0x250f, 0xacd, 0x13c3, 0x6cc, 0x1a79, 0x1221, 0x2614, 0x270a, 0x1ea, 0x155, 0x2818, 0x222c, 0x2e5b, 0x25d8, 0x1dbf, 0x191c, 0xb0f, 0xdac, 0x1082, 0x12ef, 0x11b6, 0xfa8, 0x2b72, 0x159d, 0x209e, 0x31b, 0x2c7c, 0x14f7, 0xe09, 0x1bb2, 0x1ec7, 0x2404, 0x20ae, 0x6ad, 0xed6, 0x2b70, 0x1c7b, 0x18d1, 0x2732, 0x12da, 0xd56, 0x5c1, 0x1648, 0x18b7, 0x1605, 0x1bc4, 0x280, 0x2ece, 0xc, 0x1aae, 0x1c4, 0x1cdb, 0x22d6, 0x21d8, 0x257c, 0x51f, 0x211b, 0xff, 0x2ee0, 0x2585, 0xe1, 0x2c35, 0x26db, 0x2971, 0x2208, 0x17e1, 0x21be, 0x135e, 0x28d6, 0x2891, 0x1689, 0x2138, 0xb86, 0x2e3a, 0x1204, 0x2d10, 0x2324, 0xf3f, 0x2508, 0x33d, 0xcb2, 0x292a, 0xe27, 0x2e64, 0x29f8, 0x2d46, 0x9b7, 0x20eb, 0x1b7c, 0x9eb, 0x2b2a, 0x58c, 0x27d0, 0x121b, 0x272e, 0x29f6, 0x2dbd, 0x2697, 0x2aac, 0xd6f, 0x1c67, 0x2c5b, 0x108d, 0x363, 0x249d, 0x2d5e, 0x2fd, 0x2cb2, 0x1f8f, 0x20a4, 0xa19, 0x2ac9, 0x19b1, 0x1581, 0x17a2, 0x29eb, 0x1b72, 0x13b0, 0xee4, 0xa8f, 0x2315, 0x5e6, 0x951, 0x2e29, 0xdad, 0x1f2b, 0x224e, 0x37f, 0x1a72, 0xa91, 0x1407, 0x2df9, 0x3ad, 0x23f7, 0x1a24, 0x1d2a, 0x234b, 0x1df3, 0x1143, 0x7ff, 0x1a6d, 0x2774, 0x2690, 0x2ab5, 0x586, 0x2781, 0x2009, 0x2fdd, 0x2881, 0x399, 0x2fb6, 0x144, 0x137f, 0xfa0, 0x2e4c, 0x1c7f, 0x2fac, 0xb09, 0x1264, 0x127b, 0x198c, 0x2b40, 0x230, 0x1cf4, 0x180b, 0xb58, 0x144a, 0x2aec, 0xfb, 0x2602, 0x14ee, 0x783, 0x1098, 0x23d8, 0x203, 0xe9, 0x108a, 0x14b8, 0xeec, 0xc58, 0x1248, 0x243c, 0x28aa, 0x6bf, 0x27c4, 0x276e, 0x19b8, 0x1d11, 0x2e16, 0x472, 0x1464, 0x24b9, 0x662, 0x1097, 0x2067, 0x20d6, 0x171c, 0x4, 0x682, 0x17bb, 0x1186, 0x4f2, 0x3ff, 0x2a43, 0x1dc7, 0x1ae5, 0x8cc, 0x2e7c, 0x2ef8, 0x2ae0, 0x2904, 0xed4, 0x6c5, 0x14ae, 0xb72, 0x11c3, 0x337, 0x2da3, 0x2916, 0x6d8, 0x1cf9, 0x10ee, 0x1800, 0x1ae4, 0xa0d, 0x101b, 0x1a8d, 0x2e98, 0x24cd, 0x813, 0x1aa4, 0x9b9, 0x680, 0x2349, 0x24d1, 0x20f8, 0xe31, 0x249f, 0x216b, 0x12d9, 0x1d21, 0x19db, 0x191a, 0x1dd0, 0x5df, 0x55c, 0x2b86, 0x213, 0xe9e, 0x1ef1, 0x268a, 0x1d5e, 0x1e20, 0x28c1, 0x1379, 0x249, 0x19de, 0x18b, 0x1e41, 0x2a1e, 0x2612, 0x297, 0x2e96, 0x2102, 0x46, 0x1b9f, 0x1a4d, 0x2050, 0x1b32, 0x568, 0x11f7, 0x1829, 0x870, 0x1f4, 0x1dca, 0x990, 0x1df6, 0x2b62, 0x13ec, 0x9f2, 0x1260, 0x2997, 0x1412, 0x1e6d, 0x1694, 0x11ac, 0x2d8b, 0x276f, 0x26f5, 0x233e, 0x2b44, 0x2f5a, 0x2d37, 0x2cb1, 0xc75, 0x98d, 0x1d56, 0x7ae, 0x10e6, 0x113f, 0x17b8, 0xad3, 0x737, 0x221e, 0x1b70, 0x1f3e, 0x2966, 0x18b2, 0x4fa, 0x2044, 0x1312, 0x154e, 0x2029, 0x700, 0x1b45, 0x27a6, 0x226a, 0x21bf, 0x58d, 0x2f11, 0x2e02, 0x17fc, 0x4d2, 0x1757, 0xcb1, 0x2ef1, 0x2582, 0x1276, 0x881, 0x2fc0, 0x104a, 0x670, 0x274f, 0x2b53, 0x19dd, 0x752, 0x1663, 0xcbd, 0x2b2b, 0x2fc6, 0x13b6, 0x21e6, 0x15f6, 0x126b, 0x2637, 0x1cd9, 0x2f50, 0xe82, 0x5b0, 0x24e0, 0x1350, 0x2f24, 0x21f7, 0x1a16, 0x2f3e, 0x167e, 0x1f7d, 0x28a0, 0x16f0, 0xe33, 0x53b, 0x28c5, 0x1500, 0x2f88, 0x26cc, 0x2018, 0x1604, 0x218b, 0x2cd1, 0x9ee, 0x17f3, 0x5fd, 0x1f5a, 0x2d0, 0x2b46, 0x23cc, 0x503, 0x1c46, 0x1cc3, 0x28e2, 0x243e, 0x122b, 0x2e0c, 0xe37, 0x2611, 0x85e, 0x9b8, 0x1b24, 0x762, 0x19b6, 0x3bc, 0x2d50, 0x2079, 0x18da, 0x170a, 0x800, 0xaa2, 0x135a, 0x1a15, 0x13d1, 0xca, 0x2113, 0x2db9, 0xdb2, 0x1a5c, 0x29a9, 0x1488, 0x14c1, 0x2c9, 0x917, 0x28e7, 0x265c, 0xdab, 0x2ab9, 0x2bc6, 0x105b, 0x1839, 0x219c, 0x50, 0x11da, 0x1802, 0xf56, 0x2e6, 0x2190, 0xddb, 0x56e, 0x9d9, 0x1c81, 0x1016, 0x12d6, 0x296f, 0x14b4, 0x1014, 0x1e64, 0x1d90, 0x89f, 0x2bc2, 0x2777, 0x2819, 0x1c65, 0x1a41, 0x5a2, 0x2cd2, 0x427, 0xd71, 0x29c8, 0x1e58, 0x53f, 0x7c5, 0x1dcd, 0x4a1, 0x1268, 0x2597, 0x2926, 0xee, 0x111b, 0x1038, 0xe6c, 0x22dc, 0x2f2f, 0x441, 0x2cfd, 0x1cb0, 0x6a4, 0x2224, 0x620, 0x5dc, 0x16b1, 0x2a1d, 0x1787, 0x20c7, 0x641, 0xd84, 0x1c05, 0x2d0d, 0x2f52, 0x1b8c, 0xd7d, 0x17e8, 0x1589, 0xc73, 0x151b, 0x4e2, 0x1ae9, 0x1b18, 0xb9b, 0x949, 0x2c60, 0x1e7a, 0xd5, 0x1bdc, 0x1f57, 0x1753, 0x124a, 0x559, 0xb76, 0x2334, 0x12d1, 0x1de1, 0x14b2, 0x2faa, 0x1697, 0x147a, 0x5a1, 0x2c30, 0x1c02, 0x1043, 0x2ee1, 0x2402, 0x1cc8, 0x2a16, 0xff7, 0x1364, 0x1b9a, 0x2a53, 0x2f94, 0x294c, 0x1ee5, 0x1a87, 0x2141, 0xd66, 0x953, 0x28a3, 0x2f30, 0x2477, 0x18e3, 0x1035, 0x1fc1, 0x1d68, 0x2fb3, 0x138c, 0x2487, 0x1bf8, 0xd96, 0x1018, 0x748, 0x244e, 0x15bd, 0x175e, 0x2be, 0x23d, 0x1da, 0x176d, 0xc17, 0x24be, 0x2ebb, 0x7d8, 0x100a, 0x759, 0x1db4, 0x2259, 0x23f4, 0x2d59, 0x2847, 0xbf5, 0x1cfe, 0xa20, 0x258, 0x1180, 0x279c, 0x54, 0x2abf, 0xc5c, 0x9f9, 0x3d5, 0x2ce4, 0x165f, 0x23d9, 0x27b9, 0x6f9, 0x281a, 0x169e, 0x627, 0x156d, 0x1ff8, 0x211, 0x2e34, 0x1724, 0x2c2e, 0x2790, 0x2dd5, 0x2bf2, 0xdbc, 0x2884, 0x20a9, 0x2390, 0x1e1a, 0x1b6a, 0x5f7, 0xab7, 0x1333, 0x16ab, 0x28dd, 0x20, 0x30f, 0x24b6, 0x5c2, 0x1ce4, 0x1400, 0x2669, 0x60, 0x156c, 0xe20, 0x26d4, 0x26ab, 0x1ebb, 0x223d, 0x5b4, 0x2025, 0x1e1c, 0xaae, 0x2e08, 0x6cd, 0x1677, 0x13d9, 0x17b5, 0x1046, 0x1d8c, 0x14eb, 0x18d8, 0x1ce5, 0x2478, 0x16ae, 0xb79, 0x23d4, 0x684, 0x156b, 0x567, 0x1a, 0x29ce, 0x83a, 0x19e8, 0x58e, 0x294a, 0x1136, 0x2319, 0x2fba, 0x1a29, 0x1d, 0x1879, 0x291b, 0x19f6, 0x2c2f, 0x21c9, 0x19bb, 0xbbc, 0x26f9, 0xc22, 0x708, 0x11a1, 0x18d3, 0x7f8, 0x28f8, 0x2427, 0x1deb, 0xaed, 0x26aa, 0x2482, 0x203b, 0x2f05, 0x2b82, 0x192f, 0x2df4, 0x8dc, 0x2877, 0xd5e, 0x240e, 0x775, 0x2dae, 0x1d3e, 0x20ba, 0x215b, 0x22d1, 0xeba, 0xf50, 0xaa8, 0x184a, 0x1f67, 0x2e04, 0xc6e, 0x6dd, 0x1a09, 0x27f, 0x494, 0x1426, 0xae3, 0xe15, 0x65f, 0x13c4, 0x105, 0x872, 0x2667, 0x1ff6, 0xd9f, 0x2ca1, 0x2f39, 0x2657, 0x23fd, 0x2405, 0xb73, 0x2294, 0x1f1e, 0x2eba, 0x110a, 0x2cae, 0x141f, 0x22cd, 0x25d6, 0x11c1, 0x1c, 0x2d8e, 0x161a, 0x1aa8, 0x229e, 0x1bf9, 0x7cf, 0x106d, 0x2c40, 0xd93, 0x255e, 0x28c2, 0xc1a, 0x2f17, 0x7ca, 0x2f63, 0xbf};
+const sign16 iroots[] = {0x2ac8, 0x452, 0x297c, 0x666, 0xb4c, 0x2b8, 0x1a74, 0xfd, 0x1a47, 0x1d08, 0x2959, 0x2c36, 0x2db4, 0x56c, 0x254e, 0x1125, 0x2f3d, 0x13bc, 0x172c, 0x2c6b, 0x32a, 0x1745, 0x18bd, 0x8f1, 0x1633, 0x2dfa, 0xfdd, 0x23e3, 0x241b, 0x13a5, 0x578, 0x17a0, 0xa9, 0x104b, 0x1335, 0x24e4, 0x28de, 0x5a7, 0x368, 0x2d70, 0x13cd, 0x2f9, 0xff5, 0x1e88, 0x9c5, 0x2ff7, 0x900, 0xdeb, 0x1434, 0x15fe, 0x156a, 0x24d3, 0x28ed, 0x2c4f, 0x688, 0xaef, 0x2353, 0x1045, 0x2bcf, 0x23a4, 0x270, 0x4c5, 0x21fe, 0xe5b, 0xfbb, 0x1f79, 0x6e4, 0xe68, 0x2078, 0x1160, 0x1387, 0x1e98, 0x22f5, 0x13e, 0x283a, 0x123f, 0x149c, 0x2eca, 0xb14, 0xf37, 0xdde, 0xbe7, 0x386, 0x1abe, 0xa4a, 0x49, 0x14b5, 0x2f36, 0x8e5, 0x1f1, 0x2a57, 0x1789, 0x2f01, 0x91f, 0xaac, 0x266c, 0x2b65, 0x2f4b, 0xa30, 0x2a17, 0x265, 0x253a, 0xfb3, 0x2142, 0x20be, 0x25c2, 0x121c, 0x2d97, 0x2131, 0x1e19, 0x1a11, 0x514, 0x22c3, 0x66, 0xdcf, 0x1540, 0x1d41, 0xf02, 0x815, 0x5a, 0x18e8, 0x1159, 0x103a, 0x2d23, 0x2a10, 0x2d61, 0x1327, 0x403, 0x25c9, 0x7b3, 0x1f0c, 0x1a98, 0x2f21, 0x1fb, 0x2157, 0x99e, 0x1501, 0x640, 0x1e, 0x1d4f, 0x2716, 0xb66, 0x46a, 0x2fdf, 0x1c69, 0xf34, 0xb16, 0x1ac5, 0x1e08, 0xc9b, 0x218a, 0x103d, 0x2a09, 0x4f0, 0x21b2, 0x750, 0x2f33, 0x9f7, 0x2517, 0x236b, 0x15cb, 0x152e, 0x1a33, 0x97e, 0x24ce, 0x2db5, 0xac2, 0x1583, 0x1f99, 0x1922, 0x2513, 0xc4f, 0x615, 0x1298, 0x245a, 0x2f97, 0x2019, 0x2c93, 0x1fbd, 0x291a, 0x8ea, 0x1ed4, 0xb61, 0x1c09, 0x230b, 0x2056, 0x1ccf, 0x1c72, 0x27d9, 0x21e4, 0x2d0a, 0x1f5b, 0xe8, 0x2c3d, 0x2055, 0x72f, 0x222, 0x222d, 0x11be, 0x1e90, 0x11cf, 0x20c5, 0x5b7, 0x391, 0x1ebd, 0x238, 0x73e, 0x653, 0x17c2, 0x2ef3, 0x2fb, 0x27c2, 0x2ecf, 0x847, 0x2042, 0x296d, 0x268d, 0x23f8, 0x7e0, 0x1e2e, 0x2bf7, 0x1ab7, 0x89a, 0xad, 0x21e3, 0x261, 0x2f26, 0x1ede, 0xc4c, 0x299a, 0xfc8, 0xa92, 0xffd, 0x1cbf, 0x14a4, 0x2d01, 0x2a2e, 0x1aaf, 0x1967, 0x1f03, 0xec5, 0x25c, 0x3a5, 0xdd3, 0x2c47, 0x8dd, 0x2945, 0x18ac, 0x197, 0x2f31, 0x4c9, 0x14ac, 0x2be2, 0x166, 0x43a, 0xa94, 0x1b53, 0x293c, 0x212d, 0x6fd, 0x521, 0x109, 0x185, 0x2735, 0x151c, 0x123a, 0x5be, 0x2c02, 0x2b0f, 0x1e7b, 0x1846, 0x297f, 0x2ffd, 0x18e5, 0xf2b, 0xf9a, 0x1f6a, 0x299f, 0xb48, 0x1b9d, 0x2b8f, 0x1eb, 0x12f0, 0x1649, 0x893, 0x83d, 0x2942, 0x757, 0xbc5, 0x1db9, 0x23a9, 0x2115, 0x1b49, 0x1f77, 0x2f18, 0x2dfe, 0xc29, 0x1f69, 0x287e, 0x1b13, 0x9ff, 0x2f06, 0x515, 0x1bb7, 0x24a9, 0x17f6, 0x130d, 0x2dd1, 0x4c1, 0x1675, 0x1d86, 0x1d9d, 0x24f8, 0x55, 0x1382, 0x1b5, 0x2061, 0x1c82, 0x2ebd, 0x4b, 0x2c68, 0x780, 0x24, 0xff8, 0x880, 0x2a7b, 0x54c, 0x971, 0x88d, 0x1594, 0x2802, 0x1ebe, 0x120e, 0xcb6, 0x12d7, 0x15dd, 0xc0a, 0x2c54, 0x208, 0x1bfa, 0x2570, 0x158f, 0x2c82, 0xdb3, 0x10d6, 0x2254, 0x1d8, 0x26b0, 0x2a1b, 0xcec, 0x2572, 0x211d, 0x1c51, 0x148f, 0x616, 0x185f, 0x1a80, 0x1650, 0x538, 0x25e8, 0xf5d, 0x1072, 0x34f, 0x2d04, 0x2a3, 0xb64, 0x2c9e, 0x1f74, 0x3a6, 0x139a, 0x2292, 0x555, 0x96a, 0x244, 0x60b, 0x8d3, 0x1de6, 0x831, 0x2a75, 0x4d7, 0x2616, 0x1485, 0xf16, 0x264a, 0x2bb, 0x609, 0x19d, 0x21da, 0x6d7, 0x234f, 0x2cc4, 0xaf9, 0x20c2, 0xcdd, 0x2f1, 0x1dfd, 0x1c7, 0x247b, 0xec9, 0x1978, 0x770, 0x72b, 0x1ca3, 0xe43, 0x1820, 0xdf9, 0x690, 0x926, 0x3cc, 0x2f20, 0xa7c, 0x121, 0x2f02, 0xee6, 0x2ae2, 0xa85, 0xe29, 0xd2b, 0x1326, 0x2e3d, 0x1553, 0x2ff5, 0x133, 0x2d81, 0x143d, 0x19fc, 0x174a, 0x19b9, 0x2a40, 0x22ab, 0x1d27, 0x8cf, 0x1730, 0x1386, 0x491, 0x212b, 0x2954, 0xf53, 0xbfd, 0x113a, 0x144f, 0x21f8, 0x1b0a, 0x385, 0x2ce6, 0xf63, 0x1a64, 0x48f, 0x2059, 0x1e4b, 0x1d12, 0x1f7f, 0x2255, 0x24f2, 0x16e5, 0x1242, 0xa29, 0x1a6, 0xdd5, 0x7e9, 0x2eac, 0x2e17, 0x8f7, 0x9ed, 0x1de0, 0x1588, 0x2935, 0x1c3e, 0x2534, 0xaf2, 0x2002, 0x7b4, 0x2bf, 0x1d25, 0x2273, 0x1240, 0x176e, 0x29b1, 0x217c, 0x1f5d, 0xa7d, 0x6e8, 0x1f55, 0x104e, 0xb07, 0x241e, 0xc14, 0x618, 0x1fad, 0x2cac, 0x93d, 0x1e4f, 0x2907, 0x281, 0x1bf3, 0x588, 0x277d, 0x1e6b, 0x9df, 0x629, 0x1f46, 0x19a7, 0x3c8, 0x1804, 0x1981, 0x2536, 0x19, 0x6c, 0x1092, 0x1980, 0x13ae, 0xfe4, 0x2f42, 0x9e, 0x2837, 0xea, 0x23e7, 0x73f, 0xaa3, 0x226e, 0x3c1, 0x1f94, 0x2832, 0x1408, 0xd63, 0x1559, 0x19e7, 0x273, 0x2fe5, 0x1e40, 0xa2b, 0xd34, 0x1be2, 0x353, 0x1ef7, 0x147, 0x10e3, 0xd6d, 0x248e, 0xbfc, 0xc04, 0x9aa, 0xc8, 0x360, 0x2262, 0x100b, 0x99a, 0x278f, 0x2efc, 0x1c3d, 0x29a2, 0x21ec, 0x251e, 0x1bdb, 0x2b6d, 0x2d82, 0x15f8, 0x2924, 0x2393, 0x1fd, 0x109a, 0x17b7, 0x2559, 0x20b1, 0x2147, 0xd30, 0xea6, 0xf47, 0x12c3, 0x253, 0x288c, 0xbf3, 0x22a3, 0x78a, 0x2725, 0x20d, 0x16d2, 0x47f, 0xfc, 0xfc6, 0xb7f, 0x957, 0x2514, 0x1216, 0xbda, 0x709, 0x2809, 0x172e, 0x1e60, 0x28f9, 0x23df, 0x908, 0x2445, 0x1646, 0xe38, 0x3d2, 0x160b, 0x6e6, 0x1788, 0x2fe4, 0x15d8, 0x47, 0xce8, 0x1ecb, 0x6b7, 0x2a73, 0x1619, 0x27c7, 0x633, 0x2fe7, 0x2a9a, 0x1a96, 0x297d, 0xc2d, 0x2488, 0x1953, 0xb89, 0x131c, 0x1729, 0x1b16, 0x1275, 0x1fbb, 0x184c, 0x1c28, 0x198a, 0x2934, 0x1f9, 0x2553, 0x11e5, 0xfdc, 0x2a4d, 0xdc4, 0x1146, 0x956, 0x92d, 0x21e1, 0x1a95, 0x2fa1, 0x998, 0x1c01, 0x131d, 0x2a3f, 0xb4b, 0x2cf2, 0x2fe1, 0x724, 0x1956, 0x1cce, 0x254a, 0x2a0a, 0x1497, 0x11e7, 0xc71, 0xf58, 0x77d, 0x2245, 0x40f, 0x22c, 0x871, 0x3d3, 0x18dd, 0x1cd, 0x2df0, 0x1009, 0x1a94, 0x29da, 0x1963, 0x7e7, 0x2908, 0x848, 0xc28, 0x19a2, 0x31d, 0x2c2c, 0x2608, 0x23a5, 0x542, 0x2fad, 0x865, 0x1e81, 0x2da9, 0x25e1, 0x1303, 0x240c, 0x7ba, 0x2a8, 0xc0d, 0xda8, 0x124d, 0x28a8, 0x1ff7, 0x2829, 0x146, 0xb43, 0x23ea, 0x1894, 0x2e27, 0x2dc4, 0x2d43, 0x18a3, 0x1a44, 0xbb3, 0x28b9, 0x1fe9, 0x226b, 0x1409, 0xb7a, 0x1c75, 0x4e, 0x1299, 0x1040, 0x1fcc, 0x171e, 0xb8a, 0xd1, 0x75e, 0x26ae, 0x229b, 0xec0, 0x157a, 0x111c, 0x6b5, 0x6d, 0x5ae, 0x1467, 0x1c9d, 0x200a, 0x5eb, 0x1339, 0xbff, 0x120, 0x1fbe, 0x13ff, 0x3d1, 0x2a60, 0x1b87, 0x196a, 0x57, 0x1b4f, 0x1220, 0x1d30, 0xccd, 0x248b, 0x2aa8, 0x1db7, 0x18ae, 0x10aa, 0x1425, 0x2f2c, 0x1187, 0x3a1, 0x26b8, 0x2466, 0x14e9, 0x1518, 0x2b1f, 0x1ae6, 0x238e, 0x1a78, 0x1819, 0x2284, 0x1475, 0xaf, 0x2f4, 0x13fc, 0x227d, 0x29c0, 0xf3a, 0x187a, 0x5e4, 0x1950, 0x2a25, 0x29e1, 0xddd, 0x295d, 0x1351, 0x304, 0x2bc0, 0xd2, 0xd25, 0x2195, 0x1fc9, 0x1ee6, 0x2f13, 0x6db, 0xa6a, 0x1d99, 0x2b60, 0x1234, 0x283c, 0x2ac2, 0x11a9, 0x639, 0x2290, 0x2bda, 0x32f, 0x2a5f, 0x15c0, 0x139c, 0x7e8, 0x88a, 0x43f, 0x2762, 0x1271, 0x119d, 0x1fed, 0x1b4d, 0x692, 0x1d2b, 0x1feb, 0x1380, 0x2628, 0x2a93, 0x2226, 0xe71, 0x2d1b, 0x20ab, 0x17ff, 0x1e27, 0x2fb1, 0xe65, 0x17c8, 0x1fa6, 0x43b, 0x548, 0x2256, 0x9a5, 0x71a, 0x26ea, 0x2d38, 0x1b40, 0x1b79, 0x658, 0x15a5, 0x224f, 0x248, 0xeee, 0x2f37, 0x1c30, 0x15ec, 0x1ca7, 0x255f, 0x2801, 0x18f7, 0x1727, 0xf88, 0x2b1, 0x2c45, 0x164b, 0x289f, 0x14dd, 0x2649, 0x27a3, 0x9f0, 0x21ca, 0x1f5, 0x1dd6, 0xbc3, 0x71f, 0x133e, 0x13bb, 0x2afe, 0xc35, 0x4bb, 0x2d31, 0x10a7, 0x2a04, 0x180e, 0x2613, 0x330, 0xe76, 0x19fd, 0xfe9, 0x935, 0x79, 0x1b01, 0x73c, 0x2ac6, 0x21ce, 0x1911, 0x761, 0x1084, 0x1983, 0xc3, 0x15eb, 0xe0a, 0xdd, 0x1cb1, 0xb21, 0x2a51, 0x217f, 0xb1, 0x1328, 0x9ca, 0x1d96, 0x1a0b, 0xe1b, 0x1c4b, 0x3b, 0x4d6, 0x2344, 0x199e, 0x28af, 0x1624, 0x4ae, 0x8b2, 0x2991, 0x1fb7, 0x41, 0x2780, 0x1d8b, 0xa7f, 0x110, 0x2350, 0x18aa, 0x2b2f, 0x1805, 0x1ff, 0xf0, 0x2a74, 0xe42, 0xd97, 0x85b, 0x14bc, 0x2901, 0xfd8, 0x1ab3, 0x1cef, 0xfbd, 0x2b07, 0x174f, 0x69b, 0x10c3, 0x1491, 0xde3, 0x28ca, 0x252e, 0x1849, 0x1ec2, 0x1f1b, 0x2853, 0x12ab, 0x2674, 0x238c, 0x350, 0x2ca, 0xa7, 0x4bd, 0xcc3, 0x90c, 0x892, 0x276, 0x1e55, 0x196d, 0x1194, 0x1bef, 0x66a, 0x1da1, 0x260f, 0x1c15, 0x49f, 0x120b, 0x2671, 0x1237, 0x2e0d, 0x2791, 0x17d8, 0x1e0a, 0x2a99, 0x14cf, 0xfb1, 0x15b4, 0x1462, 0x2fbb, 0xeff, 0x16b, 0x2d6a, 0x9ef, 0x5e3, 0x11c0, 0x2e76, 0x1623, 0x2db8, 0x1c88, 0x740, 0x11e1, 0x12a3, 0x977, 0x1110, 0x2163, 0x2dee, 0x47b, 0x2aa5, 0x2a22, 0x1231, 0x16e7, 0x1626, 0x12e0, 0x1d28, 0xe96, 0xb62, 0x21d0, 0xf09, 0xb30, 0xcb8, 0x2981, 0x2648, 0x155d, 0x27ee, 0xb34, 0x169, 0x1574, 0x1fe6, 0x25f4, 0x151d, 0x1801, 0x1f13, 0x1308, 0x2929, 0x6eb, 0x25e, 0x2cca, 0x1e3e, 0x248f};
+const sign16 inv = 0xeab;
+const sign16 invpr = 0x2c2a;
+
+#define DEGREE (1<<RLWE_LGN)
+#define WL 32
+
+#define round(a,b) (((a)+((b)/2))/(b))
+
+/* constant time absolute vaue */
+static sign32 nabs(sign32 x)
+{
+    sign32 mask = (x >> 31);
+    return (x + mask)^mask;
+}
+
+/* Montgomery stuff */
+
+static sign32 redc(unsign64 T)
+{
+    unsign32 m = (unsign32)T * (unsign32)RLWE_ND;
+    return ((unsign64)m * RLWE_PRIME + T) >> WL;
+}
+
+static sign32 nres(unsign32 x)
+{
+    return redc((unsign64)x * RLWE_R2MODP);
+}
+
+static sign32 modmul(unsign32 a, unsign32 b)
+{
+    return redc((unsign64)a * b);
+}
+
+/* NTT code */
+/* Cooley-Tukey NTT */
+
+static void ntt(sign32 *x)
+{
+    int m, i, j, k, t = DEGREE / 2;
+    sign32 S, U, V, W, q = RLWE_PRIME;
+
+    /* Convert to Montgomery form */
+    for (j = 0; j < DEGREE; j++)
+        x[j] = nres(x[j]);
+
+    m = 1;
+    while (m < DEGREE)
+    {
+        k = 0;
+        for (i = 0; i < m; i++)
+        {
+            S = roots[m + i];
+            for (j = k; j < k + t; j++)
+            {
+                U = x[j];
+                V = modmul(x[j + t], S);
+                x[j] = U + V;
+                x[j + t] = U + 2 * q - V;
+            }
+            k += 2 * t;
+        }
+        t /= 2;
+        m *= 2;
+    }
+}
+
+/* Gentleman-Sande INTT */
+
+static void intt(sign32 *x)
+{
+    int m, i, j, k, t = 1;
+    sign32 S, U, V, W, q = RLWE_PRIME;
+
+    m = DEGREE / 2;
+    while (m > 1)
+    {
+        k = 0;
+        for (i = 0; i < m; i++)
+        {
+            S = iroots[m + i];
+            for (j = k; j < k + t; j++)
+            {
+                U = x[j];
+                V = x[j + t];
+                x[j] = U + V;
+                W = U + DEGREE * q - V;
+                x[j + t] = modmul(W, S);
+            }
+            k += 2 * t;
+        }
+        t *= 2;
+        m /= 2;
+    }
+
+    /* Last iteration merged with n^-1 */
+
+    t = DEGREE / 2;
+    for (j = 0; j < t; j++)
+    {
+        U = x[j];
+        V = x[j + t];
+        W = U + DEGREE * q - V;
+        x[j + t] = modmul(W, (sign32)invpr);
+        x[j] = modmul(U + V, (sign32)inv);
+    }
+    /* convert back from Montgomery to "normal" form */
+    for (j = 0; j < DEGREE; j++)
+    {
+        x[j] = redc(x[j]);
+        x[j] -= q;
+        x[j] += (x[j] >> (WL - 1))&q;
+    }
+}
+
+/* See https://eprint.iacr.org/2016/1157.pdf */
+
+static void NHSEncode(byte *key, sign32 *poly)
+{
+    int i, j, b, k, kj, q2;
+
+    q2 = RLWE_PRIME / 2;
+    for (i = j = 0; i < 256;)
+    {
+        kj = key[j++];
+        for (k = 0; k < 8; k++)
+        {
+            b = kj & 1;
+            poly[i] = b * q2;
+            poly[i + 256] = b * q2;
+            poly[i + 512] = b * q2;
+            poly[i + 768] = b * q2;
+            kj >>= 1;
+            i++;
+        }
+    }
+}
+
+static void NHSDecode(sign32 *poly, byte *key)
+{
+    int i, j, k;
+    sign32 b, t, q2;
+    q2 = RLWE_PRIME / 2;
+    for (i = 0; i < 32; i++)
+        key[i] = 0;
+
+    for (i = j = 0; i < 256;)
+    {
+        for (k = 0; k < 8; k++)
+        {
+            t = nabs(poly[i] - q2) + nabs(poly[i + 256] - q2) + nabs(poly[i + 512] - q2) + nabs(poly[i + 768] - q2);
+
+            b = t - RLWE_PRIME;
+            b = (b >> 31) & 1;
+            key[j] = (key[j] >> 1) + (b << 7);
+            i++;
+        }
+        j++;
+    }
+}
+
+/* convert 32-byte seed to random polynomial */
+
+static void parse(byte *seed, sign32 *poly)
+{
+    int i, j;
+    sign32 n;
+    byte hash[4 * DEGREE];
+    sha3 sh;
+
+    SHA3_init(&sh, SHAKE128);
+    for (i = 0; i < 32; i++)
+        SHA3_process(&sh, seed[i]);
+    SHA3_shake(&sh, (char *)hash, 4 * DEGREE);
+
+    for (i = j = 0; i < DEGREE; i++)
+    {
+
+        n = hash[j] & 0x7f; n <<= 8;
+        n += hash[j + 1]; n <<= 8;
+        n += hash[j + 2]; n <<= 8;
+        n += hash[j + 3]; j += 4;
+        poly[i] = nres(n);
+    }
+}
+
+/* Compress 14 bits polynomial coefficients into byte array */
+/* 7 bytes is 3x14 */
+
+static void NHSpack(sign32 *poly, byte *array)
+{
+    int i, j;
+    sign32 a, b, c, d;
+
+    for (i = j = 0; i < DEGREE; )
+    {
+        a = poly[i++]; b = poly[i++]; c = poly[i++]; d = poly[i++];
+        array[j++] = (byte)(a & 0xff);
+        array[j++] = (byte)(((a >> 8) | (b << 6)) & 0xff);
+        array[j++] = (byte)((b >> 2) & 0xff);
+        array[j++] = (byte)(((b >> 10) | (c << 4)) & 0xff);
+        array[j++] = (byte)((c >> 4) & 0xff);
+        array[j++] = (byte)(((c >> 12) | (d << 2)) & 0xff);
+        array[j++] = (byte)(d >> 6);
+    }
+}
+
+static void NHSunpack(byte *array, sign32 *poly)
+{
+    int i, j;
+    sign32 a, b, c, d, e, f, g;
+
+    for (i = j = 0; i < DEGREE; )
+    {
+        a = ((sign32)array[j++]) & 0xff; b = ((sign32)array[j++]) & 0xff; c = ((sign32)array[j++]) & 0xff; d = ((sign32)array[j++]) & 0xff; e = ((sign32)array[j++]) & 0xff; f = ((sign32)array[j++]) & 0xff; g = ((sign32)array[j++]) & 0xff;
+        poly[i++] = a | ((b & 0x3f) << 8);
+        poly[i++] = (b >> 6) | (c << 2) | ((d & 0xf) << 10);
+        poly[i++] = (d >> 4) | (e << 4) | ((f & 3) << 12);
+        poly[i++] = (f >> 2) | (g << 6);
+    }
+}
+
+/* See https://eprint.iacr.org/2016/1157.pdf */
+
+static void NHSCompress(sign32 *poly, byte *array)
+{
+    int i, j, k, b;
+    unsign32 col = 0;
+
+    for (i = j = 0; i < DEGREE;)
+    {
+        for (k = 0; k < 8; k++)
+        {
+            b = round((poly[i] * 8), RLWE_PRIME) & 7;
+            col = (col << 3) + b;
+            i++;
+        }
+        array[j] = col & 0xff;
+        array[j + 1] = (col >> 8) & 0xff;
+        array[j + 2] = (col >> 16) & 0xff;
+        j += 3; col = 0;
+    }
+}
+
+static void NHSDecompress(byte *array, sign32 *poly)
+{
+    int i, j, k, b;
+    unsign32 col = 0;
+
+    for (i = j = 0; i < DEGREE;)
+    {
+        col = array[j + 2];
+        col = (col << 8) + array[j + 1];
+        col = (col << 8) + array[j];
+        j += 3;
+        for (k = 0; k < 8; k++)
+        {
+            b = (col & 0xe00000) >> 21; col <<= 3;
+            poly[i] = round((b * RLWE_PRIME), 8);
+            i++;
+        }
+    }
+}
+
+/* generate centered binomial distribution */
+
+static void NHSError(csprng *RNG, sign32 *poly)
+{
+    int i, j;
+    sign32 n1, n2, r;
+    for (i = 0; i < DEGREE; i++)
+    {
+        n1 = RAND_byte(RNG) + (RAND_byte(RNG) << 8);
+        n2 = RAND_byte(RNG) + (RAND_byte(RNG) << 8);
+        r = 0;
+        for (j = 0; j < 16; j++)
+        {
+            r += (n1 & 1) - (n2 & 1);
+            n1 >>= 1; n2 >>= 1;
+        }
+        poly[i] = (r + RLWE_PRIME);
+    }
+}
+
+static void redc_it(sign32 *p)
+{
+    int i;
+    for (i = 0; i < DEGREE; i++)
+        p[i] = redc(p[i]);
+}
+
+static void nres_it(sign32 *p)
+{
+    int i;
+    for (i = 0; i < DEGREE; i++)
+        p[i] = nres(p[i]);
+}
+
+static void poly_mul(sign32 *p1, sign32 *p2, sign32 *p3)
+{
+    int i;
+    for (i = 0; i < DEGREE; i++)
+        p1[i] = modmul(p2[i], p3[i]);
+}
+
+static void poly_add(sign32 *p1, sign32 *p2, sign32 *p3)
+{
+    int i;
+    for (i = 0; i < DEGREE; i++)
+        p1[i] = (p2[i] + p3[i]);
+}
+
+static void poly_sub(sign32 *p1, sign32 *p2, sign32 *p3)
+{
+    int i;
+    for (i = 0; i < DEGREE; i++)
+        p1[i] = (p2[i] + RLWE_PRIME - p3[i]);
+}
+
+/* reduces inputs < 2q */
+static void poly_soft_reduce(sign32 *poly)
+{
+    int i;
+    sign32 e;
+    for (i = 0; i < DEGREE; i++)
+    {
+        e = poly[i] - RLWE_PRIME;
+        poly[i] = e + ((e >> (WL - 1))&RLWE_PRIME);
+    }
+}
+
+/* fully reduces modulo q */
+static void poly_hard_reduce(sign32 *poly)
+{
+    int i;
+    sign32 e;
+    for (i = 0; i < DEGREE; i++)
+    {
+        e = modmul(poly[i], RLWE_ONE);
+        e = e - RLWE_PRIME;
+        poly[i] = e + ((e >> (WL - 1))&RLWE_PRIME);
+    }
+}
+
+/* API functions. See https://eprint.iacr.org/2016/1157.pdf Protocol 1 */
+// S is secret key key, SB is seed|public key to be sent to client
+void core::NHS_SERVER_1(csprng *RNG, octet *SB, octet *S)
+{
+    int i;
+    byte seed[32], array[1792];
+    sign32 s[DEGREE], e[DEGREE], b[DEGREE];
+
+    for (i = 0; i < 32; i++)
+        seed[i] = RAND_byte(RNG);
+
+    parse(seed, b);
+
+    NHSError(RNG, e);
+    NHSError(RNG, s);
+
+	ntt(s);
+	ntt(e);
+
+    poly_mul(b, b, s);
+    poly_add(b, b, e);
+    poly_hard_reduce(b);
+
+    redc_it(b);
+    NHSpack(b, array);
+
+    OCT_empty(SB);
+    OCT_jbytes(SB, (char *)seed, 32);
+    OCT_jbytes(SB, (char *)array, 1792);
+
+    poly_hard_reduce(s);
+
+    NHSpack(s, array);
+    OCT_empty(S);
+    OCT_jbytes(S, (char *)array, 1792);
+
+}
+
+// optimized to reduce memory
+// UC is U|cbar to be returned to server
+// KEY is shared key
+void core::NHS_CLIENT(csprng *RNG, octet *SB, octet *UC, octet *KEY)
+{
+    int i;
+    sha3 sh;
+    byte seed[32], array[1792], key[32], cc[384];
+    sign32 sd[DEGREE], ed[DEGREE], u[DEGREE];
+    NHSError(RNG, sd);
+    NHSError(RNG, ed);
+
+    ntt(sd);
+    ntt(ed);
+
+    for (i = 0; i < 32; i++)
+        seed[i] = SB->val[i];
+
+    parse(seed, u);
+
+    poly_mul(u, u, sd);
+    poly_add(u, u, ed);
+    poly_hard_reduce(u);
+
+    redc_it(u);
+    NHSpack(u, array);
+    OCT_empty(UC);
+    OCT_jbytes(UC, (char *)array, 1792);
+
+    for (i = 0; i < 32; i++)
+        key[i] = RAND_byte(RNG);
+
+    SHA3_init(&sh, SHA3_HASH256);
+    for (i = 0; i < 32; i++)
+        SHA3_process(&sh, key[i]);
+    SHA3_hash(&sh, (char *)key);
+
+    for (i = 0; i < 1792; i++)
+        array[i] = SB->val[i + 32];
+
+    NHSunpack(array, u);
+    nres_it(u);
+
+    poly_mul(u, u, sd);
+    intt(u);
+    NHSError(RNG, ed);
+    poly_add(u, u, ed);
+
+    NHSEncode(key, sd);
+    poly_add(u, u, sd);
+
+    NHSCompress(u, cc);
+
+    SHA3_init(&sh, SHA3_HASH256);
+    for (i = 0; i < 32; i++)
+        SHA3_process(&sh, key[i]);
+    SHA3_hash(&sh, (char *)key);
+
+    OCT_empty(KEY);
+    OCT_jbytes(KEY, (char *)key, 32);
+
+    OCT_jbytes(UC, (char *)cc, 384);
+}
+
+// calculate shared key from UC and secret key S
+void core::NHS_SERVER_2(octet *S, octet *UC, octet *KEY)
+{
+    int i;
+    sha3 sh;
+    sign32 c[DEGREE], s[DEGREE], k[DEGREE];
+    byte array[1792], key[32], cc[384];
+
+    for (i = 0; i < 1792; i++)
+        array[i] = UC->val[i];
+
+    NHSunpack(array, k);
+    nres_it(k);
+
+    for (i = 0; i < 384; i++)
+        cc[i] = UC->val[i + 1792];
+
+    NHSDecompress(cc, c);
+
+    for (i = 0; i < 1792; i++)
+        array[i] = S->val[i];
+
+    NHSunpack(array, s);
+
+    poly_mul(k, k, s);
+    intt(k);
+    poly_sub(k, c, k);
+    poly_soft_reduce(k);
+
+    NHSDecode(k, key);
+
+    SHA3_init(&sh, SHA3_HASH256);
+    for (i = 0; i < 32; i++)
+        SHA3_process(&sh, key[i]);
+    SHA3_hash(&sh, (char *)key);
+
+    OCT_empty(KEY);
+    OCT_jbytes(KEY, (char *)key, 32);
+}
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/newhope.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/newhope.h
new file mode 100644
index 0000000..d7d6ee1
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/newhope.h
@@ -0,0 +1,64 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* NewHope Simple API */
+
+#ifndef NHS_H
+#define NHS_H
+
+#include "core.h"
+
+/* NewHope parameters */
+
+//q= 12289
+
+#define RLWE_PRIME 0x3001	// q in Hex
+#define RLWE_LGN 10			// Degree n=2^LGN
+#define RLWE_ND 0xF7002FFF	// 1/(R-q) mod R
+#define RLWE_ONE 0x2AC8		// R mod q
+#define RLWE_R2MODP 0x1620	// R^2 mod q
+
+namespace core {
+/** @brief NHS server first pass
+ *
+    @param RNG Random Number Generator handle
+    @param SB seed and polynomial B concatenated - output
+    @param S server secret - output
+
+ */
+extern void NHS_SERVER_1(csprng *RNG, octet *SB, octet *S);
+/** @brief NHS client pass
+ *
+    @param RNG Random Number Generator handle
+    @param SB seed and polynomial B concatenated - input
+    @param UC polynomial U and compressed polynomial c - output
+    @param KEY client key
+ */
+extern void NHS_CLIENT(csprng *RNG, octet *SB, octet *UC, octet *KEY);
+/** @brief NHS server second pass
+ *
+    @param S server secret - input
+    @param UC polynomial U and compressed polynomial c - input
+    @param KEY server key
+ */
+extern void NHS_SERVER_2(octet *S, octet *UC, octet *KEY);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/oct.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/oct.cpp
new file mode 100644
index 0000000..9146202
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/oct.cpp
@@ -0,0 +1,446 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/*** Basic Octet string maintainance routines  ***/
+/* SU=m, m is Stack Usage */
+
+#include <string.h>
+#include "core.h"
+
+#ifdef CORE_ARDUINO
+#include <Arduino.h>
+#endif
+
+using namespace core;
+
+/* Output an octet string (Debug Only) */
+
+/* SU= 16 */
+/* output octet */
+void core::OCT_output(octet *w)
+{
+    int i;
+    unsigned char ch;
+    for (i = 0; i < w->len; i++)
+    {
+        ch = w->val[i];
+#ifdef CORE_ARDUINO
+        char my_data[3];
+        sprintf(my_data, "%02x", ch);
+        Serial.print(my_data);
+#else
+        printf("%02x", ch);
+#endif
+    }
+#ifdef CORE_ARDUINO
+    Serial.println("");
+#else
+    printf("\n");
+#endif
+}
+
+/* reverse bytes. Useful if dealing with those little-endian bastards */
+void core::OCT_reverse(octet *w)
+{
+    int i;
+    unsigned char ch;
+    for (i = 0; i < w->len/2; i++) { 
+        ch = w->val[i]; 
+        w->val[i] = w->val[w->len - i - 1]; 
+        w->val[w->len - i - 1] = ch; 
+    } 
+}
+
+//#define PUT_IN_SPACES
+
+/* SU= 16 */
+void core::OCT_output_string(octet *w)
+{
+    int i;
+    unsigned char ch;
+    for (i = 0; i < w->len; i++)
+    {
+
+        ch = w->val[i];
+#ifdef CORE_ARDUINO
+        char my_data[3];
+#ifdef PUT_IN_SPACES
+        sprintf(my_data, "%c ", ch);
+#else
+        sprintf(my_data, "%c", ch);
+#endif
+        Serial.print(my_data);
+#else
+#ifdef PUT_IN_SPACES
+        printf("%c ", ch);
+#else
+        printf("%c", ch);
+#endif
+#endif
+    }
+}
+
+/* Convert C string to octet format - truncates if no room  */
+void core::OCT_jstring(octet *y, char *s)
+{
+    int i, j;
+    i = y->len;
+    j = 0;
+    while (s[j] != 0 && i < y->max)
+    {
+        y->val[i] = s[j];
+        y->len++;
+        i++;
+        j++;
+    }
+}
+
+/* compare 2 octet strings.
+ * If x==y return TRUE, else return FALSE */
+/* SU= 8 */
+int core::OCT_comp(octet *x, octet *y)
+{
+    int i;
+    if (x->len > y->len) return 0;
+    if (x->len < y->len) return 0;
+    for (i = 0; i < x->len; i++)
+    {
+        if (x->val[i] != y->val[i]) return 0;
+    }
+    return 1;
+}
+
+/* check are first n bytes the same (in constant time) */
+
+int core::OCT_ncomp(octet *x, octet *y, int n)
+{
+    int i, res = 0;
+    if (n > y->len || n > x->len) return 0;
+    for (i = 0; i < n; i++)
+    {
+        res |= (int)(x->val[i] ^ y->val[i]);
+    }
+    if (res == 0) return 1;
+    return 0;
+}
+
+/* Shift octet to the left by n bytes. Leftmost bytes disappear  */
+void core::OCT_shl(octet *x, int n)
+{
+    int i;
+    if (n >= x->len)
+    {
+        x->len = 0;
+        return;
+    }
+    x->len -= n;
+    for (i = 0; i < x->len; i++)
+        x->val[i] = x->val[i + n];
+}
+
+/* Append binary string to octet - truncates if no room */
+/* SU= 12 */
+void core::OCT_jbytes(octet *y, char *b, int len)
+{
+    int i, j;
+    i = y->len;
+    for (j = 0; j < len && i < y->max; j++)
+    {
+        y->val[i] = b[j];
+        y->len++;
+        i++;
+    }
+}
+
+/* Concatenates two octet strings */
+/* SU= 8 */
+void core::OCT_joctet(octet *y, octet *x)
+{
+    /* y=y || x */
+    int i, j;
+    if (x == NULL) return;
+
+    for (i = 0; i < x->len; i++)
+    {
+        j = y->len + i;
+        if (j >= y->max)
+        {
+            y->len = y->max;
+            return;
+        }
+        y->val[j] = x->val[i];
+    }
+    y->len += x->len;
+}
+
+/* Append byte to octet rep times */
+/* SU= 8 */
+void core::OCT_jbyte(octet *y, int ch, int rep)
+{
+    int i, j;
+    i = y->len;
+    for (j = 0; j < rep && i < y->max; j++)
+    {
+        y->val[i] = ch;
+        y->len++;
+        i++;
+    }
+}
+
+/* XOR common bytes of x with y */
+/* SU= 8 */
+void core::OCT_xor(octet *y, octet *x)
+{
+    /* xor first x->len bytes of y */
+
+    int i;
+    for (i = 0; i < x->len && i < y->len; i++)
+    {
+        y->val[i] ^= x->val[i];
+    }
+}
+
+/* clear an octet */
+void core::OCT_empty(octet *w)
+{
+    w->len = 0;
+}
+
+/* Kill an octet string - Zeroise it for security */
+void core::OCT_clear(octet *w)
+{
+    int i;
+    for (i = 0; i < w->max; i++) w->val[i] = 0;
+    w->len = 0;
+}
+
+/* appends int x of length len bytes to OCTET string */
+/* SU= 8 */
+void core::OCT_jint(octet *y, unsigned int x, int len)
+{
+    int i, n;
+    n = y->len + len;
+    if (n > y->max || len <= 0) return;
+    for (i = y->len; i < n; i++) y->val[i] = 0;
+    y->len = n;
+
+    i = y->len;
+    while (x > 0 && i > 0)
+    {
+        i--;
+        y->val[i] = x % 256;
+        x /= 256;
+    }
+}
+
+/* Pad an octet to a given length */
+/* SU= 8 */
+int core::OCT_pad(octet *w, int n)
+{
+    int i, d;
+    if (w->len > n || n > w->max) return 0;
+    if (n == w->len) return 1;
+    d = n - w->len;
+    for (i = n - 1; i >= d; i--)
+        w->val[i] = w->val[i - d];
+    for (i = d - 1; i >= 0; i--)
+        w->val[i] = 0;
+    w->len = n;
+    return 1;
+}
+
+
+/* Convert an octet string to base64 string */
+/* SU= 56 */
+void core::OCT_tobase64(char *b, octet *w)
+{
+    int i, j, k, rem, last;
+    int c, ch[4];
+    unsigned char ptr[3];
+    rem = w->len % 3;
+    j = k = 0;
+    last = 4;
+    while (j < w->len)
+    {
+        for (i = 0; i < 3; i++)
+        {
+            if (j < w->len) ptr[i] = w->val[j++];
+            else
+            {
+                ptr[i] = 0;
+                last--;
+            }
+        }
+        ch[0] = (ptr[0] >> 2) & 0x3f;
+        ch[1] = ((ptr[0] << 4) | (ptr[1] >> 4)) & 0x3f;
+        ch[2] = ((ptr[1] << 2) | (ptr[2] >> 6)) & 0x3f;
+        ch[3] = ptr[2] & 0x3f;
+        for (i = 0; i < last; i++)
+        {
+            c = ch[i];
+            if (c < 26) c += 65;
+            if (c >= 26 && c < 52) c += 71;
+            if (c >= 52 && c < 62) c -= 4;
+            if (c == 62) c = '+';
+            if (c == 63) c = '/';
+            b[k++] = c;
+        }
+    }
+    if (rem > 0) for (i = rem; i < 3; i++) b[k++] = '=';
+    b[k] = '\0'; /* dangerous! */
+}
+
+/* SU= 56 */
+void core::OCT_frombase64(octet *w, char *b)
+{
+    int i, j, k, pads, len = (int)strlen(b);
+    int c, ch[4], ptr[3];
+    j = k = 0;
+    while (j < len && k < w->max)
+    {
+        pads = 0; i=0;
+        while (i<4)
+        {
+            c = 80 + b[j++];
+            if (c <= 112) continue; /* ignore white space */
+            if (c > 144 && c < 171) c -= 145;
+            if (c > 176 && c < 203) c -= 151;
+            if (c > 127 && c < 138) c -= 76;
+            if (c == 123) c = 62;
+            if (c == 127) c = 63;
+            if (c == 141)
+            {
+                pads++;    /* ignore pads '=' */
+                i++;
+                continue;
+            }
+            ch[i++] = c;
+        }
+        ptr[0] = (ch[0] << 2) | (ch[1] >> 4);
+        ptr[1] = (ch[1] << 4) | (ch[2] >> 2);
+        ptr[2] = (ch[2] << 6) | ch[3];
+        for (i = 0; i < 3 - pads && k < w->max; i++)
+        {
+            /* don't put in leading zeros */
+            w->val[k++] = ptr[i];
+        }
+
+    }
+    w->len = k;
+}
+
+/* copy an octet string - truncates if no room */
+/* SU= 16 */
+void core::OCT_copy(octet *y, octet *x)
+{
+    int i;
+    OCT_clear(y);
+    y->len = x->len;
+    if (y->len > y->max) y->len = y->max;
+
+    for (i = 0; i < y->len; i++)
+        y->val[i] = x->val[i];
+}
+
+/* XOR m with all of x */
+void core::OCT_xorbyte(octet *x, int m)
+{
+    int i;
+    for (i = 0; i < x->len; i++) x->val[i] ^= m;
+}
+
+/* truncates x to n bytes and places the rest in y (if y is not NULL) */
+/* SU= 8 */
+void core::OCT_chop(octet *x, octet *y, int n)
+{
+    int i;
+    if (n >= x->len)
+    {
+        if (y != NULL) y->len = 0;
+        return;
+    }
+    if (y != NULL) y->len = x->len - n;
+    x->len = n;
+
+    if (y != NULL)
+    {
+        for (i = 0; i < y->len && i < y->max; i++) y->val[i] = x->val[i + n];
+    }
+}
+
+/* set x to len random bytes */
+void core::OCT_rand(octet *x, csprng *RNG, int len)
+{
+    int i;
+    if (len > x->max) len = x->max;
+    x->len = len;
+
+    for (i = 0; i < len; i++) x->val[i] = RAND_byte(RNG);
+}
+
+/* Convert an octet to a hex string */
+void core::OCT_toHex(octet *src, char *dst)
+{
+    int i,len=src->len;
+    unsigned char ch;
+    for (i = 0; i < len; i++)
+    {
+        ch = src->val[i];
+        sprintf(&dst[i * 2], "%02x", ch);
+    }
+    dst[2*len]='\0';
+}
+
+static int char2int(char input)
+{
+    if (input >= '0' && input <= '9')
+        return input - '0';
+    if (input >= 'A' && input <= 'F')
+        return input - 'A' + 10;
+    if (input >= 'a' && input <= 'f')
+        return input - 'a' + 10;
+    return 0;
+}
+
+/* Convert from a hex string */
+void core::OCT_fromHex(octet *dst, char *src)
+{
+    int i = 0;
+    int j = 0;
+    OCT_clear(dst);
+    while (src[j] != 0)
+    {
+        dst->val[i++] = char2int(src[j]) * 16 + char2int(src[j + 1]);
+        j += 2;
+    }
+    dst->len = i;
+}
+
+
+/* Convert an octet to a string */
+void core::OCT_toStr(octet *src, char *dst)
+{
+    int i;
+    unsigned char ch;
+    for (i = 0; i < src->len; i++)
+    {
+        ch = src->val[i];
+        sprintf(&dst[i], "%c", ch);
+    }
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/pair.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/pair.cpp
new file mode 100644
index 0000000..0d202bd
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/pair.cpp
@@ -0,0 +1,1233 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* CORE BN Curve pairing functions */
+
+//#define HAS_MAIN
+
+#include "pair_ZZZ.h"
+
+using namespace XXX;
+using namespace YYY;
+
+namespace ZZZ {
+static void PAIR_line(FP12 *, ECP2 *, ECP2 *, FP *, FP *);
+static void PAIR_double(ECP2 *, FP2 *, FP2 *, FP2 *);
+static void PAIR_add(ECP2 *, ECP2 *B, FP2 *, FP2 *, FP2 *);
+static void PAIR_pack(FP4 *, FP2 *, FP2 *, FP2 *);
+static void PAIR_unpack(FP12 *, FP4 *, FP *, FP *);
+static void glv(BIG u[2], BIG);
+static void gs(BIG u[4], BIG);
+}
+
+// Point doubling for pairings
+static void ZZZ::PAIR_double(ECP2 *A, FP2 *AA, FP2 *BB, FP2 *CC)
+{
+    FP2 YY;
+    FP2_copy(CC, &(A->x));  //FP2 XX=new FP2(A.getx());  //X
+    FP2_copy(&YY, &(A->y)); //FP2 YY=new FP2(A.gety());  //Y
+    FP2_copy(BB, &(A->z));  //FP2 ZZ=new FP2(A.getz());  //Z
+
+    FP2_copy(AA, &YY);      //FP2 YZ=new FP2(YY);        //Y
+    FP2_mul(AA, AA, BB);    //YZ.mul(ZZ);                //YZ
+    FP2_sqr(CC, CC);        //XX.sqr();                //X^2
+    FP2_sqr(&YY, &YY);      //YY.sqr();                //Y^2
+    FP2_sqr(BB, BB);        //ZZ.sqr();                //Z^2
+
+    FP2_add(AA, AA, AA);
+    FP2_neg(AA, AA);
+    FP2_norm(AA);           // -2YZ
+    FP2_mul_ip(AA);
+    FP2_norm(AA);           // -2YZi
+
+    FP2_imul(BB, BB, 3 * CURVE_B_I); //3Bz^2
+    FP2_imul(CC, CC, 3);            //3X^2
+
+#if SEXTIC_TWIST_ZZZ==D_TYPE
+    FP2_mul_ip(&YY);                    // Y^2.i
+    FP2_norm(&YY);
+    FP2_mul_ip(CC);                 // 3X^2.i
+    FP2_norm(CC);
+#endif
+
+#if SEXTIC_TWIST_ZZZ==M_TYPE
+    FP2_mul_ip(BB);                 // 3Bz^2.i
+    FP2_norm(BB);
+#endif
+
+    FP2_sub(BB, BB, &YY);
+    FP2_norm(BB);
+
+    ECP2_dbl(A);            //A.dbl();
+}
+
+// Point addition for pairings
+static void ZZZ::PAIR_add(ECP2 *A, ECP2 *B, FP2 *AA, FP2 *BB, FP2 *CC)
+{
+    FP2 T1;
+    FP2_copy(AA, &(A->x));      //FP2 X1=new FP2(A.getx());    // X1
+    FP2_copy(CC, &(A->y));      //FP2 Y1=new FP2(A.gety());    // Y1
+    FP2_copy(&T1, &(A->z));     //FP2 T1=new FP2(A.getz());    // Z1
+
+    FP2_copy(BB, &T1);          //FP2 T2=new FP2(A.getz());    // Z1
+
+    FP2_mul(&T1, &T1, &(B->y)); //T1.mul(B.gety());    // T1=Z1.Y2
+    FP2_mul(BB, BB, &(B->x));   //T2.mul(B.getx());    // T2=Z1.X2
+
+    FP2_sub(AA, AA, BB);        //X1.sub(T2);
+    FP2_norm(AA);               //X1.norm();  // X1=X1-Z1.X2
+    FP2_sub(CC, CC, &T1);       //Y1.sub(T1);
+    FP2_norm(CC);               //Y1.norm();  // Y1=Y1-Z1.Y2
+
+    FP2_copy(&T1, AA);          //T1.copy(X1);            // T1=X1-Z1.X2
+
+#if SEXTIC_TWIST_ZZZ==M_TYPE
+    FP2_mul_ip(AA);
+    FP2_norm(AA);
+#endif
+
+    FP2_mul(&T1, &T1, &(B->y)); //T1.mul(B.gety());       // T1=(X1-Z1.X2).Y2
+
+    FP2_copy(BB, CC);           //T2.copy(Y1);            // T2=Y1-Z1.Y2
+    FP2_mul(BB, BB, &(B->x));   //T2.mul(B.getx());       // T2=(Y1-Z1.Y2).X2
+    FP2_sub(BB, BB, &T1);       //T2.sub(T1);
+    FP2_norm(BB);               //T2.norm();          // T2=(Y1-Z1.Y2).X2 - (X1-Z1.X2).Y2
+
+    FP2_neg(CC, CC);            //Y1.neg();
+    FP2_norm(CC);               //Y1.norm(); // Y1=-(Y1-Z1.Y2).Xs                - ***
+
+    ECP2_add(A, B);             //A.add(B);
+}
+
+/* Line function */
+static void ZZZ::PAIR_line(FP12 *v, ECP2 *A, ECP2 *B, FP *Qx, FP *Qy)
+{
+    FP2 AA, BB, CC;
+    FP4 a, b, c;
+
+    if (A == B)
+        PAIR_double(A, &AA, &BB, &CC);
+    else
+        PAIR_add(A, B, &AA, &BB, &CC);
+
+    FP2_pmul(&CC, &CC, Qx);
+    FP2_pmul(&AA, &AA, Qy);
+
+    FP4_from_FP2s(&a, &AA, &BB);
+#if SEXTIC_TWIST_ZZZ==D_TYPE
+    FP4_from_FP2(&b, &CC);
+    FP4_zero(&c);
+#endif
+#if SEXTIC_TWIST_ZZZ==M_TYPE
+    FP4_zero(&b);
+    FP4_from_FP2H(&c, &CC);
+#endif
+
+    FP12_from_FP4s(v, &a, &b, &c);
+    v->type = FP_SPARSER;
+}
+
+/* prepare ate parameter, n=6u+2 (BN) or n=u (BLS), n3=3*n */
+int ZZZ::PAIR_nbits(BIG n3, BIG n)
+{
+    BIG x;
+    BIG_rcopy(x, CURVE_Bnx);
+
+#if PAIRING_FRIENDLY_ZZZ==BN_CURVE
+    BIG_pmul(n, x, 6);
+#if SIGN_OF_X_ZZZ==POSITIVEX
+    BIG_inc(n, 2);
+#else
+    BIG_dec(n, 2);
+#endif
+
+#else
+    BIG_copy(n, x);
+#endif
+
+    BIG_norm(n);
+    BIG_pmul(n3, n, 3);
+    BIG_norm(n3);
+
+    return BIG_nbits(n3);
+}
+
+/*
+    For multi-pairing, product of n pairings
+    1. Declare FP12 array of length number of bits in Ate parameter
+    2. Initialise this array by calling PAIR_initmp()
+    3. Accumulate each pairing by calling PAIR_another() n times
+    4. Call PAIR_miller()
+    5. Call final exponentiation PAIR_fexp()
+*/
+
+/* prepare for multi-pairing */
+void ZZZ::PAIR_initmp(FP12 r[])
+{
+    int i;
+    for (i = ATE_BITS_ZZZ - 1; i >= 0; i--)
+        FP12_one(&r[i]);
+    return;
+}
+
+/* basic Miller loop */
+void ZZZ::PAIR_miller(FP12 *res, FP12 r[])
+{
+    int i;
+    FP12_one(res);
+    for (i = ATE_BITS_ZZZ - 1; i >= 1; i--)
+    {
+        FP12_sqr(res, res);
+        FP12_ssmul(res, &r[i]);
+        FP12_zero(&r[i]);
+    }
+
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    FP12_conj(res, res);
+#endif
+    FP12_ssmul(res, &r[0]);
+    FP12_zero(&r[0]);
+    return;
+}
+
+// Store precomputed line details in an FP4
+static void ZZZ::PAIR_pack(FP4 *T, FP2* AA, FP2* BB, FP2 *CC)
+{
+    FP2 I, A, B;
+    FP2_inv(&I, CC, NULL);
+    FP2_mul(&A, AA, &I);
+    FP2_mul(&B, BB, &I);
+    FP4_from_FP2s(T, &A, &B);
+}
+
+// Unpack G2 line function details and include G1
+static void ZZZ::PAIR_unpack(FP12 *v, FP4* T, FP *Qx, FP *Qy)
+{
+    FP4 a, b, c;
+    FP2 t;
+    FP4_copy(&a, T);
+    FP2_pmul(&a.a, &a.a, Qy);
+    FP2_from_FP(&t, Qx);
+
+#if SEXTIC_TWIST_ZZZ==D_TYPE
+    FP4_from_FP2(&b, &t);
+    FP4_zero(&c);
+#endif
+#if SEXTIC_TWIST_ZZZ==M_TYPE
+    FP4_zero(&b);
+    FP4_from_FP2H(&c, &t);
+#endif
+
+    FP12_from_FP4s(v, &a, &b, &c);
+    v->type = FP_SPARSEST;
+}
+
+// Precompute table of line functions for fixed G2 value
+void ZZZ::PAIR_precomp(FP4 T[], ECP2* GV)
+{
+    int i, j, nb, bt;
+    BIG n, n3;
+    FP2 AA, BB, CC;
+    ECP2 A, G, NG;
+#if PAIRING_FRIENDLY_ZZZ==BN_CURVE
+    ECP2 K;
+    FP2 X;
+    FP Qx, Qy;
+    FP_rcopy(&Qx, Fra);
+    FP_rcopy(&Qy, Frb);
+    FP2_from_FPs(&X, &Qx, &Qy);
+#if SEXTIC_TWIST_ZZZ==M_TYPE
+    FP2_inv(&X, &X, NULL);
+    FP2_norm(&X);
+#endif
+#endif
+
+    ECP2_copy(&A, GV);
+    ECP2_copy(&G, GV);
+    ECP2_copy(&NG, GV);
+    ECP2_neg(&NG);
+
+    nb = PAIR_nbits(n3, n);
+    j = 0;
+
+    for (i = nb - 2; i >= 1; i--)
+    {
+        PAIR_double(&A, &AA, &BB, &CC);
+        PAIR_pack(&T[j++], &AA, &BB, &CC);
+
+        bt = BIG_bit(n3, i) - BIG_bit(n, i); // bt=BIG_bit(n,i);
+        if (bt == 1)
+        {
+            PAIR_add(&A, &G, &AA, &BB, &CC);
+            PAIR_pack(&T[j++], &AA, &BB, &CC);
+        }
+        if (bt == -1)
+        {
+            PAIR_add(&A, &NG, &AA, &BB, &CC);
+            PAIR_pack(&T[j++], &AA, &BB, &CC);
+        }
+    }
+#if PAIRING_FRIENDLY_ZZZ==BN_CURVE
+
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    ECP2_neg(&A);
+#endif
+
+    ECP2_copy(&K, &G);
+    ECP2_frob(&K, &X);
+    PAIR_add(&A, &K, &AA, &BB, &CC);
+    PAIR_pack(&T[j++], &AA, &BB, &CC);
+    ECP2_frob(&K, &X);
+    ECP2_neg(&K);
+    PAIR_add(&A, &K, &AA, &BB, &CC);
+    PAIR_pack(&T[j++], &AA, &BB, &CC);
+
+#endif
+
+}
+
+/* Accumulate another set of line functions for n-pairing, assuming precomputation on G2 */
+void ZZZ::PAIR_another_pc(FP12 r[], FP4 T[], ECP *QV)
+{
+    int i, j, nb, bt;
+    BIG n, n3;
+    FP12 lv, lv2;
+    ECP Q;
+    FP Qx, Qy;
+
+    if (ECP_isinf(QV)) return;
+
+    nb = PAIR_nbits(n3, n);
+
+    ECP_copy(&Q, QV);
+    ECP_affine(&Q);
+
+    FP_copy(&Qx, &(Q.x));
+    FP_copy(&Qy, &(Q.y));
+
+    j = 0;
+    for (i = nb - 2; i >= 1; i--)
+    {
+        PAIR_unpack(&lv, &T[j++], &Qx, &Qy);
+
+        bt = BIG_bit(n3, i) - BIG_bit(n, i); // bt=BIG_bit(n,i);
+        if (bt == 1)
+        {
+            PAIR_unpack(&lv2, &T[j++], &Qx, &Qy);
+            FP12_smul(&lv, &lv2);
+        }
+        if (bt == -1)
+        {
+            PAIR_unpack(&lv2, &T[j++], &Qx, &Qy);
+            FP12_smul(&lv, &lv2);
+        }
+        FP12_ssmul(&r[i], &lv);
+    }
+
+#if PAIRING_FRIENDLY_ZZZ==BN_CURVE
+    PAIR_unpack(&lv, &T[j++], &Qx, &Qy);
+    PAIR_unpack(&lv2, &T[j++], &Qx, &Qy);
+    FP12_smul(&lv, &lv2);
+    FP12_ssmul(&r[0], &lv);
+#endif
+}
+
+/* Accumulate another set of line functions for n-pairing */
+void ZZZ::PAIR_another(FP12 r[], ECP2* PV, ECP* QV)
+{
+    int i, nb, bt;
+    BIG n, n3;
+    FP12 lv, lv2;
+    ECP2 A, NP, P;
+    ECP Q;
+    FP Qx, Qy;
+#if PAIRING_FRIENDLY_ZZZ==BN_CURVE
+    ECP2 K;
+    FP2 X;
+    FP_rcopy(&Qx, Fra);
+    FP_rcopy(&Qy, Frb);
+    FP2_from_FPs(&X, &Qx, &Qy);
+#if SEXTIC_TWIST_ZZZ==M_TYPE
+    FP2_inv(&X, &X, NULL);
+    FP2_norm(&X);
+#endif
+#endif
+
+    if (ECP_isinf(QV)) return;
+
+    nb = PAIR_nbits(n3, n);
+
+    ECP2_copy(&P, PV);
+    ECP_copy(&Q, QV);
+
+    ECP2_affine(&P);
+    ECP_affine(&Q);
+
+    FP_copy(&Qx, &(Q.x));
+    FP_copy(&Qy, &(Q.y));
+
+    ECP2_copy(&A, &P);
+    ECP2_copy(&NP, &P); ECP2_neg(&NP);
+
+    for (i = nb - 2; i >= 1; i--)
+    {
+        PAIR_line(&lv, &A, &A, &Qx, &Qy);
+
+        bt = BIG_bit(n3, i) - BIG_bit(n, i); // bt=BIG_bit(n,i);
+        if (bt == 1)
+        {
+            PAIR_line(&lv2, &A, &P, &Qx, &Qy);
+            FP12_smul(&lv, &lv2);
+        }
+        if (bt == -1)
+        {
+            PAIR_line(&lv2, &A, &NP, &Qx, &Qy);
+            FP12_smul(&lv, &lv2);
+        }
+        FP12_ssmul(&r[i], &lv);
+    }
+
+#if PAIRING_FRIENDLY_ZZZ==BN_CURVE
+
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    ECP2_neg(&A);
+#endif
+
+    ECP2_copy(&K, &P);
+    ECP2_frob(&K, &X);
+    PAIR_line(&lv, &A, &K, &Qx, &Qy);
+    ECP2_frob(&K, &X);
+    ECP2_neg(&K);
+    PAIR_line(&lv2, &A, &K, &Qx, &Qy);
+    FP12_smul(&lv, &lv2);
+    FP12_ssmul(&r[0], &lv);
+
+#endif
+}
+
+/* Optimal single R-ate pairing r=e(P,Q) */
+void ZZZ::PAIR_ate(FP12 *r, ECP2 *P1, ECP *Q1)
+{
+    BIG n, n3;
+    FP Qx, Qy;
+    int i, nb, bt;
+    ECP2 A, NP, P;
+    ECP Q;
+    FP12 lv, lv2;
+#if PAIRING_FRIENDLY_ZZZ==BN_CURVE
+    ECP2 KA;
+    FP2 X;
+
+    FP_rcopy(&Qx, Fra);
+    FP_rcopy(&Qy, Frb);
+    FP2_from_FPs(&X, &Qx, &Qy);
+
+#if SEXTIC_TWIST_ZZZ==M_TYPE
+    FP2_inv(&X, &X, NULL);
+    FP2_norm(&X);
+#endif
+
+#endif
+
+    FP12_one(r);
+    if (ECP_isinf(Q1)) return;
+
+    nb = PAIR_nbits(n3, n);
+
+    ECP2_copy(&P, P1);
+    ECP_copy(&Q, Q1);
+
+    ECP2_affine(&P);
+    ECP_affine(&Q);
+
+    FP_copy(&Qx, &(Q.x));
+    FP_copy(&Qy, &(Q.y));
+
+    ECP2_copy(&A, &P);
+    ECP2_copy(&NP, &P); ECP2_neg(&NP);
+
+    /* Main Miller Loop */
+    for (i = nb - 2; i >= 1; i--)
+    {
+        FP12_sqr(r, r);
+        PAIR_line(&lv, &A, &A, &Qx, &Qy);
+
+        bt = BIG_bit(n3, i) - BIG_bit(n, i); // bt=BIG_bit(n,i);
+        if (bt == 1)
+        {
+            PAIR_line(&lv2, &A, &P, &Qx, &Qy);
+            FP12_smul(&lv, &lv2);
+        }
+        if (bt == -1)
+        {
+            PAIR_line(&lv2, &A, &NP, &Qx, &Qy);
+            FP12_smul(&lv, &lv2);
+        }
+        FP12_ssmul(r, &lv);
+    }
+
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    FP12_conj(r, r);
+#endif
+
+    /* R-ate fixup required for BN curves */
+#if PAIRING_FRIENDLY_ZZZ==BN_CURVE
+
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    ECP2_neg(&A);
+#endif
+
+    ECP2_copy(&KA, &P);
+    ECP2_frob(&KA, &X);
+    PAIR_line(&lv, &A, &KA, &Qx, &Qy);
+    ECP2_frob(&KA, &X);
+    ECP2_neg(&KA);
+    PAIR_line(&lv2, &A, &KA, &Qx, &Qy);
+    FP12_smul(&lv, &lv2);
+    FP12_ssmul(r, &lv);
+#endif
+}
+
+/* Optimal R-ate double pairing e(P,Q).e(R,S) */
+void ZZZ::PAIR_double_ate(FP12 *r, ECP2 *P1, ECP *Q1, ECP2 *R1, ECP *S1)
+{
+
+    BIG n, n3;
+    FP Qx, Qy, Sx, Sy;
+    int i, nb, bt;
+    ECP2 A, B, NP, NR, P, R;
+    ECP Q, S;
+    FP12 lv, lv2;
+#if PAIRING_FRIENDLY_ZZZ==BN_CURVE
+    ECP2 K;
+    FP2 X;
+
+    FP_rcopy(&Qx, Fra);
+    FP_rcopy(&Qy, Frb);
+    FP2_from_FPs(&X, &Qx, &Qy);
+
+#if SEXTIC_TWIST_ZZZ==M_TYPE
+    FP2_inv(&X, &X, NULL);
+    FP2_norm(&X);
+#endif
+
+#endif
+
+    if (ECP_isinf(Q1))
+    {
+        PAIR_ate(r, R1, S1);
+        return;
+    }
+    if (ECP_isinf(S1))
+    {
+        PAIR_ate(r, P1, Q1);
+        return;
+    }
+
+    nb = PAIR_nbits(n3, n);
+
+    ECP2_copy(&P, P1);
+    ECP_copy(&Q, Q1);
+
+    ECP2_affine(&P);
+    ECP_affine(&Q);
+
+    ECP2_copy(&R, R1);
+    ECP_copy(&S, S1);
+
+    ECP2_affine(&R);
+    ECP_affine(&S);
+
+    FP_copy(&Qx, &(Q.x));
+    FP_copy(&Qy, &(Q.y));
+
+    FP_copy(&Sx, &(S.x));
+    FP_copy(&Sy, &(S.y));
+
+    ECP2_copy(&A, &P);
+    ECP2_copy(&B, &R);
+
+    ECP2_copy(&NP, &P); ECP2_neg(&NP);
+    ECP2_copy(&NR, &R); ECP2_neg(&NR);
+
+    FP12_one(r);
+
+    /* Main Miller Loop */
+    for (i = nb - 2; i >= 1; i--)
+    {
+        FP12_sqr(r, r);
+        PAIR_line(&lv, &A, &A, &Qx, &Qy);
+        PAIR_line(&lv2, &B, &B, &Sx, &Sy);
+        FP12_smul(&lv, &lv2);
+        FP12_ssmul(r, &lv);
+
+        bt = BIG_bit(n3, i) - BIG_bit(n, i); // bt=BIG_bit(n,i);
+        if (bt == 1)
+        {
+            PAIR_line(&lv, &A, &P, &Qx, &Qy);
+            PAIR_line(&lv2, &B, &R, &Sx, &Sy);
+            FP12_smul(&lv, &lv2);
+            FP12_ssmul(r, &lv);
+        }
+        if (bt == -1)
+        {
+            PAIR_line(&lv, &A, &NP, &Qx, &Qy);
+            PAIR_line(&lv2, &B, &NR, &Sx, &Sy);
+            FP12_smul(&lv, &lv2);
+            FP12_ssmul(r, &lv);
+        }
+    }
+
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    FP12_conj(r, r);
+#endif
+    /* R-ate fixup required for BN curves */
+#if PAIRING_FRIENDLY_ZZZ==BN_CURVE
+
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    ECP2_neg(&A);
+    ECP2_neg(&B);
+#endif
+
+    ECP2_copy(&K, &P);
+    ECP2_frob(&K, &X);
+    PAIR_line(&lv, &A, &K, &Qx, &Qy);
+    ECP2_frob(&K, &X);
+    ECP2_neg(&K);
+    PAIR_line(&lv2, &A, &K, &Qx, &Qy);
+    FP12_smul(&lv, &lv2);
+    FP12_ssmul(r, &lv);
+
+    ECP2_copy(&K, &R);
+    ECP2_frob(&K, &X);
+    PAIR_line(&lv, &B, &K, &Sx, &Sy);
+    ECP2_frob(&K, &X);
+    ECP2_neg(&K);
+    PAIR_line(&lv2, &B, &K, &Sx, &Sy);
+    FP12_smul(&lv, &lv2);
+    FP12_ssmul(r, &lv);
+#endif
+}
+
+/* final exponentiation - keep separate for multi-pairings and to avoid thrashing stack */
+void ZZZ::PAIR_fexp(FP12 *r)
+{
+    FP2 X;
+    BIG x;
+    FP a, b;
+    FP12 t0, y0, y1;
+#if PAIRING_FRIENDLY_ZZZ==BN_CURVE
+    FP12 y2, y3;
+#endif
+    BIG_rcopy(x, CURVE_Bnx);
+    FP_rcopy(&a, Fra);
+    FP_rcopy(&b, Frb);
+    FP2_from_FPs(&X, &a, &b);
+
+    /* Easy part of final exp */
+
+    FP12_inv(&t0, r);
+    FP12_conj(r, r);
+
+    FP12_mul(r, &t0);
+    FP12_copy(&t0, r);
+
+    FP12_frob(r, &X);
+    FP12_frob(r, &X);
+    FP12_mul(r, &t0);
+
+    /* Hard part of final exp - see Duquesne & Ghamman eprint 2015/192.pdf */
+#if PAIRING_FRIENDLY_ZZZ==BN_CURVE
+    FP12_pow(&t0, r, x); // t0=f^-u
+#if SIGN_OF_X_ZZZ==POSITIVEX
+    FP12_conj(&t0, &t0);
+#endif
+    FP12_usqr(&y3, &t0); // y3=t0^2
+    FP12_copy(&y0, &t0);
+    FP12_mul(&y0, &y3); // y0=t0*y3
+    FP12_copy(&y2, &y3);
+    FP12_frob(&y2, &X); // y2=y3^p
+    FP12_mul(&y2, &y3); //y2=y2*y3
+    FP12_usqr(&y2, &y2); //y2=y2^2
+    FP12_mul(&y2, &y3); // y2=y2*y3
+
+    FP12_pow(&t0, &y0, x); //t0=y0^-u
+#if SIGN_OF_X_ZZZ==POSITIVEX
+    FP12_conj(&t0, &t0);
+#endif
+    FP12_conj(&y0, r);    //y0=~r
+    FP12_copy(&y1, &t0);
+    FP12_frob(&y1, &X);
+    FP12_frob(&y1, &X); //y1=t0^p^2
+    FP12_mul(&y1, &y0); // y1=y0*y1
+    FP12_conj(&t0, &t0); // t0=~t0
+    FP12_copy(&y3, &t0);
+    FP12_frob(&y3, &X); //y3=t0^p
+    FP12_mul(&y3, &t0); // y3=t0*y3
+    FP12_usqr(&t0, &t0); // t0=t0^2
+    FP12_mul(&y1, &t0); // y1=t0*y1
+
+    FP12_pow(&t0, &y3, x); // t0=y3^-u
+#if SIGN_OF_X_ZZZ==POSITIVEX
+    FP12_conj(&t0, &t0);
+#endif
+    FP12_usqr(&t0, &t0); //t0=t0^2
+    FP12_conj(&t0, &t0); //t0=~t0
+    FP12_mul(&y3, &t0); // y3=t0*y3
+
+    FP12_frob(r, &X);
+    FP12_copy(&y0, r);
+    FP12_frob(r, &X);
+    FP12_mul(&y0, r);
+    FP12_frob(r, &X);
+    FP12_mul(&y0, r);
+
+    FP12_usqr(r, &y3); //r=y3^2
+    FP12_mul(r, &y2);  //r=y2*r
+    FP12_copy(&y3, r);
+    FP12_mul(&y3, &y0); // y3=r*y0
+    FP12_mul(r, &y1); // r=r*y1
+    FP12_usqr(r, r); // r=r^2
+    FP12_mul(r, &y3); // r=r*y3
+    FP12_reduce(r);
+#else
+ 
+// See https://eprint.iacr.org/2020/875.pdf
+    FP12_usqr(&y1,r);
+    FP12_mul(&y1,r);     // y1=r^3
+
+    FP12_pow(&y0,r,x);   // y0=r^x
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    FP12_conj(&y0, &y0);
+#endif
+    FP12_conj(&t0,r);    // t0=r^-1
+    FP12_copy(r,&y0);
+    FP12_mul(r,&t0);    // r=r^(x-1)
+
+    FP12_pow(&y0,r,x);   // y0=r^x
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    FP12_conj(&y0, &y0);
+#endif
+    FP12_conj(&t0,r);    // t0=r^-1
+    FP12_copy(r,&y0);
+    FP12_mul(r,&t0);    // r=r^(x-1)
+
+// ^(x+p)
+    FP12_pow(&y0,r,x);  // y0=r^x
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    FP12_conj(&y0, &y0);
+#endif
+    FP12_copy(&t0,r);   
+    FP12_frob(&t0,&X); // t0=r^p
+    FP12_copy(r,&y0);
+    FP12_mul(r,&t0); // r=r^x.r^p
+
+// ^(x^2+p^2-1)
+    FP12_pow(&y0,r,x);  
+    FP12_pow(&y0,&y0,x); // y0=r^x^2
+    FP12_copy(&t0,r);    
+    FP12_frob(&t0,&X);
+    FP12_frob(&t0,&X);   // t0=r^p^2
+    FP12_mul(&y0,&t0);   // y0=r^x^2.r^p^2
+    FP12_conj(&t0,r);    // t0=r^-1
+    FP12_copy(r,&y0);    // 
+    FP12_mul(r,&t0);     // r=r^x^2.r^p^2.r^-1
+
+    FP12_mul(r,&y1);    
+    FP12_reduce(r);
+#endif
+}
+
+#ifdef USE_GLV_ZZZ
+/* GLV method */
+static void ZZZ::glv(BIG u[2], BIG ee)
+{
+    BIG q;
+    BIG_rcopy(q, CURVE_Order);
+#if PAIRING_FRIENDLY_ZZZ==BN_CURVE
+    int i, j;
+    BIG v[2], t;
+    DBIG d;
+
+    for (i = 0; i < 2; i++)
+    {
+        BIG_rcopy(t, CURVE_W[i]);
+        BIG_mul(d, t, ee);
+        BIG_ctddiv(v[i],d,q,BIG_nbits(t));
+        BIG_zero(u[i]);
+    }
+    BIG_copy(u[0], ee);
+    for (i = 0; i < 2; i++)
+        for (j = 0; j < 2; j++)
+        {
+            BIG_rcopy(t, CURVE_SB[j][i]);
+            BIG_modmul(t, v[j], t, q);
+            BIG_add(u[i], u[i], q);
+            BIG_sub(u[i], u[i], t);
+            BIG_ctmod(u[i],q,1);
+        }
+
+    //BIG x, x2;
+    //BIG_rcopy(x, CURVE_Bnx);
+    //BIG_smul(x2, x, x);
+    //BIG_imul(x2,x2,6);
+    //printf("bits(6x^2) = %d \n",BIG_nbits(x2));
+
+#else
+// -(x^2).P = (Beta.x,y)
+    int bd;
+    BIG x, x2;
+    BIG_rcopy(x, CURVE_Bnx);
+
+    BIG_smul(x2, x, x);
+    bd=BIG_nbits(q)-BIG_nbits(x2); // fixed
+    BIG_copy(u[0], ee);
+    BIG_ctmod(u[0], x2, bd);
+    BIG_copy(u[1], ee);
+    BIG_ctsdiv(u[1], x2, bd);
+
+    BIG_sub(u[1], q, u[1]);
+
+#endif
+
+    return;
+}
+#endif // USE_GLV
+
+/* Galbraith & Scott Method */
+static void ZZZ::gs(BIG u[4], BIG ee)
+{
+    int i;
+    BIG q;
+    BIG_rcopy(q, CURVE_Order);
+
+#if PAIRING_FRIENDLY_ZZZ==BN_CURVE
+    int j;
+    BIG v[4], t;
+    DBIG d;
+
+    for (i = 0; i < 4; i++)
+    {
+        BIG_rcopy(t, CURVE_WB[i]);
+        BIG_mul(d, t, ee);
+        BIG_ctddiv(v[i],d,q,BIG_nbits(t));
+        BIG_zero(u[i]);
+    }
+
+    BIG_copy(u[0], ee);
+    for (i = 0; i < 4; i++)
+        for (j = 0; j < 4; j++)
+        {
+            BIG_rcopy(t, CURVE_BB[j][i]);
+            BIG_modmul(t, v[j], t, q);
+            BIG_add(u[i], u[i], q);
+            BIG_sub(u[i], u[i], t);
+            BIG_ctmod(u[i],q,1);
+        }
+
+    //BIG x;
+    //BIG_rcopy(x, CURVE_Bnx);
+    //BIG_imul(x,x,3);
+    //printf("bits(3x) = %d \n",BIG_nbits(x));
+
+#else
+    int bd;
+    BIG x, w;
+
+    BIG_rcopy(x, CURVE_Bnx);
+    BIG_copy(w, ee);
+    bd=BIG_nbits(q)-BIG_nbits(x); // fixed
+
+    for (i = 0; i < 3; i++)
+    {
+        BIG_copy(u[i], w);
+        BIG_ctmod(u[i],x,bd);
+        BIG_ctsdiv(w,x,bd);
+    }
+    BIG_copy(u[3], w);
+
+    /*  */
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    BIG_modneg(u[1], u[1], q);
+    BIG_modneg(u[3], u[3], q);
+#endif
+
+#endif
+    return;
+}
+
+/* Multiply P by e in group G1 */
+void ZZZ::PAIR_G1mul(ECP *P, BIG e)
+{
+    BIG ee,q;
+    BIG_copy(ee,e);
+    BIG_rcopy(q, CURVE_Order);
+    BIG_mod(ee,q);
+#ifdef USE_GLV_ZZZ   /* Note this method is patented */
+    int np, nn;
+    ECP Q;
+    FP cru;
+    BIG t;
+    BIG u[2];
+    glv(u, ee);
+
+    ECP_copy(&Q, P); ECP_affine(&Q);
+    FP_rcopy(&cru, CRu);
+    FP_mul(&(Q.x), &(Q.x), &cru);
+
+    /* note that -a.B = a.(-B). Use a or -a depending on which is smaller */
+
+    np = BIG_nbits(u[0]);
+    BIG_modneg(t, u[0], q);
+    nn = BIG_nbits(t);
+    if (nn < np)
+    {
+        BIG_copy(u[0], t);
+        ECP_neg(P);
+    }
+
+    np = BIG_nbits(u[1]);
+    BIG_modneg(t, u[1], q);
+    nn = BIG_nbits(t);
+    if (nn < np)
+    {
+        BIG_copy(u[1], t);
+        ECP_neg(&Q);
+    }
+    BIG_norm(u[0]);
+    BIG_norm(u[1]);
+    ECP_mul2(P, &Q, u[0], u[1]);
+
+    //printf("nbits(q) = %d\n",BIG_nbits(q));
+    //printf("nbits(q)/2 = %d\n",BIG_nbits(q)/2);
+    //printf("u[0] %d = ",BIG_nbits(u[0]));BIG_output(u[0]); printf("\n");
+    //printf("u[1] %d = ",BIG_nbits(u[1]));BIG_output(u[1]); printf("\n");
+#else
+    ECP_clmul(P, ee, q);
+#endif
+}
+
+/* Multiply P by e in group G2 */
+void ZZZ::PAIR_G2mul(ECP2 *P, BIG e)
+{
+    BIG ee,q;
+    BIG_copy(ee,e);
+    BIG_rcopy(q, CURVE_Order);
+    BIG_mod(ee,q);
+#ifdef USE_GS_G2_ZZZ   /* Well I didn't patent it :) */
+    int i, np, nn;
+    ECP2 Q[4];
+    FP2 X;
+    FP fx, fy;
+    BIG x, u[4];
+
+    FP_rcopy(&fx, Fra);
+    FP_rcopy(&fy, Frb);
+    FP2_from_FPs(&X, &fx, &fy);
+
+#if SEXTIC_TWIST_ZZZ==M_TYPE
+    FP2_inv(&X, &X, NULL);
+    FP2_norm(&X);
+#endif
+
+    gs(u, ee);
+
+    ECP2_copy(&Q[0], P);
+    for (i = 1; i < 4; i++)
+    {
+        ECP2_copy(&Q[i], &Q[i - 1]);
+        ECP2_frob(&Q[i], &X);
+    }
+
+    for (i = 0; i < 4; i++)
+    {
+        np = BIG_nbits(u[i]);
+        BIG_modneg(x, u[i], q);
+        nn = BIG_nbits(x);
+        if (nn < np)
+        {
+            BIG_copy(u[i], x);
+            ECP2_neg(&Q[i]);
+        }
+        BIG_norm(u[i]);
+    }
+    ECP2_mul4(P, Q, u);
+
+    //printf("nbits(q) = %d\n",BIG_nbits(q));
+    //printf("nbits(q)/4 = %d\n",BIG_nbits(q)/4);
+    //printf("u[0] %d = ",BIG_nbits(u[0]));BIG_output(u[0]); printf("\n");
+    //printf("u[1] %d = ",BIG_nbits(u[1]));BIG_output(u[1]); printf("\n");
+    //printf("u[2] %d = ",BIG_nbits(u[2]));BIG_output(u[2]); printf("\n");
+    //printf("u[3] %d = ",BIG_nbits(u[3]));BIG_output(u[3]); printf("\n");
+
+
+#else
+    ECP2_mul(P, ee);
+#endif
+}
+
+/* f=f^e */
+void ZZZ::PAIR_GTpow(FP12 *f, BIG e)
+{
+    BIG ee,q;
+    BIG_copy(ee,e);
+    BIG_rcopy(q, CURVE_Order);
+    BIG_mod(ee,q);
+#ifdef USE_GS_GT_ZZZ   /* Note that this option requires a lot of RAM! Maybe better to use compressed XTR method, see fp4.c */
+    int i, np, nn;
+    FP12 g[4];
+    FP2 X;
+    BIG t;
+    FP fx, fy;
+    BIG u[4];
+
+    FP_rcopy(&fx, Fra);
+    FP_rcopy(&fy, Frb);
+    FP2_from_FPs(&X, &fx, &fy);
+
+    gs(u, ee);
+
+    FP12_copy(&g[0], f);
+    for (i = 1; i < 4; i++)
+    {
+        FP12_copy(&g[i], &g[i - 1]);
+        FP12_frob(&g[i], &X);
+    }
+
+    for (i = 0; i < 4; i++)
+    {
+        np = BIG_nbits(u[i]);
+        BIG_modneg(t, u[i], q);
+        nn = BIG_nbits(t);
+        if (nn < np)
+        {
+            BIG_copy(u[i], t);
+            FP12_conj(&g[i], &g[i]);
+        }
+        BIG_norm(u[i]);
+    }
+    FP12_pow4(f, g, u);
+
+#else
+    FP12_pow(f, f, ee);
+#endif
+}
+
+/* test G1 group membership */
+
+int ZZZ::PAIR_G1member(ECP *P)
+{
+    ECP W,T;
+    BIG x;
+    FP cru;
+    if (ECP_isinf(P)) return 0;
+#if PAIRING_FRIENDLY_ZZZ!=BN_CURVE
+    BIG_rcopy(x, CURVE_Bnx);
+    ECP_copy(&W,P);
+    ECP_copy(&T,P);
+    ECP_mul(&T,x);
+    if (ECP_equals(P,&T)) return 0;    // P is of low order
+    ECP_mul(&T,x);
+    ECP_neg(&T);
+
+    FP_rcopy(&cru, CRu);
+    FP_mul(&(W.x), &(W.x), &cru);
+    if (!ECP_equals(&W,&T)) return 0;  // check that Endomorphism works
+
+// Not needed
+//    ECP_add(&W,P);
+//    FP_mul(&(T.x), &(T.x), &cru);
+//    ECP_add(&W,&T);
+//    if (!ECP_isinf(&W)) return 0;      // use it to check order
+/*
+    BIG_rcopy(q, CURVE_Order);
+	ECP_copy(&W,P);
+	ECP_mul(&W,q);
+	if (!ECP_isinf(&W)) return 0; */
+#endif
+	return 1; 
+}
+
+/* test G2 group membership */
+int ZZZ::PAIR_G2member(ECP2 *P)
+{
+    ECP2 W,T;
+    BIG x;
+    FP2 X;
+    FP fx, fy;
+
+    if (ECP2_isinf(P)) return 0;
+    FP_rcopy(&fx, Fra);
+    FP_rcopy(&fy, Frb);
+    FP2_from_FPs(&X, &fx, &fy);
+#if SEXTIC_TWIST_ZZZ==M_TYPE
+    FP2_inv(&X, &X, NULL);
+    FP2_norm(&X);
+#endif
+    BIG_rcopy(x, CURVE_Bnx);
+
+    ECP2_copy(&T,P);
+    ECP2_mul(&T,x);
+
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    ECP2_neg(&T);
+#endif
+
+#if PAIRING_FRIENDLY_ZZZ==BN_CURVE
+//https://eprint.iacr.org/2022/348.pdf
+    ECP2_copy(&W,&T);
+    ECP2_frob(&W,&X); // W=\psi(xP)
+    ECP2_add(&T,P); // T=xP+P
+    ECP2_add(&T,&W); // T=xP+P+\psi(xP)
+    ECP2_frob(&W,&X); // W=\psi^2(xP)
+    ECP2_add(&T,&W); // T=xp+P+\psi(xP)+\psi^2(xP)
+    ECP2_frob(&W,&X); // W=\psi^3(xP)
+    ECP2_dbl(&W); // W=\psi^3(2xP)
+#else
+//https://eprint.iacr.org/2021/1130
+    ECP2_copy(&W,P);
+    ECP2_frob(&W, &X);    // W=\psi(P)    
+#endif
+
+    if (ECP2_equals(&W,&T)) return 1;
+    return 0;
+}
+
+/* Check that m is in cyclotomic sub-group */
+/* Check that m!=1, conj(m)*m==1, and m.m^{p^4}=m^{p^2} */
+int ZZZ::PAIR_GTcyclotomic(FP12 *m)
+{
+	FP fx,fy;
+	FP2 X;
+	FP12 r,w;
+	if (FP12_isunity(m)) return 0;
+	FP12_conj(&r,m);
+	FP12_mul(&r,m);
+	if (!FP12_isunity(&r)) return 0;
+
+	FP_rcopy(&fx,Fra);
+	FP_rcopy(&fy,Frb);
+	FP2_from_FPs(&X,&fx,&fy);
+
+	FP12_copy(&r,m); FP12_frob(&r,&X); FP12_frob(&r,&X);
+	FP12_copy(&w,&r); FP12_frob(&w,&X); FP12_frob(&w,&X);
+	FP12_mul(&w,m);
+
+	if (!FP12_equals(&w,&r)) return 0;
+    return 1;
+}
+
+/* test for full GT group membership */
+int ZZZ::PAIR_GTmember(FP12 *m)
+{
+    BIG x;
+    FP2 X;
+    FP fx, fy;
+    FP12 r,t;
+    if (!PAIR_GTcyclotomic(m)) return 0;
+
+    FP_rcopy(&fx, Fra);
+    FP_rcopy(&fy, Frb);
+    FP2_from_FPs(&X, &fx, &fy);
+    BIG_rcopy(x, CURVE_Bnx);
+
+    FP12_pow(&t,m,x);
+
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    FP12_conj(&t,&t);
+#endif
+
+#if PAIRING_FRIENDLY_ZZZ==BN_CURVE
+//https://eprint.iacr.org/2022/348.pdf
+    FP12_copy(&r,&t);
+    FP12_frob(&r,&X); // r=(m^x)^p
+    FP12_mul(&t,m); // t=(m^x).m
+    FP12_mul(&t,&r); // t=(m^x).m.(m^x)^p
+    FP12_frob(&r,&X); // r=(m^x)^p^2
+    FP12_mul(&t,&r); // t=(m^x).m.(m^x)^p.(m^x)^p^2
+    FP12_frob(&r,&X); // r=(m^x)^p^3
+    FP12_usqr(&r,&r); // r=(m^2x)^p^3
+#else
+//https://eprint.iacr.org/2021/1130
+    FP12_copy(&r,m);
+    FP12_frob(&r, &X);  
+#endif
+
+    if (FP12_equals(&r,&t)) return 1;
+    return 0;
+}
+
+#ifdef HAS_MAIN
+
+int main()
+{
+    int i;
+    char byt[32];
+    csprng rng;
+    BIG xa, xb, ya, yb, w, a, b, t1, q, u[2], v[4], m, r;
+    ECP2 P, G;
+    ECP Q, R;
+    FP12 g, gp;
+    FP4 t, c, cp, cpm1, cpm2;
+    FP2 x, y, X;
+
+
+    BIG_rcopy(a, CURVE_Fra);
+    BIG_rcopy(b, CURVE_Frb);
+    FP2_from_BIGs(&X, a, b);
+
+    BIG_rcopy(xa, CURVE_Gx);
+    BIG_rcopy(ya, CURVE_Gy);
+
+    ECP_set(&Q, xa, ya);
+    if (Q.inf) printf("Failed to set - point not on curve\n");
+    else printf("G1 set success\n");
+
+    printf("Q= ");
+    ECP_output(&Q);
+    printf("\n");
+
+    BIG_rcopy(xa, CURVE_Pxa);
+    BIG_rcopy(xb, CURVE_Pxb);
+    BIG_rcopy(ya, CURVE_Pya);
+    BIG_rcopy(yb, CURVE_Pyb);
+
+    FP2_from_BIGs(&x, xa, xb);
+    FP2_from_BIGs(&y, ya, yb);
+
+    ECP2_set(&P, &x, &y);
+    if (P.inf) printf("Failed to set - point not on curve\n");
+    else printf("G2 set success\n");
+
+    printf("P= ");
+    ECP2_output(&P);
+    printf("\n");
+
+    for (i = 0; i < 1000; i++ )
+    {
+        PAIR_ate(&g, &P, &Q);
+        PAIR_fexp(&g);
+    }
+    printf("g= ");
+    FP12_output(&g);
+    printf("\n");
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/pair.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/pair.h
new file mode 100644
index 0000000..e7e445f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/pair.h
@@ -0,0 +1,183 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef PAIR_ZZZ_H
+#define PAIR_ZZZ_H
+
+#include "fp12_YYY.h"
+#include "ecp2_ZZZ.h"
+#include "ecp_ZZZ.h"
+
+using namespace core;
+
+namespace ZZZ {
+/* Pairing constants */
+
+extern const XXX::BIG CURVE_Bnx; /**< BN curve x parameter */
+extern const XXX::BIG CURVE_Cru; /**< BN curve Cube Root of Unity */
+
+extern const XXX::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const XXX::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const XXX::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const XXX::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+/* Pairing function prototypes */
+
+
+/**	@brief Precompute line functions details for fixed G2 value
+ *
+	@param T array of precomputed FP4 partial line functions
+	@param GV a fixed ECP2 instance
+ */
+extern void PAIR_precomp(YYY::FP4 T[], ECP2* GV);
+
+/**	@brief Compute line functions for n-pairing
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param PV ECP2 instance, an element of G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another(YYY::FP12 r[], ECP2* PV, ECP* QV);
+
+
+/**	@brief Compute line functions for n-pairing, assuming precomputation on G2
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param T array contains precomputed partial line fucntions from G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another_pc(YYY::FP12 r[], YYY::FP4 T[], ECP *QV);
+
+
+
+/**	@brief Calculate Miller loop for Optimal ATE pairing e(P,Q)
+ *
+	@param r FP12 result of the pairing calculation e(P,Q)
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+
+ */
+extern void PAIR_ate(YYY::FP12 *r, ECP2 *P, ECP *Q);
+/**	@brief Calculate Miller loop for Optimal ATE double-pairing e(P,Q).e(R,S)
+ *
+	Faster than calculating two separate pairings
+	@param r FP12 result of the pairing calculation e(P,Q).e(R,S), an element of GT
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+	@param R ECP2 instance, an element of G2
+	@param S ECP instance, an element of G1
+ */
+extern void PAIR_double_ate(YYY::FP12 *r, ECP2 *P, ECP *Q, ECP2 *R, ECP *S);
+/**	@brief Final exponentiation of pairing, converts output of Miller loop to element in GT
+ *
+	Here p is the internal modulus, and r is the group order
+	@param x FP12, on exit = x^((p^12-1)/r)
+ */
+extern void PAIR_fexp(YYY::FP12 *x);
+/**	@brief Fast point multiplication of a member of the group G1 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param Q ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G1mul(ECP *Q, XXX::BIG b);
+/**	@brief Fast point multiplication of a member of the group G2 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param P ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G2mul(ECP2 *P, XXX::BIG b);
+
+
+
+/**	@brief Fast raising of a member of GT to a BIG power
+ *
+	May exploit endomorphism for speed.
+	@param x FP12 member of GT.
+	@param b BIG exponent
+
+ */
+extern void PAIR_GTpow(YYY::FP12 *x, XXX::BIG b);
+
+
+/**	@brief Tests ECP for membership of G1
+ *
+	@param P ECP member of G1
+	@return true or false
+
+ */
+extern int PAIR_G1member(ZZZ::ECP *P);
+
+/**	@brief Tests ECP2 for membership of G2
+ *
+	@param P ECP2 member of G2
+	@return true or false
+
+ */
+extern int PAIR_G2member(ZZZ::ECP2 *P);
+
+/**	@brief Tests FP12 for membership of cyclotomic sub-group
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTcyclotomic(YYY::FP12 *x);
+
+/**	@brief Tests FP12 for membership of GT
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTmember(YYY::FP12 *x);
+
+/**	@brief Prepare Ate parameter
+ *
+	@param n BIG parameter
+	@param n3 BIG paramter = 3*n
+	@return number of nits in n3
+
+ */
+extern int PAIR_nbits(XXX::BIG n3, XXX::BIG n);
+
+/**	@brief Initialise structure for multi-pairing
+ *
+	@param r FP12 array, to be initialised to 1
+
+ */
+extern void PAIR_initmp(YYY::FP12 r[]);
+
+
+/**	@brief Miller loop
+ *
+ 	@param res FP12 result
+	@param r FP12 precomputed array of accumulated line functions
+
+ */
+extern void PAIR_miller(YYY::FP12 *res, YYY::FP12 r[]);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/pair4.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/pair4.cpp
new file mode 100644
index 0000000..53b53e0
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/pair4.cpp
@@ -0,0 +1,1087 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* CORE BLS Curve pairing functions */
+
+//#define HAS_MAIN
+
+#include "pair4_ZZZ.h"
+
+using namespace XXX;
+using namespace YYY;
+
+namespace ZZZ {
+static void PAIR_line(FP24 *, ECP4 *, ECP4 *, FP *, FP *);
+static void PAIR_double(ECP4 *, FP4 *, FP4 *, FP4 *);
+static void PAIR_add(ECP4 *, ECP4 *B, FP4 *, FP4 *, FP4 *);
+static void PAIR_pack(FP8 *, FP4 *, FP4 *, FP4 *);
+static void PAIR_unpack(FP24 *, FP8 *, FP *, FP *);
+static void glv(BIG u[2], BIG);
+static void gs(BIG u[4], BIG);
+}
+
+
+// Point doubling for pairings
+static void ZZZ::PAIR_double(ECP4 *A, FP4 *AA, FP4 *BB, FP4 *CC)
+{
+    FP4 YY;
+    FP4_copy(CC, &(A->x));  //FP4 XX=new FP4(A.getx());  //X
+    FP4_copy(&YY, &(A->y)); //FP4 YY=new FP4(A.gety());  //Y
+    FP4_copy(BB, &(A->z));  //FP4 ZZ=new FP4(A.getz());  //Z
+
+    FP4_copy(AA, &YY);      //FP4 YZ=new FP4(YY);        //Y
+    FP4_mul(AA, AA, BB);    //YZ.mul(ZZ);                //YZ
+    FP4_sqr(CC, CC);        //XX.sqr();                //X^2
+    FP4_sqr(&YY, &YY);      //YY.sqr();                //Y^2
+    FP4_sqr(BB, BB);        //ZZ.sqr();                //Z^2
+
+    FP4_add(AA, AA, AA);
+    FP4_neg(AA, AA);
+    FP4_norm(AA);           // -2YZ
+    FP4_times_i(AA);        // -2YZi
+
+    FP4_imul(BB, BB, 3 * CURVE_B_I); //3Bz^2
+    FP4_imul(CC, CC, 3);            //3X^2
+
+#if SEXTIC_TWIST_ZZZ==D_TYPE
+    FP4_times_i(&YY);                   // Y^2.i
+    FP4_times_i(CC);                    // 3X^2.i
+#endif
+
+#if SEXTIC_TWIST_ZZZ==M_TYPE
+    FP4_times_i(BB);                    // 3Bz^2.i
+#endif
+
+    FP4_sub(BB, BB, &YY);
+    FP4_norm(BB);
+
+    ECP4_dbl(A);            //A.dbl();
+
+}
+
+// Point addition for pairings
+static void ZZZ::PAIR_add(ECP4 *A, ECP4 *B, FP4 *AA, FP4 *BB, FP4 *CC)
+{
+    FP4 T1;
+    FP4_copy(AA, &(A->x));      //FP4 X1=new FP4(A.getx());    // X1
+    FP4_copy(CC, &(A->y));      //FP4 Y1=new FP4(A.gety());    // Y1
+    FP4_copy(&T1, &(A->z));     //FP4 T1=new FP4(A.getz());    // Z1
+
+    FP4_copy(BB, &T1);          //FP4 T2=new FP4(A.getz());    // Z1
+
+    FP4_mul(&T1, &T1, &(B->y)); //T1.mul(B.gety());    // T1=Z1.Y2
+    FP4_mul(BB, BB, &(B->x));   //T2.mul(B.getx());    // T2=Z1.X2
+
+    FP4_sub(AA, AA, BB);        //X1.sub(T2);
+    FP4_norm(AA);               //X1.norm();  // X1=X1-Z1.X2
+    FP4_sub(CC, CC, &T1);       //Y1.sub(T1);
+    FP4_norm(CC);               //Y1.norm();  // Y1=Y1-Z1.Y2
+
+    FP4_copy(&T1, AA);          //T1.copy(X1);            // T1=X1-Z1.X2
+
+#if SEXTIC_TWIST_ZZZ==M_TYPE
+    FP4_times_i(AA);
+    FP4_norm(AA);
+#endif
+
+    FP4_mul(&T1, &T1, &(B->y)); //T1.mul(B.gety());       // T1=(X1-Z1.X2).Y2
+
+    FP4_copy(BB, CC);           //T2.copy(Y1);            // T2=Y1-Z1.Y2
+    FP4_mul(BB, BB, &(B->x));   //T2.mul(B.getx());       // T2=(Y1-Z1.Y2).X2
+    FP4_sub(BB, BB, &T1);       //T2.sub(T1);
+    FP4_norm(BB);               //T2.norm();          // T2=(Y1-Z1.Y2).X2 - (X1-Z1.X2).Y2
+
+    FP4_neg(CC, CC);            //Y1.neg();
+    FP4_norm(CC);               //Y1.norm(); // Y1=-(Y1-Z1.Y2).Xs                - ***
+
+    ECP4_add(A, B);             //A.add(B);
+}
+
+/* Line function */
+static void ZZZ::PAIR_line(FP24 *v, ECP4 *A, ECP4 *B, FP *Qx, FP *Qy)
+{
+    FP4 AA, BB, CC;
+    FP8 a, b, c;
+
+    if (A == B)
+        PAIR_double(A, &AA, &BB, &CC);
+    else
+        PAIR_add(A, B, &AA, &BB, &CC);
+
+    FP4_qmul(&CC, &CC, Qx);
+    FP4_qmul(&AA, &AA, Qy);
+
+    FP8_from_FP4s(&a, &AA, &BB);
+#if SEXTIC_TWIST_ZZZ==D_TYPE
+    FP8_from_FP4(&b, &CC);
+    FP8_zero(&c);
+#endif
+#if SEXTIC_TWIST_ZZZ==M_TYPE
+    FP8_zero(&b);
+    FP8_from_FP4H(&c, &CC);
+#endif
+
+    FP24_from_FP8s(v, &a, &b, &c);
+    v->type = FP_SPARSER;
+}
+
+/* prepare ate parameter, n=6u+2 (BN) or n=u (BLS), n3=3*n */
+int ZZZ::PAIR_nbits(BIG n3, BIG n)
+{
+    BIG x;
+    BIG_rcopy(x, CURVE_Bnx);
+
+    BIG_copy(n, x);
+    BIG_norm(n);
+    BIG_pmul(n3, n, 3);
+    BIG_norm(n3);
+
+    return BIG_nbits(n3);
+}
+
+/*
+    For multi-pairing, product of n pairings
+    1. Declare FP24 array of length number of bits in Ate parameter
+    2. Initialise this array by calling PAIR_initmp()
+    3. Accumulate each pairing by calling PAIR_another() n times
+    4. Call PAIR_miller()
+    5. Call final exponentiation PAIR_fexp()
+*/
+
+/* prepare for multi-pairing */
+void ZZZ::PAIR_initmp(FP24 r[])
+{
+    int i;
+    for (i = ATE_BITS_ZZZ - 1; i >= 0; i--)
+        FP24_one(&r[i]);
+    return;
+}
+
+/* basic Miller loop */
+void ZZZ::PAIR_miller(FP24 *res, FP24 r[])
+{
+    int i;
+    FP24_one(res);
+    for (i = ATE_BITS_ZZZ - 1; i >= 1; i--)
+    {
+        FP24_sqr(res, res);
+        FP24_ssmul(res, &r[i]);
+        FP24_zero(&r[i]);
+    }
+
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    FP24_conj(res, res);
+#endif
+    FP24_ssmul(res, &r[0]);
+    FP24_zero(&r[0]);
+    return;
+}
+
+
+// Store precomputed line details in an FP4
+static void ZZZ::PAIR_pack(FP8 *T, FP4* AA, FP4* BB, FP4 *CC)
+{
+    FP4 I, A, B;
+    FP4_inv(&I, CC, NULL);
+    FP4_mul(&A, AA, &I);
+    FP4_mul(&B, BB, &I);
+    FP8_from_FP4s(T, &A, &B);
+}
+
+// Unpack G2 line function details and include G1
+static void ZZZ::PAIR_unpack(FP24 *v, FP8* T, FP *Qx, FP *Qy)
+{
+    FP8 a, b, c;
+    FP4 t;
+    FP8_copy(&a, T);
+    FP4_qmul(&a.a, &a.a, Qy);
+    FP4_from_FP(&t, Qx);
+
+#if SEXTIC_TWIST_ZZZ==D_TYPE
+    FP8_from_FP4(&b, &t);
+    FP8_zero(&c);
+#endif
+#if SEXTIC_TWIST_ZZZ==M_TYPE
+    FP8_zero(&b);
+    FP8_from_FP4H(&c, &t);
+#endif
+
+    FP24_from_FP8s(v, &a, &b, &c);
+    v->type = FP_SPARSEST;
+}
+
+
+// Precompute table of line functions for fixed G2 value
+void ZZZ::PAIR_precomp(FP8 T[], ECP4* GV)
+{
+    int i, j, nb, bt;
+    BIG n, n3;
+    FP4 AA, BB, CC;
+    ECP4 A, G, NG;
+
+    ECP4_copy(&A, GV);
+    ECP4_copy(&G, GV);
+    ECP4_copy(&NG, GV);
+    ECP4_neg(&NG);
+
+    nb = PAIR_nbits(n3, n);
+    j = 0;
+
+    for (i = nb - 2; i >= 1; i--)
+    {
+        PAIR_double(&A, &AA, &BB, &CC);
+        PAIR_pack(&T[j++], &AA, &BB, &CC);
+
+        bt = BIG_bit(n3, i) - BIG_bit(n, i); // bt=BIG_bit(n,i);
+        if (bt == 1)
+        {
+            PAIR_add(&A, &G, &AA, &BB, &CC);
+            PAIR_pack(&T[j++], &AA, &BB, &CC);
+        }
+        if (bt == -1)
+        {
+            PAIR_add(&A, &NG, &AA, &BB, &CC);
+            PAIR_pack(&T[j++], &AA, &BB, &CC);
+        }
+    }
+}
+
+/* Accumulate another set of line functions for n-pairing, assuming precomputation on G2 */
+void ZZZ::PAIR_another_pc(FP24 r[], FP8 T[], ECP *QV)
+{
+    int i, j, nb, bt;
+    BIG x, n, n3;
+    FP24 lv, lv2;
+    ECP Q;
+    FP Qx, Qy;
+
+    if (ECP_isinf(QV)) return;
+
+    nb = PAIR_nbits(n3, n);
+
+    ECP_copy(&Q, QV);
+    ECP_affine(&Q);
+
+    FP_copy(&Qx, &(Q.x));
+    FP_copy(&Qy, &(Q.y));
+
+    j = 0;
+    for (i = nb - 2; i >= 1; i--)
+    {
+        PAIR_unpack(&lv, &T[j++], &Qx, &Qy);
+
+        bt = BIG_bit(n3, i) - BIG_bit(n, i); // bt=BIG_bit(n,i);
+        if (bt == 1)
+        {
+            PAIR_unpack(&lv2, &T[j++], &Qx, &Qy);
+            FP24_smul(&lv, &lv2);
+        }
+        if (bt == -1)
+        {
+            PAIR_unpack(&lv2, &T[j++], &Qx, &Qy);
+            FP24_smul(&lv, &lv2);
+        }
+        FP24_ssmul(&r[i], &lv);
+    }
+}
+
+/* Accumulate another set of line functions for n-pairing */
+void ZZZ::PAIR_another(FP24 r[], ECP4* PV, ECP* QV)
+{
+    int i, j, nb, bt;
+    BIG x, n, n3;
+    FP24 lv, lv2;
+    ECP4 A, NP, P;
+    ECP Q;
+    FP Qx, Qy;
+
+    if (ECP_isinf(QV)) return;
+
+    nb = PAIR_nbits(n3, n);
+
+    ECP4_copy(&P, PV);
+    ECP_copy(&Q, QV);
+
+    ECP4_affine(&P);
+    ECP_affine(&Q);
+
+    FP_copy(&Qx, &(Q.x));
+    FP_copy(&Qy, &(Q.y));
+
+    ECP4_copy(&A, &P);
+    ECP4_copy(&NP, &P); ECP4_neg(&NP);
+
+    for (i = nb - 2; i >= 1; i--)
+    {
+        PAIR_line(&lv, &A, &A, &Qx, &Qy);
+
+        bt = BIG_bit(n3, i) - BIG_bit(n, i); // bt=BIG_bit(n,i);
+        if (bt == 1)
+        {
+            PAIR_line(&lv2, &A, &P, &Qx, &Qy);
+            FP24_smul(&lv, &lv2);
+        }
+        if (bt == -1)
+        {
+            PAIR_line(&lv2, &A, &NP, &Qx, &Qy);
+            FP24_smul(&lv, &lv2);
+        }
+        FP24_ssmul(&r[i], &lv);
+    }
+}
+
+/* Optimal R-ate pairing r=e(P,Q) */
+void ZZZ::PAIR_ate(FP24 *r, ECP4 *P1, ECP *Q1)
+{
+    BIG x, n, n3;
+    FP Qx, Qy;
+    int i, nb, bt;
+    ECP4 A, NP, P;
+    ECP Q;
+    FP24 lv, lv2;
+
+    FP24_one(r);
+    if (ECP_isinf(Q1)) return;
+
+    nb = PAIR_nbits(n3, n);
+
+    ECP4_copy(&P, P1);
+    ECP_copy(&Q, Q1);
+
+    ECP4_affine(&P);
+    ECP_affine(&Q);
+
+    FP_copy(&Qx, &(Q.x));
+    FP_copy(&Qy, &(Q.y));
+
+    ECP4_copy(&A, &P);
+    ECP4_copy(&NP, &P); ECP4_neg(&NP);
+
+    /* Main Miller Loop */
+    for (i = nb - 2; i >= 1; i--)
+    {
+        FP24_sqr(r, r);
+        PAIR_line(&lv, &A, &A, &Qx, &Qy);
+
+        bt = BIG_bit(n3, i) - BIG_bit(n, i); // BIG_bit(n,i);
+        if (bt == 1)
+        {
+            PAIR_line(&lv2, &A, &P, &Qx, &Qy);
+            FP24_smul(&lv, &lv2);
+        }
+        if (bt == -1)
+        {
+            PAIR_line(&lv2, &A, &NP, &Qx, &Qy);
+            FP24_smul(&lv, &lv2);
+        }
+        FP24_ssmul(r, &lv);
+
+    }
+
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    FP24_conj(r, r);
+#endif
+
+}
+
+/* Optimal R-ate double pairing e(P,Q).e(R,S) */
+void ZZZ::PAIR_double_ate(FP24 *r, ECP4 *P1, ECP *Q1, ECP4 *R1, ECP *S1)
+{
+    BIG x, n, n3;
+    FP Qx, Qy, Sx, Sy;
+    int i, nb, bt;
+    ECP4 A, B, NP, NR, P, R;
+    ECP Q, S;
+    FP24 lv, lv2;
+
+    if (ECP_isinf(Q1))
+    {
+        PAIR_ate(r, R1, S1);
+        return;
+    }
+    if (ECP_isinf(S1))
+    {
+        PAIR_ate(r, P1, Q1);
+        return;
+    }
+    nb = PAIR_nbits(n3, n);
+
+    ECP4_copy(&P, P1);
+    ECP_copy(&Q, Q1);
+
+    ECP4_affine(&P);
+    ECP_affine(&Q);
+
+    ECP4_copy(&R, R1);
+    ECP_copy(&S, S1);
+
+    ECP4_affine(&R);
+    ECP_affine(&S);
+
+    FP_copy(&Qx, &(Q.x));
+    FP_copy(&Qy, &(Q.y));
+
+    FP_copy(&Sx, &(S.x));
+    FP_copy(&Sy, &(S.y));
+
+    ECP4_copy(&A, &P);
+    ECP4_copy(&B, &R);
+
+    ECP4_copy(&NP, &P); ECP4_neg(&NP);
+    ECP4_copy(&NR, &R); ECP4_neg(&NR);
+
+
+    FP24_one(r);
+
+    /* Main Miller Loop */
+    for (i = nb - 2; i >= 1; i--)
+    {
+        FP24_sqr(r, r);
+        PAIR_line(&lv, &A, &A, &Qx, &Qy);
+        PAIR_line(&lv2, &B, &B, &Sx, &Sy);
+        FP24_smul(&lv, &lv2);
+        FP24_ssmul(r, &lv);
+
+        bt = BIG_bit(n3, i) - BIG_bit(n, i); // bt=BIG_bit(n,i);
+        if (bt == 1)
+        {
+            PAIR_line(&lv, &A, &P, &Qx, &Qy);
+            PAIR_line(&lv2, &B, &R, &Sx, &Sy);
+            FP24_smul(&lv, &lv2);
+            FP24_ssmul(r, &lv);
+        }
+        if (bt == -1)
+        {
+            PAIR_line(&lv, &A, &NP, &Qx, &Qy);
+            PAIR_line(&lv2, &B, &NR, &Sx, &Sy);
+            FP24_smul(&lv, &lv2);
+            FP24_ssmul(r, &lv);
+        }
+    }
+
+
+
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    FP24_conj(r, r);
+#endif
+
+}
+
+/* final exponentiation - keep separate for multi-pairings and to avoid thrashing stack */
+
+void ZZZ::PAIR_fexp(FP24 *r)
+{
+    FP2 X;
+    BIG x;
+    FP a, b;
+    FP24 t0, t1, t2; //, t3, t4, t5, t6, t7; // could lose one of these - r=t3
+
+    BIG_rcopy(x, CURVE_Bnx);
+    FP_rcopy(&a, Fra);
+    FP_rcopy(&b, Frb);
+    FP2_from_FPs(&X, &a, &b);
+
+    /* Easy part of final exp - r^(p^12-1)(p^4+1)*/
+
+    FP24_inv(&t0, r);
+    FP24_conj(r, r);
+
+    FP24_mul(r, &t0);
+    FP24_copy(&t0, r);
+
+    FP24_frob(r, &X, 4);
+
+    FP24_mul(r, &t0);
+
+// See https://eprint.iacr.org/2020/875.pdf
+    FP24_usqr(&t2,r);
+    FP24_mul(&t2,r);     // t2=r^3
+
+    FP24_pow(&t1,r,x);   // t1=r^x
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    FP24_conj(&t1, &t1);
+#endif
+    FP24_conj(&t0,r);    // t0=r^-1
+    FP24_copy(r,&t1);
+    FP24_mul(r,&t0);    // r=r^(x-1)
+
+    FP24_pow(&t1,r,x);   // t1=r^x
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    FP24_conj(&t1, &t1);
+#endif
+    FP24_conj(&t0,r);    // t0=r^-1
+    FP24_copy(r,&t1);
+    FP24_mul(r,&t0);    // r=r^(x-1)
+
+// ^(x+p)
+    FP24_pow(&t1,r,x);  // t1=r^x
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    FP24_conj(&t1, &t1);
+#endif
+    FP24_copy(&t0,r);   
+    FP24_frob(&t0,&X,1); // t0=r^p
+    FP24_copy(r,&t1);
+    FP24_mul(r,&t0); // r=r^x.r^p
+
+// ^(x^2+p^2)
+    FP24_pow(&t1,r,x);  
+    FP24_pow(&t1,&t1,x); // t1=r^x^2
+    FP24_copy(&t0,r);    
+    FP24_frob(&t0,&X,2);   // t0=r^p^2
+    FP24_mul(&t1,&t0);   // t1=r^x^2.r^p^2
+    FP24_copy(r,&t1);
+
+// ^(x^4+p^4-1)
+    FP24_pow(&t1,r,x);  
+    FP24_pow(&t1,&t1,x); 
+    FP24_pow(&t1,&t1,x); 
+    FP24_pow(&t1,&t1,x); // t1=r^x^4
+    FP24_copy(&t0,r);    
+    FP24_frob(&t0,&X,4); // t0=r^p^4
+    FP24_mul(&t1,&t0);   // t1=r^x^4.r^p^4
+    FP24_conj(&t0,r);    // t0=r^-1
+    FP24_copy(r,&t1);    
+    FP24_mul(r,&t0);     // r=r^x^4.r^p^4.r^-1
+
+    FP24_mul(r,&t2);    
+    FP24_reduce(r);
+
+/*
+// Ghamman & Fouotsa Method - (completely garbled in  https://eprint.iacr.org/2016/130)
+
+    FP24_usqr(&t7, r);          // t7=f^2
+    FP24_pow(&t1, &t7, x);      // t1=t7^u
+
+    BIG_fshr(x, 1);
+    FP24_pow(&t2, &t1, x);      // t2=t1^(u/2)
+    BIG_fshl(x, 1); // x must be even
+
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    FP24_conj(&t1, &t1);
+#endif
+
+    FP24_conj(&t3, &t1);    // t3=1/t1
+    FP24_mul(&t2, &t3);     // t2=t1*t3
+    FP24_mul(&t2, r);       // t2=t2*f
+
+
+    FP24_pow(&t3, &t2, x);      // t3=t2^u
+    FP24_pow(&t4, &t3, x);      // t4=t3^u
+    FP24_pow(&t5, &t4, x);      // t5=t4^u
+
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    FP24_conj(&t3, &t3);
+    FP24_conj(&t5, &t5);
+#endif
+
+    FP24_frob(&t3, &X, 6);
+    FP24_frob(&t4, &X, 5);
+
+    FP24_mul(&t3, &t4);     // t3=t3.t4
+
+
+    FP24_pow(&t6, &t5, x);      // t6=t5^u
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    FP24_conj(&t6, &t6);
+#endif
+
+
+    FP24_frob(&t5, &X, 4);
+    FP24_mul(&t3, &t5); // ??
+
+
+    FP24_conj(&t0, &t2);        // t0=1/t2
+    FP24_mul(&t6, &t0);     // t6=t6*t0
+
+    FP24_copy(&t5, &t6);
+    FP24_frob(&t5, &X, 3);
+
+    FP24_mul(&t3, &t5);     // t3=t3*t5
+    FP24_pow(&t5, &t6, x);  // t5=t6^x
+    FP24_pow(&t6, &t5, x);  // t6=t5^x
+
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    FP24_conj(&t5, &t5);
+#endif
+
+    FP24_copy(&t0, &t5);
+    FP24_frob(&t0, &X, 2);
+    FP24_mul(&t3, &t0);     // t3=t3*t0
+    FP24_copy(&t0, &t6);    //
+    FP24_frob(&t0, &X, 1);
+
+    FP24_mul(&t3, &t0);     // t3=t3*t0
+    FP24_pow(&t5, &t6, x);  // t5=t6*x
+
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    FP24_conj(&t5, &t5);
+#endif
+
+    FP24_frob(&t2, &X, 7);
+
+    FP24_mul(&t5, &t7);     // t5=t5*t7
+    FP24_mul(&t3, &t2);     // t3=t3*t2
+    FP24_mul(&t3, &t5);     // t3=t3*t5
+
+    FP24_mul(r, &t3);
+    FP24_reduce(r);
+*/
+}
+
+#ifdef USE_GLV_ZZZ
+/* GLV method */
+static void ZZZ::glv(BIG u[2], BIG ee)
+{
+    int bd;
+    BIG q,x,x2;
+    BIG_rcopy(q, CURVE_Order);
+
+// -(x^4).P = (Beta.x,y)
+
+    BIG_rcopy(x, CURVE_Bnx);
+
+    BIG_smul(x2, x, x);
+    BIG_smul(x, x2, x2);
+    bd=BIG_nbits(q)-BIG_nbits(x); // fixed x^4
+
+    BIG_copy(u[0], ee);
+    BIG_ctmod(u[0], x, bd);
+    BIG_copy(u[1], ee);
+    BIG_ctsdiv(u[1], x, bd);
+ 
+    BIG_sub(u[1], q, u[1]);
+
+
+    return;
+}
+#endif // USE_GLV
+
+/* Galbraith & Scott Method */
+static void ZZZ::gs(BIG u[8], BIG ee)
+{
+    int i,bd;
+    BIG q,x,w;
+    BIG_rcopy(q, CURVE_Order);
+
+    BIG_rcopy(x, CURVE_Bnx);
+    BIG_copy(w, ee);
+    bd=BIG_nbits(q)-BIG_nbits(x); // fixed
+
+    for (i = 0; i < 7; i++)
+    {
+        BIG_copy(u[i], w);
+        BIG_ctmod(u[i], x, bd);
+        BIG_ctsdiv(w, x, bd);
+    }
+    BIG_copy(u[7], w);
+
+    /*  */
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    BIG_modneg(u[1], u[1], q);
+    BIG_modneg(u[3], u[3], q);
+    BIG_modneg(u[5], u[5], q);
+    BIG_modneg(u[7], u[7], q);
+#endif
+
+    return;
+}
+
+/* Multiply P by e in group G1 */
+void ZZZ::PAIR_G1mul(ECP *P, BIG e)
+{
+    BIG ee,q;
+    BIG_copy(ee,e);
+    BIG_rcopy(q, CURVE_Order);
+    BIG_mod(ee,q);
+#ifdef USE_GLV_ZZZ   /* Note this method is patented */
+    int np, nn;
+    ECP Q;
+    FP cru;
+    BIG t;
+    BIG u[2];
+
+    glv(u, ee);
+
+    ECP_copy(&Q, P); ECP_affine(&Q);
+    FP_rcopy(&cru, CRu);
+    FP_mul(&(Q.x), &(Q.x), &cru);
+
+    /* note that -a.B = a.(-B). Use a or -a depending on which is smaller */
+
+    np = BIG_nbits(u[0]);
+    BIG_modneg(t, u[0], q);
+    nn = BIG_nbits(t);
+    if (nn < np)
+    {
+        BIG_copy(u[0], t);
+        ECP_neg(P);
+    }
+
+    np = BIG_nbits(u[1]);
+    BIG_modneg(t, u[1], q);
+    nn = BIG_nbits(t);
+    if (nn < np)
+    {
+        BIG_copy(u[1], t);
+        ECP_neg(&Q);
+    }
+    BIG_norm(u[0]);
+    BIG_norm(u[1]);
+    ECP_mul2(P, &Q, u[0], u[1]);
+
+#else
+    ECP_clmul(P, ee, q);
+#endif
+}
+
+/* Multiply P by e in group G2 */
+void ZZZ::PAIR_G2mul(ECP4 *P, BIG e)
+{
+    BIG ee,q;
+    BIG_copy(ee,e);
+    BIG_rcopy(q, CURVE_Order);
+    BIG_mod(ee,q);
+#ifdef USE_GS_G2_ZZZ   /* Well I didn't patent it :) */
+    int i, np, nn;
+    ECP4 Q[8];
+    FP2 X[3];
+    BIG x, u[8];
+
+    ECP4_frob_constants(X);
+
+    gs(u, ee);
+
+    ECP4_copy(&Q[0], P);
+    for (i = 1; i < 8; i++)
+    {
+        ECP4_copy(&Q[i], &Q[i - 1]);
+        ECP4_frob(&Q[i], X, 1);
+    }
+
+    for (i = 0; i < 8; i++)
+    {
+        np = BIG_nbits(u[i]);
+        BIG_modneg(x, u[i], q);
+        nn = BIG_nbits(x);
+        if (nn < np)
+        {
+            BIG_copy(u[i], x);
+            ECP4_neg(&Q[i]);
+        }
+        BIG_norm(u[i]);
+    }
+
+    ECP4_mul8(P, Q, u);
+
+#else
+    ECP4_mul(P, ee);
+#endif
+}
+
+/* f=f^e */
+void ZZZ::PAIR_GTpow(FP24 *f, BIG e)
+{
+    BIG ee,q;
+    BIG_copy(ee,e);
+    BIG_rcopy(q, CURVE_Order);
+    BIG_mod(ee,q);
+#ifdef USE_GS_GT_ZZZ   /* Note that this option requires a lot of RAM! Maybe better to use compressed XTR method, see FP8.c */
+    int i, np, nn;
+    FP24 g[8];
+    FP2 X;
+    BIG t;
+    FP fx, fy;
+    BIG u[8];
+
+    FP_rcopy(&fx, Fra);
+    FP_rcopy(&fy, Frb);
+    FP2_from_FPs(&X, &fx, &fy);
+
+    gs(u, ee);
+
+    FP24_copy(&g[0], f);
+    for (i = 1; i < 8; i++)
+    {
+        FP24_copy(&g[i], &g[i - 1]);
+        FP24_frob(&g[i], &X, 1);
+    }
+
+    for (i = 0; i < 8; i++)
+    {
+        np = BIG_nbits(u[i]);
+        BIG_modneg(t, u[i], q);
+        nn = BIG_nbits(t);
+        if (nn < np)
+        {
+            BIG_copy(u[i], t);
+            FP24_conj(&g[i], &g[i]);
+        }
+        BIG_norm(u[i]);
+    }
+    FP24_pow8(f, g, u);
+
+#else
+    FP24_pow(f, f, ee);
+#endif
+}
+
+/* test G1 group membership */
+
+int ZZZ::PAIR_G1member(ECP *P)
+{
+    ECP W,T;
+    BIG x;
+    FP cru;
+    if (ECP_isinf(P)) return 0;
+
+    BIG_rcopy(x, CURVE_Bnx);
+    ECP_copy(&W,P);
+    ECP_copy(&T,P);
+    ECP_mul(&T,x); 
+    if (ECP_equals(P,&T)) return 0;    // P is of low order    
+    ECP_mul(&T,x);
+    ECP_mul(&T,x); ECP_mul(&T,x);
+    ECP_neg(&T);
+
+    FP_rcopy(&cru, CRu);
+    FP_mul(&(W.x), &(W.x), &cru);
+    if (!ECP_equals(&W,&T)) return 0;  // check that Endomorphism works
+
+// Not needed
+//    ECP_add(&W,P);
+//    FP_mul(&(T.x), &(T.x), &cru);
+//    ECP_add(&W,&T);
+//    if (!ECP_isinf(&W)) return 0;      // use it to check order
+
+/*
+	BIG q;
+	ECP W;
+    if (ECP_isinf(P)) return 0;
+    BIG_rcopy(q, CURVE_Order);
+	ECP_copy(&W,P);
+	ECP_mul(&W,q);
+	if (!ECP_isinf(&W)) return 0; */
+	return 1;
+}
+
+/* test G2 group membership */
+
+int ZZZ::PAIR_G2member(ECP4 *P)
+{
+    ECP4 W,T;
+    BIG x;
+    FP2 X[3];
+
+    if (ECP4_isinf(P)) return 0;
+    ECP4_frob_constants(X);
+    BIG_rcopy(x, CURVE_Bnx);
+
+    ECP4_copy(&W,P);
+    ECP4_frob(&W, X, 1);
+
+    ECP4_copy(&T,P);
+    ECP4_mul(&T,x);
+
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    ECP4_neg(&T);
+#endif
+/*
+    ECP4_copy(&R,&W);
+    ECP4_frob(&R,X,1);    // R=\psi^2(P)
+    ECP4_sub(&W,&R);
+    ECP4_copy(&R,&T);    // R=xP
+    ECP4_frob(&R,X,1);
+    ECP4_add(&W,&R);     // W=\psi(P)-\psi^2(P)+\psi(xP)
+*/
+    if (ECP4_equals(&W,&T)) return 1;
+    return 0;
+
+/*
+	BIG q;
+	ECP4 W;
+    if (ECP4_isinf(P)) return 0;
+    BIG_rcopy(q, CURVE_Order);
+	ECP4_copy(&W,P);
+	ECP4_mul(&W,q);
+	if (!ECP4_isinf(&W)) return 0;
+	return 1; */
+}
+
+/* Check that m is in cyclotomic sub-group */
+/* Check that m!=1, conj(m)*m==1, and m.m^{p^8}=m^{p^4} */
+int ZZZ::PAIR_GTcyclotomic(FP24 *m)
+{
+	FP fx,fy;
+	FP2 X;
+	FP24 r,w;
+	if (FP24_isunity(m)) return 0;
+	FP24_conj(&r,m);
+	FP24_mul(&r,m);
+	if (!FP24_isunity(&r)) return 0;
+
+	FP_rcopy(&fx,Fra);
+	FP_rcopy(&fy,Frb);
+	FP2_from_FPs(&X,&fx,&fy);
+
+	FP24_copy(&r,m); FP24_frob(&r,&X,4); 
+	FP24_copy(&w,&r); FP24_frob(&w,&X,4); 
+	FP24_mul(&w,m);
+
+	if (!FP24_equals(&w,&r)) return 0;
+    return 1;
+}
+/* test for full GT group membership */
+
+int ZZZ::PAIR_GTmember(FP24 *m)
+{
+    BIG x;
+    FP2 X;
+    FP fx, fy;
+    FP24 r,t;
+    if (!PAIR_GTcyclotomic(m)) return 0;
+
+    FP_rcopy(&fx, Fra);
+    FP_rcopy(&fy, Frb);
+    FP2_from_FPs(&X, &fx, &fy);
+    BIG_rcopy(x, CURVE_Bnx);
+
+    FP24_copy(&r,m);
+    FP24_frob(&r, &X, 1);
+
+    FP24_pow(&t,m,x);
+
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    FP24_conj(&t,&t);
+#endif
+
+    if (FP24_equals(&r,&t)) return 1;
+    return 0;
+/*
+    BIG_rcopy(q, CURVE_Order);
+    FP24_pow(&r, m, q);
+	if (!FP24_isunity(&r)) return 0;
+	return 1; */
+}
+
+#ifdef HAS_MAIN
+
+using namespace std;
+using namespace ZZZ;
+
+
+// g++ -O2 pair4_BLS24.cpp ecp4_BLS24.cpp fp24_BLS24.cpp fp8_BLS24.cpp fp4_BLS24.cpp fp2_BLS24.cpp ecp_BLS24.cpp fp_BLS24.cpp big_XXX.cpp rom_curve_BLS24.cpp rom_field_BLS24.cpp rand.cpp hash.cpp oct.cpp -o pair4_BLS24.exe
+
+int main()
+{
+    int i;
+    char byt[32];
+    csprng rng;
+    BIG xa, xb, ya, yb, w, a, b, t1, q, u[2], v[4], m, r, xx, x2, x4, p;
+    ECP4 P, G;
+    ECP Q, R;
+    FP24 g, gp;
+    FP8 t, c, cp, cpm1, cpm2;
+    FP4 X, Y;
+    FP2 x, y, f, Aa, Bb;
+    FP cru;
+
+    for (i = 0; i < 32; i++)
+        byt[i] = i + 9;
+    RAND_seed(&rng, 32, byt);
+
+    BIG_rcopy(r, CURVE_Order);
+    BIG_rcopy(p, Modulus);
+
+
+    BIG_rcopy(xa, CURVE_Gx);
+    BIG_rcopy(ya, CURVE_Gy);
+
+    ECP_set(&Q, xa, ya);
+    if (Q.inf) printf("Failed to set - point not on curve\n");
+    else printf("G1 set success\n");
+
+    printf("Q= ");
+    ECP_output(&Q);
+    printf("\n");
+
+    ECP4_generator(&P);
+
+    if (P.inf) printf("Failed to set - point not on curve\n");
+    else printf("G2 set success\n");
+
+    BIG_rcopy(a, Fra);
+    BIG_rcopy(b, Frb);
+    FP2_from_BIGs(&f, a, b);
+
+    PAIR_ate(&g, &P, &Q);
+
+    printf("gb= ");
+    FP24_output(&g);
+    printf("\n");
+    PAIR_fexp(&g);
+
+    printf("g= ");
+    FP24_output(&g);
+    printf("\n");
+
+    ECP_copy(&R, &Q);
+    ECP4_copy(&G, &P);
+
+    ECP4_dbl(&G);
+    ECP_dbl(&R);
+    ECP_affine(&R);
+
+    PAIR_ate(&g, &G, &Q);
+    PAIR_fexp(&g);
+
+    printf("g1= ");
+    FP24_output(&g);
+    printf("\n");
+
+    PAIR_ate(&g, &P, &R);
+    PAIR_fexp(&g);
+
+    printf("g2= ");
+    FP24_output(&g);
+    printf("\n");
+
+
+    PAIR_G1mul(&Q, r);
+    printf("rQ= "); ECP_output(&Q); printf("\n");
+
+    PAIR_G2mul(&P, r);
+    printf("rP= "); ECP4_output(&P); printf("\n");
+
+    BIG_randomnum(w, r, &rng);
+
+    FP24_copy(&gp, &g);
+
+    PAIR_GTpow(&g, w);
+
+    FP24_trace(&t, &g);
+
+    printf("g^r=  "); FP8_output(&t); printf("\n");
+
+    FP24_compow(&t, &gp, w, r);
+
+    printf("t(g)= "); FP8_output(&t); printf("\n");
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/pair4.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/pair4.h
new file mode 100644
index 0000000..c9b9571
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/pair4.h
@@ -0,0 +1,180 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef PAIR4_ZZZ_H
+#define PAIR4_ZZZ_H
+
+#include "fp24_YYY.h"
+#include "ecp4_ZZZ.h"
+#include "ecp_ZZZ.h"
+
+using namespace core;
+
+namespace ZZZ {
+/* Pairing constants */
+
+extern const XXX::BIG CURVE_Bnx; /**< BN curve x parameter */
+extern const XXX::BIG CURVE_Cru; /**< BN curve Cube Root of Unity */
+
+extern const XXX::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const XXX::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const XXX::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const XXX::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+/* Pairing function prototypes */
+
+/**	@brief Precompute line functions details for fixed G2 value
+ *
+	@param T array of precomputed FP8 partial line functions
+	@param GV a fixed ECP4 instance
+ */
+extern void PAIR_precomp(YYY::FP8 T[], ECP4* GV);
+
+
+/**	@brief Calculate Miller loop for Optimal ATE pairing e(P,Q)
+ *
+	@param r FP24 result of the pairing calculation e(P,Q)
+	@param P ECP4 instance, an element of G2
+	@param Q ECP instance, an element of G1
+
+ */
+extern void PAIR_ate(YYY::FP24 *r, ECP4 *P, ECP *Q);
+/**	@brief Calculate Miller loop for Optimal ATE double-pairing e(P,Q).e(R,S)
+ *
+	Faster than calculating two separate pairings
+	@param r FP24 result of the pairing calculation e(P,Q).e(R,S), an element of GT
+	@param P ECP4 instance, an element of G2
+	@param Q ECP instance, an element of G1
+	@param R ECP4 instance, an element of G2
+	@param S ECP instance, an element of G1
+ */
+extern void PAIR_double_ate(YYY::FP24 *r, ECP4 *P, ECP *Q, ECP4 *R, ECP *S);
+/**	@brief Final exponentiation of pairing, converts output of Miller loop to element in GT
+ *
+	Here p is the internal modulus, and r is the group order
+	@param x FP24, on exit = x^((p^12-1)/r)
+ */
+extern void PAIR_fexp(YYY::FP24 *x);
+/**	@brief Fast point multiplication of a member of the group G1 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param Q ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G1mul(ECP *Q, XXX::BIG b);
+/**	@brief Fast point multiplication of a member of the group G2 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param P ECP4 member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G2mul(ECP4 *P, XXX::BIG b);
+/**	@brief Fast raising of a member of GT to a BIG power
+ *
+	May exploit endomorphism for speed.
+	@param x FP24 member of GT.
+	@param b BIG exponent
+
+ */
+extern void PAIR_GTpow(YYY::FP24 *x, XXX::BIG b);
+
+/**	@brief Tests ECP for membership of G1
+ *
+	@param P ECP member of G1
+	@return true or false
+
+ */
+extern int PAIR_G1member(ZZZ::ECP *P);
+
+/**	@brief Tests ECP4 for membership of G2
+ *
+	@param P ECP4 member of G2
+	@return true or false
+
+ */
+extern int PAIR_G2member(ZZZ::ECP4 *P);
+
+
+/**	@brief Tests FP24 for membership of cyclotomic subgroup
+ *
+	@param x FP24 instance
+	@return 1 if x is cyclotomic, else return 0
+
+ */
+extern int PAIR_GTcyclotomic(YYY::FP24 *x);
+
+
+/**	@brief Tests FP24 for full membership of GT
+ *
+	@param x FP24 instance
+	@return 1 if x is in GT, else return 0
+
+ */
+extern int PAIR_GTmember(YYY::FP24 *x);
+
+
+/**	@brief Precompute line functions for n-pairing
+ *
+	@param r array of precomputed FP24 products of line functions
+	@param PV ECP4 instance, an element of G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another(YYY::FP24 r[], ECP4* PV, ECP* QV);
+
+/**	@brief Compute line functions for n-pairing, assuming precomputation on G2
+ *
+	@param r array of precomputed FP24 products of line functions
+	@param T array contains precomputed partial line fucntions from G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another_pc(YYY::FP24 r[], YYY::FP8 T[], ECP *QV);
+
+
+/**	@brief Prepare Ate parameter
+ *
+	@param n BIG parameter
+	@param n3 BIG paramter = 3*n
+	@return number of nits in n3
+
+ */
+extern int PAIR_nbits(XXX::BIG n3, XXX::BIG n);
+
+/**	@brief Initialise structure for multi-pairing
+ *
+	@param r FP24 array, to be initialised to 1
+
+ */
+extern void PAIR_initmp(YYY::FP24 r[]);
+
+
+/**	@brief Miller loop
+ *
+ 	@param res FP24 result
+	@param r FP24 precomputed array of accumulated line functions
+
+ */
+extern void PAIR_miller(YYY::FP24 *res, YYY::FP24 r[]);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/pair4_BLS24479.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/pair4_BLS24479.h
new file mode 100644
index 0000000..4c97139
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/pair4_BLS24479.h
@@ -0,0 +1,180 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef PAIR4_BLS24479_H
+#define PAIR4_BLS24479_H
+
+#include "fp24_BLS24479.h"
+#include "ecp4_BLS24479.h"
+#include "ecp_BLS24479.h"
+
+using namespace core;
+
+namespace BLS24479 {
+/* Pairing constants */
+
+extern const B480_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+extern const B480_56::BIG CURVE_Cru; /**< BN curve Cube Root of Unity */
+
+extern const B480_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B480_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B480_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B480_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+/* Pairing function prototypes */
+
+/**	@brief Precompute line functions details for fixed G2 value
+ *
+	@param T array of precomputed FP8 partial line functions
+	@param GV a fixed ECP4 instance
+ */
+extern void PAIR_precomp(BLS24479::FP8 T[], ECP4* GV);
+
+
+/**	@brief Calculate Miller loop for Optimal ATE pairing e(P,Q)
+ *
+	@param r FP24 result of the pairing calculation e(P,Q)
+	@param P ECP4 instance, an element of G2
+	@param Q ECP instance, an element of G1
+
+ */
+extern void PAIR_ate(BLS24479::FP24 *r, ECP4 *P, ECP *Q);
+/**	@brief Calculate Miller loop for Optimal ATE double-pairing e(P,Q).e(R,S)
+ *
+	Faster than calculating two separate pairings
+	@param r FP24 result of the pairing calculation e(P,Q).e(R,S), an element of GT
+	@param P ECP4 instance, an element of G2
+	@param Q ECP instance, an element of G1
+	@param R ECP4 instance, an element of G2
+	@param S ECP instance, an element of G1
+ */
+extern void PAIR_double_ate(BLS24479::FP24 *r, ECP4 *P, ECP *Q, ECP4 *R, ECP *S);
+/**	@brief Final exponentiation of pairing, converts output of Miller loop to element in GT
+ *
+	Here p is the internal modulus, and r is the group order
+	@param x FP24, on exit = x^((p^12-1)/r)
+ */
+extern void PAIR_fexp(BLS24479::FP24 *x);
+/**	@brief Fast point multiplication of a member of the group G1 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param Q ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G1mul(ECP *Q, B480_56::BIG b);
+/**	@brief Fast point multiplication of a member of the group G2 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param P ECP4 member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G2mul(ECP4 *P, B480_56::BIG b);
+/**	@brief Fast raising of a member of GT to a BIG power
+ *
+	May exploit endomorphism for speed.
+	@param x FP24 member of GT.
+	@param b BIG exponent
+
+ */
+extern void PAIR_GTpow(BLS24479::FP24 *x, B480_56::BIG b);
+
+/**	@brief Tests ECP for membership of G1
+ *
+	@param P ECP member of G1
+	@return true or false
+
+ */
+extern int PAIR_G1member(BLS24479::ECP *P);
+
+/**	@brief Tests ECP4 for membership of G2
+ *
+	@param P ECP4 member of G2
+	@return true or false
+
+ */
+extern int PAIR_G2member(BLS24479::ECP4 *P);
+
+
+/**	@brief Tests FP24 for membership of cyclotomic subgroup
+ *
+	@param x FP24 instance
+	@return 1 if x is cyclotomic, else return 0
+
+ */
+extern int PAIR_GTcyclotomic(BLS24479::FP24 *x);
+
+
+/**	@brief Tests FP24 for full membership of GT
+ *
+	@param x FP24 instance
+	@return 1 if x is in GT, else return 0
+
+ */
+extern int PAIR_GTmember(BLS24479::FP24 *x);
+
+
+/**	@brief Precompute line functions for n-pairing
+ *
+	@param r array of precomputed FP24 products of line functions
+	@param PV ECP4 instance, an element of G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another(BLS24479::FP24 r[], ECP4* PV, ECP* QV);
+
+/**	@brief Compute line functions for n-pairing, assuming precomputation on G2
+ *
+	@param r array of precomputed FP24 products of line functions
+	@param T array contains precomputed partial line fucntions from G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another_pc(BLS24479::FP24 r[], BLS24479::FP8 T[], ECP *QV);
+
+
+/**	@brief Prepare Ate parameter
+ *
+	@param n BIG parameter
+	@param n3 BIG paramter = 3*n
+	@return number of nits in n3
+
+ */
+extern int PAIR_nbits(B480_56::BIG n3, B480_56::BIG n);
+
+/**	@brief Initialise structure for multi-pairing
+ *
+	@param r FP24 array, to be initialised to 1
+
+ */
+extern void PAIR_initmp(BLS24479::FP24 r[]);
+
+
+/**	@brief Miller loop
+ *
+ 	@param res FP24 result
+	@param r FP24 precomputed array of accumulated line functions
+
+ */
+extern void PAIR_miller(BLS24479::FP24 *res, BLS24479::FP24 r[]);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/pair8.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/pair8.cpp
new file mode 100644
index 0000000..7bfba83
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/pair8.cpp
@@ -0,0 +1,1181 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* CORE BLS Curve pairing functions */
+
+//#define HAS_MAIN
+
+#include "pair8_ZZZ.h"
+
+using namespace XXX;
+using namespace YYY;
+
+namespace ZZZ {
+static void PAIR_line(FP48 *, ECP8 *, ECP8 *, FP *, FP *);
+static void PAIR_double(ECP8 *, FP8 *, FP8 *, FP8 *);
+static void PAIR_add(ECP8 *, ECP8 *B, FP8 *, FP8 *, FP8 *);
+static void PAIR_pack(FP16 *, FP8 *, FP8 *, FP8 *);
+static void PAIR_unpack(FP48 *, FP16 *, FP *, FP *);
+static void glv(BIG u[2], BIG);
+static void gs(BIG u[4], BIG);
+}
+
+
+// Point doubling for pairings
+static void ZZZ::PAIR_double(ECP8 *A, FP8 *AA, FP8 *BB, FP8 *CC)
+{
+    FP8 YY;
+    FP8_copy(CC, &(A->x));  //FP8 XX=new FP8(A.getx());  //X
+    FP8_copy(&YY, &(A->y)); //FP8 YY=new FP8(A.gety());  //Y
+    FP8_copy(BB, &(A->z));  //FP8 ZZ=new FP8(A.getz());  //Z
+
+    FP8_copy(AA, &YY);      //FP8 YZ=new FP8(YY);        //Y
+    FP8_mul(AA, AA, BB);    //YZ.mul(ZZ);                //YZ
+    FP8_sqr(CC, CC);        //XX.sqr();                //X^2
+    FP8_sqr(&YY, &YY);      //YY.sqr();                //Y^2
+    FP8_sqr(BB, BB);        //ZZ.sqr();                //Z^2
+
+    FP8_add(AA, AA, AA);
+    FP8_neg(AA, AA);
+    FP8_norm(AA);           // -2YZ
+    FP8_times_i(AA);        // -2YZi
+
+    FP8_imul(BB, BB, 3 * CURVE_B_I); //3Bz^2
+    FP8_imul(CC, CC, 3);            //3X^2
+
+#if SEXTIC_TWIST_ZZZ==D_TYPE
+    FP8_times_i(&YY);                   // Y^2.i
+    FP8_times_i(CC);                    // 3X^2.i
+#endif
+
+#if SEXTIC_TWIST_ZZZ==M_TYPE
+    FP8_times_i(BB);                    // 3Bz^2.i
+#endif
+
+    FP8_sub(BB, BB, &YY);
+    FP8_norm(BB);
+
+    ECP8_dbl(A);            //A.dbl();
+
+}
+
+// Point addition for pairings
+static void ZZZ::PAIR_add(ECP8 *A, ECP8 *B, FP8 *AA, FP8 *BB, FP8 *CC)
+{
+    FP8 T1;
+    FP8_copy(AA, &(A->x));      //FP8 X1=new FP8(A.getx());    // X1
+    FP8_copy(CC, &(A->y));      //FP8 Y1=new FP8(A.gety());    // Y1
+    FP8_copy(&T1, &(A->z));     //FP8 T1=new FP8(A.getz());    // Z1
+
+    FP8_copy(BB, &T1);          //FP8 T2=new FP8(A.getz());    // Z1
+
+    FP8_mul(&T1, &T1, &(B->y)); //T1.mul(B.gety());    // T1=Z1.Y2
+    FP8_mul(BB, BB, &(B->x));   //T2.mul(B.getx());    // T2=Z1.X2
+
+    FP8_sub(AA, AA, BB);        //X1.sub(T2);
+    FP8_norm(AA);               //X1.norm();  // X1=X1-Z1.X2
+    FP8_sub(CC, CC, &T1);       //Y1.sub(T1);
+    FP8_norm(CC);               //Y1.norm();  // Y1=Y1-Z1.Y2
+
+    FP8_copy(&T1, AA);          //T1.copy(X1);            // T1=X1-Z1.X2
+
+#if SEXTIC_TWIST_ZZZ==M_TYPE
+    FP8_times_i(AA);
+    FP8_norm(AA);
+#endif
+
+    FP8_mul(&T1, &T1, &(B->y)); //T1.mul(B.gety());       // T1=(X1-Z1.X2).Y2
+
+    FP8_copy(BB, CC);           //T2.copy(Y1);            // T2=Y1-Z1.Y2
+    FP8_mul(BB, BB, &(B->x));   //T2.mul(B.getx());       // T2=(Y1-Z1.Y2).X2
+    FP8_sub(BB, BB, &T1);       //T2.sub(T1);
+    FP8_norm(BB);               //T2.norm();          // T2=(Y1-Z1.Y2).X2 - (X1-Z1.X2).Y2
+
+    FP8_neg(CC, CC);            //Y1.neg();
+    FP8_norm(CC);               //Y1.norm(); // Y1=-(Y1-Z1.Y2).Xs                - ***
+
+    ECP8_add(A, B);             //A.add(B);
+}
+
+/* Line function */
+static void ZZZ::PAIR_line(FP48 *v, ECP8 *A, ECP8 *B, FP *Qx, FP *Qy)
+{
+    FP8 AA, BB, CC;
+    FP16 a, b, c;
+
+    if (A == B)
+        PAIR_double(A, &AA, &BB, &CC);
+    else
+        PAIR_add(A, B, &AA, &BB, &CC);
+
+    FP8_tmul(&CC, &CC, Qx);
+    FP8_tmul(&AA, &AA, Qy);
+
+    FP16_from_FP8s(&a, &AA, &BB);
+#if SEXTIC_TWIST_ZZZ==D_TYPE
+    FP16_from_FP8(&b, &CC);
+    FP16_zero(&c);
+#endif
+#if SEXTIC_TWIST_ZZZ==M_TYPE
+    FP16_zero(&b);
+    FP16_from_FP8H(&c, &CC);
+#endif
+
+    FP48_from_FP16s(v, &a, &b, &c);
+    v->type = FP_SPARSER;
+}
+
+
+/* prepare ate parameter, n=6u+2 (BN) or n=u (BLS), n3=3*n */
+int ZZZ::PAIR_nbits(BIG n3, BIG n)
+{
+    BIG x;
+    BIG_rcopy(x, CURVE_Bnx);
+
+    BIG_copy(n, x);
+    BIG_norm(n);
+    BIG_pmul(n3, n, 3);
+    BIG_norm(n3);
+
+    return BIG_nbits(n3);
+}
+
+/*
+    For multi-pairing, product of n pairings
+    1. Declare FP48 array of length number of bits in Ate parameter
+    2. Initialise this array by calling PAIR_initmp()
+    3. Accumulate each pairing by calling PAIR_another() n times
+    4. Call PAIR_miller()
+    5. Call final exponentiation PAIR_fexp()
+*/
+
+/* prepare for multi-pairing */
+void ZZZ::PAIR_initmp(FP48 r[])
+{
+    int i;
+    for (i = ATE_BITS_ZZZ - 1; i >= 0; i--)
+        FP48_one(&r[i]);
+    return;
+}
+
+/* basic Miller loop */
+void ZZZ::PAIR_miller(FP48 *res, FP48 r[])
+{
+    int i;
+    FP48_one(res);
+    for (i = ATE_BITS_ZZZ - 1; i >= 1; i--)
+    {
+        FP48_sqr(res, res);
+        FP48_ssmul(res, &r[i]);
+        FP48_zero(&r[i]);
+    }
+
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    FP48_conj(res, res);
+#endif
+    FP48_ssmul(res, &r[0]);
+    FP48_zero(&r[0]);
+    return;
+}
+
+
+// Store precomputed line details in an FP4
+static void ZZZ::PAIR_pack(FP16 *T, FP8* AA, FP8* BB, FP8 *CC)
+{
+    FP8 I, A, B;
+    FP8_inv(&I, CC, NULL);
+    FP8_mul(&A, AA, &I);
+    FP8_mul(&B, BB, &I);
+    FP16_from_FP8s(T, &A, &B);
+}
+
+// Unpack G2 line function details and include G1
+static void ZZZ::PAIR_unpack(FP48 *v, FP16* T, FP *Qx, FP *Qy)
+{
+    FP16 a, b, c;
+    FP8 t;
+    FP16_copy(&a, T);
+    FP8_tmul(&a.a, &a.a, Qy);
+    FP8_from_FP(&t, Qx);
+
+#if SEXTIC_TWIST_ZZZ==D_TYPE
+    FP16_from_FP8(&b, &t);
+    FP16_zero(&c);
+#endif
+#if SEXTIC_TWIST_ZZZ==M_TYPE
+    FP16_zero(&b);
+    FP16_from_FP8H(&c, &t);
+#endif
+
+    FP48_from_FP16s(v, &a, &b, &c);
+    v->type = FP_SPARSEST;
+}
+
+// Precompute table of line functions for fixed G2 value
+void ZZZ::PAIR_precomp(FP16 T[], ECP8* GV)
+{
+    int i, j, nb, bt;
+    BIG n, n3;
+    FP8 AA, BB, CC;
+    ECP8 A, G, NG;
+
+    ECP8_copy(&A, GV);
+    ECP8_copy(&G, GV);
+    ECP8_copy(&NG, GV);
+    ECP8_neg(&NG);
+
+    nb = PAIR_nbits(n3, n);
+    j = 0;
+
+    for (i = nb - 2; i >= 1; i--)
+    {
+        PAIR_double(&A, &AA, &BB, &CC);
+        PAIR_pack(&T[j++], &AA, &BB, &CC);
+
+        bt = BIG_bit(n3, i) - BIG_bit(n, i); // bt=BIG_bit(n,i);
+        if (bt == 1)
+        {
+            PAIR_add(&A, &G, &AA, &BB, &CC);
+            PAIR_pack(&T[j++], &AA, &BB, &CC);
+        }
+        if (bt == -1)
+        {
+            PAIR_add(&A, &NG, &AA, &BB, &CC);
+            PAIR_pack(&T[j++], &AA, &BB, &CC);
+        }
+    }
+}
+
+/* Accumulate another set of line functions for n-pairing, assuming precomputation on G2 */
+void ZZZ::PAIR_another_pc(FP48 r[], FP16 T[], ECP *QV)
+{
+    int i, j, nb, bt;
+    BIG x, n, n3;
+    FP48 lv, lv2;
+    ECP Q;
+    FP Qx, Qy;
+
+    if (ECP_isinf(QV)) return;
+
+    nb = PAIR_nbits(n3, n);
+
+    ECP_copy(&Q, QV);
+    ECP_affine(&Q);
+
+    FP_copy(&Qx, &(Q.x));
+    FP_copy(&Qy, &(Q.y));
+
+    j = 0;
+    for (i = nb - 2; i >= 1; i--)
+    {
+        PAIR_unpack(&lv, &T[j++], &Qx, &Qy);
+
+        bt = BIG_bit(n3, i) - BIG_bit(n, i); // bt=BIG_bit(n,i);
+        if (bt == 1)
+        {
+            PAIR_unpack(&lv2, &T[j++], &Qx, &Qy);
+            FP48_smul(&lv, &lv2);
+        }
+        if (bt == -1)
+        {
+            PAIR_unpack(&lv2, &T[j++], &Qx, &Qy);
+            FP48_smul(&lv, &lv2);
+        }
+        FP48_ssmul(&r[i], &lv);
+    }
+}
+
+/* Accumulate another set of line functions for n-pairing */
+void ZZZ::PAIR_another(FP48 r[], ECP8* PV, ECP* QV)
+{
+    int i, j, nb, bt;
+    BIG x, n, n3;
+    FP48 lv, lv2;
+    ECP8 A, NP, P;
+    ECP Q;
+    FP Qx, Qy;
+
+    if (ECP_isinf(QV)) return;
+
+    nb = PAIR_nbits(n3, n);
+
+    ECP8_copy(&P, PV);
+    ECP_copy(&Q, QV);
+
+    ECP8_affine(&P);
+    ECP_affine(&Q);
+
+    FP_copy(&Qx, &(Q.x));
+    FP_copy(&Qy, &(Q.y));
+
+    ECP8_copy(&A, &P);
+    ECP8_copy(&NP, &P); ECP8_neg(&NP);
+
+    for (i = nb - 2; i >= 1; i--)
+    {
+        PAIR_line(&lv, &A, &A, &Qx, &Qy);
+
+        bt = BIG_bit(n3, i) - BIG_bit(n, i); // bt=BIG_bit(n,i);
+        if (bt == 1)
+        {
+            PAIR_line(&lv2, &A, &P, &Qx, &Qy);
+            FP48_smul(&lv, &lv2);
+        }
+        if (bt == -1)
+        {
+            PAIR_line(&lv2, &A, &NP, &Qx, &Qy);
+            FP48_smul(&lv, &lv2);
+        }
+        FP48_ssmul(&r[i], &lv);
+    }
+}
+
+/* Optimal R-ate pairing r=e(P,Q) */
+void ZZZ::PAIR_ate(FP48 *r, ECP8 *P1, ECP *Q1)
+{
+    BIG x, n, n3;
+    FP Qx, Qy;
+    int i, nb, bt;
+    ECP8 A, NP, P;
+    ECP Q;
+    FP48 lv, lv2;
+
+    FP48_one(r);
+    if (ECP_isinf(Q1)) return;
+
+    nb = PAIR_nbits(n3, n);
+
+    ECP8_copy(&P, P1);
+    ECP_copy(&Q, Q1);
+
+    ECP8_affine(&P);
+    ECP_affine(&Q);
+
+
+    FP_copy(&Qx, &(Q.x));
+    FP_copy(&Qy, &(Q.y));
+
+    ECP8_copy(&A, &P);
+    ECP8_copy(&NP, &P); ECP8_neg(&NP);
+
+    /* Main Miller Loop */
+    for (i = nb - 2; i >= 1; i--)
+    {
+        FP48_sqr(r, r);
+        PAIR_line(&lv, &A, &A, &Qx, &Qy);
+
+        bt = BIG_bit(n3, i) - BIG_bit(n, i); // BIG_bit(n,i);
+        if (bt == 1)
+        {
+            PAIR_line(&lv2, &A, &P, &Qx, &Qy);
+            FP48_smul(&lv, &lv2);
+        }
+        if (bt == -1)
+        {
+            PAIR_line(&lv2, &A, &NP, &Qx, &Qy);
+            FP48_smul(&lv, &lv2);
+        }
+        FP48_ssmul(r, &lv);
+
+    }
+
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    FP48_conj(r, r);
+#endif
+
+}
+
+/* Optimal R-ate double pairing e(P,Q).e(R,S) */
+void ZZZ::PAIR_double_ate(FP48 *r, ECP8 *P1, ECP *Q1, ECP8 *R1, ECP *S1)
+{
+    BIG x, n, n3;
+    FP Qx, Qy, Sx, Sy;
+    int i, nb, bt;
+    ECP8 A, B, NP, NR, P, R;
+    ECP Q, S;
+    FP48 lv, lv2;
+
+    if (ECP_isinf(Q1))
+    {
+        PAIR_ate(r, R1, S1);
+        return;
+    }
+    if (ECP_isinf(S1))
+    {
+        PAIR_ate(r, P1, Q1);
+        return;
+    }
+    nb = PAIR_nbits(n3, n);
+
+    ECP8_copy(&P, P1);
+    ECP_copy(&Q, Q1);
+
+    ECP8_affine(&P);
+    ECP_affine(&Q);
+
+    ECP8_copy(&R, R1);
+    ECP_copy(&S, S1);
+
+    ECP8_affine(&R);
+    ECP_affine(&S);
+
+    FP_copy(&Qx, &(Q.x));
+    FP_copy(&Qy, &(Q.y));
+
+    FP_copy(&Sx, &(S.x));
+    FP_copy(&Sy, &(S.y));
+
+    ECP8_copy(&A, &P);
+    ECP8_copy(&B, &R);
+
+    ECP8_copy(&NP, &P); ECP8_neg(&NP);
+    ECP8_copy(&NR, &R); ECP8_neg(&NR);
+
+    FP48_one(r);
+
+    /* Main Miller Loop */
+    for (i = nb - 2; i >= 1; i--)
+    {
+        FP48_sqr(r, r);
+        PAIR_line(&lv, &A, &A, &Qx, &Qy);
+        PAIR_line(&lv2, &B, &B, &Sx, &Sy);
+        FP48_smul(&lv, &lv2);
+        FP48_ssmul(r, &lv);
+
+        bt = BIG_bit(n3, i) - BIG_bit(n, i); // bt=BIG_bit(n,i);
+        if (bt == 1)
+        {
+            PAIR_line(&lv, &A, &P, &Qx, &Qy);
+            PAIR_line(&lv2, &B, &R, &Sx, &Sy);
+            FP48_smul(&lv, &lv2);
+            FP48_ssmul(r, &lv);
+        }
+        if (bt == -1)
+        {
+            PAIR_line(&lv, &A, &NP, &Qx, &Qy);
+            PAIR_line(&lv2, &B, &NR, &Sx, &Sy);
+            FP48_smul(&lv, &lv2);
+            FP48_ssmul(r, &lv);
+        }
+    }
+
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    FP48_conj(r, r);
+#endif
+
+}
+
+/* final exponentiation - keep separate for multi-pairings and to avoid thrashing stack */
+
+void ZZZ::PAIR_fexp(FP48 *r)
+{
+    FP2 X;
+    BIG x;
+    FP a, b;
+    FP48 t0, t1, t2;//, t3;
+
+    BIG_rcopy(x, CURVE_Bnx);
+    FP_rcopy(&a, Fra);
+    FP_rcopy(&b, Frb);
+    FP2_from_FPs(&X, &a, &b);
+
+    /* Easy part of final exp - r^(p^24-1)(p^8+1)*/
+
+    FP48_inv(&t0, r);
+    FP48_conj(r, r);
+
+    FP48_mul(r, &t0);
+    FP48_copy(&t0, r);
+
+    FP48_frob(r, &X, 8);
+
+    FP48_mul(r, &t0);
+
+// See https://eprint.iacr.org/2020/875.pdf
+    FP48_usqr(&t2,r);
+    FP48_mul(&t2,r);     // t2=r^3
+
+    FP48_pow(&t1,r,x);   // t1=r^x
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    FP48_conj(&t1, &t1);
+#endif
+    FP48_conj(&t0,r);    // t0=r^-1
+    FP48_copy(r,&t1);
+    FP48_mul(r,&t0);    // r=r^(x-1)
+
+    FP48_pow(&t1,r,x);   // t1=r^x
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    FP48_conj(&t1, &t1);
+#endif
+    FP48_conj(&t0,r);    // t0=r^-1
+    FP48_copy(r,&t1);
+    FP48_mul(r,&t0);    // r=r^(x-1)
+
+// ^(x+p)
+    FP48_pow(&t1,r,x);  // t1=r^x
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    FP48_conj(&t1, &t1);
+#endif
+    FP48_copy(&t0,r);   
+    FP48_frob(&t0,&X,1); // t0=r^p
+    FP48_copy(r,&t1);
+    FP48_mul(r,&t0); // r=r^x.r^p
+
+// ^(x^2+p^2)
+    FP48_pow(&t1,r,x);  
+    FP48_pow(&t1,&t1,x); // t1=r^x^2
+    FP48_copy(&t0,r);    
+    FP48_frob(&t0,&X,2);   // t0=r^p^2
+    FP48_mul(&t1,&t0);   // t1=r^x^2.r^p^2
+    FP48_copy(r,&t1);
+
+// ^(x^4+p^4)
+    FP48_pow(&t1,r,x);  
+    FP48_pow(&t1,&t1,x);
+    FP48_pow(&t1,&t1,x); 
+    FP48_pow(&t1,&t1,x); // t1=r^x^4
+    FP48_copy(&t0,r);    
+    FP48_frob(&t0,&X,4);   // t0=r^p^4
+    FP48_mul(&t1,&t0);   // t1=r^x^4.r^p^4
+    FP48_copy(r,&t1);
+
+// ^(x^8+p^8-1)
+    FP48_pow(&t1,r,x);  
+    FP48_pow(&t1,&t1,x); 
+    FP48_pow(&t1,&t1,x); 
+    FP48_pow(&t1,&t1,x); 
+    FP48_pow(&t1,&t1,x);
+    FP48_pow(&t1,&t1,x);
+    FP48_pow(&t1,&t1,x); 
+    FP48_pow(&t1,&t1,x); // t1=r^x^8
+    FP48_copy(&t0,r);    
+    FP48_frob(&t0,&X,8); // t0=r^p^8
+    FP48_mul(&t1,&t0);   // t1=r^x^8.r^p^8
+    FP48_conj(&t0,r);    // t0=r^-1
+    FP48_copy(r,&t1);    
+    FP48_mul(r,&t0);     // r=r^x^4.r^p^4.r^-1
+
+    FP48_mul(r,&t2);    
+    FP48_reduce(r);
+/*
+// f^e0.f^e1^p.f^e2^p^2.. .. f^e14^p^14.f^e15^p^15
+
+    FP48_usqr(&t7, r);          // t7=f^2
+
+    if (BIG_parity(x) == 1)
+    {
+        FP48_pow(&t2, r, x);    // f^u
+        FP48_usqr(&t1, &t2);    // f^(2u)
+        FP48_pow(&t2, &t2, x);  // f^u^2
+    } else {
+        FP48_pow(&t1, &t7, x);      // t1=f^2u
+        BIG_fshr(x, 1);
+        FP48_pow(&t2, &t1, x);      // t2=f^2u^(u/2) =  f^u^2
+        BIG_fshl(x, 1);             // x must be even
+    }
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    FP48_conj(&t1, &t1);
+#endif
+
+    FP48_conj(&t3, &t1);    // t3=f^-2u
+    FP48_mul(&t2, &t3);     // t2=f^u^2.f^-2u
+    FP48_mul(&t2, r);       // t2=f^u^2.f^-2u.f = f^(u^2-2u+1) = f^e15
+
+    FP48_mul(r, &t7);       // f^3
+
+    FP48_pow(&t1, &t2, x);  // f^e15^u = f^(u.e15) = f^(u^3-2u^2+u) = f^(e14)
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    FP48_conj(&t1, &t1);
+#endif
+    FP48_copy(&t3, &t1);
+    FP48_frob(&t3, &X, 14); // f^(u^3-2u^2+u)^p^14
+    FP48_mul(r, &t3);       // f^3.f^(u^3-2u^2+u)^p^14
+
+    FP48_pow(&t1, &t1, x);  // f^(u.e14) = f^(u^4-2u^3+u^2) =  f^(e13)
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    FP48_conj(&t1, &t1);
+#endif
+    FP48_copy(&t3, &t1);
+    FP48_frob(&t3, &X, 13); // f^(e13)^p^13
+    FP48_mul(r, &t3);       // f^3.f^(u^3-2u^2+u)^p^14.f^(u^4-2u^3+u^2)^p^13
+
+    FP48_pow(&t1, &t1, x);  // f^(u.e13)
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    FP48_conj(&t1, &t1);
+#endif
+    FP48_copy(&t3, &t1);
+    FP48_frob(&t3, &X, 12); // f^(e12)^p^12
+    FP48_mul(r, &t3);
+
+    FP48_pow(&t1, &t1, x);  // f^(u.e12)
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    FP48_conj(&t1, &t1);
+#endif
+    FP48_copy(&t3, &t1);
+    FP48_frob(&t3, &X, 11); // f^(e11)^p^11
+    FP48_mul(r, &t3);
+
+    FP48_pow(&t1, &t1, x);  // f^(u.e11)
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    FP48_conj(&t1, &t1);
+#endif
+    FP48_copy(&t3, &t1);
+    FP48_frob(&t3, &X, 10); // f^(e10)^p^10
+    FP48_mul(r, &t3);
+
+    FP48_pow(&t1, &t1, x);  // f^(u.e10)
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    FP48_conj(&t1, &t1);
+#endif
+    FP48_copy(&t3, &t1);
+    FP48_frob(&t3, &X, 9);  // f^(e9)^p^9
+    FP48_mul(r, &t3);
+
+    FP48_pow(&t1, &t1, x);  // f^(u.e9)
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    FP48_conj(&t1, &t1);
+#endif
+    FP48_copy(&t3, &t1);
+    FP48_frob(&t3, &X, 8);  // f^(e8)^p^8
+    FP48_mul(r, &t3);
+
+    FP48_pow(&t1, &t1, x);  // f^(u.e8)
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    FP48_conj(&t1, &t1);
+#endif
+    FP48_conj(&t3, &t2);
+    FP48_mul(&t1, &t3); // f^(u.e8).f^-e15
+    FP48_copy(&t3, &t1);
+    FP48_frob(&t3, &X, 7);  // f^(e7)^p^7
+    FP48_mul(r, &t3);
+
+    FP48_pow(&t1, &t1, x);  // f^(u.e7)
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    FP48_conj(&t1, &t1);
+#endif
+    FP48_copy(&t3, &t1);
+    FP48_frob(&t3, &X, 6);  // f^(e6)^p^6
+    FP48_mul(r, &t3);
+
+    FP48_pow(&t1, &t1, x);  // f^(u.e6)
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    FP48_conj(&t1, &t1);
+#endif
+    FP48_copy(&t3, &t1);
+    FP48_frob(&t3, &X, 5);  // f^(e5)^p^5
+    FP48_mul(r, &t3);
+
+    FP48_pow(&t1, &t1, x);  // f^(u.e5)
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    FP48_conj(&t1, &t1);
+#endif
+    FP48_copy(&t3, &t1);
+    FP48_frob(&t3, &X, 4);  // f^(e4)^p^4
+    FP48_mul(r, &t3);
+
+    FP48_pow(&t1, &t1, x);  // f^(u.e4)
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    FP48_conj(&t1, &t1);
+#endif
+    FP48_copy(&t3, &t1);
+    FP48_frob(&t3, &X, 3);  // f^(e3)^p^3
+    FP48_mul(r, &t3);
+
+    FP48_pow(&t1, &t1, x);  // f^(u.e3)
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    FP48_conj(&t1, &t1);
+#endif
+    FP48_copy(&t3, &t1);
+    FP48_frob(&t3, &X, 2);  // f^(e2)^p^2
+    FP48_mul(r, &t3);
+
+    FP48_pow(&t1, &t1, x);  // f^(u.e2)
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    FP48_conj(&t1, &t1);
+#endif
+    FP48_copy(&t3, &t1);
+    FP48_frob(&t3, &X, 1);  // f^(e1)^p^1
+    FP48_mul(r, &t3);
+
+    FP48_pow(&t1, &t1, x);  // f^(u.e1)
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    FP48_conj(&t1, &t1);
+#endif
+    FP48_mul(r, &t1);       // r.f^e0
+
+    FP48_frob(&t2, &X, 15); // f^(e15.p^15)
+    FP48_mul(r, &t2);
+
+    FP48_reduce(r);
+*/
+}
+
+#ifdef USE_GLV_ZZZ
+/* GLV method */
+static void ZZZ::glv(BIG u[2], BIG ee)
+{
+
+    int bd;
+    BIG q,x,x2;
+    BIG_rcopy(q, CURVE_Order);
+
+// -(x^8).P = (Beta.x,y)
+
+    BIG_rcopy(x, CURVE_Bnx);
+
+    BIG_smul(x2, x, x);
+    BIG_smul(x, x2, x2);
+    BIG_smul(x2, x, x);
+    bd=BIG_nbits(q)-BIG_nbits(x2); // fixed x^8
+
+    BIG_copy(u[0], ee);
+    BIG_ctmod(u[0], x2, bd);
+    BIG_copy(u[1], ee);
+    BIG_ctsdiv(u[1], x2, bd);
+
+    BIG_sub(u[1], q, u[1]);
+
+    return;
+}
+#endif // USE_GLV
+
+/* Galbraith & Scott Method */
+static void ZZZ::gs(BIG u[16], BIG ee)
+{
+    int i,bd;
+    BIG q,x,w;
+    BIG_rcopy(q, CURVE_Order);
+
+    BIG_rcopy(x, CURVE_Bnx);
+    BIG_copy(w, ee);
+    bd=BIG_nbits(q)-BIG_nbits(x); // fixed
+
+    for (i = 0; i < 15; i++)
+    {
+        BIG_copy(u[i], w);
+        BIG_ctmod(u[i], x, bd);
+        BIG_ctsdiv(w, x, bd);
+    }
+    BIG_copy(u[15], w);
+
+    /*  */
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    BIG_modneg(u[1], u[1], q);
+    BIG_modneg(u[3], u[3], q);
+    BIG_modneg(u[5], u[5], q);
+    BIG_modneg(u[7], u[7], q);
+    BIG_modneg(u[9], u[9], q);
+    BIG_modneg(u[11], u[11], q);
+    BIG_modneg(u[13], u[13], q);
+    BIG_modneg(u[15], u[15], q);
+#endif
+
+
+    return;
+}
+
+/* Multiply P by e in group G1 */
+void ZZZ::PAIR_G1mul(ECP *P, BIG e)
+{
+    BIG ee,q;
+    BIG_copy(ee,e);
+    BIG_rcopy(q, CURVE_Order);
+    BIG_mod(ee,q);
+#ifdef USE_GLV_ZZZ   /* Note this method is patented */
+    int np, nn;
+    ECP Q;
+    FP cru;
+    BIG t;
+    BIG u[2];
+
+    glv(u, ee);
+
+    ECP_copy(&Q, P); ECP_affine(&Q);
+    FP_rcopy(&cru, CRu);
+    FP_mul(&(Q.x), &(Q.x), &cru);
+
+    /* note that -a.B = a.(-B). Use a or -a depending on which is smaller */
+
+    np = BIG_nbits(u[0]);
+    BIG_modneg(t, u[0], q);
+    nn = BIG_nbits(t);
+    if (nn < np)
+    {
+        BIG_copy(u[0], t);
+        ECP_neg(P);
+    }
+
+    np = BIG_nbits(u[1]);
+    BIG_modneg(t, u[1], q);
+    nn = BIG_nbits(t);
+    if (nn < np)
+    {
+        BIG_copy(u[1], t);
+        ECP_neg(&Q);
+    }
+    BIG_norm(u[0]);
+    BIG_norm(u[1]);
+    ECP_mul2(P, &Q, u[0], u[1]);
+
+#else
+    ECP_clmul(P, ee, q);
+#endif
+}
+
+/* Multiply P by e in group G2 */
+void ZZZ::PAIR_G2mul(ECP8 *P, BIG e)
+{
+    BIG ee,q;
+    BIG_copy(ee,e);
+    BIG_rcopy(q, CURVE_Order);
+    BIG_mod(ee,q);
+#ifdef USE_GS_G2_ZZZ   /* Well we didn't patent it :) */
+    int i, np, nn;
+    ECP8 Q[16], T;
+    FP2 X[3];
+    BIG x, u[16];
+
+    ECP8_frob_constants(X);
+
+    gs(u, ee);
+
+    ECP8_copy(&Q[0], P);
+
+    for (i = 1; i < 16; i++)
+    {
+        ECP8_copy(&Q[i], &Q[i - 1]);
+        ECP8_frob(&Q[i], X, 1);
+    }
+
+    for (i = 0; i < 16; i++)
+    {
+        np = BIG_nbits(u[i]);
+        BIG_modneg(x, u[i], q);
+        BIG_norm(x);
+        nn = BIG_nbits(x);
+        if (nn < np)
+        {
+            BIG_copy(u[i], x);
+            ECP8_neg(&Q[i]);
+        }
+        BIG_norm(u[i]);
+    }
+
+    ECP8_mul16(P, Q, u);
+
+#else
+    ECP8_mul(P, ee);
+#endif
+}
+
+/* f=f^e */
+void ZZZ::PAIR_GTpow(FP48 *f, BIG e)
+{
+    BIG ee,q;
+    BIG_copy(ee,e);
+    BIG_rcopy(q, CURVE_Order);
+    BIG_mod(ee,q);
+#ifdef USE_GS_GT_ZZZ   /* Note that this option requires a lot of RAM! Maybe better to use compressed XTR method, see FP16.cpp */
+    int i, np, nn;
+    FP48 g[16];
+    FP2 X;
+    BIG t;
+    FP fx, fy;
+    BIG u[16];
+
+    FP_rcopy(&fx, Fra);
+    FP_rcopy(&fy, Frb);
+    FP2_from_FPs(&X, &fx, &fy);
+
+    gs(u, ee);
+
+    FP48_copy(&g[0], f);
+    for (i = 1; i < 16; i++)
+    {
+        FP48_copy(&g[i], &g[i - 1]);
+        FP48_frob(&g[i], &X, 1);
+    }
+
+    for (i = 0; i < 16; i++)
+    {
+        np = BIG_nbits(u[i]);
+        BIG_modneg(t, u[i], q);
+        nn = BIG_nbits(t);
+        if (nn < np)
+        {
+            BIG_copy(u[i], t);
+            FP48_conj(&g[i], &g[i]);
+        }
+        BIG_norm(u[i]);
+    }
+    FP48_pow16(f, g, u);
+
+#else
+    FP48_pow(f, f, ee);
+#endif
+}
+
+/* test G1 group membership */
+
+int ZZZ::PAIR_G1member(ECP *P)
+{
+    ECP W,T;
+    BIG x;
+    FP cru;
+    if (ECP_isinf(P)) return 0;
+
+    BIG_rcopy(x, CURVE_Bnx);
+    ECP_copy(&W,P);
+    ECP_copy(&T,P);
+    ECP_mul(&T,x); 
+    if (ECP_equals(P,&T)) return 0;    // P is of low order    
+    ECP_mul(&T,x);
+    ECP_mul(&T,x); ECP_mul(&T,x);
+    ECP_mul(&T,x); ECP_mul(&T,x);
+    ECP_mul(&T,x); ECP_mul(&T,x);
+    ECP_neg(&T);
+
+    FP_rcopy(&cru, CRu);
+    FP_mul(&(W.x), &(W.x), &cru);
+    if (!ECP_equals(&W,&T)) return 0;  // check that Endomorphism works
+
+// Not needed
+//    ECP_add(&W,P);
+//    FP_mul(&(T.x), &(T.x), &cru);
+//    ECP_add(&W,&T);
+//    if (!ECP_isinf(&W)) return 0;      // use it to check order
+/*
+	BIG q;
+	ECP W;
+    if (ECP_isinf(P)) return 0;
+    BIG_rcopy(q, CURVE_Order);
+	ECP_copy(&W,P);
+	ECP_mul(&W,q);
+	if (!ECP_isinf(&W)) return 0; */
+	return 1; 
+}
+
+/* test G2 group membership */
+
+int ZZZ::PAIR_G2member(ECP8 *P)
+{
+    ECP8 W,T;
+    BIG x;
+    FP2 X[3];
+
+    if (ECP8_isinf(P)) return 0;
+    ECP8_frob_constants(X);
+    BIG_rcopy(x, CURVE_Bnx);
+
+    ECP8_copy(&W,P);
+    ECP8_frob(&W, X, 1);
+
+    ECP8_copy(&T,P);
+    ECP8_mul(&T,x);
+
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    ECP8_neg(&T);
+#endif
+/*
+    ECP8_copy(&R,&W);
+    ECP8_frob(&R,X,1);    // R=\psi^2(P)
+    ECP8_sub(&W,&R);
+    ECP8_copy(&R,&T);    // R=xP
+    ECP8_frob(&R,X,1);
+    ECP8_add(&W,&R);     // W=\psi(P)-\psi^2(P)+\psi(xP)
+*/
+    if (ECP8_equals(&W,&T)) return 1;
+    return 0;
+
+
+/*	BIG q;
+	ECP8 W;
+    if (ECP8_isinf(P)) return 0;
+    BIG_rcopy(q, CURVE_Order);
+	ECP8_copy(&W,P);
+	ECP8_mul(&W,q);
+	if (!ECP8_isinf(&W)) return 0;
+	return 1; */
+}
+
+
+/* Check that m is in cyclotomic sub-group */
+/* Check that m!=1, conj(m)*m==1, and m.m^{p^16}=m^{p^8} */
+int ZZZ::PAIR_GTcyclotomic(FP48 *m)
+{
+	FP fx,fy;
+	FP2 X;
+	FP48 r,w;
+	if (FP48_isunity(m)) return 0;
+	FP48_conj(&r,m);
+	FP48_mul(&r,m);
+	if (!FP48_isunity(&r)) return 0;
+
+	FP_rcopy(&fx,Fra);
+	FP_rcopy(&fy,Frb);
+	FP2_from_FPs(&X,&fx,&fy);
+
+	FP48_copy(&r,m); FP48_frob(&r,&X,8); 
+	FP48_copy(&w,&r); FP48_frob(&w,&X,8); 
+	FP48_mul(&w,m);
+
+	if (!FP48_equals(&w,&r)) return 0;
+    return 1;
+}
+
+/* test for full GT group membership */
+int ZZZ::PAIR_GTmember(FP48 *m)
+{
+    BIG x;
+    FP2 X;
+    FP fx, fy;
+    FP48 r,t;
+    if (!PAIR_GTcyclotomic(m)) return 0;
+
+    FP_rcopy(&fx, Fra);
+    FP_rcopy(&fy, Frb);
+    FP2_from_FPs(&X, &fx, &fy);
+    BIG_rcopy(x, CURVE_Bnx);
+
+    FP48_copy(&r,m);
+    FP48_frob(&r, &X, 1);
+
+    FP48_pow(&t,m,x);
+
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    FP48_conj(&t,&t);
+#endif
+
+    if (FP48_equals(&r,&t)) return 1;
+    return 0;
+/*
+    BIG_rcopy(q, CURVE_Order);
+    FP48_pow(&r, m, q);
+	if (!FP48_isunity(&r)) return 0;
+	return 1; */
+}
+
+#ifdef HAS_MAIN
+
+using namespace std;
+using namespace ZZZ;
+
+
+// g++ -O2 pair8_BLS48.cpp ecp8_BLS48.cpp fp48_BLS48.cpp fp16_BLS48.cpp fp8_BLS48.cpp fp4_BLS48.cpp fp2_BLS48.cpp ecp_BLS48.cpp fp_BLS48.cpp big_B560_29.cpp rom_curve_BLS48.cpp rom_field_BLS48.cpp rand.cpp hash.cpp oct.cpp -o pair8_BLS48.exe
+
+int main()
+{
+    int i;
+    char byt[32];
+    csprng rng;
+    BIG xa, xb, ya, yb, w, a, b, t1, q, u[2], v[4], m, r, xx, x2, x4, p;
+    ECP8 P, G;
+    ECP Q, R;
+    FP48 g, gp;
+    FP16 t, c, cp, cpm1, cpm2;
+    FP8 X, Y;
+    FP2 x, y, f, Aa, Bb;
+    FP cru;
+
+    for (i = 0; i < 32; i++)
+        byt[i] = i + 9;
+    RAND_seed(&rng, 32, byt);
+
+    BIG_rcopy(r, CURVE_Order);
+    BIG_rcopy(p, Modulus);
+
+
+    BIG_rcopy(xa, CURVE_Gx);
+    BIG_rcopy(ya, CURVE_Gy);
+
+    ECP_set(&Q, xa, ya);
+    if (Q.inf) printf("Failed to set - point not on curve\n");
+    else printf("G1 set success\n");
+
+    printf("Q= ");
+    ECP_output(&Q);
+    printf("\n");
+
+    ECP8_generator(&P);
+
+    if (P.inf) printf("Failed to set - point not on curve\n");
+    else printf("G2 set success\n");
+
+    BIG_rcopy(a, Fra);
+    BIG_rcopy(b, Frb);
+    FP2_from_BIGs(&f, a, b);
+
+    PAIR_ate(&g, &P, &Q);
+
+    printf("gb= ");
+    FP48_output(&g);
+    printf("\n");
+    PAIR_fexp(&g);
+
+    printf("g= ");
+    FP48_output(&g);
+    printf("\n");
+
+    ECP_copy(&R, &Q);
+    ECP8_copy(&G, &P);
+
+    ECP8_dbl(&G);
+    ECP_dbl(&R);
+    ECP_affine(&R);
+
+    PAIR_ate(&g, &G, &Q);
+    PAIR_fexp(&g);
+
+    printf("g1= ");
+    FP48_output(&g);
+    printf("\n");
+
+    PAIR_ate(&g, &P, &R);
+    PAIR_fexp(&g);
+
+    printf("g2= ");
+    FP48_output(&g);
+    printf("\n");
+
+    PAIR_G1mul(&Q, r);
+    printf("rQ= "); ECP_output(&Q); printf("\n");
+
+    PAIR_G2mul(&P, r);
+    printf("rP= "); ECP8_output(&P); printf("\n");
+
+    PAIR_GTpow(&g, r);
+    printf("g^r= "); FP48_output(&g); printf("\n");
+
+    BIG_randomnum(w, r, &rng);
+
+    FP48_copy(&gp, &g);
+
+    PAIR_GTpow(&g, w);
+
+    FP48_trace(&t, &g);
+
+    printf("g^r=  "); FP16_output(&t); printf("\n");
+
+    FP48_compow(&t, &gp, w, r);
+
+    printf("t(g)= "); FP16_output(&t); printf("\n");
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/pair8.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/pair8.h
new file mode 100644
index 0000000..cfd12ee
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/pair8.h
@@ -0,0 +1,179 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef PAIR8_ZZZ_H
+#define PAIR8_ZZZ_H
+
+#include "fp48_YYY.h"
+#include "ecp8_ZZZ.h"
+#include "ecp_ZZZ.h"
+
+using namespace core;
+
+namespace ZZZ {
+/* Pairing constants */
+
+extern const XXX::BIG CURVE_Bnx; /**< BN curve x parameter */
+extern const XXX::BIG CURVE_Cru; /**< BN curve Cube Root of Unity */
+
+extern const XXX::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const XXX::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const XXX::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const XXX::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+/* Pairing function prototypes */
+
+/**	@brief Precompute line functions details for fixed G2 value
+ *
+	@param T array of precomputed FP16 partial line functions
+	@param GV a fixed ECP8 instance
+ */
+extern void PAIR_precomp(YYY::FP16 T[], ECP8* GV);
+
+
+/**	@brief Calculate Miller loop for Optimal ATE pairing e(P,Q)
+ *
+	@param r FP48 result of the pairing calculation e(P,Q)
+	@param P ECP8 instance, an element of G2
+	@param Q ECP instance, an element of G1
+
+ */
+extern void PAIR_ate(YYY::FP48 *r, ECP8 *P, ECP *Q);
+/**	@brief Calculate Miller loop for Optimal ATE double-pairing e(P,Q).e(R,S)
+ *
+	Faster than calculating two separate pairings
+	@param r FP48 result of the pairing calculation e(P,Q).e(R,S), an element of GT
+	@param P ECP8 instance, an element of G2
+	@param Q ECP instance, an element of G1
+	@param R ECP8 instance, an element of G2
+	@param S ECP instance, an element of G1
+ */
+extern void PAIR_double_ate(YYY::FP48 *r, ECP8 *P, ECP *Q, ECP8 *R, ECP *S);
+/**	@brief Final exponentiation of pairing, converts output of Miller loop to element in GT
+ *
+	Here p is the internal modulus, and r is the group order
+	@param x FP48, on exit = x^((p^12-1)/r)
+ */
+extern void PAIR_fexp(YYY::FP48 *x);
+/**	@brief Fast point multiplication of a member of the group G1 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param Q ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G1mul(ECP *Q, XXX::BIG b);
+/**	@brief Fast point multiplication of a member of the group G2 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param P ECP8 member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G2mul(ECP8 *P, XXX::BIG b);
+/**	@brief Fast raising of a member of GT to a BIG power
+ *
+	May exploit endomorphism for speed.
+	@param x FP48 member of GT.
+	@param b BIG exponent
+
+ */
+extern void PAIR_GTpow(YYY::FP48 *x, XXX::BIG b);
+
+/**	@brief Tests ECP for membership of G1
+ *
+	@param P ECP member of G1
+	@return true or false
+
+ */
+extern int PAIR_G1member(ZZZ::ECP *P);
+
+/**	@brief Tests ECP8 for membership of G2
+ *
+	@param P ECP8 member of G2
+	@return true or false
+
+ */
+extern int PAIR_G2member(ZZZ::ECP8 *P);
+
+/**	@brief Tests FP48 for membership of cyclotomic subgroup
+ *
+	@param x FP48 instance
+	@return 1 if x is cyclotomic, else return 0
+
+ */
+extern int PAIR_GTcyclotomic(YYY::FP48 *x);
+
+/**	@brief Tests FP48 for full membership of GT
+ *
+	@param x FP48 instance
+	@return 1 if x is in GT, else return 0
+
+ */
+extern int PAIR_GTmember(YYY::FP48 *x);
+
+/**	@brief Precompute line functions for n-pairing
+ *
+	@param r array of precomputed FP48 products of line functions
+	@param PV ECP8 instance, an element of G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another(YYY::FP48 r[], ECP8* PV, ECP* QV);
+
+
+/**	@brief Compute line functions for n-pairing, assuming precomputation on G2
+ *
+	@param r array of precomputed FP48 products of line functions
+	@param T array contains precomputed partial line fucntions from G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another_pc(YYY::FP48 r[], YYY::FP16 T[], ECP *QV);
+
+
+
+/**	@brief Prepare Ate parameter
+ *
+	@param n BIG parameter
+	@param n3 BIG paramter = 3*n
+	@return number of nits in n3
+
+ */
+extern int PAIR_nbits(XXX::BIG n3, XXX::BIG n);
+
+/**	@brief Initialise structure for multi-pairing
+ *
+	@param r FP48 array, to be initialised to 1
+
+ */
+extern void PAIR_initmp(YYY::FP48 r[]);
+
+
+/**	@brief Miller loop
+ *
+ 	@param res FP48 result
+	@param r FP48 precomputed array of accumulated line functions
+
+ */
+extern void PAIR_miller(YYY::FP48 *res, YYY::FP48 r[]);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/pair8_BLS48286.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/pair8_BLS48286.h
new file mode 100644
index 0000000..15ad558
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/pair8_BLS48286.h
@@ -0,0 +1,179 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef PAIR8_BLS48286_H
+#define PAIR8_BLS48286_H
+
+#include "fp48_BLS48286.h"
+#include "ecp8_BLS48286.h"
+#include "ecp_BLS48286.h"
+
+using namespace core;
+
+namespace BLS48286 {
+/* Pairing constants */
+
+extern const B288_60::BIG CURVE_Bnx; /**< BN curve x parameter */
+extern const B288_60::BIG CURVE_Cru; /**< BN curve Cube Root of Unity */
+
+extern const B288_60::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B288_60::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B288_60::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B288_60::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+/* Pairing function prototypes */
+
+/**	@brief Precompute line functions details for fixed G2 value
+ *
+	@param T array of precomputed FP16 partial line functions
+	@param GV a fixed ECP8 instance
+ */
+extern void PAIR_precomp(BLS48286::FP16 T[], ECP8* GV);
+
+
+/**	@brief Calculate Miller loop for Optimal ATE pairing e(P,Q)
+ *
+	@param r FP48 result of the pairing calculation e(P,Q)
+	@param P ECP8 instance, an element of G2
+	@param Q ECP instance, an element of G1
+
+ */
+extern void PAIR_ate(BLS48286::FP48 *r, ECP8 *P, ECP *Q);
+/**	@brief Calculate Miller loop for Optimal ATE double-pairing e(P,Q).e(R,S)
+ *
+	Faster than calculating two separate pairings
+	@param r FP48 result of the pairing calculation e(P,Q).e(R,S), an element of GT
+	@param P ECP8 instance, an element of G2
+	@param Q ECP instance, an element of G1
+	@param R ECP8 instance, an element of G2
+	@param S ECP instance, an element of G1
+ */
+extern void PAIR_double_ate(BLS48286::FP48 *r, ECP8 *P, ECP *Q, ECP8 *R, ECP *S);
+/**	@brief Final exponentiation of pairing, converts output of Miller loop to element in GT
+ *
+	Here p is the internal modulus, and r is the group order
+	@param x FP48, on exit = x^((p^12-1)/r)
+ */
+extern void PAIR_fexp(BLS48286::FP48 *x);
+/**	@brief Fast point multiplication of a member of the group G1 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param Q ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G1mul(ECP *Q, B288_60::BIG b);
+/**	@brief Fast point multiplication of a member of the group G2 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param P ECP8 member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G2mul(ECP8 *P, B288_60::BIG b);
+/**	@brief Fast raising of a member of GT to a BIG power
+ *
+	May exploit endomorphism for speed.
+	@param x FP48 member of GT.
+	@param b BIG exponent
+
+ */
+extern void PAIR_GTpow(BLS48286::FP48 *x, B288_60::BIG b);
+
+/**	@brief Tests ECP for membership of G1
+ *
+	@param P ECP member of G1
+	@return true or false
+
+ */
+extern int PAIR_G1member(BLS48286::ECP *P);
+
+/**	@brief Tests ECP8 for membership of G2
+ *
+	@param P ECP8 member of G2
+	@return true or false
+
+ */
+extern int PAIR_G2member(BLS48286::ECP8 *P);
+
+/**	@brief Tests FP48 for membership of cyclotomic subgroup
+ *
+	@param x FP48 instance
+	@return 1 if x is cyclotomic, else return 0
+
+ */
+extern int PAIR_GTcyclotomic(BLS48286::FP48 *x);
+
+/**	@brief Tests FP48 for full membership of GT
+ *
+	@param x FP48 instance
+	@return 1 if x is in GT, else return 0
+
+ */
+extern int PAIR_GTmember(BLS48286::FP48 *x);
+
+/**	@brief Precompute line functions for n-pairing
+ *
+	@param r array of precomputed FP48 products of line functions
+	@param PV ECP8 instance, an element of G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another(BLS48286::FP48 r[], ECP8* PV, ECP* QV);
+
+
+/**	@brief Compute line functions for n-pairing, assuming precomputation on G2
+ *
+	@param r array of precomputed FP48 products of line functions
+	@param T array contains precomputed partial line fucntions from G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another_pc(BLS48286::FP48 r[], BLS48286::FP16 T[], ECP *QV);
+
+
+
+/**	@brief Prepare Ate parameter
+ *
+	@param n BIG parameter
+	@param n3 BIG paramter = 3*n
+	@return number of nits in n3
+
+ */
+extern int PAIR_nbits(B288_60::BIG n3, B288_60::BIG n);
+
+/**	@brief Initialise structure for multi-pairing
+ *
+	@param r FP48 array, to be initialised to 1
+
+ */
+extern void PAIR_initmp(BLS48286::FP48 r[]);
+
+
+/**	@brief Miller loop
+ *
+ 	@param res FP48 result
+	@param r FP48 precomputed array of accumulated line functions
+
+ */
+extern void PAIR_miller(BLS48286::FP48 *res, BLS48286::FP48 r[]);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/pair8_BLS48556.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/pair8_BLS48556.h
new file mode 100644
index 0000000..11201ca
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/pair8_BLS48556.h
@@ -0,0 +1,179 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef PAIR8_BLS48556_H
+#define PAIR8_BLS48556_H
+
+#include "fp48_BLS48556.h"
+#include "ecp8_BLS48556.h"
+#include "ecp_BLS48556.h"
+
+using namespace core;
+
+namespace BLS48556 {
+/* Pairing constants */
+
+extern const B560_58::BIG CURVE_Bnx; /**< BN curve x parameter */
+extern const B560_58::BIG CURVE_Cru; /**< BN curve Cube Root of Unity */
+
+extern const B560_58::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B560_58::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B560_58::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B560_58::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+/* Pairing function prototypes */
+
+/**	@brief Precompute line functions details for fixed G2 value
+ *
+	@param T array of precomputed FP16 partial line functions
+	@param GV a fixed ECP8 instance
+ */
+extern void PAIR_precomp(BLS48556::FP16 T[], ECP8* GV);
+
+
+/**	@brief Calculate Miller loop for Optimal ATE pairing e(P,Q)
+ *
+	@param r FP48 result of the pairing calculation e(P,Q)
+	@param P ECP8 instance, an element of G2
+	@param Q ECP instance, an element of G1
+
+ */
+extern void PAIR_ate(BLS48556::FP48 *r, ECP8 *P, ECP *Q);
+/**	@brief Calculate Miller loop for Optimal ATE double-pairing e(P,Q).e(R,S)
+ *
+	Faster than calculating two separate pairings
+	@param r FP48 result of the pairing calculation e(P,Q).e(R,S), an element of GT
+	@param P ECP8 instance, an element of G2
+	@param Q ECP instance, an element of G1
+	@param R ECP8 instance, an element of G2
+	@param S ECP instance, an element of G1
+ */
+extern void PAIR_double_ate(BLS48556::FP48 *r, ECP8 *P, ECP *Q, ECP8 *R, ECP *S);
+/**	@brief Final exponentiation of pairing, converts output of Miller loop to element in GT
+ *
+	Here p is the internal modulus, and r is the group order
+	@param x FP48, on exit = x^((p^12-1)/r)
+ */
+extern void PAIR_fexp(BLS48556::FP48 *x);
+/**	@brief Fast point multiplication of a member of the group G1 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param Q ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G1mul(ECP *Q, B560_58::BIG b);
+/**	@brief Fast point multiplication of a member of the group G2 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param P ECP8 member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G2mul(ECP8 *P, B560_58::BIG b);
+/**	@brief Fast raising of a member of GT to a BIG power
+ *
+	May exploit endomorphism for speed.
+	@param x FP48 member of GT.
+	@param b BIG exponent
+
+ */
+extern void PAIR_GTpow(BLS48556::FP48 *x, B560_58::BIG b);
+
+/**	@brief Tests ECP for membership of G1
+ *
+	@param P ECP member of G1
+	@return true or false
+
+ */
+extern int PAIR_G1member(BLS48556::ECP *P);
+
+/**	@brief Tests ECP8 for membership of G2
+ *
+	@param P ECP8 member of G2
+	@return true or false
+
+ */
+extern int PAIR_G2member(BLS48556::ECP8 *P);
+
+/**	@brief Tests FP48 for membership of cyclotomic subgroup
+ *
+	@param x FP48 instance
+	@return 1 if x is cyclotomic, else return 0
+
+ */
+extern int PAIR_GTcyclotomic(BLS48556::FP48 *x);
+
+/**	@brief Tests FP48 for full membership of GT
+ *
+	@param x FP48 instance
+	@return 1 if x is in GT, else return 0
+
+ */
+extern int PAIR_GTmember(BLS48556::FP48 *x);
+
+/**	@brief Precompute line functions for n-pairing
+ *
+	@param r array of precomputed FP48 products of line functions
+	@param PV ECP8 instance, an element of G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another(BLS48556::FP48 r[], ECP8* PV, ECP* QV);
+
+
+/**	@brief Compute line functions for n-pairing, assuming precomputation on G2
+ *
+	@param r array of precomputed FP48 products of line functions
+	@param T array contains precomputed partial line fucntions from G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another_pc(BLS48556::FP48 r[], BLS48556::FP16 T[], ECP *QV);
+
+
+
+/**	@brief Prepare Ate parameter
+ *
+	@param n BIG parameter
+	@param n3 BIG paramter = 3*n
+	@return number of nits in n3
+
+ */
+extern int PAIR_nbits(B560_58::BIG n3, B560_58::BIG n);
+
+/**	@brief Initialise structure for multi-pairing
+ *
+	@param r FP48 array, to be initialised to 1
+
+ */
+extern void PAIR_initmp(BLS48556::FP48 r[]);
+
+
+/**	@brief Miller loop
+ *
+ 	@param res FP48 result
+	@param r FP48 precomputed array of accumulated line functions
+
+ */
+extern void PAIR_miller(BLS48556::FP48 *res, BLS48556::FP48 r[]);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/pair8_BLS48581.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/pair8_BLS48581.h
new file mode 100644
index 0000000..2d220b8
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/pair8_BLS48581.h
@@ -0,0 +1,179 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef PAIR8_BLS48581_H
+#define PAIR8_BLS48581_H
+
+#include "fp48_BLS48581.h"
+#include "ecp8_BLS48581.h"
+#include "ecp_BLS48581.h"
+
+using namespace core;
+
+namespace BLS48581 {
+/* Pairing constants */
+
+extern const B584_60::BIG CURVE_Bnx; /**< BN curve x parameter */
+extern const B584_60::BIG CURVE_Cru; /**< BN curve Cube Root of Unity */
+
+extern const B584_60::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B584_60::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B584_60::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B584_60::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+/* Pairing function prototypes */
+
+/**	@brief Precompute line functions details for fixed G2 value
+ *
+	@param T array of precomputed FP16 partial line functions
+	@param GV a fixed ECP8 instance
+ */
+extern void PAIR_precomp(BLS48581::FP16 T[], ECP8* GV);
+
+
+/**	@brief Calculate Miller loop for Optimal ATE pairing e(P,Q)
+ *
+	@param r FP48 result of the pairing calculation e(P,Q)
+	@param P ECP8 instance, an element of G2
+	@param Q ECP instance, an element of G1
+
+ */
+extern void PAIR_ate(BLS48581::FP48 *r, ECP8 *P, ECP *Q);
+/**	@brief Calculate Miller loop for Optimal ATE double-pairing e(P,Q).e(R,S)
+ *
+	Faster than calculating two separate pairings
+	@param r FP48 result of the pairing calculation e(P,Q).e(R,S), an element of GT
+	@param P ECP8 instance, an element of G2
+	@param Q ECP instance, an element of G1
+	@param R ECP8 instance, an element of G2
+	@param S ECP instance, an element of G1
+ */
+extern void PAIR_double_ate(BLS48581::FP48 *r, ECP8 *P, ECP *Q, ECP8 *R, ECP *S);
+/**	@brief Final exponentiation of pairing, converts output of Miller loop to element in GT
+ *
+	Here p is the internal modulus, and r is the group order
+	@param x FP48, on exit = x^((p^12-1)/r)
+ */
+extern void PAIR_fexp(BLS48581::FP48 *x);
+/**	@brief Fast point multiplication of a member of the group G1 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param Q ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G1mul(ECP *Q, B584_60::BIG b);
+/**	@brief Fast point multiplication of a member of the group G2 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param P ECP8 member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G2mul(ECP8 *P, B584_60::BIG b);
+/**	@brief Fast raising of a member of GT to a BIG power
+ *
+	May exploit endomorphism for speed.
+	@param x FP48 member of GT.
+	@param b BIG exponent
+
+ */
+extern void PAIR_GTpow(BLS48581::FP48 *x, B584_60::BIG b);
+
+/**	@brief Tests ECP for membership of G1
+ *
+	@param P ECP member of G1
+	@return true or false
+
+ */
+extern int PAIR_G1member(BLS48581::ECP *P);
+
+/**	@brief Tests ECP8 for membership of G2
+ *
+	@param P ECP8 member of G2
+	@return true or false
+
+ */
+extern int PAIR_G2member(BLS48581::ECP8 *P);
+
+/**	@brief Tests FP48 for membership of cyclotomic subgroup
+ *
+	@param x FP48 instance
+	@return 1 if x is cyclotomic, else return 0
+
+ */
+extern int PAIR_GTcyclotomic(BLS48581::FP48 *x);
+
+/**	@brief Tests FP48 for full membership of GT
+ *
+	@param x FP48 instance
+	@return 1 if x is in GT, else return 0
+
+ */
+extern int PAIR_GTmember(BLS48581::FP48 *x);
+
+/**	@brief Precompute line functions for n-pairing
+ *
+	@param r array of precomputed FP48 products of line functions
+	@param PV ECP8 instance, an element of G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another(BLS48581::FP48 r[], ECP8* PV, ECP* QV);
+
+
+/**	@brief Compute line functions for n-pairing, assuming precomputation on G2
+ *
+	@param r array of precomputed FP48 products of line functions
+	@param T array contains precomputed partial line fucntions from G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another_pc(BLS48581::FP48 r[], BLS48581::FP16 T[], ECP *QV);
+
+
+
+/**	@brief Prepare Ate parameter
+ *
+	@param n BIG parameter
+	@param n3 BIG paramter = 3*n
+	@return number of nits in n3
+
+ */
+extern int PAIR_nbits(B584_60::BIG n3, B584_60::BIG n);
+
+/**	@brief Initialise structure for multi-pairing
+ *
+	@param r FP48 array, to be initialised to 1
+
+ */
+extern void PAIR_initmp(BLS48581::FP48 r[]);
+
+
+/**	@brief Miller loop
+ *
+ 	@param res FP48 result
+	@param r FP48 precomputed array of accumulated line functions
+
+ */
+extern void PAIR_miller(BLS48581::FP48 *res, BLS48581::FP48 r[]);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/pair_BLS12381.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/pair_BLS12381.h
new file mode 100644
index 0000000..2008cc8
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/pair_BLS12381.h
@@ -0,0 +1,183 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef PAIR_BLS12381_H
+#define PAIR_BLS12381_H
+
+#include "fp12_BLS12381.h"
+#include "ecp2_BLS12381.h"
+#include "ecp_BLS12381.h"
+
+using namespace core;
+
+namespace BLS12381 {
+/* Pairing constants */
+
+extern const B384_58::BIG CURVE_Bnx; /**< BN curve x parameter */
+extern const B384_58::BIG CURVE_Cru; /**< BN curve Cube Root of Unity */
+
+extern const B384_58::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B384_58::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B384_58::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B384_58::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+/* Pairing function prototypes */
+
+
+/**	@brief Precompute line functions details for fixed G2 value
+ *
+	@param T array of precomputed FP4 partial line functions
+	@param GV a fixed ECP2 instance
+ */
+extern void PAIR_precomp(BLS12381::FP4 T[], ECP2* GV);
+
+/**	@brief Compute line functions for n-pairing
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param PV ECP2 instance, an element of G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another(BLS12381::FP12 r[], ECP2* PV, ECP* QV);
+
+
+/**	@brief Compute line functions for n-pairing, assuming precomputation on G2
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param T array contains precomputed partial line fucntions from G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another_pc(BLS12381::FP12 r[], BLS12381::FP4 T[], ECP *QV);
+
+
+
+/**	@brief Calculate Miller loop for Optimal ATE pairing e(P,Q)
+ *
+	@param r FP12 result of the pairing calculation e(P,Q)
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+
+ */
+extern void PAIR_ate(BLS12381::FP12 *r, ECP2 *P, ECP *Q);
+/**	@brief Calculate Miller loop for Optimal ATE double-pairing e(P,Q).e(R,S)
+ *
+	Faster than calculating two separate pairings
+	@param r FP12 result of the pairing calculation e(P,Q).e(R,S), an element of GT
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+	@param R ECP2 instance, an element of G2
+	@param S ECP instance, an element of G1
+ */
+extern void PAIR_double_ate(BLS12381::FP12 *r, ECP2 *P, ECP *Q, ECP2 *R, ECP *S);
+/**	@brief Final exponentiation of pairing, converts output of Miller loop to element in GT
+ *
+	Here p is the internal modulus, and r is the group order
+	@param x FP12, on exit = x^((p^12-1)/r)
+ */
+extern void PAIR_fexp(BLS12381::FP12 *x);
+/**	@brief Fast point multiplication of a member of the group G1 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param Q ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G1mul(ECP *Q, B384_58::BIG b);
+/**	@brief Fast point multiplication of a member of the group G2 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param P ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G2mul(ECP2 *P, B384_58::BIG b);
+
+
+
+/**	@brief Fast raising of a member of GT to a BIG power
+ *
+	May exploit endomorphism for speed.
+	@param x FP12 member of GT.
+	@param b BIG exponent
+
+ */
+extern void PAIR_GTpow(BLS12381::FP12 *x, B384_58::BIG b);
+
+
+/**	@brief Tests ECP for membership of G1
+ *
+	@param P ECP member of G1
+	@return true or false
+
+ */
+extern int PAIR_G1member(BLS12381::ECP *P);
+
+/**	@brief Tests ECP2 for membership of G2
+ *
+	@param P ECP2 member of G2
+	@return true or false
+
+ */
+extern int PAIR_G2member(BLS12381::ECP2 *P);
+
+/**	@brief Tests FP12 for membership of cyclotomic sub-group
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTcyclotomic(BLS12381::FP12 *x);
+
+/**	@brief Tests FP12 for membership of GT
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTmember(BLS12381::FP12 *x);
+
+/**	@brief Prepare Ate parameter
+ *
+	@param n BIG parameter
+	@param n3 BIG paramter = 3*n
+	@return number of nits in n3
+
+ */
+extern int PAIR_nbits(B384_58::BIG n3, B384_58::BIG n);
+
+/**	@brief Initialise structure for multi-pairing
+ *
+	@param r FP12 array, to be initialised to 1
+
+ */
+extern void PAIR_initmp(BLS12381::FP12 r[]);
+
+
+/**	@brief Miller loop
+ *
+ 	@param res FP12 result
+	@param r FP12 precomputed array of accumulated line functions
+
+ */
+extern void PAIR_miller(BLS12381::FP12 *res, BLS12381::FP12 r[]);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/pair_BLS12383.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/pair_BLS12383.h
new file mode 100644
index 0000000..a15eb52
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/pair_BLS12383.h
@@ -0,0 +1,183 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef PAIR_BLS12383_H
+#define PAIR_BLS12383_H
+
+#include "fp12_BLS12383.h"
+#include "ecp2_BLS12383.h"
+#include "ecp_BLS12383.h"
+
+using namespace core;
+
+namespace BLS12383 {
+/* Pairing constants */
+
+extern const B384_58::BIG CURVE_Bnx; /**< BN curve x parameter */
+extern const B384_58::BIG CURVE_Cru; /**< BN curve Cube Root of Unity */
+
+extern const B384_58::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B384_58::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B384_58::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B384_58::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+/* Pairing function prototypes */
+
+
+/**	@brief Precompute line functions details for fixed G2 value
+ *
+	@param T array of precomputed FP4 partial line functions
+	@param GV a fixed ECP2 instance
+ */
+extern void PAIR_precomp(BLS12383::FP4 T[], ECP2* GV);
+
+/**	@brief Compute line functions for n-pairing
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param PV ECP2 instance, an element of G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another(BLS12383::FP12 r[], ECP2* PV, ECP* QV);
+
+
+/**	@brief Compute line functions for n-pairing, assuming precomputation on G2
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param T array contains precomputed partial line fucntions from G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another_pc(BLS12383::FP12 r[], BLS12383::FP4 T[], ECP *QV);
+
+
+
+/**	@brief Calculate Miller loop for Optimal ATE pairing e(P,Q)
+ *
+	@param r FP12 result of the pairing calculation e(P,Q)
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+
+ */
+extern void PAIR_ate(BLS12383::FP12 *r, ECP2 *P, ECP *Q);
+/**	@brief Calculate Miller loop for Optimal ATE double-pairing e(P,Q).e(R,S)
+ *
+	Faster than calculating two separate pairings
+	@param r FP12 result of the pairing calculation e(P,Q).e(R,S), an element of GT
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+	@param R ECP2 instance, an element of G2
+	@param S ECP instance, an element of G1
+ */
+extern void PAIR_double_ate(BLS12383::FP12 *r, ECP2 *P, ECP *Q, ECP2 *R, ECP *S);
+/**	@brief Final exponentiation of pairing, converts output of Miller loop to element in GT
+ *
+	Here p is the internal modulus, and r is the group order
+	@param x FP12, on exit = x^((p^12-1)/r)
+ */
+extern void PAIR_fexp(BLS12383::FP12 *x);
+/**	@brief Fast point multiplication of a member of the group G1 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param Q ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G1mul(ECP *Q, B384_58::BIG b);
+/**	@brief Fast point multiplication of a member of the group G2 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param P ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G2mul(ECP2 *P, B384_58::BIG b);
+
+
+
+/**	@brief Fast raising of a member of GT to a BIG power
+ *
+	May exploit endomorphism for speed.
+	@param x FP12 member of GT.
+	@param b BIG exponent
+
+ */
+extern void PAIR_GTpow(BLS12383::FP12 *x, B384_58::BIG b);
+
+
+/**	@brief Tests ECP for membership of G1
+ *
+	@param P ECP member of G1
+	@return true or false
+
+ */
+extern int PAIR_G1member(BLS12383::ECP *P);
+
+/**	@brief Tests ECP2 for membership of G2
+ *
+	@param P ECP2 member of G2
+	@return true or false
+
+ */
+extern int PAIR_G2member(BLS12383::ECP2 *P);
+
+/**	@brief Tests FP12 for membership of cyclotomic sub-group
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTcyclotomic(BLS12383::FP12 *x);
+
+/**	@brief Tests FP12 for membership of GT
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTmember(BLS12383::FP12 *x);
+
+/**	@brief Prepare Ate parameter
+ *
+	@param n BIG parameter
+	@param n3 BIG paramter = 3*n
+	@return number of nits in n3
+
+ */
+extern int PAIR_nbits(B384_58::BIG n3, B384_58::BIG n);
+
+/**	@brief Initialise structure for multi-pairing
+ *
+	@param r FP12 array, to be initialised to 1
+
+ */
+extern void PAIR_initmp(BLS12383::FP12 r[]);
+
+
+/**	@brief Miller loop
+ *
+ 	@param res FP12 result
+	@param r FP12 precomputed array of accumulated line functions
+
+ */
+extern void PAIR_miller(BLS12383::FP12 *res, BLS12383::FP12 r[]);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/pair_BLS12443.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/pair_BLS12443.h
new file mode 100644
index 0000000..14a0257
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/pair_BLS12443.h
@@ -0,0 +1,183 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef PAIR_BLS12443_H
+#define PAIR_BLS12443_H
+
+#include "fp12_BLS12443.h"
+#include "ecp2_BLS12443.h"
+#include "ecp_BLS12443.h"
+
+using namespace core;
+
+namespace BLS12443 {
+/* Pairing constants */
+
+extern const B448_60::BIG CURVE_Bnx; /**< BN curve x parameter */
+extern const B448_60::BIG CURVE_Cru; /**< BN curve Cube Root of Unity */
+
+extern const B448_60::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B448_60::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B448_60::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B448_60::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+/* Pairing function prototypes */
+
+
+/**	@brief Precompute line functions details for fixed G2 value
+ *
+	@param T array of precomputed FP4 partial line functions
+	@param GV a fixed ECP2 instance
+ */
+extern void PAIR_precomp(BLS12443::FP4 T[], ECP2* GV);
+
+/**	@brief Compute line functions for n-pairing
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param PV ECP2 instance, an element of G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another(BLS12443::FP12 r[], ECP2* PV, ECP* QV);
+
+
+/**	@brief Compute line functions for n-pairing, assuming precomputation on G2
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param T array contains precomputed partial line fucntions from G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another_pc(BLS12443::FP12 r[], BLS12443::FP4 T[], ECP *QV);
+
+
+
+/**	@brief Calculate Miller loop for Optimal ATE pairing e(P,Q)
+ *
+	@param r FP12 result of the pairing calculation e(P,Q)
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+
+ */
+extern void PAIR_ate(BLS12443::FP12 *r, ECP2 *P, ECP *Q);
+/**	@brief Calculate Miller loop for Optimal ATE double-pairing e(P,Q).e(R,S)
+ *
+	Faster than calculating two separate pairings
+	@param r FP12 result of the pairing calculation e(P,Q).e(R,S), an element of GT
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+	@param R ECP2 instance, an element of G2
+	@param S ECP instance, an element of G1
+ */
+extern void PAIR_double_ate(BLS12443::FP12 *r, ECP2 *P, ECP *Q, ECP2 *R, ECP *S);
+/**	@brief Final exponentiation of pairing, converts output of Miller loop to element in GT
+ *
+	Here p is the internal modulus, and r is the group order
+	@param x FP12, on exit = x^((p^12-1)/r)
+ */
+extern void PAIR_fexp(BLS12443::FP12 *x);
+/**	@brief Fast point multiplication of a member of the group G1 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param Q ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G1mul(ECP *Q, B448_60::BIG b);
+/**	@brief Fast point multiplication of a member of the group G2 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param P ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G2mul(ECP2 *P, B448_60::BIG b);
+
+
+
+/**	@brief Fast raising of a member of GT to a BIG power
+ *
+	May exploit endomorphism for speed.
+	@param x FP12 member of GT.
+	@param b BIG exponent
+
+ */
+extern void PAIR_GTpow(BLS12443::FP12 *x, B448_60::BIG b);
+
+
+/**	@brief Tests ECP for membership of G1
+ *
+	@param P ECP member of G1
+	@return true or false
+
+ */
+extern int PAIR_G1member(BLS12443::ECP *P);
+
+/**	@brief Tests ECP2 for membership of G2
+ *
+	@param P ECP2 member of G2
+	@return true or false
+
+ */
+extern int PAIR_G2member(BLS12443::ECP2 *P);
+
+/**	@brief Tests FP12 for membership of cyclotomic sub-group
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTcyclotomic(BLS12443::FP12 *x);
+
+/**	@brief Tests FP12 for membership of GT
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTmember(BLS12443::FP12 *x);
+
+/**	@brief Prepare Ate parameter
+ *
+	@param n BIG parameter
+	@param n3 BIG paramter = 3*n
+	@return number of nits in n3
+
+ */
+extern int PAIR_nbits(B448_60::BIG n3, B448_60::BIG n);
+
+/**	@brief Initialise structure for multi-pairing
+ *
+	@param r FP12 array, to be initialised to 1
+
+ */
+extern void PAIR_initmp(BLS12443::FP12 r[]);
+
+
+/**	@brief Miller loop
+ *
+ 	@param res FP12 result
+	@param r FP12 precomputed array of accumulated line functions
+
+ */
+extern void PAIR_miller(BLS12443::FP12 *res, BLS12443::FP12 r[]);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/pair_BLS12461.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/pair_BLS12461.h
new file mode 100644
index 0000000..e50fc19
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/pair_BLS12461.h
@@ -0,0 +1,183 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef PAIR_BLS12461_H
+#define PAIR_BLS12461_H
+
+#include "fp12_BLS12461.h"
+#include "ecp2_BLS12461.h"
+#include "ecp_BLS12461.h"
+
+using namespace core;
+
+namespace BLS12461 {
+/* Pairing constants */
+
+extern const B464_60::BIG CURVE_Bnx; /**< BN curve x parameter */
+extern const B464_60::BIG CURVE_Cru; /**< BN curve Cube Root of Unity */
+
+extern const B464_60::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B464_60::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B464_60::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B464_60::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+/* Pairing function prototypes */
+
+
+/**	@brief Precompute line functions details for fixed G2 value
+ *
+	@param T array of precomputed FP4 partial line functions
+	@param GV a fixed ECP2 instance
+ */
+extern void PAIR_precomp(BLS12461::FP4 T[], ECP2* GV);
+
+/**	@brief Compute line functions for n-pairing
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param PV ECP2 instance, an element of G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another(BLS12461::FP12 r[], ECP2* PV, ECP* QV);
+
+
+/**	@brief Compute line functions for n-pairing, assuming precomputation on G2
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param T array contains precomputed partial line fucntions from G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another_pc(BLS12461::FP12 r[], BLS12461::FP4 T[], ECP *QV);
+
+
+
+/**	@brief Calculate Miller loop for Optimal ATE pairing e(P,Q)
+ *
+	@param r FP12 result of the pairing calculation e(P,Q)
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+
+ */
+extern void PAIR_ate(BLS12461::FP12 *r, ECP2 *P, ECP *Q);
+/**	@brief Calculate Miller loop for Optimal ATE double-pairing e(P,Q).e(R,S)
+ *
+	Faster than calculating two separate pairings
+	@param r FP12 result of the pairing calculation e(P,Q).e(R,S), an element of GT
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+	@param R ECP2 instance, an element of G2
+	@param S ECP instance, an element of G1
+ */
+extern void PAIR_double_ate(BLS12461::FP12 *r, ECP2 *P, ECP *Q, ECP2 *R, ECP *S);
+/**	@brief Final exponentiation of pairing, converts output of Miller loop to element in GT
+ *
+	Here p is the internal modulus, and r is the group order
+	@param x FP12, on exit = x^((p^12-1)/r)
+ */
+extern void PAIR_fexp(BLS12461::FP12 *x);
+/**	@brief Fast point multiplication of a member of the group G1 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param Q ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G1mul(ECP *Q, B464_60::BIG b);
+/**	@brief Fast point multiplication of a member of the group G2 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param P ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G2mul(ECP2 *P, B464_60::BIG b);
+
+
+
+/**	@brief Fast raising of a member of GT to a BIG power
+ *
+	May exploit endomorphism for speed.
+	@param x FP12 member of GT.
+	@param b BIG exponent
+
+ */
+extern void PAIR_GTpow(BLS12461::FP12 *x, B464_60::BIG b);
+
+
+/**	@brief Tests ECP for membership of G1
+ *
+	@param P ECP member of G1
+	@return true or false
+
+ */
+extern int PAIR_G1member(BLS12461::ECP *P);
+
+/**	@brief Tests ECP2 for membership of G2
+ *
+	@param P ECP2 member of G2
+	@return true or false
+
+ */
+extern int PAIR_G2member(BLS12461::ECP2 *P);
+
+/**	@brief Tests FP12 for membership of cyclotomic sub-group
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTcyclotomic(BLS12461::FP12 *x);
+
+/**	@brief Tests FP12 for membership of GT
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTmember(BLS12461::FP12 *x);
+
+/**	@brief Prepare Ate parameter
+ *
+	@param n BIG parameter
+	@param n3 BIG paramter = 3*n
+	@return number of nits in n3
+
+ */
+extern int PAIR_nbits(B464_60::BIG n3, B464_60::BIG n);
+
+/**	@brief Initialise structure for multi-pairing
+ *
+	@param r FP12 array, to be initialised to 1
+
+ */
+extern void PAIR_initmp(BLS12461::FP12 r[]);
+
+
+/**	@brief Miller loop
+ *
+ 	@param res FP12 result
+	@param r FP12 precomputed array of accumulated line functions
+
+ */
+extern void PAIR_miller(BLS12461::FP12 *res, BLS12461::FP12 r[]);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/pair_BN158.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/pair_BN158.h
new file mode 100644
index 0000000..13b27c0
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/pair_BN158.h
@@ -0,0 +1,183 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef PAIR_BN158_H
+#define PAIR_BN158_H
+
+#include "fp12_BN158.h"
+#include "ecp2_BN158.h"
+#include "ecp_BN158.h"
+
+using namespace core;
+
+namespace BN158 {
+/* Pairing constants */
+
+extern const B160_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+extern const B160_56::BIG CURVE_Cru; /**< BN curve Cube Root of Unity */
+
+extern const B160_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B160_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B160_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B160_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+/* Pairing function prototypes */
+
+
+/**	@brief Precompute line functions details for fixed G2 value
+ *
+	@param T array of precomputed FP4 partial line functions
+	@param GV a fixed ECP2 instance
+ */
+extern void PAIR_precomp(BN158::FP4 T[], ECP2* GV);
+
+/**	@brief Compute line functions for n-pairing
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param PV ECP2 instance, an element of G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another(BN158::FP12 r[], ECP2* PV, ECP* QV);
+
+
+/**	@brief Compute line functions for n-pairing, assuming precomputation on G2
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param T array contains precomputed partial line fucntions from G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another_pc(BN158::FP12 r[], BN158::FP4 T[], ECP *QV);
+
+
+
+/**	@brief Calculate Miller loop for Optimal ATE pairing e(P,Q)
+ *
+	@param r FP12 result of the pairing calculation e(P,Q)
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+
+ */
+extern void PAIR_ate(BN158::FP12 *r, ECP2 *P, ECP *Q);
+/**	@brief Calculate Miller loop for Optimal ATE double-pairing e(P,Q).e(R,S)
+ *
+	Faster than calculating two separate pairings
+	@param r FP12 result of the pairing calculation e(P,Q).e(R,S), an element of GT
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+	@param R ECP2 instance, an element of G2
+	@param S ECP instance, an element of G1
+ */
+extern void PAIR_double_ate(BN158::FP12 *r, ECP2 *P, ECP *Q, ECP2 *R, ECP *S);
+/**	@brief Final exponentiation of pairing, converts output of Miller loop to element in GT
+ *
+	Here p is the internal modulus, and r is the group order
+	@param x FP12, on exit = x^((p^12-1)/r)
+ */
+extern void PAIR_fexp(BN158::FP12 *x);
+/**	@brief Fast point multiplication of a member of the group G1 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param Q ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G1mul(ECP *Q, B160_56::BIG b);
+/**	@brief Fast point multiplication of a member of the group G2 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param P ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G2mul(ECP2 *P, B160_56::BIG b);
+
+
+
+/**	@brief Fast raising of a member of GT to a BIG power
+ *
+	May exploit endomorphism for speed.
+	@param x FP12 member of GT.
+	@param b BIG exponent
+
+ */
+extern void PAIR_GTpow(BN158::FP12 *x, B160_56::BIG b);
+
+
+/**	@brief Tests ECP for membership of G1
+ *
+	@param P ECP member of G1
+	@return true or false
+
+ */
+extern int PAIR_G1member(BN158::ECP *P);
+
+/**	@brief Tests ECP2 for membership of G2
+ *
+	@param P ECP2 member of G2
+	@return true or false
+
+ */
+extern int PAIR_G2member(BN158::ECP2 *P);
+
+/**	@brief Tests FP12 for membership of cyclotomic sub-group
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTcyclotomic(BN158::FP12 *x);
+
+/**	@brief Tests FP12 for membership of GT
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTmember(BN158::FP12 *x);
+
+/**	@brief Prepare Ate parameter
+ *
+	@param n BIG parameter
+	@param n3 BIG paramter = 3*n
+	@return number of nits in n3
+
+ */
+extern int PAIR_nbits(B160_56::BIG n3, B160_56::BIG n);
+
+/**	@brief Initialise structure for multi-pairing
+ *
+	@param r FP12 array, to be initialised to 1
+
+ */
+extern void PAIR_initmp(BN158::FP12 r[]);
+
+
+/**	@brief Miller loop
+ *
+ 	@param res FP12 result
+	@param r FP12 precomputed array of accumulated line functions
+
+ */
+extern void PAIR_miller(BN158::FP12 *res, BN158::FP12 r[]);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/pair_BN254.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/pair_BN254.h
new file mode 100644
index 0000000..dc0e5b3
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/pair_BN254.h
@@ -0,0 +1,183 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef PAIR_BN254_H
+#define PAIR_BN254_H
+
+#include "fp12_BN254.h"
+#include "ecp2_BN254.h"
+#include "ecp_BN254.h"
+
+using namespace core;
+
+namespace BN254 {
+/* Pairing constants */
+
+extern const B256_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+extern const B256_56::BIG CURVE_Cru; /**< BN curve Cube Root of Unity */
+
+extern const B256_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+/* Pairing function prototypes */
+
+
+/**	@brief Precompute line functions details for fixed G2 value
+ *
+	@param T array of precomputed FP4 partial line functions
+	@param GV a fixed ECP2 instance
+ */
+extern void PAIR_precomp(BN254::FP4 T[], ECP2* GV);
+
+/**	@brief Compute line functions for n-pairing
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param PV ECP2 instance, an element of G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another(BN254::FP12 r[], ECP2* PV, ECP* QV);
+
+
+/**	@brief Compute line functions for n-pairing, assuming precomputation on G2
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param T array contains precomputed partial line fucntions from G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another_pc(BN254::FP12 r[], BN254::FP4 T[], ECP *QV);
+
+
+
+/**	@brief Calculate Miller loop for Optimal ATE pairing e(P,Q)
+ *
+	@param r FP12 result of the pairing calculation e(P,Q)
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+
+ */
+extern void PAIR_ate(BN254::FP12 *r, ECP2 *P, ECP *Q);
+/**	@brief Calculate Miller loop for Optimal ATE double-pairing e(P,Q).e(R,S)
+ *
+	Faster than calculating two separate pairings
+	@param r FP12 result of the pairing calculation e(P,Q).e(R,S), an element of GT
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+	@param R ECP2 instance, an element of G2
+	@param S ECP instance, an element of G1
+ */
+extern void PAIR_double_ate(BN254::FP12 *r, ECP2 *P, ECP *Q, ECP2 *R, ECP *S);
+/**	@brief Final exponentiation of pairing, converts output of Miller loop to element in GT
+ *
+	Here p is the internal modulus, and r is the group order
+	@param x FP12, on exit = x^((p^12-1)/r)
+ */
+extern void PAIR_fexp(BN254::FP12 *x);
+/**	@brief Fast point multiplication of a member of the group G1 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param Q ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G1mul(ECP *Q, B256_56::BIG b);
+/**	@brief Fast point multiplication of a member of the group G2 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param P ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G2mul(ECP2 *P, B256_56::BIG b);
+
+
+
+/**	@brief Fast raising of a member of GT to a BIG power
+ *
+	May exploit endomorphism for speed.
+	@param x FP12 member of GT.
+	@param b BIG exponent
+
+ */
+extern void PAIR_GTpow(BN254::FP12 *x, B256_56::BIG b);
+
+
+/**	@brief Tests ECP for membership of G1
+ *
+	@param P ECP member of G1
+	@return true or false
+
+ */
+extern int PAIR_G1member(BN254::ECP *P);
+
+/**	@brief Tests ECP2 for membership of G2
+ *
+	@param P ECP2 member of G2
+	@return true or false
+
+ */
+extern int PAIR_G2member(BN254::ECP2 *P);
+
+/**	@brief Tests FP12 for membership of cyclotomic sub-group
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTcyclotomic(BN254::FP12 *x);
+
+/**	@brief Tests FP12 for membership of GT
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTmember(BN254::FP12 *x);
+
+/**	@brief Prepare Ate parameter
+ *
+	@param n BIG parameter
+	@param n3 BIG paramter = 3*n
+	@return number of nits in n3
+
+ */
+extern int PAIR_nbits(B256_56::BIG n3, B256_56::BIG n);
+
+/**	@brief Initialise structure for multi-pairing
+ *
+	@param r FP12 array, to be initialised to 1
+
+ */
+extern void PAIR_initmp(BN254::FP12 r[]);
+
+
+/**	@brief Miller loop
+ *
+ 	@param res FP12 result
+	@param r FP12 precomputed array of accumulated line functions
+
+ */
+extern void PAIR_miller(BN254::FP12 *res, BN254::FP12 r[]);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/pair_BN254CX.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/pair_BN254CX.h
new file mode 100644
index 0000000..f00bd52
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/pair_BN254CX.h
@@ -0,0 +1,183 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef PAIR_BN254CX_H
+#define PAIR_BN254CX_H
+
+#include "fp12_BN254CX.h"
+#include "ecp2_BN254CX.h"
+#include "ecp_BN254CX.h"
+
+using namespace core;
+
+namespace BN254CX {
+/* Pairing constants */
+
+extern const B256_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+extern const B256_56::BIG CURVE_Cru; /**< BN curve Cube Root of Unity */
+
+extern const B256_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+/* Pairing function prototypes */
+
+
+/**	@brief Precompute line functions details for fixed G2 value
+ *
+	@param T array of precomputed FP4 partial line functions
+	@param GV a fixed ECP2 instance
+ */
+extern void PAIR_precomp(BN254CX::FP4 T[], ECP2* GV);
+
+/**	@brief Compute line functions for n-pairing
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param PV ECP2 instance, an element of G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another(BN254CX::FP12 r[], ECP2* PV, ECP* QV);
+
+
+/**	@brief Compute line functions for n-pairing, assuming precomputation on G2
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param T array contains precomputed partial line fucntions from G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another_pc(BN254CX::FP12 r[], BN254CX::FP4 T[], ECP *QV);
+
+
+
+/**	@brief Calculate Miller loop for Optimal ATE pairing e(P,Q)
+ *
+	@param r FP12 result of the pairing calculation e(P,Q)
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+
+ */
+extern void PAIR_ate(BN254CX::FP12 *r, ECP2 *P, ECP *Q);
+/**	@brief Calculate Miller loop for Optimal ATE double-pairing e(P,Q).e(R,S)
+ *
+	Faster than calculating two separate pairings
+	@param r FP12 result of the pairing calculation e(P,Q).e(R,S), an element of GT
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+	@param R ECP2 instance, an element of G2
+	@param S ECP instance, an element of G1
+ */
+extern void PAIR_double_ate(BN254CX::FP12 *r, ECP2 *P, ECP *Q, ECP2 *R, ECP *S);
+/**	@brief Final exponentiation of pairing, converts output of Miller loop to element in GT
+ *
+	Here p is the internal modulus, and r is the group order
+	@param x FP12, on exit = x^((p^12-1)/r)
+ */
+extern void PAIR_fexp(BN254CX::FP12 *x);
+/**	@brief Fast point multiplication of a member of the group G1 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param Q ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G1mul(ECP *Q, B256_56::BIG b);
+/**	@brief Fast point multiplication of a member of the group G2 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param P ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G2mul(ECP2 *P, B256_56::BIG b);
+
+
+
+/**	@brief Fast raising of a member of GT to a BIG power
+ *
+	May exploit endomorphism for speed.
+	@param x FP12 member of GT.
+	@param b BIG exponent
+
+ */
+extern void PAIR_GTpow(BN254CX::FP12 *x, B256_56::BIG b);
+
+
+/**	@brief Tests ECP for membership of G1
+ *
+	@param P ECP member of G1
+	@return true or false
+
+ */
+extern int PAIR_G1member(BN254CX::ECP *P);
+
+/**	@brief Tests ECP2 for membership of G2
+ *
+	@param P ECP2 member of G2
+	@return true or false
+
+ */
+extern int PAIR_G2member(BN254CX::ECP2 *P);
+
+/**	@brief Tests FP12 for membership of cyclotomic sub-group
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTcyclotomic(BN254CX::FP12 *x);
+
+/**	@brief Tests FP12 for membership of GT
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTmember(BN254CX::FP12 *x);
+
+/**	@brief Prepare Ate parameter
+ *
+	@param n BIG parameter
+	@param n3 BIG paramter = 3*n
+	@return number of nits in n3
+
+ */
+extern int PAIR_nbits(B256_56::BIG n3, B256_56::BIG n);
+
+/**	@brief Initialise structure for multi-pairing
+ *
+	@param r FP12 array, to be initialised to 1
+
+ */
+extern void PAIR_initmp(BN254CX::FP12 r[]);
+
+
+/**	@brief Miller loop
+ *
+ 	@param res FP12 result
+	@param r FP12 precomputed array of accumulated line functions
+
+ */
+extern void PAIR_miller(BN254CX::FP12 *res, BN254CX::FP12 r[]);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/pair_BN462.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/pair_BN462.h
new file mode 100644
index 0000000..77dd802
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/pair_BN462.h
@@ -0,0 +1,183 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef PAIR_BN462_H
+#define PAIR_BN462_H
+
+#include "fp12_BN462.h"
+#include "ecp2_BN462.h"
+#include "ecp_BN462.h"
+
+using namespace core;
+
+namespace BN462 {
+/* Pairing constants */
+
+extern const B464_60::BIG CURVE_Bnx; /**< BN curve x parameter */
+extern const B464_60::BIG CURVE_Cru; /**< BN curve Cube Root of Unity */
+
+extern const B464_60::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B464_60::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B464_60::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B464_60::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+/* Pairing function prototypes */
+
+
+/**	@brief Precompute line functions details for fixed G2 value
+ *
+	@param T array of precomputed FP4 partial line functions
+	@param GV a fixed ECP2 instance
+ */
+extern void PAIR_precomp(BN462::FP4 T[], ECP2* GV);
+
+/**	@brief Compute line functions for n-pairing
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param PV ECP2 instance, an element of G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another(BN462::FP12 r[], ECP2* PV, ECP* QV);
+
+
+/**	@brief Compute line functions for n-pairing, assuming precomputation on G2
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param T array contains precomputed partial line fucntions from G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another_pc(BN462::FP12 r[], BN462::FP4 T[], ECP *QV);
+
+
+
+/**	@brief Calculate Miller loop for Optimal ATE pairing e(P,Q)
+ *
+	@param r FP12 result of the pairing calculation e(P,Q)
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+
+ */
+extern void PAIR_ate(BN462::FP12 *r, ECP2 *P, ECP *Q);
+/**	@brief Calculate Miller loop for Optimal ATE double-pairing e(P,Q).e(R,S)
+ *
+	Faster than calculating two separate pairings
+	@param r FP12 result of the pairing calculation e(P,Q).e(R,S), an element of GT
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+	@param R ECP2 instance, an element of G2
+	@param S ECP instance, an element of G1
+ */
+extern void PAIR_double_ate(BN462::FP12 *r, ECP2 *P, ECP *Q, ECP2 *R, ECP *S);
+/**	@brief Final exponentiation of pairing, converts output of Miller loop to element in GT
+ *
+	Here p is the internal modulus, and r is the group order
+	@param x FP12, on exit = x^((p^12-1)/r)
+ */
+extern void PAIR_fexp(BN462::FP12 *x);
+/**	@brief Fast point multiplication of a member of the group G1 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param Q ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G1mul(ECP *Q, B464_60::BIG b);
+/**	@brief Fast point multiplication of a member of the group G2 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param P ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G2mul(ECP2 *P, B464_60::BIG b);
+
+
+
+/**	@brief Fast raising of a member of GT to a BIG power
+ *
+	May exploit endomorphism for speed.
+	@param x FP12 member of GT.
+	@param b BIG exponent
+
+ */
+extern void PAIR_GTpow(BN462::FP12 *x, B464_60::BIG b);
+
+
+/**	@brief Tests ECP for membership of G1
+ *
+	@param P ECP member of G1
+	@return true or false
+
+ */
+extern int PAIR_G1member(BN462::ECP *P);
+
+/**	@brief Tests ECP2 for membership of G2
+ *
+	@param P ECP2 member of G2
+	@return true or false
+
+ */
+extern int PAIR_G2member(BN462::ECP2 *P);
+
+/**	@brief Tests FP12 for membership of cyclotomic sub-group
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTcyclotomic(BN462::FP12 *x);
+
+/**	@brief Tests FP12 for membership of GT
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTmember(BN462::FP12 *x);
+
+/**	@brief Prepare Ate parameter
+ *
+	@param n BIG parameter
+	@param n3 BIG paramter = 3*n
+	@return number of nits in n3
+
+ */
+extern int PAIR_nbits(B464_60::BIG n3, B464_60::BIG n);
+
+/**	@brief Initialise structure for multi-pairing
+ *
+	@param r FP12 array, to be initialised to 1
+
+ */
+extern void PAIR_initmp(BN462::FP12 r[]);
+
+
+/**	@brief Miller loop
+ *
+ 	@param res FP12 result
+	@param r FP12 precomputed array of accumulated line functions
+
+ */
+extern void PAIR_miller(BN462::FP12 *res, BN462::FP12 r[]);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/pair_FP256BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/pair_FP256BN.h
new file mode 100644
index 0000000..bfdf8ba
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/pair_FP256BN.h
@@ -0,0 +1,183 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef PAIR_FP256BN_H
+#define PAIR_FP256BN_H
+
+#include "fp12_FP256BN.h"
+#include "ecp2_FP256BN.h"
+#include "ecp_FP256BN.h"
+
+using namespace core;
+
+namespace FP256BN {
+/* Pairing constants */
+
+extern const B256_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+extern const B256_56::BIG CURVE_Cru; /**< BN curve Cube Root of Unity */
+
+extern const B256_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+/* Pairing function prototypes */
+
+
+/**	@brief Precompute line functions details for fixed G2 value
+ *
+	@param T array of precomputed FP4 partial line functions
+	@param GV a fixed ECP2 instance
+ */
+extern void PAIR_precomp(FP256BN::FP4 T[], ECP2* GV);
+
+/**	@brief Compute line functions for n-pairing
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param PV ECP2 instance, an element of G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another(FP256BN::FP12 r[], ECP2* PV, ECP* QV);
+
+
+/**	@brief Compute line functions for n-pairing, assuming precomputation on G2
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param T array contains precomputed partial line fucntions from G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another_pc(FP256BN::FP12 r[], FP256BN::FP4 T[], ECP *QV);
+
+
+
+/**	@brief Calculate Miller loop for Optimal ATE pairing e(P,Q)
+ *
+	@param r FP12 result of the pairing calculation e(P,Q)
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+
+ */
+extern void PAIR_ate(FP256BN::FP12 *r, ECP2 *P, ECP *Q);
+/**	@brief Calculate Miller loop for Optimal ATE double-pairing e(P,Q).e(R,S)
+ *
+	Faster than calculating two separate pairings
+	@param r FP12 result of the pairing calculation e(P,Q).e(R,S), an element of GT
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+	@param R ECP2 instance, an element of G2
+	@param S ECP instance, an element of G1
+ */
+extern void PAIR_double_ate(FP256BN::FP12 *r, ECP2 *P, ECP *Q, ECP2 *R, ECP *S);
+/**	@brief Final exponentiation of pairing, converts output of Miller loop to element in GT
+ *
+	Here p is the internal modulus, and r is the group order
+	@param x FP12, on exit = x^((p^12-1)/r)
+ */
+extern void PAIR_fexp(FP256BN::FP12 *x);
+/**	@brief Fast point multiplication of a member of the group G1 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param Q ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G1mul(ECP *Q, B256_56::BIG b);
+/**	@brief Fast point multiplication of a member of the group G2 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param P ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G2mul(ECP2 *P, B256_56::BIG b);
+
+
+
+/**	@brief Fast raising of a member of GT to a BIG power
+ *
+	May exploit endomorphism for speed.
+	@param x FP12 member of GT.
+	@param b BIG exponent
+
+ */
+extern void PAIR_GTpow(FP256BN::FP12 *x, B256_56::BIG b);
+
+
+/**	@brief Tests ECP for membership of G1
+ *
+	@param P ECP member of G1
+	@return true or false
+
+ */
+extern int PAIR_G1member(FP256BN::ECP *P);
+
+/**	@brief Tests ECP2 for membership of G2
+ *
+	@param P ECP2 member of G2
+	@return true or false
+
+ */
+extern int PAIR_G2member(FP256BN::ECP2 *P);
+
+/**	@brief Tests FP12 for membership of cyclotomic sub-group
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTcyclotomic(FP256BN::FP12 *x);
+
+/**	@brief Tests FP12 for membership of GT
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTmember(FP256BN::FP12 *x);
+
+/**	@brief Prepare Ate parameter
+ *
+	@param n BIG parameter
+	@param n3 BIG paramter = 3*n
+	@return number of nits in n3
+
+ */
+extern int PAIR_nbits(B256_56::BIG n3, B256_56::BIG n);
+
+/**	@brief Initialise structure for multi-pairing
+ *
+	@param r FP12 array, to be initialised to 1
+
+ */
+extern void PAIR_initmp(FP256BN::FP12 r[]);
+
+
+/**	@brief Miller loop
+ *
+ 	@param res FP12 result
+	@param r FP12 precomputed array of accumulated line functions
+
+ */
+extern void PAIR_miller(FP256BN::FP12 *res, FP256BN::FP12 r[]);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/pair_FP512BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/pair_FP512BN.h
new file mode 100644
index 0000000..c54ca92
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/pair_FP512BN.h
@@ -0,0 +1,183 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef PAIR_FP512BN_H
+#define PAIR_FP512BN_H
+
+#include "fp12_FP512BN.h"
+#include "ecp2_FP512BN.h"
+#include "ecp_FP512BN.h"
+
+using namespace core;
+
+namespace FP512BN {
+/* Pairing constants */
+
+extern const B512_60::BIG CURVE_Bnx; /**< BN curve x parameter */
+extern const B512_60::BIG CURVE_Cru; /**< BN curve Cube Root of Unity */
+
+extern const B512_60::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B512_60::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B512_60::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B512_60::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+/* Pairing function prototypes */
+
+
+/**	@brief Precompute line functions details for fixed G2 value
+ *
+	@param T array of precomputed FP4 partial line functions
+	@param GV a fixed ECP2 instance
+ */
+extern void PAIR_precomp(FP512BN::FP4 T[], ECP2* GV);
+
+/**	@brief Compute line functions for n-pairing
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param PV ECP2 instance, an element of G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another(FP512BN::FP12 r[], ECP2* PV, ECP* QV);
+
+
+/**	@brief Compute line functions for n-pairing, assuming precomputation on G2
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param T array contains precomputed partial line fucntions from G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another_pc(FP512BN::FP12 r[], FP512BN::FP4 T[], ECP *QV);
+
+
+
+/**	@brief Calculate Miller loop for Optimal ATE pairing e(P,Q)
+ *
+	@param r FP12 result of the pairing calculation e(P,Q)
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+
+ */
+extern void PAIR_ate(FP512BN::FP12 *r, ECP2 *P, ECP *Q);
+/**	@brief Calculate Miller loop for Optimal ATE double-pairing e(P,Q).e(R,S)
+ *
+	Faster than calculating two separate pairings
+	@param r FP12 result of the pairing calculation e(P,Q).e(R,S), an element of GT
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+	@param R ECP2 instance, an element of G2
+	@param S ECP instance, an element of G1
+ */
+extern void PAIR_double_ate(FP512BN::FP12 *r, ECP2 *P, ECP *Q, ECP2 *R, ECP *S);
+/**	@brief Final exponentiation of pairing, converts output of Miller loop to element in GT
+ *
+	Here p is the internal modulus, and r is the group order
+	@param x FP12, on exit = x^((p^12-1)/r)
+ */
+extern void PAIR_fexp(FP512BN::FP12 *x);
+/**	@brief Fast point multiplication of a member of the group G1 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param Q ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G1mul(ECP *Q, B512_60::BIG b);
+/**	@brief Fast point multiplication of a member of the group G2 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param P ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G2mul(ECP2 *P, B512_60::BIG b);
+
+
+
+/**	@brief Fast raising of a member of GT to a BIG power
+ *
+	May exploit endomorphism for speed.
+	@param x FP12 member of GT.
+	@param b BIG exponent
+
+ */
+extern void PAIR_GTpow(FP512BN::FP12 *x, B512_60::BIG b);
+
+
+/**	@brief Tests ECP for membership of G1
+ *
+	@param P ECP member of G1
+	@return true or false
+
+ */
+extern int PAIR_G1member(FP512BN::ECP *P);
+
+/**	@brief Tests ECP2 for membership of G2
+ *
+	@param P ECP2 member of G2
+	@return true or false
+
+ */
+extern int PAIR_G2member(FP512BN::ECP2 *P);
+
+/**	@brief Tests FP12 for membership of cyclotomic sub-group
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTcyclotomic(FP512BN::FP12 *x);
+
+/**	@brief Tests FP12 for membership of GT
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTmember(FP512BN::FP12 *x);
+
+/**	@brief Prepare Ate parameter
+ *
+	@param n BIG parameter
+	@param n3 BIG paramter = 3*n
+	@return number of nits in n3
+
+ */
+extern int PAIR_nbits(B512_60::BIG n3, B512_60::BIG n);
+
+/**	@brief Initialise structure for multi-pairing
+ *
+	@param r FP12 array, to be initialised to 1
+
+ */
+extern void PAIR_initmp(FP512BN::FP12 r[]);
+
+
+/**	@brief Miller loop
+ *
+ 	@param res FP12 result
+	@param r FP12 precomputed array of accumulated line functions
+
+ */
+extern void PAIR_miller(FP512BN::FP12 *res, FP512BN::FP12 r[]);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rand.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rand.cpp
new file mode 100644
index 0000000..a3bda7b
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rand.cpp
@@ -0,0 +1,174 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/*
+ *   Cryptographic strong random number generator
+ *
+ *   Unguessable seed -> SHA -> PRNG internal state -> SHA -> random numbers
+ *   Slow - but secure
+ *
+ *   See ftp://ftp.rsasecurity.com/pub/pdfs/bull-1.pdf for a justification
+ */
+/* SU=m, m is Stack Usage */
+
+#include "core.h"
+
+using namespace core;
+
+/* SU= 20 */
+static unsign32 sbrand(csprng *rng)
+{
+    /* Marsaglia & Zaman random number generator */
+    int i, k;
+    unsign32 pdiff, t;
+    rng->rndptr++;
+    if (rng->rndptr < NK) return rng->ira[rng->rndptr];
+    rng->rndptr = 0;
+    for (i = 0, k = NK - NJ; i < NK; i++, k++)
+    {
+        /* calculate next NK values */
+        if (k == NK) k = 0;
+        t = rng->ira[k];
+        pdiff = t - rng->ira[i] - rng->borrow;
+
+        if (pdiff < t) rng->borrow = 0;
+        if (pdiff > t) rng->borrow = 1;
+        rng->ira[i] = pdiff;
+    }
+    return rng->ira[0];
+}
+
+/* SU= 20 */
+static void sirand(csprng* rng, unsign32 seed)
+{
+    /* initialise random number system */
+    /* modified so that a subsequent call "stirs" in another seed value */
+    /* in this way as many seed bits as desired may be used */
+    int i, in;
+    unsign32 t, m = 1;
+    rng->borrow = 0L;
+    rng->rndptr = 0;
+    rng->ira[0] ^= seed;
+    for (i = 1; i < NK; i++)
+    {
+        /* fill initialisation vector */
+        in = (NV * i) % NK;
+        rng->ira[in] ^= m;    /* note XOR */
+        t = m;
+        m = seed - m;
+        seed = t;
+    }
+    for (i = 0; i < 10000; i++) sbrand(rng ); /* "warm-up" & stir the generator */
+}
+
+/* SU= 312 */
+static void fill_pool(csprng *rng)
+{
+    /* hash down output of RNG to re-fill the pool */
+    int i;
+    hash256 sh;
+    HASH256_init(&sh);
+    for (i = 0; i < 128; i++) HASH256_process(&sh, sbrand(rng));
+    HASH256_hash(&sh, rng->pool);
+    rng->pool_ptr = 0;
+}
+
+static unsign32 pack(const uchar *b)
+{
+    /* pack bytes into a 32-bit Word */
+    return ((unsign32)b[3] << 24) | ((unsign32)b[2] << 16) | ((unsign32)b[1] << 8) | (unsign32)b[0];
+}
+
+/* SU= 360 */
+/* Initialize RNG with some real entropy from some external source */
+void core::RAND_seed(csprng *rng, int rawlen, char *raw)
+{
+    /* initialise from at least 128 byte string of raw  *
+     * random (keyboard?) input, and 32-bit time-of-day */
+    int i;
+    char digest[32];
+    uchar b[4];
+    hash256 sh;
+    rng->pool_ptr = 0;
+    for (i = 0; i < NK; i++) rng->ira[i] = 0;
+    if (rawlen > 0)
+    {
+        HASH256_init(&sh);
+        for (i = 0; i < rawlen; i++)
+            HASH256_process(&sh, raw[i]);
+        HASH256_hash(&sh, digest);
+
+        /* initialise PRNG from distilled randomness */
+
+        for (i = 0; i < 8; i++)
+        {
+            b[0] = digest[4 * i];
+            b[1] = digest[4 * i + 1];
+            b[2] = digest[4 * i + 2];
+            b[3] = digest[4 * i + 3];
+            //  printf("%08x\n",pack(b));
+            sirand(rng, pack(b));
+        }
+    }
+    fill_pool(rng);
+}
+
+/* Terminate and clean up */
+void core::RAND_clean(csprng *rng)
+{
+    /* kill internal state */
+    int i;
+    rng->pool_ptr = rng->rndptr = 0;
+    for (i = 0; i < 32; i++) rng->pool[i] = 0;
+    for (i = 0; i < NK; i++) rng->ira[i] = 0;
+    rng->borrow = 0;
+}
+
+/* get random byte */
+/* SU= 8 */
+int core::RAND_byte(csprng *rng)
+{
+    int r;
+    r = rng->pool[rng->pool_ptr++];
+    if (rng->pool_ptr >= 32) fill_pool(rng);
+    return (r & 0xff);
+}
+
+/* test main program */
+/*
+#include <stdio.h>
+#include <string.h>
+
+void main()
+{
+    int i;
+    char raw[256];
+    csprng rng;
+
+    RAND_clean(&rng);
+
+
+    for (i=0;i<256;i++) raw[i]=(char)i;
+    RAND_seed(&rng,256,raw);
+
+    for (i=0;i<1000;i++)
+        printf("%02x ",(unsigned char)RAND_byte(&rng));
+}
+
+*/
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/randapi.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/randapi.cpp
new file mode 100644
index 0000000..9f2d5c5
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/randapi.cpp
@@ -0,0 +1,36 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#include "randapi.h"
+
+using namespace core;
+
+/* Initialise a Cryptographically Strong Random Number Generator from
+   an octet of raw random data */
+
+void core::CREATE_CSPRNG(csprng *RNG, octet *RAW)
+{
+    RAND_seed(RNG, RAW->len, RAW->val);
+}
+
+void core::KILL_CSPRNG(csprng *RNG)
+{
+    RAND_clean(RNG);
+}
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/randapi.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/randapi.h
new file mode 100644
index 0000000..4038228
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/randapi.h
@@ -0,0 +1,43 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef RANDOM_H
+#define RANDOM_H
+
+#include "core.h"
+
+namespace core {
+
+/** @brief Initialise a random number generator
+ *
+    @param R is a pointer to a cryptographically secure random number generator
+    @param S is an input truly random seed value
+ */
+extern void CREATE_CSPRNG(csprng *R, octet *S);
+/** @brief Kill a random number generator
+ *
+    Deletes all internal state
+    @param R is a pointer to a cryptographically secure random number generator
+ */
+extern void KILL_CSPRNG(csprng *R);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/readme.md b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/readme.md
new file mode 100644
index 0000000..a998d83
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/readme.md
@@ -0,0 +1,124 @@
+# Description
+
+This C++ version is really just C plus namespaces. Namespaces are the 
+only feature of C++ that is used
+
+Separate ROM files provide the constants required for each curve. The
+associated header files (big.h, fp.h and ecp.h) also specify 
+certain constants that must be set for the particular curve.
+
+# Installation and Testing
+
+To build a library and see it in action, copy all of the files in this 
+directory to a fresh directory. Then execute the python3 script config32.py 
+for a 32-bit build, or config64.py for a 64-bit build, and select the curves 
+that you wish to support. Note that support for 16-bit builds is currently 
+somewhat limited - see config16.py. A library is built automatically 
+including all of the modules that you will need.
+
+The configuration files assume the g++ compiler. For clang++ edit the
+config*.py files and substitute "clang++" for "g++".
+Note that clang++ is about 10-15% faster.*
+
+Make sure to use a 64-bit compiler on a 64-bit architecture.
+
+---------------------------------------
+
+To create a 32-bit library
+
+    python3 config32.py
+
+Then select options 1, 3, 7, 28, 30, 37, 38 and 42, which are fixed for the example 
+programs. (For a 16-bit build select 1, 4 and 6). Select 0 then to exit.
+
+Then compile
+
+    g++ -O2  testecc.cpp core.a -o testecc
+
+(if using MINGW-W64 in Windows change -o testecc to -o testecc.exe)
+
+The test program exercises 3 different ordinary elliptic curves (for ECDH 
+Key exchange, ECDSA signature and ECIES encryption), plus RSA, all in the 
+one binary
+
+Next compile
+
+    g++ -O2  testeddsa.cpp core.a -o testeddsa
+
+This test program exercises the EDDSA signature algorithm using the Edwards curves Ed25519 and Ed448
+
+
+Next compile
+
+    g++ -O2  testmpin.cpp core.a -o testmpin
+
+This test program exercises 4 different pairing friendly curves using 
+the MPIN authentication protocol.
+
+The correct PIN is 1234
+
+
+Next compile
+
+    g++ -O2  testbls.cpp core.a -o testbls
+
+This program implements the pairing-based BLS signature
+
+
+Next compile 
+
+    g++ -O2  benchtest_all.cpp core.a -o benchtest_all
+
+This program provides some timings.
+
+Finally
+
+     g++ -O2  testnhs.cpp core.a -o testnhs
+
+-------------------------------------------------
+
+Alternatively building and testing can be combined via
+
+    python3 configXX.py test
+
+where XX can be 16, 32 or 64
+
+Note that this builds the library for ALL of the options. 
+Executables of the above test programs are created, and can be run immediately.
+
+-------------------------------------------------
+
+NEW: support for emerging Hash To Curve standard.
+See https://datatracker.ietf.org/doc/draft-irtf-cfrg-hash-to-curve/
+
+
+Create 32 or 64-bit library selecting curves 1, 2, 3, 7, 17 and 31 (Ed25519, C25519, NIST256, Ed448, SECP256K1 and BLS12381)
+
+    g++ -O2 testhtp.cpp core.a -o testhtp
+
+Test program runs through test vectors from the draft standard.
+
+-------------------------------------------------
+
+NEW: Experimental support for emerging HPKE (Hybrid Public Key Encryption) standard.
+See https://datatracker.ietf.org/doc/draft-irtf-cfrg-hpke/
+
+New hpke.cpp/.h api files
+
+- Supports KEM_IDs for X25519, X448, P256 and P521
+- Supports HDF_IDs for SHA256/512
+- Supports AEAD_IDs for AES-GCM-128/256 only
+
+Create 32 or 64-bit library selecting curves 2 and 10 (X25519 and P521)
+
+    g++ -O2 testhpke.cpp core.a -o testhpke
+
+Test program runs through test vectors for all modes 0-3.
+
+---------------------------------------------------
+
+*Using clang on Windows.
+Download latest clang from http://releases.llvm.org/download.html.
+Choose Clang for Windows (64-bit) (.sig).
+Install a free version of Microsoft Visual C++ https://www.visualstudio.com/downloads/.
+Now use "clang++" wherever "g++" was used before.
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_ANSSI.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_ANSSI.cpp
new file mode 100644
index 0000000..2414943
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_ANSSI.cpp
@@ -0,0 +1,60 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "ecp_ANSSI.h"
+
+
+namespace ANSSI {
+/* ANSSI Curve */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B256_28;
+
+const int CURVE_Cof_I=1;
+const BIG CURVE_Cof= {0x1,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const int CURVE_B_I= 0;
+const BIG CURVE_B= {0xB7BB73F,0x75ED967,0x1A18030,0xC9AE4B,0xFDFEC,0x754A44C,0xD4ABA,0x5428A93,0xE353FCA,0xE};
+const BIG CURVE_Order= {0x6D655E1,0xFDD459C,0x2BF941F,0x67E140D,0x35B53DC,0xE8CE424,0xF10126D,0xB3AD58,0x1FD178C,0xF};
+const BIG CURVE_Gx= {0x98F5CFF,0xC97A2DD,0x8B70164,0xD2DCAF9,0x3958C27,0x4749D42,0xB31183D,0x56C139E,0x6B3D4C3,0xB};
+const BIG CURVE_Gy= {0x4062CFB,0x115A155,0x4C9E183,0xC307E8E,0xF8C2701,0xF0F3ECE,0x11F9271,0xC8B2049,0x142E0F7,0x6};
+const BIG CURVE_HTPC= {0x1A725D0,0xA8983E2,0x77B349E,0x66D2BB4,0x676B54C,0x119A095,0xCAC6DC7,0xFD18A3A,0x2906D4D,0x7};
+#endif
+
+#if CHUNK==64
+
+using namespace B256_56;
+
+const int CURVE_Cof_I=1;
+const BIG CURVE_Cof= {0x1L,0x0L,0x0L,0x0L,0x0L};
+const int CURVE_B_I= 0;
+const BIG CURVE_B= {0x75ED967B7BB73FL,0xC9AE4B1A18030L,0x754A44C00FDFECL,0x5428A9300D4ABAL,0xEE353FCAL};
+const BIG CURVE_Order= {0xFDD459C6D655E1L,0x67E140D2BF941FL,0xE8CE42435B53DCL,0xB3AD58F10126DL,0xF1FD178CL};
+const BIG CURVE_Gx= {0xC97A2DD98F5CFFL,0xD2DCAF98B70164L,0x4749D423958C27L,0x56C139EB31183DL,0xB6B3D4C3L};
+const BIG CURVE_Gy= {0x115A1554062CFBL,0xC307E8E4C9E183L,0xF0F3ECEF8C2701L,0xC8B204911F9271L,0x6142E0F7L};
+const BIG CURVE_HTPC= {0xA8983E21A725D0L,0x66D2BB477B349EL,0x119A095676B54CL,0xFD18A3ACAC6DC7L,0x72906D4DL};
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_BLS12381.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_BLS12381.cpp
new file mode 100644
index 0000000..016b7af
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_BLS12381.cpp
@@ -0,0 +1,113 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "ecp_BLS12381.h"
+
+namespace BLS12381 {
+/* Curve BLS12381 - Pairing friendly BLS curve */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B384_29;
+
+const int CURVE_Cof_I=0;
+const int CURVE_B_I= 4;
+const BIG CURVE_B= {0x4,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Order= {0x1,0x1FFFFFF8,0x1F96FFBF,0x1B4805FF,0x1D80553B,0xC0404D0,0x1520CCE7,0xA6533AF,0x73EDA7,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Gx= {0x1B22C6BB,0x19D78056,0x1E86BBFE,0xBD07FF2,0x1AC586C5,0x1D1F8B8D,0x4168538,0x9F2EE97,0xFC3688C,0x27D4D60,0x9A558E3,0x32FAF28,0x1F1D3A73,0xB};
+const BIG CURVE_Gy= {0x6C5E7E1,0x551194A,0x222B903,0x198E8945,0xB3EDD03,0xC659602,0xBD8036C,0x12BABA01,0x4FCF5E0,0xBA0EC57,0x8278C3B,0x75541E3,0xB3F481E,0x4};
+//const BIG CURVE_HTPC= {0x1AAAE,0xFD80000,0xFFFFED7,0x189FAFDA,0x1C912627,0x14945F,0xBA6AF26,0xEC3ECC4,0x13EFA3BF,0x1422F081,0x33A3655,0x12FFCD33,0x111EA3,0xD};
+const BIG CURVE_HTPC= {0x1DE821B8,0x6288315,0x1715FEDF,0xD2A41DC,0x1C31088B,0xDEEA01F,0x7FC11BB,0x1E9291A1,0x1A12F01D,0xD1EB8DE,0x16CE3D2A,0x16D97EE9,0x1F7462C8,0x0};
+const BIG CURVE_Bnx= {0x10000,0x10080000,0x34,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Cof= {0x10001,0x10080000,0x34,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+//const BIG CURVE_Cof= {0xAAAB,0x55558,0x157855A3,0x191800AA,0x396,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+
+const BIG CURVE_Pxa= {0x121BDB8,0x402B646,0x16EFBF5,0x18064D50,0x1D1770BA,0x5B23D71,0xC0AD144,0x1A9F4807,0x11C6E47A,0x196E2882,0x9820149,0x11E1522,0x4AA2B2F,0x1};
+const BIG CURVE_Pxb= {0x1D042B7E,0xD63E82A,0x51755F9,0x19E22427,0x15049334,0x10DDEE3F,0x186AD769,0x1A132416,0x5596BD0,0x4413A7B,0x1F6B34E8,0x4E33EC0,0x1E02B605,0x9};
+const BIG CURVE_Pya= {0x8B82801,0xC9AA430,0xB28A278,0x15939877,0xD12C923,0xD34A8B0,0xE9DB50A,0x155197BA,0x1AADFD9B,0x16D171A8,0x3327371,0x4FADC23,0xE5D5277,0x6};
+const BIG CURVE_Pyb= {0x105F79BE,0x15483AFF,0x1B07686A,0xE1A4EB9,0x99AB3F3,0x955AB97,0xEBC99D2,0xFD0B4EC,0x19CB3E28,0x15E145C,0xCAB34AC,0x1D4E6998,0x6C4A02,0x3};
+
+#if HTC_ISO_BLS12381 != 0
+
+const BIG CURVE_Ad= {0xD584C1D,0x7A14041,0x183E5FD7,0x6DF1B41,0x81AC989,0xC0D77EC,0x1AA363A2,0xA707DCC,0x2B0EA98,0x164B6A4C,0xF5A4E80,0x771D286,0x144698A,0x0};
+const BIG CURVE_Bd= {0xE172BE0,0xE62474C,0x1B3AA974,0x642B462,0x15EF55A2,0xA7E779,0x1C282E7,0x1E1E49E8,0x1B2016C1,0x3A9F771,0x62C4BA,0x2D10060,0xE2908D1,0x9};
+const BIG PC[53]= {{0xBA2D229,0xE45D174,0x134E47EA,0x1637016C,0x6B68C24,0x1F8DE126,0x1EF08F02,0xFC45906,0x1D31D79D,0x1C0F6F71,0xF47A588,0x1C4C1CE1,0xE08C248,0x3},{0x1605FB7B,0x133EF9F8,0xA177B32,0x16EE3F18,0x14866F69,0x19B001D8,0x1E5B542B,0x1BBCCF0F,0xDFA7DCC,0xE92B2D8,0x1CB63B02,0x139C0FC4,0x321DA07,0x8},{0x1E390C9E,0x1920833D,0xC9DE5F,0x12165DB8,0x11B7FA31,0xA5D7A5D,0x12659D8C,0x1007418B,0x2DD2ECB,0xAE89C79,0xB830DD4,0x179F4F88,0x9B1F8E1,0xB},{0x497E317,0xB8CC354,0xDD3A55B,0x52BE52D,0x1D1DE4FA,0xB649462,0x15D28B16,0xD9CF3EA,0xDC43B75,0xB1DF4C8,0x1EE42CCD,0x134F1F88,0xD3CF1F,0x4},{0x3F0C88E,0x65AB0C7,0x1D1D6BE7,0xF91F191,0x753339B,0x3177879,0x16C69A0B,0x1564EB69,0x13356DE5,0x6888BF2,0x1A1D0E21,0x357B7C5,0x1B81E770,0xB},{0x139ED84,0xEBF912D,0x14BB2B7,0x4A25182,0x6B2A8DA,0x110C7CE4,0x13864023,0x4C9E1F1,0x1FB11586,0x1C573295,0x1A8DC9B0,0x1FC89A52,0x16ED6553,0x6},{0xF652983,0x89E0E33,0x19CF4673,0xE1A5B95,0x8F90A08,0x15C84BF3,0x66E7B4E,0xFBB2A4F,0x15DB3CB1,0x1FBD3A55,0x744806,0x1AE627FE,0x30C3250,0xB},{0xC8895D9,0x8AA674D,0x79DF114,0x1450DE60,0x1AC18985,0x15B2CC17,0xCFC21BB,0xB424AFF,0x1499DB99,0x1F208C72,0x1990AD2C,0x333E886,0x99726A3,0x7},{0x1D9B6861,0xD9C4320,0x41C64F1,0xDC4B9C6,0x13083533,0x1944F8D9,0x1C97C6CC,0xCAD51B7,0x12D7F5E4,0x183F2AA0,0x13818274,0x1F98DB6E,0x178E7166,0xB},{0xC9EDCB0,0xBCFCED,0x25CA7F8,0x187C7A54,0xE25C958,0x1280F634,0xF95A1E3,0xE652B30,0x1BCE0324,0xE8854D0,0x7441231,0x12ECF1D8,0x154005DB,0x6},{0x13CB83BB,0x1A7778D,0x630D5BA,0x11E54DE6,0x1E86B483,0x119E3868,0x105FD597,0xB65ED50,0x1C7C17E7,0x110A3D40,0x1622EAC,0x1287565E,0x1294ED3E,0xB},{0x134649B7,0x1560B313,0x198B5BAB,0x185ABE5,0xE2C8561,0x1DAB66DA,0x17FC989,0x11145AE0,0x56B303E,0xECCC0AC,0xE024407,0x1D066681,0x1A05F2B1,0x8},{0x8ECDD0A,0xB1C268B,0x1E19400B,0xE9C9696,0x11C15931,0x99CBC79,0xDDDB7D,0x1DD2DEFA,0xF682B4,0x159D2B34,0x11DB5B8F,0x13D255A8,0x15FC13AB,0x4},{0x19A1D641,0x1BB761D3,0xE90DC11,0x4CD2557,0x18835038,0x6D33F9C,0x19ADD040,0x3AE2C26,0xCE07F8D,0xD7E3D1E,0x17A482CF,0x1B4A9F04,0x10ECF6A,0x5},{0x1DCC5A5E,0xFBECCDD,0x478B4C4,0xB72913A,0x2C580FA,0x10E6FCC1,0x2A0665B,0x1843794D,0x196E7F63,0x3A6780C,0xC2CFD6C,0x1AC95164,0xA7AC2A9,0xA},{0xEE84A3A,0x12BA24B,0x3781B3B,0x766A71E,0xDE9CEA7,0x3983157,0x62538B8,0x1335EA74,0x1570F57,0x1F02CB39,0x3CF8318,0x2D26C32,0x172CAACF,0x3},{0x1F6304A5,0x16FCD14,0x8A3C470,0x1A49788,0x982F740,0x1E77925C,0x1534290E,0x1D39D395,0x9395735,0x18283637,0x154E43DF,0x9CCCF72,0x7355F8E,0x7},{0x1532A21E,0x1CE9CAD9,0xD5E0754,0x537503E,0x106DA9BD,0x27419D9,0xAEE35AD,0xB34240C,0x1DFFDFC7,0x1A1F3D03,0x29BC757,0x4522950,0x1A8E1620,0x9},{0xDC62CD8,0x186F449C,0x1B3D7104,0xDAA487D,0x16FD0497,0x1455E146,0x15455332,0x7E2D62C,0x145B0824,0x1BE2075A,0x120EABFB,0xB15C5FD,0x1425581A,0x1},{0x1CB83E19,0x611CDD2,0x53FB73F,0x7A12CF9,0xCEACD6A,0x700588D,0x1347F299,0xDEB4E31,0x1F6F8941,0xDFF94C8,0x4DF98A,0xF4644BD,0x12962FE5,0x5},{0x82B3BFF,0xE413B76,0xC09BA79,0x155108D9,0xBF5713D,0x12C4624,0x30049B,0x19419E10,0x167041E8,0x14C729B1,0x122D1C44,0x16AB3886,0x561A5DE,0x9},{0xD21B1C,0x9E7CFD2,0xD0F7E26,0x11AD037C,0xAC62B55,0x430BFE4,0x2EA7256,0x9746B69,0xF01D5EF,0x1A5E9FD3,0x62CB98B,0x19FE335C,0xCA8D548,0x4},{0x9C8B604,0x5A2B5F3,0x10071DC1,0xA04FDFD,0x101B2B66,0xA7D4AD7,0x8E55EB7,0x11F092CB,0x15CB181D,0x1A16F975,0x13A942CE,0x121E079C,0x1E6BE4E9,0xA},{0x1475224B,0x1358F38A,0x1E6BEDE1,0x20936CA,0x7CE46BA,0x7AE9CB5,0x15A366AC,0x103AFD0C,0x1C5E673D,0x1A46251F,0xA8567D,0x1C899E22,0x1C129645,0x2},{0x1B980133,0x16CE9FAE,0x8CA9910,0x1F215A38,0x659CC6C,0x11969E20,0x16004F99,0x101A982,0x1C757B3B,0x13DF18AE,0x1CBF002B,0x1A3D9536,0x45A394A,0x1},{0xB971EF8,0xA602780,0x4847C83,0x10A38323,0x633F06C,0x87403DA,0x23B009C,0x54684D6,0x47AA7B1,0x27A9FA,0x14554258,0x372733,0x1182CAC1,0x5},{0x10074D8E,0x103E4526,0x113581B3,0x139BE836,0x1643249D,0x1F3FC88F,0x918B9AF,0x17155E18,0xC523559,0x1FF6976E,0xE463050,0x1E6DEDBD,0xB46A908,0xC},{0x1011C132,0x9B88D6,0xFEEBF3A,0x1E74B99C,0x1E61031B,0x1F20B1C4,0x4FF4460,0x196D95E9,0x13CD2FCB,0x18EA1FDC,0x37F42E3,0x6F9A37C,0x1713E479,0xC},{0xA731C30,0x1D7D575E,0x13AE9BCA,0x1EE0ABBA,0xD43B9B3,0xF3F68F2,0x1BF81A61,0x14F22B5E,0x3C42A0C,0x1D6D0A51,0x88EAF79,0x30D7B6A,0x1BBA7A1,0x7},{0x1BDBA587,0x1B872BB,0x181E8D8,0xCA4038F,0xCABE69D,0x17350F90,0x9B07A2D,0x2CCF3B8,0x1B8F3ABD,0x10F26D0D,0x1A232788,0x1B2CD097,0x1FC4018B,0x4},{0x1870FB29,0xAF26518,0x17FA4D68,0xC8AA1FD,0x842642F,0x6D36136,0x7FF40E,0x17FC77BB,0x14170A05,0x9653633,0x17A649AF,0x67570DF,0x187C8D53,0x4},{0x1FE9D6F2,0xB0FC42A,0x3D057B2,0x10F5848C,0x14F3747A,0x9E26B1,0x132D48C5,0x19457C30,0x1CE75BB8,0x13BCB59,0xCB25DF4,0x1F583779,0xAB0B9BC,0x2},{0x1633A5F0,0xD91D589,0x16A01CA6,0x1EC64D92,0x1544E203,0xE1E9D6A,0x1EF5D941,0x1A95F5B6,0x74A7D0,0xDC78535,0x8847847,0xC696D4,0x603FCA4,0xB},{0x12E8FEDB,0xDB6D767,0x4102A10,0xFF1B813,0x11ADC2EE,0x1FE9109A,0x2E1E60C,0x1F7C79CA,0x4195536,0x1510A94E,0x172BD3F8,0x1FC1FE26,0xCC03FDE,0x4},{0x10E5F4CB,0x11AAE3BD,0x11877B29,0xB5753D,0x11CF9DE4,0x11F60192,0x4702792,0x1721DD6F,0x17D42AA7,0x16C3A33A,0x1E261D46,0x11303842,0x1F86376E,0x0},{0x72DE1F6,0x6FF1206,0xC0148EE,0x1AA42C51,0xDA7D26,0x1F25C8A0,0x138B0D12,0x1ACB1463,0x142552E2,0x351DA4C,0x1D28E132,0x152CDCCD,0xCC786BA,0x0},{0xE41C696,0x4BF3AD1,0xBEA2FF8,0xACE232C,0x1AD34D6C,0x11A1F5B3,0xF43E41,0xD84A9E7,0x31223E9,0x1BB7DA34,0x15440DB5,0x9DCB023,0x14996A10,0x9},{0x1707BB33,0x14C22B8C,0xEE8F0AF,0x18F5DD36,0x143D3CD0,0x17B64AB2,0x548AD4A,0x11C9150D,0x1A11AD13,0xA4C06E7,0x96747C2,0x17449DC0,0x10D97C81,0x4},{0x1D634B8F,0xAA39D0,0xD25E011,0x5EAE1E2,0xAA205CA,0x1E6B1AB6,0x14CC93B,0xCBC4E77,0x171C40F,0x106BC0CE,0x1AC90957,0xDBB807C,0xFA1D81,0x7},{0x6ED06F7,0xFD6E099,0x5332034,0xA2F7B0E,0x480E420,0x6F93CA1,0x1F072DD2,0x129CE524,0x12BF565B,0xA9E6BB7,0x18A2F743,0x165C9E76,0x660400E,0x1},{0x173345CC,0x14CD89C2,0xE42B047,0xEC7C7,0x19B86930,0x177CD006,0x899F573,0x1B315BE0,0x16543346,0x5A2F8A4,0x10D84C51,0x18ECFFC7,0xD6B9514,0x5},{0x2561092,0x1425A94F,0x1FAEFAA5,0x12D130DE,0x1913516F,0xD446753,0xB4A303E,0x115DF9C8,0x77F94FF,0x12462862,0x1D614B07,0x103A067F,0xCCBB674,0x5},{0x1A8F6AA8,0x7C5A4E5,0xC18100,0xB853E9F,0xA5C871A,0xD9B731B,0x18A43964,0x7376C34,0x1D9C6DD0,0xD69488,0x123C0428,0x1D480B7A,0xD2F259E,0x2},{0x18913F55,0x377A45D,0xA6CD78D,0x10BD47AA,0x1D4FBC73,0xC973F53,0x1EED4C21,0xC7C27B0,0x103216F7,0x1ECA5424,0x1AA08165,0xE14DC39,0x7A55CDA,0xB},{0x15535D4A,0x1919ECEA,0x49220DA,0x1FC5EF77,0x19B4852C,0x1A8625F9,0x482AF15,0x1C98D5EB,0x4F9FB0C,0x1E8EBA66,0x686F953,0x6D8C246,0x66C8ED3,0xC},{0x15812ED9,0x7720AD0,0x77B918,0x1EB6010,0x17132B92,0x7E9031A,0x1F5FFACD,0xBDF43E9,0xEE5A437,0x15DD37FB,0xEF377E,0x1C7D4FD4,0xA3EF08B,0xB},{0x126A775C,0x8D09CC8,0x2C7EE4F,0x1538034B,0x51D5F,0x12DE2005,0x3BD774D,0x1F51A19F,0xB5EECFD,0x5674C12,0x10EEA1CD,0x1533B65F,0x6007C08,0xB},{0xAF9B7AC,0x16323BFD,0xA733880,0x71B73BF,0x15A6449F,0xC3DB787,0x20717B3,0x18CAAA1B,0x2B70152,0x1563C18C,0x7EC99BA,0x30DB65B,0xD9E5297,0x4},{0x11A5001D,0x11C8A118,0x14BB7B76,0x162BB81F,0xC916A20,0xD07E4EF,0xEC150BB,0x13E1ED37,0x1CC6D19C,0x17C1146E,0xC033244,0x8BE87C9,0x1E0E0795,0x5},{0x45F5416,0x6936CC2,0xA5EB6A,0x6C9E585,0xAF41727,0x1244F393,0xC3848F6,0x1B7BB79A,0x11D115C5,0x1C4F6DA6,0x1C8348EF,0x131CA72B,0xB7D2887,0xB},{0x1DBF67F2,0x1129C5A9,0x1E5BE247,0xAF9AC6D,0xD2ECA67,0x12EE93CE,0x1CC430D6,0xAAA35CF,0x1778C485,0xB74758A,0x1BEAAB9F,0xC81B44E,0x18DF3306,0x2},{0xE49A03D,0x17B08161,0x14A78D4C,0x84C0EC6,0x1E01F78A,0x1AB7A29,0x16729284,0x1EE6389A,0x1885C84F,0x21E1A45,0x6832F5B,0x702403C,0x162D75C2,0xC},{0x103663C1,0xA3C929D,0x3081B40,0x6D11DEC,0x12E7A07F,0x1195ADF3,0xF9BBB0C,0x1CAF1301,0x9601A6D,0x7D68757,0x14860450,0x15393164,0x112C4C3,0xB}};
+
+#endif
+
+#if HTC_ISO_G2_BLS12381 != 0
+const BIG CURVE_HTPC2= {0xF8492B,0x13B89D4,0x1AA68D1F,0x108A10FD,0x16D9723B,0x1B0EEA65,0x1CD7D27C,0xDC4EA3A,0x149FAD53,0x10F6735,0x4075923,0x180F008F,0x52988B9,0x0};
+const BIG CURVE_Adr= {0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Adi= {0xF0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Bdr= {0x3F4,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Bdi= {0x3F4,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG PCR[13]= {{0xAAA5ED1,0x7155555,0x19C71C62,0x11C71A1E,0x18575709,0x8478A15,0x2A88B58,0x1CFE9D02,0x14CB14B4,0x8FAFDB0,0x1B5B7A9A,0x147199F5,0x11D6541F,0xB},{0x1FFFC71E,0x154FFFFF,0x3555549,0x5555397,0xA418147,0x635A790,0x11FE6882,0x15BEF5C1,0xF984F87,0x16BC3E44,0xC849BF3,0x17553378,0x1560BF17,0x8},{0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0xAAA97D6,0x11C55555,0x1671C718,0xC71C687,0xE15D5C2,0x211E285,0x10AA22D6,0x73FA740,0x532C52D,0x123EBF6C,0xED6DEA6,0x1D1C667D,0x1C759507,0x2},{0xC,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0x1C718B10,0xD9B8E38,0x1712F678,0x1212F4AD,0x74524E7,0x1BE34D51,0xA1AC3A5,0x6F43C4C,0x10761B0F,0xF1C08D6,0x1EFDC10F,0x16D9EF37,0x4C9AD43,0x9},{0x1FFFC71C,0x154FFFFF,0x3555549,0x5555397,0xA418147,0x635A790,0x11FE6882,0x15BEF5C1,0xF984F87,0x16BC3E44,0xC849BF3,0x17553378,0x1560BF17,0x8},{0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0x11C6D706,0x167E38E3,0x124BDA04,0x184BD7F1,0x1E500FC8,0x1CEC3E93,0x126FD510,0x1A940FEC,0x130F7DA5,0x183B688C,0x16693062,0x15682276,0x130477C7,0xA},{0x12,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0x1FFFA8FB,0xFF7FFFF,0x14FFFFEE,0x17FFFD62,0xF6241EA,0x9507B58,0xAFD9CC3,0x109E70A2,0x1764774B,0x121A5D66,0x12C6E9ED,0x12FFCD34,0x111EA3,0xD}};
+const BIG PCI[13]= {{0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0x1FFFE38D,0x1AA7FFFF,0x11AAAAA4,0x12AAA9CB,0x520C0A3,0x31AD3C8,0x18FF3441,0x1ADF7AE0,0x7CC27C3,0x1B5E1F22,0x6424DF9,0x1BAA99BC,0xAB05F8B,0x4},{0x1FFFC71A,0x154FFFFF,0x3555549,0x5555397,0xA418147,0x635A790,0x11FE6882,0x15BEF5C1,0xF984F87,0x16BC3E44,0xC849BF3,0x17553378,0x1560BF17,0x8},{0xAAA97D6,0x11C55555,0x1671C718,0xC71C687,0xE15D5C2,0x211E285,0x10AA22D6,0x73FA740,0x532C52D,0x123EBF6C,0xED6DEA6,0x1D1C667D,0x1C759507,0x2},{0x1FFFAA9F,0xFF7FFFF,0x14FFFFEE,0x17FFFD62,0xF6241EA,0x9507B58,0xAFD9CC3,0x109E70A2,0x1764774B,0x121A5D66,0x12C6E9ED,0x12FFCD34,0x111EA3,0xD},{0x1FFFAA63,0xFF7FFFF,0x14FFFFEE,0x17FFFD62,0xF6241EA,0x9507B58,0xAFD9CC3,0x109E70A2,0x1764774B,0x121A5D66,0x12C6E9ED,0x12FFCD34,0x111EA3,0xD},{0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0x1FFFE38F,0x1AA7FFFF,0x11AAAAA4,0x12AAA9CB,0x520C0A3,0x31AD3C8,0x18FF3441,0x1ADF7AE0,0x7CC27C3,0x1B5E1F22,0x6424DF9,0x1BAA99BC,0xAB05F8B,0x4},{0xAAA97BE,0x11C55555,0x1671C718,0xC71C687,0xE15D5C2,0x211E285,0x10AA22D6,0x73FA740,0x532C52D,0x123EBF6C,0xED6DEA6,0x1D1C667D,0x1C759507,0x2},{0x11C6D706,0x167E38E3,0x124BDA04,0x184BD7F1,0x1E500FC8,0x1CEC3E93,0x126FD510,0x1A940FEC,0x130F7DA5,0x183B688C,0x16693062,0x15682276,0x130477C7,0xA},{0x1FFFAA99,0xFF7FFFF,0x14FFFFEE,0x17FFFD62,0xF6241EA,0x9507B58,0xAFD9CC3,0x109E70A2,0x1764774B,0x121A5D66,0x12C6E9ED,0x12FFCD34,0x111EA3,0xD},{0x1FFFA9D3,0xFF7FFFF,0x14FFFFEE,0x17FFFD62,0xF6241EA,0x9507B58,0xAFD9CC3,0x109E70A2,0x1764774B,0x121A5D66,0x12C6E9ED,0x12FFCD34,0x111EA3,0xD},{0x1FFFA8FB,0xFF7FFFF,0x14FFFFEE,0x17FFFD62,0xF6241EA,0x9507B58,0xAFD9CC3,0x109E70A2,0x1764774B,0x121A5D66,0x12C6E9ED,0x12FFCD34,0x111EA3,0xD}};
+
+#endif
+
+#endif
+
+#if CHUNK==64
+
+using namespace B384_58;
+
+const int CURVE_Cof_I=0;
+const int CURVE_B_I= 4;
+const BIG CURVE_B= {0x4L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_Order= {0x3FFFFFF00000001L,0x36900BFFF96FFBFL,0x180809A1D80553BL,0x14CA675F520CCE7L,0x73EDA7L,0x0L,0x0L};
+const BIG CURVE_Gx= {0x33AF00ADB22C6BBL,0x17A0FFE5E86BBFEL,0x3A3F171BAC586C5L,0x13E5DD2E4168538L,0x4FA9AC0FC3688CL,0x65F5E509A558E3L,0x17F1D3A73L};
+const BIG CURVE_Gy= {0xAA232946C5E7E1L,0x331D128A222B903L,0x18CB2C04B3EDD03L,0x25757402BD8036CL,0x1741D8AE4FCF5E0L,0xEAA83C68278C3BL,0x8B3F481EL};
+//const BIG CURVE_HTPC= {0x1FB00000001AAAEL,0x313F5FB4FFFFED7L,0x2928BFC912627L,0x1D87D988BA6AF26L,0x2845E1033EFA3BFL,0x25FF9A6633A3655L,0x1A0111EA3L};
+const BIG CURVE_HTPC= {0xC51062BDE821B8L,0x1A5483B9715FEDFL,0x1BDD403FC31088BL,0x3D2523427FC11BBL,0x1A3D71BDA12F01DL,0x2DB2FDD36CE3D2AL,0x1F7462C8L};
+
+const BIG CURVE_Bnx= {0x201000000010000L,0x34L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_Cof= {0x201000000010001L,0x34L,0x0L,0x0L,0x0L,0x0L,0x0L};
+//const BIG CURVE_Cof= {0xAAAB0000AAABL,0x3230015557855A3L,0x396L,0x0L,0x0L,0x0L,0x0L};
+
+const BIG CURVE_Pxa= {0x8056C8C121BDB8L,0x300C9AA016EFBF5L,0xB647AE3D1770BAL,0x353E900EC0AD144L,0x32DC51051C6E47AL,0x23C2A449820149L,0x24AA2B2FL};
+const BIG CURVE_Pxb= {0x1AC7D055D042B7EL,0x33C4484E51755F9L,0x21BBDC7F5049334L,0x3426482D86AD769L,0x88274F65596BD0L,0x9C67D81F6B34E8L,0x13E02B605L};
+const BIG CURVE_Pya= {0x193548608B82801L,0x2B2730EEB28A278L,0x1A695160D12C923L,0x2AA32F74E9DB50AL,0x2DA2E351AADFD9BL,0x9F5B8463327371L,0xCE5D5277L};
+const BIG CURVE_Pyb= {0x2A9075FF05F79BEL,0x1C349D73B07686AL,0x12AB572E99AB3F3L,0x1FA169D8EBC99D2L,0x2BC28B99CB3E28L,0x3A9CD330CAB34ACL,0x606C4A02L};
+
+#if HTC_ISO_BLS12381 != 0
+const BIG CURVE_Ad= {0xF428082D584C1DL,0xDBE368383E5FD7L,0x181AEFD881AC989L,0x14E0FB99AA363A2L,0x2C96D4982B0EA98L,0xEE3A50CF5A4E80L,0x144698AL};
+const BIG CURVE_Bd= {0x1CC48E98E172BE0L,0xC8568C5B3AA974L,0x14FCEF35EF55A2L,0x3C3C93D01C282E7L,0x753EEE3B2016C1L,0x5A200C0062C4BAL,0x12E2908D1L};
+const BIG PC[53]= {{0x1C8BA2E8BA2D229L,0x2C6E02D934E47EAL,0x3F1BC24C6B68C24L,0x1F88B20DEF08F02L,0x381EDEE3D31D79DL,0x389839C2F47A588L,0x6E08C248L},{0x267DF3F1605FB7BL,0x2DDC7E30A177B32L,0x336003B14866F69L,0x37799E1FE5B542BL,0x1D2565B0DFA7DCCL,0x27381F89CB63B02L,0x10321DA07L},{0x3241067BE390C9EL,0x242CBB700C9DE5FL,0x14BAF4BB1B7FA31L,0x200E83172659D8CL,0x15D138F22DD2ECBL,0x2F3E9F10B830DD4L,0x169B1F8E1L},{0x171986A8497E317L,0xA57CA5ADD3A55BL,0x16C928C5D1DE4FAL,0x1B39E7D55D28B16L,0x163BE990DC43B75L,0x269E3F11EE42CCDL,0x80D3CF1FL},{0xCB5618E3F0C88EL,0x1F23E323D1D6BE7L,0x62EF0F2753339BL,0x2AC9D6D36C69A0BL,0xD1117E53356DE5L,0x6AF6F8BA1D0E21L,0x17B81E770L},{0x1D7F225A139ED84L,0x944A30414BB2B7L,0x2218F9C86B2A8DAL,0x993C3E33864023L,0x38AE652BFB11586L,0x3F9134A5A8DC9B0L,0xD6ED6553L},{0x113C1C66F652983L,0x1C34B72B9CF4673L,0x2B9097E68F90A08L,0x1F76549E66E7B4EL,0x3F7A74AB5DB3CB1L,0x35CC4FFC0744806L,0x1630C3250L},{0x1154CE9AC8895D9L,0x28A1BCC079DF114L,0x2B65982FAC18985L,0x168495FECFC21BBL,0x3E4118E5499DB99L,0x667D10D990AD2CL,0xE99726A3L},{0x1B388641D9B6861L,0x1B89738C41C64F1L,0x3289F1B33083533L,0x195AA36FC97C6CCL,0x307E55412D7F5E4L,0x3F31B6DD3818274L,0x1778E7166L},{0x179F9DAC9EDCB0L,0x30F8F4A825CA7F8L,0x2501EC68E25C958L,0x1CCA5660F95A1E3L,0x1D10A9A1BCE0324L,0x25D9E3B07441231L,0xD54005DBL},{0x34EEF1B3CB83BBL,0x23CA9BCC630D5BAL,0x233C70D1E86B483L,0x16CBDAA105FD597L,0x22147A81C7C17E7L,0x250EACBC1622EACL,0x17294ED3EL},{0x2AC1662734649B7L,0x30B57CB98B5BABL,0x3B56CDB4E2C8561L,0x2228B5C017FC989L,0x1D99815856B303EL,0x3A0CCD02E024407L,0x11A05F2B1L},{0x16384D168ECDD0AL,0x1D392D2DE19400BL,0x133978F31C15931L,0x3BA5BDF40DDDB7DL,0x2B3A56680F682B4L,0x27A4AB511DB5B8FL,0x95FC13ABL},{0x376EC3A79A1D641L,0x99A4AAEE90DC11L,0xDA67F398835038L,0x75C584D9ADD040L,0x1AFC7A3CCE07F8DL,0x36953E097A482CFL,0xA10ECF6AL},{0x1F7D99BBDCC5A5EL,0x16E52274478B4C4L,0x21CDF9822C580FAL,0x3086F29A2A0665BL,0x74CF01996E7F63L,0x3592A2C8C2CFD6CL,0x14A7AC2A9L},{0x2574496EE84A3AL,0xECD4E3C3781B3BL,0x73062AEDE9CEA7L,0x266BD4E862538B8L,0x3E0596721570F57L,0x5A4D8643CF8318L,0x772CAACFL},{0x2DF9A29F6304A5L,0x3492F108A3C470L,0x3CEF24B8982F740L,0x3A73A72B534290EL,0x30506C6E9395735L,0x13999EE554E43DFL,0xE7355F8EL},{0x39D395B3532A21EL,0xA6EA07CD5E0754L,0x4E833B306DA9BDL,0x16684818AEE35ADL,0x343E7A07DFFDFC7L,0x8A452A029BC757L,0x13A8E1620L},{0x30DE8938DC62CD8L,0x1B5490FBB3D7104L,0x28ABC28D6FD0497L,0xFC5AC595455332L,0x37C40EB545B0824L,0x162B8BFB20EABFBL,0x3425581AL},{0xC239BA5CB83E19L,0xF4259F253FB73FL,0xE00B11ACEACD6AL,0x1BD69C63347F299L,0x1BFF2991F6F8941L,0x1E8C897A04DF98AL,0xB2962FE5L},{0x1C8276EC82B3BFFL,0x2AA211B2C09BA79L,0x2588C48BF5713DL,0x32833C20030049BL,0x298E536367041E8L,0x2D56710D22D1C44L,0x12561A5DEL},{0x13CF9FA40D21B1CL,0x235A06F8D0F7E26L,0x8617FC8AC62B55L,0x12E8D6D22EA7256L,0x34BD3FA6F01D5EFL,0x33FC66B862CB98BL,0x8CA8D548L},{0xB456BE69C8B604L,0x1409FBFB0071DC1L,0x14FA95AF01B2B66L,0x23E125968E55EB7L,0x342DF2EB5CB181DL,0x243C0F393A942CEL,0x15E6BE4E9L},{0x26B1E715475224BL,0x4126D95E6BEDE1L,0xF5D396A7CE46BAL,0x2075FA195A366ACL,0x348C4A3FC5E673DL,0x39133C440A8567DL,0x5C129645L},{0x2D9D3F5DB980133L,0x3E42B4708CA9910L,0x232D3C40659CC6CL,0x20353056004F99L,0x27BE315DC757B3BL,0x347B2A6DCBF002BL,0x245A394AL},{0x14C04F00B971EF8L,0x214706464847C83L,0x10E807B4633F06CL,0xA8D09AC23B009CL,0x4F53F447AA7B1L,0x6E4E674554258L,0xB182CAC1L},{0x207C8A4D0074D8EL,0x2737D06D13581B3L,0x3E7F911F643249DL,0x2E2ABC30918B9AFL,0x3FED2EDCC523559L,0x3CDBDB7AE463050L,0x18B46A908L},{0x13711AD011C132L,0x3CE97338FEEBF3AL,0x3E416389E61031BL,0x32DB2BD24FF4460L,0x31D43FB93CD2FCBL,0xDF346F837F42E3L,0x19713E479L},{0x3AFAAEBCA731C30L,0x3DC157753AE9BCAL,0x1E7ED1E4D43B9B3L,0x29E456BDBF81A61L,0x3ADA14A23C42A0CL,0x61AF6D488EAF79L,0xE1BBA7A1L},{0x370E577BDBA587L,0x1948071E181E8D8L,0x2E6A1F20CABE69DL,0x599E7709B07A2DL,0x21E4DA1BB8F3ABDL,0x3659A12FA232788L,0x9FC4018BL},{0x15E4CA31870FB29L,0x191543FB7FA4D68L,0xDA6C26C842642FL,0x2FF8EF7607FF40EL,0x12CA6C674170A05L,0xCEAE1BF7A649AFL,0x987C8D53L},{0x161F8855FE9D6F2L,0x21EB09183D057B2L,0x13C4D634F3747AL,0x328AF86132D48C5L,0x27796B3CE75BB8L,0x3EB06EF2CB25DF4L,0x4AB0B9BCL},{0x1B23AB13633A5F0L,0x3D8C9B256A01CA6L,0x1C3D3AD5544E203L,0x352BEB6DEF5D941L,0x1B8F0A6A074A7D0L,0x18D2DA88847847L,0x16603FCA4L},{0x1B6DAECF2E8FEDBL,0x1FE370264102A10L,0x3FD221351ADC2EEL,0x3EF8F3942E1E60CL,0x2A21529C4195536L,0x3F83FC4D72BD3F8L,0x8CC03FDEL},{0x2355C77B0E5F4CBL,0x16AEA7B1877B29L,0x23EC03251CF9DE4L,0x2E43BADE4702792L,0x2D8746757D42AA7L,0x22607085E261D46L,0x1F86376EL},{0xDFE240C72DE1F6L,0x354858A2C0148EEL,0x3E4B91400DA7D26L,0x359628C738B0D12L,0x6A3B49942552E2L,0x2A59B99BD28E132L,0xCC786BAL},{0x97E75A2E41C696L,0x159C4658BEA2FF8L,0x2343EB67AD34D6CL,0x1B0953CE0F43E41L,0x376FB46831223E9L,0x13B960475440DB5L,0x134996A10L},{0x29845719707BB33L,0x31EBBA6CEE8F0AFL,0x2F6C956543D3CD0L,0x23922A1A548AD4AL,0x14980DCFA11AD13L,0x2E893B8096747C2L,0x90D97C81L},{0x15473A1D634B8FL,0xBD5C3C4D25E011L,0x3CD6356CAA205CAL,0x19789CEE14CC93BL,0x20D7819C171C40FL,0x1B7700F9AC90957L,0xE0FA1D81L},{0x1FADC1326ED06F7L,0x145EF61C5332034L,0xDF27942480E420L,0x2539CA49F072DD2L,0x153CD76F2BF565BL,0x2CB93CED8A2F743L,0x2660400EL},{0x299B138573345CCL,0x1D8F8EE42B047L,0x2EF9A00D9B86930L,0x3662B7C0899F573L,0xB45F1496543346L,0x31D9FF8F0D84C51L,0xAD6B9514L},{0x284B529E2561092L,0x25A261BDFAEFAA5L,0x1A88CEA7913516FL,0x22BBF390B4A303EL,0x248C50C477F94FFL,0x20740CFFD614B07L,0xACCBB674L},{0xF8B49CBA8F6AA8L,0x170A7D3E0C18100L,0x1B36E636A5C871AL,0xE6ED8698A43964L,0x1AD2911D9C6DD0L,0x3A9016F523C0428L,0x4D2F259EL},{0x6EF48BB8913F55L,0x217A8F54A6CD78DL,0x192E7EA7D4FBC73L,0x18F84F61EED4C21L,0x3D94A84903216F7L,0x1C29B873AA08165L,0x167A55CDAL},{0x3233D9D55535D4AL,0x3F8BDEEE49220DAL,0x350C4BF39B4852CL,0x3931ABD6482AF15L,0x3D1D74CC4F9FB0CL,0xDB1848C686F953L,0x1866C8ED3L},{0xEE415A15812ED9L,0x3D6C020077B918L,0xFD206357132B92L,0x17BE87D3F5FFACDL,0x2BBA6FF6EE5A437L,0x38FA9FA80EF377EL,0x16A3EF08BL},{0x11A1399126A775CL,0x2A7006962C7EE4FL,0x25BC400A0051D5FL,0x3EA3433E3BD774DL,0xACE9824B5EECFDL,0x2A676CBF0EEA1CDL,0x166007C08L},{0x2C6477FAAF9B7ACL,0xE36E77EA733880L,0x187B6F0F5A6449FL,0x3195543620717B3L,0x2AC783182B70152L,0x61B6CB67EC99BAL,0x8D9E5297L},{0x239142311A5001DL,0x2C57703F4BB7B76L,0x1A0FC9DEC916A20L,0x27C3DA6EEC150BBL,0x2F8228DDCC6D19CL,0x117D0F92C033244L,0xBE0E0795L},{0xD26D98445F5416L,0xD93CB0A0A5EB6AL,0x2489E726AF41727L,0x36F76F34C3848F6L,0x389EDB4D1D115C5L,0x26394E57C8348EFL,0x16B7D2887L},{0x22538B53DBF67F2L,0x15F358DBE5BE247L,0x25DD279CD2ECA67L,0x15546B9FCC430D6L,0x16E8EB15778C485L,0x1903689DBEAAB9FL,0x58DF3306L},{0x2F6102C2E49A03DL,0x10981D8D4A78D4CL,0x356F453E01F78AL,0x3DCC71356729284L,0x43C348B885C84FL,0xE0480786832F5BL,0x1962D75C2L},{0x1479253B03663C1L,0xDA23BD83081B40L,0x232B5BE72E7A07FL,0x395E2602F9BBB0CL,0xFAD0EAE9601A6DL,0x2A7262C94860450L,0x16112C4C3L}};
+#endif
+
+#if HTC_ISO_G2_BLS12381 != 0
+const BIG CURVE_HTPC2= {0x27713A80F8492BL,0x211421FBAA68D1FL,0x361DD4CB6D9723BL,0x1B89D475CD7D27CL,0x21ECE6B49FAD53L,0x301E011E4075923L,0x52988B9L};
+const BIG CURVE_Adr= {0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_Adi= {0xF0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_Bdr= {0x3F4L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_Bdi= {0x3F4L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const BIG PCR[13]= {{0xE2AAAAAAAA5ED1L,0x238E343D9C71C62L,0x108F142B8575709L,0x39FD3A042A88B58L,0x11F5FB614CB14B4L,0x28E333EBB5B7A9AL,0x171D6541FL},{0x2A9FFFFFFFFC71EL,0xAAAA72E3555549L,0xC6B4F20A418147L,0x2B7DEB831FE6882L,0x2D787C88F984F87L,0x2EAA66F0C849BF3L,0x11560BF17L},{0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L},{0x238AAAAAAAA97D6L,0x18E38D0F671C718L,0x423C50AE15D5C2L,0xE7F4E810AA22D6L,0x247D7ED8532C52DL,0x3A38CCFAED6DEA6L,0x5C759507L},{0xCL,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L},{0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L},{0x1B371C71C718B10L,0x2425E95B712F678L,0x37C69AA274524E7L,0xDE87898A1AC3A5L,0x1E3811AD0761B0FL,0x2DB3DE6FEFDC10FL,0x124C9AD43L},{0x2A9FFFFFFFFC71CL,0xAAAA72E3555549L,0xC6B4F20A418147L,0x2B7DEB831FE6882L,0x2D787C88F984F87L,0x2EAA66F0C849BF3L,0x11560BF17L},{0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L},{0x2CFC71C71C6D706L,0x3097AFE324BDA04L,0x39D87D27E500FC8L,0x35281FD926FD510L,0x3076D11930F7DA5L,0x2AD044ED6693062L,0x1530477C7L},{0x12L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L},{0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L},{0x1FEFFFFFFFFA8FBL,0x2FFFFAC54FFFFEEL,0x12A0F6B0F6241EAL,0x213CE144AFD9CC3L,0x2434BACD764774BL,0x25FF9A692C6E9EDL,0x1A0111EA3L}};
+const BIG PCI[13]= {{0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L},{0x354FFFFFFFFE38DL,0x255553971AAAAA4L,0x635A790520C0A3L,0x35BEF5C18FF3441L,0x36BC3E447CC27C3L,0x375533786424DF9L,0x8AB05F8BL},{0x2A9FFFFFFFFC71AL,0xAAAA72E3555549L,0xC6B4F20A418147L,0x2B7DEB831FE6882L,0x2D787C88F984F87L,0x2EAA66F0C849BF3L,0x11560BF17L},{0x238AAAAAAAA97D6L,0x18E38D0F671C718L,0x423C50AE15D5C2L,0xE7F4E810AA22D6L,0x247D7ED8532C52DL,0x3A38CCFAED6DEA6L,0x5C759507L},{0x1FEFFFFFFFFAA9FL,0x2FFFFAC54FFFFEEL,0x12A0F6B0F6241EAL,0x213CE144AFD9CC3L,0x2434BACD764774BL,0x25FF9A692C6E9EDL,0x1A0111EA3L},{0x1FEFFFFFFFFAA63L,0x2FFFFAC54FFFFEEL,0x12A0F6B0F6241EAL,0x213CE144AFD9CC3L,0x2434BACD764774BL,0x25FF9A692C6E9EDL,0x1A0111EA3L},{0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L},{0x354FFFFFFFFE38FL,0x255553971AAAAA4L,0x635A790520C0A3L,0x35BEF5C18FF3441L,0x36BC3E447CC27C3L,0x375533786424DF9L,0x8AB05F8BL},{0x238AAAAAAAA97BEL,0x18E38D0F671C718L,0x423C50AE15D5C2L,0xE7F4E810AA22D6L,0x247D7ED8532C52DL,0x3A38CCFAED6DEA6L,0x5C759507L},{0x2CFC71C71C6D706L,0x3097AFE324BDA04L,0x39D87D27E500FC8L,0x35281FD926FD510L,0x3076D11930F7DA5L,0x2AD044ED6693062L,0x1530477C7L},{0x1FEFFFFFFFFAA99L,0x2FFFFAC54FFFFEEL,0x12A0F6B0F6241EAL,0x213CE144AFD9CC3L,0x2434BACD764774BL,0x25FF9A692C6E9EDL,0x1A0111EA3L},{0x1FEFFFFFFFFA9D3L,0x2FFFFAC54FFFFEEL,0x12A0F6B0F6241EAL,0x213CE144AFD9CC3L,0x2434BACD764774BL,0x25FF9A692C6E9EDL,0x1A0111EA3L},{0x1FEFFFFFFFFA8FBL,0x2FFFFAC54FFFFEEL,0x12A0F6B0F6241EAL,0x213CE144AFD9CC3L,0x2434BACD764774BL,0x25FF9A692C6E9EDL,0x1A0111EA3L}};
+#endif
+
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_BLS12383.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_BLS12383.cpp
new file mode 100644
index 0000000..dcc4a28
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_BLS12383.cpp
@@ -0,0 +1,79 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "ecp_BLS12383.h"
+
+namespace BLS12383 {
+/* Curve BLS12383 - Pairing friendly BLS curve */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B384_29;
+
+// Base Bits= 29
+
+const int CURVE_Cof_I= 0;
+const BIG CURVE_Cof= {0x10011FF,0x400000,0x40,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+//const BIG CURVE_Cof= {0x15169EAB,0xA82AB0A,0xAAEFFED,0x15558001,0x555,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const int CURVE_B_I= 15;
+const BIG CURVE_B= {0xF,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Order= {0x1EBC0001,0x1904CF5F,0x834E5CE,0xBE12B42,0xB381DE0,0xE40B4C,0x270110,0x10018017,0x1002001,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Gx= {0x8734573,0x623B9C8,0x1D1DC11E,0xBB7E107,0x1E3445C5,0x1D6C2578,0x10B0BE1E,0xED6103E,0x10F31D9F,0x296ED82,0x18E0D7D0,0x12F3D9C9,0x1FCBA55B,0x20};
+const BIG CURVE_Gy= {0x3F224,0x968B2F4,0x1FE63F48,0xFA93D90,0x14D2DDE5,0x54A56F5,0x12441D4C,0x18CD76C8,0x199D0DAD,0xE18E236,0x92BA73,0x99F6600,0x8F16727,0x3};
+const BIG CURVE_HTPC= {0x1,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+
+const BIG CURVE_Bnx= {0x1001200,0x400000,0x40,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+
+const BIG CURVE_Pxa= {0xD7F2D86,0x1E59DB1,0x17474F85,0x1FB56CF2,0x572EE81,0xE487AB1,0x96F51FC,0x190A5AAE,0x6432501,0x13E58F3A,0x101E6425,0xFD807D1,0x34D2240,0x3};
+const BIG CURVE_Pxb= {0x452DE15,0x1ECF20F6,0x1FF9837B,0x95651AA,0xD5D75B5,0x5D44749,0x12277F66,0x1DB3A0B9,0x1D24F498,0x19441B0E,0x1CDE9DC5,0x2C975,0xD78006,0x18};
+const BIG CURVE_Pya= {0x1408CB41,0x34785DC,0x3586597,0x13DBC9E4,0x1A2E75B4,0x1D65489,0xCF9A25E,0x1ACE7933,0x1B6E990E,0x19FF31A3,0x12527615,0x1A44A68F,0x1792CF93,0x19};
+const BIG CURVE_Pyb= {0x1F479093,0x16C2321B,0x1889218E,0x87961BC,0x1BC98B01,0x197A24FB,0xA3DEBC2,0x88D67DF,0x1CE0D,0x1E8AD3D7,0x93B9EE9,0x59B18D6,0xE5247DD,0x10};
+#endif
+
+#if CHUNK==64
+
+using namespace B384_58;
+
+// Base Bits= 58
+
+const int CURVE_Cof_I= 0;
+const BIG CURVE_Cof= {0x80000010011FFL,0x40L,0x0L,0x0L,0x0L,0x0L,0x0L};
+//const BIG CURVE_Cof= {0x150556155169EABL,0x2AAB0002AAEFFEDL,0x555L,0x0L,0x0L,0x0L,0x0L};
+const int CURVE_B_I= 15;
+const BIG CURVE_B= {0xFL,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_Order= {0x32099EBFEBC0001L,0x17C25684834E5CEL,0x1C81698B381DE0L,0x2003002E0270110L,0x1002001L,0x0L,0x0L};
+const BIG CURVE_Gx= {0xC4773908734573L,0x176FC20FD1DC11EL,0x3AD84AF1E3445C5L,0x1DAC207D0B0BE1EL,0x52DDB050F31D9FL,0x25E7B3938E0D7D0L,0x41FCBA55BL};
+const BIG CURVE_Gy= {0x12D165E8003F224L,0x1F527B21FE63F48L,0xA94ADEB4D2DDE5L,0x319AED912441D4CL,0x1C31C46D99D0DADL,0x133ECC00092BA73L,0x68F16727L};
+const BIG CURVE_HTPC= {0x1L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_Bnx= {0x8000001001200L,0x40L,0x0L,0x0L,0x0L,0x0L,0x0L};
+
+const BIG CURVE_Pxa= {0x3CB3B62D7F2D86L,0x3F6AD9E57474F85L,0x1C90F562572EE81L,0x3214B55C96F51FCL,0x27CB1E746432501L,0x1FB00FA301E6425L,0x634D2240L};
+const BIG CURVE_Pxb= {0x3D9E41EC452DE15L,0x12ACA355FF9837BL,0xBA88E92D5D75B5L,0x3B6741732277F66L,0x3288361DD24F498L,0x592EBCDE9DC5L,0x300D78006L};
+const BIG CURVE_Pya= {0x68F0BB9408CB41L,0x27B793C83586597L,0x3ACA913A2E75B4L,0x359CF266CF9A25EL,0x33FE6347B6E990EL,0x34894D1F2527615L,0x33792CF93L};
+const BIG CURVE_Pyb= {0x2D846437F479093L,0x10F2C379889218EL,0x32F449F7BC98B01L,0x111ACFBEA3DEBC2L,0x3D15A7AE001CE0DL,0xB3631AC93B9EE9L,0x20E5247DDL};
+
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_BLS12443.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_BLS12443.cpp
new file mode 100644
index 0000000..3ad1d29
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_BLS12443.cpp
@@ -0,0 +1,97 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "ecp_BLS12443.h"
+
+namespace BLS12443 {
+/* Curve BLS12443 - Pairing friendly BLS curve */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B448_29;
+
+// Base Bits= 29
+
+const int CURVE_Cof_I= 0;
+const BIG CURVE_Cof= {0x11FFFFFF,0x1F800000,0x100FF,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const int CURVE_B_I= 4;
+const BIG CURVE_B= {0x4,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Order= {0x1,0x15E00000,0x8FFFFF,0x330FEE0,0x5A3E808,0x1A0482EE,0x174DC4C0,0x6E9E59B,0x1062F694,0x2F9E86,0x41,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Gx= {0x18ABC574,0x13652D93,0xF8A9B4B,0x18DD91D9,0x40BFDDF,0xDEBE0C3,0x1CA5E24A,0x29B37A3,0x9049E88,0x11415BE7,0x1C4F9EAE,0x2569C1B,0x1681E434,0x8BDF6ED,0x19B12D89,0x73};
+const BIG CURVE_Gy= {0x17A9CE3F,0xCA0ABAC,0x710C772,0x120BAD6D,0x900742F,0x3B52AB4,0x1D0A758D,0x13CBE7A7,0x15769DB0,0xC676B97,0x7EF77EB,0x30FC21B,0x43B2B19,0x21C2EEA,0x1887E1D4,0x24};
+const BIG CURVE_HTPC= {0x911B6DF,0xA620224,0x155D68,0xBAE768,0x43A6AA,0xCE9FFD0,0x14EAAC40,0x19772A08,0x10074A9D,0xC451CC1,0xE84AE3C,0xDED8262,0x9680088,0x1A07DE19,0x19648C8F,0x9E};
+
+const BIG CURVE_Bnx= {0x12000000,0x1F800000,0x100FF,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Pxa= {0x1F3AF148,0x12812AAB,0x11B9D6E1,0x1E9B7A3E,0x4DD695A,0x19843AAA,0x15D8C5C5,0xF509C60,0x139FC8E3,0x1060B671,0x11CFC89D,0x1F708C93,0x2219258,0x167260A8,0x117B1177,0x5};
+const BIG CURVE_Pxb= {0x136279B6,0x27B735D,0xB60056F,0x61C6492,0x19E29515,0x18B4393A,0x9480BCF,0x9596877,0x9BD13DD,0x370B284,0x1FEBABF8,0x12D6CB9C,0x164C9DA2,0x9DA997,0x192E45BB,0x1E};
+const BIG CURVE_Pya= {0x11C0B975,0x1FE07513,0x1C67EDF6,0xE36130E,0x1A91EFB9,0x1AC39A4,0x1316E89E,0x4DC3C2C,0x1122B65B,0x173710A4,0x10067CD2,0x1C58269E,0x1BD2F919,0x16A8822B,0x1A81C011,0x8B};
+const BIG CURVE_Pyb= {0x82464AD,0x1F70FF80,0x3C33C6C,0x10AAF915,0x77B77F,0x3152868,0x1BBD7AD8,0xDADC2F9,0x17218280,0xAECA451,0x103E4E3E,0x1BD9B92,0xB9E9169,0x1F547AC3,0x577AC6,0x68};
+
+const BIG CURVE_Ad= {0x98E3466,0x15BE78D9,0x12B6D628,0xD93FCB0,0x1D091D0,0x130C6222,0x14B30AEB,0x13910DCD,0xCA78F64,0xD0F66FC,0xEEC9DEF,0x7F9B01B,0x1760C9FC,0x78FCB94,0x1A839D35,0x33};
+const BIG CURVE_Bd= {0x10F780D9,0xE65C309,0x1D294680,0x1AB4F80F,0x101A1BB2,0xD28DB7E,0x9192026,0x1C25665C,0x14D2890A,0xE458245,0x14A22C11,0x963FDB1,0x8F5BAD7,0x19106B58,0x146889DA,0x53};
+const BIG PC[53]= {{0x3F34E48,0x651745D,0xE259428,0x1383ECF5,0x7BA3300,0x27D38ED,0x1D7FF700,0x9431A4,0x1689CD1,0x545B0E1,0x187C27A6,0x1969C0B2,0xA0C6C03,0x1BF55844,0xA442AE5,0x1E},{0x604D319,0x6D5B3BB,0x1FC7CA7A,0x1C6674A9,0x4CBF065,0x35A66CF,0x159ADD2C,0x1B552927,0x19CC61F8,0x9D5A2C5,0xC0A549B,0x1F40B1BF,0x10CB5BAC,0xFCEF9F5,0x1F238FE7,0x7B},{0x1EA1F60A,0x1A99A439,0x1F84EA1B,0xA936DD8,0x4E25589,0xEA2C846,0x1DE6DCE9,0x1AE6724D,0x191243E0,0x10C3978C,0x134B2B37,0x1BDC07A,0x8D2C8E0,0x7A49BE0,0x14F4B45A,0xA7},{0x17499741,0x260A801,0x7616D51,0x17AEAADD,0x521E193,0x5A429A4,0x1BD4909C,0x19D689BE,0x138A814D,0x101764AE,0xE5495FD,0xD6862F8,0x6EABD3B,0x139CBE79,0x102FAAE0,0x1E},{0x8A9B7DD,0xBC06177,0xE848FDB,0x17FA150F,0x56E9B75,0x1820A4D3,0x5A69ED,0x7B1B04A,0x1B5A80FB,0x17F1C270,0x8B8B6E,0x1CDB6D31,0xD4D2E33,0x1EAB98E9,0x18FD46B7,0x4F},{0x41C4477,0x170C7C9E,0x1A7CEED7,0x104562CB,0x151713B8,0xDE756B,0x100E4CFE,0x1FAAEA0A,0x16BAE1F3,0x1D349BB5,0xC6D2950,0x18311C0F,0x39A42E2,0x182C5CBC,0x4853E91,0x25},{0x10815090,0x2323376,0x20A1BDB,0x5508EE7,0x5B59C38,0xA0AFD37,0x165A6095,0x19B7465E,0x6474F,0x15D05C5C,0x1F4B70EF,0xFDBD849,0x6F8D806,0x1AEA48A0,0xC688DC,0x4E},{0x1500BAD1,0x11B8B8DE,0x169485E4,0x9CBB577,0x18400475,0x1CF76B6C,0xF9C2EC0,0xC5678B7,0x60B689F,0x14149AEA,0x1904CD6D,0x19952882,0x169C5E37,0xDBAA643,0x1C756EAA,0x9E},{0x1E8081C0,0x4410E14,0xAC7DCFD,0x1621F086,0x135547E8,0x199A0DEF,0xB5938FC,0x1B1450DE,0x5AFD544,0x79F9A9F,0x199ED81F,0x17543471,0x126B077C,0x1CE6BCD,0x1DF891D0,0x2B},{0x17226171,0x1C950142,0x16E104BB,0xE1B0949,0x92190E6,0x3F99D6,0x354C7D3,0xF8472E3,0x118257FE,0x1F5B17E4,0x16FD305B,0x1EBF4465,0x63A6551,0x115C8EEB,0xEE9A889,0xA2},{0x7A91954,0x9CA1080,0x12A3E384,0x112E1137,0x18E69E7C,0x1CB385BF,0x10F0213C,0x1AB981F5,0xD5D73EC,0x1172365C,0x1E0EB929,0xB0CA35E,0xE794D69,0x6BF5788,0x73D5885,0x94},{0x192801A5,0x81AFAC5,0x15B7E81,0x1BA422EB,0x39F6E89,0x2A238D6,0x1A3E1907,0x9488AB6,0x7933000,0x1F9A227A,0x1ABA3F3A,0x12DD9604,0x1BB10A18,0xC5456C7,0xD84DE,0x8},{0xF9D1C0A,0x92C9E14,0xD40ECC4,0x1CA779A4,0x14378709,0x7F8AF5E,0x1400B55D,0x9A45554,0x2C03381,0x6B22956,0x1606538F,0x14ED05D5,0x77F1CED,0xCA45FB0,0x1858F2A3,0x96},{0x1F0A734C,0x14ABBA56,0x62122B9,0x149E1F5E,0x11502173,0x194DC7FF,0xCB2DB28,0x1497703A,0x1BF898CF,0x1A9F7152,0x133A7119,0x1EE3FFE6,0x1D9A176F,0xEB09FF5,0x18EC7E61,0x95},{0x11F37A8D,0x137B967F,0x7ED1992,0x112A56C,0xB74C59C,0xF981054,0x1B16179D,0x6FDEA23,0x7CFCEF8,0x170947AC,0x165FEEB3,0x17304126,0x4045C68,0x1EAC0CF1,0x16C0476,0x26},{0x1124740B,0x56CC8D1,0x11A7A71A,0x374C848,0x8B0336B,0x828068D,0x17B3591B,0x12F676CC,0xC2A2446,0x8945941,0x79445E2,0x1FD486BC,0x1D89A7C5,0xCC0BCD2,0x150AFD2,0x6E},{0xD27D311,0x175A4D55,0x68B0D25,0x89656E1,0x18EEF0CC,0x1ECB7F5C,0x141F2E5,0x1FC71B9D,0xB3FF9ED,0x1816DAFB,0x124875C,0x8ECB03B,0x152F5A8E,0xE62A638,0x944C294,0x8F},{0x1F1FC577,0x171D678,0xAE5DEF,0x1033B90B,0x82CAB80,0x558A914,0x1CF59E4B,0x12019535,0x171CE7C8,0xACC9CB1,0x16CD1D1E,0x1C4BE058,0x1BE1ACDC,0xC595284,0x1342A963,0x5F},{0x9150A48,0x12B944D7,0x1D088301,0x118D6111,0xD0F4583,0x1A41F59C,0x5E0D400,0x12013D5F,0x1235B458,0x1DC12203,0xC5391FA,0x14E54599,0xDCCF56C,0x17E1395E,0x770FA99,0x87},{0x1357D628,0x1311EF7C,0x178C48D1,0x1AF751CF,0xDB9E8BF,0xE02049C,0x14F36DA6,0x1FC80D93,0x11A703B0,0x7B2DF3A,0x11F7AF4E,0x6E20944,0x169657CA,0x12D90851,0xCB4DFB2,0x72},{0x117D6EEC,0x111FF17D,0xDCAAB9E,0xF57E6E9,0x877F70,0x1615F8C3,0x15089BD8,0x8C6A10B,0x768CC8C,0xD87AB83,0x1AC4BCA5,0x192138F5,0xEC4C227,0xBB626C5,0x1EAD484,0x59},{0x180B7137,0x17C45952,0xF72FD01,0x14038FD8,0x1BC6906,0x1D30FF2A,0x272EF9D,0x3DDAEBC,0xEF123C2,0x36325B3,0xE4BD355,0x1CA82937,0x11E3AE9B,0x1F3E2015,0x10AA89CD,0x4A},{0x5BEFD8,0x1AC19637,0xCEC24BD,0x1BF4B873,0x39C9045,0x60B6244,0x113A2DBA,0x5DEED3D,0x5F23CCD,0x7AB2FD,0x1C6860B2,0x24F6E9B,0x1B1866E9,0x1CB93691,0x1834BE14,0x2},{0xACA5AD9,0xCDA044,0x1F06B705,0x60D70E0,0x16099A07,0x6B0FFD7,0xA3D226B,0x3BDE7A2,0x76F4EC5,0x1B842F45,0x3EC2206,0x1673113C,0x7E552D3,0x18F5183E,0x1CF7F587,0x97},{0x12C72185,0x141B8D52,0x14B678E2,0x1D6934AB,0x17932E98,0x16339B40,0x1590A131,0x17E6E0AE,0x1943949D,0x1D0E5D2D,0xD2A9510,0x15EB21C4,0x1D89CD87,0xFE5601A,0x11A001F4,0x5F},{0xEFEE0EA,0x1F50A4DD,0x111B4E23,0x19E8C81C,0x5EDC2C3,0x126703FF,0x13C16387,0x12147E91,0xD63425F,0xCF00CF7,0x47A627C,0x5E7D6B1,0xEE08F4E,0x1766140F,0xBB95F5F,0x96},{0x16887410,0x1FA80776,0x93C0854,0x1EA20D2,0x1CBCC511,0x179B0F85,0x5396256,0x8D385B5,0x19CDF1BA,0x18ECD9E9,0xF80B760,0x1072505E,0x5BD4CB5,0x22FBE14,0x1EA80B78,0x7B},{0xDD0AA9,0x1F70909A,0xD5597D7,0x101CE2A8,0x617757C,0xDEEDA0C,0x11EA1972,0x114E055,0xF76A90,0x1A95E01E,0x15379DEC,0x175A609C,0x14C8FDB9,0x115156DE,0xCBF4809,0x96},{0x1E428BFD,0x16F21A08,0x3ADF604,0x82249C5,0x1CB7A3FA,0x1E570ACB,0x1EB4B47B,0xECB355A,0x84B430D,0x1BBAA20E,0x1C8EF513,0x115C7B9F,0x1D5EB53A,0x122DD3FB,0x17BB0101,0x50},{0x12540F1F,0x13939806,0x18268D14,0x1FBD962B,0xB448310,0xEF54811,0x23A248,0x162322C2,0x3AF19BB,0x13AB6F20,0x179673B2,0x1B141CDA,0x40D00EE,0x1B1F7AD8,0x9046568,0xA4},{0x1545BF96,0x11613F77,0x1925835E,0x14B70DE1,0x14CA0A0A,0x17FB7979,0x43DDB1A,0xA1AFFB6,0x5E74A2D,0x1DA600F1,0x4D0C711,0x9107354,0x2A96CA7,0x7460C2C,0x4772C30,0x9C},{0xC96D5DE,0x11B3C719,0x12C44E72,0x62A8455,0xB3522DF,0x1722392D,0x17C4C84A,0xC5B08EF,0x1C73E4E8,0x184F76C5,0x1BE85639,0x4178224,0x5F1ADAC,0x1004293E,0x14020923,0x6C},{0x1A433825,0xF576BC3,0x159F38EF,0x1A9CD3BC,0x5854D83,0x1C7BD842,0x113DF3CB,0x195CCF87,0xF553CAE,0x4937DAE,0x12924884,0x15F7F1B0,0x18EBD637,0x1A325E15,0x1CE00B35,0x33},{0xF92004C,0x960B5AD,0x16377D4C,0x6B9BC92,0x1B008FFB,0x1235B5EB,0x1CCD413F,0x15FF451A,0x22BBD23,0x18E7FA12,0x15789412,0x1407F3AD,0xE34E149,0x1DD9EF60,0x85B4C28,0xA1},{0x93FF538,0x7AA0B71,0x3D2CEB3,0x61BCB1E,0xACC622E,0x1A3767DE,0x61F027B,0x185CDCB1,0x13E6A1E9,0xE361803,0x1880218F,0x62895FE,0x14B2BBFE,0xD240288,0x1C1FC271,0x13},{0x1B349B02,0xB53E37C,0x1ED9EA61,0x5AB2858,0xB67832E,0x2AA71F7,0xDB9D08F,0xC73B305,0x73FA5E7,0x13B8B1BB,0x55FF6BB,0x85C4222,0x1CE8EB95,0xFFD7A2F,0xE35B9C2,0x7B},{0x1E8BF419,0x58C0D7E,0x1E8CB5A2,0x73EC57B,0x1BA6872,0x8468C61,0x188BEA65,0x1816C6AF,0x13946FCA,0x1CAB443C,0x1A0B0CBE,0x133FAF0E,0x1DFEAF70,0x81B1972,0x7C15DCD,0x2F},{0x15EA6770,0x153E7411,0x194A07B0,0x3DE3153,0x1B272CD3,0x1457211A,0xBBE8481,0x124FDB0F,0x1D9F0AB1,0x1C1A31DD,0x1C1A7078,0xE0FBD4B,0x4C2F512,0x1E9AA0A2,0xD77577F,0x9D},{0x6C0FF64,0xDED97C9,0x1ABFB826,0x10A18BCB,0xA2E9E97,0x2F2BF0C,0x1BE37B6,0x15083D61,0x1F0EAD50,0x1285E151,0xE8C9A5,0xAACDD1C,0x21BAABC,0x12A1AB54,0xDF074C8,0x33},{0x1AD61CD4,0x15B2A8D2,0xE89EDBC,0x1FC8A43B,0x1B234A16,0x56FF55F,0x4434214,0x19A164DF,0x6FD7D0B,0x1F59707F,0x4024A6B,0x3C55387,0xB3B4937,0xC2440D9,0x151CFAE4,0x25},{0x13196AB7,0x1C4BE1B9,0x12338A3D,0x43704AC,0x5D1A5BF,0x1B56BCC6,0x907C135,0x111C7910,0x3E32A73,0xBF1FC0B,0xE4F0527,0x5083EC8,0x17B28B9,0x6268B6,0x55F070B,0x39},{0xA64A98B,0x1F4F594,0x1090DE8C,0x1CCB6B44,0x1BDBE18A,0x1915B90,0x1837267C,0x13AA0893,0x9E2045F,0x140227B2,0x151C8D7,0x1CF5C8F1,0x16B1A688,0x1E328319,0x174847C4,0x29},{0x23F15E0,0x20AE21E,0x2250855,0x13008AB4,0x73F6DF,0x111C5B0C,0x159AF9C6,0xB7FE152,0x79DF96D,0x9C80D6,0x8824E75,0xEA4AE30,0xD1ACD04,0x186AA2D2,0x1089D613,0x3F},{0xDEEFD29,0xE27AD26,0x1D3C7648,0x114BFF08,0x1E99583F,0x117A1E0B,0xBEB066D,0x888DA10,0x3FCD8,0x452C56F,0x1151FB02,0x1BBC16F2,0x5BDE13E,0xF9C061A,0x5F0DF6F,0x4A},{0xC6AA7A5,0xB730285,0x16623E6B,0x11428639,0xE16EF5A,0xB3CA060,0xD95CDD3,0xCD03F43,0xCC34C0E,0x1E6D50EB,0x1454A80,0x1DDE2C91,0x18D93981,0x1F2FBD71,0xD51A6B7,0x52},{0x8B3D97C,0x93E33A9,0xE5BECEC,0x1B419BCC,0x19948005,0x17561899,0xAB43192,0x62F209E,0x72E20EB,0x1404250C,0x1DE0C492,0x3B72CA1,0x10C7D312,0x1AC39F4F,0xCC2FE92,0x24},{0x17E5B5CD,0xAC10F48,0x4D24A06,0x13D52E8B,0x3CAC1AD,0x9AFA89C,0x15A904CE,0x1973387C,0xE4F654D,0x6BDE920,0x2894302,0x115601A7,0x6F09153,0x6D61B04,0xC0C09D6,0x2F},{0x20CBB48,0x1CD36C35,0x1D1ECCAD,0xA4A2E64,0x6410B48,0x1F0178A6,0x140D5A2A,0xBC9E98D,0x25196AD,0x1D674AE6,0x17968F26,0x170DF7C0,0x14FA6C21,0x11136ABF,0x16E9371E,0x84},{0x120E7325,0x2081D06,0x1178C70E,0x18029A79,0x1D1A3656,0x8BD4833,0x678C01,0x1FFEA081,0x1E52B15F,0x6DB1DE3,0x1312FB85,0xCF17DA,0xD42415A,0xE097FC3,0x14AF9D8F,0x91},{0x3BCD51F,0x1252FE3F,0x1CFC6139,0x865D2A9,0x351F9EE,0x94E9CD5,0x16A17578,0x1D1A2E67,0x18D6D662,0x15C773CC,0x15DFD11A,0xC186191,0x261488A,0x14F3BFC3,0x13D7B4DA,0x58},{0x1F460AFF,0xEBF619A,0x21112D1,0x6519E28,0x16301DF6,0x122DCCC,0x199520F0,0x18B93BAA,0x1066120A,0xAB20E15,0x153840C7,0x1553B357,0x65990C8,0x1480086C,0x70D3E2F,0x16},{0x188381C1,0x61392FE,0x106D2339,0x1FF56EA5,0x2C827C6,0x1542A2B,0x102CF503,0x25FD7D8,0x8F93EAA,0xA554551,0xEC5FC64,0x18684127,0x71BE49B,0xAD4A921,0x2AA5579,0x11},{0x20F40C4,0xE3CE918,0xEF3E41,0x6819DB7,0xA3F7AA3,0x1704BF3,0x1FC1BE3A,0x1D2E30CC,0x1D39A6D9,0x1340E096,0xDBC8405,0x5CE2E57,0x117283E0,0x1F8CF7E8,0x95C44F4,0xA7}};
+const BIG CURVE_HTPC2= {0x152C1DFF,0x99DA487,0x18C185A2,0x6546AF3,0x144EC7F8,0xEF3797,0x1994DD57,0x179C04E7,0x57CDB0F,0x2585126,0x49E8583,0xCA412D5,0x6BFAFF3,0x14C442E4,0xBD9A0,0x1B};
+const BIG CURVE_Adr= {0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Adi= {0xF0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Bdr= {0x3F4,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Bdi= {0x3F4,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG PCR[13]= {{0xB425ED1,0xA84BDA1,0x81DED55,0x1E8897B4,0x73D0AA2,0x1D575C73,0x3B6AF6,0xBF03B37,0x19D6C70F,0x14E85262,0x3AB4A64,0x1D1426CB,0x12C9C7B1,0x121291F5,0x967F827,0x9B},{0x71C71E,0x1FE38E39,0x61671FF,0x6E671C7,0xD6DC7FA,0x6018556,0x82C9039,0x10F42C69,0x361154B,0xFAE3DCA,0xAC077CB,0xDCF1D18,0x61755C5,0x158DED78,0xF0DFA1D,0x74},{0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0xAD097D6,0xAA12F68,0x2077B55,0x17A225ED,0x19CF42A8,0x1755D71C,0x180EDABD,0x1AFC0ECD,0x1675B1C3,0x53A1498,0x18EAD299,0xF4509B2,0xCB271EC,0x1C84A47D,0x1A59FE09,0x26},{0xC,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0xEDD3C0D,0x18BA7819,0x8CB1671,0x6694F03,0x1A8220DB,0x1A73F97C,0x1D95B3E0,0x14EEEAD0,0xBFE0250,0x16A65940,0xBF99097,0xCD5D4B1,0x1AFEDAB,0x63EC8CA,0x785F780,0xA8},{0x1038E38F,0x1FF1C71C,0x130B38FF,0x37338E3,0x6B6E3FD,0x1300C2AB,0x1416481C,0x187A1634,0x1B08AA5,0x17D71EE5,0x5603BE5,0x16E78E8C,0x30BAAE2,0x1AC6F6BC,0x786FD0E,0x3A},{0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0x974F017,0x369E065,0x17C758C7,0x1A983C0C,0xD9A7F86,0x1EC90DEE,0x18E4681,0x1770E36A,0xC3296E,0x4094EF4,0x1F84274B,0x5334FD7,0xB56B4B5,0x7FC768B,0x1A58F87B,0x94},{0x12,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0x10AAA8FB,0x1FD55555,0x1921AAFF,0xA59AAAA,0x1424ABF7,0x19024801,0x1C42D855,0x96E429D,0x5119FF1,0x7855CAF,0x1020B3B1,0x4B6ABA4,0x92300A8,0x1054E434,0x1694F72C,0xAE}};
+const BIG PCI[13]= {{0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0x1038E38D,0x1FF1C71C,0x130B38FF,0x37338E3,0x6B6E3FD,0x1300C2AB,0x1416481C,0x187A1634,0x1B08AA5,0x17D71EE5,0x5603BE5,0x16E78E8C,0x30BAAE2,0x1AC6F6BC,0x786FD0E,0x3A},{0x71C71A,0x1FE38E39,0x61671FF,0x6E671C7,0xD6DC7FA,0x6018556,0x82C9039,0x10F42C69,0x361154B,0xFAE3DCA,0xAC077CB,0xDCF1D18,0x61755C5,0x158DED78,0xF0DFA1D,0x74},{0xAD097D6,0xAA12F68,0x2077B55,0x17A225ED,0x19CF42A8,0x1755D71C,0x180EDABD,0x1AFC0ECD,0x1675B1C3,0x53A1498,0x18EAD299,0xF4509B2,0xCB271EC,0x1C84A47D,0x1A59FE09,0x26},{0x10AAAA9F,0x1FD55555,0x1921AAFF,0xA59AAAA,0x1424ABF7,0x19024801,0x1C42D855,0x96E429D,0x5119FF1,0x7855CAF,0x1020B3B1,0x4B6ABA4,0x92300A8,0x1054E434,0x1694F72C,0xAE},{0x10AAAA63,0x1FD55555,0x1921AAFF,0xA59AAAA,0x1424ABF7,0x19024801,0x1C42D855,0x96E429D,0x5119FF1,0x7855CAF,0x1020B3B1,0x4B6ABA4,0x92300A8,0x1054E434,0x1694F72C,0xAE},{0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0x71C71C,0x1FE38E39,0x61671FF,0x6E671C7,0xD6DC7FA,0x6018556,0x82C9039,0x10F42C69,0x361154B,0xFAE3DCA,0xAC077CB,0xDCF1D18,0x61755C5,0x158DED78,0xF0DFA1D,0x74},{0x5DA12ED,0x153425ED,0x171A2FAA,0x12B784BD,0x1A55694E,0x1AC70E4,0x433FD98,0xE7233D0,0xE9BEE2D,0x24B4816,0x1735E118,0x1571A1F1,0x1C708EBB,0x13D03FB6,0x1C3AF922,0x87},{0x974F017,0x369E065,0x17C758C7,0x1A983C0C,0xD9A7F86,0x1EC90DEE,0x18E4681,0x1770E36A,0xC3296E,0x4094EF4,0x1F84274B,0x5334FD7,0xB56B4B5,0x7FC768B,0x1A58F87B,0x94},{0x10AAAA99,0x1FD55555,0x1921AAFF,0xA59AAAA,0x1424ABF7,0x19024801,0x1C42D855,0x96E429D,0x5119FF1,0x7855CAF,0x1020B3B1,0x4B6ABA4,0x92300A8,0x1054E434,0x1694F72C,0xAE},{0x10AAA9D3,0x1FD55555,0x1921AAFF,0xA59AAAA,0x1424ABF7,0x19024801,0x1C42D855,0x96E429D,0x5119FF1,0x7855CAF,0x1020B3B1,0x4B6ABA4,0x92300A8,0x1054E434,0x1694F72C,0xAE},{0x10AAA8FB,0x1FD55555,0x1921AAFF,0xA59AAAA,0x1424ABF7,0x19024801,0x1C42D855,0x96E429D,0x5119FF1,0x7855CAF,0x1020B3B1,0x4B6ABA4,0x92300A8,0x1054E434,0x1694F72C,0xAE}};
+#endif
+
+#if CHUNK==64
+
+using namespace B448_60;
+
+// Base Bits= 60
+
+const int CURVE_Cof_I= 0;
+const BIG CURVE_Cof= {0xFF0000011FFFFFFL,0x403FL,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const int CURVE_B_I= 4;
+const BIG CURVE_B= {0x4L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_Order= {0xEBC000000000001L,0x81987F70023FFFFL,0x340905DC5A3E80L,0x94374F2CDDD3713L,0x10405F3D0D062F6L,0x0L,0x0L,0x0L};
+const BIG CURVE_Gx= {0xE6CA5B278ABC574L,0xFC6EC8ECBE2A6D2L,0x29BD7C18640BFDDL,0x8814D9BD1F29789L,0xABA282B7CE9049EL,0x43412B4E0DF13E7L,0xB62517BEDDB681EL,0x39E6C4L};
+const BIG CURVE_Gy= {0x994157597A9CE3FL,0xF905D6B69C431DCL,0x3476A5568900742L,0xB09E5F3D3F429D6L,0xFAD8CED72F5769DL,0xB19187E10D9FBDDL,0x87504385DD443B2L,0x12621FL};
+const BIG CURVE_HTPC= {0x14C40448911B6DFL,0xA05D73B4005575AL,0x19D3FFA0043A6AL,0x9DCBB950453AAB1L,0x8F188A39830074AL,0x886F6C1313A12BL,0x323F40FBC329680L,0x4F6592L};
+
+const BIG CURVE_Bnx= {0xFF0000012000000L,0x403FL,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_Pxa= {0x65025557F3AF148L,0xAF4DBD1F46E75B8L,0x1730875544DD695L,0xE37A84E30576317L,0x2760C16CE339FC8L,0x258FB84649C73F2L,0x45DECE4C1502219L,0x2C5ECL};
+const BIG CURVE_Pxb= {0xC4F6E6BB36279B6L,0x530E32492D8015BL,0x3F16872759E2951L,0xDD4ACB43BA5202FL,0xFE06E165089BD13L,0xDA296B65CE7FAEAL,0x16EC13B532F64C9L,0xF64B9L};
+const BIG CURVE_Pya= {0xBFC0EA271C0B975L,0x971B0987719FB7DL,0x783587349A91EFBL,0x5B26E1E164C5BA2L,0x34AE6E2149122B6L,0x919E2C134F4019FL,0x46D510457BD2FL,0x45EA07L};
+const BIG CURVE_Pyb= {0x3EE1FF0082464ADL,0xF8557C8A8F0CF1BL,0x6062A50D0077B77L,0x806D6E17CEEF5EBL,0x8F95D948A372182L,0x1690DECDC940F93L,0xEB1BEA8F586B9E9L,0x34015DL};
+
+const BIG CURVE_Ad= {0x2B7CF1B298E3466L,0x6C9FE584ADB58AL,0xAE618C4441D091DL,0x649C886E6D2CC2BL,0x7BDA1ECDF8CA78FL,0x9FC3FCD80DBBB27L,0x74D4F1F9729760CL,0x19EA0EL};
+const BIG CURVE_Bd= {0x1CCB86130F780D9L,0x2D5A7C07F4A51A0L,0x99A51B6FD01A1BBL,0xAE12B32E246480L,0x45C8B048B4D289L,0xAD74B1FED8D288BL,0x276B220D6B08F5BL,0x29D1A2L};
+const BIG PC[53]= {{0xCA2E8BA3F34E48L,0x9C1F67AB89650AL,0x4FA71DA7BA330L,0xD104A18D275FFDCL,0xE98A8B61C21689CL,0xC03CB4E05961F09L,0xAB977EAB088A0C6L,0xF2910L},{0x8DAB6776604D319L,0x5E333A54FF1F29EL,0xB06B4CD9E4CBF06L,0xF8DAA9493D66B74L,0x26D3AB458B9CC61L,0xBACFA058DFB0295L,0x3F9DF9DF3EB0CB5L,0x3DFC8EL},{0xF5334873EA1F60AL,0x9549B6EC7E13A86L,0xA5D45908C4E2558L,0xE0D733926F79B73L,0xCDE1872F1991243L,0x8E00DEE03D4D2CAL,0xD168F4937C08D2CL,0x53D3D2L},{0x44C150037499741L,0x3BD7556E9D85B54L,0x70B485348521E19L,0x4DCEB44DF6F5242L,0x7F602EC95D38A81L,0xD3B6B4317C39525L,0xAB827397CF26EABL,0xF40BEL},{0xD780C2EE8A9B7DDL,0x5BFD0A87BA123F6L,0xB704149A656E9B7L,0xFB3D8D8250169A7L,0xDBAFE384E1B5A80L,0xE33E6DB698822E2L,0x1ADFD5731D2D4D2L,0x27E3F5L},{0xEE18F93C41C4477L,0x8822B165E9F3BB5L,0xF81BCEAD751713BL,0xF3FD57505403933L,0x543A69376B6BAE1L,0x2E2C188E07B1B4AL,0xFA47058B97839A4L,0x129214L},{0xC46466ED0815090L,0x82A8477388286F6L,0x55415FA6E5B59C3L,0x4FCDBA32F596982L,0x3BEBA0B8B800647L,0x8067EDEC24FD2DCL,0x23735D491406F8DL,0x27031AL},{0x237171BD500BAD1L,0x54E5DABBDA52179L,0x39EED6D9840047L,0x9F62B3C5BBE70BBL,0x5B682935D460B68L,0xE37CCA944164133L,0xBAA9B754C8769C5L,0x4F71D5L},{0x48821C29E8081C0L,0x8B10F8432B1F73FL,0xF33341BDF35547EL,0x44D8A286F2D64E3L,0x7CF3F353E5AFD5L,0x77CBAA1A38E67B6L,0x474039CD79B26B0L,0x15F7E2L},{0xF92A02857226171L,0x670D84A4DB8412EL,0x4C07F33AC92190EL,0xFE7C239718D531FL,0x16FEB62FC918257L,0x551F5FA232DBF4CL,0xA2262B91DD663A6L,0x513BA6L},{0x139421007A91954L,0xC897089BCA8F8E1L,0xF39670B7F8E69E7L,0xECD5CC0FAC3C084L,0x4A62E46CB8D5D73L,0xD6958651AF783AEL,0x6214D7EAF10E794L,0x4A1CF5L},{0x5035F58B92801A5L,0x9DD21175856DFA0L,0x1C54471AC39F6E8L,0x4A4455B68F864L,0xCEBF3444F479330L,0xA1896ECB026AE8FL,0x13798A8AD8FBB10L,0x40036L},{0x12593C28F9D1C0AL,0x9E53BCD23503B31L,0x74FF15EBD437870L,0x814D22AAA5002D5L,0xE3CD6452AC2C033L,0xCEDA7682EAD8194L,0xCA8D948BF6077F1L,0x4B6163L},{0x695774ADF0A734CL,0x3A4F0FAF18848AEL,0xA329B8FFF150217L,0xCFA4BB81D32CB6CL,0x46753EE2A5BF898L,0x76FF71FFF34CE9CL,0xF985D613FEBD9A1L,0x4AE3B1L},{0xA6F72CFF1F37A8DL,0xC08952B61FB4664L,0x75F3020A8B74C59L,0xF837EF511EC585EL,0xACEE128F587CFCEL,0xC68B982093597FBL,0x11DBD5819E24045L,0x1305B0L},{0x8AD991A3124740BL,0xB1BA6424469E9C6L,0x6D0500D1A8B0336L,0x4697B3B665ECD64L,0x789128B282C2A24L,0x7C5FEA435E1E511L,0xBF4998179A5D89AL,0x370542L},{0x6EB49AAAD27D311L,0xC44B2B709A2C349L,0x97D96FEB98EEF0CL,0xEDFE38DCE8507CBL,0xD7302DB5F6B3FF9L,0xA8E476581D84921L,0xA51CC54C7152F5L,0x47A513L},{0xC2E3ACF1F1FC577L,0x819DC8582B977BL,0x2CAB1522882CAB8L,0xC8900CA9AF3D679L,0x479599396371CE7L,0xCDCE25F02C5B347L,0xA58D8B2A509BE1AL,0x2FCD0AL},{0x657289AE9150A48L,0x38C6B088F4220C0L,0x3483EB38D0F458L,0x589009EAF978350L,0x7EBB824407235B4L,0x56CA72A2CCB14E4L,0xEA66FC272BCDCCFL,0x439DC3L},{0x6623DEF9357D628L,0xFD7BA8E7DE31234L,0x99C040938DB9E8BL,0xB0FE406C9D3CDB6L,0xD38F65BE751A703L,0x7CA37104A247DEBL,0x7ECA5B210A36965L,0x3932D3L},{0xA23FE2FB17D6EECL,0x7ABF374B72AAE7L,0x62C2BF1860877F7L,0x8C4635085D4226FL,0x295B0F5706768CCL,0x227C909C7AEB12FL,0x521176C4D8AEC4CL,0x2C87ABL},{0x6F88B2A580B7137L,0x6A01C7EC3DCBF40L,0x77A61FE541BC690L,0xC21EED75E09CBBEL,0xD546C64B66EF123L,0xE9BE54149BB92F4L,0x2737E7C402B1E3AL,0x2542AAL},{0x75832C6E05BEFD8L,0x5DFA5C39B3B092FL,0xE8C16C48839C904L,0xCD2EF769EC4E8B6L,0x2C80F565FA5F23CL,0x6E9127B74DF1A18L,0xF8539726D23B186L,0x160D2L},{0x419B4088ACA5AD9L,0x7306B8707C1ADC1L,0xACD61FFAF6099A0L,0xC51DEF3D128F489L,0x81B7085E8A76F4EL,0x2D3B39889E0FB08L,0xD61F1EA307C7E55L,0x4BF3DFL},{0xA8371AA52C72185L,0x8EB49A55D2D9E38L,0xC6C6736817932E9L,0x9DBF37057564284L,0x443A1CBA5B94394L,0xD87AF590E234AA5L,0x7D1FCAC035D89CL,0x2FC680L},{0xFEA149BAEFEE0EAL,0x3CF4640E446D388L,0x1E4CE07FE5EDC2CL,0x5F90A3F48CF058EL,0x9F19E019EED6342L,0xF4E2F3EB5891E98L,0x7D7EECC281EEE08L,0x4B2EE5L},{0x3F500EED6887410L,0x10F5106924F0215L,0x5AF361F0BCBCC51L,0xBA469C2DA94E589L,0xD831D9B3D39CDF1L,0xCB5839282F3E02DL,0x2DE045F7C285BD4L,0x3DFAA0L},{0xFEE121340DD0AA9L,0xC80E715435565F5L,0xC9BDDB418617757L,0x9008A702AC7A865L,0x7B352BC03C0F76AL,0xDB9BAD304E54DE7L,0x20262A2ADBD4C8FL,0x4B32FDL},{0x2DE43411E428BFDL,0xA41124E28EB7D81L,0xEFCAE1597CB7A3FL,0xD7659AAD7AD2D1L,0x44F775441C84B43L,0x53A8AE3DCFF23BDL,0x40645BA7F7D5EBL,0x285EECL},{0x2727300D2540F1FL,0xFDECB15E09A345L,0x21DEA9022B44831L,0xBBB119161008E89L,0xECA756DE403AF19L,0xEED8A0E6D5E59CL,0x95A363EF5B040D0L,0x522411L},{0xA2C27EEF545BF96L,0xAA5B86F0E4960D7L,0x6AFF6F2F34CA0A0L,0x2D50D7FDB10F76CL,0xC47B4C01E25E74AL,0xCA748839AA13431L,0xB0C0E8C18582A96L,0x4E11DCL},{0xA3678E32C96D5DEL,0xF315422ACB1139CL,0x2AE44725AB3522DL,0xE862D8477DF1321L,0x8E709EED8BC73E4L,0xDAC20BC1126FA15L,0x248E008527C5F1AL,0x365008L},{0xDEAED787A433825L,0x3D4E69DE567CE3BL,0x2F8F7B0845854D8L,0xAECAE67C3C4F7CFL,0x210926FB5CF553CL,0x637AFBF8D84A492L,0x2CD7464BC2B8EBDL,0x19F380L},{0x12C16B5AF92004CL,0xB35CDE4958DDF53L,0xFE46B6BD7B008FFL,0x23AFFA28D733504L,0x4B1CFF42422BBDL,0x149A03F9D6D5E25L,0x30A3BB3DEC0E34EL,0x50A16DL},{0xCF5416E293FF538L,0xE30DE58F0F4B3ACL,0xEF46ECFBCACC622L,0xE9C2E6E58987C09L,0x63DC6C30073E6A1L,0xBFE3144AFF62008L,0x9C5A4805114B2BL,0x9F07FL},{0x56A7C6F9B349B02L,0xE2D5942C7B67A98L,0x3C554E3EEB67832L,0xE7639D982B6E742L,0xAEE771637673FA5L,0xB9542E2111157FDL,0xE709FFAF45FCE8EL,0x3DB8D6L},{0x8B181AFDE8BF419L,0x239F62BDFA32D68L,0x9508D18C21BA687L,0xCAC0B6357E22FA9L,0x2FB95688793946FL,0xF7099FD787682C3L,0x773503632E5DFEAL,0x179F05L},{0x2A7CE8235EA6770L,0x31EF18A9E5281ECL,0x68AE4235B272CDL,0xB1927ED87AEFA12L,0x1E383463BBD9F0AL,0x512707DEA5F069CL,0x5DFFD3541444C2FL,0x4EB5DDL},{0x9BDB2F926C0FF64L,0x7850C5E5EAFEE09L,0xD85E57E18A2E9E9L,0x50A841EB086F8DEL,0x69650BC2A3F0EADL,0xABC5566E8E03A32L,0xD32254356A821BAL,0x19B7C1L},{0x2B6551A5AD61CD4L,0x6FE4521DBA27B6FL,0x50ADFEABFB234A1L,0xBCD0B26F910D08L,0x9AFEB2E0FE6FD7DL,0x9371E2A9C390092L,0xEB9184881B2B3B4L,0x12D473L},{0x7897C3733196AB7L,0xF21B825648CE28FL,0xD76AD798C5D1A5BL,0x7388E3C88241F04L,0x49D7E3F8163E32AL,0x8B92841F64393C1L,0x1C2C0C4D16C17B2L,0x1C957CL},{0x3E9EB28A64A98BL,0xAE65B5A242437A3L,0xF0322B721BDBE18L,0x5F9D50449E0DC99L,0x35E8044F649E204L,0x688E7AE47885472L,0x1F13C6506336B1AL,0x14DD21L},{0x4415C43C23F15E0L,0xF980455A0894215L,0x1A238B618073F6DL,0x6D5BFF0A9566BE7L,0x9D413901AC79DF9L,0xD04752571822093L,0x584F0D545A4D1ACL,0x1FC227L},{0x1C4F5A4CDEEFD29L,0xF8A5FF8474F1D92L,0xB62F43C17E99583L,0xD84446D082FAC19L,0xC088A58ADE003FCL,0x13EDDE0B794547EL,0x7DBDF380C345BDEL,0x2517C3L},{0xD6E6050AC6AA7A5L,0xA8A1431CD988F9AL,0x4D67940C0E16EF5L,0xE6681FA1B65737L,0xA03CDAA1D6CC34CL,0x981EEF164885152L,0x9ADFE5F7AE38D93L,0x293546L},{0x127C67528B3D97CL,0x5DA0CDE6396FB3BL,0x4AEAC3133994800L,0xEB317904F2AD0C6L,0x24A8084A1872E20L,0x3121DB9650F7831L,0xFA4B5873E9F0C7DL,0x12330BL},{0x95821E917E5B5CDL,0xD9EA97459349281L,0x3935F51383CAC1AL,0x4DCB99C3E56A413L,0xC08D7BD240E4F65L,0x1538AB00D38A250L,0x2758DAC36086F09L,0x17B030L},{0x79A6D86A20CBB48L,0x85251732747B32BL,0xABE02F14C6410B4L,0xAD5E4F4C6D03568L,0xC9BACE95CC25196L,0xC21B86FBE05E5A3L,0xDC7A226D57F4FA6L,0x425BA4L},{0x84103A0D20E7325L,0x6C014D3CC5E31C3L,0x517A9067D1A365L,0x5FFFF5040819E30L,0xE14DB63BC7E52B1L,0x15A0678BED4C4BEL,0x763DC12FF86D424L,0x48D2BEL},{0x64A5FC7E3BCD51FL,0xE432E954F3F184EL,0xE129D39AA351F9EL,0x62E8D1733DA85D5L,0x46AB8EE7998D6D6L,0x88A60C30C8D77F4L,0xD36A9E77F862614L,0x2C4F5EL},{0x5D7EC335F460AFFL,0x6328CF1408444B4L,0xC0245B9996301DFL,0xAC5C9DD5665483L,0x31D5641C2B06612L,0xC8AA9D9ABD4E10L,0xF8BE90010D86599L,0xB1C34L},{0x4C2725FD88381C1L,0x6FFAB752C1B48CEL,0xC2A854562C827CL,0xAA12FEBEC40B3D4L,0x1914AA8AA28F93EL,0x49BC342093BB17FL,0x55E55A9524271BEL,0x88AA9L},{0x5C79D23020F40C4L,0x3340CEDB83BCF90L,0xE82E097E6A3F7AAL,0xD9E9718667F06F8L,0x16681C12DD39A6L,0x3E02E7172BB6F21L,0x13D3F19EFD11728L,0x53A571L}};
+const BIG CURVE_HTPC2= {0x933B490F52C1DFFL,0x832A3579E306168L,0x5C1DE6F2F44EC7FL,0xFBCE0273E65375L,0x60C4B0A24C57CDBL,0xFF3652096A927A1L,0x668298885C86BFAL,0xD802FL};
+const BIG CURVE_Adr= {0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_Adi= {0xF0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_Bdr= {0x3F4L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_Bdi= {0x3F4L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const BIG PCR[13]= {{0x55097B42B425ED1L,0x2F444BDA2077B55L,0xDBAAEB8E673D0AAL,0xF5F81D9B80EDABL,0x9929D0A4C59D6C7L,0x7B1E8A13658EAD2L,0xE09E42523EB2C9CL,0x4DA59FL},{0xFFC71C72071C71EL,0xA37338E39859C7FL,0xE4C030AACD6DC7FL,0x4B87A1634A0B240L,0xF2DF5C7B9436115L,0x5C56E78E8C2B01DL,0xE876B1BDAF06175L,0x3A3C37L},{0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L},{0x55425ED0AD097D6L,0x8BD112F6881DED5L,0xF6EABAE399CF42AL,0xC3D7E0766E03B6AL,0xA64A742931675B1L,0x1EC7A284D963AB4L,0xF82790948FACB27L,0x136967L},{0xCL,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L},{0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L},{0x7174F032EDD3C0DL,0xB334A781A32C59CL,0x834E7F2F9A8220DL,0x50A7775687656CFL,0x25ED4CB280BFE02L,0xDAB66AEA58AFE64L,0xDE00C7D91941AFEL,0x541E17L},{0xFFE38E39038E38FL,0xD1B99C71CC2CE3FL,0x7260185566B6E3FL,0xA5C3D0B1A505920L,0xF96FAE3DCA1B08AL,0xAE2B73C7461580EL,0xF43B58DED7830BAL,0x1D1E1BL},{0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L},{0xC6D3C0CA974F017L,0x6D4C1E065F1D631L,0x7D921BDCD9A7F8L,0x6EBB871B506391AL,0xD2C8129DE80C329L,0x4B5299A7EBFE109L,0xE1ECFF8ED16B56BL,0x4A6963L},{0x12L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L},{0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L},{0xFFAAAAAB0AAA8FBL,0x752CD5556486ABFL,0x572049003424ABFL,0xF14B7214EF10B61L,0xEC4F0AB95E5119FL,0xA825B55D24082CL,0xDCB20A9C8689230L,0x575A53L}};
+const BIG PCI[13]= {{0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L},{0xFFE38E39038E38DL,0xD1B99C71CC2CE3FL,0x7260185566B6E3FL,0xA5C3D0B1A505920L,0xF96FAE3DCA1B08AL,0xAE2B73C7461580EL,0xF43B58DED7830BAL,0x1D1E1BL},{0xFFC71C72071C71AL,0xA37338E39859C7FL,0xE4C030AACD6DC7FL,0x4B87A1634A0B240L,0xF2DF5C7B9436115L,0x5C56E78E8C2B01DL,0xE876B1BDAF06175L,0x3A3C37L},{0x55425ED0AD097D6L,0x8BD112F6881DED5L,0xF6EABAE399CF42AL,0xC3D7E0766E03B6AL,0xA64A742931675B1L,0x1EC7A284D963AB4L,0xF82790948FACB27L,0x136967L},{0xFFAAAAAB0AAAA9FL,0x752CD5556486ABFL,0x572049003424ABFL,0xF14B7214EF10B61L,0xEC4F0AB95E5119FL,0xA825B55D24082CL,0xDCB20A9C8689230L,0x575A53L},{0xFFAAAAAB0AAAA63L,0x752CD5556486ABFL,0x572049003424ABFL,0xF14B7214EF10B61L,0xEC4F0AB95E5119FL,0xA825B55D24082CL,0xDCB20A9C8689230L,0x575A53L},{0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L},{0xFFC71C72071C71CL,0xA37338E39859C7FL,0xE4C030AACD6DC7FL,0x4B87A1634A0B240L,0xF2DF5C7B9436115L,0x5C56E78E8C2B01DL,0xE876B1BDAF06175L,0x3A3C37L},{0xAA684BDA5DA12EDL,0xE95BC25EDC68BEAL,0x60358E1C9A55694L,0x2D73919E810CFF6L,0x460496902CE9BEEL,0xEBBAB8D0F8DCD78L,0xE48A7A07F6DC708L,0x43F0EBL},{0xC6D3C0CA974F017L,0x6D4C1E065F1D631L,0x7D921BDCD9A7F8L,0x6EBB871B506391AL,0xD2C8129DE80C329L,0x4B5299A7EBFE109L,0xE1ECFF8ED16B56BL,0x4A6963L},{0xFFAAAAAB0AAAA99L,0x752CD5556486ABFL,0x572049003424ABFL,0xF14B7214EF10B61L,0xEC4F0AB95E5119FL,0xA825B55D24082CL,0xDCB20A9C8689230L,0x575A53L},{0xFFAAAAAB0AAA9D3L,0x752CD5556486ABFL,0x572049003424ABFL,0xF14B7214EF10B61L,0xEC4F0AB95E5119FL,0xA825B55D24082CL,0xDCB20A9C8689230L,0x575A53L},{0xFFAAAAAB0AAA8FBL,0x752CD5556486ABFL,0x572049003424ABFL,0xF14B7214EF10B61L,0xEC4F0AB95E5119FL,0xA825B55D24082CL,0xDCB20A9C8689230L,0x575A53L}};
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_BLS12461.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_BLS12461.cpp
new file mode 100644
index 0000000..f16bf58
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_BLS12461.cpp
@@ -0,0 +1,79 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "ecp_BLS12461.h"
+
+namespace BLS12461 {
+/* Curve BLS12461 - Pairing friendly BLS curve */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B464_28;
+
+const int CURVE_Cof_I=0;
+const int CURVE_B_I= 9;
+const BIG CURVE_B= {0x9,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Order= {0x1,0x0,0xFFFFC00,0x7FEFFFE,0x110000,0x7FFC800,0x801FC01,0x5FD000E,0x17FE0,0xFFFC018,0xFFFFFF7,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Gx= {0xADEE93D,0x4D026A8,0x74B7411,0xD9C00EE,0x31AC7F2,0xC3981B5,0x9218229,0xD3564DC,0xA096650,0x6F7C292,0x9743616,0xBE922B1,0x12CF668,0xC81327,0x463B73A,0xE74E99B,0xAD0};
+const BIG CURVE_Gy= {0xAD1D465,0xF763157,0xC4FF470,0x17884C8,0xB8D215D,0xA819E66,0xF4959D0,0xE5C3245,0xB84910A,0xB8BFA40,0xBE96EEC,0x8BF9F8C,0xF277ACC,0x5F1C3F2,0x5F68C9,0xCDB14B3,0x77B};
+const BIG CURVE_HTPC= {0x1,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+
+const BIG CURVE_Bnx= {0x0,0xFBFFFE0,0x1FFFFF,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Cof= {0x1,0xFBFFFE0,0x1FFFFF,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+//const BIG CURVE_Cof= {0xAAAAAAB,0xA7FFFEA,0x1556AA,0xD55AAAB,0x554FFFF,0x1555,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+
+
+const BIG CURVE_Pxa= {0x6D0A37C,0x5B50318,0x75DCC46,0xC2E492E,0xD6878A9,0xE01F919,0xF92F564,0x86DB74F,0x66803F0,0x46D581A,0x7ED78D,0x2F97C29,0xC270C89,0xF679453,0x6A50A9A,0x54138A0,0x10CC};
+const BIG CURVE_Pxb= {0x2C1C0AD,0xF85CA8C,0x25CADE9,0x6CD66C4,0xA289609,0xC612951,0xEE2401A,0x529ABEB,0xF65B17D,0xBA09D33,0xD4C5AF5,0x4D4371E,0x46A672E,0xA279D22,0xACEA37C,0x1FB4FE5,0x95C};
+const BIG CURVE_Pya= {0x2FB006,0xCCD0C1B,0xA12A337,0x3D194A4,0xC92C895,0x4960CFC,0x39FC68B,0x3A9B00F,0xED1BA0F,0xA7DBBC5,0xA9CDFD8,0x27CC2F7,0x4E73ED2,0x6070F4F,0xEBA7E67,0xAC848E7,0x226};
+const BIG CURVE_Pyb= {0xDF1457C,0xA506ADF,0x4C20A8,0xD6A31DC,0x36E3FB4,0xEA9A8F1,0x92F5668,0x3C3BE44,0x67A1297,0x74BEABA,0x56A20BE,0x4C42E38,0x45157F0,0x2AB1D00,0xBB402EA,0x101B4FA,0xE38};
+
+#endif
+
+#if CHUNK==64
+
+using namespace B464_60;
+
+const int CURVE_Cof_I=0;
+const int CURVE_B_I= 9;
+const BIG CURVE_B= {0x9L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_Order= {0x1L,0x7FEFFFEFFFFC0L,0xC017FFC80001100L,0x7FE05FD000E801FL,0xFFFF7FFFC018001L,0xFFL,0x0L,0x0L};
+const BIG CURVE_Gx= {0x14D026A8ADEE93DL,0xF2D9C00EE74B741L,0x229C3981B531AC7L,0x6650D3564DC9218L,0x436166F7C292A09L,0x2CF668BE922B197L,0x463B73A0C813271L,0xAD0E74E99BL};
+const BIG CURVE_Gy= {0xF763157AD1D465L,0x5D17884C8C4FF47L,0x9D0A819E66B8D21L,0x910AE5C3245F495L,0x96EECB8BFA40B84L,0x277ACC8BF9F8CBEL,0x5F68C95F1C3F2FL,0x77BCDB14B3L};
+const BIG CURVE_HTPC= {0x1L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+
+const BIG CURVE_Bnx= {0xFFBFFFE00000000L,0x1FFFFL,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_Cof= {0xFFBFFFE00000001L,0x1FFFFL,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+//const BIG CURVE_Cof= {0xAA7FFFEAAAAAAABL,0xFFD55AAAB01556AL,0x1555554FFL,0x0L,0x0L,0x0L,0x0L,0x0L};
+
+
+const BIG CURVE_Pxa= {0x65B503186D0A37CL,0xA9C2E492E75DCC4L,0x564E01F919D6878L,0x3F086DB74FF92FL,0xED78D46D581A668L,0x270C892F97C2907L,0x6A50A9AF679453CL,0x10CC54138A0L};
+const BIG CURVE_Pxb= {0x9F85CA8C2C1C0ADL,0x96CD66C425CADEL,0x1AC612951A2896L,0xB17D529ABEBEE24L,0xC5AF5BA09D33F65L,0x6A672E4D4371ED4L,0xACEA37CA279D224L,0x95C1FB4FE5L};
+const BIG CURVE_Pya= {0x7CCD0C1B02FB006L,0x953D194A4A12A33L,0x68B4960CFCC92C8L,0xBA0F3A9B00F39FCL,0xCDFD8A7DBBC5ED1L,0xE73ED227CC2F7A9L,0xEBA7E676070F4F4L,0x226AC848E7L};
+const BIG CURVE_Pyb= {0x8A506ADFDF1457CL,0xB4D6A31DC04C20AL,0x668EA9A8F136E3FL,0x12973C3BE4492F5L,0xA20BE74BEABA67AL,0x5157F04C42E3856L,0xBB402EA2AB1D004L,0xE38101B4FAL};
+
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_BLS24479.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_BLS24479.cpp
new file mode 100644
index 0000000..dac4cb1
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_BLS24479.cpp
@@ -0,0 +1,90 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "ecp_BLS24479.h"
+
+namespace BLS24479 {
+/* Curve BLS24479 - Pairing friendly BLS curve */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B480_29;
+
+// Base Bits= 29
+
+const int CURVE_Cof_I=0;
+const int CURVE_B_I= 19;
+const BIG CURVE_B= {0x13,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Order= {0x10000001,0xD047FF,0x1FD54464,0x1E3CE067,0xE322DDA,0x1D356F3F,0x7433B44,0x49091F9,0x1729CC2,0x250286C,0x16E62ED,0xB403E1E,0x1001000,0x80,0x0,0x0,0x0};
+const BIG CURVE_Gx= {0xBE3CCD4,0x33B07AF,0x1B67D159,0x3DFC5B5,0xEBA1FCC,0x1A3C1F84,0x56BE204,0xEF8DF1B,0x11AE2D84,0x5FEE546,0x161B3BF9,0x183B20EE,0x1EA5D99B,0x14F0C5BF,0xBE521B7,0x17C682F9,0x1AB2};
+const BIG CURVE_Gy= {0x121E5245,0x65D2E56,0x11577DB1,0x16DACC11,0x14F39746,0x459F694,0x12483FCF,0xC828B04,0xFD63E5A,0x7B1D52,0xAFDE738,0xF349254,0x1A4529FF,0x10E53353,0xF91DEE1,0x16E18D8A,0x47FC};
+const BIG CURVE_HTPC= {0x1,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+
+const BIG CURVE_Bnx= {0x11FF80,0x80010,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Cof= {0x11FF7F,0x80010,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+//const BIG CURVE_Cof= {0x19F415AB,0x1E0FFDFF,0x15AAADFF,0xAA,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+
+const BIG CURVE_Pxaa= {0x14E24678,0x1F149A9B,0x9609022,0x1C186868,0xCDEFC69,0x1C87BB2E,0x14A2235F,0x7586755,0x5896747,0x159BFE92,0x3B5572E,0x1710A521,0x71EB14A,0xC643C33,0x12581DE5,0x1BCA747D,0x959};
+const BIG CURVE_Pxab= {0x1FB099B8,0x3FCF5D7,0x4A91C0E,0xC6EEB40,0x11FC2385,0x11B5AE8D,0x1A9CC3E7,0x194FE144,0x185DB2A5,0x930E1C7,0x14F85F9A,0x1F2ED4E,0x1D1BE5AD,0xF26169C,0xCF7F194,0x1DA1062E,0x3B0D};
+const BIG CURVE_Pxba= {0x11AD15D3,0xD0E6F38,0x17DB85BB,0x30A62F1,0x1EA3E09A,0x17B25FA1,0x1B7959AC,0x1165B19A,0x6C74FDB,0x18F790E1,0x12278FDA,0x1E008F79,0x103F329,0x14619FF1,0x1EBCAA8,0xFF5A9CA,0x3EC2};
+const BIG CURVE_Pxbb= {0x1EE0F480,0x3D5943A,0xF5B12E3,0x128AADC8,0x180E1CB9,0x1EFD916F,0x48BC7F,0x1D5EE1FA,0x5698EF5,0x11D6AED9,0x1386BC6E,0x196E900B,0x1CE2E465,0xC2A8ED3,0x1E67DF99,0x71B7940,0xA5B};
+const BIG CURVE_Pyaa= {0x14781AA0,0xC324C98,0xEDC2AC,0x16C13B46,0x145FC44B,0x12529530,0x1310A8C4,0x1768C5C0,0xE19AE68,0x56E1C1D,0x13DAF93F,0x17E94366,0xF901AD0,0x76800CC,0x10250D8B,0x1E6BAE6D,0x5057};
+const BIG CURVE_Pyab= {0xEAE08FA,0xDDF62BF,0xA97E5AB,0xF0EE97,0x99A42CA,0x1C326578,0xF33DC11,0x8B913F7,0xFEF8552,0x19F35B90,0x58DDBDE,0xFC32FF2,0x1587B5DF,0xB5EB07A,0x1A258DE0,0x1692CC3D,0x2CE2};
+const BIG CURVE_Pyba= {0x5F0CC41,0xB9813B5,0x14C2A87D,0xFF1264A,0x19AF8A14,0x6CE6C3,0x2A7F8A2,0x121DCA7D,0x7D37153,0x19D21078,0x15466DC7,0x1362982B,0x1DD3CB5B,0x1CFC0D1C,0x18C69AF8,0x8CC7DC,0x1807};
+const BIG CURVE_Pybb= {0x115C1CAE,0x78D9732,0x16C26237,0x5A81A6A,0x1C38A777,0x56121FE,0x4DAD9D7,0x1BEBA670,0xA1D72FC,0xD60B274,0x19734258,0x1D621775,0x4691771,0x14206B68,0x17B22DE4,0x29D5B37,0x499D};
+
+
+#endif
+
+#if CHUNK==64
+
+using namespace B480_56;
+
+// Base Bits= 56
+
+const int CURVE_Cof_I=0;
+const int CURVE_B_I= 19;
+const BIG CURVE_B= {0x13L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_Order= {0x1A08FFF0000001L,0x1E7033FF551190L,0x6ADE7EE322DDAFL,0x848FC9D0CED13AL,0x50D81729CC224L,0x1F0F05B98BB44AL,0x10010010005A0L,0x0L,0x0L};
+const BIG CURVE_Gx= {0x6760F5EBE3CCD4L,0xEFE2DAED9F4564L,0x783F08EBA1FCC1L,0xC6F8D95AF88134L,0xDCA8D1AE2D8477L,0x9077586CEFE4BFL,0x8B7FEA5D99BC1DL,0x17CAF9486DE9E1L,0x1AB2BE34L};
+const BIG CURVE_Gy= {0xCBA5CAD21E5245L,0x6D6608C55DF6C4L,0xB3ED294F39746BL,0x145824920FF3C8L,0x63AA4FD63E5A64L,0x492A2BF79CE00FL,0x66A7A4529FF79AL,0x6C53E477B861CAL,0x47FCB70CL};
+const BIG CURVE_HTPC= {0x1L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+
+const BIG CURVE_Bnx= {0x100020011FF80L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_Cof= {0x100020011FF7FL,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+//const BIG CURVE_Cof= {0xC1FFBFF9F415ABL,0x5556AAB7FFL,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+
+const BIG CURVE_Pxaa= {0xE2935374E24678L,0xC34342582408BL,0xF765CCDEFC69EL,0xC33AAD2888D7F9L,0x7FD2458967473AL,0x52908ED55CBAB3L,0x786671EB14AB88L,0xA3EC96077958C8L,0x959DE53L};
+const BIG CURVE_Pxab= {0x7F9EBAFFB099B8L,0x3775A012A47038L,0x6B5D1B1FC23856L,0x7F0A26A730F9E3L,0x1C38F85DB2A5CAL,0x76A753E17E6926L,0x2D39D1BE5AD0F9L,0x31733DFC651E4CL,0x3B0DED08L};
+const BIG CURVE_Pxba= {0xA1CDE711AD15D3L,0x853178DF6E16EDL,0x64BF43EA3E09A1L,0x2D8CD6DE566B2FL,0xF21C26C74FDB8BL,0x47BCC89E3F6B1EL,0x3FE2103F329F00L,0x4E507AF2AA28C3L,0x3EC27FADL};
+const BIG CURVE_Pxbb= {0x7AB2875EE0F480L,0x4556E43D6C4B8CL,0xFB22DF80E1CB99L,0xF70FD0122F1FFDL,0xD5DB25698EF5EAL,0x4805CE1AF1BA3AL,0x1DA7CE2E465CB7L,0xCA0799F7E65855L,0xA5B38DBL};
+const BIG CURVE_Pyaa= {0x86499314781AA0L,0x609DA303B70AB1L,0xA52A6145FC44BBL,0x462E04C42A3124L,0xC383AE19AE68BBL,0xA1B34F6BE4FCADL,0x198F901AD0BF4L,0x736C094362CED0L,0x5057F35DL};
+const BIG CURVE_Pyab= {0xBBEC57EEAE08FAL,0x78774BAA5F96ADL,0x64CAF099A42CA0L,0xC89FBBCCF70478L,0x6B720FEF855245L,0x97F916376F7B3EL,0x60F5587B5DF7E1L,0x61EE89637816BDL,0x2CE2B496L};
+const BIG CURVE_Pyba= {0x730276A5F0CC41L,0xF89325530AA1F5L,0xD9CD879AF8A147L,0xEE53E8A9FE2880L,0x420F07D3715390L,0x4C15D519B71F3AL,0x1A39DD3CB5B9B1L,0x3EE631A6BE39F8L,0x18070466L};
+const BIG CURVE_Pybb= {0xF1B2E6515C1CAEL,0xD40D355B0988DCL,0xC243FDC38A7772L,0x5D338136B675CAL,0x164E8A1D72FCDFL,0xBBAE5CD0961ACL,0xD6D04691771EB1L,0xD9BDEC8B792840L,0x499D14EAL};
+
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_BLS48286.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_BLS48286.cpp
new file mode 100644
index 0000000..b7cff1d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_BLS48286.cpp
@@ -0,0 +1,102 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "ecp_BLS48286.h"
+
+namespace BLS48286 {
+/* Curve BLS48286 - Pairing friendly BLS curve */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B288_29;
+
+// Base Bits= 29
+
+const int CURVE_Cof_I= 62958;
+const BIG CURVE_Cof= {0xF5EE,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const int CURVE_B_I= 10;
+const BIG CURVE_B= {0xA,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Order= {0x1D612C81,0x1E208D97,0x1CA5C07F,0x11E51045,0x1E4FE229,0x13154A7D,0x127B79AC,0x1602A6BF,0x86BC9E,0x0};
+const BIG CURVE_Gx= {0x95D59E0,0x44BF518,0x1BEE8577,0x1B2E8EB9,0xE84D19D,0xA23A0D2,0x103C1301,0x111F68ED,0x13D120DB,0x34B921};
+const BIG CURVE_Gy= {0x10ABEB43,0x177B4FCB,0x38F8BB,0x6F9CD6B,0x1B0AC1F2,0x1846F729,0x1E5E6A8C,0x5AF112F,0xA1E656E,0x101C720};
+const BIG CURVE_HTPC= {0x1,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+
+const BIG CURVE_Bnx= {0xF5EF,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Pxaaa= {0x56106B5,0x20B1A4C,0x113303FA,0x187639D9,0x1D9F51AC,0xA96D657,0x132BADEA,0x1A544F60,0x531C71,0x11567EA};
+const BIG CURVE_Pxaab= {0x96D1A55,0xF668DEC,0xE2476A7,0x4EE30AA,0x1EF56B94,0x5192C97,0x121CF932,0x14B1A4A1,0x196B5C85,0xC6DDCC};
+const BIG CURVE_Pxaba= {0x7D7A35E,0x408D1D3,0x1162980E,0x1F5E9D19,0x12AF41C9,0xCD2835A,0x17875370,0x62F5C57,0x15DE0A7C,0x541496};
+const BIG CURVE_Pxabb= {0x2F023E8,0x14742906,0xCF4B428,0x3236B9E,0x1B62D89F,0x192E7AEF,0x1E4BA079,0x19B17763,0x155FAC94,0x1015F06};
+const BIG CURVE_Pxbaa= {0xF14CB9B,0x5CC6ADC,0x18955362,0x142FAC5F,0x11B96A21,0x18F7B6AA,0x96591F1,0xC5096A4,0x9A1E3F7,0xBA939B};
+const BIG CURVE_Pxbab= {0xB60DD54,0x1FB59436,0x1C68910E,0x10A65726,0x6BE9C0B,0x1C6AA6BF,0x14DD8358,0x1E68D885,0x85E9D59,0x880F52};
+const BIG CURVE_Pxbba= {0x19D776DA,0x1052D855,0x844D7E8,0xCAE4EC2,0x4ADABAA,0x120A2C5F,0x192AB537,0x3F9DEC1,0xE261FE4,0x7B037E};
+const BIG CURVE_Pxbbb= {0x8B50A8E,0x19FF11C1,0x18273AD7,0xEAA9DE4,0x1EC9A57,0x1670C91D,0x300009C,0xACD8A2D,0x6920D19,0xF85987};
+const BIG CURVE_Pyaaa= {0x7E988BE,0x1366AFEB,0x5E2F3B8,0x1FCBDF1D,0x114E8B31,0x1CD92A27,0x1A53FC0,0xAAF8FE7,0xDA962CD,0x10F87C6};
+const BIG CURVE_Pyaab= {0xDF11B92,0x1BC2B368,0x1AF17821,0x6663003,0xDB40CB8,0x20094F8,0x1856186E,0x1528744B,0x1EC6FED7,0x700E0F};
+const BIG CURVE_Pyaba= {0xBFDD06A,0x3E7D33D,0x13F96495,0x179B5611,0x12EB8E64,0xD7054C6,0xD7BFC95,0x145B3D76,0x18C3D6BE,0x9607FD};
+const BIG CURVE_Pyabb= {0x188A47F4,0x19EEFE9B,0x41ACCA2,0x12BF346C,0x11F157D1,0x19429C28,0x14D4ACD2,0x743BB7B,0x55BDFFF,0xAB418F};
+const BIG CURVE_Pybaa= {0x5E39E77,0x1B76DB9A,0x54E3132,0x190321FF,0x5119324,0x123E6F79,0x1064FB7D,0x1D69EBDE,0xAA01884,0x39C720};
+const BIG CURVE_Pybab= {0x164975C6,0x194140A1,0xA2302C0,0x1C495B39,0x613723B,0xB4D86D7,0x1A6F8686,0x7238A06,0x6896E24,0x9B2C3B};
+const BIG CURVE_Pybba= {0x1BF2D7C,0x1E99CD5E,0xEA89102,0xE27DE36,0x13837F1B,0xA2D04CE,0x23E06D8,0x18BDC695,0x175143C9,0xFD8541};
+const BIG CURVE_Pybbb= {0x51130A6,0x154D068F,0x18954F6A,0x173CE106,0x7C687EE,0xD23B3B5,0xB58CC3B,0x1342EEF6,0xDC6AC9E,0xC9F9BC};
+
+
+#endif
+
+#if CHUNK==64
+
+using namespace B288_60;
+
+// Base Bits= 60
+
+const int CURVE_Cof_I= 62958;
+const BIG CURVE_Cof= {0xF5EEL,0x0L,0x0L,0x0L,0x0L};
+const int CURVE_B_I= 10;
+const BIG CURVE_B= {0xAL,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_Order= {0xFC411B2FD612C81L,0x98F28822F29701FL,0xB262A94FBE4FE22L,0x9EB01535FC9EDE6L,0x86BCL};
+const BIG CURVE_Gx= {0xC897EA3095D59E0L,0xDD97475CEFBA15DL,0x544741A4E84D19L,0xDB88FB476C0F04CL,0x6972433D120L};
+const BIG CURVE_Gy= {0xEEF69F970ABEB43L,0x237CE6B580E3E2EL,0x3308DEE53B0AC1FL,0x6E2D78897F979AAL,0x2038E40A1E65L};
+const BIG CURVE_HTPC= {0x1L,0x0L,0x0L,0x0L,0x0L};
+
+const BIG CURVE_Bnx= {0xF5EFL,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_Pxaaa= {0x8416349856106B5L,0xCC3B1CECC4CC0FEL,0xA952DACAFD9F51AL,0x71D2A27B04CAEB7L,0x22ACFD40531CL};
+const BIG CURVE_Pxaab= {0xDECD1BD896D1A55L,0x427718553891DA9L,0xC8A32592FEF56B9L,0x85A58D250C873E4L,0x18DBB9996B5CL};
+const BIG CURVE_Pxaba= {0x8811A3A67D7A35EL,0x9FAF4E8CC58A603L,0xC19A506B52AF41CL,0x7C317AE2BDE1D4DL,0xA8292D5DE0AL};
+const BIG CURVE_Pxabb= {0x28E8520C2F023E8L,0xF191B5CF33D2D0AL,0xE725CF5DFB62D89L,0x94CD8BBB1F92E81L,0x202BE0D55FACL};
+const BIG CURVE_Pxbaa= {0x8B98D5B8F14CB9BL,0x1A17D62FE2554D8L,0xC71EF6D551B96A2L,0xF76284B52259647L,0x17527369A1E3L};
+const BIG CURVE_Pxbab= {0xBF6B286CB60DD54L,0xB8532B9371A2443L,0x638D54D7E6BE9C0L,0x59F346C42D3760DL,0x1101EA485E9DL};
+const BIG CURVE_Pxbba= {0x20A5B0AB9D776DAL,0xA657276121135FAL,0xDE41458BE4ADABAL,0xE41FCEF60E4AAD4L,0xF606FCE261FL};
+const BIG CURVE_Pxbbb= {0xF3FE23828B50A8EL,0x77554EF2609CEB5L,0x72CE1923A1EC9A5L,0x19566C5168C0002L,0x1F0B30E6920DL};
+const BIG CURVE_Pyaaa= {0x26CD5FD67E988BEL,0x1FE5EF8E978BCEEL,0x39B2544F14E8B3L,0xCD557C7F38694FFL,0x21F0F8CDA962L};
+const BIG CURVE_Pyaab= {0x778566D0DF11B92L,0x83331801EBC5E08L,0xB840129F0DB40CBL,0xD7A943A25E15861L,0xE01C1FEC6FEL};
+const BIG CURVE_Pyaba= {0x47CFA67ABFDD06AL,0x4BCDAB08CFE5925L,0x55AE0A98D2EB8E6L,0xBEA2D9EBB35EFF2L,0x12C0FFB8C3D6L};
+const BIG CURVE_Pyabb= {0xB3DDFD3788A47F4L,0x195F9A36106B328L,0x4B28538511F157DL,0xFF3A1DDBDD352B3L,0x156831E55BDFL};
+const BIG CURVE_Pybaa= {0xB6EDB7345E39E77L,0x4C8190FF9538C4CL,0xF647CDEF2511932L,0x84EB4F5EF4193EDL,0x738E40AA018L};
+const BIG CURVE_Pybab= {0x3282814364975C6L,0xBE24AD9CA88C0B0L,0x1969B0DAE613723L,0x24391C50369BE1AL,0x13658766896EL};
+const BIG CURVE_Pybba= {0xBD339ABC1BF2D7CL,0xB713EF1B3AA2440L,0x6145A099D3837F1L,0xC9C5EE34A88F81BL,0x1FB0A8375143L};
+const BIG CURVE_Pybbb= {0xAA9A0D1E51130A6L,0xEB9E708362553DAL,0xEDA47676A7C687EL,0x9E9A1777B2D6330L,0x193F378DC6ACL};
+
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_BLS48556.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_BLS48556.cpp
new file mode 100644
index 0000000..efce0cb
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_BLS48556.cpp
@@ -0,0 +1,107 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "ecp_BLS48556.h"
+
+namespace BLS48556 {
+/* Curve BLS48556 - Pairing friendly BLS curve */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B560_29;
+
+// Base Bits= 29
+
+const int CURVE_Cof_I=0;
+const int CURVE_B_I= 17;
+const BIG CURVE_B= {0x11,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Order= {0x1,0x17FFF800,0xA769C21,0x8AA813C,0x2029C21,0xA68F58B,0xB6307F4,0x1184DA51,0x6DFED78,0x1A3C85E9,0x571037B,0x1637F1F9,0x1C465FB0,0x98354B9,0x118DF17A,0x1422355D,0x43BF73E,0x6,0x0,0x0};
+const BIG CURVE_Gx= {0x5D71D33,0x1943697B,0x18CB783F,0x1B00AA9F,0x1711EE0B,0x7F80B23,0x129FD8CC,0x1345E03F,0x9A80F66,0x7038173,0xC056511,0x142801F5,0x42B2C3A,0x1AF09869,0x7924166,0x8381264,0x957EDD7,0xBACAEDC,0xA27A4A1,0x13};
+const BIG CURVE_Gy= {0xA6ED83A,0x14D2D9FF,0xA29C33D,0x1B8972A9,0x6958677,0x19C8F547,0x1DED7E3E,0x14F9E3DC,0x18FB7229,0x27171C0,0x1551E32D,0xE6184CC,0x6260E3C,0x733D204,0x579C437,0x1534665C,0x2B3349D,0x3162FD7,0xB634253,0x1};
+const BIG CURVE_HTPC= {0x1,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+
+const BIG CURVE_Bnx= {0x1DE40020,0x3,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Cof= {0x1DE4001F,0x3,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+//const BIG CURVE_Cof= {0x1F12ABEB,0x516887B,0x5,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+
+const BIG CURVE_Pxaaa= {0x923CE4A,0x14697474,0xAE04F4A,0x17AE205A,0x1313A20C,0x10B2EC50,0x18DF074F,0x15FE3FE8,0x7C90B98,0x959BF85,0xE57BD37,0x14376C96,0xBF57375,0xE20B625,0x12EE2172,0x1CBBCE85,0x1A5D9487,0xD0E024B,0x195E3602,0x1C};
+const BIG CURVE_Pxaab= {0xC0A1BE1,0x138E6E2D,0x1DF5FDC,0x151FC760,0x33972C5,0x56AA3C2,0x2491D8C,0x115B9FD7,0x140A11FA,0x1873AE35,0x1F259C26,0x74B0647,0x12D18B04,0x4672431,0x1C27F419,0x1CAA4D35,0x18DB48B6,0x13A54BDA,0x5080497,0x5};
+const BIG CURVE_Pxaba= {0x170C5DC4,0x11D39263,0x16B3BCB6,0x152C95BB,0x19BEC736,0x8849A12,0x49AB2A8,0xC7162D3,0xC58CD55,0x15C2659,0x11EE8B90,0xB40CAFC,0xE233167,0x7BEC8BE,0x129335BD,0x151C7DBB,0x78B689B,0x1B6B8EED,0x14BFBE3D,0x16};
+const BIG CURVE_Pxabb= {0x1A64B740,0x6B14B34,0x12481578,0x23FA931,0x323ADD1,0x206B82A,0xD789E1B,0x1FCFA666,0x1F4EEA7,0xF1E39E2,0x1968610,0xAF3EBD3,0x590D3B,0xDA0C35A,0x17306AAF,0xCF9DD2B,0x3F63B1A,0x96FF2F9,0xE102A76,0x12};
+const BIG CURVE_Pxbaa= {0x12F1E01F,0xDD8630B,0x12C29802,0x186239A6,0x19218788,0x4C87D1,0x16AE2501,0x775C076,0x870C80B,0x1A394429,0x1637D478,0x4A420E8,0x1C3AD4D4,0x10E5E713,0x111E6AD5,0x514FCF0,0x7CC49D3,0xC678A2,0x1787BDFD,0x1B};
+const BIG CURVE_Pxbab= {0x637383D,0x1851C11C,0x661F866,0x14404A7F,0x15D3D212,0x9AE28F6,0x8051F25,0x1E1CE2BF,0x137D882F,0xB231CEB,0xA8DB8FC,0x18957645,0x5E54DA8,0x1FF41C44,0x1A297414,0x17E1CBC5,0x1014F91F,0x4282AB7,0xB6CE9E3,0x10};
+const BIG CURVE_Pxbba= {0x1711939C,0xB41ED9E,0x69066BA,0x137CA3AD,0xCF2F6C0,0x5E6DAB9,0x2CE1323,0x946E448,0xF353D1C,0x14D9919F,0x46B7046,0x1A12015,0x3D6070,0x18C3E8D2,0x1F23BA45,0x1F1A337C,0x435A9CC,0x6CA1DF1,0x8A9CE1,0x15};
+const BIG CURVE_Pxbbb= {0x56F4899,0x196A0854,0xA959750,0x38A3D72,0x190BC9BC,0x145752BC,0x1E9E26DA,0x1403F88,0x71895E3,0x14162F5D,0x19FEC5FF,0x14190B16,0x7597C,0x19A3CF18,0x26A4B00,0x113D1BB6,0x7857A32,0xE0B78AB,0x1DD51E0F,0x1B};
+const BIG CURVE_Pyaaa= {0x14137844,0x1704BE7D,0x1FD3CCDD,0x189D8C93,0x1C768851,0xF5C37D5,0xE29C659,0x20AB1C1,0xF8896E0,0x1E08663E,0x1D1D539C,0x117E1C47,0x156CDD39,0x161F1017,0x143E8C72,0x174B22FD,0x18706190,0x49AA47E,0x19BB42E1,0xE};
+const BIG CURVE_Pyaab= {0xDC83190,0x12F19247,0x1AA26424,0x15D55E88,0xC418D32,0xB0E91DD,0x47CBFF7,0x2D992C1,0xDE03C1F,0x7694AE5,0x5C741A2,0x1D423AC6,0x5E02B9E,0x1E903F10,0x4EA6513,0x433A1F1,0x8EFA1C4,0xED54713,0x1E72CE4F,0x4};
+const BIG CURVE_Pyaba= {0x1985C0D,0xEE2FE82,0x64770FA,0x11A809B4,0x1483ACE9,0x18BCD2FA,0x171F32C,0x1612D58D,0x1E658341,0x1CBE2201,0x186E971,0x73F0E1,0xB0A5F40,0xAC90FB0,0x1635E008,0x237498B,0x1F3140D6,0xBF789A9,0x1166F259,0x1A};
+const BIG CURVE_Pyabb= {0x159D42F8,0x1B7F0540,0x45895D7,0x14875FA2,0x1E9E7F2B,0x10139D87,0x10F3FD7D,0x11D3717F,0x69E5006,0xF9BB3C4,0x13C9ED8D,0x16516DA,0x102F51DE,0x2725FEC,0x1F125B66,0xFFC324,0x1ED80731,0x1C16C4D,0x383AAA8,0x14};
+const BIG CURVE_Pybaa= {0x1F38039F,0x6A8959C,0x13C68984,0x11DD12AF,0x58093CF,0x1C8550A0,0xFFA1622,0xFF85979,0x1F2ABB75,0x18862E62,0x1EB6A2C9,0x1EC80B64,0x8EC2F18,0xE7BF713,0xC36B65A,0x19C5DD89,0x18A1D1AB,0xF772C8D,0xC11927C,0x5};
+const BIG CURVE_Pybab= {0x95F7865,0x134F0379,0x1CE9A0E,0x17E0EADD,0x1DACADD7,0x1B18F9F8,0x181D3943,0x186679A,0x2505BB0,0x1FDF1DC8,0x11B36A49,0x11E254E9,0xA438576,0x102B09AE,0x139984F4,0x15BC0233,0x1B6F180E,0x960562B,0x48CA65B,0x6};
+const BIG CURVE_Pybba= {0x7CC1979,0xEC1D4FB,0x1D89E6F0,0x955F38E,0x1635FDA9,0x123D8E10,0x10076209,0x494404A,0xD733D7,0x17678BCF,0x153841F9,0x10696FFD,0x5BC9FE8,0x1A20D8B2,0xE22EC9D,0x18449116,0x108C86C5,0x1B4CD720,0x34967,0x19};
+const BIG CURVE_Pybbb= {0xFC9F25B,0x7E44AB1,0xE9AB5D3,0x589F00D,0x1C9D264F,0xC7478B4,0x16B24A13,0x1D2C146B,0xEF84D9A,0xF47ECDE,0x1BFEE16A,0x1B69071E,0x11AB4C1C,0xBE9D9EF,0x390F005,0x78C8288,0x1B9BF549,0x9320730,0x3D84D97,0x14};
+
+
+#endif
+
+#if CHUNK==64
+
+using namespace B560_58;
+
+// Base Bits= 58
+
+const int CURVE_Cof_I=0;
+const int CURVE_B_I= 17;
+const BIG CURVE_B= {0x11L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_Order= {0x2FFFF0000000001L,0x11550278A769C21L,0x14D1EB162029C21L,0x2309B4A2B6307F4L,0x34790BD26DFED78L,0x2C6FE3F2571037BL,0x1306A973C465FB0L,0x28446ABB18DF17AL,0xC43BF73EL,0x0L};
+const BIG CURVE_Gx= {0x3286D2F65D71D33L,0x3601553F8CB783FL,0xFF01647711EE0BL,0x268BC07F29FD8CCL,0xE0702E69A80F66L,0x285003EAC056511L,0x35E130D242B2C3AL,0x107024C87924166L,0x17595DB8957EDD7L,0x26A27A4A1L};
+const BIG CURVE_Gy= {0x29A5B3FEA6ED83AL,0x3712E552A29C33DL,0x3391EA8E6958677L,0x29F3C7B9DED7E3EL,0x4E2E3818FB7229L,0x1CC30999551E32DL,0xE67A4086260E3CL,0x2A68CCB8579C437L,0x62C5FAE2B3349DL,0x2B634253L};
+const BIG CURVE_HTPC= {0x1L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+
+const BIG CURVE_Bnx= {0x7DE40020L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_Cof= {0x7DE4001FL,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+//const BIG CURVE_Cof= {0xA2D10F7F12ABEBL,0x5L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+
+const BIG CURVE_Pxaaa= {0x28D2E8E8923CE4AL,0x2F5C40B4AE04F4AL,0x2165D8A1313A20CL,0x2BFC7FD18DF074FL,0x12B37F0A7C90B98L,0x286ED92CE57BD37L,0x1C416C4ABF57375L,0x39779D0B2EE2172L,0x1A1C0497A5D9487L,0x3995E3602L};
+const BIG CURVE_Pxaab= {0x271CDC5AC0A1BE1L,0x2A3F8EC01DF5FDCL,0xAD5478433972C5L,0x22B73FAE2491D8CL,0x30E75C6B40A11FAL,0xE960C8FF259C26L,0x8CE48632D18B04L,0x39549A6BC27F419L,0x274A97B58DB48B6L,0xA5080497L};
+const BIG CURVE_Pxaba= {0x23A724C770C5DC4L,0x2A592B776B3BCB6L,0x110934259BEC736L,0x18E2C5A649AB2A8L,0x2B84CB2C58CD55L,0x168195F91EE8B90L,0xF7D917CE233167L,0x2A38FB7729335BDL,0x36D71DDA78B689BL,0x2D4BFBE3DL};
+const BIG CURVE_Pxabb= {0xD629669A64B740L,0x47F52632481578L,0x40D7054323ADD1L,0x3F9F4CCCD789E1BL,0x1E3C73C41F4EEA7L,0x15E7D7A61968610L,0x1B4186B40590D3BL,0x19F3BA577306AAFL,0x12DFE5F23F63B1AL,0x24E102A76L};
+const BIG CURVE_Pxbaa= {0x1BB0C6172F1E01FL,0x30C4734D2C29802L,0x990FA39218788L,0xEEB80ED6AE2501L,0x34728852870C80BL,0x94841D1637D478L,0x21CBCE27C3AD4D4L,0xA29F9E111E6AD5L,0x18CF1447CC49D3L,0x37787BDFDL};
+const BIG CURVE_Pxbab= {0x30A38238637383DL,0x288094FE661F866L,0x135C51ED5D3D212L,0x3C39C57E8051F25L,0x164639D737D882FL,0x312AEC8AA8DB8FCL,0x3FE838885E54DA8L,0x2FC3978BA297414L,0x850556F014F91FL,0x20B6CE9E3L};
+const BIG CURVE_Pxbba= {0x1683DB3D711939CL,0x26F9475A69066BAL,0xBCDB572CF2F6C0L,0x128DC8902CE1323L,0x29B3233EF353D1CL,0x342402A46B7046L,0x3187D1A403D6070L,0x3E3466F9F23BA45L,0xD943BE2435A9CCL,0x2A08A9CE1L};
+const BIG CURVE_Pxbbb= {0x32D410A856F4899L,0x7147AE4A959750L,0x28AEA57990BC9BCL,0x2807F11E9E26DAL,0x282C5EBA71895E3L,0x2832162D9FEC5FFL,0x33479E30007597CL,0x227A376C26A4B00L,0x1C16F1567857A32L,0x37DD51E0FL};
+const BIG CURVE_Pyaaa= {0x2E097CFB4137844L,0x313B1927FD3CCDDL,0x1EB86FABC768851L,0x4156382E29C659L,0x3C10CC7CF8896E0L,0x22FC388FD1D539CL,0x2C3E202F56CDD39L,0x2E9645FB43E8C72L,0x93548FD8706190L,0x1D9BB42E1L};
+const BIG CURVE_Pyaab= {0x25E3248EDC83190L,0x2BAABD11AA26424L,0x161D23BAC418D32L,0x5B3258247CBFF7L,0xED295CADE03C1FL,0x3A84758C5C741A2L,0x3D207E205E02B9EL,0x86743E24EA6513L,0x1DAA8E268EFA1C4L,0x9E72CE4FL};
+const BIG CURVE_Pyaba= {0x1DC5FD041985C0DL,0x2350136864770FAL,0x3179A5F5483ACE9L,0x2C25AB1A171F32CL,0x397C4403E658341L,0xE7E1C2186E971L,0x15921F60B0A5F40L,0x46E9317635E008L,0x17EF1353F3140D6L,0x35166F259L};
+const BIG CURVE_Pyabb= {0x36FE0A8159D42F8L,0x290EBF4445895D7L,0x20273B0FE9E7F2BL,0x23A6E2FF0F3FD7DL,0x1F37678869E5006L,0x2CA2DB53C9ED8DL,0x4E4BFD902F51DEL,0x1FF8649F125B66L,0x382D89BED80731L,0x28383AAA8L};
+const BIG CURVE_Pybaa= {0xD512B39F38039FL,0x23BA255F3C68984L,0x390AA14058093CFL,0x1FF0B2F2FFA1622L,0x310C5CC5F2ABB75L,0x3D9016C9EB6A2C9L,0x1CF7EE268EC2F18L,0x338BBB12C36B65AL,0x1EEE591B8A1D1ABL,0xAC11927CL};
+const BIG CURVE_Pybab= {0x269E06F295F7865L,0x2FC1D5BA1CE9A0EL,0x3631F3F1DACADD7L,0x30CCF3581D3943L,0x3FBE3B902505BB0L,0x23C4A9D31B36A49L,0x2056135CA438576L,0x2B78046739984F4L,0x12C0AC57B6F180EL,0xC48CA65BL};
+const BIG CURVE_Pybba= {0x1D83A9F67CC1979L,0x12ABE71DD89E6F0L,0x247B1C21635FDA9L,0x92880950076209L,0x2ECF179E0D733D7L,0x20D2DFFB53841F9L,0x3441B1645BC9FE8L,0x3089222CE22EC9DL,0x3699AE4108C86C5L,0x320034967L};
+const BIG CURVE_Pybbb= {0xFC89562FC9F25BL,0xB13E01AE9AB5D3L,0x18E8F169C9D264FL,0x3A5828D76B24A13L,0x1E8FD9BCEF84D9AL,0x36D20E3DBFEE16AL,0x17D3B3DF1AB4C1CL,0xF190510390F005L,0x12640E61B9BF549L,0x283D84D97L};
+
+
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_BLS48581.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_BLS48581.cpp
new file mode 100644
index 0000000..77258c0
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_BLS48581.cpp
@@ -0,0 +1,107 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "ecp_BLS48581.h"
+
+namespace BLS48581 {
+/* Curve BLS48581 - Pairing friendly BLS curve */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B584_29;
+
+//*** rom curve parameters *****
+// Base Bits= 29
+// Ate Bits= 33
+// G2 Table size= 36
+
+const int CURVE_Cof_I= 0;
+const BIG CURVE_Cof= {0x382,0xA,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const int CURVE_B_I= 1;
+const BIG CURVE_B= {0x1,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Order= {0xD671C01,0x52FF37E,0x10936846,0x1CB328CF,0x103C4CCB,0x1E682B11,0x5AA171,0x6989924,0x741969D,0xB961737,0xFEB5AF2,0x16797C00,0x1387A3F0,0x6B631A,0x13305857,0xBC46753,0x925E288,0x11C37C5,0x0,0x0,0x0};
+const BIG CURVE_Gx= {0x115AF640,0x1E743991,0x79B630E,0x9B4BA74,0x11786CB7,0x1ED9B458,0x1BAF6F15,0xBB0B246,0x4584766,0x14EFB7CB,0x1154151A,0x1F73EEA8,0xBDBAEDF,0x3467B0D,0x15F83A1A,0xC1BC7E4,0x1F1E93F8,0x1D795B9E,0xB0D03CA,0x55EB36F,0x0};
+const BIG CURVE_Gy= {0x2587A70,0xDDAEF1F,0x49AD5DB,0x6F5DEF7,0x11B2E35F,0x1BE143B6,0x8BD21FD,0xB0987DE,0x1E80F678,0x1CC57729,0xEDEFBFE,0x16E41DEF,0x1279DD41,0x52974C8,0xF27BFAE,0x149114AA,0xD1FB398,0xFC359D1,0x1D94C7E4,0x19DFB489,0x0};
+const BIG CURVE_HTPC= {0x31193EC,0x1C9F85F0,0x1D6090C,0x5112C88,0x10D4620C,0x1F255473,0x1F5583B6,0x4F7AABD,0xCD0706B,0x14B125F7,0xECD8492,0x4D5AF8A,0xC755E26,0x2D4C018,0xB0B7761,0x1369CD4C,0x1FD42938,0x782EC54,0x17716BE5,0x1246919A,0x0};
+
+const BIG CURVE_Bnx= {0x381,0xA,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+
+const BIG CURVE_Pxaaa= {0xCE8BFAB,0x1A7E85A5,0x85537B0,0xF2ECC64,0x1510317B,0x6C0248F,0x140C01,0x140C25E8,0x281A63C,0x168D4621,0x1BFDE6EA,0x1DE2AD88,0x64DB3A2,0xDE65BEF,0x1F1C0D13,0x1BD7577D,0x45A2775,0x11C11BFD,0x9E1C792,0xBAC2BB3,0x0};
+const BIG CURVE_Pxaab= {0x16B47C57,0x134D9B33,0x1E850FC5,0xAAD4035,0x30FFD75,0x1186CBCB,0x13C30F1D,0x1FF4C4A0,0x214A76A,0x15FF6F8B,0xE50E802,0xFE9C38,0xF6DA123,0x111F4A93,0x1B660385,0x1D164576,0x86ABC07,0x9034D87,0x13889614,0xF892E7D,0x0};
+const BIG CURVE_Pxaba= {0x55A3E6A,0x440AB65,0xCFC2D19,0x1E99BDAD,0x1D5FEA8E,0x1EFDDC3C,0x157C0A32,0x1E1A54DA,0xFFAE766,0xDE8C921,0x18058707,0x156B56D0,0x16957CCB,0x1BE53D36,0x1B2A6B88,0x178E7514,0x1853AD83,0x70D9750,0x663C4CD,0x3F998E0,0x0};
+const BIG CURVE_Pxabb= {0x1B7FEAFE,0xD3819E5,0x2F0FC2,0x171969D,0xCA5231,0x292BE10,0x51A30C7,0x16364F37,0xE6EC143,0x11F0E3BB,0x862A57D,0x1F17C198,0x1B92A393,0x1F2C10DB,0x16B18BC,0x17FD1EB3,0x12954D4,0x2E3C6C0,0x973AD86,0x17C44318,0x0};
+const BIG CURVE_Pxbaa= {0x13F8CCE5,0x1CE1D0E2,0x7532EDC,0x16BEE8D9,0x1AA80C65,0xAFE0C44,0x49D3EB5,0x9255CB1,0xC10B2EF,0x40CCEAD,0x6607E79,0xA70CD3,0x1F0E7C58,0x15AB3AF,0x1D742C59,0xC600F8C,0x4CAA9DD,0x1D1E2CC7,0x2CD644,0x717238C,0x0};
+const BIG CURVE_Pxbab= {0xA3C093A,0x10026C8A,0x138CDC3C,0x12C1221F,0xF097FC7,0xF8BBB09,0x175D656A,0x1738162B,0x1EB57B40,0x1AE944CB,0x77D8E0,0x6E8303,0x58677BB,0xBBD1E8D,0xD773BC2,0x111EF71E,0x1E4ECDA0,0x101F8988,0x1FAC1CE1,0x192D8EF2,0x0};
+const BIG CURVE_Pxbba= {0x750E057,0xB03F30,0x170CD539,0x16B61C40,0x2D63334,0x1F219261,0xCAAB472,0xBDF9E68,0x10FD0CAA,0x9D89E76,0x13BC47CA,0x16F4893,0x1908BA2C,0x1C295B6D,0x106CE744,0x1CCC1BD4,0x98908AE,0x1F80CBD2,0x118187B8,0x1736F2A3,0x0};
+const BIG CURVE_Pxbbb= {0x1BC6AE34,0x10CED007,0x5F0FE13,0x15E5F93D,0x1FC44E56,0x1EB575FC,0x116151E6,0x16FC561A,0x164A7190,0x1F94E7F9,0x1E33F2A4,0xE514FF3,0xF741719,0x3DA908E,0xA77BEBD,0x563CBAF,0xC4F4AAA,0x2941312,0xBECAF7B,0x104FAB84,0x0};
+const BIG CURVE_Pyaaa= {0xD2D7971,0x1F6E9FF2,0xB03FCC8,0xA025562,0x6D65904,0x15FBBF75,0x18F05666,0xDB15CA2,0xD90F733,0x17D13BA4,0x24188D6,0x86BF556,0x1B39EBFC,0x12BBF379,0x108E0166,0x4972316,0x16452F30,0xFD24B90,0x1B0DD6D7,0x1D6A66A,0x0};
+const BIG CURVE_Pyaab= {0x16CD5665,0xA38EDC9,0x1FF1EC44,0x16846A4B,0xE2E588,0x1D04BEBB,0x1877484B,0x11255649,0x12C5C3D1,0x121D8F8C,0xBEC25AC,0x65F97E7,0x1D729647,0xF37DD00,0x108AE8C9,0x1B856EB4,0x11815FCA,0xA26D329,0x5E783FC,0x509B8EB,0x0};
+const BIG CURVE_Pyaba= {0xA2A8474,0x1995293,0xEE3F79A,0x18F88DF8,0x52269CB,0x9AEA8D3,0x178BC307,0x194652BC,0x11515536,0xE874820,0x17DF5726,0xE0A288E,0x13A480D3,0x16AD88CE,0x1140C085,0x13DE585F,0x17036766,0x1F210F7D,0x17402148,0x166D4403,0x0};
+const BIG CURVE_Pyabb= {0x841589D,0x1109ED49,0x194CDCC5,0x7B17143,0x5E578FB,0x1ED281F7,0xE84359E,0xEE84EE1,0xDCED281,0x199FD20,0xB226C89,0x245A4E8,0xB0E710E,0x7711EEC,0x1B4CD837,0x563859B,0x1BD47876,0x144111FD,0x1887B701,0x15D84B48,0x0};
+const BIG CURVE_Pybaa= {0x2E50137,0x3C18FCC,0x13DE90FD,0xAFFBBBF,0x1137B088,0x9ACA2E,0x13D67D0C,0x9CA256C,0x8A1E2CA,0x111C66E7,0x16171DFE,0x2530AFD,0x159805F1,0xEC9DAD4,0x11506D0F,0xB44AA9B,0x1A5A8832,0x148B281F,0x88EA711,0x1A413AB4,0x0};
+const BIG CURVE_Pybab= {0xF90BEE4,0x776E2C6,0x1B3CE965,0xB3DB044,0x12B679DA,0xCC6553,0xE78EABF,0xF8301A2,0x1F6824F4,0x6138420,0xA0D083A,0x156EA09F,0x182E2055,0x1915AC4E,0x159BAC59,0x17208435,0x1D5AD537,0x1289E99C,0x115CDADE,0xFA1A06E,0x0};
+const BIG CURVE_Pybba= {0x1EB23986,0xA0FD757,0x6A98ACF,0x110802FB,0x13DCCC9E,0x7D31CFA,0x62D6ED0,0x118E964C,0x122C1FAB,0x11D14327,0x63D096B,0x10334DBF,0x15F14E4C,0xD8320A,0xD93F021,0x1F1400DE,0x1DFDD17A,0x112E1682,0x46F997A,0x112CECF0,0x0};
+const BIG CURVE_Pybbb= {0x132718B6,0x133FFE5B,0x1A71575,0x158CDD08,0x13F748E5,0x6C62559,0x1505CC0,0x7D8E324,0x1E1AD033,0x14E18F4B,0xCE8FE39,0x1D95352A,0x149B6EF8,0x728643A,0x1C501AFA,0x36BC0D1,0x7E84F98,0x9C9D2E0,0x1FE240A7,0x6BC4A49,0x0};
+
+#endif
+
+#if CHUNK==64
+
+using namespace B584_60;
+
+// Base Bits= 60
+// Ate Bits= 33
+// G2 Table size= 36
+
+const int CURVE_Cof_I= 0;
+const BIG CURVE_Cof= {0x140000382L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const int CURVE_B_I= 1;
+const BIG CURVE_B= {0x1L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_Order= {0x8A5FE6FCD671C01L,0xBE599467C24DA11L,0xC7CD0562303C4CCL,0x9D34C4C92016A85L,0xBC972C2E6E74196L,0x3F0B3CBE003FAD6L,0x615C0D6C635387AL,0xE2885E233A9CCC1L,0x2386F8A925L,0x0L};
+const BIG CURVE_Gx= {0xBCE8732315AF640L,0x74DA5D3A1E6D8C3L,0x57DB368B11786CBL,0x665D859236EBDBCL,0x46A9DF6F9645847L,0xEDFFB9F75445505L,0xE86868CF61ABDBAL,0x93F860DE3F257E0L,0x40F2BAF2B73DF1EL,0x2AF59B7AC3L};
+const BIG CURVE_Gy= {0xDBB5DE3E2587A70L,0xF37AEF7B926B576L,0xF77C2876D1B2E35L,0x78584C3EF22F487L,0xFFB98AEE53E80F6L,0xD41B720EF7BB7BEL,0xFEB8A52E991279DL,0xB398A488A553C9EL,0x31F91F86B3A2D1FL,0xCEFDA44F65L};
+const BIG CURVE_HTPC= {0x393F0BE031193ECL,0xC28896440758243L,0xDBE4AA8E70D4620L,0x6B27BD55EFD560EL,0x24A9624BEECD070L,0xE2626AD7C53B361L,0xDD845A98030C755L,0x29389B4E6A62C2DL,0x5AF94F05D8A9FD4L,0x92348CD5DCL};
+const BIG CURVE_Bnx= {0x140000381L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+
+const BIG CURVE_Pxaaa= {0x34FD0B4ACE8BFABL,0xB79766322154DECL,0x4D80491F510317L,0x3CA0612F4005030L,0xBAAD1A8C42281A6L,0x3A2EF156C46FF79L,0x344DBCCB7DE64DBL,0x2775DEBABBEFC70L,0x71E4A38237FA45AL,0x5D615D9A78L};
+const BIG CURVE_Pxaab= {0x669B36676B47C57L,0x5556A01AFA143F1L,0x7630D979630FFD7L,0x6AFFA62504F0C3CL,0xABFEDF16214A7L,0x12307F4E1C3943AL,0xE1623E9526F6DAL,0xBC07E8B22BB6D98L,0x258512069B0E86AL,0x7C4973ECE2L};
+const BIG CURVE_Pxaba= {0x488156CA55A3E6AL,0xEF4CDED6B3F0B46L,0xCBDFBB879D5FEA8L,0x66F0D2A6D55F028L,0xC1DBD19242FFAE7L,0xCCBAB5AB6860161L,0xAE237CA7A6D6957L,0xAD83BC73A8A6CA9L,0xF1334E1B2EA1853L,0x1FCCC70198L};
+const BIG CURVE_Pxabb= {0x9A7033CBB7FEAFEL,0x10B8CB4E80BC3F0L,0x1C5257C200CA523L,0x43B1B279B9468C3L,0x5F63E1C776E6EC1L,0x393F8BE0CC218A9L,0x62F3E5821B7B92AL,0x54D4BFE8F5985ACL,0xEB6185C78D80129L,0xBE2218C25CL};
+const BIG CURVE_Pxbaa= {0x39C3A1C53F8CCE5L,0x5B5F746C9D4CBB7L,0xD55FC1889AA80C6L,0xEF492AE589274FAL,0x9E48199D5AC10B2L,0xC5805386699981FL,0xB1642B5675FF0E7L,0xA9DD63007C675D0L,0x35913A3C598E4CAL,0x38B91C600BL};
+const BIG CURVE_Pxbab= {0x2004D914A3C093AL,0x7960910FCE3370FL,0xA9F177612F097FCL,0x40B9C0B15DD7595L,0x3835D28997EB57BL,0x7BB037418181DF6L,0xEF0977A3D1A5867L,0xCDA088F7B8F35DCL,0x738603F1311E4EL,0xC96C7797EBL};
+const BIG CURVE_Pxbba= {0x41607E60750E057L,0x4B5B0E205C3354EL,0xCBE4324C22D6333L,0xAA5EFCF3432AAD1L,0xF293B13CED0FD0CL,0xA2C0B7A449CEF11L,0x9D13852B6DB908BL,0x8AEE660DEA41B3L,0x61EE3F0197A4989L,0xB9B7951C60L};
+const BIG CURVE_Pxbbb= {0xE19DA00FBC6AE34L,0x6AF2FC9E97C3F84L,0x9BD6AEBF9FC44E5L,0x90B7E2B0D458547L,0xA93F29CFF364A71L,0x719728A7F9F8CFCL,0xFAF47B5211CF741L,0x4AAA2B1E5D7A9DEL,0x2BDEC5282624C4FL,0x827D5C22FBL};
+const BIG CURVE_Pyaaa= {0x3EDD3FE4D2D7971L,0x45012AB12C0FF32L,0x9ABF77EEA6D6590L,0x336D8AE5163C159L,0x35AFA27748D90F7L,0xBFC435FAAB09062L,0x59A577E6F3B39EL,0x2F3024B918B4238L,0x75B5DFA49721645L,0xEB53356C3L};
+const BIG CURVE_Pyaab= {0x1471DB936CD5665L,0x8B423525FFC7B11L,0x2FA097D760E2E58L,0xD1892AB24E1DD21L,0x6B243B1F192C5C3L,0x64732FCBF3AFB09L,0xA325E6FBA01D729L,0x5FCADC2B75A422BL,0xE0FF144DA653181L,0x284DC75979L};
+const BIG CURVE_Pyaba= {0x8332A526A2A8474L,0xBC7C46FC3B8FDE6L,0x1D35D51A652269CL,0x36CA3295E5E2F0CL,0xC99D0E904115155L,0xD370514475F7D5L,0x216D5B119D3A48L,0x67669EF2C2FC503L,0x8523E421EFB703L,0xB36A201DD0L};
+const BIG CURVE_Pyabb= {0x6213DA92841589DL,0xB3D8B8A1E533731L,0x7BDA503EE5E578FL,0x817742770BA10D6L,0x224333FA40DCED2L,0x10E122D2742C89BL,0x60DCEE23DD8B0E7L,0x78762B1C2CDED33L,0xEDC0688223FBBD4L,0xAEC25A4621L};
+const BIG CURVE_Pybaa= {0x47831F982E50137L,0x857FDDDFCF7A43FL,0x30135945D137B08L,0xCA4E512B64F59F4L,0x7FA238CDCE8A1E2L,0x5F1129857ED85C7L,0xB43DD93B5A95980L,0x88325A2554DC541L,0xA9C46916503FA5AL,0xD209D5A223L};
+const BIG CURVE_Pybab= {0x4EEDC58CF90BEE4L,0xA59ED8226CF3A59L,0xFC198CAA72B679DL,0xF47C180D139E3AAL,0xE8C270841F6824L,0x55AB7504FA8342L,0xB16722B589D82E2L,0xD537B90421AD66EL,0x36B7A513D339D5AL,0x7D0D037457L};
+const BIG CURVE_Pybba= {0xD41FAEAFEB23986L,0xE884017D9AA62B3L,0x40FA639F53DCCC9L,0xAB8C74B2618B5BBL,0x5AE3A2864F22C1FL,0xE4C819A6DF98F42L,0xC0841B064155F14L,0xD17AF8A006F364FL,0xE65EA25C2D05DFDL,0x896767811BL};
+const BIG CURVE_Pybbb= {0x667FFCB732718B6L,0x5AC66E84069C55DL,0xD8C4AB33F748EL,0x333EC7192054173L,0x8E69C31E97E1AD0L,0xEF8ECA9A9533A3FL,0x6BE8E50C87549B6L,0x4F981B5E068F140L,0x9029D393A5C07E8L,0x35E2524FF8L};
+
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_BN158.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_BN158.cpp
new file mode 100644
index 0000000..4dd5e9b
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_BN158.cpp
@@ -0,0 +1,82 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "ecp_BN158.h"
+
+namespace BN158 {
+
+/* Curve BN158  */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B160_28;
+
+const int CURVE_Cof_I= 1;
+const BIG CURVE_Cof= {0x1,0x0,0x0,0x0,0x0,0x0};
+const int CURVE_B_I= 5;
+const BIG CURVE_B= {0x5,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Order= {0xF04200D,0xD59F209,0xF73FA14,0x9953CF6,0x27628C,0x24012};
+const BIG CURVE_Gx= {0xB04E012,0x72280A,0xFD3FB95,0x9953CF6,0x27628C,0x24012};
+const BIG CURVE_Gy= {0x2,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_HTPC= {0x1,0x0,0x0,0x0,0x0,0x0};
+
+const BIG CURVE_Bnx= {0x801001,0x400,0x0,0x0,0x0,0x0};
+const BIG CURVE_Pxa= {0x33A5768,0x3B27650,0x3022922,0x1EECE2B,0xF882728,0x1EA35};
+const BIG CURVE_Pxb= {0x776A2F5,0x7B04ACE,0x14F9D68,0x5D05BA3,0x611EB92,0x23485};
+const BIG CURVE_Pya= {0x30CFE24,0x69AB26E,0xF92C435,0x1FB7A85,0xF906B6E,0x1C952};
+const BIG CURVE_Pyb= {0x8E8609D,0x9101773,0xA0F3EE2,0x8445B3B,0x9544ED8,0x23E28};
+const BIG CURVE_W[2]= {{0xA008003,0x3182600,0x600180,0x0,0x0,0x0},{0x1002001,0x800,0x0,0x0,0x0,0x0}};
+const BIG CURVE_SB[2][2]= {{{0xB00A004,0x3182E00,0x600180,0x0,0x0,0x0},{0x1002001,0x800,0x0,0x0,0x0,0x0}},{{0x1002001,0x800,0x0,0x0,0x0,0x0},{0x503A00A,0xA41CC09,0xF13F894,0x9953CF6,0x27628C,0x24012}}};
+const BIG CURVE_WB[4]= {{0x2801000,0x1080600,0x200080,0x0,0x0,0x0},{0x6815005,0xF907C02,0x2519090,0x120264,0x30,0x0},{0x380B003,0x7C84001,0x128C848,0x90132,0x18,0x0},{0x3803001,0x1080E00,0x200080,0x0,0x0,0x0}};
+const BIG CURVE_BB[4][4]= {{{0xE84100D,0xD59EE09,0xF73FA14,0x9953CF6,0x27628C,0x24012},{0xE84100C,0xD59EE09,0xF73FA14,0x9953CF6,0x27628C,0x24012},{0xE84100C,0xD59EE09,0xF73FA14,0x9953CF6,0x27628C,0x24012},{0x1002002,0x800,0x0,0x0,0x0,0x0}},{{0x1002001,0x800,0x0,0x0,0x0,0x0},{0xE84100C,0xD59EE09,0xF73FA14,0x9953CF6,0x27628C,0x24012},{0xE84100D,0xD59EE09,0xF73FA14,0x9953CF6,0x27628C,0x24012},{0xE84100C,0xD59EE09,0xF73FA14,0x9953CF6,0x27628C,0x24012}},{{0x1002002,0x800,0x0,0x0,0x0,0x0},{0x1002001,0x800,0x0,0x0,0x0,0x0},{0x1002001,0x800,0x0,0x0,0x0,0x0},{0x1002001,0x800,0x0,0x0,0x0,0x0}},{{0x801002,0x400,0x0,0x0,0x0,0x0},{0x2004002,0x1000,0x0,0x0,0x0,0x0},{0xE04000A,0xD59EA09,0xF73FA14,0x9953CF6,0x27628C,0x24012},{0x801002,0x400,0x0,0x0,0x0,0x0}}};
+
+#endif
+
+#if CHUNK==64
+
+using namespace B160_56;
+
+const int CURVE_Cof_I= 1;
+const BIG CURVE_Cof= {0x1L,0x0L,0x0L};
+const int CURVE_B_I= 5;
+const BIG CURVE_B= {0x5L,0x0L,0x0L};
+const BIG CURVE_Order= {0xD59F209F04200DL,0x9953CF6F73FA14L,0x24012027628CL};
+const BIG CURVE_Gx= {0x72280AB04E012L,0x9953CF6FD3FB95L,0x24012027628CL};
+const BIG CURVE_Gy= {0x2L,0x0L,0x0L};
+const BIG CURVE_HTPC= {0x1L,0x0L,0x0L};
+
+const BIG CURVE_Bnx= {0x4000801001L,0x0L,0x0L};
+const BIG CURVE_Pxa= {0x3B2765033A5768L,0x1EECE2B3022922L,0x1EA35F882728L};
+const BIG CURVE_Pxb= {0x7B04ACE776A2F5L,0x5D05BA314F9D68L,0x23485611EB92L};
+const BIG CURVE_Pya= {0x69AB26E30CFE24L,0x1FB7A85F92C435L,0x1C952F906B6EL};
+const BIG CURVE_Pyb= {0x91017738E8609DL,0x8445B3BA0F3EE2L,0x23E289544ED8L};
+const BIG CURVE_W[2]= {{0x3182600A008003L,0x600180L,0x0L},{0x8001002001L,0x0L,0x0L}};
+const BIG CURVE_SB[2][2]= {{{0x3182E00B00A004L,0x600180L,0x0L},{0x8001002001L,0x0L,0x0L}},{{0x8001002001L,0x0L,0x0L},{0xA41CC09503A00AL,0x9953CF6F13F894L,0x24012027628CL}}};
+const BIG CURVE_WB[4]= {{0x10806002801000L,0x200080L,0x0L},{0xF907C026815005L,0x1202642519090L,0x30L},{0x7C84001380B003L,0x90132128C848L,0x18L},{0x1080E003803001L,0x200080L,0x0L}};
+const BIG CURVE_BB[4][4]= {{{0xD59EE09E84100DL,0x9953CF6F73FA14L,0x24012027628CL},{0xD59EE09E84100CL,0x9953CF6F73FA14L,0x24012027628CL},{0xD59EE09E84100CL,0x9953CF6F73FA14L,0x24012027628CL},{0x8001002002L,0x0L,0x0L}},{{0x8001002001L,0x0L,0x0L},{0xD59EE09E84100CL,0x9953CF6F73FA14L,0x24012027628CL},{0xD59EE09E84100DL,0x9953CF6F73FA14L,0x24012027628CL},{0xD59EE09E84100CL,0x9953CF6F73FA14L,0x24012027628CL}},{{0x8001002002L,0x0L,0x0L},{0x8001002001L,0x0L,0x0L},{0x8001002001L,0x0L,0x0L},{0x8001002001L,0x0L,0x0L}},{{0x4000801002L,0x0L,0x0L},{0x10002004002L,0x0L,0x0L},{0xD59EA09E04000AL,0x9953CF6F73FA14L,0x24012027628CL},{0x4000801002L,0x0L,0x0L}}};
+
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_BN254.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_BN254.cpp
new file mode 100644
index 0000000..cfdb78d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_BN254.cpp
@@ -0,0 +1,107 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "ecp_BN254.h"
+
+namespace BN254 {
+
+/* Curve BN254 - Pairing friendly BN curve */
+
+/* Nogami's fast curve */
+
+#if CHUNK==16
+
+using namespace B256_13;
+
+const int CURVE_Cof_I=1;
+const int CURVE_B_I= 2;
+const BIG CURVE_B= {0x2,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Order= {0xD,0x0,0x0,0x0,0xA10,0x8,0x0,0x0,0x1F80,0x1FFC,0x1,0x0,0x1800,0x1A26,0x6E8,0x0,0x0,0x412,0x8D9,0x4A};
+const BIG CURVE_Gx= {0x12,0x0,0x0,0x0,0x1A70,0x9,0x0,0x0,0x100,0x309,0x2,0x0,0x1800,0x1A26,0x6E8,0x0,0x0,0x412,0x8D9,0x4A};
+const BIG CURVE_Gy= {0x1,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_HTPC= {0x1,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+
+const BIG CURVE_Bnx= {0x1,0x0,0x0,0x0,0x408,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Cof= {0x1,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+
+const BIG CURVE_Pxa= {0x1B2B,0x1F,0x932,0x1C84,0x191E,0x1F86,0x262,0x1769,0x48B,0x1523,0x1B6D,0x18C3,0x7E8,0x6C6,0x1FAE,0x16C5,0x119E,0x5DA,0x684,0xC};
+const BIG CURVE_Pxb= {0xCF3,0x1EAA,0x1079,0x1869,0x10D8,0x25B,0x18DE,0xD75,0xD74,0x18FA,0xA96,0x1305,0x18C5,0x553,0xCC4,0xF06,0x1A73,0x17CD,0x5AA,0xA};
+const BIG CURVE_Pya= {0xB9A,0xE69,0x1E24,0x1C0,0x119F,0x4DE,0x16F8,0x1CD7,0x1D0A,0x194D,0x88,0x1319,0x966,0x870,0xE6A,0x1268,0xBAF,0x1D03,0x625,0x4};
+const BIG CURVE_Pyb= {0xE9B,0x19D6,0x1B1A,0x1A35,0x18A2,0x4AB,0x1CE7,0x1FFA,0x1006,0x1D84,0x34D,0xBE7,0x56F,0x16A2,0x1A3D,0x2A4,0x1C8B,0x1873,0xECA,0x1D};
+const BIG CURVE_W[2]= {{0x3,0x0,0x0,0x0,0x40,0x1,0x0,0x0,0x180,0x30C,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0x1,0x0,0x0,0x0,0x810,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0}};
+const BIG CURVE_SB[2][2]= {{{0x4,0x0,0x0,0x0,0x850,0x1,0x0,0x0,0x180,0x30C,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0x1,0x0,0x0,0x0,0x810,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0}},{{0x1,0x0,0x0,0x0,0x810,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0xA,0x0,0x0,0x0,0x9D0,0x7,0x0,0x0,0x1E00,0x1CF0,0x1,0x0,0x1800,0x1A26,0x6E8,0x0,0x0,0x412,0x8D9,0x4A}}};
+const BIG CURVE_WB[4]= {{0x0,0x0,0x0,0x0,0x408,0x0,0x0,0x0,0x80,0x104,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0x5,0x0,0x0,0x0,0x14A8,0x2,0x0,0x0,0x700,0xE38,0x0,0x0,0x1800,0x1120,0xC4,0x0,0x0,0x0,0x0,0x0},{0x3,0x0,0x0,0x0,0xC58,0x1,0x0,0x0,0x380,0x71C,0x0,0x0,0xC00,0x890,0x62,0x0,0x0,0x0,0x0,0x0},{0x1,0x0,0x0,0x0,0xC18,0x0,0x0,0x0,0x80,0x104,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0}};
+const BIG CURVE_BB[4][4]= {{{0xD,0x0,0x0,0x0,0x608,0x8,0x0,0x0,0x1F80,0x1FFC,0x1,0x0,0x1800,0x1A26,0x6E8,0x0,0x0,0x412,0x8D9,0x4A},{0xC,0x0,0x0,0x0,0x608,0x8,0x0,0x0,0x1F80,0x1FFC,0x1,0x0,0x1800,0x1A26,0x6E8,0x0,0x0,0x412,0x8D9,0x4A},{0xC,0x0,0x0,0x0,0x608,0x8,0x0,0x0,0x1F80,0x1FFC,0x1,0x0,0x1800,0x1A26,0x6E8,0x0,0x0,0x412,0x8D9,0x4A},{0x2,0x0,0x0,0x0,0x810,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0}},{{0x1,0x0,0x0,0x0,0x810,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0xC,0x0,0x0,0x0,0x608,0x8,0x0,0x0,0x1F80,0x1FFC,0x1,0x0,0x1800,0x1A26,0x6E8,0x0,0x0,0x412,0x8D9,0x4A},{0xD,0x0,0x0,0x0,0x608,0x8,0x0,0x0,0x1F80,0x1FFC,0x1,0x0,0x1800,0x1A26,0x6E8,0x0,0x0,0x412,0x8D9,0x4A},{0xC,0x0,0x0,0x0,0x608,0x8,0x0,0x0,0x1F80,0x1FFC,0x1,0x0,0x1800,0x1A26,0x6E8,0x0,0x0,0x412,0x8D9,0x4A}},{{0x2,0x0,0x0,0x0,0x810,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0x1,0x0,0x0,0x0,0x810,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0x1,0x0,0x0,0x0,0x810,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0x1,0x0,0x0,0x0,0x810,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0}},{{0x2,0x0,0x0,0x0,0x408,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0x2,0x0,0x0,0x0,0x1020,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0xA,0x0,0x0,0x0,0x200,0x8,0x0,0x0,0x1F80,0x1FFC,0x1,0x0,0x1800,0x1A26,0x6E8,0x0,0x0,0x412,0x8D9,0x4A},{0x2,0x0,0x0,0x0,0x408,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0}}};
+
+
+#endif
+
+#if CHUNK==32
+
+using namespace B256_28;
+
+const int CURVE_Cof_I=1;
+const int CURVE_B_I= 2;
+const BIG CURVE_B= {0x2,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Order= {0xD,0x0,0x10A1,0x8000000,0x7FF9F,0x8000000,0x1BA344D,0x4000000,0x5236482,0x2};
+const BIG CURVE_Gx= {0x12,0x0,0x13A7,0x0,0x86121,0x8000000,0x1BA344D,0x4000000,0x5236482,0x2};
+const BIG CURVE_Gy= {0x1,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_HTPC= {0x1,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+
+const BIG CURVE_Bnx= {0x1,0x8000000,0x40,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Cof= {0x1,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+
+const BIG CURVE_Pxa= {0x803FB2B,0xEE4224C,0x8BF0D91,0x8BBB489,0xDB6A464,0x7E8C61E,0xFEB8D8C,0x519EB62,0x61A10BB,0x0};
+const BIG CURVE_Pxb= {0x7D54CF3,0x8C34C1E,0x784B70D,0x746BAE3,0xA5B1F4D,0x8C5982A,0x3310AA7,0xBA73783,0x516AAF9,0x0};
+const BIG CURVE_Pya= {0x1CD2B9A,0xF0E0789,0xE09BD19,0xAE6BDB,0x22329BD,0x96698C8,0x39A90E0,0x6BAF934,0x21897A0,0x0};
+const BIG CURVE_Pyb= {0xB3ACE9B,0x2D1AEC6,0x9C9578A,0x6FFD73,0xD37B090,0x56F5F38,0x68F6D44,0x7C8B152,0xEBB2B0E,0x0};
+const BIG CURVE_W[2]= {{0x3,0x0,0x204,0x8000000,0x6181,0x0,0x0,0x0,0x0,0x0},{0x1,0x0,0x81,0x0,0x0,0x0,0x0,0x0,0x0,0x0}};
+const BIG CURVE_SB[2][2]= {{{0x4,0x0,0x285,0x8000000,0x6181,0x0,0x0,0x0,0x0,0x0},{0x1,0x0,0x81,0x0,0x0,0x0,0x0,0x0,0x0,0x0}},{{0x1,0x0,0x81,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0xA,0x0,0xE9D,0x0,0x79E1E,0x8000000,0x1BA344D,0x4000000,0x5236482,0x2}}};
+const BIG CURVE_WB[4]= {{0x0,0x8000000,0x40,0x8000000,0x2080,0x0,0x0,0x0,0x0,0x0},{0x5,0x8000000,0x54A,0x0,0x1C707,0x8000000,0x312241,0x0,0x0,0x0},{0x3,0x8000000,0x2C5,0x8000000,0xE383,0xC000000,0x189120,0x0,0x0,0x0},{0x1,0x8000000,0xC1,0x8000000,0x2080,0x0,0x0,0x0,0x0,0x0}};
+const BIG CURVE_BB[4][4]= {{{0xD,0x8000000,0x1060,0x8000000,0x7FF9F,0x8000000,0x1BA344D,0x4000000,0x5236482,0x2},{0xC,0x8000000,0x1060,0x8000000,0x7FF9F,0x8000000,0x1BA344D,0x4000000,0x5236482,0x2},{0xC,0x8000000,0x1060,0x8000000,0x7FF9F,0x8000000,0x1BA344D,0x4000000,0x5236482,0x2},{0x2,0x0,0x81,0x0,0x0,0x0,0x0,0x0,0x0,0x0}},{{0x1,0x0,0x81,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0xC,0x8000000,0x1060,0x8000000,0x7FF9F,0x8000000,0x1BA344D,0x4000000,0x5236482,0x2},{0xD,0x8000000,0x1060,0x8000000,0x7FF9F,0x8000000,0x1BA344D,0x4000000,0x5236482,0x2},{0xC,0x8000000,0x1060,0x8000000,0x7FF9F,0x8000000,0x1BA344D,0x4000000,0x5236482,0x2}},{{0x2,0x0,0x81,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0x1,0x0,0x81,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0x1,0x0,0x81,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0x1,0x0,0x81,0x0,0x0,0x0,0x0,0x0,0x0,0x0}},{{0x2,0x8000000,0x40,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0x2,0x0,0x102,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0xA,0x0,0x1020,0x8000000,0x7FF9F,0x8000000,0x1BA344D,0x4000000,0x5236482,0x2},{0x2,0x8000000,0x40,0x0,0x0,0x0,0x0,0x0,0x0,0x0}}};
+#endif
+
+#if CHUNK==64
+
+using namespace B256_56;
+
+const int CURVE_Cof_I=1;
+const int CURVE_B_I= 2;
+const BIG CURVE_B= {0x2L,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_Order= {0xDL,0x800000000010A1L,0x8000000007FF9FL,0x40000001BA344DL,0x25236482L};
+const BIG CURVE_Gx= {0x12L,0x13A7L,0x80000000086121L,0x40000001BA344DL,0x25236482L};
+const BIG CURVE_Gy= {0x1L,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_HTPC= {0x1L,0x0L,0x0L,0x0L,0x0L};
+
+const BIG CURVE_Bnx= {0x80000000000001L,0x40L,0x0L,0x0L,0x0L};
+const BIG CURVE_Cof= {0x1L,0x0L,0x0L,0x0L,0x0L};
+
+const BIG CURVE_Pxa= {0xEE4224C803FB2BL,0x8BBB4898BF0D91L,0x7E8C61EDB6A464L,0x519EB62FEB8D8CL,0x61A10BBL};
+const BIG CURVE_Pxb= {0x8C34C1E7D54CF3L,0x746BAE3784B70DL,0x8C5982AA5B1F4DL,0xBA737833310AA7L,0x516AAF9L};
+const BIG CURVE_Pya= {0xF0E07891CD2B9AL,0xAE6BDBE09BD19L,0x96698C822329BDL,0x6BAF93439A90E0L,0x21897A0L};
+const BIG CURVE_Pyb= {0x2D1AEC6B3ACE9BL,0x6FFD739C9578AL,0x56F5F38D37B090L,0x7C8B15268F6D44L,0xEBB2B0EL};
+const BIG CURVE_W[2]= {{0x3L,0x80000000000204L,0x6181L,0x0L,0x0L},{0x1L,0x81L,0x0L,0x0L,0x0L}};
+const BIG CURVE_SB[2][2]= {{{0x4L,0x80000000000285L,0x6181L,0x0L,0x0L},{0x1L,0x81L,0x0L,0x0L,0x0L}},{{0x1L,0x81L,0x0L,0x0L,0x0L},{0xAL,0xE9DL,0x80000000079E1EL,0x40000001BA344DL,0x25236482L}}};
+const BIG CURVE_WB[4]= {{0x80000000000000L,0x80000000000040L,0x2080L,0x0L,0x0L},{0x80000000000005L,0x54AL,0x8000000001C707L,0x312241L,0x0L},{0x80000000000003L,0x800000000002C5L,0xC000000000E383L,0x189120L,0x0L},{0x80000000000001L,0x800000000000C1L,0x2080L,0x0L,0x0L}};
+const BIG CURVE_BB[4][4]= {{{0x8000000000000DL,0x80000000001060L,0x8000000007FF9FL,0x40000001BA344DL,0x25236482L},{0x8000000000000CL,0x80000000001060L,0x8000000007FF9FL,0x40000001BA344DL,0x25236482L},{0x8000000000000CL,0x80000000001060L,0x8000000007FF9FL,0x40000001BA344DL,0x25236482L},{0x2L,0x81L,0x0L,0x0L,0x0L}},{{0x1L,0x81L,0x0L,0x0L,0x0L},{0x8000000000000CL,0x80000000001060L,0x8000000007FF9FL,0x40000001BA344DL,0x25236482L},{0x8000000000000DL,0x80000000001060L,0x8000000007FF9FL,0x40000001BA344DL,0x25236482L},{0x8000000000000CL,0x80000000001060L,0x8000000007FF9FL,0x40000001BA344DL,0x25236482L}},{{0x2L,0x81L,0x0L,0x0L,0x0L},{0x1L,0x81L,0x0L,0x0L,0x0L},{0x1L,0x81L,0x0L,0x0L,0x0L},{0x1L,0x81L,0x0L,0x0L,0x0L}},{{0x80000000000002L,0x40L,0x0L,0x0L,0x0L},{0x2L,0x102L,0x0L,0x0L,0x0L},{0xAL,0x80000000001020L,0x8000000007FF9FL,0x40000001BA344DL,0x25236482L},{0x80000000000002L,0x40L,0x0L,0x0L,0x0L}}};
+
+
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_BN254CX.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_BN254CX.cpp
new file mode 100644
index 0000000..c24535a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_BN254CX.cpp
@@ -0,0 +1,104 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "ecp_BN254CX.h"
+
+namespace BN254CX {
+
+/* Curve BN254CX - Pairing friendly BN curve */
+
+/* CertiVox BN curve/field  */
+
+
+#if CHUNK==16
+
+using namespace B256_13;
+
+const int CURVE_Cof_I=1;
+const int CURVE_B_I= 2;
+const BIG CURVE_B= {0x2,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Order= {0x1F6D,0x1758,0x98D,0x381,0xBE1,0x367,0x1324,0x1DC1,0x1FD6,0x1621,0x19B4,0x14C6,0x1647,0x1EEF,0x16C2,0x541,0x870,0x0,0x0,0x48};
+const BIG CURVE_Gx= {0x15B2,0xDA,0x1BD7,0xC47,0x1BE6,0x1F70,0x24,0x1DC3,0x1FD6,0x1921,0x19B4,0x14C6,0x1647,0x1EEF,0x16C2,0x541,0x870,0x0,0x0,0x48};
+const BIG CURVE_Gy= {0x1,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_HTPC= {0x1,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+
+const BIG CURVE_Bnx= {0x12B1,0x1E00,0x0,0x0,0x400,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Cof= {0x1,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+
+const BIG CURVE_Pxa= {0xAF5,0x1AFD,0x1B2,0x7D0,0x51C,0x1B14,0xE64,0x1CC3,0xFB8,0x4A2,0x10BC,0x1633,0x73C,0x90E,0x1E9C,0x1369,0x1F9A,0x12DB,0x1256,0x35};
+const BIG CURVE_Pxb= {0x1433,0xAF,0x183F,0xA00,0x1EDE,0x4A6,0xF68,0x1435,0x1A33,0xDD,0xD93,0x103E,0xD16,0x8E1,0x10FC,0xCC0,0x365,0x8,0xF4C,0xA};
+const BIG CURVE_Pya= {0x299,0x1B95,0x1AA5,0x642,0x683,0x427,0x1A8D,0x126D,0x1FF0,0x3CE,0x1019,0x1230,0x1FEF,0x35D,0xBB8,0xDF6,0x109E,0xB85,0x1C9E,0x2A};
+const BIG CURVE_Pyb= {0x8CD,0x24F,0x7E7,0x1782,0x1C41,0x10D6,0x681,0xC12,0x5,0x1699,0x59,0xC0E,0x17F5,0x1DEB,0x1F55,0x313,0x2AC,0xB60,0xF2D,0x23};
+const BIG CURVE_W[2]= {{0xB83,0x117F,0x1245,0x8C6,0x5,0x1C09,0xD00,0x1,0x0,0x300,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0x561,0x1C01,0x1,0x0,0x800,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0}};
+const BIG CURVE_SB[2][2]= {{{0x10E4,0xD80,0x1247,0x8C6,0x805,0x1C09,0xD00,0x1,0x0,0x300,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0x561,0x1C01,0x1,0x0,0x800,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0}},{{0x561,0x1C01,0x1,0x0,0x800,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0x13EA,0x5D9,0x1748,0x1ABA,0xBDB,0x75E,0x623,0x1DC0,0x1FD6,0x1321,0x19B4,0x14C6,0x1647,0x1EEF,0x16C2,0x541,0x870,0x0,0x0,0x48}}};
+const BIG CURVE_WB[4]= {{0x4B0,0x13D4,0x615,0x1842,0x401,0x958,0xF00,0x0,0x0,0x100,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0x475,0x1110,0x56F,0x1BF3,0x36C,0x1FCD,0x329,0x1DB5,0x1E94,0xE03,0xA83,0x10E0,0x0,0x0,0xC0,0x0,0x0,0x0,0x0,0x0},{0xB93,0x788,0x12B8,0xDF9,0x13B6,0x1FE6,0x1194,0xEDA,0x1F4A,0x1701,0x541,0x870,0x0,0x0,0x60,0x0,0x0,0x0,0x0,0x0},{0xA11,0xFD5,0x617,0x1842,0xC01,0x958,0xF00,0x0,0x0,0x100,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0}};
+const BIG CURVE_BB[4][4]= {{{0xCBD,0x1958,0x98C,0x381,0x7E1,0x367,0x1324,0x1DC1,0x1FD6,0x1621,0x19B4,0x14C6,0x1647,0x1EEF,0x16C2,0x541,0x870,0x0,0x0,0x48},{0xCBC,0x1958,0x98C,0x381,0x7E1,0x367,0x1324,0x1DC1,0x1FD6,0x1621,0x19B4,0x14C6,0x1647,0x1EEF,0x16C2,0x541,0x870,0x0,0x0,0x48},{0xCBC,0x1958,0x98C,0x381,0x7E1,0x367,0x1324,0x1DC1,0x1FD6,0x1621,0x19B4,0x14C6,0x1647,0x1EEF,0x16C2,0x541,0x870,0x0,0x0,0x48},{0x562,0x1C01,0x1,0x0,0x800,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0}},{{0x561,0x1C01,0x1,0x0,0x800,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0xCBC,0x1958,0x98C,0x381,0x7E1,0x367,0x1324,0x1DC1,0x1FD6,0x1621,0x19B4,0x14C6,0x1647,0x1EEF,0x16C2,0x541,0x870,0x0,0x0,0x48},{0xCBD,0x1958,0x98C,0x381,0x7E1,0x367,0x1324,0x1DC1,0x1FD6,0x1621,0x19B4,0x14C6,0x1647,0x1EEF,0x16C2,0x541,0x870,0x0,0x0,0x48},{0xCBC,0x1958,0x98C,0x381,0x7E1,0x367,0x1324,0x1DC1,0x1FD6,0x1621,0x19B4,0x14C6,0x1647,0x1EEF,0x16C2,0x541,0x870,0x0,0x0,0x48}},{{0x562,0x1C01,0x1,0x0,0x800,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0x561,0x1C01,0x1,0x0,0x800,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0x561,0x1C01,0x1,0x0,0x800,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0x561,0x1C01,0x1,0x0,0x800,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0}},{{0x12B2,0x1E00,0x0,0x0,0x400,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0xAC2,0x1802,0x3,0x0,0x1000,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0x1A0A,0x1B57,0x98B,0x381,0x3E1,0x367,0x1324,0x1DC1,0x1FD6,0x1621,0x19B4,0x14C6,0x1647,0x1EEF,0x16C2,0x541,0x870,0x0,0x0,0x48},{0x12B2,0x1E00,0x0,0x0,0x400,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0}}};
+#endif
+
+#if CHUNK==32
+
+using namespace B256_28;
+
+const int CURVE_Cof_I=1;
+const int CURVE_B_I= 2;
+const BIG CURVE_B= {0x2,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Order= {0x6EB1F6D,0x11C0A63,0x906CEBE,0xD6EE0CC,0x6D2C43F,0x647A636,0xDB0BDDF,0x8702A0,0x4000000,0x2};
+const BIG CURVE_Gx= {0xC1B55B2,0x6623EF5,0x93EE1BE,0xD6EE180,0x6D3243F,0x647A636,0xDB0BDDF,0x8702A0,0x4000000,0x2};
+const BIG CURVE_Gy= {0x1,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_HTPC= {0x1,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+
+const BIG CURVE_Bnx= {0x3C012B1,0x0,0x40,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Cof= {0x1,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+
+const BIG CURVE_Pxa= {0xB5FAAF5,0xC3E806C,0x9362851,0xB8E61B9,0x2F0944F,0x73CB19C,0xFA7121C,0x7F9A9B4,0xAC95A5B,0x1};
+const BIG CURVE_Pxb= {0xC15F433,0xE50060F,0xA094DED,0x33A1ABD,0x64C1BBA,0xD1681F3,0x43F11C2,0x365660,0x53D3001,0x0};
+const BIG CURVE_Pya= {0x772A299,0x33216A9,0x3484E68,0xF0936EA,0x6479DF,0xFEF9184,0x2EE06BB,0xB09E6FB,0x5727970,0x1};
+const BIG CURVE_Pyb= {0xC49E8CD,0x1BC11F9,0x61ADC4,0x56091A,0x166D320,0x7F56070,0xFD57BD7,0x2AC189,0x1BCB56C,0x1};
+const BIG CURVE_W[2]= {{0x62FEB83,0x5463491,0x381200,0xB4,0x6000,0x0,0x0,0x0,0x0,0x0},{0x7802561,0x0,0x80,0x0,0x0,0x0,0x0,0x0,0x0,0x0}};
+const BIG CURVE_SB[2][2]= {{{0xDB010E4,0x5463491,0x381280,0xB4,0x6000,0x0,0x0,0x0,0x0,0x0},{0x7802561,0x0,0x80,0x0,0x0,0x0,0x0,0x0,0x0,0x0}},{{0x7802561,0x0,0x80,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0xBB33EA,0xBD5D5D2,0x8CEBCBD,0xD6EE018,0x6D2643F,0x647A636,0xDB0BDDF,0x8702A0,0x4000000,0x2}}};
+const BIG CURVE_WB[4]= {{0x67A84B0,0x1C21185,0x12B040,0x3C,0x2000,0x0,0x0,0x0,0x0,0x0},{0xE220475,0xCDF995B,0xA7F9A36,0x94EDA8C,0xA0DC07E,0x8702,0x300000,0x0,0x0,0x0},{0xF10B93,0x66FCCAE,0x53FCD3B,0x4A76D46,0x506E03F,0x4381,0x180000,0x0,0x0,0x0},{0xDFAAA11,0x1C21185,0x12B0C0,0x3C,0x2000,0x0,0x0,0x0,0x0,0x0}};
+const BIG CURVE_BB[4][4]= {{{0x32B0CBD,0x11C0A63,0x906CE7E,0xD6EE0CC,0x6D2C43F,0x647A636,0xDB0BDDF,0x8702A0,0x4000000,0x2},{0x32B0CBC,0x11C0A63,0x906CE7E,0xD6EE0CC,0x6D2C43F,0x647A636,0xDB0BDDF,0x8702A0,0x4000000,0x2},{0x32B0CBC,0x11C0A63,0x906CE7E,0xD6EE0CC,0x6D2C43F,0x647A636,0xDB0BDDF,0x8702A0,0x4000000,0x2},{0x7802562,0x0,0x80,0x0,0x0,0x0,0x0,0x0,0x0,0x0}},{{0x7802561,0x0,0x80,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0x32B0CBC,0x11C0A63,0x906CE7E,0xD6EE0CC,0x6D2C43F,0x647A636,0xDB0BDDF,0x8702A0,0x4000000,0x2},{0x32B0CBD,0x11C0A63,0x906CE7E,0xD6EE0CC,0x6D2C43F,0x647A636,0xDB0BDDF,0x8702A0,0x4000000,0x2},{0x32B0CBC,0x11C0A63,0x906CE7E,0xD6EE0CC,0x6D2C43F,0x647A636,0xDB0BDDF,0x8702A0,0x4000000,0x2}},{{0x7802562,0x0,0x80,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0x7802561,0x0,0x80,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0x7802561,0x0,0x80,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0x7802561,0x0,0x80,0x0,0x0,0x0,0x0,0x0,0x0,0x0}},{{0x3C012B2,0x0,0x40,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0xF004AC2,0x0,0x100,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0xF6AFA0A,0x11C0A62,0x906CE3E,0xD6EE0CC,0x6D2C43F,0x647A636,0xDB0BDDF,0x8702A0,0x4000000,0x2},{0x3C012B2,0x0,0x40,0x0,0x0,0x0,0x0,0x0,0x0,0x0}}};
+#endif
+
+#if CHUNK==64
+
+using namespace B256_56;
+
+const int CURVE_Cof_I=1;
+const int CURVE_B_I= 2;
+const BIG CURVE_B= {0x2L,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_Order= {0x11C0A636EB1F6DL,0xD6EE0CC906CEBEL,0x647A6366D2C43FL,0x8702A0DB0BDDFL,0x24000000L};
+const BIG CURVE_Gx= {0x6623EF5C1B55B2L,0xD6EE18093EE1BEL,0x647A6366D3243FL,0x8702A0DB0BDDFL,0x24000000L};
+const BIG CURVE_Gy= {0x1L,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_HTPC= {0x1L,0x0L,0x0L,0x0L,0x0L};
+
+const BIG CURVE_Bnx= {0x3C012B1L,0x40L,0x0L,0x0L,0x0L};
+const BIG CURVE_Cof= {0x1L,0x0L,0x0L,0x0L,0x0L};
+
+const BIG CURVE_Pxa= {0xC3E806CB5FAAF5L,0xB8E61B99362851L,0x73CB19C2F0944FL,0x7F9A9B4FA7121CL,0x1AC95A5BL};
+const BIG CURVE_Pxb= {0xE50060FC15F433L,0x33A1ABDA094DEDL,0xD1681F364C1BBAL,0x36566043F11C2L,0x53D3001L};
+const BIG CURVE_Pya= {0x33216A9772A299L,0xF0936EA3484E68L,0xFEF918406479DFL,0xB09E6FB2EE06BBL,0x15727970L};
+const BIG CURVE_Pyb= {0x1BC11F9C49E8CDL,0x56091A061ADC4L,0x7F56070166D320L,0x2AC189FD57BD7L,0x11BCB56CL};
+const BIG CURVE_W[2]= {{0x546349162FEB83L,0xB40381200L,0x6000L,0x0L,0x0L},{0x7802561L,0x80L,0x0L,0x0L,0x0L}};
+const BIG CURVE_SB[2][2]= {{{0x5463491DB010E4L,0xB40381280L,0x6000L,0x0L,0x0L},{0x7802561L,0x80L,0x0L,0x0L,0x0L}},{{0x7802561L,0x80L,0x0L,0x0L,0x0L},{0xBD5D5D20BB33EAL,0xD6EE0188CEBCBDL,0x647A6366D2643FL,0x8702A0DB0BDDFL,0x24000000L}}};
+const BIG CURVE_WB[4]= {{0x1C2118567A84B0L,0x3C012B040L,0x2000L,0x0L,0x0L},{0xCDF995BE220475L,0x94EDA8CA7F9A36L,0x8702A0DC07EL,0x300000L,0x0L},{0x66FCCAE0F10B93L,0x4A76D4653FCD3BL,0x4381506E03FL,0x180000L,0x0L},{0x1C21185DFAAA11L,0x3C012B0C0L,0x2000L,0x0L,0x0L}};
+const BIG CURVE_BB[4][4]= {{{0x11C0A6332B0CBDL,0xD6EE0CC906CE7EL,0x647A6366D2C43FL,0x8702A0DB0BDDFL,0x24000000L},{0x11C0A6332B0CBCL,0xD6EE0CC906CE7EL,0x647A6366D2C43FL,0x8702A0DB0BDDFL,0x24000000L},{0x11C0A6332B0CBCL,0xD6EE0CC906CE7EL,0x647A6366D2C43FL,0x8702A0DB0BDDFL,0x24000000L},{0x7802562L,0x80L,0x0L,0x0L,0x0L}},{{0x7802561L,0x80L,0x0L,0x0L,0x0L},{0x11C0A6332B0CBCL,0xD6EE0CC906CE7EL,0x647A6366D2C43FL,0x8702A0DB0BDDFL,0x24000000L},{0x11C0A6332B0CBDL,0xD6EE0CC906CE7EL,0x647A6366D2C43FL,0x8702A0DB0BDDFL,0x24000000L},{0x11C0A6332B0CBCL,0xD6EE0CC906CE7EL,0x647A6366D2C43FL,0x8702A0DB0BDDFL,0x24000000L}},{{0x7802562L,0x80L,0x0L,0x0L,0x0L},{0x7802561L,0x80L,0x0L,0x0L,0x0L},{0x7802561L,0x80L,0x0L,0x0L,0x0L},{0x7802561L,0x80L,0x0L,0x0L,0x0L}},{{0x3C012B2L,0x40L,0x0L,0x0L,0x0L},{0xF004AC2L,0x100L,0x0L,0x0L,0x0L},{0x11C0A62F6AFA0AL,0xD6EE0CC906CE3EL,0x647A6366D2C43FL,0x8702A0DB0BDDFL,0x24000000L},{0x3C012B2L,0x40L,0x0L,0x0L,0x0L}}};
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_BN462.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_BN462.cpp
new file mode 100644
index 0000000..ac358ab
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_BN462.cpp
@@ -0,0 +1,92 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "ecp_BN462.h"
+
+namespace BN462 {
+/* Curve BN462 - Pairing friendly BN curve */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B464_28;
+
+//*** rom curve parameters *****
+// Base Bits= 28
+// Ate Bits= 118
+// G2 Table size= 125
+
+const int CURVE_Cof_I= 1;
+const BIG CURVE_Cof= {0x1,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const int CURVE_B_I= 5;
+const BIG CURVE_B= {0x5,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Order= {0x10800D,0x1B007E,0x24,0xF7C0000,0xC7BF717,0xF6FF66F,0xFFFFFFF,0xC201F7F,0x2908EE1,0xD81,0xA000000,0xB7D9BFC,0x6FF0CF6,0xFFFFFFF,0x23FFF,0x8036012,0x2404};
+const BIG CURVE_Gx= {0x6B6980D,0x98D91F3,0xD70113C,0x372E5C,0xE79239C,0x416A0B1,0xBB4E69A,0x689DB1B,0x3CF4B2E,0xB3EDBEC,0x6F95F63,0xAC9264B,0x30160B9,0xBA34A0A,0x191FAD,0xD67EF25,0x21A6};
+const BIG CURVE_Gy= {0x6FB03DE,0xA5734D3,0x22ECAA8,0xC666006,0xF475432,0xE40EB80,0xDF11B8A,0x6E6AF77,0x5965042,0x7D788C6,0x42CCCFA,0x90EEDA8,0xA7432A4,0x2B33676,0x7F7ABB8,0xEA0460F,0x118};
+const BIG CURVE_HTPC= {0x1,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Bnx= {0xFFFBFFF,0xFFFFFFF,0xFFFFFFF,0x1FFFF,0x4,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+
+const BIG CURVE_Pxa= {0xAE1E4DF,0x8E3D934,0x769546,0x6A8B488,0xAE1F0AA,0x92E0032,0x2699BAD,0x208F9AD,0x3820408,0xED61C91,0x7C1CD96,0x2E0337E,0xCBDC548,0xB38E3A8,0x8DDA0DF,0xCCC85B5,0x257};
+const BIG CURVE_Pxb= {0xA8CD283,0x108BA6A,0x50E9B73,0x59BF7E8,0xF50AF8B,0xB783718,0x6BAE555,0x8134DD8,0x84058B1,0xED91768,0x54730CB,0xC98E2A3,0x9566BA3,0x8EDCA84,0x99102AF,0x4343E85,0x1D2E};
+const BIG CURVE_Pya= {0xDB7154E,0x5B68DF0,0x7C3376E,0xE7B11D,0x3695A14,0xDAE32E0,0x1F41C9D,0xF1399A,0xB42FE81,0x3FA7A6B,0x706E23C,0xA035634,0x20809EC,0x517427A,0x22C1979,0x50439DA,0xA06};
+const BIG CURVE_Pyb= {0xCA2A93A,0x14CC552,0x93B9EBA,0xD537434,0x387AA68,0xA04EF87,0x7692444,0x725CC64,0xAB370FD,0x7B393F1,0xC69AC5,0x44D5E6B,0x306324D,0x2C8AE37,0x8CBE017,0xF0CBD43,0x73E};
+const BIG CURVE_W[2]= {{0x20003,0x6,0x0,0xFF00000,0xFF3FF7F,0xFFFFFFF,0xFFFFFFF,0x60017F,0x60,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0xFFF7FFF,0xFFFFFFF,0xFFFFFFF,0x3FFFF,0x8,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0}};
+const BIG CURVE_SB[2][2]= {{{0x28004,0x6,0x0,0xFEC0000,0xFF3FF77,0xFFFFFFF,0xFFFFFFF,0x60017F,0x60,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0x11000E,0x1B007E,0x24,0xF780000,0xC7BF70F,0xF6FF66F,0xFFFFFFF,0xC201F7F,0x2908EE1,0xD81,0xA000000,0xB7D9BFC,0x6FF0CF6,0xFFFFFFF,0x23FFF,0x8036012,0x2404}},{{0xFFF7FFF,0xFFFFFFF,0xFFFFFFF,0x3FFFF,0x8,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0x20003,0x6,0x0,0xFF00000,0xFF3FF7F,0xFFFFFFF,0xFFFFFFF,0x60017F,0x60,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0}}};
+const BIG CURVE_WB[4]= {{0x4000,0x2,0x0,0xFFE0000,0xFFBFFDB,0xFFFFFFF,0xFFFFFFF,0x20007F,0x20,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0xFFABFFB,0xFFCFFE3,0xFFFFFFF,0x29FFFF,0x800214,0x90,0x0,0xBFFF900,0xF6FF53F,0xFFFFFFF,0x5FFFFFF,0x4802400,0x300,0x0,0x0,0x0,0x0},{0xFFD3FFD,0xFFE7FF1,0xFFFFFFF,0x15FFFF,0x40010C,0x48,0x0,0xDFFFC80,0xFB7FA9F,0xFFFFFFF,0x2FFFFFF,0x2401200,0x180,0x0,0x0,0x0,0x0},{0xC001,0x2,0x0,0xFFA0000,0xFFBFFD3,0xFFFFFFF,0xFFFFFFF,0x20007F,0x20,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0}};
+const BIG CURVE_BB[4][4]= {{{0xFFFC000,0xFFFFFFF,0xFFFFFFF,0x1FFFF,0x4,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0xFFFBFFF,0xFFFFFFF,0xFFFFFFF,0x1FFFF,0x4,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0xFFFBFFF,0xFFFFFFF,0xFFFFFFF,0x1FFFF,0x4,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0x11000F,0x1B007E,0x24,0xF780000,0xC7BF70F,0xF6FF66F,0xFFFFFFF,0xC201F7F,0x2908EE1,0xD81,0xA000000,0xB7D9BFC,0x6FF0CF6,0xFFFFFFF,0x23FFF,0x8036012,0x2404}},{{0xFFF7FFF,0xFFFFFFF,0xFFFFFFF,0x3FFFF,0x8,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0x10C00E,0x1B007E,0x24,0xF7A0000,0xC7BF713,0xF6FF66F,0xFFFFFFF,0xC201F7F,0x2908EE1,0xD81,0xA000000,0xB7D9BFC,0x6FF0CF6,0xFFFFFFF,0x23FFF,0x8036012,0x2404},{0x10C00D,0x1B007E,0x24,0xF7A0000,0xC7BF713,0xF6FF66F,0xFFFFFFF,0xC201F7F,0x2908EE1,0xD81,0xA000000,0xB7D9BFC,0x6FF0CF6,0xFFFFFFF,0x23FFF,0x8036012,0x2404},{0x10C00E,0x1B007E,0x24,0xF7A0000,0xC7BF713,0xF6FF66F,0xFFFFFFF,0xC201F7F,0x2908EE1,0xD81,0xA000000,0xB7D9BFC,0x6FF0CF6,0xFFFFFFF,0x23FFF,0x8036012,0x2404}},{{0xFFF7FFE,0xFFFFFFF,0xFFFFFFF,0x3FFFF,0x8,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0xFFF7FFF,0xFFFFFFF,0xFFFFFFF,0x3FFFF,0x8,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0xFFF7FFF,0xFFFFFFF,0xFFFFFFF,0x3FFFF,0x8,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0xFFF7FFF,0xFFFFFFF,0xFFFFFFF,0x3FFFF,0x8,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0}},{{0x10C00F,0x1B007E,0x24,0xF7A0000,0xC7BF713,0xF6FF66F,0xFFFFFFF,0xC201F7F,0x2908EE1,0xD81,0xA000000,0xB7D9BFC,0x6FF0CF6,0xFFFFFFF,0x23FFF,0x8036012,0x2404},{0x11800F,0x1B007E,0x24,0xF740000,0xC7BF707,0xF6FF66F,0xFFFFFFF,0xC201F7F,0x2908EE1,0xD81,0xA000000,0xB7D9BFC,0x6FF0CF6,0xFFFFFFF,0x23FFF,0x8036012,0x2404},{0xFFF7FFD,0xFFFFFFF,0xFFFFFFF,0x3FFFF,0x8,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0x10C00F,0x1B007E,0x24,0xF7A0000,0xC7BF713,0xF6FF66F,0xFFFFFFF,0xC201F7F,0x2908EE1,0xD81,0xA000000,0xB7D9BFC,0x6FF0CF6,0xFFFFFFF,0x23FFF,0x8036012,0x2404}}};
+
+#endif
+
+#if CHUNK==64
+
+using namespace B464_60;
+
+//*** rom curve parameters *****
+// Base Bits= 60
+// Ate Bits= 118
+// G2 Table size= 125
+
+const int CURVE_Cof_I= 1;
+const BIG CURVE_Cof= {0x1L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const int CURVE_B_I= 5;
+const BIG CURVE_B= {0x5L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_Order= {0x401B007E010800DL,0x17F7C0000000002L,0xFFFF6FF66FC7BF7L,0x8EE1C201F7FFFFFL,0xD81290L,0xFF0CF6B7D9BFCA0L,0x23FFFFFFFFFF6L,0x24048036012L};
+const BIG CURVE_Gx= {0xC98D91F36B6980DL,0x9C0372E5CD70113L,0x69A416A0B1E7923L,0x4B2E689DB1BBB4EL,0x95F63B3EDBEC3CFL,0x160B9AC9264B6FL,0x191FADBA34A0A3L,0x21A6D67EF25L};
+const BIG CURVE_Gy= {0x8A5734D36FB03DEL,0x32C66600622ECAAL,0xB8AE40EB80F4754L,0x50426E6AF77DF11L,0xCCCFA7D788C6596L,0x7432A490EEDA842L,0x7F7ABB82B33676AL,0x118EA0460FL};
+const BIG CURVE_HTPC= {0x1L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+
+const BIG CURVE_Bnx= {0xFFFFFFFFFFFBFFFL,0x4001FFFFFFFFFFL,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_Cru= {0x401F80A801A401AL,0xDBF2E0000000002L,0xFFFF6FF597BBBF3L,0x9F0222029FFFFFFL,0xD81368L,0xFF08764BD65FC10L,0x23FFFFFFFFFF6L,0x24048036012L};
+const BIG CURVE_Pxa= {0x68E3D934AE1E4DFL,0xAA6A8B488076954L,0xBAD92E0032AE1F0L,0x408208F9AD2699L,0x1CD96ED61C91382L,0xBDC5482E0337E7CL,0x8DDA0DFB38E3A8CL,0x257CCC85B5L};
+const BIG CURVE_Pxb= {0x3108BA6AA8CD283L,0x8B59BF7E850E9B7L,0x555B783718F50AFL,0x58B18134DD86BAEL,0x730CBED91768840L,0x566BA3C98E2A354L,0x99102AF8EDCA849L,0x1D2E4343E85L};
+const BIG CURVE_Pya= {0xE5B68DF0DB7154EL,0x140E7B11D7C3376L,0xC9DDAE32E03695AL,0xFE810F1399A1F41L,0x6E23C3FA7A6BB42L,0x809ECA03563470L,0x22C1979517427A2L,0xA0650439DAL};
+const BIG CURVE_Pyb= {0xA14CC552CA2A93AL,0x68D53743493B9EBL,0x444A04EF87387AAL,0x70FD725CC647692L,0x69AC57B393F1AB3L,0x6324D44D5E6B0CL,0x8CBE0172C8AE373L,0x73EF0CBD43L};
+const BIG CURVE_W[2]= {{0x60020003L,0x7FFF00000000000L,0xFFFFFFFFFFFF3FFL,0x60060017FFFFFL,0x0L,0x0L,0x0L,0x0L},{0xFFFFFFFFFFF7FFFL,0x8003FFFFFFFFFFL,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L}};
+const BIG CURVE_SB[2][2]= {{{0x60028004L,0x77FEC0000000000L,0xFFFFFFFFFFFF3FFL,0x60060017FFFFFL,0x0L,0x0L,0x0L,0x0L},{0x401B007E011000EL,0xFF780000000002L,0xFFFF6FF66FC7BF7L,0x8EE1C201F7FFFFFL,0xD81290L,0xFF0CF6B7D9BFCA0L,0x23FFFFFFFFFF6L,0x24048036012L}},{{0xFFFFFFFFFFF7FFFL,0x8003FFFFFFFFFFL,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L},{0x60020003L,0x7FFF00000000000L,0xFFFFFFFFFFFF3FFL,0x60060017FFFFFL,0x0L,0x0L,0x0L,0x0L}}};
+const BIG CURVE_WB[4]= {{0x20004000L,0xDBFFE0000000000L,0xFFFFFFFFFFFFBFFL,0x20020007FFFFFL,0x0L,0x0L,0x0L,0x0L},{0xFFFCFFE3FFABFFBL,0x14029FFFFFFFFFFL,0x9008002L,0xF53FBFFF9000000L,0xFFFFFFFFFFFFF6FL,0x30048024005FL,0x0L,0x0L},{0xFFFE7FF1FFD3FFDL,0xC015FFFFFFFFFFL,0x4804001L,0xFA9FDFFFC800000L,0xFFFFFFFFFFFFFB7L,0x18024012002FL,0x0L,0x0L},{0x2000C001L,0xD3FFA0000000000L,0xFFFFFFFFFFFFBFFL,0x20020007FFFFFL,0x0L,0x0L,0x0L,0x0L}};
+const BIG CURVE_BB[4][4]= {{{0xFFFFFFFFFFFC000L,0x4001FFFFFFFFFFL,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L},{0xFFFFFFFFFFFBFFFL,0x4001FFFFFFFFFFL,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L},{0xFFFFFFFFFFFBFFFL,0x4001FFFFFFFFFFL,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L},{0x401B007E011000FL,0xFF780000000002L,0xFFFF6FF66FC7BF7L,0x8EE1C201F7FFFFFL,0xD81290L,0xFF0CF6B7D9BFCA0L,0x23FFFFFFFFFF6L,0x24048036012L}},{{0xFFFFFFFFFFF7FFFL,0x8003FFFFFFFFFFL,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L},{0x401B007E010C00EL,0x13F7A0000000002L,0xFFFF6FF66FC7BF7L,0x8EE1C201F7FFFFFL,0xD81290L,0xFF0CF6B7D9BFCA0L,0x23FFFFFFFFFF6L,0x24048036012L},{0x401B007E010C00DL,0x13F7A0000000002L,0xFFFF6FF66FC7BF7L,0x8EE1C201F7FFFFFL,0xD81290L,0xFF0CF6B7D9BFCA0L,0x23FFFFFFFFFF6L,0x24048036012L},{0x401B007E010C00EL,0x13F7A0000000002L,0xFFFF6FF66FC7BF7L,0x8EE1C201F7FFFFFL,0xD81290L,0xFF0CF6B7D9BFCA0L,0x23FFFFFFFFFF6L,0x24048036012L}},{{0xFFFFFFFFFFF7FFEL,0x8003FFFFFFFFFFL,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L},{0xFFFFFFFFFFF7FFFL,0x8003FFFFFFFFFFL,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L},{0xFFFFFFFFFFF7FFFL,0x8003FFFFFFFFFFL,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L},{0xFFFFFFFFFFF7FFFL,0x8003FFFFFFFFFFL,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L}},{{0x401B007E010C00FL,0x13F7A0000000002L,0xFFFF6FF66FC7BF7L,0x8EE1C201F7FFFFFL,0xD81290L,0xFF0CF6B7D9BFCA0L,0x23FFFFFFFFFF6L,0x24048036012L},{0x401B007E011800FL,0x7F740000000002L,0xFFFF6FF66FC7BF7L,0x8EE1C201F7FFFFFL,0xD81290L,0xFF0CF6B7D9BFCA0L,0x23FFFFFFFFFF6L,0x24048036012L},{0xFFFFFFFFFFF7FFDL,0x8003FFFFFFFFFFL,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L},{0x401B007E010C00FL,0x13F7A0000000002L,0xFFFF6FF66FC7BF7L,0x8EE1C201F7FFFFFL,0xD81290L,0xFF0CF6B7D9BFCA0L,0x23FFFFFFFFFF6L,0x24048036012L}}};
+
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_BRAINPOOL.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_BRAINPOOL.cpp
new file mode 100644
index 0000000..93b5380
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_BRAINPOOL.cpp
@@ -0,0 +1,61 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "ecp_BRAINPOOL.h"
+
+namespace BRAINPOOL {
+
+/* Brainpool Curve  */
+/* Note that the original curve has been transformed to an isomorphic curve with A=-3 */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B256_28;
+
+const int CURVE_Cof_I=1;
+const BIG CURVE_Cof= {0x1,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const int CURVE_B_I= 0;
+const BIG CURVE_B= {0xEE92B04,0xE58101F,0xF49256A,0xEBC4AF2,0x6B7BF93,0x733D0B7,0x4FE66A7,0x30D84EA,0x62C61C4,0x6};
+const BIG CURVE_Order= {0x74856A7,0x1E0E829,0x1A6F790,0x7AA3B56,0xD718C39,0x909D838,0xC3E660A,0xA1EEA9B,0x9FB57DB,0xA};
+const BIG CURVE_Gx= {0xE1305F4,0xA191562,0xFBC2B79,0x42C47AA,0x149AFA1,0xB23A656,0x7732213,0xC1CFE7B,0x3E8EB3C,0xA};
+const BIG CURVE_Gy= {0xB25C9BE,0xABE8F35,0x27001D,0xB6DE39D,0x17E69BC,0xE146444,0xD7F7B22,0x3439C56,0xD996C82,0x2};
+const BIG CURVE_HTPC= {0x3BC7B16,0xBC14BB0,0xAE888EB,0x30D22DE,0xD959247,0xDF0183F,0x1737593,0xF0C052E,0x665C79C,0x6};
+#endif
+
+#if CHUNK==64
+
+using namespace B256_56;
+
+const int CURVE_Cof_I=1;
+const BIG CURVE_Cof= {0x1L,0x0L,0x0L,0x0L,0x0L};
+const int CURVE_B_I= 0;
+const BIG CURVE_B= {0xE58101FEE92B04L,0xEBC4AF2F49256AL,0x733D0B76B7BF93L,0x30D84EA4FE66A7L,0x662C61C4L};
+const BIG CURVE_Order= {0x1E0E82974856A7L,0x7AA3B561A6F790L,0x909D838D718C39L,0xA1EEA9BC3E660AL,0xA9FB57DBL};
+const BIG CURVE_Gx= {0xA191562E1305F4L,0x42C47AAFBC2B79L,0xB23A656149AFA1L,0xC1CFE7B7732213L,0xA3E8EB3CL};
+const BIG CURVE_Gy= {0xABE8F35B25C9BEL,0xB6DE39D027001DL,0xE14644417E69BCL,0x3439C56D7F7B22L,0x2D996C82L};
+const BIG CURVE_HTPC= {0xBC14BB03BC7B16L,0x30D22DEAE888EBL,0xDF0183FD959247L,0xF0C052E1737593L,0x6665C79CL};
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_C1174.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_C1174.cpp
new file mode 100644
index 0000000..072be5e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_C1174.cpp
@@ -0,0 +1,60 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "ecp_C1174.h"
+
+namespace C1174 {
+
+/* Curve C1174 */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B256_29;
+
+const int CURVE_Cof_I= 4;
+const BIG CURVE_Cof= {0x4,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const int CURVE_B_I= -1174;
+const BIG CURVE_B= {0x1FFFFB61,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x7FFFF};
+const BIG CURVE_Order= {0x1166C971,0xA26A2FE,0x14C1CD22,0x12CB89BF,0x1FFFFF77,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFF};
+const BIG CURVE_Gx= {0x1CE29EDA,0x1091F93D,0xBB35945,0x3B2D492,0x1A190C02,0x1773E014,0x111E4D0E,0x19D4611,0x37FBB};
+const BIG CURVE_Gy= {0x1B46360E,0x6658DFC,0xFE5DAE9,0x5BDC55E,0xE0C4FE,0x208B4C2,0x1F31995A,0x105A8FF6,0x6B72F};
+const BIG CURVE_HTPC= {0x1FFFFFF6,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x7FFFF};
+#endif
+
+#if CHUNK==64
+
+using namespace B256_56;
+
+const int CURVE_Cof_I= 4;
+const BIG CURVE_Cof= {0x4L,0x0L,0x0L,0x0L,0x0L};
+const int CURVE_B_I= -1174;
+const BIG CURVE_B= {0xFFFFFFFFFFFB61L,0xFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFL,0x7FFFFFFL};
+const BIG CURVE_Order= {0x44D45FD166C971L,0x65C4DFD3073489L,0xFFFFFFFFFFF779L,0xFFFFFFFFFFFFFFL,0x1FFFFFFL};
+const BIG CURVE_Gx= {0x123F27BCE29EDAL,0xD96A492ECD6516L,0xE7C029A190C021L,0xEA308C479343AEL,0x37FBB0CL};
+const BIG CURVE_Gy= {0xCCB1BF9B46360EL,0xDEE2AF3F976BA4L,0x1169840E0C4FE2L,0xD47FB7CC665684L,0x6B72F82L};
+const BIG CURVE_HTPC= {0xFFFFFFFFFFFFF6L,0xFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFL,0x7FFFFFFL};
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_C13318.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_C13318.cpp
new file mode 100644
index 0000000..a7ca2a5
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_C13318.cpp
@@ -0,0 +1,60 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "ecp_C13318.h"
+
+namespace C13318 {
+
+/* C13318 */
+
+#if CHUNK==16
+/* C13318 Curve */
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B256_29;
+
+const int CURVE_Cof_I= 1;
+const BIG CURVE_Cof= {0x1,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const int CURVE_B_I= 13318;
+const BIG CURVE_B= {0x3406,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Order= {0xDC2CBE3,0x1BE896E2,0x1AE345BA,0xCA9F07B,0xF4F,0x0,0x0,0x0,0x800000};
+const BIG CURVE_Gx= {0x5,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Gy= {0xB6EAD0B,0x6469AA3,0x5B6D6E,0x1996099E,0x166369D4,0x18728B34,0x1BC4E058,0x1B24D794,0x6675AA};
+const BIG CURVE_HTPC= {0x507504F,0x13B86C9D,0x5FC8F18,0x31806AD,0x1EBD397A,0x264F7E,0x1E16569A,0x804FC1D,0x55C192};
+#endif
+
+#if CHUNK==64
+
+using namespace B256_56;
+
+const int CURVE_Cof_I= 1;
+const BIG CURVE_Cof= {0x1L,0x0L,0x0L,0x0L,0x0L};
+const int CURVE_B_I= 13318;
+const BIG CURVE_B= {0x3406L,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_Order= {0x7D12DC4DC2CBE3L,0x54F83DEB8D16EBL,0xF4F6L,0x0L,0x80000000L};
+const BIG CURVE_Gx= {0x5L,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_Gy= {0xC8D3546B6EAD0BL,0xCB04CF016DB5B8L,0xE5166966369D4CL,0x26BCA6F1381630L,0x6675AAD9L};
+const BIG CURVE_HTPC= {0x770D93A507504FL,0x8C035697F23C62L,0x4C9EFDEBD397A1L,0x27E0EF8595A680L,0x55C19240L};
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_C1665.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_C1665.cpp
new file mode 100644
index 0000000..c7f513e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_C1665.cpp
@@ -0,0 +1,60 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "ecp_C1665.h"
+
+namespace C1665 {
+
+/* Curve C1665 */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B168_29;
+
+const int CURVE_Cof_I= 4;
+const BIG CURVE_Cof= {0x4,0x0,0x0,0x0,0x0,0x0};
+const int CURVE_B_I= 5766;
+const BIG CURVE_B= {0x1686,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Order= {0x1DBA8B27,0x7F854C,0x1F57BC06,0x1FFFFFFF,0x1FFFFFFF,0x7FFFF};
+const BIG CURVE_Gx= {0x19D52398,0x138DCEDF,0x183D99B1,0x1340C31D,0x1A505B80,0xA64A6};
+const BIG CURVE_Gy= {0x4920345,0x3843D92,0x758B70B,0x77F8EE7,0x149BC0A1,0x14A0A2};
+const BIG CURVE_HTPC= {0x1,0x0,0x0,0x0,0x0,0x0};
+#endif
+
+#if CHUNK==64
+
+using namespace B168_60;
+
+const int CURVE_Cof_I= 4;
+const BIG CURVE_Cof= {0x4L,0x0L,0x0L};
+const int CURVE_B_I= 5766;
+const BIG CURVE_B= {0x1686L,0x0L,0x0L};
+const BIG CURVE_Order= {0x80FF0A99DBA8B27L,0xFFFFFFFFFD5EF01L,0xFFFFFFFFFFFL};
+const BIG CURVE_Gx= {0x671B9DBF9D52398L,0x9A0618EE0F666CL,0x14C94DA505B8L};
+const BIG CURVE_Gy= {0xC7087B244920345L,0x13BFC7739D62DC2L,0x29414549BC0AL};
+const BIG CURVE_HTPC= {0x1L,0x0L,0x0L};
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_C25519.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_C25519.cpp
new file mode 100644
index 0000000..9dcf93b
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_C25519.cpp
@@ -0,0 +1,54 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "ecp_C25519.h"
+
+namespace C25519 {
+
+/* Curve 25519 */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B256_29;
+
+const int CURVE_Cof_I=8;
+const BIG CURVE_Cof= {0x8,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Order= {0x1CF5D3ED,0x9318D2,0x1DE73596,0x1DF3BD45,0x14D,0x0,0x0,0x0,0x100000};
+const BIG CURVE_Gx= {0x9};
+const BIG CURVE_HTPC= {0x507504F,0x13B86C9D,0x5FC8F18,0x31806AD,0x1EBD397A,0x264F7E,0x1E16569A,0x804FC1D,0x55C192};
+#endif
+
+#if CHUNK==64
+
+using namespace B256_56;
+
+const int CURVE_Cof_I=8;
+const BIG CURVE_Cof= {0x8L,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_Order= {0x12631A5CF5D3ED,0xF9DEA2F79CD658,0x14DE,0x0,0x10000000};
+const BIG CURVE_Gx= {0x9};
+const BIG CURVE_HTPC= {0x770D93A507504FL,0x8C035697F23C62L,0x4C9EFDEBD397A1L,0x27E0EF8595A680L,0x55C19240L};
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_C41417.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_C41417.cpp
new file mode 100644
index 0000000..29331e6
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_C41417.cpp
@@ -0,0 +1,60 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "ecp_C41417.h"
+
+namespace C41417 {
+
+/* Curve C41417 */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B416_29;
+
+const int CURVE_Cof_I=8;
+const BIG CURVE_Cof= {0x8,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const int CURVE_B_I= 3617;
+const BIG CURVE_B= {0xE21,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Order= {0x106AF79,0x18738D2F,0x18F3C606,0x1806715A,0x22B36F1,0xA67B830,0xCF32490,0x1FFFFFFD,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1F};
+const BIG CURVE_Gx= {0x13CBC595,0x7E9C097,0x14DF1931,0x14E7F550,0x1A111301,0x15A6B6B5,0xD526292,0x18FEAFFE,0x1F44C03E,0x1E6A31B4,0x70C9B97,0x43180C6,0x1443300,0x19A4828A,0x68};
+const BIG CURVE_Gy= {0x22,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_HTPC= {0x1FFFFFEE,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0xFF};
+#endif
+
+#if CHUNK==64
+
+using namespace B416_60;
+
+const int CURVE_Cof_I=8;
+const BIG CURVE_Cof= {0x8L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const int CURVE_B_I= 3617;
+const BIG CURVE_B= {0xE21L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_Order= {0xB0E71A5E106AF79L,0x1C0338AD63CF181L,0x414CF706022B36FL,0xFFFFFFFFEB3CC92L,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0x7FFFFFFFFFFFFL};
+const BIG CURVE_Gx= {0x4FD3812F3CBC595L,0x1A73FAA8537C64CL,0x4AB4D6D6BA11130L,0x3EC7F57FF35498AL,0xE5FCD46369F44C0L,0x300218C0631C326L,0x1A334905141443L};
+const BIG CURVE_Gy= {0x22L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_HTPC= {0xFFFFFFFFFFFFFEEL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFL};
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_Ed25519.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_Ed25519.cpp
new file mode 100644
index 0000000..da51d2e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_Ed25519.cpp
@@ -0,0 +1,70 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "ecp_Ed25519.h"
+
+namespace Ed25519 {
+
+/* Ed25519 */
+
+#if CHUNK==16
+/* Ed25519 Curve */
+
+using namespace B256_13;
+
+const int CURVE_Cof_I=8;
+const BIG CURVE_Cof= {0x8,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const int CURVE_B_I= 0;
+const BIG CURVE_B= {0x18A3,0x1ACB,0x1284,0x169B,0x175E,0xC55,0x507,0x9A8,0x100A,0x3,0x1A26,0xEF3,0x797,0x3A0,0xE33,0x1FCE,0xB6F,0x771,0xDB,0xA4};
+const BIG CURVE_Order= {0x13ED,0x7AE,0x697,0x4C6,0x581,0xE6B,0xBDE,0x1BD4,0x1EF9,0xA6,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x20};
+const BIG CURVE_Gx= {0x151A,0x192E,0x1823,0xC5A,0xC95,0x13D9,0x1496,0xC12,0xCC7,0x349,0x1717,0x1BAD,0x31F,0x1271,0x1B02,0xA7F,0xD6E,0x169E,0x1A4D,0x42};
+const BIG CURVE_Gy= {0x658,0x1333,0x1999,0xCCC,0x666,0x1333,0x1999,0xCCC,0x666,0x1333,0x1999,0xCCC,0x666,0x1333,0x1999,0xCCC,0x666,0x1333,0x1999,0xCC};
+const BIG CURVE_HTPC= {0x104F,0x83A,0x4E9,0xE1B,0x627,0x191E,0x1A5F,0x6A,0x18C,0x1CBD,0x1AF4,0x1DFB,0x4C9,0x1340,0x1656,0x1DF0,0x7E0,0x1201,0x1064,0xAB};
+#endif
+
+#if CHUNK==32
+
+using namespace B256_29;
+
+const int CURVE_Cof_I=8;
+const BIG CURVE_Cof= {0x8,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const int CURVE_B_I= 0;
+const BIG CURVE_B= {0x135978A3,0xF5A6E50,0x10762ADD,0x149A82,0x1E898007,0x3CBBBC,0x19CE331D,0x1DC56DFF,0x52036C};
+const BIG CURVE_Order= {0x1CF5D3ED,0x9318D2,0x1DE73596,0x1DF3BD45,0x14D,0x0,0x0,0x0,0x100000};
+const BIG CURVE_Gx= {0xF25D51A,0xAB16B04,0x969ECB2,0x198EC12A,0xDC5C692,0x1118FEEB,0xFFB0293,0x1A79ADCA,0x216936};
+const BIG CURVE_Gy= {0x6666658,0x13333333,0x19999999,0xCCCCCCC,0x6666666,0x13333333,0x19999999,0xCCCCCCC,0x666666};
+const BIG CURVE_HTPC= {0x507504F,0x13B86C9D,0x5FC8F18,0x31806AD,0x1EBD397A,0x264F7E,0x1E16569A,0x804FC1D,0x55C192};
+
+#endif
+
+#if CHUNK==64
+
+using namespace B256_56;
+
+const int CURVE_Cof_I=8;
+const BIG CURVE_Cof= {0x8L,0x0L,0x0L,0x0L,0x0L};
+const int CURVE_B_I= 0;
+const BIG CURVE_B= {0xEB4DCA135978A3L,0xA4D4141D8AB75L,0x797779E8980070L,0x2B6FFE738CC740L,0x52036CEEL};
+const BIG CURVE_Order= {0x12631A5CF5D3EDL,0xF9DEA2F79CD658L,0x14DEL,0x0L,0x10000000L};
+const BIG CURVE_Gx= {0x562D608F25D51AL,0xC7609525A7B2C9L,0x31FDD6DC5C692CL,0xCD6E53FEC0A4E2L,0x216936D3L};
+const BIG CURVE_Gy= {0x66666666666658L,0x66666666666666L,0x66666666666666L,0x66666666666666L,0x66666666L};
+const BIG CURVE_HTPC= {0x770D93A507504FL,0x8C035697F23C62L,0x4C9EFDEBD397A1L,0x27E0EF8595A680L,0x55C19240L};
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_Ed448.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_Ed448.cpp
new file mode 100644
index 0000000..36a900a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_Ed448.cpp
@@ -0,0 +1,64 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "ecp_Ed448.h"
+
+namespace Ed448 {
+
+/* Curve Ed448 */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B448_29;
+
+const int CURVE_Cof_I=4;
+const BIG CURVE_Cof= {0x4,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const int CURVE_B_I= -39081;
+const BIG CURVE_B= {0x1FFF6756,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FDFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFF};
+const BIG CURVE_Order= {0xB5844F3,0x1BC61495,0x1163D548,0x1984E51B,0x3690216,0xDA4D76B,0xFA7113B,0x1FEF9944,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x7FF};
+//const BIG CURVE_Gx= {0x15555555,0xAAAAAAA,0x15555555,0xAAAAAAA,0x15555555,0xAAAAAAA,0x15555555,0x152AAAAA,0xAAAAAAA,0x15555555,0xAAAAAAA,0x15555555,0xAAAAAAA,0x15555555,0xAAAAAAA,0x1555};
+//const BIG CURVE_Gy= {0xA9386ED,0x1757DE6F,0x13681AF6,0x19657DA3,0x3098BBB,0x12C19D15,0x12E03595,0xE515B18,0x17B7E36D,0x1AC426E,0xDBB5E8,0x10D8560,0x159D6205,0xB8246D9,0x17A58D2B,0x15C0};
+const BIG CURVE_Gx= {0x70CC05E,0x1135415E,0x24E389,0x1701C316,0x6511433,0xD7B955B,0x11904AB8,0x4947A74,0x7EA6DE3,0x23878BB,0x785195C,0x57E6DB5,0x1D15A62,0x1686F691,0x5C319AF,0x9E3};
+const BIG CURVE_Gy= {0x1230FA14,0x43CADF,0x15F22B66,0x1A26589D,0x39C4FDB,0x1F8E733E,0xB5CEB4F,0x3C0B418,0x87789C,0x1B651CC2,0x12FA9CDC,0xD938EC4,0x7620375,0x1B5E1244,0x1D19C5BA,0xD27};
+const BIG CURVE_HTPC= {0x1FFFFFFE,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FDFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFF};
+#endif
+
+#if CHUNK==64
+
+using namespace B448_58;
+
+const int CURVE_Cof_I=4;
+const BIG CURVE_Cof= {0x4L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const int CURVE_B_I= -39081;
+const BIG CURVE_B= {0x3FFFFFFFFFF6756L,0x3FFFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFFL,0x3FBFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFFL,0x3FFFFFFFFFFL};
+const BIG CURVE_Order= {0x378C292AB5844F3L,0x3309CA37163D548L,0x1B49AED63690216L,0x3FDF3288FA7113BL,0x3FFFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFFL,0xFFFFFFFFFFL};
+//const BIG CURVE_Gx= {0x155555555555555L,0x155555555555555L,0x155555555555555L,0x2A5555555555555L,0x2AAAAAAAAAAAAAAL,0x2AAAAAAAAAAAAAAL,0x2AAAAAAAAAAAAAAL,0x2AAAAAAAAAAL};
+//const BIG CURVE_Gy= {0x2EAFBCDEA9386EDL,0x32CAFB473681AF6L,0x25833A2A3098BBBL,0x1CA2B6312E03595L,0x35884DD7B7E36DL,0x21B0AC00DBB5E8L,0x17048DB359D6205L,0x2B817A58D2BL};
+const BIG CURVE_Gx= {0x226A82BC70CC05EL,0x2E03862C024E389L,0x1AF72AB66511433L,0x928F4E91904AB8L,0x470F1767EA6DE3L,0xAFCDB6A785195CL,0x2D0DED221D15A62L,0x13C65C319AFL};
+const BIG CURVE_Gy= {0x8795BF230FA14L,0x344CB13B5F22B66L,0x3F1CE67C39C4FDBL,0x7816830B5CEB4FL,0x36CA3984087789CL,0x1B271D892FA9CDCL,0x36BC24887620375L,0x1A4FD19C5BAL};
+const BIG CURVE_HTPC= {0x3FFFFFFFFFFFFFEL,0x3FFFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFFL,0x3FBFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFFL,0x3FFFFFFFFFFL};
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_FP256BN.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_FP256BN.cpp
new file mode 100644
index 0000000..85140ad
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_FP256BN.cpp
@@ -0,0 +1,104 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "ecp_FP256BN.h"
+
+namespace FP256BN {
+
+/* Curve BN254 - Pairing friendly BN curve */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B256_28;
+
+const int CURVE_Cof_I=1;
+const int CURVE_B_I= 3;
+const BIG CURVE_B= {0x3,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Order= {0x10B500D,0x2D536CD,0x9921AF6,0x65FB129,0x49E0CDC,0x5EEE71A,0xD46E5F2,0xFFFCF0C,0xFFFFFFF,0xF};
+const BIG CURVE_Gx= {0x1,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Gy= {0x2,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_HTPC= {0x1,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+
+const BIG CURVE_Bnx= {0xB0A801,0x82F5C03,0x68,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Cof= {0x1,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+
+const BIG CURVE_Pxa= {0x9C09EFB,0x2616B68,0xF843CD2,0x539A12B,0x13ACE1C,0x577C289,0x28560F,0xB4C96C2,0xE0C3350,0xF};
+const BIG CURVE_Pxb= {0x37E6A2B,0x69ED34A,0x3589D2,0x78E287D,0x3B924DD,0xC637D81,0x4DB5AE1,0x738AC05,0xEA66057,0x4};
+const BIG CURVE_Pya= {0xEDC27FF,0x9B481B,0x15848E9,0x24758D6,0xE51EFCB,0x75124E3,0x376770D,0xC542A3B,0x2046E7,0x7};
+const BIG CURVE_Pyb= {0xAAD049B,0x1281114,0xA98B3E0,0xBE80821,0x29F8B4C,0x49297EB,0x42EEA6,0xD388C29,0x554E3BC,0x0};
+const BIG CURVE_W[2]= {{0xB054003,0xF0036E1,0xE78663A,0xFFFFFFF,0xFFFF,0x0,0x0,0x0,0x0,0x0},{0x1615001,0x5EB806,0xD1,0x0,0x0,0x0,0x0,0x0,0x0,0x0}};
+const BIG CURVE_SB[2][2]= {{{0xC669004,0xF5EEEE7,0xE78670B,0xFFFFFFF,0xFFFF,0x0,0x0,0x0,0x0,0x0},{0x1615001,0x5EB806,0xD1,0x0,0x0,0x0,0x0,0x0,0x0,0x0}},{{0x1615001,0x5EB806,0xD1,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0x606100A,0x3D4FFEB,0xB19B4BB,0x65FB129,0x49D0CDC,0x5EEE71A,0xD46E5F2,0xFFFCF0C,0xFFFFFFF,0xF}}};
+const BIG CURVE_WB[4]= {{0xD30A800,0x20678F0,0x4D2CC10,0x5555555,0x5555,0x0,0x0,0x0,0x0,0x0},{0xD7DC805,0xD6764C0,0xBC3AD1A,0x8FBEA10,0x4467DE,0x8061601,0xD105EB,0x0,0x0,0x0},{0xF173803,0xACB6061,0x5E1D6C1,0x47DF508,0x82233EF,0xC030B00,0x6882F5,0x0,0x0,0x0},{0xE91F801,0x26530F6,0x4D2CCE1,0x5555555,0x5555,0x0,0x0,0x0,0x0,0x0}};
+const BIG CURVE_BB[4][4]= {{{0x5AA80D,0xAA5DACA,0x9921A8D,0x65FB129,0x49E0CDC,0x5EEE71A,0xD46E5F2,0xFFFCF0C,0xFFFFFFF,0xF},
+                                           {0x5AA80C,0xAA5DACA,0x9921A8D,0x65FB129,0x49E0CDC,0x5EEE71A,0xD46E5F2,0xFFFCF0C,0xFFFFFFF,0xF},
+	                                       {0x5AA80C,0xAA5DACA,0x9921A8D,0x65FB129,0x49E0CDC,0x5EEE71A,0xD46E5F2,0xFFFCF0C,0xFFFFFFF,0xF},
+	                                       {0x1615002,0x5EB806,0xD1,0x0,0x0,0x0,0x0,0x0,0x0,0x0}},
+	                                       {{0x1615001,0x5EB806,0xD1,0x0,0x0,0x0,0x0,0x0,0x0,0x0},
+	                                        {0x5AA80C,0xAA5DACA,0x9921A8D,0x65FB129,0x49E0CDC,0x5EEE71A,0xD46E5F2,0xFFFCF0C,0xFFFFFFF,0xF},
+	                                        {0x5AA80D,0xAA5DACA,0x9921A8D,0x65FB129,0x49E0CDC,0x5EEE71A,0xD46E5F2,0xFFFCF0C,0xFFFFFFF,0xF},
+	                                        {0x5AA80C,0xAA5DACA,0x9921A8D,0x65FB129,0x49E0CDC,0x5EEE71A,0xD46E5F2,0xFFFCF0C,0xFFFFFFF,0xF}},
+	                                        {{0x1615002,0x5EB806,0xD1,0x0,0x0,0x0,0x0,0x0,0x0,0x0},
+	                                         {0x1615001,0x5EB806,0xD1,0x0,0x0,0x0,0x0,0x0,0x0,0x0},
+	                                         {0x1615001,0x5EB806,0xD1,0x0,0x0,0x0,0x0,0x0,0x0,0x0},
+	                                         {0x1615001,0x5EB806,0xD1,0x0,0x0,0x0,0x0,0x0,0x0,0x0}},
+	                                         {{0xB0A802,0x82F5C03,0x68,0x0,0x0,0x0,0x0,0x0,0x0,0x0},
+	                                          {0x2C2A002,0xBD700C,0x1A2,0x0,0x0,0x0,0x0,0x0,0x0,0x0},
+	                                          {0xFAA000A,0x2767EC6,0x9921A25,0x65FB129,0x49E0CDC,0x5EEE71A,0xD46E5F2,0xFFFCF0C,0xFFFFFFF,0xF},
+	                                          {0xB0A802,0x82F5C03,0x68,0x0,0x0,0x0,0x0,0x0,0x0,0x0}}};
+
+
+
+
+#endif
+
+#if CHUNK==64
+
+using namespace B256_56;
+
+const int CURVE_Cof_I=1;
+const int CURVE_B_I= 3;
+const BIG CURVE_B= {0x3L,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_Order= {0x2D536CD10B500DL,0x65FB1299921AF6L,0x5EEE71A49E0CDCL,0xFFFCF0CD46E5F2L,0xFFFFFFFFL};
+const BIG CURVE_Gx= {0x1L,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_Gy= {0x2L,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_HTPC= {0x1L,0x0L,0x0L,0x0L,0x0L};
+
+const BIG CURVE_Bnx= {0x82F5C030B0A801L,0x68L,0x0L,0x0L,0x0L};
+const BIG CURVE_Cof= {0x1L,0x0L,0x0L,0x0L,0x0L};
+
+const BIG CURVE_Pxa= {0x2616B689C09EFBL,0x539A12BF843CD2L,0x577C28913ACE1CL,0xB4C96C2028560FL,0xFE0C3350L};
+const BIG CURVE_Pxb= {0x69ED34A37E6A2BL,0x78E287D03589D2L,0xC637D813B924DDL,0x738AC054DB5AE1L,0x4EA66057L};
+const BIG CURVE_Pya= {0x9B481BEDC27FFL,0x24758D615848E9L,0x75124E3E51EFCBL,0xC542A3B376770DL,0x702046E7L};
+const BIG CURVE_Pyb= {0x1281114AAD049BL,0xBE80821A98B3E0L,0x49297EB29F8B4CL,0xD388C29042EEA6L,0x554E3BCL};
+const BIG CURVE_W[2]= {{0xF0036E1B054003L,0xFFFFFFFE78663AL,0xFFFFL,0x0L,0x0L},{0x5EB8061615001L,0xD1L,0x0L,0x0L,0x0L}};
+const BIG CURVE_SB[2][2]= {{{0xF5EEEE7C669004L,0xFFFFFFFE78670BL,0xFFFFL,0x0L,0x0L},{0x5EB8061615001L,0xD1L,0x0L,0x0L,0x0L}},{{0x5EB8061615001L,0xD1L,0x0L,0x0L,0x0L},{0x3D4FFEB606100AL,0x65FB129B19B4BBL,0x5EEE71A49D0CDCL,0xFFFCF0CD46E5F2L,0xFFFFFFFFL}}};
+const BIG CURVE_WB[4]= {{0x20678F0D30A800L,0x55555554D2CC10L,0x5555L,0x0L,0x0L},{0xD6764C0D7DC805L,0x8FBEA10BC3AD1AL,0x806160104467DEL,0xD105EBL,0x0L},{0xACB6061F173803L,0x47DF5085E1D6C1L,0xC030B0082233EFL,0x6882F5L,0x0L},{0x26530F6E91F801L,0x55555554D2CCE1L,0x5555L,0x0L,0x0L}};
+const BIG CURVE_BB[4][4]= {{{0xAA5DACA05AA80DL,0x65FB1299921A8DL,0x5EEE71A49E0CDCL,0xFFFCF0CD46E5F2L,0xFFFFFFFFL},{0xAA5DACA05AA80CL,0x65FB1299921A8DL,0x5EEE71A49E0CDCL,0xFFFCF0CD46E5F2L,0xFFFFFFFFL},{0xAA5DACA05AA80CL,0x65FB1299921A8DL,0x5EEE71A49E0CDCL,0xFFFCF0CD46E5F2L,0xFFFFFFFFL},{0x5EB8061615002L,0xD1L,0x0L,0x0L,0x0L}},{{0x5EB8061615001L,0xD1L,0x0L,0x0L,0x0L},{0xAA5DACA05AA80CL,0x65FB1299921A8DL,0x5EEE71A49E0CDCL,0xFFFCF0CD46E5F2L,0xFFFFFFFFL},{0xAA5DACA05AA80DL,0x65FB1299921A8DL,0x5EEE71A49E0CDCL,0xFFFCF0CD46E5F2L,0xFFFFFFFFL},{0xAA5DACA05AA80CL,0x65FB1299921A8DL,0x5EEE71A49E0CDCL,0xFFFCF0CD46E5F2L,0xFFFFFFFFL}},{{0x5EB8061615002L,0xD1L,0x0L,0x0L,0x0L},{0x5EB8061615001L,0xD1L,0x0L,0x0L,0x0L},{0x5EB8061615001L,0xD1L,0x0L,0x0L,0x0L},{0x5EB8061615001L,0xD1L,0x0L,0x0L,0x0L}},{{0x82F5C030B0A802L,0x68L,0x0L,0x0L,0x0L},{0xBD700C2C2A002L,0x1A2L,0x0L,0x0L,0x0L},{0x2767EC6FAA000AL,0x65FB1299921A25L,0x5EEE71A49E0CDCL,0xFFFCF0CD46E5F2L,0xFFFFFFFFL},{0x82F5C030B0A802L,0x68L,0x0L,0x0L,0x0L}}};
+
+
+
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_FP512BN.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_FP512BN.cpp
new file mode 100644
index 0000000..c9a2edf
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_FP512BN.cpp
@@ -0,0 +1,109 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "ecp_FP512BN.h"
+
+namespace FP512BN {
+
+/* Curve FP512BN - Pairing friendly BN curve */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B512_29;
+
+const int CURVE_Cof_I=1;
+const int CURVE_B_I= 3;
+const BIG CURVE_B= {0x3,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Order= {0x119A09ED,0x153252FA,0x1E68AD01,0x627C09,0x79A34A1,0x12EF5593,0x2E39231,0x3D597D3,0x45146CF,0x88D877A,0x102EF8F0,0x1196A60F,0x1C60BA1D,0x1CF63F80,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x7FFFF};
+const BIG CURVE_Gx= {0x1,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Gy= {0x2,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_HTPC= {0x1,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+
+const BIG CURVE_Bnx= {0x1E1BD80F,0x59835DA,0xC3DFC04,0x5EB8061,0x688,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Cof= {0x1,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+
+const BIG CURVE_Pxa= {0xDB646B5,0x183D4B70,0x1CBFFA3,0x11F0E632,0x1C78F221,0x1F10DE5D,0x171B715E,0xF0C6A29,0x10B02453,0xBE63C66,0xE6D5F69,0x166B1E1B,0x4BBBD29,0x179E750F,0x6E9D04,0xC912B10,0x1339E138,0x1D8B2};
+const BIG CURVE_Pxb= {0x1A8AE0E9,0xDAE5F7E,0x22446CF,0x1948239B,0x15ADCE40,0xB709C1E,0x18357943,0xE50AA4D,0x19781E22,0x12B35CA6,0x11DAA2C0,0x18D8DDE4,0x5EA656D,0x15F45A41,0xD311A02,0xCFCD913,0x13CBF850,0x240E0};
+const BIG CURVE_Pya= {0xDDE67A1,0x12401895,0x17BEE178,0x142F5AC2,0xB7BC5CD,0x92A1404,0x1A3B748C,0x17BD82A7,0x14B6CD18,0xAC34CE,0x1740FB97,0x1ECC15F9,0x17085B1D,0x1D1BA793,0x1BD6AC32,0x18F70525,0xC84C827,0x3780F};
+const BIG CURVE_Pyb= {0x84F8E8B,0xC5B8C36,0xFDD85A1,0xB84449,0x19C08DFF,0x56BF713,0x1C5290C4,0x187C5CA0,0x1DA2897F,0x24B0CA0,0x326D8F4,0x2310CF6,0x1021438C,0xFBAEC8F,0xD9030C5,0x1CF06358,0x1CEC8B04,0x28D1D};
+const BIG CURVE_W[2]= {{0x9834583,0x887C4BA,0x5A85CFC,0xBF7223A,0xF63FE96,0x1FFFFFFE,0x1FFFFFFF,0x1FFFFFFF,0xFFFFFF,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0x1C37B01F,0xB306BB5,0x187BF808,0xBD700C2,0xD10,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0}};
+const BIG CURVE_SB[2][2]= {{{0xD4B9564,0x1D575904,0xD2C64F3,0x202177,0xF63F186,0x1FFFFFFE,0x1FFFFFFF,0x1FFFFFFF,0xFFFFFF,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0x156259CE,0xA01E744,0x5ECB4F9,0x148B7B47,0x79A2790,0x12EF5593,0x2E39231,0x3D597D3,0x45146CF,0x88D877A,0x102EF8F0,0x1196A60F,0x1C60BA1D,0x1CF63F80,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x7FFFF}},{{0x1C37B01F,0xB306BB5,0x187BF808,0xBD700C2,0xD10,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0x9834583,0x887C4BA,0x5A85CFC,0xBF7223A,0xF63FE96,0x1FFFFFFE,0x1FFFFFFF,0x1FFFFFFF,0xFFFFFF,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0}}};
+const BIG CURVE_WB[4]= {{0x155A29F0,0x16D59B55,0xF4C305,0x18858C0B,0x5215FBF,0xAAAAAAA,0x15555555,0xAAAAAAA,0x555555,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0x2355D4B,0x1758095D,0x1FE13C5F,0x41F83FA,0xBB5E5CF,0x97D4EF1,0xB503D62,0x172C0C9B,0x16315274,0x15E1A9A8,0x859835D,0x2C3DFC0,0x105EB806,0x68,0x0,0x0,0x0,0x0},{0x289AAD,0x1E781F9C,0x60F9C31,0x1505822E,0x15DAF62B,0x4BEA778,0x15A81EB1,0xB96064D,0xB18A93A,0x1AF0D4D4,0x42CC1AE,0x161EFE0,0x82F5C03,0x34,0x0,0x0,0x0,0x0},{0x192279D1,0xBA52F9F,0x878CAFD,0xCAE8B48,0x52152AF,0xAAAAAAA,0x15555555,0xAAAAAAA,0x555555,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0}};
+const BIG CURVE_BB[4][4]= {{{0x1E1BD810,0x59835DA,0xC3DFC04,0x5EB8061,0x688,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},
+											{0x1E1BD80F,0x59835DA,0xC3DFC04,0x5EB8061,0x688,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},
+											{0x1E1BD80F,0x59835DA,0xC3DFC04,0x5EB8061,0x688,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},
+											{0x156259CF,0xA01E744,0x5ECB4F9,0x148B7B47,0x79A2790,0x12EF5593,0x2E39231,0x3D597D3,0x45146CF,0x88D877A,0x102EF8F0,0x1196A60F,0x1C60BA1D,0x1CF63F80,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x7FFFF}},
+											{{0x1C37B01F,0xB306BB5,0x187BF808,0xBD700C2,0xD10,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},
+											 {0x137E31DE,0xF9A1D1F,0x122AB0FD,0x1A76FBA8,0x79A2E18,0x12EF5593,0x2E39231,0x3D597D3,0x45146CF,0x88D877A,0x102EF8F0,0x1196A60F,0x1C60BA1D,0x1CF63F80,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x7FFFF},
+											 {0x137E31DD,0xF9A1D1F,0x122AB0FD,0x1A76FBA8,0x79A2E18,0x12EF5593,0x2E39231,0x3D597D3,0x45146CF,0x88D877A,0x102EF8F0,0x1196A60F,0x1C60BA1D,0x1CF63F80,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x7FFFF},
+											 {0x137E31DE,0xF9A1D1F,0x122AB0FD,0x1A76FBA8,0x79A2E18,0x12EF5593,0x2E39231,0x3D597D3,0x45146CF,0x88D877A,0x102EF8F0,0x1196A60F,0x1C60BA1D,0x1CF63F80,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x7FFFF}},
+											 {{0x1C37B01E,0xB306BB5,0x187BF808,0xBD700C2,0xD10,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},
+											  {0x1C37B01F,0xB306BB5,0x187BF808,0xBD700C2,0xD10,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},
+											  {0x1C37B01F,0xB306BB5,0x187BF808,0xBD700C2,0xD10,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},
+											  {0x1C37B01F,0xB306BB5,0x187BF808,0xBD700C2,0xD10,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0}},
+											   {{0x137E31DF,0xF9A1D1F,0x122AB0FD,0x1A76FBA8,0x79A2E18,0x12EF5593,0x2E39231,0x3D597D3,0x45146CF,0x88D877A,0x102EF8F0,0x1196A60F,0x1C60BA1D,0x1CF63F80,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x7FFFF},
+												{0x192AA9AF,0x1ED17B8E,0xD70BCF0,0x8B47A84,0x79A1A80,0x12EF5593,0x2E39231,0x3D597D3,0x45146CF,0x88D877A,0x102EF8F0,0x1196A60F,0x1C60BA1D,0x1CF63F80,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x7FFFF},
+												{0x1C37B01D,0xB306BB5,0x187BF808,0xBD700C2,0xD10,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},
+												{0x137E31DF,0xF9A1D1F,0x122AB0FD,0x1A76FBA8,0x79A2E18,0x12EF5593,0x2E39231,0x3D597D3,0x45146CF,0x88D877A,0x102EF8F0,0x1196A60F,0x1C60BA1D,0x1CF63F80,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x7FFFF}}};
+
+
+
+#endif
+
+#if CHUNK==64
+
+using namespace B512_60;
+
+const int CURVE_Cof_I=1;
+const int CURVE_B_I= 3;
+const BIG CURVE_B= {0x3L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_Order= {0x6A64A5F519A09EDL,0x10313E04F9A2B40L,0xC65DEAB2679A34AL,0xCF1EACBE98B8E48L,0x3C111B0EF445146L,0xA1D8CB5307C0BBEL,0xFFFF9EC7F01C60BL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFL};
+const BIG CURVE_Gx= {0x1L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_Gy= {0x2L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_HTPC= {0x1L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+
+const BIG CURVE_Bnx= {0xB306BB5E1BD80FL,0x82F5C030B0F7F01L,0x68L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_Cof= {0x1L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+
+const BIG CURVE_Pxa= {0xF07A96E0DB646B5L,0x18F87319072FFE8L,0x7BE21BCBBC78F22L,0x537863514DC6DC5L,0xDA57CC78CD0B024L,0xD29B358F0DB9B57L,0x7412F3CEA1E4BBBL,0xE138648958801BAL,0x3B165339L};
+const BIG CURVE_Pxb= {0xDB5CBEFDA8AE0E9L,0xCA411CD88911B3L,0xD6E1383D5ADCE4L,0x227285526E0D5E5L,0xB02566B94D9781EL,0x56DC6C6EF2476A8L,0x680ABE8B4825EA6L,0xF85067E6C89B4C4L,0x481C13CBL};
+const BIG CURVE_Pya= {0x2480312ADDE67A1L,0xDA17AD615EFB85EL,0x312542808B7BC5CL,0x18BDEC153E8EDD2L,0xE5C158699D4B6CDL,0xB1DF660AFCDD03EL,0xB0CBA374F277085L,0xC827C7B8292EF5AL,0x6F01EC84L};
+const BIG CURVE_Pyb= {0x58B7186C84F8E8BL,0xF05C2224BF76168L,0x10AD7EE279C08DFL,0x7FC3E2E50714A43L,0x3D04961941DA289L,0x38C118867B0C9B6L,0xC315F75D91F0214L,0x8B04E7831AC3640L,0x51A3BCECL};
+
+
+const BIG CURVE_W[2]= {{0x110F89749834583L,0x65FB911D16A173FL,0xFFFFFFFFCF63FE9L,0xFFFFFFFFFFFFFFFL,0xFFFFL,0x0L,0x0L,0x0L,0x0L},{0x1660D76BC37B01FL,0x5EB806161EFE02L,0xD1L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L}};
+const BIG CURVE_SB[2][2]= {{{0xFAAEB208D4B9564L,0x601010BBB4B193CL,0xFFFFFFFFCF63F18L,0xFFFFFFFFFFFFFFFL,0xFFFFL,0x0L,0x0L,0x0L,0x0L},{0x5403CE8956259CEL,0xA45BDA397B2D3EL,0xC65DEAB2679A279L,0xCF1EACBE98B8E48L,0x3C111B0EF445146L,0xA1D8CB5307C0BBEL,0xFFFF9EC7F01C60BL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFL}},{{0x1660D76BC37B01FL,0x5EB806161EFE02L,0xD1L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L},{0x110F89749834583L,0x65FB911D16A173FL,0xFFFFFFFFCF63FE9L,0xFFFFFFFFFFFFFFFL,0xFFFFL,0x0L,0x0L,0x0L,0x0L}}};
+const BIG CURVE_WB[4]= {{0x6DAB36AB55A29F0L,0xFC42C60583D30C1L,0x5555555545215FBL,0x555555555555555L,0x5555L,0x0L,0x0L,0x0L,0x0L},
+	{0xEEB012BA2355D4BL,0xF20FC1FD7F84F17L,0x892FA9DE2BB5E5CL,0x74B96064DAD40F5L,0xD76BC3535163152L,0x806161EFE021660L,0xD105EBL,0x0L,0x0L},
+	{0x7CF03F380289AADL,0xBA82C117183E70CL,0xC497D4EF15DAF62L,0x3A5CB0326D6A07AL,0x6BB5E1A9A8B18A9L,0xC030B0F7F010B30L,0x6882F5L,0x0L,0x0L},
+	{0x574A5F3F92279D1L,0xF65745A421E32BFL,0x55555555452152AL,0x555555555555555L,0x5555L,0x0L,0x0L,0x0L,0x0L}};
+const BIG CURVE_BB[4][4]= {{{0xB306BB5E1BD810L,0x82F5C030B0F7F01L,0x68L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L},{0xB306BB5E1BD80FL,0x82F5C030B0F7F01L,0x68L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L},{0xB306BB5E1BD80FL,0x82F5C030B0F7F01L,0x68L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L},{0x5403CE8956259CFL,0xA45BDA397B2D3EL,0xC65DEAB2679A279L,0xCF1EACBE98B8E48L,0x3C111B0EF445146L,0xA1D8CB5307C0BBEL,0xFFFF9EC7F01C60BL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFL}},
+	{{0x1660D76BC37B01FL,0x5EB806161EFE02L,0xD1L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L},{0x5F343A3F37E31DEL,0x8D3B7DD448AAC3FL,0xC65DEAB2679A2E1L,0xCF1EACBE98B8E48L,0x3C111B0EF445146L,0xA1D8CB5307C0BBEL,0xFFFF9EC7F01C60BL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFL},{0x5F343A3F37E31DDL,0x8D3B7DD448AAC3FL,0xC65DEAB2679A2E1L,0xCF1EACBE98B8E48L,0x3C111B0EF445146L,0xA1D8CB5307C0BBEL,0xFFFF9EC7F01C60BL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFL},{0x5F343A3F37E31DEL,0x8D3B7DD448AAC3FL,0xC65DEAB2679A2E1L,0xCF1EACBE98B8E48L,0x3C111B0EF445146L,0xA1D8CB5307C0BBEL,0xFFFF9EC7F01C60BL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFL}},
+	{{0x1660D76BC37B01EL,0x5EB806161EFE02L,0xD1L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L},{0x1660D76BC37B01FL,0x5EB806161EFE02L,0xD1L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L},{0x1660D76BC37B01FL,0x5EB806161EFE02L,0xD1L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L},{0x1660D76BC37B01FL,0x5EB806161EFE02L,0xD1L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L}},
+	{{0x5F343A3F37E31DFL,0x8D3B7DD448AAC3FL,0xC65DEAB2679A2E1L,0xCF1EACBE98B8E48L,0x3C111B0EF445146L,0xA1D8CB5307C0BBEL,0xFFFF9EC7F01C60BL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFL},{0x3DA2F71D92AA9AFL,0x45A3D4235C2F3CL,0xC65DEAB2679A1A8L,0xCF1EACBE98B8E48L,0x3C111B0EF445146L,0xA1D8CB5307C0BBEL,0xFFFF9EC7F01C60BL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFL},{0x1660D76BC37B01DL,0x5EB806161EFE02L,0xD1L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L},{0x5F343A3F37E31DFL,0x8D3B7DD448AAC3FL,0xC65DEAB2679A2E1L,0xCF1EACBE98B8E48L,0x3C111B0EF445146L,0xA1D8CB5307C0BBEL,0xFFFF9EC7F01C60BL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFL}}};
+
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_HIFIVE.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_HIFIVE.cpp
new file mode 100644
index 0000000..3edc1fa
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_HIFIVE.cpp
@@ -0,0 +1,61 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "ecp_HIFIVE.h"
+
+namespace HIFIVE {
+
+/* Curve HIFIVE */
+
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B336_29;
+
+const int CURVE_Cof_I=8;
+const BIG CURVE_Cof= {0x8,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const int CURVE_B_I= 11111;
+const BIG CURVE_B= {0x2B67,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Order= {0x1E9FA805,0x197CACB9,0x1E4EEA9E,0x17AD70F,0x1FA9850C,0x38A0A,0x0,0x0,0x0,0x0,0x0,0x4000};
+const BIG CURVE_Gx= {0xC,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Gy= {0x5FE8632,0x15F63428,0xD976C4,0x1AACA194,0x35B6DB5,0x8E3F7A,0x52D1B0E,0xF0A7A36,0x1C161D00,0x8170C70,0x1185AD59,0x181B};
+const BIG CURVE_HTPC= {0x5531622,0x11FEDF60,0x182A7392,0x16BAC746,0x1A3512D9,0x49580D5,0xE77C13C,0x1AAC2086,0x1E3A6A5,0x2B61FB8,0x783F9C2,0x6C0};
+#endif
+
+#if CHUNK==64
+
+using namespace B336_60;
+
+const int CURVE_Cof_I=8;
+const BIG CURVE_Cof= {0x8L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const int CURVE_B_I= 11111;
+const BIG CURVE_B= {0x2B67L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_Order= {0xB2F95973E9FA805L,0xC0BD6B87F93BAA7L,0x71415FA9850L,0x0L,0x0L,0x200000000L};
+const BIG CURVE_Gx= {0xCL,0x0L,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_Gy= {0x2BEC68505FE8632L,0x5D5650CA0365DB1L,0x3811C7EF435B6DBL,0x7853D1B14B46CL,0x56502E18E1C161DL,0xC0DC616BL};
+const BIG CURVE_HTPC= {0xA3FDBEC05531622L,0x9B5D63A360A9CE4L,0xF092B01ABA3512DL,0xA5D56104339DF04L,0x70856C3F701E3A6L,0x3601E0FEL};
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_JUBJUB.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_JUBJUB.cpp
new file mode 100644
index 0000000..6db686a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_JUBJUB.cpp
@@ -0,0 +1,59 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "ecp_JUBJUB.h"
+
+namespace JUBJUB {
+
+/* JUBJUB Curve  */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B256_29;
+
+const int CURVE_Cof_I= 8;
+const BIG CURVE_Cof= {0x8,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const int CURVE_B_I= 0;
+const BIG CURVE_B= {0x16343EB1,0x832FEB6,0x15E74980,0x1AFEDA6E,0x17FD4292,0x903F35E,0xD23D7F6,0x1CE97F45,0x2A9318};
+const BIG CURVE_Order= {0x16F72CB7,0x4B872F6,0x120420B4,0x10412799,0x3B00A66,0x1D80809A,0x1EA4199C,0x1D4CA675,0xE7DB4};
+const BIG CURVE_Gx= {0x14F976C4,0x1A7678D3,0x1CE7B79F,0x18A8D7E5,0x4882000,0x1A6F801C,0xE329892,0x55F1DFE,0x518397};
+const BIG CURVE_Gy= {0x1349702E,0x35D6B84,0x9A0CEC5,0x190E0FFF,0x1C308096,0x62D5ECE,0x10B27A3F,0x8E5945F,0x3B43F8};
+const BIG CURVE_HTPC= {0x47BBBB6,0x83D77CF,0x1D4C82A6,0x1BFEA2A2,0xD546E25,0x1765A39E,0x7500F8F,0x168566F6,0x62FD68};
+#endif
+
+#if CHUNK==64
+
+using namespace B256_56;
+const int CURVE_Cof_I= 8;
+const BIG CURVE_Cof= {0x8L,0x0L,0x0L,0x0L,0x0L};
+const int CURVE_B_I= 0;
+const BIG CURVE_B= {0x65FD6D6343EB1L,0x7F6D37579D2601L,0x7E6BD7FD4292DL,0x4BFA2B48F5FD92L,0x2A9318E7L};
+const BIG CURVE_Order= {0x970E5ED6F72CB7L,0x2093CCC81082D0L,0x101343B00A668L,0x6533AFA906673BL,0xE7DB4EAL};
+const BIG CURVE_Gx= {0x4ECF1A74F976C4L,0x546BF2F39EDE7FL,0xDF00384882000CL,0xF8EFF38CA624B4L,0x5183972AL};
+const BIG CURVE_Gy= {0x6BAD709349702EL,0x8707FFA6833B14L,0x5ABD9DC308096CL,0x2CA2FC2C9E8FCCL,0x3B43F847L};
+const BIG CURVE_HTPC= {0x7AEF9E47BBBB6L,0xFF515175320A99L,0xCB473CD546E25DL,0x2B37B1D403E3EEL,0x62FD68B4L};
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_MDC.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_MDC.cpp
new file mode 100644
index 0000000..1da8f55
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_MDC.cpp
@@ -0,0 +1,61 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "ecp_MDC.h"
+
+
+namespace MDC {
+
+/* Million Dollar Curve */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B256_28;
+
+const int CURVE_Cof_I= 4;
+const BIG CURVE_Cof= {0x4,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const int CURVE_B_I= 0;
+const BIG CURVE_B= {0x300CF89,0x9309250,0x1F041EE,0x70F63F2,0x9625F12,0xCCFB0CB,0xA7CDFBF,0x1965B68,0x7130452,0x5};
+const BIG CURVE_Order= {0x1B0F7FB,0x8552F42,0x974BB58,0x8975FAF,0xF534FB3,0xBF75E97,0xD14CBE4,0x7515ABE,0xC4EDA2E,0x3};
+const BIG CURVE_Gx= {0xE68363B,0x2C25BFE,0x713E223,0x2ABB8D2,0xF6350D7,0x1E03CBC,0x3D85B42,0x7F903B8,0x681886A,0xB};
+const BIG CURVE_Gy= {0xD2864B5,0x73C355B,0x93A3A7E,0xBC3D81A,0xA421DA8,0xCF6563D,0x359814D,0xB59C0B0,0xA6734E1,0xC};
+const BIG CURVE_HTPC= {0x1,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+#endif
+
+#if CHUNK==64
+
+using namespace B256_56;
+
+const int CURVE_Cof_I= 4;
+const BIG CURVE_Cof= {0x4L,0x0L,0x0L,0x0L,0x0L};
+const int CURVE_B_I= 0;
+const BIG CURVE_B= {0x9309250300CF89L,0x70F63F21F041EEL,0xCCFB0CB9625F12L,0x1965B68A7CDFBFL,0x57130452L};
+const BIG CURVE_Order= {0x8552F421B0F7FBL,0x8975FAF974BB58L,0xBF75E97F534FB3L,0x7515ABED14CBE4L,0x3C4EDA2EL};
+const BIG CURVE_Gx= {0x2C25BFEE68363BL,0x2ABB8D2713E223L,0x1E03CBCF6350D7L,0x7F903B83D85B42L,0xB681886AL};
+const BIG CURVE_Gy= {0x73C355BD2864B5L,0xBC3D81A93A3A7EL,0xCF6563DA421DA8L,0xB59C0B0359814DL,0xCA6734E1L};
+const BIG CURVE_HTPC= {0x1L,0x0L,0x0L,0x0L,0x0L};
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_NIST256.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_NIST256.cpp
new file mode 100644
index 0000000..fd42dc6
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_NIST256.cpp
@@ -0,0 +1,61 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "ecp_NIST256.h"
+
+namespace NIST256 {
+
+/* Curve NIST256 */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B256_28;
+
+const int CURVE_Cof_I=1;
+const BIG CURVE_Cof= {0x1,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const int CURVE_B_I= 0;
+const BIG CURVE_B= {0x7D2604B,0xCE3C3E2,0x3B0F63B,0x6B0CC5,0x6BC651D,0x5576988,0x7B3EBBD,0xAA3A93E,0xAC635D8,0x5};
+const BIG CURVE_Order= {0xC632551,0xB9CAC2F,0x79E84F3,0xFAADA71,0xFFFBCE6,0xFFFFFFF,0xFFFFFF,0x0,0xFFFFFFF,0xF};
+const BIG CURVE_Gx= {0x898C296,0xA13945D,0xB33A0F4,0x7D812DE,0xF27703,0xE563A44,0x7F8BCE6,0xE12C424,0xB17D1F2,0x6};
+const BIG CURVE_Gy= {0x7BF51F5,0xB640683,0x15ECECB,0x33576B3,0xE162BCE,0x4A7C0F9,0xB8EE7EB,0xFE1A7F9,0xFE342E2,0x4};
+const BIG CURVE_HTPC= {0xC613926,0xB847959,0xA9DD42E,0xB001452,0x5548D3E,0x8F44A65,0x45240B3,0xB63723A,0xA2AD82C,0x6};
+
+#endif
+
+#if CHUNK==64
+
+using namespace B256_56;
+
+const int CURVE_Cof_I=1;
+const BIG CURVE_Cof= {0x1L,0x0L,0x0L,0x0L,0x0L};
+const int CURVE_B_I= 0;
+const BIG CURVE_B= {0xCE3C3E27D2604BL,0x6B0CC53B0F63BL,0x55769886BC651DL,0xAA3A93E7B3EBBDL,0x5AC635D8L};
+const BIG CURVE_Order= {0xB9CAC2FC632551L,0xFAADA7179E84F3L,0xFFFFFFFFFFBCE6L,0xFFFFFFL,0xFFFFFFFFL};
+const BIG CURVE_Gx= {0xA13945D898C296L,0x7D812DEB33A0F4L,0xE563A440F27703L,0xE12C4247F8BCE6L,0x6B17D1F2L};
+const BIG CURVE_Gy= {0xB6406837BF51F5L,0x33576B315ECECBL,0x4A7C0F9E162BCEL,0xFE1A7F9B8EE7EBL,0x4FE342E2L};
+const BIG CURVE_HTPC= {0xB847959C613926L,0xB001452A9DD42EL,0x8F44A655548D3EL,0xB63723A45240B3L,0x6A2AD82CL};
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_NIST384.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_NIST384.cpp
new file mode 100644
index 0000000..1349595
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_NIST384.cpp
@@ -0,0 +1,60 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "ecp_NIST384.h"
+
+namespace NIST384 {
+
+/* Curve NIST384 */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B384_29;
+
+const int CURVE_Cof_I=1;
+const BIG CURVE_Cof= {0x1,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const int CURVE_B_I= 0;
+const BIG CURVE_B= {0x13EC2AEF,0x142E476E,0xBB4674A,0xC731B14,0x1875AC65,0x447A809,0x4480C50,0xDDFD028,0x19181D9C,0x1F1FC168,0x623815A,0x47DCFC9,0x1312FA7E,0x59};
+const BIG CURVE_Order= {0xCC52973,0x760CB56,0xC29DEBB,0x141B6491,0x12DDF581,0x6C0FA1B,0x1FFF1D8D,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x7F};
+const BIG CURVE_Gx= {0x12760AB7,0x12A2F1C3,0x154A5B0E,0x5E4BB7E,0x2A38550,0xF0412A,0xE6167DD,0xC5174F3,0x146E1D3B,0x1799056B,0x3AC71C7,0x1D160A6F,0x87CA22B,0x55};
+const BIG CURVE_Gy= {0x10EA0E5F,0x1218EBE4,0x1FA0675E,0x1639C3A,0xB8C00A6,0x1889DAF8,0x11F3A768,0x17A51342,0x9F8F41D,0x1C9496E1,0x1767A62F,0xC4C58DE,0x17DE4A9,0x1B};
+const BIG CURVE_HTPC= {0xDCD21B,0x1213626A,0x1502B4CF,0x85A550E,0x5FEED05,0x13578422,0xED2F57D,0x16A06E8C,0x2E00897,0x1652C3E0,0x12F5A8FF,0x6E2A490,0x6EF0F22,0x5E};
+#endif
+
+#if CHUNK==64
+
+using namespace B384_56;
+
+const int CURVE_Cof_I=1;
+const BIG CURVE_Cof= {0x1L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const int CURVE_B_I= 0;
+const BIG CURVE_B= {0x85C8EDD3EC2AEFL,0x398D8A2ED19D2AL,0x8F5013875AC656L,0xFE814112031408L,0xF82D19181D9C6EL,0xE7E4988E056BE3L,0xB3312FA7E23EL};
+const BIG CURVE_Order= {0xEC196ACCC52973L,0xDB248B0A77AECL,0x81F4372DDF581AL,0xFFFFFFFFC7634DL,0xFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFL};
+const BIG CURVE_Gx= {0x545E3872760AB7L,0xF25DBF55296C3AL,0xE082542A385502L,0x8BA79B9859F741L,0x20AD746E1D3B62L,0x5378EB1C71EF3L,0xAA87CA22BE8BL};
+const BIG CURVE_Gy= {0x431D7C90EA0E5FL,0xB1CE1D7E819D7AL,0x13B5F0B8C00A60L,0x289A147CE9DA31L,0x92DC29F8F41DBDL,0x2C6F5D9E98BF92L,0x3617DE4A9626L};
+const BIG CURVE_HTPC= {0x426C4D40DCD21BL,0x2D2A87540AD33EL,0xAF08445FEED054L,0x37463B4BD5F66L,0x587C02E00897B5L,0x52484BD6A3FECAL,0xBC6EF0F22371L};
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_NIST521.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_NIST521.cpp
new file mode 100644
index 0000000..68d48ae
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_NIST521.cpp
@@ -0,0 +1,60 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "ecp_NIST521.h"
+
+namespace NIST521 {
+
+/* Curve NIST521 */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B528_28;
+
+const int CURVE_Cof_I=1;
+const BIG CURVE_Cof= {0x1,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const int CURVE_B_I= 0;
+const BIG CURVE_B= {0xB503F00,0x451FD46,0xC34F1EF,0xDF883D2,0xF073573,0xBD3BB1B,0xB1652C0,0xEC7E937,0x6193951,0xF109E15,0x489918E,0x15F3B8B,0x25B99B3,0xEEA2DA7,0xB68540,0x929A21A,0xE1C9A1F,0x3EB9618,0x5195};
+const BIG CURVE_Order= {0x1386409,0x6FB71E9,0xC47AEBB,0xC9B8899,0x5D03BB5,0x48F709A,0xB7FCC01,0xBF2F966,0x1868783,0xFFFFFA5,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0x1FFFF};
+const BIG CURVE_Gx= {0x2E5BD66,0x7E7E31C,0xA429BF9,0xB3C1856,0x8DE3348,0x27A2FFA,0x8FE1DC1,0xEFE7592,0x14B5E77,0x4D3DBAA,0x8AF606B,0xB521F82,0x139053F,0x429C648,0x62395B4,0x9E3ECB6,0x404E9CD,0x8E06B70,0xC685};
+const BIG CURVE_Gy= {0xFD16650,0xBE94769,0x2C24088,0x7086A27,0x761353C,0x13FAD0,0xC550B9,0x5EF4264,0x7EE7299,0x3E662C9,0xFBD1727,0x446817A,0x449579B,0xD998F54,0x42C7D1B,0x5C8A5FB,0xA3BC004,0x296A789,0x11839};
+const BIG CURVE_HTPC= {0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFF};
+#endif
+
+#if CHUNK==64
+
+using namespace B528_60;
+
+const int CURVE_Cof_I=1;
+const BIG CURVE_Cof= {0x1L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const int CURVE_B_I= 0;
+const BIG CURVE_B= {0xF451FD46B503F00L,0x73DF883D2C34F1EL,0x2C0BD3BB1BF0735L,0x3951EC7E937B165L,0x9918EF109E15619L,0x5B99B315F3B8B48L,0xB68540EEA2DA72L,0x8E1C9A1F929A21AL,0x51953EB961L};
+const BIG CURVE_Order= {0xB6FB71E91386409L,0xB5C9B8899C47AEBL,0xC0148F709A5D03BL,0x8783BF2F966B7FCL,0xFFFFFFFFFFA5186L,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0x1FFFFFFFFFFL};
+const BIG CURVE_Gx= {0x97E7E31C2E5BD66L,0x48B3C1856A429BFL,0xDC127A2FFA8DE33L,0x5E77EFE75928FE1L,0xF606B4D3DBAA14BL,0x39053FB521F828AL,0x62395B4429C6481L,0x404E9CD9E3ECB6L,0xC6858E06B7L};
+const BIG CURVE_Gy= {0x8BE94769FD16650L,0x3C7086A272C2408L,0xB9013FAD076135L,0x72995EF42640C55L,0xD17273E662C97EEL,0x49579B446817AFBL,0x42C7D1BD998F544L,0x9A3BC0045C8A5FBL,0x11839296A78L};
+const BIG CURVE_HTPC= {0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFL};
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_NUMS256E.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_NUMS256E.cpp
new file mode 100644
index 0000000..d35fbd1
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_NUMS256E.cpp
@@ -0,0 +1,68 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "ecp_NUMS256E.h"
+
+namespace NUMS256E {
+
+/*  NUMS 256-bit Curve - Edwards */
+
+#if CHUNK==16
+
+using namespace B256_13;
+
+const int CURVE_Cof_I=4;
+const BIG CURVE_Cof= {0x4,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const int CURVE_B_I= -15342;
+const BIG CURVE_B= {0x355,0x1FFE,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FF};
+const BIG CURVE_Order= {0xAF5,0x16EA,0x43B,0xF63,0x11A4,0x1CD,0x1D65,0x14A5,0x155A,0x20C,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x80};
+const BIG CURVE_Gx= {0x13DA,0x1768,0x40B,0x1D81,0xA0D,0x1AC3,0xC20,0x1DC,0x198A,0x1061,0x6F5,0x1241,0x15F6,0xF1E,0x1734,0x46F,0xAEA,0x7DB,0x1D45,0x114};
+const BIG CURVE_Gy= {0x9E6,0xC54,0x19DE,0xC2D,0x12FA,0x1769,0x215,0x1B02,0x1F61,0x38A,0x4,0xC97,0x1D9A,0xB32,0x1F3A,0x4B8,0x19D9,0x14FE,0x154F,0x89};
+const BIG CURVE_HTPC= {0x1,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+#endif
+
+#if CHUNK==32
+
+using namespace B256_29;
+
+const int CURVE_Cof_I=4;
+const BIG CURVE_Cof= {0x4,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const int CURVE_B_I= -15342;
+const BIG CURVE_B= {0x1FFFC355,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0xFFFFFF};
+const BIG CURVE_Order= {0xEDD4AF5,0x123D8C87,0x1650E6C6,0xAB54A5E,0x419,0x0,0x0,0x0,0x400000};
+const BIG CURVE_Gx= {0xEED13DA,0x6F60481,0x20D61A8,0x13141DC6,0x9BD60C3,0x1EAFB490,0xDF73478,0x1F6D5D44,0x8A7514};
+const BIG CURVE_Gy= {0x198A89E6,0x1D30B73B,0x15BB4CB,0x1EC3B021,0x18010715,0x12ECD325,0x171F3A59,0x13FB3B24,0x44D53E};
+const BIG CURVE_HTPC= {0x1,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+#endif
+
+#if CHUNK==64
+
+using namespace B256_56;
+
+const int CURVE_Cof_I=4;
+const BIG CURVE_Cof= {0x4L,0x0L,0x0L,0x0L,0x0L};
+const int CURVE_B_I= -15342;
+const BIG CURVE_B= {0xFFFFFFFFFFC355L,0xFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFL,0xFFFFFFFFL};
+const BIG CURVE_Order= {0x47B190EEDD4AF5L,0x5AA52F59439B1AL,0x4195L,0x0L,0x40000000L};
+const BIG CURVE_Gx= {0xDEC0902EED13DAL,0x8A0EE3083586A0L,0x5F69209BD60C39L,0x6AEA237DCD1E3DL,0x8A7514FBL};
+const BIG CURVE_Gy= {0xA616E7798A89E6L,0x61D810856ED32FL,0xD9A64B8010715FL,0xD9D925C7CE9665L,0x44D53E9FL};
+const BIG CURVE_HTPC= {0x1L,0x0L,0x0L,0x0L,0x0L};
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_NUMS256W.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_NUMS256W.cpp
new file mode 100644
index 0000000..16da170
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_NUMS256W.cpp
@@ -0,0 +1,60 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "ecp_NUMS256W.h"
+
+namespace NUMS256W {
+
+/*  NUMS 256-bit Curve - Weierstrass */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B256_28;
+
+const int CURVE_Cof_I=1;
+const BIG CURVE_Cof= {0x1,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const int CURVE_B_I= 152961;
+const BIG CURVE_B= {0x25581,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Order= {0x751A825,0xAB20294,0x65C6020,0x8275EA2,0xFFFE43C,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xF};
+const BIG CURVE_Gx= {0x21AACB1,0x52EE1EB,0x4C73ABC,0x9B0903D,0xB098357,0xA04F42C,0x1297A95,0x5AAADB6,0xC9ED6B6,0xB};
+const BIG CURVE_Gy= {0x184DE9F,0xB5B9CB2,0x10FBB80,0xC3D1153,0x35C955,0xF77E04E,0x673448B,0x3399B6A,0x8FC0F1,0xD};
+const BIG CURVE_HTPC= {0x52B84D6,0xFC6F759,0xE89E05,0x92C6204,0x6AE4640,0x70CADDC,0x5B22ED0,0x5411E3B,0xF7F44E4,0xC};
+#endif
+
+#if CHUNK==64
+
+using namespace B256_56;
+
+const int CURVE_Cof_I=1;
+const BIG CURVE_Cof= {0x1L,0x0L,0x0L,0x0L,0x0L};
+const int CURVE_B_I= 152961;
+const BIG CURVE_B= {0x25581L,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_Order= {0xAB20294751A825L,0x8275EA265C6020L,0xFFFFFFFFFFE43CL,0xFFFFFFFFFFFFFFL,0xFFFFFFFFL};
+const BIG CURVE_Gx= {0x52EE1EB21AACB1L,0x9B0903D4C73ABCL,0xA04F42CB098357L,0x5AAADB61297A95L,0xBC9ED6B6L};
+const BIG CURVE_Gy= {0xB5B9CB2184DE9FL,0xC3D115310FBB80L,0xF77E04E035C955L,0x3399B6A673448BL,0xD08FC0F1L};
+const BIG CURVE_HTPC= {0xFC6F75952B84D6L,0x92C62040E89E05L,0x70CADDC6AE4640L,0x5411E3B5B22ED0L,0xCF7F44E4L};
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_NUMS384E.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_NUMS384E.cpp
new file mode 100644
index 0000000..6f12a5b
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_NUMS384E.cpp
@@ -0,0 +1,61 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "ecp_NUMS384E.h"
+
+namespace NUMS384E {
+
+/*  NUMS 384-bit Curve - Edwards */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B384_29;
+
+const int CURVE_Cof_I=4;
+const BIG CURVE_Cof= {0x4,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const int CURVE_B_I= -11556;
+const BIG CURVE_B= {0x1FFFD19F,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x7F};
+const BIG CURVE_Order= {0x6A3897D,0x5CEE627,0xD721E48,0x8AAB556,0x1E1CF61E,0xD0E5A35,0x1FFF891C,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1F};
+const BIG CURVE_Gx= {0xC206BDE,0x6AA0723,0x116504D4,0x52562CA,0x163406FF,0x1FD47998,0x10015D8F,0x8DCB7C9,0x15B30BF4,0x14D72AED,0x102DA884,0xB524CD9,0x1B111FB4,0x30};
+const BIG CURVE_Gy= {0x10729392,0xC681F0F,0x1B123727,0x561F28D,0x1964B007,0xC7BFB22,0x1D5A0C3E,0xE9E284B,0x1716AD82,0x11D886E,0x1CE2C69,0x134DDD61,0x983E67B,0x41};
+const BIG CURVE_HTPC= {0x1,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+#endif
+
+#if CHUNK==64
+
+using namespace B384_58;
+
+const int CURVE_Cof_I= 4;
+const BIG CURVE_Cof= {0x4L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const int CURVE_B_I= -11556;
+const BIG CURVE_B= {0x3FFFFFFFFFFD19FL,0x3FFFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFFL,0xFFFFFFFFFL};
+const BIG CURVE_Order= {0xB9DCC4E6A3897DL,0x11556AACD721E48L,0x1A1CB46BE1CF61EL,0x3FFFFFFFFFF891CL,0x3FFFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFFL,0x3FFFFFFFFL};
+const BIG CURVE_Gx= {0xD540E46C206BDEL,0xA4AC59516504D4L,0x3FA8F33163406FFL,0x11B96F930015D8FL,0x29AE55DB5B30BF4L,0x16A499B302DA884L,0x61B111FB4L};
+const BIG CURVE_Gy= {0x18D03E1F0729392L,0xAC3E51BB123727L,0x18F7F645964B007L,0x1D3C5097D5A0C3EL,0x23B10DD716AD82L,0x269BBAC21CE2C69L,0x82983E67BL};
+const BIG CURVE_HTPC= {0x1L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_NUMS384W.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_NUMS384W.cpp
new file mode 100644
index 0000000..6b1741b
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_NUMS384W.cpp
@@ -0,0 +1,60 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "ecp_NUMS384W.h"
+
+namespace NUMS384W {
+
+/*  NUMS 384-bit Curve - Weierstrass */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B384_29;
+
+const int CURVE_Cof_I=1;
+const BIG CURVE_Cof= {0x1,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const int CURVE_B_I= -34568;
+const BIG CURVE_B= {0x1FFF77BB,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x7F};
+const BIG CURVE_Order= {0x1B0E61B9,0x26C0FB3,0xDF89E98,0x153A7A98,0x16881BED,0x178F75AE,0x1FFF587A,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x7F};
+const BIG CURVE_Gx= {0x98152A,0x1CE5D021,0x18711EFA,0x1DDA201E,0xC742522,0x148D9536,0x7D3CEF4,0x19BF703F,0x60225C1,0x12082F8D,0x12203288,0x2DE3038,0x17956F0B,0x3A};
+const BIG CURVE_Gy= {0x6180716,0x3A5C763,0x1D2B4997,0xD69B77F,0x837EBCD,0x1BE890D,0xE72E482,0xEFF0FEE,0x1EB00469,0x2C267B,0x15F8CF4C,0x3371C71,0xDEE368E,0x56};
+const BIG CURVE_HTPC= {0x1FFFFF61,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x3F};
+#endif
+
+#if CHUNK==64
+
+using namespace B384_58;
+
+const int CURVE_Cof_I= 1;
+const BIG CURVE_Cof= {0x1L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const int CURVE_B_I= -34568;
+const BIG CURVE_B= {0x3FFFFFFFFFF77BBL,0x3FFFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFFL,0xFFFFFFFFFL};
+const BIG CURVE_Order= {0x4D81F67B0E61B9L,0x2A74F530DF89E98L,0x2F1EEB5D6881BEDL,0x3FFFFFFFFFF587AL,0x3FFFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFFL,0xFFFFFFFFFL};
+const BIG CURVE_Gx= {0x39CBA042098152AL,0x3BB4403D8711EFAL,0x291B2A6CC742522L,0x337EE07E7D3CEF4L,0x24105F1A60225C1L,0x5BC60712203288L,0x757956F0BL};
+const BIG CURVE_Gy= {0x74B8EC66180716L,0x1AD36EFFD2B4997L,0x37D121A837EBCDL,0x1DFE1FDCE72E482L,0x584CF7EB00469L,0x66E38E35F8CF4CL,0xACDEE368EL};
+const BIG CURVE_HTPC= {0x3FFFFFFFFFFFF61L,0x3FFFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFFL,0x7FFFFFFFFL};
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_NUMS512E.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_NUMS512E.cpp
new file mode 100644
index 0000000..d9138d9
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_NUMS512E.cpp
@@ -0,0 +1,61 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "ecp_NUMS512E.h"
+
+namespace NUMS512E {
+
+/*  NUMS 512-bit Curve - Edwards */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B512_29;
+
+const int CURVE_Cof_I=4;
+const BIG CURVE_Cof= {0x4,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const int CURVE_B_I= -78296;
+const BIG CURVE_B= {0x1FFECBEF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x7FFFF};
+const BIG CURVE_Order= {0x1BEED46D,0x1A3467A8,0x1BFB3FD9,0xC0AF0DB,0x86F52A4,0xC64B85B,0x6EA78FF,0xDA5F9F2,0x1FB4F063,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFF};
+const BIG CURVE_Gx= {0x19EC57FE,0xDCD594C,0x113C0571,0xA4A84F9,0x104AD0FE,0x4C92B44,0xC3DE2F7,0x9DDC8CE,0x74621C1,0x1139DC0A,0x9E85FAF,0x1B894704,0x1D1E79F4,0x9E29997,0x32DE223,0x16D38F43,0x116D128D,0x6FC71};
+const BIG CURVE_Gy= {0x1E2F5E1,0x136EF606,0x1C7407CC,0xDA71537,0xC1FD026,0x3431576,0x15898068,0x1E5D32C6,0x120CA53,0xC84F41A,0xA4ADAE5,0x104B3A45,0x76F726D,0x1512B772,0x3D5DEA0,0x194E3316,0x1FF39D49,0x3684D};
+const BIG CURVE_HTPC= {0x1FFFFDC6,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x7FFFF};
+#endif
+
+#if CHUNK==64
+
+using namespace B512_60;
+
+const int CURVE_Cof_I= 4;
+const BIG CURVE_Cof= {0x4L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const int CURVE_B_I= -78296;
+const BIG CURVE_B= {0xFFFFFFFFFFECBEFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFL};
+const BIG CURVE_Order= {0x7468CF51BEED46DL,0x4605786DEFECFF6L,0xFD8C970B686F52AL,0x636D2FCF91BA9E3L,0xFFFFFFFFFFFB4F0L,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0x3FFFFFFFL};
+const BIG CURVE_Gx= {0x5B9AB2999EC57FEL,0xE525427CC4F015CL,0xDC992568904AD0FL,0xC14EEE46730F78BL,0xEBE273B81474621L,0x9F4DC4A38227A17L,0x888D3C5332FD1E7L,0x128DB69C7A18CB7L,0xDF8E316DL};
+const BIG CURVE_Gy= {0x26DDEC0C1E2F5E1L,0x66D38A9BF1D01F3L,0xA06862AECC1FD02L,0x53F2E9963562601L,0xB95909E834120CAL,0x26D8259D22A92B6L,0x7A82A256EE476F7L,0x9D49CA7198B0F57L,0x6D09BFF3L};
+const BIG CURVE_HTPC= {0xFFFFFFFFFFFFDC6L,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFL};
+
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_NUMS512W.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_NUMS512W.cpp
new file mode 100644
index 0000000..616f30b
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_NUMS512W.cpp
@@ -0,0 +1,60 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "ecp_NUMS512W.h"
+
+namespace NUMS512W {
+
+/*  NUMS 512-bit Curve - Weierstrass */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B512_29;
+
+const int CURVE_Cof_I=1;
+const BIG CURVE_Cof= {0x1,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const int CURVE_B_I= 121243;
+const BIG CURVE_B= {0x1D99B,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Order= {0x433555D,0x10A9F9C8,0x1F3490F3,0xD166CC0,0xBDC63B5,0xC76CBE8,0xC6D3F09,0x1F729CF0,0x1F5B3CA4,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x7FFFF};
+const BIG CURVE_Gx= {0xCABAE57,0x4143CAC,0x1BD778B7,0x1AC026FA,0x15831D5,0x14312AB,0x167A4DE5,0xA20ED66,0x195021A1,0x129836CF,0x1141B830,0xA03ED0A,0xCAD83BB,0x1E9DA94C,0xDC00A80,0x1527B45,0x1447141D,0x1D601};
+const BIG CURVE_Gy= {0x183527A6,0x1D043B01,0x1F43FA48,0x16B83C99,0x5602CF2,0x1420592D,0x17A70486,0x1B5161DD,0x14A28415,0x3DE8A78,0x3D2C983,0x17797719,0x197DBDEA,0x15D88025,0x1BBB718F,0xAD679C1,0x14CA29AD,0x4A1D2};
+const BIG CURVE_HTPC= {0x1FFFFEE3,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x3FFFF};
+#endif
+
+#if CHUNK==64
+
+using namespace B512_60;
+
+const int CURVE_Cof_I= 1;
+const BIG CURVE_Cof= {0x1L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const int CURVE_B_I= 121243;
+const BIG CURVE_B= {0x1D99BL,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_Order= {0xE153F390433555DL,0x568B36607CD243CL,0x258ED97D0BDC63BL,0xA4FB94E7831B4FCL,0xFFFFFFFFFFF5B3CL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFL};
+const BIG CURVE_Gx= {0xC8287958CABAE57L,0x5D60137D6F5DE2DL,0x94286255615831DL,0xA151076B359E937L,0xC25306D9F95021L,0x3BB501F6854506EL,0x2A03D3B5298CAD8L,0x141D0A93DA2B700L,0x3AC03447L};
+const BIG CURVE_Gy= {0x3A08760383527A6L,0x2B5C1E4CFD0FE92L,0x1A840B25A5602CFL,0x15DA8B0EEDE9C12L,0x60C7BD14F14A284L,0xDEABBCBB8C8F4B2L,0xC63EBB1004B97DBL,0x29AD56B3CE0EEEDL,0x943A54CAL};
+const BIG CURVE_HTPC= {0xFFFFFFFFFFFFEE3L,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0x7FFFFFFFL};
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_SECP160R1.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_SECP160R1.cpp
new file mode 100644
index 0000000..03ffa33
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_SECP160R1.cpp
@@ -0,0 +1,71 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "ecp_SECP160R1.h"
+
+namespace SECP160R1 {
+
+/* Curve SECP160R1 */
+
+#if CHUNK==16
+
+using namespace B160_13;
+// Base Bits= 13
+
+const int CURVE_Cof_I= 1;
+const BIG CURVE_Cof= {0x1,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const int CURVE_B_I= 0;
+const BIG CURVE_B= {0x1A45,0xB2F,0xB71,0x9A9,0x181D,0x1C4F,0x16B3,0x116C,0x1D7A,0x2A5,0xFBF,0x192F,0x1};
+const BIG CURVE_Order= {0x257,0x13A9,0x14F2,0xF5D,0xF92,0x1A64,0x7,0x0,0x0,0x0,0x0,0x0,0x10};
+const BIG CURVE_Gx= {0x1C82,0x1E5F,0xE44,0x717,0x168C,0x14C4,0x1991,0x508,0x1573,0x477,0xD5A,0x152D,0x4};
+const BIG CURVE_Gy= {0x1B32,0x162F,0xDDE,0x6A2,0x42,0x489,0x773,0xFAB,0x894,0x98B,0xA15,0x74C,0x2};
+const BIG CURVE_HTPC= {0xDA,0x12DE,0x1CE8,0x15F5,0x105D,0x1539,0xB39,0xDF,0x1A61,0x166A,0xF40,0x1CA1,0x1};
+#endif
+
+#if CHUNK==32
+
+using namespace B160_29;
+
+const int CURVE_Cof_I= 1;
+const BIG CURVE_Cof= {0x1,0x0,0x0,0x0,0x0,0x0};
+const int CURVE_B_I= 0;
+const BIG CURVE_B= {0x565FA45,0xEA6A56E,0xB3E27E0,0x1AF516CB,0x1BEFC54B,0xE4B};
+const BIG CURVE_Order= {0xA752257,0x93D769E,0x7D323E,0x0,0x0,0x8000};
+const BIG CURVE_Gx= {0x13CBFC82,0x61C5DC8,0x191A625A,0xAE6508C,0xB5688EF,0x254B};
+const BIG CURVE_Gy= {0x1AC5FB32,0x11A89BB,0x17324481,0x1128FAB3,0x2855316,0x11D3};
+const BIG CURVE_HTPC= {0x25BC0DA,0xED7D79D,0x139A9CC1,0x14C20DF5,0xBD02CD5,0xF28};
+#endif
+
+#if CHUNK==64
+
+using namespace B160_56;
+
+// Base Bits= 56
+const int CURVE_Cof_I= 1;
+const BIG CURVE_Cof= {0x1L,0x0L,0x0L};
+const int CURVE_B_I= 0;
+const BIG CURVE_B= {0xD4D4ADC565FA45L,0x7A8B65ACF89F81L,0x1C97BEFC54BDL};
+const BIG CURVE_Order= {0x27AED3CA752257L,0x1F4C8F9L,0x1000000000000L};
+const BIG CURVE_Gx= {0xC38BB913CBFC82L,0x73284664698968L,0x4A96B5688EF5L};
+const BIG CURVE_Gy= {0x2351377AC5FB32L,0x947D59DCC91204L,0x23A628553168L};
+const BIG CURVE_HTPC= {0xDAFAF3A25BC0DAL,0x6106FACE6A7305L,0x1E50BD02CD5AL};
+
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_SECP256K1.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_SECP256K1.cpp
new file mode 100644
index 0000000..5241cb1
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_SECP256K1.cpp
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "ecp_SECP256K1.h"
+
+namespace SECP256K1 {
+
+/* Curve SECP256K1 */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B256_28;
+
+const int CURVE_Cof_I=1;
+const BIG CURVE_Cof= {0x1,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const int CURVE_B_I= 7;
+const BIG CURVE_B= {0x7,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Order= {0x364141,0xD25E8CD,0x8A03BBF,0xDCE6AF4,0xFFEBAAE,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xF};
+const BIG CURVE_Gx= {0x6F81798,0xF2815B1,0xE28D959,0xFCDB2DC,0xB07029B,0x95CE870,0xC55A062,0xF9DCBBA,0x9BE667E,0x7};
+const BIG CURVE_Gy= {0xB10D4B8,0x47D08FF,0x554199C,0xB448A68,0x8A8FD17,0xFC0E110,0x55DA4FB,0x26A3C46,0x83ADA77,0x4};
+//const BIG HTPC= {0xCD5F852,0x8D27AE1,0x4ECD47D,0x6D15DA1,0x62CC61F,0xC2A7979,0xF233770,0x3507F1D,0xA2D2BA9,0x0};
+const BIG CURVE_HTPC= {0xE8624AA,0xC813789,0xF508ECD,0xCA45C23,0xD8BBBFD,0x640A39C,0xF4D5B4,0x813FFE3,0xCE8E9E8,0xC};
+
+#if HTC_ISO_SECP256K1 != 0
+const BIG CURVE_Ad= {0xA444533,0x5447C01,0xF0E5D40,0xD363CB6,0x272E953,0x58F0F5D,0xCA08A55,0xDD661AD,0xF8731AB,0x3};
+const BIG CURVE_Bd= {0x6EB,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG PC[13]= {{0xAAAA88C,0x38E38DA,0xE38E38E,0x8E38E38,0x38E38E3,0xE38E38E,0x8E38E38,0x38E38E3,0xE38E38E,0x8},{0xD9DD262,0xCBD0B53,0xC40314E,0x6144037,0xAECE450,0xDECA25C,0x6E2A413,0x23F234E,0x34C328D,0x5},{0x17C6581,0xFF1044F,0x63B92DF,0xD2FC0BF,0x4C5D595,0xCEA7FD4,0x5B9F315,0xBC321D,0x7D3D4C8,0x0},{0xAAAA8C7,0x38E38DA,0xE38E38E,0x8E38E38,0x38E38E3,0xE38E38E,0x8E38E38,0x38E38E3,0xE38E38E,0x8},{0xA8C6D14,0x2A56612,0xE41BBC5,0x6B641F5,0x25406D3,0xD51B542,0xDF7C4B2,0x4383DC1,0xDADC6F6,0xE},{0x81EB49B,0xE6B7457,0x8487D9F,0x409542F,0xDD86CD,0xCBB7B64,0xA9CA34C,0x3D94918,0x3577119,0xD},{0x8E38D84,0xBDA12F3,0xA12F684,0x2F684BD,0x684BDA1,0x4BDA12F,0xDA12F68,0x12F684B,0xF684BDA,0x2},{0xECEE931,0x65E85A9,0xE2018A7,0x30A201B,0x5767228,0xEF6512E,0x3715209,0x91F91A7,0x9A61946,0x2},{0x1D71A3,0xFC90FC2,0x6DA6FDF,0xB046D68,0x6D5647A,0x4B12A0A,0xFA9D0A5,0xD5CB7C0,0x75E0C32,0xC},{0xE38E23C,0x2F684B8,0x684BDA1,0x4BDA12F,0xDA12F68,0x12F684B,0xF684BDA,0x84BDA12,0xBDA12F6,0x4},{0xFD2A76F,0xBF8192B,0xD6299A7,0x21162F0,0x37E0A3D,0x3FA8FE3,0xCF3A70C,0x6545CA2,0x484AA71,0x6},{0x85C2573,0xB425D26,0x8D978DF,0xC1BFC8E,0x2989467,0x632722C,0xFD5E9E6,0xB8BDB49,0xA06534B,0x7},{0xFFFF93B,0xFFFFFEF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xF}};
+#endif
+
+#endif
+
+#if CHUNK==64
+
+using namespace B256_56;
+
+// Base Bits= 56
+const int CURVE_Cof_I=1;
+const BIG CURVE_Cof= {0x1L,0x0L,0x0L,0x0L,0x0L};
+const int CURVE_B_I= 7;
+const BIG CURVE_B= {0x7L,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_Order= {0xD25E8CD0364141L,0xDCE6AF48A03BBFL,0xFFFFFFFFFEBAAEL,0xFFFFFFFFFFFFFFL,0xFFFFFFFFL};
+const BIG CURVE_Gx= {0xF2815B16F81798L,0xFCDB2DCE28D959L,0x95CE870B07029BL,0xF9DCBBAC55A062L,0x79BE667EL};
+const BIG CURVE_Gy= {0x47D08FFB10D4B8L,0xB448A68554199CL,0xFC0E1108A8FD17L,0x26A3C4655DA4FBL,0x483ADA77L};
+//const BIG HTPC= {0x8D27AE1CD5F852L,0x6D15DA14ECD47DL,0xC2A797962CC61FL,0x3507F1DF233770L,0xA2D2BA9L};
+const BIG CURVE_HTPC= {0xC813789E8624AAL,0xCA45C23F508ECDL,0x640A39CD8BBBFDL,0x813FFE30F4D5B4L,0xCCE8E9E8L};
+
+#if HTC_ISO_SECP256K1 != 0
+const BIG CURVE_Ad= {0x5447C01A444533L,0xD363CB6F0E5D40L,0x58F0F5D272E953L,0xDD661ADCA08A55L,0x3F8731ABL};
+const BIG CURVE_Bd= {0x6EBL,0x0L,0x0L,0x0L,0x0L};
+const BIG PC[13]= {{0x38E38DAAAAA88CL,0x8E38E38E38E38EL,0xE38E38E38E38E3L,0x38E38E38E38E38L,0x8E38E38EL},{0xCBD0B53D9DD262L,0x6144037C40314EL,0xDECA25CAECE450L,0x23F234E6E2A413L,0x534C328DL},{0xFF1044F17C6581L,0xD2FC0BF63B92DFL,0xCEA7FD44C5D595L,0xBC321D5B9F315L,0x7D3D4C8L},{0x38E38DAAAAA8C7L,0x8E38E38E38E38EL,0xE38E38E38E38E3L,0x38E38E38E38E38L,0x8E38E38EL},{0x2A56612A8C6D14L,0x6B641F5E41BBC5L,0xD51B54225406D3L,0x4383DC1DF7C4B2L,0xEDADC6F6L},{0xE6B745781EB49BL,0x409542F8487D9FL,0xCBB7B640DD86CDL,0x3D94918A9CA34CL,0xD3577119L},{0xBDA12F38E38D84L,0x2F684BDA12F684L,0x4BDA12F684BDA1L,0x12F684BDA12F68L,0x2F684BDAL},{0x65E85A9ECEE931L,0x30A201BE2018A7L,0xEF6512E5767228L,0x91F91A73715209L,0x29A61946L},{0xFC90FC201D71A3L,0xB046D686DA6FDFL,0x4B12A0A6D5647AL,0xD5CB7C0FA9D0A5L,0xC75E0C32L},{0x2F684B8E38E23CL,0x4BDA12F684BDA1L,0x12F684BDA12F68L,0x84BDA12F684BDAL,0x4BDA12F6L},{0xBF8192BFD2A76FL,0x21162F0D6299A7L,0x3FA8FE337E0A3DL,0x6545CA2CF3A70CL,0x6484AA71L},{0xB425D2685C2573L,0xC1BFC8E8D978DFL,0x632722C2989467L,0xB8BDB49FD5E9E6L,0x7A06534BL},{0xFFFFFEFFFFF93BL,0xFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFL,0xFFFFFFFFL}};
+#endif
+
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_SM2.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_SM2.cpp
new file mode 100644
index 0000000..ddf9230
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_SM2.cpp
@@ -0,0 +1,61 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "ecp_SM2.h"
+
+namespace SM2 {
+
+/* Curve SM2 */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B256_28;
+
+const int CURVE_Cof_I= 1;
+const BIG CURVE_Cof= {0x1,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const int CURVE_B_I= 0;
+const BIG CURVE_B= {0xD940E93,0xBCBD414,0xB8F92DD,0x89F515A,0x9A7F397,0x4BCF650,0x44D5A9E,0x9D9F5E3,0x8E9FA9E,0x2};
+const BIG CURVE_Order= {0x9D54123,0xBBF4093,0x6052B53,0xDF6B21C,0xFFF7203,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFE,0xF};
+const BIG CURVE_Gx= {0x34C74C7,0x5A45893,0x60BE171,0xBBFF26,0x9948FE3,0x466A39C,0x95F9904,0x1F19811,0x2C4AE2C,0x3};
+const BIG CURVE_Gy= {0x139F0A0,0xDF32E52,0xA474002,0x877CC62,0x153D0A9,0xE36B692,0xC59BDCE,0xF4F6779,0xC3736A2,0xB};
+const BIG CURVE_HTPC= {0xFFFFFFF,0xFFFFFFF,0x55555FF,0xFFFF555,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xAAAAAA9,0xA};
+
+#endif
+
+#if CHUNK==64
+
+using namespace B256_56;
+
+const int CURVE_Cof_I= 1;
+const BIG CURVE_Cof= {0x1L,0x0L,0x0L,0x0L,0x0L};
+const int CURVE_B_I= 0;
+const BIG CURVE_B= {0xBCBD414D940E93L,0x89F515AB8F92DDL,0x4BCF6509A7F397L,0x9D9F5E344D5A9EL,0x28E9FA9EL};
+const BIG CURVE_Order= {0xBBF40939D54123L,0xDF6B21C6052B53L,0xFFFFFFFFFF7203L,0xFFFFFFFFFFFFFFL,0xFFFFFFFEL};
+const BIG CURVE_Gx= {0x5A4589334C74C7L,0xBBFF2660BE171L,0x466A39C9948FE3L,0x1F1981195F9904L,0x32C4AE2CL};
+const BIG CURVE_Gy= {0xDF32E52139F0A0L,0x877CC62A474002L,0xE36B692153D0A9L,0xF4F6779C59BDCEL,0xBC3736A2L};
+const BIG CURVE_HTPC= {0xFFFFFFFFFFFFFFL,0xFFFF55555555FFL,0xFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFL,0xAAAAAAA9L};
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_TWEEDLEDEE.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_TWEEDLEDEE.cpp
new file mode 100644
index 0000000..7e6e35a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_TWEEDLEDEE.cpp
@@ -0,0 +1,62 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "ecp_TWEEDLEDEE.h"
+
+
+namespace TWEEDLEDEE {
+/* TWEEDLEDEE Curve */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B256_29;
+
+//*** rom curve parameters *****
+const int CURVE_Cof_I= 1;
+const BIG CURVE_Cof= {0x1,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const int CURVE_B_I= 5;
+const BIG CURVE_B= {0x5,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Order= {0x1,0xA032710,0xFD66E68,0x15424ED8,0x38,0x0,0x0,0x0,0x400000};
+const BIG CURVE_Gx= {0x0,0x1657EA0,0x18A1B261,0x15424ED2,0x38,0x0,0x0,0x0,0x400000};
+const BIG CURVE_Gy= {0x2,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_HTPC= {0xD69C848,0x1C30E5ED,0xBBDA1CC,0x180EA8CE,0xE9704A,0x1172DE0D,0x1C820B1A,0x1BC54C92,0x3AC188};
+#endif
+
+#if CHUNK==64
+
+using namespace B256_56;
+
+//*** rom curve parameters *****
+const int CURVE_Cof_I= 1;
+const BIG CURVE_Cof= {0x1L,0x0L,0x0L,0x0L,0x0L};
+const int CURVE_B_I= 5;
+const BIG CURVE_B= {0x5L,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_Order= {0x4064E200000001L,0xA1276C3F59B9A1L,0x38AL,0x0L,0x40000000L};
+const BIG CURVE_Gx= {0x2CAFD400000000L,0xA127696286C984L,0x38AL,0x0L,0x40000000L};
+const BIG CURVE_Gy= {0x2L,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_HTPC= {0x861CBDAD69C848L,0x754672EF68733L,0xE5BC1A0E9704ACL,0x2A64972082C6A2L,0x3AC188DEL};
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_TWEEDLEDUM.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_TWEEDLEDUM.cpp
new file mode 100644
index 0000000..bfe803e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_TWEEDLEDUM.cpp
@@ -0,0 +1,62 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "ecp_TWEEDLEDUM.h"
+
+
+namespace TWEEDLEDUM {
+/* TWEEDLEDUM Curve */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B256_29;
+
+//*** rom curve parameters *****
+const int CURVE_Cof_I= 1;
+const BIG CURVE_Cof= {0x1,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const int CURVE_B_I= 5;
+const BIG CURVE_B= {0x5,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Order= {0x1,0x1657EA0,0x18A1B261,0x15424ED2,0x38,0x0,0x0,0x0,0x400000};
+const BIG CURVE_Gx= {0x0,0xA032710,0xFD66E68,0x15424ED8,0x38,0x0,0x0,0x0,0x400000};
+const BIG CURVE_Gy= {0x2,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_HTPC= {0x1381795,0x16B3AA9A,0xF3EF0D9,0x15DD7A0,0xBAA53E1,0xC45B655,0xFD3BC53,0x1E66E041,0x3AB46C};
+#endif
+
+#if CHUNK==64
+
+using namespace B256_56;
+
+//*** rom curve parameters *****
+const int CURVE_Cof_I= 1;
+const BIG CURVE_Cof= {0x1L,0x0L,0x0L,0x0L,0x0L};
+const int CURVE_B_I= 5;
+const BIG CURVE_B= {0x5L,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_Order= {0x2CAFD400000001L,0xA127696286C984L,0x38AL,0x0L,0x40000000L};
+const BIG CURVE_Gx= {0x4064E200000000L,0xA1276C3F59B9A1L,0x38AL,0x0L,0x40000000L};
+const BIG CURVE_Gy= {0x2L,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_HTPC= {0xD6755341381795L,0xAEEBD03CFBC366L,0x8B6CAABAA53E10L,0x37020BF4EF14D8L,0x3AB46CF3L};
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_X448.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_X448.cpp
new file mode 100644
index 0000000..52d8001
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_curve_X448.cpp
@@ -0,0 +1,55 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "ecp_X448.h"
+
+namespace X448 {
+
+/* Curve X448 */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B448_29;
+
+const int CURVE_Cof_I= 4;
+const BIG CURVE_Cof= {0x4,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Order= {0xB5844F3,0x1BC61495,0x1163D548,0x1984E51B,0x3690216,0xDA4D76B,0xFA7113B,0x1FEF9944,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x7FF};
+const BIG CURVE_Gx= {0x5};
+const BIG CURVE_HTPC= {0x1FFFFFFE,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FDFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFF};
+#endif
+
+#if CHUNK==64
+
+using namespace B448_58;
+
+const int CURVE_Cof_I= 4;
+const BIG CURVE_Cof= {0x4L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_Order= {0x378C292AB5844F3L,0x3309CA37163D548L,0x1B49AED63690216L,0x3FDF3288FA7113BL,0x3FFFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFFL,0xFFFFFFFFFFL};
+const BIG CURVE_Gx= {0x5L};
+const BIG CURVE_HTPC= {0x3FFFFFFFFFFFFFEL,0x3FFFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFFL,0x3FBFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFFL,0x3FFFFFFFFFFL};
+
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_ANSSI.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_ANSSI.cpp
new file mode 100644
index 0000000..e2d6f30
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_ANSSI.cpp
@@ -0,0 +1,54 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "fp_ANSSI.h"
+
+namespace ANSSI {
+
+/* ANNSI Curve */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B256_28;
+
+// Base Bits= 28
+const BIG Modulus= {0x86E9C03,0xFCF353D,0x8CA6DE8,0xADBCABC,0x35B3961,0xE8CE424,0xF10126D,0xB3AD58,0x1FD178C,0xF};
+const BIG ROI= {0x86E9C02,0xFCF353D,0x8CA6DE8,0xADBCABC,0x35B3961,0xE8CE424,0xF10126D,0xB3AD58,0x1FD178C,0xF};
+const BIG R2modp= {0x288CC9C,0x18D2374,0x646BD2B,0x4929E67,0xD6F7F2D,0x220E6C1,0xABCE02E,0x751B1FD,0x7401B78,0xE};
+const chunk MConst= 0x64E1155;
+#endif
+
+#if CHUNK==64
+
+using namespace B256_56;
+
+// Base Bits= 56
+const BIG Modulus= {0xFCF353D86E9C03L,0xADBCABC8CA6DE8L,0xE8CE42435B3961L,0xB3AD58F10126DL,0xF1FD178CL};
+const BIG ROI= {0xFCF353D86E9C02L,0xADBCABC8CA6DE8L,0xE8CE42435B3961L,0xB3AD58F10126DL,0xF1FD178CL};
+const BIG R2modp= {0x18D2374288CC9CL,0x4929E67646BD2BL,0x220E6C1D6F7F2DL,0x751B1FDABCE02EL,0xE7401B78L};
+const chunk MConst= 0x97483A164E1155L;
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_BLS12381.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_BLS12381.cpp
new file mode 100644
index 0000000..f7fbfd0
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_BLS12381.cpp
@@ -0,0 +1,61 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "fp_BLS12381.h"
+
+namespace BLS12381 {
+
+/* Curve BLS12381 - Pairing friendly BLS curve */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B384_29;
+
+// Base Bits= 29
+const BIG Modulus= {0x1FFFAAAB,0xFF7FFFF,0x14FFFFEE,0x17FFFD62,0xF6241EA,0x9507B58,0xAFD9CC3,0x109E70A2,0x1764774B,0x121A5D66,0x12C6E9ED,0x12FFCD34,0x111EA3,0xD};
+const BIG ROI= {0x1FFFAAAA,0xFF7FFFF,0x14FFFFEE,0x17FFFD62,0xF6241EA,0x9507B58,0xAFD9CC3,0x109E70A2,0x1764774B,0x121A5D66,0x12C6E9ED,0x12FFCD34,0x111EA3,0xD};
+const BIG R2modp= {0x15BEF7AE,0x1031CD0E,0x2DD93E8,0x9226323,0xE6E2CD2,0x11684DAA,0x1170E5DB,0x88E25B1,0x1B366399,0x1C536F47,0xD1F9CBC,0x278B67F,0x1EA66A2B,0xC};
+const BIG CRu= {0x1FFEFFFE,0x100FFFFF,0x280008B,0xFB026C4,0x9688DE1,0x149DF37C,0x1FAB76CE,0xED41EE,0x11BA69C6,0x1EFBB672,0x17C659CB,0x0,0x0,0x0};
+const chunk MConst= 0x1FFCFFFD;
+const BIG Fra= {0x12235FB8,0x83BAF6C,0x19E04F63,0x1D4A7AC7,0xB9C4F67,0x1EBC25D,0x1D3DEC91,0x1FA797AB,0x1F0FD603,0x1016068,0x108C6FAD,0x5760CCF,0x104D3BF0,0xC};
+const BIG Frb= {0xDDC4AF3,0x7BC5093,0x1B1FB08B,0x1AB5829A,0x3C5F282,0x764B8FB,0xDBFB032,0x10F6D8F6,0x1854A147,0x1118FCFD,0x23A7A40,0xD89C065,0xFC3E2B3,0x0};
+const BIG SQRTm3= {0x1AAAE,0xFD80000,0xFFFFED7,0x189FAFDA,0x1C912627,0x14945F,0xBA6AF26,0xEC3ECC4,0x13EFA3BF,0x1422F081,0x33A3655,0x12FFCD33,0x111EA3,0xD};
+#endif
+
+#if CHUNK==64
+
+using namespace B384_58;
+// Base Bits= 58
+const BIG Modulus= {0x1FEFFFFFFFFAAABL,0x2FFFFAC54FFFFEEL,0x12A0F6B0F6241EAL,0x213CE144AFD9CC3L,0x2434BACD764774BL,0x25FF9A692C6E9EDL,0x1A0111EA3L};
+const BIG ROI= {0x1FEFFFFFFFFAAAAL,0x2FFFFAC54FFFFEEL,0x12A0F6B0F6241EAL,0x213CE144AFD9CC3L,0x2434BACD764774BL,0x25FF9A692C6E9EDL,0x1A0111EA3L};
+const BIG R2modp= {0x20639A1D5BEF7AEL,0x1244C6462DD93E8L,0x22D09B54E6E2CD2L,0x111C4B63170E5DBL,0x38A6DE8FB366399L,0x4F16CFED1F9CBCL,0x19EA66A2BL};
+const BIG CRu= {0x201FFFFFFFEFFFEL,0x1F604D88280008BL,0x293BE6F89688DE1L,0x1DA83DDFAB76CEL,0x3DF76CE51BA69C6L,0x17C659CBL,0x0L};
+const chunk MConst= 0x1F3FFFCFFFCFFFDL;
+const BIG Fra= {0x10775ED92235FB8L,0x3A94F58F9E04F63L,0x3D784BAB9C4F67L,0x3F4F2F57D3DEC91L,0x202C0D1F0FD603L,0xAEC199F08C6FADL,0x1904D3BF0L};
+const BIG Frb= {0xF78A126DDC4AF3L,0x356B0535B1FB08BL,0xEC971F63C5F282L,0x21EDB1ECDBFB032L,0x2231F9FB854A147L,0x1B1380CA23A7A40L,0xFC3E2B3L};
+const BIG SQRTm3= {0x1FB00000001AAAEL,0x313F5FB4FFFFED7L,0x2928BFC912627L,0x1D87D988BA6AF26L,0x2845E1033EFA3BFL,0x25FF9A6633A3655L,0x1A0111EA3L};
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_BLS12383.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_BLS12383.cpp
new file mode 100644
index 0000000..a5b8849
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_BLS12383.cpp
@@ -0,0 +1,64 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "fp_BLS12383.h"
+
+namespace BLS12383 {
+
+/* Curve BLS12383 - Pairing friendly BLS curve */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B384_29;
+
+// Base Bits= 29
+const BIG Modulus= {0x5AAB0AB,0x11B8EB24,0x19214AF6,0x187E5314,0x124F47A8,0x1C00B4B0,0x1446B0C6,0x59E6CB4,0x4A0AD46,0xFF5494,0x81B6B71,0x956DD6B,0x16556956,0x2A};
+const BIG ROI= {0x5AAB0AA,0x11B8EB24,0x19214AF6,0x187E5314,0x124F47A8,0x1C00B4B0,0x1446B0C6,0x59E6CB4,0x4A0AD46,0xFF5494,0x81B6B71,0x956DD6B,0x16556956,0x2A};
+const BIG R2modp= {0x116907F4,0x405B700,0x1752AC11,0x67A9E7C,0x1941C581,0x1AEA38C4,0xB1E4D22,0xCE841AE,0xA0FC49B,0xB4B1F48,0x13852312,0x1B3FDCED,0x1FECE397,0x26};
+
+const BIG CRu= {0xEAAC2A9,0x61B3A81,0x17D974B7,0xBED0345,0xA341BC2,0x17A51A6F,0x5738948,0x69B7BAE,0x14605445,0x374A43,0x8116AD1,0x956DD69,0x16556956,0x2A};
+const chunk MConst= 0x73435FD;
+const BIG Fra= {0x1311DAC1,0x296B969,0x19DCF806,0x126901FC,0xD8C8A36,0x1A2572A8,0xA1A0959,0x1A47F743,0x110E4C6C,0x1608DA97,0xCE2E7F0,0x4FED178,0xACD5BF0,0x11};
+const BIG Frb= {0x1298D5EA,0xF2231BA,0x1F4452F0,0x6155117,0x4C2BD72,0x1DB4208,0xA2CA76D,0xB567571,0x139260D9,0xAF679FC,0x1B388380,0x4580BF2,0xB880D66,0x19};
+const BIG SQRTm3= {0x17AAD4A8,0x1A7D89DE,0x16919E77,0x1F5BB376,0x218EFDB,0x1349802E,0x16A061CA,0x7988AA7,0x41FFB44,0x1F6F3FF3,0x8076A30,0x956DD67,0x16556956,0x2A};
+#endif
+
+#if CHUNK==64
+
+using namespace B384_58;
+
+// Base Bits= 58
+const BIG Modulus= {0x2371D6485AAB0ABL,0x30FCA6299214AF6L,0x3801696124F47A8L,0xB3CD969446B0C6L,0x1FEA9284A0AD46L,0x12ADBAD681B6B71L,0x556556956L};
+const BIG ROI= {0x2371D6485AAB0AAL,0x30FCA6299214AF6L,0x3801696124F47A8L,0xB3CD969446B0C6L,0x1FEA9284A0AD46L,0x12ADBAD681B6B71L,0x556556956L};
+const BIG R2modp= {0x80B6E0116907F4L,0xCF53CF9752AC11L,0x35D47189941C581L,0x19D0835CB1E4D22L,0x16963E90A0FC49BL,0x367FB9DB3852312L,0x4DFECE397L};
+
+const BIG CRu= {0xC367502EAAC2A9L,0x17DA068B7D974B7L,0x2F4A34DEA341BC2L,0xD36F75C5738948L,0x6E94874605445L,0x12ADBAD28116AD1L,0x556556956L};
+const chunk MConst= 0x1BC0571073435FDL;
+const BIG Fra= {0x52D72D3311DAC1L,0x24D203F99DCF806L,0x344AE550D8C8A36L,0x348FEE86A1A0959L,0x2C11B52F10E4C6CL,0x9FDA2F0CE2E7F0L,0x22ACD5BF0L};
+const BIG Frb= {0x1E446375298D5EAL,0xC2AA22FF4452F0L,0x3B684104C2BD72L,0x16ACEAE2A2CA76DL,0x15ECF3F939260D9L,0x8B017E5B388380L,0x32B880D66L};
+const BIG SQRTm3= {0x34FB13BD7AAD4A8L,0x3EB766ED6919E77L,0x2693005C218EFDBL,0xF31154F6A061CAL,0x3EDE7FE641FFB44L,0x12ADBACE8076A30L,0x556556956L};
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_BLS12443.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_BLS12443.cpp
new file mode 100644
index 0000000..a63e1a0
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_BLS12443.cpp
@@ -0,0 +1,62 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "fp_BLS12443.h"
+
+namespace BLS12443 {
+
+/* Curve BLS12443 - Pairing friendly BLS curve */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B448_29;
+
+// Base Bits= 29
+const BIG Modulus= {0x10AAAAAB,0x1FD55555,0x1921AAFF,0xA59AAAA,0x1424ABF7,0x19024801,0x1C42D855,0x96E429D,0x5119FF1,0x7855CAF,0x1020B3B1,0x4B6ABA4,0x92300A8,0x1054E434,0x1694F72C,0xAE};
+const BIG R2modp= {0x1118A8F7,0x1AB7CA8,0x2333712,0x132DCAD3,0x16E13882,0x10A03200,0x5B25363,0x9C87B7C,0xB9A40C9,0x975222C,0x28F658F,0x147AD511,0xF6028F0,0xBA52E95,0x262ED53,0x69};
+const BIG ROI= {0x10AAAAAA,0x1FD55555,0x1921AAFF,0xA59AAAA,0x1424ABF7,0x19024801,0x1C42D855,0x96E429D,0x5119FF1,0x7855CAF,0x1020B3B1,0x4B6ABA4,0x92300A8,0x1054E434,0x1694F72C,0xAE};
+const BIG SQRTm3= {0x14AAAAA8,0x1ED55556,0x16F7ACFF,0x6B6AA9,0x1E4D5046,0x1413E017,0x19DD9B9D,0x1E5F53AC,0x64B9158,0x1368614B,0x1F58A387,0x96E1519,0x8A07BAD,0x1054E434,0x1694F72C,0xAE};
+const BIG CRu= {0x2AAAAA9,0x1F555556,0x80CABFF,0x15628AAA,0x1938FE1E,0x168B140C,0xB1039F9,0x3E6CB25,0x5AE98A5,0xD76DEFD,0x7BCAB9C,0x1712605F,0x8E1BE2A,0x1054E434,0x1694F72C,0xAE};
+const chunk MConst= 0x15FFFFFD;
+const BIG Fra= {0x49551C8,0x9D8A27E,0x1FACD18F,0x10236D5E,0x1D38DC4B,0xA2FCECB,0x46BF1F0,0x1C2F955E,0x1029E275,0x7D8436E,0x13DD8C0,0x1C9052A0,0x1979B8C6,0x1F97223F,0xC24C77,0x88};
+const BIG Frb= {0xC1558E3,0x15FCB2D7,0x1974D970,0x1A363D4B,0x16EBCFAB,0xED27935,0x17D6E665,0xD3EAD3F,0x14E7BD7B,0x1FAD1940,0xEE2DAF0,0x8265904,0xFA947E1,0x10BDC1F4,0x15D2AAB4,0x26};
+#endif
+
+#if CHUNK==64
+
+using namespace B448_60;
+
+// Base Bits= 60
+const BIG Modulus= {0xFFAAAAAB0AAAAABL,0x752CD5556486ABFL,0x572049003424ABFL,0xF14B7214EF10B61L,0xEC4F0AB95E5119FL,0xA825B55D24082CL,0xDCB20A9C8689230L,0x575A53L};
+const BIG R2modp= {0xF5CDA0EB0AD64E2L,0xDE66AA74FAE046BL,0x8B9229B598075AEL,0xDFAFBC5DB0E321EL,0x9AF61017ADA96A8L,0xFFAEA657DE81FE0L,0x1800170F84B9395L,0x8E3DDL};
+const BIG ROI= {0xFFAAAAAB0AAAAAAL,0x752CD5556486ABFL,0x572049003424ABFL,0xF14B7214EF10B61L,0xEC4F0AB95E5119FL,0xA825B55D24082CL,0xDCB20A9C8689230L,0x575A53L};
+const BIG SQRTm3= {0xFDAAAAAD4AAAAA8L,0x6035B554DBDEB3FL,0x76827C02FE4D504L,0x58F2FA9D667766EL,0xE1E6D0C29664B91L,0xBAD4B70A8CFD628L,0xDCB20A9C8688A07L,0x575A53L};
+const BIG CRu= {0xFEAAAAAC2AAAAA9L,0xEAB145552032AFFL,0xE6D162819938FE1L,0xA51F36592AC40E7L,0xE71AEDBDFA5AE98L,0xE2AB89302F9EF2AL,0xDCB20A9C8688E1BL,0x575A53L};
+const chunk MConst= 0xC04000035FFFFFDL;
+const BIG Fra= {0xD3B144FC49551C8L,0xB811B6AF7EB3463L,0xC145F9D97D38DC4L,0x75E17CAAF11AFC7L,0x300FB086DD029E2L,0x8C6E48295004F76L,0x31DFF2E447F979BL,0x440309L};
+const BIG Frb= {0x2BF965AEC1558E3L,0xBD1B1EA5E5D365CL,0x95DA4F26B6EBCFAL,0x7B69F569FDF5B99L,0xBC3F5A32814E7BDL,0x7E14132C823B8B6L,0xAAD217B83E8FA94L,0x13574AL};
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_BLS12461.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_BLS12461.cpp
new file mode 100644
index 0000000..2c68a27
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_BLS12461.cpp
@@ -0,0 +1,62 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "fp_BLS12461.h"
+
+namespace BLS12461 {
+
+/* Curve BLS12461 - Pairing friendly BLS curve */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B464_28;
+
+// Base Bits= 28
+const BIG Modulus= {0xAAAAAAB,0xAC0000A,0x54AAAAA,0x5555,0x400020,0x91557F0,0xF26AA,0xFA5C1CC,0xB42A8DF,0x7B14848,0x8BACCA4,0x6F1E32D,0x4935FBD,0x55D6941,0xD5A555A,0x5545554,0x1555};
+const BIG ROI= {0xAAAAAAA,0xAC0000A,0x54AAAAA,0x5555,0x400020,0x91557F0,0xF26AA,0xFA5C1CC,0xB42A8DF,0x7B14848,0x8BACCA4,0x6F1E32D,0x4935FBD,0x55D6941,0xD5A555A,0x5545554,0x1555};
+const BIG R2modp= {0xC9B6A33,0x2ECD087,0x3CCB2B1,0xCD461FE,0x8CB5AB2,0xC5B9635,0x5312E92,0xB659F64,0x3B596FA,0x8679006,0xA92E2B3,0x3CE05E3,0x363550F,0x7C07A8E,0x382C083,0x6347FEA,0xBD};
+const BIG CRu= {0xFFFFFFE,0x40001F,0xFE00000,0xFFE7FFF,0xF0FFF6F,0x7200C47,0x7BCC604,0x15796DB,0xCF47771,0x9875433,0x613F0E8,0x5000502,0xEBFFF60,0x1FFFFF,0x0,0x0,0x0};
+const chunk MConst= 0xFFFFFFD;
+const BIG Fra= {0xB812A3A,0x7117BF9,0x99C400F,0xC6308A5,0x5BF8A1,0x510E075,0x45FA5A6,0xCE4858D,0x770B31A,0xBC2CB04,0xE2FC61E,0xD073588,0x4366190,0x4DFEFA8,0x69E55E2,0x504B7F,0x12E4};
+const BIG Frb= {0xF298071,0x3AE8410,0xBAE6A9B,0x39D4CAF,0xFE4077E,0x404777A,0xBAF8104,0x2C13C3E,0x3D1F5C5,0xBEE7D44,0xA8B0685,0x9EAADA4,0x5CFE2C,0x7D7999,0x6BBFF78,0x50409D5,0x271};
+const BIG SQRTm3= {0xAAAAAAE,0xA3FFFCA,0x58AAAAA,0x35555,0x2200140,0xAD53F60,0x959AA1,0xCF69415,0x159B9FD,0x4A29FE1,0xC92EAD3,0xCF1D928,0x71360FC,0x51D6941,0xD5A555A,0x5545554,0x1555};
+#endif
+
+#if CHUNK==64
+
+using namespace B464_60;
+
+// Base Bits= 60
+const BIG Modulus= {0xAAC0000AAAAAAABL,0x20000555554AAAAL,0x6AA91557F004000L,0xA8DFFA5C1CC00F2L,0xACCA47B14848B42L,0x935FBD6F1E32D8BL,0xD5A555A55D69414L,0x15555545554L};
+const BIG ROI= {0xAAC0000AAAAAAAAL,0x20000555554AAAAL,0x6AA91557F004000L,0xA8DFFA5C1CC00F2L,0xACCA47B14848B42L,0x935FBD6F1E32D8BL,0xD5A555A55D69414L,0x15555545554L};
+const BIG R2modp= {0x96D08774614DDA8L,0xCD45F539225D5BDL,0xD712EB760C95AB1L,0xB3B687155F30B55L,0xC4E62A05C3F5B81L,0xBA1151676CA3CD0L,0x7EDD8A958F442BEL,0x12B89DD3F91L};
+const BIG CRu= {0x40001FFFFFFFEL,0x6FFFE7FFFFE0000L,0x6047200C47F0FFFL,0x777115796DB7BCCL,0x3F0E89875433CF4L,0xBFFF60500050261L,0x1FFFFFEL,0x0L};
+const chunk MConst= 0xC0005FFFFFFFDL;
+const BIG Fra= {0xF7117BF9B812A3AL,0xA1C6308A599C400L,0x5A6510E07505BF8L,0xB31ACE4858D45FAL,0xFC61EBC2CB04770L,0x366190D073588E2L,0x69E55E24DFEFA84L,0x12E40504B7FL};
+const BIG Frb= {0xB3AE8410F298071L,0x7E39D4CAFBAE6A9L,0x104404777AFE407L,0xF5C52C13C3EBAF8L,0xB0685BEE7D443D1L,0x5CFE2C9EAADA4A8L,0x6BBFF7807D79990L,0x27150409D5L};
+const BIG SQRTm3= {0xAA3FFFCAAAAAAAEL,0x40003555558AAAAL,0xAA1AD53F6022001L,0xB9FDCF694150959L,0x2EAD34A29FE1159L,0x1360FCCF1D928C9L,0xD5A555A51D69417L,0x15555545554L};
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_BLS24479.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_BLS24479.cpp
new file mode 100644
index 0000000..413382d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_BLS24479.cpp
@@ -0,0 +1,62 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "fp_BLS24479.h"
+
+namespace BLS24479 {
+
+/* Curve BLS24479 - Pairing friendly BLS curve */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B480_29;
+
+const BIG Modulus= {0xA06152B,0x2260B3A,0xB4C36BE,0x5FFC5D0,0xBDB6A64,0x5B78E2E,0x1C1A28CA,0x10E6441B,0x1F244061,0xB4704F0,0x141E5CCD,0x9837504,0x3F2E77E,0xD763740,0x1316EA0E,0xF0079,0x555C};
+const BIG ROI= {0xA06152A,0x2260B3A,0xB4C36BE,0x5FFC5D0,0xBDB6A64,0x5B78E2E,0x1C1A28CA,0x10E6441B,0x1F244061,0xB4704F0,0x141E5CCD,0x9837504,0x3F2E77E,0xD763740,0x1316EA0E,0xF0079,0x555C};
+const BIG R2modp= {0x8533EA9,0x6A02789,0x183B24DE,0x1E45ECF8,0xC8F8F37,0x10CAD209,0x4C0C4B8,0x9B1FABD,0xDEBE4C0,0xDC353F9,0x18A18E26,0x10F489BB,0x31206A5,0x19673BBF,0x6BE69F9,0xB091169,0x9CD};
+const BIG CRu= {0xDD794A9,0x1DE138A3,0x2BCCE90,0xC746127,0x15223DDC,0x1DD8890B,0xED08DB7,0xE24B9F,0xE379CE6,0x37011AC,0x11BAC820,0x1EEFAD01,0x200860F,0x147218A6,0xF16A209,0xF0079,0x555C};
+const chunk MConst= 0x95FE7D;
+const BIG Fra= {0x1BF96F1D,0xAE53A55,0x31BFEEB,0x183FF17A,0x6237469,0x12A4F4F1,0x12101FE3,0x16E79D94,0xFF59267,0x5EB4EB4,0x78CC49F,0x274BA33,0x149184F3,0x16C6DCBA,0x1C90B694,0x10F729CE,0x4BBC};
+const BIG Frb= {0xE0CA60E,0x1740D0E4,0x83037D2,0xDBFD456,0x5B7F5FA,0x1312993D,0xA0A08E6,0x19FEA687,0xF2EADF9,0x55BB63C,0xC91982E,0x70EBAD1,0xF61628B,0x16AF5A85,0x16863379,0xF17D6AA,0x99F};
+const BIG SQRTm3= {0x11A91428,0x199C660C,0x1A2D6663,0x12E8FC7D,0x1E691154,0x15F983E8,0x186F2A5,0x10DE5323,0x1D4AF96A,0x1B991E67,0xF573372,0x145BE4FE,0xE24A1,0x1B6DFA0C,0xB165A04,0xF0079,0x555C};
+const BIG TWK= {0x16EA62F3,0x52C4905,0x17CF5F35,0x13967138,0x16BCA61B,0xF766FBB,0x9B547D6,0x11625BCD,0x1AFF154D,0xDE4D18C,0xF9C3EF8,0x84619DC,0x15E18EE4,0x1D55B149,0xED04681,0x64CDD9E,0x337A};
+#endif
+
+#if CHUNK==64
+
+using namespace B480_56;
+// Base Bits= 56
+const BIG Modulus= {0x44C1674A06152BL,0xFFE2E82D30DAF8L,0x6F1C5CBDB6A642L,0x3220DF068A328BL,0xE09E1F24406187L,0xBA825079733568L,0x6E803F2E77E4C1L,0x3CCC5BA839AECL,0x555C0078L};
+const BIG ROI= {0x44C1674A06152AL,0xFFE2E82D30DAF8L,0x6F1C5CBDB6A642L,0x3220DF068A328BL,0xE09E1F24406187L,0xBA825079733568L,0x6E803F2E77E4C1L,0x3CCC5BA839AECL,0x555C0078L};
+const BIG R2modp= {0x6A4A1FE013DF5BL,0xE8E46D4D1BDE65L,0x1F841391F45C67L,0x9148A4516FB28L,0x4398524EDF4C88L,0x41C0E241B6DCE8L,0xE42C208C19411L,0xA7FE6FD73A7B1CL,0xFCCCA76L};
+const BIG CRu= {0xBC27146DD794A9L,0x3A30938AF33A43L,0xB112175223DDC6L,0x125CFBB4236DFBL,0x2358E379CE607L,0xD680C6EB20806EL,0x314C200860FF77L,0x3CBC5A88268E4L,0x555C0078L};
+const chunk MConst= 0xBD5D7D8095FE7DL;
+const BIG Fra= {0x5CA74ABBF96F1DL,0x1FF8BD0C6FFBADL,0x49E9E26237469CL,0x3CECA48407F8E5L,0x69D68FF59267B7L,0x5D199E33127CBDL,0xB97549184F313AL,0x4E77242DA52D8DL,0x4BBC87B9L};
+const BIG Frb= {0xE81A1C8E0CA60EL,0xDFEA2B20C0DF4AL,0x25327A5B7F5FA6L,0xF5343A828239A6L,0x76C78F2EADF9CFL,0x5D68B24660B8ABL,0xB50AF61628B387L,0xB555A18CDE6D5EL,0x99F78BEL};
+const BIG SQRTm3= {0x338CC191A91428L,0x747E3EE8B5998FL,0xF307D1E6911549L,0xF2991861BCA96BL,0x23CCFD4AF96A86L,0xF27F3D5CCDCB73L,0xF41800E24A1A2DL,0x3CAC5968136DBL,0x555C0078L};
+const BIG TWK= {0xA58920B6EA62F3L,0xCB389C5F3D7CD4L,0xECDF776BCA61B9L,0x12DE6A6D51F59EL,0x9A319AFF154D8BL,0xCEE3E70FBE1BCL,0x62935E18EE4423L,0xECF3B411A07AABL,0x337A3266L};
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_BLS48286.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_BLS48286.cpp
new file mode 100644
index 0000000..7966399
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_BLS48286.cpp
@@ -0,0 +1,64 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "fp_BLS48286.h"
+
+namespace BLS48286 {
+
+/* Curve BLS48286 - Pairing friendly BLS curve */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B288_29;
+
+// Base Bits= 29
+const BIG Modulus= {0x9C345B,0x13A815C9,0x38D4B67,0xC8388A5,0x4809AAF,0x63F0D60,0x516A1B2,0x16040390,0x11EC7BD7,0x14B9629};
+const BIG R2modp= {0x8484275,0x16B4A09C,0x13973525,0x19DBD350,0x188DE1C0,0x111BD51D,0x113A0F92,0x6489CAD,0xF188E5E,0xCED0C0};
+const BIG ROI= {0x9C345A,0x13A815C9,0x38D4B67,0xC8388A5,0x4809AAF,0x63F0D60,0x516A1B2,0x16040390,0x11EC7BD7,0x14B9629};
+const BIG CRu= {0x3773F7B,0xD329CB0,0xC2BB8E5,0x99D4594,0x667A6F2,0x1945AD4C,0x159AC407,0x20C33EA,0x332B8D8,0x14B921E};
+const chunk MConst= 0x16EA242D;
+const BIG Fra= {0x1FC90183,0x15434AF9,0xF4FA4DB,0xAAD7DA3,0x8F09A7C,0x81F7813,0x1F8010F6,0x9D15D85,0xC522C11,0x6CA0BF};
+const BIG Frb= {0xD332D8,0x1E64CACF,0x143DA68B,0x1D60B01,0x1B900033,0x1E1F954C,0x59690BB,0xC32A60A,0x59A4FC6,0xDEF56A};
+const BIG SQRTm3= {0x6524A9C,0x6BD2397,0x14CA2663,0x6B70283,0x84EB335,0xC4C4D38,0x61EE65D,0xE146445,0x1478F5D8,0x14B8E12};
+const BIG TWK= {0x3D05DCC,0x13ECB9AE,0x10A9C2E6,0x132E0A8A,0x1AA2C6A1,0x65E8A65,0x19C887EF,0xA33E6E6,0xF448A33,0xE9076F};
+#endif
+
+#if CHUNK==64
+
+using namespace B288_60;
+
+// Base Bits= 60
+const BIG Modulus= {0xE7502B9209C345BL,0xF641C4528E352D9L,0xC8C7E1AC04809AAL,0xD7B0201C8145A86L,0x2972C531EC7BL};
+const BIG R2modp= {0x61F9539D245AF2CL,0xA1991A6E51410D8L,0x1603A99FC661885L,0xC8A2CE485CD7822L,0xD54A6F0B25EL};
+const BIG ROI= {0xE7502B9209C345AL,0xF641C4528E352D9L,0xC8C7E1AC04809AAL,0xD7B0201C8145A86L,0x2972C531EC7BL};
+const BIG CRu= {0x5A6539603773F7BL,0x24CEA2CA30AEE39L,0x1F28B5A98667A6FL,0xD810619F5566B10L,0x297243C332B8L};
+const chunk MConst= 0x227E5D8F6EA242DL;
+const BIG Fra= {0xEA8695F3FC90183L,0xC556BED1BD3E936L,0xD903EF0268F09A7L,0x114E8AEC2FE0043L,0xD9417EC522CL};
+const BIG Frb= {0xFCC9959E0D332D8L,0x30EB0580D0F69A2L,0xEFC3F2A99B90003L,0xC66195305165A42L,0x1BDEAD459A4FL};
+const BIG SQRTm3= {0xCD7A472E6524A9CL,0x535B8141D328998L,0x758989A7084EB33L,0xD870A3222987B99L,0x2971C25478F5L};
+const BIG TWK= {0xA7D9735C3D05DCCL,0x1997054542A70B9L,0xBCCBD14CBAA2C6AL,0x33519F37367221FL,0x1D20EDEF448AL};
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_BLS48556.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_BLS48556.cpp
new file mode 100644
index 0000000..66b5331
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_BLS48556.cpp
@@ -0,0 +1,64 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "fp_BLS48556.h"
+
+namespace BLS48556 {
+
+/* Curve BLS48556 - Pairing friendly BLS curve */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B560_29;
+
+// Base Bits= 29
+const BIG Modulus= {0x1CF6AC0B,0x17B7307F,0x19877E7B,0x12CE0134,0x14228402,0x1BD4C386,0x1DACBB04,0x40410D0,0x25A415,0x980B53E,0xDE6E250,0x15D9AAD6,0x5DA950,0x1029B7A,0x54AB351,0x14AD90CE,0x3729047,0x1FE7E2D9,0x145F610B,0x1F};
+const BIG ROI= {0x1CF6AC0A,0x17B7307F,0x19877E7B,0x12CE0134,0x14228402,0x1BD4C386,0x1DACBB04,0x40410D0,0x25A415,0x980B53E,0xDE6E250,0x15D9AAD6,0x5DA950,0x1029B7A,0x54AB351,0x14AD90CE,0x3729047,0x1FE7E2D9,0x145F610B,0x1F};
+const BIG R2modp= {0xD59D0FA,0x12F01FD0,0xDE8FD41,0x35AAEE1,0xB937F48,0x50700E8,0x1F50EFCE,0x1019B13C,0x3470A2F,0x11094115,0xF9FB72D,0x6AD10E2,0x1CFD9F8,0x44F4785,0x2B48793,0x1148ED3,0xF609E61,0x1EE34BC7,0x1735D29E,0x0};
+const BIG CRu= {0xCBBA429,0x1B273F3,0xD3DD160,0x19C61452,0x308093A,0x146E1E34,0xAE0E768,0x1185948,0x1B73BC2D,0x93D855C,0x1B1A639C,0x118C919B,0xFF04AE3,0xF1CCD77,0x91318E5,0x10644780,0x3A79F7,0x1BE77919,0x145F60F3,0x1F};
+const chunk MConst= 0x9DA805D;
+const BIG Fra= {0x1325BF89,0x1311E7EC,0xCD0A56F,0x1A0FD46E,0xE83BCCA,0xCA97DD0,0x18D1D297,0x5F1E137,0x7AB9F2C,0x13FC255F,0x1C9DECEB,0x9DEF4A2,0x3C0F60B,0x1D9909E4,0x1FF27FF7,0x1DBF8208,0x89BB36C,0x40044E0,0x62E01EE,0x5};
+const BIG Frb= {0x1325BF89,0x1311E7EC,0xCD0A56F,0x1A0FD46E,0xE83BCCA,0xCA97DD0,0x18D1D297,0x5F1E137,0x7AB9F2C,0x13FC255F,0x1C9DECEB,0x9DEF4A2,0x3C0F60B,0x1D9909E4,0x1FF27FF7,0x1DBF8208,0x89BB36C,0x40044E0,0x62E01EE,0x5};
+const BIG SQRTm3= {0x1C809C48,0xBADB766,0xF42444,0xBE2770,0x11ED8E73,0xD0778E1,0x181513CC,0x1E2CA1BF,0x16C1D444,0x8FA557B,0x84DE4E8,0xD3F7861,0x1F82EC76,0x1D36FF74,0xCDB7E79,0xC1AFE32,0x1D0263A7,0x17E70F58,0x145F60DB,0x1F};
+const BIG TWK= {0x16F9937,0x9133D51,0xD89F92B,0x17A682C,0x16600368,0x1830F509,0x1531266E,0x159D972D,0x1C269C72,0x46E0687,0xCAA903,0x1EEF4D3A,0xED502F8,0x1046B2AB,0x1EC6EF4F,0xFD93805,0x1EEEDD57,0xD0AFF3F,0xC83E724,0x8};
+#endif
+
+#if CHUNK==64
+
+using namespace B560_58;
+
+// Base Bits= 58
+const BIG Modulus= {0x2F6E60FFCF6AC0BL,0x259C02699877E7BL,0x37A9870D4228402L,0x80821A1DACBB04L,0x13016A7C025A415L,0x2BB355ACDE6E250L,0x20536F405DA950L,0x295B219C54AB351L,0x3FCFC5B23729047L,0x3F45F610BL};
+const BIG ROI= {0x2F6E60FFCF6AC0AL,0x259C02699877E7BL,0x37A9870D4228402L,0x80821A1DACBB04L,0x13016A7C025A415L,0x2BB355ACDE6E250L,0x20536F405DA950L,0x295B219C54AB351L,0x3FCFC5B23729047L,0x3F45F610BL};
+const BIG R2modp= {0x25E03FA0D59D0FAL,0x6B55DC2DE8FD41L,0xA0E01D0B937F48L,0x20336279F50EFCEL,0x2212822A3470A2FL,0xD5A21C4F9FB72DL,0x89E8F0A1CFD9F8L,0x2291DA62B48793L,0x3DC6978EF609E61L,0x1735D29EL};
+const BIG CRu= {0x364E7E6CBBA429L,0x338C28A4D3DD160L,0x28DC3C68308093AL,0x230B290AE0E768L,0x127B0AB9B73BC2DL,0x23192337B1A639CL,0x1E399AEEFF04AE3L,0x20C88F0091318E5L,0x37CEF23203A79F7L,0x3F45F60F3L};
+const chunk MConst= 0x21BFCBCA9DA805DL;
+const BIG Fra= {0x2623CFD9325BF89L,0x341FA8DCCD0A56FL,0x1952FBA0E83BCCAL,0xBE3C26F8D1D297L,0x27F84ABE7AB9F2CL,0x13BDE945C9DECEBL,0x3B3213C83C0F60BL,0x3B7F0411FF27FF7L,0x80089C089BB36CL,0xA62E01EEL};
+const BIG Frb= {0x2623CFD9325BF89L,0x341FA8DCCD0A56FL,0x1952FBA0E83BCCAL,0xBE3C26F8D1D297L,0x27F84ABE7AB9F2CL,0x13BDE945C9DECEBL,0x3B3213C83C0F60BL,0x3B7F0411FF27FF7L,0x80089C089BB36CL,0xA62E01EEL};
+const BIG SQRTm3= {0x175B6ECDC809C48L,0x17C4EE00F42444L,0x1A0EF1C31ED8E73L,0x3C59437F81513CCL,0x11F4AAF76C1D444L,0x1A7EF0C284DE4E8L,0x3A6DFEE9F82EC76L,0x1835FC64CDB7E79L,0x2FCE1EB1D0263A7L,0x3F45F60DBL};
+const BIG TWK= {0x12267AA216F9937L,0x2F4D058D89F92BL,0x3061EA136600368L,0x2B3B2E5B531266EL,0x8DC0D0FC269C72L,0x3DDE9A740CAA903L,0x208D6556ED502F8L,0x1FB2700BEC6EF4FL,0x1A15FE7FEEEDD57L,0x10C83E724L};
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_BLS48581.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_BLS48581.cpp
new file mode 100644
index 0000000..f0af263
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_BLS48581.cpp
@@ -0,0 +1,64 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "fp_BLS48581.h"
+
+namespace BLS48581 {
+
+/* Curve BLS48581 - Pairing friendly BLS curve */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B584_29;
+
+// Base Bits= 29
+const BIG Modulus= {0x565912B,0x16E0AA73,0x12922B0F,0x1FBEE434,0xEE0A578,0x12A898B8,0xBDA0D9E,0x9E8E6DB,0x19CD3039,0x17041566,0x2B90EBD,0xEA88949,0xC0F1F39,0x18DD9DF3,0x1E344884,0xADD09,0x1D47012A,0x9C12718,0x1CD1DBCC,0x501EE7F,0x1};
+const BIG ROI= {0x565912A,0x16E0AA73,0x12922B0F,0x1FBEE434,0xEE0A578,0x12A898B8,0xBDA0D9E,0x9E8E6DB,0x19CD3039,0x17041566,0x2B90EBD,0xEA88949,0xC0F1F39,0x18DD9DF3,0x1E344884,0xADD09,0x1D47012A,0x9C12718,0x1CD1DBCC,0x501EE7F,0x1};
+const BIG R2modp= {0x19BCC5B0,0x126A343E,0xA46F6C0,0x29B7799,0xB758510,0x1357043D,0x1DC2D482,0x115A8C75,0x1F6CA5F6,0x9B40365,0x16E1C7DB,0x1A304684,0xA85F60F,0x16E21141,0x1D5AE21,0xD9EA745,0x1641FB69,0x249C4AC,0xA2B23E1,0x14FCE472,0x0};
+const BIG CRu= {0x1C79B90,0x6F4D62F,0x3977A09,0x19B1C7F1,0x1421A205,0x190FBA7B,0x16D758AA,0x129736C1,0x2F43166,0x115AFDC,0x1E9AA9CD,0xD508D6B,0xBED6FF4,0x1360F2FE,0x95960F5,0x709E55F,0x1F4E2096,0x2AEEAE8,0xB1A2DD4,0x0,0x0};
+const chunk MConst= 0x39D5A7D;
+const BIG Fra= {0x42AEB25,0x1175B67F,0x182B4FE5,0x1683284E,0x115ECE4D,0x1EF92B83,0x22B03E9,0x6EF6A24,0x8C41890,0x4249F0E,0x61F9A1,0xC60FC53,0x16B62F49,0x71E57E,0xF9E161D,0xFA08F30,0x1E55F606,0x1AE6BF39,0x140527E9,0x1FA61B6,0x0};
+const BIG Frb= {0x42AEB25,0x1175B67F,0x182B4FE5,0x1683284E,0x115ECE4D,0x1EF92B83,0x22B03E9,0x6EF6A24,0x8C41890,0x4249F0E,0x61F9A1,0xC60FC53,0x16B62F49,0x71E57E,0xF9E161D,0xFA08F30,0x1E55F606,0x1AE6BF39,0x140527E9,0x1FA61B6,0x0};
+const BIG SQRTm3= {0x1D65A0A,0x8F6FE15,0xB6336FD,0xC5B5452,0x69D616D,0x8923C1,0x1E2B5C49,0x4BA7957,0x13E4CD6C,0x14D8B5AE,0x583BB23,0x14076E71,0x14343F50,0x121BB7F6,0xB818699,0x11F7124B,0x1EAABFFD,0x4635146,0x69D8024,0x501EE7F,0x1};
+const BIG TWK= {0x1F426953,0x1DA19E92,0xEE618F5,0x159C8B24,0xD37E160,0x145DEFD1,0xD2F0630,0x1FF9915F,0x2C4F62,0xDA1C978,0x51E0598,0x4FD2A34,0x132462ED,0x13341DC2,0x81D59C2,0x19374271,0x1D9EAEB8,0x1ABB4E6E,0xDEF0401,0x74CB4A,0x0};
+#endif
+
+#if CHUNK==64
+
+using namespace B584_60;
+
+// Base Bits= 60
+const BIG Modulus= {0xEDC154E6565912BL,0x8FDF721A4A48AC3L,0x7A5513170EE0A57L,0x394F4736DAF6836L,0xAF6E082ACD9CD30L,0xF3975444A48AE43L,0x22131BB3BE6C0F1L,0x12A0056E84F8D1L,0x76F313824E31D47L,0x1280F73FF34L};
+const BIG ROI= {0xEDC154E6565912AL,0x8FDF721A4A48AC3L,0x7A5513170EE0A57L,0x394F4736DAF6836L,0xAF6E082ACD9CD30L,0xF3975444A48AE43L,0x22131BB3BE6C0F1L,0x12A0056E84F8D1L,0x76F313824E31D47L,0x1280F73FF34L};
+const BIG R2modp= {0x79868479F1B5833L,0xFB6EBA8FCB82D07L,0x9CC8A7F1FD84C7FL,0x402C51CF5CC3CBBL,0x3F3114F078502CL,0xFC90829BDC8336EL,0xC7BE91DE9CA8EEDL,0xD4D273BB17BFADBL,0x6EC7C9A81E792CAL,0x1DC317A6E4L};
+const BIG CRu= {0x4DE9AC5E1C79B90L,0x5CD8E3F88E5DE82L,0xAB21F74F7421A20L,0x6694B9B60DB5D62L,0x73422B5FB82F431L,0xFF46A846B5FA6AAL,0x83D66C1E5FCBED6L,0x2096384F2AFA565L,0x8B75055DD5D1F4EL,0x2C6L};
+const chunk MConst= 0x148B81FC39D5A7DL;
+const BIG Fra= {0x62EB6CFE42AEB25L,0xDB41942760AD3F9L,0xA7DF2570715ECE4L,0x90377B51208AC0FL,0x6848493E1C8C418L,0xF496307E298187EL,0x58740E3CAFD6B62L,0xF6067D047983E78L,0x49FA75CD7E73E55L,0xFD30DB501L};
+const BIG Frb= {0x62EB6CFE42AEB25L,0xDB41942760AD3F9L,0xA7DF2570715ECE4L,0x90377B51208AC0FL,0x6848493E1C8C418L,0xF496307E298187EL,0x58740E3CAFD6B62L,0xF6067D047983E78L,0x49FA75CD7E73E55L,0xFD30DB501L};
+const BIG SQRTm3= {0x51EDFC2A1D65A0AL,0xD62DAA292D8CDBFL,0x24112478269D616L,0x6C25D3CABF8AD71L,0xC8E9B16B5D3E4CDL,0xF50A03B738960EEL,0x1A664376FED4343L,0xBFFD8FB8925AE06L,0x600908C6A28DEAAL,0x1280F73F9A7L};
+const BIG TWK= {0x7B433D25F426953L,0xACE45923B9863DL,0xC28BBDFA2D37E16L,0x62FFCC8AFB4BC18L,0x661B4392F002C4FL,0x2ED27E951A14781L,0x670A6683B853246L,0xAEB8C9BA138A075L,0xC10075769CDDD9EL,0x3A65A537BL};
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_BN158.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_BN158.cpp
new file mode 100644
index 0000000..7e0d583
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_BN158.cpp
@@ -0,0 +1,63 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "fp_BN158.h"
+
+namespace BN158 {
+
+/* Curve BN158 - Pairing friendly BN curve */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B160_28;
+
+// Base Bits= 28
+const BIG Modulus= {0xB04E013,0x72280A,0xFD3FB95,0x9953CF6,0x27628C,0x24012};
+const BIG R2modp= {0x545973D,0xA60739B,0x65DB288,0x526165,0xB226C,0x17315};
+const BIG ROI= {0xB04E012,0x72280A,0xFD3FB95,0x9953CF6,0x27628C,0x24012};
+const BIG SQRTm3= {0x8018004,0x7F0E404,0x99F4CE2,0x95F35CA,0x2761FC,0x24012};
+const BIG CRu= {0x181B007,0x440A203,0x31A5759,0x1B0396,0x48,0x0};
+const chunk MConst= 0x4F615E5;
+const BIG Fra= {0x6ECE2A9,0xA167429,0x99296F2,0xE1BF21C,0xCF82A02,0xA85E};
+const BIG Frb= {0x417FD6A,0x65BB3E1,0x64164A2,0xB794ADA,0x32F3889,0x197B3};
+#endif
+
+#if CHUNK==64
+
+using namespace B160_56;
+
+// Base Bits= 56
+const BIG Modulus= {0x72280AB04E013L,0x9953CF6FD3FB95L,0x24012027628CL};
+const BIG R2modp= {0xA60739B545973DL,0x52616565DB288L,0x1731500B226CL};
+const BIG ROI= {0x72280AB04E012L,0x9953CF6FD3FB95L,0x24012027628CL};
+const BIG SQRTm3= {0x7F0E4048018004L,0x95F35CA99F4CE2L,0x2401202761FCL};
+const BIG CRu= {0x440A203181B007L,0x1B039631A5759L,0x48L};
+const chunk MConst= 0xFC609004F615E5L;
+const BIG Fra= {0xA1674296ECE2A9L,0xE1BF21C99296F2L,0xA85ECF82A02L};
+const BIG Frb= {0x65BB3E1417FD6AL,0xB794ADA64164A2L,0x197B332F3889L};
+
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_BN254.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_BN254.cpp
new file mode 100644
index 0000000..9588d4a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_BN254.cpp
@@ -0,0 +1,73 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "fp_BN254.h"
+
+namespace BN254 {
+
+/* Curve BN254 - Pairing friendly BN curve */
+
+/* Nogami's fast curve */
+
+#if CHUNK==16
+
+using namespace B256_13;
+
+// Base Bits= 13
+const BIG Modulus= {0x13,0x0,0x0,0x0,0x1A70,0x9,0x0,0x0,0x100,0x309,0x2,0x0,0x1800,0x1A26,0x6E8,0x0,0x0,0x412,0x8D9,0x4A};
+const BIG ROI= {0x12,0x0,0x0,0x0,0x1A70,0x9,0x0,0x0,0x100,0x309,0x2,0x0,0x1800,0x1A26,0x6E8,0x0,0x0,0x412,0x8D9,0x4A};
+const BIG R2modp= {0xF32,0x239,0x14DC,0xCE8,0x928,0x11B6,0x130F,0x1183,0x56E,0x1AEE,0x124F,0xD2A,0x7F8,0x1CE6,0x1B50,0x77C,0x3A,0x1A9E,0x1EFD,0x1C};
+const BIG CRu= {0x7,0x0,0x0,0x0,0xCD8,0x3,0x0,0x0,0x900,0x1248,0x0,0x0,0x400,0x19B1,0x126,0x0,0x0,0x0,0x0,0x0};
+const chunk MConst= 0x15E5;
+const BIG Fra= {0xDE9,0x1953,0x101B,0x1BCD,0xE17,0x1BE1,0x14FD,0x1249,0x974,0x1C28,0x54F,0x108D,0x150A,0x4CD,0x12D9,0xF91,0x12E,0x10C9,0xDDD,0x36};
+const BIG Frb= {0x122A,0x6AC,0xFE4,0x432,0xC58,0x428,0xB02,0xDB6,0x178B,0x6E0,0x1AB2,0xF72,0x2F5,0x1559,0x140F,0x106E,0x1ED1,0x1348,0x1AFB,0x13};
+const BIG SQRTm3= {0x4,0x0,0x0,0x0,0xC0,0x3,0x0,0x0,0xF00,0x1E78,0x0,0x0,0x1000,0x6C4,0x49B,0x0,0x0,0x412,0x8D9,0x4A};
+#endif
+
+#if CHUNK==32
+
+using namespace B256_28;
+
+// Base Bits= 28
+const BIG Modulus= {0x13,0x0,0x13A7,0x0,0x86121,0x8000000,0x1BA344D,0x4000000,0x5236482,0x2};
+const BIG ROI= {0x12,0x0,0x13A7,0x0,0x86121,0x8000000,0x1BA344D,0x4000000,0x5236482,0x2};
+const BIG R2modp= {0xF5E7E39,0x2F2A96F,0xB96F13C,0x64E8642,0xC7146,0x9926F7B,0x4DACD24,0x8321E7B,0xD127A2E,0x1};
+const BIG CRu= {0x7,0x8000000,0x6CD,0x0,0x24909,0x4000000,0x49B362,0x0,0x0,0x0};
+const chunk MConst= 0x79435E5;
+const BIG Fra= {0xF2A6DE9,0x7DE6C06,0xF77C2E1,0x74924D3,0x53F8509,0x50A8469,0xCB6499B,0x212E7C8,0xB377619,0x1};
+const BIG Frb= {0xD5922A,0x82193F9,0x8850C5,0x8B6DB2C,0xAC8DC17,0x2F57B96,0x503EAB2,0x1ED1837,0x9EBEE69,0x0};
+const BIG SQRTm3= {0x4,0x0,0x60C,0x0,0x3CF0F,0x0,0x126CD89,0x4000000,0x5236482,0x2};
+#endif
+
+#if CHUNK==64
+
+using namespace B256_56;
+
+// Base Bits= 56
+const BIG Modulus= {0x13L,0x13A7L,0x80000000086121L,0x40000001BA344DL,0x25236482L};
+const BIG ROI= {0x12L,0x13A7L,0x80000000086121L,0x40000001BA344DL,0x25236482L};
+const BIG R2modp= {0x2F2A96FF5E7E39L,0x64E8642B96F13CL,0x9926F7B00C7146L,0x8321E7B4DACD24L,0x1D127A2EL};
+const BIG CRu= {0x80000000000007L,0x6CDL,0x40000000024909L,0x49B362L,0x0L};
+const chunk MConst= 0x435E50D79435E5L;
+const BIG Fra= {0x7DE6C06F2A6DE9L,0x74924D3F77C2E1L,0x50A846953F8509L,0x212E7C8CB6499BL,0x1B377619L};
+const BIG Frb= {0x82193F90D5922AL,0x8B6DB2C08850C5L,0x2F57B96AC8DC17L,0x1ED1837503EAB2L,0x9EBEE69L};
+const BIG SQRTm3= {0x4L,0x60CL,0x3CF0FL,0x4000000126CD89L,0x25236482L};
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_BN254CX.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_BN254CX.cpp
new file mode 100644
index 0000000..6eaa2f5
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_BN254CX.cpp
@@ -0,0 +1,72 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "fp_BN254CX.h"
+
+namespace BN254CX {
+
+/* Curve BN254CX - Pairing friendly BN curve */
+
+/* CertiVox BN curve/field  */
+
+#if CHUNK==16
+
+using namespace B256_13;
+
+// Base Bits= 13
+const BIG Modulus= {0x15B3,0xDA,0x1BD7,0xC47,0x1BE6,0x1F70,0x24,0x1DC3,0x1FD6,0x1921,0x19B4,0x14C6,0x1647,0x1EEF,0x16C2,0x541,0x870,0x0,0x0,0x48};
+const BIG ROI= {0x15B2,0xDA,0x1BD7,0xC47,0x1BE6,0x1F70,0x24,0x1DC3,0x1FD6,0x1921,0x19B4,0x14C6,0x1647,0x1EEF,0x16C2,0x541,0x870,0x0,0x0,0x48};
+const BIG R2modp= {0x1527,0x146B,0x12A7,0x1A60,0x1E0A,0x1382,0x2BC,0x1D3F,0xB30,0xA8,0xD19,0x11AB,0x1D40,0x1965,0xD6D,0x643,0x10FF,0x1BC7,0x1E61,0x31};
+const BIG CRu= {0x1C97,0x11A,0x5E5,0x126,0x31E,0x3AB,0x7BE,0xC8E,0x1DDF,0x205,0xFC5,0x1950,0x0,0x0,0x120,0x0,0x0,0x0,0x0,0x0};
+const chunk MConst= 0x1E85;
+const BIG Fra= {0xEA3,0xE40,0xCD5,0x1210,0x15BD,0x1C10,0x5CF,0x4DE,0x773,0x343,0x626,0x194E,0x18AA,0x10C5,0x12BF,0x2C,0x63A,0x17D,0x1642,0x26};
+const BIG Frb= {0x710,0x129A,0xF01,0x1A37,0x628,0x360,0x1A55,0x18E4,0x1863,0x15DE,0x138E,0x1B78,0x1D9C,0xE29,0x403,0x515,0x236,0x1E83,0x9BD,0x21};
+const BIG SQRTm3= {0x1C84,0x1EA4,0x100C,0x9FB,0x15AA,0x181A,0x10A8,0x4A6,0x418,0x1516,0x1A2A,0x225,0x1646,0x1EEF,0x1482,0x541,0x870,0x0,0x0,0x48};
+#endif
+
+#if CHUNK==32
+
+using namespace B256_28;
+
+// Base Bits= 28
+const BIG Modulus= {0xC1B55B3,0x6623EF5,0x93EE1BE,0xD6EE180,0x6D3243F,0x647A636,0xDB0BDDF,0x8702A0,0x4000000,0x2};
+const BIG ROI= {0xC1B55B2,0x6623EF5,0x93EE1BE,0xD6EE180,0x6D3243F,0x647A636,0xDB0BDDF,0x8702A0,0x4000000,0x2};
+const BIG R2modp= {0x8A0800A,0x466A061,0x43056A3,0x2B3A225,0x9C6600,0x148515B,0x6BDF50,0xEC9EA56,0xC992E66,0x1};
+const chunk MConst= 0x9789E85;
+const BIG Fra= {0x5C80EA3,0xD908335,0x3F8215B,0x7326F17,0x8986867,0x8AACA71,0x4AFE18B,0xA63A016,0x359082F,0x1};
+const BIG Frb= {0x6534710,0x8D1BBC0,0x546C062,0x63C7269,0xE3ABBD8,0xD9CDBC4,0x900DC53,0x623628A,0xA6F7D0,0x1};
+const BIG SQRTm3= {0x3D49C84,0xA4FDC03,0xA30355A,0x1825342,0x8AAA2C4,0x646112E,0xD20BDDF,0x8702A0,0x4000000,0x2};
+
+#endif
+
+#if CHUNK==64
+
+using namespace B256_56;
+
+// Base Bits= 56
+const BIG Modulus= {0x6623EF5C1B55B3L,0xD6EE18093EE1BEL,0x647A6366D3243FL,0x8702A0DB0BDDFL,0x24000000L};
+const BIG ROI= {0x6623EF5C1B55B2L,0xD6EE18093EE1BEL,0x647A6366D3243FL,0x8702A0DB0BDDFL,0x24000000L};
+const BIG R2modp= {0x466A0618A0800AL,0x2B3A22543056A3L,0x148515B09C6600L,0xEC9EA5606BDF50L,0x1C992E66L};
+const chunk MConst= 0x4E205BF9789E85L;
+const BIG Fra= {0xD9083355C80EA3L,0x7326F173F8215BL,0x8AACA718986867L,0xA63A0164AFE18BL,0x1359082FL};
+const BIG Frb= {0x8D1BBC06534710L,0x63C7269546C062L,0xD9CDBC4E3ABBD8L,0x623628A900DC53L,0x10A6F7D0L};
+const BIG SQRTm3= {0xA4FDC033D49C84L,0x1825342A30355AL,0x646112E8AAA2C4L,0x8702A0D20BDDFL,0x24000000L};
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_BN462.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_BN462.cpp
new file mode 100644
index 0000000..e3af5c1
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_BN462.cpp
@@ -0,0 +1,62 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "fp_BN462.h"
+
+namespace BN462 {
+
+/* Curve BN462 - Pairing friendly BN curve */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B464_28;
+
+// Base Bits= 28
+const BIG Modulus= {0x138013,0x1B0084,0x24,0xF640000,0xC6FF687,0xF6FF66F,0xFFFFFFF,0xC8020FF,0x2908F41,0xD81,0xA000000,0xB7D9BFC,0x6FF0CF6,0xFFFFFFF,0x23FFF,0x8036012,0x2404};
+const BIG ROI= {0x138012,0x1B0084,0x24,0xF640000,0xC6FF687,0xF6FF66F,0xFFFFFFF,0xC8020FF,0x2908F41,0xD81,0xA000000,0xB7D9BFC,0x6FF0CF6,0xFFFFFFF,0x23FFF,0x8036012,0x2404};
+const BIG R2modp= {0x88F9612,0xC8B9999,0x247088C,0xDB3ACD5,0xCA792EF,0x6E92E73,0x34F5999,0x4273E13,0x6714A6A,0xCBFE239,0xA0E2617,0x2487CB3,0xBE0EA3C,0x97791E4,0x8A07DE5,0x56CFA97,0x373};
+const BIG CRu= {0x4235C97,0xE093179,0xF875631,0xDF6471E,0xF1440BD,0xCA83,0x480000,0x0,0x0,0x0};
+const chunk MConst= 0x11BB5E5;
+const BIG Fra= {0x2575D1A,0xE4BE3FF,0x659DBDE,0xFC7D89,0x93FA118,0xD45D1D,0xCC78D9,0x6217331,0xD547C05,0xC792504,0x9A87E11,0x92ED03A,0x1727085,0xB5A8CC1,0xB40BCFD,0xF4348CB,0x16F};
+const BIG Frb= {0x55FF85B,0x204AE09,0x57BEB62,0x9023886,0xD630A20,0xF94F4B,0x84FF0D0,0x14A1A7A,0xB1DBADB,0xB00D8E4,0x1E85F7,0x7493CA0,0x68325B2,0x2008E6B,0xE90EA88,0x7F80940,0x23C3};
+const BIG SQRTm3= {0x210022,0x2400CC,0x24,0xEF80000,0xB07F12F,0xF6FF4BF,0xFFFFFFF,0x7C032FF,0x440AEC2,0xD81,0x8000000,0xDFD2FFB,0x6FF03F5,0xFFFFFFF,0x23FFF,0x8036012,0x2404};
+#endif
+
+#if CHUNK==64
+
+using namespace B464_60;
+
+// Base Bits= 60
+const BIG Modulus= {0x401B00840138013L,0x87F640000000002L,0xFFFF6FF66FC6FF6L,0x8F41C8020FFFFFFL,0xD81290L,0xFF0CF6B7D9BFCA0L,0x23FFFFFFFFFF6L,0x24048036012L};
+const BIG ROI= {0x401B00840138012L,0x87F640000000002L,0xFFFF6FF66FC6FF6L,0x8F41C8020FFFFFFL,0xD81290L,0xFF0CF6B7D9BFCA0L,0x23FFFFFFFFFF6L,0x24048036012L};
+const BIG R2modp= {0x89118D28DC21038L,0x1C24CD524708896L,0x96F6AF594FD13D3L,0xFC17B3AFB34F599L,0x617CBFE0F54B3BCL,0x105034B613F1E2L,0x47E597791E4CB9L,0x12EACA995DAL};
+const BIG CRu= {0xE0931794235C97L,0xDF6471EF875631L,0xCA83F1440BDL,0x480000L,0x0L};
+const chunk MConst= 0x718CE9E711BB5E5L;
+const BIG Fra= {0xEE4BE3FF2575D1AL,0x180FC7D89659DBDL,0x8D90D45D1D93FA1L,0x7C0562173310CC7L,0x87E11C792504D54L,0x72708592ED03A9AL,0xB40BCFDB5A8CC11L,0x16FF4348CBL};
+const BIG Frb= {0x2204AE0955FF85BL,0x20902388657BEB6L,0xD00F94F4BD630AL,0xBADB14A1A7A84FFL,0xE85F7B00D8E4B1DL,0x8325B27493CA001L,0xE90EA882008E6B6L,0x23C37F80940L};
+const BIG SQRTm3= {0x402400CC0210022L,0x2FEF80000000002L,0xFFFF6FF4BFB07F1L,0xAEC27C032FFFFFFL,0xD81440L,0xFF03F5DFD2FFB80L,0x23FFFFFFFFFF6L,0x24048036012L};
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_BRAINPOOL.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_BRAINPOOL.cpp
new file mode 100644
index 0000000..008745f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_BRAINPOOL.cpp
@@ -0,0 +1,54 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "fp_BRAINPOOL.h"
+
+namespace BRAINPOOL {
+
+/* Brainpool Modulus  */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B256_28;
+
+// Base Bits= 28
+const BIG Modulus= {0xF6E5377,0x13481D1,0x6202820,0xF623D52,0xD726E3B,0x909D838,0xC3E660A,0xA1EEA9B,0x9FB57DB,0xA};
+const BIG ROI= {0xF6E5376,0x13481D1,0x6202820,0xF623D52,0xD726E3B,0x909D838,0xC3E660A,0xA1EEA9B,0x9FB57DB,0xA};
+const BIG R2modp= {0xB9A3787,0x9E04F49,0x8F3CF49,0x2931721,0xF1DBC89,0x54E8C3C,0xF7559CA,0xBB411A3,0x773E15F,0x9};
+const chunk MConst= 0xEFD89B9;
+#endif
+
+#if CHUNK==64
+
+using namespace B256_56;
+
+// Base Bits= 56
+const BIG Modulus= {0x13481D1F6E5377L,0xF623D526202820L,0x909D838D726E3BL,0xA1EEA9BC3E660AL,0xA9FB57DBL};
+const BIG ROI= {0x13481D1F6E5376L,0xF623D526202820L,0x909D838D726E3BL,0xA1EEA9BC3E660AL,0xA9FB57DBL};
+const BIG R2modp= {0x9E04F49B9A3787L,0x29317218F3CF49L,0x54E8C3CF1DBC89L,0xBB411A3F7559CAL,0x9773E15FL};
+const chunk MConst= 0xA75590CEFD89B9L;
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_C1174.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_C1174.cpp
new file mode 100644
index 0000000..dbbf0f5
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_C1174.cpp
@@ -0,0 +1,54 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "fp_C1174.h"
+
+namespace C1174 {
+
+/* Curve C1174 */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B256_29;
+
+// Base Bits= 29
+const BIG Modulus= {0x1FFFFFF7,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x7FFFF};
+const BIG R2modp= {0x5100000,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG ROI= {0x1FFFFFF6,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x7FFFF};
+const chunk MConst= 0x9;
+#endif
+
+#if CHUNK==64
+
+using namespace B256_56;
+
+// Base Bits= 56
+const BIG Modulus= {0xFFFFFFFFFFFFF7L,0xFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFL,0x7FFFFFFL};
+const BIG R2modp= {0x0L,0x144L,0x0L,0x0L,0x0L};
+const BIG ROI= {0xFFFFFFFFFFFFF6L,0xFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFL,0x7FFFFFFL};
+const chunk MConst= 0x9L;
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_C1665.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_C1665.cpp
new file mode 100644
index 0000000..1f2dea3
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_C1665.cpp
@@ -0,0 +1,54 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "fp_C1665.h"
+
+namespace C1665 {
+
+/* Curve C1665 */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B168_29;
+
+// Base Bits= 29
+const BIG Modulus= {0x1FFFFFFB,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFF};
+const BIG R2modp= {0x190000,0x0,0x0,0x0,0x0,0x0};
+const BIG ROI= {0x1FFFFFFA,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFF};
+const chunk MConst= 0x5;
+#endif
+
+#if CHUNK==64
+
+using namespace B168_60;
+
+// Base Bits= 60
+const BIG Modulus= {0xFFFFFFFFFFFFFFBL,0xFFFFFFFFFFFFFFFL,0x3FFFFFFFFFFFL};
+const BIG R2modp= {0x190000000L,0x0L,0x0L};
+const BIG ROI= {0xFFFFFFFFFFFFFFAL,0xFFFFFFFFFFFFFFFL,0x3FFFFFFFFFFFL};
+const chunk MConst= 0x5L;
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_C41417.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_C41417.cpp
new file mode 100644
index 0000000..0c03263
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_C41417.cpp
@@ -0,0 +1,54 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "fp_C41417.h"
+
+namespace C41417 {
+
+/* Curve C41417 */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B416_29;
+
+// Base Bits= 29
+const BIG Modulus= {0x1FFFFFEF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0xFF};
+const BIG ROI= {0x1FFFFFEE,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0xFF};
+const BIG R2modp= {0x0,0x242000,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const chunk MConst= 0x11;
+#endif
+
+#if CHUNK==64
+
+using namespace B416_60;
+
+// Base Bits= 60
+const BIG Modulus= {0xFFFFFFFFFFFFFEFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFL};
+const BIG ROI= {0xFFFFFFFFFFFFFEEL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFL};
+const BIG R2modp= {0x121000L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const chunk MConst= 0x11L;
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_F25519.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_F25519.cpp
new file mode 100644
index 0000000..67ae9e2
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_F25519.cpp
@@ -0,0 +1,64 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "fp_F25519.h"
+
+
+namespace F25519 {
+/* Curve 25519 */
+
+#if CHUNK==16
+
+using namespace B256_13;
+
+// Base Bits= 13
+const BIG Modulus= {0x1FED,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0xFF};
+const BIG ROI= {0xB0,0x1075,0x9D2,0x1C36,0xC4E,0x123C,0x14BF,0xD5,0x318,0x197A,0x15E9,0x1BF7,0x993,0x680,0xCAD,0x1BE1,0xFC1,0x402,0xC9,0x57};
+const BIG R2modp= {0x400,0x2D,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const chunk MConst= 0x13;
+
+#endif
+
+#if CHUNK==32
+
+using namespace B256_29;
+
+// Base Bits= 29
+const BIG Modulus= {0x1FFFFFED,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x7FFFFF};
+const BIG ROI= {0xA0EA0B0,0x770D93A,0xBF91E31,0x6300D5A,0x1D7A72F4,0x4C9EFD,0x1C2CAD34,0x1009F83B,0x2B8324};
+const BIG R2modp= {0x169000,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const chunk MConst= 0x13;
+
+
+#endif
+
+#if CHUNK==64
+
+using namespace B256_56;
+
+// Base Bits= 56
+const BIG Modulus= {0xFFFFFFFFFFFFEDL,0xFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFL,0x7FFFFFFFL};
+const BIG ROI= {0xEE1B274A0EA0B0L,0x1806AD2FE478C4L,0x993DFBD7A72F43L,0x4FC1DF0B2B4D00L,0x2B832480L};
+const BIG R2modp= {0xA4000000000000L,0x5L,0x0L,0x0L,0x0L};
+const chunk MConst= 0x13L;
+
+
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_F256PME.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_F256PME.cpp
new file mode 100644
index 0000000..4fc103f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_F256PME.cpp
@@ -0,0 +1,62 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "fp_F256PME.h"
+
+namespace F256PME {
+
+/* NUMS 256-bit modulus */
+
+
+#if CHUNK==16
+
+using namespace B256_13;
+
+// Base Bits= 13
+const BIG Modulus= {0x1F43,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FF};
+const BIG ROI= {0x1F42,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FF};
+const BIG R2modp= {0x900,0x45C,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const chunk MConst= 0xBD;
+#endif
+
+#if CHUNK==32
+
+using namespace B256_29;
+
+// Base Bits= 29
+const BIG Modulus= {0x1FFFFF43,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0xFFFFFF};
+const BIG ROI= {0x1FFFFF42,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0xFFFFFF};
+const BIG R2modp= {0x22E2400,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const chunk MConst= 0xBD;
+
+#endif
+
+#if CHUNK==64
+
+using namespace B256_56;
+
+// Base Bits= 56
+const BIG Modulus= {0xFFFFFFFFFFFF43L,0xFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFL,0xFFFFFFFFL};
+const BIG ROI= {0xFFFFFFFFFFFF42L,0xFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFL,0xFFFFFFFFL};
+const BIG R2modp= {0x89000000000000L,0x8BL,0x0L,0x0L,0x0L};
+const chunk MConst= 0xBDL;
+
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_F256PMW.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_F256PMW.cpp
new file mode 100644
index 0000000..8314087
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_F256PMW.cpp
@@ -0,0 +1,56 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "fp_F256PMW.h"
+
+namespace F256PMW {
+
+/* NUMS 256-bit modulus */
+
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B256_28;
+
+// Base Bits= 28
+const BIG Modulus= {0xFFFFF43,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xF};
+const BIG ROI= {0xFFFFF42,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xF};
+const BIG R2modp= {0x0,0x8900000,0x8B,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const chunk MConst= 0xBD;
+#endif
+
+#if CHUNK==64
+
+using namespace B256_56;
+
+// Base Bits= 56
+const BIG Modulus= {0xFFFFFFFFFFFF43L,0xFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFL,0xFFFFFFFFL};
+const BIG ROI= {0xFFFFFFFFFFFF42L,0xFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFL,0xFFFFFFFFL};
+const BIG R2modp= {0x89000000000000L,0x8BL,0x0L,0x0L,0x0L};
+const chunk MConst= 0xBDL;
+
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_F384PM.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_F384PM.cpp
new file mode 100644
index 0000000..4331717
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_F384PM.cpp
@@ -0,0 +1,55 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "fp_F384PM.h"
+
+namespace F384PM {
+
+/* NUMS 384-bit modulus */
+
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B384_29;
+
+// Base Bits= 29
+const BIG Modulus= {0x1FFFFEC3,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x7F};
+const BIG ROI= {0x1FFFFEC2,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x7F};
+const BIG R2modp= {0x0,0x4448000,0x6,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const chunk MConst= 0x13D;
+#endif
+
+#if CHUNK==64
+
+using namespace B384_58;
+
+// Base Bits= 58
+const BIG Modulus= {0x3FFFFFFFFFFFEC3L,0x3FFFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFFL,0xFFFFFFFFFL};
+const BIG R2modp= {0x88900000000000L,0x6L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const BIG ROI= {0x3FFFFFFFFFFFEC2L,0x3FFFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFFL,0xFFFFFFFFFL};
+const chunk MConst= 0x13DL;
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_F448.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_F448.cpp
new file mode 100644
index 0000000..15d291e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_F448.cpp
@@ -0,0 +1,58 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "fp_F448.h"
+
+namespace F448 {
+
+/* Curve Ed448 */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B448_29;
+
+// Base Bits= 29
+const BIG Modulus= {0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FDFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFF};
+const BIG ROI=     {0x1FFFFFFE,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FDFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFF};
+const BIG R2modp= {0x0,0x10,0x0,0x0,0x0,0x0,0x0,0x0,0x3000000,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const chunk MConst= 0x1;
+//const int BTset= 224;
+
+#endif
+
+#if CHUNK==64
+
+using namespace B448_58;
+
+// Base Bits= 58
+const BIG Modulus= {0x3FFFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFFL,0x3FBFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFFL,0x3FFFFFFFFFFL};
+const BIG ROI=     {0x3FFFFFFFFFFFFFEL,0x3FFFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFFL,0x3FBFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFFL,0x3FFFFFFFFFFL};
+const BIG R2modp= {0x200000000L,0x0L,0x0L,0x0L,0x3000000L,0x0L,0x0L,0x0L};
+const chunk MConst= 0x1L;
+//const int BTset=224;
+
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_F512PM.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_F512PM.cpp
new file mode 100644
index 0000000..40388c3
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_F512PM.cpp
@@ -0,0 +1,55 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "fp_F512PM.h"
+
+namespace F512PM {
+
+/* NUMS 512-bit modulus */
+
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B512_29;
+
+// Base Bits= 29
+const BIG Modulus= {0x1FFFFDC7,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x7FFFF};
+const BIG ROI= {0x1FFFFDC6,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x7FFFF};
+const BIG R2modp= {0xB100000,0x278,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const chunk MConst= 0x239;
+#endif
+
+#if CHUNK==64
+
+using namespace B512_60;
+
+// Base Bits= 60
+const BIG Modulus= {0xFFFFFFFFFFFFDC7L,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFL};
+const BIG R2modp= {0x100000000000000L,0x4F0BL,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const BIG ROI= {0xFFFFFFFFFFFFDC6L,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFL};
+const chunk MConst= 0x239L;
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_FP256BN.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_FP256BN.cpp
new file mode 100644
index 0000000..fa66c7a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_FP256BN.cpp
@@ -0,0 +1,67 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "fp_FP256BN.h"
+
+namespace FP256BN {
+
+/* Curve FP512BN - Pairing friendly BN curve */
+
+/* ISO curve */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B256_28;
+
+// Base Bits= 28
+
+const BIG Modulus= {0xED33013,0x292DDBA,0x80A82D3,0x65FB129,0x49F0CDC,0x5EEE71A,0xD46E5F2,0xFFFCF0C,0xFFFFFFF,0xF};
+const BIG ROI= {0xED33012,0x292DDBA,0x80A82D3,0x65FB129,0x49F0CDC,0x5EEE71A,0xD46E5F2,0xFFFCF0C,0xFFFFFFF,0xF};
+const BIG R2modp= {0x3B9F8B,0xEDE3363,0xFEC54E8,0x92FFEE9,0x3C55F79,0x13C1C06,0xC0123FA,0xA12F2EA,0xE559B2A,0x8};
+const chunk MConst= 0x537E5E5;
+const BIG CRu= {0x3A1B807,0x1C0A24A,0x32D1EDB,0xD79DF19,0x8659BCD,0x4092101,0x13988E1,0x0,0x0,0x0};
+const BIG Fra= {0xF943106,0x760328A,0xAB28F74,0x71511E3,0x7CF39A1,0x8DDB086,0x52D1A6E,0xCA786F3,0xD617662,0x3};
+const BIG Frb= {0xF3EFF0D,0xB32AB2F,0xD57F35E,0xF4A9F45,0xCCFD33A,0xD113693,0x819CB83,0x3584819,0x29E899D,0xC};
+const BIG SQRTm3= {0x78FC004,0xF119926,0x1B0451C,0xB6BF2F7,0x3D3D540,0xDDCA517,0xAD3D42F,0xFFFCF0C,0xFFFFFFF,0xF};
+
+#endif
+
+#if CHUNK==64
+
+using namespace B256_56;
+
+// Base Bits= 56
+const BIG Modulus= {0x292DDBAED33013L,0x65FB12980A82D3L,0x5EEE71A49F0CDCL,0xFFFCF0CD46E5F2L,0xFFFFFFFFL};
+const BIG ROI= {0x292DDBAED33012L,0x65FB12980A82D3L,0x5EEE71A49F0CDCL,0xFFFCF0CD46E5F2L,0xFFFFFFFFL};
+const BIG R2modp= {0xEDE336303B9F8BL,0x92FFEE9FEC54E8L,0x13C1C063C55F79L,0xA12F2EAC0123FAL,0x8E559B2AL};
+const chunk MConst= 0x6C964E0537E5E5L;
+const BIG CRu= {0x1C0A24A3A1B807L,0xD79DF1932D1EDBL,0x40921018659BCDL,0x13988E1L,0x0L};
+const BIG Fra= {0x760328AF943106L,0x71511E3AB28F74L,0x8DDB0867CF39A1L,0xCA786F352D1A6EL,0x3D617662L};
+const BIG Frb= {0xB32AB2FF3EFF0DL,0xF4A9F45D57F35EL,0xD113693CCFD33AL,0x3584819819CB83L,0xC29E899DL};
+const BIG SQRTm3= {0xF11992678FC004L,0xB6BF2F71B0451CL,0xDDCA5173D3D540L,0xFFFCF0CAD3D42FL,0xFFFFFFFFL};
+
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_FP512BN.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_FP512BN.cpp
new file mode 100644
index 0000000..e26c498
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_FP512BN.cpp
@@ -0,0 +1,69 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "fp_FP512BN.h"
+
+namespace FP512BN {
+
+/* Curve FP512BN - Pairing friendly BN curve */
+
+/* ISO curve */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B512_29;
+
+// Base Bits= 29
+
+const BIG Modulus= {0x2ADEF33,0x7594049,0x131919ED,0x14AB9CBE,0x16FE1916,0x12EF5591,0x2E39231,0x3D597D3,0x55146CF,0x88D877A,0x102EF8F0,0x1196A60F,0x1C60BA1D,0x1CF63F80,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x7FFFF};
+const BIG ROI= {0x2ADEF32,0x7594049,0x131919ED,0x14AB9CBE,0x16FE1916,0x12EF5591,0x2E39231,0x3D597D3,0x55146CF,0x88D877A,0x102EF8F0,0x1196A60F,0x1C60BA1D,0x1CF63F80,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x7FFFF};
+const BIG R2modp= {0xFD68B47,0xFCF5D2C,0x437675A,0x1BBC3FBF,0x1411E413,0x13453559,0x10B5639,0x1C34CE79,0x6D476BF,0xFD05F2B,0x15D17C28,0x6C9F76E,0x1C2375B3,0x78CCE9B,0x15F0AB33,0x1960F32E,0x1A8D44E,0x57A38};
+const chunk MConst= 0x1CCC5C05;
+const BIG CRu= {0x1C79298A,0x1838B104,0x2C5F052,0x1DCCF337,0x6092AEC,0x4B35F29,0x1EB361E,0x11384EA,0x3074B20,0x17BB08FD,0x3A8B3E3,0xD70D66F,0x3D2A614,0x1CF63EE4,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x7FFFF};
+const BIG Fra= {0x14B73AB2,0x4B0BD8F,0xABB47D,0x2A29EC4,0x18681E17,0x104069DE,0x12EED67D,0x1553D0A5,0x398E9F8,0x7971034,0xAC9AF23,0x52DEF23,0x14EA18A5,0x1463E345,0x6DE465A,0x17F212B4,0x1AA9CF5B,0xF7B8};
+const BIG Frb= {0xDF6B481,0x2A882B9,0x126D6570,0x1208FDFA,0x1E95FAFF,0x2AEEBB2,0xFF4BBB4,0xE81C72D,0x1B85CD6,0xF67746,0x56549CD,0xC68B6EC,0x776A178,0x8925C3B,0x1921B9A5,0x80DED4B,0x55630A4,0x70847};
+const BIG SQRTm3= {0x164463E2,0x91821C0,0x1272C6B8,0x6EE49AF,0x15143CC3,0x167768C0,0xF2DA0A,0x1E517201,0xBD4F70,0x6E88A80,0x17226ED7,0x94B06CE,0xB44920B,0x1CF63E47,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x7FFFF};
+
+
+#endif
+
+#if CHUNK==64
+
+using namespace B512_60;
+
+// Base Bits= 60
+
+const BIG Modulus= {0x4EB280922ADEF33L,0x6A55CE5F4C6467BL,0xC65DEAB236FE191L,0xCF1EACBE98B8E48L,0x3C111B0EF455146L,0xA1D8CB5307C0BBEL,0xFFFF9EC7F01C60BL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFL};
+const BIG ROI= {0x4EB280922ADEF32L,0x6A55CE5F4C6467BL,0xC65DEAB236FE191L,0xCF1EACBE98B8E48L,0x3C111B0EF455146L,0xA1D8CB5307C0BBEL,0xFFFF9EC7F01C60BL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFL};
+const BIG R2modp= {0x1FA6DCEF99812E9L,0xAB3452895A0B74EL,0xC53EA988C079E1EL,0x1E90E033BA630B9L,0xF1EA41C0714D8B0L,0xE72785387509E28L,0xD86794F834DAB00L,0x9757C2ACCD342A1L,0x44ECB079L};
+const chunk MConst= 0x692A189FCCC5C05L;
+const BIG CRu= {0xB0716209C79298AL,0xCEE6799B8B17C14L,0x78966BE526092AEL,0x20089C27507ACD8L,0xF8EF7611FA3074BL,0x6146B86B378EA2CL,0xFFFF9EC7DC83D2AL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFL};
+const BIG Fra= {0x49617B1F4B73AB2L,0x71514F6202AED1FL,0xF6080D3BD8681E1L,0xF8AA9E852CBBB59L,0xC8CF2E2068398E9L,0x8A5296F791AB26BL,0x196A8C7C68B4EA1L,0xCF5BBF9095A1B79L,0x1EF71AA9L};
+const BIG Frb= {0x5510572DF6B481L,0xF9047EFD49B595CL,0xD055DD765E95FAFL,0xD6740E396BFD2EEL,0x7341ECEE8C1B85CL,0x1786345B7615952L,0xE695124B876776AL,0x30A4406F6A5E486L,0xE108E556L};
+const BIG SQRTm3= {0x1230438164463E2L,0x337724D7C9CB1AEL,0x2ACEED1815143CCL,0x70F28B90083CB68L,0xB5CDD115000BD4FL,0x20B4A583675C89BL,0xFFFF9EC7C8EB449L,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFL};
+
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_HIFIVE.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_HIFIVE.cpp
new file mode 100644
index 0000000..924cd1f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_HIFIVE.cpp
@@ -0,0 +1,55 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "fp_HIFIVE.h"
+
+namespace HIFIVE {
+
+/* Curve HIFIVE */
+
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B336_29;
+
+// Base Bits= 29
+const BIG Modulus= {0x1FFFFFFD,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFF};
+const BIG ROI= {0x1559D3B8,0x1C02413F,0xFAB18DA,0x128A7172,0xB95DA4C,0x16D4FE54,0x3107D87,0xAA7BEF3,0x1C38B2B4,0x1A93C08F,0x10F80C7B,0x1F27F};
+const BIG R2modp= {0x9000000,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const chunk MConst= 0x3;
+#endif
+
+#if CHUNK==64
+
+using namespace B336_60;
+
+// Base Bits= 60
+const BIG Modulus= {0xFFFFFFFFFFFFFFDL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFL};
+const BIG ROI= {0xB804827F559D3B8L,0xC94538B93EAC636L,0x1EDA9FCA8B95DA4L,0xB4553DF798C41F6L,0x1EF527811FC38B2L,0xF93FC3E03L};
+const BIG R2modp= {0x9000000000000L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const chunk MConst= 0x3L;
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_JUBJUB.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_JUBJUB.cpp
new file mode 100644
index 0000000..a20171f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_JUBJUB.cpp
@@ -0,0 +1,54 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "fp_JUBJUB.h"
+
+namespace JUBJUB {
+
+/* JUBJUB Modulus  */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B256_29;
+
+// Base Bits= 29
+const BIG Modulus= {0x1,0x1FFFFFF8,0x1F96FFBF,0x1B4805FF,0x1D80553B,0xC0404D0,0x1520CCE7,0xA6533AF,0x73EDA7};
+const BIG ROI= {0xB912F1F,0x1BC47A80,0xCF82506,0x49FE4E1,0xD6C0C40,0x16E468B4,0xDBC3F55,0x13CB682D,0x212D7};
+const BIG R2modp= {0xA71B3C0,0x1D32207E,0x1663D999,0x1C5ABC93,0x3B58C44,0xBE37438,0x829F771,0x1660139E,0x27FD91};
+const chunk MConst= 0x1FFFFFFF;
+#endif
+
+#if CHUNK==64
+
+using namespace B256_56;
+
+// Base Bits= 56
+const BIG Modulus= {0xFFFFFF00000001L,0xA402FFFE5BFEFFL,0x809A1D80553BDL,0x299D7D483339D8L,0x73EDA753L};
+const BIG ROI= {0x788F500B912F1FL,0x4FF270B3E0941BL,0xC8D168D6C0C402L,0x5B416B6F0FD56DL,0x212D79EL};
+const BIG R2modp= {0x3B3440EC31BBA9L,0x8929657E045FB0L,0x2D645CF57C6E1AL,0xEA6A1C5012ECF5L,0x3C7B9D12L};
+const chunk MConst= 0xFFFFFEFFFFFFFFL;
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_MDC.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_MDC.cpp
new file mode 100644
index 0000000..a193694
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_MDC.cpp
@@ -0,0 +1,54 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "fp_MDC.h"
+
+namespace MDC {
+
+/* Million Dollar Curve */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B256_28;
+
+// Base Bits= 28
+const BIG Modulus= {0x779EC13,0x3710405,0x7AF9EC1,0x9037EF0,0xD4F086A,0xFDD7A5F,0x4532F92,0xD456AFB,0x13B68B9,0xF};
+const BIG R2modp= {0xDA5D1FE,0xDE5B77F,0x2985975,0x3228385,0x95FA423,0xA24A9FC,0xA869FAE,0x6853D0E,0xEC4B765,0x3};
+const BIG ROI= {0x779EC12,0x3710405,0x7AF9EC1,0x9037EF0,0xD4F086A,0xFDD7A5F,0x4532F92,0xD456AFB,0x13B68B9,0xF};
+const chunk MConst= 0xAE541E5;
+#endif
+
+#if CHUNK==64
+
+using namespace B256_56;
+
+// Base Bits= 56
+const BIG Modulus= {0x3710405779EC13L,0x9037EF07AF9EC1L,0xFDD7A5FD4F086AL,0xD456AFB4532F92L,0xF13B68B9L};
+const BIG R2modp= {0xDE5B77FDA5D1FEL,0x32283852985975L,0xA24A9FC95FA423L,0x6853D0EA869FAEL,0x3EC4B765L};
+const BIG ROI= {0x3710405779EC12L,0x9037EF07AF9EC1L,0xFDD7A5FD4F086AL,0xD456AFB4532F92L,0xF13B68B9L};
+const chunk MConst= 0xF10FDDAAE541E5L;
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_NIST256.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_NIST256.cpp
new file mode 100644
index 0000000..234638e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_NIST256.cpp
@@ -0,0 +1,55 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "fp_NIST256.h"
+
+namespace NIST256 {
+
+/* Curve NIST256 */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B256_28;
+
+// Base Bits= 28
+const BIG Modulus= {0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFF,0x0,0x0,0x1000000,0x0,0xFFFFFFF,0xF};
+const BIG ROI= {0xFFFFFFE,0xFFFFFFF,0xFFFFFFF,0xFFF,0x0,0x0,0x1000000,0x0,0xFFFFFFF,0xF};
+const BIG R2modp= {0x50000,0x300000,0x0,0x0,0xFFFFFFA,0xFFFFFBF,0xFFFFEFF,0xFFFAFFF,0x2FFFF,0x0};
+const chunk MConst= 0x1;
+#endif
+
+#if CHUNK==64
+
+using namespace B256_56;
+
+// Base Bits= 56
+const BIG Modulus= {0xFFFFFFFFFFFFFFL,0xFFFFFFFFFFL,0x0L,0x1000000L,0xFFFFFFFFL};
+const BIG ROI= {0xFFFFFFFFFFFFFEL,0xFFFFFFFFFFL,0x0L,0x1000000L,0xFFFFFFFFL};
+const BIG R2modp= {0x3000000050000L,0x0L,0xFFFFFBFFFFFFFAL,0xFFFAFFFFFFFEFFL,0x2FFFFL};
+const chunk MConst= 0x1L;
+
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_NIST384.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_NIST384.cpp
new file mode 100644
index 0000000..59d5672
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_NIST384.cpp
@@ -0,0 +1,55 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "fp_NIST384.h"
+
+namespace NIST384 {
+
+/* Curve NIST384 */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B384_29;
+
+// Base Bits= 29
+const BIG Modulus= {0x1FFFFFFF,0x7,0x0,0x1FFFFE00,0x1FFFEFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x7F};
+const BIG ROI= {0x1FFFFFFE,0x7,0x0,0x1FFFFE00,0x1FFFEFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x7F};
+const BIG R2modp= {0x0,0x8000,0x1FF80000,0x1FFFFF,0x2000000,0x0,0x0,0x1FFFFFFC,0xF,0x100,0x400,0x0,0x0,0x0};
+const chunk MConst= 0x1;
+#endif
+
+#if CHUNK==64
+
+using namespace B384_56;
+
+// Base Bits= 56
+const BIG Modulus= {0xFFFFFFFFL,0xFFFF0000000000L,0xFFFFFFFFFEFFFFL,0xFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFL};
+const BIG ROI= {0xFFFFFFFEL,0xFFFF0000000000L,0xFFFFFFFFFEFFFFL,0xFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFL};
+const BIG R2modp= {0xFE000000010000L,0xFFFFFFL,0x2L,0xFFFFFFFE00L,0x1000000020000L,0x0L,0x0L};
+const chunk MConst= 0x100000001L;
+
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_NIST521.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_NIST521.cpp
new file mode 100644
index 0000000..29ce9c1
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_NIST521.cpp
@@ -0,0 +1,54 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "fp_NIST521.h"
+
+namespace NIST521 {
+
+/* Curve NIST521 */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B528_28;
+
+// Base Bits= 28
+const BIG Modulus= {0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0x1FFFF};
+const BIG ROI= {0xFFFFFFE,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0x1FFFF};
+const BIG R2modp= {0x400000,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const chunk MConst= 0x1;
+#endif
+
+#if CHUNK==64
+
+using namespace B528_60;
+
+// Base Bits= 60
+const BIG Modulus= {0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0x1FFFFFFFFFFL};
+const BIG ROI= {0xFFFFFFFFFFFFFFEL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0x1FFFFFFFFFFL};
+const BIG R2modp= {0x4000000000L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const chunk MConst= 0x1L;
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_SECP160R1.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_SECP160R1.cpp
new file mode 100644
index 0000000..71fdf8e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_SECP160R1.cpp
@@ -0,0 +1,64 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "fp_SECP160R1.h"
+
+namespace SECP160R1 {
+
+/* Curve SECP160R1 */
+
+#if CHUNK==16
+using namespace B160_13;
+// Base Bits= 13
+const BIG Modulus= {0x1FFF,0x1FFF,0x1FDF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0xF};
+const BIG R2modp= {0x0,0x20,0x0,0x800,0x0,0x0,0x4,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG ROI= {0x1FFE,0x1FFF,0x1FDF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0xF};
+const chunk MConst= 0x1;
+
+#endif
+
+#if CHUNK==32
+
+using namespace B160_29;
+
+// Base Bits= 29
+
+
+const BIG Modulus= {0x1FFFFFFF,0x1FFFFFFB,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x7FFF};
+const BIG R2modp= {0x10000000,0x0,0x4,0x8,0x0,0x0};
+const BIG ROI= {0x1FFFFFFE,0x1FFFFFFB,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x7FFF};
+const chunk MConst= 0x1;
+
+
+#endif
+
+#if CHUNK==64
+
+using namespace B160_56;
+
+// Base Bits= 56
+const BIG Modulus= {0xFFFFFF7FFFFFFFL,0xFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFL};
+const BIG R2modp= {0x1000000010000L,0x400000L,0x0L};
+const BIG ROI= {0xFFFFFF7FFFFFFEL,0xFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFL};
+const chunk MConst= 0xFFFFFF80000001L;
+
+
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_SECP256K1.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_SECP256K1.cpp
new file mode 100644
index 0000000..5d19274
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_SECP256K1.cpp
@@ -0,0 +1,60 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "fp_SECP256K1.h"
+
+namespace SECP256K1 {
+
+/* Curve SECP256K1 */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B256_28;
+
+// Base Bits= 28
+const BIG Modulus= {0xFFFFC2F,0xFFFFFEF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xF};
+const BIG ROI= {0xFFFFC2E,0xFFFFFEF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xF};
+const BIG R2modp= {0x0,0xA100000,0x2000E90,0x7A,0x1,0x0,0x0,0x0,0x0,0x0};
+const chunk MConst= 0x2253531;
+const BIG SQRTm3= {0x4,0x0,0x60C,0x0,0x3CF0F,0x0,0x126CD89,0x4000000,0x5236482,0x2};
+
+
+#endif
+
+#if CHUNK==64
+
+using namespace B256_56;
+
+// Base Bits= 56
+const BIG Modulus= {0xFFFFFEFFFFFC2FL,0xFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFL,0xFFFFFFFFL};
+const BIG ROI= {0xFFFFFEFFFFFC2EL,0xFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFL,0xFFFFFFFFL};
+const BIG R2modp= {0xA1000000000000L,0x7A2000E90L,0x1L,0x0L,0x0L};
+const chunk MConst= 0x38091DD2253531L;
+const BIG SQRTm3= {0x8D27AE1CD5F852L,0x6D15DA14ECD47DL,0xC2A797962CC61FL,0x3507F1DF233770L,0xA2D2BA9L};
+
+
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_SM2.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_SM2.cpp
new file mode 100644
index 0000000..de85654
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_SM2.cpp
@@ -0,0 +1,55 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "fp_SM2.h"
+
+namespace SM2 {
+
+/* Curve SM2 */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B256_28;
+
+// Base Bits= 28
+const BIG Modulus= {0xFFFFFFF,0xFFFFFFF,0xFF,0xFFFF000,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFE,0xF};
+const BIG ROI= {0xFFFFFFE,0xFFFFFFF,0xFF,0xFFFF000,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFE,0xF};
+const BIG R2modp= {0x40000,0x300000,0xE000000,0xFFFFFFF,0x2,0x30,0x100,0x1000,0x60000,0x0};
+const chunk MConst= 0x1;
+#endif
+
+#if CHUNK==64
+
+using namespace B256_56;
+
+// Base Bits= 56
+const BIG Modulus= {0xFFFFFFFFFFFFFFL,0xFFFF00000000FFL,0xFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFL,0xFFFFFFFEL};
+const BIG ROI= {0xFFFFFFFFFFFFFEL,0xFFFF00000000FFL,0xFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFL,0xFFFFFFFEL};
+const BIG R2modp= {0x3000000040000L,0xFFFFFFFE000000L,0x300000002L,0x10000000100L,0x60000L};
+const chunk MConst= 0x1L;
+
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_TWEEDLEDEE.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_TWEEDLEDEE.cpp
new file mode 100644
index 0000000..2b13555
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_TWEEDLEDEE.cpp
@@ -0,0 +1,57 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "fp_TWEEDLEDEE.h"
+
+namespace TWEEDLEDEE {
+
+/* TWEEDLEDEE Curve */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B256_29;
+
+// Base  bits= 29
+const BIG Modulus= {0x1,0x1657EA0,0x18A1B261,0x15424ED2,0x38,0x0,0x0,0x0,0x400000};
+const BIG R2modp= {0x3FF4,0xE8E1080,0xA9C2909,0xC128269,0x89F8301,0x19607541,0x1F4C0E6F,0x3443009,0x22B644};
+const BIG ROI= {0x69D57EC,0x5E991A4,0x213EFC7,0x10FBA370,0x72930A2,0x5B22D4C,0x102FC76F,0xA21B807,0x113EFC};
+const BIG SQRTm3= {0x91F49FA,0x17E6AD31,0x19F5AE40,0x8F54DB0,0x3FFCD01,0xB5FF973,0x12C43D6C,0xE878126,0x2D8CDA};
+const chunk MConst= 0x1FFFFFFF;
+#endif
+
+#if CHUNK==64
+
+using namespace B256_56;
+
+// Base  bits= 56
+const BIG Modulus= {0x2CAFD400000001L,0xA127696286C984L,0x38AL,0x0L,0x40000000L};
+const BIG R2modp= {0x21CA8949BBE5DFL,0x717E3D9E719200L,0xB8A93694FCEE5L,0xE6FCB03AA0A27EL,0x2013F4C0L};
+const BIG ROI= {0xBD3234869D57ECL,0x7DD1B8084FBF1CL,0x645A9872930A28L,0xDC03C0BF1DBCBL,0x113EFC51L};
+const BIG SQRTm3= {0xFCD5A6291F49FAL,0x7AA6D867D6B902L,0xBFF2E63FFCD014L,0x3C0934B10F5B16L,0x2D8CDA74L};
+const chunk MConst= 0x2CAFD3FFFFFFFFL;
+
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_TWEEDLEDUM.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_TWEEDLEDUM.cpp
new file mode 100644
index 0000000..9e9f6e5
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rom_field_TWEEDLEDUM.cpp
@@ -0,0 +1,57 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "fp_TWEEDLEDUM.h"
+
+namespace TWEEDLEDUM {
+
+/* TWEEDLEDUM Curve */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B256_29;
+
+// Base  bits= 29
+const BIG Modulus= {0x1,0xA032710,0xFD66E68,0x15424ED8,0x38,0x0,0x0,0x0,0x400000};
+const BIG R2modp= {0x3FF4,0x1B622B40,0x1166FB28,0x5BEEDDF,0x16646668,0x321298C,0xDD7B28E,0x3E66507,0x22B644};
+const BIG ROI= {0x188837CE,0x1EF4F98D,0x1AA67594,0xDD1E7E7,0x2D57FF4,0x197557C6,0xBF3D893,0x2F121DC,0x2AE451};
+const BIG SQRTm3= {0x17DE6C70,0x10786BD5,0x1DC95B25,0xD55C069,0x184CB128,0x16EB9107,0x1B5B20A1,0x95285A0,0x15EF7D};
+const chunk MConst= 0x1FFFFFFF;
+#endif
+
+#if CHUNK==64
+
+using namespace B256_56;
+
+// Base  bits= 56
+const BIG Modulus= {0x4064E200000001L,0xA1276C3F59B9A1L,0x38AL,0x0L,0x40000000L};
+const BIG R2modp= {0xFC85D749BBE0CDL,0x64ED6614FCA69BL,0x9925C8F6AC3D6DL,0x28E19094C65991L,0xA0EDD7BL};
+const BIG ROI= {0xDE9F31B88837CEL,0xE8F3F3EA99D653L,0xEAAF8C2D57FF46L,0x890EE2FCF624F2L,0x2AE45117L};
+const BIG SQRTm3= {0xF0D7AB7DE6C70L,0xAAE034F7256C96L,0xD7220F84CB1286L,0x942D06D6C8286DL,0x15EF7D4AL};
+const chunk MConst= 0x4064E1FFFFFFFFL;
+
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rsa.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rsa.cpp
new file mode 100644
index 0000000..3665a48
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rsa.cpp
@@ -0,0 +1,184 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* RSA Functions - see main program below */
+
+#include <stdio.h>
+#include <string.h>
+#include <stdlib.h>
+#include <time.h>
+
+#include "rsa_WWW.h"
+
+using namespace XXX;
+
+/* generate an RSA key pair */
+void WWW::RSA_KEY_PAIR(csprng *RNG, sign32 e, rsa_private_key *PRIV, rsa_public_key *PUB, octet *P, octet* Q)
+{
+    /* IEEE1363 A16.11/A16.12 more or less */
+    BIG t[HFLEN_WWW], p1[HFLEN_WWW], q1[HFLEN_WWW];
+
+    if (RNG != NULL)
+    {
+
+        for (;;)
+        {
+
+            FF_random(PRIV->p, RNG, HFLEN_WWW);
+            while (FF_lastbits(PRIV->p, 2) != 3) FF_inc(PRIV->p, 1, HFLEN_WWW);
+            while (!FF_prime(PRIV->p, RNG, HFLEN_WWW))
+                FF_inc(PRIV->p, 4, HFLEN_WWW);
+
+            FF_copy(p1, PRIV->p, HFLEN_WWW);
+            FF_dec(p1, 1, HFLEN_WWW);
+
+            if (FF_cfactor(p1, e, HFLEN_WWW)) continue;
+            break;
+        }
+
+        for (;;)
+        {
+            FF_random(PRIV->q, RNG, HFLEN_WWW);
+            while (FF_lastbits(PRIV->q, 2) != 3) FF_inc(PRIV->q, 1, HFLEN_WWW);
+            while (!FF_prime(PRIV->q, RNG, HFLEN_WWW))
+                FF_inc(PRIV->q, 4, HFLEN_WWW);
+
+            FF_copy(q1, PRIV->q, HFLEN_WWW);
+            FF_dec(q1, 1, HFLEN_WWW);
+            if (FF_cfactor(q1, e, HFLEN_WWW)) continue;
+
+            break;
+        }
+
+    }
+    else
+    {
+        FF_fromOctet(PRIV->p, P, HFLEN_WWW);
+        FF_fromOctet(PRIV->q, Q, HFLEN_WWW);
+
+        FF_copy(p1, PRIV->p, HFLEN_WWW);
+        FF_dec(p1, 1, HFLEN_WWW);
+
+        FF_copy(q1, PRIV->q, HFLEN_WWW);
+        FF_dec(q1, 1, HFLEN_WWW);
+    }
+
+    FF_mul(PUB->n, PRIV->p, PRIV->q, HFLEN_WWW);
+    PUB->e = e;
+
+// Only works for 3 mod 4 primes (as always generated above)
+
+    FF_copy(t, p1, HFLEN_WWW);
+    FF_shr(t, HFLEN_WWW);
+    FF_init(PRIV->dp, e, HFLEN_WWW);
+    FF_invmodp(PRIV->dp, PRIV->dp, t, HFLEN_WWW);
+    if (FF_parity(PRIV->dp) == 0) FF_add(PRIV->dp, PRIV->dp, t, HFLEN_WWW);
+    FF_norm(PRIV->dp, HFLEN_WWW);
+
+    FF_copy(t, q1, HFLEN_WWW);
+    FF_shr(t, HFLEN_WWW);
+    FF_init(PRIV->dq, e, HFLEN_WWW);
+    FF_invmodp(PRIV->dq, PRIV->dq, t, HFLEN_WWW);
+    if (FF_parity(PRIV->dq) == 0) FF_add(PRIV->dq, PRIV->dq, t, HFLEN_WWW);
+    FF_norm(PRIV->dq, HFLEN_WWW);
+
+    FF_invmodp(PRIV->c, PRIV->p, PRIV->q, HFLEN_WWW);
+
+    return;
+}
+
+// Input private key from OpenSSL format
+// e.g as in openssl rsa -in privkey.pem -noout -text
+// Note order swap - For MIRACL c=1/p mod q, for OpenSSL c=1/q mod p
+void WWW::RSA_PRIVATE_KEY_FROM_OPENSSL(octet *P,octet* Q,octet *DP,octet *DQ,octet *C,rsa_private_key *PRIV)
+{
+    FF_fromOctet(PRIV->p,Q,HFLEN_WWW);
+    FF_fromOctet(PRIV->q,P,HFLEN_WWW);   
+    FF_fromOctet(PRIV->dp,DQ,HFLEN_WWW);
+    FF_fromOctet(PRIV->dq,DP,HFLEN_WWW);
+    FF_fromOctet(PRIV->c,C,HFLEN_WWW);
+}
+
+void WWW::RSA_KEY_PAIR_FROM_OPENSSL(sign32 e,octet *P,octet* Q,octet *DP,octet *DQ,octet *C,rsa_private_key *PRIV,rsa_public_key *PUB)
+{ 
+    RSA_PRIVATE_KEY_FROM_OPENSSL(P,Q,DP,DQ,C,PRIV);
+    FF_mul(PUB->n, PRIV->p, PRIV->q, HFLEN_WWW);
+    PUB->e = e;
+}
+
+/* destroy the Private Key structure */
+void WWW::RSA_PRIVATE_KEY_KILL(rsa_private_key *PRIV)
+{
+    FF_zero(PRIV->p, HFLEN_WWW);
+    FF_zero(PRIV->q, HFLEN_WWW);
+    FF_zero(PRIV->dp, HFLEN_WWW);
+    FF_zero(PRIV->dq, HFLEN_WWW);
+    FF_zero(PRIV->c, HFLEN_WWW);
+}
+
+void WWW::RSA_fromOctet(BIG x[], octet *w)
+{
+    FF_fromOctet(x, w, FFLEN_WWW);
+}
+
+/* RSA encryption with the public key */
+void WWW::RSA_ENCRYPT(rsa_public_key *PUB, octet *F, octet *G)
+{
+    BIG f[FFLEN_WWW];
+    FF_fromOctet(f, F, FFLEN_WWW);
+
+    FF_power(f, f, PUB->e, PUB->n, FFLEN_WWW);
+
+    FF_toOctet(G, f, FFLEN_WWW);
+}
+
+/* RSA decryption with the private key */
+void WWW::RSA_DECRYPT(rsa_private_key *PRIV, octet *G, octet *F)
+{
+    BIG g[FFLEN_WWW], t[FFLEN_WWW], jp[HFLEN_WWW], jq[HFLEN_WWW];
+
+    FF_fromOctet(g, G, FFLEN_WWW);
+
+    FF_dmod(jp, g, PRIV->p, HFLEN_WWW);
+    FF_dmod(jq, g, PRIV->q, HFLEN_WWW);
+
+    FF_skpow(jp, jp, PRIV->dp, PRIV->p, HFLEN_WWW);
+    FF_skpow(jq, jq, PRIV->dq, PRIV->q, HFLEN_WWW);
+
+
+    FF_zero(g, FFLEN_WWW);
+    FF_copy(g, jp, HFLEN_WWW);
+    FF_mod(jp, PRIV->q, HFLEN_WWW);
+    if (FF_comp(jp, jq, HFLEN_WWW) > 0)
+        FF_add(jq, jq, PRIV->q, HFLEN_WWW);
+    FF_sub(jq, jq, jp, HFLEN_WWW);
+    FF_norm(jq, HFLEN_WWW);
+
+    FF_mul(t, PRIV->c, jq, HFLEN_WWW);
+    FF_dmod(jq, t, PRIV->q, HFLEN_WWW);
+
+    FF_mul(t, jq, PRIV->p, HFLEN_WWW);
+    FF_add(g, t, g, FFLEN_WWW);
+    FF_norm(g, FFLEN_WWW);
+
+    FF_toOctet(F, g, FFLEN_WWW);
+
+    return;
+}
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rsa.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rsa.h
new file mode 100644
index 0000000..334f18e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rsa.h
@@ -0,0 +1,138 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file rsa.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief RSA Header file for implementation of RSA protocol
+ *
+ * declares functions
+ *
+ */
+
+#ifndef RSA_WWW_H
+#define RSA_WWW_H
+
+#include "ff_WWW.h"
+//#include "rsa_support.h"
+
+using namespace core;
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+#define HASH_TYPE_RSA_WWW SHA256 /**< Chosen Hash algorithm */
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define RFS_WWW MODBYTES_XXX*FFLEN_WWW /**< RSA Public Key Size in bytes */
+
+
+namespace WWW {
+
+/**
+    @brief Integer Factorisation Public Key
+*/
+
+typedef struct
+{
+    sign32 e;     /**< RSA exponent (typically 65537) */
+    XXX::BIG n[FFLEN_WWW]; /**< An array of BIGs to store public key */
+} rsa_public_key;
+
+/**
+    @brief Integer Factorisation Private Key
+*/
+
+typedef struct
+{
+    XXX::BIG p[FFLEN_WWW / 2]; /**< secret prime p  */
+    XXX::BIG q[FFLEN_WWW / 2]; /**< secret prime q  */
+    XXX::BIG dp[FFLEN_WWW / 2]; /**< decrypting exponent mod (p-1)  */
+    XXX::BIG dq[FFLEN_WWW / 2]; /**< decrypting exponent mod (q-1)  */
+    XXX::BIG c[FFLEN_WWW / 2]; /**< 1/p mod q */
+} rsa_private_key;
+
+
+/** @brief RSA Private KEy from OpenSSL 
+ *
+    @param P Input prime number
+    @param Q Input prime number
+    @param DP Input 1/e mod p-1
+    @param DQ Input 1/e mod q-1
+    @param C Input 1/p mod q
+    @param PRIV the output RSA private key
+ */
+extern void RSA_PRIVATE_KEY_FROM_OPENSSL(octet *P,octet* Q,octet *DP,octet *DQ,octet *C,rsa_private_key *PRIV);
+
+/** @brief RSA Key Pair from OpenSSL 
+ *
+    @param e the encryption exponent
+    @param P Input prime number
+    @param Q Input prime number
+    @param DP Input 1/e mod p-1
+    @param DQ Input 1/e mod q-1
+    @param C Input 1/p mod q
+    @param PRIV the output RSA private key
+    @param PUB the output RSA public key
+ */
+extern void RSA_KEY_PAIR_FROM_OPENSSL(sign32 e,octet *P,octet* Q,octet *DP,octet *DQ,octet *C,rsa_private_key *PRIV,rsa_public_key *PUB);
+
+/** @brief RSA Key Pair Generator
+ *
+    @param R is a pointer to a cryptographically secure random number generator
+    @param e the encryption exponent
+    @param PRIV the output RSA private key
+    @param PUB the output RSA public key
+    @param P Input prime number. Used when R is equal to NULL for testing
+    @param Q Input prime number. Used when R is equal to NULL for testing
+ */
+extern void RSA_KEY_PAIR(csprng *R, sign32 e, rsa_private_key* PRIV, rsa_public_key* PUB, octet *P, octet* Q);
+
+/** @brief RSA encryption of suitably padded plaintext
+ *
+    @param PUB the input RSA public key
+    @param F is input padded message
+    @param G is the output ciphertext
+ */
+extern void RSA_ENCRYPT(rsa_public_key* PUB, octet *F, octet *G);
+/** @brief RSA decryption of ciphertext
+ *
+    @param PRIV the input RSA private key
+    @param G is the input ciphertext
+    @param F is output plaintext (requires unpadding)
+
+ */
+extern void RSA_DECRYPT(rsa_private_key* PRIV, octet *G, octet *F);
+/** @brief Destroy an RSA private Key
+ *
+    @param PRIV the input RSA private key. Destroyed on output.
+ */
+extern void RSA_PRIVATE_KEY_KILL(rsa_private_key *PRIV);
+/** @brief Populates an RSA public key from an octet string
+ *
+    Creates RSA public key from big-endian base 256 form.
+    @param x FF instance to be created from an octet string
+    @param S input octet string
+ */
+extern void RSA_fromOctet(XXX::BIG *x, octet *S);
+}
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rsa_RSA2048.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rsa_RSA2048.h
new file mode 100644
index 0000000..a5c22e2
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rsa_RSA2048.h
@@ -0,0 +1,138 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file rsa.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief RSA Header file for implementation of RSA protocol
+ *
+ * declares functions
+ *
+ */
+
+#ifndef RSA_RSA2048_H
+#define RSA_RSA2048_H
+
+#include "ff_RSA2048.h"
+//#include "rsa_support.h"
+
+using namespace core;
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+#define HASH_TYPE_RSA_RSA2048 SHA256 /**< Chosen Hash algorithm */
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define RFS_RSA2048 MODBYTES_B512_60*FFLEN_RSA2048 /**< RSA Public Key Size in bytes */
+
+
+namespace RSA2048 {
+
+/**
+    @brief Integer Factorisation Public Key
+*/
+
+typedef struct
+{
+    sign32 e;     /**< RSA exponent (typically 65537) */
+    B512_60::BIG n[FFLEN_RSA2048]; /**< An array of BIGs to store public key */
+} rsa_public_key;
+
+/**
+    @brief Integer Factorisation Private Key
+*/
+
+typedef struct
+{
+    B512_60::BIG p[FFLEN_RSA2048 / 2]; /**< secret prime p  */
+    B512_60::BIG q[FFLEN_RSA2048 / 2]; /**< secret prime q  */
+    B512_60::BIG dp[FFLEN_RSA2048 / 2]; /**< decrypting exponent mod (p-1)  */
+    B512_60::BIG dq[FFLEN_RSA2048 / 2]; /**< decrypting exponent mod (q-1)  */
+    B512_60::BIG c[FFLEN_RSA2048 / 2]; /**< 1/p mod q */
+} rsa_private_key;
+
+
+/** @brief RSA Private KEy from OpenSSL 
+ *
+    @param P Input prime number
+    @param Q Input prime number
+    @param DP Input 1/e mod p-1
+    @param DQ Input 1/e mod q-1
+    @param C Input 1/p mod q
+    @param PRIV the output RSA private key
+ */
+extern void RSA_PRIVATE_KEY_FROM_OPENSSL(octet *P,octet* Q,octet *DP,octet *DQ,octet *C,rsa_private_key *PRIV);
+
+/** @brief RSA Key Pair from OpenSSL 
+ *
+    @param e the encryption exponent
+    @param P Input prime number
+    @param Q Input prime number
+    @param DP Input 1/e mod p-1
+    @param DQ Input 1/e mod q-1
+    @param C Input 1/p mod q
+    @param PRIV the output RSA private key
+    @param PUB the output RSA public key
+ */
+extern void RSA_KEY_PAIR_FROM_OPENSSL(sign32 e,octet *P,octet* Q,octet *DP,octet *DQ,octet *C,rsa_private_key *PRIV,rsa_public_key *PUB);
+
+/** @brief RSA Key Pair Generator
+ *
+    @param R is a pointer to a cryptographically secure random number generator
+    @param e the encryption exponent
+    @param PRIV the output RSA private key
+    @param PUB the output RSA public key
+    @param P Input prime number. Used when R is equal to NULL for testing
+    @param Q Input prime number. Used when R is equal to NULL for testing
+ */
+extern void RSA_KEY_PAIR(csprng *R, sign32 e, rsa_private_key* PRIV, rsa_public_key* PUB, octet *P, octet* Q);
+
+/** @brief RSA encryption of suitably padded plaintext
+ *
+    @param PUB the input RSA public key
+    @param F is input padded message
+    @param G is the output ciphertext
+ */
+extern void RSA_ENCRYPT(rsa_public_key* PUB, octet *F, octet *G);
+/** @brief RSA decryption of ciphertext
+ *
+    @param PRIV the input RSA private key
+    @param G is the input ciphertext
+    @param F is output plaintext (requires unpadding)
+
+ */
+extern void RSA_DECRYPT(rsa_private_key* PRIV, octet *G, octet *F);
+/** @brief Destroy an RSA private Key
+ *
+    @param PRIV the input RSA private key. Destroyed on output.
+ */
+extern void RSA_PRIVATE_KEY_KILL(rsa_private_key *PRIV);
+/** @brief Populates an RSA public key from an octet string
+ *
+    Creates RSA public key from big-endian base 256 form.
+    @param x FF instance to be created from an octet string
+    @param S input octet string
+ */
+extern void RSA_fromOctet(B512_60::BIG *x, octet *S);
+}
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rsa_RSA3072.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rsa_RSA3072.h
new file mode 100644
index 0000000..0be26ce
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rsa_RSA3072.h
@@ -0,0 +1,138 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file rsa.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief RSA Header file for implementation of RSA protocol
+ *
+ * declares functions
+ *
+ */
+
+#ifndef RSA_RSA3072_H
+#define RSA_RSA3072_H
+
+#include "ff_RSA3072.h"
+//#include "rsa_support.h"
+
+using namespace core;
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+#define HASH_TYPE_RSA_RSA3072 SHA256 /**< Chosen Hash algorithm */
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define RFS_RSA3072 MODBYTES_B384_56*FFLEN_RSA3072 /**< RSA Public Key Size in bytes */
+
+
+namespace RSA3072 {
+
+/**
+    @brief Integer Factorisation Public Key
+*/
+
+typedef struct
+{
+    sign32 e;     /**< RSA exponent (typically 65537) */
+    B384_56::BIG n[FFLEN_RSA3072]; /**< An array of BIGs to store public key */
+} rsa_public_key;
+
+/**
+    @brief Integer Factorisation Private Key
+*/
+
+typedef struct
+{
+    B384_56::BIG p[FFLEN_RSA3072 / 2]; /**< secret prime p  */
+    B384_56::BIG q[FFLEN_RSA3072 / 2]; /**< secret prime q  */
+    B384_56::BIG dp[FFLEN_RSA3072 / 2]; /**< decrypting exponent mod (p-1)  */
+    B384_56::BIG dq[FFLEN_RSA3072 / 2]; /**< decrypting exponent mod (q-1)  */
+    B384_56::BIG c[FFLEN_RSA3072 / 2]; /**< 1/p mod q */
+} rsa_private_key;
+
+
+/** @brief RSA Private KEy from OpenSSL 
+ *
+    @param P Input prime number
+    @param Q Input prime number
+    @param DP Input 1/e mod p-1
+    @param DQ Input 1/e mod q-1
+    @param C Input 1/p mod q
+    @param PRIV the output RSA private key
+ */
+extern void RSA_PRIVATE_KEY_FROM_OPENSSL(octet *P,octet* Q,octet *DP,octet *DQ,octet *C,rsa_private_key *PRIV);
+
+/** @brief RSA Key Pair from OpenSSL 
+ *
+    @param e the encryption exponent
+    @param P Input prime number
+    @param Q Input prime number
+    @param DP Input 1/e mod p-1
+    @param DQ Input 1/e mod q-1
+    @param C Input 1/p mod q
+    @param PRIV the output RSA private key
+    @param PUB the output RSA public key
+ */
+extern void RSA_KEY_PAIR_FROM_OPENSSL(sign32 e,octet *P,octet* Q,octet *DP,octet *DQ,octet *C,rsa_private_key *PRIV,rsa_public_key *PUB);
+
+/** @brief RSA Key Pair Generator
+ *
+    @param R is a pointer to a cryptographically secure random number generator
+    @param e the encryption exponent
+    @param PRIV the output RSA private key
+    @param PUB the output RSA public key
+    @param P Input prime number. Used when R is equal to NULL for testing
+    @param Q Input prime number. Used when R is equal to NULL for testing
+ */
+extern void RSA_KEY_PAIR(csprng *R, sign32 e, rsa_private_key* PRIV, rsa_public_key* PUB, octet *P, octet* Q);
+
+/** @brief RSA encryption of suitably padded plaintext
+ *
+    @param PUB the input RSA public key
+    @param F is input padded message
+    @param G is the output ciphertext
+ */
+extern void RSA_ENCRYPT(rsa_public_key* PUB, octet *F, octet *G);
+/** @brief RSA decryption of ciphertext
+ *
+    @param PRIV the input RSA private key
+    @param G is the input ciphertext
+    @param F is output plaintext (requires unpadding)
+
+ */
+extern void RSA_DECRYPT(rsa_private_key* PRIV, octet *G, octet *F);
+/** @brief Destroy an RSA private Key
+ *
+    @param PRIV the input RSA private key. Destroyed on output.
+ */
+extern void RSA_PRIVATE_KEY_KILL(rsa_private_key *PRIV);
+/** @brief Populates an RSA public key from an octet string
+ *
+    Creates RSA public key from big-endian base 256 form.
+    @param x FF instance to be created from an octet string
+    @param S input octet string
+ */
+extern void RSA_fromOctet(B384_56::BIG *x, octet *S);
+}
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rsa_RSA4096.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rsa_RSA4096.h
new file mode 100644
index 0000000..fbd9ff7
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/rsa_RSA4096.h
@@ -0,0 +1,138 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file rsa.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief RSA Header file for implementation of RSA protocol
+ *
+ * declares functions
+ *
+ */
+
+#ifndef RSA_RSA4096_H
+#define RSA_RSA4096_H
+
+#include "ff_RSA4096.h"
+//#include "rsa_support.h"
+
+using namespace core;
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+#define HASH_TYPE_RSA_RSA4096 SHA256 /**< Chosen Hash algorithm */
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define RFS_RSA4096 MODBYTES_B512_60*FFLEN_RSA4096 /**< RSA Public Key Size in bytes */
+
+
+namespace RSA4096 {
+
+/**
+    @brief Integer Factorisation Public Key
+*/
+
+typedef struct
+{
+    sign32 e;     /**< RSA exponent (typically 65537) */
+    B512_60::BIG n[FFLEN_RSA4096]; /**< An array of BIGs to store public key */
+} rsa_public_key;
+
+/**
+    @brief Integer Factorisation Private Key
+*/
+
+typedef struct
+{
+    B512_60::BIG p[FFLEN_RSA4096 / 2]; /**< secret prime p  */
+    B512_60::BIG q[FFLEN_RSA4096 / 2]; /**< secret prime q  */
+    B512_60::BIG dp[FFLEN_RSA4096 / 2]; /**< decrypting exponent mod (p-1)  */
+    B512_60::BIG dq[FFLEN_RSA4096 / 2]; /**< decrypting exponent mod (q-1)  */
+    B512_60::BIG c[FFLEN_RSA4096 / 2]; /**< 1/p mod q */
+} rsa_private_key;
+
+
+/** @brief RSA Private KEy from OpenSSL 
+ *
+    @param P Input prime number
+    @param Q Input prime number
+    @param DP Input 1/e mod p-1
+    @param DQ Input 1/e mod q-1
+    @param C Input 1/p mod q
+    @param PRIV the output RSA private key
+ */
+extern void RSA_PRIVATE_KEY_FROM_OPENSSL(octet *P,octet* Q,octet *DP,octet *DQ,octet *C,rsa_private_key *PRIV);
+
+/** @brief RSA Key Pair from OpenSSL 
+ *
+    @param e the encryption exponent
+    @param P Input prime number
+    @param Q Input prime number
+    @param DP Input 1/e mod p-1
+    @param DQ Input 1/e mod q-1
+    @param C Input 1/p mod q
+    @param PRIV the output RSA private key
+    @param PUB the output RSA public key
+ */
+extern void RSA_KEY_PAIR_FROM_OPENSSL(sign32 e,octet *P,octet* Q,octet *DP,octet *DQ,octet *C,rsa_private_key *PRIV,rsa_public_key *PUB);
+
+/** @brief RSA Key Pair Generator
+ *
+    @param R is a pointer to a cryptographically secure random number generator
+    @param e the encryption exponent
+    @param PRIV the output RSA private key
+    @param PUB the output RSA public key
+    @param P Input prime number. Used when R is equal to NULL for testing
+    @param Q Input prime number. Used when R is equal to NULL for testing
+ */
+extern void RSA_KEY_PAIR(csprng *R, sign32 e, rsa_private_key* PRIV, rsa_public_key* PUB, octet *P, octet* Q);
+
+/** @brief RSA encryption of suitably padded plaintext
+ *
+    @param PUB the input RSA public key
+    @param F is input padded message
+    @param G is the output ciphertext
+ */
+extern void RSA_ENCRYPT(rsa_public_key* PUB, octet *F, octet *G);
+/** @brief RSA decryption of ciphertext
+ *
+    @param PRIV the input RSA private key
+    @param G is the input ciphertext
+    @param F is output plaintext (requires unpadding)
+
+ */
+extern void RSA_DECRYPT(rsa_private_key* PRIV, octet *G, octet *F);
+/** @brief Destroy an RSA private Key
+ *
+    @param PRIV the input RSA private key. Destroyed on output.
+ */
+extern void RSA_PRIVATE_KEY_KILL(rsa_private_key *PRIV);
+/** @brief Populates an RSA public key from an octet string
+ *
+    Creates RSA public key from big-endian base 256 form.
+    @param x FF instance to be created from an octet string
+    @param S input octet string
+ */
+extern void RSA_fromOctet(B512_60::BIG *x, octet *S);
+}
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/share.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/share.cpp
new file mode 100644
index 0000000..103c7cc
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/share.cpp
@@ -0,0 +1,231 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* Shamir threshold secret sharing module */
+/* Split any octet into number of shares <256 */
+/* Specify number of shares required for recovery - nsr */
+
+/* See testmpin.cpp for an example of use */
+
+#include "arch.h"
+#include "core.h"
+
+using namespace core;
+/* Field GF(2^8) precalculated tables */
+
+static const uchar ptab[] =
+{
+    1, 3, 5, 15, 17, 51, 85, 255, 26, 46, 114, 150, 161, 248, 19, 53,
+    95, 225, 56, 72, 216, 115, 149, 164, 247, 2, 6, 10, 30, 34, 102, 170,
+    229, 52, 92, 228, 55, 89, 235, 38, 106, 190, 217, 112, 144, 171, 230, 49,
+    83, 245, 4, 12, 20, 60, 68, 204, 79, 209, 104, 184, 211, 110, 178, 205,
+    76, 212, 103, 169, 224, 59, 77, 215, 98, 166, 241, 8, 24, 40, 120, 136,
+    131, 158, 185, 208, 107, 189, 220, 127, 129, 152, 179, 206, 73, 219, 118, 154,
+    181, 196, 87, 249, 16, 48, 80, 240, 11, 29, 39, 105, 187, 214, 97, 163,
+    254, 25, 43, 125, 135, 146, 173, 236, 47, 113, 147, 174, 233, 32, 96, 160,
+    251, 22, 58, 78, 210, 109, 183, 194, 93, 231, 50, 86, 250, 21, 63, 65,
+    195, 94, 226, 61, 71, 201, 64, 192, 91, 237, 44, 116, 156, 191, 218, 117,
+    159, 186, 213, 100, 172, 239, 42, 126, 130, 157, 188, 223, 122, 142, 137, 128,
+    155, 182, 193, 88, 232, 35, 101, 175, 234, 37, 111, 177, 200, 67, 197, 84,
+    252, 31, 33, 99, 165, 244, 7, 9, 27, 45, 119, 153, 176, 203, 70, 202,
+    69, 207, 74, 222, 121, 139, 134, 145, 168, 227, 62, 66, 198, 81, 243, 14,
+    18, 54, 90, 238, 41, 123, 141, 140, 143, 138, 133, 148, 167, 242, 13, 23,
+    57, 75, 221, 124, 132, 151, 162, 253, 28, 36, 108, 180, 199, 82, 246, 1
+};
+
+static const uchar ltab[] =
+{
+    0, 255, 25, 1, 50, 2, 26, 198, 75, 199, 27, 104, 51, 238, 223, 3,
+    100, 4, 224, 14, 52, 141, 129, 239, 76, 113, 8, 200, 248, 105, 28, 193,
+    125, 194, 29, 181, 249, 185, 39, 106, 77, 228, 166, 114, 154, 201, 9, 120,
+    101, 47, 138, 5, 33, 15, 225, 36, 18, 240, 130, 69, 53, 147, 218, 142,
+    150, 143, 219, 189, 54, 208, 206, 148, 19, 92, 210, 241, 64, 70, 131, 56,
+    102, 221, 253, 48, 191, 6, 139, 98, 179, 37, 226, 152, 34, 136, 145, 16,
+    126, 110, 72, 195, 163, 182, 30, 66, 58, 107, 40, 84, 250, 133, 61, 186,
+    43, 121, 10, 21, 155, 159, 94, 202, 78, 212, 172, 229, 243, 115, 167, 87,
+    175, 88, 168, 80, 244, 234, 214, 116, 79, 174, 233, 213, 231, 230, 173, 232,
+    44, 215, 117, 122, 235, 22, 11, 245, 89, 203, 95, 176, 156, 169, 81, 160,
+    127, 12, 246, 111, 23, 196, 73, 236, 216, 67, 31, 45, 164, 118, 123, 183,
+    204, 187, 62, 90, 251, 96, 177, 134, 59, 82, 161, 108, 170, 85, 41, 157,
+    151, 178, 135, 144, 97, 190, 220, 252, 188, 149, 207, 205, 55, 63, 91, 209,
+    83, 57, 132, 60, 65, 162, 109, 71, 20, 42, 158, 93, 86, 242, 211, 171,
+    68, 17, 146, 217, 35, 32, 46, 137, 180, 124, 184, 38, 119, 153, 227, 165,
+    103, 74, 237, 222, 197, 49, 254, 24, 13, 99, 140, 128, 192, 247, 112, 7
+};
+
+/* field addition */
+static uchar add(uchar x,uchar y)
+{
+    return (x^y);
+}
+
+/* x.y= AntiLog(Log(x) + Log(y)) */
+static uchar mul(uchar x,uchar y)
+{ 
+    if (x && y) return ptab[(ltab[x]+ltab[y])%255];
+    else return 0;
+}
+
+/* multiplicative inverse */
+static uchar inv(uchar x)
+{
+    return ptab[255-ltab[x]];  
+}
+
+/* Lagrange interpolation */
+static int interpolate(int n, uchar x[], uchar y[])
+{
+    int i,j;
+    uchar p,yp=0;
+    for(i=0;i<n;i++)
+    {
+        p=1;
+        for (j=0;j<n;j++)
+            if (i!=j) p=mul(p,mul(x[j],inv(add(x[i],x[j]))));
+        yp=add(yp,mul(p,y[i]));
+    }
+    return yp;
+}
+
+/* return a share of M */
+/* input id - Unique share ID */
+/* input nsr - Number of shares required for recovery */
+/* output S - share as octet */
+/* input Message M to be shared */
+/* input Random seed R */
+/* return share structure */
+
+share core::getshare(int id,int nsr,octet *S,octet *M,octet *R)
+{
+    csprng rng;                // Crypto Strong RNG
+    share Sh;
+    int j,n,m;
+    uchar x;
+    if (id<1 || id>=256 || nsr<2 || nsr>=256)
+    {
+        Sh.id=0;
+        Sh.nsr=0;
+        Sh.B=NULL;
+        return Sh;
+    }
+    RAND_clean(&rng);
+    RAND_seed(&rng,R->len,R->val);
+    Sh.id=id;
+    Sh.nsr=nsr;
+    Sh.B=S;
+    m=M->len;
+    S->len=m;
+    for (j=0;j<m;j++)
+    {
+        x=(uchar)id;
+        S->val[j]=M->val[j];
+        for (n=1;n<nsr;n++ )
+        {
+            S->val[j]=add(S->val[j],mul(RAND_byte(&rng),x));
+            x=mul(x,(uchar)id);
+        }
+    }
+    return Sh;
+}
+
+/* Recover message from shares */
+
+int core::recover(octet *M,share S[])
+{
+    uchar x[256],y[256];
+    int i,j,res=0;
+    int len=S[0].B->len;
+    int nsr=S[0].nsr;
+    for (i=1;i<nsr;i++)
+    {
+        if (S[i].nsr!=nsr || S[i].B->len!=len)
+        {
+            res=-1;
+            break;
+        }
+    }
+    if (res) return res;
+
+    for (j=0;j<len;j++)
+    {
+        for (i=0;i<nsr;i++)
+        {
+            x[i]=S[i].id;
+            y[i]=S[i].B->val[j];
+        }
+        M->val[j]=interpolate(nsr,x,y);
+    }
+    M->len=len;
+    return res;
+}
+
+/*
+#include <stdio.h>
+#include <time.h>
+
+int main()
+{ // test driver 
+    int ii,j,k,l,m,n,nsr;
+    char mc[10],b1c[10],b2c[10],b3c[10],b4c[10],r[30];
+    octet M={0,sizeof(mc),mc};
+    octet B1={0,sizeof(b1c),b1c};
+    octet B2={0,sizeof(b2c),b2c};
+    octet B3={0,sizeof(b3c),b3c};
+    octet B4={0,sizeof(b4c),b4c};
+    octet R={0,sizeof(r),r};
+    share S[3];
+
+    nsr=3;
+
+    srand(time(NULL));
+
+    M.len=5;
+    M.val[0]=rand()%128; M.val[1]=rand()%128; M.val[2]=rand()%128; M.val[3]=rand()%128; M.val[4]=rand()%128;
+
+    printf("Message= "); OCT_output(&M);
+
+    R.len=(nsr-1)*M.len;
+    for (j=0;j<R.len;j++)
+        R.val[j]=rand()%256;
+
+// 3 out of 4
+    share S0=getshare(1,nsr,&B1,&M,&R);  // R is random number seed
+    share S1=getshare(2,nsr,&B2,&M,&R);
+    share S2=getshare(3,nsr,&B3,&M,&R);
+    share S3=getshare(4,nsr,&B4,&M,&R);
+
+    printf("Share 1= "); OCT_output(&B1);
+    printf("Share 2= "); OCT_output(&B2);
+    printf("Share 3= "); OCT_output(&B3);
+    printf("Share 4= "); OCT_output(&B4);
+
+    S[0]=S0;  // pick any 3 shares
+    S[1]=S1;
+    S[2]=S3;
+
+    OCT_clear(&M);
+
+    recover(&M,S);
+
+    printf("Message= "); OCT_output(&M);
+
+    return 0;
+}
+*/
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/testbls b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/testbls
new file mode 100644
index 0000000..4796b2d
Binary files /dev/null and b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/testbls differ
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/testbls.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/testbls.cpp
new file mode 100644
index 0000000..f9c5ac6
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/testbls.cpp
@@ -0,0 +1,322 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* Test driver and function exerciser for Boneh-Lynn-Shacham BLS Signature API Functions */
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include <time.h>
+#include "bls_BN254.h"
+
+#if CHUNK==32 || CHUNK==64
+#include "bls_BLS12383.h"
+#include "bls192_BLS24479.h"
+#include "bls256_BLS48556.h"
+#endif
+
+#include "randapi.h"
+
+/* To reverse the groups G1 and G2, edit BLS*.cpp
+
+Swap G1 <-> G2
+Swap ECP <-> ECPn
+Disable G2 precomputation
+Switch G1/G2 parameter order in pairing function calls
+
+#define REVERSE here
+
+See BLSREV*.cpp
+
+*/
+
+//#define REVERSE
+
+using namespace core;
+
+static char message[] = "This is a test message";
+
+int bls_BN254(csprng *RNG)
+{
+    using namespace BN254;
+
+    int i,res;
+    char s[BGS_BN254];
+    char ikm[64];
+#ifdef REVERSE
+    char w[BFS_BN254+1], sig[4 * BFS_BN254 + 1];        // w is 2* if not compressed else 1*. sig is 4* if not compressed, else 2*
+#else
+    char w[4 * BFS_BN254 + 1], sig[BFS_BN254 + 1];      // w is 4* if not compressed else 2*. sig is 2* if not compressed, else 1*
+#endif
+    octet S = {0, sizeof(s), s};
+    octet W = {0, sizeof(w), w};
+    octet SIG = {0, sizeof(sig), sig};
+    octet IKM = {0, sizeof(ikm), ikm};
+    octet M = {0,sizeof(message), message};
+
+    OCT_jstring(&M,message);
+
+    res = BLS_INIT();
+    if (res == BLS_FAIL)
+    {
+        printf("Failed to initialize\n");
+        return res;
+    }
+
+    OCT_rand(&IKM,RNG,32);
+    //IKM.len=32;
+    //for (i=0;i<IKM.len;i++)
+    //        IKM.val[i]=i+1;
+
+    res = BLS_KEY_PAIR_GENERATE(&IKM, &S, &W);
+    if (res == BLS_FAIL)
+    {
+        printf("Failed to generate keys\n");
+        return res;
+    }
+
+    printf("Private key= 0x");
+    OCT_output(&S);
+    printf("Public key= 0x");
+    OCT_output(&W);
+
+    BLS_CORE_SIGN(&SIG, &M, &S);
+    printf("Signature= 0x");
+    OCT_output(&SIG);
+
+    //message[7]='f'; // change the message
+
+    res = BLS_CORE_VERIFY(&SIG, &M, &W);
+    if (res == BLS_OK) printf("Signature is OK\n");
+    else printf("Signature is *NOT* OK\n");
+    return res;
+}
+
+#if CHUNK==32 || CHUNK==64
+
+int bls_BLS12383(csprng *RNG)
+{
+    using namespace BLS12383;
+
+    int i,res;
+    char s[BGS_BLS12383];
+    char ikm[64];
+#ifdef REVERSE
+    char w[BFS_BLS12383+1], sig[4 * BFS_BLS12383 + 1];
+#else
+    char w[4 * BFS_BLS12383 + 1], sig[BFS_BLS12383 + 1];
+#endif
+    octet S = {0, sizeof(s), s};
+    octet W = {0, sizeof(w), w};
+    octet SIG = {0, sizeof(sig), sig};
+    octet IKM = {0, sizeof(ikm), ikm};
+    octet M = {0,sizeof(message), message};
+
+    OCT_jstring(&M,message);
+
+    res = BLS_INIT();
+    if (res == BLS_FAIL)
+    {
+        printf("Failed to initialize\n");
+        return res;
+    }
+
+    OCT_rand(&IKM,RNG,32);
+    //IKM.len=32;
+    //for (i=0;i<IKM.len;i++)
+    //        IKM.val[i]=i+1;
+
+    res = BLS_KEY_PAIR_GENERATE(&IKM, &S, &W);
+    if (res == BLS_FAIL)
+    {
+        printf("Failed to generate keys\n");
+        return res;
+    }
+
+    printf("Private key= 0x");
+    OCT_output(&S);
+    printf("Public key= 0x");
+    OCT_output(&W);
+
+    BLS_CORE_SIGN(&SIG, &M, &S);
+    printf("Signature= 0x");
+    OCT_output(&SIG);
+
+    //message[7]='f'; // change the message
+
+    res = BLS_CORE_VERIFY(&SIG, &M, &W);
+    if (res == BLS_OK) printf("Signature is OK\n");
+    else printf("Signature is *NOT* OK\n");
+    return res;
+}
+
+int bls_BLS24479(csprng *RNG)
+{
+    using namespace BLS24479;
+
+    int i,res;
+    char s[BGS_BLS24479];
+    char ikm[64];
+#ifdef REVERSE
+    char w[BFS_BLS24479+1], sig[8 * BFS_BLS24479 + 1];
+#else
+    char w[8 * BFS_BLS24479 + 1], sig[BFS_BLS24479 + 1];
+#endif
+    octet S = {0, sizeof(s), s};
+    octet W = {0, sizeof(w), w};
+    octet SIG = {0, sizeof(sig), sig};
+    octet IKM = {0, sizeof(ikm), ikm};
+    octet M = {0,sizeof(message), message};
+
+    OCT_jstring(&M,message);
+
+    res = BLS_INIT();
+    if (res == BLS_FAIL)
+    {
+        printf("Failed to initialize\n");
+        return res;
+    }
+
+    OCT_rand(&IKM,RNG,48);
+    //IKM.len=48;
+    //for (i=0;i<IKM.len;i++)
+    //        IKM.val[i]=i+1;
+
+    res = BLS_KEY_PAIR_GENERATE(&IKM, &S, &W);
+    if (res == BLS_FAIL)
+    {
+        printf("Failed to generate keys\n");
+        return res;
+    }
+
+    printf("Private key= 0x");
+    OCT_output(&S);
+    printf("Public key= 0x");
+    OCT_output(&W);
+
+    BLS_CORE_SIGN(&SIG, &M, &S);
+    printf("Signature= 0x");
+    OCT_output(&SIG);
+
+    //message[7]='f'; // change the message
+
+    res = BLS_CORE_VERIFY(&SIG, &M, &W);
+    if (res == BLS_OK) printf("Signature is OK\n");
+    else printf("Signature is *NOT* OK\n");
+    return res;
+}
+
+int bls_BLS48556(csprng *RNG)
+{
+    using namespace BLS48556;
+
+    int i,res;
+    char s[BGS_BLS48556];
+    char ikm[64];
+#ifdef REVERSE
+    char w[BFS_BLS48556+1], sig[16 * BFS_BLS48556 + 1];
+#else
+    char w[16 * BFS_BLS48556 + 1], sig[BFS_BLS48556 + 1];
+#endif
+    octet S = {0, sizeof(s), s};
+    octet W = {0, sizeof(w), w};
+    octet SIG = {0, sizeof(sig), sig};
+    octet IKM = {0, sizeof(ikm), ikm};
+    octet M = {0,sizeof(message), message};
+
+    OCT_jstring(&M,message);
+
+    res = BLS_INIT();
+    if (res == BLS_FAIL)
+    {
+        printf("Failed to initialize\n");
+        return res;
+    }
+
+    OCT_rand(&IKM,RNG,64);
+    //IKM.len=64;
+    //for (i=0;i<IKM.len;i++)
+    //        IKM.val[i]=i+1;
+
+    res = BLS_KEY_PAIR_GENERATE(&IKM, &S, &W);
+    if (res == BLS_FAIL)
+    {
+        printf("Failed to generate keys\n");
+        return res;
+    }
+
+    printf("Private key= 0x");
+    OCT_output(&S);
+    printf("Public key= 0x");
+    OCT_output(&W);
+
+    BLS_CORE_SIGN(&SIG, &M, &S);
+    printf("Signature= 0x");
+    OCT_output(&SIG);
+
+    //message[7]='f'; // change the message
+
+    res = BLS_CORE_VERIFY(&SIG, &M, &W);
+    if (res == BLS_OK) printf("Signature is OK\n");
+    else printf("Signature is *NOT* OK\n");
+    return res;
+}
+
+#endif
+
+int main()
+{
+    int i, res;
+    unsigned long ran;
+
+    char raw[100];
+    octet RAW = {0, sizeof(raw), raw};
+    csprng RNG;                // Crypto Strong RNG
+
+    time((time_t *)&ran);
+
+    RAW.len = 100;              // fake random seed source
+    RAW.val[0] = ran;
+    RAW.val[1] = ran >> 8;
+    RAW.val[2] = ran >> 16;
+    RAW.val[3] = ran >> 24;
+    for (i = 4; i < 100; i++) RAW.val[i] = i;
+
+    CREATE_CSPRNG(&RNG, &RAW);  // initialise strong RNG
+
+    printf("%d bit build\n", CHUNK);
+
+    printf("\nTesting BLS signature for curve BN254\n");
+    bls_BN254(&RNG);
+
+#if CHUNK!=16
+    printf("\nTesting BLS signature for curve BLS12383\n");
+    bls_BLS12383(&RNG);
+
+    printf("\nTesting BLS signature for curve BLS24479\n");
+    bls_BLS24479(&RNG);
+
+    printf("\nTesting BLS signature for curve BLS48556\n");
+    bls_BLS48556(&RNG);
+#endif
+
+    KILL_CSPRNG(&RNG);
+}
+
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/testdlthm b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/testdlthm
new file mode 100644
index 0000000..a50d538
Binary files /dev/null and b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/testdlthm differ
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/testdlthm.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/testdlthm.cpp
new file mode 100644
index 0000000..f7326a0
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/testdlthm.cpp
@@ -0,0 +1,93 @@
+/*
+ * Copyright (c) 2012-2021 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* test driver and function exerciser for Dilithium functions */
+
+// See https://eprint.iacr.org/2017/633 (Ducas, Lepoint, Lyubashevsky, Schwabe, Seiler, Stehle)
+
+/* g++ -O2 testdlthm.cpp core.a -o testdlthm */
+
+#include <stdio.h>
+#include <time.h>
+#include "dilithium.h"
+
+using namespace core;
+
+#define LOOPS 100
+
+int main() {
+    int i,j,attempts;
+    unsigned long ran;
+    bool result;
+    char raw[100];
+    byte tau[32];
+    csprng RNG;
+    char sk[DL_SK_SIZE_3], pk[DL_PK_SIZE_3], sig[DL_SIG_SIZE_3],m[128];
+    octet SK = {0, sizeof(sk), sk};
+    octet PK = {0, sizeof(pk), pk};
+    octet SIG = {0, sizeof(sig), sig};
+    octet M = {0, sizeof(m), m};
+
+    time((time_t *)&ran);
+
+    raw[0] = ran;
+    raw[1] = ran >> 8;
+    raw[2] = ran >> 16;
+    raw[3] = ran >> 24;
+
+    for (i = 0; i < 100; i++) raw[i] = i + 1; // change to i = 4 to randomize
+    RAND_seed(&RNG, 100, raw);
+
+    printf("Testing Dilithium signature\n");
+    int tats=0;
+    for (i=0;i<LOOPS;i++) {
+
+        OCT_clear(&M);
+        OCT_jstring(&M,(char *)"Hello World");
+
+        for (j=0;j<32;j++)
+            tau[j]=RAND_byte(&RNG);
+
+        DLTHM_keypair_3(tau,&SK,&PK);
+
+        printf("private key %d bits\n",8*SK.len);
+        printf("public key %d bits\n",8*PK.len);
+
+        //OCT_output(&SK); printf("\n");
+        //OCT_output(&PK); printf("\n");
+
+        attempts=DLTHM_signature_3(&SK,&M,&SIG);
+
+        tats+=attempts;
+
+        printf("Signature %d bits created on attempt %d\n",8*SIG.len,attempts);
+
+        result=DLTHM_verify_3(&PK,&M,&SIG);
+        if (result) {
+            printf("Signature is verified\n");
+        } else {
+            printf("Signature is NOT verified\n"); 
+            break;
+        }
+    }
+    if (LOOPS>1)
+        printf("Average= %d\n",tats/LOOPS);
+    return 0;
+} 
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/testecc b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/testecc
new file mode 100644
index 0000000..3fbf9e6
Binary files /dev/null and b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/testecc differ
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/testecc.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/testecc.cpp
new file mode 100644
index 0000000..e3a61c3
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/testecc.cpp
@@ -0,0 +1,623 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* test driver and function exerciser for ECDH/ECIES/ECDSA API Functions */
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include <time.h>
+#include "ecdh_Ed25519.h"
+#include "rsa_RSA2048.h"
+#include "randapi.h"
+
+#if CHUNK==32 || CHUNK==64
+#include "ecdh_NIST256.h"
+#include "ecdh_Ed448.h"
+#endif
+
+using namespace core;
+
+int ecdh_Ed25519(csprng *RNG)
+{
+    using namespace Ed25519;
+
+    int i, res;
+    unsigned long ran;
+    char *pp = (char *)"M0ng00se";
+    // These octets are automatically protected against buffer overflow attacks
+    // Note salt must be big enough to include an appended word
+    // Note ECIES ciphertext C must be big enough to include at least 1 appended block
+    // Recall EFS_Ed25519 is field size in bytes. So EFS_Ed25519=32 for 256-bit curve
+    char s0[2 * EGS_Ed25519], s1[EGS_Ed25519], w0[2 * EFS_Ed25519 + 1], w1[2 * EFS_Ed25519 + 1], z0[EFS_Ed25519], z1[EFS_Ed25519], key[AESKEY_Ed25519], salt[40], pw[40];
+    octet S0 = {0, sizeof(s0), s0};
+    octet S1 = {0, sizeof(s1), s1};
+    octet W0 = {0, sizeof(w0), w0};
+    octet W1 = {0, sizeof(w1), w1};
+    octet Z0 = {0, sizeof(z0), z0};
+    octet Z1 = {0, sizeof(z1), z1};
+    octet KEY = {0, sizeof(key), key};
+    octet SALT = {0, sizeof(salt), salt};
+    octet PW = {0, sizeof(pw), pw};
+
+    SALT.len = 8;
+    for (i = 0; i < 8; i++) SALT.val[i] = i + 1; // set Salt
+
+    printf("Alice's Passphrase= %s\n", pp);
+
+    OCT_empty(&PW);
+    OCT_jstring(&PW, pp);  // set Password from string
+
+    // private key S0 of size EGS_Ed25519 bytes derived from Password and Salt
+
+    PBKDF2(MC_SHA2,HASH_TYPE_Ed25519, &S0, EGS_Ed25519, &PW, &SALT, 1000);
+
+    printf("Alices private key= 0x");
+    OCT_output(&S0);
+
+    // Generate Key pair S/W
+
+    ECP_KEY_PAIR_GENERATE(NULL, &S0, &W0);
+    printf("Alices public key= 0x");
+    OCT_output(&W0);
+
+    res = ECP_PUBLIC_KEY_VALIDATE(&W0);
+    if (res != 0)
+    {
+        printf("ECP Public Key is invalid!\n");
+        return 0;
+    }
+
+    // Random private key for other party
+    ECP_KEY_PAIR_GENERATE(RNG, &S1, &W1);
+    res = ECP_PUBLIC_KEY_VALIDATE(&W1);
+    if (res != 0)
+    {
+        printf("ECP Public Key is invalid!\n");
+        return 0;
+    }
+    printf("Servers private key= 0x");
+    OCT_output(&S1);
+    printf("Servers public key= 0x");
+    OCT_output(&W1);
+
+    // Calculate common key using DH - IEEE 1363 method
+
+    ECP_SVDP_DH(&S0, &W1, &Z0, 0);
+    ECP_SVDP_DH(&S1, &W0, &Z1, 0);
+
+    if (!OCT_comp(&Z0, &Z1))
+    {
+        printf("*** ECPSVDP-DH Failed\n");
+        return 0;
+    }
+
+    KDF2(MC_SHA2, HASH_TYPE_Ed25519, &KEY, AESKEY_Ed25519, &Z0, NULL);
+
+    printf("Alice's DH Key=  0x");
+    OCT_output(&KEY);
+    printf("Servers DH Key=  0x");
+    OCT_output(&KEY);
+
+#if CURVETYPE_Ed25519 != MONTGOMERY
+
+    char ds[EGS_Ed25519], p1[30], p2[30], v[2 * EFS_Ed25519 + 1], m[32], c[64], t[32], cs[EGS_Ed25519];
+    octet DS = {0, sizeof(ds), ds};
+    octet CS = {0, sizeof(cs), cs};
+    octet P1 = {0, sizeof(p1), p1};
+    octet P2 = {0, sizeof(p2), p2};
+    octet V = {0, sizeof(v), v};
+    octet M = {0, sizeof(m), m};
+    octet C = {0, sizeof(c), c};
+    octet T = {0, sizeof(t), t};
+
+    printf("Testing ECIES\n");
+
+    P1.len = 3;
+    P1.val[0] = 0x0;
+    P1.val[1] = 0x1;
+    P1.val[2] = 0x2;
+    P2.len = 4;
+    P2.val[0] = 0x0;
+    P2.val[1] = 0x1;
+    P2.val[2] = 0x2;
+    P2.val[3] = 0x3;
+
+    M.len = 17;
+    for (i = 0; i <= 16; i++) M.val[i] = i;
+
+    ECP_ECIES_ENCRYPT(HASH_TYPE_Ed25519, &P1, &P2, RNG, &W1, &M, 12, &V, &C, &T);
+
+    printf("Ciphertext= \n");
+    printf("V= 0x");
+    OCT_output(&V);
+    printf("C= 0x");
+    OCT_output(&C);
+    printf("T= 0x");
+    OCT_output(&T);
+
+    if (!ECP_ECIES_DECRYPT(HASH_TYPE_Ed25519, &P1, &P2, &V, &C, &T, &S1, &M))
+    {
+        printf("*** ECIES Decryption Failed\n");
+        return 0;
+    }
+    else printf("Decryption succeeded\n");
+
+    printf("Message is 0x");
+    OCT_output(&M);
+
+
+    printf("Testing ECDSA\n");
+
+    if (ECP_SP_DSA(HASH_TYPE_Ed25519, RNG, NULL, &S0, &M, &CS, &DS) != 0)
+    {
+        printf("***ECDSA Signature Failed\n");
+        return 0;
+    }
+
+    printf("Signature C = 0x");
+    OCT_output(&CS);
+    printf("Signature D = 0x");
+    OCT_output(&DS);
+
+    if (ECP_VP_DSA(HASH_TYPE_Ed25519, &W0, &M, &CS, &DS) != 0)
+    {
+        printf("***ECDSA Verification Failed\n");
+        return 0;
+    }
+    else
+    {
+        printf("ECDSA Signature/Verification succeeded\n");
+    }
+
+#endif
+
+    return 1;
+}
+
+#if CHUNK==32 || CHUNK==64
+int ecdh_NIST256(csprng *RNG)
+{
+    using namespace NIST256;
+
+    int i, res;
+    unsigned long ran;
+    char *pp = (char *)"M0ng00se";
+    // These octets are automatically protected against buffer overflow attacks
+    // Note salt must be big enough to include an appended word
+    // Note ECIES ciphertext C must be big enough to include at least 1 appended block
+    // Recall EFS_NIST256 is field size in bytes. So EFS_NIST256=32 for 256-bit curve
+    char s0[2 * EGS_NIST256], s1[EGS_NIST256], w0[2 * EFS_NIST256 + 1], w1[2 * EFS_NIST256 + 1], z0[EFS_NIST256], z1[EFS_NIST256], key[AESKEY_NIST256], salt[40], pw[40];
+    octet S0 = {0, sizeof(s0), s0};
+    octet S1 = {0, sizeof(s1), s1};
+    octet W0 = {0, sizeof(w0), w0};
+    octet W1 = {0, sizeof(w1), w1};
+    octet Z0 = {0, sizeof(z0), z0};
+    octet Z1 = {0, sizeof(z1), z1};
+    octet KEY = {0, sizeof(key), key};
+    octet SALT = {0, sizeof(salt), salt};
+    octet PW = {0, sizeof(pw), pw};
+
+    SALT.len = 8;
+    for (i = 0; i < 8; i++) SALT.val[i] = i + 1; // set Salt
+
+    printf("Alice's Passphrase= %s\n", pp);
+
+    OCT_empty(&PW);
+    OCT_jstring(&PW, pp);  // set Password from string
+
+    // private key S0 of size EGS_NIST256 bytes derived from Password and Salt
+
+    PBKDF2(MC_SHA2, HASH_TYPE_NIST256, &S0, EGS_NIST256, &PW, &SALT, 1000);
+
+    printf("Alices private key= 0x");
+    OCT_output(&S0);
+
+    // Generate Key pair S/W
+
+    ECP_KEY_PAIR_GENERATE(NULL, &S0, &W0);
+    printf("Alices public key= 0x");
+    OCT_output(&W0);
+
+    res = ECP_PUBLIC_KEY_VALIDATE(&W0);
+    if (res != 0)
+    {
+        printf("ECP Public Key is invalid!\n");
+        return 0;
+    }
+
+    // Random private key for other party
+    ECP_KEY_PAIR_GENERATE(RNG, &S1, &W1);
+    res = ECP_PUBLIC_KEY_VALIDATE(&W1);
+    if (res != 0)
+    {
+        printf("ECP Public Key is invalid!\n");
+        return 0;
+    }
+    printf("Servers private key= 0x");
+    OCT_output(&S1);
+    printf("Servers public key= 0x");
+    OCT_output(&W1);
+
+    // Calculate common key using DH - IEEE 1363 method
+
+    ECP_SVDP_DH(&S0, &W1, &Z0, 0);
+    ECP_SVDP_DH(&S1, &W0, &Z1, 0);
+
+    if (!OCT_comp(&Z0, &Z1))
+    {
+        printf("*** ECPSVDP-DH Failed\n");
+        return 0;
+    }
+
+    KDF2(MC_SHA2, HASH_TYPE_NIST256, &KEY, AESKEY_NIST256, &Z0, NULL);
+
+    printf("Alice's DH Key=  0x");
+    OCT_output(&KEY);
+    printf("Servers DH Key=  0x");
+    OCT_output(&KEY);
+
+#if CURVETYPE_NIST256 != MONTGOMERY
+
+    char ds[EGS_NIST256], p1[30], p2[30], v[2 * EFS_NIST256 + 1], m[32], c[64], t[32], cs[EGS_NIST256];
+    octet DS = {0, sizeof(ds), ds};
+    octet CS = {0, sizeof(cs), cs};
+    octet P1 = {0, sizeof(p1), p1};
+    octet P2 = {0, sizeof(p2), p2};
+    octet V = {0, sizeof(v), v};
+    octet M = {0, sizeof(m), m};
+    octet C = {0, sizeof(c), c};
+    octet T = {0, sizeof(t), t};
+
+    printf("Testing ECIES\n");
+
+    P1.len = 3;
+    P1.val[0] = 0x0;
+    P1.val[1] = 0x1;
+    P1.val[2] = 0x2;
+    P2.len = 4;
+    P2.val[0] = 0x0;
+    P2.val[1] = 0x1;
+    P2.val[2] = 0x2;
+    P2.val[3] = 0x3;
+
+    M.len = 17;
+    for (i = 0; i <= 16; i++) M.val[i] = i;
+
+    ECP_ECIES_ENCRYPT(HASH_TYPE_NIST256, &P1, &P2, RNG, &W1, &M, 12, &V, &C, &T);
+
+    printf("Ciphertext= \n");
+    printf("V= 0x");
+    OCT_output(&V);
+    printf("C= 0x");
+    OCT_output(&C);
+    printf("T= 0x");
+    OCT_output(&T);
+
+    if (!ECP_ECIES_DECRYPT(HASH_TYPE_NIST256, &P1, &P2, &V, &C, &T, &S1, &M))
+    {
+        printf("*** ECIES Decryption Failed\n");
+        return 0;
+    }
+    else printf("Decryption succeeded\n");
+
+    printf("Message is 0x");
+    OCT_output(&M);
+
+
+    printf("Testing ECDSA\n");
+
+    if (ECP_SP_DSA(HASH_TYPE_NIST256, RNG, NULL, &S0, &M, &CS, &DS) != 0)
+    {
+        printf("***ECDSA Signature Failed\n");
+        return 0;
+    }
+
+    printf("Signature C = 0x");
+    OCT_output(&CS);
+    printf("Signature D = 0x");
+    OCT_output(&DS);
+
+    if (ECP_VP_DSA(HASH_TYPE_NIST256, &W0, &M, &CS, &DS) != 0)
+    {
+        printf("***ECDSA Verification Failed\n");
+        return 0;
+    }
+    else
+    {
+        printf("ECDSA Signature/Verification succeeded\n");
+    }
+
+#endif
+
+    return 1;
+}
+
+int ecdh_Ed448(csprng *RNG)
+{
+    using namespace Ed448;
+
+    int i, res;
+    unsigned long ran;
+    char *pp = (char *)"M0ng00se";
+    // These octets are automatically protected against buffer overflow attacks
+    // Note salt must be big enough to include an appended word
+    // Note ECIES ciphertext C must be big enough to include at least 1 appended block
+    // Recall EFS_Ed448 is field size in bytes. So EFS_Ed448=32 for 256-bit curve
+    char s0[2 * EGS_Ed448], s1[EGS_Ed448], w0[2 * EFS_Ed448 + 1], w1[2 * EFS_Ed448 + 1], z0[EFS_Ed448], z1[EFS_Ed448], key[AESKEY_Ed448], salt[40], pw[40];
+    octet S0 = {0, sizeof(s0), s0};
+    octet S1 = {0, sizeof(s1), s1};
+    octet W0 = {0, sizeof(w0), w0};
+    octet W1 = {0, sizeof(w1), w1};
+    octet Z0 = {0, sizeof(z0), z0};
+    octet Z1 = {0, sizeof(z1), z1};
+    octet KEY = {0, sizeof(key), key};
+    octet SALT = {0, sizeof(salt), salt};
+    octet PW = {0, sizeof(pw), pw};
+
+    SALT.len = 8;
+    for (i = 0; i < 8; i++) SALT.val[i] = i + 1; // set Salt
+
+    printf("Alice's Passphrase= %s\n", pp);
+
+    OCT_empty(&PW);
+    OCT_jstring(&PW, pp);  // set Password from string
+
+    // private key S0 of size EGS_Ed448 bytes derived from Password and Salt
+
+    PBKDF2(MC_SHA2, HASH_TYPE_Ed448, &S0, EGS_Ed448, &PW, &SALT, 1000);
+
+    printf("Alices private key= 0x");
+    OCT_output(&S0);
+
+    // Generate Key pair S/W
+
+    ECP_KEY_PAIR_GENERATE(NULL, &S0, &W0);
+    printf("Alices public key= 0x");
+    OCT_output(&W0);
+
+    res = ECP_PUBLIC_KEY_VALIDATE(&W0);
+    if (res != 0)
+    {
+        printf("ECP Public Key is invalid!\n");
+        return 0;
+    }
+
+    // Random private key for other party
+    ECP_KEY_PAIR_GENERATE(RNG, &S1, &W1);
+    res = ECP_PUBLIC_KEY_VALIDATE(&W1);
+    if (res != 0)
+    {
+        printf("ECP Public Key is invalid!\n");
+        return 0;
+    }
+    printf("Servers private key= 0x");
+    OCT_output(&S1);
+    printf("Servers public key= 0x");
+    OCT_output(&W1);
+
+    // Calculate common key using DH - IEEE 1363 method
+
+    ECP_SVDP_DH(&S0, &W1, &Z0, 0);
+    ECP_SVDP_DH(&S1, &W0, &Z1, 0);
+
+    if (!OCT_comp(&Z0, &Z1))
+    {
+        printf("*** ECPSVDP-DH Failed\n");
+        return 0;
+    }
+
+    KDF2(MC_SHA2, HASH_TYPE_Ed448, &KEY, AESKEY_Ed448, &Z0, NULL);
+
+    printf("Alice's DH Key=  0x");
+    OCT_output(&KEY);
+    printf("Servers DH Key=  0x");
+    OCT_output(&KEY);
+
+#if CURVETYPE_Ed448 != MONTGOMERY
+
+    char ds[EGS_Ed448], p1[30], p2[30], v[2 * EFS_Ed448 + 1], m[32], c[64], t[32], cs[EGS_Ed448];
+    octet DS = {0, sizeof(ds), ds};
+    octet CS = {0, sizeof(cs), cs};
+    octet P1 = {0, sizeof(p1), p1};
+    octet P2 = {0, sizeof(p2), p2};
+    octet V = {0, sizeof(v), v};
+    octet M = {0, sizeof(m), m};
+    octet C = {0, sizeof(c), c};
+    octet T = {0, sizeof(t), t};
+
+    printf("Testing ECIES\n");
+
+    P1.len = 3;
+    P1.val[0] = 0x0;
+    P1.val[1] = 0x1;
+    P1.val[2] = 0x2;
+    P2.len = 4;
+    P2.val[0] = 0x0;
+    P2.val[1] = 0x1;
+    P2.val[2] = 0x2;
+    P2.val[3] = 0x3;
+
+    M.len = 17;
+    for (i = 0; i <= 16; i++) M.val[i] = i;
+
+    ECP_ECIES_ENCRYPT(HASH_TYPE_Ed448, &P1, &P2, RNG, &W1, &M, 12, &V, &C, &T);
+
+    printf("Ciphertext= \n");
+    printf("V= 0x");
+    OCT_output(&V);
+    printf("C= 0x");
+    OCT_output(&C);
+    printf("T= 0x");
+    OCT_output(&T);
+
+    if (!ECP_ECIES_DECRYPT(HASH_TYPE_Ed448, &P1, &P2, &V, &C, &T, &S1, &M))
+    {
+        printf("*** ECIES Decryption Failed\n");
+        return 0;
+    }
+    else printf("Decryption succeeded\n");
+
+    printf("Message is 0x");
+    OCT_output(&M);
+
+
+    printf("Testing ECDSA\n");
+
+    if (ECP_SP_DSA(HASH_TYPE_Ed448, RNG, NULL, &S0, &M, &CS, &DS) != 0)
+    {
+        printf("***ECDSA Signature Failed\n");
+        return 0;
+    }
+
+    printf("Signature C = 0x");
+    OCT_output(&CS);
+    printf("Signature D = 0x");
+    OCT_output(&DS);
+
+    if (ECP_VP_DSA(HASH_TYPE_Ed448, &W0, &M, &CS, &DS) != 0)
+    {
+        printf("***ECDSA Verification Failed\n");
+        return 0;
+    }
+    else
+    {
+        printf("ECDSA Signature/Verification succeeded\n");
+    }
+
+#endif
+
+    return 1;
+}
+#endif
+
+int rsa_2048(csprng *RNG)
+{
+    using namespace RSA2048;
+
+    int i,valid;
+    unsigned long ran;
+    char m[RFS_RSA2048], ml[RFS_RSA2048], c[RFS_RSA2048], e[RFS_RSA2048], s[RFS_RSA2048];
+    rsa_public_key pub;
+    rsa_private_key priv;
+
+    octet M = {0, sizeof(m), m};
+    octet ML = {0, sizeof(ml), ml};
+    octet C = {0, sizeof(c), c};
+    octet E = {0, sizeof(e), e};
+    octet S = {0, sizeof(s), s};
+
+    printf("Generating public/private key pair\n");
+    RSA_KEY_PAIR(RNG, 65537, &priv, &pub, NULL, NULL);
+
+    printf("Encrypting test string\n");
+    OCT_jstring(&M, (char *)"Hello World\n");
+
+    OAEP_ENCODE(HASH_TYPE_RSA_RSA2048, &M, RNG, NULL, &E); // OAEP encode message m to e
+
+    RSA_ENCRYPT(&pub, &E, &C);   // encrypt encoded message
+    printf("Ciphertext= ");
+    OCT_output(&C);
+
+    printf("Decrypting test string\n");
+    RSA_DECRYPT(&priv, &C, &ML); // ... and then decrypt it
+    printf("Decrypted\n");
+    OAEP_DECODE(HASH_TYPE_RSA_RSA2048, NULL, &ML);  // decode it
+    printf("Decoded\n");
+    OCT_output_string(&ML);
+
+
+    PSS_ENCODE(HASH_TYPE_RSA_RSA2048, &M, RNG, &C);
+    //printf("T= 0x");OCT_output(&C);
+    if (PSS_VERIFY(HASH_TYPE_RSA_RSA2048, &M, &C))
+        printf("PSS encoding OK\n");
+    else
+        printf("PSS Encoding FAILED\n");
+
+
+// Signature
+    printf("Signing message\n");
+    PKCS15(HASH_TYPE_RSA_RSA2048, &M, &C);
+
+    RSA_DECRYPT(&priv, &C, &S); // create signature in S
+
+    printf("Signature= ");
+    OCT_output(&S);
+
+
+
+// Verification
+    valid=0;
+    RSA_ENCRYPT(&pub, &S, &ML);
+    PKCS15(HASH_TYPE_RSA_RSA2048, &M, &C);
+
+    if (OCT_comp(&C, &ML)) valid=1;
+    else {
+        PKCS15b(HASH_TYPE_RSA_RSA2048, &M, &C);
+        if (OCT_comp(&C, &ML)) valid=1;
+    }
+
+    if (valid) printf("Signature is valid\n");
+    else printf("Signature is INVALID\n");
+
+    RSA_PRIVATE_KEY_KILL(&priv);
+
+    OCT_clear(&M);
+    OCT_clear(&ML);   // clean up afterwards
+    OCT_clear(&C);
+    OCT_clear(&E);
+
+    return 1;
+}
+
+
+int main()
+{
+    int i, res;
+    unsigned long ran;
+
+    char raw[100];
+    octet RAW = {0, sizeof(raw), raw};
+    csprng RNG;                // Crypto Strong RNG
+
+    time((time_t *)&ran);
+
+    RAW.len = 100;              // fake random seed source
+    RAW.val[0] = ran;
+    RAW.val[1] = ran >> 8;
+    RAW.val[2] = ran >> 16;
+    RAW.val[3] = ran >> 24;
+    for (i = 0; i < 100; i++) RAW.val[i] = i;
+
+    CREATE_CSPRNG(&RNG, &RAW);  // initialise strong RNG
+
+    printf("\nTesting ECDH protocols for curve Ed25519\n");
+    ecdh_Ed25519(&RNG);
+#if CHUNK!=16
+    printf("\nTesting ECDH protocols for curve NIST256\n");
+    ecdh_NIST256(&RNG);
+    printf("\nTesting ECDH protocols for curve Ed448\n");
+    ecdh_Ed448(&RNG);
+#endif
+    printf("\nTesting RSA protocols for 2048-bit RSA\n");
+    rsa_2048(&RNG);
+
+    KILL_CSPRNG(&RNG);
+}
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/testeddsa b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/testeddsa
new file mode 100644
index 0000000..1e577d1
Binary files /dev/null and b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/testeddsa differ
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/testeddsa.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/testeddsa.cpp
new file mode 100644
index 0000000..bd43d86
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/testeddsa.cpp
@@ -0,0 +1,191 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* test driver and function exerciser for EDDSA API Functions */
+
+// Test Vectors from RFC8032
+
+// Observe that NIST standard does not support Ed25519ctx
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include <time.h>
+#include "randapi.h"
+#include "eddsa_Ed25519.h"
+#include "eddsa_Ed448.h"
+
+
+using namespace core;
+
+// prehash message
+static void PH_Ed25519(octet *M,octet *HM) {
+    hash512 sh512;
+    HASH512_init(&sh512);
+    for (int i=0;i<M->len;i++ )
+        HASH512_process(&sh512,M->val[i]);
+    HASH512_hash(&sh512,HM->val);
+    HM->len=64;
+}
+
+static void PH_Ed448(octet *M,octet *HM) {
+    sha3 SHA3;
+    SHA3_init(&SHA3,SHAKE256);
+    for (int i=0;i<M->len;i++) 
+        SHA3_process(&SHA3,M->val[i]);
+    SHA3_shake(&SHA3,HM->val,64); 
+    HM->len=64;
+}
+
+int eddsa_Ed25519(csprng *RNG)
+{
+    using namespace Ed25519;
+
+    char d[EGS_Ed25519], q[EFS_Ed25519], m[256], sig[2*EFS_Ed25519], hm[64];
+    octet D = {0, sizeof(d), d};
+    octet Q = {0, sizeof(q), q};
+    octet M = {0, sizeof(m), m};
+    octet SIG = {0, sizeof(sig), sig};
+    octet HM={0,sizeof(hm),hm};
+    bool prehash=false;
+    bool verify;
+
+// 32 bytes
+//    OCT_fromHex(&D,(char *)"9d61b19deffd5a60ba844af492ec2cc44449c5697b326919703bac031cae7f60");
+    OCT_fromHex(&D,(char *)"c5aa8df43f9f837bedb7442f31dcb7b166d38535076f094b85ce3a2e0b4458f7");
+//    OCT_fromHex(&D,(char *)"833fe62409237b9d62ec77587520911e9a759cec1d19755b7da901b96dca3d42");
+
+    EDDSA_KEY_PAIR_GENERATE(NULL, &D, &Q);
+    printf("Secret key= 0x");
+    OCT_output(&D);
+    printf("Public key= 0x");
+    OCT_output(&Q);
+    printf("\n");
+
+    M.len=2; M.val[0]=0xaf; M.val[1]=0x82;
+//    M.len=3; M.val[0]=0x61; M.val[1]=0x62;  M.val[2]=0x63;
+
+    if (prehash) {
+        PH_Ed25519(&M,&HM);
+        EDDSA_SIGNATURE(true,&D, NULL,&HM, &SIG);
+    } else {
+        EDDSA_SIGNATURE(false,&D, NULL,&M, &SIG);
+    }
+    printf("Signature= 0x");
+    OCT_output(&SIG);
+
+
+    if (prehash) {
+        PH_Ed25519(&M,&HM);
+        verify=EDDSA_VERIFY(true,&Q, NULL ,&HM, &SIG);
+    } else {
+        verify=EDDSA_VERIFY(false,&Q, NULL ,&M, &SIG);
+    }
+    if (verify)
+        printf("Signature is verified\n");
+    else
+        printf("Signature is NOT verified\n");
+
+    return 1;
+}
+
+int eddsa_Ed448(csprng *RNG)
+{
+    using namespace Ed448;
+
+    char d[EGS_Ed448+1],  q[EFS_Ed448 + 1], m[256], sig[2*EFS_Ed448+2], ctx[256], hm[64];
+    octet D = {0, sizeof(d), d};
+    octet Q = {0, sizeof(q), q};
+    octet M = {0, sizeof(m), m};
+    octet SIG = {0, sizeof(sig), sig};
+    octet CTX = {0, sizeof(ctx), ctx};
+    octet HM={0,sizeof(hm),hm};
+    bool prehash=false;
+    bool verify;
+
+// 57 bytes
+//    OCT_fromHex(&D,(char *)"6c82a562cb808d10d632be89c8513ebf6c929f34ddfa8c9f63c9960ef6e348a3528c8a3fcc2f044e39a3fc5b94492f8f032e7549a20098f95b");
+    OCT_fromHex(&D,(char *)"c4eab05d357007c632f3dbb48489924d552b08fe0c353a0d4a1f00acda2c463afbea67c5e8d2877c5e3bc397a659949ef8021e954e0a12274e");
+//    OCT_fromHex(&D,(char *)"833fe62409237b9d62ec77587520911e9a759cec1d19755b7da901b96dca3d42ef7822e0d5104127dc05d6dbefde69e3ab2cec7c867c6e2c49");
+
+
+    EDDSA_KEY_PAIR_GENERATE(NULL, &D, &Q);
+    printf("Secret key= 0x");
+    OCT_output(&D);
+    printf("Public key= 0x");
+    OCT_output(&Q);
+    printf("\n"); 
+
+    M.len=1; M.val[0]=0x03; 
+//    M.len=3; M.val[0]=0x61; M.val[1]=0x62;  M.val[2]=0x63;
+    CTX.len=3; CTX.val[0]=0x66; CTX.val[1]=0x6F; CTX.val[2]=0x6f;
+
+
+    if (prehash) {
+        PH_Ed448(&M,&HM);
+        EDDSA_SIGNATURE(true,&D, NULL,&HM, &SIG);
+    } else {
+        EDDSA_SIGNATURE(false,&D, NULL,&M, &SIG);
+    }
+
+    printf("Signature= 0x");
+    OCT_output(&SIG);
+
+    if (prehash) {
+        PH_Ed448(&M,&HM);
+        verify=EDDSA_VERIFY(true,&Q, NULL ,&HM, &SIG);
+    } else {
+        verify=EDDSA_VERIFY(false,&Q, NULL ,&M, &SIG);
+    }
+    if (verify)
+        printf("Signature is verified\n");
+    else
+        printf("Signature is NOT verified\n");
+
+    return 1;
+}
+
+int main()
+{
+    int i, res;
+    unsigned long ran;
+
+    char raw[100];
+    octet RAW = {0, sizeof(raw), raw};
+    csprng RNG;                // Crypto Strong RNG
+
+    time((time_t *)&ran);
+
+    RAW.len = 100;              // fake random seed source
+    RAW.val[0] = ran;
+    RAW.val[1] = ran >> 8;
+    RAW.val[2] = ran >> 16;
+    RAW.val[3] = ran >> 24;
+    for (i = 4; i < 100; i++) RAW.val[i] = i;
+
+    CREATE_CSPRNG(&RNG, &RAW);  // initialise strong RNG
+
+    printf("\nTesting EDDSA protocols for curve Ed25519\n");
+    eddsa_Ed25519(&RNG);
+    printf("\nTesting EDDSA protocols for curve Ed448\n");
+    eddsa_Ed448(&RNG);
+
+    KILL_CSPRNG(&RNG);
+}
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/testhpke.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/testhpke.cpp
new file mode 100644
index 0000000..e761e3a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/testhpke.cpp
@@ -0,0 +1,590 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* test driver and function exerciser for HPKE API Functions */
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include <time.h>
+#include "hpke_C25519.h"
+#include "hpke_NIST521.h"
+#include "hpke_NIST256.h"
+
+using namespace core;
+
+int hpke_C25519()
+{
+    using namespace C25519;
+
+    int res=0;
+    int config_id=0x520; // 01|01|00100000 = 1, 1, 32
+    int i,mode;
+    char info[32];
+
+    char seede[EGS_C25519];
+    char seedr[EGS_C25519];
+    char seeds[EGS_C25519];
+    octet seedE = {0, sizeof(seede), seede};
+    octet seedR = {0, sizeof(seedr), seedr};
+    octet seedS = {0, sizeof(seeds), seeds};
+
+    char skr[EGS_C25519];
+    char sks[EGS_C25519];
+    char ske[EGS_C25519];
+    char psks[32];
+    char pskid[32];
+    char pkr[EFS_C25519];
+    char pks[EFS_C25519];
+    char pke[EFS_C25519];
+    char z[72];
+    char plain[80];
+    char cipher[80];
+    char aad[32];
+    char tag[32];
+    char exporter_secret[128];
+    
+    octet INFO = {0, sizeof(info), info};
+    octet skR = {0, sizeof(skr), skr};
+    octet skS = {0, sizeof(sks), sks};
+    octet skE = {0, sizeof(ske), ske};
+    octet psk = {0, sizeof(psks), psks};
+    octet pskID = {0,sizeof(pskid), pskid};
+    octet pkR = {0, sizeof(pkr), pkr};
+    octet pkS = {0, sizeof(pks), pks};
+    octet pkE = {0, sizeof(pke), pke};
+    octet Z = {0, sizeof(z), z};
+    octet PLAIN = {0,sizeof(plain),plain};
+    octet CIPHER = {0,sizeof(cipher),cipher};
+    octet AAD = {0,sizeof(aad),aad};
+    octet TAG = {0,sizeof(tag),tag};
+    octet EXPORTER_SECRET = {0,sizeof(exporter_secret),exporter_secret};      
+              
+    OCT_fromHex(&INFO,(char *)"4f6465206f6e2061204772656369616e2055726e");
+    OCT_fromHex(&psk,(char *)"0247fd33b913760fa1fa51e1892d9f307fbe65eb171e8132c2af18555a738b82");
+    OCT_fromHex(&pskID,(char *)"456e6e796e20447572696e206172616e204d6f726961");
+    OCT_fromHex(&PLAIN,(char *)"4265617574792069732074727574682c20747275746820626561757479");
+    OCT_fromHex(&AAD,(char *)"436f756e742d30");
+
+    char key[32];
+    char nonce[12];
+    octet KEY = {0, sizeof(key), key};
+    octet NONCE = {0, sizeof(nonce), nonce};
+
+// Mode 0
+
+    mode=0;
+    printf("\nMode 0\n");
+
+    OCT_fromHex(&seedE,(char *)"7268600d403fce431561aef583ee1613527cff655c1343f29812e66706df3234");
+    OCT_fromHex(&seedR,(char *)"6db9df30aa07dd42ee5e8181afdb977e538f5e1fec8a06223f33f7013e525037");
+
+    DeriveKeyPair(config_id,&skE,&pkE,&seedE);
+    DeriveKeyPair(config_id,&skR,&pkR,&seedR);
+
+    HPKE_Encap(config_id,&skE,&Z,&pkE,&pkR);
+
+    printf("pkE= "); OCT_output(&pkE); 
+    printf("Encapsulated Secret= "); OCT_output(&Z);
+
+    HPKE_Decap(config_id,&skR,&Z,&pkE,&pkR);
+    printf("Decapsulated Secret= "); OCT_output(&Z);
+
+    HPKE_KeySchedule(config_id,&KEY,&NONCE,&EXPORTER_SECRET,mode,&Z,&INFO,NULL,NULL);
+    
+    printf("Key=   "); OCT_output(&KEY);
+    printf("Nonce= "); OCT_output(&NONCE);
+    printf("Exporter Secret= "); OCT_output(&EXPORTER_SECRET);  
+
+    AES_GCM_ENCRYPT(&KEY,&NONCE,&AAD,&PLAIN,&CIPHER,&TAG);
+
+    printf("Cipher= "); OCT_output(&CIPHER);
+    printf("Tag= "); OCT_output(&TAG);
+
+// Mode 1
+    mode=1;
+    printf("\nMode 1\n");
+    OCT_fromHex(&seedE,(char *)"78628c354e46f3e169bd231be7b2ff1c77aa302460a26dbfa15515684c00130b");
+    OCT_fromHex(&seedR,(char *)"d4a09d09f575fef425905d2ab396c1449141463f698f8efdb7accfaff8995098");
+    DeriveKeyPair(config_id,&skE,&pkE,&seedE);
+    DeriveKeyPair(config_id,&skR,&pkR,&seedR);
+    
+    HPKE_Encap(config_id,&skE,&Z,&pkE,&pkR);
+    
+    printf("pkE= "); OCT_output(&pkE); 
+    printf("Encapsulated Z= "); OCT_output(&Z);
+
+    HPKE_Decap(config_id,&skR,&Z,&pkE,&pkR);
+    printf("Decapsulated Z= "); OCT_output(&Z);
+
+    HPKE_KeySchedule(config_id,&KEY,&NONCE,&EXPORTER_SECRET,mode,&Z,&INFO,&psk,&pskID);
+
+    printf("Key=   "); OCT_output(&KEY);
+    printf("Nonce= "); OCT_output(&NONCE);
+    printf("Exporter Secret= "); OCT_output(&EXPORTER_SECRET);    
+
+    AES_GCM_ENCRYPT(&KEY,&NONCE,&AAD,&PLAIN,&CIPHER,&TAG);
+
+    printf("Cipher= "); OCT_output(&CIPHER);
+    printf("Tag= "); OCT_output(&TAG);
+
+// Mode 2
+    mode=2;
+    printf("\nMode 2\n");
+    OCT_fromHex(&seedE,(char *)"6e6d8f200ea2fb20c30b003a8b4f433d2f4ed4c2658d5bc8ce2fef718059c9f7");
+    OCT_fromHex(&seedR,(char *)"f1d4a30a4cef8d6d4e3b016e6fd3799ea057db4f345472ed302a67ce1c20cdec");
+    OCT_fromHex(&seedS,(char *)"94b020ce91d73fca4649006c7e7329a67b40c55e9e93cc907d282bbbff386f58");
+    DeriveKeyPair(config_id,&skE,&pkE,&seedE);
+    DeriveKeyPair(config_id,&skR,&pkR,&seedR);
+    DeriveKeyPair(config_id,&skS,&pkS,&seedS);
+
+
+    HPKE_AuthEncap(config_id,&skE,&skS,&Z,&pkE,&pkR,&pkS);
+
+    printf("pkE= "); OCT_output(&pkE); 
+    printf("Encapsulated Z= "); OCT_output(&Z);
+
+    HPKE_AuthDecap(config_id,&skR,&Z,&pkE,&pkR,&pkS);
+    printf("Decapsulated Z= "); OCT_output(&Z);
+
+    HPKE_KeySchedule(config_id,&KEY,&NONCE,&EXPORTER_SECRET,mode,&Z,&INFO,NULL,NULL);
+
+    printf("Key=   "); OCT_output(&KEY);
+    printf("Nonce= "); OCT_output(&NONCE);
+    printf("Exporter Secret= "); OCT_output(&EXPORTER_SECRET);  
+    
+    AES_GCM_ENCRYPT(&KEY,&NONCE,&AAD,&PLAIN,&CIPHER,&TAG);
+
+    printf("Cipher= "); OCT_output(&CIPHER);
+    printf("Tag= "); OCT_output(&TAG);
+
+// Mode 3
+    mode=3;
+    printf("\nMode 3\n");
+
+    OCT_fromHex(&seedE,(char *)"4303619085a20ebcf18edd22782952b8a7161e1dbae6e46e143a52a96127cf84");
+    OCT_fromHex(&seedR,(char *)"4b16221f3b269a88e207270b5e1de28cb01f847841b344b8314d6a622fe5ee90");
+    OCT_fromHex(&seedS,(char *)"62f77dcf5df0dd7eac54eac9f654f426d4161ec850cc65c54f8b65d2e0b4e345");
+    DeriveKeyPair(config_id,&skE,&pkE,&seedE);
+    DeriveKeyPair(config_id,&skR,&pkR,&seedR);
+    DeriveKeyPair(config_id,&skS,&pkS,&seedS);
+
+    HPKE_AuthEncap(config_id,&skE,&skS,&Z,&pkE,&pkR,&pkS);
+
+    printf("pkE= "); OCT_output(&pkE); 
+    printf("Encapsulated Z= "); OCT_output(&Z);
+
+    HPKE_AuthDecap(config_id,&skR,&Z,&pkE,&pkR,&pkS);
+    printf("Decapsulated Z= "); OCT_output(&Z);
+
+    HPKE_KeySchedule(config_id,&KEY,&NONCE,&EXPORTER_SECRET,mode,&Z,&INFO,&psk,&pskID);
+
+    printf("Key=   "); OCT_output(&KEY);
+    printf("Nonce= "); OCT_output(&NONCE);
+    printf("Exporter Secret= "); OCT_output(&EXPORTER_SECRET);  
+    
+    AES_GCM_ENCRYPT(&KEY,&NONCE,&AAD,&PLAIN,&CIPHER,&TAG);
+
+    printf("Cipher= "); OCT_output(&CIPHER);
+    printf("Tag= "); OCT_output(&TAG);
+
+    return res;
+}
+
+int hpke_NIST521()
+{
+    using namespace NIST521;
+
+    int res=0;
+    int config_id=0xB12; // 10|11|00010010 = 2, 3, 18
+    int i,mode;
+    char info[64];
+
+    char seede[EGS_NIST521];
+    char seedr[EGS_NIST521];
+    char seeds[EGS_NIST521];
+    octet seedE = {0, sizeof(seede), seede};
+    octet seedR = {0, sizeof(seedr), seedr};
+    octet seedS = {0, sizeof(seeds), seeds};
+
+    char skr[EGS_NIST521];
+    char sks[EGS_NIST521];
+    char ske[EGS_NIST521];
+    char psks[64];
+    char pskid[64];
+    char pkr[2*EFS_NIST521+1];
+    char pks[2*EFS_NIST521+1];
+    char pke[2*EFS_NIST521+1];
+    char z[256];
+    char plain[80];
+    char cipher[80];
+    char aad[32];
+    char tag[32];
+    char exporter_secret[128];
+    
+    octet INFO = {0, sizeof(info), info};
+    octet skR = {0, sizeof(skr), skr};
+    octet skS = {0, sizeof(sks), sks};
+    octet skE = {0, sizeof(ske), ske};
+    octet psk = {0, sizeof(psks), psks};
+    octet pskID = {0,sizeof(pskid), pskid};
+    octet pkR = {0, sizeof(pkr), pkr};
+    octet pkS = {0, sizeof(pks), pks};
+    octet pkE = {0, sizeof(pke), pke};
+    octet Z = {0, sizeof(z), z};
+    octet PLAIN = {0,sizeof(plain),plain};
+    octet CIPHER = {0,sizeof(cipher),cipher};
+    octet AAD = {0,sizeof(aad),aad};
+    octet TAG = {0,sizeof(tag),tag};
+    octet EXPORTER_SECRET = {0,sizeof(exporter_secret),exporter_secret};      
+
+    OCT_fromHex(&INFO,(char *)"4f6465206f6e2061204772656369616e2055726e");
+    OCT_fromHex(&psk,(char *)"0247fd33b913760fa1fa51e1892d9f307fbe65eb171e8132c2af18555a738b82");
+    OCT_fromHex(&pskID,(char *)"456e6e796e20447572696e206172616e204d6f726961");
+    OCT_fromHex(&PLAIN,(char *)"4265617574792069732074727574682c20747275746820626561757479");
+    OCT_fromHex(&AAD,(char *)"436f756e742d30");
+
+    char key[64];
+    char nonce[24];
+    octet KEY = {0, sizeof(key), key};
+    octet NONCE = {0, sizeof(nonce), nonce};
+
+// Mode 0
+
+    mode=0;
+    printf("\nMode 0\n");
+
+    OCT_fromHex(&seedE,(char *)"7f06ab8215105fc46aceeb2e3dc5028b44364f960426eb0d8e4026c2f8b5d7e7a986688f1591abf5ab753c357a5d6f0440414b4ed4ede71317772ac98d9239f70904");
+    OCT_fromHex(&seedR,(char *)"2ad954bbe39b7122529f7dde780bff626cd97f850d0784a432784e69d86eccaade43b6c10a8ffdb94bf943c6da479db137914ec835a7e715e36e45e29b587bab3bf1");
+   
+    DeriveKeyPair(config_id,&skE,&pkE,&seedE);
+    DeriveKeyPair(config_id,&skR,&pkR,&seedR);
+
+    HPKE_Encap(config_id,&skE,&Z,&pkE,&pkR);
+
+    printf("pkE= "); OCT_output(&pkE); 
+    printf("Encapsulated Z= "); OCT_output(&Z);
+
+    HPKE_Decap(config_id,&skR,&Z,&pkE,&pkR);
+    printf("Decapsulated Z= "); OCT_output(&Z);
+
+    HPKE_KeySchedule(config_id,&KEY,&NONCE,&EXPORTER_SECRET,mode,&Z,&INFO,NULL,NULL);
+
+    printf("Key=   "); OCT_output(&KEY);
+    printf("Nonce= "); OCT_output(&NONCE);
+    printf("Exporter Secret= "); OCT_output(&EXPORTER_SECRET); 
+    
+    AES_GCM_ENCRYPT(&KEY,&NONCE,&AAD,&PLAIN,&CIPHER,&TAG);
+
+    printf("Cipher= "); OCT_output(&CIPHER);
+    printf("Tag= "); OCT_output(&TAG);
+
+// Mode 1
+    mode=1;
+    printf("\nMode 1\n");
+
+    OCT_fromHex(&seedE,(char *)"f3ebfa9a69a924e672114fcd9e06fa9559e937f7eccce4181a2b506df53dbe514be12f094bb28e01de19dd345b4f7ede5ad7eaa6b9c3019592ec68eaae9a14732ce0");
+    OCT_fromHex(&seedR,(char *)"a2a2458705e278e574f835effecd18232f8a4c459e7550a09d44348ae5d3b1ea9d95c51995e657ad6f7cae659f5e186126a471c017f8f5e41da9eba74d4e0473e179");
+    DeriveKeyPair(config_id,&skE,&pkE,&seedE);
+    DeriveKeyPair(config_id,&skR,&pkR,&seedR);
+    
+    HPKE_Encap(config_id,&skE,&Z,&pkE,&pkR);
+    
+    printf("pkE= "); OCT_output(&pkE); 
+    printf("Encapsulated Z= "); OCT_output(&Z);
+
+    HPKE_Decap(config_id,&skR,&Z,&pkE,&pkR);
+    printf("Decapsulated Z= "); OCT_output(&Z);
+
+    HPKE_KeySchedule(config_id,&KEY,&NONCE,&EXPORTER_SECRET,mode,&Z,&INFO,&psk,&pskID);
+
+    printf("Key=   "); OCT_output(&KEY);
+    printf("Nonce= "); OCT_output(&NONCE);
+    printf("Exporter Secret= "); OCT_output(&EXPORTER_SECRET); 
+    
+    AES_GCM_ENCRYPT(&KEY,&NONCE,&AAD,&PLAIN,&CIPHER,&TAG);
+
+    printf("Cipher= "); OCT_output(&CIPHER);
+    printf("Tag= "); OCT_output(&TAG);
+
+// Mode 2
+    mode=2;
+    printf("\nMode 2\n");
+
+    OCT_fromHex(&seedE,(char *)"fe1c589c2a05893895a537f38c7cb4300b5a7e8fef3d6ccb8f07a498029c61e90262e009dc254c7f6235f9c6b2fd6aeff0a714db131b09258c16e217b7bd2aa619b0");
+    OCT_fromHex(&seedR,(char *)"8feea0438481fc0ecd470d6adfcda334a759c6b8650452c5a5dd9b2dd2cc9be33d2bb7ee64605fc07ab4664a58bb9a8de80defe510b6c97d2daf85b92cd4bb0a66bf");
+    OCT_fromHex(&seedS,(char *)"2f66a68b85ef04822b054ef521838c00c64f8b6226935593b69e13a1a2461a4f1a74c10c836e87eed150c0db85d4e4f506cbb746149befac6f5c07dc48a615ef92db");
+    DeriveKeyPair(config_id,&skE,&pkE,&seedE);
+    DeriveKeyPair(config_id,&skR,&pkR,&seedR);
+    DeriveKeyPair(config_id,&skS,&pkS,&seedS);
+ 
+    HPKE_AuthEncap(config_id,&skE,&skS,&Z,&pkE,&pkR,&pkS);
+
+    printf("pkE= "); OCT_output(&pkE); 
+    printf("Encapsulated Z= "); OCT_output(&Z);
+
+    HPKE_AuthDecap(config_id,&skR,&Z,&pkE,&pkR,&pkS);
+    printf("Decapsulated Z= "); OCT_output(&Z);
+
+    HPKE_KeySchedule(config_id,&KEY,&NONCE,&EXPORTER_SECRET,mode,&Z,&INFO,NULL,NULL);
+
+    printf("Key=   "); OCT_output(&KEY);
+    printf("Nonce= "); OCT_output(&NONCE);
+    printf("Exporter Secret= "); OCT_output(&EXPORTER_SECRET); 
+    
+    AES_GCM_ENCRYPT(&KEY,&NONCE,&AAD,&PLAIN,&CIPHER,&TAG);
+
+    printf("Cipher= "); OCT_output(&CIPHER);
+    printf("Tag= "); OCT_output(&TAG);
+
+// Mode 3
+    mode=3;
+    printf("\nMode 3\n");
+
+    OCT_fromHex(&seedE,(char *)"54272797b1fbc128a6967ff1fd606e0c67868f7762ce1421439cbc9e90ce1b28d566e6c2acbce712e48eebf236696eb680849d6873e9959395b2931975d61d38bd6c");
+    OCT_fromHex(&seedR,(char *)"3db434a8bc25b27eb0c590dc64997ab1378a99f52b2cb5a5a5b2fa540888f6c0f09794c654f4468524e040e6b4eca2c9dcf229f908b9d318f960cc9e9baa92c5eee6");
+    OCT_fromHex(&seedS,(char *)"65d523d9b37e1273eb25ad0527d3a7bd33f67208dd1666d9904c6bc04969ae5831a8b849e7ff642581f2c3e56be84609600d3c6bbdaded3f6989c37d2892b1e978d5");
+    DeriveKeyPair(config_id,&skE,&pkE,&seedE);
+    DeriveKeyPair(config_id,&skR,&pkR,&seedR);
+    DeriveKeyPair(config_id,&skS,&pkS,&seedS);
+
+    HPKE_AuthEncap(config_id,&skE,&skS,&Z,&pkE,&pkR,&pkS);
+
+    printf("pkE= "); OCT_output(&pkE); 
+    printf("Encapsulated Z= "); OCT_output(&Z);
+
+    HPKE_AuthDecap(config_id,&skR,&Z,&pkE,&pkR,&pkS);
+    printf("Decapsulated Z= "); OCT_output(&Z);
+
+    HPKE_KeySchedule(config_id,&KEY,&NONCE,&EXPORTER_SECRET,mode,&Z,&INFO,&psk,&pskID);
+
+    printf("Key=   "); OCT_output(&KEY);
+    printf("Nonce= "); OCT_output(&NONCE);
+    printf("Exporter Secret= "); OCT_output(&EXPORTER_SECRET); 
+    
+    AES_GCM_ENCRYPT(&KEY,&NONCE,&AAD,&PLAIN,&CIPHER,&TAG);
+
+    printf("Cipher= "); OCT_output(&CIPHER);
+    printf("Tag= "); OCT_output(&TAG);
+
+    return res;
+}
+
+int hpke_NIST256()
+{
+    using namespace NIST256;
+
+    int res=0;
+    int config_id=0x510; // 10|11|00010010 = 2, 3, 18  // 01|01|00010000  = 1, 1, 16
+    int i,mode;
+    char info[64];
+
+    char seede[EGS_NIST256];
+    char seedr[EGS_NIST256];
+    char seeds[EGS_NIST256];
+    octet seedE = {0, sizeof(seede), seede};
+    octet seedR = {0, sizeof(seedr), seedr};
+    octet seedS = {0, sizeof(seeds), seeds};
+
+    char skr[EGS_NIST256];
+    char sks[EGS_NIST256];
+    char ske[EGS_NIST256];
+    char psks[64];
+    char pskid[64];
+    char pkr[2*EFS_NIST256+1];
+    char pks[2*EFS_NIST256+1];
+    char pke[2*EFS_NIST256+1];
+    char z[256];
+    char plain[80];
+    char cipher[80];
+    char aad[32];
+    char tag[32];
+    char exporter_secret[128];
+    
+    octet INFO = {0, sizeof(info), info};
+    octet skR = {0, sizeof(skr), skr};
+    octet skS = {0, sizeof(sks), sks};
+    octet skE = {0, sizeof(ske), ske};
+    octet psk = {0, sizeof(psks), psks};
+    octet pskID = {0,sizeof(pskid), pskid};
+    octet pkR = {0, sizeof(pkr), pkr};
+    octet pkS = {0, sizeof(pks), pks};
+    octet pkE = {0, sizeof(pke), pke};
+    octet Z = {0, sizeof(z), z};
+    octet PLAIN = {0,sizeof(plain),plain};
+    octet CIPHER = {0,sizeof(cipher),cipher};
+    octet AAD = {0,sizeof(aad),aad};
+    octet TAG = {0,sizeof(tag),tag};
+    octet EXPORTER_SECRET = {0,sizeof(exporter_secret),exporter_secret};      
+
+    OCT_fromHex(&INFO,(char *)"4f6465206f6e2061204772656369616e2055726e");
+    OCT_fromHex(&psk,(char *)"0247fd33b913760fa1fa51e1892d9f307fbe65eb171e8132c2af18555a738b82");
+    OCT_fromHex(&pskID,(char *)"456e6e796e20447572696e206172616e204d6f726961");
+    OCT_fromHex(&PLAIN,(char *)"4265617574792069732074727574682c20747275746820626561757479");
+    OCT_fromHex(&AAD,(char *)"436f756e742d30");
+
+    char key[64];
+    char nonce[24];
+    octet KEY = {0, sizeof(key), key};
+    octet NONCE = {0, sizeof(nonce), nonce};
+
+// Mode 0
+
+    mode=0;
+    printf("\nMode 0\n");
+
+    OCT_fromHex(&seedE,(char *)"4270e54ffd08d79d5928020af4686d8f6b7d35dbe470265f1f5aa22816ce860e");
+    OCT_fromHex(&seedR,(char *)"668b37171f1072f3cf12ea8a236a45df23fc13b82af3609ad1e354f6ef817550");
+
+	//printf("seedE= "); OCT_output(&seedE);
+   
+    DeriveKeyPair(config_id,&skE,&pkE,&seedE);
+
+    //printf("1. pkE= "); OCT_output(&pkE); 
+
+    DeriveKeyPair(config_id,&skR,&pkR,&seedR);
+
+    HPKE_Encap(config_id,&skE,&Z,&pkE,&pkR);
+    printf("pkE= "); OCT_output(&pkE); 
+
+
+    printf("Encapsulated Z= "); OCT_output(&Z);
+
+    HPKE_Decap(config_id,&skR,&Z,&pkE,&pkR);
+    printf("Decapsulated Z= "); OCT_output(&Z);
+
+    HPKE_KeySchedule(config_id,&KEY,&NONCE,&EXPORTER_SECRET,mode,&Z,&INFO,NULL,NULL);
+
+    printf("Key=   "); OCT_output(&KEY);
+    printf("Nonce= "); OCT_output(&NONCE);
+    printf("Exporter Secret= "); OCT_output(&EXPORTER_SECRET); 
+    
+    AES_GCM_ENCRYPT(&KEY,&NONCE,&AAD,&PLAIN,&CIPHER,&TAG);
+
+    printf("Cipher= "); OCT_output(&CIPHER);
+    printf("Tag= "); OCT_output(&TAG);
+
+// Mode 1
+    mode=1;
+    printf("\nMode 1\n");
+
+    OCT_fromHex(&seedE,(char *)"2afa611d8b1a7b321c761b483b6a053579afa4f767450d3ad0f84a39fda587a6");
+    OCT_fromHex(&seedR,(char *)"d42ef874c1913d9568c9405407c805baddaffd0898a00f1e84e154fa787b2429");
+    DeriveKeyPair(config_id,&skE,&pkE,&seedE);
+    DeriveKeyPair(config_id,&skR,&pkR,&seedR);
+    
+    HPKE_Encap(config_id,&skE,&Z,&pkE,&pkR);
+    
+    printf("pkE= "); OCT_output(&pkE); 
+    printf("Encapsulated Z= "); OCT_output(&Z);
+
+    HPKE_Decap(config_id,&skR,&Z,&pkE,&pkR);
+    printf("Decapsulated Z= "); OCT_output(&Z);
+
+    HPKE_KeySchedule(config_id,&KEY,&NONCE,&EXPORTER_SECRET,mode,&Z,&INFO,&psk,&pskID);
+
+    printf("Key=   "); OCT_output(&KEY);
+    printf("Nonce= "); OCT_output(&NONCE);
+    printf("Exporter Secret= "); OCT_output(&EXPORTER_SECRET); 
+    
+    AES_GCM_ENCRYPT(&KEY,&NONCE,&AAD,&PLAIN,&CIPHER,&TAG);
+
+    printf("Cipher= "); OCT_output(&CIPHER);
+    printf("Tag= "); OCT_output(&TAG);
+
+// Mode 2
+    mode=2;
+    printf("\nMode 2\n");
+
+    OCT_fromHex(&seedE,(char *)"798d82a8d9ea19dbc7f2c6dfa54e8a6706f7cdc119db0813dacf8440ab37c857");
+    OCT_fromHex(&seedR,(char *)"7bc93bde8890d1fb55220e7f3b0c107ae7e6eda35ca4040bb6651284bf0747ee");
+    OCT_fromHex(&seedS,(char *)"874baa0dcf93595a24a45a7f042e0d22d368747daaa7e19f80a802af19204ba8");
+    DeriveKeyPair(config_id,&skE,&pkE,&seedE);
+    DeriveKeyPair(config_id,&skR,&pkR,&seedR);
+    DeriveKeyPair(config_id,&skS,&pkS,&seedS);
+ 
+    HPKE_AuthEncap(config_id,&skE,&skS,&Z,&pkE,&pkR,&pkS);
+
+    printf("pkE= "); OCT_output(&pkE); 
+    printf("Encapsulated Z= "); OCT_output(&Z);
+
+    HPKE_AuthDecap(config_id,&skR,&Z,&pkE,&pkR,&pkS);
+    printf("Decapsulated Z= "); OCT_output(&Z);
+
+    HPKE_KeySchedule(config_id,&KEY,&NONCE,&EXPORTER_SECRET,mode,&Z,&INFO,NULL,NULL);
+
+    printf("Key=   "); OCT_output(&KEY);
+    printf("Nonce= "); OCT_output(&NONCE);
+    printf("Exporter Secret= "); OCT_output(&EXPORTER_SECRET); 
+    
+    AES_GCM_ENCRYPT(&KEY,&NONCE,&AAD,&PLAIN,&CIPHER,&TAG);
+
+    printf("Cipher= "); OCT_output(&CIPHER);
+    printf("Tag= "); OCT_output(&TAG);
+
+// Mode 3
+    mode=3;
+    printf("\nMode 3\n");
+
+    OCT_fromHex(&seedE,(char *)"3c1fceb477ec954c8d58ef3249e4bb4c38241b5925b95f7486e4d9f1d0d35fbb");
+    OCT_fromHex(&seedR,(char *)"abcc2da5b3fa81d8aabd91f7f800a8ccf60ec37b1b585a5d1d1ac77f258b6cca");
+    OCT_fromHex(&seedS,(char *)"6262031f040a9db853edd6f91d2272596eabbc78a2ed2bd643f770ecd0f19b82");
+    DeriveKeyPair(config_id,&skE,&pkE,&seedE);
+    DeriveKeyPair(config_id,&skR,&pkR,&seedR);
+    DeriveKeyPair(config_id,&skS,&pkS,&seedS);
+
+    HPKE_AuthEncap(config_id,&skE,&skS,&Z,&pkE,&pkR,&pkS);
+
+    printf("pkE= "); OCT_output(&pkE); 
+    printf("Encapsulated Z= "); OCT_output(&Z);
+
+    HPKE_AuthDecap(config_id,&skR,&Z,&pkE,&pkR,&pkS);
+    printf("Decapsulated Z= "); OCT_output(&Z);
+
+    HPKE_KeySchedule(config_id,&KEY,&NONCE,&EXPORTER_SECRET,mode,&Z,&INFO,&psk,&pskID);
+
+    printf("Key=   "); OCT_output(&KEY);
+    printf("Nonce= "); OCT_output(&NONCE);
+    printf("Exporter Secret= "); OCT_output(&EXPORTER_SECRET); 
+    
+    AES_GCM_ENCRYPT(&KEY,&NONCE,&AAD,&PLAIN,&CIPHER,&TAG);
+
+    printf("Cipher= "); OCT_output(&CIPHER);
+    printf("Tag= "); OCT_output(&TAG);
+
+    return res;
+}
+
+int main()
+{
+    printf("\n%d bit build", CHUNK);
+
+    printf("\nTesting HPKE for curve C25519\n");
+    hpke_C25519();
+
+    printf("\nTesting HPKE for curve NIST521\n");
+    hpke_NIST521();
+
+    printf("\nTesting HPKE for curve NIST256\n");
+    hpke_NIST256();
+}
+
+
+
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/testhtp.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/testhtp.cpp
new file mode 100644
index 0000000..3f21370
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/testhtp.cpp
@@ -0,0 +1,714 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* test driver and function exerciser for HTP API Functions */
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include <time.h>
+#include "core.h"
+#include "randapi.h"
+#include "ecp_NIST256.h"
+#include "ecp_Ed25519.h"
+#include "ecp_C25519.h"
+#include "ecp_Ed448.h"
+#include "ecp_SECP256K1.h"
+#include "ecp_BLS12381.h"
+#include "ecp2_BLS12381.h"
+
+using namespace core;
+
+#define CEIL(a,b) (((a)-1)/(b)+1)
+
+/* Select curves 1,2,3,7,17,29 */
+
+/* https://datatracker.ietf.org/doc/draft-irtf-cfrg-hash-to-curve/ */
+
+static void hash_to_field_Ed25519(int hash,int hlen,F25519::FP *u,octet *DST,octet *M, int ctr)
+{
+    using namespace Ed25519;
+    using namespace Ed25519_BIG;
+    using namespace Ed25519_FP;
+    
+    int i,j,L,k,m;
+    BIG q,w,r;
+    DBIG dx;
+    char okm[512],fd[256];
+    octet OKM = {0,sizeof(okm),okm};
+
+    BIG_rcopy(q, Modulus);
+    k=BIG_nbits(q);
+    BIG_rcopy(r, CURVE_Order);
+    m=BIG_nbits(r);
+    L=CEIL(k+CEIL(m,2),8);
+
+    XMD_Expand(hash,hlen,&OKM,L*ctr,DST,M);
+    for (i=0;i<ctr;i++)
+    {
+        for (j=0;j<L;j++)
+            fd[j]=OKM.val[i*L+j];
+        
+        BIG_dfromBytesLen(dx,fd,L);
+        BIG_dmod(w,dx,q);
+        FP_nres(&u[i],w);
+    }
+}
+
+int htp_Ed25519(char *mess)
+{
+    using namespace Ed25519;
+    using namespace Ed25519_BIG;
+    using namespace Ed25519_FP;
+ 
+    int res=0;
+    BIG r;
+    FP u[2];
+    ECP P,P1;
+    char dst[100];
+    char msg[2000];
+    octet MSG = {0,sizeof(msg),msg};
+    octet DST = {0,sizeof(dst),dst};
+
+    BIG_rcopy(r, CURVE_Order);
+    printf("Random oracle - message= %s\n",mess);
+    OCT_jstring(&MSG,mess);
+
+    OCT_jstring(&DST,(char *)"QUUX-V01-CS02-with-edwards25519_XMD:SHA-512_ELL2_RO_");
+
+    hash_to_field_Ed25519(MC_SHA2, SHA512,u,&DST,&MSG,2);
+    printf("u[0]= "); FP_output(&u[0]); printf("\n");
+    printf("u[1]= "); FP_output(&u[1]); printf("\n");
+    ECP_map2point(&P,&u[0]);
+    printf("Q[0]= "); ECP_output(&P);
+    ECP_map2point(&P1,&u[1]);
+    printf("Q[1]= "); ECP_output(&P1);
+    ECP_add(&P,&P1);
+    ECP_cfp(&P);
+    ECP_affine(&P);
+    printf("P= "); ECP_output(&P); printf("\n");
+    ECP_mul(&P,r);
+    if (!ECP_isinf(&P))
+        printf("Hashing failure\n");
+
+    printf("Non-Uniform\n");
+    OCT_clear(&DST);
+
+    OCT_jstring(&DST,(char *)"QUUX-V01-CS02-with-edwards25519_XMD:SHA-512_ELL2_NU_");
+
+    hash_to_field_Ed25519(MC_SHA2, SHA512,u,&DST,&MSG,1);
+    printf("u[0]= "); FP_output(&u[0]); printf("\n");
+    ECP_map2point(&P,&u[0]);
+    printf("Q= "); ECP_output(&P);
+
+    ECP_cfp(&P);
+    ECP_affine(&P);
+    printf("P= "); ECP_output(&P); printf("\n");
+
+    ECP_mul(&P,r);
+    if (!ECP_isinf(&P))
+        printf("Hashing failure\n");
+    
+    return res;
+}
+
+
+static void hash_to_field_C25519(int hash,int hlen,F25519::FP *u,octet *DST,octet *M, int ctr)
+{
+    using namespace C25519;
+    using namespace C25519_BIG;
+    using namespace C25519_FP;
+    
+    int i,j,L,k,m;
+    BIG q,w,r;
+    DBIG dx;
+    char okm[512],fd[256];
+    octet OKM = {0,sizeof(okm),okm};
+
+    BIG_rcopy(q, Modulus);
+    k=BIG_nbits(q);
+    BIG_rcopy(r, CURVE_Order);
+    m=BIG_nbits(r);
+    L=CEIL(k+CEIL(m,2),8);
+
+    XMD_Expand(hash,hlen,&OKM,L*ctr,DST,M);
+    for (i=0;i<ctr;i++)
+    {
+        for (j=0;j<L;j++)
+            fd[j]=OKM.val[i*L+j];
+        
+        BIG_dfromBytesLen(dx,fd,L);
+        BIG_dmod(w,dx,q);
+        FP_nres(&u[i],w);
+    }
+}
+
+int htp_C25519(char *mess)
+{
+    using namespace C25519;
+    using namespace C25519_BIG;
+    using namespace C25519_FP;
+ 
+    int res=0;
+    BIG r;
+    FP u[2];
+    ECP P,P1;
+    char dst[100];
+    char msg[2000];
+    octet MSG = {0,sizeof(msg),msg};
+    octet DST = {0,sizeof(dst),dst};
+    
+    OCT_jstring(&MSG,mess);
+
+    printf("Non-Uniform\n");
+    OCT_clear(&DST);
+
+    OCT_jstring(&DST,(char *)"QUUX-V01-CS02-with-curve25519_XMD:SHA-512_ELL2_NU_");
+
+    hash_to_field_C25519(MC_SHA2, SHA512,u,&DST,&MSG,1);
+    printf("u[0]= "); FP_output(&u[0]); printf("\n");
+    ECP_map2point(&P,&u[0]);
+    printf("Q= "); ECP_output(&P);
+
+    ECP_cfp(&P);
+    ECP_affine(&P);
+    printf("P= "); ECP_output(&P); printf("\n");
+
+    ECP_mul(&P,r);
+    if (!ECP_isinf(&P))
+        printf("Hashing failure\n");
+    
+    return res;
+}
+
+/* https://datatracker.ietf.org/doc/draft-irtf-cfrg-hash-to-curve/ */
+static void hash_to_field_NIST256(int hash,int hlen,NIST256::FP *u,octet *DST,octet *M, int ctr)
+{
+    using namespace NIST256;
+    using namespace NIST256_BIG;
+    using namespace NIST256_FP;
+    
+    int i,j,L,k,m;
+    BIG q,w,r;
+    DBIG dx;
+    char okm[512],fd[256];
+    octet OKM = {0,sizeof(okm),okm};
+
+    BIG_rcopy(q, Modulus);
+    k=BIG_nbits(q);
+    BIG_rcopy(r, CURVE_Order);
+    m=BIG_nbits(r);
+    L=CEIL(k+CEIL(m,2),8);
+
+    XMD_Expand(hash,hlen,&OKM,L*ctr,DST,M);
+    for (i=0;i<ctr;i++)
+    {
+        for (j=0;j<L;j++)
+            fd[j]=OKM.val[i*L+j];
+        
+        BIG_dfromBytesLen(dx,fd,L);
+        BIG_dmod(w,dx,q);
+        FP_nres(&u[i],w);
+    }
+}
+
+int htp_NIST256(char *mess)
+{
+    using namespace NIST256;
+    using namespace NIST256_BIG;
+    using namespace NIST256_FP;
+ 
+    int res=0;
+    BIG r;
+    FP u[2];
+    ECP P,P1;
+    char dst[100];
+    char msg[2000];
+    octet MSG = {0,sizeof(msg),msg};
+    octet DST = {0,sizeof(dst),dst};
+
+    BIG_rcopy(r, CURVE_Order);
+    printf("Random oracle - message= %s\n",mess);
+    OCT_jstring(&MSG,mess);
+
+    OCT_jstring(&DST,(char *)"QUUX-V01-CS02-with-P256_XMD:SHA-256_SSWU_RO_");
+
+    hash_to_field_NIST256(MC_SHA2,HASH_TYPE_NIST256,u,&DST,&MSG,2);
+    printf("u[0]= "); FP_output(&u[0]); printf("\n");
+    printf("u[1]= "); FP_output(&u[1]); printf("\n");
+    ECP_map2point(&P,&u[0]);
+    printf("Q[0]= "); ECP_output(&P);
+    ECP_map2point(&P1,&u[1]);
+    printf("Q[1]= "); ECP_output(&P1);
+    ECP_add(&P,&P1);
+    ECP_cfp(&P);
+    ECP_affine(&P);
+    printf("P= "); ECP_output(&P); printf("\n");
+    ECP_mul(&P,r);
+    if (!ECP_isinf(&P))
+        printf("Hashing failure\n");
+
+    printf("Non-Uniform\n");
+    OCT_clear(&DST);
+
+    OCT_jstring(&DST,(char *)"QUUX-V01-CS02-with-P256_XMD:SHA-256_SSWU_NU_");
+    
+    hash_to_field_NIST256(MC_SHA2,HASH_TYPE_NIST256,u,&DST,&MSG,1);
+    printf("u[0]= "); FP_output(&u[0]); printf("\n");
+    ECP_map2point(&P,&u[0]);
+    printf("Q= "); ECP_output(&P);
+    ECP_cfp(&P);
+    ECP_affine(&P);
+    printf("P= "); ECP_output(&P); printf("\n");
+    ECP_mul(&P,r);
+    if (!ECP_isinf(&P))
+        printf("Hashing failure\n");
+    return res;
+}
+
+
+/* https://datatracker.ietf.org/doc/draft-irtf-cfrg-hash-to-curve/ */
+static void hash_to_field_Ed448(int hash,int hlen,Ed448::FP *u,octet *DST,octet *M, int ctr)
+{
+    using namespace Ed448;
+    using namespace Ed448_BIG;
+    using namespace Ed448_FP;
+    
+    int i,j,L,k,m;
+    BIG q,w,r;
+    DBIG dx;
+    char okm[512],fd[256];
+    octet OKM = {0,sizeof(okm),okm};
+
+    BIG_rcopy(q, Modulus);
+    k=BIG_nbits(q);
+    BIG_rcopy(r, CURVE_Order);
+    m=BIG_nbits(r);
+    L=CEIL(k+CEIL(m,2),8);
+
+    XMD_Expand(hash,hlen,&OKM,L*ctr,DST,M);
+    for (i=0;i<ctr;i++)
+    {
+        for (j=0;j<L;j++)
+            fd[j]=OKM.val[i*L+j];
+        
+        BIG_dfromBytesLen(dx,fd,L);
+        BIG_dmod(w,dx,q);
+        FP_nres(&u[i],w);
+    }
+}
+
+int htp_Ed448(char *mess)
+{
+    using namespace Ed448;
+    using namespace Ed448_BIG;
+    using namespace Ed448_FP;
+ 
+    int res=0;
+    BIG r;
+    FP u[2];
+    ECP P,P1;
+    char dst[100];
+    char msg[2000];
+    octet MSG = {0,sizeof(msg),msg};
+    octet DST = {0,sizeof(dst),dst};
+
+    BIG_rcopy(r, CURVE_Order);
+    printf("Random oracle - message= %s\n",mess);
+    OCT_jstring(&MSG,mess);
+
+    OCT_jstring(&DST,(char *)"QUUX-V01-CS02-with-edwards448_XMD:SHA-512_ELL2_RO_");
+
+    hash_to_field_Ed448(MC_SHA2,HASH_TYPE_Ed448,u,&DST,&MSG,2);
+    printf("u[0]= "); FP_output(&u[0]); printf("\n");
+    printf("u[1]= "); FP_output(&u[1]); printf("\n");
+    ECP_map2point(&P,&u[0]);
+    printf("Q[0]= "); ECP_output(&P);
+    ECP_map2point(&P1,&u[1]);
+    printf("Q[1]= "); ECP_output(&P1);
+    ECP_add(&P,&P1);
+    ECP_cfp(&P);
+    ECP_affine(&P);
+    printf("P= "); ECP_output(&P); printf("\n");
+    ECP_mul(&P,r);
+    if (!ECP_isinf(&P))
+        printf("Hashing failure\n");
+
+    printf("Non-Uniform\n");
+    OCT_clear(&DST);
+
+    OCT_jstring(&DST,(char *)"QUUX-V01-CS02-with-edwards448_XMD:SHA-512_ELL2_NU_");
+
+    hash_to_field_Ed448(MC_SHA2,HASH_TYPE_Ed448,u,&DST,&MSG,1);
+    printf("u[0]= "); FP_output(&u[0]); printf("\n");
+    ECP_map2point(&P,&u[0]);
+    printf("Q= "); ECP_output(&P);
+
+    ECP_cfp(&P);
+    ECP_affine(&P);
+    printf("P= "); ECP_output(&P); printf("\n");
+    ECP_mul(&P,r);
+    if (!ECP_isinf(&P))
+        printf("Hashing failure\n");
+
+    return res;
+}
+
+/* https://datatracker.ietf.org/doc/draft-irtf-cfrg-hash-to-curve/ */
+static void hash_to_field_SECP256K1(int hash,int hlen,SECP256K1::FP *u,octet *DST,octet *M, int ctr)
+{
+    using namespace SECP256K1;
+    using namespace SECP256K1_BIG;
+    using namespace SECP256K1_FP;
+    
+    int i,j,L,k,m;
+    BIG q,w,r;
+    DBIG dx;
+    char okm[512],fd[256];
+    octet OKM = {0,sizeof(okm),okm};
+
+    BIG_rcopy(q, Modulus);
+    k=BIG_nbits(q);
+    BIG_rcopy(r, CURVE_Order);
+    m=BIG_nbits(r);
+    L=CEIL(k+CEIL(m,2),8);
+
+    XMD_Expand(hash,hlen,&OKM,L*ctr,DST,M);
+    for (i=0;i<ctr;i++)
+    {
+        for (j=0;j<L;j++)
+            fd[j]=OKM.val[i*L+j];
+        
+        BIG_dfromBytesLen(dx,fd,L);
+        BIG_dmod(w,dx,q);
+        FP_nres(&u[i],w);
+    }
+}
+
+int htp_SECP256K1(char *mess)
+{
+    using namespace SECP256K1;
+    using namespace SECP256K1_BIG;
+    using namespace SECP256K1_FP;
+ 
+    int res=0;
+    BIG r;
+    FP u[2];
+    ECP P,P1;
+    char dst[100];
+    char msg[2000];
+    octet MSG = {0,sizeof(msg),msg};
+    octet DST = {0,sizeof(dst),dst};
+
+    BIG_rcopy(r, CURVE_Order);
+    printf("Random oracle - message= %s\n",mess);
+    OCT_jstring(&MSG,mess);
+
+    OCT_jstring(&DST,(char *)"QUUX-V01-CS02-with-secp256k1_XMD:SHA-256_SSWU_RO_");
+    hash_to_field_SECP256K1(MC_SHA2,HASH_TYPE_SECP256K1,u,&DST,&MSG,2);
+    printf("u[0]= "); FP_output(&u[0]); printf("\n");
+    printf("u[1]= "); FP_output(&u[1]); printf("\n");
+    ECP_map2point(&P,&u[0]);
+    printf("Q[0]= "); ECP_output(&P);
+    ECP_map2point(&P1,&u[1]);
+    printf("Q[1]= "); ECP_output(&P1);
+    ECP_add(&P,&P1);
+    ECP_cfp(&P);
+    ECP_affine(&P);
+    printf("P= "); ECP_output(&P); printf("\n");
+    ECP_mul(&P,r);
+    if (!ECP_isinf(&P))
+        printf("Hashing failure\n");
+
+    printf("Non-Uniform\n");
+    OCT_clear(&DST);
+    OCT_jstring(&DST,(char *)"QUUX-V01-CS02-with-secp256k1_XMD:SHA-256_SSWU_NU_");
+    hash_to_field_SECP256K1(MC_SHA2,HASH_TYPE_SECP256K1,u,&DST,&MSG,1);
+    printf("u[0]= "); FP_output(&u[0]); printf("\n");
+    ECP_map2point(&P,&u[0]);
+    printf("Q= "); ECP_output(&P);
+
+    ECP_cfp(&P);
+    ECP_affine(&P);
+    printf("P= "); ECP_output(&P); printf("\n");
+    ECP_mul(&P,r);
+    if (!ECP_isinf(&P))
+        printf("Hashing failure\n");
+
+    return res;
+}
+
+
+/* https://datatracker.ietf.org/doc/draft-irtf-cfrg-hash-to-curve/ */
+static void hash_to_field_BLS12381(int hash,int hlen,BLS12381::FP *u,octet *DST,octet *M, int ctr)
+{
+    using namespace BLS12381;
+    using namespace BLS12381_BIG;
+    using namespace BLS12381_FP;
+    
+    int i,j,L,k,m;
+    BIG q,w,r;
+    DBIG dx;
+    char okm[512],fd[256];
+    octet OKM = {0,sizeof(okm),okm};
+
+    BIG_rcopy(q, Modulus);
+    k=BIG_nbits(q);
+    BIG_rcopy(r, CURVE_Order);
+    m=BIG_nbits(r);
+    L=CEIL(k+CEIL(m,2),8);
+
+    //printf("L= %d\n",L);
+    XMD_Expand(hash,hlen,&OKM,L*ctr,DST,M);
+    for (i=0;i<ctr;i++)
+    {
+        for (j=0;j<L;j++)
+            fd[j]=OKM.val[i*L+j];
+        
+        BIG_dfromBytesLen(dx,fd,L);
+        BIG_dmod(w,dx,q);
+        FP_nres(&u[i],w);
+    }
+}
+
+int htp_BLS12381(char *mess)
+{
+    using namespace BLS12381;
+    using namespace BLS12381_BIG;
+    using namespace BLS12381_FP;
+ 
+    int res=0;
+    BIG r;
+    FP u[2];
+    ECP P,P1;
+    char dst[100];
+    char msg[2000];
+    octet MSG = {0,sizeof(msg),msg};
+    octet DST = {0,sizeof(dst),dst};
+
+    BIG_rcopy(r, CURVE_Order);
+    printf("Random oracle - message= %s\n",mess);
+    OCT_jstring(&MSG,mess);
+
+
+    OCT_jstring(&DST,(char *)"QUUX-V01-CS02-with-BLS12381G1_XMD:SHA-256_SSWU_RO_");
+    hash_to_field_BLS12381(MC_SHA2,HASH_TYPE_BLS12381,u,&DST,&MSG,2);
+    printf("u[0]= "); FP_output(&u[0]); printf("\n");
+    printf("u[1]= "); FP_output(&u[1]); printf("\n");
+    ECP_map2point(&P,&u[0]);
+    printf("Q[0]= "); ECP_output(&P);
+
+//exit(0);
+
+    ECP_map2point(&P1,&u[1]);
+    printf("Q[1]= "); ECP_output(&P1);
+    ECP_add(&P,&P1);
+    ECP_cfp(&P);
+    ECP_affine(&P);
+    printf("P= "); ECP_output(&P); printf("\n");
+    ECP_mul(&P,r);
+    if (!ECP_isinf(&P))
+        printf("Hashing failure\n");
+
+    printf("Non-Uniform\n");
+    OCT_clear(&DST);
+    OCT_jstring(&DST,(char *)"QUUX-V01-CS02-with-BLS12381G1_XMD:SHA-256_SSWU_NU_");
+    hash_to_field_BLS12381(MC_SHA2,HASH_TYPE_BLS12381,u,&DST,&MSG,1);
+    printf("u[0]= "); FP_output(&u[0]); printf("\n");
+    ECP_map2point(&P,&u[0]);
+    printf("Q= "); ECP_output(&P);
+
+    ECP_cfp(&P);
+    ECP_affine(&P);
+    printf("P= "); ECP_output(&P); printf("\n");
+    ECP_mul(&P,r);
+    if (!ECP_isinf(&P))
+        printf("Hashing failure\n");
+
+    return res;
+}
+
+/* https://datatracker.ietf.org/doc/draft-irtf-cfrg-hash-to-curve/ */
+static void hash_to_field_BLS12381_G2(int hash,int hlen,BLS12381::FP2 *u,octet *DST,octet *M, int ctr)
+{
+    using namespace BLS12381;
+    using namespace BLS12381_BIG;
+    
+    int i,j,L,k,m;
+    BIG q,w1,w2,r;
+    DBIG dx;
+    char okm[1024],fd[256];
+    octet OKM = {0,sizeof(okm),okm};
+
+    BIG_rcopy(q, Modulus);
+    k=BIG_nbits(q);
+    BIG_rcopy(r, CURVE_Order);
+    m=BIG_nbits(r);
+    L=CEIL(k+CEIL(m,2),8);
+
+    //printf("L= %d\n",L);
+    XMD_Expand(hash,hlen,&OKM,2*L*ctr,DST,M);
+    for (i=0;i<ctr;i++)
+    {
+        for (j=0;j<L;j++)
+            fd[j]=OKM.val[2*i*L+j];
+        
+        BIG_dfromBytesLen(dx,fd,L);
+        BIG_dmod(w1,dx,q);
+        
+        for (j=0;j<L;j++)
+            fd[j]=OKM.val[(2*i+1)*L+j];
+        
+        BIG_dfromBytesLen(dx,fd,L);
+        BIG_dmod(w2,dx,q);
+
+        FP2_from_BIGs(&u[i],w1,w2);
+    }
+}
+
+int htp_BLS12381_G2(char *mess)
+{
+    using namespace BLS12381;
+    using namespace BLS12381_BIG;
+
+    int res=0;
+    BIG r;
+    FP2 u[2];
+    ECP2 P,P1;
+    char dst[100];
+    char msg[2000];
+    octet MSG = {0,sizeof(msg),msg};
+    octet DST = {0,sizeof(dst),dst};
+
+    BIG_rcopy(r, CURVE_Order);
+    printf("Random oracle - message= %s\n",mess);
+    OCT_jstring(&MSG,mess);
+
+
+    OCT_jstring(&DST,(char *)"QUUX-V01-CS02-with-BLS12381G2_XMD:SHA-256_SSWU_RO_");
+    hash_to_field_BLS12381_G2(MC_SHA2,HASH_TYPE_BLS12381,u,&DST,&MSG,2);
+    printf("u[0]= "); FP2_output(&u[0]); printf("\n");
+    printf("u[1]= "); FP2_output(&u[1]); printf("\n");
+    ECP2_map2point(&P,&u[0]);
+    printf("Q[0]= "); ECP2_output(&P);
+    ECP2_map2point(&P1,&u[1]);
+    printf("Q[1]= "); ECP2_output(&P1);
+    ECP2_add(&P,&P1);
+    ECP2_cfp(&P);
+    ECP2_affine(&P);
+    printf("P= "); ECP2_output(&P); printf("\n");
+    ECP2_mul(&P,r);
+    if (!ECP2_isinf(&P))
+        printf("Hashing failure\n");
+
+    printf("Non-Uniform\n");
+    OCT_clear(&DST);
+    OCT_jstring(&DST,(char *)"QUUX-V01-CS02-with-BLS12381G2_XMD:SHA-256_SSWU_NU_");
+    hash_to_field_BLS12381_G2(MC_SHA2,HASH_TYPE_BLS12381,u,&DST,&MSG,1);
+    printf("u[0]= "); FP2_output(&u[0]); printf("\n");
+    ECP2_map2point(&P,&u[0]);
+    printf("Q= "); ECP2_output(&P);
+
+    ECP2_cfp(&P);
+    ECP2_affine(&P);
+    printf("P= "); ECP2_output(&P); printf("\n");
+    ECP2_mul(&P,r);
+    if (!ECP2_isinf(&P))
+        printf("Hashing failure\n");
+
+    return res;
+}
+
+int main()
+{
+    int i, res;
+    unsigned long ran;
+
+    char raw[100];
+    octet RAW = {0, sizeof(raw), raw};
+    csprng RNG;                // Crypto Strong RNG
+
+    time((time_t *)&ran);
+
+    RAW.len = 100;              // fake random seed source
+    RAW.val[0] = ran;
+    RAW.val[1] = ran >> 8;
+    RAW.val[2] = ran >> 16;
+    RAW.val[3] = ran >> 24;
+    for (i = 4; i < 100; i++) RAW.val[i] = i;
+
+    CREATE_CSPRNG(&RNG, &RAW);  // initialise strong RNG
+
+    printf("%d bit build", CHUNK);
+
+    printf("\nTesting HTP for curve Ed25519\n");
+    htp_Ed25519((char *)"");
+    htp_Ed25519((char *)"abc");
+    htp_Ed25519((char *)"abcdef0123456789");
+    htp_Ed25519((char *)"q128_qqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqq");
+    htp_Ed25519((char *)"a512_aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa");
+
+    printf("\nTesting HTP for curve C25519\n");
+    htp_C25519((char *)"");
+    htp_C25519((char *)"abc");
+    htp_C25519((char *)"abcdef0123456789");
+    htp_C25519((char *)"q128_qqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqq");
+    htp_C25519((char *)"a512_aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa");
+
+
+    printf("\nTesting HTP for curve NIST256\n");
+    htp_NIST256((char *)"");
+    htp_NIST256((char *)"abc");
+    htp_NIST256((char *)"abcdef0123456789");
+    htp_NIST256((char *)"q128_qqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqq");
+    htp_NIST256((char *)"a512_aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa");
+
+    printf("\nTesting HTP for curve Ed448\n");
+    htp_Ed448((char *)"");
+    htp_Ed448((char *)"abc");
+    htp_Ed448((char *)"abcdef0123456789");
+    htp_Ed448((char *)"q128_qqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqq");
+    htp_Ed448((char *)"a512_aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa");
+
+    printf("\nTesting HTP for curve SECP256K1\n");
+    htp_SECP256K1((char *)"");
+    htp_SECP256K1((char *)"abc");
+    htp_SECP256K1((char *)"abcdef0123456789");
+    htp_SECP256K1((char *)"q128_qqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqq");
+    htp_SECP256K1((char *)"a512_aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa");
+
+    printf("\nTesting HTP for curve BLS12381_G1\n");
+    htp_BLS12381((char *)"");
+    htp_BLS12381((char *)"abc");
+    htp_BLS12381((char *)"abcdef0123456789");
+    htp_BLS12381((char *)"q128_qqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqq");
+    htp_BLS12381((char *)"a512_aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa");
+
+    printf("\nTesting HTP for curve BLS12381_G2\n");
+    htp_BLS12381_G2((char *)"");
+    htp_BLS12381_G2((char *)"abc");
+    htp_BLS12381_G2((char *)"abcdef0123456789");
+    htp_BLS12381_G2((char *)"q128_qqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqq");
+    htp_BLS12381_G2((char *)"a512_aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa");
+
+
+    KILL_CSPRNG(&RNG);
+}
+
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/testkyber b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/testkyber
new file mode 100644
index 0000000..3c75b81
Binary files /dev/null and b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/testkyber differ
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/testkyber.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/testkyber.cpp
new file mode 100644
index 0000000..ca961c9
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/testkyber.cpp
@@ -0,0 +1,101 @@
+/*
+ * Copyright (c) 2012-2021 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* test driver and function exerciser for Kyber functions */
+/* g++ -O2 testkyber.cpp core.a -o testkyber */
+
+#include <stdio.h>
+#include <time.h>
+#include "kyber.h"
+
+using namespace core;
+
+#define LOOPS 100
+
+int main() {
+    int i,j;
+    unsigned long ran;
+    bool result;
+    char raw[100];
+    csprng RNG;
+    char sk[KYBER_SECRET_CPA_SIZE_768], pk[KYBER_PUBLIC_SIZE_768],ct[KYBER_CIPHERTEXT_SIZE_768],skc[KYBER_SECRET_CCA_SIZE_768],ss[KYBER_SHARED_SECRET_768];
+    octet SKC = {0, sizeof(skc), skc};
+    octet SK = {0, sizeof(sk), sk};
+    octet PK = {0, sizeof(pk), pk};
+    octet CT = {0, sizeof(ct), ct};
+    octet SS = {0, sizeof(ss), ss};
+
+    byte tau[32],r64[64],r32[32];
+    byte coins[32];
+
+    time((time_t *)&ran);
+
+    raw[0] = ran;
+    raw[1] = ran >> 8;
+    raw[2] = ran >> 16;
+    raw[3] = ran >> 24;
+
+    for (i = 0; i < 100; i++) raw[i] = i + 1; 
+    RAND_seed(&RNG, 100, raw);
+       
+    printf("Testing Kyber Encryption\n");
+
+    for (j=0;j<LOOPS;j++) {
+
+        for (i=0;i<64;i++)
+            r64[i]=RAND_byte(&RNG); 
+  
+        KYBER768_keypair(r64,&SKC,&PK);
+
+//printf("Public key= ");
+//for (i=0;i<PK.len;i++)
+//    printf("%02x",(byte)PK.val[i]);
+//printf("\n");
+    
+//printf("Secret key= ");
+//for (i=0;i<SKC.len;i++)
+//    printf("%02x",(byte)SKC.val[i]);
+//printf("\n");
+
+
+        for (i=0;i<32;i++)
+            r32[i]=RAND_byte(&RNG); 
+
+		KYBER768_encrypt(r32,&PK,&SS,&CT); 
+
+//printf("Ciphertext= ");
+//for (i=0;i<CT.len;i++)
+//    printf("%02x",(byte)CT.val[i]);
+//printf("\n");
+
+        printf("j= %d\n",j);
+        for (i=0;i<32;i++)
+            printf("%02x",(byte)SS.val[i]);
+        printf("\n");
+
+		KYBER768_decrypt(&SKC,&CT,&SS);
+        
+        for (i=0;i<32;i++)
+            printf("%02x",(byte)SS.val[i]);
+        printf("\n");
+    }
+
+    return 0;
+} 
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/testmpin b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/testmpin
new file mode 100644
index 0000000..b8c7cc3
Binary files /dev/null and b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/testmpin differ
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/testmpin.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/testmpin.cpp
new file mode 100644
index 0000000..4aa2712
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/testmpin.cpp
@@ -0,0 +1,527 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* test driver and function exerciser for MPIN API Functions */
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include <time.h>
+#include "mpin_BN254.h"
+#include "randapi.h"
+
+#if CHUNK==32 || CHUNK==64
+#include "mpin_BLS12383.h"
+#include "mpin192_BLS24479.h"
+#include "mpin256_BLS48556.h"
+#endif
+
+using namespace core;
+
+int mpin_BN254(csprng *RNG)
+{
+
+    using namespace BN254;
+    int i, pin, rtn;
+    char x[PGS_BN254], s[PGS_BN254], y[PGS_BN254], client_id[100], sst[4 * PFS_BN254 + 1], token[2 * PFS_BN254 + 1], sec[2 * PFS_BN254 + 1], u[2 * PFS_BN254 + 1];
+    char hcid[2*PFS_BN254+1], hsid[2*PFS_BN254+1], dst[256];
+
+    octet S = {0, sizeof(s), s};
+    octet X = {0, sizeof(x), x};
+    octet Y = {0, sizeof(y), y};
+    octet CLIENT_ID = {0, sizeof(client_id), client_id};
+    octet SST = {0, sizeof(sst), sst};
+    octet TOKEN = {0, sizeof(token), token};
+    octet SEC = {0, sizeof(sec), sec};
+    octet U = {0, sizeof(u), u};
+    octet HCID = {0, sizeof(hcid), hcid};
+    octet HSID = {0, sizeof(hsid), hsid};
+    octet DST = {0, sizeof(dst), dst};
+    OCT_jstring(&DST,(char *)"BN254G1_XMD:SHA-256_SVDW_NU_MPIN"); // Domain Separation Tag
+
+    // Trusted Authority (TA) set-up
+    MPIN_RANDOM_GENERATE(RNG, &S);
+    printf("Master Secret= ");
+    OCT_output(&S);
+
+// Client Identity
+            OCT_jstring(&CLIENT_ID, (char *)"testUser@miracl.com");
+            MPIN_ENCODE_TO_CURVE(&DST,&CLIENT_ID,&HCID);
+            printf("Client ID Hashed to Curve= ");
+            OCT_output(&HCID);
+//            printf("\n");
+
+// Client approaches Trusted Authority and is issued secret
+
+    MPIN_GET_CLIENT_SECRET(&S, &HCID, &TOKEN);
+    printf("Client Secret= ");
+    OCT_output(&TOKEN);
+
+// TA sends Client secret to Client
+
+// Server is issued secret by TA
+    MPIN_GET_SERVER_SECRET(&S, &SST);
+//    printf("Server Secret= ");
+//    OCT_output(&SST);
+
+// TA sends Server secret to Server
+
+// Client extracts PIN from secret to create Token
+            //pin = 1234;
+            //printf("Client extracts PIN= %d\n", pin);
+            pin=0; printf("Client chooses PIN= ");
+            if (scanf("%d", &pin)) {}; // to avoid silly compile error
+            getchar();
+            MPIN_EXTRACT_PIN(&HCID, pin, &TOKEN);
+            printf("Client Token= ");
+            OCT_output(&TOKEN);
+
+
+// Exercise Secret Sharing
+            char s1[2 * PFS_BN254 + 1],s2[2 * PFS_BN254 + 1],s3[2 * PFS_BN254 + 1],s4[2 * PFS_BN254 + 1],r[128];
+            octet S1 = {0, sizeof(s1), s1};
+            octet S2 = {0, sizeof(s2), s2};
+            octet S3 = {0, sizeof(s3), s3};
+            octet S4 = {0, sizeof(s4), s4};
+            octet R = {0,sizeof(r),r};
+            OCT_rand(&R,RNG,128);
+
+        // create 4 unique shares of TOKEN
+            share Sh1=getshare(1,3,&S1,&TOKEN,&R);  // indicate 3 shares required for recovery
+            share Sh2=getshare(2,3,&S2,&TOKEN,&R);
+            share Sh3=getshare(3,3,&S3,&TOKEN,&R);
+            share Sh4=getshare(4,3,&S4,&TOKEN,&R);
+
+            OCT_clear(&TOKEN);  // kill token
+
+            share Shares[3];
+            Shares[0]=Sh1;  // any 3 shares to recover TOKEN
+            Shares[1]=Sh2;
+            Shares[2]=Sh4; 
+            recover(&TOKEN,Shares);  // recover token
+
+// MPin Protocol
+
+// Client enters ID and PIN
+            OCT_clear(&CLIENT_ID);
+            OCT_jstring(&CLIENT_ID, (char *)"testUser@miracl.com");
+            MPIN_ENCODE_TO_CURVE(&DST,&CLIENT_ID,&HCID);
+            pin=0; printf("Client enters PIN= ");
+            if (scanf("%d", &pin)) {}; // to avoid silly compile error
+            getchar();
+
+// Client First pass: Inputs H(CLIENT_ID), RNG, pin, and TOKEN. Output x and U = x.H(CLIENT_ID) and re-combined secret SEC
+
+            if (MPIN_CLIENT_1(&HCID, RNG, &X, pin, &TOKEN, &SEC, &U) != 0)
+            {
+                printf("Error from Client side - First Pass\n");
+                return 1;
+            }
+
+// Send CLIENT_ID and U=x.ID to server. Server hashes ID to curve.
+                    MPIN_ENCODE_TO_CURVE(&DST,&CLIENT_ID,&HSID);
+
+// Server generates Random number Y and sends it to Client
+                    MPIN_RANDOM_GENERATE(RNG, &Y);
+
+// Client Second Pass: Inputs Client secret SEC, x and y. Sends -(x+y)*SEC to Server
+            if (MPIN_CLIENT_2(&X, &Y, &SEC) != 0)
+            {
+                printf("Error from Client side - Second Pass\n");
+                return 1;
+            }
+
+// Server Second phase. Inputs H(CLIENT_ID), Y, -(x+y)*SEC, U and Server secret SST. 
+
+                    rtn = MPIN_SERVER(&HSID, &Y, &SST, &U, &SEC);
+                    if (rtn != 0)
+                    {
+                        printf("Server says - Bad Pin.\n");
+                        return 1;
+                    }
+                    else
+                    {
+                        printf("Server says - PIN is good! You really are ");
+                        OCT_output_string(&CLIENT_ID);
+                        printf(".\n");
+                    }
+    printf("\n");
+
+    return 0;
+}
+
+#if CHUNK==32 || CHUNK==64
+
+int mpin_BLS12383(csprng *RNG)
+{
+    using namespace BLS12383;
+    int pin, rtn;
+
+    char x[PGS_BLS12383], s[PGS_BLS12383], y[PGS_BLS12383], client_id[100], sst[4 * PFS_BLS12383 + 1], token[2 * PFS_BLS12383 + 1], sec[2 * PFS_BLS12383 + 1], u[2 * PFS_BLS12383 + 1];
+    char hcid[2*PFS_BLS12383+1], hsid[2*PFS_BLS12383+1], dst[256];
+
+    octet S = {0, sizeof(s), s};
+    octet X = {0, sizeof(x), x};
+    octet Y = {0, sizeof(y), y};
+    octet CLIENT_ID = {0, sizeof(client_id), client_id};
+    octet SST = {0, sizeof(sst), sst};
+    octet TOKEN = {0, sizeof(token), token};
+    octet SEC = {0, sizeof(sec), sec};
+    octet U = {0, sizeof(u), u};
+    octet HCID = {0, sizeof(hcid), hcid};
+    octet HSID = {0, sizeof(hsid), hsid};
+    octet DST = {0, sizeof(dst), dst};
+    OCT_jstring(&DST,(char *)"BLS12383G1_XMD:SHA-256_SVDW_NU_MPIN"); // Domain Separation Tag
+
+    // Trusted Authority (TA) set-up
+    MPIN_RANDOM_GENERATE(RNG, &S);
+    printf("Master Secret= ");
+    OCT_output(&S);
+
+// Client Identity
+            OCT_jstring(&CLIENT_ID, (char *)"testUser@miracl.com");
+            MPIN_ENCODE_TO_CURVE(&DST,&CLIENT_ID,&HCID);
+            printf("Client ID Hashed to Curve= ");
+            OCT_output(&HCID);
+//            printf("\n");
+
+// Client approaches Trusted Authority and is issued secret
+
+    MPIN_GET_CLIENT_SECRET(&S, &HCID, &TOKEN);
+    printf("Client Secret= ");
+    OCT_output(&TOKEN);
+
+// TA sends Client secret to Client
+
+// Server is issued secret by TA
+    MPIN_GET_SERVER_SECRET(&S, &SST);
+//    printf("Server Secret= ");
+//    OCT_output(&SST);
+
+// TA sends Server secret to Server
+
+// Client extracts PIN from secret to create Token
+            //pin = 1234;
+            //printf("Client extracts PIN= %d\n", pin);
+            pin=0; printf("Client chooses PIN= ");
+            if (scanf("%d", &pin)) {}; // to avoid silly compile error
+            getchar();
+            MPIN_EXTRACT_PIN(&HCID, pin, &TOKEN);
+            printf("Client Token= ");
+            OCT_output(&TOKEN);
+
+// MPin Protocol
+
+// Client enters ID and PIN
+            OCT_clear(&CLIENT_ID);
+            OCT_jstring(&CLIENT_ID, (char *)"testUser@miracl.com");
+            MPIN_ENCODE_TO_CURVE(&DST,&CLIENT_ID,&HCID);
+            pin=0; printf("Client enters PIN= ");
+            if (scanf("%d", &pin)) {}; // to avoid silly compile error
+            getchar();
+
+// Client First pass: Inputs H(CLIENT_ID), RNG, pin, and TOKEN. Output x and U = x.H(CLIENT_ID) and re-combined secret SEC
+
+            if (MPIN_CLIENT_1(&HCID, RNG, &X, pin, &TOKEN, &SEC, &U) != 0)
+            {
+                printf("Error from Client side - First Pass\n");
+                return 1;
+            }
+
+// Send CLIENT_ID and U=x.ID to server. Server hashes ID to curve.
+                    MPIN_ENCODE_TO_CURVE(&DST,&CLIENT_ID,&HSID);
+
+// Server generates Random number Y and sends it to Client
+                    MPIN_RANDOM_GENERATE(RNG, &Y);
+
+// Client Second Pass: Inputs Client secret SEC, x and y. Sends -(x+y)*SEC to Server
+            if (MPIN_CLIENT_2(&X, &Y, &SEC) != 0)
+            {
+                printf("Error from Client side - Second Pass\n");
+                return 1;
+            }
+
+// Server Second phase. Inputs H(CLIENT_ID), Y, -(x+y)*SEC, U and Server secret SST. 
+
+                    rtn = MPIN_SERVER(&HSID, &Y, &SST, &U, &SEC);
+                    if (rtn != 0)
+                    {
+                        printf("Server says - Bad Pin.\n");
+                        return 1;
+                    }
+                    else
+                    {
+                        printf("Server says - PIN is good! You really are ");
+                        OCT_output_string(&CLIENT_ID);
+                        printf(".\n");
+                    }
+    printf("\n");
+    return 0;
+}
+
+int mpin192_BLS24479(csprng *RNG)
+{
+    using namespace BLS24479;
+    int pin, rtn;
+    char x[PGS_BLS24479], s[PGS_BLS24479], y[PGS_BLS24479], client_id[100], sst[8 * PFS_BLS24479 + 1], token[2 * PFS_BLS24479 + 1], sec[2 * PFS_BLS24479 + 1], u[2 * PFS_BLS24479 + 1];
+    char hcid[2*PFS_BLS24479+1], hsid[2*PFS_BLS24479+1], dst[256];
+
+    octet S = {0, sizeof(s), s};
+    octet X = {0, sizeof(x), x};
+    octet Y = {0, sizeof(y), y};
+    octet CLIENT_ID = {0, sizeof(client_id), client_id};
+    octet SST = {0, sizeof(sst), sst};
+    octet TOKEN = {0, sizeof(token), token};
+    octet SEC = {0, sizeof(sec), sec};
+    octet U = {0, sizeof(u), u};
+    octet HCID = {0, sizeof(hcid), hcid};
+    octet HSID = {0, sizeof(hsid), hsid};
+    octet DST = {0, sizeof(dst), dst};
+    OCT_jstring(&DST,(char *)"BLS24479G1_XMD:SHA-384_SVDW_NU_MPIN"); // Domain Separation Tag
+
+
+    // Trusted Authority (TA) set-up
+    MPIN_RANDOM_GENERATE(RNG, &S);
+    printf("Master Secret= ");
+    OCT_output(&S);
+
+// Client Identity
+            OCT_jstring(&CLIENT_ID, (char *)"testUser@miracl.com");
+            MPIN_ENCODE_TO_CURVE(&DST,&CLIENT_ID,&HCID);
+            printf("Client ID Hashed to Curve= ");
+            OCT_output(&HCID);
+//            printf("\n");
+
+// Client approaches Trusted Authority and is issued secret
+
+    MPIN_GET_CLIENT_SECRET(&S, &HCID, &TOKEN);
+    printf("Client Secret= ");
+    OCT_output(&TOKEN);
+
+// TA sends Client secret to Client
+
+// Server is issued secret by TA
+    MPIN_GET_SERVER_SECRET(&S, &SST);
+//    printf("Server Secret= ");
+//    OCT_output(&SST);
+
+// TA sends Server secret to Server
+
+// Client extracts PIN from secret to create Token
+            //pin = 1234;
+            //printf("Client extracts PIN= %d\n", pin);
+            pin=0; printf("Client chooses PIN= ");
+            if (scanf("%d", &pin)) {}; // to avoid silly compile error
+            getchar();
+            MPIN_EXTRACT_PIN(&HCID, pin, &TOKEN);
+            printf("Client Token= ");
+            OCT_output(&TOKEN);
+
+// MPin Protocol
+
+// Client enters ID and PIN
+            OCT_clear(&CLIENT_ID);
+            OCT_jstring(&CLIENT_ID, (char *)"testUser@miracl.com");
+            MPIN_ENCODE_TO_CURVE(&DST,&CLIENT_ID,&HCID);
+            pin=0; printf("Client enters PIN= ");
+            if (scanf("%d", &pin)) {}; // to avoid silly compile error
+            getchar();
+
+// Client First pass: Inputs H(CLIENT_ID), RNG, pin, and TOKEN. Output x and U = x.H(CLIENT_ID) and re-combined secret SEC
+
+            if (MPIN_CLIENT_1(&HCID, RNG, &X, pin, &TOKEN, &SEC, &U) != 0)
+            {
+                printf("Error from Client side - First Pass\n");
+                return 1;
+            }
+
+// Send CLIENT_ID and U=x.ID to server. Server hashes ID to curve.
+                    MPIN_ENCODE_TO_CURVE(&DST,&CLIENT_ID,&HSID);
+
+// Server generates Random number Y and sends it to Client
+                    MPIN_RANDOM_GENERATE(RNG, &Y);
+
+// Client Second Pass: Inputs Client secret SEC, x and y. Sends -(x+y)*SEC to Server
+            if (MPIN_CLIENT_2(&X, &Y, &SEC) != 0)
+            {
+                printf("Error from Client side - Second Pass\n");
+                return 1;
+            }
+
+// Server Second phase. Inputs H(CLIENT_ID), Y, -(x+y)*SEC, U and Server secret SST. 
+
+                    rtn = MPIN_SERVER(&HSID, &Y, &SST, &U, &SEC);
+                    if (rtn != 0)
+                    {
+                        printf("Server says - Bad Pin.\n");
+                        return 1;
+                    }
+                    else
+                    {
+                        printf("Server says - PIN is good! You really are ");
+                        OCT_output_string(&CLIENT_ID);
+                        printf(".\n");
+                    }
+    printf("\n");
+    return 0;
+}
+
+int mpin256_BLS48556(csprng *RNG)
+{
+    using namespace BLS48556;
+    int pin, rtn;
+    char x[PGS_BLS48556], s[PGS_BLS48556], y[PGS_BLS48556], client_id[100], sst[16 * PFS_BLS48556 + 1], token[2 * PFS_BLS48556 + 1], sec[2 * PFS_BLS48556 + 1], u[2 * PFS_BLS48556 + 1];
+    char hcid[2*PFS_BLS48556+1], hsid[2*PFS_BLS48556+1], dst[256];
+
+    octet S = {0, sizeof(s), s};
+    octet X = {0, sizeof(x), x};
+    octet Y = {0, sizeof(y), y};
+    octet CLIENT_ID = {0, sizeof(client_id), client_id};
+    octet SST = {0, sizeof(sst), sst};
+    octet TOKEN = {0, sizeof(token), token};
+    octet SEC = {0, sizeof(sec), sec};
+    octet U = {0, sizeof(u), u};
+    octet HCID = {0, sizeof(hcid), hcid};
+    octet HSID = {0, sizeof(hsid), hsid};
+    octet DST = {0, sizeof(dst), dst};
+    OCT_jstring(&DST,(char *)"BLS48556G1_XMD:SHA-512_SVDW_NU_MPIN"); // Domain Separation Tag
+
+
+    // Trusted Authority (TA) set-up
+    MPIN_RANDOM_GENERATE(RNG, &S);
+    printf("Master Secret= ");
+    OCT_output(&S);
+
+// Client Identity
+            OCT_jstring(&CLIENT_ID, (char *)"testUser@miracl.com");
+            MPIN_ENCODE_TO_CURVE(&DST,&CLIENT_ID,&HCID);
+            printf("Client ID Hashed to Curve= ");
+            OCT_output(&HCID);
+//            printf("\n");
+
+// Client approaches Trusted Authority and is issued secret
+
+    MPIN_GET_CLIENT_SECRET(&S, &HCID, &TOKEN);
+    printf("Client Secret= ");
+    OCT_output(&TOKEN);
+
+// TA sends Client secret to Client
+
+// Server is issued secret by TA
+    MPIN_GET_SERVER_SECRET(&S, &SST);
+//    printf("Server Secret= ");
+//    OCT_output(&SST);
+
+// TA sends Server secret to Server
+
+// Client extracts PIN from secret to create Token
+            //pin = 1234;
+            //printf("Client extracts PIN= %d\n", pin);
+            pin=0; printf("Client chooses PIN= ");
+            if (scanf("%d", &pin)) {}; // to avoid silly compile error
+            getchar();
+            MPIN_EXTRACT_PIN(&HCID, pin, &TOKEN);
+            printf("Client Token= ");
+            OCT_output(&TOKEN);
+
+// MPin Protocol
+
+// Client enters ID and PIN
+            OCT_clear(&CLIENT_ID);
+            OCT_jstring(&CLIENT_ID, (char *)"testUser@miracl.com");
+            MPIN_ENCODE_TO_CURVE(&DST,&CLIENT_ID,&HCID);
+            pin=0; printf("Client enters PIN= ");
+            if (scanf("%d", &pin)) {}; // to avoid silly compile error
+            getchar();
+
+// Client First pass: Inputs H(CLIENT_ID), RNG, pin, and TOKEN. Output x and U = x.H(CLIENT_ID) and re-combined secret SEC
+
+            if (MPIN_CLIENT_1(&HCID, RNG, &X, pin, &TOKEN, &SEC, &U) != 0)
+            {
+                printf("Error from Client side - First Pass\n");
+                return 1;
+            }
+
+// Send CLIENT_ID and U=x.ID to server. Server hashes ID to curve.
+                    MPIN_ENCODE_TO_CURVE(&DST,&CLIENT_ID,&HSID);
+
+// Server generates Random number Y and sends it to Client
+                    MPIN_RANDOM_GENERATE(RNG, &Y);
+
+// Client Second Pass: Inputs Client secret SEC, x and y. Sends -(x+y)*SEC to Server
+            if (MPIN_CLIENT_2(&X, &Y, &SEC) != 0)
+            {
+                printf("Error from Client side - Second Pass\n");
+                return 1;
+            }
+
+// Server Second phase. Inputs H(CLIENT_ID), Y, -(x+y)*SEC, U and Server secret SST. 
+
+                    rtn = MPIN_SERVER(&HSID, &Y, &SST, &U, &SEC);
+                    if (rtn != 0)
+                    {
+                        printf("Server says - Bad Pin.\n");
+                        return 1;
+                    }
+                    else
+                    {
+                        printf("Server says - PIN is good! You really are ");
+                        OCT_output_string(&CLIENT_ID);
+                        printf(".\n");
+                    }
+    printf("\n");
+    return 0;
+}
+#endif
+
+int main()
+{
+    int i, res;
+    unsigned long ran;
+
+    char raw[100];
+    octet RAW = {0, sizeof(raw), raw};
+    csprng RNG;                // Crypto Strong RNG
+
+    time((time_t *)&ran);
+
+    RAW.len = 100;              // fake random seed source
+    RAW.val[0] = ran;
+    RAW.val[1] = ran >> 8;
+    RAW.val[2] = ran >> 16;
+    RAW.val[3] = ran >> 24;
+    for (i = 0; i < 100; i++) RAW.val[i] = i;
+
+    CREATE_CSPRNG(&RNG, &RAW);  // initialise strong RNG
+
+    printf("\nTesting MPIN 2-factor authentication protocol on curve BN254\n");
+    mpin_BN254(&RNG);
+
+#if CHUNK!=16
+    printf("\nTesting MPIN 2-factor authentication protocol on curve BLS12383\n");
+    mpin_BLS12383(&RNG);
+    printf("\nTesting MPIN 2-factor authentication protocol on curve BLS24479\n");
+    mpin192_BLS24479(&RNG);
+    printf("\nTesting MPIN 2-factor authentication protocol on curve BLS48556\n");
+    mpin256_BLS48556(&RNG);
+#endif
+
+    KILL_CSPRNG(&RNG);
+}
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/testnhs b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/testnhs
new file mode 100644
index 0000000..21270d4
Binary files /dev/null and b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/testnhs differ
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/testnhs.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/testnhs.cpp
new file mode 100644
index 0000000..31478ac
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/testnhs.cpp
@@ -0,0 +1,76 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* test driver and function exerciser for NewHope Functions */
+
+// See https://eprint.iacr.org/2016/1157 (Alkim, Ducas, Popplemann and Schwabe)
+
+/* gcc -O2 testnhs.c core.a -o testnhs.exe */
+
+#include <stdio.h>
+#include <time.h>
+#include "newhope.h"
+
+using namespace core;
+
+int main()
+{
+    int i, ii, j, err;
+    unsigned long ran;
+    char raw[100];
+    csprng SRNG, CRNG;
+    RAND_clean(&SRNG); RAND_clean(&CRNG);
+    char s[1792], sb[1824], uc[2176], keyA[32], keyB[32];
+
+    octet S = {0, sizeof(s), s};
+    octet SB = {0, sizeof(sb), sb};
+    octet UC = {0, sizeof(uc), uc};
+    octet KEYA = {0, sizeof(keyA), keyA};
+    octet KEYB = {0, sizeof(keyB), keyB};
+
+    printf("\nTesting New Hope Key Exchange\n");
+
+// initialise random number generators
+    time((time_t *)&ran);
+
+    raw[0] = ran;
+    raw[1] = ran >> 8;
+    raw[2] = ran >> 16;
+    raw[3] = ran >> 24;
+
+    for (i = 4; i < 100; i++) raw[i] = i + 1;
+    RAND_seed(&SRNG, 100, raw);
+    for (i = 4; i < 100; i++) raw[i] = i + 2;
+    RAND_seed(&CRNG, 100, raw);
+
+// NewHope Simple key exchange - see https://eprint.iacr.org/2016/1157.pdf Protocol 1
+
+    NHS_SERVER_1(&SRNG, &SB, &S);
+    NHS_CLIENT(&CRNG, &SB, &UC, &KEYB);
+    NHS_SERVER_2(&S, &UC, &KEYA);
+
+    printf("Alice key= 0x");
+    OCT_output(&KEYA);
+    printf("Bob's key= 0x");
+    OCT_output(&KEYB);
+
+    return 0;
+}
+
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/testx509.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/testx509.cpp
new file mode 100644
index 0000000..c6381e3
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/testx509.cpp
@@ -0,0 +1,504 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+// To run test program 
+// g++ -O2 testx509.cpp  core.a -o testx509
+
+#include <stdio.h>
+#include "core.h"  // for octet support only
+#include "x509.h"
+
+// assumes library support for all of these
+#include "eddsa_Ed448.h"
+#include "eddsa_Ed25519.h"
+#include "ecdh_NIST256.h"
+#include "ecdh_NIST521.h"
+#include "rsa_RSA4096.h"
+#include "rsa_RSA2048.h"
+
+/* This simple driver program is hard-wired to support just one elliptic curve and one
+   RSA bit length. To change replace the text string NIST256 in the main program to
+   another curve and 2048 to some other value, where the curve and the RSA bit length
+   are suppported by the library. Of course a more elaborate program could support
+   muliple curves simultaneously */
+
+#define CHOICE USE_NIST256
+
+/* test driver program */
+// Sample Certs. Uncomment one CA cert and one example cert. Note that CORE library must be built to support given curve.
+// Sample Certs all created using OpenSSL - see http://blog.didierstevens.com/2008/12/30/howto-make-your-own-cert-with-openssl/
+// Note - SSL currently only supports NIST curves. Howevever version 1.1.0 of OpenSSL now supports C25519
+
+#if CHOICE==USE_NIST256
+
+// ** CA is RSA 2048-bit based - for use with NIST256 build of library - assumes use of SHA256 in Certs
+// RSA 2048 Self-Signed CA cert
+char ca_b64[] = "MIIDuzCCAqOgAwIBAgIJAP44jcM1MOROMA0GCSqGSIb3DQEBCwUAMHQxCzAJBgNVBAYTAklFMRAwDgYDVQQIDAdJcmVsYW5kMQ8wDQYDVQQHDAZEdWJsaW4xITAfBgNVBAoMGEludGVybmV0IFdpZGdpdHMgUHR5IEx0ZDEfMB0GCSqGSIb3DQEJARYQbXNjb3R0QGluZGlnby5pZTAeFw0xNTExMjYwOTUwMzlaFw0yMDExMjUwOTUwMzlaMHQxCzAJBgNVBAYTAklFMRAwDgYDVQQIDAdJcmVsYW5kMQ8wDQYDVQQHDAZEdWJsaW4xITAfBgNVBAoMGEludGVybmV0IFdpZGdpdHMgUHR5IEx0ZDEfMB0GCSqGSIb3DQEJARYQbXNjb3R0QGluZGlnby5pZTCCASIwDQYJKoZIhvcNAQEBBQADggEPADCCAQoCggEBANUs7/nri9J8zw8rW8JVszXP0ZqeLoQJaq2X28ebm8x5VT3okr9rnBjFjpx0YKQCAFQf8iSOOYuNpDvtZ/YpsjPbk2rg5sLY9G0eUMqrTuZ7moPSxnrXS5evizjD9Z9HqaqeNEYD3sPouPg+lhU1oAUQjUTJVFhEr1x0EnSEYbbrWtY9ZDSuZv+d4NIeqqPOYFd1yZc+LYZyQbAAQqwRLNPZH/rnIykLa6I7w7mGT7H6SBz2O09BtgpTHhalL40ecXa4ZOEze0xwzlc+mEFIrnmdadg3vQrJt42RVbo3LN6RfDIqUZOMOtQW/53pUR1lIpCwVWJTiOpmSEIEqhhjFq0CAwEAAaNQME4wHQYDVR0OBBYEFJrz6LHeT6FcjRahpUC3hAMxKRTCMB8GA1UdIwQYMBaAFJrz6LHeT6FcjRahpUC3hAMxKRTCMAwGA1UdEwQFMAMBAf8wDQYJKoZIhvcNAQELBQADggEBADqkqCYVa3X8XO9Ufu6XIUoZafFPRjSeJXvEIWqlbm7ixJZ2FPOvf2eMc5RCZYigNKhsxru5Ojw0lPcpa8DDmEsdZDf7p0vlmf7T7xH9gtoInh4DzgI8HRHFc8R/z2/jLX7nlLoopKX5yp7F1gRACg0pd4tGpQ6EnBNcYZZghFH9UIRDmx+vDlwDCu8vyRPt35orrEiI4XGq/QkvxxAb5YWxQ4i06064ULfyCI7suu3KoobdM1aAaA8zhpOOBXKbq+Wi9IGFe/wiEMHLmfHdt9CBTjIWb//IHji4RT05kCmTVrx97pb7EHafuL3L10mM5cpTyBWKnb4kMFtx9yw+S2U=";
+// an RSA 2048 CA-signed cert
+//char cert_b64[]="MIIDcjCCAloCAQEwDQYJKoZIhvcNAQELBQAwdDELMAkGA1UEBhMCSUUxEDAOBgNVBAgMB0lyZWxhbmQxDzANBgNVBAcMBkR1YmxpbjEhMB8GA1UECgwYSW50ZXJuZXQgV2lkZ2l0cyBQdHkgTHRkMR8wHQYJKoZIhvcNAQkBFhBtc2NvdHRAaW5kaWdvLmllMB4XDTE1MTEyNjEwMzQzMFoXDTE3MTEyNTEwMzQzMFowgYkxCzAJBgNVBAYTAklFMRAwDgYDVQQIDAdJcmVsYW5kMQ8wDQYDVQQHDAZEdWJsaW4xETAPBgNVBAoMCENlcnRpVm94MQ0wCwYDVQQLDARMYWJzMQ0wCwYDVQQDDARNSUtFMSYwJAYJKoZIhvcNAQkBFhdtaWtlLnNjb3R0QGNlcnRpdm94LmNvbTCCASIwDQYJKoZIhvcNAQEBBQADggEPADCCAQoCggEBAMIoxaQHFQzfyNChrw+3i7FjRFMHZ4zspkjkAcJW21LdBCqrxU+sdjyBoSFlrlafQOHshbrEP93AKX1bfaYbuV4fzq7OlRaLxaK+b+xrOJdewMI2WZ5OwEzj3onZATISogIoB6dTdzJ41NuxuMqQ/DqOnVrRA0SoIespbQhB8FGHBLw0hJATBzUk+bqOIt0HmnMp2EbYgtuG4lYINU/lD3Qt16SunUukWRLtxqJkioie+dkhP2zm+bOlSVmeQb4Wp8AI14OKkTfkdYC8qCxb5eabg90Q33rQUhNwRQHhHwopZwD/BgodasoSrPfwUlj0awh6y87eMGcik5Q/mjkCk5MCAwEAATANBgkqhkiG9w0BAQsFAAOCAQEAFrd7R/67ClkbLhpiX++6QTOa47siUAB9v+Qil9hZfhPNeeM589ixYkD4zH5pOK2B0ea+CXEKkanQ6lXx9KV86yS7fq6Yww7wO0diecusHd0+P82i46Tq0nm8nlsnAuhYoFRUGa2m2DkB1HSsB0ts8DjzFLySonFjSSLHDU0ox9/uFbJMzipy3ijAA4XM0N4jRrUfrmxpA7DOOsbEbGkvvB7VK9+s9PHE/4dJTwhSteplUnhxVFkkDo/JwaLx4/IEQRlCF3KEQ5s3AwRHnbrIjOY2yONxHBtJEp7QN5aOHruwvMNRNheCBPiQJyLitUsFGr4voANmobkrFgYtu0tRMQ==";
+// an ECDSA 256 CA-signed cert
+char cert_b64[] = "MIICojCCAYoCAQMwDQYJKoZIhvcNAQELBQAwdDELMAkGA1UEBhMCSUUxEDAOBgNVBAgMB0lyZWxhbmQxDzANBgNVBAcMBkR1YmxpbjEhMB8GA1UECgwYSW50ZXJuZXQgV2lkZ2l0cyBQdHkgTHRkMR8wHQYJKoZIhvcNAQkBFhBtc2NvdHRAaW5kaWdvLmllMB4XDTE1MTEyNjEzNDcyOVoXDTE3MTEyNTEzNDcyOVowgYQxCzAJBgNVBAYTAklFMRAwDgYDVQQIDAdJcmVsYW5kMQ8wDQYDVQQHDAZEdWJsaW4xETAPBgNVBAoMCENlcnRpdm94MQ0wCwYDVQQLDARMYWJzMQ8wDQYDVQQDDAZtc2NvdHQxHzAdBgkqhkiG9w0BCQEWEG1zY290dEBpbmRpZ28uaWUwWTATBgcqhkjOPQIBBggqhkjOPQMBBwNCAATO2iZiQZsXxzwBKnufKfZcsctNXZ4PmfJm638PmX9DQ3Xdb+nD5VxiOakNcB9xf5im8CriiOF5Z/7yPGyzUMbdMA0GCSqGSIb3DQEBCwUAA4IBAQAK5fMgGCCiPts8hMUZvYDpu8hd7qtPKPBc10QUccHb7PGrhqf/Ex2Gpj1aaURmx7SGZG0HX97LtkdW8KQpEoyaa60r7cjVA589TznxXKSGg5ggVoFJNpuZUm7VcolLjwIgTxtGbPzrvVMiZ4cl4PwFePXVKTl4f8XkOFX5gLmVSuCf729lEBmpx3IzqGmTjmnBixaApUElOKVeL7hiUKP3TqMUxZN+QNJBq4Mh9K9h4Sks2oneLwBwhMqQvpmcOb/7SucJn5N0IgJoGaMbfX0oCJJID1NSbagUSbFD1XciR2Ng9VtvnRP+htmEQ7jtww8phFdrWt5M5zPGOHUppqDx";
+
+// ** CA is ECC 256 based  - for use with NIST256 build of library
+// ECDSA 256 Self-Signed CA cert
+//char ca_b64[]="MIIB7TCCAZOgAwIBAgIJANp4nGS/VYj2MAoGCCqGSM49BAMCMFMxCzAJBgNVBAYTAklFMRAwDgYDVQQIDAdJcmVsYW5kMQ8wDQYDVQQHDAZEdWJsaW4xITAfBgNVBAoMGEludGVybmV0IFdpZGdpdHMgUHR5IEx0ZDAeFw0xNTExMjYxMzI0MTBaFw0yMDExMjUxMzI0MTBaMFMxCzAJBgNVBAYTAklFMRAwDgYDVQQIDAdJcmVsYW5kMQ8wDQYDVQQHDAZEdWJsaW4xITAfBgNVBAoMGEludGVybmV0IFdpZGdpdHMgUHR5IEx0ZDBZMBMGByqGSM49AgEGCCqGSM49AwEHA0IABPb6IjYNKyfbEtL1aafzW1jrn6ALn3PnGm7AyX+pcvwG0GKmb3Z/uHzhT4GysNE0/GB1n4Y/mrORQIm2X98rRs6jUDBOMB0GA1UdDgQWBBSfXUNkgJVklIhuXq4DCnVYhsdzwDAfBgNVHSMEGDAWgBSfXUNkgJVklIhuXq4DCnVYhsdzwDAMBgNVHRMEBTADAQH/MAoGCCqGSM49BAMCA0gAMEUCIQDrZJ1tshwTl/jabU2i49EOgbWe0ZgE3QZywJclf5IVwwIgVmz79AAf7e098lyrOKYAqbwjHVyMZGfmkNNGIuIhp/Q=";
+// an ECDSA 256 CA-signed cert
+//char cert_b64[]="MIIBvjCCAWQCAQEwCgYIKoZIzj0EAwIwUzELMAkGA1UEBhMCSUUxEDAOBgNVBAgMB0lyZWxhbmQxDzANBgNVBAcMBkR1YmxpbjEhMB8GA1UECgwYSW50ZXJuZXQgV2lkZ2l0cyBQdHkgTHRkMB4XDTE1MTEyNjEzMjc1N1oXDTE3MTEyNTEzMjc1N1owgYIxCzAJBgNVBAYTAklFMRAwDgYDVQQIDAdJcmVsYW5kMQ8wDQYDVQQHDAZEdWJsaW4xETAPBgNVBAoMCENlcnRpdm94MQ0wCwYDVQQLDARMYWJzMQ0wCwYDVQQDDARtaWtlMR8wHQYJKoZIhvcNAQkBFhBtc2NvdHRAaW5kaWdvLmllMFkwEwYHKoZIzj0CAQYIKoZIzj0DAQcDQgAEY42H52TfWMLueKB1o2Sq8uKaKErbHJ2GRAxrnJdNxex0hxZF5FUx7664BbPUolKhpvKTnJxDq5/gMqXzpKgR6DAKBggqhkjOPQQDAgNIADBFAiEA0ew08Xg32g7BwheslVKwXo9XRRx4kygYha1+cn0tvaUCIEKCEwnosZlAckjcZt8aHN5zslE9K9Y7XxTErTstthKc";
+// an RSA 2048 CA-signed cert
+//char cert_b64[]="MIICiDCCAi4CAQIwCgYIKoZIzj0EAwIwUzELMAkGA1UEBhMCSUUxEDAOBgNVBAgMB0lyZWxhbmQxDzANBgNVBAcMBkR1YmxpbjEhMB8GA1UECgwYSW50ZXJuZXQgV2lkZ2l0cyBQdHkgTHRkMB4XDTE1MTEyNjEzMzcwNVoXDTE3MTEyNTEzMzcwNVowgYExCzAJBgNVBAYTAklFMQ8wDQYDVQQIDAZJZWxhbmQxDzANBgNVBAcMBkR1YmxpbjERMA8GA1UECgwIQ2VydGl2b3gxDTALBgNVBAsMBExhYnMxDTALBgNVBAMMBE1pa2UxHzAdBgkqhkiG9w0BCQEWEG1zY290dEBpbmRpZ28uaWUwggEiMA0GCSqGSIb3DQEBAQUAA4IBDwAwggEKAoIBAQCjPBVwmPg8Gwx0+8xekmomptA0BDwS7NUfBetqDqNMNyji0bSe8LAfpciU7NW/HWfUE1lndCqSDDwnMJmwC5e3GAl/Bus+a+z8ruEhWGbn95xrHXFkOawbRlXuS7UcEQCvPr8KQHhNsg4cyV7Hn527CPUl27n+WN8/pANo01cTN/dQaK87naU0Mid09vktlMKSN0zyJOnc5CsaTLs+vCRKJ9sUL3d4IQIA2y7gvrTe+iY/QI26nqhGpNWYyFkAdy9PdHUEnDI6JsfF7jFh37yG7XEgDDA3asp/oi1T1+ZoASj2boL++opdqCzDndeWwzDWAWuvJ9wULd80ti6x737ZAgMBAAEwCgYIKoZIzj0EAwIDSAAwRQIgCDwgl98+9moBo+etaLt8MvB/z5Ti6i9neRTZkvoFl7YCIQDq//M3OB757fepErRzIQo3aFAFYjOooi6WdSqP3XqGIg==";
+
+#endif
+
+#if CHOICE==USE_ED25519
+
+// **CA is EDDSA Ed25519 based. Self-signed cert
+char ca_b64[]= "MIIBRTCB+KADAgECAhNBrGyCRdfc0WyPpPd+LB8LEiK4MAUGAytlcDAZMRcwFQYDVQQDDA5NaWtlJ3Mgcm9vdCBDQTAeFw0yMzA1MDExNjAwMDlaFw0yNDA0MzAxNjAwMDlaMBkxFzAVBgNVBAMMDk1pa2UncyByb290IENBMCowBQYDK2VwAyEAh8YXRWdICdF8CcR1P0RCO4xD+s5i8Pzpq8KHid/TQaajUzBRMB0GA1UdDgQWBBQAS56sNYWyao4k6DS/M81i+wqjIzAfBgNVHSMEGDAWgBQAS56sNYWyao4k6DS/M81i+wqjIzAPBgNVHRMBAf8EBTADAQH/MAUGAytlcANBAJWIicxVB6ynhjjkJgNtcL/kmixU7l/V1j/N0AtenDgT+yrMhDW9n9JC+Ze5qpX3Eu3VkdkpN3G9anmBXp3LtAk=";
+// EDDSA Ed25519 CA-signed Cert
+char cert_b64[]="MIHdMIGQAgEBMAUGAytlcDAZMRcwFQYDVQQDDA5NaWtlJ3Mgcm9vdCBDQTAeFw0yMzA1MDExNjA1NDhaFw0yNDA0MzAxNjA1NDhaMB0xGzAZBgNVBAMMEk1pa2UncyBzZXJ2ZXIgY2VydDAqMAUGAytlcAMhANvhwg8UhnGMGt0bKoGt5IHkvHwyEwWj4GkLQ7XIqJeVMAUGAytlcANBAESWzTJbz/YVwLFrDKVqYxHc86YGjPa8lekAC8UciIKu9d1Xoko3ssfhNiXkYkl3M0yEnIkD2F2DfGKbt8LSmQE=";
+
+#endif
+
+#if CHOICE==USE_ED448
+
+// **CA is EDDSA Ed448 based. Self-signed cert
+char ca_b64[]= "MIIBkjCCARKgAwIBAgIUWnfFe8sR7CGIz3eN1CfyHdTz14kwBQYDK2VxMBkxFzAVBgNVBAMMDk1pa2UncyByb290IENBMB4XDTIzMDUwMTE2NDQxMloXDTI0MDQzMDE2NDQxMlowGTEXMBUGA1UEAwwOTWlrZSdzIHJvb3QgQ0EwQzAFBgMrZXEDOgACd4YB/lGYUck4KxQMJ+lshkHnBuigmwPALPQGARv26SK/EOi0DIMMpyp3oG+pnPpnqbqtDtesCYCjUzBRMB0GA1UdDgQWBBRygDXbx5h57oo1D91LitQV2PE2dzAfBgNVHSMEGDAWgBRygDXbx5h57oo1D91LitQV2PE2dzAPBgNVHRMBAf8EBTADAQH/MAUGAytlcQNzAI17NGvKrGAH5hKLUHC1+Qv5RvT4IKlWg5GnRGTccc5tCrimveoMbu2KTlNXaOHS8y/sZT1qddukAFLzR/1ehZqOnYLM7dwlgYdksAx0olo5+/MYfj3hw5noh1pMObnJREfTPTSg1gqFI+gObB1UoSsBAA=="; 
+// EDDSA Ed448 CA-signed Cert
+char cert_b64[]="MIIBIzCBpAIBATAFBgMrZXEwGTEXMBUGA1UEAwwOTWlrZSdzIHJvb3QgQ0EwHhcNMjMwNTAxMTY0NjQzWhcNMjQwNDMwMTY0NjQzWjAYMRYwFAYDVQQDDA1NaWtlJ3Mgc2VydmVyMEMwBQYDK2VxAzoAgYh3CQP+EgId5/TZjAsuxh7Y9nPYtN5CYeN8vLjPuRqQncja3MyhRJaOrUEKSnBK+zYbkdXMQQwAMAUGAytlcQNzAPcm8DVSRZA1r0QqsSsHv6xBy1ASaoz4RFyelFMUD4f6ERMaxTzs0LKQHtcx5G9vqOxvQyCgkEu2AOcUQLtEXcoOSLH8fy0+5yEbbs6uPA1hi/oGpy580SR/5K5odY35fe1kwhz9YUvT4suTRHocnpcsAA==";
+#endif
+
+char io[5000];
+octet IO = {0, sizeof(io), io};
+
+#define MAXMODBYTES 72
+#define MAXFFLEN 16
+
+char sig[MAXMODBYTES * MAXFFLEN];
+octet SIG = {0, sizeof(sig), sig};
+
+char r[MAXMODBYTES];
+octet R = {0, sizeof(r), r};
+
+char s[MAXMODBYTES];
+octet S = {0, sizeof(s), s};
+
+char cakey[MAXMODBYTES * MAXFFLEN];
+octet CAKEY = {0, sizeof(cakey), cakey};
+
+char certkey[MAXMODBYTES * MAXFFLEN];
+octet CERTKEY = {0, sizeof(certkey), certkey};
+
+char h[5000];
+octet H = {0, sizeof(h), h};
+
+char hh[5000];
+octet HH = {0, sizeof(hh), hh};
+
+char hp[RFS_RSA2048];
+octet HP = {0, sizeof(hp), hp};
+
+
+void print_out(char *des, octet *c, int index, int len)
+{
+    int i;
+    printf("%s [", des);
+    for (i = 0; i < len; i++)
+        printf("%c", c->val[index + i]);
+    printf("]\n");
+}
+
+void print_date(char *des, octet *c, int index)
+{
+    int i = index;
+    printf("%s [", des);
+    if (i == 0) printf("]\n");
+    else printf("20%c%c-%c%c-%c%c %c%c:%c%c:%c%c]\n", c->val[i], c->val[i + 1], c->val[i + 2], c->val[i + 3], c->val[i + 4], c->val[i + 5], c->val[i + 6], c->val[i + 7], c->val[i + 8], c->val[i + 9], c->val[i + 10], c->val[i + 11]);
+}
+
+int main()
+{
+    int res, len, sha;
+    int c, ic;
+    RSA2048::rsa_public_key PK;
+    pktype st, ca, pt;
+
+    printf("First check signature on self-signed cert and extract CA public key\n");
+    OCT_frombase64(&IO, ca_b64);
+    printf("CA Self-Signed Cert= \n");
+    OCT_output(&IO);
+    printf("\n");
+
+    st = X509_extract_cert_sig(&IO, &SIG); // returns signature type
+
+    if (st.type == 0)
+    {
+        printf("Unable to extract cert signature\n");
+        return 0;
+    }
+
+    if (st.type == X509_ECC)
+    {
+        OCT_chop(&SIG, &S, SIG.len / 2);
+        OCT_copy(&R, &SIG);
+        printf("ECDSA SIG= \n");
+        OCT_output(&R);
+        OCT_output(&S);
+        printf("\n");
+    }
+
+    if (st.type == X509_ECD)
+    {
+        printf("EDDSA SIG= \n");
+        OCT_output(&SIG);
+        printf("\n");
+    }
+
+    if (st.type == X509_RSA)
+    {
+        printf("RSA SIG= \n");
+        OCT_output(&SIG);
+        printf("\n");
+    }
+
+    if (st.hash == X509_H256) printf("Hashed with SHA256\n");
+    if (st.hash == X509_H384) printf("Hashed with SHA384\n");
+    if (st.hash == X509_H512) printf("Hashed with SHA512\n");
+
+// Extract Cert from signed Cert
+
+    c = X509_extract_cert(&IO, &H);
+
+    printf("\nCert= \n");
+    OCT_output(&H);
+    printf("\n");
+
+// show some details
+    printf("Issuer Details\n");
+    ic = X509_find_issuer(&H,&len);
+    c = X509_find_entity_property(&H, &X509_ON, ic, &len);
+    print_out((char *)"owner=", &H, c, len);
+    c = X509_find_entity_property(&H, &X509_CN, ic, &len);
+    print_out((char *)"country=", &H, c, len);
+    c = X509_find_entity_property(&H, &X509_EN, ic, &len);
+    print_out((char *)"email=", &H, c, len);
+    c = X509_find_entity_property(&H, &X509_MN, ic, &len);
+    print_out((char *)"Common Name=", &H, c, len);
+    printf("\n");
+
+    ca = X509_extract_public_key(&H, &CAKEY);
+
+    if (ca.type == 0)
+    {
+        printf("Not supported by library\n");
+        return 0;
+    }
+    //if (ca.type != st.type)
+    if (!X509_self_signed(&H))
+    {
+        printf("Not self-signed\n");
+    }
+
+    if (ca.type == X509_ECD)
+    {
+        printf("EXTRACTED EDDSA PUBLIC KEY= \n");
+        OCT_output(&CAKEY);
+    }
+    if (ca.type == X509_ECC)
+    {
+        printf("EXTRACTED ECDSA PUBLIC KEY= \n");
+        OCT_output(&CAKEY);
+    }
+    if (ca.type == X509_RSA)
+    {
+        printf("EXTRACTED RSA PUBLIC KEY= \n");
+        OCT_output(&CAKEY);
+    }
+    printf("\n");
+
+// Cert is self-signed - so check signature
+
+    printf("Checking Self-Signed Signature\n");
+    if (ca.type == X509_ECC)
+    {
+        if (ca.curve != CHOICE)
+        {
+            printf("Curve is not supported\n");
+            return 0;
+        }
+        res = NIST256::ECP_PUBLIC_KEY_VALIDATE(&CAKEY);
+        if (res != 0)
+        {
+            printf("ECP Public Key is invalid!\n");
+            return 0;
+        }
+        else printf("ECP Public Key is Valid\n");
+
+        sha = 0;
+
+        if (st.hash == X509_H256) sha = SHA256;
+        if (st.hash == X509_H384) sha = SHA384;
+        if (st.hash == X509_H512) sha = SHA512;
+        if (sha == 0)
+        {
+            printf("Hash Function not supported\n");
+            return 0;
+        }
+
+        if (NIST256::ECP_VP_DSA(sha, &CAKEY, &H, &R, &S) != 0)
+        {
+            printf("***ECDSA Verification Failed\n");
+            return 0;
+        }
+        else
+            printf("ECDSA Signature/Verification succeeded \n");
+    }
+
+    if (ca.type == X509_ECD)
+    {
+        if (ca.curve != CHOICE)
+        {
+            printf("Curve is not supported %d\n",ca.curve);
+            return 0;
+        }
+        if (ca.curve == USE_ED25519)
+        {
+            if (!Ed25519::EDDSA_VERIFY(false,&CAKEY,NULL,&H,&SIG))
+            {
+                printf("***EDDSA Verification Failed\n");
+                return 0;
+            }
+            else
+                printf("EDDSA Signature/Verification succeeded \n");
+        }
+        if (ca.curve == USE_ED448)
+        {
+            if (!Ed448::EDDSA_VERIFY(false,&CAKEY,NULL,&H,&SIG))
+            {
+                printf("***EDDSA Verification Failed %d\n",SIG.len);
+                return 0;
+            }
+            else
+                printf("EDDSA Signature/Verification succeeded \n");
+        }
+    }
+    if (ca.type == X509_RSA)
+    {
+        if (ca.curve != 2048)
+        {
+            printf("RSA bit size is not supported\n");
+            return 0;
+        }
+        PK.e = 65537; // assuming this!
+        RSA2048::RSA_fromOctet(PK.n, &CAKEY);
+
+        sha = 0;
+
+        if (st.hash == X509_H256) sha = SHA256;
+        if (st.hash == X509_H384) sha = SHA384;
+        if (st.hash == X509_H512) sha = SHA512;
+        if (sha == 0)
+        {
+            printf("Hash Function not supported\n");
+            return 0;
+        }
+        core::PKCS15(sha, &H, &HP);
+
+        RSA2048::RSA_ENCRYPT(&PK, &SIG, &HH);
+
+        if (OCT_comp(&HP, &HH))
+            printf("RSA Signature/Verification succeeded \n");
+        else
+        {
+            printf("***RSA Verification Failed\n");
+            return 0;
+        }
+    }
+
+    printf("\nNext check CA signature on cert, and extract public key\n");
+
+    OCT_frombase64(&IO, cert_b64);
+    printf("Example Cert= \n");
+    OCT_output(&IO);
+    printf("\n");
+
+    st = X509_extract_cert_sig(&IO, &SIG);
+
+    if (st.type == 0)
+    {
+        printf("Unable to check cert signature\n");
+        return 0;
+    }
+
+    if (st.type == X509_ECC)
+    {
+        OCT_chop(&SIG, &S, SIG.len / 2);
+        OCT_copy(&R, &SIG);
+        printf("SIG= \n");
+        OCT_output(&R);
+
+        OCT_output(&S);
+
+        printf("\n");
+    }
+
+    if (st.type == X509_ECD)
+    {
+        printf("SIG= \n");
+        OCT_output(&SIG);
+        printf("\n");
+    }
+
+    if (st.type == X509_RSA)
+    {
+        printf("SIG= \n");
+        OCT_output(&SIG);
+        printf("\n");
+    }
+
+    c = X509_extract_cert(&IO, &H);
+
+    printf("Cert= \n");
+    OCT_output(&H);
+    printf("\n");
+
+    printf("Subject Details\n");
+    ic = X509_find_subject(&H,&len);
+    c = X509_find_entity_property(&H, &X509_ON, ic, &len);
+    print_out((char *)"owner=", &H, c, len);
+    c = X509_find_entity_property(&H, &X509_CN, ic, &len);
+    print_out((char *)"country=", &H, c, len);
+    c = X509_find_entity_property(&H, &X509_EN, ic, &len);
+    print_out((char *)"email=", &H, c, len);
+    c = X509_find_entity_property(&H, &X509_MN, ic, &len);
+    print_out((char *)"Common Name=", &H, c, len);
+    printf("\n");
+
+    ic = X509_find_validity(&H);
+    c = X509_find_start_date(&H, ic);
+    print_date((char *)"start date= ", &H, c);
+    c = X509_find_expiry_date(&H, ic);
+    print_date((char *)"expiry date=", &H, c);
+    printf("\n");
+
+    pt = X509_extract_public_key(&H, &CERTKEY);
+
+    if (pt.type == 0)
+    {
+        printf("Not supported by library\n");
+        return 0;
+    }
+
+    if (pt.type == X509_ECC)
+    {
+        printf("EXTRACTED ECDSA PUBLIC KEY= \n");
+        OCT_output(&CERTKEY);
+    }
+    if (pt.type == X509_ECD)
+    {
+        printf("EXTRACTED EDDSA PUBLIC KEY= \n");
+        OCT_output(&CERTKEY);
+    }
+    if (pt.type == X509_RSA)
+    {
+        printf("EXTRACTED RSA PUBLIC KEY= \n");
+        OCT_output(&CERTKEY);
+    }
+
+    printf("\n");
+
+    /* Check CA signature */
+
+    if (ca.type == X509_ECC)
+    {
+        printf("Checking CA's ECDSA Signature on Cert\n");
+        res = NIST256::ECP_PUBLIC_KEY_VALIDATE(&CAKEY);
+        if (res != 0)
+            printf("ECP Public Key is invalid!\n");
+        else printf("ECP Public Key is Valid\n");
+
+        sha = 0;
+
+        if (st.hash == X509_H256) sha = SHA256;
+        if (st.hash == X509_H384) sha = SHA384;
+        if (st.hash == X509_H512) sha = SHA512;
+        if (sha == 0)
+        {
+            printf("Hash Function not supported\n");
+            return 0;
+        }
+
+        if (NIST256::ECP_VP_DSA(sha, &CAKEY, &H, &R, &S) != 0)
+            printf("***ECDSA Verification Failed\n");
+        else
+            printf("ECDSA Signature/Verification succeeded \n");
+    }
+
+    if (ca.type == X509_ECD)
+    {
+        printf("Checking CA's EDDSA Signature on Cert\n");
+        if (ca.curve == USE_ED25519)
+        {
+            if (!Ed25519::EDDSA_VERIFY(false,&CAKEY,NULL,&H,&SIG))
+            {
+                printf("***EDDSA Verification Failed\n");
+                return 0;
+            }
+            else
+                printf("EDDSA Signature/Verification succeeded \n");
+        } 
+        if (ca.curve == USE_ED448)
+        {
+            if (!Ed448::EDDSA_VERIFY(false,&CAKEY,NULL,&H,&SIG))
+            {
+                printf("***EDDSA Verification Failed\n");
+                return 0;
+            }
+            else
+                printf("EDDSA Signature/Verification succeeded \n");
+        } 
+    }
+
+    if (ca.type == X509_RSA)
+    {
+        printf("Checking CA's RSA Signature on Cert\n");
+        PK.e = 65537; // assuming this!
+        RSA2048::RSA_fromOctet(PK.n, &CAKEY);
+
+        sha = 0;
+
+        if (st.hash == X509_H256) sha = SHA256;
+        if (st.hash == X509_H384) sha = SHA384;
+        if (st.hash == X509_H512) sha = SHA512;
+        if (sha == 0)
+        {
+            printf("Hash Function not supported\n");
+            return 0;
+        }
+        core::PKCS15(sha, &H, &HP);
+
+        RSA_ENCRYPT(&PK, &SIG, &HH);
+
+        if (OCT_comp(&HP, &HH))
+            printf("RSA Signature/Verification succeeded \n");
+        else
+            printf("***RSA Verification Failed\n");
+
+    }
+
+    return 0;
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/x509.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/x509.cpp
new file mode 100644
index 0000000..ea0d07f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/x509.cpp
@@ -0,0 +1,1170 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* CORE X.509 Functions */
+
+#include <stdio.h>
+#include "core.h"  // for octet support only
+#include "x509.h"
+
+// Some ASN.1 tags
+
+#define ANY 0x00
+#define SEQ 0x30
+#define OID 0x06
+#define INT 0x02
+#define NUL 0x05
+#define ZER 0x00
+#define UTF 0x0C
+#define UTC 0x17
+#define GTM 0x18
+#define LOG 0x01
+#define BIT 0x03
+#define OCT 0x04
+#define STR 0x13
+#define SET 0x31
+#define IA5 0x16
+#define EXT 0xA3
+#define DNS 0x82
+
+// Define some OIDs
+
+// Elliptic Curve with SHA256
+static unsigned char eccsha256[8] = {0x2a, 0x86, 0x48, 0xce, 0x3d, 0x04, 0x03, 0x02};
+static octet ECCSHA256 = {8, sizeof(eccsha256), (char *)eccsha256};
+
+// Elliptic Curve with SHA384
+static unsigned char eccsha384[8] = {0x2a, 0x86, 0x48, 0xce, 0x3d, 0x04, 0x03, 0x03};
+static octet ECCSHA384 = {8, sizeof(eccsha384), (char *)eccsha384};
+
+// Elliptic Curve with SHA512
+static unsigned char eccsha512[8] = {0x2a, 0x86, 0x48, 0xce, 0x3d, 0x04, 0x03, 0x04};
+static octet ECCSHA512 = {8, sizeof(eccsha512), (char *)eccsha512};
+
+// EC Public Key - Elliptic curve public key cryptography
+static unsigned char ecpk[7] = {0x2a, 0x86, 0x48, 0xce, 0x3d, 0x02, 0x01};
+static octet ECPK = {7, sizeof(ecpk), (char *)ecpk};
+
+// ED25519 Public Key - Elliptic curve EdDSA (Ed25519) Signature
+static unsigned char edpk25519[3] = {0x2B, 0x65, 0x70};  
+static octet EDPK25519 = {3, sizeof(edpk25519),(char *)edpk25519};
+
+// ED448 Public Key - Elliptic curve EdDSA (Ed448) Signature
+static unsigned char edpk448[3] = {0x2B, 0x65, 0x71};  
+static octet EDPK448 = {3, sizeof(edpk448),(char *)edpk448};
+
+// C25519 curve
+static unsigned char prime25519[9] = {0x2B, 0x06, 0x01, 0x04, 0x01, 0xDA, 0x47, 0x0F, 0x01}; /*****/
+static octet PRIME25519 = {9, sizeof(prime25519), (char *)prime25519};
+
+// NIST256 curve - (NIST) P-256
+static unsigned char prime256v1[8] = {0x2a, 0x86, 0x48, 0xce, 0x3d, 0x03, 0x01, 0x07};
+static octet PRIME256V1 = {8, sizeof(prime256v1), (char *)prime256v1};
+
+// NIST384 curve
+static unsigned char secp384r1[5] = {0x2B, 0x81, 0x04, 0x00, 0x22};
+static octet SECP384R1 = {5, sizeof(secp384r1), (char *)secp384r1};
+
+// NIST521 curve
+static unsigned char secp521r1[5] = {0x2B, 0x81, 0x04, 0x00, 0x23};
+static octet SECP521R1 = {5, sizeof(secp521r1), (char *)secp521r1};
+
+// RSA Public Key - RSAES-PKCS1-v1_5
+static unsigned char rsapk[9] = {0x2a, 0x86, 0x48, 0x86, 0xf7, 0x0d, 0x01, 0x01, 0x01};
+static octet RSAPK = {9, sizeof(rsapk), (char *)rsapk};
+
+// RSA with SHA256
+static unsigned char rsasha256[9] = {0x2a, 0x86, 0x48, 0x86, 0xf7, 0x0d, 0x01, 0x01, 0x0b};
+static octet RSASHA256 = {9, sizeof(rsasha256), (char *)rsasha256};
+
+// RSA with SHA384
+static unsigned char rsasha384[9] = {0x2a, 0x86, 0x48, 0x86, 0xf7, 0x0d, 0x01, 0x01, 0x0c};
+static octet RSASHA384 = {9, sizeof(rsasha384), (char *)rsasha384};
+
+// RSA with SHA512
+static unsigned char rsasha512[9] = {0x2a, 0x86, 0x48, 0x86, 0xf7, 0x0d, 0x01, 0x01, 0x0d};
+static octet RSASHA512 = {9, sizeof(rsasha512), (char *)rsasha512};
+
+// DILITHIUM3
+static unsigned char dilithium3[11] = {0x2b, 0x06, 0x01, 0x04, 0x01, 0x02, 0x82, 0x0B, 0x07, 0x06, 0x05};
+static octet DILITHIUM3 = {11, sizeof(dilithium3), (char *)dilithium3};
+
+
+// Cert details
+// countryName
+static unsigned char cn[3] = {0x55, 0x04, 0x06};
+octet X509_CN = {3, sizeof(cn), (char *)cn};
+
+// stateName
+static char sn[3]= {0x55,0x04,0x08};
+octet X509_SN= {3,sizeof(sn),sn};
+
+// localName
+static char ln[3]= {0x55,0x04,0x07};
+octet X509_LN= {3,sizeof(ln),ln};
+
+// orgName
+static unsigned char on[3] = {0x55, 0x04, 0x0A};
+octet X509_ON = {3, sizeof(on), (char *)on};
+
+// unitName
+static char un[3]= {0x55,0x04,0x0B};
+octet X509_UN= {3,sizeof(un),un};
+
+// myName
+static char mn[3]= {0x55,0x04,0x03};
+octet X509_MN= {3,sizeof(mn),mn};
+
+// emailName
+static unsigned char en[9] = {0x2a, 0x86, 0x48, 0x86, 0xf7, 0x0d, 0x01, 0x09, 0x01};
+octet X509_EN = {9, sizeof(en), (char *)en};
+
+// Extensions
+// Alt Name
+static char an[3]={0x55,0x1D,0x11};
+octet X509_AN = {3, sizeof(an),an};
+
+// Key Usage
+static char ku[3]={0x55,0x1d,0x0f};
+octet X509_KU = {3,sizeof(ku),ku};
+
+// Basic Constraints
+static char bc[3]={0x55,0x1d,0x13};
+octet X509_BC = {3,sizeof(bc),bc};
+
+/* Check expected TAG and return ASN.1 field length. If tag=0 skip check. */
+static int getalen(int tag, char *b, int j)
+{
+    int len;
+
+    if (tag != 0 && (unsigned char)b[j] != tag) return -1; // not a valid tag
+    j++;
+
+    if ((unsigned char)b[j] == 0x81)
+    {
+        j++;
+        len = (unsigned char)b[j];
+    }
+    else if ((unsigned char)b[j] == 0x82)
+    {
+        j++;
+        len = 256 * b[j++];
+        len += (unsigned char)b[j];
+    }
+    else
+    {
+        len = (unsigned char)b[j];
+        if (len > 127) return -1;
+    }
+    return len;
+}
+
+/* jump over length field */
+static int skip(int len)
+{
+    if (len < 128) return 2;
+    if (len < 256) return 3;
+    return 4;
+}
+
+/* round length up to nearest 8-byte length */
+static int bround(int len)
+{
+    if (len % 8 == 0) return len;
+    return len + (8 - len % 8);
+
+}
+
+// Input private key in PKCS#8 format
+// e.g. openssl req -x509 -nodes -newkey rsa:4096 -keyout key.pem -out cert.pem -days 365
+// e.g. openssl req -x509 -nodes -days 3650 -newkey ec:<(openssl ecparam -name prime256v1) -keyout key.pem -out ecdsacert.pem
+// extract private key from uncompressed key.pem into octet
+// For RSA octet = p|q|dp|dq|c where pk->len is multiple of 5
+// For ECC octet = k
+pktype X509_extract_private_key(octet *c,octet *pk)
+{
+    int i, j, k, fin, len, rlen, flen, tlen, sj, ex;
+    char soid[12];
+    octet SOID = {0, sizeof(soid), soid};
+    pktype ret;
+
+    ret.type = 0;
+    ret.hash = 0;
+    j=0;
+
+    len = getalen(SEQ, c->val, j); // Check for expected SEQ clause, and get length
+    if (len < 0) return ret;        // if not a SEQ clause, there is a problem, exit
+    j += skip(len);                 // skip over length to clause contents. Add len to skip clause
+
+    if (len + j != c->len) return ret;
+
+    len = getalen(INT, c->val, j);
+    if (len < 0) return ret;
+    j += skip(len) + len; // jump over serial number clause (if there is one)
+
+    len = getalen(SEQ, c->val, j); 
+    if (len < 0) return ret;        
+    j += skip(len);
+
+// extract OID
+    len = getalen(OID, c->val, j);
+    if (len < 0) return ret;
+    j += skip(len);
+
+    fin = j + len;
+    if (len>SOID.max) return ret;
+    SOID.len = len;
+    for (i = 0; j < fin; j++)
+        SOID.val[i++] = c->val[j];
+    j=fin;
+
+    if (OCT_comp(&EDPK25519, &SOID))
+    { // Its an Ed25519 key
+        len = getalen(OCT, c->val, j);
+        if (len < 0) return ret;
+        j += skip(len);
+        len = getalen(OCT, c->val, j);
+        if (len < 0) return ret;
+        j += skip(len);
+        rlen=32;
+        if (rlen>pk->max) return ret;
+        pk->len=rlen;
+        for (i=0;i<rlen-len;i++)
+            pk->val[i]=0;
+        for (i=rlen-len;i<rlen;i++)
+            pk->val[i]=c->val[j++];
+        ret.type = X509_ECD;
+        ret.curve = USE_ED25519;
+    }
+    if (OCT_comp(&EDPK448, &SOID))
+    { // Its an Ed448 key
+        len = getalen(OCT, c->val, j);
+        if (len < 0) return ret;
+        j += skip(len);
+        len = getalen(OCT, c->val, j);
+        if (len < 0) return ret;
+        j += skip(len);
+        rlen=57;
+        if (rlen>pk->max) return ret;
+        pk->len=rlen;
+        for (i=0;i<rlen-len;i++)
+            pk->val[i]=0;
+        for (i=rlen-len;i<rlen;i++)
+            pk->val[i]=c->val[j++];
+        ret.type = X509_ECD;
+        ret.curve = USE_ED448;
+    }
+    if (OCT_comp(&DILITHIUM3, &SOID))
+    { // Its a DILITHIUM3 key
+        len = getalen(OCT, c->val, j);
+        if (len < 0) return ret;
+        j += skip(len);
+        len = getalen(OCT, c->val, j);
+        if (len < 0) return ret;
+        j += skip(len);
+        tlen=len; 
+        if (tlen>pk->max)
+            tlen=pk->max;
+        for (i=0;i<tlen;i++)
+            pk->val[i]=c->val[j++];
+        pk->len=tlen;
+        ret.type=X509_PQ;
+        ret.curve=8*tlen;
+    }
+    if (OCT_comp(&ECPK, &SOID))
+    { // Its an ECC key
+        len = getalen(OID, c->val, j);
+        if (len < 0) return ret;
+        j += skip(len);
+
+        fin = j + len;
+        if (len>SOID.max) return ret;
+        SOID.len = len;
+        for (i = 0; j < fin; j++)
+            SOID.val[i++] = c->val[j];
+        j=fin;           
+        
+        len = getalen(OCT, c->val, j);
+        if (len < 0) return ret;
+        j += skip(len);
+
+        len = getalen(SEQ, c->val, j); 
+        if (len < 0) return ret; 
+        j += skip(len);
+
+        len = getalen(INT, c->val, j);
+        if (len < 0) return ret;
+        j += skip(len) + len; // jump over version
+
+        len = getalen(OCT, c->val, j);
+        if (len < 0) return ret;
+        j += skip(len);
+
+        ret.type = X509_ECC;
+        if (OCT_comp(&PRIME256V1, &SOID)) {
+            ret.curve = USE_NIST256;
+            rlen=32;
+        }
+        if (OCT_comp(&SECP384R1, &SOID)) {
+            ret.curve = USE_NIST384;
+            rlen=48;
+        }
+        if (OCT_comp(&SECP521R1, &SOID)) {
+            rlen=66;
+            ret.curve = USE_NIST521;
+        }
+        if (rlen>pk->max)
+        {
+            ret.curve=0;
+            return ret;
+        }
+        pk->len=rlen;
+        for (i=0;i<rlen-len;i++)
+            pk->val[i]=0;
+        for (i=rlen-len;i<rlen;i++)
+            pk->val[i]=c->val[j++];
+
+    }
+    if (OCT_comp(&RSAPK, &SOID))
+    { // Its an RSA key
+        len = getalen(NUL, c->val, j);
+        if (len<0) return ret;
+        j += skip(len);
+
+        len = getalen(OCT, c->val, j);
+        if (len < 0) return ret;
+        j += skip(len);
+
+        len = getalen(SEQ, c->val, j); 
+        if (len < 0) return ret; 
+        j += skip(len);
+
+        len = getalen(INT, c->val, j);
+        if (len < 0) return ret;
+        j += skip(len) + len; // jump over version
+
+        len = getalen(INT, c->val, j);
+        if (len < 0) return ret;
+        j += skip(len) + len; // jump over n
+
+        len = getalen(INT, c->val, j);
+        if (len < 0) return ret;
+        j += skip(len) + len; // jump over e
+
+        len = getalen(INT, c->val, j);
+        if (len < 0) return ret;
+        j += skip(len) + len; // jump over d
+
+
+        len = getalen(INT, c->val, j);
+        if (len < 0) return ret;
+        j += skip(len); // get p
+
+        if (c->val[j] == 0)
+        { // skip leading zero
+            j++;
+            len--;
+        }
+        rlen=bround(len);
+
+        if (5*rlen>pk->max)
+            return ret;
+       
+        for (i=0;i<rlen-len;i++)
+            pk->val[i]=0;
+
+        for (i=rlen-len;i<rlen;i++)
+            pk->val[i]=c->val[j++];
+
+        flen=rlen;          // should be same length for all
+        for (k=1;k<5;k++)
+        {
+            len = getalen(INT,c->val,j);
+            if (len<0) return ret;
+            j += skip(len);  // get q,dp,dq,c
+            if (c->val[j] == 0)
+            { // skip leading zero
+                j++;
+                len--;
+            }
+            rlen=bround(len);
+            if (rlen!=flen) return ret;
+            for (i=0;i<rlen-len;i++)
+                pk->val[i]=0;
+            for (i=rlen-len;i<rlen;i++)
+                pk->val[k*flen+i]=c->val[j++];
+        }
+        pk->len=5*flen;
+        ret.type = X509_RSA;
+        ret.curve = 16 * flen;
+    }
+    return ret;
+}
+
+//  Input signed cert as octet, and extract signature
+//  Return 0 for failure, ECC for Elliptic Curve signature, RSA for RSA signature
+//  Note that signature type is not provided here - its the type of the public key that
+//  is used to verify it that matters, and which determines for example the curve to be used!
+
+pktype X509_extract_cert_sig(octet *sc, octet *sig)
+{
+    int i, j, k, fin, len, rlen, sj, ex;
+    char soid[12];
+    octet SOID = {0, sizeof(soid), soid};
+    pktype ret;
+
+    ret.type = 0;
+    ret.hash = 0;
+
+    j = 0;
+
+    len = getalen(SEQ, sc->val, j); // Check for expected SEQ clause, and get length
+    if (len < 0) return ret;        // if not a SEQ clause, there is a problem, exit
+    j += skip(len);                 // skip over length to clause contents. Add len to skip clause
+
+    if (len + j != sc->len) return ret;
+
+    len = getalen(SEQ, sc->val, j);
+    if (len < 0) return ret;
+    j += skip(len) + len; // jump over cert to signature OID
+
+    len = getalen(SEQ, sc->val, j);
+    if (len < 0) return ret;
+    j += skip(len);
+
+    sj = j + len; // Needed to jump over signature OID
+
+// dive in to extract OID
+    len = getalen(OID, sc->val, j);
+    if (len < 0) return ret;
+    j += skip(len);
+
+    fin = j + len;
+    if (len>SOID.max) return ret;
+    SOID.len = len;
+    for (i = 0; j < fin; j++)
+        SOID.val[i++] = sc->val[j];
+
+    // check OID here..
+    if (OCT_comp(&EDPK25519, &SOID))
+    {
+        ret.type = X509_ECD;
+        ret.hash = X509_H512;
+    }
+    if (OCT_comp(&EDPK448, &SOID))
+    {
+        ret.type = X509_ECD;
+        ret.hash = X509_SHAKE256;
+    }
+    if (OCT_comp(&ECCSHA256, &SOID))
+    {
+        ret.type = X509_ECC;
+        ret.hash = X509_H256;
+    }
+    if (OCT_comp(&ECCSHA384, &SOID))
+    {
+        ret.type = X509_ECC;
+        ret.hash = X509_H384;
+    }
+    if (OCT_comp(&ECCSHA512, &SOID))
+    {
+        ret.type = X509_ECC;
+        ret.hash = X509_H512;
+    }
+    if (OCT_comp(&RSASHA256, &SOID))
+    {
+        ret.type = X509_RSA;
+        ret.hash = X509_H256;
+    }
+    if (OCT_comp(&RSASHA384, &SOID))
+    {
+        ret.type = X509_RSA;
+        ret.hash = X509_H384;
+    }
+    if (OCT_comp(&RSASHA512, &SOID))
+    {
+        ret.type = X509_RSA;
+        ret.hash = X509_H512;
+    }
+    if (OCT_comp(&DILITHIUM3, &SOID))
+    {
+        ret.type = X509_PQ;
+        ret.hash = 0; // hash type is implicit
+    }
+    if (ret.type == 0) return ret; // unsupported type
+
+    j = sj; // jump out to signature
+
+    len = getalen(BIT, sc->val, j);
+    if (len < 0)
+    {
+        ret.type = 0;
+        return ret;
+    }
+    j += skip(len);
+    j++;
+    len--; // skip bit shift (hopefully 0!)
+
+    if (ret.type==X509_ECD) 
+    {
+        if (len>sig->max)
+        {
+            ret.type=0;
+            return ret;
+        }
+        sig->len = len;
+        i = 0;
+        fin = j + len;
+        for (; j < fin; j++)
+            sig->val[i++] = sc->val[j];
+
+        if (ret.hash == X509_H512) ret.curve = USE_ED25519;
+        if (ret.hash == X509_SHAKE256) ret.curve = USE_ED448;
+    }
+    if (ret.type == X509_ECC)
+    {
+        // signature in the form (r,s)
+        len = getalen(SEQ, sc->val, j);
+        if (len < 0)
+        {
+            ret.type = 0;
+            return ret;
+        }
+        j += skip(len);
+
+        // pick up r part of signature
+        len = getalen(INT, sc->val, j);
+        if (len < 0)
+        {
+            ret.type = 0;
+            return ret;
+        }
+        j += skip(len);
+
+        if (sc->val[j] == 0)
+        {
+            // skip leading zero
+            j++;
+            len--;
+        }
+        rlen = bround(len);
+
+        ex = rlen - len;
+
+        if (2*rlen>sig->max)
+        {
+            ret.type=0;
+            return ret;
+        }
+        sig->len = 2 * rlen;
+
+        i = 0;
+        for (k = 0; k < ex; k++)
+            sig->val[i++] = 0;
+
+        fin = j + len;
+        for (; j < fin; j++)
+            sig->val[i++] = sc->val[j];
+
+        // pick up s part of signature
+        len = getalen(INT, sc->val, j);
+        if (len < 0)
+        {
+            ret.type = 0;
+            return ret;
+        }
+        j += skip(len);
+
+        if (sc->val[j] == 0)
+        {
+            // skip leading zeros
+            j++;
+            len--;
+        }
+        rlen = bround(len);
+        ex = rlen - len;
+        for (k = 0; k < ex; k++)
+            sig->val[i++] = 0;
+
+        fin = j + len;
+        for (; j < fin; j++)
+            sig->val[i++] = sc->val[j];
+
+        if (ret.hash == X509_H256) ret.curve = USE_NIST256;
+        if (ret.hash == X509_H384) ret.curve = USE_NIST384;
+        if (ret.hash == X509_H512) ret.curve = USE_NIST521;
+    }
+    if (ret.type == X509_RSA)
+    {
+        rlen = bround(len);
+        ex = rlen - len;
+
+        if (rlen>sig->max)
+        {
+            ret.type=0;
+            return ret;
+        }
+        sig->len = rlen;
+        i = 0;
+        for (k = 0; k < ex; k++)
+            sig->val[i++] = 0;
+
+        fin = j + len;
+        for (; j < fin; j++)
+            sig->val[i++] = sc->val[j];
+
+        ret.curve = 8*rlen;
+    }
+    if (ret.type == X509_PQ)
+    {
+        if (len>sig->max)
+        {
+            ret.type=0;
+            return ret;
+        }
+        sig->len = len;
+        fin = j + len;
+        for (i=0; j < fin; j++)
+            sig->val[i++] = sc->val[j];
+        ret.curve = 8*len;
+    }
+    return ret;
+}
+
+// Extract certificate from signed cert
+int X509_extract_cert(octet *sc, octet *cert)
+{
+    int i, j, fin, len, k;
+
+    j = 0;
+    len = getalen(SEQ, sc->val, j);
+
+    if (len < 0) return 0;
+    j += skip(len);
+
+    k = j;
+
+    len = getalen(SEQ, sc->val, j);
+    if (len < 0) return 0;
+    j += skip(len);
+
+    fin = j + len;
+    if (fin-k>cert->max) return 0;
+
+    cert->len = fin - k;
+
+    for (i = k; i < fin; i++) cert->val[i - k] = sc->val[i];
+
+    return 1;
+}
+
+// find index to start of ASN.1 raw public key, and return its length
+int X509_find_public_key(octet *c,int *ptr)
+{
+    int i, j, k, fin, len, sj;
+
+    j = 0;
+
+    len = getalen(SEQ, c->val, j);
+    if (len < 0) return 0;
+    j += skip(len);
+
+    if (len + j != c->len) return 0;
+
+    len = getalen(ANY, c->val, j);
+    if (len < 0) return 0;
+    j += skip(len) + len; //jump over version clause
+
+    len = getalen(INT, c->val, j);
+
+    if (len > 0) j += skip(len) + len; // jump over serial number clause (if there is one)
+
+    len = getalen(SEQ, c->val, j);
+    if (len < 0) return 0;
+    j += skip(len) + len; // jump over signature algorithm
+
+    len = getalen(SEQ, c->val, j);
+    if (len < 0) return 0;
+    j += skip(len) + len; // skip issuer
+
+    len = getalen(SEQ, c->val, j);
+    if (len < 0) return 0;
+    j += skip(len) + len; // skip validity
+
+    len = getalen(SEQ, c->val, j);
+    if (len < 0) return 0;
+    j += skip(len) + len; // skip subject
+
+    k=j;
+    len = getalen(SEQ, c->val, j); // look ahead to determine length
+    if (len < 0) return 0;
+    j += skip(len); //
+
+    fin=j+len;
+    *ptr=k;
+    return fin-k;
+}
+
+// get Public Key details from ASN.1 description
+pktype X509_get_public_key(octet *c,octet *key) 
+{
+    int i, j, fin, len, sj, ptr;
+    char koid[12];     /*****/
+    octet KOID = {0, sizeof(koid), koid};
+    pktype ret;
+
+    ret.type = ret.hash = 0;
+    ret.curve = -1;
+
+    j=0;
+
+    len = getalen(SEQ, c->val, j);
+    if (len < 0) return ret;
+    j += skip(len); //
+
+    len = getalen(SEQ, c->val, j);
+    if (len < 0) return ret;
+    j += skip(len);
+
+// ** Maybe dive in and check Public Key OIDs here?
+// ecpublicKey & prime256v1, secp384r1 or secp521r1 for ECC
+// rsapublicKey for RSA
+
+    sj = j + len;
+
+    len = getalen(OID, c->val, j);
+    if (len < 0) return ret;
+    j += skip(len);
+
+    fin = j + len;
+    if (len>KOID.max) return ret;
+    KOID.len = len;
+    for (i = 0; j < fin; j++)
+        KOID.val[i++] = c->val[j];
+
+    ret.type = 0;
+    if (OCT_comp(&ECPK, &KOID)) ret.type = X509_ECC;
+    if (OCT_comp(&EDPK25519, &KOID)) {ret.type = X509_ECD; ret.curve=USE_ED25519;}
+    if (OCT_comp(&EDPK448, &KOID)) {ret.type = X509_ECD;  ret.curve=USE_ED448;}
+    if (OCT_comp(&RSAPK, &KOID)) ret.type = X509_RSA;
+    if (OCT_comp(&DILITHIUM3, &KOID)) ret.type = X509_PQ;
+
+    if (ret.type == 0) return ret;
+
+    if (ret.type == X509_ECC)
+    {
+        // which elliptic curve?
+        len = getalen(OID, c->val, j);
+        if (len < 0)
+        {
+            ret.type = 0;
+            return ret;
+        }
+        j += skip(len);
+
+        fin = j + len;
+        if (len>KOID.max)
+        {
+            ret.type=0;
+            return ret;
+        }
+        KOID.len = len;
+        for (i = 0; j < fin; j++)
+            KOID.val[i++] = c->val[j];
+
+        if (OCT_comp(&PRIME25519, &KOID)) ret.curve = USE_ED25519; /*****/
+        if (OCT_comp(&PRIME256V1, &KOID)) ret.curve = USE_NIST256;
+        if (OCT_comp(&SECP384R1, &KOID)) ret.curve = USE_NIST384;
+        if (OCT_comp(&SECP521R1, &KOID)) ret.curve = USE_NIST521;
+    }
+
+    j = sj; // skip to actual Public Key
+
+    len = getalen(BIT, c->val, j);
+    if (len < 0)
+    {
+        ret.type = 0;
+        return ret;
+    }
+    j += skip(len); //
+    j++;
+    len--; // skip bit shift (hopefully 0!)
+
+// extract key
+    if (ret.type == X509_ECC || ret.type == X509_ECD || ret.type == X509_PQ)
+    {
+        if (len>key->max)
+        {
+            ret.type=0;
+            return ret;
+        }
+        key->len = len;
+        fin = j + len;
+        for (i = 0; j < fin; j++)
+            key->val[i++] = c->val[j];
+    }
+    if (ret.type == X509_PQ) 
+        ret.curve=8*len;
+    if (ret.type == X509_RSA)
+    {
+        // Key is (modulus,exponent) - assume exponent is 65537
+        len = getalen(SEQ, c->val, j);
+        if (len < 0)
+        {
+            ret.type = 0;
+            return ret;
+        }
+        j += skip(len); //
+
+        len = getalen(INT, c->val, j); // get modulus
+        if (len < 0)
+        {
+            ret.type = 0;
+            return ret;
+        }
+        j += skip(len); //
+        if (c->val[j] == 0)
+        {
+            j++;
+            len--; // remove leading zero
+        }
+        if (len>key->max)
+        {
+            ret.type=0;
+            return ret;
+        }
+        key->len = len;
+        fin = j + len;
+        for (i = 0; j < fin; j++)
+            key->val[i++] = c->val[j];
+
+        ret.curve = 8 * len;
+    }
+    return ret;
+}
+
+// Extract Public Key from inside Certificate
+pktype X509_extract_public_key(octet *c, octet *key)
+{
+    int ptr=0;
+    int pklen=X509_find_public_key(c,&ptr);
+    octet CC={pklen,pklen,&c->val[ptr]};
+    return X509_get_public_key(&CC,key);
+}
+
+// Find pointer to main sections of cert, before extracting individual field
+// Find index to issuer in cert, and its length
+// This is the certificate DER encoded distinguished issuer name 
+int X509_find_issuer(octet *c,int *flen)
+{
+    int j, len;
+    *flen=0;
+    j = 0;
+    len = getalen(SEQ, c->val, j);
+    if (len < 0) return 0;
+    j += skip(len);
+
+    if (len + j != c->len) return 0;
+
+    len = getalen(ANY, c->val, j);
+    if (len < 0) return 0;
+    j += skip(len) + len; //jump over version clause
+
+    len = getalen(INT, c->val, j);
+
+    if (len > 0) j += skip(len) + len; // jump over serial number clause (if there is one)
+
+    len = getalen(SEQ, c->val, j);
+    if (len < 0) return 0;
+    j += skip(len) + len; // jump over signature algorithm
+
+    len=getalen(SEQ,c->val,j);
+    *flen=len+skip(len);      // length of issuer
+
+    return j;
+}
+
+// Find index to validity period
+int X509_find_validity(octet *c)
+{
+    int j, len;
+    j = X509_find_issuer(c,&len);
+    j+=len; // skip issuer
+
+    //len = getalen(SEQ, c->val, j);
+    //if (len < 0) return 0;
+    //j += skip(len) + len; // skip issuer
+
+    return j;
+}
+
+// Find index to subject in cert, and its length
+// This is the certificate DER encoded distinguished subject name 
+int X509_find_subject(octet *c,int *flen)
+{
+    int j, len;
+    *flen=0;
+    j = X509_find_validity(c);
+
+    len = getalen(SEQ, c->val, j);
+    if (len < 0) return 0;
+    j += skip(len) + len; // skip validity
+
+    len=getalen(SEQ,c->val,j);
+    *flen=len+skip(len);
+
+    return j;
+}
+
+int X509_self_signed(octet *c)
+{
+    int i,m,slen,ilen;
+    int ksub=X509_find_subject(c,&slen);
+    int kiss=X509_find_issuer(c,&ilen);
+
+    if (slen!=ilen) return 0;
+
+    //int sublen=getalen(SEQ,c->val,ksub);
+    //int isslen=getalen(SEQ,c->val,kiss);
+    //if (isslen!=sublen) return 0;
+    //ksub+=skip(sublen);
+    //kiss+=skip(isslen);
+    for (i=m=0;i<slen;i++)
+        m|=c->val[i+ksub] - c->val[i+kiss];
+    if (m!=0) return 0;
+    return 1;
+}
+
+// NOTE: When extracting cert information, we actually return just an index to the data inside the cert, and maybe its length
+// So no memory is assigned to store cert info. It is the callers responsibility to allocate such memory if required, and copy
+// cert information into it.
+
+// Find entity property indicated by SOID, given start of issuer or subject field. Return index in cert, flen=length of field
+
+int X509_find_entity_property(octet *c, octet *SOID, int start, int *flen)
+{
+    int i, j, k, fin, len, tlen;
+    char foid[50];  /*****/
+    octet FOID = {0, sizeof(foid), foid};
+
+    j = start;
+
+    tlen = getalen(SEQ, c->val, j);
+    if (tlen < 0) return 0;
+    j += skip(tlen);
+
+    for (k = j; j < k + tlen;)
+    {
+        // search for Owner OID
+        len = getalen(SET, c->val, j);
+        if (len < 0) return 0;
+        j += skip(len);
+        len = getalen(SEQ, c->val, j);
+        if (len < 0) return 0;
+        j += skip(len);
+        len = getalen(OID, c->val, j);
+        if (len < 0) return 0;
+        j += skip(len);
+        fin = j + len; // extract OID
+        if (len>FOID.max) return 0;
+        FOID.len = len;
+        for (i = 0; j < fin; j++)
+            FOID.val[i++] = c->val[j];
+        len = getalen(ANY, c->val, j); // get text, could be any type
+        if (len < 0) return 0;
+
+        j += skip(len);
+        if (OCT_comp(&FOID, SOID))
+        {
+            // if its the right one return
+            *flen = len;
+            return j;
+        }
+        j += len; // skip over it
+    }
+    *flen = 0; /*****/
+    return 0;
+}
+
+// Find start date of certificate validity period
+int X509_find_start_date(octet *c, int start)
+{
+    int j, len;
+    j = start;
+
+    len = getalen(SEQ, c->val, j);
+    if (len < 0) return 0;
+    j += skip(len);
+
+    len = getalen(UTC, c->val, j);
+    if (len < 0) 
+    {  // could be generalised time 
+        len = getalen(GTM, c->val, j);
+        if (len<0) return 0;
+        j += skip(len);
+        j += 2; // skip century
+    }
+    else j += skip(len);
+    return j;
+}
+
+// Find expiry date of certificate validity period
+int X509_find_expiry_date(octet *c, int start)
+{
+    int j, len;
+    j = start;
+
+    len = getalen(SEQ, c->val, j);
+    if (len < 0) return 0;
+    j += skip(len);
+
+    len = getalen(UTC, c->val, j);
+    if (len < 0) 
+    {
+        len = getalen(GTM,c->val,j);
+        if (len<0) return 0;
+    }
+    j += skip(len) + len;
+
+    len = getalen(UTC, c->val, j);
+    if (len < 0) 
+    {
+        len = getalen(GTM, c->val,j);
+        if (len<0) return 0;
+        j+=skip(len);
+        j+=2; // skip century
+    }
+    else j += skip(len);
+
+    return j;
+}
+
+int X509_find_extensions(octet *c)
+{
+    int j, len;
+    j=X509_find_subject(c,&len);
+    j+=len; // skip subject
+
+    //len = getalen(SEQ, c->val, j);
+    //if (len<0) return 0;
+    //j += skip(len)+len; // skip subject
+
+    len = getalen(SEQ, c->val, j);
+    if (len<0) return 0;
+    j += skip(len)+len; // skip public key
+
+    if (j>=c->len) return 0;
+    return j;
+}
+
+int X509_find_extension(octet *c, octet *SOID, int start, int *flen)
+{
+    int i, j, k, fin, len, tlen, nj;
+    char foid[50];  /*****/
+    octet FOID = {0, sizeof(foid), foid};
+
+    j = start;
+
+    tlen = getalen(EXT, c->val, j);
+    if (tlen < 0) return 0;
+    j += skip(tlen);
+
+    tlen = getalen(SEQ, c->val, j);
+    if (tlen < 0) return 0;
+    j += skip(tlen);
+
+    for (k = j; j < k + tlen;)
+    {
+        // search for Owner OID
+        len = getalen(SEQ, c->val, j);
+        if (len < 0) return 0;
+        j += skip(len);  nj=j+len;
+        len = getalen(OID, c->val, j);
+        if (len < 0) return 0;
+        j += skip(len);
+        fin = j + len; // extract OID
+        if (len>FOID.max) return 0;
+        FOID.len = len;
+        for (i = 0; j < fin; j++)
+            FOID.val[i++] = c->val[j];
+        if (OCT_comp(&FOID, SOID))
+        {
+            // if its the right one return
+            *flen = nj-j;
+            return j;
+        }
+        j = nj; // skip over this extension
+    }
+    *flen = 0; /*****/
+    return 0;
+}
+
+// return 1 if name found, else 0, where name is URL
+// input cert, and pointer to SAN extension
+// Takes wild-card into consideration
+int X509_find_alt_name(octet *c,int start,char *name)
+{
+    int i,j,len,k,m,tlen,cmp,tag;
+
+    if (start==0) return 0;
+    j=start;
+    tlen = getalen(OCT, c->val, j);
+    if (tlen < 0) return 0;
+    j += skip(tlen);
+
+    tlen = getalen(SEQ, c->val, j);
+    if (tlen < 0) return 0;
+    j += skip(tlen);  
+    
+    for (k=j;j<k+tlen;)
+    {
+        tag=c->val[j]; tag&=0xff;
+        len = getalen(ANY, c->val, j);  
+        if (len < 0) return 0;
+        j += skip(len);               // ?? If its not dns, skip over it j+=len
+        if (tag!=DNS)
+        { // only interested in URLs
+            j+=len;
+            continue;
+        }
+        cmp=1; m=0;
+        if (c->val[j]=='*')
+        { // wildcard
+            j++; len--; // skip over *
+            while (name[m]!='.' && name[m]!=0)  // advance to first .
+                m++;
+        }
+        for (i=0;i<len;i++)
+        {
+            if (name[m]==0)
+            { // name has ended before comparison completed
+                cmp=0;
+                j++;
+                continue;
+            }
+            if (c->val[j++]!=name[m++])  // mismatch
+                cmp=0;
+        }
+        if (name[m]!=0) cmp=0; // name should have ended
+        if (cmp) return 1;
+    }
+    return 0;
+}
+
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/x509.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/x509.h
new file mode 100644
index 0000000..bcba4d3
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-ubuntu22-11-04-24/includes/x509.h
@@ -0,0 +1,212 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* CORE x509 header file */
+
+/**
+ * @file x509.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 19th May 2015
+ * @brief X509 function Header File
+ *
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef X509_H
+#define X509_H
+
+// Supported Encryption Methods
+
+#define X509_ECC 1
+#define X509_RSA 2
+#define X509_ECD 3
+#define X509_PQ 4
+
+// Supported Hash functions
+
+#define X509_H256 2
+#define X509_H384 3
+#define X509_H512 4
+#define X509_SHAKE256 5
+
+// Supported Curves
+
+#define USE_NIST256 0    /**< For the NIST 256-bit standard curve - WEIERSTRASS only */
+#define USE_ED25519 1     /**< Bernstein's Modulus 2^255-19 - EDWARDS */
+#define USE_ED448 4     /**< Goldilocks Modulus Ed448 - EDWARDS */
+#define USE_BRAINPOOL 2  /**< For Brainpool 256-bit curve - WEIERSTRASS only */
+#define USE_ANSSI 3      /**< For French 256-bit standard curve - WEIERSTRASS only */
+#define USE_NIST384 10   /**< For the NIST 384-bit standard curve - WEIERSTRASS only */
+#define USE_NIST521 12   /**< For the NIST 521-bit standard curve - WEIERSTRASS only */
+
+using namespace core;
+
+extern octet X509_CN;  // Country Name
+extern octet X509_ON;  // organisation Name
+extern octet X509_EN;  // email
+extern octet X509_LN;  // local name
+extern octet X509_UN;  // Unit name (aka Organisation Unit OU)
+extern octet X509_MN;  // My Name (aka Common Name)
+extern octet X509_SN;  // State Name
+
+extern octet X509_AN;  // Alternate Name
+extern octet X509_KU;  // Key Usage
+extern octet X509_BC;  // Basic Constraints
+
+/**
+ * @brief Public key type
+ */
+typedef struct
+{
+    int type;  /**< signature type (ECC or RSA) */
+    int hash;  /**< hash type */
+    int curve; /**< elliptic curve used or RSA key length in bits  */
+} pktype;
+
+
+/* X.509 functions */
+
+/** @brief Extract private key
+ *
+	@param c an X.509 private key 
+	@param pk the extracted private key - for RSA octet = p|q|dp|dq|c, for ECC octet = k
+	@return private key type details 
+*/
+extern pktype X509_extract_private_key(octet *c,octet *pk);
+
+/** @brief Extract certificate signature
+ *
+	@param c an X.509 certificate
+	@param s the extracted signature
+	@return signature type details
+
+*/
+extern pktype X509_extract_cert_sig(octet *c, octet *s);
+/** @brief
+ *
+	@param sc a signed certificate
+	@param c the extracted certificate
+	@return 0 on failure
+*/
+extern int X509_extract_cert(octet *sc, octet *c);
+
+/** @brief
+ *
+	@param c an X.509 certificate
+	@param ptr pointer to ASN.1 raw public key
+	@return length of raw public key
+*/
+extern int X509_find_public_key(octet *c,int *ptr);
+
+/** @brief
+ *
+	@param c an ASN.1 encoded public key
+	@param key the extracted public key
+	@return indicator of public key type (ECC or RSA)
+*/
+extern pktype X509_get_public_key(octet *c,octet *key);
+
+/** @brief
+ *
+	@param c an X.509 certificate
+	@param k the extracted key
+	@return indicator of public key type (ECC or RSA)
+*/
+extern pktype X509_extract_public_key(octet *c, octet *k);
+/** @brief
+ *
+	@param c an X.509 certificate
+    @param len length of issuer field
+	@return 0 on failure, or pointer to issuer field in cert
+*/
+extern int X509_find_issuer(octet *c,int *len);
+/** @brief
+ *
+	@param c an X.509 certificate
+	@return 0 on failure, or pointer to validity field in cert
+*/
+extern int X509_find_validity(octet *c);
+/** @brief
+ *
+	@param c an X.509 certificate
+    @param len length of subject field
+	@return 0 on failure, or pointer to subject field in cert
+*/
+extern int X509_find_subject(octet *c,int *len);
+
+/** @brief
+ *
+	@param c an X.509 certificate
+	@return true if self-signed, else false
+*/
+extern int X509_self_signed(octet *c);
+
+/** @brief
+ *
+	@param c an X.509 certificate
+	@param S is OID of property we are looking for
+	@param s is a pointer to the section of interest in the cert
+	@param f is pointer to the length of the property
+	@return 0 on failure, or pointer to the property
+*/
+extern int X509_find_entity_property(octet *c, octet *S, int s, int *f);
+/** @brief
+ *
+	@param c an X.509 certificate
+	@param s is a pointer to the start of the validity field
+	@return 0 on failure, or pointer to the start date
+*/
+extern int X509_find_start_date(octet *c, int s);
+/** @brief
+ *
+	@param c an X.509 certificate
+	@param s is a pointer to the start of the validity field
+	@return 0 on failure, or pointer to the expiry date
+*/
+extern int X509_find_expiry_date(octet *c, int s);
+
+
+/** @brief
+ *
+	@param c an X.509 certificate
+	@return 0 on failure (or no extensions), or pointer to extensions field in cert
+*/
+extern int X509_find_extensions(octet *c);
+/** @brief
+ *
+	@param c an X.509 certificate
+	@param S is OID of particular extension we are looking for
+	@param s is a pointer to the section of interest in the cert
+	@param f is pointer to the length of the extension
+	@return 0 on failure, or pointer to the extension
+*/
+extern int X509_find_extension(octet *c, octet *S, int s, int *f);
+
+/** @brief
+ *
+	@param c an X.509 certificate
+    @param s is a pointer to certificate extension SubjectAltNames
+    @param name is a URL
+    @return 0 on failure, 1 if URL is in list of alt names
+*/
+extern int X509_find_alt_name(octet *c,int s,char *name);
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/core.a b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/core.a
new file mode 100644
index 0000000..c31acc4
Binary files /dev/null and b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/core.a differ
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/arch.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/arch.h
new file mode 100644
index 0000000..fc3d755
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/arch.h
@@ -0,0 +1,106 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* Architecture definition header file */
+
+/**
+ * @file arch.h
+ * @author Mike Scott
+ * @date 23rd February 2016
+ * @brief Architecture Header File
+ *
+ * Specify Processor Architecture
+ *
+ */
+
+/* NOTE: There is only one user configurable section in this header - see below */
+
+#ifndef ARCH_H
+#define ARCH_H
+#include <stdint.h>
+
+#define WOULD_USE_VLAS   /* Would like to use variable length arrays? */
+
+#ifdef WOULD_USE_VLAS
+#if __cplusplus >= 201402L
+#define USE_VLAS
+#endif
+#endif
+
+namespace core {
+
+/*** START OF USER CONFIGURABLE SECTION - set architecture ***/
+
+#define CHUNK 32      /**< size of chunk in bits = wordlength of computer = 16, 32 or 64. Note not all curve options are supported on 16-bit processors */
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+/* Create Integer types */
+
+//#define byte uint8_t            /**< 8-bit unsigned integer */
+//#define sign8 int8_t            /**< 8-bit signed integer */
+//#define sign16 int16_t          /**< 16-bit signed integer */
+//#define sign32 int32_t          /**< 32-bit signed integer */
+//#define sign64 int64_t          /**< 64-bit signed integer */
+//#define unsign32 uint32_t       /**< 32-bit unsigned integer */
+//#define unsign64 uint64_t       /**< 64-bit unsigned integer */
+
+using byte = uint8_t;			/**< 8-bit unsigned integer */
+using sign8 = int8_t;			/**< 8-bit signed integer */
+using sign16 = int16_t;			/**< 16-bit signed integer */
+using sign32 = int32_t;			/**< 32-bit signed integer */
+using sign64 = int64_t;			/**< 64-bit signed integer */
+using unsign32 = uint32_t;		/**< 32-bit unsigned integer */
+using unsign64 = uint64_t;		/**< 64-bit unsigned integer */
+
+//#define uchar unsigned char  /**<  Unsigned char */
+using uchar = unsigned char;
+
+/* Don't mess with anything below this line unless you know what you are doing */
+
+#if CHUNK==16
+
+#define chunk int16_t       /**< C type corresponding to word length */
+#define dchunk int32_t      /**< Always define double length chunk type if available */
+
+#endif
+
+#if CHUNK == 32
+
+#define chunk int32_t       /**< C type corresponding to word length */
+#define dchunk int64_t      /**< Always define double length chunk type if available */
+
+#endif
+
+#if CHUNK == 64
+
+#define chunk int64_t       /**< C type corresponding to word length */
+#if defined(__SIZEOF_INT128__) && __SIZEOF_INT128__ == 16
+#define dchunk __int128
+#endif
+
+#endif
+
+#ifdef dchunk
+#define COMBA      /**< Use COMBA method for faster muls, sqrs and reductions */
+#endif
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/big_B160_28.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/big_B160_28.h
new file mode 100644
index 0000000..f001e85
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/big_B160_28.h
@@ -0,0 +1,697 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file big.h
+ * @author Mike Scott
+ * @date 23rd February 2016
+ * @brief Big number Header File
+ *
+ *
+ */
+
+#ifndef BIG_B160_28_H
+#define BIG_B160_28_H
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <inttypes.h>
+#include "arch.h"
+#include "core.h"
+#include "config_big_B160_28.h"
+
+using namespace core;
+
+/* could comment this out if code size is a major issue */
+#define UNWOUND
+/* Normally recommended, but may not be optimal for some architectures, for example 32-bit ARM M4 */
+#define USE_KARATSUBA
+
+#define BIGBITS_B160_28 (8*MODBYTES_B160_28)
+#define NLEN_B160_28 (1+((8*MODBYTES_B160_28-1)/BASEBITS_B160_28))
+#define DNLEN_B160_28 2*NLEN_B160_28
+#define BMASK_B160_28 (((chunk)1<<BASEBITS_B160_28)-1) /**< Mask = 2^BASEBITS-1 */
+#define NEXCESS_B160_28 (1<<(CHUNK-BASEBITS_B160_28-1))           /**< 2^(CHUNK-BASEBITS-1) - digit cannot be multiplied by more than this before normalisation */
+
+#define HBITS_B160_28 (BASEBITS_B160_28/2)      /**< Number of bits in number base divided by 2 */
+#define HMASK_B160_28 (((chunk)1<<HBITS_B160_28)-1)    /**< Mask = 2^HBITS-1 */
+
+//#define DEBUG_NORM
+
+#ifdef DEBUG_NORM  /* Add an extra location to track chunk extension */
+#define MPV_B160_28 NLEN_B160_28
+#define MNV_B160_28 (NLEN_B160_28+1)
+#define DMPV_B160_28 DNLEN_B160_28
+#define DMNV_B160_28 (DNLEN_B160_28+1)
+
+#endif
+
+namespace B160_28 {
+
+//extern int BIGMULS;
+//extern int BIGSQRS;
+
+#ifdef DEBUG_NORM
+typedef chunk BIG[NLEN_B160_28 + 2]; /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B160_28 + 2]; /**< Define type DBIG as array of chunks */
+#else
+typedef chunk BIG[NLEN_B160_28];     /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B160_28];   /**< Define type DBIG as array of chunks */
+#endif
+
+/* BIG number prototypes */
+
+/**	@brief Tests for BIG equal to zero (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_iszilch(BIG x);
+/**	@brief Tests for BIG equal to one (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if one, else returns 0
+ */
+extern int BIG_isunity(BIG x);
+/**	@brief Tests for DBIG equal to zero (Constant Time)
+ *
+	@param x a DBIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_diszilch(DBIG x);
+/**	@brief Outputs a BIG number to the console (Variable Time)
+ *
+	@param x a BIG number
+ */
+extern void BIG_output(BIG x);
+/**	@brief Outputs a BIG number to the console in raw form (Variable Time for debugging)
+ *
+	@param x a BIG number
+ */
+extern void BIG_rawoutput(BIG x);
+/**	@brief Conditional constant time swap of two BIG numbers
+ *
+	Conditionally swaps parameters in constant time (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s swap takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cswap(BIG x, BIG y, int s);
+/**	@brief Conditional copy of BIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cmove(BIG x, BIG y, int s);
+/**	@brief Conditional copy of DBIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a DBIG number
+	@param y another DBIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_dcmove(BIG x, BIG y, int s);
+/**	@brief Convert from BIG number to byte array (Constant Time)
+ *
+	@param a byte array
+	@param x BIG number
+ */
+extern void BIG_toBytes(char *a, BIG x);
+/**	@brief Convert to BIG number from byte array (Constant Time)
+ *
+	@param x BIG number
+	@param a byte array
+ */
+extern void BIG_fromBytes(BIG x, char *a);
+/**	@brief Convert to BIG number from byte array of given length (Variable Time)
+ *
+	@param x BIG number
+	@param a byte array
+	@param s byte array length
+ */
+extern void BIG_fromBytesLen(BIG x, char *a, int s);
+/**@brief Convert to DBIG number from byte array of given length (Variable Time)
+ *
+   @param x DBIG number
+   @param a byte array
+   @param s byte array length
+ */
+extern void BIG_dfromBytesLen(DBIG x, char *a, int s);
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_doutput(DBIG x); 
+
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_drawoutput(DBIG x);
+
+/**	@brief Copy BIG from Read-Only Memory to a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number in ROM
+ */
+extern void BIG_rcopy(BIG x, const BIG y);
+/**	@brief Copy BIG to another BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_copy(BIG x, BIG y);
+/**	@brief Copy DBIG to another DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_dcopy(DBIG x, DBIG y);
+/**	@brief Copy BIG to upper half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dsucopy(DBIG x, BIG y);
+/**	@brief Copy BIG to lower half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dscopy(DBIG x, BIG y);
+/**	@brief Copy lower half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sdcopy(BIG x, DBIG y);
+/**	@brief Copy upper half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sducopy(BIG x, DBIG y);
+/**	@brief Set BIG to zero (Constant Time)
+ *
+	@param x BIG number to be set to zero  
+ */
+extern void BIG_zero(BIG x);
+/**	@brief Set DBIG to zero (Constant Time)
+ *
+	@param x DBIG number to be set to zero
+ */
+extern void BIG_dzero(DBIG x);
+/**	@brief Set BIG to one (unity) (Constant Time)
+ *
+	@param x BIG number to be set to one.
+ */
+extern void BIG_one(BIG x);
+/**	@brief Set BIG to inverse mod 2^256 (Constant Time)
+ *
+	@param x BIG number to be inverted
+ */
+extern void BIG_invmod2m(BIG x);
+/**	@brief Set BIG to sum of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, sum of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_add(BIG x, BIG y, BIG z);
+
+/**	@brief Set BIG to logical or of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, or of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_or(BIG x, BIG y, BIG z);
+
+/**	@brief Increment BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be incremented
+	@param i integer
+ */
+extern void BIG_inc(BIG x, int i);
+/**	@brief Set BIG to difference of two BIGs (Constant Time)
+ *
+	@param x BIG number, difference of other two - output not normalised
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_sub(BIG x, BIG y, BIG z);
+/**	@brief Decrement BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be decremented
+	@param i integer
+ */
+extern void BIG_dec(BIG x, int i);
+/**	@brief Set DBIG to sum of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, sum of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dadd(DBIG x, DBIG y, DBIG z);
+/**	@brief Set DBIG to difference of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, difference of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dsub(DBIG x, DBIG y, DBIG z);
+/**	@brief Multiply BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_imul(BIG x, BIG y, int i);
+/**	@brief Multiply BIG by not-so-small small integer - output normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+	@return Overflowing bits
+ */
+extern chunk BIG_pmul(BIG x, BIG y, int i);
+/**	@brief Divide BIG by 3 - output normalised (Constant Time)
+ *
+	@param x BIG number
+	@return Remainder
+ */
+extern int BIG_div3(BIG x);
+/**	@brief Multiply BIG by even bigger small integer resulting in a DBIG - output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_pxmul(DBIG x, BIG y, int i);
+/**	@brief Multiply BIG by another BIG resulting in DBIG - inputs normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_mul(DBIG x, BIG y, BIG z);
+/**	@brief Multiply BIG by another BIG resulting in another BIG - inputs normalised and output normalised (Constant Time)
+ *
+	Note that the product must fit into a BIG, and x must be distinct from y and z
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_smul(BIG x, BIG y, BIG z);
+/**	@brief Square BIG resulting in a DBIG - input normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, square of a BIG
+	@param y BIG number to be squared
+ */
+extern void BIG_sqr(DBIG x, BIG y);
+
+/**	@brief Montgomery reduction of a DBIG to a BIG  - input normalised and output normalised (Constant Time)
+ *
+	@param a BIG number, reduction of a BIG
+	@param md BIG number, the modulus
+	@param MC the Montgomery Constant
+	@param d DBIG number to be reduced
+ */
+extern void BIG_monty(BIG a, BIG md, chunk MC, DBIG d);
+
+/**	@brief Shifts a BIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shl(BIG x, int s);
+/**	@brief Fast shifts a BIG left by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Overflow bits
+ */
+extern int BIG_fshl(BIG x, int s);
+/**	@brief Shifts a DBIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshl(DBIG x, int s);
+/**	@brief Shifts a BIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shr(BIG x, int s);
+
+
+/**	@brief Fast time-critical combined shift by 1 bit, subtract and normalise (Constant Time)
+ *
+	@param r BIG number normalised output
+	@param a BIG number to be subtracted from
+	@param m BIG number to be shifted and subtracted
+	@return sign of r
+ */
+extern int BIG_ssn(BIG r, BIG a, BIG m);
+
+/**	@brief Fast shifts a BIG right by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Shifted out bits
+ */
+extern int BIG_fshr(BIG x, int s);
+/**	@brief Shifts a DBIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshr(DBIG x, int s);
+/**	@brief Splits a DBIG into two BIGs - input must be normalised, outputs normalised (Constant Time as used)
+ *
+	Internal function. The value of s must be approximately in the middle of the DBIG.
+	Typically used to extract z mod 2^MODBITS and z/2^MODBITS
+	@param x BIG number, top half of z
+	@param y BIG number, bottom half of z
+	@param z DBIG number to be split in two.
+	@param s Bit position at which to split
+	@return carry-out from top half
+ */
+extern chunk BIG_split(BIG x, BIG y, DBIG z, int s);
+/**	@brief Normalizes a BIG number - output normalised (Constant Time)
+ *
+	All digits of the input BIG are reduced mod 2^BASEBITS
+	@param x BIG number to be normalised
+ */
+extern chunk BIG_norm(BIG x);
+/**	@brief Normalizes a DBIG number - output normalised (Constant Time)
+ *
+	All digits of the input DBIG are reduced mod 2^BASEBITS
+	@param x DBIG number to be normalised
+ */
+extern void BIG_dnorm(DBIG x);
+/**	@brief Compares two BIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first BIG number to be compared
+	@param y second BIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_comp(BIG x, BIG y);
+/**	@brief Compares two DBIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first DBIG number to be compared
+	@param y second DBIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_dcomp(DBIG x, DBIG y);
+/**	@brief Calculate number of bits in a BIG - output normalised (Variable Time)
+ *
+	@param x BIG number
+	@return Number of bits in x
+ */
+extern int BIG_nbits(BIG x);
+/**	@brief Calculate number of bits in a DBIG - output normalised (Variable Time)
+ *
+	@param x DBIG number
+	@return Number of bits in x
+ */
+extern int BIG_dnbits(DBIG x);
+
+/**	@brief Reduce x mod n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctmod(BIG x, BIG n, int bd);
+
+/**	@brief  x=y mod n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctdmod(BIG x, DBIG y, BIG n, int bd);
+
+/**	@brief Divide x by n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctsdiv(BIG x,BIG n,int bd);
+
+/**	@brief  x=y/n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctddiv(BIG x, DBIG y, BIG n,int bd);
+
+
+/**	@brief Reduce x mod n - input and output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+ */
+extern void BIG_mod(BIG x, BIG n);
+/**	@brief Divide x by n - output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+ */
+extern void BIG_sdiv(BIG x, BIG n);
+/**	@brief  x=y mod n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_dmod(BIG x, DBIG y, BIG n);
+/**	@brief  x=y/n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_ddiv(BIG x, DBIG y, BIG n);
+/**	@brief  return parity of BIG, that is the least significant bit (Constant Time)
+ *
+	@param x BIG number
+	@return 0 or 1
+ */
+extern int BIG_parity(BIG x);
+/**	@brief  return i-th of BIG (Constant Time)
+ *
+	@param x BIG number
+	@param i the bit of x to be returned
+	@return 0 or 1
+ */
+extern int BIG_bit(BIG x, int i);
+/**	@brief  return least significant bits of a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param n number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int BIG_lastbits(BIG x, int n);
+/**	@brief  Create a random BIG from a random number generator (Constant Time)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_random(BIG x, csprng *r);
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randomnum(BIG x, BIG n, csprng *r);
+
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus and truncated to max bit length (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param t Maximum bit length
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randtrunc(BIG x, BIG n, int t, csprng *r);
+
+/**	brief  return NAF (Non-Adjacent-Form) value as +/- 1, 3 or 5, inputs must be normalised
+ *
+	Given x and 3*x extracts NAF value from given bit position, and returns number of bits processed, and number of trailing zeros detected if any
+	param x BIG number
+	param x3 BIG number, three times x
+	param i bit position
+	param nbs pointer to integer returning number of bits processed
+	param nzs pointer to integer returning number of trailing 0s
+	return + or - 1, 3 or 5
+*/
+
+/**	@brief  Calculate x=y*z mod n (Variable Time)
+ *
+	Slow method for modular multiplication
+	@param x BIG number, on exit = y*z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modmul(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y/z mod n (Variable Time)
+ *
+	Slow method for modular division
+	@param x BIG number, on exit = y/z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_moddiv(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y^2 mod n (Variable Time)
+ *
+	Slow method for modular squaring
+	@param x BIG number, on exit = y^2 mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modsqr(BIG x, BIG y, BIG n);
+/**	@brief  Calculate x=-y mod n (Variable Time)
+ *
+	Modular negation
+	@param x BIG number, on exit = -y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modneg(BIG x, BIG y, BIG n);
+
+/**	@brief  Calculate x=y+z mod n (Variable Time)
+ *
+	Slow method for modular addition
+	@param x BIG number, on exit = y+z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modadd(BIG x, BIG y, BIG z, BIG n);
+
+/**	@brief  Calculate jacobi Symbol (x/y) (Variable Time)
+ *
+	@param x BIG number
+	@param y BIG number
+	@return Jacobi symbol, -1,0 or 1
+ */
+extern int BIG_jacobi(BIG x, BIG y);
+/**	@brief  Calculate x=1/y mod n (Variable Time)
+ *
+	Modular Inversion - This is slow. Uses binary method.
+	@param x BIG number, on exit = 1/y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_invmodp(BIG x, BIG y, BIG n);
+/** @brief Calculate x=x mod 2^m (Variable Time)
+ *
+	Truncation
+	@param x BIG number, on reduced mod 2^m
+	@param m new truncated size
+*/
+extern void BIG_mod2m(BIG x, int m);
+
+/**	@brief Calculates a*b+c+*d
+ *
+	Calculate partial product of a.b, add in carry c, and add total to d (Constant Time)
+	@param a multiplier
+	@param b multiplicand
+	@param c carry
+	@param d pointer to accumulated bottom half of result
+	@return top half of result
+ */
+
+
+extern int step1(BIG,BIG,BIG);
+extern void step2(BIG,BIG,BIG);
+
+#ifdef dchunk
+
+/* Method required to calculate x*y+c+r, bottom half in r, top half returned */
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    dchunk prod = (dchunk)x * y + c + *r;
+    *r = (chunk)prod & BMASK_B160_28;
+    return (chunk)(prod >> BASEBITS_B160_28);
+}
+
+#else
+
+/* No integer type available that can store double the wordlength */
+/* accumulate partial products */
+
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    chunk x0, x1, y0, y1;
+    chunk bot, top, mid, carry;
+    x0 = x & HMASK_B160_28;
+    x1 = (x >> HBITS_B160_28);
+    y0 = y & HMASK_B160_28;
+    y1 = (y >> HBITS_B160_28);
+    bot = x0 * y0;
+    top = x1 * y1;
+    mid = x0 * y1 + x1 * y0;
+    x0 = mid & HMASK_B160_28;
+    x1 = (mid >> HBITS_B160_28);
+    bot += x0 << HBITS_B160_28;
+    bot += *r;
+    bot += c;
+
+    top += x1;
+    carry = bot >> BASEBITS_B160_28;
+    bot &= BMASK_B160_28;
+    top += carry;
+
+    *r = bot;
+    return top;
+}
+
+#endif
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/big_B160_29.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/big_B160_29.h
new file mode 100644
index 0000000..ad5df66
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/big_B160_29.h
@@ -0,0 +1,697 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file big.h
+ * @author Mike Scott
+ * @date 23rd February 2016
+ * @brief Big number Header File
+ *
+ *
+ */
+
+#ifndef BIG_B160_29_H
+#define BIG_B160_29_H
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <inttypes.h>
+#include "arch.h"
+#include "core.h"
+#include "config_big_B160_29.h"
+
+using namespace core;
+
+/* could comment this out if code size is a major issue */
+#define UNWOUND
+/* Normally recommended, but may not be optimal for some architectures, for example 32-bit ARM M4 */
+#define USE_KARATSUBA
+
+#define BIGBITS_B160_29 (8*MODBYTES_B160_29)
+#define NLEN_B160_29 (1+((8*MODBYTES_B160_29-1)/BASEBITS_B160_29))
+#define DNLEN_B160_29 2*NLEN_B160_29
+#define BMASK_B160_29 (((chunk)1<<BASEBITS_B160_29)-1) /**< Mask = 2^BASEBITS-1 */
+#define NEXCESS_B160_29 (1<<(CHUNK-BASEBITS_B160_29-1))           /**< 2^(CHUNK-BASEBITS-1) - digit cannot be multiplied by more than this before normalisation */
+
+#define HBITS_B160_29 (BASEBITS_B160_29/2)      /**< Number of bits in number base divided by 2 */
+#define HMASK_B160_29 (((chunk)1<<HBITS_B160_29)-1)    /**< Mask = 2^HBITS-1 */
+
+//#define DEBUG_NORM
+
+#ifdef DEBUG_NORM  /* Add an extra location to track chunk extension */
+#define MPV_B160_29 NLEN_B160_29
+#define MNV_B160_29 (NLEN_B160_29+1)
+#define DMPV_B160_29 DNLEN_B160_29
+#define DMNV_B160_29 (DNLEN_B160_29+1)
+
+#endif
+
+namespace B160_29 {
+
+//extern int BIGMULS;
+//extern int BIGSQRS;
+
+#ifdef DEBUG_NORM
+typedef chunk BIG[NLEN_B160_29 + 2]; /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B160_29 + 2]; /**< Define type DBIG as array of chunks */
+#else
+typedef chunk BIG[NLEN_B160_29];     /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B160_29];   /**< Define type DBIG as array of chunks */
+#endif
+
+/* BIG number prototypes */
+
+/**	@brief Tests for BIG equal to zero (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_iszilch(BIG x);
+/**	@brief Tests for BIG equal to one (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if one, else returns 0
+ */
+extern int BIG_isunity(BIG x);
+/**	@brief Tests for DBIG equal to zero (Constant Time)
+ *
+	@param x a DBIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_diszilch(DBIG x);
+/**	@brief Outputs a BIG number to the console (Variable Time)
+ *
+	@param x a BIG number
+ */
+extern void BIG_output(BIG x);
+/**	@brief Outputs a BIG number to the console in raw form (Variable Time for debugging)
+ *
+	@param x a BIG number
+ */
+extern void BIG_rawoutput(BIG x);
+/**	@brief Conditional constant time swap of two BIG numbers
+ *
+	Conditionally swaps parameters in constant time (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s swap takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cswap(BIG x, BIG y, int s);
+/**	@brief Conditional copy of BIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cmove(BIG x, BIG y, int s);
+/**	@brief Conditional copy of DBIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a DBIG number
+	@param y another DBIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_dcmove(BIG x, BIG y, int s);
+/**	@brief Convert from BIG number to byte array (Constant Time)
+ *
+	@param a byte array
+	@param x BIG number
+ */
+extern void BIG_toBytes(char *a, BIG x);
+/**	@brief Convert to BIG number from byte array (Constant Time)
+ *
+	@param x BIG number
+	@param a byte array
+ */
+extern void BIG_fromBytes(BIG x, char *a);
+/**	@brief Convert to BIG number from byte array of given length (Variable Time)
+ *
+	@param x BIG number
+	@param a byte array
+	@param s byte array length
+ */
+extern void BIG_fromBytesLen(BIG x, char *a, int s);
+/**@brief Convert to DBIG number from byte array of given length (Variable Time)
+ *
+   @param x DBIG number
+   @param a byte array
+   @param s byte array length
+ */
+extern void BIG_dfromBytesLen(DBIG x, char *a, int s);
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_doutput(DBIG x); 
+
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_drawoutput(DBIG x);
+
+/**	@brief Copy BIG from Read-Only Memory to a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number in ROM
+ */
+extern void BIG_rcopy(BIG x, const BIG y);
+/**	@brief Copy BIG to another BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_copy(BIG x, BIG y);
+/**	@brief Copy DBIG to another DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_dcopy(DBIG x, DBIG y);
+/**	@brief Copy BIG to upper half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dsucopy(DBIG x, BIG y);
+/**	@brief Copy BIG to lower half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dscopy(DBIG x, BIG y);
+/**	@brief Copy lower half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sdcopy(BIG x, DBIG y);
+/**	@brief Copy upper half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sducopy(BIG x, DBIG y);
+/**	@brief Set BIG to zero (Constant Time)
+ *
+	@param x BIG number to be set to zero  
+ */
+extern void BIG_zero(BIG x);
+/**	@brief Set DBIG to zero (Constant Time)
+ *
+	@param x DBIG number to be set to zero
+ */
+extern void BIG_dzero(DBIG x);
+/**	@brief Set BIG to one (unity) (Constant Time)
+ *
+	@param x BIG number to be set to one.
+ */
+extern void BIG_one(BIG x);
+/**	@brief Set BIG to inverse mod 2^256 (Constant Time)
+ *
+	@param x BIG number to be inverted
+ */
+extern void BIG_invmod2m(BIG x);
+/**	@brief Set BIG to sum of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, sum of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_add(BIG x, BIG y, BIG z);
+
+/**	@brief Set BIG to logical or of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, or of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_or(BIG x, BIG y, BIG z);
+
+/**	@brief Increment BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be incremented
+	@param i integer
+ */
+extern void BIG_inc(BIG x, int i);
+/**	@brief Set BIG to difference of two BIGs (Constant Time)
+ *
+	@param x BIG number, difference of other two - output not normalised
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_sub(BIG x, BIG y, BIG z);
+/**	@brief Decrement BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be decremented
+	@param i integer
+ */
+extern void BIG_dec(BIG x, int i);
+/**	@brief Set DBIG to sum of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, sum of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dadd(DBIG x, DBIG y, DBIG z);
+/**	@brief Set DBIG to difference of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, difference of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dsub(DBIG x, DBIG y, DBIG z);
+/**	@brief Multiply BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_imul(BIG x, BIG y, int i);
+/**	@brief Multiply BIG by not-so-small small integer - output normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+	@return Overflowing bits
+ */
+extern chunk BIG_pmul(BIG x, BIG y, int i);
+/**	@brief Divide BIG by 3 - output normalised (Constant Time)
+ *
+	@param x BIG number
+	@return Remainder
+ */
+extern int BIG_div3(BIG x);
+/**	@brief Multiply BIG by even bigger small integer resulting in a DBIG - output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_pxmul(DBIG x, BIG y, int i);
+/**	@brief Multiply BIG by another BIG resulting in DBIG - inputs normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_mul(DBIG x, BIG y, BIG z);
+/**	@brief Multiply BIG by another BIG resulting in another BIG - inputs normalised and output normalised (Constant Time)
+ *
+	Note that the product must fit into a BIG, and x must be distinct from y and z
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_smul(BIG x, BIG y, BIG z);
+/**	@brief Square BIG resulting in a DBIG - input normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, square of a BIG
+	@param y BIG number to be squared
+ */
+extern void BIG_sqr(DBIG x, BIG y);
+
+/**	@brief Montgomery reduction of a DBIG to a BIG  - input normalised and output normalised (Constant Time)
+ *
+	@param a BIG number, reduction of a BIG
+	@param md BIG number, the modulus
+	@param MC the Montgomery Constant
+	@param d DBIG number to be reduced
+ */
+extern void BIG_monty(BIG a, BIG md, chunk MC, DBIG d);
+
+/**	@brief Shifts a BIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shl(BIG x, int s);
+/**	@brief Fast shifts a BIG left by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Overflow bits
+ */
+extern int BIG_fshl(BIG x, int s);
+/**	@brief Shifts a DBIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshl(DBIG x, int s);
+/**	@brief Shifts a BIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shr(BIG x, int s);
+
+
+/**	@brief Fast time-critical combined shift by 1 bit, subtract and normalise (Constant Time)
+ *
+	@param r BIG number normalised output
+	@param a BIG number to be subtracted from
+	@param m BIG number to be shifted and subtracted
+	@return sign of r
+ */
+extern int BIG_ssn(BIG r, BIG a, BIG m);
+
+/**	@brief Fast shifts a BIG right by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Shifted out bits
+ */
+extern int BIG_fshr(BIG x, int s);
+/**	@brief Shifts a DBIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshr(DBIG x, int s);
+/**	@brief Splits a DBIG into two BIGs - input must be normalised, outputs normalised (Constant Time as used)
+ *
+	Internal function. The value of s must be approximately in the middle of the DBIG.
+	Typically used to extract z mod 2^MODBITS and z/2^MODBITS
+	@param x BIG number, top half of z
+	@param y BIG number, bottom half of z
+	@param z DBIG number to be split in two.
+	@param s Bit position at which to split
+	@return carry-out from top half
+ */
+extern chunk BIG_split(BIG x, BIG y, DBIG z, int s);
+/**	@brief Normalizes a BIG number - output normalised (Constant Time)
+ *
+	All digits of the input BIG are reduced mod 2^BASEBITS
+	@param x BIG number to be normalised
+ */
+extern chunk BIG_norm(BIG x);
+/**	@brief Normalizes a DBIG number - output normalised (Constant Time)
+ *
+	All digits of the input DBIG are reduced mod 2^BASEBITS
+	@param x DBIG number to be normalised
+ */
+extern void BIG_dnorm(DBIG x);
+/**	@brief Compares two BIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first BIG number to be compared
+	@param y second BIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_comp(BIG x, BIG y);
+/**	@brief Compares two DBIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first DBIG number to be compared
+	@param y second DBIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_dcomp(DBIG x, DBIG y);
+/**	@brief Calculate number of bits in a BIG - output normalised (Variable Time)
+ *
+	@param x BIG number
+	@return Number of bits in x
+ */
+extern int BIG_nbits(BIG x);
+/**	@brief Calculate number of bits in a DBIG - output normalised (Variable Time)
+ *
+	@param x DBIG number
+	@return Number of bits in x
+ */
+extern int BIG_dnbits(DBIG x);
+
+/**	@brief Reduce x mod n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctmod(BIG x, BIG n, int bd);
+
+/**	@brief  x=y mod n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctdmod(BIG x, DBIG y, BIG n, int bd);
+
+/**	@brief Divide x by n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctsdiv(BIG x,BIG n,int bd);
+
+/**	@brief  x=y/n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctddiv(BIG x, DBIG y, BIG n,int bd);
+
+
+/**	@brief Reduce x mod n - input and output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+ */
+extern void BIG_mod(BIG x, BIG n);
+/**	@brief Divide x by n - output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+ */
+extern void BIG_sdiv(BIG x, BIG n);
+/**	@brief  x=y mod n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_dmod(BIG x, DBIG y, BIG n);
+/**	@brief  x=y/n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_ddiv(BIG x, DBIG y, BIG n);
+/**	@brief  return parity of BIG, that is the least significant bit (Constant Time)
+ *
+	@param x BIG number
+	@return 0 or 1
+ */
+extern int BIG_parity(BIG x);
+/**	@brief  return i-th of BIG (Constant Time)
+ *
+	@param x BIG number
+	@param i the bit of x to be returned
+	@return 0 or 1
+ */
+extern int BIG_bit(BIG x, int i);
+/**	@brief  return least significant bits of a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param n number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int BIG_lastbits(BIG x, int n);
+/**	@brief  Create a random BIG from a random number generator (Constant Time)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_random(BIG x, csprng *r);
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randomnum(BIG x, BIG n, csprng *r);
+
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus and truncated to max bit length (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param t Maximum bit length
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randtrunc(BIG x, BIG n, int t, csprng *r);
+
+/**	brief  return NAF (Non-Adjacent-Form) value as +/- 1, 3 or 5, inputs must be normalised
+ *
+	Given x and 3*x extracts NAF value from given bit position, and returns number of bits processed, and number of trailing zeros detected if any
+	param x BIG number
+	param x3 BIG number, three times x
+	param i bit position
+	param nbs pointer to integer returning number of bits processed
+	param nzs pointer to integer returning number of trailing 0s
+	return + or - 1, 3 or 5
+*/
+
+/**	@brief  Calculate x=y*z mod n (Variable Time)
+ *
+	Slow method for modular multiplication
+	@param x BIG number, on exit = y*z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modmul(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y/z mod n (Variable Time)
+ *
+	Slow method for modular division
+	@param x BIG number, on exit = y/z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_moddiv(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y^2 mod n (Variable Time)
+ *
+	Slow method for modular squaring
+	@param x BIG number, on exit = y^2 mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modsqr(BIG x, BIG y, BIG n);
+/**	@brief  Calculate x=-y mod n (Variable Time)
+ *
+	Modular negation
+	@param x BIG number, on exit = -y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modneg(BIG x, BIG y, BIG n);
+
+/**	@brief  Calculate x=y+z mod n (Variable Time)
+ *
+	Slow method for modular addition
+	@param x BIG number, on exit = y+z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modadd(BIG x, BIG y, BIG z, BIG n);
+
+/**	@brief  Calculate jacobi Symbol (x/y) (Variable Time)
+ *
+	@param x BIG number
+	@param y BIG number
+	@return Jacobi symbol, -1,0 or 1
+ */
+extern int BIG_jacobi(BIG x, BIG y);
+/**	@brief  Calculate x=1/y mod n (Variable Time)
+ *
+	Modular Inversion - This is slow. Uses binary method.
+	@param x BIG number, on exit = 1/y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_invmodp(BIG x, BIG y, BIG n);
+/** @brief Calculate x=x mod 2^m (Variable Time)
+ *
+	Truncation
+	@param x BIG number, on reduced mod 2^m
+	@param m new truncated size
+*/
+extern void BIG_mod2m(BIG x, int m);
+
+/**	@brief Calculates a*b+c+*d
+ *
+	Calculate partial product of a.b, add in carry c, and add total to d (Constant Time)
+	@param a multiplier
+	@param b multiplicand
+	@param c carry
+	@param d pointer to accumulated bottom half of result
+	@return top half of result
+ */
+
+
+extern int step1(BIG,BIG,BIG);
+extern void step2(BIG,BIG,BIG);
+
+#ifdef dchunk
+
+/* Method required to calculate x*y+c+r, bottom half in r, top half returned */
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    dchunk prod = (dchunk)x * y + c + *r;
+    *r = (chunk)prod & BMASK_B160_29;
+    return (chunk)(prod >> BASEBITS_B160_29);
+}
+
+#else
+
+/* No integer type available that can store double the wordlength */
+/* accumulate partial products */
+
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    chunk x0, x1, y0, y1;
+    chunk bot, top, mid, carry;
+    x0 = x & HMASK_B160_29;
+    x1 = (x >> HBITS_B160_29);
+    y0 = y & HMASK_B160_29;
+    y1 = (y >> HBITS_B160_29);
+    bot = x0 * y0;
+    top = x1 * y1;
+    mid = x0 * y1 + x1 * y0;
+    x0 = mid & HMASK_B160_29;
+    x1 = (mid >> HBITS_B160_29);
+    bot += x0 << HBITS_B160_29;
+    bot += *r;
+    bot += c;
+
+    top += x1;
+    carry = bot >> BASEBITS_B160_29;
+    bot &= BMASK_B160_29;
+    top += carry;
+
+    *r = bot;
+    return top;
+}
+
+#endif
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/big_B168_29.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/big_B168_29.h
new file mode 100644
index 0000000..f7dde93
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/big_B168_29.h
@@ -0,0 +1,697 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file big.h
+ * @author Mike Scott
+ * @date 23rd February 2016
+ * @brief Big number Header File
+ *
+ *
+ */
+
+#ifndef BIG_B168_29_H
+#define BIG_B168_29_H
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <inttypes.h>
+#include "arch.h"
+#include "core.h"
+#include "config_big_B168_29.h"
+
+using namespace core;
+
+/* could comment this out if code size is a major issue */
+#define UNWOUND
+/* Normally recommended, but may not be optimal for some architectures, for example 32-bit ARM M4 */
+#define USE_KARATSUBA
+
+#define BIGBITS_B168_29 (8*MODBYTES_B168_29)
+#define NLEN_B168_29 (1+((8*MODBYTES_B168_29-1)/BASEBITS_B168_29))
+#define DNLEN_B168_29 2*NLEN_B168_29
+#define BMASK_B168_29 (((chunk)1<<BASEBITS_B168_29)-1) /**< Mask = 2^BASEBITS-1 */
+#define NEXCESS_B168_29 (1<<(CHUNK-BASEBITS_B168_29-1))           /**< 2^(CHUNK-BASEBITS-1) - digit cannot be multiplied by more than this before normalisation */
+
+#define HBITS_B168_29 (BASEBITS_B168_29/2)      /**< Number of bits in number base divided by 2 */
+#define HMASK_B168_29 (((chunk)1<<HBITS_B168_29)-1)    /**< Mask = 2^HBITS-1 */
+
+//#define DEBUG_NORM
+
+#ifdef DEBUG_NORM  /* Add an extra location to track chunk extension */
+#define MPV_B168_29 NLEN_B168_29
+#define MNV_B168_29 (NLEN_B168_29+1)
+#define DMPV_B168_29 DNLEN_B168_29
+#define DMNV_B168_29 (DNLEN_B168_29+1)
+
+#endif
+
+namespace B168_29 {
+
+//extern int BIGMULS;
+//extern int BIGSQRS;
+
+#ifdef DEBUG_NORM
+typedef chunk BIG[NLEN_B168_29 + 2]; /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B168_29 + 2]; /**< Define type DBIG as array of chunks */
+#else
+typedef chunk BIG[NLEN_B168_29];     /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B168_29];   /**< Define type DBIG as array of chunks */
+#endif
+
+/* BIG number prototypes */
+
+/**	@brief Tests for BIG equal to zero (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_iszilch(BIG x);
+/**	@brief Tests for BIG equal to one (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if one, else returns 0
+ */
+extern int BIG_isunity(BIG x);
+/**	@brief Tests for DBIG equal to zero (Constant Time)
+ *
+	@param x a DBIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_diszilch(DBIG x);
+/**	@brief Outputs a BIG number to the console (Variable Time)
+ *
+	@param x a BIG number
+ */
+extern void BIG_output(BIG x);
+/**	@brief Outputs a BIG number to the console in raw form (Variable Time for debugging)
+ *
+	@param x a BIG number
+ */
+extern void BIG_rawoutput(BIG x);
+/**	@brief Conditional constant time swap of two BIG numbers
+ *
+	Conditionally swaps parameters in constant time (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s swap takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cswap(BIG x, BIG y, int s);
+/**	@brief Conditional copy of BIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cmove(BIG x, BIG y, int s);
+/**	@brief Conditional copy of DBIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a DBIG number
+	@param y another DBIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_dcmove(BIG x, BIG y, int s);
+/**	@brief Convert from BIG number to byte array (Constant Time)
+ *
+	@param a byte array
+	@param x BIG number
+ */
+extern void BIG_toBytes(char *a, BIG x);
+/**	@brief Convert to BIG number from byte array (Constant Time)
+ *
+	@param x BIG number
+	@param a byte array
+ */
+extern void BIG_fromBytes(BIG x, char *a);
+/**	@brief Convert to BIG number from byte array of given length (Variable Time)
+ *
+	@param x BIG number
+	@param a byte array
+	@param s byte array length
+ */
+extern void BIG_fromBytesLen(BIG x, char *a, int s);
+/**@brief Convert to DBIG number from byte array of given length (Variable Time)
+ *
+   @param x DBIG number
+   @param a byte array
+   @param s byte array length
+ */
+extern void BIG_dfromBytesLen(DBIG x, char *a, int s);
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_doutput(DBIG x); 
+
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_drawoutput(DBIG x);
+
+/**	@brief Copy BIG from Read-Only Memory to a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number in ROM
+ */
+extern void BIG_rcopy(BIG x, const BIG y);
+/**	@brief Copy BIG to another BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_copy(BIG x, BIG y);
+/**	@brief Copy DBIG to another DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_dcopy(DBIG x, DBIG y);
+/**	@brief Copy BIG to upper half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dsucopy(DBIG x, BIG y);
+/**	@brief Copy BIG to lower half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dscopy(DBIG x, BIG y);
+/**	@brief Copy lower half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sdcopy(BIG x, DBIG y);
+/**	@brief Copy upper half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sducopy(BIG x, DBIG y);
+/**	@brief Set BIG to zero (Constant Time)
+ *
+	@param x BIG number to be set to zero  
+ */
+extern void BIG_zero(BIG x);
+/**	@brief Set DBIG to zero (Constant Time)
+ *
+	@param x DBIG number to be set to zero
+ */
+extern void BIG_dzero(DBIG x);
+/**	@brief Set BIG to one (unity) (Constant Time)
+ *
+	@param x BIG number to be set to one.
+ */
+extern void BIG_one(BIG x);
+/**	@brief Set BIG to inverse mod 2^256 (Constant Time)
+ *
+	@param x BIG number to be inverted
+ */
+extern void BIG_invmod2m(BIG x);
+/**	@brief Set BIG to sum of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, sum of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_add(BIG x, BIG y, BIG z);
+
+/**	@brief Set BIG to logical or of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, or of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_or(BIG x, BIG y, BIG z);
+
+/**	@brief Increment BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be incremented
+	@param i integer
+ */
+extern void BIG_inc(BIG x, int i);
+/**	@brief Set BIG to difference of two BIGs (Constant Time)
+ *
+	@param x BIG number, difference of other two - output not normalised
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_sub(BIG x, BIG y, BIG z);
+/**	@brief Decrement BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be decremented
+	@param i integer
+ */
+extern void BIG_dec(BIG x, int i);
+/**	@brief Set DBIG to sum of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, sum of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dadd(DBIG x, DBIG y, DBIG z);
+/**	@brief Set DBIG to difference of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, difference of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dsub(DBIG x, DBIG y, DBIG z);
+/**	@brief Multiply BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_imul(BIG x, BIG y, int i);
+/**	@brief Multiply BIG by not-so-small small integer - output normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+	@return Overflowing bits
+ */
+extern chunk BIG_pmul(BIG x, BIG y, int i);
+/**	@brief Divide BIG by 3 - output normalised (Constant Time)
+ *
+	@param x BIG number
+	@return Remainder
+ */
+extern int BIG_div3(BIG x);
+/**	@brief Multiply BIG by even bigger small integer resulting in a DBIG - output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_pxmul(DBIG x, BIG y, int i);
+/**	@brief Multiply BIG by another BIG resulting in DBIG - inputs normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_mul(DBIG x, BIG y, BIG z);
+/**	@brief Multiply BIG by another BIG resulting in another BIG - inputs normalised and output normalised (Constant Time)
+ *
+	Note that the product must fit into a BIG, and x must be distinct from y and z
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_smul(BIG x, BIG y, BIG z);
+/**	@brief Square BIG resulting in a DBIG - input normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, square of a BIG
+	@param y BIG number to be squared
+ */
+extern void BIG_sqr(DBIG x, BIG y);
+
+/**	@brief Montgomery reduction of a DBIG to a BIG  - input normalised and output normalised (Constant Time)
+ *
+	@param a BIG number, reduction of a BIG
+	@param md BIG number, the modulus
+	@param MC the Montgomery Constant
+	@param d DBIG number to be reduced
+ */
+extern void BIG_monty(BIG a, BIG md, chunk MC, DBIG d);
+
+/**	@brief Shifts a BIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shl(BIG x, int s);
+/**	@brief Fast shifts a BIG left by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Overflow bits
+ */
+extern int BIG_fshl(BIG x, int s);
+/**	@brief Shifts a DBIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshl(DBIG x, int s);
+/**	@brief Shifts a BIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shr(BIG x, int s);
+
+
+/**	@brief Fast time-critical combined shift by 1 bit, subtract and normalise (Constant Time)
+ *
+	@param r BIG number normalised output
+	@param a BIG number to be subtracted from
+	@param m BIG number to be shifted and subtracted
+	@return sign of r
+ */
+extern int BIG_ssn(BIG r, BIG a, BIG m);
+
+/**	@brief Fast shifts a BIG right by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Shifted out bits
+ */
+extern int BIG_fshr(BIG x, int s);
+/**	@brief Shifts a DBIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshr(DBIG x, int s);
+/**	@brief Splits a DBIG into two BIGs - input must be normalised, outputs normalised (Constant Time as used)
+ *
+	Internal function. The value of s must be approximately in the middle of the DBIG.
+	Typically used to extract z mod 2^MODBITS and z/2^MODBITS
+	@param x BIG number, top half of z
+	@param y BIG number, bottom half of z
+	@param z DBIG number to be split in two.
+	@param s Bit position at which to split
+	@return carry-out from top half
+ */
+extern chunk BIG_split(BIG x, BIG y, DBIG z, int s);
+/**	@brief Normalizes a BIG number - output normalised (Constant Time)
+ *
+	All digits of the input BIG are reduced mod 2^BASEBITS
+	@param x BIG number to be normalised
+ */
+extern chunk BIG_norm(BIG x);
+/**	@brief Normalizes a DBIG number - output normalised (Constant Time)
+ *
+	All digits of the input DBIG are reduced mod 2^BASEBITS
+	@param x DBIG number to be normalised
+ */
+extern void BIG_dnorm(DBIG x);
+/**	@brief Compares two BIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first BIG number to be compared
+	@param y second BIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_comp(BIG x, BIG y);
+/**	@brief Compares two DBIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first DBIG number to be compared
+	@param y second DBIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_dcomp(DBIG x, DBIG y);
+/**	@brief Calculate number of bits in a BIG - output normalised (Variable Time)
+ *
+	@param x BIG number
+	@return Number of bits in x
+ */
+extern int BIG_nbits(BIG x);
+/**	@brief Calculate number of bits in a DBIG - output normalised (Variable Time)
+ *
+	@param x DBIG number
+	@return Number of bits in x
+ */
+extern int BIG_dnbits(DBIG x);
+
+/**	@brief Reduce x mod n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctmod(BIG x, BIG n, int bd);
+
+/**	@brief  x=y mod n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctdmod(BIG x, DBIG y, BIG n, int bd);
+
+/**	@brief Divide x by n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctsdiv(BIG x,BIG n,int bd);
+
+/**	@brief  x=y/n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctddiv(BIG x, DBIG y, BIG n,int bd);
+
+
+/**	@brief Reduce x mod n - input and output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+ */
+extern void BIG_mod(BIG x, BIG n);
+/**	@brief Divide x by n - output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+ */
+extern void BIG_sdiv(BIG x, BIG n);
+/**	@brief  x=y mod n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_dmod(BIG x, DBIG y, BIG n);
+/**	@brief  x=y/n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_ddiv(BIG x, DBIG y, BIG n);
+/**	@brief  return parity of BIG, that is the least significant bit (Constant Time)
+ *
+	@param x BIG number
+	@return 0 or 1
+ */
+extern int BIG_parity(BIG x);
+/**	@brief  return i-th of BIG (Constant Time)
+ *
+	@param x BIG number
+	@param i the bit of x to be returned
+	@return 0 or 1
+ */
+extern int BIG_bit(BIG x, int i);
+/**	@brief  return least significant bits of a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param n number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int BIG_lastbits(BIG x, int n);
+/**	@brief  Create a random BIG from a random number generator (Constant Time)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_random(BIG x, csprng *r);
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randomnum(BIG x, BIG n, csprng *r);
+
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus and truncated to max bit length (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param t Maximum bit length
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randtrunc(BIG x, BIG n, int t, csprng *r);
+
+/**	brief  return NAF (Non-Adjacent-Form) value as +/- 1, 3 or 5, inputs must be normalised
+ *
+	Given x and 3*x extracts NAF value from given bit position, and returns number of bits processed, and number of trailing zeros detected if any
+	param x BIG number
+	param x3 BIG number, three times x
+	param i bit position
+	param nbs pointer to integer returning number of bits processed
+	param nzs pointer to integer returning number of trailing 0s
+	return + or - 1, 3 or 5
+*/
+
+/**	@brief  Calculate x=y*z mod n (Variable Time)
+ *
+	Slow method for modular multiplication
+	@param x BIG number, on exit = y*z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modmul(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y/z mod n (Variable Time)
+ *
+	Slow method for modular division
+	@param x BIG number, on exit = y/z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_moddiv(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y^2 mod n (Variable Time)
+ *
+	Slow method for modular squaring
+	@param x BIG number, on exit = y^2 mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modsqr(BIG x, BIG y, BIG n);
+/**	@brief  Calculate x=-y mod n (Variable Time)
+ *
+	Modular negation
+	@param x BIG number, on exit = -y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modneg(BIG x, BIG y, BIG n);
+
+/**	@brief  Calculate x=y+z mod n (Variable Time)
+ *
+	Slow method for modular addition
+	@param x BIG number, on exit = y+z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modadd(BIG x, BIG y, BIG z, BIG n);
+
+/**	@brief  Calculate jacobi Symbol (x/y) (Variable Time)
+ *
+	@param x BIG number
+	@param y BIG number
+	@return Jacobi symbol, -1,0 or 1
+ */
+extern int BIG_jacobi(BIG x, BIG y);
+/**	@brief  Calculate x=1/y mod n (Variable Time)
+ *
+	Modular Inversion - This is slow. Uses binary method.
+	@param x BIG number, on exit = 1/y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_invmodp(BIG x, BIG y, BIG n);
+/** @brief Calculate x=x mod 2^m (Variable Time)
+ *
+	Truncation
+	@param x BIG number, on reduced mod 2^m
+	@param m new truncated size
+*/
+extern void BIG_mod2m(BIG x, int m);
+
+/**	@brief Calculates a*b+c+*d
+ *
+	Calculate partial product of a.b, add in carry c, and add total to d (Constant Time)
+	@param a multiplier
+	@param b multiplicand
+	@param c carry
+	@param d pointer to accumulated bottom half of result
+	@return top half of result
+ */
+
+
+extern int step1(BIG,BIG,BIG);
+extern void step2(BIG,BIG,BIG);
+
+#ifdef dchunk
+
+/* Method required to calculate x*y+c+r, bottom half in r, top half returned */
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    dchunk prod = (dchunk)x * y + c + *r;
+    *r = (chunk)prod & BMASK_B168_29;
+    return (chunk)(prod >> BASEBITS_B168_29);
+}
+
+#else
+
+/* No integer type available that can store double the wordlength */
+/* accumulate partial products */
+
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    chunk x0, x1, y0, y1;
+    chunk bot, top, mid, carry;
+    x0 = x & HMASK_B168_29;
+    x1 = (x >> HBITS_B168_29);
+    y0 = y & HMASK_B168_29;
+    y1 = (y >> HBITS_B168_29);
+    bot = x0 * y0;
+    top = x1 * y1;
+    mid = x0 * y1 + x1 * y0;
+    x0 = mid & HMASK_B168_29;
+    x1 = (mid >> HBITS_B168_29);
+    bot += x0 << HBITS_B168_29;
+    bot += *r;
+    bot += c;
+
+    top += x1;
+    carry = bot >> BASEBITS_B168_29;
+    bot &= BMASK_B168_29;
+    top += carry;
+
+    *r = bot;
+    return top;
+}
+
+#endif
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/big_B256_28.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/big_B256_28.h
new file mode 100644
index 0000000..974d522
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/big_B256_28.h
@@ -0,0 +1,697 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file big.h
+ * @author Mike Scott
+ * @date 23rd February 2016
+ * @brief Big number Header File
+ *
+ *
+ */
+
+#ifndef BIG_B256_28_H
+#define BIG_B256_28_H
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <inttypes.h>
+#include "arch.h"
+#include "core.h"
+#include "config_big_B256_28.h"
+
+using namespace core;
+
+/* could comment this out if code size is a major issue */
+#define UNWOUND
+/* Normally recommended, but may not be optimal for some architectures, for example 32-bit ARM M4 */
+#define USE_KARATSUBA
+
+#define BIGBITS_B256_28 (8*MODBYTES_B256_28)
+#define NLEN_B256_28 (1+((8*MODBYTES_B256_28-1)/BASEBITS_B256_28))
+#define DNLEN_B256_28 2*NLEN_B256_28
+#define BMASK_B256_28 (((chunk)1<<BASEBITS_B256_28)-1) /**< Mask = 2^BASEBITS-1 */
+#define NEXCESS_B256_28 (1<<(CHUNK-BASEBITS_B256_28-1))           /**< 2^(CHUNK-BASEBITS-1) - digit cannot be multiplied by more than this before normalisation */
+
+#define HBITS_B256_28 (BASEBITS_B256_28/2)      /**< Number of bits in number base divided by 2 */
+#define HMASK_B256_28 (((chunk)1<<HBITS_B256_28)-1)    /**< Mask = 2^HBITS-1 */
+
+//#define DEBUG_NORM
+
+#ifdef DEBUG_NORM  /* Add an extra location to track chunk extension */
+#define MPV_B256_28 NLEN_B256_28
+#define MNV_B256_28 (NLEN_B256_28+1)
+#define DMPV_B256_28 DNLEN_B256_28
+#define DMNV_B256_28 (DNLEN_B256_28+1)
+
+#endif
+
+namespace B256_28 {
+
+//extern int BIGMULS;
+//extern int BIGSQRS;
+
+#ifdef DEBUG_NORM
+typedef chunk BIG[NLEN_B256_28 + 2]; /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B256_28 + 2]; /**< Define type DBIG as array of chunks */
+#else
+typedef chunk BIG[NLEN_B256_28];     /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B256_28];   /**< Define type DBIG as array of chunks */
+#endif
+
+/* BIG number prototypes */
+
+/**	@brief Tests for BIG equal to zero (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_iszilch(BIG x);
+/**	@brief Tests for BIG equal to one (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if one, else returns 0
+ */
+extern int BIG_isunity(BIG x);
+/**	@brief Tests for DBIG equal to zero (Constant Time)
+ *
+	@param x a DBIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_diszilch(DBIG x);
+/**	@brief Outputs a BIG number to the console (Variable Time)
+ *
+	@param x a BIG number
+ */
+extern void BIG_output(BIG x);
+/**	@brief Outputs a BIG number to the console in raw form (Variable Time for debugging)
+ *
+	@param x a BIG number
+ */
+extern void BIG_rawoutput(BIG x);
+/**	@brief Conditional constant time swap of two BIG numbers
+ *
+	Conditionally swaps parameters in constant time (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s swap takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cswap(BIG x, BIG y, int s);
+/**	@brief Conditional copy of BIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cmove(BIG x, BIG y, int s);
+/**	@brief Conditional copy of DBIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a DBIG number
+	@param y another DBIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_dcmove(BIG x, BIG y, int s);
+/**	@brief Convert from BIG number to byte array (Constant Time)
+ *
+	@param a byte array
+	@param x BIG number
+ */
+extern void BIG_toBytes(char *a, BIG x);
+/**	@brief Convert to BIG number from byte array (Constant Time)
+ *
+	@param x BIG number
+	@param a byte array
+ */
+extern void BIG_fromBytes(BIG x, char *a);
+/**	@brief Convert to BIG number from byte array of given length (Variable Time)
+ *
+	@param x BIG number
+	@param a byte array
+	@param s byte array length
+ */
+extern void BIG_fromBytesLen(BIG x, char *a, int s);
+/**@brief Convert to DBIG number from byte array of given length (Variable Time)
+ *
+   @param x DBIG number
+   @param a byte array
+   @param s byte array length
+ */
+extern void BIG_dfromBytesLen(DBIG x, char *a, int s);
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_doutput(DBIG x); 
+
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_drawoutput(DBIG x);
+
+/**	@brief Copy BIG from Read-Only Memory to a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number in ROM
+ */
+extern void BIG_rcopy(BIG x, const BIG y);
+/**	@brief Copy BIG to another BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_copy(BIG x, BIG y);
+/**	@brief Copy DBIG to another DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_dcopy(DBIG x, DBIG y);
+/**	@brief Copy BIG to upper half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dsucopy(DBIG x, BIG y);
+/**	@brief Copy BIG to lower half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dscopy(DBIG x, BIG y);
+/**	@brief Copy lower half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sdcopy(BIG x, DBIG y);
+/**	@brief Copy upper half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sducopy(BIG x, DBIG y);
+/**	@brief Set BIG to zero (Constant Time)
+ *
+	@param x BIG number to be set to zero  
+ */
+extern void BIG_zero(BIG x);
+/**	@brief Set DBIG to zero (Constant Time)
+ *
+	@param x DBIG number to be set to zero
+ */
+extern void BIG_dzero(DBIG x);
+/**	@brief Set BIG to one (unity) (Constant Time)
+ *
+	@param x BIG number to be set to one.
+ */
+extern void BIG_one(BIG x);
+/**	@brief Set BIG to inverse mod 2^256 (Constant Time)
+ *
+	@param x BIG number to be inverted
+ */
+extern void BIG_invmod2m(BIG x);
+/**	@brief Set BIG to sum of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, sum of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_add(BIG x, BIG y, BIG z);
+
+/**	@brief Set BIG to logical or of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, or of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_or(BIG x, BIG y, BIG z);
+
+/**	@brief Increment BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be incremented
+	@param i integer
+ */
+extern void BIG_inc(BIG x, int i);
+/**	@brief Set BIG to difference of two BIGs (Constant Time)
+ *
+	@param x BIG number, difference of other two - output not normalised
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_sub(BIG x, BIG y, BIG z);
+/**	@brief Decrement BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be decremented
+	@param i integer
+ */
+extern void BIG_dec(BIG x, int i);
+/**	@brief Set DBIG to sum of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, sum of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dadd(DBIG x, DBIG y, DBIG z);
+/**	@brief Set DBIG to difference of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, difference of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dsub(DBIG x, DBIG y, DBIG z);
+/**	@brief Multiply BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_imul(BIG x, BIG y, int i);
+/**	@brief Multiply BIG by not-so-small small integer - output normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+	@return Overflowing bits
+ */
+extern chunk BIG_pmul(BIG x, BIG y, int i);
+/**	@brief Divide BIG by 3 - output normalised (Constant Time)
+ *
+	@param x BIG number
+	@return Remainder
+ */
+extern int BIG_div3(BIG x);
+/**	@brief Multiply BIG by even bigger small integer resulting in a DBIG - output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_pxmul(DBIG x, BIG y, int i);
+/**	@brief Multiply BIG by another BIG resulting in DBIG - inputs normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_mul(DBIG x, BIG y, BIG z);
+/**	@brief Multiply BIG by another BIG resulting in another BIG - inputs normalised and output normalised (Constant Time)
+ *
+	Note that the product must fit into a BIG, and x must be distinct from y and z
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_smul(BIG x, BIG y, BIG z);
+/**	@brief Square BIG resulting in a DBIG - input normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, square of a BIG
+	@param y BIG number to be squared
+ */
+extern void BIG_sqr(DBIG x, BIG y);
+
+/**	@brief Montgomery reduction of a DBIG to a BIG  - input normalised and output normalised (Constant Time)
+ *
+	@param a BIG number, reduction of a BIG
+	@param md BIG number, the modulus
+	@param MC the Montgomery Constant
+	@param d DBIG number to be reduced
+ */
+extern void BIG_monty(BIG a, BIG md, chunk MC, DBIG d);
+
+/**	@brief Shifts a BIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shl(BIG x, int s);
+/**	@brief Fast shifts a BIG left by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Overflow bits
+ */
+extern int BIG_fshl(BIG x, int s);
+/**	@brief Shifts a DBIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshl(DBIG x, int s);
+/**	@brief Shifts a BIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shr(BIG x, int s);
+
+
+/**	@brief Fast time-critical combined shift by 1 bit, subtract and normalise (Constant Time)
+ *
+	@param r BIG number normalised output
+	@param a BIG number to be subtracted from
+	@param m BIG number to be shifted and subtracted
+	@return sign of r
+ */
+extern int BIG_ssn(BIG r, BIG a, BIG m);
+
+/**	@brief Fast shifts a BIG right by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Shifted out bits
+ */
+extern int BIG_fshr(BIG x, int s);
+/**	@brief Shifts a DBIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshr(DBIG x, int s);
+/**	@brief Splits a DBIG into two BIGs - input must be normalised, outputs normalised (Constant Time as used)
+ *
+	Internal function. The value of s must be approximately in the middle of the DBIG.
+	Typically used to extract z mod 2^MODBITS and z/2^MODBITS
+	@param x BIG number, top half of z
+	@param y BIG number, bottom half of z
+	@param z DBIG number to be split in two.
+	@param s Bit position at which to split
+	@return carry-out from top half
+ */
+extern chunk BIG_split(BIG x, BIG y, DBIG z, int s);
+/**	@brief Normalizes a BIG number - output normalised (Constant Time)
+ *
+	All digits of the input BIG are reduced mod 2^BASEBITS
+	@param x BIG number to be normalised
+ */
+extern chunk BIG_norm(BIG x);
+/**	@brief Normalizes a DBIG number - output normalised (Constant Time)
+ *
+	All digits of the input DBIG are reduced mod 2^BASEBITS
+	@param x DBIG number to be normalised
+ */
+extern void BIG_dnorm(DBIG x);
+/**	@brief Compares two BIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first BIG number to be compared
+	@param y second BIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_comp(BIG x, BIG y);
+/**	@brief Compares two DBIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first DBIG number to be compared
+	@param y second DBIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_dcomp(DBIG x, DBIG y);
+/**	@brief Calculate number of bits in a BIG - output normalised (Variable Time)
+ *
+	@param x BIG number
+	@return Number of bits in x
+ */
+extern int BIG_nbits(BIG x);
+/**	@brief Calculate number of bits in a DBIG - output normalised (Variable Time)
+ *
+	@param x DBIG number
+	@return Number of bits in x
+ */
+extern int BIG_dnbits(DBIG x);
+
+/**	@brief Reduce x mod n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctmod(BIG x, BIG n, int bd);
+
+/**	@brief  x=y mod n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctdmod(BIG x, DBIG y, BIG n, int bd);
+
+/**	@brief Divide x by n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctsdiv(BIG x,BIG n,int bd);
+
+/**	@brief  x=y/n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctddiv(BIG x, DBIG y, BIG n,int bd);
+
+
+/**	@brief Reduce x mod n - input and output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+ */
+extern void BIG_mod(BIG x, BIG n);
+/**	@brief Divide x by n - output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+ */
+extern void BIG_sdiv(BIG x, BIG n);
+/**	@brief  x=y mod n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_dmod(BIG x, DBIG y, BIG n);
+/**	@brief  x=y/n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_ddiv(BIG x, DBIG y, BIG n);
+/**	@brief  return parity of BIG, that is the least significant bit (Constant Time)
+ *
+	@param x BIG number
+	@return 0 or 1
+ */
+extern int BIG_parity(BIG x);
+/**	@brief  return i-th of BIG (Constant Time)
+ *
+	@param x BIG number
+	@param i the bit of x to be returned
+	@return 0 or 1
+ */
+extern int BIG_bit(BIG x, int i);
+/**	@brief  return least significant bits of a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param n number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int BIG_lastbits(BIG x, int n);
+/**	@brief  Create a random BIG from a random number generator (Constant Time)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_random(BIG x, csprng *r);
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randomnum(BIG x, BIG n, csprng *r);
+
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus and truncated to max bit length (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param t Maximum bit length
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randtrunc(BIG x, BIG n, int t, csprng *r);
+
+/**	brief  return NAF (Non-Adjacent-Form) value as +/- 1, 3 or 5, inputs must be normalised
+ *
+	Given x and 3*x extracts NAF value from given bit position, and returns number of bits processed, and number of trailing zeros detected if any
+	param x BIG number
+	param x3 BIG number, three times x
+	param i bit position
+	param nbs pointer to integer returning number of bits processed
+	param nzs pointer to integer returning number of trailing 0s
+	return + or - 1, 3 or 5
+*/
+
+/**	@brief  Calculate x=y*z mod n (Variable Time)
+ *
+	Slow method for modular multiplication
+	@param x BIG number, on exit = y*z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modmul(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y/z mod n (Variable Time)
+ *
+	Slow method for modular division
+	@param x BIG number, on exit = y/z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_moddiv(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y^2 mod n (Variable Time)
+ *
+	Slow method for modular squaring
+	@param x BIG number, on exit = y^2 mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modsqr(BIG x, BIG y, BIG n);
+/**	@brief  Calculate x=-y mod n (Variable Time)
+ *
+	Modular negation
+	@param x BIG number, on exit = -y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modneg(BIG x, BIG y, BIG n);
+
+/**	@brief  Calculate x=y+z mod n (Variable Time)
+ *
+	Slow method for modular addition
+	@param x BIG number, on exit = y+z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modadd(BIG x, BIG y, BIG z, BIG n);
+
+/**	@brief  Calculate jacobi Symbol (x/y) (Variable Time)
+ *
+	@param x BIG number
+	@param y BIG number
+	@return Jacobi symbol, -1,0 or 1
+ */
+extern int BIG_jacobi(BIG x, BIG y);
+/**	@brief  Calculate x=1/y mod n (Variable Time)
+ *
+	Modular Inversion - This is slow. Uses binary method.
+	@param x BIG number, on exit = 1/y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_invmodp(BIG x, BIG y, BIG n);
+/** @brief Calculate x=x mod 2^m (Variable Time)
+ *
+	Truncation
+	@param x BIG number, on reduced mod 2^m
+	@param m new truncated size
+*/
+extern void BIG_mod2m(BIG x, int m);
+
+/**	@brief Calculates a*b+c+*d
+ *
+	Calculate partial product of a.b, add in carry c, and add total to d (Constant Time)
+	@param a multiplier
+	@param b multiplicand
+	@param c carry
+	@param d pointer to accumulated bottom half of result
+	@return top half of result
+ */
+
+
+extern int step1(BIG,BIG,BIG);
+extern void step2(BIG,BIG,BIG);
+
+#ifdef dchunk
+
+/* Method required to calculate x*y+c+r, bottom half in r, top half returned */
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    dchunk prod = (dchunk)x * y + c + *r;
+    *r = (chunk)prod & BMASK_B256_28;
+    return (chunk)(prod >> BASEBITS_B256_28);
+}
+
+#else
+
+/* No integer type available that can store double the wordlength */
+/* accumulate partial products */
+
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    chunk x0, x1, y0, y1;
+    chunk bot, top, mid, carry;
+    x0 = x & HMASK_B256_28;
+    x1 = (x >> HBITS_B256_28);
+    y0 = y & HMASK_B256_28;
+    y1 = (y >> HBITS_B256_28);
+    bot = x0 * y0;
+    top = x1 * y1;
+    mid = x0 * y1 + x1 * y0;
+    x0 = mid & HMASK_B256_28;
+    x1 = (mid >> HBITS_B256_28);
+    bot += x0 << HBITS_B256_28;
+    bot += *r;
+    bot += c;
+
+    top += x1;
+    carry = bot >> BASEBITS_B256_28;
+    bot &= BMASK_B256_28;
+    top += carry;
+
+    *r = bot;
+    return top;
+}
+
+#endif
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/big_B256_29.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/big_B256_29.h
new file mode 100644
index 0000000..221687d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/big_B256_29.h
@@ -0,0 +1,697 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file big.h
+ * @author Mike Scott
+ * @date 23rd February 2016
+ * @brief Big number Header File
+ *
+ *
+ */
+
+#ifndef BIG_B256_29_H
+#define BIG_B256_29_H
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <inttypes.h>
+#include "arch.h"
+#include "core.h"
+#include "config_big_B256_29.h"
+
+using namespace core;
+
+/* could comment this out if code size is a major issue */
+#define UNWOUND
+/* Normally recommended, but may not be optimal for some architectures, for example 32-bit ARM M4 */
+#define USE_KARATSUBA
+
+#define BIGBITS_B256_29 (8*MODBYTES_B256_29)
+#define NLEN_B256_29 (1+((8*MODBYTES_B256_29-1)/BASEBITS_B256_29))
+#define DNLEN_B256_29 2*NLEN_B256_29
+#define BMASK_B256_29 (((chunk)1<<BASEBITS_B256_29)-1) /**< Mask = 2^BASEBITS-1 */
+#define NEXCESS_B256_29 (1<<(CHUNK-BASEBITS_B256_29-1))           /**< 2^(CHUNK-BASEBITS-1) - digit cannot be multiplied by more than this before normalisation */
+
+#define HBITS_B256_29 (BASEBITS_B256_29/2)      /**< Number of bits in number base divided by 2 */
+#define HMASK_B256_29 (((chunk)1<<HBITS_B256_29)-1)    /**< Mask = 2^HBITS-1 */
+
+//#define DEBUG_NORM
+
+#ifdef DEBUG_NORM  /* Add an extra location to track chunk extension */
+#define MPV_B256_29 NLEN_B256_29
+#define MNV_B256_29 (NLEN_B256_29+1)
+#define DMPV_B256_29 DNLEN_B256_29
+#define DMNV_B256_29 (DNLEN_B256_29+1)
+
+#endif
+
+namespace B256_29 {
+
+//extern int BIGMULS;
+//extern int BIGSQRS;
+
+#ifdef DEBUG_NORM
+typedef chunk BIG[NLEN_B256_29 + 2]; /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B256_29 + 2]; /**< Define type DBIG as array of chunks */
+#else
+typedef chunk BIG[NLEN_B256_29];     /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B256_29];   /**< Define type DBIG as array of chunks */
+#endif
+
+/* BIG number prototypes */
+
+/**	@brief Tests for BIG equal to zero (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_iszilch(BIG x);
+/**	@brief Tests for BIG equal to one (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if one, else returns 0
+ */
+extern int BIG_isunity(BIG x);
+/**	@brief Tests for DBIG equal to zero (Constant Time)
+ *
+	@param x a DBIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_diszilch(DBIG x);
+/**	@brief Outputs a BIG number to the console (Variable Time)
+ *
+	@param x a BIG number
+ */
+extern void BIG_output(BIG x);
+/**	@brief Outputs a BIG number to the console in raw form (Variable Time for debugging)
+ *
+	@param x a BIG number
+ */
+extern void BIG_rawoutput(BIG x);
+/**	@brief Conditional constant time swap of two BIG numbers
+ *
+	Conditionally swaps parameters in constant time (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s swap takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cswap(BIG x, BIG y, int s);
+/**	@brief Conditional copy of BIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cmove(BIG x, BIG y, int s);
+/**	@brief Conditional copy of DBIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a DBIG number
+	@param y another DBIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_dcmove(BIG x, BIG y, int s);
+/**	@brief Convert from BIG number to byte array (Constant Time)
+ *
+	@param a byte array
+	@param x BIG number
+ */
+extern void BIG_toBytes(char *a, BIG x);
+/**	@brief Convert to BIG number from byte array (Constant Time)
+ *
+	@param x BIG number
+	@param a byte array
+ */
+extern void BIG_fromBytes(BIG x, char *a);
+/**	@brief Convert to BIG number from byte array of given length (Variable Time)
+ *
+	@param x BIG number
+	@param a byte array
+	@param s byte array length
+ */
+extern void BIG_fromBytesLen(BIG x, char *a, int s);
+/**@brief Convert to DBIG number from byte array of given length (Variable Time)
+ *
+   @param x DBIG number
+   @param a byte array
+   @param s byte array length
+ */
+extern void BIG_dfromBytesLen(DBIG x, char *a, int s);
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_doutput(DBIG x); 
+
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_drawoutput(DBIG x);
+
+/**	@brief Copy BIG from Read-Only Memory to a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number in ROM
+ */
+extern void BIG_rcopy(BIG x, const BIG y);
+/**	@brief Copy BIG to another BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_copy(BIG x, BIG y);
+/**	@brief Copy DBIG to another DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_dcopy(DBIG x, DBIG y);
+/**	@brief Copy BIG to upper half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dsucopy(DBIG x, BIG y);
+/**	@brief Copy BIG to lower half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dscopy(DBIG x, BIG y);
+/**	@brief Copy lower half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sdcopy(BIG x, DBIG y);
+/**	@brief Copy upper half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sducopy(BIG x, DBIG y);
+/**	@brief Set BIG to zero (Constant Time)
+ *
+	@param x BIG number to be set to zero  
+ */
+extern void BIG_zero(BIG x);
+/**	@brief Set DBIG to zero (Constant Time)
+ *
+	@param x DBIG number to be set to zero
+ */
+extern void BIG_dzero(DBIG x);
+/**	@brief Set BIG to one (unity) (Constant Time)
+ *
+	@param x BIG number to be set to one.
+ */
+extern void BIG_one(BIG x);
+/**	@brief Set BIG to inverse mod 2^256 (Constant Time)
+ *
+	@param x BIG number to be inverted
+ */
+extern void BIG_invmod2m(BIG x);
+/**	@brief Set BIG to sum of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, sum of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_add(BIG x, BIG y, BIG z);
+
+/**	@brief Set BIG to logical or of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, or of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_or(BIG x, BIG y, BIG z);
+
+/**	@brief Increment BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be incremented
+	@param i integer
+ */
+extern void BIG_inc(BIG x, int i);
+/**	@brief Set BIG to difference of two BIGs (Constant Time)
+ *
+	@param x BIG number, difference of other two - output not normalised
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_sub(BIG x, BIG y, BIG z);
+/**	@brief Decrement BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be decremented
+	@param i integer
+ */
+extern void BIG_dec(BIG x, int i);
+/**	@brief Set DBIG to sum of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, sum of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dadd(DBIG x, DBIG y, DBIG z);
+/**	@brief Set DBIG to difference of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, difference of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dsub(DBIG x, DBIG y, DBIG z);
+/**	@brief Multiply BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_imul(BIG x, BIG y, int i);
+/**	@brief Multiply BIG by not-so-small small integer - output normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+	@return Overflowing bits
+ */
+extern chunk BIG_pmul(BIG x, BIG y, int i);
+/**	@brief Divide BIG by 3 - output normalised (Constant Time)
+ *
+	@param x BIG number
+	@return Remainder
+ */
+extern int BIG_div3(BIG x);
+/**	@brief Multiply BIG by even bigger small integer resulting in a DBIG - output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_pxmul(DBIG x, BIG y, int i);
+/**	@brief Multiply BIG by another BIG resulting in DBIG - inputs normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_mul(DBIG x, BIG y, BIG z);
+/**	@brief Multiply BIG by another BIG resulting in another BIG - inputs normalised and output normalised (Constant Time)
+ *
+	Note that the product must fit into a BIG, and x must be distinct from y and z
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_smul(BIG x, BIG y, BIG z);
+/**	@brief Square BIG resulting in a DBIG - input normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, square of a BIG
+	@param y BIG number to be squared
+ */
+extern void BIG_sqr(DBIG x, BIG y);
+
+/**	@brief Montgomery reduction of a DBIG to a BIG  - input normalised and output normalised (Constant Time)
+ *
+	@param a BIG number, reduction of a BIG
+	@param md BIG number, the modulus
+	@param MC the Montgomery Constant
+	@param d DBIG number to be reduced
+ */
+extern void BIG_monty(BIG a, BIG md, chunk MC, DBIG d);
+
+/**	@brief Shifts a BIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shl(BIG x, int s);
+/**	@brief Fast shifts a BIG left by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Overflow bits
+ */
+extern int BIG_fshl(BIG x, int s);
+/**	@brief Shifts a DBIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshl(DBIG x, int s);
+/**	@brief Shifts a BIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shr(BIG x, int s);
+
+
+/**	@brief Fast time-critical combined shift by 1 bit, subtract and normalise (Constant Time)
+ *
+	@param r BIG number normalised output
+	@param a BIG number to be subtracted from
+	@param m BIG number to be shifted and subtracted
+	@return sign of r
+ */
+extern int BIG_ssn(BIG r, BIG a, BIG m);
+
+/**	@brief Fast shifts a BIG right by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Shifted out bits
+ */
+extern int BIG_fshr(BIG x, int s);
+/**	@brief Shifts a DBIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshr(DBIG x, int s);
+/**	@brief Splits a DBIG into two BIGs - input must be normalised, outputs normalised (Constant Time as used)
+ *
+	Internal function. The value of s must be approximately in the middle of the DBIG.
+	Typically used to extract z mod 2^MODBITS and z/2^MODBITS
+	@param x BIG number, top half of z
+	@param y BIG number, bottom half of z
+	@param z DBIG number to be split in two.
+	@param s Bit position at which to split
+	@return carry-out from top half
+ */
+extern chunk BIG_split(BIG x, BIG y, DBIG z, int s);
+/**	@brief Normalizes a BIG number - output normalised (Constant Time)
+ *
+	All digits of the input BIG are reduced mod 2^BASEBITS
+	@param x BIG number to be normalised
+ */
+extern chunk BIG_norm(BIG x);
+/**	@brief Normalizes a DBIG number - output normalised (Constant Time)
+ *
+	All digits of the input DBIG are reduced mod 2^BASEBITS
+	@param x DBIG number to be normalised
+ */
+extern void BIG_dnorm(DBIG x);
+/**	@brief Compares two BIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first BIG number to be compared
+	@param y second BIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_comp(BIG x, BIG y);
+/**	@brief Compares two DBIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first DBIG number to be compared
+	@param y second DBIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_dcomp(DBIG x, DBIG y);
+/**	@brief Calculate number of bits in a BIG - output normalised (Variable Time)
+ *
+	@param x BIG number
+	@return Number of bits in x
+ */
+extern int BIG_nbits(BIG x);
+/**	@brief Calculate number of bits in a DBIG - output normalised (Variable Time)
+ *
+	@param x DBIG number
+	@return Number of bits in x
+ */
+extern int BIG_dnbits(DBIG x);
+
+/**	@brief Reduce x mod n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctmod(BIG x, BIG n, int bd);
+
+/**	@brief  x=y mod n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctdmod(BIG x, DBIG y, BIG n, int bd);
+
+/**	@brief Divide x by n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctsdiv(BIG x,BIG n,int bd);
+
+/**	@brief  x=y/n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctddiv(BIG x, DBIG y, BIG n,int bd);
+
+
+/**	@brief Reduce x mod n - input and output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+ */
+extern void BIG_mod(BIG x, BIG n);
+/**	@brief Divide x by n - output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+ */
+extern void BIG_sdiv(BIG x, BIG n);
+/**	@brief  x=y mod n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_dmod(BIG x, DBIG y, BIG n);
+/**	@brief  x=y/n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_ddiv(BIG x, DBIG y, BIG n);
+/**	@brief  return parity of BIG, that is the least significant bit (Constant Time)
+ *
+	@param x BIG number
+	@return 0 or 1
+ */
+extern int BIG_parity(BIG x);
+/**	@brief  return i-th of BIG (Constant Time)
+ *
+	@param x BIG number
+	@param i the bit of x to be returned
+	@return 0 or 1
+ */
+extern int BIG_bit(BIG x, int i);
+/**	@brief  return least significant bits of a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param n number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int BIG_lastbits(BIG x, int n);
+/**	@brief  Create a random BIG from a random number generator (Constant Time)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_random(BIG x, csprng *r);
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randomnum(BIG x, BIG n, csprng *r);
+
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus and truncated to max bit length (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param t Maximum bit length
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randtrunc(BIG x, BIG n, int t, csprng *r);
+
+/**	brief  return NAF (Non-Adjacent-Form) value as +/- 1, 3 or 5, inputs must be normalised
+ *
+	Given x and 3*x extracts NAF value from given bit position, and returns number of bits processed, and number of trailing zeros detected if any
+	param x BIG number
+	param x3 BIG number, three times x
+	param i bit position
+	param nbs pointer to integer returning number of bits processed
+	param nzs pointer to integer returning number of trailing 0s
+	return + or - 1, 3 or 5
+*/
+
+/**	@brief  Calculate x=y*z mod n (Variable Time)
+ *
+	Slow method for modular multiplication
+	@param x BIG number, on exit = y*z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modmul(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y/z mod n (Variable Time)
+ *
+	Slow method for modular division
+	@param x BIG number, on exit = y/z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_moddiv(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y^2 mod n (Variable Time)
+ *
+	Slow method for modular squaring
+	@param x BIG number, on exit = y^2 mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modsqr(BIG x, BIG y, BIG n);
+/**	@brief  Calculate x=-y mod n (Variable Time)
+ *
+	Modular negation
+	@param x BIG number, on exit = -y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modneg(BIG x, BIG y, BIG n);
+
+/**	@brief  Calculate x=y+z mod n (Variable Time)
+ *
+	Slow method for modular addition
+	@param x BIG number, on exit = y+z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modadd(BIG x, BIG y, BIG z, BIG n);
+
+/**	@brief  Calculate jacobi Symbol (x/y) (Variable Time)
+ *
+	@param x BIG number
+	@param y BIG number
+	@return Jacobi symbol, -1,0 or 1
+ */
+extern int BIG_jacobi(BIG x, BIG y);
+/**	@brief  Calculate x=1/y mod n (Variable Time)
+ *
+	Modular Inversion - This is slow. Uses binary method.
+	@param x BIG number, on exit = 1/y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_invmodp(BIG x, BIG y, BIG n);
+/** @brief Calculate x=x mod 2^m (Variable Time)
+ *
+	Truncation
+	@param x BIG number, on reduced mod 2^m
+	@param m new truncated size
+*/
+extern void BIG_mod2m(BIG x, int m);
+
+/**	@brief Calculates a*b+c+*d
+ *
+	Calculate partial product of a.b, add in carry c, and add total to d (Constant Time)
+	@param a multiplier
+	@param b multiplicand
+	@param c carry
+	@param d pointer to accumulated bottom half of result
+	@return top half of result
+ */
+
+
+extern int step1(BIG,BIG,BIG);
+extern void step2(BIG,BIG,BIG);
+
+#ifdef dchunk
+
+/* Method required to calculate x*y+c+r, bottom half in r, top half returned */
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    dchunk prod = (dchunk)x * y + c + *r;
+    *r = (chunk)prod & BMASK_B256_29;
+    return (chunk)(prod >> BASEBITS_B256_29);
+}
+
+#else
+
+/* No integer type available that can store double the wordlength */
+/* accumulate partial products */
+
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    chunk x0, x1, y0, y1;
+    chunk bot, top, mid, carry;
+    x0 = x & HMASK_B256_29;
+    x1 = (x >> HBITS_B256_29);
+    y0 = y & HMASK_B256_29;
+    y1 = (y >> HBITS_B256_29);
+    bot = x0 * y0;
+    top = x1 * y1;
+    mid = x0 * y1 + x1 * y0;
+    x0 = mid & HMASK_B256_29;
+    x1 = (mid >> HBITS_B256_29);
+    bot += x0 << HBITS_B256_29;
+    bot += *r;
+    bot += c;
+
+    top += x1;
+    carry = bot >> BASEBITS_B256_29;
+    bot &= BMASK_B256_29;
+    top += carry;
+
+    *r = bot;
+    return top;
+}
+
+#endif
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/big_B288_29.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/big_B288_29.h
new file mode 100644
index 0000000..b0eb364
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/big_B288_29.h
@@ -0,0 +1,697 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file big.h
+ * @author Mike Scott
+ * @date 23rd February 2016
+ * @brief Big number Header File
+ *
+ *
+ */
+
+#ifndef BIG_B288_29_H
+#define BIG_B288_29_H
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <inttypes.h>
+#include "arch.h"
+#include "core.h"
+#include "config_big_B288_29.h"
+
+using namespace core;
+
+/* could comment this out if code size is a major issue */
+#define UNWOUND
+/* Normally recommended, but may not be optimal for some architectures, for example 32-bit ARM M4 */
+#define USE_KARATSUBA
+
+#define BIGBITS_B288_29 (8*MODBYTES_B288_29)
+#define NLEN_B288_29 (1+((8*MODBYTES_B288_29-1)/BASEBITS_B288_29))
+#define DNLEN_B288_29 2*NLEN_B288_29
+#define BMASK_B288_29 (((chunk)1<<BASEBITS_B288_29)-1) /**< Mask = 2^BASEBITS-1 */
+#define NEXCESS_B288_29 (1<<(CHUNK-BASEBITS_B288_29-1))           /**< 2^(CHUNK-BASEBITS-1) - digit cannot be multiplied by more than this before normalisation */
+
+#define HBITS_B288_29 (BASEBITS_B288_29/2)      /**< Number of bits in number base divided by 2 */
+#define HMASK_B288_29 (((chunk)1<<HBITS_B288_29)-1)    /**< Mask = 2^HBITS-1 */
+
+//#define DEBUG_NORM
+
+#ifdef DEBUG_NORM  /* Add an extra location to track chunk extension */
+#define MPV_B288_29 NLEN_B288_29
+#define MNV_B288_29 (NLEN_B288_29+1)
+#define DMPV_B288_29 DNLEN_B288_29
+#define DMNV_B288_29 (DNLEN_B288_29+1)
+
+#endif
+
+namespace B288_29 {
+
+//extern int BIGMULS;
+//extern int BIGSQRS;
+
+#ifdef DEBUG_NORM
+typedef chunk BIG[NLEN_B288_29 + 2]; /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B288_29 + 2]; /**< Define type DBIG as array of chunks */
+#else
+typedef chunk BIG[NLEN_B288_29];     /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B288_29];   /**< Define type DBIG as array of chunks */
+#endif
+
+/* BIG number prototypes */
+
+/**	@brief Tests for BIG equal to zero (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_iszilch(BIG x);
+/**	@brief Tests for BIG equal to one (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if one, else returns 0
+ */
+extern int BIG_isunity(BIG x);
+/**	@brief Tests for DBIG equal to zero (Constant Time)
+ *
+	@param x a DBIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_diszilch(DBIG x);
+/**	@brief Outputs a BIG number to the console (Variable Time)
+ *
+	@param x a BIG number
+ */
+extern void BIG_output(BIG x);
+/**	@brief Outputs a BIG number to the console in raw form (Variable Time for debugging)
+ *
+	@param x a BIG number
+ */
+extern void BIG_rawoutput(BIG x);
+/**	@brief Conditional constant time swap of two BIG numbers
+ *
+	Conditionally swaps parameters in constant time (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s swap takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cswap(BIG x, BIG y, int s);
+/**	@brief Conditional copy of BIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cmove(BIG x, BIG y, int s);
+/**	@brief Conditional copy of DBIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a DBIG number
+	@param y another DBIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_dcmove(BIG x, BIG y, int s);
+/**	@brief Convert from BIG number to byte array (Constant Time)
+ *
+	@param a byte array
+	@param x BIG number
+ */
+extern void BIG_toBytes(char *a, BIG x);
+/**	@brief Convert to BIG number from byte array (Constant Time)
+ *
+	@param x BIG number
+	@param a byte array
+ */
+extern void BIG_fromBytes(BIG x, char *a);
+/**	@brief Convert to BIG number from byte array of given length (Variable Time)
+ *
+	@param x BIG number
+	@param a byte array
+	@param s byte array length
+ */
+extern void BIG_fromBytesLen(BIG x, char *a, int s);
+/**@brief Convert to DBIG number from byte array of given length (Variable Time)
+ *
+   @param x DBIG number
+   @param a byte array
+   @param s byte array length
+ */
+extern void BIG_dfromBytesLen(DBIG x, char *a, int s);
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_doutput(DBIG x); 
+
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_drawoutput(DBIG x);
+
+/**	@brief Copy BIG from Read-Only Memory to a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number in ROM
+ */
+extern void BIG_rcopy(BIG x, const BIG y);
+/**	@brief Copy BIG to another BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_copy(BIG x, BIG y);
+/**	@brief Copy DBIG to another DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_dcopy(DBIG x, DBIG y);
+/**	@brief Copy BIG to upper half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dsucopy(DBIG x, BIG y);
+/**	@brief Copy BIG to lower half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dscopy(DBIG x, BIG y);
+/**	@brief Copy lower half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sdcopy(BIG x, DBIG y);
+/**	@brief Copy upper half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sducopy(BIG x, DBIG y);
+/**	@brief Set BIG to zero (Constant Time)
+ *
+	@param x BIG number to be set to zero  
+ */
+extern void BIG_zero(BIG x);
+/**	@brief Set DBIG to zero (Constant Time)
+ *
+	@param x DBIG number to be set to zero
+ */
+extern void BIG_dzero(DBIG x);
+/**	@brief Set BIG to one (unity) (Constant Time)
+ *
+	@param x BIG number to be set to one.
+ */
+extern void BIG_one(BIG x);
+/**	@brief Set BIG to inverse mod 2^256 (Constant Time)
+ *
+	@param x BIG number to be inverted
+ */
+extern void BIG_invmod2m(BIG x);
+/**	@brief Set BIG to sum of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, sum of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_add(BIG x, BIG y, BIG z);
+
+/**	@brief Set BIG to logical or of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, or of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_or(BIG x, BIG y, BIG z);
+
+/**	@brief Increment BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be incremented
+	@param i integer
+ */
+extern void BIG_inc(BIG x, int i);
+/**	@brief Set BIG to difference of two BIGs (Constant Time)
+ *
+	@param x BIG number, difference of other two - output not normalised
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_sub(BIG x, BIG y, BIG z);
+/**	@brief Decrement BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be decremented
+	@param i integer
+ */
+extern void BIG_dec(BIG x, int i);
+/**	@brief Set DBIG to sum of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, sum of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dadd(DBIG x, DBIG y, DBIG z);
+/**	@brief Set DBIG to difference of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, difference of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dsub(DBIG x, DBIG y, DBIG z);
+/**	@brief Multiply BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_imul(BIG x, BIG y, int i);
+/**	@brief Multiply BIG by not-so-small small integer - output normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+	@return Overflowing bits
+ */
+extern chunk BIG_pmul(BIG x, BIG y, int i);
+/**	@brief Divide BIG by 3 - output normalised (Constant Time)
+ *
+	@param x BIG number
+	@return Remainder
+ */
+extern int BIG_div3(BIG x);
+/**	@brief Multiply BIG by even bigger small integer resulting in a DBIG - output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_pxmul(DBIG x, BIG y, int i);
+/**	@brief Multiply BIG by another BIG resulting in DBIG - inputs normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_mul(DBIG x, BIG y, BIG z);
+/**	@brief Multiply BIG by another BIG resulting in another BIG - inputs normalised and output normalised (Constant Time)
+ *
+	Note that the product must fit into a BIG, and x must be distinct from y and z
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_smul(BIG x, BIG y, BIG z);
+/**	@brief Square BIG resulting in a DBIG - input normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, square of a BIG
+	@param y BIG number to be squared
+ */
+extern void BIG_sqr(DBIG x, BIG y);
+
+/**	@brief Montgomery reduction of a DBIG to a BIG  - input normalised and output normalised (Constant Time)
+ *
+	@param a BIG number, reduction of a BIG
+	@param md BIG number, the modulus
+	@param MC the Montgomery Constant
+	@param d DBIG number to be reduced
+ */
+extern void BIG_monty(BIG a, BIG md, chunk MC, DBIG d);
+
+/**	@brief Shifts a BIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shl(BIG x, int s);
+/**	@brief Fast shifts a BIG left by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Overflow bits
+ */
+extern int BIG_fshl(BIG x, int s);
+/**	@brief Shifts a DBIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshl(DBIG x, int s);
+/**	@brief Shifts a BIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shr(BIG x, int s);
+
+
+/**	@brief Fast time-critical combined shift by 1 bit, subtract and normalise (Constant Time)
+ *
+	@param r BIG number normalised output
+	@param a BIG number to be subtracted from
+	@param m BIG number to be shifted and subtracted
+	@return sign of r
+ */
+extern int BIG_ssn(BIG r, BIG a, BIG m);
+
+/**	@brief Fast shifts a BIG right by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Shifted out bits
+ */
+extern int BIG_fshr(BIG x, int s);
+/**	@brief Shifts a DBIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshr(DBIG x, int s);
+/**	@brief Splits a DBIG into two BIGs - input must be normalised, outputs normalised (Constant Time as used)
+ *
+	Internal function. The value of s must be approximately in the middle of the DBIG.
+	Typically used to extract z mod 2^MODBITS and z/2^MODBITS
+	@param x BIG number, top half of z
+	@param y BIG number, bottom half of z
+	@param z DBIG number to be split in two.
+	@param s Bit position at which to split
+	@return carry-out from top half
+ */
+extern chunk BIG_split(BIG x, BIG y, DBIG z, int s);
+/**	@brief Normalizes a BIG number - output normalised (Constant Time)
+ *
+	All digits of the input BIG are reduced mod 2^BASEBITS
+	@param x BIG number to be normalised
+ */
+extern chunk BIG_norm(BIG x);
+/**	@brief Normalizes a DBIG number - output normalised (Constant Time)
+ *
+	All digits of the input DBIG are reduced mod 2^BASEBITS
+	@param x DBIG number to be normalised
+ */
+extern void BIG_dnorm(DBIG x);
+/**	@brief Compares two BIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first BIG number to be compared
+	@param y second BIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_comp(BIG x, BIG y);
+/**	@brief Compares two DBIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first DBIG number to be compared
+	@param y second DBIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_dcomp(DBIG x, DBIG y);
+/**	@brief Calculate number of bits in a BIG - output normalised (Variable Time)
+ *
+	@param x BIG number
+	@return Number of bits in x
+ */
+extern int BIG_nbits(BIG x);
+/**	@brief Calculate number of bits in a DBIG - output normalised (Variable Time)
+ *
+	@param x DBIG number
+	@return Number of bits in x
+ */
+extern int BIG_dnbits(DBIG x);
+
+/**	@brief Reduce x mod n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctmod(BIG x, BIG n, int bd);
+
+/**	@brief  x=y mod n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctdmod(BIG x, DBIG y, BIG n, int bd);
+
+/**	@brief Divide x by n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctsdiv(BIG x,BIG n,int bd);
+
+/**	@brief  x=y/n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctddiv(BIG x, DBIG y, BIG n,int bd);
+
+
+/**	@brief Reduce x mod n - input and output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+ */
+extern void BIG_mod(BIG x, BIG n);
+/**	@brief Divide x by n - output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+ */
+extern void BIG_sdiv(BIG x, BIG n);
+/**	@brief  x=y mod n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_dmod(BIG x, DBIG y, BIG n);
+/**	@brief  x=y/n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_ddiv(BIG x, DBIG y, BIG n);
+/**	@brief  return parity of BIG, that is the least significant bit (Constant Time)
+ *
+	@param x BIG number
+	@return 0 or 1
+ */
+extern int BIG_parity(BIG x);
+/**	@brief  return i-th of BIG (Constant Time)
+ *
+	@param x BIG number
+	@param i the bit of x to be returned
+	@return 0 or 1
+ */
+extern int BIG_bit(BIG x, int i);
+/**	@brief  return least significant bits of a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param n number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int BIG_lastbits(BIG x, int n);
+/**	@brief  Create a random BIG from a random number generator (Constant Time)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_random(BIG x, csprng *r);
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randomnum(BIG x, BIG n, csprng *r);
+
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus and truncated to max bit length (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param t Maximum bit length
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randtrunc(BIG x, BIG n, int t, csprng *r);
+
+/**	brief  return NAF (Non-Adjacent-Form) value as +/- 1, 3 or 5, inputs must be normalised
+ *
+	Given x and 3*x extracts NAF value from given bit position, and returns number of bits processed, and number of trailing zeros detected if any
+	param x BIG number
+	param x3 BIG number, three times x
+	param i bit position
+	param nbs pointer to integer returning number of bits processed
+	param nzs pointer to integer returning number of trailing 0s
+	return + or - 1, 3 or 5
+*/
+
+/**	@brief  Calculate x=y*z mod n (Variable Time)
+ *
+	Slow method for modular multiplication
+	@param x BIG number, on exit = y*z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modmul(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y/z mod n (Variable Time)
+ *
+	Slow method for modular division
+	@param x BIG number, on exit = y/z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_moddiv(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y^2 mod n (Variable Time)
+ *
+	Slow method for modular squaring
+	@param x BIG number, on exit = y^2 mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modsqr(BIG x, BIG y, BIG n);
+/**	@brief  Calculate x=-y mod n (Variable Time)
+ *
+	Modular negation
+	@param x BIG number, on exit = -y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modneg(BIG x, BIG y, BIG n);
+
+/**	@brief  Calculate x=y+z mod n (Variable Time)
+ *
+	Slow method for modular addition
+	@param x BIG number, on exit = y+z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modadd(BIG x, BIG y, BIG z, BIG n);
+
+/**	@brief  Calculate jacobi Symbol (x/y) (Variable Time)
+ *
+	@param x BIG number
+	@param y BIG number
+	@return Jacobi symbol, -1,0 or 1
+ */
+extern int BIG_jacobi(BIG x, BIG y);
+/**	@brief  Calculate x=1/y mod n (Variable Time)
+ *
+	Modular Inversion - This is slow. Uses binary method.
+	@param x BIG number, on exit = 1/y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_invmodp(BIG x, BIG y, BIG n);
+/** @brief Calculate x=x mod 2^m (Variable Time)
+ *
+	Truncation
+	@param x BIG number, on reduced mod 2^m
+	@param m new truncated size
+*/
+extern void BIG_mod2m(BIG x, int m);
+
+/**	@brief Calculates a*b+c+*d
+ *
+	Calculate partial product of a.b, add in carry c, and add total to d (Constant Time)
+	@param a multiplier
+	@param b multiplicand
+	@param c carry
+	@param d pointer to accumulated bottom half of result
+	@return top half of result
+ */
+
+
+extern int step1(BIG,BIG,BIG);
+extern void step2(BIG,BIG,BIG);
+
+#ifdef dchunk
+
+/* Method required to calculate x*y+c+r, bottom half in r, top half returned */
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    dchunk prod = (dchunk)x * y + c + *r;
+    *r = (chunk)prod & BMASK_B288_29;
+    return (chunk)(prod >> BASEBITS_B288_29);
+}
+
+#else
+
+/* No integer type available that can store double the wordlength */
+/* accumulate partial products */
+
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    chunk x0, x1, y0, y1;
+    chunk bot, top, mid, carry;
+    x0 = x & HMASK_B288_29;
+    x1 = (x >> HBITS_B288_29);
+    y0 = y & HMASK_B288_29;
+    y1 = (y >> HBITS_B288_29);
+    bot = x0 * y0;
+    top = x1 * y1;
+    mid = x0 * y1 + x1 * y0;
+    x0 = mid & HMASK_B288_29;
+    x1 = (mid >> HBITS_B288_29);
+    bot += x0 << HBITS_B288_29;
+    bot += *r;
+    bot += c;
+
+    top += x1;
+    carry = bot >> BASEBITS_B288_29;
+    bot &= BMASK_B288_29;
+    top += carry;
+
+    *r = bot;
+    return top;
+}
+
+#endif
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/big_B336_29.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/big_B336_29.h
new file mode 100644
index 0000000..40d9dcb
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/big_B336_29.h
@@ -0,0 +1,697 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file big.h
+ * @author Mike Scott
+ * @date 23rd February 2016
+ * @brief Big number Header File
+ *
+ *
+ */
+
+#ifndef BIG_B336_29_H
+#define BIG_B336_29_H
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <inttypes.h>
+#include "arch.h"
+#include "core.h"
+#include "config_big_B336_29.h"
+
+using namespace core;
+
+/* could comment this out if code size is a major issue */
+#define UNWOUND
+/* Normally recommended, but may not be optimal for some architectures, for example 32-bit ARM M4 */
+#define USE_KARATSUBA
+
+#define BIGBITS_B336_29 (8*MODBYTES_B336_29)
+#define NLEN_B336_29 (1+((8*MODBYTES_B336_29-1)/BASEBITS_B336_29))
+#define DNLEN_B336_29 2*NLEN_B336_29
+#define BMASK_B336_29 (((chunk)1<<BASEBITS_B336_29)-1) /**< Mask = 2^BASEBITS-1 */
+#define NEXCESS_B336_29 (1<<(CHUNK-BASEBITS_B336_29-1))           /**< 2^(CHUNK-BASEBITS-1) - digit cannot be multiplied by more than this before normalisation */
+
+#define HBITS_B336_29 (BASEBITS_B336_29/2)      /**< Number of bits in number base divided by 2 */
+#define HMASK_B336_29 (((chunk)1<<HBITS_B336_29)-1)    /**< Mask = 2^HBITS-1 */
+
+//#define DEBUG_NORM
+
+#ifdef DEBUG_NORM  /* Add an extra location to track chunk extension */
+#define MPV_B336_29 NLEN_B336_29
+#define MNV_B336_29 (NLEN_B336_29+1)
+#define DMPV_B336_29 DNLEN_B336_29
+#define DMNV_B336_29 (DNLEN_B336_29+1)
+
+#endif
+
+namespace B336_29 {
+
+//extern int BIGMULS;
+//extern int BIGSQRS;
+
+#ifdef DEBUG_NORM
+typedef chunk BIG[NLEN_B336_29 + 2]; /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B336_29 + 2]; /**< Define type DBIG as array of chunks */
+#else
+typedef chunk BIG[NLEN_B336_29];     /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B336_29];   /**< Define type DBIG as array of chunks */
+#endif
+
+/* BIG number prototypes */
+
+/**	@brief Tests for BIG equal to zero (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_iszilch(BIG x);
+/**	@brief Tests for BIG equal to one (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if one, else returns 0
+ */
+extern int BIG_isunity(BIG x);
+/**	@brief Tests for DBIG equal to zero (Constant Time)
+ *
+	@param x a DBIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_diszilch(DBIG x);
+/**	@brief Outputs a BIG number to the console (Variable Time)
+ *
+	@param x a BIG number
+ */
+extern void BIG_output(BIG x);
+/**	@brief Outputs a BIG number to the console in raw form (Variable Time for debugging)
+ *
+	@param x a BIG number
+ */
+extern void BIG_rawoutput(BIG x);
+/**	@brief Conditional constant time swap of two BIG numbers
+ *
+	Conditionally swaps parameters in constant time (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s swap takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cswap(BIG x, BIG y, int s);
+/**	@brief Conditional copy of BIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cmove(BIG x, BIG y, int s);
+/**	@brief Conditional copy of DBIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a DBIG number
+	@param y another DBIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_dcmove(BIG x, BIG y, int s);
+/**	@brief Convert from BIG number to byte array (Constant Time)
+ *
+	@param a byte array
+	@param x BIG number
+ */
+extern void BIG_toBytes(char *a, BIG x);
+/**	@brief Convert to BIG number from byte array (Constant Time)
+ *
+	@param x BIG number
+	@param a byte array
+ */
+extern void BIG_fromBytes(BIG x, char *a);
+/**	@brief Convert to BIG number from byte array of given length (Variable Time)
+ *
+	@param x BIG number
+	@param a byte array
+	@param s byte array length
+ */
+extern void BIG_fromBytesLen(BIG x, char *a, int s);
+/**@brief Convert to DBIG number from byte array of given length (Variable Time)
+ *
+   @param x DBIG number
+   @param a byte array
+   @param s byte array length
+ */
+extern void BIG_dfromBytesLen(DBIG x, char *a, int s);
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_doutput(DBIG x); 
+
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_drawoutput(DBIG x);
+
+/**	@brief Copy BIG from Read-Only Memory to a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number in ROM
+ */
+extern void BIG_rcopy(BIG x, const BIG y);
+/**	@brief Copy BIG to another BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_copy(BIG x, BIG y);
+/**	@brief Copy DBIG to another DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_dcopy(DBIG x, DBIG y);
+/**	@brief Copy BIG to upper half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dsucopy(DBIG x, BIG y);
+/**	@brief Copy BIG to lower half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dscopy(DBIG x, BIG y);
+/**	@brief Copy lower half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sdcopy(BIG x, DBIG y);
+/**	@brief Copy upper half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sducopy(BIG x, DBIG y);
+/**	@brief Set BIG to zero (Constant Time)
+ *
+	@param x BIG number to be set to zero  
+ */
+extern void BIG_zero(BIG x);
+/**	@brief Set DBIG to zero (Constant Time)
+ *
+	@param x DBIG number to be set to zero
+ */
+extern void BIG_dzero(DBIG x);
+/**	@brief Set BIG to one (unity) (Constant Time)
+ *
+	@param x BIG number to be set to one.
+ */
+extern void BIG_one(BIG x);
+/**	@brief Set BIG to inverse mod 2^256 (Constant Time)
+ *
+	@param x BIG number to be inverted
+ */
+extern void BIG_invmod2m(BIG x);
+/**	@brief Set BIG to sum of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, sum of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_add(BIG x, BIG y, BIG z);
+
+/**	@brief Set BIG to logical or of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, or of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_or(BIG x, BIG y, BIG z);
+
+/**	@brief Increment BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be incremented
+	@param i integer
+ */
+extern void BIG_inc(BIG x, int i);
+/**	@brief Set BIG to difference of two BIGs (Constant Time)
+ *
+	@param x BIG number, difference of other two - output not normalised
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_sub(BIG x, BIG y, BIG z);
+/**	@brief Decrement BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be decremented
+	@param i integer
+ */
+extern void BIG_dec(BIG x, int i);
+/**	@brief Set DBIG to sum of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, sum of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dadd(DBIG x, DBIG y, DBIG z);
+/**	@brief Set DBIG to difference of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, difference of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dsub(DBIG x, DBIG y, DBIG z);
+/**	@brief Multiply BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_imul(BIG x, BIG y, int i);
+/**	@brief Multiply BIG by not-so-small small integer - output normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+	@return Overflowing bits
+ */
+extern chunk BIG_pmul(BIG x, BIG y, int i);
+/**	@brief Divide BIG by 3 - output normalised (Constant Time)
+ *
+	@param x BIG number
+	@return Remainder
+ */
+extern int BIG_div3(BIG x);
+/**	@brief Multiply BIG by even bigger small integer resulting in a DBIG - output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_pxmul(DBIG x, BIG y, int i);
+/**	@brief Multiply BIG by another BIG resulting in DBIG - inputs normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_mul(DBIG x, BIG y, BIG z);
+/**	@brief Multiply BIG by another BIG resulting in another BIG - inputs normalised and output normalised (Constant Time)
+ *
+	Note that the product must fit into a BIG, and x must be distinct from y and z
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_smul(BIG x, BIG y, BIG z);
+/**	@brief Square BIG resulting in a DBIG - input normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, square of a BIG
+	@param y BIG number to be squared
+ */
+extern void BIG_sqr(DBIG x, BIG y);
+
+/**	@brief Montgomery reduction of a DBIG to a BIG  - input normalised and output normalised (Constant Time)
+ *
+	@param a BIG number, reduction of a BIG
+	@param md BIG number, the modulus
+	@param MC the Montgomery Constant
+	@param d DBIG number to be reduced
+ */
+extern void BIG_monty(BIG a, BIG md, chunk MC, DBIG d);
+
+/**	@brief Shifts a BIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shl(BIG x, int s);
+/**	@brief Fast shifts a BIG left by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Overflow bits
+ */
+extern int BIG_fshl(BIG x, int s);
+/**	@brief Shifts a DBIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshl(DBIG x, int s);
+/**	@brief Shifts a BIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shr(BIG x, int s);
+
+
+/**	@brief Fast time-critical combined shift by 1 bit, subtract and normalise (Constant Time)
+ *
+	@param r BIG number normalised output
+	@param a BIG number to be subtracted from
+	@param m BIG number to be shifted and subtracted
+	@return sign of r
+ */
+extern int BIG_ssn(BIG r, BIG a, BIG m);
+
+/**	@brief Fast shifts a BIG right by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Shifted out bits
+ */
+extern int BIG_fshr(BIG x, int s);
+/**	@brief Shifts a DBIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshr(DBIG x, int s);
+/**	@brief Splits a DBIG into two BIGs - input must be normalised, outputs normalised (Constant Time as used)
+ *
+	Internal function. The value of s must be approximately in the middle of the DBIG.
+	Typically used to extract z mod 2^MODBITS and z/2^MODBITS
+	@param x BIG number, top half of z
+	@param y BIG number, bottom half of z
+	@param z DBIG number to be split in two.
+	@param s Bit position at which to split
+	@return carry-out from top half
+ */
+extern chunk BIG_split(BIG x, BIG y, DBIG z, int s);
+/**	@brief Normalizes a BIG number - output normalised (Constant Time)
+ *
+	All digits of the input BIG are reduced mod 2^BASEBITS
+	@param x BIG number to be normalised
+ */
+extern chunk BIG_norm(BIG x);
+/**	@brief Normalizes a DBIG number - output normalised (Constant Time)
+ *
+	All digits of the input DBIG are reduced mod 2^BASEBITS
+	@param x DBIG number to be normalised
+ */
+extern void BIG_dnorm(DBIG x);
+/**	@brief Compares two BIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first BIG number to be compared
+	@param y second BIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_comp(BIG x, BIG y);
+/**	@brief Compares two DBIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first DBIG number to be compared
+	@param y second DBIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_dcomp(DBIG x, DBIG y);
+/**	@brief Calculate number of bits in a BIG - output normalised (Variable Time)
+ *
+	@param x BIG number
+	@return Number of bits in x
+ */
+extern int BIG_nbits(BIG x);
+/**	@brief Calculate number of bits in a DBIG - output normalised (Variable Time)
+ *
+	@param x DBIG number
+	@return Number of bits in x
+ */
+extern int BIG_dnbits(DBIG x);
+
+/**	@brief Reduce x mod n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctmod(BIG x, BIG n, int bd);
+
+/**	@brief  x=y mod n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctdmod(BIG x, DBIG y, BIG n, int bd);
+
+/**	@brief Divide x by n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctsdiv(BIG x,BIG n,int bd);
+
+/**	@brief  x=y/n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctddiv(BIG x, DBIG y, BIG n,int bd);
+
+
+/**	@brief Reduce x mod n - input and output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+ */
+extern void BIG_mod(BIG x, BIG n);
+/**	@brief Divide x by n - output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+ */
+extern void BIG_sdiv(BIG x, BIG n);
+/**	@brief  x=y mod n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_dmod(BIG x, DBIG y, BIG n);
+/**	@brief  x=y/n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_ddiv(BIG x, DBIG y, BIG n);
+/**	@brief  return parity of BIG, that is the least significant bit (Constant Time)
+ *
+	@param x BIG number
+	@return 0 or 1
+ */
+extern int BIG_parity(BIG x);
+/**	@brief  return i-th of BIG (Constant Time)
+ *
+	@param x BIG number
+	@param i the bit of x to be returned
+	@return 0 or 1
+ */
+extern int BIG_bit(BIG x, int i);
+/**	@brief  return least significant bits of a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param n number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int BIG_lastbits(BIG x, int n);
+/**	@brief  Create a random BIG from a random number generator (Constant Time)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_random(BIG x, csprng *r);
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randomnum(BIG x, BIG n, csprng *r);
+
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus and truncated to max bit length (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param t Maximum bit length
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randtrunc(BIG x, BIG n, int t, csprng *r);
+
+/**	brief  return NAF (Non-Adjacent-Form) value as +/- 1, 3 or 5, inputs must be normalised
+ *
+	Given x and 3*x extracts NAF value from given bit position, and returns number of bits processed, and number of trailing zeros detected if any
+	param x BIG number
+	param x3 BIG number, three times x
+	param i bit position
+	param nbs pointer to integer returning number of bits processed
+	param nzs pointer to integer returning number of trailing 0s
+	return + or - 1, 3 or 5
+*/
+
+/**	@brief  Calculate x=y*z mod n (Variable Time)
+ *
+	Slow method for modular multiplication
+	@param x BIG number, on exit = y*z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modmul(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y/z mod n (Variable Time)
+ *
+	Slow method for modular division
+	@param x BIG number, on exit = y/z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_moddiv(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y^2 mod n (Variable Time)
+ *
+	Slow method for modular squaring
+	@param x BIG number, on exit = y^2 mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modsqr(BIG x, BIG y, BIG n);
+/**	@brief  Calculate x=-y mod n (Variable Time)
+ *
+	Modular negation
+	@param x BIG number, on exit = -y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modneg(BIG x, BIG y, BIG n);
+
+/**	@brief  Calculate x=y+z mod n (Variable Time)
+ *
+	Slow method for modular addition
+	@param x BIG number, on exit = y+z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modadd(BIG x, BIG y, BIG z, BIG n);
+
+/**	@brief  Calculate jacobi Symbol (x/y) (Variable Time)
+ *
+	@param x BIG number
+	@param y BIG number
+	@return Jacobi symbol, -1,0 or 1
+ */
+extern int BIG_jacobi(BIG x, BIG y);
+/**	@brief  Calculate x=1/y mod n (Variable Time)
+ *
+	Modular Inversion - This is slow. Uses binary method.
+	@param x BIG number, on exit = 1/y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_invmodp(BIG x, BIG y, BIG n);
+/** @brief Calculate x=x mod 2^m (Variable Time)
+ *
+	Truncation
+	@param x BIG number, on reduced mod 2^m
+	@param m new truncated size
+*/
+extern void BIG_mod2m(BIG x, int m);
+
+/**	@brief Calculates a*b+c+*d
+ *
+	Calculate partial product of a.b, add in carry c, and add total to d (Constant Time)
+	@param a multiplier
+	@param b multiplicand
+	@param c carry
+	@param d pointer to accumulated bottom half of result
+	@return top half of result
+ */
+
+
+extern int step1(BIG,BIG,BIG);
+extern void step2(BIG,BIG,BIG);
+
+#ifdef dchunk
+
+/* Method required to calculate x*y+c+r, bottom half in r, top half returned */
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    dchunk prod = (dchunk)x * y + c + *r;
+    *r = (chunk)prod & BMASK_B336_29;
+    return (chunk)(prod >> BASEBITS_B336_29);
+}
+
+#else
+
+/* No integer type available that can store double the wordlength */
+/* accumulate partial products */
+
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    chunk x0, x1, y0, y1;
+    chunk bot, top, mid, carry;
+    x0 = x & HMASK_B336_29;
+    x1 = (x >> HBITS_B336_29);
+    y0 = y & HMASK_B336_29;
+    y1 = (y >> HBITS_B336_29);
+    bot = x0 * y0;
+    top = x1 * y1;
+    mid = x0 * y1 + x1 * y0;
+    x0 = mid & HMASK_B336_29;
+    x1 = (mid >> HBITS_B336_29);
+    bot += x0 << HBITS_B336_29;
+    bot += *r;
+    bot += c;
+
+    top += x1;
+    carry = bot >> BASEBITS_B336_29;
+    bot &= BMASK_B336_29;
+    top += carry;
+
+    *r = bot;
+    return top;
+}
+
+#endif
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/big_B384_28.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/big_B384_28.h
new file mode 100644
index 0000000..c48f1d0
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/big_B384_28.h
@@ -0,0 +1,697 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file big.h
+ * @author Mike Scott
+ * @date 23rd February 2016
+ * @brief Big number Header File
+ *
+ *
+ */
+
+#ifndef BIG_B384_28_H
+#define BIG_B384_28_H
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <inttypes.h>
+#include "arch.h"
+#include "core.h"
+#include "config_big_B384_28.h"
+
+using namespace core;
+
+/* could comment this out if code size is a major issue */
+#define UNWOUND
+/* Normally recommended, but may not be optimal for some architectures, for example 32-bit ARM M4 */
+#define USE_KARATSUBA
+
+#define BIGBITS_B384_28 (8*MODBYTES_B384_28)
+#define NLEN_B384_28 (1+((8*MODBYTES_B384_28-1)/BASEBITS_B384_28))
+#define DNLEN_B384_28 2*NLEN_B384_28
+#define BMASK_B384_28 (((chunk)1<<BASEBITS_B384_28)-1) /**< Mask = 2^BASEBITS-1 */
+#define NEXCESS_B384_28 (1<<(CHUNK-BASEBITS_B384_28-1))           /**< 2^(CHUNK-BASEBITS-1) - digit cannot be multiplied by more than this before normalisation */
+
+#define HBITS_B384_28 (BASEBITS_B384_28/2)      /**< Number of bits in number base divided by 2 */
+#define HMASK_B384_28 (((chunk)1<<HBITS_B384_28)-1)    /**< Mask = 2^HBITS-1 */
+
+//#define DEBUG_NORM
+
+#ifdef DEBUG_NORM  /* Add an extra location to track chunk extension */
+#define MPV_B384_28 NLEN_B384_28
+#define MNV_B384_28 (NLEN_B384_28+1)
+#define DMPV_B384_28 DNLEN_B384_28
+#define DMNV_B384_28 (DNLEN_B384_28+1)
+
+#endif
+
+namespace B384_28 {
+
+//extern int BIGMULS;
+//extern int BIGSQRS;
+
+#ifdef DEBUG_NORM
+typedef chunk BIG[NLEN_B384_28 + 2]; /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B384_28 + 2]; /**< Define type DBIG as array of chunks */
+#else
+typedef chunk BIG[NLEN_B384_28];     /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B384_28];   /**< Define type DBIG as array of chunks */
+#endif
+
+/* BIG number prototypes */
+
+/**	@brief Tests for BIG equal to zero (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_iszilch(BIG x);
+/**	@brief Tests for BIG equal to one (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if one, else returns 0
+ */
+extern int BIG_isunity(BIG x);
+/**	@brief Tests for DBIG equal to zero (Constant Time)
+ *
+	@param x a DBIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_diszilch(DBIG x);
+/**	@brief Outputs a BIG number to the console (Variable Time)
+ *
+	@param x a BIG number
+ */
+extern void BIG_output(BIG x);
+/**	@brief Outputs a BIG number to the console in raw form (Variable Time for debugging)
+ *
+	@param x a BIG number
+ */
+extern void BIG_rawoutput(BIG x);
+/**	@brief Conditional constant time swap of two BIG numbers
+ *
+	Conditionally swaps parameters in constant time (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s swap takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cswap(BIG x, BIG y, int s);
+/**	@brief Conditional copy of BIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cmove(BIG x, BIG y, int s);
+/**	@brief Conditional copy of DBIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a DBIG number
+	@param y another DBIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_dcmove(BIG x, BIG y, int s);
+/**	@brief Convert from BIG number to byte array (Constant Time)
+ *
+	@param a byte array
+	@param x BIG number
+ */
+extern void BIG_toBytes(char *a, BIG x);
+/**	@brief Convert to BIG number from byte array (Constant Time)
+ *
+	@param x BIG number
+	@param a byte array
+ */
+extern void BIG_fromBytes(BIG x, char *a);
+/**	@brief Convert to BIG number from byte array of given length (Variable Time)
+ *
+	@param x BIG number
+	@param a byte array
+	@param s byte array length
+ */
+extern void BIG_fromBytesLen(BIG x, char *a, int s);
+/**@brief Convert to DBIG number from byte array of given length (Variable Time)
+ *
+   @param x DBIG number
+   @param a byte array
+   @param s byte array length
+ */
+extern void BIG_dfromBytesLen(DBIG x, char *a, int s);
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_doutput(DBIG x); 
+
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_drawoutput(DBIG x);
+
+/**	@brief Copy BIG from Read-Only Memory to a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number in ROM
+ */
+extern void BIG_rcopy(BIG x, const BIG y);
+/**	@brief Copy BIG to another BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_copy(BIG x, BIG y);
+/**	@brief Copy DBIG to another DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_dcopy(DBIG x, DBIG y);
+/**	@brief Copy BIG to upper half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dsucopy(DBIG x, BIG y);
+/**	@brief Copy BIG to lower half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dscopy(DBIG x, BIG y);
+/**	@brief Copy lower half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sdcopy(BIG x, DBIG y);
+/**	@brief Copy upper half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sducopy(BIG x, DBIG y);
+/**	@brief Set BIG to zero (Constant Time)
+ *
+	@param x BIG number to be set to zero  
+ */
+extern void BIG_zero(BIG x);
+/**	@brief Set DBIG to zero (Constant Time)
+ *
+	@param x DBIG number to be set to zero
+ */
+extern void BIG_dzero(DBIG x);
+/**	@brief Set BIG to one (unity) (Constant Time)
+ *
+	@param x BIG number to be set to one.
+ */
+extern void BIG_one(BIG x);
+/**	@brief Set BIG to inverse mod 2^256 (Constant Time)
+ *
+	@param x BIG number to be inverted
+ */
+extern void BIG_invmod2m(BIG x);
+/**	@brief Set BIG to sum of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, sum of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_add(BIG x, BIG y, BIG z);
+
+/**	@brief Set BIG to logical or of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, or of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_or(BIG x, BIG y, BIG z);
+
+/**	@brief Increment BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be incremented
+	@param i integer
+ */
+extern void BIG_inc(BIG x, int i);
+/**	@brief Set BIG to difference of two BIGs (Constant Time)
+ *
+	@param x BIG number, difference of other two - output not normalised
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_sub(BIG x, BIG y, BIG z);
+/**	@brief Decrement BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be decremented
+	@param i integer
+ */
+extern void BIG_dec(BIG x, int i);
+/**	@brief Set DBIG to sum of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, sum of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dadd(DBIG x, DBIG y, DBIG z);
+/**	@brief Set DBIG to difference of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, difference of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dsub(DBIG x, DBIG y, DBIG z);
+/**	@brief Multiply BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_imul(BIG x, BIG y, int i);
+/**	@brief Multiply BIG by not-so-small small integer - output normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+	@return Overflowing bits
+ */
+extern chunk BIG_pmul(BIG x, BIG y, int i);
+/**	@brief Divide BIG by 3 - output normalised (Constant Time)
+ *
+	@param x BIG number
+	@return Remainder
+ */
+extern int BIG_div3(BIG x);
+/**	@brief Multiply BIG by even bigger small integer resulting in a DBIG - output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_pxmul(DBIG x, BIG y, int i);
+/**	@brief Multiply BIG by another BIG resulting in DBIG - inputs normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_mul(DBIG x, BIG y, BIG z);
+/**	@brief Multiply BIG by another BIG resulting in another BIG - inputs normalised and output normalised (Constant Time)
+ *
+	Note that the product must fit into a BIG, and x must be distinct from y and z
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_smul(BIG x, BIG y, BIG z);
+/**	@brief Square BIG resulting in a DBIG - input normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, square of a BIG
+	@param y BIG number to be squared
+ */
+extern void BIG_sqr(DBIG x, BIG y);
+
+/**	@brief Montgomery reduction of a DBIG to a BIG  - input normalised and output normalised (Constant Time)
+ *
+	@param a BIG number, reduction of a BIG
+	@param md BIG number, the modulus
+	@param MC the Montgomery Constant
+	@param d DBIG number to be reduced
+ */
+extern void BIG_monty(BIG a, BIG md, chunk MC, DBIG d);
+
+/**	@brief Shifts a BIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shl(BIG x, int s);
+/**	@brief Fast shifts a BIG left by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Overflow bits
+ */
+extern int BIG_fshl(BIG x, int s);
+/**	@brief Shifts a DBIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshl(DBIG x, int s);
+/**	@brief Shifts a BIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shr(BIG x, int s);
+
+
+/**	@brief Fast time-critical combined shift by 1 bit, subtract and normalise (Constant Time)
+ *
+	@param r BIG number normalised output
+	@param a BIG number to be subtracted from
+	@param m BIG number to be shifted and subtracted
+	@return sign of r
+ */
+extern int BIG_ssn(BIG r, BIG a, BIG m);
+
+/**	@brief Fast shifts a BIG right by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Shifted out bits
+ */
+extern int BIG_fshr(BIG x, int s);
+/**	@brief Shifts a DBIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshr(DBIG x, int s);
+/**	@brief Splits a DBIG into two BIGs - input must be normalised, outputs normalised (Constant Time as used)
+ *
+	Internal function. The value of s must be approximately in the middle of the DBIG.
+	Typically used to extract z mod 2^MODBITS and z/2^MODBITS
+	@param x BIG number, top half of z
+	@param y BIG number, bottom half of z
+	@param z DBIG number to be split in two.
+	@param s Bit position at which to split
+	@return carry-out from top half
+ */
+extern chunk BIG_split(BIG x, BIG y, DBIG z, int s);
+/**	@brief Normalizes a BIG number - output normalised (Constant Time)
+ *
+	All digits of the input BIG are reduced mod 2^BASEBITS
+	@param x BIG number to be normalised
+ */
+extern chunk BIG_norm(BIG x);
+/**	@brief Normalizes a DBIG number - output normalised (Constant Time)
+ *
+	All digits of the input DBIG are reduced mod 2^BASEBITS
+	@param x DBIG number to be normalised
+ */
+extern void BIG_dnorm(DBIG x);
+/**	@brief Compares two BIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first BIG number to be compared
+	@param y second BIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_comp(BIG x, BIG y);
+/**	@brief Compares two DBIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first DBIG number to be compared
+	@param y second DBIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_dcomp(DBIG x, DBIG y);
+/**	@brief Calculate number of bits in a BIG - output normalised (Variable Time)
+ *
+	@param x BIG number
+	@return Number of bits in x
+ */
+extern int BIG_nbits(BIG x);
+/**	@brief Calculate number of bits in a DBIG - output normalised (Variable Time)
+ *
+	@param x DBIG number
+	@return Number of bits in x
+ */
+extern int BIG_dnbits(DBIG x);
+
+/**	@brief Reduce x mod n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctmod(BIG x, BIG n, int bd);
+
+/**	@brief  x=y mod n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctdmod(BIG x, DBIG y, BIG n, int bd);
+
+/**	@brief Divide x by n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctsdiv(BIG x,BIG n,int bd);
+
+/**	@brief  x=y/n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctddiv(BIG x, DBIG y, BIG n,int bd);
+
+
+/**	@brief Reduce x mod n - input and output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+ */
+extern void BIG_mod(BIG x, BIG n);
+/**	@brief Divide x by n - output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+ */
+extern void BIG_sdiv(BIG x, BIG n);
+/**	@brief  x=y mod n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_dmod(BIG x, DBIG y, BIG n);
+/**	@brief  x=y/n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_ddiv(BIG x, DBIG y, BIG n);
+/**	@brief  return parity of BIG, that is the least significant bit (Constant Time)
+ *
+	@param x BIG number
+	@return 0 or 1
+ */
+extern int BIG_parity(BIG x);
+/**	@brief  return i-th of BIG (Constant Time)
+ *
+	@param x BIG number
+	@param i the bit of x to be returned
+	@return 0 or 1
+ */
+extern int BIG_bit(BIG x, int i);
+/**	@brief  return least significant bits of a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param n number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int BIG_lastbits(BIG x, int n);
+/**	@brief  Create a random BIG from a random number generator (Constant Time)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_random(BIG x, csprng *r);
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randomnum(BIG x, BIG n, csprng *r);
+
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus and truncated to max bit length (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param t Maximum bit length
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randtrunc(BIG x, BIG n, int t, csprng *r);
+
+/**	brief  return NAF (Non-Adjacent-Form) value as +/- 1, 3 or 5, inputs must be normalised
+ *
+	Given x and 3*x extracts NAF value from given bit position, and returns number of bits processed, and number of trailing zeros detected if any
+	param x BIG number
+	param x3 BIG number, three times x
+	param i bit position
+	param nbs pointer to integer returning number of bits processed
+	param nzs pointer to integer returning number of trailing 0s
+	return + or - 1, 3 or 5
+*/
+
+/**	@brief  Calculate x=y*z mod n (Variable Time)
+ *
+	Slow method for modular multiplication
+	@param x BIG number, on exit = y*z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modmul(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y/z mod n (Variable Time)
+ *
+	Slow method for modular division
+	@param x BIG number, on exit = y/z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_moddiv(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y^2 mod n (Variable Time)
+ *
+	Slow method for modular squaring
+	@param x BIG number, on exit = y^2 mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modsqr(BIG x, BIG y, BIG n);
+/**	@brief  Calculate x=-y mod n (Variable Time)
+ *
+	Modular negation
+	@param x BIG number, on exit = -y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modneg(BIG x, BIG y, BIG n);
+
+/**	@brief  Calculate x=y+z mod n (Variable Time)
+ *
+	Slow method for modular addition
+	@param x BIG number, on exit = y+z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modadd(BIG x, BIG y, BIG z, BIG n);
+
+/**	@brief  Calculate jacobi Symbol (x/y) (Variable Time)
+ *
+	@param x BIG number
+	@param y BIG number
+	@return Jacobi symbol, -1,0 or 1
+ */
+extern int BIG_jacobi(BIG x, BIG y);
+/**	@brief  Calculate x=1/y mod n (Variable Time)
+ *
+	Modular Inversion - This is slow. Uses binary method.
+	@param x BIG number, on exit = 1/y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_invmodp(BIG x, BIG y, BIG n);
+/** @brief Calculate x=x mod 2^m (Variable Time)
+ *
+	Truncation
+	@param x BIG number, on reduced mod 2^m
+	@param m new truncated size
+*/
+extern void BIG_mod2m(BIG x, int m);
+
+/**	@brief Calculates a*b+c+*d
+ *
+	Calculate partial product of a.b, add in carry c, and add total to d (Constant Time)
+	@param a multiplier
+	@param b multiplicand
+	@param c carry
+	@param d pointer to accumulated bottom half of result
+	@return top half of result
+ */
+
+
+extern int step1(BIG,BIG,BIG);
+extern void step2(BIG,BIG,BIG);
+
+#ifdef dchunk
+
+/* Method required to calculate x*y+c+r, bottom half in r, top half returned */
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    dchunk prod = (dchunk)x * y + c + *r;
+    *r = (chunk)prod & BMASK_B384_28;
+    return (chunk)(prod >> BASEBITS_B384_28);
+}
+
+#else
+
+/* No integer type available that can store double the wordlength */
+/* accumulate partial products */
+
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    chunk x0, x1, y0, y1;
+    chunk bot, top, mid, carry;
+    x0 = x & HMASK_B384_28;
+    x1 = (x >> HBITS_B384_28);
+    y0 = y & HMASK_B384_28;
+    y1 = (y >> HBITS_B384_28);
+    bot = x0 * y0;
+    top = x1 * y1;
+    mid = x0 * y1 + x1 * y0;
+    x0 = mid & HMASK_B384_28;
+    x1 = (mid >> HBITS_B384_28);
+    bot += x0 << HBITS_B384_28;
+    bot += *r;
+    bot += c;
+
+    top += x1;
+    carry = bot >> BASEBITS_B384_28;
+    bot &= BMASK_B384_28;
+    top += carry;
+
+    *r = bot;
+    return top;
+}
+
+#endif
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/big_B384_29.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/big_B384_29.h
new file mode 100644
index 0000000..025822c
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/big_B384_29.h
@@ -0,0 +1,697 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file big.h
+ * @author Mike Scott
+ * @date 23rd February 2016
+ * @brief Big number Header File
+ *
+ *
+ */
+
+#ifndef BIG_B384_29_H
+#define BIG_B384_29_H
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <inttypes.h>
+#include "arch.h"
+#include "core.h"
+#include "config_big_B384_29.h"
+
+using namespace core;
+
+/* could comment this out if code size is a major issue */
+#define UNWOUND
+/* Normally recommended, but may not be optimal for some architectures, for example 32-bit ARM M4 */
+#define USE_KARATSUBA
+
+#define BIGBITS_B384_29 (8*MODBYTES_B384_29)
+#define NLEN_B384_29 (1+((8*MODBYTES_B384_29-1)/BASEBITS_B384_29))
+#define DNLEN_B384_29 2*NLEN_B384_29
+#define BMASK_B384_29 (((chunk)1<<BASEBITS_B384_29)-1) /**< Mask = 2^BASEBITS-1 */
+#define NEXCESS_B384_29 (1<<(CHUNK-BASEBITS_B384_29-1))           /**< 2^(CHUNK-BASEBITS-1) - digit cannot be multiplied by more than this before normalisation */
+
+#define HBITS_B384_29 (BASEBITS_B384_29/2)      /**< Number of bits in number base divided by 2 */
+#define HMASK_B384_29 (((chunk)1<<HBITS_B384_29)-1)    /**< Mask = 2^HBITS-1 */
+
+//#define DEBUG_NORM
+
+#ifdef DEBUG_NORM  /* Add an extra location to track chunk extension */
+#define MPV_B384_29 NLEN_B384_29
+#define MNV_B384_29 (NLEN_B384_29+1)
+#define DMPV_B384_29 DNLEN_B384_29
+#define DMNV_B384_29 (DNLEN_B384_29+1)
+
+#endif
+
+namespace B384_29 {
+
+//extern int BIGMULS;
+//extern int BIGSQRS;
+
+#ifdef DEBUG_NORM
+typedef chunk BIG[NLEN_B384_29 + 2]; /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B384_29 + 2]; /**< Define type DBIG as array of chunks */
+#else
+typedef chunk BIG[NLEN_B384_29];     /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B384_29];   /**< Define type DBIG as array of chunks */
+#endif
+
+/* BIG number prototypes */
+
+/**	@brief Tests for BIG equal to zero (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_iszilch(BIG x);
+/**	@brief Tests for BIG equal to one (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if one, else returns 0
+ */
+extern int BIG_isunity(BIG x);
+/**	@brief Tests for DBIG equal to zero (Constant Time)
+ *
+	@param x a DBIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_diszilch(DBIG x);
+/**	@brief Outputs a BIG number to the console (Variable Time)
+ *
+	@param x a BIG number
+ */
+extern void BIG_output(BIG x);
+/**	@brief Outputs a BIG number to the console in raw form (Variable Time for debugging)
+ *
+	@param x a BIG number
+ */
+extern void BIG_rawoutput(BIG x);
+/**	@brief Conditional constant time swap of two BIG numbers
+ *
+	Conditionally swaps parameters in constant time (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s swap takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cswap(BIG x, BIG y, int s);
+/**	@brief Conditional copy of BIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cmove(BIG x, BIG y, int s);
+/**	@brief Conditional copy of DBIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a DBIG number
+	@param y another DBIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_dcmove(BIG x, BIG y, int s);
+/**	@brief Convert from BIG number to byte array (Constant Time)
+ *
+	@param a byte array
+	@param x BIG number
+ */
+extern void BIG_toBytes(char *a, BIG x);
+/**	@brief Convert to BIG number from byte array (Constant Time)
+ *
+	@param x BIG number
+	@param a byte array
+ */
+extern void BIG_fromBytes(BIG x, char *a);
+/**	@brief Convert to BIG number from byte array of given length (Variable Time)
+ *
+	@param x BIG number
+	@param a byte array
+	@param s byte array length
+ */
+extern void BIG_fromBytesLen(BIG x, char *a, int s);
+/**@brief Convert to DBIG number from byte array of given length (Variable Time)
+ *
+   @param x DBIG number
+   @param a byte array
+   @param s byte array length
+ */
+extern void BIG_dfromBytesLen(DBIG x, char *a, int s);
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_doutput(DBIG x); 
+
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_drawoutput(DBIG x);
+
+/**	@brief Copy BIG from Read-Only Memory to a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number in ROM
+ */
+extern void BIG_rcopy(BIG x, const BIG y);
+/**	@brief Copy BIG to another BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_copy(BIG x, BIG y);
+/**	@brief Copy DBIG to another DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_dcopy(DBIG x, DBIG y);
+/**	@brief Copy BIG to upper half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dsucopy(DBIG x, BIG y);
+/**	@brief Copy BIG to lower half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dscopy(DBIG x, BIG y);
+/**	@brief Copy lower half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sdcopy(BIG x, DBIG y);
+/**	@brief Copy upper half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sducopy(BIG x, DBIG y);
+/**	@brief Set BIG to zero (Constant Time)
+ *
+	@param x BIG number to be set to zero  
+ */
+extern void BIG_zero(BIG x);
+/**	@brief Set DBIG to zero (Constant Time)
+ *
+	@param x DBIG number to be set to zero
+ */
+extern void BIG_dzero(DBIG x);
+/**	@brief Set BIG to one (unity) (Constant Time)
+ *
+	@param x BIG number to be set to one.
+ */
+extern void BIG_one(BIG x);
+/**	@brief Set BIG to inverse mod 2^256 (Constant Time)
+ *
+	@param x BIG number to be inverted
+ */
+extern void BIG_invmod2m(BIG x);
+/**	@brief Set BIG to sum of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, sum of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_add(BIG x, BIG y, BIG z);
+
+/**	@brief Set BIG to logical or of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, or of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_or(BIG x, BIG y, BIG z);
+
+/**	@brief Increment BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be incremented
+	@param i integer
+ */
+extern void BIG_inc(BIG x, int i);
+/**	@brief Set BIG to difference of two BIGs (Constant Time)
+ *
+	@param x BIG number, difference of other two - output not normalised
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_sub(BIG x, BIG y, BIG z);
+/**	@brief Decrement BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be decremented
+	@param i integer
+ */
+extern void BIG_dec(BIG x, int i);
+/**	@brief Set DBIG to sum of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, sum of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dadd(DBIG x, DBIG y, DBIG z);
+/**	@brief Set DBIG to difference of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, difference of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dsub(DBIG x, DBIG y, DBIG z);
+/**	@brief Multiply BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_imul(BIG x, BIG y, int i);
+/**	@brief Multiply BIG by not-so-small small integer - output normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+	@return Overflowing bits
+ */
+extern chunk BIG_pmul(BIG x, BIG y, int i);
+/**	@brief Divide BIG by 3 - output normalised (Constant Time)
+ *
+	@param x BIG number
+	@return Remainder
+ */
+extern int BIG_div3(BIG x);
+/**	@brief Multiply BIG by even bigger small integer resulting in a DBIG - output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_pxmul(DBIG x, BIG y, int i);
+/**	@brief Multiply BIG by another BIG resulting in DBIG - inputs normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_mul(DBIG x, BIG y, BIG z);
+/**	@brief Multiply BIG by another BIG resulting in another BIG - inputs normalised and output normalised (Constant Time)
+ *
+	Note that the product must fit into a BIG, and x must be distinct from y and z
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_smul(BIG x, BIG y, BIG z);
+/**	@brief Square BIG resulting in a DBIG - input normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, square of a BIG
+	@param y BIG number to be squared
+ */
+extern void BIG_sqr(DBIG x, BIG y);
+
+/**	@brief Montgomery reduction of a DBIG to a BIG  - input normalised and output normalised (Constant Time)
+ *
+	@param a BIG number, reduction of a BIG
+	@param md BIG number, the modulus
+	@param MC the Montgomery Constant
+	@param d DBIG number to be reduced
+ */
+extern void BIG_monty(BIG a, BIG md, chunk MC, DBIG d);
+
+/**	@brief Shifts a BIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shl(BIG x, int s);
+/**	@brief Fast shifts a BIG left by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Overflow bits
+ */
+extern int BIG_fshl(BIG x, int s);
+/**	@brief Shifts a DBIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshl(DBIG x, int s);
+/**	@brief Shifts a BIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shr(BIG x, int s);
+
+
+/**	@brief Fast time-critical combined shift by 1 bit, subtract and normalise (Constant Time)
+ *
+	@param r BIG number normalised output
+	@param a BIG number to be subtracted from
+	@param m BIG number to be shifted and subtracted
+	@return sign of r
+ */
+extern int BIG_ssn(BIG r, BIG a, BIG m);
+
+/**	@brief Fast shifts a BIG right by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Shifted out bits
+ */
+extern int BIG_fshr(BIG x, int s);
+/**	@brief Shifts a DBIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshr(DBIG x, int s);
+/**	@brief Splits a DBIG into two BIGs - input must be normalised, outputs normalised (Constant Time as used)
+ *
+	Internal function. The value of s must be approximately in the middle of the DBIG.
+	Typically used to extract z mod 2^MODBITS and z/2^MODBITS
+	@param x BIG number, top half of z
+	@param y BIG number, bottom half of z
+	@param z DBIG number to be split in two.
+	@param s Bit position at which to split
+	@return carry-out from top half
+ */
+extern chunk BIG_split(BIG x, BIG y, DBIG z, int s);
+/**	@brief Normalizes a BIG number - output normalised (Constant Time)
+ *
+	All digits of the input BIG are reduced mod 2^BASEBITS
+	@param x BIG number to be normalised
+ */
+extern chunk BIG_norm(BIG x);
+/**	@brief Normalizes a DBIG number - output normalised (Constant Time)
+ *
+	All digits of the input DBIG are reduced mod 2^BASEBITS
+	@param x DBIG number to be normalised
+ */
+extern void BIG_dnorm(DBIG x);
+/**	@brief Compares two BIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first BIG number to be compared
+	@param y second BIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_comp(BIG x, BIG y);
+/**	@brief Compares two DBIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first DBIG number to be compared
+	@param y second DBIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_dcomp(DBIG x, DBIG y);
+/**	@brief Calculate number of bits in a BIG - output normalised (Variable Time)
+ *
+	@param x BIG number
+	@return Number of bits in x
+ */
+extern int BIG_nbits(BIG x);
+/**	@brief Calculate number of bits in a DBIG - output normalised (Variable Time)
+ *
+	@param x DBIG number
+	@return Number of bits in x
+ */
+extern int BIG_dnbits(DBIG x);
+
+/**	@brief Reduce x mod n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctmod(BIG x, BIG n, int bd);
+
+/**	@brief  x=y mod n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctdmod(BIG x, DBIG y, BIG n, int bd);
+
+/**	@brief Divide x by n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctsdiv(BIG x,BIG n,int bd);
+
+/**	@brief  x=y/n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctddiv(BIG x, DBIG y, BIG n,int bd);
+
+
+/**	@brief Reduce x mod n - input and output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+ */
+extern void BIG_mod(BIG x, BIG n);
+/**	@brief Divide x by n - output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+ */
+extern void BIG_sdiv(BIG x, BIG n);
+/**	@brief  x=y mod n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_dmod(BIG x, DBIG y, BIG n);
+/**	@brief  x=y/n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_ddiv(BIG x, DBIG y, BIG n);
+/**	@brief  return parity of BIG, that is the least significant bit (Constant Time)
+ *
+	@param x BIG number
+	@return 0 or 1
+ */
+extern int BIG_parity(BIG x);
+/**	@brief  return i-th of BIG (Constant Time)
+ *
+	@param x BIG number
+	@param i the bit of x to be returned
+	@return 0 or 1
+ */
+extern int BIG_bit(BIG x, int i);
+/**	@brief  return least significant bits of a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param n number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int BIG_lastbits(BIG x, int n);
+/**	@brief  Create a random BIG from a random number generator (Constant Time)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_random(BIG x, csprng *r);
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randomnum(BIG x, BIG n, csprng *r);
+
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus and truncated to max bit length (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param t Maximum bit length
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randtrunc(BIG x, BIG n, int t, csprng *r);
+
+/**	brief  return NAF (Non-Adjacent-Form) value as +/- 1, 3 or 5, inputs must be normalised
+ *
+	Given x and 3*x extracts NAF value from given bit position, and returns number of bits processed, and number of trailing zeros detected if any
+	param x BIG number
+	param x3 BIG number, three times x
+	param i bit position
+	param nbs pointer to integer returning number of bits processed
+	param nzs pointer to integer returning number of trailing 0s
+	return + or - 1, 3 or 5
+*/
+
+/**	@brief  Calculate x=y*z mod n (Variable Time)
+ *
+	Slow method for modular multiplication
+	@param x BIG number, on exit = y*z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modmul(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y/z mod n (Variable Time)
+ *
+	Slow method for modular division
+	@param x BIG number, on exit = y/z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_moddiv(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y^2 mod n (Variable Time)
+ *
+	Slow method for modular squaring
+	@param x BIG number, on exit = y^2 mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modsqr(BIG x, BIG y, BIG n);
+/**	@brief  Calculate x=-y mod n (Variable Time)
+ *
+	Modular negation
+	@param x BIG number, on exit = -y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modneg(BIG x, BIG y, BIG n);
+
+/**	@brief  Calculate x=y+z mod n (Variable Time)
+ *
+	Slow method for modular addition
+	@param x BIG number, on exit = y+z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modadd(BIG x, BIG y, BIG z, BIG n);
+
+/**	@brief  Calculate jacobi Symbol (x/y) (Variable Time)
+ *
+	@param x BIG number
+	@param y BIG number
+	@return Jacobi symbol, -1,0 or 1
+ */
+extern int BIG_jacobi(BIG x, BIG y);
+/**	@brief  Calculate x=1/y mod n (Variable Time)
+ *
+	Modular Inversion - This is slow. Uses binary method.
+	@param x BIG number, on exit = 1/y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_invmodp(BIG x, BIG y, BIG n);
+/** @brief Calculate x=x mod 2^m (Variable Time)
+ *
+	Truncation
+	@param x BIG number, on reduced mod 2^m
+	@param m new truncated size
+*/
+extern void BIG_mod2m(BIG x, int m);
+
+/**	@brief Calculates a*b+c+*d
+ *
+	Calculate partial product of a.b, add in carry c, and add total to d (Constant Time)
+	@param a multiplier
+	@param b multiplicand
+	@param c carry
+	@param d pointer to accumulated bottom half of result
+	@return top half of result
+ */
+
+
+extern int step1(BIG,BIG,BIG);
+extern void step2(BIG,BIG,BIG);
+
+#ifdef dchunk
+
+/* Method required to calculate x*y+c+r, bottom half in r, top half returned */
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    dchunk prod = (dchunk)x * y + c + *r;
+    *r = (chunk)prod & BMASK_B384_29;
+    return (chunk)(prod >> BASEBITS_B384_29);
+}
+
+#else
+
+/* No integer type available that can store double the wordlength */
+/* accumulate partial products */
+
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    chunk x0, x1, y0, y1;
+    chunk bot, top, mid, carry;
+    x0 = x & HMASK_B384_29;
+    x1 = (x >> HBITS_B384_29);
+    y0 = y & HMASK_B384_29;
+    y1 = (y >> HBITS_B384_29);
+    bot = x0 * y0;
+    top = x1 * y1;
+    mid = x0 * y1 + x1 * y0;
+    x0 = mid & HMASK_B384_29;
+    x1 = (mid >> HBITS_B384_29);
+    bot += x0 << HBITS_B384_29;
+    bot += *r;
+    bot += c;
+
+    top += x1;
+    carry = bot >> BASEBITS_B384_29;
+    bot &= BMASK_B384_29;
+    top += carry;
+
+    *r = bot;
+    return top;
+}
+
+#endif
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/big_B416_29.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/big_B416_29.h
new file mode 100644
index 0000000..1956380
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/big_B416_29.h
@@ -0,0 +1,697 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file big.h
+ * @author Mike Scott
+ * @date 23rd February 2016
+ * @brief Big number Header File
+ *
+ *
+ */
+
+#ifndef BIG_B416_29_H
+#define BIG_B416_29_H
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <inttypes.h>
+#include "arch.h"
+#include "core.h"
+#include "config_big_B416_29.h"
+
+using namespace core;
+
+/* could comment this out if code size is a major issue */
+#define UNWOUND
+/* Normally recommended, but may not be optimal for some architectures, for example 32-bit ARM M4 */
+#define USE_KARATSUBA
+
+#define BIGBITS_B416_29 (8*MODBYTES_B416_29)
+#define NLEN_B416_29 (1+((8*MODBYTES_B416_29-1)/BASEBITS_B416_29))
+#define DNLEN_B416_29 2*NLEN_B416_29
+#define BMASK_B416_29 (((chunk)1<<BASEBITS_B416_29)-1) /**< Mask = 2^BASEBITS-1 */
+#define NEXCESS_B416_29 (1<<(CHUNK-BASEBITS_B416_29-1))           /**< 2^(CHUNK-BASEBITS-1) - digit cannot be multiplied by more than this before normalisation */
+
+#define HBITS_B416_29 (BASEBITS_B416_29/2)      /**< Number of bits in number base divided by 2 */
+#define HMASK_B416_29 (((chunk)1<<HBITS_B416_29)-1)    /**< Mask = 2^HBITS-1 */
+
+//#define DEBUG_NORM
+
+#ifdef DEBUG_NORM  /* Add an extra location to track chunk extension */
+#define MPV_B416_29 NLEN_B416_29
+#define MNV_B416_29 (NLEN_B416_29+1)
+#define DMPV_B416_29 DNLEN_B416_29
+#define DMNV_B416_29 (DNLEN_B416_29+1)
+
+#endif
+
+namespace B416_29 {
+
+//extern int BIGMULS;
+//extern int BIGSQRS;
+
+#ifdef DEBUG_NORM
+typedef chunk BIG[NLEN_B416_29 + 2]; /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B416_29 + 2]; /**< Define type DBIG as array of chunks */
+#else
+typedef chunk BIG[NLEN_B416_29];     /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B416_29];   /**< Define type DBIG as array of chunks */
+#endif
+
+/* BIG number prototypes */
+
+/**	@brief Tests for BIG equal to zero (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_iszilch(BIG x);
+/**	@brief Tests for BIG equal to one (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if one, else returns 0
+ */
+extern int BIG_isunity(BIG x);
+/**	@brief Tests for DBIG equal to zero (Constant Time)
+ *
+	@param x a DBIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_diszilch(DBIG x);
+/**	@brief Outputs a BIG number to the console (Variable Time)
+ *
+	@param x a BIG number
+ */
+extern void BIG_output(BIG x);
+/**	@brief Outputs a BIG number to the console in raw form (Variable Time for debugging)
+ *
+	@param x a BIG number
+ */
+extern void BIG_rawoutput(BIG x);
+/**	@brief Conditional constant time swap of two BIG numbers
+ *
+	Conditionally swaps parameters in constant time (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s swap takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cswap(BIG x, BIG y, int s);
+/**	@brief Conditional copy of BIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cmove(BIG x, BIG y, int s);
+/**	@brief Conditional copy of DBIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a DBIG number
+	@param y another DBIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_dcmove(BIG x, BIG y, int s);
+/**	@brief Convert from BIG number to byte array (Constant Time)
+ *
+	@param a byte array
+	@param x BIG number
+ */
+extern void BIG_toBytes(char *a, BIG x);
+/**	@brief Convert to BIG number from byte array (Constant Time)
+ *
+	@param x BIG number
+	@param a byte array
+ */
+extern void BIG_fromBytes(BIG x, char *a);
+/**	@brief Convert to BIG number from byte array of given length (Variable Time)
+ *
+	@param x BIG number
+	@param a byte array
+	@param s byte array length
+ */
+extern void BIG_fromBytesLen(BIG x, char *a, int s);
+/**@brief Convert to DBIG number from byte array of given length (Variable Time)
+ *
+   @param x DBIG number
+   @param a byte array
+   @param s byte array length
+ */
+extern void BIG_dfromBytesLen(DBIG x, char *a, int s);
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_doutput(DBIG x); 
+
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_drawoutput(DBIG x);
+
+/**	@brief Copy BIG from Read-Only Memory to a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number in ROM
+ */
+extern void BIG_rcopy(BIG x, const BIG y);
+/**	@brief Copy BIG to another BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_copy(BIG x, BIG y);
+/**	@brief Copy DBIG to another DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_dcopy(DBIG x, DBIG y);
+/**	@brief Copy BIG to upper half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dsucopy(DBIG x, BIG y);
+/**	@brief Copy BIG to lower half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dscopy(DBIG x, BIG y);
+/**	@brief Copy lower half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sdcopy(BIG x, DBIG y);
+/**	@brief Copy upper half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sducopy(BIG x, DBIG y);
+/**	@brief Set BIG to zero (Constant Time)
+ *
+	@param x BIG number to be set to zero  
+ */
+extern void BIG_zero(BIG x);
+/**	@brief Set DBIG to zero (Constant Time)
+ *
+	@param x DBIG number to be set to zero
+ */
+extern void BIG_dzero(DBIG x);
+/**	@brief Set BIG to one (unity) (Constant Time)
+ *
+	@param x BIG number to be set to one.
+ */
+extern void BIG_one(BIG x);
+/**	@brief Set BIG to inverse mod 2^256 (Constant Time)
+ *
+	@param x BIG number to be inverted
+ */
+extern void BIG_invmod2m(BIG x);
+/**	@brief Set BIG to sum of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, sum of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_add(BIG x, BIG y, BIG z);
+
+/**	@brief Set BIG to logical or of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, or of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_or(BIG x, BIG y, BIG z);
+
+/**	@brief Increment BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be incremented
+	@param i integer
+ */
+extern void BIG_inc(BIG x, int i);
+/**	@brief Set BIG to difference of two BIGs (Constant Time)
+ *
+	@param x BIG number, difference of other two - output not normalised
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_sub(BIG x, BIG y, BIG z);
+/**	@brief Decrement BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be decremented
+	@param i integer
+ */
+extern void BIG_dec(BIG x, int i);
+/**	@brief Set DBIG to sum of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, sum of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dadd(DBIG x, DBIG y, DBIG z);
+/**	@brief Set DBIG to difference of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, difference of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dsub(DBIG x, DBIG y, DBIG z);
+/**	@brief Multiply BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_imul(BIG x, BIG y, int i);
+/**	@brief Multiply BIG by not-so-small small integer - output normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+	@return Overflowing bits
+ */
+extern chunk BIG_pmul(BIG x, BIG y, int i);
+/**	@brief Divide BIG by 3 - output normalised (Constant Time)
+ *
+	@param x BIG number
+	@return Remainder
+ */
+extern int BIG_div3(BIG x);
+/**	@brief Multiply BIG by even bigger small integer resulting in a DBIG - output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_pxmul(DBIG x, BIG y, int i);
+/**	@brief Multiply BIG by another BIG resulting in DBIG - inputs normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_mul(DBIG x, BIG y, BIG z);
+/**	@brief Multiply BIG by another BIG resulting in another BIG - inputs normalised and output normalised (Constant Time)
+ *
+	Note that the product must fit into a BIG, and x must be distinct from y and z
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_smul(BIG x, BIG y, BIG z);
+/**	@brief Square BIG resulting in a DBIG - input normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, square of a BIG
+	@param y BIG number to be squared
+ */
+extern void BIG_sqr(DBIG x, BIG y);
+
+/**	@brief Montgomery reduction of a DBIG to a BIG  - input normalised and output normalised (Constant Time)
+ *
+	@param a BIG number, reduction of a BIG
+	@param md BIG number, the modulus
+	@param MC the Montgomery Constant
+	@param d DBIG number to be reduced
+ */
+extern void BIG_monty(BIG a, BIG md, chunk MC, DBIG d);
+
+/**	@brief Shifts a BIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shl(BIG x, int s);
+/**	@brief Fast shifts a BIG left by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Overflow bits
+ */
+extern int BIG_fshl(BIG x, int s);
+/**	@brief Shifts a DBIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshl(DBIG x, int s);
+/**	@brief Shifts a BIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shr(BIG x, int s);
+
+
+/**	@brief Fast time-critical combined shift by 1 bit, subtract and normalise (Constant Time)
+ *
+	@param r BIG number normalised output
+	@param a BIG number to be subtracted from
+	@param m BIG number to be shifted and subtracted
+	@return sign of r
+ */
+extern int BIG_ssn(BIG r, BIG a, BIG m);
+
+/**	@brief Fast shifts a BIG right by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Shifted out bits
+ */
+extern int BIG_fshr(BIG x, int s);
+/**	@brief Shifts a DBIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshr(DBIG x, int s);
+/**	@brief Splits a DBIG into two BIGs - input must be normalised, outputs normalised (Constant Time as used)
+ *
+	Internal function. The value of s must be approximately in the middle of the DBIG.
+	Typically used to extract z mod 2^MODBITS and z/2^MODBITS
+	@param x BIG number, top half of z
+	@param y BIG number, bottom half of z
+	@param z DBIG number to be split in two.
+	@param s Bit position at which to split
+	@return carry-out from top half
+ */
+extern chunk BIG_split(BIG x, BIG y, DBIG z, int s);
+/**	@brief Normalizes a BIG number - output normalised (Constant Time)
+ *
+	All digits of the input BIG are reduced mod 2^BASEBITS
+	@param x BIG number to be normalised
+ */
+extern chunk BIG_norm(BIG x);
+/**	@brief Normalizes a DBIG number - output normalised (Constant Time)
+ *
+	All digits of the input DBIG are reduced mod 2^BASEBITS
+	@param x DBIG number to be normalised
+ */
+extern void BIG_dnorm(DBIG x);
+/**	@brief Compares two BIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first BIG number to be compared
+	@param y second BIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_comp(BIG x, BIG y);
+/**	@brief Compares two DBIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first DBIG number to be compared
+	@param y second DBIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_dcomp(DBIG x, DBIG y);
+/**	@brief Calculate number of bits in a BIG - output normalised (Variable Time)
+ *
+	@param x BIG number
+	@return Number of bits in x
+ */
+extern int BIG_nbits(BIG x);
+/**	@brief Calculate number of bits in a DBIG - output normalised (Variable Time)
+ *
+	@param x DBIG number
+	@return Number of bits in x
+ */
+extern int BIG_dnbits(DBIG x);
+
+/**	@brief Reduce x mod n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctmod(BIG x, BIG n, int bd);
+
+/**	@brief  x=y mod n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctdmod(BIG x, DBIG y, BIG n, int bd);
+
+/**	@brief Divide x by n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctsdiv(BIG x,BIG n,int bd);
+
+/**	@brief  x=y/n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctddiv(BIG x, DBIG y, BIG n,int bd);
+
+
+/**	@brief Reduce x mod n - input and output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+ */
+extern void BIG_mod(BIG x, BIG n);
+/**	@brief Divide x by n - output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+ */
+extern void BIG_sdiv(BIG x, BIG n);
+/**	@brief  x=y mod n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_dmod(BIG x, DBIG y, BIG n);
+/**	@brief  x=y/n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_ddiv(BIG x, DBIG y, BIG n);
+/**	@brief  return parity of BIG, that is the least significant bit (Constant Time)
+ *
+	@param x BIG number
+	@return 0 or 1
+ */
+extern int BIG_parity(BIG x);
+/**	@brief  return i-th of BIG (Constant Time)
+ *
+	@param x BIG number
+	@param i the bit of x to be returned
+	@return 0 or 1
+ */
+extern int BIG_bit(BIG x, int i);
+/**	@brief  return least significant bits of a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param n number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int BIG_lastbits(BIG x, int n);
+/**	@brief  Create a random BIG from a random number generator (Constant Time)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_random(BIG x, csprng *r);
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randomnum(BIG x, BIG n, csprng *r);
+
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus and truncated to max bit length (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param t Maximum bit length
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randtrunc(BIG x, BIG n, int t, csprng *r);
+
+/**	brief  return NAF (Non-Adjacent-Form) value as +/- 1, 3 or 5, inputs must be normalised
+ *
+	Given x and 3*x extracts NAF value from given bit position, and returns number of bits processed, and number of trailing zeros detected if any
+	param x BIG number
+	param x3 BIG number, three times x
+	param i bit position
+	param nbs pointer to integer returning number of bits processed
+	param nzs pointer to integer returning number of trailing 0s
+	return + or - 1, 3 or 5
+*/
+
+/**	@brief  Calculate x=y*z mod n (Variable Time)
+ *
+	Slow method for modular multiplication
+	@param x BIG number, on exit = y*z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modmul(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y/z mod n (Variable Time)
+ *
+	Slow method for modular division
+	@param x BIG number, on exit = y/z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_moddiv(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y^2 mod n (Variable Time)
+ *
+	Slow method for modular squaring
+	@param x BIG number, on exit = y^2 mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modsqr(BIG x, BIG y, BIG n);
+/**	@brief  Calculate x=-y mod n (Variable Time)
+ *
+	Modular negation
+	@param x BIG number, on exit = -y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modneg(BIG x, BIG y, BIG n);
+
+/**	@brief  Calculate x=y+z mod n (Variable Time)
+ *
+	Slow method for modular addition
+	@param x BIG number, on exit = y+z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modadd(BIG x, BIG y, BIG z, BIG n);
+
+/**	@brief  Calculate jacobi Symbol (x/y) (Variable Time)
+ *
+	@param x BIG number
+	@param y BIG number
+	@return Jacobi symbol, -1,0 or 1
+ */
+extern int BIG_jacobi(BIG x, BIG y);
+/**	@brief  Calculate x=1/y mod n (Variable Time)
+ *
+	Modular Inversion - This is slow. Uses binary method.
+	@param x BIG number, on exit = 1/y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_invmodp(BIG x, BIG y, BIG n);
+/** @brief Calculate x=x mod 2^m (Variable Time)
+ *
+	Truncation
+	@param x BIG number, on reduced mod 2^m
+	@param m new truncated size
+*/
+extern void BIG_mod2m(BIG x, int m);
+
+/**	@brief Calculates a*b+c+*d
+ *
+	Calculate partial product of a.b, add in carry c, and add total to d (Constant Time)
+	@param a multiplier
+	@param b multiplicand
+	@param c carry
+	@param d pointer to accumulated bottom half of result
+	@return top half of result
+ */
+
+
+extern int step1(BIG,BIG,BIG);
+extern void step2(BIG,BIG,BIG);
+
+#ifdef dchunk
+
+/* Method required to calculate x*y+c+r, bottom half in r, top half returned */
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    dchunk prod = (dchunk)x * y + c + *r;
+    *r = (chunk)prod & BMASK_B416_29;
+    return (chunk)(prod >> BASEBITS_B416_29);
+}
+
+#else
+
+/* No integer type available that can store double the wordlength */
+/* accumulate partial products */
+
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    chunk x0, x1, y0, y1;
+    chunk bot, top, mid, carry;
+    x0 = x & HMASK_B416_29;
+    x1 = (x >> HBITS_B416_29);
+    y0 = y & HMASK_B416_29;
+    y1 = (y >> HBITS_B416_29);
+    bot = x0 * y0;
+    top = x1 * y1;
+    mid = x0 * y1 + x1 * y0;
+    x0 = mid & HMASK_B416_29;
+    x1 = (mid >> HBITS_B416_29);
+    bot += x0 << HBITS_B416_29;
+    bot += *r;
+    bot += c;
+
+    top += x1;
+    carry = bot >> BASEBITS_B416_29;
+    bot &= BMASK_B416_29;
+    top += carry;
+
+    *r = bot;
+    return top;
+}
+
+#endif
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/big_B448_29.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/big_B448_29.h
new file mode 100644
index 0000000..c47f0a2
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/big_B448_29.h
@@ -0,0 +1,697 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file big.h
+ * @author Mike Scott
+ * @date 23rd February 2016
+ * @brief Big number Header File
+ *
+ *
+ */
+
+#ifndef BIG_B448_29_H
+#define BIG_B448_29_H
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <inttypes.h>
+#include "arch.h"
+#include "core.h"
+#include "config_big_B448_29.h"
+
+using namespace core;
+
+/* could comment this out if code size is a major issue */
+#define UNWOUND
+/* Normally recommended, but may not be optimal for some architectures, for example 32-bit ARM M4 */
+#define USE_KARATSUBA
+
+#define BIGBITS_B448_29 (8*MODBYTES_B448_29)
+#define NLEN_B448_29 (1+((8*MODBYTES_B448_29-1)/BASEBITS_B448_29))
+#define DNLEN_B448_29 2*NLEN_B448_29
+#define BMASK_B448_29 (((chunk)1<<BASEBITS_B448_29)-1) /**< Mask = 2^BASEBITS-1 */
+#define NEXCESS_B448_29 (1<<(CHUNK-BASEBITS_B448_29-1))           /**< 2^(CHUNK-BASEBITS-1) - digit cannot be multiplied by more than this before normalisation */
+
+#define HBITS_B448_29 (BASEBITS_B448_29/2)      /**< Number of bits in number base divided by 2 */
+#define HMASK_B448_29 (((chunk)1<<HBITS_B448_29)-1)    /**< Mask = 2^HBITS-1 */
+
+//#define DEBUG_NORM
+
+#ifdef DEBUG_NORM  /* Add an extra location to track chunk extension */
+#define MPV_B448_29 NLEN_B448_29
+#define MNV_B448_29 (NLEN_B448_29+1)
+#define DMPV_B448_29 DNLEN_B448_29
+#define DMNV_B448_29 (DNLEN_B448_29+1)
+
+#endif
+
+namespace B448_29 {
+
+//extern int BIGMULS;
+//extern int BIGSQRS;
+
+#ifdef DEBUG_NORM
+typedef chunk BIG[NLEN_B448_29 + 2]; /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B448_29 + 2]; /**< Define type DBIG as array of chunks */
+#else
+typedef chunk BIG[NLEN_B448_29];     /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B448_29];   /**< Define type DBIG as array of chunks */
+#endif
+
+/* BIG number prototypes */
+
+/**	@brief Tests for BIG equal to zero (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_iszilch(BIG x);
+/**	@brief Tests for BIG equal to one (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if one, else returns 0
+ */
+extern int BIG_isunity(BIG x);
+/**	@brief Tests for DBIG equal to zero (Constant Time)
+ *
+	@param x a DBIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_diszilch(DBIG x);
+/**	@brief Outputs a BIG number to the console (Variable Time)
+ *
+	@param x a BIG number
+ */
+extern void BIG_output(BIG x);
+/**	@brief Outputs a BIG number to the console in raw form (Variable Time for debugging)
+ *
+	@param x a BIG number
+ */
+extern void BIG_rawoutput(BIG x);
+/**	@brief Conditional constant time swap of two BIG numbers
+ *
+	Conditionally swaps parameters in constant time (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s swap takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cswap(BIG x, BIG y, int s);
+/**	@brief Conditional copy of BIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cmove(BIG x, BIG y, int s);
+/**	@brief Conditional copy of DBIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a DBIG number
+	@param y another DBIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_dcmove(BIG x, BIG y, int s);
+/**	@brief Convert from BIG number to byte array (Constant Time)
+ *
+	@param a byte array
+	@param x BIG number
+ */
+extern void BIG_toBytes(char *a, BIG x);
+/**	@brief Convert to BIG number from byte array (Constant Time)
+ *
+	@param x BIG number
+	@param a byte array
+ */
+extern void BIG_fromBytes(BIG x, char *a);
+/**	@brief Convert to BIG number from byte array of given length (Variable Time)
+ *
+	@param x BIG number
+	@param a byte array
+	@param s byte array length
+ */
+extern void BIG_fromBytesLen(BIG x, char *a, int s);
+/**@brief Convert to DBIG number from byte array of given length (Variable Time)
+ *
+   @param x DBIG number
+   @param a byte array
+   @param s byte array length
+ */
+extern void BIG_dfromBytesLen(DBIG x, char *a, int s);
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_doutput(DBIG x); 
+
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_drawoutput(DBIG x);
+
+/**	@brief Copy BIG from Read-Only Memory to a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number in ROM
+ */
+extern void BIG_rcopy(BIG x, const BIG y);
+/**	@brief Copy BIG to another BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_copy(BIG x, BIG y);
+/**	@brief Copy DBIG to another DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_dcopy(DBIG x, DBIG y);
+/**	@brief Copy BIG to upper half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dsucopy(DBIG x, BIG y);
+/**	@brief Copy BIG to lower half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dscopy(DBIG x, BIG y);
+/**	@brief Copy lower half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sdcopy(BIG x, DBIG y);
+/**	@brief Copy upper half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sducopy(BIG x, DBIG y);
+/**	@brief Set BIG to zero (Constant Time)
+ *
+	@param x BIG number to be set to zero  
+ */
+extern void BIG_zero(BIG x);
+/**	@brief Set DBIG to zero (Constant Time)
+ *
+	@param x DBIG number to be set to zero
+ */
+extern void BIG_dzero(DBIG x);
+/**	@brief Set BIG to one (unity) (Constant Time)
+ *
+	@param x BIG number to be set to one.
+ */
+extern void BIG_one(BIG x);
+/**	@brief Set BIG to inverse mod 2^256 (Constant Time)
+ *
+	@param x BIG number to be inverted
+ */
+extern void BIG_invmod2m(BIG x);
+/**	@brief Set BIG to sum of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, sum of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_add(BIG x, BIG y, BIG z);
+
+/**	@brief Set BIG to logical or of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, or of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_or(BIG x, BIG y, BIG z);
+
+/**	@brief Increment BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be incremented
+	@param i integer
+ */
+extern void BIG_inc(BIG x, int i);
+/**	@brief Set BIG to difference of two BIGs (Constant Time)
+ *
+	@param x BIG number, difference of other two - output not normalised
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_sub(BIG x, BIG y, BIG z);
+/**	@brief Decrement BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be decremented
+	@param i integer
+ */
+extern void BIG_dec(BIG x, int i);
+/**	@brief Set DBIG to sum of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, sum of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dadd(DBIG x, DBIG y, DBIG z);
+/**	@brief Set DBIG to difference of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, difference of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dsub(DBIG x, DBIG y, DBIG z);
+/**	@brief Multiply BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_imul(BIG x, BIG y, int i);
+/**	@brief Multiply BIG by not-so-small small integer - output normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+	@return Overflowing bits
+ */
+extern chunk BIG_pmul(BIG x, BIG y, int i);
+/**	@brief Divide BIG by 3 - output normalised (Constant Time)
+ *
+	@param x BIG number
+	@return Remainder
+ */
+extern int BIG_div3(BIG x);
+/**	@brief Multiply BIG by even bigger small integer resulting in a DBIG - output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_pxmul(DBIG x, BIG y, int i);
+/**	@brief Multiply BIG by another BIG resulting in DBIG - inputs normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_mul(DBIG x, BIG y, BIG z);
+/**	@brief Multiply BIG by another BIG resulting in another BIG - inputs normalised and output normalised (Constant Time)
+ *
+	Note that the product must fit into a BIG, and x must be distinct from y and z
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_smul(BIG x, BIG y, BIG z);
+/**	@brief Square BIG resulting in a DBIG - input normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, square of a BIG
+	@param y BIG number to be squared
+ */
+extern void BIG_sqr(DBIG x, BIG y);
+
+/**	@brief Montgomery reduction of a DBIG to a BIG  - input normalised and output normalised (Constant Time)
+ *
+	@param a BIG number, reduction of a BIG
+	@param md BIG number, the modulus
+	@param MC the Montgomery Constant
+	@param d DBIG number to be reduced
+ */
+extern void BIG_monty(BIG a, BIG md, chunk MC, DBIG d);
+
+/**	@brief Shifts a BIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shl(BIG x, int s);
+/**	@brief Fast shifts a BIG left by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Overflow bits
+ */
+extern int BIG_fshl(BIG x, int s);
+/**	@brief Shifts a DBIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshl(DBIG x, int s);
+/**	@brief Shifts a BIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shr(BIG x, int s);
+
+
+/**	@brief Fast time-critical combined shift by 1 bit, subtract and normalise (Constant Time)
+ *
+	@param r BIG number normalised output
+	@param a BIG number to be subtracted from
+	@param m BIG number to be shifted and subtracted
+	@return sign of r
+ */
+extern int BIG_ssn(BIG r, BIG a, BIG m);
+
+/**	@brief Fast shifts a BIG right by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Shifted out bits
+ */
+extern int BIG_fshr(BIG x, int s);
+/**	@brief Shifts a DBIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshr(DBIG x, int s);
+/**	@brief Splits a DBIG into two BIGs - input must be normalised, outputs normalised (Constant Time as used)
+ *
+	Internal function. The value of s must be approximately in the middle of the DBIG.
+	Typically used to extract z mod 2^MODBITS and z/2^MODBITS
+	@param x BIG number, top half of z
+	@param y BIG number, bottom half of z
+	@param z DBIG number to be split in two.
+	@param s Bit position at which to split
+	@return carry-out from top half
+ */
+extern chunk BIG_split(BIG x, BIG y, DBIG z, int s);
+/**	@brief Normalizes a BIG number - output normalised (Constant Time)
+ *
+	All digits of the input BIG are reduced mod 2^BASEBITS
+	@param x BIG number to be normalised
+ */
+extern chunk BIG_norm(BIG x);
+/**	@brief Normalizes a DBIG number - output normalised (Constant Time)
+ *
+	All digits of the input DBIG are reduced mod 2^BASEBITS
+	@param x DBIG number to be normalised
+ */
+extern void BIG_dnorm(DBIG x);
+/**	@brief Compares two BIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first BIG number to be compared
+	@param y second BIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_comp(BIG x, BIG y);
+/**	@brief Compares two DBIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first DBIG number to be compared
+	@param y second DBIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_dcomp(DBIG x, DBIG y);
+/**	@brief Calculate number of bits in a BIG - output normalised (Variable Time)
+ *
+	@param x BIG number
+	@return Number of bits in x
+ */
+extern int BIG_nbits(BIG x);
+/**	@brief Calculate number of bits in a DBIG - output normalised (Variable Time)
+ *
+	@param x DBIG number
+	@return Number of bits in x
+ */
+extern int BIG_dnbits(DBIG x);
+
+/**	@brief Reduce x mod n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctmod(BIG x, BIG n, int bd);
+
+/**	@brief  x=y mod n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctdmod(BIG x, DBIG y, BIG n, int bd);
+
+/**	@brief Divide x by n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctsdiv(BIG x,BIG n,int bd);
+
+/**	@brief  x=y/n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctddiv(BIG x, DBIG y, BIG n,int bd);
+
+
+/**	@brief Reduce x mod n - input and output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+ */
+extern void BIG_mod(BIG x, BIG n);
+/**	@brief Divide x by n - output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+ */
+extern void BIG_sdiv(BIG x, BIG n);
+/**	@brief  x=y mod n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_dmod(BIG x, DBIG y, BIG n);
+/**	@brief  x=y/n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_ddiv(BIG x, DBIG y, BIG n);
+/**	@brief  return parity of BIG, that is the least significant bit (Constant Time)
+ *
+	@param x BIG number
+	@return 0 or 1
+ */
+extern int BIG_parity(BIG x);
+/**	@brief  return i-th of BIG (Constant Time)
+ *
+	@param x BIG number
+	@param i the bit of x to be returned
+	@return 0 or 1
+ */
+extern int BIG_bit(BIG x, int i);
+/**	@brief  return least significant bits of a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param n number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int BIG_lastbits(BIG x, int n);
+/**	@brief  Create a random BIG from a random number generator (Constant Time)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_random(BIG x, csprng *r);
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randomnum(BIG x, BIG n, csprng *r);
+
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus and truncated to max bit length (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param t Maximum bit length
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randtrunc(BIG x, BIG n, int t, csprng *r);
+
+/**	brief  return NAF (Non-Adjacent-Form) value as +/- 1, 3 or 5, inputs must be normalised
+ *
+	Given x and 3*x extracts NAF value from given bit position, and returns number of bits processed, and number of trailing zeros detected if any
+	param x BIG number
+	param x3 BIG number, three times x
+	param i bit position
+	param nbs pointer to integer returning number of bits processed
+	param nzs pointer to integer returning number of trailing 0s
+	return + or - 1, 3 or 5
+*/
+
+/**	@brief  Calculate x=y*z mod n (Variable Time)
+ *
+	Slow method for modular multiplication
+	@param x BIG number, on exit = y*z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modmul(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y/z mod n (Variable Time)
+ *
+	Slow method for modular division
+	@param x BIG number, on exit = y/z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_moddiv(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y^2 mod n (Variable Time)
+ *
+	Slow method for modular squaring
+	@param x BIG number, on exit = y^2 mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modsqr(BIG x, BIG y, BIG n);
+/**	@brief  Calculate x=-y mod n (Variable Time)
+ *
+	Modular negation
+	@param x BIG number, on exit = -y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modneg(BIG x, BIG y, BIG n);
+
+/**	@brief  Calculate x=y+z mod n (Variable Time)
+ *
+	Slow method for modular addition
+	@param x BIG number, on exit = y+z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modadd(BIG x, BIG y, BIG z, BIG n);
+
+/**	@brief  Calculate jacobi Symbol (x/y) (Variable Time)
+ *
+	@param x BIG number
+	@param y BIG number
+	@return Jacobi symbol, -1,0 or 1
+ */
+extern int BIG_jacobi(BIG x, BIG y);
+/**	@brief  Calculate x=1/y mod n (Variable Time)
+ *
+	Modular Inversion - This is slow. Uses binary method.
+	@param x BIG number, on exit = 1/y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_invmodp(BIG x, BIG y, BIG n);
+/** @brief Calculate x=x mod 2^m (Variable Time)
+ *
+	Truncation
+	@param x BIG number, on reduced mod 2^m
+	@param m new truncated size
+*/
+extern void BIG_mod2m(BIG x, int m);
+
+/**	@brief Calculates a*b+c+*d
+ *
+	Calculate partial product of a.b, add in carry c, and add total to d (Constant Time)
+	@param a multiplier
+	@param b multiplicand
+	@param c carry
+	@param d pointer to accumulated bottom half of result
+	@return top half of result
+ */
+
+
+extern int step1(BIG,BIG,BIG);
+extern void step2(BIG,BIG,BIG);
+
+#ifdef dchunk
+
+/* Method required to calculate x*y+c+r, bottom half in r, top half returned */
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    dchunk prod = (dchunk)x * y + c + *r;
+    *r = (chunk)prod & BMASK_B448_29;
+    return (chunk)(prod >> BASEBITS_B448_29);
+}
+
+#else
+
+/* No integer type available that can store double the wordlength */
+/* accumulate partial products */
+
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    chunk x0, x1, y0, y1;
+    chunk bot, top, mid, carry;
+    x0 = x & HMASK_B448_29;
+    x1 = (x >> HBITS_B448_29);
+    y0 = y & HMASK_B448_29;
+    y1 = (y >> HBITS_B448_29);
+    bot = x0 * y0;
+    top = x1 * y1;
+    mid = x0 * y1 + x1 * y0;
+    x0 = mid & HMASK_B448_29;
+    x1 = (mid >> HBITS_B448_29);
+    bot += x0 << HBITS_B448_29;
+    bot += *r;
+    bot += c;
+
+    top += x1;
+    carry = bot >> BASEBITS_B448_29;
+    bot &= BMASK_B448_29;
+    top += carry;
+
+    *r = bot;
+    return top;
+}
+
+#endif
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/big_B464_28.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/big_B464_28.h
new file mode 100644
index 0000000..b421aaf
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/big_B464_28.h
@@ -0,0 +1,697 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file big.h
+ * @author Mike Scott
+ * @date 23rd February 2016
+ * @brief Big number Header File
+ *
+ *
+ */
+
+#ifndef BIG_B464_28_H
+#define BIG_B464_28_H
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <inttypes.h>
+#include "arch.h"
+#include "core.h"
+#include "config_big_B464_28.h"
+
+using namespace core;
+
+/* could comment this out if code size is a major issue */
+#define UNWOUND
+/* Normally recommended, but may not be optimal for some architectures, for example 32-bit ARM M4 */
+#define USE_KARATSUBA
+
+#define BIGBITS_B464_28 (8*MODBYTES_B464_28)
+#define NLEN_B464_28 (1+((8*MODBYTES_B464_28-1)/BASEBITS_B464_28))
+#define DNLEN_B464_28 2*NLEN_B464_28
+#define BMASK_B464_28 (((chunk)1<<BASEBITS_B464_28)-1) /**< Mask = 2^BASEBITS-1 */
+#define NEXCESS_B464_28 (1<<(CHUNK-BASEBITS_B464_28-1))           /**< 2^(CHUNK-BASEBITS-1) - digit cannot be multiplied by more than this before normalisation */
+
+#define HBITS_B464_28 (BASEBITS_B464_28/2)      /**< Number of bits in number base divided by 2 */
+#define HMASK_B464_28 (((chunk)1<<HBITS_B464_28)-1)    /**< Mask = 2^HBITS-1 */
+
+//#define DEBUG_NORM
+
+#ifdef DEBUG_NORM  /* Add an extra location to track chunk extension */
+#define MPV_B464_28 NLEN_B464_28
+#define MNV_B464_28 (NLEN_B464_28+1)
+#define DMPV_B464_28 DNLEN_B464_28
+#define DMNV_B464_28 (DNLEN_B464_28+1)
+
+#endif
+
+namespace B464_28 {
+
+//extern int BIGMULS;
+//extern int BIGSQRS;
+
+#ifdef DEBUG_NORM
+typedef chunk BIG[NLEN_B464_28 + 2]; /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B464_28 + 2]; /**< Define type DBIG as array of chunks */
+#else
+typedef chunk BIG[NLEN_B464_28];     /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B464_28];   /**< Define type DBIG as array of chunks */
+#endif
+
+/* BIG number prototypes */
+
+/**	@brief Tests for BIG equal to zero (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_iszilch(BIG x);
+/**	@brief Tests for BIG equal to one (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if one, else returns 0
+ */
+extern int BIG_isunity(BIG x);
+/**	@brief Tests for DBIG equal to zero (Constant Time)
+ *
+	@param x a DBIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_diszilch(DBIG x);
+/**	@brief Outputs a BIG number to the console (Variable Time)
+ *
+	@param x a BIG number
+ */
+extern void BIG_output(BIG x);
+/**	@brief Outputs a BIG number to the console in raw form (Variable Time for debugging)
+ *
+	@param x a BIG number
+ */
+extern void BIG_rawoutput(BIG x);
+/**	@brief Conditional constant time swap of two BIG numbers
+ *
+	Conditionally swaps parameters in constant time (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s swap takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cswap(BIG x, BIG y, int s);
+/**	@brief Conditional copy of BIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cmove(BIG x, BIG y, int s);
+/**	@brief Conditional copy of DBIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a DBIG number
+	@param y another DBIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_dcmove(BIG x, BIG y, int s);
+/**	@brief Convert from BIG number to byte array (Constant Time)
+ *
+	@param a byte array
+	@param x BIG number
+ */
+extern void BIG_toBytes(char *a, BIG x);
+/**	@brief Convert to BIG number from byte array (Constant Time)
+ *
+	@param x BIG number
+	@param a byte array
+ */
+extern void BIG_fromBytes(BIG x, char *a);
+/**	@brief Convert to BIG number from byte array of given length (Variable Time)
+ *
+	@param x BIG number
+	@param a byte array
+	@param s byte array length
+ */
+extern void BIG_fromBytesLen(BIG x, char *a, int s);
+/**@brief Convert to DBIG number from byte array of given length (Variable Time)
+ *
+   @param x DBIG number
+   @param a byte array
+   @param s byte array length
+ */
+extern void BIG_dfromBytesLen(DBIG x, char *a, int s);
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_doutput(DBIG x); 
+
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_drawoutput(DBIG x);
+
+/**	@brief Copy BIG from Read-Only Memory to a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number in ROM
+ */
+extern void BIG_rcopy(BIG x, const BIG y);
+/**	@brief Copy BIG to another BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_copy(BIG x, BIG y);
+/**	@brief Copy DBIG to another DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_dcopy(DBIG x, DBIG y);
+/**	@brief Copy BIG to upper half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dsucopy(DBIG x, BIG y);
+/**	@brief Copy BIG to lower half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dscopy(DBIG x, BIG y);
+/**	@brief Copy lower half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sdcopy(BIG x, DBIG y);
+/**	@brief Copy upper half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sducopy(BIG x, DBIG y);
+/**	@brief Set BIG to zero (Constant Time)
+ *
+	@param x BIG number to be set to zero  
+ */
+extern void BIG_zero(BIG x);
+/**	@brief Set DBIG to zero (Constant Time)
+ *
+	@param x DBIG number to be set to zero
+ */
+extern void BIG_dzero(DBIG x);
+/**	@brief Set BIG to one (unity) (Constant Time)
+ *
+	@param x BIG number to be set to one.
+ */
+extern void BIG_one(BIG x);
+/**	@brief Set BIG to inverse mod 2^256 (Constant Time)
+ *
+	@param x BIG number to be inverted
+ */
+extern void BIG_invmod2m(BIG x);
+/**	@brief Set BIG to sum of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, sum of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_add(BIG x, BIG y, BIG z);
+
+/**	@brief Set BIG to logical or of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, or of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_or(BIG x, BIG y, BIG z);
+
+/**	@brief Increment BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be incremented
+	@param i integer
+ */
+extern void BIG_inc(BIG x, int i);
+/**	@brief Set BIG to difference of two BIGs (Constant Time)
+ *
+	@param x BIG number, difference of other two - output not normalised
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_sub(BIG x, BIG y, BIG z);
+/**	@brief Decrement BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be decremented
+	@param i integer
+ */
+extern void BIG_dec(BIG x, int i);
+/**	@brief Set DBIG to sum of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, sum of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dadd(DBIG x, DBIG y, DBIG z);
+/**	@brief Set DBIG to difference of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, difference of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dsub(DBIG x, DBIG y, DBIG z);
+/**	@brief Multiply BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_imul(BIG x, BIG y, int i);
+/**	@brief Multiply BIG by not-so-small small integer - output normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+	@return Overflowing bits
+ */
+extern chunk BIG_pmul(BIG x, BIG y, int i);
+/**	@brief Divide BIG by 3 - output normalised (Constant Time)
+ *
+	@param x BIG number
+	@return Remainder
+ */
+extern int BIG_div3(BIG x);
+/**	@brief Multiply BIG by even bigger small integer resulting in a DBIG - output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_pxmul(DBIG x, BIG y, int i);
+/**	@brief Multiply BIG by another BIG resulting in DBIG - inputs normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_mul(DBIG x, BIG y, BIG z);
+/**	@brief Multiply BIG by another BIG resulting in another BIG - inputs normalised and output normalised (Constant Time)
+ *
+	Note that the product must fit into a BIG, and x must be distinct from y and z
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_smul(BIG x, BIG y, BIG z);
+/**	@brief Square BIG resulting in a DBIG - input normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, square of a BIG
+	@param y BIG number to be squared
+ */
+extern void BIG_sqr(DBIG x, BIG y);
+
+/**	@brief Montgomery reduction of a DBIG to a BIG  - input normalised and output normalised (Constant Time)
+ *
+	@param a BIG number, reduction of a BIG
+	@param md BIG number, the modulus
+	@param MC the Montgomery Constant
+	@param d DBIG number to be reduced
+ */
+extern void BIG_monty(BIG a, BIG md, chunk MC, DBIG d);
+
+/**	@brief Shifts a BIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shl(BIG x, int s);
+/**	@brief Fast shifts a BIG left by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Overflow bits
+ */
+extern int BIG_fshl(BIG x, int s);
+/**	@brief Shifts a DBIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshl(DBIG x, int s);
+/**	@brief Shifts a BIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shr(BIG x, int s);
+
+
+/**	@brief Fast time-critical combined shift by 1 bit, subtract and normalise (Constant Time)
+ *
+	@param r BIG number normalised output
+	@param a BIG number to be subtracted from
+	@param m BIG number to be shifted and subtracted
+	@return sign of r
+ */
+extern int BIG_ssn(BIG r, BIG a, BIG m);
+
+/**	@brief Fast shifts a BIG right by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Shifted out bits
+ */
+extern int BIG_fshr(BIG x, int s);
+/**	@brief Shifts a DBIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshr(DBIG x, int s);
+/**	@brief Splits a DBIG into two BIGs - input must be normalised, outputs normalised (Constant Time as used)
+ *
+	Internal function. The value of s must be approximately in the middle of the DBIG.
+	Typically used to extract z mod 2^MODBITS and z/2^MODBITS
+	@param x BIG number, top half of z
+	@param y BIG number, bottom half of z
+	@param z DBIG number to be split in two.
+	@param s Bit position at which to split
+	@return carry-out from top half
+ */
+extern chunk BIG_split(BIG x, BIG y, DBIG z, int s);
+/**	@brief Normalizes a BIG number - output normalised (Constant Time)
+ *
+	All digits of the input BIG are reduced mod 2^BASEBITS
+	@param x BIG number to be normalised
+ */
+extern chunk BIG_norm(BIG x);
+/**	@brief Normalizes a DBIG number - output normalised (Constant Time)
+ *
+	All digits of the input DBIG are reduced mod 2^BASEBITS
+	@param x DBIG number to be normalised
+ */
+extern void BIG_dnorm(DBIG x);
+/**	@brief Compares two BIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first BIG number to be compared
+	@param y second BIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_comp(BIG x, BIG y);
+/**	@brief Compares two DBIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first DBIG number to be compared
+	@param y second DBIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_dcomp(DBIG x, DBIG y);
+/**	@brief Calculate number of bits in a BIG - output normalised (Variable Time)
+ *
+	@param x BIG number
+	@return Number of bits in x
+ */
+extern int BIG_nbits(BIG x);
+/**	@brief Calculate number of bits in a DBIG - output normalised (Variable Time)
+ *
+	@param x DBIG number
+	@return Number of bits in x
+ */
+extern int BIG_dnbits(DBIG x);
+
+/**	@brief Reduce x mod n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctmod(BIG x, BIG n, int bd);
+
+/**	@brief  x=y mod n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctdmod(BIG x, DBIG y, BIG n, int bd);
+
+/**	@brief Divide x by n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctsdiv(BIG x,BIG n,int bd);
+
+/**	@brief  x=y/n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctddiv(BIG x, DBIG y, BIG n,int bd);
+
+
+/**	@brief Reduce x mod n - input and output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+ */
+extern void BIG_mod(BIG x, BIG n);
+/**	@brief Divide x by n - output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+ */
+extern void BIG_sdiv(BIG x, BIG n);
+/**	@brief  x=y mod n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_dmod(BIG x, DBIG y, BIG n);
+/**	@brief  x=y/n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_ddiv(BIG x, DBIG y, BIG n);
+/**	@brief  return parity of BIG, that is the least significant bit (Constant Time)
+ *
+	@param x BIG number
+	@return 0 or 1
+ */
+extern int BIG_parity(BIG x);
+/**	@brief  return i-th of BIG (Constant Time)
+ *
+	@param x BIG number
+	@param i the bit of x to be returned
+	@return 0 or 1
+ */
+extern int BIG_bit(BIG x, int i);
+/**	@brief  return least significant bits of a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param n number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int BIG_lastbits(BIG x, int n);
+/**	@brief  Create a random BIG from a random number generator (Constant Time)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_random(BIG x, csprng *r);
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randomnum(BIG x, BIG n, csprng *r);
+
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus and truncated to max bit length (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param t Maximum bit length
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randtrunc(BIG x, BIG n, int t, csprng *r);
+
+/**	brief  return NAF (Non-Adjacent-Form) value as +/- 1, 3 or 5, inputs must be normalised
+ *
+	Given x and 3*x extracts NAF value from given bit position, and returns number of bits processed, and number of trailing zeros detected if any
+	param x BIG number
+	param x3 BIG number, three times x
+	param i bit position
+	param nbs pointer to integer returning number of bits processed
+	param nzs pointer to integer returning number of trailing 0s
+	return + or - 1, 3 or 5
+*/
+
+/**	@brief  Calculate x=y*z mod n (Variable Time)
+ *
+	Slow method for modular multiplication
+	@param x BIG number, on exit = y*z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modmul(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y/z mod n (Variable Time)
+ *
+	Slow method for modular division
+	@param x BIG number, on exit = y/z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_moddiv(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y^2 mod n (Variable Time)
+ *
+	Slow method for modular squaring
+	@param x BIG number, on exit = y^2 mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modsqr(BIG x, BIG y, BIG n);
+/**	@brief  Calculate x=-y mod n (Variable Time)
+ *
+	Modular negation
+	@param x BIG number, on exit = -y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modneg(BIG x, BIG y, BIG n);
+
+/**	@brief  Calculate x=y+z mod n (Variable Time)
+ *
+	Slow method for modular addition
+	@param x BIG number, on exit = y+z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modadd(BIG x, BIG y, BIG z, BIG n);
+
+/**	@brief  Calculate jacobi Symbol (x/y) (Variable Time)
+ *
+	@param x BIG number
+	@param y BIG number
+	@return Jacobi symbol, -1,0 or 1
+ */
+extern int BIG_jacobi(BIG x, BIG y);
+/**	@brief  Calculate x=1/y mod n (Variable Time)
+ *
+	Modular Inversion - This is slow. Uses binary method.
+	@param x BIG number, on exit = 1/y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_invmodp(BIG x, BIG y, BIG n);
+/** @brief Calculate x=x mod 2^m (Variable Time)
+ *
+	Truncation
+	@param x BIG number, on reduced mod 2^m
+	@param m new truncated size
+*/
+extern void BIG_mod2m(BIG x, int m);
+
+/**	@brief Calculates a*b+c+*d
+ *
+	Calculate partial product of a.b, add in carry c, and add total to d (Constant Time)
+	@param a multiplier
+	@param b multiplicand
+	@param c carry
+	@param d pointer to accumulated bottom half of result
+	@return top half of result
+ */
+
+
+extern int step1(BIG,BIG,BIG);
+extern void step2(BIG,BIG,BIG);
+
+#ifdef dchunk
+
+/* Method required to calculate x*y+c+r, bottom half in r, top half returned */
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    dchunk prod = (dchunk)x * y + c + *r;
+    *r = (chunk)prod & BMASK_B464_28;
+    return (chunk)(prod >> BASEBITS_B464_28);
+}
+
+#else
+
+/* No integer type available that can store double the wordlength */
+/* accumulate partial products */
+
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    chunk x0, x1, y0, y1;
+    chunk bot, top, mid, carry;
+    x0 = x & HMASK_B464_28;
+    x1 = (x >> HBITS_B464_28);
+    y0 = y & HMASK_B464_28;
+    y1 = (y >> HBITS_B464_28);
+    bot = x0 * y0;
+    top = x1 * y1;
+    mid = x0 * y1 + x1 * y0;
+    x0 = mid & HMASK_B464_28;
+    x1 = (mid >> HBITS_B464_28);
+    bot += x0 << HBITS_B464_28;
+    bot += *r;
+    bot += c;
+
+    top += x1;
+    carry = bot >> BASEBITS_B464_28;
+    bot &= BMASK_B464_28;
+    top += carry;
+
+    *r = bot;
+    return top;
+}
+
+#endif
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/big_B480_29.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/big_B480_29.h
new file mode 100644
index 0000000..dbba2c4
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/big_B480_29.h
@@ -0,0 +1,697 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file big.h
+ * @author Mike Scott
+ * @date 23rd February 2016
+ * @brief Big number Header File
+ *
+ *
+ */
+
+#ifndef BIG_B480_29_H
+#define BIG_B480_29_H
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <inttypes.h>
+#include "arch.h"
+#include "core.h"
+#include "config_big_B480_29.h"
+
+using namespace core;
+
+/* could comment this out if code size is a major issue */
+#define UNWOUND
+/* Normally recommended, but may not be optimal for some architectures, for example 32-bit ARM M4 */
+#define USE_KARATSUBA
+
+#define BIGBITS_B480_29 (8*MODBYTES_B480_29)
+#define NLEN_B480_29 (1+((8*MODBYTES_B480_29-1)/BASEBITS_B480_29))
+#define DNLEN_B480_29 2*NLEN_B480_29
+#define BMASK_B480_29 (((chunk)1<<BASEBITS_B480_29)-1) /**< Mask = 2^BASEBITS-1 */
+#define NEXCESS_B480_29 (1<<(CHUNK-BASEBITS_B480_29-1))           /**< 2^(CHUNK-BASEBITS-1) - digit cannot be multiplied by more than this before normalisation */
+
+#define HBITS_B480_29 (BASEBITS_B480_29/2)      /**< Number of bits in number base divided by 2 */
+#define HMASK_B480_29 (((chunk)1<<HBITS_B480_29)-1)    /**< Mask = 2^HBITS-1 */
+
+//#define DEBUG_NORM
+
+#ifdef DEBUG_NORM  /* Add an extra location to track chunk extension */
+#define MPV_B480_29 NLEN_B480_29
+#define MNV_B480_29 (NLEN_B480_29+1)
+#define DMPV_B480_29 DNLEN_B480_29
+#define DMNV_B480_29 (DNLEN_B480_29+1)
+
+#endif
+
+namespace B480_29 {
+
+//extern int BIGMULS;
+//extern int BIGSQRS;
+
+#ifdef DEBUG_NORM
+typedef chunk BIG[NLEN_B480_29 + 2]; /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B480_29 + 2]; /**< Define type DBIG as array of chunks */
+#else
+typedef chunk BIG[NLEN_B480_29];     /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B480_29];   /**< Define type DBIG as array of chunks */
+#endif
+
+/* BIG number prototypes */
+
+/**	@brief Tests for BIG equal to zero (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_iszilch(BIG x);
+/**	@brief Tests for BIG equal to one (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if one, else returns 0
+ */
+extern int BIG_isunity(BIG x);
+/**	@brief Tests for DBIG equal to zero (Constant Time)
+ *
+	@param x a DBIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_diszilch(DBIG x);
+/**	@brief Outputs a BIG number to the console (Variable Time)
+ *
+	@param x a BIG number
+ */
+extern void BIG_output(BIG x);
+/**	@brief Outputs a BIG number to the console in raw form (Variable Time for debugging)
+ *
+	@param x a BIG number
+ */
+extern void BIG_rawoutput(BIG x);
+/**	@brief Conditional constant time swap of two BIG numbers
+ *
+	Conditionally swaps parameters in constant time (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s swap takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cswap(BIG x, BIG y, int s);
+/**	@brief Conditional copy of BIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cmove(BIG x, BIG y, int s);
+/**	@brief Conditional copy of DBIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a DBIG number
+	@param y another DBIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_dcmove(BIG x, BIG y, int s);
+/**	@brief Convert from BIG number to byte array (Constant Time)
+ *
+	@param a byte array
+	@param x BIG number
+ */
+extern void BIG_toBytes(char *a, BIG x);
+/**	@brief Convert to BIG number from byte array (Constant Time)
+ *
+	@param x BIG number
+	@param a byte array
+ */
+extern void BIG_fromBytes(BIG x, char *a);
+/**	@brief Convert to BIG number from byte array of given length (Variable Time)
+ *
+	@param x BIG number
+	@param a byte array
+	@param s byte array length
+ */
+extern void BIG_fromBytesLen(BIG x, char *a, int s);
+/**@brief Convert to DBIG number from byte array of given length (Variable Time)
+ *
+   @param x DBIG number
+   @param a byte array
+   @param s byte array length
+ */
+extern void BIG_dfromBytesLen(DBIG x, char *a, int s);
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_doutput(DBIG x); 
+
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_drawoutput(DBIG x);
+
+/**	@brief Copy BIG from Read-Only Memory to a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number in ROM
+ */
+extern void BIG_rcopy(BIG x, const BIG y);
+/**	@brief Copy BIG to another BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_copy(BIG x, BIG y);
+/**	@brief Copy DBIG to another DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_dcopy(DBIG x, DBIG y);
+/**	@brief Copy BIG to upper half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dsucopy(DBIG x, BIG y);
+/**	@brief Copy BIG to lower half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dscopy(DBIG x, BIG y);
+/**	@brief Copy lower half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sdcopy(BIG x, DBIG y);
+/**	@brief Copy upper half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sducopy(BIG x, DBIG y);
+/**	@brief Set BIG to zero (Constant Time)
+ *
+	@param x BIG number to be set to zero  
+ */
+extern void BIG_zero(BIG x);
+/**	@brief Set DBIG to zero (Constant Time)
+ *
+	@param x DBIG number to be set to zero
+ */
+extern void BIG_dzero(DBIG x);
+/**	@brief Set BIG to one (unity) (Constant Time)
+ *
+	@param x BIG number to be set to one.
+ */
+extern void BIG_one(BIG x);
+/**	@brief Set BIG to inverse mod 2^256 (Constant Time)
+ *
+	@param x BIG number to be inverted
+ */
+extern void BIG_invmod2m(BIG x);
+/**	@brief Set BIG to sum of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, sum of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_add(BIG x, BIG y, BIG z);
+
+/**	@brief Set BIG to logical or of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, or of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_or(BIG x, BIG y, BIG z);
+
+/**	@brief Increment BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be incremented
+	@param i integer
+ */
+extern void BIG_inc(BIG x, int i);
+/**	@brief Set BIG to difference of two BIGs (Constant Time)
+ *
+	@param x BIG number, difference of other two - output not normalised
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_sub(BIG x, BIG y, BIG z);
+/**	@brief Decrement BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be decremented
+	@param i integer
+ */
+extern void BIG_dec(BIG x, int i);
+/**	@brief Set DBIG to sum of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, sum of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dadd(DBIG x, DBIG y, DBIG z);
+/**	@brief Set DBIG to difference of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, difference of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dsub(DBIG x, DBIG y, DBIG z);
+/**	@brief Multiply BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_imul(BIG x, BIG y, int i);
+/**	@brief Multiply BIG by not-so-small small integer - output normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+	@return Overflowing bits
+ */
+extern chunk BIG_pmul(BIG x, BIG y, int i);
+/**	@brief Divide BIG by 3 - output normalised (Constant Time)
+ *
+	@param x BIG number
+	@return Remainder
+ */
+extern int BIG_div3(BIG x);
+/**	@brief Multiply BIG by even bigger small integer resulting in a DBIG - output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_pxmul(DBIG x, BIG y, int i);
+/**	@brief Multiply BIG by another BIG resulting in DBIG - inputs normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_mul(DBIG x, BIG y, BIG z);
+/**	@brief Multiply BIG by another BIG resulting in another BIG - inputs normalised and output normalised (Constant Time)
+ *
+	Note that the product must fit into a BIG, and x must be distinct from y and z
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_smul(BIG x, BIG y, BIG z);
+/**	@brief Square BIG resulting in a DBIG - input normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, square of a BIG
+	@param y BIG number to be squared
+ */
+extern void BIG_sqr(DBIG x, BIG y);
+
+/**	@brief Montgomery reduction of a DBIG to a BIG  - input normalised and output normalised (Constant Time)
+ *
+	@param a BIG number, reduction of a BIG
+	@param md BIG number, the modulus
+	@param MC the Montgomery Constant
+	@param d DBIG number to be reduced
+ */
+extern void BIG_monty(BIG a, BIG md, chunk MC, DBIG d);
+
+/**	@brief Shifts a BIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shl(BIG x, int s);
+/**	@brief Fast shifts a BIG left by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Overflow bits
+ */
+extern int BIG_fshl(BIG x, int s);
+/**	@brief Shifts a DBIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshl(DBIG x, int s);
+/**	@brief Shifts a BIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shr(BIG x, int s);
+
+
+/**	@brief Fast time-critical combined shift by 1 bit, subtract and normalise (Constant Time)
+ *
+	@param r BIG number normalised output
+	@param a BIG number to be subtracted from
+	@param m BIG number to be shifted and subtracted
+	@return sign of r
+ */
+extern int BIG_ssn(BIG r, BIG a, BIG m);
+
+/**	@brief Fast shifts a BIG right by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Shifted out bits
+ */
+extern int BIG_fshr(BIG x, int s);
+/**	@brief Shifts a DBIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshr(DBIG x, int s);
+/**	@brief Splits a DBIG into two BIGs - input must be normalised, outputs normalised (Constant Time as used)
+ *
+	Internal function. The value of s must be approximately in the middle of the DBIG.
+	Typically used to extract z mod 2^MODBITS and z/2^MODBITS
+	@param x BIG number, top half of z
+	@param y BIG number, bottom half of z
+	@param z DBIG number to be split in two.
+	@param s Bit position at which to split
+	@return carry-out from top half
+ */
+extern chunk BIG_split(BIG x, BIG y, DBIG z, int s);
+/**	@brief Normalizes a BIG number - output normalised (Constant Time)
+ *
+	All digits of the input BIG are reduced mod 2^BASEBITS
+	@param x BIG number to be normalised
+ */
+extern chunk BIG_norm(BIG x);
+/**	@brief Normalizes a DBIG number - output normalised (Constant Time)
+ *
+	All digits of the input DBIG are reduced mod 2^BASEBITS
+	@param x DBIG number to be normalised
+ */
+extern void BIG_dnorm(DBIG x);
+/**	@brief Compares two BIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first BIG number to be compared
+	@param y second BIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_comp(BIG x, BIG y);
+/**	@brief Compares two DBIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first DBIG number to be compared
+	@param y second DBIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_dcomp(DBIG x, DBIG y);
+/**	@brief Calculate number of bits in a BIG - output normalised (Variable Time)
+ *
+	@param x BIG number
+	@return Number of bits in x
+ */
+extern int BIG_nbits(BIG x);
+/**	@brief Calculate number of bits in a DBIG - output normalised (Variable Time)
+ *
+	@param x DBIG number
+	@return Number of bits in x
+ */
+extern int BIG_dnbits(DBIG x);
+
+/**	@brief Reduce x mod n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctmod(BIG x, BIG n, int bd);
+
+/**	@brief  x=y mod n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctdmod(BIG x, DBIG y, BIG n, int bd);
+
+/**	@brief Divide x by n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctsdiv(BIG x,BIG n,int bd);
+
+/**	@brief  x=y/n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctddiv(BIG x, DBIG y, BIG n,int bd);
+
+
+/**	@brief Reduce x mod n - input and output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+ */
+extern void BIG_mod(BIG x, BIG n);
+/**	@brief Divide x by n - output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+ */
+extern void BIG_sdiv(BIG x, BIG n);
+/**	@brief  x=y mod n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_dmod(BIG x, DBIG y, BIG n);
+/**	@brief  x=y/n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_ddiv(BIG x, DBIG y, BIG n);
+/**	@brief  return parity of BIG, that is the least significant bit (Constant Time)
+ *
+	@param x BIG number
+	@return 0 or 1
+ */
+extern int BIG_parity(BIG x);
+/**	@brief  return i-th of BIG (Constant Time)
+ *
+	@param x BIG number
+	@param i the bit of x to be returned
+	@return 0 or 1
+ */
+extern int BIG_bit(BIG x, int i);
+/**	@brief  return least significant bits of a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param n number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int BIG_lastbits(BIG x, int n);
+/**	@brief  Create a random BIG from a random number generator (Constant Time)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_random(BIG x, csprng *r);
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randomnum(BIG x, BIG n, csprng *r);
+
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus and truncated to max bit length (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param t Maximum bit length
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randtrunc(BIG x, BIG n, int t, csprng *r);
+
+/**	brief  return NAF (Non-Adjacent-Form) value as +/- 1, 3 or 5, inputs must be normalised
+ *
+	Given x and 3*x extracts NAF value from given bit position, and returns number of bits processed, and number of trailing zeros detected if any
+	param x BIG number
+	param x3 BIG number, three times x
+	param i bit position
+	param nbs pointer to integer returning number of bits processed
+	param nzs pointer to integer returning number of trailing 0s
+	return + or - 1, 3 or 5
+*/
+
+/**	@brief  Calculate x=y*z mod n (Variable Time)
+ *
+	Slow method for modular multiplication
+	@param x BIG number, on exit = y*z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modmul(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y/z mod n (Variable Time)
+ *
+	Slow method for modular division
+	@param x BIG number, on exit = y/z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_moddiv(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y^2 mod n (Variable Time)
+ *
+	Slow method for modular squaring
+	@param x BIG number, on exit = y^2 mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modsqr(BIG x, BIG y, BIG n);
+/**	@brief  Calculate x=-y mod n (Variable Time)
+ *
+	Modular negation
+	@param x BIG number, on exit = -y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modneg(BIG x, BIG y, BIG n);
+
+/**	@brief  Calculate x=y+z mod n (Variable Time)
+ *
+	Slow method for modular addition
+	@param x BIG number, on exit = y+z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modadd(BIG x, BIG y, BIG z, BIG n);
+
+/**	@brief  Calculate jacobi Symbol (x/y) (Variable Time)
+ *
+	@param x BIG number
+	@param y BIG number
+	@return Jacobi symbol, -1,0 or 1
+ */
+extern int BIG_jacobi(BIG x, BIG y);
+/**	@brief  Calculate x=1/y mod n (Variable Time)
+ *
+	Modular Inversion - This is slow. Uses binary method.
+	@param x BIG number, on exit = 1/y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_invmodp(BIG x, BIG y, BIG n);
+/** @brief Calculate x=x mod 2^m (Variable Time)
+ *
+	Truncation
+	@param x BIG number, on reduced mod 2^m
+	@param m new truncated size
+*/
+extern void BIG_mod2m(BIG x, int m);
+
+/**	@brief Calculates a*b+c+*d
+ *
+	Calculate partial product of a.b, add in carry c, and add total to d (Constant Time)
+	@param a multiplier
+	@param b multiplicand
+	@param c carry
+	@param d pointer to accumulated bottom half of result
+	@return top half of result
+ */
+
+
+extern int step1(BIG,BIG,BIG);
+extern void step2(BIG,BIG,BIG);
+
+#ifdef dchunk
+
+/* Method required to calculate x*y+c+r, bottom half in r, top half returned */
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    dchunk prod = (dchunk)x * y + c + *r;
+    *r = (chunk)prod & BMASK_B480_29;
+    return (chunk)(prod >> BASEBITS_B480_29);
+}
+
+#else
+
+/* No integer type available that can store double the wordlength */
+/* accumulate partial products */
+
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    chunk x0, x1, y0, y1;
+    chunk bot, top, mid, carry;
+    x0 = x & HMASK_B480_29;
+    x1 = (x >> HBITS_B480_29);
+    y0 = y & HMASK_B480_29;
+    y1 = (y >> HBITS_B480_29);
+    bot = x0 * y0;
+    top = x1 * y1;
+    mid = x0 * y1 + x1 * y0;
+    x0 = mid & HMASK_B480_29;
+    x1 = (mid >> HBITS_B480_29);
+    bot += x0 << HBITS_B480_29;
+    bot += *r;
+    bot += c;
+
+    top += x1;
+    carry = bot >> BASEBITS_B480_29;
+    bot &= BMASK_B480_29;
+    top += carry;
+
+    *r = bot;
+    return top;
+}
+
+#endif
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/big_B512_29.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/big_B512_29.h
new file mode 100644
index 0000000..f89f880
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/big_B512_29.h
@@ -0,0 +1,697 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file big.h
+ * @author Mike Scott
+ * @date 23rd February 2016
+ * @brief Big number Header File
+ *
+ *
+ */
+
+#ifndef BIG_B512_29_H
+#define BIG_B512_29_H
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <inttypes.h>
+#include "arch.h"
+#include "core.h"
+#include "config_big_B512_29.h"
+
+using namespace core;
+
+/* could comment this out if code size is a major issue */
+#define UNWOUND
+/* Normally recommended, but may not be optimal for some architectures, for example 32-bit ARM M4 */
+#define USE_KARATSUBA
+
+#define BIGBITS_B512_29 (8*MODBYTES_B512_29)
+#define NLEN_B512_29 (1+((8*MODBYTES_B512_29-1)/BASEBITS_B512_29))
+#define DNLEN_B512_29 2*NLEN_B512_29
+#define BMASK_B512_29 (((chunk)1<<BASEBITS_B512_29)-1) /**< Mask = 2^BASEBITS-1 */
+#define NEXCESS_B512_29 (1<<(CHUNK-BASEBITS_B512_29-1))           /**< 2^(CHUNK-BASEBITS-1) - digit cannot be multiplied by more than this before normalisation */
+
+#define HBITS_B512_29 (BASEBITS_B512_29/2)      /**< Number of bits in number base divided by 2 */
+#define HMASK_B512_29 (((chunk)1<<HBITS_B512_29)-1)    /**< Mask = 2^HBITS-1 */
+
+//#define DEBUG_NORM
+
+#ifdef DEBUG_NORM  /* Add an extra location to track chunk extension */
+#define MPV_B512_29 NLEN_B512_29
+#define MNV_B512_29 (NLEN_B512_29+1)
+#define DMPV_B512_29 DNLEN_B512_29
+#define DMNV_B512_29 (DNLEN_B512_29+1)
+
+#endif
+
+namespace B512_29 {
+
+//extern int BIGMULS;
+//extern int BIGSQRS;
+
+#ifdef DEBUG_NORM
+typedef chunk BIG[NLEN_B512_29 + 2]; /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B512_29 + 2]; /**< Define type DBIG as array of chunks */
+#else
+typedef chunk BIG[NLEN_B512_29];     /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B512_29];   /**< Define type DBIG as array of chunks */
+#endif
+
+/* BIG number prototypes */
+
+/**	@brief Tests for BIG equal to zero (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_iszilch(BIG x);
+/**	@brief Tests for BIG equal to one (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if one, else returns 0
+ */
+extern int BIG_isunity(BIG x);
+/**	@brief Tests for DBIG equal to zero (Constant Time)
+ *
+	@param x a DBIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_diszilch(DBIG x);
+/**	@brief Outputs a BIG number to the console (Variable Time)
+ *
+	@param x a BIG number
+ */
+extern void BIG_output(BIG x);
+/**	@brief Outputs a BIG number to the console in raw form (Variable Time for debugging)
+ *
+	@param x a BIG number
+ */
+extern void BIG_rawoutput(BIG x);
+/**	@brief Conditional constant time swap of two BIG numbers
+ *
+	Conditionally swaps parameters in constant time (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s swap takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cswap(BIG x, BIG y, int s);
+/**	@brief Conditional copy of BIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cmove(BIG x, BIG y, int s);
+/**	@brief Conditional copy of DBIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a DBIG number
+	@param y another DBIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_dcmove(BIG x, BIG y, int s);
+/**	@brief Convert from BIG number to byte array (Constant Time)
+ *
+	@param a byte array
+	@param x BIG number
+ */
+extern void BIG_toBytes(char *a, BIG x);
+/**	@brief Convert to BIG number from byte array (Constant Time)
+ *
+	@param x BIG number
+	@param a byte array
+ */
+extern void BIG_fromBytes(BIG x, char *a);
+/**	@brief Convert to BIG number from byte array of given length (Variable Time)
+ *
+	@param x BIG number
+	@param a byte array
+	@param s byte array length
+ */
+extern void BIG_fromBytesLen(BIG x, char *a, int s);
+/**@brief Convert to DBIG number from byte array of given length (Variable Time)
+ *
+   @param x DBIG number
+   @param a byte array
+   @param s byte array length
+ */
+extern void BIG_dfromBytesLen(DBIG x, char *a, int s);
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_doutput(DBIG x); 
+
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_drawoutput(DBIG x);
+
+/**	@brief Copy BIG from Read-Only Memory to a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number in ROM
+ */
+extern void BIG_rcopy(BIG x, const BIG y);
+/**	@brief Copy BIG to another BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_copy(BIG x, BIG y);
+/**	@brief Copy DBIG to another DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_dcopy(DBIG x, DBIG y);
+/**	@brief Copy BIG to upper half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dsucopy(DBIG x, BIG y);
+/**	@brief Copy BIG to lower half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dscopy(DBIG x, BIG y);
+/**	@brief Copy lower half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sdcopy(BIG x, DBIG y);
+/**	@brief Copy upper half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sducopy(BIG x, DBIG y);
+/**	@brief Set BIG to zero (Constant Time)
+ *
+	@param x BIG number to be set to zero  
+ */
+extern void BIG_zero(BIG x);
+/**	@brief Set DBIG to zero (Constant Time)
+ *
+	@param x DBIG number to be set to zero
+ */
+extern void BIG_dzero(DBIG x);
+/**	@brief Set BIG to one (unity) (Constant Time)
+ *
+	@param x BIG number to be set to one.
+ */
+extern void BIG_one(BIG x);
+/**	@brief Set BIG to inverse mod 2^256 (Constant Time)
+ *
+	@param x BIG number to be inverted
+ */
+extern void BIG_invmod2m(BIG x);
+/**	@brief Set BIG to sum of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, sum of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_add(BIG x, BIG y, BIG z);
+
+/**	@brief Set BIG to logical or of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, or of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_or(BIG x, BIG y, BIG z);
+
+/**	@brief Increment BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be incremented
+	@param i integer
+ */
+extern void BIG_inc(BIG x, int i);
+/**	@brief Set BIG to difference of two BIGs (Constant Time)
+ *
+	@param x BIG number, difference of other two - output not normalised
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_sub(BIG x, BIG y, BIG z);
+/**	@brief Decrement BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be decremented
+	@param i integer
+ */
+extern void BIG_dec(BIG x, int i);
+/**	@brief Set DBIG to sum of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, sum of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dadd(DBIG x, DBIG y, DBIG z);
+/**	@brief Set DBIG to difference of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, difference of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dsub(DBIG x, DBIG y, DBIG z);
+/**	@brief Multiply BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_imul(BIG x, BIG y, int i);
+/**	@brief Multiply BIG by not-so-small small integer - output normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+	@return Overflowing bits
+ */
+extern chunk BIG_pmul(BIG x, BIG y, int i);
+/**	@brief Divide BIG by 3 - output normalised (Constant Time)
+ *
+	@param x BIG number
+	@return Remainder
+ */
+extern int BIG_div3(BIG x);
+/**	@brief Multiply BIG by even bigger small integer resulting in a DBIG - output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_pxmul(DBIG x, BIG y, int i);
+/**	@brief Multiply BIG by another BIG resulting in DBIG - inputs normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_mul(DBIG x, BIG y, BIG z);
+/**	@brief Multiply BIG by another BIG resulting in another BIG - inputs normalised and output normalised (Constant Time)
+ *
+	Note that the product must fit into a BIG, and x must be distinct from y and z
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_smul(BIG x, BIG y, BIG z);
+/**	@brief Square BIG resulting in a DBIG - input normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, square of a BIG
+	@param y BIG number to be squared
+ */
+extern void BIG_sqr(DBIG x, BIG y);
+
+/**	@brief Montgomery reduction of a DBIG to a BIG  - input normalised and output normalised (Constant Time)
+ *
+	@param a BIG number, reduction of a BIG
+	@param md BIG number, the modulus
+	@param MC the Montgomery Constant
+	@param d DBIG number to be reduced
+ */
+extern void BIG_monty(BIG a, BIG md, chunk MC, DBIG d);
+
+/**	@brief Shifts a BIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shl(BIG x, int s);
+/**	@brief Fast shifts a BIG left by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Overflow bits
+ */
+extern int BIG_fshl(BIG x, int s);
+/**	@brief Shifts a DBIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshl(DBIG x, int s);
+/**	@brief Shifts a BIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shr(BIG x, int s);
+
+
+/**	@brief Fast time-critical combined shift by 1 bit, subtract and normalise (Constant Time)
+ *
+	@param r BIG number normalised output
+	@param a BIG number to be subtracted from
+	@param m BIG number to be shifted and subtracted
+	@return sign of r
+ */
+extern int BIG_ssn(BIG r, BIG a, BIG m);
+
+/**	@brief Fast shifts a BIG right by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Shifted out bits
+ */
+extern int BIG_fshr(BIG x, int s);
+/**	@brief Shifts a DBIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshr(DBIG x, int s);
+/**	@brief Splits a DBIG into two BIGs - input must be normalised, outputs normalised (Constant Time as used)
+ *
+	Internal function. The value of s must be approximately in the middle of the DBIG.
+	Typically used to extract z mod 2^MODBITS and z/2^MODBITS
+	@param x BIG number, top half of z
+	@param y BIG number, bottom half of z
+	@param z DBIG number to be split in two.
+	@param s Bit position at which to split
+	@return carry-out from top half
+ */
+extern chunk BIG_split(BIG x, BIG y, DBIG z, int s);
+/**	@brief Normalizes a BIG number - output normalised (Constant Time)
+ *
+	All digits of the input BIG are reduced mod 2^BASEBITS
+	@param x BIG number to be normalised
+ */
+extern chunk BIG_norm(BIG x);
+/**	@brief Normalizes a DBIG number - output normalised (Constant Time)
+ *
+	All digits of the input DBIG are reduced mod 2^BASEBITS
+	@param x DBIG number to be normalised
+ */
+extern void BIG_dnorm(DBIG x);
+/**	@brief Compares two BIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first BIG number to be compared
+	@param y second BIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_comp(BIG x, BIG y);
+/**	@brief Compares two DBIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first DBIG number to be compared
+	@param y second DBIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_dcomp(DBIG x, DBIG y);
+/**	@brief Calculate number of bits in a BIG - output normalised (Variable Time)
+ *
+	@param x BIG number
+	@return Number of bits in x
+ */
+extern int BIG_nbits(BIG x);
+/**	@brief Calculate number of bits in a DBIG - output normalised (Variable Time)
+ *
+	@param x DBIG number
+	@return Number of bits in x
+ */
+extern int BIG_dnbits(DBIG x);
+
+/**	@brief Reduce x mod n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctmod(BIG x, BIG n, int bd);
+
+/**	@brief  x=y mod n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctdmod(BIG x, DBIG y, BIG n, int bd);
+
+/**	@brief Divide x by n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctsdiv(BIG x,BIG n,int bd);
+
+/**	@brief  x=y/n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctddiv(BIG x, DBIG y, BIG n,int bd);
+
+
+/**	@brief Reduce x mod n - input and output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+ */
+extern void BIG_mod(BIG x, BIG n);
+/**	@brief Divide x by n - output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+ */
+extern void BIG_sdiv(BIG x, BIG n);
+/**	@brief  x=y mod n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_dmod(BIG x, DBIG y, BIG n);
+/**	@brief  x=y/n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_ddiv(BIG x, DBIG y, BIG n);
+/**	@brief  return parity of BIG, that is the least significant bit (Constant Time)
+ *
+	@param x BIG number
+	@return 0 or 1
+ */
+extern int BIG_parity(BIG x);
+/**	@brief  return i-th of BIG (Constant Time)
+ *
+	@param x BIG number
+	@param i the bit of x to be returned
+	@return 0 or 1
+ */
+extern int BIG_bit(BIG x, int i);
+/**	@brief  return least significant bits of a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param n number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int BIG_lastbits(BIG x, int n);
+/**	@brief  Create a random BIG from a random number generator (Constant Time)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_random(BIG x, csprng *r);
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randomnum(BIG x, BIG n, csprng *r);
+
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus and truncated to max bit length (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param t Maximum bit length
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randtrunc(BIG x, BIG n, int t, csprng *r);
+
+/**	brief  return NAF (Non-Adjacent-Form) value as +/- 1, 3 or 5, inputs must be normalised
+ *
+	Given x and 3*x extracts NAF value from given bit position, and returns number of bits processed, and number of trailing zeros detected if any
+	param x BIG number
+	param x3 BIG number, three times x
+	param i bit position
+	param nbs pointer to integer returning number of bits processed
+	param nzs pointer to integer returning number of trailing 0s
+	return + or - 1, 3 or 5
+*/
+
+/**	@brief  Calculate x=y*z mod n (Variable Time)
+ *
+	Slow method for modular multiplication
+	@param x BIG number, on exit = y*z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modmul(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y/z mod n (Variable Time)
+ *
+	Slow method for modular division
+	@param x BIG number, on exit = y/z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_moddiv(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y^2 mod n (Variable Time)
+ *
+	Slow method for modular squaring
+	@param x BIG number, on exit = y^2 mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modsqr(BIG x, BIG y, BIG n);
+/**	@brief  Calculate x=-y mod n (Variable Time)
+ *
+	Modular negation
+	@param x BIG number, on exit = -y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modneg(BIG x, BIG y, BIG n);
+
+/**	@brief  Calculate x=y+z mod n (Variable Time)
+ *
+	Slow method for modular addition
+	@param x BIG number, on exit = y+z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modadd(BIG x, BIG y, BIG z, BIG n);
+
+/**	@brief  Calculate jacobi Symbol (x/y) (Variable Time)
+ *
+	@param x BIG number
+	@param y BIG number
+	@return Jacobi symbol, -1,0 or 1
+ */
+extern int BIG_jacobi(BIG x, BIG y);
+/**	@brief  Calculate x=1/y mod n (Variable Time)
+ *
+	Modular Inversion - This is slow. Uses binary method.
+	@param x BIG number, on exit = 1/y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_invmodp(BIG x, BIG y, BIG n);
+/** @brief Calculate x=x mod 2^m (Variable Time)
+ *
+	Truncation
+	@param x BIG number, on reduced mod 2^m
+	@param m new truncated size
+*/
+extern void BIG_mod2m(BIG x, int m);
+
+/**	@brief Calculates a*b+c+*d
+ *
+	Calculate partial product of a.b, add in carry c, and add total to d (Constant Time)
+	@param a multiplier
+	@param b multiplicand
+	@param c carry
+	@param d pointer to accumulated bottom half of result
+	@return top half of result
+ */
+
+
+extern int step1(BIG,BIG,BIG);
+extern void step2(BIG,BIG,BIG);
+
+#ifdef dchunk
+
+/* Method required to calculate x*y+c+r, bottom half in r, top half returned */
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    dchunk prod = (dchunk)x * y + c + *r;
+    *r = (chunk)prod & BMASK_B512_29;
+    return (chunk)(prod >> BASEBITS_B512_29);
+}
+
+#else
+
+/* No integer type available that can store double the wordlength */
+/* accumulate partial products */
+
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    chunk x0, x1, y0, y1;
+    chunk bot, top, mid, carry;
+    x0 = x & HMASK_B512_29;
+    x1 = (x >> HBITS_B512_29);
+    y0 = y & HMASK_B512_29;
+    y1 = (y >> HBITS_B512_29);
+    bot = x0 * y0;
+    top = x1 * y1;
+    mid = x0 * y1 + x1 * y0;
+    x0 = mid & HMASK_B512_29;
+    x1 = (mid >> HBITS_B512_29);
+    bot += x0 << HBITS_B512_29;
+    bot += *r;
+    bot += c;
+
+    top += x1;
+    carry = bot >> BASEBITS_B512_29;
+    bot &= BMASK_B512_29;
+    top += carry;
+
+    *r = bot;
+    return top;
+}
+
+#endif
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/big_B528_28.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/big_B528_28.h
new file mode 100644
index 0000000..71363c8
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/big_B528_28.h
@@ -0,0 +1,697 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file big.h
+ * @author Mike Scott
+ * @date 23rd February 2016
+ * @brief Big number Header File
+ *
+ *
+ */
+
+#ifndef BIG_B528_28_H
+#define BIG_B528_28_H
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <inttypes.h>
+#include "arch.h"
+#include "core.h"
+#include "config_big_B528_28.h"
+
+using namespace core;
+
+/* could comment this out if code size is a major issue */
+#define UNWOUND
+/* Normally recommended, but may not be optimal for some architectures, for example 32-bit ARM M4 */
+#define USE_KARATSUBA
+
+#define BIGBITS_B528_28 (8*MODBYTES_B528_28)
+#define NLEN_B528_28 (1+((8*MODBYTES_B528_28-1)/BASEBITS_B528_28))
+#define DNLEN_B528_28 2*NLEN_B528_28
+#define BMASK_B528_28 (((chunk)1<<BASEBITS_B528_28)-1) /**< Mask = 2^BASEBITS-1 */
+#define NEXCESS_B528_28 (1<<(CHUNK-BASEBITS_B528_28-1))           /**< 2^(CHUNK-BASEBITS-1) - digit cannot be multiplied by more than this before normalisation */
+
+#define HBITS_B528_28 (BASEBITS_B528_28/2)      /**< Number of bits in number base divided by 2 */
+#define HMASK_B528_28 (((chunk)1<<HBITS_B528_28)-1)    /**< Mask = 2^HBITS-1 */
+
+//#define DEBUG_NORM
+
+#ifdef DEBUG_NORM  /* Add an extra location to track chunk extension */
+#define MPV_B528_28 NLEN_B528_28
+#define MNV_B528_28 (NLEN_B528_28+1)
+#define DMPV_B528_28 DNLEN_B528_28
+#define DMNV_B528_28 (DNLEN_B528_28+1)
+
+#endif
+
+namespace B528_28 {
+
+//extern int BIGMULS;
+//extern int BIGSQRS;
+
+#ifdef DEBUG_NORM
+typedef chunk BIG[NLEN_B528_28 + 2]; /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B528_28 + 2]; /**< Define type DBIG as array of chunks */
+#else
+typedef chunk BIG[NLEN_B528_28];     /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B528_28];   /**< Define type DBIG as array of chunks */
+#endif
+
+/* BIG number prototypes */
+
+/**	@brief Tests for BIG equal to zero (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_iszilch(BIG x);
+/**	@brief Tests for BIG equal to one (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if one, else returns 0
+ */
+extern int BIG_isunity(BIG x);
+/**	@brief Tests for DBIG equal to zero (Constant Time)
+ *
+	@param x a DBIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_diszilch(DBIG x);
+/**	@brief Outputs a BIG number to the console (Variable Time)
+ *
+	@param x a BIG number
+ */
+extern void BIG_output(BIG x);
+/**	@brief Outputs a BIG number to the console in raw form (Variable Time for debugging)
+ *
+	@param x a BIG number
+ */
+extern void BIG_rawoutput(BIG x);
+/**	@brief Conditional constant time swap of two BIG numbers
+ *
+	Conditionally swaps parameters in constant time (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s swap takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cswap(BIG x, BIG y, int s);
+/**	@brief Conditional copy of BIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cmove(BIG x, BIG y, int s);
+/**	@brief Conditional copy of DBIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a DBIG number
+	@param y another DBIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_dcmove(BIG x, BIG y, int s);
+/**	@brief Convert from BIG number to byte array (Constant Time)
+ *
+	@param a byte array
+	@param x BIG number
+ */
+extern void BIG_toBytes(char *a, BIG x);
+/**	@brief Convert to BIG number from byte array (Constant Time)
+ *
+	@param x BIG number
+	@param a byte array
+ */
+extern void BIG_fromBytes(BIG x, char *a);
+/**	@brief Convert to BIG number from byte array of given length (Variable Time)
+ *
+	@param x BIG number
+	@param a byte array
+	@param s byte array length
+ */
+extern void BIG_fromBytesLen(BIG x, char *a, int s);
+/**@brief Convert to DBIG number from byte array of given length (Variable Time)
+ *
+   @param x DBIG number
+   @param a byte array
+   @param s byte array length
+ */
+extern void BIG_dfromBytesLen(DBIG x, char *a, int s);
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_doutput(DBIG x); 
+
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_drawoutput(DBIG x);
+
+/**	@brief Copy BIG from Read-Only Memory to a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number in ROM
+ */
+extern void BIG_rcopy(BIG x, const BIG y);
+/**	@brief Copy BIG to another BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_copy(BIG x, BIG y);
+/**	@brief Copy DBIG to another DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_dcopy(DBIG x, DBIG y);
+/**	@brief Copy BIG to upper half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dsucopy(DBIG x, BIG y);
+/**	@brief Copy BIG to lower half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dscopy(DBIG x, BIG y);
+/**	@brief Copy lower half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sdcopy(BIG x, DBIG y);
+/**	@brief Copy upper half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sducopy(BIG x, DBIG y);
+/**	@brief Set BIG to zero (Constant Time)
+ *
+	@param x BIG number to be set to zero  
+ */
+extern void BIG_zero(BIG x);
+/**	@brief Set DBIG to zero (Constant Time)
+ *
+	@param x DBIG number to be set to zero
+ */
+extern void BIG_dzero(DBIG x);
+/**	@brief Set BIG to one (unity) (Constant Time)
+ *
+	@param x BIG number to be set to one.
+ */
+extern void BIG_one(BIG x);
+/**	@brief Set BIG to inverse mod 2^256 (Constant Time)
+ *
+	@param x BIG number to be inverted
+ */
+extern void BIG_invmod2m(BIG x);
+/**	@brief Set BIG to sum of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, sum of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_add(BIG x, BIG y, BIG z);
+
+/**	@brief Set BIG to logical or of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, or of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_or(BIG x, BIG y, BIG z);
+
+/**	@brief Increment BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be incremented
+	@param i integer
+ */
+extern void BIG_inc(BIG x, int i);
+/**	@brief Set BIG to difference of two BIGs (Constant Time)
+ *
+	@param x BIG number, difference of other two - output not normalised
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_sub(BIG x, BIG y, BIG z);
+/**	@brief Decrement BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be decremented
+	@param i integer
+ */
+extern void BIG_dec(BIG x, int i);
+/**	@brief Set DBIG to sum of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, sum of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dadd(DBIG x, DBIG y, DBIG z);
+/**	@brief Set DBIG to difference of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, difference of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dsub(DBIG x, DBIG y, DBIG z);
+/**	@brief Multiply BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_imul(BIG x, BIG y, int i);
+/**	@brief Multiply BIG by not-so-small small integer - output normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+	@return Overflowing bits
+ */
+extern chunk BIG_pmul(BIG x, BIG y, int i);
+/**	@brief Divide BIG by 3 - output normalised (Constant Time)
+ *
+	@param x BIG number
+	@return Remainder
+ */
+extern int BIG_div3(BIG x);
+/**	@brief Multiply BIG by even bigger small integer resulting in a DBIG - output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_pxmul(DBIG x, BIG y, int i);
+/**	@brief Multiply BIG by another BIG resulting in DBIG - inputs normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_mul(DBIG x, BIG y, BIG z);
+/**	@brief Multiply BIG by another BIG resulting in another BIG - inputs normalised and output normalised (Constant Time)
+ *
+	Note that the product must fit into a BIG, and x must be distinct from y and z
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_smul(BIG x, BIG y, BIG z);
+/**	@brief Square BIG resulting in a DBIG - input normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, square of a BIG
+	@param y BIG number to be squared
+ */
+extern void BIG_sqr(DBIG x, BIG y);
+
+/**	@brief Montgomery reduction of a DBIG to a BIG  - input normalised and output normalised (Constant Time)
+ *
+	@param a BIG number, reduction of a BIG
+	@param md BIG number, the modulus
+	@param MC the Montgomery Constant
+	@param d DBIG number to be reduced
+ */
+extern void BIG_monty(BIG a, BIG md, chunk MC, DBIG d);
+
+/**	@brief Shifts a BIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shl(BIG x, int s);
+/**	@brief Fast shifts a BIG left by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Overflow bits
+ */
+extern int BIG_fshl(BIG x, int s);
+/**	@brief Shifts a DBIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshl(DBIG x, int s);
+/**	@brief Shifts a BIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shr(BIG x, int s);
+
+
+/**	@brief Fast time-critical combined shift by 1 bit, subtract and normalise (Constant Time)
+ *
+	@param r BIG number normalised output
+	@param a BIG number to be subtracted from
+	@param m BIG number to be shifted and subtracted
+	@return sign of r
+ */
+extern int BIG_ssn(BIG r, BIG a, BIG m);
+
+/**	@brief Fast shifts a BIG right by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Shifted out bits
+ */
+extern int BIG_fshr(BIG x, int s);
+/**	@brief Shifts a DBIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshr(DBIG x, int s);
+/**	@brief Splits a DBIG into two BIGs - input must be normalised, outputs normalised (Constant Time as used)
+ *
+	Internal function. The value of s must be approximately in the middle of the DBIG.
+	Typically used to extract z mod 2^MODBITS and z/2^MODBITS
+	@param x BIG number, top half of z
+	@param y BIG number, bottom half of z
+	@param z DBIG number to be split in two.
+	@param s Bit position at which to split
+	@return carry-out from top half
+ */
+extern chunk BIG_split(BIG x, BIG y, DBIG z, int s);
+/**	@brief Normalizes a BIG number - output normalised (Constant Time)
+ *
+	All digits of the input BIG are reduced mod 2^BASEBITS
+	@param x BIG number to be normalised
+ */
+extern chunk BIG_norm(BIG x);
+/**	@brief Normalizes a DBIG number - output normalised (Constant Time)
+ *
+	All digits of the input DBIG are reduced mod 2^BASEBITS
+	@param x DBIG number to be normalised
+ */
+extern void BIG_dnorm(DBIG x);
+/**	@brief Compares two BIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first BIG number to be compared
+	@param y second BIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_comp(BIG x, BIG y);
+/**	@brief Compares two DBIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first DBIG number to be compared
+	@param y second DBIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_dcomp(DBIG x, DBIG y);
+/**	@brief Calculate number of bits in a BIG - output normalised (Variable Time)
+ *
+	@param x BIG number
+	@return Number of bits in x
+ */
+extern int BIG_nbits(BIG x);
+/**	@brief Calculate number of bits in a DBIG - output normalised (Variable Time)
+ *
+	@param x DBIG number
+	@return Number of bits in x
+ */
+extern int BIG_dnbits(DBIG x);
+
+/**	@brief Reduce x mod n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctmod(BIG x, BIG n, int bd);
+
+/**	@brief  x=y mod n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctdmod(BIG x, DBIG y, BIG n, int bd);
+
+/**	@brief Divide x by n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctsdiv(BIG x,BIG n,int bd);
+
+/**	@brief  x=y/n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctddiv(BIG x, DBIG y, BIG n,int bd);
+
+
+/**	@brief Reduce x mod n - input and output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+ */
+extern void BIG_mod(BIG x, BIG n);
+/**	@brief Divide x by n - output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+ */
+extern void BIG_sdiv(BIG x, BIG n);
+/**	@brief  x=y mod n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_dmod(BIG x, DBIG y, BIG n);
+/**	@brief  x=y/n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_ddiv(BIG x, DBIG y, BIG n);
+/**	@brief  return parity of BIG, that is the least significant bit (Constant Time)
+ *
+	@param x BIG number
+	@return 0 or 1
+ */
+extern int BIG_parity(BIG x);
+/**	@brief  return i-th of BIG (Constant Time)
+ *
+	@param x BIG number
+	@param i the bit of x to be returned
+	@return 0 or 1
+ */
+extern int BIG_bit(BIG x, int i);
+/**	@brief  return least significant bits of a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param n number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int BIG_lastbits(BIG x, int n);
+/**	@brief  Create a random BIG from a random number generator (Constant Time)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_random(BIG x, csprng *r);
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randomnum(BIG x, BIG n, csprng *r);
+
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus and truncated to max bit length (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param t Maximum bit length
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randtrunc(BIG x, BIG n, int t, csprng *r);
+
+/**	brief  return NAF (Non-Adjacent-Form) value as +/- 1, 3 or 5, inputs must be normalised
+ *
+	Given x and 3*x extracts NAF value from given bit position, and returns number of bits processed, and number of trailing zeros detected if any
+	param x BIG number
+	param x3 BIG number, three times x
+	param i bit position
+	param nbs pointer to integer returning number of bits processed
+	param nzs pointer to integer returning number of trailing 0s
+	return + or - 1, 3 or 5
+*/
+
+/**	@brief  Calculate x=y*z mod n (Variable Time)
+ *
+	Slow method for modular multiplication
+	@param x BIG number, on exit = y*z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modmul(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y/z mod n (Variable Time)
+ *
+	Slow method for modular division
+	@param x BIG number, on exit = y/z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_moddiv(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y^2 mod n (Variable Time)
+ *
+	Slow method for modular squaring
+	@param x BIG number, on exit = y^2 mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modsqr(BIG x, BIG y, BIG n);
+/**	@brief  Calculate x=-y mod n (Variable Time)
+ *
+	Modular negation
+	@param x BIG number, on exit = -y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modneg(BIG x, BIG y, BIG n);
+
+/**	@brief  Calculate x=y+z mod n (Variable Time)
+ *
+	Slow method for modular addition
+	@param x BIG number, on exit = y+z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modadd(BIG x, BIG y, BIG z, BIG n);
+
+/**	@brief  Calculate jacobi Symbol (x/y) (Variable Time)
+ *
+	@param x BIG number
+	@param y BIG number
+	@return Jacobi symbol, -1,0 or 1
+ */
+extern int BIG_jacobi(BIG x, BIG y);
+/**	@brief  Calculate x=1/y mod n (Variable Time)
+ *
+	Modular Inversion - This is slow. Uses binary method.
+	@param x BIG number, on exit = 1/y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_invmodp(BIG x, BIG y, BIG n);
+/** @brief Calculate x=x mod 2^m (Variable Time)
+ *
+	Truncation
+	@param x BIG number, on reduced mod 2^m
+	@param m new truncated size
+*/
+extern void BIG_mod2m(BIG x, int m);
+
+/**	@brief Calculates a*b+c+*d
+ *
+	Calculate partial product of a.b, add in carry c, and add total to d (Constant Time)
+	@param a multiplier
+	@param b multiplicand
+	@param c carry
+	@param d pointer to accumulated bottom half of result
+	@return top half of result
+ */
+
+
+extern int step1(BIG,BIG,BIG);
+extern void step2(BIG,BIG,BIG);
+
+#ifdef dchunk
+
+/* Method required to calculate x*y+c+r, bottom half in r, top half returned */
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    dchunk prod = (dchunk)x * y + c + *r;
+    *r = (chunk)prod & BMASK_B528_28;
+    return (chunk)(prod >> BASEBITS_B528_28);
+}
+
+#else
+
+/* No integer type available that can store double the wordlength */
+/* accumulate partial products */
+
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    chunk x0, x1, y0, y1;
+    chunk bot, top, mid, carry;
+    x0 = x & HMASK_B528_28;
+    x1 = (x >> HBITS_B528_28);
+    y0 = y & HMASK_B528_28;
+    y1 = (y >> HBITS_B528_28);
+    bot = x0 * y0;
+    top = x1 * y1;
+    mid = x0 * y1 + x1 * y0;
+    x0 = mid & HMASK_B528_28;
+    x1 = (mid >> HBITS_B528_28);
+    bot += x0 << HBITS_B528_28;
+    bot += *r;
+    bot += c;
+
+    top += x1;
+    carry = bot >> BASEBITS_B528_28;
+    bot &= BMASK_B528_28;
+    top += carry;
+
+    *r = bot;
+    return top;
+}
+
+#endif
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/big_B560_29.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/big_B560_29.h
new file mode 100644
index 0000000..a1f43ea
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/big_B560_29.h
@@ -0,0 +1,697 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file big.h
+ * @author Mike Scott
+ * @date 23rd February 2016
+ * @brief Big number Header File
+ *
+ *
+ */
+
+#ifndef BIG_B560_29_H
+#define BIG_B560_29_H
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <inttypes.h>
+#include "arch.h"
+#include "core.h"
+#include "config_big_B560_29.h"
+
+using namespace core;
+
+/* could comment this out if code size is a major issue */
+#define UNWOUND
+/* Normally recommended, but may not be optimal for some architectures, for example 32-bit ARM M4 */
+#define USE_KARATSUBA
+
+#define BIGBITS_B560_29 (8*MODBYTES_B560_29)
+#define NLEN_B560_29 (1+((8*MODBYTES_B560_29-1)/BASEBITS_B560_29))
+#define DNLEN_B560_29 2*NLEN_B560_29
+#define BMASK_B560_29 (((chunk)1<<BASEBITS_B560_29)-1) /**< Mask = 2^BASEBITS-1 */
+#define NEXCESS_B560_29 (1<<(CHUNK-BASEBITS_B560_29-1))           /**< 2^(CHUNK-BASEBITS-1) - digit cannot be multiplied by more than this before normalisation */
+
+#define HBITS_B560_29 (BASEBITS_B560_29/2)      /**< Number of bits in number base divided by 2 */
+#define HMASK_B560_29 (((chunk)1<<HBITS_B560_29)-1)    /**< Mask = 2^HBITS-1 */
+
+//#define DEBUG_NORM
+
+#ifdef DEBUG_NORM  /* Add an extra location to track chunk extension */
+#define MPV_B560_29 NLEN_B560_29
+#define MNV_B560_29 (NLEN_B560_29+1)
+#define DMPV_B560_29 DNLEN_B560_29
+#define DMNV_B560_29 (DNLEN_B560_29+1)
+
+#endif
+
+namespace B560_29 {
+
+//extern int BIGMULS;
+//extern int BIGSQRS;
+
+#ifdef DEBUG_NORM
+typedef chunk BIG[NLEN_B560_29 + 2]; /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B560_29 + 2]; /**< Define type DBIG as array of chunks */
+#else
+typedef chunk BIG[NLEN_B560_29];     /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B560_29];   /**< Define type DBIG as array of chunks */
+#endif
+
+/* BIG number prototypes */
+
+/**	@brief Tests for BIG equal to zero (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_iszilch(BIG x);
+/**	@brief Tests for BIG equal to one (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if one, else returns 0
+ */
+extern int BIG_isunity(BIG x);
+/**	@brief Tests for DBIG equal to zero (Constant Time)
+ *
+	@param x a DBIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_diszilch(DBIG x);
+/**	@brief Outputs a BIG number to the console (Variable Time)
+ *
+	@param x a BIG number
+ */
+extern void BIG_output(BIG x);
+/**	@brief Outputs a BIG number to the console in raw form (Variable Time for debugging)
+ *
+	@param x a BIG number
+ */
+extern void BIG_rawoutput(BIG x);
+/**	@brief Conditional constant time swap of two BIG numbers
+ *
+	Conditionally swaps parameters in constant time (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s swap takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cswap(BIG x, BIG y, int s);
+/**	@brief Conditional copy of BIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cmove(BIG x, BIG y, int s);
+/**	@brief Conditional copy of DBIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a DBIG number
+	@param y another DBIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_dcmove(BIG x, BIG y, int s);
+/**	@brief Convert from BIG number to byte array (Constant Time)
+ *
+	@param a byte array
+	@param x BIG number
+ */
+extern void BIG_toBytes(char *a, BIG x);
+/**	@brief Convert to BIG number from byte array (Constant Time)
+ *
+	@param x BIG number
+	@param a byte array
+ */
+extern void BIG_fromBytes(BIG x, char *a);
+/**	@brief Convert to BIG number from byte array of given length (Variable Time)
+ *
+	@param x BIG number
+	@param a byte array
+	@param s byte array length
+ */
+extern void BIG_fromBytesLen(BIG x, char *a, int s);
+/**@brief Convert to DBIG number from byte array of given length (Variable Time)
+ *
+   @param x DBIG number
+   @param a byte array
+   @param s byte array length
+ */
+extern void BIG_dfromBytesLen(DBIG x, char *a, int s);
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_doutput(DBIG x); 
+
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_drawoutput(DBIG x);
+
+/**	@brief Copy BIG from Read-Only Memory to a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number in ROM
+ */
+extern void BIG_rcopy(BIG x, const BIG y);
+/**	@brief Copy BIG to another BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_copy(BIG x, BIG y);
+/**	@brief Copy DBIG to another DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_dcopy(DBIG x, DBIG y);
+/**	@brief Copy BIG to upper half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dsucopy(DBIG x, BIG y);
+/**	@brief Copy BIG to lower half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dscopy(DBIG x, BIG y);
+/**	@brief Copy lower half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sdcopy(BIG x, DBIG y);
+/**	@brief Copy upper half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sducopy(BIG x, DBIG y);
+/**	@brief Set BIG to zero (Constant Time)
+ *
+	@param x BIG number to be set to zero  
+ */
+extern void BIG_zero(BIG x);
+/**	@brief Set DBIG to zero (Constant Time)
+ *
+	@param x DBIG number to be set to zero
+ */
+extern void BIG_dzero(DBIG x);
+/**	@brief Set BIG to one (unity) (Constant Time)
+ *
+	@param x BIG number to be set to one.
+ */
+extern void BIG_one(BIG x);
+/**	@brief Set BIG to inverse mod 2^256 (Constant Time)
+ *
+	@param x BIG number to be inverted
+ */
+extern void BIG_invmod2m(BIG x);
+/**	@brief Set BIG to sum of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, sum of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_add(BIG x, BIG y, BIG z);
+
+/**	@brief Set BIG to logical or of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, or of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_or(BIG x, BIG y, BIG z);
+
+/**	@brief Increment BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be incremented
+	@param i integer
+ */
+extern void BIG_inc(BIG x, int i);
+/**	@brief Set BIG to difference of two BIGs (Constant Time)
+ *
+	@param x BIG number, difference of other two - output not normalised
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_sub(BIG x, BIG y, BIG z);
+/**	@brief Decrement BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be decremented
+	@param i integer
+ */
+extern void BIG_dec(BIG x, int i);
+/**	@brief Set DBIG to sum of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, sum of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dadd(DBIG x, DBIG y, DBIG z);
+/**	@brief Set DBIG to difference of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, difference of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dsub(DBIG x, DBIG y, DBIG z);
+/**	@brief Multiply BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_imul(BIG x, BIG y, int i);
+/**	@brief Multiply BIG by not-so-small small integer - output normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+	@return Overflowing bits
+ */
+extern chunk BIG_pmul(BIG x, BIG y, int i);
+/**	@brief Divide BIG by 3 - output normalised (Constant Time)
+ *
+	@param x BIG number
+	@return Remainder
+ */
+extern int BIG_div3(BIG x);
+/**	@brief Multiply BIG by even bigger small integer resulting in a DBIG - output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_pxmul(DBIG x, BIG y, int i);
+/**	@brief Multiply BIG by another BIG resulting in DBIG - inputs normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_mul(DBIG x, BIG y, BIG z);
+/**	@brief Multiply BIG by another BIG resulting in another BIG - inputs normalised and output normalised (Constant Time)
+ *
+	Note that the product must fit into a BIG, and x must be distinct from y and z
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_smul(BIG x, BIG y, BIG z);
+/**	@brief Square BIG resulting in a DBIG - input normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, square of a BIG
+	@param y BIG number to be squared
+ */
+extern void BIG_sqr(DBIG x, BIG y);
+
+/**	@brief Montgomery reduction of a DBIG to a BIG  - input normalised and output normalised (Constant Time)
+ *
+	@param a BIG number, reduction of a BIG
+	@param md BIG number, the modulus
+	@param MC the Montgomery Constant
+	@param d DBIG number to be reduced
+ */
+extern void BIG_monty(BIG a, BIG md, chunk MC, DBIG d);
+
+/**	@brief Shifts a BIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shl(BIG x, int s);
+/**	@brief Fast shifts a BIG left by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Overflow bits
+ */
+extern int BIG_fshl(BIG x, int s);
+/**	@brief Shifts a DBIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshl(DBIG x, int s);
+/**	@brief Shifts a BIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shr(BIG x, int s);
+
+
+/**	@brief Fast time-critical combined shift by 1 bit, subtract and normalise (Constant Time)
+ *
+	@param r BIG number normalised output
+	@param a BIG number to be subtracted from
+	@param m BIG number to be shifted and subtracted
+	@return sign of r
+ */
+extern int BIG_ssn(BIG r, BIG a, BIG m);
+
+/**	@brief Fast shifts a BIG right by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Shifted out bits
+ */
+extern int BIG_fshr(BIG x, int s);
+/**	@brief Shifts a DBIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshr(DBIG x, int s);
+/**	@brief Splits a DBIG into two BIGs - input must be normalised, outputs normalised (Constant Time as used)
+ *
+	Internal function. The value of s must be approximately in the middle of the DBIG.
+	Typically used to extract z mod 2^MODBITS and z/2^MODBITS
+	@param x BIG number, top half of z
+	@param y BIG number, bottom half of z
+	@param z DBIG number to be split in two.
+	@param s Bit position at which to split
+	@return carry-out from top half
+ */
+extern chunk BIG_split(BIG x, BIG y, DBIG z, int s);
+/**	@brief Normalizes a BIG number - output normalised (Constant Time)
+ *
+	All digits of the input BIG are reduced mod 2^BASEBITS
+	@param x BIG number to be normalised
+ */
+extern chunk BIG_norm(BIG x);
+/**	@brief Normalizes a DBIG number - output normalised (Constant Time)
+ *
+	All digits of the input DBIG are reduced mod 2^BASEBITS
+	@param x DBIG number to be normalised
+ */
+extern void BIG_dnorm(DBIG x);
+/**	@brief Compares two BIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first BIG number to be compared
+	@param y second BIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_comp(BIG x, BIG y);
+/**	@brief Compares two DBIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first DBIG number to be compared
+	@param y second DBIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_dcomp(DBIG x, DBIG y);
+/**	@brief Calculate number of bits in a BIG - output normalised (Variable Time)
+ *
+	@param x BIG number
+	@return Number of bits in x
+ */
+extern int BIG_nbits(BIG x);
+/**	@brief Calculate number of bits in a DBIG - output normalised (Variable Time)
+ *
+	@param x DBIG number
+	@return Number of bits in x
+ */
+extern int BIG_dnbits(DBIG x);
+
+/**	@brief Reduce x mod n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctmod(BIG x, BIG n, int bd);
+
+/**	@brief  x=y mod n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctdmod(BIG x, DBIG y, BIG n, int bd);
+
+/**	@brief Divide x by n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctsdiv(BIG x,BIG n,int bd);
+
+/**	@brief  x=y/n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctddiv(BIG x, DBIG y, BIG n,int bd);
+
+
+/**	@brief Reduce x mod n - input and output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+ */
+extern void BIG_mod(BIG x, BIG n);
+/**	@brief Divide x by n - output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+ */
+extern void BIG_sdiv(BIG x, BIG n);
+/**	@brief  x=y mod n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_dmod(BIG x, DBIG y, BIG n);
+/**	@brief  x=y/n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_ddiv(BIG x, DBIG y, BIG n);
+/**	@brief  return parity of BIG, that is the least significant bit (Constant Time)
+ *
+	@param x BIG number
+	@return 0 or 1
+ */
+extern int BIG_parity(BIG x);
+/**	@brief  return i-th of BIG (Constant Time)
+ *
+	@param x BIG number
+	@param i the bit of x to be returned
+	@return 0 or 1
+ */
+extern int BIG_bit(BIG x, int i);
+/**	@brief  return least significant bits of a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param n number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int BIG_lastbits(BIG x, int n);
+/**	@brief  Create a random BIG from a random number generator (Constant Time)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_random(BIG x, csprng *r);
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randomnum(BIG x, BIG n, csprng *r);
+
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus and truncated to max bit length (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param t Maximum bit length
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randtrunc(BIG x, BIG n, int t, csprng *r);
+
+/**	brief  return NAF (Non-Adjacent-Form) value as +/- 1, 3 or 5, inputs must be normalised
+ *
+	Given x and 3*x extracts NAF value from given bit position, and returns number of bits processed, and number of trailing zeros detected if any
+	param x BIG number
+	param x3 BIG number, three times x
+	param i bit position
+	param nbs pointer to integer returning number of bits processed
+	param nzs pointer to integer returning number of trailing 0s
+	return + or - 1, 3 or 5
+*/
+
+/**	@brief  Calculate x=y*z mod n (Variable Time)
+ *
+	Slow method for modular multiplication
+	@param x BIG number, on exit = y*z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modmul(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y/z mod n (Variable Time)
+ *
+	Slow method for modular division
+	@param x BIG number, on exit = y/z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_moddiv(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y^2 mod n (Variable Time)
+ *
+	Slow method for modular squaring
+	@param x BIG number, on exit = y^2 mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modsqr(BIG x, BIG y, BIG n);
+/**	@brief  Calculate x=-y mod n (Variable Time)
+ *
+	Modular negation
+	@param x BIG number, on exit = -y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modneg(BIG x, BIG y, BIG n);
+
+/**	@brief  Calculate x=y+z mod n (Variable Time)
+ *
+	Slow method for modular addition
+	@param x BIG number, on exit = y+z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modadd(BIG x, BIG y, BIG z, BIG n);
+
+/**	@brief  Calculate jacobi Symbol (x/y) (Variable Time)
+ *
+	@param x BIG number
+	@param y BIG number
+	@return Jacobi symbol, -1,0 or 1
+ */
+extern int BIG_jacobi(BIG x, BIG y);
+/**	@brief  Calculate x=1/y mod n (Variable Time)
+ *
+	Modular Inversion - This is slow. Uses binary method.
+	@param x BIG number, on exit = 1/y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_invmodp(BIG x, BIG y, BIG n);
+/** @brief Calculate x=x mod 2^m (Variable Time)
+ *
+	Truncation
+	@param x BIG number, on reduced mod 2^m
+	@param m new truncated size
+*/
+extern void BIG_mod2m(BIG x, int m);
+
+/**	@brief Calculates a*b+c+*d
+ *
+	Calculate partial product of a.b, add in carry c, and add total to d (Constant Time)
+	@param a multiplier
+	@param b multiplicand
+	@param c carry
+	@param d pointer to accumulated bottom half of result
+	@return top half of result
+ */
+
+
+extern int step1(BIG,BIG,BIG);
+extern void step2(BIG,BIG,BIG);
+
+#ifdef dchunk
+
+/* Method required to calculate x*y+c+r, bottom half in r, top half returned */
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    dchunk prod = (dchunk)x * y + c + *r;
+    *r = (chunk)prod & BMASK_B560_29;
+    return (chunk)(prod >> BASEBITS_B560_29);
+}
+
+#else
+
+/* No integer type available that can store double the wordlength */
+/* accumulate partial products */
+
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    chunk x0, x1, y0, y1;
+    chunk bot, top, mid, carry;
+    x0 = x & HMASK_B560_29;
+    x1 = (x >> HBITS_B560_29);
+    y0 = y & HMASK_B560_29;
+    y1 = (y >> HBITS_B560_29);
+    bot = x0 * y0;
+    top = x1 * y1;
+    mid = x0 * y1 + x1 * y0;
+    x0 = mid & HMASK_B560_29;
+    x1 = (mid >> HBITS_B560_29);
+    bot += x0 << HBITS_B560_29;
+    bot += *r;
+    bot += c;
+
+    top += x1;
+    carry = bot >> BASEBITS_B560_29;
+    bot &= BMASK_B560_29;
+    top += carry;
+
+    *r = bot;
+    return top;
+}
+
+#endif
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/big_B584_29.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/big_B584_29.h
new file mode 100644
index 0000000..b44fd41
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/big_B584_29.h
@@ -0,0 +1,697 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file big.h
+ * @author Mike Scott
+ * @date 23rd February 2016
+ * @brief Big number Header File
+ *
+ *
+ */
+
+#ifndef BIG_B584_29_H
+#define BIG_B584_29_H
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <inttypes.h>
+#include "arch.h"
+#include "core.h"
+#include "config_big_B584_29.h"
+
+using namespace core;
+
+/* could comment this out if code size is a major issue */
+#define UNWOUND
+/* Normally recommended, but may not be optimal for some architectures, for example 32-bit ARM M4 */
+#define USE_KARATSUBA
+
+#define BIGBITS_B584_29 (8*MODBYTES_B584_29)
+#define NLEN_B584_29 (1+((8*MODBYTES_B584_29-1)/BASEBITS_B584_29))
+#define DNLEN_B584_29 2*NLEN_B584_29
+#define BMASK_B584_29 (((chunk)1<<BASEBITS_B584_29)-1) /**< Mask = 2^BASEBITS-1 */
+#define NEXCESS_B584_29 (1<<(CHUNK-BASEBITS_B584_29-1))           /**< 2^(CHUNK-BASEBITS-1) - digit cannot be multiplied by more than this before normalisation */
+
+#define HBITS_B584_29 (BASEBITS_B584_29/2)      /**< Number of bits in number base divided by 2 */
+#define HMASK_B584_29 (((chunk)1<<HBITS_B584_29)-1)    /**< Mask = 2^HBITS-1 */
+
+//#define DEBUG_NORM
+
+#ifdef DEBUG_NORM  /* Add an extra location to track chunk extension */
+#define MPV_B584_29 NLEN_B584_29
+#define MNV_B584_29 (NLEN_B584_29+1)
+#define DMPV_B584_29 DNLEN_B584_29
+#define DMNV_B584_29 (DNLEN_B584_29+1)
+
+#endif
+
+namespace B584_29 {
+
+//extern int BIGMULS;
+//extern int BIGSQRS;
+
+#ifdef DEBUG_NORM
+typedef chunk BIG[NLEN_B584_29 + 2]; /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B584_29 + 2]; /**< Define type DBIG as array of chunks */
+#else
+typedef chunk BIG[NLEN_B584_29];     /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B584_29];   /**< Define type DBIG as array of chunks */
+#endif
+
+/* BIG number prototypes */
+
+/**	@brief Tests for BIG equal to zero (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_iszilch(BIG x);
+/**	@brief Tests for BIG equal to one (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if one, else returns 0
+ */
+extern int BIG_isunity(BIG x);
+/**	@brief Tests for DBIG equal to zero (Constant Time)
+ *
+	@param x a DBIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_diszilch(DBIG x);
+/**	@brief Outputs a BIG number to the console (Variable Time)
+ *
+	@param x a BIG number
+ */
+extern void BIG_output(BIG x);
+/**	@brief Outputs a BIG number to the console in raw form (Variable Time for debugging)
+ *
+	@param x a BIG number
+ */
+extern void BIG_rawoutput(BIG x);
+/**	@brief Conditional constant time swap of two BIG numbers
+ *
+	Conditionally swaps parameters in constant time (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s swap takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cswap(BIG x, BIG y, int s);
+/**	@brief Conditional copy of BIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cmove(BIG x, BIG y, int s);
+/**	@brief Conditional copy of DBIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a DBIG number
+	@param y another DBIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_dcmove(BIG x, BIG y, int s);
+/**	@brief Convert from BIG number to byte array (Constant Time)
+ *
+	@param a byte array
+	@param x BIG number
+ */
+extern void BIG_toBytes(char *a, BIG x);
+/**	@brief Convert to BIG number from byte array (Constant Time)
+ *
+	@param x BIG number
+	@param a byte array
+ */
+extern void BIG_fromBytes(BIG x, char *a);
+/**	@brief Convert to BIG number from byte array of given length (Variable Time)
+ *
+	@param x BIG number
+	@param a byte array
+	@param s byte array length
+ */
+extern void BIG_fromBytesLen(BIG x, char *a, int s);
+/**@brief Convert to DBIG number from byte array of given length (Variable Time)
+ *
+   @param x DBIG number
+   @param a byte array
+   @param s byte array length
+ */
+extern void BIG_dfromBytesLen(DBIG x, char *a, int s);
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_doutput(DBIG x); 
+
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_drawoutput(DBIG x);
+
+/**	@brief Copy BIG from Read-Only Memory to a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number in ROM
+ */
+extern void BIG_rcopy(BIG x, const BIG y);
+/**	@brief Copy BIG to another BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_copy(BIG x, BIG y);
+/**	@brief Copy DBIG to another DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_dcopy(DBIG x, DBIG y);
+/**	@brief Copy BIG to upper half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dsucopy(DBIG x, BIG y);
+/**	@brief Copy BIG to lower half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dscopy(DBIG x, BIG y);
+/**	@brief Copy lower half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sdcopy(BIG x, DBIG y);
+/**	@brief Copy upper half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sducopy(BIG x, DBIG y);
+/**	@brief Set BIG to zero (Constant Time)
+ *
+	@param x BIG number to be set to zero  
+ */
+extern void BIG_zero(BIG x);
+/**	@brief Set DBIG to zero (Constant Time)
+ *
+	@param x DBIG number to be set to zero
+ */
+extern void BIG_dzero(DBIG x);
+/**	@brief Set BIG to one (unity) (Constant Time)
+ *
+	@param x BIG number to be set to one.
+ */
+extern void BIG_one(BIG x);
+/**	@brief Set BIG to inverse mod 2^256 (Constant Time)
+ *
+	@param x BIG number to be inverted
+ */
+extern void BIG_invmod2m(BIG x);
+/**	@brief Set BIG to sum of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, sum of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_add(BIG x, BIG y, BIG z);
+
+/**	@brief Set BIG to logical or of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, or of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_or(BIG x, BIG y, BIG z);
+
+/**	@brief Increment BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be incremented
+	@param i integer
+ */
+extern void BIG_inc(BIG x, int i);
+/**	@brief Set BIG to difference of two BIGs (Constant Time)
+ *
+	@param x BIG number, difference of other two - output not normalised
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_sub(BIG x, BIG y, BIG z);
+/**	@brief Decrement BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be decremented
+	@param i integer
+ */
+extern void BIG_dec(BIG x, int i);
+/**	@brief Set DBIG to sum of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, sum of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dadd(DBIG x, DBIG y, DBIG z);
+/**	@brief Set DBIG to difference of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, difference of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dsub(DBIG x, DBIG y, DBIG z);
+/**	@brief Multiply BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_imul(BIG x, BIG y, int i);
+/**	@brief Multiply BIG by not-so-small small integer - output normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+	@return Overflowing bits
+ */
+extern chunk BIG_pmul(BIG x, BIG y, int i);
+/**	@brief Divide BIG by 3 - output normalised (Constant Time)
+ *
+	@param x BIG number
+	@return Remainder
+ */
+extern int BIG_div3(BIG x);
+/**	@brief Multiply BIG by even bigger small integer resulting in a DBIG - output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_pxmul(DBIG x, BIG y, int i);
+/**	@brief Multiply BIG by another BIG resulting in DBIG - inputs normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_mul(DBIG x, BIG y, BIG z);
+/**	@brief Multiply BIG by another BIG resulting in another BIG - inputs normalised and output normalised (Constant Time)
+ *
+	Note that the product must fit into a BIG, and x must be distinct from y and z
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_smul(BIG x, BIG y, BIG z);
+/**	@brief Square BIG resulting in a DBIG - input normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, square of a BIG
+	@param y BIG number to be squared
+ */
+extern void BIG_sqr(DBIG x, BIG y);
+
+/**	@brief Montgomery reduction of a DBIG to a BIG  - input normalised and output normalised (Constant Time)
+ *
+	@param a BIG number, reduction of a BIG
+	@param md BIG number, the modulus
+	@param MC the Montgomery Constant
+	@param d DBIG number to be reduced
+ */
+extern void BIG_monty(BIG a, BIG md, chunk MC, DBIG d);
+
+/**	@brief Shifts a BIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shl(BIG x, int s);
+/**	@brief Fast shifts a BIG left by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Overflow bits
+ */
+extern int BIG_fshl(BIG x, int s);
+/**	@brief Shifts a DBIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshl(DBIG x, int s);
+/**	@brief Shifts a BIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shr(BIG x, int s);
+
+
+/**	@brief Fast time-critical combined shift by 1 bit, subtract and normalise (Constant Time)
+ *
+	@param r BIG number normalised output
+	@param a BIG number to be subtracted from
+	@param m BIG number to be shifted and subtracted
+	@return sign of r
+ */
+extern int BIG_ssn(BIG r, BIG a, BIG m);
+
+/**	@brief Fast shifts a BIG right by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Shifted out bits
+ */
+extern int BIG_fshr(BIG x, int s);
+/**	@brief Shifts a DBIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshr(DBIG x, int s);
+/**	@brief Splits a DBIG into two BIGs - input must be normalised, outputs normalised (Constant Time as used)
+ *
+	Internal function. The value of s must be approximately in the middle of the DBIG.
+	Typically used to extract z mod 2^MODBITS and z/2^MODBITS
+	@param x BIG number, top half of z
+	@param y BIG number, bottom half of z
+	@param z DBIG number to be split in two.
+	@param s Bit position at which to split
+	@return carry-out from top half
+ */
+extern chunk BIG_split(BIG x, BIG y, DBIG z, int s);
+/**	@brief Normalizes a BIG number - output normalised (Constant Time)
+ *
+	All digits of the input BIG are reduced mod 2^BASEBITS
+	@param x BIG number to be normalised
+ */
+extern chunk BIG_norm(BIG x);
+/**	@brief Normalizes a DBIG number - output normalised (Constant Time)
+ *
+	All digits of the input DBIG are reduced mod 2^BASEBITS
+	@param x DBIG number to be normalised
+ */
+extern void BIG_dnorm(DBIG x);
+/**	@brief Compares two BIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first BIG number to be compared
+	@param y second BIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_comp(BIG x, BIG y);
+/**	@brief Compares two DBIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first DBIG number to be compared
+	@param y second DBIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_dcomp(DBIG x, DBIG y);
+/**	@brief Calculate number of bits in a BIG - output normalised (Variable Time)
+ *
+	@param x BIG number
+	@return Number of bits in x
+ */
+extern int BIG_nbits(BIG x);
+/**	@brief Calculate number of bits in a DBIG - output normalised (Variable Time)
+ *
+	@param x DBIG number
+	@return Number of bits in x
+ */
+extern int BIG_dnbits(DBIG x);
+
+/**	@brief Reduce x mod n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctmod(BIG x, BIG n, int bd);
+
+/**	@brief  x=y mod n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctdmod(BIG x, DBIG y, BIG n, int bd);
+
+/**	@brief Divide x by n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctsdiv(BIG x,BIG n,int bd);
+
+/**	@brief  x=y/n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctddiv(BIG x, DBIG y, BIG n,int bd);
+
+
+/**	@brief Reduce x mod n - input and output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+ */
+extern void BIG_mod(BIG x, BIG n);
+/**	@brief Divide x by n - output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+ */
+extern void BIG_sdiv(BIG x, BIG n);
+/**	@brief  x=y mod n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_dmod(BIG x, DBIG y, BIG n);
+/**	@brief  x=y/n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_ddiv(BIG x, DBIG y, BIG n);
+/**	@brief  return parity of BIG, that is the least significant bit (Constant Time)
+ *
+	@param x BIG number
+	@return 0 or 1
+ */
+extern int BIG_parity(BIG x);
+/**	@brief  return i-th of BIG (Constant Time)
+ *
+	@param x BIG number
+	@param i the bit of x to be returned
+	@return 0 or 1
+ */
+extern int BIG_bit(BIG x, int i);
+/**	@brief  return least significant bits of a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param n number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int BIG_lastbits(BIG x, int n);
+/**	@brief  Create a random BIG from a random number generator (Constant Time)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_random(BIG x, csprng *r);
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randomnum(BIG x, BIG n, csprng *r);
+
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus and truncated to max bit length (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param t Maximum bit length
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randtrunc(BIG x, BIG n, int t, csprng *r);
+
+/**	brief  return NAF (Non-Adjacent-Form) value as +/- 1, 3 or 5, inputs must be normalised
+ *
+	Given x and 3*x extracts NAF value from given bit position, and returns number of bits processed, and number of trailing zeros detected if any
+	param x BIG number
+	param x3 BIG number, three times x
+	param i bit position
+	param nbs pointer to integer returning number of bits processed
+	param nzs pointer to integer returning number of trailing 0s
+	return + or - 1, 3 or 5
+*/
+
+/**	@brief  Calculate x=y*z mod n (Variable Time)
+ *
+	Slow method for modular multiplication
+	@param x BIG number, on exit = y*z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modmul(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y/z mod n (Variable Time)
+ *
+	Slow method for modular division
+	@param x BIG number, on exit = y/z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_moddiv(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y^2 mod n (Variable Time)
+ *
+	Slow method for modular squaring
+	@param x BIG number, on exit = y^2 mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modsqr(BIG x, BIG y, BIG n);
+/**	@brief  Calculate x=-y mod n (Variable Time)
+ *
+	Modular negation
+	@param x BIG number, on exit = -y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modneg(BIG x, BIG y, BIG n);
+
+/**	@brief  Calculate x=y+z mod n (Variable Time)
+ *
+	Slow method for modular addition
+	@param x BIG number, on exit = y+z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modadd(BIG x, BIG y, BIG z, BIG n);
+
+/**	@brief  Calculate jacobi Symbol (x/y) (Variable Time)
+ *
+	@param x BIG number
+	@param y BIG number
+	@return Jacobi symbol, -1,0 or 1
+ */
+extern int BIG_jacobi(BIG x, BIG y);
+/**	@brief  Calculate x=1/y mod n (Variable Time)
+ *
+	Modular Inversion - This is slow. Uses binary method.
+	@param x BIG number, on exit = 1/y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_invmodp(BIG x, BIG y, BIG n);
+/** @brief Calculate x=x mod 2^m (Variable Time)
+ *
+	Truncation
+	@param x BIG number, on reduced mod 2^m
+	@param m new truncated size
+*/
+extern void BIG_mod2m(BIG x, int m);
+
+/**	@brief Calculates a*b+c+*d
+ *
+	Calculate partial product of a.b, add in carry c, and add total to d (Constant Time)
+	@param a multiplier
+	@param b multiplicand
+	@param c carry
+	@param d pointer to accumulated bottom half of result
+	@return top half of result
+ */
+
+
+extern int step1(BIG,BIG,BIG);
+extern void step2(BIG,BIG,BIG);
+
+#ifdef dchunk
+
+/* Method required to calculate x*y+c+r, bottom half in r, top half returned */
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    dchunk prod = (dchunk)x * y + c + *r;
+    *r = (chunk)prod & BMASK_B584_29;
+    return (chunk)(prod >> BASEBITS_B584_29);
+}
+
+#else
+
+/* No integer type available that can store double the wordlength */
+/* accumulate partial products */
+
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    chunk x0, x1, y0, y1;
+    chunk bot, top, mid, carry;
+    x0 = x & HMASK_B584_29;
+    x1 = (x >> HBITS_B584_29);
+    y0 = y & HMASK_B584_29;
+    y1 = (y >> HBITS_B584_29);
+    bot = x0 * y0;
+    top = x1 * y1;
+    mid = x0 * y1 + x1 * y0;
+    x0 = mid & HMASK_B584_29;
+    x1 = (mid >> HBITS_B584_29);
+    bot += x0 << HBITS_B584_29;
+    bot += *r;
+    bot += c;
+
+    top += x1;
+    carry = bot >> BASEBITS_B584_29;
+    bot &= BMASK_B584_29;
+    top += carry;
+
+    *r = bot;
+    return top;
+}
+
+#endif
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/bls192_BLS24479.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/bls192_BLS24479.h
new file mode 100644
index 0000000..e7b494d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/bls192_BLS24479.h
@@ -0,0 +1,86 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file bls192.h
+ * @author Mike Scott
+ * @date 28th Novemebr 2018
+ * @brief BLS Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef BLS192_BLS24479_H
+#define BLS192_BLS24479_H
+
+#include "pair4_BLS24479.h"
+
+using namespace core;
+
+namespace BLS24479 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define BGS_BLS24479 MODBYTES_B480_29  /**< BLS Group Size */
+#define BFS_BLS24479 MODBYTES_B480_29  /**< BLS Field Size */
+
+#define BLS_OK           0  /**< Function completed without error */
+#define BLS_FAIL        -1  /**< Point is NOT on the curve */
+
+/* BLS API functions */
+
+/** @brief Initialise BLS
+ *
+    @return BLS_OK if worked, otherwise BLS_FAIL
+ */
+int BLS_INIT();
+
+/** @brief Generate Key Pair
+ *
+    @param IKM contains truly random keying material
+    @param S on output a private key
+    @param W on output a public key = S*G, where G is fixed generator
+    @return BLS_OK
+ */
+int BLS_KEY_PAIR_GENERATE(octet *IKM, octet* S, octet *W);
+
+/** @brief Calculate a signature
+ *
+    @param SIG the ouput signature
+    @param M is the message to be signed
+    @param S an input private key
+    @return BLS_OK
+ */
+int BLS_CORE_SIGN(octet *SIG, octet *M, octet *S);
+
+/** @brief Verify a signature
+ *
+    @param SIG an input signature
+    @param M is the message whose signature is to be verified.
+    @param W an public key
+    @return BLS_OK if verified, otherwise BLS_FAIL
+ */
+int BLS_CORE_VERIFY(octet *SIG, octet *M, octet *W);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/bls256_BLS48286.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/bls256_BLS48286.h
new file mode 100644
index 0000000..5c188aa
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/bls256_BLS48286.h
@@ -0,0 +1,86 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file bls256.h
+ * @author Mike Scott
+ * @date 28th Novemebr 2018
+ * @brief BLS Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef BLS256_BLS48286_H
+#define BLS256_BLS48286_H
+
+#include "pair8_BLS48286.h"
+
+using namespace core;
+
+namespace BLS48286 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define BGS_BLS48286 MODBYTES_B288_29  /**< BLS Group Size */
+#define BFS_BLS48286 MODBYTES_B288_29  /**< BLS Field Size */
+
+#define BLS_OK           0  /**< Function completed without error */
+#define BLS_FAIL        -1  /**< Point is NOT on the curve */
+
+/* BLS API functions */
+
+/** @brief Initialise BLS
+ *
+    @return BLS_OK if worked, otherwise BLS_FAIL
+ */
+int BLS_INIT();
+
+/** @brief Generate Key Pair
+ *
+    @param IKM contains truly random keying material
+    @param S on output a private key
+    @param W on output a public key = S*G, where G is fixed generator
+    @return BLS_OK
+ */
+int BLS_KEY_PAIR_GENERATE(octet *IKM, octet* S, octet *W);
+
+/** @brief Calculate a signature
+ *
+    @param SIG the ouput signature
+    @param m is the message to be signed
+    @param S an input private key
+    @return BLS_OK
+ */
+int BLS_CORE_SIGN(octet *SIG, octet *M, octet *S);
+
+/** @brief Verify a signature
+ *
+    @param SIG an input signature
+    @param m is the message whose signature is to be verified.
+    @param W an public key
+    @return BLS_OK if verified, otherwise BLS_FAIL
+ */
+int BLS_CORE_VERIFY(octet *SIG, octet *M, octet *W);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/bls256_BLS48556.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/bls256_BLS48556.h
new file mode 100644
index 0000000..b1895a9
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/bls256_BLS48556.h
@@ -0,0 +1,86 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file bls256.h
+ * @author Mike Scott
+ * @date 28th Novemebr 2018
+ * @brief BLS Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef BLS256_BLS48556_H
+#define BLS256_BLS48556_H
+
+#include "pair8_BLS48556.h"
+
+using namespace core;
+
+namespace BLS48556 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define BGS_BLS48556 MODBYTES_B560_29  /**< BLS Group Size */
+#define BFS_BLS48556 MODBYTES_B560_29  /**< BLS Field Size */
+
+#define BLS_OK           0  /**< Function completed without error */
+#define BLS_FAIL        -1  /**< Point is NOT on the curve */
+
+/* BLS API functions */
+
+/** @brief Initialise BLS
+ *
+    @return BLS_OK if worked, otherwise BLS_FAIL
+ */
+int BLS_INIT();
+
+/** @brief Generate Key Pair
+ *
+    @param IKM contains truly random keying material
+    @param S on output a private key
+    @param W on output a public key = S*G, where G is fixed generator
+    @return BLS_OK
+ */
+int BLS_KEY_PAIR_GENERATE(octet *IKM, octet* S, octet *W);
+
+/** @brief Calculate a signature
+ *
+    @param SIG the ouput signature
+    @param m is the message to be signed
+    @param S an input private key
+    @return BLS_OK
+ */
+int BLS_CORE_SIGN(octet *SIG, octet *M, octet *S);
+
+/** @brief Verify a signature
+ *
+    @param SIG an input signature
+    @param m is the message whose signature is to be verified.
+    @param W an public key
+    @return BLS_OK if verified, otherwise BLS_FAIL
+ */
+int BLS_CORE_VERIFY(octet *SIG, octet *M, octet *W);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/bls256_BLS48581.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/bls256_BLS48581.h
new file mode 100644
index 0000000..b10c7d6
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/bls256_BLS48581.h
@@ -0,0 +1,86 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file bls256.h
+ * @author Mike Scott
+ * @date 28th Novemebr 2018
+ * @brief BLS Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef BLS256_BLS48581_H
+#define BLS256_BLS48581_H
+
+#include "pair8_BLS48581.h"
+
+using namespace core;
+
+namespace BLS48581 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define BGS_BLS48581 MODBYTES_B584_29  /**< BLS Group Size */
+#define BFS_BLS48581 MODBYTES_B584_29  /**< BLS Field Size */
+
+#define BLS_OK           0  /**< Function completed without error */
+#define BLS_FAIL        -1  /**< Point is NOT on the curve */
+
+/* BLS API functions */
+
+/** @brief Initialise BLS
+ *
+    @return BLS_OK if worked, otherwise BLS_FAIL
+ */
+int BLS_INIT();
+
+/** @brief Generate Key Pair
+ *
+    @param IKM contains truly random keying material
+    @param S on output a private key
+    @param W on output a public key = S*G, where G is fixed generator
+    @return BLS_OK
+ */
+int BLS_KEY_PAIR_GENERATE(octet *IKM, octet* S, octet *W);
+
+/** @brief Calculate a signature
+ *
+    @param SIG the ouput signature
+    @param m is the message to be signed
+    @param S an input private key
+    @return BLS_OK
+ */
+int BLS_CORE_SIGN(octet *SIG, octet *M, octet *S);
+
+/** @brief Verify a signature
+ *
+    @param SIG an input signature
+    @param m is the message whose signature is to be verified.
+    @param W an public key
+    @return BLS_OK if verified, otherwise BLS_FAIL
+ */
+int BLS_CORE_VERIFY(octet *SIG, octet *M, octet *W);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/bls_BLS12381.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/bls_BLS12381.h
new file mode 100644
index 0000000..43267aa
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/bls_BLS12381.h
@@ -0,0 +1,87 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file bls.h
+ * @author Mike Scott
+ * @date 28th Novemebr 2018
+ * @brief BLS Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef BLS_BLS12381_H
+#define BLS_BLS12381_H
+
+#include "pair_BLS12381.h"
+
+using namespace core;
+
+namespace BLS12381 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define BGS_BLS12381 MODBYTES_B384_29  /**< BLS Group Size */
+#define BFS_BLS12381 MODBYTES_B384_29  /**< BLS Field Size */
+
+#define BLS_OK           0  /**< Function completed without error */
+#define BLS_FAIL        -1  /**< Point is NOT on the curve */
+
+/* BLS API functions */
+
+
+/** @brief Initialise BLS
+ *
+    @return BLS_OK if worked, otherwise BLS_FAIL
+ */
+int BLS_INIT();
+
+/** @brief Generate Key Pair
+ *
+    @param IKM contains truly random keying material
+    @param S on output a private key
+    @param W on output a public key = S*G, where G is fixed generator
+    @return BLS_OK
+ */
+int BLS_KEY_PAIR_GENERATE(octet *IKM, octet* S, octet *W);
+
+/** @brief Calculate a signature
+ *
+    @param SIG the ouput signature
+    @param M is the message to be signed
+    @param S an input private key
+    @return BLS_OK
+ */
+int BLS_CORE_SIGN(octet *SIG, octet *M, octet *S);
+
+/** @brief Verify a signature
+ *
+    @param SIG an input signature
+    @param M is the message whose signature is to be verified.
+    @param W an public key
+    @return BLS_OK if verified, otherwise BLS_FAIL
+ */
+int BLS_CORE_VERIFY(octet *SIG, octet *M, octet *W);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/bls_BLS12383.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/bls_BLS12383.h
new file mode 100644
index 0000000..b109162
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/bls_BLS12383.h
@@ -0,0 +1,87 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file bls.h
+ * @author Mike Scott
+ * @date 28th Novemebr 2018
+ * @brief BLS Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef BLS_BLS12383_H
+#define BLS_BLS12383_H
+
+#include "pair_BLS12383.h"
+
+using namespace core;
+
+namespace BLS12383 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define BGS_BLS12383 MODBYTES_B384_29  /**< BLS Group Size */
+#define BFS_BLS12383 MODBYTES_B384_29  /**< BLS Field Size */
+
+#define BLS_OK           0  /**< Function completed without error */
+#define BLS_FAIL        -1  /**< Point is NOT on the curve */
+
+/* BLS API functions */
+
+
+/** @brief Initialise BLS
+ *
+    @return BLS_OK if worked, otherwise BLS_FAIL
+ */
+int BLS_INIT();
+
+/** @brief Generate Key Pair
+ *
+    @param IKM contains truly random keying material
+    @param S on output a private key
+    @param W on output a public key = S*G, where G is fixed generator
+    @return BLS_OK
+ */
+int BLS_KEY_PAIR_GENERATE(octet *IKM, octet* S, octet *W);
+
+/** @brief Calculate a signature
+ *
+    @param SIG the ouput signature
+    @param M is the message to be signed
+    @param S an input private key
+    @return BLS_OK
+ */
+int BLS_CORE_SIGN(octet *SIG, octet *M, octet *S);
+
+/** @brief Verify a signature
+ *
+    @param SIG an input signature
+    @param M is the message whose signature is to be verified.
+    @param W an public key
+    @return BLS_OK if verified, otherwise BLS_FAIL
+ */
+int BLS_CORE_VERIFY(octet *SIG, octet *M, octet *W);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/bls_BLS12443.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/bls_BLS12443.h
new file mode 100644
index 0000000..50e7f97
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/bls_BLS12443.h
@@ -0,0 +1,87 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file bls.h
+ * @author Mike Scott
+ * @date 28th Novemebr 2018
+ * @brief BLS Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef BLS_BLS12443_H
+#define BLS_BLS12443_H
+
+#include "pair_BLS12443.h"
+
+using namespace core;
+
+namespace BLS12443 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define BGS_BLS12443 MODBYTES_B448_29  /**< BLS Group Size */
+#define BFS_BLS12443 MODBYTES_B448_29  /**< BLS Field Size */
+
+#define BLS_OK           0  /**< Function completed without error */
+#define BLS_FAIL        -1  /**< Point is NOT on the curve */
+
+/* BLS API functions */
+
+
+/** @brief Initialise BLS
+ *
+    @return BLS_OK if worked, otherwise BLS_FAIL
+ */
+int BLS_INIT();
+
+/** @brief Generate Key Pair
+ *
+    @param IKM contains truly random keying material
+    @param S on output a private key
+    @param W on output a public key = S*G, where G is fixed generator
+    @return BLS_OK
+ */
+int BLS_KEY_PAIR_GENERATE(octet *IKM, octet* S, octet *W);
+
+/** @brief Calculate a signature
+ *
+    @param SIG the ouput signature
+    @param M is the message to be signed
+    @param S an input private key
+    @return BLS_OK
+ */
+int BLS_CORE_SIGN(octet *SIG, octet *M, octet *S);
+
+/** @brief Verify a signature
+ *
+    @param SIG an input signature
+    @param M is the message whose signature is to be verified.
+    @param W an public key
+    @return BLS_OK if verified, otherwise BLS_FAIL
+ */
+int BLS_CORE_VERIFY(octet *SIG, octet *M, octet *W);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/bls_BLS12461.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/bls_BLS12461.h
new file mode 100644
index 0000000..e206d17
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/bls_BLS12461.h
@@ -0,0 +1,87 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file bls.h
+ * @author Mike Scott
+ * @date 28th Novemebr 2018
+ * @brief BLS Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef BLS_BLS12461_H
+#define BLS_BLS12461_H
+
+#include "pair_BLS12461.h"
+
+using namespace core;
+
+namespace BLS12461 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define BGS_BLS12461 MODBYTES_B464_28  /**< BLS Group Size */
+#define BFS_BLS12461 MODBYTES_B464_28  /**< BLS Field Size */
+
+#define BLS_OK           0  /**< Function completed without error */
+#define BLS_FAIL        -1  /**< Point is NOT on the curve */
+
+/* BLS API functions */
+
+
+/** @brief Initialise BLS
+ *
+    @return BLS_OK if worked, otherwise BLS_FAIL
+ */
+int BLS_INIT();
+
+/** @brief Generate Key Pair
+ *
+    @param IKM contains truly random keying material
+    @param S on output a private key
+    @param W on output a public key = S*G, where G is fixed generator
+    @return BLS_OK
+ */
+int BLS_KEY_PAIR_GENERATE(octet *IKM, octet* S, octet *W);
+
+/** @brief Calculate a signature
+ *
+    @param SIG the ouput signature
+    @param M is the message to be signed
+    @param S an input private key
+    @return BLS_OK
+ */
+int BLS_CORE_SIGN(octet *SIG, octet *M, octet *S);
+
+/** @brief Verify a signature
+ *
+    @param SIG an input signature
+    @param M is the message whose signature is to be verified.
+    @param W an public key
+    @return BLS_OK if verified, otherwise BLS_FAIL
+ */
+int BLS_CORE_VERIFY(octet *SIG, octet *M, octet *W);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/bls_BN158.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/bls_BN158.h
new file mode 100644
index 0000000..e96e577
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/bls_BN158.h
@@ -0,0 +1,87 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file bls.h
+ * @author Mike Scott
+ * @date 28th Novemebr 2018
+ * @brief BLS Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef BLS_BN158_H
+#define BLS_BN158_H
+
+#include "pair_BN158.h"
+
+using namespace core;
+
+namespace BN158 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define BGS_BN158 MODBYTES_B160_28  /**< BLS Group Size */
+#define BFS_BN158 MODBYTES_B160_28  /**< BLS Field Size */
+
+#define BLS_OK           0  /**< Function completed without error */
+#define BLS_FAIL        -1  /**< Point is NOT on the curve */
+
+/* BLS API functions */
+
+
+/** @brief Initialise BLS
+ *
+    @return BLS_OK if worked, otherwise BLS_FAIL
+ */
+int BLS_INIT();
+
+/** @brief Generate Key Pair
+ *
+    @param IKM contains truly random keying material
+    @param S on output a private key
+    @param W on output a public key = S*G, where G is fixed generator
+    @return BLS_OK
+ */
+int BLS_KEY_PAIR_GENERATE(octet *IKM, octet* S, octet *W);
+
+/** @brief Calculate a signature
+ *
+    @param SIG the ouput signature
+    @param M is the message to be signed
+    @param S an input private key
+    @return BLS_OK
+ */
+int BLS_CORE_SIGN(octet *SIG, octet *M, octet *S);
+
+/** @brief Verify a signature
+ *
+    @param SIG an input signature
+    @param M is the message whose signature is to be verified.
+    @param W an public key
+    @return BLS_OK if verified, otherwise BLS_FAIL
+ */
+int BLS_CORE_VERIFY(octet *SIG, octet *M, octet *W);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/bls_BN254.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/bls_BN254.h
new file mode 100644
index 0000000..a55bfd7
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/bls_BN254.h
@@ -0,0 +1,87 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file bls.h
+ * @author Mike Scott
+ * @date 28th Novemebr 2018
+ * @brief BLS Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef BLS_BN254_H
+#define BLS_BN254_H
+
+#include "pair_BN254.h"
+
+using namespace core;
+
+namespace BN254 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define BGS_BN254 MODBYTES_B256_28  /**< BLS Group Size */
+#define BFS_BN254 MODBYTES_B256_28  /**< BLS Field Size */
+
+#define BLS_OK           0  /**< Function completed without error */
+#define BLS_FAIL        -1  /**< Point is NOT on the curve */
+
+/* BLS API functions */
+
+
+/** @brief Initialise BLS
+ *
+    @return BLS_OK if worked, otherwise BLS_FAIL
+ */
+int BLS_INIT();
+
+/** @brief Generate Key Pair
+ *
+    @param IKM contains truly random keying material
+    @param S on output a private key
+    @param W on output a public key = S*G, where G is fixed generator
+    @return BLS_OK
+ */
+int BLS_KEY_PAIR_GENERATE(octet *IKM, octet* S, octet *W);
+
+/** @brief Calculate a signature
+ *
+    @param SIG the ouput signature
+    @param M is the message to be signed
+    @param S an input private key
+    @return BLS_OK
+ */
+int BLS_CORE_SIGN(octet *SIG, octet *M, octet *S);
+
+/** @brief Verify a signature
+ *
+    @param SIG an input signature
+    @param M is the message whose signature is to be verified.
+    @param W an public key
+    @return BLS_OK if verified, otherwise BLS_FAIL
+ */
+int BLS_CORE_VERIFY(octet *SIG, octet *M, octet *W);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/bls_BN254CX.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/bls_BN254CX.h
new file mode 100644
index 0000000..eb6b8d4
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/bls_BN254CX.h
@@ -0,0 +1,87 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file bls.h
+ * @author Mike Scott
+ * @date 28th Novemebr 2018
+ * @brief BLS Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef BLS_BN254CX_H
+#define BLS_BN254CX_H
+
+#include "pair_BN254CX.h"
+
+using namespace core;
+
+namespace BN254CX {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define BGS_BN254CX MODBYTES_B256_28  /**< BLS Group Size */
+#define BFS_BN254CX MODBYTES_B256_28  /**< BLS Field Size */
+
+#define BLS_OK           0  /**< Function completed without error */
+#define BLS_FAIL        -1  /**< Point is NOT on the curve */
+
+/* BLS API functions */
+
+
+/** @brief Initialise BLS
+ *
+    @return BLS_OK if worked, otherwise BLS_FAIL
+ */
+int BLS_INIT();
+
+/** @brief Generate Key Pair
+ *
+    @param IKM contains truly random keying material
+    @param S on output a private key
+    @param W on output a public key = S*G, where G is fixed generator
+    @return BLS_OK
+ */
+int BLS_KEY_PAIR_GENERATE(octet *IKM, octet* S, octet *W);
+
+/** @brief Calculate a signature
+ *
+    @param SIG the ouput signature
+    @param M is the message to be signed
+    @param S an input private key
+    @return BLS_OK
+ */
+int BLS_CORE_SIGN(octet *SIG, octet *M, octet *S);
+
+/** @brief Verify a signature
+ *
+    @param SIG an input signature
+    @param M is the message whose signature is to be verified.
+    @param W an public key
+    @return BLS_OK if verified, otherwise BLS_FAIL
+ */
+int BLS_CORE_VERIFY(octet *SIG, octet *M, octet *W);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/bls_BN462.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/bls_BN462.h
new file mode 100644
index 0000000..15b6420
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/bls_BN462.h
@@ -0,0 +1,87 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file bls.h
+ * @author Mike Scott
+ * @date 28th Novemebr 2018
+ * @brief BLS Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef BLS_BN462_H
+#define BLS_BN462_H
+
+#include "pair_BN462.h"
+
+using namespace core;
+
+namespace BN462 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define BGS_BN462 MODBYTES_B464_28  /**< BLS Group Size */
+#define BFS_BN462 MODBYTES_B464_28  /**< BLS Field Size */
+
+#define BLS_OK           0  /**< Function completed without error */
+#define BLS_FAIL        -1  /**< Point is NOT on the curve */
+
+/* BLS API functions */
+
+
+/** @brief Initialise BLS
+ *
+    @return BLS_OK if worked, otherwise BLS_FAIL
+ */
+int BLS_INIT();
+
+/** @brief Generate Key Pair
+ *
+    @param IKM contains truly random keying material
+    @param S on output a private key
+    @param W on output a public key = S*G, where G is fixed generator
+    @return BLS_OK
+ */
+int BLS_KEY_PAIR_GENERATE(octet *IKM, octet* S, octet *W);
+
+/** @brief Calculate a signature
+ *
+    @param SIG the ouput signature
+    @param M is the message to be signed
+    @param S an input private key
+    @return BLS_OK
+ */
+int BLS_CORE_SIGN(octet *SIG, octet *M, octet *S);
+
+/** @brief Verify a signature
+ *
+    @param SIG an input signature
+    @param M is the message whose signature is to be verified.
+    @param W an public key
+    @return BLS_OK if verified, otherwise BLS_FAIL
+ */
+int BLS_CORE_VERIFY(octet *SIG, octet *M, octet *W);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/bls_FP256BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/bls_FP256BN.h
new file mode 100644
index 0000000..e279906
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/bls_FP256BN.h
@@ -0,0 +1,87 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file bls.h
+ * @author Mike Scott
+ * @date 28th Novemebr 2018
+ * @brief BLS Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef BLS_FP256BN_H
+#define BLS_FP256BN_H
+
+#include "pair_FP256BN.h"
+
+using namespace core;
+
+namespace FP256BN {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define BGS_FP256BN MODBYTES_B256_28  /**< BLS Group Size */
+#define BFS_FP256BN MODBYTES_B256_28  /**< BLS Field Size */
+
+#define BLS_OK           0  /**< Function completed without error */
+#define BLS_FAIL        -1  /**< Point is NOT on the curve */
+
+/* BLS API functions */
+
+
+/** @brief Initialise BLS
+ *
+    @return BLS_OK if worked, otherwise BLS_FAIL
+ */
+int BLS_INIT();
+
+/** @brief Generate Key Pair
+ *
+    @param IKM contains truly random keying material
+    @param S on output a private key
+    @param W on output a public key = S*G, where G is fixed generator
+    @return BLS_OK
+ */
+int BLS_KEY_PAIR_GENERATE(octet *IKM, octet* S, octet *W);
+
+/** @brief Calculate a signature
+ *
+    @param SIG the ouput signature
+    @param M is the message to be signed
+    @param S an input private key
+    @return BLS_OK
+ */
+int BLS_CORE_SIGN(octet *SIG, octet *M, octet *S);
+
+/** @brief Verify a signature
+ *
+    @param SIG an input signature
+    @param M is the message whose signature is to be verified.
+    @param W an public key
+    @return BLS_OK if verified, otherwise BLS_FAIL
+ */
+int BLS_CORE_VERIFY(octet *SIG, octet *M, octet *W);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/bls_FP512BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/bls_FP512BN.h
new file mode 100644
index 0000000..a3efb6c
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/bls_FP512BN.h
@@ -0,0 +1,87 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file bls.h
+ * @author Mike Scott
+ * @date 28th Novemebr 2018
+ * @brief BLS Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef BLS_FP512BN_H
+#define BLS_FP512BN_H
+
+#include "pair_FP512BN.h"
+
+using namespace core;
+
+namespace FP512BN {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define BGS_FP512BN MODBYTES_B512_29  /**< BLS Group Size */
+#define BFS_FP512BN MODBYTES_B512_29  /**< BLS Field Size */
+
+#define BLS_OK           0  /**< Function completed without error */
+#define BLS_FAIL        -1  /**< Point is NOT on the curve */
+
+/* BLS API functions */
+
+
+/** @brief Initialise BLS
+ *
+    @return BLS_OK if worked, otherwise BLS_FAIL
+ */
+int BLS_INIT();
+
+/** @brief Generate Key Pair
+ *
+    @param IKM contains truly random keying material
+    @param S on output a private key
+    @param W on output a public key = S*G, where G is fixed generator
+    @return BLS_OK
+ */
+int BLS_KEY_PAIR_GENERATE(octet *IKM, octet* S, octet *W);
+
+/** @brief Calculate a signature
+ *
+    @param SIG the ouput signature
+    @param M is the message to be signed
+    @param S an input private key
+    @return BLS_OK
+ */
+int BLS_CORE_SIGN(octet *SIG, octet *M, octet *S);
+
+/** @brief Verify a signature
+ *
+    @param SIG an input signature
+    @param M is the message whose signature is to be verified.
+    @param W an public key
+    @return BLS_OK if verified, otherwise BLS_FAIL
+ */
+int BLS_CORE_VERIFY(octet *SIG, octet *M, octet *W);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_big_B160_28.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_big_B160_28.h
new file mode 100644
index 0000000..9567050
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_big_B160_28.h
@@ -0,0 +1,31 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_BIG_B160_28_H
+#define CONFIG_BIG_B160_28_H
+
+#include"core.h"
+
+// BIG stuff
+
+#define MODBYTES_B160_28 20
+#define BASEBITS_B160_28 28
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_big_B160_29.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_big_B160_29.h
new file mode 100644
index 0000000..72231b2
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_big_B160_29.h
@@ -0,0 +1,31 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_BIG_B160_29_H
+#define CONFIG_BIG_B160_29_H
+
+#include"core.h"
+
+// BIG stuff
+
+#define MODBYTES_B160_29 20
+#define BASEBITS_B160_29 29
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_big_B168_29.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_big_B168_29.h
new file mode 100644
index 0000000..96a17ee
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_big_B168_29.h
@@ -0,0 +1,31 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_BIG_B168_29_H
+#define CONFIG_BIG_B168_29_H
+
+#include"core.h"
+
+// BIG stuff
+
+#define MODBYTES_B168_29 21
+#define BASEBITS_B168_29 29
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_big_B256_28.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_big_B256_28.h
new file mode 100644
index 0000000..abb7cca
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_big_B256_28.h
@@ -0,0 +1,31 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_BIG_B256_28_H
+#define CONFIG_BIG_B256_28_H
+
+#include"core.h"
+
+// BIG stuff
+
+#define MODBYTES_B256_28 32
+#define BASEBITS_B256_28 28
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_big_B256_29.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_big_B256_29.h
new file mode 100644
index 0000000..de5f97c
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_big_B256_29.h
@@ -0,0 +1,31 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_BIG_B256_29_H
+#define CONFIG_BIG_B256_29_H
+
+#include"core.h"
+
+// BIG stuff
+
+#define MODBYTES_B256_29 32
+#define BASEBITS_B256_29 29
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_big_B288_29.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_big_B288_29.h
new file mode 100644
index 0000000..3319a9f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_big_B288_29.h
@@ -0,0 +1,31 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_BIG_B288_29_H
+#define CONFIG_BIG_B288_29_H
+
+#include"core.h"
+
+// BIG stuff
+
+#define MODBYTES_B288_29 36
+#define BASEBITS_B288_29 29
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_big_B336_29.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_big_B336_29.h
new file mode 100644
index 0000000..5f4db84
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_big_B336_29.h
@@ -0,0 +1,31 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_BIG_B336_29_H
+#define CONFIG_BIG_B336_29_H
+
+#include"core.h"
+
+// BIG stuff
+
+#define MODBYTES_B336_29 42
+#define BASEBITS_B336_29 29
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_big_B384_28.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_big_B384_28.h
new file mode 100644
index 0000000..8056ab9
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_big_B384_28.h
@@ -0,0 +1,31 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_BIG_B384_28_H
+#define CONFIG_BIG_B384_28_H
+
+#include"core.h"
+
+// BIG stuff
+
+#define MODBYTES_B384_28 48
+#define BASEBITS_B384_28 28
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_big_B384_29.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_big_B384_29.h
new file mode 100644
index 0000000..5a730c4
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_big_B384_29.h
@@ -0,0 +1,31 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_BIG_B384_29_H
+#define CONFIG_BIG_B384_29_H
+
+#include"core.h"
+
+// BIG stuff
+
+#define MODBYTES_B384_29 48
+#define BASEBITS_B384_29 29
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_big_B416_29.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_big_B416_29.h
new file mode 100644
index 0000000..833fdc1
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_big_B416_29.h
@@ -0,0 +1,31 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_BIG_B416_29_H
+#define CONFIG_BIG_B416_29_H
+
+#include"core.h"
+
+// BIG stuff
+
+#define MODBYTES_B416_29 52
+#define BASEBITS_B416_29 29
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_big_B448_29.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_big_B448_29.h
new file mode 100644
index 0000000..6fd364c
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_big_B448_29.h
@@ -0,0 +1,31 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_BIG_B448_29_H
+#define CONFIG_BIG_B448_29_H
+
+#include"core.h"
+
+// BIG stuff
+
+#define MODBYTES_B448_29 56
+#define BASEBITS_B448_29 29
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_big_B464_28.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_big_B464_28.h
new file mode 100644
index 0000000..1da82ba
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_big_B464_28.h
@@ -0,0 +1,31 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_BIG_B464_28_H
+#define CONFIG_BIG_B464_28_H
+
+#include"core.h"
+
+// BIG stuff
+
+#define MODBYTES_B464_28 58
+#define BASEBITS_B464_28 28
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_big_B480_29.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_big_B480_29.h
new file mode 100644
index 0000000..d8ff941
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_big_B480_29.h
@@ -0,0 +1,31 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_BIG_B480_29_H
+#define CONFIG_BIG_B480_29_H
+
+#include"core.h"
+
+// BIG stuff
+
+#define MODBYTES_B480_29 60
+#define BASEBITS_B480_29 29
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_big_B512_29.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_big_B512_29.h
new file mode 100644
index 0000000..6990314
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_big_B512_29.h
@@ -0,0 +1,31 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_BIG_B512_29_H
+#define CONFIG_BIG_B512_29_H
+
+#include"core.h"
+
+// BIG stuff
+
+#define MODBYTES_B512_29 64
+#define BASEBITS_B512_29 29
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_big_B528_28.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_big_B528_28.h
new file mode 100644
index 0000000..a9776a3
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_big_B528_28.h
@@ -0,0 +1,31 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_BIG_B528_28_H
+#define CONFIG_BIG_B528_28_H
+
+#include"core.h"
+
+// BIG stuff
+
+#define MODBYTES_B528_28 66
+#define BASEBITS_B528_28 28
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_big_B560_29.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_big_B560_29.h
new file mode 100644
index 0000000..ad02e6a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_big_B560_29.h
@@ -0,0 +1,31 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_BIG_B560_29_H
+#define CONFIG_BIG_B560_29_H
+
+#include"core.h"
+
+// BIG stuff
+
+#define MODBYTES_B560_29 70
+#define BASEBITS_B560_29 29
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_big_B584_29.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_big_B584_29.h
new file mode 100644
index 0000000..3ff7c19
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_big_B584_29.h
@@ -0,0 +1,31 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_BIG_B584_29_H
+#define CONFIG_BIG_B584_29_H
+
+#include"core.h"
+
+// BIG stuff
+
+#define MODBYTES_B584_29 73
+#define BASEBITS_B584_29 29
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_ANSSI.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_ANSSI.h
new file mode 100644
index 0000000..a6ba300
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_ANSSI.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_ANSSI_H
+#define CONFIG_CURVE_ANSSI_H
+
+#include"core.h"
+#include"config_field_ANSSI.h"
+
+// ECP stuff
+
+#define CURVETYPE_ANSSI WEIERSTRASS
+#define CURVE_A_ANSSI -3
+#define PAIRING_FRIENDLY_ANSSI NOT_PF
+#define CURVE_SECURITY_ANSSI 128
+#define HTC_ISO_ANSSI 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_ANSSI
+
+#if PAIRING_FRIENDLY_ANSSI != NOT_PF
+
+#define HTC_ISO_G2_ANSSI 0
+
+#define USE_GLV_ANSSI   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_ANSSI /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_ANSSI /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_ANSSI 
+#define SIGN_OF_X_ANSSI 
+
+#define ATE_BITS_ANSSI 
+#define G2_TABLE_ANSSI 
+
+#endif
+
+
+#if CURVE_SECURITY_ANSSI == 128
+#define AESKEY_ANSSI 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_ANSSI SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_ANSSI == 192
+#define AESKEY_ANSSI 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_ANSSI SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_ANSSI == 256
+#define AESKEY_ANSSI 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_ANSSI SHA512  /**< Hash type */
+#endif
+
+
+namespace ANSSI_BIG = B256_28;
+namespace ANSSI_FP = ANSSI;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_BLS12381.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_BLS12381.h
new file mode 100644
index 0000000..9a940be
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_BLS12381.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_BLS12381_H
+#define CONFIG_CURVE_BLS12381_H
+
+#include"core.h"
+#include"config_field_BLS12381.h"
+
+// ECP stuff
+
+#define CURVETYPE_BLS12381 WEIERSTRASS
+#define CURVE_A_BLS12381 0
+#define PAIRING_FRIENDLY_BLS12381 BLS12_CURVE
+#define CURVE_SECURITY_BLS12381 128
+#define HTC_ISO_BLS12381 11
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_BLS12381
+
+#if PAIRING_FRIENDLY_BLS12381 != NOT_PF
+
+#define HTC_ISO_G2_BLS12381 3
+
+#define USE_GLV_BLS12381   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_BLS12381 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_BLS12381 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_BLS12381 M_TYPE
+#define SIGN_OF_X_BLS12381 NEGATIVEX
+
+#define ATE_BITS_BLS12381 65
+#define G2_TABLE_BLS12381 69
+
+#endif
+
+
+#if CURVE_SECURITY_BLS12381 == 128
+#define AESKEY_BLS12381 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_BLS12381 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BLS12381 == 192
+#define AESKEY_BLS12381 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_BLS12381 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BLS12381 == 256
+#define AESKEY_BLS12381 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_BLS12381 SHA512  /**< Hash type */
+#endif
+
+
+namespace BLS12381_BIG = B384_29;
+namespace BLS12381_FP = BLS12381;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_BLS12383.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_BLS12383.h
new file mode 100644
index 0000000..cf9462e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_BLS12383.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_BLS12383_H
+#define CONFIG_CURVE_BLS12383_H
+
+#include"core.h"
+#include"config_field_BLS12383.h"
+
+// ECP stuff
+
+#define CURVETYPE_BLS12383 WEIERSTRASS
+#define CURVE_A_BLS12383 0
+#define PAIRING_FRIENDLY_BLS12383 BLS12_CURVE
+#define CURVE_SECURITY_BLS12383 128
+#define HTC_ISO_BLS12383 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_BLS12383
+
+#if PAIRING_FRIENDLY_BLS12383 != NOT_PF
+
+#define HTC_ISO_G2_BLS12383 0
+
+#define USE_GLV_BLS12383   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_BLS12383 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_BLS12383 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_BLS12383 M_TYPE
+#define SIGN_OF_X_BLS12383 POSITIVEX
+
+#define ATE_BITS_BLS12383 65
+#define G2_TABLE_BLS12383 68
+
+#endif
+
+
+#if CURVE_SECURITY_BLS12383 == 128
+#define AESKEY_BLS12383 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_BLS12383 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BLS12383 == 192
+#define AESKEY_BLS12383 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_BLS12383 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BLS12383 == 256
+#define AESKEY_BLS12383 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_BLS12383 SHA512  /**< Hash type */
+#endif
+
+
+namespace BLS12383_BIG = B384_29;
+namespace BLS12383_FP = BLS12383;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_BLS12443.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_BLS12443.h
new file mode 100644
index 0000000..61fc556
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_BLS12443.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_BLS12443_H
+#define CONFIG_CURVE_BLS12443_H
+
+#include"core.h"
+#include"config_field_BLS12443.h"
+
+// ECP stuff
+
+#define CURVETYPE_BLS12443 WEIERSTRASS
+#define CURVE_A_BLS12443 0
+#define PAIRING_FRIENDLY_BLS12443 BLS12_CURVE
+#define CURVE_SECURITY_BLS12443 128
+#define HTC_ISO_BLS12443 11
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_BLS12443
+
+#if PAIRING_FRIENDLY_BLS12443 != NOT_PF
+
+#define HTC_ISO_G2_BLS12443 3
+
+#define USE_GLV_BLS12443   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_BLS12443 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_BLS12443 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_BLS12443 M_TYPE
+#define SIGN_OF_X_BLS12443 POSITIVEX
+
+#define ATE_BITS_BLS12443 75
+#define G2_TABLE_BLS12443 78
+
+#endif
+
+
+#if CURVE_SECURITY_BLS12443 == 128
+#define AESKEY_BLS12443 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_BLS12443 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BLS12443 == 192
+#define AESKEY_BLS12443 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_BLS12443 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BLS12443 == 256
+#define AESKEY_BLS12443 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_BLS12443 SHA512  /**< Hash type */
+#endif
+
+
+namespace BLS12443_BIG = B448_29;
+namespace BLS12443_FP = BLS12443;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_BLS12461.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_BLS12461.h
new file mode 100644
index 0000000..b9c0eba
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_BLS12461.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_BLS12461_H
+#define CONFIG_CURVE_BLS12461_H
+
+#include"core.h"
+#include"config_field_BLS12461.h"
+
+// ECP stuff
+
+#define CURVETYPE_BLS12461 WEIERSTRASS
+#define CURVE_A_BLS12461 0
+#define PAIRING_FRIENDLY_BLS12461 BLS12_CURVE
+#define CURVE_SECURITY_BLS12461 128
+#define HTC_ISO_BLS12461 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_BLS12461
+
+#if PAIRING_FRIENDLY_BLS12461 != NOT_PF
+
+#define HTC_ISO_G2_BLS12461 0
+
+#define USE_GLV_BLS12461   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_BLS12461 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_BLS12461 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_BLS12461 M_TYPE
+#define SIGN_OF_X_BLS12461 NEGATIVEX
+
+#define ATE_BITS_BLS12461 78
+#define G2_TABLE_BLS12461 79
+
+#endif
+
+
+#if CURVE_SECURITY_BLS12461 == 128
+#define AESKEY_BLS12461 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_BLS12461 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BLS12461 == 192
+#define AESKEY_BLS12461 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_BLS12461 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BLS12461 == 256
+#define AESKEY_BLS12461 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_BLS12461 SHA512  /**< Hash type */
+#endif
+
+
+namespace BLS12461_BIG = B464_28;
+namespace BLS12461_FP = BLS12461;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_BLS24479.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_BLS24479.h
new file mode 100644
index 0000000..9462ed9
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_BLS24479.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_BLS24479_H
+#define CONFIG_CURVE_BLS24479_H
+
+#include"core.h"
+#include"config_field_BLS24479.h"
+
+// ECP stuff
+
+#define CURVETYPE_BLS24479 WEIERSTRASS
+#define CURVE_A_BLS24479 0
+#define PAIRING_FRIENDLY_BLS24479 BLS24_CURVE
+#define CURVE_SECURITY_BLS24479 192
+#define HTC_ISO_BLS24479 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_BLS24479
+
+#if PAIRING_FRIENDLY_BLS24479 != NOT_PF
+
+#define HTC_ISO_G2_BLS24479 0
+
+#define USE_GLV_BLS24479   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_BLS24479 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_BLS24479 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_BLS24479 M_TYPE
+#define SIGN_OF_X_BLS24479 POSITIVEX
+
+#define ATE_BITS_BLS24479 49
+#define G2_TABLE_BLS24479 52
+
+#endif
+
+
+#if CURVE_SECURITY_BLS24479 == 128
+#define AESKEY_BLS24479 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_BLS24479 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BLS24479 == 192
+#define AESKEY_BLS24479 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_BLS24479 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BLS24479 == 256
+#define AESKEY_BLS24479 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_BLS24479 SHA512  /**< Hash type */
+#endif
+
+
+namespace BLS24479_BIG = B480_29;
+namespace BLS24479_FP = BLS24479;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_BLS48286.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_BLS48286.h
new file mode 100644
index 0000000..06a71a4
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_BLS48286.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_BLS48286_H
+#define CONFIG_CURVE_BLS48286_H
+
+#include"core.h"
+#include"config_field_BLS48286.h"
+
+// ECP stuff
+
+#define CURVETYPE_BLS48286 WEIERSTRASS
+#define CURVE_A_BLS48286 0
+#define PAIRING_FRIENDLY_BLS48286 BLS48_CURVE
+#define CURVE_SECURITY_BLS48286 128
+#define HTC_ISO_BLS48286 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_BLS48286
+
+#if PAIRING_FRIENDLY_BLS48286 != NOT_PF
+
+#define HTC_ISO_G2_BLS48286 0
+
+#define USE_GLV_BLS48286   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_BLS48286 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_BLS48286 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_BLS48286 M_TYPE
+#define SIGN_OF_X_BLS48286 POSITIVEX
+
+#define ATE_BITS_BLS48286 17
+#define G2_TABLE_BLS48286 20
+
+#endif
+
+
+#if CURVE_SECURITY_BLS48286 == 128
+#define AESKEY_BLS48286 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_BLS48286 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BLS48286 == 192
+#define AESKEY_BLS48286 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_BLS48286 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BLS48286 == 256
+#define AESKEY_BLS48286 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_BLS48286 SHA512  /**< Hash type */
+#endif
+
+
+namespace BLS48286_BIG = B288_29;
+namespace BLS48286_FP = BLS48286;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_BLS48556.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_BLS48556.h
new file mode 100644
index 0000000..058554b
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_BLS48556.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_BLS48556_H
+#define CONFIG_CURVE_BLS48556_H
+
+#include"core.h"
+#include"config_field_BLS48556.h"
+
+// ECP stuff
+
+#define CURVETYPE_BLS48556 WEIERSTRASS
+#define CURVE_A_BLS48556 0
+#define PAIRING_FRIENDLY_BLS48556 BLS48_CURVE
+#define CURVE_SECURITY_BLS48556 256
+#define HTC_ISO_BLS48556 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_BLS48556
+
+#if PAIRING_FRIENDLY_BLS48556 != NOT_PF
+
+#define HTC_ISO_G2_BLS48556 0
+
+#define USE_GLV_BLS48556   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_BLS48556 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_BLS48556 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_BLS48556 M_TYPE
+#define SIGN_OF_X_BLS48556 POSITIVEX
+
+#define ATE_BITS_BLS48556 32
+#define G2_TABLE_BLS48556 35
+
+#endif
+
+
+#if CURVE_SECURITY_BLS48556 == 128
+#define AESKEY_BLS48556 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_BLS48556 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BLS48556 == 192
+#define AESKEY_BLS48556 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_BLS48556 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BLS48556 == 256
+#define AESKEY_BLS48556 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_BLS48556 SHA512  /**< Hash type */
+#endif
+
+
+namespace BLS48556_BIG = B560_29;
+namespace BLS48556_FP = BLS48556;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_BLS48581.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_BLS48581.h
new file mode 100644
index 0000000..470b4fd
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_BLS48581.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_BLS48581_H
+#define CONFIG_CURVE_BLS48581_H
+
+#include"core.h"
+#include"config_field_BLS48581.h"
+
+// ECP stuff
+
+#define CURVETYPE_BLS48581 WEIERSTRASS
+#define CURVE_A_BLS48581 0
+#define PAIRING_FRIENDLY_BLS48581 BLS48_CURVE
+#define CURVE_SECURITY_BLS48581 256
+#define HTC_ISO_BLS48581 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_BLS48581
+
+#if PAIRING_FRIENDLY_BLS48581 != NOT_PF
+
+#define HTC_ISO_G2_BLS48581 0
+
+#define USE_GLV_BLS48581   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_BLS48581 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_BLS48581 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_BLS48581 D_TYPE
+#define SIGN_OF_X_BLS48581 NEGATIVEX
+
+#define ATE_BITS_BLS48581 33
+#define G2_TABLE_BLS48581 36
+
+#endif
+
+
+#if CURVE_SECURITY_BLS48581 == 128
+#define AESKEY_BLS48581 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_BLS48581 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BLS48581 == 192
+#define AESKEY_BLS48581 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_BLS48581 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BLS48581 == 256
+#define AESKEY_BLS48581 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_BLS48581 SHA512  /**< Hash type */
+#endif
+
+
+namespace BLS48581_BIG = B584_29;
+namespace BLS48581_FP = BLS48581;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_BN158.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_BN158.h
new file mode 100644
index 0000000..e388956
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_BN158.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_BN158_H
+#define CONFIG_CURVE_BN158_H
+
+#include"core.h"
+#include"config_field_BN158.h"
+
+// ECP stuff
+
+#define CURVETYPE_BN158 WEIERSTRASS
+#define CURVE_A_BN158 0
+#define PAIRING_FRIENDLY_BN158 BN_CURVE
+#define CURVE_SECURITY_BN158 128
+#define HTC_ISO_BN158 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_BN158
+
+#if PAIRING_FRIENDLY_BN158 != NOT_PF
+
+#define HTC_ISO_G2_BN158 0
+
+#define USE_GLV_BN158   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_BN158 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_BN158 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_BN158 M_TYPE
+#define SIGN_OF_X_BN158 NEGATIVEX
+
+#define ATE_BITS_BN158 42
+#define G2_TABLE_BN158 49
+
+#endif
+
+
+#if CURVE_SECURITY_BN158 == 128
+#define AESKEY_BN158 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_BN158 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BN158 == 192
+#define AESKEY_BN158 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_BN158 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BN158 == 256
+#define AESKEY_BN158 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_BN158 SHA512  /**< Hash type */
+#endif
+
+
+namespace BN158_BIG = B160_28;
+namespace BN158_FP = BN158;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_BN254.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_BN254.h
new file mode 100644
index 0000000..d21599b
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_BN254.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_BN254_H
+#define CONFIG_CURVE_BN254_H
+
+#include"core.h"
+#include"config_field_BN254.h"
+
+// ECP stuff
+
+#define CURVETYPE_BN254 WEIERSTRASS
+#define CURVE_A_BN254 0
+#define PAIRING_FRIENDLY_BN254 BN_CURVE
+#define CURVE_SECURITY_BN254 128
+#define HTC_ISO_BN254 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_BN254
+
+#if PAIRING_FRIENDLY_BN254 != NOT_PF
+
+#define HTC_ISO_G2_BN254 0
+
+#define USE_GLV_BN254   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_BN254 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_BN254 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_BN254 D_TYPE
+#define SIGN_OF_X_BN254 NEGATIVEX
+
+#define ATE_BITS_BN254 66
+#define G2_TABLE_BN254 71
+
+#endif
+
+
+#if CURVE_SECURITY_BN254 == 128
+#define AESKEY_BN254 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_BN254 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BN254 == 192
+#define AESKEY_BN254 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_BN254 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BN254 == 256
+#define AESKEY_BN254 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_BN254 SHA512  /**< Hash type */
+#endif
+
+
+namespace BN254_BIG = B256_28;
+namespace BN254_FP = BN254;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_BN254CX.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_BN254CX.h
new file mode 100644
index 0000000..b4933be
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_BN254CX.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_BN254CX_H
+#define CONFIG_CURVE_BN254CX_H
+
+#include"core.h"
+#include"config_field_BN254CX.h"
+
+// ECP stuff
+
+#define CURVETYPE_BN254CX WEIERSTRASS
+#define CURVE_A_BN254CX 0
+#define PAIRING_FRIENDLY_BN254CX BN_CURVE
+#define CURVE_SECURITY_BN254CX 128
+#define HTC_ISO_BN254CX 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_BN254CX
+
+#if PAIRING_FRIENDLY_BN254CX != NOT_PF
+
+#define HTC_ISO_G2_BN254CX 0
+
+#define USE_GLV_BN254CX   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_BN254CX /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_BN254CX /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_BN254CX D_TYPE
+#define SIGN_OF_X_BN254CX NEGATIVEX
+
+#define ATE_BITS_BN254CX 66
+#define G2_TABLE_BN254CX 76
+
+#endif
+
+
+#if CURVE_SECURITY_BN254CX == 128
+#define AESKEY_BN254CX 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_BN254CX SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BN254CX == 192
+#define AESKEY_BN254CX 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_BN254CX SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BN254CX == 256
+#define AESKEY_BN254CX 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_BN254CX SHA512  /**< Hash type */
+#endif
+
+
+namespace BN254CX_BIG = B256_28;
+namespace BN254CX_FP = BN254CX;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_BN462.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_BN462.h
new file mode 100644
index 0000000..7eac2eb
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_BN462.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_BN462_H
+#define CONFIG_CURVE_BN462_H
+
+#include"core.h"
+#include"config_field_BN462.h"
+
+// ECP stuff
+
+#define CURVETYPE_BN462 WEIERSTRASS
+#define CURVE_A_BN462 0
+#define PAIRING_FRIENDLY_BN462 BN_CURVE
+#define CURVE_SECURITY_BN462 128
+#define HTC_ISO_BN462 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_BN462
+
+#if PAIRING_FRIENDLY_BN462 != NOT_PF
+
+#define HTC_ISO_G2_BN462 0
+
+#define USE_GLV_BN462   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_BN462 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_BN462 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_BN462 D_TYPE
+#define SIGN_OF_X_BN462 POSITIVEX
+
+#define ATE_BITS_BN462 118
+#define G2_TABLE_BN462 125
+
+#endif
+
+
+#if CURVE_SECURITY_BN462 == 128
+#define AESKEY_BN462 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_BN462 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BN462 == 192
+#define AESKEY_BN462 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_BN462 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BN462 == 256
+#define AESKEY_BN462 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_BN462 SHA512  /**< Hash type */
+#endif
+
+
+namespace BN462_BIG = B464_28;
+namespace BN462_FP = BN462;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_BRAINPOOL.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_BRAINPOOL.h
new file mode 100644
index 0000000..dbda1e5
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_BRAINPOOL.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_BRAINPOOL_H
+#define CONFIG_CURVE_BRAINPOOL_H
+
+#include"core.h"
+#include"config_field_BRAINPOOL.h"
+
+// ECP stuff
+
+#define CURVETYPE_BRAINPOOL WEIERSTRASS
+#define CURVE_A_BRAINPOOL -3
+#define PAIRING_FRIENDLY_BRAINPOOL NOT_PF
+#define CURVE_SECURITY_BRAINPOOL 128
+#define HTC_ISO_BRAINPOOL 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_BRAINPOOL
+
+#if PAIRING_FRIENDLY_BRAINPOOL != NOT_PF
+
+#define HTC_ISO_G2_BRAINPOOL 0
+
+#define USE_GLV_BRAINPOOL   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_BRAINPOOL /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_BRAINPOOL /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_BRAINPOOL 
+#define SIGN_OF_X_BRAINPOOL 
+
+#define ATE_BITS_BRAINPOOL 
+#define G2_TABLE_BRAINPOOL 
+
+#endif
+
+
+#if CURVE_SECURITY_BRAINPOOL == 128
+#define AESKEY_BRAINPOOL 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_BRAINPOOL SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BRAINPOOL == 192
+#define AESKEY_BRAINPOOL 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_BRAINPOOL SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BRAINPOOL == 256
+#define AESKEY_BRAINPOOL 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_BRAINPOOL SHA512  /**< Hash type */
+#endif
+
+
+namespace BRAINPOOL_BIG = B256_28;
+namespace BRAINPOOL_FP = BRAINPOOL;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_C1174.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_C1174.h
new file mode 100644
index 0000000..60c1764
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_C1174.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_C1174_H
+#define CONFIG_CURVE_C1174_H
+
+#include"core.h"
+#include"config_field_C1174.h"
+
+// ECP stuff
+
+#define CURVETYPE_C1174 EDWARDS
+#define CURVE_A_C1174 1
+#define PAIRING_FRIENDLY_C1174 NOT_PF
+#define CURVE_SECURITY_C1174 128
+#define HTC_ISO_C1174 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_C1174
+
+#if PAIRING_FRIENDLY_C1174 != NOT_PF
+
+#define HTC_ISO_G2_C1174 0
+
+#define USE_GLV_C1174   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_C1174 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_C1174 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_C1174 
+#define SIGN_OF_X_C1174 
+
+#define ATE_BITS_C1174 
+#define G2_TABLE_C1174 
+
+#endif
+
+
+#if CURVE_SECURITY_C1174 == 128
+#define AESKEY_C1174 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_C1174 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_C1174 == 192
+#define AESKEY_C1174 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_C1174 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_C1174 == 256
+#define AESKEY_C1174 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_C1174 SHA512  /**< Hash type */
+#endif
+
+
+namespace C1174_BIG = B256_29;
+namespace C1174_FP = C1174;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_C13318.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_C13318.h
new file mode 100644
index 0000000..bd2b318
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_C13318.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_C13318_H
+#define CONFIG_CURVE_C13318_H
+
+#include"core.h"
+#include"config_field_F25519.h"
+
+// ECP stuff
+
+#define CURVETYPE_C13318 WEIERSTRASS
+#define CURVE_A_C13318 -3
+#define PAIRING_FRIENDLY_C13318 NOT_PF
+#define CURVE_SECURITY_C13318 128
+#define HTC_ISO_C13318 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_C13318
+
+#if PAIRING_FRIENDLY_C13318 != NOT_PF
+
+#define HTC_ISO_G2_C13318 0
+
+#define USE_GLV_C13318   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_C13318 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_C13318 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_C13318 
+#define SIGN_OF_X_C13318 
+
+#define ATE_BITS_C13318 
+#define G2_TABLE_C13318 
+
+#endif
+
+
+#if CURVE_SECURITY_C13318 == 128
+#define AESKEY_C13318 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_C13318 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_C13318 == 192
+#define AESKEY_C13318 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_C13318 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_C13318 == 256
+#define AESKEY_C13318 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_C13318 SHA512  /**< Hash type */
+#endif
+
+
+namespace C13318_BIG = B256_29;
+namespace C13318_FP = F25519;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_C1665.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_C1665.h
new file mode 100644
index 0000000..1f760f6
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_C1665.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_C1665_H
+#define CONFIG_CURVE_C1665_H
+
+#include"core.h"
+#include"config_field_C1665.h"
+
+// ECP stuff
+
+#define CURVETYPE_C1665 EDWARDS
+#define CURVE_A_C1665 1
+#define PAIRING_FRIENDLY_C1665 NOT_PF
+#define CURVE_SECURITY_C1665 128
+#define HTC_ISO_C1665 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_C1665
+
+#if PAIRING_FRIENDLY_C1665 != NOT_PF
+
+#define HTC_ISO_G2_C1665 0
+
+#define USE_GLV_C1665   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_C1665 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_C1665 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_C1665 
+#define SIGN_OF_X_C1665 
+
+#define ATE_BITS_C1665 
+#define G2_TABLE_C1665 
+
+#endif
+
+
+#if CURVE_SECURITY_C1665 == 128
+#define AESKEY_C1665 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_C1665 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_C1665 == 192
+#define AESKEY_C1665 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_C1665 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_C1665 == 256
+#define AESKEY_C1665 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_C1665 SHA512  /**< Hash type */
+#endif
+
+
+namespace C1665_BIG = B168_29;
+namespace C1665_FP = C1665;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_C25519.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_C25519.h
new file mode 100644
index 0000000..7381674
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_C25519.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_C25519_H
+#define CONFIG_CURVE_C25519_H
+
+#include"core.h"
+#include"config_field_F25519.h"
+
+// ECP stuff
+
+#define CURVETYPE_C25519 MONTGOMERY
+#define CURVE_A_C25519 486662
+#define PAIRING_FRIENDLY_C25519 NOT_PF
+#define CURVE_SECURITY_C25519 128
+#define HTC_ISO_C25519 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_C25519
+
+#if PAIRING_FRIENDLY_C25519 != NOT_PF
+
+#define HTC_ISO_G2_C25519 0
+
+#define USE_GLV_C25519   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_C25519 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_C25519 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_C25519 
+#define SIGN_OF_X_C25519 
+
+#define ATE_BITS_C25519 
+#define G2_TABLE_C25519 
+
+#endif
+
+
+#if CURVE_SECURITY_C25519 == 128
+#define AESKEY_C25519 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_C25519 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_C25519 == 192
+#define AESKEY_C25519 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_C25519 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_C25519 == 256
+#define AESKEY_C25519 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_C25519 SHA512  /**< Hash type */
+#endif
+
+
+namespace C25519_BIG = B256_29;
+namespace C25519_FP = F25519;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_C41417.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_C41417.h
new file mode 100644
index 0000000..2150975
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_C41417.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_C41417_H
+#define CONFIG_CURVE_C41417_H
+
+#include"core.h"
+#include"config_field_C41417.h"
+
+// ECP stuff
+
+#define CURVETYPE_C41417 EDWARDS
+#define CURVE_A_C41417 1
+#define PAIRING_FRIENDLY_C41417 NOT_PF
+#define CURVE_SECURITY_C41417 256
+#define HTC_ISO_C41417 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_C41417
+
+#if PAIRING_FRIENDLY_C41417 != NOT_PF
+
+#define HTC_ISO_G2_C41417 0
+
+#define USE_GLV_C41417   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_C41417 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_C41417 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_C41417 
+#define SIGN_OF_X_C41417 
+
+#define ATE_BITS_C41417 
+#define G2_TABLE_C41417 
+
+#endif
+
+
+#if CURVE_SECURITY_C41417 == 128
+#define AESKEY_C41417 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_C41417 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_C41417 == 192
+#define AESKEY_C41417 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_C41417 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_C41417 == 256
+#define AESKEY_C41417 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_C41417 SHA512  /**< Hash type */
+#endif
+
+
+namespace C41417_BIG = B416_29;
+namespace C41417_FP = C41417;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_Ed25519.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_Ed25519.h
new file mode 100644
index 0000000..fc80aac
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_Ed25519.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_Ed25519_H
+#define CONFIG_CURVE_Ed25519_H
+
+#include"core.h"
+#include"config_field_F25519.h"
+
+// ECP stuff
+
+#define CURVETYPE_Ed25519 EDWARDS
+#define CURVE_A_Ed25519 -1
+#define PAIRING_FRIENDLY_Ed25519 NOT_PF
+#define CURVE_SECURITY_Ed25519 128
+#define HTC_ISO_Ed25519 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_Ed25519
+
+#if PAIRING_FRIENDLY_Ed25519 != NOT_PF
+
+#define HTC_ISO_G2_Ed25519 0
+
+#define USE_GLV_Ed25519   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_Ed25519 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_Ed25519 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_Ed25519 
+#define SIGN_OF_X_Ed25519 
+
+#define ATE_BITS_Ed25519 
+#define G2_TABLE_Ed25519 
+
+#endif
+
+
+#if CURVE_SECURITY_Ed25519 == 128
+#define AESKEY_Ed25519 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_Ed25519 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_Ed25519 == 192
+#define AESKEY_Ed25519 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_Ed25519 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_Ed25519 == 256
+#define AESKEY_Ed25519 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_Ed25519 SHA512  /**< Hash type */
+#endif
+
+
+namespace Ed25519_BIG = B256_29;
+namespace Ed25519_FP = F25519;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_Ed448.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_Ed448.h
new file mode 100644
index 0000000..0b36d58
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_Ed448.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_Ed448_H
+#define CONFIG_CURVE_Ed448_H
+
+#include"core.h"
+#include"config_field_F448.h"
+
+// ECP stuff
+
+#define CURVETYPE_Ed448 EDWARDS
+#define CURVE_A_Ed448 1
+#define PAIRING_FRIENDLY_Ed448 NOT_PF
+#define CURVE_SECURITY_Ed448 256
+#define HTC_ISO_Ed448 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_Ed448
+
+#if PAIRING_FRIENDLY_Ed448 != NOT_PF
+
+#define HTC_ISO_G2_Ed448 0
+
+#define USE_GLV_Ed448   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_Ed448 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_Ed448 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_Ed448 
+#define SIGN_OF_X_Ed448 
+
+#define ATE_BITS_Ed448 
+#define G2_TABLE_Ed448 
+
+#endif
+
+
+#if CURVE_SECURITY_Ed448 == 128
+#define AESKEY_Ed448 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_Ed448 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_Ed448 == 192
+#define AESKEY_Ed448 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_Ed448 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_Ed448 == 256
+#define AESKEY_Ed448 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_Ed448 SHA512  /**< Hash type */
+#endif
+
+
+namespace Ed448_BIG = B448_29;
+namespace Ed448_FP = F448;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_FP256BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_FP256BN.h
new file mode 100644
index 0000000..35178d1
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_FP256BN.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_FP256BN_H
+#define CONFIG_CURVE_FP256BN_H
+
+#include"core.h"
+#include"config_field_FP256BN.h"
+
+// ECP stuff
+
+#define CURVETYPE_FP256BN WEIERSTRASS
+#define CURVE_A_FP256BN 0
+#define PAIRING_FRIENDLY_FP256BN BN_CURVE
+#define CURVE_SECURITY_FP256BN 128
+#define HTC_ISO_FP256BN 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_FP256BN
+
+#if PAIRING_FRIENDLY_FP256BN != NOT_PF
+
+#define HTC_ISO_G2_FP256BN 0
+
+#define USE_GLV_FP256BN   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_FP256BN /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_FP256BN /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_FP256BN M_TYPE
+#define SIGN_OF_X_FP256BN NEGATIVEX
+
+#define ATE_BITS_FP256BN 66
+#define G2_TABLE_FP256BN 83
+
+#endif
+
+
+#if CURVE_SECURITY_FP256BN == 128
+#define AESKEY_FP256BN 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_FP256BN SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_FP256BN == 192
+#define AESKEY_FP256BN 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_FP256BN SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_FP256BN == 256
+#define AESKEY_FP256BN 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_FP256BN SHA512  /**< Hash type */
+#endif
+
+
+namespace FP256BN_BIG = B256_28;
+namespace FP256BN_FP = FP256BN;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_FP512BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_FP512BN.h
new file mode 100644
index 0000000..9a96ed7
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_FP512BN.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_FP512BN_H
+#define CONFIG_CURVE_FP512BN_H
+
+#include"core.h"
+#include"config_field_FP512BN.h"
+
+// ECP stuff
+
+#define CURVETYPE_FP512BN WEIERSTRASS
+#define CURVE_A_FP512BN 0
+#define PAIRING_FRIENDLY_FP512BN BN_CURVE
+#define CURVE_SECURITY_FP512BN 128
+#define HTC_ISO_FP512BN 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_FP512BN
+
+#if PAIRING_FRIENDLY_FP512BN != NOT_PF
+
+#define HTC_ISO_G2_FP512BN 0
+
+#define USE_GLV_FP512BN   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_FP512BN /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_FP512BN /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_FP512BN M_TYPE
+#define SIGN_OF_X_FP512BN POSITIVEX
+
+#define ATE_BITS_FP512BN 130
+#define G2_TABLE_FP512BN 172
+
+#endif
+
+
+#if CURVE_SECURITY_FP512BN == 128
+#define AESKEY_FP512BN 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_FP512BN SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_FP512BN == 192
+#define AESKEY_FP512BN 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_FP512BN SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_FP512BN == 256
+#define AESKEY_FP512BN 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_FP512BN SHA512  /**< Hash type */
+#endif
+
+
+namespace FP512BN_BIG = B512_29;
+namespace FP512BN_FP = FP512BN;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_HIFIVE.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_HIFIVE.h
new file mode 100644
index 0000000..67c0114
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_HIFIVE.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_HIFIVE_H
+#define CONFIG_CURVE_HIFIVE_H
+
+#include"core.h"
+#include"config_field_HIFIVE.h"
+
+// ECP stuff
+
+#define CURVETYPE_HIFIVE EDWARDS
+#define CURVE_A_HIFIVE 1
+#define PAIRING_FRIENDLY_HIFIVE NOT_PF
+#define CURVE_SECURITY_HIFIVE 192
+#define HTC_ISO_HIFIVE 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_HIFIVE
+
+#if PAIRING_FRIENDLY_HIFIVE != NOT_PF
+
+#define HTC_ISO_G2_HIFIVE 0
+
+#define USE_GLV_HIFIVE   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_HIFIVE /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_HIFIVE /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_HIFIVE 
+#define SIGN_OF_X_HIFIVE 
+
+#define ATE_BITS_HIFIVE 
+#define G2_TABLE_HIFIVE 
+
+#endif
+
+
+#if CURVE_SECURITY_HIFIVE == 128
+#define AESKEY_HIFIVE 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_HIFIVE SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_HIFIVE == 192
+#define AESKEY_HIFIVE 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_HIFIVE SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_HIFIVE == 256
+#define AESKEY_HIFIVE 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_HIFIVE SHA512  /**< Hash type */
+#endif
+
+
+namespace HIFIVE_BIG = B336_29;
+namespace HIFIVE_FP = HIFIVE;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_JUBJUB.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_JUBJUB.h
new file mode 100644
index 0000000..17cb02e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_JUBJUB.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_JUBJUB_H
+#define CONFIG_CURVE_JUBJUB_H
+
+#include"core.h"
+#include"config_field_JUBJUB.h"
+
+// ECP stuff
+
+#define CURVETYPE_JUBJUB EDWARDS
+#define CURVE_A_JUBJUB -1
+#define PAIRING_FRIENDLY_JUBJUB NOT_PF
+#define CURVE_SECURITY_JUBJUB 128
+#define HTC_ISO_JUBJUB 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_JUBJUB
+
+#if PAIRING_FRIENDLY_JUBJUB != NOT_PF
+
+#define HTC_ISO_G2_JUBJUB 0
+
+#define USE_GLV_JUBJUB   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_JUBJUB /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_JUBJUB /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_JUBJUB 
+#define SIGN_OF_X_JUBJUB 
+
+#define ATE_BITS_JUBJUB 
+#define G2_TABLE_JUBJUB 
+
+#endif
+
+
+#if CURVE_SECURITY_JUBJUB == 128
+#define AESKEY_JUBJUB 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_JUBJUB SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_JUBJUB == 192
+#define AESKEY_JUBJUB 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_JUBJUB SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_JUBJUB == 256
+#define AESKEY_JUBJUB 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_JUBJUB SHA512  /**< Hash type */
+#endif
+
+
+namespace JUBJUB_BIG = B256_29;
+namespace JUBJUB_FP = JUBJUB;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_MDC.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_MDC.h
new file mode 100644
index 0000000..83d5769
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_MDC.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_MDC_H
+#define CONFIG_CURVE_MDC_H
+
+#include"core.h"
+#include"config_field_MDC.h"
+
+// ECP stuff
+
+#define CURVETYPE_MDC EDWARDS
+#define CURVE_A_MDC 1
+#define PAIRING_FRIENDLY_MDC NOT_PF
+#define CURVE_SECURITY_MDC 128
+#define HTC_ISO_MDC 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_MDC
+
+#if PAIRING_FRIENDLY_MDC != NOT_PF
+
+#define HTC_ISO_G2_MDC 0
+
+#define USE_GLV_MDC   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_MDC /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_MDC /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_MDC 
+#define SIGN_OF_X_MDC 
+
+#define ATE_BITS_MDC 
+#define G2_TABLE_MDC 
+
+#endif
+
+
+#if CURVE_SECURITY_MDC == 128
+#define AESKEY_MDC 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_MDC SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_MDC == 192
+#define AESKEY_MDC 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_MDC SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_MDC == 256
+#define AESKEY_MDC 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_MDC SHA512  /**< Hash type */
+#endif
+
+
+namespace MDC_BIG = B256_28;
+namespace MDC_FP = MDC;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_NIST256.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_NIST256.h
new file mode 100644
index 0000000..f3c7597
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_NIST256.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_NIST256_H
+#define CONFIG_CURVE_NIST256_H
+
+#include"core.h"
+#include"config_field_NIST256.h"
+
+// ECP stuff
+
+#define CURVETYPE_NIST256 WEIERSTRASS
+#define CURVE_A_NIST256 -3
+#define PAIRING_FRIENDLY_NIST256 NOT_PF
+#define CURVE_SECURITY_NIST256 128
+#define HTC_ISO_NIST256 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_NIST256
+
+#if PAIRING_FRIENDLY_NIST256 != NOT_PF
+
+#define HTC_ISO_G2_NIST256 0
+
+#define USE_GLV_NIST256   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_NIST256 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_NIST256 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_NIST256 
+#define SIGN_OF_X_NIST256 
+
+#define ATE_BITS_NIST256 
+#define G2_TABLE_NIST256 
+
+#endif
+
+
+#if CURVE_SECURITY_NIST256 == 128
+#define AESKEY_NIST256 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_NIST256 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_NIST256 == 192
+#define AESKEY_NIST256 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_NIST256 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_NIST256 == 256
+#define AESKEY_NIST256 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_NIST256 SHA512  /**< Hash type */
+#endif
+
+
+namespace NIST256_BIG = B256_28;
+namespace NIST256_FP = NIST256;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_NIST384.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_NIST384.h
new file mode 100644
index 0000000..db3a069
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_NIST384.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_NIST384_H
+#define CONFIG_CURVE_NIST384_H
+
+#include"core.h"
+#include"config_field_NIST384.h"
+
+// ECP stuff
+
+#define CURVETYPE_NIST384 WEIERSTRASS
+#define CURVE_A_NIST384 -3
+#define PAIRING_FRIENDLY_NIST384 NOT_PF
+#define CURVE_SECURITY_NIST384 192
+#define HTC_ISO_NIST384 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_NIST384
+
+#if PAIRING_FRIENDLY_NIST384 != NOT_PF
+
+#define HTC_ISO_G2_NIST384 0
+
+#define USE_GLV_NIST384   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_NIST384 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_NIST384 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_NIST384 
+#define SIGN_OF_X_NIST384 
+
+#define ATE_BITS_NIST384 
+#define G2_TABLE_NIST384 
+
+#endif
+
+
+#if CURVE_SECURITY_NIST384 == 128
+#define AESKEY_NIST384 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_NIST384 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_NIST384 == 192
+#define AESKEY_NIST384 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_NIST384 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_NIST384 == 256
+#define AESKEY_NIST384 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_NIST384 SHA512  /**< Hash type */
+#endif
+
+
+namespace NIST384_BIG = B384_29;
+namespace NIST384_FP = NIST384;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_NIST521.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_NIST521.h
new file mode 100644
index 0000000..7188c1b
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_NIST521.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_NIST521_H
+#define CONFIG_CURVE_NIST521_H
+
+#include"core.h"
+#include"config_field_NIST521.h"
+
+// ECP stuff
+
+#define CURVETYPE_NIST521 WEIERSTRASS
+#define CURVE_A_NIST521 -3
+#define PAIRING_FRIENDLY_NIST521 NOT_PF
+#define CURVE_SECURITY_NIST521 256
+#define HTC_ISO_NIST521 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_NIST521
+
+#if PAIRING_FRIENDLY_NIST521 != NOT_PF
+
+#define HTC_ISO_G2_NIST521 0
+
+#define USE_GLV_NIST521   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_NIST521 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_NIST521 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_NIST521 
+#define SIGN_OF_X_NIST521 
+
+#define ATE_BITS_NIST521 
+#define G2_TABLE_NIST521 
+
+#endif
+
+
+#if CURVE_SECURITY_NIST521 == 128
+#define AESKEY_NIST521 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_NIST521 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_NIST521 == 192
+#define AESKEY_NIST521 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_NIST521 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_NIST521 == 256
+#define AESKEY_NIST521 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_NIST521 SHA512  /**< Hash type */
+#endif
+
+
+namespace NIST521_BIG = B528_28;
+namespace NIST521_FP = NIST521;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_NUMS256E.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_NUMS256E.h
new file mode 100644
index 0000000..cbcdff7
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_NUMS256E.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_NUMS256E_H
+#define CONFIG_CURVE_NUMS256E_H
+
+#include"core.h"
+#include"config_field_F256PME.h"
+
+// ECP stuff
+
+#define CURVETYPE_NUMS256E EDWARDS
+#define CURVE_A_NUMS256E 1
+#define PAIRING_FRIENDLY_NUMS256E NOT_PF
+#define CURVE_SECURITY_NUMS256E 128
+#define HTC_ISO_NUMS256E 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_NUMS256E
+
+#if PAIRING_FRIENDLY_NUMS256E != NOT_PF
+
+#define HTC_ISO_G2_NUMS256E 0
+
+#define USE_GLV_NUMS256E   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_NUMS256E /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_NUMS256E /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_NUMS256E 
+#define SIGN_OF_X_NUMS256E 
+
+#define ATE_BITS_NUMS256E 
+#define G2_TABLE_NUMS256E 
+
+#endif
+
+
+#if CURVE_SECURITY_NUMS256E == 128
+#define AESKEY_NUMS256E 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_NUMS256E SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_NUMS256E == 192
+#define AESKEY_NUMS256E 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_NUMS256E SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_NUMS256E == 256
+#define AESKEY_NUMS256E 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_NUMS256E SHA512  /**< Hash type */
+#endif
+
+
+namespace NUMS256E_BIG = B256_29;
+namespace NUMS256E_FP = F256PME;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_NUMS256W.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_NUMS256W.h
new file mode 100644
index 0000000..850123a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_NUMS256W.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_NUMS256W_H
+#define CONFIG_CURVE_NUMS256W_H
+
+#include"core.h"
+#include"config_field_F256PMW.h"
+
+// ECP stuff
+
+#define CURVETYPE_NUMS256W WEIERSTRASS
+#define CURVE_A_NUMS256W -3
+#define PAIRING_FRIENDLY_NUMS256W NOT_PF
+#define CURVE_SECURITY_NUMS256W 128
+#define HTC_ISO_NUMS256W 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_NUMS256W
+
+#if PAIRING_FRIENDLY_NUMS256W != NOT_PF
+
+#define HTC_ISO_G2_NUMS256W 0
+
+#define USE_GLV_NUMS256W   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_NUMS256W /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_NUMS256W /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_NUMS256W 
+#define SIGN_OF_X_NUMS256W 
+
+#define ATE_BITS_NUMS256W 
+#define G2_TABLE_NUMS256W 
+
+#endif
+
+
+#if CURVE_SECURITY_NUMS256W == 128
+#define AESKEY_NUMS256W 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_NUMS256W SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_NUMS256W == 192
+#define AESKEY_NUMS256W 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_NUMS256W SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_NUMS256W == 256
+#define AESKEY_NUMS256W 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_NUMS256W SHA512  /**< Hash type */
+#endif
+
+
+namespace NUMS256W_BIG = B256_28;
+namespace NUMS256W_FP = F256PMW;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_NUMS384E.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_NUMS384E.h
new file mode 100644
index 0000000..ba74f70
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_NUMS384E.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_NUMS384E_H
+#define CONFIG_CURVE_NUMS384E_H
+
+#include"core.h"
+#include"config_field_F384PM.h"
+
+// ECP stuff
+
+#define CURVETYPE_NUMS384E EDWARDS
+#define CURVE_A_NUMS384E 1
+#define PAIRING_FRIENDLY_NUMS384E NOT_PF
+#define CURVE_SECURITY_NUMS384E 192
+#define HTC_ISO_NUMS384E 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_NUMS384E
+
+#if PAIRING_FRIENDLY_NUMS384E != NOT_PF
+
+#define HTC_ISO_G2_NUMS384E 0
+
+#define USE_GLV_NUMS384E   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_NUMS384E /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_NUMS384E /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_NUMS384E 
+#define SIGN_OF_X_NUMS384E 
+
+#define ATE_BITS_NUMS384E 
+#define G2_TABLE_NUMS384E 
+
+#endif
+
+
+#if CURVE_SECURITY_NUMS384E == 128
+#define AESKEY_NUMS384E 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_NUMS384E SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_NUMS384E == 192
+#define AESKEY_NUMS384E 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_NUMS384E SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_NUMS384E == 256
+#define AESKEY_NUMS384E 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_NUMS384E SHA512  /**< Hash type */
+#endif
+
+
+namespace NUMS384E_BIG = B384_29;
+namespace NUMS384E_FP = F384PM;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_NUMS384W.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_NUMS384W.h
new file mode 100644
index 0000000..c1a0754
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_NUMS384W.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_NUMS384W_H
+#define CONFIG_CURVE_NUMS384W_H
+
+#include"core.h"
+#include"config_field_F384PM.h"
+
+// ECP stuff
+
+#define CURVETYPE_NUMS384W WEIERSTRASS
+#define CURVE_A_NUMS384W -3
+#define PAIRING_FRIENDLY_NUMS384W NOT_PF
+#define CURVE_SECURITY_NUMS384W 192
+#define HTC_ISO_NUMS384W 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_NUMS384W
+
+#if PAIRING_FRIENDLY_NUMS384W != NOT_PF
+
+#define HTC_ISO_G2_NUMS384W 0
+
+#define USE_GLV_NUMS384W   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_NUMS384W /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_NUMS384W /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_NUMS384W 
+#define SIGN_OF_X_NUMS384W 
+
+#define ATE_BITS_NUMS384W 
+#define G2_TABLE_NUMS384W 
+
+#endif
+
+
+#if CURVE_SECURITY_NUMS384W == 128
+#define AESKEY_NUMS384W 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_NUMS384W SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_NUMS384W == 192
+#define AESKEY_NUMS384W 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_NUMS384W SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_NUMS384W == 256
+#define AESKEY_NUMS384W 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_NUMS384W SHA512  /**< Hash type */
+#endif
+
+
+namespace NUMS384W_BIG = B384_29;
+namespace NUMS384W_FP = F384PM;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_NUMS512E.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_NUMS512E.h
new file mode 100644
index 0000000..61bcf89
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_NUMS512E.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_NUMS512E_H
+#define CONFIG_CURVE_NUMS512E_H
+
+#include"core.h"
+#include"config_field_F512PM.h"
+
+// ECP stuff
+
+#define CURVETYPE_NUMS512E EDWARDS
+#define CURVE_A_NUMS512E 1
+#define PAIRING_FRIENDLY_NUMS512E NOT_PF
+#define CURVE_SECURITY_NUMS512E 256
+#define HTC_ISO_NUMS512E 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_NUMS512E
+
+#if PAIRING_FRIENDLY_NUMS512E != NOT_PF
+
+#define HTC_ISO_G2_NUMS512E 0
+
+#define USE_GLV_NUMS512E   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_NUMS512E /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_NUMS512E /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_NUMS512E 
+#define SIGN_OF_X_NUMS512E 
+
+#define ATE_BITS_NUMS512E 
+#define G2_TABLE_NUMS512E 
+
+#endif
+
+
+#if CURVE_SECURITY_NUMS512E == 128
+#define AESKEY_NUMS512E 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_NUMS512E SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_NUMS512E == 192
+#define AESKEY_NUMS512E 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_NUMS512E SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_NUMS512E == 256
+#define AESKEY_NUMS512E 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_NUMS512E SHA512  /**< Hash type */
+#endif
+
+
+namespace NUMS512E_BIG = B512_29;
+namespace NUMS512E_FP = F512PM;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_NUMS512W.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_NUMS512W.h
new file mode 100644
index 0000000..933e1dc
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_NUMS512W.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_NUMS512W_H
+#define CONFIG_CURVE_NUMS512W_H
+
+#include"core.h"
+#include"config_field_F512PM.h"
+
+// ECP stuff
+
+#define CURVETYPE_NUMS512W WEIERSTRASS
+#define CURVE_A_NUMS512W -3
+#define PAIRING_FRIENDLY_NUMS512W NOT_PF
+#define CURVE_SECURITY_NUMS512W 256
+#define HTC_ISO_NUMS512W 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_NUMS512W
+
+#if PAIRING_FRIENDLY_NUMS512W != NOT_PF
+
+#define HTC_ISO_G2_NUMS512W 0
+
+#define USE_GLV_NUMS512W   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_NUMS512W /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_NUMS512W /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_NUMS512W 
+#define SIGN_OF_X_NUMS512W 
+
+#define ATE_BITS_NUMS512W 
+#define G2_TABLE_NUMS512W 
+
+#endif
+
+
+#if CURVE_SECURITY_NUMS512W == 128
+#define AESKEY_NUMS512W 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_NUMS512W SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_NUMS512W == 192
+#define AESKEY_NUMS512W 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_NUMS512W SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_NUMS512W == 256
+#define AESKEY_NUMS512W 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_NUMS512W SHA512  /**< Hash type */
+#endif
+
+
+namespace NUMS512W_BIG = B512_29;
+namespace NUMS512W_FP = F512PM;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_SECP160R1.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_SECP160R1.h
new file mode 100644
index 0000000..e17db6c
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_SECP160R1.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_SECP160R1_H
+#define CONFIG_CURVE_SECP160R1_H
+
+#include"core.h"
+#include"config_field_SECP160R1.h"
+
+// ECP stuff
+
+#define CURVETYPE_SECP160R1 WEIERSTRASS
+#define CURVE_A_SECP160R1 -3
+#define PAIRING_FRIENDLY_SECP160R1 NOT_PF
+#define CURVE_SECURITY_SECP160R1 128
+#define HTC_ISO_SECP160R1 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_SECP160R1
+
+#if PAIRING_FRIENDLY_SECP160R1 != NOT_PF
+
+#define HTC_ISO_G2_SECP160R1 0
+
+#define USE_GLV_SECP160R1   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_SECP160R1 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_SECP160R1 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_SECP160R1 
+#define SIGN_OF_X_SECP160R1 
+
+#define ATE_BITS_SECP160R1 
+#define G2_TABLE_SECP160R1 
+
+#endif
+
+
+#if CURVE_SECURITY_SECP160R1 == 128
+#define AESKEY_SECP160R1 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_SECP160R1 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_SECP160R1 == 192
+#define AESKEY_SECP160R1 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_SECP160R1 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_SECP160R1 == 256
+#define AESKEY_SECP160R1 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_SECP160R1 SHA512  /**< Hash type */
+#endif
+
+
+namespace SECP160R1_BIG = B160_29;
+namespace SECP160R1_FP = SECP160R1;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_SECP256K1.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_SECP256K1.h
new file mode 100644
index 0000000..084032d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_SECP256K1.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_SECP256K1_H
+#define CONFIG_CURVE_SECP256K1_H
+
+#include"core.h"
+#include"config_field_SECP256K1.h"
+
+// ECP stuff
+
+#define CURVETYPE_SECP256K1 WEIERSTRASS
+#define CURVE_A_SECP256K1 0
+#define PAIRING_FRIENDLY_SECP256K1 NOT_PF
+#define CURVE_SECURITY_SECP256K1 128
+#define HTC_ISO_SECP256K1 3
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_SECP256K1
+
+#if PAIRING_FRIENDLY_SECP256K1 != NOT_PF
+
+#define HTC_ISO_G2_SECP256K1 0
+
+#define USE_GLV_SECP256K1   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_SECP256K1 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_SECP256K1 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_SECP256K1 
+#define SIGN_OF_X_SECP256K1 
+
+#define ATE_BITS_SECP256K1 
+#define G2_TABLE_SECP256K1 
+
+#endif
+
+
+#if CURVE_SECURITY_SECP256K1 == 128
+#define AESKEY_SECP256K1 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_SECP256K1 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_SECP256K1 == 192
+#define AESKEY_SECP256K1 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_SECP256K1 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_SECP256K1 == 256
+#define AESKEY_SECP256K1 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_SECP256K1 SHA512  /**< Hash type */
+#endif
+
+
+namespace SECP256K1_BIG = B256_28;
+namespace SECP256K1_FP = SECP256K1;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_SM2.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_SM2.h
new file mode 100644
index 0000000..1f22e7c
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_SM2.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_SM2_H
+#define CONFIG_CURVE_SM2_H
+
+#include"core.h"
+#include"config_field_SM2.h"
+
+// ECP stuff
+
+#define CURVETYPE_SM2 WEIERSTRASS
+#define CURVE_A_SM2 -3
+#define PAIRING_FRIENDLY_SM2 NOT_PF
+#define CURVE_SECURITY_SM2 128
+#define HTC_ISO_SM2 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_SM2
+
+#if PAIRING_FRIENDLY_SM2 != NOT_PF
+
+#define HTC_ISO_G2_SM2 0
+
+#define USE_GLV_SM2   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_SM2 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_SM2 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_SM2 
+#define SIGN_OF_X_SM2 
+
+#define ATE_BITS_SM2 
+#define G2_TABLE_SM2 
+
+#endif
+
+
+#if CURVE_SECURITY_SM2 == 128
+#define AESKEY_SM2 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_SM2 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_SM2 == 192
+#define AESKEY_SM2 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_SM2 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_SM2 == 256
+#define AESKEY_SM2 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_SM2 SHA512  /**< Hash type */
+#endif
+
+
+namespace SM2_BIG = B256_28;
+namespace SM2_FP = SM2;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_TWEEDLEDEE.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_TWEEDLEDEE.h
new file mode 100644
index 0000000..ae6e7db
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_TWEEDLEDEE.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_TWEEDLEDEE_H
+#define CONFIG_CURVE_TWEEDLEDEE_H
+
+#include"core.h"
+#include"config_field_TWEEDLEDEE.h"
+
+// ECP stuff
+
+#define CURVETYPE_TWEEDLEDEE WEIERSTRASS
+#define CURVE_A_TWEEDLEDEE 0
+#define PAIRING_FRIENDLY_TWEEDLEDEE NOT_PF
+#define CURVE_SECURITY_TWEEDLEDEE 128
+#define HTC_ISO_TWEEDLEDEE 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_TWEEDLEDEE
+
+#if PAIRING_FRIENDLY_TWEEDLEDEE != NOT_PF
+
+#define HTC_ISO_G2_TWEEDLEDEE 0
+
+#define USE_GLV_TWEEDLEDEE   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_TWEEDLEDEE /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_TWEEDLEDEE /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_TWEEDLEDEE 
+#define SIGN_OF_X_TWEEDLEDEE 
+
+#define ATE_BITS_TWEEDLEDEE 
+#define G2_TABLE_TWEEDLEDEE 
+
+#endif
+
+
+#if CURVE_SECURITY_TWEEDLEDEE == 128
+#define AESKEY_TWEEDLEDEE 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_TWEEDLEDEE SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_TWEEDLEDEE == 192
+#define AESKEY_TWEEDLEDEE 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_TWEEDLEDEE SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_TWEEDLEDEE == 256
+#define AESKEY_TWEEDLEDEE 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_TWEEDLEDEE SHA512  /**< Hash type */
+#endif
+
+
+namespace TWEEDLEDEE_BIG = B256_29;
+namespace TWEEDLEDEE_FP = TWEEDLEDEE;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_TWEEDLEDUM.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_TWEEDLEDUM.h
new file mode 100644
index 0000000..9b68cee
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_TWEEDLEDUM.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_TWEEDLEDUM_H
+#define CONFIG_CURVE_TWEEDLEDUM_H
+
+#include"core.h"
+#include"config_field_TWEEDLEDUM.h"
+
+// ECP stuff
+
+#define CURVETYPE_TWEEDLEDUM WEIERSTRASS
+#define CURVE_A_TWEEDLEDUM 0
+#define PAIRING_FRIENDLY_TWEEDLEDUM NOT_PF
+#define CURVE_SECURITY_TWEEDLEDUM 128
+#define HTC_ISO_TWEEDLEDUM 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_TWEEDLEDUM
+
+#if PAIRING_FRIENDLY_TWEEDLEDUM != NOT_PF
+
+#define HTC_ISO_G2_TWEEDLEDUM 0
+
+#define USE_GLV_TWEEDLEDUM   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_TWEEDLEDUM /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_TWEEDLEDUM /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_TWEEDLEDUM 
+#define SIGN_OF_X_TWEEDLEDUM 
+
+#define ATE_BITS_TWEEDLEDUM 
+#define G2_TABLE_TWEEDLEDUM 
+
+#endif
+
+
+#if CURVE_SECURITY_TWEEDLEDUM == 128
+#define AESKEY_TWEEDLEDUM 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_TWEEDLEDUM SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_TWEEDLEDUM == 192
+#define AESKEY_TWEEDLEDUM 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_TWEEDLEDUM SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_TWEEDLEDUM == 256
+#define AESKEY_TWEEDLEDUM 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_TWEEDLEDUM SHA512  /**< Hash type */
+#endif
+
+
+namespace TWEEDLEDUM_BIG = B256_29;
+namespace TWEEDLEDUM_FP = TWEEDLEDUM;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_X448.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_X448.h
new file mode 100644
index 0000000..8bd14df
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_curve_X448.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_X448_H
+#define CONFIG_CURVE_X448_H
+
+#include"core.h"
+#include"config_field_F448.h"
+
+// ECP stuff
+
+#define CURVETYPE_X448 MONTGOMERY
+#define CURVE_A_X448 156326
+#define PAIRING_FRIENDLY_X448 NOT_PF
+#define CURVE_SECURITY_X448 256
+#define HTC_ISO_X448 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_X448
+
+#if PAIRING_FRIENDLY_X448 != NOT_PF
+
+#define HTC_ISO_G2_X448 0
+
+#define USE_GLV_X448   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_X448 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_X448 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_X448 
+#define SIGN_OF_X_X448 
+
+#define ATE_BITS_X448 
+#define G2_TABLE_X448 
+
+#endif
+
+
+#if CURVE_SECURITY_X448 == 128
+#define AESKEY_X448 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_X448 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_X448 == 192
+#define AESKEY_X448 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_X448 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_X448 == 256
+#define AESKEY_X448 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_X448 SHA512  /**< Hash type */
+#endif
+
+
+namespace X448_BIG = B448_29;
+namespace X448_FP = F448;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_ff_RSA2048.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_ff_RSA2048.h
new file mode 100644
index 0000000..9e1fbc6
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_ff_RSA2048.h
@@ -0,0 +1,32 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_RSA_RSA2048_H
+#define CONFIG_RSA_RSA2048_H
+
+#include "core.h"
+#include "config_big_B512_29.h"
+
+// FF stuff
+
+#define FFLEN_RSA2048 4 /**< 2^n multiplier of BIGBITS to specify supported Finite Field size, e.g 2048=256*2^3 where BIGBITS=256 */
+
+namespace RSA2048_BIG = B512_29;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_ff_RSA3072.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_ff_RSA3072.h
new file mode 100644
index 0000000..16046b1
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_ff_RSA3072.h
@@ -0,0 +1,32 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_RSA_RSA3072_H
+#define CONFIG_RSA_RSA3072_H
+
+#include "core.h"
+#include "config_big_B384_28.h"
+
+// FF stuff
+
+#define FFLEN_RSA3072 8 /**< 2^n multiplier of BIGBITS to specify supported Finite Field size, e.g 2048=256*2^3 where BIGBITS=256 */
+
+namespace RSA3072_BIG = B384_28;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_ff_RSA4096.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_ff_RSA4096.h
new file mode 100644
index 0000000..3721c86
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_ff_RSA4096.h
@@ -0,0 +1,32 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_RSA_RSA4096_H
+#define CONFIG_RSA_RSA4096_H
+
+#include "core.h"
+#include "config_big_B512_29.h"
+
+// FF stuff
+
+#define FFLEN_RSA4096 8 /**< 2^n multiplier of BIGBITS to specify supported Finite Field size, e.g 2048=256*2^3 where BIGBITS=256 */
+
+namespace RSA4096_BIG = B512_29;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_ANSSI.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_ANSSI.h
new file mode 100644
index 0000000..e76c54d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_ANSSI.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_ANSSI_H
+#define CONFIG_FIELD_ANSSI_H
+
+#include"core.h"
+#include "config_big_B256_28.h"
+
+// FP stuff
+
+#define MBITS_ANSSI 256
+#define PM1D2_ANSSI 1
+#define MODTYPE_ANSSI NOT_SPECIAL
+#define MAXXES_ANSSI 14
+#define QNRI_ANSSI 0
+#define RIADZ_ANSSI -5
+#define RIADZG2A_ANSSI 0
+#define RIADZG2B_ANSSI 0
+#define TOWER_ANSSI NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_ANSSI 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_BLS12381.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_BLS12381.h
new file mode 100644
index 0000000..3f7dfd6
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_BLS12381.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_BLS12381_H
+#define CONFIG_FIELD_BLS12381_H
+
+#include"core.h"
+#include "config_big_B384_29.h"
+
+// FP stuff
+
+#define MBITS_BLS12381 381
+#define PM1D2_BLS12381 1
+#define MODTYPE_BLS12381 NOT_SPECIAL
+#define MAXXES_BLS12381 14
+#define QNRI_BLS12381 0
+#define RIADZ_BLS12381 11
+#define RIADZG2A_BLS12381 -2
+#define RIADZG2B_BLS12381 -1
+#define TOWER_BLS12381 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_BLS12381 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_BLS12383.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_BLS12383.h
new file mode 100644
index 0000000..19e3ed1
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_BLS12383.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_BLS12383_H
+#define CONFIG_FIELD_BLS12383_H
+
+#include"core.h"
+#include "config_big_B384_29.h"
+
+// FP stuff
+
+#define MBITS_BLS12383 383
+#define PM1D2_BLS12383 1
+#define MODTYPE_BLS12383 NOT_SPECIAL
+#define MAXXES_BLS12383 14
+#define QNRI_BLS12383 0
+#define RIADZ_BLS12383 1
+#define RIADZG2A_BLS12383 1
+#define RIADZG2B_BLS12383 0
+#define TOWER_BLS12383 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_BLS12383 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_BLS12443.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_BLS12443.h
new file mode 100644
index 0000000..ec63ad3
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_BLS12443.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_BLS12443_H
+#define CONFIG_FIELD_BLS12443_H
+
+#include"core.h"
+#include "config_big_B448_29.h"
+
+// FP stuff
+
+#define MBITS_BLS12443 443
+#define PM1D2_BLS12443 1
+#define MODTYPE_BLS12443 NOT_SPECIAL
+#define MAXXES_BLS12443 14
+#define QNRI_BLS12443 0
+#define RIADZ_BLS12443 -7
+#define RIADZG2A_BLS12443 1
+#define RIADZG2B_BLS12443 1
+#define TOWER_BLS12443 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_BLS12443 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_BLS12461.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_BLS12461.h
new file mode 100644
index 0000000..36f3c05
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_BLS12461.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_BLS12461_H
+#define CONFIG_FIELD_BLS12461_H
+
+#include"core.h"
+#include "config_big_B464_28.h"
+
+// FP stuff
+
+#define MBITS_BLS12461 461
+#define PM1D2_BLS12461 1
+#define MODTYPE_BLS12461 NOT_SPECIAL
+#define MAXXES_BLS12461 14
+#define QNRI_BLS12461 0
+#define RIADZ_BLS12461 1
+#define RIADZG2A_BLS12461 4
+#define RIADZG2B_BLS12461 0
+#define TOWER_BLS12461 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_BLS12461 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_BLS24479.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_BLS24479.h
new file mode 100644
index 0000000..e57d0e7
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_BLS24479.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_BLS24479_H
+#define CONFIG_FIELD_BLS24479_H
+
+#include"core.h"
+#include "config_big_B480_29.h"
+
+// FP stuff
+
+#define MBITS_BLS24479 479
+#define PM1D2_BLS24479 1
+#define MODTYPE_BLS24479 NOT_SPECIAL
+#define MAXXES_BLS24479 14
+#define QNRI_BLS24479 0
+#define RIADZ_BLS24479 1
+#define RIADZG2A_BLS24479 4
+#define RIADZG2B_BLS24479 0
+#define TOWER_BLS24479 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_BLS24479 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_BLS48286.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_BLS48286.h
new file mode 100644
index 0000000..33feaa8
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_BLS48286.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_BLS48286_H
+#define CONFIG_FIELD_BLS48286_H
+
+#include"core.h"
+#include "config_big_B288_29.h"
+
+// FP stuff
+
+#define MBITS_BLS48286 286
+#define PM1D2_BLS48286 1
+#define MODTYPE_BLS48286 NOT_SPECIAL
+#define MAXXES_BLS48286 4
+#define QNRI_BLS48286 0
+#define RIADZ_BLS48286 1
+#define RIADZG2A_BLS48286 1
+#define RIADZG2B_BLS48286 0
+#define TOWER_BLS48286 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_BLS48286 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_BLS48556.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_BLS48556.h
new file mode 100644
index 0000000..53c821d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_BLS48556.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_BLS48556_H
+#define CONFIG_FIELD_BLS48556_H
+
+#include"core.h"
+#include "config_big_B560_29.h"
+
+// FP stuff
+
+#define MBITS_BLS48556 556
+#define PM1D2_BLS48556 1
+#define MODTYPE_BLS48556 NOT_SPECIAL
+#define MAXXES_BLS48556 14
+#define QNRI_BLS48556 0
+#define RIADZ_BLS48556 -1
+#define RIADZG2A_BLS48556 2
+#define RIADZG2B_BLS48556 0
+#define TOWER_BLS48556 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_BLS48556 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_BLS48581.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_BLS48581.h
new file mode 100644
index 0000000..aa2180b
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_BLS48581.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_BLS48581_H
+#define CONFIG_FIELD_BLS48581_H
+
+#include"core.h"
+#include "config_big_B584_29.h"
+
+// FP stuff
+
+#define MBITS_BLS48581 581
+#define PM1D2_BLS48581 1
+#define MODTYPE_BLS48581 NOT_SPECIAL
+#define MAXXES_BLS48581 14
+#define QNRI_BLS48581 0
+#define RIADZ_BLS48581 2
+#define RIADZG2A_BLS48581 2
+#define RIADZG2B_BLS48581 0
+#define TOWER_BLS48581 POSITOWER
+
+//#define BIG_ENDIAN_SIGN_BLS48581 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_BN158.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_BN158.h
new file mode 100644
index 0000000..ed4f9a1
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_BN158.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_BN158_H
+#define CONFIG_FIELD_BN158_H
+
+#include"core.h"
+#include "config_big_B160_28.h"
+
+// FP stuff
+
+#define MBITS_BN158 158
+#define PM1D2_BN158 1
+#define MODTYPE_BN158 NOT_SPECIAL
+#define MAXXES_BN158 10
+#define QNRI_BN158 0
+#define RIADZ_BN158 1
+#define RIADZG2A_BN158 1
+#define RIADZG2B_BN158 0
+#define TOWER_BN158 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_BN158 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_BN254.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_BN254.h
new file mode 100644
index 0000000..59590ea
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_BN254.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_BN254_H
+#define CONFIG_FIELD_BN254_H
+
+#include"core.h"
+#include "config_big_B256_28.h"
+
+// FP stuff
+
+#define MBITS_BN254 254
+#define PM1D2_BN254 1
+#define MODTYPE_BN254 NOT_SPECIAL
+#define MAXXES_BN254 14
+#define QNRI_BN254 0
+#define RIADZ_BN254 -1
+#define RIADZG2A_BN254 -1
+#define RIADZG2B_BN254 0
+#define TOWER_BN254 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_BN254 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_BN254CX.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_BN254CX.h
new file mode 100644
index 0000000..df51a97
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_BN254CX.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_BN254CX_H
+#define CONFIG_FIELD_BN254CX_H
+
+#include"core.h"
+#include "config_big_B256_28.h"
+
+// FP stuff
+
+#define MBITS_BN254CX 254
+#define PM1D2_BN254CX 1
+#define MODTYPE_BN254CX NOT_SPECIAL
+#define MAXXES_BN254CX 14
+#define QNRI_BN254CX 0
+#define RIADZ_BN254CX -1
+#define RIADZG2A_BN254CX -1
+#define RIADZG2B_BN254CX 0
+#define TOWER_BN254CX NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_BN254CX 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_BN462.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_BN462.h
new file mode 100644
index 0000000..bbf0205
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_BN462.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_BN462_H
+#define CONFIG_FIELD_BN462_H
+
+#include"core.h"
+#include "config_big_B464_28.h"
+
+// FP stuff
+
+#define MBITS_BN462 462
+#define PM1D2_BN462 1
+#define MODTYPE_BN462 NOT_SPECIAL
+#define MAXXES_BN462 14
+#define QNRI_BN462 1
+#define RIADZ_BN462 1
+#define RIADZG2A_BN462 1
+#define RIADZG2B_BN462 0
+#define TOWER_BN462 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_BN462 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_BRAINPOOL.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_BRAINPOOL.h
new file mode 100644
index 0000000..47e67aa
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_BRAINPOOL.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_BRAINPOOL_H
+#define CONFIG_FIELD_BRAINPOOL_H
+
+#include"core.h"
+#include "config_big_B256_28.h"
+
+// FP stuff
+
+#define MBITS_BRAINPOOL 256
+#define PM1D2_BRAINPOOL 1
+#define MODTYPE_BRAINPOOL NOT_SPECIAL
+#define MAXXES_BRAINPOOL 14
+#define QNRI_BRAINPOOL 0
+#define RIADZ_BRAINPOOL -3
+#define RIADZG2A_BRAINPOOL 0
+#define RIADZG2B_BRAINPOOL 0
+#define TOWER_BRAINPOOL NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_BRAINPOOL 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_C1174.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_C1174.h
new file mode 100644
index 0000000..3c75a2c
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_C1174.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_C1174_H
+#define CONFIG_FIELD_C1174_H
+
+#include"core.h"
+#include "config_big_B256_29.h"
+
+// FP stuff
+
+#define MBITS_C1174 251
+#define PM1D2_C1174 1
+#define MODTYPE_C1174 PSEUDO_MERSENNE
+#define MAXXES_C1174 10
+#define QNRI_C1174 0
+#define RIADZ_C1174 0
+#define RIADZG2A_C1174 0
+#define RIADZG2B_C1174 0
+#define TOWER_C1174 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_C1174 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_C1665.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_C1665.h
new file mode 100644
index 0000000..ca75eb3
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_C1665.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_C1665_H
+#define CONFIG_FIELD_C1665_H
+
+#include"core.h"
+#include "config_big_B168_29.h"
+
+// FP stuff
+
+#define MBITS_C1665 166
+#define PM1D2_C1665 1
+#define MODTYPE_C1665 PSEUDO_MERSENNE
+#define MAXXES_C1665 8
+#define QNRI_C1665 0
+#define RIADZ_C1665 0
+#define RIADZG2A_C1665 0
+#define RIADZG2B_C1665 0
+#define TOWER_C1665 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_C1665 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_C41417.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_C41417.h
new file mode 100644
index 0000000..0a2c919
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_C41417.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_C41417_H
+#define CONFIG_FIELD_C41417_H
+
+#include"core.h"
+#include "config_big_B416_29.h"
+
+// FP stuff
+
+#define MBITS_C41417 414
+#define PM1D2_C41417 1
+#define MODTYPE_C41417 PSEUDO_MERSENNE
+#define MAXXES_C41417 14
+#define QNRI_C41417 0
+#define RIADZ_C41417 1
+#define RIADZG2A_C41417 0
+#define RIADZG2B_C41417 0
+#define TOWER_C41417 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_C41417 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_F25519.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_F25519.h
new file mode 100644
index 0000000..5e08553
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_F25519.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_F25519_H
+#define CONFIG_FIELD_F25519_H
+
+#include"core.h"
+#include "config_big_B256_29.h"
+
+// FP stuff
+
+#define MBITS_F25519 255
+#define PM1D2_F25519 2
+#define MODTYPE_F25519 PSEUDO_MERSENNE
+#define MAXXES_F25519 6
+#define QNRI_F25519 0
+#define RIADZ_F25519 2
+#define RIADZG2A_F25519 0
+#define RIADZG2B_F25519 0
+#define TOWER_F25519 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_F25519 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_F256PME.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_F256PME.h
new file mode 100644
index 0000000..4abb636
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_F256PME.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_F256PME_H
+#define CONFIG_FIELD_F256PME_H
+
+#include"core.h"
+#include "config_big_B256_29.h"
+
+// FP stuff
+
+#define MBITS_F256PME 256
+#define PM1D2_F256PME 1
+#define MODTYPE_F256PME PSEUDO_MERSENNE
+#define MAXXES_F256PME 5
+#define QNRI_F256PME 0
+#define RIADZ_F256PME 0
+#define RIADZG2A_F256PME 0
+#define RIADZG2B_F256PME 0
+#define TOWER_F256PME NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_F256PME 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_F256PMW.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_F256PMW.h
new file mode 100644
index 0000000..59e0dcb
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_F256PMW.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_F256PMW_H
+#define CONFIG_FIELD_F256PMW_H
+
+#include"core.h"
+#include "config_big_B256_28.h"
+
+// FP stuff
+
+#define MBITS_F256PMW 256
+#define PM1D2_F256PMW 1
+#define MODTYPE_F256PMW PSEUDO_MERSENNE
+#define MAXXES_F256PMW 14
+#define QNRI_F256PMW 0
+#define RIADZ_F256PMW 7
+#define RIADZG2A_F256PMW 0
+#define RIADZG2B_F256PMW 0
+#define TOWER_F256PMW NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_F256PMW 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_F384PM.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_F384PM.h
new file mode 100644
index 0000000..002e147
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_F384PM.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_F384PM_H
+#define CONFIG_FIELD_F384PM_H
+
+#include"core.h"
+#include "config_big_B384_29.h"
+
+// FP stuff
+
+#define MBITS_F384PM 384
+#define PM1D2_F384PM 1
+#define MODTYPE_F384PM PSEUDO_MERSENNE
+#define MAXXES_F384PM 14
+#define QNRI_F384PM 0
+#define RIADZ_F384PM 0
+#define RIADZG2A_F384PM 0
+#define RIADZG2B_F384PM 0
+#define TOWER_F384PM NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_F384PM 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_F448.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_F448.h
new file mode 100644
index 0000000..2ad5853
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_F448.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_F448_H
+#define CONFIG_FIELD_F448_H
+
+#include"core.h"
+#include "config_big_B448_29.h"
+
+// FP stuff
+
+#define MBITS_F448 448
+#define PM1D2_F448 1
+#define MODTYPE_F448 GENERALISED_MERSENNE
+#define MAXXES_F448 14
+#define QNRI_F448 0
+#define RIADZ_F448 0
+#define RIADZG2A_F448 0
+#define RIADZG2B_F448 0
+#define TOWER_F448 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_F448 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_F512PM.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_F512PM.h
new file mode 100644
index 0000000..1fb105c
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_F512PM.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_F512PM_H
+#define CONFIG_FIELD_F512PM_H
+
+#include"core.h"
+#include "config_big_B512_29.h"
+
+// FP stuff
+
+#define MBITS_F512PM 512
+#define PM1D2_F512PM 1
+#define MODTYPE_F512PM PSEUDO_MERSENNE
+#define MAXXES_F512PM 10
+#define QNRI_F512PM 0
+#define RIADZ_F512PM 0
+#define RIADZG2A_F512PM 0
+#define RIADZG2B_F512PM 0
+#define TOWER_F512PM NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_F512PM 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_FP256BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_FP256BN.h
new file mode 100644
index 0000000..1db791d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_FP256BN.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_FP256BN_H
+#define CONFIG_FIELD_FP256BN_H
+
+#include"core.h"
+#include "config_big_B256_28.h"
+
+// FP stuff
+
+#define MBITS_FP256BN 256
+#define PM1D2_FP256BN 1
+#define MODTYPE_FP256BN NOT_SPECIAL
+#define MAXXES_FP256BN 14
+#define QNRI_FP256BN 0
+#define RIADZ_FP256BN 1
+#define RIADZG2A_FP256BN 1
+#define RIADZG2B_FP256BN 0
+#define TOWER_FP256BN NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_FP256BN 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_FP512BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_FP512BN.h
new file mode 100644
index 0000000..be493ad
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_FP512BN.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_FP512BN_H
+#define CONFIG_FIELD_FP512BN_H
+
+#include"core.h"
+#include "config_big_B512_29.h"
+
+// FP stuff
+
+#define MBITS_FP512BN 512
+#define PM1D2_FP512BN 1
+#define MODTYPE_FP512BN NOT_SPECIAL
+#define MAXXES_FP512BN 10
+#define QNRI_FP512BN 0
+#define RIADZ_FP512BN 1
+#define RIADZG2A_FP512BN 1
+#define RIADZG2B_FP512BN 0
+#define TOWER_FP512BN NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_FP512BN 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_HIFIVE.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_HIFIVE.h
new file mode 100644
index 0000000..cdc667c
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_HIFIVE.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_HIFIVE_H
+#define CONFIG_FIELD_HIFIVE_H
+
+#include"core.h"
+#include "config_big_B336_29.h"
+
+// FP stuff
+
+#define MBITS_HIFIVE 336
+#define PM1D2_HIFIVE 2
+#define MODTYPE_HIFIVE PSEUDO_MERSENNE
+#define MAXXES_HIFIVE 12
+#define QNRI_HIFIVE 0
+#define RIADZ_HIFIVE 1
+#define RIADZG2A_HIFIVE 0
+#define RIADZG2B_HIFIVE 0
+#define TOWER_HIFIVE NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_HIFIVE 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_JUBJUB.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_JUBJUB.h
new file mode 100644
index 0000000..a5d97c4
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_JUBJUB.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_JUBJUB_H
+#define CONFIG_FIELD_JUBJUB_H
+
+#include"core.h"
+#include "config_big_B256_29.h"
+
+// FP stuff
+
+#define MBITS_JUBJUB 255
+#define PM1D2_JUBJUB 32
+#define MODTYPE_JUBJUB NOT_SPECIAL
+#define MAXXES_JUBJUB 6
+#define QNRI_JUBJUB 5
+#define RIADZ_JUBJUB 1
+#define RIADZG2A_JUBJUB 0
+#define RIADZG2B_JUBJUB 0
+#define TOWER_JUBJUB NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_JUBJUB 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_MDC.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_MDC.h
new file mode 100644
index 0000000..d3bb4a9
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_MDC.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_MDC_H
+#define CONFIG_FIELD_MDC_H
+
+#include"core.h"
+#include "config_big_B256_28.h"
+
+// FP stuff
+
+#define MBITS_MDC 256
+#define PM1D2_MDC 1
+#define MODTYPE_MDC NOT_SPECIAL
+#define MAXXES_MDC 14
+#define QNRI_MDC 0
+#define RIADZ_MDC 0
+#define RIADZG2A_MDC 0
+#define RIADZG2B_MDC 0
+#define TOWER_MDC NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_MDC 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_NIST256.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_NIST256.h
new file mode 100644
index 0000000..468cb06
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_NIST256.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_NIST256_H
+#define CONFIG_FIELD_NIST256_H
+
+#include"core.h"
+#include "config_big_B256_28.h"
+
+// FP stuff
+
+#define MBITS_NIST256 256
+#define PM1D2_NIST256 1
+#define MODTYPE_NIST256 NOT_SPECIAL
+#define MAXXES_NIST256 14
+#define QNRI_NIST256 0
+#define RIADZ_NIST256 -10
+#define RIADZG2A_NIST256 0
+#define RIADZG2B_NIST256 0
+#define TOWER_NIST256 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_NIST256 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_NIST384.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_NIST384.h
new file mode 100644
index 0000000..9250158
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_NIST384.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_NIST384_H
+#define CONFIG_FIELD_NIST384_H
+
+#include"core.h"
+#include "config_big_B384_29.h"
+
+// FP stuff
+
+#define MBITS_NIST384 384
+#define PM1D2_NIST384 1
+#define MODTYPE_NIST384 NOT_SPECIAL
+#define MAXXES_NIST384 14
+#define QNRI_NIST384 0
+#define RIADZ_NIST384 -12
+#define RIADZG2A_NIST384 0
+#define RIADZG2B_NIST384 0
+#define TOWER_NIST384 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_NIST384 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_NIST521.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_NIST521.h
new file mode 100644
index 0000000..7831354
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_NIST521.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_NIST521_H
+#define CONFIG_FIELD_NIST521_H
+
+#include"core.h"
+#include "config_big_B528_28.h"
+
+// FP stuff
+
+#define MBITS_NIST521 521
+#define PM1D2_NIST521 1
+#define MODTYPE_NIST521 PSEUDO_MERSENNE
+#define MAXXES_NIST521 11
+#define QNRI_NIST521 0
+#define RIADZ_NIST521 -4
+#define RIADZG2A_NIST521 0
+#define RIADZG2B_NIST521 0
+#define TOWER_NIST521 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_NIST521 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_SECP160R1.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_SECP160R1.h
new file mode 100644
index 0000000..953b715
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_SECP160R1.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_SECP160R1_H
+#define CONFIG_FIELD_SECP160R1_H
+
+#include"core.h"
+#include "config_big_B160_29.h"
+
+// FP stuff
+
+#define MBITS_SECP160R1 160
+#define PM1D2_SECP160R1 1
+#define MODTYPE_SECP160R1 NOT_SPECIAL
+#define MAXXES_SECP160R1 14
+#define QNRI_SECP160R1 0
+#define RIADZ_SECP160R1 3
+#define RIADZG2A_SECP160R1 0
+#define RIADZG2B_SECP160R1 0
+#define TOWER_SECP160R1 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_SECP160R1 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_SECP256K1.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_SECP256K1.h
new file mode 100644
index 0000000..b28edfc
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_SECP256K1.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_SECP256K1_H
+#define CONFIG_FIELD_SECP256K1_H
+
+#include"core.h"
+#include "config_big_B256_28.h"
+
+// FP stuff
+
+#define MBITS_SECP256K1 256
+#define PM1D2_SECP256K1 1
+#define MODTYPE_SECP256K1 NOT_SPECIAL
+#define MAXXES_SECP256K1 14
+#define QNRI_SECP256K1 0
+#define RIADZ_SECP256K1 -11
+#define RIADZG2A_SECP256K1 0
+#define RIADZG2B_SECP256K1 0
+#define TOWER_SECP256K1 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_SECP256K1 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_SM2.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_SM2.h
new file mode 100644
index 0000000..dfb0a04
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_SM2.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_SM2_H
+#define CONFIG_FIELD_SM2_H
+
+#include"core.h"
+#include "config_big_B256_28.h"
+
+// FP stuff
+
+#define MBITS_SM2 256
+#define PM1D2_SM2 1
+#define MODTYPE_SM2 NOT_SPECIAL
+#define MAXXES_SM2 14
+#define QNRI_SM2 0
+#define RIADZ_SM2 -9
+#define RIADZG2A_SM2 0
+#define RIADZG2B_SM2 0
+#define TOWER_SM2 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_SM2 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_TWEEDLEDEE.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_TWEEDLEDEE.h
new file mode 100644
index 0000000..b94d396
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_TWEEDLEDEE.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_TWEEDLEDEE_H
+#define CONFIG_FIELD_TWEEDLEDEE_H
+
+#include"core.h"
+#include "config_big_B256_29.h"
+
+// FP stuff
+
+#define MBITS_TWEEDLEDEE 255
+#define PM1D2_TWEEDLEDEE 34
+#define MODTYPE_TWEEDLEDEE NOT_SPECIAL
+#define MAXXES_TWEEDLEDEE 6
+#define QNRI_TWEEDLEDEE 5
+#define RIADZ_TWEEDLEDEE 1
+#define RIADZG2A_TWEEDLEDEE 0
+#define RIADZG2B_TWEEDLEDEE 0
+#define TOWER_TWEEDLEDEE NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_TWEEDLEDEE 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_TWEEDLEDUM.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_TWEEDLEDUM.h
new file mode 100644
index 0000000..737191b
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/config_field_TWEEDLEDUM.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_TWEEDLEDUM_H
+#define CONFIG_FIELD_TWEEDLEDUM_H
+
+#include"core.h"
+#include "config_big_B256_29.h"
+
+// FP stuff
+
+#define MBITS_TWEEDLEDUM 255
+#define PM1D2_TWEEDLEDUM 33
+#define MODTYPE_TWEEDLEDUM NOT_SPECIAL
+#define MAXXES_TWEEDLEDUM 6
+#define QNRI_TWEEDLEDUM 5
+#define RIADZ_TWEEDLEDUM 1
+#define RIADZG2A_TWEEDLEDUM 0
+#define RIADZG2B_TWEEDLEDUM 0
+#define TOWER_TWEEDLEDUM NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_TWEEDLEDUM 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/core.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/core.h
new file mode 100644
index 0000000..a829258
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/core.h
@@ -0,0 +1,860 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CORE_H
+#define CORE_H
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <stdbool.h>
+#include <stdint.h>
+#include "arch.h"
+
+namespace core {
+
+//#define CORE_ARDUINO
+
+/* modulus types */
+
+#define NOT_SPECIAL 0	       /**< Modulus of no exploitable form */
+#define PSEUDO_MERSENNE 1      /**< Pseudo-mersenne modulus of form $2^n-c$  */
+#define MONTGOMERY_FRIENDLY 3  /**< Montgomery Friendly modulus of form $2^a(2^b-c)-1$  */
+#define GENERALISED_MERSENNE 2 /**< Generalised-mersenne modulus of form $2^n-2^m-1$, Ed448 only */
+
+/* Curve types */
+
+#define WEIERSTRASS 0 /**< Short Weierstrass form curve  */
+#define EDWARDS 1     /**< Edwards or Twisted Edwards curve  */
+#define MONTGOMERY 2  /**< Montgomery form curve  */
+
+/* Pairing-Friendly types */
+
+#define NOT_PF 0
+#define BN_CURVE 1
+#define BLS12_CURVE 2
+#define BLS24_CURVE 3
+#define BLS48_CURVE 4
+
+#define D_TYPE 0
+#define M_TYPE 1
+
+#define FP_ZILCH 0			// 0
+#define FP_UNITY 1			// 1
+#define FP_SPARSEST 2		// [[AB][c0][00]]
+#define FP_SPARSER 3		// [[AB][C0][00]]
+#define FP_SPARSE 4			// [[AB][CD][E0]]
+#define FP_DENSE 5			// [[AB][CD][EF]]
+
+#define NEGATOWER 0			// Extension field tower type
+#define POSITOWER 1
+
+/**
+ * @brief SHA256 hash function instance */
+typedef struct
+{
+    unsign32 length[2]; /**< 64-bit input length */
+    unsign32 h[8];      /**< Internal state */
+    unsign32 w[64];	/**< Internal state */
+    int hlen;		/**< Hash length in bytes */
+} hash256;
+
+/**
+ * @brief SHA384-512 hash function instance */
+typedef struct
+{
+    unsign64 length[2]; /**< 64-bit input length */
+    unsign64 h[8];      /**< Internal state */
+    unsign64 w[80];	/**< Internal state */
+    int hlen;           /**< Hash length in bytes */
+} hash512;
+
+/**
+ * @brief SHA384 hash function instance */
+typedef hash512 hash384;
+
+/**
+ * @brief SHA3 hash function instance */
+typedef struct {
+    int length;
+    unsign64 S[25];
+    int rate, len;
+} sha3;
+
+#define MC_SHA2 2
+#define MC_SHA3 3
+
+#define SHA256 32 /**< SHA-256 hashing */
+#define SHA384 48 /**< SHA-384 hashing */
+#define SHA512 64 /**< SHA-512 hashing */
+
+#define SHA3_HASH224 28 /**< SHA3 224 bit hash */
+#define SHA3_HASH256 32 /**< SHA3 256 bit hash */
+#define SHA3_HASH384 48 /**< SHA3 384 bit hash */
+#define SHA3_HASH512 64 /**< SHA3 512 bit hash */
+
+#define SHAKE128 16 /**< SHAKE128   hash */
+#define SHAKE256 32 /**< SHAKE256   hash */
+
+/* Symmetric Encryption AES structure */
+
+#define ECB   0  /**< Electronic Code Book */
+#define CBC   1  /**< Cipher Block Chaining */
+#define CFB1  2  /**< Cipher Feedback - 1 byte */
+#define CFB2  3  /**< Cipher Feedback - 2 bytes */
+#define CFB4  5  /**< Cipher Feedback - 4 bytes */
+#define OFB1  14 /**< Output Feedback - 1 byte */
+#define OFB2  15 /**< Output Feedback - 2 bytes */
+#define OFB4  17 /**< Output Feedback - 4 bytes */
+#define OFB8  21 /**< Output Feedback - 8 bytes */
+#define OFB16 29 /**< Output Feedback - 16 bytes */
+#define CTR1  30 /**< Counter Mode - 1 byte */
+#define CTR2  31 /**< Counter Mode - 2 bytes */
+#define CTR4  33 /**< Counter Mode - 4 bytes */
+#define CTR8  37 /**< Counter Mode - 8 bytes */
+#define CTR16 45 /**< Counter Mode - 16 bytes */
+
+#define uchar unsigned char  /**<  Unsigned char */
+
+/**
+	@brief AES instance
+*/
+
+
+typedef struct
+{
+    int Nk;            /**< AES Key Length */
+    int Nr;            /**< AES Number of rounds */
+    int mode;          /**< AES mode of operation */
+    unsign32 fkey[60]; /**< subkeys for encrypton */
+    unsign32 rkey[60]; /**< subkeys for decrypton */
+    char f[16];        /**< buffer for chaining vector */
+} aes;
+
+/* AES-GCM suppport.  */
+
+#define GCM_ACCEPTING_HEADER 0   /**< GCM status */
+#define GCM_ACCEPTING_CIPHER 1   /**< GCM status */
+#define GCM_NOT_ACCEPTING_MORE 2 /**< GCM status */
+#define GCM_FINISHED 3           /**< GCM status */
+#define GCM_ENCRYPTING 0         /**< GCM mode */
+#define GCM_DECRYPTING 1         /**< GCM mode */
+
+
+/**
+	@brief GCM mode instance, using AES internally
+*/
+
+typedef struct
+{
+    unsign32 table[128][4]; /**< 2k byte table */
+    uchar stateX[16];	    /**< GCM Internal State */
+    uchar Y_0[16];	    /**< GCM Internal State */
+    unsign32 lenA[2];	    /**< GCM 64-bit length of header */
+    unsign32 lenC[2];	    /**< GCM 64-bit length of ciphertext */
+    int status;		    /**< GCM Status */
+    aes a;		    /**< Internal Instance of aes cipher */
+} gcm;
+
+/* Marsaglia & Zaman Random number generator constants */
+
+#define NK   21 /**< PRNG constant */
+#define NJ   6  /**< PRNG constant */
+#define NV   8  /**< PRNG constant */
+
+
+/**
+	@brief Cryptographically secure pseudo-random number generator instance
+*/
+
+typedef struct
+{
+    unsign32 ira[NK]; /**< random number array   */
+    int      rndptr;  /**< pointer into array */
+    unsign32 borrow;  /**<  borrow as a result of subtraction */
+    int pool_ptr;     /**< pointer into random pool */
+    char pool[32];    /**< random pool */
+} csprng;
+
+
+/**
+	@brief Portable representation of a big positive number
+*/
+
+typedef struct
+{
+    int len;   /**< length in bytes  */
+    int max;   /**< max length allowed - enforce truncation  */
+    char *val; /**< byte array  */
+} octet;
+
+/**
+ * @brief Share instance */
+typedef struct
+{
+    int id;  /**< Unique Share ID */
+    int nsr; /**< number of shares required */
+    octet *B; /**< share as octet */
+} share;
+
+/* Octet string handlers */
+/**	@brief Formats and outputs an octet to the console in hex
+ *
+	@param O Octet to be output
+ */
+extern void OCT_output(octet *O);
+/**	@brief Formats and outputs an octet to the console as a character string
+ *
+	@param O Octet to be output
+ */
+extern void OCT_output_string(octet *O);
+/**	@brief Wipe clean an octet
+ *
+	@param O Octet to be cleaned
+ */
+extern void OCT_clear(octet *O);
+
+/**	@brief Reverse bytes in an octet
+ *
+	@param O Octet to be reversed
+ */
+extern void OCT_reverse(octet *O);
+
+/**	@brief Compare two octets
+ *
+	@param O first Octet to be compared
+	@param P second Octet to be compared
+	@return 1 if equal, else 0
+ */
+extern int  OCT_comp(octet *O, octet *P);
+
+
+/**	@brief Compare first n bytes of two octets
+ *
+	@param O first Octet to be compared
+	@param P second Octet to be compared
+	@param n number of bytes to compare
+	@return 1 if equal, else 0
+ */
+extern int  OCT_ncomp(octet *O, octet *P, int n);
+/**	@brief Join from a C string to end of an octet
+ *
+	Truncates if there is no room
+	@param O Octet to be written to
+	@param s zero terminated string to be joined to octet
+ */
+extern void OCT_jstring(octet *O, char *s);
+/**	@brief Join bytes to end of an octet
+ *
+	Truncates if there is no room
+	@param O Octet to be written to
+	@param s bytes to be joined to end of octet
+	@param n number of bytes to join
+ */
+extern void OCT_jbytes(octet *O, char *s, int n);
+/**	@brief Join single byte to end of an octet, repeated n times
+ *
+	Truncates if there is no room
+	@param O Octet to be written to
+	@param b byte to be joined to end of octet
+	@param n number of times b is to be joined
+ */
+extern void OCT_jbyte(octet *O, int b, int n);
+/**	@brief Join one octet to the end of another
+ *
+	Truncates if there is no room
+	@param O Octet to be written to
+	@param P Octet to be joined to the end of O
+ */
+extern void OCT_joctet(octet *O, octet *P);
+/**	@brief XOR common bytes of a pair of Octets
+ *
+	@param O Octet - on exit = O xor P
+	@param P Octet to be xored into O
+ */
+extern void OCT_xor(octet *O, octet *P);
+/**	@brief reset Octet to zero length
+ *
+	@param O Octet to be emptied
+ */
+extern void OCT_empty(octet *O);
+/**	@brief Pad out an Octet to the given length
+ *
+	Padding is done by inserting leading zeros, so abcd becomes 00abcd
+	@param O Octet to be padded
+	@param n new length of Octet
+ */
+extern int OCT_pad(octet *O, int n);
+/**	@brief Convert an Octet to printable base64 number
+ *
+	@param b zero terminated byte array to take base64 conversion
+	@param O Octet to be converted
+ */
+extern void OCT_tobase64(char *b, octet *O);
+/**	@brief Populate an Octet from base64 number
+ *
+ 	@param O Octet to be populated
+	@param b zero terminated base64 string
+
+ */
+extern void OCT_frombase64(octet *O, char *b);
+/**	@brief Copy one Octet into another
+ *
+ 	@param O Octet to be copied to
+	@param P Octet to be copied from
+
+ */
+extern void OCT_copy(octet *O, octet *P);
+/**	@brief XOR every byte of an octet with input m
+ *
+ 	@param O Octet
+	@param m byte to be XORed with every byte of O
+
+ */
+extern void OCT_xorbyte(octet *O, int m);
+/**	@brief Chops Octet into two, leaving first n bytes in O, moving the rest to P
+ *
+ 	@param O Octet to be chopped
+	@param P new Octet to be created
+	@param n number of bytes to chop off O
+
+ */
+extern void OCT_chop(octet *O, octet *P, int n);
+/**	@brief Join n bytes of integer m to end of Octet O (big endian)
+ *
+	Typically n is 4 for a 32-bit integer
+ 	@param O Octet to be appended to
+	@param m integer to be appended to O
+	@param n number of bytes in m
+
+ */
+extern void OCT_jint(octet *O, unsigned int m, int n);
+/**	@brief Create an Octet from bytes taken from a random number generator
+ *
+	Truncates if there is no room
+ 	@param O Octet to be populated
+	@param R an instance of a Cryptographically Secure Random Number Generator
+	@param n number of bytes to extracted from R
+
+ */
+extern void OCT_rand(octet *O, csprng *R, int n);
+/**	@brief Shifts Octet left by n bytes
+ *
+	Leftmost bytes disappear
+ 	@param O Octet to be shifted
+	@param n number of bytes to shift
+
+ */
+extern void OCT_shl(octet *O, int n);
+/**	@brief Convert a hex number to an Octet
+ *
+	@param dst Octet
+	@param src Hex string to be converted
+ */
+extern void OCT_fromHex(octet *dst, char *src);
+/**	@brief Convert an Octet to printable hex number
+ *
+	@param dst hex value
+	@param src Octet to be converted
+ */
+extern void OCT_toHex(octet *src, char *dst);
+/**	@brief Convert an Octet to string
+ *
+	@param dst string value
+	@param src Octet to be converted
+ */
+extern void OCT_toStr(octet *src, char *dst);
+
+
+
+/* Hash function */
+/**	@brief Initialise an instance of SHA256
+ *
+	@param H an instance SHA256
+ */
+extern void HASH256_init(hash256 *H);
+/**	@brief Add a byte to the hash
+ *
+	@param H an instance SHA256
+	@param b byte to be included in hash
+ */
+extern void HASH256_process(hash256 *H, int b);
+/**	@brief Generate 32-byte final hash
+ *
+	@param H an instance SHA256
+	@param h is the output 32-byte hash
+ */
+extern void HASH256_hash(hash256 *H, char *h);
+
+/**	@brief Generate 32-byte intermediate hash
+ *
+	@param H an instance SHA256
+	@param h is the output 32-byte hash
+ */
+extern void HASH256_continuing_hash(hash256 *H, char *h);
+
+/**	@brief Initialise an instance of SHA384
+ *
+	@param H an instance SHA384
+ */
+extern void HASH384_init(hash384 *H);
+/**	@brief Add a byte to the hash
+ *
+	@param H an instance SHA384
+	@param b byte to be included in hash
+ */
+extern void HASH384_process(hash384 *H, int b);
+/**	@brief Generate 48-byte final hash
+ *
+	@param H an instance SHA384
+	@param h is the output 48-byte hash
+ */
+extern void HASH384_hash(hash384 *H, char *h);
+
+/**	@brief Generate 48-byte intermediate hash
+ *
+	@param H an instance SHA384
+	@param h is the output 48-byte hash
+ */
+extern void HASH384_continuing_hash(hash384 *H, char *h);
+
+/**	@brief Initialise an instance of SHA512
+ *
+	@param H an instance SHA512
+ */
+extern void HASH512_init(hash512 *H);
+/**	@brief Add a byte to the hash
+ *
+	@param H an instance SHA512
+	@param b byte to be included in hash
+ */
+extern void HASH512_process(hash512 *H, int b);
+/**	@brief Generate 64-byte final hash
+ *
+	@param H an instance SHA512
+	@param h is the output 64-byte hash
+ */
+extern void HASH512_hash(hash512 *H, char *h);
+
+/**	@brief Generate 64-byte intermediate hash
+ *
+	@param H an instance SHA512
+	@param h is the output 64-byte hash
+ */
+extern void HASH512_continuing_hash(hash512 *H, char *h);
+
+/**	@brief Initialise an instance of SHA3
+ *
+	@param H an instance SHA3
+	@param t the instance type
+ */
+extern void  SHA3_init(sha3 *H, int t);
+/**	@brief process a byte for SHA3
+ *
+	@param H an instance SHA3
+	@param b a byte of date to be processed
+ */
+extern void  SHA3_process(sha3 *H, int b);
+/**	@brief create fixed length final hash output of SHA3
+ *
+	@param H an instance SHA3
+	@param h a byte array to take hash
+ */
+extern void  SHA3_hash(sha3 *H, char *h);
+
+/**	@brief create fixed length intermediate hash output of SHA3
+ *
+	@param H an instance SHA3
+	@param h a byte array to take hash
+ */
+extern void  SHA3_continuing_hash(sha3 *H, char *h);
+
+/**	@brief create variable length final hash output of SHA3
+ *
+	@param H an instance SHA3
+	@param h a byte array to take hash
+	@param len is the length of the hash
+ */
+extern void  SHA3_shake(sha3 *H, char *h, int len);
+
+/**	@brief create variable length intermediate hash output of SHA3
+ *
+	@param H an instance SHA3
+	@param h a byte array to take hash
+	@param len is the length of the hash
+ */
+extern void  SHA3_continuing_shake(sha3 *H, char *h, int len);
+
+/**	@brief generate further hash output of SHA3
+ *
+	@param H an instance SHA3
+	@param h a byte array to take hash
+	@param len is the length of the hash
+ */
+extern void  SHA3_squeeze(sha3 *H, char *h, int len);
+
+/* MAC functions */
+
+/**	@brief General Purpose Hashing function
+ *
+    @param hash the hash family (SHA2 or SHA3)
+	@param hlen the hash function output length (32,48 or 64)
+	@param w an output octet
+    @param olen the output length
+    @param pad zero padding
+    @param p an input octet
+    @param n an input 32-bit integer
+    @param x an optional input octet
+ */
+extern void GPhash(int hash,int hlen,octet *w,int olen,int pad,octet *p,int n,octet *x);
+
+/**	@brief Simple purpose Hashing function
+ *
+    @param hash the hash family (SHA2 or SHA3)
+	@param hlen the hash function output length (32,48 or 64)
+	@param w an output octet
+    @param p an input octet
+ */
+extern void SPhash(int hash, int hlen,octet *w, octet *p);
+
+/**	@brief HMAC function
+ *
+	@param T an output tag
+    @param len the tag length
+    @param K an input key, or salt
+    @param M an input message
+    @param hash the hash family (SHA2 or SHA3)
+	@param hlen the hash function output length (32,48 or 64)
+ */
+extern void HMAC(int hash,int hlen,octet *T,int len,octet *K,octet *M);
+
+
+/**	@brief HKDF_Extract function
+ *
+    @param hash the hash family (SHA2 or SHA3)
+	@param hlen the hash function output length (32,48 or 64)
+	@param K an output Key
+    @param P public input salt
+    @param S raw secret keying material
+ */
+extern void HKDF_Extract(int hash,int hlen,octet *K,octet *P,octet *S);
+
+/**	@brief HKDF_Expand function
+ *
+    @param hash the hash family (SHA2 or SHA3)
+	@param hlen the hash function output length (32,48 or 64)
+	@param E an expanded output Key
+    @param olen is the desired length of the expanded key
+    @param K is the fixed length input key
+    @param I is public context information
+
+ */
+extern void HKDF_Expand(int hash,int hlen,octet *E,int olen,octet *K,octet *I);
+
+/**	@brief XOF_Expand function
+ *
+	@param hlen the SHA3 output length (16 or 32)
+	@param E an expanded messsage
+    @param olen is the desired length of the expanded key
+    @param P is Domain Separator
+    @param S input message
+
+ */
+extern void XOF_Expand(int hlen,octet *E,int olen,octet *P,octet *S);
+
+/**	@brief XOF_Expand function
+ *
+    @param hash the hash family (SHA2 or SHA3)
+	@param hlen the SHA3 output length (16 or 32)
+	@param E an expanded messsage
+    @param olen is the desired length of the expanded key
+    @param P is Domain Separator
+    @param S input message
+
+ */
+extern void XMD_Expand(int hash,int hlen,octet *E,int olen,octet *P,octet *S);
+
+
+/** @brief PKCS V1.5 padding of a message prior to RSA signature
+ *
+    @param h is the hash type
+    @param M is the input message
+    @param W is the output encoding, ready for RSA signature
+    @return 1 if OK, else 0
+ */
+extern int PKCS15(int h, octet *M, octet *W);
+
+/** @brief Alternative PKCS V1.5 padding of a message prior to RSA signature
+ *
+    @param h is the hash type
+    @param M is the input message
+    @param W is the output encoding, ready for RSA signature
+    @return 1 if OK, else 0
+ */
+extern int PKCS15b(int h, octet *M, octet *W);
+
+/** @brief PSS padding of a message prior to RSA signature
+ *
+    @param h is the hash type
+    @param M is the input message
+    @param R is a pointer to a cryptographically secure random number generator
+    @param W is the output encoding, ready for RSA signature
+    @return 1 if OK, else 0
+ */
+extern int PSS_ENCODE(int h, octet *M, csprng *R, octet *W);
+
+/** @brief PSS verification
+ *
+    @param h is the hash type
+    @param M is the message
+    @param W is the message encoding
+    @return 1 if OK, else 0
+ */
+extern int PSS_VERIFY(int h, octet *M, octet *W);
+
+
+/** @brief OAEP padding of a message prior to RSA encryption
+ *
+    @param h is the hash type
+    @param M is the input message
+    @param R is a pointer to a cryptographically secure random number generator
+    @param P are input encoding parameter string (could be NULL)
+    @param F is the output encoding, ready for RSA encryption
+    @return 1 if OK, else 0
+ */
+extern int  OAEP_ENCODE(int h, octet *M, csprng *R, octet *P, octet *F);
+/** @brief OAEP unpadding of a message after RSA decryption
+ *
+    Unpadding is done in-place
+    @param h is the hash type
+    @param P are input encoding parameter string (could be NULL)
+    @param F is input padded message, unpadded on output
+    @return 1 if OK, else 0
+ */
+extern int  OAEP_DECODE(int h, octet *P, octet *F);
+
+/**	@brief Key Derivation Function - generates key K from inputs Z and P
+ *
+	IEEE-1363 KDF2 Key Derivation Function. 
+	@param hash is the hash family (SHA2 or SHA3)
+    @param hlen the hash function output length (32,48 or 64)
+	@param Z input octet
+	@param P input key derivation parameters - can be NULL
+	@param len is output desired length of key
+	@param K is the derived key
+ */
+extern void KDF2(int hash, int hlen, octet *K, int len, octet *Z, octet *P);
+/**	@brief Password Based Key Derivation Function - generates key K from password, salt and repeat counter
+ *
+	PBKDF2 Password Based Key Derivation Function. 
+	@param hash is the hash family (SHA2 or SHA3)
+    @param hlen the hash function output length (32,48 or 64)
+	@param P input password
+	@param S input salt
+	@param rep Number of times to be iterated.
+	@param len is output desired length
+	@param K is the derived key
+ */
+extern void PBKDF2(int hash, int hlen, octet *K, int len, octet *P, octet *S, int rep);
+
+/* AES functions */
+/**	@brief Reset AES mode or IV
+ *
+	@param A an instance of the aes
+	@param m is the new active mode of operation (ECB, CBC, OFB, CFB etc)
+	@param iv the new Initialisation Vector
+ */
+extern void AES_reset(aes *A, int m, char *iv);
+/**	@brief Extract chaining vector from aes instance
+ *
+	@param A an instance of the aes
+	@param f the extracted chaining vector
+ */
+extern void AES_getreg(aes *A, char * f);
+/**	@brief Initialise an instance of aes and its mode of operation
+ *
+	@param A an instance aes
+	@param m is the active mode of operation (ECB, CBC, OFB, CFB etc)
+	@param n is the key length in bytes, 16, 24 or 32
+	@param k the AES key as an array of 16 bytes
+	@param iv the Initialisation Vector
+	@return 0 for invalid n
+ */
+extern int AES_init(aes *A, int m, int n, char *k, char *iv);
+/**	@brief Encrypt a single 16 byte block in ECB mode
+ *
+	@param A an instance of the aes
+	@param b is an array of 16 plaintext bytes, on exit becomes ciphertext
+ */
+extern void AES_ecb_encrypt(aes *A, uchar * b);
+/**	@brief Decrypt a single 16 byte block in ECB mode
+ *
+	@param A an instance of the aes
+	@param b is an array of 16 cipherext bytes, on exit becomes plaintext
+ */
+extern void AES_ecb_decrypt(aes *A, uchar * b);
+/**	@brief Encrypt a single 16 byte block in active mode
+ *
+	@param A an instance of the aes
+	@param b is an array of 16 plaintext bytes, on exit becomes ciphertext
+	@return 0, or overflow bytes from CFB mode
+ */
+extern unsign32 AES_encrypt(aes *A, char *b );
+/**	@brief Decrypt a single 16 byte block in active mode
+ *
+	@param A an instance of the aes
+	@param b is an array of 16 ciphertext bytes, on exit becomes plaintext
+	@return 0, or overflow bytes from CFB mode
+ */
+extern unsign32 AES_decrypt(aes *A, char *b);
+/**	@brief Clean up after application of AES
+ *
+	@param A an instance of the aes
+ */
+extern void AES_end(aes *A);
+
+/**	@brief AES encrypts a plaintext to a ciphtertext
+ *
+	IEEE-1363 AES_CBC_IV0_ENCRYPT function. Encrypts in CBC mode with a zero IV, padding as necessary to create a full final block.
+	@param K AES key
+	@param P input plaintext octet
+	@param C output ciphertext octet
+ */
+extern void AES_CBC_IV0_ENCRYPT(octet *K, octet *P, octet *C);
+/**	@brief AES encrypts a plaintext to a ciphtertext
+ *
+	IEEE-1363 AES_CBC_IV0_DECRYPT function. Decrypts in CBC mode with a zero IV.
+	@param K AES key
+	@param C input ciphertext octet
+	@param P output plaintext octet
+	@return 0 if bad input, else 1
+ */
+extern int AES_CBC_IV0_DECRYPT(octet *K, octet *C, octet *P);
+
+/* AES-GCM functions */
+/**	@brief Initialise an instance of AES-GCM mode
+ *
+	@param G an instance AES-GCM
+	@param nk is the key length in bytes, 16, 24 or 32
+	@param k the AES key as an array of 16 bytes
+	@param n the number of bytes in the Initialisation Vector (IV)
+	@param iv the IV
+ */
+extern void GCM_init(gcm *G, int nk, char *k, int n, char *iv);
+/**	@brief Add header (material to be authenticated but not encrypted)
+ *
+	Note that this function can be called any number of times with n a multiple of 16, and then one last time with any value for n
+	@param G an instance AES-GCM
+	@param b is the header material to be added
+	@param n the number of bytes in the header
+ */
+extern int GCM_add_header(gcm *G, char *b, int n);
+/**	@brief Add plaintext and extract ciphertext
+ *
+	Note that this function can be called any number of times with n a multiple of 16, and then one last time with any value for n
+	@param G an instance AES-GCM
+	@param c is the ciphertext generated
+	@param p is the plaintext material to be added
+	@param n the number of bytes in the plaintext
+ */
+extern int GCM_add_plain(gcm *G, char *c, char *p, int n);
+/**	@brief Add ciphertext and extract plaintext
+ *
+	Note that this function can be called any number of times with n a multiple of 16, and then one last time with any value for n
+	@param G an instance AES-GCM
+	@param p is the plaintext generated
+	@param c is the ciphertext material to be added
+	@param n the number of bytes in the ciphertext
+ */
+extern int GCM_add_cipher(gcm *G, char *p, char *c, int n);
+/**	@brief Finish off and extract authentication tag (HMAC)
+ *
+	@param G is an active instance AES-GCM
+	@param t is the output 16 byte authentication tag
+ */
+extern void GCM_finish(gcm *G, char *t);
+
+/**	@brief AES-GCM Encryption
+ *
+	@param K  AES key
+	@param IV Initialization vector
+	@param H Header
+	@param P Plaintext
+	@param C Ciphertext
+	@param T Checksum
+ */
+void AES_GCM_ENCRYPT(octet *K, octet *IV, octet *H, octet *P, octet *C, octet *T);
+
+/**	@brief AES-GCM Decryption
+ *
+	@param K  AES key
+	@param IV Initialization vector
+	@param H Header
+	@param P Plaintext
+	@param C Ciphertext
+	@param T Checksum
+ */
+void AES_GCM_DECRYPT(octet *K, octet *IV, octet *H, octet *C, octet *P, octet *T);
+
+
+/* secret sharing */
+
+/**	@brief Get a share of a message
+ *
+    @param id unique share ID
+    @param nsr number of shares needed for message recovery
+    @param S the output share as an octet
+    @param M the Message octet to be shared
+	@param R an octet of random seed bytes
+	@return a share structure
+
+ */
+extern share getshare(int id,int nsr,octet *S,octet *M,octet *R);
+/**	@brief Recover message from shares
+ *
+    @param M the recovered Message octet
+    @param S an array of sufficient shares
+    @return 0 on success else -1
+ */
+extern int recover(octet *M,share *S);
+
+/* random numbers */
+/**	@brief Seed a random number generator from an array of bytes
+ *
+	The provided seed should be truly random
+	@param R an instance of a Cryptographically Secure Random Number Generator
+	@param n the number of seed bytes provided
+	@param b an array of seed bytes
+
+ */
+extern void RAND_seed(csprng *R, int n, char *b);
+/**	@brief Delete all internal state of a random number generator
+ *
+	@param R an instance of a Cryptographically Secure Random Number Generator
+ */
+extern void RAND_clean(csprng *R);
+/**	@brief Return a random byte from a random number generator
+ *
+	@param R an instance of a Cryptographically Secure Random Number Generator
+	@return a random byte
+ */
+extern int RAND_byte(csprng *R);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/dilithium.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/dilithium.h
new file mode 100644
index 0000000..73ccbb1
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/dilithium.h
@@ -0,0 +1,151 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* Dilithium API */
+
+#ifndef DILITHIUM_H
+#define DILITHIUM_H
+
+#include "core.h"
+
+/* DILITHIUM parameters */
+
+//q= 8380417
+#define DL_LGN 8
+#define DL_DEGREE (1 << DL_LGN)
+#define DL_PRIME 0x7fe001
+#define DL_D 13
+#define DL_TD (23-DL_D)
+
+#define DL_ONE 0x3FFE00    // R mod Q
+#define DL_COMBO 0xA3FA    // ONE*inv mod Q
+#define DL_R2MODP 0x2419FF // R^2 mod Q
+#define DL_ND 0xFC7FDFFF   // 1/(R-Q) mod R
+
+#define DL_MAXLG 19
+#define DL_MAXK 8     // could reduce these if not using highest security
+#define DL_MAXL 7
+#define DL_YBYTES (((DL_MAXLG+1)*DL_DEGREE)/8)
+
+#define DL_SK_SIZE_2 (32*3+DL_DEGREE*(4*13+4*3+4*3)/8)
+#define DL_PK_SIZE_2 ((4*DL_DEGREE*DL_TD)/8+32)
+#define DL_SIG_SIZE_2 ((DL_DEGREE*4*(17+1))/8+80+4+32)
+
+#define DL_SK_SIZE_3 (32*3+DL_DEGREE*(6*13+5*4+6*4)/8)
+#define DL_PK_SIZE_3 ((6*DL_DEGREE*DL_TD)/8+32)
+#define DL_SIG_SIZE_3 ((DL_DEGREE*5*(19+1))/8+55+6+32)
+
+#define DL_SK_SIZE_5 (32*3+DL_DEGREE*(8*13+7*3+8*3)/8)
+#define DL_PK_SIZE_5 ((8*DL_DEGREE*DL_TD)/8+32)
+#define DL_SIG_SIZE_5 ((DL_DEGREE*7*(19+1))/8+75+8+32)
+
+
+namespace core {
+
+/** @brief Dilithium signature key pair generation
+ *
+    @param tau Random Numbers
+    @param SK secret key
+    @param PK public key
+
+ */
+extern void DLTHM_keypair_2(byte *tau,octet *SK,octet *PK);
+
+/** @brief Dilithium create signature on a message 
+ *
+    @param SK secret key
+    @param M the message to be signed
+    @param SIG the output signature
+    @return numbers of attempts needed to create signature
+
+ */
+extern int DLTHM_signature_2(octet *SK,octet *M, octet *SIG);
+
+/** @brief Dilithium verify signature on a message 
+ *
+    @param PK public key key
+    @param M the signed message
+    @param SIG the signature
+    @return true if signature is good, else false
+
+ */
+extern bool DLTHM_verify_2(octet *PK,octet *M,octet *SIG);
+
+
+/** @brief Dilithium signature key pair generation
+ *
+    @param tau Random Numbers
+    @param SK secret key
+    @param PK public key
+
+ */
+extern void DLTHM_keypair_3(byte *tau,octet *SK,octet *PK);
+
+/** @brief Dilithium create signature on a message 
+ *
+    @param SK secret key
+    @param M the message to be signed
+    @param SIG the output signature
+    @return numbers of attempts needed to create signature
+
+ */
+extern int DLTHM_signature_3(octet *SK,octet *M, octet *SIG);
+
+/** @brief Dilithium verify signature on a message 
+ *
+    @param PK public key key
+    @param M the signed message
+    @param SIG the signature
+    @return true if signature is good, else false
+
+ */
+extern bool DLTHM_verify_3(octet *PK,octet *M,octet *SIG);
+
+
+/** @brief Dilithium signature key pair generation
+ *
+    @param tau Random Numbers
+    @param SK secret key
+    @param PK public key
+
+ */
+extern void DLTHM_keypair_5(byte *tau,octet *SK,octet *PK);
+
+/** @brief Dilithium create signature on a message 
+ *
+    @param SK secret key
+    @param M the message to be signed
+    @param SIG the output signature
+    @return numbers of attempts needed to create signature
+
+ */
+extern int DLTHM_signature_5(octet *SK,octet *M, octet *SIG);
+
+/** @brief Dilithium verify signature on a message 
+ *
+    @param PK public key key
+    @param M the signed message
+    @param SIG the signature
+    @return true if signature is good, else false
+
+ */
+extern bool DLTHM_verify_5(octet *PK,octet *M,octet *SIG);
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_ANSSI.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_ANSSI.h
new file mode 100644
index 0000000..42231fb
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_ANSSI.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_ANSSI_H
+#define ECDH_ANSSI_H
+
+#include "ecp_ANSSI.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_ANSSI MODBYTES_B256_28  /**< ECC Group Size in bytes */
+#define EFS_ANSSI MODBYTES_B256_28  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace ANSSI {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_BLS12381.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_BLS12381.h
new file mode 100644
index 0000000..41ac5b9
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_BLS12381.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_BLS12381_H
+#define ECDH_BLS12381_H
+
+#include "ecp_BLS12381.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_BLS12381 MODBYTES_B384_29  /**< ECC Group Size in bytes */
+#define EFS_BLS12381 MODBYTES_B384_29  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace BLS12381 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_BLS12383.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_BLS12383.h
new file mode 100644
index 0000000..ca33dfe
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_BLS12383.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_BLS12383_H
+#define ECDH_BLS12383_H
+
+#include "ecp_BLS12383.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_BLS12383 MODBYTES_B384_29  /**< ECC Group Size in bytes */
+#define EFS_BLS12383 MODBYTES_B384_29  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace BLS12383 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_BLS12443.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_BLS12443.h
new file mode 100644
index 0000000..81b1069
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_BLS12443.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_BLS12443_H
+#define ECDH_BLS12443_H
+
+#include "ecp_BLS12443.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_BLS12443 MODBYTES_B448_29  /**< ECC Group Size in bytes */
+#define EFS_BLS12443 MODBYTES_B448_29  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace BLS12443 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_BLS12461.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_BLS12461.h
new file mode 100644
index 0000000..d8be5f8
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_BLS12461.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_BLS12461_H
+#define ECDH_BLS12461_H
+
+#include "ecp_BLS12461.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_BLS12461 MODBYTES_B464_28  /**< ECC Group Size in bytes */
+#define EFS_BLS12461 MODBYTES_B464_28  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace BLS12461 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_BLS24479.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_BLS24479.h
new file mode 100644
index 0000000..11ba2f9
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_BLS24479.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_BLS24479_H
+#define ECDH_BLS24479_H
+
+#include "ecp_BLS24479.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_BLS24479 MODBYTES_B480_29  /**< ECC Group Size in bytes */
+#define EFS_BLS24479 MODBYTES_B480_29  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace BLS24479 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_BLS48286.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_BLS48286.h
new file mode 100644
index 0000000..9e34468
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_BLS48286.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_BLS48286_H
+#define ECDH_BLS48286_H
+
+#include "ecp_BLS48286.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_BLS48286 MODBYTES_B288_29  /**< ECC Group Size in bytes */
+#define EFS_BLS48286 MODBYTES_B288_29  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace BLS48286 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_BLS48556.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_BLS48556.h
new file mode 100644
index 0000000..83d1223
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_BLS48556.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_BLS48556_H
+#define ECDH_BLS48556_H
+
+#include "ecp_BLS48556.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_BLS48556 MODBYTES_B560_29  /**< ECC Group Size in bytes */
+#define EFS_BLS48556 MODBYTES_B560_29  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace BLS48556 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_BLS48581.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_BLS48581.h
new file mode 100644
index 0000000..e5497cc
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_BLS48581.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_BLS48581_H
+#define ECDH_BLS48581_H
+
+#include "ecp_BLS48581.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_BLS48581 MODBYTES_B584_29  /**< ECC Group Size in bytes */
+#define EFS_BLS48581 MODBYTES_B584_29  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace BLS48581 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_BN158.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_BN158.h
new file mode 100644
index 0000000..f0cde9a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_BN158.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_BN158_H
+#define ECDH_BN158_H
+
+#include "ecp_BN158.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_BN158 MODBYTES_B160_28  /**< ECC Group Size in bytes */
+#define EFS_BN158 MODBYTES_B160_28  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace BN158 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_BN254.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_BN254.h
new file mode 100644
index 0000000..0284dcf
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_BN254.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_BN254_H
+#define ECDH_BN254_H
+
+#include "ecp_BN254.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_BN254 MODBYTES_B256_28  /**< ECC Group Size in bytes */
+#define EFS_BN254 MODBYTES_B256_28  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace BN254 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_BN254CX.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_BN254CX.h
new file mode 100644
index 0000000..98598d8
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_BN254CX.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_BN254CX_H
+#define ECDH_BN254CX_H
+
+#include "ecp_BN254CX.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_BN254CX MODBYTES_B256_28  /**< ECC Group Size in bytes */
+#define EFS_BN254CX MODBYTES_B256_28  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace BN254CX {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_BN462.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_BN462.h
new file mode 100644
index 0000000..80cf432
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_BN462.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_BN462_H
+#define ECDH_BN462_H
+
+#include "ecp_BN462.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_BN462 MODBYTES_B464_28  /**< ECC Group Size in bytes */
+#define EFS_BN462 MODBYTES_B464_28  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace BN462 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_BRAINPOOL.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_BRAINPOOL.h
new file mode 100644
index 0000000..8d3d707
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_BRAINPOOL.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_BRAINPOOL_H
+#define ECDH_BRAINPOOL_H
+
+#include "ecp_BRAINPOOL.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_BRAINPOOL MODBYTES_B256_28  /**< ECC Group Size in bytes */
+#define EFS_BRAINPOOL MODBYTES_B256_28  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace BRAINPOOL {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_C1174.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_C1174.h
new file mode 100644
index 0000000..ddfc1cd
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_C1174.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_C1174_H
+#define ECDH_C1174_H
+
+#include "ecp_C1174.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_C1174 MODBYTES_B256_29  /**< ECC Group Size in bytes */
+#define EFS_C1174 MODBYTES_B256_29  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace C1174 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_C13318.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_C13318.h
new file mode 100644
index 0000000..7c648e9
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_C13318.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_C13318_H
+#define ECDH_C13318_H
+
+#include "ecp_C13318.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_C13318 MODBYTES_B256_29  /**< ECC Group Size in bytes */
+#define EFS_C13318 MODBYTES_B256_29  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace C13318 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_C1665.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_C1665.h
new file mode 100644
index 0000000..14c5eb5
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_C1665.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_C1665_H
+#define ECDH_C1665_H
+
+#include "ecp_C1665.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_C1665 MODBYTES_B168_29  /**< ECC Group Size in bytes */
+#define EFS_C1665 MODBYTES_B168_29  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace C1665 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_C25519.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_C25519.h
new file mode 100644
index 0000000..54e1a38
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_C25519.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_C25519_H
+#define ECDH_C25519_H
+
+#include "ecp_C25519.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_C25519 MODBYTES_B256_29  /**< ECC Group Size in bytes */
+#define EFS_C25519 MODBYTES_B256_29  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace C25519 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_C41417.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_C41417.h
new file mode 100644
index 0000000..c0eb1f8
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_C41417.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_C41417_H
+#define ECDH_C41417_H
+
+#include "ecp_C41417.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_C41417 MODBYTES_B416_29  /**< ECC Group Size in bytes */
+#define EFS_C41417 MODBYTES_B416_29  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace C41417 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_Ed25519.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_Ed25519.h
new file mode 100644
index 0000000..1f19fe2
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_Ed25519.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_Ed25519_H
+#define ECDH_Ed25519_H
+
+#include "ecp_Ed25519.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_Ed25519 MODBYTES_B256_29  /**< ECC Group Size in bytes */
+#define EFS_Ed25519 MODBYTES_B256_29  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace Ed25519 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_Ed448.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_Ed448.h
new file mode 100644
index 0000000..05dd78d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_Ed448.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_Ed448_H
+#define ECDH_Ed448_H
+
+#include "ecp_Ed448.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_Ed448 MODBYTES_B448_29  /**< ECC Group Size in bytes */
+#define EFS_Ed448 MODBYTES_B448_29  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace Ed448 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_FP256BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_FP256BN.h
new file mode 100644
index 0000000..35b3be4
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_FP256BN.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_FP256BN_H
+#define ECDH_FP256BN_H
+
+#include "ecp_FP256BN.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_FP256BN MODBYTES_B256_28  /**< ECC Group Size in bytes */
+#define EFS_FP256BN MODBYTES_B256_28  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace FP256BN {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_FP512BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_FP512BN.h
new file mode 100644
index 0000000..a14539c
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_FP512BN.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_FP512BN_H
+#define ECDH_FP512BN_H
+
+#include "ecp_FP512BN.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_FP512BN MODBYTES_B512_29  /**< ECC Group Size in bytes */
+#define EFS_FP512BN MODBYTES_B512_29  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace FP512BN {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_HIFIVE.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_HIFIVE.h
new file mode 100644
index 0000000..5c65fc4
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_HIFIVE.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_HIFIVE_H
+#define ECDH_HIFIVE_H
+
+#include "ecp_HIFIVE.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_HIFIVE MODBYTES_B336_29  /**< ECC Group Size in bytes */
+#define EFS_HIFIVE MODBYTES_B336_29  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace HIFIVE {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_JUBJUB.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_JUBJUB.h
new file mode 100644
index 0000000..7ee183a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_JUBJUB.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_JUBJUB_H
+#define ECDH_JUBJUB_H
+
+#include "ecp_JUBJUB.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_JUBJUB MODBYTES_B256_29  /**< ECC Group Size in bytes */
+#define EFS_JUBJUB MODBYTES_B256_29  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace JUBJUB {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_MDC.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_MDC.h
new file mode 100644
index 0000000..806bdc4
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_MDC.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_MDC_H
+#define ECDH_MDC_H
+
+#include "ecp_MDC.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_MDC MODBYTES_B256_28  /**< ECC Group Size in bytes */
+#define EFS_MDC MODBYTES_B256_28  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace MDC {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_NIST256.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_NIST256.h
new file mode 100644
index 0000000..4812411
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_NIST256.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_NIST256_H
+#define ECDH_NIST256_H
+
+#include "ecp_NIST256.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_NIST256 MODBYTES_B256_28  /**< ECC Group Size in bytes */
+#define EFS_NIST256 MODBYTES_B256_28  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace NIST256 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_NIST384.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_NIST384.h
new file mode 100644
index 0000000..282c957
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_NIST384.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_NIST384_H
+#define ECDH_NIST384_H
+
+#include "ecp_NIST384.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_NIST384 MODBYTES_B384_29  /**< ECC Group Size in bytes */
+#define EFS_NIST384 MODBYTES_B384_29  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace NIST384 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_NIST521.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_NIST521.h
new file mode 100644
index 0000000..9705c1e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_NIST521.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_NIST521_H
+#define ECDH_NIST521_H
+
+#include "ecp_NIST521.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_NIST521 MODBYTES_B528_28  /**< ECC Group Size in bytes */
+#define EFS_NIST521 MODBYTES_B528_28  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace NIST521 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_NUMS256E.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_NUMS256E.h
new file mode 100644
index 0000000..4f8fb72
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_NUMS256E.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_NUMS256E_H
+#define ECDH_NUMS256E_H
+
+#include "ecp_NUMS256E.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_NUMS256E MODBYTES_B256_29  /**< ECC Group Size in bytes */
+#define EFS_NUMS256E MODBYTES_B256_29  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace NUMS256E {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_NUMS256W.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_NUMS256W.h
new file mode 100644
index 0000000..8e0bdfb
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_NUMS256W.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_NUMS256W_H
+#define ECDH_NUMS256W_H
+
+#include "ecp_NUMS256W.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_NUMS256W MODBYTES_B256_28  /**< ECC Group Size in bytes */
+#define EFS_NUMS256W MODBYTES_B256_28  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace NUMS256W {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_NUMS384E.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_NUMS384E.h
new file mode 100644
index 0000000..47125f9
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_NUMS384E.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_NUMS384E_H
+#define ECDH_NUMS384E_H
+
+#include "ecp_NUMS384E.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_NUMS384E MODBYTES_B384_29  /**< ECC Group Size in bytes */
+#define EFS_NUMS384E MODBYTES_B384_29  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace NUMS384E {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_NUMS384W.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_NUMS384W.h
new file mode 100644
index 0000000..a8a45fd
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_NUMS384W.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_NUMS384W_H
+#define ECDH_NUMS384W_H
+
+#include "ecp_NUMS384W.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_NUMS384W MODBYTES_B384_29  /**< ECC Group Size in bytes */
+#define EFS_NUMS384W MODBYTES_B384_29  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace NUMS384W {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_NUMS512E.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_NUMS512E.h
new file mode 100644
index 0000000..b465006
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_NUMS512E.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_NUMS512E_H
+#define ECDH_NUMS512E_H
+
+#include "ecp_NUMS512E.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_NUMS512E MODBYTES_B512_29  /**< ECC Group Size in bytes */
+#define EFS_NUMS512E MODBYTES_B512_29  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace NUMS512E {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_NUMS512W.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_NUMS512W.h
new file mode 100644
index 0000000..96ce03c
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_NUMS512W.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_NUMS512W_H
+#define ECDH_NUMS512W_H
+
+#include "ecp_NUMS512W.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_NUMS512W MODBYTES_B512_29  /**< ECC Group Size in bytes */
+#define EFS_NUMS512W MODBYTES_B512_29  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace NUMS512W {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_SECP160R1.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_SECP160R1.h
new file mode 100644
index 0000000..7d3ebdc
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_SECP160R1.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_SECP160R1_H
+#define ECDH_SECP160R1_H
+
+#include "ecp_SECP160R1.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_SECP160R1 MODBYTES_B160_29  /**< ECC Group Size in bytes */
+#define EFS_SECP160R1 MODBYTES_B160_29  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace SECP160R1 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_SECP256K1.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_SECP256K1.h
new file mode 100644
index 0000000..439be6e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_SECP256K1.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_SECP256K1_H
+#define ECDH_SECP256K1_H
+
+#include "ecp_SECP256K1.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_SECP256K1 MODBYTES_B256_28  /**< ECC Group Size in bytes */
+#define EFS_SECP256K1 MODBYTES_B256_28  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace SECP256K1 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_SM2.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_SM2.h
new file mode 100644
index 0000000..26f7297
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_SM2.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_SM2_H
+#define ECDH_SM2_H
+
+#include "ecp_SM2.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_SM2 MODBYTES_B256_28  /**< ECC Group Size in bytes */
+#define EFS_SM2 MODBYTES_B256_28  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace SM2 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_TWEEDLEDEE.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_TWEEDLEDEE.h
new file mode 100644
index 0000000..59d6d1c
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_TWEEDLEDEE.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_TWEEDLEDEE_H
+#define ECDH_TWEEDLEDEE_H
+
+#include "ecp_TWEEDLEDEE.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_TWEEDLEDEE MODBYTES_B256_29  /**< ECC Group Size in bytes */
+#define EFS_TWEEDLEDEE MODBYTES_B256_29  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace TWEEDLEDEE {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_TWEEDLEDUM.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_TWEEDLEDUM.h
new file mode 100644
index 0000000..1d3825b
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_TWEEDLEDUM.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_TWEEDLEDUM_H
+#define ECDH_TWEEDLEDUM_H
+
+#include "ecp_TWEEDLEDUM.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_TWEEDLEDUM MODBYTES_B256_29  /**< ECC Group Size in bytes */
+#define EFS_TWEEDLEDUM MODBYTES_B256_29  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace TWEEDLEDUM {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_X448.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_X448.h
new file mode 100644
index 0000000..9b2ea32
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecdh_X448.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_X448_H
+#define ECDH_X448_H
+
+#include "ecp_X448.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_X448 MODBYTES_B448_29  /**< ECC Group Size in bytes */
+#define EFS_X448 MODBYTES_B448_29  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace X448 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp2_BLS12381.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp2_BLS12381.h
new file mode 100644
index 0000000..715602e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp2_BLS12381.h
@@ -0,0 +1,249 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP2_BLS12381_H
+#define ECP2_BLS12381_H
+
+#include "fp2_BLS12381.h"
+#include "config_curve_BLS12381.h"
+
+using namespace core;
+
+
+namespace BLS12381 {
+
+extern const B384_29::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B384_29::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+}
+
+namespace BLS12381 {
+
+/**
+	@brief ECP2 Structure - Elliptic Curve Point over quadratic extension field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag */
+    BLS12381::FP2 x;   /**< x-coordinate of point */
+    BLS12381::FP2 y;   /**< y-coordinate of point */
+    BLS12381::FP2 z;   /**< z-coordinate of point */
+} ECP2;
+
+
+/* Curve Params - see rom*.cpp */
+
+extern const int CURVE_B_I;		/**< Elliptic curve B parameter */
+extern const B384_29::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B384_29::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B384_29::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B384_29::BIG CURVE_Bnx;   /**< Elliptic curve parameter */
+extern const B384_29::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+
+/* Generator point on G1 */
+extern const B384_29::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B384_29::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B384_29::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+/* ECP2 E(Fp2) prototypes */
+/**	@brief Tests for ECP2 point equal to infinity
+ *
+	@param P ECP2 point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP2_isinf(ECP2 *P);
+/**	@brief Copy ECP2 point to another ECP2 point
+ *
+	@param P ECP2 instance, on exit = Q
+	@param Q ECP2 instance to be copied
+ */
+extern void ECP2_copy(ECP2 *P, ECP2 *Q);
+/**	@brief Set ECP2 to point-at-infinity
+ *
+	@param P ECP2 instance to be set to infinity
+ */
+extern void ECP2_inf(ECP2 *P);
+/**	@brief Tests for equality of two ECP2s
+ *
+	@param P ECP2 instance to be compared
+	@param Q ECP2 instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP2_equals(ECP2 *P, ECP2 *Q);
+/**	@brief Converts an ECP2 point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP2 instance to be converted to affine form
+ */
+extern void ECP2_affine(ECP2 *P);
+/**	@brief Extract x and y coordinates of an ECP2 point P
+ *
+	If x=y, returns only x
+	@param x FP2 on exit = x coordinate of point
+	@param y FP2 on exit = y coordinate of point (unless x=y)
+	@param P ECP2 instance (x,y)
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP2_get(BLS12381::FP2 *x, BLS12381::FP2 *y, ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, converted to affine coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_output(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, in projective coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_outputxyz(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to an octet string
+ *
+	The octet string is created in the form x|y or just x if compressed
+	Convert the real and imaginary parts of the x and y coordinates to big-endian base 256 form.
+    If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param S output octet string
+	@param P ECP2 instance to be converted to an octet string
+    @param c true for compression
+ */
+extern void ECP2_toOctet(octet *S, ECP2 *P, bool c);
+/**	@brief Creates an ECP2 point from an octet string
+ *
+	The octet string is in the form x|y
+	The real and imaginary parts of the x and y coordinates are in big-endian base 256 form.
+    If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP2 instance to be created from the octet string
+	@param S input octet string
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP2_fromOctet(ECP2 *P, octet *S);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x)=x^3+Ax+B
+	Used internally.
+	@param r FP2 value of f(x)
+	@param x FP2 instance
+ */
+extern void ECP2_rhs(BLS12381::FP2 *r, BLS12381::FP2 *x);
+/**	@brief Set ECP2 to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP2 instance to be set (x,y)
+	@param x FP2 x coordinate of point
+	@param y FP2 y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_set(ECP2 *P, BLS12381::FP2 *x, BLS12381::FP2 *y);
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Otherwise y coordinate is calculated from x.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+    @param s sign of y
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_setx(ECP2 *P, BLS12381::FP2 *x, int s);
+/**	@brief Negation of an ECP2 point
+ *
+	@param P ECP2 instance, on exit = -P
+ */
+extern void ECP2_neg(ECP2 *P);
+/**	@brief Doubles an ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =2*P
+ */
+extern int ECP2_dbl(ECP2 *P);
+/**	@brief Adds ECP2 instance Q to ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P+Q
+	@param Q ECP2 instance to be added to P
+ */
+extern int ECP2_add(ECP2 *P, ECP2 *Q);
+/**	@brief Subtracts ECP instance Q from ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P-Q
+	@param Q ECP2 instance to be subtracted from P
+ */
+extern void ECP2_sub(ECP2 *P, ECP2 *Q);
+/**	@brief Multiplies an ECP2 instance P by a BIG, side-channel resistant
+ *
+	Uses fixed sized windows.
+	@param P ECP2 instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP2_mul(ECP2 *P, B384_29::BIG b);
+/**	@brief Multiplies an ECP2 instance P by the internal modulus p, using precalculated Frobenius constant f
+ *
+	Fast point multiplication using Frobenius
+	@param P ECP2 instance, on exit = p*P
+	@param f FP2 precalculated Frobenius constant
+
+ */
+extern void ECP2_frob(ECP2 *P, BLS12381::FP2 *f);
+/**	@brief Calculates P=b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+ *
+	@param P ECP2 instance, on exit = b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+	@param Q ECP2 array of 4 points
+	@param b BIG array of 4 multipliers
+ */
+extern void ECP2_mul4(ECP2 *P, ECP2 *Q, B384_29::BIG *b);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP2 multiplied by co-factor
+ */
+extern void ECP2_cfp(ECP2 *Q);
+
+/**	@brief Maps random FP2 to curve point in constant time
+ *
+	@param Q ECP2 instance 
+	@param x FP2 derived from hash
+ */
+extern void ECP2_map2point(ECP2 *Q, BLS12381::FP2 *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP2 instance 
+	@param x Fp derived from hash
+ */
+extern void ECP2_hap2point(ECP2 *Q, B384_29::BIG  x);
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param P ECP2 instance of correct order
+	@param W OCTET byte array to be mapped
+ */
+extern void ECP2_mapit(ECP2 *P, octet *w);
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP2 instance
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_generator(ECP2 *G);
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp2_BLS12383.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp2_BLS12383.h
new file mode 100644
index 0000000..14d60b8
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp2_BLS12383.h
@@ -0,0 +1,249 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP2_BLS12383_H
+#define ECP2_BLS12383_H
+
+#include "fp2_BLS12383.h"
+#include "config_curve_BLS12383.h"
+
+using namespace core;
+
+
+namespace BLS12383 {
+
+extern const B384_29::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B384_29::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+}
+
+namespace BLS12383 {
+
+/**
+	@brief ECP2 Structure - Elliptic Curve Point over quadratic extension field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag */
+    BLS12383::FP2 x;   /**< x-coordinate of point */
+    BLS12383::FP2 y;   /**< y-coordinate of point */
+    BLS12383::FP2 z;   /**< z-coordinate of point */
+} ECP2;
+
+
+/* Curve Params - see rom*.cpp */
+
+extern const int CURVE_B_I;		/**< Elliptic curve B parameter */
+extern const B384_29::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B384_29::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B384_29::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B384_29::BIG CURVE_Bnx;   /**< Elliptic curve parameter */
+extern const B384_29::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+
+/* Generator point on G1 */
+extern const B384_29::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B384_29::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B384_29::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+/* ECP2 E(Fp2) prototypes */
+/**	@brief Tests for ECP2 point equal to infinity
+ *
+	@param P ECP2 point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP2_isinf(ECP2 *P);
+/**	@brief Copy ECP2 point to another ECP2 point
+ *
+	@param P ECP2 instance, on exit = Q
+	@param Q ECP2 instance to be copied
+ */
+extern void ECP2_copy(ECP2 *P, ECP2 *Q);
+/**	@brief Set ECP2 to point-at-infinity
+ *
+	@param P ECP2 instance to be set to infinity
+ */
+extern void ECP2_inf(ECP2 *P);
+/**	@brief Tests for equality of two ECP2s
+ *
+	@param P ECP2 instance to be compared
+	@param Q ECP2 instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP2_equals(ECP2 *P, ECP2 *Q);
+/**	@brief Converts an ECP2 point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP2 instance to be converted to affine form
+ */
+extern void ECP2_affine(ECP2 *P);
+/**	@brief Extract x and y coordinates of an ECP2 point P
+ *
+	If x=y, returns only x
+	@param x FP2 on exit = x coordinate of point
+	@param y FP2 on exit = y coordinate of point (unless x=y)
+	@param P ECP2 instance (x,y)
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP2_get(BLS12383::FP2 *x, BLS12383::FP2 *y, ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, converted to affine coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_output(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, in projective coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_outputxyz(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to an octet string
+ *
+	The octet string is created in the form x|y or just x if compressed
+	Convert the real and imaginary parts of the x and y coordinates to big-endian base 256 form.
+    If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param S output octet string
+	@param P ECP2 instance to be converted to an octet string
+    @param c true for compression
+ */
+extern void ECP2_toOctet(octet *S, ECP2 *P, bool c);
+/**	@brief Creates an ECP2 point from an octet string
+ *
+	The octet string is in the form x|y
+	The real and imaginary parts of the x and y coordinates are in big-endian base 256 form.
+    If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP2 instance to be created from the octet string
+	@param S input octet string
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP2_fromOctet(ECP2 *P, octet *S);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x)=x^3+Ax+B
+	Used internally.
+	@param r FP2 value of f(x)
+	@param x FP2 instance
+ */
+extern void ECP2_rhs(BLS12383::FP2 *r, BLS12383::FP2 *x);
+/**	@brief Set ECP2 to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP2 instance to be set (x,y)
+	@param x FP2 x coordinate of point
+	@param y FP2 y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_set(ECP2 *P, BLS12383::FP2 *x, BLS12383::FP2 *y);
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Otherwise y coordinate is calculated from x.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+    @param s sign of y
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_setx(ECP2 *P, BLS12383::FP2 *x, int s);
+/**	@brief Negation of an ECP2 point
+ *
+	@param P ECP2 instance, on exit = -P
+ */
+extern void ECP2_neg(ECP2 *P);
+/**	@brief Doubles an ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =2*P
+ */
+extern int ECP2_dbl(ECP2 *P);
+/**	@brief Adds ECP2 instance Q to ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P+Q
+	@param Q ECP2 instance to be added to P
+ */
+extern int ECP2_add(ECP2 *P, ECP2 *Q);
+/**	@brief Subtracts ECP instance Q from ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P-Q
+	@param Q ECP2 instance to be subtracted from P
+ */
+extern void ECP2_sub(ECP2 *P, ECP2 *Q);
+/**	@brief Multiplies an ECP2 instance P by a BIG, side-channel resistant
+ *
+	Uses fixed sized windows.
+	@param P ECP2 instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP2_mul(ECP2 *P, B384_29::BIG b);
+/**	@brief Multiplies an ECP2 instance P by the internal modulus p, using precalculated Frobenius constant f
+ *
+	Fast point multiplication using Frobenius
+	@param P ECP2 instance, on exit = p*P
+	@param f FP2 precalculated Frobenius constant
+
+ */
+extern void ECP2_frob(ECP2 *P, BLS12383::FP2 *f);
+/**	@brief Calculates P=b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+ *
+	@param P ECP2 instance, on exit = b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+	@param Q ECP2 array of 4 points
+	@param b BIG array of 4 multipliers
+ */
+extern void ECP2_mul4(ECP2 *P, ECP2 *Q, B384_29::BIG *b);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP2 multiplied by co-factor
+ */
+extern void ECP2_cfp(ECP2 *Q);
+
+/**	@brief Maps random FP2 to curve point in constant time
+ *
+	@param Q ECP2 instance 
+	@param x FP2 derived from hash
+ */
+extern void ECP2_map2point(ECP2 *Q, BLS12383::FP2 *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP2 instance 
+	@param x Fp derived from hash
+ */
+extern void ECP2_hap2point(ECP2 *Q, B384_29::BIG  x);
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param P ECP2 instance of correct order
+	@param W OCTET byte array to be mapped
+ */
+extern void ECP2_mapit(ECP2 *P, octet *w);
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP2 instance
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_generator(ECP2 *G);
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp2_BLS12443.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp2_BLS12443.h
new file mode 100644
index 0000000..964b0ff
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp2_BLS12443.h
@@ -0,0 +1,249 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP2_BLS12443_H
+#define ECP2_BLS12443_H
+
+#include "fp2_BLS12443.h"
+#include "config_curve_BLS12443.h"
+
+using namespace core;
+
+
+namespace BLS12443 {
+
+extern const B448_29::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B448_29::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+}
+
+namespace BLS12443 {
+
+/**
+	@brief ECP2 Structure - Elliptic Curve Point over quadratic extension field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag */
+    BLS12443::FP2 x;   /**< x-coordinate of point */
+    BLS12443::FP2 y;   /**< y-coordinate of point */
+    BLS12443::FP2 z;   /**< z-coordinate of point */
+} ECP2;
+
+
+/* Curve Params - see rom*.cpp */
+
+extern const int CURVE_B_I;		/**< Elliptic curve B parameter */
+extern const B448_29::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B448_29::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B448_29::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B448_29::BIG CURVE_Bnx;   /**< Elliptic curve parameter */
+extern const B448_29::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+
+/* Generator point on G1 */
+extern const B448_29::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B448_29::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B448_29::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_29::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B448_29::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_29::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+/* ECP2 E(Fp2) prototypes */
+/**	@brief Tests for ECP2 point equal to infinity
+ *
+	@param P ECP2 point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP2_isinf(ECP2 *P);
+/**	@brief Copy ECP2 point to another ECP2 point
+ *
+	@param P ECP2 instance, on exit = Q
+	@param Q ECP2 instance to be copied
+ */
+extern void ECP2_copy(ECP2 *P, ECP2 *Q);
+/**	@brief Set ECP2 to point-at-infinity
+ *
+	@param P ECP2 instance to be set to infinity
+ */
+extern void ECP2_inf(ECP2 *P);
+/**	@brief Tests for equality of two ECP2s
+ *
+	@param P ECP2 instance to be compared
+	@param Q ECP2 instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP2_equals(ECP2 *P, ECP2 *Q);
+/**	@brief Converts an ECP2 point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP2 instance to be converted to affine form
+ */
+extern void ECP2_affine(ECP2 *P);
+/**	@brief Extract x and y coordinates of an ECP2 point P
+ *
+	If x=y, returns only x
+	@param x FP2 on exit = x coordinate of point
+	@param y FP2 on exit = y coordinate of point (unless x=y)
+	@param P ECP2 instance (x,y)
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP2_get(BLS12443::FP2 *x, BLS12443::FP2 *y, ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, converted to affine coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_output(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, in projective coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_outputxyz(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to an octet string
+ *
+	The octet string is created in the form x|y or just x if compressed
+	Convert the real and imaginary parts of the x and y coordinates to big-endian base 256 form.
+    If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param S output octet string
+	@param P ECP2 instance to be converted to an octet string
+    @param c true for compression
+ */
+extern void ECP2_toOctet(octet *S, ECP2 *P, bool c);
+/**	@brief Creates an ECP2 point from an octet string
+ *
+	The octet string is in the form x|y
+	The real and imaginary parts of the x and y coordinates are in big-endian base 256 form.
+    If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP2 instance to be created from the octet string
+	@param S input octet string
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP2_fromOctet(ECP2 *P, octet *S);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x)=x^3+Ax+B
+	Used internally.
+	@param r FP2 value of f(x)
+	@param x FP2 instance
+ */
+extern void ECP2_rhs(BLS12443::FP2 *r, BLS12443::FP2 *x);
+/**	@brief Set ECP2 to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP2 instance to be set (x,y)
+	@param x FP2 x coordinate of point
+	@param y FP2 y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_set(ECP2 *P, BLS12443::FP2 *x, BLS12443::FP2 *y);
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Otherwise y coordinate is calculated from x.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+    @param s sign of y
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_setx(ECP2 *P, BLS12443::FP2 *x, int s);
+/**	@brief Negation of an ECP2 point
+ *
+	@param P ECP2 instance, on exit = -P
+ */
+extern void ECP2_neg(ECP2 *P);
+/**	@brief Doubles an ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =2*P
+ */
+extern int ECP2_dbl(ECP2 *P);
+/**	@brief Adds ECP2 instance Q to ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P+Q
+	@param Q ECP2 instance to be added to P
+ */
+extern int ECP2_add(ECP2 *P, ECP2 *Q);
+/**	@brief Subtracts ECP instance Q from ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P-Q
+	@param Q ECP2 instance to be subtracted from P
+ */
+extern void ECP2_sub(ECP2 *P, ECP2 *Q);
+/**	@brief Multiplies an ECP2 instance P by a BIG, side-channel resistant
+ *
+	Uses fixed sized windows.
+	@param P ECP2 instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP2_mul(ECP2 *P, B448_29::BIG b);
+/**	@brief Multiplies an ECP2 instance P by the internal modulus p, using precalculated Frobenius constant f
+ *
+	Fast point multiplication using Frobenius
+	@param P ECP2 instance, on exit = p*P
+	@param f FP2 precalculated Frobenius constant
+
+ */
+extern void ECP2_frob(ECP2 *P, BLS12443::FP2 *f);
+/**	@brief Calculates P=b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+ *
+	@param P ECP2 instance, on exit = b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+	@param Q ECP2 array of 4 points
+	@param b BIG array of 4 multipliers
+ */
+extern void ECP2_mul4(ECP2 *P, ECP2 *Q, B448_29::BIG *b);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP2 multiplied by co-factor
+ */
+extern void ECP2_cfp(ECP2 *Q);
+
+/**	@brief Maps random FP2 to curve point in constant time
+ *
+	@param Q ECP2 instance 
+	@param x FP2 derived from hash
+ */
+extern void ECP2_map2point(ECP2 *Q, BLS12443::FP2 *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP2 instance 
+	@param x Fp derived from hash
+ */
+extern void ECP2_hap2point(ECP2 *Q, B448_29::BIG  x);
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param P ECP2 instance of correct order
+	@param W OCTET byte array to be mapped
+ */
+extern void ECP2_mapit(ECP2 *P, octet *w);
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP2 instance
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_generator(ECP2 *G);
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp2_BLS12461.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp2_BLS12461.h
new file mode 100644
index 0000000..7e306eb
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp2_BLS12461.h
@@ -0,0 +1,249 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP2_BLS12461_H
+#define ECP2_BLS12461_H
+
+#include "fp2_BLS12461.h"
+#include "config_curve_BLS12461.h"
+
+using namespace core;
+
+
+namespace BLS12461 {
+
+extern const B464_28::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B464_28::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+}
+
+namespace BLS12461 {
+
+/**
+	@brief ECP2 Structure - Elliptic Curve Point over quadratic extension field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag */
+    BLS12461::FP2 x;   /**< x-coordinate of point */
+    BLS12461::FP2 y;   /**< y-coordinate of point */
+    BLS12461::FP2 z;   /**< z-coordinate of point */
+} ECP2;
+
+
+/* Curve Params - see rom*.cpp */
+
+extern const int CURVE_B_I;		/**< Elliptic curve B parameter */
+extern const B464_28::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B464_28::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B464_28::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B464_28::BIG CURVE_Bnx;   /**< Elliptic curve parameter */
+extern const B464_28::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+
+/* Generator point on G1 */
+extern const B464_28::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B464_28::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B464_28::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B464_28::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B464_28::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B464_28::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+/* ECP2 E(Fp2) prototypes */
+/**	@brief Tests for ECP2 point equal to infinity
+ *
+	@param P ECP2 point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP2_isinf(ECP2 *P);
+/**	@brief Copy ECP2 point to another ECP2 point
+ *
+	@param P ECP2 instance, on exit = Q
+	@param Q ECP2 instance to be copied
+ */
+extern void ECP2_copy(ECP2 *P, ECP2 *Q);
+/**	@brief Set ECP2 to point-at-infinity
+ *
+	@param P ECP2 instance to be set to infinity
+ */
+extern void ECP2_inf(ECP2 *P);
+/**	@brief Tests for equality of two ECP2s
+ *
+	@param P ECP2 instance to be compared
+	@param Q ECP2 instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP2_equals(ECP2 *P, ECP2 *Q);
+/**	@brief Converts an ECP2 point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP2 instance to be converted to affine form
+ */
+extern void ECP2_affine(ECP2 *P);
+/**	@brief Extract x and y coordinates of an ECP2 point P
+ *
+	If x=y, returns only x
+	@param x FP2 on exit = x coordinate of point
+	@param y FP2 on exit = y coordinate of point (unless x=y)
+	@param P ECP2 instance (x,y)
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP2_get(BLS12461::FP2 *x, BLS12461::FP2 *y, ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, converted to affine coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_output(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, in projective coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_outputxyz(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to an octet string
+ *
+	The octet string is created in the form x|y or just x if compressed
+	Convert the real and imaginary parts of the x and y coordinates to big-endian base 256 form.
+    If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param S output octet string
+	@param P ECP2 instance to be converted to an octet string
+    @param c true for compression
+ */
+extern void ECP2_toOctet(octet *S, ECP2 *P, bool c);
+/**	@brief Creates an ECP2 point from an octet string
+ *
+	The octet string is in the form x|y
+	The real and imaginary parts of the x and y coordinates are in big-endian base 256 form.
+    If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP2 instance to be created from the octet string
+	@param S input octet string
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP2_fromOctet(ECP2 *P, octet *S);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x)=x^3+Ax+B
+	Used internally.
+	@param r FP2 value of f(x)
+	@param x FP2 instance
+ */
+extern void ECP2_rhs(BLS12461::FP2 *r, BLS12461::FP2 *x);
+/**	@brief Set ECP2 to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP2 instance to be set (x,y)
+	@param x FP2 x coordinate of point
+	@param y FP2 y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_set(ECP2 *P, BLS12461::FP2 *x, BLS12461::FP2 *y);
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Otherwise y coordinate is calculated from x.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+    @param s sign of y
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_setx(ECP2 *P, BLS12461::FP2 *x, int s);
+/**	@brief Negation of an ECP2 point
+ *
+	@param P ECP2 instance, on exit = -P
+ */
+extern void ECP2_neg(ECP2 *P);
+/**	@brief Doubles an ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =2*P
+ */
+extern int ECP2_dbl(ECP2 *P);
+/**	@brief Adds ECP2 instance Q to ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P+Q
+	@param Q ECP2 instance to be added to P
+ */
+extern int ECP2_add(ECP2 *P, ECP2 *Q);
+/**	@brief Subtracts ECP instance Q from ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P-Q
+	@param Q ECP2 instance to be subtracted from P
+ */
+extern void ECP2_sub(ECP2 *P, ECP2 *Q);
+/**	@brief Multiplies an ECP2 instance P by a BIG, side-channel resistant
+ *
+	Uses fixed sized windows.
+	@param P ECP2 instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP2_mul(ECP2 *P, B464_28::BIG b);
+/**	@brief Multiplies an ECP2 instance P by the internal modulus p, using precalculated Frobenius constant f
+ *
+	Fast point multiplication using Frobenius
+	@param P ECP2 instance, on exit = p*P
+	@param f FP2 precalculated Frobenius constant
+
+ */
+extern void ECP2_frob(ECP2 *P, BLS12461::FP2 *f);
+/**	@brief Calculates P=b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+ *
+	@param P ECP2 instance, on exit = b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+	@param Q ECP2 array of 4 points
+	@param b BIG array of 4 multipliers
+ */
+extern void ECP2_mul4(ECP2 *P, ECP2 *Q, B464_28::BIG *b);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP2 multiplied by co-factor
+ */
+extern void ECP2_cfp(ECP2 *Q);
+
+/**	@brief Maps random FP2 to curve point in constant time
+ *
+	@param Q ECP2 instance 
+	@param x FP2 derived from hash
+ */
+extern void ECP2_map2point(ECP2 *Q, BLS12461::FP2 *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP2 instance 
+	@param x Fp derived from hash
+ */
+extern void ECP2_hap2point(ECP2 *Q, B464_28::BIG  x);
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param P ECP2 instance of correct order
+	@param W OCTET byte array to be mapped
+ */
+extern void ECP2_mapit(ECP2 *P, octet *w);
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP2 instance
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_generator(ECP2 *G);
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp2_BN158.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp2_BN158.h
new file mode 100644
index 0000000..3772bd9
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp2_BN158.h
@@ -0,0 +1,249 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP2_BN158_H
+#define ECP2_BN158_H
+
+#include "fp2_BN158.h"
+#include "config_curve_BN158.h"
+
+using namespace core;
+
+
+namespace BN158 {
+
+extern const B160_28::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B160_28::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+}
+
+namespace BN158 {
+
+/**
+	@brief ECP2 Structure - Elliptic Curve Point over quadratic extension field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag */
+    BN158::FP2 x;   /**< x-coordinate of point */
+    BN158::FP2 y;   /**< y-coordinate of point */
+    BN158::FP2 z;   /**< z-coordinate of point */
+} ECP2;
+
+
+/* Curve Params - see rom*.cpp */
+
+extern const int CURVE_B_I;		/**< Elliptic curve B parameter */
+extern const B160_28::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B160_28::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B160_28::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B160_28::BIG CURVE_Bnx;   /**< Elliptic curve parameter */
+extern const B160_28::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+
+/* Generator point on G1 */
+extern const B160_28::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B160_28::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B160_28::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B160_28::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B160_28::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B160_28::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+/* ECP2 E(Fp2) prototypes */
+/**	@brief Tests for ECP2 point equal to infinity
+ *
+	@param P ECP2 point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP2_isinf(ECP2 *P);
+/**	@brief Copy ECP2 point to another ECP2 point
+ *
+	@param P ECP2 instance, on exit = Q
+	@param Q ECP2 instance to be copied
+ */
+extern void ECP2_copy(ECP2 *P, ECP2 *Q);
+/**	@brief Set ECP2 to point-at-infinity
+ *
+	@param P ECP2 instance to be set to infinity
+ */
+extern void ECP2_inf(ECP2 *P);
+/**	@brief Tests for equality of two ECP2s
+ *
+	@param P ECP2 instance to be compared
+	@param Q ECP2 instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP2_equals(ECP2 *P, ECP2 *Q);
+/**	@brief Converts an ECP2 point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP2 instance to be converted to affine form
+ */
+extern void ECP2_affine(ECP2 *P);
+/**	@brief Extract x and y coordinates of an ECP2 point P
+ *
+	If x=y, returns only x
+	@param x FP2 on exit = x coordinate of point
+	@param y FP2 on exit = y coordinate of point (unless x=y)
+	@param P ECP2 instance (x,y)
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP2_get(BN158::FP2 *x, BN158::FP2 *y, ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, converted to affine coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_output(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, in projective coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_outputxyz(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to an octet string
+ *
+	The octet string is created in the form x|y or just x if compressed
+	Convert the real and imaginary parts of the x and y coordinates to big-endian base 256 form.
+    If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param S output octet string
+	@param P ECP2 instance to be converted to an octet string
+    @param c true for compression
+ */
+extern void ECP2_toOctet(octet *S, ECP2 *P, bool c);
+/**	@brief Creates an ECP2 point from an octet string
+ *
+	The octet string is in the form x|y
+	The real and imaginary parts of the x and y coordinates are in big-endian base 256 form.
+    If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP2 instance to be created from the octet string
+	@param S input octet string
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP2_fromOctet(ECP2 *P, octet *S);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x)=x^3+Ax+B
+	Used internally.
+	@param r FP2 value of f(x)
+	@param x FP2 instance
+ */
+extern void ECP2_rhs(BN158::FP2 *r, BN158::FP2 *x);
+/**	@brief Set ECP2 to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP2 instance to be set (x,y)
+	@param x FP2 x coordinate of point
+	@param y FP2 y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_set(ECP2 *P, BN158::FP2 *x, BN158::FP2 *y);
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Otherwise y coordinate is calculated from x.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+    @param s sign of y
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_setx(ECP2 *P, BN158::FP2 *x, int s);
+/**	@brief Negation of an ECP2 point
+ *
+	@param P ECP2 instance, on exit = -P
+ */
+extern void ECP2_neg(ECP2 *P);
+/**	@brief Doubles an ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =2*P
+ */
+extern int ECP2_dbl(ECP2 *P);
+/**	@brief Adds ECP2 instance Q to ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P+Q
+	@param Q ECP2 instance to be added to P
+ */
+extern int ECP2_add(ECP2 *P, ECP2 *Q);
+/**	@brief Subtracts ECP instance Q from ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P-Q
+	@param Q ECP2 instance to be subtracted from P
+ */
+extern void ECP2_sub(ECP2 *P, ECP2 *Q);
+/**	@brief Multiplies an ECP2 instance P by a BIG, side-channel resistant
+ *
+	Uses fixed sized windows.
+	@param P ECP2 instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP2_mul(ECP2 *P, B160_28::BIG b);
+/**	@brief Multiplies an ECP2 instance P by the internal modulus p, using precalculated Frobenius constant f
+ *
+	Fast point multiplication using Frobenius
+	@param P ECP2 instance, on exit = p*P
+	@param f FP2 precalculated Frobenius constant
+
+ */
+extern void ECP2_frob(ECP2 *P, BN158::FP2 *f);
+/**	@brief Calculates P=b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+ *
+	@param P ECP2 instance, on exit = b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+	@param Q ECP2 array of 4 points
+	@param b BIG array of 4 multipliers
+ */
+extern void ECP2_mul4(ECP2 *P, ECP2 *Q, B160_28::BIG *b);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP2 multiplied by co-factor
+ */
+extern void ECP2_cfp(ECP2 *Q);
+
+/**	@brief Maps random FP2 to curve point in constant time
+ *
+	@param Q ECP2 instance 
+	@param x FP2 derived from hash
+ */
+extern void ECP2_map2point(ECP2 *Q, BN158::FP2 *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP2 instance 
+	@param x Fp derived from hash
+ */
+extern void ECP2_hap2point(ECP2 *Q, B160_28::BIG  x);
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param P ECP2 instance of correct order
+	@param W OCTET byte array to be mapped
+ */
+extern void ECP2_mapit(ECP2 *P, octet *w);
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP2 instance
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_generator(ECP2 *G);
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp2_BN254.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp2_BN254.h
new file mode 100644
index 0000000..8178829
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp2_BN254.h
@@ -0,0 +1,249 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP2_BN254_H
+#define ECP2_BN254_H
+
+#include "fp2_BN254.h"
+#include "config_curve_BN254.h"
+
+using namespace core;
+
+
+namespace BN254 {
+
+extern const B256_28::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_28::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+}
+
+namespace BN254 {
+
+/**
+	@brief ECP2 Structure - Elliptic Curve Point over quadratic extension field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag */
+    BN254::FP2 x;   /**< x-coordinate of point */
+    BN254::FP2 y;   /**< y-coordinate of point */
+    BN254::FP2 z;   /**< z-coordinate of point */
+} ECP2;
+
+
+/* Curve Params - see rom*.cpp */
+
+extern const int CURVE_B_I;		/**< Elliptic curve B parameter */
+extern const B256_28::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_28::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_28::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_28::BIG CURVE_Bnx;   /**< Elliptic curve parameter */
+extern const B256_28::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+
+/* Generator point on G1 */
+extern const B256_28::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_28::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_28::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+/* ECP2 E(Fp2) prototypes */
+/**	@brief Tests for ECP2 point equal to infinity
+ *
+	@param P ECP2 point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP2_isinf(ECP2 *P);
+/**	@brief Copy ECP2 point to another ECP2 point
+ *
+	@param P ECP2 instance, on exit = Q
+	@param Q ECP2 instance to be copied
+ */
+extern void ECP2_copy(ECP2 *P, ECP2 *Q);
+/**	@brief Set ECP2 to point-at-infinity
+ *
+	@param P ECP2 instance to be set to infinity
+ */
+extern void ECP2_inf(ECP2 *P);
+/**	@brief Tests for equality of two ECP2s
+ *
+	@param P ECP2 instance to be compared
+	@param Q ECP2 instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP2_equals(ECP2 *P, ECP2 *Q);
+/**	@brief Converts an ECP2 point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP2 instance to be converted to affine form
+ */
+extern void ECP2_affine(ECP2 *P);
+/**	@brief Extract x and y coordinates of an ECP2 point P
+ *
+	If x=y, returns only x
+	@param x FP2 on exit = x coordinate of point
+	@param y FP2 on exit = y coordinate of point (unless x=y)
+	@param P ECP2 instance (x,y)
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP2_get(BN254::FP2 *x, BN254::FP2 *y, ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, converted to affine coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_output(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, in projective coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_outputxyz(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to an octet string
+ *
+	The octet string is created in the form x|y or just x if compressed
+	Convert the real and imaginary parts of the x and y coordinates to big-endian base 256 form.
+    If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param S output octet string
+	@param P ECP2 instance to be converted to an octet string
+    @param c true for compression
+ */
+extern void ECP2_toOctet(octet *S, ECP2 *P, bool c);
+/**	@brief Creates an ECP2 point from an octet string
+ *
+	The octet string is in the form x|y
+	The real and imaginary parts of the x and y coordinates are in big-endian base 256 form.
+    If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP2 instance to be created from the octet string
+	@param S input octet string
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP2_fromOctet(ECP2 *P, octet *S);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x)=x^3+Ax+B
+	Used internally.
+	@param r FP2 value of f(x)
+	@param x FP2 instance
+ */
+extern void ECP2_rhs(BN254::FP2 *r, BN254::FP2 *x);
+/**	@brief Set ECP2 to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP2 instance to be set (x,y)
+	@param x FP2 x coordinate of point
+	@param y FP2 y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_set(ECP2 *P, BN254::FP2 *x, BN254::FP2 *y);
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Otherwise y coordinate is calculated from x.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+    @param s sign of y
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_setx(ECP2 *P, BN254::FP2 *x, int s);
+/**	@brief Negation of an ECP2 point
+ *
+	@param P ECP2 instance, on exit = -P
+ */
+extern void ECP2_neg(ECP2 *P);
+/**	@brief Doubles an ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =2*P
+ */
+extern int ECP2_dbl(ECP2 *P);
+/**	@brief Adds ECP2 instance Q to ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P+Q
+	@param Q ECP2 instance to be added to P
+ */
+extern int ECP2_add(ECP2 *P, ECP2 *Q);
+/**	@brief Subtracts ECP instance Q from ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P-Q
+	@param Q ECP2 instance to be subtracted from P
+ */
+extern void ECP2_sub(ECP2 *P, ECP2 *Q);
+/**	@brief Multiplies an ECP2 instance P by a BIG, side-channel resistant
+ *
+	Uses fixed sized windows.
+	@param P ECP2 instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP2_mul(ECP2 *P, B256_28::BIG b);
+/**	@brief Multiplies an ECP2 instance P by the internal modulus p, using precalculated Frobenius constant f
+ *
+	Fast point multiplication using Frobenius
+	@param P ECP2 instance, on exit = p*P
+	@param f FP2 precalculated Frobenius constant
+
+ */
+extern void ECP2_frob(ECP2 *P, BN254::FP2 *f);
+/**	@brief Calculates P=b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+ *
+	@param P ECP2 instance, on exit = b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+	@param Q ECP2 array of 4 points
+	@param b BIG array of 4 multipliers
+ */
+extern void ECP2_mul4(ECP2 *P, ECP2 *Q, B256_28::BIG *b);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP2 multiplied by co-factor
+ */
+extern void ECP2_cfp(ECP2 *Q);
+
+/**	@brief Maps random FP2 to curve point in constant time
+ *
+	@param Q ECP2 instance 
+	@param x FP2 derived from hash
+ */
+extern void ECP2_map2point(ECP2 *Q, BN254::FP2 *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP2 instance 
+	@param x Fp derived from hash
+ */
+extern void ECP2_hap2point(ECP2 *Q, B256_28::BIG  x);
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param P ECP2 instance of correct order
+	@param W OCTET byte array to be mapped
+ */
+extern void ECP2_mapit(ECP2 *P, octet *w);
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP2 instance
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_generator(ECP2 *G);
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp2_BN254CX.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp2_BN254CX.h
new file mode 100644
index 0000000..3913d79
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp2_BN254CX.h
@@ -0,0 +1,249 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP2_BN254CX_H
+#define ECP2_BN254CX_H
+
+#include "fp2_BN254CX.h"
+#include "config_curve_BN254CX.h"
+
+using namespace core;
+
+
+namespace BN254CX {
+
+extern const B256_28::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_28::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+}
+
+namespace BN254CX {
+
+/**
+	@brief ECP2 Structure - Elliptic Curve Point over quadratic extension field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag */
+    BN254CX::FP2 x;   /**< x-coordinate of point */
+    BN254CX::FP2 y;   /**< y-coordinate of point */
+    BN254CX::FP2 z;   /**< z-coordinate of point */
+} ECP2;
+
+
+/* Curve Params - see rom*.cpp */
+
+extern const int CURVE_B_I;		/**< Elliptic curve B parameter */
+extern const B256_28::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_28::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_28::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_28::BIG CURVE_Bnx;   /**< Elliptic curve parameter */
+extern const B256_28::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+
+/* Generator point on G1 */
+extern const B256_28::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_28::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_28::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+/* ECP2 E(Fp2) prototypes */
+/**	@brief Tests for ECP2 point equal to infinity
+ *
+	@param P ECP2 point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP2_isinf(ECP2 *P);
+/**	@brief Copy ECP2 point to another ECP2 point
+ *
+	@param P ECP2 instance, on exit = Q
+	@param Q ECP2 instance to be copied
+ */
+extern void ECP2_copy(ECP2 *P, ECP2 *Q);
+/**	@brief Set ECP2 to point-at-infinity
+ *
+	@param P ECP2 instance to be set to infinity
+ */
+extern void ECP2_inf(ECP2 *P);
+/**	@brief Tests for equality of two ECP2s
+ *
+	@param P ECP2 instance to be compared
+	@param Q ECP2 instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP2_equals(ECP2 *P, ECP2 *Q);
+/**	@brief Converts an ECP2 point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP2 instance to be converted to affine form
+ */
+extern void ECP2_affine(ECP2 *P);
+/**	@brief Extract x and y coordinates of an ECP2 point P
+ *
+	If x=y, returns only x
+	@param x FP2 on exit = x coordinate of point
+	@param y FP2 on exit = y coordinate of point (unless x=y)
+	@param P ECP2 instance (x,y)
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP2_get(BN254CX::FP2 *x, BN254CX::FP2 *y, ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, converted to affine coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_output(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, in projective coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_outputxyz(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to an octet string
+ *
+	The octet string is created in the form x|y or just x if compressed
+	Convert the real and imaginary parts of the x and y coordinates to big-endian base 256 form.
+    If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param S output octet string
+	@param P ECP2 instance to be converted to an octet string
+    @param c true for compression
+ */
+extern void ECP2_toOctet(octet *S, ECP2 *P, bool c);
+/**	@brief Creates an ECP2 point from an octet string
+ *
+	The octet string is in the form x|y
+	The real and imaginary parts of the x and y coordinates are in big-endian base 256 form.
+    If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP2 instance to be created from the octet string
+	@param S input octet string
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP2_fromOctet(ECP2 *P, octet *S);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x)=x^3+Ax+B
+	Used internally.
+	@param r FP2 value of f(x)
+	@param x FP2 instance
+ */
+extern void ECP2_rhs(BN254CX::FP2 *r, BN254CX::FP2 *x);
+/**	@brief Set ECP2 to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP2 instance to be set (x,y)
+	@param x FP2 x coordinate of point
+	@param y FP2 y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_set(ECP2 *P, BN254CX::FP2 *x, BN254CX::FP2 *y);
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Otherwise y coordinate is calculated from x.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+    @param s sign of y
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_setx(ECP2 *P, BN254CX::FP2 *x, int s);
+/**	@brief Negation of an ECP2 point
+ *
+	@param P ECP2 instance, on exit = -P
+ */
+extern void ECP2_neg(ECP2 *P);
+/**	@brief Doubles an ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =2*P
+ */
+extern int ECP2_dbl(ECP2 *P);
+/**	@brief Adds ECP2 instance Q to ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P+Q
+	@param Q ECP2 instance to be added to P
+ */
+extern int ECP2_add(ECP2 *P, ECP2 *Q);
+/**	@brief Subtracts ECP instance Q from ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P-Q
+	@param Q ECP2 instance to be subtracted from P
+ */
+extern void ECP2_sub(ECP2 *P, ECP2 *Q);
+/**	@brief Multiplies an ECP2 instance P by a BIG, side-channel resistant
+ *
+	Uses fixed sized windows.
+	@param P ECP2 instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP2_mul(ECP2 *P, B256_28::BIG b);
+/**	@brief Multiplies an ECP2 instance P by the internal modulus p, using precalculated Frobenius constant f
+ *
+	Fast point multiplication using Frobenius
+	@param P ECP2 instance, on exit = p*P
+	@param f FP2 precalculated Frobenius constant
+
+ */
+extern void ECP2_frob(ECP2 *P, BN254CX::FP2 *f);
+/**	@brief Calculates P=b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+ *
+	@param P ECP2 instance, on exit = b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+	@param Q ECP2 array of 4 points
+	@param b BIG array of 4 multipliers
+ */
+extern void ECP2_mul4(ECP2 *P, ECP2 *Q, B256_28::BIG *b);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP2 multiplied by co-factor
+ */
+extern void ECP2_cfp(ECP2 *Q);
+
+/**	@brief Maps random FP2 to curve point in constant time
+ *
+	@param Q ECP2 instance 
+	@param x FP2 derived from hash
+ */
+extern void ECP2_map2point(ECP2 *Q, BN254CX::FP2 *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP2 instance 
+	@param x Fp derived from hash
+ */
+extern void ECP2_hap2point(ECP2 *Q, B256_28::BIG  x);
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param P ECP2 instance of correct order
+	@param W OCTET byte array to be mapped
+ */
+extern void ECP2_mapit(ECP2 *P, octet *w);
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP2 instance
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_generator(ECP2 *G);
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp2_BN462.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp2_BN462.h
new file mode 100644
index 0000000..ac9b083
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp2_BN462.h
@@ -0,0 +1,249 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP2_BN462_H
+#define ECP2_BN462_H
+
+#include "fp2_BN462.h"
+#include "config_curve_BN462.h"
+
+using namespace core;
+
+
+namespace BN462 {
+
+extern const B464_28::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B464_28::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+}
+
+namespace BN462 {
+
+/**
+	@brief ECP2 Structure - Elliptic Curve Point over quadratic extension field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag */
+    BN462::FP2 x;   /**< x-coordinate of point */
+    BN462::FP2 y;   /**< y-coordinate of point */
+    BN462::FP2 z;   /**< z-coordinate of point */
+} ECP2;
+
+
+/* Curve Params - see rom*.cpp */
+
+extern const int CURVE_B_I;		/**< Elliptic curve B parameter */
+extern const B464_28::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B464_28::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B464_28::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B464_28::BIG CURVE_Bnx;   /**< Elliptic curve parameter */
+extern const B464_28::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+
+/* Generator point on G1 */
+extern const B464_28::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B464_28::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B464_28::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B464_28::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B464_28::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B464_28::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+/* ECP2 E(Fp2) prototypes */
+/**	@brief Tests for ECP2 point equal to infinity
+ *
+	@param P ECP2 point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP2_isinf(ECP2 *P);
+/**	@brief Copy ECP2 point to another ECP2 point
+ *
+	@param P ECP2 instance, on exit = Q
+	@param Q ECP2 instance to be copied
+ */
+extern void ECP2_copy(ECP2 *P, ECP2 *Q);
+/**	@brief Set ECP2 to point-at-infinity
+ *
+	@param P ECP2 instance to be set to infinity
+ */
+extern void ECP2_inf(ECP2 *P);
+/**	@brief Tests for equality of two ECP2s
+ *
+	@param P ECP2 instance to be compared
+	@param Q ECP2 instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP2_equals(ECP2 *P, ECP2 *Q);
+/**	@brief Converts an ECP2 point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP2 instance to be converted to affine form
+ */
+extern void ECP2_affine(ECP2 *P);
+/**	@brief Extract x and y coordinates of an ECP2 point P
+ *
+	If x=y, returns only x
+	@param x FP2 on exit = x coordinate of point
+	@param y FP2 on exit = y coordinate of point (unless x=y)
+	@param P ECP2 instance (x,y)
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP2_get(BN462::FP2 *x, BN462::FP2 *y, ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, converted to affine coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_output(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, in projective coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_outputxyz(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to an octet string
+ *
+	The octet string is created in the form x|y or just x if compressed
+	Convert the real and imaginary parts of the x and y coordinates to big-endian base 256 form.
+    If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param S output octet string
+	@param P ECP2 instance to be converted to an octet string
+    @param c true for compression
+ */
+extern void ECP2_toOctet(octet *S, ECP2 *P, bool c);
+/**	@brief Creates an ECP2 point from an octet string
+ *
+	The octet string is in the form x|y
+	The real and imaginary parts of the x and y coordinates are in big-endian base 256 form.
+    If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP2 instance to be created from the octet string
+	@param S input octet string
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP2_fromOctet(ECP2 *P, octet *S);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x)=x^3+Ax+B
+	Used internally.
+	@param r FP2 value of f(x)
+	@param x FP2 instance
+ */
+extern void ECP2_rhs(BN462::FP2 *r, BN462::FP2 *x);
+/**	@brief Set ECP2 to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP2 instance to be set (x,y)
+	@param x FP2 x coordinate of point
+	@param y FP2 y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_set(ECP2 *P, BN462::FP2 *x, BN462::FP2 *y);
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Otherwise y coordinate is calculated from x.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+    @param s sign of y
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_setx(ECP2 *P, BN462::FP2 *x, int s);
+/**	@brief Negation of an ECP2 point
+ *
+	@param P ECP2 instance, on exit = -P
+ */
+extern void ECP2_neg(ECP2 *P);
+/**	@brief Doubles an ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =2*P
+ */
+extern int ECP2_dbl(ECP2 *P);
+/**	@brief Adds ECP2 instance Q to ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P+Q
+	@param Q ECP2 instance to be added to P
+ */
+extern int ECP2_add(ECP2 *P, ECP2 *Q);
+/**	@brief Subtracts ECP instance Q from ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P-Q
+	@param Q ECP2 instance to be subtracted from P
+ */
+extern void ECP2_sub(ECP2 *P, ECP2 *Q);
+/**	@brief Multiplies an ECP2 instance P by a BIG, side-channel resistant
+ *
+	Uses fixed sized windows.
+	@param P ECP2 instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP2_mul(ECP2 *P, B464_28::BIG b);
+/**	@brief Multiplies an ECP2 instance P by the internal modulus p, using precalculated Frobenius constant f
+ *
+	Fast point multiplication using Frobenius
+	@param P ECP2 instance, on exit = p*P
+	@param f FP2 precalculated Frobenius constant
+
+ */
+extern void ECP2_frob(ECP2 *P, BN462::FP2 *f);
+/**	@brief Calculates P=b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+ *
+	@param P ECP2 instance, on exit = b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+	@param Q ECP2 array of 4 points
+	@param b BIG array of 4 multipliers
+ */
+extern void ECP2_mul4(ECP2 *P, ECP2 *Q, B464_28::BIG *b);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP2 multiplied by co-factor
+ */
+extern void ECP2_cfp(ECP2 *Q);
+
+/**	@brief Maps random FP2 to curve point in constant time
+ *
+	@param Q ECP2 instance 
+	@param x FP2 derived from hash
+ */
+extern void ECP2_map2point(ECP2 *Q, BN462::FP2 *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP2 instance 
+	@param x Fp derived from hash
+ */
+extern void ECP2_hap2point(ECP2 *Q, B464_28::BIG  x);
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param P ECP2 instance of correct order
+	@param W OCTET byte array to be mapped
+ */
+extern void ECP2_mapit(ECP2 *P, octet *w);
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP2 instance
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_generator(ECP2 *G);
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp2_FP256BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp2_FP256BN.h
new file mode 100644
index 0000000..9c1c31e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp2_FP256BN.h
@@ -0,0 +1,249 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP2_FP256BN_H
+#define ECP2_FP256BN_H
+
+#include "fp2_FP256BN.h"
+#include "config_curve_FP256BN.h"
+
+using namespace core;
+
+
+namespace FP256BN {
+
+extern const B256_28::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_28::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+}
+
+namespace FP256BN {
+
+/**
+	@brief ECP2 Structure - Elliptic Curve Point over quadratic extension field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag */
+    FP256BN::FP2 x;   /**< x-coordinate of point */
+    FP256BN::FP2 y;   /**< y-coordinate of point */
+    FP256BN::FP2 z;   /**< z-coordinate of point */
+} ECP2;
+
+
+/* Curve Params - see rom*.cpp */
+
+extern const int CURVE_B_I;		/**< Elliptic curve B parameter */
+extern const B256_28::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_28::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_28::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_28::BIG CURVE_Bnx;   /**< Elliptic curve parameter */
+extern const B256_28::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+
+/* Generator point on G1 */
+extern const B256_28::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_28::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_28::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+/* ECP2 E(Fp2) prototypes */
+/**	@brief Tests for ECP2 point equal to infinity
+ *
+	@param P ECP2 point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP2_isinf(ECP2 *P);
+/**	@brief Copy ECP2 point to another ECP2 point
+ *
+	@param P ECP2 instance, on exit = Q
+	@param Q ECP2 instance to be copied
+ */
+extern void ECP2_copy(ECP2 *P, ECP2 *Q);
+/**	@brief Set ECP2 to point-at-infinity
+ *
+	@param P ECP2 instance to be set to infinity
+ */
+extern void ECP2_inf(ECP2 *P);
+/**	@brief Tests for equality of two ECP2s
+ *
+	@param P ECP2 instance to be compared
+	@param Q ECP2 instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP2_equals(ECP2 *P, ECP2 *Q);
+/**	@brief Converts an ECP2 point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP2 instance to be converted to affine form
+ */
+extern void ECP2_affine(ECP2 *P);
+/**	@brief Extract x and y coordinates of an ECP2 point P
+ *
+	If x=y, returns only x
+	@param x FP2 on exit = x coordinate of point
+	@param y FP2 on exit = y coordinate of point (unless x=y)
+	@param P ECP2 instance (x,y)
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP2_get(FP256BN::FP2 *x, FP256BN::FP2 *y, ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, converted to affine coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_output(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, in projective coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_outputxyz(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to an octet string
+ *
+	The octet string is created in the form x|y or just x if compressed
+	Convert the real and imaginary parts of the x and y coordinates to big-endian base 256 form.
+    If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param S output octet string
+	@param P ECP2 instance to be converted to an octet string
+    @param c true for compression
+ */
+extern void ECP2_toOctet(octet *S, ECP2 *P, bool c);
+/**	@brief Creates an ECP2 point from an octet string
+ *
+	The octet string is in the form x|y
+	The real and imaginary parts of the x and y coordinates are in big-endian base 256 form.
+    If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP2 instance to be created from the octet string
+	@param S input octet string
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP2_fromOctet(ECP2 *P, octet *S);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x)=x^3+Ax+B
+	Used internally.
+	@param r FP2 value of f(x)
+	@param x FP2 instance
+ */
+extern void ECP2_rhs(FP256BN::FP2 *r, FP256BN::FP2 *x);
+/**	@brief Set ECP2 to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP2 instance to be set (x,y)
+	@param x FP2 x coordinate of point
+	@param y FP2 y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_set(ECP2 *P, FP256BN::FP2 *x, FP256BN::FP2 *y);
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Otherwise y coordinate is calculated from x.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+    @param s sign of y
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_setx(ECP2 *P, FP256BN::FP2 *x, int s);
+/**	@brief Negation of an ECP2 point
+ *
+	@param P ECP2 instance, on exit = -P
+ */
+extern void ECP2_neg(ECP2 *P);
+/**	@brief Doubles an ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =2*P
+ */
+extern int ECP2_dbl(ECP2 *P);
+/**	@brief Adds ECP2 instance Q to ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P+Q
+	@param Q ECP2 instance to be added to P
+ */
+extern int ECP2_add(ECP2 *P, ECP2 *Q);
+/**	@brief Subtracts ECP instance Q from ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P-Q
+	@param Q ECP2 instance to be subtracted from P
+ */
+extern void ECP2_sub(ECP2 *P, ECP2 *Q);
+/**	@brief Multiplies an ECP2 instance P by a BIG, side-channel resistant
+ *
+	Uses fixed sized windows.
+	@param P ECP2 instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP2_mul(ECP2 *P, B256_28::BIG b);
+/**	@brief Multiplies an ECP2 instance P by the internal modulus p, using precalculated Frobenius constant f
+ *
+	Fast point multiplication using Frobenius
+	@param P ECP2 instance, on exit = p*P
+	@param f FP2 precalculated Frobenius constant
+
+ */
+extern void ECP2_frob(ECP2 *P, FP256BN::FP2 *f);
+/**	@brief Calculates P=b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+ *
+	@param P ECP2 instance, on exit = b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+	@param Q ECP2 array of 4 points
+	@param b BIG array of 4 multipliers
+ */
+extern void ECP2_mul4(ECP2 *P, ECP2 *Q, B256_28::BIG *b);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP2 multiplied by co-factor
+ */
+extern void ECP2_cfp(ECP2 *Q);
+
+/**	@brief Maps random FP2 to curve point in constant time
+ *
+	@param Q ECP2 instance 
+	@param x FP2 derived from hash
+ */
+extern void ECP2_map2point(ECP2 *Q, FP256BN::FP2 *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP2 instance 
+	@param x Fp derived from hash
+ */
+extern void ECP2_hap2point(ECP2 *Q, B256_28::BIG  x);
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param P ECP2 instance of correct order
+	@param W OCTET byte array to be mapped
+ */
+extern void ECP2_mapit(ECP2 *P, octet *w);
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP2 instance
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_generator(ECP2 *G);
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp2_FP512BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp2_FP512BN.h
new file mode 100644
index 0000000..ec7ebd2
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp2_FP512BN.h
@@ -0,0 +1,249 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP2_FP512BN_H
+#define ECP2_FP512BN_H
+
+#include "fp2_FP512BN.h"
+#include "config_curve_FP512BN.h"
+
+using namespace core;
+
+
+namespace FP512BN {
+
+extern const B512_29::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B512_29::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+}
+
+namespace FP512BN {
+
+/**
+	@brief ECP2 Structure - Elliptic Curve Point over quadratic extension field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag */
+    FP512BN::FP2 x;   /**< x-coordinate of point */
+    FP512BN::FP2 y;   /**< y-coordinate of point */
+    FP512BN::FP2 z;   /**< z-coordinate of point */
+} ECP2;
+
+
+/* Curve Params - see rom*.cpp */
+
+extern const int CURVE_B_I;		/**< Elliptic curve B parameter */
+extern const B512_29::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B512_29::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B512_29::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B512_29::BIG CURVE_Bnx;   /**< Elliptic curve parameter */
+extern const B512_29::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+
+/* Generator point on G1 */
+extern const B512_29::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B512_29::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B512_29::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_29::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B512_29::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_29::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+/* ECP2 E(Fp2) prototypes */
+/**	@brief Tests for ECP2 point equal to infinity
+ *
+	@param P ECP2 point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP2_isinf(ECP2 *P);
+/**	@brief Copy ECP2 point to another ECP2 point
+ *
+	@param P ECP2 instance, on exit = Q
+	@param Q ECP2 instance to be copied
+ */
+extern void ECP2_copy(ECP2 *P, ECP2 *Q);
+/**	@brief Set ECP2 to point-at-infinity
+ *
+	@param P ECP2 instance to be set to infinity
+ */
+extern void ECP2_inf(ECP2 *P);
+/**	@brief Tests for equality of two ECP2s
+ *
+	@param P ECP2 instance to be compared
+	@param Q ECP2 instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP2_equals(ECP2 *P, ECP2 *Q);
+/**	@brief Converts an ECP2 point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP2 instance to be converted to affine form
+ */
+extern void ECP2_affine(ECP2 *P);
+/**	@brief Extract x and y coordinates of an ECP2 point P
+ *
+	If x=y, returns only x
+	@param x FP2 on exit = x coordinate of point
+	@param y FP2 on exit = y coordinate of point (unless x=y)
+	@param P ECP2 instance (x,y)
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP2_get(FP512BN::FP2 *x, FP512BN::FP2 *y, ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, converted to affine coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_output(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, in projective coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_outputxyz(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to an octet string
+ *
+	The octet string is created in the form x|y or just x if compressed
+	Convert the real and imaginary parts of the x and y coordinates to big-endian base 256 form.
+    If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param S output octet string
+	@param P ECP2 instance to be converted to an octet string
+    @param c true for compression
+ */
+extern void ECP2_toOctet(octet *S, ECP2 *P, bool c);
+/**	@brief Creates an ECP2 point from an octet string
+ *
+	The octet string is in the form x|y
+	The real and imaginary parts of the x and y coordinates are in big-endian base 256 form.
+    If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP2 instance to be created from the octet string
+	@param S input octet string
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP2_fromOctet(ECP2 *P, octet *S);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x)=x^3+Ax+B
+	Used internally.
+	@param r FP2 value of f(x)
+	@param x FP2 instance
+ */
+extern void ECP2_rhs(FP512BN::FP2 *r, FP512BN::FP2 *x);
+/**	@brief Set ECP2 to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP2 instance to be set (x,y)
+	@param x FP2 x coordinate of point
+	@param y FP2 y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_set(ECP2 *P, FP512BN::FP2 *x, FP512BN::FP2 *y);
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Otherwise y coordinate is calculated from x.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+    @param s sign of y
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_setx(ECP2 *P, FP512BN::FP2 *x, int s);
+/**	@brief Negation of an ECP2 point
+ *
+	@param P ECP2 instance, on exit = -P
+ */
+extern void ECP2_neg(ECP2 *P);
+/**	@brief Doubles an ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =2*P
+ */
+extern int ECP2_dbl(ECP2 *P);
+/**	@brief Adds ECP2 instance Q to ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P+Q
+	@param Q ECP2 instance to be added to P
+ */
+extern int ECP2_add(ECP2 *P, ECP2 *Q);
+/**	@brief Subtracts ECP instance Q from ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P-Q
+	@param Q ECP2 instance to be subtracted from P
+ */
+extern void ECP2_sub(ECP2 *P, ECP2 *Q);
+/**	@brief Multiplies an ECP2 instance P by a BIG, side-channel resistant
+ *
+	Uses fixed sized windows.
+	@param P ECP2 instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP2_mul(ECP2 *P, B512_29::BIG b);
+/**	@brief Multiplies an ECP2 instance P by the internal modulus p, using precalculated Frobenius constant f
+ *
+	Fast point multiplication using Frobenius
+	@param P ECP2 instance, on exit = p*P
+	@param f FP2 precalculated Frobenius constant
+
+ */
+extern void ECP2_frob(ECP2 *P, FP512BN::FP2 *f);
+/**	@brief Calculates P=b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+ *
+	@param P ECP2 instance, on exit = b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+	@param Q ECP2 array of 4 points
+	@param b BIG array of 4 multipliers
+ */
+extern void ECP2_mul4(ECP2 *P, ECP2 *Q, B512_29::BIG *b);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP2 multiplied by co-factor
+ */
+extern void ECP2_cfp(ECP2 *Q);
+
+/**	@brief Maps random FP2 to curve point in constant time
+ *
+	@param Q ECP2 instance 
+	@param x FP2 derived from hash
+ */
+extern void ECP2_map2point(ECP2 *Q, FP512BN::FP2 *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP2 instance 
+	@param x Fp derived from hash
+ */
+extern void ECP2_hap2point(ECP2 *Q, B512_29::BIG  x);
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param P ECP2 instance of correct order
+	@param W OCTET byte array to be mapped
+ */
+extern void ECP2_mapit(ECP2 *P, octet *w);
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP2 instance
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_generator(ECP2 *G);
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp4_BLS24479.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp4_BLS24479.h
new file mode 100644
index 0000000..3a5d0ca
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp4_BLS24479.h
@@ -0,0 +1,268 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP4_BLS24479_H
+#define ECP4_BLS24479_H
+
+#include "fp4_BLS24479.h"
+#include "config_curve_BLS24479.h"
+
+using namespace core;
+
+namespace BLS24479 {
+
+extern const B480_29::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B480_29::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+}
+
+namespace BLS24479 {
+
+/**
+	@brief ECP4 Structure - Elliptic Curve Point over quadratic extension field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag */
+    BLS24479::FP4 x;   /**< x-coordinate of point */
+    BLS24479::FP4 y;   /**< y-coordinate of point */
+    BLS24479::FP4 z;   /**< z-coordinate of point */
+} ECP4;
+
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;		/**< Elliptic curve B parameter */
+extern const B480_29::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B480_29::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B480_29::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B480_29::BIG CURVE_Bnx;   /**< Elliptic curve parameter */
+extern const B480_29::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+
+/* Generator point on G1 */
+extern const B480_29::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B480_29::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B480_29::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B480_29::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B480_29::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B480_29::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B480_29::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B480_29::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B480_29::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B480_29::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/* ECP4 E(FP4) prototypes */
+/**	@brief Tests for ECP4 point equal to infinity
+ *
+	@param P ECP4 point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP4_isinf(ECP4 *P);
+/**	@brief Copy ECP4 point to another ECP4 point
+ *
+	@param P ECP4 instance, on exit = Q
+	@param Q ECP4 instance to be copied
+ */
+extern void ECP4_copy(ECP4 *P, ECP4 *Q);
+/**	@brief Set ECP4 to point-at-infinity
+ *
+	@param P ECP4 instance to be set to infinity
+ */
+extern void ECP4_inf(ECP4 *P);
+/**	@brief Tests for equality of two ECP4s
+ *
+	@param P ECP4 instance to be compared
+	@param Q ECP4 instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP4_equals(ECP4 *P, ECP4 *Q);
+
+/**	@brief Converts an ECP4 point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP4 instance to be converted to affine form
+ */
+extern void ECP4_affine(ECP4 *P);
+
+
+/**	@brief Extract x and y coordinates of an ECP4 point P
+ *
+	If x=y, returns only x
+	@param x FP4 on exit = x coordinate of point
+	@param y FP4 on exit = y coordinate of point (unless x=y)
+	@param P ECP4 instance (x,y)
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP4_get(BLS24479::FP4 *x, BLS24479::FP4 *y, ECP4 *P);
+/**	@brief Formats and outputs an ECP4 point to the console, converted to affine coordinates
+ *
+	@param P ECP4 instance to be printed
+ */
+extern void ECP4_output(ECP4 *P);
+
+/**	@brief Formats and outputs an ECP4 point to an octet string
+ *
+	The octet string is created in the form x|y or just x if compressed
+	Convert the real and imaginary parts of the x and y coordinates to big-endian base 256 form.
+	@param S output octet string
+	@param P ECP4 instance to be converted to an octet string
+    @param c true for compression
+ */
+extern void ECP4_toOctet(octet *S, ECP4 *P, bool c);
+/**	@brief Creates an ECP4 point from an octet string
+ *
+	The octet string is in the form x|y
+	The real and imaginary parts of the x and y coordinates are in big-endian base 256 form.
+	@param P ECP4 instance to be created from the octet string
+	@param S input octet string
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP4_fromOctet(ECP4 *P, octet *S);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x)=x^3+Ax+B
+	Used internally.
+	@param r FP4 value of f(x)
+	@param x FP4 instance
+ */
+extern void ECP4_rhs(BLS24479::FP4 *r, BLS24479::FP4 *x);
+/**	@brief Set ECP4 to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP4 instance to be set (x,y)
+	@param x FP4 x coordinate of point
+	@param y FP4 y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP4_set(ECP4 *P, BLS24479::FP4 *x, BLS24479::FP4 *y);
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Otherwise y coordinate is calculated from x.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+    @param s sign of y
+	@return 1 if point exists, else 0
+ */
+extern int ECP4_setx(ECP4 *P, BLS24479::FP4 *x, int s);
+/**	@brief Negation of an ECP4 point
+ *
+	@param P ECP4 instance, on exit = -P
+ */
+extern void ECP4_neg(ECP4 *P);
+
+/**	@brief Reduction of an ECP4 point
+ *
+	@param P ECP4 instance, on exit (x,y) are reduced wrt the modulus
+ */
+extern void ECP4_reduce(ECP4 *P);
+
+
+/**	@brief Doubles an ECP4 instance P
+ *
+	@param P ECP4 instance, on exit =2*P
+ */
+extern int ECP4_dbl(ECP4 *P);
+/**	@brief Adds ECP4 instance Q to ECP4 instance P
+ *
+	@param P ECP4 instance, on exit =P+Q
+	@param Q ECP4 instance to be added to P
+ */
+extern int ECP4_add(ECP4 *P, ECP4 *Q);
+/**	@brief Subtracts ECP instance Q from ECP4 instance P
+ *
+	@param P ECP4 instance, on exit =P-Q
+	@param Q ECP4 instance to be subtracted from P
+ */
+extern void ECP4_sub(ECP4 *P, ECP4 *Q);
+/**	@brief Multiplies an ECP4 instance P by a BIG, side-channel resistant
+ *
+	Uses fixed sized windows.
+	@param P ECP4 instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP4_mul(ECP4 *P, B480_29::BIG b);
+
+/**	@brief Calculates required Frobenius constants
+ *
+	Calculate Frobenius constants
+	@param F array of FP2 precalculated constants
+
+ */
+extern void ECP4_frob_constants(BLS24479::FP2 F[3]);
+
+/**	@brief Multiplies an ECP4 instance P by the internal modulus p^n, using precalculated Frobenius constants
+ *
+	Fast point multiplication using Frobenius
+	@param P ECP4 instance, on exit = p^n*P
+	@param F array of FP2 precalculated Frobenius constant
+	@param n power of prime
+
+ */
+extern void ECP4_frob(ECP4 *P, BLS24479::FP2 F[3], int n);
+
+/**	@brief Calculates P=Sigma b[i]*Q[i] for i=0 to 7
+ *
+	@param P ECP4 instance, on exit = Sigma b[i]*Q[i] for i=0 to 7
+	@param Q ECP4 array of 4 points
+	@param b BIG array of 4 multipliers
+ */
+extern void ECP4_mul8(ECP4 *P, ECP4 *Q, B480_29::BIG *b);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP4 multiplied by co-factor
+ */
+extern void ECP4_cfp(ECP4 *Q);
+
+/**	@brief Maps random FP4 to curve point in constant time
+ *
+	@param Q ECP4 instance 
+	@param x FP4 derived from hash
+ */
+extern void ECP4_map2point(ECP4 *Q, BLS24479::FP4 *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP4 instance 
+	@param x Fp derived from hash
+ */
+extern void ECP4_hap2point(ECP4 *Q, B480_29::BIG  x);
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param P ECP4 instance of correct order
+	@param W OCTET byte array to be mapped
+ */
+extern void ECP4_mapit(ECP4 *P, octet *W);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP4 instance
+	@return 1 if point exists, else 0
+ */
+extern int ECP4_generator(ECP4 *G);
+
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp8_BLS48286.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp8_BLS48286.h
new file mode 100644
index 0000000..7dc18c4
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp8_BLS48286.h
@@ -0,0 +1,278 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP8_BLS48286_H
+#define ECP8_BLS48286_H
+
+#include "fp8_BLS48286.h"
+#include "config_curve_BLS48286.h"
+
+using namespace core;
+
+namespace BLS48286 {
+
+extern const B288_29::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B288_29::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+}
+
+namespace BLS48286 {
+
+/**
+	@brief ECP8 Structure - Elliptic Curve Point over quadratic extension field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag */
+    BLS48286::FP8 x;   /**< x-coordinate of point */
+    BLS48286::FP8 y;   /**< y-coordinate of point */
+    BLS48286::FP8 z;   /**< z-coordinate of point */
+} ECP8;
+
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;		/**< Elliptic curve B parameter */
+extern const B288_29::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B288_29::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B288_29::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B288_29::BIG CURVE_Bnx;   /**< Elliptic curve parameter */
+extern const B288_29::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+
+/* Generator point on G1 */
+extern const B288_29::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B288_29::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B288_29::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B288_29::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B288_29::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B288_29::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B288_29::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B288_29::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B288_29::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B288_29::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B288_29::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B288_29::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B288_29::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B288_29::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B288_29::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B288_29::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B288_29::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B288_29::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+/* ECP8 E(FP8) prototypes */
+/**	@brief Tests for ECP8 point equal to infinity
+ *
+	@param P ECP8 point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP8_isinf(ECP8 *P);
+/**	@brief Copy ECP8 point to another ECP8 point
+ *
+	@param P ECP8 instance, on exit = Q
+	@param Q ECP8 instance to be copied
+ */
+extern void ECP8_copy(ECP8 *P, ECP8 *Q);
+/**	@brief Set ECP8 to point-at-infinity
+ *
+	@param P ECP8 instance to be set to infinity
+ */
+extern void ECP8_inf(ECP8 *P);
+/**	@brief Tests for equality of two ECP8s
+ *
+	@param P ECP8 instance to be compared
+	@param Q ECP8 instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP8_equals(ECP8 *P, ECP8 *Q);
+
+/**	@brief Converts an ECP8 point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP8 instance to be converted to affine form
+ */
+extern void ECP8_affine(ECP8 *P);
+
+
+/**	@brief Extract x and y coordinates of an ECP8 point P
+ *
+	If x=y, returns only x
+	@param x FP8 on exit = x coordinate of point
+	@param y FP8 on exit = y coordinate of point (unless x=y)
+	@param P ECP8 instance (x,y)
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP8_get(BLS48286::FP8 *x, BLS48286::FP8 *y, ECP8 *P);
+/**	@brief Formats and outputs an ECP8 point to the console, converted to affine coordinates
+ *
+	@param P ECP8 instance to be printed
+ */
+extern void ECP8_output(ECP8 *P);
+
+/**	@brief Formats and outputs an ECP8 point to an octet string
+ *
+	The octet string is created in the form x|y or just x if compressed
+	Convert the real and imaginary parts of the x and y coordinates to big-endian base 256 form.
+	@param S output octet string
+	@param P ECP8 instance to be converted to an octet string
+    @param c true for compression
+ */
+extern void ECP8_toOctet(octet *S, ECP8 *P, bool c);
+/**	@brief Creates an ECP8 point from an octet string
+ *
+	The octet string is in the form x|y
+	The real and imaginary parts of the x and y coordinates are in big-endian base 256 form.
+	@param P ECP8 instance to be created from the octet string
+	@param S input octet string
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP8_fromOctet(ECP8 *P, octet *S);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x)=x^3+Ax+B
+	Used internally.
+	@param r FP8 value of f(x)
+	@param x FP8 instance
+ */
+extern void ECP8_rhs(BLS48286::FP8 *r, BLS48286::FP8 *x);
+/**	@brief Set ECP8 to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP8 instance to be set (x,y)
+	@param x FP8 x coordinate of point
+	@param y FP8 y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP8_set(ECP8 *P, BLS48286::FP8 *x, BLS48286::FP8 *y);
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Otherwise y coordinate is calculated from x.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+    @param s sign of y
+	@return 1 if point exists, else 0
+ */
+extern int ECP8_setx(ECP8 *P, BLS48286::FP8 *x,int s);
+/**	@brief Negation of an ECP8 point
+ *
+	@param P ECP8 instance, on exit = -P
+ */
+extern void ECP8_neg(ECP8 *P);
+
+/**	@brief Reduction of an ECP8 point
+ *
+	@param P ECP8 instance, on exit (x,y) are reduced wrt the modulus
+ */
+extern void ECP8_reduce(ECP8 *P);
+
+
+/**	@brief Doubles an ECP8 instance P
+ *
+	@param P ECP8 instance, on exit =2*P
+ */
+extern int ECP8_dbl(ECP8 *P);
+/**	@brief Adds ECP8 instance Q to ECP8 instance P
+ *
+	@param P ECP8 instance, on exit =P+Q
+	@param Q ECP8 instance to be added to P
+ */
+extern int ECP8_add(ECP8 *P, ECP8 *Q);
+/**	@brief Subtracts ECP instance Q from ECP8 instance P
+ *
+	@param P ECP8 instance, on exit =P-Q
+	@param Q ECP8 instance to be subtracted from P
+ */
+extern void ECP8_sub(ECP8 *P, ECP8 *Q);
+/**	@brief Multiplies an ECP8 instance P by a BIG, side-channel resistant
+ *
+	Uses fixed sized windows.
+	@param P ECP8 instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP8_mul(ECP8 *P, B288_29::BIG b);
+
+/**	@brief Calculates required Frobenius constants
+ *
+	Calculate Frobenius constants
+	@param F array of FP2 precalculated constants
+
+ */
+extern void ECP8_frob_constants(BLS48286::FP2 F[3]);
+
+/**	@brief Multiplies an ECP8 instance P by the internal modulus p^n, using precalculated Frobenius constants
+ *
+	Fast point multiplication using Frobenius
+	@param P ECP8 instance, on exit = p^n*P
+	@param F array of FP2 precalculated Frobenius constant
+	@param n power of prime
+
+ */
+extern void ECP8_frob(ECP8 *P, BLS48286::FP2 F[3], int n);
+
+/**	@brief Calculates P=Sigma b[i]*Q[i] for i=0 to 7
+ *
+	@param P ECP8 instance, on exit = Sigma b[i]*Q[i] for i=0 to 7
+	@param Q ECP8 array of 4 points
+	@param b BIG array of 4 multipliers
+ */
+extern void ECP8_mul16(ECP8 *P, ECP8 *Q, B288_29::BIG *b);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP8 multiplied by co-factor
+ */
+extern void ECP8_cfp(ECP8 *Q);
+
+/**	@brief Maps random FP8 to curve point in constant time
+ *
+	@param Q ECP8 instance 
+	@param x FP8 derived from hash
+ */
+extern void ECP8_map2point(ECP8 *Q, BLS48286::FP8 *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck 
+ *
+	@param Q ECP8 instance 
+	@param x Fp derived from hash
+ */
+extern void ECP8_hap2point(ECP8 *Q, B288_29::BIG  x);
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param P ECP8 instance of correct order
+	@param W OCTET byte array to be mapped
+ */
+extern void ECP8_mapit(ECP8 *P, octet *W);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP8 instance
+	@return 1 if point exists, else 0
+ */
+extern int ECP8_generator(ECP8 *G);
+
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp8_BLS48556.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp8_BLS48556.h
new file mode 100644
index 0000000..2b6e1b7
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp8_BLS48556.h
@@ -0,0 +1,278 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP8_BLS48556_H
+#define ECP8_BLS48556_H
+
+#include "fp8_BLS48556.h"
+#include "config_curve_BLS48556.h"
+
+using namespace core;
+
+namespace BLS48556 {
+
+extern const B560_29::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B560_29::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+}
+
+namespace BLS48556 {
+
+/**
+	@brief ECP8 Structure - Elliptic Curve Point over quadratic extension field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag */
+    BLS48556::FP8 x;   /**< x-coordinate of point */
+    BLS48556::FP8 y;   /**< y-coordinate of point */
+    BLS48556::FP8 z;   /**< z-coordinate of point */
+} ECP8;
+
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;		/**< Elliptic curve B parameter */
+extern const B560_29::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B560_29::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B560_29::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B560_29::BIG CURVE_Bnx;   /**< Elliptic curve parameter */
+extern const B560_29::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+
+/* Generator point on G1 */
+extern const B560_29::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B560_29::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B560_29::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B560_29::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B560_29::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B560_29::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B560_29::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B560_29::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B560_29::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B560_29::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B560_29::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B560_29::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B560_29::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B560_29::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B560_29::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B560_29::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B560_29::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B560_29::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+/* ECP8 E(FP8) prototypes */
+/**	@brief Tests for ECP8 point equal to infinity
+ *
+	@param P ECP8 point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP8_isinf(ECP8 *P);
+/**	@brief Copy ECP8 point to another ECP8 point
+ *
+	@param P ECP8 instance, on exit = Q
+	@param Q ECP8 instance to be copied
+ */
+extern void ECP8_copy(ECP8 *P, ECP8 *Q);
+/**	@brief Set ECP8 to point-at-infinity
+ *
+	@param P ECP8 instance to be set to infinity
+ */
+extern void ECP8_inf(ECP8 *P);
+/**	@brief Tests for equality of two ECP8s
+ *
+	@param P ECP8 instance to be compared
+	@param Q ECP8 instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP8_equals(ECP8 *P, ECP8 *Q);
+
+/**	@brief Converts an ECP8 point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP8 instance to be converted to affine form
+ */
+extern void ECP8_affine(ECP8 *P);
+
+
+/**	@brief Extract x and y coordinates of an ECP8 point P
+ *
+	If x=y, returns only x
+	@param x FP8 on exit = x coordinate of point
+	@param y FP8 on exit = y coordinate of point (unless x=y)
+	@param P ECP8 instance (x,y)
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP8_get(BLS48556::FP8 *x, BLS48556::FP8 *y, ECP8 *P);
+/**	@brief Formats and outputs an ECP8 point to the console, converted to affine coordinates
+ *
+	@param P ECP8 instance to be printed
+ */
+extern void ECP8_output(ECP8 *P);
+
+/**	@brief Formats and outputs an ECP8 point to an octet string
+ *
+	The octet string is created in the form x|y or just x if compressed
+	Convert the real and imaginary parts of the x and y coordinates to big-endian base 256 form.
+	@param S output octet string
+	@param P ECP8 instance to be converted to an octet string
+    @param c true for compression
+ */
+extern void ECP8_toOctet(octet *S, ECP8 *P, bool c);
+/**	@brief Creates an ECP8 point from an octet string
+ *
+	The octet string is in the form x|y
+	The real and imaginary parts of the x and y coordinates are in big-endian base 256 form.
+	@param P ECP8 instance to be created from the octet string
+	@param S input octet string
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP8_fromOctet(ECP8 *P, octet *S);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x)=x^3+Ax+B
+	Used internally.
+	@param r FP8 value of f(x)
+	@param x FP8 instance
+ */
+extern void ECP8_rhs(BLS48556::FP8 *r, BLS48556::FP8 *x);
+/**	@brief Set ECP8 to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP8 instance to be set (x,y)
+	@param x FP8 x coordinate of point
+	@param y FP8 y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP8_set(ECP8 *P, BLS48556::FP8 *x, BLS48556::FP8 *y);
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Otherwise y coordinate is calculated from x.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+    @param s sign of y
+	@return 1 if point exists, else 0
+ */
+extern int ECP8_setx(ECP8 *P, BLS48556::FP8 *x,int s);
+/**	@brief Negation of an ECP8 point
+ *
+	@param P ECP8 instance, on exit = -P
+ */
+extern void ECP8_neg(ECP8 *P);
+
+/**	@brief Reduction of an ECP8 point
+ *
+	@param P ECP8 instance, on exit (x,y) are reduced wrt the modulus
+ */
+extern void ECP8_reduce(ECP8 *P);
+
+
+/**	@brief Doubles an ECP8 instance P
+ *
+	@param P ECP8 instance, on exit =2*P
+ */
+extern int ECP8_dbl(ECP8 *P);
+/**	@brief Adds ECP8 instance Q to ECP8 instance P
+ *
+	@param P ECP8 instance, on exit =P+Q
+	@param Q ECP8 instance to be added to P
+ */
+extern int ECP8_add(ECP8 *P, ECP8 *Q);
+/**	@brief Subtracts ECP instance Q from ECP8 instance P
+ *
+	@param P ECP8 instance, on exit =P-Q
+	@param Q ECP8 instance to be subtracted from P
+ */
+extern void ECP8_sub(ECP8 *P, ECP8 *Q);
+/**	@brief Multiplies an ECP8 instance P by a BIG, side-channel resistant
+ *
+	Uses fixed sized windows.
+	@param P ECP8 instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP8_mul(ECP8 *P, B560_29::BIG b);
+
+/**	@brief Calculates required Frobenius constants
+ *
+	Calculate Frobenius constants
+	@param F array of FP2 precalculated constants
+
+ */
+extern void ECP8_frob_constants(BLS48556::FP2 F[3]);
+
+/**	@brief Multiplies an ECP8 instance P by the internal modulus p^n, using precalculated Frobenius constants
+ *
+	Fast point multiplication using Frobenius
+	@param P ECP8 instance, on exit = p^n*P
+	@param F array of FP2 precalculated Frobenius constant
+	@param n power of prime
+
+ */
+extern void ECP8_frob(ECP8 *P, BLS48556::FP2 F[3], int n);
+
+/**	@brief Calculates P=Sigma b[i]*Q[i] for i=0 to 7
+ *
+	@param P ECP8 instance, on exit = Sigma b[i]*Q[i] for i=0 to 7
+	@param Q ECP8 array of 4 points
+	@param b BIG array of 4 multipliers
+ */
+extern void ECP8_mul16(ECP8 *P, ECP8 *Q, B560_29::BIG *b);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP8 multiplied by co-factor
+ */
+extern void ECP8_cfp(ECP8 *Q);
+
+/**	@brief Maps random FP8 to curve point in constant time
+ *
+	@param Q ECP8 instance 
+	@param x FP8 derived from hash
+ */
+extern void ECP8_map2point(ECP8 *Q, BLS48556::FP8 *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck 
+ *
+	@param Q ECP8 instance 
+	@param x Fp derived from hash
+ */
+extern void ECP8_hap2point(ECP8 *Q, B560_29::BIG  x);
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param P ECP8 instance of correct order
+	@param W OCTET byte array to be mapped
+ */
+extern void ECP8_mapit(ECP8 *P, octet *W);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP8 instance
+	@return 1 if point exists, else 0
+ */
+extern int ECP8_generator(ECP8 *G);
+
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp8_BLS48581.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp8_BLS48581.h
new file mode 100644
index 0000000..8177af2
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp8_BLS48581.h
@@ -0,0 +1,278 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP8_BLS48581_H
+#define ECP8_BLS48581_H
+
+#include "fp8_BLS48581.h"
+#include "config_curve_BLS48581.h"
+
+using namespace core;
+
+namespace BLS48581 {
+
+extern const B584_29::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B584_29::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+}
+
+namespace BLS48581 {
+
+/**
+	@brief ECP8 Structure - Elliptic Curve Point over quadratic extension field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag */
+    BLS48581::FP8 x;   /**< x-coordinate of point */
+    BLS48581::FP8 y;   /**< y-coordinate of point */
+    BLS48581::FP8 z;   /**< z-coordinate of point */
+} ECP8;
+
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;		/**< Elliptic curve B parameter */
+extern const B584_29::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B584_29::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B584_29::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B584_29::BIG CURVE_Bnx;   /**< Elliptic curve parameter */
+extern const B584_29::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+
+/* Generator point on G1 */
+extern const B584_29::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B584_29::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B584_29::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B584_29::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B584_29::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B584_29::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B584_29::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B584_29::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B584_29::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B584_29::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B584_29::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B584_29::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B584_29::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B584_29::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B584_29::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B584_29::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B584_29::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B584_29::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+/* ECP8 E(FP8) prototypes */
+/**	@brief Tests for ECP8 point equal to infinity
+ *
+	@param P ECP8 point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP8_isinf(ECP8 *P);
+/**	@brief Copy ECP8 point to another ECP8 point
+ *
+	@param P ECP8 instance, on exit = Q
+	@param Q ECP8 instance to be copied
+ */
+extern void ECP8_copy(ECP8 *P, ECP8 *Q);
+/**	@brief Set ECP8 to point-at-infinity
+ *
+	@param P ECP8 instance to be set to infinity
+ */
+extern void ECP8_inf(ECP8 *P);
+/**	@brief Tests for equality of two ECP8s
+ *
+	@param P ECP8 instance to be compared
+	@param Q ECP8 instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP8_equals(ECP8 *P, ECP8 *Q);
+
+/**	@brief Converts an ECP8 point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP8 instance to be converted to affine form
+ */
+extern void ECP8_affine(ECP8 *P);
+
+
+/**	@brief Extract x and y coordinates of an ECP8 point P
+ *
+	If x=y, returns only x
+	@param x FP8 on exit = x coordinate of point
+	@param y FP8 on exit = y coordinate of point (unless x=y)
+	@param P ECP8 instance (x,y)
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP8_get(BLS48581::FP8 *x, BLS48581::FP8 *y, ECP8 *P);
+/**	@brief Formats and outputs an ECP8 point to the console, converted to affine coordinates
+ *
+	@param P ECP8 instance to be printed
+ */
+extern void ECP8_output(ECP8 *P);
+
+/**	@brief Formats and outputs an ECP8 point to an octet string
+ *
+	The octet string is created in the form x|y or just x if compressed
+	Convert the real and imaginary parts of the x and y coordinates to big-endian base 256 form.
+	@param S output octet string
+	@param P ECP8 instance to be converted to an octet string
+    @param c true for compression
+ */
+extern void ECP8_toOctet(octet *S, ECP8 *P, bool c);
+/**	@brief Creates an ECP8 point from an octet string
+ *
+	The octet string is in the form x|y
+	The real and imaginary parts of the x and y coordinates are in big-endian base 256 form.
+	@param P ECP8 instance to be created from the octet string
+	@param S input octet string
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP8_fromOctet(ECP8 *P, octet *S);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x)=x^3+Ax+B
+	Used internally.
+	@param r FP8 value of f(x)
+	@param x FP8 instance
+ */
+extern void ECP8_rhs(BLS48581::FP8 *r, BLS48581::FP8 *x);
+/**	@brief Set ECP8 to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP8 instance to be set (x,y)
+	@param x FP8 x coordinate of point
+	@param y FP8 y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP8_set(ECP8 *P, BLS48581::FP8 *x, BLS48581::FP8 *y);
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Otherwise y coordinate is calculated from x.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+    @param s sign of y
+	@return 1 if point exists, else 0
+ */
+extern int ECP8_setx(ECP8 *P, BLS48581::FP8 *x,int s);
+/**	@brief Negation of an ECP8 point
+ *
+	@param P ECP8 instance, on exit = -P
+ */
+extern void ECP8_neg(ECP8 *P);
+
+/**	@brief Reduction of an ECP8 point
+ *
+	@param P ECP8 instance, on exit (x,y) are reduced wrt the modulus
+ */
+extern void ECP8_reduce(ECP8 *P);
+
+
+/**	@brief Doubles an ECP8 instance P
+ *
+	@param P ECP8 instance, on exit =2*P
+ */
+extern int ECP8_dbl(ECP8 *P);
+/**	@brief Adds ECP8 instance Q to ECP8 instance P
+ *
+	@param P ECP8 instance, on exit =P+Q
+	@param Q ECP8 instance to be added to P
+ */
+extern int ECP8_add(ECP8 *P, ECP8 *Q);
+/**	@brief Subtracts ECP instance Q from ECP8 instance P
+ *
+	@param P ECP8 instance, on exit =P-Q
+	@param Q ECP8 instance to be subtracted from P
+ */
+extern void ECP8_sub(ECP8 *P, ECP8 *Q);
+/**	@brief Multiplies an ECP8 instance P by a BIG, side-channel resistant
+ *
+	Uses fixed sized windows.
+	@param P ECP8 instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP8_mul(ECP8 *P, B584_29::BIG b);
+
+/**	@brief Calculates required Frobenius constants
+ *
+	Calculate Frobenius constants
+	@param F array of FP2 precalculated constants
+
+ */
+extern void ECP8_frob_constants(BLS48581::FP2 F[3]);
+
+/**	@brief Multiplies an ECP8 instance P by the internal modulus p^n, using precalculated Frobenius constants
+ *
+	Fast point multiplication using Frobenius
+	@param P ECP8 instance, on exit = p^n*P
+	@param F array of FP2 precalculated Frobenius constant
+	@param n power of prime
+
+ */
+extern void ECP8_frob(ECP8 *P, BLS48581::FP2 F[3], int n);
+
+/**	@brief Calculates P=Sigma b[i]*Q[i] for i=0 to 7
+ *
+	@param P ECP8 instance, on exit = Sigma b[i]*Q[i] for i=0 to 7
+	@param Q ECP8 array of 4 points
+	@param b BIG array of 4 multipliers
+ */
+extern void ECP8_mul16(ECP8 *P, ECP8 *Q, B584_29::BIG *b);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP8 multiplied by co-factor
+ */
+extern void ECP8_cfp(ECP8 *Q);
+
+/**	@brief Maps random FP8 to curve point in constant time
+ *
+	@param Q ECP8 instance 
+	@param x FP8 derived from hash
+ */
+extern void ECP8_map2point(ECP8 *Q, BLS48581::FP8 *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck 
+ *
+	@param Q ECP8 instance 
+	@param x Fp derived from hash
+ */
+extern void ECP8_hap2point(ECP8 *Q, B584_29::BIG  x);
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param P ECP8 instance of correct order
+	@param W OCTET byte array to be mapped
+ */
+extern void ECP8_mapit(ECP8 *P, octet *W);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP8 instance
+	@return 1 if point exists, else 0
+ */
+extern int ECP8_generator(ECP8 *G);
+
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_ANSSI.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_ANSSI.h
new file mode 100644
index 0000000..f6303b1
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_ANSSI.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_ANSSI_H
+#define ECP_ANSSI_H
+
+#include "fp_ANSSI.h"
+#include "config_curve_ANSSI.h"
+
+using namespace core;
+
+namespace ANSSI {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B256_28::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_28::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_28::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_28::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B256_28::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B256_28::BIG CURVE_Ad;
+extern const B256_28::BIG CURVE_Bd;
+extern const B256_28::BIG PC[];
+
+extern const B256_28::BIG CURVE_Adr;
+extern const B256_28::BIG CURVE_Adi;
+extern const B256_28::BIG CURVE_Bdr;
+extern const B256_28::BIG CURVE_Bdi;
+extern const B256_28::BIG PCR[];
+extern const B256_28::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B256_28::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_28::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_28::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B256_28::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B256_28::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B256_28::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B256_28::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B256_28::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_28::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B256_28::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_28::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_28::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_28::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    ANSSI::FP x; /**< x-coordinate of point */
+#if CURVETYPE_ANSSI!=MONTGOMERY
+    ANSSI::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    ANSSI::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(ANSSI::FP *r, ANSSI::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B256_28::BIG x, int s);
+
+#if CURVETYPE_ANSSI==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_28::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B256_28::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_28::BIG x, B256_28::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B256_28::BIG x, B256_28::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B256_28::BIG e, B256_28::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B256_28::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B256_28::BIG e, B256_28::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B256_28::BIG e, B256_28::BIG f, B256_28::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B256_28::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, ANSSI::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B256_28::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_BLS12381.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_BLS12381.h
new file mode 100644
index 0000000..f8115a6
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_BLS12381.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_BLS12381_H
+#define ECP_BLS12381_H
+
+#include "fp_BLS12381.h"
+#include "config_curve_BLS12381.h"
+
+using namespace core;
+
+namespace BLS12381 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B384_29::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B384_29::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B384_29::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B384_29::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B384_29::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B384_29::BIG CURVE_Ad;
+extern const B384_29::BIG CURVE_Bd;
+extern const B384_29::BIG PC[];
+
+extern const B384_29::BIG CURVE_Adr;
+extern const B384_29::BIG CURVE_Adi;
+extern const B384_29::BIG CURVE_Bdr;
+extern const B384_29::BIG CURVE_Bdi;
+extern const B384_29::BIG PCR[];
+extern const B384_29::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B384_29::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B384_29::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B384_29::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B384_29::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B384_29::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B384_29::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B384_29::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B384_29::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B384_29::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B384_29::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B384_29::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B384_29::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B384_29::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    BLS12381::FP x; /**< x-coordinate of point */
+#if CURVETYPE_BLS12381!=MONTGOMERY
+    BLS12381::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    BLS12381::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(BLS12381::FP *r, BLS12381::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B384_29::BIG x, int s);
+
+#if CURVETYPE_BLS12381==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B384_29::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B384_29::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B384_29::BIG x, B384_29::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B384_29::BIG x, B384_29::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B384_29::BIG e, B384_29::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B384_29::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B384_29::BIG e, B384_29::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B384_29::BIG e, B384_29::BIG f, B384_29::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B384_29::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, BLS12381::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B384_29::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_BLS12383.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_BLS12383.h
new file mode 100644
index 0000000..37fc88e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_BLS12383.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_BLS12383_H
+#define ECP_BLS12383_H
+
+#include "fp_BLS12383.h"
+#include "config_curve_BLS12383.h"
+
+using namespace core;
+
+namespace BLS12383 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B384_29::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B384_29::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B384_29::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B384_29::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B384_29::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B384_29::BIG CURVE_Ad;
+extern const B384_29::BIG CURVE_Bd;
+extern const B384_29::BIG PC[];
+
+extern const B384_29::BIG CURVE_Adr;
+extern const B384_29::BIG CURVE_Adi;
+extern const B384_29::BIG CURVE_Bdr;
+extern const B384_29::BIG CURVE_Bdi;
+extern const B384_29::BIG PCR[];
+extern const B384_29::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B384_29::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B384_29::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B384_29::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B384_29::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B384_29::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B384_29::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B384_29::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B384_29::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B384_29::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B384_29::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B384_29::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B384_29::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B384_29::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    BLS12383::FP x; /**< x-coordinate of point */
+#if CURVETYPE_BLS12383!=MONTGOMERY
+    BLS12383::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    BLS12383::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(BLS12383::FP *r, BLS12383::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B384_29::BIG x, int s);
+
+#if CURVETYPE_BLS12383==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B384_29::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B384_29::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B384_29::BIG x, B384_29::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B384_29::BIG x, B384_29::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B384_29::BIG e, B384_29::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B384_29::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B384_29::BIG e, B384_29::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B384_29::BIG e, B384_29::BIG f, B384_29::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B384_29::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, BLS12383::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B384_29::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_BLS12443.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_BLS12443.h
new file mode 100644
index 0000000..cb54d0b
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_BLS12443.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_BLS12443_H
+#define ECP_BLS12443_H
+
+#include "fp_BLS12443.h"
+#include "config_curve_BLS12443.h"
+
+using namespace core;
+
+namespace BLS12443 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B448_29::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B448_29::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B448_29::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B448_29::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B448_29::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B448_29::BIG CURVE_Ad;
+extern const B448_29::BIG CURVE_Bd;
+extern const B448_29::BIG PC[];
+
+extern const B448_29::BIG CURVE_Adr;
+extern const B448_29::BIG CURVE_Adi;
+extern const B448_29::BIG CURVE_Bdr;
+extern const B448_29::BIG CURVE_Bdi;
+extern const B448_29::BIG PCR[];
+extern const B448_29::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B448_29::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B448_29::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B448_29::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_29::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B448_29::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_29::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B448_29::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_29::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B448_29::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_29::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B448_29::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_29::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B448_29::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_29::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B448_29::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_29::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B448_29::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_29::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B448_29::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_29::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B448_29::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_29::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B448_29::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_29::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B448_29::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_29::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B448_29::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_29::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B448_29::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_29::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B448_29::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B448_29::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B448_29::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B448_29::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B448_29::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B448_29::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B448_29::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    BLS12443::FP x; /**< x-coordinate of point */
+#if CURVETYPE_BLS12443!=MONTGOMERY
+    BLS12443::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    BLS12443::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(BLS12443::FP *r, BLS12443::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B448_29::BIG x, int s);
+
+#if CURVETYPE_BLS12443==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B448_29::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B448_29::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B448_29::BIG x, B448_29::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B448_29::BIG x, B448_29::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B448_29::BIG e, B448_29::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B448_29::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B448_29::BIG e, B448_29::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B448_29::BIG e, B448_29::BIG f, B448_29::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B448_29::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, BLS12443::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B448_29::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_BLS12461.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_BLS12461.h
new file mode 100644
index 0000000..e90642d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_BLS12461.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_BLS12461_H
+#define ECP_BLS12461_H
+
+#include "fp_BLS12461.h"
+#include "config_curve_BLS12461.h"
+
+using namespace core;
+
+namespace BLS12461 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B464_28::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B464_28::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B464_28::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B464_28::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B464_28::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B464_28::BIG CURVE_Ad;
+extern const B464_28::BIG CURVE_Bd;
+extern const B464_28::BIG PC[];
+
+extern const B464_28::BIG CURVE_Adr;
+extern const B464_28::BIG CURVE_Adi;
+extern const B464_28::BIG CURVE_Bdr;
+extern const B464_28::BIG CURVE_Bdi;
+extern const B464_28::BIG PCR[];
+extern const B464_28::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B464_28::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B464_28::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B464_28::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B464_28::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B464_28::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B464_28::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B464_28::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B464_28::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B464_28::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B464_28::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B464_28::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B464_28::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B464_28::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B464_28::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B464_28::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B464_28::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B464_28::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B464_28::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B464_28::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B464_28::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B464_28::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B464_28::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B464_28::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B464_28::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B464_28::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B464_28::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B464_28::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B464_28::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B464_28::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B464_28::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B464_28::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B464_28::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B464_28::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B464_28::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B464_28::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B464_28::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B464_28::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    BLS12461::FP x; /**< x-coordinate of point */
+#if CURVETYPE_BLS12461!=MONTGOMERY
+    BLS12461::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    BLS12461::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(BLS12461::FP *r, BLS12461::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B464_28::BIG x, int s);
+
+#if CURVETYPE_BLS12461==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B464_28::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B464_28::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B464_28::BIG x, B464_28::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B464_28::BIG x, B464_28::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B464_28::BIG e, B464_28::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B464_28::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B464_28::BIG e, B464_28::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B464_28::BIG e, B464_28::BIG f, B464_28::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B464_28::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, BLS12461::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B464_28::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_BLS24479.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_BLS24479.h
new file mode 100644
index 0000000..7cf8379
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_BLS24479.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_BLS24479_H
+#define ECP_BLS24479_H
+
+#include "fp_BLS24479.h"
+#include "config_curve_BLS24479.h"
+
+using namespace core;
+
+namespace BLS24479 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B480_29::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B480_29::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B480_29::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B480_29::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B480_29::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B480_29::BIG CURVE_Ad;
+extern const B480_29::BIG CURVE_Bd;
+extern const B480_29::BIG PC[];
+
+extern const B480_29::BIG CURVE_Adr;
+extern const B480_29::BIG CURVE_Adi;
+extern const B480_29::BIG CURVE_Bdr;
+extern const B480_29::BIG CURVE_Bdi;
+extern const B480_29::BIG PCR[];
+extern const B480_29::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B480_29::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B480_29::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B480_29::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B480_29::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B480_29::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B480_29::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B480_29::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B480_29::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B480_29::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B480_29::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B480_29::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B480_29::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B480_29::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B480_29::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B480_29::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B480_29::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B480_29::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B480_29::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B480_29::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B480_29::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B480_29::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B480_29::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B480_29::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B480_29::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B480_29::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B480_29::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B480_29::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B480_29::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B480_29::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B480_29::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B480_29::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B480_29::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B480_29::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B480_29::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B480_29::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B480_29::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B480_29::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    BLS24479::FP x; /**< x-coordinate of point */
+#if CURVETYPE_BLS24479!=MONTGOMERY
+    BLS24479::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    BLS24479::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(BLS24479::FP *r, BLS24479::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B480_29::BIG x, int s);
+
+#if CURVETYPE_BLS24479==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B480_29::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B480_29::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B480_29::BIG x, B480_29::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B480_29::BIG x, B480_29::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B480_29::BIG e, B480_29::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B480_29::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B480_29::BIG e, B480_29::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B480_29::BIG e, B480_29::BIG f, B480_29::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B480_29::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, BLS24479::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B480_29::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_BLS48286.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_BLS48286.h
new file mode 100644
index 0000000..6e68dce
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_BLS48286.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_BLS48286_H
+#define ECP_BLS48286_H
+
+#include "fp_BLS48286.h"
+#include "config_curve_BLS48286.h"
+
+using namespace core;
+
+namespace BLS48286 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B288_29::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B288_29::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B288_29::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B288_29::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B288_29::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B288_29::BIG CURVE_Ad;
+extern const B288_29::BIG CURVE_Bd;
+extern const B288_29::BIG PC[];
+
+extern const B288_29::BIG CURVE_Adr;
+extern const B288_29::BIG CURVE_Adi;
+extern const B288_29::BIG CURVE_Bdr;
+extern const B288_29::BIG CURVE_Bdi;
+extern const B288_29::BIG PCR[];
+extern const B288_29::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B288_29::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B288_29::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B288_29::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B288_29::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B288_29::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B288_29::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B288_29::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B288_29::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B288_29::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B288_29::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B288_29::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B288_29::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B288_29::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B288_29::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B288_29::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B288_29::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B288_29::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B288_29::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B288_29::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B288_29::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B288_29::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B288_29::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B288_29::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B288_29::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B288_29::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B288_29::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B288_29::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B288_29::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B288_29::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B288_29::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B288_29::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B288_29::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B288_29::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B288_29::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B288_29::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B288_29::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B288_29::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    BLS48286::FP x; /**< x-coordinate of point */
+#if CURVETYPE_BLS48286!=MONTGOMERY
+    BLS48286::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    BLS48286::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(BLS48286::FP *r, BLS48286::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B288_29::BIG x, int s);
+
+#if CURVETYPE_BLS48286==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B288_29::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B288_29::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B288_29::BIG x, B288_29::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B288_29::BIG x, B288_29::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B288_29::BIG e, B288_29::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B288_29::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B288_29::BIG e, B288_29::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B288_29::BIG e, B288_29::BIG f, B288_29::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B288_29::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, BLS48286::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B288_29::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_BLS48556.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_BLS48556.h
new file mode 100644
index 0000000..dc351bf
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_BLS48556.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_BLS48556_H
+#define ECP_BLS48556_H
+
+#include "fp_BLS48556.h"
+#include "config_curve_BLS48556.h"
+
+using namespace core;
+
+namespace BLS48556 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B560_29::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B560_29::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B560_29::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B560_29::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B560_29::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B560_29::BIG CURVE_Ad;
+extern const B560_29::BIG CURVE_Bd;
+extern const B560_29::BIG PC[];
+
+extern const B560_29::BIG CURVE_Adr;
+extern const B560_29::BIG CURVE_Adi;
+extern const B560_29::BIG CURVE_Bdr;
+extern const B560_29::BIG CURVE_Bdi;
+extern const B560_29::BIG PCR[];
+extern const B560_29::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B560_29::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B560_29::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B560_29::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B560_29::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B560_29::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B560_29::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B560_29::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B560_29::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B560_29::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B560_29::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B560_29::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B560_29::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B560_29::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B560_29::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B560_29::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B560_29::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B560_29::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B560_29::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B560_29::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B560_29::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B560_29::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B560_29::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B560_29::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B560_29::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B560_29::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B560_29::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B560_29::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B560_29::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B560_29::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B560_29::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B560_29::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B560_29::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B560_29::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B560_29::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B560_29::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B560_29::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B560_29::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    BLS48556::FP x; /**< x-coordinate of point */
+#if CURVETYPE_BLS48556!=MONTGOMERY
+    BLS48556::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    BLS48556::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(BLS48556::FP *r, BLS48556::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B560_29::BIG x, int s);
+
+#if CURVETYPE_BLS48556==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B560_29::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B560_29::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B560_29::BIG x, B560_29::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B560_29::BIG x, B560_29::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B560_29::BIG e, B560_29::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B560_29::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B560_29::BIG e, B560_29::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B560_29::BIG e, B560_29::BIG f, B560_29::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B560_29::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, BLS48556::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B560_29::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_BLS48581.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_BLS48581.h
new file mode 100644
index 0000000..b4b1fe2
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_BLS48581.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_BLS48581_H
+#define ECP_BLS48581_H
+
+#include "fp_BLS48581.h"
+#include "config_curve_BLS48581.h"
+
+using namespace core;
+
+namespace BLS48581 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B584_29::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B584_29::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B584_29::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B584_29::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B584_29::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B584_29::BIG CURVE_Ad;
+extern const B584_29::BIG CURVE_Bd;
+extern const B584_29::BIG PC[];
+
+extern const B584_29::BIG CURVE_Adr;
+extern const B584_29::BIG CURVE_Adi;
+extern const B584_29::BIG CURVE_Bdr;
+extern const B584_29::BIG CURVE_Bdi;
+extern const B584_29::BIG PCR[];
+extern const B584_29::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B584_29::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B584_29::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B584_29::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B584_29::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B584_29::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B584_29::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B584_29::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B584_29::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B584_29::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B584_29::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B584_29::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B584_29::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B584_29::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B584_29::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B584_29::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B584_29::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B584_29::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B584_29::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B584_29::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B584_29::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B584_29::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B584_29::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B584_29::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B584_29::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B584_29::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B584_29::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B584_29::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B584_29::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B584_29::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B584_29::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B584_29::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B584_29::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B584_29::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B584_29::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B584_29::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B584_29::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B584_29::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    BLS48581::FP x; /**< x-coordinate of point */
+#if CURVETYPE_BLS48581!=MONTGOMERY
+    BLS48581::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    BLS48581::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(BLS48581::FP *r, BLS48581::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B584_29::BIG x, int s);
+
+#if CURVETYPE_BLS48581==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B584_29::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B584_29::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B584_29::BIG x, B584_29::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B584_29::BIG x, B584_29::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B584_29::BIG e, B584_29::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B584_29::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B584_29::BIG e, B584_29::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B584_29::BIG e, B584_29::BIG f, B584_29::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B584_29::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, BLS48581::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B584_29::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_BN158.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_BN158.h
new file mode 100644
index 0000000..2fa98e2
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_BN158.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_BN158_H
+#define ECP_BN158_H
+
+#include "fp_BN158.h"
+#include "config_curve_BN158.h"
+
+using namespace core;
+
+namespace BN158 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B160_28::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B160_28::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B160_28::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B160_28::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B160_28::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B160_28::BIG CURVE_Ad;
+extern const B160_28::BIG CURVE_Bd;
+extern const B160_28::BIG PC[];
+
+extern const B160_28::BIG CURVE_Adr;
+extern const B160_28::BIG CURVE_Adi;
+extern const B160_28::BIG CURVE_Bdr;
+extern const B160_28::BIG CURVE_Bdi;
+extern const B160_28::BIG PCR[];
+extern const B160_28::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B160_28::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B160_28::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B160_28::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B160_28::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B160_28::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B160_28::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B160_28::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B160_28::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B160_28::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B160_28::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B160_28::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B160_28::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B160_28::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B160_28::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B160_28::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B160_28::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B160_28::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B160_28::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B160_28::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B160_28::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B160_28::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B160_28::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B160_28::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B160_28::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B160_28::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B160_28::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B160_28::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B160_28::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B160_28::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B160_28::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B160_28::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B160_28::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B160_28::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B160_28::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B160_28::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B160_28::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B160_28::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    BN158::FP x; /**< x-coordinate of point */
+#if CURVETYPE_BN158!=MONTGOMERY
+    BN158::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    BN158::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(BN158::FP *r, BN158::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B160_28::BIG x, int s);
+
+#if CURVETYPE_BN158==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B160_28::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B160_28::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B160_28::BIG x, B160_28::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B160_28::BIG x, B160_28::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B160_28::BIG e, B160_28::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B160_28::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B160_28::BIG e, B160_28::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B160_28::BIG e, B160_28::BIG f, B160_28::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B160_28::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, BN158::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B160_28::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_BN254.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_BN254.h
new file mode 100644
index 0000000..25009fb
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_BN254.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_BN254_H
+#define ECP_BN254_H
+
+#include "fp_BN254.h"
+#include "config_curve_BN254.h"
+
+using namespace core;
+
+namespace BN254 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B256_28::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_28::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_28::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_28::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B256_28::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B256_28::BIG CURVE_Ad;
+extern const B256_28::BIG CURVE_Bd;
+extern const B256_28::BIG PC[];
+
+extern const B256_28::BIG CURVE_Adr;
+extern const B256_28::BIG CURVE_Adi;
+extern const B256_28::BIG CURVE_Bdr;
+extern const B256_28::BIG CURVE_Bdi;
+extern const B256_28::BIG PCR[];
+extern const B256_28::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B256_28::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_28::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_28::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B256_28::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B256_28::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B256_28::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B256_28::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B256_28::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_28::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B256_28::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_28::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_28::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_28::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    BN254::FP x; /**< x-coordinate of point */
+#if CURVETYPE_BN254!=MONTGOMERY
+    BN254::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    BN254::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(BN254::FP *r, BN254::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B256_28::BIG x, int s);
+
+#if CURVETYPE_BN254==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_28::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B256_28::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_28::BIG x, B256_28::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B256_28::BIG x, B256_28::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B256_28::BIG e, B256_28::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B256_28::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B256_28::BIG e, B256_28::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B256_28::BIG e, B256_28::BIG f, B256_28::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B256_28::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, BN254::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B256_28::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_BN254CX.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_BN254CX.h
new file mode 100644
index 0000000..9ec9d91
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_BN254CX.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_BN254CX_H
+#define ECP_BN254CX_H
+
+#include "fp_BN254CX.h"
+#include "config_curve_BN254CX.h"
+
+using namespace core;
+
+namespace BN254CX {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B256_28::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_28::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_28::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_28::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B256_28::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B256_28::BIG CURVE_Ad;
+extern const B256_28::BIG CURVE_Bd;
+extern const B256_28::BIG PC[];
+
+extern const B256_28::BIG CURVE_Adr;
+extern const B256_28::BIG CURVE_Adi;
+extern const B256_28::BIG CURVE_Bdr;
+extern const B256_28::BIG CURVE_Bdi;
+extern const B256_28::BIG PCR[];
+extern const B256_28::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B256_28::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_28::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_28::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B256_28::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B256_28::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B256_28::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B256_28::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B256_28::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_28::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B256_28::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_28::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_28::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_28::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    BN254CX::FP x; /**< x-coordinate of point */
+#if CURVETYPE_BN254CX!=MONTGOMERY
+    BN254CX::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    BN254CX::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(BN254CX::FP *r, BN254CX::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B256_28::BIG x, int s);
+
+#if CURVETYPE_BN254CX==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_28::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B256_28::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_28::BIG x, B256_28::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B256_28::BIG x, B256_28::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B256_28::BIG e, B256_28::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B256_28::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B256_28::BIG e, B256_28::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B256_28::BIG e, B256_28::BIG f, B256_28::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B256_28::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, BN254CX::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B256_28::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_BN462.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_BN462.h
new file mode 100644
index 0000000..f479109
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_BN462.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_BN462_H
+#define ECP_BN462_H
+
+#include "fp_BN462.h"
+#include "config_curve_BN462.h"
+
+using namespace core;
+
+namespace BN462 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B464_28::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B464_28::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B464_28::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B464_28::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B464_28::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B464_28::BIG CURVE_Ad;
+extern const B464_28::BIG CURVE_Bd;
+extern const B464_28::BIG PC[];
+
+extern const B464_28::BIG CURVE_Adr;
+extern const B464_28::BIG CURVE_Adi;
+extern const B464_28::BIG CURVE_Bdr;
+extern const B464_28::BIG CURVE_Bdi;
+extern const B464_28::BIG PCR[];
+extern const B464_28::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B464_28::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B464_28::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B464_28::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B464_28::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B464_28::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B464_28::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B464_28::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B464_28::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B464_28::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B464_28::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B464_28::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B464_28::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B464_28::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B464_28::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B464_28::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B464_28::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B464_28::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B464_28::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B464_28::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B464_28::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B464_28::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B464_28::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B464_28::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B464_28::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B464_28::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B464_28::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B464_28::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B464_28::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B464_28::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B464_28::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B464_28::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B464_28::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B464_28::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B464_28::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B464_28::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B464_28::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B464_28::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    BN462::FP x; /**< x-coordinate of point */
+#if CURVETYPE_BN462!=MONTGOMERY
+    BN462::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    BN462::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(BN462::FP *r, BN462::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B464_28::BIG x, int s);
+
+#if CURVETYPE_BN462==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B464_28::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B464_28::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B464_28::BIG x, B464_28::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B464_28::BIG x, B464_28::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B464_28::BIG e, B464_28::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B464_28::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B464_28::BIG e, B464_28::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B464_28::BIG e, B464_28::BIG f, B464_28::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B464_28::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, BN462::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B464_28::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_BRAINPOOL.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_BRAINPOOL.h
new file mode 100644
index 0000000..5c1cb0d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_BRAINPOOL.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_BRAINPOOL_H
+#define ECP_BRAINPOOL_H
+
+#include "fp_BRAINPOOL.h"
+#include "config_curve_BRAINPOOL.h"
+
+using namespace core;
+
+namespace BRAINPOOL {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B256_28::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_28::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_28::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_28::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B256_28::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B256_28::BIG CURVE_Ad;
+extern const B256_28::BIG CURVE_Bd;
+extern const B256_28::BIG PC[];
+
+extern const B256_28::BIG CURVE_Adr;
+extern const B256_28::BIG CURVE_Adi;
+extern const B256_28::BIG CURVE_Bdr;
+extern const B256_28::BIG CURVE_Bdi;
+extern const B256_28::BIG PCR[];
+extern const B256_28::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B256_28::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_28::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_28::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B256_28::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B256_28::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B256_28::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B256_28::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B256_28::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_28::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B256_28::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_28::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_28::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_28::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    BRAINPOOL::FP x; /**< x-coordinate of point */
+#if CURVETYPE_BRAINPOOL!=MONTGOMERY
+    BRAINPOOL::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    BRAINPOOL::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(BRAINPOOL::FP *r, BRAINPOOL::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B256_28::BIG x, int s);
+
+#if CURVETYPE_BRAINPOOL==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_28::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B256_28::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_28::BIG x, B256_28::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B256_28::BIG x, B256_28::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B256_28::BIG e, B256_28::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B256_28::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B256_28::BIG e, B256_28::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B256_28::BIG e, B256_28::BIG f, B256_28::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B256_28::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, BRAINPOOL::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B256_28::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_C1174.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_C1174.h
new file mode 100644
index 0000000..6487e5d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_C1174.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_C1174_H
+#define ECP_C1174_H
+
+#include "fp_C1174.h"
+#include "config_curve_C1174.h"
+
+using namespace core;
+
+namespace C1174 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B256_29::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_29::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_29::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_29::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B256_29::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B256_29::BIG CURVE_Ad;
+extern const B256_29::BIG CURVE_Bd;
+extern const B256_29::BIG PC[];
+
+extern const B256_29::BIG CURVE_Adr;
+extern const B256_29::BIG CURVE_Adi;
+extern const B256_29::BIG CURVE_Bdr;
+extern const B256_29::BIG CURVE_Bdi;
+extern const B256_29::BIG PCR[];
+extern const B256_29::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B256_29::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_29::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_29::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B256_29::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B256_29::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B256_29::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B256_29::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B256_29::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_29::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B256_29::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_29::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_29::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_29::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    C1174::FP x; /**< x-coordinate of point */
+#if CURVETYPE_C1174!=MONTGOMERY
+    C1174::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    C1174::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(C1174::FP *r, C1174::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B256_29::BIG x, int s);
+
+#if CURVETYPE_C1174==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_29::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B256_29::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_29::BIG x, B256_29::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B256_29::BIG x, B256_29::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B256_29::BIG e, B256_29::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B256_29::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B256_29::BIG e, B256_29::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B256_29::BIG e, B256_29::BIG f, B256_29::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B256_29::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, C1174::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B256_29::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_C13318.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_C13318.h
new file mode 100644
index 0000000..6b5ef7f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_C13318.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_C13318_H
+#define ECP_C13318_H
+
+#include "fp_F25519.h"
+#include "config_curve_C13318.h"
+
+using namespace core;
+
+namespace C13318 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B256_29::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_29::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_29::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_29::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B256_29::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B256_29::BIG CURVE_Ad;
+extern const B256_29::BIG CURVE_Bd;
+extern const B256_29::BIG PC[];
+
+extern const B256_29::BIG CURVE_Adr;
+extern const B256_29::BIG CURVE_Adi;
+extern const B256_29::BIG CURVE_Bdr;
+extern const B256_29::BIG CURVE_Bdi;
+extern const B256_29::BIG PCR[];
+extern const B256_29::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B256_29::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_29::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_29::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B256_29::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B256_29::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B256_29::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B256_29::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B256_29::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_29::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B256_29::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_29::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_29::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_29::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    F25519::FP x; /**< x-coordinate of point */
+#if CURVETYPE_C13318!=MONTGOMERY
+    F25519::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    F25519::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(F25519::FP *r, F25519::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B256_29::BIG x, int s);
+
+#if CURVETYPE_C13318==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_29::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B256_29::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_29::BIG x, B256_29::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B256_29::BIG x, B256_29::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B256_29::BIG e, B256_29::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B256_29::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B256_29::BIG e, B256_29::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B256_29::BIG e, B256_29::BIG f, B256_29::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B256_29::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, F25519::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B256_29::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_C1665.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_C1665.h
new file mode 100644
index 0000000..0d32f7d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_C1665.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_C1665_H
+#define ECP_C1665_H
+
+#include "fp_C1665.h"
+#include "config_curve_C1665.h"
+
+using namespace core;
+
+namespace C1665 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B168_29::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B168_29::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B168_29::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B168_29::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B168_29::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B168_29::BIG CURVE_Ad;
+extern const B168_29::BIG CURVE_Bd;
+extern const B168_29::BIG PC[];
+
+extern const B168_29::BIG CURVE_Adr;
+extern const B168_29::BIG CURVE_Adi;
+extern const B168_29::BIG CURVE_Bdr;
+extern const B168_29::BIG CURVE_Bdi;
+extern const B168_29::BIG PCR[];
+extern const B168_29::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B168_29::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B168_29::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B168_29::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B168_29::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B168_29::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B168_29::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B168_29::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B168_29::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B168_29::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B168_29::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B168_29::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B168_29::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B168_29::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B168_29::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B168_29::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B168_29::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B168_29::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B168_29::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B168_29::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B168_29::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B168_29::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B168_29::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B168_29::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B168_29::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B168_29::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B168_29::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B168_29::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B168_29::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B168_29::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B168_29::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B168_29::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B168_29::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B168_29::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B168_29::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B168_29::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B168_29::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B168_29::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    C1665::FP x; /**< x-coordinate of point */
+#if CURVETYPE_C1665!=MONTGOMERY
+    C1665::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    C1665::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(C1665::FP *r, C1665::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B168_29::BIG x, int s);
+
+#if CURVETYPE_C1665==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B168_29::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B168_29::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B168_29::BIG x, B168_29::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B168_29::BIG x, B168_29::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B168_29::BIG e, B168_29::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B168_29::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B168_29::BIG e, B168_29::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B168_29::BIG e, B168_29::BIG f, B168_29::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B168_29::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, C1665::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B168_29::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_C25519.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_C25519.h
new file mode 100644
index 0000000..35f3076
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_C25519.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_C25519_H
+#define ECP_C25519_H
+
+#include "fp_F25519.h"
+#include "config_curve_C25519.h"
+
+using namespace core;
+
+namespace C25519 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B256_29::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_29::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_29::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_29::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B256_29::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B256_29::BIG CURVE_Ad;
+extern const B256_29::BIG CURVE_Bd;
+extern const B256_29::BIG PC[];
+
+extern const B256_29::BIG CURVE_Adr;
+extern const B256_29::BIG CURVE_Adi;
+extern const B256_29::BIG CURVE_Bdr;
+extern const B256_29::BIG CURVE_Bdi;
+extern const B256_29::BIG PCR[];
+extern const B256_29::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B256_29::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_29::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_29::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B256_29::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B256_29::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B256_29::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B256_29::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B256_29::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_29::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B256_29::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_29::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_29::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_29::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    F25519::FP x; /**< x-coordinate of point */
+#if CURVETYPE_C25519!=MONTGOMERY
+    F25519::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    F25519::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(F25519::FP *r, F25519::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B256_29::BIG x, int s);
+
+#if CURVETYPE_C25519==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_29::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B256_29::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_29::BIG x, B256_29::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B256_29::BIG x, B256_29::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B256_29::BIG e, B256_29::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B256_29::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B256_29::BIG e, B256_29::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B256_29::BIG e, B256_29::BIG f, B256_29::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B256_29::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, F25519::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B256_29::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_C41417.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_C41417.h
new file mode 100644
index 0000000..c2e7501
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_C41417.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_C41417_H
+#define ECP_C41417_H
+
+#include "fp_C41417.h"
+#include "config_curve_C41417.h"
+
+using namespace core;
+
+namespace C41417 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B416_29::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B416_29::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B416_29::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B416_29::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B416_29::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B416_29::BIG CURVE_Ad;
+extern const B416_29::BIG CURVE_Bd;
+extern const B416_29::BIG PC[];
+
+extern const B416_29::BIG CURVE_Adr;
+extern const B416_29::BIG CURVE_Adi;
+extern const B416_29::BIG CURVE_Bdr;
+extern const B416_29::BIG CURVE_Bdi;
+extern const B416_29::BIG PCR[];
+extern const B416_29::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B416_29::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B416_29::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B416_29::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B416_29::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B416_29::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B416_29::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B416_29::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B416_29::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B416_29::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B416_29::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B416_29::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B416_29::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B416_29::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B416_29::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B416_29::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B416_29::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B416_29::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B416_29::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B416_29::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B416_29::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B416_29::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B416_29::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B416_29::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B416_29::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B416_29::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B416_29::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B416_29::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B416_29::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B416_29::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B416_29::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B416_29::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B416_29::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B416_29::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B416_29::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B416_29::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B416_29::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B416_29::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    C41417::FP x; /**< x-coordinate of point */
+#if CURVETYPE_C41417!=MONTGOMERY
+    C41417::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    C41417::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(C41417::FP *r, C41417::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B416_29::BIG x, int s);
+
+#if CURVETYPE_C41417==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B416_29::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B416_29::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B416_29::BIG x, B416_29::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B416_29::BIG x, B416_29::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B416_29::BIG e, B416_29::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B416_29::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B416_29::BIG e, B416_29::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B416_29::BIG e, B416_29::BIG f, B416_29::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B416_29::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, C41417::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B416_29::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_Ed25519.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_Ed25519.h
new file mode 100644
index 0000000..0719ac3
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_Ed25519.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_Ed25519_H
+#define ECP_Ed25519_H
+
+#include "fp_F25519.h"
+#include "config_curve_Ed25519.h"
+
+using namespace core;
+
+namespace Ed25519 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B256_29::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_29::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_29::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_29::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B256_29::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B256_29::BIG CURVE_Ad;
+extern const B256_29::BIG CURVE_Bd;
+extern const B256_29::BIG PC[];
+
+extern const B256_29::BIG CURVE_Adr;
+extern const B256_29::BIG CURVE_Adi;
+extern const B256_29::BIG CURVE_Bdr;
+extern const B256_29::BIG CURVE_Bdi;
+extern const B256_29::BIG PCR[];
+extern const B256_29::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B256_29::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_29::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_29::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B256_29::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B256_29::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B256_29::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B256_29::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B256_29::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_29::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B256_29::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_29::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_29::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_29::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    F25519::FP x; /**< x-coordinate of point */
+#if CURVETYPE_Ed25519!=MONTGOMERY
+    F25519::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    F25519::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(F25519::FP *r, F25519::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B256_29::BIG x, int s);
+
+#if CURVETYPE_Ed25519==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_29::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B256_29::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_29::BIG x, B256_29::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B256_29::BIG x, B256_29::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B256_29::BIG e, B256_29::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B256_29::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B256_29::BIG e, B256_29::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B256_29::BIG e, B256_29::BIG f, B256_29::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B256_29::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, F25519::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B256_29::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_Ed448.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_Ed448.h
new file mode 100644
index 0000000..24dc7e3
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_Ed448.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_Ed448_H
+#define ECP_Ed448_H
+
+#include "fp_F448.h"
+#include "config_curve_Ed448.h"
+
+using namespace core;
+
+namespace Ed448 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B448_29::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B448_29::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B448_29::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B448_29::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B448_29::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B448_29::BIG CURVE_Ad;
+extern const B448_29::BIG CURVE_Bd;
+extern const B448_29::BIG PC[];
+
+extern const B448_29::BIG CURVE_Adr;
+extern const B448_29::BIG CURVE_Adi;
+extern const B448_29::BIG CURVE_Bdr;
+extern const B448_29::BIG CURVE_Bdi;
+extern const B448_29::BIG PCR[];
+extern const B448_29::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B448_29::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B448_29::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B448_29::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_29::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B448_29::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_29::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B448_29::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_29::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B448_29::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_29::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B448_29::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_29::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B448_29::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_29::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B448_29::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_29::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B448_29::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_29::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B448_29::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_29::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B448_29::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_29::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B448_29::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_29::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B448_29::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_29::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B448_29::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_29::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B448_29::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_29::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B448_29::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B448_29::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B448_29::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B448_29::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B448_29::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B448_29::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B448_29::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    F448::FP x; /**< x-coordinate of point */
+#if CURVETYPE_Ed448!=MONTGOMERY
+    F448::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    F448::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(F448::FP *r, F448::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B448_29::BIG x, int s);
+
+#if CURVETYPE_Ed448==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B448_29::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B448_29::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B448_29::BIG x, B448_29::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B448_29::BIG x, B448_29::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B448_29::BIG e, B448_29::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B448_29::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B448_29::BIG e, B448_29::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B448_29::BIG e, B448_29::BIG f, B448_29::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B448_29::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, F448::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B448_29::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_FP256BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_FP256BN.h
new file mode 100644
index 0000000..fe567d2
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_FP256BN.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_FP256BN_H
+#define ECP_FP256BN_H
+
+#include "fp_FP256BN.h"
+#include "config_curve_FP256BN.h"
+
+using namespace core;
+
+namespace FP256BN {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B256_28::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_28::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_28::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_28::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B256_28::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B256_28::BIG CURVE_Ad;
+extern const B256_28::BIG CURVE_Bd;
+extern const B256_28::BIG PC[];
+
+extern const B256_28::BIG CURVE_Adr;
+extern const B256_28::BIG CURVE_Adi;
+extern const B256_28::BIG CURVE_Bdr;
+extern const B256_28::BIG CURVE_Bdi;
+extern const B256_28::BIG PCR[];
+extern const B256_28::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B256_28::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_28::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_28::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B256_28::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B256_28::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B256_28::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B256_28::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B256_28::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_28::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B256_28::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_28::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_28::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_28::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    FP256BN::FP x; /**< x-coordinate of point */
+#if CURVETYPE_FP256BN!=MONTGOMERY
+    FP256BN::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    FP256BN::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(FP256BN::FP *r, FP256BN::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B256_28::BIG x, int s);
+
+#if CURVETYPE_FP256BN==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_28::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B256_28::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_28::BIG x, B256_28::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B256_28::BIG x, B256_28::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B256_28::BIG e, B256_28::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B256_28::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B256_28::BIG e, B256_28::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B256_28::BIG e, B256_28::BIG f, B256_28::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B256_28::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, FP256BN::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B256_28::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_FP512BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_FP512BN.h
new file mode 100644
index 0000000..10ac9c3
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_FP512BN.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_FP512BN_H
+#define ECP_FP512BN_H
+
+#include "fp_FP512BN.h"
+#include "config_curve_FP512BN.h"
+
+using namespace core;
+
+namespace FP512BN {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B512_29::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B512_29::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B512_29::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B512_29::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B512_29::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B512_29::BIG CURVE_Ad;
+extern const B512_29::BIG CURVE_Bd;
+extern const B512_29::BIG PC[];
+
+extern const B512_29::BIG CURVE_Adr;
+extern const B512_29::BIG CURVE_Adi;
+extern const B512_29::BIG CURVE_Bdr;
+extern const B512_29::BIG CURVE_Bdi;
+extern const B512_29::BIG PCR[];
+extern const B512_29::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B512_29::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B512_29::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B512_29::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_29::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B512_29::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_29::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B512_29::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_29::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B512_29::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_29::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B512_29::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_29::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B512_29::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_29::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B512_29::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_29::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B512_29::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_29::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B512_29::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_29::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B512_29::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_29::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B512_29::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_29::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B512_29::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_29::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B512_29::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_29::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B512_29::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_29::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B512_29::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B512_29::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B512_29::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B512_29::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B512_29::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B512_29::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B512_29::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    FP512BN::FP x; /**< x-coordinate of point */
+#if CURVETYPE_FP512BN!=MONTGOMERY
+    FP512BN::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    FP512BN::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(FP512BN::FP *r, FP512BN::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B512_29::BIG x, int s);
+
+#if CURVETYPE_FP512BN==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B512_29::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B512_29::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B512_29::BIG x, B512_29::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B512_29::BIG x, B512_29::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B512_29::BIG e, B512_29::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B512_29::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B512_29::BIG e, B512_29::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B512_29::BIG e, B512_29::BIG f, B512_29::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B512_29::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, FP512BN::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B512_29::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_HIFIVE.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_HIFIVE.h
new file mode 100644
index 0000000..ae1b9d8
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_HIFIVE.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_HIFIVE_H
+#define ECP_HIFIVE_H
+
+#include "fp_HIFIVE.h"
+#include "config_curve_HIFIVE.h"
+
+using namespace core;
+
+namespace HIFIVE {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B336_29::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B336_29::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B336_29::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B336_29::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B336_29::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B336_29::BIG CURVE_Ad;
+extern const B336_29::BIG CURVE_Bd;
+extern const B336_29::BIG PC[];
+
+extern const B336_29::BIG CURVE_Adr;
+extern const B336_29::BIG CURVE_Adi;
+extern const B336_29::BIG CURVE_Bdr;
+extern const B336_29::BIG CURVE_Bdi;
+extern const B336_29::BIG PCR[];
+extern const B336_29::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B336_29::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B336_29::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B336_29::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B336_29::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B336_29::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B336_29::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B336_29::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B336_29::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B336_29::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B336_29::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B336_29::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B336_29::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B336_29::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B336_29::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B336_29::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B336_29::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B336_29::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B336_29::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B336_29::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B336_29::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B336_29::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B336_29::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B336_29::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B336_29::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B336_29::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B336_29::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B336_29::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B336_29::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B336_29::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B336_29::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B336_29::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B336_29::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B336_29::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B336_29::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B336_29::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B336_29::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B336_29::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    HIFIVE::FP x; /**< x-coordinate of point */
+#if CURVETYPE_HIFIVE!=MONTGOMERY
+    HIFIVE::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    HIFIVE::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(HIFIVE::FP *r, HIFIVE::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B336_29::BIG x, int s);
+
+#if CURVETYPE_HIFIVE==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B336_29::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B336_29::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B336_29::BIG x, B336_29::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B336_29::BIG x, B336_29::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B336_29::BIG e, B336_29::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B336_29::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B336_29::BIG e, B336_29::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B336_29::BIG e, B336_29::BIG f, B336_29::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B336_29::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, HIFIVE::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B336_29::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_JUBJUB.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_JUBJUB.h
new file mode 100644
index 0000000..2cea42a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_JUBJUB.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_JUBJUB_H
+#define ECP_JUBJUB_H
+
+#include "fp_JUBJUB.h"
+#include "config_curve_JUBJUB.h"
+
+using namespace core;
+
+namespace JUBJUB {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B256_29::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_29::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_29::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_29::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B256_29::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B256_29::BIG CURVE_Ad;
+extern const B256_29::BIG CURVE_Bd;
+extern const B256_29::BIG PC[];
+
+extern const B256_29::BIG CURVE_Adr;
+extern const B256_29::BIG CURVE_Adi;
+extern const B256_29::BIG CURVE_Bdr;
+extern const B256_29::BIG CURVE_Bdi;
+extern const B256_29::BIG PCR[];
+extern const B256_29::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B256_29::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_29::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_29::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B256_29::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B256_29::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B256_29::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B256_29::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B256_29::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_29::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B256_29::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_29::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_29::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_29::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    JUBJUB::FP x; /**< x-coordinate of point */
+#if CURVETYPE_JUBJUB!=MONTGOMERY
+    JUBJUB::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    JUBJUB::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(JUBJUB::FP *r, JUBJUB::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B256_29::BIG x, int s);
+
+#if CURVETYPE_JUBJUB==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_29::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B256_29::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_29::BIG x, B256_29::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B256_29::BIG x, B256_29::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B256_29::BIG e, B256_29::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B256_29::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B256_29::BIG e, B256_29::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B256_29::BIG e, B256_29::BIG f, B256_29::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B256_29::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, JUBJUB::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B256_29::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_MDC.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_MDC.h
new file mode 100644
index 0000000..a890f60
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_MDC.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_MDC_H
+#define ECP_MDC_H
+
+#include "fp_MDC.h"
+#include "config_curve_MDC.h"
+
+using namespace core;
+
+namespace MDC {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B256_28::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_28::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_28::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_28::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B256_28::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B256_28::BIG CURVE_Ad;
+extern const B256_28::BIG CURVE_Bd;
+extern const B256_28::BIG PC[];
+
+extern const B256_28::BIG CURVE_Adr;
+extern const B256_28::BIG CURVE_Adi;
+extern const B256_28::BIG CURVE_Bdr;
+extern const B256_28::BIG CURVE_Bdi;
+extern const B256_28::BIG PCR[];
+extern const B256_28::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B256_28::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_28::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_28::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B256_28::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B256_28::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B256_28::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B256_28::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B256_28::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_28::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B256_28::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_28::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_28::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_28::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    MDC::FP x; /**< x-coordinate of point */
+#if CURVETYPE_MDC!=MONTGOMERY
+    MDC::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    MDC::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(MDC::FP *r, MDC::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B256_28::BIG x, int s);
+
+#if CURVETYPE_MDC==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_28::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B256_28::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_28::BIG x, B256_28::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B256_28::BIG x, B256_28::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B256_28::BIG e, B256_28::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B256_28::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B256_28::BIG e, B256_28::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B256_28::BIG e, B256_28::BIG f, B256_28::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B256_28::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, MDC::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B256_28::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_NIST256.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_NIST256.h
new file mode 100644
index 0000000..ad089cd
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_NIST256.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_NIST256_H
+#define ECP_NIST256_H
+
+#include "fp_NIST256.h"
+#include "config_curve_NIST256.h"
+
+using namespace core;
+
+namespace NIST256 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B256_28::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_28::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_28::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_28::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B256_28::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B256_28::BIG CURVE_Ad;
+extern const B256_28::BIG CURVE_Bd;
+extern const B256_28::BIG PC[];
+
+extern const B256_28::BIG CURVE_Adr;
+extern const B256_28::BIG CURVE_Adi;
+extern const B256_28::BIG CURVE_Bdr;
+extern const B256_28::BIG CURVE_Bdi;
+extern const B256_28::BIG PCR[];
+extern const B256_28::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B256_28::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_28::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_28::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B256_28::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B256_28::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B256_28::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B256_28::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B256_28::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_28::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B256_28::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_28::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_28::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_28::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    NIST256::FP x; /**< x-coordinate of point */
+#if CURVETYPE_NIST256!=MONTGOMERY
+    NIST256::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    NIST256::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(NIST256::FP *r, NIST256::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B256_28::BIG x, int s);
+
+#if CURVETYPE_NIST256==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_28::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B256_28::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_28::BIG x, B256_28::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B256_28::BIG x, B256_28::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B256_28::BIG e, B256_28::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B256_28::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B256_28::BIG e, B256_28::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B256_28::BIG e, B256_28::BIG f, B256_28::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B256_28::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, NIST256::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B256_28::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_NIST384.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_NIST384.h
new file mode 100644
index 0000000..e244a07
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_NIST384.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_NIST384_H
+#define ECP_NIST384_H
+
+#include "fp_NIST384.h"
+#include "config_curve_NIST384.h"
+
+using namespace core;
+
+namespace NIST384 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B384_29::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B384_29::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B384_29::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B384_29::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B384_29::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B384_29::BIG CURVE_Ad;
+extern const B384_29::BIG CURVE_Bd;
+extern const B384_29::BIG PC[];
+
+extern const B384_29::BIG CURVE_Adr;
+extern const B384_29::BIG CURVE_Adi;
+extern const B384_29::BIG CURVE_Bdr;
+extern const B384_29::BIG CURVE_Bdi;
+extern const B384_29::BIG PCR[];
+extern const B384_29::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B384_29::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B384_29::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B384_29::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B384_29::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B384_29::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B384_29::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B384_29::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B384_29::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B384_29::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B384_29::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B384_29::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B384_29::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B384_29::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    NIST384::FP x; /**< x-coordinate of point */
+#if CURVETYPE_NIST384!=MONTGOMERY
+    NIST384::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    NIST384::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(NIST384::FP *r, NIST384::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B384_29::BIG x, int s);
+
+#if CURVETYPE_NIST384==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B384_29::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B384_29::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B384_29::BIG x, B384_29::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B384_29::BIG x, B384_29::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B384_29::BIG e, B384_29::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B384_29::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B384_29::BIG e, B384_29::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B384_29::BIG e, B384_29::BIG f, B384_29::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B384_29::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, NIST384::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B384_29::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_NIST521.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_NIST521.h
new file mode 100644
index 0000000..a49a1e6
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_NIST521.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_NIST521_H
+#define ECP_NIST521_H
+
+#include "fp_NIST521.h"
+#include "config_curve_NIST521.h"
+
+using namespace core;
+
+namespace NIST521 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B528_28::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B528_28::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B528_28::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B528_28::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B528_28::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B528_28::BIG CURVE_Ad;
+extern const B528_28::BIG CURVE_Bd;
+extern const B528_28::BIG PC[];
+
+extern const B528_28::BIG CURVE_Adr;
+extern const B528_28::BIG CURVE_Adi;
+extern const B528_28::BIG CURVE_Bdr;
+extern const B528_28::BIG CURVE_Bdi;
+extern const B528_28::BIG PCR[];
+extern const B528_28::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B528_28::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B528_28::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B528_28::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B528_28::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B528_28::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B528_28::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B528_28::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B528_28::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B528_28::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B528_28::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B528_28::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B528_28::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B528_28::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B528_28::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B528_28::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B528_28::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B528_28::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B528_28::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B528_28::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B528_28::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B528_28::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B528_28::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B528_28::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B528_28::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B528_28::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B528_28::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B528_28::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B528_28::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B528_28::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B528_28::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B528_28::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B528_28::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B528_28::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B528_28::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B528_28::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B528_28::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B528_28::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    NIST521::FP x; /**< x-coordinate of point */
+#if CURVETYPE_NIST521!=MONTGOMERY
+    NIST521::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    NIST521::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(NIST521::FP *r, NIST521::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B528_28::BIG x, int s);
+
+#if CURVETYPE_NIST521==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B528_28::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B528_28::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B528_28::BIG x, B528_28::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B528_28::BIG x, B528_28::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B528_28::BIG e, B528_28::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B528_28::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B528_28::BIG e, B528_28::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B528_28::BIG e, B528_28::BIG f, B528_28::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B528_28::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, NIST521::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B528_28::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_NUMS256E.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_NUMS256E.h
new file mode 100644
index 0000000..caa3b9f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_NUMS256E.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_NUMS256E_H
+#define ECP_NUMS256E_H
+
+#include "fp_F256PME.h"
+#include "config_curve_NUMS256E.h"
+
+using namespace core;
+
+namespace NUMS256E {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B256_29::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_29::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_29::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_29::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B256_29::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B256_29::BIG CURVE_Ad;
+extern const B256_29::BIG CURVE_Bd;
+extern const B256_29::BIG PC[];
+
+extern const B256_29::BIG CURVE_Adr;
+extern const B256_29::BIG CURVE_Adi;
+extern const B256_29::BIG CURVE_Bdr;
+extern const B256_29::BIG CURVE_Bdi;
+extern const B256_29::BIG PCR[];
+extern const B256_29::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B256_29::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_29::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_29::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B256_29::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B256_29::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B256_29::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B256_29::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B256_29::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_29::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B256_29::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_29::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_29::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_29::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    F256PME::FP x; /**< x-coordinate of point */
+#if CURVETYPE_NUMS256E!=MONTGOMERY
+    F256PME::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    F256PME::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(F256PME::FP *r, F256PME::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B256_29::BIG x, int s);
+
+#if CURVETYPE_NUMS256E==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_29::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B256_29::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_29::BIG x, B256_29::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B256_29::BIG x, B256_29::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B256_29::BIG e, B256_29::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B256_29::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B256_29::BIG e, B256_29::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B256_29::BIG e, B256_29::BIG f, B256_29::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B256_29::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, F256PME::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B256_29::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_NUMS256W.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_NUMS256W.h
new file mode 100644
index 0000000..9cf3fe0
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_NUMS256W.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_NUMS256W_H
+#define ECP_NUMS256W_H
+
+#include "fp_F256PMW.h"
+#include "config_curve_NUMS256W.h"
+
+using namespace core;
+
+namespace NUMS256W {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B256_28::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_28::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_28::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_28::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B256_28::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B256_28::BIG CURVE_Ad;
+extern const B256_28::BIG CURVE_Bd;
+extern const B256_28::BIG PC[];
+
+extern const B256_28::BIG CURVE_Adr;
+extern const B256_28::BIG CURVE_Adi;
+extern const B256_28::BIG CURVE_Bdr;
+extern const B256_28::BIG CURVE_Bdi;
+extern const B256_28::BIG PCR[];
+extern const B256_28::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B256_28::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_28::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_28::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B256_28::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B256_28::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B256_28::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B256_28::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B256_28::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_28::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B256_28::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_28::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_28::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_28::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    F256PMW::FP x; /**< x-coordinate of point */
+#if CURVETYPE_NUMS256W!=MONTGOMERY
+    F256PMW::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    F256PMW::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(F256PMW::FP *r, F256PMW::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B256_28::BIG x, int s);
+
+#if CURVETYPE_NUMS256W==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_28::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B256_28::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_28::BIG x, B256_28::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B256_28::BIG x, B256_28::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B256_28::BIG e, B256_28::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B256_28::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B256_28::BIG e, B256_28::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B256_28::BIG e, B256_28::BIG f, B256_28::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B256_28::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, F256PMW::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B256_28::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_NUMS384E.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_NUMS384E.h
new file mode 100644
index 0000000..87140a0
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_NUMS384E.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_NUMS384E_H
+#define ECP_NUMS384E_H
+
+#include "fp_F384PM.h"
+#include "config_curve_NUMS384E.h"
+
+using namespace core;
+
+namespace NUMS384E {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B384_29::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B384_29::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B384_29::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B384_29::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B384_29::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B384_29::BIG CURVE_Ad;
+extern const B384_29::BIG CURVE_Bd;
+extern const B384_29::BIG PC[];
+
+extern const B384_29::BIG CURVE_Adr;
+extern const B384_29::BIG CURVE_Adi;
+extern const B384_29::BIG CURVE_Bdr;
+extern const B384_29::BIG CURVE_Bdi;
+extern const B384_29::BIG PCR[];
+extern const B384_29::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B384_29::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B384_29::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B384_29::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B384_29::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B384_29::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B384_29::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B384_29::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B384_29::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B384_29::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B384_29::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B384_29::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B384_29::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B384_29::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    F384PM::FP x; /**< x-coordinate of point */
+#if CURVETYPE_NUMS384E!=MONTGOMERY
+    F384PM::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    F384PM::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(F384PM::FP *r, F384PM::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B384_29::BIG x, int s);
+
+#if CURVETYPE_NUMS384E==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B384_29::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B384_29::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B384_29::BIG x, B384_29::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B384_29::BIG x, B384_29::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B384_29::BIG e, B384_29::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B384_29::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B384_29::BIG e, B384_29::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B384_29::BIG e, B384_29::BIG f, B384_29::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B384_29::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, F384PM::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B384_29::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_NUMS384W.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_NUMS384W.h
new file mode 100644
index 0000000..273713a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_NUMS384W.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_NUMS384W_H
+#define ECP_NUMS384W_H
+
+#include "fp_F384PM.h"
+#include "config_curve_NUMS384W.h"
+
+using namespace core;
+
+namespace NUMS384W {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B384_29::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B384_29::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B384_29::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B384_29::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B384_29::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B384_29::BIG CURVE_Ad;
+extern const B384_29::BIG CURVE_Bd;
+extern const B384_29::BIG PC[];
+
+extern const B384_29::BIG CURVE_Adr;
+extern const B384_29::BIG CURVE_Adi;
+extern const B384_29::BIG CURVE_Bdr;
+extern const B384_29::BIG CURVE_Bdi;
+extern const B384_29::BIG PCR[];
+extern const B384_29::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B384_29::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B384_29::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B384_29::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B384_29::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B384_29::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B384_29::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_29::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B384_29::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B384_29::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B384_29::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B384_29::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B384_29::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B384_29::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B384_29::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    F384PM::FP x; /**< x-coordinate of point */
+#if CURVETYPE_NUMS384W!=MONTGOMERY
+    F384PM::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    F384PM::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(F384PM::FP *r, F384PM::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B384_29::BIG x, int s);
+
+#if CURVETYPE_NUMS384W==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B384_29::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B384_29::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B384_29::BIG x, B384_29::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B384_29::BIG x, B384_29::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B384_29::BIG e, B384_29::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B384_29::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B384_29::BIG e, B384_29::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B384_29::BIG e, B384_29::BIG f, B384_29::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B384_29::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, F384PM::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B384_29::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_NUMS512E.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_NUMS512E.h
new file mode 100644
index 0000000..e95f7e8
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_NUMS512E.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_NUMS512E_H
+#define ECP_NUMS512E_H
+
+#include "fp_F512PM.h"
+#include "config_curve_NUMS512E.h"
+
+using namespace core;
+
+namespace NUMS512E {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B512_29::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B512_29::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B512_29::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B512_29::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B512_29::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B512_29::BIG CURVE_Ad;
+extern const B512_29::BIG CURVE_Bd;
+extern const B512_29::BIG PC[];
+
+extern const B512_29::BIG CURVE_Adr;
+extern const B512_29::BIG CURVE_Adi;
+extern const B512_29::BIG CURVE_Bdr;
+extern const B512_29::BIG CURVE_Bdi;
+extern const B512_29::BIG PCR[];
+extern const B512_29::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B512_29::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B512_29::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B512_29::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_29::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B512_29::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_29::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B512_29::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_29::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B512_29::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_29::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B512_29::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_29::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B512_29::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_29::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B512_29::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_29::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B512_29::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_29::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B512_29::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_29::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B512_29::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_29::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B512_29::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_29::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B512_29::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_29::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B512_29::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_29::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B512_29::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_29::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B512_29::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B512_29::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B512_29::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B512_29::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B512_29::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B512_29::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B512_29::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    F512PM::FP x; /**< x-coordinate of point */
+#if CURVETYPE_NUMS512E!=MONTGOMERY
+    F512PM::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    F512PM::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(F512PM::FP *r, F512PM::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B512_29::BIG x, int s);
+
+#if CURVETYPE_NUMS512E==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B512_29::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B512_29::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B512_29::BIG x, B512_29::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B512_29::BIG x, B512_29::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B512_29::BIG e, B512_29::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B512_29::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B512_29::BIG e, B512_29::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B512_29::BIG e, B512_29::BIG f, B512_29::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B512_29::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, F512PM::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B512_29::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_NUMS512W.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_NUMS512W.h
new file mode 100644
index 0000000..c49f5e8
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_NUMS512W.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_NUMS512W_H
+#define ECP_NUMS512W_H
+
+#include "fp_F512PM.h"
+#include "config_curve_NUMS512W.h"
+
+using namespace core;
+
+namespace NUMS512W {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B512_29::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B512_29::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B512_29::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B512_29::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B512_29::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B512_29::BIG CURVE_Ad;
+extern const B512_29::BIG CURVE_Bd;
+extern const B512_29::BIG PC[];
+
+extern const B512_29::BIG CURVE_Adr;
+extern const B512_29::BIG CURVE_Adi;
+extern const B512_29::BIG CURVE_Bdr;
+extern const B512_29::BIG CURVE_Bdi;
+extern const B512_29::BIG PCR[];
+extern const B512_29::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B512_29::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B512_29::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B512_29::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_29::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B512_29::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_29::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B512_29::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_29::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B512_29::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_29::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B512_29::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_29::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B512_29::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_29::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B512_29::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_29::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B512_29::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_29::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B512_29::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_29::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B512_29::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_29::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B512_29::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_29::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B512_29::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_29::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B512_29::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_29::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B512_29::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_29::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B512_29::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B512_29::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B512_29::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B512_29::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B512_29::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B512_29::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B512_29::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    F512PM::FP x; /**< x-coordinate of point */
+#if CURVETYPE_NUMS512W!=MONTGOMERY
+    F512PM::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    F512PM::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(F512PM::FP *r, F512PM::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B512_29::BIG x, int s);
+
+#if CURVETYPE_NUMS512W==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B512_29::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B512_29::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B512_29::BIG x, B512_29::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B512_29::BIG x, B512_29::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B512_29::BIG e, B512_29::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B512_29::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B512_29::BIG e, B512_29::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B512_29::BIG e, B512_29::BIG f, B512_29::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B512_29::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, F512PM::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B512_29::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_SECP160R1.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_SECP160R1.h
new file mode 100644
index 0000000..9adef2e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_SECP160R1.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_SECP160R1_H
+#define ECP_SECP160R1_H
+
+#include "fp_SECP160R1.h"
+#include "config_curve_SECP160R1.h"
+
+using namespace core;
+
+namespace SECP160R1 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B160_29::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B160_29::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B160_29::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B160_29::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B160_29::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B160_29::BIG CURVE_Ad;
+extern const B160_29::BIG CURVE_Bd;
+extern const B160_29::BIG PC[];
+
+extern const B160_29::BIG CURVE_Adr;
+extern const B160_29::BIG CURVE_Adi;
+extern const B160_29::BIG CURVE_Bdr;
+extern const B160_29::BIG CURVE_Bdi;
+extern const B160_29::BIG PCR[];
+extern const B160_29::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B160_29::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B160_29::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B160_29::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B160_29::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B160_29::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B160_29::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B160_29::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B160_29::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B160_29::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B160_29::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B160_29::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B160_29::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B160_29::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B160_29::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B160_29::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B160_29::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B160_29::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B160_29::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B160_29::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B160_29::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B160_29::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B160_29::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B160_29::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B160_29::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B160_29::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B160_29::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B160_29::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B160_29::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B160_29::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B160_29::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B160_29::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B160_29::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B160_29::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B160_29::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B160_29::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B160_29::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B160_29::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    SECP160R1::FP x; /**< x-coordinate of point */
+#if CURVETYPE_SECP160R1!=MONTGOMERY
+    SECP160R1::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    SECP160R1::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(SECP160R1::FP *r, SECP160R1::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B160_29::BIG x, int s);
+
+#if CURVETYPE_SECP160R1==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B160_29::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B160_29::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B160_29::BIG x, B160_29::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B160_29::BIG x, B160_29::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B160_29::BIG e, B160_29::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B160_29::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B160_29::BIG e, B160_29::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B160_29::BIG e, B160_29::BIG f, B160_29::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B160_29::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, SECP160R1::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B160_29::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_SECP256K1.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_SECP256K1.h
new file mode 100644
index 0000000..2443211
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_SECP256K1.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_SECP256K1_H
+#define ECP_SECP256K1_H
+
+#include "fp_SECP256K1.h"
+#include "config_curve_SECP256K1.h"
+
+using namespace core;
+
+namespace SECP256K1 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B256_28::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_28::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_28::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_28::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B256_28::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B256_28::BIG CURVE_Ad;
+extern const B256_28::BIG CURVE_Bd;
+extern const B256_28::BIG PC[];
+
+extern const B256_28::BIG CURVE_Adr;
+extern const B256_28::BIG CURVE_Adi;
+extern const B256_28::BIG CURVE_Bdr;
+extern const B256_28::BIG CURVE_Bdi;
+extern const B256_28::BIG PCR[];
+extern const B256_28::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B256_28::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_28::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_28::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B256_28::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B256_28::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B256_28::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B256_28::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B256_28::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_28::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B256_28::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_28::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_28::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_28::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    SECP256K1::FP x; /**< x-coordinate of point */
+#if CURVETYPE_SECP256K1!=MONTGOMERY
+    SECP256K1::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    SECP256K1::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(SECP256K1::FP *r, SECP256K1::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B256_28::BIG x, int s);
+
+#if CURVETYPE_SECP256K1==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_28::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B256_28::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_28::BIG x, B256_28::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B256_28::BIG x, B256_28::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B256_28::BIG e, B256_28::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B256_28::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B256_28::BIG e, B256_28::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B256_28::BIG e, B256_28::BIG f, B256_28::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B256_28::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, SECP256K1::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B256_28::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_SM2.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_SM2.h
new file mode 100644
index 0000000..1c25efd
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_SM2.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_SM2_H
+#define ECP_SM2_H
+
+#include "fp_SM2.h"
+#include "config_curve_SM2.h"
+
+using namespace core;
+
+namespace SM2 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B256_28::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_28::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_28::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_28::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B256_28::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B256_28::BIG CURVE_Ad;
+extern const B256_28::BIG CURVE_Bd;
+extern const B256_28::BIG PC[];
+
+extern const B256_28::BIG CURVE_Adr;
+extern const B256_28::BIG CURVE_Adi;
+extern const B256_28::BIG CURVE_Bdr;
+extern const B256_28::BIG CURVE_Bdi;
+extern const B256_28::BIG PCR[];
+extern const B256_28::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B256_28::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_28::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_28::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B256_28::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B256_28::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B256_28::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_28::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B256_28::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B256_28::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_28::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B256_28::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_28::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_28::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_28::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    SM2::FP x; /**< x-coordinate of point */
+#if CURVETYPE_SM2!=MONTGOMERY
+    SM2::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    SM2::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(SM2::FP *r, SM2::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B256_28::BIG x, int s);
+
+#if CURVETYPE_SM2==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_28::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B256_28::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_28::BIG x, B256_28::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B256_28::BIG x, B256_28::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B256_28::BIG e, B256_28::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B256_28::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B256_28::BIG e, B256_28::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B256_28::BIG e, B256_28::BIG f, B256_28::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B256_28::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, SM2::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B256_28::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_TWEEDLEDEE.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_TWEEDLEDEE.h
new file mode 100644
index 0000000..a0d2856
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_TWEEDLEDEE.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_TWEEDLEDEE_H
+#define ECP_TWEEDLEDEE_H
+
+#include "fp_TWEEDLEDEE.h"
+#include "config_curve_TWEEDLEDEE.h"
+
+using namespace core;
+
+namespace TWEEDLEDEE {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B256_29::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_29::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_29::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_29::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B256_29::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B256_29::BIG CURVE_Ad;
+extern const B256_29::BIG CURVE_Bd;
+extern const B256_29::BIG PC[];
+
+extern const B256_29::BIG CURVE_Adr;
+extern const B256_29::BIG CURVE_Adi;
+extern const B256_29::BIG CURVE_Bdr;
+extern const B256_29::BIG CURVE_Bdi;
+extern const B256_29::BIG PCR[];
+extern const B256_29::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B256_29::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_29::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_29::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B256_29::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B256_29::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B256_29::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B256_29::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B256_29::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_29::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B256_29::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_29::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_29::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_29::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    TWEEDLEDEE::FP x; /**< x-coordinate of point */
+#if CURVETYPE_TWEEDLEDEE!=MONTGOMERY
+    TWEEDLEDEE::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    TWEEDLEDEE::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(TWEEDLEDEE::FP *r, TWEEDLEDEE::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B256_29::BIG x, int s);
+
+#if CURVETYPE_TWEEDLEDEE==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_29::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B256_29::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_29::BIG x, B256_29::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B256_29::BIG x, B256_29::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B256_29::BIG e, B256_29::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B256_29::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B256_29::BIG e, B256_29::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B256_29::BIG e, B256_29::BIG f, B256_29::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B256_29::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, TWEEDLEDEE::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B256_29::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_TWEEDLEDUM.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_TWEEDLEDUM.h
new file mode 100644
index 0000000..cb3e928
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_TWEEDLEDUM.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_TWEEDLEDUM_H
+#define ECP_TWEEDLEDUM_H
+
+#include "fp_TWEEDLEDUM.h"
+#include "config_curve_TWEEDLEDUM.h"
+
+using namespace core;
+
+namespace TWEEDLEDUM {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B256_29::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_29::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_29::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_29::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B256_29::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B256_29::BIG CURVE_Ad;
+extern const B256_29::BIG CURVE_Bd;
+extern const B256_29::BIG PC[];
+
+extern const B256_29::BIG CURVE_Adr;
+extern const B256_29::BIG CURVE_Adi;
+extern const B256_29::BIG CURVE_Bdr;
+extern const B256_29::BIG CURVE_Bdi;
+extern const B256_29::BIG PCR[];
+extern const B256_29::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B256_29::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_29::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_29::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B256_29::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B256_29::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B256_29::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_29::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B256_29::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B256_29::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_29::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B256_29::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_29::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_29::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_29::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    TWEEDLEDUM::FP x; /**< x-coordinate of point */
+#if CURVETYPE_TWEEDLEDUM!=MONTGOMERY
+    TWEEDLEDUM::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    TWEEDLEDUM::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(TWEEDLEDUM::FP *r, TWEEDLEDUM::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B256_29::BIG x, int s);
+
+#if CURVETYPE_TWEEDLEDUM==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_29::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B256_29::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_29::BIG x, B256_29::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B256_29::BIG x, B256_29::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B256_29::BIG e, B256_29::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B256_29::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B256_29::BIG e, B256_29::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B256_29::BIG e, B256_29::BIG f, B256_29::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B256_29::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, TWEEDLEDUM::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B256_29::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_X448.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_X448.h
new file mode 100644
index 0000000..feca86a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ecp_X448.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_X448_H
+#define ECP_X448_H
+
+#include "fp_F448.h"
+#include "config_curve_X448.h"
+
+using namespace core;
+
+namespace X448 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B448_29::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B448_29::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B448_29::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B448_29::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B448_29::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B448_29::BIG CURVE_Ad;
+extern const B448_29::BIG CURVE_Bd;
+extern const B448_29::BIG PC[];
+
+extern const B448_29::BIG CURVE_Adr;
+extern const B448_29::BIG CURVE_Adi;
+extern const B448_29::BIG CURVE_Bdr;
+extern const B448_29::BIG CURVE_Bdi;
+extern const B448_29::BIG PCR[];
+extern const B448_29::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B448_29::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B448_29::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B448_29::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_29::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B448_29::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_29::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B448_29::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_29::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B448_29::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_29::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B448_29::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_29::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B448_29::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_29::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B448_29::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_29::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B448_29::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_29::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B448_29::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_29::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B448_29::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_29::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B448_29::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_29::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B448_29::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_29::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B448_29::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_29::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B448_29::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_29::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B448_29::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B448_29::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B448_29::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B448_29::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B448_29::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B448_29::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B448_29::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    F448::FP x; /**< x-coordinate of point */
+#if CURVETYPE_X448!=MONTGOMERY
+    F448::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    F448::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(F448::FP *r, F448::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B448_29::BIG x, int s);
+
+#if CURVETYPE_X448==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B448_29::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B448_29::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B448_29::BIG x, B448_29::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B448_29::BIG x, B448_29::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B448_29::BIG e, B448_29::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B448_29::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B448_29::BIG e, B448_29::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B448_29::BIG e, B448_29::BIG f, B448_29::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B448_29::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, F448::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B448_29::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa.h
new file mode 100644
index 0000000..a7cb9ab
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_ZZZ_H
+#define EDDSA_ZZZ_H
+
+#include "ecp_ZZZ.h"
+
+using namespace core;
+
+#define EGS_ZZZ MODBYTES_XXX  /**< ECC Group Size in bytes */
+#define EFS_ZZZ MODBYTES_XXX  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace ZZZ {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_ANSSI.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_ANSSI.h
new file mode 100644
index 0000000..cd899eb
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_ANSSI.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_ANSSI_H
+#define EDDSA_ANSSI_H
+
+#include "ecp_ANSSI.h"
+
+using namespace core;
+
+#define EGS_ANSSI MODBYTES_B256_28  /**< ECC Group Size in bytes */
+#define EFS_ANSSI MODBYTES_B256_28  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace ANSSI {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_BLS12381.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_BLS12381.h
new file mode 100644
index 0000000..775f40c
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_BLS12381.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_BLS12381_H
+#define EDDSA_BLS12381_H
+
+#include "ecp_BLS12381.h"
+
+using namespace core;
+
+#define EGS_BLS12381 MODBYTES_B384_29  /**< ECC Group Size in bytes */
+#define EFS_BLS12381 MODBYTES_B384_29  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace BLS12381 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_BLS12383.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_BLS12383.h
new file mode 100644
index 0000000..9333620
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_BLS12383.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_BLS12383_H
+#define EDDSA_BLS12383_H
+
+#include "ecp_BLS12383.h"
+
+using namespace core;
+
+#define EGS_BLS12383 MODBYTES_B384_29  /**< ECC Group Size in bytes */
+#define EFS_BLS12383 MODBYTES_B384_29  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace BLS12383 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_BLS12443.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_BLS12443.h
new file mode 100644
index 0000000..c38a9b1
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_BLS12443.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_BLS12443_H
+#define EDDSA_BLS12443_H
+
+#include "ecp_BLS12443.h"
+
+using namespace core;
+
+#define EGS_BLS12443 MODBYTES_B448_29  /**< ECC Group Size in bytes */
+#define EFS_BLS12443 MODBYTES_B448_29  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace BLS12443 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_BLS12461.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_BLS12461.h
new file mode 100644
index 0000000..96670f9
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_BLS12461.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_BLS12461_H
+#define EDDSA_BLS12461_H
+
+#include "ecp_BLS12461.h"
+
+using namespace core;
+
+#define EGS_BLS12461 MODBYTES_B464_28  /**< ECC Group Size in bytes */
+#define EFS_BLS12461 MODBYTES_B464_28  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace BLS12461 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_BLS24479.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_BLS24479.h
new file mode 100644
index 0000000..b31fb33
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_BLS24479.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_BLS24479_H
+#define EDDSA_BLS24479_H
+
+#include "ecp_BLS24479.h"
+
+using namespace core;
+
+#define EGS_BLS24479 MODBYTES_B480_29  /**< ECC Group Size in bytes */
+#define EFS_BLS24479 MODBYTES_B480_29  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace BLS24479 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_BLS48286.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_BLS48286.h
new file mode 100644
index 0000000..df178bc
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_BLS48286.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_BLS48286_H
+#define EDDSA_BLS48286_H
+
+#include "ecp_BLS48286.h"
+
+using namespace core;
+
+#define EGS_BLS48286 MODBYTES_B288_29  /**< ECC Group Size in bytes */
+#define EFS_BLS48286 MODBYTES_B288_29  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace BLS48286 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_BLS48556.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_BLS48556.h
new file mode 100644
index 0000000..2c5f413
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_BLS48556.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_BLS48556_H
+#define EDDSA_BLS48556_H
+
+#include "ecp_BLS48556.h"
+
+using namespace core;
+
+#define EGS_BLS48556 MODBYTES_B560_29  /**< ECC Group Size in bytes */
+#define EFS_BLS48556 MODBYTES_B560_29  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace BLS48556 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_BLS48581.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_BLS48581.h
new file mode 100644
index 0000000..d25bb47
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_BLS48581.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_BLS48581_H
+#define EDDSA_BLS48581_H
+
+#include "ecp_BLS48581.h"
+
+using namespace core;
+
+#define EGS_BLS48581 MODBYTES_B584_29  /**< ECC Group Size in bytes */
+#define EFS_BLS48581 MODBYTES_B584_29  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace BLS48581 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_BN158.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_BN158.h
new file mode 100644
index 0000000..bd5b6fc
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_BN158.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_BN158_H
+#define EDDSA_BN158_H
+
+#include "ecp_BN158.h"
+
+using namespace core;
+
+#define EGS_BN158 MODBYTES_B160_28  /**< ECC Group Size in bytes */
+#define EFS_BN158 MODBYTES_B160_28  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace BN158 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_BN254.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_BN254.h
new file mode 100644
index 0000000..8e73b45
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_BN254.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_BN254_H
+#define EDDSA_BN254_H
+
+#include "ecp_BN254.h"
+
+using namespace core;
+
+#define EGS_BN254 MODBYTES_B256_28  /**< ECC Group Size in bytes */
+#define EFS_BN254 MODBYTES_B256_28  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace BN254 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_BN254CX.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_BN254CX.h
new file mode 100644
index 0000000..bb1082f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_BN254CX.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_BN254CX_H
+#define EDDSA_BN254CX_H
+
+#include "ecp_BN254CX.h"
+
+using namespace core;
+
+#define EGS_BN254CX MODBYTES_B256_28  /**< ECC Group Size in bytes */
+#define EFS_BN254CX MODBYTES_B256_28  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace BN254CX {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_BN462.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_BN462.h
new file mode 100644
index 0000000..3c022c6
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_BN462.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_BN462_H
+#define EDDSA_BN462_H
+
+#include "ecp_BN462.h"
+
+using namespace core;
+
+#define EGS_BN462 MODBYTES_B464_28  /**< ECC Group Size in bytes */
+#define EFS_BN462 MODBYTES_B464_28  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace BN462 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_BRAINPOOL.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_BRAINPOOL.h
new file mode 100644
index 0000000..f832bfc
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_BRAINPOOL.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_BRAINPOOL_H
+#define EDDSA_BRAINPOOL_H
+
+#include "ecp_BRAINPOOL.h"
+
+using namespace core;
+
+#define EGS_BRAINPOOL MODBYTES_B256_28  /**< ECC Group Size in bytes */
+#define EFS_BRAINPOOL MODBYTES_B256_28  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace BRAINPOOL {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_C1174.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_C1174.h
new file mode 100644
index 0000000..cf7a59b
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_C1174.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_C1174_H
+#define EDDSA_C1174_H
+
+#include "ecp_C1174.h"
+
+using namespace core;
+
+#define EGS_C1174 MODBYTES_B256_29  /**< ECC Group Size in bytes */
+#define EFS_C1174 MODBYTES_B256_29  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace C1174 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_C13318.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_C13318.h
new file mode 100644
index 0000000..477b1a6
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_C13318.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_C13318_H
+#define EDDSA_C13318_H
+
+#include "ecp_C13318.h"
+
+using namespace core;
+
+#define EGS_C13318 MODBYTES_B256_29  /**< ECC Group Size in bytes */
+#define EFS_C13318 MODBYTES_B256_29  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace C13318 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_C1665.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_C1665.h
new file mode 100644
index 0000000..b4d6bcb
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_C1665.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_C1665_H
+#define EDDSA_C1665_H
+
+#include "ecp_C1665.h"
+
+using namespace core;
+
+#define EGS_C1665 MODBYTES_B168_29  /**< ECC Group Size in bytes */
+#define EFS_C1665 MODBYTES_B168_29  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace C1665 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_C25519.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_C25519.h
new file mode 100644
index 0000000..8b5dec1
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_C25519.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_C25519_H
+#define EDDSA_C25519_H
+
+#include "ecp_C25519.h"
+
+using namespace core;
+
+#define EGS_C25519 MODBYTES_B256_29  /**< ECC Group Size in bytes */
+#define EFS_C25519 MODBYTES_B256_29  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace C25519 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_C41417.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_C41417.h
new file mode 100644
index 0000000..21e10dd
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_C41417.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_C41417_H
+#define EDDSA_C41417_H
+
+#include "ecp_C41417.h"
+
+using namespace core;
+
+#define EGS_C41417 MODBYTES_B416_29  /**< ECC Group Size in bytes */
+#define EFS_C41417 MODBYTES_B416_29  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace C41417 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_Ed25519.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_Ed25519.h
new file mode 100644
index 0000000..ef60a40
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_Ed25519.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_Ed25519_H
+#define EDDSA_Ed25519_H
+
+#include "ecp_Ed25519.h"
+
+using namespace core;
+
+#define EGS_Ed25519 MODBYTES_B256_29  /**< ECC Group Size in bytes */
+#define EFS_Ed25519 MODBYTES_B256_29  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace Ed25519 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_Ed448.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_Ed448.h
new file mode 100644
index 0000000..a8d8b9f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_Ed448.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_Ed448_H
+#define EDDSA_Ed448_H
+
+#include "ecp_Ed448.h"
+
+using namespace core;
+
+#define EGS_Ed448 MODBYTES_B448_29  /**< ECC Group Size in bytes */
+#define EFS_Ed448 MODBYTES_B448_29  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace Ed448 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_FP256BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_FP256BN.h
new file mode 100644
index 0000000..6fc8cd4
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_FP256BN.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_FP256BN_H
+#define EDDSA_FP256BN_H
+
+#include "ecp_FP256BN.h"
+
+using namespace core;
+
+#define EGS_FP256BN MODBYTES_B256_28  /**< ECC Group Size in bytes */
+#define EFS_FP256BN MODBYTES_B256_28  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace FP256BN {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_FP512BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_FP512BN.h
new file mode 100644
index 0000000..2888845
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_FP512BN.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_FP512BN_H
+#define EDDSA_FP512BN_H
+
+#include "ecp_FP512BN.h"
+
+using namespace core;
+
+#define EGS_FP512BN MODBYTES_B512_29  /**< ECC Group Size in bytes */
+#define EFS_FP512BN MODBYTES_B512_29  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace FP512BN {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_HIFIVE.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_HIFIVE.h
new file mode 100644
index 0000000..b1af1e5
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_HIFIVE.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_HIFIVE_H
+#define EDDSA_HIFIVE_H
+
+#include "ecp_HIFIVE.h"
+
+using namespace core;
+
+#define EGS_HIFIVE MODBYTES_B336_29  /**< ECC Group Size in bytes */
+#define EFS_HIFIVE MODBYTES_B336_29  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace HIFIVE {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_JUBJUB.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_JUBJUB.h
new file mode 100644
index 0000000..2c0dad8
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_JUBJUB.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_JUBJUB_H
+#define EDDSA_JUBJUB_H
+
+#include "ecp_JUBJUB.h"
+
+using namespace core;
+
+#define EGS_JUBJUB MODBYTES_B256_29  /**< ECC Group Size in bytes */
+#define EFS_JUBJUB MODBYTES_B256_29  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace JUBJUB {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_MDC.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_MDC.h
new file mode 100644
index 0000000..8ca7b39
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_MDC.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_MDC_H
+#define EDDSA_MDC_H
+
+#include "ecp_MDC.h"
+
+using namespace core;
+
+#define EGS_MDC MODBYTES_B256_28  /**< ECC Group Size in bytes */
+#define EFS_MDC MODBYTES_B256_28  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace MDC {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_NIST256.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_NIST256.h
new file mode 100644
index 0000000..dcf3a1b
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_NIST256.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_NIST256_H
+#define EDDSA_NIST256_H
+
+#include "ecp_NIST256.h"
+
+using namespace core;
+
+#define EGS_NIST256 MODBYTES_B256_28  /**< ECC Group Size in bytes */
+#define EFS_NIST256 MODBYTES_B256_28  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace NIST256 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_NIST384.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_NIST384.h
new file mode 100644
index 0000000..6843c01
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_NIST384.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_NIST384_H
+#define EDDSA_NIST384_H
+
+#include "ecp_NIST384.h"
+
+using namespace core;
+
+#define EGS_NIST384 MODBYTES_B384_29  /**< ECC Group Size in bytes */
+#define EFS_NIST384 MODBYTES_B384_29  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace NIST384 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_NIST521.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_NIST521.h
new file mode 100644
index 0000000..f828c7b
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_NIST521.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_NIST521_H
+#define EDDSA_NIST521_H
+
+#include "ecp_NIST521.h"
+
+using namespace core;
+
+#define EGS_NIST521 MODBYTES_B528_28  /**< ECC Group Size in bytes */
+#define EFS_NIST521 MODBYTES_B528_28  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace NIST521 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_NUMS256E.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_NUMS256E.h
new file mode 100644
index 0000000..96ec2b9
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_NUMS256E.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_NUMS256E_H
+#define EDDSA_NUMS256E_H
+
+#include "ecp_NUMS256E.h"
+
+using namespace core;
+
+#define EGS_NUMS256E MODBYTES_B256_29  /**< ECC Group Size in bytes */
+#define EFS_NUMS256E MODBYTES_B256_29  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace NUMS256E {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_NUMS256W.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_NUMS256W.h
new file mode 100644
index 0000000..c540adc
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_NUMS256W.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_NUMS256W_H
+#define EDDSA_NUMS256W_H
+
+#include "ecp_NUMS256W.h"
+
+using namespace core;
+
+#define EGS_NUMS256W MODBYTES_B256_28  /**< ECC Group Size in bytes */
+#define EFS_NUMS256W MODBYTES_B256_28  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace NUMS256W {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_NUMS384E.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_NUMS384E.h
new file mode 100644
index 0000000..8623d3e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_NUMS384E.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_NUMS384E_H
+#define EDDSA_NUMS384E_H
+
+#include "ecp_NUMS384E.h"
+
+using namespace core;
+
+#define EGS_NUMS384E MODBYTES_B384_29  /**< ECC Group Size in bytes */
+#define EFS_NUMS384E MODBYTES_B384_29  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace NUMS384E {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_NUMS384W.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_NUMS384W.h
new file mode 100644
index 0000000..da22946
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_NUMS384W.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_NUMS384W_H
+#define EDDSA_NUMS384W_H
+
+#include "ecp_NUMS384W.h"
+
+using namespace core;
+
+#define EGS_NUMS384W MODBYTES_B384_29  /**< ECC Group Size in bytes */
+#define EFS_NUMS384W MODBYTES_B384_29  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace NUMS384W {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_NUMS512E.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_NUMS512E.h
new file mode 100644
index 0000000..eee7172
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_NUMS512E.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_NUMS512E_H
+#define EDDSA_NUMS512E_H
+
+#include "ecp_NUMS512E.h"
+
+using namespace core;
+
+#define EGS_NUMS512E MODBYTES_B512_29  /**< ECC Group Size in bytes */
+#define EFS_NUMS512E MODBYTES_B512_29  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace NUMS512E {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_NUMS512W.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_NUMS512W.h
new file mode 100644
index 0000000..777f286
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_NUMS512W.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_NUMS512W_H
+#define EDDSA_NUMS512W_H
+
+#include "ecp_NUMS512W.h"
+
+using namespace core;
+
+#define EGS_NUMS512W MODBYTES_B512_29  /**< ECC Group Size in bytes */
+#define EFS_NUMS512W MODBYTES_B512_29  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace NUMS512W {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_SECP160R1.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_SECP160R1.h
new file mode 100644
index 0000000..4247ada
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_SECP160R1.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_SECP160R1_H
+#define EDDSA_SECP160R1_H
+
+#include "ecp_SECP160R1.h"
+
+using namespace core;
+
+#define EGS_SECP160R1 MODBYTES_B160_29  /**< ECC Group Size in bytes */
+#define EFS_SECP160R1 MODBYTES_B160_29  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace SECP160R1 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_SECP256K1.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_SECP256K1.h
new file mode 100644
index 0000000..d91e765
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_SECP256K1.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_SECP256K1_H
+#define EDDSA_SECP256K1_H
+
+#include "ecp_SECP256K1.h"
+
+using namespace core;
+
+#define EGS_SECP256K1 MODBYTES_B256_28  /**< ECC Group Size in bytes */
+#define EFS_SECP256K1 MODBYTES_B256_28  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace SECP256K1 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_SM2.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_SM2.h
new file mode 100644
index 0000000..6ababbe
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_SM2.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_SM2_H
+#define EDDSA_SM2_H
+
+#include "ecp_SM2.h"
+
+using namespace core;
+
+#define EGS_SM2 MODBYTES_B256_28  /**< ECC Group Size in bytes */
+#define EFS_SM2 MODBYTES_B256_28  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace SM2 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_TWEEDLEDEE.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_TWEEDLEDEE.h
new file mode 100644
index 0000000..89355a5
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_TWEEDLEDEE.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_TWEEDLEDEE_H
+#define EDDSA_TWEEDLEDEE_H
+
+#include "ecp_TWEEDLEDEE.h"
+
+using namespace core;
+
+#define EGS_TWEEDLEDEE MODBYTES_B256_29  /**< ECC Group Size in bytes */
+#define EFS_TWEEDLEDEE MODBYTES_B256_29  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace TWEEDLEDEE {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_TWEEDLEDUM.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_TWEEDLEDUM.h
new file mode 100644
index 0000000..3541d48
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_TWEEDLEDUM.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_TWEEDLEDUM_H
+#define EDDSA_TWEEDLEDUM_H
+
+#include "ecp_TWEEDLEDUM.h"
+
+using namespace core;
+
+#define EGS_TWEEDLEDUM MODBYTES_B256_29  /**< ECC Group Size in bytes */
+#define EFS_TWEEDLEDUM MODBYTES_B256_29  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace TWEEDLEDUM {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_X448.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_X448.h
new file mode 100644
index 0000000..b99410e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/eddsa_X448.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_X448_H
+#define EDDSA_X448_H
+
+#include "ecp_X448.h"
+
+using namespace core;
+
+#define EGS_X448 MODBYTES_B448_29  /**< ECC Group Size in bytes */
+#define EFS_X448 MODBYTES_B448_29  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace X448 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ff_RSA2048.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ff_RSA2048.h
new file mode 100644
index 0000000..20a824d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ff_RSA2048.h
@@ -0,0 +1,295 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FF_RSA2048_H
+#define FF_RSA2048_H
+
+#include "big_B512_29.h"
+#include "config_ff_RSA2048.h"
+
+using namespace core;
+
+#define HFLEN_RSA2048 (FFLEN_RSA2048/2) /**< Useful for half-size RSA private key operations */
+#define P_MBITS_RSA2048 (MODBYTES_B512_29*8)
+#define P_TBITS_RSA2048 (P_MBITS_RSA2048%BASEBITS_B512_29)
+#define P_EXCESS_RSA2048(a) (((a[NLEN_B512_29-1])>>(P_TBITS_RSA2048))+1)
+#define P_FEXCESS_RSA2048 ((chunk)1<<(BASEBITS_B512_29*NLEN_B512_29-P_MBITS_RSA2048-1))
+
+
+namespace RSA2048 {
+
+/* Finite Field Prototypes */
+/**	@brief Copy one FF element of given length to another
+ *
+	@param x FF instance to be copied to, on exit = y
+	@param y FF instance to be copied from
+	@param n size of FF in BIGs
+
+ */
+extern void FF_copy(B512_29::BIG *x, B512_29::BIG *y, int n);
+/**	@brief Initialize an FF element of given length from a 32-bit integer m
+ *
+	@param x FF instance to be copied to, on exit = m
+	@param m integer
+	@param n size of FF in BIGs
+ */
+extern void FF_init(B512_29::BIG *x, sign32 m, int n);
+/**	@brief Set FF element of given size to zero
+ *
+	@param x FF instance to be set to zero
+	@param n size of FF in BIGs
+ */
+extern void FF_zero(B512_29::BIG *x, int n);
+/**	@brief Tests for FF element equal to zero
+ *
+	@param x FF number to be tested
+	@param n size of FF in BIGs
+	@return 1 if zero, else returns 0
+ */
+extern int FF_iszilch(B512_29::BIG *x, int n);
+/**	@brief  return parity of an FF, that is the least significant bit
+ *
+	@param x FF number
+	@return 0 or 1
+ */
+extern int FF_parity(B512_29::BIG *x);
+/**	@brief  return least significant m bits of an FF
+ *
+	@param x FF number
+	@param m number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int FF_lastbits(B512_29::BIG *x, int m);
+/**	@brief Set FF element of given size to unity
+ *
+	@param x FF instance to be set to unity
+	@param n size of FF in BIGs
+ */
+extern void FF_one(B512_29::BIG *x, int n);
+/**	@brief Compares two FF numbers. Inputs must be normalised externally
+ *
+	@param x first FF number to be compared
+	@param y second FF number to be compared
+	@param n size of FF in BIGs
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int FF_comp(B512_29::BIG *x, B512_29::BIG *y, int n);
+/**	@brief addition of two FFs
+ *
+	@param x FF instance, on exit = y+z
+	@param y FF instance
+	@param z FF instance
+	@param n size of FF in BIGs
+ */
+extern void FF_add(B512_29::BIG *x, B512_29::BIG *y, B512_29::BIG *z, int n);
+/**	@brief subtraction of two FFs
+ *
+	@param x FF instance, on exit = y-z
+	@param y FF instance
+	@param z FF instance
+	@param n size of FF in BIGs
+ */
+extern void FF_sub(B512_29::BIG *x, B512_29::BIG *y, B512_29::BIG *z, int n);
+/**	@brief increment an FF by an integer,and normalise
+ *
+	@param x FF instance, on exit = x+m
+	@param m an integer to be added to x
+	@param n size of FF in BIGs
+ */
+extern void FF_inc(B512_29::BIG *x, int m, int n);
+/**	@brief Decrement an FF by an integer,and normalise
+ *
+	@param x FF instance, on exit = x-m
+	@param m an integer to be subtracted from x
+	@param n size of FF in BIGs
+ */
+extern void FF_dec(B512_29::BIG *x, int m, int n);
+/**	@brief Normalises the components of an FF
+ *
+	@param x FF instance to be normalised
+	@param n size of FF in BIGs
+ */
+extern void FF_norm(B512_29::BIG *x, int n);
+/**	@brief Shift left an FF by 1 bit
+ *
+	@param x FF instance to be shifted left
+	@param n size of FF in BIGs
+ */
+extern void FF_shl(B512_29::BIG *x, int n);
+/**	@brief Shift right an FF by 1 bit
+ *
+	@param x FF instance to be shifted right
+	@param n size of FF in BIGs
+ */
+extern void FF_shr(B512_29::BIG *x, int n);
+/**	@brief Formats and outputs an FF to the console
+ *
+	@param x FF instance to be printed
+	@param n size of FF in BIGs
+ */
+extern void FF_output(B512_29::BIG *x, int n);
+/**	@brief Formats and outputs an FF to the console, in raw form
+ *
+ 	@param x FF instance to be printed
+ 	@param n size of FF in BIGs
+ */
+extern void FF_rawoutput(B512_29::BIG *x, int n);
+/**	@brief Formats and outputs an FF instance to an octet string
+ *
+	Converts an FF to big-endian base 256 form.
+	@param S output octet string
+	@param x FF instance to be converted to an octet string
+	@param n size of FF in BIGs
+ */
+extern void FF_toOctet(octet *S, B512_29::BIG *x, int n);
+/**	@brief Populates an FF instance from an octet string
+ *
+	Creates FF from big-endian base 256 form.
+	@param x FF instance to be created from an octet string
+	@param S input octet string
+	@param n size of FF in BIGs
+ */
+extern void FF_fromOctet(B512_29::BIG *x, octet *S, int n);
+/**	@brief Multiplication of two FFs
+ *
+	Uses Karatsuba method internally
+	@param x FF instance, on exit = y*z
+	@param y FF instance
+	@param z FF instance
+	@param n size of FF in BIGs
+ */
+extern void FF_mul(B512_29::BIG *x, B512_29::BIG *y, B512_29::BIG *z, int n);
+/**	@brief Reduce FF mod a modulus
+ *
+	This is slow
+	@param x FF instance to be reduced mod m - on exit = x mod m
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_mod(B512_29::BIG *x, B512_29::BIG *m, int n);
+/**	@brief Square an FF
+ *
+	Uses Karatsuba method internally
+	@param x FF instance, on exit = y^2
+	@param y FF instance to be squared
+	@param n size of FF in BIGs
+ */
+extern void FF_sqr(B512_29::BIG *x, B512_29::BIG *y, int n);
+/**	@brief Reduces a double-length FF with respect to a given modulus
+ *
+	This is slow
+	@param x FF instance, on exit = y mod z
+	@param y FF instance, of double length 2*n
+	@param z FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_dmod(B512_29::BIG *x, B512_29::BIG *y, B512_29::BIG *z, int n);
+/**	@brief Invert an FF mod a prime modulus
+ *
+	@param x FF instance, on exit = 1/y mod z
+	@param y FF instance
+	@param z FF prime modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_invmodp(B512_29::BIG *x, B512_29::BIG *y, B512_29::BIG *z, int n);
+/**	@brief Create an FF from a random number generator
+ *
+	@param x FF instance, on exit x is a random number of length n BIGs with most significant bit a 1
+	@param R an instance of a Cryptographically Secure Random Number Generator
+	@param n size of FF in BIGs
+ */
+extern void FF_random(B512_29::BIG *x, csprng *R, int n);
+/**	@brief Create a random FF less than a given modulus from a random number generator
+ *
+	@param x FF instance, on exit x is a random number < y
+	@param y FF instance, the modulus
+	@param R an instance of a Cryptographically Secure Random Number Generator
+	@param n size of FF in BIGs
+ */
+extern void FF_randomnum(B512_29::BIG *x, B512_29::BIG *y, csprng *R, int n);
+/**	@brief Calculate r=x^e mod m, side channel resistant
+ *
+	@param r FF instance, on exit = x^e mod p
+	@param x FF instance
+	@param e FF exponent
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_skpow(B512_29::BIG *r, B512_29::BIG *x, B512_29::BIG * e, B512_29::BIG *m, int n);
+/**	@brief Calculate r=x^e mod m, side channel resistant
+ *
+	For short BIG exponent
+	@param r FF instance, on exit = x^e mod p
+	@param x FF instance
+	@param e BIG exponent
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_skspow(B512_29::BIG *r, B512_29::BIG *x, B512_29::BIG e, B512_29::BIG *m, int n);
+/**	@brief Calculate r=x^e mod m
+ *
+	For very short integer exponent
+	@param r FF instance, on exit = x^e mod p
+	@param x FF instance
+	@param e integer exponent
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_power(B512_29::BIG *r, B512_29::BIG *x, int e, B512_29::BIG *m, int n);
+/**	@brief Calculate r=x^e mod m
+ *
+	@param r FF instance, on exit = x^e mod p
+	@param x FF instance
+	@param e FF exponent
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_pow(B512_29::BIG *r, B512_29::BIG *x, B512_29::BIG *e, B512_29::BIG *m, int n);
+/**	@brief Test if an FF has factor in common with integer s
+ *
+	@param x FF instance to be tested
+	@param s the supplied integer
+	@param n size of FF in BIGs
+	@return 1 if gcd(x,s)!=1, else return 0
+ */
+extern int FF_cfactor(B512_29::BIG *x, sign32 s, int n);
+/**	@brief Test if an FF is prime
+ *
+	Uses Miller-Rabin Method
+	@param x FF instance to be tested
+	@param R an instance of a Cryptographically Secure Random Number Generator
+	@param n size of FF in BIGs
+	@return 1 if x is (almost certainly) prime, else return 0
+ */
+extern int FF_prime(B512_29::BIG *x, csprng *R, int n);
+/**	@brief Calculate r=x^e.y^f mod m
+ *
+	@param r FF instance, on exit = x^e.y^f mod p
+	@param x FF instance
+	@param e BIG exponent
+	@param y FF instance
+	@param f BIG exponent
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_pow2(B512_29::BIG *r, B512_29::BIG *x, B512_29::BIG e, B512_29::BIG *y, B512_29::BIG f, B512_29::BIG *m, int n);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ff_RSA3072.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ff_RSA3072.h
new file mode 100644
index 0000000..1a8f592
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ff_RSA3072.h
@@ -0,0 +1,295 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FF_RSA3072_H
+#define FF_RSA3072_H
+
+#include "big_B384_28.h"
+#include "config_ff_RSA3072.h"
+
+using namespace core;
+
+#define HFLEN_RSA3072 (FFLEN_RSA3072/2) /**< Useful for half-size RSA private key operations */
+#define P_MBITS_RSA3072 (MODBYTES_B384_28*8)
+#define P_TBITS_RSA3072 (P_MBITS_RSA3072%BASEBITS_B384_28)
+#define P_EXCESS_RSA3072(a) (((a[NLEN_B384_28-1])>>(P_TBITS_RSA3072))+1)
+#define P_FEXCESS_RSA3072 ((chunk)1<<(BASEBITS_B384_28*NLEN_B384_28-P_MBITS_RSA3072-1))
+
+
+namespace RSA3072 {
+
+/* Finite Field Prototypes */
+/**	@brief Copy one FF element of given length to another
+ *
+	@param x FF instance to be copied to, on exit = y
+	@param y FF instance to be copied from
+	@param n size of FF in BIGs
+
+ */
+extern void FF_copy(B384_28::BIG *x, B384_28::BIG *y, int n);
+/**	@brief Initialize an FF element of given length from a 32-bit integer m
+ *
+	@param x FF instance to be copied to, on exit = m
+	@param m integer
+	@param n size of FF in BIGs
+ */
+extern void FF_init(B384_28::BIG *x, sign32 m, int n);
+/**	@brief Set FF element of given size to zero
+ *
+	@param x FF instance to be set to zero
+	@param n size of FF in BIGs
+ */
+extern void FF_zero(B384_28::BIG *x, int n);
+/**	@brief Tests for FF element equal to zero
+ *
+	@param x FF number to be tested
+	@param n size of FF in BIGs
+	@return 1 if zero, else returns 0
+ */
+extern int FF_iszilch(B384_28::BIG *x, int n);
+/**	@brief  return parity of an FF, that is the least significant bit
+ *
+	@param x FF number
+	@return 0 or 1
+ */
+extern int FF_parity(B384_28::BIG *x);
+/**	@brief  return least significant m bits of an FF
+ *
+	@param x FF number
+	@param m number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int FF_lastbits(B384_28::BIG *x, int m);
+/**	@brief Set FF element of given size to unity
+ *
+	@param x FF instance to be set to unity
+	@param n size of FF in BIGs
+ */
+extern void FF_one(B384_28::BIG *x, int n);
+/**	@brief Compares two FF numbers. Inputs must be normalised externally
+ *
+	@param x first FF number to be compared
+	@param y second FF number to be compared
+	@param n size of FF in BIGs
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int FF_comp(B384_28::BIG *x, B384_28::BIG *y, int n);
+/**	@brief addition of two FFs
+ *
+	@param x FF instance, on exit = y+z
+	@param y FF instance
+	@param z FF instance
+	@param n size of FF in BIGs
+ */
+extern void FF_add(B384_28::BIG *x, B384_28::BIG *y, B384_28::BIG *z, int n);
+/**	@brief subtraction of two FFs
+ *
+	@param x FF instance, on exit = y-z
+	@param y FF instance
+	@param z FF instance
+	@param n size of FF in BIGs
+ */
+extern void FF_sub(B384_28::BIG *x, B384_28::BIG *y, B384_28::BIG *z, int n);
+/**	@brief increment an FF by an integer,and normalise
+ *
+	@param x FF instance, on exit = x+m
+	@param m an integer to be added to x
+	@param n size of FF in BIGs
+ */
+extern void FF_inc(B384_28::BIG *x, int m, int n);
+/**	@brief Decrement an FF by an integer,and normalise
+ *
+	@param x FF instance, on exit = x-m
+	@param m an integer to be subtracted from x
+	@param n size of FF in BIGs
+ */
+extern void FF_dec(B384_28::BIG *x, int m, int n);
+/**	@brief Normalises the components of an FF
+ *
+	@param x FF instance to be normalised
+	@param n size of FF in BIGs
+ */
+extern void FF_norm(B384_28::BIG *x, int n);
+/**	@brief Shift left an FF by 1 bit
+ *
+	@param x FF instance to be shifted left
+	@param n size of FF in BIGs
+ */
+extern void FF_shl(B384_28::BIG *x, int n);
+/**	@brief Shift right an FF by 1 bit
+ *
+	@param x FF instance to be shifted right
+	@param n size of FF in BIGs
+ */
+extern void FF_shr(B384_28::BIG *x, int n);
+/**	@brief Formats and outputs an FF to the console
+ *
+	@param x FF instance to be printed
+	@param n size of FF in BIGs
+ */
+extern void FF_output(B384_28::BIG *x, int n);
+/**	@brief Formats and outputs an FF to the console, in raw form
+ *
+ 	@param x FF instance to be printed
+ 	@param n size of FF in BIGs
+ */
+extern void FF_rawoutput(B384_28::BIG *x, int n);
+/**	@brief Formats and outputs an FF instance to an octet string
+ *
+	Converts an FF to big-endian base 256 form.
+	@param S output octet string
+	@param x FF instance to be converted to an octet string
+	@param n size of FF in BIGs
+ */
+extern void FF_toOctet(octet *S, B384_28::BIG *x, int n);
+/**	@brief Populates an FF instance from an octet string
+ *
+	Creates FF from big-endian base 256 form.
+	@param x FF instance to be created from an octet string
+	@param S input octet string
+	@param n size of FF in BIGs
+ */
+extern void FF_fromOctet(B384_28::BIG *x, octet *S, int n);
+/**	@brief Multiplication of two FFs
+ *
+	Uses Karatsuba method internally
+	@param x FF instance, on exit = y*z
+	@param y FF instance
+	@param z FF instance
+	@param n size of FF in BIGs
+ */
+extern void FF_mul(B384_28::BIG *x, B384_28::BIG *y, B384_28::BIG *z, int n);
+/**	@brief Reduce FF mod a modulus
+ *
+	This is slow
+	@param x FF instance to be reduced mod m - on exit = x mod m
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_mod(B384_28::BIG *x, B384_28::BIG *m, int n);
+/**	@brief Square an FF
+ *
+	Uses Karatsuba method internally
+	@param x FF instance, on exit = y^2
+	@param y FF instance to be squared
+	@param n size of FF in BIGs
+ */
+extern void FF_sqr(B384_28::BIG *x, B384_28::BIG *y, int n);
+/**	@brief Reduces a double-length FF with respect to a given modulus
+ *
+	This is slow
+	@param x FF instance, on exit = y mod z
+	@param y FF instance, of double length 2*n
+	@param z FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_dmod(B384_28::BIG *x, B384_28::BIG *y, B384_28::BIG *z, int n);
+/**	@brief Invert an FF mod a prime modulus
+ *
+	@param x FF instance, on exit = 1/y mod z
+	@param y FF instance
+	@param z FF prime modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_invmodp(B384_28::BIG *x, B384_28::BIG *y, B384_28::BIG *z, int n);
+/**	@brief Create an FF from a random number generator
+ *
+	@param x FF instance, on exit x is a random number of length n BIGs with most significant bit a 1
+	@param R an instance of a Cryptographically Secure Random Number Generator
+	@param n size of FF in BIGs
+ */
+extern void FF_random(B384_28::BIG *x, csprng *R, int n);
+/**	@brief Create a random FF less than a given modulus from a random number generator
+ *
+	@param x FF instance, on exit x is a random number < y
+	@param y FF instance, the modulus
+	@param R an instance of a Cryptographically Secure Random Number Generator
+	@param n size of FF in BIGs
+ */
+extern void FF_randomnum(B384_28::BIG *x, B384_28::BIG *y, csprng *R, int n);
+/**	@brief Calculate r=x^e mod m, side channel resistant
+ *
+	@param r FF instance, on exit = x^e mod p
+	@param x FF instance
+	@param e FF exponent
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_skpow(B384_28::BIG *r, B384_28::BIG *x, B384_28::BIG * e, B384_28::BIG *m, int n);
+/**	@brief Calculate r=x^e mod m, side channel resistant
+ *
+	For short BIG exponent
+	@param r FF instance, on exit = x^e mod p
+	@param x FF instance
+	@param e BIG exponent
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_skspow(B384_28::BIG *r, B384_28::BIG *x, B384_28::BIG e, B384_28::BIG *m, int n);
+/**	@brief Calculate r=x^e mod m
+ *
+	For very short integer exponent
+	@param r FF instance, on exit = x^e mod p
+	@param x FF instance
+	@param e integer exponent
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_power(B384_28::BIG *r, B384_28::BIG *x, int e, B384_28::BIG *m, int n);
+/**	@brief Calculate r=x^e mod m
+ *
+	@param r FF instance, on exit = x^e mod p
+	@param x FF instance
+	@param e FF exponent
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_pow(B384_28::BIG *r, B384_28::BIG *x, B384_28::BIG *e, B384_28::BIG *m, int n);
+/**	@brief Test if an FF has factor in common with integer s
+ *
+	@param x FF instance to be tested
+	@param s the supplied integer
+	@param n size of FF in BIGs
+	@return 1 if gcd(x,s)!=1, else return 0
+ */
+extern int FF_cfactor(B384_28::BIG *x, sign32 s, int n);
+/**	@brief Test if an FF is prime
+ *
+	Uses Miller-Rabin Method
+	@param x FF instance to be tested
+	@param R an instance of a Cryptographically Secure Random Number Generator
+	@param n size of FF in BIGs
+	@return 1 if x is (almost certainly) prime, else return 0
+ */
+extern int FF_prime(B384_28::BIG *x, csprng *R, int n);
+/**	@brief Calculate r=x^e.y^f mod m
+ *
+	@param r FF instance, on exit = x^e.y^f mod p
+	@param x FF instance
+	@param e BIG exponent
+	@param y FF instance
+	@param f BIG exponent
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_pow2(B384_28::BIG *r, B384_28::BIG *x, B384_28::BIG e, B384_28::BIG *y, B384_28::BIG f, B384_28::BIG *m, int n);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ff_RSA4096.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ff_RSA4096.h
new file mode 100644
index 0000000..e648ec5
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/ff_RSA4096.h
@@ -0,0 +1,295 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FF_RSA4096_H
+#define FF_RSA4096_H
+
+#include "big_B512_29.h"
+#include "config_ff_RSA4096.h"
+
+using namespace core;
+
+#define HFLEN_RSA4096 (FFLEN_RSA4096/2) /**< Useful for half-size RSA private key operations */
+#define P_MBITS_RSA4096 (MODBYTES_B512_29*8)
+#define P_TBITS_RSA4096 (P_MBITS_RSA4096%BASEBITS_B512_29)
+#define P_EXCESS_RSA4096(a) (((a[NLEN_B512_29-1])>>(P_TBITS_RSA4096))+1)
+#define P_FEXCESS_RSA4096 ((chunk)1<<(BASEBITS_B512_29*NLEN_B512_29-P_MBITS_RSA4096-1))
+
+
+namespace RSA4096 {
+
+/* Finite Field Prototypes */
+/**	@brief Copy one FF element of given length to another
+ *
+	@param x FF instance to be copied to, on exit = y
+	@param y FF instance to be copied from
+	@param n size of FF in BIGs
+
+ */
+extern void FF_copy(B512_29::BIG *x, B512_29::BIG *y, int n);
+/**	@brief Initialize an FF element of given length from a 32-bit integer m
+ *
+	@param x FF instance to be copied to, on exit = m
+	@param m integer
+	@param n size of FF in BIGs
+ */
+extern void FF_init(B512_29::BIG *x, sign32 m, int n);
+/**	@brief Set FF element of given size to zero
+ *
+	@param x FF instance to be set to zero
+	@param n size of FF in BIGs
+ */
+extern void FF_zero(B512_29::BIG *x, int n);
+/**	@brief Tests for FF element equal to zero
+ *
+	@param x FF number to be tested
+	@param n size of FF in BIGs
+	@return 1 if zero, else returns 0
+ */
+extern int FF_iszilch(B512_29::BIG *x, int n);
+/**	@brief  return parity of an FF, that is the least significant bit
+ *
+	@param x FF number
+	@return 0 or 1
+ */
+extern int FF_parity(B512_29::BIG *x);
+/**	@brief  return least significant m bits of an FF
+ *
+	@param x FF number
+	@param m number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int FF_lastbits(B512_29::BIG *x, int m);
+/**	@brief Set FF element of given size to unity
+ *
+	@param x FF instance to be set to unity
+	@param n size of FF in BIGs
+ */
+extern void FF_one(B512_29::BIG *x, int n);
+/**	@brief Compares two FF numbers. Inputs must be normalised externally
+ *
+	@param x first FF number to be compared
+	@param y second FF number to be compared
+	@param n size of FF in BIGs
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int FF_comp(B512_29::BIG *x, B512_29::BIG *y, int n);
+/**	@brief addition of two FFs
+ *
+	@param x FF instance, on exit = y+z
+	@param y FF instance
+	@param z FF instance
+	@param n size of FF in BIGs
+ */
+extern void FF_add(B512_29::BIG *x, B512_29::BIG *y, B512_29::BIG *z, int n);
+/**	@brief subtraction of two FFs
+ *
+	@param x FF instance, on exit = y-z
+	@param y FF instance
+	@param z FF instance
+	@param n size of FF in BIGs
+ */
+extern void FF_sub(B512_29::BIG *x, B512_29::BIG *y, B512_29::BIG *z, int n);
+/**	@brief increment an FF by an integer,and normalise
+ *
+	@param x FF instance, on exit = x+m
+	@param m an integer to be added to x
+	@param n size of FF in BIGs
+ */
+extern void FF_inc(B512_29::BIG *x, int m, int n);
+/**	@brief Decrement an FF by an integer,and normalise
+ *
+	@param x FF instance, on exit = x-m
+	@param m an integer to be subtracted from x
+	@param n size of FF in BIGs
+ */
+extern void FF_dec(B512_29::BIG *x, int m, int n);
+/**	@brief Normalises the components of an FF
+ *
+	@param x FF instance to be normalised
+	@param n size of FF in BIGs
+ */
+extern void FF_norm(B512_29::BIG *x, int n);
+/**	@brief Shift left an FF by 1 bit
+ *
+	@param x FF instance to be shifted left
+	@param n size of FF in BIGs
+ */
+extern void FF_shl(B512_29::BIG *x, int n);
+/**	@brief Shift right an FF by 1 bit
+ *
+	@param x FF instance to be shifted right
+	@param n size of FF in BIGs
+ */
+extern void FF_shr(B512_29::BIG *x, int n);
+/**	@brief Formats and outputs an FF to the console
+ *
+	@param x FF instance to be printed
+	@param n size of FF in BIGs
+ */
+extern void FF_output(B512_29::BIG *x, int n);
+/**	@brief Formats and outputs an FF to the console, in raw form
+ *
+ 	@param x FF instance to be printed
+ 	@param n size of FF in BIGs
+ */
+extern void FF_rawoutput(B512_29::BIG *x, int n);
+/**	@brief Formats and outputs an FF instance to an octet string
+ *
+	Converts an FF to big-endian base 256 form.
+	@param S output octet string
+	@param x FF instance to be converted to an octet string
+	@param n size of FF in BIGs
+ */
+extern void FF_toOctet(octet *S, B512_29::BIG *x, int n);
+/**	@brief Populates an FF instance from an octet string
+ *
+	Creates FF from big-endian base 256 form.
+	@param x FF instance to be created from an octet string
+	@param S input octet string
+	@param n size of FF in BIGs
+ */
+extern void FF_fromOctet(B512_29::BIG *x, octet *S, int n);
+/**	@brief Multiplication of two FFs
+ *
+	Uses Karatsuba method internally
+	@param x FF instance, on exit = y*z
+	@param y FF instance
+	@param z FF instance
+	@param n size of FF in BIGs
+ */
+extern void FF_mul(B512_29::BIG *x, B512_29::BIG *y, B512_29::BIG *z, int n);
+/**	@brief Reduce FF mod a modulus
+ *
+	This is slow
+	@param x FF instance to be reduced mod m - on exit = x mod m
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_mod(B512_29::BIG *x, B512_29::BIG *m, int n);
+/**	@brief Square an FF
+ *
+	Uses Karatsuba method internally
+	@param x FF instance, on exit = y^2
+	@param y FF instance to be squared
+	@param n size of FF in BIGs
+ */
+extern void FF_sqr(B512_29::BIG *x, B512_29::BIG *y, int n);
+/**	@brief Reduces a double-length FF with respect to a given modulus
+ *
+	This is slow
+	@param x FF instance, on exit = y mod z
+	@param y FF instance, of double length 2*n
+	@param z FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_dmod(B512_29::BIG *x, B512_29::BIG *y, B512_29::BIG *z, int n);
+/**	@brief Invert an FF mod a prime modulus
+ *
+	@param x FF instance, on exit = 1/y mod z
+	@param y FF instance
+	@param z FF prime modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_invmodp(B512_29::BIG *x, B512_29::BIG *y, B512_29::BIG *z, int n);
+/**	@brief Create an FF from a random number generator
+ *
+	@param x FF instance, on exit x is a random number of length n BIGs with most significant bit a 1
+	@param R an instance of a Cryptographically Secure Random Number Generator
+	@param n size of FF in BIGs
+ */
+extern void FF_random(B512_29::BIG *x, csprng *R, int n);
+/**	@brief Create a random FF less than a given modulus from a random number generator
+ *
+	@param x FF instance, on exit x is a random number < y
+	@param y FF instance, the modulus
+	@param R an instance of a Cryptographically Secure Random Number Generator
+	@param n size of FF in BIGs
+ */
+extern void FF_randomnum(B512_29::BIG *x, B512_29::BIG *y, csprng *R, int n);
+/**	@brief Calculate r=x^e mod m, side channel resistant
+ *
+	@param r FF instance, on exit = x^e mod p
+	@param x FF instance
+	@param e FF exponent
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_skpow(B512_29::BIG *r, B512_29::BIG *x, B512_29::BIG * e, B512_29::BIG *m, int n);
+/**	@brief Calculate r=x^e mod m, side channel resistant
+ *
+	For short BIG exponent
+	@param r FF instance, on exit = x^e mod p
+	@param x FF instance
+	@param e BIG exponent
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_skspow(B512_29::BIG *r, B512_29::BIG *x, B512_29::BIG e, B512_29::BIG *m, int n);
+/**	@brief Calculate r=x^e mod m
+ *
+	For very short integer exponent
+	@param r FF instance, on exit = x^e mod p
+	@param x FF instance
+	@param e integer exponent
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_power(B512_29::BIG *r, B512_29::BIG *x, int e, B512_29::BIG *m, int n);
+/**	@brief Calculate r=x^e mod m
+ *
+	@param r FF instance, on exit = x^e mod p
+	@param x FF instance
+	@param e FF exponent
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_pow(B512_29::BIG *r, B512_29::BIG *x, B512_29::BIG *e, B512_29::BIG *m, int n);
+/**	@brief Test if an FF has factor in common with integer s
+ *
+	@param x FF instance to be tested
+	@param s the supplied integer
+	@param n size of FF in BIGs
+	@return 1 if gcd(x,s)!=1, else return 0
+ */
+extern int FF_cfactor(B512_29::BIG *x, sign32 s, int n);
+/**	@brief Test if an FF is prime
+ *
+	Uses Miller-Rabin Method
+	@param x FF instance to be tested
+	@param R an instance of a Cryptographically Secure Random Number Generator
+	@param n size of FF in BIGs
+	@return 1 if x is (almost certainly) prime, else return 0
+ */
+extern int FF_prime(B512_29::BIG *x, csprng *R, int n);
+/**	@brief Calculate r=x^e.y^f mod m
+ *
+	@param r FF instance, on exit = x^e.y^f mod p
+	@param x FF instance
+	@param e BIG exponent
+	@param y FF instance
+	@param f BIG exponent
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_pow2(B512_29::BIG *r, B512_29::BIG *x, B512_29::BIG e, B512_29::BIG *y, B512_29::BIG f, B512_29::BIG *m, int n);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp12_BLS12381.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp12_BLS12381.h
new file mode 100644
index 0000000..213f14b
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp12_BLS12381.h
@@ -0,0 +1,230 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP12_BLS12381_H
+#define FP12_BLS12381_H
+
+#include "fp4_BLS12381.h"
+
+using namespace core;
+
+namespace BLS12381 {
+/**
+	@brief FP12 Structure - towered over three FP4
+*/
+
+typedef struct
+{
+    FP4 a; /**< first part of FP12 */
+    FP4 b; /**< second part of FP12 */
+    FP4 c; /**< third part of FP12 */
+    int type;
+} FP12;
+
+extern const B384_29::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B384_29::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+/* FP12 prototypes */
+/**	@brief Tests for FP12 equal to zero
+ *
+	@param x FP12 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP12_iszilch(FP12 *x);
+/**	@brief Tests for FP12 equal to unity
+ *
+	@param x FP12 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP12_isunity(FP12 *x);
+/**	@brief Copy FP12 to another FP12
+ *
+	@param x FP12 instance, on exit = y
+	@param y FP12 instance to be copied
+ */
+extern void FP12_copy(FP12 *x, FP12 *y);
+/**	@brief Set FP12 to unity
+ *
+	@param x FP12 instance to be set to one
+ */
+extern void FP12_one(FP12 *x);
+
+/**	@brief Set FP12 to zero
+ *
+	@param x FP12 instance to be set to zero
+ */
+extern void FP12_zero(FP12 *x);
+
+/**	@brief Tests for equality of two FP12s
+ *
+	@param x FP12 instance to be compared
+	@param y FP12 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP12_equals(FP12 *x, FP12 *y);
+/**	@brief Conjugation of FP12
+ *
+	If y=(a,b,c) (where a,b,c are its three FP4 components) on exit x=(conj(a),-conj(b),conj(c))
+	@param x FP12 instance, on exit = conj(y)
+	@param y FP12 instance
+ */
+extern void FP12_conj(FP12 *x, FP12 *y);
+/**	@brief Initialise FP12 from single FP4
+ *
+	Sets first FP4 component of an FP12, other components set to zero
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP4
+ */
+extern void FP12_from_FP4(FP12 *x, FP4 *a);
+/**	@brief Initialise FP12 from three FP4s
+ *
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP12
+	@param b FP4 to form second part of FP12
+	@param c FP4 to form third part of FP12
+ */
+extern void FP12_from_FP4s(FP12 *x, FP4 *a, FP4* b, FP4 *c);
+/**	@brief Fast Squaring of an FP12 in "unitary" form
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP4 instance, must be unitary
+ */
+extern void FP12_usqr(FP12 *x, FP12 *y);
+/**	@brief Squaring an FP12
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP12 instance
+ */
+extern void FP12_sqr(FP12 *x, FP12 *y);
+/**	@brief Fast multiplication of two sparse FP12s that arises from ATE pairing line functions
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_smul(FP12 *x, FP12 *y);
+
+/**	@brief Fast multiplication of what may be sparse multiplicands
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_ssmul(FP12 *x, FP12 *y);
+
+
+/**	@brief Full unconditional Multiplication of two FP12s
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, the multiplier
+ */
+extern void FP12_mul(FP12 *x, FP12 *y);
+
+/**	@brief Inverting an FP12
+ *
+	@param x FP12 instance, on exit = 1/y
+	@param y FP12 instance
+	@param t D_TYPE or M_TYPE twist
+ */
+extern void FP12_inv(FP12 *x, FP12 *y);
+/**	@brief Raises an FP12 to the power of a BIG
+ *
+	@param r FP12 instance, on exit = y^b
+	@param x FP12 instance
+	@param b BIG number
+ */
+extern void FP12_pow(FP12 *r, FP12 *x, B384_29::BIG b);
+/**	@brief Raises an FP12 instance x to a small integer power, side-channel resistant
+ *
+	@param x FP12 instance, on exit = x^i
+	@param i small integer exponent
+	@param b maximum number of bits in exponent
+ */
+extern void FP12_pinpow(FP12 *x, int i, int b);
+
+/**	@brief Raises an FP12 instance x to a BIG power, compressed to FP4
+ *
+	@param c FP4 instance, on exit = x^(e mod r) as FP4
+	@param x FP12 input
+	@param e BIG exponent
+	@param r BIG group order
+ */
+extern void FP12_compow(FP4 *c, FP12 *x, B384_29::BIG e, B384_29::BIG r);
+
+/**	@brief Calculate x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3], side-channel resistant
+ *
+	@param r FP12 instance, on exit = x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3]
+	@param x FP12 array with 4 FP12s
+	@param b BIG array of 4 exponents
+ */
+extern void FP12_pow4(FP12 *r, FP12 *x, B384_29::BIG *b);
+/**	@brief Raises an FP12 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP12 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP12_frob(FP12 *x, FP2 *f);
+/**	@brief Reduces all components of possibly unreduced FP12 mod Modulus
+ *
+	@param x FP12 instance, on exit reduced mod Modulus
+ */
+extern void FP12_reduce(FP12 *x);
+/**	@brief Normalises the components of an FP12
+ *
+	@param x FP12 instance to be normalised
+ */
+extern void FP12_norm(FP12 *x);
+/**	@brief Formats and outputs an FP12 to the console
+ *
+	@param x FP12 instance to be printed
+ */
+extern void FP12_output(FP12 *x);
+/**	@brief Formats and outputs an FP12 instance to an octet string
+ *
+	Serializes the components of an FP12 to big-endian base 256 form.
+	@param S output octet string
+	@param x FP12 instance to be converted to an octet string
+ */
+extern void FP12_toOctet(octet *S, FP12 *x);
+/**	@brief Creates an FP12 instance from an octet string
+ *
+	De-serializes the components of an FP12 to create an FP12 from big-endian base 256 components.
+	@param x FP12 instance to be created from an octet string
+	@param S input octet string
+
+ */
+extern void FP12_fromOctet(FP12 *x, octet *S);
+/**	@brief Calculate the trace of an FP12
+ *
+	@param t FP4 trace of x, on exit = tr(x)
+	@param x FP12 instance
+
+ */
+extern void FP12_trace(FP4 *t, FP12 *x);
+
+/**	@brief Conditional copy of FP12 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP12 instance, set to y if s!=0
+	@param y another FP12 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP12_cmove(FP12 *x, FP12 *y, int s);
+
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp12_BLS12383.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp12_BLS12383.h
new file mode 100644
index 0000000..38d8131
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp12_BLS12383.h
@@ -0,0 +1,230 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP12_BLS12383_H
+#define FP12_BLS12383_H
+
+#include "fp4_BLS12383.h"
+
+using namespace core;
+
+namespace BLS12383 {
+/**
+	@brief FP12 Structure - towered over three FP4
+*/
+
+typedef struct
+{
+    FP4 a; /**< first part of FP12 */
+    FP4 b; /**< second part of FP12 */
+    FP4 c; /**< third part of FP12 */
+    int type;
+} FP12;
+
+extern const B384_29::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B384_29::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+/* FP12 prototypes */
+/**	@brief Tests for FP12 equal to zero
+ *
+	@param x FP12 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP12_iszilch(FP12 *x);
+/**	@brief Tests for FP12 equal to unity
+ *
+	@param x FP12 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP12_isunity(FP12 *x);
+/**	@brief Copy FP12 to another FP12
+ *
+	@param x FP12 instance, on exit = y
+	@param y FP12 instance to be copied
+ */
+extern void FP12_copy(FP12 *x, FP12 *y);
+/**	@brief Set FP12 to unity
+ *
+	@param x FP12 instance to be set to one
+ */
+extern void FP12_one(FP12 *x);
+
+/**	@brief Set FP12 to zero
+ *
+	@param x FP12 instance to be set to zero
+ */
+extern void FP12_zero(FP12 *x);
+
+/**	@brief Tests for equality of two FP12s
+ *
+	@param x FP12 instance to be compared
+	@param y FP12 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP12_equals(FP12 *x, FP12 *y);
+/**	@brief Conjugation of FP12
+ *
+	If y=(a,b,c) (where a,b,c are its three FP4 components) on exit x=(conj(a),-conj(b),conj(c))
+	@param x FP12 instance, on exit = conj(y)
+	@param y FP12 instance
+ */
+extern void FP12_conj(FP12 *x, FP12 *y);
+/**	@brief Initialise FP12 from single FP4
+ *
+	Sets first FP4 component of an FP12, other components set to zero
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP4
+ */
+extern void FP12_from_FP4(FP12 *x, FP4 *a);
+/**	@brief Initialise FP12 from three FP4s
+ *
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP12
+	@param b FP4 to form second part of FP12
+	@param c FP4 to form third part of FP12
+ */
+extern void FP12_from_FP4s(FP12 *x, FP4 *a, FP4* b, FP4 *c);
+/**	@brief Fast Squaring of an FP12 in "unitary" form
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP4 instance, must be unitary
+ */
+extern void FP12_usqr(FP12 *x, FP12 *y);
+/**	@brief Squaring an FP12
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP12 instance
+ */
+extern void FP12_sqr(FP12 *x, FP12 *y);
+/**	@brief Fast multiplication of two sparse FP12s that arises from ATE pairing line functions
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_smul(FP12 *x, FP12 *y);
+
+/**	@brief Fast multiplication of what may be sparse multiplicands
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_ssmul(FP12 *x, FP12 *y);
+
+
+/**	@brief Full unconditional Multiplication of two FP12s
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, the multiplier
+ */
+extern void FP12_mul(FP12 *x, FP12 *y);
+
+/**	@brief Inverting an FP12
+ *
+	@param x FP12 instance, on exit = 1/y
+	@param y FP12 instance
+	@param t D_TYPE or M_TYPE twist
+ */
+extern void FP12_inv(FP12 *x, FP12 *y);
+/**	@brief Raises an FP12 to the power of a BIG
+ *
+	@param r FP12 instance, on exit = y^b
+	@param x FP12 instance
+	@param b BIG number
+ */
+extern void FP12_pow(FP12 *r, FP12 *x, B384_29::BIG b);
+/**	@brief Raises an FP12 instance x to a small integer power, side-channel resistant
+ *
+	@param x FP12 instance, on exit = x^i
+	@param i small integer exponent
+	@param b maximum number of bits in exponent
+ */
+extern void FP12_pinpow(FP12 *x, int i, int b);
+
+/**	@brief Raises an FP12 instance x to a BIG power, compressed to FP4
+ *
+	@param c FP4 instance, on exit = x^(e mod r) as FP4
+	@param x FP12 input
+	@param e BIG exponent
+	@param r BIG group order
+ */
+extern void FP12_compow(FP4 *c, FP12 *x, B384_29::BIG e, B384_29::BIG r);
+
+/**	@brief Calculate x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3], side-channel resistant
+ *
+	@param r FP12 instance, on exit = x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3]
+	@param x FP12 array with 4 FP12s
+	@param b BIG array of 4 exponents
+ */
+extern void FP12_pow4(FP12 *r, FP12 *x, B384_29::BIG *b);
+/**	@brief Raises an FP12 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP12 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP12_frob(FP12 *x, FP2 *f);
+/**	@brief Reduces all components of possibly unreduced FP12 mod Modulus
+ *
+	@param x FP12 instance, on exit reduced mod Modulus
+ */
+extern void FP12_reduce(FP12 *x);
+/**	@brief Normalises the components of an FP12
+ *
+	@param x FP12 instance to be normalised
+ */
+extern void FP12_norm(FP12 *x);
+/**	@brief Formats and outputs an FP12 to the console
+ *
+	@param x FP12 instance to be printed
+ */
+extern void FP12_output(FP12 *x);
+/**	@brief Formats and outputs an FP12 instance to an octet string
+ *
+	Serializes the components of an FP12 to big-endian base 256 form.
+	@param S output octet string
+	@param x FP12 instance to be converted to an octet string
+ */
+extern void FP12_toOctet(octet *S, FP12 *x);
+/**	@brief Creates an FP12 instance from an octet string
+ *
+	De-serializes the components of an FP12 to create an FP12 from big-endian base 256 components.
+	@param x FP12 instance to be created from an octet string
+	@param S input octet string
+
+ */
+extern void FP12_fromOctet(FP12 *x, octet *S);
+/**	@brief Calculate the trace of an FP12
+ *
+	@param t FP4 trace of x, on exit = tr(x)
+	@param x FP12 instance
+
+ */
+extern void FP12_trace(FP4 *t, FP12 *x);
+
+/**	@brief Conditional copy of FP12 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP12 instance, set to y if s!=0
+	@param y another FP12 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP12_cmove(FP12 *x, FP12 *y, int s);
+
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp12_BLS12443.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp12_BLS12443.h
new file mode 100644
index 0000000..bb9dbbd
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp12_BLS12443.h
@@ -0,0 +1,230 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP12_BLS12443_H
+#define FP12_BLS12443_H
+
+#include "fp4_BLS12443.h"
+
+using namespace core;
+
+namespace BLS12443 {
+/**
+	@brief FP12 Structure - towered over three FP4
+*/
+
+typedef struct
+{
+    FP4 a; /**< first part of FP12 */
+    FP4 b; /**< second part of FP12 */
+    FP4 c; /**< third part of FP12 */
+    int type;
+} FP12;
+
+extern const B448_29::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B448_29::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+/* FP12 prototypes */
+/**	@brief Tests for FP12 equal to zero
+ *
+	@param x FP12 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP12_iszilch(FP12 *x);
+/**	@brief Tests for FP12 equal to unity
+ *
+	@param x FP12 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP12_isunity(FP12 *x);
+/**	@brief Copy FP12 to another FP12
+ *
+	@param x FP12 instance, on exit = y
+	@param y FP12 instance to be copied
+ */
+extern void FP12_copy(FP12 *x, FP12 *y);
+/**	@brief Set FP12 to unity
+ *
+	@param x FP12 instance to be set to one
+ */
+extern void FP12_one(FP12 *x);
+
+/**	@brief Set FP12 to zero
+ *
+	@param x FP12 instance to be set to zero
+ */
+extern void FP12_zero(FP12 *x);
+
+/**	@brief Tests for equality of two FP12s
+ *
+	@param x FP12 instance to be compared
+	@param y FP12 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP12_equals(FP12 *x, FP12 *y);
+/**	@brief Conjugation of FP12
+ *
+	If y=(a,b,c) (where a,b,c are its three FP4 components) on exit x=(conj(a),-conj(b),conj(c))
+	@param x FP12 instance, on exit = conj(y)
+	@param y FP12 instance
+ */
+extern void FP12_conj(FP12 *x, FP12 *y);
+/**	@brief Initialise FP12 from single FP4
+ *
+	Sets first FP4 component of an FP12, other components set to zero
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP4
+ */
+extern void FP12_from_FP4(FP12 *x, FP4 *a);
+/**	@brief Initialise FP12 from three FP4s
+ *
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP12
+	@param b FP4 to form second part of FP12
+	@param c FP4 to form third part of FP12
+ */
+extern void FP12_from_FP4s(FP12 *x, FP4 *a, FP4* b, FP4 *c);
+/**	@brief Fast Squaring of an FP12 in "unitary" form
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP4 instance, must be unitary
+ */
+extern void FP12_usqr(FP12 *x, FP12 *y);
+/**	@brief Squaring an FP12
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP12 instance
+ */
+extern void FP12_sqr(FP12 *x, FP12 *y);
+/**	@brief Fast multiplication of two sparse FP12s that arises from ATE pairing line functions
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_smul(FP12 *x, FP12 *y);
+
+/**	@brief Fast multiplication of what may be sparse multiplicands
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_ssmul(FP12 *x, FP12 *y);
+
+
+/**	@brief Full unconditional Multiplication of two FP12s
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, the multiplier
+ */
+extern void FP12_mul(FP12 *x, FP12 *y);
+
+/**	@brief Inverting an FP12
+ *
+	@param x FP12 instance, on exit = 1/y
+	@param y FP12 instance
+	@param t D_TYPE or M_TYPE twist
+ */
+extern void FP12_inv(FP12 *x, FP12 *y);
+/**	@brief Raises an FP12 to the power of a BIG
+ *
+	@param r FP12 instance, on exit = y^b
+	@param x FP12 instance
+	@param b BIG number
+ */
+extern void FP12_pow(FP12 *r, FP12 *x, B448_29::BIG b);
+/**	@brief Raises an FP12 instance x to a small integer power, side-channel resistant
+ *
+	@param x FP12 instance, on exit = x^i
+	@param i small integer exponent
+	@param b maximum number of bits in exponent
+ */
+extern void FP12_pinpow(FP12 *x, int i, int b);
+
+/**	@brief Raises an FP12 instance x to a BIG power, compressed to FP4
+ *
+	@param c FP4 instance, on exit = x^(e mod r) as FP4
+	@param x FP12 input
+	@param e BIG exponent
+	@param r BIG group order
+ */
+extern void FP12_compow(FP4 *c, FP12 *x, B448_29::BIG e, B448_29::BIG r);
+
+/**	@brief Calculate x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3], side-channel resistant
+ *
+	@param r FP12 instance, on exit = x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3]
+	@param x FP12 array with 4 FP12s
+	@param b BIG array of 4 exponents
+ */
+extern void FP12_pow4(FP12 *r, FP12 *x, B448_29::BIG *b);
+/**	@brief Raises an FP12 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP12 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP12_frob(FP12 *x, FP2 *f);
+/**	@brief Reduces all components of possibly unreduced FP12 mod Modulus
+ *
+	@param x FP12 instance, on exit reduced mod Modulus
+ */
+extern void FP12_reduce(FP12 *x);
+/**	@brief Normalises the components of an FP12
+ *
+	@param x FP12 instance to be normalised
+ */
+extern void FP12_norm(FP12 *x);
+/**	@brief Formats and outputs an FP12 to the console
+ *
+	@param x FP12 instance to be printed
+ */
+extern void FP12_output(FP12 *x);
+/**	@brief Formats and outputs an FP12 instance to an octet string
+ *
+	Serializes the components of an FP12 to big-endian base 256 form.
+	@param S output octet string
+	@param x FP12 instance to be converted to an octet string
+ */
+extern void FP12_toOctet(octet *S, FP12 *x);
+/**	@brief Creates an FP12 instance from an octet string
+ *
+	De-serializes the components of an FP12 to create an FP12 from big-endian base 256 components.
+	@param x FP12 instance to be created from an octet string
+	@param S input octet string
+
+ */
+extern void FP12_fromOctet(FP12 *x, octet *S);
+/**	@brief Calculate the trace of an FP12
+ *
+	@param t FP4 trace of x, on exit = tr(x)
+	@param x FP12 instance
+
+ */
+extern void FP12_trace(FP4 *t, FP12 *x);
+
+/**	@brief Conditional copy of FP12 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP12 instance, set to y if s!=0
+	@param y another FP12 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP12_cmove(FP12 *x, FP12 *y, int s);
+
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp12_BLS12461.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp12_BLS12461.h
new file mode 100644
index 0000000..31c1901
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp12_BLS12461.h
@@ -0,0 +1,230 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP12_BLS12461_H
+#define FP12_BLS12461_H
+
+#include "fp4_BLS12461.h"
+
+using namespace core;
+
+namespace BLS12461 {
+/**
+	@brief FP12 Structure - towered over three FP4
+*/
+
+typedef struct
+{
+    FP4 a; /**< first part of FP12 */
+    FP4 b; /**< second part of FP12 */
+    FP4 c; /**< third part of FP12 */
+    int type;
+} FP12;
+
+extern const B464_28::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B464_28::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+/* FP12 prototypes */
+/**	@brief Tests for FP12 equal to zero
+ *
+	@param x FP12 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP12_iszilch(FP12 *x);
+/**	@brief Tests for FP12 equal to unity
+ *
+	@param x FP12 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP12_isunity(FP12 *x);
+/**	@brief Copy FP12 to another FP12
+ *
+	@param x FP12 instance, on exit = y
+	@param y FP12 instance to be copied
+ */
+extern void FP12_copy(FP12 *x, FP12 *y);
+/**	@brief Set FP12 to unity
+ *
+	@param x FP12 instance to be set to one
+ */
+extern void FP12_one(FP12 *x);
+
+/**	@brief Set FP12 to zero
+ *
+	@param x FP12 instance to be set to zero
+ */
+extern void FP12_zero(FP12 *x);
+
+/**	@brief Tests for equality of two FP12s
+ *
+	@param x FP12 instance to be compared
+	@param y FP12 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP12_equals(FP12 *x, FP12 *y);
+/**	@brief Conjugation of FP12
+ *
+	If y=(a,b,c) (where a,b,c are its three FP4 components) on exit x=(conj(a),-conj(b),conj(c))
+	@param x FP12 instance, on exit = conj(y)
+	@param y FP12 instance
+ */
+extern void FP12_conj(FP12 *x, FP12 *y);
+/**	@brief Initialise FP12 from single FP4
+ *
+	Sets first FP4 component of an FP12, other components set to zero
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP4
+ */
+extern void FP12_from_FP4(FP12 *x, FP4 *a);
+/**	@brief Initialise FP12 from three FP4s
+ *
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP12
+	@param b FP4 to form second part of FP12
+	@param c FP4 to form third part of FP12
+ */
+extern void FP12_from_FP4s(FP12 *x, FP4 *a, FP4* b, FP4 *c);
+/**	@brief Fast Squaring of an FP12 in "unitary" form
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP4 instance, must be unitary
+ */
+extern void FP12_usqr(FP12 *x, FP12 *y);
+/**	@brief Squaring an FP12
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP12 instance
+ */
+extern void FP12_sqr(FP12 *x, FP12 *y);
+/**	@brief Fast multiplication of two sparse FP12s that arises from ATE pairing line functions
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_smul(FP12 *x, FP12 *y);
+
+/**	@brief Fast multiplication of what may be sparse multiplicands
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_ssmul(FP12 *x, FP12 *y);
+
+
+/**	@brief Full unconditional Multiplication of two FP12s
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, the multiplier
+ */
+extern void FP12_mul(FP12 *x, FP12 *y);
+
+/**	@brief Inverting an FP12
+ *
+	@param x FP12 instance, on exit = 1/y
+	@param y FP12 instance
+	@param t D_TYPE or M_TYPE twist
+ */
+extern void FP12_inv(FP12 *x, FP12 *y);
+/**	@brief Raises an FP12 to the power of a BIG
+ *
+	@param r FP12 instance, on exit = y^b
+	@param x FP12 instance
+	@param b BIG number
+ */
+extern void FP12_pow(FP12 *r, FP12 *x, B464_28::BIG b);
+/**	@brief Raises an FP12 instance x to a small integer power, side-channel resistant
+ *
+	@param x FP12 instance, on exit = x^i
+	@param i small integer exponent
+	@param b maximum number of bits in exponent
+ */
+extern void FP12_pinpow(FP12 *x, int i, int b);
+
+/**	@brief Raises an FP12 instance x to a BIG power, compressed to FP4
+ *
+	@param c FP4 instance, on exit = x^(e mod r) as FP4
+	@param x FP12 input
+	@param e BIG exponent
+	@param r BIG group order
+ */
+extern void FP12_compow(FP4 *c, FP12 *x, B464_28::BIG e, B464_28::BIG r);
+
+/**	@brief Calculate x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3], side-channel resistant
+ *
+	@param r FP12 instance, on exit = x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3]
+	@param x FP12 array with 4 FP12s
+	@param b BIG array of 4 exponents
+ */
+extern void FP12_pow4(FP12 *r, FP12 *x, B464_28::BIG *b);
+/**	@brief Raises an FP12 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP12 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP12_frob(FP12 *x, FP2 *f);
+/**	@brief Reduces all components of possibly unreduced FP12 mod Modulus
+ *
+	@param x FP12 instance, on exit reduced mod Modulus
+ */
+extern void FP12_reduce(FP12 *x);
+/**	@brief Normalises the components of an FP12
+ *
+	@param x FP12 instance to be normalised
+ */
+extern void FP12_norm(FP12 *x);
+/**	@brief Formats and outputs an FP12 to the console
+ *
+	@param x FP12 instance to be printed
+ */
+extern void FP12_output(FP12 *x);
+/**	@brief Formats and outputs an FP12 instance to an octet string
+ *
+	Serializes the components of an FP12 to big-endian base 256 form.
+	@param S output octet string
+	@param x FP12 instance to be converted to an octet string
+ */
+extern void FP12_toOctet(octet *S, FP12 *x);
+/**	@brief Creates an FP12 instance from an octet string
+ *
+	De-serializes the components of an FP12 to create an FP12 from big-endian base 256 components.
+	@param x FP12 instance to be created from an octet string
+	@param S input octet string
+
+ */
+extern void FP12_fromOctet(FP12 *x, octet *S);
+/**	@brief Calculate the trace of an FP12
+ *
+	@param t FP4 trace of x, on exit = tr(x)
+	@param x FP12 instance
+
+ */
+extern void FP12_trace(FP4 *t, FP12 *x);
+
+/**	@brief Conditional copy of FP12 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP12 instance, set to y if s!=0
+	@param y another FP12 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP12_cmove(FP12 *x, FP12 *y, int s);
+
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp12_BN158.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp12_BN158.h
new file mode 100644
index 0000000..d510a2c
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp12_BN158.h
@@ -0,0 +1,230 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP12_BN158_H
+#define FP12_BN158_H
+
+#include "fp4_BN158.h"
+
+using namespace core;
+
+namespace BN158 {
+/**
+	@brief FP12 Structure - towered over three FP4
+*/
+
+typedef struct
+{
+    FP4 a; /**< first part of FP12 */
+    FP4 b; /**< second part of FP12 */
+    FP4 c; /**< third part of FP12 */
+    int type;
+} FP12;
+
+extern const B160_28::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B160_28::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+/* FP12 prototypes */
+/**	@brief Tests for FP12 equal to zero
+ *
+	@param x FP12 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP12_iszilch(FP12 *x);
+/**	@brief Tests for FP12 equal to unity
+ *
+	@param x FP12 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP12_isunity(FP12 *x);
+/**	@brief Copy FP12 to another FP12
+ *
+	@param x FP12 instance, on exit = y
+	@param y FP12 instance to be copied
+ */
+extern void FP12_copy(FP12 *x, FP12 *y);
+/**	@brief Set FP12 to unity
+ *
+	@param x FP12 instance to be set to one
+ */
+extern void FP12_one(FP12 *x);
+
+/**	@brief Set FP12 to zero
+ *
+	@param x FP12 instance to be set to zero
+ */
+extern void FP12_zero(FP12 *x);
+
+/**	@brief Tests for equality of two FP12s
+ *
+	@param x FP12 instance to be compared
+	@param y FP12 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP12_equals(FP12 *x, FP12 *y);
+/**	@brief Conjugation of FP12
+ *
+	If y=(a,b,c) (where a,b,c are its three FP4 components) on exit x=(conj(a),-conj(b),conj(c))
+	@param x FP12 instance, on exit = conj(y)
+	@param y FP12 instance
+ */
+extern void FP12_conj(FP12 *x, FP12 *y);
+/**	@brief Initialise FP12 from single FP4
+ *
+	Sets first FP4 component of an FP12, other components set to zero
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP4
+ */
+extern void FP12_from_FP4(FP12 *x, FP4 *a);
+/**	@brief Initialise FP12 from three FP4s
+ *
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP12
+	@param b FP4 to form second part of FP12
+	@param c FP4 to form third part of FP12
+ */
+extern void FP12_from_FP4s(FP12 *x, FP4 *a, FP4* b, FP4 *c);
+/**	@brief Fast Squaring of an FP12 in "unitary" form
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP4 instance, must be unitary
+ */
+extern void FP12_usqr(FP12 *x, FP12 *y);
+/**	@brief Squaring an FP12
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP12 instance
+ */
+extern void FP12_sqr(FP12 *x, FP12 *y);
+/**	@brief Fast multiplication of two sparse FP12s that arises from ATE pairing line functions
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_smul(FP12 *x, FP12 *y);
+
+/**	@brief Fast multiplication of what may be sparse multiplicands
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_ssmul(FP12 *x, FP12 *y);
+
+
+/**	@brief Full unconditional Multiplication of two FP12s
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, the multiplier
+ */
+extern void FP12_mul(FP12 *x, FP12 *y);
+
+/**	@brief Inverting an FP12
+ *
+	@param x FP12 instance, on exit = 1/y
+	@param y FP12 instance
+	@param t D_TYPE or M_TYPE twist
+ */
+extern void FP12_inv(FP12 *x, FP12 *y);
+/**	@brief Raises an FP12 to the power of a BIG
+ *
+	@param r FP12 instance, on exit = y^b
+	@param x FP12 instance
+	@param b BIG number
+ */
+extern void FP12_pow(FP12 *r, FP12 *x, B160_28::BIG b);
+/**	@brief Raises an FP12 instance x to a small integer power, side-channel resistant
+ *
+	@param x FP12 instance, on exit = x^i
+	@param i small integer exponent
+	@param b maximum number of bits in exponent
+ */
+extern void FP12_pinpow(FP12 *x, int i, int b);
+
+/**	@brief Raises an FP12 instance x to a BIG power, compressed to FP4
+ *
+	@param c FP4 instance, on exit = x^(e mod r) as FP4
+	@param x FP12 input
+	@param e BIG exponent
+	@param r BIG group order
+ */
+extern void FP12_compow(FP4 *c, FP12 *x, B160_28::BIG e, B160_28::BIG r);
+
+/**	@brief Calculate x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3], side-channel resistant
+ *
+	@param r FP12 instance, on exit = x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3]
+	@param x FP12 array with 4 FP12s
+	@param b BIG array of 4 exponents
+ */
+extern void FP12_pow4(FP12 *r, FP12 *x, B160_28::BIG *b);
+/**	@brief Raises an FP12 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP12 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP12_frob(FP12 *x, FP2 *f);
+/**	@brief Reduces all components of possibly unreduced FP12 mod Modulus
+ *
+	@param x FP12 instance, on exit reduced mod Modulus
+ */
+extern void FP12_reduce(FP12 *x);
+/**	@brief Normalises the components of an FP12
+ *
+	@param x FP12 instance to be normalised
+ */
+extern void FP12_norm(FP12 *x);
+/**	@brief Formats and outputs an FP12 to the console
+ *
+	@param x FP12 instance to be printed
+ */
+extern void FP12_output(FP12 *x);
+/**	@brief Formats and outputs an FP12 instance to an octet string
+ *
+	Serializes the components of an FP12 to big-endian base 256 form.
+	@param S output octet string
+	@param x FP12 instance to be converted to an octet string
+ */
+extern void FP12_toOctet(octet *S, FP12 *x);
+/**	@brief Creates an FP12 instance from an octet string
+ *
+	De-serializes the components of an FP12 to create an FP12 from big-endian base 256 components.
+	@param x FP12 instance to be created from an octet string
+	@param S input octet string
+
+ */
+extern void FP12_fromOctet(FP12 *x, octet *S);
+/**	@brief Calculate the trace of an FP12
+ *
+	@param t FP4 trace of x, on exit = tr(x)
+	@param x FP12 instance
+
+ */
+extern void FP12_trace(FP4 *t, FP12 *x);
+
+/**	@brief Conditional copy of FP12 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP12 instance, set to y if s!=0
+	@param y another FP12 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP12_cmove(FP12 *x, FP12 *y, int s);
+
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp12_BN254.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp12_BN254.h
new file mode 100644
index 0000000..300644d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp12_BN254.h
@@ -0,0 +1,230 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP12_BN254_H
+#define FP12_BN254_H
+
+#include "fp4_BN254.h"
+
+using namespace core;
+
+namespace BN254 {
+/**
+	@brief FP12 Structure - towered over three FP4
+*/
+
+typedef struct
+{
+    FP4 a; /**< first part of FP12 */
+    FP4 b; /**< second part of FP12 */
+    FP4 c; /**< third part of FP12 */
+    int type;
+} FP12;
+
+extern const B256_28::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_28::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+/* FP12 prototypes */
+/**	@brief Tests for FP12 equal to zero
+ *
+	@param x FP12 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP12_iszilch(FP12 *x);
+/**	@brief Tests for FP12 equal to unity
+ *
+	@param x FP12 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP12_isunity(FP12 *x);
+/**	@brief Copy FP12 to another FP12
+ *
+	@param x FP12 instance, on exit = y
+	@param y FP12 instance to be copied
+ */
+extern void FP12_copy(FP12 *x, FP12 *y);
+/**	@brief Set FP12 to unity
+ *
+	@param x FP12 instance to be set to one
+ */
+extern void FP12_one(FP12 *x);
+
+/**	@brief Set FP12 to zero
+ *
+	@param x FP12 instance to be set to zero
+ */
+extern void FP12_zero(FP12 *x);
+
+/**	@brief Tests for equality of two FP12s
+ *
+	@param x FP12 instance to be compared
+	@param y FP12 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP12_equals(FP12 *x, FP12 *y);
+/**	@brief Conjugation of FP12
+ *
+	If y=(a,b,c) (where a,b,c are its three FP4 components) on exit x=(conj(a),-conj(b),conj(c))
+	@param x FP12 instance, on exit = conj(y)
+	@param y FP12 instance
+ */
+extern void FP12_conj(FP12 *x, FP12 *y);
+/**	@brief Initialise FP12 from single FP4
+ *
+	Sets first FP4 component of an FP12, other components set to zero
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP4
+ */
+extern void FP12_from_FP4(FP12 *x, FP4 *a);
+/**	@brief Initialise FP12 from three FP4s
+ *
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP12
+	@param b FP4 to form second part of FP12
+	@param c FP4 to form third part of FP12
+ */
+extern void FP12_from_FP4s(FP12 *x, FP4 *a, FP4* b, FP4 *c);
+/**	@brief Fast Squaring of an FP12 in "unitary" form
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP4 instance, must be unitary
+ */
+extern void FP12_usqr(FP12 *x, FP12 *y);
+/**	@brief Squaring an FP12
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP12 instance
+ */
+extern void FP12_sqr(FP12 *x, FP12 *y);
+/**	@brief Fast multiplication of two sparse FP12s that arises from ATE pairing line functions
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_smul(FP12 *x, FP12 *y);
+
+/**	@brief Fast multiplication of what may be sparse multiplicands
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_ssmul(FP12 *x, FP12 *y);
+
+
+/**	@brief Full unconditional Multiplication of two FP12s
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, the multiplier
+ */
+extern void FP12_mul(FP12 *x, FP12 *y);
+
+/**	@brief Inverting an FP12
+ *
+	@param x FP12 instance, on exit = 1/y
+	@param y FP12 instance
+	@param t D_TYPE or M_TYPE twist
+ */
+extern void FP12_inv(FP12 *x, FP12 *y);
+/**	@brief Raises an FP12 to the power of a BIG
+ *
+	@param r FP12 instance, on exit = y^b
+	@param x FP12 instance
+	@param b BIG number
+ */
+extern void FP12_pow(FP12 *r, FP12 *x, B256_28::BIG b);
+/**	@brief Raises an FP12 instance x to a small integer power, side-channel resistant
+ *
+	@param x FP12 instance, on exit = x^i
+	@param i small integer exponent
+	@param b maximum number of bits in exponent
+ */
+extern void FP12_pinpow(FP12 *x, int i, int b);
+
+/**	@brief Raises an FP12 instance x to a BIG power, compressed to FP4
+ *
+	@param c FP4 instance, on exit = x^(e mod r) as FP4
+	@param x FP12 input
+	@param e BIG exponent
+	@param r BIG group order
+ */
+extern void FP12_compow(FP4 *c, FP12 *x, B256_28::BIG e, B256_28::BIG r);
+
+/**	@brief Calculate x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3], side-channel resistant
+ *
+	@param r FP12 instance, on exit = x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3]
+	@param x FP12 array with 4 FP12s
+	@param b BIG array of 4 exponents
+ */
+extern void FP12_pow4(FP12 *r, FP12 *x, B256_28::BIG *b);
+/**	@brief Raises an FP12 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP12 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP12_frob(FP12 *x, FP2 *f);
+/**	@brief Reduces all components of possibly unreduced FP12 mod Modulus
+ *
+	@param x FP12 instance, on exit reduced mod Modulus
+ */
+extern void FP12_reduce(FP12 *x);
+/**	@brief Normalises the components of an FP12
+ *
+	@param x FP12 instance to be normalised
+ */
+extern void FP12_norm(FP12 *x);
+/**	@brief Formats and outputs an FP12 to the console
+ *
+	@param x FP12 instance to be printed
+ */
+extern void FP12_output(FP12 *x);
+/**	@brief Formats and outputs an FP12 instance to an octet string
+ *
+	Serializes the components of an FP12 to big-endian base 256 form.
+	@param S output octet string
+	@param x FP12 instance to be converted to an octet string
+ */
+extern void FP12_toOctet(octet *S, FP12 *x);
+/**	@brief Creates an FP12 instance from an octet string
+ *
+	De-serializes the components of an FP12 to create an FP12 from big-endian base 256 components.
+	@param x FP12 instance to be created from an octet string
+	@param S input octet string
+
+ */
+extern void FP12_fromOctet(FP12 *x, octet *S);
+/**	@brief Calculate the trace of an FP12
+ *
+	@param t FP4 trace of x, on exit = tr(x)
+	@param x FP12 instance
+
+ */
+extern void FP12_trace(FP4 *t, FP12 *x);
+
+/**	@brief Conditional copy of FP12 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP12 instance, set to y if s!=0
+	@param y another FP12 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP12_cmove(FP12 *x, FP12 *y, int s);
+
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp12_BN254CX.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp12_BN254CX.h
new file mode 100644
index 0000000..2b737e5
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp12_BN254CX.h
@@ -0,0 +1,230 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP12_BN254CX_H
+#define FP12_BN254CX_H
+
+#include "fp4_BN254CX.h"
+
+using namespace core;
+
+namespace BN254CX {
+/**
+	@brief FP12 Structure - towered over three FP4
+*/
+
+typedef struct
+{
+    FP4 a; /**< first part of FP12 */
+    FP4 b; /**< second part of FP12 */
+    FP4 c; /**< third part of FP12 */
+    int type;
+} FP12;
+
+extern const B256_28::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_28::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+/* FP12 prototypes */
+/**	@brief Tests for FP12 equal to zero
+ *
+	@param x FP12 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP12_iszilch(FP12 *x);
+/**	@brief Tests for FP12 equal to unity
+ *
+	@param x FP12 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP12_isunity(FP12 *x);
+/**	@brief Copy FP12 to another FP12
+ *
+	@param x FP12 instance, on exit = y
+	@param y FP12 instance to be copied
+ */
+extern void FP12_copy(FP12 *x, FP12 *y);
+/**	@brief Set FP12 to unity
+ *
+	@param x FP12 instance to be set to one
+ */
+extern void FP12_one(FP12 *x);
+
+/**	@brief Set FP12 to zero
+ *
+	@param x FP12 instance to be set to zero
+ */
+extern void FP12_zero(FP12 *x);
+
+/**	@brief Tests for equality of two FP12s
+ *
+	@param x FP12 instance to be compared
+	@param y FP12 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP12_equals(FP12 *x, FP12 *y);
+/**	@brief Conjugation of FP12
+ *
+	If y=(a,b,c) (where a,b,c are its three FP4 components) on exit x=(conj(a),-conj(b),conj(c))
+	@param x FP12 instance, on exit = conj(y)
+	@param y FP12 instance
+ */
+extern void FP12_conj(FP12 *x, FP12 *y);
+/**	@brief Initialise FP12 from single FP4
+ *
+	Sets first FP4 component of an FP12, other components set to zero
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP4
+ */
+extern void FP12_from_FP4(FP12 *x, FP4 *a);
+/**	@brief Initialise FP12 from three FP4s
+ *
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP12
+	@param b FP4 to form second part of FP12
+	@param c FP4 to form third part of FP12
+ */
+extern void FP12_from_FP4s(FP12 *x, FP4 *a, FP4* b, FP4 *c);
+/**	@brief Fast Squaring of an FP12 in "unitary" form
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP4 instance, must be unitary
+ */
+extern void FP12_usqr(FP12 *x, FP12 *y);
+/**	@brief Squaring an FP12
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP12 instance
+ */
+extern void FP12_sqr(FP12 *x, FP12 *y);
+/**	@brief Fast multiplication of two sparse FP12s that arises from ATE pairing line functions
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_smul(FP12 *x, FP12 *y);
+
+/**	@brief Fast multiplication of what may be sparse multiplicands
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_ssmul(FP12 *x, FP12 *y);
+
+
+/**	@brief Full unconditional Multiplication of two FP12s
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, the multiplier
+ */
+extern void FP12_mul(FP12 *x, FP12 *y);
+
+/**	@brief Inverting an FP12
+ *
+	@param x FP12 instance, on exit = 1/y
+	@param y FP12 instance
+	@param t D_TYPE or M_TYPE twist
+ */
+extern void FP12_inv(FP12 *x, FP12 *y);
+/**	@brief Raises an FP12 to the power of a BIG
+ *
+	@param r FP12 instance, on exit = y^b
+	@param x FP12 instance
+	@param b BIG number
+ */
+extern void FP12_pow(FP12 *r, FP12 *x, B256_28::BIG b);
+/**	@brief Raises an FP12 instance x to a small integer power, side-channel resistant
+ *
+	@param x FP12 instance, on exit = x^i
+	@param i small integer exponent
+	@param b maximum number of bits in exponent
+ */
+extern void FP12_pinpow(FP12 *x, int i, int b);
+
+/**	@brief Raises an FP12 instance x to a BIG power, compressed to FP4
+ *
+	@param c FP4 instance, on exit = x^(e mod r) as FP4
+	@param x FP12 input
+	@param e BIG exponent
+	@param r BIG group order
+ */
+extern void FP12_compow(FP4 *c, FP12 *x, B256_28::BIG e, B256_28::BIG r);
+
+/**	@brief Calculate x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3], side-channel resistant
+ *
+	@param r FP12 instance, on exit = x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3]
+	@param x FP12 array with 4 FP12s
+	@param b BIG array of 4 exponents
+ */
+extern void FP12_pow4(FP12 *r, FP12 *x, B256_28::BIG *b);
+/**	@brief Raises an FP12 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP12 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP12_frob(FP12 *x, FP2 *f);
+/**	@brief Reduces all components of possibly unreduced FP12 mod Modulus
+ *
+	@param x FP12 instance, on exit reduced mod Modulus
+ */
+extern void FP12_reduce(FP12 *x);
+/**	@brief Normalises the components of an FP12
+ *
+	@param x FP12 instance to be normalised
+ */
+extern void FP12_norm(FP12 *x);
+/**	@brief Formats and outputs an FP12 to the console
+ *
+	@param x FP12 instance to be printed
+ */
+extern void FP12_output(FP12 *x);
+/**	@brief Formats and outputs an FP12 instance to an octet string
+ *
+	Serializes the components of an FP12 to big-endian base 256 form.
+	@param S output octet string
+	@param x FP12 instance to be converted to an octet string
+ */
+extern void FP12_toOctet(octet *S, FP12 *x);
+/**	@brief Creates an FP12 instance from an octet string
+ *
+	De-serializes the components of an FP12 to create an FP12 from big-endian base 256 components.
+	@param x FP12 instance to be created from an octet string
+	@param S input octet string
+
+ */
+extern void FP12_fromOctet(FP12 *x, octet *S);
+/**	@brief Calculate the trace of an FP12
+ *
+	@param t FP4 trace of x, on exit = tr(x)
+	@param x FP12 instance
+
+ */
+extern void FP12_trace(FP4 *t, FP12 *x);
+
+/**	@brief Conditional copy of FP12 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP12 instance, set to y if s!=0
+	@param y another FP12 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP12_cmove(FP12 *x, FP12 *y, int s);
+
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp12_BN462.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp12_BN462.h
new file mode 100644
index 0000000..b70b33b
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp12_BN462.h
@@ -0,0 +1,230 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP12_BN462_H
+#define FP12_BN462_H
+
+#include "fp4_BN462.h"
+
+using namespace core;
+
+namespace BN462 {
+/**
+	@brief FP12 Structure - towered over three FP4
+*/
+
+typedef struct
+{
+    FP4 a; /**< first part of FP12 */
+    FP4 b; /**< second part of FP12 */
+    FP4 c; /**< third part of FP12 */
+    int type;
+} FP12;
+
+extern const B464_28::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B464_28::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+/* FP12 prototypes */
+/**	@brief Tests for FP12 equal to zero
+ *
+	@param x FP12 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP12_iszilch(FP12 *x);
+/**	@brief Tests for FP12 equal to unity
+ *
+	@param x FP12 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP12_isunity(FP12 *x);
+/**	@brief Copy FP12 to another FP12
+ *
+	@param x FP12 instance, on exit = y
+	@param y FP12 instance to be copied
+ */
+extern void FP12_copy(FP12 *x, FP12 *y);
+/**	@brief Set FP12 to unity
+ *
+	@param x FP12 instance to be set to one
+ */
+extern void FP12_one(FP12 *x);
+
+/**	@brief Set FP12 to zero
+ *
+	@param x FP12 instance to be set to zero
+ */
+extern void FP12_zero(FP12 *x);
+
+/**	@brief Tests for equality of two FP12s
+ *
+	@param x FP12 instance to be compared
+	@param y FP12 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP12_equals(FP12 *x, FP12 *y);
+/**	@brief Conjugation of FP12
+ *
+	If y=(a,b,c) (where a,b,c are its three FP4 components) on exit x=(conj(a),-conj(b),conj(c))
+	@param x FP12 instance, on exit = conj(y)
+	@param y FP12 instance
+ */
+extern void FP12_conj(FP12 *x, FP12 *y);
+/**	@brief Initialise FP12 from single FP4
+ *
+	Sets first FP4 component of an FP12, other components set to zero
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP4
+ */
+extern void FP12_from_FP4(FP12 *x, FP4 *a);
+/**	@brief Initialise FP12 from three FP4s
+ *
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP12
+	@param b FP4 to form second part of FP12
+	@param c FP4 to form third part of FP12
+ */
+extern void FP12_from_FP4s(FP12 *x, FP4 *a, FP4* b, FP4 *c);
+/**	@brief Fast Squaring of an FP12 in "unitary" form
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP4 instance, must be unitary
+ */
+extern void FP12_usqr(FP12 *x, FP12 *y);
+/**	@brief Squaring an FP12
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP12 instance
+ */
+extern void FP12_sqr(FP12 *x, FP12 *y);
+/**	@brief Fast multiplication of two sparse FP12s that arises from ATE pairing line functions
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_smul(FP12 *x, FP12 *y);
+
+/**	@brief Fast multiplication of what may be sparse multiplicands
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_ssmul(FP12 *x, FP12 *y);
+
+
+/**	@brief Full unconditional Multiplication of two FP12s
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, the multiplier
+ */
+extern void FP12_mul(FP12 *x, FP12 *y);
+
+/**	@brief Inverting an FP12
+ *
+	@param x FP12 instance, on exit = 1/y
+	@param y FP12 instance
+	@param t D_TYPE or M_TYPE twist
+ */
+extern void FP12_inv(FP12 *x, FP12 *y);
+/**	@brief Raises an FP12 to the power of a BIG
+ *
+	@param r FP12 instance, on exit = y^b
+	@param x FP12 instance
+	@param b BIG number
+ */
+extern void FP12_pow(FP12 *r, FP12 *x, B464_28::BIG b);
+/**	@brief Raises an FP12 instance x to a small integer power, side-channel resistant
+ *
+	@param x FP12 instance, on exit = x^i
+	@param i small integer exponent
+	@param b maximum number of bits in exponent
+ */
+extern void FP12_pinpow(FP12 *x, int i, int b);
+
+/**	@brief Raises an FP12 instance x to a BIG power, compressed to FP4
+ *
+	@param c FP4 instance, on exit = x^(e mod r) as FP4
+	@param x FP12 input
+	@param e BIG exponent
+	@param r BIG group order
+ */
+extern void FP12_compow(FP4 *c, FP12 *x, B464_28::BIG e, B464_28::BIG r);
+
+/**	@brief Calculate x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3], side-channel resistant
+ *
+	@param r FP12 instance, on exit = x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3]
+	@param x FP12 array with 4 FP12s
+	@param b BIG array of 4 exponents
+ */
+extern void FP12_pow4(FP12 *r, FP12 *x, B464_28::BIG *b);
+/**	@brief Raises an FP12 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP12 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP12_frob(FP12 *x, FP2 *f);
+/**	@brief Reduces all components of possibly unreduced FP12 mod Modulus
+ *
+	@param x FP12 instance, on exit reduced mod Modulus
+ */
+extern void FP12_reduce(FP12 *x);
+/**	@brief Normalises the components of an FP12
+ *
+	@param x FP12 instance to be normalised
+ */
+extern void FP12_norm(FP12 *x);
+/**	@brief Formats and outputs an FP12 to the console
+ *
+	@param x FP12 instance to be printed
+ */
+extern void FP12_output(FP12 *x);
+/**	@brief Formats and outputs an FP12 instance to an octet string
+ *
+	Serializes the components of an FP12 to big-endian base 256 form.
+	@param S output octet string
+	@param x FP12 instance to be converted to an octet string
+ */
+extern void FP12_toOctet(octet *S, FP12 *x);
+/**	@brief Creates an FP12 instance from an octet string
+ *
+	De-serializes the components of an FP12 to create an FP12 from big-endian base 256 components.
+	@param x FP12 instance to be created from an octet string
+	@param S input octet string
+
+ */
+extern void FP12_fromOctet(FP12 *x, octet *S);
+/**	@brief Calculate the trace of an FP12
+ *
+	@param t FP4 trace of x, on exit = tr(x)
+	@param x FP12 instance
+
+ */
+extern void FP12_trace(FP4 *t, FP12 *x);
+
+/**	@brief Conditional copy of FP12 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP12 instance, set to y if s!=0
+	@param y another FP12 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP12_cmove(FP12 *x, FP12 *y, int s);
+
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp12_FP256BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp12_FP256BN.h
new file mode 100644
index 0000000..ebd6b02
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp12_FP256BN.h
@@ -0,0 +1,230 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP12_FP256BN_H
+#define FP12_FP256BN_H
+
+#include "fp4_FP256BN.h"
+
+using namespace core;
+
+namespace FP256BN {
+/**
+	@brief FP12 Structure - towered over three FP4
+*/
+
+typedef struct
+{
+    FP4 a; /**< first part of FP12 */
+    FP4 b; /**< second part of FP12 */
+    FP4 c; /**< third part of FP12 */
+    int type;
+} FP12;
+
+extern const B256_28::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_28::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+/* FP12 prototypes */
+/**	@brief Tests for FP12 equal to zero
+ *
+	@param x FP12 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP12_iszilch(FP12 *x);
+/**	@brief Tests for FP12 equal to unity
+ *
+	@param x FP12 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP12_isunity(FP12 *x);
+/**	@brief Copy FP12 to another FP12
+ *
+	@param x FP12 instance, on exit = y
+	@param y FP12 instance to be copied
+ */
+extern void FP12_copy(FP12 *x, FP12 *y);
+/**	@brief Set FP12 to unity
+ *
+	@param x FP12 instance to be set to one
+ */
+extern void FP12_one(FP12 *x);
+
+/**	@brief Set FP12 to zero
+ *
+	@param x FP12 instance to be set to zero
+ */
+extern void FP12_zero(FP12 *x);
+
+/**	@brief Tests for equality of two FP12s
+ *
+	@param x FP12 instance to be compared
+	@param y FP12 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP12_equals(FP12 *x, FP12 *y);
+/**	@brief Conjugation of FP12
+ *
+	If y=(a,b,c) (where a,b,c are its three FP4 components) on exit x=(conj(a),-conj(b),conj(c))
+	@param x FP12 instance, on exit = conj(y)
+	@param y FP12 instance
+ */
+extern void FP12_conj(FP12 *x, FP12 *y);
+/**	@brief Initialise FP12 from single FP4
+ *
+	Sets first FP4 component of an FP12, other components set to zero
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP4
+ */
+extern void FP12_from_FP4(FP12 *x, FP4 *a);
+/**	@brief Initialise FP12 from three FP4s
+ *
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP12
+	@param b FP4 to form second part of FP12
+	@param c FP4 to form third part of FP12
+ */
+extern void FP12_from_FP4s(FP12 *x, FP4 *a, FP4* b, FP4 *c);
+/**	@brief Fast Squaring of an FP12 in "unitary" form
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP4 instance, must be unitary
+ */
+extern void FP12_usqr(FP12 *x, FP12 *y);
+/**	@brief Squaring an FP12
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP12 instance
+ */
+extern void FP12_sqr(FP12 *x, FP12 *y);
+/**	@brief Fast multiplication of two sparse FP12s that arises from ATE pairing line functions
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_smul(FP12 *x, FP12 *y);
+
+/**	@brief Fast multiplication of what may be sparse multiplicands
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_ssmul(FP12 *x, FP12 *y);
+
+
+/**	@brief Full unconditional Multiplication of two FP12s
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, the multiplier
+ */
+extern void FP12_mul(FP12 *x, FP12 *y);
+
+/**	@brief Inverting an FP12
+ *
+	@param x FP12 instance, on exit = 1/y
+	@param y FP12 instance
+	@param t D_TYPE or M_TYPE twist
+ */
+extern void FP12_inv(FP12 *x, FP12 *y);
+/**	@brief Raises an FP12 to the power of a BIG
+ *
+	@param r FP12 instance, on exit = y^b
+	@param x FP12 instance
+	@param b BIG number
+ */
+extern void FP12_pow(FP12 *r, FP12 *x, B256_28::BIG b);
+/**	@brief Raises an FP12 instance x to a small integer power, side-channel resistant
+ *
+	@param x FP12 instance, on exit = x^i
+	@param i small integer exponent
+	@param b maximum number of bits in exponent
+ */
+extern void FP12_pinpow(FP12 *x, int i, int b);
+
+/**	@brief Raises an FP12 instance x to a BIG power, compressed to FP4
+ *
+	@param c FP4 instance, on exit = x^(e mod r) as FP4
+	@param x FP12 input
+	@param e BIG exponent
+	@param r BIG group order
+ */
+extern void FP12_compow(FP4 *c, FP12 *x, B256_28::BIG e, B256_28::BIG r);
+
+/**	@brief Calculate x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3], side-channel resistant
+ *
+	@param r FP12 instance, on exit = x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3]
+	@param x FP12 array with 4 FP12s
+	@param b BIG array of 4 exponents
+ */
+extern void FP12_pow4(FP12 *r, FP12 *x, B256_28::BIG *b);
+/**	@brief Raises an FP12 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP12 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP12_frob(FP12 *x, FP2 *f);
+/**	@brief Reduces all components of possibly unreduced FP12 mod Modulus
+ *
+	@param x FP12 instance, on exit reduced mod Modulus
+ */
+extern void FP12_reduce(FP12 *x);
+/**	@brief Normalises the components of an FP12
+ *
+	@param x FP12 instance to be normalised
+ */
+extern void FP12_norm(FP12 *x);
+/**	@brief Formats and outputs an FP12 to the console
+ *
+	@param x FP12 instance to be printed
+ */
+extern void FP12_output(FP12 *x);
+/**	@brief Formats and outputs an FP12 instance to an octet string
+ *
+	Serializes the components of an FP12 to big-endian base 256 form.
+	@param S output octet string
+	@param x FP12 instance to be converted to an octet string
+ */
+extern void FP12_toOctet(octet *S, FP12 *x);
+/**	@brief Creates an FP12 instance from an octet string
+ *
+	De-serializes the components of an FP12 to create an FP12 from big-endian base 256 components.
+	@param x FP12 instance to be created from an octet string
+	@param S input octet string
+
+ */
+extern void FP12_fromOctet(FP12 *x, octet *S);
+/**	@brief Calculate the trace of an FP12
+ *
+	@param t FP4 trace of x, on exit = tr(x)
+	@param x FP12 instance
+
+ */
+extern void FP12_trace(FP4 *t, FP12 *x);
+
+/**	@brief Conditional copy of FP12 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP12 instance, set to y if s!=0
+	@param y another FP12 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP12_cmove(FP12 *x, FP12 *y, int s);
+
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp12_FP512BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp12_FP512BN.h
new file mode 100644
index 0000000..8cf92a3
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp12_FP512BN.h
@@ -0,0 +1,230 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP12_FP512BN_H
+#define FP12_FP512BN_H
+
+#include "fp4_FP512BN.h"
+
+using namespace core;
+
+namespace FP512BN {
+/**
+	@brief FP12 Structure - towered over three FP4
+*/
+
+typedef struct
+{
+    FP4 a; /**< first part of FP12 */
+    FP4 b; /**< second part of FP12 */
+    FP4 c; /**< third part of FP12 */
+    int type;
+} FP12;
+
+extern const B512_29::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B512_29::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+/* FP12 prototypes */
+/**	@brief Tests for FP12 equal to zero
+ *
+	@param x FP12 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP12_iszilch(FP12 *x);
+/**	@brief Tests for FP12 equal to unity
+ *
+	@param x FP12 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP12_isunity(FP12 *x);
+/**	@brief Copy FP12 to another FP12
+ *
+	@param x FP12 instance, on exit = y
+	@param y FP12 instance to be copied
+ */
+extern void FP12_copy(FP12 *x, FP12 *y);
+/**	@brief Set FP12 to unity
+ *
+	@param x FP12 instance to be set to one
+ */
+extern void FP12_one(FP12 *x);
+
+/**	@brief Set FP12 to zero
+ *
+	@param x FP12 instance to be set to zero
+ */
+extern void FP12_zero(FP12 *x);
+
+/**	@brief Tests for equality of two FP12s
+ *
+	@param x FP12 instance to be compared
+	@param y FP12 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP12_equals(FP12 *x, FP12 *y);
+/**	@brief Conjugation of FP12
+ *
+	If y=(a,b,c) (where a,b,c are its three FP4 components) on exit x=(conj(a),-conj(b),conj(c))
+	@param x FP12 instance, on exit = conj(y)
+	@param y FP12 instance
+ */
+extern void FP12_conj(FP12 *x, FP12 *y);
+/**	@brief Initialise FP12 from single FP4
+ *
+	Sets first FP4 component of an FP12, other components set to zero
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP4
+ */
+extern void FP12_from_FP4(FP12 *x, FP4 *a);
+/**	@brief Initialise FP12 from three FP4s
+ *
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP12
+	@param b FP4 to form second part of FP12
+	@param c FP4 to form third part of FP12
+ */
+extern void FP12_from_FP4s(FP12 *x, FP4 *a, FP4* b, FP4 *c);
+/**	@brief Fast Squaring of an FP12 in "unitary" form
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP4 instance, must be unitary
+ */
+extern void FP12_usqr(FP12 *x, FP12 *y);
+/**	@brief Squaring an FP12
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP12 instance
+ */
+extern void FP12_sqr(FP12 *x, FP12 *y);
+/**	@brief Fast multiplication of two sparse FP12s that arises from ATE pairing line functions
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_smul(FP12 *x, FP12 *y);
+
+/**	@brief Fast multiplication of what may be sparse multiplicands
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_ssmul(FP12 *x, FP12 *y);
+
+
+/**	@brief Full unconditional Multiplication of two FP12s
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, the multiplier
+ */
+extern void FP12_mul(FP12 *x, FP12 *y);
+
+/**	@brief Inverting an FP12
+ *
+	@param x FP12 instance, on exit = 1/y
+	@param y FP12 instance
+	@param t D_TYPE or M_TYPE twist
+ */
+extern void FP12_inv(FP12 *x, FP12 *y);
+/**	@brief Raises an FP12 to the power of a BIG
+ *
+	@param r FP12 instance, on exit = y^b
+	@param x FP12 instance
+	@param b BIG number
+ */
+extern void FP12_pow(FP12 *r, FP12 *x, B512_29::BIG b);
+/**	@brief Raises an FP12 instance x to a small integer power, side-channel resistant
+ *
+	@param x FP12 instance, on exit = x^i
+	@param i small integer exponent
+	@param b maximum number of bits in exponent
+ */
+extern void FP12_pinpow(FP12 *x, int i, int b);
+
+/**	@brief Raises an FP12 instance x to a BIG power, compressed to FP4
+ *
+	@param c FP4 instance, on exit = x^(e mod r) as FP4
+	@param x FP12 input
+	@param e BIG exponent
+	@param r BIG group order
+ */
+extern void FP12_compow(FP4 *c, FP12 *x, B512_29::BIG e, B512_29::BIG r);
+
+/**	@brief Calculate x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3], side-channel resistant
+ *
+	@param r FP12 instance, on exit = x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3]
+	@param x FP12 array with 4 FP12s
+	@param b BIG array of 4 exponents
+ */
+extern void FP12_pow4(FP12 *r, FP12 *x, B512_29::BIG *b);
+/**	@brief Raises an FP12 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP12 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP12_frob(FP12 *x, FP2 *f);
+/**	@brief Reduces all components of possibly unreduced FP12 mod Modulus
+ *
+	@param x FP12 instance, on exit reduced mod Modulus
+ */
+extern void FP12_reduce(FP12 *x);
+/**	@brief Normalises the components of an FP12
+ *
+	@param x FP12 instance to be normalised
+ */
+extern void FP12_norm(FP12 *x);
+/**	@brief Formats and outputs an FP12 to the console
+ *
+	@param x FP12 instance to be printed
+ */
+extern void FP12_output(FP12 *x);
+/**	@brief Formats and outputs an FP12 instance to an octet string
+ *
+	Serializes the components of an FP12 to big-endian base 256 form.
+	@param S output octet string
+	@param x FP12 instance to be converted to an octet string
+ */
+extern void FP12_toOctet(octet *S, FP12 *x);
+/**	@brief Creates an FP12 instance from an octet string
+ *
+	De-serializes the components of an FP12 to create an FP12 from big-endian base 256 components.
+	@param x FP12 instance to be created from an octet string
+	@param S input octet string
+
+ */
+extern void FP12_fromOctet(FP12 *x, octet *S);
+/**	@brief Calculate the trace of an FP12
+ *
+	@param t FP4 trace of x, on exit = tr(x)
+	@param x FP12 instance
+
+ */
+extern void FP12_trace(FP4 *t, FP12 *x);
+
+/**	@brief Conditional copy of FP12 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP12 instance, set to y if s!=0
+	@param y another FP12 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP12_cmove(FP12 *x, FP12 *y, int s);
+
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp16_BLS48286.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp16_BLS48286.h
new file mode 100644
index 0000000..ae75f0e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp16_BLS48286.h
@@ -0,0 +1,308 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP16_BLS48286_H
+#define FP16_BLS48286_H
+
+#include "fp8_BLS48286.h"
+#include "config_curve_BLS48286.h"
+
+using namespace core;
+
+namespace BLS48286 {
+
+/**
+	@brief FP16 Structure - towered over two FP4
+*/
+
+typedef struct
+{
+    FP8 a; /**< real part of FP16 */
+    FP8 b; /**< imaginary part of FP16 */
+} FP16;
+
+
+/* FP16 prototypes */
+/**	@brief Tests for FP16 equal to zero
+ *
+	@param x FP16 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP16_iszilch(FP16 *x);
+/**	@brief Tests for FP16 equal to unity
+ *
+	@param x FP16 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP16_isunity(FP16 *x);
+/**	@brief Tests for equality of two FP16s
+ *
+	@param x FP16 instance to be compared
+	@param y FP16 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP16_equals(FP16 *x, FP16 *y);
+
+/**	@brief Serialize in FP16  
+ *
+    @param b buffer for output
+	@param x FP16 number to be serialized
+ */
+extern void FP16_toBytes(char *b,FP16 *x);
+/**	@brief Serialize out FP16  
+ *
+	@param x FP16 number to be serialized
+    @param b buffer for input
+ */
+extern void FP16_fromBytes(FP16 *x,char *b);
+
+/**	@brief Tests for FP16 having only a real part and no imaginary part
+ *
+	@param x FP16 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP16_isreal(FP16 *x);
+/**	@brief Initialise FP16 from two FP8s
+ *
+	@param x FP16 instance to be initialised
+	@param a FP8 to form real part of FP16
+	@param b FP8 to form imaginary part of FP16
+ */
+extern void FP16_from_FP8s(FP16 *x, FP8 *a, FP8 *b);
+/**	@brief Initialise FP16 from single FP8
+ *
+	Imaginary part is set to zero
+	@param x FP16 instance to be initialised
+	@param a FP8 to form real part of FP16
+ */
+extern void FP16_from_FP8(FP16 *x, FP8 *a);
+
+/**	@brief Initialise FP16 from single FP8
+ *
+	real part is set to zero
+	@param x FP16 instance to be initialised
+	@param a FP8 to form imaginary part of FP16
+ */
+extern void FP16_from_FP8H(FP16 *x, FP8 *a);
+
+
+/**	@brief Copy FP16 to another FP16
+ *
+	@param x FP16 instance, on exit = y
+	@param y FP16 instance to be copied
+ */
+extern void FP16_copy(FP16 *x, FP16 *y);
+/**	@brief Set FP16 to zero
+ *
+	@param x FP16 instance to be set to zero
+ */
+extern void FP16_zero(FP16 *x);
+/**	@brief Set FP16 to unity
+ *
+	@param x FP16 instance to be set to one
+ */
+extern void FP16_one(FP16 *x);
+/**	@brief Negation of FP16
+ *
+	@param x FP16 instance, on exit = -y
+	@param y FP16 instance
+ */
+extern void FP16_neg(FP16 *x, FP16 *y);
+/**	@brief Conjugation of FP16
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP16 instance, on exit = conj(y)
+	@param y FP16 instance
+ */
+extern void FP16_conj(FP16 *x, FP16 *y);
+/**	@brief Negative conjugation of FP16
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP16 instance, on exit = -conj(y)
+	@param y FP16 instance
+ */
+extern void FP16_nconj(FP16 *x, FP16 *y);
+/**	@brief addition of two FP16s
+ *
+	@param x FP16 instance, on exit = y+z
+	@param y FP16 instance
+	@param z FP16 instance
+ */
+extern void FP16_add(FP16 *x, FP16 *y, FP16 *z);
+/**	@brief subtraction of two FP16s
+ *
+	@param x FP16 instance, on exit = y-z
+	@param y FP16 instance
+	@param z FP16 instance
+ */
+extern void FP16_sub(FP16 *x, FP16 *y, FP16 *z);
+/**	@brief Multiplication of an FP16 by an FP8
+ *
+	@param x FP16 instance, on exit = y*a
+	@param y FP16 instance
+	@param a FP4 multiplier
+ */
+extern void FP16_pmul(FP16 *x, FP16 *y, FP8 *a);
+
+/**	@brief Multiplication of an FP16 by an FP2
+ *
+	@param x FP16 instance, on exit = y*a
+	@param y FP16 instance
+	@param a FP2 multiplier
+ */
+extern void FP16_qmul(FP16 *x, FP16 *y, FP2 *a);
+
+
+/**	@brief Multiplication of an FP16 by an FP
+ *
+	@param x FP16 instance, on exit = y*a
+	@param y FP16 instance
+	@param a FP multiplier
+ */
+extern void FP16_tmul(FP16 *x, FP16 *y, FP *a);
+
+
+
+/**	@brief Multiplication of an FP16 by a small integer
+ *
+	@param x FP16 instance, on exit = y*i
+	@param y FP16 instance
+	@param i an integer
+ */
+extern void FP16_imul(FP16 *x, FP16 *y, int i);
+/**	@brief Squaring an FP16
+ *
+	@param x FP16 instance, on exit = y^2
+	@param y FP16 instance
+ */
+extern void FP16_sqr(FP16 *x, FP16 *y);
+/**	@brief Multiplication of two FP16s
+ *
+	@param x FP16 instance, on exit = y*z
+	@param y FP16 instance
+	@param z FP16 instance
+ */
+extern void FP16_mul(FP16 *x, FP16 *y, FP16 *z);
+/**	@brief Inverting an FP16
+ *
+	@param x FP16 instance, on exit = 1/y
+	@param y FP16 instance
+ */
+extern void FP16_inv(FP16 *x, FP16 *y);
+/**	@brief Formats and outputs an FP16 to the console
+ *
+	@param x FP16 instance to be printed
+ */
+extern void FP16_output(FP16 *x);
+/**	@brief Formats and outputs an FP16 to the console in raw form (for debugging)
+ *
+	@param x FP16 instance to be printed
+ */
+extern void FP16_rawoutput(FP16 *x);
+/**	@brief multiplies an FP16 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP16 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP16_times_i(FP16 *x);
+/**	@brief multiplies an FP16 instance by irreducible polynomial (1+sqrt(-1))
+ *
+	@param x FP16 instance, on exit = sqrt(1+sqrt(-1))^2*x
+ */
+extern void FP16_times_i2(FP16 *x);
+
+/**	@brief multiplies an FP16 instance by irreducible polynomial (1+sqrt(-1))
+ *
+	@param x FP16 instance, on exit = sqrt(1+sqrt(-1))^4*x
+ */
+extern void FP16_times_i4(FP16 *x);
+
+
+/**	@brief Normalises the components of an FP16
+ *
+	@param x FP16 instance to be normalised
+ */
+extern void FP16_norm(FP16 *x);
+/**	@brief Reduces all components of possibly unreduced FP16 mod Modulus
+ *
+	@param x FP16 instance, on exit reduced mod Modulus
+ */
+extern void FP16_reduce(FP16 *x);
+/**	@brief Raises an FP16 to the power of a BIG
+ *
+	@param x FP16 instance, on exit = y^b
+	@param y FP16 instance
+	@param b BIG number
+ */
+extern void FP16_pow(FP16 *x, FP16 *y, B288_29::BIG b);
+/**	@brief Raises an FP16 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP16 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP16_frob(FP16 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP16 instance, on exit = w*x-conj(x)*y+z
+	@param w FP16 instance
+	@param x FP16 instance
+	@param y FP16 instance
+	@param z FP16 instance
+ */
+extern void FP16_xtr_A(FP16 *r, FP16 *w, FP16 *x, FP16 *y, FP16 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP16 instance, on exit = x^2-2*conj(x)
+	@param x FP16 instance
+ */
+extern void FP16_xtr_D(FP16 *r, FP16 *x);
+/**	@brief Calculates FP16 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP16 instance, on exit = trace(w^b)
+	@param x FP16 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP16_xtr_pow(FP16 *r, FP16 *x, B288_29::BIG b);
+/**	@brief Calculates FP16 trace of c^a.d^b, where c and d are derived from FP16 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP16 instance, on exit = trace(c^a.d^b)
+	@param c FP16 instance, trace of an FP12
+	@param d FP16 instance, trace of an FP12
+	@param e FP16 instance, trace of an FP12
+	@param f FP16 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP16_xtr_pow2(FP16 *r, FP16 *c, FP16 *d, FP16 *e, FP16 *f, B288_29::BIG a, B288_29::BIG b);
+
+/**	@brief Conditional copy of FP16 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP16 instance, set to y if s!=0
+	@param y another FP16 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP16_cmove(FP16 *x, FP16 *y, int s);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp16_BLS48556.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp16_BLS48556.h
new file mode 100644
index 0000000..11021cc
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp16_BLS48556.h
@@ -0,0 +1,308 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP16_BLS48556_H
+#define FP16_BLS48556_H
+
+#include "fp8_BLS48556.h"
+#include "config_curve_BLS48556.h"
+
+using namespace core;
+
+namespace BLS48556 {
+
+/**
+	@brief FP16 Structure - towered over two FP4
+*/
+
+typedef struct
+{
+    FP8 a; /**< real part of FP16 */
+    FP8 b; /**< imaginary part of FP16 */
+} FP16;
+
+
+/* FP16 prototypes */
+/**	@brief Tests for FP16 equal to zero
+ *
+	@param x FP16 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP16_iszilch(FP16 *x);
+/**	@brief Tests for FP16 equal to unity
+ *
+	@param x FP16 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP16_isunity(FP16 *x);
+/**	@brief Tests for equality of two FP16s
+ *
+	@param x FP16 instance to be compared
+	@param y FP16 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP16_equals(FP16 *x, FP16 *y);
+
+/**	@brief Serialize in FP16  
+ *
+    @param b buffer for output
+	@param x FP16 number to be serialized
+ */
+extern void FP16_toBytes(char *b,FP16 *x);
+/**	@brief Serialize out FP16  
+ *
+	@param x FP16 number to be serialized
+    @param b buffer for input
+ */
+extern void FP16_fromBytes(FP16 *x,char *b);
+
+/**	@brief Tests for FP16 having only a real part and no imaginary part
+ *
+	@param x FP16 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP16_isreal(FP16 *x);
+/**	@brief Initialise FP16 from two FP8s
+ *
+	@param x FP16 instance to be initialised
+	@param a FP8 to form real part of FP16
+	@param b FP8 to form imaginary part of FP16
+ */
+extern void FP16_from_FP8s(FP16 *x, FP8 *a, FP8 *b);
+/**	@brief Initialise FP16 from single FP8
+ *
+	Imaginary part is set to zero
+	@param x FP16 instance to be initialised
+	@param a FP8 to form real part of FP16
+ */
+extern void FP16_from_FP8(FP16 *x, FP8 *a);
+
+/**	@brief Initialise FP16 from single FP8
+ *
+	real part is set to zero
+	@param x FP16 instance to be initialised
+	@param a FP8 to form imaginary part of FP16
+ */
+extern void FP16_from_FP8H(FP16 *x, FP8 *a);
+
+
+/**	@brief Copy FP16 to another FP16
+ *
+	@param x FP16 instance, on exit = y
+	@param y FP16 instance to be copied
+ */
+extern void FP16_copy(FP16 *x, FP16 *y);
+/**	@brief Set FP16 to zero
+ *
+	@param x FP16 instance to be set to zero
+ */
+extern void FP16_zero(FP16 *x);
+/**	@brief Set FP16 to unity
+ *
+	@param x FP16 instance to be set to one
+ */
+extern void FP16_one(FP16 *x);
+/**	@brief Negation of FP16
+ *
+	@param x FP16 instance, on exit = -y
+	@param y FP16 instance
+ */
+extern void FP16_neg(FP16 *x, FP16 *y);
+/**	@brief Conjugation of FP16
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP16 instance, on exit = conj(y)
+	@param y FP16 instance
+ */
+extern void FP16_conj(FP16 *x, FP16 *y);
+/**	@brief Negative conjugation of FP16
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP16 instance, on exit = -conj(y)
+	@param y FP16 instance
+ */
+extern void FP16_nconj(FP16 *x, FP16 *y);
+/**	@brief addition of two FP16s
+ *
+	@param x FP16 instance, on exit = y+z
+	@param y FP16 instance
+	@param z FP16 instance
+ */
+extern void FP16_add(FP16 *x, FP16 *y, FP16 *z);
+/**	@brief subtraction of two FP16s
+ *
+	@param x FP16 instance, on exit = y-z
+	@param y FP16 instance
+	@param z FP16 instance
+ */
+extern void FP16_sub(FP16 *x, FP16 *y, FP16 *z);
+/**	@brief Multiplication of an FP16 by an FP8
+ *
+	@param x FP16 instance, on exit = y*a
+	@param y FP16 instance
+	@param a FP4 multiplier
+ */
+extern void FP16_pmul(FP16 *x, FP16 *y, FP8 *a);
+
+/**	@brief Multiplication of an FP16 by an FP2
+ *
+	@param x FP16 instance, on exit = y*a
+	@param y FP16 instance
+	@param a FP2 multiplier
+ */
+extern void FP16_qmul(FP16 *x, FP16 *y, FP2 *a);
+
+
+/**	@brief Multiplication of an FP16 by an FP
+ *
+	@param x FP16 instance, on exit = y*a
+	@param y FP16 instance
+	@param a FP multiplier
+ */
+extern void FP16_tmul(FP16 *x, FP16 *y, FP *a);
+
+
+
+/**	@brief Multiplication of an FP16 by a small integer
+ *
+	@param x FP16 instance, on exit = y*i
+	@param y FP16 instance
+	@param i an integer
+ */
+extern void FP16_imul(FP16 *x, FP16 *y, int i);
+/**	@brief Squaring an FP16
+ *
+	@param x FP16 instance, on exit = y^2
+	@param y FP16 instance
+ */
+extern void FP16_sqr(FP16 *x, FP16 *y);
+/**	@brief Multiplication of two FP16s
+ *
+	@param x FP16 instance, on exit = y*z
+	@param y FP16 instance
+	@param z FP16 instance
+ */
+extern void FP16_mul(FP16 *x, FP16 *y, FP16 *z);
+/**	@brief Inverting an FP16
+ *
+	@param x FP16 instance, on exit = 1/y
+	@param y FP16 instance
+ */
+extern void FP16_inv(FP16 *x, FP16 *y);
+/**	@brief Formats and outputs an FP16 to the console
+ *
+	@param x FP16 instance to be printed
+ */
+extern void FP16_output(FP16 *x);
+/**	@brief Formats and outputs an FP16 to the console in raw form (for debugging)
+ *
+	@param x FP16 instance to be printed
+ */
+extern void FP16_rawoutput(FP16 *x);
+/**	@brief multiplies an FP16 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP16 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP16_times_i(FP16 *x);
+/**	@brief multiplies an FP16 instance by irreducible polynomial (1+sqrt(-1))
+ *
+	@param x FP16 instance, on exit = sqrt(1+sqrt(-1))^2*x
+ */
+extern void FP16_times_i2(FP16 *x);
+
+/**	@brief multiplies an FP16 instance by irreducible polynomial (1+sqrt(-1))
+ *
+	@param x FP16 instance, on exit = sqrt(1+sqrt(-1))^4*x
+ */
+extern void FP16_times_i4(FP16 *x);
+
+
+/**	@brief Normalises the components of an FP16
+ *
+	@param x FP16 instance to be normalised
+ */
+extern void FP16_norm(FP16 *x);
+/**	@brief Reduces all components of possibly unreduced FP16 mod Modulus
+ *
+	@param x FP16 instance, on exit reduced mod Modulus
+ */
+extern void FP16_reduce(FP16 *x);
+/**	@brief Raises an FP16 to the power of a BIG
+ *
+	@param x FP16 instance, on exit = y^b
+	@param y FP16 instance
+	@param b BIG number
+ */
+extern void FP16_pow(FP16 *x, FP16 *y, B560_29::BIG b);
+/**	@brief Raises an FP16 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP16 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP16_frob(FP16 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP16 instance, on exit = w*x-conj(x)*y+z
+	@param w FP16 instance
+	@param x FP16 instance
+	@param y FP16 instance
+	@param z FP16 instance
+ */
+extern void FP16_xtr_A(FP16 *r, FP16 *w, FP16 *x, FP16 *y, FP16 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP16 instance, on exit = x^2-2*conj(x)
+	@param x FP16 instance
+ */
+extern void FP16_xtr_D(FP16 *r, FP16 *x);
+/**	@brief Calculates FP16 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP16 instance, on exit = trace(w^b)
+	@param x FP16 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP16_xtr_pow(FP16 *r, FP16 *x, B560_29::BIG b);
+/**	@brief Calculates FP16 trace of c^a.d^b, where c and d are derived from FP16 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP16 instance, on exit = trace(c^a.d^b)
+	@param c FP16 instance, trace of an FP12
+	@param d FP16 instance, trace of an FP12
+	@param e FP16 instance, trace of an FP12
+	@param f FP16 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP16_xtr_pow2(FP16 *r, FP16 *c, FP16 *d, FP16 *e, FP16 *f, B560_29::BIG a, B560_29::BIG b);
+
+/**	@brief Conditional copy of FP16 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP16 instance, set to y if s!=0
+	@param y another FP16 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP16_cmove(FP16 *x, FP16 *y, int s);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp16_BLS48581.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp16_BLS48581.h
new file mode 100644
index 0000000..a565bb9
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp16_BLS48581.h
@@ -0,0 +1,308 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP16_BLS48581_H
+#define FP16_BLS48581_H
+
+#include "fp8_BLS48581.h"
+#include "config_curve_BLS48581.h"
+
+using namespace core;
+
+namespace BLS48581 {
+
+/**
+	@brief FP16 Structure - towered over two FP4
+*/
+
+typedef struct
+{
+    FP8 a; /**< real part of FP16 */
+    FP8 b; /**< imaginary part of FP16 */
+} FP16;
+
+
+/* FP16 prototypes */
+/**	@brief Tests for FP16 equal to zero
+ *
+	@param x FP16 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP16_iszilch(FP16 *x);
+/**	@brief Tests for FP16 equal to unity
+ *
+	@param x FP16 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP16_isunity(FP16 *x);
+/**	@brief Tests for equality of two FP16s
+ *
+	@param x FP16 instance to be compared
+	@param y FP16 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP16_equals(FP16 *x, FP16 *y);
+
+/**	@brief Serialize in FP16  
+ *
+    @param b buffer for output
+	@param x FP16 number to be serialized
+ */
+extern void FP16_toBytes(char *b,FP16 *x);
+/**	@brief Serialize out FP16  
+ *
+	@param x FP16 number to be serialized
+    @param b buffer for input
+ */
+extern void FP16_fromBytes(FP16 *x,char *b);
+
+/**	@brief Tests for FP16 having only a real part and no imaginary part
+ *
+	@param x FP16 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP16_isreal(FP16 *x);
+/**	@brief Initialise FP16 from two FP8s
+ *
+	@param x FP16 instance to be initialised
+	@param a FP8 to form real part of FP16
+	@param b FP8 to form imaginary part of FP16
+ */
+extern void FP16_from_FP8s(FP16 *x, FP8 *a, FP8 *b);
+/**	@brief Initialise FP16 from single FP8
+ *
+	Imaginary part is set to zero
+	@param x FP16 instance to be initialised
+	@param a FP8 to form real part of FP16
+ */
+extern void FP16_from_FP8(FP16 *x, FP8 *a);
+
+/**	@brief Initialise FP16 from single FP8
+ *
+	real part is set to zero
+	@param x FP16 instance to be initialised
+	@param a FP8 to form imaginary part of FP16
+ */
+extern void FP16_from_FP8H(FP16 *x, FP8 *a);
+
+
+/**	@brief Copy FP16 to another FP16
+ *
+	@param x FP16 instance, on exit = y
+	@param y FP16 instance to be copied
+ */
+extern void FP16_copy(FP16 *x, FP16 *y);
+/**	@brief Set FP16 to zero
+ *
+	@param x FP16 instance to be set to zero
+ */
+extern void FP16_zero(FP16 *x);
+/**	@brief Set FP16 to unity
+ *
+	@param x FP16 instance to be set to one
+ */
+extern void FP16_one(FP16 *x);
+/**	@brief Negation of FP16
+ *
+	@param x FP16 instance, on exit = -y
+	@param y FP16 instance
+ */
+extern void FP16_neg(FP16 *x, FP16 *y);
+/**	@brief Conjugation of FP16
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP16 instance, on exit = conj(y)
+	@param y FP16 instance
+ */
+extern void FP16_conj(FP16 *x, FP16 *y);
+/**	@brief Negative conjugation of FP16
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP16 instance, on exit = -conj(y)
+	@param y FP16 instance
+ */
+extern void FP16_nconj(FP16 *x, FP16 *y);
+/**	@brief addition of two FP16s
+ *
+	@param x FP16 instance, on exit = y+z
+	@param y FP16 instance
+	@param z FP16 instance
+ */
+extern void FP16_add(FP16 *x, FP16 *y, FP16 *z);
+/**	@brief subtraction of two FP16s
+ *
+	@param x FP16 instance, on exit = y-z
+	@param y FP16 instance
+	@param z FP16 instance
+ */
+extern void FP16_sub(FP16 *x, FP16 *y, FP16 *z);
+/**	@brief Multiplication of an FP16 by an FP8
+ *
+	@param x FP16 instance, on exit = y*a
+	@param y FP16 instance
+	@param a FP4 multiplier
+ */
+extern void FP16_pmul(FP16 *x, FP16 *y, FP8 *a);
+
+/**	@brief Multiplication of an FP16 by an FP2
+ *
+	@param x FP16 instance, on exit = y*a
+	@param y FP16 instance
+	@param a FP2 multiplier
+ */
+extern void FP16_qmul(FP16 *x, FP16 *y, FP2 *a);
+
+
+/**	@brief Multiplication of an FP16 by an FP
+ *
+	@param x FP16 instance, on exit = y*a
+	@param y FP16 instance
+	@param a FP multiplier
+ */
+extern void FP16_tmul(FP16 *x, FP16 *y, FP *a);
+
+
+
+/**	@brief Multiplication of an FP16 by a small integer
+ *
+	@param x FP16 instance, on exit = y*i
+	@param y FP16 instance
+	@param i an integer
+ */
+extern void FP16_imul(FP16 *x, FP16 *y, int i);
+/**	@brief Squaring an FP16
+ *
+	@param x FP16 instance, on exit = y^2
+	@param y FP16 instance
+ */
+extern void FP16_sqr(FP16 *x, FP16 *y);
+/**	@brief Multiplication of two FP16s
+ *
+	@param x FP16 instance, on exit = y*z
+	@param y FP16 instance
+	@param z FP16 instance
+ */
+extern void FP16_mul(FP16 *x, FP16 *y, FP16 *z);
+/**	@brief Inverting an FP16
+ *
+	@param x FP16 instance, on exit = 1/y
+	@param y FP16 instance
+ */
+extern void FP16_inv(FP16 *x, FP16 *y);
+/**	@brief Formats and outputs an FP16 to the console
+ *
+	@param x FP16 instance to be printed
+ */
+extern void FP16_output(FP16 *x);
+/**	@brief Formats and outputs an FP16 to the console in raw form (for debugging)
+ *
+	@param x FP16 instance to be printed
+ */
+extern void FP16_rawoutput(FP16 *x);
+/**	@brief multiplies an FP16 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP16 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP16_times_i(FP16 *x);
+/**	@brief multiplies an FP16 instance by irreducible polynomial (1+sqrt(-1))
+ *
+	@param x FP16 instance, on exit = sqrt(1+sqrt(-1))^2*x
+ */
+extern void FP16_times_i2(FP16 *x);
+
+/**	@brief multiplies an FP16 instance by irreducible polynomial (1+sqrt(-1))
+ *
+	@param x FP16 instance, on exit = sqrt(1+sqrt(-1))^4*x
+ */
+extern void FP16_times_i4(FP16 *x);
+
+
+/**	@brief Normalises the components of an FP16
+ *
+	@param x FP16 instance to be normalised
+ */
+extern void FP16_norm(FP16 *x);
+/**	@brief Reduces all components of possibly unreduced FP16 mod Modulus
+ *
+	@param x FP16 instance, on exit reduced mod Modulus
+ */
+extern void FP16_reduce(FP16 *x);
+/**	@brief Raises an FP16 to the power of a BIG
+ *
+	@param x FP16 instance, on exit = y^b
+	@param y FP16 instance
+	@param b BIG number
+ */
+extern void FP16_pow(FP16 *x, FP16 *y, B584_29::BIG b);
+/**	@brief Raises an FP16 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP16 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP16_frob(FP16 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP16 instance, on exit = w*x-conj(x)*y+z
+	@param w FP16 instance
+	@param x FP16 instance
+	@param y FP16 instance
+	@param z FP16 instance
+ */
+extern void FP16_xtr_A(FP16 *r, FP16 *w, FP16 *x, FP16 *y, FP16 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP16 instance, on exit = x^2-2*conj(x)
+	@param x FP16 instance
+ */
+extern void FP16_xtr_D(FP16 *r, FP16 *x);
+/**	@brief Calculates FP16 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP16 instance, on exit = trace(w^b)
+	@param x FP16 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP16_xtr_pow(FP16 *r, FP16 *x, B584_29::BIG b);
+/**	@brief Calculates FP16 trace of c^a.d^b, where c and d are derived from FP16 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP16 instance, on exit = trace(c^a.d^b)
+	@param c FP16 instance, trace of an FP12
+	@param d FP16 instance, trace of an FP12
+	@param e FP16 instance, trace of an FP12
+	@param f FP16 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP16_xtr_pow2(FP16 *r, FP16 *c, FP16 *d, FP16 *e, FP16 *f, B584_29::BIG a, B584_29::BIG b);
+
+/**	@brief Conditional copy of FP16 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP16 instance, set to y if s!=0
+	@param y another FP16 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP16_cmove(FP16 *x, FP16 *y, int s);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp24_BLS24479.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp24_BLS24479.h
new file mode 100644
index 0000000..55771be
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp24_BLS24479.h
@@ -0,0 +1,236 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP24_BLS24479_H
+#define FP24_BLS24479_H
+
+#include "fp8_BLS24479.h"
+
+using namespace core;
+
+namespace BLS24479 {
+/**
+	@brief FP12 Structure - towered over three FP8
+*/
+
+
+typedef struct
+{
+    FP8 a; /**< first part of FP12 */
+    FP8 b; /**< second part of FP12 */
+    FP8 c; /**< third part of FP12 */
+    int type;
+} FP24;
+
+extern const B480_29::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B480_29::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+/* FP24 prototypes */
+/**	@brief Tests for FP24 equal to zero
+ *
+	@param x FP24 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP24_iszilch(FP24 *x);
+/**	@brief Tests for FP24 equal to unity
+ *
+	@param x FP24 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP24_isunity(FP24 *x);
+/**	@brief Copy FP24 to another FP24
+ *
+	@param x FP24 instance, on exit = y
+	@param y FP24 instance to be copied
+ */
+extern void FP24_copy(FP24 *x, FP24 *y);
+/**	@brief Set FP24 to unity
+ *
+	@param x FP24 instance to be set to one
+ */
+extern void FP24_one(FP24 *x);
+
+/**	@brief Set FP24 to zero
+ *
+	@param x FP24 instance to be set to zero
+ */
+extern void FP24_zero(FP24 *x);
+
+
+/**	@brief Tests for equality of two FP24s
+ *
+	@param x FP24 instance to be compared
+	@param y FP24 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP24_equals(FP24 *x, FP24 *y);
+/**	@brief Conjugation of FP24
+ *
+	If y=(a,b,c) (where a,b,c are its three FP8 components) on exit x=(conj(a),-conj(b),conj(c))
+	@param x FP24 instance, on exit = conj(y)
+	@param y FP24 instance
+ */
+extern void FP24_conj(FP24 *x, FP24 *y);
+/**	@brief Initialise FP24 from single FP8
+ *
+	Sets first FP8 component of an FP24, other components set to zero
+	@param x FP24 instance to be initialised
+	@param a FP8 to form first part of FP8
+ */
+extern void FP24_from_FP8(FP24 *x, FP8 *a);
+/**	@brief Initialise FP24 from three FP8s
+ *
+	@param x FP24 instance to be initialised
+	@param a FP8 to form first part of FP24
+	@param b FP8 to form second part of FP24
+	@param c FP8 to form third part of FP24
+ */
+extern void FP24_from_FP8s(FP24 *x, FP8 *a, FP8* b, FP8 *c);
+/**	@brief Fast Squaring of an FP24 in "unitary" form
+ *
+	@param x FP24 instance, on exit = y^2
+	@param y FP8 instance, must be unitary
+ */
+extern void FP24_usqr(FP24 *x, FP24 *y);
+/**	@brief Squaring an FP24
+ *
+	@param x FP24 instance, on exit = y^2
+	@param y FP24 instance
+ */
+extern void FP24_sqr(FP24 *x, FP24 *y);
+
+/**	@brief Fast multiplication of two sparse FP24s that arises from ATE pairing line functions
+ *
+	@param x FP24 instance, on exit = x*y
+	@param y FP24 instance, of special form
+ */
+extern void FP24_smul(FP24 *x, FP24 *y);
+
+/**	@brief Fast multiplication of what may be sparse multiplicands
+ *
+	@param x FP24 instance, on exit = x*y
+	@param y FP24 instance, of special form
+ */
+extern void FP24_ssmul(FP24 *x, FP24 *y);
+/**	@brief Full unconditional Multiplication of two FP24s
+ *
+	@param x FP24 instance, on exit = x*y
+	@param y FP24 instance, the multiplier
+ */
+extern void FP24_mul(FP24 *x, FP24 *y);
+
+/**	@brief Inverting an FP24
+ *
+	@param x FP24 instance, on exit = 1/y
+	@param y FP24 instance
+ */
+extern void FP24_inv(FP24 *x, FP24 *y);
+/**	@brief Raises an FP24 to the power of a BIG
+ *
+	@param r FP24 instance, on exit = y^b
+	@param x FP24 instance
+	@param b BIG number
+ */
+extern void FP24_pow(FP24 *r, FP24 *x, B480_29::BIG b);
+
+//extern void FP24_ppow(FP24 *r,FP24 *x,B480_29::BIG b);
+
+/**	@brief Raises an FP24 instance x to a small integer power, side-channel resistant
+ *
+	@param x FP24 instance, on exit = x^i
+	@param i small integer exponent
+	@param b maximum number of bits in exponent
+ */
+extern void FP24_pinpow(FP24 *x, int i, int b);
+
+/**	@brief Raises an FP24 instance x to a BIG power, compressed to FP8
+ *
+	@param c FP8 instance, on exit = x^(e mod r) as FP8
+	@param x FP24 input
+	@param e BIG exponent
+	@param r BIG group order
+ */
+extern void FP24_compow(FP8 *c, FP24 *x, B480_29::BIG e, B480_29::BIG r);
+
+/**	@brief Calculate Pi x[i]^b[i] for i=0 to 7, side-channel resistant
+ *
+	@param r FP24 instance, on exit = Pi x[i]^b[i] for i=0 to 7
+	@param x FP24 array with 4 FP24s
+	@param b BIG array of 4 exponents
+ */
+extern void FP24_pow8(FP24 *r, FP24 *x, B480_29::BIG *b);
+
+
+/**	@brief Raises an FP24 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP24 instance, on exit = x^p^n
+	@param f FP2 precalculated Frobenius constant
+	@param n power of p
+ */
+extern void FP24_frob(FP24 *x, FP2 *f, int n);
+
+/**	@brief Reduces all components of possibly unreduced FP24 mod Modulus
+ *
+	@param x FP24 instance, on exit reduced mod Modulus
+ */
+extern void FP24_reduce(FP24 *x);
+/**	@brief Normalises the components of an FP24
+ *
+	@param x FP24 instance to be normalised
+ */
+extern void FP24_norm(FP24 *x);
+/**	@brief Formats and outputs an FP24 to the console
+ *
+	@param x FP24 instance to be printed
+ */
+extern void FP24_output(FP24 *x);
+/**	@brief Formats and outputs an FP24 instance to an octet string
+ *
+	Serializes the components of an FP24 to big-endian base 256 form.
+	@param S output octet string
+	@param x FP24 instance to be converted to an octet string
+ */
+extern void FP24_toOctet(octet *S, FP24 *x);
+/**	@brief Creates an FP24 instance from an octet string
+ *
+	De-serializes the components of an FP24 to create an FP24 from big-endian base 256 components.
+	@param x FP24 instance to be created from an octet string
+	@param S input octet string
+
+ */
+extern void FP24_fromOctet(FP24 *x, octet *S);
+/**	@brief Calculate the trace of an FP24
+ *
+	@param t FP8 trace of x, on exit = tr(x)
+	@param x FP24 instance
+
+ */
+extern void FP24_trace(FP8 *t, FP24 *x);
+
+/**	@brief Conditional copy of FP24 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP24 instance, set to y if s!=0
+	@param y another FP24 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP24_cmove(FP24 *x, FP24 *y, int s);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp2_BLS12381.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp2_BLS12381.h
new file mode 100644
index 0000000..c6acb6f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp2_BLS12381.h
@@ -0,0 +1,306 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP2_BLS12381_H
+#define FP2_BLS12381_H
+
+#include "fp_BLS12381.h"
+
+using namespace core;
+
+namespace BLS12381 {
+
+/**
+	@brief FP2 Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    FP a; /**< real part of FP2 */
+    FP b; /**< imaginary part of FP2 */
+} FP2;
+
+/* FP2 prototypes */
+
+/**	@brief Tests for FP2 equal to zero
+ *
+	@param x FP2 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP2_iszilch(FP2 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP2 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP2_islarger(FP2 *x);
+
+
+/**	@brief Serialize out FP2  
+ *
+    @param b buffer for output
+	@param x FP2 number to be serialized
+ */
+extern void FP2_toBytes(char *b,FP2 *x);
+
+/**	@brief Serialize in FP2  
+ *
+	@param x FP2 number to be serialized
+    @param b buffer for input
+ */
+extern void FP2_fromBytes(FP2 *x,char *b);
+
+/**	@brief Conditional copy of FP2 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP2 instance, set to y if s!=0
+	@param y another FP2 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP2_cmove(FP2 *x, FP2 *y, int s);
+/**	@brief Tests for FP2 equal to one
+ *
+	@param x FP2 instance to be tested
+	@return 1 if x=1, else returns 0
+ */
+extern int FP2_isunity(FP2 *x);
+/**	@brief Tests for equality of two FP2s
+ *
+	@param x FP2 instance to be compared
+	@param y FP2 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP2_equals(FP2 *x, FP2 *y);
+/**	@brief Initialise FP2 from two FP numbers
+ *
+	@param x FP2 instance to be initialised
+	@param a FP to form real part of FP2
+	@param b FP to form imaginary part of FP2
+ */
+extern void FP2_from_FPs(FP2 *x, FP *a, FP *b);
+/**	@brief Initialise FP2 from two BIG integers
+ *
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+	@param b BIG to form imaginary part of FP2
+ */
+extern void FP2_from_BIGs(FP2 *x, B384_29::BIG a, B384_29::BIG b);
+
+
+/**	@brief Initialise FP2 from two integers
+ *
+	@param x FP2 instance to be initialised
+	@param a int to form real part of FP2
+	@param b int to form imaginary part of FP2
+ */
+extern void FP2_from_ints(FP2 *x, int a, int b);
+
+
+
+/**	@brief Initialise FP2 from single FP
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param an FP to form real part of FP2
+ */
+extern void FP2_from_FP(FP2 *x, FP *a);
+/**	@brief Initialise FP2 from single BIG
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+ */
+extern void FP2_from_BIG(FP2 *x, B384_29::BIG a);
+/**	@brief Copy FP2 to another FP2
+ *
+	@param x FP2 instance, on exit = y
+	@param y FP2 instance to be copied
+ */
+extern void FP2_copy(FP2 *x, FP2 *y);
+/**	@brief Set FP2 to zero
+ *
+	@param x FP2 instance to be set to zero
+ */
+extern void FP2_zero(FP2 *x);
+/**	@brief Set FP2 to unity
+ *
+	@param x FP2 instance to be set to one
+ */
+extern void FP2_one(FP2 *x);
+
+/**	@brief Copy from ROM to an FP2
+ *
+	@param w FP2 number to be copied to
+	@param a BIG real part to be copied from ROM
+	@param b BIG imag part to be copied from ROM
+ */
+extern void FP2_rcopy(FP2 *w,const B384_29::BIG a,const B384_29::BIG b);
+
+/**	@brief Sign of FP2
+ *
+	@param x FP2 instance
+	@return "sign" of FP2
+ */
+extern int FP2_sign(FP2 *x);
+
+/**	@brief Negation of FP2
+ *
+	@param x FP2 instance, on exit = -y
+	@param y FP2 instance
+ */
+extern void FP2_neg(FP2 *x, FP2 *y);
+
+
+/**	@brief Conjugation of FP2
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP2 instance, on exit = conj(y)
+	@param y FP2 instance
+ */
+extern void FP2_conj(FP2 *x, FP2 *y);
+/**	@brief addition of two FP2s
+ *
+	@param x FP2 instance, on exit = y+z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_add(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief subtraction of two FP2s
+ *
+	@param x FP2 instance, on exit = y-z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_sub(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Multiplication of an FP2 by an FP
+ *
+	@param x FP2 instance, on exit = y*b
+	@param y FP2 instance
+	@param b FP residue
+ */
+extern void FP2_pmul(FP2 *x, FP2 *y, FP *b);
+/**	@brief Multiplication of an FP2 by a small integer
+ *
+	@param x FP2 instance, on exit = y*i
+	@param y FP2 instance
+	@param i an integer
+ */
+extern void FP2_imul(FP2 *x, FP2 *y, int i);
+/**	@brief Squaring an FP2
+ *
+	@param x FP2 instance, on exit = y^2
+	@param y FP2 instance
+ */
+extern void FP2_sqr(FP2 *x, FP2 *y);
+/**	@brief Multiplication of two FP2s
+ *
+	@param x FP2 instance, on exit = y*z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_mul(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Formats and outputs an FP2 to the console
+ *
+	@param x FP2 instance
+ */
+extern void FP2_output(FP2 *x);
+/**	@brief Formats and outputs an FP2 to the console in raw form (for debugging)
+ *
+	@param x FP2 instance
+ */
+extern void FP2_rawoutput(FP2 *x);
+/**	@brief Inverting an FP2
+ *
+	@param x FP2 instance, on exit = 1/y
+	@param y FP2 instance
+ */
+extern void FP2_inv(FP2 *x, FP2 *y, FP *h);
+/**	@brief Divide an FP2 by 2
+ *
+	@param x FP2 instance, on exit = y/2
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_div2(FP2 *x, FP2 *y);
+/**	@brief Multiply an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x*(1+sqrt(-1))
+ */
+extern void FP2_mul_ip(FP2 *x);
+
+/**	@brief Divide an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x/(1+sqrt(-1))
+ */
+extern void FP2_div_ip(FP2 *x);
+/**	@brief Normalises the components of an FP2
+ *
+	@param x FP2 instance to be normalised
+ */
+extern void FP2_norm(FP2 *x);
+/**	@brief Reduces all components of possibly unreduced FP2 mod Modulus
+ *
+	@param x FP2 instance, on exit reduced mod Modulus
+ */
+extern void FP2_reduce(FP2 *x);
+/**	@brief Raises an FP2 to the power of a BIG
+ *
+	@param x FP2 instance, on exit = y^b
+	@param y FP2 instance
+	@param b BIG number
+ */
+extern void FP2_pow(FP2 *x, FP2 *y, B384_29::BIG b);
+
+/**	@brief Test FP2 for QR
+ *
+	@param x FP2 instance
+    @param h optional generated hint
+	@return true or false
+ */
+extern int FP2_qr(FP2 *x,FP *h);
+
+
+/**	@brief Square root of an FP2
+ *
+	@param x FP2 instance, on exit = sqrt(y)
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_sqrt(FP2 *x, FP2 *y, FP *h);
+
+/**	@brief Multiply an FP2 by sqrt(-1)
+ *
+	Note that -1 is QNR
+	@param x FP2 instance, on exit = x*sqrt(-1)
+ */
+extern void FP2_times_i(FP2 *x);
+
+/**	@brief Generate random FP2
+ *
+	@param x random FP2 number
+	@param rng random number generator
+ */
+extern void FP2_rand(FP2 *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp2_BLS12383.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp2_BLS12383.h
new file mode 100644
index 0000000..8a911f7
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp2_BLS12383.h
@@ -0,0 +1,306 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP2_BLS12383_H
+#define FP2_BLS12383_H
+
+#include "fp_BLS12383.h"
+
+using namespace core;
+
+namespace BLS12383 {
+
+/**
+	@brief FP2 Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    FP a; /**< real part of FP2 */
+    FP b; /**< imaginary part of FP2 */
+} FP2;
+
+/* FP2 prototypes */
+
+/**	@brief Tests for FP2 equal to zero
+ *
+	@param x FP2 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP2_iszilch(FP2 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP2 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP2_islarger(FP2 *x);
+
+
+/**	@brief Serialize out FP2  
+ *
+    @param b buffer for output
+	@param x FP2 number to be serialized
+ */
+extern void FP2_toBytes(char *b,FP2 *x);
+
+/**	@brief Serialize in FP2  
+ *
+	@param x FP2 number to be serialized
+    @param b buffer for input
+ */
+extern void FP2_fromBytes(FP2 *x,char *b);
+
+/**	@brief Conditional copy of FP2 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP2 instance, set to y if s!=0
+	@param y another FP2 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP2_cmove(FP2 *x, FP2 *y, int s);
+/**	@brief Tests for FP2 equal to one
+ *
+	@param x FP2 instance to be tested
+	@return 1 if x=1, else returns 0
+ */
+extern int FP2_isunity(FP2 *x);
+/**	@brief Tests for equality of two FP2s
+ *
+	@param x FP2 instance to be compared
+	@param y FP2 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP2_equals(FP2 *x, FP2 *y);
+/**	@brief Initialise FP2 from two FP numbers
+ *
+	@param x FP2 instance to be initialised
+	@param a FP to form real part of FP2
+	@param b FP to form imaginary part of FP2
+ */
+extern void FP2_from_FPs(FP2 *x, FP *a, FP *b);
+/**	@brief Initialise FP2 from two BIG integers
+ *
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+	@param b BIG to form imaginary part of FP2
+ */
+extern void FP2_from_BIGs(FP2 *x, B384_29::BIG a, B384_29::BIG b);
+
+
+/**	@brief Initialise FP2 from two integers
+ *
+	@param x FP2 instance to be initialised
+	@param a int to form real part of FP2
+	@param b int to form imaginary part of FP2
+ */
+extern void FP2_from_ints(FP2 *x, int a, int b);
+
+
+
+/**	@brief Initialise FP2 from single FP
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param an FP to form real part of FP2
+ */
+extern void FP2_from_FP(FP2 *x, FP *a);
+/**	@brief Initialise FP2 from single BIG
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+ */
+extern void FP2_from_BIG(FP2 *x, B384_29::BIG a);
+/**	@brief Copy FP2 to another FP2
+ *
+	@param x FP2 instance, on exit = y
+	@param y FP2 instance to be copied
+ */
+extern void FP2_copy(FP2 *x, FP2 *y);
+/**	@brief Set FP2 to zero
+ *
+	@param x FP2 instance to be set to zero
+ */
+extern void FP2_zero(FP2 *x);
+/**	@brief Set FP2 to unity
+ *
+	@param x FP2 instance to be set to one
+ */
+extern void FP2_one(FP2 *x);
+
+/**	@brief Copy from ROM to an FP2
+ *
+	@param w FP2 number to be copied to
+	@param a BIG real part to be copied from ROM
+	@param b BIG imag part to be copied from ROM
+ */
+extern void FP2_rcopy(FP2 *w,const B384_29::BIG a,const B384_29::BIG b);
+
+/**	@brief Sign of FP2
+ *
+	@param x FP2 instance
+	@return "sign" of FP2
+ */
+extern int FP2_sign(FP2 *x);
+
+/**	@brief Negation of FP2
+ *
+	@param x FP2 instance, on exit = -y
+	@param y FP2 instance
+ */
+extern void FP2_neg(FP2 *x, FP2 *y);
+
+
+/**	@brief Conjugation of FP2
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP2 instance, on exit = conj(y)
+	@param y FP2 instance
+ */
+extern void FP2_conj(FP2 *x, FP2 *y);
+/**	@brief addition of two FP2s
+ *
+	@param x FP2 instance, on exit = y+z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_add(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief subtraction of two FP2s
+ *
+	@param x FP2 instance, on exit = y-z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_sub(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Multiplication of an FP2 by an FP
+ *
+	@param x FP2 instance, on exit = y*b
+	@param y FP2 instance
+	@param b FP residue
+ */
+extern void FP2_pmul(FP2 *x, FP2 *y, FP *b);
+/**	@brief Multiplication of an FP2 by a small integer
+ *
+	@param x FP2 instance, on exit = y*i
+	@param y FP2 instance
+	@param i an integer
+ */
+extern void FP2_imul(FP2 *x, FP2 *y, int i);
+/**	@brief Squaring an FP2
+ *
+	@param x FP2 instance, on exit = y^2
+	@param y FP2 instance
+ */
+extern void FP2_sqr(FP2 *x, FP2 *y);
+/**	@brief Multiplication of two FP2s
+ *
+	@param x FP2 instance, on exit = y*z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_mul(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Formats and outputs an FP2 to the console
+ *
+	@param x FP2 instance
+ */
+extern void FP2_output(FP2 *x);
+/**	@brief Formats and outputs an FP2 to the console in raw form (for debugging)
+ *
+	@param x FP2 instance
+ */
+extern void FP2_rawoutput(FP2 *x);
+/**	@brief Inverting an FP2
+ *
+	@param x FP2 instance, on exit = 1/y
+	@param y FP2 instance
+ */
+extern void FP2_inv(FP2 *x, FP2 *y, FP *h);
+/**	@brief Divide an FP2 by 2
+ *
+	@param x FP2 instance, on exit = y/2
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_div2(FP2 *x, FP2 *y);
+/**	@brief Multiply an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x*(1+sqrt(-1))
+ */
+extern void FP2_mul_ip(FP2 *x);
+
+/**	@brief Divide an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x/(1+sqrt(-1))
+ */
+extern void FP2_div_ip(FP2 *x);
+/**	@brief Normalises the components of an FP2
+ *
+	@param x FP2 instance to be normalised
+ */
+extern void FP2_norm(FP2 *x);
+/**	@brief Reduces all components of possibly unreduced FP2 mod Modulus
+ *
+	@param x FP2 instance, on exit reduced mod Modulus
+ */
+extern void FP2_reduce(FP2 *x);
+/**	@brief Raises an FP2 to the power of a BIG
+ *
+	@param x FP2 instance, on exit = y^b
+	@param y FP2 instance
+	@param b BIG number
+ */
+extern void FP2_pow(FP2 *x, FP2 *y, B384_29::BIG b);
+
+/**	@brief Test FP2 for QR
+ *
+	@param x FP2 instance
+    @param h optional generated hint
+	@return true or false
+ */
+extern int FP2_qr(FP2 *x,FP *h);
+
+
+/**	@brief Square root of an FP2
+ *
+	@param x FP2 instance, on exit = sqrt(y)
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_sqrt(FP2 *x, FP2 *y, FP *h);
+
+/**	@brief Multiply an FP2 by sqrt(-1)
+ *
+	Note that -1 is QNR
+	@param x FP2 instance, on exit = x*sqrt(-1)
+ */
+extern void FP2_times_i(FP2 *x);
+
+/**	@brief Generate random FP2
+ *
+	@param x random FP2 number
+	@param rng random number generator
+ */
+extern void FP2_rand(FP2 *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp2_BLS12443.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp2_BLS12443.h
new file mode 100644
index 0000000..5997238
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp2_BLS12443.h
@@ -0,0 +1,306 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP2_BLS12443_H
+#define FP2_BLS12443_H
+
+#include "fp_BLS12443.h"
+
+using namespace core;
+
+namespace BLS12443 {
+
+/**
+	@brief FP2 Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    FP a; /**< real part of FP2 */
+    FP b; /**< imaginary part of FP2 */
+} FP2;
+
+/* FP2 prototypes */
+
+/**	@brief Tests for FP2 equal to zero
+ *
+	@param x FP2 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP2_iszilch(FP2 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP2 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP2_islarger(FP2 *x);
+
+
+/**	@brief Serialize out FP2  
+ *
+    @param b buffer for output
+	@param x FP2 number to be serialized
+ */
+extern void FP2_toBytes(char *b,FP2 *x);
+
+/**	@brief Serialize in FP2  
+ *
+	@param x FP2 number to be serialized
+    @param b buffer for input
+ */
+extern void FP2_fromBytes(FP2 *x,char *b);
+
+/**	@brief Conditional copy of FP2 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP2 instance, set to y if s!=0
+	@param y another FP2 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP2_cmove(FP2 *x, FP2 *y, int s);
+/**	@brief Tests for FP2 equal to one
+ *
+	@param x FP2 instance to be tested
+	@return 1 if x=1, else returns 0
+ */
+extern int FP2_isunity(FP2 *x);
+/**	@brief Tests for equality of two FP2s
+ *
+	@param x FP2 instance to be compared
+	@param y FP2 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP2_equals(FP2 *x, FP2 *y);
+/**	@brief Initialise FP2 from two FP numbers
+ *
+	@param x FP2 instance to be initialised
+	@param a FP to form real part of FP2
+	@param b FP to form imaginary part of FP2
+ */
+extern void FP2_from_FPs(FP2 *x, FP *a, FP *b);
+/**	@brief Initialise FP2 from two BIG integers
+ *
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+	@param b BIG to form imaginary part of FP2
+ */
+extern void FP2_from_BIGs(FP2 *x, B448_29::BIG a, B448_29::BIG b);
+
+
+/**	@brief Initialise FP2 from two integers
+ *
+	@param x FP2 instance to be initialised
+	@param a int to form real part of FP2
+	@param b int to form imaginary part of FP2
+ */
+extern void FP2_from_ints(FP2 *x, int a, int b);
+
+
+
+/**	@brief Initialise FP2 from single FP
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param an FP to form real part of FP2
+ */
+extern void FP2_from_FP(FP2 *x, FP *a);
+/**	@brief Initialise FP2 from single BIG
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+ */
+extern void FP2_from_BIG(FP2 *x, B448_29::BIG a);
+/**	@brief Copy FP2 to another FP2
+ *
+	@param x FP2 instance, on exit = y
+	@param y FP2 instance to be copied
+ */
+extern void FP2_copy(FP2 *x, FP2 *y);
+/**	@brief Set FP2 to zero
+ *
+	@param x FP2 instance to be set to zero
+ */
+extern void FP2_zero(FP2 *x);
+/**	@brief Set FP2 to unity
+ *
+	@param x FP2 instance to be set to one
+ */
+extern void FP2_one(FP2 *x);
+
+/**	@brief Copy from ROM to an FP2
+ *
+	@param w FP2 number to be copied to
+	@param a BIG real part to be copied from ROM
+	@param b BIG imag part to be copied from ROM
+ */
+extern void FP2_rcopy(FP2 *w,const B448_29::BIG a,const B448_29::BIG b);
+
+/**	@brief Sign of FP2
+ *
+	@param x FP2 instance
+	@return "sign" of FP2
+ */
+extern int FP2_sign(FP2 *x);
+
+/**	@brief Negation of FP2
+ *
+	@param x FP2 instance, on exit = -y
+	@param y FP2 instance
+ */
+extern void FP2_neg(FP2 *x, FP2 *y);
+
+
+/**	@brief Conjugation of FP2
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP2 instance, on exit = conj(y)
+	@param y FP2 instance
+ */
+extern void FP2_conj(FP2 *x, FP2 *y);
+/**	@brief addition of two FP2s
+ *
+	@param x FP2 instance, on exit = y+z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_add(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief subtraction of two FP2s
+ *
+	@param x FP2 instance, on exit = y-z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_sub(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Multiplication of an FP2 by an FP
+ *
+	@param x FP2 instance, on exit = y*b
+	@param y FP2 instance
+	@param b FP residue
+ */
+extern void FP2_pmul(FP2 *x, FP2 *y, FP *b);
+/**	@brief Multiplication of an FP2 by a small integer
+ *
+	@param x FP2 instance, on exit = y*i
+	@param y FP2 instance
+	@param i an integer
+ */
+extern void FP2_imul(FP2 *x, FP2 *y, int i);
+/**	@brief Squaring an FP2
+ *
+	@param x FP2 instance, on exit = y^2
+	@param y FP2 instance
+ */
+extern void FP2_sqr(FP2 *x, FP2 *y);
+/**	@brief Multiplication of two FP2s
+ *
+	@param x FP2 instance, on exit = y*z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_mul(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Formats and outputs an FP2 to the console
+ *
+	@param x FP2 instance
+ */
+extern void FP2_output(FP2 *x);
+/**	@brief Formats and outputs an FP2 to the console in raw form (for debugging)
+ *
+	@param x FP2 instance
+ */
+extern void FP2_rawoutput(FP2 *x);
+/**	@brief Inverting an FP2
+ *
+	@param x FP2 instance, on exit = 1/y
+	@param y FP2 instance
+ */
+extern void FP2_inv(FP2 *x, FP2 *y, FP *h);
+/**	@brief Divide an FP2 by 2
+ *
+	@param x FP2 instance, on exit = y/2
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_div2(FP2 *x, FP2 *y);
+/**	@brief Multiply an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x*(1+sqrt(-1))
+ */
+extern void FP2_mul_ip(FP2 *x);
+
+/**	@brief Divide an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x/(1+sqrt(-1))
+ */
+extern void FP2_div_ip(FP2 *x);
+/**	@brief Normalises the components of an FP2
+ *
+	@param x FP2 instance to be normalised
+ */
+extern void FP2_norm(FP2 *x);
+/**	@brief Reduces all components of possibly unreduced FP2 mod Modulus
+ *
+	@param x FP2 instance, on exit reduced mod Modulus
+ */
+extern void FP2_reduce(FP2 *x);
+/**	@brief Raises an FP2 to the power of a BIG
+ *
+	@param x FP2 instance, on exit = y^b
+	@param y FP2 instance
+	@param b BIG number
+ */
+extern void FP2_pow(FP2 *x, FP2 *y, B448_29::BIG b);
+
+/**	@brief Test FP2 for QR
+ *
+	@param x FP2 instance
+    @param h optional generated hint
+	@return true or false
+ */
+extern int FP2_qr(FP2 *x,FP *h);
+
+
+/**	@brief Square root of an FP2
+ *
+	@param x FP2 instance, on exit = sqrt(y)
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_sqrt(FP2 *x, FP2 *y, FP *h);
+
+/**	@brief Multiply an FP2 by sqrt(-1)
+ *
+	Note that -1 is QNR
+	@param x FP2 instance, on exit = x*sqrt(-1)
+ */
+extern void FP2_times_i(FP2 *x);
+
+/**	@brief Generate random FP2
+ *
+	@param x random FP2 number
+	@param rng random number generator
+ */
+extern void FP2_rand(FP2 *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp2_BLS12461.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp2_BLS12461.h
new file mode 100644
index 0000000..94e9a98
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp2_BLS12461.h
@@ -0,0 +1,306 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP2_BLS12461_H
+#define FP2_BLS12461_H
+
+#include "fp_BLS12461.h"
+
+using namespace core;
+
+namespace BLS12461 {
+
+/**
+	@brief FP2 Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    FP a; /**< real part of FP2 */
+    FP b; /**< imaginary part of FP2 */
+} FP2;
+
+/* FP2 prototypes */
+
+/**	@brief Tests for FP2 equal to zero
+ *
+	@param x FP2 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP2_iszilch(FP2 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP2 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP2_islarger(FP2 *x);
+
+
+/**	@brief Serialize out FP2  
+ *
+    @param b buffer for output
+	@param x FP2 number to be serialized
+ */
+extern void FP2_toBytes(char *b,FP2 *x);
+
+/**	@brief Serialize in FP2  
+ *
+	@param x FP2 number to be serialized
+    @param b buffer for input
+ */
+extern void FP2_fromBytes(FP2 *x,char *b);
+
+/**	@brief Conditional copy of FP2 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP2 instance, set to y if s!=0
+	@param y another FP2 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP2_cmove(FP2 *x, FP2 *y, int s);
+/**	@brief Tests for FP2 equal to one
+ *
+	@param x FP2 instance to be tested
+	@return 1 if x=1, else returns 0
+ */
+extern int FP2_isunity(FP2 *x);
+/**	@brief Tests for equality of two FP2s
+ *
+	@param x FP2 instance to be compared
+	@param y FP2 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP2_equals(FP2 *x, FP2 *y);
+/**	@brief Initialise FP2 from two FP numbers
+ *
+	@param x FP2 instance to be initialised
+	@param a FP to form real part of FP2
+	@param b FP to form imaginary part of FP2
+ */
+extern void FP2_from_FPs(FP2 *x, FP *a, FP *b);
+/**	@brief Initialise FP2 from two BIG integers
+ *
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+	@param b BIG to form imaginary part of FP2
+ */
+extern void FP2_from_BIGs(FP2 *x, B464_28::BIG a, B464_28::BIG b);
+
+
+/**	@brief Initialise FP2 from two integers
+ *
+	@param x FP2 instance to be initialised
+	@param a int to form real part of FP2
+	@param b int to form imaginary part of FP2
+ */
+extern void FP2_from_ints(FP2 *x, int a, int b);
+
+
+
+/**	@brief Initialise FP2 from single FP
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param an FP to form real part of FP2
+ */
+extern void FP2_from_FP(FP2 *x, FP *a);
+/**	@brief Initialise FP2 from single BIG
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+ */
+extern void FP2_from_BIG(FP2 *x, B464_28::BIG a);
+/**	@brief Copy FP2 to another FP2
+ *
+	@param x FP2 instance, on exit = y
+	@param y FP2 instance to be copied
+ */
+extern void FP2_copy(FP2 *x, FP2 *y);
+/**	@brief Set FP2 to zero
+ *
+	@param x FP2 instance to be set to zero
+ */
+extern void FP2_zero(FP2 *x);
+/**	@brief Set FP2 to unity
+ *
+	@param x FP2 instance to be set to one
+ */
+extern void FP2_one(FP2 *x);
+
+/**	@brief Copy from ROM to an FP2
+ *
+	@param w FP2 number to be copied to
+	@param a BIG real part to be copied from ROM
+	@param b BIG imag part to be copied from ROM
+ */
+extern void FP2_rcopy(FP2 *w,const B464_28::BIG a,const B464_28::BIG b);
+
+/**	@brief Sign of FP2
+ *
+	@param x FP2 instance
+	@return "sign" of FP2
+ */
+extern int FP2_sign(FP2 *x);
+
+/**	@brief Negation of FP2
+ *
+	@param x FP2 instance, on exit = -y
+	@param y FP2 instance
+ */
+extern void FP2_neg(FP2 *x, FP2 *y);
+
+
+/**	@brief Conjugation of FP2
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP2 instance, on exit = conj(y)
+	@param y FP2 instance
+ */
+extern void FP2_conj(FP2 *x, FP2 *y);
+/**	@brief addition of two FP2s
+ *
+	@param x FP2 instance, on exit = y+z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_add(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief subtraction of two FP2s
+ *
+	@param x FP2 instance, on exit = y-z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_sub(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Multiplication of an FP2 by an FP
+ *
+	@param x FP2 instance, on exit = y*b
+	@param y FP2 instance
+	@param b FP residue
+ */
+extern void FP2_pmul(FP2 *x, FP2 *y, FP *b);
+/**	@brief Multiplication of an FP2 by a small integer
+ *
+	@param x FP2 instance, on exit = y*i
+	@param y FP2 instance
+	@param i an integer
+ */
+extern void FP2_imul(FP2 *x, FP2 *y, int i);
+/**	@brief Squaring an FP2
+ *
+	@param x FP2 instance, on exit = y^2
+	@param y FP2 instance
+ */
+extern void FP2_sqr(FP2 *x, FP2 *y);
+/**	@brief Multiplication of two FP2s
+ *
+	@param x FP2 instance, on exit = y*z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_mul(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Formats and outputs an FP2 to the console
+ *
+	@param x FP2 instance
+ */
+extern void FP2_output(FP2 *x);
+/**	@brief Formats and outputs an FP2 to the console in raw form (for debugging)
+ *
+	@param x FP2 instance
+ */
+extern void FP2_rawoutput(FP2 *x);
+/**	@brief Inverting an FP2
+ *
+	@param x FP2 instance, on exit = 1/y
+	@param y FP2 instance
+ */
+extern void FP2_inv(FP2 *x, FP2 *y, FP *h);
+/**	@brief Divide an FP2 by 2
+ *
+	@param x FP2 instance, on exit = y/2
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_div2(FP2 *x, FP2 *y);
+/**	@brief Multiply an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x*(1+sqrt(-1))
+ */
+extern void FP2_mul_ip(FP2 *x);
+
+/**	@brief Divide an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x/(1+sqrt(-1))
+ */
+extern void FP2_div_ip(FP2 *x);
+/**	@brief Normalises the components of an FP2
+ *
+	@param x FP2 instance to be normalised
+ */
+extern void FP2_norm(FP2 *x);
+/**	@brief Reduces all components of possibly unreduced FP2 mod Modulus
+ *
+	@param x FP2 instance, on exit reduced mod Modulus
+ */
+extern void FP2_reduce(FP2 *x);
+/**	@brief Raises an FP2 to the power of a BIG
+ *
+	@param x FP2 instance, on exit = y^b
+	@param y FP2 instance
+	@param b BIG number
+ */
+extern void FP2_pow(FP2 *x, FP2 *y, B464_28::BIG b);
+
+/**	@brief Test FP2 for QR
+ *
+	@param x FP2 instance
+    @param h optional generated hint
+	@return true or false
+ */
+extern int FP2_qr(FP2 *x,FP *h);
+
+
+/**	@brief Square root of an FP2
+ *
+	@param x FP2 instance, on exit = sqrt(y)
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_sqrt(FP2 *x, FP2 *y, FP *h);
+
+/**	@brief Multiply an FP2 by sqrt(-1)
+ *
+	Note that -1 is QNR
+	@param x FP2 instance, on exit = x*sqrt(-1)
+ */
+extern void FP2_times_i(FP2 *x);
+
+/**	@brief Generate random FP2
+ *
+	@param x random FP2 number
+	@param rng random number generator
+ */
+extern void FP2_rand(FP2 *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp2_BLS24479.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp2_BLS24479.h
new file mode 100644
index 0000000..2f01687
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp2_BLS24479.h
@@ -0,0 +1,306 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP2_BLS24479_H
+#define FP2_BLS24479_H
+
+#include "fp_BLS24479.h"
+
+using namespace core;
+
+namespace BLS24479 {
+
+/**
+	@brief FP2 Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    FP a; /**< real part of FP2 */
+    FP b; /**< imaginary part of FP2 */
+} FP2;
+
+/* FP2 prototypes */
+
+/**	@brief Tests for FP2 equal to zero
+ *
+	@param x FP2 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP2_iszilch(FP2 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP2 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP2_islarger(FP2 *x);
+
+
+/**	@brief Serialize out FP2  
+ *
+    @param b buffer for output
+	@param x FP2 number to be serialized
+ */
+extern void FP2_toBytes(char *b,FP2 *x);
+
+/**	@brief Serialize in FP2  
+ *
+	@param x FP2 number to be serialized
+    @param b buffer for input
+ */
+extern void FP2_fromBytes(FP2 *x,char *b);
+
+/**	@brief Conditional copy of FP2 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP2 instance, set to y if s!=0
+	@param y another FP2 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP2_cmove(FP2 *x, FP2 *y, int s);
+/**	@brief Tests for FP2 equal to one
+ *
+	@param x FP2 instance to be tested
+	@return 1 if x=1, else returns 0
+ */
+extern int FP2_isunity(FP2 *x);
+/**	@brief Tests for equality of two FP2s
+ *
+	@param x FP2 instance to be compared
+	@param y FP2 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP2_equals(FP2 *x, FP2 *y);
+/**	@brief Initialise FP2 from two FP numbers
+ *
+	@param x FP2 instance to be initialised
+	@param a FP to form real part of FP2
+	@param b FP to form imaginary part of FP2
+ */
+extern void FP2_from_FPs(FP2 *x, FP *a, FP *b);
+/**	@brief Initialise FP2 from two BIG integers
+ *
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+	@param b BIG to form imaginary part of FP2
+ */
+extern void FP2_from_BIGs(FP2 *x, B480_29::BIG a, B480_29::BIG b);
+
+
+/**	@brief Initialise FP2 from two integers
+ *
+	@param x FP2 instance to be initialised
+	@param a int to form real part of FP2
+	@param b int to form imaginary part of FP2
+ */
+extern void FP2_from_ints(FP2 *x, int a, int b);
+
+
+
+/**	@brief Initialise FP2 from single FP
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param an FP to form real part of FP2
+ */
+extern void FP2_from_FP(FP2 *x, FP *a);
+/**	@brief Initialise FP2 from single BIG
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+ */
+extern void FP2_from_BIG(FP2 *x, B480_29::BIG a);
+/**	@brief Copy FP2 to another FP2
+ *
+	@param x FP2 instance, on exit = y
+	@param y FP2 instance to be copied
+ */
+extern void FP2_copy(FP2 *x, FP2 *y);
+/**	@brief Set FP2 to zero
+ *
+	@param x FP2 instance to be set to zero
+ */
+extern void FP2_zero(FP2 *x);
+/**	@brief Set FP2 to unity
+ *
+	@param x FP2 instance to be set to one
+ */
+extern void FP2_one(FP2 *x);
+
+/**	@brief Copy from ROM to an FP2
+ *
+	@param w FP2 number to be copied to
+	@param a BIG real part to be copied from ROM
+	@param b BIG imag part to be copied from ROM
+ */
+extern void FP2_rcopy(FP2 *w,const B480_29::BIG a,const B480_29::BIG b);
+
+/**	@brief Sign of FP2
+ *
+	@param x FP2 instance
+	@return "sign" of FP2
+ */
+extern int FP2_sign(FP2 *x);
+
+/**	@brief Negation of FP2
+ *
+	@param x FP2 instance, on exit = -y
+	@param y FP2 instance
+ */
+extern void FP2_neg(FP2 *x, FP2 *y);
+
+
+/**	@brief Conjugation of FP2
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP2 instance, on exit = conj(y)
+	@param y FP2 instance
+ */
+extern void FP2_conj(FP2 *x, FP2 *y);
+/**	@brief addition of two FP2s
+ *
+	@param x FP2 instance, on exit = y+z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_add(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief subtraction of two FP2s
+ *
+	@param x FP2 instance, on exit = y-z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_sub(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Multiplication of an FP2 by an FP
+ *
+	@param x FP2 instance, on exit = y*b
+	@param y FP2 instance
+	@param b FP residue
+ */
+extern void FP2_pmul(FP2 *x, FP2 *y, FP *b);
+/**	@brief Multiplication of an FP2 by a small integer
+ *
+	@param x FP2 instance, on exit = y*i
+	@param y FP2 instance
+	@param i an integer
+ */
+extern void FP2_imul(FP2 *x, FP2 *y, int i);
+/**	@brief Squaring an FP2
+ *
+	@param x FP2 instance, on exit = y^2
+	@param y FP2 instance
+ */
+extern void FP2_sqr(FP2 *x, FP2 *y);
+/**	@brief Multiplication of two FP2s
+ *
+	@param x FP2 instance, on exit = y*z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_mul(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Formats and outputs an FP2 to the console
+ *
+	@param x FP2 instance
+ */
+extern void FP2_output(FP2 *x);
+/**	@brief Formats and outputs an FP2 to the console in raw form (for debugging)
+ *
+	@param x FP2 instance
+ */
+extern void FP2_rawoutput(FP2 *x);
+/**	@brief Inverting an FP2
+ *
+	@param x FP2 instance, on exit = 1/y
+	@param y FP2 instance
+ */
+extern void FP2_inv(FP2 *x, FP2 *y, FP *h);
+/**	@brief Divide an FP2 by 2
+ *
+	@param x FP2 instance, on exit = y/2
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_div2(FP2 *x, FP2 *y);
+/**	@brief Multiply an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x*(1+sqrt(-1))
+ */
+extern void FP2_mul_ip(FP2 *x);
+
+/**	@brief Divide an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x/(1+sqrt(-1))
+ */
+extern void FP2_div_ip(FP2 *x);
+/**	@brief Normalises the components of an FP2
+ *
+	@param x FP2 instance to be normalised
+ */
+extern void FP2_norm(FP2 *x);
+/**	@brief Reduces all components of possibly unreduced FP2 mod Modulus
+ *
+	@param x FP2 instance, on exit reduced mod Modulus
+ */
+extern void FP2_reduce(FP2 *x);
+/**	@brief Raises an FP2 to the power of a BIG
+ *
+	@param x FP2 instance, on exit = y^b
+	@param y FP2 instance
+	@param b BIG number
+ */
+extern void FP2_pow(FP2 *x, FP2 *y, B480_29::BIG b);
+
+/**	@brief Test FP2 for QR
+ *
+	@param x FP2 instance
+    @param h optional generated hint
+	@return true or false
+ */
+extern int FP2_qr(FP2 *x,FP *h);
+
+
+/**	@brief Square root of an FP2
+ *
+	@param x FP2 instance, on exit = sqrt(y)
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_sqrt(FP2 *x, FP2 *y, FP *h);
+
+/**	@brief Multiply an FP2 by sqrt(-1)
+ *
+	Note that -1 is QNR
+	@param x FP2 instance, on exit = x*sqrt(-1)
+ */
+extern void FP2_times_i(FP2 *x);
+
+/**	@brief Generate random FP2
+ *
+	@param x random FP2 number
+	@param rng random number generator
+ */
+extern void FP2_rand(FP2 *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp2_BLS48286.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp2_BLS48286.h
new file mode 100644
index 0000000..694422f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp2_BLS48286.h
@@ -0,0 +1,306 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP2_BLS48286_H
+#define FP2_BLS48286_H
+
+#include "fp_BLS48286.h"
+
+using namespace core;
+
+namespace BLS48286 {
+
+/**
+	@brief FP2 Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    FP a; /**< real part of FP2 */
+    FP b; /**< imaginary part of FP2 */
+} FP2;
+
+/* FP2 prototypes */
+
+/**	@brief Tests for FP2 equal to zero
+ *
+	@param x FP2 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP2_iszilch(FP2 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP2 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP2_islarger(FP2 *x);
+
+
+/**	@brief Serialize out FP2  
+ *
+    @param b buffer for output
+	@param x FP2 number to be serialized
+ */
+extern void FP2_toBytes(char *b,FP2 *x);
+
+/**	@brief Serialize in FP2  
+ *
+	@param x FP2 number to be serialized
+    @param b buffer for input
+ */
+extern void FP2_fromBytes(FP2 *x,char *b);
+
+/**	@brief Conditional copy of FP2 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP2 instance, set to y if s!=0
+	@param y another FP2 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP2_cmove(FP2 *x, FP2 *y, int s);
+/**	@brief Tests for FP2 equal to one
+ *
+	@param x FP2 instance to be tested
+	@return 1 if x=1, else returns 0
+ */
+extern int FP2_isunity(FP2 *x);
+/**	@brief Tests for equality of two FP2s
+ *
+	@param x FP2 instance to be compared
+	@param y FP2 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP2_equals(FP2 *x, FP2 *y);
+/**	@brief Initialise FP2 from two FP numbers
+ *
+	@param x FP2 instance to be initialised
+	@param a FP to form real part of FP2
+	@param b FP to form imaginary part of FP2
+ */
+extern void FP2_from_FPs(FP2 *x, FP *a, FP *b);
+/**	@brief Initialise FP2 from two BIG integers
+ *
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+	@param b BIG to form imaginary part of FP2
+ */
+extern void FP2_from_BIGs(FP2 *x, B288_29::BIG a, B288_29::BIG b);
+
+
+/**	@brief Initialise FP2 from two integers
+ *
+	@param x FP2 instance to be initialised
+	@param a int to form real part of FP2
+	@param b int to form imaginary part of FP2
+ */
+extern void FP2_from_ints(FP2 *x, int a, int b);
+
+
+
+/**	@brief Initialise FP2 from single FP
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param an FP to form real part of FP2
+ */
+extern void FP2_from_FP(FP2 *x, FP *a);
+/**	@brief Initialise FP2 from single BIG
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+ */
+extern void FP2_from_BIG(FP2 *x, B288_29::BIG a);
+/**	@brief Copy FP2 to another FP2
+ *
+	@param x FP2 instance, on exit = y
+	@param y FP2 instance to be copied
+ */
+extern void FP2_copy(FP2 *x, FP2 *y);
+/**	@brief Set FP2 to zero
+ *
+	@param x FP2 instance to be set to zero
+ */
+extern void FP2_zero(FP2 *x);
+/**	@brief Set FP2 to unity
+ *
+	@param x FP2 instance to be set to one
+ */
+extern void FP2_one(FP2 *x);
+
+/**	@brief Copy from ROM to an FP2
+ *
+	@param w FP2 number to be copied to
+	@param a BIG real part to be copied from ROM
+	@param b BIG imag part to be copied from ROM
+ */
+extern void FP2_rcopy(FP2 *w,const B288_29::BIG a,const B288_29::BIG b);
+
+/**	@brief Sign of FP2
+ *
+	@param x FP2 instance
+	@return "sign" of FP2
+ */
+extern int FP2_sign(FP2 *x);
+
+/**	@brief Negation of FP2
+ *
+	@param x FP2 instance, on exit = -y
+	@param y FP2 instance
+ */
+extern void FP2_neg(FP2 *x, FP2 *y);
+
+
+/**	@brief Conjugation of FP2
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP2 instance, on exit = conj(y)
+	@param y FP2 instance
+ */
+extern void FP2_conj(FP2 *x, FP2 *y);
+/**	@brief addition of two FP2s
+ *
+	@param x FP2 instance, on exit = y+z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_add(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief subtraction of two FP2s
+ *
+	@param x FP2 instance, on exit = y-z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_sub(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Multiplication of an FP2 by an FP
+ *
+	@param x FP2 instance, on exit = y*b
+	@param y FP2 instance
+	@param b FP residue
+ */
+extern void FP2_pmul(FP2 *x, FP2 *y, FP *b);
+/**	@brief Multiplication of an FP2 by a small integer
+ *
+	@param x FP2 instance, on exit = y*i
+	@param y FP2 instance
+	@param i an integer
+ */
+extern void FP2_imul(FP2 *x, FP2 *y, int i);
+/**	@brief Squaring an FP2
+ *
+	@param x FP2 instance, on exit = y^2
+	@param y FP2 instance
+ */
+extern void FP2_sqr(FP2 *x, FP2 *y);
+/**	@brief Multiplication of two FP2s
+ *
+	@param x FP2 instance, on exit = y*z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_mul(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Formats and outputs an FP2 to the console
+ *
+	@param x FP2 instance
+ */
+extern void FP2_output(FP2 *x);
+/**	@brief Formats and outputs an FP2 to the console in raw form (for debugging)
+ *
+	@param x FP2 instance
+ */
+extern void FP2_rawoutput(FP2 *x);
+/**	@brief Inverting an FP2
+ *
+	@param x FP2 instance, on exit = 1/y
+	@param y FP2 instance
+ */
+extern void FP2_inv(FP2 *x, FP2 *y, FP *h);
+/**	@brief Divide an FP2 by 2
+ *
+	@param x FP2 instance, on exit = y/2
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_div2(FP2 *x, FP2 *y);
+/**	@brief Multiply an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x*(1+sqrt(-1))
+ */
+extern void FP2_mul_ip(FP2 *x);
+
+/**	@brief Divide an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x/(1+sqrt(-1))
+ */
+extern void FP2_div_ip(FP2 *x);
+/**	@brief Normalises the components of an FP2
+ *
+	@param x FP2 instance to be normalised
+ */
+extern void FP2_norm(FP2 *x);
+/**	@brief Reduces all components of possibly unreduced FP2 mod Modulus
+ *
+	@param x FP2 instance, on exit reduced mod Modulus
+ */
+extern void FP2_reduce(FP2 *x);
+/**	@brief Raises an FP2 to the power of a BIG
+ *
+	@param x FP2 instance, on exit = y^b
+	@param y FP2 instance
+	@param b BIG number
+ */
+extern void FP2_pow(FP2 *x, FP2 *y, B288_29::BIG b);
+
+/**	@brief Test FP2 for QR
+ *
+	@param x FP2 instance
+    @param h optional generated hint
+	@return true or false
+ */
+extern int FP2_qr(FP2 *x,FP *h);
+
+
+/**	@brief Square root of an FP2
+ *
+	@param x FP2 instance, on exit = sqrt(y)
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_sqrt(FP2 *x, FP2 *y, FP *h);
+
+/**	@brief Multiply an FP2 by sqrt(-1)
+ *
+	Note that -1 is QNR
+	@param x FP2 instance, on exit = x*sqrt(-1)
+ */
+extern void FP2_times_i(FP2 *x);
+
+/**	@brief Generate random FP2
+ *
+	@param x random FP2 number
+	@param rng random number generator
+ */
+extern void FP2_rand(FP2 *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp2_BLS48556.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp2_BLS48556.h
new file mode 100644
index 0000000..9c9599c
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp2_BLS48556.h
@@ -0,0 +1,306 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP2_BLS48556_H
+#define FP2_BLS48556_H
+
+#include "fp_BLS48556.h"
+
+using namespace core;
+
+namespace BLS48556 {
+
+/**
+	@brief FP2 Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    FP a; /**< real part of FP2 */
+    FP b; /**< imaginary part of FP2 */
+} FP2;
+
+/* FP2 prototypes */
+
+/**	@brief Tests for FP2 equal to zero
+ *
+	@param x FP2 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP2_iszilch(FP2 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP2 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP2_islarger(FP2 *x);
+
+
+/**	@brief Serialize out FP2  
+ *
+    @param b buffer for output
+	@param x FP2 number to be serialized
+ */
+extern void FP2_toBytes(char *b,FP2 *x);
+
+/**	@brief Serialize in FP2  
+ *
+	@param x FP2 number to be serialized
+    @param b buffer for input
+ */
+extern void FP2_fromBytes(FP2 *x,char *b);
+
+/**	@brief Conditional copy of FP2 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP2 instance, set to y if s!=0
+	@param y another FP2 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP2_cmove(FP2 *x, FP2 *y, int s);
+/**	@brief Tests for FP2 equal to one
+ *
+	@param x FP2 instance to be tested
+	@return 1 if x=1, else returns 0
+ */
+extern int FP2_isunity(FP2 *x);
+/**	@brief Tests for equality of two FP2s
+ *
+	@param x FP2 instance to be compared
+	@param y FP2 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP2_equals(FP2 *x, FP2 *y);
+/**	@brief Initialise FP2 from two FP numbers
+ *
+	@param x FP2 instance to be initialised
+	@param a FP to form real part of FP2
+	@param b FP to form imaginary part of FP2
+ */
+extern void FP2_from_FPs(FP2 *x, FP *a, FP *b);
+/**	@brief Initialise FP2 from two BIG integers
+ *
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+	@param b BIG to form imaginary part of FP2
+ */
+extern void FP2_from_BIGs(FP2 *x, B560_29::BIG a, B560_29::BIG b);
+
+
+/**	@brief Initialise FP2 from two integers
+ *
+	@param x FP2 instance to be initialised
+	@param a int to form real part of FP2
+	@param b int to form imaginary part of FP2
+ */
+extern void FP2_from_ints(FP2 *x, int a, int b);
+
+
+
+/**	@brief Initialise FP2 from single FP
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param an FP to form real part of FP2
+ */
+extern void FP2_from_FP(FP2 *x, FP *a);
+/**	@brief Initialise FP2 from single BIG
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+ */
+extern void FP2_from_BIG(FP2 *x, B560_29::BIG a);
+/**	@brief Copy FP2 to another FP2
+ *
+	@param x FP2 instance, on exit = y
+	@param y FP2 instance to be copied
+ */
+extern void FP2_copy(FP2 *x, FP2 *y);
+/**	@brief Set FP2 to zero
+ *
+	@param x FP2 instance to be set to zero
+ */
+extern void FP2_zero(FP2 *x);
+/**	@brief Set FP2 to unity
+ *
+	@param x FP2 instance to be set to one
+ */
+extern void FP2_one(FP2 *x);
+
+/**	@brief Copy from ROM to an FP2
+ *
+	@param w FP2 number to be copied to
+	@param a BIG real part to be copied from ROM
+	@param b BIG imag part to be copied from ROM
+ */
+extern void FP2_rcopy(FP2 *w,const B560_29::BIG a,const B560_29::BIG b);
+
+/**	@brief Sign of FP2
+ *
+	@param x FP2 instance
+	@return "sign" of FP2
+ */
+extern int FP2_sign(FP2 *x);
+
+/**	@brief Negation of FP2
+ *
+	@param x FP2 instance, on exit = -y
+	@param y FP2 instance
+ */
+extern void FP2_neg(FP2 *x, FP2 *y);
+
+
+/**	@brief Conjugation of FP2
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP2 instance, on exit = conj(y)
+	@param y FP2 instance
+ */
+extern void FP2_conj(FP2 *x, FP2 *y);
+/**	@brief addition of two FP2s
+ *
+	@param x FP2 instance, on exit = y+z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_add(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief subtraction of two FP2s
+ *
+	@param x FP2 instance, on exit = y-z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_sub(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Multiplication of an FP2 by an FP
+ *
+	@param x FP2 instance, on exit = y*b
+	@param y FP2 instance
+	@param b FP residue
+ */
+extern void FP2_pmul(FP2 *x, FP2 *y, FP *b);
+/**	@brief Multiplication of an FP2 by a small integer
+ *
+	@param x FP2 instance, on exit = y*i
+	@param y FP2 instance
+	@param i an integer
+ */
+extern void FP2_imul(FP2 *x, FP2 *y, int i);
+/**	@brief Squaring an FP2
+ *
+	@param x FP2 instance, on exit = y^2
+	@param y FP2 instance
+ */
+extern void FP2_sqr(FP2 *x, FP2 *y);
+/**	@brief Multiplication of two FP2s
+ *
+	@param x FP2 instance, on exit = y*z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_mul(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Formats and outputs an FP2 to the console
+ *
+	@param x FP2 instance
+ */
+extern void FP2_output(FP2 *x);
+/**	@brief Formats and outputs an FP2 to the console in raw form (for debugging)
+ *
+	@param x FP2 instance
+ */
+extern void FP2_rawoutput(FP2 *x);
+/**	@brief Inverting an FP2
+ *
+	@param x FP2 instance, on exit = 1/y
+	@param y FP2 instance
+ */
+extern void FP2_inv(FP2 *x, FP2 *y, FP *h);
+/**	@brief Divide an FP2 by 2
+ *
+	@param x FP2 instance, on exit = y/2
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_div2(FP2 *x, FP2 *y);
+/**	@brief Multiply an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x*(1+sqrt(-1))
+ */
+extern void FP2_mul_ip(FP2 *x);
+
+/**	@brief Divide an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x/(1+sqrt(-1))
+ */
+extern void FP2_div_ip(FP2 *x);
+/**	@brief Normalises the components of an FP2
+ *
+	@param x FP2 instance to be normalised
+ */
+extern void FP2_norm(FP2 *x);
+/**	@brief Reduces all components of possibly unreduced FP2 mod Modulus
+ *
+	@param x FP2 instance, on exit reduced mod Modulus
+ */
+extern void FP2_reduce(FP2 *x);
+/**	@brief Raises an FP2 to the power of a BIG
+ *
+	@param x FP2 instance, on exit = y^b
+	@param y FP2 instance
+	@param b BIG number
+ */
+extern void FP2_pow(FP2 *x, FP2 *y, B560_29::BIG b);
+
+/**	@brief Test FP2 for QR
+ *
+	@param x FP2 instance
+    @param h optional generated hint
+	@return true or false
+ */
+extern int FP2_qr(FP2 *x,FP *h);
+
+
+/**	@brief Square root of an FP2
+ *
+	@param x FP2 instance, on exit = sqrt(y)
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_sqrt(FP2 *x, FP2 *y, FP *h);
+
+/**	@brief Multiply an FP2 by sqrt(-1)
+ *
+	Note that -1 is QNR
+	@param x FP2 instance, on exit = x*sqrt(-1)
+ */
+extern void FP2_times_i(FP2 *x);
+
+/**	@brief Generate random FP2
+ *
+	@param x random FP2 number
+	@param rng random number generator
+ */
+extern void FP2_rand(FP2 *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp2_BLS48581.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp2_BLS48581.h
new file mode 100644
index 0000000..df7f895
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp2_BLS48581.h
@@ -0,0 +1,306 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP2_BLS48581_H
+#define FP2_BLS48581_H
+
+#include "fp_BLS48581.h"
+
+using namespace core;
+
+namespace BLS48581 {
+
+/**
+	@brief FP2 Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    FP a; /**< real part of FP2 */
+    FP b; /**< imaginary part of FP2 */
+} FP2;
+
+/* FP2 prototypes */
+
+/**	@brief Tests for FP2 equal to zero
+ *
+	@param x FP2 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP2_iszilch(FP2 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP2 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP2_islarger(FP2 *x);
+
+
+/**	@brief Serialize out FP2  
+ *
+    @param b buffer for output
+	@param x FP2 number to be serialized
+ */
+extern void FP2_toBytes(char *b,FP2 *x);
+
+/**	@brief Serialize in FP2  
+ *
+	@param x FP2 number to be serialized
+    @param b buffer for input
+ */
+extern void FP2_fromBytes(FP2 *x,char *b);
+
+/**	@brief Conditional copy of FP2 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP2 instance, set to y if s!=0
+	@param y another FP2 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP2_cmove(FP2 *x, FP2 *y, int s);
+/**	@brief Tests for FP2 equal to one
+ *
+	@param x FP2 instance to be tested
+	@return 1 if x=1, else returns 0
+ */
+extern int FP2_isunity(FP2 *x);
+/**	@brief Tests for equality of two FP2s
+ *
+	@param x FP2 instance to be compared
+	@param y FP2 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP2_equals(FP2 *x, FP2 *y);
+/**	@brief Initialise FP2 from two FP numbers
+ *
+	@param x FP2 instance to be initialised
+	@param a FP to form real part of FP2
+	@param b FP to form imaginary part of FP2
+ */
+extern void FP2_from_FPs(FP2 *x, FP *a, FP *b);
+/**	@brief Initialise FP2 from two BIG integers
+ *
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+	@param b BIG to form imaginary part of FP2
+ */
+extern void FP2_from_BIGs(FP2 *x, B584_29::BIG a, B584_29::BIG b);
+
+
+/**	@brief Initialise FP2 from two integers
+ *
+	@param x FP2 instance to be initialised
+	@param a int to form real part of FP2
+	@param b int to form imaginary part of FP2
+ */
+extern void FP2_from_ints(FP2 *x, int a, int b);
+
+
+
+/**	@brief Initialise FP2 from single FP
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param an FP to form real part of FP2
+ */
+extern void FP2_from_FP(FP2 *x, FP *a);
+/**	@brief Initialise FP2 from single BIG
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+ */
+extern void FP2_from_BIG(FP2 *x, B584_29::BIG a);
+/**	@brief Copy FP2 to another FP2
+ *
+	@param x FP2 instance, on exit = y
+	@param y FP2 instance to be copied
+ */
+extern void FP2_copy(FP2 *x, FP2 *y);
+/**	@brief Set FP2 to zero
+ *
+	@param x FP2 instance to be set to zero
+ */
+extern void FP2_zero(FP2 *x);
+/**	@brief Set FP2 to unity
+ *
+	@param x FP2 instance to be set to one
+ */
+extern void FP2_one(FP2 *x);
+
+/**	@brief Copy from ROM to an FP2
+ *
+	@param w FP2 number to be copied to
+	@param a BIG real part to be copied from ROM
+	@param b BIG imag part to be copied from ROM
+ */
+extern void FP2_rcopy(FP2 *w,const B584_29::BIG a,const B584_29::BIG b);
+
+/**	@brief Sign of FP2
+ *
+	@param x FP2 instance
+	@return "sign" of FP2
+ */
+extern int FP2_sign(FP2 *x);
+
+/**	@brief Negation of FP2
+ *
+	@param x FP2 instance, on exit = -y
+	@param y FP2 instance
+ */
+extern void FP2_neg(FP2 *x, FP2 *y);
+
+
+/**	@brief Conjugation of FP2
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP2 instance, on exit = conj(y)
+	@param y FP2 instance
+ */
+extern void FP2_conj(FP2 *x, FP2 *y);
+/**	@brief addition of two FP2s
+ *
+	@param x FP2 instance, on exit = y+z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_add(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief subtraction of two FP2s
+ *
+	@param x FP2 instance, on exit = y-z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_sub(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Multiplication of an FP2 by an FP
+ *
+	@param x FP2 instance, on exit = y*b
+	@param y FP2 instance
+	@param b FP residue
+ */
+extern void FP2_pmul(FP2 *x, FP2 *y, FP *b);
+/**	@brief Multiplication of an FP2 by a small integer
+ *
+	@param x FP2 instance, on exit = y*i
+	@param y FP2 instance
+	@param i an integer
+ */
+extern void FP2_imul(FP2 *x, FP2 *y, int i);
+/**	@brief Squaring an FP2
+ *
+	@param x FP2 instance, on exit = y^2
+	@param y FP2 instance
+ */
+extern void FP2_sqr(FP2 *x, FP2 *y);
+/**	@brief Multiplication of two FP2s
+ *
+	@param x FP2 instance, on exit = y*z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_mul(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Formats and outputs an FP2 to the console
+ *
+	@param x FP2 instance
+ */
+extern void FP2_output(FP2 *x);
+/**	@brief Formats and outputs an FP2 to the console in raw form (for debugging)
+ *
+	@param x FP2 instance
+ */
+extern void FP2_rawoutput(FP2 *x);
+/**	@brief Inverting an FP2
+ *
+	@param x FP2 instance, on exit = 1/y
+	@param y FP2 instance
+ */
+extern void FP2_inv(FP2 *x, FP2 *y, FP *h);
+/**	@brief Divide an FP2 by 2
+ *
+	@param x FP2 instance, on exit = y/2
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_div2(FP2 *x, FP2 *y);
+/**	@brief Multiply an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x*(1+sqrt(-1))
+ */
+extern void FP2_mul_ip(FP2 *x);
+
+/**	@brief Divide an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x/(1+sqrt(-1))
+ */
+extern void FP2_div_ip(FP2 *x);
+/**	@brief Normalises the components of an FP2
+ *
+	@param x FP2 instance to be normalised
+ */
+extern void FP2_norm(FP2 *x);
+/**	@brief Reduces all components of possibly unreduced FP2 mod Modulus
+ *
+	@param x FP2 instance, on exit reduced mod Modulus
+ */
+extern void FP2_reduce(FP2 *x);
+/**	@brief Raises an FP2 to the power of a BIG
+ *
+	@param x FP2 instance, on exit = y^b
+	@param y FP2 instance
+	@param b BIG number
+ */
+extern void FP2_pow(FP2 *x, FP2 *y, B584_29::BIG b);
+
+/**	@brief Test FP2 for QR
+ *
+	@param x FP2 instance
+    @param h optional generated hint
+	@return true or false
+ */
+extern int FP2_qr(FP2 *x,FP *h);
+
+
+/**	@brief Square root of an FP2
+ *
+	@param x FP2 instance, on exit = sqrt(y)
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_sqrt(FP2 *x, FP2 *y, FP *h);
+
+/**	@brief Multiply an FP2 by sqrt(-1)
+ *
+	Note that -1 is QNR
+	@param x FP2 instance, on exit = x*sqrt(-1)
+ */
+extern void FP2_times_i(FP2 *x);
+
+/**	@brief Generate random FP2
+ *
+	@param x random FP2 number
+	@param rng random number generator
+ */
+extern void FP2_rand(FP2 *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp2_BN158.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp2_BN158.h
new file mode 100644
index 0000000..f483151
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp2_BN158.h
@@ -0,0 +1,306 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP2_BN158_H
+#define FP2_BN158_H
+
+#include "fp_BN158.h"
+
+using namespace core;
+
+namespace BN158 {
+
+/**
+	@brief FP2 Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    FP a; /**< real part of FP2 */
+    FP b; /**< imaginary part of FP2 */
+} FP2;
+
+/* FP2 prototypes */
+
+/**	@brief Tests for FP2 equal to zero
+ *
+	@param x FP2 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP2_iszilch(FP2 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP2 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP2_islarger(FP2 *x);
+
+
+/**	@brief Serialize out FP2  
+ *
+    @param b buffer for output
+	@param x FP2 number to be serialized
+ */
+extern void FP2_toBytes(char *b,FP2 *x);
+
+/**	@brief Serialize in FP2  
+ *
+	@param x FP2 number to be serialized
+    @param b buffer for input
+ */
+extern void FP2_fromBytes(FP2 *x,char *b);
+
+/**	@brief Conditional copy of FP2 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP2 instance, set to y if s!=0
+	@param y another FP2 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP2_cmove(FP2 *x, FP2 *y, int s);
+/**	@brief Tests for FP2 equal to one
+ *
+	@param x FP2 instance to be tested
+	@return 1 if x=1, else returns 0
+ */
+extern int FP2_isunity(FP2 *x);
+/**	@brief Tests for equality of two FP2s
+ *
+	@param x FP2 instance to be compared
+	@param y FP2 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP2_equals(FP2 *x, FP2 *y);
+/**	@brief Initialise FP2 from two FP numbers
+ *
+	@param x FP2 instance to be initialised
+	@param a FP to form real part of FP2
+	@param b FP to form imaginary part of FP2
+ */
+extern void FP2_from_FPs(FP2 *x, FP *a, FP *b);
+/**	@brief Initialise FP2 from two BIG integers
+ *
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+	@param b BIG to form imaginary part of FP2
+ */
+extern void FP2_from_BIGs(FP2 *x, B160_28::BIG a, B160_28::BIG b);
+
+
+/**	@brief Initialise FP2 from two integers
+ *
+	@param x FP2 instance to be initialised
+	@param a int to form real part of FP2
+	@param b int to form imaginary part of FP2
+ */
+extern void FP2_from_ints(FP2 *x, int a, int b);
+
+
+
+/**	@brief Initialise FP2 from single FP
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param an FP to form real part of FP2
+ */
+extern void FP2_from_FP(FP2 *x, FP *a);
+/**	@brief Initialise FP2 from single BIG
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+ */
+extern void FP2_from_BIG(FP2 *x, B160_28::BIG a);
+/**	@brief Copy FP2 to another FP2
+ *
+	@param x FP2 instance, on exit = y
+	@param y FP2 instance to be copied
+ */
+extern void FP2_copy(FP2 *x, FP2 *y);
+/**	@brief Set FP2 to zero
+ *
+	@param x FP2 instance to be set to zero
+ */
+extern void FP2_zero(FP2 *x);
+/**	@brief Set FP2 to unity
+ *
+	@param x FP2 instance to be set to one
+ */
+extern void FP2_one(FP2 *x);
+
+/**	@brief Copy from ROM to an FP2
+ *
+	@param w FP2 number to be copied to
+	@param a BIG real part to be copied from ROM
+	@param b BIG imag part to be copied from ROM
+ */
+extern void FP2_rcopy(FP2 *w,const B160_28::BIG a,const B160_28::BIG b);
+
+/**	@brief Sign of FP2
+ *
+	@param x FP2 instance
+	@return "sign" of FP2
+ */
+extern int FP2_sign(FP2 *x);
+
+/**	@brief Negation of FP2
+ *
+	@param x FP2 instance, on exit = -y
+	@param y FP2 instance
+ */
+extern void FP2_neg(FP2 *x, FP2 *y);
+
+
+/**	@brief Conjugation of FP2
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP2 instance, on exit = conj(y)
+	@param y FP2 instance
+ */
+extern void FP2_conj(FP2 *x, FP2 *y);
+/**	@brief addition of two FP2s
+ *
+	@param x FP2 instance, on exit = y+z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_add(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief subtraction of two FP2s
+ *
+	@param x FP2 instance, on exit = y-z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_sub(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Multiplication of an FP2 by an FP
+ *
+	@param x FP2 instance, on exit = y*b
+	@param y FP2 instance
+	@param b FP residue
+ */
+extern void FP2_pmul(FP2 *x, FP2 *y, FP *b);
+/**	@brief Multiplication of an FP2 by a small integer
+ *
+	@param x FP2 instance, on exit = y*i
+	@param y FP2 instance
+	@param i an integer
+ */
+extern void FP2_imul(FP2 *x, FP2 *y, int i);
+/**	@brief Squaring an FP2
+ *
+	@param x FP2 instance, on exit = y^2
+	@param y FP2 instance
+ */
+extern void FP2_sqr(FP2 *x, FP2 *y);
+/**	@brief Multiplication of two FP2s
+ *
+	@param x FP2 instance, on exit = y*z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_mul(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Formats and outputs an FP2 to the console
+ *
+	@param x FP2 instance
+ */
+extern void FP2_output(FP2 *x);
+/**	@brief Formats and outputs an FP2 to the console in raw form (for debugging)
+ *
+	@param x FP2 instance
+ */
+extern void FP2_rawoutput(FP2 *x);
+/**	@brief Inverting an FP2
+ *
+	@param x FP2 instance, on exit = 1/y
+	@param y FP2 instance
+ */
+extern void FP2_inv(FP2 *x, FP2 *y, FP *h);
+/**	@brief Divide an FP2 by 2
+ *
+	@param x FP2 instance, on exit = y/2
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_div2(FP2 *x, FP2 *y);
+/**	@brief Multiply an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x*(1+sqrt(-1))
+ */
+extern void FP2_mul_ip(FP2 *x);
+
+/**	@brief Divide an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x/(1+sqrt(-1))
+ */
+extern void FP2_div_ip(FP2 *x);
+/**	@brief Normalises the components of an FP2
+ *
+	@param x FP2 instance to be normalised
+ */
+extern void FP2_norm(FP2 *x);
+/**	@brief Reduces all components of possibly unreduced FP2 mod Modulus
+ *
+	@param x FP2 instance, on exit reduced mod Modulus
+ */
+extern void FP2_reduce(FP2 *x);
+/**	@brief Raises an FP2 to the power of a BIG
+ *
+	@param x FP2 instance, on exit = y^b
+	@param y FP2 instance
+	@param b BIG number
+ */
+extern void FP2_pow(FP2 *x, FP2 *y, B160_28::BIG b);
+
+/**	@brief Test FP2 for QR
+ *
+	@param x FP2 instance
+    @param h optional generated hint
+	@return true or false
+ */
+extern int FP2_qr(FP2 *x,FP *h);
+
+
+/**	@brief Square root of an FP2
+ *
+	@param x FP2 instance, on exit = sqrt(y)
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_sqrt(FP2 *x, FP2 *y, FP *h);
+
+/**	@brief Multiply an FP2 by sqrt(-1)
+ *
+	Note that -1 is QNR
+	@param x FP2 instance, on exit = x*sqrt(-1)
+ */
+extern void FP2_times_i(FP2 *x);
+
+/**	@brief Generate random FP2
+ *
+	@param x random FP2 number
+	@param rng random number generator
+ */
+extern void FP2_rand(FP2 *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp2_BN254.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp2_BN254.h
new file mode 100644
index 0000000..a2396f0
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp2_BN254.h
@@ -0,0 +1,306 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP2_BN254_H
+#define FP2_BN254_H
+
+#include "fp_BN254.h"
+
+using namespace core;
+
+namespace BN254 {
+
+/**
+	@brief FP2 Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    FP a; /**< real part of FP2 */
+    FP b; /**< imaginary part of FP2 */
+} FP2;
+
+/* FP2 prototypes */
+
+/**	@brief Tests for FP2 equal to zero
+ *
+	@param x FP2 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP2_iszilch(FP2 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP2 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP2_islarger(FP2 *x);
+
+
+/**	@brief Serialize out FP2  
+ *
+    @param b buffer for output
+	@param x FP2 number to be serialized
+ */
+extern void FP2_toBytes(char *b,FP2 *x);
+
+/**	@brief Serialize in FP2  
+ *
+	@param x FP2 number to be serialized
+    @param b buffer for input
+ */
+extern void FP2_fromBytes(FP2 *x,char *b);
+
+/**	@brief Conditional copy of FP2 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP2 instance, set to y if s!=0
+	@param y another FP2 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP2_cmove(FP2 *x, FP2 *y, int s);
+/**	@brief Tests for FP2 equal to one
+ *
+	@param x FP2 instance to be tested
+	@return 1 if x=1, else returns 0
+ */
+extern int FP2_isunity(FP2 *x);
+/**	@brief Tests for equality of two FP2s
+ *
+	@param x FP2 instance to be compared
+	@param y FP2 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP2_equals(FP2 *x, FP2 *y);
+/**	@brief Initialise FP2 from two FP numbers
+ *
+	@param x FP2 instance to be initialised
+	@param a FP to form real part of FP2
+	@param b FP to form imaginary part of FP2
+ */
+extern void FP2_from_FPs(FP2 *x, FP *a, FP *b);
+/**	@brief Initialise FP2 from two BIG integers
+ *
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+	@param b BIG to form imaginary part of FP2
+ */
+extern void FP2_from_BIGs(FP2 *x, B256_28::BIG a, B256_28::BIG b);
+
+
+/**	@brief Initialise FP2 from two integers
+ *
+	@param x FP2 instance to be initialised
+	@param a int to form real part of FP2
+	@param b int to form imaginary part of FP2
+ */
+extern void FP2_from_ints(FP2 *x, int a, int b);
+
+
+
+/**	@brief Initialise FP2 from single FP
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param an FP to form real part of FP2
+ */
+extern void FP2_from_FP(FP2 *x, FP *a);
+/**	@brief Initialise FP2 from single BIG
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+ */
+extern void FP2_from_BIG(FP2 *x, B256_28::BIG a);
+/**	@brief Copy FP2 to another FP2
+ *
+	@param x FP2 instance, on exit = y
+	@param y FP2 instance to be copied
+ */
+extern void FP2_copy(FP2 *x, FP2 *y);
+/**	@brief Set FP2 to zero
+ *
+	@param x FP2 instance to be set to zero
+ */
+extern void FP2_zero(FP2 *x);
+/**	@brief Set FP2 to unity
+ *
+	@param x FP2 instance to be set to one
+ */
+extern void FP2_one(FP2 *x);
+
+/**	@brief Copy from ROM to an FP2
+ *
+	@param w FP2 number to be copied to
+	@param a BIG real part to be copied from ROM
+	@param b BIG imag part to be copied from ROM
+ */
+extern void FP2_rcopy(FP2 *w,const B256_28::BIG a,const B256_28::BIG b);
+
+/**	@brief Sign of FP2
+ *
+	@param x FP2 instance
+	@return "sign" of FP2
+ */
+extern int FP2_sign(FP2 *x);
+
+/**	@brief Negation of FP2
+ *
+	@param x FP2 instance, on exit = -y
+	@param y FP2 instance
+ */
+extern void FP2_neg(FP2 *x, FP2 *y);
+
+
+/**	@brief Conjugation of FP2
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP2 instance, on exit = conj(y)
+	@param y FP2 instance
+ */
+extern void FP2_conj(FP2 *x, FP2 *y);
+/**	@brief addition of two FP2s
+ *
+	@param x FP2 instance, on exit = y+z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_add(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief subtraction of two FP2s
+ *
+	@param x FP2 instance, on exit = y-z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_sub(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Multiplication of an FP2 by an FP
+ *
+	@param x FP2 instance, on exit = y*b
+	@param y FP2 instance
+	@param b FP residue
+ */
+extern void FP2_pmul(FP2 *x, FP2 *y, FP *b);
+/**	@brief Multiplication of an FP2 by a small integer
+ *
+	@param x FP2 instance, on exit = y*i
+	@param y FP2 instance
+	@param i an integer
+ */
+extern void FP2_imul(FP2 *x, FP2 *y, int i);
+/**	@brief Squaring an FP2
+ *
+	@param x FP2 instance, on exit = y^2
+	@param y FP2 instance
+ */
+extern void FP2_sqr(FP2 *x, FP2 *y);
+/**	@brief Multiplication of two FP2s
+ *
+	@param x FP2 instance, on exit = y*z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_mul(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Formats and outputs an FP2 to the console
+ *
+	@param x FP2 instance
+ */
+extern void FP2_output(FP2 *x);
+/**	@brief Formats and outputs an FP2 to the console in raw form (for debugging)
+ *
+	@param x FP2 instance
+ */
+extern void FP2_rawoutput(FP2 *x);
+/**	@brief Inverting an FP2
+ *
+	@param x FP2 instance, on exit = 1/y
+	@param y FP2 instance
+ */
+extern void FP2_inv(FP2 *x, FP2 *y, FP *h);
+/**	@brief Divide an FP2 by 2
+ *
+	@param x FP2 instance, on exit = y/2
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_div2(FP2 *x, FP2 *y);
+/**	@brief Multiply an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x*(1+sqrt(-1))
+ */
+extern void FP2_mul_ip(FP2 *x);
+
+/**	@brief Divide an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x/(1+sqrt(-1))
+ */
+extern void FP2_div_ip(FP2 *x);
+/**	@brief Normalises the components of an FP2
+ *
+	@param x FP2 instance to be normalised
+ */
+extern void FP2_norm(FP2 *x);
+/**	@brief Reduces all components of possibly unreduced FP2 mod Modulus
+ *
+	@param x FP2 instance, on exit reduced mod Modulus
+ */
+extern void FP2_reduce(FP2 *x);
+/**	@brief Raises an FP2 to the power of a BIG
+ *
+	@param x FP2 instance, on exit = y^b
+	@param y FP2 instance
+	@param b BIG number
+ */
+extern void FP2_pow(FP2 *x, FP2 *y, B256_28::BIG b);
+
+/**	@brief Test FP2 for QR
+ *
+	@param x FP2 instance
+    @param h optional generated hint
+	@return true or false
+ */
+extern int FP2_qr(FP2 *x,FP *h);
+
+
+/**	@brief Square root of an FP2
+ *
+	@param x FP2 instance, on exit = sqrt(y)
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_sqrt(FP2 *x, FP2 *y, FP *h);
+
+/**	@brief Multiply an FP2 by sqrt(-1)
+ *
+	Note that -1 is QNR
+	@param x FP2 instance, on exit = x*sqrt(-1)
+ */
+extern void FP2_times_i(FP2 *x);
+
+/**	@brief Generate random FP2
+ *
+	@param x random FP2 number
+	@param rng random number generator
+ */
+extern void FP2_rand(FP2 *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp2_BN254CX.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp2_BN254CX.h
new file mode 100644
index 0000000..b487c20
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp2_BN254CX.h
@@ -0,0 +1,306 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP2_BN254CX_H
+#define FP2_BN254CX_H
+
+#include "fp_BN254CX.h"
+
+using namespace core;
+
+namespace BN254CX {
+
+/**
+	@brief FP2 Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    FP a; /**< real part of FP2 */
+    FP b; /**< imaginary part of FP2 */
+} FP2;
+
+/* FP2 prototypes */
+
+/**	@brief Tests for FP2 equal to zero
+ *
+	@param x FP2 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP2_iszilch(FP2 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP2 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP2_islarger(FP2 *x);
+
+
+/**	@brief Serialize out FP2  
+ *
+    @param b buffer for output
+	@param x FP2 number to be serialized
+ */
+extern void FP2_toBytes(char *b,FP2 *x);
+
+/**	@brief Serialize in FP2  
+ *
+	@param x FP2 number to be serialized
+    @param b buffer for input
+ */
+extern void FP2_fromBytes(FP2 *x,char *b);
+
+/**	@brief Conditional copy of FP2 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP2 instance, set to y if s!=0
+	@param y another FP2 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP2_cmove(FP2 *x, FP2 *y, int s);
+/**	@brief Tests for FP2 equal to one
+ *
+	@param x FP2 instance to be tested
+	@return 1 if x=1, else returns 0
+ */
+extern int FP2_isunity(FP2 *x);
+/**	@brief Tests for equality of two FP2s
+ *
+	@param x FP2 instance to be compared
+	@param y FP2 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP2_equals(FP2 *x, FP2 *y);
+/**	@brief Initialise FP2 from two FP numbers
+ *
+	@param x FP2 instance to be initialised
+	@param a FP to form real part of FP2
+	@param b FP to form imaginary part of FP2
+ */
+extern void FP2_from_FPs(FP2 *x, FP *a, FP *b);
+/**	@brief Initialise FP2 from two BIG integers
+ *
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+	@param b BIG to form imaginary part of FP2
+ */
+extern void FP2_from_BIGs(FP2 *x, B256_28::BIG a, B256_28::BIG b);
+
+
+/**	@brief Initialise FP2 from two integers
+ *
+	@param x FP2 instance to be initialised
+	@param a int to form real part of FP2
+	@param b int to form imaginary part of FP2
+ */
+extern void FP2_from_ints(FP2 *x, int a, int b);
+
+
+
+/**	@brief Initialise FP2 from single FP
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param an FP to form real part of FP2
+ */
+extern void FP2_from_FP(FP2 *x, FP *a);
+/**	@brief Initialise FP2 from single BIG
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+ */
+extern void FP2_from_BIG(FP2 *x, B256_28::BIG a);
+/**	@brief Copy FP2 to another FP2
+ *
+	@param x FP2 instance, on exit = y
+	@param y FP2 instance to be copied
+ */
+extern void FP2_copy(FP2 *x, FP2 *y);
+/**	@brief Set FP2 to zero
+ *
+	@param x FP2 instance to be set to zero
+ */
+extern void FP2_zero(FP2 *x);
+/**	@brief Set FP2 to unity
+ *
+	@param x FP2 instance to be set to one
+ */
+extern void FP2_one(FP2 *x);
+
+/**	@brief Copy from ROM to an FP2
+ *
+	@param w FP2 number to be copied to
+	@param a BIG real part to be copied from ROM
+	@param b BIG imag part to be copied from ROM
+ */
+extern void FP2_rcopy(FP2 *w,const B256_28::BIG a,const B256_28::BIG b);
+
+/**	@brief Sign of FP2
+ *
+	@param x FP2 instance
+	@return "sign" of FP2
+ */
+extern int FP2_sign(FP2 *x);
+
+/**	@brief Negation of FP2
+ *
+	@param x FP2 instance, on exit = -y
+	@param y FP2 instance
+ */
+extern void FP2_neg(FP2 *x, FP2 *y);
+
+
+/**	@brief Conjugation of FP2
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP2 instance, on exit = conj(y)
+	@param y FP2 instance
+ */
+extern void FP2_conj(FP2 *x, FP2 *y);
+/**	@brief addition of two FP2s
+ *
+	@param x FP2 instance, on exit = y+z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_add(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief subtraction of two FP2s
+ *
+	@param x FP2 instance, on exit = y-z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_sub(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Multiplication of an FP2 by an FP
+ *
+	@param x FP2 instance, on exit = y*b
+	@param y FP2 instance
+	@param b FP residue
+ */
+extern void FP2_pmul(FP2 *x, FP2 *y, FP *b);
+/**	@brief Multiplication of an FP2 by a small integer
+ *
+	@param x FP2 instance, on exit = y*i
+	@param y FP2 instance
+	@param i an integer
+ */
+extern void FP2_imul(FP2 *x, FP2 *y, int i);
+/**	@brief Squaring an FP2
+ *
+	@param x FP2 instance, on exit = y^2
+	@param y FP2 instance
+ */
+extern void FP2_sqr(FP2 *x, FP2 *y);
+/**	@brief Multiplication of two FP2s
+ *
+	@param x FP2 instance, on exit = y*z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_mul(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Formats and outputs an FP2 to the console
+ *
+	@param x FP2 instance
+ */
+extern void FP2_output(FP2 *x);
+/**	@brief Formats and outputs an FP2 to the console in raw form (for debugging)
+ *
+	@param x FP2 instance
+ */
+extern void FP2_rawoutput(FP2 *x);
+/**	@brief Inverting an FP2
+ *
+	@param x FP2 instance, on exit = 1/y
+	@param y FP2 instance
+ */
+extern void FP2_inv(FP2 *x, FP2 *y, FP *h);
+/**	@brief Divide an FP2 by 2
+ *
+	@param x FP2 instance, on exit = y/2
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_div2(FP2 *x, FP2 *y);
+/**	@brief Multiply an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x*(1+sqrt(-1))
+ */
+extern void FP2_mul_ip(FP2 *x);
+
+/**	@brief Divide an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x/(1+sqrt(-1))
+ */
+extern void FP2_div_ip(FP2 *x);
+/**	@brief Normalises the components of an FP2
+ *
+	@param x FP2 instance to be normalised
+ */
+extern void FP2_norm(FP2 *x);
+/**	@brief Reduces all components of possibly unreduced FP2 mod Modulus
+ *
+	@param x FP2 instance, on exit reduced mod Modulus
+ */
+extern void FP2_reduce(FP2 *x);
+/**	@brief Raises an FP2 to the power of a BIG
+ *
+	@param x FP2 instance, on exit = y^b
+	@param y FP2 instance
+	@param b BIG number
+ */
+extern void FP2_pow(FP2 *x, FP2 *y, B256_28::BIG b);
+
+/**	@brief Test FP2 for QR
+ *
+	@param x FP2 instance
+    @param h optional generated hint
+	@return true or false
+ */
+extern int FP2_qr(FP2 *x,FP *h);
+
+
+/**	@brief Square root of an FP2
+ *
+	@param x FP2 instance, on exit = sqrt(y)
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_sqrt(FP2 *x, FP2 *y, FP *h);
+
+/**	@brief Multiply an FP2 by sqrt(-1)
+ *
+	Note that -1 is QNR
+	@param x FP2 instance, on exit = x*sqrt(-1)
+ */
+extern void FP2_times_i(FP2 *x);
+
+/**	@brief Generate random FP2
+ *
+	@param x random FP2 number
+	@param rng random number generator
+ */
+extern void FP2_rand(FP2 *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp2_BN462.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp2_BN462.h
new file mode 100644
index 0000000..eebe2da
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp2_BN462.h
@@ -0,0 +1,306 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP2_BN462_H
+#define FP2_BN462_H
+
+#include "fp_BN462.h"
+
+using namespace core;
+
+namespace BN462 {
+
+/**
+	@brief FP2 Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    FP a; /**< real part of FP2 */
+    FP b; /**< imaginary part of FP2 */
+} FP2;
+
+/* FP2 prototypes */
+
+/**	@brief Tests for FP2 equal to zero
+ *
+	@param x FP2 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP2_iszilch(FP2 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP2 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP2_islarger(FP2 *x);
+
+
+/**	@brief Serialize out FP2  
+ *
+    @param b buffer for output
+	@param x FP2 number to be serialized
+ */
+extern void FP2_toBytes(char *b,FP2 *x);
+
+/**	@brief Serialize in FP2  
+ *
+	@param x FP2 number to be serialized
+    @param b buffer for input
+ */
+extern void FP2_fromBytes(FP2 *x,char *b);
+
+/**	@brief Conditional copy of FP2 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP2 instance, set to y if s!=0
+	@param y another FP2 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP2_cmove(FP2 *x, FP2 *y, int s);
+/**	@brief Tests for FP2 equal to one
+ *
+	@param x FP2 instance to be tested
+	@return 1 if x=1, else returns 0
+ */
+extern int FP2_isunity(FP2 *x);
+/**	@brief Tests for equality of two FP2s
+ *
+	@param x FP2 instance to be compared
+	@param y FP2 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP2_equals(FP2 *x, FP2 *y);
+/**	@brief Initialise FP2 from two FP numbers
+ *
+	@param x FP2 instance to be initialised
+	@param a FP to form real part of FP2
+	@param b FP to form imaginary part of FP2
+ */
+extern void FP2_from_FPs(FP2 *x, FP *a, FP *b);
+/**	@brief Initialise FP2 from two BIG integers
+ *
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+	@param b BIG to form imaginary part of FP2
+ */
+extern void FP2_from_BIGs(FP2 *x, B464_28::BIG a, B464_28::BIG b);
+
+
+/**	@brief Initialise FP2 from two integers
+ *
+	@param x FP2 instance to be initialised
+	@param a int to form real part of FP2
+	@param b int to form imaginary part of FP2
+ */
+extern void FP2_from_ints(FP2 *x, int a, int b);
+
+
+
+/**	@brief Initialise FP2 from single FP
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param an FP to form real part of FP2
+ */
+extern void FP2_from_FP(FP2 *x, FP *a);
+/**	@brief Initialise FP2 from single BIG
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+ */
+extern void FP2_from_BIG(FP2 *x, B464_28::BIG a);
+/**	@brief Copy FP2 to another FP2
+ *
+	@param x FP2 instance, on exit = y
+	@param y FP2 instance to be copied
+ */
+extern void FP2_copy(FP2 *x, FP2 *y);
+/**	@brief Set FP2 to zero
+ *
+	@param x FP2 instance to be set to zero
+ */
+extern void FP2_zero(FP2 *x);
+/**	@brief Set FP2 to unity
+ *
+	@param x FP2 instance to be set to one
+ */
+extern void FP2_one(FP2 *x);
+
+/**	@brief Copy from ROM to an FP2
+ *
+	@param w FP2 number to be copied to
+	@param a BIG real part to be copied from ROM
+	@param b BIG imag part to be copied from ROM
+ */
+extern void FP2_rcopy(FP2 *w,const B464_28::BIG a,const B464_28::BIG b);
+
+/**	@brief Sign of FP2
+ *
+	@param x FP2 instance
+	@return "sign" of FP2
+ */
+extern int FP2_sign(FP2 *x);
+
+/**	@brief Negation of FP2
+ *
+	@param x FP2 instance, on exit = -y
+	@param y FP2 instance
+ */
+extern void FP2_neg(FP2 *x, FP2 *y);
+
+
+/**	@brief Conjugation of FP2
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP2 instance, on exit = conj(y)
+	@param y FP2 instance
+ */
+extern void FP2_conj(FP2 *x, FP2 *y);
+/**	@brief addition of two FP2s
+ *
+	@param x FP2 instance, on exit = y+z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_add(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief subtraction of two FP2s
+ *
+	@param x FP2 instance, on exit = y-z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_sub(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Multiplication of an FP2 by an FP
+ *
+	@param x FP2 instance, on exit = y*b
+	@param y FP2 instance
+	@param b FP residue
+ */
+extern void FP2_pmul(FP2 *x, FP2 *y, FP *b);
+/**	@brief Multiplication of an FP2 by a small integer
+ *
+	@param x FP2 instance, on exit = y*i
+	@param y FP2 instance
+	@param i an integer
+ */
+extern void FP2_imul(FP2 *x, FP2 *y, int i);
+/**	@brief Squaring an FP2
+ *
+	@param x FP2 instance, on exit = y^2
+	@param y FP2 instance
+ */
+extern void FP2_sqr(FP2 *x, FP2 *y);
+/**	@brief Multiplication of two FP2s
+ *
+	@param x FP2 instance, on exit = y*z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_mul(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Formats and outputs an FP2 to the console
+ *
+	@param x FP2 instance
+ */
+extern void FP2_output(FP2 *x);
+/**	@brief Formats and outputs an FP2 to the console in raw form (for debugging)
+ *
+	@param x FP2 instance
+ */
+extern void FP2_rawoutput(FP2 *x);
+/**	@brief Inverting an FP2
+ *
+	@param x FP2 instance, on exit = 1/y
+	@param y FP2 instance
+ */
+extern void FP2_inv(FP2 *x, FP2 *y, FP *h);
+/**	@brief Divide an FP2 by 2
+ *
+	@param x FP2 instance, on exit = y/2
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_div2(FP2 *x, FP2 *y);
+/**	@brief Multiply an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x*(1+sqrt(-1))
+ */
+extern void FP2_mul_ip(FP2 *x);
+
+/**	@brief Divide an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x/(1+sqrt(-1))
+ */
+extern void FP2_div_ip(FP2 *x);
+/**	@brief Normalises the components of an FP2
+ *
+	@param x FP2 instance to be normalised
+ */
+extern void FP2_norm(FP2 *x);
+/**	@brief Reduces all components of possibly unreduced FP2 mod Modulus
+ *
+	@param x FP2 instance, on exit reduced mod Modulus
+ */
+extern void FP2_reduce(FP2 *x);
+/**	@brief Raises an FP2 to the power of a BIG
+ *
+	@param x FP2 instance, on exit = y^b
+	@param y FP2 instance
+	@param b BIG number
+ */
+extern void FP2_pow(FP2 *x, FP2 *y, B464_28::BIG b);
+
+/**	@brief Test FP2 for QR
+ *
+	@param x FP2 instance
+    @param h optional generated hint
+	@return true or false
+ */
+extern int FP2_qr(FP2 *x,FP *h);
+
+
+/**	@brief Square root of an FP2
+ *
+	@param x FP2 instance, on exit = sqrt(y)
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_sqrt(FP2 *x, FP2 *y, FP *h);
+
+/**	@brief Multiply an FP2 by sqrt(-1)
+ *
+	Note that -1 is QNR
+	@param x FP2 instance, on exit = x*sqrt(-1)
+ */
+extern void FP2_times_i(FP2 *x);
+
+/**	@brief Generate random FP2
+ *
+	@param x random FP2 number
+	@param rng random number generator
+ */
+extern void FP2_rand(FP2 *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp2_FP256BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp2_FP256BN.h
new file mode 100644
index 0000000..b282826
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp2_FP256BN.h
@@ -0,0 +1,306 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP2_FP256BN_H
+#define FP2_FP256BN_H
+
+#include "fp_FP256BN.h"
+
+using namespace core;
+
+namespace FP256BN {
+
+/**
+	@brief FP2 Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    FP a; /**< real part of FP2 */
+    FP b; /**< imaginary part of FP2 */
+} FP2;
+
+/* FP2 prototypes */
+
+/**	@brief Tests for FP2 equal to zero
+ *
+	@param x FP2 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP2_iszilch(FP2 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP2 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP2_islarger(FP2 *x);
+
+
+/**	@brief Serialize out FP2  
+ *
+    @param b buffer for output
+	@param x FP2 number to be serialized
+ */
+extern void FP2_toBytes(char *b,FP2 *x);
+
+/**	@brief Serialize in FP2  
+ *
+	@param x FP2 number to be serialized
+    @param b buffer for input
+ */
+extern void FP2_fromBytes(FP2 *x,char *b);
+
+/**	@brief Conditional copy of FP2 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP2 instance, set to y if s!=0
+	@param y another FP2 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP2_cmove(FP2 *x, FP2 *y, int s);
+/**	@brief Tests for FP2 equal to one
+ *
+	@param x FP2 instance to be tested
+	@return 1 if x=1, else returns 0
+ */
+extern int FP2_isunity(FP2 *x);
+/**	@brief Tests for equality of two FP2s
+ *
+	@param x FP2 instance to be compared
+	@param y FP2 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP2_equals(FP2 *x, FP2 *y);
+/**	@brief Initialise FP2 from two FP numbers
+ *
+	@param x FP2 instance to be initialised
+	@param a FP to form real part of FP2
+	@param b FP to form imaginary part of FP2
+ */
+extern void FP2_from_FPs(FP2 *x, FP *a, FP *b);
+/**	@brief Initialise FP2 from two BIG integers
+ *
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+	@param b BIG to form imaginary part of FP2
+ */
+extern void FP2_from_BIGs(FP2 *x, B256_28::BIG a, B256_28::BIG b);
+
+
+/**	@brief Initialise FP2 from two integers
+ *
+	@param x FP2 instance to be initialised
+	@param a int to form real part of FP2
+	@param b int to form imaginary part of FP2
+ */
+extern void FP2_from_ints(FP2 *x, int a, int b);
+
+
+
+/**	@brief Initialise FP2 from single FP
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param an FP to form real part of FP2
+ */
+extern void FP2_from_FP(FP2 *x, FP *a);
+/**	@brief Initialise FP2 from single BIG
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+ */
+extern void FP2_from_BIG(FP2 *x, B256_28::BIG a);
+/**	@brief Copy FP2 to another FP2
+ *
+	@param x FP2 instance, on exit = y
+	@param y FP2 instance to be copied
+ */
+extern void FP2_copy(FP2 *x, FP2 *y);
+/**	@brief Set FP2 to zero
+ *
+	@param x FP2 instance to be set to zero
+ */
+extern void FP2_zero(FP2 *x);
+/**	@brief Set FP2 to unity
+ *
+	@param x FP2 instance to be set to one
+ */
+extern void FP2_one(FP2 *x);
+
+/**	@brief Copy from ROM to an FP2
+ *
+	@param w FP2 number to be copied to
+	@param a BIG real part to be copied from ROM
+	@param b BIG imag part to be copied from ROM
+ */
+extern void FP2_rcopy(FP2 *w,const B256_28::BIG a,const B256_28::BIG b);
+
+/**	@brief Sign of FP2
+ *
+	@param x FP2 instance
+	@return "sign" of FP2
+ */
+extern int FP2_sign(FP2 *x);
+
+/**	@brief Negation of FP2
+ *
+	@param x FP2 instance, on exit = -y
+	@param y FP2 instance
+ */
+extern void FP2_neg(FP2 *x, FP2 *y);
+
+
+/**	@brief Conjugation of FP2
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP2 instance, on exit = conj(y)
+	@param y FP2 instance
+ */
+extern void FP2_conj(FP2 *x, FP2 *y);
+/**	@brief addition of two FP2s
+ *
+	@param x FP2 instance, on exit = y+z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_add(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief subtraction of two FP2s
+ *
+	@param x FP2 instance, on exit = y-z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_sub(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Multiplication of an FP2 by an FP
+ *
+	@param x FP2 instance, on exit = y*b
+	@param y FP2 instance
+	@param b FP residue
+ */
+extern void FP2_pmul(FP2 *x, FP2 *y, FP *b);
+/**	@brief Multiplication of an FP2 by a small integer
+ *
+	@param x FP2 instance, on exit = y*i
+	@param y FP2 instance
+	@param i an integer
+ */
+extern void FP2_imul(FP2 *x, FP2 *y, int i);
+/**	@brief Squaring an FP2
+ *
+	@param x FP2 instance, on exit = y^2
+	@param y FP2 instance
+ */
+extern void FP2_sqr(FP2 *x, FP2 *y);
+/**	@brief Multiplication of two FP2s
+ *
+	@param x FP2 instance, on exit = y*z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_mul(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Formats and outputs an FP2 to the console
+ *
+	@param x FP2 instance
+ */
+extern void FP2_output(FP2 *x);
+/**	@brief Formats and outputs an FP2 to the console in raw form (for debugging)
+ *
+	@param x FP2 instance
+ */
+extern void FP2_rawoutput(FP2 *x);
+/**	@brief Inverting an FP2
+ *
+	@param x FP2 instance, on exit = 1/y
+	@param y FP2 instance
+ */
+extern void FP2_inv(FP2 *x, FP2 *y, FP *h);
+/**	@brief Divide an FP2 by 2
+ *
+	@param x FP2 instance, on exit = y/2
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_div2(FP2 *x, FP2 *y);
+/**	@brief Multiply an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x*(1+sqrt(-1))
+ */
+extern void FP2_mul_ip(FP2 *x);
+
+/**	@brief Divide an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x/(1+sqrt(-1))
+ */
+extern void FP2_div_ip(FP2 *x);
+/**	@brief Normalises the components of an FP2
+ *
+	@param x FP2 instance to be normalised
+ */
+extern void FP2_norm(FP2 *x);
+/**	@brief Reduces all components of possibly unreduced FP2 mod Modulus
+ *
+	@param x FP2 instance, on exit reduced mod Modulus
+ */
+extern void FP2_reduce(FP2 *x);
+/**	@brief Raises an FP2 to the power of a BIG
+ *
+	@param x FP2 instance, on exit = y^b
+	@param y FP2 instance
+	@param b BIG number
+ */
+extern void FP2_pow(FP2 *x, FP2 *y, B256_28::BIG b);
+
+/**	@brief Test FP2 for QR
+ *
+	@param x FP2 instance
+    @param h optional generated hint
+	@return true or false
+ */
+extern int FP2_qr(FP2 *x,FP *h);
+
+
+/**	@brief Square root of an FP2
+ *
+	@param x FP2 instance, on exit = sqrt(y)
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_sqrt(FP2 *x, FP2 *y, FP *h);
+
+/**	@brief Multiply an FP2 by sqrt(-1)
+ *
+	Note that -1 is QNR
+	@param x FP2 instance, on exit = x*sqrt(-1)
+ */
+extern void FP2_times_i(FP2 *x);
+
+/**	@brief Generate random FP2
+ *
+	@param x random FP2 number
+	@param rng random number generator
+ */
+extern void FP2_rand(FP2 *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp2_FP512BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp2_FP512BN.h
new file mode 100644
index 0000000..3dfcb9c
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp2_FP512BN.h
@@ -0,0 +1,306 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP2_FP512BN_H
+#define FP2_FP512BN_H
+
+#include "fp_FP512BN.h"
+
+using namespace core;
+
+namespace FP512BN {
+
+/**
+	@brief FP2 Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    FP a; /**< real part of FP2 */
+    FP b; /**< imaginary part of FP2 */
+} FP2;
+
+/* FP2 prototypes */
+
+/**	@brief Tests for FP2 equal to zero
+ *
+	@param x FP2 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP2_iszilch(FP2 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP2 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP2_islarger(FP2 *x);
+
+
+/**	@brief Serialize out FP2  
+ *
+    @param b buffer for output
+	@param x FP2 number to be serialized
+ */
+extern void FP2_toBytes(char *b,FP2 *x);
+
+/**	@brief Serialize in FP2  
+ *
+	@param x FP2 number to be serialized
+    @param b buffer for input
+ */
+extern void FP2_fromBytes(FP2 *x,char *b);
+
+/**	@brief Conditional copy of FP2 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP2 instance, set to y if s!=0
+	@param y another FP2 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP2_cmove(FP2 *x, FP2 *y, int s);
+/**	@brief Tests for FP2 equal to one
+ *
+	@param x FP2 instance to be tested
+	@return 1 if x=1, else returns 0
+ */
+extern int FP2_isunity(FP2 *x);
+/**	@brief Tests for equality of two FP2s
+ *
+	@param x FP2 instance to be compared
+	@param y FP2 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP2_equals(FP2 *x, FP2 *y);
+/**	@brief Initialise FP2 from two FP numbers
+ *
+	@param x FP2 instance to be initialised
+	@param a FP to form real part of FP2
+	@param b FP to form imaginary part of FP2
+ */
+extern void FP2_from_FPs(FP2 *x, FP *a, FP *b);
+/**	@brief Initialise FP2 from two BIG integers
+ *
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+	@param b BIG to form imaginary part of FP2
+ */
+extern void FP2_from_BIGs(FP2 *x, B512_29::BIG a, B512_29::BIG b);
+
+
+/**	@brief Initialise FP2 from two integers
+ *
+	@param x FP2 instance to be initialised
+	@param a int to form real part of FP2
+	@param b int to form imaginary part of FP2
+ */
+extern void FP2_from_ints(FP2 *x, int a, int b);
+
+
+
+/**	@brief Initialise FP2 from single FP
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param an FP to form real part of FP2
+ */
+extern void FP2_from_FP(FP2 *x, FP *a);
+/**	@brief Initialise FP2 from single BIG
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+ */
+extern void FP2_from_BIG(FP2 *x, B512_29::BIG a);
+/**	@brief Copy FP2 to another FP2
+ *
+	@param x FP2 instance, on exit = y
+	@param y FP2 instance to be copied
+ */
+extern void FP2_copy(FP2 *x, FP2 *y);
+/**	@brief Set FP2 to zero
+ *
+	@param x FP2 instance to be set to zero
+ */
+extern void FP2_zero(FP2 *x);
+/**	@brief Set FP2 to unity
+ *
+	@param x FP2 instance to be set to one
+ */
+extern void FP2_one(FP2 *x);
+
+/**	@brief Copy from ROM to an FP2
+ *
+	@param w FP2 number to be copied to
+	@param a BIG real part to be copied from ROM
+	@param b BIG imag part to be copied from ROM
+ */
+extern void FP2_rcopy(FP2 *w,const B512_29::BIG a,const B512_29::BIG b);
+
+/**	@brief Sign of FP2
+ *
+	@param x FP2 instance
+	@return "sign" of FP2
+ */
+extern int FP2_sign(FP2 *x);
+
+/**	@brief Negation of FP2
+ *
+	@param x FP2 instance, on exit = -y
+	@param y FP2 instance
+ */
+extern void FP2_neg(FP2 *x, FP2 *y);
+
+
+/**	@brief Conjugation of FP2
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP2 instance, on exit = conj(y)
+	@param y FP2 instance
+ */
+extern void FP2_conj(FP2 *x, FP2 *y);
+/**	@brief addition of two FP2s
+ *
+	@param x FP2 instance, on exit = y+z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_add(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief subtraction of two FP2s
+ *
+	@param x FP2 instance, on exit = y-z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_sub(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Multiplication of an FP2 by an FP
+ *
+	@param x FP2 instance, on exit = y*b
+	@param y FP2 instance
+	@param b FP residue
+ */
+extern void FP2_pmul(FP2 *x, FP2 *y, FP *b);
+/**	@brief Multiplication of an FP2 by a small integer
+ *
+	@param x FP2 instance, on exit = y*i
+	@param y FP2 instance
+	@param i an integer
+ */
+extern void FP2_imul(FP2 *x, FP2 *y, int i);
+/**	@brief Squaring an FP2
+ *
+	@param x FP2 instance, on exit = y^2
+	@param y FP2 instance
+ */
+extern void FP2_sqr(FP2 *x, FP2 *y);
+/**	@brief Multiplication of two FP2s
+ *
+	@param x FP2 instance, on exit = y*z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_mul(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Formats and outputs an FP2 to the console
+ *
+	@param x FP2 instance
+ */
+extern void FP2_output(FP2 *x);
+/**	@brief Formats and outputs an FP2 to the console in raw form (for debugging)
+ *
+	@param x FP2 instance
+ */
+extern void FP2_rawoutput(FP2 *x);
+/**	@brief Inverting an FP2
+ *
+	@param x FP2 instance, on exit = 1/y
+	@param y FP2 instance
+ */
+extern void FP2_inv(FP2 *x, FP2 *y, FP *h);
+/**	@brief Divide an FP2 by 2
+ *
+	@param x FP2 instance, on exit = y/2
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_div2(FP2 *x, FP2 *y);
+/**	@brief Multiply an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x*(1+sqrt(-1))
+ */
+extern void FP2_mul_ip(FP2 *x);
+
+/**	@brief Divide an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x/(1+sqrt(-1))
+ */
+extern void FP2_div_ip(FP2 *x);
+/**	@brief Normalises the components of an FP2
+ *
+	@param x FP2 instance to be normalised
+ */
+extern void FP2_norm(FP2 *x);
+/**	@brief Reduces all components of possibly unreduced FP2 mod Modulus
+ *
+	@param x FP2 instance, on exit reduced mod Modulus
+ */
+extern void FP2_reduce(FP2 *x);
+/**	@brief Raises an FP2 to the power of a BIG
+ *
+	@param x FP2 instance, on exit = y^b
+	@param y FP2 instance
+	@param b BIG number
+ */
+extern void FP2_pow(FP2 *x, FP2 *y, B512_29::BIG b);
+
+/**	@brief Test FP2 for QR
+ *
+	@param x FP2 instance
+    @param h optional generated hint
+	@return true or false
+ */
+extern int FP2_qr(FP2 *x,FP *h);
+
+
+/**	@brief Square root of an FP2
+ *
+	@param x FP2 instance, on exit = sqrt(y)
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_sqrt(FP2 *x, FP2 *y, FP *h);
+
+/**	@brief Multiply an FP2 by sqrt(-1)
+ *
+	Note that -1 is QNR
+	@param x FP2 instance, on exit = x*sqrt(-1)
+ */
+extern void FP2_times_i(FP2 *x);
+
+/**	@brief Generate random FP2
+ *
+	@param x random FP2 number
+	@param rng random number generator
+ */
+extern void FP2_rand(FP2 *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp48_BLS48286.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp48_BLS48286.h
new file mode 100644
index 0000000..3348dcd
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp48_BLS48286.h
@@ -0,0 +1,231 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP48_BLS48286_H
+#define FP48_BLS48286_H
+
+#include "fp16_BLS48286.h"
+
+using namespace core;
+
+namespace BLS48286 {
+/**
+	@brief FP12 Structure - towered over three FP16
+*/
+
+typedef struct
+{
+    FP16 a; /**< first part of FP12 */
+    FP16 b; /**< second part of FP12 */
+    FP16 c; /**< third part of FP12 */
+    int type;
+} FP48;
+
+extern const B288_29::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B288_29::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+/* FP48 prototypes */
+/**	@brief Tests for FP48 equal to zero
+ *
+	@param x FP48 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP48_iszilch(FP48 *x);
+/**	@brief Tests for FP48 equal to unity
+ *
+	@param x FP48 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP48_isunity(FP48 *x);
+/**	@brief Copy FP48 to another FP48
+ *
+	@param x FP48 instance, on exit = y
+	@param y FP48 instance to be copied
+ */
+extern void FP48_copy(FP48 *x, FP48 *y);
+/**	@brief Set FP48 to unity
+ *
+	@param x FP48 instance to be set to one
+ */
+extern void FP48_one(FP48 *x);
+
+/**	@brief Set FP48 to zero
+ *
+	@param x FP48 instance to be set to zero
+ */
+extern void FP48_zero(FP48 *x);
+
+/**	@brief Tests for equality of two FP48s
+ *
+	@param x FP48 instance to be compared
+	@param y FP48 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP48_equals(FP48 *x, FP48 *y);
+/**	@brief Conjugation of FP48
+ *
+	If y=(a,b,c) (where a,b,c are its three FP16 components) on exit x=(conj(a),-conj(b),conj(c))
+	@param x FP48 instance, on exit = conj(y)
+	@param y FP48 instance
+ */
+extern void FP48_conj(FP48 *x, FP48 *y);
+/**	@brief Initialise FP48 from single FP16
+ *
+	Sets first FP16 component of an FP48, other components set to zero
+	@param x FP48 instance to be initialised
+	@param a FP16 to form first part of FP48
+ */
+extern void FP48_from_FP16(FP48 *x, FP16 *a);
+/**	@brief Initialise FP48 from three FP16s
+ *
+	@param x FP48 instance to be initialised
+	@param a FP16 to form first part of FP48
+	@param b FP16 to form second part of FP48
+	@param c FP16 to form third part of FP48
+ */
+extern void FP48_from_FP16s(FP48 *x, FP16 *a, FP16* b, FP16 *c);
+/**	@brief Fast Squaring of an FP48 in "unitary" form
+ *
+	@param x FP48 instance, on exit = y^2
+	@param y FP16 instance, must be unitary
+ */
+extern void FP48_usqr(FP48 *x, FP48 *y);
+/**	@brief Squaring an FP48
+ *
+	@param x FP48 instance, on exit = y^2
+	@param y FP48 instance
+ */
+extern void FP48_sqr(FP48 *x, FP48 *y);
+/**	@brief Fast multiplication of two sparse FP24s that arises from ATE pairing line functions
+ *
+	@param x FP48 instance, on exit = x*y
+	@param y FP48 instance, of special form
+ */
+extern void FP48_smul(FP48 *x, FP48 *y);
+
+/**	@brief Fast multiplication of what may be sparse multiplicands
+ *
+	@param x FP48 instance, on exit = x*y
+	@param y FP48 instance, of special form
+ */
+extern void FP48_ssmul(FP48 *x, FP48 *y);
+/**	@brief Full unconditional Multiplication of two FP24s
+ *
+	@param x FP48 instance, on exit = x*y
+	@param y FP48 instance, the multiplier
+ */
+extern void FP48_mul(FP48 *x, FP48 *y);
+/**	@brief Inverting an FP48
+ *
+	@param x FP48 instance, on exit = 1/y
+	@param y FP48 instance
+ */
+extern void FP48_inv(FP48 *x, FP48 *y);
+/**	@brief Raises an FP48 to the power of a BIG
+ *
+	@param r FP48 instance, on exit = y^b
+	@param x FP48 instance
+	@param b BIG number
+ */
+extern void FP48_pow(FP48 *r, FP48 *x, B288_29::BIG b);
+
+//extern void FP48_ppow(FP48 *r,FP48 *x,B288_29::BIG b);
+
+/**	@brief Raises an FP48 instance x to a small integer power, side-channel resistant
+ *
+	@param x FP48 instance, on exit = x^i
+	@param i small integer exponent
+	@param b maximum number of bits in exponent
+ */
+extern void FP48_pinpow(FP48 *x, int i, int b);
+
+/**	@brief Raises an FP48 instance x to a BIG power, compressed to FP16
+ *
+	@param c FP16 instance, on exit = x^(e mod r) as FP16
+	@param x FP48 input
+	@param e BIG exponent
+	@param r BIG group order
+ */
+extern void FP48_compow(FP16 *c, FP48 *x, B288_29::BIG e, B288_29::BIG r);
+
+/**	@brief Calculate Pi x[i]^b[i] for i=0 to 15, side-channel resistant
+ *
+	@param r FP48 instance, on exit = Pi x[i]^b[i] for i=0 to 15
+	@param x FP48 array with 16 FP48s
+	@param b BIG array of 16 exponents
+ */
+extern void FP48_pow16(FP48 *r, FP48 *x, B288_29::BIG *b);
+
+
+/**	@brief Raises an FP48 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP48 instance, on exit = x^p^n
+	@param f FP2 precalculated Frobenius constant
+	@param n power of p
+ */
+extern void FP48_frob(FP48 *x, FP2 *f, int n);
+
+/**	@brief Reduces all components of possibly unreduced FP48 mod Modulus
+ *
+	@param x FP48 instance, on exit reduced mod Modulus
+ */
+extern void FP48_reduce(FP48 *x);
+/**	@brief Normalises the components of an FP48
+ *
+	@param x FP48 instance to be normalised
+ */
+extern void FP48_norm(FP48 *x);
+/**	@brief Formats and outputs an FP48 to the console
+ *
+	@param x FP48 instance to be printed
+ */
+extern void FP48_output(FP48 *x);
+/**	@brief Formats and outputs an FP48 instance to an octet string
+ *
+	Serializes the components of an FP48 to big-endian base 256 form.
+	@param S output octet string
+	@param x FP48 instance to be converted to an octet string
+ */
+extern void FP48_toOctet(octet *S, FP48 *x);
+/**	@brief Creates an FP48 instance from an octet string
+ *
+	De-serializes the components of an FP48 to create an FP48 from big-endian base 256 components.
+	@param x FP48 instance to be created from an octet string
+	@param S input octet string
+
+ */
+extern void FP48_fromOctet(FP48 *x, octet *S);
+/**	@brief Calculate the trace of an FP48
+ *
+	@param t FP16 trace of x, on exit = tr(x)
+	@param x FP48 instance
+
+ */
+extern void FP48_trace(FP16 *t, FP48 *x);
+
+/**	@brief Conditional copy of FP48 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP48 instance, set to y if s!=0
+	@param y another FP48 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP48_cmove(FP48 *x, FP48 *y, int s);
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp48_BLS48556.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp48_BLS48556.h
new file mode 100644
index 0000000..f39741c
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp48_BLS48556.h
@@ -0,0 +1,231 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP48_BLS48556_H
+#define FP48_BLS48556_H
+
+#include "fp16_BLS48556.h"
+
+using namespace core;
+
+namespace BLS48556 {
+/**
+	@brief FP12 Structure - towered over three FP16
+*/
+
+typedef struct
+{
+    FP16 a; /**< first part of FP12 */
+    FP16 b; /**< second part of FP12 */
+    FP16 c; /**< third part of FP12 */
+    int type;
+} FP48;
+
+extern const B560_29::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B560_29::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+/* FP48 prototypes */
+/**	@brief Tests for FP48 equal to zero
+ *
+	@param x FP48 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP48_iszilch(FP48 *x);
+/**	@brief Tests for FP48 equal to unity
+ *
+	@param x FP48 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP48_isunity(FP48 *x);
+/**	@brief Copy FP48 to another FP48
+ *
+	@param x FP48 instance, on exit = y
+	@param y FP48 instance to be copied
+ */
+extern void FP48_copy(FP48 *x, FP48 *y);
+/**	@brief Set FP48 to unity
+ *
+	@param x FP48 instance to be set to one
+ */
+extern void FP48_one(FP48 *x);
+
+/**	@brief Set FP48 to zero
+ *
+	@param x FP48 instance to be set to zero
+ */
+extern void FP48_zero(FP48 *x);
+
+/**	@brief Tests for equality of two FP48s
+ *
+	@param x FP48 instance to be compared
+	@param y FP48 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP48_equals(FP48 *x, FP48 *y);
+/**	@brief Conjugation of FP48
+ *
+	If y=(a,b,c) (where a,b,c are its three FP16 components) on exit x=(conj(a),-conj(b),conj(c))
+	@param x FP48 instance, on exit = conj(y)
+	@param y FP48 instance
+ */
+extern void FP48_conj(FP48 *x, FP48 *y);
+/**	@brief Initialise FP48 from single FP16
+ *
+	Sets first FP16 component of an FP48, other components set to zero
+	@param x FP48 instance to be initialised
+	@param a FP16 to form first part of FP48
+ */
+extern void FP48_from_FP16(FP48 *x, FP16 *a);
+/**	@brief Initialise FP48 from three FP16s
+ *
+	@param x FP48 instance to be initialised
+	@param a FP16 to form first part of FP48
+	@param b FP16 to form second part of FP48
+	@param c FP16 to form third part of FP48
+ */
+extern void FP48_from_FP16s(FP48 *x, FP16 *a, FP16* b, FP16 *c);
+/**	@brief Fast Squaring of an FP48 in "unitary" form
+ *
+	@param x FP48 instance, on exit = y^2
+	@param y FP16 instance, must be unitary
+ */
+extern void FP48_usqr(FP48 *x, FP48 *y);
+/**	@brief Squaring an FP48
+ *
+	@param x FP48 instance, on exit = y^2
+	@param y FP48 instance
+ */
+extern void FP48_sqr(FP48 *x, FP48 *y);
+/**	@brief Fast multiplication of two sparse FP24s that arises from ATE pairing line functions
+ *
+	@param x FP48 instance, on exit = x*y
+	@param y FP48 instance, of special form
+ */
+extern void FP48_smul(FP48 *x, FP48 *y);
+
+/**	@brief Fast multiplication of what may be sparse multiplicands
+ *
+	@param x FP48 instance, on exit = x*y
+	@param y FP48 instance, of special form
+ */
+extern void FP48_ssmul(FP48 *x, FP48 *y);
+/**	@brief Full unconditional Multiplication of two FP24s
+ *
+	@param x FP48 instance, on exit = x*y
+	@param y FP48 instance, the multiplier
+ */
+extern void FP48_mul(FP48 *x, FP48 *y);
+/**	@brief Inverting an FP48
+ *
+	@param x FP48 instance, on exit = 1/y
+	@param y FP48 instance
+ */
+extern void FP48_inv(FP48 *x, FP48 *y);
+/**	@brief Raises an FP48 to the power of a BIG
+ *
+	@param r FP48 instance, on exit = y^b
+	@param x FP48 instance
+	@param b BIG number
+ */
+extern void FP48_pow(FP48 *r, FP48 *x, B560_29::BIG b);
+
+//extern void FP48_ppow(FP48 *r,FP48 *x,B560_29::BIG b);
+
+/**	@brief Raises an FP48 instance x to a small integer power, side-channel resistant
+ *
+	@param x FP48 instance, on exit = x^i
+	@param i small integer exponent
+	@param b maximum number of bits in exponent
+ */
+extern void FP48_pinpow(FP48 *x, int i, int b);
+
+/**	@brief Raises an FP48 instance x to a BIG power, compressed to FP16
+ *
+	@param c FP16 instance, on exit = x^(e mod r) as FP16
+	@param x FP48 input
+	@param e BIG exponent
+	@param r BIG group order
+ */
+extern void FP48_compow(FP16 *c, FP48 *x, B560_29::BIG e, B560_29::BIG r);
+
+/**	@brief Calculate Pi x[i]^b[i] for i=0 to 15, side-channel resistant
+ *
+	@param r FP48 instance, on exit = Pi x[i]^b[i] for i=0 to 15
+	@param x FP48 array with 16 FP48s
+	@param b BIG array of 16 exponents
+ */
+extern void FP48_pow16(FP48 *r, FP48 *x, B560_29::BIG *b);
+
+
+/**	@brief Raises an FP48 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP48 instance, on exit = x^p^n
+	@param f FP2 precalculated Frobenius constant
+	@param n power of p
+ */
+extern void FP48_frob(FP48 *x, FP2 *f, int n);
+
+/**	@brief Reduces all components of possibly unreduced FP48 mod Modulus
+ *
+	@param x FP48 instance, on exit reduced mod Modulus
+ */
+extern void FP48_reduce(FP48 *x);
+/**	@brief Normalises the components of an FP48
+ *
+	@param x FP48 instance to be normalised
+ */
+extern void FP48_norm(FP48 *x);
+/**	@brief Formats and outputs an FP48 to the console
+ *
+	@param x FP48 instance to be printed
+ */
+extern void FP48_output(FP48 *x);
+/**	@brief Formats and outputs an FP48 instance to an octet string
+ *
+	Serializes the components of an FP48 to big-endian base 256 form.
+	@param S output octet string
+	@param x FP48 instance to be converted to an octet string
+ */
+extern void FP48_toOctet(octet *S, FP48 *x);
+/**	@brief Creates an FP48 instance from an octet string
+ *
+	De-serializes the components of an FP48 to create an FP48 from big-endian base 256 components.
+	@param x FP48 instance to be created from an octet string
+	@param S input octet string
+
+ */
+extern void FP48_fromOctet(FP48 *x, octet *S);
+/**	@brief Calculate the trace of an FP48
+ *
+	@param t FP16 trace of x, on exit = tr(x)
+	@param x FP48 instance
+
+ */
+extern void FP48_trace(FP16 *t, FP48 *x);
+
+/**	@brief Conditional copy of FP48 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP48 instance, set to y if s!=0
+	@param y another FP48 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP48_cmove(FP48 *x, FP48 *y, int s);
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp48_BLS48581.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp48_BLS48581.h
new file mode 100644
index 0000000..c11a808
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp48_BLS48581.h
@@ -0,0 +1,231 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP48_BLS48581_H
+#define FP48_BLS48581_H
+
+#include "fp16_BLS48581.h"
+
+using namespace core;
+
+namespace BLS48581 {
+/**
+	@brief FP12 Structure - towered over three FP16
+*/
+
+typedef struct
+{
+    FP16 a; /**< first part of FP12 */
+    FP16 b; /**< second part of FP12 */
+    FP16 c; /**< third part of FP12 */
+    int type;
+} FP48;
+
+extern const B584_29::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B584_29::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+/* FP48 prototypes */
+/**	@brief Tests for FP48 equal to zero
+ *
+	@param x FP48 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP48_iszilch(FP48 *x);
+/**	@brief Tests for FP48 equal to unity
+ *
+	@param x FP48 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP48_isunity(FP48 *x);
+/**	@brief Copy FP48 to another FP48
+ *
+	@param x FP48 instance, on exit = y
+	@param y FP48 instance to be copied
+ */
+extern void FP48_copy(FP48 *x, FP48 *y);
+/**	@brief Set FP48 to unity
+ *
+	@param x FP48 instance to be set to one
+ */
+extern void FP48_one(FP48 *x);
+
+/**	@brief Set FP48 to zero
+ *
+	@param x FP48 instance to be set to zero
+ */
+extern void FP48_zero(FP48 *x);
+
+/**	@brief Tests for equality of two FP48s
+ *
+	@param x FP48 instance to be compared
+	@param y FP48 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP48_equals(FP48 *x, FP48 *y);
+/**	@brief Conjugation of FP48
+ *
+	If y=(a,b,c) (where a,b,c are its three FP16 components) on exit x=(conj(a),-conj(b),conj(c))
+	@param x FP48 instance, on exit = conj(y)
+	@param y FP48 instance
+ */
+extern void FP48_conj(FP48 *x, FP48 *y);
+/**	@brief Initialise FP48 from single FP16
+ *
+	Sets first FP16 component of an FP48, other components set to zero
+	@param x FP48 instance to be initialised
+	@param a FP16 to form first part of FP48
+ */
+extern void FP48_from_FP16(FP48 *x, FP16 *a);
+/**	@brief Initialise FP48 from three FP16s
+ *
+	@param x FP48 instance to be initialised
+	@param a FP16 to form first part of FP48
+	@param b FP16 to form second part of FP48
+	@param c FP16 to form third part of FP48
+ */
+extern void FP48_from_FP16s(FP48 *x, FP16 *a, FP16* b, FP16 *c);
+/**	@brief Fast Squaring of an FP48 in "unitary" form
+ *
+	@param x FP48 instance, on exit = y^2
+	@param y FP16 instance, must be unitary
+ */
+extern void FP48_usqr(FP48 *x, FP48 *y);
+/**	@brief Squaring an FP48
+ *
+	@param x FP48 instance, on exit = y^2
+	@param y FP48 instance
+ */
+extern void FP48_sqr(FP48 *x, FP48 *y);
+/**	@brief Fast multiplication of two sparse FP24s that arises from ATE pairing line functions
+ *
+	@param x FP48 instance, on exit = x*y
+	@param y FP48 instance, of special form
+ */
+extern void FP48_smul(FP48 *x, FP48 *y);
+
+/**	@brief Fast multiplication of what may be sparse multiplicands
+ *
+	@param x FP48 instance, on exit = x*y
+	@param y FP48 instance, of special form
+ */
+extern void FP48_ssmul(FP48 *x, FP48 *y);
+/**	@brief Full unconditional Multiplication of two FP24s
+ *
+	@param x FP48 instance, on exit = x*y
+	@param y FP48 instance, the multiplier
+ */
+extern void FP48_mul(FP48 *x, FP48 *y);
+/**	@brief Inverting an FP48
+ *
+	@param x FP48 instance, on exit = 1/y
+	@param y FP48 instance
+ */
+extern void FP48_inv(FP48 *x, FP48 *y);
+/**	@brief Raises an FP48 to the power of a BIG
+ *
+	@param r FP48 instance, on exit = y^b
+	@param x FP48 instance
+	@param b BIG number
+ */
+extern void FP48_pow(FP48 *r, FP48 *x, B584_29::BIG b);
+
+//extern void FP48_ppow(FP48 *r,FP48 *x,B584_29::BIG b);
+
+/**	@brief Raises an FP48 instance x to a small integer power, side-channel resistant
+ *
+	@param x FP48 instance, on exit = x^i
+	@param i small integer exponent
+	@param b maximum number of bits in exponent
+ */
+extern void FP48_pinpow(FP48 *x, int i, int b);
+
+/**	@brief Raises an FP48 instance x to a BIG power, compressed to FP16
+ *
+	@param c FP16 instance, on exit = x^(e mod r) as FP16
+	@param x FP48 input
+	@param e BIG exponent
+	@param r BIG group order
+ */
+extern void FP48_compow(FP16 *c, FP48 *x, B584_29::BIG e, B584_29::BIG r);
+
+/**	@brief Calculate Pi x[i]^b[i] for i=0 to 15, side-channel resistant
+ *
+	@param r FP48 instance, on exit = Pi x[i]^b[i] for i=0 to 15
+	@param x FP48 array with 16 FP48s
+	@param b BIG array of 16 exponents
+ */
+extern void FP48_pow16(FP48 *r, FP48 *x, B584_29::BIG *b);
+
+
+/**	@brief Raises an FP48 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP48 instance, on exit = x^p^n
+	@param f FP2 precalculated Frobenius constant
+	@param n power of p
+ */
+extern void FP48_frob(FP48 *x, FP2 *f, int n);
+
+/**	@brief Reduces all components of possibly unreduced FP48 mod Modulus
+ *
+	@param x FP48 instance, on exit reduced mod Modulus
+ */
+extern void FP48_reduce(FP48 *x);
+/**	@brief Normalises the components of an FP48
+ *
+	@param x FP48 instance to be normalised
+ */
+extern void FP48_norm(FP48 *x);
+/**	@brief Formats and outputs an FP48 to the console
+ *
+	@param x FP48 instance to be printed
+ */
+extern void FP48_output(FP48 *x);
+/**	@brief Formats and outputs an FP48 instance to an octet string
+ *
+	Serializes the components of an FP48 to big-endian base 256 form.
+	@param S output octet string
+	@param x FP48 instance to be converted to an octet string
+ */
+extern void FP48_toOctet(octet *S, FP48 *x);
+/**	@brief Creates an FP48 instance from an octet string
+ *
+	De-serializes the components of an FP48 to create an FP48 from big-endian base 256 components.
+	@param x FP48 instance to be created from an octet string
+	@param S input octet string
+
+ */
+extern void FP48_fromOctet(FP48 *x, octet *S);
+/**	@brief Calculate the trace of an FP48
+ *
+	@param t FP16 trace of x, on exit = tr(x)
+	@param x FP48 instance
+
+ */
+extern void FP48_trace(FP16 *t, FP48 *x);
+
+/**	@brief Conditional copy of FP48 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP48 instance, set to y if s!=0
+	@param y another FP48 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP48_cmove(FP48 *x, FP48 *y, int s);
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp4_BLS12381.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp4_BLS12381.h
new file mode 100644
index 0000000..61671a1
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp4_BLS12381.h
@@ -0,0 +1,349 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP4_BLS12381_H
+#define FP4_BLS12381_H
+
+#include "fp2_BLS12381.h"
+#include "config_curve_BLS12381.h"
+
+using namespace core;
+
+namespace BLS12381 {
+
+/**
+	@brief FP4 Structure - towered over two FP2
+*/
+
+typedef struct
+{
+    FP2 a; /**< real part of FP4 */
+    FP2 b; /**< imaginary part of FP4 */
+} FP4;
+
+
+/* FP4 prototypes */
+/**	@brief Tests for FP4 equal to zero
+ *
+	@param x FP4 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP4_iszilch(FP4 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP4 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP4_islarger(FP4 *x);
+
+/**	@brief Serialize out FP4  
+ *
+    @param b buffer for output
+	@param x FP4 number to be serialized
+ */
+extern void FP4_toBytes(char *b,FP4 *x);
+
+/**	@brief Serialize in FP4  
+ *
+	@param x FP4 number to be serialized
+    @param b buffer for input
+ */
+extern void FP4_fromBytes(FP4 *x,char *b);
+
+/**	@brief Tests for FP4 equal to unity
+ *
+	@param x FP4 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP4_isunity(FP4 *x);
+/**	@brief Tests for equality of two FP4s
+ *
+	@param x FP4 instance to be compared
+	@param y FP4 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP4_equals(FP4 *x, FP4 *y);
+/**	@brief Tests for FP4 having only a real part and no imaginary part
+ *
+	@param x FP4 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP4_isreal(FP4 *x);
+/**	@brief Initialise FP4 from two FP2s
+ *
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+	@param b FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2s(FP4 *x, FP2 *a, FP2 *b);
+/**	@brief Initialise FP4 from single FP2
+ *
+	Imaginary part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+ */
+extern void FP4_from_FP2(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP2
+ *
+	real part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2H(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP
+ *
+	@param x FP4 instance to be initialised
+	@param a FP to form real part of FP4
+ */
+extern void FP4_from_FP(FP4 *x, FP *a);
+
+/**	@brief Copy FP4 to another FP4
+ *
+	@param x FP4 instance, on exit = y
+	@param y FP4 instance to be copied
+ */
+extern void FP4_copy(FP4 *x, FP4 *y);
+/**	@brief Set FP4 to zero
+ *
+	@param x FP4 instance to be set to zero
+ */
+extern void FP4_zero(FP4 *x);
+/**	@brief Set FP4 to unity
+ *
+	@param x FP4 instance to be set to one
+ */
+extern void FP4_one(FP4 *x);
+
+/**	@brief Sign of FP4
+ *
+	@param x FP4 instance
+	@return "sign" of FP4
+ */
+extern int FP4_sign(FP4 *x);
+
+/**	@brief Negation of FP4
+ *
+	@param x FP4 instance, on exit = -y
+	@param y FP4 instance
+ */
+extern void FP4_neg(FP4 *x, FP4 *y);
+/**	@brief Conjugation of FP4
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP4 instance, on exit = conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_conj(FP4 *x, FP4 *y);
+/**	@brief Negative conjugation of FP4
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP4 instance, on exit = -conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_nconj(FP4 *x, FP4 *y);
+/**	@brief addition of two FP4s
+ *
+	@param x FP4 instance, on exit = y+z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_add(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief subtraction of two FP4s
+ *
+	@param x FP4 instance, on exit = y-z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_sub(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Multiplication of an FP4 by an FP2
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP2 multiplier
+ */
+extern void FP4_pmul(FP4 *x, FP4 *y, FP2 *a);
+
+
+/**	@brief Multiplication of an FP4 by an FP
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP multiplier
+ */
+extern void FP4_qmul(FP4 *x, FP4 *y, FP *a);
+
+/**	@brief Multiplication of an FP4 by a small integer
+ *
+	@param x FP4 instance, on exit = y*i
+	@param y FP4 instance
+	@param i an integer
+ */
+extern void FP4_imul(FP4 *x, FP4 *y, int i);
+/**	@brief Squaring an FP4
+ *
+	@param x FP4 instance, on exit = y^2
+	@param y FP4 instance
+ */
+extern void FP4_sqr(FP4 *x, FP4 *y);
+/**	@brief Multiplication of two FP4s
+ *
+	@param x FP4 instance, on exit = y*z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_mul(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Inverting an FP4
+ *
+	@param x FP4 instance, on exit = 1/y
+	@param y FP4 instance
+    @param h optional input hint
+ */
+extern void FP4_inv(FP4 *x, FP4 *y, FP *h);
+
+/**	@brief Divide an FP4 by 2
+ *
+	@param x FP4 instance, on exit = y/2
+	@param y FP4 instance
+ */
+extern void FP4_div2(FP4 *x, FP4 *y);
+
+
+/**	@brief Formats and outputs an FP4 to the console
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_output(FP4 *x);
+/**	@brief Formats and outputs an FP4 to the console in raw form (for debugging)
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_rawoutput(FP4 *x);
+/**	@brief multiplies an FP4 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP4 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP4_times_i(FP4 *x);
+/**	@brief Normalises the components of an FP4
+ *
+	@param x FP4 instance to be normalised
+ */
+extern void FP4_norm(FP4 *x);
+/**	@brief Reduces all components of possibly unreduced FP4 mod Modulus
+ *
+	@param x FP4 instance, on exit reduced mod Modulus
+ */
+extern void FP4_reduce(FP4 *x);
+/**	@brief Raises an FP4 to the power of a BIG
+ *
+	@param x FP4 instance, on exit = y^b
+	@param y FP4 instance
+	@param b BIG number
+ */
+extern void FP4_pow(FP4 *x, FP4 *y, B384_29::BIG b);
+/**	@brief Raises an FP4 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP4 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP4_frob(FP4 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP4 instance, on exit = w*x-conj(x)*y+z
+	@param w FP4 instance
+	@param x FP4 instance
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_xtr_A(FP4 *r, FP4 *w, FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP4 instance, on exit = x^2-2*conj(x)
+	@param x FP4 instance
+ */
+extern void FP4_xtr_D(FP4 *r, FP4 *x);
+/**	@brief Calculates FP4 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP4 instance, on exit = trace(w^b)
+	@param x FP4 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP4_xtr_pow(FP4 *r, FP4 *x, B384_29::BIG b);
+/**	@brief Calculates FP4 trace of c^a.d^b, where c and d are derived from FP4 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP4 instance, on exit = trace(c^a.d^b)
+	@param c FP4 instance, trace of an FP12
+	@param d FP4 instance, trace of an FP12
+	@param e FP4 instance, trace of an FP12
+	@param f FP4 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP4_xtr_pow2(FP4 *r, FP4 *c, FP4 *d, FP4 *e, FP4 *f, B384_29::BIG a, B384_29::BIG b);
+
+/**	@brief Test FP4 for QR
+ * 
+	@param r FP4 instance
+    @param h optional generated hint
+	@return 1 x is a QR, otherwise 0
+ */
+extern int  FP4_qr(FP4 *r, FP *h);
+
+/**	@brief Calculate square root of an FP4
+ *
+	Square root
+	@param r FP4 instance, on exit = sqrt(x)
+	@param x FP4 instance
+    @param h optional input hint
+ */
+extern void  FP4_sqrt(FP4 *r, FP4 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP4 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP4 instance, set to y if s!=0
+	@param y another FP4 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP4_cmove(FP4 *x, FP4 *y, int s);
+
+
+/**	@brief Divide FP4 number by QNR
+ *
+	Divide FP4 by the QNR
+	@param x FP4 instance
+ */
+extern void FP4_div_i(FP4 *x);
+
+/**	@brief Generate random FP4
+ *
+	@param x random FP4 number
+	@param rng random number generator
+ */
+extern void FP4_rand(FP4 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp4_BLS12383.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp4_BLS12383.h
new file mode 100644
index 0000000..b3ba0fd
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp4_BLS12383.h
@@ -0,0 +1,349 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP4_BLS12383_H
+#define FP4_BLS12383_H
+
+#include "fp2_BLS12383.h"
+#include "config_curve_BLS12383.h"
+
+using namespace core;
+
+namespace BLS12383 {
+
+/**
+	@brief FP4 Structure - towered over two FP2
+*/
+
+typedef struct
+{
+    FP2 a; /**< real part of FP4 */
+    FP2 b; /**< imaginary part of FP4 */
+} FP4;
+
+
+/* FP4 prototypes */
+/**	@brief Tests for FP4 equal to zero
+ *
+	@param x FP4 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP4_iszilch(FP4 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP4 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP4_islarger(FP4 *x);
+
+/**	@brief Serialize out FP4  
+ *
+    @param b buffer for output
+	@param x FP4 number to be serialized
+ */
+extern void FP4_toBytes(char *b,FP4 *x);
+
+/**	@brief Serialize in FP4  
+ *
+	@param x FP4 number to be serialized
+    @param b buffer for input
+ */
+extern void FP4_fromBytes(FP4 *x,char *b);
+
+/**	@brief Tests for FP4 equal to unity
+ *
+	@param x FP4 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP4_isunity(FP4 *x);
+/**	@brief Tests for equality of two FP4s
+ *
+	@param x FP4 instance to be compared
+	@param y FP4 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP4_equals(FP4 *x, FP4 *y);
+/**	@brief Tests for FP4 having only a real part and no imaginary part
+ *
+	@param x FP4 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP4_isreal(FP4 *x);
+/**	@brief Initialise FP4 from two FP2s
+ *
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+	@param b FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2s(FP4 *x, FP2 *a, FP2 *b);
+/**	@brief Initialise FP4 from single FP2
+ *
+	Imaginary part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+ */
+extern void FP4_from_FP2(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP2
+ *
+	real part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2H(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP
+ *
+	@param x FP4 instance to be initialised
+	@param a FP to form real part of FP4
+ */
+extern void FP4_from_FP(FP4 *x, FP *a);
+
+/**	@brief Copy FP4 to another FP4
+ *
+	@param x FP4 instance, on exit = y
+	@param y FP4 instance to be copied
+ */
+extern void FP4_copy(FP4 *x, FP4 *y);
+/**	@brief Set FP4 to zero
+ *
+	@param x FP4 instance to be set to zero
+ */
+extern void FP4_zero(FP4 *x);
+/**	@brief Set FP4 to unity
+ *
+	@param x FP4 instance to be set to one
+ */
+extern void FP4_one(FP4 *x);
+
+/**	@brief Sign of FP4
+ *
+	@param x FP4 instance
+	@return "sign" of FP4
+ */
+extern int FP4_sign(FP4 *x);
+
+/**	@brief Negation of FP4
+ *
+	@param x FP4 instance, on exit = -y
+	@param y FP4 instance
+ */
+extern void FP4_neg(FP4 *x, FP4 *y);
+/**	@brief Conjugation of FP4
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP4 instance, on exit = conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_conj(FP4 *x, FP4 *y);
+/**	@brief Negative conjugation of FP4
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP4 instance, on exit = -conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_nconj(FP4 *x, FP4 *y);
+/**	@brief addition of two FP4s
+ *
+	@param x FP4 instance, on exit = y+z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_add(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief subtraction of two FP4s
+ *
+	@param x FP4 instance, on exit = y-z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_sub(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Multiplication of an FP4 by an FP2
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP2 multiplier
+ */
+extern void FP4_pmul(FP4 *x, FP4 *y, FP2 *a);
+
+
+/**	@brief Multiplication of an FP4 by an FP
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP multiplier
+ */
+extern void FP4_qmul(FP4 *x, FP4 *y, FP *a);
+
+/**	@brief Multiplication of an FP4 by a small integer
+ *
+	@param x FP4 instance, on exit = y*i
+	@param y FP4 instance
+	@param i an integer
+ */
+extern void FP4_imul(FP4 *x, FP4 *y, int i);
+/**	@brief Squaring an FP4
+ *
+	@param x FP4 instance, on exit = y^2
+	@param y FP4 instance
+ */
+extern void FP4_sqr(FP4 *x, FP4 *y);
+/**	@brief Multiplication of two FP4s
+ *
+	@param x FP4 instance, on exit = y*z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_mul(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Inverting an FP4
+ *
+	@param x FP4 instance, on exit = 1/y
+	@param y FP4 instance
+    @param h optional input hint
+ */
+extern void FP4_inv(FP4 *x, FP4 *y, FP *h);
+
+/**	@brief Divide an FP4 by 2
+ *
+	@param x FP4 instance, on exit = y/2
+	@param y FP4 instance
+ */
+extern void FP4_div2(FP4 *x, FP4 *y);
+
+
+/**	@brief Formats and outputs an FP4 to the console
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_output(FP4 *x);
+/**	@brief Formats and outputs an FP4 to the console in raw form (for debugging)
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_rawoutput(FP4 *x);
+/**	@brief multiplies an FP4 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP4 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP4_times_i(FP4 *x);
+/**	@brief Normalises the components of an FP4
+ *
+	@param x FP4 instance to be normalised
+ */
+extern void FP4_norm(FP4 *x);
+/**	@brief Reduces all components of possibly unreduced FP4 mod Modulus
+ *
+	@param x FP4 instance, on exit reduced mod Modulus
+ */
+extern void FP4_reduce(FP4 *x);
+/**	@brief Raises an FP4 to the power of a BIG
+ *
+	@param x FP4 instance, on exit = y^b
+	@param y FP4 instance
+	@param b BIG number
+ */
+extern void FP4_pow(FP4 *x, FP4 *y, B384_29::BIG b);
+/**	@brief Raises an FP4 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP4 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP4_frob(FP4 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP4 instance, on exit = w*x-conj(x)*y+z
+	@param w FP4 instance
+	@param x FP4 instance
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_xtr_A(FP4 *r, FP4 *w, FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP4 instance, on exit = x^2-2*conj(x)
+	@param x FP4 instance
+ */
+extern void FP4_xtr_D(FP4 *r, FP4 *x);
+/**	@brief Calculates FP4 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP4 instance, on exit = trace(w^b)
+	@param x FP4 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP4_xtr_pow(FP4 *r, FP4 *x, B384_29::BIG b);
+/**	@brief Calculates FP4 trace of c^a.d^b, where c and d are derived from FP4 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP4 instance, on exit = trace(c^a.d^b)
+	@param c FP4 instance, trace of an FP12
+	@param d FP4 instance, trace of an FP12
+	@param e FP4 instance, trace of an FP12
+	@param f FP4 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP4_xtr_pow2(FP4 *r, FP4 *c, FP4 *d, FP4 *e, FP4 *f, B384_29::BIG a, B384_29::BIG b);
+
+/**	@brief Test FP4 for QR
+ * 
+	@param r FP4 instance
+    @param h optional generated hint
+	@return 1 x is a QR, otherwise 0
+ */
+extern int  FP4_qr(FP4 *r, FP *h);
+
+/**	@brief Calculate square root of an FP4
+ *
+	Square root
+	@param r FP4 instance, on exit = sqrt(x)
+	@param x FP4 instance
+    @param h optional input hint
+ */
+extern void  FP4_sqrt(FP4 *r, FP4 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP4 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP4 instance, set to y if s!=0
+	@param y another FP4 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP4_cmove(FP4 *x, FP4 *y, int s);
+
+
+/**	@brief Divide FP4 number by QNR
+ *
+	Divide FP4 by the QNR
+	@param x FP4 instance
+ */
+extern void FP4_div_i(FP4 *x);
+
+/**	@brief Generate random FP4
+ *
+	@param x random FP4 number
+	@param rng random number generator
+ */
+extern void FP4_rand(FP4 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp4_BLS12443.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp4_BLS12443.h
new file mode 100644
index 0000000..31c5a5a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp4_BLS12443.h
@@ -0,0 +1,349 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP4_BLS12443_H
+#define FP4_BLS12443_H
+
+#include "fp2_BLS12443.h"
+#include "config_curve_BLS12443.h"
+
+using namespace core;
+
+namespace BLS12443 {
+
+/**
+	@brief FP4 Structure - towered over two FP2
+*/
+
+typedef struct
+{
+    FP2 a; /**< real part of FP4 */
+    FP2 b; /**< imaginary part of FP4 */
+} FP4;
+
+
+/* FP4 prototypes */
+/**	@brief Tests for FP4 equal to zero
+ *
+	@param x FP4 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP4_iszilch(FP4 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP4 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP4_islarger(FP4 *x);
+
+/**	@brief Serialize out FP4  
+ *
+    @param b buffer for output
+	@param x FP4 number to be serialized
+ */
+extern void FP4_toBytes(char *b,FP4 *x);
+
+/**	@brief Serialize in FP4  
+ *
+	@param x FP4 number to be serialized
+    @param b buffer for input
+ */
+extern void FP4_fromBytes(FP4 *x,char *b);
+
+/**	@brief Tests for FP4 equal to unity
+ *
+	@param x FP4 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP4_isunity(FP4 *x);
+/**	@brief Tests for equality of two FP4s
+ *
+	@param x FP4 instance to be compared
+	@param y FP4 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP4_equals(FP4 *x, FP4 *y);
+/**	@brief Tests for FP4 having only a real part and no imaginary part
+ *
+	@param x FP4 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP4_isreal(FP4 *x);
+/**	@brief Initialise FP4 from two FP2s
+ *
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+	@param b FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2s(FP4 *x, FP2 *a, FP2 *b);
+/**	@brief Initialise FP4 from single FP2
+ *
+	Imaginary part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+ */
+extern void FP4_from_FP2(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP2
+ *
+	real part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2H(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP
+ *
+	@param x FP4 instance to be initialised
+	@param a FP to form real part of FP4
+ */
+extern void FP4_from_FP(FP4 *x, FP *a);
+
+/**	@brief Copy FP4 to another FP4
+ *
+	@param x FP4 instance, on exit = y
+	@param y FP4 instance to be copied
+ */
+extern void FP4_copy(FP4 *x, FP4 *y);
+/**	@brief Set FP4 to zero
+ *
+	@param x FP4 instance to be set to zero
+ */
+extern void FP4_zero(FP4 *x);
+/**	@brief Set FP4 to unity
+ *
+	@param x FP4 instance to be set to one
+ */
+extern void FP4_one(FP4 *x);
+
+/**	@brief Sign of FP4
+ *
+	@param x FP4 instance
+	@return "sign" of FP4
+ */
+extern int FP4_sign(FP4 *x);
+
+/**	@brief Negation of FP4
+ *
+	@param x FP4 instance, on exit = -y
+	@param y FP4 instance
+ */
+extern void FP4_neg(FP4 *x, FP4 *y);
+/**	@brief Conjugation of FP4
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP4 instance, on exit = conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_conj(FP4 *x, FP4 *y);
+/**	@brief Negative conjugation of FP4
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP4 instance, on exit = -conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_nconj(FP4 *x, FP4 *y);
+/**	@brief addition of two FP4s
+ *
+	@param x FP4 instance, on exit = y+z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_add(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief subtraction of two FP4s
+ *
+	@param x FP4 instance, on exit = y-z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_sub(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Multiplication of an FP4 by an FP2
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP2 multiplier
+ */
+extern void FP4_pmul(FP4 *x, FP4 *y, FP2 *a);
+
+
+/**	@brief Multiplication of an FP4 by an FP
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP multiplier
+ */
+extern void FP4_qmul(FP4 *x, FP4 *y, FP *a);
+
+/**	@brief Multiplication of an FP4 by a small integer
+ *
+	@param x FP4 instance, on exit = y*i
+	@param y FP4 instance
+	@param i an integer
+ */
+extern void FP4_imul(FP4 *x, FP4 *y, int i);
+/**	@brief Squaring an FP4
+ *
+	@param x FP4 instance, on exit = y^2
+	@param y FP4 instance
+ */
+extern void FP4_sqr(FP4 *x, FP4 *y);
+/**	@brief Multiplication of two FP4s
+ *
+	@param x FP4 instance, on exit = y*z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_mul(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Inverting an FP4
+ *
+	@param x FP4 instance, on exit = 1/y
+	@param y FP4 instance
+    @param h optional input hint
+ */
+extern void FP4_inv(FP4 *x, FP4 *y, FP *h);
+
+/**	@brief Divide an FP4 by 2
+ *
+	@param x FP4 instance, on exit = y/2
+	@param y FP4 instance
+ */
+extern void FP4_div2(FP4 *x, FP4 *y);
+
+
+/**	@brief Formats and outputs an FP4 to the console
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_output(FP4 *x);
+/**	@brief Formats and outputs an FP4 to the console in raw form (for debugging)
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_rawoutput(FP4 *x);
+/**	@brief multiplies an FP4 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP4 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP4_times_i(FP4 *x);
+/**	@brief Normalises the components of an FP4
+ *
+	@param x FP4 instance to be normalised
+ */
+extern void FP4_norm(FP4 *x);
+/**	@brief Reduces all components of possibly unreduced FP4 mod Modulus
+ *
+	@param x FP4 instance, on exit reduced mod Modulus
+ */
+extern void FP4_reduce(FP4 *x);
+/**	@brief Raises an FP4 to the power of a BIG
+ *
+	@param x FP4 instance, on exit = y^b
+	@param y FP4 instance
+	@param b BIG number
+ */
+extern void FP4_pow(FP4 *x, FP4 *y, B448_29::BIG b);
+/**	@brief Raises an FP4 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP4 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP4_frob(FP4 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP4 instance, on exit = w*x-conj(x)*y+z
+	@param w FP4 instance
+	@param x FP4 instance
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_xtr_A(FP4 *r, FP4 *w, FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP4 instance, on exit = x^2-2*conj(x)
+	@param x FP4 instance
+ */
+extern void FP4_xtr_D(FP4 *r, FP4 *x);
+/**	@brief Calculates FP4 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP4 instance, on exit = trace(w^b)
+	@param x FP4 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP4_xtr_pow(FP4 *r, FP4 *x, B448_29::BIG b);
+/**	@brief Calculates FP4 trace of c^a.d^b, where c and d are derived from FP4 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP4 instance, on exit = trace(c^a.d^b)
+	@param c FP4 instance, trace of an FP12
+	@param d FP4 instance, trace of an FP12
+	@param e FP4 instance, trace of an FP12
+	@param f FP4 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP4_xtr_pow2(FP4 *r, FP4 *c, FP4 *d, FP4 *e, FP4 *f, B448_29::BIG a, B448_29::BIG b);
+
+/**	@brief Test FP4 for QR
+ * 
+	@param r FP4 instance
+    @param h optional generated hint
+	@return 1 x is a QR, otherwise 0
+ */
+extern int  FP4_qr(FP4 *r, FP *h);
+
+/**	@brief Calculate square root of an FP4
+ *
+	Square root
+	@param r FP4 instance, on exit = sqrt(x)
+	@param x FP4 instance
+    @param h optional input hint
+ */
+extern void  FP4_sqrt(FP4 *r, FP4 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP4 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP4 instance, set to y if s!=0
+	@param y another FP4 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP4_cmove(FP4 *x, FP4 *y, int s);
+
+
+/**	@brief Divide FP4 number by QNR
+ *
+	Divide FP4 by the QNR
+	@param x FP4 instance
+ */
+extern void FP4_div_i(FP4 *x);
+
+/**	@brief Generate random FP4
+ *
+	@param x random FP4 number
+	@param rng random number generator
+ */
+extern void FP4_rand(FP4 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp4_BLS12461.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp4_BLS12461.h
new file mode 100644
index 0000000..f6dfa48
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp4_BLS12461.h
@@ -0,0 +1,349 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP4_BLS12461_H
+#define FP4_BLS12461_H
+
+#include "fp2_BLS12461.h"
+#include "config_curve_BLS12461.h"
+
+using namespace core;
+
+namespace BLS12461 {
+
+/**
+	@brief FP4 Structure - towered over two FP2
+*/
+
+typedef struct
+{
+    FP2 a; /**< real part of FP4 */
+    FP2 b; /**< imaginary part of FP4 */
+} FP4;
+
+
+/* FP4 prototypes */
+/**	@brief Tests for FP4 equal to zero
+ *
+	@param x FP4 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP4_iszilch(FP4 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP4 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP4_islarger(FP4 *x);
+
+/**	@brief Serialize out FP4  
+ *
+    @param b buffer for output
+	@param x FP4 number to be serialized
+ */
+extern void FP4_toBytes(char *b,FP4 *x);
+
+/**	@brief Serialize in FP4  
+ *
+	@param x FP4 number to be serialized
+    @param b buffer for input
+ */
+extern void FP4_fromBytes(FP4 *x,char *b);
+
+/**	@brief Tests for FP4 equal to unity
+ *
+	@param x FP4 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP4_isunity(FP4 *x);
+/**	@brief Tests for equality of two FP4s
+ *
+	@param x FP4 instance to be compared
+	@param y FP4 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP4_equals(FP4 *x, FP4 *y);
+/**	@brief Tests for FP4 having only a real part and no imaginary part
+ *
+	@param x FP4 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP4_isreal(FP4 *x);
+/**	@brief Initialise FP4 from two FP2s
+ *
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+	@param b FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2s(FP4 *x, FP2 *a, FP2 *b);
+/**	@brief Initialise FP4 from single FP2
+ *
+	Imaginary part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+ */
+extern void FP4_from_FP2(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP2
+ *
+	real part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2H(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP
+ *
+	@param x FP4 instance to be initialised
+	@param a FP to form real part of FP4
+ */
+extern void FP4_from_FP(FP4 *x, FP *a);
+
+/**	@brief Copy FP4 to another FP4
+ *
+	@param x FP4 instance, on exit = y
+	@param y FP4 instance to be copied
+ */
+extern void FP4_copy(FP4 *x, FP4 *y);
+/**	@brief Set FP4 to zero
+ *
+	@param x FP4 instance to be set to zero
+ */
+extern void FP4_zero(FP4 *x);
+/**	@brief Set FP4 to unity
+ *
+	@param x FP4 instance to be set to one
+ */
+extern void FP4_one(FP4 *x);
+
+/**	@brief Sign of FP4
+ *
+	@param x FP4 instance
+	@return "sign" of FP4
+ */
+extern int FP4_sign(FP4 *x);
+
+/**	@brief Negation of FP4
+ *
+	@param x FP4 instance, on exit = -y
+	@param y FP4 instance
+ */
+extern void FP4_neg(FP4 *x, FP4 *y);
+/**	@brief Conjugation of FP4
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP4 instance, on exit = conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_conj(FP4 *x, FP4 *y);
+/**	@brief Negative conjugation of FP4
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP4 instance, on exit = -conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_nconj(FP4 *x, FP4 *y);
+/**	@brief addition of two FP4s
+ *
+	@param x FP4 instance, on exit = y+z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_add(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief subtraction of two FP4s
+ *
+	@param x FP4 instance, on exit = y-z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_sub(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Multiplication of an FP4 by an FP2
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP2 multiplier
+ */
+extern void FP4_pmul(FP4 *x, FP4 *y, FP2 *a);
+
+
+/**	@brief Multiplication of an FP4 by an FP
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP multiplier
+ */
+extern void FP4_qmul(FP4 *x, FP4 *y, FP *a);
+
+/**	@brief Multiplication of an FP4 by a small integer
+ *
+	@param x FP4 instance, on exit = y*i
+	@param y FP4 instance
+	@param i an integer
+ */
+extern void FP4_imul(FP4 *x, FP4 *y, int i);
+/**	@brief Squaring an FP4
+ *
+	@param x FP4 instance, on exit = y^2
+	@param y FP4 instance
+ */
+extern void FP4_sqr(FP4 *x, FP4 *y);
+/**	@brief Multiplication of two FP4s
+ *
+	@param x FP4 instance, on exit = y*z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_mul(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Inverting an FP4
+ *
+	@param x FP4 instance, on exit = 1/y
+	@param y FP4 instance
+    @param h optional input hint
+ */
+extern void FP4_inv(FP4 *x, FP4 *y, FP *h);
+
+/**	@brief Divide an FP4 by 2
+ *
+	@param x FP4 instance, on exit = y/2
+	@param y FP4 instance
+ */
+extern void FP4_div2(FP4 *x, FP4 *y);
+
+
+/**	@brief Formats and outputs an FP4 to the console
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_output(FP4 *x);
+/**	@brief Formats and outputs an FP4 to the console in raw form (for debugging)
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_rawoutput(FP4 *x);
+/**	@brief multiplies an FP4 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP4 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP4_times_i(FP4 *x);
+/**	@brief Normalises the components of an FP4
+ *
+	@param x FP4 instance to be normalised
+ */
+extern void FP4_norm(FP4 *x);
+/**	@brief Reduces all components of possibly unreduced FP4 mod Modulus
+ *
+	@param x FP4 instance, on exit reduced mod Modulus
+ */
+extern void FP4_reduce(FP4 *x);
+/**	@brief Raises an FP4 to the power of a BIG
+ *
+	@param x FP4 instance, on exit = y^b
+	@param y FP4 instance
+	@param b BIG number
+ */
+extern void FP4_pow(FP4 *x, FP4 *y, B464_28::BIG b);
+/**	@brief Raises an FP4 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP4 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP4_frob(FP4 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP4 instance, on exit = w*x-conj(x)*y+z
+	@param w FP4 instance
+	@param x FP4 instance
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_xtr_A(FP4 *r, FP4 *w, FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP4 instance, on exit = x^2-2*conj(x)
+	@param x FP4 instance
+ */
+extern void FP4_xtr_D(FP4 *r, FP4 *x);
+/**	@brief Calculates FP4 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP4 instance, on exit = trace(w^b)
+	@param x FP4 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP4_xtr_pow(FP4 *r, FP4 *x, B464_28::BIG b);
+/**	@brief Calculates FP4 trace of c^a.d^b, where c and d are derived from FP4 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP4 instance, on exit = trace(c^a.d^b)
+	@param c FP4 instance, trace of an FP12
+	@param d FP4 instance, trace of an FP12
+	@param e FP4 instance, trace of an FP12
+	@param f FP4 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP4_xtr_pow2(FP4 *r, FP4 *c, FP4 *d, FP4 *e, FP4 *f, B464_28::BIG a, B464_28::BIG b);
+
+/**	@brief Test FP4 for QR
+ * 
+	@param r FP4 instance
+    @param h optional generated hint
+	@return 1 x is a QR, otherwise 0
+ */
+extern int  FP4_qr(FP4 *r, FP *h);
+
+/**	@brief Calculate square root of an FP4
+ *
+	Square root
+	@param r FP4 instance, on exit = sqrt(x)
+	@param x FP4 instance
+    @param h optional input hint
+ */
+extern void  FP4_sqrt(FP4 *r, FP4 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP4 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP4 instance, set to y if s!=0
+	@param y another FP4 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP4_cmove(FP4 *x, FP4 *y, int s);
+
+
+/**	@brief Divide FP4 number by QNR
+ *
+	Divide FP4 by the QNR
+	@param x FP4 instance
+ */
+extern void FP4_div_i(FP4 *x);
+
+/**	@brief Generate random FP4
+ *
+	@param x random FP4 number
+	@param rng random number generator
+ */
+extern void FP4_rand(FP4 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp4_BLS24479.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp4_BLS24479.h
new file mode 100644
index 0000000..019c09d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp4_BLS24479.h
@@ -0,0 +1,349 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP4_BLS24479_H
+#define FP4_BLS24479_H
+
+#include "fp2_BLS24479.h"
+#include "config_curve_BLS24479.h"
+
+using namespace core;
+
+namespace BLS24479 {
+
+/**
+	@brief FP4 Structure - towered over two FP2
+*/
+
+typedef struct
+{
+    FP2 a; /**< real part of FP4 */
+    FP2 b; /**< imaginary part of FP4 */
+} FP4;
+
+
+/* FP4 prototypes */
+/**	@brief Tests for FP4 equal to zero
+ *
+	@param x FP4 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP4_iszilch(FP4 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP4 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP4_islarger(FP4 *x);
+
+/**	@brief Serialize out FP4  
+ *
+    @param b buffer for output
+	@param x FP4 number to be serialized
+ */
+extern void FP4_toBytes(char *b,FP4 *x);
+
+/**	@brief Serialize in FP4  
+ *
+	@param x FP4 number to be serialized
+    @param b buffer for input
+ */
+extern void FP4_fromBytes(FP4 *x,char *b);
+
+/**	@brief Tests for FP4 equal to unity
+ *
+	@param x FP4 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP4_isunity(FP4 *x);
+/**	@brief Tests for equality of two FP4s
+ *
+	@param x FP4 instance to be compared
+	@param y FP4 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP4_equals(FP4 *x, FP4 *y);
+/**	@brief Tests for FP4 having only a real part and no imaginary part
+ *
+	@param x FP4 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP4_isreal(FP4 *x);
+/**	@brief Initialise FP4 from two FP2s
+ *
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+	@param b FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2s(FP4 *x, FP2 *a, FP2 *b);
+/**	@brief Initialise FP4 from single FP2
+ *
+	Imaginary part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+ */
+extern void FP4_from_FP2(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP2
+ *
+	real part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2H(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP
+ *
+	@param x FP4 instance to be initialised
+	@param a FP to form real part of FP4
+ */
+extern void FP4_from_FP(FP4 *x, FP *a);
+
+/**	@brief Copy FP4 to another FP4
+ *
+	@param x FP4 instance, on exit = y
+	@param y FP4 instance to be copied
+ */
+extern void FP4_copy(FP4 *x, FP4 *y);
+/**	@brief Set FP4 to zero
+ *
+	@param x FP4 instance to be set to zero
+ */
+extern void FP4_zero(FP4 *x);
+/**	@brief Set FP4 to unity
+ *
+	@param x FP4 instance to be set to one
+ */
+extern void FP4_one(FP4 *x);
+
+/**	@brief Sign of FP4
+ *
+	@param x FP4 instance
+	@return "sign" of FP4
+ */
+extern int FP4_sign(FP4 *x);
+
+/**	@brief Negation of FP4
+ *
+	@param x FP4 instance, on exit = -y
+	@param y FP4 instance
+ */
+extern void FP4_neg(FP4 *x, FP4 *y);
+/**	@brief Conjugation of FP4
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP4 instance, on exit = conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_conj(FP4 *x, FP4 *y);
+/**	@brief Negative conjugation of FP4
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP4 instance, on exit = -conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_nconj(FP4 *x, FP4 *y);
+/**	@brief addition of two FP4s
+ *
+	@param x FP4 instance, on exit = y+z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_add(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief subtraction of two FP4s
+ *
+	@param x FP4 instance, on exit = y-z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_sub(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Multiplication of an FP4 by an FP2
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP2 multiplier
+ */
+extern void FP4_pmul(FP4 *x, FP4 *y, FP2 *a);
+
+
+/**	@brief Multiplication of an FP4 by an FP
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP multiplier
+ */
+extern void FP4_qmul(FP4 *x, FP4 *y, FP *a);
+
+/**	@brief Multiplication of an FP4 by a small integer
+ *
+	@param x FP4 instance, on exit = y*i
+	@param y FP4 instance
+	@param i an integer
+ */
+extern void FP4_imul(FP4 *x, FP4 *y, int i);
+/**	@brief Squaring an FP4
+ *
+	@param x FP4 instance, on exit = y^2
+	@param y FP4 instance
+ */
+extern void FP4_sqr(FP4 *x, FP4 *y);
+/**	@brief Multiplication of two FP4s
+ *
+	@param x FP4 instance, on exit = y*z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_mul(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Inverting an FP4
+ *
+	@param x FP4 instance, on exit = 1/y
+	@param y FP4 instance
+    @param h optional input hint
+ */
+extern void FP4_inv(FP4 *x, FP4 *y, FP *h);
+
+/**	@brief Divide an FP4 by 2
+ *
+	@param x FP4 instance, on exit = y/2
+	@param y FP4 instance
+ */
+extern void FP4_div2(FP4 *x, FP4 *y);
+
+
+/**	@brief Formats and outputs an FP4 to the console
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_output(FP4 *x);
+/**	@brief Formats and outputs an FP4 to the console in raw form (for debugging)
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_rawoutput(FP4 *x);
+/**	@brief multiplies an FP4 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP4 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP4_times_i(FP4 *x);
+/**	@brief Normalises the components of an FP4
+ *
+	@param x FP4 instance to be normalised
+ */
+extern void FP4_norm(FP4 *x);
+/**	@brief Reduces all components of possibly unreduced FP4 mod Modulus
+ *
+	@param x FP4 instance, on exit reduced mod Modulus
+ */
+extern void FP4_reduce(FP4 *x);
+/**	@brief Raises an FP4 to the power of a BIG
+ *
+	@param x FP4 instance, on exit = y^b
+	@param y FP4 instance
+	@param b BIG number
+ */
+extern void FP4_pow(FP4 *x, FP4 *y, B480_29::BIG b);
+/**	@brief Raises an FP4 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP4 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP4_frob(FP4 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP4 instance, on exit = w*x-conj(x)*y+z
+	@param w FP4 instance
+	@param x FP4 instance
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_xtr_A(FP4 *r, FP4 *w, FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP4 instance, on exit = x^2-2*conj(x)
+	@param x FP4 instance
+ */
+extern void FP4_xtr_D(FP4 *r, FP4 *x);
+/**	@brief Calculates FP4 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP4 instance, on exit = trace(w^b)
+	@param x FP4 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP4_xtr_pow(FP4 *r, FP4 *x, B480_29::BIG b);
+/**	@brief Calculates FP4 trace of c^a.d^b, where c and d are derived from FP4 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP4 instance, on exit = trace(c^a.d^b)
+	@param c FP4 instance, trace of an FP12
+	@param d FP4 instance, trace of an FP12
+	@param e FP4 instance, trace of an FP12
+	@param f FP4 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP4_xtr_pow2(FP4 *r, FP4 *c, FP4 *d, FP4 *e, FP4 *f, B480_29::BIG a, B480_29::BIG b);
+
+/**	@brief Test FP4 for QR
+ * 
+	@param r FP4 instance
+    @param h optional generated hint
+	@return 1 x is a QR, otherwise 0
+ */
+extern int  FP4_qr(FP4 *r, FP *h);
+
+/**	@brief Calculate square root of an FP4
+ *
+	Square root
+	@param r FP4 instance, on exit = sqrt(x)
+	@param x FP4 instance
+    @param h optional input hint
+ */
+extern void  FP4_sqrt(FP4 *r, FP4 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP4 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP4 instance, set to y if s!=0
+	@param y another FP4 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP4_cmove(FP4 *x, FP4 *y, int s);
+
+
+/**	@brief Divide FP4 number by QNR
+ *
+	Divide FP4 by the QNR
+	@param x FP4 instance
+ */
+extern void FP4_div_i(FP4 *x);
+
+/**	@brief Generate random FP4
+ *
+	@param x random FP4 number
+	@param rng random number generator
+ */
+extern void FP4_rand(FP4 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp4_BLS48286.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp4_BLS48286.h
new file mode 100644
index 0000000..4d3f4bf
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp4_BLS48286.h
@@ -0,0 +1,349 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP4_BLS48286_H
+#define FP4_BLS48286_H
+
+#include "fp2_BLS48286.h"
+#include "config_curve_BLS48286.h"
+
+using namespace core;
+
+namespace BLS48286 {
+
+/**
+	@brief FP4 Structure - towered over two FP2
+*/
+
+typedef struct
+{
+    FP2 a; /**< real part of FP4 */
+    FP2 b; /**< imaginary part of FP4 */
+} FP4;
+
+
+/* FP4 prototypes */
+/**	@brief Tests for FP4 equal to zero
+ *
+	@param x FP4 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP4_iszilch(FP4 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP4 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP4_islarger(FP4 *x);
+
+/**	@brief Serialize out FP4  
+ *
+    @param b buffer for output
+	@param x FP4 number to be serialized
+ */
+extern void FP4_toBytes(char *b,FP4 *x);
+
+/**	@brief Serialize in FP4  
+ *
+	@param x FP4 number to be serialized
+    @param b buffer for input
+ */
+extern void FP4_fromBytes(FP4 *x,char *b);
+
+/**	@brief Tests for FP4 equal to unity
+ *
+	@param x FP4 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP4_isunity(FP4 *x);
+/**	@brief Tests for equality of two FP4s
+ *
+	@param x FP4 instance to be compared
+	@param y FP4 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP4_equals(FP4 *x, FP4 *y);
+/**	@brief Tests for FP4 having only a real part and no imaginary part
+ *
+	@param x FP4 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP4_isreal(FP4 *x);
+/**	@brief Initialise FP4 from two FP2s
+ *
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+	@param b FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2s(FP4 *x, FP2 *a, FP2 *b);
+/**	@brief Initialise FP4 from single FP2
+ *
+	Imaginary part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+ */
+extern void FP4_from_FP2(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP2
+ *
+	real part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2H(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP
+ *
+	@param x FP4 instance to be initialised
+	@param a FP to form real part of FP4
+ */
+extern void FP4_from_FP(FP4 *x, FP *a);
+
+/**	@brief Copy FP4 to another FP4
+ *
+	@param x FP4 instance, on exit = y
+	@param y FP4 instance to be copied
+ */
+extern void FP4_copy(FP4 *x, FP4 *y);
+/**	@brief Set FP4 to zero
+ *
+	@param x FP4 instance to be set to zero
+ */
+extern void FP4_zero(FP4 *x);
+/**	@brief Set FP4 to unity
+ *
+	@param x FP4 instance to be set to one
+ */
+extern void FP4_one(FP4 *x);
+
+/**	@brief Sign of FP4
+ *
+	@param x FP4 instance
+	@return "sign" of FP4
+ */
+extern int FP4_sign(FP4 *x);
+
+/**	@brief Negation of FP4
+ *
+	@param x FP4 instance, on exit = -y
+	@param y FP4 instance
+ */
+extern void FP4_neg(FP4 *x, FP4 *y);
+/**	@brief Conjugation of FP4
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP4 instance, on exit = conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_conj(FP4 *x, FP4 *y);
+/**	@brief Negative conjugation of FP4
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP4 instance, on exit = -conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_nconj(FP4 *x, FP4 *y);
+/**	@brief addition of two FP4s
+ *
+	@param x FP4 instance, on exit = y+z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_add(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief subtraction of two FP4s
+ *
+	@param x FP4 instance, on exit = y-z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_sub(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Multiplication of an FP4 by an FP2
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP2 multiplier
+ */
+extern void FP4_pmul(FP4 *x, FP4 *y, FP2 *a);
+
+
+/**	@brief Multiplication of an FP4 by an FP
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP multiplier
+ */
+extern void FP4_qmul(FP4 *x, FP4 *y, FP *a);
+
+/**	@brief Multiplication of an FP4 by a small integer
+ *
+	@param x FP4 instance, on exit = y*i
+	@param y FP4 instance
+	@param i an integer
+ */
+extern void FP4_imul(FP4 *x, FP4 *y, int i);
+/**	@brief Squaring an FP4
+ *
+	@param x FP4 instance, on exit = y^2
+	@param y FP4 instance
+ */
+extern void FP4_sqr(FP4 *x, FP4 *y);
+/**	@brief Multiplication of two FP4s
+ *
+	@param x FP4 instance, on exit = y*z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_mul(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Inverting an FP4
+ *
+	@param x FP4 instance, on exit = 1/y
+	@param y FP4 instance
+    @param h optional input hint
+ */
+extern void FP4_inv(FP4 *x, FP4 *y, FP *h);
+
+/**	@brief Divide an FP4 by 2
+ *
+	@param x FP4 instance, on exit = y/2
+	@param y FP4 instance
+ */
+extern void FP4_div2(FP4 *x, FP4 *y);
+
+
+/**	@brief Formats and outputs an FP4 to the console
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_output(FP4 *x);
+/**	@brief Formats and outputs an FP4 to the console in raw form (for debugging)
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_rawoutput(FP4 *x);
+/**	@brief multiplies an FP4 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP4 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP4_times_i(FP4 *x);
+/**	@brief Normalises the components of an FP4
+ *
+	@param x FP4 instance to be normalised
+ */
+extern void FP4_norm(FP4 *x);
+/**	@brief Reduces all components of possibly unreduced FP4 mod Modulus
+ *
+	@param x FP4 instance, on exit reduced mod Modulus
+ */
+extern void FP4_reduce(FP4 *x);
+/**	@brief Raises an FP4 to the power of a BIG
+ *
+	@param x FP4 instance, on exit = y^b
+	@param y FP4 instance
+	@param b BIG number
+ */
+extern void FP4_pow(FP4 *x, FP4 *y, B288_29::BIG b);
+/**	@brief Raises an FP4 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP4 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP4_frob(FP4 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP4 instance, on exit = w*x-conj(x)*y+z
+	@param w FP4 instance
+	@param x FP4 instance
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_xtr_A(FP4 *r, FP4 *w, FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP4 instance, on exit = x^2-2*conj(x)
+	@param x FP4 instance
+ */
+extern void FP4_xtr_D(FP4 *r, FP4 *x);
+/**	@brief Calculates FP4 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP4 instance, on exit = trace(w^b)
+	@param x FP4 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP4_xtr_pow(FP4 *r, FP4 *x, B288_29::BIG b);
+/**	@brief Calculates FP4 trace of c^a.d^b, where c and d are derived from FP4 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP4 instance, on exit = trace(c^a.d^b)
+	@param c FP4 instance, trace of an FP12
+	@param d FP4 instance, trace of an FP12
+	@param e FP4 instance, trace of an FP12
+	@param f FP4 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP4_xtr_pow2(FP4 *r, FP4 *c, FP4 *d, FP4 *e, FP4 *f, B288_29::BIG a, B288_29::BIG b);
+
+/**	@brief Test FP4 for QR
+ * 
+	@param r FP4 instance
+    @param h optional generated hint
+	@return 1 x is a QR, otherwise 0
+ */
+extern int  FP4_qr(FP4 *r, FP *h);
+
+/**	@brief Calculate square root of an FP4
+ *
+	Square root
+	@param r FP4 instance, on exit = sqrt(x)
+	@param x FP4 instance
+    @param h optional input hint
+ */
+extern void  FP4_sqrt(FP4 *r, FP4 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP4 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP4 instance, set to y if s!=0
+	@param y another FP4 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP4_cmove(FP4 *x, FP4 *y, int s);
+
+
+/**	@brief Divide FP4 number by QNR
+ *
+	Divide FP4 by the QNR
+	@param x FP4 instance
+ */
+extern void FP4_div_i(FP4 *x);
+
+/**	@brief Generate random FP4
+ *
+	@param x random FP4 number
+	@param rng random number generator
+ */
+extern void FP4_rand(FP4 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp4_BLS48556.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp4_BLS48556.h
new file mode 100644
index 0000000..a93a1be
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp4_BLS48556.h
@@ -0,0 +1,349 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP4_BLS48556_H
+#define FP4_BLS48556_H
+
+#include "fp2_BLS48556.h"
+#include "config_curve_BLS48556.h"
+
+using namespace core;
+
+namespace BLS48556 {
+
+/**
+	@brief FP4 Structure - towered over two FP2
+*/
+
+typedef struct
+{
+    FP2 a; /**< real part of FP4 */
+    FP2 b; /**< imaginary part of FP4 */
+} FP4;
+
+
+/* FP4 prototypes */
+/**	@brief Tests for FP4 equal to zero
+ *
+	@param x FP4 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP4_iszilch(FP4 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP4 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP4_islarger(FP4 *x);
+
+/**	@brief Serialize out FP4  
+ *
+    @param b buffer for output
+	@param x FP4 number to be serialized
+ */
+extern void FP4_toBytes(char *b,FP4 *x);
+
+/**	@brief Serialize in FP4  
+ *
+	@param x FP4 number to be serialized
+    @param b buffer for input
+ */
+extern void FP4_fromBytes(FP4 *x,char *b);
+
+/**	@brief Tests for FP4 equal to unity
+ *
+	@param x FP4 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP4_isunity(FP4 *x);
+/**	@brief Tests for equality of two FP4s
+ *
+	@param x FP4 instance to be compared
+	@param y FP4 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP4_equals(FP4 *x, FP4 *y);
+/**	@brief Tests for FP4 having only a real part and no imaginary part
+ *
+	@param x FP4 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP4_isreal(FP4 *x);
+/**	@brief Initialise FP4 from two FP2s
+ *
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+	@param b FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2s(FP4 *x, FP2 *a, FP2 *b);
+/**	@brief Initialise FP4 from single FP2
+ *
+	Imaginary part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+ */
+extern void FP4_from_FP2(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP2
+ *
+	real part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2H(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP
+ *
+	@param x FP4 instance to be initialised
+	@param a FP to form real part of FP4
+ */
+extern void FP4_from_FP(FP4 *x, FP *a);
+
+/**	@brief Copy FP4 to another FP4
+ *
+	@param x FP4 instance, on exit = y
+	@param y FP4 instance to be copied
+ */
+extern void FP4_copy(FP4 *x, FP4 *y);
+/**	@brief Set FP4 to zero
+ *
+	@param x FP4 instance to be set to zero
+ */
+extern void FP4_zero(FP4 *x);
+/**	@brief Set FP4 to unity
+ *
+	@param x FP4 instance to be set to one
+ */
+extern void FP4_one(FP4 *x);
+
+/**	@brief Sign of FP4
+ *
+	@param x FP4 instance
+	@return "sign" of FP4
+ */
+extern int FP4_sign(FP4 *x);
+
+/**	@brief Negation of FP4
+ *
+	@param x FP4 instance, on exit = -y
+	@param y FP4 instance
+ */
+extern void FP4_neg(FP4 *x, FP4 *y);
+/**	@brief Conjugation of FP4
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP4 instance, on exit = conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_conj(FP4 *x, FP4 *y);
+/**	@brief Negative conjugation of FP4
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP4 instance, on exit = -conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_nconj(FP4 *x, FP4 *y);
+/**	@brief addition of two FP4s
+ *
+	@param x FP4 instance, on exit = y+z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_add(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief subtraction of two FP4s
+ *
+	@param x FP4 instance, on exit = y-z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_sub(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Multiplication of an FP4 by an FP2
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP2 multiplier
+ */
+extern void FP4_pmul(FP4 *x, FP4 *y, FP2 *a);
+
+
+/**	@brief Multiplication of an FP4 by an FP
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP multiplier
+ */
+extern void FP4_qmul(FP4 *x, FP4 *y, FP *a);
+
+/**	@brief Multiplication of an FP4 by a small integer
+ *
+	@param x FP4 instance, on exit = y*i
+	@param y FP4 instance
+	@param i an integer
+ */
+extern void FP4_imul(FP4 *x, FP4 *y, int i);
+/**	@brief Squaring an FP4
+ *
+	@param x FP4 instance, on exit = y^2
+	@param y FP4 instance
+ */
+extern void FP4_sqr(FP4 *x, FP4 *y);
+/**	@brief Multiplication of two FP4s
+ *
+	@param x FP4 instance, on exit = y*z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_mul(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Inverting an FP4
+ *
+	@param x FP4 instance, on exit = 1/y
+	@param y FP4 instance
+    @param h optional input hint
+ */
+extern void FP4_inv(FP4 *x, FP4 *y, FP *h);
+
+/**	@brief Divide an FP4 by 2
+ *
+	@param x FP4 instance, on exit = y/2
+	@param y FP4 instance
+ */
+extern void FP4_div2(FP4 *x, FP4 *y);
+
+
+/**	@brief Formats and outputs an FP4 to the console
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_output(FP4 *x);
+/**	@brief Formats and outputs an FP4 to the console in raw form (for debugging)
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_rawoutput(FP4 *x);
+/**	@brief multiplies an FP4 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP4 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP4_times_i(FP4 *x);
+/**	@brief Normalises the components of an FP4
+ *
+	@param x FP4 instance to be normalised
+ */
+extern void FP4_norm(FP4 *x);
+/**	@brief Reduces all components of possibly unreduced FP4 mod Modulus
+ *
+	@param x FP4 instance, on exit reduced mod Modulus
+ */
+extern void FP4_reduce(FP4 *x);
+/**	@brief Raises an FP4 to the power of a BIG
+ *
+	@param x FP4 instance, on exit = y^b
+	@param y FP4 instance
+	@param b BIG number
+ */
+extern void FP4_pow(FP4 *x, FP4 *y, B560_29::BIG b);
+/**	@brief Raises an FP4 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP4 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP4_frob(FP4 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP4 instance, on exit = w*x-conj(x)*y+z
+	@param w FP4 instance
+	@param x FP4 instance
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_xtr_A(FP4 *r, FP4 *w, FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP4 instance, on exit = x^2-2*conj(x)
+	@param x FP4 instance
+ */
+extern void FP4_xtr_D(FP4 *r, FP4 *x);
+/**	@brief Calculates FP4 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP4 instance, on exit = trace(w^b)
+	@param x FP4 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP4_xtr_pow(FP4 *r, FP4 *x, B560_29::BIG b);
+/**	@brief Calculates FP4 trace of c^a.d^b, where c and d are derived from FP4 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP4 instance, on exit = trace(c^a.d^b)
+	@param c FP4 instance, trace of an FP12
+	@param d FP4 instance, trace of an FP12
+	@param e FP4 instance, trace of an FP12
+	@param f FP4 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP4_xtr_pow2(FP4 *r, FP4 *c, FP4 *d, FP4 *e, FP4 *f, B560_29::BIG a, B560_29::BIG b);
+
+/**	@brief Test FP4 for QR
+ * 
+	@param r FP4 instance
+    @param h optional generated hint
+	@return 1 x is a QR, otherwise 0
+ */
+extern int  FP4_qr(FP4 *r, FP *h);
+
+/**	@brief Calculate square root of an FP4
+ *
+	Square root
+	@param r FP4 instance, on exit = sqrt(x)
+	@param x FP4 instance
+    @param h optional input hint
+ */
+extern void  FP4_sqrt(FP4 *r, FP4 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP4 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP4 instance, set to y if s!=0
+	@param y another FP4 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP4_cmove(FP4 *x, FP4 *y, int s);
+
+
+/**	@brief Divide FP4 number by QNR
+ *
+	Divide FP4 by the QNR
+	@param x FP4 instance
+ */
+extern void FP4_div_i(FP4 *x);
+
+/**	@brief Generate random FP4
+ *
+	@param x random FP4 number
+	@param rng random number generator
+ */
+extern void FP4_rand(FP4 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp4_BLS48581.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp4_BLS48581.h
new file mode 100644
index 0000000..c7620c5
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp4_BLS48581.h
@@ -0,0 +1,349 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP4_BLS48581_H
+#define FP4_BLS48581_H
+
+#include "fp2_BLS48581.h"
+#include "config_curve_BLS48581.h"
+
+using namespace core;
+
+namespace BLS48581 {
+
+/**
+	@brief FP4 Structure - towered over two FP2
+*/
+
+typedef struct
+{
+    FP2 a; /**< real part of FP4 */
+    FP2 b; /**< imaginary part of FP4 */
+} FP4;
+
+
+/* FP4 prototypes */
+/**	@brief Tests for FP4 equal to zero
+ *
+	@param x FP4 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP4_iszilch(FP4 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP4 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP4_islarger(FP4 *x);
+
+/**	@brief Serialize out FP4  
+ *
+    @param b buffer for output
+	@param x FP4 number to be serialized
+ */
+extern void FP4_toBytes(char *b,FP4 *x);
+
+/**	@brief Serialize in FP4  
+ *
+	@param x FP4 number to be serialized
+    @param b buffer for input
+ */
+extern void FP4_fromBytes(FP4 *x,char *b);
+
+/**	@brief Tests for FP4 equal to unity
+ *
+	@param x FP4 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP4_isunity(FP4 *x);
+/**	@brief Tests for equality of two FP4s
+ *
+	@param x FP4 instance to be compared
+	@param y FP4 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP4_equals(FP4 *x, FP4 *y);
+/**	@brief Tests for FP4 having only a real part and no imaginary part
+ *
+	@param x FP4 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP4_isreal(FP4 *x);
+/**	@brief Initialise FP4 from two FP2s
+ *
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+	@param b FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2s(FP4 *x, FP2 *a, FP2 *b);
+/**	@brief Initialise FP4 from single FP2
+ *
+	Imaginary part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+ */
+extern void FP4_from_FP2(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP2
+ *
+	real part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2H(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP
+ *
+	@param x FP4 instance to be initialised
+	@param a FP to form real part of FP4
+ */
+extern void FP4_from_FP(FP4 *x, FP *a);
+
+/**	@brief Copy FP4 to another FP4
+ *
+	@param x FP4 instance, on exit = y
+	@param y FP4 instance to be copied
+ */
+extern void FP4_copy(FP4 *x, FP4 *y);
+/**	@brief Set FP4 to zero
+ *
+	@param x FP4 instance to be set to zero
+ */
+extern void FP4_zero(FP4 *x);
+/**	@brief Set FP4 to unity
+ *
+	@param x FP4 instance to be set to one
+ */
+extern void FP4_one(FP4 *x);
+
+/**	@brief Sign of FP4
+ *
+	@param x FP4 instance
+	@return "sign" of FP4
+ */
+extern int FP4_sign(FP4 *x);
+
+/**	@brief Negation of FP4
+ *
+	@param x FP4 instance, on exit = -y
+	@param y FP4 instance
+ */
+extern void FP4_neg(FP4 *x, FP4 *y);
+/**	@brief Conjugation of FP4
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP4 instance, on exit = conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_conj(FP4 *x, FP4 *y);
+/**	@brief Negative conjugation of FP4
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP4 instance, on exit = -conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_nconj(FP4 *x, FP4 *y);
+/**	@brief addition of two FP4s
+ *
+	@param x FP4 instance, on exit = y+z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_add(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief subtraction of two FP4s
+ *
+	@param x FP4 instance, on exit = y-z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_sub(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Multiplication of an FP4 by an FP2
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP2 multiplier
+ */
+extern void FP4_pmul(FP4 *x, FP4 *y, FP2 *a);
+
+
+/**	@brief Multiplication of an FP4 by an FP
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP multiplier
+ */
+extern void FP4_qmul(FP4 *x, FP4 *y, FP *a);
+
+/**	@brief Multiplication of an FP4 by a small integer
+ *
+	@param x FP4 instance, on exit = y*i
+	@param y FP4 instance
+	@param i an integer
+ */
+extern void FP4_imul(FP4 *x, FP4 *y, int i);
+/**	@brief Squaring an FP4
+ *
+	@param x FP4 instance, on exit = y^2
+	@param y FP4 instance
+ */
+extern void FP4_sqr(FP4 *x, FP4 *y);
+/**	@brief Multiplication of two FP4s
+ *
+	@param x FP4 instance, on exit = y*z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_mul(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Inverting an FP4
+ *
+	@param x FP4 instance, on exit = 1/y
+	@param y FP4 instance
+    @param h optional input hint
+ */
+extern void FP4_inv(FP4 *x, FP4 *y, FP *h);
+
+/**	@brief Divide an FP4 by 2
+ *
+	@param x FP4 instance, on exit = y/2
+	@param y FP4 instance
+ */
+extern void FP4_div2(FP4 *x, FP4 *y);
+
+
+/**	@brief Formats and outputs an FP4 to the console
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_output(FP4 *x);
+/**	@brief Formats and outputs an FP4 to the console in raw form (for debugging)
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_rawoutput(FP4 *x);
+/**	@brief multiplies an FP4 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP4 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP4_times_i(FP4 *x);
+/**	@brief Normalises the components of an FP4
+ *
+	@param x FP4 instance to be normalised
+ */
+extern void FP4_norm(FP4 *x);
+/**	@brief Reduces all components of possibly unreduced FP4 mod Modulus
+ *
+	@param x FP4 instance, on exit reduced mod Modulus
+ */
+extern void FP4_reduce(FP4 *x);
+/**	@brief Raises an FP4 to the power of a BIG
+ *
+	@param x FP4 instance, on exit = y^b
+	@param y FP4 instance
+	@param b BIG number
+ */
+extern void FP4_pow(FP4 *x, FP4 *y, B584_29::BIG b);
+/**	@brief Raises an FP4 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP4 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP4_frob(FP4 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP4 instance, on exit = w*x-conj(x)*y+z
+	@param w FP4 instance
+	@param x FP4 instance
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_xtr_A(FP4 *r, FP4 *w, FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP4 instance, on exit = x^2-2*conj(x)
+	@param x FP4 instance
+ */
+extern void FP4_xtr_D(FP4 *r, FP4 *x);
+/**	@brief Calculates FP4 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP4 instance, on exit = trace(w^b)
+	@param x FP4 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP4_xtr_pow(FP4 *r, FP4 *x, B584_29::BIG b);
+/**	@brief Calculates FP4 trace of c^a.d^b, where c and d are derived from FP4 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP4 instance, on exit = trace(c^a.d^b)
+	@param c FP4 instance, trace of an FP12
+	@param d FP4 instance, trace of an FP12
+	@param e FP4 instance, trace of an FP12
+	@param f FP4 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP4_xtr_pow2(FP4 *r, FP4 *c, FP4 *d, FP4 *e, FP4 *f, B584_29::BIG a, B584_29::BIG b);
+
+/**	@brief Test FP4 for QR
+ * 
+	@param r FP4 instance
+    @param h optional generated hint
+	@return 1 x is a QR, otherwise 0
+ */
+extern int  FP4_qr(FP4 *r, FP *h);
+
+/**	@brief Calculate square root of an FP4
+ *
+	Square root
+	@param r FP4 instance, on exit = sqrt(x)
+	@param x FP4 instance
+    @param h optional input hint
+ */
+extern void  FP4_sqrt(FP4 *r, FP4 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP4 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP4 instance, set to y if s!=0
+	@param y another FP4 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP4_cmove(FP4 *x, FP4 *y, int s);
+
+
+/**	@brief Divide FP4 number by QNR
+ *
+	Divide FP4 by the QNR
+	@param x FP4 instance
+ */
+extern void FP4_div_i(FP4 *x);
+
+/**	@brief Generate random FP4
+ *
+	@param x random FP4 number
+	@param rng random number generator
+ */
+extern void FP4_rand(FP4 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp4_BN158.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp4_BN158.h
new file mode 100644
index 0000000..730e743
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp4_BN158.h
@@ -0,0 +1,349 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP4_BN158_H
+#define FP4_BN158_H
+
+#include "fp2_BN158.h"
+#include "config_curve_BN158.h"
+
+using namespace core;
+
+namespace BN158 {
+
+/**
+	@brief FP4 Structure - towered over two FP2
+*/
+
+typedef struct
+{
+    FP2 a; /**< real part of FP4 */
+    FP2 b; /**< imaginary part of FP4 */
+} FP4;
+
+
+/* FP4 prototypes */
+/**	@brief Tests for FP4 equal to zero
+ *
+	@param x FP4 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP4_iszilch(FP4 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP4 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP4_islarger(FP4 *x);
+
+/**	@brief Serialize out FP4  
+ *
+    @param b buffer for output
+	@param x FP4 number to be serialized
+ */
+extern void FP4_toBytes(char *b,FP4 *x);
+
+/**	@brief Serialize in FP4  
+ *
+	@param x FP4 number to be serialized
+    @param b buffer for input
+ */
+extern void FP4_fromBytes(FP4 *x,char *b);
+
+/**	@brief Tests for FP4 equal to unity
+ *
+	@param x FP4 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP4_isunity(FP4 *x);
+/**	@brief Tests for equality of two FP4s
+ *
+	@param x FP4 instance to be compared
+	@param y FP4 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP4_equals(FP4 *x, FP4 *y);
+/**	@brief Tests for FP4 having only a real part and no imaginary part
+ *
+	@param x FP4 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP4_isreal(FP4 *x);
+/**	@brief Initialise FP4 from two FP2s
+ *
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+	@param b FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2s(FP4 *x, FP2 *a, FP2 *b);
+/**	@brief Initialise FP4 from single FP2
+ *
+	Imaginary part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+ */
+extern void FP4_from_FP2(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP2
+ *
+	real part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2H(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP
+ *
+	@param x FP4 instance to be initialised
+	@param a FP to form real part of FP4
+ */
+extern void FP4_from_FP(FP4 *x, FP *a);
+
+/**	@brief Copy FP4 to another FP4
+ *
+	@param x FP4 instance, on exit = y
+	@param y FP4 instance to be copied
+ */
+extern void FP4_copy(FP4 *x, FP4 *y);
+/**	@brief Set FP4 to zero
+ *
+	@param x FP4 instance to be set to zero
+ */
+extern void FP4_zero(FP4 *x);
+/**	@brief Set FP4 to unity
+ *
+	@param x FP4 instance to be set to one
+ */
+extern void FP4_one(FP4 *x);
+
+/**	@brief Sign of FP4
+ *
+	@param x FP4 instance
+	@return "sign" of FP4
+ */
+extern int FP4_sign(FP4 *x);
+
+/**	@brief Negation of FP4
+ *
+	@param x FP4 instance, on exit = -y
+	@param y FP4 instance
+ */
+extern void FP4_neg(FP4 *x, FP4 *y);
+/**	@brief Conjugation of FP4
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP4 instance, on exit = conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_conj(FP4 *x, FP4 *y);
+/**	@brief Negative conjugation of FP4
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP4 instance, on exit = -conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_nconj(FP4 *x, FP4 *y);
+/**	@brief addition of two FP4s
+ *
+	@param x FP4 instance, on exit = y+z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_add(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief subtraction of two FP4s
+ *
+	@param x FP4 instance, on exit = y-z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_sub(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Multiplication of an FP4 by an FP2
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP2 multiplier
+ */
+extern void FP4_pmul(FP4 *x, FP4 *y, FP2 *a);
+
+
+/**	@brief Multiplication of an FP4 by an FP
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP multiplier
+ */
+extern void FP4_qmul(FP4 *x, FP4 *y, FP *a);
+
+/**	@brief Multiplication of an FP4 by a small integer
+ *
+	@param x FP4 instance, on exit = y*i
+	@param y FP4 instance
+	@param i an integer
+ */
+extern void FP4_imul(FP4 *x, FP4 *y, int i);
+/**	@brief Squaring an FP4
+ *
+	@param x FP4 instance, on exit = y^2
+	@param y FP4 instance
+ */
+extern void FP4_sqr(FP4 *x, FP4 *y);
+/**	@brief Multiplication of two FP4s
+ *
+	@param x FP4 instance, on exit = y*z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_mul(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Inverting an FP4
+ *
+	@param x FP4 instance, on exit = 1/y
+	@param y FP4 instance
+    @param h optional input hint
+ */
+extern void FP4_inv(FP4 *x, FP4 *y, FP *h);
+
+/**	@brief Divide an FP4 by 2
+ *
+	@param x FP4 instance, on exit = y/2
+	@param y FP4 instance
+ */
+extern void FP4_div2(FP4 *x, FP4 *y);
+
+
+/**	@brief Formats and outputs an FP4 to the console
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_output(FP4 *x);
+/**	@brief Formats and outputs an FP4 to the console in raw form (for debugging)
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_rawoutput(FP4 *x);
+/**	@brief multiplies an FP4 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP4 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP4_times_i(FP4 *x);
+/**	@brief Normalises the components of an FP4
+ *
+	@param x FP4 instance to be normalised
+ */
+extern void FP4_norm(FP4 *x);
+/**	@brief Reduces all components of possibly unreduced FP4 mod Modulus
+ *
+	@param x FP4 instance, on exit reduced mod Modulus
+ */
+extern void FP4_reduce(FP4 *x);
+/**	@brief Raises an FP4 to the power of a BIG
+ *
+	@param x FP4 instance, on exit = y^b
+	@param y FP4 instance
+	@param b BIG number
+ */
+extern void FP4_pow(FP4 *x, FP4 *y, B160_28::BIG b);
+/**	@brief Raises an FP4 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP4 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP4_frob(FP4 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP4 instance, on exit = w*x-conj(x)*y+z
+	@param w FP4 instance
+	@param x FP4 instance
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_xtr_A(FP4 *r, FP4 *w, FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP4 instance, on exit = x^2-2*conj(x)
+	@param x FP4 instance
+ */
+extern void FP4_xtr_D(FP4 *r, FP4 *x);
+/**	@brief Calculates FP4 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP4 instance, on exit = trace(w^b)
+	@param x FP4 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP4_xtr_pow(FP4 *r, FP4 *x, B160_28::BIG b);
+/**	@brief Calculates FP4 trace of c^a.d^b, where c and d are derived from FP4 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP4 instance, on exit = trace(c^a.d^b)
+	@param c FP4 instance, trace of an FP12
+	@param d FP4 instance, trace of an FP12
+	@param e FP4 instance, trace of an FP12
+	@param f FP4 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP4_xtr_pow2(FP4 *r, FP4 *c, FP4 *d, FP4 *e, FP4 *f, B160_28::BIG a, B160_28::BIG b);
+
+/**	@brief Test FP4 for QR
+ * 
+	@param r FP4 instance
+    @param h optional generated hint
+	@return 1 x is a QR, otherwise 0
+ */
+extern int  FP4_qr(FP4 *r, FP *h);
+
+/**	@brief Calculate square root of an FP4
+ *
+	Square root
+	@param r FP4 instance, on exit = sqrt(x)
+	@param x FP4 instance
+    @param h optional input hint
+ */
+extern void  FP4_sqrt(FP4 *r, FP4 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP4 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP4 instance, set to y if s!=0
+	@param y another FP4 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP4_cmove(FP4 *x, FP4 *y, int s);
+
+
+/**	@brief Divide FP4 number by QNR
+ *
+	Divide FP4 by the QNR
+	@param x FP4 instance
+ */
+extern void FP4_div_i(FP4 *x);
+
+/**	@brief Generate random FP4
+ *
+	@param x random FP4 number
+	@param rng random number generator
+ */
+extern void FP4_rand(FP4 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp4_BN254.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp4_BN254.h
new file mode 100644
index 0000000..438a70c
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp4_BN254.h
@@ -0,0 +1,349 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP4_BN254_H
+#define FP4_BN254_H
+
+#include "fp2_BN254.h"
+#include "config_curve_BN254.h"
+
+using namespace core;
+
+namespace BN254 {
+
+/**
+	@brief FP4 Structure - towered over two FP2
+*/
+
+typedef struct
+{
+    FP2 a; /**< real part of FP4 */
+    FP2 b; /**< imaginary part of FP4 */
+} FP4;
+
+
+/* FP4 prototypes */
+/**	@brief Tests for FP4 equal to zero
+ *
+	@param x FP4 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP4_iszilch(FP4 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP4 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP4_islarger(FP4 *x);
+
+/**	@brief Serialize out FP4  
+ *
+    @param b buffer for output
+	@param x FP4 number to be serialized
+ */
+extern void FP4_toBytes(char *b,FP4 *x);
+
+/**	@brief Serialize in FP4  
+ *
+	@param x FP4 number to be serialized
+    @param b buffer for input
+ */
+extern void FP4_fromBytes(FP4 *x,char *b);
+
+/**	@brief Tests for FP4 equal to unity
+ *
+	@param x FP4 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP4_isunity(FP4 *x);
+/**	@brief Tests for equality of two FP4s
+ *
+	@param x FP4 instance to be compared
+	@param y FP4 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP4_equals(FP4 *x, FP4 *y);
+/**	@brief Tests for FP4 having only a real part and no imaginary part
+ *
+	@param x FP4 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP4_isreal(FP4 *x);
+/**	@brief Initialise FP4 from two FP2s
+ *
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+	@param b FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2s(FP4 *x, FP2 *a, FP2 *b);
+/**	@brief Initialise FP4 from single FP2
+ *
+	Imaginary part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+ */
+extern void FP4_from_FP2(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP2
+ *
+	real part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2H(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP
+ *
+	@param x FP4 instance to be initialised
+	@param a FP to form real part of FP4
+ */
+extern void FP4_from_FP(FP4 *x, FP *a);
+
+/**	@brief Copy FP4 to another FP4
+ *
+	@param x FP4 instance, on exit = y
+	@param y FP4 instance to be copied
+ */
+extern void FP4_copy(FP4 *x, FP4 *y);
+/**	@brief Set FP4 to zero
+ *
+	@param x FP4 instance to be set to zero
+ */
+extern void FP4_zero(FP4 *x);
+/**	@brief Set FP4 to unity
+ *
+	@param x FP4 instance to be set to one
+ */
+extern void FP4_one(FP4 *x);
+
+/**	@brief Sign of FP4
+ *
+	@param x FP4 instance
+	@return "sign" of FP4
+ */
+extern int FP4_sign(FP4 *x);
+
+/**	@brief Negation of FP4
+ *
+	@param x FP4 instance, on exit = -y
+	@param y FP4 instance
+ */
+extern void FP4_neg(FP4 *x, FP4 *y);
+/**	@brief Conjugation of FP4
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP4 instance, on exit = conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_conj(FP4 *x, FP4 *y);
+/**	@brief Negative conjugation of FP4
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP4 instance, on exit = -conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_nconj(FP4 *x, FP4 *y);
+/**	@brief addition of two FP4s
+ *
+	@param x FP4 instance, on exit = y+z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_add(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief subtraction of two FP4s
+ *
+	@param x FP4 instance, on exit = y-z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_sub(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Multiplication of an FP4 by an FP2
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP2 multiplier
+ */
+extern void FP4_pmul(FP4 *x, FP4 *y, FP2 *a);
+
+
+/**	@brief Multiplication of an FP4 by an FP
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP multiplier
+ */
+extern void FP4_qmul(FP4 *x, FP4 *y, FP *a);
+
+/**	@brief Multiplication of an FP4 by a small integer
+ *
+	@param x FP4 instance, on exit = y*i
+	@param y FP4 instance
+	@param i an integer
+ */
+extern void FP4_imul(FP4 *x, FP4 *y, int i);
+/**	@brief Squaring an FP4
+ *
+	@param x FP4 instance, on exit = y^2
+	@param y FP4 instance
+ */
+extern void FP4_sqr(FP4 *x, FP4 *y);
+/**	@brief Multiplication of two FP4s
+ *
+	@param x FP4 instance, on exit = y*z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_mul(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Inverting an FP4
+ *
+	@param x FP4 instance, on exit = 1/y
+	@param y FP4 instance
+    @param h optional input hint
+ */
+extern void FP4_inv(FP4 *x, FP4 *y, FP *h);
+
+/**	@brief Divide an FP4 by 2
+ *
+	@param x FP4 instance, on exit = y/2
+	@param y FP4 instance
+ */
+extern void FP4_div2(FP4 *x, FP4 *y);
+
+
+/**	@brief Formats and outputs an FP4 to the console
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_output(FP4 *x);
+/**	@brief Formats and outputs an FP4 to the console in raw form (for debugging)
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_rawoutput(FP4 *x);
+/**	@brief multiplies an FP4 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP4 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP4_times_i(FP4 *x);
+/**	@brief Normalises the components of an FP4
+ *
+	@param x FP4 instance to be normalised
+ */
+extern void FP4_norm(FP4 *x);
+/**	@brief Reduces all components of possibly unreduced FP4 mod Modulus
+ *
+	@param x FP4 instance, on exit reduced mod Modulus
+ */
+extern void FP4_reduce(FP4 *x);
+/**	@brief Raises an FP4 to the power of a BIG
+ *
+	@param x FP4 instance, on exit = y^b
+	@param y FP4 instance
+	@param b BIG number
+ */
+extern void FP4_pow(FP4 *x, FP4 *y, B256_28::BIG b);
+/**	@brief Raises an FP4 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP4 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP4_frob(FP4 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP4 instance, on exit = w*x-conj(x)*y+z
+	@param w FP4 instance
+	@param x FP4 instance
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_xtr_A(FP4 *r, FP4 *w, FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP4 instance, on exit = x^2-2*conj(x)
+	@param x FP4 instance
+ */
+extern void FP4_xtr_D(FP4 *r, FP4 *x);
+/**	@brief Calculates FP4 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP4 instance, on exit = trace(w^b)
+	@param x FP4 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP4_xtr_pow(FP4 *r, FP4 *x, B256_28::BIG b);
+/**	@brief Calculates FP4 trace of c^a.d^b, where c and d are derived from FP4 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP4 instance, on exit = trace(c^a.d^b)
+	@param c FP4 instance, trace of an FP12
+	@param d FP4 instance, trace of an FP12
+	@param e FP4 instance, trace of an FP12
+	@param f FP4 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP4_xtr_pow2(FP4 *r, FP4 *c, FP4 *d, FP4 *e, FP4 *f, B256_28::BIG a, B256_28::BIG b);
+
+/**	@brief Test FP4 for QR
+ * 
+	@param r FP4 instance
+    @param h optional generated hint
+	@return 1 x is a QR, otherwise 0
+ */
+extern int  FP4_qr(FP4 *r, FP *h);
+
+/**	@brief Calculate square root of an FP4
+ *
+	Square root
+	@param r FP4 instance, on exit = sqrt(x)
+	@param x FP4 instance
+    @param h optional input hint
+ */
+extern void  FP4_sqrt(FP4 *r, FP4 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP4 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP4 instance, set to y if s!=0
+	@param y another FP4 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP4_cmove(FP4 *x, FP4 *y, int s);
+
+
+/**	@brief Divide FP4 number by QNR
+ *
+	Divide FP4 by the QNR
+	@param x FP4 instance
+ */
+extern void FP4_div_i(FP4 *x);
+
+/**	@brief Generate random FP4
+ *
+	@param x random FP4 number
+	@param rng random number generator
+ */
+extern void FP4_rand(FP4 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp4_BN254CX.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp4_BN254CX.h
new file mode 100644
index 0000000..85a9a27
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp4_BN254CX.h
@@ -0,0 +1,349 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP4_BN254CX_H
+#define FP4_BN254CX_H
+
+#include "fp2_BN254CX.h"
+#include "config_curve_BN254CX.h"
+
+using namespace core;
+
+namespace BN254CX {
+
+/**
+	@brief FP4 Structure - towered over two FP2
+*/
+
+typedef struct
+{
+    FP2 a; /**< real part of FP4 */
+    FP2 b; /**< imaginary part of FP4 */
+} FP4;
+
+
+/* FP4 prototypes */
+/**	@brief Tests for FP4 equal to zero
+ *
+	@param x FP4 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP4_iszilch(FP4 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP4 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP4_islarger(FP4 *x);
+
+/**	@brief Serialize out FP4  
+ *
+    @param b buffer for output
+	@param x FP4 number to be serialized
+ */
+extern void FP4_toBytes(char *b,FP4 *x);
+
+/**	@brief Serialize in FP4  
+ *
+	@param x FP4 number to be serialized
+    @param b buffer for input
+ */
+extern void FP4_fromBytes(FP4 *x,char *b);
+
+/**	@brief Tests for FP4 equal to unity
+ *
+	@param x FP4 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP4_isunity(FP4 *x);
+/**	@brief Tests for equality of two FP4s
+ *
+	@param x FP4 instance to be compared
+	@param y FP4 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP4_equals(FP4 *x, FP4 *y);
+/**	@brief Tests for FP4 having only a real part and no imaginary part
+ *
+	@param x FP4 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP4_isreal(FP4 *x);
+/**	@brief Initialise FP4 from two FP2s
+ *
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+	@param b FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2s(FP4 *x, FP2 *a, FP2 *b);
+/**	@brief Initialise FP4 from single FP2
+ *
+	Imaginary part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+ */
+extern void FP4_from_FP2(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP2
+ *
+	real part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2H(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP
+ *
+	@param x FP4 instance to be initialised
+	@param a FP to form real part of FP4
+ */
+extern void FP4_from_FP(FP4 *x, FP *a);
+
+/**	@brief Copy FP4 to another FP4
+ *
+	@param x FP4 instance, on exit = y
+	@param y FP4 instance to be copied
+ */
+extern void FP4_copy(FP4 *x, FP4 *y);
+/**	@brief Set FP4 to zero
+ *
+	@param x FP4 instance to be set to zero
+ */
+extern void FP4_zero(FP4 *x);
+/**	@brief Set FP4 to unity
+ *
+	@param x FP4 instance to be set to one
+ */
+extern void FP4_one(FP4 *x);
+
+/**	@brief Sign of FP4
+ *
+	@param x FP4 instance
+	@return "sign" of FP4
+ */
+extern int FP4_sign(FP4 *x);
+
+/**	@brief Negation of FP4
+ *
+	@param x FP4 instance, on exit = -y
+	@param y FP4 instance
+ */
+extern void FP4_neg(FP4 *x, FP4 *y);
+/**	@brief Conjugation of FP4
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP4 instance, on exit = conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_conj(FP4 *x, FP4 *y);
+/**	@brief Negative conjugation of FP4
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP4 instance, on exit = -conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_nconj(FP4 *x, FP4 *y);
+/**	@brief addition of two FP4s
+ *
+	@param x FP4 instance, on exit = y+z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_add(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief subtraction of two FP4s
+ *
+	@param x FP4 instance, on exit = y-z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_sub(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Multiplication of an FP4 by an FP2
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP2 multiplier
+ */
+extern void FP4_pmul(FP4 *x, FP4 *y, FP2 *a);
+
+
+/**	@brief Multiplication of an FP4 by an FP
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP multiplier
+ */
+extern void FP4_qmul(FP4 *x, FP4 *y, FP *a);
+
+/**	@brief Multiplication of an FP4 by a small integer
+ *
+	@param x FP4 instance, on exit = y*i
+	@param y FP4 instance
+	@param i an integer
+ */
+extern void FP4_imul(FP4 *x, FP4 *y, int i);
+/**	@brief Squaring an FP4
+ *
+	@param x FP4 instance, on exit = y^2
+	@param y FP4 instance
+ */
+extern void FP4_sqr(FP4 *x, FP4 *y);
+/**	@brief Multiplication of two FP4s
+ *
+	@param x FP4 instance, on exit = y*z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_mul(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Inverting an FP4
+ *
+	@param x FP4 instance, on exit = 1/y
+	@param y FP4 instance
+    @param h optional input hint
+ */
+extern void FP4_inv(FP4 *x, FP4 *y, FP *h);
+
+/**	@brief Divide an FP4 by 2
+ *
+	@param x FP4 instance, on exit = y/2
+	@param y FP4 instance
+ */
+extern void FP4_div2(FP4 *x, FP4 *y);
+
+
+/**	@brief Formats and outputs an FP4 to the console
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_output(FP4 *x);
+/**	@brief Formats and outputs an FP4 to the console in raw form (for debugging)
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_rawoutput(FP4 *x);
+/**	@brief multiplies an FP4 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP4 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP4_times_i(FP4 *x);
+/**	@brief Normalises the components of an FP4
+ *
+	@param x FP4 instance to be normalised
+ */
+extern void FP4_norm(FP4 *x);
+/**	@brief Reduces all components of possibly unreduced FP4 mod Modulus
+ *
+	@param x FP4 instance, on exit reduced mod Modulus
+ */
+extern void FP4_reduce(FP4 *x);
+/**	@brief Raises an FP4 to the power of a BIG
+ *
+	@param x FP4 instance, on exit = y^b
+	@param y FP4 instance
+	@param b BIG number
+ */
+extern void FP4_pow(FP4 *x, FP4 *y, B256_28::BIG b);
+/**	@brief Raises an FP4 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP4 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP4_frob(FP4 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP4 instance, on exit = w*x-conj(x)*y+z
+	@param w FP4 instance
+	@param x FP4 instance
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_xtr_A(FP4 *r, FP4 *w, FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP4 instance, on exit = x^2-2*conj(x)
+	@param x FP4 instance
+ */
+extern void FP4_xtr_D(FP4 *r, FP4 *x);
+/**	@brief Calculates FP4 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP4 instance, on exit = trace(w^b)
+	@param x FP4 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP4_xtr_pow(FP4 *r, FP4 *x, B256_28::BIG b);
+/**	@brief Calculates FP4 trace of c^a.d^b, where c and d are derived from FP4 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP4 instance, on exit = trace(c^a.d^b)
+	@param c FP4 instance, trace of an FP12
+	@param d FP4 instance, trace of an FP12
+	@param e FP4 instance, trace of an FP12
+	@param f FP4 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP4_xtr_pow2(FP4 *r, FP4 *c, FP4 *d, FP4 *e, FP4 *f, B256_28::BIG a, B256_28::BIG b);
+
+/**	@brief Test FP4 for QR
+ * 
+	@param r FP4 instance
+    @param h optional generated hint
+	@return 1 x is a QR, otherwise 0
+ */
+extern int  FP4_qr(FP4 *r, FP *h);
+
+/**	@brief Calculate square root of an FP4
+ *
+	Square root
+	@param r FP4 instance, on exit = sqrt(x)
+	@param x FP4 instance
+    @param h optional input hint
+ */
+extern void  FP4_sqrt(FP4 *r, FP4 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP4 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP4 instance, set to y if s!=0
+	@param y another FP4 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP4_cmove(FP4 *x, FP4 *y, int s);
+
+
+/**	@brief Divide FP4 number by QNR
+ *
+	Divide FP4 by the QNR
+	@param x FP4 instance
+ */
+extern void FP4_div_i(FP4 *x);
+
+/**	@brief Generate random FP4
+ *
+	@param x random FP4 number
+	@param rng random number generator
+ */
+extern void FP4_rand(FP4 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp4_BN462.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp4_BN462.h
new file mode 100644
index 0000000..fcce735
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp4_BN462.h
@@ -0,0 +1,349 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP4_BN462_H
+#define FP4_BN462_H
+
+#include "fp2_BN462.h"
+#include "config_curve_BN462.h"
+
+using namespace core;
+
+namespace BN462 {
+
+/**
+	@brief FP4 Structure - towered over two FP2
+*/
+
+typedef struct
+{
+    FP2 a; /**< real part of FP4 */
+    FP2 b; /**< imaginary part of FP4 */
+} FP4;
+
+
+/* FP4 prototypes */
+/**	@brief Tests for FP4 equal to zero
+ *
+	@param x FP4 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP4_iszilch(FP4 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP4 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP4_islarger(FP4 *x);
+
+/**	@brief Serialize out FP4  
+ *
+    @param b buffer for output
+	@param x FP4 number to be serialized
+ */
+extern void FP4_toBytes(char *b,FP4 *x);
+
+/**	@brief Serialize in FP4  
+ *
+	@param x FP4 number to be serialized
+    @param b buffer for input
+ */
+extern void FP4_fromBytes(FP4 *x,char *b);
+
+/**	@brief Tests for FP4 equal to unity
+ *
+	@param x FP4 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP4_isunity(FP4 *x);
+/**	@brief Tests for equality of two FP4s
+ *
+	@param x FP4 instance to be compared
+	@param y FP4 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP4_equals(FP4 *x, FP4 *y);
+/**	@brief Tests for FP4 having only a real part and no imaginary part
+ *
+	@param x FP4 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP4_isreal(FP4 *x);
+/**	@brief Initialise FP4 from two FP2s
+ *
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+	@param b FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2s(FP4 *x, FP2 *a, FP2 *b);
+/**	@brief Initialise FP4 from single FP2
+ *
+	Imaginary part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+ */
+extern void FP4_from_FP2(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP2
+ *
+	real part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2H(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP
+ *
+	@param x FP4 instance to be initialised
+	@param a FP to form real part of FP4
+ */
+extern void FP4_from_FP(FP4 *x, FP *a);
+
+/**	@brief Copy FP4 to another FP4
+ *
+	@param x FP4 instance, on exit = y
+	@param y FP4 instance to be copied
+ */
+extern void FP4_copy(FP4 *x, FP4 *y);
+/**	@brief Set FP4 to zero
+ *
+	@param x FP4 instance to be set to zero
+ */
+extern void FP4_zero(FP4 *x);
+/**	@brief Set FP4 to unity
+ *
+	@param x FP4 instance to be set to one
+ */
+extern void FP4_one(FP4 *x);
+
+/**	@brief Sign of FP4
+ *
+	@param x FP4 instance
+	@return "sign" of FP4
+ */
+extern int FP4_sign(FP4 *x);
+
+/**	@brief Negation of FP4
+ *
+	@param x FP4 instance, on exit = -y
+	@param y FP4 instance
+ */
+extern void FP4_neg(FP4 *x, FP4 *y);
+/**	@brief Conjugation of FP4
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP4 instance, on exit = conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_conj(FP4 *x, FP4 *y);
+/**	@brief Negative conjugation of FP4
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP4 instance, on exit = -conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_nconj(FP4 *x, FP4 *y);
+/**	@brief addition of two FP4s
+ *
+	@param x FP4 instance, on exit = y+z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_add(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief subtraction of two FP4s
+ *
+	@param x FP4 instance, on exit = y-z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_sub(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Multiplication of an FP4 by an FP2
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP2 multiplier
+ */
+extern void FP4_pmul(FP4 *x, FP4 *y, FP2 *a);
+
+
+/**	@brief Multiplication of an FP4 by an FP
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP multiplier
+ */
+extern void FP4_qmul(FP4 *x, FP4 *y, FP *a);
+
+/**	@brief Multiplication of an FP4 by a small integer
+ *
+	@param x FP4 instance, on exit = y*i
+	@param y FP4 instance
+	@param i an integer
+ */
+extern void FP4_imul(FP4 *x, FP4 *y, int i);
+/**	@brief Squaring an FP4
+ *
+	@param x FP4 instance, on exit = y^2
+	@param y FP4 instance
+ */
+extern void FP4_sqr(FP4 *x, FP4 *y);
+/**	@brief Multiplication of two FP4s
+ *
+	@param x FP4 instance, on exit = y*z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_mul(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Inverting an FP4
+ *
+	@param x FP4 instance, on exit = 1/y
+	@param y FP4 instance
+    @param h optional input hint
+ */
+extern void FP4_inv(FP4 *x, FP4 *y, FP *h);
+
+/**	@brief Divide an FP4 by 2
+ *
+	@param x FP4 instance, on exit = y/2
+	@param y FP4 instance
+ */
+extern void FP4_div2(FP4 *x, FP4 *y);
+
+
+/**	@brief Formats and outputs an FP4 to the console
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_output(FP4 *x);
+/**	@brief Formats and outputs an FP4 to the console in raw form (for debugging)
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_rawoutput(FP4 *x);
+/**	@brief multiplies an FP4 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP4 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP4_times_i(FP4 *x);
+/**	@brief Normalises the components of an FP4
+ *
+	@param x FP4 instance to be normalised
+ */
+extern void FP4_norm(FP4 *x);
+/**	@brief Reduces all components of possibly unreduced FP4 mod Modulus
+ *
+	@param x FP4 instance, on exit reduced mod Modulus
+ */
+extern void FP4_reduce(FP4 *x);
+/**	@brief Raises an FP4 to the power of a BIG
+ *
+	@param x FP4 instance, on exit = y^b
+	@param y FP4 instance
+	@param b BIG number
+ */
+extern void FP4_pow(FP4 *x, FP4 *y, B464_28::BIG b);
+/**	@brief Raises an FP4 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP4 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP4_frob(FP4 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP4 instance, on exit = w*x-conj(x)*y+z
+	@param w FP4 instance
+	@param x FP4 instance
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_xtr_A(FP4 *r, FP4 *w, FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP4 instance, on exit = x^2-2*conj(x)
+	@param x FP4 instance
+ */
+extern void FP4_xtr_D(FP4 *r, FP4 *x);
+/**	@brief Calculates FP4 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP4 instance, on exit = trace(w^b)
+	@param x FP4 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP4_xtr_pow(FP4 *r, FP4 *x, B464_28::BIG b);
+/**	@brief Calculates FP4 trace of c^a.d^b, where c and d are derived from FP4 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP4 instance, on exit = trace(c^a.d^b)
+	@param c FP4 instance, trace of an FP12
+	@param d FP4 instance, trace of an FP12
+	@param e FP4 instance, trace of an FP12
+	@param f FP4 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP4_xtr_pow2(FP4 *r, FP4 *c, FP4 *d, FP4 *e, FP4 *f, B464_28::BIG a, B464_28::BIG b);
+
+/**	@brief Test FP4 for QR
+ * 
+	@param r FP4 instance
+    @param h optional generated hint
+	@return 1 x is a QR, otherwise 0
+ */
+extern int  FP4_qr(FP4 *r, FP *h);
+
+/**	@brief Calculate square root of an FP4
+ *
+	Square root
+	@param r FP4 instance, on exit = sqrt(x)
+	@param x FP4 instance
+    @param h optional input hint
+ */
+extern void  FP4_sqrt(FP4 *r, FP4 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP4 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP4 instance, set to y if s!=0
+	@param y another FP4 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP4_cmove(FP4 *x, FP4 *y, int s);
+
+
+/**	@brief Divide FP4 number by QNR
+ *
+	Divide FP4 by the QNR
+	@param x FP4 instance
+ */
+extern void FP4_div_i(FP4 *x);
+
+/**	@brief Generate random FP4
+ *
+	@param x random FP4 number
+	@param rng random number generator
+ */
+extern void FP4_rand(FP4 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp4_FP256BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp4_FP256BN.h
new file mode 100644
index 0000000..3967a2a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp4_FP256BN.h
@@ -0,0 +1,349 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP4_FP256BN_H
+#define FP4_FP256BN_H
+
+#include "fp2_FP256BN.h"
+#include "config_curve_FP256BN.h"
+
+using namespace core;
+
+namespace FP256BN {
+
+/**
+	@brief FP4 Structure - towered over two FP2
+*/
+
+typedef struct
+{
+    FP2 a; /**< real part of FP4 */
+    FP2 b; /**< imaginary part of FP4 */
+} FP4;
+
+
+/* FP4 prototypes */
+/**	@brief Tests for FP4 equal to zero
+ *
+	@param x FP4 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP4_iszilch(FP4 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP4 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP4_islarger(FP4 *x);
+
+/**	@brief Serialize out FP4  
+ *
+    @param b buffer for output
+	@param x FP4 number to be serialized
+ */
+extern void FP4_toBytes(char *b,FP4 *x);
+
+/**	@brief Serialize in FP4  
+ *
+	@param x FP4 number to be serialized
+    @param b buffer for input
+ */
+extern void FP4_fromBytes(FP4 *x,char *b);
+
+/**	@brief Tests for FP4 equal to unity
+ *
+	@param x FP4 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP4_isunity(FP4 *x);
+/**	@brief Tests for equality of two FP4s
+ *
+	@param x FP4 instance to be compared
+	@param y FP4 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP4_equals(FP4 *x, FP4 *y);
+/**	@brief Tests for FP4 having only a real part and no imaginary part
+ *
+	@param x FP4 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP4_isreal(FP4 *x);
+/**	@brief Initialise FP4 from two FP2s
+ *
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+	@param b FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2s(FP4 *x, FP2 *a, FP2 *b);
+/**	@brief Initialise FP4 from single FP2
+ *
+	Imaginary part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+ */
+extern void FP4_from_FP2(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP2
+ *
+	real part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2H(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP
+ *
+	@param x FP4 instance to be initialised
+	@param a FP to form real part of FP4
+ */
+extern void FP4_from_FP(FP4 *x, FP *a);
+
+/**	@brief Copy FP4 to another FP4
+ *
+	@param x FP4 instance, on exit = y
+	@param y FP4 instance to be copied
+ */
+extern void FP4_copy(FP4 *x, FP4 *y);
+/**	@brief Set FP4 to zero
+ *
+	@param x FP4 instance to be set to zero
+ */
+extern void FP4_zero(FP4 *x);
+/**	@brief Set FP4 to unity
+ *
+	@param x FP4 instance to be set to one
+ */
+extern void FP4_one(FP4 *x);
+
+/**	@brief Sign of FP4
+ *
+	@param x FP4 instance
+	@return "sign" of FP4
+ */
+extern int FP4_sign(FP4 *x);
+
+/**	@brief Negation of FP4
+ *
+	@param x FP4 instance, on exit = -y
+	@param y FP4 instance
+ */
+extern void FP4_neg(FP4 *x, FP4 *y);
+/**	@brief Conjugation of FP4
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP4 instance, on exit = conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_conj(FP4 *x, FP4 *y);
+/**	@brief Negative conjugation of FP4
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP4 instance, on exit = -conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_nconj(FP4 *x, FP4 *y);
+/**	@brief addition of two FP4s
+ *
+	@param x FP4 instance, on exit = y+z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_add(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief subtraction of two FP4s
+ *
+	@param x FP4 instance, on exit = y-z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_sub(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Multiplication of an FP4 by an FP2
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP2 multiplier
+ */
+extern void FP4_pmul(FP4 *x, FP4 *y, FP2 *a);
+
+
+/**	@brief Multiplication of an FP4 by an FP
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP multiplier
+ */
+extern void FP4_qmul(FP4 *x, FP4 *y, FP *a);
+
+/**	@brief Multiplication of an FP4 by a small integer
+ *
+	@param x FP4 instance, on exit = y*i
+	@param y FP4 instance
+	@param i an integer
+ */
+extern void FP4_imul(FP4 *x, FP4 *y, int i);
+/**	@brief Squaring an FP4
+ *
+	@param x FP4 instance, on exit = y^2
+	@param y FP4 instance
+ */
+extern void FP4_sqr(FP4 *x, FP4 *y);
+/**	@brief Multiplication of two FP4s
+ *
+	@param x FP4 instance, on exit = y*z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_mul(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Inverting an FP4
+ *
+	@param x FP4 instance, on exit = 1/y
+	@param y FP4 instance
+    @param h optional input hint
+ */
+extern void FP4_inv(FP4 *x, FP4 *y, FP *h);
+
+/**	@brief Divide an FP4 by 2
+ *
+	@param x FP4 instance, on exit = y/2
+	@param y FP4 instance
+ */
+extern void FP4_div2(FP4 *x, FP4 *y);
+
+
+/**	@brief Formats and outputs an FP4 to the console
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_output(FP4 *x);
+/**	@brief Formats and outputs an FP4 to the console in raw form (for debugging)
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_rawoutput(FP4 *x);
+/**	@brief multiplies an FP4 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP4 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP4_times_i(FP4 *x);
+/**	@brief Normalises the components of an FP4
+ *
+	@param x FP4 instance to be normalised
+ */
+extern void FP4_norm(FP4 *x);
+/**	@brief Reduces all components of possibly unreduced FP4 mod Modulus
+ *
+	@param x FP4 instance, on exit reduced mod Modulus
+ */
+extern void FP4_reduce(FP4 *x);
+/**	@brief Raises an FP4 to the power of a BIG
+ *
+	@param x FP4 instance, on exit = y^b
+	@param y FP4 instance
+	@param b BIG number
+ */
+extern void FP4_pow(FP4 *x, FP4 *y, B256_28::BIG b);
+/**	@brief Raises an FP4 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP4 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP4_frob(FP4 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP4 instance, on exit = w*x-conj(x)*y+z
+	@param w FP4 instance
+	@param x FP4 instance
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_xtr_A(FP4 *r, FP4 *w, FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP4 instance, on exit = x^2-2*conj(x)
+	@param x FP4 instance
+ */
+extern void FP4_xtr_D(FP4 *r, FP4 *x);
+/**	@brief Calculates FP4 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP4 instance, on exit = trace(w^b)
+	@param x FP4 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP4_xtr_pow(FP4 *r, FP4 *x, B256_28::BIG b);
+/**	@brief Calculates FP4 trace of c^a.d^b, where c and d are derived from FP4 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP4 instance, on exit = trace(c^a.d^b)
+	@param c FP4 instance, trace of an FP12
+	@param d FP4 instance, trace of an FP12
+	@param e FP4 instance, trace of an FP12
+	@param f FP4 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP4_xtr_pow2(FP4 *r, FP4 *c, FP4 *d, FP4 *e, FP4 *f, B256_28::BIG a, B256_28::BIG b);
+
+/**	@brief Test FP4 for QR
+ * 
+	@param r FP4 instance
+    @param h optional generated hint
+	@return 1 x is a QR, otherwise 0
+ */
+extern int  FP4_qr(FP4 *r, FP *h);
+
+/**	@brief Calculate square root of an FP4
+ *
+	Square root
+	@param r FP4 instance, on exit = sqrt(x)
+	@param x FP4 instance
+    @param h optional input hint
+ */
+extern void  FP4_sqrt(FP4 *r, FP4 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP4 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP4 instance, set to y if s!=0
+	@param y another FP4 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP4_cmove(FP4 *x, FP4 *y, int s);
+
+
+/**	@brief Divide FP4 number by QNR
+ *
+	Divide FP4 by the QNR
+	@param x FP4 instance
+ */
+extern void FP4_div_i(FP4 *x);
+
+/**	@brief Generate random FP4
+ *
+	@param x random FP4 number
+	@param rng random number generator
+ */
+extern void FP4_rand(FP4 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp4_FP512BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp4_FP512BN.h
new file mode 100644
index 0000000..bda8366
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp4_FP512BN.h
@@ -0,0 +1,349 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP4_FP512BN_H
+#define FP4_FP512BN_H
+
+#include "fp2_FP512BN.h"
+#include "config_curve_FP512BN.h"
+
+using namespace core;
+
+namespace FP512BN {
+
+/**
+	@brief FP4 Structure - towered over two FP2
+*/
+
+typedef struct
+{
+    FP2 a; /**< real part of FP4 */
+    FP2 b; /**< imaginary part of FP4 */
+} FP4;
+
+
+/* FP4 prototypes */
+/**	@brief Tests for FP4 equal to zero
+ *
+	@param x FP4 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP4_iszilch(FP4 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP4 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP4_islarger(FP4 *x);
+
+/**	@brief Serialize out FP4  
+ *
+    @param b buffer for output
+	@param x FP4 number to be serialized
+ */
+extern void FP4_toBytes(char *b,FP4 *x);
+
+/**	@brief Serialize in FP4  
+ *
+	@param x FP4 number to be serialized
+    @param b buffer for input
+ */
+extern void FP4_fromBytes(FP4 *x,char *b);
+
+/**	@brief Tests for FP4 equal to unity
+ *
+	@param x FP4 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP4_isunity(FP4 *x);
+/**	@brief Tests for equality of two FP4s
+ *
+	@param x FP4 instance to be compared
+	@param y FP4 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP4_equals(FP4 *x, FP4 *y);
+/**	@brief Tests for FP4 having only a real part and no imaginary part
+ *
+	@param x FP4 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP4_isreal(FP4 *x);
+/**	@brief Initialise FP4 from two FP2s
+ *
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+	@param b FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2s(FP4 *x, FP2 *a, FP2 *b);
+/**	@brief Initialise FP4 from single FP2
+ *
+	Imaginary part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+ */
+extern void FP4_from_FP2(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP2
+ *
+	real part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2H(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP
+ *
+	@param x FP4 instance to be initialised
+	@param a FP to form real part of FP4
+ */
+extern void FP4_from_FP(FP4 *x, FP *a);
+
+/**	@brief Copy FP4 to another FP4
+ *
+	@param x FP4 instance, on exit = y
+	@param y FP4 instance to be copied
+ */
+extern void FP4_copy(FP4 *x, FP4 *y);
+/**	@brief Set FP4 to zero
+ *
+	@param x FP4 instance to be set to zero
+ */
+extern void FP4_zero(FP4 *x);
+/**	@brief Set FP4 to unity
+ *
+	@param x FP4 instance to be set to one
+ */
+extern void FP4_one(FP4 *x);
+
+/**	@brief Sign of FP4
+ *
+	@param x FP4 instance
+	@return "sign" of FP4
+ */
+extern int FP4_sign(FP4 *x);
+
+/**	@brief Negation of FP4
+ *
+	@param x FP4 instance, on exit = -y
+	@param y FP4 instance
+ */
+extern void FP4_neg(FP4 *x, FP4 *y);
+/**	@brief Conjugation of FP4
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP4 instance, on exit = conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_conj(FP4 *x, FP4 *y);
+/**	@brief Negative conjugation of FP4
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP4 instance, on exit = -conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_nconj(FP4 *x, FP4 *y);
+/**	@brief addition of two FP4s
+ *
+	@param x FP4 instance, on exit = y+z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_add(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief subtraction of two FP4s
+ *
+	@param x FP4 instance, on exit = y-z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_sub(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Multiplication of an FP4 by an FP2
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP2 multiplier
+ */
+extern void FP4_pmul(FP4 *x, FP4 *y, FP2 *a);
+
+
+/**	@brief Multiplication of an FP4 by an FP
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP multiplier
+ */
+extern void FP4_qmul(FP4 *x, FP4 *y, FP *a);
+
+/**	@brief Multiplication of an FP4 by a small integer
+ *
+	@param x FP4 instance, on exit = y*i
+	@param y FP4 instance
+	@param i an integer
+ */
+extern void FP4_imul(FP4 *x, FP4 *y, int i);
+/**	@brief Squaring an FP4
+ *
+	@param x FP4 instance, on exit = y^2
+	@param y FP4 instance
+ */
+extern void FP4_sqr(FP4 *x, FP4 *y);
+/**	@brief Multiplication of two FP4s
+ *
+	@param x FP4 instance, on exit = y*z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_mul(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Inverting an FP4
+ *
+	@param x FP4 instance, on exit = 1/y
+	@param y FP4 instance
+    @param h optional input hint
+ */
+extern void FP4_inv(FP4 *x, FP4 *y, FP *h);
+
+/**	@brief Divide an FP4 by 2
+ *
+	@param x FP4 instance, on exit = y/2
+	@param y FP4 instance
+ */
+extern void FP4_div2(FP4 *x, FP4 *y);
+
+
+/**	@brief Formats and outputs an FP4 to the console
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_output(FP4 *x);
+/**	@brief Formats and outputs an FP4 to the console in raw form (for debugging)
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_rawoutput(FP4 *x);
+/**	@brief multiplies an FP4 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP4 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP4_times_i(FP4 *x);
+/**	@brief Normalises the components of an FP4
+ *
+	@param x FP4 instance to be normalised
+ */
+extern void FP4_norm(FP4 *x);
+/**	@brief Reduces all components of possibly unreduced FP4 mod Modulus
+ *
+	@param x FP4 instance, on exit reduced mod Modulus
+ */
+extern void FP4_reduce(FP4 *x);
+/**	@brief Raises an FP4 to the power of a BIG
+ *
+	@param x FP4 instance, on exit = y^b
+	@param y FP4 instance
+	@param b BIG number
+ */
+extern void FP4_pow(FP4 *x, FP4 *y, B512_29::BIG b);
+/**	@brief Raises an FP4 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP4 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP4_frob(FP4 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP4 instance, on exit = w*x-conj(x)*y+z
+	@param w FP4 instance
+	@param x FP4 instance
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_xtr_A(FP4 *r, FP4 *w, FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP4 instance, on exit = x^2-2*conj(x)
+	@param x FP4 instance
+ */
+extern void FP4_xtr_D(FP4 *r, FP4 *x);
+/**	@brief Calculates FP4 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP4 instance, on exit = trace(w^b)
+	@param x FP4 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP4_xtr_pow(FP4 *r, FP4 *x, B512_29::BIG b);
+/**	@brief Calculates FP4 trace of c^a.d^b, where c and d are derived from FP4 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP4 instance, on exit = trace(c^a.d^b)
+	@param c FP4 instance, trace of an FP12
+	@param d FP4 instance, trace of an FP12
+	@param e FP4 instance, trace of an FP12
+	@param f FP4 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP4_xtr_pow2(FP4 *r, FP4 *c, FP4 *d, FP4 *e, FP4 *f, B512_29::BIG a, B512_29::BIG b);
+
+/**	@brief Test FP4 for QR
+ * 
+	@param r FP4 instance
+    @param h optional generated hint
+	@return 1 x is a QR, otherwise 0
+ */
+extern int  FP4_qr(FP4 *r, FP *h);
+
+/**	@brief Calculate square root of an FP4
+ *
+	Square root
+	@param r FP4 instance, on exit = sqrt(x)
+	@param x FP4 instance
+    @param h optional input hint
+ */
+extern void  FP4_sqrt(FP4 *r, FP4 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP4 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP4 instance, set to y if s!=0
+	@param y another FP4 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP4_cmove(FP4 *x, FP4 *y, int s);
+
+
+/**	@brief Divide FP4 number by QNR
+ *
+	Divide FP4 by the QNR
+	@param x FP4 instance
+ */
+extern void FP4_div_i(FP4 *x);
+
+/**	@brief Generate random FP4
+ *
+	@param x random FP4 number
+	@param rng random number generator
+ */
+extern void FP4_rand(FP4 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp8_BLS24479.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp8_BLS24479.h
new file mode 100644
index 0000000..779e157
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp8_BLS24479.h
@@ -0,0 +1,365 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP8_BLS24479_H
+#define FP8_BLS24479_H
+
+#include "fp4_BLS24479.h"
+#include "config_curve_BLS24479.h"
+
+using namespace core;
+
+namespace BLS24479 {
+
+/**
+	@brief FP8 Structure - towered over two FP4
+*/
+
+typedef struct
+{
+    FP4 a; /**< real part of FP8 */
+    FP4 b; /**< imaginary part of FP8 */
+} FP8;
+
+
+/* FP8 prototypes */
+/**	@brief Tests for FP8 equal to zero
+ *
+	@param x FP8 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP8_iszilch(FP8 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP8 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP8_islarger(FP8 *x);
+
+/**	@brief Serialize in FP8  
+ *
+    @param b buffer for output
+	@param x FP8 number to be serialized
+ */
+extern void FP8_toBytes(char *b,FP8 *x);
+/**	@brief Serialize out FP8  
+ *
+	@param x FP8 number to be serialized
+    @param b buffer for input
+ */
+extern void FP8_fromBytes(FP8 *x,char *b);
+
+
+/**	@brief Tests for FP8 equal to unity
+ *
+	@param x FP8 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP8_isunity(FP8 *x);
+/**	@brief Tests for equality of two FP8s
+ *
+	@param x FP8 instance to be compared
+	@param y FP8 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP8_equals(FP8 *x, FP8 *y);
+/**	@brief Tests for FP8 having only a real part and no imaginary part
+ *
+	@param x FP8 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP8_isreal(FP8 *x);
+/**	@brief Initialise FP8 from two FP4s
+ *
+	@param x FP8 instance to be initialised
+	@param a FP4 to form real part of FP8
+	@param b FP4 to form imaginary part of FP8
+ */
+extern void FP8_from_FP4s(FP8 *x, FP4 *a, FP4 *b);
+/**	@brief Initialise FP8 from single FP4
+ *
+	Imaginary part is set to zero
+	@param x FP8 instance to be initialised
+	@param a FP4 to form real part of FP8
+ */
+extern void FP8_from_FP4(FP8 *x, FP4 *a);
+
+/**	@brief Initialise FP8 from single FP4
+ *
+	real part is set to zero
+	@param x FP8 instance to be initialised
+	@param a FP4 to form imaginary part of FP8
+ */
+extern void FP8_from_FP4H(FP8 *x, FP4 *a);
+
+/**	@brief Initialise FP8 from single FP
+ *
+	@param x FP8 instance to be initialised
+	@param a FP to form real part of FP8
+ */
+extern void FP8_from_FP(FP8 *x, FP *a);
+
+/**	@brief Copy FP8 to another FP8
+ *
+	@param x FP8 instance, on exit = y
+	@param y FP8 instance to be copied
+ */
+extern void FP8_copy(FP8 *x, FP8 *y);
+
+/**	@brief Set FP8 to zero
+ *
+	@param x FP8 instance to be set to zero
+ */
+extern void FP8_zero(FP8 *x);
+/**	@brief Set FP8 to unity
+ *
+	@param x FP8 instance to be set to one
+ */
+extern void FP8_one(FP8 *x);
+
+/**	@brief Sign of FP8
+ *
+	@param x FP8 instance
+	@return "sign" of FP8
+ */
+extern int FP8_sign(FP8 *x);
+
+/**	@brief Negation of FP8
+ *
+	@param x FP8 instance, on exit = -y
+	@param y FP8 instance
+ */
+extern void FP8_neg(FP8 *x, FP8 *y);
+/**	@brief Conjugation of FP8
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP8 instance, on exit = conj(y)
+	@param y FP8 instance
+ */
+extern void FP8_conj(FP8 *x, FP8 *y);
+/**	@brief Negative conjugation of FP8
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP8 instance, on exit = -conj(y)
+	@param y FP8 instance
+ */
+extern void FP8_nconj(FP8 *x, FP8 *y);
+/**	@brief addition of two FP8s
+ *
+	@param x FP8 instance, on exit = y+z
+	@param y FP8 instance
+	@param z FP8 instance
+ */
+extern void FP8_add(FP8 *x, FP8 *y, FP8 *z);
+/**	@brief subtraction of two FP8s
+ *
+	@param x FP8 instance, on exit = y-z
+	@param y FP8 instance
+	@param z FP8 instance
+ */
+extern void FP8_sub(FP8 *x, FP8 *y, FP8 *z);
+/**	@brief Multiplication of an FP8 by an FP4
+ *
+	@param x FP8 instance, on exit = y*a
+	@param y FP8 instance
+	@param a FP4 multiplier
+ */
+extern void FP8_pmul(FP8 *x, FP8 *y, FP4 *a);
+
+/**	@brief Multiplication of an FP8 by an FP2
+ *
+	@param x FP8 instance, on exit = y*a
+	@param y FP8 instance
+	@param a FP2 multiplier
+ */
+extern void FP8_qmul(FP8 *x, FP8 *y, FP2 *a);
+
+/**	@brief Multiplication of an FP8 by an FP
+ *
+	@param x FP8 instance, on exit = y*a
+	@param y FP8 instance
+	@param a FP multiplier
+ */
+extern void FP8_tmul(FP8 *x, FP8 *y, FP *a);
+
+
+
+/**	@brief Multiplication of an FP8 by a small integer
+ *
+	@param x FP8 instance, on exit = y*i
+	@param y FP8 instance
+	@param i an integer
+ */
+extern void FP8_imul(FP8 *x, FP8 *y, int i);
+/**	@brief Squaring an FP8
+ *
+	@param x FP8 instance, on exit = y^2
+	@param y FP8 instance
+ */
+extern void FP8_sqr(FP8 *x, FP8 *y);
+/**	@brief Multiplication of two FP8s
+ *
+	@param x FP8 instance, on exit = y*z
+	@param y FP8 instance
+	@param z FP8 instance
+ */
+extern void FP8_mul(FP8 *x, FP8 *y, FP8 *z);
+/**	@brief Inverting an FP8
+ *
+	@param x FP8 instance, on exit = 1/y
+	@param y FP8 instance
+    @param h optional input hint
+ */
+extern void FP8_inv(FP8 *x, FP8 *y, FP *h);
+/**	@brief Formats and outputs an FP8 to the console
+ *
+	@param x FP8 instance to be printed
+ */
+extern void FP8_output(FP8 *x);
+/**	@brief Divide an FP8 by 2
+ *
+	@param x FP8 instance, on exit = y/2
+	@param y FP8 instance
+ */
+extern void FP8_div2(FP8 *x, FP8 *y);
+
+/**	@brief Formats and outputs an FP8 to the console in raw form (for debugging)
+ *
+	@param x FP8 instance to be printed
+ */
+extern void FP8_rawoutput(FP8 *x);
+/**	@brief multiplies an FP8 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP8 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP8_times_i(FP8 *x);
+/**	@brief multiplies an FP8 instance by irreducible polynomial (1+sqrt(-1))
+ *
+	@param x FP8 instance, on exit = (1+sqrt(-1)*x
+ */
+extern void FP8_times_i2(FP8 *x);
+
+/**	@brief Normalises the components of an FP8
+ *
+	@param x FP8 instance to be normalised
+ */
+extern void FP8_norm(FP8 *x);
+/**	@brief Reduces all components of possibly unreduced FP8 mod Modulus
+ *
+	@param x FP8 instance, on exit reduced mod Modulus
+ */
+extern void FP8_reduce(FP8 *x);
+/**	@brief Raises an FP8 to the power of a BIG
+ *
+	@param x FP8 instance, on exit = y^b
+	@param y FP8 instance
+	@param b BIG number
+ */
+extern void FP8_pow(FP8 *x, FP8 *y, B480_29::BIG b);
+/**	@brief Raises an FP8 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP8 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP8_frob(FP8 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP8 instance, on exit = w*x-conj(x)*y+z
+	@param w FP8 instance
+	@param x FP8 instance
+	@param y FP8 instance
+	@param z FP8 instance
+ */
+extern void FP8_xtr_A(FP8 *r, FP8 *w, FP8 *x, FP8 *y, FP8 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP8 instance, on exit = x^2-2*conj(x)
+	@param x FP8 instance
+ */
+extern void FP8_xtr_D(FP8 *r, FP8 *x);
+/**	@brief Calculates FP8 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP8 instance, on exit = trace(w^b)
+	@param x FP8 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP8_xtr_pow(FP8 *r, FP8 *x, B480_29::BIG b);
+/**	@brief Calculates FP8 trace of c^a.d^b, where c and d are derived from FP8 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP8 instance, on exit = trace(c^a.d^b)
+	@param c FP8 instance, trace of an FP12
+	@param d FP8 instance, trace of an FP12
+	@param e FP8 instance, trace of an FP12
+	@param f FP8 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP8_xtr_pow2(FP8 *r, FP8 *c, FP8 *d, FP8 *e, FP8 *f, B480_29::BIG a, B480_29::BIG b);
+
+/**	@brief Test FP8 for QR
+ *
+	Square root
+	@param r FP8 instance
+    @param h optional generated hint
+	@return 1 r is a QR, otherwise 0
+ */
+extern int  FP8_qr(FP8 *r, FP *h);
+
+
+/**	@brief Calculate square root of an FP8
+ *
+	Square root
+	@param r FP8 instance, on exit = sqrt(x)
+	@param x FP8 instance
+    @param h optional input hint
+ */
+extern void  FP8_sqrt(FP8 *r, FP8 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP8 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP8 instance, set to y if s!=0
+	@param y another FP8 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP8_cmove(FP8 *x, FP8 *y, int s);
+
+
+/**	@brief Divide FP8 number by QNR
+ *
+	Divide FP8 by the QNR
+	@param x FP8 instance
+ */
+extern void FP8_div_i(FP8 *x);
+
+/**	@brief Generate random FP8
+ *
+	@param x random FP8 number
+	@param rng random number generator
+ */
+extern void FP8_rand(FP8 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp8_BLS48286.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp8_BLS48286.h
new file mode 100644
index 0000000..afad02a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp8_BLS48286.h
@@ -0,0 +1,365 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP8_BLS48286_H
+#define FP8_BLS48286_H
+
+#include "fp4_BLS48286.h"
+#include "config_curve_BLS48286.h"
+
+using namespace core;
+
+namespace BLS48286 {
+
+/**
+	@brief FP8 Structure - towered over two FP4
+*/
+
+typedef struct
+{
+    FP4 a; /**< real part of FP8 */
+    FP4 b; /**< imaginary part of FP8 */
+} FP8;
+
+
+/* FP8 prototypes */
+/**	@brief Tests for FP8 equal to zero
+ *
+	@param x FP8 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP8_iszilch(FP8 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP8 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP8_islarger(FP8 *x);
+
+/**	@brief Serialize in FP8  
+ *
+    @param b buffer for output
+	@param x FP8 number to be serialized
+ */
+extern void FP8_toBytes(char *b,FP8 *x);
+/**	@brief Serialize out FP8  
+ *
+	@param x FP8 number to be serialized
+    @param b buffer for input
+ */
+extern void FP8_fromBytes(FP8 *x,char *b);
+
+
+/**	@brief Tests for FP8 equal to unity
+ *
+	@param x FP8 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP8_isunity(FP8 *x);
+/**	@brief Tests for equality of two FP8s
+ *
+	@param x FP8 instance to be compared
+	@param y FP8 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP8_equals(FP8 *x, FP8 *y);
+/**	@brief Tests for FP8 having only a real part and no imaginary part
+ *
+	@param x FP8 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP8_isreal(FP8 *x);
+/**	@brief Initialise FP8 from two FP4s
+ *
+	@param x FP8 instance to be initialised
+	@param a FP4 to form real part of FP8
+	@param b FP4 to form imaginary part of FP8
+ */
+extern void FP8_from_FP4s(FP8 *x, FP4 *a, FP4 *b);
+/**	@brief Initialise FP8 from single FP4
+ *
+	Imaginary part is set to zero
+	@param x FP8 instance to be initialised
+	@param a FP4 to form real part of FP8
+ */
+extern void FP8_from_FP4(FP8 *x, FP4 *a);
+
+/**	@brief Initialise FP8 from single FP4
+ *
+	real part is set to zero
+	@param x FP8 instance to be initialised
+	@param a FP4 to form imaginary part of FP8
+ */
+extern void FP8_from_FP4H(FP8 *x, FP4 *a);
+
+/**	@brief Initialise FP8 from single FP
+ *
+	@param x FP8 instance to be initialised
+	@param a FP to form real part of FP8
+ */
+extern void FP8_from_FP(FP8 *x, FP *a);
+
+/**	@brief Copy FP8 to another FP8
+ *
+	@param x FP8 instance, on exit = y
+	@param y FP8 instance to be copied
+ */
+extern void FP8_copy(FP8 *x, FP8 *y);
+
+/**	@brief Set FP8 to zero
+ *
+	@param x FP8 instance to be set to zero
+ */
+extern void FP8_zero(FP8 *x);
+/**	@brief Set FP8 to unity
+ *
+	@param x FP8 instance to be set to one
+ */
+extern void FP8_one(FP8 *x);
+
+/**	@brief Sign of FP8
+ *
+	@param x FP8 instance
+	@return "sign" of FP8
+ */
+extern int FP8_sign(FP8 *x);
+
+/**	@brief Negation of FP8
+ *
+	@param x FP8 instance, on exit = -y
+	@param y FP8 instance
+ */
+extern void FP8_neg(FP8 *x, FP8 *y);
+/**	@brief Conjugation of FP8
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP8 instance, on exit = conj(y)
+	@param y FP8 instance
+ */
+extern void FP8_conj(FP8 *x, FP8 *y);
+/**	@brief Negative conjugation of FP8
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP8 instance, on exit = -conj(y)
+	@param y FP8 instance
+ */
+extern void FP8_nconj(FP8 *x, FP8 *y);
+/**	@brief addition of two FP8s
+ *
+	@param x FP8 instance, on exit = y+z
+	@param y FP8 instance
+	@param z FP8 instance
+ */
+extern void FP8_add(FP8 *x, FP8 *y, FP8 *z);
+/**	@brief subtraction of two FP8s
+ *
+	@param x FP8 instance, on exit = y-z
+	@param y FP8 instance
+	@param z FP8 instance
+ */
+extern void FP8_sub(FP8 *x, FP8 *y, FP8 *z);
+/**	@brief Multiplication of an FP8 by an FP4
+ *
+	@param x FP8 instance, on exit = y*a
+	@param y FP8 instance
+	@param a FP4 multiplier
+ */
+extern void FP8_pmul(FP8 *x, FP8 *y, FP4 *a);
+
+/**	@brief Multiplication of an FP8 by an FP2
+ *
+	@param x FP8 instance, on exit = y*a
+	@param y FP8 instance
+	@param a FP2 multiplier
+ */
+extern void FP8_qmul(FP8 *x, FP8 *y, FP2 *a);
+
+/**	@brief Multiplication of an FP8 by an FP
+ *
+	@param x FP8 instance, on exit = y*a
+	@param y FP8 instance
+	@param a FP multiplier
+ */
+extern void FP8_tmul(FP8 *x, FP8 *y, FP *a);
+
+
+
+/**	@brief Multiplication of an FP8 by a small integer
+ *
+	@param x FP8 instance, on exit = y*i
+	@param y FP8 instance
+	@param i an integer
+ */
+extern void FP8_imul(FP8 *x, FP8 *y, int i);
+/**	@brief Squaring an FP8
+ *
+	@param x FP8 instance, on exit = y^2
+	@param y FP8 instance
+ */
+extern void FP8_sqr(FP8 *x, FP8 *y);
+/**	@brief Multiplication of two FP8s
+ *
+	@param x FP8 instance, on exit = y*z
+	@param y FP8 instance
+	@param z FP8 instance
+ */
+extern void FP8_mul(FP8 *x, FP8 *y, FP8 *z);
+/**	@brief Inverting an FP8
+ *
+	@param x FP8 instance, on exit = 1/y
+	@param y FP8 instance
+    @param h optional input hint
+ */
+extern void FP8_inv(FP8 *x, FP8 *y, FP *h);
+/**	@brief Formats and outputs an FP8 to the console
+ *
+	@param x FP8 instance to be printed
+ */
+extern void FP8_output(FP8 *x);
+/**	@brief Divide an FP8 by 2
+ *
+	@param x FP8 instance, on exit = y/2
+	@param y FP8 instance
+ */
+extern void FP8_div2(FP8 *x, FP8 *y);
+
+/**	@brief Formats and outputs an FP8 to the console in raw form (for debugging)
+ *
+	@param x FP8 instance to be printed
+ */
+extern void FP8_rawoutput(FP8 *x);
+/**	@brief multiplies an FP8 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP8 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP8_times_i(FP8 *x);
+/**	@brief multiplies an FP8 instance by irreducible polynomial (1+sqrt(-1))
+ *
+	@param x FP8 instance, on exit = (1+sqrt(-1)*x
+ */
+extern void FP8_times_i2(FP8 *x);
+
+/**	@brief Normalises the components of an FP8
+ *
+	@param x FP8 instance to be normalised
+ */
+extern void FP8_norm(FP8 *x);
+/**	@brief Reduces all components of possibly unreduced FP8 mod Modulus
+ *
+	@param x FP8 instance, on exit reduced mod Modulus
+ */
+extern void FP8_reduce(FP8 *x);
+/**	@brief Raises an FP8 to the power of a BIG
+ *
+	@param x FP8 instance, on exit = y^b
+	@param y FP8 instance
+	@param b BIG number
+ */
+extern void FP8_pow(FP8 *x, FP8 *y, B288_29::BIG b);
+/**	@brief Raises an FP8 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP8 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP8_frob(FP8 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP8 instance, on exit = w*x-conj(x)*y+z
+	@param w FP8 instance
+	@param x FP8 instance
+	@param y FP8 instance
+	@param z FP8 instance
+ */
+extern void FP8_xtr_A(FP8 *r, FP8 *w, FP8 *x, FP8 *y, FP8 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP8 instance, on exit = x^2-2*conj(x)
+	@param x FP8 instance
+ */
+extern void FP8_xtr_D(FP8 *r, FP8 *x);
+/**	@brief Calculates FP8 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP8 instance, on exit = trace(w^b)
+	@param x FP8 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP8_xtr_pow(FP8 *r, FP8 *x, B288_29::BIG b);
+/**	@brief Calculates FP8 trace of c^a.d^b, where c and d are derived from FP8 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP8 instance, on exit = trace(c^a.d^b)
+	@param c FP8 instance, trace of an FP12
+	@param d FP8 instance, trace of an FP12
+	@param e FP8 instance, trace of an FP12
+	@param f FP8 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP8_xtr_pow2(FP8 *r, FP8 *c, FP8 *d, FP8 *e, FP8 *f, B288_29::BIG a, B288_29::BIG b);
+
+/**	@brief Test FP8 for QR
+ *
+	Square root
+	@param r FP8 instance
+    @param h optional generated hint
+	@return 1 r is a QR, otherwise 0
+ */
+extern int  FP8_qr(FP8 *r, FP *h);
+
+
+/**	@brief Calculate square root of an FP8
+ *
+	Square root
+	@param r FP8 instance, on exit = sqrt(x)
+	@param x FP8 instance
+    @param h optional input hint
+ */
+extern void  FP8_sqrt(FP8 *r, FP8 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP8 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP8 instance, set to y if s!=0
+	@param y another FP8 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP8_cmove(FP8 *x, FP8 *y, int s);
+
+
+/**	@brief Divide FP8 number by QNR
+ *
+	Divide FP8 by the QNR
+	@param x FP8 instance
+ */
+extern void FP8_div_i(FP8 *x);
+
+/**	@brief Generate random FP8
+ *
+	@param x random FP8 number
+	@param rng random number generator
+ */
+extern void FP8_rand(FP8 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp8_BLS48556.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp8_BLS48556.h
new file mode 100644
index 0000000..3b8a0fd
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp8_BLS48556.h
@@ -0,0 +1,365 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP8_BLS48556_H
+#define FP8_BLS48556_H
+
+#include "fp4_BLS48556.h"
+#include "config_curve_BLS48556.h"
+
+using namespace core;
+
+namespace BLS48556 {
+
+/**
+	@brief FP8 Structure - towered over two FP4
+*/
+
+typedef struct
+{
+    FP4 a; /**< real part of FP8 */
+    FP4 b; /**< imaginary part of FP8 */
+} FP8;
+
+
+/* FP8 prototypes */
+/**	@brief Tests for FP8 equal to zero
+ *
+	@param x FP8 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP8_iszilch(FP8 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP8 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP8_islarger(FP8 *x);
+
+/**	@brief Serialize in FP8  
+ *
+    @param b buffer for output
+	@param x FP8 number to be serialized
+ */
+extern void FP8_toBytes(char *b,FP8 *x);
+/**	@brief Serialize out FP8  
+ *
+	@param x FP8 number to be serialized
+    @param b buffer for input
+ */
+extern void FP8_fromBytes(FP8 *x,char *b);
+
+
+/**	@brief Tests for FP8 equal to unity
+ *
+	@param x FP8 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP8_isunity(FP8 *x);
+/**	@brief Tests for equality of two FP8s
+ *
+	@param x FP8 instance to be compared
+	@param y FP8 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP8_equals(FP8 *x, FP8 *y);
+/**	@brief Tests for FP8 having only a real part and no imaginary part
+ *
+	@param x FP8 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP8_isreal(FP8 *x);
+/**	@brief Initialise FP8 from two FP4s
+ *
+	@param x FP8 instance to be initialised
+	@param a FP4 to form real part of FP8
+	@param b FP4 to form imaginary part of FP8
+ */
+extern void FP8_from_FP4s(FP8 *x, FP4 *a, FP4 *b);
+/**	@brief Initialise FP8 from single FP4
+ *
+	Imaginary part is set to zero
+	@param x FP8 instance to be initialised
+	@param a FP4 to form real part of FP8
+ */
+extern void FP8_from_FP4(FP8 *x, FP4 *a);
+
+/**	@brief Initialise FP8 from single FP4
+ *
+	real part is set to zero
+	@param x FP8 instance to be initialised
+	@param a FP4 to form imaginary part of FP8
+ */
+extern void FP8_from_FP4H(FP8 *x, FP4 *a);
+
+/**	@brief Initialise FP8 from single FP
+ *
+	@param x FP8 instance to be initialised
+	@param a FP to form real part of FP8
+ */
+extern void FP8_from_FP(FP8 *x, FP *a);
+
+/**	@brief Copy FP8 to another FP8
+ *
+	@param x FP8 instance, on exit = y
+	@param y FP8 instance to be copied
+ */
+extern void FP8_copy(FP8 *x, FP8 *y);
+
+/**	@brief Set FP8 to zero
+ *
+	@param x FP8 instance to be set to zero
+ */
+extern void FP8_zero(FP8 *x);
+/**	@brief Set FP8 to unity
+ *
+	@param x FP8 instance to be set to one
+ */
+extern void FP8_one(FP8 *x);
+
+/**	@brief Sign of FP8
+ *
+	@param x FP8 instance
+	@return "sign" of FP8
+ */
+extern int FP8_sign(FP8 *x);
+
+/**	@brief Negation of FP8
+ *
+	@param x FP8 instance, on exit = -y
+	@param y FP8 instance
+ */
+extern void FP8_neg(FP8 *x, FP8 *y);
+/**	@brief Conjugation of FP8
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP8 instance, on exit = conj(y)
+	@param y FP8 instance
+ */
+extern void FP8_conj(FP8 *x, FP8 *y);
+/**	@brief Negative conjugation of FP8
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP8 instance, on exit = -conj(y)
+	@param y FP8 instance
+ */
+extern void FP8_nconj(FP8 *x, FP8 *y);
+/**	@brief addition of two FP8s
+ *
+	@param x FP8 instance, on exit = y+z
+	@param y FP8 instance
+	@param z FP8 instance
+ */
+extern void FP8_add(FP8 *x, FP8 *y, FP8 *z);
+/**	@brief subtraction of two FP8s
+ *
+	@param x FP8 instance, on exit = y-z
+	@param y FP8 instance
+	@param z FP8 instance
+ */
+extern void FP8_sub(FP8 *x, FP8 *y, FP8 *z);
+/**	@brief Multiplication of an FP8 by an FP4
+ *
+	@param x FP8 instance, on exit = y*a
+	@param y FP8 instance
+	@param a FP4 multiplier
+ */
+extern void FP8_pmul(FP8 *x, FP8 *y, FP4 *a);
+
+/**	@brief Multiplication of an FP8 by an FP2
+ *
+	@param x FP8 instance, on exit = y*a
+	@param y FP8 instance
+	@param a FP2 multiplier
+ */
+extern void FP8_qmul(FP8 *x, FP8 *y, FP2 *a);
+
+/**	@brief Multiplication of an FP8 by an FP
+ *
+	@param x FP8 instance, on exit = y*a
+	@param y FP8 instance
+	@param a FP multiplier
+ */
+extern void FP8_tmul(FP8 *x, FP8 *y, FP *a);
+
+
+
+/**	@brief Multiplication of an FP8 by a small integer
+ *
+	@param x FP8 instance, on exit = y*i
+	@param y FP8 instance
+	@param i an integer
+ */
+extern void FP8_imul(FP8 *x, FP8 *y, int i);
+/**	@brief Squaring an FP8
+ *
+	@param x FP8 instance, on exit = y^2
+	@param y FP8 instance
+ */
+extern void FP8_sqr(FP8 *x, FP8 *y);
+/**	@brief Multiplication of two FP8s
+ *
+	@param x FP8 instance, on exit = y*z
+	@param y FP8 instance
+	@param z FP8 instance
+ */
+extern void FP8_mul(FP8 *x, FP8 *y, FP8 *z);
+/**	@brief Inverting an FP8
+ *
+	@param x FP8 instance, on exit = 1/y
+	@param y FP8 instance
+    @param h optional input hint
+ */
+extern void FP8_inv(FP8 *x, FP8 *y, FP *h);
+/**	@brief Formats and outputs an FP8 to the console
+ *
+	@param x FP8 instance to be printed
+ */
+extern void FP8_output(FP8 *x);
+/**	@brief Divide an FP8 by 2
+ *
+	@param x FP8 instance, on exit = y/2
+	@param y FP8 instance
+ */
+extern void FP8_div2(FP8 *x, FP8 *y);
+
+/**	@brief Formats and outputs an FP8 to the console in raw form (for debugging)
+ *
+	@param x FP8 instance to be printed
+ */
+extern void FP8_rawoutput(FP8 *x);
+/**	@brief multiplies an FP8 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP8 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP8_times_i(FP8 *x);
+/**	@brief multiplies an FP8 instance by irreducible polynomial (1+sqrt(-1))
+ *
+	@param x FP8 instance, on exit = (1+sqrt(-1)*x
+ */
+extern void FP8_times_i2(FP8 *x);
+
+/**	@brief Normalises the components of an FP8
+ *
+	@param x FP8 instance to be normalised
+ */
+extern void FP8_norm(FP8 *x);
+/**	@brief Reduces all components of possibly unreduced FP8 mod Modulus
+ *
+	@param x FP8 instance, on exit reduced mod Modulus
+ */
+extern void FP8_reduce(FP8 *x);
+/**	@brief Raises an FP8 to the power of a BIG
+ *
+	@param x FP8 instance, on exit = y^b
+	@param y FP8 instance
+	@param b BIG number
+ */
+extern void FP8_pow(FP8 *x, FP8 *y, B560_29::BIG b);
+/**	@brief Raises an FP8 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP8 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP8_frob(FP8 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP8 instance, on exit = w*x-conj(x)*y+z
+	@param w FP8 instance
+	@param x FP8 instance
+	@param y FP8 instance
+	@param z FP8 instance
+ */
+extern void FP8_xtr_A(FP8 *r, FP8 *w, FP8 *x, FP8 *y, FP8 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP8 instance, on exit = x^2-2*conj(x)
+	@param x FP8 instance
+ */
+extern void FP8_xtr_D(FP8 *r, FP8 *x);
+/**	@brief Calculates FP8 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP8 instance, on exit = trace(w^b)
+	@param x FP8 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP8_xtr_pow(FP8 *r, FP8 *x, B560_29::BIG b);
+/**	@brief Calculates FP8 trace of c^a.d^b, where c and d are derived from FP8 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP8 instance, on exit = trace(c^a.d^b)
+	@param c FP8 instance, trace of an FP12
+	@param d FP8 instance, trace of an FP12
+	@param e FP8 instance, trace of an FP12
+	@param f FP8 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP8_xtr_pow2(FP8 *r, FP8 *c, FP8 *d, FP8 *e, FP8 *f, B560_29::BIG a, B560_29::BIG b);
+
+/**	@brief Test FP8 for QR
+ *
+	Square root
+	@param r FP8 instance
+    @param h optional generated hint
+	@return 1 r is a QR, otherwise 0
+ */
+extern int  FP8_qr(FP8 *r, FP *h);
+
+
+/**	@brief Calculate square root of an FP8
+ *
+	Square root
+	@param r FP8 instance, on exit = sqrt(x)
+	@param x FP8 instance
+    @param h optional input hint
+ */
+extern void  FP8_sqrt(FP8 *r, FP8 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP8 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP8 instance, set to y if s!=0
+	@param y another FP8 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP8_cmove(FP8 *x, FP8 *y, int s);
+
+
+/**	@brief Divide FP8 number by QNR
+ *
+	Divide FP8 by the QNR
+	@param x FP8 instance
+ */
+extern void FP8_div_i(FP8 *x);
+
+/**	@brief Generate random FP8
+ *
+	@param x random FP8 number
+	@param rng random number generator
+ */
+extern void FP8_rand(FP8 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp8_BLS48581.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp8_BLS48581.h
new file mode 100644
index 0000000..b668f65
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp8_BLS48581.h
@@ -0,0 +1,365 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP8_BLS48581_H
+#define FP8_BLS48581_H
+
+#include "fp4_BLS48581.h"
+#include "config_curve_BLS48581.h"
+
+using namespace core;
+
+namespace BLS48581 {
+
+/**
+	@brief FP8 Structure - towered over two FP4
+*/
+
+typedef struct
+{
+    FP4 a; /**< real part of FP8 */
+    FP4 b; /**< imaginary part of FP8 */
+} FP8;
+
+
+/* FP8 prototypes */
+/**	@brief Tests for FP8 equal to zero
+ *
+	@param x FP8 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP8_iszilch(FP8 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP8 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP8_islarger(FP8 *x);
+
+/**	@brief Serialize in FP8  
+ *
+    @param b buffer for output
+	@param x FP8 number to be serialized
+ */
+extern void FP8_toBytes(char *b,FP8 *x);
+/**	@brief Serialize out FP8  
+ *
+	@param x FP8 number to be serialized
+    @param b buffer for input
+ */
+extern void FP8_fromBytes(FP8 *x,char *b);
+
+
+/**	@brief Tests for FP8 equal to unity
+ *
+	@param x FP8 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP8_isunity(FP8 *x);
+/**	@brief Tests for equality of two FP8s
+ *
+	@param x FP8 instance to be compared
+	@param y FP8 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP8_equals(FP8 *x, FP8 *y);
+/**	@brief Tests for FP8 having only a real part and no imaginary part
+ *
+	@param x FP8 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP8_isreal(FP8 *x);
+/**	@brief Initialise FP8 from two FP4s
+ *
+	@param x FP8 instance to be initialised
+	@param a FP4 to form real part of FP8
+	@param b FP4 to form imaginary part of FP8
+ */
+extern void FP8_from_FP4s(FP8 *x, FP4 *a, FP4 *b);
+/**	@brief Initialise FP8 from single FP4
+ *
+	Imaginary part is set to zero
+	@param x FP8 instance to be initialised
+	@param a FP4 to form real part of FP8
+ */
+extern void FP8_from_FP4(FP8 *x, FP4 *a);
+
+/**	@brief Initialise FP8 from single FP4
+ *
+	real part is set to zero
+	@param x FP8 instance to be initialised
+	@param a FP4 to form imaginary part of FP8
+ */
+extern void FP8_from_FP4H(FP8 *x, FP4 *a);
+
+/**	@brief Initialise FP8 from single FP
+ *
+	@param x FP8 instance to be initialised
+	@param a FP to form real part of FP8
+ */
+extern void FP8_from_FP(FP8 *x, FP *a);
+
+/**	@brief Copy FP8 to another FP8
+ *
+	@param x FP8 instance, on exit = y
+	@param y FP8 instance to be copied
+ */
+extern void FP8_copy(FP8 *x, FP8 *y);
+
+/**	@brief Set FP8 to zero
+ *
+	@param x FP8 instance to be set to zero
+ */
+extern void FP8_zero(FP8 *x);
+/**	@brief Set FP8 to unity
+ *
+	@param x FP8 instance to be set to one
+ */
+extern void FP8_one(FP8 *x);
+
+/**	@brief Sign of FP8
+ *
+	@param x FP8 instance
+	@return "sign" of FP8
+ */
+extern int FP8_sign(FP8 *x);
+
+/**	@brief Negation of FP8
+ *
+	@param x FP8 instance, on exit = -y
+	@param y FP8 instance
+ */
+extern void FP8_neg(FP8 *x, FP8 *y);
+/**	@brief Conjugation of FP8
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP8 instance, on exit = conj(y)
+	@param y FP8 instance
+ */
+extern void FP8_conj(FP8 *x, FP8 *y);
+/**	@brief Negative conjugation of FP8
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP8 instance, on exit = -conj(y)
+	@param y FP8 instance
+ */
+extern void FP8_nconj(FP8 *x, FP8 *y);
+/**	@brief addition of two FP8s
+ *
+	@param x FP8 instance, on exit = y+z
+	@param y FP8 instance
+	@param z FP8 instance
+ */
+extern void FP8_add(FP8 *x, FP8 *y, FP8 *z);
+/**	@brief subtraction of two FP8s
+ *
+	@param x FP8 instance, on exit = y-z
+	@param y FP8 instance
+	@param z FP8 instance
+ */
+extern void FP8_sub(FP8 *x, FP8 *y, FP8 *z);
+/**	@brief Multiplication of an FP8 by an FP4
+ *
+	@param x FP8 instance, on exit = y*a
+	@param y FP8 instance
+	@param a FP4 multiplier
+ */
+extern void FP8_pmul(FP8 *x, FP8 *y, FP4 *a);
+
+/**	@brief Multiplication of an FP8 by an FP2
+ *
+	@param x FP8 instance, on exit = y*a
+	@param y FP8 instance
+	@param a FP2 multiplier
+ */
+extern void FP8_qmul(FP8 *x, FP8 *y, FP2 *a);
+
+/**	@brief Multiplication of an FP8 by an FP
+ *
+	@param x FP8 instance, on exit = y*a
+	@param y FP8 instance
+	@param a FP multiplier
+ */
+extern void FP8_tmul(FP8 *x, FP8 *y, FP *a);
+
+
+
+/**	@brief Multiplication of an FP8 by a small integer
+ *
+	@param x FP8 instance, on exit = y*i
+	@param y FP8 instance
+	@param i an integer
+ */
+extern void FP8_imul(FP8 *x, FP8 *y, int i);
+/**	@brief Squaring an FP8
+ *
+	@param x FP8 instance, on exit = y^2
+	@param y FP8 instance
+ */
+extern void FP8_sqr(FP8 *x, FP8 *y);
+/**	@brief Multiplication of two FP8s
+ *
+	@param x FP8 instance, on exit = y*z
+	@param y FP8 instance
+	@param z FP8 instance
+ */
+extern void FP8_mul(FP8 *x, FP8 *y, FP8 *z);
+/**	@brief Inverting an FP8
+ *
+	@param x FP8 instance, on exit = 1/y
+	@param y FP8 instance
+    @param h optional input hint
+ */
+extern void FP8_inv(FP8 *x, FP8 *y, FP *h);
+/**	@brief Formats and outputs an FP8 to the console
+ *
+	@param x FP8 instance to be printed
+ */
+extern void FP8_output(FP8 *x);
+/**	@brief Divide an FP8 by 2
+ *
+	@param x FP8 instance, on exit = y/2
+	@param y FP8 instance
+ */
+extern void FP8_div2(FP8 *x, FP8 *y);
+
+/**	@brief Formats and outputs an FP8 to the console in raw form (for debugging)
+ *
+	@param x FP8 instance to be printed
+ */
+extern void FP8_rawoutput(FP8 *x);
+/**	@brief multiplies an FP8 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP8 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP8_times_i(FP8 *x);
+/**	@brief multiplies an FP8 instance by irreducible polynomial (1+sqrt(-1))
+ *
+	@param x FP8 instance, on exit = (1+sqrt(-1)*x
+ */
+extern void FP8_times_i2(FP8 *x);
+
+/**	@brief Normalises the components of an FP8
+ *
+	@param x FP8 instance to be normalised
+ */
+extern void FP8_norm(FP8 *x);
+/**	@brief Reduces all components of possibly unreduced FP8 mod Modulus
+ *
+	@param x FP8 instance, on exit reduced mod Modulus
+ */
+extern void FP8_reduce(FP8 *x);
+/**	@brief Raises an FP8 to the power of a BIG
+ *
+	@param x FP8 instance, on exit = y^b
+	@param y FP8 instance
+	@param b BIG number
+ */
+extern void FP8_pow(FP8 *x, FP8 *y, B584_29::BIG b);
+/**	@brief Raises an FP8 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP8 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP8_frob(FP8 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP8 instance, on exit = w*x-conj(x)*y+z
+	@param w FP8 instance
+	@param x FP8 instance
+	@param y FP8 instance
+	@param z FP8 instance
+ */
+extern void FP8_xtr_A(FP8 *r, FP8 *w, FP8 *x, FP8 *y, FP8 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP8 instance, on exit = x^2-2*conj(x)
+	@param x FP8 instance
+ */
+extern void FP8_xtr_D(FP8 *r, FP8 *x);
+/**	@brief Calculates FP8 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP8 instance, on exit = trace(w^b)
+	@param x FP8 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP8_xtr_pow(FP8 *r, FP8 *x, B584_29::BIG b);
+/**	@brief Calculates FP8 trace of c^a.d^b, where c and d are derived from FP8 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP8 instance, on exit = trace(c^a.d^b)
+	@param c FP8 instance, trace of an FP12
+	@param d FP8 instance, trace of an FP12
+	@param e FP8 instance, trace of an FP12
+	@param f FP8 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP8_xtr_pow2(FP8 *r, FP8 *c, FP8 *d, FP8 *e, FP8 *f, B584_29::BIG a, B584_29::BIG b);
+
+/**	@brief Test FP8 for QR
+ *
+	Square root
+	@param r FP8 instance
+    @param h optional generated hint
+	@return 1 r is a QR, otherwise 0
+ */
+extern int  FP8_qr(FP8 *r, FP *h);
+
+
+/**	@brief Calculate square root of an FP8
+ *
+	Square root
+	@param r FP8 instance, on exit = sqrt(x)
+	@param x FP8 instance
+    @param h optional input hint
+ */
+extern void  FP8_sqrt(FP8 *r, FP8 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP8 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP8 instance, set to y if s!=0
+	@param y another FP8 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP8_cmove(FP8 *x, FP8 *y, int s);
+
+
+/**	@brief Divide FP8 number by QNR
+ *
+	Divide FP8 by the QNR
+	@param x FP8 instance
+ */
+extern void FP8_div_i(FP8 *x);
+
+/**	@brief Generate random FP8
+ *
+	@param x random FP8 number
+	@param rng random number generator
+ */
+extern void FP8_rand(FP8 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_ANSSI.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_ANSSI.h
new file mode 100644
index 0000000..24d0f3c
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_ANSSI.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_ANSSI_H
+#define FP_ANSSI_H
+
+#include "big_B256_28.h"
+#include "config_field_ANSSI.h"
+
+using namespace core;
+
+#define MODBITS_ANSSI MBITS_ANSSI
+#define TBITS_ANSSI (MBITS_ANSSI%BASEBITS_B256_28)              /**< Number of active bits in top word */
+#define TMASK_ANSSI (((chunk)1<<TBITS_ANSSI)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_ANSSI (((sign32)1<<MAXXES_ANSSI)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_ANSSI (-((chunk)(1)<<TBITS_ANSSI))            /**<  for masking out overflow bits */
+
+namespace ANSSI {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B256_28::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B256_28::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B256_28::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B256_28::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B256_28::BIG SQRTm3;      /**< Square root of -3 */
+extern const B256_28::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B256_28::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B256_28::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B256_28::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B256_28::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B256_28::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B256_28::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B256_28::BIG r, B256_28::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B256_28::BIG, B256_28::BIG, B256_28::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B256_28::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_BLS12381.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_BLS12381.h
new file mode 100644
index 0000000..165f8e7
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_BLS12381.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_BLS12381_H
+#define FP_BLS12381_H
+
+#include "big_B384_29.h"
+#include "config_field_BLS12381.h"
+
+using namespace core;
+
+#define MODBITS_BLS12381 MBITS_BLS12381
+#define TBITS_BLS12381 (MBITS_BLS12381%BASEBITS_B384_29)              /**< Number of active bits in top word */
+#define TMASK_BLS12381 (((chunk)1<<TBITS_BLS12381)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_BLS12381 (((sign32)1<<MAXXES_BLS12381)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_BLS12381 (-((chunk)(1)<<TBITS_BLS12381))            /**<  for masking out overflow bits */
+
+namespace BLS12381 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B384_29::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B384_29::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B384_29::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B384_29::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B384_29::BIG SQRTm3;      /**< Square root of -3 */
+extern const B384_29::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B384_29::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B384_29::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B384_29::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B384_29::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B384_29::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B384_29::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B384_29::BIG r, B384_29::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B384_29::BIG, B384_29::BIG, B384_29::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B384_29::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_BLS12383.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_BLS12383.h
new file mode 100644
index 0000000..9e33d00
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_BLS12383.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_BLS12383_H
+#define FP_BLS12383_H
+
+#include "big_B384_29.h"
+#include "config_field_BLS12383.h"
+
+using namespace core;
+
+#define MODBITS_BLS12383 MBITS_BLS12383
+#define TBITS_BLS12383 (MBITS_BLS12383%BASEBITS_B384_29)              /**< Number of active bits in top word */
+#define TMASK_BLS12383 (((chunk)1<<TBITS_BLS12383)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_BLS12383 (((sign32)1<<MAXXES_BLS12383)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_BLS12383 (-((chunk)(1)<<TBITS_BLS12383))            /**<  for masking out overflow bits */
+
+namespace BLS12383 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B384_29::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B384_29::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B384_29::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B384_29::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B384_29::BIG SQRTm3;      /**< Square root of -3 */
+extern const B384_29::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B384_29::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B384_29::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B384_29::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B384_29::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B384_29::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B384_29::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B384_29::BIG r, B384_29::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B384_29::BIG, B384_29::BIG, B384_29::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B384_29::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_BLS12443.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_BLS12443.h
new file mode 100644
index 0000000..8eada7b
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_BLS12443.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_BLS12443_H
+#define FP_BLS12443_H
+
+#include "big_B448_29.h"
+#include "config_field_BLS12443.h"
+
+using namespace core;
+
+#define MODBITS_BLS12443 MBITS_BLS12443
+#define TBITS_BLS12443 (MBITS_BLS12443%BASEBITS_B448_29)              /**< Number of active bits in top word */
+#define TMASK_BLS12443 (((chunk)1<<TBITS_BLS12443)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_BLS12443 (((sign32)1<<MAXXES_BLS12443)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_BLS12443 (-((chunk)(1)<<TBITS_BLS12443))            /**<  for masking out overflow bits */
+
+namespace BLS12443 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B448_29::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B448_29::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B448_29::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B448_29::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B448_29::BIG SQRTm3;      /**< Square root of -3 */
+extern const B448_29::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B448_29::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B448_29::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B448_29::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B448_29::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B448_29::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B448_29::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B448_29::BIG r, B448_29::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B448_29::BIG, B448_29::BIG, B448_29::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B448_29::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_BLS12461.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_BLS12461.h
new file mode 100644
index 0000000..65c82d5
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_BLS12461.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_BLS12461_H
+#define FP_BLS12461_H
+
+#include "big_B464_28.h"
+#include "config_field_BLS12461.h"
+
+using namespace core;
+
+#define MODBITS_BLS12461 MBITS_BLS12461
+#define TBITS_BLS12461 (MBITS_BLS12461%BASEBITS_B464_28)              /**< Number of active bits in top word */
+#define TMASK_BLS12461 (((chunk)1<<TBITS_BLS12461)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_BLS12461 (((sign32)1<<MAXXES_BLS12461)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_BLS12461 (-((chunk)(1)<<TBITS_BLS12461))            /**<  for masking out overflow bits */
+
+namespace BLS12461 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B464_28::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B464_28::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B464_28::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B464_28::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B464_28::BIG SQRTm3;      /**< Square root of -3 */
+extern const B464_28::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B464_28::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B464_28::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B464_28::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B464_28::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B464_28::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B464_28::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B464_28::BIG r, B464_28::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B464_28::BIG, B464_28::BIG, B464_28::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B464_28::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_BLS24479.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_BLS24479.h
new file mode 100644
index 0000000..ed3ffac
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_BLS24479.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_BLS24479_H
+#define FP_BLS24479_H
+
+#include "big_B480_29.h"
+#include "config_field_BLS24479.h"
+
+using namespace core;
+
+#define MODBITS_BLS24479 MBITS_BLS24479
+#define TBITS_BLS24479 (MBITS_BLS24479%BASEBITS_B480_29)              /**< Number of active bits in top word */
+#define TMASK_BLS24479 (((chunk)1<<TBITS_BLS24479)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_BLS24479 (((sign32)1<<MAXXES_BLS24479)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_BLS24479 (-((chunk)(1)<<TBITS_BLS24479))            /**<  for masking out overflow bits */
+
+namespace BLS24479 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B480_29::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B480_29::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B480_29::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B480_29::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B480_29::BIG SQRTm3;      /**< Square root of -3 */
+extern const B480_29::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B480_29::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B480_29::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B480_29::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B480_29::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B480_29::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B480_29::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B480_29::BIG r, B480_29::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B480_29::BIG, B480_29::BIG, B480_29::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B480_29::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_BLS48286.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_BLS48286.h
new file mode 100644
index 0000000..ec6b481
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_BLS48286.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_BLS48286_H
+#define FP_BLS48286_H
+
+#include "big_B288_29.h"
+#include "config_field_BLS48286.h"
+
+using namespace core;
+
+#define MODBITS_BLS48286 MBITS_BLS48286
+#define TBITS_BLS48286 (MBITS_BLS48286%BASEBITS_B288_29)              /**< Number of active bits in top word */
+#define TMASK_BLS48286 (((chunk)1<<TBITS_BLS48286)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_BLS48286 (((sign32)1<<MAXXES_BLS48286)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_BLS48286 (-((chunk)(1)<<TBITS_BLS48286))            /**<  for masking out overflow bits */
+
+namespace BLS48286 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B288_29::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B288_29::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B288_29::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B288_29::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B288_29::BIG SQRTm3;      /**< Square root of -3 */
+extern const B288_29::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B288_29::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B288_29::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B288_29::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B288_29::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B288_29::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B288_29::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B288_29::BIG r, B288_29::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B288_29::BIG, B288_29::BIG, B288_29::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B288_29::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_BLS48556.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_BLS48556.h
new file mode 100644
index 0000000..ef6f014
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_BLS48556.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_BLS48556_H
+#define FP_BLS48556_H
+
+#include "big_B560_29.h"
+#include "config_field_BLS48556.h"
+
+using namespace core;
+
+#define MODBITS_BLS48556 MBITS_BLS48556
+#define TBITS_BLS48556 (MBITS_BLS48556%BASEBITS_B560_29)              /**< Number of active bits in top word */
+#define TMASK_BLS48556 (((chunk)1<<TBITS_BLS48556)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_BLS48556 (((sign32)1<<MAXXES_BLS48556)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_BLS48556 (-((chunk)(1)<<TBITS_BLS48556))            /**<  for masking out overflow bits */
+
+namespace BLS48556 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B560_29::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B560_29::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B560_29::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B560_29::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B560_29::BIG SQRTm3;      /**< Square root of -3 */
+extern const B560_29::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B560_29::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B560_29::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B560_29::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B560_29::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B560_29::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B560_29::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B560_29::BIG r, B560_29::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B560_29::BIG, B560_29::BIG, B560_29::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B560_29::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_BLS48581.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_BLS48581.h
new file mode 100644
index 0000000..7f077a9
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_BLS48581.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_BLS48581_H
+#define FP_BLS48581_H
+
+#include "big_B584_29.h"
+#include "config_field_BLS48581.h"
+
+using namespace core;
+
+#define MODBITS_BLS48581 MBITS_BLS48581
+#define TBITS_BLS48581 (MBITS_BLS48581%BASEBITS_B584_29)              /**< Number of active bits in top word */
+#define TMASK_BLS48581 (((chunk)1<<TBITS_BLS48581)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_BLS48581 (((sign32)1<<MAXXES_BLS48581)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_BLS48581 (-((chunk)(1)<<TBITS_BLS48581))            /**<  for masking out overflow bits */
+
+namespace BLS48581 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B584_29::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B584_29::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B584_29::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B584_29::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B584_29::BIG SQRTm3;      /**< Square root of -3 */
+extern const B584_29::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B584_29::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B584_29::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B584_29::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B584_29::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B584_29::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B584_29::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B584_29::BIG r, B584_29::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B584_29::BIG, B584_29::BIG, B584_29::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B584_29::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_BN158.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_BN158.h
new file mode 100644
index 0000000..32701b8
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_BN158.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_BN158_H
+#define FP_BN158_H
+
+#include "big_B160_28.h"
+#include "config_field_BN158.h"
+
+using namespace core;
+
+#define MODBITS_BN158 MBITS_BN158
+#define TBITS_BN158 (MBITS_BN158%BASEBITS_B160_28)              /**< Number of active bits in top word */
+#define TMASK_BN158 (((chunk)1<<TBITS_BN158)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_BN158 (((sign32)1<<MAXXES_BN158)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_BN158 (-((chunk)(1)<<TBITS_BN158))            /**<  for masking out overflow bits */
+
+namespace BN158 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B160_28::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B160_28::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B160_28::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B160_28::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B160_28::BIG SQRTm3;      /**< Square root of -3 */
+extern const B160_28::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B160_28::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B160_28::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B160_28::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B160_28::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B160_28::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B160_28::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B160_28::BIG r, B160_28::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B160_28::BIG, B160_28::BIG, B160_28::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B160_28::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_BN254.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_BN254.h
new file mode 100644
index 0000000..ede7fe6
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_BN254.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_BN254_H
+#define FP_BN254_H
+
+#include "big_B256_28.h"
+#include "config_field_BN254.h"
+
+using namespace core;
+
+#define MODBITS_BN254 MBITS_BN254
+#define TBITS_BN254 (MBITS_BN254%BASEBITS_B256_28)              /**< Number of active bits in top word */
+#define TMASK_BN254 (((chunk)1<<TBITS_BN254)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_BN254 (((sign32)1<<MAXXES_BN254)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_BN254 (-((chunk)(1)<<TBITS_BN254))            /**<  for masking out overflow bits */
+
+namespace BN254 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B256_28::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B256_28::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B256_28::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B256_28::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B256_28::BIG SQRTm3;      /**< Square root of -3 */
+extern const B256_28::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B256_28::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B256_28::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B256_28::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B256_28::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B256_28::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B256_28::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B256_28::BIG r, B256_28::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B256_28::BIG, B256_28::BIG, B256_28::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B256_28::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_BN254CX.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_BN254CX.h
new file mode 100644
index 0000000..d6c79bc
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_BN254CX.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_BN254CX_H
+#define FP_BN254CX_H
+
+#include "big_B256_28.h"
+#include "config_field_BN254CX.h"
+
+using namespace core;
+
+#define MODBITS_BN254CX MBITS_BN254CX
+#define TBITS_BN254CX (MBITS_BN254CX%BASEBITS_B256_28)              /**< Number of active bits in top word */
+#define TMASK_BN254CX (((chunk)1<<TBITS_BN254CX)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_BN254CX (((sign32)1<<MAXXES_BN254CX)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_BN254CX (-((chunk)(1)<<TBITS_BN254CX))            /**<  for masking out overflow bits */
+
+namespace BN254CX {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B256_28::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B256_28::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B256_28::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B256_28::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B256_28::BIG SQRTm3;      /**< Square root of -3 */
+extern const B256_28::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B256_28::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B256_28::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B256_28::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B256_28::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B256_28::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B256_28::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B256_28::BIG r, B256_28::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B256_28::BIG, B256_28::BIG, B256_28::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B256_28::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_BN462.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_BN462.h
new file mode 100644
index 0000000..5b86675
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_BN462.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_BN462_H
+#define FP_BN462_H
+
+#include "big_B464_28.h"
+#include "config_field_BN462.h"
+
+using namespace core;
+
+#define MODBITS_BN462 MBITS_BN462
+#define TBITS_BN462 (MBITS_BN462%BASEBITS_B464_28)              /**< Number of active bits in top word */
+#define TMASK_BN462 (((chunk)1<<TBITS_BN462)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_BN462 (((sign32)1<<MAXXES_BN462)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_BN462 (-((chunk)(1)<<TBITS_BN462))            /**<  for masking out overflow bits */
+
+namespace BN462 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B464_28::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B464_28::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B464_28::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B464_28::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B464_28::BIG SQRTm3;      /**< Square root of -3 */
+extern const B464_28::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B464_28::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B464_28::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B464_28::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B464_28::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B464_28::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B464_28::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B464_28::BIG r, B464_28::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B464_28::BIG, B464_28::BIG, B464_28::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B464_28::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_BRAINPOOL.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_BRAINPOOL.h
new file mode 100644
index 0000000..c5e2895
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_BRAINPOOL.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_BRAINPOOL_H
+#define FP_BRAINPOOL_H
+
+#include "big_B256_28.h"
+#include "config_field_BRAINPOOL.h"
+
+using namespace core;
+
+#define MODBITS_BRAINPOOL MBITS_BRAINPOOL
+#define TBITS_BRAINPOOL (MBITS_BRAINPOOL%BASEBITS_B256_28)              /**< Number of active bits in top word */
+#define TMASK_BRAINPOOL (((chunk)1<<TBITS_BRAINPOOL)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_BRAINPOOL (((sign32)1<<MAXXES_BRAINPOOL)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_BRAINPOOL (-((chunk)(1)<<TBITS_BRAINPOOL))            /**<  for masking out overflow bits */
+
+namespace BRAINPOOL {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B256_28::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B256_28::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B256_28::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B256_28::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B256_28::BIG SQRTm3;      /**< Square root of -3 */
+extern const B256_28::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B256_28::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B256_28::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B256_28::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B256_28::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B256_28::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B256_28::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B256_28::BIG r, B256_28::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B256_28::BIG, B256_28::BIG, B256_28::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B256_28::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_C1174.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_C1174.h
new file mode 100644
index 0000000..c22c681
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_C1174.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_C1174_H
+#define FP_C1174_H
+
+#include "big_B256_29.h"
+#include "config_field_C1174.h"
+
+using namespace core;
+
+#define MODBITS_C1174 MBITS_C1174
+#define TBITS_C1174 (MBITS_C1174%BASEBITS_B256_29)              /**< Number of active bits in top word */
+#define TMASK_C1174 (((chunk)1<<TBITS_C1174)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_C1174 (((sign32)1<<MAXXES_C1174)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_C1174 (-((chunk)(1)<<TBITS_C1174))            /**<  for masking out overflow bits */
+
+namespace C1174 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B256_29::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B256_29::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B256_29::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B256_29::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B256_29::BIG SQRTm3;      /**< Square root of -3 */
+extern const B256_29::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B256_29::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B256_29::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B256_29::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B256_29::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B256_29::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B256_29::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B256_29::BIG r, B256_29::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B256_29::BIG, B256_29::BIG, B256_29::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B256_29::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_C1665.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_C1665.h
new file mode 100644
index 0000000..0e2a647
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_C1665.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_C1665_H
+#define FP_C1665_H
+
+#include "big_B168_29.h"
+#include "config_field_C1665.h"
+
+using namespace core;
+
+#define MODBITS_C1665 MBITS_C1665
+#define TBITS_C1665 (MBITS_C1665%BASEBITS_B168_29)              /**< Number of active bits in top word */
+#define TMASK_C1665 (((chunk)1<<TBITS_C1665)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_C1665 (((sign32)1<<MAXXES_C1665)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_C1665 (-((chunk)(1)<<TBITS_C1665))            /**<  for masking out overflow bits */
+
+namespace C1665 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B168_29::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B168_29::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B168_29::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B168_29::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B168_29::BIG SQRTm3;      /**< Square root of -3 */
+extern const B168_29::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B168_29::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B168_29::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B168_29::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B168_29::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B168_29::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B168_29::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B168_29::BIG r, B168_29::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B168_29::BIG, B168_29::BIG, B168_29::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B168_29::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_C41417.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_C41417.h
new file mode 100644
index 0000000..5d591ff
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_C41417.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_C41417_H
+#define FP_C41417_H
+
+#include "big_B416_29.h"
+#include "config_field_C41417.h"
+
+using namespace core;
+
+#define MODBITS_C41417 MBITS_C41417
+#define TBITS_C41417 (MBITS_C41417%BASEBITS_B416_29)              /**< Number of active bits in top word */
+#define TMASK_C41417 (((chunk)1<<TBITS_C41417)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_C41417 (((sign32)1<<MAXXES_C41417)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_C41417 (-((chunk)(1)<<TBITS_C41417))            /**<  for masking out overflow bits */
+
+namespace C41417 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B416_29::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B416_29::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B416_29::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B416_29::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B416_29::BIG SQRTm3;      /**< Square root of -3 */
+extern const B416_29::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B416_29::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B416_29::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B416_29::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B416_29::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B416_29::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B416_29::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B416_29::BIG r, B416_29::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B416_29::BIG, B416_29::BIG, B416_29::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B416_29::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_F25519.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_F25519.h
new file mode 100644
index 0000000..09efef7
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_F25519.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_F25519_H
+#define FP_F25519_H
+
+#include "big_B256_29.h"
+#include "config_field_F25519.h"
+
+using namespace core;
+
+#define MODBITS_F25519 MBITS_F25519
+#define TBITS_F25519 (MBITS_F25519%BASEBITS_B256_29)              /**< Number of active bits in top word */
+#define TMASK_F25519 (((chunk)1<<TBITS_F25519)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_F25519 (((sign32)1<<MAXXES_F25519)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_F25519 (-((chunk)(1)<<TBITS_F25519))            /**<  for masking out overflow bits */
+
+namespace F25519 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B256_29::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B256_29::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B256_29::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B256_29::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B256_29::BIG SQRTm3;      /**< Square root of -3 */
+extern const B256_29::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B256_29::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B256_29::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B256_29::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B256_29::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B256_29::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B256_29::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B256_29::BIG r, B256_29::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B256_29::BIG, B256_29::BIG, B256_29::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B256_29::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_F256PME.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_F256PME.h
new file mode 100644
index 0000000..8d449eb
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_F256PME.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_F256PME_H
+#define FP_F256PME_H
+
+#include "big_B256_29.h"
+#include "config_field_F256PME.h"
+
+using namespace core;
+
+#define MODBITS_F256PME MBITS_F256PME
+#define TBITS_F256PME (MBITS_F256PME%BASEBITS_B256_29)              /**< Number of active bits in top word */
+#define TMASK_F256PME (((chunk)1<<TBITS_F256PME)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_F256PME (((sign32)1<<MAXXES_F256PME)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_F256PME (-((chunk)(1)<<TBITS_F256PME))            /**<  for masking out overflow bits */
+
+namespace F256PME {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B256_29::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B256_29::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B256_29::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B256_29::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B256_29::BIG SQRTm3;      /**< Square root of -3 */
+extern const B256_29::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B256_29::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B256_29::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B256_29::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B256_29::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B256_29::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B256_29::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B256_29::BIG r, B256_29::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B256_29::BIG, B256_29::BIG, B256_29::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B256_29::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_F256PMW.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_F256PMW.h
new file mode 100644
index 0000000..2e137de
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_F256PMW.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_F256PMW_H
+#define FP_F256PMW_H
+
+#include "big_B256_28.h"
+#include "config_field_F256PMW.h"
+
+using namespace core;
+
+#define MODBITS_F256PMW MBITS_F256PMW
+#define TBITS_F256PMW (MBITS_F256PMW%BASEBITS_B256_28)              /**< Number of active bits in top word */
+#define TMASK_F256PMW (((chunk)1<<TBITS_F256PMW)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_F256PMW (((sign32)1<<MAXXES_F256PMW)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_F256PMW (-((chunk)(1)<<TBITS_F256PMW))            /**<  for masking out overflow bits */
+
+namespace F256PMW {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B256_28::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B256_28::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B256_28::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B256_28::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B256_28::BIG SQRTm3;      /**< Square root of -3 */
+extern const B256_28::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B256_28::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B256_28::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B256_28::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B256_28::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B256_28::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B256_28::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B256_28::BIG r, B256_28::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B256_28::BIG, B256_28::BIG, B256_28::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B256_28::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_F384PM.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_F384PM.h
new file mode 100644
index 0000000..71478ae
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_F384PM.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_F384PM_H
+#define FP_F384PM_H
+
+#include "big_B384_29.h"
+#include "config_field_F384PM.h"
+
+using namespace core;
+
+#define MODBITS_F384PM MBITS_F384PM
+#define TBITS_F384PM (MBITS_F384PM%BASEBITS_B384_29)              /**< Number of active bits in top word */
+#define TMASK_F384PM (((chunk)1<<TBITS_F384PM)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_F384PM (((sign32)1<<MAXXES_F384PM)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_F384PM (-((chunk)(1)<<TBITS_F384PM))            /**<  for masking out overflow bits */
+
+namespace F384PM {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B384_29::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B384_29::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B384_29::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B384_29::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B384_29::BIG SQRTm3;      /**< Square root of -3 */
+extern const B384_29::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B384_29::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B384_29::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B384_29::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B384_29::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B384_29::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B384_29::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B384_29::BIG r, B384_29::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B384_29::BIG, B384_29::BIG, B384_29::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B384_29::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_F448.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_F448.h
new file mode 100644
index 0000000..e30582b
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_F448.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_F448_H
+#define FP_F448_H
+
+#include "big_B448_29.h"
+#include "config_field_F448.h"
+
+using namespace core;
+
+#define MODBITS_F448 MBITS_F448
+#define TBITS_F448 (MBITS_F448%BASEBITS_B448_29)              /**< Number of active bits in top word */
+#define TMASK_F448 (((chunk)1<<TBITS_F448)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_F448 (((sign32)1<<MAXXES_F448)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_F448 (-((chunk)(1)<<TBITS_F448))            /**<  for masking out overflow bits */
+
+namespace F448 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B448_29::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B448_29::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B448_29::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B448_29::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B448_29::BIG SQRTm3;      /**< Square root of -3 */
+extern const B448_29::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B448_29::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B448_29::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B448_29::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B448_29::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B448_29::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B448_29::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B448_29::BIG r, B448_29::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B448_29::BIG, B448_29::BIG, B448_29::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B448_29::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_F512PM.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_F512PM.h
new file mode 100644
index 0000000..c2fdd66
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_F512PM.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_F512PM_H
+#define FP_F512PM_H
+
+#include "big_B512_29.h"
+#include "config_field_F512PM.h"
+
+using namespace core;
+
+#define MODBITS_F512PM MBITS_F512PM
+#define TBITS_F512PM (MBITS_F512PM%BASEBITS_B512_29)              /**< Number of active bits in top word */
+#define TMASK_F512PM (((chunk)1<<TBITS_F512PM)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_F512PM (((sign32)1<<MAXXES_F512PM)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_F512PM (-((chunk)(1)<<TBITS_F512PM))            /**<  for masking out overflow bits */
+
+namespace F512PM {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B512_29::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B512_29::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B512_29::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B512_29::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B512_29::BIG SQRTm3;      /**< Square root of -3 */
+extern const B512_29::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B512_29::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B512_29::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B512_29::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B512_29::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B512_29::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B512_29::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B512_29::BIG r, B512_29::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B512_29::BIG, B512_29::BIG, B512_29::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B512_29::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_FP256BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_FP256BN.h
new file mode 100644
index 0000000..fdacf9d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_FP256BN.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_FP256BN_H
+#define FP_FP256BN_H
+
+#include "big_B256_28.h"
+#include "config_field_FP256BN.h"
+
+using namespace core;
+
+#define MODBITS_FP256BN MBITS_FP256BN
+#define TBITS_FP256BN (MBITS_FP256BN%BASEBITS_B256_28)              /**< Number of active bits in top word */
+#define TMASK_FP256BN (((chunk)1<<TBITS_FP256BN)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_FP256BN (((sign32)1<<MAXXES_FP256BN)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_FP256BN (-((chunk)(1)<<TBITS_FP256BN))            /**<  for masking out overflow bits */
+
+namespace FP256BN {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B256_28::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B256_28::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B256_28::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B256_28::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B256_28::BIG SQRTm3;      /**< Square root of -3 */
+extern const B256_28::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B256_28::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B256_28::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B256_28::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B256_28::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B256_28::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B256_28::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B256_28::BIG r, B256_28::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B256_28::BIG, B256_28::BIG, B256_28::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B256_28::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_FP512BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_FP512BN.h
new file mode 100644
index 0000000..82e2de6
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_FP512BN.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_FP512BN_H
+#define FP_FP512BN_H
+
+#include "big_B512_29.h"
+#include "config_field_FP512BN.h"
+
+using namespace core;
+
+#define MODBITS_FP512BN MBITS_FP512BN
+#define TBITS_FP512BN (MBITS_FP512BN%BASEBITS_B512_29)              /**< Number of active bits in top word */
+#define TMASK_FP512BN (((chunk)1<<TBITS_FP512BN)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_FP512BN (((sign32)1<<MAXXES_FP512BN)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_FP512BN (-((chunk)(1)<<TBITS_FP512BN))            /**<  for masking out overflow bits */
+
+namespace FP512BN {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B512_29::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B512_29::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B512_29::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B512_29::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B512_29::BIG SQRTm3;      /**< Square root of -3 */
+extern const B512_29::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B512_29::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B512_29::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B512_29::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B512_29::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B512_29::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B512_29::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B512_29::BIG r, B512_29::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B512_29::BIG, B512_29::BIG, B512_29::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B512_29::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_HIFIVE.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_HIFIVE.h
new file mode 100644
index 0000000..189f8a8
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_HIFIVE.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_HIFIVE_H
+#define FP_HIFIVE_H
+
+#include "big_B336_29.h"
+#include "config_field_HIFIVE.h"
+
+using namespace core;
+
+#define MODBITS_HIFIVE MBITS_HIFIVE
+#define TBITS_HIFIVE (MBITS_HIFIVE%BASEBITS_B336_29)              /**< Number of active bits in top word */
+#define TMASK_HIFIVE (((chunk)1<<TBITS_HIFIVE)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_HIFIVE (((sign32)1<<MAXXES_HIFIVE)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_HIFIVE (-((chunk)(1)<<TBITS_HIFIVE))            /**<  for masking out overflow bits */
+
+namespace HIFIVE {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B336_29::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B336_29::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B336_29::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B336_29::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B336_29::BIG SQRTm3;      /**< Square root of -3 */
+extern const B336_29::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B336_29::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B336_29::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B336_29::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B336_29::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B336_29::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B336_29::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B336_29::BIG r, B336_29::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B336_29::BIG, B336_29::BIG, B336_29::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B336_29::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_JUBJUB.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_JUBJUB.h
new file mode 100644
index 0000000..5b22099
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_JUBJUB.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_JUBJUB_H
+#define FP_JUBJUB_H
+
+#include "big_B256_29.h"
+#include "config_field_JUBJUB.h"
+
+using namespace core;
+
+#define MODBITS_JUBJUB MBITS_JUBJUB
+#define TBITS_JUBJUB (MBITS_JUBJUB%BASEBITS_B256_29)              /**< Number of active bits in top word */
+#define TMASK_JUBJUB (((chunk)1<<TBITS_JUBJUB)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_JUBJUB (((sign32)1<<MAXXES_JUBJUB)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_JUBJUB (-((chunk)(1)<<TBITS_JUBJUB))            /**<  for masking out overflow bits */
+
+namespace JUBJUB {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B256_29::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B256_29::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B256_29::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B256_29::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B256_29::BIG SQRTm3;      /**< Square root of -3 */
+extern const B256_29::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B256_29::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B256_29::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B256_29::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B256_29::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B256_29::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B256_29::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B256_29::BIG r, B256_29::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B256_29::BIG, B256_29::BIG, B256_29::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B256_29::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_MDC.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_MDC.h
new file mode 100644
index 0000000..07e8b53
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_MDC.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_MDC_H
+#define FP_MDC_H
+
+#include "big_B256_28.h"
+#include "config_field_MDC.h"
+
+using namespace core;
+
+#define MODBITS_MDC MBITS_MDC
+#define TBITS_MDC (MBITS_MDC%BASEBITS_B256_28)              /**< Number of active bits in top word */
+#define TMASK_MDC (((chunk)1<<TBITS_MDC)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_MDC (((sign32)1<<MAXXES_MDC)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_MDC (-((chunk)(1)<<TBITS_MDC))            /**<  for masking out overflow bits */
+
+namespace MDC {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B256_28::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B256_28::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B256_28::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B256_28::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B256_28::BIG SQRTm3;      /**< Square root of -3 */
+extern const B256_28::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B256_28::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B256_28::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B256_28::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B256_28::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B256_28::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B256_28::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B256_28::BIG r, B256_28::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B256_28::BIG, B256_28::BIG, B256_28::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B256_28::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_NIST256.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_NIST256.h
new file mode 100644
index 0000000..cfb87a0
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_NIST256.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_NIST256_H
+#define FP_NIST256_H
+
+#include "big_B256_28.h"
+#include "config_field_NIST256.h"
+
+using namespace core;
+
+#define MODBITS_NIST256 MBITS_NIST256
+#define TBITS_NIST256 (MBITS_NIST256%BASEBITS_B256_28)              /**< Number of active bits in top word */
+#define TMASK_NIST256 (((chunk)1<<TBITS_NIST256)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_NIST256 (((sign32)1<<MAXXES_NIST256)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_NIST256 (-((chunk)(1)<<TBITS_NIST256))            /**<  for masking out overflow bits */
+
+namespace NIST256 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B256_28::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B256_28::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B256_28::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B256_28::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B256_28::BIG SQRTm3;      /**< Square root of -3 */
+extern const B256_28::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B256_28::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B256_28::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B256_28::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B256_28::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B256_28::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B256_28::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B256_28::BIG r, B256_28::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B256_28::BIG, B256_28::BIG, B256_28::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B256_28::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_NIST384.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_NIST384.h
new file mode 100644
index 0000000..243af01
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_NIST384.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_NIST384_H
+#define FP_NIST384_H
+
+#include "big_B384_29.h"
+#include "config_field_NIST384.h"
+
+using namespace core;
+
+#define MODBITS_NIST384 MBITS_NIST384
+#define TBITS_NIST384 (MBITS_NIST384%BASEBITS_B384_29)              /**< Number of active bits in top word */
+#define TMASK_NIST384 (((chunk)1<<TBITS_NIST384)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_NIST384 (((sign32)1<<MAXXES_NIST384)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_NIST384 (-((chunk)(1)<<TBITS_NIST384))            /**<  for masking out overflow bits */
+
+namespace NIST384 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B384_29::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B384_29::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B384_29::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B384_29::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B384_29::BIG SQRTm3;      /**< Square root of -3 */
+extern const B384_29::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B384_29::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B384_29::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B384_29::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B384_29::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B384_29::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B384_29::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B384_29::BIG r, B384_29::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B384_29::BIG, B384_29::BIG, B384_29::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B384_29::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_NIST521.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_NIST521.h
new file mode 100644
index 0000000..adb0ae5
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_NIST521.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_NIST521_H
+#define FP_NIST521_H
+
+#include "big_B528_28.h"
+#include "config_field_NIST521.h"
+
+using namespace core;
+
+#define MODBITS_NIST521 MBITS_NIST521
+#define TBITS_NIST521 (MBITS_NIST521%BASEBITS_B528_28)              /**< Number of active bits in top word */
+#define TMASK_NIST521 (((chunk)1<<TBITS_NIST521)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_NIST521 (((sign32)1<<MAXXES_NIST521)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_NIST521 (-((chunk)(1)<<TBITS_NIST521))            /**<  for masking out overflow bits */
+
+namespace NIST521 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B528_28::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B528_28::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B528_28::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B528_28::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B528_28::BIG SQRTm3;      /**< Square root of -3 */
+extern const B528_28::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B528_28::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B528_28::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B528_28::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B528_28::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B528_28::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B528_28::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B528_28::BIG r, B528_28::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B528_28::BIG, B528_28::BIG, B528_28::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B528_28::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_SECP160R1.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_SECP160R1.h
new file mode 100644
index 0000000..985ae41
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_SECP160R1.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_SECP160R1_H
+#define FP_SECP160R1_H
+
+#include "big_B160_29.h"
+#include "config_field_SECP160R1.h"
+
+using namespace core;
+
+#define MODBITS_SECP160R1 MBITS_SECP160R1
+#define TBITS_SECP160R1 (MBITS_SECP160R1%BASEBITS_B160_29)              /**< Number of active bits in top word */
+#define TMASK_SECP160R1 (((chunk)1<<TBITS_SECP160R1)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_SECP160R1 (((sign32)1<<MAXXES_SECP160R1)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_SECP160R1 (-((chunk)(1)<<TBITS_SECP160R1))            /**<  for masking out overflow bits */
+
+namespace SECP160R1 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B160_29::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B160_29::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B160_29::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B160_29::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B160_29::BIG SQRTm3;      /**< Square root of -3 */
+extern const B160_29::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B160_29::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B160_29::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B160_29::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B160_29::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B160_29::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B160_29::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B160_29::BIG r, B160_29::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B160_29::BIG, B160_29::BIG, B160_29::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B160_29::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_SECP256K1.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_SECP256K1.h
new file mode 100644
index 0000000..76e790e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_SECP256K1.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_SECP256K1_H
+#define FP_SECP256K1_H
+
+#include "big_B256_28.h"
+#include "config_field_SECP256K1.h"
+
+using namespace core;
+
+#define MODBITS_SECP256K1 MBITS_SECP256K1
+#define TBITS_SECP256K1 (MBITS_SECP256K1%BASEBITS_B256_28)              /**< Number of active bits in top word */
+#define TMASK_SECP256K1 (((chunk)1<<TBITS_SECP256K1)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_SECP256K1 (((sign32)1<<MAXXES_SECP256K1)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_SECP256K1 (-((chunk)(1)<<TBITS_SECP256K1))            /**<  for masking out overflow bits */
+
+namespace SECP256K1 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B256_28::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B256_28::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B256_28::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B256_28::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B256_28::BIG SQRTm3;      /**< Square root of -3 */
+extern const B256_28::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B256_28::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B256_28::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B256_28::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B256_28::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B256_28::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B256_28::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B256_28::BIG r, B256_28::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B256_28::BIG, B256_28::BIG, B256_28::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B256_28::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_SM2.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_SM2.h
new file mode 100644
index 0000000..fd27d56
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_SM2.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_SM2_H
+#define FP_SM2_H
+
+#include "big_B256_28.h"
+#include "config_field_SM2.h"
+
+using namespace core;
+
+#define MODBITS_SM2 MBITS_SM2
+#define TBITS_SM2 (MBITS_SM2%BASEBITS_B256_28)              /**< Number of active bits in top word */
+#define TMASK_SM2 (((chunk)1<<TBITS_SM2)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_SM2 (((sign32)1<<MAXXES_SM2)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_SM2 (-((chunk)(1)<<TBITS_SM2))            /**<  for masking out overflow bits */
+
+namespace SM2 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B256_28::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B256_28::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B256_28::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B256_28::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B256_28::BIG SQRTm3;      /**< Square root of -3 */
+extern const B256_28::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B256_28::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B256_28::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B256_28::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B256_28::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B256_28::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B256_28::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B256_28::BIG r, B256_28::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B256_28::BIG, B256_28::BIG, B256_28::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B256_28::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_TWEEDLEDEE.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_TWEEDLEDEE.h
new file mode 100644
index 0000000..717811b
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_TWEEDLEDEE.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_TWEEDLEDEE_H
+#define FP_TWEEDLEDEE_H
+
+#include "big_B256_29.h"
+#include "config_field_TWEEDLEDEE.h"
+
+using namespace core;
+
+#define MODBITS_TWEEDLEDEE MBITS_TWEEDLEDEE
+#define TBITS_TWEEDLEDEE (MBITS_TWEEDLEDEE%BASEBITS_B256_29)              /**< Number of active bits in top word */
+#define TMASK_TWEEDLEDEE (((chunk)1<<TBITS_TWEEDLEDEE)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_TWEEDLEDEE (((sign32)1<<MAXXES_TWEEDLEDEE)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_TWEEDLEDEE (-((chunk)(1)<<TBITS_TWEEDLEDEE))            /**<  for masking out overflow bits */
+
+namespace TWEEDLEDEE {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B256_29::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B256_29::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B256_29::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B256_29::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B256_29::BIG SQRTm3;      /**< Square root of -3 */
+extern const B256_29::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B256_29::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B256_29::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B256_29::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B256_29::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B256_29::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B256_29::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B256_29::BIG r, B256_29::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B256_29::BIG, B256_29::BIG, B256_29::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B256_29::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_TWEEDLEDUM.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_TWEEDLEDUM.h
new file mode 100644
index 0000000..bd39bcb
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/fp_TWEEDLEDUM.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_TWEEDLEDUM_H
+#define FP_TWEEDLEDUM_H
+
+#include "big_B256_29.h"
+#include "config_field_TWEEDLEDUM.h"
+
+using namespace core;
+
+#define MODBITS_TWEEDLEDUM MBITS_TWEEDLEDUM
+#define TBITS_TWEEDLEDUM (MBITS_TWEEDLEDUM%BASEBITS_B256_29)              /**< Number of active bits in top word */
+#define TMASK_TWEEDLEDUM (((chunk)1<<TBITS_TWEEDLEDUM)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_TWEEDLEDUM (((sign32)1<<MAXXES_TWEEDLEDUM)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_TWEEDLEDUM (-((chunk)(1)<<TBITS_TWEEDLEDUM))            /**<  for masking out overflow bits */
+
+namespace TWEEDLEDUM {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B256_29::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B256_29::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B256_29::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B256_29::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B256_29::BIG SQRTm3;      /**< Square root of -3 */
+extern const B256_29::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B256_29::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B256_29::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B256_29::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B256_29::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B256_29::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B256_29::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B256_29::BIG r, B256_29::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B256_29::BIG, B256_29::BIG, B256_29::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B256_29::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_ANSSI.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_ANSSI.h
new file mode 100644
index 0000000..4109afe
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_ANSSI.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_ANSSI_H
+#define HPKE_ANSSI_H
+
+#include "ecdh_ANSSI.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace ANSSI {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_BLS12381.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_BLS12381.h
new file mode 100644
index 0000000..5f5e935
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_BLS12381.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_BLS12381_H
+#define HPKE_BLS12381_H
+
+#include "ecdh_BLS12381.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace BLS12381 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_BLS12383.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_BLS12383.h
new file mode 100644
index 0000000..3263597
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_BLS12383.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_BLS12383_H
+#define HPKE_BLS12383_H
+
+#include "ecdh_BLS12383.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace BLS12383 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_BLS12443.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_BLS12443.h
new file mode 100644
index 0000000..c23b2dc
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_BLS12443.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_BLS12443_H
+#define HPKE_BLS12443_H
+
+#include "ecdh_BLS12443.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace BLS12443 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_BLS12461.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_BLS12461.h
new file mode 100644
index 0000000..c5bd396
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_BLS12461.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_BLS12461_H
+#define HPKE_BLS12461_H
+
+#include "ecdh_BLS12461.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace BLS12461 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_BLS24479.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_BLS24479.h
new file mode 100644
index 0000000..17ec022
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_BLS24479.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_BLS24479_H
+#define HPKE_BLS24479_H
+
+#include "ecdh_BLS24479.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace BLS24479 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_BLS48286.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_BLS48286.h
new file mode 100644
index 0000000..dc98820
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_BLS48286.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_BLS48286_H
+#define HPKE_BLS48286_H
+
+#include "ecdh_BLS48286.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace BLS48286 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_BLS48556.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_BLS48556.h
new file mode 100644
index 0000000..582c973
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_BLS48556.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_BLS48556_H
+#define HPKE_BLS48556_H
+
+#include "ecdh_BLS48556.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace BLS48556 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_BLS48581.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_BLS48581.h
new file mode 100644
index 0000000..3de857d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_BLS48581.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_BLS48581_H
+#define HPKE_BLS48581_H
+
+#include "ecdh_BLS48581.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace BLS48581 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_BN158.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_BN158.h
new file mode 100644
index 0000000..63594e0
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_BN158.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_BN158_H
+#define HPKE_BN158_H
+
+#include "ecdh_BN158.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace BN158 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_BN254.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_BN254.h
new file mode 100644
index 0000000..df37ad5
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_BN254.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_BN254_H
+#define HPKE_BN254_H
+
+#include "ecdh_BN254.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace BN254 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_BN254CX.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_BN254CX.h
new file mode 100644
index 0000000..7f05bab
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_BN254CX.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_BN254CX_H
+#define HPKE_BN254CX_H
+
+#include "ecdh_BN254CX.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace BN254CX {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_BN462.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_BN462.h
new file mode 100644
index 0000000..c089594
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_BN462.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_BN462_H
+#define HPKE_BN462_H
+
+#include "ecdh_BN462.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace BN462 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_BRAINPOOL.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_BRAINPOOL.h
new file mode 100644
index 0000000..98cb67e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_BRAINPOOL.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_BRAINPOOL_H
+#define HPKE_BRAINPOOL_H
+
+#include "ecdh_BRAINPOOL.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace BRAINPOOL {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_C1174.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_C1174.h
new file mode 100644
index 0000000..2b8deea
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_C1174.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_C1174_H
+#define HPKE_C1174_H
+
+#include "ecdh_C1174.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace C1174 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_C13318.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_C13318.h
new file mode 100644
index 0000000..abeb21d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_C13318.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_C13318_H
+#define HPKE_C13318_H
+
+#include "ecdh_C13318.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace C13318 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_C1665.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_C1665.h
new file mode 100644
index 0000000..7a4a1ce
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_C1665.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_C1665_H
+#define HPKE_C1665_H
+
+#include "ecdh_C1665.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace C1665 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_C25519.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_C25519.h
new file mode 100644
index 0000000..921525a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_C25519.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_C25519_H
+#define HPKE_C25519_H
+
+#include "ecdh_C25519.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace C25519 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_C41417.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_C41417.h
new file mode 100644
index 0000000..8c703e0
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_C41417.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_C41417_H
+#define HPKE_C41417_H
+
+#include "ecdh_C41417.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace C41417 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_Ed25519.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_Ed25519.h
new file mode 100644
index 0000000..d5f32f5
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_Ed25519.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_Ed25519_H
+#define HPKE_Ed25519_H
+
+#include "ecdh_Ed25519.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace Ed25519 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_Ed448.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_Ed448.h
new file mode 100644
index 0000000..ca3df8c
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_Ed448.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_Ed448_H
+#define HPKE_Ed448_H
+
+#include "ecdh_Ed448.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace Ed448 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_FP256BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_FP256BN.h
new file mode 100644
index 0000000..57c15fa
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_FP256BN.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_FP256BN_H
+#define HPKE_FP256BN_H
+
+#include "ecdh_FP256BN.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace FP256BN {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_FP512BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_FP512BN.h
new file mode 100644
index 0000000..cc61f29
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_FP512BN.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_FP512BN_H
+#define HPKE_FP512BN_H
+
+#include "ecdh_FP512BN.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace FP512BN {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_HIFIVE.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_HIFIVE.h
new file mode 100644
index 0000000..ffb422d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_HIFIVE.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_HIFIVE_H
+#define HPKE_HIFIVE_H
+
+#include "ecdh_HIFIVE.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace HIFIVE {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_JUBJUB.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_JUBJUB.h
new file mode 100644
index 0000000..a70d73e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_JUBJUB.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_JUBJUB_H
+#define HPKE_JUBJUB_H
+
+#include "ecdh_JUBJUB.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace JUBJUB {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_MDC.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_MDC.h
new file mode 100644
index 0000000..1efff71
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_MDC.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_MDC_H
+#define HPKE_MDC_H
+
+#include "ecdh_MDC.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace MDC {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_NIST256.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_NIST256.h
new file mode 100644
index 0000000..52b958c
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_NIST256.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_NIST256_H
+#define HPKE_NIST256_H
+
+#include "ecdh_NIST256.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace NIST256 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_NIST384.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_NIST384.h
new file mode 100644
index 0000000..35d738a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_NIST384.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_NIST384_H
+#define HPKE_NIST384_H
+
+#include "ecdh_NIST384.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace NIST384 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_NIST521.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_NIST521.h
new file mode 100644
index 0000000..dd337ef
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_NIST521.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_NIST521_H
+#define HPKE_NIST521_H
+
+#include "ecdh_NIST521.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace NIST521 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_NUMS256E.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_NUMS256E.h
new file mode 100644
index 0000000..5fe75c8
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_NUMS256E.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_NUMS256E_H
+#define HPKE_NUMS256E_H
+
+#include "ecdh_NUMS256E.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace NUMS256E {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_NUMS256W.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_NUMS256W.h
new file mode 100644
index 0000000..f3df68a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_NUMS256W.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_NUMS256W_H
+#define HPKE_NUMS256W_H
+
+#include "ecdh_NUMS256W.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace NUMS256W {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_NUMS384E.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_NUMS384E.h
new file mode 100644
index 0000000..5b7eb9e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_NUMS384E.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_NUMS384E_H
+#define HPKE_NUMS384E_H
+
+#include "ecdh_NUMS384E.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace NUMS384E {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_NUMS384W.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_NUMS384W.h
new file mode 100644
index 0000000..c4de95e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_NUMS384W.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_NUMS384W_H
+#define HPKE_NUMS384W_H
+
+#include "ecdh_NUMS384W.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace NUMS384W {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_NUMS512E.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_NUMS512E.h
new file mode 100644
index 0000000..b193440
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_NUMS512E.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_NUMS512E_H
+#define HPKE_NUMS512E_H
+
+#include "ecdh_NUMS512E.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace NUMS512E {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_NUMS512W.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_NUMS512W.h
new file mode 100644
index 0000000..d70a9aa
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_NUMS512W.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_NUMS512W_H
+#define HPKE_NUMS512W_H
+
+#include "ecdh_NUMS512W.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace NUMS512W {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_SECP160R1.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_SECP160R1.h
new file mode 100644
index 0000000..521a895
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_SECP160R1.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_SECP160R1_H
+#define HPKE_SECP160R1_H
+
+#include "ecdh_SECP160R1.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace SECP160R1 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_SECP256K1.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_SECP256K1.h
new file mode 100644
index 0000000..9d85466
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_SECP256K1.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_SECP256K1_H
+#define HPKE_SECP256K1_H
+
+#include "ecdh_SECP256K1.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace SECP256K1 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_SM2.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_SM2.h
new file mode 100644
index 0000000..7237e51
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_SM2.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_SM2_H
+#define HPKE_SM2_H
+
+#include "ecdh_SM2.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace SM2 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_TWEEDLEDEE.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_TWEEDLEDEE.h
new file mode 100644
index 0000000..dbaa1e8
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_TWEEDLEDEE.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_TWEEDLEDEE_H
+#define HPKE_TWEEDLEDEE_H
+
+#include "ecdh_TWEEDLEDEE.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace TWEEDLEDEE {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_TWEEDLEDUM.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_TWEEDLEDUM.h
new file mode 100644
index 0000000..b9f8b40
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_TWEEDLEDUM.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_TWEEDLEDUM_H
+#define HPKE_TWEEDLEDUM_H
+
+#include "ecdh_TWEEDLEDUM.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace TWEEDLEDUM {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_X448.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_X448.h
new file mode 100644
index 0000000..05a934c
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/hpke_X448.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_X448_H
+#define HPKE_X448_H
+
+#include "ecdh_X448.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace X448 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/kyber.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/kyber.h
new file mode 100644
index 0000000..08da3b8
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/kyber.h
@@ -0,0 +1,139 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* Kyber API */
+
+#ifndef KYBER_H
+#define KYBER_H
+
+#include "core.h"
+
+//q= 3329
+#define KY_LGN 8
+#define KY_DEGREE (1 << KY_LGN)
+#define KY_PRIME 0xD01
+
+#define KY_ONE 0x549		// R mod Q
+#define KY_QINV 62209   // q^(-1) mod 2^16
+
+#define KYBER_SECRET_CPA_SIZE_512 (2*(KY_DEGREE*3)/2)
+#define KYBER_PUBLIC_SIZE_512 (32+2*(KY_DEGREE*3)/2)
+#define KYBER_CIPHERTEXT_SIZE_512  ((10*2+4)*KY_DEGREE/8)
+#define KYBER_SECRET_CCA_SIZE_512 (KYBER_SECRET_CPA_SIZE_512+KYBER_PUBLIC_SIZE_512+64)
+#define KYBER_SHARED_SECRET_512 32
+
+#define KYBER_SECRET_CPA_SIZE_768 (3*(KY_DEGREE*3)/2)
+#define KYBER_PUBLIC_SIZE_768 (32+3*(KY_DEGREE*3)/2)
+#define KYBER_CIPHERTEXT_SIZE_768  ((10*3+4)*KY_DEGREE/8)
+#define KYBER_SECRET_CCA_SIZE_768 (KYBER_SECRET_CPA_SIZE_768+KYBER_PUBLIC_SIZE_768+64)
+#define KYBER_SHARED_SECRET_768 32
+
+#define KYBER_SECRET_CPA_SIZE_1024 (4*(KY_DEGREE*3)/2)
+#define KYBER_PUBLIC_SIZE_1024 (32+4*(KY_DEGREE*3)/2)
+#define KYBER_CIPHERTEXT_SIZE_1024  ((11*4+5)*KY_DEGREE/8)
+#define KYBER_SECRET_CCA_SIZE_1024 (KYBER_SECRET_CPA_SIZE_1024+KYBER_PUBLIC_SIZE_1024+64)
+#define KYBER_SHARED_SECRET_1024 32
+
+#define KY_MAXK 4
+
+namespace core {
+
+/** @brief Kyber KEM CCA key pair generation
+ *
+    @param r64 64 random bytes
+    @param SK secret key
+    @param PK public key
+
+ */
+extern void KYBER512_keypair(byte *r64,octet *SK,octet *PK);
+
+/** @brief Kyber KEM CCA encrypt
+ *
+    @param r32 32 random bytes
+    @param PK public key
+	@param SS random session key generated
+	@param CT ciphertext
+
+ */
+extern void KYBER512_encrypt(byte *r32,octet *PK,octet *SS,octet *CT);
+
+/** @brief Kyber KEM CCA decrypt
+ *
+    @param SK secret key
+	@param CT ciphertext
+	@param SS output session key 
+ */
+extern void KYBER512_decrypt(octet *SK,octet *CT,octet *SS);
+
+/** @brief Kyber KEM CCA key pair generation
+ *
+    @param r64 64 random bytes
+    @param SK secret key
+    @param PK public key
+
+ */
+extern void KYBER768_keypair(byte *r64,octet *SK,octet *PK);
+
+/** @brief Kyber KEM CCA encrypt
+ *
+    @param r32 32 random bytes
+    @param PK public key
+	@param SS random session key generated
+	@param CT ciphertext
+
+ */
+extern void KYBER768_encrypt(byte *r32,octet *PK,octet *SS,octet *CT);
+
+/** @brief Kyber KEM CCA decrypt
+ *
+    @param SK secret key
+	@param CT ciphertext
+	@param SS output session key 
+ */
+extern void KYBER768_decrypt(octet *SK,octet *CT,octet *SS);
+
+/** @brief Kyber KEM CCA key pair generation
+ *
+    @param r64 64 random bytes
+    @param SK secret key
+    @param PK public key
+
+ */
+extern void KYBER1024_keypair(byte *r64,octet *SK,octet *PK);
+
+/** @brief Kyber KEM CCA encrypt
+ *
+    @param r32 32 random bytes
+    @param PK public key
+	@param SS random session key generated
+	@param CT ciphertext
+
+ */
+extern void KYBER1024_encrypt(byte *r32,octet *PK,octet *SS,octet *CT);
+
+/** @brief Kyber KEM CCA decrypt
+ *
+    @param SK secret key
+	@param CT ciphertext
+	@param SS output session key 
+ */
+extern void KYBER1024_decrypt(octet *SK,octet *CT,octet *SS);
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/mpin192_BLS24479.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/mpin192_BLS24479.h
new file mode 100644
index 0000000..49e1f69
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/mpin192_BLS24479.h
@@ -0,0 +1,136 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file mpin.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief M-Pin Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef MPIN_BLS24479_H
+#define MPIN_BLS24479_H
+
+#include "pair4_BLS24479.h"
+//#include "pbc_support.h"
+
+using namespace core;
+
+
+namespace BLS24479 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define PGS_BLS24479 MODBYTES_B480_29  /**< MPIN Group Size */
+#define PFS_BLS24479 MODBYTES_B480_29  /**< MPIN Field Size */
+
+#define MPIN_OK             0   /**< Function completed without error */
+#define MPIN_INVALID_POINT  -14	/**< Point is NOT on the curve */
+#define MPIN_BAD_PIN        -19 /**< Bad PIN number entered */
+
+#define MAXPIN 10000         /**< max PIN */
+#define PBLEN 14             /**< max length of PIN in bits */
+
+//#define PAS_BLS24479 24        /**< MPIN Symmetric Key Size 192 bits  */
+//#define HASH_TYPE_MPIN_BLS24479 SHA384   /**< Choose Hash function */
+
+/* MPIN support functions */
+
+/* MPIN primitives */
+
+/**	@brief Encode a string to a curve point (in constant time)
+ *
+	@param DST is the Domain Separation Tag
+    @param ID is the input string
+    @param HID is the output point in G1
+*/
+void MPIN_ENCODE_TO_CURVE(octet *DST,octet *ID,octet *HID);
+
+/**	@brief Extract a PIN number from a client secret
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param pin is an input PIN number
+	@param CS is the client secret from which the PIN is to be extracted
+	@return 0 or an error code
+ */
+int MPIN_EXTRACT_PIN(octet *HID, int pin, octet *CS);
+
+/**	@brief Perform first pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param R is a pointer to a cryptographically secure random number generator
+	@param x an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param pin is the input PIN number
+	@param T is the input M-Pin token (the client secret with PIN portion removed)
+	@param S is the reconstructed client secret
+	@param U is output = x.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_1(octet *HID, csprng *R, octet *x, int pin, octet *T, octet *S, octet *U);
+/**	@brief Generate a random group element
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param S is the output random octet
+	@return 0 or an error code
+ */
+int MPIN_RANDOM_GENERATE(csprng *R, octet *S);
+/**	@brief Perform second pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param x an input, a locally generated random number
+	@param y an input random challenge from the server
+	@param V on output = -(x+y).V
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_2(octet *x, octet *y, octet *V);
+
+/**	@brief Perform third pass on the server side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is input H(ID), a hash of the client ID
+	@param y is the input server's randomly generated challenge
+	@param SS is the input server secret
+	@param U is input from the client = x.H(ID)
+	@param V is an input from the client
+	@return 0 or an error code
+ */
+int MPIN_SERVER(octet *HID, octet *y, octet *SS, octet *U, octet *V);
+
+/**	@brief Create a client secret in G1 from a master secret and the client ID
+ *
+	@param S is an input master secret
+	@param HID is the input client identity hashed to point
+	@param CS is the full client secret = s.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_GET_CLIENT_SECRET(octet *S, octet *HID, octet *CS);
+
+/**	@brief Create a server secret in G2 from a master secret
+ *
+	@param S is an input master secret
+	@param SS is the server secret = s.Q where Q is a fixed generator of G2
+	@return 0 or an error code
+ */
+int MPIN_GET_SERVER_SECRET(octet *S, octet *SS);
+}
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/mpin256_BLS48286.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/mpin256_BLS48286.h
new file mode 100644
index 0000000..84bbb1d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/mpin256_BLS48286.h
@@ -0,0 +1,133 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file mpin.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief M-Pin Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef MPIN_BLS48286_H
+#define MPIN_BLS48286_H
+
+#include "pair8_BLS48286.h"
+//#include "pbc_support.h"
+
+using namespace core;
+
+
+namespace BLS48286 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define PGS_BLS48286 MODBYTES_B288_29  /**< MPIN Group Size */
+#define PFS_BLS48286 MODBYTES_B288_29  /**< MPIN Field Size */
+
+#define MPIN_OK             0   /**< Function completed without error */
+#define MPIN_INVALID_POINT  -14	/**< Point is NOT on the curve */
+#define MPIN_BAD_PIN        -19 /**< Bad PIN number entered */
+
+#define MAXPIN 10000         /**< max PIN */
+#define PBLEN 14             /**< max length of PIN in bits */
+
+//#define PAS_BLS48286 24        /**< MPIN Symmetric Key Size 192 bits  */
+//#define HASH_TYPE_MPIN_BLS48286 SHA384   /**< Choose Hash function */
+
+/* MPIN support functions */
+/* MPIN primitives */
+
+/**	@brief Encode a string to a curve point (in constant time)
+ *
+	@param DST is the Domain Separation Tag
+    @param ID is the input string
+    @param HCID is the output point in G1
+*/
+void MPIN_ENCODE_TO_CURVE(octet *DST,octet *ID,octet *HCID);
+
+/**	@brief Extract a PIN number from a client secret
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param pin is an input PIN number
+	@param CS is the client secret from which the PIN is to be extracted
+	@return 0 or an error code
+ */
+int MPIN_EXTRACT_PIN(octet *HID, int pin, octet *CS);
+
+/**	@brief Perform first pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param R is a pointer to a cryptographically secure random number generator
+	@param x an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param pin is the input PIN number
+	@param T is the input M-Pin token (the client secret with PIN portion removed)
+	@param S is output = CS+TP, where CS=is the reconstructed client secret, and TP is the time permit
+	@param U is output = x.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_1(octet *HID, csprng *R, octet *x, int pin, octet *T, octet *S, octet *U);
+/**	@brief Generate a random group element
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param S is the output random octet
+	@return 0 or an error code
+ */
+int MPIN_RANDOM_GENERATE(csprng *R, octet *S);
+/**	@brief Perform second pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param x an input, a locally generated random number
+	@param y an input random challenge from the server
+	@param V on output = -(x+y).V
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_2(octet *x, octet *y, octet *V);
+/**	@brief Perform third pass on the server side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is input H(ID), a hash of the client ID
+	@param y is the input server's randomly generated challenge
+	@param SS is the input server secret
+	@param U is input from the client = x.H(ID)
+	@param V is an input from the client
+	@return 0 or an error code
+ */
+int MPIN_SERVER(octet *HID, octet *y, octet *SS, octet *U, octet *V);
+/**	@brief Create a client secret in G1 from a master secret and the client ID
+ *
+	@param S is an input master secret
+	@param HID is the input client identity hashed to point
+	@param CS is the full client secret = s.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_GET_CLIENT_SECRET(octet *S, octet *HID, octet *CS);
+
+/**	@brief Create a server secret in G2 from a master secret
+ *
+	@param S is an input master secret
+	@param SS is the server secret = s.Q where Q is a fixed generator of G2
+	@return 0 or an error code
+ */
+int MPIN_GET_SERVER_SECRET(octet *S, octet *SS);
+}
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/mpin256_BLS48556.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/mpin256_BLS48556.h
new file mode 100644
index 0000000..9db3725
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/mpin256_BLS48556.h
@@ -0,0 +1,133 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file mpin.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief M-Pin Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef MPIN_BLS48556_H
+#define MPIN_BLS48556_H
+
+#include "pair8_BLS48556.h"
+//#include "pbc_support.h"
+
+using namespace core;
+
+
+namespace BLS48556 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define PGS_BLS48556 MODBYTES_B560_29  /**< MPIN Group Size */
+#define PFS_BLS48556 MODBYTES_B560_29  /**< MPIN Field Size */
+
+#define MPIN_OK             0   /**< Function completed without error */
+#define MPIN_INVALID_POINT  -14	/**< Point is NOT on the curve */
+#define MPIN_BAD_PIN        -19 /**< Bad PIN number entered */
+
+#define MAXPIN 10000         /**< max PIN */
+#define PBLEN 14             /**< max length of PIN in bits */
+
+//#define PAS_BLS48556 24        /**< MPIN Symmetric Key Size 192 bits  */
+//#define HASH_TYPE_MPIN_BLS48556 SHA384   /**< Choose Hash function */
+
+/* MPIN support functions */
+/* MPIN primitives */
+
+/**	@brief Encode a string to a curve point (in constant time)
+ *
+	@param DST is the Domain Separation Tag
+    @param ID is the input string
+    @param HCID is the output point in G1
+*/
+void MPIN_ENCODE_TO_CURVE(octet *DST,octet *ID,octet *HCID);
+
+/**	@brief Extract a PIN number from a client secret
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param pin is an input PIN number
+	@param CS is the client secret from which the PIN is to be extracted
+	@return 0 or an error code
+ */
+int MPIN_EXTRACT_PIN(octet *HID, int pin, octet *CS);
+
+/**	@brief Perform first pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param R is a pointer to a cryptographically secure random number generator
+	@param x an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param pin is the input PIN number
+	@param T is the input M-Pin token (the client secret with PIN portion removed)
+	@param S is output = CS+TP, where CS=is the reconstructed client secret, and TP is the time permit
+	@param U is output = x.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_1(octet *HID, csprng *R, octet *x, int pin, octet *T, octet *S, octet *U);
+/**	@brief Generate a random group element
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param S is the output random octet
+	@return 0 or an error code
+ */
+int MPIN_RANDOM_GENERATE(csprng *R, octet *S);
+/**	@brief Perform second pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param x an input, a locally generated random number
+	@param y an input random challenge from the server
+	@param V on output = -(x+y).V
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_2(octet *x, octet *y, octet *V);
+/**	@brief Perform third pass on the server side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is input H(ID), a hash of the client ID
+	@param y is the input server's randomly generated challenge
+	@param SS is the input server secret
+	@param U is input from the client = x.H(ID)
+	@param V is an input from the client
+	@return 0 or an error code
+ */
+int MPIN_SERVER(octet *HID, octet *y, octet *SS, octet *U, octet *V);
+/**	@brief Create a client secret in G1 from a master secret and the client ID
+ *
+	@param S is an input master secret
+	@param HID is the input client identity hashed to point
+	@param CS is the full client secret = s.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_GET_CLIENT_SECRET(octet *S, octet *HID, octet *CS);
+
+/**	@brief Create a server secret in G2 from a master secret
+ *
+	@param S is an input master secret
+	@param SS is the server secret = s.Q where Q is a fixed generator of G2
+	@return 0 or an error code
+ */
+int MPIN_GET_SERVER_SECRET(octet *S, octet *SS);
+}
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/mpin256_BLS48581.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/mpin256_BLS48581.h
new file mode 100644
index 0000000..7623305
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/mpin256_BLS48581.h
@@ -0,0 +1,133 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file mpin.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief M-Pin Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef MPIN_BLS48581_H
+#define MPIN_BLS48581_H
+
+#include "pair8_BLS48581.h"
+//#include "pbc_support.h"
+
+using namespace core;
+
+
+namespace BLS48581 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define PGS_BLS48581 MODBYTES_B584_29  /**< MPIN Group Size */
+#define PFS_BLS48581 MODBYTES_B584_29  /**< MPIN Field Size */
+
+#define MPIN_OK             0   /**< Function completed without error */
+#define MPIN_INVALID_POINT  -14	/**< Point is NOT on the curve */
+#define MPIN_BAD_PIN        -19 /**< Bad PIN number entered */
+
+#define MAXPIN 10000         /**< max PIN */
+#define PBLEN 14             /**< max length of PIN in bits */
+
+//#define PAS_BLS48581 24        /**< MPIN Symmetric Key Size 192 bits  */
+//#define HASH_TYPE_MPIN_BLS48581 SHA384   /**< Choose Hash function */
+
+/* MPIN support functions */
+/* MPIN primitives */
+
+/**	@brief Encode a string to a curve point (in constant time)
+ *
+	@param DST is the Domain Separation Tag
+    @param ID is the input string
+    @param HCID is the output point in G1
+*/
+void MPIN_ENCODE_TO_CURVE(octet *DST,octet *ID,octet *HCID);
+
+/**	@brief Extract a PIN number from a client secret
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param pin is an input PIN number
+	@param CS is the client secret from which the PIN is to be extracted
+	@return 0 or an error code
+ */
+int MPIN_EXTRACT_PIN(octet *HID, int pin, octet *CS);
+
+/**	@brief Perform first pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param R is a pointer to a cryptographically secure random number generator
+	@param x an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param pin is the input PIN number
+	@param T is the input M-Pin token (the client secret with PIN portion removed)
+	@param S is output = CS+TP, where CS=is the reconstructed client secret, and TP is the time permit
+	@param U is output = x.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_1(octet *HID, csprng *R, octet *x, int pin, octet *T, octet *S, octet *U);
+/**	@brief Generate a random group element
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param S is the output random octet
+	@return 0 or an error code
+ */
+int MPIN_RANDOM_GENERATE(csprng *R, octet *S);
+/**	@brief Perform second pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param x an input, a locally generated random number
+	@param y an input random challenge from the server
+	@param V on output = -(x+y).V
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_2(octet *x, octet *y, octet *V);
+/**	@brief Perform third pass on the server side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is input H(ID), a hash of the client ID
+	@param y is the input server's randomly generated challenge
+	@param SS is the input server secret
+	@param U is input from the client = x.H(ID)
+	@param V is an input from the client
+	@return 0 or an error code
+ */
+int MPIN_SERVER(octet *HID, octet *y, octet *SS, octet *U, octet *V);
+/**	@brief Create a client secret in G1 from a master secret and the client ID
+ *
+	@param S is an input master secret
+	@param HID is the input client identity hashed to point
+	@param CS is the full client secret = s.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_GET_CLIENT_SECRET(octet *S, octet *HID, octet *CS);
+
+/**	@brief Create a server secret in G2 from a master secret
+ *
+	@param S is an input master secret
+	@param SS is the server secret = s.Q where Q is a fixed generator of G2
+	@return 0 or an error code
+ */
+int MPIN_GET_SERVER_SECRET(octet *S, octet *SS);
+}
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/mpin_BLS12381.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/mpin_BLS12381.h
new file mode 100644
index 0000000..37c36cf
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/mpin_BLS12381.h
@@ -0,0 +1,136 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file mpin.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief M-Pin Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef MPIN_BLS12381_H
+#define MPIN_BLS12381_H
+
+#include "pair_BLS12381.h"
+//#include "pbc_support.h"
+
+using namespace core;
+
+
+namespace BLS12381 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define PGS_BLS12381 MODBYTES_B384_29  /**< MPIN Group Size */
+#define PFS_BLS12381 MODBYTES_B384_29  /**< MPIN Field Size */
+
+#define MPIN_OK             0   /**< Function completed without error */
+#define MPIN_INVALID_POINT  -14	/**< Point is NOT on the curve */
+#define MPIN_BAD_PIN        -19 /**< Bad PIN number entered */
+
+#define MAXPIN 10000         /**< max PIN */
+#define PBLEN 14             /**< max length of PIN in bits */
+
+//#define PAS_BLS12381 16        /**< MPIN Symmetric Key Size 128 bits */
+//#define HASH_TYPE_MPIN_BLS12381 SHA256   /**< Choose Hash function */
+
+/* MPIN support functions */
+
+/* MPIN primitives */
+
+/**	@brief Encode a string to a curve point (in constant time)
+ *
+	@param DST is the Domain Separation Tag
+    @param ID is the input string
+    @param HID is the output point in G1
+*/
+void MPIN_ENCODE_TO_CURVE(octet *DST,octet *ID,octet *HID);
+
+/**	@brief Extract a PIN number from a client secret
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param pin is an input PIN number
+	@param CS is the client secret from which the PIN is to be extracted
+	@return 0 or an error code
+ */
+int MPIN_EXTRACT_PIN(octet *HID, int pin, octet *CS);
+
+/**	@brief Perform first pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param R is a pointer to a cryptographically secure random number generator
+	@param x an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param pin is the input PIN number
+	@param T is the input M-Pin token (the client secret with PIN portion removed)
+	@param S is the reconstructed client secret
+	@param U is output = x.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_1(octet *HID, csprng *R, octet *x, int pin, octet *T, octet *S, octet *U);
+/**	@brief Generate a random group element
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param S is the output random octet
+	@return 0 or an error code
+ */
+int MPIN_RANDOM_GENERATE(csprng *R, octet *S);
+/**	@brief Perform second pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param x an input, a locally generated random number
+	@param y an input random challenge from the server
+	@param V on output = -(x+y).V
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_2(octet *x, octet *y, octet *V);
+
+/**	@brief Perform final pass on the server side of the M-Pin protocol
+
+	@param HID is input H(ID), a hash of the client ID
+	@param y is the input server's randomly generated challenge
+	@param SS is the input server secret
+	@param U is input from the client = x.H(ID)
+	@param V is an input from the client
+	@return 0 or an error code
+ */
+int MPIN_SERVER(octet *HID, octet *y, octet *SS, octet *U, octet *V);
+
+/**	@brief Create a client secret in G1 from a master secret and the client ID
+ *
+	@param S is an input master secret
+	@param HID is the input client identity hashed to curve
+	@param CS is the full client secret = s.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_GET_CLIENT_SECRET(octet *S, octet *HID, octet *CS);
+
+/**	@brief Create a server secret in G2 from a master secret
+ *
+	@param S is an input master secret
+	@param SS is the server secret = s.Q where Q is a fixed generator of G2
+	@return 0 or an error code
+ */
+int MPIN_GET_SERVER_SECRET(octet *S, octet *SS);
+}
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/mpin_BLS12383.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/mpin_BLS12383.h
new file mode 100644
index 0000000..4a6449d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/mpin_BLS12383.h
@@ -0,0 +1,136 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file mpin.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief M-Pin Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef MPIN_BLS12383_H
+#define MPIN_BLS12383_H
+
+#include "pair_BLS12383.h"
+//#include "pbc_support.h"
+
+using namespace core;
+
+
+namespace BLS12383 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define PGS_BLS12383 MODBYTES_B384_29  /**< MPIN Group Size */
+#define PFS_BLS12383 MODBYTES_B384_29  /**< MPIN Field Size */
+
+#define MPIN_OK             0   /**< Function completed without error */
+#define MPIN_INVALID_POINT  -14	/**< Point is NOT on the curve */
+#define MPIN_BAD_PIN        -19 /**< Bad PIN number entered */
+
+#define MAXPIN 10000         /**< max PIN */
+#define PBLEN 14             /**< max length of PIN in bits */
+
+//#define PAS_BLS12383 16        /**< MPIN Symmetric Key Size 128 bits */
+//#define HASH_TYPE_MPIN_BLS12383 SHA256   /**< Choose Hash function */
+
+/* MPIN support functions */
+
+/* MPIN primitives */
+
+/**	@brief Encode a string to a curve point (in constant time)
+ *
+	@param DST is the Domain Separation Tag
+    @param ID is the input string
+    @param HID is the output point in G1
+*/
+void MPIN_ENCODE_TO_CURVE(octet *DST,octet *ID,octet *HID);
+
+/**	@brief Extract a PIN number from a client secret
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param pin is an input PIN number
+	@param CS is the client secret from which the PIN is to be extracted
+	@return 0 or an error code
+ */
+int MPIN_EXTRACT_PIN(octet *HID, int pin, octet *CS);
+
+/**	@brief Perform first pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param R is a pointer to a cryptographically secure random number generator
+	@param x an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param pin is the input PIN number
+	@param T is the input M-Pin token (the client secret with PIN portion removed)
+	@param S is the reconstructed client secret
+	@param U is output = x.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_1(octet *HID, csprng *R, octet *x, int pin, octet *T, octet *S, octet *U);
+/**	@brief Generate a random group element
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param S is the output random octet
+	@return 0 or an error code
+ */
+int MPIN_RANDOM_GENERATE(csprng *R, octet *S);
+/**	@brief Perform second pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param x an input, a locally generated random number
+	@param y an input random challenge from the server
+	@param V on output = -(x+y).V
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_2(octet *x, octet *y, octet *V);
+
+/**	@brief Perform final pass on the server side of the M-Pin protocol
+
+	@param HID is input H(ID), a hash of the client ID
+	@param y is the input server's randomly generated challenge
+	@param SS is the input server secret
+	@param U is input from the client = x.H(ID)
+	@param V is an input from the client
+	@return 0 or an error code
+ */
+int MPIN_SERVER(octet *HID, octet *y, octet *SS, octet *U, octet *V);
+
+/**	@brief Create a client secret in G1 from a master secret and the client ID
+ *
+	@param S is an input master secret
+	@param HID is the input client identity hashed to curve
+	@param CS is the full client secret = s.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_GET_CLIENT_SECRET(octet *S, octet *HID, octet *CS);
+
+/**	@brief Create a server secret in G2 from a master secret
+ *
+	@param S is an input master secret
+	@param SS is the server secret = s.Q where Q is a fixed generator of G2
+	@return 0 or an error code
+ */
+int MPIN_GET_SERVER_SECRET(octet *S, octet *SS);
+}
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/mpin_BLS12443.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/mpin_BLS12443.h
new file mode 100644
index 0000000..ea8602a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/mpin_BLS12443.h
@@ -0,0 +1,136 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file mpin.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief M-Pin Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef MPIN_BLS12443_H
+#define MPIN_BLS12443_H
+
+#include "pair_BLS12443.h"
+//#include "pbc_support.h"
+
+using namespace core;
+
+
+namespace BLS12443 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define PGS_BLS12443 MODBYTES_B448_29  /**< MPIN Group Size */
+#define PFS_BLS12443 MODBYTES_B448_29  /**< MPIN Field Size */
+
+#define MPIN_OK             0   /**< Function completed without error */
+#define MPIN_INVALID_POINT  -14	/**< Point is NOT on the curve */
+#define MPIN_BAD_PIN        -19 /**< Bad PIN number entered */
+
+#define MAXPIN 10000         /**< max PIN */
+#define PBLEN 14             /**< max length of PIN in bits */
+
+//#define PAS_BLS12443 16        /**< MPIN Symmetric Key Size 128 bits */
+//#define HASH_TYPE_MPIN_BLS12443 SHA256   /**< Choose Hash function */
+
+/* MPIN support functions */
+
+/* MPIN primitives */
+
+/**	@brief Encode a string to a curve point (in constant time)
+ *
+	@param DST is the Domain Separation Tag
+    @param ID is the input string
+    @param HID is the output point in G1
+*/
+void MPIN_ENCODE_TO_CURVE(octet *DST,octet *ID,octet *HID);
+
+/**	@brief Extract a PIN number from a client secret
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param pin is an input PIN number
+	@param CS is the client secret from which the PIN is to be extracted
+	@return 0 or an error code
+ */
+int MPIN_EXTRACT_PIN(octet *HID, int pin, octet *CS);
+
+/**	@brief Perform first pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param R is a pointer to a cryptographically secure random number generator
+	@param x an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param pin is the input PIN number
+	@param T is the input M-Pin token (the client secret with PIN portion removed)
+	@param S is the reconstructed client secret
+	@param U is output = x.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_1(octet *HID, csprng *R, octet *x, int pin, octet *T, octet *S, octet *U);
+/**	@brief Generate a random group element
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param S is the output random octet
+	@return 0 or an error code
+ */
+int MPIN_RANDOM_GENERATE(csprng *R, octet *S);
+/**	@brief Perform second pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param x an input, a locally generated random number
+	@param y an input random challenge from the server
+	@param V on output = -(x+y).V
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_2(octet *x, octet *y, octet *V);
+
+/**	@brief Perform final pass on the server side of the M-Pin protocol
+
+	@param HID is input H(ID), a hash of the client ID
+	@param y is the input server's randomly generated challenge
+	@param SS is the input server secret
+	@param U is input from the client = x.H(ID)
+	@param V is an input from the client
+	@return 0 or an error code
+ */
+int MPIN_SERVER(octet *HID, octet *y, octet *SS, octet *U, octet *V);
+
+/**	@brief Create a client secret in G1 from a master secret and the client ID
+ *
+	@param S is an input master secret
+	@param HID is the input client identity hashed to curve
+	@param CS is the full client secret = s.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_GET_CLIENT_SECRET(octet *S, octet *HID, octet *CS);
+
+/**	@brief Create a server secret in G2 from a master secret
+ *
+	@param S is an input master secret
+	@param SS is the server secret = s.Q where Q is a fixed generator of G2
+	@return 0 or an error code
+ */
+int MPIN_GET_SERVER_SECRET(octet *S, octet *SS);
+}
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/mpin_BLS12461.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/mpin_BLS12461.h
new file mode 100644
index 0000000..77eefd5
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/mpin_BLS12461.h
@@ -0,0 +1,136 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file mpin.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief M-Pin Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef MPIN_BLS12461_H
+#define MPIN_BLS12461_H
+
+#include "pair_BLS12461.h"
+//#include "pbc_support.h"
+
+using namespace core;
+
+
+namespace BLS12461 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define PGS_BLS12461 MODBYTES_B464_28  /**< MPIN Group Size */
+#define PFS_BLS12461 MODBYTES_B464_28  /**< MPIN Field Size */
+
+#define MPIN_OK             0   /**< Function completed without error */
+#define MPIN_INVALID_POINT  -14	/**< Point is NOT on the curve */
+#define MPIN_BAD_PIN        -19 /**< Bad PIN number entered */
+
+#define MAXPIN 10000         /**< max PIN */
+#define PBLEN 14             /**< max length of PIN in bits */
+
+//#define PAS_BLS12461 16        /**< MPIN Symmetric Key Size 128 bits */
+//#define HASH_TYPE_MPIN_BLS12461 SHA256   /**< Choose Hash function */
+
+/* MPIN support functions */
+
+/* MPIN primitives */
+
+/**	@brief Encode a string to a curve point (in constant time)
+ *
+	@param DST is the Domain Separation Tag
+    @param ID is the input string
+    @param HID is the output point in G1
+*/
+void MPIN_ENCODE_TO_CURVE(octet *DST,octet *ID,octet *HID);
+
+/**	@brief Extract a PIN number from a client secret
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param pin is an input PIN number
+	@param CS is the client secret from which the PIN is to be extracted
+	@return 0 or an error code
+ */
+int MPIN_EXTRACT_PIN(octet *HID, int pin, octet *CS);
+
+/**	@brief Perform first pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param R is a pointer to a cryptographically secure random number generator
+	@param x an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param pin is the input PIN number
+	@param T is the input M-Pin token (the client secret with PIN portion removed)
+	@param S is the reconstructed client secret
+	@param U is output = x.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_1(octet *HID, csprng *R, octet *x, int pin, octet *T, octet *S, octet *U);
+/**	@brief Generate a random group element
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param S is the output random octet
+	@return 0 or an error code
+ */
+int MPIN_RANDOM_GENERATE(csprng *R, octet *S);
+/**	@brief Perform second pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param x an input, a locally generated random number
+	@param y an input random challenge from the server
+	@param V on output = -(x+y).V
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_2(octet *x, octet *y, octet *V);
+
+/**	@brief Perform final pass on the server side of the M-Pin protocol
+
+	@param HID is input H(ID), a hash of the client ID
+	@param y is the input server's randomly generated challenge
+	@param SS is the input server secret
+	@param U is input from the client = x.H(ID)
+	@param V is an input from the client
+	@return 0 or an error code
+ */
+int MPIN_SERVER(octet *HID, octet *y, octet *SS, octet *U, octet *V);
+
+/**	@brief Create a client secret in G1 from a master secret and the client ID
+ *
+	@param S is an input master secret
+	@param HID is the input client identity hashed to curve
+	@param CS is the full client secret = s.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_GET_CLIENT_SECRET(octet *S, octet *HID, octet *CS);
+
+/**	@brief Create a server secret in G2 from a master secret
+ *
+	@param S is an input master secret
+	@param SS is the server secret = s.Q where Q is a fixed generator of G2
+	@return 0 or an error code
+ */
+int MPIN_GET_SERVER_SECRET(octet *S, octet *SS);
+}
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/mpin_BN158.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/mpin_BN158.h
new file mode 100644
index 0000000..52e22e5
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/mpin_BN158.h
@@ -0,0 +1,136 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file mpin.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief M-Pin Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef MPIN_BN158_H
+#define MPIN_BN158_H
+
+#include "pair_BN158.h"
+//#include "pbc_support.h"
+
+using namespace core;
+
+
+namespace BN158 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define PGS_BN158 MODBYTES_B160_28  /**< MPIN Group Size */
+#define PFS_BN158 MODBYTES_B160_28  /**< MPIN Field Size */
+
+#define MPIN_OK             0   /**< Function completed without error */
+#define MPIN_INVALID_POINT  -14	/**< Point is NOT on the curve */
+#define MPIN_BAD_PIN        -19 /**< Bad PIN number entered */
+
+#define MAXPIN 10000         /**< max PIN */
+#define PBLEN 14             /**< max length of PIN in bits */
+
+//#define PAS_BN158 16        /**< MPIN Symmetric Key Size 128 bits */
+//#define HASH_TYPE_MPIN_BN158 SHA256   /**< Choose Hash function */
+
+/* MPIN support functions */
+
+/* MPIN primitives */
+
+/**	@brief Encode a string to a curve point (in constant time)
+ *
+	@param DST is the Domain Separation Tag
+    @param ID is the input string
+    @param HID is the output point in G1
+*/
+void MPIN_ENCODE_TO_CURVE(octet *DST,octet *ID,octet *HID);
+
+/**	@brief Extract a PIN number from a client secret
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param pin is an input PIN number
+	@param CS is the client secret from which the PIN is to be extracted
+	@return 0 or an error code
+ */
+int MPIN_EXTRACT_PIN(octet *HID, int pin, octet *CS);
+
+/**	@brief Perform first pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param R is a pointer to a cryptographically secure random number generator
+	@param x an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param pin is the input PIN number
+	@param T is the input M-Pin token (the client secret with PIN portion removed)
+	@param S is the reconstructed client secret
+	@param U is output = x.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_1(octet *HID, csprng *R, octet *x, int pin, octet *T, octet *S, octet *U);
+/**	@brief Generate a random group element
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param S is the output random octet
+	@return 0 or an error code
+ */
+int MPIN_RANDOM_GENERATE(csprng *R, octet *S);
+/**	@brief Perform second pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param x an input, a locally generated random number
+	@param y an input random challenge from the server
+	@param V on output = -(x+y).V
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_2(octet *x, octet *y, octet *V);
+
+/**	@brief Perform final pass on the server side of the M-Pin protocol
+
+	@param HID is input H(ID), a hash of the client ID
+	@param y is the input server's randomly generated challenge
+	@param SS is the input server secret
+	@param U is input from the client = x.H(ID)
+	@param V is an input from the client
+	@return 0 or an error code
+ */
+int MPIN_SERVER(octet *HID, octet *y, octet *SS, octet *U, octet *V);
+
+/**	@brief Create a client secret in G1 from a master secret and the client ID
+ *
+	@param S is an input master secret
+	@param HID is the input client identity hashed to curve
+	@param CS is the full client secret = s.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_GET_CLIENT_SECRET(octet *S, octet *HID, octet *CS);
+
+/**	@brief Create a server secret in G2 from a master secret
+ *
+	@param S is an input master secret
+	@param SS is the server secret = s.Q where Q is a fixed generator of G2
+	@return 0 or an error code
+ */
+int MPIN_GET_SERVER_SECRET(octet *S, octet *SS);
+}
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/mpin_BN254.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/mpin_BN254.h
new file mode 100644
index 0000000..1a81c25
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/mpin_BN254.h
@@ -0,0 +1,136 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file mpin.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief M-Pin Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef MPIN_BN254_H
+#define MPIN_BN254_H
+
+#include "pair_BN254.h"
+//#include "pbc_support.h"
+
+using namespace core;
+
+
+namespace BN254 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define PGS_BN254 MODBYTES_B256_28  /**< MPIN Group Size */
+#define PFS_BN254 MODBYTES_B256_28  /**< MPIN Field Size */
+
+#define MPIN_OK             0   /**< Function completed without error */
+#define MPIN_INVALID_POINT  -14	/**< Point is NOT on the curve */
+#define MPIN_BAD_PIN        -19 /**< Bad PIN number entered */
+
+#define MAXPIN 10000         /**< max PIN */
+#define PBLEN 14             /**< max length of PIN in bits */
+
+//#define PAS_BN254 16        /**< MPIN Symmetric Key Size 128 bits */
+//#define HASH_TYPE_MPIN_BN254 SHA256   /**< Choose Hash function */
+
+/* MPIN support functions */
+
+/* MPIN primitives */
+
+/**	@brief Encode a string to a curve point (in constant time)
+ *
+	@param DST is the Domain Separation Tag
+    @param ID is the input string
+    @param HID is the output point in G1
+*/
+void MPIN_ENCODE_TO_CURVE(octet *DST,octet *ID,octet *HID);
+
+/**	@brief Extract a PIN number from a client secret
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param pin is an input PIN number
+	@param CS is the client secret from which the PIN is to be extracted
+	@return 0 or an error code
+ */
+int MPIN_EXTRACT_PIN(octet *HID, int pin, octet *CS);
+
+/**	@brief Perform first pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param R is a pointer to a cryptographically secure random number generator
+	@param x an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param pin is the input PIN number
+	@param T is the input M-Pin token (the client secret with PIN portion removed)
+	@param S is the reconstructed client secret
+	@param U is output = x.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_1(octet *HID, csprng *R, octet *x, int pin, octet *T, octet *S, octet *U);
+/**	@brief Generate a random group element
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param S is the output random octet
+	@return 0 or an error code
+ */
+int MPIN_RANDOM_GENERATE(csprng *R, octet *S);
+/**	@brief Perform second pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param x an input, a locally generated random number
+	@param y an input random challenge from the server
+	@param V on output = -(x+y).V
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_2(octet *x, octet *y, octet *V);
+
+/**	@brief Perform final pass on the server side of the M-Pin protocol
+
+	@param HID is input H(ID), a hash of the client ID
+	@param y is the input server's randomly generated challenge
+	@param SS is the input server secret
+	@param U is input from the client = x.H(ID)
+	@param V is an input from the client
+	@return 0 or an error code
+ */
+int MPIN_SERVER(octet *HID, octet *y, octet *SS, octet *U, octet *V);
+
+/**	@brief Create a client secret in G1 from a master secret and the client ID
+ *
+	@param S is an input master secret
+	@param HID is the input client identity hashed to curve
+	@param CS is the full client secret = s.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_GET_CLIENT_SECRET(octet *S, octet *HID, octet *CS);
+
+/**	@brief Create a server secret in G2 from a master secret
+ *
+	@param S is an input master secret
+	@param SS is the server secret = s.Q where Q is a fixed generator of G2
+	@return 0 or an error code
+ */
+int MPIN_GET_SERVER_SECRET(octet *S, octet *SS);
+}
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/mpin_BN254CX.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/mpin_BN254CX.h
new file mode 100644
index 0000000..ab612ef
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/mpin_BN254CX.h
@@ -0,0 +1,136 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file mpin.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief M-Pin Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef MPIN_BN254CX_H
+#define MPIN_BN254CX_H
+
+#include "pair_BN254CX.h"
+//#include "pbc_support.h"
+
+using namespace core;
+
+
+namespace BN254CX {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define PGS_BN254CX MODBYTES_B256_28  /**< MPIN Group Size */
+#define PFS_BN254CX MODBYTES_B256_28  /**< MPIN Field Size */
+
+#define MPIN_OK             0   /**< Function completed without error */
+#define MPIN_INVALID_POINT  -14	/**< Point is NOT on the curve */
+#define MPIN_BAD_PIN        -19 /**< Bad PIN number entered */
+
+#define MAXPIN 10000         /**< max PIN */
+#define PBLEN 14             /**< max length of PIN in bits */
+
+//#define PAS_BN254CX 16        /**< MPIN Symmetric Key Size 128 bits */
+//#define HASH_TYPE_MPIN_BN254CX SHA256   /**< Choose Hash function */
+
+/* MPIN support functions */
+
+/* MPIN primitives */
+
+/**	@brief Encode a string to a curve point (in constant time)
+ *
+	@param DST is the Domain Separation Tag
+    @param ID is the input string
+    @param HID is the output point in G1
+*/
+void MPIN_ENCODE_TO_CURVE(octet *DST,octet *ID,octet *HID);
+
+/**	@brief Extract a PIN number from a client secret
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param pin is an input PIN number
+	@param CS is the client secret from which the PIN is to be extracted
+	@return 0 or an error code
+ */
+int MPIN_EXTRACT_PIN(octet *HID, int pin, octet *CS);
+
+/**	@brief Perform first pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param R is a pointer to a cryptographically secure random number generator
+	@param x an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param pin is the input PIN number
+	@param T is the input M-Pin token (the client secret with PIN portion removed)
+	@param S is the reconstructed client secret
+	@param U is output = x.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_1(octet *HID, csprng *R, octet *x, int pin, octet *T, octet *S, octet *U);
+/**	@brief Generate a random group element
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param S is the output random octet
+	@return 0 or an error code
+ */
+int MPIN_RANDOM_GENERATE(csprng *R, octet *S);
+/**	@brief Perform second pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param x an input, a locally generated random number
+	@param y an input random challenge from the server
+	@param V on output = -(x+y).V
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_2(octet *x, octet *y, octet *V);
+
+/**	@brief Perform final pass on the server side of the M-Pin protocol
+
+	@param HID is input H(ID), a hash of the client ID
+	@param y is the input server's randomly generated challenge
+	@param SS is the input server secret
+	@param U is input from the client = x.H(ID)
+	@param V is an input from the client
+	@return 0 or an error code
+ */
+int MPIN_SERVER(octet *HID, octet *y, octet *SS, octet *U, octet *V);
+
+/**	@brief Create a client secret in G1 from a master secret and the client ID
+ *
+	@param S is an input master secret
+	@param HID is the input client identity hashed to curve
+	@param CS is the full client secret = s.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_GET_CLIENT_SECRET(octet *S, octet *HID, octet *CS);
+
+/**	@brief Create a server secret in G2 from a master secret
+ *
+	@param S is an input master secret
+	@param SS is the server secret = s.Q where Q is a fixed generator of G2
+	@return 0 or an error code
+ */
+int MPIN_GET_SERVER_SECRET(octet *S, octet *SS);
+}
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/mpin_BN462.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/mpin_BN462.h
new file mode 100644
index 0000000..ab8d15a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/mpin_BN462.h
@@ -0,0 +1,136 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file mpin.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief M-Pin Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef MPIN_BN462_H
+#define MPIN_BN462_H
+
+#include "pair_BN462.h"
+//#include "pbc_support.h"
+
+using namespace core;
+
+
+namespace BN462 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define PGS_BN462 MODBYTES_B464_28  /**< MPIN Group Size */
+#define PFS_BN462 MODBYTES_B464_28  /**< MPIN Field Size */
+
+#define MPIN_OK             0   /**< Function completed without error */
+#define MPIN_INVALID_POINT  -14	/**< Point is NOT on the curve */
+#define MPIN_BAD_PIN        -19 /**< Bad PIN number entered */
+
+#define MAXPIN 10000         /**< max PIN */
+#define PBLEN 14             /**< max length of PIN in bits */
+
+//#define PAS_BN462 16        /**< MPIN Symmetric Key Size 128 bits */
+//#define HASH_TYPE_MPIN_BN462 SHA256   /**< Choose Hash function */
+
+/* MPIN support functions */
+
+/* MPIN primitives */
+
+/**	@brief Encode a string to a curve point (in constant time)
+ *
+	@param DST is the Domain Separation Tag
+    @param ID is the input string
+    @param HID is the output point in G1
+*/
+void MPIN_ENCODE_TO_CURVE(octet *DST,octet *ID,octet *HID);
+
+/**	@brief Extract a PIN number from a client secret
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param pin is an input PIN number
+	@param CS is the client secret from which the PIN is to be extracted
+	@return 0 or an error code
+ */
+int MPIN_EXTRACT_PIN(octet *HID, int pin, octet *CS);
+
+/**	@brief Perform first pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param R is a pointer to a cryptographically secure random number generator
+	@param x an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param pin is the input PIN number
+	@param T is the input M-Pin token (the client secret with PIN portion removed)
+	@param S is the reconstructed client secret
+	@param U is output = x.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_1(octet *HID, csprng *R, octet *x, int pin, octet *T, octet *S, octet *U);
+/**	@brief Generate a random group element
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param S is the output random octet
+	@return 0 or an error code
+ */
+int MPIN_RANDOM_GENERATE(csprng *R, octet *S);
+/**	@brief Perform second pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param x an input, a locally generated random number
+	@param y an input random challenge from the server
+	@param V on output = -(x+y).V
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_2(octet *x, octet *y, octet *V);
+
+/**	@brief Perform final pass on the server side of the M-Pin protocol
+
+	@param HID is input H(ID), a hash of the client ID
+	@param y is the input server's randomly generated challenge
+	@param SS is the input server secret
+	@param U is input from the client = x.H(ID)
+	@param V is an input from the client
+	@return 0 or an error code
+ */
+int MPIN_SERVER(octet *HID, octet *y, octet *SS, octet *U, octet *V);
+
+/**	@brief Create a client secret in G1 from a master secret and the client ID
+ *
+	@param S is an input master secret
+	@param HID is the input client identity hashed to curve
+	@param CS is the full client secret = s.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_GET_CLIENT_SECRET(octet *S, octet *HID, octet *CS);
+
+/**	@brief Create a server secret in G2 from a master secret
+ *
+	@param S is an input master secret
+	@param SS is the server secret = s.Q where Q is a fixed generator of G2
+	@return 0 or an error code
+ */
+int MPIN_GET_SERVER_SECRET(octet *S, octet *SS);
+}
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/mpin_FP256BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/mpin_FP256BN.h
new file mode 100644
index 0000000..d831d35
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/mpin_FP256BN.h
@@ -0,0 +1,136 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file mpin.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief M-Pin Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef MPIN_FP256BN_H
+#define MPIN_FP256BN_H
+
+#include "pair_FP256BN.h"
+//#include "pbc_support.h"
+
+using namespace core;
+
+
+namespace FP256BN {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define PGS_FP256BN MODBYTES_B256_28  /**< MPIN Group Size */
+#define PFS_FP256BN MODBYTES_B256_28  /**< MPIN Field Size */
+
+#define MPIN_OK             0   /**< Function completed without error */
+#define MPIN_INVALID_POINT  -14	/**< Point is NOT on the curve */
+#define MPIN_BAD_PIN        -19 /**< Bad PIN number entered */
+
+#define MAXPIN 10000         /**< max PIN */
+#define PBLEN 14             /**< max length of PIN in bits */
+
+//#define PAS_FP256BN 16        /**< MPIN Symmetric Key Size 128 bits */
+//#define HASH_TYPE_MPIN_FP256BN SHA256   /**< Choose Hash function */
+
+/* MPIN support functions */
+
+/* MPIN primitives */
+
+/**	@brief Encode a string to a curve point (in constant time)
+ *
+	@param DST is the Domain Separation Tag
+    @param ID is the input string
+    @param HID is the output point in G1
+*/
+void MPIN_ENCODE_TO_CURVE(octet *DST,octet *ID,octet *HID);
+
+/**	@brief Extract a PIN number from a client secret
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param pin is an input PIN number
+	@param CS is the client secret from which the PIN is to be extracted
+	@return 0 or an error code
+ */
+int MPIN_EXTRACT_PIN(octet *HID, int pin, octet *CS);
+
+/**	@brief Perform first pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param R is a pointer to a cryptographically secure random number generator
+	@param x an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param pin is the input PIN number
+	@param T is the input M-Pin token (the client secret with PIN portion removed)
+	@param S is the reconstructed client secret
+	@param U is output = x.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_1(octet *HID, csprng *R, octet *x, int pin, octet *T, octet *S, octet *U);
+/**	@brief Generate a random group element
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param S is the output random octet
+	@return 0 or an error code
+ */
+int MPIN_RANDOM_GENERATE(csprng *R, octet *S);
+/**	@brief Perform second pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param x an input, a locally generated random number
+	@param y an input random challenge from the server
+	@param V on output = -(x+y).V
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_2(octet *x, octet *y, octet *V);
+
+/**	@brief Perform final pass on the server side of the M-Pin protocol
+
+	@param HID is input H(ID), a hash of the client ID
+	@param y is the input server's randomly generated challenge
+	@param SS is the input server secret
+	@param U is input from the client = x.H(ID)
+	@param V is an input from the client
+	@return 0 or an error code
+ */
+int MPIN_SERVER(octet *HID, octet *y, octet *SS, octet *U, octet *V);
+
+/**	@brief Create a client secret in G1 from a master secret and the client ID
+ *
+	@param S is an input master secret
+	@param HID is the input client identity hashed to curve
+	@param CS is the full client secret = s.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_GET_CLIENT_SECRET(octet *S, octet *HID, octet *CS);
+
+/**	@brief Create a server secret in G2 from a master secret
+ *
+	@param S is an input master secret
+	@param SS is the server secret = s.Q where Q is a fixed generator of G2
+	@return 0 or an error code
+ */
+int MPIN_GET_SERVER_SECRET(octet *S, octet *SS);
+}
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/mpin_FP512BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/mpin_FP512BN.h
new file mode 100644
index 0000000..9f79947
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/mpin_FP512BN.h
@@ -0,0 +1,136 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file mpin.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief M-Pin Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef MPIN_FP512BN_H
+#define MPIN_FP512BN_H
+
+#include "pair_FP512BN.h"
+//#include "pbc_support.h"
+
+using namespace core;
+
+
+namespace FP512BN {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define PGS_FP512BN MODBYTES_B512_29  /**< MPIN Group Size */
+#define PFS_FP512BN MODBYTES_B512_29  /**< MPIN Field Size */
+
+#define MPIN_OK             0   /**< Function completed without error */
+#define MPIN_INVALID_POINT  -14	/**< Point is NOT on the curve */
+#define MPIN_BAD_PIN        -19 /**< Bad PIN number entered */
+
+#define MAXPIN 10000         /**< max PIN */
+#define PBLEN 14             /**< max length of PIN in bits */
+
+//#define PAS_FP512BN 16        /**< MPIN Symmetric Key Size 128 bits */
+//#define HASH_TYPE_MPIN_FP512BN SHA256   /**< Choose Hash function */
+
+/* MPIN support functions */
+
+/* MPIN primitives */
+
+/**	@brief Encode a string to a curve point (in constant time)
+ *
+	@param DST is the Domain Separation Tag
+    @param ID is the input string
+    @param HID is the output point in G1
+*/
+void MPIN_ENCODE_TO_CURVE(octet *DST,octet *ID,octet *HID);
+
+/**	@brief Extract a PIN number from a client secret
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param pin is an input PIN number
+	@param CS is the client secret from which the PIN is to be extracted
+	@return 0 or an error code
+ */
+int MPIN_EXTRACT_PIN(octet *HID, int pin, octet *CS);
+
+/**	@brief Perform first pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param R is a pointer to a cryptographically secure random number generator
+	@param x an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param pin is the input PIN number
+	@param T is the input M-Pin token (the client secret with PIN portion removed)
+	@param S is the reconstructed client secret
+	@param U is output = x.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_1(octet *HID, csprng *R, octet *x, int pin, octet *T, octet *S, octet *U);
+/**	@brief Generate a random group element
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param S is the output random octet
+	@return 0 or an error code
+ */
+int MPIN_RANDOM_GENERATE(csprng *R, octet *S);
+/**	@brief Perform second pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param x an input, a locally generated random number
+	@param y an input random challenge from the server
+	@param V on output = -(x+y).V
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_2(octet *x, octet *y, octet *V);
+
+/**	@brief Perform final pass on the server side of the M-Pin protocol
+
+	@param HID is input H(ID), a hash of the client ID
+	@param y is the input server's randomly generated challenge
+	@param SS is the input server secret
+	@param U is input from the client = x.H(ID)
+	@param V is an input from the client
+	@return 0 or an error code
+ */
+int MPIN_SERVER(octet *HID, octet *y, octet *SS, octet *U, octet *V);
+
+/**	@brief Create a client secret in G1 from a master secret and the client ID
+ *
+	@param S is an input master secret
+	@param HID is the input client identity hashed to curve
+	@param CS is the full client secret = s.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_GET_CLIENT_SECRET(octet *S, octet *HID, octet *CS);
+
+/**	@brief Create a server secret in G2 from a master secret
+ *
+	@param S is an input master secret
+	@param SS is the server secret = s.Q where Q is a fixed generator of G2
+	@return 0 or an error code
+ */
+int MPIN_GET_SERVER_SECRET(octet *S, octet *SS);
+}
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/newhope.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/newhope.h
new file mode 100644
index 0000000..d7d6ee1
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/newhope.h
@@ -0,0 +1,64 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* NewHope Simple API */
+
+#ifndef NHS_H
+#define NHS_H
+
+#include "core.h"
+
+/* NewHope parameters */
+
+//q= 12289
+
+#define RLWE_PRIME 0x3001	// q in Hex
+#define RLWE_LGN 10			// Degree n=2^LGN
+#define RLWE_ND 0xF7002FFF	// 1/(R-q) mod R
+#define RLWE_ONE 0x2AC8		// R mod q
+#define RLWE_R2MODP 0x1620	// R^2 mod q
+
+namespace core {
+/** @brief NHS server first pass
+ *
+    @param RNG Random Number Generator handle
+    @param SB seed and polynomial B concatenated - output
+    @param S server secret - output
+
+ */
+extern void NHS_SERVER_1(csprng *RNG, octet *SB, octet *S);
+/** @brief NHS client pass
+ *
+    @param RNG Random Number Generator handle
+    @param SB seed and polynomial B concatenated - input
+    @param UC polynomial U and compressed polynomial c - output
+    @param KEY client key
+ */
+extern void NHS_CLIENT(csprng *RNG, octet *SB, octet *UC, octet *KEY);
+/** @brief NHS server second pass
+ *
+    @param S server secret - input
+    @param UC polynomial U and compressed polynomial c - input
+    @param KEY server key
+ */
+extern void NHS_SERVER_2(octet *S, octet *UC, octet *KEY);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/pair4_BLS24479.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/pair4_BLS24479.h
new file mode 100644
index 0000000..315164d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/pair4_BLS24479.h
@@ -0,0 +1,180 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef PAIR4_BLS24479_H
+#define PAIR4_BLS24479_H
+
+#include "fp24_BLS24479.h"
+#include "ecp4_BLS24479.h"
+#include "ecp_BLS24479.h"
+
+using namespace core;
+
+namespace BLS24479 {
+/* Pairing constants */
+
+extern const B480_29::BIG CURVE_Bnx; /**< BN curve x parameter */
+extern const B480_29::BIG CURVE_Cru; /**< BN curve Cube Root of Unity */
+
+extern const B480_29::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B480_29::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B480_29::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B480_29::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+/* Pairing function prototypes */
+
+/**	@brief Precompute line functions details for fixed G2 value
+ *
+	@param T array of precomputed FP8 partial line functions
+	@param GV a fixed ECP4 instance
+ */
+extern void PAIR_precomp(BLS24479::FP8 T[], ECP4* GV);
+
+
+/**	@brief Calculate Miller loop for Optimal ATE pairing e(P,Q)
+ *
+	@param r FP24 result of the pairing calculation e(P,Q)
+	@param P ECP4 instance, an element of G2
+	@param Q ECP instance, an element of G1
+
+ */
+extern void PAIR_ate(BLS24479::FP24 *r, ECP4 *P, ECP *Q);
+/**	@brief Calculate Miller loop for Optimal ATE double-pairing e(P,Q).e(R,S)
+ *
+	Faster than calculating two separate pairings
+	@param r FP24 result of the pairing calculation e(P,Q).e(R,S), an element of GT
+	@param P ECP4 instance, an element of G2
+	@param Q ECP instance, an element of G1
+	@param R ECP4 instance, an element of G2
+	@param S ECP instance, an element of G1
+ */
+extern void PAIR_double_ate(BLS24479::FP24 *r, ECP4 *P, ECP *Q, ECP4 *R, ECP *S);
+/**	@brief Final exponentiation of pairing, converts output of Miller loop to element in GT
+ *
+	Here p is the internal modulus, and r is the group order
+	@param x FP24, on exit = x^((p^12-1)/r)
+ */
+extern void PAIR_fexp(BLS24479::FP24 *x);
+/**	@brief Fast point multiplication of a member of the group G1 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param Q ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G1mul(ECP *Q, B480_29::BIG b);
+/**	@brief Fast point multiplication of a member of the group G2 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param P ECP4 member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G2mul(ECP4 *P, B480_29::BIG b);
+/**	@brief Fast raising of a member of GT to a BIG power
+ *
+	May exploit endomorphism for speed.
+	@param x FP24 member of GT.
+	@param b BIG exponent
+
+ */
+extern void PAIR_GTpow(BLS24479::FP24 *x, B480_29::BIG b);
+
+/**	@brief Tests ECP for membership of G1
+ *
+	@param P ECP member of G1
+	@return true or false
+
+ */
+extern int PAIR_G1member(BLS24479::ECP *P);
+
+/**	@brief Tests ECP4 for membership of G2
+ *
+	@param P ECP4 member of G2
+	@return true or false
+
+ */
+extern int PAIR_G2member(BLS24479::ECP4 *P);
+
+
+/**	@brief Tests FP24 for membership of cyclotomic subgroup
+ *
+	@param x FP24 instance
+	@return 1 if x is cyclotomic, else return 0
+
+ */
+extern int PAIR_GTcyclotomic(BLS24479::FP24 *x);
+
+
+/**	@brief Tests FP24 for full membership of GT
+ *
+	@param x FP24 instance
+	@return 1 if x is in GT, else return 0
+
+ */
+extern int PAIR_GTmember(BLS24479::FP24 *x);
+
+
+/**	@brief Precompute line functions for n-pairing
+ *
+	@param r array of precomputed FP24 products of line functions
+	@param PV ECP4 instance, an element of G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another(BLS24479::FP24 r[], ECP4* PV, ECP* QV);
+
+/**	@brief Compute line functions for n-pairing, assuming precomputation on G2
+ *
+	@param r array of precomputed FP24 products of line functions
+	@param T array contains precomputed partial line fucntions from G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another_pc(BLS24479::FP24 r[], BLS24479::FP8 T[], ECP *QV);
+
+
+/**	@brief Prepare Ate parameter
+ *
+	@param n BIG parameter
+	@param n3 BIG paramter = 3*n
+	@return number of nits in n3
+
+ */
+extern int PAIR_nbits(B480_29::BIG n3, B480_29::BIG n);
+
+/**	@brief Initialise structure for multi-pairing
+ *
+	@param r FP24 array, to be initialised to 1
+
+ */
+extern void PAIR_initmp(BLS24479::FP24 r[]);
+
+
+/**	@brief Miller loop
+ *
+ 	@param res FP24 result
+	@param r FP24 precomputed array of accumulated line functions
+
+ */
+extern void PAIR_miller(BLS24479::FP24 *res, BLS24479::FP24 r[]);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/pair8_BLS48286.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/pair8_BLS48286.h
new file mode 100644
index 0000000..384f6c9
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/pair8_BLS48286.h
@@ -0,0 +1,179 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef PAIR8_BLS48286_H
+#define PAIR8_BLS48286_H
+
+#include "fp48_BLS48286.h"
+#include "ecp8_BLS48286.h"
+#include "ecp_BLS48286.h"
+
+using namespace core;
+
+namespace BLS48286 {
+/* Pairing constants */
+
+extern const B288_29::BIG CURVE_Bnx; /**< BN curve x parameter */
+extern const B288_29::BIG CURVE_Cru; /**< BN curve Cube Root of Unity */
+
+extern const B288_29::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B288_29::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B288_29::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B288_29::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+/* Pairing function prototypes */
+
+/**	@brief Precompute line functions details for fixed G2 value
+ *
+	@param T array of precomputed FP16 partial line functions
+	@param GV a fixed ECP8 instance
+ */
+extern void PAIR_precomp(BLS48286::FP16 T[], ECP8* GV);
+
+
+/**	@brief Calculate Miller loop for Optimal ATE pairing e(P,Q)
+ *
+	@param r FP48 result of the pairing calculation e(P,Q)
+	@param P ECP8 instance, an element of G2
+	@param Q ECP instance, an element of G1
+
+ */
+extern void PAIR_ate(BLS48286::FP48 *r, ECP8 *P, ECP *Q);
+/**	@brief Calculate Miller loop for Optimal ATE double-pairing e(P,Q).e(R,S)
+ *
+	Faster than calculating two separate pairings
+	@param r FP48 result of the pairing calculation e(P,Q).e(R,S), an element of GT
+	@param P ECP8 instance, an element of G2
+	@param Q ECP instance, an element of G1
+	@param R ECP8 instance, an element of G2
+	@param S ECP instance, an element of G1
+ */
+extern void PAIR_double_ate(BLS48286::FP48 *r, ECP8 *P, ECP *Q, ECP8 *R, ECP *S);
+/**	@brief Final exponentiation of pairing, converts output of Miller loop to element in GT
+ *
+	Here p is the internal modulus, and r is the group order
+	@param x FP48, on exit = x^((p^12-1)/r)
+ */
+extern void PAIR_fexp(BLS48286::FP48 *x);
+/**	@brief Fast point multiplication of a member of the group G1 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param Q ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G1mul(ECP *Q, B288_29::BIG b);
+/**	@brief Fast point multiplication of a member of the group G2 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param P ECP8 member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G2mul(ECP8 *P, B288_29::BIG b);
+/**	@brief Fast raising of a member of GT to a BIG power
+ *
+	May exploit endomorphism for speed.
+	@param x FP48 member of GT.
+	@param b BIG exponent
+
+ */
+extern void PAIR_GTpow(BLS48286::FP48 *x, B288_29::BIG b);
+
+/**	@brief Tests ECP for membership of G1
+ *
+	@param P ECP member of G1
+	@return true or false
+
+ */
+extern int PAIR_G1member(BLS48286::ECP *P);
+
+/**	@brief Tests ECP8 for membership of G2
+ *
+	@param P ECP8 member of G2
+	@return true or false
+
+ */
+extern int PAIR_G2member(BLS48286::ECP8 *P);
+
+/**	@brief Tests FP48 for membership of cyclotomic subgroup
+ *
+	@param x FP48 instance
+	@return 1 if x is cyclotomic, else return 0
+
+ */
+extern int PAIR_GTcyclotomic(BLS48286::FP48 *x);
+
+/**	@brief Tests FP48 for full membership of GT
+ *
+	@param x FP48 instance
+	@return 1 if x is in GT, else return 0
+
+ */
+extern int PAIR_GTmember(BLS48286::FP48 *x);
+
+/**	@brief Precompute line functions for n-pairing
+ *
+	@param r array of precomputed FP48 products of line functions
+	@param PV ECP8 instance, an element of G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another(BLS48286::FP48 r[], ECP8* PV, ECP* QV);
+
+
+/**	@brief Compute line functions for n-pairing, assuming precomputation on G2
+ *
+	@param r array of precomputed FP48 products of line functions
+	@param T array contains precomputed partial line fucntions from G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another_pc(BLS48286::FP48 r[], BLS48286::FP16 T[], ECP *QV);
+
+
+
+/**	@brief Prepare Ate parameter
+ *
+	@param n BIG parameter
+	@param n3 BIG paramter = 3*n
+	@return number of nits in n3
+
+ */
+extern int PAIR_nbits(B288_29::BIG n3, B288_29::BIG n);
+
+/**	@brief Initialise structure for multi-pairing
+ *
+	@param r FP48 array, to be initialised to 1
+
+ */
+extern void PAIR_initmp(BLS48286::FP48 r[]);
+
+
+/**	@brief Miller loop
+ *
+ 	@param res FP48 result
+	@param r FP48 precomputed array of accumulated line functions
+
+ */
+extern void PAIR_miller(BLS48286::FP48 *res, BLS48286::FP48 r[]);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/pair8_BLS48556.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/pair8_BLS48556.h
new file mode 100644
index 0000000..74c7b3c
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/pair8_BLS48556.h
@@ -0,0 +1,179 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef PAIR8_BLS48556_H
+#define PAIR8_BLS48556_H
+
+#include "fp48_BLS48556.h"
+#include "ecp8_BLS48556.h"
+#include "ecp_BLS48556.h"
+
+using namespace core;
+
+namespace BLS48556 {
+/* Pairing constants */
+
+extern const B560_29::BIG CURVE_Bnx; /**< BN curve x parameter */
+extern const B560_29::BIG CURVE_Cru; /**< BN curve Cube Root of Unity */
+
+extern const B560_29::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B560_29::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B560_29::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B560_29::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+/* Pairing function prototypes */
+
+/**	@brief Precompute line functions details for fixed G2 value
+ *
+	@param T array of precomputed FP16 partial line functions
+	@param GV a fixed ECP8 instance
+ */
+extern void PAIR_precomp(BLS48556::FP16 T[], ECP8* GV);
+
+
+/**	@brief Calculate Miller loop for Optimal ATE pairing e(P,Q)
+ *
+	@param r FP48 result of the pairing calculation e(P,Q)
+	@param P ECP8 instance, an element of G2
+	@param Q ECP instance, an element of G1
+
+ */
+extern void PAIR_ate(BLS48556::FP48 *r, ECP8 *P, ECP *Q);
+/**	@brief Calculate Miller loop for Optimal ATE double-pairing e(P,Q).e(R,S)
+ *
+	Faster than calculating two separate pairings
+	@param r FP48 result of the pairing calculation e(P,Q).e(R,S), an element of GT
+	@param P ECP8 instance, an element of G2
+	@param Q ECP instance, an element of G1
+	@param R ECP8 instance, an element of G2
+	@param S ECP instance, an element of G1
+ */
+extern void PAIR_double_ate(BLS48556::FP48 *r, ECP8 *P, ECP *Q, ECP8 *R, ECP *S);
+/**	@brief Final exponentiation of pairing, converts output of Miller loop to element in GT
+ *
+	Here p is the internal modulus, and r is the group order
+	@param x FP48, on exit = x^((p^12-1)/r)
+ */
+extern void PAIR_fexp(BLS48556::FP48 *x);
+/**	@brief Fast point multiplication of a member of the group G1 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param Q ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G1mul(ECP *Q, B560_29::BIG b);
+/**	@brief Fast point multiplication of a member of the group G2 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param P ECP8 member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G2mul(ECP8 *P, B560_29::BIG b);
+/**	@brief Fast raising of a member of GT to a BIG power
+ *
+	May exploit endomorphism for speed.
+	@param x FP48 member of GT.
+	@param b BIG exponent
+
+ */
+extern void PAIR_GTpow(BLS48556::FP48 *x, B560_29::BIG b);
+
+/**	@brief Tests ECP for membership of G1
+ *
+	@param P ECP member of G1
+	@return true or false
+
+ */
+extern int PAIR_G1member(BLS48556::ECP *P);
+
+/**	@brief Tests ECP8 for membership of G2
+ *
+	@param P ECP8 member of G2
+	@return true or false
+
+ */
+extern int PAIR_G2member(BLS48556::ECP8 *P);
+
+/**	@brief Tests FP48 for membership of cyclotomic subgroup
+ *
+	@param x FP48 instance
+	@return 1 if x is cyclotomic, else return 0
+
+ */
+extern int PAIR_GTcyclotomic(BLS48556::FP48 *x);
+
+/**	@brief Tests FP48 for full membership of GT
+ *
+	@param x FP48 instance
+	@return 1 if x is in GT, else return 0
+
+ */
+extern int PAIR_GTmember(BLS48556::FP48 *x);
+
+/**	@brief Precompute line functions for n-pairing
+ *
+	@param r array of precomputed FP48 products of line functions
+	@param PV ECP8 instance, an element of G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another(BLS48556::FP48 r[], ECP8* PV, ECP* QV);
+
+
+/**	@brief Compute line functions for n-pairing, assuming precomputation on G2
+ *
+	@param r array of precomputed FP48 products of line functions
+	@param T array contains precomputed partial line fucntions from G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another_pc(BLS48556::FP48 r[], BLS48556::FP16 T[], ECP *QV);
+
+
+
+/**	@brief Prepare Ate parameter
+ *
+	@param n BIG parameter
+	@param n3 BIG paramter = 3*n
+	@return number of nits in n3
+
+ */
+extern int PAIR_nbits(B560_29::BIG n3, B560_29::BIG n);
+
+/**	@brief Initialise structure for multi-pairing
+ *
+	@param r FP48 array, to be initialised to 1
+
+ */
+extern void PAIR_initmp(BLS48556::FP48 r[]);
+
+
+/**	@brief Miller loop
+ *
+ 	@param res FP48 result
+	@param r FP48 precomputed array of accumulated line functions
+
+ */
+extern void PAIR_miller(BLS48556::FP48 *res, BLS48556::FP48 r[]);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/pair8_BLS48581.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/pair8_BLS48581.h
new file mode 100644
index 0000000..16f164d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/pair8_BLS48581.h
@@ -0,0 +1,179 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef PAIR8_BLS48581_H
+#define PAIR8_BLS48581_H
+
+#include "fp48_BLS48581.h"
+#include "ecp8_BLS48581.h"
+#include "ecp_BLS48581.h"
+
+using namespace core;
+
+namespace BLS48581 {
+/* Pairing constants */
+
+extern const B584_29::BIG CURVE_Bnx; /**< BN curve x parameter */
+extern const B584_29::BIG CURVE_Cru; /**< BN curve Cube Root of Unity */
+
+extern const B584_29::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B584_29::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B584_29::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B584_29::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+/* Pairing function prototypes */
+
+/**	@brief Precompute line functions details for fixed G2 value
+ *
+	@param T array of precomputed FP16 partial line functions
+	@param GV a fixed ECP8 instance
+ */
+extern void PAIR_precomp(BLS48581::FP16 T[], ECP8* GV);
+
+
+/**	@brief Calculate Miller loop for Optimal ATE pairing e(P,Q)
+ *
+	@param r FP48 result of the pairing calculation e(P,Q)
+	@param P ECP8 instance, an element of G2
+	@param Q ECP instance, an element of G1
+
+ */
+extern void PAIR_ate(BLS48581::FP48 *r, ECP8 *P, ECP *Q);
+/**	@brief Calculate Miller loop for Optimal ATE double-pairing e(P,Q).e(R,S)
+ *
+	Faster than calculating two separate pairings
+	@param r FP48 result of the pairing calculation e(P,Q).e(R,S), an element of GT
+	@param P ECP8 instance, an element of G2
+	@param Q ECP instance, an element of G1
+	@param R ECP8 instance, an element of G2
+	@param S ECP instance, an element of G1
+ */
+extern void PAIR_double_ate(BLS48581::FP48 *r, ECP8 *P, ECP *Q, ECP8 *R, ECP *S);
+/**	@brief Final exponentiation of pairing, converts output of Miller loop to element in GT
+ *
+	Here p is the internal modulus, and r is the group order
+	@param x FP48, on exit = x^((p^12-1)/r)
+ */
+extern void PAIR_fexp(BLS48581::FP48 *x);
+/**	@brief Fast point multiplication of a member of the group G1 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param Q ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G1mul(ECP *Q, B584_29::BIG b);
+/**	@brief Fast point multiplication of a member of the group G2 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param P ECP8 member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G2mul(ECP8 *P, B584_29::BIG b);
+/**	@brief Fast raising of a member of GT to a BIG power
+ *
+	May exploit endomorphism for speed.
+	@param x FP48 member of GT.
+	@param b BIG exponent
+
+ */
+extern void PAIR_GTpow(BLS48581::FP48 *x, B584_29::BIG b);
+
+/**	@brief Tests ECP for membership of G1
+ *
+	@param P ECP member of G1
+	@return true or false
+
+ */
+extern int PAIR_G1member(BLS48581::ECP *P);
+
+/**	@brief Tests ECP8 for membership of G2
+ *
+	@param P ECP8 member of G2
+	@return true or false
+
+ */
+extern int PAIR_G2member(BLS48581::ECP8 *P);
+
+/**	@brief Tests FP48 for membership of cyclotomic subgroup
+ *
+	@param x FP48 instance
+	@return 1 if x is cyclotomic, else return 0
+
+ */
+extern int PAIR_GTcyclotomic(BLS48581::FP48 *x);
+
+/**	@brief Tests FP48 for full membership of GT
+ *
+	@param x FP48 instance
+	@return 1 if x is in GT, else return 0
+
+ */
+extern int PAIR_GTmember(BLS48581::FP48 *x);
+
+/**	@brief Precompute line functions for n-pairing
+ *
+	@param r array of precomputed FP48 products of line functions
+	@param PV ECP8 instance, an element of G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another(BLS48581::FP48 r[], ECP8* PV, ECP* QV);
+
+
+/**	@brief Compute line functions for n-pairing, assuming precomputation on G2
+ *
+	@param r array of precomputed FP48 products of line functions
+	@param T array contains precomputed partial line fucntions from G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another_pc(BLS48581::FP48 r[], BLS48581::FP16 T[], ECP *QV);
+
+
+
+/**	@brief Prepare Ate parameter
+ *
+	@param n BIG parameter
+	@param n3 BIG paramter = 3*n
+	@return number of nits in n3
+
+ */
+extern int PAIR_nbits(B584_29::BIG n3, B584_29::BIG n);
+
+/**	@brief Initialise structure for multi-pairing
+ *
+	@param r FP48 array, to be initialised to 1
+
+ */
+extern void PAIR_initmp(BLS48581::FP48 r[]);
+
+
+/**	@brief Miller loop
+ *
+ 	@param res FP48 result
+	@param r FP48 precomputed array of accumulated line functions
+
+ */
+extern void PAIR_miller(BLS48581::FP48 *res, BLS48581::FP48 r[]);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/pair_BLS12381.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/pair_BLS12381.h
new file mode 100644
index 0000000..eb237f3
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/pair_BLS12381.h
@@ -0,0 +1,183 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef PAIR_BLS12381_H
+#define PAIR_BLS12381_H
+
+#include "fp12_BLS12381.h"
+#include "ecp2_BLS12381.h"
+#include "ecp_BLS12381.h"
+
+using namespace core;
+
+namespace BLS12381 {
+/* Pairing constants */
+
+extern const B384_29::BIG CURVE_Bnx; /**< BN curve x parameter */
+extern const B384_29::BIG CURVE_Cru; /**< BN curve Cube Root of Unity */
+
+extern const B384_29::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B384_29::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B384_29::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B384_29::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+/* Pairing function prototypes */
+
+
+/**	@brief Precompute line functions details for fixed G2 value
+ *
+	@param T array of precomputed FP4 partial line functions
+	@param GV a fixed ECP2 instance
+ */
+extern void PAIR_precomp(BLS12381::FP4 T[], ECP2* GV);
+
+/**	@brief Compute line functions for n-pairing
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param PV ECP2 instance, an element of G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another(BLS12381::FP12 r[], ECP2* PV, ECP* QV);
+
+
+/**	@brief Compute line functions for n-pairing, assuming precomputation on G2
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param T array contains precomputed partial line fucntions from G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another_pc(BLS12381::FP12 r[], BLS12381::FP4 T[], ECP *QV);
+
+
+
+/**	@brief Calculate Miller loop for Optimal ATE pairing e(P,Q)
+ *
+	@param r FP12 result of the pairing calculation e(P,Q)
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+
+ */
+extern void PAIR_ate(BLS12381::FP12 *r, ECP2 *P, ECP *Q);
+/**	@brief Calculate Miller loop for Optimal ATE double-pairing e(P,Q).e(R,S)
+ *
+	Faster than calculating two separate pairings
+	@param r FP12 result of the pairing calculation e(P,Q).e(R,S), an element of GT
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+	@param R ECP2 instance, an element of G2
+	@param S ECP instance, an element of G1
+ */
+extern void PAIR_double_ate(BLS12381::FP12 *r, ECP2 *P, ECP *Q, ECP2 *R, ECP *S);
+/**	@brief Final exponentiation of pairing, converts output of Miller loop to element in GT
+ *
+	Here p is the internal modulus, and r is the group order
+	@param x FP12, on exit = x^((p^12-1)/r)
+ */
+extern void PAIR_fexp(BLS12381::FP12 *x);
+/**	@brief Fast point multiplication of a member of the group G1 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param Q ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G1mul(ECP *Q, B384_29::BIG b);
+/**	@brief Fast point multiplication of a member of the group G2 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param P ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G2mul(ECP2 *P, B384_29::BIG b);
+
+
+
+/**	@brief Fast raising of a member of GT to a BIG power
+ *
+	May exploit endomorphism for speed.
+	@param x FP12 member of GT.
+	@param b BIG exponent
+
+ */
+extern void PAIR_GTpow(BLS12381::FP12 *x, B384_29::BIG b);
+
+
+/**	@brief Tests ECP for membership of G1
+ *
+	@param P ECP member of G1
+	@return true or false
+
+ */
+extern int PAIR_G1member(BLS12381::ECP *P);
+
+/**	@brief Tests ECP2 for membership of G2
+ *
+	@param P ECP2 member of G2
+	@return true or false
+
+ */
+extern int PAIR_G2member(BLS12381::ECP2 *P);
+
+/**	@brief Tests FP12 for membership of cyclotomic sub-group
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTcyclotomic(BLS12381::FP12 *x);
+
+/**	@brief Tests FP12 for membership of GT
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTmember(BLS12381::FP12 *x);
+
+/**	@brief Prepare Ate parameter
+ *
+	@param n BIG parameter
+	@param n3 BIG paramter = 3*n
+	@return number of nits in n3
+
+ */
+extern int PAIR_nbits(B384_29::BIG n3, B384_29::BIG n);
+
+/**	@brief Initialise structure for multi-pairing
+ *
+	@param r FP12 array, to be initialised to 1
+
+ */
+extern void PAIR_initmp(BLS12381::FP12 r[]);
+
+
+/**	@brief Miller loop
+ *
+ 	@param res FP12 result
+	@param r FP12 precomputed array of accumulated line functions
+
+ */
+extern void PAIR_miller(BLS12381::FP12 *res, BLS12381::FP12 r[]);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/pair_BLS12383.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/pair_BLS12383.h
new file mode 100644
index 0000000..b5a061c
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/pair_BLS12383.h
@@ -0,0 +1,183 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef PAIR_BLS12383_H
+#define PAIR_BLS12383_H
+
+#include "fp12_BLS12383.h"
+#include "ecp2_BLS12383.h"
+#include "ecp_BLS12383.h"
+
+using namespace core;
+
+namespace BLS12383 {
+/* Pairing constants */
+
+extern const B384_29::BIG CURVE_Bnx; /**< BN curve x parameter */
+extern const B384_29::BIG CURVE_Cru; /**< BN curve Cube Root of Unity */
+
+extern const B384_29::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B384_29::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B384_29::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B384_29::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+/* Pairing function prototypes */
+
+
+/**	@brief Precompute line functions details for fixed G2 value
+ *
+	@param T array of precomputed FP4 partial line functions
+	@param GV a fixed ECP2 instance
+ */
+extern void PAIR_precomp(BLS12383::FP4 T[], ECP2* GV);
+
+/**	@brief Compute line functions for n-pairing
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param PV ECP2 instance, an element of G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another(BLS12383::FP12 r[], ECP2* PV, ECP* QV);
+
+
+/**	@brief Compute line functions for n-pairing, assuming precomputation on G2
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param T array contains precomputed partial line fucntions from G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another_pc(BLS12383::FP12 r[], BLS12383::FP4 T[], ECP *QV);
+
+
+
+/**	@brief Calculate Miller loop for Optimal ATE pairing e(P,Q)
+ *
+	@param r FP12 result of the pairing calculation e(P,Q)
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+
+ */
+extern void PAIR_ate(BLS12383::FP12 *r, ECP2 *P, ECP *Q);
+/**	@brief Calculate Miller loop for Optimal ATE double-pairing e(P,Q).e(R,S)
+ *
+	Faster than calculating two separate pairings
+	@param r FP12 result of the pairing calculation e(P,Q).e(R,S), an element of GT
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+	@param R ECP2 instance, an element of G2
+	@param S ECP instance, an element of G1
+ */
+extern void PAIR_double_ate(BLS12383::FP12 *r, ECP2 *P, ECP *Q, ECP2 *R, ECP *S);
+/**	@brief Final exponentiation of pairing, converts output of Miller loop to element in GT
+ *
+	Here p is the internal modulus, and r is the group order
+	@param x FP12, on exit = x^((p^12-1)/r)
+ */
+extern void PAIR_fexp(BLS12383::FP12 *x);
+/**	@brief Fast point multiplication of a member of the group G1 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param Q ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G1mul(ECP *Q, B384_29::BIG b);
+/**	@brief Fast point multiplication of a member of the group G2 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param P ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G2mul(ECP2 *P, B384_29::BIG b);
+
+
+
+/**	@brief Fast raising of a member of GT to a BIG power
+ *
+	May exploit endomorphism for speed.
+	@param x FP12 member of GT.
+	@param b BIG exponent
+
+ */
+extern void PAIR_GTpow(BLS12383::FP12 *x, B384_29::BIG b);
+
+
+/**	@brief Tests ECP for membership of G1
+ *
+	@param P ECP member of G1
+	@return true or false
+
+ */
+extern int PAIR_G1member(BLS12383::ECP *P);
+
+/**	@brief Tests ECP2 for membership of G2
+ *
+	@param P ECP2 member of G2
+	@return true or false
+
+ */
+extern int PAIR_G2member(BLS12383::ECP2 *P);
+
+/**	@brief Tests FP12 for membership of cyclotomic sub-group
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTcyclotomic(BLS12383::FP12 *x);
+
+/**	@brief Tests FP12 for membership of GT
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTmember(BLS12383::FP12 *x);
+
+/**	@brief Prepare Ate parameter
+ *
+	@param n BIG parameter
+	@param n3 BIG paramter = 3*n
+	@return number of nits in n3
+
+ */
+extern int PAIR_nbits(B384_29::BIG n3, B384_29::BIG n);
+
+/**	@brief Initialise structure for multi-pairing
+ *
+	@param r FP12 array, to be initialised to 1
+
+ */
+extern void PAIR_initmp(BLS12383::FP12 r[]);
+
+
+/**	@brief Miller loop
+ *
+ 	@param res FP12 result
+	@param r FP12 precomputed array of accumulated line functions
+
+ */
+extern void PAIR_miller(BLS12383::FP12 *res, BLS12383::FP12 r[]);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/pair_BLS12443.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/pair_BLS12443.h
new file mode 100644
index 0000000..22a1385
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/pair_BLS12443.h
@@ -0,0 +1,183 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef PAIR_BLS12443_H
+#define PAIR_BLS12443_H
+
+#include "fp12_BLS12443.h"
+#include "ecp2_BLS12443.h"
+#include "ecp_BLS12443.h"
+
+using namespace core;
+
+namespace BLS12443 {
+/* Pairing constants */
+
+extern const B448_29::BIG CURVE_Bnx; /**< BN curve x parameter */
+extern const B448_29::BIG CURVE_Cru; /**< BN curve Cube Root of Unity */
+
+extern const B448_29::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B448_29::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B448_29::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B448_29::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+/* Pairing function prototypes */
+
+
+/**	@brief Precompute line functions details for fixed G2 value
+ *
+	@param T array of precomputed FP4 partial line functions
+	@param GV a fixed ECP2 instance
+ */
+extern void PAIR_precomp(BLS12443::FP4 T[], ECP2* GV);
+
+/**	@brief Compute line functions for n-pairing
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param PV ECP2 instance, an element of G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another(BLS12443::FP12 r[], ECP2* PV, ECP* QV);
+
+
+/**	@brief Compute line functions for n-pairing, assuming precomputation on G2
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param T array contains precomputed partial line fucntions from G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another_pc(BLS12443::FP12 r[], BLS12443::FP4 T[], ECP *QV);
+
+
+
+/**	@brief Calculate Miller loop for Optimal ATE pairing e(P,Q)
+ *
+	@param r FP12 result of the pairing calculation e(P,Q)
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+
+ */
+extern void PAIR_ate(BLS12443::FP12 *r, ECP2 *P, ECP *Q);
+/**	@brief Calculate Miller loop for Optimal ATE double-pairing e(P,Q).e(R,S)
+ *
+	Faster than calculating two separate pairings
+	@param r FP12 result of the pairing calculation e(P,Q).e(R,S), an element of GT
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+	@param R ECP2 instance, an element of G2
+	@param S ECP instance, an element of G1
+ */
+extern void PAIR_double_ate(BLS12443::FP12 *r, ECP2 *P, ECP *Q, ECP2 *R, ECP *S);
+/**	@brief Final exponentiation of pairing, converts output of Miller loop to element in GT
+ *
+	Here p is the internal modulus, and r is the group order
+	@param x FP12, on exit = x^((p^12-1)/r)
+ */
+extern void PAIR_fexp(BLS12443::FP12 *x);
+/**	@brief Fast point multiplication of a member of the group G1 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param Q ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G1mul(ECP *Q, B448_29::BIG b);
+/**	@brief Fast point multiplication of a member of the group G2 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param P ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G2mul(ECP2 *P, B448_29::BIG b);
+
+
+
+/**	@brief Fast raising of a member of GT to a BIG power
+ *
+	May exploit endomorphism for speed.
+	@param x FP12 member of GT.
+	@param b BIG exponent
+
+ */
+extern void PAIR_GTpow(BLS12443::FP12 *x, B448_29::BIG b);
+
+
+/**	@brief Tests ECP for membership of G1
+ *
+	@param P ECP member of G1
+	@return true or false
+
+ */
+extern int PAIR_G1member(BLS12443::ECP *P);
+
+/**	@brief Tests ECP2 for membership of G2
+ *
+	@param P ECP2 member of G2
+	@return true or false
+
+ */
+extern int PAIR_G2member(BLS12443::ECP2 *P);
+
+/**	@brief Tests FP12 for membership of cyclotomic sub-group
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTcyclotomic(BLS12443::FP12 *x);
+
+/**	@brief Tests FP12 for membership of GT
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTmember(BLS12443::FP12 *x);
+
+/**	@brief Prepare Ate parameter
+ *
+	@param n BIG parameter
+	@param n3 BIG paramter = 3*n
+	@return number of nits in n3
+
+ */
+extern int PAIR_nbits(B448_29::BIG n3, B448_29::BIG n);
+
+/**	@brief Initialise structure for multi-pairing
+ *
+	@param r FP12 array, to be initialised to 1
+
+ */
+extern void PAIR_initmp(BLS12443::FP12 r[]);
+
+
+/**	@brief Miller loop
+ *
+ 	@param res FP12 result
+	@param r FP12 precomputed array of accumulated line functions
+
+ */
+extern void PAIR_miller(BLS12443::FP12 *res, BLS12443::FP12 r[]);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/pair_BLS12461.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/pair_BLS12461.h
new file mode 100644
index 0000000..7d43b11
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/pair_BLS12461.h
@@ -0,0 +1,183 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef PAIR_BLS12461_H
+#define PAIR_BLS12461_H
+
+#include "fp12_BLS12461.h"
+#include "ecp2_BLS12461.h"
+#include "ecp_BLS12461.h"
+
+using namespace core;
+
+namespace BLS12461 {
+/* Pairing constants */
+
+extern const B464_28::BIG CURVE_Bnx; /**< BN curve x parameter */
+extern const B464_28::BIG CURVE_Cru; /**< BN curve Cube Root of Unity */
+
+extern const B464_28::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B464_28::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B464_28::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B464_28::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+/* Pairing function prototypes */
+
+
+/**	@brief Precompute line functions details for fixed G2 value
+ *
+	@param T array of precomputed FP4 partial line functions
+	@param GV a fixed ECP2 instance
+ */
+extern void PAIR_precomp(BLS12461::FP4 T[], ECP2* GV);
+
+/**	@brief Compute line functions for n-pairing
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param PV ECP2 instance, an element of G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another(BLS12461::FP12 r[], ECP2* PV, ECP* QV);
+
+
+/**	@brief Compute line functions for n-pairing, assuming precomputation on G2
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param T array contains precomputed partial line fucntions from G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another_pc(BLS12461::FP12 r[], BLS12461::FP4 T[], ECP *QV);
+
+
+
+/**	@brief Calculate Miller loop for Optimal ATE pairing e(P,Q)
+ *
+	@param r FP12 result of the pairing calculation e(P,Q)
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+
+ */
+extern void PAIR_ate(BLS12461::FP12 *r, ECP2 *P, ECP *Q);
+/**	@brief Calculate Miller loop for Optimal ATE double-pairing e(P,Q).e(R,S)
+ *
+	Faster than calculating two separate pairings
+	@param r FP12 result of the pairing calculation e(P,Q).e(R,S), an element of GT
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+	@param R ECP2 instance, an element of G2
+	@param S ECP instance, an element of G1
+ */
+extern void PAIR_double_ate(BLS12461::FP12 *r, ECP2 *P, ECP *Q, ECP2 *R, ECP *S);
+/**	@brief Final exponentiation of pairing, converts output of Miller loop to element in GT
+ *
+	Here p is the internal modulus, and r is the group order
+	@param x FP12, on exit = x^((p^12-1)/r)
+ */
+extern void PAIR_fexp(BLS12461::FP12 *x);
+/**	@brief Fast point multiplication of a member of the group G1 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param Q ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G1mul(ECP *Q, B464_28::BIG b);
+/**	@brief Fast point multiplication of a member of the group G2 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param P ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G2mul(ECP2 *P, B464_28::BIG b);
+
+
+
+/**	@brief Fast raising of a member of GT to a BIG power
+ *
+	May exploit endomorphism for speed.
+	@param x FP12 member of GT.
+	@param b BIG exponent
+
+ */
+extern void PAIR_GTpow(BLS12461::FP12 *x, B464_28::BIG b);
+
+
+/**	@brief Tests ECP for membership of G1
+ *
+	@param P ECP member of G1
+	@return true or false
+
+ */
+extern int PAIR_G1member(BLS12461::ECP *P);
+
+/**	@brief Tests ECP2 for membership of G2
+ *
+	@param P ECP2 member of G2
+	@return true or false
+
+ */
+extern int PAIR_G2member(BLS12461::ECP2 *P);
+
+/**	@brief Tests FP12 for membership of cyclotomic sub-group
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTcyclotomic(BLS12461::FP12 *x);
+
+/**	@brief Tests FP12 for membership of GT
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTmember(BLS12461::FP12 *x);
+
+/**	@brief Prepare Ate parameter
+ *
+	@param n BIG parameter
+	@param n3 BIG paramter = 3*n
+	@return number of nits in n3
+
+ */
+extern int PAIR_nbits(B464_28::BIG n3, B464_28::BIG n);
+
+/**	@brief Initialise structure for multi-pairing
+ *
+	@param r FP12 array, to be initialised to 1
+
+ */
+extern void PAIR_initmp(BLS12461::FP12 r[]);
+
+
+/**	@brief Miller loop
+ *
+ 	@param res FP12 result
+	@param r FP12 precomputed array of accumulated line functions
+
+ */
+extern void PAIR_miller(BLS12461::FP12 *res, BLS12461::FP12 r[]);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/pair_BN158.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/pair_BN158.h
new file mode 100644
index 0000000..de7bcef
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/pair_BN158.h
@@ -0,0 +1,183 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef PAIR_BN158_H
+#define PAIR_BN158_H
+
+#include "fp12_BN158.h"
+#include "ecp2_BN158.h"
+#include "ecp_BN158.h"
+
+using namespace core;
+
+namespace BN158 {
+/* Pairing constants */
+
+extern const B160_28::BIG CURVE_Bnx; /**< BN curve x parameter */
+extern const B160_28::BIG CURVE_Cru; /**< BN curve Cube Root of Unity */
+
+extern const B160_28::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B160_28::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B160_28::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B160_28::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+/* Pairing function prototypes */
+
+
+/**	@brief Precompute line functions details for fixed G2 value
+ *
+	@param T array of precomputed FP4 partial line functions
+	@param GV a fixed ECP2 instance
+ */
+extern void PAIR_precomp(BN158::FP4 T[], ECP2* GV);
+
+/**	@brief Compute line functions for n-pairing
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param PV ECP2 instance, an element of G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another(BN158::FP12 r[], ECP2* PV, ECP* QV);
+
+
+/**	@brief Compute line functions for n-pairing, assuming precomputation on G2
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param T array contains precomputed partial line fucntions from G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another_pc(BN158::FP12 r[], BN158::FP4 T[], ECP *QV);
+
+
+
+/**	@brief Calculate Miller loop for Optimal ATE pairing e(P,Q)
+ *
+	@param r FP12 result of the pairing calculation e(P,Q)
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+
+ */
+extern void PAIR_ate(BN158::FP12 *r, ECP2 *P, ECP *Q);
+/**	@brief Calculate Miller loop for Optimal ATE double-pairing e(P,Q).e(R,S)
+ *
+	Faster than calculating two separate pairings
+	@param r FP12 result of the pairing calculation e(P,Q).e(R,S), an element of GT
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+	@param R ECP2 instance, an element of G2
+	@param S ECP instance, an element of G1
+ */
+extern void PAIR_double_ate(BN158::FP12 *r, ECP2 *P, ECP *Q, ECP2 *R, ECP *S);
+/**	@brief Final exponentiation of pairing, converts output of Miller loop to element in GT
+ *
+	Here p is the internal modulus, and r is the group order
+	@param x FP12, on exit = x^((p^12-1)/r)
+ */
+extern void PAIR_fexp(BN158::FP12 *x);
+/**	@brief Fast point multiplication of a member of the group G1 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param Q ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G1mul(ECP *Q, B160_28::BIG b);
+/**	@brief Fast point multiplication of a member of the group G2 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param P ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G2mul(ECP2 *P, B160_28::BIG b);
+
+
+
+/**	@brief Fast raising of a member of GT to a BIG power
+ *
+	May exploit endomorphism for speed.
+	@param x FP12 member of GT.
+	@param b BIG exponent
+
+ */
+extern void PAIR_GTpow(BN158::FP12 *x, B160_28::BIG b);
+
+
+/**	@brief Tests ECP for membership of G1
+ *
+	@param P ECP member of G1
+	@return true or false
+
+ */
+extern int PAIR_G1member(BN158::ECP *P);
+
+/**	@brief Tests ECP2 for membership of G2
+ *
+	@param P ECP2 member of G2
+	@return true or false
+
+ */
+extern int PAIR_G2member(BN158::ECP2 *P);
+
+/**	@brief Tests FP12 for membership of cyclotomic sub-group
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTcyclotomic(BN158::FP12 *x);
+
+/**	@brief Tests FP12 for membership of GT
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTmember(BN158::FP12 *x);
+
+/**	@brief Prepare Ate parameter
+ *
+	@param n BIG parameter
+	@param n3 BIG paramter = 3*n
+	@return number of nits in n3
+
+ */
+extern int PAIR_nbits(B160_28::BIG n3, B160_28::BIG n);
+
+/**	@brief Initialise structure for multi-pairing
+ *
+	@param r FP12 array, to be initialised to 1
+
+ */
+extern void PAIR_initmp(BN158::FP12 r[]);
+
+
+/**	@brief Miller loop
+ *
+ 	@param res FP12 result
+	@param r FP12 precomputed array of accumulated line functions
+
+ */
+extern void PAIR_miller(BN158::FP12 *res, BN158::FP12 r[]);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/pair_BN254.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/pair_BN254.h
new file mode 100644
index 0000000..b0135ac
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/pair_BN254.h
@@ -0,0 +1,183 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef PAIR_BN254_H
+#define PAIR_BN254_H
+
+#include "fp12_BN254.h"
+#include "ecp2_BN254.h"
+#include "ecp_BN254.h"
+
+using namespace core;
+
+namespace BN254 {
+/* Pairing constants */
+
+extern const B256_28::BIG CURVE_Bnx; /**< BN curve x parameter */
+extern const B256_28::BIG CURVE_Cru; /**< BN curve Cube Root of Unity */
+
+extern const B256_28::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_28::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_28::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_28::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+/* Pairing function prototypes */
+
+
+/**	@brief Precompute line functions details for fixed G2 value
+ *
+	@param T array of precomputed FP4 partial line functions
+	@param GV a fixed ECP2 instance
+ */
+extern void PAIR_precomp(BN254::FP4 T[], ECP2* GV);
+
+/**	@brief Compute line functions for n-pairing
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param PV ECP2 instance, an element of G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another(BN254::FP12 r[], ECP2* PV, ECP* QV);
+
+
+/**	@brief Compute line functions for n-pairing, assuming precomputation on G2
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param T array contains precomputed partial line fucntions from G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another_pc(BN254::FP12 r[], BN254::FP4 T[], ECP *QV);
+
+
+
+/**	@brief Calculate Miller loop for Optimal ATE pairing e(P,Q)
+ *
+	@param r FP12 result of the pairing calculation e(P,Q)
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+
+ */
+extern void PAIR_ate(BN254::FP12 *r, ECP2 *P, ECP *Q);
+/**	@brief Calculate Miller loop for Optimal ATE double-pairing e(P,Q).e(R,S)
+ *
+	Faster than calculating two separate pairings
+	@param r FP12 result of the pairing calculation e(P,Q).e(R,S), an element of GT
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+	@param R ECP2 instance, an element of G2
+	@param S ECP instance, an element of G1
+ */
+extern void PAIR_double_ate(BN254::FP12 *r, ECP2 *P, ECP *Q, ECP2 *R, ECP *S);
+/**	@brief Final exponentiation of pairing, converts output of Miller loop to element in GT
+ *
+	Here p is the internal modulus, and r is the group order
+	@param x FP12, on exit = x^((p^12-1)/r)
+ */
+extern void PAIR_fexp(BN254::FP12 *x);
+/**	@brief Fast point multiplication of a member of the group G1 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param Q ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G1mul(ECP *Q, B256_28::BIG b);
+/**	@brief Fast point multiplication of a member of the group G2 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param P ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G2mul(ECP2 *P, B256_28::BIG b);
+
+
+
+/**	@brief Fast raising of a member of GT to a BIG power
+ *
+	May exploit endomorphism for speed.
+	@param x FP12 member of GT.
+	@param b BIG exponent
+
+ */
+extern void PAIR_GTpow(BN254::FP12 *x, B256_28::BIG b);
+
+
+/**	@brief Tests ECP for membership of G1
+ *
+	@param P ECP member of G1
+	@return true or false
+
+ */
+extern int PAIR_G1member(BN254::ECP *P);
+
+/**	@brief Tests ECP2 for membership of G2
+ *
+	@param P ECP2 member of G2
+	@return true or false
+
+ */
+extern int PAIR_G2member(BN254::ECP2 *P);
+
+/**	@brief Tests FP12 for membership of cyclotomic sub-group
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTcyclotomic(BN254::FP12 *x);
+
+/**	@brief Tests FP12 for membership of GT
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTmember(BN254::FP12 *x);
+
+/**	@brief Prepare Ate parameter
+ *
+	@param n BIG parameter
+	@param n3 BIG paramter = 3*n
+	@return number of nits in n3
+
+ */
+extern int PAIR_nbits(B256_28::BIG n3, B256_28::BIG n);
+
+/**	@brief Initialise structure for multi-pairing
+ *
+	@param r FP12 array, to be initialised to 1
+
+ */
+extern void PAIR_initmp(BN254::FP12 r[]);
+
+
+/**	@brief Miller loop
+ *
+ 	@param res FP12 result
+	@param r FP12 precomputed array of accumulated line functions
+
+ */
+extern void PAIR_miller(BN254::FP12 *res, BN254::FP12 r[]);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/pair_BN254CX.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/pair_BN254CX.h
new file mode 100644
index 0000000..741a787
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/pair_BN254CX.h
@@ -0,0 +1,183 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef PAIR_BN254CX_H
+#define PAIR_BN254CX_H
+
+#include "fp12_BN254CX.h"
+#include "ecp2_BN254CX.h"
+#include "ecp_BN254CX.h"
+
+using namespace core;
+
+namespace BN254CX {
+/* Pairing constants */
+
+extern const B256_28::BIG CURVE_Bnx; /**< BN curve x parameter */
+extern const B256_28::BIG CURVE_Cru; /**< BN curve Cube Root of Unity */
+
+extern const B256_28::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_28::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_28::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_28::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+/* Pairing function prototypes */
+
+
+/**	@brief Precompute line functions details for fixed G2 value
+ *
+	@param T array of precomputed FP4 partial line functions
+	@param GV a fixed ECP2 instance
+ */
+extern void PAIR_precomp(BN254CX::FP4 T[], ECP2* GV);
+
+/**	@brief Compute line functions for n-pairing
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param PV ECP2 instance, an element of G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another(BN254CX::FP12 r[], ECP2* PV, ECP* QV);
+
+
+/**	@brief Compute line functions for n-pairing, assuming precomputation on G2
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param T array contains precomputed partial line fucntions from G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another_pc(BN254CX::FP12 r[], BN254CX::FP4 T[], ECP *QV);
+
+
+
+/**	@brief Calculate Miller loop for Optimal ATE pairing e(P,Q)
+ *
+	@param r FP12 result of the pairing calculation e(P,Q)
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+
+ */
+extern void PAIR_ate(BN254CX::FP12 *r, ECP2 *P, ECP *Q);
+/**	@brief Calculate Miller loop for Optimal ATE double-pairing e(P,Q).e(R,S)
+ *
+	Faster than calculating two separate pairings
+	@param r FP12 result of the pairing calculation e(P,Q).e(R,S), an element of GT
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+	@param R ECP2 instance, an element of G2
+	@param S ECP instance, an element of G1
+ */
+extern void PAIR_double_ate(BN254CX::FP12 *r, ECP2 *P, ECP *Q, ECP2 *R, ECP *S);
+/**	@brief Final exponentiation of pairing, converts output of Miller loop to element in GT
+ *
+	Here p is the internal modulus, and r is the group order
+	@param x FP12, on exit = x^((p^12-1)/r)
+ */
+extern void PAIR_fexp(BN254CX::FP12 *x);
+/**	@brief Fast point multiplication of a member of the group G1 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param Q ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G1mul(ECP *Q, B256_28::BIG b);
+/**	@brief Fast point multiplication of a member of the group G2 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param P ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G2mul(ECP2 *P, B256_28::BIG b);
+
+
+
+/**	@brief Fast raising of a member of GT to a BIG power
+ *
+	May exploit endomorphism for speed.
+	@param x FP12 member of GT.
+	@param b BIG exponent
+
+ */
+extern void PAIR_GTpow(BN254CX::FP12 *x, B256_28::BIG b);
+
+
+/**	@brief Tests ECP for membership of G1
+ *
+	@param P ECP member of G1
+	@return true or false
+
+ */
+extern int PAIR_G1member(BN254CX::ECP *P);
+
+/**	@brief Tests ECP2 for membership of G2
+ *
+	@param P ECP2 member of G2
+	@return true or false
+
+ */
+extern int PAIR_G2member(BN254CX::ECP2 *P);
+
+/**	@brief Tests FP12 for membership of cyclotomic sub-group
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTcyclotomic(BN254CX::FP12 *x);
+
+/**	@brief Tests FP12 for membership of GT
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTmember(BN254CX::FP12 *x);
+
+/**	@brief Prepare Ate parameter
+ *
+	@param n BIG parameter
+	@param n3 BIG paramter = 3*n
+	@return number of nits in n3
+
+ */
+extern int PAIR_nbits(B256_28::BIG n3, B256_28::BIG n);
+
+/**	@brief Initialise structure for multi-pairing
+ *
+	@param r FP12 array, to be initialised to 1
+
+ */
+extern void PAIR_initmp(BN254CX::FP12 r[]);
+
+
+/**	@brief Miller loop
+ *
+ 	@param res FP12 result
+	@param r FP12 precomputed array of accumulated line functions
+
+ */
+extern void PAIR_miller(BN254CX::FP12 *res, BN254CX::FP12 r[]);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/pair_BN462.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/pair_BN462.h
new file mode 100644
index 0000000..ba46e97
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/pair_BN462.h
@@ -0,0 +1,183 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef PAIR_BN462_H
+#define PAIR_BN462_H
+
+#include "fp12_BN462.h"
+#include "ecp2_BN462.h"
+#include "ecp_BN462.h"
+
+using namespace core;
+
+namespace BN462 {
+/* Pairing constants */
+
+extern const B464_28::BIG CURVE_Bnx; /**< BN curve x parameter */
+extern const B464_28::BIG CURVE_Cru; /**< BN curve Cube Root of Unity */
+
+extern const B464_28::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B464_28::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B464_28::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B464_28::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+/* Pairing function prototypes */
+
+
+/**	@brief Precompute line functions details for fixed G2 value
+ *
+	@param T array of precomputed FP4 partial line functions
+	@param GV a fixed ECP2 instance
+ */
+extern void PAIR_precomp(BN462::FP4 T[], ECP2* GV);
+
+/**	@brief Compute line functions for n-pairing
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param PV ECP2 instance, an element of G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another(BN462::FP12 r[], ECP2* PV, ECP* QV);
+
+
+/**	@brief Compute line functions for n-pairing, assuming precomputation on G2
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param T array contains precomputed partial line fucntions from G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another_pc(BN462::FP12 r[], BN462::FP4 T[], ECP *QV);
+
+
+
+/**	@brief Calculate Miller loop for Optimal ATE pairing e(P,Q)
+ *
+	@param r FP12 result of the pairing calculation e(P,Q)
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+
+ */
+extern void PAIR_ate(BN462::FP12 *r, ECP2 *P, ECP *Q);
+/**	@brief Calculate Miller loop for Optimal ATE double-pairing e(P,Q).e(R,S)
+ *
+	Faster than calculating two separate pairings
+	@param r FP12 result of the pairing calculation e(P,Q).e(R,S), an element of GT
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+	@param R ECP2 instance, an element of G2
+	@param S ECP instance, an element of G1
+ */
+extern void PAIR_double_ate(BN462::FP12 *r, ECP2 *P, ECP *Q, ECP2 *R, ECP *S);
+/**	@brief Final exponentiation of pairing, converts output of Miller loop to element in GT
+ *
+	Here p is the internal modulus, and r is the group order
+	@param x FP12, on exit = x^((p^12-1)/r)
+ */
+extern void PAIR_fexp(BN462::FP12 *x);
+/**	@brief Fast point multiplication of a member of the group G1 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param Q ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G1mul(ECP *Q, B464_28::BIG b);
+/**	@brief Fast point multiplication of a member of the group G2 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param P ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G2mul(ECP2 *P, B464_28::BIG b);
+
+
+
+/**	@brief Fast raising of a member of GT to a BIG power
+ *
+	May exploit endomorphism for speed.
+	@param x FP12 member of GT.
+	@param b BIG exponent
+
+ */
+extern void PAIR_GTpow(BN462::FP12 *x, B464_28::BIG b);
+
+
+/**	@brief Tests ECP for membership of G1
+ *
+	@param P ECP member of G1
+	@return true or false
+
+ */
+extern int PAIR_G1member(BN462::ECP *P);
+
+/**	@brief Tests ECP2 for membership of G2
+ *
+	@param P ECP2 member of G2
+	@return true or false
+
+ */
+extern int PAIR_G2member(BN462::ECP2 *P);
+
+/**	@brief Tests FP12 for membership of cyclotomic sub-group
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTcyclotomic(BN462::FP12 *x);
+
+/**	@brief Tests FP12 for membership of GT
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTmember(BN462::FP12 *x);
+
+/**	@brief Prepare Ate parameter
+ *
+	@param n BIG parameter
+	@param n3 BIG paramter = 3*n
+	@return number of nits in n3
+
+ */
+extern int PAIR_nbits(B464_28::BIG n3, B464_28::BIG n);
+
+/**	@brief Initialise structure for multi-pairing
+ *
+	@param r FP12 array, to be initialised to 1
+
+ */
+extern void PAIR_initmp(BN462::FP12 r[]);
+
+
+/**	@brief Miller loop
+ *
+ 	@param res FP12 result
+	@param r FP12 precomputed array of accumulated line functions
+
+ */
+extern void PAIR_miller(BN462::FP12 *res, BN462::FP12 r[]);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/pair_FP256BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/pair_FP256BN.h
new file mode 100644
index 0000000..3ff7721
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/pair_FP256BN.h
@@ -0,0 +1,183 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef PAIR_FP256BN_H
+#define PAIR_FP256BN_H
+
+#include "fp12_FP256BN.h"
+#include "ecp2_FP256BN.h"
+#include "ecp_FP256BN.h"
+
+using namespace core;
+
+namespace FP256BN {
+/* Pairing constants */
+
+extern const B256_28::BIG CURVE_Bnx; /**< BN curve x parameter */
+extern const B256_28::BIG CURVE_Cru; /**< BN curve Cube Root of Unity */
+
+extern const B256_28::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_28::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_28::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_28::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+/* Pairing function prototypes */
+
+
+/**	@brief Precompute line functions details for fixed G2 value
+ *
+	@param T array of precomputed FP4 partial line functions
+	@param GV a fixed ECP2 instance
+ */
+extern void PAIR_precomp(FP256BN::FP4 T[], ECP2* GV);
+
+/**	@brief Compute line functions for n-pairing
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param PV ECP2 instance, an element of G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another(FP256BN::FP12 r[], ECP2* PV, ECP* QV);
+
+
+/**	@brief Compute line functions for n-pairing, assuming precomputation on G2
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param T array contains precomputed partial line fucntions from G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another_pc(FP256BN::FP12 r[], FP256BN::FP4 T[], ECP *QV);
+
+
+
+/**	@brief Calculate Miller loop for Optimal ATE pairing e(P,Q)
+ *
+	@param r FP12 result of the pairing calculation e(P,Q)
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+
+ */
+extern void PAIR_ate(FP256BN::FP12 *r, ECP2 *P, ECP *Q);
+/**	@brief Calculate Miller loop for Optimal ATE double-pairing e(P,Q).e(R,S)
+ *
+	Faster than calculating two separate pairings
+	@param r FP12 result of the pairing calculation e(P,Q).e(R,S), an element of GT
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+	@param R ECP2 instance, an element of G2
+	@param S ECP instance, an element of G1
+ */
+extern void PAIR_double_ate(FP256BN::FP12 *r, ECP2 *P, ECP *Q, ECP2 *R, ECP *S);
+/**	@brief Final exponentiation of pairing, converts output of Miller loop to element in GT
+ *
+	Here p is the internal modulus, and r is the group order
+	@param x FP12, on exit = x^((p^12-1)/r)
+ */
+extern void PAIR_fexp(FP256BN::FP12 *x);
+/**	@brief Fast point multiplication of a member of the group G1 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param Q ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G1mul(ECP *Q, B256_28::BIG b);
+/**	@brief Fast point multiplication of a member of the group G2 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param P ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G2mul(ECP2 *P, B256_28::BIG b);
+
+
+
+/**	@brief Fast raising of a member of GT to a BIG power
+ *
+	May exploit endomorphism for speed.
+	@param x FP12 member of GT.
+	@param b BIG exponent
+
+ */
+extern void PAIR_GTpow(FP256BN::FP12 *x, B256_28::BIG b);
+
+
+/**	@brief Tests ECP for membership of G1
+ *
+	@param P ECP member of G1
+	@return true or false
+
+ */
+extern int PAIR_G1member(FP256BN::ECP *P);
+
+/**	@brief Tests ECP2 for membership of G2
+ *
+	@param P ECP2 member of G2
+	@return true or false
+
+ */
+extern int PAIR_G2member(FP256BN::ECP2 *P);
+
+/**	@brief Tests FP12 for membership of cyclotomic sub-group
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTcyclotomic(FP256BN::FP12 *x);
+
+/**	@brief Tests FP12 for membership of GT
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTmember(FP256BN::FP12 *x);
+
+/**	@brief Prepare Ate parameter
+ *
+	@param n BIG parameter
+	@param n3 BIG paramter = 3*n
+	@return number of nits in n3
+
+ */
+extern int PAIR_nbits(B256_28::BIG n3, B256_28::BIG n);
+
+/**	@brief Initialise structure for multi-pairing
+ *
+	@param r FP12 array, to be initialised to 1
+
+ */
+extern void PAIR_initmp(FP256BN::FP12 r[]);
+
+
+/**	@brief Miller loop
+ *
+ 	@param res FP12 result
+	@param r FP12 precomputed array of accumulated line functions
+
+ */
+extern void PAIR_miller(FP256BN::FP12 *res, FP256BN::FP12 r[]);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/pair_FP512BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/pair_FP512BN.h
new file mode 100644
index 0000000..cfea672
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/pair_FP512BN.h
@@ -0,0 +1,183 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef PAIR_FP512BN_H
+#define PAIR_FP512BN_H
+
+#include "fp12_FP512BN.h"
+#include "ecp2_FP512BN.h"
+#include "ecp_FP512BN.h"
+
+using namespace core;
+
+namespace FP512BN {
+/* Pairing constants */
+
+extern const B512_29::BIG CURVE_Bnx; /**< BN curve x parameter */
+extern const B512_29::BIG CURVE_Cru; /**< BN curve Cube Root of Unity */
+
+extern const B512_29::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B512_29::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B512_29::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B512_29::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+/* Pairing function prototypes */
+
+
+/**	@brief Precompute line functions details for fixed G2 value
+ *
+	@param T array of precomputed FP4 partial line functions
+	@param GV a fixed ECP2 instance
+ */
+extern void PAIR_precomp(FP512BN::FP4 T[], ECP2* GV);
+
+/**	@brief Compute line functions for n-pairing
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param PV ECP2 instance, an element of G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another(FP512BN::FP12 r[], ECP2* PV, ECP* QV);
+
+
+/**	@brief Compute line functions for n-pairing, assuming precomputation on G2
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param T array contains precomputed partial line fucntions from G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another_pc(FP512BN::FP12 r[], FP512BN::FP4 T[], ECP *QV);
+
+
+
+/**	@brief Calculate Miller loop for Optimal ATE pairing e(P,Q)
+ *
+	@param r FP12 result of the pairing calculation e(P,Q)
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+
+ */
+extern void PAIR_ate(FP512BN::FP12 *r, ECP2 *P, ECP *Q);
+/**	@brief Calculate Miller loop for Optimal ATE double-pairing e(P,Q).e(R,S)
+ *
+	Faster than calculating two separate pairings
+	@param r FP12 result of the pairing calculation e(P,Q).e(R,S), an element of GT
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+	@param R ECP2 instance, an element of G2
+	@param S ECP instance, an element of G1
+ */
+extern void PAIR_double_ate(FP512BN::FP12 *r, ECP2 *P, ECP *Q, ECP2 *R, ECP *S);
+/**	@brief Final exponentiation of pairing, converts output of Miller loop to element in GT
+ *
+	Here p is the internal modulus, and r is the group order
+	@param x FP12, on exit = x^((p^12-1)/r)
+ */
+extern void PAIR_fexp(FP512BN::FP12 *x);
+/**	@brief Fast point multiplication of a member of the group G1 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param Q ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G1mul(ECP *Q, B512_29::BIG b);
+/**	@brief Fast point multiplication of a member of the group G2 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param P ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G2mul(ECP2 *P, B512_29::BIG b);
+
+
+
+/**	@brief Fast raising of a member of GT to a BIG power
+ *
+	May exploit endomorphism for speed.
+	@param x FP12 member of GT.
+	@param b BIG exponent
+
+ */
+extern void PAIR_GTpow(FP512BN::FP12 *x, B512_29::BIG b);
+
+
+/**	@brief Tests ECP for membership of G1
+ *
+	@param P ECP member of G1
+	@return true or false
+
+ */
+extern int PAIR_G1member(FP512BN::ECP *P);
+
+/**	@brief Tests ECP2 for membership of G2
+ *
+	@param P ECP2 member of G2
+	@return true or false
+
+ */
+extern int PAIR_G2member(FP512BN::ECP2 *P);
+
+/**	@brief Tests FP12 for membership of cyclotomic sub-group
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTcyclotomic(FP512BN::FP12 *x);
+
+/**	@brief Tests FP12 for membership of GT
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTmember(FP512BN::FP12 *x);
+
+/**	@brief Prepare Ate parameter
+ *
+	@param n BIG parameter
+	@param n3 BIG paramter = 3*n
+	@return number of nits in n3
+
+ */
+extern int PAIR_nbits(B512_29::BIG n3, B512_29::BIG n);
+
+/**	@brief Initialise structure for multi-pairing
+ *
+	@param r FP12 array, to be initialised to 1
+
+ */
+extern void PAIR_initmp(FP512BN::FP12 r[]);
+
+
+/**	@brief Miller loop
+ *
+ 	@param res FP12 result
+	@param r FP12 precomputed array of accumulated line functions
+
+ */
+extern void PAIR_miller(FP512BN::FP12 *res, FP512BN::FP12 r[]);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/randapi.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/randapi.h
new file mode 100644
index 0000000..4038228
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/randapi.h
@@ -0,0 +1,43 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef RANDOM_H
+#define RANDOM_H
+
+#include "core.h"
+
+namespace core {
+
+/** @brief Initialise a random number generator
+ *
+    @param R is a pointer to a cryptographically secure random number generator
+    @param S is an input truly random seed value
+ */
+extern void CREATE_CSPRNG(csprng *R, octet *S);
+/** @brief Kill a random number generator
+ *
+    Deletes all internal state
+    @param R is a pointer to a cryptographically secure random number generator
+ */
+extern void KILL_CSPRNG(csprng *R);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/rsa_RSA2048.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/rsa_RSA2048.h
new file mode 100644
index 0000000..4e0b1c4
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/rsa_RSA2048.h
@@ -0,0 +1,138 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file rsa.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief RSA Header file for implementation of RSA protocol
+ *
+ * declares functions
+ *
+ */
+
+#ifndef RSA_RSA2048_H
+#define RSA_RSA2048_H
+
+#include "ff_RSA2048.h"
+//#include "rsa_support.h"
+
+using namespace core;
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+#define HASH_TYPE_RSA_RSA2048 SHA256 /**< Chosen Hash algorithm */
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define RFS_RSA2048 MODBYTES_B512_29*FFLEN_RSA2048 /**< RSA Public Key Size in bytes */
+
+
+namespace RSA2048 {
+
+/**
+    @brief Integer Factorisation Public Key
+*/
+
+typedef struct
+{
+    sign32 e;     /**< RSA exponent (typically 65537) */
+    B512_29::BIG n[FFLEN_RSA2048]; /**< An array of BIGs to store public key */
+} rsa_public_key;
+
+/**
+    @brief Integer Factorisation Private Key
+*/
+
+typedef struct
+{
+    B512_29::BIG p[FFLEN_RSA2048 / 2]; /**< secret prime p  */
+    B512_29::BIG q[FFLEN_RSA2048 / 2]; /**< secret prime q  */
+    B512_29::BIG dp[FFLEN_RSA2048 / 2]; /**< decrypting exponent mod (p-1)  */
+    B512_29::BIG dq[FFLEN_RSA2048 / 2]; /**< decrypting exponent mod (q-1)  */
+    B512_29::BIG c[FFLEN_RSA2048 / 2]; /**< 1/p mod q */
+} rsa_private_key;
+
+
+/** @brief RSA Private KEy from OpenSSL 
+ *
+    @param P Input prime number
+    @param Q Input prime number
+    @param DP Input 1/e mod p-1
+    @param DQ Input 1/e mod q-1
+    @param C Input 1/p mod q
+    @param PRIV the output RSA private key
+ */
+extern void RSA_PRIVATE_KEY_FROM_OPENSSL(octet *P,octet* Q,octet *DP,octet *DQ,octet *C,rsa_private_key *PRIV);
+
+/** @brief RSA Key Pair from OpenSSL 
+ *
+    @param e the encryption exponent
+    @param P Input prime number
+    @param Q Input prime number
+    @param DP Input 1/e mod p-1
+    @param DQ Input 1/e mod q-1
+    @param C Input 1/p mod q
+    @param PRIV the output RSA private key
+    @param PUB the output RSA public key
+ */
+extern void RSA_KEY_PAIR_FROM_OPENSSL(sign32 e,octet *P,octet* Q,octet *DP,octet *DQ,octet *C,rsa_private_key *PRIV,rsa_public_key *PUB);
+
+/** @brief RSA Key Pair Generator
+ *
+    @param R is a pointer to a cryptographically secure random number generator
+    @param e the encryption exponent
+    @param PRIV the output RSA private key
+    @param PUB the output RSA public key
+    @param P Input prime number. Used when R is equal to NULL for testing
+    @param Q Input prime number. Used when R is equal to NULL for testing
+ */
+extern void RSA_KEY_PAIR(csprng *R, sign32 e, rsa_private_key* PRIV, rsa_public_key* PUB, octet *P, octet* Q);
+
+/** @brief RSA encryption of suitably padded plaintext
+ *
+    @param PUB the input RSA public key
+    @param F is input padded message
+    @param G is the output ciphertext
+ */
+extern void RSA_ENCRYPT(rsa_public_key* PUB, octet *F, octet *G);
+/** @brief RSA decryption of ciphertext
+ *
+    @param PRIV the input RSA private key
+    @param G is the input ciphertext
+    @param F is output plaintext (requires unpadding)
+
+ */
+extern void RSA_DECRYPT(rsa_private_key* PRIV, octet *G, octet *F);
+/** @brief Destroy an RSA private Key
+ *
+    @param PRIV the input RSA private key. Destroyed on output.
+ */
+extern void RSA_PRIVATE_KEY_KILL(rsa_private_key *PRIV);
+/** @brief Populates an RSA public key from an octet string
+ *
+    Creates RSA public key from big-endian base 256 form.
+    @param x FF instance to be created from an octet string
+    @param S input octet string
+ */
+extern void RSA_fromOctet(B512_29::BIG *x, octet *S);
+}
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/rsa_RSA3072.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/rsa_RSA3072.h
new file mode 100644
index 0000000..00ede31
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/rsa_RSA3072.h
@@ -0,0 +1,138 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file rsa.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief RSA Header file for implementation of RSA protocol
+ *
+ * declares functions
+ *
+ */
+
+#ifndef RSA_RSA3072_H
+#define RSA_RSA3072_H
+
+#include "ff_RSA3072.h"
+//#include "rsa_support.h"
+
+using namespace core;
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+#define HASH_TYPE_RSA_RSA3072 SHA256 /**< Chosen Hash algorithm */
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define RFS_RSA3072 MODBYTES_B384_28*FFLEN_RSA3072 /**< RSA Public Key Size in bytes */
+
+
+namespace RSA3072 {
+
+/**
+    @brief Integer Factorisation Public Key
+*/
+
+typedef struct
+{
+    sign32 e;     /**< RSA exponent (typically 65537) */
+    B384_28::BIG n[FFLEN_RSA3072]; /**< An array of BIGs to store public key */
+} rsa_public_key;
+
+/**
+    @brief Integer Factorisation Private Key
+*/
+
+typedef struct
+{
+    B384_28::BIG p[FFLEN_RSA3072 / 2]; /**< secret prime p  */
+    B384_28::BIG q[FFLEN_RSA3072 / 2]; /**< secret prime q  */
+    B384_28::BIG dp[FFLEN_RSA3072 / 2]; /**< decrypting exponent mod (p-1)  */
+    B384_28::BIG dq[FFLEN_RSA3072 / 2]; /**< decrypting exponent mod (q-1)  */
+    B384_28::BIG c[FFLEN_RSA3072 / 2]; /**< 1/p mod q */
+} rsa_private_key;
+
+
+/** @brief RSA Private KEy from OpenSSL 
+ *
+    @param P Input prime number
+    @param Q Input prime number
+    @param DP Input 1/e mod p-1
+    @param DQ Input 1/e mod q-1
+    @param C Input 1/p mod q
+    @param PRIV the output RSA private key
+ */
+extern void RSA_PRIVATE_KEY_FROM_OPENSSL(octet *P,octet* Q,octet *DP,octet *DQ,octet *C,rsa_private_key *PRIV);
+
+/** @brief RSA Key Pair from OpenSSL 
+ *
+    @param e the encryption exponent
+    @param P Input prime number
+    @param Q Input prime number
+    @param DP Input 1/e mod p-1
+    @param DQ Input 1/e mod q-1
+    @param C Input 1/p mod q
+    @param PRIV the output RSA private key
+    @param PUB the output RSA public key
+ */
+extern void RSA_KEY_PAIR_FROM_OPENSSL(sign32 e,octet *P,octet* Q,octet *DP,octet *DQ,octet *C,rsa_private_key *PRIV,rsa_public_key *PUB);
+
+/** @brief RSA Key Pair Generator
+ *
+    @param R is a pointer to a cryptographically secure random number generator
+    @param e the encryption exponent
+    @param PRIV the output RSA private key
+    @param PUB the output RSA public key
+    @param P Input prime number. Used when R is equal to NULL for testing
+    @param Q Input prime number. Used when R is equal to NULL for testing
+ */
+extern void RSA_KEY_PAIR(csprng *R, sign32 e, rsa_private_key* PRIV, rsa_public_key* PUB, octet *P, octet* Q);
+
+/** @brief RSA encryption of suitably padded plaintext
+ *
+    @param PUB the input RSA public key
+    @param F is input padded message
+    @param G is the output ciphertext
+ */
+extern void RSA_ENCRYPT(rsa_public_key* PUB, octet *F, octet *G);
+/** @brief RSA decryption of ciphertext
+ *
+    @param PRIV the input RSA private key
+    @param G is the input ciphertext
+    @param F is output plaintext (requires unpadding)
+
+ */
+extern void RSA_DECRYPT(rsa_private_key* PRIV, octet *G, octet *F);
+/** @brief Destroy an RSA private Key
+ *
+    @param PRIV the input RSA private key. Destroyed on output.
+ */
+extern void RSA_PRIVATE_KEY_KILL(rsa_private_key *PRIV);
+/** @brief Populates an RSA public key from an octet string
+ *
+    Creates RSA public key from big-endian base 256 form.
+    @param x FF instance to be created from an octet string
+    @param S input octet string
+ */
+extern void RSA_fromOctet(B384_28::BIG *x, octet *S);
+}
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/rsa_RSA4096.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/rsa_RSA4096.h
new file mode 100644
index 0000000..815cc1b
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/rsa_RSA4096.h
@@ -0,0 +1,138 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file rsa.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief RSA Header file for implementation of RSA protocol
+ *
+ * declares functions
+ *
+ */
+
+#ifndef RSA_RSA4096_H
+#define RSA_RSA4096_H
+
+#include "ff_RSA4096.h"
+//#include "rsa_support.h"
+
+using namespace core;
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+#define HASH_TYPE_RSA_RSA4096 SHA256 /**< Chosen Hash algorithm */
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define RFS_RSA4096 MODBYTES_B512_29*FFLEN_RSA4096 /**< RSA Public Key Size in bytes */
+
+
+namespace RSA4096 {
+
+/**
+    @brief Integer Factorisation Public Key
+*/
+
+typedef struct
+{
+    sign32 e;     /**< RSA exponent (typically 65537) */
+    B512_29::BIG n[FFLEN_RSA4096]; /**< An array of BIGs to store public key */
+} rsa_public_key;
+
+/**
+    @brief Integer Factorisation Private Key
+*/
+
+typedef struct
+{
+    B512_29::BIG p[FFLEN_RSA4096 / 2]; /**< secret prime p  */
+    B512_29::BIG q[FFLEN_RSA4096 / 2]; /**< secret prime q  */
+    B512_29::BIG dp[FFLEN_RSA4096 / 2]; /**< decrypting exponent mod (p-1)  */
+    B512_29::BIG dq[FFLEN_RSA4096 / 2]; /**< decrypting exponent mod (q-1)  */
+    B512_29::BIG c[FFLEN_RSA4096 / 2]; /**< 1/p mod q */
+} rsa_private_key;
+
+
+/** @brief RSA Private KEy from OpenSSL 
+ *
+    @param P Input prime number
+    @param Q Input prime number
+    @param DP Input 1/e mod p-1
+    @param DQ Input 1/e mod q-1
+    @param C Input 1/p mod q
+    @param PRIV the output RSA private key
+ */
+extern void RSA_PRIVATE_KEY_FROM_OPENSSL(octet *P,octet* Q,octet *DP,octet *DQ,octet *C,rsa_private_key *PRIV);
+
+/** @brief RSA Key Pair from OpenSSL 
+ *
+    @param e the encryption exponent
+    @param P Input prime number
+    @param Q Input prime number
+    @param DP Input 1/e mod p-1
+    @param DQ Input 1/e mod q-1
+    @param C Input 1/p mod q
+    @param PRIV the output RSA private key
+    @param PUB the output RSA public key
+ */
+extern void RSA_KEY_PAIR_FROM_OPENSSL(sign32 e,octet *P,octet* Q,octet *DP,octet *DQ,octet *C,rsa_private_key *PRIV,rsa_public_key *PUB);
+
+/** @brief RSA Key Pair Generator
+ *
+    @param R is a pointer to a cryptographically secure random number generator
+    @param e the encryption exponent
+    @param PRIV the output RSA private key
+    @param PUB the output RSA public key
+    @param P Input prime number. Used when R is equal to NULL for testing
+    @param Q Input prime number. Used when R is equal to NULL for testing
+ */
+extern void RSA_KEY_PAIR(csprng *R, sign32 e, rsa_private_key* PRIV, rsa_public_key* PUB, octet *P, octet* Q);
+
+/** @brief RSA encryption of suitably padded plaintext
+ *
+    @param PUB the input RSA public key
+    @param F is input padded message
+    @param G is the output ciphertext
+ */
+extern void RSA_ENCRYPT(rsa_public_key* PUB, octet *F, octet *G);
+/** @brief RSA decryption of ciphertext
+ *
+    @param PRIV the input RSA private key
+    @param G is the input ciphertext
+    @param F is output plaintext (requires unpadding)
+
+ */
+extern void RSA_DECRYPT(rsa_private_key* PRIV, octet *G, octet *F);
+/** @brief Destroy an RSA private Key
+ *
+    @param PRIV the input RSA private key. Destroyed on output.
+ */
+extern void RSA_PRIVATE_KEY_KILL(rsa_private_key *PRIV);
+/** @brief Populates an RSA public key from an octet string
+ *
+    Creates RSA public key from big-endian base 256 form.
+    @param x FF instance to be created from an octet string
+    @param S input octet string
+ */
+extern void RSA_fromOctet(B512_29::BIG *x, octet *S);
+}
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/x509.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/x509.h
new file mode 100644
index 0000000..bcba4d3
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl-winx86-11-04-24/includes/x509.h
@@ -0,0 +1,212 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* CORE x509 header file */
+
+/**
+ * @file x509.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 19th May 2015
+ * @brief X509 function Header File
+ *
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef X509_H
+#define X509_H
+
+// Supported Encryption Methods
+
+#define X509_ECC 1
+#define X509_RSA 2
+#define X509_ECD 3
+#define X509_PQ 4
+
+// Supported Hash functions
+
+#define X509_H256 2
+#define X509_H384 3
+#define X509_H512 4
+#define X509_SHAKE256 5
+
+// Supported Curves
+
+#define USE_NIST256 0    /**< For the NIST 256-bit standard curve - WEIERSTRASS only */
+#define USE_ED25519 1     /**< Bernstein's Modulus 2^255-19 - EDWARDS */
+#define USE_ED448 4     /**< Goldilocks Modulus Ed448 - EDWARDS */
+#define USE_BRAINPOOL 2  /**< For Brainpool 256-bit curve - WEIERSTRASS only */
+#define USE_ANSSI 3      /**< For French 256-bit standard curve - WEIERSTRASS only */
+#define USE_NIST384 10   /**< For the NIST 384-bit standard curve - WEIERSTRASS only */
+#define USE_NIST521 12   /**< For the NIST 521-bit standard curve - WEIERSTRASS only */
+
+using namespace core;
+
+extern octet X509_CN;  // Country Name
+extern octet X509_ON;  // organisation Name
+extern octet X509_EN;  // email
+extern octet X509_LN;  // local name
+extern octet X509_UN;  // Unit name (aka Organisation Unit OU)
+extern octet X509_MN;  // My Name (aka Common Name)
+extern octet X509_SN;  // State Name
+
+extern octet X509_AN;  // Alternate Name
+extern octet X509_KU;  // Key Usage
+extern octet X509_BC;  // Basic Constraints
+
+/**
+ * @brief Public key type
+ */
+typedef struct
+{
+    int type;  /**< signature type (ECC or RSA) */
+    int hash;  /**< hash type */
+    int curve; /**< elliptic curve used or RSA key length in bits  */
+} pktype;
+
+
+/* X.509 functions */
+
+/** @brief Extract private key
+ *
+	@param c an X.509 private key 
+	@param pk the extracted private key - for RSA octet = p|q|dp|dq|c, for ECC octet = k
+	@return private key type details 
+*/
+extern pktype X509_extract_private_key(octet *c,octet *pk);
+
+/** @brief Extract certificate signature
+ *
+	@param c an X.509 certificate
+	@param s the extracted signature
+	@return signature type details
+
+*/
+extern pktype X509_extract_cert_sig(octet *c, octet *s);
+/** @brief
+ *
+	@param sc a signed certificate
+	@param c the extracted certificate
+	@return 0 on failure
+*/
+extern int X509_extract_cert(octet *sc, octet *c);
+
+/** @brief
+ *
+	@param c an X.509 certificate
+	@param ptr pointer to ASN.1 raw public key
+	@return length of raw public key
+*/
+extern int X509_find_public_key(octet *c,int *ptr);
+
+/** @brief
+ *
+	@param c an ASN.1 encoded public key
+	@param key the extracted public key
+	@return indicator of public key type (ECC or RSA)
+*/
+extern pktype X509_get_public_key(octet *c,octet *key);
+
+/** @brief
+ *
+	@param c an X.509 certificate
+	@param k the extracted key
+	@return indicator of public key type (ECC or RSA)
+*/
+extern pktype X509_extract_public_key(octet *c, octet *k);
+/** @brief
+ *
+	@param c an X.509 certificate
+    @param len length of issuer field
+	@return 0 on failure, or pointer to issuer field in cert
+*/
+extern int X509_find_issuer(octet *c,int *len);
+/** @brief
+ *
+	@param c an X.509 certificate
+	@return 0 on failure, or pointer to validity field in cert
+*/
+extern int X509_find_validity(octet *c);
+/** @brief
+ *
+	@param c an X.509 certificate
+    @param len length of subject field
+	@return 0 on failure, or pointer to subject field in cert
+*/
+extern int X509_find_subject(octet *c,int *len);
+
+/** @brief
+ *
+	@param c an X.509 certificate
+	@return true if self-signed, else false
+*/
+extern int X509_self_signed(octet *c);
+
+/** @brief
+ *
+	@param c an X.509 certificate
+	@param S is OID of property we are looking for
+	@param s is a pointer to the section of interest in the cert
+	@param f is pointer to the length of the property
+	@return 0 on failure, or pointer to the property
+*/
+extern int X509_find_entity_property(octet *c, octet *S, int s, int *f);
+/** @brief
+ *
+	@param c an X.509 certificate
+	@param s is a pointer to the start of the validity field
+	@return 0 on failure, or pointer to the start date
+*/
+extern int X509_find_start_date(octet *c, int s);
+/** @brief
+ *
+	@param c an X.509 certificate
+	@param s is a pointer to the start of the validity field
+	@return 0 on failure, or pointer to the expiry date
+*/
+extern int X509_find_expiry_date(octet *c, int s);
+
+
+/** @brief
+ *
+	@param c an X.509 certificate
+	@return 0 on failure (or no extensions), or pointer to extensions field in cert
+*/
+extern int X509_find_extensions(octet *c);
+/** @brief
+ *
+	@param c an X.509 certificate
+	@param S is OID of particular extension we are looking for
+	@param s is a pointer to the section of interest in the cert
+	@param f is pointer to the length of the extension
+	@return 0 on failure, or pointer to the extension
+*/
+extern int X509_find_extension(octet *c, octet *S, int s, int *f);
+
+/** @brief
+ *
+	@param c an X.509 certificate
+    @param s is a pointer to certificate extension SubjectAltNames
+    @param name is a URL
+    @return 0 on failure, 1 if URL is in list of alt names
+*/
+extern int X509_find_alt_name(octet *c,int s,char *name);
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/core.a b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/core.a
new file mode 100644
index 0000000..8bff367
Binary files /dev/null and b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/core.a differ
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/arch.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/arch.h
new file mode 100644
index 0000000..db16940
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/arch.h
@@ -0,0 +1,106 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* Architecture definition header file */
+
+/**
+ * @file arch.h
+ * @author Mike Scott
+ * @date 23rd February 2016
+ * @brief Architecture Header File
+ *
+ * Specify Processor Architecture
+ *
+ */
+
+/* NOTE: There is only one user configurable section in this header - see below */
+
+#ifndef ARCH_H
+#define ARCH_H
+#include <stdint.h>
+
+#define WOULD_USE_VLAS   /* Would like to use variable length arrays? */
+
+#ifdef WOULD_USE_VLAS
+#if __cplusplus >= 201402L
+#define USE_VLAS
+#endif
+#endif
+
+namespace core {
+
+/*** START OF USER CONFIGURABLE SECTION - set architecture ***/
+
+#define CHUNK 64      /**< size of chunk in bits = wordlength of computer = 16, 32 or 64. Note not all curve options are supported on 16-bit processors */
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+/* Create Integer types */
+
+//#define byte uint8_t            /**< 8-bit unsigned integer */
+//#define sign8 int8_t            /**< 8-bit signed integer */
+//#define sign16 int16_t          /**< 16-bit signed integer */
+//#define sign32 int32_t          /**< 32-bit signed integer */
+//#define sign64 int64_t          /**< 64-bit signed integer */
+//#define unsign32 uint32_t       /**< 32-bit unsigned integer */
+//#define unsign64 uint64_t       /**< 64-bit unsigned integer */
+
+using byte = uint8_t;			/**< 8-bit unsigned integer */
+using sign8 = int8_t;			/**< 8-bit signed integer */
+using sign16 = int16_t;			/**< 16-bit signed integer */
+using sign32 = int32_t;			/**< 32-bit signed integer */
+using sign64 = int64_t;			/**< 64-bit signed integer */
+using unsign32 = uint32_t;		/**< 32-bit unsigned integer */
+using unsign64 = uint64_t;		/**< 64-bit unsigned integer */
+
+//#define uchar unsigned char  /**<  Unsigned char */
+using uchar = unsigned char;
+
+/* Don't mess with anything below this line unless you know what you are doing */
+
+#if CHUNK==16
+
+#define chunk int16_t       /**< C type corresponding to word length */
+#define dchunk int32_t      /**< Always define double length chunk type if available */
+
+#endif
+
+#if CHUNK == 32
+
+#define chunk int32_t       /**< C type corresponding to word length */
+#define dchunk int64_t      /**< Always define double length chunk type if available */
+
+#endif
+
+#if CHUNK == 64
+
+#define chunk int64_t       /**< C type corresponding to word length */
+#if defined(__SIZEOF_INT128__) && __SIZEOF_INT128__ == 16
+#define dchunk __int128
+#endif
+
+#endif
+
+#ifdef dchunk
+#define COMBA      /**< Use COMBA method for faster muls, sqrs and reductions */
+#endif
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/big.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/big.h
new file mode 100644
index 0000000..894cc57
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/big.h
@@ -0,0 +1,697 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file big.h
+ * @author Mike Scott
+ * @date 23rd February 2016
+ * @brief Big number Header File
+ *
+ *
+ */
+
+#ifndef BIG_XXX_H
+#define BIG_XXX_H
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <inttypes.h>
+#include "arch.h"
+#include "core.h"
+#include "config_big_XXX.h"
+
+using namespace core;
+
+/* could comment this out if code size is a major issue */
+#define UNWOUND
+/* Normally recommended, but may not be optimal for some architectures, for example 32-bit ARM M4 */
+#define USE_KARATSUBA
+
+#define BIGBITS_XXX (8*MODBYTES_XXX)
+#define NLEN_XXX (1+((8*MODBYTES_XXX-1)/BASEBITS_XXX))
+#define DNLEN_XXX 2*NLEN_XXX
+#define BMASK_XXX (((chunk)1<<BASEBITS_XXX)-1) /**< Mask = 2^BASEBITS-1 */
+#define NEXCESS_XXX (1<<(CHUNK-BASEBITS_XXX-1))           /**< 2^(CHUNK-BASEBITS-1) - digit cannot be multiplied by more than this before normalisation */
+
+#define HBITS_XXX (BASEBITS_XXX/2)      /**< Number of bits in number base divided by 2 */
+#define HMASK_XXX (((chunk)1<<HBITS_XXX)-1)    /**< Mask = 2^HBITS-1 */
+
+//#define DEBUG_NORM
+
+#ifdef DEBUG_NORM  /* Add an extra location to track chunk extension */
+#define MPV_XXX NLEN_XXX
+#define MNV_XXX (NLEN_XXX+1)
+#define DMPV_XXX DNLEN_XXX
+#define DMNV_XXX (DNLEN_XXX+1)
+
+#endif
+
+namespace XXX {
+
+//extern int BIGMULS;
+//extern int BIGSQRS;
+
+#ifdef DEBUG_NORM
+typedef chunk BIG[NLEN_XXX + 2]; /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_XXX + 2]; /**< Define type DBIG as array of chunks */
+#else
+typedef chunk BIG[NLEN_XXX];     /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_XXX];   /**< Define type DBIG as array of chunks */
+#endif
+
+/* BIG number prototypes */
+
+/**	@brief Tests for BIG equal to zero (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_iszilch(BIG x);
+/**	@brief Tests for BIG equal to one (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if one, else returns 0
+ */
+extern int BIG_isunity(BIG x);
+/**	@brief Tests for DBIG equal to zero (Constant Time)
+ *
+	@param x a DBIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_diszilch(DBIG x);
+/**	@brief Outputs a BIG number to the console (Variable Time)
+ *
+	@param x a BIG number
+ */
+extern void BIG_output(BIG x);
+/**	@brief Outputs a BIG number to the console in raw form (Variable Time for debugging)
+ *
+	@param x a BIG number
+ */
+extern void BIG_rawoutput(BIG x);
+/**	@brief Conditional constant time swap of two BIG numbers
+ *
+	Conditionally swaps parameters in constant time (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s swap takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cswap(BIG x, BIG y, int s);
+/**	@brief Conditional copy of BIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cmove(BIG x, BIG y, int s);
+/**	@brief Conditional copy of DBIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a DBIG number
+	@param y another DBIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_dcmove(BIG x, BIG y, int s);
+/**	@brief Convert from BIG number to byte array (Constant Time)
+ *
+	@param a byte array
+	@param x BIG number
+ */
+extern void BIG_toBytes(char *a, BIG x);
+/**	@brief Convert to BIG number from byte array (Constant Time)
+ *
+	@param x BIG number
+	@param a byte array
+ */
+extern void BIG_fromBytes(BIG x, char *a);
+/**	@brief Convert to BIG number from byte array of given length (Variable Time)
+ *
+	@param x BIG number
+	@param a byte array
+	@param s byte array length
+ */
+extern void BIG_fromBytesLen(BIG x, char *a, int s);
+/**@brief Convert to DBIG number from byte array of given length (Variable Time)
+ *
+   @param x DBIG number
+   @param a byte array
+   @param s byte array length
+ */
+extern void BIG_dfromBytesLen(DBIG x, char *a, int s);
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_doutput(DBIG x); 
+
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_drawoutput(DBIG x);
+
+/**	@brief Copy BIG from Read-Only Memory to a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number in ROM
+ */
+extern void BIG_rcopy(BIG x, const BIG y);
+/**	@brief Copy BIG to another BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_copy(BIG x, BIG y);
+/**	@brief Copy DBIG to another DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_dcopy(DBIG x, DBIG y);
+/**	@brief Copy BIG to upper half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dsucopy(DBIG x, BIG y);
+/**	@brief Copy BIG to lower half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dscopy(DBIG x, BIG y);
+/**	@brief Copy lower half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sdcopy(BIG x, DBIG y);
+/**	@brief Copy upper half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sducopy(BIG x, DBIG y);
+/**	@brief Set BIG to zero (Constant Time)
+ *
+	@param x BIG number to be set to zero  
+ */
+extern void BIG_zero(BIG x);
+/**	@brief Set DBIG to zero (Constant Time)
+ *
+	@param x DBIG number to be set to zero
+ */
+extern void BIG_dzero(DBIG x);
+/**	@brief Set BIG to one (unity) (Constant Time)
+ *
+	@param x BIG number to be set to one.
+ */
+extern void BIG_one(BIG x);
+/**	@brief Set BIG to inverse mod 2^256 (Constant Time)
+ *
+	@param x BIG number to be inverted
+ */
+extern void BIG_invmod2m(BIG x);
+/**	@brief Set BIG to sum of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, sum of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_add(BIG x, BIG y, BIG z);
+
+/**	@brief Set BIG to logical or of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, or of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_or(BIG x, BIG y, BIG z);
+
+/**	@brief Increment BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be incremented
+	@param i integer
+ */
+extern void BIG_inc(BIG x, int i);
+/**	@brief Set BIG to difference of two BIGs (Constant Time)
+ *
+	@param x BIG number, difference of other two - output not normalised
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_sub(BIG x, BIG y, BIG z);
+/**	@brief Decrement BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be decremented
+	@param i integer
+ */
+extern void BIG_dec(BIG x, int i);
+/**	@brief Set DBIG to sum of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, sum of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dadd(DBIG x, DBIG y, DBIG z);
+/**	@brief Set DBIG to difference of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, difference of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dsub(DBIG x, DBIG y, DBIG z);
+/**	@brief Multiply BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_imul(BIG x, BIG y, int i);
+/**	@brief Multiply BIG by not-so-small small integer - output normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+	@return Overflowing bits
+ */
+extern chunk BIG_pmul(BIG x, BIG y, int i);
+/**	@brief Divide BIG by 3 - output normalised (Constant Time)
+ *
+	@param x BIG number
+	@return Remainder
+ */
+extern int BIG_div3(BIG x);
+/**	@brief Multiply BIG by even bigger small integer resulting in a DBIG - output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_pxmul(DBIG x, BIG y, int i);
+/**	@brief Multiply BIG by another BIG resulting in DBIG - inputs normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_mul(DBIG x, BIG y, BIG z);
+/**	@brief Multiply BIG by another BIG resulting in another BIG - inputs normalised and output normalised (Constant Time)
+ *
+	Note that the product must fit into a BIG, and x must be distinct from y and z
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_smul(BIG x, BIG y, BIG z);
+/**	@brief Square BIG resulting in a DBIG - input normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, square of a BIG
+	@param y BIG number to be squared
+ */
+extern void BIG_sqr(DBIG x, BIG y);
+
+/**	@brief Montgomery reduction of a DBIG to a BIG  - input normalised and output normalised (Constant Time)
+ *
+	@param a BIG number, reduction of a BIG
+	@param md BIG number, the modulus
+	@param MC the Montgomery Constant
+	@param d DBIG number to be reduced
+ */
+extern void BIG_monty(BIG a, BIG md, chunk MC, DBIG d);
+
+/**	@brief Shifts a BIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shl(BIG x, int s);
+/**	@brief Fast shifts a BIG left by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Overflow bits
+ */
+extern int BIG_fshl(BIG x, int s);
+/**	@brief Shifts a DBIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshl(DBIG x, int s);
+/**	@brief Shifts a BIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shr(BIG x, int s);
+
+
+/**	@brief Fast time-critical combined shift by 1 bit, subtract and normalise (Constant Time)
+ *
+	@param r BIG number normalised output
+	@param a BIG number to be subtracted from
+	@param m BIG number to be shifted and subtracted
+	@return sign of r
+ */
+extern int BIG_ssn(BIG r, BIG a, BIG m);
+
+/**	@brief Fast shifts a BIG right by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Shifted out bits
+ */
+extern int BIG_fshr(BIG x, int s);
+/**	@brief Shifts a DBIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshr(DBIG x, int s);
+/**	@brief Splits a DBIG into two BIGs - input must be normalised, outputs normalised (Constant Time as used)
+ *
+	Internal function. The value of s must be approximately in the middle of the DBIG.
+	Typically used to extract z mod 2^MODBITS and z/2^MODBITS
+	@param x BIG number, top half of z
+	@param y BIG number, bottom half of z
+	@param z DBIG number to be split in two.
+	@param s Bit position at which to split
+	@return carry-out from top half
+ */
+extern chunk BIG_split(BIG x, BIG y, DBIG z, int s);
+/**	@brief Normalizes a BIG number - output normalised (Constant Time)
+ *
+	All digits of the input BIG are reduced mod 2^BASEBITS
+	@param x BIG number to be normalised
+ */
+extern chunk BIG_norm(BIG x);
+/**	@brief Normalizes a DBIG number - output normalised (Constant Time)
+ *
+	All digits of the input DBIG are reduced mod 2^BASEBITS
+	@param x DBIG number to be normalised
+ */
+extern void BIG_dnorm(DBIG x);
+/**	@brief Compares two BIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first BIG number to be compared
+	@param y second BIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_comp(BIG x, BIG y);
+/**	@brief Compares two DBIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first DBIG number to be compared
+	@param y second DBIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_dcomp(DBIG x, DBIG y);
+/**	@brief Calculate number of bits in a BIG - output normalised (Variable Time)
+ *
+	@param x BIG number
+	@return Number of bits in x
+ */
+extern int BIG_nbits(BIG x);
+/**	@brief Calculate number of bits in a DBIG - output normalised (Variable Time)
+ *
+	@param x DBIG number
+	@return Number of bits in x
+ */
+extern int BIG_dnbits(DBIG x);
+
+/**	@brief Reduce x mod n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctmod(BIG x, BIG n, int bd);
+
+/**	@brief  x=y mod n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctdmod(BIG x, DBIG y, BIG n, int bd);
+
+/**	@brief Divide x by n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctsdiv(BIG x,BIG n,int bd);
+
+/**	@brief  x=y/n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctddiv(BIG x, DBIG y, BIG n,int bd);
+
+
+/**	@brief Reduce x mod n - input and output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+ */
+extern void BIG_mod(BIG x, BIG n);
+/**	@brief Divide x by n - output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+ */
+extern void BIG_sdiv(BIG x, BIG n);
+/**	@brief  x=y mod n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_dmod(BIG x, DBIG y, BIG n);
+/**	@brief  x=y/n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_ddiv(BIG x, DBIG y, BIG n);
+/**	@brief  return parity of BIG, that is the least significant bit (Constant Time)
+ *
+	@param x BIG number
+	@return 0 or 1
+ */
+extern int BIG_parity(BIG x);
+/**	@brief  return i-th of BIG (Constant Time)
+ *
+	@param x BIG number
+	@param i the bit of x to be returned
+	@return 0 or 1
+ */
+extern int BIG_bit(BIG x, int i);
+/**	@brief  return least significant bits of a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param n number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int BIG_lastbits(BIG x, int n);
+/**	@brief  Create a random BIG from a random number generator (Constant Time)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_random(BIG x, csprng *r);
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randomnum(BIG x, BIG n, csprng *r);
+
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus and truncated to max bit length (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param t Maximum bit length
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randtrunc(BIG x, BIG n, int t, csprng *r);
+
+/**	brief  return NAF (Non-Adjacent-Form) value as +/- 1, 3 or 5, inputs must be normalised
+ *
+	Given x and 3*x extracts NAF value from given bit position, and returns number of bits processed, and number of trailing zeros detected if any
+	param x BIG number
+	param x3 BIG number, three times x
+	param i bit position
+	param nbs pointer to integer returning number of bits processed
+	param nzs pointer to integer returning number of trailing 0s
+	return + or - 1, 3 or 5
+*/
+
+/**	@brief  Calculate x=y*z mod n (Variable Time)
+ *
+	Slow method for modular multiplication
+	@param x BIG number, on exit = y*z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modmul(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y/z mod n (Variable Time)
+ *
+	Slow method for modular division
+	@param x BIG number, on exit = y/z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_moddiv(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y^2 mod n (Variable Time)
+ *
+	Slow method for modular squaring
+	@param x BIG number, on exit = y^2 mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modsqr(BIG x, BIG y, BIG n);
+/**	@brief  Calculate x=-y mod n (Variable Time)
+ *
+	Modular negation
+	@param x BIG number, on exit = -y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modneg(BIG x, BIG y, BIG n);
+
+/**	@brief  Calculate x=y+z mod n (Variable Time)
+ *
+	Slow method for modular addition
+	@param x BIG number, on exit = y+z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modadd(BIG x, BIG y, BIG z, BIG n);
+
+/**	@brief  Calculate jacobi Symbol (x/y) (Variable Time)
+ *
+	@param x BIG number
+	@param y BIG number
+	@return Jacobi symbol, -1,0 or 1
+ */
+extern int BIG_jacobi(BIG x, BIG y);
+/**	@brief  Calculate x=1/y mod n (Variable Time)
+ *
+	Modular Inversion - This is slow. Uses binary method.
+	@param x BIG number, on exit = 1/y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_invmodp(BIG x, BIG y, BIG n);
+/** @brief Calculate x=x mod 2^m (Variable Time)
+ *
+	Truncation
+	@param x BIG number, on reduced mod 2^m
+	@param m new truncated size
+*/
+extern void BIG_mod2m(BIG x, int m);
+
+/**	@brief Calculates a*b+c+*d
+ *
+	Calculate partial product of a.b, add in carry c, and add total to d (Constant Time)
+	@param a multiplier
+	@param b multiplicand
+	@param c carry
+	@param d pointer to accumulated bottom half of result
+	@return top half of result
+ */
+
+
+extern int step1(BIG,BIG,BIG);
+extern void step2(BIG,BIG,BIG);
+
+#ifdef dchunk
+
+/* Method required to calculate x*y+c+r, bottom half in r, top half returned */
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    dchunk prod = (dchunk)x * y + c + *r;
+    *r = (chunk)prod & BMASK_XXX;
+    return (chunk)(prod >> BASEBITS_XXX);
+}
+
+#else
+
+/* No integer type available that can store double the wordlength */
+/* accumulate partial products */
+
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    chunk x0, x1, y0, y1;
+    chunk bot, top, mid, carry;
+    x0 = x & HMASK_XXX;
+    x1 = (x >> HBITS_XXX);
+    y0 = y & HMASK_XXX;
+    y1 = (y >> HBITS_XXX);
+    bot = x0 * y0;
+    top = x1 * y1;
+    mid = x0 * y1 + x1 * y0;
+    x0 = mid & HMASK_XXX;
+    x1 = (mid >> HBITS_XXX);
+    bot += x0 << HBITS_XXX;
+    bot += *r;
+    bot += c;
+
+    top += x1;
+    carry = bot >> BASEBITS_XXX;
+    bot &= BMASK_XXX;
+    top += carry;
+
+    *r = bot;
+    return top;
+}
+
+#endif
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/big_B160_56.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/big_B160_56.h
new file mode 100644
index 0000000..369c4c1
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/big_B160_56.h
@@ -0,0 +1,697 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file big.h
+ * @author Mike Scott
+ * @date 23rd February 2016
+ * @brief Big number Header File
+ *
+ *
+ */
+
+#ifndef BIG_B160_56_H
+#define BIG_B160_56_H
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <inttypes.h>
+#include "arch.h"
+#include "core.h"
+#include "config_big_B160_56.h"
+
+using namespace core;
+
+/* could comment this out if code size is a major issue */
+#define UNWOUND
+/* Normally recommended, but may not be optimal for some architectures, for example 32-bit ARM M4 */
+#define USE_KARATSUBA
+
+#define BIGBITS_B160_56 (8*MODBYTES_B160_56)
+#define NLEN_B160_56 (1+((8*MODBYTES_B160_56-1)/BASEBITS_B160_56))
+#define DNLEN_B160_56 2*NLEN_B160_56
+#define BMASK_B160_56 (((chunk)1<<BASEBITS_B160_56)-1) /**< Mask = 2^BASEBITS-1 */
+#define NEXCESS_B160_56 (1<<(CHUNK-BASEBITS_B160_56-1))           /**< 2^(CHUNK-BASEBITS-1) - digit cannot be multiplied by more than this before normalisation */
+
+#define HBITS_B160_56 (BASEBITS_B160_56/2)      /**< Number of bits in number base divided by 2 */
+#define HMASK_B160_56 (((chunk)1<<HBITS_B160_56)-1)    /**< Mask = 2^HBITS-1 */
+
+//#define DEBUG_NORM
+
+#ifdef DEBUG_NORM  /* Add an extra location to track chunk extension */
+#define MPV_B160_56 NLEN_B160_56
+#define MNV_B160_56 (NLEN_B160_56+1)
+#define DMPV_B160_56 DNLEN_B160_56
+#define DMNV_B160_56 (DNLEN_B160_56+1)
+
+#endif
+
+namespace B160_56 {
+
+//extern int BIGMULS;
+//extern int BIGSQRS;
+
+#ifdef DEBUG_NORM
+typedef chunk BIG[NLEN_B160_56 + 2]; /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B160_56 + 2]; /**< Define type DBIG as array of chunks */
+#else
+typedef chunk BIG[NLEN_B160_56];     /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B160_56];   /**< Define type DBIG as array of chunks */
+#endif
+
+/* BIG number prototypes */
+
+/**	@brief Tests for BIG equal to zero (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_iszilch(BIG x);
+/**	@brief Tests for BIG equal to one (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if one, else returns 0
+ */
+extern int BIG_isunity(BIG x);
+/**	@brief Tests for DBIG equal to zero (Constant Time)
+ *
+	@param x a DBIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_diszilch(DBIG x);
+/**	@brief Outputs a BIG number to the console (Variable Time)
+ *
+	@param x a BIG number
+ */
+extern void BIG_output(BIG x);
+/**	@brief Outputs a BIG number to the console in raw form (Variable Time for debugging)
+ *
+	@param x a BIG number
+ */
+extern void BIG_rawoutput(BIG x);
+/**	@brief Conditional constant time swap of two BIG numbers
+ *
+	Conditionally swaps parameters in constant time (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s swap takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cswap(BIG x, BIG y, int s);
+/**	@brief Conditional copy of BIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cmove(BIG x, BIG y, int s);
+/**	@brief Conditional copy of DBIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a DBIG number
+	@param y another DBIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_dcmove(BIG x, BIG y, int s);
+/**	@brief Convert from BIG number to byte array (Constant Time)
+ *
+	@param a byte array
+	@param x BIG number
+ */
+extern void BIG_toBytes(char *a, BIG x);
+/**	@brief Convert to BIG number from byte array (Constant Time)
+ *
+	@param x BIG number
+	@param a byte array
+ */
+extern void BIG_fromBytes(BIG x, char *a);
+/**	@brief Convert to BIG number from byte array of given length (Variable Time)
+ *
+	@param x BIG number
+	@param a byte array
+	@param s byte array length
+ */
+extern void BIG_fromBytesLen(BIG x, char *a, int s);
+/**@brief Convert to DBIG number from byte array of given length (Variable Time)
+ *
+   @param x DBIG number
+   @param a byte array
+   @param s byte array length
+ */
+extern void BIG_dfromBytesLen(DBIG x, char *a, int s);
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_doutput(DBIG x); 
+
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_drawoutput(DBIG x);
+
+/**	@brief Copy BIG from Read-Only Memory to a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number in ROM
+ */
+extern void BIG_rcopy(BIG x, const BIG y);
+/**	@brief Copy BIG to another BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_copy(BIG x, BIG y);
+/**	@brief Copy DBIG to another DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_dcopy(DBIG x, DBIG y);
+/**	@brief Copy BIG to upper half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dsucopy(DBIG x, BIG y);
+/**	@brief Copy BIG to lower half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dscopy(DBIG x, BIG y);
+/**	@brief Copy lower half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sdcopy(BIG x, DBIG y);
+/**	@brief Copy upper half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sducopy(BIG x, DBIG y);
+/**	@brief Set BIG to zero (Constant Time)
+ *
+	@param x BIG number to be set to zero  
+ */
+extern void BIG_zero(BIG x);
+/**	@brief Set DBIG to zero (Constant Time)
+ *
+	@param x DBIG number to be set to zero
+ */
+extern void BIG_dzero(DBIG x);
+/**	@brief Set BIG to one (unity) (Constant Time)
+ *
+	@param x BIG number to be set to one.
+ */
+extern void BIG_one(BIG x);
+/**	@brief Set BIG to inverse mod 2^256 (Constant Time)
+ *
+	@param x BIG number to be inverted
+ */
+extern void BIG_invmod2m(BIG x);
+/**	@brief Set BIG to sum of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, sum of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_add(BIG x, BIG y, BIG z);
+
+/**	@brief Set BIG to logical or of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, or of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_or(BIG x, BIG y, BIG z);
+
+/**	@brief Increment BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be incremented
+	@param i integer
+ */
+extern void BIG_inc(BIG x, int i);
+/**	@brief Set BIG to difference of two BIGs (Constant Time)
+ *
+	@param x BIG number, difference of other two - output not normalised
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_sub(BIG x, BIG y, BIG z);
+/**	@brief Decrement BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be decremented
+	@param i integer
+ */
+extern void BIG_dec(BIG x, int i);
+/**	@brief Set DBIG to sum of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, sum of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dadd(DBIG x, DBIG y, DBIG z);
+/**	@brief Set DBIG to difference of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, difference of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dsub(DBIG x, DBIG y, DBIG z);
+/**	@brief Multiply BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_imul(BIG x, BIG y, int i);
+/**	@brief Multiply BIG by not-so-small small integer - output normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+	@return Overflowing bits
+ */
+extern chunk BIG_pmul(BIG x, BIG y, int i);
+/**	@brief Divide BIG by 3 - output normalised (Constant Time)
+ *
+	@param x BIG number
+	@return Remainder
+ */
+extern int BIG_div3(BIG x);
+/**	@brief Multiply BIG by even bigger small integer resulting in a DBIG - output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_pxmul(DBIG x, BIG y, int i);
+/**	@brief Multiply BIG by another BIG resulting in DBIG - inputs normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_mul(DBIG x, BIG y, BIG z);
+/**	@brief Multiply BIG by another BIG resulting in another BIG - inputs normalised and output normalised (Constant Time)
+ *
+	Note that the product must fit into a BIG, and x must be distinct from y and z
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_smul(BIG x, BIG y, BIG z);
+/**	@brief Square BIG resulting in a DBIG - input normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, square of a BIG
+	@param y BIG number to be squared
+ */
+extern void BIG_sqr(DBIG x, BIG y);
+
+/**	@brief Montgomery reduction of a DBIG to a BIG  - input normalised and output normalised (Constant Time)
+ *
+	@param a BIG number, reduction of a BIG
+	@param md BIG number, the modulus
+	@param MC the Montgomery Constant
+	@param d DBIG number to be reduced
+ */
+extern void BIG_monty(BIG a, BIG md, chunk MC, DBIG d);
+
+/**	@brief Shifts a BIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shl(BIG x, int s);
+/**	@brief Fast shifts a BIG left by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Overflow bits
+ */
+extern int BIG_fshl(BIG x, int s);
+/**	@brief Shifts a DBIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshl(DBIG x, int s);
+/**	@brief Shifts a BIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shr(BIG x, int s);
+
+
+/**	@brief Fast time-critical combined shift by 1 bit, subtract and normalise (Constant Time)
+ *
+	@param r BIG number normalised output
+	@param a BIG number to be subtracted from
+	@param m BIG number to be shifted and subtracted
+	@return sign of r
+ */
+extern int BIG_ssn(BIG r, BIG a, BIG m);
+
+/**	@brief Fast shifts a BIG right by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Shifted out bits
+ */
+extern int BIG_fshr(BIG x, int s);
+/**	@brief Shifts a DBIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshr(DBIG x, int s);
+/**	@brief Splits a DBIG into two BIGs - input must be normalised, outputs normalised (Constant Time as used)
+ *
+	Internal function. The value of s must be approximately in the middle of the DBIG.
+	Typically used to extract z mod 2^MODBITS and z/2^MODBITS
+	@param x BIG number, top half of z
+	@param y BIG number, bottom half of z
+	@param z DBIG number to be split in two.
+	@param s Bit position at which to split
+	@return carry-out from top half
+ */
+extern chunk BIG_split(BIG x, BIG y, DBIG z, int s);
+/**	@brief Normalizes a BIG number - output normalised (Constant Time)
+ *
+	All digits of the input BIG are reduced mod 2^BASEBITS
+	@param x BIG number to be normalised
+ */
+extern chunk BIG_norm(BIG x);
+/**	@brief Normalizes a DBIG number - output normalised (Constant Time)
+ *
+	All digits of the input DBIG are reduced mod 2^BASEBITS
+	@param x DBIG number to be normalised
+ */
+extern void BIG_dnorm(DBIG x);
+/**	@brief Compares two BIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first BIG number to be compared
+	@param y second BIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_comp(BIG x, BIG y);
+/**	@brief Compares two DBIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first DBIG number to be compared
+	@param y second DBIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_dcomp(DBIG x, DBIG y);
+/**	@brief Calculate number of bits in a BIG - output normalised (Variable Time)
+ *
+	@param x BIG number
+	@return Number of bits in x
+ */
+extern int BIG_nbits(BIG x);
+/**	@brief Calculate number of bits in a DBIG - output normalised (Variable Time)
+ *
+	@param x DBIG number
+	@return Number of bits in x
+ */
+extern int BIG_dnbits(DBIG x);
+
+/**	@brief Reduce x mod n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctmod(BIG x, BIG n, int bd);
+
+/**	@brief  x=y mod n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctdmod(BIG x, DBIG y, BIG n, int bd);
+
+/**	@brief Divide x by n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctsdiv(BIG x,BIG n,int bd);
+
+/**	@brief  x=y/n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctddiv(BIG x, DBIG y, BIG n,int bd);
+
+
+/**	@brief Reduce x mod n - input and output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+ */
+extern void BIG_mod(BIG x, BIG n);
+/**	@brief Divide x by n - output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+ */
+extern void BIG_sdiv(BIG x, BIG n);
+/**	@brief  x=y mod n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_dmod(BIG x, DBIG y, BIG n);
+/**	@brief  x=y/n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_ddiv(BIG x, DBIG y, BIG n);
+/**	@brief  return parity of BIG, that is the least significant bit (Constant Time)
+ *
+	@param x BIG number
+	@return 0 or 1
+ */
+extern int BIG_parity(BIG x);
+/**	@brief  return i-th of BIG (Constant Time)
+ *
+	@param x BIG number
+	@param i the bit of x to be returned
+	@return 0 or 1
+ */
+extern int BIG_bit(BIG x, int i);
+/**	@brief  return least significant bits of a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param n number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int BIG_lastbits(BIG x, int n);
+/**	@brief  Create a random BIG from a random number generator (Constant Time)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_random(BIG x, csprng *r);
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randomnum(BIG x, BIG n, csprng *r);
+
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus and truncated to max bit length (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param t Maximum bit length
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randtrunc(BIG x, BIG n, int t, csprng *r);
+
+/**	brief  return NAF (Non-Adjacent-Form) value as +/- 1, 3 or 5, inputs must be normalised
+ *
+	Given x and 3*x extracts NAF value from given bit position, and returns number of bits processed, and number of trailing zeros detected if any
+	param x BIG number
+	param x3 BIG number, three times x
+	param i bit position
+	param nbs pointer to integer returning number of bits processed
+	param nzs pointer to integer returning number of trailing 0s
+	return + or - 1, 3 or 5
+*/
+
+/**	@brief  Calculate x=y*z mod n (Variable Time)
+ *
+	Slow method for modular multiplication
+	@param x BIG number, on exit = y*z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modmul(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y/z mod n (Variable Time)
+ *
+	Slow method for modular division
+	@param x BIG number, on exit = y/z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_moddiv(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y^2 mod n (Variable Time)
+ *
+	Slow method for modular squaring
+	@param x BIG number, on exit = y^2 mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modsqr(BIG x, BIG y, BIG n);
+/**	@brief  Calculate x=-y mod n (Variable Time)
+ *
+	Modular negation
+	@param x BIG number, on exit = -y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modneg(BIG x, BIG y, BIG n);
+
+/**	@brief  Calculate x=y+z mod n (Variable Time)
+ *
+	Slow method for modular addition
+	@param x BIG number, on exit = y+z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modadd(BIG x, BIG y, BIG z, BIG n);
+
+/**	@brief  Calculate jacobi Symbol (x/y) (Variable Time)
+ *
+	@param x BIG number
+	@param y BIG number
+	@return Jacobi symbol, -1,0 or 1
+ */
+extern int BIG_jacobi(BIG x, BIG y);
+/**	@brief  Calculate x=1/y mod n (Variable Time)
+ *
+	Modular Inversion - This is slow. Uses binary method.
+	@param x BIG number, on exit = 1/y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_invmodp(BIG x, BIG y, BIG n);
+/** @brief Calculate x=x mod 2^m (Variable Time)
+ *
+	Truncation
+	@param x BIG number, on reduced mod 2^m
+	@param m new truncated size
+*/
+extern void BIG_mod2m(BIG x, int m);
+
+/**	@brief Calculates a*b+c+*d
+ *
+	Calculate partial product of a.b, add in carry c, and add total to d (Constant Time)
+	@param a multiplier
+	@param b multiplicand
+	@param c carry
+	@param d pointer to accumulated bottom half of result
+	@return top half of result
+ */
+
+
+extern int step1(BIG,BIG,BIG);
+extern void step2(BIG,BIG,BIG);
+
+#ifdef dchunk
+
+/* Method required to calculate x*y+c+r, bottom half in r, top half returned */
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    dchunk prod = (dchunk)x * y + c + *r;
+    *r = (chunk)prod & BMASK_B160_56;
+    return (chunk)(prod >> BASEBITS_B160_56);
+}
+
+#else
+
+/* No integer type available that can store double the wordlength */
+/* accumulate partial products */
+
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    chunk x0, x1, y0, y1;
+    chunk bot, top, mid, carry;
+    x0 = x & HMASK_B160_56;
+    x1 = (x >> HBITS_B160_56);
+    y0 = y & HMASK_B160_56;
+    y1 = (y >> HBITS_B160_56);
+    bot = x0 * y0;
+    top = x1 * y1;
+    mid = x0 * y1 + x1 * y0;
+    x0 = mid & HMASK_B160_56;
+    x1 = (mid >> HBITS_B160_56);
+    bot += x0 << HBITS_B160_56;
+    bot += *r;
+    bot += c;
+
+    top += x1;
+    carry = bot >> BASEBITS_B160_56;
+    bot &= BMASK_B160_56;
+    top += carry;
+
+    *r = bot;
+    return top;
+}
+
+#endif
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/big_B168_60.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/big_B168_60.h
new file mode 100644
index 0000000..0a57612
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/big_B168_60.h
@@ -0,0 +1,697 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file big.h
+ * @author Mike Scott
+ * @date 23rd February 2016
+ * @brief Big number Header File
+ *
+ *
+ */
+
+#ifndef BIG_B168_60_H
+#define BIG_B168_60_H
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <inttypes.h>
+#include "arch.h"
+#include "core.h"
+#include "config_big_B168_60.h"
+
+using namespace core;
+
+/* could comment this out if code size is a major issue */
+#define UNWOUND
+/* Normally recommended, but may not be optimal for some architectures, for example 32-bit ARM M4 */
+#define USE_KARATSUBA
+
+#define BIGBITS_B168_60 (8*MODBYTES_B168_60)
+#define NLEN_B168_60 (1+((8*MODBYTES_B168_60-1)/BASEBITS_B168_60))
+#define DNLEN_B168_60 2*NLEN_B168_60
+#define BMASK_B168_60 (((chunk)1<<BASEBITS_B168_60)-1) /**< Mask = 2^BASEBITS-1 */
+#define NEXCESS_B168_60 (1<<(CHUNK-BASEBITS_B168_60-1))           /**< 2^(CHUNK-BASEBITS-1) - digit cannot be multiplied by more than this before normalisation */
+
+#define HBITS_B168_60 (BASEBITS_B168_60/2)      /**< Number of bits in number base divided by 2 */
+#define HMASK_B168_60 (((chunk)1<<HBITS_B168_60)-1)    /**< Mask = 2^HBITS-1 */
+
+//#define DEBUG_NORM
+
+#ifdef DEBUG_NORM  /* Add an extra location to track chunk extension */
+#define MPV_B168_60 NLEN_B168_60
+#define MNV_B168_60 (NLEN_B168_60+1)
+#define DMPV_B168_60 DNLEN_B168_60
+#define DMNV_B168_60 (DNLEN_B168_60+1)
+
+#endif
+
+namespace B168_60 {
+
+//extern int BIGMULS;
+//extern int BIGSQRS;
+
+#ifdef DEBUG_NORM
+typedef chunk BIG[NLEN_B168_60 + 2]; /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B168_60 + 2]; /**< Define type DBIG as array of chunks */
+#else
+typedef chunk BIG[NLEN_B168_60];     /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B168_60];   /**< Define type DBIG as array of chunks */
+#endif
+
+/* BIG number prototypes */
+
+/**	@brief Tests for BIG equal to zero (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_iszilch(BIG x);
+/**	@brief Tests for BIG equal to one (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if one, else returns 0
+ */
+extern int BIG_isunity(BIG x);
+/**	@brief Tests for DBIG equal to zero (Constant Time)
+ *
+	@param x a DBIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_diszilch(DBIG x);
+/**	@brief Outputs a BIG number to the console (Variable Time)
+ *
+	@param x a BIG number
+ */
+extern void BIG_output(BIG x);
+/**	@brief Outputs a BIG number to the console in raw form (Variable Time for debugging)
+ *
+	@param x a BIG number
+ */
+extern void BIG_rawoutput(BIG x);
+/**	@brief Conditional constant time swap of two BIG numbers
+ *
+	Conditionally swaps parameters in constant time (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s swap takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cswap(BIG x, BIG y, int s);
+/**	@brief Conditional copy of BIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cmove(BIG x, BIG y, int s);
+/**	@brief Conditional copy of DBIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a DBIG number
+	@param y another DBIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_dcmove(BIG x, BIG y, int s);
+/**	@brief Convert from BIG number to byte array (Constant Time)
+ *
+	@param a byte array
+	@param x BIG number
+ */
+extern void BIG_toBytes(char *a, BIG x);
+/**	@brief Convert to BIG number from byte array (Constant Time)
+ *
+	@param x BIG number
+	@param a byte array
+ */
+extern void BIG_fromBytes(BIG x, char *a);
+/**	@brief Convert to BIG number from byte array of given length (Variable Time)
+ *
+	@param x BIG number
+	@param a byte array
+	@param s byte array length
+ */
+extern void BIG_fromBytesLen(BIG x, char *a, int s);
+/**@brief Convert to DBIG number from byte array of given length (Variable Time)
+ *
+   @param x DBIG number
+   @param a byte array
+   @param s byte array length
+ */
+extern void BIG_dfromBytesLen(DBIG x, char *a, int s);
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_doutput(DBIG x); 
+
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_drawoutput(DBIG x);
+
+/**	@brief Copy BIG from Read-Only Memory to a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number in ROM
+ */
+extern void BIG_rcopy(BIG x, const BIG y);
+/**	@brief Copy BIG to another BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_copy(BIG x, BIG y);
+/**	@brief Copy DBIG to another DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_dcopy(DBIG x, DBIG y);
+/**	@brief Copy BIG to upper half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dsucopy(DBIG x, BIG y);
+/**	@brief Copy BIG to lower half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dscopy(DBIG x, BIG y);
+/**	@brief Copy lower half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sdcopy(BIG x, DBIG y);
+/**	@brief Copy upper half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sducopy(BIG x, DBIG y);
+/**	@brief Set BIG to zero (Constant Time)
+ *
+	@param x BIG number to be set to zero  
+ */
+extern void BIG_zero(BIG x);
+/**	@brief Set DBIG to zero (Constant Time)
+ *
+	@param x DBIG number to be set to zero
+ */
+extern void BIG_dzero(DBIG x);
+/**	@brief Set BIG to one (unity) (Constant Time)
+ *
+	@param x BIG number to be set to one.
+ */
+extern void BIG_one(BIG x);
+/**	@brief Set BIG to inverse mod 2^256 (Constant Time)
+ *
+	@param x BIG number to be inverted
+ */
+extern void BIG_invmod2m(BIG x);
+/**	@brief Set BIG to sum of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, sum of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_add(BIG x, BIG y, BIG z);
+
+/**	@brief Set BIG to logical or of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, or of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_or(BIG x, BIG y, BIG z);
+
+/**	@brief Increment BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be incremented
+	@param i integer
+ */
+extern void BIG_inc(BIG x, int i);
+/**	@brief Set BIG to difference of two BIGs (Constant Time)
+ *
+	@param x BIG number, difference of other two - output not normalised
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_sub(BIG x, BIG y, BIG z);
+/**	@brief Decrement BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be decremented
+	@param i integer
+ */
+extern void BIG_dec(BIG x, int i);
+/**	@brief Set DBIG to sum of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, sum of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dadd(DBIG x, DBIG y, DBIG z);
+/**	@brief Set DBIG to difference of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, difference of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dsub(DBIG x, DBIG y, DBIG z);
+/**	@brief Multiply BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_imul(BIG x, BIG y, int i);
+/**	@brief Multiply BIG by not-so-small small integer - output normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+	@return Overflowing bits
+ */
+extern chunk BIG_pmul(BIG x, BIG y, int i);
+/**	@brief Divide BIG by 3 - output normalised (Constant Time)
+ *
+	@param x BIG number
+	@return Remainder
+ */
+extern int BIG_div3(BIG x);
+/**	@brief Multiply BIG by even bigger small integer resulting in a DBIG - output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_pxmul(DBIG x, BIG y, int i);
+/**	@brief Multiply BIG by another BIG resulting in DBIG - inputs normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_mul(DBIG x, BIG y, BIG z);
+/**	@brief Multiply BIG by another BIG resulting in another BIG - inputs normalised and output normalised (Constant Time)
+ *
+	Note that the product must fit into a BIG, and x must be distinct from y and z
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_smul(BIG x, BIG y, BIG z);
+/**	@brief Square BIG resulting in a DBIG - input normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, square of a BIG
+	@param y BIG number to be squared
+ */
+extern void BIG_sqr(DBIG x, BIG y);
+
+/**	@brief Montgomery reduction of a DBIG to a BIG  - input normalised and output normalised (Constant Time)
+ *
+	@param a BIG number, reduction of a BIG
+	@param md BIG number, the modulus
+	@param MC the Montgomery Constant
+	@param d DBIG number to be reduced
+ */
+extern void BIG_monty(BIG a, BIG md, chunk MC, DBIG d);
+
+/**	@brief Shifts a BIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shl(BIG x, int s);
+/**	@brief Fast shifts a BIG left by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Overflow bits
+ */
+extern int BIG_fshl(BIG x, int s);
+/**	@brief Shifts a DBIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshl(DBIG x, int s);
+/**	@brief Shifts a BIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shr(BIG x, int s);
+
+
+/**	@brief Fast time-critical combined shift by 1 bit, subtract and normalise (Constant Time)
+ *
+	@param r BIG number normalised output
+	@param a BIG number to be subtracted from
+	@param m BIG number to be shifted and subtracted
+	@return sign of r
+ */
+extern int BIG_ssn(BIG r, BIG a, BIG m);
+
+/**	@brief Fast shifts a BIG right by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Shifted out bits
+ */
+extern int BIG_fshr(BIG x, int s);
+/**	@brief Shifts a DBIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshr(DBIG x, int s);
+/**	@brief Splits a DBIG into two BIGs - input must be normalised, outputs normalised (Constant Time as used)
+ *
+	Internal function. The value of s must be approximately in the middle of the DBIG.
+	Typically used to extract z mod 2^MODBITS and z/2^MODBITS
+	@param x BIG number, top half of z
+	@param y BIG number, bottom half of z
+	@param z DBIG number to be split in two.
+	@param s Bit position at which to split
+	@return carry-out from top half
+ */
+extern chunk BIG_split(BIG x, BIG y, DBIG z, int s);
+/**	@brief Normalizes a BIG number - output normalised (Constant Time)
+ *
+	All digits of the input BIG are reduced mod 2^BASEBITS
+	@param x BIG number to be normalised
+ */
+extern chunk BIG_norm(BIG x);
+/**	@brief Normalizes a DBIG number - output normalised (Constant Time)
+ *
+	All digits of the input DBIG are reduced mod 2^BASEBITS
+	@param x DBIG number to be normalised
+ */
+extern void BIG_dnorm(DBIG x);
+/**	@brief Compares two BIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first BIG number to be compared
+	@param y second BIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_comp(BIG x, BIG y);
+/**	@brief Compares two DBIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first DBIG number to be compared
+	@param y second DBIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_dcomp(DBIG x, DBIG y);
+/**	@brief Calculate number of bits in a BIG - output normalised (Variable Time)
+ *
+	@param x BIG number
+	@return Number of bits in x
+ */
+extern int BIG_nbits(BIG x);
+/**	@brief Calculate number of bits in a DBIG - output normalised (Variable Time)
+ *
+	@param x DBIG number
+	@return Number of bits in x
+ */
+extern int BIG_dnbits(DBIG x);
+
+/**	@brief Reduce x mod n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctmod(BIG x, BIG n, int bd);
+
+/**	@brief  x=y mod n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctdmod(BIG x, DBIG y, BIG n, int bd);
+
+/**	@brief Divide x by n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctsdiv(BIG x,BIG n,int bd);
+
+/**	@brief  x=y/n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctddiv(BIG x, DBIG y, BIG n,int bd);
+
+
+/**	@brief Reduce x mod n - input and output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+ */
+extern void BIG_mod(BIG x, BIG n);
+/**	@brief Divide x by n - output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+ */
+extern void BIG_sdiv(BIG x, BIG n);
+/**	@brief  x=y mod n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_dmod(BIG x, DBIG y, BIG n);
+/**	@brief  x=y/n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_ddiv(BIG x, DBIG y, BIG n);
+/**	@brief  return parity of BIG, that is the least significant bit (Constant Time)
+ *
+	@param x BIG number
+	@return 0 or 1
+ */
+extern int BIG_parity(BIG x);
+/**	@brief  return i-th of BIG (Constant Time)
+ *
+	@param x BIG number
+	@param i the bit of x to be returned
+	@return 0 or 1
+ */
+extern int BIG_bit(BIG x, int i);
+/**	@brief  return least significant bits of a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param n number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int BIG_lastbits(BIG x, int n);
+/**	@brief  Create a random BIG from a random number generator (Constant Time)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_random(BIG x, csprng *r);
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randomnum(BIG x, BIG n, csprng *r);
+
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus and truncated to max bit length (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param t Maximum bit length
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randtrunc(BIG x, BIG n, int t, csprng *r);
+
+/**	brief  return NAF (Non-Adjacent-Form) value as +/- 1, 3 or 5, inputs must be normalised
+ *
+	Given x and 3*x extracts NAF value from given bit position, and returns number of bits processed, and number of trailing zeros detected if any
+	param x BIG number
+	param x3 BIG number, three times x
+	param i bit position
+	param nbs pointer to integer returning number of bits processed
+	param nzs pointer to integer returning number of trailing 0s
+	return + or - 1, 3 or 5
+*/
+
+/**	@brief  Calculate x=y*z mod n (Variable Time)
+ *
+	Slow method for modular multiplication
+	@param x BIG number, on exit = y*z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modmul(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y/z mod n (Variable Time)
+ *
+	Slow method for modular division
+	@param x BIG number, on exit = y/z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_moddiv(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y^2 mod n (Variable Time)
+ *
+	Slow method for modular squaring
+	@param x BIG number, on exit = y^2 mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modsqr(BIG x, BIG y, BIG n);
+/**	@brief  Calculate x=-y mod n (Variable Time)
+ *
+	Modular negation
+	@param x BIG number, on exit = -y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modneg(BIG x, BIG y, BIG n);
+
+/**	@brief  Calculate x=y+z mod n (Variable Time)
+ *
+	Slow method for modular addition
+	@param x BIG number, on exit = y+z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modadd(BIG x, BIG y, BIG z, BIG n);
+
+/**	@brief  Calculate jacobi Symbol (x/y) (Variable Time)
+ *
+	@param x BIG number
+	@param y BIG number
+	@return Jacobi symbol, -1,0 or 1
+ */
+extern int BIG_jacobi(BIG x, BIG y);
+/**	@brief  Calculate x=1/y mod n (Variable Time)
+ *
+	Modular Inversion - This is slow. Uses binary method.
+	@param x BIG number, on exit = 1/y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_invmodp(BIG x, BIG y, BIG n);
+/** @brief Calculate x=x mod 2^m (Variable Time)
+ *
+	Truncation
+	@param x BIG number, on reduced mod 2^m
+	@param m new truncated size
+*/
+extern void BIG_mod2m(BIG x, int m);
+
+/**	@brief Calculates a*b+c+*d
+ *
+	Calculate partial product of a.b, add in carry c, and add total to d (Constant Time)
+	@param a multiplier
+	@param b multiplicand
+	@param c carry
+	@param d pointer to accumulated bottom half of result
+	@return top half of result
+ */
+
+
+extern int step1(BIG,BIG,BIG);
+extern void step2(BIG,BIG,BIG);
+
+#ifdef dchunk
+
+/* Method required to calculate x*y+c+r, bottom half in r, top half returned */
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    dchunk prod = (dchunk)x * y + c + *r;
+    *r = (chunk)prod & BMASK_B168_60;
+    return (chunk)(prod >> BASEBITS_B168_60);
+}
+
+#else
+
+/* No integer type available that can store double the wordlength */
+/* accumulate partial products */
+
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    chunk x0, x1, y0, y1;
+    chunk bot, top, mid, carry;
+    x0 = x & HMASK_B168_60;
+    x1 = (x >> HBITS_B168_60);
+    y0 = y & HMASK_B168_60;
+    y1 = (y >> HBITS_B168_60);
+    bot = x0 * y0;
+    top = x1 * y1;
+    mid = x0 * y1 + x1 * y0;
+    x0 = mid & HMASK_B168_60;
+    x1 = (mid >> HBITS_B168_60);
+    bot += x0 << HBITS_B168_60;
+    bot += *r;
+    bot += c;
+
+    top += x1;
+    carry = bot >> BASEBITS_B168_60;
+    bot &= BMASK_B168_60;
+    top += carry;
+
+    *r = bot;
+    return top;
+}
+
+#endif
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/big_B256_56.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/big_B256_56.h
new file mode 100644
index 0000000..c16e9a1
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/big_B256_56.h
@@ -0,0 +1,697 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file big.h
+ * @author Mike Scott
+ * @date 23rd February 2016
+ * @brief Big number Header File
+ *
+ *
+ */
+
+#ifndef BIG_B256_56_H
+#define BIG_B256_56_H
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <inttypes.h>
+#include "arch.h"
+#include "core.h"
+#include "config_big_B256_56.h"
+
+using namespace core;
+
+/* could comment this out if code size is a major issue */
+#define UNWOUND
+/* Normally recommended, but may not be optimal for some architectures, for example 32-bit ARM M4 */
+#define USE_KARATSUBA
+
+#define BIGBITS_B256_56 (8*MODBYTES_B256_56)
+#define NLEN_B256_56 (1+((8*MODBYTES_B256_56-1)/BASEBITS_B256_56))
+#define DNLEN_B256_56 2*NLEN_B256_56
+#define BMASK_B256_56 (((chunk)1<<BASEBITS_B256_56)-1) /**< Mask = 2^BASEBITS-1 */
+#define NEXCESS_B256_56 (1<<(CHUNK-BASEBITS_B256_56-1))           /**< 2^(CHUNK-BASEBITS-1) - digit cannot be multiplied by more than this before normalisation */
+
+#define HBITS_B256_56 (BASEBITS_B256_56/2)      /**< Number of bits in number base divided by 2 */
+#define HMASK_B256_56 (((chunk)1<<HBITS_B256_56)-1)    /**< Mask = 2^HBITS-1 */
+
+//#define DEBUG_NORM
+
+#ifdef DEBUG_NORM  /* Add an extra location to track chunk extension */
+#define MPV_B256_56 NLEN_B256_56
+#define MNV_B256_56 (NLEN_B256_56+1)
+#define DMPV_B256_56 DNLEN_B256_56
+#define DMNV_B256_56 (DNLEN_B256_56+1)
+
+#endif
+
+namespace B256_56 {
+
+//extern int BIGMULS;
+//extern int BIGSQRS;
+
+#ifdef DEBUG_NORM
+typedef chunk BIG[NLEN_B256_56 + 2]; /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B256_56 + 2]; /**< Define type DBIG as array of chunks */
+#else
+typedef chunk BIG[NLEN_B256_56];     /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B256_56];   /**< Define type DBIG as array of chunks */
+#endif
+
+/* BIG number prototypes */
+
+/**	@brief Tests for BIG equal to zero (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_iszilch(BIG x);
+/**	@brief Tests for BIG equal to one (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if one, else returns 0
+ */
+extern int BIG_isunity(BIG x);
+/**	@brief Tests for DBIG equal to zero (Constant Time)
+ *
+	@param x a DBIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_diszilch(DBIG x);
+/**	@brief Outputs a BIG number to the console (Variable Time)
+ *
+	@param x a BIG number
+ */
+extern void BIG_output(BIG x);
+/**	@brief Outputs a BIG number to the console in raw form (Variable Time for debugging)
+ *
+	@param x a BIG number
+ */
+extern void BIG_rawoutput(BIG x);
+/**	@brief Conditional constant time swap of two BIG numbers
+ *
+	Conditionally swaps parameters in constant time (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s swap takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cswap(BIG x, BIG y, int s);
+/**	@brief Conditional copy of BIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cmove(BIG x, BIG y, int s);
+/**	@brief Conditional copy of DBIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a DBIG number
+	@param y another DBIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_dcmove(BIG x, BIG y, int s);
+/**	@brief Convert from BIG number to byte array (Constant Time)
+ *
+	@param a byte array
+	@param x BIG number
+ */
+extern void BIG_toBytes(char *a, BIG x);
+/**	@brief Convert to BIG number from byte array (Constant Time)
+ *
+	@param x BIG number
+	@param a byte array
+ */
+extern void BIG_fromBytes(BIG x, char *a);
+/**	@brief Convert to BIG number from byte array of given length (Variable Time)
+ *
+	@param x BIG number
+	@param a byte array
+	@param s byte array length
+ */
+extern void BIG_fromBytesLen(BIG x, char *a, int s);
+/**@brief Convert to DBIG number from byte array of given length (Variable Time)
+ *
+   @param x DBIG number
+   @param a byte array
+   @param s byte array length
+ */
+extern void BIG_dfromBytesLen(DBIG x, char *a, int s);
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_doutput(DBIG x); 
+
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_drawoutput(DBIG x);
+
+/**	@brief Copy BIG from Read-Only Memory to a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number in ROM
+ */
+extern void BIG_rcopy(BIG x, const BIG y);
+/**	@brief Copy BIG to another BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_copy(BIG x, BIG y);
+/**	@brief Copy DBIG to another DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_dcopy(DBIG x, DBIG y);
+/**	@brief Copy BIG to upper half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dsucopy(DBIG x, BIG y);
+/**	@brief Copy BIG to lower half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dscopy(DBIG x, BIG y);
+/**	@brief Copy lower half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sdcopy(BIG x, DBIG y);
+/**	@brief Copy upper half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sducopy(BIG x, DBIG y);
+/**	@brief Set BIG to zero (Constant Time)
+ *
+	@param x BIG number to be set to zero  
+ */
+extern void BIG_zero(BIG x);
+/**	@brief Set DBIG to zero (Constant Time)
+ *
+	@param x DBIG number to be set to zero
+ */
+extern void BIG_dzero(DBIG x);
+/**	@brief Set BIG to one (unity) (Constant Time)
+ *
+	@param x BIG number to be set to one.
+ */
+extern void BIG_one(BIG x);
+/**	@brief Set BIG to inverse mod 2^256 (Constant Time)
+ *
+	@param x BIG number to be inverted
+ */
+extern void BIG_invmod2m(BIG x);
+/**	@brief Set BIG to sum of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, sum of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_add(BIG x, BIG y, BIG z);
+
+/**	@brief Set BIG to logical or of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, or of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_or(BIG x, BIG y, BIG z);
+
+/**	@brief Increment BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be incremented
+	@param i integer
+ */
+extern void BIG_inc(BIG x, int i);
+/**	@brief Set BIG to difference of two BIGs (Constant Time)
+ *
+	@param x BIG number, difference of other two - output not normalised
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_sub(BIG x, BIG y, BIG z);
+/**	@brief Decrement BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be decremented
+	@param i integer
+ */
+extern void BIG_dec(BIG x, int i);
+/**	@brief Set DBIG to sum of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, sum of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dadd(DBIG x, DBIG y, DBIG z);
+/**	@brief Set DBIG to difference of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, difference of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dsub(DBIG x, DBIG y, DBIG z);
+/**	@brief Multiply BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_imul(BIG x, BIG y, int i);
+/**	@brief Multiply BIG by not-so-small small integer - output normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+	@return Overflowing bits
+ */
+extern chunk BIG_pmul(BIG x, BIG y, int i);
+/**	@brief Divide BIG by 3 - output normalised (Constant Time)
+ *
+	@param x BIG number
+	@return Remainder
+ */
+extern int BIG_div3(BIG x);
+/**	@brief Multiply BIG by even bigger small integer resulting in a DBIG - output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_pxmul(DBIG x, BIG y, int i);
+/**	@brief Multiply BIG by another BIG resulting in DBIG - inputs normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_mul(DBIG x, BIG y, BIG z);
+/**	@brief Multiply BIG by another BIG resulting in another BIG - inputs normalised and output normalised (Constant Time)
+ *
+	Note that the product must fit into a BIG, and x must be distinct from y and z
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_smul(BIG x, BIG y, BIG z);
+/**	@brief Square BIG resulting in a DBIG - input normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, square of a BIG
+	@param y BIG number to be squared
+ */
+extern void BIG_sqr(DBIG x, BIG y);
+
+/**	@brief Montgomery reduction of a DBIG to a BIG  - input normalised and output normalised (Constant Time)
+ *
+	@param a BIG number, reduction of a BIG
+	@param md BIG number, the modulus
+	@param MC the Montgomery Constant
+	@param d DBIG number to be reduced
+ */
+extern void BIG_monty(BIG a, BIG md, chunk MC, DBIG d);
+
+/**	@brief Shifts a BIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shl(BIG x, int s);
+/**	@brief Fast shifts a BIG left by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Overflow bits
+ */
+extern int BIG_fshl(BIG x, int s);
+/**	@brief Shifts a DBIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshl(DBIG x, int s);
+/**	@brief Shifts a BIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shr(BIG x, int s);
+
+
+/**	@brief Fast time-critical combined shift by 1 bit, subtract and normalise (Constant Time)
+ *
+	@param r BIG number normalised output
+	@param a BIG number to be subtracted from
+	@param m BIG number to be shifted and subtracted
+	@return sign of r
+ */
+extern int BIG_ssn(BIG r, BIG a, BIG m);
+
+/**	@brief Fast shifts a BIG right by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Shifted out bits
+ */
+extern int BIG_fshr(BIG x, int s);
+/**	@brief Shifts a DBIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshr(DBIG x, int s);
+/**	@brief Splits a DBIG into two BIGs - input must be normalised, outputs normalised (Constant Time as used)
+ *
+	Internal function. The value of s must be approximately in the middle of the DBIG.
+	Typically used to extract z mod 2^MODBITS and z/2^MODBITS
+	@param x BIG number, top half of z
+	@param y BIG number, bottom half of z
+	@param z DBIG number to be split in two.
+	@param s Bit position at which to split
+	@return carry-out from top half
+ */
+extern chunk BIG_split(BIG x, BIG y, DBIG z, int s);
+/**	@brief Normalizes a BIG number - output normalised (Constant Time)
+ *
+	All digits of the input BIG are reduced mod 2^BASEBITS
+	@param x BIG number to be normalised
+ */
+extern chunk BIG_norm(BIG x);
+/**	@brief Normalizes a DBIG number - output normalised (Constant Time)
+ *
+	All digits of the input DBIG are reduced mod 2^BASEBITS
+	@param x DBIG number to be normalised
+ */
+extern void BIG_dnorm(DBIG x);
+/**	@brief Compares two BIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first BIG number to be compared
+	@param y second BIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_comp(BIG x, BIG y);
+/**	@brief Compares two DBIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first DBIG number to be compared
+	@param y second DBIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_dcomp(DBIG x, DBIG y);
+/**	@brief Calculate number of bits in a BIG - output normalised (Variable Time)
+ *
+	@param x BIG number
+	@return Number of bits in x
+ */
+extern int BIG_nbits(BIG x);
+/**	@brief Calculate number of bits in a DBIG - output normalised (Variable Time)
+ *
+	@param x DBIG number
+	@return Number of bits in x
+ */
+extern int BIG_dnbits(DBIG x);
+
+/**	@brief Reduce x mod n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctmod(BIG x, BIG n, int bd);
+
+/**	@brief  x=y mod n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctdmod(BIG x, DBIG y, BIG n, int bd);
+
+/**	@brief Divide x by n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctsdiv(BIG x,BIG n,int bd);
+
+/**	@brief  x=y/n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctddiv(BIG x, DBIG y, BIG n,int bd);
+
+
+/**	@brief Reduce x mod n - input and output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+ */
+extern void BIG_mod(BIG x, BIG n);
+/**	@brief Divide x by n - output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+ */
+extern void BIG_sdiv(BIG x, BIG n);
+/**	@brief  x=y mod n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_dmod(BIG x, DBIG y, BIG n);
+/**	@brief  x=y/n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_ddiv(BIG x, DBIG y, BIG n);
+/**	@brief  return parity of BIG, that is the least significant bit (Constant Time)
+ *
+	@param x BIG number
+	@return 0 or 1
+ */
+extern int BIG_parity(BIG x);
+/**	@brief  return i-th of BIG (Constant Time)
+ *
+	@param x BIG number
+	@param i the bit of x to be returned
+	@return 0 or 1
+ */
+extern int BIG_bit(BIG x, int i);
+/**	@brief  return least significant bits of a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param n number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int BIG_lastbits(BIG x, int n);
+/**	@brief  Create a random BIG from a random number generator (Constant Time)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_random(BIG x, csprng *r);
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randomnum(BIG x, BIG n, csprng *r);
+
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus and truncated to max bit length (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param t Maximum bit length
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randtrunc(BIG x, BIG n, int t, csprng *r);
+
+/**	brief  return NAF (Non-Adjacent-Form) value as +/- 1, 3 or 5, inputs must be normalised
+ *
+	Given x and 3*x extracts NAF value from given bit position, and returns number of bits processed, and number of trailing zeros detected if any
+	param x BIG number
+	param x3 BIG number, three times x
+	param i bit position
+	param nbs pointer to integer returning number of bits processed
+	param nzs pointer to integer returning number of trailing 0s
+	return + or - 1, 3 or 5
+*/
+
+/**	@brief  Calculate x=y*z mod n (Variable Time)
+ *
+	Slow method for modular multiplication
+	@param x BIG number, on exit = y*z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modmul(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y/z mod n (Variable Time)
+ *
+	Slow method for modular division
+	@param x BIG number, on exit = y/z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_moddiv(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y^2 mod n (Variable Time)
+ *
+	Slow method for modular squaring
+	@param x BIG number, on exit = y^2 mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modsqr(BIG x, BIG y, BIG n);
+/**	@brief  Calculate x=-y mod n (Variable Time)
+ *
+	Modular negation
+	@param x BIG number, on exit = -y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modneg(BIG x, BIG y, BIG n);
+
+/**	@brief  Calculate x=y+z mod n (Variable Time)
+ *
+	Slow method for modular addition
+	@param x BIG number, on exit = y+z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modadd(BIG x, BIG y, BIG z, BIG n);
+
+/**	@brief  Calculate jacobi Symbol (x/y) (Variable Time)
+ *
+	@param x BIG number
+	@param y BIG number
+	@return Jacobi symbol, -1,0 or 1
+ */
+extern int BIG_jacobi(BIG x, BIG y);
+/**	@brief  Calculate x=1/y mod n (Variable Time)
+ *
+	Modular Inversion - This is slow. Uses binary method.
+	@param x BIG number, on exit = 1/y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_invmodp(BIG x, BIG y, BIG n);
+/** @brief Calculate x=x mod 2^m (Variable Time)
+ *
+	Truncation
+	@param x BIG number, on reduced mod 2^m
+	@param m new truncated size
+*/
+extern void BIG_mod2m(BIG x, int m);
+
+/**	@brief Calculates a*b+c+*d
+ *
+	Calculate partial product of a.b, add in carry c, and add total to d (Constant Time)
+	@param a multiplier
+	@param b multiplicand
+	@param c carry
+	@param d pointer to accumulated bottom half of result
+	@return top half of result
+ */
+
+
+extern int step1(BIG,BIG,BIG);
+extern void step2(BIG,BIG,BIG);
+
+#ifdef dchunk
+
+/* Method required to calculate x*y+c+r, bottom half in r, top half returned */
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    dchunk prod = (dchunk)x * y + c + *r;
+    *r = (chunk)prod & BMASK_B256_56;
+    return (chunk)(prod >> BASEBITS_B256_56);
+}
+
+#else
+
+/* No integer type available that can store double the wordlength */
+/* accumulate partial products */
+
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    chunk x0, x1, y0, y1;
+    chunk bot, top, mid, carry;
+    x0 = x & HMASK_B256_56;
+    x1 = (x >> HBITS_B256_56);
+    y0 = y & HMASK_B256_56;
+    y1 = (y >> HBITS_B256_56);
+    bot = x0 * y0;
+    top = x1 * y1;
+    mid = x0 * y1 + x1 * y0;
+    x0 = mid & HMASK_B256_56;
+    x1 = (mid >> HBITS_B256_56);
+    bot += x0 << HBITS_B256_56;
+    bot += *r;
+    bot += c;
+
+    top += x1;
+    carry = bot >> BASEBITS_B256_56;
+    bot &= BMASK_B256_56;
+    top += carry;
+
+    *r = bot;
+    return top;
+}
+
+#endif
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/big_B288_60.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/big_B288_60.h
new file mode 100644
index 0000000..2034bee
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/big_B288_60.h
@@ -0,0 +1,697 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file big.h
+ * @author Mike Scott
+ * @date 23rd February 2016
+ * @brief Big number Header File
+ *
+ *
+ */
+
+#ifndef BIG_B288_60_H
+#define BIG_B288_60_H
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <inttypes.h>
+#include "arch.h"
+#include "core.h"
+#include "config_big_B288_60.h"
+
+using namespace core;
+
+/* could comment this out if code size is a major issue */
+#define UNWOUND
+/* Normally recommended, but may not be optimal for some architectures, for example 32-bit ARM M4 */
+#define USE_KARATSUBA
+
+#define BIGBITS_B288_60 (8*MODBYTES_B288_60)
+#define NLEN_B288_60 (1+((8*MODBYTES_B288_60-1)/BASEBITS_B288_60))
+#define DNLEN_B288_60 2*NLEN_B288_60
+#define BMASK_B288_60 (((chunk)1<<BASEBITS_B288_60)-1) /**< Mask = 2^BASEBITS-1 */
+#define NEXCESS_B288_60 (1<<(CHUNK-BASEBITS_B288_60-1))           /**< 2^(CHUNK-BASEBITS-1) - digit cannot be multiplied by more than this before normalisation */
+
+#define HBITS_B288_60 (BASEBITS_B288_60/2)      /**< Number of bits in number base divided by 2 */
+#define HMASK_B288_60 (((chunk)1<<HBITS_B288_60)-1)    /**< Mask = 2^HBITS-1 */
+
+//#define DEBUG_NORM
+
+#ifdef DEBUG_NORM  /* Add an extra location to track chunk extension */
+#define MPV_B288_60 NLEN_B288_60
+#define MNV_B288_60 (NLEN_B288_60+1)
+#define DMPV_B288_60 DNLEN_B288_60
+#define DMNV_B288_60 (DNLEN_B288_60+1)
+
+#endif
+
+namespace B288_60 {
+
+//extern int BIGMULS;
+//extern int BIGSQRS;
+
+#ifdef DEBUG_NORM
+typedef chunk BIG[NLEN_B288_60 + 2]; /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B288_60 + 2]; /**< Define type DBIG as array of chunks */
+#else
+typedef chunk BIG[NLEN_B288_60];     /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B288_60];   /**< Define type DBIG as array of chunks */
+#endif
+
+/* BIG number prototypes */
+
+/**	@brief Tests for BIG equal to zero (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_iszilch(BIG x);
+/**	@brief Tests for BIG equal to one (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if one, else returns 0
+ */
+extern int BIG_isunity(BIG x);
+/**	@brief Tests for DBIG equal to zero (Constant Time)
+ *
+	@param x a DBIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_diszilch(DBIG x);
+/**	@brief Outputs a BIG number to the console (Variable Time)
+ *
+	@param x a BIG number
+ */
+extern void BIG_output(BIG x);
+/**	@brief Outputs a BIG number to the console in raw form (Variable Time for debugging)
+ *
+	@param x a BIG number
+ */
+extern void BIG_rawoutput(BIG x);
+/**	@brief Conditional constant time swap of two BIG numbers
+ *
+	Conditionally swaps parameters in constant time (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s swap takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cswap(BIG x, BIG y, int s);
+/**	@brief Conditional copy of BIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cmove(BIG x, BIG y, int s);
+/**	@brief Conditional copy of DBIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a DBIG number
+	@param y another DBIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_dcmove(BIG x, BIG y, int s);
+/**	@brief Convert from BIG number to byte array (Constant Time)
+ *
+	@param a byte array
+	@param x BIG number
+ */
+extern void BIG_toBytes(char *a, BIG x);
+/**	@brief Convert to BIG number from byte array (Constant Time)
+ *
+	@param x BIG number
+	@param a byte array
+ */
+extern void BIG_fromBytes(BIG x, char *a);
+/**	@brief Convert to BIG number from byte array of given length (Variable Time)
+ *
+	@param x BIG number
+	@param a byte array
+	@param s byte array length
+ */
+extern void BIG_fromBytesLen(BIG x, char *a, int s);
+/**@brief Convert to DBIG number from byte array of given length (Variable Time)
+ *
+   @param x DBIG number
+   @param a byte array
+   @param s byte array length
+ */
+extern void BIG_dfromBytesLen(DBIG x, char *a, int s);
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_doutput(DBIG x); 
+
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_drawoutput(DBIG x);
+
+/**	@brief Copy BIG from Read-Only Memory to a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number in ROM
+ */
+extern void BIG_rcopy(BIG x, const BIG y);
+/**	@brief Copy BIG to another BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_copy(BIG x, BIG y);
+/**	@brief Copy DBIG to another DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_dcopy(DBIG x, DBIG y);
+/**	@brief Copy BIG to upper half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dsucopy(DBIG x, BIG y);
+/**	@brief Copy BIG to lower half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dscopy(DBIG x, BIG y);
+/**	@brief Copy lower half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sdcopy(BIG x, DBIG y);
+/**	@brief Copy upper half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sducopy(BIG x, DBIG y);
+/**	@brief Set BIG to zero (Constant Time)
+ *
+	@param x BIG number to be set to zero  
+ */
+extern void BIG_zero(BIG x);
+/**	@brief Set DBIG to zero (Constant Time)
+ *
+	@param x DBIG number to be set to zero
+ */
+extern void BIG_dzero(DBIG x);
+/**	@brief Set BIG to one (unity) (Constant Time)
+ *
+	@param x BIG number to be set to one.
+ */
+extern void BIG_one(BIG x);
+/**	@brief Set BIG to inverse mod 2^256 (Constant Time)
+ *
+	@param x BIG number to be inverted
+ */
+extern void BIG_invmod2m(BIG x);
+/**	@brief Set BIG to sum of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, sum of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_add(BIG x, BIG y, BIG z);
+
+/**	@brief Set BIG to logical or of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, or of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_or(BIG x, BIG y, BIG z);
+
+/**	@brief Increment BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be incremented
+	@param i integer
+ */
+extern void BIG_inc(BIG x, int i);
+/**	@brief Set BIG to difference of two BIGs (Constant Time)
+ *
+	@param x BIG number, difference of other two - output not normalised
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_sub(BIG x, BIG y, BIG z);
+/**	@brief Decrement BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be decremented
+	@param i integer
+ */
+extern void BIG_dec(BIG x, int i);
+/**	@brief Set DBIG to sum of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, sum of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dadd(DBIG x, DBIG y, DBIG z);
+/**	@brief Set DBIG to difference of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, difference of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dsub(DBIG x, DBIG y, DBIG z);
+/**	@brief Multiply BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_imul(BIG x, BIG y, int i);
+/**	@brief Multiply BIG by not-so-small small integer - output normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+	@return Overflowing bits
+ */
+extern chunk BIG_pmul(BIG x, BIG y, int i);
+/**	@brief Divide BIG by 3 - output normalised (Constant Time)
+ *
+	@param x BIG number
+	@return Remainder
+ */
+extern int BIG_div3(BIG x);
+/**	@brief Multiply BIG by even bigger small integer resulting in a DBIG - output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_pxmul(DBIG x, BIG y, int i);
+/**	@brief Multiply BIG by another BIG resulting in DBIG - inputs normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_mul(DBIG x, BIG y, BIG z);
+/**	@brief Multiply BIG by another BIG resulting in another BIG - inputs normalised and output normalised (Constant Time)
+ *
+	Note that the product must fit into a BIG, and x must be distinct from y and z
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_smul(BIG x, BIG y, BIG z);
+/**	@brief Square BIG resulting in a DBIG - input normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, square of a BIG
+	@param y BIG number to be squared
+ */
+extern void BIG_sqr(DBIG x, BIG y);
+
+/**	@brief Montgomery reduction of a DBIG to a BIG  - input normalised and output normalised (Constant Time)
+ *
+	@param a BIG number, reduction of a BIG
+	@param md BIG number, the modulus
+	@param MC the Montgomery Constant
+	@param d DBIG number to be reduced
+ */
+extern void BIG_monty(BIG a, BIG md, chunk MC, DBIG d);
+
+/**	@brief Shifts a BIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shl(BIG x, int s);
+/**	@brief Fast shifts a BIG left by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Overflow bits
+ */
+extern int BIG_fshl(BIG x, int s);
+/**	@brief Shifts a DBIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshl(DBIG x, int s);
+/**	@brief Shifts a BIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shr(BIG x, int s);
+
+
+/**	@brief Fast time-critical combined shift by 1 bit, subtract and normalise (Constant Time)
+ *
+	@param r BIG number normalised output
+	@param a BIG number to be subtracted from
+	@param m BIG number to be shifted and subtracted
+	@return sign of r
+ */
+extern int BIG_ssn(BIG r, BIG a, BIG m);
+
+/**	@brief Fast shifts a BIG right by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Shifted out bits
+ */
+extern int BIG_fshr(BIG x, int s);
+/**	@brief Shifts a DBIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshr(DBIG x, int s);
+/**	@brief Splits a DBIG into two BIGs - input must be normalised, outputs normalised (Constant Time as used)
+ *
+	Internal function. The value of s must be approximately in the middle of the DBIG.
+	Typically used to extract z mod 2^MODBITS and z/2^MODBITS
+	@param x BIG number, top half of z
+	@param y BIG number, bottom half of z
+	@param z DBIG number to be split in two.
+	@param s Bit position at which to split
+	@return carry-out from top half
+ */
+extern chunk BIG_split(BIG x, BIG y, DBIG z, int s);
+/**	@brief Normalizes a BIG number - output normalised (Constant Time)
+ *
+	All digits of the input BIG are reduced mod 2^BASEBITS
+	@param x BIG number to be normalised
+ */
+extern chunk BIG_norm(BIG x);
+/**	@brief Normalizes a DBIG number - output normalised (Constant Time)
+ *
+	All digits of the input DBIG are reduced mod 2^BASEBITS
+	@param x DBIG number to be normalised
+ */
+extern void BIG_dnorm(DBIG x);
+/**	@brief Compares two BIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first BIG number to be compared
+	@param y second BIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_comp(BIG x, BIG y);
+/**	@brief Compares two DBIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first DBIG number to be compared
+	@param y second DBIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_dcomp(DBIG x, DBIG y);
+/**	@brief Calculate number of bits in a BIG - output normalised (Variable Time)
+ *
+	@param x BIG number
+	@return Number of bits in x
+ */
+extern int BIG_nbits(BIG x);
+/**	@brief Calculate number of bits in a DBIG - output normalised (Variable Time)
+ *
+	@param x DBIG number
+	@return Number of bits in x
+ */
+extern int BIG_dnbits(DBIG x);
+
+/**	@brief Reduce x mod n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctmod(BIG x, BIG n, int bd);
+
+/**	@brief  x=y mod n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctdmod(BIG x, DBIG y, BIG n, int bd);
+
+/**	@brief Divide x by n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctsdiv(BIG x,BIG n,int bd);
+
+/**	@brief  x=y/n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctddiv(BIG x, DBIG y, BIG n,int bd);
+
+
+/**	@brief Reduce x mod n - input and output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+ */
+extern void BIG_mod(BIG x, BIG n);
+/**	@brief Divide x by n - output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+ */
+extern void BIG_sdiv(BIG x, BIG n);
+/**	@brief  x=y mod n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_dmod(BIG x, DBIG y, BIG n);
+/**	@brief  x=y/n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_ddiv(BIG x, DBIG y, BIG n);
+/**	@brief  return parity of BIG, that is the least significant bit (Constant Time)
+ *
+	@param x BIG number
+	@return 0 or 1
+ */
+extern int BIG_parity(BIG x);
+/**	@brief  return i-th of BIG (Constant Time)
+ *
+	@param x BIG number
+	@param i the bit of x to be returned
+	@return 0 or 1
+ */
+extern int BIG_bit(BIG x, int i);
+/**	@brief  return least significant bits of a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param n number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int BIG_lastbits(BIG x, int n);
+/**	@brief  Create a random BIG from a random number generator (Constant Time)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_random(BIG x, csprng *r);
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randomnum(BIG x, BIG n, csprng *r);
+
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus and truncated to max bit length (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param t Maximum bit length
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randtrunc(BIG x, BIG n, int t, csprng *r);
+
+/**	brief  return NAF (Non-Adjacent-Form) value as +/- 1, 3 or 5, inputs must be normalised
+ *
+	Given x and 3*x extracts NAF value from given bit position, and returns number of bits processed, and number of trailing zeros detected if any
+	param x BIG number
+	param x3 BIG number, three times x
+	param i bit position
+	param nbs pointer to integer returning number of bits processed
+	param nzs pointer to integer returning number of trailing 0s
+	return + or - 1, 3 or 5
+*/
+
+/**	@brief  Calculate x=y*z mod n (Variable Time)
+ *
+	Slow method for modular multiplication
+	@param x BIG number, on exit = y*z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modmul(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y/z mod n (Variable Time)
+ *
+	Slow method for modular division
+	@param x BIG number, on exit = y/z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_moddiv(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y^2 mod n (Variable Time)
+ *
+	Slow method for modular squaring
+	@param x BIG number, on exit = y^2 mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modsqr(BIG x, BIG y, BIG n);
+/**	@brief  Calculate x=-y mod n (Variable Time)
+ *
+	Modular negation
+	@param x BIG number, on exit = -y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modneg(BIG x, BIG y, BIG n);
+
+/**	@brief  Calculate x=y+z mod n (Variable Time)
+ *
+	Slow method for modular addition
+	@param x BIG number, on exit = y+z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modadd(BIG x, BIG y, BIG z, BIG n);
+
+/**	@brief  Calculate jacobi Symbol (x/y) (Variable Time)
+ *
+	@param x BIG number
+	@param y BIG number
+	@return Jacobi symbol, -1,0 or 1
+ */
+extern int BIG_jacobi(BIG x, BIG y);
+/**	@brief  Calculate x=1/y mod n (Variable Time)
+ *
+	Modular Inversion - This is slow. Uses binary method.
+	@param x BIG number, on exit = 1/y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_invmodp(BIG x, BIG y, BIG n);
+/** @brief Calculate x=x mod 2^m (Variable Time)
+ *
+	Truncation
+	@param x BIG number, on reduced mod 2^m
+	@param m new truncated size
+*/
+extern void BIG_mod2m(BIG x, int m);
+
+/**	@brief Calculates a*b+c+*d
+ *
+	Calculate partial product of a.b, add in carry c, and add total to d (Constant Time)
+	@param a multiplier
+	@param b multiplicand
+	@param c carry
+	@param d pointer to accumulated bottom half of result
+	@return top half of result
+ */
+
+
+extern int step1(BIG,BIG,BIG);
+extern void step2(BIG,BIG,BIG);
+
+#ifdef dchunk
+
+/* Method required to calculate x*y+c+r, bottom half in r, top half returned */
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    dchunk prod = (dchunk)x * y + c + *r;
+    *r = (chunk)prod & BMASK_B288_60;
+    return (chunk)(prod >> BASEBITS_B288_60);
+}
+
+#else
+
+/* No integer type available that can store double the wordlength */
+/* accumulate partial products */
+
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    chunk x0, x1, y0, y1;
+    chunk bot, top, mid, carry;
+    x0 = x & HMASK_B288_60;
+    x1 = (x >> HBITS_B288_60);
+    y0 = y & HMASK_B288_60;
+    y1 = (y >> HBITS_B288_60);
+    bot = x0 * y0;
+    top = x1 * y1;
+    mid = x0 * y1 + x1 * y0;
+    x0 = mid & HMASK_B288_60;
+    x1 = (mid >> HBITS_B288_60);
+    bot += x0 << HBITS_B288_60;
+    bot += *r;
+    bot += c;
+
+    top += x1;
+    carry = bot >> BASEBITS_B288_60;
+    bot &= BMASK_B288_60;
+    top += carry;
+
+    *r = bot;
+    return top;
+}
+
+#endif
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/big_B336_60.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/big_B336_60.h
new file mode 100644
index 0000000..d4fa6c9
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/big_B336_60.h
@@ -0,0 +1,697 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file big.h
+ * @author Mike Scott
+ * @date 23rd February 2016
+ * @brief Big number Header File
+ *
+ *
+ */
+
+#ifndef BIG_B336_60_H
+#define BIG_B336_60_H
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <inttypes.h>
+#include "arch.h"
+#include "core.h"
+#include "config_big_B336_60.h"
+
+using namespace core;
+
+/* could comment this out if code size is a major issue */
+#define UNWOUND
+/* Normally recommended, but may not be optimal for some architectures, for example 32-bit ARM M4 */
+#define USE_KARATSUBA
+
+#define BIGBITS_B336_60 (8*MODBYTES_B336_60)
+#define NLEN_B336_60 (1+((8*MODBYTES_B336_60-1)/BASEBITS_B336_60))
+#define DNLEN_B336_60 2*NLEN_B336_60
+#define BMASK_B336_60 (((chunk)1<<BASEBITS_B336_60)-1) /**< Mask = 2^BASEBITS-1 */
+#define NEXCESS_B336_60 (1<<(CHUNK-BASEBITS_B336_60-1))           /**< 2^(CHUNK-BASEBITS-1) - digit cannot be multiplied by more than this before normalisation */
+
+#define HBITS_B336_60 (BASEBITS_B336_60/2)      /**< Number of bits in number base divided by 2 */
+#define HMASK_B336_60 (((chunk)1<<HBITS_B336_60)-1)    /**< Mask = 2^HBITS-1 */
+
+//#define DEBUG_NORM
+
+#ifdef DEBUG_NORM  /* Add an extra location to track chunk extension */
+#define MPV_B336_60 NLEN_B336_60
+#define MNV_B336_60 (NLEN_B336_60+1)
+#define DMPV_B336_60 DNLEN_B336_60
+#define DMNV_B336_60 (DNLEN_B336_60+1)
+
+#endif
+
+namespace B336_60 {
+
+//extern int BIGMULS;
+//extern int BIGSQRS;
+
+#ifdef DEBUG_NORM
+typedef chunk BIG[NLEN_B336_60 + 2]; /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B336_60 + 2]; /**< Define type DBIG as array of chunks */
+#else
+typedef chunk BIG[NLEN_B336_60];     /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B336_60];   /**< Define type DBIG as array of chunks */
+#endif
+
+/* BIG number prototypes */
+
+/**	@brief Tests for BIG equal to zero (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_iszilch(BIG x);
+/**	@brief Tests for BIG equal to one (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if one, else returns 0
+ */
+extern int BIG_isunity(BIG x);
+/**	@brief Tests for DBIG equal to zero (Constant Time)
+ *
+	@param x a DBIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_diszilch(DBIG x);
+/**	@brief Outputs a BIG number to the console (Variable Time)
+ *
+	@param x a BIG number
+ */
+extern void BIG_output(BIG x);
+/**	@brief Outputs a BIG number to the console in raw form (Variable Time for debugging)
+ *
+	@param x a BIG number
+ */
+extern void BIG_rawoutput(BIG x);
+/**	@brief Conditional constant time swap of two BIG numbers
+ *
+	Conditionally swaps parameters in constant time (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s swap takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cswap(BIG x, BIG y, int s);
+/**	@brief Conditional copy of BIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cmove(BIG x, BIG y, int s);
+/**	@brief Conditional copy of DBIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a DBIG number
+	@param y another DBIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_dcmove(BIG x, BIG y, int s);
+/**	@brief Convert from BIG number to byte array (Constant Time)
+ *
+	@param a byte array
+	@param x BIG number
+ */
+extern void BIG_toBytes(char *a, BIG x);
+/**	@brief Convert to BIG number from byte array (Constant Time)
+ *
+	@param x BIG number
+	@param a byte array
+ */
+extern void BIG_fromBytes(BIG x, char *a);
+/**	@brief Convert to BIG number from byte array of given length (Variable Time)
+ *
+	@param x BIG number
+	@param a byte array
+	@param s byte array length
+ */
+extern void BIG_fromBytesLen(BIG x, char *a, int s);
+/**@brief Convert to DBIG number from byte array of given length (Variable Time)
+ *
+   @param x DBIG number
+   @param a byte array
+   @param s byte array length
+ */
+extern void BIG_dfromBytesLen(DBIG x, char *a, int s);
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_doutput(DBIG x); 
+
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_drawoutput(DBIG x);
+
+/**	@brief Copy BIG from Read-Only Memory to a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number in ROM
+ */
+extern void BIG_rcopy(BIG x, const BIG y);
+/**	@brief Copy BIG to another BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_copy(BIG x, BIG y);
+/**	@brief Copy DBIG to another DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_dcopy(DBIG x, DBIG y);
+/**	@brief Copy BIG to upper half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dsucopy(DBIG x, BIG y);
+/**	@brief Copy BIG to lower half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dscopy(DBIG x, BIG y);
+/**	@brief Copy lower half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sdcopy(BIG x, DBIG y);
+/**	@brief Copy upper half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sducopy(BIG x, DBIG y);
+/**	@brief Set BIG to zero (Constant Time)
+ *
+	@param x BIG number to be set to zero  
+ */
+extern void BIG_zero(BIG x);
+/**	@brief Set DBIG to zero (Constant Time)
+ *
+	@param x DBIG number to be set to zero
+ */
+extern void BIG_dzero(DBIG x);
+/**	@brief Set BIG to one (unity) (Constant Time)
+ *
+	@param x BIG number to be set to one.
+ */
+extern void BIG_one(BIG x);
+/**	@brief Set BIG to inverse mod 2^256 (Constant Time)
+ *
+	@param x BIG number to be inverted
+ */
+extern void BIG_invmod2m(BIG x);
+/**	@brief Set BIG to sum of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, sum of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_add(BIG x, BIG y, BIG z);
+
+/**	@brief Set BIG to logical or of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, or of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_or(BIG x, BIG y, BIG z);
+
+/**	@brief Increment BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be incremented
+	@param i integer
+ */
+extern void BIG_inc(BIG x, int i);
+/**	@brief Set BIG to difference of two BIGs (Constant Time)
+ *
+	@param x BIG number, difference of other two - output not normalised
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_sub(BIG x, BIG y, BIG z);
+/**	@brief Decrement BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be decremented
+	@param i integer
+ */
+extern void BIG_dec(BIG x, int i);
+/**	@brief Set DBIG to sum of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, sum of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dadd(DBIG x, DBIG y, DBIG z);
+/**	@brief Set DBIG to difference of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, difference of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dsub(DBIG x, DBIG y, DBIG z);
+/**	@brief Multiply BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_imul(BIG x, BIG y, int i);
+/**	@brief Multiply BIG by not-so-small small integer - output normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+	@return Overflowing bits
+ */
+extern chunk BIG_pmul(BIG x, BIG y, int i);
+/**	@brief Divide BIG by 3 - output normalised (Constant Time)
+ *
+	@param x BIG number
+	@return Remainder
+ */
+extern int BIG_div3(BIG x);
+/**	@brief Multiply BIG by even bigger small integer resulting in a DBIG - output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_pxmul(DBIG x, BIG y, int i);
+/**	@brief Multiply BIG by another BIG resulting in DBIG - inputs normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_mul(DBIG x, BIG y, BIG z);
+/**	@brief Multiply BIG by another BIG resulting in another BIG - inputs normalised and output normalised (Constant Time)
+ *
+	Note that the product must fit into a BIG, and x must be distinct from y and z
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_smul(BIG x, BIG y, BIG z);
+/**	@brief Square BIG resulting in a DBIG - input normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, square of a BIG
+	@param y BIG number to be squared
+ */
+extern void BIG_sqr(DBIG x, BIG y);
+
+/**	@brief Montgomery reduction of a DBIG to a BIG  - input normalised and output normalised (Constant Time)
+ *
+	@param a BIG number, reduction of a BIG
+	@param md BIG number, the modulus
+	@param MC the Montgomery Constant
+	@param d DBIG number to be reduced
+ */
+extern void BIG_monty(BIG a, BIG md, chunk MC, DBIG d);
+
+/**	@brief Shifts a BIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shl(BIG x, int s);
+/**	@brief Fast shifts a BIG left by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Overflow bits
+ */
+extern int BIG_fshl(BIG x, int s);
+/**	@brief Shifts a DBIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshl(DBIG x, int s);
+/**	@brief Shifts a BIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shr(BIG x, int s);
+
+
+/**	@brief Fast time-critical combined shift by 1 bit, subtract and normalise (Constant Time)
+ *
+	@param r BIG number normalised output
+	@param a BIG number to be subtracted from
+	@param m BIG number to be shifted and subtracted
+	@return sign of r
+ */
+extern int BIG_ssn(BIG r, BIG a, BIG m);
+
+/**	@brief Fast shifts a BIG right by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Shifted out bits
+ */
+extern int BIG_fshr(BIG x, int s);
+/**	@brief Shifts a DBIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshr(DBIG x, int s);
+/**	@brief Splits a DBIG into two BIGs - input must be normalised, outputs normalised (Constant Time as used)
+ *
+	Internal function. The value of s must be approximately in the middle of the DBIG.
+	Typically used to extract z mod 2^MODBITS and z/2^MODBITS
+	@param x BIG number, top half of z
+	@param y BIG number, bottom half of z
+	@param z DBIG number to be split in two.
+	@param s Bit position at which to split
+	@return carry-out from top half
+ */
+extern chunk BIG_split(BIG x, BIG y, DBIG z, int s);
+/**	@brief Normalizes a BIG number - output normalised (Constant Time)
+ *
+	All digits of the input BIG are reduced mod 2^BASEBITS
+	@param x BIG number to be normalised
+ */
+extern chunk BIG_norm(BIG x);
+/**	@brief Normalizes a DBIG number - output normalised (Constant Time)
+ *
+	All digits of the input DBIG are reduced mod 2^BASEBITS
+	@param x DBIG number to be normalised
+ */
+extern void BIG_dnorm(DBIG x);
+/**	@brief Compares two BIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first BIG number to be compared
+	@param y second BIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_comp(BIG x, BIG y);
+/**	@brief Compares two DBIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first DBIG number to be compared
+	@param y second DBIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_dcomp(DBIG x, DBIG y);
+/**	@brief Calculate number of bits in a BIG - output normalised (Variable Time)
+ *
+	@param x BIG number
+	@return Number of bits in x
+ */
+extern int BIG_nbits(BIG x);
+/**	@brief Calculate number of bits in a DBIG - output normalised (Variable Time)
+ *
+	@param x DBIG number
+	@return Number of bits in x
+ */
+extern int BIG_dnbits(DBIG x);
+
+/**	@brief Reduce x mod n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctmod(BIG x, BIG n, int bd);
+
+/**	@brief  x=y mod n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctdmod(BIG x, DBIG y, BIG n, int bd);
+
+/**	@brief Divide x by n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctsdiv(BIG x,BIG n,int bd);
+
+/**	@brief  x=y/n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctddiv(BIG x, DBIG y, BIG n,int bd);
+
+
+/**	@brief Reduce x mod n - input and output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+ */
+extern void BIG_mod(BIG x, BIG n);
+/**	@brief Divide x by n - output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+ */
+extern void BIG_sdiv(BIG x, BIG n);
+/**	@brief  x=y mod n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_dmod(BIG x, DBIG y, BIG n);
+/**	@brief  x=y/n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_ddiv(BIG x, DBIG y, BIG n);
+/**	@brief  return parity of BIG, that is the least significant bit (Constant Time)
+ *
+	@param x BIG number
+	@return 0 or 1
+ */
+extern int BIG_parity(BIG x);
+/**	@brief  return i-th of BIG (Constant Time)
+ *
+	@param x BIG number
+	@param i the bit of x to be returned
+	@return 0 or 1
+ */
+extern int BIG_bit(BIG x, int i);
+/**	@brief  return least significant bits of a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param n number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int BIG_lastbits(BIG x, int n);
+/**	@brief  Create a random BIG from a random number generator (Constant Time)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_random(BIG x, csprng *r);
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randomnum(BIG x, BIG n, csprng *r);
+
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus and truncated to max bit length (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param t Maximum bit length
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randtrunc(BIG x, BIG n, int t, csprng *r);
+
+/**	brief  return NAF (Non-Adjacent-Form) value as +/- 1, 3 or 5, inputs must be normalised
+ *
+	Given x and 3*x extracts NAF value from given bit position, and returns number of bits processed, and number of trailing zeros detected if any
+	param x BIG number
+	param x3 BIG number, three times x
+	param i bit position
+	param nbs pointer to integer returning number of bits processed
+	param nzs pointer to integer returning number of trailing 0s
+	return + or - 1, 3 or 5
+*/
+
+/**	@brief  Calculate x=y*z mod n (Variable Time)
+ *
+	Slow method for modular multiplication
+	@param x BIG number, on exit = y*z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modmul(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y/z mod n (Variable Time)
+ *
+	Slow method for modular division
+	@param x BIG number, on exit = y/z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_moddiv(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y^2 mod n (Variable Time)
+ *
+	Slow method for modular squaring
+	@param x BIG number, on exit = y^2 mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modsqr(BIG x, BIG y, BIG n);
+/**	@brief  Calculate x=-y mod n (Variable Time)
+ *
+	Modular negation
+	@param x BIG number, on exit = -y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modneg(BIG x, BIG y, BIG n);
+
+/**	@brief  Calculate x=y+z mod n (Variable Time)
+ *
+	Slow method for modular addition
+	@param x BIG number, on exit = y+z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modadd(BIG x, BIG y, BIG z, BIG n);
+
+/**	@brief  Calculate jacobi Symbol (x/y) (Variable Time)
+ *
+	@param x BIG number
+	@param y BIG number
+	@return Jacobi symbol, -1,0 or 1
+ */
+extern int BIG_jacobi(BIG x, BIG y);
+/**	@brief  Calculate x=1/y mod n (Variable Time)
+ *
+	Modular Inversion - This is slow. Uses binary method.
+	@param x BIG number, on exit = 1/y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_invmodp(BIG x, BIG y, BIG n);
+/** @brief Calculate x=x mod 2^m (Variable Time)
+ *
+	Truncation
+	@param x BIG number, on reduced mod 2^m
+	@param m new truncated size
+*/
+extern void BIG_mod2m(BIG x, int m);
+
+/**	@brief Calculates a*b+c+*d
+ *
+	Calculate partial product of a.b, add in carry c, and add total to d (Constant Time)
+	@param a multiplier
+	@param b multiplicand
+	@param c carry
+	@param d pointer to accumulated bottom half of result
+	@return top half of result
+ */
+
+
+extern int step1(BIG,BIG,BIG);
+extern void step2(BIG,BIG,BIG);
+
+#ifdef dchunk
+
+/* Method required to calculate x*y+c+r, bottom half in r, top half returned */
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    dchunk prod = (dchunk)x * y + c + *r;
+    *r = (chunk)prod & BMASK_B336_60;
+    return (chunk)(prod >> BASEBITS_B336_60);
+}
+
+#else
+
+/* No integer type available that can store double the wordlength */
+/* accumulate partial products */
+
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    chunk x0, x1, y0, y1;
+    chunk bot, top, mid, carry;
+    x0 = x & HMASK_B336_60;
+    x1 = (x >> HBITS_B336_60);
+    y0 = y & HMASK_B336_60;
+    y1 = (y >> HBITS_B336_60);
+    bot = x0 * y0;
+    top = x1 * y1;
+    mid = x0 * y1 + x1 * y0;
+    x0 = mid & HMASK_B336_60;
+    x1 = (mid >> HBITS_B336_60);
+    bot += x0 << HBITS_B336_60;
+    bot += *r;
+    bot += c;
+
+    top += x1;
+    carry = bot >> BASEBITS_B336_60;
+    bot &= BMASK_B336_60;
+    top += carry;
+
+    *r = bot;
+    return top;
+}
+
+#endif
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/big_B384_56.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/big_B384_56.h
new file mode 100644
index 0000000..a5724a1
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/big_B384_56.h
@@ -0,0 +1,697 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file big.h
+ * @author Mike Scott
+ * @date 23rd February 2016
+ * @brief Big number Header File
+ *
+ *
+ */
+
+#ifndef BIG_B384_56_H
+#define BIG_B384_56_H
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <inttypes.h>
+#include "arch.h"
+#include "core.h"
+#include "config_big_B384_56.h"
+
+using namespace core;
+
+/* could comment this out if code size is a major issue */
+#define UNWOUND
+/* Normally recommended, but may not be optimal for some architectures, for example 32-bit ARM M4 */
+#define USE_KARATSUBA
+
+#define BIGBITS_B384_56 (8*MODBYTES_B384_56)
+#define NLEN_B384_56 (1+((8*MODBYTES_B384_56-1)/BASEBITS_B384_56))
+#define DNLEN_B384_56 2*NLEN_B384_56
+#define BMASK_B384_56 (((chunk)1<<BASEBITS_B384_56)-1) /**< Mask = 2^BASEBITS-1 */
+#define NEXCESS_B384_56 (1<<(CHUNK-BASEBITS_B384_56-1))           /**< 2^(CHUNK-BASEBITS-1) - digit cannot be multiplied by more than this before normalisation */
+
+#define HBITS_B384_56 (BASEBITS_B384_56/2)      /**< Number of bits in number base divided by 2 */
+#define HMASK_B384_56 (((chunk)1<<HBITS_B384_56)-1)    /**< Mask = 2^HBITS-1 */
+
+//#define DEBUG_NORM
+
+#ifdef DEBUG_NORM  /* Add an extra location to track chunk extension */
+#define MPV_B384_56 NLEN_B384_56
+#define MNV_B384_56 (NLEN_B384_56+1)
+#define DMPV_B384_56 DNLEN_B384_56
+#define DMNV_B384_56 (DNLEN_B384_56+1)
+
+#endif
+
+namespace B384_56 {
+
+//extern int BIGMULS;
+//extern int BIGSQRS;
+
+#ifdef DEBUG_NORM
+typedef chunk BIG[NLEN_B384_56 + 2]; /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B384_56 + 2]; /**< Define type DBIG as array of chunks */
+#else
+typedef chunk BIG[NLEN_B384_56];     /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B384_56];   /**< Define type DBIG as array of chunks */
+#endif
+
+/* BIG number prototypes */
+
+/**	@brief Tests for BIG equal to zero (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_iszilch(BIG x);
+/**	@brief Tests for BIG equal to one (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if one, else returns 0
+ */
+extern int BIG_isunity(BIG x);
+/**	@brief Tests for DBIG equal to zero (Constant Time)
+ *
+	@param x a DBIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_diszilch(DBIG x);
+/**	@brief Outputs a BIG number to the console (Variable Time)
+ *
+	@param x a BIG number
+ */
+extern void BIG_output(BIG x);
+/**	@brief Outputs a BIG number to the console in raw form (Variable Time for debugging)
+ *
+	@param x a BIG number
+ */
+extern void BIG_rawoutput(BIG x);
+/**	@brief Conditional constant time swap of two BIG numbers
+ *
+	Conditionally swaps parameters in constant time (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s swap takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cswap(BIG x, BIG y, int s);
+/**	@brief Conditional copy of BIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cmove(BIG x, BIG y, int s);
+/**	@brief Conditional copy of DBIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a DBIG number
+	@param y another DBIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_dcmove(BIG x, BIG y, int s);
+/**	@brief Convert from BIG number to byte array (Constant Time)
+ *
+	@param a byte array
+	@param x BIG number
+ */
+extern void BIG_toBytes(char *a, BIG x);
+/**	@brief Convert to BIG number from byte array (Constant Time)
+ *
+	@param x BIG number
+	@param a byte array
+ */
+extern void BIG_fromBytes(BIG x, char *a);
+/**	@brief Convert to BIG number from byte array of given length (Variable Time)
+ *
+	@param x BIG number
+	@param a byte array
+	@param s byte array length
+ */
+extern void BIG_fromBytesLen(BIG x, char *a, int s);
+/**@brief Convert to DBIG number from byte array of given length (Variable Time)
+ *
+   @param x DBIG number
+   @param a byte array
+   @param s byte array length
+ */
+extern void BIG_dfromBytesLen(DBIG x, char *a, int s);
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_doutput(DBIG x); 
+
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_drawoutput(DBIG x);
+
+/**	@brief Copy BIG from Read-Only Memory to a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number in ROM
+ */
+extern void BIG_rcopy(BIG x, const BIG y);
+/**	@brief Copy BIG to another BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_copy(BIG x, BIG y);
+/**	@brief Copy DBIG to another DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_dcopy(DBIG x, DBIG y);
+/**	@brief Copy BIG to upper half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dsucopy(DBIG x, BIG y);
+/**	@brief Copy BIG to lower half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dscopy(DBIG x, BIG y);
+/**	@brief Copy lower half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sdcopy(BIG x, DBIG y);
+/**	@brief Copy upper half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sducopy(BIG x, DBIG y);
+/**	@brief Set BIG to zero (Constant Time)
+ *
+	@param x BIG number to be set to zero  
+ */
+extern void BIG_zero(BIG x);
+/**	@brief Set DBIG to zero (Constant Time)
+ *
+	@param x DBIG number to be set to zero
+ */
+extern void BIG_dzero(DBIG x);
+/**	@brief Set BIG to one (unity) (Constant Time)
+ *
+	@param x BIG number to be set to one.
+ */
+extern void BIG_one(BIG x);
+/**	@brief Set BIG to inverse mod 2^256 (Constant Time)
+ *
+	@param x BIG number to be inverted
+ */
+extern void BIG_invmod2m(BIG x);
+/**	@brief Set BIG to sum of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, sum of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_add(BIG x, BIG y, BIG z);
+
+/**	@brief Set BIG to logical or of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, or of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_or(BIG x, BIG y, BIG z);
+
+/**	@brief Increment BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be incremented
+	@param i integer
+ */
+extern void BIG_inc(BIG x, int i);
+/**	@brief Set BIG to difference of two BIGs (Constant Time)
+ *
+	@param x BIG number, difference of other two - output not normalised
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_sub(BIG x, BIG y, BIG z);
+/**	@brief Decrement BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be decremented
+	@param i integer
+ */
+extern void BIG_dec(BIG x, int i);
+/**	@brief Set DBIG to sum of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, sum of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dadd(DBIG x, DBIG y, DBIG z);
+/**	@brief Set DBIG to difference of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, difference of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dsub(DBIG x, DBIG y, DBIG z);
+/**	@brief Multiply BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_imul(BIG x, BIG y, int i);
+/**	@brief Multiply BIG by not-so-small small integer - output normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+	@return Overflowing bits
+ */
+extern chunk BIG_pmul(BIG x, BIG y, int i);
+/**	@brief Divide BIG by 3 - output normalised (Constant Time)
+ *
+	@param x BIG number
+	@return Remainder
+ */
+extern int BIG_div3(BIG x);
+/**	@brief Multiply BIG by even bigger small integer resulting in a DBIG - output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_pxmul(DBIG x, BIG y, int i);
+/**	@brief Multiply BIG by another BIG resulting in DBIG - inputs normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_mul(DBIG x, BIG y, BIG z);
+/**	@brief Multiply BIG by another BIG resulting in another BIG - inputs normalised and output normalised (Constant Time)
+ *
+	Note that the product must fit into a BIG, and x must be distinct from y and z
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_smul(BIG x, BIG y, BIG z);
+/**	@brief Square BIG resulting in a DBIG - input normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, square of a BIG
+	@param y BIG number to be squared
+ */
+extern void BIG_sqr(DBIG x, BIG y);
+
+/**	@brief Montgomery reduction of a DBIG to a BIG  - input normalised and output normalised (Constant Time)
+ *
+	@param a BIG number, reduction of a BIG
+	@param md BIG number, the modulus
+	@param MC the Montgomery Constant
+	@param d DBIG number to be reduced
+ */
+extern void BIG_monty(BIG a, BIG md, chunk MC, DBIG d);
+
+/**	@brief Shifts a BIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shl(BIG x, int s);
+/**	@brief Fast shifts a BIG left by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Overflow bits
+ */
+extern int BIG_fshl(BIG x, int s);
+/**	@brief Shifts a DBIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshl(DBIG x, int s);
+/**	@brief Shifts a BIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shr(BIG x, int s);
+
+
+/**	@brief Fast time-critical combined shift by 1 bit, subtract and normalise (Constant Time)
+ *
+	@param r BIG number normalised output
+	@param a BIG number to be subtracted from
+	@param m BIG number to be shifted and subtracted
+	@return sign of r
+ */
+extern int BIG_ssn(BIG r, BIG a, BIG m);
+
+/**	@brief Fast shifts a BIG right by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Shifted out bits
+ */
+extern int BIG_fshr(BIG x, int s);
+/**	@brief Shifts a DBIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshr(DBIG x, int s);
+/**	@brief Splits a DBIG into two BIGs - input must be normalised, outputs normalised (Constant Time as used)
+ *
+	Internal function. The value of s must be approximately in the middle of the DBIG.
+	Typically used to extract z mod 2^MODBITS and z/2^MODBITS
+	@param x BIG number, top half of z
+	@param y BIG number, bottom half of z
+	@param z DBIG number to be split in two.
+	@param s Bit position at which to split
+	@return carry-out from top half
+ */
+extern chunk BIG_split(BIG x, BIG y, DBIG z, int s);
+/**	@brief Normalizes a BIG number - output normalised (Constant Time)
+ *
+	All digits of the input BIG are reduced mod 2^BASEBITS
+	@param x BIG number to be normalised
+ */
+extern chunk BIG_norm(BIG x);
+/**	@brief Normalizes a DBIG number - output normalised (Constant Time)
+ *
+	All digits of the input DBIG are reduced mod 2^BASEBITS
+	@param x DBIG number to be normalised
+ */
+extern void BIG_dnorm(DBIG x);
+/**	@brief Compares two BIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first BIG number to be compared
+	@param y second BIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_comp(BIG x, BIG y);
+/**	@brief Compares two DBIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first DBIG number to be compared
+	@param y second DBIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_dcomp(DBIG x, DBIG y);
+/**	@brief Calculate number of bits in a BIG - output normalised (Variable Time)
+ *
+	@param x BIG number
+	@return Number of bits in x
+ */
+extern int BIG_nbits(BIG x);
+/**	@brief Calculate number of bits in a DBIG - output normalised (Variable Time)
+ *
+	@param x DBIG number
+	@return Number of bits in x
+ */
+extern int BIG_dnbits(DBIG x);
+
+/**	@brief Reduce x mod n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctmod(BIG x, BIG n, int bd);
+
+/**	@brief  x=y mod n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctdmod(BIG x, DBIG y, BIG n, int bd);
+
+/**	@brief Divide x by n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctsdiv(BIG x,BIG n,int bd);
+
+/**	@brief  x=y/n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctddiv(BIG x, DBIG y, BIG n,int bd);
+
+
+/**	@brief Reduce x mod n - input and output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+ */
+extern void BIG_mod(BIG x, BIG n);
+/**	@brief Divide x by n - output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+ */
+extern void BIG_sdiv(BIG x, BIG n);
+/**	@brief  x=y mod n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_dmod(BIG x, DBIG y, BIG n);
+/**	@brief  x=y/n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_ddiv(BIG x, DBIG y, BIG n);
+/**	@brief  return parity of BIG, that is the least significant bit (Constant Time)
+ *
+	@param x BIG number
+	@return 0 or 1
+ */
+extern int BIG_parity(BIG x);
+/**	@brief  return i-th of BIG (Constant Time)
+ *
+	@param x BIG number
+	@param i the bit of x to be returned
+	@return 0 or 1
+ */
+extern int BIG_bit(BIG x, int i);
+/**	@brief  return least significant bits of a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param n number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int BIG_lastbits(BIG x, int n);
+/**	@brief  Create a random BIG from a random number generator (Constant Time)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_random(BIG x, csprng *r);
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randomnum(BIG x, BIG n, csprng *r);
+
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus and truncated to max bit length (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param t Maximum bit length
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randtrunc(BIG x, BIG n, int t, csprng *r);
+
+/**	brief  return NAF (Non-Adjacent-Form) value as +/- 1, 3 or 5, inputs must be normalised
+ *
+	Given x and 3*x extracts NAF value from given bit position, and returns number of bits processed, and number of trailing zeros detected if any
+	param x BIG number
+	param x3 BIG number, three times x
+	param i bit position
+	param nbs pointer to integer returning number of bits processed
+	param nzs pointer to integer returning number of trailing 0s
+	return + or - 1, 3 or 5
+*/
+
+/**	@brief  Calculate x=y*z mod n (Variable Time)
+ *
+	Slow method for modular multiplication
+	@param x BIG number, on exit = y*z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modmul(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y/z mod n (Variable Time)
+ *
+	Slow method for modular division
+	@param x BIG number, on exit = y/z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_moddiv(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y^2 mod n (Variable Time)
+ *
+	Slow method for modular squaring
+	@param x BIG number, on exit = y^2 mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modsqr(BIG x, BIG y, BIG n);
+/**	@brief  Calculate x=-y mod n (Variable Time)
+ *
+	Modular negation
+	@param x BIG number, on exit = -y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modneg(BIG x, BIG y, BIG n);
+
+/**	@brief  Calculate x=y+z mod n (Variable Time)
+ *
+	Slow method for modular addition
+	@param x BIG number, on exit = y+z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modadd(BIG x, BIG y, BIG z, BIG n);
+
+/**	@brief  Calculate jacobi Symbol (x/y) (Variable Time)
+ *
+	@param x BIG number
+	@param y BIG number
+	@return Jacobi symbol, -1,0 or 1
+ */
+extern int BIG_jacobi(BIG x, BIG y);
+/**	@brief  Calculate x=1/y mod n (Variable Time)
+ *
+	Modular Inversion - This is slow. Uses binary method.
+	@param x BIG number, on exit = 1/y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_invmodp(BIG x, BIG y, BIG n);
+/** @brief Calculate x=x mod 2^m (Variable Time)
+ *
+	Truncation
+	@param x BIG number, on reduced mod 2^m
+	@param m new truncated size
+*/
+extern void BIG_mod2m(BIG x, int m);
+
+/**	@brief Calculates a*b+c+*d
+ *
+	Calculate partial product of a.b, add in carry c, and add total to d (Constant Time)
+	@param a multiplier
+	@param b multiplicand
+	@param c carry
+	@param d pointer to accumulated bottom half of result
+	@return top half of result
+ */
+
+
+extern int step1(BIG,BIG,BIG);
+extern void step2(BIG,BIG,BIG);
+
+#ifdef dchunk
+
+/* Method required to calculate x*y+c+r, bottom half in r, top half returned */
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    dchunk prod = (dchunk)x * y + c + *r;
+    *r = (chunk)prod & BMASK_B384_56;
+    return (chunk)(prod >> BASEBITS_B384_56);
+}
+
+#else
+
+/* No integer type available that can store double the wordlength */
+/* accumulate partial products */
+
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    chunk x0, x1, y0, y1;
+    chunk bot, top, mid, carry;
+    x0 = x & HMASK_B384_56;
+    x1 = (x >> HBITS_B384_56);
+    y0 = y & HMASK_B384_56;
+    y1 = (y >> HBITS_B384_56);
+    bot = x0 * y0;
+    top = x1 * y1;
+    mid = x0 * y1 + x1 * y0;
+    x0 = mid & HMASK_B384_56;
+    x1 = (mid >> HBITS_B384_56);
+    bot += x0 << HBITS_B384_56;
+    bot += *r;
+    bot += c;
+
+    top += x1;
+    carry = bot >> BASEBITS_B384_56;
+    bot &= BMASK_B384_56;
+    top += carry;
+
+    *r = bot;
+    return top;
+}
+
+#endif
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/big_B384_58.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/big_B384_58.h
new file mode 100644
index 0000000..3f0c9ce
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/big_B384_58.h
@@ -0,0 +1,697 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file big.h
+ * @author Mike Scott
+ * @date 23rd February 2016
+ * @brief Big number Header File
+ *
+ *
+ */
+
+#ifndef BIG_B384_58_H
+#define BIG_B384_58_H
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <inttypes.h>
+#include "arch.h"
+#include "core.h"
+#include "config_big_B384_58.h"
+
+using namespace core;
+
+/* could comment this out if code size is a major issue */
+#define UNWOUND
+/* Normally recommended, but may not be optimal for some architectures, for example 32-bit ARM M4 */
+#define USE_KARATSUBA
+
+#define BIGBITS_B384_58 (8*MODBYTES_B384_58)
+#define NLEN_B384_58 (1+((8*MODBYTES_B384_58-1)/BASEBITS_B384_58))
+#define DNLEN_B384_58 2*NLEN_B384_58
+#define BMASK_B384_58 (((chunk)1<<BASEBITS_B384_58)-1) /**< Mask = 2^BASEBITS-1 */
+#define NEXCESS_B384_58 (1<<(CHUNK-BASEBITS_B384_58-1))           /**< 2^(CHUNK-BASEBITS-1) - digit cannot be multiplied by more than this before normalisation */
+
+#define HBITS_B384_58 (BASEBITS_B384_58/2)      /**< Number of bits in number base divided by 2 */
+#define HMASK_B384_58 (((chunk)1<<HBITS_B384_58)-1)    /**< Mask = 2^HBITS-1 */
+
+//#define DEBUG_NORM
+
+#ifdef DEBUG_NORM  /* Add an extra location to track chunk extension */
+#define MPV_B384_58 NLEN_B384_58
+#define MNV_B384_58 (NLEN_B384_58+1)
+#define DMPV_B384_58 DNLEN_B384_58
+#define DMNV_B384_58 (DNLEN_B384_58+1)
+
+#endif
+
+namespace B384_58 {
+
+//extern int BIGMULS;
+//extern int BIGSQRS;
+
+#ifdef DEBUG_NORM
+typedef chunk BIG[NLEN_B384_58 + 2]; /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B384_58 + 2]; /**< Define type DBIG as array of chunks */
+#else
+typedef chunk BIG[NLEN_B384_58];     /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B384_58];   /**< Define type DBIG as array of chunks */
+#endif
+
+/* BIG number prototypes */
+
+/**	@brief Tests for BIG equal to zero (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_iszilch(BIG x);
+/**	@brief Tests for BIG equal to one (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if one, else returns 0
+ */
+extern int BIG_isunity(BIG x);
+/**	@brief Tests for DBIG equal to zero (Constant Time)
+ *
+	@param x a DBIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_diszilch(DBIG x);
+/**	@brief Outputs a BIG number to the console (Variable Time)
+ *
+	@param x a BIG number
+ */
+extern void BIG_output(BIG x);
+/**	@brief Outputs a BIG number to the console in raw form (Variable Time for debugging)
+ *
+	@param x a BIG number
+ */
+extern void BIG_rawoutput(BIG x);
+/**	@brief Conditional constant time swap of two BIG numbers
+ *
+	Conditionally swaps parameters in constant time (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s swap takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cswap(BIG x, BIG y, int s);
+/**	@brief Conditional copy of BIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cmove(BIG x, BIG y, int s);
+/**	@brief Conditional copy of DBIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a DBIG number
+	@param y another DBIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_dcmove(BIG x, BIG y, int s);
+/**	@brief Convert from BIG number to byte array (Constant Time)
+ *
+	@param a byte array
+	@param x BIG number
+ */
+extern void BIG_toBytes(char *a, BIG x);
+/**	@brief Convert to BIG number from byte array (Constant Time)
+ *
+	@param x BIG number
+	@param a byte array
+ */
+extern void BIG_fromBytes(BIG x, char *a);
+/**	@brief Convert to BIG number from byte array of given length (Variable Time)
+ *
+	@param x BIG number
+	@param a byte array
+	@param s byte array length
+ */
+extern void BIG_fromBytesLen(BIG x, char *a, int s);
+/**@brief Convert to DBIG number from byte array of given length (Variable Time)
+ *
+   @param x DBIG number
+   @param a byte array
+   @param s byte array length
+ */
+extern void BIG_dfromBytesLen(DBIG x, char *a, int s);
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_doutput(DBIG x); 
+
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_drawoutput(DBIG x);
+
+/**	@brief Copy BIG from Read-Only Memory to a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number in ROM
+ */
+extern void BIG_rcopy(BIG x, const BIG y);
+/**	@brief Copy BIG to another BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_copy(BIG x, BIG y);
+/**	@brief Copy DBIG to another DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_dcopy(DBIG x, DBIG y);
+/**	@brief Copy BIG to upper half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dsucopy(DBIG x, BIG y);
+/**	@brief Copy BIG to lower half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dscopy(DBIG x, BIG y);
+/**	@brief Copy lower half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sdcopy(BIG x, DBIG y);
+/**	@brief Copy upper half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sducopy(BIG x, DBIG y);
+/**	@brief Set BIG to zero (Constant Time)
+ *
+	@param x BIG number to be set to zero  
+ */
+extern void BIG_zero(BIG x);
+/**	@brief Set DBIG to zero (Constant Time)
+ *
+	@param x DBIG number to be set to zero
+ */
+extern void BIG_dzero(DBIG x);
+/**	@brief Set BIG to one (unity) (Constant Time)
+ *
+	@param x BIG number to be set to one.
+ */
+extern void BIG_one(BIG x);
+/**	@brief Set BIG to inverse mod 2^256 (Constant Time)
+ *
+	@param x BIG number to be inverted
+ */
+extern void BIG_invmod2m(BIG x);
+/**	@brief Set BIG to sum of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, sum of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_add(BIG x, BIG y, BIG z);
+
+/**	@brief Set BIG to logical or of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, or of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_or(BIG x, BIG y, BIG z);
+
+/**	@brief Increment BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be incremented
+	@param i integer
+ */
+extern void BIG_inc(BIG x, int i);
+/**	@brief Set BIG to difference of two BIGs (Constant Time)
+ *
+	@param x BIG number, difference of other two - output not normalised
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_sub(BIG x, BIG y, BIG z);
+/**	@brief Decrement BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be decremented
+	@param i integer
+ */
+extern void BIG_dec(BIG x, int i);
+/**	@brief Set DBIG to sum of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, sum of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dadd(DBIG x, DBIG y, DBIG z);
+/**	@brief Set DBIG to difference of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, difference of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dsub(DBIG x, DBIG y, DBIG z);
+/**	@brief Multiply BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_imul(BIG x, BIG y, int i);
+/**	@brief Multiply BIG by not-so-small small integer - output normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+	@return Overflowing bits
+ */
+extern chunk BIG_pmul(BIG x, BIG y, int i);
+/**	@brief Divide BIG by 3 - output normalised (Constant Time)
+ *
+	@param x BIG number
+	@return Remainder
+ */
+extern int BIG_div3(BIG x);
+/**	@brief Multiply BIG by even bigger small integer resulting in a DBIG - output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_pxmul(DBIG x, BIG y, int i);
+/**	@brief Multiply BIG by another BIG resulting in DBIG - inputs normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_mul(DBIG x, BIG y, BIG z);
+/**	@brief Multiply BIG by another BIG resulting in another BIG - inputs normalised and output normalised (Constant Time)
+ *
+	Note that the product must fit into a BIG, and x must be distinct from y and z
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_smul(BIG x, BIG y, BIG z);
+/**	@brief Square BIG resulting in a DBIG - input normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, square of a BIG
+	@param y BIG number to be squared
+ */
+extern void BIG_sqr(DBIG x, BIG y);
+
+/**	@brief Montgomery reduction of a DBIG to a BIG  - input normalised and output normalised (Constant Time)
+ *
+	@param a BIG number, reduction of a BIG
+	@param md BIG number, the modulus
+	@param MC the Montgomery Constant
+	@param d DBIG number to be reduced
+ */
+extern void BIG_monty(BIG a, BIG md, chunk MC, DBIG d);
+
+/**	@brief Shifts a BIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shl(BIG x, int s);
+/**	@brief Fast shifts a BIG left by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Overflow bits
+ */
+extern int BIG_fshl(BIG x, int s);
+/**	@brief Shifts a DBIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshl(DBIG x, int s);
+/**	@brief Shifts a BIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shr(BIG x, int s);
+
+
+/**	@brief Fast time-critical combined shift by 1 bit, subtract and normalise (Constant Time)
+ *
+	@param r BIG number normalised output
+	@param a BIG number to be subtracted from
+	@param m BIG number to be shifted and subtracted
+	@return sign of r
+ */
+extern int BIG_ssn(BIG r, BIG a, BIG m);
+
+/**	@brief Fast shifts a BIG right by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Shifted out bits
+ */
+extern int BIG_fshr(BIG x, int s);
+/**	@brief Shifts a DBIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshr(DBIG x, int s);
+/**	@brief Splits a DBIG into two BIGs - input must be normalised, outputs normalised (Constant Time as used)
+ *
+	Internal function. The value of s must be approximately in the middle of the DBIG.
+	Typically used to extract z mod 2^MODBITS and z/2^MODBITS
+	@param x BIG number, top half of z
+	@param y BIG number, bottom half of z
+	@param z DBIG number to be split in two.
+	@param s Bit position at which to split
+	@return carry-out from top half
+ */
+extern chunk BIG_split(BIG x, BIG y, DBIG z, int s);
+/**	@brief Normalizes a BIG number - output normalised (Constant Time)
+ *
+	All digits of the input BIG are reduced mod 2^BASEBITS
+	@param x BIG number to be normalised
+ */
+extern chunk BIG_norm(BIG x);
+/**	@brief Normalizes a DBIG number - output normalised (Constant Time)
+ *
+	All digits of the input DBIG are reduced mod 2^BASEBITS
+	@param x DBIG number to be normalised
+ */
+extern void BIG_dnorm(DBIG x);
+/**	@brief Compares two BIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first BIG number to be compared
+	@param y second BIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_comp(BIG x, BIG y);
+/**	@brief Compares two DBIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first DBIG number to be compared
+	@param y second DBIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_dcomp(DBIG x, DBIG y);
+/**	@brief Calculate number of bits in a BIG - output normalised (Variable Time)
+ *
+	@param x BIG number
+	@return Number of bits in x
+ */
+extern int BIG_nbits(BIG x);
+/**	@brief Calculate number of bits in a DBIG - output normalised (Variable Time)
+ *
+	@param x DBIG number
+	@return Number of bits in x
+ */
+extern int BIG_dnbits(DBIG x);
+
+/**	@brief Reduce x mod n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctmod(BIG x, BIG n, int bd);
+
+/**	@brief  x=y mod n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctdmod(BIG x, DBIG y, BIG n, int bd);
+
+/**	@brief Divide x by n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctsdiv(BIG x,BIG n,int bd);
+
+/**	@brief  x=y/n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctddiv(BIG x, DBIG y, BIG n,int bd);
+
+
+/**	@brief Reduce x mod n - input and output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+ */
+extern void BIG_mod(BIG x, BIG n);
+/**	@brief Divide x by n - output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+ */
+extern void BIG_sdiv(BIG x, BIG n);
+/**	@brief  x=y mod n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_dmod(BIG x, DBIG y, BIG n);
+/**	@brief  x=y/n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_ddiv(BIG x, DBIG y, BIG n);
+/**	@brief  return parity of BIG, that is the least significant bit (Constant Time)
+ *
+	@param x BIG number
+	@return 0 or 1
+ */
+extern int BIG_parity(BIG x);
+/**	@brief  return i-th of BIG (Constant Time)
+ *
+	@param x BIG number
+	@param i the bit of x to be returned
+	@return 0 or 1
+ */
+extern int BIG_bit(BIG x, int i);
+/**	@brief  return least significant bits of a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param n number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int BIG_lastbits(BIG x, int n);
+/**	@brief  Create a random BIG from a random number generator (Constant Time)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_random(BIG x, csprng *r);
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randomnum(BIG x, BIG n, csprng *r);
+
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus and truncated to max bit length (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param t Maximum bit length
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randtrunc(BIG x, BIG n, int t, csprng *r);
+
+/**	brief  return NAF (Non-Adjacent-Form) value as +/- 1, 3 or 5, inputs must be normalised
+ *
+	Given x and 3*x extracts NAF value from given bit position, and returns number of bits processed, and number of trailing zeros detected if any
+	param x BIG number
+	param x3 BIG number, three times x
+	param i bit position
+	param nbs pointer to integer returning number of bits processed
+	param nzs pointer to integer returning number of trailing 0s
+	return + or - 1, 3 or 5
+*/
+
+/**	@brief  Calculate x=y*z mod n (Variable Time)
+ *
+	Slow method for modular multiplication
+	@param x BIG number, on exit = y*z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modmul(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y/z mod n (Variable Time)
+ *
+	Slow method for modular division
+	@param x BIG number, on exit = y/z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_moddiv(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y^2 mod n (Variable Time)
+ *
+	Slow method for modular squaring
+	@param x BIG number, on exit = y^2 mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modsqr(BIG x, BIG y, BIG n);
+/**	@brief  Calculate x=-y mod n (Variable Time)
+ *
+	Modular negation
+	@param x BIG number, on exit = -y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modneg(BIG x, BIG y, BIG n);
+
+/**	@brief  Calculate x=y+z mod n (Variable Time)
+ *
+	Slow method for modular addition
+	@param x BIG number, on exit = y+z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modadd(BIG x, BIG y, BIG z, BIG n);
+
+/**	@brief  Calculate jacobi Symbol (x/y) (Variable Time)
+ *
+	@param x BIG number
+	@param y BIG number
+	@return Jacobi symbol, -1,0 or 1
+ */
+extern int BIG_jacobi(BIG x, BIG y);
+/**	@brief  Calculate x=1/y mod n (Variable Time)
+ *
+	Modular Inversion - This is slow. Uses binary method.
+	@param x BIG number, on exit = 1/y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_invmodp(BIG x, BIG y, BIG n);
+/** @brief Calculate x=x mod 2^m (Variable Time)
+ *
+	Truncation
+	@param x BIG number, on reduced mod 2^m
+	@param m new truncated size
+*/
+extern void BIG_mod2m(BIG x, int m);
+
+/**	@brief Calculates a*b+c+*d
+ *
+	Calculate partial product of a.b, add in carry c, and add total to d (Constant Time)
+	@param a multiplier
+	@param b multiplicand
+	@param c carry
+	@param d pointer to accumulated bottom half of result
+	@return top half of result
+ */
+
+
+extern int step1(BIG,BIG,BIG);
+extern void step2(BIG,BIG,BIG);
+
+#ifdef dchunk
+
+/* Method required to calculate x*y+c+r, bottom half in r, top half returned */
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    dchunk prod = (dchunk)x * y + c + *r;
+    *r = (chunk)prod & BMASK_B384_58;
+    return (chunk)(prod >> BASEBITS_B384_58);
+}
+
+#else
+
+/* No integer type available that can store double the wordlength */
+/* accumulate partial products */
+
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    chunk x0, x1, y0, y1;
+    chunk bot, top, mid, carry;
+    x0 = x & HMASK_B384_58;
+    x1 = (x >> HBITS_B384_58);
+    y0 = y & HMASK_B384_58;
+    y1 = (y >> HBITS_B384_58);
+    bot = x0 * y0;
+    top = x1 * y1;
+    mid = x0 * y1 + x1 * y0;
+    x0 = mid & HMASK_B384_58;
+    x1 = (mid >> HBITS_B384_58);
+    bot += x0 << HBITS_B384_58;
+    bot += *r;
+    bot += c;
+
+    top += x1;
+    carry = bot >> BASEBITS_B384_58;
+    bot &= BMASK_B384_58;
+    top += carry;
+
+    *r = bot;
+    return top;
+}
+
+#endif
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/big_B416_60.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/big_B416_60.h
new file mode 100644
index 0000000..ce05134
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/big_B416_60.h
@@ -0,0 +1,697 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file big.h
+ * @author Mike Scott
+ * @date 23rd February 2016
+ * @brief Big number Header File
+ *
+ *
+ */
+
+#ifndef BIG_B416_60_H
+#define BIG_B416_60_H
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <inttypes.h>
+#include "arch.h"
+#include "core.h"
+#include "config_big_B416_60.h"
+
+using namespace core;
+
+/* could comment this out if code size is a major issue */
+#define UNWOUND
+/* Normally recommended, but may not be optimal for some architectures, for example 32-bit ARM M4 */
+#define USE_KARATSUBA
+
+#define BIGBITS_B416_60 (8*MODBYTES_B416_60)
+#define NLEN_B416_60 (1+((8*MODBYTES_B416_60-1)/BASEBITS_B416_60))
+#define DNLEN_B416_60 2*NLEN_B416_60
+#define BMASK_B416_60 (((chunk)1<<BASEBITS_B416_60)-1) /**< Mask = 2^BASEBITS-1 */
+#define NEXCESS_B416_60 (1<<(CHUNK-BASEBITS_B416_60-1))           /**< 2^(CHUNK-BASEBITS-1) - digit cannot be multiplied by more than this before normalisation */
+
+#define HBITS_B416_60 (BASEBITS_B416_60/2)      /**< Number of bits in number base divided by 2 */
+#define HMASK_B416_60 (((chunk)1<<HBITS_B416_60)-1)    /**< Mask = 2^HBITS-1 */
+
+//#define DEBUG_NORM
+
+#ifdef DEBUG_NORM  /* Add an extra location to track chunk extension */
+#define MPV_B416_60 NLEN_B416_60
+#define MNV_B416_60 (NLEN_B416_60+1)
+#define DMPV_B416_60 DNLEN_B416_60
+#define DMNV_B416_60 (DNLEN_B416_60+1)
+
+#endif
+
+namespace B416_60 {
+
+//extern int BIGMULS;
+//extern int BIGSQRS;
+
+#ifdef DEBUG_NORM
+typedef chunk BIG[NLEN_B416_60 + 2]; /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B416_60 + 2]; /**< Define type DBIG as array of chunks */
+#else
+typedef chunk BIG[NLEN_B416_60];     /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B416_60];   /**< Define type DBIG as array of chunks */
+#endif
+
+/* BIG number prototypes */
+
+/**	@brief Tests for BIG equal to zero (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_iszilch(BIG x);
+/**	@brief Tests for BIG equal to one (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if one, else returns 0
+ */
+extern int BIG_isunity(BIG x);
+/**	@brief Tests for DBIG equal to zero (Constant Time)
+ *
+	@param x a DBIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_diszilch(DBIG x);
+/**	@brief Outputs a BIG number to the console (Variable Time)
+ *
+	@param x a BIG number
+ */
+extern void BIG_output(BIG x);
+/**	@brief Outputs a BIG number to the console in raw form (Variable Time for debugging)
+ *
+	@param x a BIG number
+ */
+extern void BIG_rawoutput(BIG x);
+/**	@brief Conditional constant time swap of two BIG numbers
+ *
+	Conditionally swaps parameters in constant time (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s swap takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cswap(BIG x, BIG y, int s);
+/**	@brief Conditional copy of BIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cmove(BIG x, BIG y, int s);
+/**	@brief Conditional copy of DBIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a DBIG number
+	@param y another DBIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_dcmove(BIG x, BIG y, int s);
+/**	@brief Convert from BIG number to byte array (Constant Time)
+ *
+	@param a byte array
+	@param x BIG number
+ */
+extern void BIG_toBytes(char *a, BIG x);
+/**	@brief Convert to BIG number from byte array (Constant Time)
+ *
+	@param x BIG number
+	@param a byte array
+ */
+extern void BIG_fromBytes(BIG x, char *a);
+/**	@brief Convert to BIG number from byte array of given length (Variable Time)
+ *
+	@param x BIG number
+	@param a byte array
+	@param s byte array length
+ */
+extern void BIG_fromBytesLen(BIG x, char *a, int s);
+/**@brief Convert to DBIG number from byte array of given length (Variable Time)
+ *
+   @param x DBIG number
+   @param a byte array
+   @param s byte array length
+ */
+extern void BIG_dfromBytesLen(DBIG x, char *a, int s);
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_doutput(DBIG x); 
+
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_drawoutput(DBIG x);
+
+/**	@brief Copy BIG from Read-Only Memory to a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number in ROM
+ */
+extern void BIG_rcopy(BIG x, const BIG y);
+/**	@brief Copy BIG to another BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_copy(BIG x, BIG y);
+/**	@brief Copy DBIG to another DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_dcopy(DBIG x, DBIG y);
+/**	@brief Copy BIG to upper half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dsucopy(DBIG x, BIG y);
+/**	@brief Copy BIG to lower half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dscopy(DBIG x, BIG y);
+/**	@brief Copy lower half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sdcopy(BIG x, DBIG y);
+/**	@brief Copy upper half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sducopy(BIG x, DBIG y);
+/**	@brief Set BIG to zero (Constant Time)
+ *
+	@param x BIG number to be set to zero  
+ */
+extern void BIG_zero(BIG x);
+/**	@brief Set DBIG to zero (Constant Time)
+ *
+	@param x DBIG number to be set to zero
+ */
+extern void BIG_dzero(DBIG x);
+/**	@brief Set BIG to one (unity) (Constant Time)
+ *
+	@param x BIG number to be set to one.
+ */
+extern void BIG_one(BIG x);
+/**	@brief Set BIG to inverse mod 2^256 (Constant Time)
+ *
+	@param x BIG number to be inverted
+ */
+extern void BIG_invmod2m(BIG x);
+/**	@brief Set BIG to sum of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, sum of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_add(BIG x, BIG y, BIG z);
+
+/**	@brief Set BIG to logical or of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, or of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_or(BIG x, BIG y, BIG z);
+
+/**	@brief Increment BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be incremented
+	@param i integer
+ */
+extern void BIG_inc(BIG x, int i);
+/**	@brief Set BIG to difference of two BIGs (Constant Time)
+ *
+	@param x BIG number, difference of other two - output not normalised
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_sub(BIG x, BIG y, BIG z);
+/**	@brief Decrement BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be decremented
+	@param i integer
+ */
+extern void BIG_dec(BIG x, int i);
+/**	@brief Set DBIG to sum of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, sum of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dadd(DBIG x, DBIG y, DBIG z);
+/**	@brief Set DBIG to difference of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, difference of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dsub(DBIG x, DBIG y, DBIG z);
+/**	@brief Multiply BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_imul(BIG x, BIG y, int i);
+/**	@brief Multiply BIG by not-so-small small integer - output normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+	@return Overflowing bits
+ */
+extern chunk BIG_pmul(BIG x, BIG y, int i);
+/**	@brief Divide BIG by 3 - output normalised (Constant Time)
+ *
+	@param x BIG number
+	@return Remainder
+ */
+extern int BIG_div3(BIG x);
+/**	@brief Multiply BIG by even bigger small integer resulting in a DBIG - output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_pxmul(DBIG x, BIG y, int i);
+/**	@brief Multiply BIG by another BIG resulting in DBIG - inputs normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_mul(DBIG x, BIG y, BIG z);
+/**	@brief Multiply BIG by another BIG resulting in another BIG - inputs normalised and output normalised (Constant Time)
+ *
+	Note that the product must fit into a BIG, and x must be distinct from y and z
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_smul(BIG x, BIG y, BIG z);
+/**	@brief Square BIG resulting in a DBIG - input normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, square of a BIG
+	@param y BIG number to be squared
+ */
+extern void BIG_sqr(DBIG x, BIG y);
+
+/**	@brief Montgomery reduction of a DBIG to a BIG  - input normalised and output normalised (Constant Time)
+ *
+	@param a BIG number, reduction of a BIG
+	@param md BIG number, the modulus
+	@param MC the Montgomery Constant
+	@param d DBIG number to be reduced
+ */
+extern void BIG_monty(BIG a, BIG md, chunk MC, DBIG d);
+
+/**	@brief Shifts a BIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shl(BIG x, int s);
+/**	@brief Fast shifts a BIG left by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Overflow bits
+ */
+extern int BIG_fshl(BIG x, int s);
+/**	@brief Shifts a DBIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshl(DBIG x, int s);
+/**	@brief Shifts a BIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shr(BIG x, int s);
+
+
+/**	@brief Fast time-critical combined shift by 1 bit, subtract and normalise (Constant Time)
+ *
+	@param r BIG number normalised output
+	@param a BIG number to be subtracted from
+	@param m BIG number to be shifted and subtracted
+	@return sign of r
+ */
+extern int BIG_ssn(BIG r, BIG a, BIG m);
+
+/**	@brief Fast shifts a BIG right by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Shifted out bits
+ */
+extern int BIG_fshr(BIG x, int s);
+/**	@brief Shifts a DBIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshr(DBIG x, int s);
+/**	@brief Splits a DBIG into two BIGs - input must be normalised, outputs normalised (Constant Time as used)
+ *
+	Internal function. The value of s must be approximately in the middle of the DBIG.
+	Typically used to extract z mod 2^MODBITS and z/2^MODBITS
+	@param x BIG number, top half of z
+	@param y BIG number, bottom half of z
+	@param z DBIG number to be split in two.
+	@param s Bit position at which to split
+	@return carry-out from top half
+ */
+extern chunk BIG_split(BIG x, BIG y, DBIG z, int s);
+/**	@brief Normalizes a BIG number - output normalised (Constant Time)
+ *
+	All digits of the input BIG are reduced mod 2^BASEBITS
+	@param x BIG number to be normalised
+ */
+extern chunk BIG_norm(BIG x);
+/**	@brief Normalizes a DBIG number - output normalised (Constant Time)
+ *
+	All digits of the input DBIG are reduced mod 2^BASEBITS
+	@param x DBIG number to be normalised
+ */
+extern void BIG_dnorm(DBIG x);
+/**	@brief Compares two BIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first BIG number to be compared
+	@param y second BIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_comp(BIG x, BIG y);
+/**	@brief Compares two DBIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first DBIG number to be compared
+	@param y second DBIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_dcomp(DBIG x, DBIG y);
+/**	@brief Calculate number of bits in a BIG - output normalised (Variable Time)
+ *
+	@param x BIG number
+	@return Number of bits in x
+ */
+extern int BIG_nbits(BIG x);
+/**	@brief Calculate number of bits in a DBIG - output normalised (Variable Time)
+ *
+	@param x DBIG number
+	@return Number of bits in x
+ */
+extern int BIG_dnbits(DBIG x);
+
+/**	@brief Reduce x mod n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctmod(BIG x, BIG n, int bd);
+
+/**	@brief  x=y mod n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctdmod(BIG x, DBIG y, BIG n, int bd);
+
+/**	@brief Divide x by n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctsdiv(BIG x,BIG n,int bd);
+
+/**	@brief  x=y/n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctddiv(BIG x, DBIG y, BIG n,int bd);
+
+
+/**	@brief Reduce x mod n - input and output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+ */
+extern void BIG_mod(BIG x, BIG n);
+/**	@brief Divide x by n - output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+ */
+extern void BIG_sdiv(BIG x, BIG n);
+/**	@brief  x=y mod n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_dmod(BIG x, DBIG y, BIG n);
+/**	@brief  x=y/n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_ddiv(BIG x, DBIG y, BIG n);
+/**	@brief  return parity of BIG, that is the least significant bit (Constant Time)
+ *
+	@param x BIG number
+	@return 0 or 1
+ */
+extern int BIG_parity(BIG x);
+/**	@brief  return i-th of BIG (Constant Time)
+ *
+	@param x BIG number
+	@param i the bit of x to be returned
+	@return 0 or 1
+ */
+extern int BIG_bit(BIG x, int i);
+/**	@brief  return least significant bits of a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param n number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int BIG_lastbits(BIG x, int n);
+/**	@brief  Create a random BIG from a random number generator (Constant Time)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_random(BIG x, csprng *r);
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randomnum(BIG x, BIG n, csprng *r);
+
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus and truncated to max bit length (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param t Maximum bit length
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randtrunc(BIG x, BIG n, int t, csprng *r);
+
+/**	brief  return NAF (Non-Adjacent-Form) value as +/- 1, 3 or 5, inputs must be normalised
+ *
+	Given x and 3*x extracts NAF value from given bit position, and returns number of bits processed, and number of trailing zeros detected if any
+	param x BIG number
+	param x3 BIG number, three times x
+	param i bit position
+	param nbs pointer to integer returning number of bits processed
+	param nzs pointer to integer returning number of trailing 0s
+	return + or - 1, 3 or 5
+*/
+
+/**	@brief  Calculate x=y*z mod n (Variable Time)
+ *
+	Slow method for modular multiplication
+	@param x BIG number, on exit = y*z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modmul(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y/z mod n (Variable Time)
+ *
+	Slow method for modular division
+	@param x BIG number, on exit = y/z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_moddiv(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y^2 mod n (Variable Time)
+ *
+	Slow method for modular squaring
+	@param x BIG number, on exit = y^2 mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modsqr(BIG x, BIG y, BIG n);
+/**	@brief  Calculate x=-y mod n (Variable Time)
+ *
+	Modular negation
+	@param x BIG number, on exit = -y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modneg(BIG x, BIG y, BIG n);
+
+/**	@brief  Calculate x=y+z mod n (Variable Time)
+ *
+	Slow method for modular addition
+	@param x BIG number, on exit = y+z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modadd(BIG x, BIG y, BIG z, BIG n);
+
+/**	@brief  Calculate jacobi Symbol (x/y) (Variable Time)
+ *
+	@param x BIG number
+	@param y BIG number
+	@return Jacobi symbol, -1,0 or 1
+ */
+extern int BIG_jacobi(BIG x, BIG y);
+/**	@brief  Calculate x=1/y mod n (Variable Time)
+ *
+	Modular Inversion - This is slow. Uses binary method.
+	@param x BIG number, on exit = 1/y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_invmodp(BIG x, BIG y, BIG n);
+/** @brief Calculate x=x mod 2^m (Variable Time)
+ *
+	Truncation
+	@param x BIG number, on reduced mod 2^m
+	@param m new truncated size
+*/
+extern void BIG_mod2m(BIG x, int m);
+
+/**	@brief Calculates a*b+c+*d
+ *
+	Calculate partial product of a.b, add in carry c, and add total to d (Constant Time)
+	@param a multiplier
+	@param b multiplicand
+	@param c carry
+	@param d pointer to accumulated bottom half of result
+	@return top half of result
+ */
+
+
+extern int step1(BIG,BIG,BIG);
+extern void step2(BIG,BIG,BIG);
+
+#ifdef dchunk
+
+/* Method required to calculate x*y+c+r, bottom half in r, top half returned */
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    dchunk prod = (dchunk)x * y + c + *r;
+    *r = (chunk)prod & BMASK_B416_60;
+    return (chunk)(prod >> BASEBITS_B416_60);
+}
+
+#else
+
+/* No integer type available that can store double the wordlength */
+/* accumulate partial products */
+
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    chunk x0, x1, y0, y1;
+    chunk bot, top, mid, carry;
+    x0 = x & HMASK_B416_60;
+    x1 = (x >> HBITS_B416_60);
+    y0 = y & HMASK_B416_60;
+    y1 = (y >> HBITS_B416_60);
+    bot = x0 * y0;
+    top = x1 * y1;
+    mid = x0 * y1 + x1 * y0;
+    x0 = mid & HMASK_B416_60;
+    x1 = (mid >> HBITS_B416_60);
+    bot += x0 << HBITS_B416_60;
+    bot += *r;
+    bot += c;
+
+    top += x1;
+    carry = bot >> BASEBITS_B416_60;
+    bot &= BMASK_B416_60;
+    top += carry;
+
+    *r = bot;
+    return top;
+}
+
+#endif
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/big_B448_58.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/big_B448_58.h
new file mode 100644
index 0000000..1ad28ee
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/big_B448_58.h
@@ -0,0 +1,697 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file big.h
+ * @author Mike Scott
+ * @date 23rd February 2016
+ * @brief Big number Header File
+ *
+ *
+ */
+
+#ifndef BIG_B448_58_H
+#define BIG_B448_58_H
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <inttypes.h>
+#include "arch.h"
+#include "core.h"
+#include "config_big_B448_58.h"
+
+using namespace core;
+
+/* could comment this out if code size is a major issue */
+#define UNWOUND
+/* Normally recommended, but may not be optimal for some architectures, for example 32-bit ARM M4 */
+#define USE_KARATSUBA
+
+#define BIGBITS_B448_58 (8*MODBYTES_B448_58)
+#define NLEN_B448_58 (1+((8*MODBYTES_B448_58-1)/BASEBITS_B448_58))
+#define DNLEN_B448_58 2*NLEN_B448_58
+#define BMASK_B448_58 (((chunk)1<<BASEBITS_B448_58)-1) /**< Mask = 2^BASEBITS-1 */
+#define NEXCESS_B448_58 (1<<(CHUNK-BASEBITS_B448_58-1))           /**< 2^(CHUNK-BASEBITS-1) - digit cannot be multiplied by more than this before normalisation */
+
+#define HBITS_B448_58 (BASEBITS_B448_58/2)      /**< Number of bits in number base divided by 2 */
+#define HMASK_B448_58 (((chunk)1<<HBITS_B448_58)-1)    /**< Mask = 2^HBITS-1 */
+
+//#define DEBUG_NORM
+
+#ifdef DEBUG_NORM  /* Add an extra location to track chunk extension */
+#define MPV_B448_58 NLEN_B448_58
+#define MNV_B448_58 (NLEN_B448_58+1)
+#define DMPV_B448_58 DNLEN_B448_58
+#define DMNV_B448_58 (DNLEN_B448_58+1)
+
+#endif
+
+namespace B448_58 {
+
+//extern int BIGMULS;
+//extern int BIGSQRS;
+
+#ifdef DEBUG_NORM
+typedef chunk BIG[NLEN_B448_58 + 2]; /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B448_58 + 2]; /**< Define type DBIG as array of chunks */
+#else
+typedef chunk BIG[NLEN_B448_58];     /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B448_58];   /**< Define type DBIG as array of chunks */
+#endif
+
+/* BIG number prototypes */
+
+/**	@brief Tests for BIG equal to zero (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_iszilch(BIG x);
+/**	@brief Tests for BIG equal to one (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if one, else returns 0
+ */
+extern int BIG_isunity(BIG x);
+/**	@brief Tests for DBIG equal to zero (Constant Time)
+ *
+	@param x a DBIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_diszilch(DBIG x);
+/**	@brief Outputs a BIG number to the console (Variable Time)
+ *
+	@param x a BIG number
+ */
+extern void BIG_output(BIG x);
+/**	@brief Outputs a BIG number to the console in raw form (Variable Time for debugging)
+ *
+	@param x a BIG number
+ */
+extern void BIG_rawoutput(BIG x);
+/**	@brief Conditional constant time swap of two BIG numbers
+ *
+	Conditionally swaps parameters in constant time (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s swap takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cswap(BIG x, BIG y, int s);
+/**	@brief Conditional copy of BIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cmove(BIG x, BIG y, int s);
+/**	@brief Conditional copy of DBIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a DBIG number
+	@param y another DBIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_dcmove(BIG x, BIG y, int s);
+/**	@brief Convert from BIG number to byte array (Constant Time)
+ *
+	@param a byte array
+	@param x BIG number
+ */
+extern void BIG_toBytes(char *a, BIG x);
+/**	@brief Convert to BIG number from byte array (Constant Time)
+ *
+	@param x BIG number
+	@param a byte array
+ */
+extern void BIG_fromBytes(BIG x, char *a);
+/**	@brief Convert to BIG number from byte array of given length (Variable Time)
+ *
+	@param x BIG number
+	@param a byte array
+	@param s byte array length
+ */
+extern void BIG_fromBytesLen(BIG x, char *a, int s);
+/**@brief Convert to DBIG number from byte array of given length (Variable Time)
+ *
+   @param x DBIG number
+   @param a byte array
+   @param s byte array length
+ */
+extern void BIG_dfromBytesLen(DBIG x, char *a, int s);
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_doutput(DBIG x); 
+
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_drawoutput(DBIG x);
+
+/**	@brief Copy BIG from Read-Only Memory to a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number in ROM
+ */
+extern void BIG_rcopy(BIG x, const BIG y);
+/**	@brief Copy BIG to another BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_copy(BIG x, BIG y);
+/**	@brief Copy DBIG to another DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_dcopy(DBIG x, DBIG y);
+/**	@brief Copy BIG to upper half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dsucopy(DBIG x, BIG y);
+/**	@brief Copy BIG to lower half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dscopy(DBIG x, BIG y);
+/**	@brief Copy lower half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sdcopy(BIG x, DBIG y);
+/**	@brief Copy upper half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sducopy(BIG x, DBIG y);
+/**	@brief Set BIG to zero (Constant Time)
+ *
+	@param x BIG number to be set to zero  
+ */
+extern void BIG_zero(BIG x);
+/**	@brief Set DBIG to zero (Constant Time)
+ *
+	@param x DBIG number to be set to zero
+ */
+extern void BIG_dzero(DBIG x);
+/**	@brief Set BIG to one (unity) (Constant Time)
+ *
+	@param x BIG number to be set to one.
+ */
+extern void BIG_one(BIG x);
+/**	@brief Set BIG to inverse mod 2^256 (Constant Time)
+ *
+	@param x BIG number to be inverted
+ */
+extern void BIG_invmod2m(BIG x);
+/**	@brief Set BIG to sum of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, sum of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_add(BIG x, BIG y, BIG z);
+
+/**	@brief Set BIG to logical or of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, or of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_or(BIG x, BIG y, BIG z);
+
+/**	@brief Increment BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be incremented
+	@param i integer
+ */
+extern void BIG_inc(BIG x, int i);
+/**	@brief Set BIG to difference of two BIGs (Constant Time)
+ *
+	@param x BIG number, difference of other two - output not normalised
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_sub(BIG x, BIG y, BIG z);
+/**	@brief Decrement BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be decremented
+	@param i integer
+ */
+extern void BIG_dec(BIG x, int i);
+/**	@brief Set DBIG to sum of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, sum of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dadd(DBIG x, DBIG y, DBIG z);
+/**	@brief Set DBIG to difference of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, difference of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dsub(DBIG x, DBIG y, DBIG z);
+/**	@brief Multiply BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_imul(BIG x, BIG y, int i);
+/**	@brief Multiply BIG by not-so-small small integer - output normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+	@return Overflowing bits
+ */
+extern chunk BIG_pmul(BIG x, BIG y, int i);
+/**	@brief Divide BIG by 3 - output normalised (Constant Time)
+ *
+	@param x BIG number
+	@return Remainder
+ */
+extern int BIG_div3(BIG x);
+/**	@brief Multiply BIG by even bigger small integer resulting in a DBIG - output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_pxmul(DBIG x, BIG y, int i);
+/**	@brief Multiply BIG by another BIG resulting in DBIG - inputs normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_mul(DBIG x, BIG y, BIG z);
+/**	@brief Multiply BIG by another BIG resulting in another BIG - inputs normalised and output normalised (Constant Time)
+ *
+	Note that the product must fit into a BIG, and x must be distinct from y and z
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_smul(BIG x, BIG y, BIG z);
+/**	@brief Square BIG resulting in a DBIG - input normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, square of a BIG
+	@param y BIG number to be squared
+ */
+extern void BIG_sqr(DBIG x, BIG y);
+
+/**	@brief Montgomery reduction of a DBIG to a BIG  - input normalised and output normalised (Constant Time)
+ *
+	@param a BIG number, reduction of a BIG
+	@param md BIG number, the modulus
+	@param MC the Montgomery Constant
+	@param d DBIG number to be reduced
+ */
+extern void BIG_monty(BIG a, BIG md, chunk MC, DBIG d);
+
+/**	@brief Shifts a BIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shl(BIG x, int s);
+/**	@brief Fast shifts a BIG left by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Overflow bits
+ */
+extern int BIG_fshl(BIG x, int s);
+/**	@brief Shifts a DBIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshl(DBIG x, int s);
+/**	@brief Shifts a BIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shr(BIG x, int s);
+
+
+/**	@brief Fast time-critical combined shift by 1 bit, subtract and normalise (Constant Time)
+ *
+	@param r BIG number normalised output
+	@param a BIG number to be subtracted from
+	@param m BIG number to be shifted and subtracted
+	@return sign of r
+ */
+extern int BIG_ssn(BIG r, BIG a, BIG m);
+
+/**	@brief Fast shifts a BIG right by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Shifted out bits
+ */
+extern int BIG_fshr(BIG x, int s);
+/**	@brief Shifts a DBIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshr(DBIG x, int s);
+/**	@brief Splits a DBIG into two BIGs - input must be normalised, outputs normalised (Constant Time as used)
+ *
+	Internal function. The value of s must be approximately in the middle of the DBIG.
+	Typically used to extract z mod 2^MODBITS and z/2^MODBITS
+	@param x BIG number, top half of z
+	@param y BIG number, bottom half of z
+	@param z DBIG number to be split in two.
+	@param s Bit position at which to split
+	@return carry-out from top half
+ */
+extern chunk BIG_split(BIG x, BIG y, DBIG z, int s);
+/**	@brief Normalizes a BIG number - output normalised (Constant Time)
+ *
+	All digits of the input BIG are reduced mod 2^BASEBITS
+	@param x BIG number to be normalised
+ */
+extern chunk BIG_norm(BIG x);
+/**	@brief Normalizes a DBIG number - output normalised (Constant Time)
+ *
+	All digits of the input DBIG are reduced mod 2^BASEBITS
+	@param x DBIG number to be normalised
+ */
+extern void BIG_dnorm(DBIG x);
+/**	@brief Compares two BIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first BIG number to be compared
+	@param y second BIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_comp(BIG x, BIG y);
+/**	@brief Compares two DBIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first DBIG number to be compared
+	@param y second DBIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_dcomp(DBIG x, DBIG y);
+/**	@brief Calculate number of bits in a BIG - output normalised (Variable Time)
+ *
+	@param x BIG number
+	@return Number of bits in x
+ */
+extern int BIG_nbits(BIG x);
+/**	@brief Calculate number of bits in a DBIG - output normalised (Variable Time)
+ *
+	@param x DBIG number
+	@return Number of bits in x
+ */
+extern int BIG_dnbits(DBIG x);
+
+/**	@brief Reduce x mod n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctmod(BIG x, BIG n, int bd);
+
+/**	@brief  x=y mod n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctdmod(BIG x, DBIG y, BIG n, int bd);
+
+/**	@brief Divide x by n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctsdiv(BIG x,BIG n,int bd);
+
+/**	@brief  x=y/n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctddiv(BIG x, DBIG y, BIG n,int bd);
+
+
+/**	@brief Reduce x mod n - input and output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+ */
+extern void BIG_mod(BIG x, BIG n);
+/**	@brief Divide x by n - output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+ */
+extern void BIG_sdiv(BIG x, BIG n);
+/**	@brief  x=y mod n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_dmod(BIG x, DBIG y, BIG n);
+/**	@brief  x=y/n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_ddiv(BIG x, DBIG y, BIG n);
+/**	@brief  return parity of BIG, that is the least significant bit (Constant Time)
+ *
+	@param x BIG number
+	@return 0 or 1
+ */
+extern int BIG_parity(BIG x);
+/**	@brief  return i-th of BIG (Constant Time)
+ *
+	@param x BIG number
+	@param i the bit of x to be returned
+	@return 0 or 1
+ */
+extern int BIG_bit(BIG x, int i);
+/**	@brief  return least significant bits of a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param n number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int BIG_lastbits(BIG x, int n);
+/**	@brief  Create a random BIG from a random number generator (Constant Time)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_random(BIG x, csprng *r);
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randomnum(BIG x, BIG n, csprng *r);
+
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus and truncated to max bit length (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param t Maximum bit length
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randtrunc(BIG x, BIG n, int t, csprng *r);
+
+/**	brief  return NAF (Non-Adjacent-Form) value as +/- 1, 3 or 5, inputs must be normalised
+ *
+	Given x and 3*x extracts NAF value from given bit position, and returns number of bits processed, and number of trailing zeros detected if any
+	param x BIG number
+	param x3 BIG number, three times x
+	param i bit position
+	param nbs pointer to integer returning number of bits processed
+	param nzs pointer to integer returning number of trailing 0s
+	return + or - 1, 3 or 5
+*/
+
+/**	@brief  Calculate x=y*z mod n (Variable Time)
+ *
+	Slow method for modular multiplication
+	@param x BIG number, on exit = y*z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modmul(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y/z mod n (Variable Time)
+ *
+	Slow method for modular division
+	@param x BIG number, on exit = y/z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_moddiv(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y^2 mod n (Variable Time)
+ *
+	Slow method for modular squaring
+	@param x BIG number, on exit = y^2 mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modsqr(BIG x, BIG y, BIG n);
+/**	@brief  Calculate x=-y mod n (Variable Time)
+ *
+	Modular negation
+	@param x BIG number, on exit = -y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modneg(BIG x, BIG y, BIG n);
+
+/**	@brief  Calculate x=y+z mod n (Variable Time)
+ *
+	Slow method for modular addition
+	@param x BIG number, on exit = y+z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modadd(BIG x, BIG y, BIG z, BIG n);
+
+/**	@brief  Calculate jacobi Symbol (x/y) (Variable Time)
+ *
+	@param x BIG number
+	@param y BIG number
+	@return Jacobi symbol, -1,0 or 1
+ */
+extern int BIG_jacobi(BIG x, BIG y);
+/**	@brief  Calculate x=1/y mod n (Variable Time)
+ *
+	Modular Inversion - This is slow. Uses binary method.
+	@param x BIG number, on exit = 1/y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_invmodp(BIG x, BIG y, BIG n);
+/** @brief Calculate x=x mod 2^m (Variable Time)
+ *
+	Truncation
+	@param x BIG number, on reduced mod 2^m
+	@param m new truncated size
+*/
+extern void BIG_mod2m(BIG x, int m);
+
+/**	@brief Calculates a*b+c+*d
+ *
+	Calculate partial product of a.b, add in carry c, and add total to d (Constant Time)
+	@param a multiplier
+	@param b multiplicand
+	@param c carry
+	@param d pointer to accumulated bottom half of result
+	@return top half of result
+ */
+
+
+extern int step1(BIG,BIG,BIG);
+extern void step2(BIG,BIG,BIG);
+
+#ifdef dchunk
+
+/* Method required to calculate x*y+c+r, bottom half in r, top half returned */
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    dchunk prod = (dchunk)x * y + c + *r;
+    *r = (chunk)prod & BMASK_B448_58;
+    return (chunk)(prod >> BASEBITS_B448_58);
+}
+
+#else
+
+/* No integer type available that can store double the wordlength */
+/* accumulate partial products */
+
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    chunk x0, x1, y0, y1;
+    chunk bot, top, mid, carry;
+    x0 = x & HMASK_B448_58;
+    x1 = (x >> HBITS_B448_58);
+    y0 = y & HMASK_B448_58;
+    y1 = (y >> HBITS_B448_58);
+    bot = x0 * y0;
+    top = x1 * y1;
+    mid = x0 * y1 + x1 * y0;
+    x0 = mid & HMASK_B448_58;
+    x1 = (mid >> HBITS_B448_58);
+    bot += x0 << HBITS_B448_58;
+    bot += *r;
+    bot += c;
+
+    top += x1;
+    carry = bot >> BASEBITS_B448_58;
+    bot &= BMASK_B448_58;
+    top += carry;
+
+    *r = bot;
+    return top;
+}
+
+#endif
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/big_B448_60.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/big_B448_60.h
new file mode 100644
index 0000000..426c032
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/big_B448_60.h
@@ -0,0 +1,697 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file big.h
+ * @author Mike Scott
+ * @date 23rd February 2016
+ * @brief Big number Header File
+ *
+ *
+ */
+
+#ifndef BIG_B448_60_H
+#define BIG_B448_60_H
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <inttypes.h>
+#include "arch.h"
+#include "core.h"
+#include "config_big_B448_60.h"
+
+using namespace core;
+
+/* could comment this out if code size is a major issue */
+#define UNWOUND
+/* Normally recommended, but may not be optimal for some architectures, for example 32-bit ARM M4 */
+#define USE_KARATSUBA
+
+#define BIGBITS_B448_60 (8*MODBYTES_B448_60)
+#define NLEN_B448_60 (1+((8*MODBYTES_B448_60-1)/BASEBITS_B448_60))
+#define DNLEN_B448_60 2*NLEN_B448_60
+#define BMASK_B448_60 (((chunk)1<<BASEBITS_B448_60)-1) /**< Mask = 2^BASEBITS-1 */
+#define NEXCESS_B448_60 (1<<(CHUNK-BASEBITS_B448_60-1))           /**< 2^(CHUNK-BASEBITS-1) - digit cannot be multiplied by more than this before normalisation */
+
+#define HBITS_B448_60 (BASEBITS_B448_60/2)      /**< Number of bits in number base divided by 2 */
+#define HMASK_B448_60 (((chunk)1<<HBITS_B448_60)-1)    /**< Mask = 2^HBITS-1 */
+
+//#define DEBUG_NORM
+
+#ifdef DEBUG_NORM  /* Add an extra location to track chunk extension */
+#define MPV_B448_60 NLEN_B448_60
+#define MNV_B448_60 (NLEN_B448_60+1)
+#define DMPV_B448_60 DNLEN_B448_60
+#define DMNV_B448_60 (DNLEN_B448_60+1)
+
+#endif
+
+namespace B448_60 {
+
+//extern int BIGMULS;
+//extern int BIGSQRS;
+
+#ifdef DEBUG_NORM
+typedef chunk BIG[NLEN_B448_60 + 2]; /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B448_60 + 2]; /**< Define type DBIG as array of chunks */
+#else
+typedef chunk BIG[NLEN_B448_60];     /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B448_60];   /**< Define type DBIG as array of chunks */
+#endif
+
+/* BIG number prototypes */
+
+/**	@brief Tests for BIG equal to zero (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_iszilch(BIG x);
+/**	@brief Tests for BIG equal to one (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if one, else returns 0
+ */
+extern int BIG_isunity(BIG x);
+/**	@brief Tests for DBIG equal to zero (Constant Time)
+ *
+	@param x a DBIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_diszilch(DBIG x);
+/**	@brief Outputs a BIG number to the console (Variable Time)
+ *
+	@param x a BIG number
+ */
+extern void BIG_output(BIG x);
+/**	@brief Outputs a BIG number to the console in raw form (Variable Time for debugging)
+ *
+	@param x a BIG number
+ */
+extern void BIG_rawoutput(BIG x);
+/**	@brief Conditional constant time swap of two BIG numbers
+ *
+	Conditionally swaps parameters in constant time (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s swap takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cswap(BIG x, BIG y, int s);
+/**	@brief Conditional copy of BIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cmove(BIG x, BIG y, int s);
+/**	@brief Conditional copy of DBIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a DBIG number
+	@param y another DBIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_dcmove(BIG x, BIG y, int s);
+/**	@brief Convert from BIG number to byte array (Constant Time)
+ *
+	@param a byte array
+	@param x BIG number
+ */
+extern void BIG_toBytes(char *a, BIG x);
+/**	@brief Convert to BIG number from byte array (Constant Time)
+ *
+	@param x BIG number
+	@param a byte array
+ */
+extern void BIG_fromBytes(BIG x, char *a);
+/**	@brief Convert to BIG number from byte array of given length (Variable Time)
+ *
+	@param x BIG number
+	@param a byte array
+	@param s byte array length
+ */
+extern void BIG_fromBytesLen(BIG x, char *a, int s);
+/**@brief Convert to DBIG number from byte array of given length (Variable Time)
+ *
+   @param x DBIG number
+   @param a byte array
+   @param s byte array length
+ */
+extern void BIG_dfromBytesLen(DBIG x, char *a, int s);
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_doutput(DBIG x); 
+
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_drawoutput(DBIG x);
+
+/**	@brief Copy BIG from Read-Only Memory to a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number in ROM
+ */
+extern void BIG_rcopy(BIG x, const BIG y);
+/**	@brief Copy BIG to another BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_copy(BIG x, BIG y);
+/**	@brief Copy DBIG to another DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_dcopy(DBIG x, DBIG y);
+/**	@brief Copy BIG to upper half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dsucopy(DBIG x, BIG y);
+/**	@brief Copy BIG to lower half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dscopy(DBIG x, BIG y);
+/**	@brief Copy lower half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sdcopy(BIG x, DBIG y);
+/**	@brief Copy upper half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sducopy(BIG x, DBIG y);
+/**	@brief Set BIG to zero (Constant Time)
+ *
+	@param x BIG number to be set to zero  
+ */
+extern void BIG_zero(BIG x);
+/**	@brief Set DBIG to zero (Constant Time)
+ *
+	@param x DBIG number to be set to zero
+ */
+extern void BIG_dzero(DBIG x);
+/**	@brief Set BIG to one (unity) (Constant Time)
+ *
+	@param x BIG number to be set to one.
+ */
+extern void BIG_one(BIG x);
+/**	@brief Set BIG to inverse mod 2^256 (Constant Time)
+ *
+	@param x BIG number to be inverted
+ */
+extern void BIG_invmod2m(BIG x);
+/**	@brief Set BIG to sum of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, sum of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_add(BIG x, BIG y, BIG z);
+
+/**	@brief Set BIG to logical or of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, or of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_or(BIG x, BIG y, BIG z);
+
+/**	@brief Increment BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be incremented
+	@param i integer
+ */
+extern void BIG_inc(BIG x, int i);
+/**	@brief Set BIG to difference of two BIGs (Constant Time)
+ *
+	@param x BIG number, difference of other two - output not normalised
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_sub(BIG x, BIG y, BIG z);
+/**	@brief Decrement BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be decremented
+	@param i integer
+ */
+extern void BIG_dec(BIG x, int i);
+/**	@brief Set DBIG to sum of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, sum of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dadd(DBIG x, DBIG y, DBIG z);
+/**	@brief Set DBIG to difference of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, difference of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dsub(DBIG x, DBIG y, DBIG z);
+/**	@brief Multiply BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_imul(BIG x, BIG y, int i);
+/**	@brief Multiply BIG by not-so-small small integer - output normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+	@return Overflowing bits
+ */
+extern chunk BIG_pmul(BIG x, BIG y, int i);
+/**	@brief Divide BIG by 3 - output normalised (Constant Time)
+ *
+	@param x BIG number
+	@return Remainder
+ */
+extern int BIG_div3(BIG x);
+/**	@brief Multiply BIG by even bigger small integer resulting in a DBIG - output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_pxmul(DBIG x, BIG y, int i);
+/**	@brief Multiply BIG by another BIG resulting in DBIG - inputs normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_mul(DBIG x, BIG y, BIG z);
+/**	@brief Multiply BIG by another BIG resulting in another BIG - inputs normalised and output normalised (Constant Time)
+ *
+	Note that the product must fit into a BIG, and x must be distinct from y and z
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_smul(BIG x, BIG y, BIG z);
+/**	@brief Square BIG resulting in a DBIG - input normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, square of a BIG
+	@param y BIG number to be squared
+ */
+extern void BIG_sqr(DBIG x, BIG y);
+
+/**	@brief Montgomery reduction of a DBIG to a BIG  - input normalised and output normalised (Constant Time)
+ *
+	@param a BIG number, reduction of a BIG
+	@param md BIG number, the modulus
+	@param MC the Montgomery Constant
+	@param d DBIG number to be reduced
+ */
+extern void BIG_monty(BIG a, BIG md, chunk MC, DBIG d);
+
+/**	@brief Shifts a BIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shl(BIG x, int s);
+/**	@brief Fast shifts a BIG left by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Overflow bits
+ */
+extern int BIG_fshl(BIG x, int s);
+/**	@brief Shifts a DBIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshl(DBIG x, int s);
+/**	@brief Shifts a BIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shr(BIG x, int s);
+
+
+/**	@brief Fast time-critical combined shift by 1 bit, subtract and normalise (Constant Time)
+ *
+	@param r BIG number normalised output
+	@param a BIG number to be subtracted from
+	@param m BIG number to be shifted and subtracted
+	@return sign of r
+ */
+extern int BIG_ssn(BIG r, BIG a, BIG m);
+
+/**	@brief Fast shifts a BIG right by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Shifted out bits
+ */
+extern int BIG_fshr(BIG x, int s);
+/**	@brief Shifts a DBIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshr(DBIG x, int s);
+/**	@brief Splits a DBIG into two BIGs - input must be normalised, outputs normalised (Constant Time as used)
+ *
+	Internal function. The value of s must be approximately in the middle of the DBIG.
+	Typically used to extract z mod 2^MODBITS and z/2^MODBITS
+	@param x BIG number, top half of z
+	@param y BIG number, bottom half of z
+	@param z DBIG number to be split in two.
+	@param s Bit position at which to split
+	@return carry-out from top half
+ */
+extern chunk BIG_split(BIG x, BIG y, DBIG z, int s);
+/**	@brief Normalizes a BIG number - output normalised (Constant Time)
+ *
+	All digits of the input BIG are reduced mod 2^BASEBITS
+	@param x BIG number to be normalised
+ */
+extern chunk BIG_norm(BIG x);
+/**	@brief Normalizes a DBIG number - output normalised (Constant Time)
+ *
+	All digits of the input DBIG are reduced mod 2^BASEBITS
+	@param x DBIG number to be normalised
+ */
+extern void BIG_dnorm(DBIG x);
+/**	@brief Compares two BIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first BIG number to be compared
+	@param y second BIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_comp(BIG x, BIG y);
+/**	@brief Compares two DBIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first DBIG number to be compared
+	@param y second DBIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_dcomp(DBIG x, DBIG y);
+/**	@brief Calculate number of bits in a BIG - output normalised (Variable Time)
+ *
+	@param x BIG number
+	@return Number of bits in x
+ */
+extern int BIG_nbits(BIG x);
+/**	@brief Calculate number of bits in a DBIG - output normalised (Variable Time)
+ *
+	@param x DBIG number
+	@return Number of bits in x
+ */
+extern int BIG_dnbits(DBIG x);
+
+/**	@brief Reduce x mod n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctmod(BIG x, BIG n, int bd);
+
+/**	@brief  x=y mod n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctdmod(BIG x, DBIG y, BIG n, int bd);
+
+/**	@brief Divide x by n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctsdiv(BIG x,BIG n,int bd);
+
+/**	@brief  x=y/n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctddiv(BIG x, DBIG y, BIG n,int bd);
+
+
+/**	@brief Reduce x mod n - input and output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+ */
+extern void BIG_mod(BIG x, BIG n);
+/**	@brief Divide x by n - output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+ */
+extern void BIG_sdiv(BIG x, BIG n);
+/**	@brief  x=y mod n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_dmod(BIG x, DBIG y, BIG n);
+/**	@brief  x=y/n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_ddiv(BIG x, DBIG y, BIG n);
+/**	@brief  return parity of BIG, that is the least significant bit (Constant Time)
+ *
+	@param x BIG number
+	@return 0 or 1
+ */
+extern int BIG_parity(BIG x);
+/**	@brief  return i-th of BIG (Constant Time)
+ *
+	@param x BIG number
+	@param i the bit of x to be returned
+	@return 0 or 1
+ */
+extern int BIG_bit(BIG x, int i);
+/**	@brief  return least significant bits of a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param n number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int BIG_lastbits(BIG x, int n);
+/**	@brief  Create a random BIG from a random number generator (Constant Time)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_random(BIG x, csprng *r);
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randomnum(BIG x, BIG n, csprng *r);
+
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus and truncated to max bit length (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param t Maximum bit length
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randtrunc(BIG x, BIG n, int t, csprng *r);
+
+/**	brief  return NAF (Non-Adjacent-Form) value as +/- 1, 3 or 5, inputs must be normalised
+ *
+	Given x and 3*x extracts NAF value from given bit position, and returns number of bits processed, and number of trailing zeros detected if any
+	param x BIG number
+	param x3 BIG number, three times x
+	param i bit position
+	param nbs pointer to integer returning number of bits processed
+	param nzs pointer to integer returning number of trailing 0s
+	return + or - 1, 3 or 5
+*/
+
+/**	@brief  Calculate x=y*z mod n (Variable Time)
+ *
+	Slow method for modular multiplication
+	@param x BIG number, on exit = y*z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modmul(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y/z mod n (Variable Time)
+ *
+	Slow method for modular division
+	@param x BIG number, on exit = y/z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_moddiv(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y^2 mod n (Variable Time)
+ *
+	Slow method for modular squaring
+	@param x BIG number, on exit = y^2 mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modsqr(BIG x, BIG y, BIG n);
+/**	@brief  Calculate x=-y mod n (Variable Time)
+ *
+	Modular negation
+	@param x BIG number, on exit = -y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modneg(BIG x, BIG y, BIG n);
+
+/**	@brief  Calculate x=y+z mod n (Variable Time)
+ *
+	Slow method for modular addition
+	@param x BIG number, on exit = y+z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modadd(BIG x, BIG y, BIG z, BIG n);
+
+/**	@brief  Calculate jacobi Symbol (x/y) (Variable Time)
+ *
+	@param x BIG number
+	@param y BIG number
+	@return Jacobi symbol, -1,0 or 1
+ */
+extern int BIG_jacobi(BIG x, BIG y);
+/**	@brief  Calculate x=1/y mod n (Variable Time)
+ *
+	Modular Inversion - This is slow. Uses binary method.
+	@param x BIG number, on exit = 1/y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_invmodp(BIG x, BIG y, BIG n);
+/** @brief Calculate x=x mod 2^m (Variable Time)
+ *
+	Truncation
+	@param x BIG number, on reduced mod 2^m
+	@param m new truncated size
+*/
+extern void BIG_mod2m(BIG x, int m);
+
+/**	@brief Calculates a*b+c+*d
+ *
+	Calculate partial product of a.b, add in carry c, and add total to d (Constant Time)
+	@param a multiplier
+	@param b multiplicand
+	@param c carry
+	@param d pointer to accumulated bottom half of result
+	@return top half of result
+ */
+
+
+extern int step1(BIG,BIG,BIG);
+extern void step2(BIG,BIG,BIG);
+
+#ifdef dchunk
+
+/* Method required to calculate x*y+c+r, bottom half in r, top half returned */
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    dchunk prod = (dchunk)x * y + c + *r;
+    *r = (chunk)prod & BMASK_B448_60;
+    return (chunk)(prod >> BASEBITS_B448_60);
+}
+
+#else
+
+/* No integer type available that can store double the wordlength */
+/* accumulate partial products */
+
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    chunk x0, x1, y0, y1;
+    chunk bot, top, mid, carry;
+    x0 = x & HMASK_B448_60;
+    x1 = (x >> HBITS_B448_60);
+    y0 = y & HMASK_B448_60;
+    y1 = (y >> HBITS_B448_60);
+    bot = x0 * y0;
+    top = x1 * y1;
+    mid = x0 * y1 + x1 * y0;
+    x0 = mid & HMASK_B448_60;
+    x1 = (mid >> HBITS_B448_60);
+    bot += x0 << HBITS_B448_60;
+    bot += *r;
+    bot += c;
+
+    top += x1;
+    carry = bot >> BASEBITS_B448_60;
+    bot &= BMASK_B448_60;
+    top += carry;
+
+    *r = bot;
+    return top;
+}
+
+#endif
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/big_B464_60.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/big_B464_60.h
new file mode 100644
index 0000000..cca82be
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/big_B464_60.h
@@ -0,0 +1,697 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file big.h
+ * @author Mike Scott
+ * @date 23rd February 2016
+ * @brief Big number Header File
+ *
+ *
+ */
+
+#ifndef BIG_B464_60_H
+#define BIG_B464_60_H
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <inttypes.h>
+#include "arch.h"
+#include "core.h"
+#include "config_big_B464_60.h"
+
+using namespace core;
+
+/* could comment this out if code size is a major issue */
+#define UNWOUND
+/* Normally recommended, but may not be optimal for some architectures, for example 32-bit ARM M4 */
+#define USE_KARATSUBA
+
+#define BIGBITS_B464_60 (8*MODBYTES_B464_60)
+#define NLEN_B464_60 (1+((8*MODBYTES_B464_60-1)/BASEBITS_B464_60))
+#define DNLEN_B464_60 2*NLEN_B464_60
+#define BMASK_B464_60 (((chunk)1<<BASEBITS_B464_60)-1) /**< Mask = 2^BASEBITS-1 */
+#define NEXCESS_B464_60 (1<<(CHUNK-BASEBITS_B464_60-1))           /**< 2^(CHUNK-BASEBITS-1) - digit cannot be multiplied by more than this before normalisation */
+
+#define HBITS_B464_60 (BASEBITS_B464_60/2)      /**< Number of bits in number base divided by 2 */
+#define HMASK_B464_60 (((chunk)1<<HBITS_B464_60)-1)    /**< Mask = 2^HBITS-1 */
+
+//#define DEBUG_NORM
+
+#ifdef DEBUG_NORM  /* Add an extra location to track chunk extension */
+#define MPV_B464_60 NLEN_B464_60
+#define MNV_B464_60 (NLEN_B464_60+1)
+#define DMPV_B464_60 DNLEN_B464_60
+#define DMNV_B464_60 (DNLEN_B464_60+1)
+
+#endif
+
+namespace B464_60 {
+
+//extern int BIGMULS;
+//extern int BIGSQRS;
+
+#ifdef DEBUG_NORM
+typedef chunk BIG[NLEN_B464_60 + 2]; /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B464_60 + 2]; /**< Define type DBIG as array of chunks */
+#else
+typedef chunk BIG[NLEN_B464_60];     /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B464_60];   /**< Define type DBIG as array of chunks */
+#endif
+
+/* BIG number prototypes */
+
+/**	@brief Tests for BIG equal to zero (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_iszilch(BIG x);
+/**	@brief Tests for BIG equal to one (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if one, else returns 0
+ */
+extern int BIG_isunity(BIG x);
+/**	@brief Tests for DBIG equal to zero (Constant Time)
+ *
+	@param x a DBIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_diszilch(DBIG x);
+/**	@brief Outputs a BIG number to the console (Variable Time)
+ *
+	@param x a BIG number
+ */
+extern void BIG_output(BIG x);
+/**	@brief Outputs a BIG number to the console in raw form (Variable Time for debugging)
+ *
+	@param x a BIG number
+ */
+extern void BIG_rawoutput(BIG x);
+/**	@brief Conditional constant time swap of two BIG numbers
+ *
+	Conditionally swaps parameters in constant time (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s swap takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cswap(BIG x, BIG y, int s);
+/**	@brief Conditional copy of BIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cmove(BIG x, BIG y, int s);
+/**	@brief Conditional copy of DBIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a DBIG number
+	@param y another DBIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_dcmove(BIG x, BIG y, int s);
+/**	@brief Convert from BIG number to byte array (Constant Time)
+ *
+	@param a byte array
+	@param x BIG number
+ */
+extern void BIG_toBytes(char *a, BIG x);
+/**	@brief Convert to BIG number from byte array (Constant Time)
+ *
+	@param x BIG number
+	@param a byte array
+ */
+extern void BIG_fromBytes(BIG x, char *a);
+/**	@brief Convert to BIG number from byte array of given length (Variable Time)
+ *
+	@param x BIG number
+	@param a byte array
+	@param s byte array length
+ */
+extern void BIG_fromBytesLen(BIG x, char *a, int s);
+/**@brief Convert to DBIG number from byte array of given length (Variable Time)
+ *
+   @param x DBIG number
+   @param a byte array
+   @param s byte array length
+ */
+extern void BIG_dfromBytesLen(DBIG x, char *a, int s);
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_doutput(DBIG x); 
+
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_drawoutput(DBIG x);
+
+/**	@brief Copy BIG from Read-Only Memory to a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number in ROM
+ */
+extern void BIG_rcopy(BIG x, const BIG y);
+/**	@brief Copy BIG to another BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_copy(BIG x, BIG y);
+/**	@brief Copy DBIG to another DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_dcopy(DBIG x, DBIG y);
+/**	@brief Copy BIG to upper half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dsucopy(DBIG x, BIG y);
+/**	@brief Copy BIG to lower half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dscopy(DBIG x, BIG y);
+/**	@brief Copy lower half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sdcopy(BIG x, DBIG y);
+/**	@brief Copy upper half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sducopy(BIG x, DBIG y);
+/**	@brief Set BIG to zero (Constant Time)
+ *
+	@param x BIG number to be set to zero  
+ */
+extern void BIG_zero(BIG x);
+/**	@brief Set DBIG to zero (Constant Time)
+ *
+	@param x DBIG number to be set to zero
+ */
+extern void BIG_dzero(DBIG x);
+/**	@brief Set BIG to one (unity) (Constant Time)
+ *
+	@param x BIG number to be set to one.
+ */
+extern void BIG_one(BIG x);
+/**	@brief Set BIG to inverse mod 2^256 (Constant Time)
+ *
+	@param x BIG number to be inverted
+ */
+extern void BIG_invmod2m(BIG x);
+/**	@brief Set BIG to sum of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, sum of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_add(BIG x, BIG y, BIG z);
+
+/**	@brief Set BIG to logical or of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, or of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_or(BIG x, BIG y, BIG z);
+
+/**	@brief Increment BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be incremented
+	@param i integer
+ */
+extern void BIG_inc(BIG x, int i);
+/**	@brief Set BIG to difference of two BIGs (Constant Time)
+ *
+	@param x BIG number, difference of other two - output not normalised
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_sub(BIG x, BIG y, BIG z);
+/**	@brief Decrement BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be decremented
+	@param i integer
+ */
+extern void BIG_dec(BIG x, int i);
+/**	@brief Set DBIG to sum of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, sum of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dadd(DBIG x, DBIG y, DBIG z);
+/**	@brief Set DBIG to difference of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, difference of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dsub(DBIG x, DBIG y, DBIG z);
+/**	@brief Multiply BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_imul(BIG x, BIG y, int i);
+/**	@brief Multiply BIG by not-so-small small integer - output normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+	@return Overflowing bits
+ */
+extern chunk BIG_pmul(BIG x, BIG y, int i);
+/**	@brief Divide BIG by 3 - output normalised (Constant Time)
+ *
+	@param x BIG number
+	@return Remainder
+ */
+extern int BIG_div3(BIG x);
+/**	@brief Multiply BIG by even bigger small integer resulting in a DBIG - output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_pxmul(DBIG x, BIG y, int i);
+/**	@brief Multiply BIG by another BIG resulting in DBIG - inputs normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_mul(DBIG x, BIG y, BIG z);
+/**	@brief Multiply BIG by another BIG resulting in another BIG - inputs normalised and output normalised (Constant Time)
+ *
+	Note that the product must fit into a BIG, and x must be distinct from y and z
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_smul(BIG x, BIG y, BIG z);
+/**	@brief Square BIG resulting in a DBIG - input normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, square of a BIG
+	@param y BIG number to be squared
+ */
+extern void BIG_sqr(DBIG x, BIG y);
+
+/**	@brief Montgomery reduction of a DBIG to a BIG  - input normalised and output normalised (Constant Time)
+ *
+	@param a BIG number, reduction of a BIG
+	@param md BIG number, the modulus
+	@param MC the Montgomery Constant
+	@param d DBIG number to be reduced
+ */
+extern void BIG_monty(BIG a, BIG md, chunk MC, DBIG d);
+
+/**	@brief Shifts a BIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shl(BIG x, int s);
+/**	@brief Fast shifts a BIG left by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Overflow bits
+ */
+extern int BIG_fshl(BIG x, int s);
+/**	@brief Shifts a DBIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshl(DBIG x, int s);
+/**	@brief Shifts a BIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shr(BIG x, int s);
+
+
+/**	@brief Fast time-critical combined shift by 1 bit, subtract and normalise (Constant Time)
+ *
+	@param r BIG number normalised output
+	@param a BIG number to be subtracted from
+	@param m BIG number to be shifted and subtracted
+	@return sign of r
+ */
+extern int BIG_ssn(BIG r, BIG a, BIG m);
+
+/**	@brief Fast shifts a BIG right by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Shifted out bits
+ */
+extern int BIG_fshr(BIG x, int s);
+/**	@brief Shifts a DBIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshr(DBIG x, int s);
+/**	@brief Splits a DBIG into two BIGs - input must be normalised, outputs normalised (Constant Time as used)
+ *
+	Internal function. The value of s must be approximately in the middle of the DBIG.
+	Typically used to extract z mod 2^MODBITS and z/2^MODBITS
+	@param x BIG number, top half of z
+	@param y BIG number, bottom half of z
+	@param z DBIG number to be split in two.
+	@param s Bit position at which to split
+	@return carry-out from top half
+ */
+extern chunk BIG_split(BIG x, BIG y, DBIG z, int s);
+/**	@brief Normalizes a BIG number - output normalised (Constant Time)
+ *
+	All digits of the input BIG are reduced mod 2^BASEBITS
+	@param x BIG number to be normalised
+ */
+extern chunk BIG_norm(BIG x);
+/**	@brief Normalizes a DBIG number - output normalised (Constant Time)
+ *
+	All digits of the input DBIG are reduced mod 2^BASEBITS
+	@param x DBIG number to be normalised
+ */
+extern void BIG_dnorm(DBIG x);
+/**	@brief Compares two BIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first BIG number to be compared
+	@param y second BIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_comp(BIG x, BIG y);
+/**	@brief Compares two DBIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first DBIG number to be compared
+	@param y second DBIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_dcomp(DBIG x, DBIG y);
+/**	@brief Calculate number of bits in a BIG - output normalised (Variable Time)
+ *
+	@param x BIG number
+	@return Number of bits in x
+ */
+extern int BIG_nbits(BIG x);
+/**	@brief Calculate number of bits in a DBIG - output normalised (Variable Time)
+ *
+	@param x DBIG number
+	@return Number of bits in x
+ */
+extern int BIG_dnbits(DBIG x);
+
+/**	@brief Reduce x mod n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctmod(BIG x, BIG n, int bd);
+
+/**	@brief  x=y mod n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctdmod(BIG x, DBIG y, BIG n, int bd);
+
+/**	@brief Divide x by n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctsdiv(BIG x,BIG n,int bd);
+
+/**	@brief  x=y/n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctddiv(BIG x, DBIG y, BIG n,int bd);
+
+
+/**	@brief Reduce x mod n - input and output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+ */
+extern void BIG_mod(BIG x, BIG n);
+/**	@brief Divide x by n - output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+ */
+extern void BIG_sdiv(BIG x, BIG n);
+/**	@brief  x=y mod n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_dmod(BIG x, DBIG y, BIG n);
+/**	@brief  x=y/n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_ddiv(BIG x, DBIG y, BIG n);
+/**	@brief  return parity of BIG, that is the least significant bit (Constant Time)
+ *
+	@param x BIG number
+	@return 0 or 1
+ */
+extern int BIG_parity(BIG x);
+/**	@brief  return i-th of BIG (Constant Time)
+ *
+	@param x BIG number
+	@param i the bit of x to be returned
+	@return 0 or 1
+ */
+extern int BIG_bit(BIG x, int i);
+/**	@brief  return least significant bits of a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param n number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int BIG_lastbits(BIG x, int n);
+/**	@brief  Create a random BIG from a random number generator (Constant Time)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_random(BIG x, csprng *r);
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randomnum(BIG x, BIG n, csprng *r);
+
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus and truncated to max bit length (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param t Maximum bit length
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randtrunc(BIG x, BIG n, int t, csprng *r);
+
+/**	brief  return NAF (Non-Adjacent-Form) value as +/- 1, 3 or 5, inputs must be normalised
+ *
+	Given x and 3*x extracts NAF value from given bit position, and returns number of bits processed, and number of trailing zeros detected if any
+	param x BIG number
+	param x3 BIG number, three times x
+	param i bit position
+	param nbs pointer to integer returning number of bits processed
+	param nzs pointer to integer returning number of trailing 0s
+	return + or - 1, 3 or 5
+*/
+
+/**	@brief  Calculate x=y*z mod n (Variable Time)
+ *
+	Slow method for modular multiplication
+	@param x BIG number, on exit = y*z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modmul(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y/z mod n (Variable Time)
+ *
+	Slow method for modular division
+	@param x BIG number, on exit = y/z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_moddiv(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y^2 mod n (Variable Time)
+ *
+	Slow method for modular squaring
+	@param x BIG number, on exit = y^2 mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modsqr(BIG x, BIG y, BIG n);
+/**	@brief  Calculate x=-y mod n (Variable Time)
+ *
+	Modular negation
+	@param x BIG number, on exit = -y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modneg(BIG x, BIG y, BIG n);
+
+/**	@brief  Calculate x=y+z mod n (Variable Time)
+ *
+	Slow method for modular addition
+	@param x BIG number, on exit = y+z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modadd(BIG x, BIG y, BIG z, BIG n);
+
+/**	@brief  Calculate jacobi Symbol (x/y) (Variable Time)
+ *
+	@param x BIG number
+	@param y BIG number
+	@return Jacobi symbol, -1,0 or 1
+ */
+extern int BIG_jacobi(BIG x, BIG y);
+/**	@brief  Calculate x=1/y mod n (Variable Time)
+ *
+	Modular Inversion - This is slow. Uses binary method.
+	@param x BIG number, on exit = 1/y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_invmodp(BIG x, BIG y, BIG n);
+/** @brief Calculate x=x mod 2^m (Variable Time)
+ *
+	Truncation
+	@param x BIG number, on reduced mod 2^m
+	@param m new truncated size
+*/
+extern void BIG_mod2m(BIG x, int m);
+
+/**	@brief Calculates a*b+c+*d
+ *
+	Calculate partial product of a.b, add in carry c, and add total to d (Constant Time)
+	@param a multiplier
+	@param b multiplicand
+	@param c carry
+	@param d pointer to accumulated bottom half of result
+	@return top half of result
+ */
+
+
+extern int step1(BIG,BIG,BIG);
+extern void step2(BIG,BIG,BIG);
+
+#ifdef dchunk
+
+/* Method required to calculate x*y+c+r, bottom half in r, top half returned */
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    dchunk prod = (dchunk)x * y + c + *r;
+    *r = (chunk)prod & BMASK_B464_60;
+    return (chunk)(prod >> BASEBITS_B464_60);
+}
+
+#else
+
+/* No integer type available that can store double the wordlength */
+/* accumulate partial products */
+
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    chunk x0, x1, y0, y1;
+    chunk bot, top, mid, carry;
+    x0 = x & HMASK_B464_60;
+    x1 = (x >> HBITS_B464_60);
+    y0 = y & HMASK_B464_60;
+    y1 = (y >> HBITS_B464_60);
+    bot = x0 * y0;
+    top = x1 * y1;
+    mid = x0 * y1 + x1 * y0;
+    x0 = mid & HMASK_B464_60;
+    x1 = (mid >> HBITS_B464_60);
+    bot += x0 << HBITS_B464_60;
+    bot += *r;
+    bot += c;
+
+    top += x1;
+    carry = bot >> BASEBITS_B464_60;
+    bot &= BMASK_B464_60;
+    top += carry;
+
+    *r = bot;
+    return top;
+}
+
+#endif
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/big_B480_56.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/big_B480_56.h
new file mode 100644
index 0000000..10bb1b3
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/big_B480_56.h
@@ -0,0 +1,697 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file big.h
+ * @author Mike Scott
+ * @date 23rd February 2016
+ * @brief Big number Header File
+ *
+ *
+ */
+
+#ifndef BIG_B480_56_H
+#define BIG_B480_56_H
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <inttypes.h>
+#include "arch.h"
+#include "core.h"
+#include "config_big_B480_56.h"
+
+using namespace core;
+
+/* could comment this out if code size is a major issue */
+#define UNWOUND
+/* Normally recommended, but may not be optimal for some architectures, for example 32-bit ARM M4 */
+#define USE_KARATSUBA
+
+#define BIGBITS_B480_56 (8*MODBYTES_B480_56)
+#define NLEN_B480_56 (1+((8*MODBYTES_B480_56-1)/BASEBITS_B480_56))
+#define DNLEN_B480_56 2*NLEN_B480_56
+#define BMASK_B480_56 (((chunk)1<<BASEBITS_B480_56)-1) /**< Mask = 2^BASEBITS-1 */
+#define NEXCESS_B480_56 (1<<(CHUNK-BASEBITS_B480_56-1))           /**< 2^(CHUNK-BASEBITS-1) - digit cannot be multiplied by more than this before normalisation */
+
+#define HBITS_B480_56 (BASEBITS_B480_56/2)      /**< Number of bits in number base divided by 2 */
+#define HMASK_B480_56 (((chunk)1<<HBITS_B480_56)-1)    /**< Mask = 2^HBITS-1 */
+
+//#define DEBUG_NORM
+
+#ifdef DEBUG_NORM  /* Add an extra location to track chunk extension */
+#define MPV_B480_56 NLEN_B480_56
+#define MNV_B480_56 (NLEN_B480_56+1)
+#define DMPV_B480_56 DNLEN_B480_56
+#define DMNV_B480_56 (DNLEN_B480_56+1)
+
+#endif
+
+namespace B480_56 {
+
+//extern int BIGMULS;
+//extern int BIGSQRS;
+
+#ifdef DEBUG_NORM
+typedef chunk BIG[NLEN_B480_56 + 2]; /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B480_56 + 2]; /**< Define type DBIG as array of chunks */
+#else
+typedef chunk BIG[NLEN_B480_56];     /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B480_56];   /**< Define type DBIG as array of chunks */
+#endif
+
+/* BIG number prototypes */
+
+/**	@brief Tests for BIG equal to zero (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_iszilch(BIG x);
+/**	@brief Tests for BIG equal to one (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if one, else returns 0
+ */
+extern int BIG_isunity(BIG x);
+/**	@brief Tests for DBIG equal to zero (Constant Time)
+ *
+	@param x a DBIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_diszilch(DBIG x);
+/**	@brief Outputs a BIG number to the console (Variable Time)
+ *
+	@param x a BIG number
+ */
+extern void BIG_output(BIG x);
+/**	@brief Outputs a BIG number to the console in raw form (Variable Time for debugging)
+ *
+	@param x a BIG number
+ */
+extern void BIG_rawoutput(BIG x);
+/**	@brief Conditional constant time swap of two BIG numbers
+ *
+	Conditionally swaps parameters in constant time (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s swap takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cswap(BIG x, BIG y, int s);
+/**	@brief Conditional copy of BIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cmove(BIG x, BIG y, int s);
+/**	@brief Conditional copy of DBIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a DBIG number
+	@param y another DBIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_dcmove(BIG x, BIG y, int s);
+/**	@brief Convert from BIG number to byte array (Constant Time)
+ *
+	@param a byte array
+	@param x BIG number
+ */
+extern void BIG_toBytes(char *a, BIG x);
+/**	@brief Convert to BIG number from byte array (Constant Time)
+ *
+	@param x BIG number
+	@param a byte array
+ */
+extern void BIG_fromBytes(BIG x, char *a);
+/**	@brief Convert to BIG number from byte array of given length (Variable Time)
+ *
+	@param x BIG number
+	@param a byte array
+	@param s byte array length
+ */
+extern void BIG_fromBytesLen(BIG x, char *a, int s);
+/**@brief Convert to DBIG number from byte array of given length (Variable Time)
+ *
+   @param x DBIG number
+   @param a byte array
+   @param s byte array length
+ */
+extern void BIG_dfromBytesLen(DBIG x, char *a, int s);
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_doutput(DBIG x); 
+
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_drawoutput(DBIG x);
+
+/**	@brief Copy BIG from Read-Only Memory to a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number in ROM
+ */
+extern void BIG_rcopy(BIG x, const BIG y);
+/**	@brief Copy BIG to another BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_copy(BIG x, BIG y);
+/**	@brief Copy DBIG to another DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_dcopy(DBIG x, DBIG y);
+/**	@brief Copy BIG to upper half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dsucopy(DBIG x, BIG y);
+/**	@brief Copy BIG to lower half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dscopy(DBIG x, BIG y);
+/**	@brief Copy lower half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sdcopy(BIG x, DBIG y);
+/**	@brief Copy upper half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sducopy(BIG x, DBIG y);
+/**	@brief Set BIG to zero (Constant Time)
+ *
+	@param x BIG number to be set to zero  
+ */
+extern void BIG_zero(BIG x);
+/**	@brief Set DBIG to zero (Constant Time)
+ *
+	@param x DBIG number to be set to zero
+ */
+extern void BIG_dzero(DBIG x);
+/**	@brief Set BIG to one (unity) (Constant Time)
+ *
+	@param x BIG number to be set to one.
+ */
+extern void BIG_one(BIG x);
+/**	@brief Set BIG to inverse mod 2^256 (Constant Time)
+ *
+	@param x BIG number to be inverted
+ */
+extern void BIG_invmod2m(BIG x);
+/**	@brief Set BIG to sum of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, sum of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_add(BIG x, BIG y, BIG z);
+
+/**	@brief Set BIG to logical or of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, or of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_or(BIG x, BIG y, BIG z);
+
+/**	@brief Increment BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be incremented
+	@param i integer
+ */
+extern void BIG_inc(BIG x, int i);
+/**	@brief Set BIG to difference of two BIGs (Constant Time)
+ *
+	@param x BIG number, difference of other two - output not normalised
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_sub(BIG x, BIG y, BIG z);
+/**	@brief Decrement BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be decremented
+	@param i integer
+ */
+extern void BIG_dec(BIG x, int i);
+/**	@brief Set DBIG to sum of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, sum of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dadd(DBIG x, DBIG y, DBIG z);
+/**	@brief Set DBIG to difference of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, difference of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dsub(DBIG x, DBIG y, DBIG z);
+/**	@brief Multiply BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_imul(BIG x, BIG y, int i);
+/**	@brief Multiply BIG by not-so-small small integer - output normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+	@return Overflowing bits
+ */
+extern chunk BIG_pmul(BIG x, BIG y, int i);
+/**	@brief Divide BIG by 3 - output normalised (Constant Time)
+ *
+	@param x BIG number
+	@return Remainder
+ */
+extern int BIG_div3(BIG x);
+/**	@brief Multiply BIG by even bigger small integer resulting in a DBIG - output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_pxmul(DBIG x, BIG y, int i);
+/**	@brief Multiply BIG by another BIG resulting in DBIG - inputs normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_mul(DBIG x, BIG y, BIG z);
+/**	@brief Multiply BIG by another BIG resulting in another BIG - inputs normalised and output normalised (Constant Time)
+ *
+	Note that the product must fit into a BIG, and x must be distinct from y and z
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_smul(BIG x, BIG y, BIG z);
+/**	@brief Square BIG resulting in a DBIG - input normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, square of a BIG
+	@param y BIG number to be squared
+ */
+extern void BIG_sqr(DBIG x, BIG y);
+
+/**	@brief Montgomery reduction of a DBIG to a BIG  - input normalised and output normalised (Constant Time)
+ *
+	@param a BIG number, reduction of a BIG
+	@param md BIG number, the modulus
+	@param MC the Montgomery Constant
+	@param d DBIG number to be reduced
+ */
+extern void BIG_monty(BIG a, BIG md, chunk MC, DBIG d);
+
+/**	@brief Shifts a BIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shl(BIG x, int s);
+/**	@brief Fast shifts a BIG left by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Overflow bits
+ */
+extern int BIG_fshl(BIG x, int s);
+/**	@brief Shifts a DBIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshl(DBIG x, int s);
+/**	@brief Shifts a BIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shr(BIG x, int s);
+
+
+/**	@brief Fast time-critical combined shift by 1 bit, subtract and normalise (Constant Time)
+ *
+	@param r BIG number normalised output
+	@param a BIG number to be subtracted from
+	@param m BIG number to be shifted and subtracted
+	@return sign of r
+ */
+extern int BIG_ssn(BIG r, BIG a, BIG m);
+
+/**	@brief Fast shifts a BIG right by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Shifted out bits
+ */
+extern int BIG_fshr(BIG x, int s);
+/**	@brief Shifts a DBIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshr(DBIG x, int s);
+/**	@brief Splits a DBIG into two BIGs - input must be normalised, outputs normalised (Constant Time as used)
+ *
+	Internal function. The value of s must be approximately in the middle of the DBIG.
+	Typically used to extract z mod 2^MODBITS and z/2^MODBITS
+	@param x BIG number, top half of z
+	@param y BIG number, bottom half of z
+	@param z DBIG number to be split in two.
+	@param s Bit position at which to split
+	@return carry-out from top half
+ */
+extern chunk BIG_split(BIG x, BIG y, DBIG z, int s);
+/**	@brief Normalizes a BIG number - output normalised (Constant Time)
+ *
+	All digits of the input BIG are reduced mod 2^BASEBITS
+	@param x BIG number to be normalised
+ */
+extern chunk BIG_norm(BIG x);
+/**	@brief Normalizes a DBIG number - output normalised (Constant Time)
+ *
+	All digits of the input DBIG are reduced mod 2^BASEBITS
+	@param x DBIG number to be normalised
+ */
+extern void BIG_dnorm(DBIG x);
+/**	@brief Compares two BIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first BIG number to be compared
+	@param y second BIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_comp(BIG x, BIG y);
+/**	@brief Compares two DBIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first DBIG number to be compared
+	@param y second DBIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_dcomp(DBIG x, DBIG y);
+/**	@brief Calculate number of bits in a BIG - output normalised (Variable Time)
+ *
+	@param x BIG number
+	@return Number of bits in x
+ */
+extern int BIG_nbits(BIG x);
+/**	@brief Calculate number of bits in a DBIG - output normalised (Variable Time)
+ *
+	@param x DBIG number
+	@return Number of bits in x
+ */
+extern int BIG_dnbits(DBIG x);
+
+/**	@brief Reduce x mod n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctmod(BIG x, BIG n, int bd);
+
+/**	@brief  x=y mod n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctdmod(BIG x, DBIG y, BIG n, int bd);
+
+/**	@brief Divide x by n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctsdiv(BIG x,BIG n,int bd);
+
+/**	@brief  x=y/n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctddiv(BIG x, DBIG y, BIG n,int bd);
+
+
+/**	@brief Reduce x mod n - input and output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+ */
+extern void BIG_mod(BIG x, BIG n);
+/**	@brief Divide x by n - output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+ */
+extern void BIG_sdiv(BIG x, BIG n);
+/**	@brief  x=y mod n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_dmod(BIG x, DBIG y, BIG n);
+/**	@brief  x=y/n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_ddiv(BIG x, DBIG y, BIG n);
+/**	@brief  return parity of BIG, that is the least significant bit (Constant Time)
+ *
+	@param x BIG number
+	@return 0 or 1
+ */
+extern int BIG_parity(BIG x);
+/**	@brief  return i-th of BIG (Constant Time)
+ *
+	@param x BIG number
+	@param i the bit of x to be returned
+	@return 0 or 1
+ */
+extern int BIG_bit(BIG x, int i);
+/**	@brief  return least significant bits of a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param n number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int BIG_lastbits(BIG x, int n);
+/**	@brief  Create a random BIG from a random number generator (Constant Time)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_random(BIG x, csprng *r);
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randomnum(BIG x, BIG n, csprng *r);
+
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus and truncated to max bit length (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param t Maximum bit length
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randtrunc(BIG x, BIG n, int t, csprng *r);
+
+/**	brief  return NAF (Non-Adjacent-Form) value as +/- 1, 3 or 5, inputs must be normalised
+ *
+	Given x and 3*x extracts NAF value from given bit position, and returns number of bits processed, and number of trailing zeros detected if any
+	param x BIG number
+	param x3 BIG number, three times x
+	param i bit position
+	param nbs pointer to integer returning number of bits processed
+	param nzs pointer to integer returning number of trailing 0s
+	return + or - 1, 3 or 5
+*/
+
+/**	@brief  Calculate x=y*z mod n (Variable Time)
+ *
+	Slow method for modular multiplication
+	@param x BIG number, on exit = y*z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modmul(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y/z mod n (Variable Time)
+ *
+	Slow method for modular division
+	@param x BIG number, on exit = y/z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_moddiv(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y^2 mod n (Variable Time)
+ *
+	Slow method for modular squaring
+	@param x BIG number, on exit = y^2 mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modsqr(BIG x, BIG y, BIG n);
+/**	@brief  Calculate x=-y mod n (Variable Time)
+ *
+	Modular negation
+	@param x BIG number, on exit = -y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modneg(BIG x, BIG y, BIG n);
+
+/**	@brief  Calculate x=y+z mod n (Variable Time)
+ *
+	Slow method for modular addition
+	@param x BIG number, on exit = y+z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modadd(BIG x, BIG y, BIG z, BIG n);
+
+/**	@brief  Calculate jacobi Symbol (x/y) (Variable Time)
+ *
+	@param x BIG number
+	@param y BIG number
+	@return Jacobi symbol, -1,0 or 1
+ */
+extern int BIG_jacobi(BIG x, BIG y);
+/**	@brief  Calculate x=1/y mod n (Variable Time)
+ *
+	Modular Inversion - This is slow. Uses binary method.
+	@param x BIG number, on exit = 1/y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_invmodp(BIG x, BIG y, BIG n);
+/** @brief Calculate x=x mod 2^m (Variable Time)
+ *
+	Truncation
+	@param x BIG number, on reduced mod 2^m
+	@param m new truncated size
+*/
+extern void BIG_mod2m(BIG x, int m);
+
+/**	@brief Calculates a*b+c+*d
+ *
+	Calculate partial product of a.b, add in carry c, and add total to d (Constant Time)
+	@param a multiplier
+	@param b multiplicand
+	@param c carry
+	@param d pointer to accumulated bottom half of result
+	@return top half of result
+ */
+
+
+extern int step1(BIG,BIG,BIG);
+extern void step2(BIG,BIG,BIG);
+
+#ifdef dchunk
+
+/* Method required to calculate x*y+c+r, bottom half in r, top half returned */
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    dchunk prod = (dchunk)x * y + c + *r;
+    *r = (chunk)prod & BMASK_B480_56;
+    return (chunk)(prod >> BASEBITS_B480_56);
+}
+
+#else
+
+/* No integer type available that can store double the wordlength */
+/* accumulate partial products */
+
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    chunk x0, x1, y0, y1;
+    chunk bot, top, mid, carry;
+    x0 = x & HMASK_B480_56;
+    x1 = (x >> HBITS_B480_56);
+    y0 = y & HMASK_B480_56;
+    y1 = (y >> HBITS_B480_56);
+    bot = x0 * y0;
+    top = x1 * y1;
+    mid = x0 * y1 + x1 * y0;
+    x0 = mid & HMASK_B480_56;
+    x1 = (mid >> HBITS_B480_56);
+    bot += x0 << HBITS_B480_56;
+    bot += *r;
+    bot += c;
+
+    top += x1;
+    carry = bot >> BASEBITS_B480_56;
+    bot &= BMASK_B480_56;
+    top += carry;
+
+    *r = bot;
+    return top;
+}
+
+#endif
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/big_B512_60.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/big_B512_60.h
new file mode 100644
index 0000000..8cbbac2
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/big_B512_60.h
@@ -0,0 +1,697 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file big.h
+ * @author Mike Scott
+ * @date 23rd February 2016
+ * @brief Big number Header File
+ *
+ *
+ */
+
+#ifndef BIG_B512_60_H
+#define BIG_B512_60_H
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <inttypes.h>
+#include "arch.h"
+#include "core.h"
+#include "config_big_B512_60.h"
+
+using namespace core;
+
+/* could comment this out if code size is a major issue */
+#define UNWOUND
+/* Normally recommended, but may not be optimal for some architectures, for example 32-bit ARM M4 */
+#define USE_KARATSUBA
+
+#define BIGBITS_B512_60 (8*MODBYTES_B512_60)
+#define NLEN_B512_60 (1+((8*MODBYTES_B512_60-1)/BASEBITS_B512_60))
+#define DNLEN_B512_60 2*NLEN_B512_60
+#define BMASK_B512_60 (((chunk)1<<BASEBITS_B512_60)-1) /**< Mask = 2^BASEBITS-1 */
+#define NEXCESS_B512_60 (1<<(CHUNK-BASEBITS_B512_60-1))           /**< 2^(CHUNK-BASEBITS-1) - digit cannot be multiplied by more than this before normalisation */
+
+#define HBITS_B512_60 (BASEBITS_B512_60/2)      /**< Number of bits in number base divided by 2 */
+#define HMASK_B512_60 (((chunk)1<<HBITS_B512_60)-1)    /**< Mask = 2^HBITS-1 */
+
+//#define DEBUG_NORM
+
+#ifdef DEBUG_NORM  /* Add an extra location to track chunk extension */
+#define MPV_B512_60 NLEN_B512_60
+#define MNV_B512_60 (NLEN_B512_60+1)
+#define DMPV_B512_60 DNLEN_B512_60
+#define DMNV_B512_60 (DNLEN_B512_60+1)
+
+#endif
+
+namespace B512_60 {
+
+//extern int BIGMULS;
+//extern int BIGSQRS;
+
+#ifdef DEBUG_NORM
+typedef chunk BIG[NLEN_B512_60 + 2]; /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B512_60 + 2]; /**< Define type DBIG as array of chunks */
+#else
+typedef chunk BIG[NLEN_B512_60];     /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B512_60];   /**< Define type DBIG as array of chunks */
+#endif
+
+/* BIG number prototypes */
+
+/**	@brief Tests for BIG equal to zero (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_iszilch(BIG x);
+/**	@brief Tests for BIG equal to one (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if one, else returns 0
+ */
+extern int BIG_isunity(BIG x);
+/**	@brief Tests for DBIG equal to zero (Constant Time)
+ *
+	@param x a DBIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_diszilch(DBIG x);
+/**	@brief Outputs a BIG number to the console (Variable Time)
+ *
+	@param x a BIG number
+ */
+extern void BIG_output(BIG x);
+/**	@brief Outputs a BIG number to the console in raw form (Variable Time for debugging)
+ *
+	@param x a BIG number
+ */
+extern void BIG_rawoutput(BIG x);
+/**	@brief Conditional constant time swap of two BIG numbers
+ *
+	Conditionally swaps parameters in constant time (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s swap takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cswap(BIG x, BIG y, int s);
+/**	@brief Conditional copy of BIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cmove(BIG x, BIG y, int s);
+/**	@brief Conditional copy of DBIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a DBIG number
+	@param y another DBIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_dcmove(BIG x, BIG y, int s);
+/**	@brief Convert from BIG number to byte array (Constant Time)
+ *
+	@param a byte array
+	@param x BIG number
+ */
+extern void BIG_toBytes(char *a, BIG x);
+/**	@brief Convert to BIG number from byte array (Constant Time)
+ *
+	@param x BIG number
+	@param a byte array
+ */
+extern void BIG_fromBytes(BIG x, char *a);
+/**	@brief Convert to BIG number from byte array of given length (Variable Time)
+ *
+	@param x BIG number
+	@param a byte array
+	@param s byte array length
+ */
+extern void BIG_fromBytesLen(BIG x, char *a, int s);
+/**@brief Convert to DBIG number from byte array of given length (Variable Time)
+ *
+   @param x DBIG number
+   @param a byte array
+   @param s byte array length
+ */
+extern void BIG_dfromBytesLen(DBIG x, char *a, int s);
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_doutput(DBIG x); 
+
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_drawoutput(DBIG x);
+
+/**	@brief Copy BIG from Read-Only Memory to a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number in ROM
+ */
+extern void BIG_rcopy(BIG x, const BIG y);
+/**	@brief Copy BIG to another BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_copy(BIG x, BIG y);
+/**	@brief Copy DBIG to another DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_dcopy(DBIG x, DBIG y);
+/**	@brief Copy BIG to upper half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dsucopy(DBIG x, BIG y);
+/**	@brief Copy BIG to lower half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dscopy(DBIG x, BIG y);
+/**	@brief Copy lower half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sdcopy(BIG x, DBIG y);
+/**	@brief Copy upper half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sducopy(BIG x, DBIG y);
+/**	@brief Set BIG to zero (Constant Time)
+ *
+	@param x BIG number to be set to zero  
+ */
+extern void BIG_zero(BIG x);
+/**	@brief Set DBIG to zero (Constant Time)
+ *
+	@param x DBIG number to be set to zero
+ */
+extern void BIG_dzero(DBIG x);
+/**	@brief Set BIG to one (unity) (Constant Time)
+ *
+	@param x BIG number to be set to one.
+ */
+extern void BIG_one(BIG x);
+/**	@brief Set BIG to inverse mod 2^256 (Constant Time)
+ *
+	@param x BIG number to be inverted
+ */
+extern void BIG_invmod2m(BIG x);
+/**	@brief Set BIG to sum of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, sum of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_add(BIG x, BIG y, BIG z);
+
+/**	@brief Set BIG to logical or of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, or of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_or(BIG x, BIG y, BIG z);
+
+/**	@brief Increment BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be incremented
+	@param i integer
+ */
+extern void BIG_inc(BIG x, int i);
+/**	@brief Set BIG to difference of two BIGs (Constant Time)
+ *
+	@param x BIG number, difference of other two - output not normalised
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_sub(BIG x, BIG y, BIG z);
+/**	@brief Decrement BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be decremented
+	@param i integer
+ */
+extern void BIG_dec(BIG x, int i);
+/**	@brief Set DBIG to sum of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, sum of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dadd(DBIG x, DBIG y, DBIG z);
+/**	@brief Set DBIG to difference of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, difference of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dsub(DBIG x, DBIG y, DBIG z);
+/**	@brief Multiply BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_imul(BIG x, BIG y, int i);
+/**	@brief Multiply BIG by not-so-small small integer - output normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+	@return Overflowing bits
+ */
+extern chunk BIG_pmul(BIG x, BIG y, int i);
+/**	@brief Divide BIG by 3 - output normalised (Constant Time)
+ *
+	@param x BIG number
+	@return Remainder
+ */
+extern int BIG_div3(BIG x);
+/**	@brief Multiply BIG by even bigger small integer resulting in a DBIG - output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_pxmul(DBIG x, BIG y, int i);
+/**	@brief Multiply BIG by another BIG resulting in DBIG - inputs normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_mul(DBIG x, BIG y, BIG z);
+/**	@brief Multiply BIG by another BIG resulting in another BIG - inputs normalised and output normalised (Constant Time)
+ *
+	Note that the product must fit into a BIG, and x must be distinct from y and z
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_smul(BIG x, BIG y, BIG z);
+/**	@brief Square BIG resulting in a DBIG - input normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, square of a BIG
+	@param y BIG number to be squared
+ */
+extern void BIG_sqr(DBIG x, BIG y);
+
+/**	@brief Montgomery reduction of a DBIG to a BIG  - input normalised and output normalised (Constant Time)
+ *
+	@param a BIG number, reduction of a BIG
+	@param md BIG number, the modulus
+	@param MC the Montgomery Constant
+	@param d DBIG number to be reduced
+ */
+extern void BIG_monty(BIG a, BIG md, chunk MC, DBIG d);
+
+/**	@brief Shifts a BIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shl(BIG x, int s);
+/**	@brief Fast shifts a BIG left by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Overflow bits
+ */
+extern int BIG_fshl(BIG x, int s);
+/**	@brief Shifts a DBIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshl(DBIG x, int s);
+/**	@brief Shifts a BIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shr(BIG x, int s);
+
+
+/**	@brief Fast time-critical combined shift by 1 bit, subtract and normalise (Constant Time)
+ *
+	@param r BIG number normalised output
+	@param a BIG number to be subtracted from
+	@param m BIG number to be shifted and subtracted
+	@return sign of r
+ */
+extern int BIG_ssn(BIG r, BIG a, BIG m);
+
+/**	@brief Fast shifts a BIG right by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Shifted out bits
+ */
+extern int BIG_fshr(BIG x, int s);
+/**	@brief Shifts a DBIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshr(DBIG x, int s);
+/**	@brief Splits a DBIG into two BIGs - input must be normalised, outputs normalised (Constant Time as used)
+ *
+	Internal function. The value of s must be approximately in the middle of the DBIG.
+	Typically used to extract z mod 2^MODBITS and z/2^MODBITS
+	@param x BIG number, top half of z
+	@param y BIG number, bottom half of z
+	@param z DBIG number to be split in two.
+	@param s Bit position at which to split
+	@return carry-out from top half
+ */
+extern chunk BIG_split(BIG x, BIG y, DBIG z, int s);
+/**	@brief Normalizes a BIG number - output normalised (Constant Time)
+ *
+	All digits of the input BIG are reduced mod 2^BASEBITS
+	@param x BIG number to be normalised
+ */
+extern chunk BIG_norm(BIG x);
+/**	@brief Normalizes a DBIG number - output normalised (Constant Time)
+ *
+	All digits of the input DBIG are reduced mod 2^BASEBITS
+	@param x DBIG number to be normalised
+ */
+extern void BIG_dnorm(DBIG x);
+/**	@brief Compares two BIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first BIG number to be compared
+	@param y second BIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_comp(BIG x, BIG y);
+/**	@brief Compares two DBIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first DBIG number to be compared
+	@param y second DBIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_dcomp(DBIG x, DBIG y);
+/**	@brief Calculate number of bits in a BIG - output normalised (Variable Time)
+ *
+	@param x BIG number
+	@return Number of bits in x
+ */
+extern int BIG_nbits(BIG x);
+/**	@brief Calculate number of bits in a DBIG - output normalised (Variable Time)
+ *
+	@param x DBIG number
+	@return Number of bits in x
+ */
+extern int BIG_dnbits(DBIG x);
+
+/**	@brief Reduce x mod n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctmod(BIG x, BIG n, int bd);
+
+/**	@brief  x=y mod n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctdmod(BIG x, DBIG y, BIG n, int bd);
+
+/**	@brief Divide x by n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctsdiv(BIG x,BIG n,int bd);
+
+/**	@brief  x=y/n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctddiv(BIG x, DBIG y, BIG n,int bd);
+
+
+/**	@brief Reduce x mod n - input and output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+ */
+extern void BIG_mod(BIG x, BIG n);
+/**	@brief Divide x by n - output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+ */
+extern void BIG_sdiv(BIG x, BIG n);
+/**	@brief  x=y mod n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_dmod(BIG x, DBIG y, BIG n);
+/**	@brief  x=y/n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_ddiv(BIG x, DBIG y, BIG n);
+/**	@brief  return parity of BIG, that is the least significant bit (Constant Time)
+ *
+	@param x BIG number
+	@return 0 or 1
+ */
+extern int BIG_parity(BIG x);
+/**	@brief  return i-th of BIG (Constant Time)
+ *
+	@param x BIG number
+	@param i the bit of x to be returned
+	@return 0 or 1
+ */
+extern int BIG_bit(BIG x, int i);
+/**	@brief  return least significant bits of a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param n number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int BIG_lastbits(BIG x, int n);
+/**	@brief  Create a random BIG from a random number generator (Constant Time)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_random(BIG x, csprng *r);
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randomnum(BIG x, BIG n, csprng *r);
+
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus and truncated to max bit length (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param t Maximum bit length
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randtrunc(BIG x, BIG n, int t, csprng *r);
+
+/**	brief  return NAF (Non-Adjacent-Form) value as +/- 1, 3 or 5, inputs must be normalised
+ *
+	Given x and 3*x extracts NAF value from given bit position, and returns number of bits processed, and number of trailing zeros detected if any
+	param x BIG number
+	param x3 BIG number, three times x
+	param i bit position
+	param nbs pointer to integer returning number of bits processed
+	param nzs pointer to integer returning number of trailing 0s
+	return + or - 1, 3 or 5
+*/
+
+/**	@brief  Calculate x=y*z mod n (Variable Time)
+ *
+	Slow method for modular multiplication
+	@param x BIG number, on exit = y*z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modmul(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y/z mod n (Variable Time)
+ *
+	Slow method for modular division
+	@param x BIG number, on exit = y/z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_moddiv(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y^2 mod n (Variable Time)
+ *
+	Slow method for modular squaring
+	@param x BIG number, on exit = y^2 mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modsqr(BIG x, BIG y, BIG n);
+/**	@brief  Calculate x=-y mod n (Variable Time)
+ *
+	Modular negation
+	@param x BIG number, on exit = -y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modneg(BIG x, BIG y, BIG n);
+
+/**	@brief  Calculate x=y+z mod n (Variable Time)
+ *
+	Slow method for modular addition
+	@param x BIG number, on exit = y+z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modadd(BIG x, BIG y, BIG z, BIG n);
+
+/**	@brief  Calculate jacobi Symbol (x/y) (Variable Time)
+ *
+	@param x BIG number
+	@param y BIG number
+	@return Jacobi symbol, -1,0 or 1
+ */
+extern int BIG_jacobi(BIG x, BIG y);
+/**	@brief  Calculate x=1/y mod n (Variable Time)
+ *
+	Modular Inversion - This is slow. Uses binary method.
+	@param x BIG number, on exit = 1/y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_invmodp(BIG x, BIG y, BIG n);
+/** @brief Calculate x=x mod 2^m (Variable Time)
+ *
+	Truncation
+	@param x BIG number, on reduced mod 2^m
+	@param m new truncated size
+*/
+extern void BIG_mod2m(BIG x, int m);
+
+/**	@brief Calculates a*b+c+*d
+ *
+	Calculate partial product of a.b, add in carry c, and add total to d (Constant Time)
+	@param a multiplier
+	@param b multiplicand
+	@param c carry
+	@param d pointer to accumulated bottom half of result
+	@return top half of result
+ */
+
+
+extern int step1(BIG,BIG,BIG);
+extern void step2(BIG,BIG,BIG);
+
+#ifdef dchunk
+
+/* Method required to calculate x*y+c+r, bottom half in r, top half returned */
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    dchunk prod = (dchunk)x * y + c + *r;
+    *r = (chunk)prod & BMASK_B512_60;
+    return (chunk)(prod >> BASEBITS_B512_60);
+}
+
+#else
+
+/* No integer type available that can store double the wordlength */
+/* accumulate partial products */
+
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    chunk x0, x1, y0, y1;
+    chunk bot, top, mid, carry;
+    x0 = x & HMASK_B512_60;
+    x1 = (x >> HBITS_B512_60);
+    y0 = y & HMASK_B512_60;
+    y1 = (y >> HBITS_B512_60);
+    bot = x0 * y0;
+    top = x1 * y1;
+    mid = x0 * y1 + x1 * y0;
+    x0 = mid & HMASK_B512_60;
+    x1 = (mid >> HBITS_B512_60);
+    bot += x0 << HBITS_B512_60;
+    bot += *r;
+    bot += c;
+
+    top += x1;
+    carry = bot >> BASEBITS_B512_60;
+    bot &= BMASK_B512_60;
+    top += carry;
+
+    *r = bot;
+    return top;
+}
+
+#endif
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/big_B528_60.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/big_B528_60.h
new file mode 100644
index 0000000..b8f357a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/big_B528_60.h
@@ -0,0 +1,697 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file big.h
+ * @author Mike Scott
+ * @date 23rd February 2016
+ * @brief Big number Header File
+ *
+ *
+ */
+
+#ifndef BIG_B528_60_H
+#define BIG_B528_60_H
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <inttypes.h>
+#include "arch.h"
+#include "core.h"
+#include "config_big_B528_60.h"
+
+using namespace core;
+
+/* could comment this out if code size is a major issue */
+#define UNWOUND
+/* Normally recommended, but may not be optimal for some architectures, for example 32-bit ARM M4 */
+#define USE_KARATSUBA
+
+#define BIGBITS_B528_60 (8*MODBYTES_B528_60)
+#define NLEN_B528_60 (1+((8*MODBYTES_B528_60-1)/BASEBITS_B528_60))
+#define DNLEN_B528_60 2*NLEN_B528_60
+#define BMASK_B528_60 (((chunk)1<<BASEBITS_B528_60)-1) /**< Mask = 2^BASEBITS-1 */
+#define NEXCESS_B528_60 (1<<(CHUNK-BASEBITS_B528_60-1))           /**< 2^(CHUNK-BASEBITS-1) - digit cannot be multiplied by more than this before normalisation */
+
+#define HBITS_B528_60 (BASEBITS_B528_60/2)      /**< Number of bits in number base divided by 2 */
+#define HMASK_B528_60 (((chunk)1<<HBITS_B528_60)-1)    /**< Mask = 2^HBITS-1 */
+
+//#define DEBUG_NORM
+
+#ifdef DEBUG_NORM  /* Add an extra location to track chunk extension */
+#define MPV_B528_60 NLEN_B528_60
+#define MNV_B528_60 (NLEN_B528_60+1)
+#define DMPV_B528_60 DNLEN_B528_60
+#define DMNV_B528_60 (DNLEN_B528_60+1)
+
+#endif
+
+namespace B528_60 {
+
+//extern int BIGMULS;
+//extern int BIGSQRS;
+
+#ifdef DEBUG_NORM
+typedef chunk BIG[NLEN_B528_60 + 2]; /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B528_60 + 2]; /**< Define type DBIG as array of chunks */
+#else
+typedef chunk BIG[NLEN_B528_60];     /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B528_60];   /**< Define type DBIG as array of chunks */
+#endif
+
+/* BIG number prototypes */
+
+/**	@brief Tests for BIG equal to zero (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_iszilch(BIG x);
+/**	@brief Tests for BIG equal to one (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if one, else returns 0
+ */
+extern int BIG_isunity(BIG x);
+/**	@brief Tests for DBIG equal to zero (Constant Time)
+ *
+	@param x a DBIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_diszilch(DBIG x);
+/**	@brief Outputs a BIG number to the console (Variable Time)
+ *
+	@param x a BIG number
+ */
+extern void BIG_output(BIG x);
+/**	@brief Outputs a BIG number to the console in raw form (Variable Time for debugging)
+ *
+	@param x a BIG number
+ */
+extern void BIG_rawoutput(BIG x);
+/**	@brief Conditional constant time swap of two BIG numbers
+ *
+	Conditionally swaps parameters in constant time (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s swap takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cswap(BIG x, BIG y, int s);
+/**	@brief Conditional copy of BIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cmove(BIG x, BIG y, int s);
+/**	@brief Conditional copy of DBIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a DBIG number
+	@param y another DBIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_dcmove(BIG x, BIG y, int s);
+/**	@brief Convert from BIG number to byte array (Constant Time)
+ *
+	@param a byte array
+	@param x BIG number
+ */
+extern void BIG_toBytes(char *a, BIG x);
+/**	@brief Convert to BIG number from byte array (Constant Time)
+ *
+	@param x BIG number
+	@param a byte array
+ */
+extern void BIG_fromBytes(BIG x, char *a);
+/**	@brief Convert to BIG number from byte array of given length (Variable Time)
+ *
+	@param x BIG number
+	@param a byte array
+	@param s byte array length
+ */
+extern void BIG_fromBytesLen(BIG x, char *a, int s);
+/**@brief Convert to DBIG number from byte array of given length (Variable Time)
+ *
+   @param x DBIG number
+   @param a byte array
+   @param s byte array length
+ */
+extern void BIG_dfromBytesLen(DBIG x, char *a, int s);
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_doutput(DBIG x); 
+
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_drawoutput(DBIG x);
+
+/**	@brief Copy BIG from Read-Only Memory to a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number in ROM
+ */
+extern void BIG_rcopy(BIG x, const BIG y);
+/**	@brief Copy BIG to another BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_copy(BIG x, BIG y);
+/**	@brief Copy DBIG to another DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_dcopy(DBIG x, DBIG y);
+/**	@brief Copy BIG to upper half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dsucopy(DBIG x, BIG y);
+/**	@brief Copy BIG to lower half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dscopy(DBIG x, BIG y);
+/**	@brief Copy lower half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sdcopy(BIG x, DBIG y);
+/**	@brief Copy upper half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sducopy(BIG x, DBIG y);
+/**	@brief Set BIG to zero (Constant Time)
+ *
+	@param x BIG number to be set to zero  
+ */
+extern void BIG_zero(BIG x);
+/**	@brief Set DBIG to zero (Constant Time)
+ *
+	@param x DBIG number to be set to zero
+ */
+extern void BIG_dzero(DBIG x);
+/**	@brief Set BIG to one (unity) (Constant Time)
+ *
+	@param x BIG number to be set to one.
+ */
+extern void BIG_one(BIG x);
+/**	@brief Set BIG to inverse mod 2^256 (Constant Time)
+ *
+	@param x BIG number to be inverted
+ */
+extern void BIG_invmod2m(BIG x);
+/**	@brief Set BIG to sum of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, sum of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_add(BIG x, BIG y, BIG z);
+
+/**	@brief Set BIG to logical or of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, or of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_or(BIG x, BIG y, BIG z);
+
+/**	@brief Increment BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be incremented
+	@param i integer
+ */
+extern void BIG_inc(BIG x, int i);
+/**	@brief Set BIG to difference of two BIGs (Constant Time)
+ *
+	@param x BIG number, difference of other two - output not normalised
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_sub(BIG x, BIG y, BIG z);
+/**	@brief Decrement BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be decremented
+	@param i integer
+ */
+extern void BIG_dec(BIG x, int i);
+/**	@brief Set DBIG to sum of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, sum of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dadd(DBIG x, DBIG y, DBIG z);
+/**	@brief Set DBIG to difference of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, difference of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dsub(DBIG x, DBIG y, DBIG z);
+/**	@brief Multiply BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_imul(BIG x, BIG y, int i);
+/**	@brief Multiply BIG by not-so-small small integer - output normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+	@return Overflowing bits
+ */
+extern chunk BIG_pmul(BIG x, BIG y, int i);
+/**	@brief Divide BIG by 3 - output normalised (Constant Time)
+ *
+	@param x BIG number
+	@return Remainder
+ */
+extern int BIG_div3(BIG x);
+/**	@brief Multiply BIG by even bigger small integer resulting in a DBIG - output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_pxmul(DBIG x, BIG y, int i);
+/**	@brief Multiply BIG by another BIG resulting in DBIG - inputs normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_mul(DBIG x, BIG y, BIG z);
+/**	@brief Multiply BIG by another BIG resulting in another BIG - inputs normalised and output normalised (Constant Time)
+ *
+	Note that the product must fit into a BIG, and x must be distinct from y and z
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_smul(BIG x, BIG y, BIG z);
+/**	@brief Square BIG resulting in a DBIG - input normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, square of a BIG
+	@param y BIG number to be squared
+ */
+extern void BIG_sqr(DBIG x, BIG y);
+
+/**	@brief Montgomery reduction of a DBIG to a BIG  - input normalised and output normalised (Constant Time)
+ *
+	@param a BIG number, reduction of a BIG
+	@param md BIG number, the modulus
+	@param MC the Montgomery Constant
+	@param d DBIG number to be reduced
+ */
+extern void BIG_monty(BIG a, BIG md, chunk MC, DBIG d);
+
+/**	@brief Shifts a BIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shl(BIG x, int s);
+/**	@brief Fast shifts a BIG left by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Overflow bits
+ */
+extern int BIG_fshl(BIG x, int s);
+/**	@brief Shifts a DBIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshl(DBIG x, int s);
+/**	@brief Shifts a BIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shr(BIG x, int s);
+
+
+/**	@brief Fast time-critical combined shift by 1 bit, subtract and normalise (Constant Time)
+ *
+	@param r BIG number normalised output
+	@param a BIG number to be subtracted from
+	@param m BIG number to be shifted and subtracted
+	@return sign of r
+ */
+extern int BIG_ssn(BIG r, BIG a, BIG m);
+
+/**	@brief Fast shifts a BIG right by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Shifted out bits
+ */
+extern int BIG_fshr(BIG x, int s);
+/**	@brief Shifts a DBIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshr(DBIG x, int s);
+/**	@brief Splits a DBIG into two BIGs - input must be normalised, outputs normalised (Constant Time as used)
+ *
+	Internal function. The value of s must be approximately in the middle of the DBIG.
+	Typically used to extract z mod 2^MODBITS and z/2^MODBITS
+	@param x BIG number, top half of z
+	@param y BIG number, bottom half of z
+	@param z DBIG number to be split in two.
+	@param s Bit position at which to split
+	@return carry-out from top half
+ */
+extern chunk BIG_split(BIG x, BIG y, DBIG z, int s);
+/**	@brief Normalizes a BIG number - output normalised (Constant Time)
+ *
+	All digits of the input BIG are reduced mod 2^BASEBITS
+	@param x BIG number to be normalised
+ */
+extern chunk BIG_norm(BIG x);
+/**	@brief Normalizes a DBIG number - output normalised (Constant Time)
+ *
+	All digits of the input DBIG are reduced mod 2^BASEBITS
+	@param x DBIG number to be normalised
+ */
+extern void BIG_dnorm(DBIG x);
+/**	@brief Compares two BIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first BIG number to be compared
+	@param y second BIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_comp(BIG x, BIG y);
+/**	@brief Compares two DBIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first DBIG number to be compared
+	@param y second DBIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_dcomp(DBIG x, DBIG y);
+/**	@brief Calculate number of bits in a BIG - output normalised (Variable Time)
+ *
+	@param x BIG number
+	@return Number of bits in x
+ */
+extern int BIG_nbits(BIG x);
+/**	@brief Calculate number of bits in a DBIG - output normalised (Variable Time)
+ *
+	@param x DBIG number
+	@return Number of bits in x
+ */
+extern int BIG_dnbits(DBIG x);
+
+/**	@brief Reduce x mod n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctmod(BIG x, BIG n, int bd);
+
+/**	@brief  x=y mod n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctdmod(BIG x, DBIG y, BIG n, int bd);
+
+/**	@brief Divide x by n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctsdiv(BIG x,BIG n,int bd);
+
+/**	@brief  x=y/n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctddiv(BIG x, DBIG y, BIG n,int bd);
+
+
+/**	@brief Reduce x mod n - input and output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+ */
+extern void BIG_mod(BIG x, BIG n);
+/**	@brief Divide x by n - output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+ */
+extern void BIG_sdiv(BIG x, BIG n);
+/**	@brief  x=y mod n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_dmod(BIG x, DBIG y, BIG n);
+/**	@brief  x=y/n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_ddiv(BIG x, DBIG y, BIG n);
+/**	@brief  return parity of BIG, that is the least significant bit (Constant Time)
+ *
+	@param x BIG number
+	@return 0 or 1
+ */
+extern int BIG_parity(BIG x);
+/**	@brief  return i-th of BIG (Constant Time)
+ *
+	@param x BIG number
+	@param i the bit of x to be returned
+	@return 0 or 1
+ */
+extern int BIG_bit(BIG x, int i);
+/**	@brief  return least significant bits of a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param n number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int BIG_lastbits(BIG x, int n);
+/**	@brief  Create a random BIG from a random number generator (Constant Time)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_random(BIG x, csprng *r);
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randomnum(BIG x, BIG n, csprng *r);
+
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus and truncated to max bit length (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param t Maximum bit length
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randtrunc(BIG x, BIG n, int t, csprng *r);
+
+/**	brief  return NAF (Non-Adjacent-Form) value as +/- 1, 3 or 5, inputs must be normalised
+ *
+	Given x and 3*x extracts NAF value from given bit position, and returns number of bits processed, and number of trailing zeros detected if any
+	param x BIG number
+	param x3 BIG number, three times x
+	param i bit position
+	param nbs pointer to integer returning number of bits processed
+	param nzs pointer to integer returning number of trailing 0s
+	return + or - 1, 3 or 5
+*/
+
+/**	@brief  Calculate x=y*z mod n (Variable Time)
+ *
+	Slow method for modular multiplication
+	@param x BIG number, on exit = y*z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modmul(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y/z mod n (Variable Time)
+ *
+	Slow method for modular division
+	@param x BIG number, on exit = y/z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_moddiv(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y^2 mod n (Variable Time)
+ *
+	Slow method for modular squaring
+	@param x BIG number, on exit = y^2 mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modsqr(BIG x, BIG y, BIG n);
+/**	@brief  Calculate x=-y mod n (Variable Time)
+ *
+	Modular negation
+	@param x BIG number, on exit = -y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modneg(BIG x, BIG y, BIG n);
+
+/**	@brief  Calculate x=y+z mod n (Variable Time)
+ *
+	Slow method for modular addition
+	@param x BIG number, on exit = y+z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modadd(BIG x, BIG y, BIG z, BIG n);
+
+/**	@brief  Calculate jacobi Symbol (x/y) (Variable Time)
+ *
+	@param x BIG number
+	@param y BIG number
+	@return Jacobi symbol, -1,0 or 1
+ */
+extern int BIG_jacobi(BIG x, BIG y);
+/**	@brief  Calculate x=1/y mod n (Variable Time)
+ *
+	Modular Inversion - This is slow. Uses binary method.
+	@param x BIG number, on exit = 1/y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_invmodp(BIG x, BIG y, BIG n);
+/** @brief Calculate x=x mod 2^m (Variable Time)
+ *
+	Truncation
+	@param x BIG number, on reduced mod 2^m
+	@param m new truncated size
+*/
+extern void BIG_mod2m(BIG x, int m);
+
+/**	@brief Calculates a*b+c+*d
+ *
+	Calculate partial product of a.b, add in carry c, and add total to d (Constant Time)
+	@param a multiplier
+	@param b multiplicand
+	@param c carry
+	@param d pointer to accumulated bottom half of result
+	@return top half of result
+ */
+
+
+extern int step1(BIG,BIG,BIG);
+extern void step2(BIG,BIG,BIG);
+
+#ifdef dchunk
+
+/* Method required to calculate x*y+c+r, bottom half in r, top half returned */
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    dchunk prod = (dchunk)x * y + c + *r;
+    *r = (chunk)prod & BMASK_B528_60;
+    return (chunk)(prod >> BASEBITS_B528_60);
+}
+
+#else
+
+/* No integer type available that can store double the wordlength */
+/* accumulate partial products */
+
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    chunk x0, x1, y0, y1;
+    chunk bot, top, mid, carry;
+    x0 = x & HMASK_B528_60;
+    x1 = (x >> HBITS_B528_60);
+    y0 = y & HMASK_B528_60;
+    y1 = (y >> HBITS_B528_60);
+    bot = x0 * y0;
+    top = x1 * y1;
+    mid = x0 * y1 + x1 * y0;
+    x0 = mid & HMASK_B528_60;
+    x1 = (mid >> HBITS_B528_60);
+    bot += x0 << HBITS_B528_60;
+    bot += *r;
+    bot += c;
+
+    top += x1;
+    carry = bot >> BASEBITS_B528_60;
+    bot &= BMASK_B528_60;
+    top += carry;
+
+    *r = bot;
+    return top;
+}
+
+#endif
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/big_B560_58.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/big_B560_58.h
new file mode 100644
index 0000000..eef9fc8
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/big_B560_58.h
@@ -0,0 +1,697 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file big.h
+ * @author Mike Scott
+ * @date 23rd February 2016
+ * @brief Big number Header File
+ *
+ *
+ */
+
+#ifndef BIG_B560_58_H
+#define BIG_B560_58_H
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <inttypes.h>
+#include "arch.h"
+#include "core.h"
+#include "config_big_B560_58.h"
+
+using namespace core;
+
+/* could comment this out if code size is a major issue */
+#define UNWOUND
+/* Normally recommended, but may not be optimal for some architectures, for example 32-bit ARM M4 */
+#define USE_KARATSUBA
+
+#define BIGBITS_B560_58 (8*MODBYTES_B560_58)
+#define NLEN_B560_58 (1+((8*MODBYTES_B560_58-1)/BASEBITS_B560_58))
+#define DNLEN_B560_58 2*NLEN_B560_58
+#define BMASK_B560_58 (((chunk)1<<BASEBITS_B560_58)-1) /**< Mask = 2^BASEBITS-1 */
+#define NEXCESS_B560_58 (1<<(CHUNK-BASEBITS_B560_58-1))           /**< 2^(CHUNK-BASEBITS-1) - digit cannot be multiplied by more than this before normalisation */
+
+#define HBITS_B560_58 (BASEBITS_B560_58/2)      /**< Number of bits in number base divided by 2 */
+#define HMASK_B560_58 (((chunk)1<<HBITS_B560_58)-1)    /**< Mask = 2^HBITS-1 */
+
+//#define DEBUG_NORM
+
+#ifdef DEBUG_NORM  /* Add an extra location to track chunk extension */
+#define MPV_B560_58 NLEN_B560_58
+#define MNV_B560_58 (NLEN_B560_58+1)
+#define DMPV_B560_58 DNLEN_B560_58
+#define DMNV_B560_58 (DNLEN_B560_58+1)
+
+#endif
+
+namespace B560_58 {
+
+//extern int BIGMULS;
+//extern int BIGSQRS;
+
+#ifdef DEBUG_NORM
+typedef chunk BIG[NLEN_B560_58 + 2]; /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B560_58 + 2]; /**< Define type DBIG as array of chunks */
+#else
+typedef chunk BIG[NLEN_B560_58];     /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B560_58];   /**< Define type DBIG as array of chunks */
+#endif
+
+/* BIG number prototypes */
+
+/**	@brief Tests for BIG equal to zero (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_iszilch(BIG x);
+/**	@brief Tests for BIG equal to one (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if one, else returns 0
+ */
+extern int BIG_isunity(BIG x);
+/**	@brief Tests for DBIG equal to zero (Constant Time)
+ *
+	@param x a DBIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_diszilch(DBIG x);
+/**	@brief Outputs a BIG number to the console (Variable Time)
+ *
+	@param x a BIG number
+ */
+extern void BIG_output(BIG x);
+/**	@brief Outputs a BIG number to the console in raw form (Variable Time for debugging)
+ *
+	@param x a BIG number
+ */
+extern void BIG_rawoutput(BIG x);
+/**	@brief Conditional constant time swap of two BIG numbers
+ *
+	Conditionally swaps parameters in constant time (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s swap takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cswap(BIG x, BIG y, int s);
+/**	@brief Conditional copy of BIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cmove(BIG x, BIG y, int s);
+/**	@brief Conditional copy of DBIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a DBIG number
+	@param y another DBIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_dcmove(BIG x, BIG y, int s);
+/**	@brief Convert from BIG number to byte array (Constant Time)
+ *
+	@param a byte array
+	@param x BIG number
+ */
+extern void BIG_toBytes(char *a, BIG x);
+/**	@brief Convert to BIG number from byte array (Constant Time)
+ *
+	@param x BIG number
+	@param a byte array
+ */
+extern void BIG_fromBytes(BIG x, char *a);
+/**	@brief Convert to BIG number from byte array of given length (Variable Time)
+ *
+	@param x BIG number
+	@param a byte array
+	@param s byte array length
+ */
+extern void BIG_fromBytesLen(BIG x, char *a, int s);
+/**@brief Convert to DBIG number from byte array of given length (Variable Time)
+ *
+   @param x DBIG number
+   @param a byte array
+   @param s byte array length
+ */
+extern void BIG_dfromBytesLen(DBIG x, char *a, int s);
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_doutput(DBIG x); 
+
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_drawoutput(DBIG x);
+
+/**	@brief Copy BIG from Read-Only Memory to a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number in ROM
+ */
+extern void BIG_rcopy(BIG x, const BIG y);
+/**	@brief Copy BIG to another BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_copy(BIG x, BIG y);
+/**	@brief Copy DBIG to another DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_dcopy(DBIG x, DBIG y);
+/**	@brief Copy BIG to upper half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dsucopy(DBIG x, BIG y);
+/**	@brief Copy BIG to lower half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dscopy(DBIG x, BIG y);
+/**	@brief Copy lower half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sdcopy(BIG x, DBIG y);
+/**	@brief Copy upper half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sducopy(BIG x, DBIG y);
+/**	@brief Set BIG to zero (Constant Time)
+ *
+	@param x BIG number to be set to zero  
+ */
+extern void BIG_zero(BIG x);
+/**	@brief Set DBIG to zero (Constant Time)
+ *
+	@param x DBIG number to be set to zero
+ */
+extern void BIG_dzero(DBIG x);
+/**	@brief Set BIG to one (unity) (Constant Time)
+ *
+	@param x BIG number to be set to one.
+ */
+extern void BIG_one(BIG x);
+/**	@brief Set BIG to inverse mod 2^256 (Constant Time)
+ *
+	@param x BIG number to be inverted
+ */
+extern void BIG_invmod2m(BIG x);
+/**	@brief Set BIG to sum of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, sum of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_add(BIG x, BIG y, BIG z);
+
+/**	@brief Set BIG to logical or of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, or of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_or(BIG x, BIG y, BIG z);
+
+/**	@brief Increment BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be incremented
+	@param i integer
+ */
+extern void BIG_inc(BIG x, int i);
+/**	@brief Set BIG to difference of two BIGs (Constant Time)
+ *
+	@param x BIG number, difference of other two - output not normalised
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_sub(BIG x, BIG y, BIG z);
+/**	@brief Decrement BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be decremented
+	@param i integer
+ */
+extern void BIG_dec(BIG x, int i);
+/**	@brief Set DBIG to sum of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, sum of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dadd(DBIG x, DBIG y, DBIG z);
+/**	@brief Set DBIG to difference of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, difference of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dsub(DBIG x, DBIG y, DBIG z);
+/**	@brief Multiply BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_imul(BIG x, BIG y, int i);
+/**	@brief Multiply BIG by not-so-small small integer - output normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+	@return Overflowing bits
+ */
+extern chunk BIG_pmul(BIG x, BIG y, int i);
+/**	@brief Divide BIG by 3 - output normalised (Constant Time)
+ *
+	@param x BIG number
+	@return Remainder
+ */
+extern int BIG_div3(BIG x);
+/**	@brief Multiply BIG by even bigger small integer resulting in a DBIG - output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_pxmul(DBIG x, BIG y, int i);
+/**	@brief Multiply BIG by another BIG resulting in DBIG - inputs normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_mul(DBIG x, BIG y, BIG z);
+/**	@brief Multiply BIG by another BIG resulting in another BIG - inputs normalised and output normalised (Constant Time)
+ *
+	Note that the product must fit into a BIG, and x must be distinct from y and z
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_smul(BIG x, BIG y, BIG z);
+/**	@brief Square BIG resulting in a DBIG - input normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, square of a BIG
+	@param y BIG number to be squared
+ */
+extern void BIG_sqr(DBIG x, BIG y);
+
+/**	@brief Montgomery reduction of a DBIG to a BIG  - input normalised and output normalised (Constant Time)
+ *
+	@param a BIG number, reduction of a BIG
+	@param md BIG number, the modulus
+	@param MC the Montgomery Constant
+	@param d DBIG number to be reduced
+ */
+extern void BIG_monty(BIG a, BIG md, chunk MC, DBIG d);
+
+/**	@brief Shifts a BIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shl(BIG x, int s);
+/**	@brief Fast shifts a BIG left by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Overflow bits
+ */
+extern int BIG_fshl(BIG x, int s);
+/**	@brief Shifts a DBIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshl(DBIG x, int s);
+/**	@brief Shifts a BIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shr(BIG x, int s);
+
+
+/**	@brief Fast time-critical combined shift by 1 bit, subtract and normalise (Constant Time)
+ *
+	@param r BIG number normalised output
+	@param a BIG number to be subtracted from
+	@param m BIG number to be shifted and subtracted
+	@return sign of r
+ */
+extern int BIG_ssn(BIG r, BIG a, BIG m);
+
+/**	@brief Fast shifts a BIG right by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Shifted out bits
+ */
+extern int BIG_fshr(BIG x, int s);
+/**	@brief Shifts a DBIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshr(DBIG x, int s);
+/**	@brief Splits a DBIG into two BIGs - input must be normalised, outputs normalised (Constant Time as used)
+ *
+	Internal function. The value of s must be approximately in the middle of the DBIG.
+	Typically used to extract z mod 2^MODBITS and z/2^MODBITS
+	@param x BIG number, top half of z
+	@param y BIG number, bottom half of z
+	@param z DBIG number to be split in two.
+	@param s Bit position at which to split
+	@return carry-out from top half
+ */
+extern chunk BIG_split(BIG x, BIG y, DBIG z, int s);
+/**	@brief Normalizes a BIG number - output normalised (Constant Time)
+ *
+	All digits of the input BIG are reduced mod 2^BASEBITS
+	@param x BIG number to be normalised
+ */
+extern chunk BIG_norm(BIG x);
+/**	@brief Normalizes a DBIG number - output normalised (Constant Time)
+ *
+	All digits of the input DBIG are reduced mod 2^BASEBITS
+	@param x DBIG number to be normalised
+ */
+extern void BIG_dnorm(DBIG x);
+/**	@brief Compares two BIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first BIG number to be compared
+	@param y second BIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_comp(BIG x, BIG y);
+/**	@brief Compares two DBIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first DBIG number to be compared
+	@param y second DBIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_dcomp(DBIG x, DBIG y);
+/**	@brief Calculate number of bits in a BIG - output normalised (Variable Time)
+ *
+	@param x BIG number
+	@return Number of bits in x
+ */
+extern int BIG_nbits(BIG x);
+/**	@brief Calculate number of bits in a DBIG - output normalised (Variable Time)
+ *
+	@param x DBIG number
+	@return Number of bits in x
+ */
+extern int BIG_dnbits(DBIG x);
+
+/**	@brief Reduce x mod n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctmod(BIG x, BIG n, int bd);
+
+/**	@brief  x=y mod n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctdmod(BIG x, DBIG y, BIG n, int bd);
+
+/**	@brief Divide x by n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctsdiv(BIG x,BIG n,int bd);
+
+/**	@brief  x=y/n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctddiv(BIG x, DBIG y, BIG n,int bd);
+
+
+/**	@brief Reduce x mod n - input and output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+ */
+extern void BIG_mod(BIG x, BIG n);
+/**	@brief Divide x by n - output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+ */
+extern void BIG_sdiv(BIG x, BIG n);
+/**	@brief  x=y mod n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_dmod(BIG x, DBIG y, BIG n);
+/**	@brief  x=y/n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_ddiv(BIG x, DBIG y, BIG n);
+/**	@brief  return parity of BIG, that is the least significant bit (Constant Time)
+ *
+	@param x BIG number
+	@return 0 or 1
+ */
+extern int BIG_parity(BIG x);
+/**	@brief  return i-th of BIG (Constant Time)
+ *
+	@param x BIG number
+	@param i the bit of x to be returned
+	@return 0 or 1
+ */
+extern int BIG_bit(BIG x, int i);
+/**	@brief  return least significant bits of a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param n number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int BIG_lastbits(BIG x, int n);
+/**	@brief  Create a random BIG from a random number generator (Constant Time)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_random(BIG x, csprng *r);
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randomnum(BIG x, BIG n, csprng *r);
+
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus and truncated to max bit length (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param t Maximum bit length
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randtrunc(BIG x, BIG n, int t, csprng *r);
+
+/**	brief  return NAF (Non-Adjacent-Form) value as +/- 1, 3 or 5, inputs must be normalised
+ *
+	Given x and 3*x extracts NAF value from given bit position, and returns number of bits processed, and number of trailing zeros detected if any
+	param x BIG number
+	param x3 BIG number, three times x
+	param i bit position
+	param nbs pointer to integer returning number of bits processed
+	param nzs pointer to integer returning number of trailing 0s
+	return + or - 1, 3 or 5
+*/
+
+/**	@brief  Calculate x=y*z mod n (Variable Time)
+ *
+	Slow method for modular multiplication
+	@param x BIG number, on exit = y*z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modmul(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y/z mod n (Variable Time)
+ *
+	Slow method for modular division
+	@param x BIG number, on exit = y/z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_moddiv(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y^2 mod n (Variable Time)
+ *
+	Slow method for modular squaring
+	@param x BIG number, on exit = y^2 mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modsqr(BIG x, BIG y, BIG n);
+/**	@brief  Calculate x=-y mod n (Variable Time)
+ *
+	Modular negation
+	@param x BIG number, on exit = -y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modneg(BIG x, BIG y, BIG n);
+
+/**	@brief  Calculate x=y+z mod n (Variable Time)
+ *
+	Slow method for modular addition
+	@param x BIG number, on exit = y+z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modadd(BIG x, BIG y, BIG z, BIG n);
+
+/**	@brief  Calculate jacobi Symbol (x/y) (Variable Time)
+ *
+	@param x BIG number
+	@param y BIG number
+	@return Jacobi symbol, -1,0 or 1
+ */
+extern int BIG_jacobi(BIG x, BIG y);
+/**	@brief  Calculate x=1/y mod n (Variable Time)
+ *
+	Modular Inversion - This is slow. Uses binary method.
+	@param x BIG number, on exit = 1/y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_invmodp(BIG x, BIG y, BIG n);
+/** @brief Calculate x=x mod 2^m (Variable Time)
+ *
+	Truncation
+	@param x BIG number, on reduced mod 2^m
+	@param m new truncated size
+*/
+extern void BIG_mod2m(BIG x, int m);
+
+/**	@brief Calculates a*b+c+*d
+ *
+	Calculate partial product of a.b, add in carry c, and add total to d (Constant Time)
+	@param a multiplier
+	@param b multiplicand
+	@param c carry
+	@param d pointer to accumulated bottom half of result
+	@return top half of result
+ */
+
+
+extern int step1(BIG,BIG,BIG);
+extern void step2(BIG,BIG,BIG);
+
+#ifdef dchunk
+
+/* Method required to calculate x*y+c+r, bottom half in r, top half returned */
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    dchunk prod = (dchunk)x * y + c + *r;
+    *r = (chunk)prod & BMASK_B560_58;
+    return (chunk)(prod >> BASEBITS_B560_58);
+}
+
+#else
+
+/* No integer type available that can store double the wordlength */
+/* accumulate partial products */
+
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    chunk x0, x1, y0, y1;
+    chunk bot, top, mid, carry;
+    x0 = x & HMASK_B560_58;
+    x1 = (x >> HBITS_B560_58);
+    y0 = y & HMASK_B560_58;
+    y1 = (y >> HBITS_B560_58);
+    bot = x0 * y0;
+    top = x1 * y1;
+    mid = x0 * y1 + x1 * y0;
+    x0 = mid & HMASK_B560_58;
+    x1 = (mid >> HBITS_B560_58);
+    bot += x0 << HBITS_B560_58;
+    bot += *r;
+    bot += c;
+
+    top += x1;
+    carry = bot >> BASEBITS_B560_58;
+    bot &= BMASK_B560_58;
+    top += carry;
+
+    *r = bot;
+    return top;
+}
+
+#endif
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/big_B584_60.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/big_B584_60.h
new file mode 100644
index 0000000..3c84b90
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/big_B584_60.h
@@ -0,0 +1,697 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file big.h
+ * @author Mike Scott
+ * @date 23rd February 2016
+ * @brief Big number Header File
+ *
+ *
+ */
+
+#ifndef BIG_B584_60_H
+#define BIG_B584_60_H
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <inttypes.h>
+#include "arch.h"
+#include "core.h"
+#include "config_big_B584_60.h"
+
+using namespace core;
+
+/* could comment this out if code size is a major issue */
+#define UNWOUND
+/* Normally recommended, but may not be optimal for some architectures, for example 32-bit ARM M4 */
+#define USE_KARATSUBA
+
+#define BIGBITS_B584_60 (8*MODBYTES_B584_60)
+#define NLEN_B584_60 (1+((8*MODBYTES_B584_60-1)/BASEBITS_B584_60))
+#define DNLEN_B584_60 2*NLEN_B584_60
+#define BMASK_B584_60 (((chunk)1<<BASEBITS_B584_60)-1) /**< Mask = 2^BASEBITS-1 */
+#define NEXCESS_B584_60 (1<<(CHUNK-BASEBITS_B584_60-1))           /**< 2^(CHUNK-BASEBITS-1) - digit cannot be multiplied by more than this before normalisation */
+
+#define HBITS_B584_60 (BASEBITS_B584_60/2)      /**< Number of bits in number base divided by 2 */
+#define HMASK_B584_60 (((chunk)1<<HBITS_B584_60)-1)    /**< Mask = 2^HBITS-1 */
+
+//#define DEBUG_NORM
+
+#ifdef DEBUG_NORM  /* Add an extra location to track chunk extension */
+#define MPV_B584_60 NLEN_B584_60
+#define MNV_B584_60 (NLEN_B584_60+1)
+#define DMPV_B584_60 DNLEN_B584_60
+#define DMNV_B584_60 (DNLEN_B584_60+1)
+
+#endif
+
+namespace B584_60 {
+
+//extern int BIGMULS;
+//extern int BIGSQRS;
+
+#ifdef DEBUG_NORM
+typedef chunk BIG[NLEN_B584_60 + 2]; /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B584_60 + 2]; /**< Define type DBIG as array of chunks */
+#else
+typedef chunk BIG[NLEN_B584_60];     /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B584_60];   /**< Define type DBIG as array of chunks */
+#endif
+
+/* BIG number prototypes */
+
+/**	@brief Tests for BIG equal to zero (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_iszilch(BIG x);
+/**	@brief Tests for BIG equal to one (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if one, else returns 0
+ */
+extern int BIG_isunity(BIG x);
+/**	@brief Tests for DBIG equal to zero (Constant Time)
+ *
+	@param x a DBIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_diszilch(DBIG x);
+/**	@brief Outputs a BIG number to the console (Variable Time)
+ *
+	@param x a BIG number
+ */
+extern void BIG_output(BIG x);
+/**	@brief Outputs a BIG number to the console in raw form (Variable Time for debugging)
+ *
+	@param x a BIG number
+ */
+extern void BIG_rawoutput(BIG x);
+/**	@brief Conditional constant time swap of two BIG numbers
+ *
+	Conditionally swaps parameters in constant time (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s swap takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cswap(BIG x, BIG y, int s);
+/**	@brief Conditional copy of BIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cmove(BIG x, BIG y, int s);
+/**	@brief Conditional copy of DBIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a DBIG number
+	@param y another DBIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_dcmove(BIG x, BIG y, int s);
+/**	@brief Convert from BIG number to byte array (Constant Time)
+ *
+	@param a byte array
+	@param x BIG number
+ */
+extern void BIG_toBytes(char *a, BIG x);
+/**	@brief Convert to BIG number from byte array (Constant Time)
+ *
+	@param x BIG number
+	@param a byte array
+ */
+extern void BIG_fromBytes(BIG x, char *a);
+/**	@brief Convert to BIG number from byte array of given length (Variable Time)
+ *
+	@param x BIG number
+	@param a byte array
+	@param s byte array length
+ */
+extern void BIG_fromBytesLen(BIG x, char *a, int s);
+/**@brief Convert to DBIG number from byte array of given length (Variable Time)
+ *
+   @param x DBIG number
+   @param a byte array
+   @param s byte array length
+ */
+extern void BIG_dfromBytesLen(DBIG x, char *a, int s);
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_doutput(DBIG x); 
+
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_drawoutput(DBIG x);
+
+/**	@brief Copy BIG from Read-Only Memory to a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number in ROM
+ */
+extern void BIG_rcopy(BIG x, const BIG y);
+/**	@brief Copy BIG to another BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_copy(BIG x, BIG y);
+/**	@brief Copy DBIG to another DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_dcopy(DBIG x, DBIG y);
+/**	@brief Copy BIG to upper half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dsucopy(DBIG x, BIG y);
+/**	@brief Copy BIG to lower half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dscopy(DBIG x, BIG y);
+/**	@brief Copy lower half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sdcopy(BIG x, DBIG y);
+/**	@brief Copy upper half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sducopy(BIG x, DBIG y);
+/**	@brief Set BIG to zero (Constant Time)
+ *
+	@param x BIG number to be set to zero  
+ */
+extern void BIG_zero(BIG x);
+/**	@brief Set DBIG to zero (Constant Time)
+ *
+	@param x DBIG number to be set to zero
+ */
+extern void BIG_dzero(DBIG x);
+/**	@brief Set BIG to one (unity) (Constant Time)
+ *
+	@param x BIG number to be set to one.
+ */
+extern void BIG_one(BIG x);
+/**	@brief Set BIG to inverse mod 2^256 (Constant Time)
+ *
+	@param x BIG number to be inverted
+ */
+extern void BIG_invmod2m(BIG x);
+/**	@brief Set BIG to sum of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, sum of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_add(BIG x, BIG y, BIG z);
+
+/**	@brief Set BIG to logical or of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, or of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_or(BIG x, BIG y, BIG z);
+
+/**	@brief Increment BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be incremented
+	@param i integer
+ */
+extern void BIG_inc(BIG x, int i);
+/**	@brief Set BIG to difference of two BIGs (Constant Time)
+ *
+	@param x BIG number, difference of other two - output not normalised
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_sub(BIG x, BIG y, BIG z);
+/**	@brief Decrement BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be decremented
+	@param i integer
+ */
+extern void BIG_dec(BIG x, int i);
+/**	@brief Set DBIG to sum of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, sum of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dadd(DBIG x, DBIG y, DBIG z);
+/**	@brief Set DBIG to difference of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, difference of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dsub(DBIG x, DBIG y, DBIG z);
+/**	@brief Multiply BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_imul(BIG x, BIG y, int i);
+/**	@brief Multiply BIG by not-so-small small integer - output normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+	@return Overflowing bits
+ */
+extern chunk BIG_pmul(BIG x, BIG y, int i);
+/**	@brief Divide BIG by 3 - output normalised (Constant Time)
+ *
+	@param x BIG number
+	@return Remainder
+ */
+extern int BIG_div3(BIG x);
+/**	@brief Multiply BIG by even bigger small integer resulting in a DBIG - output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_pxmul(DBIG x, BIG y, int i);
+/**	@brief Multiply BIG by another BIG resulting in DBIG - inputs normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_mul(DBIG x, BIG y, BIG z);
+/**	@brief Multiply BIG by another BIG resulting in another BIG - inputs normalised and output normalised (Constant Time)
+ *
+	Note that the product must fit into a BIG, and x must be distinct from y and z
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_smul(BIG x, BIG y, BIG z);
+/**	@brief Square BIG resulting in a DBIG - input normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, square of a BIG
+	@param y BIG number to be squared
+ */
+extern void BIG_sqr(DBIG x, BIG y);
+
+/**	@brief Montgomery reduction of a DBIG to a BIG  - input normalised and output normalised (Constant Time)
+ *
+	@param a BIG number, reduction of a BIG
+	@param md BIG number, the modulus
+	@param MC the Montgomery Constant
+	@param d DBIG number to be reduced
+ */
+extern void BIG_monty(BIG a, BIG md, chunk MC, DBIG d);
+
+/**	@brief Shifts a BIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shl(BIG x, int s);
+/**	@brief Fast shifts a BIG left by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Overflow bits
+ */
+extern int BIG_fshl(BIG x, int s);
+/**	@brief Shifts a DBIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshl(DBIG x, int s);
+/**	@brief Shifts a BIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shr(BIG x, int s);
+
+
+/**	@brief Fast time-critical combined shift by 1 bit, subtract and normalise (Constant Time)
+ *
+	@param r BIG number normalised output
+	@param a BIG number to be subtracted from
+	@param m BIG number to be shifted and subtracted
+	@return sign of r
+ */
+extern int BIG_ssn(BIG r, BIG a, BIG m);
+
+/**	@brief Fast shifts a BIG right by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Shifted out bits
+ */
+extern int BIG_fshr(BIG x, int s);
+/**	@brief Shifts a DBIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshr(DBIG x, int s);
+/**	@brief Splits a DBIG into two BIGs - input must be normalised, outputs normalised (Constant Time as used)
+ *
+	Internal function. The value of s must be approximately in the middle of the DBIG.
+	Typically used to extract z mod 2^MODBITS and z/2^MODBITS
+	@param x BIG number, top half of z
+	@param y BIG number, bottom half of z
+	@param z DBIG number to be split in two.
+	@param s Bit position at which to split
+	@return carry-out from top half
+ */
+extern chunk BIG_split(BIG x, BIG y, DBIG z, int s);
+/**	@brief Normalizes a BIG number - output normalised (Constant Time)
+ *
+	All digits of the input BIG are reduced mod 2^BASEBITS
+	@param x BIG number to be normalised
+ */
+extern chunk BIG_norm(BIG x);
+/**	@brief Normalizes a DBIG number - output normalised (Constant Time)
+ *
+	All digits of the input DBIG are reduced mod 2^BASEBITS
+	@param x DBIG number to be normalised
+ */
+extern void BIG_dnorm(DBIG x);
+/**	@brief Compares two BIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first BIG number to be compared
+	@param y second BIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_comp(BIG x, BIG y);
+/**	@brief Compares two DBIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first DBIG number to be compared
+	@param y second DBIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_dcomp(DBIG x, DBIG y);
+/**	@brief Calculate number of bits in a BIG - output normalised (Variable Time)
+ *
+	@param x BIG number
+	@return Number of bits in x
+ */
+extern int BIG_nbits(BIG x);
+/**	@brief Calculate number of bits in a DBIG - output normalised (Variable Time)
+ *
+	@param x DBIG number
+	@return Number of bits in x
+ */
+extern int BIG_dnbits(DBIG x);
+
+/**	@brief Reduce x mod n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctmod(BIG x, BIG n, int bd);
+
+/**	@brief  x=y mod n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctdmod(BIG x, DBIG y, BIG n, int bd);
+
+/**	@brief Divide x by n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctsdiv(BIG x,BIG n,int bd);
+
+/**	@brief  x=y/n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctddiv(BIG x, DBIG y, BIG n,int bd);
+
+
+/**	@brief Reduce x mod n - input and output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+ */
+extern void BIG_mod(BIG x, BIG n);
+/**	@brief Divide x by n - output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+ */
+extern void BIG_sdiv(BIG x, BIG n);
+/**	@brief  x=y mod n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_dmod(BIG x, DBIG y, BIG n);
+/**	@brief  x=y/n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_ddiv(BIG x, DBIG y, BIG n);
+/**	@brief  return parity of BIG, that is the least significant bit (Constant Time)
+ *
+	@param x BIG number
+	@return 0 or 1
+ */
+extern int BIG_parity(BIG x);
+/**	@brief  return i-th of BIG (Constant Time)
+ *
+	@param x BIG number
+	@param i the bit of x to be returned
+	@return 0 or 1
+ */
+extern int BIG_bit(BIG x, int i);
+/**	@brief  return least significant bits of a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param n number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int BIG_lastbits(BIG x, int n);
+/**	@brief  Create a random BIG from a random number generator (Constant Time)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_random(BIG x, csprng *r);
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randomnum(BIG x, BIG n, csprng *r);
+
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus and truncated to max bit length (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param t Maximum bit length
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randtrunc(BIG x, BIG n, int t, csprng *r);
+
+/**	brief  return NAF (Non-Adjacent-Form) value as +/- 1, 3 or 5, inputs must be normalised
+ *
+	Given x and 3*x extracts NAF value from given bit position, and returns number of bits processed, and number of trailing zeros detected if any
+	param x BIG number
+	param x3 BIG number, three times x
+	param i bit position
+	param nbs pointer to integer returning number of bits processed
+	param nzs pointer to integer returning number of trailing 0s
+	return + or - 1, 3 or 5
+*/
+
+/**	@brief  Calculate x=y*z mod n (Variable Time)
+ *
+	Slow method for modular multiplication
+	@param x BIG number, on exit = y*z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modmul(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y/z mod n (Variable Time)
+ *
+	Slow method for modular division
+	@param x BIG number, on exit = y/z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_moddiv(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y^2 mod n (Variable Time)
+ *
+	Slow method for modular squaring
+	@param x BIG number, on exit = y^2 mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modsqr(BIG x, BIG y, BIG n);
+/**	@brief  Calculate x=-y mod n (Variable Time)
+ *
+	Modular negation
+	@param x BIG number, on exit = -y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modneg(BIG x, BIG y, BIG n);
+
+/**	@brief  Calculate x=y+z mod n (Variable Time)
+ *
+	Slow method for modular addition
+	@param x BIG number, on exit = y+z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modadd(BIG x, BIG y, BIG z, BIG n);
+
+/**	@brief  Calculate jacobi Symbol (x/y) (Variable Time)
+ *
+	@param x BIG number
+	@param y BIG number
+	@return Jacobi symbol, -1,0 or 1
+ */
+extern int BIG_jacobi(BIG x, BIG y);
+/**	@brief  Calculate x=1/y mod n (Variable Time)
+ *
+	Modular Inversion - This is slow. Uses binary method.
+	@param x BIG number, on exit = 1/y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_invmodp(BIG x, BIG y, BIG n);
+/** @brief Calculate x=x mod 2^m (Variable Time)
+ *
+	Truncation
+	@param x BIG number, on reduced mod 2^m
+	@param m new truncated size
+*/
+extern void BIG_mod2m(BIG x, int m);
+
+/**	@brief Calculates a*b+c+*d
+ *
+	Calculate partial product of a.b, add in carry c, and add total to d (Constant Time)
+	@param a multiplier
+	@param b multiplicand
+	@param c carry
+	@param d pointer to accumulated bottom half of result
+	@return top half of result
+ */
+
+
+extern int step1(BIG,BIG,BIG);
+extern void step2(BIG,BIG,BIG);
+
+#ifdef dchunk
+
+/* Method required to calculate x*y+c+r, bottom half in r, top half returned */
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    dchunk prod = (dchunk)x * y + c + *r;
+    *r = (chunk)prod & BMASK_B584_60;
+    return (chunk)(prod >> BASEBITS_B584_60);
+}
+
+#else
+
+/* No integer type available that can store double the wordlength */
+/* accumulate partial products */
+
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    chunk x0, x1, y0, y1;
+    chunk bot, top, mid, carry;
+    x0 = x & HMASK_B584_60;
+    x1 = (x >> HBITS_B584_60);
+    y0 = y & HMASK_B584_60;
+    y1 = (y >> HBITS_B584_60);
+    bot = x0 * y0;
+    top = x1 * y1;
+    mid = x0 * y1 + x1 * y0;
+    x0 = mid & HMASK_B584_60;
+    x1 = (mid >> HBITS_B584_60);
+    bot += x0 << HBITS_B584_60;
+    bot += *r;
+    bot += c;
+
+    top += x1;
+    carry = bot >> BASEBITS_B584_60;
+    bot &= BMASK_B584_60;
+    top += carry;
+
+    *r = bot;
+    return top;
+}
+
+#endif
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/bls.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/bls.h
new file mode 100644
index 0000000..d91ee9d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/bls.h
@@ -0,0 +1,87 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file bls.h
+ * @author Mike Scott
+ * @date 28th Novemebr 2018
+ * @brief BLS Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef BLS_ZZZ_H
+#define BLS_ZZZ_H
+
+#include "pair_ZZZ.h"
+
+using namespace core;
+
+namespace ZZZ {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define BGS_ZZZ MODBYTES_XXX  /**< BLS Group Size */
+#define BFS_ZZZ MODBYTES_XXX  /**< BLS Field Size */
+
+#define BLS_OK           0  /**< Function completed without error */
+#define BLS_FAIL        -1  /**< Point is NOT on the curve */
+
+/* BLS API functions */
+
+
+/** @brief Initialise BLS
+ *
+    @return BLS_OK if worked, otherwise BLS_FAIL
+ */
+int BLS_INIT();
+
+/** @brief Generate Key Pair
+ *
+    @param IKM contains truly random keying material
+    @param S on output a private key
+    @param W on output a public key = S*G, where G is fixed generator
+    @return BLS_OK
+ */
+int BLS_KEY_PAIR_GENERATE(octet *IKM, octet* S, octet *W);
+
+/** @brief Calculate a signature
+ *
+    @param SIG the ouput signature
+    @param M is the message to be signed
+    @param S an input private key
+    @return BLS_OK
+ */
+int BLS_CORE_SIGN(octet *SIG, octet *M, octet *S);
+
+/** @brief Verify a signature
+ *
+    @param SIG an input signature
+    @param M is the message whose signature is to be verified.
+    @param W an public key
+    @return BLS_OK if verified, otherwise BLS_FAIL
+ */
+int BLS_CORE_VERIFY(octet *SIG, octet *M, octet *W);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/bls192.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/bls192.h
new file mode 100644
index 0000000..2432d91
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/bls192.h
@@ -0,0 +1,86 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file bls192.h
+ * @author Mike Scott
+ * @date 28th Novemebr 2018
+ * @brief BLS Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef BLS192_ZZZ_H
+#define BLS192_ZZZ_H
+
+#include "pair4_ZZZ.h"
+
+using namespace core;
+
+namespace ZZZ {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define BGS_ZZZ MODBYTES_XXX  /**< BLS Group Size */
+#define BFS_ZZZ MODBYTES_XXX  /**< BLS Field Size */
+
+#define BLS_OK           0  /**< Function completed without error */
+#define BLS_FAIL        -1  /**< Point is NOT on the curve */
+
+/* BLS API functions */
+
+/** @brief Initialise BLS
+ *
+    @return BLS_OK if worked, otherwise BLS_FAIL
+ */
+int BLS_INIT();
+
+/** @brief Generate Key Pair
+ *
+    @param IKM contains truly random keying material
+    @param S on output a private key
+    @param W on output a public key = S*G, where G is fixed generator
+    @return BLS_OK
+ */
+int BLS_KEY_PAIR_GENERATE(octet *IKM, octet* S, octet *W);
+
+/** @brief Calculate a signature
+ *
+    @param SIG the ouput signature
+    @param M is the message to be signed
+    @param S an input private key
+    @return BLS_OK
+ */
+int BLS_CORE_SIGN(octet *SIG, octet *M, octet *S);
+
+/** @brief Verify a signature
+ *
+    @param SIG an input signature
+    @param M is the message whose signature is to be verified.
+    @param W an public key
+    @return BLS_OK if verified, otherwise BLS_FAIL
+ */
+int BLS_CORE_VERIFY(octet *SIG, octet *M, octet *W);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/bls192_BLS24479.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/bls192_BLS24479.h
new file mode 100644
index 0000000..b7302de
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/bls192_BLS24479.h
@@ -0,0 +1,86 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file bls192.h
+ * @author Mike Scott
+ * @date 28th Novemebr 2018
+ * @brief BLS Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef BLS192_BLS24479_H
+#define BLS192_BLS24479_H
+
+#include "pair4_BLS24479.h"
+
+using namespace core;
+
+namespace BLS24479 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define BGS_BLS24479 MODBYTES_B480_56  /**< BLS Group Size */
+#define BFS_BLS24479 MODBYTES_B480_56  /**< BLS Field Size */
+
+#define BLS_OK           0  /**< Function completed without error */
+#define BLS_FAIL        -1  /**< Point is NOT on the curve */
+
+/* BLS API functions */
+
+/** @brief Initialise BLS
+ *
+    @return BLS_OK if worked, otherwise BLS_FAIL
+ */
+int BLS_INIT();
+
+/** @brief Generate Key Pair
+ *
+    @param IKM contains truly random keying material
+    @param S on output a private key
+    @param W on output a public key = S*G, where G is fixed generator
+    @return BLS_OK
+ */
+int BLS_KEY_PAIR_GENERATE(octet *IKM, octet* S, octet *W);
+
+/** @brief Calculate a signature
+ *
+    @param SIG the ouput signature
+    @param M is the message to be signed
+    @param S an input private key
+    @return BLS_OK
+ */
+int BLS_CORE_SIGN(octet *SIG, octet *M, octet *S);
+
+/** @brief Verify a signature
+ *
+    @param SIG an input signature
+    @param M is the message whose signature is to be verified.
+    @param W an public key
+    @return BLS_OK if verified, otherwise BLS_FAIL
+ */
+int BLS_CORE_VERIFY(octet *SIG, octet *M, octet *W);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/bls256.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/bls256.h
new file mode 100644
index 0000000..97a8031
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/bls256.h
@@ -0,0 +1,86 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file bls256.h
+ * @author Mike Scott
+ * @date 28th Novemebr 2018
+ * @brief BLS Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef BLS256_ZZZ_H
+#define BLS256_ZZZ_H
+
+#include "pair8_ZZZ.h"
+
+using namespace core;
+
+namespace ZZZ {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define BGS_ZZZ MODBYTES_XXX  /**< BLS Group Size */
+#define BFS_ZZZ MODBYTES_XXX  /**< BLS Field Size */
+
+#define BLS_OK           0  /**< Function completed without error */
+#define BLS_FAIL        -1  /**< Point is NOT on the curve */
+
+/* BLS API functions */
+
+/** @brief Initialise BLS
+ *
+    @return BLS_OK if worked, otherwise BLS_FAIL
+ */
+int BLS_INIT();
+
+/** @brief Generate Key Pair
+ *
+    @param IKM contains truly random keying material
+    @param S on output a private key
+    @param W on output a public key = S*G, where G is fixed generator
+    @return BLS_OK
+ */
+int BLS_KEY_PAIR_GENERATE(octet *IKM, octet* S, octet *W);
+
+/** @brief Calculate a signature
+ *
+    @param SIG the ouput signature
+    @param m is the message to be signed
+    @param S an input private key
+    @return BLS_OK
+ */
+int BLS_CORE_SIGN(octet *SIG, octet *M, octet *S);
+
+/** @brief Verify a signature
+ *
+    @param SIG an input signature
+    @param m is the message whose signature is to be verified.
+    @param W an public key
+    @return BLS_OK if verified, otherwise BLS_FAIL
+ */
+int BLS_CORE_VERIFY(octet *SIG, octet *M, octet *W);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/bls256_BLS48286.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/bls256_BLS48286.h
new file mode 100644
index 0000000..832a844
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/bls256_BLS48286.h
@@ -0,0 +1,86 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file bls256.h
+ * @author Mike Scott
+ * @date 28th Novemebr 2018
+ * @brief BLS Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef BLS256_BLS48286_H
+#define BLS256_BLS48286_H
+
+#include "pair8_BLS48286.h"
+
+using namespace core;
+
+namespace BLS48286 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define BGS_BLS48286 MODBYTES_B288_60  /**< BLS Group Size */
+#define BFS_BLS48286 MODBYTES_B288_60  /**< BLS Field Size */
+
+#define BLS_OK           0  /**< Function completed without error */
+#define BLS_FAIL        -1  /**< Point is NOT on the curve */
+
+/* BLS API functions */
+
+/** @brief Initialise BLS
+ *
+    @return BLS_OK if worked, otherwise BLS_FAIL
+ */
+int BLS_INIT();
+
+/** @brief Generate Key Pair
+ *
+    @param IKM contains truly random keying material
+    @param S on output a private key
+    @param W on output a public key = S*G, where G is fixed generator
+    @return BLS_OK
+ */
+int BLS_KEY_PAIR_GENERATE(octet *IKM, octet* S, octet *W);
+
+/** @brief Calculate a signature
+ *
+    @param SIG the ouput signature
+    @param m is the message to be signed
+    @param S an input private key
+    @return BLS_OK
+ */
+int BLS_CORE_SIGN(octet *SIG, octet *M, octet *S);
+
+/** @brief Verify a signature
+ *
+    @param SIG an input signature
+    @param m is the message whose signature is to be verified.
+    @param W an public key
+    @return BLS_OK if verified, otherwise BLS_FAIL
+ */
+int BLS_CORE_VERIFY(octet *SIG, octet *M, octet *W);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/bls256_BLS48556.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/bls256_BLS48556.h
new file mode 100644
index 0000000..3173645
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/bls256_BLS48556.h
@@ -0,0 +1,86 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file bls256.h
+ * @author Mike Scott
+ * @date 28th Novemebr 2018
+ * @brief BLS Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef BLS256_BLS48556_H
+#define BLS256_BLS48556_H
+
+#include "pair8_BLS48556.h"
+
+using namespace core;
+
+namespace BLS48556 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define BGS_BLS48556 MODBYTES_B560_58  /**< BLS Group Size */
+#define BFS_BLS48556 MODBYTES_B560_58  /**< BLS Field Size */
+
+#define BLS_OK           0  /**< Function completed without error */
+#define BLS_FAIL        -1  /**< Point is NOT on the curve */
+
+/* BLS API functions */
+
+/** @brief Initialise BLS
+ *
+    @return BLS_OK if worked, otherwise BLS_FAIL
+ */
+int BLS_INIT();
+
+/** @brief Generate Key Pair
+ *
+    @param IKM contains truly random keying material
+    @param S on output a private key
+    @param W on output a public key = S*G, where G is fixed generator
+    @return BLS_OK
+ */
+int BLS_KEY_PAIR_GENERATE(octet *IKM, octet* S, octet *W);
+
+/** @brief Calculate a signature
+ *
+    @param SIG the ouput signature
+    @param m is the message to be signed
+    @param S an input private key
+    @return BLS_OK
+ */
+int BLS_CORE_SIGN(octet *SIG, octet *M, octet *S);
+
+/** @brief Verify a signature
+ *
+    @param SIG an input signature
+    @param m is the message whose signature is to be verified.
+    @param W an public key
+    @return BLS_OK if verified, otherwise BLS_FAIL
+ */
+int BLS_CORE_VERIFY(octet *SIG, octet *M, octet *W);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/bls256_BLS48581.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/bls256_BLS48581.h
new file mode 100644
index 0000000..c868eae
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/bls256_BLS48581.h
@@ -0,0 +1,86 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file bls256.h
+ * @author Mike Scott
+ * @date 28th Novemebr 2018
+ * @brief BLS Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef BLS256_BLS48581_H
+#define BLS256_BLS48581_H
+
+#include "pair8_BLS48581.h"
+
+using namespace core;
+
+namespace BLS48581 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define BGS_BLS48581 MODBYTES_B584_60  /**< BLS Group Size */
+#define BFS_BLS48581 MODBYTES_B584_60  /**< BLS Field Size */
+
+#define BLS_OK           0  /**< Function completed without error */
+#define BLS_FAIL        -1  /**< Point is NOT on the curve */
+
+/* BLS API functions */
+
+/** @brief Initialise BLS
+ *
+    @return BLS_OK if worked, otherwise BLS_FAIL
+ */
+int BLS_INIT();
+
+/** @brief Generate Key Pair
+ *
+    @param IKM contains truly random keying material
+    @param S on output a private key
+    @param W on output a public key = S*G, where G is fixed generator
+    @return BLS_OK
+ */
+int BLS_KEY_PAIR_GENERATE(octet *IKM, octet* S, octet *W);
+
+/** @brief Calculate a signature
+ *
+    @param SIG the ouput signature
+    @param m is the message to be signed
+    @param S an input private key
+    @return BLS_OK
+ */
+int BLS_CORE_SIGN(octet *SIG, octet *M, octet *S);
+
+/** @brief Verify a signature
+ *
+    @param SIG an input signature
+    @param m is the message whose signature is to be verified.
+    @param W an public key
+    @return BLS_OK if verified, otherwise BLS_FAIL
+ */
+int BLS_CORE_VERIFY(octet *SIG, octet *M, octet *W);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/bls_BLS12381.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/bls_BLS12381.h
new file mode 100644
index 0000000..de31cce
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/bls_BLS12381.h
@@ -0,0 +1,87 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file bls.h
+ * @author Mike Scott
+ * @date 28th Novemebr 2018
+ * @brief BLS Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef BLS_BLS12381_H
+#define BLS_BLS12381_H
+
+#include "pair_BLS12381.h"
+
+using namespace core;
+
+namespace BLS12381 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define BGS_BLS12381 MODBYTES_B384_58  /**< BLS Group Size */
+#define BFS_BLS12381 MODBYTES_B384_58  /**< BLS Field Size */
+
+#define BLS_OK           0  /**< Function completed without error */
+#define BLS_FAIL        -1  /**< Point is NOT on the curve */
+
+/* BLS API functions */
+
+
+/** @brief Initialise BLS
+ *
+    @return BLS_OK if worked, otherwise BLS_FAIL
+ */
+int BLS_INIT();
+
+/** @brief Generate Key Pair
+ *
+    @param IKM contains truly random keying material
+    @param S on output a private key
+    @param W on output a public key = S*G, where G is fixed generator
+    @return BLS_OK
+ */
+int BLS_KEY_PAIR_GENERATE(octet *IKM, octet* S, octet *W);
+
+/** @brief Calculate a signature
+ *
+    @param SIG the ouput signature
+    @param M is the message to be signed
+    @param S an input private key
+    @return BLS_OK
+ */
+int BLS_CORE_SIGN(octet *SIG, octet *M, octet *S);
+
+/** @brief Verify a signature
+ *
+    @param SIG an input signature
+    @param M is the message whose signature is to be verified.
+    @param W an public key
+    @return BLS_OK if verified, otherwise BLS_FAIL
+ */
+int BLS_CORE_VERIFY(octet *SIG, octet *M, octet *W);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/bls_BLS12383.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/bls_BLS12383.h
new file mode 100644
index 0000000..4eda3f3
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/bls_BLS12383.h
@@ -0,0 +1,87 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file bls.h
+ * @author Mike Scott
+ * @date 28th Novemebr 2018
+ * @brief BLS Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef BLS_BLS12383_H
+#define BLS_BLS12383_H
+
+#include "pair_BLS12383.h"
+
+using namespace core;
+
+namespace BLS12383 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define BGS_BLS12383 MODBYTES_B384_58  /**< BLS Group Size */
+#define BFS_BLS12383 MODBYTES_B384_58  /**< BLS Field Size */
+
+#define BLS_OK           0  /**< Function completed without error */
+#define BLS_FAIL        -1  /**< Point is NOT on the curve */
+
+/* BLS API functions */
+
+
+/** @brief Initialise BLS
+ *
+    @return BLS_OK if worked, otherwise BLS_FAIL
+ */
+int BLS_INIT();
+
+/** @brief Generate Key Pair
+ *
+    @param IKM contains truly random keying material
+    @param S on output a private key
+    @param W on output a public key = S*G, where G is fixed generator
+    @return BLS_OK
+ */
+int BLS_KEY_PAIR_GENERATE(octet *IKM, octet* S, octet *W);
+
+/** @brief Calculate a signature
+ *
+    @param SIG the ouput signature
+    @param M is the message to be signed
+    @param S an input private key
+    @return BLS_OK
+ */
+int BLS_CORE_SIGN(octet *SIG, octet *M, octet *S);
+
+/** @brief Verify a signature
+ *
+    @param SIG an input signature
+    @param M is the message whose signature is to be verified.
+    @param W an public key
+    @return BLS_OK if verified, otherwise BLS_FAIL
+ */
+int BLS_CORE_VERIFY(octet *SIG, octet *M, octet *W);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/bls_BLS12443.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/bls_BLS12443.h
new file mode 100644
index 0000000..2d14991
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/bls_BLS12443.h
@@ -0,0 +1,87 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file bls.h
+ * @author Mike Scott
+ * @date 28th Novemebr 2018
+ * @brief BLS Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef BLS_BLS12443_H
+#define BLS_BLS12443_H
+
+#include "pair_BLS12443.h"
+
+using namespace core;
+
+namespace BLS12443 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define BGS_BLS12443 MODBYTES_B448_60  /**< BLS Group Size */
+#define BFS_BLS12443 MODBYTES_B448_60  /**< BLS Field Size */
+
+#define BLS_OK           0  /**< Function completed without error */
+#define BLS_FAIL        -1  /**< Point is NOT on the curve */
+
+/* BLS API functions */
+
+
+/** @brief Initialise BLS
+ *
+    @return BLS_OK if worked, otherwise BLS_FAIL
+ */
+int BLS_INIT();
+
+/** @brief Generate Key Pair
+ *
+    @param IKM contains truly random keying material
+    @param S on output a private key
+    @param W on output a public key = S*G, where G is fixed generator
+    @return BLS_OK
+ */
+int BLS_KEY_PAIR_GENERATE(octet *IKM, octet* S, octet *W);
+
+/** @brief Calculate a signature
+ *
+    @param SIG the ouput signature
+    @param M is the message to be signed
+    @param S an input private key
+    @return BLS_OK
+ */
+int BLS_CORE_SIGN(octet *SIG, octet *M, octet *S);
+
+/** @brief Verify a signature
+ *
+    @param SIG an input signature
+    @param M is the message whose signature is to be verified.
+    @param W an public key
+    @return BLS_OK if verified, otherwise BLS_FAIL
+ */
+int BLS_CORE_VERIFY(octet *SIG, octet *M, octet *W);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/bls_BLS12461.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/bls_BLS12461.h
new file mode 100644
index 0000000..03a7e2c
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/bls_BLS12461.h
@@ -0,0 +1,87 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file bls.h
+ * @author Mike Scott
+ * @date 28th Novemebr 2018
+ * @brief BLS Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef BLS_BLS12461_H
+#define BLS_BLS12461_H
+
+#include "pair_BLS12461.h"
+
+using namespace core;
+
+namespace BLS12461 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define BGS_BLS12461 MODBYTES_B464_60  /**< BLS Group Size */
+#define BFS_BLS12461 MODBYTES_B464_60  /**< BLS Field Size */
+
+#define BLS_OK           0  /**< Function completed without error */
+#define BLS_FAIL        -1  /**< Point is NOT on the curve */
+
+/* BLS API functions */
+
+
+/** @brief Initialise BLS
+ *
+    @return BLS_OK if worked, otherwise BLS_FAIL
+ */
+int BLS_INIT();
+
+/** @brief Generate Key Pair
+ *
+    @param IKM contains truly random keying material
+    @param S on output a private key
+    @param W on output a public key = S*G, where G is fixed generator
+    @return BLS_OK
+ */
+int BLS_KEY_PAIR_GENERATE(octet *IKM, octet* S, octet *W);
+
+/** @brief Calculate a signature
+ *
+    @param SIG the ouput signature
+    @param M is the message to be signed
+    @param S an input private key
+    @return BLS_OK
+ */
+int BLS_CORE_SIGN(octet *SIG, octet *M, octet *S);
+
+/** @brief Verify a signature
+ *
+    @param SIG an input signature
+    @param M is the message whose signature is to be verified.
+    @param W an public key
+    @return BLS_OK if verified, otherwise BLS_FAIL
+ */
+int BLS_CORE_VERIFY(octet *SIG, octet *M, octet *W);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/bls_BN158.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/bls_BN158.h
new file mode 100644
index 0000000..f19142d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/bls_BN158.h
@@ -0,0 +1,87 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file bls.h
+ * @author Mike Scott
+ * @date 28th Novemebr 2018
+ * @brief BLS Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef BLS_BN158_H
+#define BLS_BN158_H
+
+#include "pair_BN158.h"
+
+using namespace core;
+
+namespace BN158 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define BGS_BN158 MODBYTES_B160_56  /**< BLS Group Size */
+#define BFS_BN158 MODBYTES_B160_56  /**< BLS Field Size */
+
+#define BLS_OK           0  /**< Function completed without error */
+#define BLS_FAIL        -1  /**< Point is NOT on the curve */
+
+/* BLS API functions */
+
+
+/** @brief Initialise BLS
+ *
+    @return BLS_OK if worked, otherwise BLS_FAIL
+ */
+int BLS_INIT();
+
+/** @brief Generate Key Pair
+ *
+    @param IKM contains truly random keying material
+    @param S on output a private key
+    @param W on output a public key = S*G, where G is fixed generator
+    @return BLS_OK
+ */
+int BLS_KEY_PAIR_GENERATE(octet *IKM, octet* S, octet *W);
+
+/** @brief Calculate a signature
+ *
+    @param SIG the ouput signature
+    @param M is the message to be signed
+    @param S an input private key
+    @return BLS_OK
+ */
+int BLS_CORE_SIGN(octet *SIG, octet *M, octet *S);
+
+/** @brief Verify a signature
+ *
+    @param SIG an input signature
+    @param M is the message whose signature is to be verified.
+    @param W an public key
+    @return BLS_OK if verified, otherwise BLS_FAIL
+ */
+int BLS_CORE_VERIFY(octet *SIG, octet *M, octet *W);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/bls_BN254.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/bls_BN254.h
new file mode 100644
index 0000000..f331731
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/bls_BN254.h
@@ -0,0 +1,87 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file bls.h
+ * @author Mike Scott
+ * @date 28th Novemebr 2018
+ * @brief BLS Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef BLS_BN254_H
+#define BLS_BN254_H
+
+#include "pair_BN254.h"
+
+using namespace core;
+
+namespace BN254 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define BGS_BN254 MODBYTES_B256_56  /**< BLS Group Size */
+#define BFS_BN254 MODBYTES_B256_56  /**< BLS Field Size */
+
+#define BLS_OK           0  /**< Function completed without error */
+#define BLS_FAIL        -1  /**< Point is NOT on the curve */
+
+/* BLS API functions */
+
+
+/** @brief Initialise BLS
+ *
+    @return BLS_OK if worked, otherwise BLS_FAIL
+ */
+int BLS_INIT();
+
+/** @brief Generate Key Pair
+ *
+    @param IKM contains truly random keying material
+    @param S on output a private key
+    @param W on output a public key = S*G, where G is fixed generator
+    @return BLS_OK
+ */
+int BLS_KEY_PAIR_GENERATE(octet *IKM, octet* S, octet *W);
+
+/** @brief Calculate a signature
+ *
+    @param SIG the ouput signature
+    @param M is the message to be signed
+    @param S an input private key
+    @return BLS_OK
+ */
+int BLS_CORE_SIGN(octet *SIG, octet *M, octet *S);
+
+/** @brief Verify a signature
+ *
+    @param SIG an input signature
+    @param M is the message whose signature is to be verified.
+    @param W an public key
+    @return BLS_OK if verified, otherwise BLS_FAIL
+ */
+int BLS_CORE_VERIFY(octet *SIG, octet *M, octet *W);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/bls_BN254CX.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/bls_BN254CX.h
new file mode 100644
index 0000000..10b3b3d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/bls_BN254CX.h
@@ -0,0 +1,87 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file bls.h
+ * @author Mike Scott
+ * @date 28th Novemebr 2018
+ * @brief BLS Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef BLS_BN254CX_H
+#define BLS_BN254CX_H
+
+#include "pair_BN254CX.h"
+
+using namespace core;
+
+namespace BN254CX {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define BGS_BN254CX MODBYTES_B256_56  /**< BLS Group Size */
+#define BFS_BN254CX MODBYTES_B256_56  /**< BLS Field Size */
+
+#define BLS_OK           0  /**< Function completed without error */
+#define BLS_FAIL        -1  /**< Point is NOT on the curve */
+
+/* BLS API functions */
+
+
+/** @brief Initialise BLS
+ *
+    @return BLS_OK if worked, otherwise BLS_FAIL
+ */
+int BLS_INIT();
+
+/** @brief Generate Key Pair
+ *
+    @param IKM contains truly random keying material
+    @param S on output a private key
+    @param W on output a public key = S*G, where G is fixed generator
+    @return BLS_OK
+ */
+int BLS_KEY_PAIR_GENERATE(octet *IKM, octet* S, octet *W);
+
+/** @brief Calculate a signature
+ *
+    @param SIG the ouput signature
+    @param M is the message to be signed
+    @param S an input private key
+    @return BLS_OK
+ */
+int BLS_CORE_SIGN(octet *SIG, octet *M, octet *S);
+
+/** @brief Verify a signature
+ *
+    @param SIG an input signature
+    @param M is the message whose signature is to be verified.
+    @param W an public key
+    @return BLS_OK if verified, otherwise BLS_FAIL
+ */
+int BLS_CORE_VERIFY(octet *SIG, octet *M, octet *W);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/bls_BN462.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/bls_BN462.h
new file mode 100644
index 0000000..5563582
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/bls_BN462.h
@@ -0,0 +1,87 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file bls.h
+ * @author Mike Scott
+ * @date 28th Novemebr 2018
+ * @brief BLS Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef BLS_BN462_H
+#define BLS_BN462_H
+
+#include "pair_BN462.h"
+
+using namespace core;
+
+namespace BN462 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define BGS_BN462 MODBYTES_B464_60  /**< BLS Group Size */
+#define BFS_BN462 MODBYTES_B464_60  /**< BLS Field Size */
+
+#define BLS_OK           0  /**< Function completed without error */
+#define BLS_FAIL        -1  /**< Point is NOT on the curve */
+
+/* BLS API functions */
+
+
+/** @brief Initialise BLS
+ *
+    @return BLS_OK if worked, otherwise BLS_FAIL
+ */
+int BLS_INIT();
+
+/** @brief Generate Key Pair
+ *
+    @param IKM contains truly random keying material
+    @param S on output a private key
+    @param W on output a public key = S*G, where G is fixed generator
+    @return BLS_OK
+ */
+int BLS_KEY_PAIR_GENERATE(octet *IKM, octet* S, octet *W);
+
+/** @brief Calculate a signature
+ *
+    @param SIG the ouput signature
+    @param M is the message to be signed
+    @param S an input private key
+    @return BLS_OK
+ */
+int BLS_CORE_SIGN(octet *SIG, octet *M, octet *S);
+
+/** @brief Verify a signature
+ *
+    @param SIG an input signature
+    @param M is the message whose signature is to be verified.
+    @param W an public key
+    @return BLS_OK if verified, otherwise BLS_FAIL
+ */
+int BLS_CORE_VERIFY(octet *SIG, octet *M, octet *W);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/bls_FP256BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/bls_FP256BN.h
new file mode 100644
index 0000000..ab661b5
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/bls_FP256BN.h
@@ -0,0 +1,87 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file bls.h
+ * @author Mike Scott
+ * @date 28th Novemebr 2018
+ * @brief BLS Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef BLS_FP256BN_H
+#define BLS_FP256BN_H
+
+#include "pair_FP256BN.h"
+
+using namespace core;
+
+namespace FP256BN {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define BGS_FP256BN MODBYTES_B256_56  /**< BLS Group Size */
+#define BFS_FP256BN MODBYTES_B256_56  /**< BLS Field Size */
+
+#define BLS_OK           0  /**< Function completed without error */
+#define BLS_FAIL        -1  /**< Point is NOT on the curve */
+
+/* BLS API functions */
+
+
+/** @brief Initialise BLS
+ *
+    @return BLS_OK if worked, otherwise BLS_FAIL
+ */
+int BLS_INIT();
+
+/** @brief Generate Key Pair
+ *
+    @param IKM contains truly random keying material
+    @param S on output a private key
+    @param W on output a public key = S*G, where G is fixed generator
+    @return BLS_OK
+ */
+int BLS_KEY_PAIR_GENERATE(octet *IKM, octet* S, octet *W);
+
+/** @brief Calculate a signature
+ *
+    @param SIG the ouput signature
+    @param M is the message to be signed
+    @param S an input private key
+    @return BLS_OK
+ */
+int BLS_CORE_SIGN(octet *SIG, octet *M, octet *S);
+
+/** @brief Verify a signature
+ *
+    @param SIG an input signature
+    @param M is the message whose signature is to be verified.
+    @param W an public key
+    @return BLS_OK if verified, otherwise BLS_FAIL
+ */
+int BLS_CORE_VERIFY(octet *SIG, octet *M, octet *W);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/bls_FP512BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/bls_FP512BN.h
new file mode 100644
index 0000000..1459b24
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/bls_FP512BN.h
@@ -0,0 +1,87 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file bls.h
+ * @author Mike Scott
+ * @date 28th Novemebr 2018
+ * @brief BLS Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef BLS_FP512BN_H
+#define BLS_FP512BN_H
+
+#include "pair_FP512BN.h"
+
+using namespace core;
+
+namespace FP512BN {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define BGS_FP512BN MODBYTES_B512_60  /**< BLS Group Size */
+#define BFS_FP512BN MODBYTES_B512_60  /**< BLS Field Size */
+
+#define BLS_OK           0  /**< Function completed without error */
+#define BLS_FAIL        -1  /**< Point is NOT on the curve */
+
+/* BLS API functions */
+
+
+/** @brief Initialise BLS
+ *
+    @return BLS_OK if worked, otherwise BLS_FAIL
+ */
+int BLS_INIT();
+
+/** @brief Generate Key Pair
+ *
+    @param IKM contains truly random keying material
+    @param S on output a private key
+    @param W on output a public key = S*G, where G is fixed generator
+    @return BLS_OK
+ */
+int BLS_KEY_PAIR_GENERATE(octet *IKM, octet* S, octet *W);
+
+/** @brief Calculate a signature
+ *
+    @param SIG the ouput signature
+    @param M is the message to be signed
+    @param S an input private key
+    @return BLS_OK
+ */
+int BLS_CORE_SIGN(octet *SIG, octet *M, octet *S);
+
+/** @brief Verify a signature
+ *
+    @param SIG an input signature
+    @param M is the message whose signature is to be verified.
+    @param W an public key
+    @return BLS_OK if verified, otherwise BLS_FAIL
+ */
+int BLS_CORE_VERIFY(octet *SIG, octet *M, octet *W);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_big.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_big.h
new file mode 100644
index 0000000..ce262ec
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_big.h
@@ -0,0 +1,31 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_BIG_XXX_H
+#define CONFIG_BIG_XXX_H
+
+#include"core.h"
+
+// BIG stuff
+
+#define MODBYTES_XXX @NB@
+#define BASEBITS_XXX @BASE@
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_big_B160_56.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_big_B160_56.h
new file mode 100644
index 0000000..3c3e9e7
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_big_B160_56.h
@@ -0,0 +1,31 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_BIG_B160_56_H
+#define CONFIG_BIG_B160_56_H
+
+#include"core.h"
+
+// BIG stuff
+
+#define MODBYTES_B160_56 20
+#define BASEBITS_B160_56 56
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_big_B168_60.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_big_B168_60.h
new file mode 100644
index 0000000..5cc2f30
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_big_B168_60.h
@@ -0,0 +1,31 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_BIG_B168_60_H
+#define CONFIG_BIG_B168_60_H
+
+#include"core.h"
+
+// BIG stuff
+
+#define MODBYTES_B168_60 21
+#define BASEBITS_B168_60 60
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_big_B256_56.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_big_B256_56.h
new file mode 100644
index 0000000..64d8b22
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_big_B256_56.h
@@ -0,0 +1,31 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_BIG_B256_56_H
+#define CONFIG_BIG_B256_56_H
+
+#include"core.h"
+
+// BIG stuff
+
+#define MODBYTES_B256_56 32
+#define BASEBITS_B256_56 56
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_big_B288_60.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_big_B288_60.h
new file mode 100644
index 0000000..135663e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_big_B288_60.h
@@ -0,0 +1,31 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_BIG_B288_60_H
+#define CONFIG_BIG_B288_60_H
+
+#include"core.h"
+
+// BIG stuff
+
+#define MODBYTES_B288_60 36
+#define BASEBITS_B288_60 60
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_big_B336_60.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_big_B336_60.h
new file mode 100644
index 0000000..db7c7bd
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_big_B336_60.h
@@ -0,0 +1,31 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_BIG_B336_60_H
+#define CONFIG_BIG_B336_60_H
+
+#include"core.h"
+
+// BIG stuff
+
+#define MODBYTES_B336_60 42
+#define BASEBITS_B336_60 60
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_big_B384_56.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_big_B384_56.h
new file mode 100644
index 0000000..8c707de
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_big_B384_56.h
@@ -0,0 +1,31 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_BIG_B384_56_H
+#define CONFIG_BIG_B384_56_H
+
+#include"core.h"
+
+// BIG stuff
+
+#define MODBYTES_B384_56 48
+#define BASEBITS_B384_56 56
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_big_B384_58.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_big_B384_58.h
new file mode 100644
index 0000000..abc05bb
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_big_B384_58.h
@@ -0,0 +1,31 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_BIG_B384_58_H
+#define CONFIG_BIG_B384_58_H
+
+#include"core.h"
+
+// BIG stuff
+
+#define MODBYTES_B384_58 48
+#define BASEBITS_B384_58 58
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_big_B416_60.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_big_B416_60.h
new file mode 100644
index 0000000..f57fbe9
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_big_B416_60.h
@@ -0,0 +1,31 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_BIG_B416_60_H
+#define CONFIG_BIG_B416_60_H
+
+#include"core.h"
+
+// BIG stuff
+
+#define MODBYTES_B416_60 52
+#define BASEBITS_B416_60 60
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_big_B448_58.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_big_B448_58.h
new file mode 100644
index 0000000..bd3d2fa
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_big_B448_58.h
@@ -0,0 +1,31 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_BIG_B448_58_H
+#define CONFIG_BIG_B448_58_H
+
+#include"core.h"
+
+// BIG stuff
+
+#define MODBYTES_B448_58 56
+#define BASEBITS_B448_58 58
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_big_B448_60.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_big_B448_60.h
new file mode 100644
index 0000000..622ae94
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_big_B448_60.h
@@ -0,0 +1,31 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_BIG_B448_60_H
+#define CONFIG_BIG_B448_60_H
+
+#include"core.h"
+
+// BIG stuff
+
+#define MODBYTES_B448_60 56
+#define BASEBITS_B448_60 60
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_big_B464_60.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_big_B464_60.h
new file mode 100644
index 0000000..558d678
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_big_B464_60.h
@@ -0,0 +1,31 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_BIG_B464_60_H
+#define CONFIG_BIG_B464_60_H
+
+#include"core.h"
+
+// BIG stuff
+
+#define MODBYTES_B464_60 58
+#define BASEBITS_B464_60 60
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_big_B480_56.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_big_B480_56.h
new file mode 100644
index 0000000..c7e730c
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_big_B480_56.h
@@ -0,0 +1,31 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_BIG_B480_56_H
+#define CONFIG_BIG_B480_56_H
+
+#include"core.h"
+
+// BIG stuff
+
+#define MODBYTES_B480_56 60
+#define BASEBITS_B480_56 56
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_big_B512_60.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_big_B512_60.h
new file mode 100644
index 0000000..180f4ab
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_big_B512_60.h
@@ -0,0 +1,31 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_BIG_B512_60_H
+#define CONFIG_BIG_B512_60_H
+
+#include"core.h"
+
+// BIG stuff
+
+#define MODBYTES_B512_60 64
+#define BASEBITS_B512_60 60
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_big_B528_60.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_big_B528_60.h
new file mode 100644
index 0000000..334db43
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_big_B528_60.h
@@ -0,0 +1,31 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_BIG_B528_60_H
+#define CONFIG_BIG_B528_60_H
+
+#include"core.h"
+
+// BIG stuff
+
+#define MODBYTES_B528_60 66
+#define BASEBITS_B528_60 60
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_big_B560_58.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_big_B560_58.h
new file mode 100644
index 0000000..4157e14
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_big_B560_58.h
@@ -0,0 +1,31 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_BIG_B560_58_H
+#define CONFIG_BIG_B560_58_H
+
+#include"core.h"
+
+// BIG stuff
+
+#define MODBYTES_B560_58 70
+#define BASEBITS_B560_58 58
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_big_B584_60.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_big_B584_60.h
new file mode 100644
index 0000000..5e611b3
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_big_B584_60.h
@@ -0,0 +1,31 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_BIG_B584_60_H
+#define CONFIG_BIG_B584_60_H
+
+#include"core.h"
+
+// BIG stuff
+
+#define MODBYTES_B584_60 73
+#define BASEBITS_B584_60 60
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve.h
new file mode 100644
index 0000000..d7858d8
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_ZZZ_H
+#define CONFIG_CURVE_ZZZ_H
+
+#include"core.h"
+#include"config_field_YYY.h"
+
+// ECP stuff
+
+#define CURVETYPE_ZZZ @CT@
+#define CURVE_A_ZZZ @CA@
+#define PAIRING_FRIENDLY_ZZZ @PF@
+#define CURVE_SECURITY_ZZZ @CS@
+#define HTC_ISO_ZZZ @HC@
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_ZZZ
+
+#if PAIRING_FRIENDLY_ZZZ != NOT_PF
+
+#define HTC_ISO_G2_ZZZ @HC2@
+
+#define USE_GLV_ZZZ   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_ZZZ /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_ZZZ /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_ZZZ @ST@
+#define SIGN_OF_X_ZZZ @SX@
+
+#define ATE_BITS_ZZZ @AB@
+#define G2_TABLE_ZZZ @G2@
+
+#endif
+
+
+#if CURVE_SECURITY_ZZZ == 128
+#define AESKEY_ZZZ 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_ZZZ SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_ZZZ == 192
+#define AESKEY_ZZZ 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_ZZZ SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_ZZZ == 256
+#define AESKEY_ZZZ 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_ZZZ SHA512  /**< Hash type */
+#endif
+
+
+namespace ZZZ_BIG = XXX;
+namespace ZZZ_FP = YYY;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_ANSSI.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_ANSSI.h
new file mode 100644
index 0000000..5fd0554
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_ANSSI.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_ANSSI_H
+#define CONFIG_CURVE_ANSSI_H
+
+#include"core.h"
+#include"config_field_ANSSI.h"
+
+// ECP stuff
+
+#define CURVETYPE_ANSSI WEIERSTRASS
+#define CURVE_A_ANSSI -3
+#define PAIRING_FRIENDLY_ANSSI NOT_PF
+#define CURVE_SECURITY_ANSSI 128
+#define HTC_ISO_ANSSI 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_ANSSI
+
+#if PAIRING_FRIENDLY_ANSSI != NOT_PF
+
+#define HTC_ISO_G2_ANSSI 0
+
+#define USE_GLV_ANSSI   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_ANSSI /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_ANSSI /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_ANSSI 
+#define SIGN_OF_X_ANSSI 
+
+#define ATE_BITS_ANSSI 
+#define G2_TABLE_ANSSI 
+
+#endif
+
+
+#if CURVE_SECURITY_ANSSI == 128
+#define AESKEY_ANSSI 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_ANSSI SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_ANSSI == 192
+#define AESKEY_ANSSI 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_ANSSI SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_ANSSI == 256
+#define AESKEY_ANSSI 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_ANSSI SHA512  /**< Hash type */
+#endif
+
+
+namespace ANSSI_BIG = B256_56;
+namespace ANSSI_FP = ANSSI;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_BLS12381.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_BLS12381.h
new file mode 100644
index 0000000..16c7f52
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_BLS12381.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_BLS12381_H
+#define CONFIG_CURVE_BLS12381_H
+
+#include"core.h"
+#include"config_field_BLS12381.h"
+
+// ECP stuff
+
+#define CURVETYPE_BLS12381 WEIERSTRASS
+#define CURVE_A_BLS12381 0
+#define PAIRING_FRIENDLY_BLS12381 BLS12_CURVE
+#define CURVE_SECURITY_BLS12381 128
+#define HTC_ISO_BLS12381 11
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_BLS12381
+
+#if PAIRING_FRIENDLY_BLS12381 != NOT_PF
+
+#define HTC_ISO_G2_BLS12381 3
+
+#define USE_GLV_BLS12381   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_BLS12381 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_BLS12381 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_BLS12381 M_TYPE
+#define SIGN_OF_X_BLS12381 NEGATIVEX
+
+#define ATE_BITS_BLS12381 65
+#define G2_TABLE_BLS12381 69
+
+#endif
+
+
+#if CURVE_SECURITY_BLS12381 == 128
+#define AESKEY_BLS12381 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_BLS12381 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BLS12381 == 192
+#define AESKEY_BLS12381 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_BLS12381 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BLS12381 == 256
+#define AESKEY_BLS12381 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_BLS12381 SHA512  /**< Hash type */
+#endif
+
+
+namespace BLS12381_BIG = B384_58;
+namespace BLS12381_FP = BLS12381;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_BLS12383.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_BLS12383.h
new file mode 100644
index 0000000..961080b
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_BLS12383.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_BLS12383_H
+#define CONFIG_CURVE_BLS12383_H
+
+#include"core.h"
+#include"config_field_BLS12383.h"
+
+// ECP stuff
+
+#define CURVETYPE_BLS12383 WEIERSTRASS
+#define CURVE_A_BLS12383 0
+#define PAIRING_FRIENDLY_BLS12383 BLS12_CURVE
+#define CURVE_SECURITY_BLS12383 128
+#define HTC_ISO_BLS12383 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_BLS12383
+
+#if PAIRING_FRIENDLY_BLS12383 != NOT_PF
+
+#define HTC_ISO_G2_BLS12383 0
+
+#define USE_GLV_BLS12383   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_BLS12383 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_BLS12383 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_BLS12383 M_TYPE
+#define SIGN_OF_X_BLS12383 POSITIVEX
+
+#define ATE_BITS_BLS12383 65
+#define G2_TABLE_BLS12383 68
+
+#endif
+
+
+#if CURVE_SECURITY_BLS12383 == 128
+#define AESKEY_BLS12383 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_BLS12383 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BLS12383 == 192
+#define AESKEY_BLS12383 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_BLS12383 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BLS12383 == 256
+#define AESKEY_BLS12383 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_BLS12383 SHA512  /**< Hash type */
+#endif
+
+
+namespace BLS12383_BIG = B384_58;
+namespace BLS12383_FP = BLS12383;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_BLS12443.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_BLS12443.h
new file mode 100644
index 0000000..f69036f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_BLS12443.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_BLS12443_H
+#define CONFIG_CURVE_BLS12443_H
+
+#include"core.h"
+#include"config_field_BLS12443.h"
+
+// ECP stuff
+
+#define CURVETYPE_BLS12443 WEIERSTRASS
+#define CURVE_A_BLS12443 0
+#define PAIRING_FRIENDLY_BLS12443 BLS12_CURVE
+#define CURVE_SECURITY_BLS12443 128
+#define HTC_ISO_BLS12443 11
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_BLS12443
+
+#if PAIRING_FRIENDLY_BLS12443 != NOT_PF
+
+#define HTC_ISO_G2_BLS12443 3
+
+#define USE_GLV_BLS12443   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_BLS12443 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_BLS12443 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_BLS12443 M_TYPE
+#define SIGN_OF_X_BLS12443 POSITIVEX
+
+#define ATE_BITS_BLS12443 75
+#define G2_TABLE_BLS12443 78
+
+#endif
+
+
+#if CURVE_SECURITY_BLS12443 == 128
+#define AESKEY_BLS12443 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_BLS12443 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BLS12443 == 192
+#define AESKEY_BLS12443 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_BLS12443 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BLS12443 == 256
+#define AESKEY_BLS12443 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_BLS12443 SHA512  /**< Hash type */
+#endif
+
+
+namespace BLS12443_BIG = B448_60;
+namespace BLS12443_FP = BLS12443;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_BLS12461.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_BLS12461.h
new file mode 100644
index 0000000..d98a7c6
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_BLS12461.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_BLS12461_H
+#define CONFIG_CURVE_BLS12461_H
+
+#include"core.h"
+#include"config_field_BLS12461.h"
+
+// ECP stuff
+
+#define CURVETYPE_BLS12461 WEIERSTRASS
+#define CURVE_A_BLS12461 0
+#define PAIRING_FRIENDLY_BLS12461 BLS12_CURVE
+#define CURVE_SECURITY_BLS12461 128
+#define HTC_ISO_BLS12461 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_BLS12461
+
+#if PAIRING_FRIENDLY_BLS12461 != NOT_PF
+
+#define HTC_ISO_G2_BLS12461 0
+
+#define USE_GLV_BLS12461   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_BLS12461 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_BLS12461 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_BLS12461 M_TYPE
+#define SIGN_OF_X_BLS12461 NEGATIVEX
+
+#define ATE_BITS_BLS12461 78
+#define G2_TABLE_BLS12461 79
+
+#endif
+
+
+#if CURVE_SECURITY_BLS12461 == 128
+#define AESKEY_BLS12461 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_BLS12461 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BLS12461 == 192
+#define AESKEY_BLS12461 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_BLS12461 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BLS12461 == 256
+#define AESKEY_BLS12461 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_BLS12461 SHA512  /**< Hash type */
+#endif
+
+
+namespace BLS12461_BIG = B464_60;
+namespace BLS12461_FP = BLS12461;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_BLS24479.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_BLS24479.h
new file mode 100644
index 0000000..15194b7
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_BLS24479.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_BLS24479_H
+#define CONFIG_CURVE_BLS24479_H
+
+#include"core.h"
+#include"config_field_BLS24479.h"
+
+// ECP stuff
+
+#define CURVETYPE_BLS24479 WEIERSTRASS
+#define CURVE_A_BLS24479 0
+#define PAIRING_FRIENDLY_BLS24479 BLS24_CURVE
+#define CURVE_SECURITY_BLS24479 192
+#define HTC_ISO_BLS24479 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_BLS24479
+
+#if PAIRING_FRIENDLY_BLS24479 != NOT_PF
+
+#define HTC_ISO_G2_BLS24479 0
+
+#define USE_GLV_BLS24479   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_BLS24479 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_BLS24479 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_BLS24479 M_TYPE
+#define SIGN_OF_X_BLS24479 POSITIVEX
+
+#define ATE_BITS_BLS24479 49
+#define G2_TABLE_BLS24479 52
+
+#endif
+
+
+#if CURVE_SECURITY_BLS24479 == 128
+#define AESKEY_BLS24479 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_BLS24479 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BLS24479 == 192
+#define AESKEY_BLS24479 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_BLS24479 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BLS24479 == 256
+#define AESKEY_BLS24479 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_BLS24479 SHA512  /**< Hash type */
+#endif
+
+
+namespace BLS24479_BIG = B480_56;
+namespace BLS24479_FP = BLS24479;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_BLS48286.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_BLS48286.h
new file mode 100644
index 0000000..90bbad7
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_BLS48286.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_BLS48286_H
+#define CONFIG_CURVE_BLS48286_H
+
+#include"core.h"
+#include"config_field_BLS48286.h"
+
+// ECP stuff
+
+#define CURVETYPE_BLS48286 WEIERSTRASS
+#define CURVE_A_BLS48286 0
+#define PAIRING_FRIENDLY_BLS48286 BLS48_CURVE
+#define CURVE_SECURITY_BLS48286 128
+#define HTC_ISO_BLS48286 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_BLS48286
+
+#if PAIRING_FRIENDLY_BLS48286 != NOT_PF
+
+#define HTC_ISO_G2_BLS48286 0
+
+#define USE_GLV_BLS48286   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_BLS48286 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_BLS48286 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_BLS48286 M_TYPE
+#define SIGN_OF_X_BLS48286 POSITIVEX
+
+#define ATE_BITS_BLS48286 17
+#define G2_TABLE_BLS48286 20
+
+#endif
+
+
+#if CURVE_SECURITY_BLS48286 == 128
+#define AESKEY_BLS48286 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_BLS48286 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BLS48286 == 192
+#define AESKEY_BLS48286 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_BLS48286 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BLS48286 == 256
+#define AESKEY_BLS48286 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_BLS48286 SHA512  /**< Hash type */
+#endif
+
+
+namespace BLS48286_BIG = B288_60;
+namespace BLS48286_FP = BLS48286;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_BLS48556.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_BLS48556.h
new file mode 100644
index 0000000..91e026b
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_BLS48556.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_BLS48556_H
+#define CONFIG_CURVE_BLS48556_H
+
+#include"core.h"
+#include"config_field_BLS48556.h"
+
+// ECP stuff
+
+#define CURVETYPE_BLS48556 WEIERSTRASS
+#define CURVE_A_BLS48556 0
+#define PAIRING_FRIENDLY_BLS48556 BLS48_CURVE
+#define CURVE_SECURITY_BLS48556 256
+#define HTC_ISO_BLS48556 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_BLS48556
+
+#if PAIRING_FRIENDLY_BLS48556 != NOT_PF
+
+#define HTC_ISO_G2_BLS48556 0
+
+#define USE_GLV_BLS48556   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_BLS48556 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_BLS48556 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_BLS48556 M_TYPE
+#define SIGN_OF_X_BLS48556 POSITIVEX
+
+#define ATE_BITS_BLS48556 32
+#define G2_TABLE_BLS48556 35
+
+#endif
+
+
+#if CURVE_SECURITY_BLS48556 == 128
+#define AESKEY_BLS48556 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_BLS48556 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BLS48556 == 192
+#define AESKEY_BLS48556 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_BLS48556 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BLS48556 == 256
+#define AESKEY_BLS48556 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_BLS48556 SHA512  /**< Hash type */
+#endif
+
+
+namespace BLS48556_BIG = B560_58;
+namespace BLS48556_FP = BLS48556;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_BLS48581.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_BLS48581.h
new file mode 100644
index 0000000..e74b07b
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_BLS48581.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_BLS48581_H
+#define CONFIG_CURVE_BLS48581_H
+
+#include"core.h"
+#include"config_field_BLS48581.h"
+
+// ECP stuff
+
+#define CURVETYPE_BLS48581 WEIERSTRASS
+#define CURVE_A_BLS48581 0
+#define PAIRING_FRIENDLY_BLS48581 BLS48_CURVE
+#define CURVE_SECURITY_BLS48581 256
+#define HTC_ISO_BLS48581 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_BLS48581
+
+#if PAIRING_FRIENDLY_BLS48581 != NOT_PF
+
+#define HTC_ISO_G2_BLS48581 0
+
+#define USE_GLV_BLS48581   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_BLS48581 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_BLS48581 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_BLS48581 D_TYPE
+#define SIGN_OF_X_BLS48581 NEGATIVEX
+
+#define ATE_BITS_BLS48581 33
+#define G2_TABLE_BLS48581 36
+
+#endif
+
+
+#if CURVE_SECURITY_BLS48581 == 128
+#define AESKEY_BLS48581 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_BLS48581 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BLS48581 == 192
+#define AESKEY_BLS48581 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_BLS48581 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BLS48581 == 256
+#define AESKEY_BLS48581 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_BLS48581 SHA512  /**< Hash type */
+#endif
+
+
+namespace BLS48581_BIG = B584_60;
+namespace BLS48581_FP = BLS48581;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_BN158.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_BN158.h
new file mode 100644
index 0000000..5a689fe
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_BN158.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_BN158_H
+#define CONFIG_CURVE_BN158_H
+
+#include"core.h"
+#include"config_field_BN158.h"
+
+// ECP stuff
+
+#define CURVETYPE_BN158 WEIERSTRASS
+#define CURVE_A_BN158 0
+#define PAIRING_FRIENDLY_BN158 BN_CURVE
+#define CURVE_SECURITY_BN158 128
+#define HTC_ISO_BN158 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_BN158
+
+#if PAIRING_FRIENDLY_BN158 != NOT_PF
+
+#define HTC_ISO_G2_BN158 0
+
+#define USE_GLV_BN158   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_BN158 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_BN158 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_BN158 M_TYPE
+#define SIGN_OF_X_BN158 NEGATIVEX
+
+#define ATE_BITS_BN158 42
+#define G2_TABLE_BN158 49
+
+#endif
+
+
+#if CURVE_SECURITY_BN158 == 128
+#define AESKEY_BN158 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_BN158 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BN158 == 192
+#define AESKEY_BN158 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_BN158 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BN158 == 256
+#define AESKEY_BN158 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_BN158 SHA512  /**< Hash type */
+#endif
+
+
+namespace BN158_BIG = B160_56;
+namespace BN158_FP = BN158;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_BN254.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_BN254.h
new file mode 100644
index 0000000..0432c16
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_BN254.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_BN254_H
+#define CONFIG_CURVE_BN254_H
+
+#include"core.h"
+#include"config_field_BN254.h"
+
+// ECP stuff
+
+#define CURVETYPE_BN254 WEIERSTRASS
+#define CURVE_A_BN254 0
+#define PAIRING_FRIENDLY_BN254 BN_CURVE
+#define CURVE_SECURITY_BN254 128
+#define HTC_ISO_BN254 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_BN254
+
+#if PAIRING_FRIENDLY_BN254 != NOT_PF
+
+#define HTC_ISO_G2_BN254 0
+
+#define USE_GLV_BN254   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_BN254 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_BN254 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_BN254 D_TYPE
+#define SIGN_OF_X_BN254 NEGATIVEX
+
+#define ATE_BITS_BN254 66
+#define G2_TABLE_BN254 71
+
+#endif
+
+
+#if CURVE_SECURITY_BN254 == 128
+#define AESKEY_BN254 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_BN254 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BN254 == 192
+#define AESKEY_BN254 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_BN254 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BN254 == 256
+#define AESKEY_BN254 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_BN254 SHA512  /**< Hash type */
+#endif
+
+
+namespace BN254_BIG = B256_56;
+namespace BN254_FP = BN254;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_BN254CX.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_BN254CX.h
new file mode 100644
index 0000000..af24e20
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_BN254CX.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_BN254CX_H
+#define CONFIG_CURVE_BN254CX_H
+
+#include"core.h"
+#include"config_field_BN254CX.h"
+
+// ECP stuff
+
+#define CURVETYPE_BN254CX WEIERSTRASS
+#define CURVE_A_BN254CX 0
+#define PAIRING_FRIENDLY_BN254CX BN_CURVE
+#define CURVE_SECURITY_BN254CX 128
+#define HTC_ISO_BN254CX 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_BN254CX
+
+#if PAIRING_FRIENDLY_BN254CX != NOT_PF
+
+#define HTC_ISO_G2_BN254CX 0
+
+#define USE_GLV_BN254CX   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_BN254CX /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_BN254CX /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_BN254CX D_TYPE
+#define SIGN_OF_X_BN254CX NEGATIVEX
+
+#define ATE_BITS_BN254CX 66
+#define G2_TABLE_BN254CX 76
+
+#endif
+
+
+#if CURVE_SECURITY_BN254CX == 128
+#define AESKEY_BN254CX 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_BN254CX SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BN254CX == 192
+#define AESKEY_BN254CX 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_BN254CX SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BN254CX == 256
+#define AESKEY_BN254CX 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_BN254CX SHA512  /**< Hash type */
+#endif
+
+
+namespace BN254CX_BIG = B256_56;
+namespace BN254CX_FP = BN254CX;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_BN462.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_BN462.h
new file mode 100644
index 0000000..db222d6
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_BN462.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_BN462_H
+#define CONFIG_CURVE_BN462_H
+
+#include"core.h"
+#include"config_field_BN462.h"
+
+// ECP stuff
+
+#define CURVETYPE_BN462 WEIERSTRASS
+#define CURVE_A_BN462 0
+#define PAIRING_FRIENDLY_BN462 BN_CURVE
+#define CURVE_SECURITY_BN462 128
+#define HTC_ISO_BN462 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_BN462
+
+#if PAIRING_FRIENDLY_BN462 != NOT_PF
+
+#define HTC_ISO_G2_BN462 0
+
+#define USE_GLV_BN462   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_BN462 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_BN462 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_BN462 D_TYPE
+#define SIGN_OF_X_BN462 POSITIVEX
+
+#define ATE_BITS_BN462 118
+#define G2_TABLE_BN462 125
+
+#endif
+
+
+#if CURVE_SECURITY_BN462 == 128
+#define AESKEY_BN462 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_BN462 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BN462 == 192
+#define AESKEY_BN462 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_BN462 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BN462 == 256
+#define AESKEY_BN462 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_BN462 SHA512  /**< Hash type */
+#endif
+
+
+namespace BN462_BIG = B464_60;
+namespace BN462_FP = BN462;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_BRAINPOOL.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_BRAINPOOL.h
new file mode 100644
index 0000000..bb29fb8
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_BRAINPOOL.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_BRAINPOOL_H
+#define CONFIG_CURVE_BRAINPOOL_H
+
+#include"core.h"
+#include"config_field_BRAINPOOL.h"
+
+// ECP stuff
+
+#define CURVETYPE_BRAINPOOL WEIERSTRASS
+#define CURVE_A_BRAINPOOL -3
+#define PAIRING_FRIENDLY_BRAINPOOL NOT_PF
+#define CURVE_SECURITY_BRAINPOOL 128
+#define HTC_ISO_BRAINPOOL 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_BRAINPOOL
+
+#if PAIRING_FRIENDLY_BRAINPOOL != NOT_PF
+
+#define HTC_ISO_G2_BRAINPOOL 0
+
+#define USE_GLV_BRAINPOOL   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_BRAINPOOL /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_BRAINPOOL /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_BRAINPOOL 
+#define SIGN_OF_X_BRAINPOOL 
+
+#define ATE_BITS_BRAINPOOL 
+#define G2_TABLE_BRAINPOOL 
+
+#endif
+
+
+#if CURVE_SECURITY_BRAINPOOL == 128
+#define AESKEY_BRAINPOOL 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_BRAINPOOL SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BRAINPOOL == 192
+#define AESKEY_BRAINPOOL 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_BRAINPOOL SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BRAINPOOL == 256
+#define AESKEY_BRAINPOOL 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_BRAINPOOL SHA512  /**< Hash type */
+#endif
+
+
+namespace BRAINPOOL_BIG = B256_56;
+namespace BRAINPOOL_FP = BRAINPOOL;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_C1174.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_C1174.h
new file mode 100644
index 0000000..14eb019
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_C1174.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_C1174_H
+#define CONFIG_CURVE_C1174_H
+
+#include"core.h"
+#include"config_field_C1174.h"
+
+// ECP stuff
+
+#define CURVETYPE_C1174 EDWARDS
+#define CURVE_A_C1174 1
+#define PAIRING_FRIENDLY_C1174 NOT_PF
+#define CURVE_SECURITY_C1174 128
+#define HTC_ISO_C1174 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_C1174
+
+#if PAIRING_FRIENDLY_C1174 != NOT_PF
+
+#define HTC_ISO_G2_C1174 0
+
+#define USE_GLV_C1174   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_C1174 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_C1174 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_C1174 
+#define SIGN_OF_X_C1174 
+
+#define ATE_BITS_C1174 
+#define G2_TABLE_C1174 
+
+#endif
+
+
+#if CURVE_SECURITY_C1174 == 128
+#define AESKEY_C1174 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_C1174 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_C1174 == 192
+#define AESKEY_C1174 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_C1174 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_C1174 == 256
+#define AESKEY_C1174 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_C1174 SHA512  /**< Hash type */
+#endif
+
+
+namespace C1174_BIG = B256_56;
+namespace C1174_FP = C1174;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_C13318.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_C13318.h
new file mode 100644
index 0000000..2107469
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_C13318.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_C13318_H
+#define CONFIG_CURVE_C13318_H
+
+#include"core.h"
+#include"config_field_F25519.h"
+
+// ECP stuff
+
+#define CURVETYPE_C13318 WEIERSTRASS
+#define CURVE_A_C13318 -3
+#define PAIRING_FRIENDLY_C13318 NOT_PF
+#define CURVE_SECURITY_C13318 128
+#define HTC_ISO_C13318 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_C13318
+
+#if PAIRING_FRIENDLY_C13318 != NOT_PF
+
+#define HTC_ISO_G2_C13318 0
+
+#define USE_GLV_C13318   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_C13318 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_C13318 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_C13318 
+#define SIGN_OF_X_C13318 
+
+#define ATE_BITS_C13318 
+#define G2_TABLE_C13318 
+
+#endif
+
+
+#if CURVE_SECURITY_C13318 == 128
+#define AESKEY_C13318 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_C13318 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_C13318 == 192
+#define AESKEY_C13318 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_C13318 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_C13318 == 256
+#define AESKEY_C13318 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_C13318 SHA512  /**< Hash type */
+#endif
+
+
+namespace C13318_BIG = B256_56;
+namespace C13318_FP = F25519;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_C1665.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_C1665.h
new file mode 100644
index 0000000..256fa7f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_C1665.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_C1665_H
+#define CONFIG_CURVE_C1665_H
+
+#include"core.h"
+#include"config_field_C1665.h"
+
+// ECP stuff
+
+#define CURVETYPE_C1665 EDWARDS
+#define CURVE_A_C1665 1
+#define PAIRING_FRIENDLY_C1665 NOT_PF
+#define CURVE_SECURITY_C1665 128
+#define HTC_ISO_C1665 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_C1665
+
+#if PAIRING_FRIENDLY_C1665 != NOT_PF
+
+#define HTC_ISO_G2_C1665 0
+
+#define USE_GLV_C1665   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_C1665 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_C1665 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_C1665 
+#define SIGN_OF_X_C1665 
+
+#define ATE_BITS_C1665 
+#define G2_TABLE_C1665 
+
+#endif
+
+
+#if CURVE_SECURITY_C1665 == 128
+#define AESKEY_C1665 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_C1665 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_C1665 == 192
+#define AESKEY_C1665 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_C1665 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_C1665 == 256
+#define AESKEY_C1665 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_C1665 SHA512  /**< Hash type */
+#endif
+
+
+namespace C1665_BIG = B168_60;
+namespace C1665_FP = C1665;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_C25519.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_C25519.h
new file mode 100644
index 0000000..21b6ce6
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_C25519.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_C25519_H
+#define CONFIG_CURVE_C25519_H
+
+#include"core.h"
+#include"config_field_F25519.h"
+
+// ECP stuff
+
+#define CURVETYPE_C25519 MONTGOMERY
+#define CURVE_A_C25519 486662
+#define PAIRING_FRIENDLY_C25519 NOT_PF
+#define CURVE_SECURITY_C25519 128
+#define HTC_ISO_C25519 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_C25519
+
+#if PAIRING_FRIENDLY_C25519 != NOT_PF
+
+#define HTC_ISO_G2_C25519 0
+
+#define USE_GLV_C25519   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_C25519 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_C25519 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_C25519 
+#define SIGN_OF_X_C25519 
+
+#define ATE_BITS_C25519 
+#define G2_TABLE_C25519 
+
+#endif
+
+
+#if CURVE_SECURITY_C25519 == 128
+#define AESKEY_C25519 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_C25519 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_C25519 == 192
+#define AESKEY_C25519 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_C25519 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_C25519 == 256
+#define AESKEY_C25519 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_C25519 SHA512  /**< Hash type */
+#endif
+
+
+namespace C25519_BIG = B256_56;
+namespace C25519_FP = F25519;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_C41417.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_C41417.h
new file mode 100644
index 0000000..e3ee32c
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_C41417.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_C41417_H
+#define CONFIG_CURVE_C41417_H
+
+#include"core.h"
+#include"config_field_C41417.h"
+
+// ECP stuff
+
+#define CURVETYPE_C41417 EDWARDS
+#define CURVE_A_C41417 1
+#define PAIRING_FRIENDLY_C41417 NOT_PF
+#define CURVE_SECURITY_C41417 256
+#define HTC_ISO_C41417 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_C41417
+
+#if PAIRING_FRIENDLY_C41417 != NOT_PF
+
+#define HTC_ISO_G2_C41417 0
+
+#define USE_GLV_C41417   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_C41417 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_C41417 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_C41417 
+#define SIGN_OF_X_C41417 
+
+#define ATE_BITS_C41417 
+#define G2_TABLE_C41417 
+
+#endif
+
+
+#if CURVE_SECURITY_C41417 == 128
+#define AESKEY_C41417 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_C41417 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_C41417 == 192
+#define AESKEY_C41417 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_C41417 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_C41417 == 256
+#define AESKEY_C41417 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_C41417 SHA512  /**< Hash type */
+#endif
+
+
+namespace C41417_BIG = B416_60;
+namespace C41417_FP = C41417;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_Ed25519.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_Ed25519.h
new file mode 100644
index 0000000..d619828
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_Ed25519.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_Ed25519_H
+#define CONFIG_CURVE_Ed25519_H
+
+#include"core.h"
+#include"config_field_F25519.h"
+
+// ECP stuff
+
+#define CURVETYPE_Ed25519 EDWARDS
+#define CURVE_A_Ed25519 -1
+#define PAIRING_FRIENDLY_Ed25519 NOT_PF
+#define CURVE_SECURITY_Ed25519 128
+#define HTC_ISO_Ed25519 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_Ed25519
+
+#if PAIRING_FRIENDLY_Ed25519 != NOT_PF
+
+#define HTC_ISO_G2_Ed25519 0
+
+#define USE_GLV_Ed25519   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_Ed25519 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_Ed25519 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_Ed25519 
+#define SIGN_OF_X_Ed25519 
+
+#define ATE_BITS_Ed25519 
+#define G2_TABLE_Ed25519 
+
+#endif
+
+
+#if CURVE_SECURITY_Ed25519 == 128
+#define AESKEY_Ed25519 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_Ed25519 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_Ed25519 == 192
+#define AESKEY_Ed25519 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_Ed25519 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_Ed25519 == 256
+#define AESKEY_Ed25519 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_Ed25519 SHA512  /**< Hash type */
+#endif
+
+
+namespace Ed25519_BIG = B256_56;
+namespace Ed25519_FP = F25519;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_Ed448.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_Ed448.h
new file mode 100644
index 0000000..ae385ed
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_Ed448.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_Ed448_H
+#define CONFIG_CURVE_Ed448_H
+
+#include"core.h"
+#include"config_field_F448.h"
+
+// ECP stuff
+
+#define CURVETYPE_Ed448 EDWARDS
+#define CURVE_A_Ed448 1
+#define PAIRING_FRIENDLY_Ed448 NOT_PF
+#define CURVE_SECURITY_Ed448 256
+#define HTC_ISO_Ed448 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_Ed448
+
+#if PAIRING_FRIENDLY_Ed448 != NOT_PF
+
+#define HTC_ISO_G2_Ed448 0
+
+#define USE_GLV_Ed448   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_Ed448 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_Ed448 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_Ed448 
+#define SIGN_OF_X_Ed448 
+
+#define ATE_BITS_Ed448 
+#define G2_TABLE_Ed448 
+
+#endif
+
+
+#if CURVE_SECURITY_Ed448 == 128
+#define AESKEY_Ed448 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_Ed448 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_Ed448 == 192
+#define AESKEY_Ed448 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_Ed448 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_Ed448 == 256
+#define AESKEY_Ed448 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_Ed448 SHA512  /**< Hash type */
+#endif
+
+
+namespace Ed448_BIG = B448_58;
+namespace Ed448_FP = F448;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_FP256BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_FP256BN.h
new file mode 100644
index 0000000..f0abef8
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_FP256BN.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_FP256BN_H
+#define CONFIG_CURVE_FP256BN_H
+
+#include"core.h"
+#include"config_field_FP256BN.h"
+
+// ECP stuff
+
+#define CURVETYPE_FP256BN WEIERSTRASS
+#define CURVE_A_FP256BN 0
+#define PAIRING_FRIENDLY_FP256BN BN_CURVE
+#define CURVE_SECURITY_FP256BN 128
+#define HTC_ISO_FP256BN 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_FP256BN
+
+#if PAIRING_FRIENDLY_FP256BN != NOT_PF
+
+#define HTC_ISO_G2_FP256BN 0
+
+#define USE_GLV_FP256BN   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_FP256BN /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_FP256BN /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_FP256BN M_TYPE
+#define SIGN_OF_X_FP256BN NEGATIVEX
+
+#define ATE_BITS_FP256BN 66
+#define G2_TABLE_FP256BN 83
+
+#endif
+
+
+#if CURVE_SECURITY_FP256BN == 128
+#define AESKEY_FP256BN 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_FP256BN SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_FP256BN == 192
+#define AESKEY_FP256BN 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_FP256BN SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_FP256BN == 256
+#define AESKEY_FP256BN 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_FP256BN SHA512  /**< Hash type */
+#endif
+
+
+namespace FP256BN_BIG = B256_56;
+namespace FP256BN_FP = FP256BN;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_FP512BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_FP512BN.h
new file mode 100644
index 0000000..42a1dcf
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_FP512BN.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_FP512BN_H
+#define CONFIG_CURVE_FP512BN_H
+
+#include"core.h"
+#include"config_field_FP512BN.h"
+
+// ECP stuff
+
+#define CURVETYPE_FP512BN WEIERSTRASS
+#define CURVE_A_FP512BN 0
+#define PAIRING_FRIENDLY_FP512BN BN_CURVE
+#define CURVE_SECURITY_FP512BN 128
+#define HTC_ISO_FP512BN 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_FP512BN
+
+#if PAIRING_FRIENDLY_FP512BN != NOT_PF
+
+#define HTC_ISO_G2_FP512BN 0
+
+#define USE_GLV_FP512BN   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_FP512BN /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_FP512BN /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_FP512BN M_TYPE
+#define SIGN_OF_X_FP512BN POSITIVEX
+
+#define ATE_BITS_FP512BN 130
+#define G2_TABLE_FP512BN 172
+
+#endif
+
+
+#if CURVE_SECURITY_FP512BN == 128
+#define AESKEY_FP512BN 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_FP512BN SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_FP512BN == 192
+#define AESKEY_FP512BN 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_FP512BN SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_FP512BN == 256
+#define AESKEY_FP512BN 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_FP512BN SHA512  /**< Hash type */
+#endif
+
+
+namespace FP512BN_BIG = B512_60;
+namespace FP512BN_FP = FP512BN;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_HIFIVE.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_HIFIVE.h
new file mode 100644
index 0000000..2aca8a4
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_HIFIVE.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_HIFIVE_H
+#define CONFIG_CURVE_HIFIVE_H
+
+#include"core.h"
+#include"config_field_HIFIVE.h"
+
+// ECP stuff
+
+#define CURVETYPE_HIFIVE EDWARDS
+#define CURVE_A_HIFIVE 1
+#define PAIRING_FRIENDLY_HIFIVE NOT_PF
+#define CURVE_SECURITY_HIFIVE 192
+#define HTC_ISO_HIFIVE 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_HIFIVE
+
+#if PAIRING_FRIENDLY_HIFIVE != NOT_PF
+
+#define HTC_ISO_G2_HIFIVE 0
+
+#define USE_GLV_HIFIVE   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_HIFIVE /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_HIFIVE /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_HIFIVE 
+#define SIGN_OF_X_HIFIVE 
+
+#define ATE_BITS_HIFIVE 
+#define G2_TABLE_HIFIVE 
+
+#endif
+
+
+#if CURVE_SECURITY_HIFIVE == 128
+#define AESKEY_HIFIVE 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_HIFIVE SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_HIFIVE == 192
+#define AESKEY_HIFIVE 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_HIFIVE SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_HIFIVE == 256
+#define AESKEY_HIFIVE 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_HIFIVE SHA512  /**< Hash type */
+#endif
+
+
+namespace HIFIVE_BIG = B336_60;
+namespace HIFIVE_FP = HIFIVE;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_JUBJUB.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_JUBJUB.h
new file mode 100644
index 0000000..388fd68
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_JUBJUB.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_JUBJUB_H
+#define CONFIG_CURVE_JUBJUB_H
+
+#include"core.h"
+#include"config_field_JUBJUB.h"
+
+// ECP stuff
+
+#define CURVETYPE_JUBJUB EDWARDS
+#define CURVE_A_JUBJUB -1
+#define PAIRING_FRIENDLY_JUBJUB NOT_PF
+#define CURVE_SECURITY_JUBJUB 128
+#define HTC_ISO_JUBJUB 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_JUBJUB
+
+#if PAIRING_FRIENDLY_JUBJUB != NOT_PF
+
+#define HTC_ISO_G2_JUBJUB 0
+
+#define USE_GLV_JUBJUB   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_JUBJUB /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_JUBJUB /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_JUBJUB 
+#define SIGN_OF_X_JUBJUB 
+
+#define ATE_BITS_JUBJUB 
+#define G2_TABLE_JUBJUB 
+
+#endif
+
+
+#if CURVE_SECURITY_JUBJUB == 128
+#define AESKEY_JUBJUB 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_JUBJUB SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_JUBJUB == 192
+#define AESKEY_JUBJUB 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_JUBJUB SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_JUBJUB == 256
+#define AESKEY_JUBJUB 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_JUBJUB SHA512  /**< Hash type */
+#endif
+
+
+namespace JUBJUB_BIG = B256_56;
+namespace JUBJUB_FP = JUBJUB;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_MDC.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_MDC.h
new file mode 100644
index 0000000..d526b29
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_MDC.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_MDC_H
+#define CONFIG_CURVE_MDC_H
+
+#include"core.h"
+#include"config_field_MDC.h"
+
+// ECP stuff
+
+#define CURVETYPE_MDC EDWARDS
+#define CURVE_A_MDC 1
+#define PAIRING_FRIENDLY_MDC NOT_PF
+#define CURVE_SECURITY_MDC 128
+#define HTC_ISO_MDC 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_MDC
+
+#if PAIRING_FRIENDLY_MDC != NOT_PF
+
+#define HTC_ISO_G2_MDC 0
+
+#define USE_GLV_MDC   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_MDC /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_MDC /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_MDC 
+#define SIGN_OF_X_MDC 
+
+#define ATE_BITS_MDC 
+#define G2_TABLE_MDC 
+
+#endif
+
+
+#if CURVE_SECURITY_MDC == 128
+#define AESKEY_MDC 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_MDC SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_MDC == 192
+#define AESKEY_MDC 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_MDC SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_MDC == 256
+#define AESKEY_MDC 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_MDC SHA512  /**< Hash type */
+#endif
+
+
+namespace MDC_BIG = B256_56;
+namespace MDC_FP = MDC;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_NIST256.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_NIST256.h
new file mode 100644
index 0000000..dbd4b64
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_NIST256.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_NIST256_H
+#define CONFIG_CURVE_NIST256_H
+
+#include"core.h"
+#include"config_field_NIST256.h"
+
+// ECP stuff
+
+#define CURVETYPE_NIST256 WEIERSTRASS
+#define CURVE_A_NIST256 -3
+#define PAIRING_FRIENDLY_NIST256 NOT_PF
+#define CURVE_SECURITY_NIST256 128
+#define HTC_ISO_NIST256 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_NIST256
+
+#if PAIRING_FRIENDLY_NIST256 != NOT_PF
+
+#define HTC_ISO_G2_NIST256 0
+
+#define USE_GLV_NIST256   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_NIST256 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_NIST256 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_NIST256 
+#define SIGN_OF_X_NIST256 
+
+#define ATE_BITS_NIST256 
+#define G2_TABLE_NIST256 
+
+#endif
+
+
+#if CURVE_SECURITY_NIST256 == 128
+#define AESKEY_NIST256 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_NIST256 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_NIST256 == 192
+#define AESKEY_NIST256 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_NIST256 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_NIST256 == 256
+#define AESKEY_NIST256 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_NIST256 SHA512  /**< Hash type */
+#endif
+
+
+namespace NIST256_BIG = B256_56;
+namespace NIST256_FP = NIST256;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_NIST384.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_NIST384.h
new file mode 100644
index 0000000..ed648be
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_NIST384.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_NIST384_H
+#define CONFIG_CURVE_NIST384_H
+
+#include"core.h"
+#include"config_field_NIST384.h"
+
+// ECP stuff
+
+#define CURVETYPE_NIST384 WEIERSTRASS
+#define CURVE_A_NIST384 -3
+#define PAIRING_FRIENDLY_NIST384 NOT_PF
+#define CURVE_SECURITY_NIST384 192
+#define HTC_ISO_NIST384 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_NIST384
+
+#if PAIRING_FRIENDLY_NIST384 != NOT_PF
+
+#define HTC_ISO_G2_NIST384 0
+
+#define USE_GLV_NIST384   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_NIST384 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_NIST384 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_NIST384 
+#define SIGN_OF_X_NIST384 
+
+#define ATE_BITS_NIST384 
+#define G2_TABLE_NIST384 
+
+#endif
+
+
+#if CURVE_SECURITY_NIST384 == 128
+#define AESKEY_NIST384 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_NIST384 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_NIST384 == 192
+#define AESKEY_NIST384 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_NIST384 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_NIST384 == 256
+#define AESKEY_NIST384 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_NIST384 SHA512  /**< Hash type */
+#endif
+
+
+namespace NIST384_BIG = B384_56;
+namespace NIST384_FP = NIST384;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_NIST521.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_NIST521.h
new file mode 100644
index 0000000..888a733
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_NIST521.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_NIST521_H
+#define CONFIG_CURVE_NIST521_H
+
+#include"core.h"
+#include"config_field_NIST521.h"
+
+// ECP stuff
+
+#define CURVETYPE_NIST521 WEIERSTRASS
+#define CURVE_A_NIST521 -3
+#define PAIRING_FRIENDLY_NIST521 NOT_PF
+#define CURVE_SECURITY_NIST521 256
+#define HTC_ISO_NIST521 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_NIST521
+
+#if PAIRING_FRIENDLY_NIST521 != NOT_PF
+
+#define HTC_ISO_G2_NIST521 0
+
+#define USE_GLV_NIST521   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_NIST521 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_NIST521 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_NIST521 
+#define SIGN_OF_X_NIST521 
+
+#define ATE_BITS_NIST521 
+#define G2_TABLE_NIST521 
+
+#endif
+
+
+#if CURVE_SECURITY_NIST521 == 128
+#define AESKEY_NIST521 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_NIST521 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_NIST521 == 192
+#define AESKEY_NIST521 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_NIST521 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_NIST521 == 256
+#define AESKEY_NIST521 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_NIST521 SHA512  /**< Hash type */
+#endif
+
+
+namespace NIST521_BIG = B528_60;
+namespace NIST521_FP = NIST521;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_NUMS256E.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_NUMS256E.h
new file mode 100644
index 0000000..dd5629e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_NUMS256E.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_NUMS256E_H
+#define CONFIG_CURVE_NUMS256E_H
+
+#include"core.h"
+#include"config_field_F256PME.h"
+
+// ECP stuff
+
+#define CURVETYPE_NUMS256E EDWARDS
+#define CURVE_A_NUMS256E 1
+#define PAIRING_FRIENDLY_NUMS256E NOT_PF
+#define CURVE_SECURITY_NUMS256E 128
+#define HTC_ISO_NUMS256E 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_NUMS256E
+
+#if PAIRING_FRIENDLY_NUMS256E != NOT_PF
+
+#define HTC_ISO_G2_NUMS256E 0
+
+#define USE_GLV_NUMS256E   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_NUMS256E /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_NUMS256E /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_NUMS256E 
+#define SIGN_OF_X_NUMS256E 
+
+#define ATE_BITS_NUMS256E 
+#define G2_TABLE_NUMS256E 
+
+#endif
+
+
+#if CURVE_SECURITY_NUMS256E == 128
+#define AESKEY_NUMS256E 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_NUMS256E SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_NUMS256E == 192
+#define AESKEY_NUMS256E 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_NUMS256E SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_NUMS256E == 256
+#define AESKEY_NUMS256E 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_NUMS256E SHA512  /**< Hash type */
+#endif
+
+
+namespace NUMS256E_BIG = B256_56;
+namespace NUMS256E_FP = F256PME;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_NUMS256W.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_NUMS256W.h
new file mode 100644
index 0000000..262bf4a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_NUMS256W.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_NUMS256W_H
+#define CONFIG_CURVE_NUMS256W_H
+
+#include"core.h"
+#include"config_field_F256PMW.h"
+
+// ECP stuff
+
+#define CURVETYPE_NUMS256W WEIERSTRASS
+#define CURVE_A_NUMS256W -3
+#define PAIRING_FRIENDLY_NUMS256W NOT_PF
+#define CURVE_SECURITY_NUMS256W 128
+#define HTC_ISO_NUMS256W 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_NUMS256W
+
+#if PAIRING_FRIENDLY_NUMS256W != NOT_PF
+
+#define HTC_ISO_G2_NUMS256W 0
+
+#define USE_GLV_NUMS256W   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_NUMS256W /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_NUMS256W /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_NUMS256W 
+#define SIGN_OF_X_NUMS256W 
+
+#define ATE_BITS_NUMS256W 
+#define G2_TABLE_NUMS256W 
+
+#endif
+
+
+#if CURVE_SECURITY_NUMS256W == 128
+#define AESKEY_NUMS256W 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_NUMS256W SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_NUMS256W == 192
+#define AESKEY_NUMS256W 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_NUMS256W SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_NUMS256W == 256
+#define AESKEY_NUMS256W 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_NUMS256W SHA512  /**< Hash type */
+#endif
+
+
+namespace NUMS256W_BIG = B256_56;
+namespace NUMS256W_FP = F256PMW;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_NUMS384E.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_NUMS384E.h
new file mode 100644
index 0000000..b089b3e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_NUMS384E.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_NUMS384E_H
+#define CONFIG_CURVE_NUMS384E_H
+
+#include"core.h"
+#include"config_field_F384PM.h"
+
+// ECP stuff
+
+#define CURVETYPE_NUMS384E EDWARDS
+#define CURVE_A_NUMS384E 1
+#define PAIRING_FRIENDLY_NUMS384E NOT_PF
+#define CURVE_SECURITY_NUMS384E 192
+#define HTC_ISO_NUMS384E 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_NUMS384E
+
+#if PAIRING_FRIENDLY_NUMS384E != NOT_PF
+
+#define HTC_ISO_G2_NUMS384E 0
+
+#define USE_GLV_NUMS384E   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_NUMS384E /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_NUMS384E /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_NUMS384E 
+#define SIGN_OF_X_NUMS384E 
+
+#define ATE_BITS_NUMS384E 
+#define G2_TABLE_NUMS384E 
+
+#endif
+
+
+#if CURVE_SECURITY_NUMS384E == 128
+#define AESKEY_NUMS384E 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_NUMS384E SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_NUMS384E == 192
+#define AESKEY_NUMS384E 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_NUMS384E SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_NUMS384E == 256
+#define AESKEY_NUMS384E 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_NUMS384E SHA512  /**< Hash type */
+#endif
+
+
+namespace NUMS384E_BIG = B384_58;
+namespace NUMS384E_FP = F384PM;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_NUMS384W.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_NUMS384W.h
new file mode 100644
index 0000000..9f41c39
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_NUMS384W.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_NUMS384W_H
+#define CONFIG_CURVE_NUMS384W_H
+
+#include"core.h"
+#include"config_field_F384PM.h"
+
+// ECP stuff
+
+#define CURVETYPE_NUMS384W WEIERSTRASS
+#define CURVE_A_NUMS384W -3
+#define PAIRING_FRIENDLY_NUMS384W NOT_PF
+#define CURVE_SECURITY_NUMS384W 192
+#define HTC_ISO_NUMS384W 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_NUMS384W
+
+#if PAIRING_FRIENDLY_NUMS384W != NOT_PF
+
+#define HTC_ISO_G2_NUMS384W 0
+
+#define USE_GLV_NUMS384W   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_NUMS384W /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_NUMS384W /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_NUMS384W 
+#define SIGN_OF_X_NUMS384W 
+
+#define ATE_BITS_NUMS384W 
+#define G2_TABLE_NUMS384W 
+
+#endif
+
+
+#if CURVE_SECURITY_NUMS384W == 128
+#define AESKEY_NUMS384W 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_NUMS384W SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_NUMS384W == 192
+#define AESKEY_NUMS384W 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_NUMS384W SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_NUMS384W == 256
+#define AESKEY_NUMS384W 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_NUMS384W SHA512  /**< Hash type */
+#endif
+
+
+namespace NUMS384W_BIG = B384_58;
+namespace NUMS384W_FP = F384PM;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_NUMS512E.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_NUMS512E.h
new file mode 100644
index 0000000..beacb50
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_NUMS512E.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_NUMS512E_H
+#define CONFIG_CURVE_NUMS512E_H
+
+#include"core.h"
+#include"config_field_F512PM.h"
+
+// ECP stuff
+
+#define CURVETYPE_NUMS512E EDWARDS
+#define CURVE_A_NUMS512E 1
+#define PAIRING_FRIENDLY_NUMS512E NOT_PF
+#define CURVE_SECURITY_NUMS512E 256
+#define HTC_ISO_NUMS512E 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_NUMS512E
+
+#if PAIRING_FRIENDLY_NUMS512E != NOT_PF
+
+#define HTC_ISO_G2_NUMS512E 0
+
+#define USE_GLV_NUMS512E   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_NUMS512E /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_NUMS512E /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_NUMS512E 
+#define SIGN_OF_X_NUMS512E 
+
+#define ATE_BITS_NUMS512E 
+#define G2_TABLE_NUMS512E 
+
+#endif
+
+
+#if CURVE_SECURITY_NUMS512E == 128
+#define AESKEY_NUMS512E 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_NUMS512E SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_NUMS512E == 192
+#define AESKEY_NUMS512E 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_NUMS512E SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_NUMS512E == 256
+#define AESKEY_NUMS512E 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_NUMS512E SHA512  /**< Hash type */
+#endif
+
+
+namespace NUMS512E_BIG = B512_60;
+namespace NUMS512E_FP = F512PM;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_NUMS512W.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_NUMS512W.h
new file mode 100644
index 0000000..160675e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_NUMS512W.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_NUMS512W_H
+#define CONFIG_CURVE_NUMS512W_H
+
+#include"core.h"
+#include"config_field_F512PM.h"
+
+// ECP stuff
+
+#define CURVETYPE_NUMS512W WEIERSTRASS
+#define CURVE_A_NUMS512W -3
+#define PAIRING_FRIENDLY_NUMS512W NOT_PF
+#define CURVE_SECURITY_NUMS512W 256
+#define HTC_ISO_NUMS512W 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_NUMS512W
+
+#if PAIRING_FRIENDLY_NUMS512W != NOT_PF
+
+#define HTC_ISO_G2_NUMS512W 0
+
+#define USE_GLV_NUMS512W   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_NUMS512W /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_NUMS512W /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_NUMS512W 
+#define SIGN_OF_X_NUMS512W 
+
+#define ATE_BITS_NUMS512W 
+#define G2_TABLE_NUMS512W 
+
+#endif
+
+
+#if CURVE_SECURITY_NUMS512W == 128
+#define AESKEY_NUMS512W 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_NUMS512W SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_NUMS512W == 192
+#define AESKEY_NUMS512W 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_NUMS512W SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_NUMS512W == 256
+#define AESKEY_NUMS512W 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_NUMS512W SHA512  /**< Hash type */
+#endif
+
+
+namespace NUMS512W_BIG = B512_60;
+namespace NUMS512W_FP = F512PM;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_SECP160R1.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_SECP160R1.h
new file mode 100644
index 0000000..03ebd84
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_SECP160R1.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_SECP160R1_H
+#define CONFIG_CURVE_SECP160R1_H
+
+#include"core.h"
+#include"config_field_SECP160R1.h"
+
+// ECP stuff
+
+#define CURVETYPE_SECP160R1 WEIERSTRASS
+#define CURVE_A_SECP160R1 -3
+#define PAIRING_FRIENDLY_SECP160R1 NOT_PF
+#define CURVE_SECURITY_SECP160R1 128
+#define HTC_ISO_SECP160R1 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_SECP160R1
+
+#if PAIRING_FRIENDLY_SECP160R1 != NOT_PF
+
+#define HTC_ISO_G2_SECP160R1 0
+
+#define USE_GLV_SECP160R1   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_SECP160R1 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_SECP160R1 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_SECP160R1 
+#define SIGN_OF_X_SECP160R1 
+
+#define ATE_BITS_SECP160R1 
+#define G2_TABLE_SECP160R1 
+
+#endif
+
+
+#if CURVE_SECURITY_SECP160R1 == 128
+#define AESKEY_SECP160R1 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_SECP160R1 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_SECP160R1 == 192
+#define AESKEY_SECP160R1 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_SECP160R1 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_SECP160R1 == 256
+#define AESKEY_SECP160R1 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_SECP160R1 SHA512  /**< Hash type */
+#endif
+
+
+namespace SECP160R1_BIG = B160_56;
+namespace SECP160R1_FP = SECP160R1;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_SECP256K1.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_SECP256K1.h
new file mode 100644
index 0000000..ce4468a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_SECP256K1.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_SECP256K1_H
+#define CONFIG_CURVE_SECP256K1_H
+
+#include"core.h"
+#include"config_field_SECP256K1.h"
+
+// ECP stuff
+
+#define CURVETYPE_SECP256K1 WEIERSTRASS
+#define CURVE_A_SECP256K1 0
+#define PAIRING_FRIENDLY_SECP256K1 NOT_PF
+#define CURVE_SECURITY_SECP256K1 128
+#define HTC_ISO_SECP256K1 3
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_SECP256K1
+
+#if PAIRING_FRIENDLY_SECP256K1 != NOT_PF
+
+#define HTC_ISO_G2_SECP256K1 0
+
+#define USE_GLV_SECP256K1   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_SECP256K1 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_SECP256K1 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_SECP256K1 
+#define SIGN_OF_X_SECP256K1 
+
+#define ATE_BITS_SECP256K1 
+#define G2_TABLE_SECP256K1 
+
+#endif
+
+
+#if CURVE_SECURITY_SECP256K1 == 128
+#define AESKEY_SECP256K1 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_SECP256K1 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_SECP256K1 == 192
+#define AESKEY_SECP256K1 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_SECP256K1 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_SECP256K1 == 256
+#define AESKEY_SECP256K1 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_SECP256K1 SHA512  /**< Hash type */
+#endif
+
+
+namespace SECP256K1_BIG = B256_56;
+namespace SECP256K1_FP = SECP256K1;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_SM2.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_SM2.h
new file mode 100644
index 0000000..d193948
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_SM2.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_SM2_H
+#define CONFIG_CURVE_SM2_H
+
+#include"core.h"
+#include"config_field_SM2.h"
+
+// ECP stuff
+
+#define CURVETYPE_SM2 WEIERSTRASS
+#define CURVE_A_SM2 -3
+#define PAIRING_FRIENDLY_SM2 NOT_PF
+#define CURVE_SECURITY_SM2 128
+#define HTC_ISO_SM2 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_SM2
+
+#if PAIRING_FRIENDLY_SM2 != NOT_PF
+
+#define HTC_ISO_G2_SM2 0
+
+#define USE_GLV_SM2   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_SM2 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_SM2 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_SM2 
+#define SIGN_OF_X_SM2 
+
+#define ATE_BITS_SM2 
+#define G2_TABLE_SM2 
+
+#endif
+
+
+#if CURVE_SECURITY_SM2 == 128
+#define AESKEY_SM2 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_SM2 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_SM2 == 192
+#define AESKEY_SM2 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_SM2 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_SM2 == 256
+#define AESKEY_SM2 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_SM2 SHA512  /**< Hash type */
+#endif
+
+
+namespace SM2_BIG = B256_56;
+namespace SM2_FP = SM2;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_TWEEDLEDEE.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_TWEEDLEDEE.h
new file mode 100644
index 0000000..beff313
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_TWEEDLEDEE.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_TWEEDLEDEE_H
+#define CONFIG_CURVE_TWEEDLEDEE_H
+
+#include"core.h"
+#include"config_field_TWEEDLEDEE.h"
+
+// ECP stuff
+
+#define CURVETYPE_TWEEDLEDEE WEIERSTRASS
+#define CURVE_A_TWEEDLEDEE 0
+#define PAIRING_FRIENDLY_TWEEDLEDEE NOT_PF
+#define CURVE_SECURITY_TWEEDLEDEE 128
+#define HTC_ISO_TWEEDLEDEE 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_TWEEDLEDEE
+
+#if PAIRING_FRIENDLY_TWEEDLEDEE != NOT_PF
+
+#define HTC_ISO_G2_TWEEDLEDEE 0
+
+#define USE_GLV_TWEEDLEDEE   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_TWEEDLEDEE /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_TWEEDLEDEE /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_TWEEDLEDEE 
+#define SIGN_OF_X_TWEEDLEDEE 
+
+#define ATE_BITS_TWEEDLEDEE 
+#define G2_TABLE_TWEEDLEDEE 
+
+#endif
+
+
+#if CURVE_SECURITY_TWEEDLEDEE == 128
+#define AESKEY_TWEEDLEDEE 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_TWEEDLEDEE SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_TWEEDLEDEE == 192
+#define AESKEY_TWEEDLEDEE 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_TWEEDLEDEE SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_TWEEDLEDEE == 256
+#define AESKEY_TWEEDLEDEE 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_TWEEDLEDEE SHA512  /**< Hash type */
+#endif
+
+
+namespace TWEEDLEDEE_BIG = B256_56;
+namespace TWEEDLEDEE_FP = TWEEDLEDEE;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_TWEEDLEDUM.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_TWEEDLEDUM.h
new file mode 100644
index 0000000..84ad8cd
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_TWEEDLEDUM.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_TWEEDLEDUM_H
+#define CONFIG_CURVE_TWEEDLEDUM_H
+
+#include"core.h"
+#include"config_field_TWEEDLEDUM.h"
+
+// ECP stuff
+
+#define CURVETYPE_TWEEDLEDUM WEIERSTRASS
+#define CURVE_A_TWEEDLEDUM 0
+#define PAIRING_FRIENDLY_TWEEDLEDUM NOT_PF
+#define CURVE_SECURITY_TWEEDLEDUM 128
+#define HTC_ISO_TWEEDLEDUM 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_TWEEDLEDUM
+
+#if PAIRING_FRIENDLY_TWEEDLEDUM != NOT_PF
+
+#define HTC_ISO_G2_TWEEDLEDUM 0
+
+#define USE_GLV_TWEEDLEDUM   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_TWEEDLEDUM /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_TWEEDLEDUM /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_TWEEDLEDUM 
+#define SIGN_OF_X_TWEEDLEDUM 
+
+#define ATE_BITS_TWEEDLEDUM 
+#define G2_TABLE_TWEEDLEDUM 
+
+#endif
+
+
+#if CURVE_SECURITY_TWEEDLEDUM == 128
+#define AESKEY_TWEEDLEDUM 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_TWEEDLEDUM SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_TWEEDLEDUM == 192
+#define AESKEY_TWEEDLEDUM 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_TWEEDLEDUM SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_TWEEDLEDUM == 256
+#define AESKEY_TWEEDLEDUM 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_TWEEDLEDUM SHA512  /**< Hash type */
+#endif
+
+
+namespace TWEEDLEDUM_BIG = B256_56;
+namespace TWEEDLEDUM_FP = TWEEDLEDUM;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_X448.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_X448.h
new file mode 100644
index 0000000..e12aced
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_curve_X448.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_X448_H
+#define CONFIG_CURVE_X448_H
+
+#include"core.h"
+#include"config_field_F448.h"
+
+// ECP stuff
+
+#define CURVETYPE_X448 MONTGOMERY
+#define CURVE_A_X448 156326
+#define PAIRING_FRIENDLY_X448 NOT_PF
+#define CURVE_SECURITY_X448 256
+#define HTC_ISO_X448 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_X448
+
+#if PAIRING_FRIENDLY_X448 != NOT_PF
+
+#define HTC_ISO_G2_X448 0
+
+#define USE_GLV_X448   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_X448 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_X448 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_X448 
+#define SIGN_OF_X_X448 
+
+#define ATE_BITS_X448 
+#define G2_TABLE_X448 
+
+#endif
+
+
+#if CURVE_SECURITY_X448 == 128
+#define AESKEY_X448 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_X448 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_X448 == 192
+#define AESKEY_X448 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_X448 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_X448 == 256
+#define AESKEY_X448 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_X448 SHA512  /**< Hash type */
+#endif
+
+
+namespace X448_BIG = B448_58;
+namespace X448_FP = F448;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_ff.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_ff.h
new file mode 100644
index 0000000..cc6744a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_ff.h
@@ -0,0 +1,32 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_RSA_WWW_H
+#define CONFIG_RSA_WWW_H
+
+#include "core.h"
+#include "config_big_XXX.h"
+
+// FF stuff
+
+#define FFLEN_WWW @ML@ /**< 2^n multiplier of BIGBITS to specify supported Finite Field size, e.g 2048=256*2^3 where BIGBITS=256 */
+
+namespace WWW_BIG = XXX;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_ff_RSA2048.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_ff_RSA2048.h
new file mode 100644
index 0000000..69a2143
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_ff_RSA2048.h
@@ -0,0 +1,32 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_RSA_RSA2048_H
+#define CONFIG_RSA_RSA2048_H
+
+#include "core.h"
+#include "config_big_B512_60.h"
+
+// FF stuff
+
+#define FFLEN_RSA2048 4 /**< 2^n multiplier of BIGBITS to specify supported Finite Field size, e.g 2048=256*2^3 where BIGBITS=256 */
+
+namespace RSA2048_BIG = B512_60;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_ff_RSA3072.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_ff_RSA3072.h
new file mode 100644
index 0000000..5b58063
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_ff_RSA3072.h
@@ -0,0 +1,32 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_RSA_RSA3072_H
+#define CONFIG_RSA_RSA3072_H
+
+#include "core.h"
+#include "config_big_B384_56.h"
+
+// FF stuff
+
+#define FFLEN_RSA3072 8 /**< 2^n multiplier of BIGBITS to specify supported Finite Field size, e.g 2048=256*2^3 where BIGBITS=256 */
+
+namespace RSA3072_BIG = B384_56;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_ff_RSA4096.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_ff_RSA4096.h
new file mode 100644
index 0000000..605cccc
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_ff_RSA4096.h
@@ -0,0 +1,32 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_RSA_RSA4096_H
+#define CONFIG_RSA_RSA4096_H
+
+#include "core.h"
+#include "config_big_B512_60.h"
+
+// FF stuff
+
+#define FFLEN_RSA4096 8 /**< 2^n multiplier of BIGBITS to specify supported Finite Field size, e.g 2048=256*2^3 where BIGBITS=256 */
+
+namespace RSA4096_BIG = B512_60;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field.h
new file mode 100644
index 0000000..88f4d7b
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_YYY_H
+#define CONFIG_FIELD_YYY_H
+
+#include"core.h"
+#include "config_big_XXX.h"
+
+// FP stuff
+
+#define MBITS_YYY @NBT@
+#define PM1D2_YYY @M8@
+#define MODTYPE_YYY @MT@
+#define MAXXES_YYY @SH@
+#define QNRI_YYY @QI@
+#define RIADZ_YYY @RZ@
+#define RIADZG2A_YYY @RZ2A@
+#define RIADZG2B_YYY @RZ2B@
+#define TOWER_YYY @TW@
+
+//#define BIG_ENDIAN_SIGN_YYY 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_ANSSI.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_ANSSI.h
new file mode 100644
index 0000000..a12e78a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_ANSSI.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_ANSSI_H
+#define CONFIG_FIELD_ANSSI_H
+
+#include"core.h"
+#include "config_big_B256_56.h"
+
+// FP stuff
+
+#define MBITS_ANSSI 256
+#define PM1D2_ANSSI 1
+#define MODTYPE_ANSSI NOT_SPECIAL
+#define MAXXES_ANSSI 24
+#define QNRI_ANSSI 0
+#define RIADZ_ANSSI -5
+#define RIADZG2A_ANSSI 0
+#define RIADZG2B_ANSSI 0
+#define TOWER_ANSSI NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_ANSSI 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_BLS12381.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_BLS12381.h
new file mode 100644
index 0000000..579fce1
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_BLS12381.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_BLS12381_H
+#define CONFIG_FIELD_BLS12381_H
+
+#include"core.h"
+#include "config_big_B384_58.h"
+
+// FP stuff
+
+#define MBITS_BLS12381 381
+#define PM1D2_BLS12381 1
+#define MODTYPE_BLS12381 NOT_SPECIAL
+#define MAXXES_BLS12381 25
+#define QNRI_BLS12381 0
+#define RIADZ_BLS12381 11
+#define RIADZG2A_BLS12381 -2
+#define RIADZG2B_BLS12381 -1
+#define TOWER_BLS12381 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_BLS12381 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_BLS12383.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_BLS12383.h
new file mode 100644
index 0000000..03cb9c7
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_BLS12383.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_BLS12383_H
+#define CONFIG_FIELD_BLS12383_H
+
+#include"core.h"
+#include "config_big_B384_58.h"
+
+// FP stuff
+
+#define MBITS_BLS12383 383
+#define PM1D2_BLS12383 1
+#define MODTYPE_BLS12383 NOT_SPECIAL
+#define MAXXES_BLS12383 23
+#define QNRI_BLS12383 0
+#define RIADZ_BLS12383 1
+#define RIADZG2A_BLS12383 1
+#define RIADZG2B_BLS12383 0
+#define TOWER_BLS12383 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_BLS12383 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_BLS12443.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_BLS12443.h
new file mode 100644
index 0000000..03ffae8
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_BLS12443.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_BLS12443_H
+#define CONFIG_FIELD_BLS12443_H
+
+#include"core.h"
+#include "config_big_B448_60.h"
+
+// FP stuff
+
+#define MBITS_BLS12443 443
+#define PM1D2_BLS12443 1
+#define MODTYPE_BLS12443 NOT_SPECIAL
+#define MAXXES_BLS12443 30
+#define QNRI_BLS12443 0
+#define RIADZ_BLS12443 -7
+#define RIADZG2A_BLS12443 1
+#define RIADZG2B_BLS12443 1
+#define TOWER_BLS12443 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_BLS12443 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_BLS12461.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_BLS12461.h
new file mode 100644
index 0000000..5377186
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_BLS12461.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_BLS12461_H
+#define CONFIG_FIELD_BLS12461_H
+
+#include"core.h"
+#include "config_big_B464_60.h"
+
+// FP stuff
+
+#define MBITS_BLS12461 461
+#define PM1D2_BLS12461 1
+#define MODTYPE_BLS12461 NOT_SPECIAL
+#define MAXXES_BLS12461 19
+#define QNRI_BLS12461 0
+#define RIADZ_BLS12461 1
+#define RIADZG2A_BLS12461 4
+#define RIADZG2B_BLS12461 0
+#define TOWER_BLS12461 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_BLS12461 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_BLS24479.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_BLS24479.h
new file mode 100644
index 0000000..0d7aeaf
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_BLS24479.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_BLS24479_H
+#define CONFIG_FIELD_BLS24479_H
+
+#include"core.h"
+#include "config_big_B480_56.h"
+
+// FP stuff
+
+#define MBITS_BLS24479 479
+#define PM1D2_BLS24479 1
+#define MODTYPE_BLS24479 NOT_SPECIAL
+#define MAXXES_BLS24479 25
+#define QNRI_BLS24479 0
+#define RIADZ_BLS24479 1
+#define RIADZG2A_BLS24479 4
+#define RIADZG2B_BLS24479 0
+#define TOWER_BLS24479 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_BLS24479 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_BLS48286.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_BLS48286.h
new file mode 100644
index 0000000..c34c09d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_BLS48286.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_BLS48286_H
+#define CONFIG_FIELD_BLS48286_H
+
+#include"core.h"
+#include "config_big_B288_60.h"
+
+// FP stuff
+
+#define MBITS_BLS48286 286
+#define PM1D2_BLS48286 1
+#define MODTYPE_BLS48286 NOT_SPECIAL
+#define MAXXES_BLS48286 14
+#define QNRI_BLS48286 0
+#define RIADZ_BLS48286 1
+#define RIADZG2A_BLS48286 1
+#define RIADZG2B_BLS48286 0
+#define TOWER_BLS48286 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_BLS48286 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_BLS48556.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_BLS48556.h
new file mode 100644
index 0000000..d5705c1
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_BLS48556.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_BLS48556_H
+#define CONFIG_FIELD_BLS48556_H
+
+#include"core.h"
+#include "config_big_B560_58.h"
+
+// FP stuff
+
+#define MBITS_BLS48556 556
+#define PM1D2_BLS48556 1
+#define MODTYPE_BLS48556 NOT_SPECIAL
+#define MAXXES_BLS48556 24
+#define QNRI_BLS48556 0
+#define RIADZ_BLS48556 -1
+#define RIADZG2A_BLS48556 2
+#define RIADZG2B_BLS48556 0
+#define TOWER_BLS48556 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_BLS48556 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_BLS48581.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_BLS48581.h
new file mode 100644
index 0000000..20ad904
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_BLS48581.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_BLS48581_H
+#define CONFIG_FIELD_BLS48581_H
+
+#include"core.h"
+#include "config_big_B584_60.h"
+
+// FP stuff
+
+#define MBITS_BLS48581 581
+#define PM1D2_BLS48581 1
+#define MODTYPE_BLS48581 NOT_SPECIAL
+#define MAXXES_BLS48581 19
+#define QNRI_BLS48581 0
+#define RIADZ_BLS48581 2
+#define RIADZG2A_BLS48581 2
+#define RIADZG2B_BLS48581 0
+#define TOWER_BLS48581 POSITOWER
+
+//#define BIG_ENDIAN_SIGN_BLS48581 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_BN158.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_BN158.h
new file mode 100644
index 0000000..024b195
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_BN158.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_BN158_H
+#define CONFIG_FIELD_BN158_H
+
+#include"core.h"
+#include "config_big_B160_56.h"
+
+// FP stuff
+
+#define MBITS_BN158 158
+#define PM1D2_BN158 1
+#define MODTYPE_BN158 NOT_SPECIAL
+#define MAXXES_BN158 10
+#define QNRI_BN158 0
+#define RIADZ_BN158 1
+#define RIADZG2A_BN158 1
+#define RIADZG2B_BN158 0
+#define TOWER_BN158 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_BN158 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_BN254.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_BN254.h
new file mode 100644
index 0000000..187ae79
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_BN254.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_BN254_H
+#define CONFIG_FIELD_BN254_H
+
+#include"core.h"
+#include "config_big_B256_56.h"
+
+// FP stuff
+
+#define MBITS_BN254 254
+#define PM1D2_BN254 1
+#define MODTYPE_BN254 NOT_SPECIAL
+#define MAXXES_BN254 26
+#define QNRI_BN254 0
+#define RIADZ_BN254 -1
+#define RIADZG2A_BN254 -1
+#define RIADZG2B_BN254 0
+#define TOWER_BN254 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_BN254 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_BN254CX.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_BN254CX.h
new file mode 100644
index 0000000..b3b3e26
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_BN254CX.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_BN254CX_H
+#define CONFIG_FIELD_BN254CX_H
+
+#include"core.h"
+#include "config_big_B256_56.h"
+
+// FP stuff
+
+#define MBITS_BN254CX 254
+#define PM1D2_BN254CX 1
+#define MODTYPE_BN254CX NOT_SPECIAL
+#define MAXXES_BN254CX 26
+#define QNRI_BN254CX 0
+#define RIADZ_BN254CX -1
+#define RIADZG2A_BN254CX -1
+#define RIADZG2B_BN254CX 0
+#define TOWER_BN254CX NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_BN254CX 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_BN462.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_BN462.h
new file mode 100644
index 0000000..1690105
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_BN462.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_BN462_H
+#define CONFIG_FIELD_BN462_H
+
+#include"core.h"
+#include "config_big_B464_60.h"
+
+// FP stuff
+
+#define MBITS_BN462 462
+#define PM1D2_BN462 1
+#define MODTYPE_BN462 NOT_SPECIAL
+#define MAXXES_BN462 18
+#define QNRI_BN462 1
+#define RIADZ_BN462 1
+#define RIADZG2A_BN462 1
+#define RIADZG2B_BN462 0
+#define TOWER_BN462 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_BN462 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_BRAINPOOL.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_BRAINPOOL.h
new file mode 100644
index 0000000..be6cb12
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_BRAINPOOL.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_BRAINPOOL_H
+#define CONFIG_FIELD_BRAINPOOL_H
+
+#include"core.h"
+#include "config_big_B256_56.h"
+
+// FP stuff
+
+#define MBITS_BRAINPOOL 256
+#define PM1D2_BRAINPOOL 1
+#define MODTYPE_BRAINPOOL NOT_SPECIAL
+#define MAXXES_BRAINPOOL 24
+#define QNRI_BRAINPOOL 0
+#define RIADZ_BRAINPOOL -3
+#define RIADZG2A_BRAINPOOL 0
+#define RIADZG2B_BRAINPOOL 0
+#define TOWER_BRAINPOOL NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_BRAINPOOL 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_C1174.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_C1174.h
new file mode 100644
index 0000000..79f81eb
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_C1174.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_C1174_H
+#define CONFIG_FIELD_C1174_H
+
+#include"core.h"
+#include "config_big_B256_56.h"
+
+// FP stuff
+
+#define MBITS_C1174 251
+#define PM1D2_C1174 1
+#define MODTYPE_C1174 PSEUDO_MERSENNE
+#define MAXXES_C1174 29
+#define QNRI_C1174 0
+#define RIADZ_C1174 0
+#define RIADZG2A_C1174 0
+#define RIADZG2B_C1174 0
+#define TOWER_C1174 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_C1174 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_C1665.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_C1665.h
new file mode 100644
index 0000000..8a1b1c4
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_C1665.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_C1665_H
+#define CONFIG_FIELD_C1665_H
+
+#include"core.h"
+#include "config_big_B168_60.h"
+
+// FP stuff
+
+#define MBITS_C1665 166
+#define PM1D2_C1665 1
+#define MODTYPE_C1665 PSEUDO_MERSENNE
+#define MAXXES_C1665 14
+#define QNRI_C1665 0
+#define RIADZ_C1665 0
+#define RIADZG2A_C1665 0
+#define RIADZG2B_C1665 0
+#define TOWER_C1665 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_C1665 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_C41417.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_C41417.h
new file mode 100644
index 0000000..55391bd
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_C41417.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_C41417_H
+#define CONFIG_FIELD_C41417_H
+
+#include"core.h"
+#include "config_big_B416_60.h"
+
+// FP stuff
+
+#define MBITS_C41417 414
+#define PM1D2_C41417 1
+#define MODTYPE_C41417 PSEUDO_MERSENNE
+#define MAXXES_C41417 6
+#define QNRI_C41417 0
+#define RIADZ_C41417 1
+#define RIADZG2A_C41417 0
+#define RIADZG2B_C41417 0
+#define TOWER_C41417 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_C41417 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_F25519.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_F25519.h
new file mode 100644
index 0000000..37c0fe4
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_F25519.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_F25519_H
+#define CONFIG_FIELD_F25519_H
+
+#include"core.h"
+#include "config_big_B256_56.h"
+
+// FP stuff
+
+#define MBITS_F25519 255
+#define PM1D2_F25519 2
+#define MODTYPE_F25519 PSEUDO_MERSENNE
+#define MAXXES_F25519 25
+#define QNRI_F25519 0
+#define RIADZ_F25519 2
+#define RIADZG2A_F25519 0
+#define RIADZG2B_F25519 0
+#define TOWER_F25519 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_F25519 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_F256PME.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_F256PME.h
new file mode 100644
index 0000000..1b1296e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_F256PME.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_F256PME_H
+#define CONFIG_FIELD_F256PME_H
+
+#include"core.h"
+#include "config_big_B256_56.h"
+
+// FP stuff
+
+#define MBITS_F256PME 256
+#define PM1D2_F256PME 1
+#define MODTYPE_F256PME PSEUDO_MERSENNE
+#define MAXXES_F256PME 24
+#define QNRI_F256PME 0
+#define RIADZ_F256PME 0
+#define RIADZG2A_F256PME 0
+#define RIADZG2B_F256PME 0
+#define TOWER_F256PME NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_F256PME 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_F256PMW.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_F256PMW.h
new file mode 100644
index 0000000..8f0a5f8
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_F256PMW.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_F256PMW_H
+#define CONFIG_FIELD_F256PMW_H
+
+#include"core.h"
+#include "config_big_B256_56.h"
+
+// FP stuff
+
+#define MBITS_F256PMW 256
+#define PM1D2_F256PMW 1
+#define MODTYPE_F256PMW PSEUDO_MERSENNE
+#define MAXXES_F256PMW 24
+#define QNRI_F256PMW 0
+#define RIADZ_F256PMW 7
+#define RIADZG2A_F256PMW 0
+#define RIADZG2B_F256PMW 0
+#define TOWER_F256PMW NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_F256PMW 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_F384PM.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_F384PM.h
new file mode 100644
index 0000000..176caf5
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_F384PM.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_F384PM_H
+#define CONFIG_FIELD_F384PM_H
+
+#include"core.h"
+#include "config_big_B384_58.h"
+
+// FP stuff
+
+#define MBITS_F384PM 384
+#define PM1D2_F384PM 1
+#define MODTYPE_F384PM PSEUDO_MERSENNE
+#define MAXXES_F384PM 22
+#define QNRI_F384PM 0
+#define RIADZ_F384PM 0
+#define RIADZG2A_F384PM 0
+#define RIADZG2B_F384PM 0
+#define TOWER_F384PM NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_F384PM 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_F448.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_F448.h
new file mode 100644
index 0000000..39b770e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_F448.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_F448_H
+#define CONFIG_FIELD_F448_H
+
+#include"core.h"
+#include "config_big_B448_58.h"
+
+// FP stuff
+
+#define MBITS_F448 448
+#define PM1D2_F448 1
+#define MODTYPE_F448 GENERALISED_MERSENNE
+#define MAXXES_F448 16
+#define QNRI_F448 0
+#define RIADZ_F448 0
+#define RIADZG2A_F448 0
+#define RIADZG2B_F448 0
+#define TOWER_F448 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_F448 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_F512PM.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_F512PM.h
new file mode 100644
index 0000000..81dfdc2
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_F512PM.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_F512PM_H
+#define CONFIG_FIELD_F512PM_H
+
+#include"core.h"
+#include "config_big_B512_60.h"
+
+// FP stuff
+
+#define MBITS_F512PM 512
+#define PM1D2_F512PM 1
+#define MODTYPE_F512PM PSEUDO_MERSENNE
+#define MAXXES_F512PM 28
+#define QNRI_F512PM 0
+#define RIADZ_F512PM 0
+#define RIADZG2A_F512PM 0
+#define RIADZG2B_F512PM 0
+#define TOWER_F512PM NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_F512PM 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_FP256BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_FP256BN.h
new file mode 100644
index 0000000..ab5d02a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_FP256BN.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_FP256BN_H
+#define CONFIG_FIELD_FP256BN_H
+
+#include"core.h"
+#include "config_big_B256_56.h"
+
+// FP stuff
+
+#define MBITS_FP256BN 256
+#define PM1D2_FP256BN 1
+#define MODTYPE_FP256BN NOT_SPECIAL
+#define MAXXES_FP256BN 24
+#define QNRI_FP256BN 0
+#define RIADZ_FP256BN 1
+#define RIADZG2A_FP256BN 1
+#define RIADZG2B_FP256BN 0
+#define TOWER_FP256BN NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_FP256BN 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_FP512BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_FP512BN.h
new file mode 100644
index 0000000..18c488f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_FP512BN.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_FP512BN_H
+#define CONFIG_FIELD_FP512BN_H
+
+#include"core.h"
+#include "config_big_B512_60.h"
+
+// FP stuff
+
+#define MBITS_FP512BN 512
+#define PM1D2_FP512BN 1
+#define MODTYPE_FP512BN NOT_SPECIAL
+#define MAXXES_FP512BN 28
+#define QNRI_FP512BN 0
+#define RIADZ_FP512BN 1
+#define RIADZG2A_FP512BN 1
+#define RIADZG2B_FP512BN 0
+#define TOWER_FP512BN NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_FP512BN 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_HIFIVE.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_HIFIVE.h
new file mode 100644
index 0000000..85ddf5a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_HIFIVE.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_HIFIVE_H
+#define CONFIG_FIELD_HIFIVE_H
+
+#include"core.h"
+#include "config_big_B336_60.h"
+
+// FP stuff
+
+#define MBITS_HIFIVE 336
+#define PM1D2_HIFIVE 2
+#define MODTYPE_HIFIVE PSEUDO_MERSENNE
+#define MAXXES_HIFIVE 24
+#define QNRI_HIFIVE 0
+#define RIADZ_HIFIVE 1
+#define RIADZG2A_HIFIVE 0
+#define RIADZG2B_HIFIVE 0
+#define TOWER_HIFIVE NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_HIFIVE 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_JUBJUB.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_JUBJUB.h
new file mode 100644
index 0000000..215298f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_JUBJUB.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_JUBJUB_H
+#define CONFIG_FIELD_JUBJUB_H
+
+#include"core.h"
+#include "config_big_B256_56.h"
+
+// FP stuff
+
+#define MBITS_JUBJUB 255
+#define PM1D2_JUBJUB 32
+#define MODTYPE_JUBJUB NOT_SPECIAL
+#define MAXXES_JUBJUB 25
+#define QNRI_JUBJUB 5
+#define RIADZ_JUBJUB 1
+#define RIADZG2A_JUBJUB 0
+#define RIADZG2B_JUBJUB 0
+#define TOWER_JUBJUB NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_JUBJUB 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_MDC.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_MDC.h
new file mode 100644
index 0000000..2e4e77d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_MDC.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_MDC_H
+#define CONFIG_FIELD_MDC_H
+
+#include"core.h"
+#include "config_big_B256_56.h"
+
+// FP stuff
+
+#define MBITS_MDC 256
+#define PM1D2_MDC 1
+#define MODTYPE_MDC NOT_SPECIAL
+#define MAXXES_MDC 24
+#define QNRI_MDC 0
+#define RIADZ_MDC 0
+#define RIADZG2A_MDC 0
+#define RIADZG2B_MDC 0
+#define TOWER_MDC NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_MDC 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_NIST256.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_NIST256.h
new file mode 100644
index 0000000..dc4676b
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_NIST256.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_NIST256_H
+#define CONFIG_FIELD_NIST256_H
+
+#include"core.h"
+#include "config_big_B256_56.h"
+
+// FP stuff
+
+#define MBITS_NIST256 256
+#define PM1D2_NIST256 1
+#define MODTYPE_NIST256 NOT_SPECIAL
+#define MAXXES_NIST256 24
+#define QNRI_NIST256 0
+#define RIADZ_NIST256 -10
+#define RIADZG2A_NIST256 0
+#define RIADZG2B_NIST256 0
+#define TOWER_NIST256 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_NIST256 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_NIST384.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_NIST384.h
new file mode 100644
index 0000000..50dfbb7
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_NIST384.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_NIST384_H
+#define CONFIG_FIELD_NIST384_H
+
+#include"core.h"
+#include "config_big_B384_56.h"
+
+// FP stuff
+
+#define MBITS_NIST384 384
+#define PM1D2_NIST384 1
+#define MODTYPE_NIST384 NOT_SPECIAL
+#define MAXXES_NIST384 8
+#define QNRI_NIST384 0
+#define RIADZ_NIST384 -12
+#define RIADZG2A_NIST384 0
+#define RIADZG2B_NIST384 0
+#define TOWER_NIST384 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_NIST384 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_NIST521.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_NIST521.h
new file mode 100644
index 0000000..eab05bc
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_NIST521.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_NIST521_H
+#define CONFIG_FIELD_NIST521_H
+
+#include"core.h"
+#include "config_big_B528_60.h"
+
+// FP stuff
+
+#define MBITS_NIST521 521
+#define PM1D2_NIST521 1
+#define MODTYPE_NIST521 PSEUDO_MERSENNE
+#define MAXXES_NIST521 19
+#define QNRI_NIST521 0
+#define RIADZ_NIST521 -4
+#define RIADZG2A_NIST521 0
+#define RIADZG2B_NIST521 0
+#define TOWER_NIST521 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_NIST521 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_SECP160R1.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_SECP160R1.h
new file mode 100644
index 0000000..144a7fc
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_SECP160R1.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_SECP160R1_H
+#define CONFIG_FIELD_SECP160R1_H
+
+#include"core.h"
+#include "config_big_B160_56.h"
+
+// FP stuff
+
+#define MBITS_SECP160R1 160
+#define PM1D2_SECP160R1 1
+#define MODTYPE_SECP160R1 NOT_SPECIAL
+#define MAXXES_SECP160R1 8
+#define QNRI_SECP160R1 0
+#define RIADZ_SECP160R1 3
+#define RIADZG2A_SECP160R1 0
+#define RIADZG2B_SECP160R1 0
+#define TOWER_SECP160R1 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_SECP160R1 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_SECP256K1.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_SECP256K1.h
new file mode 100644
index 0000000..dfdb516
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_SECP256K1.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_SECP256K1_H
+#define CONFIG_FIELD_SECP256K1_H
+
+#include"core.h"
+#include "config_big_B256_56.h"
+
+// FP stuff
+
+#define MBITS_SECP256K1 256
+#define PM1D2_SECP256K1 1
+#define MODTYPE_SECP256K1 NOT_SPECIAL
+#define MAXXES_SECP256K1 24
+#define QNRI_SECP256K1 0
+#define RIADZ_SECP256K1 -11
+#define RIADZG2A_SECP256K1 0
+#define RIADZG2B_SECP256K1 0
+#define TOWER_SECP256K1 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_SECP256K1 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_SM2.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_SM2.h
new file mode 100644
index 0000000..ff92883
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_SM2.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_SM2_H
+#define CONFIG_FIELD_SM2_H
+
+#include"core.h"
+#include "config_big_B256_56.h"
+
+// FP stuff
+
+#define MBITS_SM2 256
+#define PM1D2_SM2 1
+#define MODTYPE_SM2 NOT_SPECIAL
+#define MAXXES_SM2 24
+#define QNRI_SM2 0
+#define RIADZ_SM2 -9
+#define RIADZG2A_SM2 0
+#define RIADZG2B_SM2 0
+#define TOWER_SM2 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_SM2 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_TWEEDLEDEE.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_TWEEDLEDEE.h
new file mode 100644
index 0000000..55d7fd8
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_TWEEDLEDEE.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_TWEEDLEDEE_H
+#define CONFIG_FIELD_TWEEDLEDEE_H
+
+#include"core.h"
+#include "config_big_B256_56.h"
+
+// FP stuff
+
+#define MBITS_TWEEDLEDEE 255
+#define PM1D2_TWEEDLEDEE 34
+#define MODTYPE_TWEEDLEDEE NOT_SPECIAL
+#define MAXXES_TWEEDLEDEE 25
+#define QNRI_TWEEDLEDEE 5
+#define RIADZ_TWEEDLEDEE 1
+#define RIADZG2A_TWEEDLEDEE 0
+#define RIADZG2B_TWEEDLEDEE 0
+#define TOWER_TWEEDLEDEE NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_TWEEDLEDEE 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_TWEEDLEDUM.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_TWEEDLEDUM.h
new file mode 100644
index 0000000..5f47ddc
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/config_field_TWEEDLEDUM.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_TWEEDLEDUM_H
+#define CONFIG_FIELD_TWEEDLEDUM_H
+
+#include"core.h"
+#include "config_big_B256_56.h"
+
+// FP stuff
+
+#define MBITS_TWEEDLEDUM 255
+#define PM1D2_TWEEDLEDUM 33
+#define MODTYPE_TWEEDLEDUM NOT_SPECIAL
+#define MAXXES_TWEEDLEDUM 25
+#define QNRI_TWEEDLEDUM 5
+#define RIADZ_TWEEDLEDUM 1
+#define RIADZG2A_TWEEDLEDUM 0
+#define RIADZG2B_TWEEDLEDUM 0
+#define TOWER_TWEEDLEDUM NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_TWEEDLEDUM 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/core.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/core.h
new file mode 100644
index 0000000..a829258
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/core.h
@@ -0,0 +1,860 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CORE_H
+#define CORE_H
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <stdbool.h>
+#include <stdint.h>
+#include "arch.h"
+
+namespace core {
+
+//#define CORE_ARDUINO
+
+/* modulus types */
+
+#define NOT_SPECIAL 0	       /**< Modulus of no exploitable form */
+#define PSEUDO_MERSENNE 1      /**< Pseudo-mersenne modulus of form $2^n-c$  */
+#define MONTGOMERY_FRIENDLY 3  /**< Montgomery Friendly modulus of form $2^a(2^b-c)-1$  */
+#define GENERALISED_MERSENNE 2 /**< Generalised-mersenne modulus of form $2^n-2^m-1$, Ed448 only */
+
+/* Curve types */
+
+#define WEIERSTRASS 0 /**< Short Weierstrass form curve  */
+#define EDWARDS 1     /**< Edwards or Twisted Edwards curve  */
+#define MONTGOMERY 2  /**< Montgomery form curve  */
+
+/* Pairing-Friendly types */
+
+#define NOT_PF 0
+#define BN_CURVE 1
+#define BLS12_CURVE 2
+#define BLS24_CURVE 3
+#define BLS48_CURVE 4
+
+#define D_TYPE 0
+#define M_TYPE 1
+
+#define FP_ZILCH 0			// 0
+#define FP_UNITY 1			// 1
+#define FP_SPARSEST 2		// [[AB][c0][00]]
+#define FP_SPARSER 3		// [[AB][C0][00]]
+#define FP_SPARSE 4			// [[AB][CD][E0]]
+#define FP_DENSE 5			// [[AB][CD][EF]]
+
+#define NEGATOWER 0			// Extension field tower type
+#define POSITOWER 1
+
+/**
+ * @brief SHA256 hash function instance */
+typedef struct
+{
+    unsign32 length[2]; /**< 64-bit input length */
+    unsign32 h[8];      /**< Internal state */
+    unsign32 w[64];	/**< Internal state */
+    int hlen;		/**< Hash length in bytes */
+} hash256;
+
+/**
+ * @brief SHA384-512 hash function instance */
+typedef struct
+{
+    unsign64 length[2]; /**< 64-bit input length */
+    unsign64 h[8];      /**< Internal state */
+    unsign64 w[80];	/**< Internal state */
+    int hlen;           /**< Hash length in bytes */
+} hash512;
+
+/**
+ * @brief SHA384 hash function instance */
+typedef hash512 hash384;
+
+/**
+ * @brief SHA3 hash function instance */
+typedef struct {
+    int length;
+    unsign64 S[25];
+    int rate, len;
+} sha3;
+
+#define MC_SHA2 2
+#define MC_SHA3 3
+
+#define SHA256 32 /**< SHA-256 hashing */
+#define SHA384 48 /**< SHA-384 hashing */
+#define SHA512 64 /**< SHA-512 hashing */
+
+#define SHA3_HASH224 28 /**< SHA3 224 bit hash */
+#define SHA3_HASH256 32 /**< SHA3 256 bit hash */
+#define SHA3_HASH384 48 /**< SHA3 384 bit hash */
+#define SHA3_HASH512 64 /**< SHA3 512 bit hash */
+
+#define SHAKE128 16 /**< SHAKE128   hash */
+#define SHAKE256 32 /**< SHAKE256   hash */
+
+/* Symmetric Encryption AES structure */
+
+#define ECB   0  /**< Electronic Code Book */
+#define CBC   1  /**< Cipher Block Chaining */
+#define CFB1  2  /**< Cipher Feedback - 1 byte */
+#define CFB2  3  /**< Cipher Feedback - 2 bytes */
+#define CFB4  5  /**< Cipher Feedback - 4 bytes */
+#define OFB1  14 /**< Output Feedback - 1 byte */
+#define OFB2  15 /**< Output Feedback - 2 bytes */
+#define OFB4  17 /**< Output Feedback - 4 bytes */
+#define OFB8  21 /**< Output Feedback - 8 bytes */
+#define OFB16 29 /**< Output Feedback - 16 bytes */
+#define CTR1  30 /**< Counter Mode - 1 byte */
+#define CTR2  31 /**< Counter Mode - 2 bytes */
+#define CTR4  33 /**< Counter Mode - 4 bytes */
+#define CTR8  37 /**< Counter Mode - 8 bytes */
+#define CTR16 45 /**< Counter Mode - 16 bytes */
+
+#define uchar unsigned char  /**<  Unsigned char */
+
+/**
+	@brief AES instance
+*/
+
+
+typedef struct
+{
+    int Nk;            /**< AES Key Length */
+    int Nr;            /**< AES Number of rounds */
+    int mode;          /**< AES mode of operation */
+    unsign32 fkey[60]; /**< subkeys for encrypton */
+    unsign32 rkey[60]; /**< subkeys for decrypton */
+    char f[16];        /**< buffer for chaining vector */
+} aes;
+
+/* AES-GCM suppport.  */
+
+#define GCM_ACCEPTING_HEADER 0   /**< GCM status */
+#define GCM_ACCEPTING_CIPHER 1   /**< GCM status */
+#define GCM_NOT_ACCEPTING_MORE 2 /**< GCM status */
+#define GCM_FINISHED 3           /**< GCM status */
+#define GCM_ENCRYPTING 0         /**< GCM mode */
+#define GCM_DECRYPTING 1         /**< GCM mode */
+
+
+/**
+	@brief GCM mode instance, using AES internally
+*/
+
+typedef struct
+{
+    unsign32 table[128][4]; /**< 2k byte table */
+    uchar stateX[16];	    /**< GCM Internal State */
+    uchar Y_0[16];	    /**< GCM Internal State */
+    unsign32 lenA[2];	    /**< GCM 64-bit length of header */
+    unsign32 lenC[2];	    /**< GCM 64-bit length of ciphertext */
+    int status;		    /**< GCM Status */
+    aes a;		    /**< Internal Instance of aes cipher */
+} gcm;
+
+/* Marsaglia & Zaman Random number generator constants */
+
+#define NK   21 /**< PRNG constant */
+#define NJ   6  /**< PRNG constant */
+#define NV   8  /**< PRNG constant */
+
+
+/**
+	@brief Cryptographically secure pseudo-random number generator instance
+*/
+
+typedef struct
+{
+    unsign32 ira[NK]; /**< random number array   */
+    int      rndptr;  /**< pointer into array */
+    unsign32 borrow;  /**<  borrow as a result of subtraction */
+    int pool_ptr;     /**< pointer into random pool */
+    char pool[32];    /**< random pool */
+} csprng;
+
+
+/**
+	@brief Portable representation of a big positive number
+*/
+
+typedef struct
+{
+    int len;   /**< length in bytes  */
+    int max;   /**< max length allowed - enforce truncation  */
+    char *val; /**< byte array  */
+} octet;
+
+/**
+ * @brief Share instance */
+typedef struct
+{
+    int id;  /**< Unique Share ID */
+    int nsr; /**< number of shares required */
+    octet *B; /**< share as octet */
+} share;
+
+/* Octet string handlers */
+/**	@brief Formats and outputs an octet to the console in hex
+ *
+	@param O Octet to be output
+ */
+extern void OCT_output(octet *O);
+/**	@brief Formats and outputs an octet to the console as a character string
+ *
+	@param O Octet to be output
+ */
+extern void OCT_output_string(octet *O);
+/**	@brief Wipe clean an octet
+ *
+	@param O Octet to be cleaned
+ */
+extern void OCT_clear(octet *O);
+
+/**	@brief Reverse bytes in an octet
+ *
+	@param O Octet to be reversed
+ */
+extern void OCT_reverse(octet *O);
+
+/**	@brief Compare two octets
+ *
+	@param O first Octet to be compared
+	@param P second Octet to be compared
+	@return 1 if equal, else 0
+ */
+extern int  OCT_comp(octet *O, octet *P);
+
+
+/**	@brief Compare first n bytes of two octets
+ *
+	@param O first Octet to be compared
+	@param P second Octet to be compared
+	@param n number of bytes to compare
+	@return 1 if equal, else 0
+ */
+extern int  OCT_ncomp(octet *O, octet *P, int n);
+/**	@brief Join from a C string to end of an octet
+ *
+	Truncates if there is no room
+	@param O Octet to be written to
+	@param s zero terminated string to be joined to octet
+ */
+extern void OCT_jstring(octet *O, char *s);
+/**	@brief Join bytes to end of an octet
+ *
+	Truncates if there is no room
+	@param O Octet to be written to
+	@param s bytes to be joined to end of octet
+	@param n number of bytes to join
+ */
+extern void OCT_jbytes(octet *O, char *s, int n);
+/**	@brief Join single byte to end of an octet, repeated n times
+ *
+	Truncates if there is no room
+	@param O Octet to be written to
+	@param b byte to be joined to end of octet
+	@param n number of times b is to be joined
+ */
+extern void OCT_jbyte(octet *O, int b, int n);
+/**	@brief Join one octet to the end of another
+ *
+	Truncates if there is no room
+	@param O Octet to be written to
+	@param P Octet to be joined to the end of O
+ */
+extern void OCT_joctet(octet *O, octet *P);
+/**	@brief XOR common bytes of a pair of Octets
+ *
+	@param O Octet - on exit = O xor P
+	@param P Octet to be xored into O
+ */
+extern void OCT_xor(octet *O, octet *P);
+/**	@brief reset Octet to zero length
+ *
+	@param O Octet to be emptied
+ */
+extern void OCT_empty(octet *O);
+/**	@brief Pad out an Octet to the given length
+ *
+	Padding is done by inserting leading zeros, so abcd becomes 00abcd
+	@param O Octet to be padded
+	@param n new length of Octet
+ */
+extern int OCT_pad(octet *O, int n);
+/**	@brief Convert an Octet to printable base64 number
+ *
+	@param b zero terminated byte array to take base64 conversion
+	@param O Octet to be converted
+ */
+extern void OCT_tobase64(char *b, octet *O);
+/**	@brief Populate an Octet from base64 number
+ *
+ 	@param O Octet to be populated
+	@param b zero terminated base64 string
+
+ */
+extern void OCT_frombase64(octet *O, char *b);
+/**	@brief Copy one Octet into another
+ *
+ 	@param O Octet to be copied to
+	@param P Octet to be copied from
+
+ */
+extern void OCT_copy(octet *O, octet *P);
+/**	@brief XOR every byte of an octet with input m
+ *
+ 	@param O Octet
+	@param m byte to be XORed with every byte of O
+
+ */
+extern void OCT_xorbyte(octet *O, int m);
+/**	@brief Chops Octet into two, leaving first n bytes in O, moving the rest to P
+ *
+ 	@param O Octet to be chopped
+	@param P new Octet to be created
+	@param n number of bytes to chop off O
+
+ */
+extern void OCT_chop(octet *O, octet *P, int n);
+/**	@brief Join n bytes of integer m to end of Octet O (big endian)
+ *
+	Typically n is 4 for a 32-bit integer
+ 	@param O Octet to be appended to
+	@param m integer to be appended to O
+	@param n number of bytes in m
+
+ */
+extern void OCT_jint(octet *O, unsigned int m, int n);
+/**	@brief Create an Octet from bytes taken from a random number generator
+ *
+	Truncates if there is no room
+ 	@param O Octet to be populated
+	@param R an instance of a Cryptographically Secure Random Number Generator
+	@param n number of bytes to extracted from R
+
+ */
+extern void OCT_rand(octet *O, csprng *R, int n);
+/**	@brief Shifts Octet left by n bytes
+ *
+	Leftmost bytes disappear
+ 	@param O Octet to be shifted
+	@param n number of bytes to shift
+
+ */
+extern void OCT_shl(octet *O, int n);
+/**	@brief Convert a hex number to an Octet
+ *
+	@param dst Octet
+	@param src Hex string to be converted
+ */
+extern void OCT_fromHex(octet *dst, char *src);
+/**	@brief Convert an Octet to printable hex number
+ *
+	@param dst hex value
+	@param src Octet to be converted
+ */
+extern void OCT_toHex(octet *src, char *dst);
+/**	@brief Convert an Octet to string
+ *
+	@param dst string value
+	@param src Octet to be converted
+ */
+extern void OCT_toStr(octet *src, char *dst);
+
+
+
+/* Hash function */
+/**	@brief Initialise an instance of SHA256
+ *
+	@param H an instance SHA256
+ */
+extern void HASH256_init(hash256 *H);
+/**	@brief Add a byte to the hash
+ *
+	@param H an instance SHA256
+	@param b byte to be included in hash
+ */
+extern void HASH256_process(hash256 *H, int b);
+/**	@brief Generate 32-byte final hash
+ *
+	@param H an instance SHA256
+	@param h is the output 32-byte hash
+ */
+extern void HASH256_hash(hash256 *H, char *h);
+
+/**	@brief Generate 32-byte intermediate hash
+ *
+	@param H an instance SHA256
+	@param h is the output 32-byte hash
+ */
+extern void HASH256_continuing_hash(hash256 *H, char *h);
+
+/**	@brief Initialise an instance of SHA384
+ *
+	@param H an instance SHA384
+ */
+extern void HASH384_init(hash384 *H);
+/**	@brief Add a byte to the hash
+ *
+	@param H an instance SHA384
+	@param b byte to be included in hash
+ */
+extern void HASH384_process(hash384 *H, int b);
+/**	@brief Generate 48-byte final hash
+ *
+	@param H an instance SHA384
+	@param h is the output 48-byte hash
+ */
+extern void HASH384_hash(hash384 *H, char *h);
+
+/**	@brief Generate 48-byte intermediate hash
+ *
+	@param H an instance SHA384
+	@param h is the output 48-byte hash
+ */
+extern void HASH384_continuing_hash(hash384 *H, char *h);
+
+/**	@brief Initialise an instance of SHA512
+ *
+	@param H an instance SHA512
+ */
+extern void HASH512_init(hash512 *H);
+/**	@brief Add a byte to the hash
+ *
+	@param H an instance SHA512
+	@param b byte to be included in hash
+ */
+extern void HASH512_process(hash512 *H, int b);
+/**	@brief Generate 64-byte final hash
+ *
+	@param H an instance SHA512
+	@param h is the output 64-byte hash
+ */
+extern void HASH512_hash(hash512 *H, char *h);
+
+/**	@brief Generate 64-byte intermediate hash
+ *
+	@param H an instance SHA512
+	@param h is the output 64-byte hash
+ */
+extern void HASH512_continuing_hash(hash512 *H, char *h);
+
+/**	@brief Initialise an instance of SHA3
+ *
+	@param H an instance SHA3
+	@param t the instance type
+ */
+extern void  SHA3_init(sha3 *H, int t);
+/**	@brief process a byte for SHA3
+ *
+	@param H an instance SHA3
+	@param b a byte of date to be processed
+ */
+extern void  SHA3_process(sha3 *H, int b);
+/**	@brief create fixed length final hash output of SHA3
+ *
+	@param H an instance SHA3
+	@param h a byte array to take hash
+ */
+extern void  SHA3_hash(sha3 *H, char *h);
+
+/**	@brief create fixed length intermediate hash output of SHA3
+ *
+	@param H an instance SHA3
+	@param h a byte array to take hash
+ */
+extern void  SHA3_continuing_hash(sha3 *H, char *h);
+
+/**	@brief create variable length final hash output of SHA3
+ *
+	@param H an instance SHA3
+	@param h a byte array to take hash
+	@param len is the length of the hash
+ */
+extern void  SHA3_shake(sha3 *H, char *h, int len);
+
+/**	@brief create variable length intermediate hash output of SHA3
+ *
+	@param H an instance SHA3
+	@param h a byte array to take hash
+	@param len is the length of the hash
+ */
+extern void  SHA3_continuing_shake(sha3 *H, char *h, int len);
+
+/**	@brief generate further hash output of SHA3
+ *
+	@param H an instance SHA3
+	@param h a byte array to take hash
+	@param len is the length of the hash
+ */
+extern void  SHA3_squeeze(sha3 *H, char *h, int len);
+
+/* MAC functions */
+
+/**	@brief General Purpose Hashing function
+ *
+    @param hash the hash family (SHA2 or SHA3)
+	@param hlen the hash function output length (32,48 or 64)
+	@param w an output octet
+    @param olen the output length
+    @param pad zero padding
+    @param p an input octet
+    @param n an input 32-bit integer
+    @param x an optional input octet
+ */
+extern void GPhash(int hash,int hlen,octet *w,int olen,int pad,octet *p,int n,octet *x);
+
+/**	@brief Simple purpose Hashing function
+ *
+    @param hash the hash family (SHA2 or SHA3)
+	@param hlen the hash function output length (32,48 or 64)
+	@param w an output octet
+    @param p an input octet
+ */
+extern void SPhash(int hash, int hlen,octet *w, octet *p);
+
+/**	@brief HMAC function
+ *
+	@param T an output tag
+    @param len the tag length
+    @param K an input key, or salt
+    @param M an input message
+    @param hash the hash family (SHA2 or SHA3)
+	@param hlen the hash function output length (32,48 or 64)
+ */
+extern void HMAC(int hash,int hlen,octet *T,int len,octet *K,octet *M);
+
+
+/**	@brief HKDF_Extract function
+ *
+    @param hash the hash family (SHA2 or SHA3)
+	@param hlen the hash function output length (32,48 or 64)
+	@param K an output Key
+    @param P public input salt
+    @param S raw secret keying material
+ */
+extern void HKDF_Extract(int hash,int hlen,octet *K,octet *P,octet *S);
+
+/**	@brief HKDF_Expand function
+ *
+    @param hash the hash family (SHA2 or SHA3)
+	@param hlen the hash function output length (32,48 or 64)
+	@param E an expanded output Key
+    @param olen is the desired length of the expanded key
+    @param K is the fixed length input key
+    @param I is public context information
+
+ */
+extern void HKDF_Expand(int hash,int hlen,octet *E,int olen,octet *K,octet *I);
+
+/**	@brief XOF_Expand function
+ *
+	@param hlen the SHA3 output length (16 or 32)
+	@param E an expanded messsage
+    @param olen is the desired length of the expanded key
+    @param P is Domain Separator
+    @param S input message
+
+ */
+extern void XOF_Expand(int hlen,octet *E,int olen,octet *P,octet *S);
+
+/**	@brief XOF_Expand function
+ *
+    @param hash the hash family (SHA2 or SHA3)
+	@param hlen the SHA3 output length (16 or 32)
+	@param E an expanded messsage
+    @param olen is the desired length of the expanded key
+    @param P is Domain Separator
+    @param S input message
+
+ */
+extern void XMD_Expand(int hash,int hlen,octet *E,int olen,octet *P,octet *S);
+
+
+/** @brief PKCS V1.5 padding of a message prior to RSA signature
+ *
+    @param h is the hash type
+    @param M is the input message
+    @param W is the output encoding, ready for RSA signature
+    @return 1 if OK, else 0
+ */
+extern int PKCS15(int h, octet *M, octet *W);
+
+/** @brief Alternative PKCS V1.5 padding of a message prior to RSA signature
+ *
+    @param h is the hash type
+    @param M is the input message
+    @param W is the output encoding, ready for RSA signature
+    @return 1 if OK, else 0
+ */
+extern int PKCS15b(int h, octet *M, octet *W);
+
+/** @brief PSS padding of a message prior to RSA signature
+ *
+    @param h is the hash type
+    @param M is the input message
+    @param R is a pointer to a cryptographically secure random number generator
+    @param W is the output encoding, ready for RSA signature
+    @return 1 if OK, else 0
+ */
+extern int PSS_ENCODE(int h, octet *M, csprng *R, octet *W);
+
+/** @brief PSS verification
+ *
+    @param h is the hash type
+    @param M is the message
+    @param W is the message encoding
+    @return 1 if OK, else 0
+ */
+extern int PSS_VERIFY(int h, octet *M, octet *W);
+
+
+/** @brief OAEP padding of a message prior to RSA encryption
+ *
+    @param h is the hash type
+    @param M is the input message
+    @param R is a pointer to a cryptographically secure random number generator
+    @param P are input encoding parameter string (could be NULL)
+    @param F is the output encoding, ready for RSA encryption
+    @return 1 if OK, else 0
+ */
+extern int  OAEP_ENCODE(int h, octet *M, csprng *R, octet *P, octet *F);
+/** @brief OAEP unpadding of a message after RSA decryption
+ *
+    Unpadding is done in-place
+    @param h is the hash type
+    @param P are input encoding parameter string (could be NULL)
+    @param F is input padded message, unpadded on output
+    @return 1 if OK, else 0
+ */
+extern int  OAEP_DECODE(int h, octet *P, octet *F);
+
+/**	@brief Key Derivation Function - generates key K from inputs Z and P
+ *
+	IEEE-1363 KDF2 Key Derivation Function. 
+	@param hash is the hash family (SHA2 or SHA3)
+    @param hlen the hash function output length (32,48 or 64)
+	@param Z input octet
+	@param P input key derivation parameters - can be NULL
+	@param len is output desired length of key
+	@param K is the derived key
+ */
+extern void KDF2(int hash, int hlen, octet *K, int len, octet *Z, octet *P);
+/**	@brief Password Based Key Derivation Function - generates key K from password, salt and repeat counter
+ *
+	PBKDF2 Password Based Key Derivation Function. 
+	@param hash is the hash family (SHA2 or SHA3)
+    @param hlen the hash function output length (32,48 or 64)
+	@param P input password
+	@param S input salt
+	@param rep Number of times to be iterated.
+	@param len is output desired length
+	@param K is the derived key
+ */
+extern void PBKDF2(int hash, int hlen, octet *K, int len, octet *P, octet *S, int rep);
+
+/* AES functions */
+/**	@brief Reset AES mode or IV
+ *
+	@param A an instance of the aes
+	@param m is the new active mode of operation (ECB, CBC, OFB, CFB etc)
+	@param iv the new Initialisation Vector
+ */
+extern void AES_reset(aes *A, int m, char *iv);
+/**	@brief Extract chaining vector from aes instance
+ *
+	@param A an instance of the aes
+	@param f the extracted chaining vector
+ */
+extern void AES_getreg(aes *A, char * f);
+/**	@brief Initialise an instance of aes and its mode of operation
+ *
+	@param A an instance aes
+	@param m is the active mode of operation (ECB, CBC, OFB, CFB etc)
+	@param n is the key length in bytes, 16, 24 or 32
+	@param k the AES key as an array of 16 bytes
+	@param iv the Initialisation Vector
+	@return 0 for invalid n
+ */
+extern int AES_init(aes *A, int m, int n, char *k, char *iv);
+/**	@brief Encrypt a single 16 byte block in ECB mode
+ *
+	@param A an instance of the aes
+	@param b is an array of 16 plaintext bytes, on exit becomes ciphertext
+ */
+extern void AES_ecb_encrypt(aes *A, uchar * b);
+/**	@brief Decrypt a single 16 byte block in ECB mode
+ *
+	@param A an instance of the aes
+	@param b is an array of 16 cipherext bytes, on exit becomes plaintext
+ */
+extern void AES_ecb_decrypt(aes *A, uchar * b);
+/**	@brief Encrypt a single 16 byte block in active mode
+ *
+	@param A an instance of the aes
+	@param b is an array of 16 plaintext bytes, on exit becomes ciphertext
+	@return 0, or overflow bytes from CFB mode
+ */
+extern unsign32 AES_encrypt(aes *A, char *b );
+/**	@brief Decrypt a single 16 byte block in active mode
+ *
+	@param A an instance of the aes
+	@param b is an array of 16 ciphertext bytes, on exit becomes plaintext
+	@return 0, or overflow bytes from CFB mode
+ */
+extern unsign32 AES_decrypt(aes *A, char *b);
+/**	@brief Clean up after application of AES
+ *
+	@param A an instance of the aes
+ */
+extern void AES_end(aes *A);
+
+/**	@brief AES encrypts a plaintext to a ciphtertext
+ *
+	IEEE-1363 AES_CBC_IV0_ENCRYPT function. Encrypts in CBC mode with a zero IV, padding as necessary to create a full final block.
+	@param K AES key
+	@param P input plaintext octet
+	@param C output ciphertext octet
+ */
+extern void AES_CBC_IV0_ENCRYPT(octet *K, octet *P, octet *C);
+/**	@brief AES encrypts a plaintext to a ciphtertext
+ *
+	IEEE-1363 AES_CBC_IV0_DECRYPT function. Decrypts in CBC mode with a zero IV.
+	@param K AES key
+	@param C input ciphertext octet
+	@param P output plaintext octet
+	@return 0 if bad input, else 1
+ */
+extern int AES_CBC_IV0_DECRYPT(octet *K, octet *C, octet *P);
+
+/* AES-GCM functions */
+/**	@brief Initialise an instance of AES-GCM mode
+ *
+	@param G an instance AES-GCM
+	@param nk is the key length in bytes, 16, 24 or 32
+	@param k the AES key as an array of 16 bytes
+	@param n the number of bytes in the Initialisation Vector (IV)
+	@param iv the IV
+ */
+extern void GCM_init(gcm *G, int nk, char *k, int n, char *iv);
+/**	@brief Add header (material to be authenticated but not encrypted)
+ *
+	Note that this function can be called any number of times with n a multiple of 16, and then one last time with any value for n
+	@param G an instance AES-GCM
+	@param b is the header material to be added
+	@param n the number of bytes in the header
+ */
+extern int GCM_add_header(gcm *G, char *b, int n);
+/**	@brief Add plaintext and extract ciphertext
+ *
+	Note that this function can be called any number of times with n a multiple of 16, and then one last time with any value for n
+	@param G an instance AES-GCM
+	@param c is the ciphertext generated
+	@param p is the plaintext material to be added
+	@param n the number of bytes in the plaintext
+ */
+extern int GCM_add_plain(gcm *G, char *c, char *p, int n);
+/**	@brief Add ciphertext and extract plaintext
+ *
+	Note that this function can be called any number of times with n a multiple of 16, and then one last time with any value for n
+	@param G an instance AES-GCM
+	@param p is the plaintext generated
+	@param c is the ciphertext material to be added
+	@param n the number of bytes in the ciphertext
+ */
+extern int GCM_add_cipher(gcm *G, char *p, char *c, int n);
+/**	@brief Finish off and extract authentication tag (HMAC)
+ *
+	@param G is an active instance AES-GCM
+	@param t is the output 16 byte authentication tag
+ */
+extern void GCM_finish(gcm *G, char *t);
+
+/**	@brief AES-GCM Encryption
+ *
+	@param K  AES key
+	@param IV Initialization vector
+	@param H Header
+	@param P Plaintext
+	@param C Ciphertext
+	@param T Checksum
+ */
+void AES_GCM_ENCRYPT(octet *K, octet *IV, octet *H, octet *P, octet *C, octet *T);
+
+/**	@brief AES-GCM Decryption
+ *
+	@param K  AES key
+	@param IV Initialization vector
+	@param H Header
+	@param P Plaintext
+	@param C Ciphertext
+	@param T Checksum
+ */
+void AES_GCM_DECRYPT(octet *K, octet *IV, octet *H, octet *C, octet *P, octet *T);
+
+
+/* secret sharing */
+
+/**	@brief Get a share of a message
+ *
+    @param id unique share ID
+    @param nsr number of shares needed for message recovery
+    @param S the output share as an octet
+    @param M the Message octet to be shared
+	@param R an octet of random seed bytes
+	@return a share structure
+
+ */
+extern share getshare(int id,int nsr,octet *S,octet *M,octet *R);
+/**	@brief Recover message from shares
+ *
+    @param M the recovered Message octet
+    @param S an array of sufficient shares
+    @return 0 on success else -1
+ */
+extern int recover(octet *M,share *S);
+
+/* random numbers */
+/**	@brief Seed a random number generator from an array of bytes
+ *
+	The provided seed should be truly random
+	@param R an instance of a Cryptographically Secure Random Number Generator
+	@param n the number of seed bytes provided
+	@param b an array of seed bytes
+
+ */
+extern void RAND_seed(csprng *R, int n, char *b);
+/**	@brief Delete all internal state of a random number generator
+ *
+	@param R an instance of a Cryptographically Secure Random Number Generator
+ */
+extern void RAND_clean(csprng *R);
+/**	@brief Return a random byte from a random number generator
+ *
+	@param R an instance of a Cryptographically Secure Random Number Generator
+	@return a random byte
+ */
+extern int RAND_byte(csprng *R);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/dilithium.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/dilithium.h
new file mode 100644
index 0000000..73ccbb1
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/dilithium.h
@@ -0,0 +1,151 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* Dilithium API */
+
+#ifndef DILITHIUM_H
+#define DILITHIUM_H
+
+#include "core.h"
+
+/* DILITHIUM parameters */
+
+//q= 8380417
+#define DL_LGN 8
+#define DL_DEGREE (1 << DL_LGN)
+#define DL_PRIME 0x7fe001
+#define DL_D 13
+#define DL_TD (23-DL_D)
+
+#define DL_ONE 0x3FFE00    // R mod Q
+#define DL_COMBO 0xA3FA    // ONE*inv mod Q
+#define DL_R2MODP 0x2419FF // R^2 mod Q
+#define DL_ND 0xFC7FDFFF   // 1/(R-Q) mod R
+
+#define DL_MAXLG 19
+#define DL_MAXK 8     // could reduce these if not using highest security
+#define DL_MAXL 7
+#define DL_YBYTES (((DL_MAXLG+1)*DL_DEGREE)/8)
+
+#define DL_SK_SIZE_2 (32*3+DL_DEGREE*(4*13+4*3+4*3)/8)
+#define DL_PK_SIZE_2 ((4*DL_DEGREE*DL_TD)/8+32)
+#define DL_SIG_SIZE_2 ((DL_DEGREE*4*(17+1))/8+80+4+32)
+
+#define DL_SK_SIZE_3 (32*3+DL_DEGREE*(6*13+5*4+6*4)/8)
+#define DL_PK_SIZE_3 ((6*DL_DEGREE*DL_TD)/8+32)
+#define DL_SIG_SIZE_3 ((DL_DEGREE*5*(19+1))/8+55+6+32)
+
+#define DL_SK_SIZE_5 (32*3+DL_DEGREE*(8*13+7*3+8*3)/8)
+#define DL_PK_SIZE_5 ((8*DL_DEGREE*DL_TD)/8+32)
+#define DL_SIG_SIZE_5 ((DL_DEGREE*7*(19+1))/8+75+8+32)
+
+
+namespace core {
+
+/** @brief Dilithium signature key pair generation
+ *
+    @param tau Random Numbers
+    @param SK secret key
+    @param PK public key
+
+ */
+extern void DLTHM_keypair_2(byte *tau,octet *SK,octet *PK);
+
+/** @brief Dilithium create signature on a message 
+ *
+    @param SK secret key
+    @param M the message to be signed
+    @param SIG the output signature
+    @return numbers of attempts needed to create signature
+
+ */
+extern int DLTHM_signature_2(octet *SK,octet *M, octet *SIG);
+
+/** @brief Dilithium verify signature on a message 
+ *
+    @param PK public key key
+    @param M the signed message
+    @param SIG the signature
+    @return true if signature is good, else false
+
+ */
+extern bool DLTHM_verify_2(octet *PK,octet *M,octet *SIG);
+
+
+/** @brief Dilithium signature key pair generation
+ *
+    @param tau Random Numbers
+    @param SK secret key
+    @param PK public key
+
+ */
+extern void DLTHM_keypair_3(byte *tau,octet *SK,octet *PK);
+
+/** @brief Dilithium create signature on a message 
+ *
+    @param SK secret key
+    @param M the message to be signed
+    @param SIG the output signature
+    @return numbers of attempts needed to create signature
+
+ */
+extern int DLTHM_signature_3(octet *SK,octet *M, octet *SIG);
+
+/** @brief Dilithium verify signature on a message 
+ *
+    @param PK public key key
+    @param M the signed message
+    @param SIG the signature
+    @return true if signature is good, else false
+
+ */
+extern bool DLTHM_verify_3(octet *PK,octet *M,octet *SIG);
+
+
+/** @brief Dilithium signature key pair generation
+ *
+    @param tau Random Numbers
+    @param SK secret key
+    @param PK public key
+
+ */
+extern void DLTHM_keypair_5(byte *tau,octet *SK,octet *PK);
+
+/** @brief Dilithium create signature on a message 
+ *
+    @param SK secret key
+    @param M the message to be signed
+    @param SIG the output signature
+    @return numbers of attempts needed to create signature
+
+ */
+extern int DLTHM_signature_5(octet *SK,octet *M, octet *SIG);
+
+/** @brief Dilithium verify signature on a message 
+ *
+    @param PK public key key
+    @param M the signed message
+    @param SIG the signature
+    @return true if signature is good, else false
+
+ */
+extern bool DLTHM_verify_5(octet *PK,octet *M,octet *SIG);
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh.h
new file mode 100644
index 0000000..9e1bad1
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_ZZZ_H
+#define ECDH_ZZZ_H
+
+#include "ecp_ZZZ.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_ZZZ MODBYTES_XXX  /**< ECC Group Size in bytes */
+#define EFS_ZZZ MODBYTES_XXX  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace ZZZ {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_ANSSI.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_ANSSI.h
new file mode 100644
index 0000000..bcc0a86
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_ANSSI.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_ANSSI_H
+#define ECDH_ANSSI_H
+
+#include "ecp_ANSSI.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_ANSSI MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_ANSSI MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace ANSSI {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_BLS12381.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_BLS12381.h
new file mode 100644
index 0000000..41e2b14
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_BLS12381.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_BLS12381_H
+#define ECDH_BLS12381_H
+
+#include "ecp_BLS12381.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_BLS12381 MODBYTES_B384_58  /**< ECC Group Size in bytes */
+#define EFS_BLS12381 MODBYTES_B384_58  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace BLS12381 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_BLS12383.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_BLS12383.h
new file mode 100644
index 0000000..3139c0f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_BLS12383.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_BLS12383_H
+#define ECDH_BLS12383_H
+
+#include "ecp_BLS12383.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_BLS12383 MODBYTES_B384_58  /**< ECC Group Size in bytes */
+#define EFS_BLS12383 MODBYTES_B384_58  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace BLS12383 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_BLS12443.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_BLS12443.h
new file mode 100644
index 0000000..209b84c
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_BLS12443.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_BLS12443_H
+#define ECDH_BLS12443_H
+
+#include "ecp_BLS12443.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_BLS12443 MODBYTES_B448_60  /**< ECC Group Size in bytes */
+#define EFS_BLS12443 MODBYTES_B448_60  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace BLS12443 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_BLS12461.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_BLS12461.h
new file mode 100644
index 0000000..9459639
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_BLS12461.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_BLS12461_H
+#define ECDH_BLS12461_H
+
+#include "ecp_BLS12461.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_BLS12461 MODBYTES_B464_60  /**< ECC Group Size in bytes */
+#define EFS_BLS12461 MODBYTES_B464_60  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace BLS12461 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_BLS24479.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_BLS24479.h
new file mode 100644
index 0000000..982d94a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_BLS24479.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_BLS24479_H
+#define ECDH_BLS24479_H
+
+#include "ecp_BLS24479.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_BLS24479 MODBYTES_B480_56  /**< ECC Group Size in bytes */
+#define EFS_BLS24479 MODBYTES_B480_56  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace BLS24479 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_BLS48286.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_BLS48286.h
new file mode 100644
index 0000000..feb997a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_BLS48286.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_BLS48286_H
+#define ECDH_BLS48286_H
+
+#include "ecp_BLS48286.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_BLS48286 MODBYTES_B288_60  /**< ECC Group Size in bytes */
+#define EFS_BLS48286 MODBYTES_B288_60  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace BLS48286 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_BLS48556.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_BLS48556.h
new file mode 100644
index 0000000..495f289
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_BLS48556.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_BLS48556_H
+#define ECDH_BLS48556_H
+
+#include "ecp_BLS48556.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_BLS48556 MODBYTES_B560_58  /**< ECC Group Size in bytes */
+#define EFS_BLS48556 MODBYTES_B560_58  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace BLS48556 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_BLS48581.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_BLS48581.h
new file mode 100644
index 0000000..e886f34
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_BLS48581.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_BLS48581_H
+#define ECDH_BLS48581_H
+
+#include "ecp_BLS48581.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_BLS48581 MODBYTES_B584_60  /**< ECC Group Size in bytes */
+#define EFS_BLS48581 MODBYTES_B584_60  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace BLS48581 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_BN158.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_BN158.h
new file mode 100644
index 0000000..a6460f5
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_BN158.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_BN158_H
+#define ECDH_BN158_H
+
+#include "ecp_BN158.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_BN158 MODBYTES_B160_56  /**< ECC Group Size in bytes */
+#define EFS_BN158 MODBYTES_B160_56  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace BN158 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_BN254.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_BN254.h
new file mode 100644
index 0000000..4724c1c
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_BN254.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_BN254_H
+#define ECDH_BN254_H
+
+#include "ecp_BN254.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_BN254 MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_BN254 MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace BN254 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_BN254CX.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_BN254CX.h
new file mode 100644
index 0000000..8228481
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_BN254CX.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_BN254CX_H
+#define ECDH_BN254CX_H
+
+#include "ecp_BN254CX.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_BN254CX MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_BN254CX MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace BN254CX {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_BN462.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_BN462.h
new file mode 100644
index 0000000..ed1cdc4
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_BN462.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_BN462_H
+#define ECDH_BN462_H
+
+#include "ecp_BN462.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_BN462 MODBYTES_B464_60  /**< ECC Group Size in bytes */
+#define EFS_BN462 MODBYTES_B464_60  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace BN462 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_BRAINPOOL.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_BRAINPOOL.h
new file mode 100644
index 0000000..dced8db
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_BRAINPOOL.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_BRAINPOOL_H
+#define ECDH_BRAINPOOL_H
+
+#include "ecp_BRAINPOOL.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_BRAINPOOL MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_BRAINPOOL MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace BRAINPOOL {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_C1174.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_C1174.h
new file mode 100644
index 0000000..7fd24f5
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_C1174.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_C1174_H
+#define ECDH_C1174_H
+
+#include "ecp_C1174.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_C1174 MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_C1174 MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace C1174 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_C13318.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_C13318.h
new file mode 100644
index 0000000..ff6a4e2
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_C13318.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_C13318_H
+#define ECDH_C13318_H
+
+#include "ecp_C13318.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_C13318 MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_C13318 MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace C13318 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_C1665.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_C1665.h
new file mode 100644
index 0000000..57c7e48
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_C1665.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_C1665_H
+#define ECDH_C1665_H
+
+#include "ecp_C1665.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_C1665 MODBYTES_B168_60  /**< ECC Group Size in bytes */
+#define EFS_C1665 MODBYTES_B168_60  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace C1665 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_C25519.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_C25519.h
new file mode 100644
index 0000000..c760c91
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_C25519.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_C25519_H
+#define ECDH_C25519_H
+
+#include "ecp_C25519.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_C25519 MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_C25519 MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace C25519 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_C41417.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_C41417.h
new file mode 100644
index 0000000..0cecf4b
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_C41417.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_C41417_H
+#define ECDH_C41417_H
+
+#include "ecp_C41417.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_C41417 MODBYTES_B416_60  /**< ECC Group Size in bytes */
+#define EFS_C41417 MODBYTES_B416_60  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace C41417 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_Ed25519.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_Ed25519.h
new file mode 100644
index 0000000..cbbdb7a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_Ed25519.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_Ed25519_H
+#define ECDH_Ed25519_H
+
+#include "ecp_Ed25519.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_Ed25519 MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_Ed25519 MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace Ed25519 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_Ed448.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_Ed448.h
new file mode 100644
index 0000000..ea3be13
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_Ed448.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_Ed448_H
+#define ECDH_Ed448_H
+
+#include "ecp_Ed448.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_Ed448 MODBYTES_B448_58  /**< ECC Group Size in bytes */
+#define EFS_Ed448 MODBYTES_B448_58  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace Ed448 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_FP256BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_FP256BN.h
new file mode 100644
index 0000000..e94a04e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_FP256BN.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_FP256BN_H
+#define ECDH_FP256BN_H
+
+#include "ecp_FP256BN.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_FP256BN MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_FP256BN MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace FP256BN {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_FP512BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_FP512BN.h
new file mode 100644
index 0000000..737fa32
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_FP512BN.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_FP512BN_H
+#define ECDH_FP512BN_H
+
+#include "ecp_FP512BN.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_FP512BN MODBYTES_B512_60  /**< ECC Group Size in bytes */
+#define EFS_FP512BN MODBYTES_B512_60  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace FP512BN {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_HIFIVE.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_HIFIVE.h
new file mode 100644
index 0000000..99ef058
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_HIFIVE.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_HIFIVE_H
+#define ECDH_HIFIVE_H
+
+#include "ecp_HIFIVE.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_HIFIVE MODBYTES_B336_60  /**< ECC Group Size in bytes */
+#define EFS_HIFIVE MODBYTES_B336_60  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace HIFIVE {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_JUBJUB.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_JUBJUB.h
new file mode 100644
index 0000000..ff1f5c8
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_JUBJUB.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_JUBJUB_H
+#define ECDH_JUBJUB_H
+
+#include "ecp_JUBJUB.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_JUBJUB MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_JUBJUB MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace JUBJUB {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_MDC.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_MDC.h
new file mode 100644
index 0000000..b3c0849
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_MDC.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_MDC_H
+#define ECDH_MDC_H
+
+#include "ecp_MDC.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_MDC MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_MDC MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace MDC {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_NIST256.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_NIST256.h
new file mode 100644
index 0000000..b4b3129
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_NIST256.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_NIST256_H
+#define ECDH_NIST256_H
+
+#include "ecp_NIST256.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_NIST256 MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_NIST256 MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace NIST256 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_NIST384.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_NIST384.h
new file mode 100644
index 0000000..32d06b4
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_NIST384.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_NIST384_H
+#define ECDH_NIST384_H
+
+#include "ecp_NIST384.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_NIST384 MODBYTES_B384_56  /**< ECC Group Size in bytes */
+#define EFS_NIST384 MODBYTES_B384_56  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace NIST384 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_NIST521.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_NIST521.h
new file mode 100644
index 0000000..ca373ed
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_NIST521.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_NIST521_H
+#define ECDH_NIST521_H
+
+#include "ecp_NIST521.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_NIST521 MODBYTES_B528_60  /**< ECC Group Size in bytes */
+#define EFS_NIST521 MODBYTES_B528_60  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace NIST521 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_NUMS256E.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_NUMS256E.h
new file mode 100644
index 0000000..7b0440d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_NUMS256E.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_NUMS256E_H
+#define ECDH_NUMS256E_H
+
+#include "ecp_NUMS256E.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_NUMS256E MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_NUMS256E MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace NUMS256E {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_NUMS256W.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_NUMS256W.h
new file mode 100644
index 0000000..11f6aa1
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_NUMS256W.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_NUMS256W_H
+#define ECDH_NUMS256W_H
+
+#include "ecp_NUMS256W.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_NUMS256W MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_NUMS256W MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace NUMS256W {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_NUMS384E.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_NUMS384E.h
new file mode 100644
index 0000000..0d7da0c
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_NUMS384E.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_NUMS384E_H
+#define ECDH_NUMS384E_H
+
+#include "ecp_NUMS384E.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_NUMS384E MODBYTES_B384_58  /**< ECC Group Size in bytes */
+#define EFS_NUMS384E MODBYTES_B384_58  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace NUMS384E {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_NUMS384W.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_NUMS384W.h
new file mode 100644
index 0000000..23cb57f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_NUMS384W.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_NUMS384W_H
+#define ECDH_NUMS384W_H
+
+#include "ecp_NUMS384W.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_NUMS384W MODBYTES_B384_58  /**< ECC Group Size in bytes */
+#define EFS_NUMS384W MODBYTES_B384_58  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace NUMS384W {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_NUMS512E.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_NUMS512E.h
new file mode 100644
index 0000000..4562f9e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_NUMS512E.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_NUMS512E_H
+#define ECDH_NUMS512E_H
+
+#include "ecp_NUMS512E.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_NUMS512E MODBYTES_B512_60  /**< ECC Group Size in bytes */
+#define EFS_NUMS512E MODBYTES_B512_60  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace NUMS512E {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_NUMS512W.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_NUMS512W.h
new file mode 100644
index 0000000..f98c909
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_NUMS512W.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_NUMS512W_H
+#define ECDH_NUMS512W_H
+
+#include "ecp_NUMS512W.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_NUMS512W MODBYTES_B512_60  /**< ECC Group Size in bytes */
+#define EFS_NUMS512W MODBYTES_B512_60  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace NUMS512W {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_SECP160R1.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_SECP160R1.h
new file mode 100644
index 0000000..27652ae
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_SECP160R1.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_SECP160R1_H
+#define ECDH_SECP160R1_H
+
+#include "ecp_SECP160R1.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_SECP160R1 MODBYTES_B160_56  /**< ECC Group Size in bytes */
+#define EFS_SECP160R1 MODBYTES_B160_56  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace SECP160R1 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_SECP256K1.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_SECP256K1.h
new file mode 100644
index 0000000..adfc24c
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_SECP256K1.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_SECP256K1_H
+#define ECDH_SECP256K1_H
+
+#include "ecp_SECP256K1.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_SECP256K1 MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_SECP256K1 MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace SECP256K1 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_SM2.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_SM2.h
new file mode 100644
index 0000000..45a8dd2
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_SM2.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_SM2_H
+#define ECDH_SM2_H
+
+#include "ecp_SM2.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_SM2 MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_SM2 MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace SM2 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_TWEEDLEDEE.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_TWEEDLEDEE.h
new file mode 100644
index 0000000..1a416c6
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_TWEEDLEDEE.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_TWEEDLEDEE_H
+#define ECDH_TWEEDLEDEE_H
+
+#include "ecp_TWEEDLEDEE.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_TWEEDLEDEE MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_TWEEDLEDEE MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace TWEEDLEDEE {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_TWEEDLEDUM.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_TWEEDLEDUM.h
new file mode 100644
index 0000000..94a7f7e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_TWEEDLEDUM.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_TWEEDLEDUM_H
+#define ECDH_TWEEDLEDUM_H
+
+#include "ecp_TWEEDLEDUM.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_TWEEDLEDUM MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_TWEEDLEDUM MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace TWEEDLEDUM {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_X448.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_X448.h
new file mode 100644
index 0000000..1fa3876
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecdh_X448.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_X448_H
+#define ECDH_X448_H
+
+#include "ecp_X448.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_X448 MODBYTES_B448_58  /**< ECC Group Size in bytes */
+#define EFS_X448 MODBYTES_B448_58  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace X448 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp.h
new file mode 100644
index 0000000..a78e2c1
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_ZZZ_H
+#define ECP_ZZZ_H
+
+#include "fp_YYY.h"
+#include "config_curve_ZZZ.h"
+
+using namespace core;
+
+namespace ZZZ {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const XXX::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const XXX::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const XXX::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const XXX::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const XXX::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const XXX::BIG CURVE_Ad;
+extern const XXX::BIG CURVE_Bd;
+extern const XXX::BIG PC[];
+
+extern const XXX::BIG CURVE_Adr;
+extern const XXX::BIG CURVE_Adi;
+extern const XXX::BIG CURVE_Bdr;
+extern const XXX::BIG CURVE_Bdi;
+extern const XXX::BIG PCR[];
+extern const XXX::BIG PCI[];
+
+/* Generator point on G1 */
+extern const XXX::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const XXX::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const XXX::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const XXX::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const XXX::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const XXX::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const XXX::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const XXX::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const XXX::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const XXX::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const XXX::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const XXX::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const XXX::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    YYY::FP x; /**< x-coordinate of point */
+#if CURVETYPE_ZZZ!=MONTGOMERY
+    YYY::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    YYY::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(YYY::FP *r, YYY::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, XXX::BIG x, int s);
+
+#if CURVETYPE_ZZZ==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, XXX::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(XXX::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, XXX::BIG x, XXX::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(XXX::BIG x, XXX::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, XXX::BIG e, XXX::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, XXX::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, XXX::BIG e, XXX::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, XXX::BIG e, XXX::BIG f, XXX::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],XXX::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, YYY::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, XXX::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp2.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp2.h
new file mode 100644
index 0000000..d4daa30
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp2.h
@@ -0,0 +1,249 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP2_ZZZ_H
+#define ECP2_ZZZ_H
+
+#include "fp2_YYY.h"
+#include "config_curve_ZZZ.h"
+
+using namespace core;
+
+
+namespace YYY {
+
+extern const XXX::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const XXX::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+}
+
+namespace ZZZ {
+
+/**
+	@brief ECP2 Structure - Elliptic Curve Point over quadratic extension field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag */
+    YYY::FP2 x;   /**< x-coordinate of point */
+    YYY::FP2 y;   /**< y-coordinate of point */
+    YYY::FP2 z;   /**< z-coordinate of point */
+} ECP2;
+
+
+/* Curve Params - see rom*.cpp */
+
+extern const int CURVE_B_I;		/**< Elliptic curve B parameter */
+extern const XXX::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const XXX::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const XXX::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const XXX::BIG CURVE_Bnx;   /**< Elliptic curve parameter */
+extern const XXX::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+
+/* Generator point on G1 */
+extern const XXX::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const XXX::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const XXX::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+/* ECP2 E(Fp2) prototypes */
+/**	@brief Tests for ECP2 point equal to infinity
+ *
+	@param P ECP2 point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP2_isinf(ECP2 *P);
+/**	@brief Copy ECP2 point to another ECP2 point
+ *
+	@param P ECP2 instance, on exit = Q
+	@param Q ECP2 instance to be copied
+ */
+extern void ECP2_copy(ECP2 *P, ECP2 *Q);
+/**	@brief Set ECP2 to point-at-infinity
+ *
+	@param P ECP2 instance to be set to infinity
+ */
+extern void ECP2_inf(ECP2 *P);
+/**	@brief Tests for equality of two ECP2s
+ *
+	@param P ECP2 instance to be compared
+	@param Q ECP2 instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP2_equals(ECP2 *P, ECP2 *Q);
+/**	@brief Converts an ECP2 point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP2 instance to be converted to affine form
+ */
+extern void ECP2_affine(ECP2 *P);
+/**	@brief Extract x and y coordinates of an ECP2 point P
+ *
+	If x=y, returns only x
+	@param x FP2 on exit = x coordinate of point
+	@param y FP2 on exit = y coordinate of point (unless x=y)
+	@param P ECP2 instance (x,y)
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP2_get(YYY::FP2 *x, YYY::FP2 *y, ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, converted to affine coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_output(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, in projective coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_outputxyz(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to an octet string
+ *
+	The octet string is created in the form x|y or just x if compressed
+	Convert the real and imaginary parts of the x and y coordinates to big-endian base 256 form.
+    If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param S output octet string
+	@param P ECP2 instance to be converted to an octet string
+    @param c true for compression
+ */
+extern void ECP2_toOctet(octet *S, ECP2 *P, bool c);
+/**	@brief Creates an ECP2 point from an octet string
+ *
+	The octet string is in the form x|y
+	The real and imaginary parts of the x and y coordinates are in big-endian base 256 form.
+    If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP2 instance to be created from the octet string
+	@param S input octet string
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP2_fromOctet(ECP2 *P, octet *S);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x)=x^3+Ax+B
+	Used internally.
+	@param r FP2 value of f(x)
+	@param x FP2 instance
+ */
+extern void ECP2_rhs(YYY::FP2 *r, YYY::FP2 *x);
+/**	@brief Set ECP2 to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP2 instance to be set (x,y)
+	@param x FP2 x coordinate of point
+	@param y FP2 y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_set(ECP2 *P, YYY::FP2 *x, YYY::FP2 *y);
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Otherwise y coordinate is calculated from x.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+    @param s sign of y
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_setx(ECP2 *P, YYY::FP2 *x, int s);
+/**	@brief Negation of an ECP2 point
+ *
+	@param P ECP2 instance, on exit = -P
+ */
+extern void ECP2_neg(ECP2 *P);
+/**	@brief Doubles an ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =2*P
+ */
+extern int ECP2_dbl(ECP2 *P);
+/**	@brief Adds ECP2 instance Q to ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P+Q
+	@param Q ECP2 instance to be added to P
+ */
+extern int ECP2_add(ECP2 *P, ECP2 *Q);
+/**	@brief Subtracts ECP instance Q from ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P-Q
+	@param Q ECP2 instance to be subtracted from P
+ */
+extern void ECP2_sub(ECP2 *P, ECP2 *Q);
+/**	@brief Multiplies an ECP2 instance P by a BIG, side-channel resistant
+ *
+	Uses fixed sized windows.
+	@param P ECP2 instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP2_mul(ECP2 *P, XXX::BIG b);
+/**	@brief Multiplies an ECP2 instance P by the internal modulus p, using precalculated Frobenius constant f
+ *
+	Fast point multiplication using Frobenius
+	@param P ECP2 instance, on exit = p*P
+	@param f FP2 precalculated Frobenius constant
+
+ */
+extern void ECP2_frob(ECP2 *P, YYY::FP2 *f);
+/**	@brief Calculates P=b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+ *
+	@param P ECP2 instance, on exit = b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+	@param Q ECP2 array of 4 points
+	@param b BIG array of 4 multipliers
+ */
+extern void ECP2_mul4(ECP2 *P, ECP2 *Q, XXX::BIG *b);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP2 multiplied by co-factor
+ */
+extern void ECP2_cfp(ECP2 *Q);
+
+/**	@brief Maps random FP2 to curve point in constant time
+ *
+	@param Q ECP2 instance 
+	@param x FP2 derived from hash
+ */
+extern void ECP2_map2point(ECP2 *Q, YYY::FP2 *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP2 instance 
+	@param x Fp derived from hash
+ */
+extern void ECP2_hap2point(ECP2 *Q, XXX::BIG  x);
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param P ECP2 instance of correct order
+	@param W OCTET byte array to be mapped
+ */
+extern void ECP2_mapit(ECP2 *P, octet *w);
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP2 instance
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_generator(ECP2 *G);
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp2_BLS12381.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp2_BLS12381.h
new file mode 100644
index 0000000..fa07f8f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp2_BLS12381.h
@@ -0,0 +1,249 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP2_BLS12381_H
+#define ECP2_BLS12381_H
+
+#include "fp2_BLS12381.h"
+#include "config_curve_BLS12381.h"
+
+using namespace core;
+
+
+namespace BLS12381 {
+
+extern const B384_58::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B384_58::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+}
+
+namespace BLS12381 {
+
+/**
+	@brief ECP2 Structure - Elliptic Curve Point over quadratic extension field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag */
+    BLS12381::FP2 x;   /**< x-coordinate of point */
+    BLS12381::FP2 y;   /**< y-coordinate of point */
+    BLS12381::FP2 z;   /**< z-coordinate of point */
+} ECP2;
+
+
+/* Curve Params - see rom*.cpp */
+
+extern const int CURVE_B_I;		/**< Elliptic curve B parameter */
+extern const B384_58::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B384_58::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B384_58::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B384_58::BIG CURVE_Bnx;   /**< Elliptic curve parameter */
+extern const B384_58::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+
+/* Generator point on G1 */
+extern const B384_58::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B384_58::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B384_58::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+/* ECP2 E(Fp2) prototypes */
+/**	@brief Tests for ECP2 point equal to infinity
+ *
+	@param P ECP2 point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP2_isinf(ECP2 *P);
+/**	@brief Copy ECP2 point to another ECP2 point
+ *
+	@param P ECP2 instance, on exit = Q
+	@param Q ECP2 instance to be copied
+ */
+extern void ECP2_copy(ECP2 *P, ECP2 *Q);
+/**	@brief Set ECP2 to point-at-infinity
+ *
+	@param P ECP2 instance to be set to infinity
+ */
+extern void ECP2_inf(ECP2 *P);
+/**	@brief Tests for equality of two ECP2s
+ *
+	@param P ECP2 instance to be compared
+	@param Q ECP2 instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP2_equals(ECP2 *P, ECP2 *Q);
+/**	@brief Converts an ECP2 point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP2 instance to be converted to affine form
+ */
+extern void ECP2_affine(ECP2 *P);
+/**	@brief Extract x and y coordinates of an ECP2 point P
+ *
+	If x=y, returns only x
+	@param x FP2 on exit = x coordinate of point
+	@param y FP2 on exit = y coordinate of point (unless x=y)
+	@param P ECP2 instance (x,y)
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP2_get(BLS12381::FP2 *x, BLS12381::FP2 *y, ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, converted to affine coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_output(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, in projective coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_outputxyz(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to an octet string
+ *
+	The octet string is created in the form x|y or just x if compressed
+	Convert the real and imaginary parts of the x and y coordinates to big-endian base 256 form.
+    If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param S output octet string
+	@param P ECP2 instance to be converted to an octet string
+    @param c true for compression
+ */
+extern void ECP2_toOctet(octet *S, ECP2 *P, bool c);
+/**	@brief Creates an ECP2 point from an octet string
+ *
+	The octet string is in the form x|y
+	The real and imaginary parts of the x and y coordinates are in big-endian base 256 form.
+    If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP2 instance to be created from the octet string
+	@param S input octet string
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP2_fromOctet(ECP2 *P, octet *S);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x)=x^3+Ax+B
+	Used internally.
+	@param r FP2 value of f(x)
+	@param x FP2 instance
+ */
+extern void ECP2_rhs(BLS12381::FP2 *r, BLS12381::FP2 *x);
+/**	@brief Set ECP2 to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP2 instance to be set (x,y)
+	@param x FP2 x coordinate of point
+	@param y FP2 y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_set(ECP2 *P, BLS12381::FP2 *x, BLS12381::FP2 *y);
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Otherwise y coordinate is calculated from x.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+    @param s sign of y
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_setx(ECP2 *P, BLS12381::FP2 *x, int s);
+/**	@brief Negation of an ECP2 point
+ *
+	@param P ECP2 instance, on exit = -P
+ */
+extern void ECP2_neg(ECP2 *P);
+/**	@brief Doubles an ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =2*P
+ */
+extern int ECP2_dbl(ECP2 *P);
+/**	@brief Adds ECP2 instance Q to ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P+Q
+	@param Q ECP2 instance to be added to P
+ */
+extern int ECP2_add(ECP2 *P, ECP2 *Q);
+/**	@brief Subtracts ECP instance Q from ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P-Q
+	@param Q ECP2 instance to be subtracted from P
+ */
+extern void ECP2_sub(ECP2 *P, ECP2 *Q);
+/**	@brief Multiplies an ECP2 instance P by a BIG, side-channel resistant
+ *
+	Uses fixed sized windows.
+	@param P ECP2 instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP2_mul(ECP2 *P, B384_58::BIG b);
+/**	@brief Multiplies an ECP2 instance P by the internal modulus p, using precalculated Frobenius constant f
+ *
+	Fast point multiplication using Frobenius
+	@param P ECP2 instance, on exit = p*P
+	@param f FP2 precalculated Frobenius constant
+
+ */
+extern void ECP2_frob(ECP2 *P, BLS12381::FP2 *f);
+/**	@brief Calculates P=b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+ *
+	@param P ECP2 instance, on exit = b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+	@param Q ECP2 array of 4 points
+	@param b BIG array of 4 multipliers
+ */
+extern void ECP2_mul4(ECP2 *P, ECP2 *Q, B384_58::BIG *b);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP2 multiplied by co-factor
+ */
+extern void ECP2_cfp(ECP2 *Q);
+
+/**	@brief Maps random FP2 to curve point in constant time
+ *
+	@param Q ECP2 instance 
+	@param x FP2 derived from hash
+ */
+extern void ECP2_map2point(ECP2 *Q, BLS12381::FP2 *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP2 instance 
+	@param x Fp derived from hash
+ */
+extern void ECP2_hap2point(ECP2 *Q, B384_58::BIG  x);
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param P ECP2 instance of correct order
+	@param W OCTET byte array to be mapped
+ */
+extern void ECP2_mapit(ECP2 *P, octet *w);
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP2 instance
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_generator(ECP2 *G);
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp2_BLS12383.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp2_BLS12383.h
new file mode 100644
index 0000000..81af310
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp2_BLS12383.h
@@ -0,0 +1,249 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP2_BLS12383_H
+#define ECP2_BLS12383_H
+
+#include "fp2_BLS12383.h"
+#include "config_curve_BLS12383.h"
+
+using namespace core;
+
+
+namespace BLS12383 {
+
+extern const B384_58::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B384_58::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+}
+
+namespace BLS12383 {
+
+/**
+	@brief ECP2 Structure - Elliptic Curve Point over quadratic extension field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag */
+    BLS12383::FP2 x;   /**< x-coordinate of point */
+    BLS12383::FP2 y;   /**< y-coordinate of point */
+    BLS12383::FP2 z;   /**< z-coordinate of point */
+} ECP2;
+
+
+/* Curve Params - see rom*.cpp */
+
+extern const int CURVE_B_I;		/**< Elliptic curve B parameter */
+extern const B384_58::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B384_58::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B384_58::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B384_58::BIG CURVE_Bnx;   /**< Elliptic curve parameter */
+extern const B384_58::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+
+/* Generator point on G1 */
+extern const B384_58::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B384_58::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B384_58::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+/* ECP2 E(Fp2) prototypes */
+/**	@brief Tests for ECP2 point equal to infinity
+ *
+	@param P ECP2 point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP2_isinf(ECP2 *P);
+/**	@brief Copy ECP2 point to another ECP2 point
+ *
+	@param P ECP2 instance, on exit = Q
+	@param Q ECP2 instance to be copied
+ */
+extern void ECP2_copy(ECP2 *P, ECP2 *Q);
+/**	@brief Set ECP2 to point-at-infinity
+ *
+	@param P ECP2 instance to be set to infinity
+ */
+extern void ECP2_inf(ECP2 *P);
+/**	@brief Tests for equality of two ECP2s
+ *
+	@param P ECP2 instance to be compared
+	@param Q ECP2 instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP2_equals(ECP2 *P, ECP2 *Q);
+/**	@brief Converts an ECP2 point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP2 instance to be converted to affine form
+ */
+extern void ECP2_affine(ECP2 *P);
+/**	@brief Extract x and y coordinates of an ECP2 point P
+ *
+	If x=y, returns only x
+	@param x FP2 on exit = x coordinate of point
+	@param y FP2 on exit = y coordinate of point (unless x=y)
+	@param P ECP2 instance (x,y)
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP2_get(BLS12383::FP2 *x, BLS12383::FP2 *y, ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, converted to affine coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_output(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, in projective coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_outputxyz(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to an octet string
+ *
+	The octet string is created in the form x|y or just x if compressed
+	Convert the real and imaginary parts of the x and y coordinates to big-endian base 256 form.
+    If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param S output octet string
+	@param P ECP2 instance to be converted to an octet string
+    @param c true for compression
+ */
+extern void ECP2_toOctet(octet *S, ECP2 *P, bool c);
+/**	@brief Creates an ECP2 point from an octet string
+ *
+	The octet string is in the form x|y
+	The real and imaginary parts of the x and y coordinates are in big-endian base 256 form.
+    If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP2 instance to be created from the octet string
+	@param S input octet string
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP2_fromOctet(ECP2 *P, octet *S);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x)=x^3+Ax+B
+	Used internally.
+	@param r FP2 value of f(x)
+	@param x FP2 instance
+ */
+extern void ECP2_rhs(BLS12383::FP2 *r, BLS12383::FP2 *x);
+/**	@brief Set ECP2 to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP2 instance to be set (x,y)
+	@param x FP2 x coordinate of point
+	@param y FP2 y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_set(ECP2 *P, BLS12383::FP2 *x, BLS12383::FP2 *y);
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Otherwise y coordinate is calculated from x.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+    @param s sign of y
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_setx(ECP2 *P, BLS12383::FP2 *x, int s);
+/**	@brief Negation of an ECP2 point
+ *
+	@param P ECP2 instance, on exit = -P
+ */
+extern void ECP2_neg(ECP2 *P);
+/**	@brief Doubles an ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =2*P
+ */
+extern int ECP2_dbl(ECP2 *P);
+/**	@brief Adds ECP2 instance Q to ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P+Q
+	@param Q ECP2 instance to be added to P
+ */
+extern int ECP2_add(ECP2 *P, ECP2 *Q);
+/**	@brief Subtracts ECP instance Q from ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P-Q
+	@param Q ECP2 instance to be subtracted from P
+ */
+extern void ECP2_sub(ECP2 *P, ECP2 *Q);
+/**	@brief Multiplies an ECP2 instance P by a BIG, side-channel resistant
+ *
+	Uses fixed sized windows.
+	@param P ECP2 instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP2_mul(ECP2 *P, B384_58::BIG b);
+/**	@brief Multiplies an ECP2 instance P by the internal modulus p, using precalculated Frobenius constant f
+ *
+	Fast point multiplication using Frobenius
+	@param P ECP2 instance, on exit = p*P
+	@param f FP2 precalculated Frobenius constant
+
+ */
+extern void ECP2_frob(ECP2 *P, BLS12383::FP2 *f);
+/**	@brief Calculates P=b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+ *
+	@param P ECP2 instance, on exit = b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+	@param Q ECP2 array of 4 points
+	@param b BIG array of 4 multipliers
+ */
+extern void ECP2_mul4(ECP2 *P, ECP2 *Q, B384_58::BIG *b);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP2 multiplied by co-factor
+ */
+extern void ECP2_cfp(ECP2 *Q);
+
+/**	@brief Maps random FP2 to curve point in constant time
+ *
+	@param Q ECP2 instance 
+	@param x FP2 derived from hash
+ */
+extern void ECP2_map2point(ECP2 *Q, BLS12383::FP2 *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP2 instance 
+	@param x Fp derived from hash
+ */
+extern void ECP2_hap2point(ECP2 *Q, B384_58::BIG  x);
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param P ECP2 instance of correct order
+	@param W OCTET byte array to be mapped
+ */
+extern void ECP2_mapit(ECP2 *P, octet *w);
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP2 instance
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_generator(ECP2 *G);
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp2_BLS12443.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp2_BLS12443.h
new file mode 100644
index 0000000..cfa4d78
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp2_BLS12443.h
@@ -0,0 +1,249 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP2_BLS12443_H
+#define ECP2_BLS12443_H
+
+#include "fp2_BLS12443.h"
+#include "config_curve_BLS12443.h"
+
+using namespace core;
+
+
+namespace BLS12443 {
+
+extern const B448_60::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B448_60::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+}
+
+namespace BLS12443 {
+
+/**
+	@brief ECP2 Structure - Elliptic Curve Point over quadratic extension field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag */
+    BLS12443::FP2 x;   /**< x-coordinate of point */
+    BLS12443::FP2 y;   /**< y-coordinate of point */
+    BLS12443::FP2 z;   /**< z-coordinate of point */
+} ECP2;
+
+
+/* Curve Params - see rom*.cpp */
+
+extern const int CURVE_B_I;		/**< Elliptic curve B parameter */
+extern const B448_60::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B448_60::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B448_60::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B448_60::BIG CURVE_Bnx;   /**< Elliptic curve parameter */
+extern const B448_60::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+
+/* Generator point on G1 */
+extern const B448_60::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B448_60::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B448_60::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+/* ECP2 E(Fp2) prototypes */
+/**	@brief Tests for ECP2 point equal to infinity
+ *
+	@param P ECP2 point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP2_isinf(ECP2 *P);
+/**	@brief Copy ECP2 point to another ECP2 point
+ *
+	@param P ECP2 instance, on exit = Q
+	@param Q ECP2 instance to be copied
+ */
+extern void ECP2_copy(ECP2 *P, ECP2 *Q);
+/**	@brief Set ECP2 to point-at-infinity
+ *
+	@param P ECP2 instance to be set to infinity
+ */
+extern void ECP2_inf(ECP2 *P);
+/**	@brief Tests for equality of two ECP2s
+ *
+	@param P ECP2 instance to be compared
+	@param Q ECP2 instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP2_equals(ECP2 *P, ECP2 *Q);
+/**	@brief Converts an ECP2 point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP2 instance to be converted to affine form
+ */
+extern void ECP2_affine(ECP2 *P);
+/**	@brief Extract x and y coordinates of an ECP2 point P
+ *
+	If x=y, returns only x
+	@param x FP2 on exit = x coordinate of point
+	@param y FP2 on exit = y coordinate of point (unless x=y)
+	@param P ECP2 instance (x,y)
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP2_get(BLS12443::FP2 *x, BLS12443::FP2 *y, ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, converted to affine coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_output(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, in projective coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_outputxyz(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to an octet string
+ *
+	The octet string is created in the form x|y or just x if compressed
+	Convert the real and imaginary parts of the x and y coordinates to big-endian base 256 form.
+    If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param S output octet string
+	@param P ECP2 instance to be converted to an octet string
+    @param c true for compression
+ */
+extern void ECP2_toOctet(octet *S, ECP2 *P, bool c);
+/**	@brief Creates an ECP2 point from an octet string
+ *
+	The octet string is in the form x|y
+	The real and imaginary parts of the x and y coordinates are in big-endian base 256 form.
+    If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP2 instance to be created from the octet string
+	@param S input octet string
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP2_fromOctet(ECP2 *P, octet *S);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x)=x^3+Ax+B
+	Used internally.
+	@param r FP2 value of f(x)
+	@param x FP2 instance
+ */
+extern void ECP2_rhs(BLS12443::FP2 *r, BLS12443::FP2 *x);
+/**	@brief Set ECP2 to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP2 instance to be set (x,y)
+	@param x FP2 x coordinate of point
+	@param y FP2 y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_set(ECP2 *P, BLS12443::FP2 *x, BLS12443::FP2 *y);
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Otherwise y coordinate is calculated from x.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+    @param s sign of y
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_setx(ECP2 *P, BLS12443::FP2 *x, int s);
+/**	@brief Negation of an ECP2 point
+ *
+	@param P ECP2 instance, on exit = -P
+ */
+extern void ECP2_neg(ECP2 *P);
+/**	@brief Doubles an ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =2*P
+ */
+extern int ECP2_dbl(ECP2 *P);
+/**	@brief Adds ECP2 instance Q to ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P+Q
+	@param Q ECP2 instance to be added to P
+ */
+extern int ECP2_add(ECP2 *P, ECP2 *Q);
+/**	@brief Subtracts ECP instance Q from ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P-Q
+	@param Q ECP2 instance to be subtracted from P
+ */
+extern void ECP2_sub(ECP2 *P, ECP2 *Q);
+/**	@brief Multiplies an ECP2 instance P by a BIG, side-channel resistant
+ *
+	Uses fixed sized windows.
+	@param P ECP2 instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP2_mul(ECP2 *P, B448_60::BIG b);
+/**	@brief Multiplies an ECP2 instance P by the internal modulus p, using precalculated Frobenius constant f
+ *
+	Fast point multiplication using Frobenius
+	@param P ECP2 instance, on exit = p*P
+	@param f FP2 precalculated Frobenius constant
+
+ */
+extern void ECP2_frob(ECP2 *P, BLS12443::FP2 *f);
+/**	@brief Calculates P=b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+ *
+	@param P ECP2 instance, on exit = b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+	@param Q ECP2 array of 4 points
+	@param b BIG array of 4 multipliers
+ */
+extern void ECP2_mul4(ECP2 *P, ECP2 *Q, B448_60::BIG *b);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP2 multiplied by co-factor
+ */
+extern void ECP2_cfp(ECP2 *Q);
+
+/**	@brief Maps random FP2 to curve point in constant time
+ *
+	@param Q ECP2 instance 
+	@param x FP2 derived from hash
+ */
+extern void ECP2_map2point(ECP2 *Q, BLS12443::FP2 *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP2 instance 
+	@param x Fp derived from hash
+ */
+extern void ECP2_hap2point(ECP2 *Q, B448_60::BIG  x);
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param P ECP2 instance of correct order
+	@param W OCTET byte array to be mapped
+ */
+extern void ECP2_mapit(ECP2 *P, octet *w);
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP2 instance
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_generator(ECP2 *G);
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp2_BLS12461.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp2_BLS12461.h
new file mode 100644
index 0000000..804017e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp2_BLS12461.h
@@ -0,0 +1,249 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP2_BLS12461_H
+#define ECP2_BLS12461_H
+
+#include "fp2_BLS12461.h"
+#include "config_curve_BLS12461.h"
+
+using namespace core;
+
+
+namespace BLS12461 {
+
+extern const B464_60::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B464_60::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+}
+
+namespace BLS12461 {
+
+/**
+	@brief ECP2 Structure - Elliptic Curve Point over quadratic extension field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag */
+    BLS12461::FP2 x;   /**< x-coordinate of point */
+    BLS12461::FP2 y;   /**< y-coordinate of point */
+    BLS12461::FP2 z;   /**< z-coordinate of point */
+} ECP2;
+
+
+/* Curve Params - see rom*.cpp */
+
+extern const int CURVE_B_I;		/**< Elliptic curve B parameter */
+extern const B464_60::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B464_60::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B464_60::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B464_60::BIG CURVE_Bnx;   /**< Elliptic curve parameter */
+extern const B464_60::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+
+/* Generator point on G1 */
+extern const B464_60::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B464_60::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B464_60::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+/* ECP2 E(Fp2) prototypes */
+/**	@brief Tests for ECP2 point equal to infinity
+ *
+	@param P ECP2 point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP2_isinf(ECP2 *P);
+/**	@brief Copy ECP2 point to another ECP2 point
+ *
+	@param P ECP2 instance, on exit = Q
+	@param Q ECP2 instance to be copied
+ */
+extern void ECP2_copy(ECP2 *P, ECP2 *Q);
+/**	@brief Set ECP2 to point-at-infinity
+ *
+	@param P ECP2 instance to be set to infinity
+ */
+extern void ECP2_inf(ECP2 *P);
+/**	@brief Tests for equality of two ECP2s
+ *
+	@param P ECP2 instance to be compared
+	@param Q ECP2 instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP2_equals(ECP2 *P, ECP2 *Q);
+/**	@brief Converts an ECP2 point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP2 instance to be converted to affine form
+ */
+extern void ECP2_affine(ECP2 *P);
+/**	@brief Extract x and y coordinates of an ECP2 point P
+ *
+	If x=y, returns only x
+	@param x FP2 on exit = x coordinate of point
+	@param y FP2 on exit = y coordinate of point (unless x=y)
+	@param P ECP2 instance (x,y)
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP2_get(BLS12461::FP2 *x, BLS12461::FP2 *y, ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, converted to affine coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_output(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, in projective coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_outputxyz(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to an octet string
+ *
+	The octet string is created in the form x|y or just x if compressed
+	Convert the real and imaginary parts of the x and y coordinates to big-endian base 256 form.
+    If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param S output octet string
+	@param P ECP2 instance to be converted to an octet string
+    @param c true for compression
+ */
+extern void ECP2_toOctet(octet *S, ECP2 *P, bool c);
+/**	@brief Creates an ECP2 point from an octet string
+ *
+	The octet string is in the form x|y
+	The real and imaginary parts of the x and y coordinates are in big-endian base 256 form.
+    If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP2 instance to be created from the octet string
+	@param S input octet string
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP2_fromOctet(ECP2 *P, octet *S);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x)=x^3+Ax+B
+	Used internally.
+	@param r FP2 value of f(x)
+	@param x FP2 instance
+ */
+extern void ECP2_rhs(BLS12461::FP2 *r, BLS12461::FP2 *x);
+/**	@brief Set ECP2 to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP2 instance to be set (x,y)
+	@param x FP2 x coordinate of point
+	@param y FP2 y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_set(ECP2 *P, BLS12461::FP2 *x, BLS12461::FP2 *y);
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Otherwise y coordinate is calculated from x.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+    @param s sign of y
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_setx(ECP2 *P, BLS12461::FP2 *x, int s);
+/**	@brief Negation of an ECP2 point
+ *
+	@param P ECP2 instance, on exit = -P
+ */
+extern void ECP2_neg(ECP2 *P);
+/**	@brief Doubles an ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =2*P
+ */
+extern int ECP2_dbl(ECP2 *P);
+/**	@brief Adds ECP2 instance Q to ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P+Q
+	@param Q ECP2 instance to be added to P
+ */
+extern int ECP2_add(ECP2 *P, ECP2 *Q);
+/**	@brief Subtracts ECP instance Q from ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P-Q
+	@param Q ECP2 instance to be subtracted from P
+ */
+extern void ECP2_sub(ECP2 *P, ECP2 *Q);
+/**	@brief Multiplies an ECP2 instance P by a BIG, side-channel resistant
+ *
+	Uses fixed sized windows.
+	@param P ECP2 instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP2_mul(ECP2 *P, B464_60::BIG b);
+/**	@brief Multiplies an ECP2 instance P by the internal modulus p, using precalculated Frobenius constant f
+ *
+	Fast point multiplication using Frobenius
+	@param P ECP2 instance, on exit = p*P
+	@param f FP2 precalculated Frobenius constant
+
+ */
+extern void ECP2_frob(ECP2 *P, BLS12461::FP2 *f);
+/**	@brief Calculates P=b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+ *
+	@param P ECP2 instance, on exit = b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+	@param Q ECP2 array of 4 points
+	@param b BIG array of 4 multipliers
+ */
+extern void ECP2_mul4(ECP2 *P, ECP2 *Q, B464_60::BIG *b);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP2 multiplied by co-factor
+ */
+extern void ECP2_cfp(ECP2 *Q);
+
+/**	@brief Maps random FP2 to curve point in constant time
+ *
+	@param Q ECP2 instance 
+	@param x FP2 derived from hash
+ */
+extern void ECP2_map2point(ECP2 *Q, BLS12461::FP2 *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP2 instance 
+	@param x Fp derived from hash
+ */
+extern void ECP2_hap2point(ECP2 *Q, B464_60::BIG  x);
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param P ECP2 instance of correct order
+	@param W OCTET byte array to be mapped
+ */
+extern void ECP2_mapit(ECP2 *P, octet *w);
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP2 instance
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_generator(ECP2 *G);
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp2_BN158.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp2_BN158.h
new file mode 100644
index 0000000..a5744e3
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp2_BN158.h
@@ -0,0 +1,249 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP2_BN158_H
+#define ECP2_BN158_H
+
+#include "fp2_BN158.h"
+#include "config_curve_BN158.h"
+
+using namespace core;
+
+
+namespace BN158 {
+
+extern const B160_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B160_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+}
+
+namespace BN158 {
+
+/**
+	@brief ECP2 Structure - Elliptic Curve Point over quadratic extension field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag */
+    BN158::FP2 x;   /**< x-coordinate of point */
+    BN158::FP2 y;   /**< y-coordinate of point */
+    BN158::FP2 z;   /**< z-coordinate of point */
+} ECP2;
+
+
+/* Curve Params - see rom*.cpp */
+
+extern const int CURVE_B_I;		/**< Elliptic curve B parameter */
+extern const B160_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B160_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B160_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B160_56::BIG CURVE_Bnx;   /**< Elliptic curve parameter */
+extern const B160_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+
+/* Generator point on G1 */
+extern const B160_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B160_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B160_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+/* ECP2 E(Fp2) prototypes */
+/**	@brief Tests for ECP2 point equal to infinity
+ *
+	@param P ECP2 point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP2_isinf(ECP2 *P);
+/**	@brief Copy ECP2 point to another ECP2 point
+ *
+	@param P ECP2 instance, on exit = Q
+	@param Q ECP2 instance to be copied
+ */
+extern void ECP2_copy(ECP2 *P, ECP2 *Q);
+/**	@brief Set ECP2 to point-at-infinity
+ *
+	@param P ECP2 instance to be set to infinity
+ */
+extern void ECP2_inf(ECP2 *P);
+/**	@brief Tests for equality of two ECP2s
+ *
+	@param P ECP2 instance to be compared
+	@param Q ECP2 instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP2_equals(ECP2 *P, ECP2 *Q);
+/**	@brief Converts an ECP2 point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP2 instance to be converted to affine form
+ */
+extern void ECP2_affine(ECP2 *P);
+/**	@brief Extract x and y coordinates of an ECP2 point P
+ *
+	If x=y, returns only x
+	@param x FP2 on exit = x coordinate of point
+	@param y FP2 on exit = y coordinate of point (unless x=y)
+	@param P ECP2 instance (x,y)
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP2_get(BN158::FP2 *x, BN158::FP2 *y, ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, converted to affine coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_output(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, in projective coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_outputxyz(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to an octet string
+ *
+	The octet string is created in the form x|y or just x if compressed
+	Convert the real and imaginary parts of the x and y coordinates to big-endian base 256 form.
+    If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param S output octet string
+	@param P ECP2 instance to be converted to an octet string
+    @param c true for compression
+ */
+extern void ECP2_toOctet(octet *S, ECP2 *P, bool c);
+/**	@brief Creates an ECP2 point from an octet string
+ *
+	The octet string is in the form x|y
+	The real and imaginary parts of the x and y coordinates are in big-endian base 256 form.
+    If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP2 instance to be created from the octet string
+	@param S input octet string
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP2_fromOctet(ECP2 *P, octet *S);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x)=x^3+Ax+B
+	Used internally.
+	@param r FP2 value of f(x)
+	@param x FP2 instance
+ */
+extern void ECP2_rhs(BN158::FP2 *r, BN158::FP2 *x);
+/**	@brief Set ECP2 to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP2 instance to be set (x,y)
+	@param x FP2 x coordinate of point
+	@param y FP2 y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_set(ECP2 *P, BN158::FP2 *x, BN158::FP2 *y);
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Otherwise y coordinate is calculated from x.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+    @param s sign of y
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_setx(ECP2 *P, BN158::FP2 *x, int s);
+/**	@brief Negation of an ECP2 point
+ *
+	@param P ECP2 instance, on exit = -P
+ */
+extern void ECP2_neg(ECP2 *P);
+/**	@brief Doubles an ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =2*P
+ */
+extern int ECP2_dbl(ECP2 *P);
+/**	@brief Adds ECP2 instance Q to ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P+Q
+	@param Q ECP2 instance to be added to P
+ */
+extern int ECP2_add(ECP2 *P, ECP2 *Q);
+/**	@brief Subtracts ECP instance Q from ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P-Q
+	@param Q ECP2 instance to be subtracted from P
+ */
+extern void ECP2_sub(ECP2 *P, ECP2 *Q);
+/**	@brief Multiplies an ECP2 instance P by a BIG, side-channel resistant
+ *
+	Uses fixed sized windows.
+	@param P ECP2 instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP2_mul(ECP2 *P, B160_56::BIG b);
+/**	@brief Multiplies an ECP2 instance P by the internal modulus p, using precalculated Frobenius constant f
+ *
+	Fast point multiplication using Frobenius
+	@param P ECP2 instance, on exit = p*P
+	@param f FP2 precalculated Frobenius constant
+
+ */
+extern void ECP2_frob(ECP2 *P, BN158::FP2 *f);
+/**	@brief Calculates P=b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+ *
+	@param P ECP2 instance, on exit = b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+	@param Q ECP2 array of 4 points
+	@param b BIG array of 4 multipliers
+ */
+extern void ECP2_mul4(ECP2 *P, ECP2 *Q, B160_56::BIG *b);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP2 multiplied by co-factor
+ */
+extern void ECP2_cfp(ECP2 *Q);
+
+/**	@brief Maps random FP2 to curve point in constant time
+ *
+	@param Q ECP2 instance 
+	@param x FP2 derived from hash
+ */
+extern void ECP2_map2point(ECP2 *Q, BN158::FP2 *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP2 instance 
+	@param x Fp derived from hash
+ */
+extern void ECP2_hap2point(ECP2 *Q, B160_56::BIG  x);
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param P ECP2 instance of correct order
+	@param W OCTET byte array to be mapped
+ */
+extern void ECP2_mapit(ECP2 *P, octet *w);
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP2 instance
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_generator(ECP2 *G);
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp2_BN254.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp2_BN254.h
new file mode 100644
index 0000000..da0e4c5
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp2_BN254.h
@@ -0,0 +1,249 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP2_BN254_H
+#define ECP2_BN254_H
+
+#include "fp2_BN254.h"
+#include "config_curve_BN254.h"
+
+using namespace core;
+
+
+namespace BN254 {
+
+extern const B256_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+}
+
+namespace BN254 {
+
+/**
+	@brief ECP2 Structure - Elliptic Curve Point over quadratic extension field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag */
+    BN254::FP2 x;   /**< x-coordinate of point */
+    BN254::FP2 y;   /**< y-coordinate of point */
+    BN254::FP2 z;   /**< z-coordinate of point */
+} ECP2;
+
+
+/* Curve Params - see rom*.cpp */
+
+extern const int CURVE_B_I;		/**< Elliptic curve B parameter */
+extern const B256_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_56::BIG CURVE_Bnx;   /**< Elliptic curve parameter */
+extern const B256_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+
+/* Generator point on G1 */
+extern const B256_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+/* ECP2 E(Fp2) prototypes */
+/**	@brief Tests for ECP2 point equal to infinity
+ *
+	@param P ECP2 point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP2_isinf(ECP2 *P);
+/**	@brief Copy ECP2 point to another ECP2 point
+ *
+	@param P ECP2 instance, on exit = Q
+	@param Q ECP2 instance to be copied
+ */
+extern void ECP2_copy(ECP2 *P, ECP2 *Q);
+/**	@brief Set ECP2 to point-at-infinity
+ *
+	@param P ECP2 instance to be set to infinity
+ */
+extern void ECP2_inf(ECP2 *P);
+/**	@brief Tests for equality of two ECP2s
+ *
+	@param P ECP2 instance to be compared
+	@param Q ECP2 instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP2_equals(ECP2 *P, ECP2 *Q);
+/**	@brief Converts an ECP2 point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP2 instance to be converted to affine form
+ */
+extern void ECP2_affine(ECP2 *P);
+/**	@brief Extract x and y coordinates of an ECP2 point P
+ *
+	If x=y, returns only x
+	@param x FP2 on exit = x coordinate of point
+	@param y FP2 on exit = y coordinate of point (unless x=y)
+	@param P ECP2 instance (x,y)
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP2_get(BN254::FP2 *x, BN254::FP2 *y, ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, converted to affine coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_output(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, in projective coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_outputxyz(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to an octet string
+ *
+	The octet string is created in the form x|y or just x if compressed
+	Convert the real and imaginary parts of the x and y coordinates to big-endian base 256 form.
+    If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param S output octet string
+	@param P ECP2 instance to be converted to an octet string
+    @param c true for compression
+ */
+extern void ECP2_toOctet(octet *S, ECP2 *P, bool c);
+/**	@brief Creates an ECP2 point from an octet string
+ *
+	The octet string is in the form x|y
+	The real and imaginary parts of the x and y coordinates are in big-endian base 256 form.
+    If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP2 instance to be created from the octet string
+	@param S input octet string
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP2_fromOctet(ECP2 *P, octet *S);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x)=x^3+Ax+B
+	Used internally.
+	@param r FP2 value of f(x)
+	@param x FP2 instance
+ */
+extern void ECP2_rhs(BN254::FP2 *r, BN254::FP2 *x);
+/**	@brief Set ECP2 to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP2 instance to be set (x,y)
+	@param x FP2 x coordinate of point
+	@param y FP2 y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_set(ECP2 *P, BN254::FP2 *x, BN254::FP2 *y);
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Otherwise y coordinate is calculated from x.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+    @param s sign of y
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_setx(ECP2 *P, BN254::FP2 *x, int s);
+/**	@brief Negation of an ECP2 point
+ *
+	@param P ECP2 instance, on exit = -P
+ */
+extern void ECP2_neg(ECP2 *P);
+/**	@brief Doubles an ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =2*P
+ */
+extern int ECP2_dbl(ECP2 *P);
+/**	@brief Adds ECP2 instance Q to ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P+Q
+	@param Q ECP2 instance to be added to P
+ */
+extern int ECP2_add(ECP2 *P, ECP2 *Q);
+/**	@brief Subtracts ECP instance Q from ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P-Q
+	@param Q ECP2 instance to be subtracted from P
+ */
+extern void ECP2_sub(ECP2 *P, ECP2 *Q);
+/**	@brief Multiplies an ECP2 instance P by a BIG, side-channel resistant
+ *
+	Uses fixed sized windows.
+	@param P ECP2 instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP2_mul(ECP2 *P, B256_56::BIG b);
+/**	@brief Multiplies an ECP2 instance P by the internal modulus p, using precalculated Frobenius constant f
+ *
+	Fast point multiplication using Frobenius
+	@param P ECP2 instance, on exit = p*P
+	@param f FP2 precalculated Frobenius constant
+
+ */
+extern void ECP2_frob(ECP2 *P, BN254::FP2 *f);
+/**	@brief Calculates P=b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+ *
+	@param P ECP2 instance, on exit = b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+	@param Q ECP2 array of 4 points
+	@param b BIG array of 4 multipliers
+ */
+extern void ECP2_mul4(ECP2 *P, ECP2 *Q, B256_56::BIG *b);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP2 multiplied by co-factor
+ */
+extern void ECP2_cfp(ECP2 *Q);
+
+/**	@brief Maps random FP2 to curve point in constant time
+ *
+	@param Q ECP2 instance 
+	@param x FP2 derived from hash
+ */
+extern void ECP2_map2point(ECP2 *Q, BN254::FP2 *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP2 instance 
+	@param x Fp derived from hash
+ */
+extern void ECP2_hap2point(ECP2 *Q, B256_56::BIG  x);
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param P ECP2 instance of correct order
+	@param W OCTET byte array to be mapped
+ */
+extern void ECP2_mapit(ECP2 *P, octet *w);
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP2 instance
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_generator(ECP2 *G);
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp2_BN254CX.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp2_BN254CX.h
new file mode 100644
index 0000000..902fe59
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp2_BN254CX.h
@@ -0,0 +1,249 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP2_BN254CX_H
+#define ECP2_BN254CX_H
+
+#include "fp2_BN254CX.h"
+#include "config_curve_BN254CX.h"
+
+using namespace core;
+
+
+namespace BN254CX {
+
+extern const B256_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+}
+
+namespace BN254CX {
+
+/**
+	@brief ECP2 Structure - Elliptic Curve Point over quadratic extension field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag */
+    BN254CX::FP2 x;   /**< x-coordinate of point */
+    BN254CX::FP2 y;   /**< y-coordinate of point */
+    BN254CX::FP2 z;   /**< z-coordinate of point */
+} ECP2;
+
+
+/* Curve Params - see rom*.cpp */
+
+extern const int CURVE_B_I;		/**< Elliptic curve B parameter */
+extern const B256_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_56::BIG CURVE_Bnx;   /**< Elliptic curve parameter */
+extern const B256_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+
+/* Generator point on G1 */
+extern const B256_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+/* ECP2 E(Fp2) prototypes */
+/**	@brief Tests for ECP2 point equal to infinity
+ *
+	@param P ECP2 point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP2_isinf(ECP2 *P);
+/**	@brief Copy ECP2 point to another ECP2 point
+ *
+	@param P ECP2 instance, on exit = Q
+	@param Q ECP2 instance to be copied
+ */
+extern void ECP2_copy(ECP2 *P, ECP2 *Q);
+/**	@brief Set ECP2 to point-at-infinity
+ *
+	@param P ECP2 instance to be set to infinity
+ */
+extern void ECP2_inf(ECP2 *P);
+/**	@brief Tests for equality of two ECP2s
+ *
+	@param P ECP2 instance to be compared
+	@param Q ECP2 instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP2_equals(ECP2 *P, ECP2 *Q);
+/**	@brief Converts an ECP2 point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP2 instance to be converted to affine form
+ */
+extern void ECP2_affine(ECP2 *P);
+/**	@brief Extract x and y coordinates of an ECP2 point P
+ *
+	If x=y, returns only x
+	@param x FP2 on exit = x coordinate of point
+	@param y FP2 on exit = y coordinate of point (unless x=y)
+	@param P ECP2 instance (x,y)
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP2_get(BN254CX::FP2 *x, BN254CX::FP2 *y, ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, converted to affine coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_output(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, in projective coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_outputxyz(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to an octet string
+ *
+	The octet string is created in the form x|y or just x if compressed
+	Convert the real and imaginary parts of the x and y coordinates to big-endian base 256 form.
+    If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param S output octet string
+	@param P ECP2 instance to be converted to an octet string
+    @param c true for compression
+ */
+extern void ECP2_toOctet(octet *S, ECP2 *P, bool c);
+/**	@brief Creates an ECP2 point from an octet string
+ *
+	The octet string is in the form x|y
+	The real and imaginary parts of the x and y coordinates are in big-endian base 256 form.
+    If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP2 instance to be created from the octet string
+	@param S input octet string
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP2_fromOctet(ECP2 *P, octet *S);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x)=x^3+Ax+B
+	Used internally.
+	@param r FP2 value of f(x)
+	@param x FP2 instance
+ */
+extern void ECP2_rhs(BN254CX::FP2 *r, BN254CX::FP2 *x);
+/**	@brief Set ECP2 to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP2 instance to be set (x,y)
+	@param x FP2 x coordinate of point
+	@param y FP2 y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_set(ECP2 *P, BN254CX::FP2 *x, BN254CX::FP2 *y);
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Otherwise y coordinate is calculated from x.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+    @param s sign of y
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_setx(ECP2 *P, BN254CX::FP2 *x, int s);
+/**	@brief Negation of an ECP2 point
+ *
+	@param P ECP2 instance, on exit = -P
+ */
+extern void ECP2_neg(ECP2 *P);
+/**	@brief Doubles an ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =2*P
+ */
+extern int ECP2_dbl(ECP2 *P);
+/**	@brief Adds ECP2 instance Q to ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P+Q
+	@param Q ECP2 instance to be added to P
+ */
+extern int ECP2_add(ECP2 *P, ECP2 *Q);
+/**	@brief Subtracts ECP instance Q from ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P-Q
+	@param Q ECP2 instance to be subtracted from P
+ */
+extern void ECP2_sub(ECP2 *P, ECP2 *Q);
+/**	@brief Multiplies an ECP2 instance P by a BIG, side-channel resistant
+ *
+	Uses fixed sized windows.
+	@param P ECP2 instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP2_mul(ECP2 *P, B256_56::BIG b);
+/**	@brief Multiplies an ECP2 instance P by the internal modulus p, using precalculated Frobenius constant f
+ *
+	Fast point multiplication using Frobenius
+	@param P ECP2 instance, on exit = p*P
+	@param f FP2 precalculated Frobenius constant
+
+ */
+extern void ECP2_frob(ECP2 *P, BN254CX::FP2 *f);
+/**	@brief Calculates P=b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+ *
+	@param P ECP2 instance, on exit = b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+	@param Q ECP2 array of 4 points
+	@param b BIG array of 4 multipliers
+ */
+extern void ECP2_mul4(ECP2 *P, ECP2 *Q, B256_56::BIG *b);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP2 multiplied by co-factor
+ */
+extern void ECP2_cfp(ECP2 *Q);
+
+/**	@brief Maps random FP2 to curve point in constant time
+ *
+	@param Q ECP2 instance 
+	@param x FP2 derived from hash
+ */
+extern void ECP2_map2point(ECP2 *Q, BN254CX::FP2 *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP2 instance 
+	@param x Fp derived from hash
+ */
+extern void ECP2_hap2point(ECP2 *Q, B256_56::BIG  x);
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param P ECP2 instance of correct order
+	@param W OCTET byte array to be mapped
+ */
+extern void ECP2_mapit(ECP2 *P, octet *w);
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP2 instance
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_generator(ECP2 *G);
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp2_BN462.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp2_BN462.h
new file mode 100644
index 0000000..68bf8e8
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp2_BN462.h
@@ -0,0 +1,249 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP2_BN462_H
+#define ECP2_BN462_H
+
+#include "fp2_BN462.h"
+#include "config_curve_BN462.h"
+
+using namespace core;
+
+
+namespace BN462 {
+
+extern const B464_60::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B464_60::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+}
+
+namespace BN462 {
+
+/**
+	@brief ECP2 Structure - Elliptic Curve Point over quadratic extension field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag */
+    BN462::FP2 x;   /**< x-coordinate of point */
+    BN462::FP2 y;   /**< y-coordinate of point */
+    BN462::FP2 z;   /**< z-coordinate of point */
+} ECP2;
+
+
+/* Curve Params - see rom*.cpp */
+
+extern const int CURVE_B_I;		/**< Elliptic curve B parameter */
+extern const B464_60::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B464_60::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B464_60::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B464_60::BIG CURVE_Bnx;   /**< Elliptic curve parameter */
+extern const B464_60::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+
+/* Generator point on G1 */
+extern const B464_60::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B464_60::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B464_60::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+/* ECP2 E(Fp2) prototypes */
+/**	@brief Tests for ECP2 point equal to infinity
+ *
+	@param P ECP2 point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP2_isinf(ECP2 *P);
+/**	@brief Copy ECP2 point to another ECP2 point
+ *
+	@param P ECP2 instance, on exit = Q
+	@param Q ECP2 instance to be copied
+ */
+extern void ECP2_copy(ECP2 *P, ECP2 *Q);
+/**	@brief Set ECP2 to point-at-infinity
+ *
+	@param P ECP2 instance to be set to infinity
+ */
+extern void ECP2_inf(ECP2 *P);
+/**	@brief Tests for equality of two ECP2s
+ *
+	@param P ECP2 instance to be compared
+	@param Q ECP2 instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP2_equals(ECP2 *P, ECP2 *Q);
+/**	@brief Converts an ECP2 point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP2 instance to be converted to affine form
+ */
+extern void ECP2_affine(ECP2 *P);
+/**	@brief Extract x and y coordinates of an ECP2 point P
+ *
+	If x=y, returns only x
+	@param x FP2 on exit = x coordinate of point
+	@param y FP2 on exit = y coordinate of point (unless x=y)
+	@param P ECP2 instance (x,y)
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP2_get(BN462::FP2 *x, BN462::FP2 *y, ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, converted to affine coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_output(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, in projective coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_outputxyz(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to an octet string
+ *
+	The octet string is created in the form x|y or just x if compressed
+	Convert the real and imaginary parts of the x and y coordinates to big-endian base 256 form.
+    If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param S output octet string
+	@param P ECP2 instance to be converted to an octet string
+    @param c true for compression
+ */
+extern void ECP2_toOctet(octet *S, ECP2 *P, bool c);
+/**	@brief Creates an ECP2 point from an octet string
+ *
+	The octet string is in the form x|y
+	The real and imaginary parts of the x and y coordinates are in big-endian base 256 form.
+    If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP2 instance to be created from the octet string
+	@param S input octet string
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP2_fromOctet(ECP2 *P, octet *S);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x)=x^3+Ax+B
+	Used internally.
+	@param r FP2 value of f(x)
+	@param x FP2 instance
+ */
+extern void ECP2_rhs(BN462::FP2 *r, BN462::FP2 *x);
+/**	@brief Set ECP2 to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP2 instance to be set (x,y)
+	@param x FP2 x coordinate of point
+	@param y FP2 y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_set(ECP2 *P, BN462::FP2 *x, BN462::FP2 *y);
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Otherwise y coordinate is calculated from x.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+    @param s sign of y
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_setx(ECP2 *P, BN462::FP2 *x, int s);
+/**	@brief Negation of an ECP2 point
+ *
+	@param P ECP2 instance, on exit = -P
+ */
+extern void ECP2_neg(ECP2 *P);
+/**	@brief Doubles an ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =2*P
+ */
+extern int ECP2_dbl(ECP2 *P);
+/**	@brief Adds ECP2 instance Q to ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P+Q
+	@param Q ECP2 instance to be added to P
+ */
+extern int ECP2_add(ECP2 *P, ECP2 *Q);
+/**	@brief Subtracts ECP instance Q from ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P-Q
+	@param Q ECP2 instance to be subtracted from P
+ */
+extern void ECP2_sub(ECP2 *P, ECP2 *Q);
+/**	@brief Multiplies an ECP2 instance P by a BIG, side-channel resistant
+ *
+	Uses fixed sized windows.
+	@param P ECP2 instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP2_mul(ECP2 *P, B464_60::BIG b);
+/**	@brief Multiplies an ECP2 instance P by the internal modulus p, using precalculated Frobenius constant f
+ *
+	Fast point multiplication using Frobenius
+	@param P ECP2 instance, on exit = p*P
+	@param f FP2 precalculated Frobenius constant
+
+ */
+extern void ECP2_frob(ECP2 *P, BN462::FP2 *f);
+/**	@brief Calculates P=b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+ *
+	@param P ECP2 instance, on exit = b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+	@param Q ECP2 array of 4 points
+	@param b BIG array of 4 multipliers
+ */
+extern void ECP2_mul4(ECP2 *P, ECP2 *Q, B464_60::BIG *b);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP2 multiplied by co-factor
+ */
+extern void ECP2_cfp(ECP2 *Q);
+
+/**	@brief Maps random FP2 to curve point in constant time
+ *
+	@param Q ECP2 instance 
+	@param x FP2 derived from hash
+ */
+extern void ECP2_map2point(ECP2 *Q, BN462::FP2 *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP2 instance 
+	@param x Fp derived from hash
+ */
+extern void ECP2_hap2point(ECP2 *Q, B464_60::BIG  x);
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param P ECP2 instance of correct order
+	@param W OCTET byte array to be mapped
+ */
+extern void ECP2_mapit(ECP2 *P, octet *w);
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP2 instance
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_generator(ECP2 *G);
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp2_FP256BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp2_FP256BN.h
new file mode 100644
index 0000000..3f93480
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp2_FP256BN.h
@@ -0,0 +1,249 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP2_FP256BN_H
+#define ECP2_FP256BN_H
+
+#include "fp2_FP256BN.h"
+#include "config_curve_FP256BN.h"
+
+using namespace core;
+
+
+namespace FP256BN {
+
+extern const B256_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+}
+
+namespace FP256BN {
+
+/**
+	@brief ECP2 Structure - Elliptic Curve Point over quadratic extension field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag */
+    FP256BN::FP2 x;   /**< x-coordinate of point */
+    FP256BN::FP2 y;   /**< y-coordinate of point */
+    FP256BN::FP2 z;   /**< z-coordinate of point */
+} ECP2;
+
+
+/* Curve Params - see rom*.cpp */
+
+extern const int CURVE_B_I;		/**< Elliptic curve B parameter */
+extern const B256_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_56::BIG CURVE_Bnx;   /**< Elliptic curve parameter */
+extern const B256_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+
+/* Generator point on G1 */
+extern const B256_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+/* ECP2 E(Fp2) prototypes */
+/**	@brief Tests for ECP2 point equal to infinity
+ *
+	@param P ECP2 point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP2_isinf(ECP2 *P);
+/**	@brief Copy ECP2 point to another ECP2 point
+ *
+	@param P ECP2 instance, on exit = Q
+	@param Q ECP2 instance to be copied
+ */
+extern void ECP2_copy(ECP2 *P, ECP2 *Q);
+/**	@brief Set ECP2 to point-at-infinity
+ *
+	@param P ECP2 instance to be set to infinity
+ */
+extern void ECP2_inf(ECP2 *P);
+/**	@brief Tests for equality of two ECP2s
+ *
+	@param P ECP2 instance to be compared
+	@param Q ECP2 instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP2_equals(ECP2 *P, ECP2 *Q);
+/**	@brief Converts an ECP2 point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP2 instance to be converted to affine form
+ */
+extern void ECP2_affine(ECP2 *P);
+/**	@brief Extract x and y coordinates of an ECP2 point P
+ *
+	If x=y, returns only x
+	@param x FP2 on exit = x coordinate of point
+	@param y FP2 on exit = y coordinate of point (unless x=y)
+	@param P ECP2 instance (x,y)
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP2_get(FP256BN::FP2 *x, FP256BN::FP2 *y, ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, converted to affine coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_output(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, in projective coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_outputxyz(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to an octet string
+ *
+	The octet string is created in the form x|y or just x if compressed
+	Convert the real and imaginary parts of the x and y coordinates to big-endian base 256 form.
+    If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param S output octet string
+	@param P ECP2 instance to be converted to an octet string
+    @param c true for compression
+ */
+extern void ECP2_toOctet(octet *S, ECP2 *P, bool c);
+/**	@brief Creates an ECP2 point from an octet string
+ *
+	The octet string is in the form x|y
+	The real and imaginary parts of the x and y coordinates are in big-endian base 256 form.
+    If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP2 instance to be created from the octet string
+	@param S input octet string
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP2_fromOctet(ECP2 *P, octet *S);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x)=x^3+Ax+B
+	Used internally.
+	@param r FP2 value of f(x)
+	@param x FP2 instance
+ */
+extern void ECP2_rhs(FP256BN::FP2 *r, FP256BN::FP2 *x);
+/**	@brief Set ECP2 to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP2 instance to be set (x,y)
+	@param x FP2 x coordinate of point
+	@param y FP2 y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_set(ECP2 *P, FP256BN::FP2 *x, FP256BN::FP2 *y);
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Otherwise y coordinate is calculated from x.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+    @param s sign of y
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_setx(ECP2 *P, FP256BN::FP2 *x, int s);
+/**	@brief Negation of an ECP2 point
+ *
+	@param P ECP2 instance, on exit = -P
+ */
+extern void ECP2_neg(ECP2 *P);
+/**	@brief Doubles an ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =2*P
+ */
+extern int ECP2_dbl(ECP2 *P);
+/**	@brief Adds ECP2 instance Q to ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P+Q
+	@param Q ECP2 instance to be added to P
+ */
+extern int ECP2_add(ECP2 *P, ECP2 *Q);
+/**	@brief Subtracts ECP instance Q from ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P-Q
+	@param Q ECP2 instance to be subtracted from P
+ */
+extern void ECP2_sub(ECP2 *P, ECP2 *Q);
+/**	@brief Multiplies an ECP2 instance P by a BIG, side-channel resistant
+ *
+	Uses fixed sized windows.
+	@param P ECP2 instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP2_mul(ECP2 *P, B256_56::BIG b);
+/**	@brief Multiplies an ECP2 instance P by the internal modulus p, using precalculated Frobenius constant f
+ *
+	Fast point multiplication using Frobenius
+	@param P ECP2 instance, on exit = p*P
+	@param f FP2 precalculated Frobenius constant
+
+ */
+extern void ECP2_frob(ECP2 *P, FP256BN::FP2 *f);
+/**	@brief Calculates P=b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+ *
+	@param P ECP2 instance, on exit = b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+	@param Q ECP2 array of 4 points
+	@param b BIG array of 4 multipliers
+ */
+extern void ECP2_mul4(ECP2 *P, ECP2 *Q, B256_56::BIG *b);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP2 multiplied by co-factor
+ */
+extern void ECP2_cfp(ECP2 *Q);
+
+/**	@brief Maps random FP2 to curve point in constant time
+ *
+	@param Q ECP2 instance 
+	@param x FP2 derived from hash
+ */
+extern void ECP2_map2point(ECP2 *Q, FP256BN::FP2 *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP2 instance 
+	@param x Fp derived from hash
+ */
+extern void ECP2_hap2point(ECP2 *Q, B256_56::BIG  x);
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param P ECP2 instance of correct order
+	@param W OCTET byte array to be mapped
+ */
+extern void ECP2_mapit(ECP2 *P, octet *w);
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP2 instance
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_generator(ECP2 *G);
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp2_FP512BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp2_FP512BN.h
new file mode 100644
index 0000000..f18a652
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp2_FP512BN.h
@@ -0,0 +1,249 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP2_FP512BN_H
+#define ECP2_FP512BN_H
+
+#include "fp2_FP512BN.h"
+#include "config_curve_FP512BN.h"
+
+using namespace core;
+
+
+namespace FP512BN {
+
+extern const B512_60::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B512_60::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+}
+
+namespace FP512BN {
+
+/**
+	@brief ECP2 Structure - Elliptic Curve Point over quadratic extension field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag */
+    FP512BN::FP2 x;   /**< x-coordinate of point */
+    FP512BN::FP2 y;   /**< y-coordinate of point */
+    FP512BN::FP2 z;   /**< z-coordinate of point */
+} ECP2;
+
+
+/* Curve Params - see rom*.cpp */
+
+extern const int CURVE_B_I;		/**< Elliptic curve B parameter */
+extern const B512_60::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B512_60::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B512_60::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B512_60::BIG CURVE_Bnx;   /**< Elliptic curve parameter */
+extern const B512_60::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+
+/* Generator point on G1 */
+extern const B512_60::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B512_60::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B512_60::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+/* ECP2 E(Fp2) prototypes */
+/**	@brief Tests for ECP2 point equal to infinity
+ *
+	@param P ECP2 point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP2_isinf(ECP2 *P);
+/**	@brief Copy ECP2 point to another ECP2 point
+ *
+	@param P ECP2 instance, on exit = Q
+	@param Q ECP2 instance to be copied
+ */
+extern void ECP2_copy(ECP2 *P, ECP2 *Q);
+/**	@brief Set ECP2 to point-at-infinity
+ *
+	@param P ECP2 instance to be set to infinity
+ */
+extern void ECP2_inf(ECP2 *P);
+/**	@brief Tests for equality of two ECP2s
+ *
+	@param P ECP2 instance to be compared
+	@param Q ECP2 instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP2_equals(ECP2 *P, ECP2 *Q);
+/**	@brief Converts an ECP2 point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP2 instance to be converted to affine form
+ */
+extern void ECP2_affine(ECP2 *P);
+/**	@brief Extract x and y coordinates of an ECP2 point P
+ *
+	If x=y, returns only x
+	@param x FP2 on exit = x coordinate of point
+	@param y FP2 on exit = y coordinate of point (unless x=y)
+	@param P ECP2 instance (x,y)
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP2_get(FP512BN::FP2 *x, FP512BN::FP2 *y, ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, converted to affine coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_output(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, in projective coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_outputxyz(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to an octet string
+ *
+	The octet string is created in the form x|y or just x if compressed
+	Convert the real and imaginary parts of the x and y coordinates to big-endian base 256 form.
+    If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param S output octet string
+	@param P ECP2 instance to be converted to an octet string
+    @param c true for compression
+ */
+extern void ECP2_toOctet(octet *S, ECP2 *P, bool c);
+/**	@brief Creates an ECP2 point from an octet string
+ *
+	The octet string is in the form x|y
+	The real and imaginary parts of the x and y coordinates are in big-endian base 256 form.
+    If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP2 instance to be created from the octet string
+	@param S input octet string
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP2_fromOctet(ECP2 *P, octet *S);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x)=x^3+Ax+B
+	Used internally.
+	@param r FP2 value of f(x)
+	@param x FP2 instance
+ */
+extern void ECP2_rhs(FP512BN::FP2 *r, FP512BN::FP2 *x);
+/**	@brief Set ECP2 to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP2 instance to be set (x,y)
+	@param x FP2 x coordinate of point
+	@param y FP2 y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_set(ECP2 *P, FP512BN::FP2 *x, FP512BN::FP2 *y);
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Otherwise y coordinate is calculated from x.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+    @param s sign of y
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_setx(ECP2 *P, FP512BN::FP2 *x, int s);
+/**	@brief Negation of an ECP2 point
+ *
+	@param P ECP2 instance, on exit = -P
+ */
+extern void ECP2_neg(ECP2 *P);
+/**	@brief Doubles an ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =2*P
+ */
+extern int ECP2_dbl(ECP2 *P);
+/**	@brief Adds ECP2 instance Q to ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P+Q
+	@param Q ECP2 instance to be added to P
+ */
+extern int ECP2_add(ECP2 *P, ECP2 *Q);
+/**	@brief Subtracts ECP instance Q from ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P-Q
+	@param Q ECP2 instance to be subtracted from P
+ */
+extern void ECP2_sub(ECP2 *P, ECP2 *Q);
+/**	@brief Multiplies an ECP2 instance P by a BIG, side-channel resistant
+ *
+	Uses fixed sized windows.
+	@param P ECP2 instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP2_mul(ECP2 *P, B512_60::BIG b);
+/**	@brief Multiplies an ECP2 instance P by the internal modulus p, using precalculated Frobenius constant f
+ *
+	Fast point multiplication using Frobenius
+	@param P ECP2 instance, on exit = p*P
+	@param f FP2 precalculated Frobenius constant
+
+ */
+extern void ECP2_frob(ECP2 *P, FP512BN::FP2 *f);
+/**	@brief Calculates P=b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+ *
+	@param P ECP2 instance, on exit = b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+	@param Q ECP2 array of 4 points
+	@param b BIG array of 4 multipliers
+ */
+extern void ECP2_mul4(ECP2 *P, ECP2 *Q, B512_60::BIG *b);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP2 multiplied by co-factor
+ */
+extern void ECP2_cfp(ECP2 *Q);
+
+/**	@brief Maps random FP2 to curve point in constant time
+ *
+	@param Q ECP2 instance 
+	@param x FP2 derived from hash
+ */
+extern void ECP2_map2point(ECP2 *Q, FP512BN::FP2 *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP2 instance 
+	@param x Fp derived from hash
+ */
+extern void ECP2_hap2point(ECP2 *Q, B512_60::BIG  x);
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param P ECP2 instance of correct order
+	@param W OCTET byte array to be mapped
+ */
+extern void ECP2_mapit(ECP2 *P, octet *w);
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP2 instance
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_generator(ECP2 *G);
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp4.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp4.h
new file mode 100644
index 0000000..27b6475
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp4.h
@@ -0,0 +1,268 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP4_ZZZ_H
+#define ECP4_ZZZ_H
+
+#include "fp4_YYY.h"
+#include "config_curve_ZZZ.h"
+
+using namespace core;
+
+namespace YYY {
+
+extern const XXX::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const XXX::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+}
+
+namespace ZZZ {
+
+/**
+	@brief ECP4 Structure - Elliptic Curve Point over quadratic extension field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag */
+    YYY::FP4 x;   /**< x-coordinate of point */
+    YYY::FP4 y;   /**< y-coordinate of point */
+    YYY::FP4 z;   /**< z-coordinate of point */
+} ECP4;
+
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;		/**< Elliptic curve B parameter */
+extern const XXX::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const XXX::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const XXX::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const XXX::BIG CURVE_Bnx;   /**< Elliptic curve parameter */
+extern const XXX::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+
+/* Generator point on G1 */
+extern const XXX::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const XXX::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const XXX::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/* ECP4 E(FP4) prototypes */
+/**	@brief Tests for ECP4 point equal to infinity
+ *
+	@param P ECP4 point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP4_isinf(ECP4 *P);
+/**	@brief Copy ECP4 point to another ECP4 point
+ *
+	@param P ECP4 instance, on exit = Q
+	@param Q ECP4 instance to be copied
+ */
+extern void ECP4_copy(ECP4 *P, ECP4 *Q);
+/**	@brief Set ECP4 to point-at-infinity
+ *
+	@param P ECP4 instance to be set to infinity
+ */
+extern void ECP4_inf(ECP4 *P);
+/**	@brief Tests for equality of two ECP4s
+ *
+	@param P ECP4 instance to be compared
+	@param Q ECP4 instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP4_equals(ECP4 *P, ECP4 *Q);
+
+/**	@brief Converts an ECP4 point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP4 instance to be converted to affine form
+ */
+extern void ECP4_affine(ECP4 *P);
+
+
+/**	@brief Extract x and y coordinates of an ECP4 point P
+ *
+	If x=y, returns only x
+	@param x FP4 on exit = x coordinate of point
+	@param y FP4 on exit = y coordinate of point (unless x=y)
+	@param P ECP4 instance (x,y)
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP4_get(YYY::FP4 *x, YYY::FP4 *y, ECP4 *P);
+/**	@brief Formats and outputs an ECP4 point to the console, converted to affine coordinates
+ *
+	@param P ECP4 instance to be printed
+ */
+extern void ECP4_output(ECP4 *P);
+
+/**	@brief Formats and outputs an ECP4 point to an octet string
+ *
+	The octet string is created in the form x|y or just x if compressed
+	Convert the real and imaginary parts of the x and y coordinates to big-endian base 256 form.
+	@param S output octet string
+	@param P ECP4 instance to be converted to an octet string
+    @param c true for compression
+ */
+extern void ECP4_toOctet(octet *S, ECP4 *P, bool c);
+/**	@brief Creates an ECP4 point from an octet string
+ *
+	The octet string is in the form x|y
+	The real and imaginary parts of the x and y coordinates are in big-endian base 256 form.
+	@param P ECP4 instance to be created from the octet string
+	@param S input octet string
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP4_fromOctet(ECP4 *P, octet *S);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x)=x^3+Ax+B
+	Used internally.
+	@param r FP4 value of f(x)
+	@param x FP4 instance
+ */
+extern void ECP4_rhs(YYY::FP4 *r, YYY::FP4 *x);
+/**	@brief Set ECP4 to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP4 instance to be set (x,y)
+	@param x FP4 x coordinate of point
+	@param y FP4 y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP4_set(ECP4 *P, YYY::FP4 *x, YYY::FP4 *y);
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Otherwise y coordinate is calculated from x.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+    @param s sign of y
+	@return 1 if point exists, else 0
+ */
+extern int ECP4_setx(ECP4 *P, YYY::FP4 *x, int s);
+/**	@brief Negation of an ECP4 point
+ *
+	@param P ECP4 instance, on exit = -P
+ */
+extern void ECP4_neg(ECP4 *P);
+
+/**	@brief Reduction of an ECP4 point
+ *
+	@param P ECP4 instance, on exit (x,y) are reduced wrt the modulus
+ */
+extern void ECP4_reduce(ECP4 *P);
+
+
+/**	@brief Doubles an ECP4 instance P
+ *
+	@param P ECP4 instance, on exit =2*P
+ */
+extern int ECP4_dbl(ECP4 *P);
+/**	@brief Adds ECP4 instance Q to ECP4 instance P
+ *
+	@param P ECP4 instance, on exit =P+Q
+	@param Q ECP4 instance to be added to P
+ */
+extern int ECP4_add(ECP4 *P, ECP4 *Q);
+/**	@brief Subtracts ECP instance Q from ECP4 instance P
+ *
+	@param P ECP4 instance, on exit =P-Q
+	@param Q ECP4 instance to be subtracted from P
+ */
+extern void ECP4_sub(ECP4 *P, ECP4 *Q);
+/**	@brief Multiplies an ECP4 instance P by a BIG, side-channel resistant
+ *
+	Uses fixed sized windows.
+	@param P ECP4 instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP4_mul(ECP4 *P, XXX::BIG b);
+
+/**	@brief Calculates required Frobenius constants
+ *
+	Calculate Frobenius constants
+	@param F array of FP2 precalculated constants
+
+ */
+extern void ECP4_frob_constants(YYY::FP2 F[3]);
+
+/**	@brief Multiplies an ECP4 instance P by the internal modulus p^n, using precalculated Frobenius constants
+ *
+	Fast point multiplication using Frobenius
+	@param P ECP4 instance, on exit = p^n*P
+	@param F array of FP2 precalculated Frobenius constant
+	@param n power of prime
+
+ */
+extern void ECP4_frob(ECP4 *P, YYY::FP2 F[3], int n);
+
+/**	@brief Calculates P=Sigma b[i]*Q[i] for i=0 to 7
+ *
+	@param P ECP4 instance, on exit = Sigma b[i]*Q[i] for i=0 to 7
+	@param Q ECP4 array of 4 points
+	@param b BIG array of 4 multipliers
+ */
+extern void ECP4_mul8(ECP4 *P, ECP4 *Q, XXX::BIG *b);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP4 multiplied by co-factor
+ */
+extern void ECP4_cfp(ECP4 *Q);
+
+/**	@brief Maps random FP4 to curve point in constant time
+ *
+	@param Q ECP4 instance 
+	@param x FP4 derived from hash
+ */
+extern void ECP4_map2point(ECP4 *Q, YYY::FP4 *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP4 instance 
+	@param x Fp derived from hash
+ */
+extern void ECP4_hap2point(ECP4 *Q, XXX::BIG  x);
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param P ECP4 instance of correct order
+	@param W OCTET byte array to be mapped
+ */
+extern void ECP4_mapit(ECP4 *P, octet *W);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP4 instance
+	@return 1 if point exists, else 0
+ */
+extern int ECP4_generator(ECP4 *G);
+
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp4_BLS24479.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp4_BLS24479.h
new file mode 100644
index 0000000..74ce8cc
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp4_BLS24479.h
@@ -0,0 +1,268 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP4_BLS24479_H
+#define ECP4_BLS24479_H
+
+#include "fp4_BLS24479.h"
+#include "config_curve_BLS24479.h"
+
+using namespace core;
+
+namespace BLS24479 {
+
+extern const B480_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B480_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+}
+
+namespace BLS24479 {
+
+/**
+	@brief ECP4 Structure - Elliptic Curve Point over quadratic extension field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag */
+    BLS24479::FP4 x;   /**< x-coordinate of point */
+    BLS24479::FP4 y;   /**< y-coordinate of point */
+    BLS24479::FP4 z;   /**< z-coordinate of point */
+} ECP4;
+
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;		/**< Elliptic curve B parameter */
+extern const B480_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B480_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B480_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B480_56::BIG CURVE_Bnx;   /**< Elliptic curve parameter */
+extern const B480_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+
+/* Generator point on G1 */
+extern const B480_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B480_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B480_56::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/* ECP4 E(FP4) prototypes */
+/**	@brief Tests for ECP4 point equal to infinity
+ *
+	@param P ECP4 point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP4_isinf(ECP4 *P);
+/**	@brief Copy ECP4 point to another ECP4 point
+ *
+	@param P ECP4 instance, on exit = Q
+	@param Q ECP4 instance to be copied
+ */
+extern void ECP4_copy(ECP4 *P, ECP4 *Q);
+/**	@brief Set ECP4 to point-at-infinity
+ *
+	@param P ECP4 instance to be set to infinity
+ */
+extern void ECP4_inf(ECP4 *P);
+/**	@brief Tests for equality of two ECP4s
+ *
+	@param P ECP4 instance to be compared
+	@param Q ECP4 instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP4_equals(ECP4 *P, ECP4 *Q);
+
+/**	@brief Converts an ECP4 point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP4 instance to be converted to affine form
+ */
+extern void ECP4_affine(ECP4 *P);
+
+
+/**	@brief Extract x and y coordinates of an ECP4 point P
+ *
+	If x=y, returns only x
+	@param x FP4 on exit = x coordinate of point
+	@param y FP4 on exit = y coordinate of point (unless x=y)
+	@param P ECP4 instance (x,y)
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP4_get(BLS24479::FP4 *x, BLS24479::FP4 *y, ECP4 *P);
+/**	@brief Formats and outputs an ECP4 point to the console, converted to affine coordinates
+ *
+	@param P ECP4 instance to be printed
+ */
+extern void ECP4_output(ECP4 *P);
+
+/**	@brief Formats and outputs an ECP4 point to an octet string
+ *
+	The octet string is created in the form x|y or just x if compressed
+	Convert the real and imaginary parts of the x and y coordinates to big-endian base 256 form.
+	@param S output octet string
+	@param P ECP4 instance to be converted to an octet string
+    @param c true for compression
+ */
+extern void ECP4_toOctet(octet *S, ECP4 *P, bool c);
+/**	@brief Creates an ECP4 point from an octet string
+ *
+	The octet string is in the form x|y
+	The real and imaginary parts of the x and y coordinates are in big-endian base 256 form.
+	@param P ECP4 instance to be created from the octet string
+	@param S input octet string
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP4_fromOctet(ECP4 *P, octet *S);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x)=x^3+Ax+B
+	Used internally.
+	@param r FP4 value of f(x)
+	@param x FP4 instance
+ */
+extern void ECP4_rhs(BLS24479::FP4 *r, BLS24479::FP4 *x);
+/**	@brief Set ECP4 to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP4 instance to be set (x,y)
+	@param x FP4 x coordinate of point
+	@param y FP4 y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP4_set(ECP4 *P, BLS24479::FP4 *x, BLS24479::FP4 *y);
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Otherwise y coordinate is calculated from x.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+    @param s sign of y
+	@return 1 if point exists, else 0
+ */
+extern int ECP4_setx(ECP4 *P, BLS24479::FP4 *x, int s);
+/**	@brief Negation of an ECP4 point
+ *
+	@param P ECP4 instance, on exit = -P
+ */
+extern void ECP4_neg(ECP4 *P);
+
+/**	@brief Reduction of an ECP4 point
+ *
+	@param P ECP4 instance, on exit (x,y) are reduced wrt the modulus
+ */
+extern void ECP4_reduce(ECP4 *P);
+
+
+/**	@brief Doubles an ECP4 instance P
+ *
+	@param P ECP4 instance, on exit =2*P
+ */
+extern int ECP4_dbl(ECP4 *P);
+/**	@brief Adds ECP4 instance Q to ECP4 instance P
+ *
+	@param P ECP4 instance, on exit =P+Q
+	@param Q ECP4 instance to be added to P
+ */
+extern int ECP4_add(ECP4 *P, ECP4 *Q);
+/**	@brief Subtracts ECP instance Q from ECP4 instance P
+ *
+	@param P ECP4 instance, on exit =P-Q
+	@param Q ECP4 instance to be subtracted from P
+ */
+extern void ECP4_sub(ECP4 *P, ECP4 *Q);
+/**	@brief Multiplies an ECP4 instance P by a BIG, side-channel resistant
+ *
+	Uses fixed sized windows.
+	@param P ECP4 instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP4_mul(ECP4 *P, B480_56::BIG b);
+
+/**	@brief Calculates required Frobenius constants
+ *
+	Calculate Frobenius constants
+	@param F array of FP2 precalculated constants
+
+ */
+extern void ECP4_frob_constants(BLS24479::FP2 F[3]);
+
+/**	@brief Multiplies an ECP4 instance P by the internal modulus p^n, using precalculated Frobenius constants
+ *
+	Fast point multiplication using Frobenius
+	@param P ECP4 instance, on exit = p^n*P
+	@param F array of FP2 precalculated Frobenius constant
+	@param n power of prime
+
+ */
+extern void ECP4_frob(ECP4 *P, BLS24479::FP2 F[3], int n);
+
+/**	@brief Calculates P=Sigma b[i]*Q[i] for i=0 to 7
+ *
+	@param P ECP4 instance, on exit = Sigma b[i]*Q[i] for i=0 to 7
+	@param Q ECP4 array of 4 points
+	@param b BIG array of 4 multipliers
+ */
+extern void ECP4_mul8(ECP4 *P, ECP4 *Q, B480_56::BIG *b);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP4 multiplied by co-factor
+ */
+extern void ECP4_cfp(ECP4 *Q);
+
+/**	@brief Maps random FP4 to curve point in constant time
+ *
+	@param Q ECP4 instance 
+	@param x FP4 derived from hash
+ */
+extern void ECP4_map2point(ECP4 *Q, BLS24479::FP4 *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP4 instance 
+	@param x Fp derived from hash
+ */
+extern void ECP4_hap2point(ECP4 *Q, B480_56::BIG  x);
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param P ECP4 instance of correct order
+	@param W OCTET byte array to be mapped
+ */
+extern void ECP4_mapit(ECP4 *P, octet *W);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP4 instance
+	@return 1 if point exists, else 0
+ */
+extern int ECP4_generator(ECP4 *G);
+
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp8.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp8.h
new file mode 100644
index 0000000..bf67972
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp8.h
@@ -0,0 +1,278 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP8_ZZZ_H
+#define ECP8_ZZZ_H
+
+#include "fp8_YYY.h"
+#include "config_curve_ZZZ.h"
+
+using namespace core;
+
+namespace YYY {
+
+extern const XXX::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const XXX::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+}
+
+namespace ZZZ {
+
+/**
+	@brief ECP8 Structure - Elliptic Curve Point over quadratic extension field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag */
+    YYY::FP8 x;   /**< x-coordinate of point */
+    YYY::FP8 y;   /**< y-coordinate of point */
+    YYY::FP8 z;   /**< z-coordinate of point */
+} ECP8;
+
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;		/**< Elliptic curve B parameter */
+extern const XXX::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const XXX::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const XXX::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const XXX::BIG CURVE_Bnx;   /**< Elliptic curve parameter */
+extern const XXX::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+
+/* Generator point on G1 */
+extern const XXX::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const XXX::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const XXX::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const XXX::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+/* ECP8 E(FP8) prototypes */
+/**	@brief Tests for ECP8 point equal to infinity
+ *
+	@param P ECP8 point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP8_isinf(ECP8 *P);
+/**	@brief Copy ECP8 point to another ECP8 point
+ *
+	@param P ECP8 instance, on exit = Q
+	@param Q ECP8 instance to be copied
+ */
+extern void ECP8_copy(ECP8 *P, ECP8 *Q);
+/**	@brief Set ECP8 to point-at-infinity
+ *
+	@param P ECP8 instance to be set to infinity
+ */
+extern void ECP8_inf(ECP8 *P);
+/**	@brief Tests for equality of two ECP8s
+ *
+	@param P ECP8 instance to be compared
+	@param Q ECP8 instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP8_equals(ECP8 *P, ECP8 *Q);
+
+/**	@brief Converts an ECP8 point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP8 instance to be converted to affine form
+ */
+extern void ECP8_affine(ECP8 *P);
+
+
+/**	@brief Extract x and y coordinates of an ECP8 point P
+ *
+	If x=y, returns only x
+	@param x FP8 on exit = x coordinate of point
+	@param y FP8 on exit = y coordinate of point (unless x=y)
+	@param P ECP8 instance (x,y)
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP8_get(YYY::FP8 *x, YYY::FP8 *y, ECP8 *P);
+/**	@brief Formats and outputs an ECP8 point to the console, converted to affine coordinates
+ *
+	@param P ECP8 instance to be printed
+ */
+extern void ECP8_output(ECP8 *P);
+
+/**	@brief Formats and outputs an ECP8 point to an octet string
+ *
+	The octet string is created in the form x|y or just x if compressed
+	Convert the real and imaginary parts of the x and y coordinates to big-endian base 256 form.
+	@param S output octet string
+	@param P ECP8 instance to be converted to an octet string
+    @param c true for compression
+ */
+extern void ECP8_toOctet(octet *S, ECP8 *P, bool c);
+/**	@brief Creates an ECP8 point from an octet string
+ *
+	The octet string is in the form x|y
+	The real and imaginary parts of the x and y coordinates are in big-endian base 256 form.
+	@param P ECP8 instance to be created from the octet string
+	@param S input octet string
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP8_fromOctet(ECP8 *P, octet *S);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x)=x^3+Ax+B
+	Used internally.
+	@param r FP8 value of f(x)
+	@param x FP8 instance
+ */
+extern void ECP8_rhs(YYY::FP8 *r, YYY::FP8 *x);
+/**	@brief Set ECP8 to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP8 instance to be set (x,y)
+	@param x FP8 x coordinate of point
+	@param y FP8 y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP8_set(ECP8 *P, YYY::FP8 *x, YYY::FP8 *y);
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Otherwise y coordinate is calculated from x.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+    @param s sign of y
+	@return 1 if point exists, else 0
+ */
+extern int ECP8_setx(ECP8 *P, YYY::FP8 *x,int s);
+/**	@brief Negation of an ECP8 point
+ *
+	@param P ECP8 instance, on exit = -P
+ */
+extern void ECP8_neg(ECP8 *P);
+
+/**	@brief Reduction of an ECP8 point
+ *
+	@param P ECP8 instance, on exit (x,y) are reduced wrt the modulus
+ */
+extern void ECP8_reduce(ECP8 *P);
+
+
+/**	@brief Doubles an ECP8 instance P
+ *
+	@param P ECP8 instance, on exit =2*P
+ */
+extern int ECP8_dbl(ECP8 *P);
+/**	@brief Adds ECP8 instance Q to ECP8 instance P
+ *
+	@param P ECP8 instance, on exit =P+Q
+	@param Q ECP8 instance to be added to P
+ */
+extern int ECP8_add(ECP8 *P, ECP8 *Q);
+/**	@brief Subtracts ECP instance Q from ECP8 instance P
+ *
+	@param P ECP8 instance, on exit =P-Q
+	@param Q ECP8 instance to be subtracted from P
+ */
+extern void ECP8_sub(ECP8 *P, ECP8 *Q);
+/**	@brief Multiplies an ECP8 instance P by a BIG, side-channel resistant
+ *
+	Uses fixed sized windows.
+	@param P ECP8 instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP8_mul(ECP8 *P, XXX::BIG b);
+
+/**	@brief Calculates required Frobenius constants
+ *
+	Calculate Frobenius constants
+	@param F array of FP2 precalculated constants
+
+ */
+extern void ECP8_frob_constants(YYY::FP2 F[3]);
+
+/**	@brief Multiplies an ECP8 instance P by the internal modulus p^n, using precalculated Frobenius constants
+ *
+	Fast point multiplication using Frobenius
+	@param P ECP8 instance, on exit = p^n*P
+	@param F array of FP2 precalculated Frobenius constant
+	@param n power of prime
+
+ */
+extern void ECP8_frob(ECP8 *P, YYY::FP2 F[3], int n);
+
+/**	@brief Calculates P=Sigma b[i]*Q[i] for i=0 to 7
+ *
+	@param P ECP8 instance, on exit = Sigma b[i]*Q[i] for i=0 to 7
+	@param Q ECP8 array of 4 points
+	@param b BIG array of 4 multipliers
+ */
+extern void ECP8_mul16(ECP8 *P, ECP8 *Q, XXX::BIG *b);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP8 multiplied by co-factor
+ */
+extern void ECP8_cfp(ECP8 *Q);
+
+/**	@brief Maps random FP8 to curve point in constant time
+ *
+	@param Q ECP8 instance 
+	@param x FP8 derived from hash
+ */
+extern void ECP8_map2point(ECP8 *Q, YYY::FP8 *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck 
+ *
+	@param Q ECP8 instance 
+	@param x Fp derived from hash
+ */
+extern void ECP8_hap2point(ECP8 *Q, XXX::BIG  x);
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param P ECP8 instance of correct order
+	@param W OCTET byte array to be mapped
+ */
+extern void ECP8_mapit(ECP8 *P, octet *W);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP8 instance
+	@return 1 if point exists, else 0
+ */
+extern int ECP8_generator(ECP8 *G);
+
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp8_BLS48286.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp8_BLS48286.h
new file mode 100644
index 0000000..7c7a598
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp8_BLS48286.h
@@ -0,0 +1,278 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP8_BLS48286_H
+#define ECP8_BLS48286_H
+
+#include "fp8_BLS48286.h"
+#include "config_curve_BLS48286.h"
+
+using namespace core;
+
+namespace BLS48286 {
+
+extern const B288_60::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B288_60::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+}
+
+namespace BLS48286 {
+
+/**
+	@brief ECP8 Structure - Elliptic Curve Point over quadratic extension field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag */
+    BLS48286::FP8 x;   /**< x-coordinate of point */
+    BLS48286::FP8 y;   /**< y-coordinate of point */
+    BLS48286::FP8 z;   /**< z-coordinate of point */
+} ECP8;
+
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;		/**< Elliptic curve B parameter */
+extern const B288_60::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B288_60::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B288_60::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B288_60::BIG CURVE_Bnx;   /**< Elliptic curve parameter */
+extern const B288_60::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+
+/* Generator point on G1 */
+extern const B288_60::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B288_60::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B288_60::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B288_60::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+/* ECP8 E(FP8) prototypes */
+/**	@brief Tests for ECP8 point equal to infinity
+ *
+	@param P ECP8 point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP8_isinf(ECP8 *P);
+/**	@brief Copy ECP8 point to another ECP8 point
+ *
+	@param P ECP8 instance, on exit = Q
+	@param Q ECP8 instance to be copied
+ */
+extern void ECP8_copy(ECP8 *P, ECP8 *Q);
+/**	@brief Set ECP8 to point-at-infinity
+ *
+	@param P ECP8 instance to be set to infinity
+ */
+extern void ECP8_inf(ECP8 *P);
+/**	@brief Tests for equality of two ECP8s
+ *
+	@param P ECP8 instance to be compared
+	@param Q ECP8 instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP8_equals(ECP8 *P, ECP8 *Q);
+
+/**	@brief Converts an ECP8 point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP8 instance to be converted to affine form
+ */
+extern void ECP8_affine(ECP8 *P);
+
+
+/**	@brief Extract x and y coordinates of an ECP8 point P
+ *
+	If x=y, returns only x
+	@param x FP8 on exit = x coordinate of point
+	@param y FP8 on exit = y coordinate of point (unless x=y)
+	@param P ECP8 instance (x,y)
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP8_get(BLS48286::FP8 *x, BLS48286::FP8 *y, ECP8 *P);
+/**	@brief Formats and outputs an ECP8 point to the console, converted to affine coordinates
+ *
+	@param P ECP8 instance to be printed
+ */
+extern void ECP8_output(ECP8 *P);
+
+/**	@brief Formats and outputs an ECP8 point to an octet string
+ *
+	The octet string is created in the form x|y or just x if compressed
+	Convert the real and imaginary parts of the x and y coordinates to big-endian base 256 form.
+	@param S output octet string
+	@param P ECP8 instance to be converted to an octet string
+    @param c true for compression
+ */
+extern void ECP8_toOctet(octet *S, ECP8 *P, bool c);
+/**	@brief Creates an ECP8 point from an octet string
+ *
+	The octet string is in the form x|y
+	The real and imaginary parts of the x and y coordinates are in big-endian base 256 form.
+	@param P ECP8 instance to be created from the octet string
+	@param S input octet string
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP8_fromOctet(ECP8 *P, octet *S);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x)=x^3+Ax+B
+	Used internally.
+	@param r FP8 value of f(x)
+	@param x FP8 instance
+ */
+extern void ECP8_rhs(BLS48286::FP8 *r, BLS48286::FP8 *x);
+/**	@brief Set ECP8 to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP8 instance to be set (x,y)
+	@param x FP8 x coordinate of point
+	@param y FP8 y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP8_set(ECP8 *P, BLS48286::FP8 *x, BLS48286::FP8 *y);
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Otherwise y coordinate is calculated from x.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+    @param s sign of y
+	@return 1 if point exists, else 0
+ */
+extern int ECP8_setx(ECP8 *P, BLS48286::FP8 *x,int s);
+/**	@brief Negation of an ECP8 point
+ *
+	@param P ECP8 instance, on exit = -P
+ */
+extern void ECP8_neg(ECP8 *P);
+
+/**	@brief Reduction of an ECP8 point
+ *
+	@param P ECP8 instance, on exit (x,y) are reduced wrt the modulus
+ */
+extern void ECP8_reduce(ECP8 *P);
+
+
+/**	@brief Doubles an ECP8 instance P
+ *
+	@param P ECP8 instance, on exit =2*P
+ */
+extern int ECP8_dbl(ECP8 *P);
+/**	@brief Adds ECP8 instance Q to ECP8 instance P
+ *
+	@param P ECP8 instance, on exit =P+Q
+	@param Q ECP8 instance to be added to P
+ */
+extern int ECP8_add(ECP8 *P, ECP8 *Q);
+/**	@brief Subtracts ECP instance Q from ECP8 instance P
+ *
+	@param P ECP8 instance, on exit =P-Q
+	@param Q ECP8 instance to be subtracted from P
+ */
+extern void ECP8_sub(ECP8 *P, ECP8 *Q);
+/**	@brief Multiplies an ECP8 instance P by a BIG, side-channel resistant
+ *
+	Uses fixed sized windows.
+	@param P ECP8 instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP8_mul(ECP8 *P, B288_60::BIG b);
+
+/**	@brief Calculates required Frobenius constants
+ *
+	Calculate Frobenius constants
+	@param F array of FP2 precalculated constants
+
+ */
+extern void ECP8_frob_constants(BLS48286::FP2 F[3]);
+
+/**	@brief Multiplies an ECP8 instance P by the internal modulus p^n, using precalculated Frobenius constants
+ *
+	Fast point multiplication using Frobenius
+	@param P ECP8 instance, on exit = p^n*P
+	@param F array of FP2 precalculated Frobenius constant
+	@param n power of prime
+
+ */
+extern void ECP8_frob(ECP8 *P, BLS48286::FP2 F[3], int n);
+
+/**	@brief Calculates P=Sigma b[i]*Q[i] for i=0 to 7
+ *
+	@param P ECP8 instance, on exit = Sigma b[i]*Q[i] for i=0 to 7
+	@param Q ECP8 array of 4 points
+	@param b BIG array of 4 multipliers
+ */
+extern void ECP8_mul16(ECP8 *P, ECP8 *Q, B288_60::BIG *b);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP8 multiplied by co-factor
+ */
+extern void ECP8_cfp(ECP8 *Q);
+
+/**	@brief Maps random FP8 to curve point in constant time
+ *
+	@param Q ECP8 instance 
+	@param x FP8 derived from hash
+ */
+extern void ECP8_map2point(ECP8 *Q, BLS48286::FP8 *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck 
+ *
+	@param Q ECP8 instance 
+	@param x Fp derived from hash
+ */
+extern void ECP8_hap2point(ECP8 *Q, B288_60::BIG  x);
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param P ECP8 instance of correct order
+	@param W OCTET byte array to be mapped
+ */
+extern void ECP8_mapit(ECP8 *P, octet *W);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP8 instance
+	@return 1 if point exists, else 0
+ */
+extern int ECP8_generator(ECP8 *G);
+
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp8_BLS48556.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp8_BLS48556.h
new file mode 100644
index 0000000..6652a72
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp8_BLS48556.h
@@ -0,0 +1,278 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP8_BLS48556_H
+#define ECP8_BLS48556_H
+
+#include "fp8_BLS48556.h"
+#include "config_curve_BLS48556.h"
+
+using namespace core;
+
+namespace BLS48556 {
+
+extern const B560_58::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B560_58::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+}
+
+namespace BLS48556 {
+
+/**
+	@brief ECP8 Structure - Elliptic Curve Point over quadratic extension field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag */
+    BLS48556::FP8 x;   /**< x-coordinate of point */
+    BLS48556::FP8 y;   /**< y-coordinate of point */
+    BLS48556::FP8 z;   /**< z-coordinate of point */
+} ECP8;
+
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;		/**< Elliptic curve B parameter */
+extern const B560_58::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B560_58::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B560_58::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B560_58::BIG CURVE_Bnx;   /**< Elliptic curve parameter */
+extern const B560_58::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+
+/* Generator point on G1 */
+extern const B560_58::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B560_58::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B560_58::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B560_58::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+/* ECP8 E(FP8) prototypes */
+/**	@brief Tests for ECP8 point equal to infinity
+ *
+	@param P ECP8 point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP8_isinf(ECP8 *P);
+/**	@brief Copy ECP8 point to another ECP8 point
+ *
+	@param P ECP8 instance, on exit = Q
+	@param Q ECP8 instance to be copied
+ */
+extern void ECP8_copy(ECP8 *P, ECP8 *Q);
+/**	@brief Set ECP8 to point-at-infinity
+ *
+	@param P ECP8 instance to be set to infinity
+ */
+extern void ECP8_inf(ECP8 *P);
+/**	@brief Tests for equality of two ECP8s
+ *
+	@param P ECP8 instance to be compared
+	@param Q ECP8 instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP8_equals(ECP8 *P, ECP8 *Q);
+
+/**	@brief Converts an ECP8 point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP8 instance to be converted to affine form
+ */
+extern void ECP8_affine(ECP8 *P);
+
+
+/**	@brief Extract x and y coordinates of an ECP8 point P
+ *
+	If x=y, returns only x
+	@param x FP8 on exit = x coordinate of point
+	@param y FP8 on exit = y coordinate of point (unless x=y)
+	@param P ECP8 instance (x,y)
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP8_get(BLS48556::FP8 *x, BLS48556::FP8 *y, ECP8 *P);
+/**	@brief Formats and outputs an ECP8 point to the console, converted to affine coordinates
+ *
+	@param P ECP8 instance to be printed
+ */
+extern void ECP8_output(ECP8 *P);
+
+/**	@brief Formats and outputs an ECP8 point to an octet string
+ *
+	The octet string is created in the form x|y or just x if compressed
+	Convert the real and imaginary parts of the x and y coordinates to big-endian base 256 form.
+	@param S output octet string
+	@param P ECP8 instance to be converted to an octet string
+    @param c true for compression
+ */
+extern void ECP8_toOctet(octet *S, ECP8 *P, bool c);
+/**	@brief Creates an ECP8 point from an octet string
+ *
+	The octet string is in the form x|y
+	The real and imaginary parts of the x and y coordinates are in big-endian base 256 form.
+	@param P ECP8 instance to be created from the octet string
+	@param S input octet string
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP8_fromOctet(ECP8 *P, octet *S);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x)=x^3+Ax+B
+	Used internally.
+	@param r FP8 value of f(x)
+	@param x FP8 instance
+ */
+extern void ECP8_rhs(BLS48556::FP8 *r, BLS48556::FP8 *x);
+/**	@brief Set ECP8 to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP8 instance to be set (x,y)
+	@param x FP8 x coordinate of point
+	@param y FP8 y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP8_set(ECP8 *P, BLS48556::FP8 *x, BLS48556::FP8 *y);
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Otherwise y coordinate is calculated from x.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+    @param s sign of y
+	@return 1 if point exists, else 0
+ */
+extern int ECP8_setx(ECP8 *P, BLS48556::FP8 *x,int s);
+/**	@brief Negation of an ECP8 point
+ *
+	@param P ECP8 instance, on exit = -P
+ */
+extern void ECP8_neg(ECP8 *P);
+
+/**	@brief Reduction of an ECP8 point
+ *
+	@param P ECP8 instance, on exit (x,y) are reduced wrt the modulus
+ */
+extern void ECP8_reduce(ECP8 *P);
+
+
+/**	@brief Doubles an ECP8 instance P
+ *
+	@param P ECP8 instance, on exit =2*P
+ */
+extern int ECP8_dbl(ECP8 *P);
+/**	@brief Adds ECP8 instance Q to ECP8 instance P
+ *
+	@param P ECP8 instance, on exit =P+Q
+	@param Q ECP8 instance to be added to P
+ */
+extern int ECP8_add(ECP8 *P, ECP8 *Q);
+/**	@brief Subtracts ECP instance Q from ECP8 instance P
+ *
+	@param P ECP8 instance, on exit =P-Q
+	@param Q ECP8 instance to be subtracted from P
+ */
+extern void ECP8_sub(ECP8 *P, ECP8 *Q);
+/**	@brief Multiplies an ECP8 instance P by a BIG, side-channel resistant
+ *
+	Uses fixed sized windows.
+	@param P ECP8 instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP8_mul(ECP8 *P, B560_58::BIG b);
+
+/**	@brief Calculates required Frobenius constants
+ *
+	Calculate Frobenius constants
+	@param F array of FP2 precalculated constants
+
+ */
+extern void ECP8_frob_constants(BLS48556::FP2 F[3]);
+
+/**	@brief Multiplies an ECP8 instance P by the internal modulus p^n, using precalculated Frobenius constants
+ *
+	Fast point multiplication using Frobenius
+	@param P ECP8 instance, on exit = p^n*P
+	@param F array of FP2 precalculated Frobenius constant
+	@param n power of prime
+
+ */
+extern void ECP8_frob(ECP8 *P, BLS48556::FP2 F[3], int n);
+
+/**	@brief Calculates P=Sigma b[i]*Q[i] for i=0 to 7
+ *
+	@param P ECP8 instance, on exit = Sigma b[i]*Q[i] for i=0 to 7
+	@param Q ECP8 array of 4 points
+	@param b BIG array of 4 multipliers
+ */
+extern void ECP8_mul16(ECP8 *P, ECP8 *Q, B560_58::BIG *b);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP8 multiplied by co-factor
+ */
+extern void ECP8_cfp(ECP8 *Q);
+
+/**	@brief Maps random FP8 to curve point in constant time
+ *
+	@param Q ECP8 instance 
+	@param x FP8 derived from hash
+ */
+extern void ECP8_map2point(ECP8 *Q, BLS48556::FP8 *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck 
+ *
+	@param Q ECP8 instance 
+	@param x Fp derived from hash
+ */
+extern void ECP8_hap2point(ECP8 *Q, B560_58::BIG  x);
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param P ECP8 instance of correct order
+	@param W OCTET byte array to be mapped
+ */
+extern void ECP8_mapit(ECP8 *P, octet *W);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP8 instance
+	@return 1 if point exists, else 0
+ */
+extern int ECP8_generator(ECP8 *G);
+
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp8_BLS48581.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp8_BLS48581.h
new file mode 100644
index 0000000..5cf3f97
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp8_BLS48581.h
@@ -0,0 +1,278 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP8_BLS48581_H
+#define ECP8_BLS48581_H
+
+#include "fp8_BLS48581.h"
+#include "config_curve_BLS48581.h"
+
+using namespace core;
+
+namespace BLS48581 {
+
+extern const B584_60::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B584_60::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+}
+
+namespace BLS48581 {
+
+/**
+	@brief ECP8 Structure - Elliptic Curve Point over quadratic extension field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag */
+    BLS48581::FP8 x;   /**< x-coordinate of point */
+    BLS48581::FP8 y;   /**< y-coordinate of point */
+    BLS48581::FP8 z;   /**< z-coordinate of point */
+} ECP8;
+
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;		/**< Elliptic curve B parameter */
+extern const B584_60::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B584_60::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B584_60::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B584_60::BIG CURVE_Bnx;   /**< Elliptic curve parameter */
+extern const B584_60::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+
+/* Generator point on G1 */
+extern const B584_60::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B584_60::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B584_60::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B584_60::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+/* ECP8 E(FP8) prototypes */
+/**	@brief Tests for ECP8 point equal to infinity
+ *
+	@param P ECP8 point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP8_isinf(ECP8 *P);
+/**	@brief Copy ECP8 point to another ECP8 point
+ *
+	@param P ECP8 instance, on exit = Q
+	@param Q ECP8 instance to be copied
+ */
+extern void ECP8_copy(ECP8 *P, ECP8 *Q);
+/**	@brief Set ECP8 to point-at-infinity
+ *
+	@param P ECP8 instance to be set to infinity
+ */
+extern void ECP8_inf(ECP8 *P);
+/**	@brief Tests for equality of two ECP8s
+ *
+	@param P ECP8 instance to be compared
+	@param Q ECP8 instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP8_equals(ECP8 *P, ECP8 *Q);
+
+/**	@brief Converts an ECP8 point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP8 instance to be converted to affine form
+ */
+extern void ECP8_affine(ECP8 *P);
+
+
+/**	@brief Extract x and y coordinates of an ECP8 point P
+ *
+	If x=y, returns only x
+	@param x FP8 on exit = x coordinate of point
+	@param y FP8 on exit = y coordinate of point (unless x=y)
+	@param P ECP8 instance (x,y)
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP8_get(BLS48581::FP8 *x, BLS48581::FP8 *y, ECP8 *P);
+/**	@brief Formats and outputs an ECP8 point to the console, converted to affine coordinates
+ *
+	@param P ECP8 instance to be printed
+ */
+extern void ECP8_output(ECP8 *P);
+
+/**	@brief Formats and outputs an ECP8 point to an octet string
+ *
+	The octet string is created in the form x|y or just x if compressed
+	Convert the real and imaginary parts of the x and y coordinates to big-endian base 256 form.
+	@param S output octet string
+	@param P ECP8 instance to be converted to an octet string
+    @param c true for compression
+ */
+extern void ECP8_toOctet(octet *S, ECP8 *P, bool c);
+/**	@brief Creates an ECP8 point from an octet string
+ *
+	The octet string is in the form x|y
+	The real and imaginary parts of the x and y coordinates are in big-endian base 256 form.
+	@param P ECP8 instance to be created from the octet string
+	@param S input octet string
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP8_fromOctet(ECP8 *P, octet *S);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x)=x^3+Ax+B
+	Used internally.
+	@param r FP8 value of f(x)
+	@param x FP8 instance
+ */
+extern void ECP8_rhs(BLS48581::FP8 *r, BLS48581::FP8 *x);
+/**	@brief Set ECP8 to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP8 instance to be set (x,y)
+	@param x FP8 x coordinate of point
+	@param y FP8 y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP8_set(ECP8 *P, BLS48581::FP8 *x, BLS48581::FP8 *y);
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Otherwise y coordinate is calculated from x.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+    @param s sign of y
+	@return 1 if point exists, else 0
+ */
+extern int ECP8_setx(ECP8 *P, BLS48581::FP8 *x,int s);
+/**	@brief Negation of an ECP8 point
+ *
+	@param P ECP8 instance, on exit = -P
+ */
+extern void ECP8_neg(ECP8 *P);
+
+/**	@brief Reduction of an ECP8 point
+ *
+	@param P ECP8 instance, on exit (x,y) are reduced wrt the modulus
+ */
+extern void ECP8_reduce(ECP8 *P);
+
+
+/**	@brief Doubles an ECP8 instance P
+ *
+	@param P ECP8 instance, on exit =2*P
+ */
+extern int ECP8_dbl(ECP8 *P);
+/**	@brief Adds ECP8 instance Q to ECP8 instance P
+ *
+	@param P ECP8 instance, on exit =P+Q
+	@param Q ECP8 instance to be added to P
+ */
+extern int ECP8_add(ECP8 *P, ECP8 *Q);
+/**	@brief Subtracts ECP instance Q from ECP8 instance P
+ *
+	@param P ECP8 instance, on exit =P-Q
+	@param Q ECP8 instance to be subtracted from P
+ */
+extern void ECP8_sub(ECP8 *P, ECP8 *Q);
+/**	@brief Multiplies an ECP8 instance P by a BIG, side-channel resistant
+ *
+	Uses fixed sized windows.
+	@param P ECP8 instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP8_mul(ECP8 *P, B584_60::BIG b);
+
+/**	@brief Calculates required Frobenius constants
+ *
+	Calculate Frobenius constants
+	@param F array of FP2 precalculated constants
+
+ */
+extern void ECP8_frob_constants(BLS48581::FP2 F[3]);
+
+/**	@brief Multiplies an ECP8 instance P by the internal modulus p^n, using precalculated Frobenius constants
+ *
+	Fast point multiplication using Frobenius
+	@param P ECP8 instance, on exit = p^n*P
+	@param F array of FP2 precalculated Frobenius constant
+	@param n power of prime
+
+ */
+extern void ECP8_frob(ECP8 *P, BLS48581::FP2 F[3], int n);
+
+/**	@brief Calculates P=Sigma b[i]*Q[i] for i=0 to 7
+ *
+	@param P ECP8 instance, on exit = Sigma b[i]*Q[i] for i=0 to 7
+	@param Q ECP8 array of 4 points
+	@param b BIG array of 4 multipliers
+ */
+extern void ECP8_mul16(ECP8 *P, ECP8 *Q, B584_60::BIG *b);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP8 multiplied by co-factor
+ */
+extern void ECP8_cfp(ECP8 *Q);
+
+/**	@brief Maps random FP8 to curve point in constant time
+ *
+	@param Q ECP8 instance 
+	@param x FP8 derived from hash
+ */
+extern void ECP8_map2point(ECP8 *Q, BLS48581::FP8 *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck 
+ *
+	@param Q ECP8 instance 
+	@param x Fp derived from hash
+ */
+extern void ECP8_hap2point(ECP8 *Q, B584_60::BIG  x);
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param P ECP8 instance of correct order
+	@param W OCTET byte array to be mapped
+ */
+extern void ECP8_mapit(ECP8 *P, octet *W);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP8 instance
+	@return 1 if point exists, else 0
+ */
+extern int ECP8_generator(ECP8 *G);
+
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_ANSSI.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_ANSSI.h
new file mode 100644
index 0000000..d6712ad
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_ANSSI.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_ANSSI_H
+#define ECP_ANSSI_H
+
+#include "fp_ANSSI.h"
+#include "config_curve_ANSSI.h"
+
+using namespace core;
+
+namespace ANSSI {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B256_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B256_56::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B256_56::BIG CURVE_Ad;
+extern const B256_56::BIG CURVE_Bd;
+extern const B256_56::BIG PC[];
+
+extern const B256_56::BIG CURVE_Adr;
+extern const B256_56::BIG CURVE_Adi;
+extern const B256_56::BIG CURVE_Bdr;
+extern const B256_56::BIG CURVE_Bdi;
+extern const B256_56::BIG PCR[];
+extern const B256_56::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B256_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B256_56::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B256_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B256_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B256_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    ANSSI::FP x; /**< x-coordinate of point */
+#if CURVETYPE_ANSSI!=MONTGOMERY
+    ANSSI::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    ANSSI::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(ANSSI::FP *r, ANSSI::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B256_56::BIG x, int s);
+
+#if CURVETYPE_ANSSI==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B256_56::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x, B256_56::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B256_56::BIG x, B256_56::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B256_56::BIG e, B256_56::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B256_56::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f, B256_56::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B256_56::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, ANSSI::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B256_56::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_BLS12381.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_BLS12381.h
new file mode 100644
index 0000000..e1e517c
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_BLS12381.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_BLS12381_H
+#define ECP_BLS12381_H
+
+#include "fp_BLS12381.h"
+#include "config_curve_BLS12381.h"
+
+using namespace core;
+
+namespace BLS12381 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B384_58::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B384_58::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B384_58::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B384_58::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B384_58::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B384_58::BIG CURVE_Ad;
+extern const B384_58::BIG CURVE_Bd;
+extern const B384_58::BIG PC[];
+
+extern const B384_58::BIG CURVE_Adr;
+extern const B384_58::BIG CURVE_Adi;
+extern const B384_58::BIG CURVE_Bdr;
+extern const B384_58::BIG CURVE_Bdi;
+extern const B384_58::BIG PCR[];
+extern const B384_58::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B384_58::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B384_58::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B384_58::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B384_58::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B384_58::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B384_58::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B384_58::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B384_58::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B384_58::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B384_58::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B384_58::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B384_58::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B384_58::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    BLS12381::FP x; /**< x-coordinate of point */
+#if CURVETYPE_BLS12381!=MONTGOMERY
+    BLS12381::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    BLS12381::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(BLS12381::FP *r, BLS12381::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B384_58::BIG x, int s);
+
+#if CURVETYPE_BLS12381==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B384_58::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B384_58::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B384_58::BIG x, B384_58::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B384_58::BIG x, B384_58::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B384_58::BIG e, B384_58::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B384_58::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B384_58::BIG e, B384_58::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B384_58::BIG e, B384_58::BIG f, B384_58::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B384_58::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, BLS12381::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B384_58::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_BLS12383.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_BLS12383.h
new file mode 100644
index 0000000..2fe74e0
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_BLS12383.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_BLS12383_H
+#define ECP_BLS12383_H
+
+#include "fp_BLS12383.h"
+#include "config_curve_BLS12383.h"
+
+using namespace core;
+
+namespace BLS12383 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B384_58::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B384_58::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B384_58::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B384_58::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B384_58::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B384_58::BIG CURVE_Ad;
+extern const B384_58::BIG CURVE_Bd;
+extern const B384_58::BIG PC[];
+
+extern const B384_58::BIG CURVE_Adr;
+extern const B384_58::BIG CURVE_Adi;
+extern const B384_58::BIG CURVE_Bdr;
+extern const B384_58::BIG CURVE_Bdi;
+extern const B384_58::BIG PCR[];
+extern const B384_58::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B384_58::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B384_58::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B384_58::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B384_58::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B384_58::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B384_58::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B384_58::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B384_58::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B384_58::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B384_58::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B384_58::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B384_58::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B384_58::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    BLS12383::FP x; /**< x-coordinate of point */
+#if CURVETYPE_BLS12383!=MONTGOMERY
+    BLS12383::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    BLS12383::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(BLS12383::FP *r, BLS12383::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B384_58::BIG x, int s);
+
+#if CURVETYPE_BLS12383==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B384_58::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B384_58::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B384_58::BIG x, B384_58::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B384_58::BIG x, B384_58::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B384_58::BIG e, B384_58::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B384_58::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B384_58::BIG e, B384_58::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B384_58::BIG e, B384_58::BIG f, B384_58::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B384_58::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, BLS12383::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B384_58::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_BLS12443.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_BLS12443.h
new file mode 100644
index 0000000..fb53c07
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_BLS12443.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_BLS12443_H
+#define ECP_BLS12443_H
+
+#include "fp_BLS12443.h"
+#include "config_curve_BLS12443.h"
+
+using namespace core;
+
+namespace BLS12443 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B448_60::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B448_60::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B448_60::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B448_60::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B448_60::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B448_60::BIG CURVE_Ad;
+extern const B448_60::BIG CURVE_Bd;
+extern const B448_60::BIG PC[];
+
+extern const B448_60::BIG CURVE_Adr;
+extern const B448_60::BIG CURVE_Adi;
+extern const B448_60::BIG CURVE_Bdr;
+extern const B448_60::BIG CURVE_Bdi;
+extern const B448_60::BIG PCR[];
+extern const B448_60::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B448_60::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B448_60::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B448_60::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B448_60::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B448_60::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B448_60::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B448_60::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B448_60::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B448_60::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B448_60::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B448_60::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B448_60::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B448_60::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    BLS12443::FP x; /**< x-coordinate of point */
+#if CURVETYPE_BLS12443!=MONTGOMERY
+    BLS12443::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    BLS12443::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(BLS12443::FP *r, BLS12443::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B448_60::BIG x, int s);
+
+#if CURVETYPE_BLS12443==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B448_60::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B448_60::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B448_60::BIG x, B448_60::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B448_60::BIG x, B448_60::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B448_60::BIG e, B448_60::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B448_60::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B448_60::BIG e, B448_60::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B448_60::BIG e, B448_60::BIG f, B448_60::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B448_60::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, BLS12443::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B448_60::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_BLS12461.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_BLS12461.h
new file mode 100644
index 0000000..ba041e2
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_BLS12461.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_BLS12461_H
+#define ECP_BLS12461_H
+
+#include "fp_BLS12461.h"
+#include "config_curve_BLS12461.h"
+
+using namespace core;
+
+namespace BLS12461 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B464_60::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B464_60::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B464_60::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B464_60::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B464_60::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B464_60::BIG CURVE_Ad;
+extern const B464_60::BIG CURVE_Bd;
+extern const B464_60::BIG PC[];
+
+extern const B464_60::BIG CURVE_Adr;
+extern const B464_60::BIG CURVE_Adi;
+extern const B464_60::BIG CURVE_Bdr;
+extern const B464_60::BIG CURVE_Bdi;
+extern const B464_60::BIG PCR[];
+extern const B464_60::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B464_60::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B464_60::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B464_60::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B464_60::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B464_60::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B464_60::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B464_60::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B464_60::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B464_60::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B464_60::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B464_60::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B464_60::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B464_60::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    BLS12461::FP x; /**< x-coordinate of point */
+#if CURVETYPE_BLS12461!=MONTGOMERY
+    BLS12461::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    BLS12461::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(BLS12461::FP *r, BLS12461::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B464_60::BIG x, int s);
+
+#if CURVETYPE_BLS12461==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B464_60::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B464_60::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B464_60::BIG x, B464_60::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B464_60::BIG x, B464_60::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B464_60::BIG e, B464_60::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B464_60::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B464_60::BIG e, B464_60::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B464_60::BIG e, B464_60::BIG f, B464_60::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B464_60::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, BLS12461::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B464_60::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_BLS24479.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_BLS24479.h
new file mode 100644
index 0000000..8c15a99
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_BLS24479.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_BLS24479_H
+#define ECP_BLS24479_H
+
+#include "fp_BLS24479.h"
+#include "config_curve_BLS24479.h"
+
+using namespace core;
+
+namespace BLS24479 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B480_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B480_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B480_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B480_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B480_56::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B480_56::BIG CURVE_Ad;
+extern const B480_56::BIG CURVE_Bd;
+extern const B480_56::BIG PC[];
+
+extern const B480_56::BIG CURVE_Adr;
+extern const B480_56::BIG CURVE_Adi;
+extern const B480_56::BIG CURVE_Bdr;
+extern const B480_56::BIG CURVE_Bdi;
+extern const B480_56::BIG PCR[];
+extern const B480_56::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B480_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B480_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B480_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B480_56::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B480_56::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B480_56::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B480_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B480_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B480_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B480_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B480_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B480_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B480_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    BLS24479::FP x; /**< x-coordinate of point */
+#if CURVETYPE_BLS24479!=MONTGOMERY
+    BLS24479::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    BLS24479::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(BLS24479::FP *r, BLS24479::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B480_56::BIG x, int s);
+
+#if CURVETYPE_BLS24479==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B480_56::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B480_56::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B480_56::BIG x, B480_56::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B480_56::BIG x, B480_56::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B480_56::BIG e, B480_56::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B480_56::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B480_56::BIG e, B480_56::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B480_56::BIG e, B480_56::BIG f, B480_56::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B480_56::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, BLS24479::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B480_56::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_BLS48286.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_BLS48286.h
new file mode 100644
index 0000000..8521f8b
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_BLS48286.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_BLS48286_H
+#define ECP_BLS48286_H
+
+#include "fp_BLS48286.h"
+#include "config_curve_BLS48286.h"
+
+using namespace core;
+
+namespace BLS48286 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B288_60::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B288_60::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B288_60::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B288_60::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B288_60::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B288_60::BIG CURVE_Ad;
+extern const B288_60::BIG CURVE_Bd;
+extern const B288_60::BIG PC[];
+
+extern const B288_60::BIG CURVE_Adr;
+extern const B288_60::BIG CURVE_Adi;
+extern const B288_60::BIG CURVE_Bdr;
+extern const B288_60::BIG CURVE_Bdi;
+extern const B288_60::BIG PCR[];
+extern const B288_60::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B288_60::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B288_60::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B288_60::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B288_60::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B288_60::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B288_60::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B288_60::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B288_60::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B288_60::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B288_60::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B288_60::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B288_60::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B288_60::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    BLS48286::FP x; /**< x-coordinate of point */
+#if CURVETYPE_BLS48286!=MONTGOMERY
+    BLS48286::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    BLS48286::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(BLS48286::FP *r, BLS48286::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B288_60::BIG x, int s);
+
+#if CURVETYPE_BLS48286==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B288_60::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B288_60::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B288_60::BIG x, B288_60::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B288_60::BIG x, B288_60::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B288_60::BIG e, B288_60::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B288_60::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B288_60::BIG e, B288_60::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B288_60::BIG e, B288_60::BIG f, B288_60::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B288_60::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, BLS48286::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B288_60::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_BLS48556.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_BLS48556.h
new file mode 100644
index 0000000..e295d4d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_BLS48556.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_BLS48556_H
+#define ECP_BLS48556_H
+
+#include "fp_BLS48556.h"
+#include "config_curve_BLS48556.h"
+
+using namespace core;
+
+namespace BLS48556 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B560_58::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B560_58::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B560_58::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B560_58::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B560_58::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B560_58::BIG CURVE_Ad;
+extern const B560_58::BIG CURVE_Bd;
+extern const B560_58::BIG PC[];
+
+extern const B560_58::BIG CURVE_Adr;
+extern const B560_58::BIG CURVE_Adi;
+extern const B560_58::BIG CURVE_Bdr;
+extern const B560_58::BIG CURVE_Bdi;
+extern const B560_58::BIG PCR[];
+extern const B560_58::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B560_58::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B560_58::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B560_58::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B560_58::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B560_58::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B560_58::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B560_58::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B560_58::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B560_58::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B560_58::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B560_58::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B560_58::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B560_58::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    BLS48556::FP x; /**< x-coordinate of point */
+#if CURVETYPE_BLS48556!=MONTGOMERY
+    BLS48556::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    BLS48556::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(BLS48556::FP *r, BLS48556::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B560_58::BIG x, int s);
+
+#if CURVETYPE_BLS48556==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B560_58::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B560_58::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B560_58::BIG x, B560_58::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B560_58::BIG x, B560_58::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B560_58::BIG e, B560_58::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B560_58::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B560_58::BIG e, B560_58::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B560_58::BIG e, B560_58::BIG f, B560_58::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B560_58::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, BLS48556::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B560_58::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_BLS48581.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_BLS48581.h
new file mode 100644
index 0000000..82421e0
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_BLS48581.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_BLS48581_H
+#define ECP_BLS48581_H
+
+#include "fp_BLS48581.h"
+#include "config_curve_BLS48581.h"
+
+using namespace core;
+
+namespace BLS48581 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B584_60::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B584_60::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B584_60::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B584_60::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B584_60::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B584_60::BIG CURVE_Ad;
+extern const B584_60::BIG CURVE_Bd;
+extern const B584_60::BIG PC[];
+
+extern const B584_60::BIG CURVE_Adr;
+extern const B584_60::BIG CURVE_Adi;
+extern const B584_60::BIG CURVE_Bdr;
+extern const B584_60::BIG CURVE_Bdi;
+extern const B584_60::BIG PCR[];
+extern const B584_60::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B584_60::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B584_60::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B584_60::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B584_60::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B584_60::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B584_60::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B584_60::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B584_60::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B584_60::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B584_60::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B584_60::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B584_60::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B584_60::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    BLS48581::FP x; /**< x-coordinate of point */
+#if CURVETYPE_BLS48581!=MONTGOMERY
+    BLS48581::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    BLS48581::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(BLS48581::FP *r, BLS48581::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B584_60::BIG x, int s);
+
+#if CURVETYPE_BLS48581==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B584_60::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B584_60::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B584_60::BIG x, B584_60::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B584_60::BIG x, B584_60::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B584_60::BIG e, B584_60::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B584_60::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B584_60::BIG e, B584_60::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B584_60::BIG e, B584_60::BIG f, B584_60::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B584_60::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, BLS48581::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B584_60::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_BN158.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_BN158.h
new file mode 100644
index 0000000..e185a5d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_BN158.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_BN158_H
+#define ECP_BN158_H
+
+#include "fp_BN158.h"
+#include "config_curve_BN158.h"
+
+using namespace core;
+
+namespace BN158 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B160_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B160_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B160_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B160_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B160_56::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B160_56::BIG CURVE_Ad;
+extern const B160_56::BIG CURVE_Bd;
+extern const B160_56::BIG PC[];
+
+extern const B160_56::BIG CURVE_Adr;
+extern const B160_56::BIG CURVE_Adi;
+extern const B160_56::BIG CURVE_Bdr;
+extern const B160_56::BIG CURVE_Bdi;
+extern const B160_56::BIG PCR[];
+extern const B160_56::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B160_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B160_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B160_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B160_56::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B160_56::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B160_56::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B160_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B160_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B160_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B160_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B160_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B160_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B160_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    BN158::FP x; /**< x-coordinate of point */
+#if CURVETYPE_BN158!=MONTGOMERY
+    BN158::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    BN158::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(BN158::FP *r, BN158::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B160_56::BIG x, int s);
+
+#if CURVETYPE_BN158==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B160_56::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B160_56::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B160_56::BIG x, B160_56::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B160_56::BIG x, B160_56::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B160_56::BIG e, B160_56::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B160_56::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B160_56::BIG e, B160_56::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B160_56::BIG e, B160_56::BIG f, B160_56::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B160_56::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, BN158::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B160_56::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_BN254.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_BN254.h
new file mode 100644
index 0000000..9859f91
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_BN254.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_BN254_H
+#define ECP_BN254_H
+
+#include "fp_BN254.h"
+#include "config_curve_BN254.h"
+
+using namespace core;
+
+namespace BN254 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B256_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B256_56::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B256_56::BIG CURVE_Ad;
+extern const B256_56::BIG CURVE_Bd;
+extern const B256_56::BIG PC[];
+
+extern const B256_56::BIG CURVE_Adr;
+extern const B256_56::BIG CURVE_Adi;
+extern const B256_56::BIG CURVE_Bdr;
+extern const B256_56::BIG CURVE_Bdi;
+extern const B256_56::BIG PCR[];
+extern const B256_56::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B256_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B256_56::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B256_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B256_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B256_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    BN254::FP x; /**< x-coordinate of point */
+#if CURVETYPE_BN254!=MONTGOMERY
+    BN254::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    BN254::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(BN254::FP *r, BN254::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B256_56::BIG x, int s);
+
+#if CURVETYPE_BN254==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B256_56::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x, B256_56::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B256_56::BIG x, B256_56::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B256_56::BIG e, B256_56::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B256_56::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f, B256_56::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B256_56::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, BN254::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B256_56::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_BN254CX.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_BN254CX.h
new file mode 100644
index 0000000..84ff680
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_BN254CX.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_BN254CX_H
+#define ECP_BN254CX_H
+
+#include "fp_BN254CX.h"
+#include "config_curve_BN254CX.h"
+
+using namespace core;
+
+namespace BN254CX {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B256_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B256_56::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B256_56::BIG CURVE_Ad;
+extern const B256_56::BIG CURVE_Bd;
+extern const B256_56::BIG PC[];
+
+extern const B256_56::BIG CURVE_Adr;
+extern const B256_56::BIG CURVE_Adi;
+extern const B256_56::BIG CURVE_Bdr;
+extern const B256_56::BIG CURVE_Bdi;
+extern const B256_56::BIG PCR[];
+extern const B256_56::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B256_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B256_56::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B256_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B256_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B256_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    BN254CX::FP x; /**< x-coordinate of point */
+#if CURVETYPE_BN254CX!=MONTGOMERY
+    BN254CX::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    BN254CX::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(BN254CX::FP *r, BN254CX::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B256_56::BIG x, int s);
+
+#if CURVETYPE_BN254CX==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B256_56::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x, B256_56::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B256_56::BIG x, B256_56::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B256_56::BIG e, B256_56::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B256_56::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f, B256_56::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B256_56::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, BN254CX::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B256_56::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_BN462.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_BN462.h
new file mode 100644
index 0000000..a356251
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_BN462.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_BN462_H
+#define ECP_BN462_H
+
+#include "fp_BN462.h"
+#include "config_curve_BN462.h"
+
+using namespace core;
+
+namespace BN462 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B464_60::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B464_60::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B464_60::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B464_60::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B464_60::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B464_60::BIG CURVE_Ad;
+extern const B464_60::BIG CURVE_Bd;
+extern const B464_60::BIG PC[];
+
+extern const B464_60::BIG CURVE_Adr;
+extern const B464_60::BIG CURVE_Adi;
+extern const B464_60::BIG CURVE_Bdr;
+extern const B464_60::BIG CURVE_Bdi;
+extern const B464_60::BIG PCR[];
+extern const B464_60::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B464_60::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B464_60::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B464_60::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B464_60::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B464_60::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B464_60::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B464_60::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B464_60::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B464_60::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B464_60::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B464_60::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B464_60::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B464_60::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    BN462::FP x; /**< x-coordinate of point */
+#if CURVETYPE_BN462!=MONTGOMERY
+    BN462::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    BN462::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(BN462::FP *r, BN462::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B464_60::BIG x, int s);
+
+#if CURVETYPE_BN462==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B464_60::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B464_60::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B464_60::BIG x, B464_60::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B464_60::BIG x, B464_60::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B464_60::BIG e, B464_60::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B464_60::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B464_60::BIG e, B464_60::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B464_60::BIG e, B464_60::BIG f, B464_60::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B464_60::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, BN462::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B464_60::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_BRAINPOOL.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_BRAINPOOL.h
new file mode 100644
index 0000000..a655093
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_BRAINPOOL.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_BRAINPOOL_H
+#define ECP_BRAINPOOL_H
+
+#include "fp_BRAINPOOL.h"
+#include "config_curve_BRAINPOOL.h"
+
+using namespace core;
+
+namespace BRAINPOOL {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B256_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B256_56::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B256_56::BIG CURVE_Ad;
+extern const B256_56::BIG CURVE_Bd;
+extern const B256_56::BIG PC[];
+
+extern const B256_56::BIG CURVE_Adr;
+extern const B256_56::BIG CURVE_Adi;
+extern const B256_56::BIG CURVE_Bdr;
+extern const B256_56::BIG CURVE_Bdi;
+extern const B256_56::BIG PCR[];
+extern const B256_56::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B256_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B256_56::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B256_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B256_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B256_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    BRAINPOOL::FP x; /**< x-coordinate of point */
+#if CURVETYPE_BRAINPOOL!=MONTGOMERY
+    BRAINPOOL::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    BRAINPOOL::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(BRAINPOOL::FP *r, BRAINPOOL::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B256_56::BIG x, int s);
+
+#if CURVETYPE_BRAINPOOL==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B256_56::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x, B256_56::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B256_56::BIG x, B256_56::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B256_56::BIG e, B256_56::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B256_56::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f, B256_56::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B256_56::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, BRAINPOOL::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B256_56::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_C1174.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_C1174.h
new file mode 100644
index 0000000..23604e5
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_C1174.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_C1174_H
+#define ECP_C1174_H
+
+#include "fp_C1174.h"
+#include "config_curve_C1174.h"
+
+using namespace core;
+
+namespace C1174 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B256_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B256_56::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B256_56::BIG CURVE_Ad;
+extern const B256_56::BIG CURVE_Bd;
+extern const B256_56::BIG PC[];
+
+extern const B256_56::BIG CURVE_Adr;
+extern const B256_56::BIG CURVE_Adi;
+extern const B256_56::BIG CURVE_Bdr;
+extern const B256_56::BIG CURVE_Bdi;
+extern const B256_56::BIG PCR[];
+extern const B256_56::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B256_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B256_56::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B256_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B256_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B256_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    C1174::FP x; /**< x-coordinate of point */
+#if CURVETYPE_C1174!=MONTGOMERY
+    C1174::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    C1174::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(C1174::FP *r, C1174::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B256_56::BIG x, int s);
+
+#if CURVETYPE_C1174==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B256_56::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x, B256_56::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B256_56::BIG x, B256_56::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B256_56::BIG e, B256_56::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B256_56::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f, B256_56::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B256_56::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, C1174::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B256_56::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_C13318.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_C13318.h
new file mode 100644
index 0000000..d76e729
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_C13318.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_C13318_H
+#define ECP_C13318_H
+
+#include "fp_F25519.h"
+#include "config_curve_C13318.h"
+
+using namespace core;
+
+namespace C13318 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B256_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B256_56::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B256_56::BIG CURVE_Ad;
+extern const B256_56::BIG CURVE_Bd;
+extern const B256_56::BIG PC[];
+
+extern const B256_56::BIG CURVE_Adr;
+extern const B256_56::BIG CURVE_Adi;
+extern const B256_56::BIG CURVE_Bdr;
+extern const B256_56::BIG CURVE_Bdi;
+extern const B256_56::BIG PCR[];
+extern const B256_56::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B256_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B256_56::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B256_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B256_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B256_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    F25519::FP x; /**< x-coordinate of point */
+#if CURVETYPE_C13318!=MONTGOMERY
+    F25519::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    F25519::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(F25519::FP *r, F25519::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B256_56::BIG x, int s);
+
+#if CURVETYPE_C13318==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B256_56::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x, B256_56::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B256_56::BIG x, B256_56::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B256_56::BIG e, B256_56::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B256_56::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f, B256_56::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B256_56::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, F25519::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B256_56::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_C1665.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_C1665.h
new file mode 100644
index 0000000..f1f4e28
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_C1665.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_C1665_H
+#define ECP_C1665_H
+
+#include "fp_C1665.h"
+#include "config_curve_C1665.h"
+
+using namespace core;
+
+namespace C1665 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B168_60::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B168_60::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B168_60::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B168_60::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B168_60::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B168_60::BIG CURVE_Ad;
+extern const B168_60::BIG CURVE_Bd;
+extern const B168_60::BIG PC[];
+
+extern const B168_60::BIG CURVE_Adr;
+extern const B168_60::BIG CURVE_Adi;
+extern const B168_60::BIG CURVE_Bdr;
+extern const B168_60::BIG CURVE_Bdi;
+extern const B168_60::BIG PCR[];
+extern const B168_60::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B168_60::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B168_60::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B168_60::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B168_60::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B168_60::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B168_60::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B168_60::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B168_60::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B168_60::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B168_60::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B168_60::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B168_60::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B168_60::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B168_60::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B168_60::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B168_60::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B168_60::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B168_60::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B168_60::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B168_60::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B168_60::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B168_60::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B168_60::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B168_60::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B168_60::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B168_60::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B168_60::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B168_60::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B168_60::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B168_60::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B168_60::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B168_60::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B168_60::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B168_60::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B168_60::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B168_60::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B168_60::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    C1665::FP x; /**< x-coordinate of point */
+#if CURVETYPE_C1665!=MONTGOMERY
+    C1665::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    C1665::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(C1665::FP *r, C1665::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B168_60::BIG x, int s);
+
+#if CURVETYPE_C1665==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B168_60::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B168_60::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B168_60::BIG x, B168_60::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B168_60::BIG x, B168_60::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B168_60::BIG e, B168_60::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B168_60::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B168_60::BIG e, B168_60::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B168_60::BIG e, B168_60::BIG f, B168_60::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B168_60::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, C1665::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B168_60::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_C25519.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_C25519.h
new file mode 100644
index 0000000..49fd43c
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_C25519.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_C25519_H
+#define ECP_C25519_H
+
+#include "fp_F25519.h"
+#include "config_curve_C25519.h"
+
+using namespace core;
+
+namespace C25519 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B256_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B256_56::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B256_56::BIG CURVE_Ad;
+extern const B256_56::BIG CURVE_Bd;
+extern const B256_56::BIG PC[];
+
+extern const B256_56::BIG CURVE_Adr;
+extern const B256_56::BIG CURVE_Adi;
+extern const B256_56::BIG CURVE_Bdr;
+extern const B256_56::BIG CURVE_Bdi;
+extern const B256_56::BIG PCR[];
+extern const B256_56::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B256_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B256_56::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B256_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B256_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B256_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    F25519::FP x; /**< x-coordinate of point */
+#if CURVETYPE_C25519!=MONTGOMERY
+    F25519::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    F25519::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(F25519::FP *r, F25519::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B256_56::BIG x, int s);
+
+#if CURVETYPE_C25519==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B256_56::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x, B256_56::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B256_56::BIG x, B256_56::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B256_56::BIG e, B256_56::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B256_56::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f, B256_56::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B256_56::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, F25519::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B256_56::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_C41417.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_C41417.h
new file mode 100644
index 0000000..b0b62f8
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_C41417.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_C41417_H
+#define ECP_C41417_H
+
+#include "fp_C41417.h"
+#include "config_curve_C41417.h"
+
+using namespace core;
+
+namespace C41417 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B416_60::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B416_60::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B416_60::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B416_60::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B416_60::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B416_60::BIG CURVE_Ad;
+extern const B416_60::BIG CURVE_Bd;
+extern const B416_60::BIG PC[];
+
+extern const B416_60::BIG CURVE_Adr;
+extern const B416_60::BIG CURVE_Adi;
+extern const B416_60::BIG CURVE_Bdr;
+extern const B416_60::BIG CURVE_Bdi;
+extern const B416_60::BIG PCR[];
+extern const B416_60::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B416_60::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B416_60::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B416_60::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B416_60::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B416_60::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B416_60::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B416_60::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B416_60::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B416_60::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B416_60::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B416_60::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B416_60::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B416_60::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B416_60::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B416_60::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B416_60::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B416_60::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B416_60::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B416_60::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B416_60::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B416_60::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B416_60::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B416_60::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B416_60::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B416_60::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B416_60::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B416_60::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B416_60::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B416_60::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B416_60::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B416_60::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B416_60::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B416_60::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B416_60::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B416_60::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B416_60::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B416_60::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    C41417::FP x; /**< x-coordinate of point */
+#if CURVETYPE_C41417!=MONTGOMERY
+    C41417::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    C41417::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(C41417::FP *r, C41417::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B416_60::BIG x, int s);
+
+#if CURVETYPE_C41417==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B416_60::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B416_60::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B416_60::BIG x, B416_60::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B416_60::BIG x, B416_60::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B416_60::BIG e, B416_60::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B416_60::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B416_60::BIG e, B416_60::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B416_60::BIG e, B416_60::BIG f, B416_60::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B416_60::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, C41417::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B416_60::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_Ed25519.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_Ed25519.h
new file mode 100644
index 0000000..a981276
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_Ed25519.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_Ed25519_H
+#define ECP_Ed25519_H
+
+#include "fp_F25519.h"
+#include "config_curve_Ed25519.h"
+
+using namespace core;
+
+namespace Ed25519 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B256_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B256_56::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B256_56::BIG CURVE_Ad;
+extern const B256_56::BIG CURVE_Bd;
+extern const B256_56::BIG PC[];
+
+extern const B256_56::BIG CURVE_Adr;
+extern const B256_56::BIG CURVE_Adi;
+extern const B256_56::BIG CURVE_Bdr;
+extern const B256_56::BIG CURVE_Bdi;
+extern const B256_56::BIG PCR[];
+extern const B256_56::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B256_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B256_56::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B256_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B256_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B256_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    F25519::FP x; /**< x-coordinate of point */
+#if CURVETYPE_Ed25519!=MONTGOMERY
+    F25519::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    F25519::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(F25519::FP *r, F25519::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B256_56::BIG x, int s);
+
+#if CURVETYPE_Ed25519==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B256_56::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x, B256_56::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B256_56::BIG x, B256_56::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B256_56::BIG e, B256_56::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B256_56::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f, B256_56::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B256_56::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, F25519::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B256_56::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_Ed448.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_Ed448.h
new file mode 100644
index 0000000..b8cb07a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_Ed448.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_Ed448_H
+#define ECP_Ed448_H
+
+#include "fp_F448.h"
+#include "config_curve_Ed448.h"
+
+using namespace core;
+
+namespace Ed448 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B448_58::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B448_58::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B448_58::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B448_58::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B448_58::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B448_58::BIG CURVE_Ad;
+extern const B448_58::BIG CURVE_Bd;
+extern const B448_58::BIG PC[];
+
+extern const B448_58::BIG CURVE_Adr;
+extern const B448_58::BIG CURVE_Adi;
+extern const B448_58::BIG CURVE_Bdr;
+extern const B448_58::BIG CURVE_Bdi;
+extern const B448_58::BIG PCR[];
+extern const B448_58::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B448_58::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B448_58::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B448_58::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B448_58::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B448_58::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B448_58::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B448_58::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B448_58::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B448_58::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B448_58::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B448_58::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B448_58::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B448_58::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    F448::FP x; /**< x-coordinate of point */
+#if CURVETYPE_Ed448!=MONTGOMERY
+    F448::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    F448::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(F448::FP *r, F448::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B448_58::BIG x, int s);
+
+#if CURVETYPE_Ed448==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B448_58::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B448_58::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B448_58::BIG x, B448_58::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B448_58::BIG x, B448_58::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B448_58::BIG e, B448_58::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B448_58::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B448_58::BIG e, B448_58::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B448_58::BIG e, B448_58::BIG f, B448_58::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B448_58::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, F448::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B448_58::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_FP256BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_FP256BN.h
new file mode 100644
index 0000000..fbecaf3
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_FP256BN.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_FP256BN_H
+#define ECP_FP256BN_H
+
+#include "fp_FP256BN.h"
+#include "config_curve_FP256BN.h"
+
+using namespace core;
+
+namespace FP256BN {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B256_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B256_56::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B256_56::BIG CURVE_Ad;
+extern const B256_56::BIG CURVE_Bd;
+extern const B256_56::BIG PC[];
+
+extern const B256_56::BIG CURVE_Adr;
+extern const B256_56::BIG CURVE_Adi;
+extern const B256_56::BIG CURVE_Bdr;
+extern const B256_56::BIG CURVE_Bdi;
+extern const B256_56::BIG PCR[];
+extern const B256_56::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B256_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B256_56::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B256_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B256_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B256_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    FP256BN::FP x; /**< x-coordinate of point */
+#if CURVETYPE_FP256BN!=MONTGOMERY
+    FP256BN::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    FP256BN::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(FP256BN::FP *r, FP256BN::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B256_56::BIG x, int s);
+
+#if CURVETYPE_FP256BN==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B256_56::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x, B256_56::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B256_56::BIG x, B256_56::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B256_56::BIG e, B256_56::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B256_56::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f, B256_56::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B256_56::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, FP256BN::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B256_56::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_FP512BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_FP512BN.h
new file mode 100644
index 0000000..e4d02d4
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_FP512BN.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_FP512BN_H
+#define ECP_FP512BN_H
+
+#include "fp_FP512BN.h"
+#include "config_curve_FP512BN.h"
+
+using namespace core;
+
+namespace FP512BN {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B512_60::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B512_60::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B512_60::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B512_60::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B512_60::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B512_60::BIG CURVE_Ad;
+extern const B512_60::BIG CURVE_Bd;
+extern const B512_60::BIG PC[];
+
+extern const B512_60::BIG CURVE_Adr;
+extern const B512_60::BIG CURVE_Adi;
+extern const B512_60::BIG CURVE_Bdr;
+extern const B512_60::BIG CURVE_Bdi;
+extern const B512_60::BIG PCR[];
+extern const B512_60::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B512_60::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B512_60::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B512_60::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B512_60::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B512_60::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B512_60::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B512_60::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B512_60::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B512_60::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B512_60::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B512_60::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B512_60::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B512_60::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    FP512BN::FP x; /**< x-coordinate of point */
+#if CURVETYPE_FP512BN!=MONTGOMERY
+    FP512BN::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    FP512BN::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(FP512BN::FP *r, FP512BN::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B512_60::BIG x, int s);
+
+#if CURVETYPE_FP512BN==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B512_60::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B512_60::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B512_60::BIG x, B512_60::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B512_60::BIG x, B512_60::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B512_60::BIG e, B512_60::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B512_60::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B512_60::BIG e, B512_60::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B512_60::BIG e, B512_60::BIG f, B512_60::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B512_60::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, FP512BN::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B512_60::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_HIFIVE.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_HIFIVE.h
new file mode 100644
index 0000000..3fcc24c
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_HIFIVE.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_HIFIVE_H
+#define ECP_HIFIVE_H
+
+#include "fp_HIFIVE.h"
+#include "config_curve_HIFIVE.h"
+
+using namespace core;
+
+namespace HIFIVE {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B336_60::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B336_60::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B336_60::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B336_60::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B336_60::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B336_60::BIG CURVE_Ad;
+extern const B336_60::BIG CURVE_Bd;
+extern const B336_60::BIG PC[];
+
+extern const B336_60::BIG CURVE_Adr;
+extern const B336_60::BIG CURVE_Adi;
+extern const B336_60::BIG CURVE_Bdr;
+extern const B336_60::BIG CURVE_Bdi;
+extern const B336_60::BIG PCR[];
+extern const B336_60::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B336_60::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B336_60::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B336_60::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B336_60::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B336_60::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B336_60::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B336_60::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B336_60::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B336_60::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B336_60::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B336_60::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B336_60::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B336_60::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B336_60::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B336_60::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B336_60::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B336_60::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B336_60::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B336_60::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B336_60::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B336_60::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B336_60::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B336_60::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B336_60::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B336_60::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B336_60::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B336_60::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B336_60::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B336_60::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B336_60::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B336_60::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B336_60::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B336_60::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B336_60::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B336_60::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B336_60::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B336_60::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    HIFIVE::FP x; /**< x-coordinate of point */
+#if CURVETYPE_HIFIVE!=MONTGOMERY
+    HIFIVE::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    HIFIVE::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(HIFIVE::FP *r, HIFIVE::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B336_60::BIG x, int s);
+
+#if CURVETYPE_HIFIVE==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B336_60::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B336_60::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B336_60::BIG x, B336_60::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B336_60::BIG x, B336_60::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B336_60::BIG e, B336_60::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B336_60::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B336_60::BIG e, B336_60::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B336_60::BIG e, B336_60::BIG f, B336_60::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B336_60::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, HIFIVE::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B336_60::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_JUBJUB.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_JUBJUB.h
new file mode 100644
index 0000000..d3eac2b
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_JUBJUB.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_JUBJUB_H
+#define ECP_JUBJUB_H
+
+#include "fp_JUBJUB.h"
+#include "config_curve_JUBJUB.h"
+
+using namespace core;
+
+namespace JUBJUB {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B256_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B256_56::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B256_56::BIG CURVE_Ad;
+extern const B256_56::BIG CURVE_Bd;
+extern const B256_56::BIG PC[];
+
+extern const B256_56::BIG CURVE_Adr;
+extern const B256_56::BIG CURVE_Adi;
+extern const B256_56::BIG CURVE_Bdr;
+extern const B256_56::BIG CURVE_Bdi;
+extern const B256_56::BIG PCR[];
+extern const B256_56::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B256_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B256_56::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B256_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B256_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B256_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    JUBJUB::FP x; /**< x-coordinate of point */
+#if CURVETYPE_JUBJUB!=MONTGOMERY
+    JUBJUB::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    JUBJUB::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(JUBJUB::FP *r, JUBJUB::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B256_56::BIG x, int s);
+
+#if CURVETYPE_JUBJUB==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B256_56::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x, B256_56::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B256_56::BIG x, B256_56::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B256_56::BIG e, B256_56::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B256_56::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f, B256_56::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B256_56::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, JUBJUB::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B256_56::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_MDC.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_MDC.h
new file mode 100644
index 0000000..e47d5e8
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_MDC.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_MDC_H
+#define ECP_MDC_H
+
+#include "fp_MDC.h"
+#include "config_curve_MDC.h"
+
+using namespace core;
+
+namespace MDC {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B256_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B256_56::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B256_56::BIG CURVE_Ad;
+extern const B256_56::BIG CURVE_Bd;
+extern const B256_56::BIG PC[];
+
+extern const B256_56::BIG CURVE_Adr;
+extern const B256_56::BIG CURVE_Adi;
+extern const B256_56::BIG CURVE_Bdr;
+extern const B256_56::BIG CURVE_Bdi;
+extern const B256_56::BIG PCR[];
+extern const B256_56::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B256_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B256_56::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B256_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B256_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B256_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    MDC::FP x; /**< x-coordinate of point */
+#if CURVETYPE_MDC!=MONTGOMERY
+    MDC::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    MDC::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(MDC::FP *r, MDC::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B256_56::BIG x, int s);
+
+#if CURVETYPE_MDC==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B256_56::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x, B256_56::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B256_56::BIG x, B256_56::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B256_56::BIG e, B256_56::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B256_56::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f, B256_56::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B256_56::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, MDC::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B256_56::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_NIST256.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_NIST256.h
new file mode 100644
index 0000000..4151ec0
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_NIST256.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_NIST256_H
+#define ECP_NIST256_H
+
+#include "fp_NIST256.h"
+#include "config_curve_NIST256.h"
+
+using namespace core;
+
+namespace NIST256 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B256_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B256_56::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B256_56::BIG CURVE_Ad;
+extern const B256_56::BIG CURVE_Bd;
+extern const B256_56::BIG PC[];
+
+extern const B256_56::BIG CURVE_Adr;
+extern const B256_56::BIG CURVE_Adi;
+extern const B256_56::BIG CURVE_Bdr;
+extern const B256_56::BIG CURVE_Bdi;
+extern const B256_56::BIG PCR[];
+extern const B256_56::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B256_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B256_56::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B256_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B256_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B256_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    NIST256::FP x; /**< x-coordinate of point */
+#if CURVETYPE_NIST256!=MONTGOMERY
+    NIST256::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    NIST256::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(NIST256::FP *r, NIST256::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B256_56::BIG x, int s);
+
+#if CURVETYPE_NIST256==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B256_56::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x, B256_56::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B256_56::BIG x, B256_56::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B256_56::BIG e, B256_56::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B256_56::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f, B256_56::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B256_56::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, NIST256::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B256_56::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_NIST384.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_NIST384.h
new file mode 100644
index 0000000..18e6373
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_NIST384.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_NIST384_H
+#define ECP_NIST384_H
+
+#include "fp_NIST384.h"
+#include "config_curve_NIST384.h"
+
+using namespace core;
+
+namespace NIST384 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B384_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B384_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B384_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B384_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B384_56::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B384_56::BIG CURVE_Ad;
+extern const B384_56::BIG CURVE_Bd;
+extern const B384_56::BIG PC[];
+
+extern const B384_56::BIG CURVE_Adr;
+extern const B384_56::BIG CURVE_Adi;
+extern const B384_56::BIG CURVE_Bdr;
+extern const B384_56::BIG CURVE_Bdi;
+extern const B384_56::BIG PCR[];
+extern const B384_56::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B384_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B384_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B384_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B384_56::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_56::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_56::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_56::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_56::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_56::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_56::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_56::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B384_56::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_56::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_56::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_56::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_56::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_56::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_56::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_56::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B384_56::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_56::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_56::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_56::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_56::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_56::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_56::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_56::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B384_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B384_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B384_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B384_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B384_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B384_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B384_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    NIST384::FP x; /**< x-coordinate of point */
+#if CURVETYPE_NIST384!=MONTGOMERY
+    NIST384::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    NIST384::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(NIST384::FP *r, NIST384::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B384_56::BIG x, int s);
+
+#if CURVETYPE_NIST384==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B384_56::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B384_56::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B384_56::BIG x, B384_56::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B384_56::BIG x, B384_56::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B384_56::BIG e, B384_56::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B384_56::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B384_56::BIG e, B384_56::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B384_56::BIG e, B384_56::BIG f, B384_56::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B384_56::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, NIST384::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B384_56::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_NIST521.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_NIST521.h
new file mode 100644
index 0000000..30ff2fc
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_NIST521.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_NIST521_H
+#define ECP_NIST521_H
+
+#include "fp_NIST521.h"
+#include "config_curve_NIST521.h"
+
+using namespace core;
+
+namespace NIST521 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B528_60::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B528_60::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B528_60::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B528_60::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B528_60::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B528_60::BIG CURVE_Ad;
+extern const B528_60::BIG CURVE_Bd;
+extern const B528_60::BIG PC[];
+
+extern const B528_60::BIG CURVE_Adr;
+extern const B528_60::BIG CURVE_Adi;
+extern const B528_60::BIG CURVE_Bdr;
+extern const B528_60::BIG CURVE_Bdi;
+extern const B528_60::BIG PCR[];
+extern const B528_60::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B528_60::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B528_60::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B528_60::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B528_60::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B528_60::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B528_60::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B528_60::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B528_60::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B528_60::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B528_60::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B528_60::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B528_60::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B528_60::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B528_60::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B528_60::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B528_60::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B528_60::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B528_60::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B528_60::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B528_60::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B528_60::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B528_60::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B528_60::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B528_60::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B528_60::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B528_60::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B528_60::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B528_60::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B528_60::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B528_60::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B528_60::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B528_60::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B528_60::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B528_60::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B528_60::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B528_60::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B528_60::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    NIST521::FP x; /**< x-coordinate of point */
+#if CURVETYPE_NIST521!=MONTGOMERY
+    NIST521::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    NIST521::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(NIST521::FP *r, NIST521::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B528_60::BIG x, int s);
+
+#if CURVETYPE_NIST521==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B528_60::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B528_60::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B528_60::BIG x, B528_60::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B528_60::BIG x, B528_60::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B528_60::BIG e, B528_60::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B528_60::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B528_60::BIG e, B528_60::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B528_60::BIG e, B528_60::BIG f, B528_60::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B528_60::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, NIST521::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B528_60::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_NUMS256E.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_NUMS256E.h
new file mode 100644
index 0000000..0cd09d8
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_NUMS256E.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_NUMS256E_H
+#define ECP_NUMS256E_H
+
+#include "fp_F256PME.h"
+#include "config_curve_NUMS256E.h"
+
+using namespace core;
+
+namespace NUMS256E {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B256_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B256_56::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B256_56::BIG CURVE_Ad;
+extern const B256_56::BIG CURVE_Bd;
+extern const B256_56::BIG PC[];
+
+extern const B256_56::BIG CURVE_Adr;
+extern const B256_56::BIG CURVE_Adi;
+extern const B256_56::BIG CURVE_Bdr;
+extern const B256_56::BIG CURVE_Bdi;
+extern const B256_56::BIG PCR[];
+extern const B256_56::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B256_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B256_56::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B256_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B256_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B256_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    F256PME::FP x; /**< x-coordinate of point */
+#if CURVETYPE_NUMS256E!=MONTGOMERY
+    F256PME::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    F256PME::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(F256PME::FP *r, F256PME::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B256_56::BIG x, int s);
+
+#if CURVETYPE_NUMS256E==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B256_56::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x, B256_56::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B256_56::BIG x, B256_56::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B256_56::BIG e, B256_56::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B256_56::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f, B256_56::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B256_56::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, F256PME::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B256_56::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_NUMS256W.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_NUMS256W.h
new file mode 100644
index 0000000..b806344
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_NUMS256W.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_NUMS256W_H
+#define ECP_NUMS256W_H
+
+#include "fp_F256PMW.h"
+#include "config_curve_NUMS256W.h"
+
+using namespace core;
+
+namespace NUMS256W {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B256_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B256_56::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B256_56::BIG CURVE_Ad;
+extern const B256_56::BIG CURVE_Bd;
+extern const B256_56::BIG PC[];
+
+extern const B256_56::BIG CURVE_Adr;
+extern const B256_56::BIG CURVE_Adi;
+extern const B256_56::BIG CURVE_Bdr;
+extern const B256_56::BIG CURVE_Bdi;
+extern const B256_56::BIG PCR[];
+extern const B256_56::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B256_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B256_56::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B256_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B256_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B256_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    F256PMW::FP x; /**< x-coordinate of point */
+#if CURVETYPE_NUMS256W!=MONTGOMERY
+    F256PMW::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    F256PMW::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(F256PMW::FP *r, F256PMW::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B256_56::BIG x, int s);
+
+#if CURVETYPE_NUMS256W==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B256_56::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x, B256_56::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B256_56::BIG x, B256_56::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B256_56::BIG e, B256_56::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B256_56::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f, B256_56::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B256_56::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, F256PMW::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B256_56::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_NUMS384E.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_NUMS384E.h
new file mode 100644
index 0000000..f3d53bb
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_NUMS384E.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_NUMS384E_H
+#define ECP_NUMS384E_H
+
+#include "fp_F384PM.h"
+#include "config_curve_NUMS384E.h"
+
+using namespace core;
+
+namespace NUMS384E {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B384_58::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B384_58::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B384_58::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B384_58::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B384_58::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B384_58::BIG CURVE_Ad;
+extern const B384_58::BIG CURVE_Bd;
+extern const B384_58::BIG PC[];
+
+extern const B384_58::BIG CURVE_Adr;
+extern const B384_58::BIG CURVE_Adi;
+extern const B384_58::BIG CURVE_Bdr;
+extern const B384_58::BIG CURVE_Bdi;
+extern const B384_58::BIG PCR[];
+extern const B384_58::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B384_58::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B384_58::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B384_58::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B384_58::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B384_58::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B384_58::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B384_58::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B384_58::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B384_58::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B384_58::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B384_58::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B384_58::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B384_58::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    F384PM::FP x; /**< x-coordinate of point */
+#if CURVETYPE_NUMS384E!=MONTGOMERY
+    F384PM::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    F384PM::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(F384PM::FP *r, F384PM::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B384_58::BIG x, int s);
+
+#if CURVETYPE_NUMS384E==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B384_58::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B384_58::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B384_58::BIG x, B384_58::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B384_58::BIG x, B384_58::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B384_58::BIG e, B384_58::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B384_58::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B384_58::BIG e, B384_58::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B384_58::BIG e, B384_58::BIG f, B384_58::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B384_58::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, F384PM::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B384_58::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_NUMS384W.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_NUMS384W.h
new file mode 100644
index 0000000..bc21c94
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_NUMS384W.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_NUMS384W_H
+#define ECP_NUMS384W_H
+
+#include "fp_F384PM.h"
+#include "config_curve_NUMS384W.h"
+
+using namespace core;
+
+namespace NUMS384W {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B384_58::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B384_58::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B384_58::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B384_58::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B384_58::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B384_58::BIG CURVE_Ad;
+extern const B384_58::BIG CURVE_Bd;
+extern const B384_58::BIG PC[];
+
+extern const B384_58::BIG CURVE_Adr;
+extern const B384_58::BIG CURVE_Adi;
+extern const B384_58::BIG CURVE_Bdr;
+extern const B384_58::BIG CURVE_Bdi;
+extern const B384_58::BIG PCR[];
+extern const B384_58::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B384_58::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B384_58::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B384_58::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B384_58::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B384_58::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B384_58::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B384_58::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B384_58::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B384_58::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B384_58::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B384_58::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B384_58::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B384_58::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    F384PM::FP x; /**< x-coordinate of point */
+#if CURVETYPE_NUMS384W!=MONTGOMERY
+    F384PM::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    F384PM::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(F384PM::FP *r, F384PM::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B384_58::BIG x, int s);
+
+#if CURVETYPE_NUMS384W==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B384_58::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B384_58::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B384_58::BIG x, B384_58::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B384_58::BIG x, B384_58::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B384_58::BIG e, B384_58::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B384_58::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B384_58::BIG e, B384_58::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B384_58::BIG e, B384_58::BIG f, B384_58::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B384_58::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, F384PM::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B384_58::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_NUMS512E.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_NUMS512E.h
new file mode 100644
index 0000000..3a4bf5f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_NUMS512E.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_NUMS512E_H
+#define ECP_NUMS512E_H
+
+#include "fp_F512PM.h"
+#include "config_curve_NUMS512E.h"
+
+using namespace core;
+
+namespace NUMS512E {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B512_60::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B512_60::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B512_60::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B512_60::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B512_60::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B512_60::BIG CURVE_Ad;
+extern const B512_60::BIG CURVE_Bd;
+extern const B512_60::BIG PC[];
+
+extern const B512_60::BIG CURVE_Adr;
+extern const B512_60::BIG CURVE_Adi;
+extern const B512_60::BIG CURVE_Bdr;
+extern const B512_60::BIG CURVE_Bdi;
+extern const B512_60::BIG PCR[];
+extern const B512_60::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B512_60::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B512_60::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B512_60::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B512_60::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B512_60::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B512_60::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B512_60::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B512_60::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B512_60::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B512_60::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B512_60::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B512_60::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B512_60::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    F512PM::FP x; /**< x-coordinate of point */
+#if CURVETYPE_NUMS512E!=MONTGOMERY
+    F512PM::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    F512PM::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(F512PM::FP *r, F512PM::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B512_60::BIG x, int s);
+
+#if CURVETYPE_NUMS512E==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B512_60::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B512_60::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B512_60::BIG x, B512_60::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B512_60::BIG x, B512_60::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B512_60::BIG e, B512_60::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B512_60::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B512_60::BIG e, B512_60::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B512_60::BIG e, B512_60::BIG f, B512_60::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B512_60::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, F512PM::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B512_60::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_NUMS512W.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_NUMS512W.h
new file mode 100644
index 0000000..c6ba6d8
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_NUMS512W.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_NUMS512W_H
+#define ECP_NUMS512W_H
+
+#include "fp_F512PM.h"
+#include "config_curve_NUMS512W.h"
+
+using namespace core;
+
+namespace NUMS512W {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B512_60::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B512_60::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B512_60::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B512_60::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B512_60::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B512_60::BIG CURVE_Ad;
+extern const B512_60::BIG CURVE_Bd;
+extern const B512_60::BIG PC[];
+
+extern const B512_60::BIG CURVE_Adr;
+extern const B512_60::BIG CURVE_Adi;
+extern const B512_60::BIG CURVE_Bdr;
+extern const B512_60::BIG CURVE_Bdi;
+extern const B512_60::BIG PCR[];
+extern const B512_60::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B512_60::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B512_60::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B512_60::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B512_60::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B512_60::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B512_60::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B512_60::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B512_60::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B512_60::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B512_60::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B512_60::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B512_60::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B512_60::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    F512PM::FP x; /**< x-coordinate of point */
+#if CURVETYPE_NUMS512W!=MONTGOMERY
+    F512PM::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    F512PM::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(F512PM::FP *r, F512PM::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B512_60::BIG x, int s);
+
+#if CURVETYPE_NUMS512W==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B512_60::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B512_60::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B512_60::BIG x, B512_60::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B512_60::BIG x, B512_60::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B512_60::BIG e, B512_60::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B512_60::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B512_60::BIG e, B512_60::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B512_60::BIG e, B512_60::BIG f, B512_60::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B512_60::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, F512PM::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B512_60::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_SECP160R1.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_SECP160R1.h
new file mode 100644
index 0000000..a404322
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_SECP160R1.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_SECP160R1_H
+#define ECP_SECP160R1_H
+
+#include "fp_SECP160R1.h"
+#include "config_curve_SECP160R1.h"
+
+using namespace core;
+
+namespace SECP160R1 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B160_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B160_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B160_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B160_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B160_56::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B160_56::BIG CURVE_Ad;
+extern const B160_56::BIG CURVE_Bd;
+extern const B160_56::BIG PC[];
+
+extern const B160_56::BIG CURVE_Adr;
+extern const B160_56::BIG CURVE_Adi;
+extern const B160_56::BIG CURVE_Bdr;
+extern const B160_56::BIG CURVE_Bdi;
+extern const B160_56::BIG PCR[];
+extern const B160_56::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B160_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B160_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B160_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B160_56::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B160_56::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B160_56::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B160_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B160_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B160_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B160_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B160_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B160_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B160_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    SECP160R1::FP x; /**< x-coordinate of point */
+#if CURVETYPE_SECP160R1!=MONTGOMERY
+    SECP160R1::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    SECP160R1::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(SECP160R1::FP *r, SECP160R1::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B160_56::BIG x, int s);
+
+#if CURVETYPE_SECP160R1==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B160_56::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B160_56::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B160_56::BIG x, B160_56::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B160_56::BIG x, B160_56::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B160_56::BIG e, B160_56::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B160_56::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B160_56::BIG e, B160_56::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B160_56::BIG e, B160_56::BIG f, B160_56::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B160_56::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, SECP160R1::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B160_56::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_SECP256K1.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_SECP256K1.h
new file mode 100644
index 0000000..84e9ce7
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_SECP256K1.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_SECP256K1_H
+#define ECP_SECP256K1_H
+
+#include "fp_SECP256K1.h"
+#include "config_curve_SECP256K1.h"
+
+using namespace core;
+
+namespace SECP256K1 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B256_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B256_56::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B256_56::BIG CURVE_Ad;
+extern const B256_56::BIG CURVE_Bd;
+extern const B256_56::BIG PC[];
+
+extern const B256_56::BIG CURVE_Adr;
+extern const B256_56::BIG CURVE_Adi;
+extern const B256_56::BIG CURVE_Bdr;
+extern const B256_56::BIG CURVE_Bdi;
+extern const B256_56::BIG PCR[];
+extern const B256_56::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B256_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B256_56::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B256_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B256_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B256_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    SECP256K1::FP x; /**< x-coordinate of point */
+#if CURVETYPE_SECP256K1!=MONTGOMERY
+    SECP256K1::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    SECP256K1::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(SECP256K1::FP *r, SECP256K1::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B256_56::BIG x, int s);
+
+#if CURVETYPE_SECP256K1==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B256_56::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x, B256_56::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B256_56::BIG x, B256_56::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B256_56::BIG e, B256_56::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B256_56::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f, B256_56::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B256_56::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, SECP256K1::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B256_56::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_SM2.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_SM2.h
new file mode 100644
index 0000000..3f2a35a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_SM2.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_SM2_H
+#define ECP_SM2_H
+
+#include "fp_SM2.h"
+#include "config_curve_SM2.h"
+
+using namespace core;
+
+namespace SM2 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B256_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B256_56::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B256_56::BIG CURVE_Ad;
+extern const B256_56::BIG CURVE_Bd;
+extern const B256_56::BIG PC[];
+
+extern const B256_56::BIG CURVE_Adr;
+extern const B256_56::BIG CURVE_Adi;
+extern const B256_56::BIG CURVE_Bdr;
+extern const B256_56::BIG CURVE_Bdi;
+extern const B256_56::BIG PCR[];
+extern const B256_56::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B256_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B256_56::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B256_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B256_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B256_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    SM2::FP x; /**< x-coordinate of point */
+#if CURVETYPE_SM2!=MONTGOMERY
+    SM2::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    SM2::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(SM2::FP *r, SM2::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B256_56::BIG x, int s);
+
+#if CURVETYPE_SM2==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B256_56::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x, B256_56::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B256_56::BIG x, B256_56::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B256_56::BIG e, B256_56::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B256_56::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f, B256_56::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B256_56::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, SM2::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B256_56::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_TWEEDLEDEE.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_TWEEDLEDEE.h
new file mode 100644
index 0000000..9ca458a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_TWEEDLEDEE.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_TWEEDLEDEE_H
+#define ECP_TWEEDLEDEE_H
+
+#include "fp_TWEEDLEDEE.h"
+#include "config_curve_TWEEDLEDEE.h"
+
+using namespace core;
+
+namespace TWEEDLEDEE {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B256_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B256_56::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B256_56::BIG CURVE_Ad;
+extern const B256_56::BIG CURVE_Bd;
+extern const B256_56::BIG PC[];
+
+extern const B256_56::BIG CURVE_Adr;
+extern const B256_56::BIG CURVE_Adi;
+extern const B256_56::BIG CURVE_Bdr;
+extern const B256_56::BIG CURVE_Bdi;
+extern const B256_56::BIG PCR[];
+extern const B256_56::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B256_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B256_56::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B256_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B256_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B256_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    TWEEDLEDEE::FP x; /**< x-coordinate of point */
+#if CURVETYPE_TWEEDLEDEE!=MONTGOMERY
+    TWEEDLEDEE::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    TWEEDLEDEE::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(TWEEDLEDEE::FP *r, TWEEDLEDEE::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B256_56::BIG x, int s);
+
+#if CURVETYPE_TWEEDLEDEE==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B256_56::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x, B256_56::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B256_56::BIG x, B256_56::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B256_56::BIG e, B256_56::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B256_56::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f, B256_56::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B256_56::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, TWEEDLEDEE::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B256_56::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_TWEEDLEDUM.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_TWEEDLEDUM.h
new file mode 100644
index 0000000..49010a3
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_TWEEDLEDUM.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_TWEEDLEDUM_H
+#define ECP_TWEEDLEDUM_H
+
+#include "fp_TWEEDLEDUM.h"
+#include "config_curve_TWEEDLEDUM.h"
+
+using namespace core;
+
+namespace TWEEDLEDUM {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B256_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B256_56::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B256_56::BIG CURVE_Ad;
+extern const B256_56::BIG CURVE_Bd;
+extern const B256_56::BIG PC[];
+
+extern const B256_56::BIG CURVE_Adr;
+extern const B256_56::BIG CURVE_Adi;
+extern const B256_56::BIG CURVE_Bdr;
+extern const B256_56::BIG CURVE_Bdi;
+extern const B256_56::BIG PCR[];
+extern const B256_56::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B256_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B256_56::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B256_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B256_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B256_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    TWEEDLEDUM::FP x; /**< x-coordinate of point */
+#if CURVETYPE_TWEEDLEDUM!=MONTGOMERY
+    TWEEDLEDUM::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    TWEEDLEDUM::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(TWEEDLEDUM::FP *r, TWEEDLEDUM::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B256_56::BIG x, int s);
+
+#if CURVETYPE_TWEEDLEDUM==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B256_56::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x, B256_56::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B256_56::BIG x, B256_56::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B256_56::BIG e, B256_56::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B256_56::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f, B256_56::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B256_56::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, TWEEDLEDUM::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B256_56::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_X448.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_X448.h
new file mode 100644
index 0000000..03a7fe5
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ecp_X448.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_X448_H
+#define ECP_X448_H
+
+#include "fp_F448.h"
+#include "config_curve_X448.h"
+
+using namespace core;
+
+namespace X448 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B448_58::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B448_58::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B448_58::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B448_58::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B448_58::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B448_58::BIG CURVE_Ad;
+extern const B448_58::BIG CURVE_Bd;
+extern const B448_58::BIG PC[];
+
+extern const B448_58::BIG CURVE_Adr;
+extern const B448_58::BIG CURVE_Adi;
+extern const B448_58::BIG CURVE_Bdr;
+extern const B448_58::BIG CURVE_Bdi;
+extern const B448_58::BIG PCR[];
+extern const B448_58::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B448_58::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B448_58::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B448_58::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B448_58::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B448_58::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B448_58::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B448_58::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B448_58::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B448_58::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B448_58::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B448_58::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B448_58::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B448_58::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    F448::FP x; /**< x-coordinate of point */
+#if CURVETYPE_X448!=MONTGOMERY
+    F448::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    F448::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(F448::FP *r, F448::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B448_58::BIG x, int s);
+
+#if CURVETYPE_X448==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B448_58::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B448_58::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B448_58::BIG x, B448_58::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B448_58::BIG x, B448_58::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B448_58::BIG e, B448_58::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B448_58::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B448_58::BIG e, B448_58::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B448_58::BIG e, B448_58::BIG f, B448_58::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B448_58::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, F448::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B448_58::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa.h
new file mode 100644
index 0000000..a7cb9ab
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_ZZZ_H
+#define EDDSA_ZZZ_H
+
+#include "ecp_ZZZ.h"
+
+using namespace core;
+
+#define EGS_ZZZ MODBYTES_XXX  /**< ECC Group Size in bytes */
+#define EFS_ZZZ MODBYTES_XXX  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace ZZZ {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_ANSSI.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_ANSSI.h
new file mode 100644
index 0000000..45c185b
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_ANSSI.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_ANSSI_H
+#define EDDSA_ANSSI_H
+
+#include "ecp_ANSSI.h"
+
+using namespace core;
+
+#define EGS_ANSSI MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_ANSSI MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace ANSSI {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_BLS12381.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_BLS12381.h
new file mode 100644
index 0000000..369c93c
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_BLS12381.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_BLS12381_H
+#define EDDSA_BLS12381_H
+
+#include "ecp_BLS12381.h"
+
+using namespace core;
+
+#define EGS_BLS12381 MODBYTES_B384_58  /**< ECC Group Size in bytes */
+#define EFS_BLS12381 MODBYTES_B384_58  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace BLS12381 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_BLS12383.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_BLS12383.h
new file mode 100644
index 0000000..eb750e6
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_BLS12383.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_BLS12383_H
+#define EDDSA_BLS12383_H
+
+#include "ecp_BLS12383.h"
+
+using namespace core;
+
+#define EGS_BLS12383 MODBYTES_B384_58  /**< ECC Group Size in bytes */
+#define EFS_BLS12383 MODBYTES_B384_58  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace BLS12383 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_BLS12443.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_BLS12443.h
new file mode 100644
index 0000000..939d219
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_BLS12443.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_BLS12443_H
+#define EDDSA_BLS12443_H
+
+#include "ecp_BLS12443.h"
+
+using namespace core;
+
+#define EGS_BLS12443 MODBYTES_B448_60  /**< ECC Group Size in bytes */
+#define EFS_BLS12443 MODBYTES_B448_60  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace BLS12443 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_BLS12461.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_BLS12461.h
new file mode 100644
index 0000000..7297528
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_BLS12461.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_BLS12461_H
+#define EDDSA_BLS12461_H
+
+#include "ecp_BLS12461.h"
+
+using namespace core;
+
+#define EGS_BLS12461 MODBYTES_B464_60  /**< ECC Group Size in bytes */
+#define EFS_BLS12461 MODBYTES_B464_60  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace BLS12461 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_BLS24479.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_BLS24479.h
new file mode 100644
index 0000000..295d906
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_BLS24479.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_BLS24479_H
+#define EDDSA_BLS24479_H
+
+#include "ecp_BLS24479.h"
+
+using namespace core;
+
+#define EGS_BLS24479 MODBYTES_B480_56  /**< ECC Group Size in bytes */
+#define EFS_BLS24479 MODBYTES_B480_56  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace BLS24479 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_BLS48286.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_BLS48286.h
new file mode 100644
index 0000000..0a5b8c8
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_BLS48286.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_BLS48286_H
+#define EDDSA_BLS48286_H
+
+#include "ecp_BLS48286.h"
+
+using namespace core;
+
+#define EGS_BLS48286 MODBYTES_B288_60  /**< ECC Group Size in bytes */
+#define EFS_BLS48286 MODBYTES_B288_60  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace BLS48286 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_BLS48556.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_BLS48556.h
new file mode 100644
index 0000000..f67768b
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_BLS48556.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_BLS48556_H
+#define EDDSA_BLS48556_H
+
+#include "ecp_BLS48556.h"
+
+using namespace core;
+
+#define EGS_BLS48556 MODBYTES_B560_58  /**< ECC Group Size in bytes */
+#define EFS_BLS48556 MODBYTES_B560_58  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace BLS48556 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_BLS48581.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_BLS48581.h
new file mode 100644
index 0000000..ded8a7f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_BLS48581.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_BLS48581_H
+#define EDDSA_BLS48581_H
+
+#include "ecp_BLS48581.h"
+
+using namespace core;
+
+#define EGS_BLS48581 MODBYTES_B584_60  /**< ECC Group Size in bytes */
+#define EFS_BLS48581 MODBYTES_B584_60  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace BLS48581 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_BN158.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_BN158.h
new file mode 100644
index 0000000..fc83be9
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_BN158.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_BN158_H
+#define EDDSA_BN158_H
+
+#include "ecp_BN158.h"
+
+using namespace core;
+
+#define EGS_BN158 MODBYTES_B160_56  /**< ECC Group Size in bytes */
+#define EFS_BN158 MODBYTES_B160_56  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace BN158 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_BN254.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_BN254.h
new file mode 100644
index 0000000..ef2f6ad
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_BN254.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_BN254_H
+#define EDDSA_BN254_H
+
+#include "ecp_BN254.h"
+
+using namespace core;
+
+#define EGS_BN254 MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_BN254 MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace BN254 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_BN254CX.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_BN254CX.h
new file mode 100644
index 0000000..cf12594
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_BN254CX.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_BN254CX_H
+#define EDDSA_BN254CX_H
+
+#include "ecp_BN254CX.h"
+
+using namespace core;
+
+#define EGS_BN254CX MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_BN254CX MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace BN254CX {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_BN462.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_BN462.h
new file mode 100644
index 0000000..e6db4ff
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_BN462.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_BN462_H
+#define EDDSA_BN462_H
+
+#include "ecp_BN462.h"
+
+using namespace core;
+
+#define EGS_BN462 MODBYTES_B464_60  /**< ECC Group Size in bytes */
+#define EFS_BN462 MODBYTES_B464_60  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace BN462 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_BRAINPOOL.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_BRAINPOOL.h
new file mode 100644
index 0000000..55caaf1
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_BRAINPOOL.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_BRAINPOOL_H
+#define EDDSA_BRAINPOOL_H
+
+#include "ecp_BRAINPOOL.h"
+
+using namespace core;
+
+#define EGS_BRAINPOOL MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_BRAINPOOL MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace BRAINPOOL {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_C1174.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_C1174.h
new file mode 100644
index 0000000..dab2efd
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_C1174.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_C1174_H
+#define EDDSA_C1174_H
+
+#include "ecp_C1174.h"
+
+using namespace core;
+
+#define EGS_C1174 MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_C1174 MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace C1174 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_C13318.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_C13318.h
new file mode 100644
index 0000000..0865795
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_C13318.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_C13318_H
+#define EDDSA_C13318_H
+
+#include "ecp_C13318.h"
+
+using namespace core;
+
+#define EGS_C13318 MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_C13318 MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace C13318 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_C1665.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_C1665.h
new file mode 100644
index 0000000..e505f45
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_C1665.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_C1665_H
+#define EDDSA_C1665_H
+
+#include "ecp_C1665.h"
+
+using namespace core;
+
+#define EGS_C1665 MODBYTES_B168_60  /**< ECC Group Size in bytes */
+#define EFS_C1665 MODBYTES_B168_60  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace C1665 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_C25519.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_C25519.h
new file mode 100644
index 0000000..37fda37
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_C25519.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_C25519_H
+#define EDDSA_C25519_H
+
+#include "ecp_C25519.h"
+
+using namespace core;
+
+#define EGS_C25519 MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_C25519 MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace C25519 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_C41417.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_C41417.h
new file mode 100644
index 0000000..ad30290
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_C41417.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_C41417_H
+#define EDDSA_C41417_H
+
+#include "ecp_C41417.h"
+
+using namespace core;
+
+#define EGS_C41417 MODBYTES_B416_60  /**< ECC Group Size in bytes */
+#define EFS_C41417 MODBYTES_B416_60  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace C41417 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_Ed25519.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_Ed25519.h
new file mode 100644
index 0000000..4563647
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_Ed25519.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_Ed25519_H
+#define EDDSA_Ed25519_H
+
+#include "ecp_Ed25519.h"
+
+using namespace core;
+
+#define EGS_Ed25519 MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_Ed25519 MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace Ed25519 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_Ed448.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_Ed448.h
new file mode 100644
index 0000000..0e45f81
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_Ed448.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_Ed448_H
+#define EDDSA_Ed448_H
+
+#include "ecp_Ed448.h"
+
+using namespace core;
+
+#define EGS_Ed448 MODBYTES_B448_58  /**< ECC Group Size in bytes */
+#define EFS_Ed448 MODBYTES_B448_58  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace Ed448 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_FP256BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_FP256BN.h
new file mode 100644
index 0000000..53b2310
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_FP256BN.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_FP256BN_H
+#define EDDSA_FP256BN_H
+
+#include "ecp_FP256BN.h"
+
+using namespace core;
+
+#define EGS_FP256BN MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_FP256BN MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace FP256BN {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_FP512BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_FP512BN.h
new file mode 100644
index 0000000..3e45eef
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_FP512BN.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_FP512BN_H
+#define EDDSA_FP512BN_H
+
+#include "ecp_FP512BN.h"
+
+using namespace core;
+
+#define EGS_FP512BN MODBYTES_B512_60  /**< ECC Group Size in bytes */
+#define EFS_FP512BN MODBYTES_B512_60  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace FP512BN {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_HIFIVE.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_HIFIVE.h
new file mode 100644
index 0000000..fe9fda3
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_HIFIVE.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_HIFIVE_H
+#define EDDSA_HIFIVE_H
+
+#include "ecp_HIFIVE.h"
+
+using namespace core;
+
+#define EGS_HIFIVE MODBYTES_B336_60  /**< ECC Group Size in bytes */
+#define EFS_HIFIVE MODBYTES_B336_60  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace HIFIVE {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_JUBJUB.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_JUBJUB.h
new file mode 100644
index 0000000..29b8e0f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_JUBJUB.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_JUBJUB_H
+#define EDDSA_JUBJUB_H
+
+#include "ecp_JUBJUB.h"
+
+using namespace core;
+
+#define EGS_JUBJUB MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_JUBJUB MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace JUBJUB {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_MDC.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_MDC.h
new file mode 100644
index 0000000..1b55de8
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_MDC.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_MDC_H
+#define EDDSA_MDC_H
+
+#include "ecp_MDC.h"
+
+using namespace core;
+
+#define EGS_MDC MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_MDC MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace MDC {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_NIST256.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_NIST256.h
new file mode 100644
index 0000000..1cc9db7
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_NIST256.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_NIST256_H
+#define EDDSA_NIST256_H
+
+#include "ecp_NIST256.h"
+
+using namespace core;
+
+#define EGS_NIST256 MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_NIST256 MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace NIST256 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_NIST384.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_NIST384.h
new file mode 100644
index 0000000..a27b107
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_NIST384.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_NIST384_H
+#define EDDSA_NIST384_H
+
+#include "ecp_NIST384.h"
+
+using namespace core;
+
+#define EGS_NIST384 MODBYTES_B384_56  /**< ECC Group Size in bytes */
+#define EFS_NIST384 MODBYTES_B384_56  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace NIST384 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_NIST521.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_NIST521.h
new file mode 100644
index 0000000..4157d1a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_NIST521.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_NIST521_H
+#define EDDSA_NIST521_H
+
+#include "ecp_NIST521.h"
+
+using namespace core;
+
+#define EGS_NIST521 MODBYTES_B528_60  /**< ECC Group Size in bytes */
+#define EFS_NIST521 MODBYTES_B528_60  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace NIST521 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_NUMS256E.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_NUMS256E.h
new file mode 100644
index 0000000..a21c321
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_NUMS256E.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_NUMS256E_H
+#define EDDSA_NUMS256E_H
+
+#include "ecp_NUMS256E.h"
+
+using namespace core;
+
+#define EGS_NUMS256E MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_NUMS256E MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace NUMS256E {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_NUMS256W.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_NUMS256W.h
new file mode 100644
index 0000000..56dd3b5
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_NUMS256W.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_NUMS256W_H
+#define EDDSA_NUMS256W_H
+
+#include "ecp_NUMS256W.h"
+
+using namespace core;
+
+#define EGS_NUMS256W MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_NUMS256W MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace NUMS256W {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_NUMS384E.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_NUMS384E.h
new file mode 100644
index 0000000..e675376
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_NUMS384E.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_NUMS384E_H
+#define EDDSA_NUMS384E_H
+
+#include "ecp_NUMS384E.h"
+
+using namespace core;
+
+#define EGS_NUMS384E MODBYTES_B384_58  /**< ECC Group Size in bytes */
+#define EFS_NUMS384E MODBYTES_B384_58  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace NUMS384E {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_NUMS384W.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_NUMS384W.h
new file mode 100644
index 0000000..ac74813
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_NUMS384W.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_NUMS384W_H
+#define EDDSA_NUMS384W_H
+
+#include "ecp_NUMS384W.h"
+
+using namespace core;
+
+#define EGS_NUMS384W MODBYTES_B384_58  /**< ECC Group Size in bytes */
+#define EFS_NUMS384W MODBYTES_B384_58  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace NUMS384W {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_NUMS512E.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_NUMS512E.h
new file mode 100644
index 0000000..3925a33
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_NUMS512E.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_NUMS512E_H
+#define EDDSA_NUMS512E_H
+
+#include "ecp_NUMS512E.h"
+
+using namespace core;
+
+#define EGS_NUMS512E MODBYTES_B512_60  /**< ECC Group Size in bytes */
+#define EFS_NUMS512E MODBYTES_B512_60  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace NUMS512E {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_NUMS512W.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_NUMS512W.h
new file mode 100644
index 0000000..6a50c98
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_NUMS512W.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_NUMS512W_H
+#define EDDSA_NUMS512W_H
+
+#include "ecp_NUMS512W.h"
+
+using namespace core;
+
+#define EGS_NUMS512W MODBYTES_B512_60  /**< ECC Group Size in bytes */
+#define EFS_NUMS512W MODBYTES_B512_60  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace NUMS512W {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_SECP160R1.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_SECP160R1.h
new file mode 100644
index 0000000..0c2c372
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_SECP160R1.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_SECP160R1_H
+#define EDDSA_SECP160R1_H
+
+#include "ecp_SECP160R1.h"
+
+using namespace core;
+
+#define EGS_SECP160R1 MODBYTES_B160_56  /**< ECC Group Size in bytes */
+#define EFS_SECP160R1 MODBYTES_B160_56  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace SECP160R1 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_SECP256K1.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_SECP256K1.h
new file mode 100644
index 0000000..ff4a475
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_SECP256K1.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_SECP256K1_H
+#define EDDSA_SECP256K1_H
+
+#include "ecp_SECP256K1.h"
+
+using namespace core;
+
+#define EGS_SECP256K1 MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_SECP256K1 MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace SECP256K1 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_SM2.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_SM2.h
new file mode 100644
index 0000000..4b8dc7d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_SM2.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_SM2_H
+#define EDDSA_SM2_H
+
+#include "ecp_SM2.h"
+
+using namespace core;
+
+#define EGS_SM2 MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_SM2 MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace SM2 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_TWEEDLEDEE.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_TWEEDLEDEE.h
new file mode 100644
index 0000000..23e34d7
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_TWEEDLEDEE.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_TWEEDLEDEE_H
+#define EDDSA_TWEEDLEDEE_H
+
+#include "ecp_TWEEDLEDEE.h"
+
+using namespace core;
+
+#define EGS_TWEEDLEDEE MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_TWEEDLEDEE MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace TWEEDLEDEE {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_TWEEDLEDUM.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_TWEEDLEDUM.h
new file mode 100644
index 0000000..3d7e5b7
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_TWEEDLEDUM.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_TWEEDLEDUM_H
+#define EDDSA_TWEEDLEDUM_H
+
+#include "ecp_TWEEDLEDUM.h"
+
+using namespace core;
+
+#define EGS_TWEEDLEDUM MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_TWEEDLEDUM MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace TWEEDLEDUM {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_X448.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_X448.h
new file mode 100644
index 0000000..ad0db71
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/eddsa_X448.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_X448_H
+#define EDDSA_X448_H
+
+#include "ecp_X448.h"
+
+using namespace core;
+
+#define EGS_X448 MODBYTES_B448_58  /**< ECC Group Size in bytes */
+#define EFS_X448 MODBYTES_B448_58  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace X448 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ff.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ff.h
new file mode 100644
index 0000000..8220fa0
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ff.h
@@ -0,0 +1,295 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FF_WWW_H
+#define FF_WWW_H
+
+#include "big_XXX.h"
+#include "config_ff_WWW.h"
+
+using namespace core;
+
+#define HFLEN_WWW (FFLEN_WWW/2) /**< Useful for half-size RSA private key operations */
+#define P_MBITS_WWW (MODBYTES_XXX*8)
+#define P_TBITS_WWW (P_MBITS_WWW%BASEBITS_XXX)
+#define P_EXCESS_WWW(a) (((a[NLEN_XXX-1])>>(P_TBITS_WWW))+1)
+#define P_FEXCESS_WWW ((chunk)1<<(BASEBITS_XXX*NLEN_XXX-P_MBITS_WWW-1))
+
+
+namespace WWW {
+
+/* Finite Field Prototypes */
+/**	@brief Copy one FF element of given length to another
+ *
+	@param x FF instance to be copied to, on exit = y
+	@param y FF instance to be copied from
+	@param n size of FF in BIGs
+
+ */
+extern void FF_copy(XXX::BIG *x, XXX::BIG *y, int n);
+/**	@brief Initialize an FF element of given length from a 32-bit integer m
+ *
+	@param x FF instance to be copied to, on exit = m
+	@param m integer
+	@param n size of FF in BIGs
+ */
+extern void FF_init(XXX::BIG *x, sign32 m, int n);
+/**	@brief Set FF element of given size to zero
+ *
+	@param x FF instance to be set to zero
+	@param n size of FF in BIGs
+ */
+extern void FF_zero(XXX::BIG *x, int n);
+/**	@brief Tests for FF element equal to zero
+ *
+	@param x FF number to be tested
+	@param n size of FF in BIGs
+	@return 1 if zero, else returns 0
+ */
+extern int FF_iszilch(XXX::BIG *x, int n);
+/**	@brief  return parity of an FF, that is the least significant bit
+ *
+	@param x FF number
+	@return 0 or 1
+ */
+extern int FF_parity(XXX::BIG *x);
+/**	@brief  return least significant m bits of an FF
+ *
+	@param x FF number
+	@param m number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int FF_lastbits(XXX::BIG *x, int m);
+/**	@brief Set FF element of given size to unity
+ *
+	@param x FF instance to be set to unity
+	@param n size of FF in BIGs
+ */
+extern void FF_one(XXX::BIG *x, int n);
+/**	@brief Compares two FF numbers. Inputs must be normalised externally
+ *
+	@param x first FF number to be compared
+	@param y second FF number to be compared
+	@param n size of FF in BIGs
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int FF_comp(XXX::BIG *x, XXX::BIG *y, int n);
+/**	@brief addition of two FFs
+ *
+	@param x FF instance, on exit = y+z
+	@param y FF instance
+	@param z FF instance
+	@param n size of FF in BIGs
+ */
+extern void FF_add(XXX::BIG *x, XXX::BIG *y, XXX::BIG *z, int n);
+/**	@brief subtraction of two FFs
+ *
+	@param x FF instance, on exit = y-z
+	@param y FF instance
+	@param z FF instance
+	@param n size of FF in BIGs
+ */
+extern void FF_sub(XXX::BIG *x, XXX::BIG *y, XXX::BIG *z, int n);
+/**	@brief increment an FF by an integer,and normalise
+ *
+	@param x FF instance, on exit = x+m
+	@param m an integer to be added to x
+	@param n size of FF in BIGs
+ */
+extern void FF_inc(XXX::BIG *x, int m, int n);
+/**	@brief Decrement an FF by an integer,and normalise
+ *
+	@param x FF instance, on exit = x-m
+	@param m an integer to be subtracted from x
+	@param n size of FF in BIGs
+ */
+extern void FF_dec(XXX::BIG *x, int m, int n);
+/**	@brief Normalises the components of an FF
+ *
+	@param x FF instance to be normalised
+	@param n size of FF in BIGs
+ */
+extern void FF_norm(XXX::BIG *x, int n);
+/**	@brief Shift left an FF by 1 bit
+ *
+	@param x FF instance to be shifted left
+	@param n size of FF in BIGs
+ */
+extern void FF_shl(XXX::BIG *x, int n);
+/**	@brief Shift right an FF by 1 bit
+ *
+	@param x FF instance to be shifted right
+	@param n size of FF in BIGs
+ */
+extern void FF_shr(XXX::BIG *x, int n);
+/**	@brief Formats and outputs an FF to the console
+ *
+	@param x FF instance to be printed
+	@param n size of FF in BIGs
+ */
+extern void FF_output(XXX::BIG *x, int n);
+/**	@brief Formats and outputs an FF to the console, in raw form
+ *
+ 	@param x FF instance to be printed
+ 	@param n size of FF in BIGs
+ */
+extern void FF_rawoutput(XXX::BIG *x, int n);
+/**	@brief Formats and outputs an FF instance to an octet string
+ *
+	Converts an FF to big-endian base 256 form.
+	@param S output octet string
+	@param x FF instance to be converted to an octet string
+	@param n size of FF in BIGs
+ */
+extern void FF_toOctet(octet *S, XXX::BIG *x, int n);
+/**	@brief Populates an FF instance from an octet string
+ *
+	Creates FF from big-endian base 256 form.
+	@param x FF instance to be created from an octet string
+	@param S input octet string
+	@param n size of FF in BIGs
+ */
+extern void FF_fromOctet(XXX::BIG *x, octet *S, int n);
+/**	@brief Multiplication of two FFs
+ *
+	Uses Karatsuba method internally
+	@param x FF instance, on exit = y*z
+	@param y FF instance
+	@param z FF instance
+	@param n size of FF in BIGs
+ */
+extern void FF_mul(XXX::BIG *x, XXX::BIG *y, XXX::BIG *z, int n);
+/**	@brief Reduce FF mod a modulus
+ *
+	This is slow
+	@param x FF instance to be reduced mod m - on exit = x mod m
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_mod(XXX::BIG *x, XXX::BIG *m, int n);
+/**	@brief Square an FF
+ *
+	Uses Karatsuba method internally
+	@param x FF instance, on exit = y^2
+	@param y FF instance to be squared
+	@param n size of FF in BIGs
+ */
+extern void FF_sqr(XXX::BIG *x, XXX::BIG *y, int n);
+/**	@brief Reduces a double-length FF with respect to a given modulus
+ *
+	This is slow
+	@param x FF instance, on exit = y mod z
+	@param y FF instance, of double length 2*n
+	@param z FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_dmod(XXX::BIG *x, XXX::BIG *y, XXX::BIG *z, int n);
+/**	@brief Invert an FF mod a prime modulus
+ *
+	@param x FF instance, on exit = 1/y mod z
+	@param y FF instance
+	@param z FF prime modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_invmodp(XXX::BIG *x, XXX::BIG *y, XXX::BIG *z, int n);
+/**	@brief Create an FF from a random number generator
+ *
+	@param x FF instance, on exit x is a random number of length n BIGs with most significant bit a 1
+	@param R an instance of a Cryptographically Secure Random Number Generator
+	@param n size of FF in BIGs
+ */
+extern void FF_random(XXX::BIG *x, csprng *R, int n);
+/**	@brief Create a random FF less than a given modulus from a random number generator
+ *
+	@param x FF instance, on exit x is a random number < y
+	@param y FF instance, the modulus
+	@param R an instance of a Cryptographically Secure Random Number Generator
+	@param n size of FF in BIGs
+ */
+extern void FF_randomnum(XXX::BIG *x, XXX::BIG *y, csprng *R, int n);
+/**	@brief Calculate r=x^e mod m, side channel resistant
+ *
+	@param r FF instance, on exit = x^e mod p
+	@param x FF instance
+	@param e FF exponent
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_skpow(XXX::BIG *r, XXX::BIG *x, XXX::BIG * e, XXX::BIG *m, int n);
+/**	@brief Calculate r=x^e mod m, side channel resistant
+ *
+	For short BIG exponent
+	@param r FF instance, on exit = x^e mod p
+	@param x FF instance
+	@param e BIG exponent
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_skspow(XXX::BIG *r, XXX::BIG *x, XXX::BIG e, XXX::BIG *m, int n);
+/**	@brief Calculate r=x^e mod m
+ *
+	For very short integer exponent
+	@param r FF instance, on exit = x^e mod p
+	@param x FF instance
+	@param e integer exponent
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_power(XXX::BIG *r, XXX::BIG *x, int e, XXX::BIG *m, int n);
+/**	@brief Calculate r=x^e mod m
+ *
+	@param r FF instance, on exit = x^e mod p
+	@param x FF instance
+	@param e FF exponent
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_pow(XXX::BIG *r, XXX::BIG *x, XXX::BIG *e, XXX::BIG *m, int n);
+/**	@brief Test if an FF has factor in common with integer s
+ *
+	@param x FF instance to be tested
+	@param s the supplied integer
+	@param n size of FF in BIGs
+	@return 1 if gcd(x,s)!=1, else return 0
+ */
+extern int FF_cfactor(XXX::BIG *x, sign32 s, int n);
+/**	@brief Test if an FF is prime
+ *
+	Uses Miller-Rabin Method
+	@param x FF instance to be tested
+	@param R an instance of a Cryptographically Secure Random Number Generator
+	@param n size of FF in BIGs
+	@return 1 if x is (almost certainly) prime, else return 0
+ */
+extern int FF_prime(XXX::BIG *x, csprng *R, int n);
+/**	@brief Calculate r=x^e.y^f mod m
+ *
+	@param r FF instance, on exit = x^e.y^f mod p
+	@param x FF instance
+	@param e BIG exponent
+	@param y FF instance
+	@param f BIG exponent
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_pow2(XXX::BIG *r, XXX::BIG *x, XXX::BIG e, XXX::BIG *y, XXX::BIG f, XXX::BIG *m, int n);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ff_RSA2048.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ff_RSA2048.h
new file mode 100644
index 0000000..c700bea
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ff_RSA2048.h
@@ -0,0 +1,295 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FF_RSA2048_H
+#define FF_RSA2048_H
+
+#include "big_B512_60.h"
+#include "config_ff_RSA2048.h"
+
+using namespace core;
+
+#define HFLEN_RSA2048 (FFLEN_RSA2048/2) /**< Useful for half-size RSA private key operations */
+#define P_MBITS_RSA2048 (MODBYTES_B512_60*8)
+#define P_TBITS_RSA2048 (P_MBITS_RSA2048%BASEBITS_B512_60)
+#define P_EXCESS_RSA2048(a) (((a[NLEN_B512_60-1])>>(P_TBITS_RSA2048))+1)
+#define P_FEXCESS_RSA2048 ((chunk)1<<(BASEBITS_B512_60*NLEN_B512_60-P_MBITS_RSA2048-1))
+
+
+namespace RSA2048 {
+
+/* Finite Field Prototypes */
+/**	@brief Copy one FF element of given length to another
+ *
+	@param x FF instance to be copied to, on exit = y
+	@param y FF instance to be copied from
+	@param n size of FF in BIGs
+
+ */
+extern void FF_copy(B512_60::BIG *x, B512_60::BIG *y, int n);
+/**	@brief Initialize an FF element of given length from a 32-bit integer m
+ *
+	@param x FF instance to be copied to, on exit = m
+	@param m integer
+	@param n size of FF in BIGs
+ */
+extern void FF_init(B512_60::BIG *x, sign32 m, int n);
+/**	@brief Set FF element of given size to zero
+ *
+	@param x FF instance to be set to zero
+	@param n size of FF in BIGs
+ */
+extern void FF_zero(B512_60::BIG *x, int n);
+/**	@brief Tests for FF element equal to zero
+ *
+	@param x FF number to be tested
+	@param n size of FF in BIGs
+	@return 1 if zero, else returns 0
+ */
+extern int FF_iszilch(B512_60::BIG *x, int n);
+/**	@brief  return parity of an FF, that is the least significant bit
+ *
+	@param x FF number
+	@return 0 or 1
+ */
+extern int FF_parity(B512_60::BIG *x);
+/**	@brief  return least significant m bits of an FF
+ *
+	@param x FF number
+	@param m number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int FF_lastbits(B512_60::BIG *x, int m);
+/**	@brief Set FF element of given size to unity
+ *
+	@param x FF instance to be set to unity
+	@param n size of FF in BIGs
+ */
+extern void FF_one(B512_60::BIG *x, int n);
+/**	@brief Compares two FF numbers. Inputs must be normalised externally
+ *
+	@param x first FF number to be compared
+	@param y second FF number to be compared
+	@param n size of FF in BIGs
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int FF_comp(B512_60::BIG *x, B512_60::BIG *y, int n);
+/**	@brief addition of two FFs
+ *
+	@param x FF instance, on exit = y+z
+	@param y FF instance
+	@param z FF instance
+	@param n size of FF in BIGs
+ */
+extern void FF_add(B512_60::BIG *x, B512_60::BIG *y, B512_60::BIG *z, int n);
+/**	@brief subtraction of two FFs
+ *
+	@param x FF instance, on exit = y-z
+	@param y FF instance
+	@param z FF instance
+	@param n size of FF in BIGs
+ */
+extern void FF_sub(B512_60::BIG *x, B512_60::BIG *y, B512_60::BIG *z, int n);
+/**	@brief increment an FF by an integer,and normalise
+ *
+	@param x FF instance, on exit = x+m
+	@param m an integer to be added to x
+	@param n size of FF in BIGs
+ */
+extern void FF_inc(B512_60::BIG *x, int m, int n);
+/**	@brief Decrement an FF by an integer,and normalise
+ *
+	@param x FF instance, on exit = x-m
+	@param m an integer to be subtracted from x
+	@param n size of FF in BIGs
+ */
+extern void FF_dec(B512_60::BIG *x, int m, int n);
+/**	@brief Normalises the components of an FF
+ *
+	@param x FF instance to be normalised
+	@param n size of FF in BIGs
+ */
+extern void FF_norm(B512_60::BIG *x, int n);
+/**	@brief Shift left an FF by 1 bit
+ *
+	@param x FF instance to be shifted left
+	@param n size of FF in BIGs
+ */
+extern void FF_shl(B512_60::BIG *x, int n);
+/**	@brief Shift right an FF by 1 bit
+ *
+	@param x FF instance to be shifted right
+	@param n size of FF in BIGs
+ */
+extern void FF_shr(B512_60::BIG *x, int n);
+/**	@brief Formats and outputs an FF to the console
+ *
+	@param x FF instance to be printed
+	@param n size of FF in BIGs
+ */
+extern void FF_output(B512_60::BIG *x, int n);
+/**	@brief Formats and outputs an FF to the console, in raw form
+ *
+ 	@param x FF instance to be printed
+ 	@param n size of FF in BIGs
+ */
+extern void FF_rawoutput(B512_60::BIG *x, int n);
+/**	@brief Formats and outputs an FF instance to an octet string
+ *
+	Converts an FF to big-endian base 256 form.
+	@param S output octet string
+	@param x FF instance to be converted to an octet string
+	@param n size of FF in BIGs
+ */
+extern void FF_toOctet(octet *S, B512_60::BIG *x, int n);
+/**	@brief Populates an FF instance from an octet string
+ *
+	Creates FF from big-endian base 256 form.
+	@param x FF instance to be created from an octet string
+	@param S input octet string
+	@param n size of FF in BIGs
+ */
+extern void FF_fromOctet(B512_60::BIG *x, octet *S, int n);
+/**	@brief Multiplication of two FFs
+ *
+	Uses Karatsuba method internally
+	@param x FF instance, on exit = y*z
+	@param y FF instance
+	@param z FF instance
+	@param n size of FF in BIGs
+ */
+extern void FF_mul(B512_60::BIG *x, B512_60::BIG *y, B512_60::BIG *z, int n);
+/**	@brief Reduce FF mod a modulus
+ *
+	This is slow
+	@param x FF instance to be reduced mod m - on exit = x mod m
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_mod(B512_60::BIG *x, B512_60::BIG *m, int n);
+/**	@brief Square an FF
+ *
+	Uses Karatsuba method internally
+	@param x FF instance, on exit = y^2
+	@param y FF instance to be squared
+	@param n size of FF in BIGs
+ */
+extern void FF_sqr(B512_60::BIG *x, B512_60::BIG *y, int n);
+/**	@brief Reduces a double-length FF with respect to a given modulus
+ *
+	This is slow
+	@param x FF instance, on exit = y mod z
+	@param y FF instance, of double length 2*n
+	@param z FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_dmod(B512_60::BIG *x, B512_60::BIG *y, B512_60::BIG *z, int n);
+/**	@brief Invert an FF mod a prime modulus
+ *
+	@param x FF instance, on exit = 1/y mod z
+	@param y FF instance
+	@param z FF prime modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_invmodp(B512_60::BIG *x, B512_60::BIG *y, B512_60::BIG *z, int n);
+/**	@brief Create an FF from a random number generator
+ *
+	@param x FF instance, on exit x is a random number of length n BIGs with most significant bit a 1
+	@param R an instance of a Cryptographically Secure Random Number Generator
+	@param n size of FF in BIGs
+ */
+extern void FF_random(B512_60::BIG *x, csprng *R, int n);
+/**	@brief Create a random FF less than a given modulus from a random number generator
+ *
+	@param x FF instance, on exit x is a random number < y
+	@param y FF instance, the modulus
+	@param R an instance of a Cryptographically Secure Random Number Generator
+	@param n size of FF in BIGs
+ */
+extern void FF_randomnum(B512_60::BIG *x, B512_60::BIG *y, csprng *R, int n);
+/**	@brief Calculate r=x^e mod m, side channel resistant
+ *
+	@param r FF instance, on exit = x^e mod p
+	@param x FF instance
+	@param e FF exponent
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_skpow(B512_60::BIG *r, B512_60::BIG *x, B512_60::BIG * e, B512_60::BIG *m, int n);
+/**	@brief Calculate r=x^e mod m, side channel resistant
+ *
+	For short BIG exponent
+	@param r FF instance, on exit = x^e mod p
+	@param x FF instance
+	@param e BIG exponent
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_skspow(B512_60::BIG *r, B512_60::BIG *x, B512_60::BIG e, B512_60::BIG *m, int n);
+/**	@brief Calculate r=x^e mod m
+ *
+	For very short integer exponent
+	@param r FF instance, on exit = x^e mod p
+	@param x FF instance
+	@param e integer exponent
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_power(B512_60::BIG *r, B512_60::BIG *x, int e, B512_60::BIG *m, int n);
+/**	@brief Calculate r=x^e mod m
+ *
+	@param r FF instance, on exit = x^e mod p
+	@param x FF instance
+	@param e FF exponent
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_pow(B512_60::BIG *r, B512_60::BIG *x, B512_60::BIG *e, B512_60::BIG *m, int n);
+/**	@brief Test if an FF has factor in common with integer s
+ *
+	@param x FF instance to be tested
+	@param s the supplied integer
+	@param n size of FF in BIGs
+	@return 1 if gcd(x,s)!=1, else return 0
+ */
+extern int FF_cfactor(B512_60::BIG *x, sign32 s, int n);
+/**	@brief Test if an FF is prime
+ *
+	Uses Miller-Rabin Method
+	@param x FF instance to be tested
+	@param R an instance of a Cryptographically Secure Random Number Generator
+	@param n size of FF in BIGs
+	@return 1 if x is (almost certainly) prime, else return 0
+ */
+extern int FF_prime(B512_60::BIG *x, csprng *R, int n);
+/**	@brief Calculate r=x^e.y^f mod m
+ *
+	@param r FF instance, on exit = x^e.y^f mod p
+	@param x FF instance
+	@param e BIG exponent
+	@param y FF instance
+	@param f BIG exponent
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_pow2(B512_60::BIG *r, B512_60::BIG *x, B512_60::BIG e, B512_60::BIG *y, B512_60::BIG f, B512_60::BIG *m, int n);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ff_RSA3072.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ff_RSA3072.h
new file mode 100644
index 0000000..d806bc6
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ff_RSA3072.h
@@ -0,0 +1,295 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FF_RSA3072_H
+#define FF_RSA3072_H
+
+#include "big_B384_56.h"
+#include "config_ff_RSA3072.h"
+
+using namespace core;
+
+#define HFLEN_RSA3072 (FFLEN_RSA3072/2) /**< Useful for half-size RSA private key operations */
+#define P_MBITS_RSA3072 (MODBYTES_B384_56*8)
+#define P_TBITS_RSA3072 (P_MBITS_RSA3072%BASEBITS_B384_56)
+#define P_EXCESS_RSA3072(a) (((a[NLEN_B384_56-1])>>(P_TBITS_RSA3072))+1)
+#define P_FEXCESS_RSA3072 ((chunk)1<<(BASEBITS_B384_56*NLEN_B384_56-P_MBITS_RSA3072-1))
+
+
+namespace RSA3072 {
+
+/* Finite Field Prototypes */
+/**	@brief Copy one FF element of given length to another
+ *
+	@param x FF instance to be copied to, on exit = y
+	@param y FF instance to be copied from
+	@param n size of FF in BIGs
+
+ */
+extern void FF_copy(B384_56::BIG *x, B384_56::BIG *y, int n);
+/**	@brief Initialize an FF element of given length from a 32-bit integer m
+ *
+	@param x FF instance to be copied to, on exit = m
+	@param m integer
+	@param n size of FF in BIGs
+ */
+extern void FF_init(B384_56::BIG *x, sign32 m, int n);
+/**	@brief Set FF element of given size to zero
+ *
+	@param x FF instance to be set to zero
+	@param n size of FF in BIGs
+ */
+extern void FF_zero(B384_56::BIG *x, int n);
+/**	@brief Tests for FF element equal to zero
+ *
+	@param x FF number to be tested
+	@param n size of FF in BIGs
+	@return 1 if zero, else returns 0
+ */
+extern int FF_iszilch(B384_56::BIG *x, int n);
+/**	@brief  return parity of an FF, that is the least significant bit
+ *
+	@param x FF number
+	@return 0 or 1
+ */
+extern int FF_parity(B384_56::BIG *x);
+/**	@brief  return least significant m bits of an FF
+ *
+	@param x FF number
+	@param m number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int FF_lastbits(B384_56::BIG *x, int m);
+/**	@brief Set FF element of given size to unity
+ *
+	@param x FF instance to be set to unity
+	@param n size of FF in BIGs
+ */
+extern void FF_one(B384_56::BIG *x, int n);
+/**	@brief Compares two FF numbers. Inputs must be normalised externally
+ *
+	@param x first FF number to be compared
+	@param y second FF number to be compared
+	@param n size of FF in BIGs
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int FF_comp(B384_56::BIG *x, B384_56::BIG *y, int n);
+/**	@brief addition of two FFs
+ *
+	@param x FF instance, on exit = y+z
+	@param y FF instance
+	@param z FF instance
+	@param n size of FF in BIGs
+ */
+extern void FF_add(B384_56::BIG *x, B384_56::BIG *y, B384_56::BIG *z, int n);
+/**	@brief subtraction of two FFs
+ *
+	@param x FF instance, on exit = y-z
+	@param y FF instance
+	@param z FF instance
+	@param n size of FF in BIGs
+ */
+extern void FF_sub(B384_56::BIG *x, B384_56::BIG *y, B384_56::BIG *z, int n);
+/**	@brief increment an FF by an integer,and normalise
+ *
+	@param x FF instance, on exit = x+m
+	@param m an integer to be added to x
+	@param n size of FF in BIGs
+ */
+extern void FF_inc(B384_56::BIG *x, int m, int n);
+/**	@brief Decrement an FF by an integer,and normalise
+ *
+	@param x FF instance, on exit = x-m
+	@param m an integer to be subtracted from x
+	@param n size of FF in BIGs
+ */
+extern void FF_dec(B384_56::BIG *x, int m, int n);
+/**	@brief Normalises the components of an FF
+ *
+	@param x FF instance to be normalised
+	@param n size of FF in BIGs
+ */
+extern void FF_norm(B384_56::BIG *x, int n);
+/**	@brief Shift left an FF by 1 bit
+ *
+	@param x FF instance to be shifted left
+	@param n size of FF in BIGs
+ */
+extern void FF_shl(B384_56::BIG *x, int n);
+/**	@brief Shift right an FF by 1 bit
+ *
+	@param x FF instance to be shifted right
+	@param n size of FF in BIGs
+ */
+extern void FF_shr(B384_56::BIG *x, int n);
+/**	@brief Formats and outputs an FF to the console
+ *
+	@param x FF instance to be printed
+	@param n size of FF in BIGs
+ */
+extern void FF_output(B384_56::BIG *x, int n);
+/**	@brief Formats and outputs an FF to the console, in raw form
+ *
+ 	@param x FF instance to be printed
+ 	@param n size of FF in BIGs
+ */
+extern void FF_rawoutput(B384_56::BIG *x, int n);
+/**	@brief Formats and outputs an FF instance to an octet string
+ *
+	Converts an FF to big-endian base 256 form.
+	@param S output octet string
+	@param x FF instance to be converted to an octet string
+	@param n size of FF in BIGs
+ */
+extern void FF_toOctet(octet *S, B384_56::BIG *x, int n);
+/**	@brief Populates an FF instance from an octet string
+ *
+	Creates FF from big-endian base 256 form.
+	@param x FF instance to be created from an octet string
+	@param S input octet string
+	@param n size of FF in BIGs
+ */
+extern void FF_fromOctet(B384_56::BIG *x, octet *S, int n);
+/**	@brief Multiplication of two FFs
+ *
+	Uses Karatsuba method internally
+	@param x FF instance, on exit = y*z
+	@param y FF instance
+	@param z FF instance
+	@param n size of FF in BIGs
+ */
+extern void FF_mul(B384_56::BIG *x, B384_56::BIG *y, B384_56::BIG *z, int n);
+/**	@brief Reduce FF mod a modulus
+ *
+	This is slow
+	@param x FF instance to be reduced mod m - on exit = x mod m
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_mod(B384_56::BIG *x, B384_56::BIG *m, int n);
+/**	@brief Square an FF
+ *
+	Uses Karatsuba method internally
+	@param x FF instance, on exit = y^2
+	@param y FF instance to be squared
+	@param n size of FF in BIGs
+ */
+extern void FF_sqr(B384_56::BIG *x, B384_56::BIG *y, int n);
+/**	@brief Reduces a double-length FF with respect to a given modulus
+ *
+	This is slow
+	@param x FF instance, on exit = y mod z
+	@param y FF instance, of double length 2*n
+	@param z FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_dmod(B384_56::BIG *x, B384_56::BIG *y, B384_56::BIG *z, int n);
+/**	@brief Invert an FF mod a prime modulus
+ *
+	@param x FF instance, on exit = 1/y mod z
+	@param y FF instance
+	@param z FF prime modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_invmodp(B384_56::BIG *x, B384_56::BIG *y, B384_56::BIG *z, int n);
+/**	@brief Create an FF from a random number generator
+ *
+	@param x FF instance, on exit x is a random number of length n BIGs with most significant bit a 1
+	@param R an instance of a Cryptographically Secure Random Number Generator
+	@param n size of FF in BIGs
+ */
+extern void FF_random(B384_56::BIG *x, csprng *R, int n);
+/**	@brief Create a random FF less than a given modulus from a random number generator
+ *
+	@param x FF instance, on exit x is a random number < y
+	@param y FF instance, the modulus
+	@param R an instance of a Cryptographically Secure Random Number Generator
+	@param n size of FF in BIGs
+ */
+extern void FF_randomnum(B384_56::BIG *x, B384_56::BIG *y, csprng *R, int n);
+/**	@brief Calculate r=x^e mod m, side channel resistant
+ *
+	@param r FF instance, on exit = x^e mod p
+	@param x FF instance
+	@param e FF exponent
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_skpow(B384_56::BIG *r, B384_56::BIG *x, B384_56::BIG * e, B384_56::BIG *m, int n);
+/**	@brief Calculate r=x^e mod m, side channel resistant
+ *
+	For short BIG exponent
+	@param r FF instance, on exit = x^e mod p
+	@param x FF instance
+	@param e BIG exponent
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_skspow(B384_56::BIG *r, B384_56::BIG *x, B384_56::BIG e, B384_56::BIG *m, int n);
+/**	@brief Calculate r=x^e mod m
+ *
+	For very short integer exponent
+	@param r FF instance, on exit = x^e mod p
+	@param x FF instance
+	@param e integer exponent
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_power(B384_56::BIG *r, B384_56::BIG *x, int e, B384_56::BIG *m, int n);
+/**	@brief Calculate r=x^e mod m
+ *
+	@param r FF instance, on exit = x^e mod p
+	@param x FF instance
+	@param e FF exponent
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_pow(B384_56::BIG *r, B384_56::BIG *x, B384_56::BIG *e, B384_56::BIG *m, int n);
+/**	@brief Test if an FF has factor in common with integer s
+ *
+	@param x FF instance to be tested
+	@param s the supplied integer
+	@param n size of FF in BIGs
+	@return 1 if gcd(x,s)!=1, else return 0
+ */
+extern int FF_cfactor(B384_56::BIG *x, sign32 s, int n);
+/**	@brief Test if an FF is prime
+ *
+	Uses Miller-Rabin Method
+	@param x FF instance to be tested
+	@param R an instance of a Cryptographically Secure Random Number Generator
+	@param n size of FF in BIGs
+	@return 1 if x is (almost certainly) prime, else return 0
+ */
+extern int FF_prime(B384_56::BIG *x, csprng *R, int n);
+/**	@brief Calculate r=x^e.y^f mod m
+ *
+	@param r FF instance, on exit = x^e.y^f mod p
+	@param x FF instance
+	@param e BIG exponent
+	@param y FF instance
+	@param f BIG exponent
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_pow2(B384_56::BIG *r, B384_56::BIG *x, B384_56::BIG e, B384_56::BIG *y, B384_56::BIG f, B384_56::BIG *m, int n);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ff_RSA4096.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ff_RSA4096.h
new file mode 100644
index 0000000..4c49058
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/ff_RSA4096.h
@@ -0,0 +1,295 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FF_RSA4096_H
+#define FF_RSA4096_H
+
+#include "big_B512_60.h"
+#include "config_ff_RSA4096.h"
+
+using namespace core;
+
+#define HFLEN_RSA4096 (FFLEN_RSA4096/2) /**< Useful for half-size RSA private key operations */
+#define P_MBITS_RSA4096 (MODBYTES_B512_60*8)
+#define P_TBITS_RSA4096 (P_MBITS_RSA4096%BASEBITS_B512_60)
+#define P_EXCESS_RSA4096(a) (((a[NLEN_B512_60-1])>>(P_TBITS_RSA4096))+1)
+#define P_FEXCESS_RSA4096 ((chunk)1<<(BASEBITS_B512_60*NLEN_B512_60-P_MBITS_RSA4096-1))
+
+
+namespace RSA4096 {
+
+/* Finite Field Prototypes */
+/**	@brief Copy one FF element of given length to another
+ *
+	@param x FF instance to be copied to, on exit = y
+	@param y FF instance to be copied from
+	@param n size of FF in BIGs
+
+ */
+extern void FF_copy(B512_60::BIG *x, B512_60::BIG *y, int n);
+/**	@brief Initialize an FF element of given length from a 32-bit integer m
+ *
+	@param x FF instance to be copied to, on exit = m
+	@param m integer
+	@param n size of FF in BIGs
+ */
+extern void FF_init(B512_60::BIG *x, sign32 m, int n);
+/**	@brief Set FF element of given size to zero
+ *
+	@param x FF instance to be set to zero
+	@param n size of FF in BIGs
+ */
+extern void FF_zero(B512_60::BIG *x, int n);
+/**	@brief Tests for FF element equal to zero
+ *
+	@param x FF number to be tested
+	@param n size of FF in BIGs
+	@return 1 if zero, else returns 0
+ */
+extern int FF_iszilch(B512_60::BIG *x, int n);
+/**	@brief  return parity of an FF, that is the least significant bit
+ *
+	@param x FF number
+	@return 0 or 1
+ */
+extern int FF_parity(B512_60::BIG *x);
+/**	@brief  return least significant m bits of an FF
+ *
+	@param x FF number
+	@param m number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int FF_lastbits(B512_60::BIG *x, int m);
+/**	@brief Set FF element of given size to unity
+ *
+	@param x FF instance to be set to unity
+	@param n size of FF in BIGs
+ */
+extern void FF_one(B512_60::BIG *x, int n);
+/**	@brief Compares two FF numbers. Inputs must be normalised externally
+ *
+	@param x first FF number to be compared
+	@param y second FF number to be compared
+	@param n size of FF in BIGs
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int FF_comp(B512_60::BIG *x, B512_60::BIG *y, int n);
+/**	@brief addition of two FFs
+ *
+	@param x FF instance, on exit = y+z
+	@param y FF instance
+	@param z FF instance
+	@param n size of FF in BIGs
+ */
+extern void FF_add(B512_60::BIG *x, B512_60::BIG *y, B512_60::BIG *z, int n);
+/**	@brief subtraction of two FFs
+ *
+	@param x FF instance, on exit = y-z
+	@param y FF instance
+	@param z FF instance
+	@param n size of FF in BIGs
+ */
+extern void FF_sub(B512_60::BIG *x, B512_60::BIG *y, B512_60::BIG *z, int n);
+/**	@brief increment an FF by an integer,and normalise
+ *
+	@param x FF instance, on exit = x+m
+	@param m an integer to be added to x
+	@param n size of FF in BIGs
+ */
+extern void FF_inc(B512_60::BIG *x, int m, int n);
+/**	@brief Decrement an FF by an integer,and normalise
+ *
+	@param x FF instance, on exit = x-m
+	@param m an integer to be subtracted from x
+	@param n size of FF in BIGs
+ */
+extern void FF_dec(B512_60::BIG *x, int m, int n);
+/**	@brief Normalises the components of an FF
+ *
+	@param x FF instance to be normalised
+	@param n size of FF in BIGs
+ */
+extern void FF_norm(B512_60::BIG *x, int n);
+/**	@brief Shift left an FF by 1 bit
+ *
+	@param x FF instance to be shifted left
+	@param n size of FF in BIGs
+ */
+extern void FF_shl(B512_60::BIG *x, int n);
+/**	@brief Shift right an FF by 1 bit
+ *
+	@param x FF instance to be shifted right
+	@param n size of FF in BIGs
+ */
+extern void FF_shr(B512_60::BIG *x, int n);
+/**	@brief Formats and outputs an FF to the console
+ *
+	@param x FF instance to be printed
+	@param n size of FF in BIGs
+ */
+extern void FF_output(B512_60::BIG *x, int n);
+/**	@brief Formats and outputs an FF to the console, in raw form
+ *
+ 	@param x FF instance to be printed
+ 	@param n size of FF in BIGs
+ */
+extern void FF_rawoutput(B512_60::BIG *x, int n);
+/**	@brief Formats and outputs an FF instance to an octet string
+ *
+	Converts an FF to big-endian base 256 form.
+	@param S output octet string
+	@param x FF instance to be converted to an octet string
+	@param n size of FF in BIGs
+ */
+extern void FF_toOctet(octet *S, B512_60::BIG *x, int n);
+/**	@brief Populates an FF instance from an octet string
+ *
+	Creates FF from big-endian base 256 form.
+	@param x FF instance to be created from an octet string
+	@param S input octet string
+	@param n size of FF in BIGs
+ */
+extern void FF_fromOctet(B512_60::BIG *x, octet *S, int n);
+/**	@brief Multiplication of two FFs
+ *
+	Uses Karatsuba method internally
+	@param x FF instance, on exit = y*z
+	@param y FF instance
+	@param z FF instance
+	@param n size of FF in BIGs
+ */
+extern void FF_mul(B512_60::BIG *x, B512_60::BIG *y, B512_60::BIG *z, int n);
+/**	@brief Reduce FF mod a modulus
+ *
+	This is slow
+	@param x FF instance to be reduced mod m - on exit = x mod m
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_mod(B512_60::BIG *x, B512_60::BIG *m, int n);
+/**	@brief Square an FF
+ *
+	Uses Karatsuba method internally
+	@param x FF instance, on exit = y^2
+	@param y FF instance to be squared
+	@param n size of FF in BIGs
+ */
+extern void FF_sqr(B512_60::BIG *x, B512_60::BIG *y, int n);
+/**	@brief Reduces a double-length FF with respect to a given modulus
+ *
+	This is slow
+	@param x FF instance, on exit = y mod z
+	@param y FF instance, of double length 2*n
+	@param z FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_dmod(B512_60::BIG *x, B512_60::BIG *y, B512_60::BIG *z, int n);
+/**	@brief Invert an FF mod a prime modulus
+ *
+	@param x FF instance, on exit = 1/y mod z
+	@param y FF instance
+	@param z FF prime modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_invmodp(B512_60::BIG *x, B512_60::BIG *y, B512_60::BIG *z, int n);
+/**	@brief Create an FF from a random number generator
+ *
+	@param x FF instance, on exit x is a random number of length n BIGs with most significant bit a 1
+	@param R an instance of a Cryptographically Secure Random Number Generator
+	@param n size of FF in BIGs
+ */
+extern void FF_random(B512_60::BIG *x, csprng *R, int n);
+/**	@brief Create a random FF less than a given modulus from a random number generator
+ *
+	@param x FF instance, on exit x is a random number < y
+	@param y FF instance, the modulus
+	@param R an instance of a Cryptographically Secure Random Number Generator
+	@param n size of FF in BIGs
+ */
+extern void FF_randomnum(B512_60::BIG *x, B512_60::BIG *y, csprng *R, int n);
+/**	@brief Calculate r=x^e mod m, side channel resistant
+ *
+	@param r FF instance, on exit = x^e mod p
+	@param x FF instance
+	@param e FF exponent
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_skpow(B512_60::BIG *r, B512_60::BIG *x, B512_60::BIG * e, B512_60::BIG *m, int n);
+/**	@brief Calculate r=x^e mod m, side channel resistant
+ *
+	For short BIG exponent
+	@param r FF instance, on exit = x^e mod p
+	@param x FF instance
+	@param e BIG exponent
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_skspow(B512_60::BIG *r, B512_60::BIG *x, B512_60::BIG e, B512_60::BIG *m, int n);
+/**	@brief Calculate r=x^e mod m
+ *
+	For very short integer exponent
+	@param r FF instance, on exit = x^e mod p
+	@param x FF instance
+	@param e integer exponent
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_power(B512_60::BIG *r, B512_60::BIG *x, int e, B512_60::BIG *m, int n);
+/**	@brief Calculate r=x^e mod m
+ *
+	@param r FF instance, on exit = x^e mod p
+	@param x FF instance
+	@param e FF exponent
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_pow(B512_60::BIG *r, B512_60::BIG *x, B512_60::BIG *e, B512_60::BIG *m, int n);
+/**	@brief Test if an FF has factor in common with integer s
+ *
+	@param x FF instance to be tested
+	@param s the supplied integer
+	@param n size of FF in BIGs
+	@return 1 if gcd(x,s)!=1, else return 0
+ */
+extern int FF_cfactor(B512_60::BIG *x, sign32 s, int n);
+/**	@brief Test if an FF is prime
+ *
+	Uses Miller-Rabin Method
+	@param x FF instance to be tested
+	@param R an instance of a Cryptographically Secure Random Number Generator
+	@param n size of FF in BIGs
+	@return 1 if x is (almost certainly) prime, else return 0
+ */
+extern int FF_prime(B512_60::BIG *x, csprng *R, int n);
+/**	@brief Calculate r=x^e.y^f mod m
+ *
+	@param r FF instance, on exit = x^e.y^f mod p
+	@param x FF instance
+	@param e BIG exponent
+	@param y FF instance
+	@param f BIG exponent
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_pow2(B512_60::BIG *r, B512_60::BIG *x, B512_60::BIG e, B512_60::BIG *y, B512_60::BIG f, B512_60::BIG *m, int n);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp.h
new file mode 100644
index 0000000..4392395
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_YYY_H
+#define FP_YYY_H
+
+#include "big_XXX.h"
+#include "config_field_YYY.h"
+
+using namespace core;
+
+#define MODBITS_YYY MBITS_YYY
+#define TBITS_YYY (MBITS_YYY%BASEBITS_XXX)              /**< Number of active bits in top word */
+#define TMASK_YYY (((chunk)1<<TBITS_YYY)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_YYY (((sign32)1<<MAXXES_YYY)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_YYY (-((chunk)(1)<<TBITS_YYY))            /**<  for masking out overflow bits */
+
+namespace YYY {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    XXX::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const XXX::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const XXX::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const XXX::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const XXX::BIG SQRTm3;      /**< Square root of -3 */
+extern const XXX::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const XXX::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const XXX::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const XXX::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const XXX::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, XXX::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(XXX::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(XXX::BIG r, XXX::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(XXX::BIG, XXX::BIG, XXX::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, XXX::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp12.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp12.h
new file mode 100644
index 0000000..5bd7b69
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp12.h
@@ -0,0 +1,230 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP12_YYY_H
+#define FP12_YYY_H
+
+#include "fp4_YYY.h"
+
+using namespace core;
+
+namespace YYY {
+/**
+	@brief FP12 Structure - towered over three FP4
+*/
+
+typedef struct
+{
+    FP4 a; /**< first part of FP12 */
+    FP4 b; /**< second part of FP12 */
+    FP4 c; /**< third part of FP12 */
+    int type;
+} FP12;
+
+extern const XXX::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const XXX::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+/* FP12 prototypes */
+/**	@brief Tests for FP12 equal to zero
+ *
+	@param x FP12 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP12_iszilch(FP12 *x);
+/**	@brief Tests for FP12 equal to unity
+ *
+	@param x FP12 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP12_isunity(FP12 *x);
+/**	@brief Copy FP12 to another FP12
+ *
+	@param x FP12 instance, on exit = y
+	@param y FP12 instance to be copied
+ */
+extern void FP12_copy(FP12 *x, FP12 *y);
+/**	@brief Set FP12 to unity
+ *
+	@param x FP12 instance to be set to one
+ */
+extern void FP12_one(FP12 *x);
+
+/**	@brief Set FP12 to zero
+ *
+	@param x FP12 instance to be set to zero
+ */
+extern void FP12_zero(FP12 *x);
+
+/**	@brief Tests for equality of two FP12s
+ *
+	@param x FP12 instance to be compared
+	@param y FP12 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP12_equals(FP12 *x, FP12 *y);
+/**	@brief Conjugation of FP12
+ *
+	If y=(a,b,c) (where a,b,c are its three FP4 components) on exit x=(conj(a),-conj(b),conj(c))
+	@param x FP12 instance, on exit = conj(y)
+	@param y FP12 instance
+ */
+extern void FP12_conj(FP12 *x, FP12 *y);
+/**	@brief Initialise FP12 from single FP4
+ *
+	Sets first FP4 component of an FP12, other components set to zero
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP4
+ */
+extern void FP12_from_FP4(FP12 *x, FP4 *a);
+/**	@brief Initialise FP12 from three FP4s
+ *
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP12
+	@param b FP4 to form second part of FP12
+	@param c FP4 to form third part of FP12
+ */
+extern void FP12_from_FP4s(FP12 *x, FP4 *a, FP4* b, FP4 *c);
+/**	@brief Fast Squaring of an FP12 in "unitary" form
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP4 instance, must be unitary
+ */
+extern void FP12_usqr(FP12 *x, FP12 *y);
+/**	@brief Squaring an FP12
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP12 instance
+ */
+extern void FP12_sqr(FP12 *x, FP12 *y);
+/**	@brief Fast multiplication of two sparse FP12s that arises from ATE pairing line functions
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_smul(FP12 *x, FP12 *y);
+
+/**	@brief Fast multiplication of what may be sparse multiplicands
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_ssmul(FP12 *x, FP12 *y);
+
+
+/**	@brief Full unconditional Multiplication of two FP12s
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, the multiplier
+ */
+extern void FP12_mul(FP12 *x, FP12 *y);
+
+/**	@brief Inverting an FP12
+ *
+	@param x FP12 instance, on exit = 1/y
+	@param y FP12 instance
+	@param t D_TYPE or M_TYPE twist
+ */
+extern void FP12_inv(FP12 *x, FP12 *y);
+/**	@brief Raises an FP12 to the power of a BIG
+ *
+	@param r FP12 instance, on exit = y^b
+	@param x FP12 instance
+	@param b BIG number
+ */
+extern void FP12_pow(FP12 *r, FP12 *x, XXX::BIG b);
+/**	@brief Raises an FP12 instance x to a small integer power, side-channel resistant
+ *
+	@param x FP12 instance, on exit = x^i
+	@param i small integer exponent
+	@param b maximum number of bits in exponent
+ */
+extern void FP12_pinpow(FP12 *x, int i, int b);
+
+/**	@brief Raises an FP12 instance x to a BIG power, compressed to FP4
+ *
+	@param c FP4 instance, on exit = x^(e mod r) as FP4
+	@param x FP12 input
+	@param e BIG exponent
+	@param r BIG group order
+ */
+extern void FP12_compow(FP4 *c, FP12 *x, XXX::BIG e, XXX::BIG r);
+
+/**	@brief Calculate x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3], side-channel resistant
+ *
+	@param r FP12 instance, on exit = x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3]
+	@param x FP12 array with 4 FP12s
+	@param b BIG array of 4 exponents
+ */
+extern void FP12_pow4(FP12 *r, FP12 *x, XXX::BIG *b);
+/**	@brief Raises an FP12 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP12 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP12_frob(FP12 *x, FP2 *f);
+/**	@brief Reduces all components of possibly unreduced FP12 mod Modulus
+ *
+	@param x FP12 instance, on exit reduced mod Modulus
+ */
+extern void FP12_reduce(FP12 *x);
+/**	@brief Normalises the components of an FP12
+ *
+	@param x FP12 instance to be normalised
+ */
+extern void FP12_norm(FP12 *x);
+/**	@brief Formats and outputs an FP12 to the console
+ *
+	@param x FP12 instance to be printed
+ */
+extern void FP12_output(FP12 *x);
+/**	@brief Formats and outputs an FP12 instance to an octet string
+ *
+	Serializes the components of an FP12 to big-endian base 256 form.
+	@param S output octet string
+	@param x FP12 instance to be converted to an octet string
+ */
+extern void FP12_toOctet(octet *S, FP12 *x);
+/**	@brief Creates an FP12 instance from an octet string
+ *
+	De-serializes the components of an FP12 to create an FP12 from big-endian base 256 components.
+	@param x FP12 instance to be created from an octet string
+	@param S input octet string
+
+ */
+extern void FP12_fromOctet(FP12 *x, octet *S);
+/**	@brief Calculate the trace of an FP12
+ *
+	@param t FP4 trace of x, on exit = tr(x)
+	@param x FP12 instance
+
+ */
+extern void FP12_trace(FP4 *t, FP12 *x);
+
+/**	@brief Conditional copy of FP12 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP12 instance, set to y if s!=0
+	@param y another FP12 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP12_cmove(FP12 *x, FP12 *y, int s);
+
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp12_BLS12381.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp12_BLS12381.h
new file mode 100644
index 0000000..36bd83d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp12_BLS12381.h
@@ -0,0 +1,230 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP12_BLS12381_H
+#define FP12_BLS12381_H
+
+#include "fp4_BLS12381.h"
+
+using namespace core;
+
+namespace BLS12381 {
+/**
+	@brief FP12 Structure - towered over three FP4
+*/
+
+typedef struct
+{
+    FP4 a; /**< first part of FP12 */
+    FP4 b; /**< second part of FP12 */
+    FP4 c; /**< third part of FP12 */
+    int type;
+} FP12;
+
+extern const B384_58::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B384_58::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+/* FP12 prototypes */
+/**	@brief Tests for FP12 equal to zero
+ *
+	@param x FP12 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP12_iszilch(FP12 *x);
+/**	@brief Tests for FP12 equal to unity
+ *
+	@param x FP12 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP12_isunity(FP12 *x);
+/**	@brief Copy FP12 to another FP12
+ *
+	@param x FP12 instance, on exit = y
+	@param y FP12 instance to be copied
+ */
+extern void FP12_copy(FP12 *x, FP12 *y);
+/**	@brief Set FP12 to unity
+ *
+	@param x FP12 instance to be set to one
+ */
+extern void FP12_one(FP12 *x);
+
+/**	@brief Set FP12 to zero
+ *
+	@param x FP12 instance to be set to zero
+ */
+extern void FP12_zero(FP12 *x);
+
+/**	@brief Tests for equality of two FP12s
+ *
+	@param x FP12 instance to be compared
+	@param y FP12 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP12_equals(FP12 *x, FP12 *y);
+/**	@brief Conjugation of FP12
+ *
+	If y=(a,b,c) (where a,b,c are its three FP4 components) on exit x=(conj(a),-conj(b),conj(c))
+	@param x FP12 instance, on exit = conj(y)
+	@param y FP12 instance
+ */
+extern void FP12_conj(FP12 *x, FP12 *y);
+/**	@brief Initialise FP12 from single FP4
+ *
+	Sets first FP4 component of an FP12, other components set to zero
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP4
+ */
+extern void FP12_from_FP4(FP12 *x, FP4 *a);
+/**	@brief Initialise FP12 from three FP4s
+ *
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP12
+	@param b FP4 to form second part of FP12
+	@param c FP4 to form third part of FP12
+ */
+extern void FP12_from_FP4s(FP12 *x, FP4 *a, FP4* b, FP4 *c);
+/**	@brief Fast Squaring of an FP12 in "unitary" form
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP4 instance, must be unitary
+ */
+extern void FP12_usqr(FP12 *x, FP12 *y);
+/**	@brief Squaring an FP12
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP12 instance
+ */
+extern void FP12_sqr(FP12 *x, FP12 *y);
+/**	@brief Fast multiplication of two sparse FP12s that arises from ATE pairing line functions
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_smul(FP12 *x, FP12 *y);
+
+/**	@brief Fast multiplication of what may be sparse multiplicands
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_ssmul(FP12 *x, FP12 *y);
+
+
+/**	@brief Full unconditional Multiplication of two FP12s
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, the multiplier
+ */
+extern void FP12_mul(FP12 *x, FP12 *y);
+
+/**	@brief Inverting an FP12
+ *
+	@param x FP12 instance, on exit = 1/y
+	@param y FP12 instance
+	@param t D_TYPE or M_TYPE twist
+ */
+extern void FP12_inv(FP12 *x, FP12 *y);
+/**	@brief Raises an FP12 to the power of a BIG
+ *
+	@param r FP12 instance, on exit = y^b
+	@param x FP12 instance
+	@param b BIG number
+ */
+extern void FP12_pow(FP12 *r, FP12 *x, B384_58::BIG b);
+/**	@brief Raises an FP12 instance x to a small integer power, side-channel resistant
+ *
+	@param x FP12 instance, on exit = x^i
+	@param i small integer exponent
+	@param b maximum number of bits in exponent
+ */
+extern void FP12_pinpow(FP12 *x, int i, int b);
+
+/**	@brief Raises an FP12 instance x to a BIG power, compressed to FP4
+ *
+	@param c FP4 instance, on exit = x^(e mod r) as FP4
+	@param x FP12 input
+	@param e BIG exponent
+	@param r BIG group order
+ */
+extern void FP12_compow(FP4 *c, FP12 *x, B384_58::BIG e, B384_58::BIG r);
+
+/**	@brief Calculate x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3], side-channel resistant
+ *
+	@param r FP12 instance, on exit = x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3]
+	@param x FP12 array with 4 FP12s
+	@param b BIG array of 4 exponents
+ */
+extern void FP12_pow4(FP12 *r, FP12 *x, B384_58::BIG *b);
+/**	@brief Raises an FP12 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP12 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP12_frob(FP12 *x, FP2 *f);
+/**	@brief Reduces all components of possibly unreduced FP12 mod Modulus
+ *
+	@param x FP12 instance, on exit reduced mod Modulus
+ */
+extern void FP12_reduce(FP12 *x);
+/**	@brief Normalises the components of an FP12
+ *
+	@param x FP12 instance to be normalised
+ */
+extern void FP12_norm(FP12 *x);
+/**	@brief Formats and outputs an FP12 to the console
+ *
+	@param x FP12 instance to be printed
+ */
+extern void FP12_output(FP12 *x);
+/**	@brief Formats and outputs an FP12 instance to an octet string
+ *
+	Serializes the components of an FP12 to big-endian base 256 form.
+	@param S output octet string
+	@param x FP12 instance to be converted to an octet string
+ */
+extern void FP12_toOctet(octet *S, FP12 *x);
+/**	@brief Creates an FP12 instance from an octet string
+ *
+	De-serializes the components of an FP12 to create an FP12 from big-endian base 256 components.
+	@param x FP12 instance to be created from an octet string
+	@param S input octet string
+
+ */
+extern void FP12_fromOctet(FP12 *x, octet *S);
+/**	@brief Calculate the trace of an FP12
+ *
+	@param t FP4 trace of x, on exit = tr(x)
+	@param x FP12 instance
+
+ */
+extern void FP12_trace(FP4 *t, FP12 *x);
+
+/**	@brief Conditional copy of FP12 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP12 instance, set to y if s!=0
+	@param y another FP12 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP12_cmove(FP12 *x, FP12 *y, int s);
+
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp12_BLS12383.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp12_BLS12383.h
new file mode 100644
index 0000000..be0a1d6
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp12_BLS12383.h
@@ -0,0 +1,230 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP12_BLS12383_H
+#define FP12_BLS12383_H
+
+#include "fp4_BLS12383.h"
+
+using namespace core;
+
+namespace BLS12383 {
+/**
+	@brief FP12 Structure - towered over three FP4
+*/
+
+typedef struct
+{
+    FP4 a; /**< first part of FP12 */
+    FP4 b; /**< second part of FP12 */
+    FP4 c; /**< third part of FP12 */
+    int type;
+} FP12;
+
+extern const B384_58::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B384_58::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+/* FP12 prototypes */
+/**	@brief Tests for FP12 equal to zero
+ *
+	@param x FP12 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP12_iszilch(FP12 *x);
+/**	@brief Tests for FP12 equal to unity
+ *
+	@param x FP12 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP12_isunity(FP12 *x);
+/**	@brief Copy FP12 to another FP12
+ *
+	@param x FP12 instance, on exit = y
+	@param y FP12 instance to be copied
+ */
+extern void FP12_copy(FP12 *x, FP12 *y);
+/**	@brief Set FP12 to unity
+ *
+	@param x FP12 instance to be set to one
+ */
+extern void FP12_one(FP12 *x);
+
+/**	@brief Set FP12 to zero
+ *
+	@param x FP12 instance to be set to zero
+ */
+extern void FP12_zero(FP12 *x);
+
+/**	@brief Tests for equality of two FP12s
+ *
+	@param x FP12 instance to be compared
+	@param y FP12 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP12_equals(FP12 *x, FP12 *y);
+/**	@brief Conjugation of FP12
+ *
+	If y=(a,b,c) (where a,b,c are its three FP4 components) on exit x=(conj(a),-conj(b),conj(c))
+	@param x FP12 instance, on exit = conj(y)
+	@param y FP12 instance
+ */
+extern void FP12_conj(FP12 *x, FP12 *y);
+/**	@brief Initialise FP12 from single FP4
+ *
+	Sets first FP4 component of an FP12, other components set to zero
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP4
+ */
+extern void FP12_from_FP4(FP12 *x, FP4 *a);
+/**	@brief Initialise FP12 from three FP4s
+ *
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP12
+	@param b FP4 to form second part of FP12
+	@param c FP4 to form third part of FP12
+ */
+extern void FP12_from_FP4s(FP12 *x, FP4 *a, FP4* b, FP4 *c);
+/**	@brief Fast Squaring of an FP12 in "unitary" form
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP4 instance, must be unitary
+ */
+extern void FP12_usqr(FP12 *x, FP12 *y);
+/**	@brief Squaring an FP12
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP12 instance
+ */
+extern void FP12_sqr(FP12 *x, FP12 *y);
+/**	@brief Fast multiplication of two sparse FP12s that arises from ATE pairing line functions
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_smul(FP12 *x, FP12 *y);
+
+/**	@brief Fast multiplication of what may be sparse multiplicands
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_ssmul(FP12 *x, FP12 *y);
+
+
+/**	@brief Full unconditional Multiplication of two FP12s
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, the multiplier
+ */
+extern void FP12_mul(FP12 *x, FP12 *y);
+
+/**	@brief Inverting an FP12
+ *
+	@param x FP12 instance, on exit = 1/y
+	@param y FP12 instance
+	@param t D_TYPE or M_TYPE twist
+ */
+extern void FP12_inv(FP12 *x, FP12 *y);
+/**	@brief Raises an FP12 to the power of a BIG
+ *
+	@param r FP12 instance, on exit = y^b
+	@param x FP12 instance
+	@param b BIG number
+ */
+extern void FP12_pow(FP12 *r, FP12 *x, B384_58::BIG b);
+/**	@brief Raises an FP12 instance x to a small integer power, side-channel resistant
+ *
+	@param x FP12 instance, on exit = x^i
+	@param i small integer exponent
+	@param b maximum number of bits in exponent
+ */
+extern void FP12_pinpow(FP12 *x, int i, int b);
+
+/**	@brief Raises an FP12 instance x to a BIG power, compressed to FP4
+ *
+	@param c FP4 instance, on exit = x^(e mod r) as FP4
+	@param x FP12 input
+	@param e BIG exponent
+	@param r BIG group order
+ */
+extern void FP12_compow(FP4 *c, FP12 *x, B384_58::BIG e, B384_58::BIG r);
+
+/**	@brief Calculate x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3], side-channel resistant
+ *
+	@param r FP12 instance, on exit = x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3]
+	@param x FP12 array with 4 FP12s
+	@param b BIG array of 4 exponents
+ */
+extern void FP12_pow4(FP12 *r, FP12 *x, B384_58::BIG *b);
+/**	@brief Raises an FP12 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP12 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP12_frob(FP12 *x, FP2 *f);
+/**	@brief Reduces all components of possibly unreduced FP12 mod Modulus
+ *
+	@param x FP12 instance, on exit reduced mod Modulus
+ */
+extern void FP12_reduce(FP12 *x);
+/**	@brief Normalises the components of an FP12
+ *
+	@param x FP12 instance to be normalised
+ */
+extern void FP12_norm(FP12 *x);
+/**	@brief Formats and outputs an FP12 to the console
+ *
+	@param x FP12 instance to be printed
+ */
+extern void FP12_output(FP12 *x);
+/**	@brief Formats and outputs an FP12 instance to an octet string
+ *
+	Serializes the components of an FP12 to big-endian base 256 form.
+	@param S output octet string
+	@param x FP12 instance to be converted to an octet string
+ */
+extern void FP12_toOctet(octet *S, FP12 *x);
+/**	@brief Creates an FP12 instance from an octet string
+ *
+	De-serializes the components of an FP12 to create an FP12 from big-endian base 256 components.
+	@param x FP12 instance to be created from an octet string
+	@param S input octet string
+
+ */
+extern void FP12_fromOctet(FP12 *x, octet *S);
+/**	@brief Calculate the trace of an FP12
+ *
+	@param t FP4 trace of x, on exit = tr(x)
+	@param x FP12 instance
+
+ */
+extern void FP12_trace(FP4 *t, FP12 *x);
+
+/**	@brief Conditional copy of FP12 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP12 instance, set to y if s!=0
+	@param y another FP12 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP12_cmove(FP12 *x, FP12 *y, int s);
+
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp12_BLS12443.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp12_BLS12443.h
new file mode 100644
index 0000000..a441462
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp12_BLS12443.h
@@ -0,0 +1,230 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP12_BLS12443_H
+#define FP12_BLS12443_H
+
+#include "fp4_BLS12443.h"
+
+using namespace core;
+
+namespace BLS12443 {
+/**
+	@brief FP12 Structure - towered over three FP4
+*/
+
+typedef struct
+{
+    FP4 a; /**< first part of FP12 */
+    FP4 b; /**< second part of FP12 */
+    FP4 c; /**< third part of FP12 */
+    int type;
+} FP12;
+
+extern const B448_60::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B448_60::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+/* FP12 prototypes */
+/**	@brief Tests for FP12 equal to zero
+ *
+	@param x FP12 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP12_iszilch(FP12 *x);
+/**	@brief Tests for FP12 equal to unity
+ *
+	@param x FP12 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP12_isunity(FP12 *x);
+/**	@brief Copy FP12 to another FP12
+ *
+	@param x FP12 instance, on exit = y
+	@param y FP12 instance to be copied
+ */
+extern void FP12_copy(FP12 *x, FP12 *y);
+/**	@brief Set FP12 to unity
+ *
+	@param x FP12 instance to be set to one
+ */
+extern void FP12_one(FP12 *x);
+
+/**	@brief Set FP12 to zero
+ *
+	@param x FP12 instance to be set to zero
+ */
+extern void FP12_zero(FP12 *x);
+
+/**	@brief Tests for equality of two FP12s
+ *
+	@param x FP12 instance to be compared
+	@param y FP12 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP12_equals(FP12 *x, FP12 *y);
+/**	@brief Conjugation of FP12
+ *
+	If y=(a,b,c) (where a,b,c are its three FP4 components) on exit x=(conj(a),-conj(b),conj(c))
+	@param x FP12 instance, on exit = conj(y)
+	@param y FP12 instance
+ */
+extern void FP12_conj(FP12 *x, FP12 *y);
+/**	@brief Initialise FP12 from single FP4
+ *
+	Sets first FP4 component of an FP12, other components set to zero
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP4
+ */
+extern void FP12_from_FP4(FP12 *x, FP4 *a);
+/**	@brief Initialise FP12 from three FP4s
+ *
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP12
+	@param b FP4 to form second part of FP12
+	@param c FP4 to form third part of FP12
+ */
+extern void FP12_from_FP4s(FP12 *x, FP4 *a, FP4* b, FP4 *c);
+/**	@brief Fast Squaring of an FP12 in "unitary" form
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP4 instance, must be unitary
+ */
+extern void FP12_usqr(FP12 *x, FP12 *y);
+/**	@brief Squaring an FP12
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP12 instance
+ */
+extern void FP12_sqr(FP12 *x, FP12 *y);
+/**	@brief Fast multiplication of two sparse FP12s that arises from ATE pairing line functions
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_smul(FP12 *x, FP12 *y);
+
+/**	@brief Fast multiplication of what may be sparse multiplicands
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_ssmul(FP12 *x, FP12 *y);
+
+
+/**	@brief Full unconditional Multiplication of two FP12s
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, the multiplier
+ */
+extern void FP12_mul(FP12 *x, FP12 *y);
+
+/**	@brief Inverting an FP12
+ *
+	@param x FP12 instance, on exit = 1/y
+	@param y FP12 instance
+	@param t D_TYPE or M_TYPE twist
+ */
+extern void FP12_inv(FP12 *x, FP12 *y);
+/**	@brief Raises an FP12 to the power of a BIG
+ *
+	@param r FP12 instance, on exit = y^b
+	@param x FP12 instance
+	@param b BIG number
+ */
+extern void FP12_pow(FP12 *r, FP12 *x, B448_60::BIG b);
+/**	@brief Raises an FP12 instance x to a small integer power, side-channel resistant
+ *
+	@param x FP12 instance, on exit = x^i
+	@param i small integer exponent
+	@param b maximum number of bits in exponent
+ */
+extern void FP12_pinpow(FP12 *x, int i, int b);
+
+/**	@brief Raises an FP12 instance x to a BIG power, compressed to FP4
+ *
+	@param c FP4 instance, on exit = x^(e mod r) as FP4
+	@param x FP12 input
+	@param e BIG exponent
+	@param r BIG group order
+ */
+extern void FP12_compow(FP4 *c, FP12 *x, B448_60::BIG e, B448_60::BIG r);
+
+/**	@brief Calculate x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3], side-channel resistant
+ *
+	@param r FP12 instance, on exit = x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3]
+	@param x FP12 array with 4 FP12s
+	@param b BIG array of 4 exponents
+ */
+extern void FP12_pow4(FP12 *r, FP12 *x, B448_60::BIG *b);
+/**	@brief Raises an FP12 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP12 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP12_frob(FP12 *x, FP2 *f);
+/**	@brief Reduces all components of possibly unreduced FP12 mod Modulus
+ *
+	@param x FP12 instance, on exit reduced mod Modulus
+ */
+extern void FP12_reduce(FP12 *x);
+/**	@brief Normalises the components of an FP12
+ *
+	@param x FP12 instance to be normalised
+ */
+extern void FP12_norm(FP12 *x);
+/**	@brief Formats and outputs an FP12 to the console
+ *
+	@param x FP12 instance to be printed
+ */
+extern void FP12_output(FP12 *x);
+/**	@brief Formats and outputs an FP12 instance to an octet string
+ *
+	Serializes the components of an FP12 to big-endian base 256 form.
+	@param S output octet string
+	@param x FP12 instance to be converted to an octet string
+ */
+extern void FP12_toOctet(octet *S, FP12 *x);
+/**	@brief Creates an FP12 instance from an octet string
+ *
+	De-serializes the components of an FP12 to create an FP12 from big-endian base 256 components.
+	@param x FP12 instance to be created from an octet string
+	@param S input octet string
+
+ */
+extern void FP12_fromOctet(FP12 *x, octet *S);
+/**	@brief Calculate the trace of an FP12
+ *
+	@param t FP4 trace of x, on exit = tr(x)
+	@param x FP12 instance
+
+ */
+extern void FP12_trace(FP4 *t, FP12 *x);
+
+/**	@brief Conditional copy of FP12 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP12 instance, set to y if s!=0
+	@param y another FP12 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP12_cmove(FP12 *x, FP12 *y, int s);
+
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp12_BLS12461.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp12_BLS12461.h
new file mode 100644
index 0000000..76901af
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp12_BLS12461.h
@@ -0,0 +1,230 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP12_BLS12461_H
+#define FP12_BLS12461_H
+
+#include "fp4_BLS12461.h"
+
+using namespace core;
+
+namespace BLS12461 {
+/**
+	@brief FP12 Structure - towered over three FP4
+*/
+
+typedef struct
+{
+    FP4 a; /**< first part of FP12 */
+    FP4 b; /**< second part of FP12 */
+    FP4 c; /**< third part of FP12 */
+    int type;
+} FP12;
+
+extern const B464_60::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B464_60::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+/* FP12 prototypes */
+/**	@brief Tests for FP12 equal to zero
+ *
+	@param x FP12 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP12_iszilch(FP12 *x);
+/**	@brief Tests for FP12 equal to unity
+ *
+	@param x FP12 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP12_isunity(FP12 *x);
+/**	@brief Copy FP12 to another FP12
+ *
+	@param x FP12 instance, on exit = y
+	@param y FP12 instance to be copied
+ */
+extern void FP12_copy(FP12 *x, FP12 *y);
+/**	@brief Set FP12 to unity
+ *
+	@param x FP12 instance to be set to one
+ */
+extern void FP12_one(FP12 *x);
+
+/**	@brief Set FP12 to zero
+ *
+	@param x FP12 instance to be set to zero
+ */
+extern void FP12_zero(FP12 *x);
+
+/**	@brief Tests for equality of two FP12s
+ *
+	@param x FP12 instance to be compared
+	@param y FP12 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP12_equals(FP12 *x, FP12 *y);
+/**	@brief Conjugation of FP12
+ *
+	If y=(a,b,c) (where a,b,c are its three FP4 components) on exit x=(conj(a),-conj(b),conj(c))
+	@param x FP12 instance, on exit = conj(y)
+	@param y FP12 instance
+ */
+extern void FP12_conj(FP12 *x, FP12 *y);
+/**	@brief Initialise FP12 from single FP4
+ *
+	Sets first FP4 component of an FP12, other components set to zero
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP4
+ */
+extern void FP12_from_FP4(FP12 *x, FP4 *a);
+/**	@brief Initialise FP12 from three FP4s
+ *
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP12
+	@param b FP4 to form second part of FP12
+	@param c FP4 to form third part of FP12
+ */
+extern void FP12_from_FP4s(FP12 *x, FP4 *a, FP4* b, FP4 *c);
+/**	@brief Fast Squaring of an FP12 in "unitary" form
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP4 instance, must be unitary
+ */
+extern void FP12_usqr(FP12 *x, FP12 *y);
+/**	@brief Squaring an FP12
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP12 instance
+ */
+extern void FP12_sqr(FP12 *x, FP12 *y);
+/**	@brief Fast multiplication of two sparse FP12s that arises from ATE pairing line functions
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_smul(FP12 *x, FP12 *y);
+
+/**	@brief Fast multiplication of what may be sparse multiplicands
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_ssmul(FP12 *x, FP12 *y);
+
+
+/**	@brief Full unconditional Multiplication of two FP12s
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, the multiplier
+ */
+extern void FP12_mul(FP12 *x, FP12 *y);
+
+/**	@brief Inverting an FP12
+ *
+	@param x FP12 instance, on exit = 1/y
+	@param y FP12 instance
+	@param t D_TYPE or M_TYPE twist
+ */
+extern void FP12_inv(FP12 *x, FP12 *y);
+/**	@brief Raises an FP12 to the power of a BIG
+ *
+	@param r FP12 instance, on exit = y^b
+	@param x FP12 instance
+	@param b BIG number
+ */
+extern void FP12_pow(FP12 *r, FP12 *x, B464_60::BIG b);
+/**	@brief Raises an FP12 instance x to a small integer power, side-channel resistant
+ *
+	@param x FP12 instance, on exit = x^i
+	@param i small integer exponent
+	@param b maximum number of bits in exponent
+ */
+extern void FP12_pinpow(FP12 *x, int i, int b);
+
+/**	@brief Raises an FP12 instance x to a BIG power, compressed to FP4
+ *
+	@param c FP4 instance, on exit = x^(e mod r) as FP4
+	@param x FP12 input
+	@param e BIG exponent
+	@param r BIG group order
+ */
+extern void FP12_compow(FP4 *c, FP12 *x, B464_60::BIG e, B464_60::BIG r);
+
+/**	@brief Calculate x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3], side-channel resistant
+ *
+	@param r FP12 instance, on exit = x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3]
+	@param x FP12 array with 4 FP12s
+	@param b BIG array of 4 exponents
+ */
+extern void FP12_pow4(FP12 *r, FP12 *x, B464_60::BIG *b);
+/**	@brief Raises an FP12 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP12 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP12_frob(FP12 *x, FP2 *f);
+/**	@brief Reduces all components of possibly unreduced FP12 mod Modulus
+ *
+	@param x FP12 instance, on exit reduced mod Modulus
+ */
+extern void FP12_reduce(FP12 *x);
+/**	@brief Normalises the components of an FP12
+ *
+	@param x FP12 instance to be normalised
+ */
+extern void FP12_norm(FP12 *x);
+/**	@brief Formats and outputs an FP12 to the console
+ *
+	@param x FP12 instance to be printed
+ */
+extern void FP12_output(FP12 *x);
+/**	@brief Formats and outputs an FP12 instance to an octet string
+ *
+	Serializes the components of an FP12 to big-endian base 256 form.
+	@param S output octet string
+	@param x FP12 instance to be converted to an octet string
+ */
+extern void FP12_toOctet(octet *S, FP12 *x);
+/**	@brief Creates an FP12 instance from an octet string
+ *
+	De-serializes the components of an FP12 to create an FP12 from big-endian base 256 components.
+	@param x FP12 instance to be created from an octet string
+	@param S input octet string
+
+ */
+extern void FP12_fromOctet(FP12 *x, octet *S);
+/**	@brief Calculate the trace of an FP12
+ *
+	@param t FP4 trace of x, on exit = tr(x)
+	@param x FP12 instance
+
+ */
+extern void FP12_trace(FP4 *t, FP12 *x);
+
+/**	@brief Conditional copy of FP12 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP12 instance, set to y if s!=0
+	@param y another FP12 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP12_cmove(FP12 *x, FP12 *y, int s);
+
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp12_BN158.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp12_BN158.h
new file mode 100644
index 0000000..1a68a7a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp12_BN158.h
@@ -0,0 +1,230 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP12_BN158_H
+#define FP12_BN158_H
+
+#include "fp4_BN158.h"
+
+using namespace core;
+
+namespace BN158 {
+/**
+	@brief FP12 Structure - towered over three FP4
+*/
+
+typedef struct
+{
+    FP4 a; /**< first part of FP12 */
+    FP4 b; /**< second part of FP12 */
+    FP4 c; /**< third part of FP12 */
+    int type;
+} FP12;
+
+extern const B160_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B160_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+/* FP12 prototypes */
+/**	@brief Tests for FP12 equal to zero
+ *
+	@param x FP12 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP12_iszilch(FP12 *x);
+/**	@brief Tests for FP12 equal to unity
+ *
+	@param x FP12 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP12_isunity(FP12 *x);
+/**	@brief Copy FP12 to another FP12
+ *
+	@param x FP12 instance, on exit = y
+	@param y FP12 instance to be copied
+ */
+extern void FP12_copy(FP12 *x, FP12 *y);
+/**	@brief Set FP12 to unity
+ *
+	@param x FP12 instance to be set to one
+ */
+extern void FP12_one(FP12 *x);
+
+/**	@brief Set FP12 to zero
+ *
+	@param x FP12 instance to be set to zero
+ */
+extern void FP12_zero(FP12 *x);
+
+/**	@brief Tests for equality of two FP12s
+ *
+	@param x FP12 instance to be compared
+	@param y FP12 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP12_equals(FP12 *x, FP12 *y);
+/**	@brief Conjugation of FP12
+ *
+	If y=(a,b,c) (where a,b,c are its three FP4 components) on exit x=(conj(a),-conj(b),conj(c))
+	@param x FP12 instance, on exit = conj(y)
+	@param y FP12 instance
+ */
+extern void FP12_conj(FP12 *x, FP12 *y);
+/**	@brief Initialise FP12 from single FP4
+ *
+	Sets first FP4 component of an FP12, other components set to zero
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP4
+ */
+extern void FP12_from_FP4(FP12 *x, FP4 *a);
+/**	@brief Initialise FP12 from three FP4s
+ *
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP12
+	@param b FP4 to form second part of FP12
+	@param c FP4 to form third part of FP12
+ */
+extern void FP12_from_FP4s(FP12 *x, FP4 *a, FP4* b, FP4 *c);
+/**	@brief Fast Squaring of an FP12 in "unitary" form
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP4 instance, must be unitary
+ */
+extern void FP12_usqr(FP12 *x, FP12 *y);
+/**	@brief Squaring an FP12
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP12 instance
+ */
+extern void FP12_sqr(FP12 *x, FP12 *y);
+/**	@brief Fast multiplication of two sparse FP12s that arises from ATE pairing line functions
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_smul(FP12 *x, FP12 *y);
+
+/**	@brief Fast multiplication of what may be sparse multiplicands
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_ssmul(FP12 *x, FP12 *y);
+
+
+/**	@brief Full unconditional Multiplication of two FP12s
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, the multiplier
+ */
+extern void FP12_mul(FP12 *x, FP12 *y);
+
+/**	@brief Inverting an FP12
+ *
+	@param x FP12 instance, on exit = 1/y
+	@param y FP12 instance
+	@param t D_TYPE or M_TYPE twist
+ */
+extern void FP12_inv(FP12 *x, FP12 *y);
+/**	@brief Raises an FP12 to the power of a BIG
+ *
+	@param r FP12 instance, on exit = y^b
+	@param x FP12 instance
+	@param b BIG number
+ */
+extern void FP12_pow(FP12 *r, FP12 *x, B160_56::BIG b);
+/**	@brief Raises an FP12 instance x to a small integer power, side-channel resistant
+ *
+	@param x FP12 instance, on exit = x^i
+	@param i small integer exponent
+	@param b maximum number of bits in exponent
+ */
+extern void FP12_pinpow(FP12 *x, int i, int b);
+
+/**	@brief Raises an FP12 instance x to a BIG power, compressed to FP4
+ *
+	@param c FP4 instance, on exit = x^(e mod r) as FP4
+	@param x FP12 input
+	@param e BIG exponent
+	@param r BIG group order
+ */
+extern void FP12_compow(FP4 *c, FP12 *x, B160_56::BIG e, B160_56::BIG r);
+
+/**	@brief Calculate x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3], side-channel resistant
+ *
+	@param r FP12 instance, on exit = x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3]
+	@param x FP12 array with 4 FP12s
+	@param b BIG array of 4 exponents
+ */
+extern void FP12_pow4(FP12 *r, FP12 *x, B160_56::BIG *b);
+/**	@brief Raises an FP12 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP12 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP12_frob(FP12 *x, FP2 *f);
+/**	@brief Reduces all components of possibly unreduced FP12 mod Modulus
+ *
+	@param x FP12 instance, on exit reduced mod Modulus
+ */
+extern void FP12_reduce(FP12 *x);
+/**	@brief Normalises the components of an FP12
+ *
+	@param x FP12 instance to be normalised
+ */
+extern void FP12_norm(FP12 *x);
+/**	@brief Formats and outputs an FP12 to the console
+ *
+	@param x FP12 instance to be printed
+ */
+extern void FP12_output(FP12 *x);
+/**	@brief Formats and outputs an FP12 instance to an octet string
+ *
+	Serializes the components of an FP12 to big-endian base 256 form.
+	@param S output octet string
+	@param x FP12 instance to be converted to an octet string
+ */
+extern void FP12_toOctet(octet *S, FP12 *x);
+/**	@brief Creates an FP12 instance from an octet string
+ *
+	De-serializes the components of an FP12 to create an FP12 from big-endian base 256 components.
+	@param x FP12 instance to be created from an octet string
+	@param S input octet string
+
+ */
+extern void FP12_fromOctet(FP12 *x, octet *S);
+/**	@brief Calculate the trace of an FP12
+ *
+	@param t FP4 trace of x, on exit = tr(x)
+	@param x FP12 instance
+
+ */
+extern void FP12_trace(FP4 *t, FP12 *x);
+
+/**	@brief Conditional copy of FP12 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP12 instance, set to y if s!=0
+	@param y another FP12 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP12_cmove(FP12 *x, FP12 *y, int s);
+
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp12_BN254.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp12_BN254.h
new file mode 100644
index 0000000..9d34371
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp12_BN254.h
@@ -0,0 +1,230 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP12_BN254_H
+#define FP12_BN254_H
+
+#include "fp4_BN254.h"
+
+using namespace core;
+
+namespace BN254 {
+/**
+	@brief FP12 Structure - towered over three FP4
+*/
+
+typedef struct
+{
+    FP4 a; /**< first part of FP12 */
+    FP4 b; /**< second part of FP12 */
+    FP4 c; /**< third part of FP12 */
+    int type;
+} FP12;
+
+extern const B256_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+/* FP12 prototypes */
+/**	@brief Tests for FP12 equal to zero
+ *
+	@param x FP12 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP12_iszilch(FP12 *x);
+/**	@brief Tests for FP12 equal to unity
+ *
+	@param x FP12 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP12_isunity(FP12 *x);
+/**	@brief Copy FP12 to another FP12
+ *
+	@param x FP12 instance, on exit = y
+	@param y FP12 instance to be copied
+ */
+extern void FP12_copy(FP12 *x, FP12 *y);
+/**	@brief Set FP12 to unity
+ *
+	@param x FP12 instance to be set to one
+ */
+extern void FP12_one(FP12 *x);
+
+/**	@brief Set FP12 to zero
+ *
+	@param x FP12 instance to be set to zero
+ */
+extern void FP12_zero(FP12 *x);
+
+/**	@brief Tests for equality of two FP12s
+ *
+	@param x FP12 instance to be compared
+	@param y FP12 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP12_equals(FP12 *x, FP12 *y);
+/**	@brief Conjugation of FP12
+ *
+	If y=(a,b,c) (where a,b,c are its three FP4 components) on exit x=(conj(a),-conj(b),conj(c))
+	@param x FP12 instance, on exit = conj(y)
+	@param y FP12 instance
+ */
+extern void FP12_conj(FP12 *x, FP12 *y);
+/**	@brief Initialise FP12 from single FP4
+ *
+	Sets first FP4 component of an FP12, other components set to zero
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP4
+ */
+extern void FP12_from_FP4(FP12 *x, FP4 *a);
+/**	@brief Initialise FP12 from three FP4s
+ *
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP12
+	@param b FP4 to form second part of FP12
+	@param c FP4 to form third part of FP12
+ */
+extern void FP12_from_FP4s(FP12 *x, FP4 *a, FP4* b, FP4 *c);
+/**	@brief Fast Squaring of an FP12 in "unitary" form
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP4 instance, must be unitary
+ */
+extern void FP12_usqr(FP12 *x, FP12 *y);
+/**	@brief Squaring an FP12
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP12 instance
+ */
+extern void FP12_sqr(FP12 *x, FP12 *y);
+/**	@brief Fast multiplication of two sparse FP12s that arises from ATE pairing line functions
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_smul(FP12 *x, FP12 *y);
+
+/**	@brief Fast multiplication of what may be sparse multiplicands
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_ssmul(FP12 *x, FP12 *y);
+
+
+/**	@brief Full unconditional Multiplication of two FP12s
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, the multiplier
+ */
+extern void FP12_mul(FP12 *x, FP12 *y);
+
+/**	@brief Inverting an FP12
+ *
+	@param x FP12 instance, on exit = 1/y
+	@param y FP12 instance
+	@param t D_TYPE or M_TYPE twist
+ */
+extern void FP12_inv(FP12 *x, FP12 *y);
+/**	@brief Raises an FP12 to the power of a BIG
+ *
+	@param r FP12 instance, on exit = y^b
+	@param x FP12 instance
+	@param b BIG number
+ */
+extern void FP12_pow(FP12 *r, FP12 *x, B256_56::BIG b);
+/**	@brief Raises an FP12 instance x to a small integer power, side-channel resistant
+ *
+	@param x FP12 instance, on exit = x^i
+	@param i small integer exponent
+	@param b maximum number of bits in exponent
+ */
+extern void FP12_pinpow(FP12 *x, int i, int b);
+
+/**	@brief Raises an FP12 instance x to a BIG power, compressed to FP4
+ *
+	@param c FP4 instance, on exit = x^(e mod r) as FP4
+	@param x FP12 input
+	@param e BIG exponent
+	@param r BIG group order
+ */
+extern void FP12_compow(FP4 *c, FP12 *x, B256_56::BIG e, B256_56::BIG r);
+
+/**	@brief Calculate x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3], side-channel resistant
+ *
+	@param r FP12 instance, on exit = x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3]
+	@param x FP12 array with 4 FP12s
+	@param b BIG array of 4 exponents
+ */
+extern void FP12_pow4(FP12 *r, FP12 *x, B256_56::BIG *b);
+/**	@brief Raises an FP12 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP12 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP12_frob(FP12 *x, FP2 *f);
+/**	@brief Reduces all components of possibly unreduced FP12 mod Modulus
+ *
+	@param x FP12 instance, on exit reduced mod Modulus
+ */
+extern void FP12_reduce(FP12 *x);
+/**	@brief Normalises the components of an FP12
+ *
+	@param x FP12 instance to be normalised
+ */
+extern void FP12_norm(FP12 *x);
+/**	@brief Formats and outputs an FP12 to the console
+ *
+	@param x FP12 instance to be printed
+ */
+extern void FP12_output(FP12 *x);
+/**	@brief Formats and outputs an FP12 instance to an octet string
+ *
+	Serializes the components of an FP12 to big-endian base 256 form.
+	@param S output octet string
+	@param x FP12 instance to be converted to an octet string
+ */
+extern void FP12_toOctet(octet *S, FP12 *x);
+/**	@brief Creates an FP12 instance from an octet string
+ *
+	De-serializes the components of an FP12 to create an FP12 from big-endian base 256 components.
+	@param x FP12 instance to be created from an octet string
+	@param S input octet string
+
+ */
+extern void FP12_fromOctet(FP12 *x, octet *S);
+/**	@brief Calculate the trace of an FP12
+ *
+	@param t FP4 trace of x, on exit = tr(x)
+	@param x FP12 instance
+
+ */
+extern void FP12_trace(FP4 *t, FP12 *x);
+
+/**	@brief Conditional copy of FP12 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP12 instance, set to y if s!=0
+	@param y another FP12 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP12_cmove(FP12 *x, FP12 *y, int s);
+
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp12_BN254CX.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp12_BN254CX.h
new file mode 100644
index 0000000..bcdb4b8
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp12_BN254CX.h
@@ -0,0 +1,230 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP12_BN254CX_H
+#define FP12_BN254CX_H
+
+#include "fp4_BN254CX.h"
+
+using namespace core;
+
+namespace BN254CX {
+/**
+	@brief FP12 Structure - towered over three FP4
+*/
+
+typedef struct
+{
+    FP4 a; /**< first part of FP12 */
+    FP4 b; /**< second part of FP12 */
+    FP4 c; /**< third part of FP12 */
+    int type;
+} FP12;
+
+extern const B256_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+/* FP12 prototypes */
+/**	@brief Tests for FP12 equal to zero
+ *
+	@param x FP12 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP12_iszilch(FP12 *x);
+/**	@brief Tests for FP12 equal to unity
+ *
+	@param x FP12 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP12_isunity(FP12 *x);
+/**	@brief Copy FP12 to another FP12
+ *
+	@param x FP12 instance, on exit = y
+	@param y FP12 instance to be copied
+ */
+extern void FP12_copy(FP12 *x, FP12 *y);
+/**	@brief Set FP12 to unity
+ *
+	@param x FP12 instance to be set to one
+ */
+extern void FP12_one(FP12 *x);
+
+/**	@brief Set FP12 to zero
+ *
+	@param x FP12 instance to be set to zero
+ */
+extern void FP12_zero(FP12 *x);
+
+/**	@brief Tests for equality of two FP12s
+ *
+	@param x FP12 instance to be compared
+	@param y FP12 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP12_equals(FP12 *x, FP12 *y);
+/**	@brief Conjugation of FP12
+ *
+	If y=(a,b,c) (where a,b,c are its three FP4 components) on exit x=(conj(a),-conj(b),conj(c))
+	@param x FP12 instance, on exit = conj(y)
+	@param y FP12 instance
+ */
+extern void FP12_conj(FP12 *x, FP12 *y);
+/**	@brief Initialise FP12 from single FP4
+ *
+	Sets first FP4 component of an FP12, other components set to zero
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP4
+ */
+extern void FP12_from_FP4(FP12 *x, FP4 *a);
+/**	@brief Initialise FP12 from three FP4s
+ *
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP12
+	@param b FP4 to form second part of FP12
+	@param c FP4 to form third part of FP12
+ */
+extern void FP12_from_FP4s(FP12 *x, FP4 *a, FP4* b, FP4 *c);
+/**	@brief Fast Squaring of an FP12 in "unitary" form
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP4 instance, must be unitary
+ */
+extern void FP12_usqr(FP12 *x, FP12 *y);
+/**	@brief Squaring an FP12
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP12 instance
+ */
+extern void FP12_sqr(FP12 *x, FP12 *y);
+/**	@brief Fast multiplication of two sparse FP12s that arises from ATE pairing line functions
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_smul(FP12 *x, FP12 *y);
+
+/**	@brief Fast multiplication of what may be sparse multiplicands
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_ssmul(FP12 *x, FP12 *y);
+
+
+/**	@brief Full unconditional Multiplication of two FP12s
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, the multiplier
+ */
+extern void FP12_mul(FP12 *x, FP12 *y);
+
+/**	@brief Inverting an FP12
+ *
+	@param x FP12 instance, on exit = 1/y
+	@param y FP12 instance
+	@param t D_TYPE or M_TYPE twist
+ */
+extern void FP12_inv(FP12 *x, FP12 *y);
+/**	@brief Raises an FP12 to the power of a BIG
+ *
+	@param r FP12 instance, on exit = y^b
+	@param x FP12 instance
+	@param b BIG number
+ */
+extern void FP12_pow(FP12 *r, FP12 *x, B256_56::BIG b);
+/**	@brief Raises an FP12 instance x to a small integer power, side-channel resistant
+ *
+	@param x FP12 instance, on exit = x^i
+	@param i small integer exponent
+	@param b maximum number of bits in exponent
+ */
+extern void FP12_pinpow(FP12 *x, int i, int b);
+
+/**	@brief Raises an FP12 instance x to a BIG power, compressed to FP4
+ *
+	@param c FP4 instance, on exit = x^(e mod r) as FP4
+	@param x FP12 input
+	@param e BIG exponent
+	@param r BIG group order
+ */
+extern void FP12_compow(FP4 *c, FP12 *x, B256_56::BIG e, B256_56::BIG r);
+
+/**	@brief Calculate x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3], side-channel resistant
+ *
+	@param r FP12 instance, on exit = x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3]
+	@param x FP12 array with 4 FP12s
+	@param b BIG array of 4 exponents
+ */
+extern void FP12_pow4(FP12 *r, FP12 *x, B256_56::BIG *b);
+/**	@brief Raises an FP12 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP12 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP12_frob(FP12 *x, FP2 *f);
+/**	@brief Reduces all components of possibly unreduced FP12 mod Modulus
+ *
+	@param x FP12 instance, on exit reduced mod Modulus
+ */
+extern void FP12_reduce(FP12 *x);
+/**	@brief Normalises the components of an FP12
+ *
+	@param x FP12 instance to be normalised
+ */
+extern void FP12_norm(FP12 *x);
+/**	@brief Formats and outputs an FP12 to the console
+ *
+	@param x FP12 instance to be printed
+ */
+extern void FP12_output(FP12 *x);
+/**	@brief Formats and outputs an FP12 instance to an octet string
+ *
+	Serializes the components of an FP12 to big-endian base 256 form.
+	@param S output octet string
+	@param x FP12 instance to be converted to an octet string
+ */
+extern void FP12_toOctet(octet *S, FP12 *x);
+/**	@brief Creates an FP12 instance from an octet string
+ *
+	De-serializes the components of an FP12 to create an FP12 from big-endian base 256 components.
+	@param x FP12 instance to be created from an octet string
+	@param S input octet string
+
+ */
+extern void FP12_fromOctet(FP12 *x, octet *S);
+/**	@brief Calculate the trace of an FP12
+ *
+	@param t FP4 trace of x, on exit = tr(x)
+	@param x FP12 instance
+
+ */
+extern void FP12_trace(FP4 *t, FP12 *x);
+
+/**	@brief Conditional copy of FP12 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP12 instance, set to y if s!=0
+	@param y another FP12 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP12_cmove(FP12 *x, FP12 *y, int s);
+
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp12_BN462.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp12_BN462.h
new file mode 100644
index 0000000..2fcd719
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp12_BN462.h
@@ -0,0 +1,230 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP12_BN462_H
+#define FP12_BN462_H
+
+#include "fp4_BN462.h"
+
+using namespace core;
+
+namespace BN462 {
+/**
+	@brief FP12 Structure - towered over three FP4
+*/
+
+typedef struct
+{
+    FP4 a; /**< first part of FP12 */
+    FP4 b; /**< second part of FP12 */
+    FP4 c; /**< third part of FP12 */
+    int type;
+} FP12;
+
+extern const B464_60::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B464_60::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+/* FP12 prototypes */
+/**	@brief Tests for FP12 equal to zero
+ *
+	@param x FP12 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP12_iszilch(FP12 *x);
+/**	@brief Tests for FP12 equal to unity
+ *
+	@param x FP12 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP12_isunity(FP12 *x);
+/**	@brief Copy FP12 to another FP12
+ *
+	@param x FP12 instance, on exit = y
+	@param y FP12 instance to be copied
+ */
+extern void FP12_copy(FP12 *x, FP12 *y);
+/**	@brief Set FP12 to unity
+ *
+	@param x FP12 instance to be set to one
+ */
+extern void FP12_one(FP12 *x);
+
+/**	@brief Set FP12 to zero
+ *
+	@param x FP12 instance to be set to zero
+ */
+extern void FP12_zero(FP12 *x);
+
+/**	@brief Tests for equality of two FP12s
+ *
+	@param x FP12 instance to be compared
+	@param y FP12 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP12_equals(FP12 *x, FP12 *y);
+/**	@brief Conjugation of FP12
+ *
+	If y=(a,b,c) (where a,b,c are its three FP4 components) on exit x=(conj(a),-conj(b),conj(c))
+	@param x FP12 instance, on exit = conj(y)
+	@param y FP12 instance
+ */
+extern void FP12_conj(FP12 *x, FP12 *y);
+/**	@brief Initialise FP12 from single FP4
+ *
+	Sets first FP4 component of an FP12, other components set to zero
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP4
+ */
+extern void FP12_from_FP4(FP12 *x, FP4 *a);
+/**	@brief Initialise FP12 from three FP4s
+ *
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP12
+	@param b FP4 to form second part of FP12
+	@param c FP4 to form third part of FP12
+ */
+extern void FP12_from_FP4s(FP12 *x, FP4 *a, FP4* b, FP4 *c);
+/**	@brief Fast Squaring of an FP12 in "unitary" form
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP4 instance, must be unitary
+ */
+extern void FP12_usqr(FP12 *x, FP12 *y);
+/**	@brief Squaring an FP12
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP12 instance
+ */
+extern void FP12_sqr(FP12 *x, FP12 *y);
+/**	@brief Fast multiplication of two sparse FP12s that arises from ATE pairing line functions
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_smul(FP12 *x, FP12 *y);
+
+/**	@brief Fast multiplication of what may be sparse multiplicands
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_ssmul(FP12 *x, FP12 *y);
+
+
+/**	@brief Full unconditional Multiplication of two FP12s
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, the multiplier
+ */
+extern void FP12_mul(FP12 *x, FP12 *y);
+
+/**	@brief Inverting an FP12
+ *
+	@param x FP12 instance, on exit = 1/y
+	@param y FP12 instance
+	@param t D_TYPE or M_TYPE twist
+ */
+extern void FP12_inv(FP12 *x, FP12 *y);
+/**	@brief Raises an FP12 to the power of a BIG
+ *
+	@param r FP12 instance, on exit = y^b
+	@param x FP12 instance
+	@param b BIG number
+ */
+extern void FP12_pow(FP12 *r, FP12 *x, B464_60::BIG b);
+/**	@brief Raises an FP12 instance x to a small integer power, side-channel resistant
+ *
+	@param x FP12 instance, on exit = x^i
+	@param i small integer exponent
+	@param b maximum number of bits in exponent
+ */
+extern void FP12_pinpow(FP12 *x, int i, int b);
+
+/**	@brief Raises an FP12 instance x to a BIG power, compressed to FP4
+ *
+	@param c FP4 instance, on exit = x^(e mod r) as FP4
+	@param x FP12 input
+	@param e BIG exponent
+	@param r BIG group order
+ */
+extern void FP12_compow(FP4 *c, FP12 *x, B464_60::BIG e, B464_60::BIG r);
+
+/**	@brief Calculate x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3], side-channel resistant
+ *
+	@param r FP12 instance, on exit = x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3]
+	@param x FP12 array with 4 FP12s
+	@param b BIG array of 4 exponents
+ */
+extern void FP12_pow4(FP12 *r, FP12 *x, B464_60::BIG *b);
+/**	@brief Raises an FP12 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP12 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP12_frob(FP12 *x, FP2 *f);
+/**	@brief Reduces all components of possibly unreduced FP12 mod Modulus
+ *
+	@param x FP12 instance, on exit reduced mod Modulus
+ */
+extern void FP12_reduce(FP12 *x);
+/**	@brief Normalises the components of an FP12
+ *
+	@param x FP12 instance to be normalised
+ */
+extern void FP12_norm(FP12 *x);
+/**	@brief Formats and outputs an FP12 to the console
+ *
+	@param x FP12 instance to be printed
+ */
+extern void FP12_output(FP12 *x);
+/**	@brief Formats and outputs an FP12 instance to an octet string
+ *
+	Serializes the components of an FP12 to big-endian base 256 form.
+	@param S output octet string
+	@param x FP12 instance to be converted to an octet string
+ */
+extern void FP12_toOctet(octet *S, FP12 *x);
+/**	@brief Creates an FP12 instance from an octet string
+ *
+	De-serializes the components of an FP12 to create an FP12 from big-endian base 256 components.
+	@param x FP12 instance to be created from an octet string
+	@param S input octet string
+
+ */
+extern void FP12_fromOctet(FP12 *x, octet *S);
+/**	@brief Calculate the trace of an FP12
+ *
+	@param t FP4 trace of x, on exit = tr(x)
+	@param x FP12 instance
+
+ */
+extern void FP12_trace(FP4 *t, FP12 *x);
+
+/**	@brief Conditional copy of FP12 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP12 instance, set to y if s!=0
+	@param y another FP12 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP12_cmove(FP12 *x, FP12 *y, int s);
+
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp12_FP256BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp12_FP256BN.h
new file mode 100644
index 0000000..7fb19c8
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp12_FP256BN.h
@@ -0,0 +1,230 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP12_FP256BN_H
+#define FP12_FP256BN_H
+
+#include "fp4_FP256BN.h"
+
+using namespace core;
+
+namespace FP256BN {
+/**
+	@brief FP12 Structure - towered over three FP4
+*/
+
+typedef struct
+{
+    FP4 a; /**< first part of FP12 */
+    FP4 b; /**< second part of FP12 */
+    FP4 c; /**< third part of FP12 */
+    int type;
+} FP12;
+
+extern const B256_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+/* FP12 prototypes */
+/**	@brief Tests for FP12 equal to zero
+ *
+	@param x FP12 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP12_iszilch(FP12 *x);
+/**	@brief Tests for FP12 equal to unity
+ *
+	@param x FP12 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP12_isunity(FP12 *x);
+/**	@brief Copy FP12 to another FP12
+ *
+	@param x FP12 instance, on exit = y
+	@param y FP12 instance to be copied
+ */
+extern void FP12_copy(FP12 *x, FP12 *y);
+/**	@brief Set FP12 to unity
+ *
+	@param x FP12 instance to be set to one
+ */
+extern void FP12_one(FP12 *x);
+
+/**	@brief Set FP12 to zero
+ *
+	@param x FP12 instance to be set to zero
+ */
+extern void FP12_zero(FP12 *x);
+
+/**	@brief Tests for equality of two FP12s
+ *
+	@param x FP12 instance to be compared
+	@param y FP12 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP12_equals(FP12 *x, FP12 *y);
+/**	@brief Conjugation of FP12
+ *
+	If y=(a,b,c) (where a,b,c are its three FP4 components) on exit x=(conj(a),-conj(b),conj(c))
+	@param x FP12 instance, on exit = conj(y)
+	@param y FP12 instance
+ */
+extern void FP12_conj(FP12 *x, FP12 *y);
+/**	@brief Initialise FP12 from single FP4
+ *
+	Sets first FP4 component of an FP12, other components set to zero
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP4
+ */
+extern void FP12_from_FP4(FP12 *x, FP4 *a);
+/**	@brief Initialise FP12 from three FP4s
+ *
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP12
+	@param b FP4 to form second part of FP12
+	@param c FP4 to form third part of FP12
+ */
+extern void FP12_from_FP4s(FP12 *x, FP4 *a, FP4* b, FP4 *c);
+/**	@brief Fast Squaring of an FP12 in "unitary" form
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP4 instance, must be unitary
+ */
+extern void FP12_usqr(FP12 *x, FP12 *y);
+/**	@brief Squaring an FP12
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP12 instance
+ */
+extern void FP12_sqr(FP12 *x, FP12 *y);
+/**	@brief Fast multiplication of two sparse FP12s that arises from ATE pairing line functions
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_smul(FP12 *x, FP12 *y);
+
+/**	@brief Fast multiplication of what may be sparse multiplicands
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_ssmul(FP12 *x, FP12 *y);
+
+
+/**	@brief Full unconditional Multiplication of two FP12s
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, the multiplier
+ */
+extern void FP12_mul(FP12 *x, FP12 *y);
+
+/**	@brief Inverting an FP12
+ *
+	@param x FP12 instance, on exit = 1/y
+	@param y FP12 instance
+	@param t D_TYPE or M_TYPE twist
+ */
+extern void FP12_inv(FP12 *x, FP12 *y);
+/**	@brief Raises an FP12 to the power of a BIG
+ *
+	@param r FP12 instance, on exit = y^b
+	@param x FP12 instance
+	@param b BIG number
+ */
+extern void FP12_pow(FP12 *r, FP12 *x, B256_56::BIG b);
+/**	@brief Raises an FP12 instance x to a small integer power, side-channel resistant
+ *
+	@param x FP12 instance, on exit = x^i
+	@param i small integer exponent
+	@param b maximum number of bits in exponent
+ */
+extern void FP12_pinpow(FP12 *x, int i, int b);
+
+/**	@brief Raises an FP12 instance x to a BIG power, compressed to FP4
+ *
+	@param c FP4 instance, on exit = x^(e mod r) as FP4
+	@param x FP12 input
+	@param e BIG exponent
+	@param r BIG group order
+ */
+extern void FP12_compow(FP4 *c, FP12 *x, B256_56::BIG e, B256_56::BIG r);
+
+/**	@brief Calculate x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3], side-channel resistant
+ *
+	@param r FP12 instance, on exit = x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3]
+	@param x FP12 array with 4 FP12s
+	@param b BIG array of 4 exponents
+ */
+extern void FP12_pow4(FP12 *r, FP12 *x, B256_56::BIG *b);
+/**	@brief Raises an FP12 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP12 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP12_frob(FP12 *x, FP2 *f);
+/**	@brief Reduces all components of possibly unreduced FP12 mod Modulus
+ *
+	@param x FP12 instance, on exit reduced mod Modulus
+ */
+extern void FP12_reduce(FP12 *x);
+/**	@brief Normalises the components of an FP12
+ *
+	@param x FP12 instance to be normalised
+ */
+extern void FP12_norm(FP12 *x);
+/**	@brief Formats and outputs an FP12 to the console
+ *
+	@param x FP12 instance to be printed
+ */
+extern void FP12_output(FP12 *x);
+/**	@brief Formats and outputs an FP12 instance to an octet string
+ *
+	Serializes the components of an FP12 to big-endian base 256 form.
+	@param S output octet string
+	@param x FP12 instance to be converted to an octet string
+ */
+extern void FP12_toOctet(octet *S, FP12 *x);
+/**	@brief Creates an FP12 instance from an octet string
+ *
+	De-serializes the components of an FP12 to create an FP12 from big-endian base 256 components.
+	@param x FP12 instance to be created from an octet string
+	@param S input octet string
+
+ */
+extern void FP12_fromOctet(FP12 *x, octet *S);
+/**	@brief Calculate the trace of an FP12
+ *
+	@param t FP4 trace of x, on exit = tr(x)
+	@param x FP12 instance
+
+ */
+extern void FP12_trace(FP4 *t, FP12 *x);
+
+/**	@brief Conditional copy of FP12 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP12 instance, set to y if s!=0
+	@param y another FP12 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP12_cmove(FP12 *x, FP12 *y, int s);
+
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp12_FP512BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp12_FP512BN.h
new file mode 100644
index 0000000..2fc1921
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp12_FP512BN.h
@@ -0,0 +1,230 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP12_FP512BN_H
+#define FP12_FP512BN_H
+
+#include "fp4_FP512BN.h"
+
+using namespace core;
+
+namespace FP512BN {
+/**
+	@brief FP12 Structure - towered over three FP4
+*/
+
+typedef struct
+{
+    FP4 a; /**< first part of FP12 */
+    FP4 b; /**< second part of FP12 */
+    FP4 c; /**< third part of FP12 */
+    int type;
+} FP12;
+
+extern const B512_60::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B512_60::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+/* FP12 prototypes */
+/**	@brief Tests for FP12 equal to zero
+ *
+	@param x FP12 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP12_iszilch(FP12 *x);
+/**	@brief Tests for FP12 equal to unity
+ *
+	@param x FP12 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP12_isunity(FP12 *x);
+/**	@brief Copy FP12 to another FP12
+ *
+	@param x FP12 instance, on exit = y
+	@param y FP12 instance to be copied
+ */
+extern void FP12_copy(FP12 *x, FP12 *y);
+/**	@brief Set FP12 to unity
+ *
+	@param x FP12 instance to be set to one
+ */
+extern void FP12_one(FP12 *x);
+
+/**	@brief Set FP12 to zero
+ *
+	@param x FP12 instance to be set to zero
+ */
+extern void FP12_zero(FP12 *x);
+
+/**	@brief Tests for equality of two FP12s
+ *
+	@param x FP12 instance to be compared
+	@param y FP12 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP12_equals(FP12 *x, FP12 *y);
+/**	@brief Conjugation of FP12
+ *
+	If y=(a,b,c) (where a,b,c are its three FP4 components) on exit x=(conj(a),-conj(b),conj(c))
+	@param x FP12 instance, on exit = conj(y)
+	@param y FP12 instance
+ */
+extern void FP12_conj(FP12 *x, FP12 *y);
+/**	@brief Initialise FP12 from single FP4
+ *
+	Sets first FP4 component of an FP12, other components set to zero
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP4
+ */
+extern void FP12_from_FP4(FP12 *x, FP4 *a);
+/**	@brief Initialise FP12 from three FP4s
+ *
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP12
+	@param b FP4 to form second part of FP12
+	@param c FP4 to form third part of FP12
+ */
+extern void FP12_from_FP4s(FP12 *x, FP4 *a, FP4* b, FP4 *c);
+/**	@brief Fast Squaring of an FP12 in "unitary" form
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP4 instance, must be unitary
+ */
+extern void FP12_usqr(FP12 *x, FP12 *y);
+/**	@brief Squaring an FP12
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP12 instance
+ */
+extern void FP12_sqr(FP12 *x, FP12 *y);
+/**	@brief Fast multiplication of two sparse FP12s that arises from ATE pairing line functions
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_smul(FP12 *x, FP12 *y);
+
+/**	@brief Fast multiplication of what may be sparse multiplicands
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_ssmul(FP12 *x, FP12 *y);
+
+
+/**	@brief Full unconditional Multiplication of two FP12s
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, the multiplier
+ */
+extern void FP12_mul(FP12 *x, FP12 *y);
+
+/**	@brief Inverting an FP12
+ *
+	@param x FP12 instance, on exit = 1/y
+	@param y FP12 instance
+	@param t D_TYPE or M_TYPE twist
+ */
+extern void FP12_inv(FP12 *x, FP12 *y);
+/**	@brief Raises an FP12 to the power of a BIG
+ *
+	@param r FP12 instance, on exit = y^b
+	@param x FP12 instance
+	@param b BIG number
+ */
+extern void FP12_pow(FP12 *r, FP12 *x, B512_60::BIG b);
+/**	@brief Raises an FP12 instance x to a small integer power, side-channel resistant
+ *
+	@param x FP12 instance, on exit = x^i
+	@param i small integer exponent
+	@param b maximum number of bits in exponent
+ */
+extern void FP12_pinpow(FP12 *x, int i, int b);
+
+/**	@brief Raises an FP12 instance x to a BIG power, compressed to FP4
+ *
+	@param c FP4 instance, on exit = x^(e mod r) as FP4
+	@param x FP12 input
+	@param e BIG exponent
+	@param r BIG group order
+ */
+extern void FP12_compow(FP4 *c, FP12 *x, B512_60::BIG e, B512_60::BIG r);
+
+/**	@brief Calculate x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3], side-channel resistant
+ *
+	@param r FP12 instance, on exit = x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3]
+	@param x FP12 array with 4 FP12s
+	@param b BIG array of 4 exponents
+ */
+extern void FP12_pow4(FP12 *r, FP12 *x, B512_60::BIG *b);
+/**	@brief Raises an FP12 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP12 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP12_frob(FP12 *x, FP2 *f);
+/**	@brief Reduces all components of possibly unreduced FP12 mod Modulus
+ *
+	@param x FP12 instance, on exit reduced mod Modulus
+ */
+extern void FP12_reduce(FP12 *x);
+/**	@brief Normalises the components of an FP12
+ *
+	@param x FP12 instance to be normalised
+ */
+extern void FP12_norm(FP12 *x);
+/**	@brief Formats and outputs an FP12 to the console
+ *
+	@param x FP12 instance to be printed
+ */
+extern void FP12_output(FP12 *x);
+/**	@brief Formats and outputs an FP12 instance to an octet string
+ *
+	Serializes the components of an FP12 to big-endian base 256 form.
+	@param S output octet string
+	@param x FP12 instance to be converted to an octet string
+ */
+extern void FP12_toOctet(octet *S, FP12 *x);
+/**	@brief Creates an FP12 instance from an octet string
+ *
+	De-serializes the components of an FP12 to create an FP12 from big-endian base 256 components.
+	@param x FP12 instance to be created from an octet string
+	@param S input octet string
+
+ */
+extern void FP12_fromOctet(FP12 *x, octet *S);
+/**	@brief Calculate the trace of an FP12
+ *
+	@param t FP4 trace of x, on exit = tr(x)
+	@param x FP12 instance
+
+ */
+extern void FP12_trace(FP4 *t, FP12 *x);
+
+/**	@brief Conditional copy of FP12 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP12 instance, set to y if s!=0
+	@param y another FP12 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP12_cmove(FP12 *x, FP12 *y, int s);
+
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp16.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp16.h
new file mode 100644
index 0000000..348ac92
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp16.h
@@ -0,0 +1,308 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP16_YYY_H
+#define FP16_YYY_H
+
+#include "fp8_YYY.h"
+#include "config_curve_ZZZ.h"
+
+using namespace core;
+
+namespace YYY {
+
+/**
+	@brief FP16 Structure - towered over two FP4
+*/
+
+typedef struct
+{
+    FP8 a; /**< real part of FP16 */
+    FP8 b; /**< imaginary part of FP16 */
+} FP16;
+
+
+/* FP16 prototypes */
+/**	@brief Tests for FP16 equal to zero
+ *
+	@param x FP16 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP16_iszilch(FP16 *x);
+/**	@brief Tests for FP16 equal to unity
+ *
+	@param x FP16 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP16_isunity(FP16 *x);
+/**	@brief Tests for equality of two FP16s
+ *
+	@param x FP16 instance to be compared
+	@param y FP16 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP16_equals(FP16 *x, FP16 *y);
+
+/**	@brief Serialize in FP16  
+ *
+    @param b buffer for output
+	@param x FP16 number to be serialized
+ */
+extern void FP16_toBytes(char *b,FP16 *x);
+/**	@brief Serialize out FP16  
+ *
+	@param x FP16 number to be serialized
+    @param b buffer for input
+ */
+extern void FP16_fromBytes(FP16 *x,char *b);
+
+/**	@brief Tests for FP16 having only a real part and no imaginary part
+ *
+	@param x FP16 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP16_isreal(FP16 *x);
+/**	@brief Initialise FP16 from two FP8s
+ *
+	@param x FP16 instance to be initialised
+	@param a FP8 to form real part of FP16
+	@param b FP8 to form imaginary part of FP16
+ */
+extern void FP16_from_FP8s(FP16 *x, FP8 *a, FP8 *b);
+/**	@brief Initialise FP16 from single FP8
+ *
+	Imaginary part is set to zero
+	@param x FP16 instance to be initialised
+	@param a FP8 to form real part of FP16
+ */
+extern void FP16_from_FP8(FP16 *x, FP8 *a);
+
+/**	@brief Initialise FP16 from single FP8
+ *
+	real part is set to zero
+	@param x FP16 instance to be initialised
+	@param a FP8 to form imaginary part of FP16
+ */
+extern void FP16_from_FP8H(FP16 *x, FP8 *a);
+
+
+/**	@brief Copy FP16 to another FP16
+ *
+	@param x FP16 instance, on exit = y
+	@param y FP16 instance to be copied
+ */
+extern void FP16_copy(FP16 *x, FP16 *y);
+/**	@brief Set FP16 to zero
+ *
+	@param x FP16 instance to be set to zero
+ */
+extern void FP16_zero(FP16 *x);
+/**	@brief Set FP16 to unity
+ *
+	@param x FP16 instance to be set to one
+ */
+extern void FP16_one(FP16 *x);
+/**	@brief Negation of FP16
+ *
+	@param x FP16 instance, on exit = -y
+	@param y FP16 instance
+ */
+extern void FP16_neg(FP16 *x, FP16 *y);
+/**	@brief Conjugation of FP16
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP16 instance, on exit = conj(y)
+	@param y FP16 instance
+ */
+extern void FP16_conj(FP16 *x, FP16 *y);
+/**	@brief Negative conjugation of FP16
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP16 instance, on exit = -conj(y)
+	@param y FP16 instance
+ */
+extern void FP16_nconj(FP16 *x, FP16 *y);
+/**	@brief addition of two FP16s
+ *
+	@param x FP16 instance, on exit = y+z
+	@param y FP16 instance
+	@param z FP16 instance
+ */
+extern void FP16_add(FP16 *x, FP16 *y, FP16 *z);
+/**	@brief subtraction of two FP16s
+ *
+	@param x FP16 instance, on exit = y-z
+	@param y FP16 instance
+	@param z FP16 instance
+ */
+extern void FP16_sub(FP16 *x, FP16 *y, FP16 *z);
+/**	@brief Multiplication of an FP16 by an FP8
+ *
+	@param x FP16 instance, on exit = y*a
+	@param y FP16 instance
+	@param a FP4 multiplier
+ */
+extern void FP16_pmul(FP16 *x, FP16 *y, FP8 *a);
+
+/**	@brief Multiplication of an FP16 by an FP2
+ *
+	@param x FP16 instance, on exit = y*a
+	@param y FP16 instance
+	@param a FP2 multiplier
+ */
+extern void FP16_qmul(FP16 *x, FP16 *y, FP2 *a);
+
+
+/**	@brief Multiplication of an FP16 by an FP
+ *
+	@param x FP16 instance, on exit = y*a
+	@param y FP16 instance
+	@param a FP multiplier
+ */
+extern void FP16_tmul(FP16 *x, FP16 *y, FP *a);
+
+
+
+/**	@brief Multiplication of an FP16 by a small integer
+ *
+	@param x FP16 instance, on exit = y*i
+	@param y FP16 instance
+	@param i an integer
+ */
+extern void FP16_imul(FP16 *x, FP16 *y, int i);
+/**	@brief Squaring an FP16
+ *
+	@param x FP16 instance, on exit = y^2
+	@param y FP16 instance
+ */
+extern void FP16_sqr(FP16 *x, FP16 *y);
+/**	@brief Multiplication of two FP16s
+ *
+	@param x FP16 instance, on exit = y*z
+	@param y FP16 instance
+	@param z FP16 instance
+ */
+extern void FP16_mul(FP16 *x, FP16 *y, FP16 *z);
+/**	@brief Inverting an FP16
+ *
+	@param x FP16 instance, on exit = 1/y
+	@param y FP16 instance
+ */
+extern void FP16_inv(FP16 *x, FP16 *y);
+/**	@brief Formats and outputs an FP16 to the console
+ *
+	@param x FP16 instance to be printed
+ */
+extern void FP16_output(FP16 *x);
+/**	@brief Formats and outputs an FP16 to the console in raw form (for debugging)
+ *
+	@param x FP16 instance to be printed
+ */
+extern void FP16_rawoutput(FP16 *x);
+/**	@brief multiplies an FP16 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP16 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP16_times_i(FP16 *x);
+/**	@brief multiplies an FP16 instance by irreducible polynomial (1+sqrt(-1))
+ *
+	@param x FP16 instance, on exit = sqrt(1+sqrt(-1))^2*x
+ */
+extern void FP16_times_i2(FP16 *x);
+
+/**	@brief multiplies an FP16 instance by irreducible polynomial (1+sqrt(-1))
+ *
+	@param x FP16 instance, on exit = sqrt(1+sqrt(-1))^4*x
+ */
+extern void FP16_times_i4(FP16 *x);
+
+
+/**	@brief Normalises the components of an FP16
+ *
+	@param x FP16 instance to be normalised
+ */
+extern void FP16_norm(FP16 *x);
+/**	@brief Reduces all components of possibly unreduced FP16 mod Modulus
+ *
+	@param x FP16 instance, on exit reduced mod Modulus
+ */
+extern void FP16_reduce(FP16 *x);
+/**	@brief Raises an FP16 to the power of a BIG
+ *
+	@param x FP16 instance, on exit = y^b
+	@param y FP16 instance
+	@param b BIG number
+ */
+extern void FP16_pow(FP16 *x, FP16 *y, XXX::BIG b);
+/**	@brief Raises an FP16 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP16 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP16_frob(FP16 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP16 instance, on exit = w*x-conj(x)*y+z
+	@param w FP16 instance
+	@param x FP16 instance
+	@param y FP16 instance
+	@param z FP16 instance
+ */
+extern void FP16_xtr_A(FP16 *r, FP16 *w, FP16 *x, FP16 *y, FP16 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP16 instance, on exit = x^2-2*conj(x)
+	@param x FP16 instance
+ */
+extern void FP16_xtr_D(FP16 *r, FP16 *x);
+/**	@brief Calculates FP16 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP16 instance, on exit = trace(w^b)
+	@param x FP16 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP16_xtr_pow(FP16 *r, FP16 *x, XXX::BIG b);
+/**	@brief Calculates FP16 trace of c^a.d^b, where c and d are derived from FP16 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP16 instance, on exit = trace(c^a.d^b)
+	@param c FP16 instance, trace of an FP12
+	@param d FP16 instance, trace of an FP12
+	@param e FP16 instance, trace of an FP12
+	@param f FP16 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP16_xtr_pow2(FP16 *r, FP16 *c, FP16 *d, FP16 *e, FP16 *f, XXX::BIG a, XXX::BIG b);
+
+/**	@brief Conditional copy of FP16 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP16 instance, set to y if s!=0
+	@param y another FP16 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP16_cmove(FP16 *x, FP16 *y, int s);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp16_BLS48286.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp16_BLS48286.h
new file mode 100644
index 0000000..13fcccb
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp16_BLS48286.h
@@ -0,0 +1,308 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP16_BLS48286_H
+#define FP16_BLS48286_H
+
+#include "fp8_BLS48286.h"
+#include "config_curve_BLS48286.h"
+
+using namespace core;
+
+namespace BLS48286 {
+
+/**
+	@brief FP16 Structure - towered over two FP4
+*/
+
+typedef struct
+{
+    FP8 a; /**< real part of FP16 */
+    FP8 b; /**< imaginary part of FP16 */
+} FP16;
+
+
+/* FP16 prototypes */
+/**	@brief Tests for FP16 equal to zero
+ *
+	@param x FP16 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP16_iszilch(FP16 *x);
+/**	@brief Tests for FP16 equal to unity
+ *
+	@param x FP16 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP16_isunity(FP16 *x);
+/**	@brief Tests for equality of two FP16s
+ *
+	@param x FP16 instance to be compared
+	@param y FP16 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP16_equals(FP16 *x, FP16 *y);
+
+/**	@brief Serialize in FP16  
+ *
+    @param b buffer for output
+	@param x FP16 number to be serialized
+ */
+extern void FP16_toBytes(char *b,FP16 *x);
+/**	@brief Serialize out FP16  
+ *
+	@param x FP16 number to be serialized
+    @param b buffer for input
+ */
+extern void FP16_fromBytes(FP16 *x,char *b);
+
+/**	@brief Tests for FP16 having only a real part and no imaginary part
+ *
+	@param x FP16 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP16_isreal(FP16 *x);
+/**	@brief Initialise FP16 from two FP8s
+ *
+	@param x FP16 instance to be initialised
+	@param a FP8 to form real part of FP16
+	@param b FP8 to form imaginary part of FP16
+ */
+extern void FP16_from_FP8s(FP16 *x, FP8 *a, FP8 *b);
+/**	@brief Initialise FP16 from single FP8
+ *
+	Imaginary part is set to zero
+	@param x FP16 instance to be initialised
+	@param a FP8 to form real part of FP16
+ */
+extern void FP16_from_FP8(FP16 *x, FP8 *a);
+
+/**	@brief Initialise FP16 from single FP8
+ *
+	real part is set to zero
+	@param x FP16 instance to be initialised
+	@param a FP8 to form imaginary part of FP16
+ */
+extern void FP16_from_FP8H(FP16 *x, FP8 *a);
+
+
+/**	@brief Copy FP16 to another FP16
+ *
+	@param x FP16 instance, on exit = y
+	@param y FP16 instance to be copied
+ */
+extern void FP16_copy(FP16 *x, FP16 *y);
+/**	@brief Set FP16 to zero
+ *
+	@param x FP16 instance to be set to zero
+ */
+extern void FP16_zero(FP16 *x);
+/**	@brief Set FP16 to unity
+ *
+	@param x FP16 instance to be set to one
+ */
+extern void FP16_one(FP16 *x);
+/**	@brief Negation of FP16
+ *
+	@param x FP16 instance, on exit = -y
+	@param y FP16 instance
+ */
+extern void FP16_neg(FP16 *x, FP16 *y);
+/**	@brief Conjugation of FP16
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP16 instance, on exit = conj(y)
+	@param y FP16 instance
+ */
+extern void FP16_conj(FP16 *x, FP16 *y);
+/**	@brief Negative conjugation of FP16
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP16 instance, on exit = -conj(y)
+	@param y FP16 instance
+ */
+extern void FP16_nconj(FP16 *x, FP16 *y);
+/**	@brief addition of two FP16s
+ *
+	@param x FP16 instance, on exit = y+z
+	@param y FP16 instance
+	@param z FP16 instance
+ */
+extern void FP16_add(FP16 *x, FP16 *y, FP16 *z);
+/**	@brief subtraction of two FP16s
+ *
+	@param x FP16 instance, on exit = y-z
+	@param y FP16 instance
+	@param z FP16 instance
+ */
+extern void FP16_sub(FP16 *x, FP16 *y, FP16 *z);
+/**	@brief Multiplication of an FP16 by an FP8
+ *
+	@param x FP16 instance, on exit = y*a
+	@param y FP16 instance
+	@param a FP4 multiplier
+ */
+extern void FP16_pmul(FP16 *x, FP16 *y, FP8 *a);
+
+/**	@brief Multiplication of an FP16 by an FP2
+ *
+	@param x FP16 instance, on exit = y*a
+	@param y FP16 instance
+	@param a FP2 multiplier
+ */
+extern void FP16_qmul(FP16 *x, FP16 *y, FP2 *a);
+
+
+/**	@brief Multiplication of an FP16 by an FP
+ *
+	@param x FP16 instance, on exit = y*a
+	@param y FP16 instance
+	@param a FP multiplier
+ */
+extern void FP16_tmul(FP16 *x, FP16 *y, FP *a);
+
+
+
+/**	@brief Multiplication of an FP16 by a small integer
+ *
+	@param x FP16 instance, on exit = y*i
+	@param y FP16 instance
+	@param i an integer
+ */
+extern void FP16_imul(FP16 *x, FP16 *y, int i);
+/**	@brief Squaring an FP16
+ *
+	@param x FP16 instance, on exit = y^2
+	@param y FP16 instance
+ */
+extern void FP16_sqr(FP16 *x, FP16 *y);
+/**	@brief Multiplication of two FP16s
+ *
+	@param x FP16 instance, on exit = y*z
+	@param y FP16 instance
+	@param z FP16 instance
+ */
+extern void FP16_mul(FP16 *x, FP16 *y, FP16 *z);
+/**	@brief Inverting an FP16
+ *
+	@param x FP16 instance, on exit = 1/y
+	@param y FP16 instance
+ */
+extern void FP16_inv(FP16 *x, FP16 *y);
+/**	@brief Formats and outputs an FP16 to the console
+ *
+	@param x FP16 instance to be printed
+ */
+extern void FP16_output(FP16 *x);
+/**	@brief Formats and outputs an FP16 to the console in raw form (for debugging)
+ *
+	@param x FP16 instance to be printed
+ */
+extern void FP16_rawoutput(FP16 *x);
+/**	@brief multiplies an FP16 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP16 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP16_times_i(FP16 *x);
+/**	@brief multiplies an FP16 instance by irreducible polynomial (1+sqrt(-1))
+ *
+	@param x FP16 instance, on exit = sqrt(1+sqrt(-1))^2*x
+ */
+extern void FP16_times_i2(FP16 *x);
+
+/**	@brief multiplies an FP16 instance by irreducible polynomial (1+sqrt(-1))
+ *
+	@param x FP16 instance, on exit = sqrt(1+sqrt(-1))^4*x
+ */
+extern void FP16_times_i4(FP16 *x);
+
+
+/**	@brief Normalises the components of an FP16
+ *
+	@param x FP16 instance to be normalised
+ */
+extern void FP16_norm(FP16 *x);
+/**	@brief Reduces all components of possibly unreduced FP16 mod Modulus
+ *
+	@param x FP16 instance, on exit reduced mod Modulus
+ */
+extern void FP16_reduce(FP16 *x);
+/**	@brief Raises an FP16 to the power of a BIG
+ *
+	@param x FP16 instance, on exit = y^b
+	@param y FP16 instance
+	@param b BIG number
+ */
+extern void FP16_pow(FP16 *x, FP16 *y, B288_60::BIG b);
+/**	@brief Raises an FP16 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP16 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP16_frob(FP16 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP16 instance, on exit = w*x-conj(x)*y+z
+	@param w FP16 instance
+	@param x FP16 instance
+	@param y FP16 instance
+	@param z FP16 instance
+ */
+extern void FP16_xtr_A(FP16 *r, FP16 *w, FP16 *x, FP16 *y, FP16 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP16 instance, on exit = x^2-2*conj(x)
+	@param x FP16 instance
+ */
+extern void FP16_xtr_D(FP16 *r, FP16 *x);
+/**	@brief Calculates FP16 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP16 instance, on exit = trace(w^b)
+	@param x FP16 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP16_xtr_pow(FP16 *r, FP16 *x, B288_60::BIG b);
+/**	@brief Calculates FP16 trace of c^a.d^b, where c and d are derived from FP16 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP16 instance, on exit = trace(c^a.d^b)
+	@param c FP16 instance, trace of an FP12
+	@param d FP16 instance, trace of an FP12
+	@param e FP16 instance, trace of an FP12
+	@param f FP16 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP16_xtr_pow2(FP16 *r, FP16 *c, FP16 *d, FP16 *e, FP16 *f, B288_60::BIG a, B288_60::BIG b);
+
+/**	@brief Conditional copy of FP16 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP16 instance, set to y if s!=0
+	@param y another FP16 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP16_cmove(FP16 *x, FP16 *y, int s);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp16_BLS48556.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp16_BLS48556.h
new file mode 100644
index 0000000..7fde212
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp16_BLS48556.h
@@ -0,0 +1,308 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP16_BLS48556_H
+#define FP16_BLS48556_H
+
+#include "fp8_BLS48556.h"
+#include "config_curve_BLS48556.h"
+
+using namespace core;
+
+namespace BLS48556 {
+
+/**
+	@brief FP16 Structure - towered over two FP4
+*/
+
+typedef struct
+{
+    FP8 a; /**< real part of FP16 */
+    FP8 b; /**< imaginary part of FP16 */
+} FP16;
+
+
+/* FP16 prototypes */
+/**	@brief Tests for FP16 equal to zero
+ *
+	@param x FP16 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP16_iszilch(FP16 *x);
+/**	@brief Tests for FP16 equal to unity
+ *
+	@param x FP16 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP16_isunity(FP16 *x);
+/**	@brief Tests for equality of two FP16s
+ *
+	@param x FP16 instance to be compared
+	@param y FP16 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP16_equals(FP16 *x, FP16 *y);
+
+/**	@brief Serialize in FP16  
+ *
+    @param b buffer for output
+	@param x FP16 number to be serialized
+ */
+extern void FP16_toBytes(char *b,FP16 *x);
+/**	@brief Serialize out FP16  
+ *
+	@param x FP16 number to be serialized
+    @param b buffer for input
+ */
+extern void FP16_fromBytes(FP16 *x,char *b);
+
+/**	@brief Tests for FP16 having only a real part and no imaginary part
+ *
+	@param x FP16 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP16_isreal(FP16 *x);
+/**	@brief Initialise FP16 from two FP8s
+ *
+	@param x FP16 instance to be initialised
+	@param a FP8 to form real part of FP16
+	@param b FP8 to form imaginary part of FP16
+ */
+extern void FP16_from_FP8s(FP16 *x, FP8 *a, FP8 *b);
+/**	@brief Initialise FP16 from single FP8
+ *
+	Imaginary part is set to zero
+	@param x FP16 instance to be initialised
+	@param a FP8 to form real part of FP16
+ */
+extern void FP16_from_FP8(FP16 *x, FP8 *a);
+
+/**	@brief Initialise FP16 from single FP8
+ *
+	real part is set to zero
+	@param x FP16 instance to be initialised
+	@param a FP8 to form imaginary part of FP16
+ */
+extern void FP16_from_FP8H(FP16 *x, FP8 *a);
+
+
+/**	@brief Copy FP16 to another FP16
+ *
+	@param x FP16 instance, on exit = y
+	@param y FP16 instance to be copied
+ */
+extern void FP16_copy(FP16 *x, FP16 *y);
+/**	@brief Set FP16 to zero
+ *
+	@param x FP16 instance to be set to zero
+ */
+extern void FP16_zero(FP16 *x);
+/**	@brief Set FP16 to unity
+ *
+	@param x FP16 instance to be set to one
+ */
+extern void FP16_one(FP16 *x);
+/**	@brief Negation of FP16
+ *
+	@param x FP16 instance, on exit = -y
+	@param y FP16 instance
+ */
+extern void FP16_neg(FP16 *x, FP16 *y);
+/**	@brief Conjugation of FP16
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP16 instance, on exit = conj(y)
+	@param y FP16 instance
+ */
+extern void FP16_conj(FP16 *x, FP16 *y);
+/**	@brief Negative conjugation of FP16
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP16 instance, on exit = -conj(y)
+	@param y FP16 instance
+ */
+extern void FP16_nconj(FP16 *x, FP16 *y);
+/**	@brief addition of two FP16s
+ *
+	@param x FP16 instance, on exit = y+z
+	@param y FP16 instance
+	@param z FP16 instance
+ */
+extern void FP16_add(FP16 *x, FP16 *y, FP16 *z);
+/**	@brief subtraction of two FP16s
+ *
+	@param x FP16 instance, on exit = y-z
+	@param y FP16 instance
+	@param z FP16 instance
+ */
+extern void FP16_sub(FP16 *x, FP16 *y, FP16 *z);
+/**	@brief Multiplication of an FP16 by an FP8
+ *
+	@param x FP16 instance, on exit = y*a
+	@param y FP16 instance
+	@param a FP4 multiplier
+ */
+extern void FP16_pmul(FP16 *x, FP16 *y, FP8 *a);
+
+/**	@brief Multiplication of an FP16 by an FP2
+ *
+	@param x FP16 instance, on exit = y*a
+	@param y FP16 instance
+	@param a FP2 multiplier
+ */
+extern void FP16_qmul(FP16 *x, FP16 *y, FP2 *a);
+
+
+/**	@brief Multiplication of an FP16 by an FP
+ *
+	@param x FP16 instance, on exit = y*a
+	@param y FP16 instance
+	@param a FP multiplier
+ */
+extern void FP16_tmul(FP16 *x, FP16 *y, FP *a);
+
+
+
+/**	@brief Multiplication of an FP16 by a small integer
+ *
+	@param x FP16 instance, on exit = y*i
+	@param y FP16 instance
+	@param i an integer
+ */
+extern void FP16_imul(FP16 *x, FP16 *y, int i);
+/**	@brief Squaring an FP16
+ *
+	@param x FP16 instance, on exit = y^2
+	@param y FP16 instance
+ */
+extern void FP16_sqr(FP16 *x, FP16 *y);
+/**	@brief Multiplication of two FP16s
+ *
+	@param x FP16 instance, on exit = y*z
+	@param y FP16 instance
+	@param z FP16 instance
+ */
+extern void FP16_mul(FP16 *x, FP16 *y, FP16 *z);
+/**	@brief Inverting an FP16
+ *
+	@param x FP16 instance, on exit = 1/y
+	@param y FP16 instance
+ */
+extern void FP16_inv(FP16 *x, FP16 *y);
+/**	@brief Formats and outputs an FP16 to the console
+ *
+	@param x FP16 instance to be printed
+ */
+extern void FP16_output(FP16 *x);
+/**	@brief Formats and outputs an FP16 to the console in raw form (for debugging)
+ *
+	@param x FP16 instance to be printed
+ */
+extern void FP16_rawoutput(FP16 *x);
+/**	@brief multiplies an FP16 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP16 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP16_times_i(FP16 *x);
+/**	@brief multiplies an FP16 instance by irreducible polynomial (1+sqrt(-1))
+ *
+	@param x FP16 instance, on exit = sqrt(1+sqrt(-1))^2*x
+ */
+extern void FP16_times_i2(FP16 *x);
+
+/**	@brief multiplies an FP16 instance by irreducible polynomial (1+sqrt(-1))
+ *
+	@param x FP16 instance, on exit = sqrt(1+sqrt(-1))^4*x
+ */
+extern void FP16_times_i4(FP16 *x);
+
+
+/**	@brief Normalises the components of an FP16
+ *
+	@param x FP16 instance to be normalised
+ */
+extern void FP16_norm(FP16 *x);
+/**	@brief Reduces all components of possibly unreduced FP16 mod Modulus
+ *
+	@param x FP16 instance, on exit reduced mod Modulus
+ */
+extern void FP16_reduce(FP16 *x);
+/**	@brief Raises an FP16 to the power of a BIG
+ *
+	@param x FP16 instance, on exit = y^b
+	@param y FP16 instance
+	@param b BIG number
+ */
+extern void FP16_pow(FP16 *x, FP16 *y, B560_58::BIG b);
+/**	@brief Raises an FP16 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP16 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP16_frob(FP16 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP16 instance, on exit = w*x-conj(x)*y+z
+	@param w FP16 instance
+	@param x FP16 instance
+	@param y FP16 instance
+	@param z FP16 instance
+ */
+extern void FP16_xtr_A(FP16 *r, FP16 *w, FP16 *x, FP16 *y, FP16 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP16 instance, on exit = x^2-2*conj(x)
+	@param x FP16 instance
+ */
+extern void FP16_xtr_D(FP16 *r, FP16 *x);
+/**	@brief Calculates FP16 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP16 instance, on exit = trace(w^b)
+	@param x FP16 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP16_xtr_pow(FP16 *r, FP16 *x, B560_58::BIG b);
+/**	@brief Calculates FP16 trace of c^a.d^b, where c and d are derived from FP16 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP16 instance, on exit = trace(c^a.d^b)
+	@param c FP16 instance, trace of an FP12
+	@param d FP16 instance, trace of an FP12
+	@param e FP16 instance, trace of an FP12
+	@param f FP16 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP16_xtr_pow2(FP16 *r, FP16 *c, FP16 *d, FP16 *e, FP16 *f, B560_58::BIG a, B560_58::BIG b);
+
+/**	@brief Conditional copy of FP16 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP16 instance, set to y if s!=0
+	@param y another FP16 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP16_cmove(FP16 *x, FP16 *y, int s);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp16_BLS48581.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp16_BLS48581.h
new file mode 100644
index 0000000..dbad664
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp16_BLS48581.h
@@ -0,0 +1,308 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP16_BLS48581_H
+#define FP16_BLS48581_H
+
+#include "fp8_BLS48581.h"
+#include "config_curve_BLS48581.h"
+
+using namespace core;
+
+namespace BLS48581 {
+
+/**
+	@brief FP16 Structure - towered over two FP4
+*/
+
+typedef struct
+{
+    FP8 a; /**< real part of FP16 */
+    FP8 b; /**< imaginary part of FP16 */
+} FP16;
+
+
+/* FP16 prototypes */
+/**	@brief Tests for FP16 equal to zero
+ *
+	@param x FP16 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP16_iszilch(FP16 *x);
+/**	@brief Tests for FP16 equal to unity
+ *
+	@param x FP16 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP16_isunity(FP16 *x);
+/**	@brief Tests for equality of two FP16s
+ *
+	@param x FP16 instance to be compared
+	@param y FP16 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP16_equals(FP16 *x, FP16 *y);
+
+/**	@brief Serialize in FP16  
+ *
+    @param b buffer for output
+	@param x FP16 number to be serialized
+ */
+extern void FP16_toBytes(char *b,FP16 *x);
+/**	@brief Serialize out FP16  
+ *
+	@param x FP16 number to be serialized
+    @param b buffer for input
+ */
+extern void FP16_fromBytes(FP16 *x,char *b);
+
+/**	@brief Tests for FP16 having only a real part and no imaginary part
+ *
+	@param x FP16 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP16_isreal(FP16 *x);
+/**	@brief Initialise FP16 from two FP8s
+ *
+	@param x FP16 instance to be initialised
+	@param a FP8 to form real part of FP16
+	@param b FP8 to form imaginary part of FP16
+ */
+extern void FP16_from_FP8s(FP16 *x, FP8 *a, FP8 *b);
+/**	@brief Initialise FP16 from single FP8
+ *
+	Imaginary part is set to zero
+	@param x FP16 instance to be initialised
+	@param a FP8 to form real part of FP16
+ */
+extern void FP16_from_FP8(FP16 *x, FP8 *a);
+
+/**	@brief Initialise FP16 from single FP8
+ *
+	real part is set to zero
+	@param x FP16 instance to be initialised
+	@param a FP8 to form imaginary part of FP16
+ */
+extern void FP16_from_FP8H(FP16 *x, FP8 *a);
+
+
+/**	@brief Copy FP16 to another FP16
+ *
+	@param x FP16 instance, on exit = y
+	@param y FP16 instance to be copied
+ */
+extern void FP16_copy(FP16 *x, FP16 *y);
+/**	@brief Set FP16 to zero
+ *
+	@param x FP16 instance to be set to zero
+ */
+extern void FP16_zero(FP16 *x);
+/**	@brief Set FP16 to unity
+ *
+	@param x FP16 instance to be set to one
+ */
+extern void FP16_one(FP16 *x);
+/**	@brief Negation of FP16
+ *
+	@param x FP16 instance, on exit = -y
+	@param y FP16 instance
+ */
+extern void FP16_neg(FP16 *x, FP16 *y);
+/**	@brief Conjugation of FP16
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP16 instance, on exit = conj(y)
+	@param y FP16 instance
+ */
+extern void FP16_conj(FP16 *x, FP16 *y);
+/**	@brief Negative conjugation of FP16
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP16 instance, on exit = -conj(y)
+	@param y FP16 instance
+ */
+extern void FP16_nconj(FP16 *x, FP16 *y);
+/**	@brief addition of two FP16s
+ *
+	@param x FP16 instance, on exit = y+z
+	@param y FP16 instance
+	@param z FP16 instance
+ */
+extern void FP16_add(FP16 *x, FP16 *y, FP16 *z);
+/**	@brief subtraction of two FP16s
+ *
+	@param x FP16 instance, on exit = y-z
+	@param y FP16 instance
+	@param z FP16 instance
+ */
+extern void FP16_sub(FP16 *x, FP16 *y, FP16 *z);
+/**	@brief Multiplication of an FP16 by an FP8
+ *
+	@param x FP16 instance, on exit = y*a
+	@param y FP16 instance
+	@param a FP4 multiplier
+ */
+extern void FP16_pmul(FP16 *x, FP16 *y, FP8 *a);
+
+/**	@brief Multiplication of an FP16 by an FP2
+ *
+	@param x FP16 instance, on exit = y*a
+	@param y FP16 instance
+	@param a FP2 multiplier
+ */
+extern void FP16_qmul(FP16 *x, FP16 *y, FP2 *a);
+
+
+/**	@brief Multiplication of an FP16 by an FP
+ *
+	@param x FP16 instance, on exit = y*a
+	@param y FP16 instance
+	@param a FP multiplier
+ */
+extern void FP16_tmul(FP16 *x, FP16 *y, FP *a);
+
+
+
+/**	@brief Multiplication of an FP16 by a small integer
+ *
+	@param x FP16 instance, on exit = y*i
+	@param y FP16 instance
+	@param i an integer
+ */
+extern void FP16_imul(FP16 *x, FP16 *y, int i);
+/**	@brief Squaring an FP16
+ *
+	@param x FP16 instance, on exit = y^2
+	@param y FP16 instance
+ */
+extern void FP16_sqr(FP16 *x, FP16 *y);
+/**	@brief Multiplication of two FP16s
+ *
+	@param x FP16 instance, on exit = y*z
+	@param y FP16 instance
+	@param z FP16 instance
+ */
+extern void FP16_mul(FP16 *x, FP16 *y, FP16 *z);
+/**	@brief Inverting an FP16
+ *
+	@param x FP16 instance, on exit = 1/y
+	@param y FP16 instance
+ */
+extern void FP16_inv(FP16 *x, FP16 *y);
+/**	@brief Formats and outputs an FP16 to the console
+ *
+	@param x FP16 instance to be printed
+ */
+extern void FP16_output(FP16 *x);
+/**	@brief Formats and outputs an FP16 to the console in raw form (for debugging)
+ *
+	@param x FP16 instance to be printed
+ */
+extern void FP16_rawoutput(FP16 *x);
+/**	@brief multiplies an FP16 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP16 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP16_times_i(FP16 *x);
+/**	@brief multiplies an FP16 instance by irreducible polynomial (1+sqrt(-1))
+ *
+	@param x FP16 instance, on exit = sqrt(1+sqrt(-1))^2*x
+ */
+extern void FP16_times_i2(FP16 *x);
+
+/**	@brief multiplies an FP16 instance by irreducible polynomial (1+sqrt(-1))
+ *
+	@param x FP16 instance, on exit = sqrt(1+sqrt(-1))^4*x
+ */
+extern void FP16_times_i4(FP16 *x);
+
+
+/**	@brief Normalises the components of an FP16
+ *
+	@param x FP16 instance to be normalised
+ */
+extern void FP16_norm(FP16 *x);
+/**	@brief Reduces all components of possibly unreduced FP16 mod Modulus
+ *
+	@param x FP16 instance, on exit reduced mod Modulus
+ */
+extern void FP16_reduce(FP16 *x);
+/**	@brief Raises an FP16 to the power of a BIG
+ *
+	@param x FP16 instance, on exit = y^b
+	@param y FP16 instance
+	@param b BIG number
+ */
+extern void FP16_pow(FP16 *x, FP16 *y, B584_60::BIG b);
+/**	@brief Raises an FP16 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP16 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP16_frob(FP16 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP16 instance, on exit = w*x-conj(x)*y+z
+	@param w FP16 instance
+	@param x FP16 instance
+	@param y FP16 instance
+	@param z FP16 instance
+ */
+extern void FP16_xtr_A(FP16 *r, FP16 *w, FP16 *x, FP16 *y, FP16 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP16 instance, on exit = x^2-2*conj(x)
+	@param x FP16 instance
+ */
+extern void FP16_xtr_D(FP16 *r, FP16 *x);
+/**	@brief Calculates FP16 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP16 instance, on exit = trace(w^b)
+	@param x FP16 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP16_xtr_pow(FP16 *r, FP16 *x, B584_60::BIG b);
+/**	@brief Calculates FP16 trace of c^a.d^b, where c and d are derived from FP16 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP16 instance, on exit = trace(c^a.d^b)
+	@param c FP16 instance, trace of an FP12
+	@param d FP16 instance, trace of an FP12
+	@param e FP16 instance, trace of an FP12
+	@param f FP16 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP16_xtr_pow2(FP16 *r, FP16 *c, FP16 *d, FP16 *e, FP16 *f, B584_60::BIG a, B584_60::BIG b);
+
+/**	@brief Conditional copy of FP16 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP16 instance, set to y if s!=0
+	@param y another FP16 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP16_cmove(FP16 *x, FP16 *y, int s);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp2.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp2.h
new file mode 100644
index 0000000..58c03fd
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp2.h
@@ -0,0 +1,306 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP2_YYY_H
+#define FP2_YYY_H
+
+#include "fp_YYY.h"
+
+using namespace core;
+
+namespace YYY {
+
+/**
+	@brief FP2 Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    FP a; /**< real part of FP2 */
+    FP b; /**< imaginary part of FP2 */
+} FP2;
+
+/* FP2 prototypes */
+
+/**	@brief Tests for FP2 equal to zero
+ *
+	@param x FP2 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP2_iszilch(FP2 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP2 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP2_islarger(FP2 *x);
+
+
+/**	@brief Serialize out FP2  
+ *
+    @param b buffer for output
+	@param x FP2 number to be serialized
+ */
+extern void FP2_toBytes(char *b,FP2 *x);
+
+/**	@brief Serialize in FP2  
+ *
+	@param x FP2 number to be serialized
+    @param b buffer for input
+ */
+extern void FP2_fromBytes(FP2 *x,char *b);
+
+/**	@brief Conditional copy of FP2 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP2 instance, set to y if s!=0
+	@param y another FP2 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP2_cmove(FP2 *x, FP2 *y, int s);
+/**	@brief Tests for FP2 equal to one
+ *
+	@param x FP2 instance to be tested
+	@return 1 if x=1, else returns 0
+ */
+extern int FP2_isunity(FP2 *x);
+/**	@brief Tests for equality of two FP2s
+ *
+	@param x FP2 instance to be compared
+	@param y FP2 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP2_equals(FP2 *x, FP2 *y);
+/**	@brief Initialise FP2 from two FP numbers
+ *
+	@param x FP2 instance to be initialised
+	@param a FP to form real part of FP2
+	@param b FP to form imaginary part of FP2
+ */
+extern void FP2_from_FPs(FP2 *x, FP *a, FP *b);
+/**	@brief Initialise FP2 from two BIG integers
+ *
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+	@param b BIG to form imaginary part of FP2
+ */
+extern void FP2_from_BIGs(FP2 *x, XXX::BIG a, XXX::BIG b);
+
+
+/**	@brief Initialise FP2 from two integers
+ *
+	@param x FP2 instance to be initialised
+	@param a int to form real part of FP2
+	@param b int to form imaginary part of FP2
+ */
+extern void FP2_from_ints(FP2 *x, int a, int b);
+
+
+
+/**	@brief Initialise FP2 from single FP
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param an FP to form real part of FP2
+ */
+extern void FP2_from_FP(FP2 *x, FP *a);
+/**	@brief Initialise FP2 from single BIG
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+ */
+extern void FP2_from_BIG(FP2 *x, XXX::BIG a);
+/**	@brief Copy FP2 to another FP2
+ *
+	@param x FP2 instance, on exit = y
+	@param y FP2 instance to be copied
+ */
+extern void FP2_copy(FP2 *x, FP2 *y);
+/**	@brief Set FP2 to zero
+ *
+	@param x FP2 instance to be set to zero
+ */
+extern void FP2_zero(FP2 *x);
+/**	@brief Set FP2 to unity
+ *
+	@param x FP2 instance to be set to one
+ */
+extern void FP2_one(FP2 *x);
+
+/**	@brief Copy from ROM to an FP2
+ *
+	@param w FP2 number to be copied to
+	@param a BIG real part to be copied from ROM
+	@param b BIG imag part to be copied from ROM
+ */
+extern void FP2_rcopy(FP2 *w,const XXX::BIG a,const XXX::BIG b);
+
+/**	@brief Sign of FP2
+ *
+	@param x FP2 instance
+	@return "sign" of FP2
+ */
+extern int FP2_sign(FP2 *x);
+
+/**	@brief Negation of FP2
+ *
+	@param x FP2 instance, on exit = -y
+	@param y FP2 instance
+ */
+extern void FP2_neg(FP2 *x, FP2 *y);
+
+
+/**	@brief Conjugation of FP2
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP2 instance, on exit = conj(y)
+	@param y FP2 instance
+ */
+extern void FP2_conj(FP2 *x, FP2 *y);
+/**	@brief addition of two FP2s
+ *
+	@param x FP2 instance, on exit = y+z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_add(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief subtraction of two FP2s
+ *
+	@param x FP2 instance, on exit = y-z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_sub(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Multiplication of an FP2 by an FP
+ *
+	@param x FP2 instance, on exit = y*b
+	@param y FP2 instance
+	@param b FP residue
+ */
+extern void FP2_pmul(FP2 *x, FP2 *y, FP *b);
+/**	@brief Multiplication of an FP2 by a small integer
+ *
+	@param x FP2 instance, on exit = y*i
+	@param y FP2 instance
+	@param i an integer
+ */
+extern void FP2_imul(FP2 *x, FP2 *y, int i);
+/**	@brief Squaring an FP2
+ *
+	@param x FP2 instance, on exit = y^2
+	@param y FP2 instance
+ */
+extern void FP2_sqr(FP2 *x, FP2 *y);
+/**	@brief Multiplication of two FP2s
+ *
+	@param x FP2 instance, on exit = y*z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_mul(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Formats and outputs an FP2 to the console
+ *
+	@param x FP2 instance
+ */
+extern void FP2_output(FP2 *x);
+/**	@brief Formats and outputs an FP2 to the console in raw form (for debugging)
+ *
+	@param x FP2 instance
+ */
+extern void FP2_rawoutput(FP2 *x);
+/**	@brief Inverting an FP2
+ *
+	@param x FP2 instance, on exit = 1/y
+	@param y FP2 instance
+ */
+extern void FP2_inv(FP2 *x, FP2 *y, FP *h);
+/**	@brief Divide an FP2 by 2
+ *
+	@param x FP2 instance, on exit = y/2
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_div2(FP2 *x, FP2 *y);
+/**	@brief Multiply an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x*(1+sqrt(-1))
+ */
+extern void FP2_mul_ip(FP2 *x);
+
+/**	@brief Divide an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x/(1+sqrt(-1))
+ */
+extern void FP2_div_ip(FP2 *x);
+/**	@brief Normalises the components of an FP2
+ *
+	@param x FP2 instance to be normalised
+ */
+extern void FP2_norm(FP2 *x);
+/**	@brief Reduces all components of possibly unreduced FP2 mod Modulus
+ *
+	@param x FP2 instance, on exit reduced mod Modulus
+ */
+extern void FP2_reduce(FP2 *x);
+/**	@brief Raises an FP2 to the power of a BIG
+ *
+	@param x FP2 instance, on exit = y^b
+	@param y FP2 instance
+	@param b BIG number
+ */
+extern void FP2_pow(FP2 *x, FP2 *y, XXX::BIG b);
+
+/**	@brief Test FP2 for QR
+ *
+	@param x FP2 instance
+    @param h optional generated hint
+	@return true or false
+ */
+extern int FP2_qr(FP2 *x,FP *h);
+
+
+/**	@brief Square root of an FP2
+ *
+	@param x FP2 instance, on exit = sqrt(y)
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_sqrt(FP2 *x, FP2 *y, FP *h);
+
+/**	@brief Multiply an FP2 by sqrt(-1)
+ *
+	Note that -1 is QNR
+	@param x FP2 instance, on exit = x*sqrt(-1)
+ */
+extern void FP2_times_i(FP2 *x);
+
+/**	@brief Generate random FP2
+ *
+	@param x random FP2 number
+	@param rng random number generator
+ */
+extern void FP2_rand(FP2 *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp24.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp24.h
new file mode 100644
index 0000000..1b4b3c9
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp24.h
@@ -0,0 +1,236 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP24_YYY_H
+#define FP24_YYY_H
+
+#include "fp8_YYY.h"
+
+using namespace core;
+
+namespace YYY {
+/**
+	@brief FP12 Structure - towered over three FP8
+*/
+
+
+typedef struct
+{
+    FP8 a; /**< first part of FP12 */
+    FP8 b; /**< second part of FP12 */
+    FP8 c; /**< third part of FP12 */
+    int type;
+} FP24;
+
+extern const XXX::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const XXX::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+/* FP24 prototypes */
+/**	@brief Tests for FP24 equal to zero
+ *
+	@param x FP24 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP24_iszilch(FP24 *x);
+/**	@brief Tests for FP24 equal to unity
+ *
+	@param x FP24 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP24_isunity(FP24 *x);
+/**	@brief Copy FP24 to another FP24
+ *
+	@param x FP24 instance, on exit = y
+	@param y FP24 instance to be copied
+ */
+extern void FP24_copy(FP24 *x, FP24 *y);
+/**	@brief Set FP24 to unity
+ *
+	@param x FP24 instance to be set to one
+ */
+extern void FP24_one(FP24 *x);
+
+/**	@brief Set FP24 to zero
+ *
+	@param x FP24 instance to be set to zero
+ */
+extern void FP24_zero(FP24 *x);
+
+
+/**	@brief Tests for equality of two FP24s
+ *
+	@param x FP24 instance to be compared
+	@param y FP24 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP24_equals(FP24 *x, FP24 *y);
+/**	@brief Conjugation of FP24
+ *
+	If y=(a,b,c) (where a,b,c are its three FP8 components) on exit x=(conj(a),-conj(b),conj(c))
+	@param x FP24 instance, on exit = conj(y)
+	@param y FP24 instance
+ */
+extern void FP24_conj(FP24 *x, FP24 *y);
+/**	@brief Initialise FP24 from single FP8
+ *
+	Sets first FP8 component of an FP24, other components set to zero
+	@param x FP24 instance to be initialised
+	@param a FP8 to form first part of FP8
+ */
+extern void FP24_from_FP8(FP24 *x, FP8 *a);
+/**	@brief Initialise FP24 from three FP8s
+ *
+	@param x FP24 instance to be initialised
+	@param a FP8 to form first part of FP24
+	@param b FP8 to form second part of FP24
+	@param c FP8 to form third part of FP24
+ */
+extern void FP24_from_FP8s(FP24 *x, FP8 *a, FP8* b, FP8 *c);
+/**	@brief Fast Squaring of an FP24 in "unitary" form
+ *
+	@param x FP24 instance, on exit = y^2
+	@param y FP8 instance, must be unitary
+ */
+extern void FP24_usqr(FP24 *x, FP24 *y);
+/**	@brief Squaring an FP24
+ *
+	@param x FP24 instance, on exit = y^2
+	@param y FP24 instance
+ */
+extern void FP24_sqr(FP24 *x, FP24 *y);
+
+/**	@brief Fast multiplication of two sparse FP24s that arises from ATE pairing line functions
+ *
+	@param x FP24 instance, on exit = x*y
+	@param y FP24 instance, of special form
+ */
+extern void FP24_smul(FP24 *x, FP24 *y);
+
+/**	@brief Fast multiplication of what may be sparse multiplicands
+ *
+	@param x FP24 instance, on exit = x*y
+	@param y FP24 instance, of special form
+ */
+extern void FP24_ssmul(FP24 *x, FP24 *y);
+/**	@brief Full unconditional Multiplication of two FP24s
+ *
+	@param x FP24 instance, on exit = x*y
+	@param y FP24 instance, the multiplier
+ */
+extern void FP24_mul(FP24 *x, FP24 *y);
+
+/**	@brief Inverting an FP24
+ *
+	@param x FP24 instance, on exit = 1/y
+	@param y FP24 instance
+ */
+extern void FP24_inv(FP24 *x, FP24 *y);
+/**	@brief Raises an FP24 to the power of a BIG
+ *
+	@param r FP24 instance, on exit = y^b
+	@param x FP24 instance
+	@param b BIG number
+ */
+extern void FP24_pow(FP24 *r, FP24 *x, XXX::BIG b);
+
+//extern void FP24_ppow(FP24 *r,FP24 *x,XXX::BIG b);
+
+/**	@brief Raises an FP24 instance x to a small integer power, side-channel resistant
+ *
+	@param x FP24 instance, on exit = x^i
+	@param i small integer exponent
+	@param b maximum number of bits in exponent
+ */
+extern void FP24_pinpow(FP24 *x, int i, int b);
+
+/**	@brief Raises an FP24 instance x to a BIG power, compressed to FP8
+ *
+	@param c FP8 instance, on exit = x^(e mod r) as FP8
+	@param x FP24 input
+	@param e BIG exponent
+	@param r BIG group order
+ */
+extern void FP24_compow(FP8 *c, FP24 *x, XXX::BIG e, XXX::BIG r);
+
+/**	@brief Calculate Pi x[i]^b[i] for i=0 to 7, side-channel resistant
+ *
+	@param r FP24 instance, on exit = Pi x[i]^b[i] for i=0 to 7
+	@param x FP24 array with 4 FP24s
+	@param b BIG array of 4 exponents
+ */
+extern void FP24_pow8(FP24 *r, FP24 *x, XXX::BIG *b);
+
+
+/**	@brief Raises an FP24 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP24 instance, on exit = x^p^n
+	@param f FP2 precalculated Frobenius constant
+	@param n power of p
+ */
+extern void FP24_frob(FP24 *x, FP2 *f, int n);
+
+/**	@brief Reduces all components of possibly unreduced FP24 mod Modulus
+ *
+	@param x FP24 instance, on exit reduced mod Modulus
+ */
+extern void FP24_reduce(FP24 *x);
+/**	@brief Normalises the components of an FP24
+ *
+	@param x FP24 instance to be normalised
+ */
+extern void FP24_norm(FP24 *x);
+/**	@brief Formats and outputs an FP24 to the console
+ *
+	@param x FP24 instance to be printed
+ */
+extern void FP24_output(FP24 *x);
+/**	@brief Formats and outputs an FP24 instance to an octet string
+ *
+	Serializes the components of an FP24 to big-endian base 256 form.
+	@param S output octet string
+	@param x FP24 instance to be converted to an octet string
+ */
+extern void FP24_toOctet(octet *S, FP24 *x);
+/**	@brief Creates an FP24 instance from an octet string
+ *
+	De-serializes the components of an FP24 to create an FP24 from big-endian base 256 components.
+	@param x FP24 instance to be created from an octet string
+	@param S input octet string
+
+ */
+extern void FP24_fromOctet(FP24 *x, octet *S);
+/**	@brief Calculate the trace of an FP24
+ *
+	@param t FP8 trace of x, on exit = tr(x)
+	@param x FP24 instance
+
+ */
+extern void FP24_trace(FP8 *t, FP24 *x);
+
+/**	@brief Conditional copy of FP24 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP24 instance, set to y if s!=0
+	@param y another FP24 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP24_cmove(FP24 *x, FP24 *y, int s);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp24_BLS24479.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp24_BLS24479.h
new file mode 100644
index 0000000..4b62f54
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp24_BLS24479.h
@@ -0,0 +1,236 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP24_BLS24479_H
+#define FP24_BLS24479_H
+
+#include "fp8_BLS24479.h"
+
+using namespace core;
+
+namespace BLS24479 {
+/**
+	@brief FP12 Structure - towered over three FP8
+*/
+
+
+typedef struct
+{
+    FP8 a; /**< first part of FP12 */
+    FP8 b; /**< second part of FP12 */
+    FP8 c; /**< third part of FP12 */
+    int type;
+} FP24;
+
+extern const B480_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B480_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+/* FP24 prototypes */
+/**	@brief Tests for FP24 equal to zero
+ *
+	@param x FP24 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP24_iszilch(FP24 *x);
+/**	@brief Tests for FP24 equal to unity
+ *
+	@param x FP24 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP24_isunity(FP24 *x);
+/**	@brief Copy FP24 to another FP24
+ *
+	@param x FP24 instance, on exit = y
+	@param y FP24 instance to be copied
+ */
+extern void FP24_copy(FP24 *x, FP24 *y);
+/**	@brief Set FP24 to unity
+ *
+	@param x FP24 instance to be set to one
+ */
+extern void FP24_one(FP24 *x);
+
+/**	@brief Set FP24 to zero
+ *
+	@param x FP24 instance to be set to zero
+ */
+extern void FP24_zero(FP24 *x);
+
+
+/**	@brief Tests for equality of two FP24s
+ *
+	@param x FP24 instance to be compared
+	@param y FP24 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP24_equals(FP24 *x, FP24 *y);
+/**	@brief Conjugation of FP24
+ *
+	If y=(a,b,c) (where a,b,c are its three FP8 components) on exit x=(conj(a),-conj(b),conj(c))
+	@param x FP24 instance, on exit = conj(y)
+	@param y FP24 instance
+ */
+extern void FP24_conj(FP24 *x, FP24 *y);
+/**	@brief Initialise FP24 from single FP8
+ *
+	Sets first FP8 component of an FP24, other components set to zero
+	@param x FP24 instance to be initialised
+	@param a FP8 to form first part of FP8
+ */
+extern void FP24_from_FP8(FP24 *x, FP8 *a);
+/**	@brief Initialise FP24 from three FP8s
+ *
+	@param x FP24 instance to be initialised
+	@param a FP8 to form first part of FP24
+	@param b FP8 to form second part of FP24
+	@param c FP8 to form third part of FP24
+ */
+extern void FP24_from_FP8s(FP24 *x, FP8 *a, FP8* b, FP8 *c);
+/**	@brief Fast Squaring of an FP24 in "unitary" form
+ *
+	@param x FP24 instance, on exit = y^2
+	@param y FP8 instance, must be unitary
+ */
+extern void FP24_usqr(FP24 *x, FP24 *y);
+/**	@brief Squaring an FP24
+ *
+	@param x FP24 instance, on exit = y^2
+	@param y FP24 instance
+ */
+extern void FP24_sqr(FP24 *x, FP24 *y);
+
+/**	@brief Fast multiplication of two sparse FP24s that arises from ATE pairing line functions
+ *
+	@param x FP24 instance, on exit = x*y
+	@param y FP24 instance, of special form
+ */
+extern void FP24_smul(FP24 *x, FP24 *y);
+
+/**	@brief Fast multiplication of what may be sparse multiplicands
+ *
+	@param x FP24 instance, on exit = x*y
+	@param y FP24 instance, of special form
+ */
+extern void FP24_ssmul(FP24 *x, FP24 *y);
+/**	@brief Full unconditional Multiplication of two FP24s
+ *
+	@param x FP24 instance, on exit = x*y
+	@param y FP24 instance, the multiplier
+ */
+extern void FP24_mul(FP24 *x, FP24 *y);
+
+/**	@brief Inverting an FP24
+ *
+	@param x FP24 instance, on exit = 1/y
+	@param y FP24 instance
+ */
+extern void FP24_inv(FP24 *x, FP24 *y);
+/**	@brief Raises an FP24 to the power of a BIG
+ *
+	@param r FP24 instance, on exit = y^b
+	@param x FP24 instance
+	@param b BIG number
+ */
+extern void FP24_pow(FP24 *r, FP24 *x, B480_56::BIG b);
+
+//extern void FP24_ppow(FP24 *r,FP24 *x,B480_56::BIG b);
+
+/**	@brief Raises an FP24 instance x to a small integer power, side-channel resistant
+ *
+	@param x FP24 instance, on exit = x^i
+	@param i small integer exponent
+	@param b maximum number of bits in exponent
+ */
+extern void FP24_pinpow(FP24 *x, int i, int b);
+
+/**	@brief Raises an FP24 instance x to a BIG power, compressed to FP8
+ *
+	@param c FP8 instance, on exit = x^(e mod r) as FP8
+	@param x FP24 input
+	@param e BIG exponent
+	@param r BIG group order
+ */
+extern void FP24_compow(FP8 *c, FP24 *x, B480_56::BIG e, B480_56::BIG r);
+
+/**	@brief Calculate Pi x[i]^b[i] for i=0 to 7, side-channel resistant
+ *
+	@param r FP24 instance, on exit = Pi x[i]^b[i] for i=0 to 7
+	@param x FP24 array with 4 FP24s
+	@param b BIG array of 4 exponents
+ */
+extern void FP24_pow8(FP24 *r, FP24 *x, B480_56::BIG *b);
+
+
+/**	@brief Raises an FP24 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP24 instance, on exit = x^p^n
+	@param f FP2 precalculated Frobenius constant
+	@param n power of p
+ */
+extern void FP24_frob(FP24 *x, FP2 *f, int n);
+
+/**	@brief Reduces all components of possibly unreduced FP24 mod Modulus
+ *
+	@param x FP24 instance, on exit reduced mod Modulus
+ */
+extern void FP24_reduce(FP24 *x);
+/**	@brief Normalises the components of an FP24
+ *
+	@param x FP24 instance to be normalised
+ */
+extern void FP24_norm(FP24 *x);
+/**	@brief Formats and outputs an FP24 to the console
+ *
+	@param x FP24 instance to be printed
+ */
+extern void FP24_output(FP24 *x);
+/**	@brief Formats and outputs an FP24 instance to an octet string
+ *
+	Serializes the components of an FP24 to big-endian base 256 form.
+	@param S output octet string
+	@param x FP24 instance to be converted to an octet string
+ */
+extern void FP24_toOctet(octet *S, FP24 *x);
+/**	@brief Creates an FP24 instance from an octet string
+ *
+	De-serializes the components of an FP24 to create an FP24 from big-endian base 256 components.
+	@param x FP24 instance to be created from an octet string
+	@param S input octet string
+
+ */
+extern void FP24_fromOctet(FP24 *x, octet *S);
+/**	@brief Calculate the trace of an FP24
+ *
+	@param t FP8 trace of x, on exit = tr(x)
+	@param x FP24 instance
+
+ */
+extern void FP24_trace(FP8 *t, FP24 *x);
+
+/**	@brief Conditional copy of FP24 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP24 instance, set to y if s!=0
+	@param y another FP24 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP24_cmove(FP24 *x, FP24 *y, int s);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp2_BLS12381.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp2_BLS12381.h
new file mode 100644
index 0000000..4843c4a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp2_BLS12381.h
@@ -0,0 +1,306 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP2_BLS12381_H
+#define FP2_BLS12381_H
+
+#include "fp_BLS12381.h"
+
+using namespace core;
+
+namespace BLS12381 {
+
+/**
+	@brief FP2 Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    FP a; /**< real part of FP2 */
+    FP b; /**< imaginary part of FP2 */
+} FP2;
+
+/* FP2 prototypes */
+
+/**	@brief Tests for FP2 equal to zero
+ *
+	@param x FP2 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP2_iszilch(FP2 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP2 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP2_islarger(FP2 *x);
+
+
+/**	@brief Serialize out FP2  
+ *
+    @param b buffer for output
+	@param x FP2 number to be serialized
+ */
+extern void FP2_toBytes(char *b,FP2 *x);
+
+/**	@brief Serialize in FP2  
+ *
+	@param x FP2 number to be serialized
+    @param b buffer for input
+ */
+extern void FP2_fromBytes(FP2 *x,char *b);
+
+/**	@brief Conditional copy of FP2 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP2 instance, set to y if s!=0
+	@param y another FP2 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP2_cmove(FP2 *x, FP2 *y, int s);
+/**	@brief Tests for FP2 equal to one
+ *
+	@param x FP2 instance to be tested
+	@return 1 if x=1, else returns 0
+ */
+extern int FP2_isunity(FP2 *x);
+/**	@brief Tests for equality of two FP2s
+ *
+	@param x FP2 instance to be compared
+	@param y FP2 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP2_equals(FP2 *x, FP2 *y);
+/**	@brief Initialise FP2 from two FP numbers
+ *
+	@param x FP2 instance to be initialised
+	@param a FP to form real part of FP2
+	@param b FP to form imaginary part of FP2
+ */
+extern void FP2_from_FPs(FP2 *x, FP *a, FP *b);
+/**	@brief Initialise FP2 from two BIG integers
+ *
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+	@param b BIG to form imaginary part of FP2
+ */
+extern void FP2_from_BIGs(FP2 *x, B384_58::BIG a, B384_58::BIG b);
+
+
+/**	@brief Initialise FP2 from two integers
+ *
+	@param x FP2 instance to be initialised
+	@param a int to form real part of FP2
+	@param b int to form imaginary part of FP2
+ */
+extern void FP2_from_ints(FP2 *x, int a, int b);
+
+
+
+/**	@brief Initialise FP2 from single FP
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param an FP to form real part of FP2
+ */
+extern void FP2_from_FP(FP2 *x, FP *a);
+/**	@brief Initialise FP2 from single BIG
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+ */
+extern void FP2_from_BIG(FP2 *x, B384_58::BIG a);
+/**	@brief Copy FP2 to another FP2
+ *
+	@param x FP2 instance, on exit = y
+	@param y FP2 instance to be copied
+ */
+extern void FP2_copy(FP2 *x, FP2 *y);
+/**	@brief Set FP2 to zero
+ *
+	@param x FP2 instance to be set to zero
+ */
+extern void FP2_zero(FP2 *x);
+/**	@brief Set FP2 to unity
+ *
+	@param x FP2 instance to be set to one
+ */
+extern void FP2_one(FP2 *x);
+
+/**	@brief Copy from ROM to an FP2
+ *
+	@param w FP2 number to be copied to
+	@param a BIG real part to be copied from ROM
+	@param b BIG imag part to be copied from ROM
+ */
+extern void FP2_rcopy(FP2 *w,const B384_58::BIG a,const B384_58::BIG b);
+
+/**	@brief Sign of FP2
+ *
+	@param x FP2 instance
+	@return "sign" of FP2
+ */
+extern int FP2_sign(FP2 *x);
+
+/**	@brief Negation of FP2
+ *
+	@param x FP2 instance, on exit = -y
+	@param y FP2 instance
+ */
+extern void FP2_neg(FP2 *x, FP2 *y);
+
+
+/**	@brief Conjugation of FP2
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP2 instance, on exit = conj(y)
+	@param y FP2 instance
+ */
+extern void FP2_conj(FP2 *x, FP2 *y);
+/**	@brief addition of two FP2s
+ *
+	@param x FP2 instance, on exit = y+z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_add(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief subtraction of two FP2s
+ *
+	@param x FP2 instance, on exit = y-z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_sub(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Multiplication of an FP2 by an FP
+ *
+	@param x FP2 instance, on exit = y*b
+	@param y FP2 instance
+	@param b FP residue
+ */
+extern void FP2_pmul(FP2 *x, FP2 *y, FP *b);
+/**	@brief Multiplication of an FP2 by a small integer
+ *
+	@param x FP2 instance, on exit = y*i
+	@param y FP2 instance
+	@param i an integer
+ */
+extern void FP2_imul(FP2 *x, FP2 *y, int i);
+/**	@brief Squaring an FP2
+ *
+	@param x FP2 instance, on exit = y^2
+	@param y FP2 instance
+ */
+extern void FP2_sqr(FP2 *x, FP2 *y);
+/**	@brief Multiplication of two FP2s
+ *
+	@param x FP2 instance, on exit = y*z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_mul(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Formats and outputs an FP2 to the console
+ *
+	@param x FP2 instance
+ */
+extern void FP2_output(FP2 *x);
+/**	@brief Formats and outputs an FP2 to the console in raw form (for debugging)
+ *
+	@param x FP2 instance
+ */
+extern void FP2_rawoutput(FP2 *x);
+/**	@brief Inverting an FP2
+ *
+	@param x FP2 instance, on exit = 1/y
+	@param y FP2 instance
+ */
+extern void FP2_inv(FP2 *x, FP2 *y, FP *h);
+/**	@brief Divide an FP2 by 2
+ *
+	@param x FP2 instance, on exit = y/2
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_div2(FP2 *x, FP2 *y);
+/**	@brief Multiply an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x*(1+sqrt(-1))
+ */
+extern void FP2_mul_ip(FP2 *x);
+
+/**	@brief Divide an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x/(1+sqrt(-1))
+ */
+extern void FP2_div_ip(FP2 *x);
+/**	@brief Normalises the components of an FP2
+ *
+	@param x FP2 instance to be normalised
+ */
+extern void FP2_norm(FP2 *x);
+/**	@brief Reduces all components of possibly unreduced FP2 mod Modulus
+ *
+	@param x FP2 instance, on exit reduced mod Modulus
+ */
+extern void FP2_reduce(FP2 *x);
+/**	@brief Raises an FP2 to the power of a BIG
+ *
+	@param x FP2 instance, on exit = y^b
+	@param y FP2 instance
+	@param b BIG number
+ */
+extern void FP2_pow(FP2 *x, FP2 *y, B384_58::BIG b);
+
+/**	@brief Test FP2 for QR
+ *
+	@param x FP2 instance
+    @param h optional generated hint
+	@return true or false
+ */
+extern int FP2_qr(FP2 *x,FP *h);
+
+
+/**	@brief Square root of an FP2
+ *
+	@param x FP2 instance, on exit = sqrt(y)
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_sqrt(FP2 *x, FP2 *y, FP *h);
+
+/**	@brief Multiply an FP2 by sqrt(-1)
+ *
+	Note that -1 is QNR
+	@param x FP2 instance, on exit = x*sqrt(-1)
+ */
+extern void FP2_times_i(FP2 *x);
+
+/**	@brief Generate random FP2
+ *
+	@param x random FP2 number
+	@param rng random number generator
+ */
+extern void FP2_rand(FP2 *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp2_BLS12383.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp2_BLS12383.h
new file mode 100644
index 0000000..5d9f2c9
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp2_BLS12383.h
@@ -0,0 +1,306 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP2_BLS12383_H
+#define FP2_BLS12383_H
+
+#include "fp_BLS12383.h"
+
+using namespace core;
+
+namespace BLS12383 {
+
+/**
+	@brief FP2 Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    FP a; /**< real part of FP2 */
+    FP b; /**< imaginary part of FP2 */
+} FP2;
+
+/* FP2 prototypes */
+
+/**	@brief Tests for FP2 equal to zero
+ *
+	@param x FP2 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP2_iszilch(FP2 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP2 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP2_islarger(FP2 *x);
+
+
+/**	@brief Serialize out FP2  
+ *
+    @param b buffer for output
+	@param x FP2 number to be serialized
+ */
+extern void FP2_toBytes(char *b,FP2 *x);
+
+/**	@brief Serialize in FP2  
+ *
+	@param x FP2 number to be serialized
+    @param b buffer for input
+ */
+extern void FP2_fromBytes(FP2 *x,char *b);
+
+/**	@brief Conditional copy of FP2 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP2 instance, set to y if s!=0
+	@param y another FP2 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP2_cmove(FP2 *x, FP2 *y, int s);
+/**	@brief Tests for FP2 equal to one
+ *
+	@param x FP2 instance to be tested
+	@return 1 if x=1, else returns 0
+ */
+extern int FP2_isunity(FP2 *x);
+/**	@brief Tests for equality of two FP2s
+ *
+	@param x FP2 instance to be compared
+	@param y FP2 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP2_equals(FP2 *x, FP2 *y);
+/**	@brief Initialise FP2 from two FP numbers
+ *
+	@param x FP2 instance to be initialised
+	@param a FP to form real part of FP2
+	@param b FP to form imaginary part of FP2
+ */
+extern void FP2_from_FPs(FP2 *x, FP *a, FP *b);
+/**	@brief Initialise FP2 from two BIG integers
+ *
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+	@param b BIG to form imaginary part of FP2
+ */
+extern void FP2_from_BIGs(FP2 *x, B384_58::BIG a, B384_58::BIG b);
+
+
+/**	@brief Initialise FP2 from two integers
+ *
+	@param x FP2 instance to be initialised
+	@param a int to form real part of FP2
+	@param b int to form imaginary part of FP2
+ */
+extern void FP2_from_ints(FP2 *x, int a, int b);
+
+
+
+/**	@brief Initialise FP2 from single FP
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param an FP to form real part of FP2
+ */
+extern void FP2_from_FP(FP2 *x, FP *a);
+/**	@brief Initialise FP2 from single BIG
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+ */
+extern void FP2_from_BIG(FP2 *x, B384_58::BIG a);
+/**	@brief Copy FP2 to another FP2
+ *
+	@param x FP2 instance, on exit = y
+	@param y FP2 instance to be copied
+ */
+extern void FP2_copy(FP2 *x, FP2 *y);
+/**	@brief Set FP2 to zero
+ *
+	@param x FP2 instance to be set to zero
+ */
+extern void FP2_zero(FP2 *x);
+/**	@brief Set FP2 to unity
+ *
+	@param x FP2 instance to be set to one
+ */
+extern void FP2_one(FP2 *x);
+
+/**	@brief Copy from ROM to an FP2
+ *
+	@param w FP2 number to be copied to
+	@param a BIG real part to be copied from ROM
+	@param b BIG imag part to be copied from ROM
+ */
+extern void FP2_rcopy(FP2 *w,const B384_58::BIG a,const B384_58::BIG b);
+
+/**	@brief Sign of FP2
+ *
+	@param x FP2 instance
+	@return "sign" of FP2
+ */
+extern int FP2_sign(FP2 *x);
+
+/**	@brief Negation of FP2
+ *
+	@param x FP2 instance, on exit = -y
+	@param y FP2 instance
+ */
+extern void FP2_neg(FP2 *x, FP2 *y);
+
+
+/**	@brief Conjugation of FP2
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP2 instance, on exit = conj(y)
+	@param y FP2 instance
+ */
+extern void FP2_conj(FP2 *x, FP2 *y);
+/**	@brief addition of two FP2s
+ *
+	@param x FP2 instance, on exit = y+z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_add(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief subtraction of two FP2s
+ *
+	@param x FP2 instance, on exit = y-z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_sub(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Multiplication of an FP2 by an FP
+ *
+	@param x FP2 instance, on exit = y*b
+	@param y FP2 instance
+	@param b FP residue
+ */
+extern void FP2_pmul(FP2 *x, FP2 *y, FP *b);
+/**	@brief Multiplication of an FP2 by a small integer
+ *
+	@param x FP2 instance, on exit = y*i
+	@param y FP2 instance
+	@param i an integer
+ */
+extern void FP2_imul(FP2 *x, FP2 *y, int i);
+/**	@brief Squaring an FP2
+ *
+	@param x FP2 instance, on exit = y^2
+	@param y FP2 instance
+ */
+extern void FP2_sqr(FP2 *x, FP2 *y);
+/**	@brief Multiplication of two FP2s
+ *
+	@param x FP2 instance, on exit = y*z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_mul(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Formats and outputs an FP2 to the console
+ *
+	@param x FP2 instance
+ */
+extern void FP2_output(FP2 *x);
+/**	@brief Formats and outputs an FP2 to the console in raw form (for debugging)
+ *
+	@param x FP2 instance
+ */
+extern void FP2_rawoutput(FP2 *x);
+/**	@brief Inverting an FP2
+ *
+	@param x FP2 instance, on exit = 1/y
+	@param y FP2 instance
+ */
+extern void FP2_inv(FP2 *x, FP2 *y, FP *h);
+/**	@brief Divide an FP2 by 2
+ *
+	@param x FP2 instance, on exit = y/2
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_div2(FP2 *x, FP2 *y);
+/**	@brief Multiply an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x*(1+sqrt(-1))
+ */
+extern void FP2_mul_ip(FP2 *x);
+
+/**	@brief Divide an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x/(1+sqrt(-1))
+ */
+extern void FP2_div_ip(FP2 *x);
+/**	@brief Normalises the components of an FP2
+ *
+	@param x FP2 instance to be normalised
+ */
+extern void FP2_norm(FP2 *x);
+/**	@brief Reduces all components of possibly unreduced FP2 mod Modulus
+ *
+	@param x FP2 instance, on exit reduced mod Modulus
+ */
+extern void FP2_reduce(FP2 *x);
+/**	@brief Raises an FP2 to the power of a BIG
+ *
+	@param x FP2 instance, on exit = y^b
+	@param y FP2 instance
+	@param b BIG number
+ */
+extern void FP2_pow(FP2 *x, FP2 *y, B384_58::BIG b);
+
+/**	@brief Test FP2 for QR
+ *
+	@param x FP2 instance
+    @param h optional generated hint
+	@return true or false
+ */
+extern int FP2_qr(FP2 *x,FP *h);
+
+
+/**	@brief Square root of an FP2
+ *
+	@param x FP2 instance, on exit = sqrt(y)
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_sqrt(FP2 *x, FP2 *y, FP *h);
+
+/**	@brief Multiply an FP2 by sqrt(-1)
+ *
+	Note that -1 is QNR
+	@param x FP2 instance, on exit = x*sqrt(-1)
+ */
+extern void FP2_times_i(FP2 *x);
+
+/**	@brief Generate random FP2
+ *
+	@param x random FP2 number
+	@param rng random number generator
+ */
+extern void FP2_rand(FP2 *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp2_BLS12443.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp2_BLS12443.h
new file mode 100644
index 0000000..78f88e3
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp2_BLS12443.h
@@ -0,0 +1,306 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP2_BLS12443_H
+#define FP2_BLS12443_H
+
+#include "fp_BLS12443.h"
+
+using namespace core;
+
+namespace BLS12443 {
+
+/**
+	@brief FP2 Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    FP a; /**< real part of FP2 */
+    FP b; /**< imaginary part of FP2 */
+} FP2;
+
+/* FP2 prototypes */
+
+/**	@brief Tests for FP2 equal to zero
+ *
+	@param x FP2 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP2_iszilch(FP2 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP2 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP2_islarger(FP2 *x);
+
+
+/**	@brief Serialize out FP2  
+ *
+    @param b buffer for output
+	@param x FP2 number to be serialized
+ */
+extern void FP2_toBytes(char *b,FP2 *x);
+
+/**	@brief Serialize in FP2  
+ *
+	@param x FP2 number to be serialized
+    @param b buffer for input
+ */
+extern void FP2_fromBytes(FP2 *x,char *b);
+
+/**	@brief Conditional copy of FP2 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP2 instance, set to y if s!=0
+	@param y another FP2 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP2_cmove(FP2 *x, FP2 *y, int s);
+/**	@brief Tests for FP2 equal to one
+ *
+	@param x FP2 instance to be tested
+	@return 1 if x=1, else returns 0
+ */
+extern int FP2_isunity(FP2 *x);
+/**	@brief Tests for equality of two FP2s
+ *
+	@param x FP2 instance to be compared
+	@param y FP2 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP2_equals(FP2 *x, FP2 *y);
+/**	@brief Initialise FP2 from two FP numbers
+ *
+	@param x FP2 instance to be initialised
+	@param a FP to form real part of FP2
+	@param b FP to form imaginary part of FP2
+ */
+extern void FP2_from_FPs(FP2 *x, FP *a, FP *b);
+/**	@brief Initialise FP2 from two BIG integers
+ *
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+	@param b BIG to form imaginary part of FP2
+ */
+extern void FP2_from_BIGs(FP2 *x, B448_60::BIG a, B448_60::BIG b);
+
+
+/**	@brief Initialise FP2 from two integers
+ *
+	@param x FP2 instance to be initialised
+	@param a int to form real part of FP2
+	@param b int to form imaginary part of FP2
+ */
+extern void FP2_from_ints(FP2 *x, int a, int b);
+
+
+
+/**	@brief Initialise FP2 from single FP
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param an FP to form real part of FP2
+ */
+extern void FP2_from_FP(FP2 *x, FP *a);
+/**	@brief Initialise FP2 from single BIG
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+ */
+extern void FP2_from_BIG(FP2 *x, B448_60::BIG a);
+/**	@brief Copy FP2 to another FP2
+ *
+	@param x FP2 instance, on exit = y
+	@param y FP2 instance to be copied
+ */
+extern void FP2_copy(FP2 *x, FP2 *y);
+/**	@brief Set FP2 to zero
+ *
+	@param x FP2 instance to be set to zero
+ */
+extern void FP2_zero(FP2 *x);
+/**	@brief Set FP2 to unity
+ *
+	@param x FP2 instance to be set to one
+ */
+extern void FP2_one(FP2 *x);
+
+/**	@brief Copy from ROM to an FP2
+ *
+	@param w FP2 number to be copied to
+	@param a BIG real part to be copied from ROM
+	@param b BIG imag part to be copied from ROM
+ */
+extern void FP2_rcopy(FP2 *w,const B448_60::BIG a,const B448_60::BIG b);
+
+/**	@brief Sign of FP2
+ *
+	@param x FP2 instance
+	@return "sign" of FP2
+ */
+extern int FP2_sign(FP2 *x);
+
+/**	@brief Negation of FP2
+ *
+	@param x FP2 instance, on exit = -y
+	@param y FP2 instance
+ */
+extern void FP2_neg(FP2 *x, FP2 *y);
+
+
+/**	@brief Conjugation of FP2
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP2 instance, on exit = conj(y)
+	@param y FP2 instance
+ */
+extern void FP2_conj(FP2 *x, FP2 *y);
+/**	@brief addition of two FP2s
+ *
+	@param x FP2 instance, on exit = y+z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_add(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief subtraction of two FP2s
+ *
+	@param x FP2 instance, on exit = y-z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_sub(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Multiplication of an FP2 by an FP
+ *
+	@param x FP2 instance, on exit = y*b
+	@param y FP2 instance
+	@param b FP residue
+ */
+extern void FP2_pmul(FP2 *x, FP2 *y, FP *b);
+/**	@brief Multiplication of an FP2 by a small integer
+ *
+	@param x FP2 instance, on exit = y*i
+	@param y FP2 instance
+	@param i an integer
+ */
+extern void FP2_imul(FP2 *x, FP2 *y, int i);
+/**	@brief Squaring an FP2
+ *
+	@param x FP2 instance, on exit = y^2
+	@param y FP2 instance
+ */
+extern void FP2_sqr(FP2 *x, FP2 *y);
+/**	@brief Multiplication of two FP2s
+ *
+	@param x FP2 instance, on exit = y*z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_mul(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Formats and outputs an FP2 to the console
+ *
+	@param x FP2 instance
+ */
+extern void FP2_output(FP2 *x);
+/**	@brief Formats and outputs an FP2 to the console in raw form (for debugging)
+ *
+	@param x FP2 instance
+ */
+extern void FP2_rawoutput(FP2 *x);
+/**	@brief Inverting an FP2
+ *
+	@param x FP2 instance, on exit = 1/y
+	@param y FP2 instance
+ */
+extern void FP2_inv(FP2 *x, FP2 *y, FP *h);
+/**	@brief Divide an FP2 by 2
+ *
+	@param x FP2 instance, on exit = y/2
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_div2(FP2 *x, FP2 *y);
+/**	@brief Multiply an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x*(1+sqrt(-1))
+ */
+extern void FP2_mul_ip(FP2 *x);
+
+/**	@brief Divide an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x/(1+sqrt(-1))
+ */
+extern void FP2_div_ip(FP2 *x);
+/**	@brief Normalises the components of an FP2
+ *
+	@param x FP2 instance to be normalised
+ */
+extern void FP2_norm(FP2 *x);
+/**	@brief Reduces all components of possibly unreduced FP2 mod Modulus
+ *
+	@param x FP2 instance, on exit reduced mod Modulus
+ */
+extern void FP2_reduce(FP2 *x);
+/**	@brief Raises an FP2 to the power of a BIG
+ *
+	@param x FP2 instance, on exit = y^b
+	@param y FP2 instance
+	@param b BIG number
+ */
+extern void FP2_pow(FP2 *x, FP2 *y, B448_60::BIG b);
+
+/**	@brief Test FP2 for QR
+ *
+	@param x FP2 instance
+    @param h optional generated hint
+	@return true or false
+ */
+extern int FP2_qr(FP2 *x,FP *h);
+
+
+/**	@brief Square root of an FP2
+ *
+	@param x FP2 instance, on exit = sqrt(y)
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_sqrt(FP2 *x, FP2 *y, FP *h);
+
+/**	@brief Multiply an FP2 by sqrt(-1)
+ *
+	Note that -1 is QNR
+	@param x FP2 instance, on exit = x*sqrt(-1)
+ */
+extern void FP2_times_i(FP2 *x);
+
+/**	@brief Generate random FP2
+ *
+	@param x random FP2 number
+	@param rng random number generator
+ */
+extern void FP2_rand(FP2 *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp2_BLS12461.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp2_BLS12461.h
new file mode 100644
index 0000000..9487af4
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp2_BLS12461.h
@@ -0,0 +1,306 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP2_BLS12461_H
+#define FP2_BLS12461_H
+
+#include "fp_BLS12461.h"
+
+using namespace core;
+
+namespace BLS12461 {
+
+/**
+	@brief FP2 Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    FP a; /**< real part of FP2 */
+    FP b; /**< imaginary part of FP2 */
+} FP2;
+
+/* FP2 prototypes */
+
+/**	@brief Tests for FP2 equal to zero
+ *
+	@param x FP2 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP2_iszilch(FP2 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP2 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP2_islarger(FP2 *x);
+
+
+/**	@brief Serialize out FP2  
+ *
+    @param b buffer for output
+	@param x FP2 number to be serialized
+ */
+extern void FP2_toBytes(char *b,FP2 *x);
+
+/**	@brief Serialize in FP2  
+ *
+	@param x FP2 number to be serialized
+    @param b buffer for input
+ */
+extern void FP2_fromBytes(FP2 *x,char *b);
+
+/**	@brief Conditional copy of FP2 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP2 instance, set to y if s!=0
+	@param y another FP2 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP2_cmove(FP2 *x, FP2 *y, int s);
+/**	@brief Tests for FP2 equal to one
+ *
+	@param x FP2 instance to be tested
+	@return 1 if x=1, else returns 0
+ */
+extern int FP2_isunity(FP2 *x);
+/**	@brief Tests for equality of two FP2s
+ *
+	@param x FP2 instance to be compared
+	@param y FP2 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP2_equals(FP2 *x, FP2 *y);
+/**	@brief Initialise FP2 from two FP numbers
+ *
+	@param x FP2 instance to be initialised
+	@param a FP to form real part of FP2
+	@param b FP to form imaginary part of FP2
+ */
+extern void FP2_from_FPs(FP2 *x, FP *a, FP *b);
+/**	@brief Initialise FP2 from two BIG integers
+ *
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+	@param b BIG to form imaginary part of FP2
+ */
+extern void FP2_from_BIGs(FP2 *x, B464_60::BIG a, B464_60::BIG b);
+
+
+/**	@brief Initialise FP2 from two integers
+ *
+	@param x FP2 instance to be initialised
+	@param a int to form real part of FP2
+	@param b int to form imaginary part of FP2
+ */
+extern void FP2_from_ints(FP2 *x, int a, int b);
+
+
+
+/**	@brief Initialise FP2 from single FP
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param an FP to form real part of FP2
+ */
+extern void FP2_from_FP(FP2 *x, FP *a);
+/**	@brief Initialise FP2 from single BIG
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+ */
+extern void FP2_from_BIG(FP2 *x, B464_60::BIG a);
+/**	@brief Copy FP2 to another FP2
+ *
+	@param x FP2 instance, on exit = y
+	@param y FP2 instance to be copied
+ */
+extern void FP2_copy(FP2 *x, FP2 *y);
+/**	@brief Set FP2 to zero
+ *
+	@param x FP2 instance to be set to zero
+ */
+extern void FP2_zero(FP2 *x);
+/**	@brief Set FP2 to unity
+ *
+	@param x FP2 instance to be set to one
+ */
+extern void FP2_one(FP2 *x);
+
+/**	@brief Copy from ROM to an FP2
+ *
+	@param w FP2 number to be copied to
+	@param a BIG real part to be copied from ROM
+	@param b BIG imag part to be copied from ROM
+ */
+extern void FP2_rcopy(FP2 *w,const B464_60::BIG a,const B464_60::BIG b);
+
+/**	@brief Sign of FP2
+ *
+	@param x FP2 instance
+	@return "sign" of FP2
+ */
+extern int FP2_sign(FP2 *x);
+
+/**	@brief Negation of FP2
+ *
+	@param x FP2 instance, on exit = -y
+	@param y FP2 instance
+ */
+extern void FP2_neg(FP2 *x, FP2 *y);
+
+
+/**	@brief Conjugation of FP2
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP2 instance, on exit = conj(y)
+	@param y FP2 instance
+ */
+extern void FP2_conj(FP2 *x, FP2 *y);
+/**	@brief addition of two FP2s
+ *
+	@param x FP2 instance, on exit = y+z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_add(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief subtraction of two FP2s
+ *
+	@param x FP2 instance, on exit = y-z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_sub(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Multiplication of an FP2 by an FP
+ *
+	@param x FP2 instance, on exit = y*b
+	@param y FP2 instance
+	@param b FP residue
+ */
+extern void FP2_pmul(FP2 *x, FP2 *y, FP *b);
+/**	@brief Multiplication of an FP2 by a small integer
+ *
+	@param x FP2 instance, on exit = y*i
+	@param y FP2 instance
+	@param i an integer
+ */
+extern void FP2_imul(FP2 *x, FP2 *y, int i);
+/**	@brief Squaring an FP2
+ *
+	@param x FP2 instance, on exit = y^2
+	@param y FP2 instance
+ */
+extern void FP2_sqr(FP2 *x, FP2 *y);
+/**	@brief Multiplication of two FP2s
+ *
+	@param x FP2 instance, on exit = y*z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_mul(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Formats and outputs an FP2 to the console
+ *
+	@param x FP2 instance
+ */
+extern void FP2_output(FP2 *x);
+/**	@brief Formats and outputs an FP2 to the console in raw form (for debugging)
+ *
+	@param x FP2 instance
+ */
+extern void FP2_rawoutput(FP2 *x);
+/**	@brief Inverting an FP2
+ *
+	@param x FP2 instance, on exit = 1/y
+	@param y FP2 instance
+ */
+extern void FP2_inv(FP2 *x, FP2 *y, FP *h);
+/**	@brief Divide an FP2 by 2
+ *
+	@param x FP2 instance, on exit = y/2
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_div2(FP2 *x, FP2 *y);
+/**	@brief Multiply an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x*(1+sqrt(-1))
+ */
+extern void FP2_mul_ip(FP2 *x);
+
+/**	@brief Divide an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x/(1+sqrt(-1))
+ */
+extern void FP2_div_ip(FP2 *x);
+/**	@brief Normalises the components of an FP2
+ *
+	@param x FP2 instance to be normalised
+ */
+extern void FP2_norm(FP2 *x);
+/**	@brief Reduces all components of possibly unreduced FP2 mod Modulus
+ *
+	@param x FP2 instance, on exit reduced mod Modulus
+ */
+extern void FP2_reduce(FP2 *x);
+/**	@brief Raises an FP2 to the power of a BIG
+ *
+	@param x FP2 instance, on exit = y^b
+	@param y FP2 instance
+	@param b BIG number
+ */
+extern void FP2_pow(FP2 *x, FP2 *y, B464_60::BIG b);
+
+/**	@brief Test FP2 for QR
+ *
+	@param x FP2 instance
+    @param h optional generated hint
+	@return true or false
+ */
+extern int FP2_qr(FP2 *x,FP *h);
+
+
+/**	@brief Square root of an FP2
+ *
+	@param x FP2 instance, on exit = sqrt(y)
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_sqrt(FP2 *x, FP2 *y, FP *h);
+
+/**	@brief Multiply an FP2 by sqrt(-1)
+ *
+	Note that -1 is QNR
+	@param x FP2 instance, on exit = x*sqrt(-1)
+ */
+extern void FP2_times_i(FP2 *x);
+
+/**	@brief Generate random FP2
+ *
+	@param x random FP2 number
+	@param rng random number generator
+ */
+extern void FP2_rand(FP2 *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp2_BLS24479.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp2_BLS24479.h
new file mode 100644
index 0000000..c4dde22
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp2_BLS24479.h
@@ -0,0 +1,306 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP2_BLS24479_H
+#define FP2_BLS24479_H
+
+#include "fp_BLS24479.h"
+
+using namespace core;
+
+namespace BLS24479 {
+
+/**
+	@brief FP2 Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    FP a; /**< real part of FP2 */
+    FP b; /**< imaginary part of FP2 */
+} FP2;
+
+/* FP2 prototypes */
+
+/**	@brief Tests for FP2 equal to zero
+ *
+	@param x FP2 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP2_iszilch(FP2 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP2 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP2_islarger(FP2 *x);
+
+
+/**	@brief Serialize out FP2  
+ *
+    @param b buffer for output
+	@param x FP2 number to be serialized
+ */
+extern void FP2_toBytes(char *b,FP2 *x);
+
+/**	@brief Serialize in FP2  
+ *
+	@param x FP2 number to be serialized
+    @param b buffer for input
+ */
+extern void FP2_fromBytes(FP2 *x,char *b);
+
+/**	@brief Conditional copy of FP2 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP2 instance, set to y if s!=0
+	@param y another FP2 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP2_cmove(FP2 *x, FP2 *y, int s);
+/**	@brief Tests for FP2 equal to one
+ *
+	@param x FP2 instance to be tested
+	@return 1 if x=1, else returns 0
+ */
+extern int FP2_isunity(FP2 *x);
+/**	@brief Tests for equality of two FP2s
+ *
+	@param x FP2 instance to be compared
+	@param y FP2 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP2_equals(FP2 *x, FP2 *y);
+/**	@brief Initialise FP2 from two FP numbers
+ *
+	@param x FP2 instance to be initialised
+	@param a FP to form real part of FP2
+	@param b FP to form imaginary part of FP2
+ */
+extern void FP2_from_FPs(FP2 *x, FP *a, FP *b);
+/**	@brief Initialise FP2 from two BIG integers
+ *
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+	@param b BIG to form imaginary part of FP2
+ */
+extern void FP2_from_BIGs(FP2 *x, B480_56::BIG a, B480_56::BIG b);
+
+
+/**	@brief Initialise FP2 from two integers
+ *
+	@param x FP2 instance to be initialised
+	@param a int to form real part of FP2
+	@param b int to form imaginary part of FP2
+ */
+extern void FP2_from_ints(FP2 *x, int a, int b);
+
+
+
+/**	@brief Initialise FP2 from single FP
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param an FP to form real part of FP2
+ */
+extern void FP2_from_FP(FP2 *x, FP *a);
+/**	@brief Initialise FP2 from single BIG
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+ */
+extern void FP2_from_BIG(FP2 *x, B480_56::BIG a);
+/**	@brief Copy FP2 to another FP2
+ *
+	@param x FP2 instance, on exit = y
+	@param y FP2 instance to be copied
+ */
+extern void FP2_copy(FP2 *x, FP2 *y);
+/**	@brief Set FP2 to zero
+ *
+	@param x FP2 instance to be set to zero
+ */
+extern void FP2_zero(FP2 *x);
+/**	@brief Set FP2 to unity
+ *
+	@param x FP2 instance to be set to one
+ */
+extern void FP2_one(FP2 *x);
+
+/**	@brief Copy from ROM to an FP2
+ *
+	@param w FP2 number to be copied to
+	@param a BIG real part to be copied from ROM
+	@param b BIG imag part to be copied from ROM
+ */
+extern void FP2_rcopy(FP2 *w,const B480_56::BIG a,const B480_56::BIG b);
+
+/**	@brief Sign of FP2
+ *
+	@param x FP2 instance
+	@return "sign" of FP2
+ */
+extern int FP2_sign(FP2 *x);
+
+/**	@brief Negation of FP2
+ *
+	@param x FP2 instance, on exit = -y
+	@param y FP2 instance
+ */
+extern void FP2_neg(FP2 *x, FP2 *y);
+
+
+/**	@brief Conjugation of FP2
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP2 instance, on exit = conj(y)
+	@param y FP2 instance
+ */
+extern void FP2_conj(FP2 *x, FP2 *y);
+/**	@brief addition of two FP2s
+ *
+	@param x FP2 instance, on exit = y+z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_add(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief subtraction of two FP2s
+ *
+	@param x FP2 instance, on exit = y-z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_sub(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Multiplication of an FP2 by an FP
+ *
+	@param x FP2 instance, on exit = y*b
+	@param y FP2 instance
+	@param b FP residue
+ */
+extern void FP2_pmul(FP2 *x, FP2 *y, FP *b);
+/**	@brief Multiplication of an FP2 by a small integer
+ *
+	@param x FP2 instance, on exit = y*i
+	@param y FP2 instance
+	@param i an integer
+ */
+extern void FP2_imul(FP2 *x, FP2 *y, int i);
+/**	@brief Squaring an FP2
+ *
+	@param x FP2 instance, on exit = y^2
+	@param y FP2 instance
+ */
+extern void FP2_sqr(FP2 *x, FP2 *y);
+/**	@brief Multiplication of two FP2s
+ *
+	@param x FP2 instance, on exit = y*z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_mul(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Formats and outputs an FP2 to the console
+ *
+	@param x FP2 instance
+ */
+extern void FP2_output(FP2 *x);
+/**	@brief Formats and outputs an FP2 to the console in raw form (for debugging)
+ *
+	@param x FP2 instance
+ */
+extern void FP2_rawoutput(FP2 *x);
+/**	@brief Inverting an FP2
+ *
+	@param x FP2 instance, on exit = 1/y
+	@param y FP2 instance
+ */
+extern void FP2_inv(FP2 *x, FP2 *y, FP *h);
+/**	@brief Divide an FP2 by 2
+ *
+	@param x FP2 instance, on exit = y/2
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_div2(FP2 *x, FP2 *y);
+/**	@brief Multiply an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x*(1+sqrt(-1))
+ */
+extern void FP2_mul_ip(FP2 *x);
+
+/**	@brief Divide an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x/(1+sqrt(-1))
+ */
+extern void FP2_div_ip(FP2 *x);
+/**	@brief Normalises the components of an FP2
+ *
+	@param x FP2 instance to be normalised
+ */
+extern void FP2_norm(FP2 *x);
+/**	@brief Reduces all components of possibly unreduced FP2 mod Modulus
+ *
+	@param x FP2 instance, on exit reduced mod Modulus
+ */
+extern void FP2_reduce(FP2 *x);
+/**	@brief Raises an FP2 to the power of a BIG
+ *
+	@param x FP2 instance, on exit = y^b
+	@param y FP2 instance
+	@param b BIG number
+ */
+extern void FP2_pow(FP2 *x, FP2 *y, B480_56::BIG b);
+
+/**	@brief Test FP2 for QR
+ *
+	@param x FP2 instance
+    @param h optional generated hint
+	@return true or false
+ */
+extern int FP2_qr(FP2 *x,FP *h);
+
+
+/**	@brief Square root of an FP2
+ *
+	@param x FP2 instance, on exit = sqrt(y)
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_sqrt(FP2 *x, FP2 *y, FP *h);
+
+/**	@brief Multiply an FP2 by sqrt(-1)
+ *
+	Note that -1 is QNR
+	@param x FP2 instance, on exit = x*sqrt(-1)
+ */
+extern void FP2_times_i(FP2 *x);
+
+/**	@brief Generate random FP2
+ *
+	@param x random FP2 number
+	@param rng random number generator
+ */
+extern void FP2_rand(FP2 *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp2_BLS48286.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp2_BLS48286.h
new file mode 100644
index 0000000..7e15f39
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp2_BLS48286.h
@@ -0,0 +1,306 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP2_BLS48286_H
+#define FP2_BLS48286_H
+
+#include "fp_BLS48286.h"
+
+using namespace core;
+
+namespace BLS48286 {
+
+/**
+	@brief FP2 Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    FP a; /**< real part of FP2 */
+    FP b; /**< imaginary part of FP2 */
+} FP2;
+
+/* FP2 prototypes */
+
+/**	@brief Tests for FP2 equal to zero
+ *
+	@param x FP2 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP2_iszilch(FP2 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP2 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP2_islarger(FP2 *x);
+
+
+/**	@brief Serialize out FP2  
+ *
+    @param b buffer for output
+	@param x FP2 number to be serialized
+ */
+extern void FP2_toBytes(char *b,FP2 *x);
+
+/**	@brief Serialize in FP2  
+ *
+	@param x FP2 number to be serialized
+    @param b buffer for input
+ */
+extern void FP2_fromBytes(FP2 *x,char *b);
+
+/**	@brief Conditional copy of FP2 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP2 instance, set to y if s!=0
+	@param y another FP2 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP2_cmove(FP2 *x, FP2 *y, int s);
+/**	@brief Tests for FP2 equal to one
+ *
+	@param x FP2 instance to be tested
+	@return 1 if x=1, else returns 0
+ */
+extern int FP2_isunity(FP2 *x);
+/**	@brief Tests for equality of two FP2s
+ *
+	@param x FP2 instance to be compared
+	@param y FP2 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP2_equals(FP2 *x, FP2 *y);
+/**	@brief Initialise FP2 from two FP numbers
+ *
+	@param x FP2 instance to be initialised
+	@param a FP to form real part of FP2
+	@param b FP to form imaginary part of FP2
+ */
+extern void FP2_from_FPs(FP2 *x, FP *a, FP *b);
+/**	@brief Initialise FP2 from two BIG integers
+ *
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+	@param b BIG to form imaginary part of FP2
+ */
+extern void FP2_from_BIGs(FP2 *x, B288_60::BIG a, B288_60::BIG b);
+
+
+/**	@brief Initialise FP2 from two integers
+ *
+	@param x FP2 instance to be initialised
+	@param a int to form real part of FP2
+	@param b int to form imaginary part of FP2
+ */
+extern void FP2_from_ints(FP2 *x, int a, int b);
+
+
+
+/**	@brief Initialise FP2 from single FP
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param an FP to form real part of FP2
+ */
+extern void FP2_from_FP(FP2 *x, FP *a);
+/**	@brief Initialise FP2 from single BIG
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+ */
+extern void FP2_from_BIG(FP2 *x, B288_60::BIG a);
+/**	@brief Copy FP2 to another FP2
+ *
+	@param x FP2 instance, on exit = y
+	@param y FP2 instance to be copied
+ */
+extern void FP2_copy(FP2 *x, FP2 *y);
+/**	@brief Set FP2 to zero
+ *
+	@param x FP2 instance to be set to zero
+ */
+extern void FP2_zero(FP2 *x);
+/**	@brief Set FP2 to unity
+ *
+	@param x FP2 instance to be set to one
+ */
+extern void FP2_one(FP2 *x);
+
+/**	@brief Copy from ROM to an FP2
+ *
+	@param w FP2 number to be copied to
+	@param a BIG real part to be copied from ROM
+	@param b BIG imag part to be copied from ROM
+ */
+extern void FP2_rcopy(FP2 *w,const B288_60::BIG a,const B288_60::BIG b);
+
+/**	@brief Sign of FP2
+ *
+	@param x FP2 instance
+	@return "sign" of FP2
+ */
+extern int FP2_sign(FP2 *x);
+
+/**	@brief Negation of FP2
+ *
+	@param x FP2 instance, on exit = -y
+	@param y FP2 instance
+ */
+extern void FP2_neg(FP2 *x, FP2 *y);
+
+
+/**	@brief Conjugation of FP2
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP2 instance, on exit = conj(y)
+	@param y FP2 instance
+ */
+extern void FP2_conj(FP2 *x, FP2 *y);
+/**	@brief addition of two FP2s
+ *
+	@param x FP2 instance, on exit = y+z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_add(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief subtraction of two FP2s
+ *
+	@param x FP2 instance, on exit = y-z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_sub(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Multiplication of an FP2 by an FP
+ *
+	@param x FP2 instance, on exit = y*b
+	@param y FP2 instance
+	@param b FP residue
+ */
+extern void FP2_pmul(FP2 *x, FP2 *y, FP *b);
+/**	@brief Multiplication of an FP2 by a small integer
+ *
+	@param x FP2 instance, on exit = y*i
+	@param y FP2 instance
+	@param i an integer
+ */
+extern void FP2_imul(FP2 *x, FP2 *y, int i);
+/**	@brief Squaring an FP2
+ *
+	@param x FP2 instance, on exit = y^2
+	@param y FP2 instance
+ */
+extern void FP2_sqr(FP2 *x, FP2 *y);
+/**	@brief Multiplication of two FP2s
+ *
+	@param x FP2 instance, on exit = y*z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_mul(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Formats and outputs an FP2 to the console
+ *
+	@param x FP2 instance
+ */
+extern void FP2_output(FP2 *x);
+/**	@brief Formats and outputs an FP2 to the console in raw form (for debugging)
+ *
+	@param x FP2 instance
+ */
+extern void FP2_rawoutput(FP2 *x);
+/**	@brief Inverting an FP2
+ *
+	@param x FP2 instance, on exit = 1/y
+	@param y FP2 instance
+ */
+extern void FP2_inv(FP2 *x, FP2 *y, FP *h);
+/**	@brief Divide an FP2 by 2
+ *
+	@param x FP2 instance, on exit = y/2
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_div2(FP2 *x, FP2 *y);
+/**	@brief Multiply an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x*(1+sqrt(-1))
+ */
+extern void FP2_mul_ip(FP2 *x);
+
+/**	@brief Divide an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x/(1+sqrt(-1))
+ */
+extern void FP2_div_ip(FP2 *x);
+/**	@brief Normalises the components of an FP2
+ *
+	@param x FP2 instance to be normalised
+ */
+extern void FP2_norm(FP2 *x);
+/**	@brief Reduces all components of possibly unreduced FP2 mod Modulus
+ *
+	@param x FP2 instance, on exit reduced mod Modulus
+ */
+extern void FP2_reduce(FP2 *x);
+/**	@brief Raises an FP2 to the power of a BIG
+ *
+	@param x FP2 instance, on exit = y^b
+	@param y FP2 instance
+	@param b BIG number
+ */
+extern void FP2_pow(FP2 *x, FP2 *y, B288_60::BIG b);
+
+/**	@brief Test FP2 for QR
+ *
+	@param x FP2 instance
+    @param h optional generated hint
+	@return true or false
+ */
+extern int FP2_qr(FP2 *x,FP *h);
+
+
+/**	@brief Square root of an FP2
+ *
+	@param x FP2 instance, on exit = sqrt(y)
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_sqrt(FP2 *x, FP2 *y, FP *h);
+
+/**	@brief Multiply an FP2 by sqrt(-1)
+ *
+	Note that -1 is QNR
+	@param x FP2 instance, on exit = x*sqrt(-1)
+ */
+extern void FP2_times_i(FP2 *x);
+
+/**	@brief Generate random FP2
+ *
+	@param x random FP2 number
+	@param rng random number generator
+ */
+extern void FP2_rand(FP2 *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp2_BLS48556.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp2_BLS48556.h
new file mode 100644
index 0000000..665019b
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp2_BLS48556.h
@@ -0,0 +1,306 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP2_BLS48556_H
+#define FP2_BLS48556_H
+
+#include "fp_BLS48556.h"
+
+using namespace core;
+
+namespace BLS48556 {
+
+/**
+	@brief FP2 Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    FP a; /**< real part of FP2 */
+    FP b; /**< imaginary part of FP2 */
+} FP2;
+
+/* FP2 prototypes */
+
+/**	@brief Tests for FP2 equal to zero
+ *
+	@param x FP2 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP2_iszilch(FP2 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP2 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP2_islarger(FP2 *x);
+
+
+/**	@brief Serialize out FP2  
+ *
+    @param b buffer for output
+	@param x FP2 number to be serialized
+ */
+extern void FP2_toBytes(char *b,FP2 *x);
+
+/**	@brief Serialize in FP2  
+ *
+	@param x FP2 number to be serialized
+    @param b buffer for input
+ */
+extern void FP2_fromBytes(FP2 *x,char *b);
+
+/**	@brief Conditional copy of FP2 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP2 instance, set to y if s!=0
+	@param y another FP2 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP2_cmove(FP2 *x, FP2 *y, int s);
+/**	@brief Tests for FP2 equal to one
+ *
+	@param x FP2 instance to be tested
+	@return 1 if x=1, else returns 0
+ */
+extern int FP2_isunity(FP2 *x);
+/**	@brief Tests for equality of two FP2s
+ *
+	@param x FP2 instance to be compared
+	@param y FP2 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP2_equals(FP2 *x, FP2 *y);
+/**	@brief Initialise FP2 from two FP numbers
+ *
+	@param x FP2 instance to be initialised
+	@param a FP to form real part of FP2
+	@param b FP to form imaginary part of FP2
+ */
+extern void FP2_from_FPs(FP2 *x, FP *a, FP *b);
+/**	@brief Initialise FP2 from two BIG integers
+ *
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+	@param b BIG to form imaginary part of FP2
+ */
+extern void FP2_from_BIGs(FP2 *x, B560_58::BIG a, B560_58::BIG b);
+
+
+/**	@brief Initialise FP2 from two integers
+ *
+	@param x FP2 instance to be initialised
+	@param a int to form real part of FP2
+	@param b int to form imaginary part of FP2
+ */
+extern void FP2_from_ints(FP2 *x, int a, int b);
+
+
+
+/**	@brief Initialise FP2 from single FP
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param an FP to form real part of FP2
+ */
+extern void FP2_from_FP(FP2 *x, FP *a);
+/**	@brief Initialise FP2 from single BIG
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+ */
+extern void FP2_from_BIG(FP2 *x, B560_58::BIG a);
+/**	@brief Copy FP2 to another FP2
+ *
+	@param x FP2 instance, on exit = y
+	@param y FP2 instance to be copied
+ */
+extern void FP2_copy(FP2 *x, FP2 *y);
+/**	@brief Set FP2 to zero
+ *
+	@param x FP2 instance to be set to zero
+ */
+extern void FP2_zero(FP2 *x);
+/**	@brief Set FP2 to unity
+ *
+	@param x FP2 instance to be set to one
+ */
+extern void FP2_one(FP2 *x);
+
+/**	@brief Copy from ROM to an FP2
+ *
+	@param w FP2 number to be copied to
+	@param a BIG real part to be copied from ROM
+	@param b BIG imag part to be copied from ROM
+ */
+extern void FP2_rcopy(FP2 *w,const B560_58::BIG a,const B560_58::BIG b);
+
+/**	@brief Sign of FP2
+ *
+	@param x FP2 instance
+	@return "sign" of FP2
+ */
+extern int FP2_sign(FP2 *x);
+
+/**	@brief Negation of FP2
+ *
+	@param x FP2 instance, on exit = -y
+	@param y FP2 instance
+ */
+extern void FP2_neg(FP2 *x, FP2 *y);
+
+
+/**	@brief Conjugation of FP2
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP2 instance, on exit = conj(y)
+	@param y FP2 instance
+ */
+extern void FP2_conj(FP2 *x, FP2 *y);
+/**	@brief addition of two FP2s
+ *
+	@param x FP2 instance, on exit = y+z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_add(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief subtraction of two FP2s
+ *
+	@param x FP2 instance, on exit = y-z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_sub(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Multiplication of an FP2 by an FP
+ *
+	@param x FP2 instance, on exit = y*b
+	@param y FP2 instance
+	@param b FP residue
+ */
+extern void FP2_pmul(FP2 *x, FP2 *y, FP *b);
+/**	@brief Multiplication of an FP2 by a small integer
+ *
+	@param x FP2 instance, on exit = y*i
+	@param y FP2 instance
+	@param i an integer
+ */
+extern void FP2_imul(FP2 *x, FP2 *y, int i);
+/**	@brief Squaring an FP2
+ *
+	@param x FP2 instance, on exit = y^2
+	@param y FP2 instance
+ */
+extern void FP2_sqr(FP2 *x, FP2 *y);
+/**	@brief Multiplication of two FP2s
+ *
+	@param x FP2 instance, on exit = y*z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_mul(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Formats and outputs an FP2 to the console
+ *
+	@param x FP2 instance
+ */
+extern void FP2_output(FP2 *x);
+/**	@brief Formats and outputs an FP2 to the console in raw form (for debugging)
+ *
+	@param x FP2 instance
+ */
+extern void FP2_rawoutput(FP2 *x);
+/**	@brief Inverting an FP2
+ *
+	@param x FP2 instance, on exit = 1/y
+	@param y FP2 instance
+ */
+extern void FP2_inv(FP2 *x, FP2 *y, FP *h);
+/**	@brief Divide an FP2 by 2
+ *
+	@param x FP2 instance, on exit = y/2
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_div2(FP2 *x, FP2 *y);
+/**	@brief Multiply an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x*(1+sqrt(-1))
+ */
+extern void FP2_mul_ip(FP2 *x);
+
+/**	@brief Divide an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x/(1+sqrt(-1))
+ */
+extern void FP2_div_ip(FP2 *x);
+/**	@brief Normalises the components of an FP2
+ *
+	@param x FP2 instance to be normalised
+ */
+extern void FP2_norm(FP2 *x);
+/**	@brief Reduces all components of possibly unreduced FP2 mod Modulus
+ *
+	@param x FP2 instance, on exit reduced mod Modulus
+ */
+extern void FP2_reduce(FP2 *x);
+/**	@brief Raises an FP2 to the power of a BIG
+ *
+	@param x FP2 instance, on exit = y^b
+	@param y FP2 instance
+	@param b BIG number
+ */
+extern void FP2_pow(FP2 *x, FP2 *y, B560_58::BIG b);
+
+/**	@brief Test FP2 for QR
+ *
+	@param x FP2 instance
+    @param h optional generated hint
+	@return true or false
+ */
+extern int FP2_qr(FP2 *x,FP *h);
+
+
+/**	@brief Square root of an FP2
+ *
+	@param x FP2 instance, on exit = sqrt(y)
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_sqrt(FP2 *x, FP2 *y, FP *h);
+
+/**	@brief Multiply an FP2 by sqrt(-1)
+ *
+	Note that -1 is QNR
+	@param x FP2 instance, on exit = x*sqrt(-1)
+ */
+extern void FP2_times_i(FP2 *x);
+
+/**	@brief Generate random FP2
+ *
+	@param x random FP2 number
+	@param rng random number generator
+ */
+extern void FP2_rand(FP2 *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp2_BLS48581.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp2_BLS48581.h
new file mode 100644
index 0000000..b410455
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp2_BLS48581.h
@@ -0,0 +1,306 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP2_BLS48581_H
+#define FP2_BLS48581_H
+
+#include "fp_BLS48581.h"
+
+using namespace core;
+
+namespace BLS48581 {
+
+/**
+	@brief FP2 Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    FP a; /**< real part of FP2 */
+    FP b; /**< imaginary part of FP2 */
+} FP2;
+
+/* FP2 prototypes */
+
+/**	@brief Tests for FP2 equal to zero
+ *
+	@param x FP2 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP2_iszilch(FP2 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP2 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP2_islarger(FP2 *x);
+
+
+/**	@brief Serialize out FP2  
+ *
+    @param b buffer for output
+	@param x FP2 number to be serialized
+ */
+extern void FP2_toBytes(char *b,FP2 *x);
+
+/**	@brief Serialize in FP2  
+ *
+	@param x FP2 number to be serialized
+    @param b buffer for input
+ */
+extern void FP2_fromBytes(FP2 *x,char *b);
+
+/**	@brief Conditional copy of FP2 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP2 instance, set to y if s!=0
+	@param y another FP2 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP2_cmove(FP2 *x, FP2 *y, int s);
+/**	@brief Tests for FP2 equal to one
+ *
+	@param x FP2 instance to be tested
+	@return 1 if x=1, else returns 0
+ */
+extern int FP2_isunity(FP2 *x);
+/**	@brief Tests for equality of two FP2s
+ *
+	@param x FP2 instance to be compared
+	@param y FP2 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP2_equals(FP2 *x, FP2 *y);
+/**	@brief Initialise FP2 from two FP numbers
+ *
+	@param x FP2 instance to be initialised
+	@param a FP to form real part of FP2
+	@param b FP to form imaginary part of FP2
+ */
+extern void FP2_from_FPs(FP2 *x, FP *a, FP *b);
+/**	@brief Initialise FP2 from two BIG integers
+ *
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+	@param b BIG to form imaginary part of FP2
+ */
+extern void FP2_from_BIGs(FP2 *x, B584_60::BIG a, B584_60::BIG b);
+
+
+/**	@brief Initialise FP2 from two integers
+ *
+	@param x FP2 instance to be initialised
+	@param a int to form real part of FP2
+	@param b int to form imaginary part of FP2
+ */
+extern void FP2_from_ints(FP2 *x, int a, int b);
+
+
+
+/**	@brief Initialise FP2 from single FP
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param an FP to form real part of FP2
+ */
+extern void FP2_from_FP(FP2 *x, FP *a);
+/**	@brief Initialise FP2 from single BIG
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+ */
+extern void FP2_from_BIG(FP2 *x, B584_60::BIG a);
+/**	@brief Copy FP2 to another FP2
+ *
+	@param x FP2 instance, on exit = y
+	@param y FP2 instance to be copied
+ */
+extern void FP2_copy(FP2 *x, FP2 *y);
+/**	@brief Set FP2 to zero
+ *
+	@param x FP2 instance to be set to zero
+ */
+extern void FP2_zero(FP2 *x);
+/**	@brief Set FP2 to unity
+ *
+	@param x FP2 instance to be set to one
+ */
+extern void FP2_one(FP2 *x);
+
+/**	@brief Copy from ROM to an FP2
+ *
+	@param w FP2 number to be copied to
+	@param a BIG real part to be copied from ROM
+	@param b BIG imag part to be copied from ROM
+ */
+extern void FP2_rcopy(FP2 *w,const B584_60::BIG a,const B584_60::BIG b);
+
+/**	@brief Sign of FP2
+ *
+	@param x FP2 instance
+	@return "sign" of FP2
+ */
+extern int FP2_sign(FP2 *x);
+
+/**	@brief Negation of FP2
+ *
+	@param x FP2 instance, on exit = -y
+	@param y FP2 instance
+ */
+extern void FP2_neg(FP2 *x, FP2 *y);
+
+
+/**	@brief Conjugation of FP2
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP2 instance, on exit = conj(y)
+	@param y FP2 instance
+ */
+extern void FP2_conj(FP2 *x, FP2 *y);
+/**	@brief addition of two FP2s
+ *
+	@param x FP2 instance, on exit = y+z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_add(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief subtraction of two FP2s
+ *
+	@param x FP2 instance, on exit = y-z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_sub(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Multiplication of an FP2 by an FP
+ *
+	@param x FP2 instance, on exit = y*b
+	@param y FP2 instance
+	@param b FP residue
+ */
+extern void FP2_pmul(FP2 *x, FP2 *y, FP *b);
+/**	@brief Multiplication of an FP2 by a small integer
+ *
+	@param x FP2 instance, on exit = y*i
+	@param y FP2 instance
+	@param i an integer
+ */
+extern void FP2_imul(FP2 *x, FP2 *y, int i);
+/**	@brief Squaring an FP2
+ *
+	@param x FP2 instance, on exit = y^2
+	@param y FP2 instance
+ */
+extern void FP2_sqr(FP2 *x, FP2 *y);
+/**	@brief Multiplication of two FP2s
+ *
+	@param x FP2 instance, on exit = y*z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_mul(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Formats and outputs an FP2 to the console
+ *
+	@param x FP2 instance
+ */
+extern void FP2_output(FP2 *x);
+/**	@brief Formats and outputs an FP2 to the console in raw form (for debugging)
+ *
+	@param x FP2 instance
+ */
+extern void FP2_rawoutput(FP2 *x);
+/**	@brief Inverting an FP2
+ *
+	@param x FP2 instance, on exit = 1/y
+	@param y FP2 instance
+ */
+extern void FP2_inv(FP2 *x, FP2 *y, FP *h);
+/**	@brief Divide an FP2 by 2
+ *
+	@param x FP2 instance, on exit = y/2
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_div2(FP2 *x, FP2 *y);
+/**	@brief Multiply an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x*(1+sqrt(-1))
+ */
+extern void FP2_mul_ip(FP2 *x);
+
+/**	@brief Divide an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x/(1+sqrt(-1))
+ */
+extern void FP2_div_ip(FP2 *x);
+/**	@brief Normalises the components of an FP2
+ *
+	@param x FP2 instance to be normalised
+ */
+extern void FP2_norm(FP2 *x);
+/**	@brief Reduces all components of possibly unreduced FP2 mod Modulus
+ *
+	@param x FP2 instance, on exit reduced mod Modulus
+ */
+extern void FP2_reduce(FP2 *x);
+/**	@brief Raises an FP2 to the power of a BIG
+ *
+	@param x FP2 instance, on exit = y^b
+	@param y FP2 instance
+	@param b BIG number
+ */
+extern void FP2_pow(FP2 *x, FP2 *y, B584_60::BIG b);
+
+/**	@brief Test FP2 for QR
+ *
+	@param x FP2 instance
+    @param h optional generated hint
+	@return true or false
+ */
+extern int FP2_qr(FP2 *x,FP *h);
+
+
+/**	@brief Square root of an FP2
+ *
+	@param x FP2 instance, on exit = sqrt(y)
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_sqrt(FP2 *x, FP2 *y, FP *h);
+
+/**	@brief Multiply an FP2 by sqrt(-1)
+ *
+	Note that -1 is QNR
+	@param x FP2 instance, on exit = x*sqrt(-1)
+ */
+extern void FP2_times_i(FP2 *x);
+
+/**	@brief Generate random FP2
+ *
+	@param x random FP2 number
+	@param rng random number generator
+ */
+extern void FP2_rand(FP2 *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp2_BN158.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp2_BN158.h
new file mode 100644
index 0000000..3a289b5
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp2_BN158.h
@@ -0,0 +1,306 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP2_BN158_H
+#define FP2_BN158_H
+
+#include "fp_BN158.h"
+
+using namespace core;
+
+namespace BN158 {
+
+/**
+	@brief FP2 Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    FP a; /**< real part of FP2 */
+    FP b; /**< imaginary part of FP2 */
+} FP2;
+
+/* FP2 prototypes */
+
+/**	@brief Tests for FP2 equal to zero
+ *
+	@param x FP2 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP2_iszilch(FP2 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP2 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP2_islarger(FP2 *x);
+
+
+/**	@brief Serialize out FP2  
+ *
+    @param b buffer for output
+	@param x FP2 number to be serialized
+ */
+extern void FP2_toBytes(char *b,FP2 *x);
+
+/**	@brief Serialize in FP2  
+ *
+	@param x FP2 number to be serialized
+    @param b buffer for input
+ */
+extern void FP2_fromBytes(FP2 *x,char *b);
+
+/**	@brief Conditional copy of FP2 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP2 instance, set to y if s!=0
+	@param y another FP2 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP2_cmove(FP2 *x, FP2 *y, int s);
+/**	@brief Tests for FP2 equal to one
+ *
+	@param x FP2 instance to be tested
+	@return 1 if x=1, else returns 0
+ */
+extern int FP2_isunity(FP2 *x);
+/**	@brief Tests for equality of two FP2s
+ *
+	@param x FP2 instance to be compared
+	@param y FP2 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP2_equals(FP2 *x, FP2 *y);
+/**	@brief Initialise FP2 from two FP numbers
+ *
+	@param x FP2 instance to be initialised
+	@param a FP to form real part of FP2
+	@param b FP to form imaginary part of FP2
+ */
+extern void FP2_from_FPs(FP2 *x, FP *a, FP *b);
+/**	@brief Initialise FP2 from two BIG integers
+ *
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+	@param b BIG to form imaginary part of FP2
+ */
+extern void FP2_from_BIGs(FP2 *x, B160_56::BIG a, B160_56::BIG b);
+
+
+/**	@brief Initialise FP2 from two integers
+ *
+	@param x FP2 instance to be initialised
+	@param a int to form real part of FP2
+	@param b int to form imaginary part of FP2
+ */
+extern void FP2_from_ints(FP2 *x, int a, int b);
+
+
+
+/**	@brief Initialise FP2 from single FP
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param an FP to form real part of FP2
+ */
+extern void FP2_from_FP(FP2 *x, FP *a);
+/**	@brief Initialise FP2 from single BIG
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+ */
+extern void FP2_from_BIG(FP2 *x, B160_56::BIG a);
+/**	@brief Copy FP2 to another FP2
+ *
+	@param x FP2 instance, on exit = y
+	@param y FP2 instance to be copied
+ */
+extern void FP2_copy(FP2 *x, FP2 *y);
+/**	@brief Set FP2 to zero
+ *
+	@param x FP2 instance to be set to zero
+ */
+extern void FP2_zero(FP2 *x);
+/**	@brief Set FP2 to unity
+ *
+	@param x FP2 instance to be set to one
+ */
+extern void FP2_one(FP2 *x);
+
+/**	@brief Copy from ROM to an FP2
+ *
+	@param w FP2 number to be copied to
+	@param a BIG real part to be copied from ROM
+	@param b BIG imag part to be copied from ROM
+ */
+extern void FP2_rcopy(FP2 *w,const B160_56::BIG a,const B160_56::BIG b);
+
+/**	@brief Sign of FP2
+ *
+	@param x FP2 instance
+	@return "sign" of FP2
+ */
+extern int FP2_sign(FP2 *x);
+
+/**	@brief Negation of FP2
+ *
+	@param x FP2 instance, on exit = -y
+	@param y FP2 instance
+ */
+extern void FP2_neg(FP2 *x, FP2 *y);
+
+
+/**	@brief Conjugation of FP2
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP2 instance, on exit = conj(y)
+	@param y FP2 instance
+ */
+extern void FP2_conj(FP2 *x, FP2 *y);
+/**	@brief addition of two FP2s
+ *
+	@param x FP2 instance, on exit = y+z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_add(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief subtraction of two FP2s
+ *
+	@param x FP2 instance, on exit = y-z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_sub(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Multiplication of an FP2 by an FP
+ *
+	@param x FP2 instance, on exit = y*b
+	@param y FP2 instance
+	@param b FP residue
+ */
+extern void FP2_pmul(FP2 *x, FP2 *y, FP *b);
+/**	@brief Multiplication of an FP2 by a small integer
+ *
+	@param x FP2 instance, on exit = y*i
+	@param y FP2 instance
+	@param i an integer
+ */
+extern void FP2_imul(FP2 *x, FP2 *y, int i);
+/**	@brief Squaring an FP2
+ *
+	@param x FP2 instance, on exit = y^2
+	@param y FP2 instance
+ */
+extern void FP2_sqr(FP2 *x, FP2 *y);
+/**	@brief Multiplication of two FP2s
+ *
+	@param x FP2 instance, on exit = y*z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_mul(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Formats and outputs an FP2 to the console
+ *
+	@param x FP2 instance
+ */
+extern void FP2_output(FP2 *x);
+/**	@brief Formats and outputs an FP2 to the console in raw form (for debugging)
+ *
+	@param x FP2 instance
+ */
+extern void FP2_rawoutput(FP2 *x);
+/**	@brief Inverting an FP2
+ *
+	@param x FP2 instance, on exit = 1/y
+	@param y FP2 instance
+ */
+extern void FP2_inv(FP2 *x, FP2 *y, FP *h);
+/**	@brief Divide an FP2 by 2
+ *
+	@param x FP2 instance, on exit = y/2
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_div2(FP2 *x, FP2 *y);
+/**	@brief Multiply an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x*(1+sqrt(-1))
+ */
+extern void FP2_mul_ip(FP2 *x);
+
+/**	@brief Divide an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x/(1+sqrt(-1))
+ */
+extern void FP2_div_ip(FP2 *x);
+/**	@brief Normalises the components of an FP2
+ *
+	@param x FP2 instance to be normalised
+ */
+extern void FP2_norm(FP2 *x);
+/**	@brief Reduces all components of possibly unreduced FP2 mod Modulus
+ *
+	@param x FP2 instance, on exit reduced mod Modulus
+ */
+extern void FP2_reduce(FP2 *x);
+/**	@brief Raises an FP2 to the power of a BIG
+ *
+	@param x FP2 instance, on exit = y^b
+	@param y FP2 instance
+	@param b BIG number
+ */
+extern void FP2_pow(FP2 *x, FP2 *y, B160_56::BIG b);
+
+/**	@brief Test FP2 for QR
+ *
+	@param x FP2 instance
+    @param h optional generated hint
+	@return true or false
+ */
+extern int FP2_qr(FP2 *x,FP *h);
+
+
+/**	@brief Square root of an FP2
+ *
+	@param x FP2 instance, on exit = sqrt(y)
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_sqrt(FP2 *x, FP2 *y, FP *h);
+
+/**	@brief Multiply an FP2 by sqrt(-1)
+ *
+	Note that -1 is QNR
+	@param x FP2 instance, on exit = x*sqrt(-1)
+ */
+extern void FP2_times_i(FP2 *x);
+
+/**	@brief Generate random FP2
+ *
+	@param x random FP2 number
+	@param rng random number generator
+ */
+extern void FP2_rand(FP2 *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp2_BN254.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp2_BN254.h
new file mode 100644
index 0000000..e548c25
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp2_BN254.h
@@ -0,0 +1,306 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP2_BN254_H
+#define FP2_BN254_H
+
+#include "fp_BN254.h"
+
+using namespace core;
+
+namespace BN254 {
+
+/**
+	@brief FP2 Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    FP a; /**< real part of FP2 */
+    FP b; /**< imaginary part of FP2 */
+} FP2;
+
+/* FP2 prototypes */
+
+/**	@brief Tests for FP2 equal to zero
+ *
+	@param x FP2 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP2_iszilch(FP2 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP2 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP2_islarger(FP2 *x);
+
+
+/**	@brief Serialize out FP2  
+ *
+    @param b buffer for output
+	@param x FP2 number to be serialized
+ */
+extern void FP2_toBytes(char *b,FP2 *x);
+
+/**	@brief Serialize in FP2  
+ *
+	@param x FP2 number to be serialized
+    @param b buffer for input
+ */
+extern void FP2_fromBytes(FP2 *x,char *b);
+
+/**	@brief Conditional copy of FP2 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP2 instance, set to y if s!=0
+	@param y another FP2 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP2_cmove(FP2 *x, FP2 *y, int s);
+/**	@brief Tests for FP2 equal to one
+ *
+	@param x FP2 instance to be tested
+	@return 1 if x=1, else returns 0
+ */
+extern int FP2_isunity(FP2 *x);
+/**	@brief Tests for equality of two FP2s
+ *
+	@param x FP2 instance to be compared
+	@param y FP2 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP2_equals(FP2 *x, FP2 *y);
+/**	@brief Initialise FP2 from two FP numbers
+ *
+	@param x FP2 instance to be initialised
+	@param a FP to form real part of FP2
+	@param b FP to form imaginary part of FP2
+ */
+extern void FP2_from_FPs(FP2 *x, FP *a, FP *b);
+/**	@brief Initialise FP2 from two BIG integers
+ *
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+	@param b BIG to form imaginary part of FP2
+ */
+extern void FP2_from_BIGs(FP2 *x, B256_56::BIG a, B256_56::BIG b);
+
+
+/**	@brief Initialise FP2 from two integers
+ *
+	@param x FP2 instance to be initialised
+	@param a int to form real part of FP2
+	@param b int to form imaginary part of FP2
+ */
+extern void FP2_from_ints(FP2 *x, int a, int b);
+
+
+
+/**	@brief Initialise FP2 from single FP
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param an FP to form real part of FP2
+ */
+extern void FP2_from_FP(FP2 *x, FP *a);
+/**	@brief Initialise FP2 from single BIG
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+ */
+extern void FP2_from_BIG(FP2 *x, B256_56::BIG a);
+/**	@brief Copy FP2 to another FP2
+ *
+	@param x FP2 instance, on exit = y
+	@param y FP2 instance to be copied
+ */
+extern void FP2_copy(FP2 *x, FP2 *y);
+/**	@brief Set FP2 to zero
+ *
+	@param x FP2 instance to be set to zero
+ */
+extern void FP2_zero(FP2 *x);
+/**	@brief Set FP2 to unity
+ *
+	@param x FP2 instance to be set to one
+ */
+extern void FP2_one(FP2 *x);
+
+/**	@brief Copy from ROM to an FP2
+ *
+	@param w FP2 number to be copied to
+	@param a BIG real part to be copied from ROM
+	@param b BIG imag part to be copied from ROM
+ */
+extern void FP2_rcopy(FP2 *w,const B256_56::BIG a,const B256_56::BIG b);
+
+/**	@brief Sign of FP2
+ *
+	@param x FP2 instance
+	@return "sign" of FP2
+ */
+extern int FP2_sign(FP2 *x);
+
+/**	@brief Negation of FP2
+ *
+	@param x FP2 instance, on exit = -y
+	@param y FP2 instance
+ */
+extern void FP2_neg(FP2 *x, FP2 *y);
+
+
+/**	@brief Conjugation of FP2
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP2 instance, on exit = conj(y)
+	@param y FP2 instance
+ */
+extern void FP2_conj(FP2 *x, FP2 *y);
+/**	@brief addition of two FP2s
+ *
+	@param x FP2 instance, on exit = y+z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_add(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief subtraction of two FP2s
+ *
+	@param x FP2 instance, on exit = y-z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_sub(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Multiplication of an FP2 by an FP
+ *
+	@param x FP2 instance, on exit = y*b
+	@param y FP2 instance
+	@param b FP residue
+ */
+extern void FP2_pmul(FP2 *x, FP2 *y, FP *b);
+/**	@brief Multiplication of an FP2 by a small integer
+ *
+	@param x FP2 instance, on exit = y*i
+	@param y FP2 instance
+	@param i an integer
+ */
+extern void FP2_imul(FP2 *x, FP2 *y, int i);
+/**	@brief Squaring an FP2
+ *
+	@param x FP2 instance, on exit = y^2
+	@param y FP2 instance
+ */
+extern void FP2_sqr(FP2 *x, FP2 *y);
+/**	@brief Multiplication of two FP2s
+ *
+	@param x FP2 instance, on exit = y*z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_mul(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Formats and outputs an FP2 to the console
+ *
+	@param x FP2 instance
+ */
+extern void FP2_output(FP2 *x);
+/**	@brief Formats and outputs an FP2 to the console in raw form (for debugging)
+ *
+	@param x FP2 instance
+ */
+extern void FP2_rawoutput(FP2 *x);
+/**	@brief Inverting an FP2
+ *
+	@param x FP2 instance, on exit = 1/y
+	@param y FP2 instance
+ */
+extern void FP2_inv(FP2 *x, FP2 *y, FP *h);
+/**	@brief Divide an FP2 by 2
+ *
+	@param x FP2 instance, on exit = y/2
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_div2(FP2 *x, FP2 *y);
+/**	@brief Multiply an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x*(1+sqrt(-1))
+ */
+extern void FP2_mul_ip(FP2 *x);
+
+/**	@brief Divide an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x/(1+sqrt(-1))
+ */
+extern void FP2_div_ip(FP2 *x);
+/**	@brief Normalises the components of an FP2
+ *
+	@param x FP2 instance to be normalised
+ */
+extern void FP2_norm(FP2 *x);
+/**	@brief Reduces all components of possibly unreduced FP2 mod Modulus
+ *
+	@param x FP2 instance, on exit reduced mod Modulus
+ */
+extern void FP2_reduce(FP2 *x);
+/**	@brief Raises an FP2 to the power of a BIG
+ *
+	@param x FP2 instance, on exit = y^b
+	@param y FP2 instance
+	@param b BIG number
+ */
+extern void FP2_pow(FP2 *x, FP2 *y, B256_56::BIG b);
+
+/**	@brief Test FP2 for QR
+ *
+	@param x FP2 instance
+    @param h optional generated hint
+	@return true or false
+ */
+extern int FP2_qr(FP2 *x,FP *h);
+
+
+/**	@brief Square root of an FP2
+ *
+	@param x FP2 instance, on exit = sqrt(y)
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_sqrt(FP2 *x, FP2 *y, FP *h);
+
+/**	@brief Multiply an FP2 by sqrt(-1)
+ *
+	Note that -1 is QNR
+	@param x FP2 instance, on exit = x*sqrt(-1)
+ */
+extern void FP2_times_i(FP2 *x);
+
+/**	@brief Generate random FP2
+ *
+	@param x random FP2 number
+	@param rng random number generator
+ */
+extern void FP2_rand(FP2 *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp2_BN254CX.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp2_BN254CX.h
new file mode 100644
index 0000000..3b84e46
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp2_BN254CX.h
@@ -0,0 +1,306 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP2_BN254CX_H
+#define FP2_BN254CX_H
+
+#include "fp_BN254CX.h"
+
+using namespace core;
+
+namespace BN254CX {
+
+/**
+	@brief FP2 Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    FP a; /**< real part of FP2 */
+    FP b; /**< imaginary part of FP2 */
+} FP2;
+
+/* FP2 prototypes */
+
+/**	@brief Tests for FP2 equal to zero
+ *
+	@param x FP2 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP2_iszilch(FP2 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP2 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP2_islarger(FP2 *x);
+
+
+/**	@brief Serialize out FP2  
+ *
+    @param b buffer for output
+	@param x FP2 number to be serialized
+ */
+extern void FP2_toBytes(char *b,FP2 *x);
+
+/**	@brief Serialize in FP2  
+ *
+	@param x FP2 number to be serialized
+    @param b buffer for input
+ */
+extern void FP2_fromBytes(FP2 *x,char *b);
+
+/**	@brief Conditional copy of FP2 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP2 instance, set to y if s!=0
+	@param y another FP2 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP2_cmove(FP2 *x, FP2 *y, int s);
+/**	@brief Tests for FP2 equal to one
+ *
+	@param x FP2 instance to be tested
+	@return 1 if x=1, else returns 0
+ */
+extern int FP2_isunity(FP2 *x);
+/**	@brief Tests for equality of two FP2s
+ *
+	@param x FP2 instance to be compared
+	@param y FP2 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP2_equals(FP2 *x, FP2 *y);
+/**	@brief Initialise FP2 from two FP numbers
+ *
+	@param x FP2 instance to be initialised
+	@param a FP to form real part of FP2
+	@param b FP to form imaginary part of FP2
+ */
+extern void FP2_from_FPs(FP2 *x, FP *a, FP *b);
+/**	@brief Initialise FP2 from two BIG integers
+ *
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+	@param b BIG to form imaginary part of FP2
+ */
+extern void FP2_from_BIGs(FP2 *x, B256_56::BIG a, B256_56::BIG b);
+
+
+/**	@brief Initialise FP2 from two integers
+ *
+	@param x FP2 instance to be initialised
+	@param a int to form real part of FP2
+	@param b int to form imaginary part of FP2
+ */
+extern void FP2_from_ints(FP2 *x, int a, int b);
+
+
+
+/**	@brief Initialise FP2 from single FP
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param an FP to form real part of FP2
+ */
+extern void FP2_from_FP(FP2 *x, FP *a);
+/**	@brief Initialise FP2 from single BIG
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+ */
+extern void FP2_from_BIG(FP2 *x, B256_56::BIG a);
+/**	@brief Copy FP2 to another FP2
+ *
+	@param x FP2 instance, on exit = y
+	@param y FP2 instance to be copied
+ */
+extern void FP2_copy(FP2 *x, FP2 *y);
+/**	@brief Set FP2 to zero
+ *
+	@param x FP2 instance to be set to zero
+ */
+extern void FP2_zero(FP2 *x);
+/**	@brief Set FP2 to unity
+ *
+	@param x FP2 instance to be set to one
+ */
+extern void FP2_one(FP2 *x);
+
+/**	@brief Copy from ROM to an FP2
+ *
+	@param w FP2 number to be copied to
+	@param a BIG real part to be copied from ROM
+	@param b BIG imag part to be copied from ROM
+ */
+extern void FP2_rcopy(FP2 *w,const B256_56::BIG a,const B256_56::BIG b);
+
+/**	@brief Sign of FP2
+ *
+	@param x FP2 instance
+	@return "sign" of FP2
+ */
+extern int FP2_sign(FP2 *x);
+
+/**	@brief Negation of FP2
+ *
+	@param x FP2 instance, on exit = -y
+	@param y FP2 instance
+ */
+extern void FP2_neg(FP2 *x, FP2 *y);
+
+
+/**	@brief Conjugation of FP2
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP2 instance, on exit = conj(y)
+	@param y FP2 instance
+ */
+extern void FP2_conj(FP2 *x, FP2 *y);
+/**	@brief addition of two FP2s
+ *
+	@param x FP2 instance, on exit = y+z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_add(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief subtraction of two FP2s
+ *
+	@param x FP2 instance, on exit = y-z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_sub(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Multiplication of an FP2 by an FP
+ *
+	@param x FP2 instance, on exit = y*b
+	@param y FP2 instance
+	@param b FP residue
+ */
+extern void FP2_pmul(FP2 *x, FP2 *y, FP *b);
+/**	@brief Multiplication of an FP2 by a small integer
+ *
+	@param x FP2 instance, on exit = y*i
+	@param y FP2 instance
+	@param i an integer
+ */
+extern void FP2_imul(FP2 *x, FP2 *y, int i);
+/**	@brief Squaring an FP2
+ *
+	@param x FP2 instance, on exit = y^2
+	@param y FP2 instance
+ */
+extern void FP2_sqr(FP2 *x, FP2 *y);
+/**	@brief Multiplication of two FP2s
+ *
+	@param x FP2 instance, on exit = y*z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_mul(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Formats and outputs an FP2 to the console
+ *
+	@param x FP2 instance
+ */
+extern void FP2_output(FP2 *x);
+/**	@brief Formats and outputs an FP2 to the console in raw form (for debugging)
+ *
+	@param x FP2 instance
+ */
+extern void FP2_rawoutput(FP2 *x);
+/**	@brief Inverting an FP2
+ *
+	@param x FP2 instance, on exit = 1/y
+	@param y FP2 instance
+ */
+extern void FP2_inv(FP2 *x, FP2 *y, FP *h);
+/**	@brief Divide an FP2 by 2
+ *
+	@param x FP2 instance, on exit = y/2
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_div2(FP2 *x, FP2 *y);
+/**	@brief Multiply an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x*(1+sqrt(-1))
+ */
+extern void FP2_mul_ip(FP2 *x);
+
+/**	@brief Divide an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x/(1+sqrt(-1))
+ */
+extern void FP2_div_ip(FP2 *x);
+/**	@brief Normalises the components of an FP2
+ *
+	@param x FP2 instance to be normalised
+ */
+extern void FP2_norm(FP2 *x);
+/**	@brief Reduces all components of possibly unreduced FP2 mod Modulus
+ *
+	@param x FP2 instance, on exit reduced mod Modulus
+ */
+extern void FP2_reduce(FP2 *x);
+/**	@brief Raises an FP2 to the power of a BIG
+ *
+	@param x FP2 instance, on exit = y^b
+	@param y FP2 instance
+	@param b BIG number
+ */
+extern void FP2_pow(FP2 *x, FP2 *y, B256_56::BIG b);
+
+/**	@brief Test FP2 for QR
+ *
+	@param x FP2 instance
+    @param h optional generated hint
+	@return true or false
+ */
+extern int FP2_qr(FP2 *x,FP *h);
+
+
+/**	@brief Square root of an FP2
+ *
+	@param x FP2 instance, on exit = sqrt(y)
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_sqrt(FP2 *x, FP2 *y, FP *h);
+
+/**	@brief Multiply an FP2 by sqrt(-1)
+ *
+	Note that -1 is QNR
+	@param x FP2 instance, on exit = x*sqrt(-1)
+ */
+extern void FP2_times_i(FP2 *x);
+
+/**	@brief Generate random FP2
+ *
+	@param x random FP2 number
+	@param rng random number generator
+ */
+extern void FP2_rand(FP2 *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp2_BN462.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp2_BN462.h
new file mode 100644
index 0000000..b1cf3c5
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp2_BN462.h
@@ -0,0 +1,306 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP2_BN462_H
+#define FP2_BN462_H
+
+#include "fp_BN462.h"
+
+using namespace core;
+
+namespace BN462 {
+
+/**
+	@brief FP2 Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    FP a; /**< real part of FP2 */
+    FP b; /**< imaginary part of FP2 */
+} FP2;
+
+/* FP2 prototypes */
+
+/**	@brief Tests for FP2 equal to zero
+ *
+	@param x FP2 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP2_iszilch(FP2 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP2 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP2_islarger(FP2 *x);
+
+
+/**	@brief Serialize out FP2  
+ *
+    @param b buffer for output
+	@param x FP2 number to be serialized
+ */
+extern void FP2_toBytes(char *b,FP2 *x);
+
+/**	@brief Serialize in FP2  
+ *
+	@param x FP2 number to be serialized
+    @param b buffer for input
+ */
+extern void FP2_fromBytes(FP2 *x,char *b);
+
+/**	@brief Conditional copy of FP2 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP2 instance, set to y if s!=0
+	@param y another FP2 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP2_cmove(FP2 *x, FP2 *y, int s);
+/**	@brief Tests for FP2 equal to one
+ *
+	@param x FP2 instance to be tested
+	@return 1 if x=1, else returns 0
+ */
+extern int FP2_isunity(FP2 *x);
+/**	@brief Tests for equality of two FP2s
+ *
+	@param x FP2 instance to be compared
+	@param y FP2 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP2_equals(FP2 *x, FP2 *y);
+/**	@brief Initialise FP2 from two FP numbers
+ *
+	@param x FP2 instance to be initialised
+	@param a FP to form real part of FP2
+	@param b FP to form imaginary part of FP2
+ */
+extern void FP2_from_FPs(FP2 *x, FP *a, FP *b);
+/**	@brief Initialise FP2 from two BIG integers
+ *
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+	@param b BIG to form imaginary part of FP2
+ */
+extern void FP2_from_BIGs(FP2 *x, B464_60::BIG a, B464_60::BIG b);
+
+
+/**	@brief Initialise FP2 from two integers
+ *
+	@param x FP2 instance to be initialised
+	@param a int to form real part of FP2
+	@param b int to form imaginary part of FP2
+ */
+extern void FP2_from_ints(FP2 *x, int a, int b);
+
+
+
+/**	@brief Initialise FP2 from single FP
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param an FP to form real part of FP2
+ */
+extern void FP2_from_FP(FP2 *x, FP *a);
+/**	@brief Initialise FP2 from single BIG
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+ */
+extern void FP2_from_BIG(FP2 *x, B464_60::BIG a);
+/**	@brief Copy FP2 to another FP2
+ *
+	@param x FP2 instance, on exit = y
+	@param y FP2 instance to be copied
+ */
+extern void FP2_copy(FP2 *x, FP2 *y);
+/**	@brief Set FP2 to zero
+ *
+	@param x FP2 instance to be set to zero
+ */
+extern void FP2_zero(FP2 *x);
+/**	@brief Set FP2 to unity
+ *
+	@param x FP2 instance to be set to one
+ */
+extern void FP2_one(FP2 *x);
+
+/**	@brief Copy from ROM to an FP2
+ *
+	@param w FP2 number to be copied to
+	@param a BIG real part to be copied from ROM
+	@param b BIG imag part to be copied from ROM
+ */
+extern void FP2_rcopy(FP2 *w,const B464_60::BIG a,const B464_60::BIG b);
+
+/**	@brief Sign of FP2
+ *
+	@param x FP2 instance
+	@return "sign" of FP2
+ */
+extern int FP2_sign(FP2 *x);
+
+/**	@brief Negation of FP2
+ *
+	@param x FP2 instance, on exit = -y
+	@param y FP2 instance
+ */
+extern void FP2_neg(FP2 *x, FP2 *y);
+
+
+/**	@brief Conjugation of FP2
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP2 instance, on exit = conj(y)
+	@param y FP2 instance
+ */
+extern void FP2_conj(FP2 *x, FP2 *y);
+/**	@brief addition of two FP2s
+ *
+	@param x FP2 instance, on exit = y+z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_add(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief subtraction of two FP2s
+ *
+	@param x FP2 instance, on exit = y-z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_sub(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Multiplication of an FP2 by an FP
+ *
+	@param x FP2 instance, on exit = y*b
+	@param y FP2 instance
+	@param b FP residue
+ */
+extern void FP2_pmul(FP2 *x, FP2 *y, FP *b);
+/**	@brief Multiplication of an FP2 by a small integer
+ *
+	@param x FP2 instance, on exit = y*i
+	@param y FP2 instance
+	@param i an integer
+ */
+extern void FP2_imul(FP2 *x, FP2 *y, int i);
+/**	@brief Squaring an FP2
+ *
+	@param x FP2 instance, on exit = y^2
+	@param y FP2 instance
+ */
+extern void FP2_sqr(FP2 *x, FP2 *y);
+/**	@brief Multiplication of two FP2s
+ *
+	@param x FP2 instance, on exit = y*z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_mul(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Formats and outputs an FP2 to the console
+ *
+	@param x FP2 instance
+ */
+extern void FP2_output(FP2 *x);
+/**	@brief Formats and outputs an FP2 to the console in raw form (for debugging)
+ *
+	@param x FP2 instance
+ */
+extern void FP2_rawoutput(FP2 *x);
+/**	@brief Inverting an FP2
+ *
+	@param x FP2 instance, on exit = 1/y
+	@param y FP2 instance
+ */
+extern void FP2_inv(FP2 *x, FP2 *y, FP *h);
+/**	@brief Divide an FP2 by 2
+ *
+	@param x FP2 instance, on exit = y/2
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_div2(FP2 *x, FP2 *y);
+/**	@brief Multiply an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x*(1+sqrt(-1))
+ */
+extern void FP2_mul_ip(FP2 *x);
+
+/**	@brief Divide an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x/(1+sqrt(-1))
+ */
+extern void FP2_div_ip(FP2 *x);
+/**	@brief Normalises the components of an FP2
+ *
+	@param x FP2 instance to be normalised
+ */
+extern void FP2_norm(FP2 *x);
+/**	@brief Reduces all components of possibly unreduced FP2 mod Modulus
+ *
+	@param x FP2 instance, on exit reduced mod Modulus
+ */
+extern void FP2_reduce(FP2 *x);
+/**	@brief Raises an FP2 to the power of a BIG
+ *
+	@param x FP2 instance, on exit = y^b
+	@param y FP2 instance
+	@param b BIG number
+ */
+extern void FP2_pow(FP2 *x, FP2 *y, B464_60::BIG b);
+
+/**	@brief Test FP2 for QR
+ *
+	@param x FP2 instance
+    @param h optional generated hint
+	@return true or false
+ */
+extern int FP2_qr(FP2 *x,FP *h);
+
+
+/**	@brief Square root of an FP2
+ *
+	@param x FP2 instance, on exit = sqrt(y)
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_sqrt(FP2 *x, FP2 *y, FP *h);
+
+/**	@brief Multiply an FP2 by sqrt(-1)
+ *
+	Note that -1 is QNR
+	@param x FP2 instance, on exit = x*sqrt(-1)
+ */
+extern void FP2_times_i(FP2 *x);
+
+/**	@brief Generate random FP2
+ *
+	@param x random FP2 number
+	@param rng random number generator
+ */
+extern void FP2_rand(FP2 *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp2_FP256BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp2_FP256BN.h
new file mode 100644
index 0000000..e997b97
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp2_FP256BN.h
@@ -0,0 +1,306 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP2_FP256BN_H
+#define FP2_FP256BN_H
+
+#include "fp_FP256BN.h"
+
+using namespace core;
+
+namespace FP256BN {
+
+/**
+	@brief FP2 Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    FP a; /**< real part of FP2 */
+    FP b; /**< imaginary part of FP2 */
+} FP2;
+
+/* FP2 prototypes */
+
+/**	@brief Tests for FP2 equal to zero
+ *
+	@param x FP2 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP2_iszilch(FP2 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP2 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP2_islarger(FP2 *x);
+
+
+/**	@brief Serialize out FP2  
+ *
+    @param b buffer for output
+	@param x FP2 number to be serialized
+ */
+extern void FP2_toBytes(char *b,FP2 *x);
+
+/**	@brief Serialize in FP2  
+ *
+	@param x FP2 number to be serialized
+    @param b buffer for input
+ */
+extern void FP2_fromBytes(FP2 *x,char *b);
+
+/**	@brief Conditional copy of FP2 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP2 instance, set to y if s!=0
+	@param y another FP2 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP2_cmove(FP2 *x, FP2 *y, int s);
+/**	@brief Tests for FP2 equal to one
+ *
+	@param x FP2 instance to be tested
+	@return 1 if x=1, else returns 0
+ */
+extern int FP2_isunity(FP2 *x);
+/**	@brief Tests for equality of two FP2s
+ *
+	@param x FP2 instance to be compared
+	@param y FP2 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP2_equals(FP2 *x, FP2 *y);
+/**	@brief Initialise FP2 from two FP numbers
+ *
+	@param x FP2 instance to be initialised
+	@param a FP to form real part of FP2
+	@param b FP to form imaginary part of FP2
+ */
+extern void FP2_from_FPs(FP2 *x, FP *a, FP *b);
+/**	@brief Initialise FP2 from two BIG integers
+ *
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+	@param b BIG to form imaginary part of FP2
+ */
+extern void FP2_from_BIGs(FP2 *x, B256_56::BIG a, B256_56::BIG b);
+
+
+/**	@brief Initialise FP2 from two integers
+ *
+	@param x FP2 instance to be initialised
+	@param a int to form real part of FP2
+	@param b int to form imaginary part of FP2
+ */
+extern void FP2_from_ints(FP2 *x, int a, int b);
+
+
+
+/**	@brief Initialise FP2 from single FP
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param an FP to form real part of FP2
+ */
+extern void FP2_from_FP(FP2 *x, FP *a);
+/**	@brief Initialise FP2 from single BIG
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+ */
+extern void FP2_from_BIG(FP2 *x, B256_56::BIG a);
+/**	@brief Copy FP2 to another FP2
+ *
+	@param x FP2 instance, on exit = y
+	@param y FP2 instance to be copied
+ */
+extern void FP2_copy(FP2 *x, FP2 *y);
+/**	@brief Set FP2 to zero
+ *
+	@param x FP2 instance to be set to zero
+ */
+extern void FP2_zero(FP2 *x);
+/**	@brief Set FP2 to unity
+ *
+	@param x FP2 instance to be set to one
+ */
+extern void FP2_one(FP2 *x);
+
+/**	@brief Copy from ROM to an FP2
+ *
+	@param w FP2 number to be copied to
+	@param a BIG real part to be copied from ROM
+	@param b BIG imag part to be copied from ROM
+ */
+extern void FP2_rcopy(FP2 *w,const B256_56::BIG a,const B256_56::BIG b);
+
+/**	@brief Sign of FP2
+ *
+	@param x FP2 instance
+	@return "sign" of FP2
+ */
+extern int FP2_sign(FP2 *x);
+
+/**	@brief Negation of FP2
+ *
+	@param x FP2 instance, on exit = -y
+	@param y FP2 instance
+ */
+extern void FP2_neg(FP2 *x, FP2 *y);
+
+
+/**	@brief Conjugation of FP2
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP2 instance, on exit = conj(y)
+	@param y FP2 instance
+ */
+extern void FP2_conj(FP2 *x, FP2 *y);
+/**	@brief addition of two FP2s
+ *
+	@param x FP2 instance, on exit = y+z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_add(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief subtraction of two FP2s
+ *
+	@param x FP2 instance, on exit = y-z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_sub(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Multiplication of an FP2 by an FP
+ *
+	@param x FP2 instance, on exit = y*b
+	@param y FP2 instance
+	@param b FP residue
+ */
+extern void FP2_pmul(FP2 *x, FP2 *y, FP *b);
+/**	@brief Multiplication of an FP2 by a small integer
+ *
+	@param x FP2 instance, on exit = y*i
+	@param y FP2 instance
+	@param i an integer
+ */
+extern void FP2_imul(FP2 *x, FP2 *y, int i);
+/**	@brief Squaring an FP2
+ *
+	@param x FP2 instance, on exit = y^2
+	@param y FP2 instance
+ */
+extern void FP2_sqr(FP2 *x, FP2 *y);
+/**	@brief Multiplication of two FP2s
+ *
+	@param x FP2 instance, on exit = y*z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_mul(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Formats and outputs an FP2 to the console
+ *
+	@param x FP2 instance
+ */
+extern void FP2_output(FP2 *x);
+/**	@brief Formats and outputs an FP2 to the console in raw form (for debugging)
+ *
+	@param x FP2 instance
+ */
+extern void FP2_rawoutput(FP2 *x);
+/**	@brief Inverting an FP2
+ *
+	@param x FP2 instance, on exit = 1/y
+	@param y FP2 instance
+ */
+extern void FP2_inv(FP2 *x, FP2 *y, FP *h);
+/**	@brief Divide an FP2 by 2
+ *
+	@param x FP2 instance, on exit = y/2
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_div2(FP2 *x, FP2 *y);
+/**	@brief Multiply an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x*(1+sqrt(-1))
+ */
+extern void FP2_mul_ip(FP2 *x);
+
+/**	@brief Divide an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x/(1+sqrt(-1))
+ */
+extern void FP2_div_ip(FP2 *x);
+/**	@brief Normalises the components of an FP2
+ *
+	@param x FP2 instance to be normalised
+ */
+extern void FP2_norm(FP2 *x);
+/**	@brief Reduces all components of possibly unreduced FP2 mod Modulus
+ *
+	@param x FP2 instance, on exit reduced mod Modulus
+ */
+extern void FP2_reduce(FP2 *x);
+/**	@brief Raises an FP2 to the power of a BIG
+ *
+	@param x FP2 instance, on exit = y^b
+	@param y FP2 instance
+	@param b BIG number
+ */
+extern void FP2_pow(FP2 *x, FP2 *y, B256_56::BIG b);
+
+/**	@brief Test FP2 for QR
+ *
+	@param x FP2 instance
+    @param h optional generated hint
+	@return true or false
+ */
+extern int FP2_qr(FP2 *x,FP *h);
+
+
+/**	@brief Square root of an FP2
+ *
+	@param x FP2 instance, on exit = sqrt(y)
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_sqrt(FP2 *x, FP2 *y, FP *h);
+
+/**	@brief Multiply an FP2 by sqrt(-1)
+ *
+	Note that -1 is QNR
+	@param x FP2 instance, on exit = x*sqrt(-1)
+ */
+extern void FP2_times_i(FP2 *x);
+
+/**	@brief Generate random FP2
+ *
+	@param x random FP2 number
+	@param rng random number generator
+ */
+extern void FP2_rand(FP2 *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp2_FP512BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp2_FP512BN.h
new file mode 100644
index 0000000..afdd0ff
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp2_FP512BN.h
@@ -0,0 +1,306 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP2_FP512BN_H
+#define FP2_FP512BN_H
+
+#include "fp_FP512BN.h"
+
+using namespace core;
+
+namespace FP512BN {
+
+/**
+	@brief FP2 Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    FP a; /**< real part of FP2 */
+    FP b; /**< imaginary part of FP2 */
+} FP2;
+
+/* FP2 prototypes */
+
+/**	@brief Tests for FP2 equal to zero
+ *
+	@param x FP2 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP2_iszilch(FP2 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP2 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP2_islarger(FP2 *x);
+
+
+/**	@brief Serialize out FP2  
+ *
+    @param b buffer for output
+	@param x FP2 number to be serialized
+ */
+extern void FP2_toBytes(char *b,FP2 *x);
+
+/**	@brief Serialize in FP2  
+ *
+	@param x FP2 number to be serialized
+    @param b buffer for input
+ */
+extern void FP2_fromBytes(FP2 *x,char *b);
+
+/**	@brief Conditional copy of FP2 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP2 instance, set to y if s!=0
+	@param y another FP2 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP2_cmove(FP2 *x, FP2 *y, int s);
+/**	@brief Tests for FP2 equal to one
+ *
+	@param x FP2 instance to be tested
+	@return 1 if x=1, else returns 0
+ */
+extern int FP2_isunity(FP2 *x);
+/**	@brief Tests for equality of two FP2s
+ *
+	@param x FP2 instance to be compared
+	@param y FP2 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP2_equals(FP2 *x, FP2 *y);
+/**	@brief Initialise FP2 from two FP numbers
+ *
+	@param x FP2 instance to be initialised
+	@param a FP to form real part of FP2
+	@param b FP to form imaginary part of FP2
+ */
+extern void FP2_from_FPs(FP2 *x, FP *a, FP *b);
+/**	@brief Initialise FP2 from two BIG integers
+ *
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+	@param b BIG to form imaginary part of FP2
+ */
+extern void FP2_from_BIGs(FP2 *x, B512_60::BIG a, B512_60::BIG b);
+
+
+/**	@brief Initialise FP2 from two integers
+ *
+	@param x FP2 instance to be initialised
+	@param a int to form real part of FP2
+	@param b int to form imaginary part of FP2
+ */
+extern void FP2_from_ints(FP2 *x, int a, int b);
+
+
+
+/**	@brief Initialise FP2 from single FP
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param an FP to form real part of FP2
+ */
+extern void FP2_from_FP(FP2 *x, FP *a);
+/**	@brief Initialise FP2 from single BIG
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+ */
+extern void FP2_from_BIG(FP2 *x, B512_60::BIG a);
+/**	@brief Copy FP2 to another FP2
+ *
+	@param x FP2 instance, on exit = y
+	@param y FP2 instance to be copied
+ */
+extern void FP2_copy(FP2 *x, FP2 *y);
+/**	@brief Set FP2 to zero
+ *
+	@param x FP2 instance to be set to zero
+ */
+extern void FP2_zero(FP2 *x);
+/**	@brief Set FP2 to unity
+ *
+	@param x FP2 instance to be set to one
+ */
+extern void FP2_one(FP2 *x);
+
+/**	@brief Copy from ROM to an FP2
+ *
+	@param w FP2 number to be copied to
+	@param a BIG real part to be copied from ROM
+	@param b BIG imag part to be copied from ROM
+ */
+extern void FP2_rcopy(FP2 *w,const B512_60::BIG a,const B512_60::BIG b);
+
+/**	@brief Sign of FP2
+ *
+	@param x FP2 instance
+	@return "sign" of FP2
+ */
+extern int FP2_sign(FP2 *x);
+
+/**	@brief Negation of FP2
+ *
+	@param x FP2 instance, on exit = -y
+	@param y FP2 instance
+ */
+extern void FP2_neg(FP2 *x, FP2 *y);
+
+
+/**	@brief Conjugation of FP2
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP2 instance, on exit = conj(y)
+	@param y FP2 instance
+ */
+extern void FP2_conj(FP2 *x, FP2 *y);
+/**	@brief addition of two FP2s
+ *
+	@param x FP2 instance, on exit = y+z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_add(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief subtraction of two FP2s
+ *
+	@param x FP2 instance, on exit = y-z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_sub(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Multiplication of an FP2 by an FP
+ *
+	@param x FP2 instance, on exit = y*b
+	@param y FP2 instance
+	@param b FP residue
+ */
+extern void FP2_pmul(FP2 *x, FP2 *y, FP *b);
+/**	@brief Multiplication of an FP2 by a small integer
+ *
+	@param x FP2 instance, on exit = y*i
+	@param y FP2 instance
+	@param i an integer
+ */
+extern void FP2_imul(FP2 *x, FP2 *y, int i);
+/**	@brief Squaring an FP2
+ *
+	@param x FP2 instance, on exit = y^2
+	@param y FP2 instance
+ */
+extern void FP2_sqr(FP2 *x, FP2 *y);
+/**	@brief Multiplication of two FP2s
+ *
+	@param x FP2 instance, on exit = y*z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_mul(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Formats and outputs an FP2 to the console
+ *
+	@param x FP2 instance
+ */
+extern void FP2_output(FP2 *x);
+/**	@brief Formats and outputs an FP2 to the console in raw form (for debugging)
+ *
+	@param x FP2 instance
+ */
+extern void FP2_rawoutput(FP2 *x);
+/**	@brief Inverting an FP2
+ *
+	@param x FP2 instance, on exit = 1/y
+	@param y FP2 instance
+ */
+extern void FP2_inv(FP2 *x, FP2 *y, FP *h);
+/**	@brief Divide an FP2 by 2
+ *
+	@param x FP2 instance, on exit = y/2
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_div2(FP2 *x, FP2 *y);
+/**	@brief Multiply an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x*(1+sqrt(-1))
+ */
+extern void FP2_mul_ip(FP2 *x);
+
+/**	@brief Divide an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x/(1+sqrt(-1))
+ */
+extern void FP2_div_ip(FP2 *x);
+/**	@brief Normalises the components of an FP2
+ *
+	@param x FP2 instance to be normalised
+ */
+extern void FP2_norm(FP2 *x);
+/**	@brief Reduces all components of possibly unreduced FP2 mod Modulus
+ *
+	@param x FP2 instance, on exit reduced mod Modulus
+ */
+extern void FP2_reduce(FP2 *x);
+/**	@brief Raises an FP2 to the power of a BIG
+ *
+	@param x FP2 instance, on exit = y^b
+	@param y FP2 instance
+	@param b BIG number
+ */
+extern void FP2_pow(FP2 *x, FP2 *y, B512_60::BIG b);
+
+/**	@brief Test FP2 for QR
+ *
+	@param x FP2 instance
+    @param h optional generated hint
+	@return true or false
+ */
+extern int FP2_qr(FP2 *x,FP *h);
+
+
+/**	@brief Square root of an FP2
+ *
+	@param x FP2 instance, on exit = sqrt(y)
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_sqrt(FP2 *x, FP2 *y, FP *h);
+
+/**	@brief Multiply an FP2 by sqrt(-1)
+ *
+	Note that -1 is QNR
+	@param x FP2 instance, on exit = x*sqrt(-1)
+ */
+extern void FP2_times_i(FP2 *x);
+
+/**	@brief Generate random FP2
+ *
+	@param x random FP2 number
+	@param rng random number generator
+ */
+extern void FP2_rand(FP2 *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp4.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp4.h
new file mode 100644
index 0000000..b889fa3
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp4.h
@@ -0,0 +1,349 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP4_YYY_H
+#define FP4_YYY_H
+
+#include "fp2_YYY.h"
+#include "config_curve_ZZZ.h"
+
+using namespace core;
+
+namespace YYY {
+
+/**
+	@brief FP4 Structure - towered over two FP2
+*/
+
+typedef struct
+{
+    FP2 a; /**< real part of FP4 */
+    FP2 b; /**< imaginary part of FP4 */
+} FP4;
+
+
+/* FP4 prototypes */
+/**	@brief Tests for FP4 equal to zero
+ *
+	@param x FP4 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP4_iszilch(FP4 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP4 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP4_islarger(FP4 *x);
+
+/**	@brief Serialize out FP4  
+ *
+    @param b buffer for output
+	@param x FP4 number to be serialized
+ */
+extern void FP4_toBytes(char *b,FP4 *x);
+
+/**	@brief Serialize in FP4  
+ *
+	@param x FP4 number to be serialized
+    @param b buffer for input
+ */
+extern void FP4_fromBytes(FP4 *x,char *b);
+
+/**	@brief Tests for FP4 equal to unity
+ *
+	@param x FP4 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP4_isunity(FP4 *x);
+/**	@brief Tests for equality of two FP4s
+ *
+	@param x FP4 instance to be compared
+	@param y FP4 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP4_equals(FP4 *x, FP4 *y);
+/**	@brief Tests for FP4 having only a real part and no imaginary part
+ *
+	@param x FP4 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP4_isreal(FP4 *x);
+/**	@brief Initialise FP4 from two FP2s
+ *
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+	@param b FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2s(FP4 *x, FP2 *a, FP2 *b);
+/**	@brief Initialise FP4 from single FP2
+ *
+	Imaginary part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+ */
+extern void FP4_from_FP2(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP2
+ *
+	real part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2H(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP
+ *
+	@param x FP4 instance to be initialised
+	@param a FP to form real part of FP4
+ */
+extern void FP4_from_FP(FP4 *x, FP *a);
+
+/**	@brief Copy FP4 to another FP4
+ *
+	@param x FP4 instance, on exit = y
+	@param y FP4 instance to be copied
+ */
+extern void FP4_copy(FP4 *x, FP4 *y);
+/**	@brief Set FP4 to zero
+ *
+	@param x FP4 instance to be set to zero
+ */
+extern void FP4_zero(FP4 *x);
+/**	@brief Set FP4 to unity
+ *
+	@param x FP4 instance to be set to one
+ */
+extern void FP4_one(FP4 *x);
+
+/**	@brief Sign of FP4
+ *
+	@param x FP4 instance
+	@return "sign" of FP4
+ */
+extern int FP4_sign(FP4 *x);
+
+/**	@brief Negation of FP4
+ *
+	@param x FP4 instance, on exit = -y
+	@param y FP4 instance
+ */
+extern void FP4_neg(FP4 *x, FP4 *y);
+/**	@brief Conjugation of FP4
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP4 instance, on exit = conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_conj(FP4 *x, FP4 *y);
+/**	@brief Negative conjugation of FP4
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP4 instance, on exit = -conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_nconj(FP4 *x, FP4 *y);
+/**	@brief addition of two FP4s
+ *
+	@param x FP4 instance, on exit = y+z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_add(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief subtraction of two FP4s
+ *
+	@param x FP4 instance, on exit = y-z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_sub(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Multiplication of an FP4 by an FP2
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP2 multiplier
+ */
+extern void FP4_pmul(FP4 *x, FP4 *y, FP2 *a);
+
+
+/**	@brief Multiplication of an FP4 by an FP
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP multiplier
+ */
+extern void FP4_qmul(FP4 *x, FP4 *y, FP *a);
+
+/**	@brief Multiplication of an FP4 by a small integer
+ *
+	@param x FP4 instance, on exit = y*i
+	@param y FP4 instance
+	@param i an integer
+ */
+extern void FP4_imul(FP4 *x, FP4 *y, int i);
+/**	@brief Squaring an FP4
+ *
+	@param x FP4 instance, on exit = y^2
+	@param y FP4 instance
+ */
+extern void FP4_sqr(FP4 *x, FP4 *y);
+/**	@brief Multiplication of two FP4s
+ *
+	@param x FP4 instance, on exit = y*z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_mul(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Inverting an FP4
+ *
+	@param x FP4 instance, on exit = 1/y
+	@param y FP4 instance
+    @param h optional input hint
+ */
+extern void FP4_inv(FP4 *x, FP4 *y, FP *h);
+
+/**	@brief Divide an FP4 by 2
+ *
+	@param x FP4 instance, on exit = y/2
+	@param y FP4 instance
+ */
+extern void FP4_div2(FP4 *x, FP4 *y);
+
+
+/**	@brief Formats and outputs an FP4 to the console
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_output(FP4 *x);
+/**	@brief Formats and outputs an FP4 to the console in raw form (for debugging)
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_rawoutput(FP4 *x);
+/**	@brief multiplies an FP4 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP4 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP4_times_i(FP4 *x);
+/**	@brief Normalises the components of an FP4
+ *
+	@param x FP4 instance to be normalised
+ */
+extern void FP4_norm(FP4 *x);
+/**	@brief Reduces all components of possibly unreduced FP4 mod Modulus
+ *
+	@param x FP4 instance, on exit reduced mod Modulus
+ */
+extern void FP4_reduce(FP4 *x);
+/**	@brief Raises an FP4 to the power of a BIG
+ *
+	@param x FP4 instance, on exit = y^b
+	@param y FP4 instance
+	@param b BIG number
+ */
+extern void FP4_pow(FP4 *x, FP4 *y, XXX::BIG b);
+/**	@brief Raises an FP4 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP4 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP4_frob(FP4 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP4 instance, on exit = w*x-conj(x)*y+z
+	@param w FP4 instance
+	@param x FP4 instance
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_xtr_A(FP4 *r, FP4 *w, FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP4 instance, on exit = x^2-2*conj(x)
+	@param x FP4 instance
+ */
+extern void FP4_xtr_D(FP4 *r, FP4 *x);
+/**	@brief Calculates FP4 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP4 instance, on exit = trace(w^b)
+	@param x FP4 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP4_xtr_pow(FP4 *r, FP4 *x, XXX::BIG b);
+/**	@brief Calculates FP4 trace of c^a.d^b, where c and d are derived from FP4 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP4 instance, on exit = trace(c^a.d^b)
+	@param c FP4 instance, trace of an FP12
+	@param d FP4 instance, trace of an FP12
+	@param e FP4 instance, trace of an FP12
+	@param f FP4 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP4_xtr_pow2(FP4 *r, FP4 *c, FP4 *d, FP4 *e, FP4 *f, XXX::BIG a, XXX::BIG b);
+
+/**	@brief Test FP4 for QR
+ * 
+	@param r FP4 instance
+    @param h optional generated hint
+	@return 1 x is a QR, otherwise 0
+ */
+extern int  FP4_qr(FP4 *r, FP *h);
+
+/**	@brief Calculate square root of an FP4
+ *
+	Square root
+	@param r FP4 instance, on exit = sqrt(x)
+	@param x FP4 instance
+    @param h optional input hint
+ */
+extern void  FP4_sqrt(FP4 *r, FP4 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP4 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP4 instance, set to y if s!=0
+	@param y another FP4 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP4_cmove(FP4 *x, FP4 *y, int s);
+
+
+/**	@brief Divide FP4 number by QNR
+ *
+	Divide FP4 by the QNR
+	@param x FP4 instance
+ */
+extern void FP4_div_i(FP4 *x);
+
+/**	@brief Generate random FP4
+ *
+	@param x random FP4 number
+	@param rng random number generator
+ */
+extern void FP4_rand(FP4 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp48.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp48.h
new file mode 100644
index 0000000..b1095f9
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp48.h
@@ -0,0 +1,231 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP48_YYY_H
+#define FP48_YYY_H
+
+#include "fp16_YYY.h"
+
+using namespace core;
+
+namespace YYY {
+/**
+	@brief FP12 Structure - towered over three FP16
+*/
+
+typedef struct
+{
+    FP16 a; /**< first part of FP12 */
+    FP16 b; /**< second part of FP12 */
+    FP16 c; /**< third part of FP12 */
+    int type;
+} FP48;
+
+extern const XXX::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const XXX::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+/* FP48 prototypes */
+/**	@brief Tests for FP48 equal to zero
+ *
+	@param x FP48 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP48_iszilch(FP48 *x);
+/**	@brief Tests for FP48 equal to unity
+ *
+	@param x FP48 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP48_isunity(FP48 *x);
+/**	@brief Copy FP48 to another FP48
+ *
+	@param x FP48 instance, on exit = y
+	@param y FP48 instance to be copied
+ */
+extern void FP48_copy(FP48 *x, FP48 *y);
+/**	@brief Set FP48 to unity
+ *
+	@param x FP48 instance to be set to one
+ */
+extern void FP48_one(FP48 *x);
+
+/**	@brief Set FP48 to zero
+ *
+	@param x FP48 instance to be set to zero
+ */
+extern void FP48_zero(FP48 *x);
+
+/**	@brief Tests for equality of two FP48s
+ *
+	@param x FP48 instance to be compared
+	@param y FP48 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP48_equals(FP48 *x, FP48 *y);
+/**	@brief Conjugation of FP48
+ *
+	If y=(a,b,c) (where a,b,c are its three FP16 components) on exit x=(conj(a),-conj(b),conj(c))
+	@param x FP48 instance, on exit = conj(y)
+	@param y FP48 instance
+ */
+extern void FP48_conj(FP48 *x, FP48 *y);
+/**	@brief Initialise FP48 from single FP16
+ *
+	Sets first FP16 component of an FP48, other components set to zero
+	@param x FP48 instance to be initialised
+	@param a FP16 to form first part of FP48
+ */
+extern void FP48_from_FP16(FP48 *x, FP16 *a);
+/**	@brief Initialise FP48 from three FP16s
+ *
+	@param x FP48 instance to be initialised
+	@param a FP16 to form first part of FP48
+	@param b FP16 to form second part of FP48
+	@param c FP16 to form third part of FP48
+ */
+extern void FP48_from_FP16s(FP48 *x, FP16 *a, FP16* b, FP16 *c);
+/**	@brief Fast Squaring of an FP48 in "unitary" form
+ *
+	@param x FP48 instance, on exit = y^2
+	@param y FP16 instance, must be unitary
+ */
+extern void FP48_usqr(FP48 *x, FP48 *y);
+/**	@brief Squaring an FP48
+ *
+	@param x FP48 instance, on exit = y^2
+	@param y FP48 instance
+ */
+extern void FP48_sqr(FP48 *x, FP48 *y);
+/**	@brief Fast multiplication of two sparse FP24s that arises from ATE pairing line functions
+ *
+	@param x FP48 instance, on exit = x*y
+	@param y FP48 instance, of special form
+ */
+extern void FP48_smul(FP48 *x, FP48 *y);
+
+/**	@brief Fast multiplication of what may be sparse multiplicands
+ *
+	@param x FP48 instance, on exit = x*y
+	@param y FP48 instance, of special form
+ */
+extern void FP48_ssmul(FP48 *x, FP48 *y);
+/**	@brief Full unconditional Multiplication of two FP24s
+ *
+	@param x FP48 instance, on exit = x*y
+	@param y FP48 instance, the multiplier
+ */
+extern void FP48_mul(FP48 *x, FP48 *y);
+/**	@brief Inverting an FP48
+ *
+	@param x FP48 instance, on exit = 1/y
+	@param y FP48 instance
+ */
+extern void FP48_inv(FP48 *x, FP48 *y);
+/**	@brief Raises an FP48 to the power of a BIG
+ *
+	@param r FP48 instance, on exit = y^b
+	@param x FP48 instance
+	@param b BIG number
+ */
+extern void FP48_pow(FP48 *r, FP48 *x, XXX::BIG b);
+
+//extern void FP48_ppow(FP48 *r,FP48 *x,XXX::BIG b);
+
+/**	@brief Raises an FP48 instance x to a small integer power, side-channel resistant
+ *
+	@param x FP48 instance, on exit = x^i
+	@param i small integer exponent
+	@param b maximum number of bits in exponent
+ */
+extern void FP48_pinpow(FP48 *x, int i, int b);
+
+/**	@brief Raises an FP48 instance x to a BIG power, compressed to FP16
+ *
+	@param c FP16 instance, on exit = x^(e mod r) as FP16
+	@param x FP48 input
+	@param e BIG exponent
+	@param r BIG group order
+ */
+extern void FP48_compow(FP16 *c, FP48 *x, XXX::BIG e, XXX::BIG r);
+
+/**	@brief Calculate Pi x[i]^b[i] for i=0 to 15, side-channel resistant
+ *
+	@param r FP48 instance, on exit = Pi x[i]^b[i] for i=0 to 15
+	@param x FP48 array with 16 FP48s
+	@param b BIG array of 16 exponents
+ */
+extern void FP48_pow16(FP48 *r, FP48 *x, XXX::BIG *b);
+
+
+/**	@brief Raises an FP48 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP48 instance, on exit = x^p^n
+	@param f FP2 precalculated Frobenius constant
+	@param n power of p
+ */
+extern void FP48_frob(FP48 *x, FP2 *f, int n);
+
+/**	@brief Reduces all components of possibly unreduced FP48 mod Modulus
+ *
+	@param x FP48 instance, on exit reduced mod Modulus
+ */
+extern void FP48_reduce(FP48 *x);
+/**	@brief Normalises the components of an FP48
+ *
+	@param x FP48 instance to be normalised
+ */
+extern void FP48_norm(FP48 *x);
+/**	@brief Formats and outputs an FP48 to the console
+ *
+	@param x FP48 instance to be printed
+ */
+extern void FP48_output(FP48 *x);
+/**	@brief Formats and outputs an FP48 instance to an octet string
+ *
+	Serializes the components of an FP48 to big-endian base 256 form.
+	@param S output octet string
+	@param x FP48 instance to be converted to an octet string
+ */
+extern void FP48_toOctet(octet *S, FP48 *x);
+/**	@brief Creates an FP48 instance from an octet string
+ *
+	De-serializes the components of an FP48 to create an FP48 from big-endian base 256 components.
+	@param x FP48 instance to be created from an octet string
+	@param S input octet string
+
+ */
+extern void FP48_fromOctet(FP48 *x, octet *S);
+/**	@brief Calculate the trace of an FP48
+ *
+	@param t FP16 trace of x, on exit = tr(x)
+	@param x FP48 instance
+
+ */
+extern void FP48_trace(FP16 *t, FP48 *x);
+
+/**	@brief Conditional copy of FP48 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP48 instance, set to y if s!=0
+	@param y another FP48 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP48_cmove(FP48 *x, FP48 *y, int s);
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp48_BLS48286.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp48_BLS48286.h
new file mode 100644
index 0000000..194fcb0
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp48_BLS48286.h
@@ -0,0 +1,231 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP48_BLS48286_H
+#define FP48_BLS48286_H
+
+#include "fp16_BLS48286.h"
+
+using namespace core;
+
+namespace BLS48286 {
+/**
+	@brief FP12 Structure - towered over three FP16
+*/
+
+typedef struct
+{
+    FP16 a; /**< first part of FP12 */
+    FP16 b; /**< second part of FP12 */
+    FP16 c; /**< third part of FP12 */
+    int type;
+} FP48;
+
+extern const B288_60::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B288_60::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+/* FP48 prototypes */
+/**	@brief Tests for FP48 equal to zero
+ *
+	@param x FP48 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP48_iszilch(FP48 *x);
+/**	@brief Tests for FP48 equal to unity
+ *
+	@param x FP48 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP48_isunity(FP48 *x);
+/**	@brief Copy FP48 to another FP48
+ *
+	@param x FP48 instance, on exit = y
+	@param y FP48 instance to be copied
+ */
+extern void FP48_copy(FP48 *x, FP48 *y);
+/**	@brief Set FP48 to unity
+ *
+	@param x FP48 instance to be set to one
+ */
+extern void FP48_one(FP48 *x);
+
+/**	@brief Set FP48 to zero
+ *
+	@param x FP48 instance to be set to zero
+ */
+extern void FP48_zero(FP48 *x);
+
+/**	@brief Tests for equality of two FP48s
+ *
+	@param x FP48 instance to be compared
+	@param y FP48 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP48_equals(FP48 *x, FP48 *y);
+/**	@brief Conjugation of FP48
+ *
+	If y=(a,b,c) (where a,b,c are its three FP16 components) on exit x=(conj(a),-conj(b),conj(c))
+	@param x FP48 instance, on exit = conj(y)
+	@param y FP48 instance
+ */
+extern void FP48_conj(FP48 *x, FP48 *y);
+/**	@brief Initialise FP48 from single FP16
+ *
+	Sets first FP16 component of an FP48, other components set to zero
+	@param x FP48 instance to be initialised
+	@param a FP16 to form first part of FP48
+ */
+extern void FP48_from_FP16(FP48 *x, FP16 *a);
+/**	@brief Initialise FP48 from three FP16s
+ *
+	@param x FP48 instance to be initialised
+	@param a FP16 to form first part of FP48
+	@param b FP16 to form second part of FP48
+	@param c FP16 to form third part of FP48
+ */
+extern void FP48_from_FP16s(FP48 *x, FP16 *a, FP16* b, FP16 *c);
+/**	@brief Fast Squaring of an FP48 in "unitary" form
+ *
+	@param x FP48 instance, on exit = y^2
+	@param y FP16 instance, must be unitary
+ */
+extern void FP48_usqr(FP48 *x, FP48 *y);
+/**	@brief Squaring an FP48
+ *
+	@param x FP48 instance, on exit = y^2
+	@param y FP48 instance
+ */
+extern void FP48_sqr(FP48 *x, FP48 *y);
+/**	@brief Fast multiplication of two sparse FP24s that arises from ATE pairing line functions
+ *
+	@param x FP48 instance, on exit = x*y
+	@param y FP48 instance, of special form
+ */
+extern void FP48_smul(FP48 *x, FP48 *y);
+
+/**	@brief Fast multiplication of what may be sparse multiplicands
+ *
+	@param x FP48 instance, on exit = x*y
+	@param y FP48 instance, of special form
+ */
+extern void FP48_ssmul(FP48 *x, FP48 *y);
+/**	@brief Full unconditional Multiplication of two FP24s
+ *
+	@param x FP48 instance, on exit = x*y
+	@param y FP48 instance, the multiplier
+ */
+extern void FP48_mul(FP48 *x, FP48 *y);
+/**	@brief Inverting an FP48
+ *
+	@param x FP48 instance, on exit = 1/y
+	@param y FP48 instance
+ */
+extern void FP48_inv(FP48 *x, FP48 *y);
+/**	@brief Raises an FP48 to the power of a BIG
+ *
+	@param r FP48 instance, on exit = y^b
+	@param x FP48 instance
+	@param b BIG number
+ */
+extern void FP48_pow(FP48 *r, FP48 *x, B288_60::BIG b);
+
+//extern void FP48_ppow(FP48 *r,FP48 *x,B288_60::BIG b);
+
+/**	@brief Raises an FP48 instance x to a small integer power, side-channel resistant
+ *
+	@param x FP48 instance, on exit = x^i
+	@param i small integer exponent
+	@param b maximum number of bits in exponent
+ */
+extern void FP48_pinpow(FP48 *x, int i, int b);
+
+/**	@brief Raises an FP48 instance x to a BIG power, compressed to FP16
+ *
+	@param c FP16 instance, on exit = x^(e mod r) as FP16
+	@param x FP48 input
+	@param e BIG exponent
+	@param r BIG group order
+ */
+extern void FP48_compow(FP16 *c, FP48 *x, B288_60::BIG e, B288_60::BIG r);
+
+/**	@brief Calculate Pi x[i]^b[i] for i=0 to 15, side-channel resistant
+ *
+	@param r FP48 instance, on exit = Pi x[i]^b[i] for i=0 to 15
+	@param x FP48 array with 16 FP48s
+	@param b BIG array of 16 exponents
+ */
+extern void FP48_pow16(FP48 *r, FP48 *x, B288_60::BIG *b);
+
+
+/**	@brief Raises an FP48 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP48 instance, on exit = x^p^n
+	@param f FP2 precalculated Frobenius constant
+	@param n power of p
+ */
+extern void FP48_frob(FP48 *x, FP2 *f, int n);
+
+/**	@brief Reduces all components of possibly unreduced FP48 mod Modulus
+ *
+	@param x FP48 instance, on exit reduced mod Modulus
+ */
+extern void FP48_reduce(FP48 *x);
+/**	@brief Normalises the components of an FP48
+ *
+	@param x FP48 instance to be normalised
+ */
+extern void FP48_norm(FP48 *x);
+/**	@brief Formats and outputs an FP48 to the console
+ *
+	@param x FP48 instance to be printed
+ */
+extern void FP48_output(FP48 *x);
+/**	@brief Formats and outputs an FP48 instance to an octet string
+ *
+	Serializes the components of an FP48 to big-endian base 256 form.
+	@param S output octet string
+	@param x FP48 instance to be converted to an octet string
+ */
+extern void FP48_toOctet(octet *S, FP48 *x);
+/**	@brief Creates an FP48 instance from an octet string
+ *
+	De-serializes the components of an FP48 to create an FP48 from big-endian base 256 components.
+	@param x FP48 instance to be created from an octet string
+	@param S input octet string
+
+ */
+extern void FP48_fromOctet(FP48 *x, octet *S);
+/**	@brief Calculate the trace of an FP48
+ *
+	@param t FP16 trace of x, on exit = tr(x)
+	@param x FP48 instance
+
+ */
+extern void FP48_trace(FP16 *t, FP48 *x);
+
+/**	@brief Conditional copy of FP48 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP48 instance, set to y if s!=0
+	@param y another FP48 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP48_cmove(FP48 *x, FP48 *y, int s);
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp48_BLS48556.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp48_BLS48556.h
new file mode 100644
index 0000000..cca9e44
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp48_BLS48556.h
@@ -0,0 +1,231 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP48_BLS48556_H
+#define FP48_BLS48556_H
+
+#include "fp16_BLS48556.h"
+
+using namespace core;
+
+namespace BLS48556 {
+/**
+	@brief FP12 Structure - towered over three FP16
+*/
+
+typedef struct
+{
+    FP16 a; /**< first part of FP12 */
+    FP16 b; /**< second part of FP12 */
+    FP16 c; /**< third part of FP12 */
+    int type;
+} FP48;
+
+extern const B560_58::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B560_58::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+/* FP48 prototypes */
+/**	@brief Tests for FP48 equal to zero
+ *
+	@param x FP48 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP48_iszilch(FP48 *x);
+/**	@brief Tests for FP48 equal to unity
+ *
+	@param x FP48 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP48_isunity(FP48 *x);
+/**	@brief Copy FP48 to another FP48
+ *
+	@param x FP48 instance, on exit = y
+	@param y FP48 instance to be copied
+ */
+extern void FP48_copy(FP48 *x, FP48 *y);
+/**	@brief Set FP48 to unity
+ *
+	@param x FP48 instance to be set to one
+ */
+extern void FP48_one(FP48 *x);
+
+/**	@brief Set FP48 to zero
+ *
+	@param x FP48 instance to be set to zero
+ */
+extern void FP48_zero(FP48 *x);
+
+/**	@brief Tests for equality of two FP48s
+ *
+	@param x FP48 instance to be compared
+	@param y FP48 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP48_equals(FP48 *x, FP48 *y);
+/**	@brief Conjugation of FP48
+ *
+	If y=(a,b,c) (where a,b,c are its three FP16 components) on exit x=(conj(a),-conj(b),conj(c))
+	@param x FP48 instance, on exit = conj(y)
+	@param y FP48 instance
+ */
+extern void FP48_conj(FP48 *x, FP48 *y);
+/**	@brief Initialise FP48 from single FP16
+ *
+	Sets first FP16 component of an FP48, other components set to zero
+	@param x FP48 instance to be initialised
+	@param a FP16 to form first part of FP48
+ */
+extern void FP48_from_FP16(FP48 *x, FP16 *a);
+/**	@brief Initialise FP48 from three FP16s
+ *
+	@param x FP48 instance to be initialised
+	@param a FP16 to form first part of FP48
+	@param b FP16 to form second part of FP48
+	@param c FP16 to form third part of FP48
+ */
+extern void FP48_from_FP16s(FP48 *x, FP16 *a, FP16* b, FP16 *c);
+/**	@brief Fast Squaring of an FP48 in "unitary" form
+ *
+	@param x FP48 instance, on exit = y^2
+	@param y FP16 instance, must be unitary
+ */
+extern void FP48_usqr(FP48 *x, FP48 *y);
+/**	@brief Squaring an FP48
+ *
+	@param x FP48 instance, on exit = y^2
+	@param y FP48 instance
+ */
+extern void FP48_sqr(FP48 *x, FP48 *y);
+/**	@brief Fast multiplication of two sparse FP24s that arises from ATE pairing line functions
+ *
+	@param x FP48 instance, on exit = x*y
+	@param y FP48 instance, of special form
+ */
+extern void FP48_smul(FP48 *x, FP48 *y);
+
+/**	@brief Fast multiplication of what may be sparse multiplicands
+ *
+	@param x FP48 instance, on exit = x*y
+	@param y FP48 instance, of special form
+ */
+extern void FP48_ssmul(FP48 *x, FP48 *y);
+/**	@brief Full unconditional Multiplication of two FP24s
+ *
+	@param x FP48 instance, on exit = x*y
+	@param y FP48 instance, the multiplier
+ */
+extern void FP48_mul(FP48 *x, FP48 *y);
+/**	@brief Inverting an FP48
+ *
+	@param x FP48 instance, on exit = 1/y
+	@param y FP48 instance
+ */
+extern void FP48_inv(FP48 *x, FP48 *y);
+/**	@brief Raises an FP48 to the power of a BIG
+ *
+	@param r FP48 instance, on exit = y^b
+	@param x FP48 instance
+	@param b BIG number
+ */
+extern void FP48_pow(FP48 *r, FP48 *x, B560_58::BIG b);
+
+//extern void FP48_ppow(FP48 *r,FP48 *x,B560_58::BIG b);
+
+/**	@brief Raises an FP48 instance x to a small integer power, side-channel resistant
+ *
+	@param x FP48 instance, on exit = x^i
+	@param i small integer exponent
+	@param b maximum number of bits in exponent
+ */
+extern void FP48_pinpow(FP48 *x, int i, int b);
+
+/**	@brief Raises an FP48 instance x to a BIG power, compressed to FP16
+ *
+	@param c FP16 instance, on exit = x^(e mod r) as FP16
+	@param x FP48 input
+	@param e BIG exponent
+	@param r BIG group order
+ */
+extern void FP48_compow(FP16 *c, FP48 *x, B560_58::BIG e, B560_58::BIG r);
+
+/**	@brief Calculate Pi x[i]^b[i] for i=0 to 15, side-channel resistant
+ *
+	@param r FP48 instance, on exit = Pi x[i]^b[i] for i=0 to 15
+	@param x FP48 array with 16 FP48s
+	@param b BIG array of 16 exponents
+ */
+extern void FP48_pow16(FP48 *r, FP48 *x, B560_58::BIG *b);
+
+
+/**	@brief Raises an FP48 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP48 instance, on exit = x^p^n
+	@param f FP2 precalculated Frobenius constant
+	@param n power of p
+ */
+extern void FP48_frob(FP48 *x, FP2 *f, int n);
+
+/**	@brief Reduces all components of possibly unreduced FP48 mod Modulus
+ *
+	@param x FP48 instance, on exit reduced mod Modulus
+ */
+extern void FP48_reduce(FP48 *x);
+/**	@brief Normalises the components of an FP48
+ *
+	@param x FP48 instance to be normalised
+ */
+extern void FP48_norm(FP48 *x);
+/**	@brief Formats and outputs an FP48 to the console
+ *
+	@param x FP48 instance to be printed
+ */
+extern void FP48_output(FP48 *x);
+/**	@brief Formats and outputs an FP48 instance to an octet string
+ *
+	Serializes the components of an FP48 to big-endian base 256 form.
+	@param S output octet string
+	@param x FP48 instance to be converted to an octet string
+ */
+extern void FP48_toOctet(octet *S, FP48 *x);
+/**	@brief Creates an FP48 instance from an octet string
+ *
+	De-serializes the components of an FP48 to create an FP48 from big-endian base 256 components.
+	@param x FP48 instance to be created from an octet string
+	@param S input octet string
+
+ */
+extern void FP48_fromOctet(FP48 *x, octet *S);
+/**	@brief Calculate the trace of an FP48
+ *
+	@param t FP16 trace of x, on exit = tr(x)
+	@param x FP48 instance
+
+ */
+extern void FP48_trace(FP16 *t, FP48 *x);
+
+/**	@brief Conditional copy of FP48 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP48 instance, set to y if s!=0
+	@param y another FP48 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP48_cmove(FP48 *x, FP48 *y, int s);
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp48_BLS48581.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp48_BLS48581.h
new file mode 100644
index 0000000..fdf7627
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp48_BLS48581.h
@@ -0,0 +1,231 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP48_BLS48581_H
+#define FP48_BLS48581_H
+
+#include "fp16_BLS48581.h"
+
+using namespace core;
+
+namespace BLS48581 {
+/**
+	@brief FP12 Structure - towered over three FP16
+*/
+
+typedef struct
+{
+    FP16 a; /**< first part of FP12 */
+    FP16 b; /**< second part of FP12 */
+    FP16 c; /**< third part of FP12 */
+    int type;
+} FP48;
+
+extern const B584_60::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B584_60::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+/* FP48 prototypes */
+/**	@brief Tests for FP48 equal to zero
+ *
+	@param x FP48 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP48_iszilch(FP48 *x);
+/**	@brief Tests for FP48 equal to unity
+ *
+	@param x FP48 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP48_isunity(FP48 *x);
+/**	@brief Copy FP48 to another FP48
+ *
+	@param x FP48 instance, on exit = y
+	@param y FP48 instance to be copied
+ */
+extern void FP48_copy(FP48 *x, FP48 *y);
+/**	@brief Set FP48 to unity
+ *
+	@param x FP48 instance to be set to one
+ */
+extern void FP48_one(FP48 *x);
+
+/**	@brief Set FP48 to zero
+ *
+	@param x FP48 instance to be set to zero
+ */
+extern void FP48_zero(FP48 *x);
+
+/**	@brief Tests for equality of two FP48s
+ *
+	@param x FP48 instance to be compared
+	@param y FP48 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP48_equals(FP48 *x, FP48 *y);
+/**	@brief Conjugation of FP48
+ *
+	If y=(a,b,c) (where a,b,c are its three FP16 components) on exit x=(conj(a),-conj(b),conj(c))
+	@param x FP48 instance, on exit = conj(y)
+	@param y FP48 instance
+ */
+extern void FP48_conj(FP48 *x, FP48 *y);
+/**	@brief Initialise FP48 from single FP16
+ *
+	Sets first FP16 component of an FP48, other components set to zero
+	@param x FP48 instance to be initialised
+	@param a FP16 to form first part of FP48
+ */
+extern void FP48_from_FP16(FP48 *x, FP16 *a);
+/**	@brief Initialise FP48 from three FP16s
+ *
+	@param x FP48 instance to be initialised
+	@param a FP16 to form first part of FP48
+	@param b FP16 to form second part of FP48
+	@param c FP16 to form third part of FP48
+ */
+extern void FP48_from_FP16s(FP48 *x, FP16 *a, FP16* b, FP16 *c);
+/**	@brief Fast Squaring of an FP48 in "unitary" form
+ *
+	@param x FP48 instance, on exit = y^2
+	@param y FP16 instance, must be unitary
+ */
+extern void FP48_usqr(FP48 *x, FP48 *y);
+/**	@brief Squaring an FP48
+ *
+	@param x FP48 instance, on exit = y^2
+	@param y FP48 instance
+ */
+extern void FP48_sqr(FP48 *x, FP48 *y);
+/**	@brief Fast multiplication of two sparse FP24s that arises from ATE pairing line functions
+ *
+	@param x FP48 instance, on exit = x*y
+	@param y FP48 instance, of special form
+ */
+extern void FP48_smul(FP48 *x, FP48 *y);
+
+/**	@brief Fast multiplication of what may be sparse multiplicands
+ *
+	@param x FP48 instance, on exit = x*y
+	@param y FP48 instance, of special form
+ */
+extern void FP48_ssmul(FP48 *x, FP48 *y);
+/**	@brief Full unconditional Multiplication of two FP24s
+ *
+	@param x FP48 instance, on exit = x*y
+	@param y FP48 instance, the multiplier
+ */
+extern void FP48_mul(FP48 *x, FP48 *y);
+/**	@brief Inverting an FP48
+ *
+	@param x FP48 instance, on exit = 1/y
+	@param y FP48 instance
+ */
+extern void FP48_inv(FP48 *x, FP48 *y);
+/**	@brief Raises an FP48 to the power of a BIG
+ *
+	@param r FP48 instance, on exit = y^b
+	@param x FP48 instance
+	@param b BIG number
+ */
+extern void FP48_pow(FP48 *r, FP48 *x, B584_60::BIG b);
+
+//extern void FP48_ppow(FP48 *r,FP48 *x,B584_60::BIG b);
+
+/**	@brief Raises an FP48 instance x to a small integer power, side-channel resistant
+ *
+	@param x FP48 instance, on exit = x^i
+	@param i small integer exponent
+	@param b maximum number of bits in exponent
+ */
+extern void FP48_pinpow(FP48 *x, int i, int b);
+
+/**	@brief Raises an FP48 instance x to a BIG power, compressed to FP16
+ *
+	@param c FP16 instance, on exit = x^(e mod r) as FP16
+	@param x FP48 input
+	@param e BIG exponent
+	@param r BIG group order
+ */
+extern void FP48_compow(FP16 *c, FP48 *x, B584_60::BIG e, B584_60::BIG r);
+
+/**	@brief Calculate Pi x[i]^b[i] for i=0 to 15, side-channel resistant
+ *
+	@param r FP48 instance, on exit = Pi x[i]^b[i] for i=0 to 15
+	@param x FP48 array with 16 FP48s
+	@param b BIG array of 16 exponents
+ */
+extern void FP48_pow16(FP48 *r, FP48 *x, B584_60::BIG *b);
+
+
+/**	@brief Raises an FP48 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP48 instance, on exit = x^p^n
+	@param f FP2 precalculated Frobenius constant
+	@param n power of p
+ */
+extern void FP48_frob(FP48 *x, FP2 *f, int n);
+
+/**	@brief Reduces all components of possibly unreduced FP48 mod Modulus
+ *
+	@param x FP48 instance, on exit reduced mod Modulus
+ */
+extern void FP48_reduce(FP48 *x);
+/**	@brief Normalises the components of an FP48
+ *
+	@param x FP48 instance to be normalised
+ */
+extern void FP48_norm(FP48 *x);
+/**	@brief Formats and outputs an FP48 to the console
+ *
+	@param x FP48 instance to be printed
+ */
+extern void FP48_output(FP48 *x);
+/**	@brief Formats and outputs an FP48 instance to an octet string
+ *
+	Serializes the components of an FP48 to big-endian base 256 form.
+	@param S output octet string
+	@param x FP48 instance to be converted to an octet string
+ */
+extern void FP48_toOctet(octet *S, FP48 *x);
+/**	@brief Creates an FP48 instance from an octet string
+ *
+	De-serializes the components of an FP48 to create an FP48 from big-endian base 256 components.
+	@param x FP48 instance to be created from an octet string
+	@param S input octet string
+
+ */
+extern void FP48_fromOctet(FP48 *x, octet *S);
+/**	@brief Calculate the trace of an FP48
+ *
+	@param t FP16 trace of x, on exit = tr(x)
+	@param x FP48 instance
+
+ */
+extern void FP48_trace(FP16 *t, FP48 *x);
+
+/**	@brief Conditional copy of FP48 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP48 instance, set to y if s!=0
+	@param y another FP48 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP48_cmove(FP48 *x, FP48 *y, int s);
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp4_BLS12381.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp4_BLS12381.h
new file mode 100644
index 0000000..7d84be6
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp4_BLS12381.h
@@ -0,0 +1,349 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP4_BLS12381_H
+#define FP4_BLS12381_H
+
+#include "fp2_BLS12381.h"
+#include "config_curve_BLS12381.h"
+
+using namespace core;
+
+namespace BLS12381 {
+
+/**
+	@brief FP4 Structure - towered over two FP2
+*/
+
+typedef struct
+{
+    FP2 a; /**< real part of FP4 */
+    FP2 b; /**< imaginary part of FP4 */
+} FP4;
+
+
+/* FP4 prototypes */
+/**	@brief Tests for FP4 equal to zero
+ *
+	@param x FP4 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP4_iszilch(FP4 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP4 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP4_islarger(FP4 *x);
+
+/**	@brief Serialize out FP4  
+ *
+    @param b buffer for output
+	@param x FP4 number to be serialized
+ */
+extern void FP4_toBytes(char *b,FP4 *x);
+
+/**	@brief Serialize in FP4  
+ *
+	@param x FP4 number to be serialized
+    @param b buffer for input
+ */
+extern void FP4_fromBytes(FP4 *x,char *b);
+
+/**	@brief Tests for FP4 equal to unity
+ *
+	@param x FP4 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP4_isunity(FP4 *x);
+/**	@brief Tests for equality of two FP4s
+ *
+	@param x FP4 instance to be compared
+	@param y FP4 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP4_equals(FP4 *x, FP4 *y);
+/**	@brief Tests for FP4 having only a real part and no imaginary part
+ *
+	@param x FP4 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP4_isreal(FP4 *x);
+/**	@brief Initialise FP4 from two FP2s
+ *
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+	@param b FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2s(FP4 *x, FP2 *a, FP2 *b);
+/**	@brief Initialise FP4 from single FP2
+ *
+	Imaginary part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+ */
+extern void FP4_from_FP2(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP2
+ *
+	real part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2H(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP
+ *
+	@param x FP4 instance to be initialised
+	@param a FP to form real part of FP4
+ */
+extern void FP4_from_FP(FP4 *x, FP *a);
+
+/**	@brief Copy FP4 to another FP4
+ *
+	@param x FP4 instance, on exit = y
+	@param y FP4 instance to be copied
+ */
+extern void FP4_copy(FP4 *x, FP4 *y);
+/**	@brief Set FP4 to zero
+ *
+	@param x FP4 instance to be set to zero
+ */
+extern void FP4_zero(FP4 *x);
+/**	@brief Set FP4 to unity
+ *
+	@param x FP4 instance to be set to one
+ */
+extern void FP4_one(FP4 *x);
+
+/**	@brief Sign of FP4
+ *
+	@param x FP4 instance
+	@return "sign" of FP4
+ */
+extern int FP4_sign(FP4 *x);
+
+/**	@brief Negation of FP4
+ *
+	@param x FP4 instance, on exit = -y
+	@param y FP4 instance
+ */
+extern void FP4_neg(FP4 *x, FP4 *y);
+/**	@brief Conjugation of FP4
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP4 instance, on exit = conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_conj(FP4 *x, FP4 *y);
+/**	@brief Negative conjugation of FP4
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP4 instance, on exit = -conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_nconj(FP4 *x, FP4 *y);
+/**	@brief addition of two FP4s
+ *
+	@param x FP4 instance, on exit = y+z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_add(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief subtraction of two FP4s
+ *
+	@param x FP4 instance, on exit = y-z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_sub(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Multiplication of an FP4 by an FP2
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP2 multiplier
+ */
+extern void FP4_pmul(FP4 *x, FP4 *y, FP2 *a);
+
+
+/**	@brief Multiplication of an FP4 by an FP
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP multiplier
+ */
+extern void FP4_qmul(FP4 *x, FP4 *y, FP *a);
+
+/**	@brief Multiplication of an FP4 by a small integer
+ *
+	@param x FP4 instance, on exit = y*i
+	@param y FP4 instance
+	@param i an integer
+ */
+extern void FP4_imul(FP4 *x, FP4 *y, int i);
+/**	@brief Squaring an FP4
+ *
+	@param x FP4 instance, on exit = y^2
+	@param y FP4 instance
+ */
+extern void FP4_sqr(FP4 *x, FP4 *y);
+/**	@brief Multiplication of two FP4s
+ *
+	@param x FP4 instance, on exit = y*z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_mul(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Inverting an FP4
+ *
+	@param x FP4 instance, on exit = 1/y
+	@param y FP4 instance
+    @param h optional input hint
+ */
+extern void FP4_inv(FP4 *x, FP4 *y, FP *h);
+
+/**	@brief Divide an FP4 by 2
+ *
+	@param x FP4 instance, on exit = y/2
+	@param y FP4 instance
+ */
+extern void FP4_div2(FP4 *x, FP4 *y);
+
+
+/**	@brief Formats and outputs an FP4 to the console
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_output(FP4 *x);
+/**	@brief Formats and outputs an FP4 to the console in raw form (for debugging)
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_rawoutput(FP4 *x);
+/**	@brief multiplies an FP4 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP4 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP4_times_i(FP4 *x);
+/**	@brief Normalises the components of an FP4
+ *
+	@param x FP4 instance to be normalised
+ */
+extern void FP4_norm(FP4 *x);
+/**	@brief Reduces all components of possibly unreduced FP4 mod Modulus
+ *
+	@param x FP4 instance, on exit reduced mod Modulus
+ */
+extern void FP4_reduce(FP4 *x);
+/**	@brief Raises an FP4 to the power of a BIG
+ *
+	@param x FP4 instance, on exit = y^b
+	@param y FP4 instance
+	@param b BIG number
+ */
+extern void FP4_pow(FP4 *x, FP4 *y, B384_58::BIG b);
+/**	@brief Raises an FP4 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP4 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP4_frob(FP4 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP4 instance, on exit = w*x-conj(x)*y+z
+	@param w FP4 instance
+	@param x FP4 instance
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_xtr_A(FP4 *r, FP4 *w, FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP4 instance, on exit = x^2-2*conj(x)
+	@param x FP4 instance
+ */
+extern void FP4_xtr_D(FP4 *r, FP4 *x);
+/**	@brief Calculates FP4 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP4 instance, on exit = trace(w^b)
+	@param x FP4 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP4_xtr_pow(FP4 *r, FP4 *x, B384_58::BIG b);
+/**	@brief Calculates FP4 trace of c^a.d^b, where c and d are derived from FP4 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP4 instance, on exit = trace(c^a.d^b)
+	@param c FP4 instance, trace of an FP12
+	@param d FP4 instance, trace of an FP12
+	@param e FP4 instance, trace of an FP12
+	@param f FP4 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP4_xtr_pow2(FP4 *r, FP4 *c, FP4 *d, FP4 *e, FP4 *f, B384_58::BIG a, B384_58::BIG b);
+
+/**	@brief Test FP4 for QR
+ * 
+	@param r FP4 instance
+    @param h optional generated hint
+	@return 1 x is a QR, otherwise 0
+ */
+extern int  FP4_qr(FP4 *r, FP *h);
+
+/**	@brief Calculate square root of an FP4
+ *
+	Square root
+	@param r FP4 instance, on exit = sqrt(x)
+	@param x FP4 instance
+    @param h optional input hint
+ */
+extern void  FP4_sqrt(FP4 *r, FP4 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP4 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP4 instance, set to y if s!=0
+	@param y another FP4 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP4_cmove(FP4 *x, FP4 *y, int s);
+
+
+/**	@brief Divide FP4 number by QNR
+ *
+	Divide FP4 by the QNR
+	@param x FP4 instance
+ */
+extern void FP4_div_i(FP4 *x);
+
+/**	@brief Generate random FP4
+ *
+	@param x random FP4 number
+	@param rng random number generator
+ */
+extern void FP4_rand(FP4 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp4_BLS12383.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp4_BLS12383.h
new file mode 100644
index 0000000..d8c77ca
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp4_BLS12383.h
@@ -0,0 +1,349 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP4_BLS12383_H
+#define FP4_BLS12383_H
+
+#include "fp2_BLS12383.h"
+#include "config_curve_BLS12383.h"
+
+using namespace core;
+
+namespace BLS12383 {
+
+/**
+	@brief FP4 Structure - towered over two FP2
+*/
+
+typedef struct
+{
+    FP2 a; /**< real part of FP4 */
+    FP2 b; /**< imaginary part of FP4 */
+} FP4;
+
+
+/* FP4 prototypes */
+/**	@brief Tests for FP4 equal to zero
+ *
+	@param x FP4 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP4_iszilch(FP4 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP4 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP4_islarger(FP4 *x);
+
+/**	@brief Serialize out FP4  
+ *
+    @param b buffer for output
+	@param x FP4 number to be serialized
+ */
+extern void FP4_toBytes(char *b,FP4 *x);
+
+/**	@brief Serialize in FP4  
+ *
+	@param x FP4 number to be serialized
+    @param b buffer for input
+ */
+extern void FP4_fromBytes(FP4 *x,char *b);
+
+/**	@brief Tests for FP4 equal to unity
+ *
+	@param x FP4 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP4_isunity(FP4 *x);
+/**	@brief Tests for equality of two FP4s
+ *
+	@param x FP4 instance to be compared
+	@param y FP4 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP4_equals(FP4 *x, FP4 *y);
+/**	@brief Tests for FP4 having only a real part and no imaginary part
+ *
+	@param x FP4 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP4_isreal(FP4 *x);
+/**	@brief Initialise FP4 from two FP2s
+ *
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+	@param b FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2s(FP4 *x, FP2 *a, FP2 *b);
+/**	@brief Initialise FP4 from single FP2
+ *
+	Imaginary part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+ */
+extern void FP4_from_FP2(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP2
+ *
+	real part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2H(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP
+ *
+	@param x FP4 instance to be initialised
+	@param a FP to form real part of FP4
+ */
+extern void FP4_from_FP(FP4 *x, FP *a);
+
+/**	@brief Copy FP4 to another FP4
+ *
+	@param x FP4 instance, on exit = y
+	@param y FP4 instance to be copied
+ */
+extern void FP4_copy(FP4 *x, FP4 *y);
+/**	@brief Set FP4 to zero
+ *
+	@param x FP4 instance to be set to zero
+ */
+extern void FP4_zero(FP4 *x);
+/**	@brief Set FP4 to unity
+ *
+	@param x FP4 instance to be set to one
+ */
+extern void FP4_one(FP4 *x);
+
+/**	@brief Sign of FP4
+ *
+	@param x FP4 instance
+	@return "sign" of FP4
+ */
+extern int FP4_sign(FP4 *x);
+
+/**	@brief Negation of FP4
+ *
+	@param x FP4 instance, on exit = -y
+	@param y FP4 instance
+ */
+extern void FP4_neg(FP4 *x, FP4 *y);
+/**	@brief Conjugation of FP4
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP4 instance, on exit = conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_conj(FP4 *x, FP4 *y);
+/**	@brief Negative conjugation of FP4
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP4 instance, on exit = -conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_nconj(FP4 *x, FP4 *y);
+/**	@brief addition of two FP4s
+ *
+	@param x FP4 instance, on exit = y+z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_add(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief subtraction of two FP4s
+ *
+	@param x FP4 instance, on exit = y-z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_sub(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Multiplication of an FP4 by an FP2
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP2 multiplier
+ */
+extern void FP4_pmul(FP4 *x, FP4 *y, FP2 *a);
+
+
+/**	@brief Multiplication of an FP4 by an FP
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP multiplier
+ */
+extern void FP4_qmul(FP4 *x, FP4 *y, FP *a);
+
+/**	@brief Multiplication of an FP4 by a small integer
+ *
+	@param x FP4 instance, on exit = y*i
+	@param y FP4 instance
+	@param i an integer
+ */
+extern void FP4_imul(FP4 *x, FP4 *y, int i);
+/**	@brief Squaring an FP4
+ *
+	@param x FP4 instance, on exit = y^2
+	@param y FP4 instance
+ */
+extern void FP4_sqr(FP4 *x, FP4 *y);
+/**	@brief Multiplication of two FP4s
+ *
+	@param x FP4 instance, on exit = y*z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_mul(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Inverting an FP4
+ *
+	@param x FP4 instance, on exit = 1/y
+	@param y FP4 instance
+    @param h optional input hint
+ */
+extern void FP4_inv(FP4 *x, FP4 *y, FP *h);
+
+/**	@brief Divide an FP4 by 2
+ *
+	@param x FP4 instance, on exit = y/2
+	@param y FP4 instance
+ */
+extern void FP4_div2(FP4 *x, FP4 *y);
+
+
+/**	@brief Formats and outputs an FP4 to the console
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_output(FP4 *x);
+/**	@brief Formats and outputs an FP4 to the console in raw form (for debugging)
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_rawoutput(FP4 *x);
+/**	@brief multiplies an FP4 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP4 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP4_times_i(FP4 *x);
+/**	@brief Normalises the components of an FP4
+ *
+	@param x FP4 instance to be normalised
+ */
+extern void FP4_norm(FP4 *x);
+/**	@brief Reduces all components of possibly unreduced FP4 mod Modulus
+ *
+	@param x FP4 instance, on exit reduced mod Modulus
+ */
+extern void FP4_reduce(FP4 *x);
+/**	@brief Raises an FP4 to the power of a BIG
+ *
+	@param x FP4 instance, on exit = y^b
+	@param y FP4 instance
+	@param b BIG number
+ */
+extern void FP4_pow(FP4 *x, FP4 *y, B384_58::BIG b);
+/**	@brief Raises an FP4 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP4 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP4_frob(FP4 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP4 instance, on exit = w*x-conj(x)*y+z
+	@param w FP4 instance
+	@param x FP4 instance
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_xtr_A(FP4 *r, FP4 *w, FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP4 instance, on exit = x^2-2*conj(x)
+	@param x FP4 instance
+ */
+extern void FP4_xtr_D(FP4 *r, FP4 *x);
+/**	@brief Calculates FP4 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP4 instance, on exit = trace(w^b)
+	@param x FP4 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP4_xtr_pow(FP4 *r, FP4 *x, B384_58::BIG b);
+/**	@brief Calculates FP4 trace of c^a.d^b, where c and d are derived from FP4 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP4 instance, on exit = trace(c^a.d^b)
+	@param c FP4 instance, trace of an FP12
+	@param d FP4 instance, trace of an FP12
+	@param e FP4 instance, trace of an FP12
+	@param f FP4 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP4_xtr_pow2(FP4 *r, FP4 *c, FP4 *d, FP4 *e, FP4 *f, B384_58::BIG a, B384_58::BIG b);
+
+/**	@brief Test FP4 for QR
+ * 
+	@param r FP4 instance
+    @param h optional generated hint
+	@return 1 x is a QR, otherwise 0
+ */
+extern int  FP4_qr(FP4 *r, FP *h);
+
+/**	@brief Calculate square root of an FP4
+ *
+	Square root
+	@param r FP4 instance, on exit = sqrt(x)
+	@param x FP4 instance
+    @param h optional input hint
+ */
+extern void  FP4_sqrt(FP4 *r, FP4 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP4 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP4 instance, set to y if s!=0
+	@param y another FP4 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP4_cmove(FP4 *x, FP4 *y, int s);
+
+
+/**	@brief Divide FP4 number by QNR
+ *
+	Divide FP4 by the QNR
+	@param x FP4 instance
+ */
+extern void FP4_div_i(FP4 *x);
+
+/**	@brief Generate random FP4
+ *
+	@param x random FP4 number
+	@param rng random number generator
+ */
+extern void FP4_rand(FP4 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp4_BLS12443.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp4_BLS12443.h
new file mode 100644
index 0000000..34dee30
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp4_BLS12443.h
@@ -0,0 +1,349 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP4_BLS12443_H
+#define FP4_BLS12443_H
+
+#include "fp2_BLS12443.h"
+#include "config_curve_BLS12443.h"
+
+using namespace core;
+
+namespace BLS12443 {
+
+/**
+	@brief FP4 Structure - towered over two FP2
+*/
+
+typedef struct
+{
+    FP2 a; /**< real part of FP4 */
+    FP2 b; /**< imaginary part of FP4 */
+} FP4;
+
+
+/* FP4 prototypes */
+/**	@brief Tests for FP4 equal to zero
+ *
+	@param x FP4 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP4_iszilch(FP4 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP4 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP4_islarger(FP4 *x);
+
+/**	@brief Serialize out FP4  
+ *
+    @param b buffer for output
+	@param x FP4 number to be serialized
+ */
+extern void FP4_toBytes(char *b,FP4 *x);
+
+/**	@brief Serialize in FP4  
+ *
+	@param x FP4 number to be serialized
+    @param b buffer for input
+ */
+extern void FP4_fromBytes(FP4 *x,char *b);
+
+/**	@brief Tests for FP4 equal to unity
+ *
+	@param x FP4 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP4_isunity(FP4 *x);
+/**	@brief Tests for equality of two FP4s
+ *
+	@param x FP4 instance to be compared
+	@param y FP4 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP4_equals(FP4 *x, FP4 *y);
+/**	@brief Tests for FP4 having only a real part and no imaginary part
+ *
+	@param x FP4 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP4_isreal(FP4 *x);
+/**	@brief Initialise FP4 from two FP2s
+ *
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+	@param b FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2s(FP4 *x, FP2 *a, FP2 *b);
+/**	@brief Initialise FP4 from single FP2
+ *
+	Imaginary part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+ */
+extern void FP4_from_FP2(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP2
+ *
+	real part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2H(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP
+ *
+	@param x FP4 instance to be initialised
+	@param a FP to form real part of FP4
+ */
+extern void FP4_from_FP(FP4 *x, FP *a);
+
+/**	@brief Copy FP4 to another FP4
+ *
+	@param x FP4 instance, on exit = y
+	@param y FP4 instance to be copied
+ */
+extern void FP4_copy(FP4 *x, FP4 *y);
+/**	@brief Set FP4 to zero
+ *
+	@param x FP4 instance to be set to zero
+ */
+extern void FP4_zero(FP4 *x);
+/**	@brief Set FP4 to unity
+ *
+	@param x FP4 instance to be set to one
+ */
+extern void FP4_one(FP4 *x);
+
+/**	@brief Sign of FP4
+ *
+	@param x FP4 instance
+	@return "sign" of FP4
+ */
+extern int FP4_sign(FP4 *x);
+
+/**	@brief Negation of FP4
+ *
+	@param x FP4 instance, on exit = -y
+	@param y FP4 instance
+ */
+extern void FP4_neg(FP4 *x, FP4 *y);
+/**	@brief Conjugation of FP4
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP4 instance, on exit = conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_conj(FP4 *x, FP4 *y);
+/**	@brief Negative conjugation of FP4
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP4 instance, on exit = -conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_nconj(FP4 *x, FP4 *y);
+/**	@brief addition of two FP4s
+ *
+	@param x FP4 instance, on exit = y+z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_add(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief subtraction of two FP4s
+ *
+	@param x FP4 instance, on exit = y-z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_sub(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Multiplication of an FP4 by an FP2
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP2 multiplier
+ */
+extern void FP4_pmul(FP4 *x, FP4 *y, FP2 *a);
+
+
+/**	@brief Multiplication of an FP4 by an FP
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP multiplier
+ */
+extern void FP4_qmul(FP4 *x, FP4 *y, FP *a);
+
+/**	@brief Multiplication of an FP4 by a small integer
+ *
+	@param x FP4 instance, on exit = y*i
+	@param y FP4 instance
+	@param i an integer
+ */
+extern void FP4_imul(FP4 *x, FP4 *y, int i);
+/**	@brief Squaring an FP4
+ *
+	@param x FP4 instance, on exit = y^2
+	@param y FP4 instance
+ */
+extern void FP4_sqr(FP4 *x, FP4 *y);
+/**	@brief Multiplication of two FP4s
+ *
+	@param x FP4 instance, on exit = y*z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_mul(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Inverting an FP4
+ *
+	@param x FP4 instance, on exit = 1/y
+	@param y FP4 instance
+    @param h optional input hint
+ */
+extern void FP4_inv(FP4 *x, FP4 *y, FP *h);
+
+/**	@brief Divide an FP4 by 2
+ *
+	@param x FP4 instance, on exit = y/2
+	@param y FP4 instance
+ */
+extern void FP4_div2(FP4 *x, FP4 *y);
+
+
+/**	@brief Formats and outputs an FP4 to the console
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_output(FP4 *x);
+/**	@brief Formats and outputs an FP4 to the console in raw form (for debugging)
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_rawoutput(FP4 *x);
+/**	@brief multiplies an FP4 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP4 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP4_times_i(FP4 *x);
+/**	@brief Normalises the components of an FP4
+ *
+	@param x FP4 instance to be normalised
+ */
+extern void FP4_norm(FP4 *x);
+/**	@brief Reduces all components of possibly unreduced FP4 mod Modulus
+ *
+	@param x FP4 instance, on exit reduced mod Modulus
+ */
+extern void FP4_reduce(FP4 *x);
+/**	@brief Raises an FP4 to the power of a BIG
+ *
+	@param x FP4 instance, on exit = y^b
+	@param y FP4 instance
+	@param b BIG number
+ */
+extern void FP4_pow(FP4 *x, FP4 *y, B448_60::BIG b);
+/**	@brief Raises an FP4 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP4 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP4_frob(FP4 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP4 instance, on exit = w*x-conj(x)*y+z
+	@param w FP4 instance
+	@param x FP4 instance
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_xtr_A(FP4 *r, FP4 *w, FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP4 instance, on exit = x^2-2*conj(x)
+	@param x FP4 instance
+ */
+extern void FP4_xtr_D(FP4 *r, FP4 *x);
+/**	@brief Calculates FP4 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP4 instance, on exit = trace(w^b)
+	@param x FP4 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP4_xtr_pow(FP4 *r, FP4 *x, B448_60::BIG b);
+/**	@brief Calculates FP4 trace of c^a.d^b, where c and d are derived from FP4 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP4 instance, on exit = trace(c^a.d^b)
+	@param c FP4 instance, trace of an FP12
+	@param d FP4 instance, trace of an FP12
+	@param e FP4 instance, trace of an FP12
+	@param f FP4 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP4_xtr_pow2(FP4 *r, FP4 *c, FP4 *d, FP4 *e, FP4 *f, B448_60::BIG a, B448_60::BIG b);
+
+/**	@brief Test FP4 for QR
+ * 
+	@param r FP4 instance
+    @param h optional generated hint
+	@return 1 x is a QR, otherwise 0
+ */
+extern int  FP4_qr(FP4 *r, FP *h);
+
+/**	@brief Calculate square root of an FP4
+ *
+	Square root
+	@param r FP4 instance, on exit = sqrt(x)
+	@param x FP4 instance
+    @param h optional input hint
+ */
+extern void  FP4_sqrt(FP4 *r, FP4 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP4 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP4 instance, set to y if s!=0
+	@param y another FP4 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP4_cmove(FP4 *x, FP4 *y, int s);
+
+
+/**	@brief Divide FP4 number by QNR
+ *
+	Divide FP4 by the QNR
+	@param x FP4 instance
+ */
+extern void FP4_div_i(FP4 *x);
+
+/**	@brief Generate random FP4
+ *
+	@param x random FP4 number
+	@param rng random number generator
+ */
+extern void FP4_rand(FP4 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp4_BLS12461.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp4_BLS12461.h
new file mode 100644
index 0000000..203a67c
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp4_BLS12461.h
@@ -0,0 +1,349 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP4_BLS12461_H
+#define FP4_BLS12461_H
+
+#include "fp2_BLS12461.h"
+#include "config_curve_BLS12461.h"
+
+using namespace core;
+
+namespace BLS12461 {
+
+/**
+	@brief FP4 Structure - towered over two FP2
+*/
+
+typedef struct
+{
+    FP2 a; /**< real part of FP4 */
+    FP2 b; /**< imaginary part of FP4 */
+} FP4;
+
+
+/* FP4 prototypes */
+/**	@brief Tests for FP4 equal to zero
+ *
+	@param x FP4 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP4_iszilch(FP4 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP4 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP4_islarger(FP4 *x);
+
+/**	@brief Serialize out FP4  
+ *
+    @param b buffer for output
+	@param x FP4 number to be serialized
+ */
+extern void FP4_toBytes(char *b,FP4 *x);
+
+/**	@brief Serialize in FP4  
+ *
+	@param x FP4 number to be serialized
+    @param b buffer for input
+ */
+extern void FP4_fromBytes(FP4 *x,char *b);
+
+/**	@brief Tests for FP4 equal to unity
+ *
+	@param x FP4 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP4_isunity(FP4 *x);
+/**	@brief Tests for equality of two FP4s
+ *
+	@param x FP4 instance to be compared
+	@param y FP4 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP4_equals(FP4 *x, FP4 *y);
+/**	@brief Tests for FP4 having only a real part and no imaginary part
+ *
+	@param x FP4 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP4_isreal(FP4 *x);
+/**	@brief Initialise FP4 from two FP2s
+ *
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+	@param b FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2s(FP4 *x, FP2 *a, FP2 *b);
+/**	@brief Initialise FP4 from single FP2
+ *
+	Imaginary part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+ */
+extern void FP4_from_FP2(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP2
+ *
+	real part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2H(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP
+ *
+	@param x FP4 instance to be initialised
+	@param a FP to form real part of FP4
+ */
+extern void FP4_from_FP(FP4 *x, FP *a);
+
+/**	@brief Copy FP4 to another FP4
+ *
+	@param x FP4 instance, on exit = y
+	@param y FP4 instance to be copied
+ */
+extern void FP4_copy(FP4 *x, FP4 *y);
+/**	@brief Set FP4 to zero
+ *
+	@param x FP4 instance to be set to zero
+ */
+extern void FP4_zero(FP4 *x);
+/**	@brief Set FP4 to unity
+ *
+	@param x FP4 instance to be set to one
+ */
+extern void FP4_one(FP4 *x);
+
+/**	@brief Sign of FP4
+ *
+	@param x FP4 instance
+	@return "sign" of FP4
+ */
+extern int FP4_sign(FP4 *x);
+
+/**	@brief Negation of FP4
+ *
+	@param x FP4 instance, on exit = -y
+	@param y FP4 instance
+ */
+extern void FP4_neg(FP4 *x, FP4 *y);
+/**	@brief Conjugation of FP4
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP4 instance, on exit = conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_conj(FP4 *x, FP4 *y);
+/**	@brief Negative conjugation of FP4
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP4 instance, on exit = -conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_nconj(FP4 *x, FP4 *y);
+/**	@brief addition of two FP4s
+ *
+	@param x FP4 instance, on exit = y+z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_add(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief subtraction of two FP4s
+ *
+	@param x FP4 instance, on exit = y-z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_sub(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Multiplication of an FP4 by an FP2
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP2 multiplier
+ */
+extern void FP4_pmul(FP4 *x, FP4 *y, FP2 *a);
+
+
+/**	@brief Multiplication of an FP4 by an FP
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP multiplier
+ */
+extern void FP4_qmul(FP4 *x, FP4 *y, FP *a);
+
+/**	@brief Multiplication of an FP4 by a small integer
+ *
+	@param x FP4 instance, on exit = y*i
+	@param y FP4 instance
+	@param i an integer
+ */
+extern void FP4_imul(FP4 *x, FP4 *y, int i);
+/**	@brief Squaring an FP4
+ *
+	@param x FP4 instance, on exit = y^2
+	@param y FP4 instance
+ */
+extern void FP4_sqr(FP4 *x, FP4 *y);
+/**	@brief Multiplication of two FP4s
+ *
+	@param x FP4 instance, on exit = y*z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_mul(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Inverting an FP4
+ *
+	@param x FP4 instance, on exit = 1/y
+	@param y FP4 instance
+    @param h optional input hint
+ */
+extern void FP4_inv(FP4 *x, FP4 *y, FP *h);
+
+/**	@brief Divide an FP4 by 2
+ *
+	@param x FP4 instance, on exit = y/2
+	@param y FP4 instance
+ */
+extern void FP4_div2(FP4 *x, FP4 *y);
+
+
+/**	@brief Formats and outputs an FP4 to the console
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_output(FP4 *x);
+/**	@brief Formats and outputs an FP4 to the console in raw form (for debugging)
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_rawoutput(FP4 *x);
+/**	@brief multiplies an FP4 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP4 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP4_times_i(FP4 *x);
+/**	@brief Normalises the components of an FP4
+ *
+	@param x FP4 instance to be normalised
+ */
+extern void FP4_norm(FP4 *x);
+/**	@brief Reduces all components of possibly unreduced FP4 mod Modulus
+ *
+	@param x FP4 instance, on exit reduced mod Modulus
+ */
+extern void FP4_reduce(FP4 *x);
+/**	@brief Raises an FP4 to the power of a BIG
+ *
+	@param x FP4 instance, on exit = y^b
+	@param y FP4 instance
+	@param b BIG number
+ */
+extern void FP4_pow(FP4 *x, FP4 *y, B464_60::BIG b);
+/**	@brief Raises an FP4 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP4 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP4_frob(FP4 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP4 instance, on exit = w*x-conj(x)*y+z
+	@param w FP4 instance
+	@param x FP4 instance
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_xtr_A(FP4 *r, FP4 *w, FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP4 instance, on exit = x^2-2*conj(x)
+	@param x FP4 instance
+ */
+extern void FP4_xtr_D(FP4 *r, FP4 *x);
+/**	@brief Calculates FP4 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP4 instance, on exit = trace(w^b)
+	@param x FP4 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP4_xtr_pow(FP4 *r, FP4 *x, B464_60::BIG b);
+/**	@brief Calculates FP4 trace of c^a.d^b, where c and d are derived from FP4 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP4 instance, on exit = trace(c^a.d^b)
+	@param c FP4 instance, trace of an FP12
+	@param d FP4 instance, trace of an FP12
+	@param e FP4 instance, trace of an FP12
+	@param f FP4 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP4_xtr_pow2(FP4 *r, FP4 *c, FP4 *d, FP4 *e, FP4 *f, B464_60::BIG a, B464_60::BIG b);
+
+/**	@brief Test FP4 for QR
+ * 
+	@param r FP4 instance
+    @param h optional generated hint
+	@return 1 x is a QR, otherwise 0
+ */
+extern int  FP4_qr(FP4 *r, FP *h);
+
+/**	@brief Calculate square root of an FP4
+ *
+	Square root
+	@param r FP4 instance, on exit = sqrt(x)
+	@param x FP4 instance
+    @param h optional input hint
+ */
+extern void  FP4_sqrt(FP4 *r, FP4 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP4 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP4 instance, set to y if s!=0
+	@param y another FP4 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP4_cmove(FP4 *x, FP4 *y, int s);
+
+
+/**	@brief Divide FP4 number by QNR
+ *
+	Divide FP4 by the QNR
+	@param x FP4 instance
+ */
+extern void FP4_div_i(FP4 *x);
+
+/**	@brief Generate random FP4
+ *
+	@param x random FP4 number
+	@param rng random number generator
+ */
+extern void FP4_rand(FP4 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp4_BLS24479.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp4_BLS24479.h
new file mode 100644
index 0000000..e6a193c
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp4_BLS24479.h
@@ -0,0 +1,349 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP4_BLS24479_H
+#define FP4_BLS24479_H
+
+#include "fp2_BLS24479.h"
+#include "config_curve_BLS24479.h"
+
+using namespace core;
+
+namespace BLS24479 {
+
+/**
+	@brief FP4 Structure - towered over two FP2
+*/
+
+typedef struct
+{
+    FP2 a; /**< real part of FP4 */
+    FP2 b; /**< imaginary part of FP4 */
+} FP4;
+
+
+/* FP4 prototypes */
+/**	@brief Tests for FP4 equal to zero
+ *
+	@param x FP4 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP4_iszilch(FP4 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP4 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP4_islarger(FP4 *x);
+
+/**	@brief Serialize out FP4  
+ *
+    @param b buffer for output
+	@param x FP4 number to be serialized
+ */
+extern void FP4_toBytes(char *b,FP4 *x);
+
+/**	@brief Serialize in FP4  
+ *
+	@param x FP4 number to be serialized
+    @param b buffer for input
+ */
+extern void FP4_fromBytes(FP4 *x,char *b);
+
+/**	@brief Tests for FP4 equal to unity
+ *
+	@param x FP4 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP4_isunity(FP4 *x);
+/**	@brief Tests for equality of two FP4s
+ *
+	@param x FP4 instance to be compared
+	@param y FP4 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP4_equals(FP4 *x, FP4 *y);
+/**	@brief Tests for FP4 having only a real part and no imaginary part
+ *
+	@param x FP4 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP4_isreal(FP4 *x);
+/**	@brief Initialise FP4 from two FP2s
+ *
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+	@param b FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2s(FP4 *x, FP2 *a, FP2 *b);
+/**	@brief Initialise FP4 from single FP2
+ *
+	Imaginary part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+ */
+extern void FP4_from_FP2(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP2
+ *
+	real part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2H(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP
+ *
+	@param x FP4 instance to be initialised
+	@param a FP to form real part of FP4
+ */
+extern void FP4_from_FP(FP4 *x, FP *a);
+
+/**	@brief Copy FP4 to another FP4
+ *
+	@param x FP4 instance, on exit = y
+	@param y FP4 instance to be copied
+ */
+extern void FP4_copy(FP4 *x, FP4 *y);
+/**	@brief Set FP4 to zero
+ *
+	@param x FP4 instance to be set to zero
+ */
+extern void FP4_zero(FP4 *x);
+/**	@brief Set FP4 to unity
+ *
+	@param x FP4 instance to be set to one
+ */
+extern void FP4_one(FP4 *x);
+
+/**	@brief Sign of FP4
+ *
+	@param x FP4 instance
+	@return "sign" of FP4
+ */
+extern int FP4_sign(FP4 *x);
+
+/**	@brief Negation of FP4
+ *
+	@param x FP4 instance, on exit = -y
+	@param y FP4 instance
+ */
+extern void FP4_neg(FP4 *x, FP4 *y);
+/**	@brief Conjugation of FP4
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP4 instance, on exit = conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_conj(FP4 *x, FP4 *y);
+/**	@brief Negative conjugation of FP4
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP4 instance, on exit = -conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_nconj(FP4 *x, FP4 *y);
+/**	@brief addition of two FP4s
+ *
+	@param x FP4 instance, on exit = y+z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_add(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief subtraction of two FP4s
+ *
+	@param x FP4 instance, on exit = y-z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_sub(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Multiplication of an FP4 by an FP2
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP2 multiplier
+ */
+extern void FP4_pmul(FP4 *x, FP4 *y, FP2 *a);
+
+
+/**	@brief Multiplication of an FP4 by an FP
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP multiplier
+ */
+extern void FP4_qmul(FP4 *x, FP4 *y, FP *a);
+
+/**	@brief Multiplication of an FP4 by a small integer
+ *
+	@param x FP4 instance, on exit = y*i
+	@param y FP4 instance
+	@param i an integer
+ */
+extern void FP4_imul(FP4 *x, FP4 *y, int i);
+/**	@brief Squaring an FP4
+ *
+	@param x FP4 instance, on exit = y^2
+	@param y FP4 instance
+ */
+extern void FP4_sqr(FP4 *x, FP4 *y);
+/**	@brief Multiplication of two FP4s
+ *
+	@param x FP4 instance, on exit = y*z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_mul(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Inverting an FP4
+ *
+	@param x FP4 instance, on exit = 1/y
+	@param y FP4 instance
+    @param h optional input hint
+ */
+extern void FP4_inv(FP4 *x, FP4 *y, FP *h);
+
+/**	@brief Divide an FP4 by 2
+ *
+	@param x FP4 instance, on exit = y/2
+	@param y FP4 instance
+ */
+extern void FP4_div2(FP4 *x, FP4 *y);
+
+
+/**	@brief Formats and outputs an FP4 to the console
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_output(FP4 *x);
+/**	@brief Formats and outputs an FP4 to the console in raw form (for debugging)
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_rawoutput(FP4 *x);
+/**	@brief multiplies an FP4 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP4 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP4_times_i(FP4 *x);
+/**	@brief Normalises the components of an FP4
+ *
+	@param x FP4 instance to be normalised
+ */
+extern void FP4_norm(FP4 *x);
+/**	@brief Reduces all components of possibly unreduced FP4 mod Modulus
+ *
+	@param x FP4 instance, on exit reduced mod Modulus
+ */
+extern void FP4_reduce(FP4 *x);
+/**	@brief Raises an FP4 to the power of a BIG
+ *
+	@param x FP4 instance, on exit = y^b
+	@param y FP4 instance
+	@param b BIG number
+ */
+extern void FP4_pow(FP4 *x, FP4 *y, B480_56::BIG b);
+/**	@brief Raises an FP4 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP4 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP4_frob(FP4 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP4 instance, on exit = w*x-conj(x)*y+z
+	@param w FP4 instance
+	@param x FP4 instance
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_xtr_A(FP4 *r, FP4 *w, FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP4 instance, on exit = x^2-2*conj(x)
+	@param x FP4 instance
+ */
+extern void FP4_xtr_D(FP4 *r, FP4 *x);
+/**	@brief Calculates FP4 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP4 instance, on exit = trace(w^b)
+	@param x FP4 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP4_xtr_pow(FP4 *r, FP4 *x, B480_56::BIG b);
+/**	@brief Calculates FP4 trace of c^a.d^b, where c and d are derived from FP4 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP4 instance, on exit = trace(c^a.d^b)
+	@param c FP4 instance, trace of an FP12
+	@param d FP4 instance, trace of an FP12
+	@param e FP4 instance, trace of an FP12
+	@param f FP4 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP4_xtr_pow2(FP4 *r, FP4 *c, FP4 *d, FP4 *e, FP4 *f, B480_56::BIG a, B480_56::BIG b);
+
+/**	@brief Test FP4 for QR
+ * 
+	@param r FP4 instance
+    @param h optional generated hint
+	@return 1 x is a QR, otherwise 0
+ */
+extern int  FP4_qr(FP4 *r, FP *h);
+
+/**	@brief Calculate square root of an FP4
+ *
+	Square root
+	@param r FP4 instance, on exit = sqrt(x)
+	@param x FP4 instance
+    @param h optional input hint
+ */
+extern void  FP4_sqrt(FP4 *r, FP4 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP4 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP4 instance, set to y if s!=0
+	@param y another FP4 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP4_cmove(FP4 *x, FP4 *y, int s);
+
+
+/**	@brief Divide FP4 number by QNR
+ *
+	Divide FP4 by the QNR
+	@param x FP4 instance
+ */
+extern void FP4_div_i(FP4 *x);
+
+/**	@brief Generate random FP4
+ *
+	@param x random FP4 number
+	@param rng random number generator
+ */
+extern void FP4_rand(FP4 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp4_BLS48286.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp4_BLS48286.h
new file mode 100644
index 0000000..aad06f8
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp4_BLS48286.h
@@ -0,0 +1,349 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP4_BLS48286_H
+#define FP4_BLS48286_H
+
+#include "fp2_BLS48286.h"
+#include "config_curve_BLS48286.h"
+
+using namespace core;
+
+namespace BLS48286 {
+
+/**
+	@brief FP4 Structure - towered over two FP2
+*/
+
+typedef struct
+{
+    FP2 a; /**< real part of FP4 */
+    FP2 b; /**< imaginary part of FP4 */
+} FP4;
+
+
+/* FP4 prototypes */
+/**	@brief Tests for FP4 equal to zero
+ *
+	@param x FP4 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP4_iszilch(FP4 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP4 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP4_islarger(FP4 *x);
+
+/**	@brief Serialize out FP4  
+ *
+    @param b buffer for output
+	@param x FP4 number to be serialized
+ */
+extern void FP4_toBytes(char *b,FP4 *x);
+
+/**	@brief Serialize in FP4  
+ *
+	@param x FP4 number to be serialized
+    @param b buffer for input
+ */
+extern void FP4_fromBytes(FP4 *x,char *b);
+
+/**	@brief Tests for FP4 equal to unity
+ *
+	@param x FP4 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP4_isunity(FP4 *x);
+/**	@brief Tests for equality of two FP4s
+ *
+	@param x FP4 instance to be compared
+	@param y FP4 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP4_equals(FP4 *x, FP4 *y);
+/**	@brief Tests for FP4 having only a real part and no imaginary part
+ *
+	@param x FP4 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP4_isreal(FP4 *x);
+/**	@brief Initialise FP4 from two FP2s
+ *
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+	@param b FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2s(FP4 *x, FP2 *a, FP2 *b);
+/**	@brief Initialise FP4 from single FP2
+ *
+	Imaginary part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+ */
+extern void FP4_from_FP2(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP2
+ *
+	real part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2H(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP
+ *
+	@param x FP4 instance to be initialised
+	@param a FP to form real part of FP4
+ */
+extern void FP4_from_FP(FP4 *x, FP *a);
+
+/**	@brief Copy FP4 to another FP4
+ *
+	@param x FP4 instance, on exit = y
+	@param y FP4 instance to be copied
+ */
+extern void FP4_copy(FP4 *x, FP4 *y);
+/**	@brief Set FP4 to zero
+ *
+	@param x FP4 instance to be set to zero
+ */
+extern void FP4_zero(FP4 *x);
+/**	@brief Set FP4 to unity
+ *
+	@param x FP4 instance to be set to one
+ */
+extern void FP4_one(FP4 *x);
+
+/**	@brief Sign of FP4
+ *
+	@param x FP4 instance
+	@return "sign" of FP4
+ */
+extern int FP4_sign(FP4 *x);
+
+/**	@brief Negation of FP4
+ *
+	@param x FP4 instance, on exit = -y
+	@param y FP4 instance
+ */
+extern void FP4_neg(FP4 *x, FP4 *y);
+/**	@brief Conjugation of FP4
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP4 instance, on exit = conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_conj(FP4 *x, FP4 *y);
+/**	@brief Negative conjugation of FP4
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP4 instance, on exit = -conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_nconj(FP4 *x, FP4 *y);
+/**	@brief addition of two FP4s
+ *
+	@param x FP4 instance, on exit = y+z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_add(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief subtraction of two FP4s
+ *
+	@param x FP4 instance, on exit = y-z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_sub(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Multiplication of an FP4 by an FP2
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP2 multiplier
+ */
+extern void FP4_pmul(FP4 *x, FP4 *y, FP2 *a);
+
+
+/**	@brief Multiplication of an FP4 by an FP
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP multiplier
+ */
+extern void FP4_qmul(FP4 *x, FP4 *y, FP *a);
+
+/**	@brief Multiplication of an FP4 by a small integer
+ *
+	@param x FP4 instance, on exit = y*i
+	@param y FP4 instance
+	@param i an integer
+ */
+extern void FP4_imul(FP4 *x, FP4 *y, int i);
+/**	@brief Squaring an FP4
+ *
+	@param x FP4 instance, on exit = y^2
+	@param y FP4 instance
+ */
+extern void FP4_sqr(FP4 *x, FP4 *y);
+/**	@brief Multiplication of two FP4s
+ *
+	@param x FP4 instance, on exit = y*z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_mul(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Inverting an FP4
+ *
+	@param x FP4 instance, on exit = 1/y
+	@param y FP4 instance
+    @param h optional input hint
+ */
+extern void FP4_inv(FP4 *x, FP4 *y, FP *h);
+
+/**	@brief Divide an FP4 by 2
+ *
+	@param x FP4 instance, on exit = y/2
+	@param y FP4 instance
+ */
+extern void FP4_div2(FP4 *x, FP4 *y);
+
+
+/**	@brief Formats and outputs an FP4 to the console
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_output(FP4 *x);
+/**	@brief Formats and outputs an FP4 to the console in raw form (for debugging)
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_rawoutput(FP4 *x);
+/**	@brief multiplies an FP4 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP4 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP4_times_i(FP4 *x);
+/**	@brief Normalises the components of an FP4
+ *
+	@param x FP4 instance to be normalised
+ */
+extern void FP4_norm(FP4 *x);
+/**	@brief Reduces all components of possibly unreduced FP4 mod Modulus
+ *
+	@param x FP4 instance, on exit reduced mod Modulus
+ */
+extern void FP4_reduce(FP4 *x);
+/**	@brief Raises an FP4 to the power of a BIG
+ *
+	@param x FP4 instance, on exit = y^b
+	@param y FP4 instance
+	@param b BIG number
+ */
+extern void FP4_pow(FP4 *x, FP4 *y, B288_60::BIG b);
+/**	@brief Raises an FP4 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP4 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP4_frob(FP4 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP4 instance, on exit = w*x-conj(x)*y+z
+	@param w FP4 instance
+	@param x FP4 instance
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_xtr_A(FP4 *r, FP4 *w, FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP4 instance, on exit = x^2-2*conj(x)
+	@param x FP4 instance
+ */
+extern void FP4_xtr_D(FP4 *r, FP4 *x);
+/**	@brief Calculates FP4 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP4 instance, on exit = trace(w^b)
+	@param x FP4 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP4_xtr_pow(FP4 *r, FP4 *x, B288_60::BIG b);
+/**	@brief Calculates FP4 trace of c^a.d^b, where c and d are derived from FP4 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP4 instance, on exit = trace(c^a.d^b)
+	@param c FP4 instance, trace of an FP12
+	@param d FP4 instance, trace of an FP12
+	@param e FP4 instance, trace of an FP12
+	@param f FP4 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP4_xtr_pow2(FP4 *r, FP4 *c, FP4 *d, FP4 *e, FP4 *f, B288_60::BIG a, B288_60::BIG b);
+
+/**	@brief Test FP4 for QR
+ * 
+	@param r FP4 instance
+    @param h optional generated hint
+	@return 1 x is a QR, otherwise 0
+ */
+extern int  FP4_qr(FP4 *r, FP *h);
+
+/**	@brief Calculate square root of an FP4
+ *
+	Square root
+	@param r FP4 instance, on exit = sqrt(x)
+	@param x FP4 instance
+    @param h optional input hint
+ */
+extern void  FP4_sqrt(FP4 *r, FP4 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP4 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP4 instance, set to y if s!=0
+	@param y another FP4 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP4_cmove(FP4 *x, FP4 *y, int s);
+
+
+/**	@brief Divide FP4 number by QNR
+ *
+	Divide FP4 by the QNR
+	@param x FP4 instance
+ */
+extern void FP4_div_i(FP4 *x);
+
+/**	@brief Generate random FP4
+ *
+	@param x random FP4 number
+	@param rng random number generator
+ */
+extern void FP4_rand(FP4 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp4_BLS48556.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp4_BLS48556.h
new file mode 100644
index 0000000..1f6d4f9
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp4_BLS48556.h
@@ -0,0 +1,349 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP4_BLS48556_H
+#define FP4_BLS48556_H
+
+#include "fp2_BLS48556.h"
+#include "config_curve_BLS48556.h"
+
+using namespace core;
+
+namespace BLS48556 {
+
+/**
+	@brief FP4 Structure - towered over two FP2
+*/
+
+typedef struct
+{
+    FP2 a; /**< real part of FP4 */
+    FP2 b; /**< imaginary part of FP4 */
+} FP4;
+
+
+/* FP4 prototypes */
+/**	@brief Tests for FP4 equal to zero
+ *
+	@param x FP4 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP4_iszilch(FP4 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP4 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP4_islarger(FP4 *x);
+
+/**	@brief Serialize out FP4  
+ *
+    @param b buffer for output
+	@param x FP4 number to be serialized
+ */
+extern void FP4_toBytes(char *b,FP4 *x);
+
+/**	@brief Serialize in FP4  
+ *
+	@param x FP4 number to be serialized
+    @param b buffer for input
+ */
+extern void FP4_fromBytes(FP4 *x,char *b);
+
+/**	@brief Tests for FP4 equal to unity
+ *
+	@param x FP4 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP4_isunity(FP4 *x);
+/**	@brief Tests for equality of two FP4s
+ *
+	@param x FP4 instance to be compared
+	@param y FP4 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP4_equals(FP4 *x, FP4 *y);
+/**	@brief Tests for FP4 having only a real part and no imaginary part
+ *
+	@param x FP4 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP4_isreal(FP4 *x);
+/**	@brief Initialise FP4 from two FP2s
+ *
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+	@param b FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2s(FP4 *x, FP2 *a, FP2 *b);
+/**	@brief Initialise FP4 from single FP2
+ *
+	Imaginary part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+ */
+extern void FP4_from_FP2(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP2
+ *
+	real part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2H(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP
+ *
+	@param x FP4 instance to be initialised
+	@param a FP to form real part of FP4
+ */
+extern void FP4_from_FP(FP4 *x, FP *a);
+
+/**	@brief Copy FP4 to another FP4
+ *
+	@param x FP4 instance, on exit = y
+	@param y FP4 instance to be copied
+ */
+extern void FP4_copy(FP4 *x, FP4 *y);
+/**	@brief Set FP4 to zero
+ *
+	@param x FP4 instance to be set to zero
+ */
+extern void FP4_zero(FP4 *x);
+/**	@brief Set FP4 to unity
+ *
+	@param x FP4 instance to be set to one
+ */
+extern void FP4_one(FP4 *x);
+
+/**	@brief Sign of FP4
+ *
+	@param x FP4 instance
+	@return "sign" of FP4
+ */
+extern int FP4_sign(FP4 *x);
+
+/**	@brief Negation of FP4
+ *
+	@param x FP4 instance, on exit = -y
+	@param y FP4 instance
+ */
+extern void FP4_neg(FP4 *x, FP4 *y);
+/**	@brief Conjugation of FP4
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP4 instance, on exit = conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_conj(FP4 *x, FP4 *y);
+/**	@brief Negative conjugation of FP4
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP4 instance, on exit = -conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_nconj(FP4 *x, FP4 *y);
+/**	@brief addition of two FP4s
+ *
+	@param x FP4 instance, on exit = y+z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_add(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief subtraction of two FP4s
+ *
+	@param x FP4 instance, on exit = y-z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_sub(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Multiplication of an FP4 by an FP2
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP2 multiplier
+ */
+extern void FP4_pmul(FP4 *x, FP4 *y, FP2 *a);
+
+
+/**	@brief Multiplication of an FP4 by an FP
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP multiplier
+ */
+extern void FP4_qmul(FP4 *x, FP4 *y, FP *a);
+
+/**	@brief Multiplication of an FP4 by a small integer
+ *
+	@param x FP4 instance, on exit = y*i
+	@param y FP4 instance
+	@param i an integer
+ */
+extern void FP4_imul(FP4 *x, FP4 *y, int i);
+/**	@brief Squaring an FP4
+ *
+	@param x FP4 instance, on exit = y^2
+	@param y FP4 instance
+ */
+extern void FP4_sqr(FP4 *x, FP4 *y);
+/**	@brief Multiplication of two FP4s
+ *
+	@param x FP4 instance, on exit = y*z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_mul(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Inverting an FP4
+ *
+	@param x FP4 instance, on exit = 1/y
+	@param y FP4 instance
+    @param h optional input hint
+ */
+extern void FP4_inv(FP4 *x, FP4 *y, FP *h);
+
+/**	@brief Divide an FP4 by 2
+ *
+	@param x FP4 instance, on exit = y/2
+	@param y FP4 instance
+ */
+extern void FP4_div2(FP4 *x, FP4 *y);
+
+
+/**	@brief Formats and outputs an FP4 to the console
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_output(FP4 *x);
+/**	@brief Formats and outputs an FP4 to the console in raw form (for debugging)
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_rawoutput(FP4 *x);
+/**	@brief multiplies an FP4 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP4 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP4_times_i(FP4 *x);
+/**	@brief Normalises the components of an FP4
+ *
+	@param x FP4 instance to be normalised
+ */
+extern void FP4_norm(FP4 *x);
+/**	@brief Reduces all components of possibly unreduced FP4 mod Modulus
+ *
+	@param x FP4 instance, on exit reduced mod Modulus
+ */
+extern void FP4_reduce(FP4 *x);
+/**	@brief Raises an FP4 to the power of a BIG
+ *
+	@param x FP4 instance, on exit = y^b
+	@param y FP4 instance
+	@param b BIG number
+ */
+extern void FP4_pow(FP4 *x, FP4 *y, B560_58::BIG b);
+/**	@brief Raises an FP4 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP4 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP4_frob(FP4 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP4 instance, on exit = w*x-conj(x)*y+z
+	@param w FP4 instance
+	@param x FP4 instance
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_xtr_A(FP4 *r, FP4 *w, FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP4 instance, on exit = x^2-2*conj(x)
+	@param x FP4 instance
+ */
+extern void FP4_xtr_D(FP4 *r, FP4 *x);
+/**	@brief Calculates FP4 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP4 instance, on exit = trace(w^b)
+	@param x FP4 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP4_xtr_pow(FP4 *r, FP4 *x, B560_58::BIG b);
+/**	@brief Calculates FP4 trace of c^a.d^b, where c and d are derived from FP4 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP4 instance, on exit = trace(c^a.d^b)
+	@param c FP4 instance, trace of an FP12
+	@param d FP4 instance, trace of an FP12
+	@param e FP4 instance, trace of an FP12
+	@param f FP4 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP4_xtr_pow2(FP4 *r, FP4 *c, FP4 *d, FP4 *e, FP4 *f, B560_58::BIG a, B560_58::BIG b);
+
+/**	@brief Test FP4 for QR
+ * 
+	@param r FP4 instance
+    @param h optional generated hint
+	@return 1 x is a QR, otherwise 0
+ */
+extern int  FP4_qr(FP4 *r, FP *h);
+
+/**	@brief Calculate square root of an FP4
+ *
+	Square root
+	@param r FP4 instance, on exit = sqrt(x)
+	@param x FP4 instance
+    @param h optional input hint
+ */
+extern void  FP4_sqrt(FP4 *r, FP4 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP4 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP4 instance, set to y if s!=0
+	@param y another FP4 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP4_cmove(FP4 *x, FP4 *y, int s);
+
+
+/**	@brief Divide FP4 number by QNR
+ *
+	Divide FP4 by the QNR
+	@param x FP4 instance
+ */
+extern void FP4_div_i(FP4 *x);
+
+/**	@brief Generate random FP4
+ *
+	@param x random FP4 number
+	@param rng random number generator
+ */
+extern void FP4_rand(FP4 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp4_BLS48581.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp4_BLS48581.h
new file mode 100644
index 0000000..181ffb4
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp4_BLS48581.h
@@ -0,0 +1,349 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP4_BLS48581_H
+#define FP4_BLS48581_H
+
+#include "fp2_BLS48581.h"
+#include "config_curve_BLS48581.h"
+
+using namespace core;
+
+namespace BLS48581 {
+
+/**
+	@brief FP4 Structure - towered over two FP2
+*/
+
+typedef struct
+{
+    FP2 a; /**< real part of FP4 */
+    FP2 b; /**< imaginary part of FP4 */
+} FP4;
+
+
+/* FP4 prototypes */
+/**	@brief Tests for FP4 equal to zero
+ *
+	@param x FP4 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP4_iszilch(FP4 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP4 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP4_islarger(FP4 *x);
+
+/**	@brief Serialize out FP4  
+ *
+    @param b buffer for output
+	@param x FP4 number to be serialized
+ */
+extern void FP4_toBytes(char *b,FP4 *x);
+
+/**	@brief Serialize in FP4  
+ *
+	@param x FP4 number to be serialized
+    @param b buffer for input
+ */
+extern void FP4_fromBytes(FP4 *x,char *b);
+
+/**	@brief Tests for FP4 equal to unity
+ *
+	@param x FP4 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP4_isunity(FP4 *x);
+/**	@brief Tests for equality of two FP4s
+ *
+	@param x FP4 instance to be compared
+	@param y FP4 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP4_equals(FP4 *x, FP4 *y);
+/**	@brief Tests for FP4 having only a real part and no imaginary part
+ *
+	@param x FP4 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP4_isreal(FP4 *x);
+/**	@brief Initialise FP4 from two FP2s
+ *
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+	@param b FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2s(FP4 *x, FP2 *a, FP2 *b);
+/**	@brief Initialise FP4 from single FP2
+ *
+	Imaginary part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+ */
+extern void FP4_from_FP2(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP2
+ *
+	real part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2H(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP
+ *
+	@param x FP4 instance to be initialised
+	@param a FP to form real part of FP4
+ */
+extern void FP4_from_FP(FP4 *x, FP *a);
+
+/**	@brief Copy FP4 to another FP4
+ *
+	@param x FP4 instance, on exit = y
+	@param y FP4 instance to be copied
+ */
+extern void FP4_copy(FP4 *x, FP4 *y);
+/**	@brief Set FP4 to zero
+ *
+	@param x FP4 instance to be set to zero
+ */
+extern void FP4_zero(FP4 *x);
+/**	@brief Set FP4 to unity
+ *
+	@param x FP4 instance to be set to one
+ */
+extern void FP4_one(FP4 *x);
+
+/**	@brief Sign of FP4
+ *
+	@param x FP4 instance
+	@return "sign" of FP4
+ */
+extern int FP4_sign(FP4 *x);
+
+/**	@brief Negation of FP4
+ *
+	@param x FP4 instance, on exit = -y
+	@param y FP4 instance
+ */
+extern void FP4_neg(FP4 *x, FP4 *y);
+/**	@brief Conjugation of FP4
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP4 instance, on exit = conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_conj(FP4 *x, FP4 *y);
+/**	@brief Negative conjugation of FP4
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP4 instance, on exit = -conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_nconj(FP4 *x, FP4 *y);
+/**	@brief addition of two FP4s
+ *
+	@param x FP4 instance, on exit = y+z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_add(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief subtraction of two FP4s
+ *
+	@param x FP4 instance, on exit = y-z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_sub(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Multiplication of an FP4 by an FP2
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP2 multiplier
+ */
+extern void FP4_pmul(FP4 *x, FP4 *y, FP2 *a);
+
+
+/**	@brief Multiplication of an FP4 by an FP
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP multiplier
+ */
+extern void FP4_qmul(FP4 *x, FP4 *y, FP *a);
+
+/**	@brief Multiplication of an FP4 by a small integer
+ *
+	@param x FP4 instance, on exit = y*i
+	@param y FP4 instance
+	@param i an integer
+ */
+extern void FP4_imul(FP4 *x, FP4 *y, int i);
+/**	@brief Squaring an FP4
+ *
+	@param x FP4 instance, on exit = y^2
+	@param y FP4 instance
+ */
+extern void FP4_sqr(FP4 *x, FP4 *y);
+/**	@brief Multiplication of two FP4s
+ *
+	@param x FP4 instance, on exit = y*z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_mul(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Inverting an FP4
+ *
+	@param x FP4 instance, on exit = 1/y
+	@param y FP4 instance
+    @param h optional input hint
+ */
+extern void FP4_inv(FP4 *x, FP4 *y, FP *h);
+
+/**	@brief Divide an FP4 by 2
+ *
+	@param x FP4 instance, on exit = y/2
+	@param y FP4 instance
+ */
+extern void FP4_div2(FP4 *x, FP4 *y);
+
+
+/**	@brief Formats and outputs an FP4 to the console
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_output(FP4 *x);
+/**	@brief Formats and outputs an FP4 to the console in raw form (for debugging)
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_rawoutput(FP4 *x);
+/**	@brief multiplies an FP4 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP4 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP4_times_i(FP4 *x);
+/**	@brief Normalises the components of an FP4
+ *
+	@param x FP4 instance to be normalised
+ */
+extern void FP4_norm(FP4 *x);
+/**	@brief Reduces all components of possibly unreduced FP4 mod Modulus
+ *
+	@param x FP4 instance, on exit reduced mod Modulus
+ */
+extern void FP4_reduce(FP4 *x);
+/**	@brief Raises an FP4 to the power of a BIG
+ *
+	@param x FP4 instance, on exit = y^b
+	@param y FP4 instance
+	@param b BIG number
+ */
+extern void FP4_pow(FP4 *x, FP4 *y, B584_60::BIG b);
+/**	@brief Raises an FP4 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP4 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP4_frob(FP4 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP4 instance, on exit = w*x-conj(x)*y+z
+	@param w FP4 instance
+	@param x FP4 instance
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_xtr_A(FP4 *r, FP4 *w, FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP4 instance, on exit = x^2-2*conj(x)
+	@param x FP4 instance
+ */
+extern void FP4_xtr_D(FP4 *r, FP4 *x);
+/**	@brief Calculates FP4 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP4 instance, on exit = trace(w^b)
+	@param x FP4 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP4_xtr_pow(FP4 *r, FP4 *x, B584_60::BIG b);
+/**	@brief Calculates FP4 trace of c^a.d^b, where c and d are derived from FP4 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP4 instance, on exit = trace(c^a.d^b)
+	@param c FP4 instance, trace of an FP12
+	@param d FP4 instance, trace of an FP12
+	@param e FP4 instance, trace of an FP12
+	@param f FP4 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP4_xtr_pow2(FP4 *r, FP4 *c, FP4 *d, FP4 *e, FP4 *f, B584_60::BIG a, B584_60::BIG b);
+
+/**	@brief Test FP4 for QR
+ * 
+	@param r FP4 instance
+    @param h optional generated hint
+	@return 1 x is a QR, otherwise 0
+ */
+extern int  FP4_qr(FP4 *r, FP *h);
+
+/**	@brief Calculate square root of an FP4
+ *
+	Square root
+	@param r FP4 instance, on exit = sqrt(x)
+	@param x FP4 instance
+    @param h optional input hint
+ */
+extern void  FP4_sqrt(FP4 *r, FP4 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP4 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP4 instance, set to y if s!=0
+	@param y another FP4 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP4_cmove(FP4 *x, FP4 *y, int s);
+
+
+/**	@brief Divide FP4 number by QNR
+ *
+	Divide FP4 by the QNR
+	@param x FP4 instance
+ */
+extern void FP4_div_i(FP4 *x);
+
+/**	@brief Generate random FP4
+ *
+	@param x random FP4 number
+	@param rng random number generator
+ */
+extern void FP4_rand(FP4 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp4_BN158.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp4_BN158.h
new file mode 100644
index 0000000..a60edb5
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp4_BN158.h
@@ -0,0 +1,349 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP4_BN158_H
+#define FP4_BN158_H
+
+#include "fp2_BN158.h"
+#include "config_curve_BN158.h"
+
+using namespace core;
+
+namespace BN158 {
+
+/**
+	@brief FP4 Structure - towered over two FP2
+*/
+
+typedef struct
+{
+    FP2 a; /**< real part of FP4 */
+    FP2 b; /**< imaginary part of FP4 */
+} FP4;
+
+
+/* FP4 prototypes */
+/**	@brief Tests for FP4 equal to zero
+ *
+	@param x FP4 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP4_iszilch(FP4 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP4 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP4_islarger(FP4 *x);
+
+/**	@brief Serialize out FP4  
+ *
+    @param b buffer for output
+	@param x FP4 number to be serialized
+ */
+extern void FP4_toBytes(char *b,FP4 *x);
+
+/**	@brief Serialize in FP4  
+ *
+	@param x FP4 number to be serialized
+    @param b buffer for input
+ */
+extern void FP4_fromBytes(FP4 *x,char *b);
+
+/**	@brief Tests for FP4 equal to unity
+ *
+	@param x FP4 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP4_isunity(FP4 *x);
+/**	@brief Tests for equality of two FP4s
+ *
+	@param x FP4 instance to be compared
+	@param y FP4 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP4_equals(FP4 *x, FP4 *y);
+/**	@brief Tests for FP4 having only a real part and no imaginary part
+ *
+	@param x FP4 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP4_isreal(FP4 *x);
+/**	@brief Initialise FP4 from two FP2s
+ *
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+	@param b FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2s(FP4 *x, FP2 *a, FP2 *b);
+/**	@brief Initialise FP4 from single FP2
+ *
+	Imaginary part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+ */
+extern void FP4_from_FP2(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP2
+ *
+	real part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2H(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP
+ *
+	@param x FP4 instance to be initialised
+	@param a FP to form real part of FP4
+ */
+extern void FP4_from_FP(FP4 *x, FP *a);
+
+/**	@brief Copy FP4 to another FP4
+ *
+	@param x FP4 instance, on exit = y
+	@param y FP4 instance to be copied
+ */
+extern void FP4_copy(FP4 *x, FP4 *y);
+/**	@brief Set FP4 to zero
+ *
+	@param x FP4 instance to be set to zero
+ */
+extern void FP4_zero(FP4 *x);
+/**	@brief Set FP4 to unity
+ *
+	@param x FP4 instance to be set to one
+ */
+extern void FP4_one(FP4 *x);
+
+/**	@brief Sign of FP4
+ *
+	@param x FP4 instance
+	@return "sign" of FP4
+ */
+extern int FP4_sign(FP4 *x);
+
+/**	@brief Negation of FP4
+ *
+	@param x FP4 instance, on exit = -y
+	@param y FP4 instance
+ */
+extern void FP4_neg(FP4 *x, FP4 *y);
+/**	@brief Conjugation of FP4
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP4 instance, on exit = conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_conj(FP4 *x, FP4 *y);
+/**	@brief Negative conjugation of FP4
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP4 instance, on exit = -conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_nconj(FP4 *x, FP4 *y);
+/**	@brief addition of two FP4s
+ *
+	@param x FP4 instance, on exit = y+z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_add(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief subtraction of two FP4s
+ *
+	@param x FP4 instance, on exit = y-z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_sub(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Multiplication of an FP4 by an FP2
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP2 multiplier
+ */
+extern void FP4_pmul(FP4 *x, FP4 *y, FP2 *a);
+
+
+/**	@brief Multiplication of an FP4 by an FP
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP multiplier
+ */
+extern void FP4_qmul(FP4 *x, FP4 *y, FP *a);
+
+/**	@brief Multiplication of an FP4 by a small integer
+ *
+	@param x FP4 instance, on exit = y*i
+	@param y FP4 instance
+	@param i an integer
+ */
+extern void FP4_imul(FP4 *x, FP4 *y, int i);
+/**	@brief Squaring an FP4
+ *
+	@param x FP4 instance, on exit = y^2
+	@param y FP4 instance
+ */
+extern void FP4_sqr(FP4 *x, FP4 *y);
+/**	@brief Multiplication of two FP4s
+ *
+	@param x FP4 instance, on exit = y*z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_mul(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Inverting an FP4
+ *
+	@param x FP4 instance, on exit = 1/y
+	@param y FP4 instance
+    @param h optional input hint
+ */
+extern void FP4_inv(FP4 *x, FP4 *y, FP *h);
+
+/**	@brief Divide an FP4 by 2
+ *
+	@param x FP4 instance, on exit = y/2
+	@param y FP4 instance
+ */
+extern void FP4_div2(FP4 *x, FP4 *y);
+
+
+/**	@brief Formats and outputs an FP4 to the console
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_output(FP4 *x);
+/**	@brief Formats and outputs an FP4 to the console in raw form (for debugging)
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_rawoutput(FP4 *x);
+/**	@brief multiplies an FP4 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP4 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP4_times_i(FP4 *x);
+/**	@brief Normalises the components of an FP4
+ *
+	@param x FP4 instance to be normalised
+ */
+extern void FP4_norm(FP4 *x);
+/**	@brief Reduces all components of possibly unreduced FP4 mod Modulus
+ *
+	@param x FP4 instance, on exit reduced mod Modulus
+ */
+extern void FP4_reduce(FP4 *x);
+/**	@brief Raises an FP4 to the power of a BIG
+ *
+	@param x FP4 instance, on exit = y^b
+	@param y FP4 instance
+	@param b BIG number
+ */
+extern void FP4_pow(FP4 *x, FP4 *y, B160_56::BIG b);
+/**	@brief Raises an FP4 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP4 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP4_frob(FP4 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP4 instance, on exit = w*x-conj(x)*y+z
+	@param w FP4 instance
+	@param x FP4 instance
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_xtr_A(FP4 *r, FP4 *w, FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP4 instance, on exit = x^2-2*conj(x)
+	@param x FP4 instance
+ */
+extern void FP4_xtr_D(FP4 *r, FP4 *x);
+/**	@brief Calculates FP4 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP4 instance, on exit = trace(w^b)
+	@param x FP4 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP4_xtr_pow(FP4 *r, FP4 *x, B160_56::BIG b);
+/**	@brief Calculates FP4 trace of c^a.d^b, where c and d are derived from FP4 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP4 instance, on exit = trace(c^a.d^b)
+	@param c FP4 instance, trace of an FP12
+	@param d FP4 instance, trace of an FP12
+	@param e FP4 instance, trace of an FP12
+	@param f FP4 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP4_xtr_pow2(FP4 *r, FP4 *c, FP4 *d, FP4 *e, FP4 *f, B160_56::BIG a, B160_56::BIG b);
+
+/**	@brief Test FP4 for QR
+ * 
+	@param r FP4 instance
+    @param h optional generated hint
+	@return 1 x is a QR, otherwise 0
+ */
+extern int  FP4_qr(FP4 *r, FP *h);
+
+/**	@brief Calculate square root of an FP4
+ *
+	Square root
+	@param r FP4 instance, on exit = sqrt(x)
+	@param x FP4 instance
+    @param h optional input hint
+ */
+extern void  FP4_sqrt(FP4 *r, FP4 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP4 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP4 instance, set to y if s!=0
+	@param y another FP4 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP4_cmove(FP4 *x, FP4 *y, int s);
+
+
+/**	@brief Divide FP4 number by QNR
+ *
+	Divide FP4 by the QNR
+	@param x FP4 instance
+ */
+extern void FP4_div_i(FP4 *x);
+
+/**	@brief Generate random FP4
+ *
+	@param x random FP4 number
+	@param rng random number generator
+ */
+extern void FP4_rand(FP4 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp4_BN254.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp4_BN254.h
new file mode 100644
index 0000000..f5ef40b
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp4_BN254.h
@@ -0,0 +1,349 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP4_BN254_H
+#define FP4_BN254_H
+
+#include "fp2_BN254.h"
+#include "config_curve_BN254.h"
+
+using namespace core;
+
+namespace BN254 {
+
+/**
+	@brief FP4 Structure - towered over two FP2
+*/
+
+typedef struct
+{
+    FP2 a; /**< real part of FP4 */
+    FP2 b; /**< imaginary part of FP4 */
+} FP4;
+
+
+/* FP4 prototypes */
+/**	@brief Tests for FP4 equal to zero
+ *
+	@param x FP4 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP4_iszilch(FP4 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP4 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP4_islarger(FP4 *x);
+
+/**	@brief Serialize out FP4  
+ *
+    @param b buffer for output
+	@param x FP4 number to be serialized
+ */
+extern void FP4_toBytes(char *b,FP4 *x);
+
+/**	@brief Serialize in FP4  
+ *
+	@param x FP4 number to be serialized
+    @param b buffer for input
+ */
+extern void FP4_fromBytes(FP4 *x,char *b);
+
+/**	@brief Tests for FP4 equal to unity
+ *
+	@param x FP4 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP4_isunity(FP4 *x);
+/**	@brief Tests for equality of two FP4s
+ *
+	@param x FP4 instance to be compared
+	@param y FP4 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP4_equals(FP4 *x, FP4 *y);
+/**	@brief Tests for FP4 having only a real part and no imaginary part
+ *
+	@param x FP4 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP4_isreal(FP4 *x);
+/**	@brief Initialise FP4 from two FP2s
+ *
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+	@param b FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2s(FP4 *x, FP2 *a, FP2 *b);
+/**	@brief Initialise FP4 from single FP2
+ *
+	Imaginary part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+ */
+extern void FP4_from_FP2(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP2
+ *
+	real part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2H(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP
+ *
+	@param x FP4 instance to be initialised
+	@param a FP to form real part of FP4
+ */
+extern void FP4_from_FP(FP4 *x, FP *a);
+
+/**	@brief Copy FP4 to another FP4
+ *
+	@param x FP4 instance, on exit = y
+	@param y FP4 instance to be copied
+ */
+extern void FP4_copy(FP4 *x, FP4 *y);
+/**	@brief Set FP4 to zero
+ *
+	@param x FP4 instance to be set to zero
+ */
+extern void FP4_zero(FP4 *x);
+/**	@brief Set FP4 to unity
+ *
+	@param x FP4 instance to be set to one
+ */
+extern void FP4_one(FP4 *x);
+
+/**	@brief Sign of FP4
+ *
+	@param x FP4 instance
+	@return "sign" of FP4
+ */
+extern int FP4_sign(FP4 *x);
+
+/**	@brief Negation of FP4
+ *
+	@param x FP4 instance, on exit = -y
+	@param y FP4 instance
+ */
+extern void FP4_neg(FP4 *x, FP4 *y);
+/**	@brief Conjugation of FP4
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP4 instance, on exit = conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_conj(FP4 *x, FP4 *y);
+/**	@brief Negative conjugation of FP4
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP4 instance, on exit = -conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_nconj(FP4 *x, FP4 *y);
+/**	@brief addition of two FP4s
+ *
+	@param x FP4 instance, on exit = y+z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_add(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief subtraction of two FP4s
+ *
+	@param x FP4 instance, on exit = y-z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_sub(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Multiplication of an FP4 by an FP2
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP2 multiplier
+ */
+extern void FP4_pmul(FP4 *x, FP4 *y, FP2 *a);
+
+
+/**	@brief Multiplication of an FP4 by an FP
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP multiplier
+ */
+extern void FP4_qmul(FP4 *x, FP4 *y, FP *a);
+
+/**	@brief Multiplication of an FP4 by a small integer
+ *
+	@param x FP4 instance, on exit = y*i
+	@param y FP4 instance
+	@param i an integer
+ */
+extern void FP4_imul(FP4 *x, FP4 *y, int i);
+/**	@brief Squaring an FP4
+ *
+	@param x FP4 instance, on exit = y^2
+	@param y FP4 instance
+ */
+extern void FP4_sqr(FP4 *x, FP4 *y);
+/**	@brief Multiplication of two FP4s
+ *
+	@param x FP4 instance, on exit = y*z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_mul(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Inverting an FP4
+ *
+	@param x FP4 instance, on exit = 1/y
+	@param y FP4 instance
+    @param h optional input hint
+ */
+extern void FP4_inv(FP4 *x, FP4 *y, FP *h);
+
+/**	@brief Divide an FP4 by 2
+ *
+	@param x FP4 instance, on exit = y/2
+	@param y FP4 instance
+ */
+extern void FP4_div2(FP4 *x, FP4 *y);
+
+
+/**	@brief Formats and outputs an FP4 to the console
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_output(FP4 *x);
+/**	@brief Formats and outputs an FP4 to the console in raw form (for debugging)
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_rawoutput(FP4 *x);
+/**	@brief multiplies an FP4 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP4 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP4_times_i(FP4 *x);
+/**	@brief Normalises the components of an FP4
+ *
+	@param x FP4 instance to be normalised
+ */
+extern void FP4_norm(FP4 *x);
+/**	@brief Reduces all components of possibly unreduced FP4 mod Modulus
+ *
+	@param x FP4 instance, on exit reduced mod Modulus
+ */
+extern void FP4_reduce(FP4 *x);
+/**	@brief Raises an FP4 to the power of a BIG
+ *
+	@param x FP4 instance, on exit = y^b
+	@param y FP4 instance
+	@param b BIG number
+ */
+extern void FP4_pow(FP4 *x, FP4 *y, B256_56::BIG b);
+/**	@brief Raises an FP4 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP4 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP4_frob(FP4 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP4 instance, on exit = w*x-conj(x)*y+z
+	@param w FP4 instance
+	@param x FP4 instance
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_xtr_A(FP4 *r, FP4 *w, FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP4 instance, on exit = x^2-2*conj(x)
+	@param x FP4 instance
+ */
+extern void FP4_xtr_D(FP4 *r, FP4 *x);
+/**	@brief Calculates FP4 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP4 instance, on exit = trace(w^b)
+	@param x FP4 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP4_xtr_pow(FP4 *r, FP4 *x, B256_56::BIG b);
+/**	@brief Calculates FP4 trace of c^a.d^b, where c and d are derived from FP4 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP4 instance, on exit = trace(c^a.d^b)
+	@param c FP4 instance, trace of an FP12
+	@param d FP4 instance, trace of an FP12
+	@param e FP4 instance, trace of an FP12
+	@param f FP4 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP4_xtr_pow2(FP4 *r, FP4 *c, FP4 *d, FP4 *e, FP4 *f, B256_56::BIG a, B256_56::BIG b);
+
+/**	@brief Test FP4 for QR
+ * 
+	@param r FP4 instance
+    @param h optional generated hint
+	@return 1 x is a QR, otherwise 0
+ */
+extern int  FP4_qr(FP4 *r, FP *h);
+
+/**	@brief Calculate square root of an FP4
+ *
+	Square root
+	@param r FP4 instance, on exit = sqrt(x)
+	@param x FP4 instance
+    @param h optional input hint
+ */
+extern void  FP4_sqrt(FP4 *r, FP4 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP4 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP4 instance, set to y if s!=0
+	@param y another FP4 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP4_cmove(FP4 *x, FP4 *y, int s);
+
+
+/**	@brief Divide FP4 number by QNR
+ *
+	Divide FP4 by the QNR
+	@param x FP4 instance
+ */
+extern void FP4_div_i(FP4 *x);
+
+/**	@brief Generate random FP4
+ *
+	@param x random FP4 number
+	@param rng random number generator
+ */
+extern void FP4_rand(FP4 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp4_BN254CX.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp4_BN254CX.h
new file mode 100644
index 0000000..f3b36de
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp4_BN254CX.h
@@ -0,0 +1,349 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP4_BN254CX_H
+#define FP4_BN254CX_H
+
+#include "fp2_BN254CX.h"
+#include "config_curve_BN254CX.h"
+
+using namespace core;
+
+namespace BN254CX {
+
+/**
+	@brief FP4 Structure - towered over two FP2
+*/
+
+typedef struct
+{
+    FP2 a; /**< real part of FP4 */
+    FP2 b; /**< imaginary part of FP4 */
+} FP4;
+
+
+/* FP4 prototypes */
+/**	@brief Tests for FP4 equal to zero
+ *
+	@param x FP4 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP4_iszilch(FP4 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP4 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP4_islarger(FP4 *x);
+
+/**	@brief Serialize out FP4  
+ *
+    @param b buffer for output
+	@param x FP4 number to be serialized
+ */
+extern void FP4_toBytes(char *b,FP4 *x);
+
+/**	@brief Serialize in FP4  
+ *
+	@param x FP4 number to be serialized
+    @param b buffer for input
+ */
+extern void FP4_fromBytes(FP4 *x,char *b);
+
+/**	@brief Tests for FP4 equal to unity
+ *
+	@param x FP4 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP4_isunity(FP4 *x);
+/**	@brief Tests for equality of two FP4s
+ *
+	@param x FP4 instance to be compared
+	@param y FP4 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP4_equals(FP4 *x, FP4 *y);
+/**	@brief Tests for FP4 having only a real part and no imaginary part
+ *
+	@param x FP4 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP4_isreal(FP4 *x);
+/**	@brief Initialise FP4 from two FP2s
+ *
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+	@param b FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2s(FP4 *x, FP2 *a, FP2 *b);
+/**	@brief Initialise FP4 from single FP2
+ *
+	Imaginary part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+ */
+extern void FP4_from_FP2(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP2
+ *
+	real part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2H(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP
+ *
+	@param x FP4 instance to be initialised
+	@param a FP to form real part of FP4
+ */
+extern void FP4_from_FP(FP4 *x, FP *a);
+
+/**	@brief Copy FP4 to another FP4
+ *
+	@param x FP4 instance, on exit = y
+	@param y FP4 instance to be copied
+ */
+extern void FP4_copy(FP4 *x, FP4 *y);
+/**	@brief Set FP4 to zero
+ *
+	@param x FP4 instance to be set to zero
+ */
+extern void FP4_zero(FP4 *x);
+/**	@brief Set FP4 to unity
+ *
+	@param x FP4 instance to be set to one
+ */
+extern void FP4_one(FP4 *x);
+
+/**	@brief Sign of FP4
+ *
+	@param x FP4 instance
+	@return "sign" of FP4
+ */
+extern int FP4_sign(FP4 *x);
+
+/**	@brief Negation of FP4
+ *
+	@param x FP4 instance, on exit = -y
+	@param y FP4 instance
+ */
+extern void FP4_neg(FP4 *x, FP4 *y);
+/**	@brief Conjugation of FP4
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP4 instance, on exit = conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_conj(FP4 *x, FP4 *y);
+/**	@brief Negative conjugation of FP4
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP4 instance, on exit = -conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_nconj(FP4 *x, FP4 *y);
+/**	@brief addition of two FP4s
+ *
+	@param x FP4 instance, on exit = y+z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_add(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief subtraction of two FP4s
+ *
+	@param x FP4 instance, on exit = y-z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_sub(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Multiplication of an FP4 by an FP2
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP2 multiplier
+ */
+extern void FP4_pmul(FP4 *x, FP4 *y, FP2 *a);
+
+
+/**	@brief Multiplication of an FP4 by an FP
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP multiplier
+ */
+extern void FP4_qmul(FP4 *x, FP4 *y, FP *a);
+
+/**	@brief Multiplication of an FP4 by a small integer
+ *
+	@param x FP4 instance, on exit = y*i
+	@param y FP4 instance
+	@param i an integer
+ */
+extern void FP4_imul(FP4 *x, FP4 *y, int i);
+/**	@brief Squaring an FP4
+ *
+	@param x FP4 instance, on exit = y^2
+	@param y FP4 instance
+ */
+extern void FP4_sqr(FP4 *x, FP4 *y);
+/**	@brief Multiplication of two FP4s
+ *
+	@param x FP4 instance, on exit = y*z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_mul(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Inverting an FP4
+ *
+	@param x FP4 instance, on exit = 1/y
+	@param y FP4 instance
+    @param h optional input hint
+ */
+extern void FP4_inv(FP4 *x, FP4 *y, FP *h);
+
+/**	@brief Divide an FP4 by 2
+ *
+	@param x FP4 instance, on exit = y/2
+	@param y FP4 instance
+ */
+extern void FP4_div2(FP4 *x, FP4 *y);
+
+
+/**	@brief Formats and outputs an FP4 to the console
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_output(FP4 *x);
+/**	@brief Formats and outputs an FP4 to the console in raw form (for debugging)
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_rawoutput(FP4 *x);
+/**	@brief multiplies an FP4 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP4 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP4_times_i(FP4 *x);
+/**	@brief Normalises the components of an FP4
+ *
+	@param x FP4 instance to be normalised
+ */
+extern void FP4_norm(FP4 *x);
+/**	@brief Reduces all components of possibly unreduced FP4 mod Modulus
+ *
+	@param x FP4 instance, on exit reduced mod Modulus
+ */
+extern void FP4_reduce(FP4 *x);
+/**	@brief Raises an FP4 to the power of a BIG
+ *
+	@param x FP4 instance, on exit = y^b
+	@param y FP4 instance
+	@param b BIG number
+ */
+extern void FP4_pow(FP4 *x, FP4 *y, B256_56::BIG b);
+/**	@brief Raises an FP4 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP4 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP4_frob(FP4 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP4 instance, on exit = w*x-conj(x)*y+z
+	@param w FP4 instance
+	@param x FP4 instance
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_xtr_A(FP4 *r, FP4 *w, FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP4 instance, on exit = x^2-2*conj(x)
+	@param x FP4 instance
+ */
+extern void FP4_xtr_D(FP4 *r, FP4 *x);
+/**	@brief Calculates FP4 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP4 instance, on exit = trace(w^b)
+	@param x FP4 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP4_xtr_pow(FP4 *r, FP4 *x, B256_56::BIG b);
+/**	@brief Calculates FP4 trace of c^a.d^b, where c and d are derived from FP4 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP4 instance, on exit = trace(c^a.d^b)
+	@param c FP4 instance, trace of an FP12
+	@param d FP4 instance, trace of an FP12
+	@param e FP4 instance, trace of an FP12
+	@param f FP4 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP4_xtr_pow2(FP4 *r, FP4 *c, FP4 *d, FP4 *e, FP4 *f, B256_56::BIG a, B256_56::BIG b);
+
+/**	@brief Test FP4 for QR
+ * 
+	@param r FP4 instance
+    @param h optional generated hint
+	@return 1 x is a QR, otherwise 0
+ */
+extern int  FP4_qr(FP4 *r, FP *h);
+
+/**	@brief Calculate square root of an FP4
+ *
+	Square root
+	@param r FP4 instance, on exit = sqrt(x)
+	@param x FP4 instance
+    @param h optional input hint
+ */
+extern void  FP4_sqrt(FP4 *r, FP4 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP4 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP4 instance, set to y if s!=0
+	@param y another FP4 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP4_cmove(FP4 *x, FP4 *y, int s);
+
+
+/**	@brief Divide FP4 number by QNR
+ *
+	Divide FP4 by the QNR
+	@param x FP4 instance
+ */
+extern void FP4_div_i(FP4 *x);
+
+/**	@brief Generate random FP4
+ *
+	@param x random FP4 number
+	@param rng random number generator
+ */
+extern void FP4_rand(FP4 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp4_BN462.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp4_BN462.h
new file mode 100644
index 0000000..4d81f9f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp4_BN462.h
@@ -0,0 +1,349 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP4_BN462_H
+#define FP4_BN462_H
+
+#include "fp2_BN462.h"
+#include "config_curve_BN462.h"
+
+using namespace core;
+
+namespace BN462 {
+
+/**
+	@brief FP4 Structure - towered over two FP2
+*/
+
+typedef struct
+{
+    FP2 a; /**< real part of FP4 */
+    FP2 b; /**< imaginary part of FP4 */
+} FP4;
+
+
+/* FP4 prototypes */
+/**	@brief Tests for FP4 equal to zero
+ *
+	@param x FP4 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP4_iszilch(FP4 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP4 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP4_islarger(FP4 *x);
+
+/**	@brief Serialize out FP4  
+ *
+    @param b buffer for output
+	@param x FP4 number to be serialized
+ */
+extern void FP4_toBytes(char *b,FP4 *x);
+
+/**	@brief Serialize in FP4  
+ *
+	@param x FP4 number to be serialized
+    @param b buffer for input
+ */
+extern void FP4_fromBytes(FP4 *x,char *b);
+
+/**	@brief Tests for FP4 equal to unity
+ *
+	@param x FP4 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP4_isunity(FP4 *x);
+/**	@brief Tests for equality of two FP4s
+ *
+	@param x FP4 instance to be compared
+	@param y FP4 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP4_equals(FP4 *x, FP4 *y);
+/**	@brief Tests for FP4 having only a real part and no imaginary part
+ *
+	@param x FP4 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP4_isreal(FP4 *x);
+/**	@brief Initialise FP4 from two FP2s
+ *
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+	@param b FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2s(FP4 *x, FP2 *a, FP2 *b);
+/**	@brief Initialise FP4 from single FP2
+ *
+	Imaginary part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+ */
+extern void FP4_from_FP2(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP2
+ *
+	real part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2H(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP
+ *
+	@param x FP4 instance to be initialised
+	@param a FP to form real part of FP4
+ */
+extern void FP4_from_FP(FP4 *x, FP *a);
+
+/**	@brief Copy FP4 to another FP4
+ *
+	@param x FP4 instance, on exit = y
+	@param y FP4 instance to be copied
+ */
+extern void FP4_copy(FP4 *x, FP4 *y);
+/**	@brief Set FP4 to zero
+ *
+	@param x FP4 instance to be set to zero
+ */
+extern void FP4_zero(FP4 *x);
+/**	@brief Set FP4 to unity
+ *
+	@param x FP4 instance to be set to one
+ */
+extern void FP4_one(FP4 *x);
+
+/**	@brief Sign of FP4
+ *
+	@param x FP4 instance
+	@return "sign" of FP4
+ */
+extern int FP4_sign(FP4 *x);
+
+/**	@brief Negation of FP4
+ *
+	@param x FP4 instance, on exit = -y
+	@param y FP4 instance
+ */
+extern void FP4_neg(FP4 *x, FP4 *y);
+/**	@brief Conjugation of FP4
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP4 instance, on exit = conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_conj(FP4 *x, FP4 *y);
+/**	@brief Negative conjugation of FP4
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP4 instance, on exit = -conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_nconj(FP4 *x, FP4 *y);
+/**	@brief addition of two FP4s
+ *
+	@param x FP4 instance, on exit = y+z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_add(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief subtraction of two FP4s
+ *
+	@param x FP4 instance, on exit = y-z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_sub(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Multiplication of an FP4 by an FP2
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP2 multiplier
+ */
+extern void FP4_pmul(FP4 *x, FP4 *y, FP2 *a);
+
+
+/**	@brief Multiplication of an FP4 by an FP
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP multiplier
+ */
+extern void FP4_qmul(FP4 *x, FP4 *y, FP *a);
+
+/**	@brief Multiplication of an FP4 by a small integer
+ *
+	@param x FP4 instance, on exit = y*i
+	@param y FP4 instance
+	@param i an integer
+ */
+extern void FP4_imul(FP4 *x, FP4 *y, int i);
+/**	@brief Squaring an FP4
+ *
+	@param x FP4 instance, on exit = y^2
+	@param y FP4 instance
+ */
+extern void FP4_sqr(FP4 *x, FP4 *y);
+/**	@brief Multiplication of two FP4s
+ *
+	@param x FP4 instance, on exit = y*z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_mul(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Inverting an FP4
+ *
+	@param x FP4 instance, on exit = 1/y
+	@param y FP4 instance
+    @param h optional input hint
+ */
+extern void FP4_inv(FP4 *x, FP4 *y, FP *h);
+
+/**	@brief Divide an FP4 by 2
+ *
+	@param x FP4 instance, on exit = y/2
+	@param y FP4 instance
+ */
+extern void FP4_div2(FP4 *x, FP4 *y);
+
+
+/**	@brief Formats and outputs an FP4 to the console
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_output(FP4 *x);
+/**	@brief Formats and outputs an FP4 to the console in raw form (for debugging)
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_rawoutput(FP4 *x);
+/**	@brief multiplies an FP4 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP4 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP4_times_i(FP4 *x);
+/**	@brief Normalises the components of an FP4
+ *
+	@param x FP4 instance to be normalised
+ */
+extern void FP4_norm(FP4 *x);
+/**	@brief Reduces all components of possibly unreduced FP4 mod Modulus
+ *
+	@param x FP4 instance, on exit reduced mod Modulus
+ */
+extern void FP4_reduce(FP4 *x);
+/**	@brief Raises an FP4 to the power of a BIG
+ *
+	@param x FP4 instance, on exit = y^b
+	@param y FP4 instance
+	@param b BIG number
+ */
+extern void FP4_pow(FP4 *x, FP4 *y, B464_60::BIG b);
+/**	@brief Raises an FP4 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP4 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP4_frob(FP4 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP4 instance, on exit = w*x-conj(x)*y+z
+	@param w FP4 instance
+	@param x FP4 instance
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_xtr_A(FP4 *r, FP4 *w, FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP4 instance, on exit = x^2-2*conj(x)
+	@param x FP4 instance
+ */
+extern void FP4_xtr_D(FP4 *r, FP4 *x);
+/**	@brief Calculates FP4 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP4 instance, on exit = trace(w^b)
+	@param x FP4 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP4_xtr_pow(FP4 *r, FP4 *x, B464_60::BIG b);
+/**	@brief Calculates FP4 trace of c^a.d^b, where c and d are derived from FP4 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP4 instance, on exit = trace(c^a.d^b)
+	@param c FP4 instance, trace of an FP12
+	@param d FP4 instance, trace of an FP12
+	@param e FP4 instance, trace of an FP12
+	@param f FP4 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP4_xtr_pow2(FP4 *r, FP4 *c, FP4 *d, FP4 *e, FP4 *f, B464_60::BIG a, B464_60::BIG b);
+
+/**	@brief Test FP4 for QR
+ * 
+	@param r FP4 instance
+    @param h optional generated hint
+	@return 1 x is a QR, otherwise 0
+ */
+extern int  FP4_qr(FP4 *r, FP *h);
+
+/**	@brief Calculate square root of an FP4
+ *
+	Square root
+	@param r FP4 instance, on exit = sqrt(x)
+	@param x FP4 instance
+    @param h optional input hint
+ */
+extern void  FP4_sqrt(FP4 *r, FP4 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP4 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP4 instance, set to y if s!=0
+	@param y another FP4 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP4_cmove(FP4 *x, FP4 *y, int s);
+
+
+/**	@brief Divide FP4 number by QNR
+ *
+	Divide FP4 by the QNR
+	@param x FP4 instance
+ */
+extern void FP4_div_i(FP4 *x);
+
+/**	@brief Generate random FP4
+ *
+	@param x random FP4 number
+	@param rng random number generator
+ */
+extern void FP4_rand(FP4 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp4_FP256BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp4_FP256BN.h
new file mode 100644
index 0000000..0b0ddb1
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp4_FP256BN.h
@@ -0,0 +1,349 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP4_FP256BN_H
+#define FP4_FP256BN_H
+
+#include "fp2_FP256BN.h"
+#include "config_curve_FP256BN.h"
+
+using namespace core;
+
+namespace FP256BN {
+
+/**
+	@brief FP4 Structure - towered over two FP2
+*/
+
+typedef struct
+{
+    FP2 a; /**< real part of FP4 */
+    FP2 b; /**< imaginary part of FP4 */
+} FP4;
+
+
+/* FP4 prototypes */
+/**	@brief Tests for FP4 equal to zero
+ *
+	@param x FP4 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP4_iszilch(FP4 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP4 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP4_islarger(FP4 *x);
+
+/**	@brief Serialize out FP4  
+ *
+    @param b buffer for output
+	@param x FP4 number to be serialized
+ */
+extern void FP4_toBytes(char *b,FP4 *x);
+
+/**	@brief Serialize in FP4  
+ *
+	@param x FP4 number to be serialized
+    @param b buffer for input
+ */
+extern void FP4_fromBytes(FP4 *x,char *b);
+
+/**	@brief Tests for FP4 equal to unity
+ *
+	@param x FP4 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP4_isunity(FP4 *x);
+/**	@brief Tests for equality of two FP4s
+ *
+	@param x FP4 instance to be compared
+	@param y FP4 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP4_equals(FP4 *x, FP4 *y);
+/**	@brief Tests for FP4 having only a real part and no imaginary part
+ *
+	@param x FP4 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP4_isreal(FP4 *x);
+/**	@brief Initialise FP4 from two FP2s
+ *
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+	@param b FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2s(FP4 *x, FP2 *a, FP2 *b);
+/**	@brief Initialise FP4 from single FP2
+ *
+	Imaginary part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+ */
+extern void FP4_from_FP2(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP2
+ *
+	real part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2H(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP
+ *
+	@param x FP4 instance to be initialised
+	@param a FP to form real part of FP4
+ */
+extern void FP4_from_FP(FP4 *x, FP *a);
+
+/**	@brief Copy FP4 to another FP4
+ *
+	@param x FP4 instance, on exit = y
+	@param y FP4 instance to be copied
+ */
+extern void FP4_copy(FP4 *x, FP4 *y);
+/**	@brief Set FP4 to zero
+ *
+	@param x FP4 instance to be set to zero
+ */
+extern void FP4_zero(FP4 *x);
+/**	@brief Set FP4 to unity
+ *
+	@param x FP4 instance to be set to one
+ */
+extern void FP4_one(FP4 *x);
+
+/**	@brief Sign of FP4
+ *
+	@param x FP4 instance
+	@return "sign" of FP4
+ */
+extern int FP4_sign(FP4 *x);
+
+/**	@brief Negation of FP4
+ *
+	@param x FP4 instance, on exit = -y
+	@param y FP4 instance
+ */
+extern void FP4_neg(FP4 *x, FP4 *y);
+/**	@brief Conjugation of FP4
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP4 instance, on exit = conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_conj(FP4 *x, FP4 *y);
+/**	@brief Negative conjugation of FP4
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP4 instance, on exit = -conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_nconj(FP4 *x, FP4 *y);
+/**	@brief addition of two FP4s
+ *
+	@param x FP4 instance, on exit = y+z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_add(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief subtraction of two FP4s
+ *
+	@param x FP4 instance, on exit = y-z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_sub(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Multiplication of an FP4 by an FP2
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP2 multiplier
+ */
+extern void FP4_pmul(FP4 *x, FP4 *y, FP2 *a);
+
+
+/**	@brief Multiplication of an FP4 by an FP
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP multiplier
+ */
+extern void FP4_qmul(FP4 *x, FP4 *y, FP *a);
+
+/**	@brief Multiplication of an FP4 by a small integer
+ *
+	@param x FP4 instance, on exit = y*i
+	@param y FP4 instance
+	@param i an integer
+ */
+extern void FP4_imul(FP4 *x, FP4 *y, int i);
+/**	@brief Squaring an FP4
+ *
+	@param x FP4 instance, on exit = y^2
+	@param y FP4 instance
+ */
+extern void FP4_sqr(FP4 *x, FP4 *y);
+/**	@brief Multiplication of two FP4s
+ *
+	@param x FP4 instance, on exit = y*z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_mul(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Inverting an FP4
+ *
+	@param x FP4 instance, on exit = 1/y
+	@param y FP4 instance
+    @param h optional input hint
+ */
+extern void FP4_inv(FP4 *x, FP4 *y, FP *h);
+
+/**	@brief Divide an FP4 by 2
+ *
+	@param x FP4 instance, on exit = y/2
+	@param y FP4 instance
+ */
+extern void FP4_div2(FP4 *x, FP4 *y);
+
+
+/**	@brief Formats and outputs an FP4 to the console
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_output(FP4 *x);
+/**	@brief Formats and outputs an FP4 to the console in raw form (for debugging)
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_rawoutput(FP4 *x);
+/**	@brief multiplies an FP4 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP4 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP4_times_i(FP4 *x);
+/**	@brief Normalises the components of an FP4
+ *
+	@param x FP4 instance to be normalised
+ */
+extern void FP4_norm(FP4 *x);
+/**	@brief Reduces all components of possibly unreduced FP4 mod Modulus
+ *
+	@param x FP4 instance, on exit reduced mod Modulus
+ */
+extern void FP4_reduce(FP4 *x);
+/**	@brief Raises an FP4 to the power of a BIG
+ *
+	@param x FP4 instance, on exit = y^b
+	@param y FP4 instance
+	@param b BIG number
+ */
+extern void FP4_pow(FP4 *x, FP4 *y, B256_56::BIG b);
+/**	@brief Raises an FP4 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP4 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP4_frob(FP4 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP4 instance, on exit = w*x-conj(x)*y+z
+	@param w FP4 instance
+	@param x FP4 instance
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_xtr_A(FP4 *r, FP4 *w, FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP4 instance, on exit = x^2-2*conj(x)
+	@param x FP4 instance
+ */
+extern void FP4_xtr_D(FP4 *r, FP4 *x);
+/**	@brief Calculates FP4 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP4 instance, on exit = trace(w^b)
+	@param x FP4 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP4_xtr_pow(FP4 *r, FP4 *x, B256_56::BIG b);
+/**	@brief Calculates FP4 trace of c^a.d^b, where c and d are derived from FP4 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP4 instance, on exit = trace(c^a.d^b)
+	@param c FP4 instance, trace of an FP12
+	@param d FP4 instance, trace of an FP12
+	@param e FP4 instance, trace of an FP12
+	@param f FP4 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP4_xtr_pow2(FP4 *r, FP4 *c, FP4 *d, FP4 *e, FP4 *f, B256_56::BIG a, B256_56::BIG b);
+
+/**	@brief Test FP4 for QR
+ * 
+	@param r FP4 instance
+    @param h optional generated hint
+	@return 1 x is a QR, otherwise 0
+ */
+extern int  FP4_qr(FP4 *r, FP *h);
+
+/**	@brief Calculate square root of an FP4
+ *
+	Square root
+	@param r FP4 instance, on exit = sqrt(x)
+	@param x FP4 instance
+    @param h optional input hint
+ */
+extern void  FP4_sqrt(FP4 *r, FP4 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP4 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP4 instance, set to y if s!=0
+	@param y another FP4 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP4_cmove(FP4 *x, FP4 *y, int s);
+
+
+/**	@brief Divide FP4 number by QNR
+ *
+	Divide FP4 by the QNR
+	@param x FP4 instance
+ */
+extern void FP4_div_i(FP4 *x);
+
+/**	@brief Generate random FP4
+ *
+	@param x random FP4 number
+	@param rng random number generator
+ */
+extern void FP4_rand(FP4 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp4_FP512BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp4_FP512BN.h
new file mode 100644
index 0000000..d266dc7
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp4_FP512BN.h
@@ -0,0 +1,349 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP4_FP512BN_H
+#define FP4_FP512BN_H
+
+#include "fp2_FP512BN.h"
+#include "config_curve_FP512BN.h"
+
+using namespace core;
+
+namespace FP512BN {
+
+/**
+	@brief FP4 Structure - towered over two FP2
+*/
+
+typedef struct
+{
+    FP2 a; /**< real part of FP4 */
+    FP2 b; /**< imaginary part of FP4 */
+} FP4;
+
+
+/* FP4 prototypes */
+/**	@brief Tests for FP4 equal to zero
+ *
+	@param x FP4 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP4_iszilch(FP4 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP4 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP4_islarger(FP4 *x);
+
+/**	@brief Serialize out FP4  
+ *
+    @param b buffer for output
+	@param x FP4 number to be serialized
+ */
+extern void FP4_toBytes(char *b,FP4 *x);
+
+/**	@brief Serialize in FP4  
+ *
+	@param x FP4 number to be serialized
+    @param b buffer for input
+ */
+extern void FP4_fromBytes(FP4 *x,char *b);
+
+/**	@brief Tests for FP4 equal to unity
+ *
+	@param x FP4 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP4_isunity(FP4 *x);
+/**	@brief Tests for equality of two FP4s
+ *
+	@param x FP4 instance to be compared
+	@param y FP4 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP4_equals(FP4 *x, FP4 *y);
+/**	@brief Tests for FP4 having only a real part and no imaginary part
+ *
+	@param x FP4 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP4_isreal(FP4 *x);
+/**	@brief Initialise FP4 from two FP2s
+ *
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+	@param b FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2s(FP4 *x, FP2 *a, FP2 *b);
+/**	@brief Initialise FP4 from single FP2
+ *
+	Imaginary part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+ */
+extern void FP4_from_FP2(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP2
+ *
+	real part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2H(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP
+ *
+	@param x FP4 instance to be initialised
+	@param a FP to form real part of FP4
+ */
+extern void FP4_from_FP(FP4 *x, FP *a);
+
+/**	@brief Copy FP4 to another FP4
+ *
+	@param x FP4 instance, on exit = y
+	@param y FP4 instance to be copied
+ */
+extern void FP4_copy(FP4 *x, FP4 *y);
+/**	@brief Set FP4 to zero
+ *
+	@param x FP4 instance to be set to zero
+ */
+extern void FP4_zero(FP4 *x);
+/**	@brief Set FP4 to unity
+ *
+	@param x FP4 instance to be set to one
+ */
+extern void FP4_one(FP4 *x);
+
+/**	@brief Sign of FP4
+ *
+	@param x FP4 instance
+	@return "sign" of FP4
+ */
+extern int FP4_sign(FP4 *x);
+
+/**	@brief Negation of FP4
+ *
+	@param x FP4 instance, on exit = -y
+	@param y FP4 instance
+ */
+extern void FP4_neg(FP4 *x, FP4 *y);
+/**	@brief Conjugation of FP4
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP4 instance, on exit = conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_conj(FP4 *x, FP4 *y);
+/**	@brief Negative conjugation of FP4
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP4 instance, on exit = -conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_nconj(FP4 *x, FP4 *y);
+/**	@brief addition of two FP4s
+ *
+	@param x FP4 instance, on exit = y+z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_add(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief subtraction of two FP4s
+ *
+	@param x FP4 instance, on exit = y-z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_sub(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Multiplication of an FP4 by an FP2
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP2 multiplier
+ */
+extern void FP4_pmul(FP4 *x, FP4 *y, FP2 *a);
+
+
+/**	@brief Multiplication of an FP4 by an FP
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP multiplier
+ */
+extern void FP4_qmul(FP4 *x, FP4 *y, FP *a);
+
+/**	@brief Multiplication of an FP4 by a small integer
+ *
+	@param x FP4 instance, on exit = y*i
+	@param y FP4 instance
+	@param i an integer
+ */
+extern void FP4_imul(FP4 *x, FP4 *y, int i);
+/**	@brief Squaring an FP4
+ *
+	@param x FP4 instance, on exit = y^2
+	@param y FP4 instance
+ */
+extern void FP4_sqr(FP4 *x, FP4 *y);
+/**	@brief Multiplication of two FP4s
+ *
+	@param x FP4 instance, on exit = y*z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_mul(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Inverting an FP4
+ *
+	@param x FP4 instance, on exit = 1/y
+	@param y FP4 instance
+    @param h optional input hint
+ */
+extern void FP4_inv(FP4 *x, FP4 *y, FP *h);
+
+/**	@brief Divide an FP4 by 2
+ *
+	@param x FP4 instance, on exit = y/2
+	@param y FP4 instance
+ */
+extern void FP4_div2(FP4 *x, FP4 *y);
+
+
+/**	@brief Formats and outputs an FP4 to the console
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_output(FP4 *x);
+/**	@brief Formats and outputs an FP4 to the console in raw form (for debugging)
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_rawoutput(FP4 *x);
+/**	@brief multiplies an FP4 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP4 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP4_times_i(FP4 *x);
+/**	@brief Normalises the components of an FP4
+ *
+	@param x FP4 instance to be normalised
+ */
+extern void FP4_norm(FP4 *x);
+/**	@brief Reduces all components of possibly unreduced FP4 mod Modulus
+ *
+	@param x FP4 instance, on exit reduced mod Modulus
+ */
+extern void FP4_reduce(FP4 *x);
+/**	@brief Raises an FP4 to the power of a BIG
+ *
+	@param x FP4 instance, on exit = y^b
+	@param y FP4 instance
+	@param b BIG number
+ */
+extern void FP4_pow(FP4 *x, FP4 *y, B512_60::BIG b);
+/**	@brief Raises an FP4 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP4 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP4_frob(FP4 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP4 instance, on exit = w*x-conj(x)*y+z
+	@param w FP4 instance
+	@param x FP4 instance
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_xtr_A(FP4 *r, FP4 *w, FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP4 instance, on exit = x^2-2*conj(x)
+	@param x FP4 instance
+ */
+extern void FP4_xtr_D(FP4 *r, FP4 *x);
+/**	@brief Calculates FP4 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP4 instance, on exit = trace(w^b)
+	@param x FP4 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP4_xtr_pow(FP4 *r, FP4 *x, B512_60::BIG b);
+/**	@brief Calculates FP4 trace of c^a.d^b, where c and d are derived from FP4 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP4 instance, on exit = trace(c^a.d^b)
+	@param c FP4 instance, trace of an FP12
+	@param d FP4 instance, trace of an FP12
+	@param e FP4 instance, trace of an FP12
+	@param f FP4 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP4_xtr_pow2(FP4 *r, FP4 *c, FP4 *d, FP4 *e, FP4 *f, B512_60::BIG a, B512_60::BIG b);
+
+/**	@brief Test FP4 for QR
+ * 
+	@param r FP4 instance
+    @param h optional generated hint
+	@return 1 x is a QR, otherwise 0
+ */
+extern int  FP4_qr(FP4 *r, FP *h);
+
+/**	@brief Calculate square root of an FP4
+ *
+	Square root
+	@param r FP4 instance, on exit = sqrt(x)
+	@param x FP4 instance
+    @param h optional input hint
+ */
+extern void  FP4_sqrt(FP4 *r, FP4 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP4 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP4 instance, set to y if s!=0
+	@param y another FP4 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP4_cmove(FP4 *x, FP4 *y, int s);
+
+
+/**	@brief Divide FP4 number by QNR
+ *
+	Divide FP4 by the QNR
+	@param x FP4 instance
+ */
+extern void FP4_div_i(FP4 *x);
+
+/**	@brief Generate random FP4
+ *
+	@param x random FP4 number
+	@param rng random number generator
+ */
+extern void FP4_rand(FP4 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp8.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp8.h
new file mode 100644
index 0000000..e9ed770
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp8.h
@@ -0,0 +1,365 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP8_YYY_H
+#define FP8_YYY_H
+
+#include "fp4_YYY.h"
+#include "config_curve_ZZZ.h"
+
+using namespace core;
+
+namespace YYY {
+
+/**
+	@brief FP8 Structure - towered over two FP4
+*/
+
+typedef struct
+{
+    FP4 a; /**< real part of FP8 */
+    FP4 b; /**< imaginary part of FP8 */
+} FP8;
+
+
+/* FP8 prototypes */
+/**	@brief Tests for FP8 equal to zero
+ *
+	@param x FP8 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP8_iszilch(FP8 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP8 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP8_islarger(FP8 *x);
+
+/**	@brief Serialize in FP8  
+ *
+    @param b buffer for output
+	@param x FP8 number to be serialized
+ */
+extern void FP8_toBytes(char *b,FP8 *x);
+/**	@brief Serialize out FP8  
+ *
+	@param x FP8 number to be serialized
+    @param b buffer for input
+ */
+extern void FP8_fromBytes(FP8 *x,char *b);
+
+
+/**	@brief Tests for FP8 equal to unity
+ *
+	@param x FP8 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP8_isunity(FP8 *x);
+/**	@brief Tests for equality of two FP8s
+ *
+	@param x FP8 instance to be compared
+	@param y FP8 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP8_equals(FP8 *x, FP8 *y);
+/**	@brief Tests for FP8 having only a real part and no imaginary part
+ *
+	@param x FP8 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP8_isreal(FP8 *x);
+/**	@brief Initialise FP8 from two FP4s
+ *
+	@param x FP8 instance to be initialised
+	@param a FP4 to form real part of FP8
+	@param b FP4 to form imaginary part of FP8
+ */
+extern void FP8_from_FP4s(FP8 *x, FP4 *a, FP4 *b);
+/**	@brief Initialise FP8 from single FP4
+ *
+	Imaginary part is set to zero
+	@param x FP8 instance to be initialised
+	@param a FP4 to form real part of FP8
+ */
+extern void FP8_from_FP4(FP8 *x, FP4 *a);
+
+/**	@brief Initialise FP8 from single FP4
+ *
+	real part is set to zero
+	@param x FP8 instance to be initialised
+	@param a FP4 to form imaginary part of FP8
+ */
+extern void FP8_from_FP4H(FP8 *x, FP4 *a);
+
+/**	@brief Initialise FP8 from single FP
+ *
+	@param x FP8 instance to be initialised
+	@param a FP to form real part of FP8
+ */
+extern void FP8_from_FP(FP8 *x, FP *a);
+
+/**	@brief Copy FP8 to another FP8
+ *
+	@param x FP8 instance, on exit = y
+	@param y FP8 instance to be copied
+ */
+extern void FP8_copy(FP8 *x, FP8 *y);
+
+/**	@brief Set FP8 to zero
+ *
+	@param x FP8 instance to be set to zero
+ */
+extern void FP8_zero(FP8 *x);
+/**	@brief Set FP8 to unity
+ *
+	@param x FP8 instance to be set to one
+ */
+extern void FP8_one(FP8 *x);
+
+/**	@brief Sign of FP8
+ *
+	@param x FP8 instance
+	@return "sign" of FP8
+ */
+extern int FP8_sign(FP8 *x);
+
+/**	@brief Negation of FP8
+ *
+	@param x FP8 instance, on exit = -y
+	@param y FP8 instance
+ */
+extern void FP8_neg(FP8 *x, FP8 *y);
+/**	@brief Conjugation of FP8
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP8 instance, on exit = conj(y)
+	@param y FP8 instance
+ */
+extern void FP8_conj(FP8 *x, FP8 *y);
+/**	@brief Negative conjugation of FP8
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP8 instance, on exit = -conj(y)
+	@param y FP8 instance
+ */
+extern void FP8_nconj(FP8 *x, FP8 *y);
+/**	@brief addition of two FP8s
+ *
+	@param x FP8 instance, on exit = y+z
+	@param y FP8 instance
+	@param z FP8 instance
+ */
+extern void FP8_add(FP8 *x, FP8 *y, FP8 *z);
+/**	@brief subtraction of two FP8s
+ *
+	@param x FP8 instance, on exit = y-z
+	@param y FP8 instance
+	@param z FP8 instance
+ */
+extern void FP8_sub(FP8 *x, FP8 *y, FP8 *z);
+/**	@brief Multiplication of an FP8 by an FP4
+ *
+	@param x FP8 instance, on exit = y*a
+	@param y FP8 instance
+	@param a FP4 multiplier
+ */
+extern void FP8_pmul(FP8 *x, FP8 *y, FP4 *a);
+
+/**	@brief Multiplication of an FP8 by an FP2
+ *
+	@param x FP8 instance, on exit = y*a
+	@param y FP8 instance
+	@param a FP2 multiplier
+ */
+extern void FP8_qmul(FP8 *x, FP8 *y, FP2 *a);
+
+/**	@brief Multiplication of an FP8 by an FP
+ *
+	@param x FP8 instance, on exit = y*a
+	@param y FP8 instance
+	@param a FP multiplier
+ */
+extern void FP8_tmul(FP8 *x, FP8 *y, FP *a);
+
+
+
+/**	@brief Multiplication of an FP8 by a small integer
+ *
+	@param x FP8 instance, on exit = y*i
+	@param y FP8 instance
+	@param i an integer
+ */
+extern void FP8_imul(FP8 *x, FP8 *y, int i);
+/**	@brief Squaring an FP8
+ *
+	@param x FP8 instance, on exit = y^2
+	@param y FP8 instance
+ */
+extern void FP8_sqr(FP8 *x, FP8 *y);
+/**	@brief Multiplication of two FP8s
+ *
+	@param x FP8 instance, on exit = y*z
+	@param y FP8 instance
+	@param z FP8 instance
+ */
+extern void FP8_mul(FP8 *x, FP8 *y, FP8 *z);
+/**	@brief Inverting an FP8
+ *
+	@param x FP8 instance, on exit = 1/y
+	@param y FP8 instance
+    @param h optional input hint
+ */
+extern void FP8_inv(FP8 *x, FP8 *y, FP *h);
+/**	@brief Formats and outputs an FP8 to the console
+ *
+	@param x FP8 instance to be printed
+ */
+extern void FP8_output(FP8 *x);
+/**	@brief Divide an FP8 by 2
+ *
+	@param x FP8 instance, on exit = y/2
+	@param y FP8 instance
+ */
+extern void FP8_div2(FP8 *x, FP8 *y);
+
+/**	@brief Formats and outputs an FP8 to the console in raw form (for debugging)
+ *
+	@param x FP8 instance to be printed
+ */
+extern void FP8_rawoutput(FP8 *x);
+/**	@brief multiplies an FP8 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP8 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP8_times_i(FP8 *x);
+/**	@brief multiplies an FP8 instance by irreducible polynomial (1+sqrt(-1))
+ *
+	@param x FP8 instance, on exit = (1+sqrt(-1)*x
+ */
+extern void FP8_times_i2(FP8 *x);
+
+/**	@brief Normalises the components of an FP8
+ *
+	@param x FP8 instance to be normalised
+ */
+extern void FP8_norm(FP8 *x);
+/**	@brief Reduces all components of possibly unreduced FP8 mod Modulus
+ *
+	@param x FP8 instance, on exit reduced mod Modulus
+ */
+extern void FP8_reduce(FP8 *x);
+/**	@brief Raises an FP8 to the power of a BIG
+ *
+	@param x FP8 instance, on exit = y^b
+	@param y FP8 instance
+	@param b BIG number
+ */
+extern void FP8_pow(FP8 *x, FP8 *y, XXX::BIG b);
+/**	@brief Raises an FP8 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP8 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP8_frob(FP8 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP8 instance, on exit = w*x-conj(x)*y+z
+	@param w FP8 instance
+	@param x FP8 instance
+	@param y FP8 instance
+	@param z FP8 instance
+ */
+extern void FP8_xtr_A(FP8 *r, FP8 *w, FP8 *x, FP8 *y, FP8 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP8 instance, on exit = x^2-2*conj(x)
+	@param x FP8 instance
+ */
+extern void FP8_xtr_D(FP8 *r, FP8 *x);
+/**	@brief Calculates FP8 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP8 instance, on exit = trace(w^b)
+	@param x FP8 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP8_xtr_pow(FP8 *r, FP8 *x, XXX::BIG b);
+/**	@brief Calculates FP8 trace of c^a.d^b, where c and d are derived from FP8 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP8 instance, on exit = trace(c^a.d^b)
+	@param c FP8 instance, trace of an FP12
+	@param d FP8 instance, trace of an FP12
+	@param e FP8 instance, trace of an FP12
+	@param f FP8 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP8_xtr_pow2(FP8 *r, FP8 *c, FP8 *d, FP8 *e, FP8 *f, XXX::BIG a, XXX::BIG b);
+
+/**	@brief Test FP8 for QR
+ *
+	Square root
+	@param r FP8 instance
+    @param h optional generated hint
+	@return 1 r is a QR, otherwise 0
+ */
+extern int  FP8_qr(FP8 *r, FP *h);
+
+
+/**	@brief Calculate square root of an FP8
+ *
+	Square root
+	@param r FP8 instance, on exit = sqrt(x)
+	@param x FP8 instance
+    @param h optional input hint
+ */
+extern void  FP8_sqrt(FP8 *r, FP8 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP8 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP8 instance, set to y if s!=0
+	@param y another FP8 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP8_cmove(FP8 *x, FP8 *y, int s);
+
+
+/**	@brief Divide FP8 number by QNR
+ *
+	Divide FP8 by the QNR
+	@param x FP8 instance
+ */
+extern void FP8_div_i(FP8 *x);
+
+/**	@brief Generate random FP8
+ *
+	@param x random FP8 number
+	@param rng random number generator
+ */
+extern void FP8_rand(FP8 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp8_BLS24479.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp8_BLS24479.h
new file mode 100644
index 0000000..d383a0f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp8_BLS24479.h
@@ -0,0 +1,365 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP8_BLS24479_H
+#define FP8_BLS24479_H
+
+#include "fp4_BLS24479.h"
+#include "config_curve_BLS24479.h"
+
+using namespace core;
+
+namespace BLS24479 {
+
+/**
+	@brief FP8 Structure - towered over two FP4
+*/
+
+typedef struct
+{
+    FP4 a; /**< real part of FP8 */
+    FP4 b; /**< imaginary part of FP8 */
+} FP8;
+
+
+/* FP8 prototypes */
+/**	@brief Tests for FP8 equal to zero
+ *
+	@param x FP8 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP8_iszilch(FP8 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP8 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP8_islarger(FP8 *x);
+
+/**	@brief Serialize in FP8  
+ *
+    @param b buffer for output
+	@param x FP8 number to be serialized
+ */
+extern void FP8_toBytes(char *b,FP8 *x);
+/**	@brief Serialize out FP8  
+ *
+	@param x FP8 number to be serialized
+    @param b buffer for input
+ */
+extern void FP8_fromBytes(FP8 *x,char *b);
+
+
+/**	@brief Tests for FP8 equal to unity
+ *
+	@param x FP8 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP8_isunity(FP8 *x);
+/**	@brief Tests for equality of two FP8s
+ *
+	@param x FP8 instance to be compared
+	@param y FP8 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP8_equals(FP8 *x, FP8 *y);
+/**	@brief Tests for FP8 having only a real part and no imaginary part
+ *
+	@param x FP8 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP8_isreal(FP8 *x);
+/**	@brief Initialise FP8 from two FP4s
+ *
+	@param x FP8 instance to be initialised
+	@param a FP4 to form real part of FP8
+	@param b FP4 to form imaginary part of FP8
+ */
+extern void FP8_from_FP4s(FP8 *x, FP4 *a, FP4 *b);
+/**	@brief Initialise FP8 from single FP4
+ *
+	Imaginary part is set to zero
+	@param x FP8 instance to be initialised
+	@param a FP4 to form real part of FP8
+ */
+extern void FP8_from_FP4(FP8 *x, FP4 *a);
+
+/**	@brief Initialise FP8 from single FP4
+ *
+	real part is set to zero
+	@param x FP8 instance to be initialised
+	@param a FP4 to form imaginary part of FP8
+ */
+extern void FP8_from_FP4H(FP8 *x, FP4 *a);
+
+/**	@brief Initialise FP8 from single FP
+ *
+	@param x FP8 instance to be initialised
+	@param a FP to form real part of FP8
+ */
+extern void FP8_from_FP(FP8 *x, FP *a);
+
+/**	@brief Copy FP8 to another FP8
+ *
+	@param x FP8 instance, on exit = y
+	@param y FP8 instance to be copied
+ */
+extern void FP8_copy(FP8 *x, FP8 *y);
+
+/**	@brief Set FP8 to zero
+ *
+	@param x FP8 instance to be set to zero
+ */
+extern void FP8_zero(FP8 *x);
+/**	@brief Set FP8 to unity
+ *
+	@param x FP8 instance to be set to one
+ */
+extern void FP8_one(FP8 *x);
+
+/**	@brief Sign of FP8
+ *
+	@param x FP8 instance
+	@return "sign" of FP8
+ */
+extern int FP8_sign(FP8 *x);
+
+/**	@brief Negation of FP8
+ *
+	@param x FP8 instance, on exit = -y
+	@param y FP8 instance
+ */
+extern void FP8_neg(FP8 *x, FP8 *y);
+/**	@brief Conjugation of FP8
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP8 instance, on exit = conj(y)
+	@param y FP8 instance
+ */
+extern void FP8_conj(FP8 *x, FP8 *y);
+/**	@brief Negative conjugation of FP8
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP8 instance, on exit = -conj(y)
+	@param y FP8 instance
+ */
+extern void FP8_nconj(FP8 *x, FP8 *y);
+/**	@brief addition of two FP8s
+ *
+	@param x FP8 instance, on exit = y+z
+	@param y FP8 instance
+	@param z FP8 instance
+ */
+extern void FP8_add(FP8 *x, FP8 *y, FP8 *z);
+/**	@brief subtraction of two FP8s
+ *
+	@param x FP8 instance, on exit = y-z
+	@param y FP8 instance
+	@param z FP8 instance
+ */
+extern void FP8_sub(FP8 *x, FP8 *y, FP8 *z);
+/**	@brief Multiplication of an FP8 by an FP4
+ *
+	@param x FP8 instance, on exit = y*a
+	@param y FP8 instance
+	@param a FP4 multiplier
+ */
+extern void FP8_pmul(FP8 *x, FP8 *y, FP4 *a);
+
+/**	@brief Multiplication of an FP8 by an FP2
+ *
+	@param x FP8 instance, on exit = y*a
+	@param y FP8 instance
+	@param a FP2 multiplier
+ */
+extern void FP8_qmul(FP8 *x, FP8 *y, FP2 *a);
+
+/**	@brief Multiplication of an FP8 by an FP
+ *
+	@param x FP8 instance, on exit = y*a
+	@param y FP8 instance
+	@param a FP multiplier
+ */
+extern void FP8_tmul(FP8 *x, FP8 *y, FP *a);
+
+
+
+/**	@brief Multiplication of an FP8 by a small integer
+ *
+	@param x FP8 instance, on exit = y*i
+	@param y FP8 instance
+	@param i an integer
+ */
+extern void FP8_imul(FP8 *x, FP8 *y, int i);
+/**	@brief Squaring an FP8
+ *
+	@param x FP8 instance, on exit = y^2
+	@param y FP8 instance
+ */
+extern void FP8_sqr(FP8 *x, FP8 *y);
+/**	@brief Multiplication of two FP8s
+ *
+	@param x FP8 instance, on exit = y*z
+	@param y FP8 instance
+	@param z FP8 instance
+ */
+extern void FP8_mul(FP8 *x, FP8 *y, FP8 *z);
+/**	@brief Inverting an FP8
+ *
+	@param x FP8 instance, on exit = 1/y
+	@param y FP8 instance
+    @param h optional input hint
+ */
+extern void FP8_inv(FP8 *x, FP8 *y, FP *h);
+/**	@brief Formats and outputs an FP8 to the console
+ *
+	@param x FP8 instance to be printed
+ */
+extern void FP8_output(FP8 *x);
+/**	@brief Divide an FP8 by 2
+ *
+	@param x FP8 instance, on exit = y/2
+	@param y FP8 instance
+ */
+extern void FP8_div2(FP8 *x, FP8 *y);
+
+/**	@brief Formats and outputs an FP8 to the console in raw form (for debugging)
+ *
+	@param x FP8 instance to be printed
+ */
+extern void FP8_rawoutput(FP8 *x);
+/**	@brief multiplies an FP8 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP8 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP8_times_i(FP8 *x);
+/**	@brief multiplies an FP8 instance by irreducible polynomial (1+sqrt(-1))
+ *
+	@param x FP8 instance, on exit = (1+sqrt(-1)*x
+ */
+extern void FP8_times_i2(FP8 *x);
+
+/**	@brief Normalises the components of an FP8
+ *
+	@param x FP8 instance to be normalised
+ */
+extern void FP8_norm(FP8 *x);
+/**	@brief Reduces all components of possibly unreduced FP8 mod Modulus
+ *
+	@param x FP8 instance, on exit reduced mod Modulus
+ */
+extern void FP8_reduce(FP8 *x);
+/**	@brief Raises an FP8 to the power of a BIG
+ *
+	@param x FP8 instance, on exit = y^b
+	@param y FP8 instance
+	@param b BIG number
+ */
+extern void FP8_pow(FP8 *x, FP8 *y, B480_56::BIG b);
+/**	@brief Raises an FP8 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP8 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP8_frob(FP8 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP8 instance, on exit = w*x-conj(x)*y+z
+	@param w FP8 instance
+	@param x FP8 instance
+	@param y FP8 instance
+	@param z FP8 instance
+ */
+extern void FP8_xtr_A(FP8 *r, FP8 *w, FP8 *x, FP8 *y, FP8 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP8 instance, on exit = x^2-2*conj(x)
+	@param x FP8 instance
+ */
+extern void FP8_xtr_D(FP8 *r, FP8 *x);
+/**	@brief Calculates FP8 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP8 instance, on exit = trace(w^b)
+	@param x FP8 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP8_xtr_pow(FP8 *r, FP8 *x, B480_56::BIG b);
+/**	@brief Calculates FP8 trace of c^a.d^b, where c and d are derived from FP8 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP8 instance, on exit = trace(c^a.d^b)
+	@param c FP8 instance, trace of an FP12
+	@param d FP8 instance, trace of an FP12
+	@param e FP8 instance, trace of an FP12
+	@param f FP8 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP8_xtr_pow2(FP8 *r, FP8 *c, FP8 *d, FP8 *e, FP8 *f, B480_56::BIG a, B480_56::BIG b);
+
+/**	@brief Test FP8 for QR
+ *
+	Square root
+	@param r FP8 instance
+    @param h optional generated hint
+	@return 1 r is a QR, otherwise 0
+ */
+extern int  FP8_qr(FP8 *r, FP *h);
+
+
+/**	@brief Calculate square root of an FP8
+ *
+	Square root
+	@param r FP8 instance, on exit = sqrt(x)
+	@param x FP8 instance
+    @param h optional input hint
+ */
+extern void  FP8_sqrt(FP8 *r, FP8 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP8 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP8 instance, set to y if s!=0
+	@param y another FP8 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP8_cmove(FP8 *x, FP8 *y, int s);
+
+
+/**	@brief Divide FP8 number by QNR
+ *
+	Divide FP8 by the QNR
+	@param x FP8 instance
+ */
+extern void FP8_div_i(FP8 *x);
+
+/**	@brief Generate random FP8
+ *
+	@param x random FP8 number
+	@param rng random number generator
+ */
+extern void FP8_rand(FP8 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp8_BLS48286.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp8_BLS48286.h
new file mode 100644
index 0000000..f68fe7a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp8_BLS48286.h
@@ -0,0 +1,365 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP8_BLS48286_H
+#define FP8_BLS48286_H
+
+#include "fp4_BLS48286.h"
+#include "config_curve_BLS48286.h"
+
+using namespace core;
+
+namespace BLS48286 {
+
+/**
+	@brief FP8 Structure - towered over two FP4
+*/
+
+typedef struct
+{
+    FP4 a; /**< real part of FP8 */
+    FP4 b; /**< imaginary part of FP8 */
+} FP8;
+
+
+/* FP8 prototypes */
+/**	@brief Tests for FP8 equal to zero
+ *
+	@param x FP8 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP8_iszilch(FP8 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP8 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP8_islarger(FP8 *x);
+
+/**	@brief Serialize in FP8  
+ *
+    @param b buffer for output
+	@param x FP8 number to be serialized
+ */
+extern void FP8_toBytes(char *b,FP8 *x);
+/**	@brief Serialize out FP8  
+ *
+	@param x FP8 number to be serialized
+    @param b buffer for input
+ */
+extern void FP8_fromBytes(FP8 *x,char *b);
+
+
+/**	@brief Tests for FP8 equal to unity
+ *
+	@param x FP8 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP8_isunity(FP8 *x);
+/**	@brief Tests for equality of two FP8s
+ *
+	@param x FP8 instance to be compared
+	@param y FP8 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP8_equals(FP8 *x, FP8 *y);
+/**	@brief Tests for FP8 having only a real part and no imaginary part
+ *
+	@param x FP8 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP8_isreal(FP8 *x);
+/**	@brief Initialise FP8 from two FP4s
+ *
+	@param x FP8 instance to be initialised
+	@param a FP4 to form real part of FP8
+	@param b FP4 to form imaginary part of FP8
+ */
+extern void FP8_from_FP4s(FP8 *x, FP4 *a, FP4 *b);
+/**	@brief Initialise FP8 from single FP4
+ *
+	Imaginary part is set to zero
+	@param x FP8 instance to be initialised
+	@param a FP4 to form real part of FP8
+ */
+extern void FP8_from_FP4(FP8 *x, FP4 *a);
+
+/**	@brief Initialise FP8 from single FP4
+ *
+	real part is set to zero
+	@param x FP8 instance to be initialised
+	@param a FP4 to form imaginary part of FP8
+ */
+extern void FP8_from_FP4H(FP8 *x, FP4 *a);
+
+/**	@brief Initialise FP8 from single FP
+ *
+	@param x FP8 instance to be initialised
+	@param a FP to form real part of FP8
+ */
+extern void FP8_from_FP(FP8 *x, FP *a);
+
+/**	@brief Copy FP8 to another FP8
+ *
+	@param x FP8 instance, on exit = y
+	@param y FP8 instance to be copied
+ */
+extern void FP8_copy(FP8 *x, FP8 *y);
+
+/**	@brief Set FP8 to zero
+ *
+	@param x FP8 instance to be set to zero
+ */
+extern void FP8_zero(FP8 *x);
+/**	@brief Set FP8 to unity
+ *
+	@param x FP8 instance to be set to one
+ */
+extern void FP8_one(FP8 *x);
+
+/**	@brief Sign of FP8
+ *
+	@param x FP8 instance
+	@return "sign" of FP8
+ */
+extern int FP8_sign(FP8 *x);
+
+/**	@brief Negation of FP8
+ *
+	@param x FP8 instance, on exit = -y
+	@param y FP8 instance
+ */
+extern void FP8_neg(FP8 *x, FP8 *y);
+/**	@brief Conjugation of FP8
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP8 instance, on exit = conj(y)
+	@param y FP8 instance
+ */
+extern void FP8_conj(FP8 *x, FP8 *y);
+/**	@brief Negative conjugation of FP8
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP8 instance, on exit = -conj(y)
+	@param y FP8 instance
+ */
+extern void FP8_nconj(FP8 *x, FP8 *y);
+/**	@brief addition of two FP8s
+ *
+	@param x FP8 instance, on exit = y+z
+	@param y FP8 instance
+	@param z FP8 instance
+ */
+extern void FP8_add(FP8 *x, FP8 *y, FP8 *z);
+/**	@brief subtraction of two FP8s
+ *
+	@param x FP8 instance, on exit = y-z
+	@param y FP8 instance
+	@param z FP8 instance
+ */
+extern void FP8_sub(FP8 *x, FP8 *y, FP8 *z);
+/**	@brief Multiplication of an FP8 by an FP4
+ *
+	@param x FP8 instance, on exit = y*a
+	@param y FP8 instance
+	@param a FP4 multiplier
+ */
+extern void FP8_pmul(FP8 *x, FP8 *y, FP4 *a);
+
+/**	@brief Multiplication of an FP8 by an FP2
+ *
+	@param x FP8 instance, on exit = y*a
+	@param y FP8 instance
+	@param a FP2 multiplier
+ */
+extern void FP8_qmul(FP8 *x, FP8 *y, FP2 *a);
+
+/**	@brief Multiplication of an FP8 by an FP
+ *
+	@param x FP8 instance, on exit = y*a
+	@param y FP8 instance
+	@param a FP multiplier
+ */
+extern void FP8_tmul(FP8 *x, FP8 *y, FP *a);
+
+
+
+/**	@brief Multiplication of an FP8 by a small integer
+ *
+	@param x FP8 instance, on exit = y*i
+	@param y FP8 instance
+	@param i an integer
+ */
+extern void FP8_imul(FP8 *x, FP8 *y, int i);
+/**	@brief Squaring an FP8
+ *
+	@param x FP8 instance, on exit = y^2
+	@param y FP8 instance
+ */
+extern void FP8_sqr(FP8 *x, FP8 *y);
+/**	@brief Multiplication of two FP8s
+ *
+	@param x FP8 instance, on exit = y*z
+	@param y FP8 instance
+	@param z FP8 instance
+ */
+extern void FP8_mul(FP8 *x, FP8 *y, FP8 *z);
+/**	@brief Inverting an FP8
+ *
+	@param x FP8 instance, on exit = 1/y
+	@param y FP8 instance
+    @param h optional input hint
+ */
+extern void FP8_inv(FP8 *x, FP8 *y, FP *h);
+/**	@brief Formats and outputs an FP8 to the console
+ *
+	@param x FP8 instance to be printed
+ */
+extern void FP8_output(FP8 *x);
+/**	@brief Divide an FP8 by 2
+ *
+	@param x FP8 instance, on exit = y/2
+	@param y FP8 instance
+ */
+extern void FP8_div2(FP8 *x, FP8 *y);
+
+/**	@brief Formats and outputs an FP8 to the console in raw form (for debugging)
+ *
+	@param x FP8 instance to be printed
+ */
+extern void FP8_rawoutput(FP8 *x);
+/**	@brief multiplies an FP8 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP8 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP8_times_i(FP8 *x);
+/**	@brief multiplies an FP8 instance by irreducible polynomial (1+sqrt(-1))
+ *
+	@param x FP8 instance, on exit = (1+sqrt(-1)*x
+ */
+extern void FP8_times_i2(FP8 *x);
+
+/**	@brief Normalises the components of an FP8
+ *
+	@param x FP8 instance to be normalised
+ */
+extern void FP8_norm(FP8 *x);
+/**	@brief Reduces all components of possibly unreduced FP8 mod Modulus
+ *
+	@param x FP8 instance, on exit reduced mod Modulus
+ */
+extern void FP8_reduce(FP8 *x);
+/**	@brief Raises an FP8 to the power of a BIG
+ *
+	@param x FP8 instance, on exit = y^b
+	@param y FP8 instance
+	@param b BIG number
+ */
+extern void FP8_pow(FP8 *x, FP8 *y, B288_60::BIG b);
+/**	@brief Raises an FP8 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP8 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP8_frob(FP8 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP8 instance, on exit = w*x-conj(x)*y+z
+	@param w FP8 instance
+	@param x FP8 instance
+	@param y FP8 instance
+	@param z FP8 instance
+ */
+extern void FP8_xtr_A(FP8 *r, FP8 *w, FP8 *x, FP8 *y, FP8 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP8 instance, on exit = x^2-2*conj(x)
+	@param x FP8 instance
+ */
+extern void FP8_xtr_D(FP8 *r, FP8 *x);
+/**	@brief Calculates FP8 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP8 instance, on exit = trace(w^b)
+	@param x FP8 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP8_xtr_pow(FP8 *r, FP8 *x, B288_60::BIG b);
+/**	@brief Calculates FP8 trace of c^a.d^b, where c and d are derived from FP8 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP8 instance, on exit = trace(c^a.d^b)
+	@param c FP8 instance, trace of an FP12
+	@param d FP8 instance, trace of an FP12
+	@param e FP8 instance, trace of an FP12
+	@param f FP8 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP8_xtr_pow2(FP8 *r, FP8 *c, FP8 *d, FP8 *e, FP8 *f, B288_60::BIG a, B288_60::BIG b);
+
+/**	@brief Test FP8 for QR
+ *
+	Square root
+	@param r FP8 instance
+    @param h optional generated hint
+	@return 1 r is a QR, otherwise 0
+ */
+extern int  FP8_qr(FP8 *r, FP *h);
+
+
+/**	@brief Calculate square root of an FP8
+ *
+	Square root
+	@param r FP8 instance, on exit = sqrt(x)
+	@param x FP8 instance
+    @param h optional input hint
+ */
+extern void  FP8_sqrt(FP8 *r, FP8 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP8 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP8 instance, set to y if s!=0
+	@param y another FP8 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP8_cmove(FP8 *x, FP8 *y, int s);
+
+
+/**	@brief Divide FP8 number by QNR
+ *
+	Divide FP8 by the QNR
+	@param x FP8 instance
+ */
+extern void FP8_div_i(FP8 *x);
+
+/**	@brief Generate random FP8
+ *
+	@param x random FP8 number
+	@param rng random number generator
+ */
+extern void FP8_rand(FP8 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp8_BLS48556.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp8_BLS48556.h
new file mode 100644
index 0000000..30eda14
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp8_BLS48556.h
@@ -0,0 +1,365 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP8_BLS48556_H
+#define FP8_BLS48556_H
+
+#include "fp4_BLS48556.h"
+#include "config_curve_BLS48556.h"
+
+using namespace core;
+
+namespace BLS48556 {
+
+/**
+	@brief FP8 Structure - towered over two FP4
+*/
+
+typedef struct
+{
+    FP4 a; /**< real part of FP8 */
+    FP4 b; /**< imaginary part of FP8 */
+} FP8;
+
+
+/* FP8 prototypes */
+/**	@brief Tests for FP8 equal to zero
+ *
+	@param x FP8 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP8_iszilch(FP8 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP8 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP8_islarger(FP8 *x);
+
+/**	@brief Serialize in FP8  
+ *
+    @param b buffer for output
+	@param x FP8 number to be serialized
+ */
+extern void FP8_toBytes(char *b,FP8 *x);
+/**	@brief Serialize out FP8  
+ *
+	@param x FP8 number to be serialized
+    @param b buffer for input
+ */
+extern void FP8_fromBytes(FP8 *x,char *b);
+
+
+/**	@brief Tests for FP8 equal to unity
+ *
+	@param x FP8 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP8_isunity(FP8 *x);
+/**	@brief Tests for equality of two FP8s
+ *
+	@param x FP8 instance to be compared
+	@param y FP8 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP8_equals(FP8 *x, FP8 *y);
+/**	@brief Tests for FP8 having only a real part and no imaginary part
+ *
+	@param x FP8 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP8_isreal(FP8 *x);
+/**	@brief Initialise FP8 from two FP4s
+ *
+	@param x FP8 instance to be initialised
+	@param a FP4 to form real part of FP8
+	@param b FP4 to form imaginary part of FP8
+ */
+extern void FP8_from_FP4s(FP8 *x, FP4 *a, FP4 *b);
+/**	@brief Initialise FP8 from single FP4
+ *
+	Imaginary part is set to zero
+	@param x FP8 instance to be initialised
+	@param a FP4 to form real part of FP8
+ */
+extern void FP8_from_FP4(FP8 *x, FP4 *a);
+
+/**	@brief Initialise FP8 from single FP4
+ *
+	real part is set to zero
+	@param x FP8 instance to be initialised
+	@param a FP4 to form imaginary part of FP8
+ */
+extern void FP8_from_FP4H(FP8 *x, FP4 *a);
+
+/**	@brief Initialise FP8 from single FP
+ *
+	@param x FP8 instance to be initialised
+	@param a FP to form real part of FP8
+ */
+extern void FP8_from_FP(FP8 *x, FP *a);
+
+/**	@brief Copy FP8 to another FP8
+ *
+	@param x FP8 instance, on exit = y
+	@param y FP8 instance to be copied
+ */
+extern void FP8_copy(FP8 *x, FP8 *y);
+
+/**	@brief Set FP8 to zero
+ *
+	@param x FP8 instance to be set to zero
+ */
+extern void FP8_zero(FP8 *x);
+/**	@brief Set FP8 to unity
+ *
+	@param x FP8 instance to be set to one
+ */
+extern void FP8_one(FP8 *x);
+
+/**	@brief Sign of FP8
+ *
+	@param x FP8 instance
+	@return "sign" of FP8
+ */
+extern int FP8_sign(FP8 *x);
+
+/**	@brief Negation of FP8
+ *
+	@param x FP8 instance, on exit = -y
+	@param y FP8 instance
+ */
+extern void FP8_neg(FP8 *x, FP8 *y);
+/**	@brief Conjugation of FP8
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP8 instance, on exit = conj(y)
+	@param y FP8 instance
+ */
+extern void FP8_conj(FP8 *x, FP8 *y);
+/**	@brief Negative conjugation of FP8
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP8 instance, on exit = -conj(y)
+	@param y FP8 instance
+ */
+extern void FP8_nconj(FP8 *x, FP8 *y);
+/**	@brief addition of two FP8s
+ *
+	@param x FP8 instance, on exit = y+z
+	@param y FP8 instance
+	@param z FP8 instance
+ */
+extern void FP8_add(FP8 *x, FP8 *y, FP8 *z);
+/**	@brief subtraction of two FP8s
+ *
+	@param x FP8 instance, on exit = y-z
+	@param y FP8 instance
+	@param z FP8 instance
+ */
+extern void FP8_sub(FP8 *x, FP8 *y, FP8 *z);
+/**	@brief Multiplication of an FP8 by an FP4
+ *
+	@param x FP8 instance, on exit = y*a
+	@param y FP8 instance
+	@param a FP4 multiplier
+ */
+extern void FP8_pmul(FP8 *x, FP8 *y, FP4 *a);
+
+/**	@brief Multiplication of an FP8 by an FP2
+ *
+	@param x FP8 instance, on exit = y*a
+	@param y FP8 instance
+	@param a FP2 multiplier
+ */
+extern void FP8_qmul(FP8 *x, FP8 *y, FP2 *a);
+
+/**	@brief Multiplication of an FP8 by an FP
+ *
+	@param x FP8 instance, on exit = y*a
+	@param y FP8 instance
+	@param a FP multiplier
+ */
+extern void FP8_tmul(FP8 *x, FP8 *y, FP *a);
+
+
+
+/**	@brief Multiplication of an FP8 by a small integer
+ *
+	@param x FP8 instance, on exit = y*i
+	@param y FP8 instance
+	@param i an integer
+ */
+extern void FP8_imul(FP8 *x, FP8 *y, int i);
+/**	@brief Squaring an FP8
+ *
+	@param x FP8 instance, on exit = y^2
+	@param y FP8 instance
+ */
+extern void FP8_sqr(FP8 *x, FP8 *y);
+/**	@brief Multiplication of two FP8s
+ *
+	@param x FP8 instance, on exit = y*z
+	@param y FP8 instance
+	@param z FP8 instance
+ */
+extern void FP8_mul(FP8 *x, FP8 *y, FP8 *z);
+/**	@brief Inverting an FP8
+ *
+	@param x FP8 instance, on exit = 1/y
+	@param y FP8 instance
+    @param h optional input hint
+ */
+extern void FP8_inv(FP8 *x, FP8 *y, FP *h);
+/**	@brief Formats and outputs an FP8 to the console
+ *
+	@param x FP8 instance to be printed
+ */
+extern void FP8_output(FP8 *x);
+/**	@brief Divide an FP8 by 2
+ *
+	@param x FP8 instance, on exit = y/2
+	@param y FP8 instance
+ */
+extern void FP8_div2(FP8 *x, FP8 *y);
+
+/**	@brief Formats and outputs an FP8 to the console in raw form (for debugging)
+ *
+	@param x FP8 instance to be printed
+ */
+extern void FP8_rawoutput(FP8 *x);
+/**	@brief multiplies an FP8 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP8 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP8_times_i(FP8 *x);
+/**	@brief multiplies an FP8 instance by irreducible polynomial (1+sqrt(-1))
+ *
+	@param x FP8 instance, on exit = (1+sqrt(-1)*x
+ */
+extern void FP8_times_i2(FP8 *x);
+
+/**	@brief Normalises the components of an FP8
+ *
+	@param x FP8 instance to be normalised
+ */
+extern void FP8_norm(FP8 *x);
+/**	@brief Reduces all components of possibly unreduced FP8 mod Modulus
+ *
+	@param x FP8 instance, on exit reduced mod Modulus
+ */
+extern void FP8_reduce(FP8 *x);
+/**	@brief Raises an FP8 to the power of a BIG
+ *
+	@param x FP8 instance, on exit = y^b
+	@param y FP8 instance
+	@param b BIG number
+ */
+extern void FP8_pow(FP8 *x, FP8 *y, B560_58::BIG b);
+/**	@brief Raises an FP8 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP8 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP8_frob(FP8 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP8 instance, on exit = w*x-conj(x)*y+z
+	@param w FP8 instance
+	@param x FP8 instance
+	@param y FP8 instance
+	@param z FP8 instance
+ */
+extern void FP8_xtr_A(FP8 *r, FP8 *w, FP8 *x, FP8 *y, FP8 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP8 instance, on exit = x^2-2*conj(x)
+	@param x FP8 instance
+ */
+extern void FP8_xtr_D(FP8 *r, FP8 *x);
+/**	@brief Calculates FP8 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP8 instance, on exit = trace(w^b)
+	@param x FP8 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP8_xtr_pow(FP8 *r, FP8 *x, B560_58::BIG b);
+/**	@brief Calculates FP8 trace of c^a.d^b, where c and d are derived from FP8 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP8 instance, on exit = trace(c^a.d^b)
+	@param c FP8 instance, trace of an FP12
+	@param d FP8 instance, trace of an FP12
+	@param e FP8 instance, trace of an FP12
+	@param f FP8 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP8_xtr_pow2(FP8 *r, FP8 *c, FP8 *d, FP8 *e, FP8 *f, B560_58::BIG a, B560_58::BIG b);
+
+/**	@brief Test FP8 for QR
+ *
+	Square root
+	@param r FP8 instance
+    @param h optional generated hint
+	@return 1 r is a QR, otherwise 0
+ */
+extern int  FP8_qr(FP8 *r, FP *h);
+
+
+/**	@brief Calculate square root of an FP8
+ *
+	Square root
+	@param r FP8 instance, on exit = sqrt(x)
+	@param x FP8 instance
+    @param h optional input hint
+ */
+extern void  FP8_sqrt(FP8 *r, FP8 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP8 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP8 instance, set to y if s!=0
+	@param y another FP8 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP8_cmove(FP8 *x, FP8 *y, int s);
+
+
+/**	@brief Divide FP8 number by QNR
+ *
+	Divide FP8 by the QNR
+	@param x FP8 instance
+ */
+extern void FP8_div_i(FP8 *x);
+
+/**	@brief Generate random FP8
+ *
+	@param x random FP8 number
+	@param rng random number generator
+ */
+extern void FP8_rand(FP8 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp8_BLS48581.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp8_BLS48581.h
new file mode 100644
index 0000000..3a56ea4
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp8_BLS48581.h
@@ -0,0 +1,365 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP8_BLS48581_H
+#define FP8_BLS48581_H
+
+#include "fp4_BLS48581.h"
+#include "config_curve_BLS48581.h"
+
+using namespace core;
+
+namespace BLS48581 {
+
+/**
+	@brief FP8 Structure - towered over two FP4
+*/
+
+typedef struct
+{
+    FP4 a; /**< real part of FP8 */
+    FP4 b; /**< imaginary part of FP8 */
+} FP8;
+
+
+/* FP8 prototypes */
+/**	@brief Tests for FP8 equal to zero
+ *
+	@param x FP8 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP8_iszilch(FP8 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP8 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP8_islarger(FP8 *x);
+
+/**	@brief Serialize in FP8  
+ *
+    @param b buffer for output
+	@param x FP8 number to be serialized
+ */
+extern void FP8_toBytes(char *b,FP8 *x);
+/**	@brief Serialize out FP8  
+ *
+	@param x FP8 number to be serialized
+    @param b buffer for input
+ */
+extern void FP8_fromBytes(FP8 *x,char *b);
+
+
+/**	@brief Tests for FP8 equal to unity
+ *
+	@param x FP8 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP8_isunity(FP8 *x);
+/**	@brief Tests for equality of two FP8s
+ *
+	@param x FP8 instance to be compared
+	@param y FP8 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP8_equals(FP8 *x, FP8 *y);
+/**	@brief Tests for FP8 having only a real part and no imaginary part
+ *
+	@param x FP8 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP8_isreal(FP8 *x);
+/**	@brief Initialise FP8 from two FP4s
+ *
+	@param x FP8 instance to be initialised
+	@param a FP4 to form real part of FP8
+	@param b FP4 to form imaginary part of FP8
+ */
+extern void FP8_from_FP4s(FP8 *x, FP4 *a, FP4 *b);
+/**	@brief Initialise FP8 from single FP4
+ *
+	Imaginary part is set to zero
+	@param x FP8 instance to be initialised
+	@param a FP4 to form real part of FP8
+ */
+extern void FP8_from_FP4(FP8 *x, FP4 *a);
+
+/**	@brief Initialise FP8 from single FP4
+ *
+	real part is set to zero
+	@param x FP8 instance to be initialised
+	@param a FP4 to form imaginary part of FP8
+ */
+extern void FP8_from_FP4H(FP8 *x, FP4 *a);
+
+/**	@brief Initialise FP8 from single FP
+ *
+	@param x FP8 instance to be initialised
+	@param a FP to form real part of FP8
+ */
+extern void FP8_from_FP(FP8 *x, FP *a);
+
+/**	@brief Copy FP8 to another FP8
+ *
+	@param x FP8 instance, on exit = y
+	@param y FP8 instance to be copied
+ */
+extern void FP8_copy(FP8 *x, FP8 *y);
+
+/**	@brief Set FP8 to zero
+ *
+	@param x FP8 instance to be set to zero
+ */
+extern void FP8_zero(FP8 *x);
+/**	@brief Set FP8 to unity
+ *
+	@param x FP8 instance to be set to one
+ */
+extern void FP8_one(FP8 *x);
+
+/**	@brief Sign of FP8
+ *
+	@param x FP8 instance
+	@return "sign" of FP8
+ */
+extern int FP8_sign(FP8 *x);
+
+/**	@brief Negation of FP8
+ *
+	@param x FP8 instance, on exit = -y
+	@param y FP8 instance
+ */
+extern void FP8_neg(FP8 *x, FP8 *y);
+/**	@brief Conjugation of FP8
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP8 instance, on exit = conj(y)
+	@param y FP8 instance
+ */
+extern void FP8_conj(FP8 *x, FP8 *y);
+/**	@brief Negative conjugation of FP8
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP8 instance, on exit = -conj(y)
+	@param y FP8 instance
+ */
+extern void FP8_nconj(FP8 *x, FP8 *y);
+/**	@brief addition of two FP8s
+ *
+	@param x FP8 instance, on exit = y+z
+	@param y FP8 instance
+	@param z FP8 instance
+ */
+extern void FP8_add(FP8 *x, FP8 *y, FP8 *z);
+/**	@brief subtraction of two FP8s
+ *
+	@param x FP8 instance, on exit = y-z
+	@param y FP8 instance
+	@param z FP8 instance
+ */
+extern void FP8_sub(FP8 *x, FP8 *y, FP8 *z);
+/**	@brief Multiplication of an FP8 by an FP4
+ *
+	@param x FP8 instance, on exit = y*a
+	@param y FP8 instance
+	@param a FP4 multiplier
+ */
+extern void FP8_pmul(FP8 *x, FP8 *y, FP4 *a);
+
+/**	@brief Multiplication of an FP8 by an FP2
+ *
+	@param x FP8 instance, on exit = y*a
+	@param y FP8 instance
+	@param a FP2 multiplier
+ */
+extern void FP8_qmul(FP8 *x, FP8 *y, FP2 *a);
+
+/**	@brief Multiplication of an FP8 by an FP
+ *
+	@param x FP8 instance, on exit = y*a
+	@param y FP8 instance
+	@param a FP multiplier
+ */
+extern void FP8_tmul(FP8 *x, FP8 *y, FP *a);
+
+
+
+/**	@brief Multiplication of an FP8 by a small integer
+ *
+	@param x FP8 instance, on exit = y*i
+	@param y FP8 instance
+	@param i an integer
+ */
+extern void FP8_imul(FP8 *x, FP8 *y, int i);
+/**	@brief Squaring an FP8
+ *
+	@param x FP8 instance, on exit = y^2
+	@param y FP8 instance
+ */
+extern void FP8_sqr(FP8 *x, FP8 *y);
+/**	@brief Multiplication of two FP8s
+ *
+	@param x FP8 instance, on exit = y*z
+	@param y FP8 instance
+	@param z FP8 instance
+ */
+extern void FP8_mul(FP8 *x, FP8 *y, FP8 *z);
+/**	@brief Inverting an FP8
+ *
+	@param x FP8 instance, on exit = 1/y
+	@param y FP8 instance
+    @param h optional input hint
+ */
+extern void FP8_inv(FP8 *x, FP8 *y, FP *h);
+/**	@brief Formats and outputs an FP8 to the console
+ *
+	@param x FP8 instance to be printed
+ */
+extern void FP8_output(FP8 *x);
+/**	@brief Divide an FP8 by 2
+ *
+	@param x FP8 instance, on exit = y/2
+	@param y FP8 instance
+ */
+extern void FP8_div2(FP8 *x, FP8 *y);
+
+/**	@brief Formats and outputs an FP8 to the console in raw form (for debugging)
+ *
+	@param x FP8 instance to be printed
+ */
+extern void FP8_rawoutput(FP8 *x);
+/**	@brief multiplies an FP8 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP8 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP8_times_i(FP8 *x);
+/**	@brief multiplies an FP8 instance by irreducible polynomial (1+sqrt(-1))
+ *
+	@param x FP8 instance, on exit = (1+sqrt(-1)*x
+ */
+extern void FP8_times_i2(FP8 *x);
+
+/**	@brief Normalises the components of an FP8
+ *
+	@param x FP8 instance to be normalised
+ */
+extern void FP8_norm(FP8 *x);
+/**	@brief Reduces all components of possibly unreduced FP8 mod Modulus
+ *
+	@param x FP8 instance, on exit reduced mod Modulus
+ */
+extern void FP8_reduce(FP8 *x);
+/**	@brief Raises an FP8 to the power of a BIG
+ *
+	@param x FP8 instance, on exit = y^b
+	@param y FP8 instance
+	@param b BIG number
+ */
+extern void FP8_pow(FP8 *x, FP8 *y, B584_60::BIG b);
+/**	@brief Raises an FP8 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP8 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP8_frob(FP8 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP8 instance, on exit = w*x-conj(x)*y+z
+	@param w FP8 instance
+	@param x FP8 instance
+	@param y FP8 instance
+	@param z FP8 instance
+ */
+extern void FP8_xtr_A(FP8 *r, FP8 *w, FP8 *x, FP8 *y, FP8 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP8 instance, on exit = x^2-2*conj(x)
+	@param x FP8 instance
+ */
+extern void FP8_xtr_D(FP8 *r, FP8 *x);
+/**	@brief Calculates FP8 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP8 instance, on exit = trace(w^b)
+	@param x FP8 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP8_xtr_pow(FP8 *r, FP8 *x, B584_60::BIG b);
+/**	@brief Calculates FP8 trace of c^a.d^b, where c and d are derived from FP8 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP8 instance, on exit = trace(c^a.d^b)
+	@param c FP8 instance, trace of an FP12
+	@param d FP8 instance, trace of an FP12
+	@param e FP8 instance, trace of an FP12
+	@param f FP8 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP8_xtr_pow2(FP8 *r, FP8 *c, FP8 *d, FP8 *e, FP8 *f, B584_60::BIG a, B584_60::BIG b);
+
+/**	@brief Test FP8 for QR
+ *
+	Square root
+	@param r FP8 instance
+    @param h optional generated hint
+	@return 1 r is a QR, otherwise 0
+ */
+extern int  FP8_qr(FP8 *r, FP *h);
+
+
+/**	@brief Calculate square root of an FP8
+ *
+	Square root
+	@param r FP8 instance, on exit = sqrt(x)
+	@param x FP8 instance
+    @param h optional input hint
+ */
+extern void  FP8_sqrt(FP8 *r, FP8 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP8 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP8 instance, set to y if s!=0
+	@param y another FP8 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP8_cmove(FP8 *x, FP8 *y, int s);
+
+
+/**	@brief Divide FP8 number by QNR
+ *
+	Divide FP8 by the QNR
+	@param x FP8 instance
+ */
+extern void FP8_div_i(FP8 *x);
+
+/**	@brief Generate random FP8
+ *
+	@param x random FP8 number
+	@param rng random number generator
+ */
+extern void FP8_rand(FP8 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_ANSSI.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_ANSSI.h
new file mode 100644
index 0000000..f5731e5
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_ANSSI.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_ANSSI_H
+#define FP_ANSSI_H
+
+#include "big_B256_56.h"
+#include "config_field_ANSSI.h"
+
+using namespace core;
+
+#define MODBITS_ANSSI MBITS_ANSSI
+#define TBITS_ANSSI (MBITS_ANSSI%BASEBITS_B256_56)              /**< Number of active bits in top word */
+#define TMASK_ANSSI (((chunk)1<<TBITS_ANSSI)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_ANSSI (((sign32)1<<MAXXES_ANSSI)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_ANSSI (-((chunk)(1)<<TBITS_ANSSI))            /**<  for masking out overflow bits */
+
+namespace ANSSI {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B256_56::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B256_56::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B256_56::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B256_56::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B256_56::BIG SQRTm3;      /**< Square root of -3 */
+extern const B256_56::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B256_56::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B256_56::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B256_56::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B256_56::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B256_56::BIG r, B256_56::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B256_56::BIG, B256_56::BIG, B256_56::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B256_56::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_BLS12381.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_BLS12381.h
new file mode 100644
index 0000000..456c1c7
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_BLS12381.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_BLS12381_H
+#define FP_BLS12381_H
+
+#include "big_B384_58.h"
+#include "config_field_BLS12381.h"
+
+using namespace core;
+
+#define MODBITS_BLS12381 MBITS_BLS12381
+#define TBITS_BLS12381 (MBITS_BLS12381%BASEBITS_B384_58)              /**< Number of active bits in top word */
+#define TMASK_BLS12381 (((chunk)1<<TBITS_BLS12381)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_BLS12381 (((sign32)1<<MAXXES_BLS12381)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_BLS12381 (-((chunk)(1)<<TBITS_BLS12381))            /**<  for masking out overflow bits */
+
+namespace BLS12381 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B384_58::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B384_58::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B384_58::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B384_58::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B384_58::BIG SQRTm3;      /**< Square root of -3 */
+extern const B384_58::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B384_58::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B384_58::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B384_58::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B384_58::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B384_58::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B384_58::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B384_58::BIG r, B384_58::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B384_58::BIG, B384_58::BIG, B384_58::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B384_58::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_BLS12383.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_BLS12383.h
new file mode 100644
index 0000000..335a69c
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_BLS12383.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_BLS12383_H
+#define FP_BLS12383_H
+
+#include "big_B384_58.h"
+#include "config_field_BLS12383.h"
+
+using namespace core;
+
+#define MODBITS_BLS12383 MBITS_BLS12383
+#define TBITS_BLS12383 (MBITS_BLS12383%BASEBITS_B384_58)              /**< Number of active bits in top word */
+#define TMASK_BLS12383 (((chunk)1<<TBITS_BLS12383)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_BLS12383 (((sign32)1<<MAXXES_BLS12383)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_BLS12383 (-((chunk)(1)<<TBITS_BLS12383))            /**<  for masking out overflow bits */
+
+namespace BLS12383 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B384_58::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B384_58::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B384_58::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B384_58::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B384_58::BIG SQRTm3;      /**< Square root of -3 */
+extern const B384_58::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B384_58::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B384_58::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B384_58::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B384_58::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B384_58::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B384_58::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B384_58::BIG r, B384_58::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B384_58::BIG, B384_58::BIG, B384_58::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B384_58::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_BLS12443.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_BLS12443.h
new file mode 100644
index 0000000..87362be
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_BLS12443.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_BLS12443_H
+#define FP_BLS12443_H
+
+#include "big_B448_60.h"
+#include "config_field_BLS12443.h"
+
+using namespace core;
+
+#define MODBITS_BLS12443 MBITS_BLS12443
+#define TBITS_BLS12443 (MBITS_BLS12443%BASEBITS_B448_60)              /**< Number of active bits in top word */
+#define TMASK_BLS12443 (((chunk)1<<TBITS_BLS12443)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_BLS12443 (((sign32)1<<MAXXES_BLS12443)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_BLS12443 (-((chunk)(1)<<TBITS_BLS12443))            /**<  for masking out overflow bits */
+
+namespace BLS12443 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B448_60::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B448_60::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B448_60::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B448_60::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B448_60::BIG SQRTm3;      /**< Square root of -3 */
+extern const B448_60::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B448_60::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B448_60::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B448_60::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B448_60::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B448_60::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B448_60::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B448_60::BIG r, B448_60::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B448_60::BIG, B448_60::BIG, B448_60::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B448_60::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_BLS12461.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_BLS12461.h
new file mode 100644
index 0000000..4bdcd80
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_BLS12461.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_BLS12461_H
+#define FP_BLS12461_H
+
+#include "big_B464_60.h"
+#include "config_field_BLS12461.h"
+
+using namespace core;
+
+#define MODBITS_BLS12461 MBITS_BLS12461
+#define TBITS_BLS12461 (MBITS_BLS12461%BASEBITS_B464_60)              /**< Number of active bits in top word */
+#define TMASK_BLS12461 (((chunk)1<<TBITS_BLS12461)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_BLS12461 (((sign32)1<<MAXXES_BLS12461)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_BLS12461 (-((chunk)(1)<<TBITS_BLS12461))            /**<  for masking out overflow bits */
+
+namespace BLS12461 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B464_60::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B464_60::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B464_60::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B464_60::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B464_60::BIG SQRTm3;      /**< Square root of -3 */
+extern const B464_60::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B464_60::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B464_60::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B464_60::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B464_60::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B464_60::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B464_60::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B464_60::BIG r, B464_60::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B464_60::BIG, B464_60::BIG, B464_60::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B464_60::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_BLS24479.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_BLS24479.h
new file mode 100644
index 0000000..2d00fa9
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_BLS24479.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_BLS24479_H
+#define FP_BLS24479_H
+
+#include "big_B480_56.h"
+#include "config_field_BLS24479.h"
+
+using namespace core;
+
+#define MODBITS_BLS24479 MBITS_BLS24479
+#define TBITS_BLS24479 (MBITS_BLS24479%BASEBITS_B480_56)              /**< Number of active bits in top word */
+#define TMASK_BLS24479 (((chunk)1<<TBITS_BLS24479)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_BLS24479 (((sign32)1<<MAXXES_BLS24479)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_BLS24479 (-((chunk)(1)<<TBITS_BLS24479))            /**<  for masking out overflow bits */
+
+namespace BLS24479 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B480_56::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B480_56::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B480_56::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B480_56::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B480_56::BIG SQRTm3;      /**< Square root of -3 */
+extern const B480_56::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B480_56::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B480_56::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B480_56::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B480_56::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B480_56::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B480_56::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B480_56::BIG r, B480_56::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B480_56::BIG, B480_56::BIG, B480_56::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B480_56::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_BLS48286.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_BLS48286.h
new file mode 100644
index 0000000..f165d34
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_BLS48286.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_BLS48286_H
+#define FP_BLS48286_H
+
+#include "big_B288_60.h"
+#include "config_field_BLS48286.h"
+
+using namespace core;
+
+#define MODBITS_BLS48286 MBITS_BLS48286
+#define TBITS_BLS48286 (MBITS_BLS48286%BASEBITS_B288_60)              /**< Number of active bits in top word */
+#define TMASK_BLS48286 (((chunk)1<<TBITS_BLS48286)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_BLS48286 (((sign32)1<<MAXXES_BLS48286)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_BLS48286 (-((chunk)(1)<<TBITS_BLS48286))            /**<  for masking out overflow bits */
+
+namespace BLS48286 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B288_60::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B288_60::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B288_60::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B288_60::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B288_60::BIG SQRTm3;      /**< Square root of -3 */
+extern const B288_60::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B288_60::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B288_60::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B288_60::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B288_60::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B288_60::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B288_60::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B288_60::BIG r, B288_60::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B288_60::BIG, B288_60::BIG, B288_60::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B288_60::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_BLS48556.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_BLS48556.h
new file mode 100644
index 0000000..3a39d17
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_BLS48556.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_BLS48556_H
+#define FP_BLS48556_H
+
+#include "big_B560_58.h"
+#include "config_field_BLS48556.h"
+
+using namespace core;
+
+#define MODBITS_BLS48556 MBITS_BLS48556
+#define TBITS_BLS48556 (MBITS_BLS48556%BASEBITS_B560_58)              /**< Number of active bits in top word */
+#define TMASK_BLS48556 (((chunk)1<<TBITS_BLS48556)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_BLS48556 (((sign32)1<<MAXXES_BLS48556)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_BLS48556 (-((chunk)(1)<<TBITS_BLS48556))            /**<  for masking out overflow bits */
+
+namespace BLS48556 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B560_58::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B560_58::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B560_58::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B560_58::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B560_58::BIG SQRTm3;      /**< Square root of -3 */
+extern const B560_58::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B560_58::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B560_58::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B560_58::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B560_58::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B560_58::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B560_58::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B560_58::BIG r, B560_58::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B560_58::BIG, B560_58::BIG, B560_58::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B560_58::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_BLS48581.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_BLS48581.h
new file mode 100644
index 0000000..eb941f0
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_BLS48581.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_BLS48581_H
+#define FP_BLS48581_H
+
+#include "big_B584_60.h"
+#include "config_field_BLS48581.h"
+
+using namespace core;
+
+#define MODBITS_BLS48581 MBITS_BLS48581
+#define TBITS_BLS48581 (MBITS_BLS48581%BASEBITS_B584_60)              /**< Number of active bits in top word */
+#define TMASK_BLS48581 (((chunk)1<<TBITS_BLS48581)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_BLS48581 (((sign32)1<<MAXXES_BLS48581)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_BLS48581 (-((chunk)(1)<<TBITS_BLS48581))            /**<  for masking out overflow bits */
+
+namespace BLS48581 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B584_60::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B584_60::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B584_60::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B584_60::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B584_60::BIG SQRTm3;      /**< Square root of -3 */
+extern const B584_60::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B584_60::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B584_60::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B584_60::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B584_60::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B584_60::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B584_60::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B584_60::BIG r, B584_60::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B584_60::BIG, B584_60::BIG, B584_60::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B584_60::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_BN158.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_BN158.h
new file mode 100644
index 0000000..8278f85
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_BN158.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_BN158_H
+#define FP_BN158_H
+
+#include "big_B160_56.h"
+#include "config_field_BN158.h"
+
+using namespace core;
+
+#define MODBITS_BN158 MBITS_BN158
+#define TBITS_BN158 (MBITS_BN158%BASEBITS_B160_56)              /**< Number of active bits in top word */
+#define TMASK_BN158 (((chunk)1<<TBITS_BN158)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_BN158 (((sign32)1<<MAXXES_BN158)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_BN158 (-((chunk)(1)<<TBITS_BN158))            /**<  for masking out overflow bits */
+
+namespace BN158 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B160_56::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B160_56::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B160_56::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B160_56::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B160_56::BIG SQRTm3;      /**< Square root of -3 */
+extern const B160_56::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B160_56::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B160_56::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B160_56::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B160_56::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B160_56::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B160_56::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B160_56::BIG r, B160_56::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B160_56::BIG, B160_56::BIG, B160_56::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B160_56::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_BN254.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_BN254.h
new file mode 100644
index 0000000..5992a0e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_BN254.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_BN254_H
+#define FP_BN254_H
+
+#include "big_B256_56.h"
+#include "config_field_BN254.h"
+
+using namespace core;
+
+#define MODBITS_BN254 MBITS_BN254
+#define TBITS_BN254 (MBITS_BN254%BASEBITS_B256_56)              /**< Number of active bits in top word */
+#define TMASK_BN254 (((chunk)1<<TBITS_BN254)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_BN254 (((sign32)1<<MAXXES_BN254)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_BN254 (-((chunk)(1)<<TBITS_BN254))            /**<  for masking out overflow bits */
+
+namespace BN254 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B256_56::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B256_56::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B256_56::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B256_56::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B256_56::BIG SQRTm3;      /**< Square root of -3 */
+extern const B256_56::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B256_56::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B256_56::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B256_56::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B256_56::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B256_56::BIG r, B256_56::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B256_56::BIG, B256_56::BIG, B256_56::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B256_56::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_BN254CX.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_BN254CX.h
new file mode 100644
index 0000000..5c02527
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_BN254CX.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_BN254CX_H
+#define FP_BN254CX_H
+
+#include "big_B256_56.h"
+#include "config_field_BN254CX.h"
+
+using namespace core;
+
+#define MODBITS_BN254CX MBITS_BN254CX
+#define TBITS_BN254CX (MBITS_BN254CX%BASEBITS_B256_56)              /**< Number of active bits in top word */
+#define TMASK_BN254CX (((chunk)1<<TBITS_BN254CX)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_BN254CX (((sign32)1<<MAXXES_BN254CX)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_BN254CX (-((chunk)(1)<<TBITS_BN254CX))            /**<  for masking out overflow bits */
+
+namespace BN254CX {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B256_56::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B256_56::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B256_56::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B256_56::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B256_56::BIG SQRTm3;      /**< Square root of -3 */
+extern const B256_56::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B256_56::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B256_56::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B256_56::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B256_56::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B256_56::BIG r, B256_56::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B256_56::BIG, B256_56::BIG, B256_56::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B256_56::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_BN462.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_BN462.h
new file mode 100644
index 0000000..3d71e61
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_BN462.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_BN462_H
+#define FP_BN462_H
+
+#include "big_B464_60.h"
+#include "config_field_BN462.h"
+
+using namespace core;
+
+#define MODBITS_BN462 MBITS_BN462
+#define TBITS_BN462 (MBITS_BN462%BASEBITS_B464_60)              /**< Number of active bits in top word */
+#define TMASK_BN462 (((chunk)1<<TBITS_BN462)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_BN462 (((sign32)1<<MAXXES_BN462)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_BN462 (-((chunk)(1)<<TBITS_BN462))            /**<  for masking out overflow bits */
+
+namespace BN462 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B464_60::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B464_60::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B464_60::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B464_60::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B464_60::BIG SQRTm3;      /**< Square root of -3 */
+extern const B464_60::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B464_60::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B464_60::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B464_60::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B464_60::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B464_60::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B464_60::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B464_60::BIG r, B464_60::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B464_60::BIG, B464_60::BIG, B464_60::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B464_60::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_BRAINPOOL.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_BRAINPOOL.h
new file mode 100644
index 0000000..11d7739
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_BRAINPOOL.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_BRAINPOOL_H
+#define FP_BRAINPOOL_H
+
+#include "big_B256_56.h"
+#include "config_field_BRAINPOOL.h"
+
+using namespace core;
+
+#define MODBITS_BRAINPOOL MBITS_BRAINPOOL
+#define TBITS_BRAINPOOL (MBITS_BRAINPOOL%BASEBITS_B256_56)              /**< Number of active bits in top word */
+#define TMASK_BRAINPOOL (((chunk)1<<TBITS_BRAINPOOL)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_BRAINPOOL (((sign32)1<<MAXXES_BRAINPOOL)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_BRAINPOOL (-((chunk)(1)<<TBITS_BRAINPOOL))            /**<  for masking out overflow bits */
+
+namespace BRAINPOOL {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B256_56::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B256_56::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B256_56::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B256_56::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B256_56::BIG SQRTm3;      /**< Square root of -3 */
+extern const B256_56::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B256_56::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B256_56::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B256_56::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B256_56::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B256_56::BIG r, B256_56::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B256_56::BIG, B256_56::BIG, B256_56::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B256_56::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_C1174.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_C1174.h
new file mode 100644
index 0000000..3b576bd
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_C1174.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_C1174_H
+#define FP_C1174_H
+
+#include "big_B256_56.h"
+#include "config_field_C1174.h"
+
+using namespace core;
+
+#define MODBITS_C1174 MBITS_C1174
+#define TBITS_C1174 (MBITS_C1174%BASEBITS_B256_56)              /**< Number of active bits in top word */
+#define TMASK_C1174 (((chunk)1<<TBITS_C1174)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_C1174 (((sign32)1<<MAXXES_C1174)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_C1174 (-((chunk)(1)<<TBITS_C1174))            /**<  for masking out overflow bits */
+
+namespace C1174 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B256_56::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B256_56::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B256_56::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B256_56::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B256_56::BIG SQRTm3;      /**< Square root of -3 */
+extern const B256_56::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B256_56::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B256_56::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B256_56::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B256_56::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B256_56::BIG r, B256_56::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B256_56::BIG, B256_56::BIG, B256_56::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B256_56::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_C1665.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_C1665.h
new file mode 100644
index 0000000..a878bf0
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_C1665.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_C1665_H
+#define FP_C1665_H
+
+#include "big_B168_60.h"
+#include "config_field_C1665.h"
+
+using namespace core;
+
+#define MODBITS_C1665 MBITS_C1665
+#define TBITS_C1665 (MBITS_C1665%BASEBITS_B168_60)              /**< Number of active bits in top word */
+#define TMASK_C1665 (((chunk)1<<TBITS_C1665)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_C1665 (((sign32)1<<MAXXES_C1665)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_C1665 (-((chunk)(1)<<TBITS_C1665))            /**<  for masking out overflow bits */
+
+namespace C1665 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B168_60::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B168_60::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B168_60::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B168_60::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B168_60::BIG SQRTm3;      /**< Square root of -3 */
+extern const B168_60::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B168_60::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B168_60::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B168_60::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B168_60::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B168_60::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B168_60::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B168_60::BIG r, B168_60::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B168_60::BIG, B168_60::BIG, B168_60::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B168_60::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_C41417.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_C41417.h
new file mode 100644
index 0000000..3511b39
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_C41417.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_C41417_H
+#define FP_C41417_H
+
+#include "big_B416_60.h"
+#include "config_field_C41417.h"
+
+using namespace core;
+
+#define MODBITS_C41417 MBITS_C41417
+#define TBITS_C41417 (MBITS_C41417%BASEBITS_B416_60)              /**< Number of active bits in top word */
+#define TMASK_C41417 (((chunk)1<<TBITS_C41417)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_C41417 (((sign32)1<<MAXXES_C41417)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_C41417 (-((chunk)(1)<<TBITS_C41417))            /**<  for masking out overflow bits */
+
+namespace C41417 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B416_60::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B416_60::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B416_60::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B416_60::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B416_60::BIG SQRTm3;      /**< Square root of -3 */
+extern const B416_60::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B416_60::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B416_60::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B416_60::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B416_60::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B416_60::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B416_60::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B416_60::BIG r, B416_60::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B416_60::BIG, B416_60::BIG, B416_60::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B416_60::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_F25519.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_F25519.h
new file mode 100644
index 0000000..11acd30
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_F25519.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_F25519_H
+#define FP_F25519_H
+
+#include "big_B256_56.h"
+#include "config_field_F25519.h"
+
+using namespace core;
+
+#define MODBITS_F25519 MBITS_F25519
+#define TBITS_F25519 (MBITS_F25519%BASEBITS_B256_56)              /**< Number of active bits in top word */
+#define TMASK_F25519 (((chunk)1<<TBITS_F25519)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_F25519 (((sign32)1<<MAXXES_F25519)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_F25519 (-((chunk)(1)<<TBITS_F25519))            /**<  for masking out overflow bits */
+
+namespace F25519 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B256_56::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B256_56::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B256_56::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B256_56::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B256_56::BIG SQRTm3;      /**< Square root of -3 */
+extern const B256_56::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B256_56::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B256_56::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B256_56::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B256_56::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B256_56::BIG r, B256_56::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B256_56::BIG, B256_56::BIG, B256_56::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B256_56::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_F256PME.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_F256PME.h
new file mode 100644
index 0000000..8cfee23
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_F256PME.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_F256PME_H
+#define FP_F256PME_H
+
+#include "big_B256_56.h"
+#include "config_field_F256PME.h"
+
+using namespace core;
+
+#define MODBITS_F256PME MBITS_F256PME
+#define TBITS_F256PME (MBITS_F256PME%BASEBITS_B256_56)              /**< Number of active bits in top word */
+#define TMASK_F256PME (((chunk)1<<TBITS_F256PME)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_F256PME (((sign32)1<<MAXXES_F256PME)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_F256PME (-((chunk)(1)<<TBITS_F256PME))            /**<  for masking out overflow bits */
+
+namespace F256PME {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B256_56::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B256_56::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B256_56::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B256_56::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B256_56::BIG SQRTm3;      /**< Square root of -3 */
+extern const B256_56::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B256_56::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B256_56::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B256_56::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B256_56::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B256_56::BIG r, B256_56::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B256_56::BIG, B256_56::BIG, B256_56::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B256_56::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_F256PMW.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_F256PMW.h
new file mode 100644
index 0000000..ad0fb22
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_F256PMW.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_F256PMW_H
+#define FP_F256PMW_H
+
+#include "big_B256_56.h"
+#include "config_field_F256PMW.h"
+
+using namespace core;
+
+#define MODBITS_F256PMW MBITS_F256PMW
+#define TBITS_F256PMW (MBITS_F256PMW%BASEBITS_B256_56)              /**< Number of active bits in top word */
+#define TMASK_F256PMW (((chunk)1<<TBITS_F256PMW)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_F256PMW (((sign32)1<<MAXXES_F256PMW)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_F256PMW (-((chunk)(1)<<TBITS_F256PMW))            /**<  for masking out overflow bits */
+
+namespace F256PMW {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B256_56::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B256_56::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B256_56::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B256_56::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B256_56::BIG SQRTm3;      /**< Square root of -3 */
+extern const B256_56::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B256_56::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B256_56::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B256_56::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B256_56::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B256_56::BIG r, B256_56::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B256_56::BIG, B256_56::BIG, B256_56::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B256_56::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_F384PM.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_F384PM.h
new file mode 100644
index 0000000..9cdcbb4
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_F384PM.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_F384PM_H
+#define FP_F384PM_H
+
+#include "big_B384_58.h"
+#include "config_field_F384PM.h"
+
+using namespace core;
+
+#define MODBITS_F384PM MBITS_F384PM
+#define TBITS_F384PM (MBITS_F384PM%BASEBITS_B384_58)              /**< Number of active bits in top word */
+#define TMASK_F384PM (((chunk)1<<TBITS_F384PM)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_F384PM (((sign32)1<<MAXXES_F384PM)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_F384PM (-((chunk)(1)<<TBITS_F384PM))            /**<  for masking out overflow bits */
+
+namespace F384PM {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B384_58::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B384_58::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B384_58::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B384_58::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B384_58::BIG SQRTm3;      /**< Square root of -3 */
+extern const B384_58::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B384_58::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B384_58::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B384_58::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B384_58::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B384_58::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B384_58::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B384_58::BIG r, B384_58::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B384_58::BIG, B384_58::BIG, B384_58::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B384_58::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_F448.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_F448.h
new file mode 100644
index 0000000..f95f03f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_F448.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_F448_H
+#define FP_F448_H
+
+#include "big_B448_58.h"
+#include "config_field_F448.h"
+
+using namespace core;
+
+#define MODBITS_F448 MBITS_F448
+#define TBITS_F448 (MBITS_F448%BASEBITS_B448_58)              /**< Number of active bits in top word */
+#define TMASK_F448 (((chunk)1<<TBITS_F448)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_F448 (((sign32)1<<MAXXES_F448)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_F448 (-((chunk)(1)<<TBITS_F448))            /**<  for masking out overflow bits */
+
+namespace F448 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B448_58::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B448_58::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B448_58::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B448_58::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B448_58::BIG SQRTm3;      /**< Square root of -3 */
+extern const B448_58::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B448_58::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B448_58::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B448_58::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B448_58::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B448_58::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B448_58::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B448_58::BIG r, B448_58::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B448_58::BIG, B448_58::BIG, B448_58::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B448_58::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_F512PM.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_F512PM.h
new file mode 100644
index 0000000..77c3add
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_F512PM.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_F512PM_H
+#define FP_F512PM_H
+
+#include "big_B512_60.h"
+#include "config_field_F512PM.h"
+
+using namespace core;
+
+#define MODBITS_F512PM MBITS_F512PM
+#define TBITS_F512PM (MBITS_F512PM%BASEBITS_B512_60)              /**< Number of active bits in top word */
+#define TMASK_F512PM (((chunk)1<<TBITS_F512PM)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_F512PM (((sign32)1<<MAXXES_F512PM)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_F512PM (-((chunk)(1)<<TBITS_F512PM))            /**<  for masking out overflow bits */
+
+namespace F512PM {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B512_60::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B512_60::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B512_60::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B512_60::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B512_60::BIG SQRTm3;      /**< Square root of -3 */
+extern const B512_60::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B512_60::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B512_60::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B512_60::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B512_60::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B512_60::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B512_60::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B512_60::BIG r, B512_60::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B512_60::BIG, B512_60::BIG, B512_60::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B512_60::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_FP256BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_FP256BN.h
new file mode 100644
index 0000000..3da61bb
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_FP256BN.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_FP256BN_H
+#define FP_FP256BN_H
+
+#include "big_B256_56.h"
+#include "config_field_FP256BN.h"
+
+using namespace core;
+
+#define MODBITS_FP256BN MBITS_FP256BN
+#define TBITS_FP256BN (MBITS_FP256BN%BASEBITS_B256_56)              /**< Number of active bits in top word */
+#define TMASK_FP256BN (((chunk)1<<TBITS_FP256BN)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_FP256BN (((sign32)1<<MAXXES_FP256BN)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_FP256BN (-((chunk)(1)<<TBITS_FP256BN))            /**<  for masking out overflow bits */
+
+namespace FP256BN {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B256_56::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B256_56::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B256_56::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B256_56::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B256_56::BIG SQRTm3;      /**< Square root of -3 */
+extern const B256_56::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B256_56::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B256_56::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B256_56::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B256_56::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B256_56::BIG r, B256_56::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B256_56::BIG, B256_56::BIG, B256_56::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B256_56::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_FP512BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_FP512BN.h
new file mode 100644
index 0000000..bb1429a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_FP512BN.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_FP512BN_H
+#define FP_FP512BN_H
+
+#include "big_B512_60.h"
+#include "config_field_FP512BN.h"
+
+using namespace core;
+
+#define MODBITS_FP512BN MBITS_FP512BN
+#define TBITS_FP512BN (MBITS_FP512BN%BASEBITS_B512_60)              /**< Number of active bits in top word */
+#define TMASK_FP512BN (((chunk)1<<TBITS_FP512BN)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_FP512BN (((sign32)1<<MAXXES_FP512BN)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_FP512BN (-((chunk)(1)<<TBITS_FP512BN))            /**<  for masking out overflow bits */
+
+namespace FP512BN {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B512_60::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B512_60::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B512_60::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B512_60::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B512_60::BIG SQRTm3;      /**< Square root of -3 */
+extern const B512_60::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B512_60::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B512_60::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B512_60::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B512_60::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B512_60::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B512_60::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B512_60::BIG r, B512_60::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B512_60::BIG, B512_60::BIG, B512_60::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B512_60::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_HIFIVE.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_HIFIVE.h
new file mode 100644
index 0000000..a1824fb
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_HIFIVE.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_HIFIVE_H
+#define FP_HIFIVE_H
+
+#include "big_B336_60.h"
+#include "config_field_HIFIVE.h"
+
+using namespace core;
+
+#define MODBITS_HIFIVE MBITS_HIFIVE
+#define TBITS_HIFIVE (MBITS_HIFIVE%BASEBITS_B336_60)              /**< Number of active bits in top word */
+#define TMASK_HIFIVE (((chunk)1<<TBITS_HIFIVE)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_HIFIVE (((sign32)1<<MAXXES_HIFIVE)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_HIFIVE (-((chunk)(1)<<TBITS_HIFIVE))            /**<  for masking out overflow bits */
+
+namespace HIFIVE {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B336_60::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B336_60::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B336_60::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B336_60::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B336_60::BIG SQRTm3;      /**< Square root of -3 */
+extern const B336_60::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B336_60::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B336_60::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B336_60::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B336_60::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B336_60::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B336_60::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B336_60::BIG r, B336_60::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B336_60::BIG, B336_60::BIG, B336_60::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B336_60::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_JUBJUB.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_JUBJUB.h
new file mode 100644
index 0000000..e5f48a3
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_JUBJUB.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_JUBJUB_H
+#define FP_JUBJUB_H
+
+#include "big_B256_56.h"
+#include "config_field_JUBJUB.h"
+
+using namespace core;
+
+#define MODBITS_JUBJUB MBITS_JUBJUB
+#define TBITS_JUBJUB (MBITS_JUBJUB%BASEBITS_B256_56)              /**< Number of active bits in top word */
+#define TMASK_JUBJUB (((chunk)1<<TBITS_JUBJUB)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_JUBJUB (((sign32)1<<MAXXES_JUBJUB)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_JUBJUB (-((chunk)(1)<<TBITS_JUBJUB))            /**<  for masking out overflow bits */
+
+namespace JUBJUB {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B256_56::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B256_56::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B256_56::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B256_56::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B256_56::BIG SQRTm3;      /**< Square root of -3 */
+extern const B256_56::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B256_56::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B256_56::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B256_56::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B256_56::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B256_56::BIG r, B256_56::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B256_56::BIG, B256_56::BIG, B256_56::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B256_56::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_MDC.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_MDC.h
new file mode 100644
index 0000000..738617e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_MDC.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_MDC_H
+#define FP_MDC_H
+
+#include "big_B256_56.h"
+#include "config_field_MDC.h"
+
+using namespace core;
+
+#define MODBITS_MDC MBITS_MDC
+#define TBITS_MDC (MBITS_MDC%BASEBITS_B256_56)              /**< Number of active bits in top word */
+#define TMASK_MDC (((chunk)1<<TBITS_MDC)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_MDC (((sign32)1<<MAXXES_MDC)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_MDC (-((chunk)(1)<<TBITS_MDC))            /**<  for masking out overflow bits */
+
+namespace MDC {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B256_56::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B256_56::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B256_56::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B256_56::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B256_56::BIG SQRTm3;      /**< Square root of -3 */
+extern const B256_56::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B256_56::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B256_56::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B256_56::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B256_56::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B256_56::BIG r, B256_56::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B256_56::BIG, B256_56::BIG, B256_56::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B256_56::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_NIST256.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_NIST256.h
new file mode 100644
index 0000000..9cedbb7
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_NIST256.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_NIST256_H
+#define FP_NIST256_H
+
+#include "big_B256_56.h"
+#include "config_field_NIST256.h"
+
+using namespace core;
+
+#define MODBITS_NIST256 MBITS_NIST256
+#define TBITS_NIST256 (MBITS_NIST256%BASEBITS_B256_56)              /**< Number of active bits in top word */
+#define TMASK_NIST256 (((chunk)1<<TBITS_NIST256)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_NIST256 (((sign32)1<<MAXXES_NIST256)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_NIST256 (-((chunk)(1)<<TBITS_NIST256))            /**<  for masking out overflow bits */
+
+namespace NIST256 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B256_56::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B256_56::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B256_56::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B256_56::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B256_56::BIG SQRTm3;      /**< Square root of -3 */
+extern const B256_56::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B256_56::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B256_56::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B256_56::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B256_56::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B256_56::BIG r, B256_56::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B256_56::BIG, B256_56::BIG, B256_56::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B256_56::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_NIST384.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_NIST384.h
new file mode 100644
index 0000000..c6f6700
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_NIST384.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_NIST384_H
+#define FP_NIST384_H
+
+#include "big_B384_56.h"
+#include "config_field_NIST384.h"
+
+using namespace core;
+
+#define MODBITS_NIST384 MBITS_NIST384
+#define TBITS_NIST384 (MBITS_NIST384%BASEBITS_B384_56)              /**< Number of active bits in top word */
+#define TMASK_NIST384 (((chunk)1<<TBITS_NIST384)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_NIST384 (((sign32)1<<MAXXES_NIST384)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_NIST384 (-((chunk)(1)<<TBITS_NIST384))            /**<  for masking out overflow bits */
+
+namespace NIST384 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B384_56::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B384_56::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B384_56::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B384_56::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B384_56::BIG SQRTm3;      /**< Square root of -3 */
+extern const B384_56::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B384_56::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B384_56::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B384_56::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B384_56::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B384_56::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B384_56::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B384_56::BIG r, B384_56::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B384_56::BIG, B384_56::BIG, B384_56::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B384_56::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_NIST521.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_NIST521.h
new file mode 100644
index 0000000..5d51463
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_NIST521.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_NIST521_H
+#define FP_NIST521_H
+
+#include "big_B528_60.h"
+#include "config_field_NIST521.h"
+
+using namespace core;
+
+#define MODBITS_NIST521 MBITS_NIST521
+#define TBITS_NIST521 (MBITS_NIST521%BASEBITS_B528_60)              /**< Number of active bits in top word */
+#define TMASK_NIST521 (((chunk)1<<TBITS_NIST521)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_NIST521 (((sign32)1<<MAXXES_NIST521)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_NIST521 (-((chunk)(1)<<TBITS_NIST521))            /**<  for masking out overflow bits */
+
+namespace NIST521 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B528_60::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B528_60::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B528_60::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B528_60::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B528_60::BIG SQRTm3;      /**< Square root of -3 */
+extern const B528_60::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B528_60::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B528_60::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B528_60::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B528_60::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B528_60::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B528_60::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B528_60::BIG r, B528_60::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B528_60::BIG, B528_60::BIG, B528_60::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B528_60::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_SECP160R1.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_SECP160R1.h
new file mode 100644
index 0000000..8dc19b5
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_SECP160R1.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_SECP160R1_H
+#define FP_SECP160R1_H
+
+#include "big_B160_56.h"
+#include "config_field_SECP160R1.h"
+
+using namespace core;
+
+#define MODBITS_SECP160R1 MBITS_SECP160R1
+#define TBITS_SECP160R1 (MBITS_SECP160R1%BASEBITS_B160_56)              /**< Number of active bits in top word */
+#define TMASK_SECP160R1 (((chunk)1<<TBITS_SECP160R1)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_SECP160R1 (((sign32)1<<MAXXES_SECP160R1)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_SECP160R1 (-((chunk)(1)<<TBITS_SECP160R1))            /**<  for masking out overflow bits */
+
+namespace SECP160R1 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B160_56::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B160_56::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B160_56::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B160_56::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B160_56::BIG SQRTm3;      /**< Square root of -3 */
+extern const B160_56::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B160_56::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B160_56::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B160_56::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B160_56::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B160_56::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B160_56::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B160_56::BIG r, B160_56::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B160_56::BIG, B160_56::BIG, B160_56::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B160_56::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_SECP256K1.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_SECP256K1.h
new file mode 100644
index 0000000..c283745
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_SECP256K1.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_SECP256K1_H
+#define FP_SECP256K1_H
+
+#include "big_B256_56.h"
+#include "config_field_SECP256K1.h"
+
+using namespace core;
+
+#define MODBITS_SECP256K1 MBITS_SECP256K1
+#define TBITS_SECP256K1 (MBITS_SECP256K1%BASEBITS_B256_56)              /**< Number of active bits in top word */
+#define TMASK_SECP256K1 (((chunk)1<<TBITS_SECP256K1)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_SECP256K1 (((sign32)1<<MAXXES_SECP256K1)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_SECP256K1 (-((chunk)(1)<<TBITS_SECP256K1))            /**<  for masking out overflow bits */
+
+namespace SECP256K1 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B256_56::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B256_56::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B256_56::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B256_56::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B256_56::BIG SQRTm3;      /**< Square root of -3 */
+extern const B256_56::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B256_56::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B256_56::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B256_56::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B256_56::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B256_56::BIG r, B256_56::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B256_56::BIG, B256_56::BIG, B256_56::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B256_56::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_SM2.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_SM2.h
new file mode 100644
index 0000000..968a50a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_SM2.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_SM2_H
+#define FP_SM2_H
+
+#include "big_B256_56.h"
+#include "config_field_SM2.h"
+
+using namespace core;
+
+#define MODBITS_SM2 MBITS_SM2
+#define TBITS_SM2 (MBITS_SM2%BASEBITS_B256_56)              /**< Number of active bits in top word */
+#define TMASK_SM2 (((chunk)1<<TBITS_SM2)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_SM2 (((sign32)1<<MAXXES_SM2)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_SM2 (-((chunk)(1)<<TBITS_SM2))            /**<  for masking out overflow bits */
+
+namespace SM2 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B256_56::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B256_56::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B256_56::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B256_56::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B256_56::BIG SQRTm3;      /**< Square root of -3 */
+extern const B256_56::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B256_56::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B256_56::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B256_56::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B256_56::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B256_56::BIG r, B256_56::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B256_56::BIG, B256_56::BIG, B256_56::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B256_56::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_TWEEDLEDEE.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_TWEEDLEDEE.h
new file mode 100644
index 0000000..ecd0a04
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_TWEEDLEDEE.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_TWEEDLEDEE_H
+#define FP_TWEEDLEDEE_H
+
+#include "big_B256_56.h"
+#include "config_field_TWEEDLEDEE.h"
+
+using namespace core;
+
+#define MODBITS_TWEEDLEDEE MBITS_TWEEDLEDEE
+#define TBITS_TWEEDLEDEE (MBITS_TWEEDLEDEE%BASEBITS_B256_56)              /**< Number of active bits in top word */
+#define TMASK_TWEEDLEDEE (((chunk)1<<TBITS_TWEEDLEDEE)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_TWEEDLEDEE (((sign32)1<<MAXXES_TWEEDLEDEE)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_TWEEDLEDEE (-((chunk)(1)<<TBITS_TWEEDLEDEE))            /**<  for masking out overflow bits */
+
+namespace TWEEDLEDEE {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B256_56::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B256_56::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B256_56::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B256_56::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B256_56::BIG SQRTm3;      /**< Square root of -3 */
+extern const B256_56::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B256_56::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B256_56::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B256_56::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B256_56::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B256_56::BIG r, B256_56::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B256_56::BIG, B256_56::BIG, B256_56::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B256_56::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_TWEEDLEDUM.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_TWEEDLEDUM.h
new file mode 100644
index 0000000..72a1f55
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/fp_TWEEDLEDUM.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_TWEEDLEDUM_H
+#define FP_TWEEDLEDUM_H
+
+#include "big_B256_56.h"
+#include "config_field_TWEEDLEDUM.h"
+
+using namespace core;
+
+#define MODBITS_TWEEDLEDUM MBITS_TWEEDLEDUM
+#define TBITS_TWEEDLEDUM (MBITS_TWEEDLEDUM%BASEBITS_B256_56)              /**< Number of active bits in top word */
+#define TMASK_TWEEDLEDUM (((chunk)1<<TBITS_TWEEDLEDUM)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_TWEEDLEDUM (((sign32)1<<MAXXES_TWEEDLEDUM)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_TWEEDLEDUM (-((chunk)(1)<<TBITS_TWEEDLEDUM))            /**<  for masking out overflow bits */
+
+namespace TWEEDLEDUM {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B256_56::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B256_56::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B256_56::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B256_56::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B256_56::BIG SQRTm3;      /**< Square root of -3 */
+extern const B256_56::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B256_56::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B256_56::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B256_56::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B256_56::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B256_56::BIG r, B256_56::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B256_56::BIG, B256_56::BIG, B256_56::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B256_56::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke.h
new file mode 100644
index 0000000..db21187
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_ZZZ_H
+#define HPKE_ZZZ_H
+
+#include "ecdh_ZZZ.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace ZZZ {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_ANSSI.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_ANSSI.h
new file mode 100644
index 0000000..4109afe
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_ANSSI.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_ANSSI_H
+#define HPKE_ANSSI_H
+
+#include "ecdh_ANSSI.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace ANSSI {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_BLS12381.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_BLS12381.h
new file mode 100644
index 0000000..5f5e935
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_BLS12381.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_BLS12381_H
+#define HPKE_BLS12381_H
+
+#include "ecdh_BLS12381.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace BLS12381 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_BLS12383.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_BLS12383.h
new file mode 100644
index 0000000..3263597
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_BLS12383.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_BLS12383_H
+#define HPKE_BLS12383_H
+
+#include "ecdh_BLS12383.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace BLS12383 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_BLS12443.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_BLS12443.h
new file mode 100644
index 0000000..c23b2dc
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_BLS12443.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_BLS12443_H
+#define HPKE_BLS12443_H
+
+#include "ecdh_BLS12443.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace BLS12443 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_BLS12461.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_BLS12461.h
new file mode 100644
index 0000000..c5bd396
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_BLS12461.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_BLS12461_H
+#define HPKE_BLS12461_H
+
+#include "ecdh_BLS12461.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace BLS12461 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_BLS24479.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_BLS24479.h
new file mode 100644
index 0000000..17ec022
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_BLS24479.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_BLS24479_H
+#define HPKE_BLS24479_H
+
+#include "ecdh_BLS24479.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace BLS24479 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_BLS48286.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_BLS48286.h
new file mode 100644
index 0000000..dc98820
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_BLS48286.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_BLS48286_H
+#define HPKE_BLS48286_H
+
+#include "ecdh_BLS48286.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace BLS48286 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_BLS48556.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_BLS48556.h
new file mode 100644
index 0000000..582c973
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_BLS48556.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_BLS48556_H
+#define HPKE_BLS48556_H
+
+#include "ecdh_BLS48556.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace BLS48556 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_BLS48581.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_BLS48581.h
new file mode 100644
index 0000000..3de857d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_BLS48581.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_BLS48581_H
+#define HPKE_BLS48581_H
+
+#include "ecdh_BLS48581.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace BLS48581 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_BN158.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_BN158.h
new file mode 100644
index 0000000..63594e0
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_BN158.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_BN158_H
+#define HPKE_BN158_H
+
+#include "ecdh_BN158.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace BN158 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_BN254.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_BN254.h
new file mode 100644
index 0000000..df37ad5
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_BN254.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_BN254_H
+#define HPKE_BN254_H
+
+#include "ecdh_BN254.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace BN254 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_BN254CX.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_BN254CX.h
new file mode 100644
index 0000000..7f05bab
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_BN254CX.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_BN254CX_H
+#define HPKE_BN254CX_H
+
+#include "ecdh_BN254CX.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace BN254CX {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_BN462.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_BN462.h
new file mode 100644
index 0000000..c089594
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_BN462.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_BN462_H
+#define HPKE_BN462_H
+
+#include "ecdh_BN462.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace BN462 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_BRAINPOOL.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_BRAINPOOL.h
new file mode 100644
index 0000000..98cb67e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_BRAINPOOL.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_BRAINPOOL_H
+#define HPKE_BRAINPOOL_H
+
+#include "ecdh_BRAINPOOL.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace BRAINPOOL {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_C1174.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_C1174.h
new file mode 100644
index 0000000..2b8deea
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_C1174.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_C1174_H
+#define HPKE_C1174_H
+
+#include "ecdh_C1174.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace C1174 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_C13318.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_C13318.h
new file mode 100644
index 0000000..abeb21d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_C13318.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_C13318_H
+#define HPKE_C13318_H
+
+#include "ecdh_C13318.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace C13318 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_C1665.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_C1665.h
new file mode 100644
index 0000000..7a4a1ce
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_C1665.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_C1665_H
+#define HPKE_C1665_H
+
+#include "ecdh_C1665.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace C1665 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_C25519.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_C25519.h
new file mode 100644
index 0000000..921525a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_C25519.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_C25519_H
+#define HPKE_C25519_H
+
+#include "ecdh_C25519.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace C25519 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_C41417.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_C41417.h
new file mode 100644
index 0000000..8c703e0
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_C41417.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_C41417_H
+#define HPKE_C41417_H
+
+#include "ecdh_C41417.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace C41417 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_Ed25519.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_Ed25519.h
new file mode 100644
index 0000000..d5f32f5
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_Ed25519.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_Ed25519_H
+#define HPKE_Ed25519_H
+
+#include "ecdh_Ed25519.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace Ed25519 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_Ed448.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_Ed448.h
new file mode 100644
index 0000000..ca3df8c
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_Ed448.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_Ed448_H
+#define HPKE_Ed448_H
+
+#include "ecdh_Ed448.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace Ed448 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_FP256BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_FP256BN.h
new file mode 100644
index 0000000..57c15fa
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_FP256BN.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_FP256BN_H
+#define HPKE_FP256BN_H
+
+#include "ecdh_FP256BN.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace FP256BN {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_FP512BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_FP512BN.h
new file mode 100644
index 0000000..cc61f29
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_FP512BN.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_FP512BN_H
+#define HPKE_FP512BN_H
+
+#include "ecdh_FP512BN.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace FP512BN {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_HIFIVE.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_HIFIVE.h
new file mode 100644
index 0000000..ffb422d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_HIFIVE.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_HIFIVE_H
+#define HPKE_HIFIVE_H
+
+#include "ecdh_HIFIVE.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace HIFIVE {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_JUBJUB.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_JUBJUB.h
new file mode 100644
index 0000000..a70d73e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_JUBJUB.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_JUBJUB_H
+#define HPKE_JUBJUB_H
+
+#include "ecdh_JUBJUB.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace JUBJUB {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_MDC.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_MDC.h
new file mode 100644
index 0000000..1efff71
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_MDC.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_MDC_H
+#define HPKE_MDC_H
+
+#include "ecdh_MDC.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace MDC {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_NIST256.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_NIST256.h
new file mode 100644
index 0000000..52b958c
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_NIST256.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_NIST256_H
+#define HPKE_NIST256_H
+
+#include "ecdh_NIST256.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace NIST256 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_NIST384.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_NIST384.h
new file mode 100644
index 0000000..35d738a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_NIST384.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_NIST384_H
+#define HPKE_NIST384_H
+
+#include "ecdh_NIST384.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace NIST384 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_NIST521.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_NIST521.h
new file mode 100644
index 0000000..dd337ef
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_NIST521.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_NIST521_H
+#define HPKE_NIST521_H
+
+#include "ecdh_NIST521.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace NIST521 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_NUMS256E.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_NUMS256E.h
new file mode 100644
index 0000000..5fe75c8
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_NUMS256E.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_NUMS256E_H
+#define HPKE_NUMS256E_H
+
+#include "ecdh_NUMS256E.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace NUMS256E {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_NUMS256W.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_NUMS256W.h
new file mode 100644
index 0000000..f3df68a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_NUMS256W.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_NUMS256W_H
+#define HPKE_NUMS256W_H
+
+#include "ecdh_NUMS256W.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace NUMS256W {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_NUMS384E.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_NUMS384E.h
new file mode 100644
index 0000000..5b7eb9e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_NUMS384E.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_NUMS384E_H
+#define HPKE_NUMS384E_H
+
+#include "ecdh_NUMS384E.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace NUMS384E {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_NUMS384W.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_NUMS384W.h
new file mode 100644
index 0000000..c4de95e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_NUMS384W.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_NUMS384W_H
+#define HPKE_NUMS384W_H
+
+#include "ecdh_NUMS384W.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace NUMS384W {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_NUMS512E.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_NUMS512E.h
new file mode 100644
index 0000000..b193440
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_NUMS512E.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_NUMS512E_H
+#define HPKE_NUMS512E_H
+
+#include "ecdh_NUMS512E.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace NUMS512E {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_NUMS512W.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_NUMS512W.h
new file mode 100644
index 0000000..d70a9aa
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_NUMS512W.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_NUMS512W_H
+#define HPKE_NUMS512W_H
+
+#include "ecdh_NUMS512W.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace NUMS512W {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_SECP160R1.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_SECP160R1.h
new file mode 100644
index 0000000..521a895
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_SECP160R1.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_SECP160R1_H
+#define HPKE_SECP160R1_H
+
+#include "ecdh_SECP160R1.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace SECP160R1 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_SECP256K1.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_SECP256K1.h
new file mode 100644
index 0000000..9d85466
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_SECP256K1.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_SECP256K1_H
+#define HPKE_SECP256K1_H
+
+#include "ecdh_SECP256K1.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace SECP256K1 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_SM2.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_SM2.h
new file mode 100644
index 0000000..7237e51
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_SM2.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_SM2_H
+#define HPKE_SM2_H
+
+#include "ecdh_SM2.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace SM2 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_TWEEDLEDEE.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_TWEEDLEDEE.h
new file mode 100644
index 0000000..dbaa1e8
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_TWEEDLEDEE.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_TWEEDLEDEE_H
+#define HPKE_TWEEDLEDEE_H
+
+#include "ecdh_TWEEDLEDEE.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace TWEEDLEDEE {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_TWEEDLEDUM.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_TWEEDLEDUM.h
new file mode 100644
index 0000000..b9f8b40
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_TWEEDLEDUM.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_TWEEDLEDUM_H
+#define HPKE_TWEEDLEDUM_H
+
+#include "ecdh_TWEEDLEDUM.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace TWEEDLEDUM {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_X448.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_X448.h
new file mode 100644
index 0000000..05a934c
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/hpke_X448.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_X448_H
+#define HPKE_X448_H
+
+#include "ecdh_X448.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace X448 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/kyber.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/kyber.h
new file mode 100644
index 0000000..08da3b8
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/kyber.h
@@ -0,0 +1,139 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* Kyber API */
+
+#ifndef KYBER_H
+#define KYBER_H
+
+#include "core.h"
+
+//q= 3329
+#define KY_LGN 8
+#define KY_DEGREE (1 << KY_LGN)
+#define KY_PRIME 0xD01
+
+#define KY_ONE 0x549		// R mod Q
+#define KY_QINV 62209   // q^(-1) mod 2^16
+
+#define KYBER_SECRET_CPA_SIZE_512 (2*(KY_DEGREE*3)/2)
+#define KYBER_PUBLIC_SIZE_512 (32+2*(KY_DEGREE*3)/2)
+#define KYBER_CIPHERTEXT_SIZE_512  ((10*2+4)*KY_DEGREE/8)
+#define KYBER_SECRET_CCA_SIZE_512 (KYBER_SECRET_CPA_SIZE_512+KYBER_PUBLIC_SIZE_512+64)
+#define KYBER_SHARED_SECRET_512 32
+
+#define KYBER_SECRET_CPA_SIZE_768 (3*(KY_DEGREE*3)/2)
+#define KYBER_PUBLIC_SIZE_768 (32+3*(KY_DEGREE*3)/2)
+#define KYBER_CIPHERTEXT_SIZE_768  ((10*3+4)*KY_DEGREE/8)
+#define KYBER_SECRET_CCA_SIZE_768 (KYBER_SECRET_CPA_SIZE_768+KYBER_PUBLIC_SIZE_768+64)
+#define KYBER_SHARED_SECRET_768 32
+
+#define KYBER_SECRET_CPA_SIZE_1024 (4*(KY_DEGREE*3)/2)
+#define KYBER_PUBLIC_SIZE_1024 (32+4*(KY_DEGREE*3)/2)
+#define KYBER_CIPHERTEXT_SIZE_1024  ((11*4+5)*KY_DEGREE/8)
+#define KYBER_SECRET_CCA_SIZE_1024 (KYBER_SECRET_CPA_SIZE_1024+KYBER_PUBLIC_SIZE_1024+64)
+#define KYBER_SHARED_SECRET_1024 32
+
+#define KY_MAXK 4
+
+namespace core {
+
+/** @brief Kyber KEM CCA key pair generation
+ *
+    @param r64 64 random bytes
+    @param SK secret key
+    @param PK public key
+
+ */
+extern void KYBER512_keypair(byte *r64,octet *SK,octet *PK);
+
+/** @brief Kyber KEM CCA encrypt
+ *
+    @param r32 32 random bytes
+    @param PK public key
+	@param SS random session key generated
+	@param CT ciphertext
+
+ */
+extern void KYBER512_encrypt(byte *r32,octet *PK,octet *SS,octet *CT);
+
+/** @brief Kyber KEM CCA decrypt
+ *
+    @param SK secret key
+	@param CT ciphertext
+	@param SS output session key 
+ */
+extern void KYBER512_decrypt(octet *SK,octet *CT,octet *SS);
+
+/** @brief Kyber KEM CCA key pair generation
+ *
+    @param r64 64 random bytes
+    @param SK secret key
+    @param PK public key
+
+ */
+extern void KYBER768_keypair(byte *r64,octet *SK,octet *PK);
+
+/** @brief Kyber KEM CCA encrypt
+ *
+    @param r32 32 random bytes
+    @param PK public key
+	@param SS random session key generated
+	@param CT ciphertext
+
+ */
+extern void KYBER768_encrypt(byte *r32,octet *PK,octet *SS,octet *CT);
+
+/** @brief Kyber KEM CCA decrypt
+ *
+    @param SK secret key
+	@param CT ciphertext
+	@param SS output session key 
+ */
+extern void KYBER768_decrypt(octet *SK,octet *CT,octet *SS);
+
+/** @brief Kyber KEM CCA key pair generation
+ *
+    @param r64 64 random bytes
+    @param SK secret key
+    @param PK public key
+
+ */
+extern void KYBER1024_keypair(byte *r64,octet *SK,octet *PK);
+
+/** @brief Kyber KEM CCA encrypt
+ *
+    @param r32 32 random bytes
+    @param PK public key
+	@param SS random session key generated
+	@param CT ciphertext
+
+ */
+extern void KYBER1024_encrypt(byte *r32,octet *PK,octet *SS,octet *CT);
+
+/** @brief Kyber KEM CCA decrypt
+ *
+    @param SK secret key
+	@param CT ciphertext
+	@param SS output session key 
+ */
+extern void KYBER1024_decrypt(octet *SK,octet *CT,octet *SS);
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/mpin.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/mpin.h
new file mode 100644
index 0000000..2ed645d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/mpin.h
@@ -0,0 +1,136 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file mpin.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief M-Pin Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef MPIN_ZZZ_H
+#define MPIN_ZZZ_H
+
+#include "pair_ZZZ.h"
+//#include "pbc_support.h"
+
+using namespace core;
+
+
+namespace ZZZ {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define PGS_ZZZ MODBYTES_XXX  /**< MPIN Group Size */
+#define PFS_ZZZ MODBYTES_XXX  /**< MPIN Field Size */
+
+#define MPIN_OK             0   /**< Function completed without error */
+#define MPIN_INVALID_POINT  -14	/**< Point is NOT on the curve */
+#define MPIN_BAD_PIN        -19 /**< Bad PIN number entered */
+
+#define MAXPIN 10000         /**< max PIN */
+#define PBLEN 14             /**< max length of PIN in bits */
+
+//#define PAS_ZZZ 16        /**< MPIN Symmetric Key Size 128 bits */
+//#define HASH_TYPE_MPIN_ZZZ SHA256   /**< Choose Hash function */
+
+/* MPIN support functions */
+
+/* MPIN primitives */
+
+/**	@brief Encode a string to a curve point (in constant time)
+ *
+	@param DST is the Domain Separation Tag
+    @param ID is the input string
+    @param HID is the output point in G1
+*/
+void MPIN_ENCODE_TO_CURVE(octet *DST,octet *ID,octet *HID);
+
+/**	@brief Extract a PIN number from a client secret
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param pin is an input PIN number
+	@param CS is the client secret from which the PIN is to be extracted
+	@return 0 or an error code
+ */
+int MPIN_EXTRACT_PIN(octet *HID, int pin, octet *CS);
+
+/**	@brief Perform first pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param R is a pointer to a cryptographically secure random number generator
+	@param x an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param pin is the input PIN number
+	@param T is the input M-Pin token (the client secret with PIN portion removed)
+	@param S is the reconstructed client secret
+	@param U is output = x.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_1(octet *HID, csprng *R, octet *x, int pin, octet *T, octet *S, octet *U);
+/**	@brief Generate a random group element
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param S is the output random octet
+	@return 0 or an error code
+ */
+int MPIN_RANDOM_GENERATE(csprng *R, octet *S);
+/**	@brief Perform second pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param x an input, a locally generated random number
+	@param y an input random challenge from the server
+	@param V on output = -(x+y).V
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_2(octet *x, octet *y, octet *V);
+
+/**	@brief Perform final pass on the server side of the M-Pin protocol
+
+	@param HID is input H(ID), a hash of the client ID
+	@param y is the input server's randomly generated challenge
+	@param SS is the input server secret
+	@param U is input from the client = x.H(ID)
+	@param V is an input from the client
+	@return 0 or an error code
+ */
+int MPIN_SERVER(octet *HID, octet *y, octet *SS, octet *U, octet *V);
+
+/**	@brief Create a client secret in G1 from a master secret and the client ID
+ *
+	@param S is an input master secret
+	@param HID is the input client identity hashed to curve
+	@param CS is the full client secret = s.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_GET_CLIENT_SECRET(octet *S, octet *HID, octet *CS);
+
+/**	@brief Create a server secret in G2 from a master secret
+ *
+	@param S is an input master secret
+	@param SS is the server secret = s.Q where Q is a fixed generator of G2
+	@return 0 or an error code
+ */
+int MPIN_GET_SERVER_SECRET(octet *S, octet *SS);
+}
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/mpin192.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/mpin192.h
new file mode 100644
index 0000000..6aac781
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/mpin192.h
@@ -0,0 +1,136 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file mpin.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief M-Pin Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef MPIN_ZZZ_H
+#define MPIN_ZZZ_H
+
+#include "pair4_ZZZ.h"
+//#include "pbc_support.h"
+
+using namespace core;
+
+
+namespace ZZZ {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define PGS_ZZZ MODBYTES_XXX  /**< MPIN Group Size */
+#define PFS_ZZZ MODBYTES_XXX  /**< MPIN Field Size */
+
+#define MPIN_OK             0   /**< Function completed without error */
+#define MPIN_INVALID_POINT  -14	/**< Point is NOT on the curve */
+#define MPIN_BAD_PIN        -19 /**< Bad PIN number entered */
+
+#define MAXPIN 10000         /**< max PIN */
+#define PBLEN 14             /**< max length of PIN in bits */
+
+//#define PAS_ZZZ 24        /**< MPIN Symmetric Key Size 192 bits  */
+//#define HASH_TYPE_MPIN_ZZZ SHA384   /**< Choose Hash function */
+
+/* MPIN support functions */
+
+/* MPIN primitives */
+
+/**	@brief Encode a string to a curve point (in constant time)
+ *
+	@param DST is the Domain Separation Tag
+    @param ID is the input string
+    @param HID is the output point in G1
+*/
+void MPIN_ENCODE_TO_CURVE(octet *DST,octet *ID,octet *HID);
+
+/**	@brief Extract a PIN number from a client secret
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param pin is an input PIN number
+	@param CS is the client secret from which the PIN is to be extracted
+	@return 0 or an error code
+ */
+int MPIN_EXTRACT_PIN(octet *HID, int pin, octet *CS);
+
+/**	@brief Perform first pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param R is a pointer to a cryptographically secure random number generator
+	@param x an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param pin is the input PIN number
+	@param T is the input M-Pin token (the client secret with PIN portion removed)
+	@param S is the reconstructed client secret
+	@param U is output = x.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_1(octet *HID, csprng *R, octet *x, int pin, octet *T, octet *S, octet *U);
+/**	@brief Generate a random group element
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param S is the output random octet
+	@return 0 or an error code
+ */
+int MPIN_RANDOM_GENERATE(csprng *R, octet *S);
+/**	@brief Perform second pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param x an input, a locally generated random number
+	@param y an input random challenge from the server
+	@param V on output = -(x+y).V
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_2(octet *x, octet *y, octet *V);
+
+/**	@brief Perform third pass on the server side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is input H(ID), a hash of the client ID
+	@param y is the input server's randomly generated challenge
+	@param SS is the input server secret
+	@param U is input from the client = x.H(ID)
+	@param V is an input from the client
+	@return 0 or an error code
+ */
+int MPIN_SERVER(octet *HID, octet *y, octet *SS, octet *U, octet *V);
+
+/**	@brief Create a client secret in G1 from a master secret and the client ID
+ *
+	@param S is an input master secret
+	@param HID is the input client identity hashed to point
+	@param CS is the full client secret = s.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_GET_CLIENT_SECRET(octet *S, octet *HID, octet *CS);
+
+/**	@brief Create a server secret in G2 from a master secret
+ *
+	@param S is an input master secret
+	@param SS is the server secret = s.Q where Q is a fixed generator of G2
+	@return 0 or an error code
+ */
+int MPIN_GET_SERVER_SECRET(octet *S, octet *SS);
+}
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/mpin192_BLS24479.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/mpin192_BLS24479.h
new file mode 100644
index 0000000..8201b3a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/mpin192_BLS24479.h
@@ -0,0 +1,136 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file mpin.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief M-Pin Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef MPIN_BLS24479_H
+#define MPIN_BLS24479_H
+
+#include "pair4_BLS24479.h"
+//#include "pbc_support.h"
+
+using namespace core;
+
+
+namespace BLS24479 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define PGS_BLS24479 MODBYTES_B480_56  /**< MPIN Group Size */
+#define PFS_BLS24479 MODBYTES_B480_56  /**< MPIN Field Size */
+
+#define MPIN_OK             0   /**< Function completed without error */
+#define MPIN_INVALID_POINT  -14	/**< Point is NOT on the curve */
+#define MPIN_BAD_PIN        -19 /**< Bad PIN number entered */
+
+#define MAXPIN 10000         /**< max PIN */
+#define PBLEN 14             /**< max length of PIN in bits */
+
+//#define PAS_BLS24479 24        /**< MPIN Symmetric Key Size 192 bits  */
+//#define HASH_TYPE_MPIN_BLS24479 SHA384   /**< Choose Hash function */
+
+/* MPIN support functions */
+
+/* MPIN primitives */
+
+/**	@brief Encode a string to a curve point (in constant time)
+ *
+	@param DST is the Domain Separation Tag
+    @param ID is the input string
+    @param HID is the output point in G1
+*/
+void MPIN_ENCODE_TO_CURVE(octet *DST,octet *ID,octet *HID);
+
+/**	@brief Extract a PIN number from a client secret
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param pin is an input PIN number
+	@param CS is the client secret from which the PIN is to be extracted
+	@return 0 or an error code
+ */
+int MPIN_EXTRACT_PIN(octet *HID, int pin, octet *CS);
+
+/**	@brief Perform first pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param R is a pointer to a cryptographically secure random number generator
+	@param x an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param pin is the input PIN number
+	@param T is the input M-Pin token (the client secret with PIN portion removed)
+	@param S is the reconstructed client secret
+	@param U is output = x.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_1(octet *HID, csprng *R, octet *x, int pin, octet *T, octet *S, octet *U);
+/**	@brief Generate a random group element
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param S is the output random octet
+	@return 0 or an error code
+ */
+int MPIN_RANDOM_GENERATE(csprng *R, octet *S);
+/**	@brief Perform second pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param x an input, a locally generated random number
+	@param y an input random challenge from the server
+	@param V on output = -(x+y).V
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_2(octet *x, octet *y, octet *V);
+
+/**	@brief Perform third pass on the server side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is input H(ID), a hash of the client ID
+	@param y is the input server's randomly generated challenge
+	@param SS is the input server secret
+	@param U is input from the client = x.H(ID)
+	@param V is an input from the client
+	@return 0 or an error code
+ */
+int MPIN_SERVER(octet *HID, octet *y, octet *SS, octet *U, octet *V);
+
+/**	@brief Create a client secret in G1 from a master secret and the client ID
+ *
+	@param S is an input master secret
+	@param HID is the input client identity hashed to point
+	@param CS is the full client secret = s.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_GET_CLIENT_SECRET(octet *S, octet *HID, octet *CS);
+
+/**	@brief Create a server secret in G2 from a master secret
+ *
+	@param S is an input master secret
+	@param SS is the server secret = s.Q where Q is a fixed generator of G2
+	@return 0 or an error code
+ */
+int MPIN_GET_SERVER_SECRET(octet *S, octet *SS);
+}
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/mpin256.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/mpin256.h
new file mode 100644
index 0000000..0dfbbbb
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/mpin256.h
@@ -0,0 +1,133 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file mpin.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief M-Pin Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef MPIN_ZZZ_H
+#define MPIN_ZZZ_H
+
+#include "pair8_ZZZ.h"
+//#include "pbc_support.h"
+
+using namespace core;
+
+
+namespace ZZZ {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define PGS_ZZZ MODBYTES_XXX  /**< MPIN Group Size */
+#define PFS_ZZZ MODBYTES_XXX  /**< MPIN Field Size */
+
+#define MPIN_OK             0   /**< Function completed without error */
+#define MPIN_INVALID_POINT  -14	/**< Point is NOT on the curve */
+#define MPIN_BAD_PIN        -19 /**< Bad PIN number entered */
+
+#define MAXPIN 10000         /**< max PIN */
+#define PBLEN 14             /**< max length of PIN in bits */
+
+//#define PAS_ZZZ 24        /**< MPIN Symmetric Key Size 192 bits  */
+//#define HASH_TYPE_MPIN_ZZZ SHA384   /**< Choose Hash function */
+
+/* MPIN support functions */
+/* MPIN primitives */
+
+/**	@brief Encode a string to a curve point (in constant time)
+ *
+	@param DST is the Domain Separation Tag
+    @param ID is the input string
+    @param HCID is the output point in G1
+*/
+void MPIN_ENCODE_TO_CURVE(octet *DST,octet *ID,octet *HCID);
+
+/**	@brief Extract a PIN number from a client secret
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param pin is an input PIN number
+	@param CS is the client secret from which the PIN is to be extracted
+	@return 0 or an error code
+ */
+int MPIN_EXTRACT_PIN(octet *HID, int pin, octet *CS);
+
+/**	@brief Perform first pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param R is a pointer to a cryptographically secure random number generator
+	@param x an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param pin is the input PIN number
+	@param T is the input M-Pin token (the client secret with PIN portion removed)
+	@param S is output = CS+TP, where CS=is the reconstructed client secret, and TP is the time permit
+	@param U is output = x.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_1(octet *HID, csprng *R, octet *x, int pin, octet *T, octet *S, octet *U);
+/**	@brief Generate a random group element
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param S is the output random octet
+	@return 0 or an error code
+ */
+int MPIN_RANDOM_GENERATE(csprng *R, octet *S);
+/**	@brief Perform second pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param x an input, a locally generated random number
+	@param y an input random challenge from the server
+	@param V on output = -(x+y).V
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_2(octet *x, octet *y, octet *V);
+/**	@brief Perform third pass on the server side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is input H(ID), a hash of the client ID
+	@param y is the input server's randomly generated challenge
+	@param SS is the input server secret
+	@param U is input from the client = x.H(ID)
+	@param V is an input from the client
+	@return 0 or an error code
+ */
+int MPIN_SERVER(octet *HID, octet *y, octet *SS, octet *U, octet *V);
+/**	@brief Create a client secret in G1 from a master secret and the client ID
+ *
+	@param S is an input master secret
+	@param HID is the input client identity hashed to point
+	@param CS is the full client secret = s.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_GET_CLIENT_SECRET(octet *S, octet *HID, octet *CS);
+
+/**	@brief Create a server secret in G2 from a master secret
+ *
+	@param S is an input master secret
+	@param SS is the server secret = s.Q where Q is a fixed generator of G2
+	@return 0 or an error code
+ */
+int MPIN_GET_SERVER_SECRET(octet *S, octet *SS);
+}
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/mpin256_BLS48286.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/mpin256_BLS48286.h
new file mode 100644
index 0000000..7a860fb
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/mpin256_BLS48286.h
@@ -0,0 +1,133 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file mpin.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief M-Pin Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef MPIN_BLS48286_H
+#define MPIN_BLS48286_H
+
+#include "pair8_BLS48286.h"
+//#include "pbc_support.h"
+
+using namespace core;
+
+
+namespace BLS48286 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define PGS_BLS48286 MODBYTES_B288_60  /**< MPIN Group Size */
+#define PFS_BLS48286 MODBYTES_B288_60  /**< MPIN Field Size */
+
+#define MPIN_OK             0   /**< Function completed without error */
+#define MPIN_INVALID_POINT  -14	/**< Point is NOT on the curve */
+#define MPIN_BAD_PIN        -19 /**< Bad PIN number entered */
+
+#define MAXPIN 10000         /**< max PIN */
+#define PBLEN 14             /**< max length of PIN in bits */
+
+//#define PAS_BLS48286 24        /**< MPIN Symmetric Key Size 192 bits  */
+//#define HASH_TYPE_MPIN_BLS48286 SHA384   /**< Choose Hash function */
+
+/* MPIN support functions */
+/* MPIN primitives */
+
+/**	@brief Encode a string to a curve point (in constant time)
+ *
+	@param DST is the Domain Separation Tag
+    @param ID is the input string
+    @param HCID is the output point in G1
+*/
+void MPIN_ENCODE_TO_CURVE(octet *DST,octet *ID,octet *HCID);
+
+/**	@brief Extract a PIN number from a client secret
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param pin is an input PIN number
+	@param CS is the client secret from which the PIN is to be extracted
+	@return 0 or an error code
+ */
+int MPIN_EXTRACT_PIN(octet *HID, int pin, octet *CS);
+
+/**	@brief Perform first pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param R is a pointer to a cryptographically secure random number generator
+	@param x an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param pin is the input PIN number
+	@param T is the input M-Pin token (the client secret with PIN portion removed)
+	@param S is output = CS+TP, where CS=is the reconstructed client secret, and TP is the time permit
+	@param U is output = x.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_1(octet *HID, csprng *R, octet *x, int pin, octet *T, octet *S, octet *U);
+/**	@brief Generate a random group element
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param S is the output random octet
+	@return 0 or an error code
+ */
+int MPIN_RANDOM_GENERATE(csprng *R, octet *S);
+/**	@brief Perform second pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param x an input, a locally generated random number
+	@param y an input random challenge from the server
+	@param V on output = -(x+y).V
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_2(octet *x, octet *y, octet *V);
+/**	@brief Perform third pass on the server side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is input H(ID), a hash of the client ID
+	@param y is the input server's randomly generated challenge
+	@param SS is the input server secret
+	@param U is input from the client = x.H(ID)
+	@param V is an input from the client
+	@return 0 or an error code
+ */
+int MPIN_SERVER(octet *HID, octet *y, octet *SS, octet *U, octet *V);
+/**	@brief Create a client secret in G1 from a master secret and the client ID
+ *
+	@param S is an input master secret
+	@param HID is the input client identity hashed to point
+	@param CS is the full client secret = s.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_GET_CLIENT_SECRET(octet *S, octet *HID, octet *CS);
+
+/**	@brief Create a server secret in G2 from a master secret
+ *
+	@param S is an input master secret
+	@param SS is the server secret = s.Q where Q is a fixed generator of G2
+	@return 0 or an error code
+ */
+int MPIN_GET_SERVER_SECRET(octet *S, octet *SS);
+}
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/mpin256_BLS48556.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/mpin256_BLS48556.h
new file mode 100644
index 0000000..90c88aa
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/mpin256_BLS48556.h
@@ -0,0 +1,133 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file mpin.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief M-Pin Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef MPIN_BLS48556_H
+#define MPIN_BLS48556_H
+
+#include "pair8_BLS48556.h"
+//#include "pbc_support.h"
+
+using namespace core;
+
+
+namespace BLS48556 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define PGS_BLS48556 MODBYTES_B560_58  /**< MPIN Group Size */
+#define PFS_BLS48556 MODBYTES_B560_58  /**< MPIN Field Size */
+
+#define MPIN_OK             0   /**< Function completed without error */
+#define MPIN_INVALID_POINT  -14	/**< Point is NOT on the curve */
+#define MPIN_BAD_PIN        -19 /**< Bad PIN number entered */
+
+#define MAXPIN 10000         /**< max PIN */
+#define PBLEN 14             /**< max length of PIN in bits */
+
+//#define PAS_BLS48556 24        /**< MPIN Symmetric Key Size 192 bits  */
+//#define HASH_TYPE_MPIN_BLS48556 SHA384   /**< Choose Hash function */
+
+/* MPIN support functions */
+/* MPIN primitives */
+
+/**	@brief Encode a string to a curve point (in constant time)
+ *
+	@param DST is the Domain Separation Tag
+    @param ID is the input string
+    @param HCID is the output point in G1
+*/
+void MPIN_ENCODE_TO_CURVE(octet *DST,octet *ID,octet *HCID);
+
+/**	@brief Extract a PIN number from a client secret
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param pin is an input PIN number
+	@param CS is the client secret from which the PIN is to be extracted
+	@return 0 or an error code
+ */
+int MPIN_EXTRACT_PIN(octet *HID, int pin, octet *CS);
+
+/**	@brief Perform first pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param R is a pointer to a cryptographically secure random number generator
+	@param x an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param pin is the input PIN number
+	@param T is the input M-Pin token (the client secret with PIN portion removed)
+	@param S is output = CS+TP, where CS=is the reconstructed client secret, and TP is the time permit
+	@param U is output = x.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_1(octet *HID, csprng *R, octet *x, int pin, octet *T, octet *S, octet *U);
+/**	@brief Generate a random group element
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param S is the output random octet
+	@return 0 or an error code
+ */
+int MPIN_RANDOM_GENERATE(csprng *R, octet *S);
+/**	@brief Perform second pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param x an input, a locally generated random number
+	@param y an input random challenge from the server
+	@param V on output = -(x+y).V
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_2(octet *x, octet *y, octet *V);
+/**	@brief Perform third pass on the server side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is input H(ID), a hash of the client ID
+	@param y is the input server's randomly generated challenge
+	@param SS is the input server secret
+	@param U is input from the client = x.H(ID)
+	@param V is an input from the client
+	@return 0 or an error code
+ */
+int MPIN_SERVER(octet *HID, octet *y, octet *SS, octet *U, octet *V);
+/**	@brief Create a client secret in G1 from a master secret and the client ID
+ *
+	@param S is an input master secret
+	@param HID is the input client identity hashed to point
+	@param CS is the full client secret = s.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_GET_CLIENT_SECRET(octet *S, octet *HID, octet *CS);
+
+/**	@brief Create a server secret in G2 from a master secret
+ *
+	@param S is an input master secret
+	@param SS is the server secret = s.Q where Q is a fixed generator of G2
+	@return 0 or an error code
+ */
+int MPIN_GET_SERVER_SECRET(octet *S, octet *SS);
+}
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/mpin256_BLS48581.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/mpin256_BLS48581.h
new file mode 100644
index 0000000..c78b696
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/mpin256_BLS48581.h
@@ -0,0 +1,133 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file mpin.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief M-Pin Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef MPIN_BLS48581_H
+#define MPIN_BLS48581_H
+
+#include "pair8_BLS48581.h"
+//#include "pbc_support.h"
+
+using namespace core;
+
+
+namespace BLS48581 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define PGS_BLS48581 MODBYTES_B584_60  /**< MPIN Group Size */
+#define PFS_BLS48581 MODBYTES_B584_60  /**< MPIN Field Size */
+
+#define MPIN_OK             0   /**< Function completed without error */
+#define MPIN_INVALID_POINT  -14	/**< Point is NOT on the curve */
+#define MPIN_BAD_PIN        -19 /**< Bad PIN number entered */
+
+#define MAXPIN 10000         /**< max PIN */
+#define PBLEN 14             /**< max length of PIN in bits */
+
+//#define PAS_BLS48581 24        /**< MPIN Symmetric Key Size 192 bits  */
+//#define HASH_TYPE_MPIN_BLS48581 SHA384   /**< Choose Hash function */
+
+/* MPIN support functions */
+/* MPIN primitives */
+
+/**	@brief Encode a string to a curve point (in constant time)
+ *
+	@param DST is the Domain Separation Tag
+    @param ID is the input string
+    @param HCID is the output point in G1
+*/
+void MPIN_ENCODE_TO_CURVE(octet *DST,octet *ID,octet *HCID);
+
+/**	@brief Extract a PIN number from a client secret
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param pin is an input PIN number
+	@param CS is the client secret from which the PIN is to be extracted
+	@return 0 or an error code
+ */
+int MPIN_EXTRACT_PIN(octet *HID, int pin, octet *CS);
+
+/**	@brief Perform first pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param R is a pointer to a cryptographically secure random number generator
+	@param x an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param pin is the input PIN number
+	@param T is the input M-Pin token (the client secret with PIN portion removed)
+	@param S is output = CS+TP, where CS=is the reconstructed client secret, and TP is the time permit
+	@param U is output = x.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_1(octet *HID, csprng *R, octet *x, int pin, octet *T, octet *S, octet *U);
+/**	@brief Generate a random group element
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param S is the output random octet
+	@return 0 or an error code
+ */
+int MPIN_RANDOM_GENERATE(csprng *R, octet *S);
+/**	@brief Perform second pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param x an input, a locally generated random number
+	@param y an input random challenge from the server
+	@param V on output = -(x+y).V
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_2(octet *x, octet *y, octet *V);
+/**	@brief Perform third pass on the server side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is input H(ID), a hash of the client ID
+	@param y is the input server's randomly generated challenge
+	@param SS is the input server secret
+	@param U is input from the client = x.H(ID)
+	@param V is an input from the client
+	@return 0 or an error code
+ */
+int MPIN_SERVER(octet *HID, octet *y, octet *SS, octet *U, octet *V);
+/**	@brief Create a client secret in G1 from a master secret and the client ID
+ *
+	@param S is an input master secret
+	@param HID is the input client identity hashed to point
+	@param CS is the full client secret = s.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_GET_CLIENT_SECRET(octet *S, octet *HID, octet *CS);
+
+/**	@brief Create a server secret in G2 from a master secret
+ *
+	@param S is an input master secret
+	@param SS is the server secret = s.Q where Q is a fixed generator of G2
+	@return 0 or an error code
+ */
+int MPIN_GET_SERVER_SECRET(octet *S, octet *SS);
+}
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/mpin_BLS12381.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/mpin_BLS12381.h
new file mode 100644
index 0000000..600637e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/mpin_BLS12381.h
@@ -0,0 +1,136 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file mpin.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief M-Pin Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef MPIN_BLS12381_H
+#define MPIN_BLS12381_H
+
+#include "pair_BLS12381.h"
+//#include "pbc_support.h"
+
+using namespace core;
+
+
+namespace BLS12381 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define PGS_BLS12381 MODBYTES_B384_58  /**< MPIN Group Size */
+#define PFS_BLS12381 MODBYTES_B384_58  /**< MPIN Field Size */
+
+#define MPIN_OK             0   /**< Function completed without error */
+#define MPIN_INVALID_POINT  -14	/**< Point is NOT on the curve */
+#define MPIN_BAD_PIN        -19 /**< Bad PIN number entered */
+
+#define MAXPIN 10000         /**< max PIN */
+#define PBLEN 14             /**< max length of PIN in bits */
+
+//#define PAS_BLS12381 16        /**< MPIN Symmetric Key Size 128 bits */
+//#define HASH_TYPE_MPIN_BLS12381 SHA256   /**< Choose Hash function */
+
+/* MPIN support functions */
+
+/* MPIN primitives */
+
+/**	@brief Encode a string to a curve point (in constant time)
+ *
+	@param DST is the Domain Separation Tag
+    @param ID is the input string
+    @param HID is the output point in G1
+*/
+void MPIN_ENCODE_TO_CURVE(octet *DST,octet *ID,octet *HID);
+
+/**	@brief Extract a PIN number from a client secret
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param pin is an input PIN number
+	@param CS is the client secret from which the PIN is to be extracted
+	@return 0 or an error code
+ */
+int MPIN_EXTRACT_PIN(octet *HID, int pin, octet *CS);
+
+/**	@brief Perform first pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param R is a pointer to a cryptographically secure random number generator
+	@param x an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param pin is the input PIN number
+	@param T is the input M-Pin token (the client secret with PIN portion removed)
+	@param S is the reconstructed client secret
+	@param U is output = x.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_1(octet *HID, csprng *R, octet *x, int pin, octet *T, octet *S, octet *U);
+/**	@brief Generate a random group element
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param S is the output random octet
+	@return 0 or an error code
+ */
+int MPIN_RANDOM_GENERATE(csprng *R, octet *S);
+/**	@brief Perform second pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param x an input, a locally generated random number
+	@param y an input random challenge from the server
+	@param V on output = -(x+y).V
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_2(octet *x, octet *y, octet *V);
+
+/**	@brief Perform final pass on the server side of the M-Pin protocol
+
+	@param HID is input H(ID), a hash of the client ID
+	@param y is the input server's randomly generated challenge
+	@param SS is the input server secret
+	@param U is input from the client = x.H(ID)
+	@param V is an input from the client
+	@return 0 or an error code
+ */
+int MPIN_SERVER(octet *HID, octet *y, octet *SS, octet *U, octet *V);
+
+/**	@brief Create a client secret in G1 from a master secret and the client ID
+ *
+	@param S is an input master secret
+	@param HID is the input client identity hashed to curve
+	@param CS is the full client secret = s.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_GET_CLIENT_SECRET(octet *S, octet *HID, octet *CS);
+
+/**	@brief Create a server secret in G2 from a master secret
+ *
+	@param S is an input master secret
+	@param SS is the server secret = s.Q where Q is a fixed generator of G2
+	@return 0 or an error code
+ */
+int MPIN_GET_SERVER_SECRET(octet *S, octet *SS);
+}
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/mpin_BLS12383.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/mpin_BLS12383.h
new file mode 100644
index 0000000..4cd8dfe
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/mpin_BLS12383.h
@@ -0,0 +1,136 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file mpin.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief M-Pin Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef MPIN_BLS12383_H
+#define MPIN_BLS12383_H
+
+#include "pair_BLS12383.h"
+//#include "pbc_support.h"
+
+using namespace core;
+
+
+namespace BLS12383 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define PGS_BLS12383 MODBYTES_B384_58  /**< MPIN Group Size */
+#define PFS_BLS12383 MODBYTES_B384_58  /**< MPIN Field Size */
+
+#define MPIN_OK             0   /**< Function completed without error */
+#define MPIN_INVALID_POINT  -14	/**< Point is NOT on the curve */
+#define MPIN_BAD_PIN        -19 /**< Bad PIN number entered */
+
+#define MAXPIN 10000         /**< max PIN */
+#define PBLEN 14             /**< max length of PIN in bits */
+
+//#define PAS_BLS12383 16        /**< MPIN Symmetric Key Size 128 bits */
+//#define HASH_TYPE_MPIN_BLS12383 SHA256   /**< Choose Hash function */
+
+/* MPIN support functions */
+
+/* MPIN primitives */
+
+/**	@brief Encode a string to a curve point (in constant time)
+ *
+	@param DST is the Domain Separation Tag
+    @param ID is the input string
+    @param HID is the output point in G1
+*/
+void MPIN_ENCODE_TO_CURVE(octet *DST,octet *ID,octet *HID);
+
+/**	@brief Extract a PIN number from a client secret
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param pin is an input PIN number
+	@param CS is the client secret from which the PIN is to be extracted
+	@return 0 or an error code
+ */
+int MPIN_EXTRACT_PIN(octet *HID, int pin, octet *CS);
+
+/**	@brief Perform first pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param R is a pointer to a cryptographically secure random number generator
+	@param x an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param pin is the input PIN number
+	@param T is the input M-Pin token (the client secret with PIN portion removed)
+	@param S is the reconstructed client secret
+	@param U is output = x.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_1(octet *HID, csprng *R, octet *x, int pin, octet *T, octet *S, octet *U);
+/**	@brief Generate a random group element
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param S is the output random octet
+	@return 0 or an error code
+ */
+int MPIN_RANDOM_GENERATE(csprng *R, octet *S);
+/**	@brief Perform second pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param x an input, a locally generated random number
+	@param y an input random challenge from the server
+	@param V on output = -(x+y).V
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_2(octet *x, octet *y, octet *V);
+
+/**	@brief Perform final pass on the server side of the M-Pin protocol
+
+	@param HID is input H(ID), a hash of the client ID
+	@param y is the input server's randomly generated challenge
+	@param SS is the input server secret
+	@param U is input from the client = x.H(ID)
+	@param V is an input from the client
+	@return 0 or an error code
+ */
+int MPIN_SERVER(octet *HID, octet *y, octet *SS, octet *U, octet *V);
+
+/**	@brief Create a client secret in G1 from a master secret and the client ID
+ *
+	@param S is an input master secret
+	@param HID is the input client identity hashed to curve
+	@param CS is the full client secret = s.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_GET_CLIENT_SECRET(octet *S, octet *HID, octet *CS);
+
+/**	@brief Create a server secret in G2 from a master secret
+ *
+	@param S is an input master secret
+	@param SS is the server secret = s.Q where Q is a fixed generator of G2
+	@return 0 or an error code
+ */
+int MPIN_GET_SERVER_SECRET(octet *S, octet *SS);
+}
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/mpin_BLS12443.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/mpin_BLS12443.h
new file mode 100644
index 0000000..38626f1
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/mpin_BLS12443.h
@@ -0,0 +1,136 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file mpin.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief M-Pin Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef MPIN_BLS12443_H
+#define MPIN_BLS12443_H
+
+#include "pair_BLS12443.h"
+//#include "pbc_support.h"
+
+using namespace core;
+
+
+namespace BLS12443 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define PGS_BLS12443 MODBYTES_B448_60  /**< MPIN Group Size */
+#define PFS_BLS12443 MODBYTES_B448_60  /**< MPIN Field Size */
+
+#define MPIN_OK             0   /**< Function completed without error */
+#define MPIN_INVALID_POINT  -14	/**< Point is NOT on the curve */
+#define MPIN_BAD_PIN        -19 /**< Bad PIN number entered */
+
+#define MAXPIN 10000         /**< max PIN */
+#define PBLEN 14             /**< max length of PIN in bits */
+
+//#define PAS_BLS12443 16        /**< MPIN Symmetric Key Size 128 bits */
+//#define HASH_TYPE_MPIN_BLS12443 SHA256   /**< Choose Hash function */
+
+/* MPIN support functions */
+
+/* MPIN primitives */
+
+/**	@brief Encode a string to a curve point (in constant time)
+ *
+	@param DST is the Domain Separation Tag
+    @param ID is the input string
+    @param HID is the output point in G1
+*/
+void MPIN_ENCODE_TO_CURVE(octet *DST,octet *ID,octet *HID);
+
+/**	@brief Extract a PIN number from a client secret
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param pin is an input PIN number
+	@param CS is the client secret from which the PIN is to be extracted
+	@return 0 or an error code
+ */
+int MPIN_EXTRACT_PIN(octet *HID, int pin, octet *CS);
+
+/**	@brief Perform first pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param R is a pointer to a cryptographically secure random number generator
+	@param x an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param pin is the input PIN number
+	@param T is the input M-Pin token (the client secret with PIN portion removed)
+	@param S is the reconstructed client secret
+	@param U is output = x.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_1(octet *HID, csprng *R, octet *x, int pin, octet *T, octet *S, octet *U);
+/**	@brief Generate a random group element
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param S is the output random octet
+	@return 0 or an error code
+ */
+int MPIN_RANDOM_GENERATE(csprng *R, octet *S);
+/**	@brief Perform second pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param x an input, a locally generated random number
+	@param y an input random challenge from the server
+	@param V on output = -(x+y).V
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_2(octet *x, octet *y, octet *V);
+
+/**	@brief Perform final pass on the server side of the M-Pin protocol
+
+	@param HID is input H(ID), a hash of the client ID
+	@param y is the input server's randomly generated challenge
+	@param SS is the input server secret
+	@param U is input from the client = x.H(ID)
+	@param V is an input from the client
+	@return 0 or an error code
+ */
+int MPIN_SERVER(octet *HID, octet *y, octet *SS, octet *U, octet *V);
+
+/**	@brief Create a client secret in G1 from a master secret and the client ID
+ *
+	@param S is an input master secret
+	@param HID is the input client identity hashed to curve
+	@param CS is the full client secret = s.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_GET_CLIENT_SECRET(octet *S, octet *HID, octet *CS);
+
+/**	@brief Create a server secret in G2 from a master secret
+ *
+	@param S is an input master secret
+	@param SS is the server secret = s.Q where Q is a fixed generator of G2
+	@return 0 or an error code
+ */
+int MPIN_GET_SERVER_SECRET(octet *S, octet *SS);
+}
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/mpin_BLS12461.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/mpin_BLS12461.h
new file mode 100644
index 0000000..3753906
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/mpin_BLS12461.h
@@ -0,0 +1,136 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file mpin.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief M-Pin Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef MPIN_BLS12461_H
+#define MPIN_BLS12461_H
+
+#include "pair_BLS12461.h"
+//#include "pbc_support.h"
+
+using namespace core;
+
+
+namespace BLS12461 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define PGS_BLS12461 MODBYTES_B464_60  /**< MPIN Group Size */
+#define PFS_BLS12461 MODBYTES_B464_60  /**< MPIN Field Size */
+
+#define MPIN_OK             0   /**< Function completed without error */
+#define MPIN_INVALID_POINT  -14	/**< Point is NOT on the curve */
+#define MPIN_BAD_PIN        -19 /**< Bad PIN number entered */
+
+#define MAXPIN 10000         /**< max PIN */
+#define PBLEN 14             /**< max length of PIN in bits */
+
+//#define PAS_BLS12461 16        /**< MPIN Symmetric Key Size 128 bits */
+//#define HASH_TYPE_MPIN_BLS12461 SHA256   /**< Choose Hash function */
+
+/* MPIN support functions */
+
+/* MPIN primitives */
+
+/**	@brief Encode a string to a curve point (in constant time)
+ *
+	@param DST is the Domain Separation Tag
+    @param ID is the input string
+    @param HID is the output point in G1
+*/
+void MPIN_ENCODE_TO_CURVE(octet *DST,octet *ID,octet *HID);
+
+/**	@brief Extract a PIN number from a client secret
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param pin is an input PIN number
+	@param CS is the client secret from which the PIN is to be extracted
+	@return 0 or an error code
+ */
+int MPIN_EXTRACT_PIN(octet *HID, int pin, octet *CS);
+
+/**	@brief Perform first pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param R is a pointer to a cryptographically secure random number generator
+	@param x an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param pin is the input PIN number
+	@param T is the input M-Pin token (the client secret with PIN portion removed)
+	@param S is the reconstructed client secret
+	@param U is output = x.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_1(octet *HID, csprng *R, octet *x, int pin, octet *T, octet *S, octet *U);
+/**	@brief Generate a random group element
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param S is the output random octet
+	@return 0 or an error code
+ */
+int MPIN_RANDOM_GENERATE(csprng *R, octet *S);
+/**	@brief Perform second pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param x an input, a locally generated random number
+	@param y an input random challenge from the server
+	@param V on output = -(x+y).V
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_2(octet *x, octet *y, octet *V);
+
+/**	@brief Perform final pass on the server side of the M-Pin protocol
+
+	@param HID is input H(ID), a hash of the client ID
+	@param y is the input server's randomly generated challenge
+	@param SS is the input server secret
+	@param U is input from the client = x.H(ID)
+	@param V is an input from the client
+	@return 0 or an error code
+ */
+int MPIN_SERVER(octet *HID, octet *y, octet *SS, octet *U, octet *V);
+
+/**	@brief Create a client secret in G1 from a master secret and the client ID
+ *
+	@param S is an input master secret
+	@param HID is the input client identity hashed to curve
+	@param CS is the full client secret = s.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_GET_CLIENT_SECRET(octet *S, octet *HID, octet *CS);
+
+/**	@brief Create a server secret in G2 from a master secret
+ *
+	@param S is an input master secret
+	@param SS is the server secret = s.Q where Q is a fixed generator of G2
+	@return 0 or an error code
+ */
+int MPIN_GET_SERVER_SECRET(octet *S, octet *SS);
+}
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/mpin_BN158.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/mpin_BN158.h
new file mode 100644
index 0000000..da89da4
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/mpin_BN158.h
@@ -0,0 +1,136 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file mpin.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief M-Pin Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef MPIN_BN158_H
+#define MPIN_BN158_H
+
+#include "pair_BN158.h"
+//#include "pbc_support.h"
+
+using namespace core;
+
+
+namespace BN158 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define PGS_BN158 MODBYTES_B160_56  /**< MPIN Group Size */
+#define PFS_BN158 MODBYTES_B160_56  /**< MPIN Field Size */
+
+#define MPIN_OK             0   /**< Function completed without error */
+#define MPIN_INVALID_POINT  -14	/**< Point is NOT on the curve */
+#define MPIN_BAD_PIN        -19 /**< Bad PIN number entered */
+
+#define MAXPIN 10000         /**< max PIN */
+#define PBLEN 14             /**< max length of PIN in bits */
+
+//#define PAS_BN158 16        /**< MPIN Symmetric Key Size 128 bits */
+//#define HASH_TYPE_MPIN_BN158 SHA256   /**< Choose Hash function */
+
+/* MPIN support functions */
+
+/* MPIN primitives */
+
+/**	@brief Encode a string to a curve point (in constant time)
+ *
+	@param DST is the Domain Separation Tag
+    @param ID is the input string
+    @param HID is the output point in G1
+*/
+void MPIN_ENCODE_TO_CURVE(octet *DST,octet *ID,octet *HID);
+
+/**	@brief Extract a PIN number from a client secret
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param pin is an input PIN number
+	@param CS is the client secret from which the PIN is to be extracted
+	@return 0 or an error code
+ */
+int MPIN_EXTRACT_PIN(octet *HID, int pin, octet *CS);
+
+/**	@brief Perform first pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param R is a pointer to a cryptographically secure random number generator
+	@param x an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param pin is the input PIN number
+	@param T is the input M-Pin token (the client secret with PIN portion removed)
+	@param S is the reconstructed client secret
+	@param U is output = x.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_1(octet *HID, csprng *R, octet *x, int pin, octet *T, octet *S, octet *U);
+/**	@brief Generate a random group element
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param S is the output random octet
+	@return 0 or an error code
+ */
+int MPIN_RANDOM_GENERATE(csprng *R, octet *S);
+/**	@brief Perform second pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param x an input, a locally generated random number
+	@param y an input random challenge from the server
+	@param V on output = -(x+y).V
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_2(octet *x, octet *y, octet *V);
+
+/**	@brief Perform final pass on the server side of the M-Pin protocol
+
+	@param HID is input H(ID), a hash of the client ID
+	@param y is the input server's randomly generated challenge
+	@param SS is the input server secret
+	@param U is input from the client = x.H(ID)
+	@param V is an input from the client
+	@return 0 or an error code
+ */
+int MPIN_SERVER(octet *HID, octet *y, octet *SS, octet *U, octet *V);
+
+/**	@brief Create a client secret in G1 from a master secret and the client ID
+ *
+	@param S is an input master secret
+	@param HID is the input client identity hashed to curve
+	@param CS is the full client secret = s.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_GET_CLIENT_SECRET(octet *S, octet *HID, octet *CS);
+
+/**	@brief Create a server secret in G2 from a master secret
+ *
+	@param S is an input master secret
+	@param SS is the server secret = s.Q where Q is a fixed generator of G2
+	@return 0 or an error code
+ */
+int MPIN_GET_SERVER_SECRET(octet *S, octet *SS);
+}
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/mpin_BN254.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/mpin_BN254.h
new file mode 100644
index 0000000..e7ee74f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/mpin_BN254.h
@@ -0,0 +1,136 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file mpin.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief M-Pin Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef MPIN_BN254_H
+#define MPIN_BN254_H
+
+#include "pair_BN254.h"
+//#include "pbc_support.h"
+
+using namespace core;
+
+
+namespace BN254 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define PGS_BN254 MODBYTES_B256_56  /**< MPIN Group Size */
+#define PFS_BN254 MODBYTES_B256_56  /**< MPIN Field Size */
+
+#define MPIN_OK             0   /**< Function completed without error */
+#define MPIN_INVALID_POINT  -14	/**< Point is NOT on the curve */
+#define MPIN_BAD_PIN        -19 /**< Bad PIN number entered */
+
+#define MAXPIN 10000         /**< max PIN */
+#define PBLEN 14             /**< max length of PIN in bits */
+
+//#define PAS_BN254 16        /**< MPIN Symmetric Key Size 128 bits */
+//#define HASH_TYPE_MPIN_BN254 SHA256   /**< Choose Hash function */
+
+/* MPIN support functions */
+
+/* MPIN primitives */
+
+/**	@brief Encode a string to a curve point (in constant time)
+ *
+	@param DST is the Domain Separation Tag
+    @param ID is the input string
+    @param HID is the output point in G1
+*/
+void MPIN_ENCODE_TO_CURVE(octet *DST,octet *ID,octet *HID);
+
+/**	@brief Extract a PIN number from a client secret
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param pin is an input PIN number
+	@param CS is the client secret from which the PIN is to be extracted
+	@return 0 or an error code
+ */
+int MPIN_EXTRACT_PIN(octet *HID, int pin, octet *CS);
+
+/**	@brief Perform first pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param R is a pointer to a cryptographically secure random number generator
+	@param x an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param pin is the input PIN number
+	@param T is the input M-Pin token (the client secret with PIN portion removed)
+	@param S is the reconstructed client secret
+	@param U is output = x.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_1(octet *HID, csprng *R, octet *x, int pin, octet *T, octet *S, octet *U);
+/**	@brief Generate a random group element
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param S is the output random octet
+	@return 0 or an error code
+ */
+int MPIN_RANDOM_GENERATE(csprng *R, octet *S);
+/**	@brief Perform second pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param x an input, a locally generated random number
+	@param y an input random challenge from the server
+	@param V on output = -(x+y).V
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_2(octet *x, octet *y, octet *V);
+
+/**	@brief Perform final pass on the server side of the M-Pin protocol
+
+	@param HID is input H(ID), a hash of the client ID
+	@param y is the input server's randomly generated challenge
+	@param SS is the input server secret
+	@param U is input from the client = x.H(ID)
+	@param V is an input from the client
+	@return 0 or an error code
+ */
+int MPIN_SERVER(octet *HID, octet *y, octet *SS, octet *U, octet *V);
+
+/**	@brief Create a client secret in G1 from a master secret and the client ID
+ *
+	@param S is an input master secret
+	@param HID is the input client identity hashed to curve
+	@param CS is the full client secret = s.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_GET_CLIENT_SECRET(octet *S, octet *HID, octet *CS);
+
+/**	@brief Create a server secret in G2 from a master secret
+ *
+	@param S is an input master secret
+	@param SS is the server secret = s.Q where Q is a fixed generator of G2
+	@return 0 or an error code
+ */
+int MPIN_GET_SERVER_SECRET(octet *S, octet *SS);
+}
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/mpin_BN254CX.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/mpin_BN254CX.h
new file mode 100644
index 0000000..0e35280
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/mpin_BN254CX.h
@@ -0,0 +1,136 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file mpin.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief M-Pin Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef MPIN_BN254CX_H
+#define MPIN_BN254CX_H
+
+#include "pair_BN254CX.h"
+//#include "pbc_support.h"
+
+using namespace core;
+
+
+namespace BN254CX {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define PGS_BN254CX MODBYTES_B256_56  /**< MPIN Group Size */
+#define PFS_BN254CX MODBYTES_B256_56  /**< MPIN Field Size */
+
+#define MPIN_OK             0   /**< Function completed without error */
+#define MPIN_INVALID_POINT  -14	/**< Point is NOT on the curve */
+#define MPIN_BAD_PIN        -19 /**< Bad PIN number entered */
+
+#define MAXPIN 10000         /**< max PIN */
+#define PBLEN 14             /**< max length of PIN in bits */
+
+//#define PAS_BN254CX 16        /**< MPIN Symmetric Key Size 128 bits */
+//#define HASH_TYPE_MPIN_BN254CX SHA256   /**< Choose Hash function */
+
+/* MPIN support functions */
+
+/* MPIN primitives */
+
+/**	@brief Encode a string to a curve point (in constant time)
+ *
+	@param DST is the Domain Separation Tag
+    @param ID is the input string
+    @param HID is the output point in G1
+*/
+void MPIN_ENCODE_TO_CURVE(octet *DST,octet *ID,octet *HID);
+
+/**	@brief Extract a PIN number from a client secret
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param pin is an input PIN number
+	@param CS is the client secret from which the PIN is to be extracted
+	@return 0 or an error code
+ */
+int MPIN_EXTRACT_PIN(octet *HID, int pin, octet *CS);
+
+/**	@brief Perform first pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param R is a pointer to a cryptographically secure random number generator
+	@param x an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param pin is the input PIN number
+	@param T is the input M-Pin token (the client secret with PIN portion removed)
+	@param S is the reconstructed client secret
+	@param U is output = x.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_1(octet *HID, csprng *R, octet *x, int pin, octet *T, octet *S, octet *U);
+/**	@brief Generate a random group element
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param S is the output random octet
+	@return 0 or an error code
+ */
+int MPIN_RANDOM_GENERATE(csprng *R, octet *S);
+/**	@brief Perform second pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param x an input, a locally generated random number
+	@param y an input random challenge from the server
+	@param V on output = -(x+y).V
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_2(octet *x, octet *y, octet *V);
+
+/**	@brief Perform final pass on the server side of the M-Pin protocol
+
+	@param HID is input H(ID), a hash of the client ID
+	@param y is the input server's randomly generated challenge
+	@param SS is the input server secret
+	@param U is input from the client = x.H(ID)
+	@param V is an input from the client
+	@return 0 or an error code
+ */
+int MPIN_SERVER(octet *HID, octet *y, octet *SS, octet *U, octet *V);
+
+/**	@brief Create a client secret in G1 from a master secret and the client ID
+ *
+	@param S is an input master secret
+	@param HID is the input client identity hashed to curve
+	@param CS is the full client secret = s.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_GET_CLIENT_SECRET(octet *S, octet *HID, octet *CS);
+
+/**	@brief Create a server secret in G2 from a master secret
+ *
+	@param S is an input master secret
+	@param SS is the server secret = s.Q where Q is a fixed generator of G2
+	@return 0 or an error code
+ */
+int MPIN_GET_SERVER_SECRET(octet *S, octet *SS);
+}
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/mpin_BN462.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/mpin_BN462.h
new file mode 100644
index 0000000..31976bd
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/mpin_BN462.h
@@ -0,0 +1,136 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file mpin.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief M-Pin Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef MPIN_BN462_H
+#define MPIN_BN462_H
+
+#include "pair_BN462.h"
+//#include "pbc_support.h"
+
+using namespace core;
+
+
+namespace BN462 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define PGS_BN462 MODBYTES_B464_60  /**< MPIN Group Size */
+#define PFS_BN462 MODBYTES_B464_60  /**< MPIN Field Size */
+
+#define MPIN_OK             0   /**< Function completed without error */
+#define MPIN_INVALID_POINT  -14	/**< Point is NOT on the curve */
+#define MPIN_BAD_PIN        -19 /**< Bad PIN number entered */
+
+#define MAXPIN 10000         /**< max PIN */
+#define PBLEN 14             /**< max length of PIN in bits */
+
+//#define PAS_BN462 16        /**< MPIN Symmetric Key Size 128 bits */
+//#define HASH_TYPE_MPIN_BN462 SHA256   /**< Choose Hash function */
+
+/* MPIN support functions */
+
+/* MPIN primitives */
+
+/**	@brief Encode a string to a curve point (in constant time)
+ *
+	@param DST is the Domain Separation Tag
+    @param ID is the input string
+    @param HID is the output point in G1
+*/
+void MPIN_ENCODE_TO_CURVE(octet *DST,octet *ID,octet *HID);
+
+/**	@brief Extract a PIN number from a client secret
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param pin is an input PIN number
+	@param CS is the client secret from which the PIN is to be extracted
+	@return 0 or an error code
+ */
+int MPIN_EXTRACT_PIN(octet *HID, int pin, octet *CS);
+
+/**	@brief Perform first pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param R is a pointer to a cryptographically secure random number generator
+	@param x an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param pin is the input PIN number
+	@param T is the input M-Pin token (the client secret with PIN portion removed)
+	@param S is the reconstructed client secret
+	@param U is output = x.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_1(octet *HID, csprng *R, octet *x, int pin, octet *T, octet *S, octet *U);
+/**	@brief Generate a random group element
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param S is the output random octet
+	@return 0 or an error code
+ */
+int MPIN_RANDOM_GENERATE(csprng *R, octet *S);
+/**	@brief Perform second pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param x an input, a locally generated random number
+	@param y an input random challenge from the server
+	@param V on output = -(x+y).V
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_2(octet *x, octet *y, octet *V);
+
+/**	@brief Perform final pass on the server side of the M-Pin protocol
+
+	@param HID is input H(ID), a hash of the client ID
+	@param y is the input server's randomly generated challenge
+	@param SS is the input server secret
+	@param U is input from the client = x.H(ID)
+	@param V is an input from the client
+	@return 0 or an error code
+ */
+int MPIN_SERVER(octet *HID, octet *y, octet *SS, octet *U, octet *V);
+
+/**	@brief Create a client secret in G1 from a master secret and the client ID
+ *
+	@param S is an input master secret
+	@param HID is the input client identity hashed to curve
+	@param CS is the full client secret = s.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_GET_CLIENT_SECRET(octet *S, octet *HID, octet *CS);
+
+/**	@brief Create a server secret in G2 from a master secret
+ *
+	@param S is an input master secret
+	@param SS is the server secret = s.Q where Q is a fixed generator of G2
+	@return 0 or an error code
+ */
+int MPIN_GET_SERVER_SECRET(octet *S, octet *SS);
+}
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/mpin_FP256BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/mpin_FP256BN.h
new file mode 100644
index 0000000..987ab95
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/mpin_FP256BN.h
@@ -0,0 +1,136 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file mpin.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief M-Pin Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef MPIN_FP256BN_H
+#define MPIN_FP256BN_H
+
+#include "pair_FP256BN.h"
+//#include "pbc_support.h"
+
+using namespace core;
+
+
+namespace FP256BN {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define PGS_FP256BN MODBYTES_B256_56  /**< MPIN Group Size */
+#define PFS_FP256BN MODBYTES_B256_56  /**< MPIN Field Size */
+
+#define MPIN_OK             0   /**< Function completed without error */
+#define MPIN_INVALID_POINT  -14	/**< Point is NOT on the curve */
+#define MPIN_BAD_PIN        -19 /**< Bad PIN number entered */
+
+#define MAXPIN 10000         /**< max PIN */
+#define PBLEN 14             /**< max length of PIN in bits */
+
+//#define PAS_FP256BN 16        /**< MPIN Symmetric Key Size 128 bits */
+//#define HASH_TYPE_MPIN_FP256BN SHA256   /**< Choose Hash function */
+
+/* MPIN support functions */
+
+/* MPIN primitives */
+
+/**	@brief Encode a string to a curve point (in constant time)
+ *
+	@param DST is the Domain Separation Tag
+    @param ID is the input string
+    @param HID is the output point in G1
+*/
+void MPIN_ENCODE_TO_CURVE(octet *DST,octet *ID,octet *HID);
+
+/**	@brief Extract a PIN number from a client secret
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param pin is an input PIN number
+	@param CS is the client secret from which the PIN is to be extracted
+	@return 0 or an error code
+ */
+int MPIN_EXTRACT_PIN(octet *HID, int pin, octet *CS);
+
+/**	@brief Perform first pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param R is a pointer to a cryptographically secure random number generator
+	@param x an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param pin is the input PIN number
+	@param T is the input M-Pin token (the client secret with PIN portion removed)
+	@param S is the reconstructed client secret
+	@param U is output = x.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_1(octet *HID, csprng *R, octet *x, int pin, octet *T, octet *S, octet *U);
+/**	@brief Generate a random group element
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param S is the output random octet
+	@return 0 or an error code
+ */
+int MPIN_RANDOM_GENERATE(csprng *R, octet *S);
+/**	@brief Perform second pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param x an input, a locally generated random number
+	@param y an input random challenge from the server
+	@param V on output = -(x+y).V
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_2(octet *x, octet *y, octet *V);
+
+/**	@brief Perform final pass on the server side of the M-Pin protocol
+
+	@param HID is input H(ID), a hash of the client ID
+	@param y is the input server's randomly generated challenge
+	@param SS is the input server secret
+	@param U is input from the client = x.H(ID)
+	@param V is an input from the client
+	@return 0 or an error code
+ */
+int MPIN_SERVER(octet *HID, octet *y, octet *SS, octet *U, octet *V);
+
+/**	@brief Create a client secret in G1 from a master secret and the client ID
+ *
+	@param S is an input master secret
+	@param HID is the input client identity hashed to curve
+	@param CS is the full client secret = s.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_GET_CLIENT_SECRET(octet *S, octet *HID, octet *CS);
+
+/**	@brief Create a server secret in G2 from a master secret
+ *
+	@param S is an input master secret
+	@param SS is the server secret = s.Q where Q is a fixed generator of G2
+	@return 0 or an error code
+ */
+int MPIN_GET_SERVER_SECRET(octet *S, octet *SS);
+}
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/mpin_FP512BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/mpin_FP512BN.h
new file mode 100644
index 0000000..aa209a1
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/mpin_FP512BN.h
@@ -0,0 +1,136 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file mpin.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief M-Pin Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef MPIN_FP512BN_H
+#define MPIN_FP512BN_H
+
+#include "pair_FP512BN.h"
+//#include "pbc_support.h"
+
+using namespace core;
+
+
+namespace FP512BN {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define PGS_FP512BN MODBYTES_B512_60  /**< MPIN Group Size */
+#define PFS_FP512BN MODBYTES_B512_60  /**< MPIN Field Size */
+
+#define MPIN_OK             0   /**< Function completed without error */
+#define MPIN_INVALID_POINT  -14	/**< Point is NOT on the curve */
+#define MPIN_BAD_PIN        -19 /**< Bad PIN number entered */
+
+#define MAXPIN 10000         /**< max PIN */
+#define PBLEN 14             /**< max length of PIN in bits */
+
+//#define PAS_FP512BN 16        /**< MPIN Symmetric Key Size 128 bits */
+//#define HASH_TYPE_MPIN_FP512BN SHA256   /**< Choose Hash function */
+
+/* MPIN support functions */
+
+/* MPIN primitives */
+
+/**	@brief Encode a string to a curve point (in constant time)
+ *
+	@param DST is the Domain Separation Tag
+    @param ID is the input string
+    @param HID is the output point in G1
+*/
+void MPIN_ENCODE_TO_CURVE(octet *DST,octet *ID,octet *HID);
+
+/**	@brief Extract a PIN number from a client secret
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param pin is an input PIN number
+	@param CS is the client secret from which the PIN is to be extracted
+	@return 0 or an error code
+ */
+int MPIN_EXTRACT_PIN(octet *HID, int pin, octet *CS);
+
+/**	@brief Perform first pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param R is a pointer to a cryptographically secure random number generator
+	@param x an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param pin is the input PIN number
+	@param T is the input M-Pin token (the client secret with PIN portion removed)
+	@param S is the reconstructed client secret
+	@param U is output = x.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_1(octet *HID, csprng *R, octet *x, int pin, octet *T, octet *S, octet *U);
+/**	@brief Generate a random group element
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param S is the output random octet
+	@return 0 or an error code
+ */
+int MPIN_RANDOM_GENERATE(csprng *R, octet *S);
+/**	@brief Perform second pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param x an input, a locally generated random number
+	@param y an input random challenge from the server
+	@param V on output = -(x+y).V
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_2(octet *x, octet *y, octet *V);
+
+/**	@brief Perform final pass on the server side of the M-Pin protocol
+
+	@param HID is input H(ID), a hash of the client ID
+	@param y is the input server's randomly generated challenge
+	@param SS is the input server secret
+	@param U is input from the client = x.H(ID)
+	@param V is an input from the client
+	@return 0 or an error code
+ */
+int MPIN_SERVER(octet *HID, octet *y, octet *SS, octet *U, octet *V);
+
+/**	@brief Create a client secret in G1 from a master secret and the client ID
+ *
+	@param S is an input master secret
+	@param HID is the input client identity hashed to curve
+	@param CS is the full client secret = s.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_GET_CLIENT_SECRET(octet *S, octet *HID, octet *CS);
+
+/**	@brief Create a server secret in G2 from a master secret
+ *
+	@param S is an input master secret
+	@param SS is the server secret = s.Q where Q is a fixed generator of G2
+	@return 0 or an error code
+ */
+int MPIN_GET_SERVER_SECRET(octet *S, octet *SS);
+}
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/newhope.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/newhope.h
new file mode 100644
index 0000000..d7d6ee1
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/newhope.h
@@ -0,0 +1,64 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* NewHope Simple API */
+
+#ifndef NHS_H
+#define NHS_H
+
+#include "core.h"
+
+/* NewHope parameters */
+
+//q= 12289
+
+#define RLWE_PRIME 0x3001	// q in Hex
+#define RLWE_LGN 10			// Degree n=2^LGN
+#define RLWE_ND 0xF7002FFF	// 1/(R-q) mod R
+#define RLWE_ONE 0x2AC8		// R mod q
+#define RLWE_R2MODP 0x1620	// R^2 mod q
+
+namespace core {
+/** @brief NHS server first pass
+ *
+    @param RNG Random Number Generator handle
+    @param SB seed and polynomial B concatenated - output
+    @param S server secret - output
+
+ */
+extern void NHS_SERVER_1(csprng *RNG, octet *SB, octet *S);
+/** @brief NHS client pass
+ *
+    @param RNG Random Number Generator handle
+    @param SB seed and polynomial B concatenated - input
+    @param UC polynomial U and compressed polynomial c - output
+    @param KEY client key
+ */
+extern void NHS_CLIENT(csprng *RNG, octet *SB, octet *UC, octet *KEY);
+/** @brief NHS server second pass
+ *
+    @param S server secret - input
+    @param UC polynomial U and compressed polynomial c - input
+    @param KEY server key
+ */
+extern void NHS_SERVER_2(octet *S, octet *UC, octet *KEY);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/pair.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/pair.h
new file mode 100644
index 0000000..e7e445f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/pair.h
@@ -0,0 +1,183 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef PAIR_ZZZ_H
+#define PAIR_ZZZ_H
+
+#include "fp12_YYY.h"
+#include "ecp2_ZZZ.h"
+#include "ecp_ZZZ.h"
+
+using namespace core;
+
+namespace ZZZ {
+/* Pairing constants */
+
+extern const XXX::BIG CURVE_Bnx; /**< BN curve x parameter */
+extern const XXX::BIG CURVE_Cru; /**< BN curve Cube Root of Unity */
+
+extern const XXX::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const XXX::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const XXX::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const XXX::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+/* Pairing function prototypes */
+
+
+/**	@brief Precompute line functions details for fixed G2 value
+ *
+	@param T array of precomputed FP4 partial line functions
+	@param GV a fixed ECP2 instance
+ */
+extern void PAIR_precomp(YYY::FP4 T[], ECP2* GV);
+
+/**	@brief Compute line functions for n-pairing
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param PV ECP2 instance, an element of G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another(YYY::FP12 r[], ECP2* PV, ECP* QV);
+
+
+/**	@brief Compute line functions for n-pairing, assuming precomputation on G2
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param T array contains precomputed partial line fucntions from G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another_pc(YYY::FP12 r[], YYY::FP4 T[], ECP *QV);
+
+
+
+/**	@brief Calculate Miller loop for Optimal ATE pairing e(P,Q)
+ *
+	@param r FP12 result of the pairing calculation e(P,Q)
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+
+ */
+extern void PAIR_ate(YYY::FP12 *r, ECP2 *P, ECP *Q);
+/**	@brief Calculate Miller loop for Optimal ATE double-pairing e(P,Q).e(R,S)
+ *
+	Faster than calculating two separate pairings
+	@param r FP12 result of the pairing calculation e(P,Q).e(R,S), an element of GT
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+	@param R ECP2 instance, an element of G2
+	@param S ECP instance, an element of G1
+ */
+extern void PAIR_double_ate(YYY::FP12 *r, ECP2 *P, ECP *Q, ECP2 *R, ECP *S);
+/**	@brief Final exponentiation of pairing, converts output of Miller loop to element in GT
+ *
+	Here p is the internal modulus, and r is the group order
+	@param x FP12, on exit = x^((p^12-1)/r)
+ */
+extern void PAIR_fexp(YYY::FP12 *x);
+/**	@brief Fast point multiplication of a member of the group G1 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param Q ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G1mul(ECP *Q, XXX::BIG b);
+/**	@brief Fast point multiplication of a member of the group G2 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param P ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G2mul(ECP2 *P, XXX::BIG b);
+
+
+
+/**	@brief Fast raising of a member of GT to a BIG power
+ *
+	May exploit endomorphism for speed.
+	@param x FP12 member of GT.
+	@param b BIG exponent
+
+ */
+extern void PAIR_GTpow(YYY::FP12 *x, XXX::BIG b);
+
+
+/**	@brief Tests ECP for membership of G1
+ *
+	@param P ECP member of G1
+	@return true or false
+
+ */
+extern int PAIR_G1member(ZZZ::ECP *P);
+
+/**	@brief Tests ECP2 for membership of G2
+ *
+	@param P ECP2 member of G2
+	@return true or false
+
+ */
+extern int PAIR_G2member(ZZZ::ECP2 *P);
+
+/**	@brief Tests FP12 for membership of cyclotomic sub-group
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTcyclotomic(YYY::FP12 *x);
+
+/**	@brief Tests FP12 for membership of GT
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTmember(YYY::FP12 *x);
+
+/**	@brief Prepare Ate parameter
+ *
+	@param n BIG parameter
+	@param n3 BIG paramter = 3*n
+	@return number of nits in n3
+
+ */
+extern int PAIR_nbits(XXX::BIG n3, XXX::BIG n);
+
+/**	@brief Initialise structure for multi-pairing
+ *
+	@param r FP12 array, to be initialised to 1
+
+ */
+extern void PAIR_initmp(YYY::FP12 r[]);
+
+
+/**	@brief Miller loop
+ *
+ 	@param res FP12 result
+	@param r FP12 precomputed array of accumulated line functions
+
+ */
+extern void PAIR_miller(YYY::FP12 *res, YYY::FP12 r[]);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/pair4.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/pair4.h
new file mode 100644
index 0000000..c9b9571
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/pair4.h
@@ -0,0 +1,180 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef PAIR4_ZZZ_H
+#define PAIR4_ZZZ_H
+
+#include "fp24_YYY.h"
+#include "ecp4_ZZZ.h"
+#include "ecp_ZZZ.h"
+
+using namespace core;
+
+namespace ZZZ {
+/* Pairing constants */
+
+extern const XXX::BIG CURVE_Bnx; /**< BN curve x parameter */
+extern const XXX::BIG CURVE_Cru; /**< BN curve Cube Root of Unity */
+
+extern const XXX::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const XXX::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const XXX::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const XXX::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+/* Pairing function prototypes */
+
+/**	@brief Precompute line functions details for fixed G2 value
+ *
+	@param T array of precomputed FP8 partial line functions
+	@param GV a fixed ECP4 instance
+ */
+extern void PAIR_precomp(YYY::FP8 T[], ECP4* GV);
+
+
+/**	@brief Calculate Miller loop for Optimal ATE pairing e(P,Q)
+ *
+	@param r FP24 result of the pairing calculation e(P,Q)
+	@param P ECP4 instance, an element of G2
+	@param Q ECP instance, an element of G1
+
+ */
+extern void PAIR_ate(YYY::FP24 *r, ECP4 *P, ECP *Q);
+/**	@brief Calculate Miller loop for Optimal ATE double-pairing e(P,Q).e(R,S)
+ *
+	Faster than calculating two separate pairings
+	@param r FP24 result of the pairing calculation e(P,Q).e(R,S), an element of GT
+	@param P ECP4 instance, an element of G2
+	@param Q ECP instance, an element of G1
+	@param R ECP4 instance, an element of G2
+	@param S ECP instance, an element of G1
+ */
+extern void PAIR_double_ate(YYY::FP24 *r, ECP4 *P, ECP *Q, ECP4 *R, ECP *S);
+/**	@brief Final exponentiation of pairing, converts output of Miller loop to element in GT
+ *
+	Here p is the internal modulus, and r is the group order
+	@param x FP24, on exit = x^((p^12-1)/r)
+ */
+extern void PAIR_fexp(YYY::FP24 *x);
+/**	@brief Fast point multiplication of a member of the group G1 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param Q ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G1mul(ECP *Q, XXX::BIG b);
+/**	@brief Fast point multiplication of a member of the group G2 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param P ECP4 member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G2mul(ECP4 *P, XXX::BIG b);
+/**	@brief Fast raising of a member of GT to a BIG power
+ *
+	May exploit endomorphism for speed.
+	@param x FP24 member of GT.
+	@param b BIG exponent
+
+ */
+extern void PAIR_GTpow(YYY::FP24 *x, XXX::BIG b);
+
+/**	@brief Tests ECP for membership of G1
+ *
+	@param P ECP member of G1
+	@return true or false
+
+ */
+extern int PAIR_G1member(ZZZ::ECP *P);
+
+/**	@brief Tests ECP4 for membership of G2
+ *
+	@param P ECP4 member of G2
+	@return true or false
+
+ */
+extern int PAIR_G2member(ZZZ::ECP4 *P);
+
+
+/**	@brief Tests FP24 for membership of cyclotomic subgroup
+ *
+	@param x FP24 instance
+	@return 1 if x is cyclotomic, else return 0
+
+ */
+extern int PAIR_GTcyclotomic(YYY::FP24 *x);
+
+
+/**	@brief Tests FP24 for full membership of GT
+ *
+	@param x FP24 instance
+	@return 1 if x is in GT, else return 0
+
+ */
+extern int PAIR_GTmember(YYY::FP24 *x);
+
+
+/**	@brief Precompute line functions for n-pairing
+ *
+	@param r array of precomputed FP24 products of line functions
+	@param PV ECP4 instance, an element of G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another(YYY::FP24 r[], ECP4* PV, ECP* QV);
+
+/**	@brief Compute line functions for n-pairing, assuming precomputation on G2
+ *
+	@param r array of precomputed FP24 products of line functions
+	@param T array contains precomputed partial line fucntions from G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another_pc(YYY::FP24 r[], YYY::FP8 T[], ECP *QV);
+
+
+/**	@brief Prepare Ate parameter
+ *
+	@param n BIG parameter
+	@param n3 BIG paramter = 3*n
+	@return number of nits in n3
+
+ */
+extern int PAIR_nbits(XXX::BIG n3, XXX::BIG n);
+
+/**	@brief Initialise structure for multi-pairing
+ *
+	@param r FP24 array, to be initialised to 1
+
+ */
+extern void PAIR_initmp(YYY::FP24 r[]);
+
+
+/**	@brief Miller loop
+ *
+ 	@param res FP24 result
+	@param r FP24 precomputed array of accumulated line functions
+
+ */
+extern void PAIR_miller(YYY::FP24 *res, YYY::FP24 r[]);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/pair4_BLS24479.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/pair4_BLS24479.h
new file mode 100644
index 0000000..c9b57cd
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/pair4_BLS24479.h
@@ -0,0 +1,180 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef PAIR4_BLS24479_H
+#define PAIR4_BLS24479_H
+
+#include "fp24_BLS24479.h"
+#include "ecp4_BLS24479.h"
+#include "ecp_BLS24479.h"
+
+using namespace core;
+
+namespace BLS24479 {
+/* Pairing constants */
+
+extern const B480_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+extern const B480_56::BIG CURVE_Cru; /**< BN curve Cube Root of Unity */
+
+extern const B480_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B480_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B480_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B480_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+/* Pairing function prototypes */
+
+/**	@brief Precompute line functions details for fixed G2 value
+ *
+	@param T array of precomputed FP8 partial line functions
+	@param GV a fixed ECP4 instance
+ */
+extern void PAIR_precomp(BLS24479::FP8 T[], ECP4* GV);
+
+
+/**	@brief Calculate Miller loop for Optimal ATE pairing e(P,Q)
+ *
+	@param r FP24 result of the pairing calculation e(P,Q)
+	@param P ECP4 instance, an element of G2
+	@param Q ECP instance, an element of G1
+
+ */
+extern void PAIR_ate(BLS24479::FP24 *r, ECP4 *P, ECP *Q);
+/**	@brief Calculate Miller loop for Optimal ATE double-pairing e(P,Q).e(R,S)
+ *
+	Faster than calculating two separate pairings
+	@param r FP24 result of the pairing calculation e(P,Q).e(R,S), an element of GT
+	@param P ECP4 instance, an element of G2
+	@param Q ECP instance, an element of G1
+	@param R ECP4 instance, an element of G2
+	@param S ECP instance, an element of G1
+ */
+extern void PAIR_double_ate(BLS24479::FP24 *r, ECP4 *P, ECP *Q, ECP4 *R, ECP *S);
+/**	@brief Final exponentiation of pairing, converts output of Miller loop to element in GT
+ *
+	Here p is the internal modulus, and r is the group order
+	@param x FP24, on exit = x^((p^12-1)/r)
+ */
+extern void PAIR_fexp(BLS24479::FP24 *x);
+/**	@brief Fast point multiplication of a member of the group G1 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param Q ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G1mul(ECP *Q, B480_56::BIG b);
+/**	@brief Fast point multiplication of a member of the group G2 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param P ECP4 member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G2mul(ECP4 *P, B480_56::BIG b);
+/**	@brief Fast raising of a member of GT to a BIG power
+ *
+	May exploit endomorphism for speed.
+	@param x FP24 member of GT.
+	@param b BIG exponent
+
+ */
+extern void PAIR_GTpow(BLS24479::FP24 *x, B480_56::BIG b);
+
+/**	@brief Tests ECP for membership of G1
+ *
+	@param P ECP member of G1
+	@return true or false
+
+ */
+extern int PAIR_G1member(BLS24479::ECP *P);
+
+/**	@brief Tests ECP4 for membership of G2
+ *
+	@param P ECP4 member of G2
+	@return true or false
+
+ */
+extern int PAIR_G2member(BLS24479::ECP4 *P);
+
+
+/**	@brief Tests FP24 for membership of cyclotomic subgroup
+ *
+	@param x FP24 instance
+	@return 1 if x is cyclotomic, else return 0
+
+ */
+extern int PAIR_GTcyclotomic(BLS24479::FP24 *x);
+
+
+/**	@brief Tests FP24 for full membership of GT
+ *
+	@param x FP24 instance
+	@return 1 if x is in GT, else return 0
+
+ */
+extern int PAIR_GTmember(BLS24479::FP24 *x);
+
+
+/**	@brief Precompute line functions for n-pairing
+ *
+	@param r array of precomputed FP24 products of line functions
+	@param PV ECP4 instance, an element of G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another(BLS24479::FP24 r[], ECP4* PV, ECP* QV);
+
+/**	@brief Compute line functions for n-pairing, assuming precomputation on G2
+ *
+	@param r array of precomputed FP24 products of line functions
+	@param T array contains precomputed partial line fucntions from G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another_pc(BLS24479::FP24 r[], BLS24479::FP8 T[], ECP *QV);
+
+
+/**	@brief Prepare Ate parameter
+ *
+	@param n BIG parameter
+	@param n3 BIG paramter = 3*n
+	@return number of nits in n3
+
+ */
+extern int PAIR_nbits(B480_56::BIG n3, B480_56::BIG n);
+
+/**	@brief Initialise structure for multi-pairing
+ *
+	@param r FP24 array, to be initialised to 1
+
+ */
+extern void PAIR_initmp(BLS24479::FP24 r[]);
+
+
+/**	@brief Miller loop
+ *
+ 	@param res FP24 result
+	@param r FP24 precomputed array of accumulated line functions
+
+ */
+extern void PAIR_miller(BLS24479::FP24 *res, BLS24479::FP24 r[]);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/pair8.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/pair8.h
new file mode 100644
index 0000000..cfd12ee
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/pair8.h
@@ -0,0 +1,179 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef PAIR8_ZZZ_H
+#define PAIR8_ZZZ_H
+
+#include "fp48_YYY.h"
+#include "ecp8_ZZZ.h"
+#include "ecp_ZZZ.h"
+
+using namespace core;
+
+namespace ZZZ {
+/* Pairing constants */
+
+extern const XXX::BIG CURVE_Bnx; /**< BN curve x parameter */
+extern const XXX::BIG CURVE_Cru; /**< BN curve Cube Root of Unity */
+
+extern const XXX::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const XXX::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const XXX::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const XXX::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+/* Pairing function prototypes */
+
+/**	@brief Precompute line functions details for fixed G2 value
+ *
+	@param T array of precomputed FP16 partial line functions
+	@param GV a fixed ECP8 instance
+ */
+extern void PAIR_precomp(YYY::FP16 T[], ECP8* GV);
+
+
+/**	@brief Calculate Miller loop for Optimal ATE pairing e(P,Q)
+ *
+	@param r FP48 result of the pairing calculation e(P,Q)
+	@param P ECP8 instance, an element of G2
+	@param Q ECP instance, an element of G1
+
+ */
+extern void PAIR_ate(YYY::FP48 *r, ECP8 *P, ECP *Q);
+/**	@brief Calculate Miller loop for Optimal ATE double-pairing e(P,Q).e(R,S)
+ *
+	Faster than calculating two separate pairings
+	@param r FP48 result of the pairing calculation e(P,Q).e(R,S), an element of GT
+	@param P ECP8 instance, an element of G2
+	@param Q ECP instance, an element of G1
+	@param R ECP8 instance, an element of G2
+	@param S ECP instance, an element of G1
+ */
+extern void PAIR_double_ate(YYY::FP48 *r, ECP8 *P, ECP *Q, ECP8 *R, ECP *S);
+/**	@brief Final exponentiation of pairing, converts output of Miller loop to element in GT
+ *
+	Here p is the internal modulus, and r is the group order
+	@param x FP48, on exit = x^((p^12-1)/r)
+ */
+extern void PAIR_fexp(YYY::FP48 *x);
+/**	@brief Fast point multiplication of a member of the group G1 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param Q ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G1mul(ECP *Q, XXX::BIG b);
+/**	@brief Fast point multiplication of a member of the group G2 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param P ECP8 member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G2mul(ECP8 *P, XXX::BIG b);
+/**	@brief Fast raising of a member of GT to a BIG power
+ *
+	May exploit endomorphism for speed.
+	@param x FP48 member of GT.
+	@param b BIG exponent
+
+ */
+extern void PAIR_GTpow(YYY::FP48 *x, XXX::BIG b);
+
+/**	@brief Tests ECP for membership of G1
+ *
+	@param P ECP member of G1
+	@return true or false
+
+ */
+extern int PAIR_G1member(ZZZ::ECP *P);
+
+/**	@brief Tests ECP8 for membership of G2
+ *
+	@param P ECP8 member of G2
+	@return true or false
+
+ */
+extern int PAIR_G2member(ZZZ::ECP8 *P);
+
+/**	@brief Tests FP48 for membership of cyclotomic subgroup
+ *
+	@param x FP48 instance
+	@return 1 if x is cyclotomic, else return 0
+
+ */
+extern int PAIR_GTcyclotomic(YYY::FP48 *x);
+
+/**	@brief Tests FP48 for full membership of GT
+ *
+	@param x FP48 instance
+	@return 1 if x is in GT, else return 0
+
+ */
+extern int PAIR_GTmember(YYY::FP48 *x);
+
+/**	@brief Precompute line functions for n-pairing
+ *
+	@param r array of precomputed FP48 products of line functions
+	@param PV ECP8 instance, an element of G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another(YYY::FP48 r[], ECP8* PV, ECP* QV);
+
+
+/**	@brief Compute line functions for n-pairing, assuming precomputation on G2
+ *
+	@param r array of precomputed FP48 products of line functions
+	@param T array contains precomputed partial line fucntions from G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another_pc(YYY::FP48 r[], YYY::FP16 T[], ECP *QV);
+
+
+
+/**	@brief Prepare Ate parameter
+ *
+	@param n BIG parameter
+	@param n3 BIG paramter = 3*n
+	@return number of nits in n3
+
+ */
+extern int PAIR_nbits(XXX::BIG n3, XXX::BIG n);
+
+/**	@brief Initialise structure for multi-pairing
+ *
+	@param r FP48 array, to be initialised to 1
+
+ */
+extern void PAIR_initmp(YYY::FP48 r[]);
+
+
+/**	@brief Miller loop
+ *
+ 	@param res FP48 result
+	@param r FP48 precomputed array of accumulated line functions
+
+ */
+extern void PAIR_miller(YYY::FP48 *res, YYY::FP48 r[]);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/pair8_BLS48286.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/pair8_BLS48286.h
new file mode 100644
index 0000000..69d8655
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/pair8_BLS48286.h
@@ -0,0 +1,179 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef PAIR8_BLS48286_H
+#define PAIR8_BLS48286_H
+
+#include "fp48_BLS48286.h"
+#include "ecp8_BLS48286.h"
+#include "ecp_BLS48286.h"
+
+using namespace core;
+
+namespace BLS48286 {
+/* Pairing constants */
+
+extern const B288_60::BIG CURVE_Bnx; /**< BN curve x parameter */
+extern const B288_60::BIG CURVE_Cru; /**< BN curve Cube Root of Unity */
+
+extern const B288_60::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B288_60::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B288_60::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B288_60::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+/* Pairing function prototypes */
+
+/**	@brief Precompute line functions details for fixed G2 value
+ *
+	@param T array of precomputed FP16 partial line functions
+	@param GV a fixed ECP8 instance
+ */
+extern void PAIR_precomp(BLS48286::FP16 T[], ECP8* GV);
+
+
+/**	@brief Calculate Miller loop for Optimal ATE pairing e(P,Q)
+ *
+	@param r FP48 result of the pairing calculation e(P,Q)
+	@param P ECP8 instance, an element of G2
+	@param Q ECP instance, an element of G1
+
+ */
+extern void PAIR_ate(BLS48286::FP48 *r, ECP8 *P, ECP *Q);
+/**	@brief Calculate Miller loop for Optimal ATE double-pairing e(P,Q).e(R,S)
+ *
+	Faster than calculating two separate pairings
+	@param r FP48 result of the pairing calculation e(P,Q).e(R,S), an element of GT
+	@param P ECP8 instance, an element of G2
+	@param Q ECP instance, an element of G1
+	@param R ECP8 instance, an element of G2
+	@param S ECP instance, an element of G1
+ */
+extern void PAIR_double_ate(BLS48286::FP48 *r, ECP8 *P, ECP *Q, ECP8 *R, ECP *S);
+/**	@brief Final exponentiation of pairing, converts output of Miller loop to element in GT
+ *
+	Here p is the internal modulus, and r is the group order
+	@param x FP48, on exit = x^((p^12-1)/r)
+ */
+extern void PAIR_fexp(BLS48286::FP48 *x);
+/**	@brief Fast point multiplication of a member of the group G1 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param Q ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G1mul(ECP *Q, B288_60::BIG b);
+/**	@brief Fast point multiplication of a member of the group G2 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param P ECP8 member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G2mul(ECP8 *P, B288_60::BIG b);
+/**	@brief Fast raising of a member of GT to a BIG power
+ *
+	May exploit endomorphism for speed.
+	@param x FP48 member of GT.
+	@param b BIG exponent
+
+ */
+extern void PAIR_GTpow(BLS48286::FP48 *x, B288_60::BIG b);
+
+/**	@brief Tests ECP for membership of G1
+ *
+	@param P ECP member of G1
+	@return true or false
+
+ */
+extern int PAIR_G1member(BLS48286::ECP *P);
+
+/**	@brief Tests ECP8 for membership of G2
+ *
+	@param P ECP8 member of G2
+	@return true or false
+
+ */
+extern int PAIR_G2member(BLS48286::ECP8 *P);
+
+/**	@brief Tests FP48 for membership of cyclotomic subgroup
+ *
+	@param x FP48 instance
+	@return 1 if x is cyclotomic, else return 0
+
+ */
+extern int PAIR_GTcyclotomic(BLS48286::FP48 *x);
+
+/**	@brief Tests FP48 for full membership of GT
+ *
+	@param x FP48 instance
+	@return 1 if x is in GT, else return 0
+
+ */
+extern int PAIR_GTmember(BLS48286::FP48 *x);
+
+/**	@brief Precompute line functions for n-pairing
+ *
+	@param r array of precomputed FP48 products of line functions
+	@param PV ECP8 instance, an element of G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another(BLS48286::FP48 r[], ECP8* PV, ECP* QV);
+
+
+/**	@brief Compute line functions for n-pairing, assuming precomputation on G2
+ *
+	@param r array of precomputed FP48 products of line functions
+	@param T array contains precomputed partial line fucntions from G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another_pc(BLS48286::FP48 r[], BLS48286::FP16 T[], ECP *QV);
+
+
+
+/**	@brief Prepare Ate parameter
+ *
+	@param n BIG parameter
+	@param n3 BIG paramter = 3*n
+	@return number of nits in n3
+
+ */
+extern int PAIR_nbits(B288_60::BIG n3, B288_60::BIG n);
+
+/**	@brief Initialise structure for multi-pairing
+ *
+	@param r FP48 array, to be initialised to 1
+
+ */
+extern void PAIR_initmp(BLS48286::FP48 r[]);
+
+
+/**	@brief Miller loop
+ *
+ 	@param res FP48 result
+	@param r FP48 precomputed array of accumulated line functions
+
+ */
+extern void PAIR_miller(BLS48286::FP48 *res, BLS48286::FP48 r[]);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/pair8_BLS48556.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/pair8_BLS48556.h
new file mode 100644
index 0000000..ce7ca73
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/pair8_BLS48556.h
@@ -0,0 +1,179 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef PAIR8_BLS48556_H
+#define PAIR8_BLS48556_H
+
+#include "fp48_BLS48556.h"
+#include "ecp8_BLS48556.h"
+#include "ecp_BLS48556.h"
+
+using namespace core;
+
+namespace BLS48556 {
+/* Pairing constants */
+
+extern const B560_58::BIG CURVE_Bnx; /**< BN curve x parameter */
+extern const B560_58::BIG CURVE_Cru; /**< BN curve Cube Root of Unity */
+
+extern const B560_58::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B560_58::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B560_58::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B560_58::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+/* Pairing function prototypes */
+
+/**	@brief Precompute line functions details for fixed G2 value
+ *
+	@param T array of precomputed FP16 partial line functions
+	@param GV a fixed ECP8 instance
+ */
+extern void PAIR_precomp(BLS48556::FP16 T[], ECP8* GV);
+
+
+/**	@brief Calculate Miller loop for Optimal ATE pairing e(P,Q)
+ *
+	@param r FP48 result of the pairing calculation e(P,Q)
+	@param P ECP8 instance, an element of G2
+	@param Q ECP instance, an element of G1
+
+ */
+extern void PAIR_ate(BLS48556::FP48 *r, ECP8 *P, ECP *Q);
+/**	@brief Calculate Miller loop for Optimal ATE double-pairing e(P,Q).e(R,S)
+ *
+	Faster than calculating two separate pairings
+	@param r FP48 result of the pairing calculation e(P,Q).e(R,S), an element of GT
+	@param P ECP8 instance, an element of G2
+	@param Q ECP instance, an element of G1
+	@param R ECP8 instance, an element of G2
+	@param S ECP instance, an element of G1
+ */
+extern void PAIR_double_ate(BLS48556::FP48 *r, ECP8 *P, ECP *Q, ECP8 *R, ECP *S);
+/**	@brief Final exponentiation of pairing, converts output of Miller loop to element in GT
+ *
+	Here p is the internal modulus, and r is the group order
+	@param x FP48, on exit = x^((p^12-1)/r)
+ */
+extern void PAIR_fexp(BLS48556::FP48 *x);
+/**	@brief Fast point multiplication of a member of the group G1 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param Q ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G1mul(ECP *Q, B560_58::BIG b);
+/**	@brief Fast point multiplication of a member of the group G2 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param P ECP8 member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G2mul(ECP8 *P, B560_58::BIG b);
+/**	@brief Fast raising of a member of GT to a BIG power
+ *
+	May exploit endomorphism for speed.
+	@param x FP48 member of GT.
+	@param b BIG exponent
+
+ */
+extern void PAIR_GTpow(BLS48556::FP48 *x, B560_58::BIG b);
+
+/**	@brief Tests ECP for membership of G1
+ *
+	@param P ECP member of G1
+	@return true or false
+
+ */
+extern int PAIR_G1member(BLS48556::ECP *P);
+
+/**	@brief Tests ECP8 for membership of G2
+ *
+	@param P ECP8 member of G2
+	@return true or false
+
+ */
+extern int PAIR_G2member(BLS48556::ECP8 *P);
+
+/**	@brief Tests FP48 for membership of cyclotomic subgroup
+ *
+	@param x FP48 instance
+	@return 1 if x is cyclotomic, else return 0
+
+ */
+extern int PAIR_GTcyclotomic(BLS48556::FP48 *x);
+
+/**	@brief Tests FP48 for full membership of GT
+ *
+	@param x FP48 instance
+	@return 1 if x is in GT, else return 0
+
+ */
+extern int PAIR_GTmember(BLS48556::FP48 *x);
+
+/**	@brief Precompute line functions for n-pairing
+ *
+	@param r array of precomputed FP48 products of line functions
+	@param PV ECP8 instance, an element of G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another(BLS48556::FP48 r[], ECP8* PV, ECP* QV);
+
+
+/**	@brief Compute line functions for n-pairing, assuming precomputation on G2
+ *
+	@param r array of precomputed FP48 products of line functions
+	@param T array contains precomputed partial line fucntions from G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another_pc(BLS48556::FP48 r[], BLS48556::FP16 T[], ECP *QV);
+
+
+
+/**	@brief Prepare Ate parameter
+ *
+	@param n BIG parameter
+	@param n3 BIG paramter = 3*n
+	@return number of nits in n3
+
+ */
+extern int PAIR_nbits(B560_58::BIG n3, B560_58::BIG n);
+
+/**	@brief Initialise structure for multi-pairing
+ *
+	@param r FP48 array, to be initialised to 1
+
+ */
+extern void PAIR_initmp(BLS48556::FP48 r[]);
+
+
+/**	@brief Miller loop
+ *
+ 	@param res FP48 result
+	@param r FP48 precomputed array of accumulated line functions
+
+ */
+extern void PAIR_miller(BLS48556::FP48 *res, BLS48556::FP48 r[]);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/pair8_BLS48581.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/pair8_BLS48581.h
new file mode 100644
index 0000000..eadd78b
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/pair8_BLS48581.h
@@ -0,0 +1,179 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef PAIR8_BLS48581_H
+#define PAIR8_BLS48581_H
+
+#include "fp48_BLS48581.h"
+#include "ecp8_BLS48581.h"
+#include "ecp_BLS48581.h"
+
+using namespace core;
+
+namespace BLS48581 {
+/* Pairing constants */
+
+extern const B584_60::BIG CURVE_Bnx; /**< BN curve x parameter */
+extern const B584_60::BIG CURVE_Cru; /**< BN curve Cube Root of Unity */
+
+extern const B584_60::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B584_60::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B584_60::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B584_60::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+/* Pairing function prototypes */
+
+/**	@brief Precompute line functions details for fixed G2 value
+ *
+	@param T array of precomputed FP16 partial line functions
+	@param GV a fixed ECP8 instance
+ */
+extern void PAIR_precomp(BLS48581::FP16 T[], ECP8* GV);
+
+
+/**	@brief Calculate Miller loop for Optimal ATE pairing e(P,Q)
+ *
+	@param r FP48 result of the pairing calculation e(P,Q)
+	@param P ECP8 instance, an element of G2
+	@param Q ECP instance, an element of G1
+
+ */
+extern void PAIR_ate(BLS48581::FP48 *r, ECP8 *P, ECP *Q);
+/**	@brief Calculate Miller loop for Optimal ATE double-pairing e(P,Q).e(R,S)
+ *
+	Faster than calculating two separate pairings
+	@param r FP48 result of the pairing calculation e(P,Q).e(R,S), an element of GT
+	@param P ECP8 instance, an element of G2
+	@param Q ECP instance, an element of G1
+	@param R ECP8 instance, an element of G2
+	@param S ECP instance, an element of G1
+ */
+extern void PAIR_double_ate(BLS48581::FP48 *r, ECP8 *P, ECP *Q, ECP8 *R, ECP *S);
+/**	@brief Final exponentiation of pairing, converts output of Miller loop to element in GT
+ *
+	Here p is the internal modulus, and r is the group order
+	@param x FP48, on exit = x^((p^12-1)/r)
+ */
+extern void PAIR_fexp(BLS48581::FP48 *x);
+/**	@brief Fast point multiplication of a member of the group G1 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param Q ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G1mul(ECP *Q, B584_60::BIG b);
+/**	@brief Fast point multiplication of a member of the group G2 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param P ECP8 member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G2mul(ECP8 *P, B584_60::BIG b);
+/**	@brief Fast raising of a member of GT to a BIG power
+ *
+	May exploit endomorphism for speed.
+	@param x FP48 member of GT.
+	@param b BIG exponent
+
+ */
+extern void PAIR_GTpow(BLS48581::FP48 *x, B584_60::BIG b);
+
+/**	@brief Tests ECP for membership of G1
+ *
+	@param P ECP member of G1
+	@return true or false
+
+ */
+extern int PAIR_G1member(BLS48581::ECP *P);
+
+/**	@brief Tests ECP8 for membership of G2
+ *
+	@param P ECP8 member of G2
+	@return true or false
+
+ */
+extern int PAIR_G2member(BLS48581::ECP8 *P);
+
+/**	@brief Tests FP48 for membership of cyclotomic subgroup
+ *
+	@param x FP48 instance
+	@return 1 if x is cyclotomic, else return 0
+
+ */
+extern int PAIR_GTcyclotomic(BLS48581::FP48 *x);
+
+/**	@brief Tests FP48 for full membership of GT
+ *
+	@param x FP48 instance
+	@return 1 if x is in GT, else return 0
+
+ */
+extern int PAIR_GTmember(BLS48581::FP48 *x);
+
+/**	@brief Precompute line functions for n-pairing
+ *
+	@param r array of precomputed FP48 products of line functions
+	@param PV ECP8 instance, an element of G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another(BLS48581::FP48 r[], ECP8* PV, ECP* QV);
+
+
+/**	@brief Compute line functions for n-pairing, assuming precomputation on G2
+ *
+	@param r array of precomputed FP48 products of line functions
+	@param T array contains precomputed partial line fucntions from G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another_pc(BLS48581::FP48 r[], BLS48581::FP16 T[], ECP *QV);
+
+
+
+/**	@brief Prepare Ate parameter
+ *
+	@param n BIG parameter
+	@param n3 BIG paramter = 3*n
+	@return number of nits in n3
+
+ */
+extern int PAIR_nbits(B584_60::BIG n3, B584_60::BIG n);
+
+/**	@brief Initialise structure for multi-pairing
+ *
+	@param r FP48 array, to be initialised to 1
+
+ */
+extern void PAIR_initmp(BLS48581::FP48 r[]);
+
+
+/**	@brief Miller loop
+ *
+ 	@param res FP48 result
+	@param r FP48 precomputed array of accumulated line functions
+
+ */
+extern void PAIR_miller(BLS48581::FP48 *res, BLS48581::FP48 r[]);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/pair_BLS12381.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/pair_BLS12381.h
new file mode 100644
index 0000000..cc610c4
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/pair_BLS12381.h
@@ -0,0 +1,183 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef PAIR_BLS12381_H
+#define PAIR_BLS12381_H
+
+#include "fp12_BLS12381.h"
+#include "ecp2_BLS12381.h"
+#include "ecp_BLS12381.h"
+
+using namespace core;
+
+namespace BLS12381 {
+/* Pairing constants */
+
+extern const B384_58::BIG CURVE_Bnx; /**< BN curve x parameter */
+extern const B384_58::BIG CURVE_Cru; /**< BN curve Cube Root of Unity */
+
+extern const B384_58::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B384_58::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B384_58::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B384_58::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+/* Pairing function prototypes */
+
+
+/**	@brief Precompute line functions details for fixed G2 value
+ *
+	@param T array of precomputed FP4 partial line functions
+	@param GV a fixed ECP2 instance
+ */
+extern void PAIR_precomp(BLS12381::FP4 T[], ECP2* GV);
+
+/**	@brief Compute line functions for n-pairing
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param PV ECP2 instance, an element of G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another(BLS12381::FP12 r[], ECP2* PV, ECP* QV);
+
+
+/**	@brief Compute line functions for n-pairing, assuming precomputation on G2
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param T array contains precomputed partial line fucntions from G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another_pc(BLS12381::FP12 r[], BLS12381::FP4 T[], ECP *QV);
+
+
+
+/**	@brief Calculate Miller loop for Optimal ATE pairing e(P,Q)
+ *
+	@param r FP12 result of the pairing calculation e(P,Q)
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+
+ */
+extern void PAIR_ate(BLS12381::FP12 *r, ECP2 *P, ECP *Q);
+/**	@brief Calculate Miller loop for Optimal ATE double-pairing e(P,Q).e(R,S)
+ *
+	Faster than calculating two separate pairings
+	@param r FP12 result of the pairing calculation e(P,Q).e(R,S), an element of GT
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+	@param R ECP2 instance, an element of G2
+	@param S ECP instance, an element of G1
+ */
+extern void PAIR_double_ate(BLS12381::FP12 *r, ECP2 *P, ECP *Q, ECP2 *R, ECP *S);
+/**	@brief Final exponentiation of pairing, converts output of Miller loop to element in GT
+ *
+	Here p is the internal modulus, and r is the group order
+	@param x FP12, on exit = x^((p^12-1)/r)
+ */
+extern void PAIR_fexp(BLS12381::FP12 *x);
+/**	@brief Fast point multiplication of a member of the group G1 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param Q ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G1mul(ECP *Q, B384_58::BIG b);
+/**	@brief Fast point multiplication of a member of the group G2 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param P ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G2mul(ECP2 *P, B384_58::BIG b);
+
+
+
+/**	@brief Fast raising of a member of GT to a BIG power
+ *
+	May exploit endomorphism for speed.
+	@param x FP12 member of GT.
+	@param b BIG exponent
+
+ */
+extern void PAIR_GTpow(BLS12381::FP12 *x, B384_58::BIG b);
+
+
+/**	@brief Tests ECP for membership of G1
+ *
+	@param P ECP member of G1
+	@return true or false
+
+ */
+extern int PAIR_G1member(BLS12381::ECP *P);
+
+/**	@brief Tests ECP2 for membership of G2
+ *
+	@param P ECP2 member of G2
+	@return true or false
+
+ */
+extern int PAIR_G2member(BLS12381::ECP2 *P);
+
+/**	@brief Tests FP12 for membership of cyclotomic sub-group
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTcyclotomic(BLS12381::FP12 *x);
+
+/**	@brief Tests FP12 for membership of GT
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTmember(BLS12381::FP12 *x);
+
+/**	@brief Prepare Ate parameter
+ *
+	@param n BIG parameter
+	@param n3 BIG paramter = 3*n
+	@return number of nits in n3
+
+ */
+extern int PAIR_nbits(B384_58::BIG n3, B384_58::BIG n);
+
+/**	@brief Initialise structure for multi-pairing
+ *
+	@param r FP12 array, to be initialised to 1
+
+ */
+extern void PAIR_initmp(BLS12381::FP12 r[]);
+
+
+/**	@brief Miller loop
+ *
+ 	@param res FP12 result
+	@param r FP12 precomputed array of accumulated line functions
+
+ */
+extern void PAIR_miller(BLS12381::FP12 *res, BLS12381::FP12 r[]);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/pair_BLS12383.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/pair_BLS12383.h
new file mode 100644
index 0000000..be751af
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/pair_BLS12383.h
@@ -0,0 +1,183 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef PAIR_BLS12383_H
+#define PAIR_BLS12383_H
+
+#include "fp12_BLS12383.h"
+#include "ecp2_BLS12383.h"
+#include "ecp_BLS12383.h"
+
+using namespace core;
+
+namespace BLS12383 {
+/* Pairing constants */
+
+extern const B384_58::BIG CURVE_Bnx; /**< BN curve x parameter */
+extern const B384_58::BIG CURVE_Cru; /**< BN curve Cube Root of Unity */
+
+extern const B384_58::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B384_58::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B384_58::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B384_58::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+/* Pairing function prototypes */
+
+
+/**	@brief Precompute line functions details for fixed G2 value
+ *
+	@param T array of precomputed FP4 partial line functions
+	@param GV a fixed ECP2 instance
+ */
+extern void PAIR_precomp(BLS12383::FP4 T[], ECP2* GV);
+
+/**	@brief Compute line functions for n-pairing
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param PV ECP2 instance, an element of G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another(BLS12383::FP12 r[], ECP2* PV, ECP* QV);
+
+
+/**	@brief Compute line functions for n-pairing, assuming precomputation on G2
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param T array contains precomputed partial line fucntions from G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another_pc(BLS12383::FP12 r[], BLS12383::FP4 T[], ECP *QV);
+
+
+
+/**	@brief Calculate Miller loop for Optimal ATE pairing e(P,Q)
+ *
+	@param r FP12 result of the pairing calculation e(P,Q)
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+
+ */
+extern void PAIR_ate(BLS12383::FP12 *r, ECP2 *P, ECP *Q);
+/**	@brief Calculate Miller loop for Optimal ATE double-pairing e(P,Q).e(R,S)
+ *
+	Faster than calculating two separate pairings
+	@param r FP12 result of the pairing calculation e(P,Q).e(R,S), an element of GT
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+	@param R ECP2 instance, an element of G2
+	@param S ECP instance, an element of G1
+ */
+extern void PAIR_double_ate(BLS12383::FP12 *r, ECP2 *P, ECP *Q, ECP2 *R, ECP *S);
+/**	@brief Final exponentiation of pairing, converts output of Miller loop to element in GT
+ *
+	Here p is the internal modulus, and r is the group order
+	@param x FP12, on exit = x^((p^12-1)/r)
+ */
+extern void PAIR_fexp(BLS12383::FP12 *x);
+/**	@brief Fast point multiplication of a member of the group G1 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param Q ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G1mul(ECP *Q, B384_58::BIG b);
+/**	@brief Fast point multiplication of a member of the group G2 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param P ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G2mul(ECP2 *P, B384_58::BIG b);
+
+
+
+/**	@brief Fast raising of a member of GT to a BIG power
+ *
+	May exploit endomorphism for speed.
+	@param x FP12 member of GT.
+	@param b BIG exponent
+
+ */
+extern void PAIR_GTpow(BLS12383::FP12 *x, B384_58::BIG b);
+
+
+/**	@brief Tests ECP for membership of G1
+ *
+	@param P ECP member of G1
+	@return true or false
+
+ */
+extern int PAIR_G1member(BLS12383::ECP *P);
+
+/**	@brief Tests ECP2 for membership of G2
+ *
+	@param P ECP2 member of G2
+	@return true or false
+
+ */
+extern int PAIR_G2member(BLS12383::ECP2 *P);
+
+/**	@brief Tests FP12 for membership of cyclotomic sub-group
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTcyclotomic(BLS12383::FP12 *x);
+
+/**	@brief Tests FP12 for membership of GT
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTmember(BLS12383::FP12 *x);
+
+/**	@brief Prepare Ate parameter
+ *
+	@param n BIG parameter
+	@param n3 BIG paramter = 3*n
+	@return number of nits in n3
+
+ */
+extern int PAIR_nbits(B384_58::BIG n3, B384_58::BIG n);
+
+/**	@brief Initialise structure for multi-pairing
+ *
+	@param r FP12 array, to be initialised to 1
+
+ */
+extern void PAIR_initmp(BLS12383::FP12 r[]);
+
+
+/**	@brief Miller loop
+ *
+ 	@param res FP12 result
+	@param r FP12 precomputed array of accumulated line functions
+
+ */
+extern void PAIR_miller(BLS12383::FP12 *res, BLS12383::FP12 r[]);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/pair_BLS12443.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/pair_BLS12443.h
new file mode 100644
index 0000000..ace34c4
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/pair_BLS12443.h
@@ -0,0 +1,183 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef PAIR_BLS12443_H
+#define PAIR_BLS12443_H
+
+#include "fp12_BLS12443.h"
+#include "ecp2_BLS12443.h"
+#include "ecp_BLS12443.h"
+
+using namespace core;
+
+namespace BLS12443 {
+/* Pairing constants */
+
+extern const B448_60::BIG CURVE_Bnx; /**< BN curve x parameter */
+extern const B448_60::BIG CURVE_Cru; /**< BN curve Cube Root of Unity */
+
+extern const B448_60::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B448_60::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B448_60::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B448_60::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+/* Pairing function prototypes */
+
+
+/**	@brief Precompute line functions details for fixed G2 value
+ *
+	@param T array of precomputed FP4 partial line functions
+	@param GV a fixed ECP2 instance
+ */
+extern void PAIR_precomp(BLS12443::FP4 T[], ECP2* GV);
+
+/**	@brief Compute line functions for n-pairing
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param PV ECP2 instance, an element of G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another(BLS12443::FP12 r[], ECP2* PV, ECP* QV);
+
+
+/**	@brief Compute line functions for n-pairing, assuming precomputation on G2
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param T array contains precomputed partial line fucntions from G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another_pc(BLS12443::FP12 r[], BLS12443::FP4 T[], ECP *QV);
+
+
+
+/**	@brief Calculate Miller loop for Optimal ATE pairing e(P,Q)
+ *
+	@param r FP12 result of the pairing calculation e(P,Q)
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+
+ */
+extern void PAIR_ate(BLS12443::FP12 *r, ECP2 *P, ECP *Q);
+/**	@brief Calculate Miller loop for Optimal ATE double-pairing e(P,Q).e(R,S)
+ *
+	Faster than calculating two separate pairings
+	@param r FP12 result of the pairing calculation e(P,Q).e(R,S), an element of GT
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+	@param R ECP2 instance, an element of G2
+	@param S ECP instance, an element of G1
+ */
+extern void PAIR_double_ate(BLS12443::FP12 *r, ECP2 *P, ECP *Q, ECP2 *R, ECP *S);
+/**	@brief Final exponentiation of pairing, converts output of Miller loop to element in GT
+ *
+	Here p is the internal modulus, and r is the group order
+	@param x FP12, on exit = x^((p^12-1)/r)
+ */
+extern void PAIR_fexp(BLS12443::FP12 *x);
+/**	@brief Fast point multiplication of a member of the group G1 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param Q ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G1mul(ECP *Q, B448_60::BIG b);
+/**	@brief Fast point multiplication of a member of the group G2 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param P ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G2mul(ECP2 *P, B448_60::BIG b);
+
+
+
+/**	@brief Fast raising of a member of GT to a BIG power
+ *
+	May exploit endomorphism for speed.
+	@param x FP12 member of GT.
+	@param b BIG exponent
+
+ */
+extern void PAIR_GTpow(BLS12443::FP12 *x, B448_60::BIG b);
+
+
+/**	@brief Tests ECP for membership of G1
+ *
+	@param P ECP member of G1
+	@return true or false
+
+ */
+extern int PAIR_G1member(BLS12443::ECP *P);
+
+/**	@brief Tests ECP2 for membership of G2
+ *
+	@param P ECP2 member of G2
+	@return true or false
+
+ */
+extern int PAIR_G2member(BLS12443::ECP2 *P);
+
+/**	@brief Tests FP12 for membership of cyclotomic sub-group
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTcyclotomic(BLS12443::FP12 *x);
+
+/**	@brief Tests FP12 for membership of GT
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTmember(BLS12443::FP12 *x);
+
+/**	@brief Prepare Ate parameter
+ *
+	@param n BIG parameter
+	@param n3 BIG paramter = 3*n
+	@return number of nits in n3
+
+ */
+extern int PAIR_nbits(B448_60::BIG n3, B448_60::BIG n);
+
+/**	@brief Initialise structure for multi-pairing
+ *
+	@param r FP12 array, to be initialised to 1
+
+ */
+extern void PAIR_initmp(BLS12443::FP12 r[]);
+
+
+/**	@brief Miller loop
+ *
+ 	@param res FP12 result
+	@param r FP12 precomputed array of accumulated line functions
+
+ */
+extern void PAIR_miller(BLS12443::FP12 *res, BLS12443::FP12 r[]);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/pair_BLS12461.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/pair_BLS12461.h
new file mode 100644
index 0000000..9fa4c97
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/pair_BLS12461.h
@@ -0,0 +1,183 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef PAIR_BLS12461_H
+#define PAIR_BLS12461_H
+
+#include "fp12_BLS12461.h"
+#include "ecp2_BLS12461.h"
+#include "ecp_BLS12461.h"
+
+using namespace core;
+
+namespace BLS12461 {
+/* Pairing constants */
+
+extern const B464_60::BIG CURVE_Bnx; /**< BN curve x parameter */
+extern const B464_60::BIG CURVE_Cru; /**< BN curve Cube Root of Unity */
+
+extern const B464_60::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B464_60::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B464_60::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B464_60::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+/* Pairing function prototypes */
+
+
+/**	@brief Precompute line functions details for fixed G2 value
+ *
+	@param T array of precomputed FP4 partial line functions
+	@param GV a fixed ECP2 instance
+ */
+extern void PAIR_precomp(BLS12461::FP4 T[], ECP2* GV);
+
+/**	@brief Compute line functions for n-pairing
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param PV ECP2 instance, an element of G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another(BLS12461::FP12 r[], ECP2* PV, ECP* QV);
+
+
+/**	@brief Compute line functions for n-pairing, assuming precomputation on G2
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param T array contains precomputed partial line fucntions from G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another_pc(BLS12461::FP12 r[], BLS12461::FP4 T[], ECP *QV);
+
+
+
+/**	@brief Calculate Miller loop for Optimal ATE pairing e(P,Q)
+ *
+	@param r FP12 result of the pairing calculation e(P,Q)
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+
+ */
+extern void PAIR_ate(BLS12461::FP12 *r, ECP2 *P, ECP *Q);
+/**	@brief Calculate Miller loop for Optimal ATE double-pairing e(P,Q).e(R,S)
+ *
+	Faster than calculating two separate pairings
+	@param r FP12 result of the pairing calculation e(P,Q).e(R,S), an element of GT
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+	@param R ECP2 instance, an element of G2
+	@param S ECP instance, an element of G1
+ */
+extern void PAIR_double_ate(BLS12461::FP12 *r, ECP2 *P, ECP *Q, ECP2 *R, ECP *S);
+/**	@brief Final exponentiation of pairing, converts output of Miller loop to element in GT
+ *
+	Here p is the internal modulus, and r is the group order
+	@param x FP12, on exit = x^((p^12-1)/r)
+ */
+extern void PAIR_fexp(BLS12461::FP12 *x);
+/**	@brief Fast point multiplication of a member of the group G1 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param Q ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G1mul(ECP *Q, B464_60::BIG b);
+/**	@brief Fast point multiplication of a member of the group G2 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param P ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G2mul(ECP2 *P, B464_60::BIG b);
+
+
+
+/**	@brief Fast raising of a member of GT to a BIG power
+ *
+	May exploit endomorphism for speed.
+	@param x FP12 member of GT.
+	@param b BIG exponent
+
+ */
+extern void PAIR_GTpow(BLS12461::FP12 *x, B464_60::BIG b);
+
+
+/**	@brief Tests ECP for membership of G1
+ *
+	@param P ECP member of G1
+	@return true or false
+
+ */
+extern int PAIR_G1member(BLS12461::ECP *P);
+
+/**	@brief Tests ECP2 for membership of G2
+ *
+	@param P ECP2 member of G2
+	@return true or false
+
+ */
+extern int PAIR_G2member(BLS12461::ECP2 *P);
+
+/**	@brief Tests FP12 for membership of cyclotomic sub-group
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTcyclotomic(BLS12461::FP12 *x);
+
+/**	@brief Tests FP12 for membership of GT
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTmember(BLS12461::FP12 *x);
+
+/**	@brief Prepare Ate parameter
+ *
+	@param n BIG parameter
+	@param n3 BIG paramter = 3*n
+	@return number of nits in n3
+
+ */
+extern int PAIR_nbits(B464_60::BIG n3, B464_60::BIG n);
+
+/**	@brief Initialise structure for multi-pairing
+ *
+	@param r FP12 array, to be initialised to 1
+
+ */
+extern void PAIR_initmp(BLS12461::FP12 r[]);
+
+
+/**	@brief Miller loop
+ *
+ 	@param res FP12 result
+	@param r FP12 precomputed array of accumulated line functions
+
+ */
+extern void PAIR_miller(BLS12461::FP12 *res, BLS12461::FP12 r[]);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/pair_BN158.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/pair_BN158.h
new file mode 100644
index 0000000..8068aac
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/pair_BN158.h
@@ -0,0 +1,183 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef PAIR_BN158_H
+#define PAIR_BN158_H
+
+#include "fp12_BN158.h"
+#include "ecp2_BN158.h"
+#include "ecp_BN158.h"
+
+using namespace core;
+
+namespace BN158 {
+/* Pairing constants */
+
+extern const B160_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+extern const B160_56::BIG CURVE_Cru; /**< BN curve Cube Root of Unity */
+
+extern const B160_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B160_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B160_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B160_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+/* Pairing function prototypes */
+
+
+/**	@brief Precompute line functions details for fixed G2 value
+ *
+	@param T array of precomputed FP4 partial line functions
+	@param GV a fixed ECP2 instance
+ */
+extern void PAIR_precomp(BN158::FP4 T[], ECP2* GV);
+
+/**	@brief Compute line functions for n-pairing
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param PV ECP2 instance, an element of G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another(BN158::FP12 r[], ECP2* PV, ECP* QV);
+
+
+/**	@brief Compute line functions for n-pairing, assuming precomputation on G2
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param T array contains precomputed partial line fucntions from G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another_pc(BN158::FP12 r[], BN158::FP4 T[], ECP *QV);
+
+
+
+/**	@brief Calculate Miller loop for Optimal ATE pairing e(P,Q)
+ *
+	@param r FP12 result of the pairing calculation e(P,Q)
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+
+ */
+extern void PAIR_ate(BN158::FP12 *r, ECP2 *P, ECP *Q);
+/**	@brief Calculate Miller loop for Optimal ATE double-pairing e(P,Q).e(R,S)
+ *
+	Faster than calculating two separate pairings
+	@param r FP12 result of the pairing calculation e(P,Q).e(R,S), an element of GT
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+	@param R ECP2 instance, an element of G2
+	@param S ECP instance, an element of G1
+ */
+extern void PAIR_double_ate(BN158::FP12 *r, ECP2 *P, ECP *Q, ECP2 *R, ECP *S);
+/**	@brief Final exponentiation of pairing, converts output of Miller loop to element in GT
+ *
+	Here p is the internal modulus, and r is the group order
+	@param x FP12, on exit = x^((p^12-1)/r)
+ */
+extern void PAIR_fexp(BN158::FP12 *x);
+/**	@brief Fast point multiplication of a member of the group G1 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param Q ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G1mul(ECP *Q, B160_56::BIG b);
+/**	@brief Fast point multiplication of a member of the group G2 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param P ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G2mul(ECP2 *P, B160_56::BIG b);
+
+
+
+/**	@brief Fast raising of a member of GT to a BIG power
+ *
+	May exploit endomorphism for speed.
+	@param x FP12 member of GT.
+	@param b BIG exponent
+
+ */
+extern void PAIR_GTpow(BN158::FP12 *x, B160_56::BIG b);
+
+
+/**	@brief Tests ECP for membership of G1
+ *
+	@param P ECP member of G1
+	@return true or false
+
+ */
+extern int PAIR_G1member(BN158::ECP *P);
+
+/**	@brief Tests ECP2 for membership of G2
+ *
+	@param P ECP2 member of G2
+	@return true or false
+
+ */
+extern int PAIR_G2member(BN158::ECP2 *P);
+
+/**	@brief Tests FP12 for membership of cyclotomic sub-group
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTcyclotomic(BN158::FP12 *x);
+
+/**	@brief Tests FP12 for membership of GT
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTmember(BN158::FP12 *x);
+
+/**	@brief Prepare Ate parameter
+ *
+	@param n BIG parameter
+	@param n3 BIG paramter = 3*n
+	@return number of nits in n3
+
+ */
+extern int PAIR_nbits(B160_56::BIG n3, B160_56::BIG n);
+
+/**	@brief Initialise structure for multi-pairing
+ *
+	@param r FP12 array, to be initialised to 1
+
+ */
+extern void PAIR_initmp(BN158::FP12 r[]);
+
+
+/**	@brief Miller loop
+ *
+ 	@param res FP12 result
+	@param r FP12 precomputed array of accumulated line functions
+
+ */
+extern void PAIR_miller(BN158::FP12 *res, BN158::FP12 r[]);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/pair_BN254.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/pair_BN254.h
new file mode 100644
index 0000000..a7cee7f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/pair_BN254.h
@@ -0,0 +1,183 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef PAIR_BN254_H
+#define PAIR_BN254_H
+
+#include "fp12_BN254.h"
+#include "ecp2_BN254.h"
+#include "ecp_BN254.h"
+
+using namespace core;
+
+namespace BN254 {
+/* Pairing constants */
+
+extern const B256_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+extern const B256_56::BIG CURVE_Cru; /**< BN curve Cube Root of Unity */
+
+extern const B256_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+/* Pairing function prototypes */
+
+
+/**	@brief Precompute line functions details for fixed G2 value
+ *
+	@param T array of precomputed FP4 partial line functions
+	@param GV a fixed ECP2 instance
+ */
+extern void PAIR_precomp(BN254::FP4 T[], ECP2* GV);
+
+/**	@brief Compute line functions for n-pairing
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param PV ECP2 instance, an element of G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another(BN254::FP12 r[], ECP2* PV, ECP* QV);
+
+
+/**	@brief Compute line functions for n-pairing, assuming precomputation on G2
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param T array contains precomputed partial line fucntions from G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another_pc(BN254::FP12 r[], BN254::FP4 T[], ECP *QV);
+
+
+
+/**	@brief Calculate Miller loop for Optimal ATE pairing e(P,Q)
+ *
+	@param r FP12 result of the pairing calculation e(P,Q)
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+
+ */
+extern void PAIR_ate(BN254::FP12 *r, ECP2 *P, ECP *Q);
+/**	@brief Calculate Miller loop for Optimal ATE double-pairing e(P,Q).e(R,S)
+ *
+	Faster than calculating two separate pairings
+	@param r FP12 result of the pairing calculation e(P,Q).e(R,S), an element of GT
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+	@param R ECP2 instance, an element of G2
+	@param S ECP instance, an element of G1
+ */
+extern void PAIR_double_ate(BN254::FP12 *r, ECP2 *P, ECP *Q, ECP2 *R, ECP *S);
+/**	@brief Final exponentiation of pairing, converts output of Miller loop to element in GT
+ *
+	Here p is the internal modulus, and r is the group order
+	@param x FP12, on exit = x^((p^12-1)/r)
+ */
+extern void PAIR_fexp(BN254::FP12 *x);
+/**	@brief Fast point multiplication of a member of the group G1 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param Q ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G1mul(ECP *Q, B256_56::BIG b);
+/**	@brief Fast point multiplication of a member of the group G2 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param P ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G2mul(ECP2 *P, B256_56::BIG b);
+
+
+
+/**	@brief Fast raising of a member of GT to a BIG power
+ *
+	May exploit endomorphism for speed.
+	@param x FP12 member of GT.
+	@param b BIG exponent
+
+ */
+extern void PAIR_GTpow(BN254::FP12 *x, B256_56::BIG b);
+
+
+/**	@brief Tests ECP for membership of G1
+ *
+	@param P ECP member of G1
+	@return true or false
+
+ */
+extern int PAIR_G1member(BN254::ECP *P);
+
+/**	@brief Tests ECP2 for membership of G2
+ *
+	@param P ECP2 member of G2
+	@return true or false
+
+ */
+extern int PAIR_G2member(BN254::ECP2 *P);
+
+/**	@brief Tests FP12 for membership of cyclotomic sub-group
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTcyclotomic(BN254::FP12 *x);
+
+/**	@brief Tests FP12 for membership of GT
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTmember(BN254::FP12 *x);
+
+/**	@brief Prepare Ate parameter
+ *
+	@param n BIG parameter
+	@param n3 BIG paramter = 3*n
+	@return number of nits in n3
+
+ */
+extern int PAIR_nbits(B256_56::BIG n3, B256_56::BIG n);
+
+/**	@brief Initialise structure for multi-pairing
+ *
+	@param r FP12 array, to be initialised to 1
+
+ */
+extern void PAIR_initmp(BN254::FP12 r[]);
+
+
+/**	@brief Miller loop
+ *
+ 	@param res FP12 result
+	@param r FP12 precomputed array of accumulated line functions
+
+ */
+extern void PAIR_miller(BN254::FP12 *res, BN254::FP12 r[]);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/pair_BN254CX.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/pair_BN254CX.h
new file mode 100644
index 0000000..5f5a0ec
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/pair_BN254CX.h
@@ -0,0 +1,183 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef PAIR_BN254CX_H
+#define PAIR_BN254CX_H
+
+#include "fp12_BN254CX.h"
+#include "ecp2_BN254CX.h"
+#include "ecp_BN254CX.h"
+
+using namespace core;
+
+namespace BN254CX {
+/* Pairing constants */
+
+extern const B256_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+extern const B256_56::BIG CURVE_Cru; /**< BN curve Cube Root of Unity */
+
+extern const B256_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+/* Pairing function prototypes */
+
+
+/**	@brief Precompute line functions details for fixed G2 value
+ *
+	@param T array of precomputed FP4 partial line functions
+	@param GV a fixed ECP2 instance
+ */
+extern void PAIR_precomp(BN254CX::FP4 T[], ECP2* GV);
+
+/**	@brief Compute line functions for n-pairing
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param PV ECP2 instance, an element of G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another(BN254CX::FP12 r[], ECP2* PV, ECP* QV);
+
+
+/**	@brief Compute line functions for n-pairing, assuming precomputation on G2
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param T array contains precomputed partial line fucntions from G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another_pc(BN254CX::FP12 r[], BN254CX::FP4 T[], ECP *QV);
+
+
+
+/**	@brief Calculate Miller loop for Optimal ATE pairing e(P,Q)
+ *
+	@param r FP12 result of the pairing calculation e(P,Q)
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+
+ */
+extern void PAIR_ate(BN254CX::FP12 *r, ECP2 *P, ECP *Q);
+/**	@brief Calculate Miller loop for Optimal ATE double-pairing e(P,Q).e(R,S)
+ *
+	Faster than calculating two separate pairings
+	@param r FP12 result of the pairing calculation e(P,Q).e(R,S), an element of GT
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+	@param R ECP2 instance, an element of G2
+	@param S ECP instance, an element of G1
+ */
+extern void PAIR_double_ate(BN254CX::FP12 *r, ECP2 *P, ECP *Q, ECP2 *R, ECP *S);
+/**	@brief Final exponentiation of pairing, converts output of Miller loop to element in GT
+ *
+	Here p is the internal modulus, and r is the group order
+	@param x FP12, on exit = x^((p^12-1)/r)
+ */
+extern void PAIR_fexp(BN254CX::FP12 *x);
+/**	@brief Fast point multiplication of a member of the group G1 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param Q ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G1mul(ECP *Q, B256_56::BIG b);
+/**	@brief Fast point multiplication of a member of the group G2 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param P ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G2mul(ECP2 *P, B256_56::BIG b);
+
+
+
+/**	@brief Fast raising of a member of GT to a BIG power
+ *
+	May exploit endomorphism for speed.
+	@param x FP12 member of GT.
+	@param b BIG exponent
+
+ */
+extern void PAIR_GTpow(BN254CX::FP12 *x, B256_56::BIG b);
+
+
+/**	@brief Tests ECP for membership of G1
+ *
+	@param P ECP member of G1
+	@return true or false
+
+ */
+extern int PAIR_G1member(BN254CX::ECP *P);
+
+/**	@brief Tests ECP2 for membership of G2
+ *
+	@param P ECP2 member of G2
+	@return true or false
+
+ */
+extern int PAIR_G2member(BN254CX::ECP2 *P);
+
+/**	@brief Tests FP12 for membership of cyclotomic sub-group
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTcyclotomic(BN254CX::FP12 *x);
+
+/**	@brief Tests FP12 for membership of GT
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTmember(BN254CX::FP12 *x);
+
+/**	@brief Prepare Ate parameter
+ *
+	@param n BIG parameter
+	@param n3 BIG paramter = 3*n
+	@return number of nits in n3
+
+ */
+extern int PAIR_nbits(B256_56::BIG n3, B256_56::BIG n);
+
+/**	@brief Initialise structure for multi-pairing
+ *
+	@param r FP12 array, to be initialised to 1
+
+ */
+extern void PAIR_initmp(BN254CX::FP12 r[]);
+
+
+/**	@brief Miller loop
+ *
+ 	@param res FP12 result
+	@param r FP12 precomputed array of accumulated line functions
+
+ */
+extern void PAIR_miller(BN254CX::FP12 *res, BN254CX::FP12 r[]);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/pair_BN462.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/pair_BN462.h
new file mode 100644
index 0000000..8f83745
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/pair_BN462.h
@@ -0,0 +1,183 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef PAIR_BN462_H
+#define PAIR_BN462_H
+
+#include "fp12_BN462.h"
+#include "ecp2_BN462.h"
+#include "ecp_BN462.h"
+
+using namespace core;
+
+namespace BN462 {
+/* Pairing constants */
+
+extern const B464_60::BIG CURVE_Bnx; /**< BN curve x parameter */
+extern const B464_60::BIG CURVE_Cru; /**< BN curve Cube Root of Unity */
+
+extern const B464_60::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B464_60::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B464_60::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B464_60::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+/* Pairing function prototypes */
+
+
+/**	@brief Precompute line functions details for fixed G2 value
+ *
+	@param T array of precomputed FP4 partial line functions
+	@param GV a fixed ECP2 instance
+ */
+extern void PAIR_precomp(BN462::FP4 T[], ECP2* GV);
+
+/**	@brief Compute line functions for n-pairing
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param PV ECP2 instance, an element of G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another(BN462::FP12 r[], ECP2* PV, ECP* QV);
+
+
+/**	@brief Compute line functions for n-pairing, assuming precomputation on G2
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param T array contains precomputed partial line fucntions from G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another_pc(BN462::FP12 r[], BN462::FP4 T[], ECP *QV);
+
+
+
+/**	@brief Calculate Miller loop for Optimal ATE pairing e(P,Q)
+ *
+	@param r FP12 result of the pairing calculation e(P,Q)
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+
+ */
+extern void PAIR_ate(BN462::FP12 *r, ECP2 *P, ECP *Q);
+/**	@brief Calculate Miller loop for Optimal ATE double-pairing e(P,Q).e(R,S)
+ *
+	Faster than calculating two separate pairings
+	@param r FP12 result of the pairing calculation e(P,Q).e(R,S), an element of GT
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+	@param R ECP2 instance, an element of G2
+	@param S ECP instance, an element of G1
+ */
+extern void PAIR_double_ate(BN462::FP12 *r, ECP2 *P, ECP *Q, ECP2 *R, ECP *S);
+/**	@brief Final exponentiation of pairing, converts output of Miller loop to element in GT
+ *
+	Here p is the internal modulus, and r is the group order
+	@param x FP12, on exit = x^((p^12-1)/r)
+ */
+extern void PAIR_fexp(BN462::FP12 *x);
+/**	@brief Fast point multiplication of a member of the group G1 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param Q ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G1mul(ECP *Q, B464_60::BIG b);
+/**	@brief Fast point multiplication of a member of the group G2 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param P ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G2mul(ECP2 *P, B464_60::BIG b);
+
+
+
+/**	@brief Fast raising of a member of GT to a BIG power
+ *
+	May exploit endomorphism for speed.
+	@param x FP12 member of GT.
+	@param b BIG exponent
+
+ */
+extern void PAIR_GTpow(BN462::FP12 *x, B464_60::BIG b);
+
+
+/**	@brief Tests ECP for membership of G1
+ *
+	@param P ECP member of G1
+	@return true or false
+
+ */
+extern int PAIR_G1member(BN462::ECP *P);
+
+/**	@brief Tests ECP2 for membership of G2
+ *
+	@param P ECP2 member of G2
+	@return true or false
+
+ */
+extern int PAIR_G2member(BN462::ECP2 *P);
+
+/**	@brief Tests FP12 for membership of cyclotomic sub-group
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTcyclotomic(BN462::FP12 *x);
+
+/**	@brief Tests FP12 for membership of GT
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTmember(BN462::FP12 *x);
+
+/**	@brief Prepare Ate parameter
+ *
+	@param n BIG parameter
+	@param n3 BIG paramter = 3*n
+	@return number of nits in n3
+
+ */
+extern int PAIR_nbits(B464_60::BIG n3, B464_60::BIG n);
+
+/**	@brief Initialise structure for multi-pairing
+ *
+	@param r FP12 array, to be initialised to 1
+
+ */
+extern void PAIR_initmp(BN462::FP12 r[]);
+
+
+/**	@brief Miller loop
+ *
+ 	@param res FP12 result
+	@param r FP12 precomputed array of accumulated line functions
+
+ */
+extern void PAIR_miller(BN462::FP12 *res, BN462::FP12 r[]);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/pair_FP256BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/pair_FP256BN.h
new file mode 100644
index 0000000..ea5b589
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/pair_FP256BN.h
@@ -0,0 +1,183 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef PAIR_FP256BN_H
+#define PAIR_FP256BN_H
+
+#include "fp12_FP256BN.h"
+#include "ecp2_FP256BN.h"
+#include "ecp_FP256BN.h"
+
+using namespace core;
+
+namespace FP256BN {
+/* Pairing constants */
+
+extern const B256_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+extern const B256_56::BIG CURVE_Cru; /**< BN curve Cube Root of Unity */
+
+extern const B256_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+/* Pairing function prototypes */
+
+
+/**	@brief Precompute line functions details for fixed G2 value
+ *
+	@param T array of precomputed FP4 partial line functions
+	@param GV a fixed ECP2 instance
+ */
+extern void PAIR_precomp(FP256BN::FP4 T[], ECP2* GV);
+
+/**	@brief Compute line functions for n-pairing
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param PV ECP2 instance, an element of G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another(FP256BN::FP12 r[], ECP2* PV, ECP* QV);
+
+
+/**	@brief Compute line functions for n-pairing, assuming precomputation on G2
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param T array contains precomputed partial line fucntions from G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another_pc(FP256BN::FP12 r[], FP256BN::FP4 T[], ECP *QV);
+
+
+
+/**	@brief Calculate Miller loop for Optimal ATE pairing e(P,Q)
+ *
+	@param r FP12 result of the pairing calculation e(P,Q)
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+
+ */
+extern void PAIR_ate(FP256BN::FP12 *r, ECP2 *P, ECP *Q);
+/**	@brief Calculate Miller loop for Optimal ATE double-pairing e(P,Q).e(R,S)
+ *
+	Faster than calculating two separate pairings
+	@param r FP12 result of the pairing calculation e(P,Q).e(R,S), an element of GT
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+	@param R ECP2 instance, an element of G2
+	@param S ECP instance, an element of G1
+ */
+extern void PAIR_double_ate(FP256BN::FP12 *r, ECP2 *P, ECP *Q, ECP2 *R, ECP *S);
+/**	@brief Final exponentiation of pairing, converts output of Miller loop to element in GT
+ *
+	Here p is the internal modulus, and r is the group order
+	@param x FP12, on exit = x^((p^12-1)/r)
+ */
+extern void PAIR_fexp(FP256BN::FP12 *x);
+/**	@brief Fast point multiplication of a member of the group G1 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param Q ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G1mul(ECP *Q, B256_56::BIG b);
+/**	@brief Fast point multiplication of a member of the group G2 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param P ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G2mul(ECP2 *P, B256_56::BIG b);
+
+
+
+/**	@brief Fast raising of a member of GT to a BIG power
+ *
+	May exploit endomorphism for speed.
+	@param x FP12 member of GT.
+	@param b BIG exponent
+
+ */
+extern void PAIR_GTpow(FP256BN::FP12 *x, B256_56::BIG b);
+
+
+/**	@brief Tests ECP for membership of G1
+ *
+	@param P ECP member of G1
+	@return true or false
+
+ */
+extern int PAIR_G1member(FP256BN::ECP *P);
+
+/**	@brief Tests ECP2 for membership of G2
+ *
+	@param P ECP2 member of G2
+	@return true or false
+
+ */
+extern int PAIR_G2member(FP256BN::ECP2 *P);
+
+/**	@brief Tests FP12 for membership of cyclotomic sub-group
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTcyclotomic(FP256BN::FP12 *x);
+
+/**	@brief Tests FP12 for membership of GT
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTmember(FP256BN::FP12 *x);
+
+/**	@brief Prepare Ate parameter
+ *
+	@param n BIG parameter
+	@param n3 BIG paramter = 3*n
+	@return number of nits in n3
+
+ */
+extern int PAIR_nbits(B256_56::BIG n3, B256_56::BIG n);
+
+/**	@brief Initialise structure for multi-pairing
+ *
+	@param r FP12 array, to be initialised to 1
+
+ */
+extern void PAIR_initmp(FP256BN::FP12 r[]);
+
+
+/**	@brief Miller loop
+ *
+ 	@param res FP12 result
+	@param r FP12 precomputed array of accumulated line functions
+
+ */
+extern void PAIR_miller(FP256BN::FP12 *res, FP256BN::FP12 r[]);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/pair_FP512BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/pair_FP512BN.h
new file mode 100644
index 0000000..8de8e9f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/pair_FP512BN.h
@@ -0,0 +1,183 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef PAIR_FP512BN_H
+#define PAIR_FP512BN_H
+
+#include "fp12_FP512BN.h"
+#include "ecp2_FP512BN.h"
+#include "ecp_FP512BN.h"
+
+using namespace core;
+
+namespace FP512BN {
+/* Pairing constants */
+
+extern const B512_60::BIG CURVE_Bnx; /**< BN curve x parameter */
+extern const B512_60::BIG CURVE_Cru; /**< BN curve Cube Root of Unity */
+
+extern const B512_60::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B512_60::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B512_60::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B512_60::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+/* Pairing function prototypes */
+
+
+/**	@brief Precompute line functions details for fixed G2 value
+ *
+	@param T array of precomputed FP4 partial line functions
+	@param GV a fixed ECP2 instance
+ */
+extern void PAIR_precomp(FP512BN::FP4 T[], ECP2* GV);
+
+/**	@brief Compute line functions for n-pairing
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param PV ECP2 instance, an element of G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another(FP512BN::FP12 r[], ECP2* PV, ECP* QV);
+
+
+/**	@brief Compute line functions for n-pairing, assuming precomputation on G2
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param T array contains precomputed partial line fucntions from G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another_pc(FP512BN::FP12 r[], FP512BN::FP4 T[], ECP *QV);
+
+
+
+/**	@brief Calculate Miller loop for Optimal ATE pairing e(P,Q)
+ *
+	@param r FP12 result of the pairing calculation e(P,Q)
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+
+ */
+extern void PAIR_ate(FP512BN::FP12 *r, ECP2 *P, ECP *Q);
+/**	@brief Calculate Miller loop for Optimal ATE double-pairing e(P,Q).e(R,S)
+ *
+	Faster than calculating two separate pairings
+	@param r FP12 result of the pairing calculation e(P,Q).e(R,S), an element of GT
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+	@param R ECP2 instance, an element of G2
+	@param S ECP instance, an element of G1
+ */
+extern void PAIR_double_ate(FP512BN::FP12 *r, ECP2 *P, ECP *Q, ECP2 *R, ECP *S);
+/**	@brief Final exponentiation of pairing, converts output of Miller loop to element in GT
+ *
+	Here p is the internal modulus, and r is the group order
+	@param x FP12, on exit = x^((p^12-1)/r)
+ */
+extern void PAIR_fexp(FP512BN::FP12 *x);
+/**	@brief Fast point multiplication of a member of the group G1 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param Q ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G1mul(ECP *Q, B512_60::BIG b);
+/**	@brief Fast point multiplication of a member of the group G2 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param P ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G2mul(ECP2 *P, B512_60::BIG b);
+
+
+
+/**	@brief Fast raising of a member of GT to a BIG power
+ *
+	May exploit endomorphism for speed.
+	@param x FP12 member of GT.
+	@param b BIG exponent
+
+ */
+extern void PAIR_GTpow(FP512BN::FP12 *x, B512_60::BIG b);
+
+
+/**	@brief Tests ECP for membership of G1
+ *
+	@param P ECP member of G1
+	@return true or false
+
+ */
+extern int PAIR_G1member(FP512BN::ECP *P);
+
+/**	@brief Tests ECP2 for membership of G2
+ *
+	@param P ECP2 member of G2
+	@return true or false
+
+ */
+extern int PAIR_G2member(FP512BN::ECP2 *P);
+
+/**	@brief Tests FP12 for membership of cyclotomic sub-group
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTcyclotomic(FP512BN::FP12 *x);
+
+/**	@brief Tests FP12 for membership of GT
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTmember(FP512BN::FP12 *x);
+
+/**	@brief Prepare Ate parameter
+ *
+	@param n BIG parameter
+	@param n3 BIG paramter = 3*n
+	@return number of nits in n3
+
+ */
+extern int PAIR_nbits(B512_60::BIG n3, B512_60::BIG n);
+
+/**	@brief Initialise structure for multi-pairing
+ *
+	@param r FP12 array, to be initialised to 1
+
+ */
+extern void PAIR_initmp(FP512BN::FP12 r[]);
+
+
+/**	@brief Miller loop
+ *
+ 	@param res FP12 result
+	@param r FP12 precomputed array of accumulated line functions
+
+ */
+extern void PAIR_miller(FP512BN::FP12 *res, FP512BN::FP12 r[]);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/randapi.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/randapi.h
new file mode 100644
index 0000000..4038228
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/randapi.h
@@ -0,0 +1,43 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef RANDOM_H
+#define RANDOM_H
+
+#include "core.h"
+
+namespace core {
+
+/** @brief Initialise a random number generator
+ *
+    @param R is a pointer to a cryptographically secure random number generator
+    @param S is an input truly random seed value
+ */
+extern void CREATE_CSPRNG(csprng *R, octet *S);
+/** @brief Kill a random number generator
+ *
+    Deletes all internal state
+    @param R is a pointer to a cryptographically secure random number generator
+ */
+extern void KILL_CSPRNG(csprng *R);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/rsa.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/rsa.h
new file mode 100644
index 0000000..334f18e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/rsa.h
@@ -0,0 +1,138 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file rsa.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief RSA Header file for implementation of RSA protocol
+ *
+ * declares functions
+ *
+ */
+
+#ifndef RSA_WWW_H
+#define RSA_WWW_H
+
+#include "ff_WWW.h"
+//#include "rsa_support.h"
+
+using namespace core;
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+#define HASH_TYPE_RSA_WWW SHA256 /**< Chosen Hash algorithm */
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define RFS_WWW MODBYTES_XXX*FFLEN_WWW /**< RSA Public Key Size in bytes */
+
+
+namespace WWW {
+
+/**
+    @brief Integer Factorisation Public Key
+*/
+
+typedef struct
+{
+    sign32 e;     /**< RSA exponent (typically 65537) */
+    XXX::BIG n[FFLEN_WWW]; /**< An array of BIGs to store public key */
+} rsa_public_key;
+
+/**
+    @brief Integer Factorisation Private Key
+*/
+
+typedef struct
+{
+    XXX::BIG p[FFLEN_WWW / 2]; /**< secret prime p  */
+    XXX::BIG q[FFLEN_WWW / 2]; /**< secret prime q  */
+    XXX::BIG dp[FFLEN_WWW / 2]; /**< decrypting exponent mod (p-1)  */
+    XXX::BIG dq[FFLEN_WWW / 2]; /**< decrypting exponent mod (q-1)  */
+    XXX::BIG c[FFLEN_WWW / 2]; /**< 1/p mod q */
+} rsa_private_key;
+
+
+/** @brief RSA Private KEy from OpenSSL 
+ *
+    @param P Input prime number
+    @param Q Input prime number
+    @param DP Input 1/e mod p-1
+    @param DQ Input 1/e mod q-1
+    @param C Input 1/p mod q
+    @param PRIV the output RSA private key
+ */
+extern void RSA_PRIVATE_KEY_FROM_OPENSSL(octet *P,octet* Q,octet *DP,octet *DQ,octet *C,rsa_private_key *PRIV);
+
+/** @brief RSA Key Pair from OpenSSL 
+ *
+    @param e the encryption exponent
+    @param P Input prime number
+    @param Q Input prime number
+    @param DP Input 1/e mod p-1
+    @param DQ Input 1/e mod q-1
+    @param C Input 1/p mod q
+    @param PRIV the output RSA private key
+    @param PUB the output RSA public key
+ */
+extern void RSA_KEY_PAIR_FROM_OPENSSL(sign32 e,octet *P,octet* Q,octet *DP,octet *DQ,octet *C,rsa_private_key *PRIV,rsa_public_key *PUB);
+
+/** @brief RSA Key Pair Generator
+ *
+    @param R is a pointer to a cryptographically secure random number generator
+    @param e the encryption exponent
+    @param PRIV the output RSA private key
+    @param PUB the output RSA public key
+    @param P Input prime number. Used when R is equal to NULL for testing
+    @param Q Input prime number. Used when R is equal to NULL for testing
+ */
+extern void RSA_KEY_PAIR(csprng *R, sign32 e, rsa_private_key* PRIV, rsa_public_key* PUB, octet *P, octet* Q);
+
+/** @brief RSA encryption of suitably padded plaintext
+ *
+    @param PUB the input RSA public key
+    @param F is input padded message
+    @param G is the output ciphertext
+ */
+extern void RSA_ENCRYPT(rsa_public_key* PUB, octet *F, octet *G);
+/** @brief RSA decryption of ciphertext
+ *
+    @param PRIV the input RSA private key
+    @param G is the input ciphertext
+    @param F is output plaintext (requires unpadding)
+
+ */
+extern void RSA_DECRYPT(rsa_private_key* PRIV, octet *G, octet *F);
+/** @brief Destroy an RSA private Key
+ *
+    @param PRIV the input RSA private key. Destroyed on output.
+ */
+extern void RSA_PRIVATE_KEY_KILL(rsa_private_key *PRIV);
+/** @brief Populates an RSA public key from an octet string
+ *
+    Creates RSA public key from big-endian base 256 form.
+    @param x FF instance to be created from an octet string
+    @param S input octet string
+ */
+extern void RSA_fromOctet(XXX::BIG *x, octet *S);
+}
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/rsa_RSA2048.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/rsa_RSA2048.h
new file mode 100644
index 0000000..77600f1
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/rsa_RSA2048.h
@@ -0,0 +1,138 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file rsa.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief RSA Header file for implementation of RSA protocol
+ *
+ * declares functions
+ *
+ */
+
+#ifndef RSA_RSA2048_H
+#define RSA_RSA2048_H
+
+#include "ff_RSA2048.h"
+//#include "rsa_support.h"
+
+using namespace core;
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+#define HASH_TYPE_RSA_RSA2048 SHA256 /**< Chosen Hash algorithm */
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define RFS_RSA2048 MODBYTES_B512_60*FFLEN_RSA2048 /**< RSA Public Key Size in bytes */
+
+
+namespace RSA2048 {
+
+/**
+    @brief Integer Factorisation Public Key
+*/
+
+typedef struct
+{
+    sign32 e;     /**< RSA exponent (typically 65537) */
+    B512_60::BIG n[FFLEN_RSA2048]; /**< An array of BIGs to store public key */
+} rsa_public_key;
+
+/**
+    @brief Integer Factorisation Private Key
+*/
+
+typedef struct
+{
+    B512_60::BIG p[FFLEN_RSA2048 / 2]; /**< secret prime p  */
+    B512_60::BIG q[FFLEN_RSA2048 / 2]; /**< secret prime q  */
+    B512_60::BIG dp[FFLEN_RSA2048 / 2]; /**< decrypting exponent mod (p-1)  */
+    B512_60::BIG dq[FFLEN_RSA2048 / 2]; /**< decrypting exponent mod (q-1)  */
+    B512_60::BIG c[FFLEN_RSA2048 / 2]; /**< 1/p mod q */
+} rsa_private_key;
+
+
+/** @brief RSA Private KEy from OpenSSL 
+ *
+    @param P Input prime number
+    @param Q Input prime number
+    @param DP Input 1/e mod p-1
+    @param DQ Input 1/e mod q-1
+    @param C Input 1/p mod q
+    @param PRIV the output RSA private key
+ */
+extern void RSA_PRIVATE_KEY_FROM_OPENSSL(octet *P,octet* Q,octet *DP,octet *DQ,octet *C,rsa_private_key *PRIV);
+
+/** @brief RSA Key Pair from OpenSSL 
+ *
+    @param e the encryption exponent
+    @param P Input prime number
+    @param Q Input prime number
+    @param DP Input 1/e mod p-1
+    @param DQ Input 1/e mod q-1
+    @param C Input 1/p mod q
+    @param PRIV the output RSA private key
+    @param PUB the output RSA public key
+ */
+extern void RSA_KEY_PAIR_FROM_OPENSSL(sign32 e,octet *P,octet* Q,octet *DP,octet *DQ,octet *C,rsa_private_key *PRIV,rsa_public_key *PUB);
+
+/** @brief RSA Key Pair Generator
+ *
+    @param R is a pointer to a cryptographically secure random number generator
+    @param e the encryption exponent
+    @param PRIV the output RSA private key
+    @param PUB the output RSA public key
+    @param P Input prime number. Used when R is equal to NULL for testing
+    @param Q Input prime number. Used when R is equal to NULL for testing
+ */
+extern void RSA_KEY_PAIR(csprng *R, sign32 e, rsa_private_key* PRIV, rsa_public_key* PUB, octet *P, octet* Q);
+
+/** @brief RSA encryption of suitably padded plaintext
+ *
+    @param PUB the input RSA public key
+    @param F is input padded message
+    @param G is the output ciphertext
+ */
+extern void RSA_ENCRYPT(rsa_public_key* PUB, octet *F, octet *G);
+/** @brief RSA decryption of ciphertext
+ *
+    @param PRIV the input RSA private key
+    @param G is the input ciphertext
+    @param F is output plaintext (requires unpadding)
+
+ */
+extern void RSA_DECRYPT(rsa_private_key* PRIV, octet *G, octet *F);
+/** @brief Destroy an RSA private Key
+ *
+    @param PRIV the input RSA private key. Destroyed on output.
+ */
+extern void RSA_PRIVATE_KEY_KILL(rsa_private_key *PRIV);
+/** @brief Populates an RSA public key from an octet string
+ *
+    Creates RSA public key from big-endian base 256 form.
+    @param x FF instance to be created from an octet string
+    @param S input octet string
+ */
+extern void RSA_fromOctet(B512_60::BIG *x, octet *S);
+}
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/rsa_RSA3072.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/rsa_RSA3072.h
new file mode 100644
index 0000000..4bf0658
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/rsa_RSA3072.h
@@ -0,0 +1,138 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file rsa.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief RSA Header file for implementation of RSA protocol
+ *
+ * declares functions
+ *
+ */
+
+#ifndef RSA_RSA3072_H
+#define RSA_RSA3072_H
+
+#include "ff_RSA3072.h"
+//#include "rsa_support.h"
+
+using namespace core;
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+#define HASH_TYPE_RSA_RSA3072 SHA256 /**< Chosen Hash algorithm */
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define RFS_RSA3072 MODBYTES_B384_56*FFLEN_RSA3072 /**< RSA Public Key Size in bytes */
+
+
+namespace RSA3072 {
+
+/**
+    @brief Integer Factorisation Public Key
+*/
+
+typedef struct
+{
+    sign32 e;     /**< RSA exponent (typically 65537) */
+    B384_56::BIG n[FFLEN_RSA3072]; /**< An array of BIGs to store public key */
+} rsa_public_key;
+
+/**
+    @brief Integer Factorisation Private Key
+*/
+
+typedef struct
+{
+    B384_56::BIG p[FFLEN_RSA3072 / 2]; /**< secret prime p  */
+    B384_56::BIG q[FFLEN_RSA3072 / 2]; /**< secret prime q  */
+    B384_56::BIG dp[FFLEN_RSA3072 / 2]; /**< decrypting exponent mod (p-1)  */
+    B384_56::BIG dq[FFLEN_RSA3072 / 2]; /**< decrypting exponent mod (q-1)  */
+    B384_56::BIG c[FFLEN_RSA3072 / 2]; /**< 1/p mod q */
+} rsa_private_key;
+
+
+/** @brief RSA Private KEy from OpenSSL 
+ *
+    @param P Input prime number
+    @param Q Input prime number
+    @param DP Input 1/e mod p-1
+    @param DQ Input 1/e mod q-1
+    @param C Input 1/p mod q
+    @param PRIV the output RSA private key
+ */
+extern void RSA_PRIVATE_KEY_FROM_OPENSSL(octet *P,octet* Q,octet *DP,octet *DQ,octet *C,rsa_private_key *PRIV);
+
+/** @brief RSA Key Pair from OpenSSL 
+ *
+    @param e the encryption exponent
+    @param P Input prime number
+    @param Q Input prime number
+    @param DP Input 1/e mod p-1
+    @param DQ Input 1/e mod q-1
+    @param C Input 1/p mod q
+    @param PRIV the output RSA private key
+    @param PUB the output RSA public key
+ */
+extern void RSA_KEY_PAIR_FROM_OPENSSL(sign32 e,octet *P,octet* Q,octet *DP,octet *DQ,octet *C,rsa_private_key *PRIV,rsa_public_key *PUB);
+
+/** @brief RSA Key Pair Generator
+ *
+    @param R is a pointer to a cryptographically secure random number generator
+    @param e the encryption exponent
+    @param PRIV the output RSA private key
+    @param PUB the output RSA public key
+    @param P Input prime number. Used when R is equal to NULL for testing
+    @param Q Input prime number. Used when R is equal to NULL for testing
+ */
+extern void RSA_KEY_PAIR(csprng *R, sign32 e, rsa_private_key* PRIV, rsa_public_key* PUB, octet *P, octet* Q);
+
+/** @brief RSA encryption of suitably padded plaintext
+ *
+    @param PUB the input RSA public key
+    @param F is input padded message
+    @param G is the output ciphertext
+ */
+extern void RSA_ENCRYPT(rsa_public_key* PUB, octet *F, octet *G);
+/** @brief RSA decryption of ciphertext
+ *
+    @param PRIV the input RSA private key
+    @param G is the input ciphertext
+    @param F is output plaintext (requires unpadding)
+
+ */
+extern void RSA_DECRYPT(rsa_private_key* PRIV, octet *G, octet *F);
+/** @brief Destroy an RSA private Key
+ *
+    @param PRIV the input RSA private key. Destroyed on output.
+ */
+extern void RSA_PRIVATE_KEY_KILL(rsa_private_key *PRIV);
+/** @brief Populates an RSA public key from an octet string
+ *
+    Creates RSA public key from big-endian base 256 form.
+    @param x FF instance to be created from an octet string
+    @param S input octet string
+ */
+extern void RSA_fromOctet(B384_56::BIG *x, octet *S);
+}
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/rsa_RSA4096.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/rsa_RSA4096.h
new file mode 100644
index 0000000..093db57
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/rsa_RSA4096.h
@@ -0,0 +1,138 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file rsa.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief RSA Header file for implementation of RSA protocol
+ *
+ * declares functions
+ *
+ */
+
+#ifndef RSA_RSA4096_H
+#define RSA_RSA4096_H
+
+#include "ff_RSA4096.h"
+//#include "rsa_support.h"
+
+using namespace core;
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+#define HASH_TYPE_RSA_RSA4096 SHA256 /**< Chosen Hash algorithm */
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define RFS_RSA4096 MODBYTES_B512_60*FFLEN_RSA4096 /**< RSA Public Key Size in bytes */
+
+
+namespace RSA4096 {
+
+/**
+    @brief Integer Factorisation Public Key
+*/
+
+typedef struct
+{
+    sign32 e;     /**< RSA exponent (typically 65537) */
+    B512_60::BIG n[FFLEN_RSA4096]; /**< An array of BIGs to store public key */
+} rsa_public_key;
+
+/**
+    @brief Integer Factorisation Private Key
+*/
+
+typedef struct
+{
+    B512_60::BIG p[FFLEN_RSA4096 / 2]; /**< secret prime p  */
+    B512_60::BIG q[FFLEN_RSA4096 / 2]; /**< secret prime q  */
+    B512_60::BIG dp[FFLEN_RSA4096 / 2]; /**< decrypting exponent mod (p-1)  */
+    B512_60::BIG dq[FFLEN_RSA4096 / 2]; /**< decrypting exponent mod (q-1)  */
+    B512_60::BIG c[FFLEN_RSA4096 / 2]; /**< 1/p mod q */
+} rsa_private_key;
+
+
+/** @brief RSA Private KEy from OpenSSL 
+ *
+    @param P Input prime number
+    @param Q Input prime number
+    @param DP Input 1/e mod p-1
+    @param DQ Input 1/e mod q-1
+    @param C Input 1/p mod q
+    @param PRIV the output RSA private key
+ */
+extern void RSA_PRIVATE_KEY_FROM_OPENSSL(octet *P,octet* Q,octet *DP,octet *DQ,octet *C,rsa_private_key *PRIV);
+
+/** @brief RSA Key Pair from OpenSSL 
+ *
+    @param e the encryption exponent
+    @param P Input prime number
+    @param Q Input prime number
+    @param DP Input 1/e mod p-1
+    @param DQ Input 1/e mod q-1
+    @param C Input 1/p mod q
+    @param PRIV the output RSA private key
+    @param PUB the output RSA public key
+ */
+extern void RSA_KEY_PAIR_FROM_OPENSSL(sign32 e,octet *P,octet* Q,octet *DP,octet *DQ,octet *C,rsa_private_key *PRIV,rsa_public_key *PUB);
+
+/** @brief RSA Key Pair Generator
+ *
+    @param R is a pointer to a cryptographically secure random number generator
+    @param e the encryption exponent
+    @param PRIV the output RSA private key
+    @param PUB the output RSA public key
+    @param P Input prime number. Used when R is equal to NULL for testing
+    @param Q Input prime number. Used when R is equal to NULL for testing
+ */
+extern void RSA_KEY_PAIR(csprng *R, sign32 e, rsa_private_key* PRIV, rsa_public_key* PUB, octet *P, octet* Q);
+
+/** @brief RSA encryption of suitably padded plaintext
+ *
+    @param PUB the input RSA public key
+    @param F is input padded message
+    @param G is the output ciphertext
+ */
+extern void RSA_ENCRYPT(rsa_public_key* PUB, octet *F, octet *G);
+/** @brief RSA decryption of ciphertext
+ *
+    @param PRIV the input RSA private key
+    @param G is the input ciphertext
+    @param F is output plaintext (requires unpadding)
+
+ */
+extern void RSA_DECRYPT(rsa_private_key* PRIV, octet *G, octet *F);
+/** @brief Destroy an RSA private Key
+ *
+    @param PRIV the input RSA private key. Destroyed on output.
+ */
+extern void RSA_PRIVATE_KEY_KILL(rsa_private_key *PRIV);
+/** @brief Populates an RSA public key from an octet string
+ *
+    Creates RSA public key from big-endian base 256 form.
+    @param x FF instance to be created from an octet string
+    @param S input octet string
+ */
+extern void RSA_fromOctet(B512_60::BIG *x, octet *S);
+}
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/x509.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/x509.h
new file mode 100644
index 0000000..bcba4d3
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracl/includes/x509.h
@@ -0,0 +1,212 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* CORE x509 header file */
+
+/**
+ * @file x509.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 19th May 2015
+ * @brief X509 function Header File
+ *
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef X509_H
+#define X509_H
+
+// Supported Encryption Methods
+
+#define X509_ECC 1
+#define X509_RSA 2
+#define X509_ECD 3
+#define X509_PQ 4
+
+// Supported Hash functions
+
+#define X509_H256 2
+#define X509_H384 3
+#define X509_H512 4
+#define X509_SHAKE256 5
+
+// Supported Curves
+
+#define USE_NIST256 0    /**< For the NIST 256-bit standard curve - WEIERSTRASS only */
+#define USE_ED25519 1     /**< Bernstein's Modulus 2^255-19 - EDWARDS */
+#define USE_ED448 4     /**< Goldilocks Modulus Ed448 - EDWARDS */
+#define USE_BRAINPOOL 2  /**< For Brainpool 256-bit curve - WEIERSTRASS only */
+#define USE_ANSSI 3      /**< For French 256-bit standard curve - WEIERSTRASS only */
+#define USE_NIST384 10   /**< For the NIST 384-bit standard curve - WEIERSTRASS only */
+#define USE_NIST521 12   /**< For the NIST 521-bit standard curve - WEIERSTRASS only */
+
+using namespace core;
+
+extern octet X509_CN;  // Country Name
+extern octet X509_ON;  // organisation Name
+extern octet X509_EN;  // email
+extern octet X509_LN;  // local name
+extern octet X509_UN;  // Unit name (aka Organisation Unit OU)
+extern octet X509_MN;  // My Name (aka Common Name)
+extern octet X509_SN;  // State Name
+
+extern octet X509_AN;  // Alternate Name
+extern octet X509_KU;  // Key Usage
+extern octet X509_BC;  // Basic Constraints
+
+/**
+ * @brief Public key type
+ */
+typedef struct
+{
+    int type;  /**< signature type (ECC or RSA) */
+    int hash;  /**< hash type */
+    int curve; /**< elliptic curve used or RSA key length in bits  */
+} pktype;
+
+
+/* X.509 functions */
+
+/** @brief Extract private key
+ *
+	@param c an X.509 private key 
+	@param pk the extracted private key - for RSA octet = p|q|dp|dq|c, for ECC octet = k
+	@return private key type details 
+*/
+extern pktype X509_extract_private_key(octet *c,octet *pk);
+
+/** @brief Extract certificate signature
+ *
+	@param c an X.509 certificate
+	@param s the extracted signature
+	@return signature type details
+
+*/
+extern pktype X509_extract_cert_sig(octet *c, octet *s);
+/** @brief
+ *
+	@param sc a signed certificate
+	@param c the extracted certificate
+	@return 0 on failure
+*/
+extern int X509_extract_cert(octet *sc, octet *c);
+
+/** @brief
+ *
+	@param c an X.509 certificate
+	@param ptr pointer to ASN.1 raw public key
+	@return length of raw public key
+*/
+extern int X509_find_public_key(octet *c,int *ptr);
+
+/** @brief
+ *
+	@param c an ASN.1 encoded public key
+	@param key the extracted public key
+	@return indicator of public key type (ECC or RSA)
+*/
+extern pktype X509_get_public_key(octet *c,octet *key);
+
+/** @brief
+ *
+	@param c an X.509 certificate
+	@param k the extracted key
+	@return indicator of public key type (ECC or RSA)
+*/
+extern pktype X509_extract_public_key(octet *c, octet *k);
+/** @brief
+ *
+	@param c an X.509 certificate
+    @param len length of issuer field
+	@return 0 on failure, or pointer to issuer field in cert
+*/
+extern int X509_find_issuer(octet *c,int *len);
+/** @brief
+ *
+	@param c an X.509 certificate
+	@return 0 on failure, or pointer to validity field in cert
+*/
+extern int X509_find_validity(octet *c);
+/** @brief
+ *
+	@param c an X.509 certificate
+    @param len length of subject field
+	@return 0 on failure, or pointer to subject field in cert
+*/
+extern int X509_find_subject(octet *c,int *len);
+
+/** @brief
+ *
+	@param c an X.509 certificate
+	@return true if self-signed, else false
+*/
+extern int X509_self_signed(octet *c);
+
+/** @brief
+ *
+	@param c an X.509 certificate
+	@param S is OID of property we are looking for
+	@param s is a pointer to the section of interest in the cert
+	@param f is pointer to the length of the property
+	@return 0 on failure, or pointer to the property
+*/
+extern int X509_find_entity_property(octet *c, octet *S, int s, int *f);
+/** @brief
+ *
+	@param c an X.509 certificate
+	@param s is a pointer to the start of the validity field
+	@return 0 on failure, or pointer to the start date
+*/
+extern int X509_find_start_date(octet *c, int s);
+/** @brief
+ *
+	@param c an X.509 certificate
+	@param s is a pointer to the start of the validity field
+	@return 0 on failure, or pointer to the expiry date
+*/
+extern int X509_find_expiry_date(octet *c, int s);
+
+
+/** @brief
+ *
+	@param c an X.509 certificate
+	@return 0 on failure (or no extensions), or pointer to extensions field in cert
+*/
+extern int X509_find_extensions(octet *c);
+/** @brief
+ *
+	@param c an X.509 certificate
+	@param S is OID of particular extension we are looking for
+	@param s is a pointer to the section of interest in the cert
+	@param f is pointer to the length of the extension
+	@return 0 on failure, or pointer to the extension
+*/
+extern int X509_find_extension(octet *c, octet *S, int s, int *f);
+
+/** @brief
+ *
+	@param c an X.509 certificate
+    @param s is a pointer to certificate extension SubjectAltNames
+    @param name is a URL
+    @return 0 on failure, 1 if URL is in list of alt names
+*/
+extern int X509_find_alt_name(octet *c,int s,char *name);
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/core.a b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/core.a
new file mode 100644
index 0000000..533fa20
Binary files /dev/null and b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/core.a differ
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/.gitignore b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/.gitignore
new file mode 100644
index 0000000..2b5d52e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/.gitignore
@@ -0,0 +1,33 @@
+# Prerequisites
+*.d
+
+# Compiled Object files
+*.slo
+*.lo
+*.o
+*.obj
+
+# Precompiled Headers
+*.gch
+*.pch
+
+# Compiled Dynamic libraries
+*.so
+*.dylib
+*.dll
+
+# Fortran module files
+*.mod
+*.smod
+
+# Compiled Static libraries
+*.lai
+*.la
+*.a
+*.lib
+
+# Executables
+*.exe
+*.out
+*.app
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/aes.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/aes.cpp
new file mode 100644
index 0000000..9986370
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/aes.cpp
@@ -0,0 +1,803 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+
+/*
+ * Implementation of the NIST Advanced Ecryption Standard
+ *
+ * SU=m, SU is Stack Usage
+ */
+
+#include <stdlib.h>
+
+
+#include "arch.h"
+#include "core.h"
+
+using namespace core;
+
+/* this is fixed */
+#define NB 4
+
+/* Rotates 32-bit word left by 1, 2 or 3 byte  */
+
+#define ROTL8(x) (((x)<<8)|((x)>>24))
+#define ROTL16(x) (((x)<<16)|((x)>>16))
+#define ROTL24(x) (((x)<<24)|((x)>>8))
+
+static const uchar InCo[4] = {0xB, 0xD, 0x9, 0xE}; /* Inverse Coefficients */
+
+static const uchar ptab[] =
+{
+    1, 3, 5, 15, 17, 51, 85, 255, 26, 46, 114, 150, 161, 248, 19, 53,
+    95, 225, 56, 72, 216, 115, 149, 164, 247, 2, 6, 10, 30, 34, 102, 170,
+    229, 52, 92, 228, 55, 89, 235, 38, 106, 190, 217, 112, 144, 171, 230, 49,
+    83, 245, 4, 12, 20, 60, 68, 204, 79, 209, 104, 184, 211, 110, 178, 205,
+    76, 212, 103, 169, 224, 59, 77, 215, 98, 166, 241, 8, 24, 40, 120, 136,
+    131, 158, 185, 208, 107, 189, 220, 127, 129, 152, 179, 206, 73, 219, 118, 154,
+    181, 196, 87, 249, 16, 48, 80, 240, 11, 29, 39, 105, 187, 214, 97, 163,
+    254, 25, 43, 125, 135, 146, 173, 236, 47, 113, 147, 174, 233, 32, 96, 160,
+    251, 22, 58, 78, 210, 109, 183, 194, 93, 231, 50, 86, 250, 21, 63, 65,
+    195, 94, 226, 61, 71, 201, 64, 192, 91, 237, 44, 116, 156, 191, 218, 117,
+    159, 186, 213, 100, 172, 239, 42, 126, 130, 157, 188, 223, 122, 142, 137, 128,
+    155, 182, 193, 88, 232, 35, 101, 175, 234, 37, 111, 177, 200, 67, 197, 84,
+    252, 31, 33, 99, 165, 244, 7, 9, 27, 45, 119, 153, 176, 203, 70, 202,
+    69, 207, 74, 222, 121, 139, 134, 145, 168, 227, 62, 66, 198, 81, 243, 14,
+    18, 54, 90, 238, 41, 123, 141, 140, 143, 138, 133, 148, 167, 242, 13, 23,
+    57, 75, 221, 124, 132, 151, 162, 253, 28, 36, 108, 180, 199, 82, 246, 1
+};
+
+static const uchar ltab[] =
+{
+    0, 255, 25, 1, 50, 2, 26, 198, 75, 199, 27, 104, 51, 238, 223, 3,
+    100, 4, 224, 14, 52, 141, 129, 239, 76, 113, 8, 200, 248, 105, 28, 193,
+    125, 194, 29, 181, 249, 185, 39, 106, 77, 228, 166, 114, 154, 201, 9, 120,
+    101, 47, 138, 5, 33, 15, 225, 36, 18, 240, 130, 69, 53, 147, 218, 142,
+    150, 143, 219, 189, 54, 208, 206, 148, 19, 92, 210, 241, 64, 70, 131, 56,
+    102, 221, 253, 48, 191, 6, 139, 98, 179, 37, 226, 152, 34, 136, 145, 16,
+    126, 110, 72, 195, 163, 182, 30, 66, 58, 107, 40, 84, 250, 133, 61, 186,
+    43, 121, 10, 21, 155, 159, 94, 202, 78, 212, 172, 229, 243, 115, 167, 87,
+    175, 88, 168, 80, 244, 234, 214, 116, 79, 174, 233, 213, 231, 230, 173, 232,
+    44, 215, 117, 122, 235, 22, 11, 245, 89, 203, 95, 176, 156, 169, 81, 160,
+    127, 12, 246, 111, 23, 196, 73, 236, 216, 67, 31, 45, 164, 118, 123, 183,
+    204, 187, 62, 90, 251, 96, 177, 134, 59, 82, 161, 108, 170, 85, 41, 157,
+    151, 178, 135, 144, 97, 190, 220, 252, 188, 149, 207, 205, 55, 63, 91, 209,
+    83, 57, 132, 60, 65, 162, 109, 71, 20, 42, 158, 93, 86, 242, 211, 171,
+    68, 17, 146, 217, 35, 32, 46, 137, 180, 124, 184, 38, 119, 153, 227, 165,
+    103, 74, 237, 222, 197, 49, 254, 24, 13, 99, 140, 128, 192, 247, 112, 7
+};
+
+static const uchar fbsub[] =
+{
+    99, 124, 119, 123, 242, 107, 111, 197, 48, 1, 103, 43, 254, 215, 171, 118,
+    202, 130, 201, 125, 250, 89, 71, 240, 173, 212, 162, 175, 156, 164, 114, 192,
+    183, 253, 147, 38, 54, 63, 247, 204, 52, 165, 229, 241, 113, 216, 49, 21,
+    4, 199, 35, 195, 24, 150, 5, 154, 7, 18, 128, 226, 235, 39, 178, 117,
+    9, 131, 44, 26, 27, 110, 90, 160, 82, 59, 214, 179, 41, 227, 47, 132,
+    83, 209, 0, 237, 32, 252, 177, 91, 106, 203, 190, 57, 74, 76, 88, 207,
+    208, 239, 170, 251, 67, 77, 51, 133, 69, 249, 2, 127, 80, 60, 159, 168,
+    81, 163, 64, 143, 146, 157, 56, 245, 188, 182, 218, 33, 16, 255, 243, 210,
+    205, 12, 19, 236, 95, 151, 68, 23, 196, 167, 126, 61, 100, 93, 25, 115,
+    96, 129, 79, 220, 34, 42, 144, 136, 70, 238, 184, 20, 222, 94, 11, 219,
+    224, 50, 58, 10, 73, 6, 36, 92, 194, 211, 172, 98, 145, 149, 228, 121,
+    231, 200, 55, 109, 141, 213, 78, 169, 108, 86, 244, 234, 101, 122, 174, 8,
+    186, 120, 37, 46, 28, 166, 180, 198, 232, 221, 116, 31, 75, 189, 139, 138,
+    112, 62, 181, 102, 72, 3, 246, 14, 97, 53, 87, 185, 134, 193, 29, 158,
+    225, 248, 152, 17, 105, 217, 142, 148, 155, 30, 135, 233, 206, 85, 40, 223,
+    140, 161, 137, 13, 191, 230, 66, 104, 65, 153, 45, 15, 176, 84, 187, 22
+};
+
+static const uchar rbsub[] =
+{
+    82, 9, 106, 213, 48, 54, 165, 56, 191, 64, 163, 158, 129, 243, 215, 251,
+    124, 227, 57, 130, 155, 47, 255, 135, 52, 142, 67, 68, 196, 222, 233, 203,
+    84, 123, 148, 50, 166, 194, 35, 61, 238, 76, 149, 11, 66, 250, 195, 78,
+    8, 46, 161, 102, 40, 217, 36, 178, 118, 91, 162, 73, 109, 139, 209, 37,
+    114, 248, 246, 100, 134, 104, 152, 22, 212, 164, 92, 204, 93, 101, 182, 146,
+    108, 112, 72, 80, 253, 237, 185, 218, 94, 21, 70, 87, 167, 141, 157, 132,
+    144, 216, 171, 0, 140, 188, 211, 10, 247, 228, 88, 5, 184, 179, 69, 6,
+    208, 44, 30, 143, 202, 63, 15, 2, 193, 175, 189, 3, 1, 19, 138, 107,
+    58, 145, 17, 65, 79, 103, 220, 234, 151, 242, 207, 206, 240, 180, 230, 115,
+    150, 172, 116, 34, 231, 173, 53, 133, 226, 249, 55, 232, 28, 117, 223, 110,
+    71, 241, 26, 113, 29, 41, 197, 137, 111, 183, 98, 14, 170, 24, 190, 27,
+    252, 86, 62, 75, 198, 210, 121, 32, 154, 219, 192, 254, 120, 205, 90, 244,
+    31, 221, 168, 51, 136, 7, 199, 49, 177, 18, 16, 89, 39, 128, 236, 95,
+    96, 81, 127, 169, 25, 181, 74, 13, 45, 229, 122, 159, 147, 201, 156, 239,
+    160, 224, 59, 77, 174, 42, 245, 176, 200, 235, 187, 60, 131, 83, 153, 97,
+    23, 43, 4, 126, 186, 119, 214, 38, 225, 105, 20, 99, 85, 33, 12, 125
+};
+
+static const unsign32 rco[] =
+{1, 2, 4, 8, 16, 32, 64, 128, 27, 54, 108, 216, 171, 77, 154, 47};
+
+static const unsign32 ftable[] =
+{
+    0xa56363c6, 0x847c7cf8, 0x997777ee, 0x8d7b7bf6, 0xdf2f2ff, 0xbd6b6bd6,
+    0xb16f6fde, 0x54c5c591, 0x50303060, 0x3010102, 0xa96767ce, 0x7d2b2b56,
+    0x19fefee7, 0x62d7d7b5, 0xe6abab4d, 0x9a7676ec, 0x45caca8f, 0x9d82821f,
+    0x40c9c989, 0x877d7dfa, 0x15fafaef, 0xeb5959b2, 0xc947478e, 0xbf0f0fb,
+    0xecadad41, 0x67d4d4b3, 0xfda2a25f, 0xeaafaf45, 0xbf9c9c23, 0xf7a4a453,
+    0x967272e4, 0x5bc0c09b, 0xc2b7b775, 0x1cfdfde1, 0xae93933d, 0x6a26264c,
+    0x5a36366c, 0x413f3f7e, 0x2f7f7f5, 0x4fcccc83, 0x5c343468, 0xf4a5a551,
+    0x34e5e5d1, 0x8f1f1f9, 0x937171e2, 0x73d8d8ab, 0x53313162, 0x3f15152a,
+    0xc040408, 0x52c7c795, 0x65232346, 0x5ec3c39d, 0x28181830, 0xa1969637,
+    0xf05050a, 0xb59a9a2f, 0x907070e, 0x36121224, 0x9b80801b, 0x3de2e2df,
+    0x26ebebcd, 0x6927274e, 0xcdb2b27f, 0x9f7575ea, 0x1b090912, 0x9e83831d,
+    0x742c2c58, 0x2e1a1a34, 0x2d1b1b36, 0xb26e6edc, 0xee5a5ab4, 0xfba0a05b,
+    0xf65252a4, 0x4d3b3b76, 0x61d6d6b7, 0xceb3b37d, 0x7b292952, 0x3ee3e3dd,
+    0x712f2f5e, 0x97848413, 0xf55353a6, 0x68d1d1b9, 0x0, 0x2cededc1,
+    0x60202040, 0x1ffcfce3, 0xc8b1b179, 0xed5b5bb6, 0xbe6a6ad4, 0x46cbcb8d,
+    0xd9bebe67, 0x4b393972, 0xde4a4a94, 0xd44c4c98, 0xe85858b0, 0x4acfcf85,
+    0x6bd0d0bb, 0x2aefefc5, 0xe5aaaa4f, 0x16fbfbed, 0xc5434386, 0xd74d4d9a,
+    0x55333366, 0x94858511, 0xcf45458a, 0x10f9f9e9, 0x6020204, 0x817f7ffe,
+    0xf05050a0, 0x443c3c78, 0xba9f9f25, 0xe3a8a84b, 0xf35151a2, 0xfea3a35d,
+    0xc0404080, 0x8a8f8f05, 0xad92923f, 0xbc9d9d21, 0x48383870, 0x4f5f5f1,
+    0xdfbcbc63, 0xc1b6b677, 0x75dadaaf, 0x63212142, 0x30101020, 0x1affffe5,
+    0xef3f3fd, 0x6dd2d2bf, 0x4ccdcd81, 0x140c0c18, 0x35131326, 0x2fececc3,
+    0xe15f5fbe, 0xa2979735, 0xcc444488, 0x3917172e, 0x57c4c493, 0xf2a7a755,
+    0x827e7efc, 0x473d3d7a, 0xac6464c8, 0xe75d5dba, 0x2b191932, 0x957373e6,
+    0xa06060c0, 0x98818119, 0xd14f4f9e, 0x7fdcdca3, 0x66222244, 0x7e2a2a54,
+    0xab90903b, 0x8388880b, 0xca46468c, 0x29eeeec7, 0xd3b8b86b, 0x3c141428,
+    0x79dedea7, 0xe25e5ebc, 0x1d0b0b16, 0x76dbdbad, 0x3be0e0db, 0x56323264,
+    0x4e3a3a74, 0x1e0a0a14, 0xdb494992, 0xa06060c, 0x6c242448, 0xe45c5cb8,
+    0x5dc2c29f, 0x6ed3d3bd, 0xefacac43, 0xa66262c4, 0xa8919139, 0xa4959531,
+    0x37e4e4d3, 0x8b7979f2, 0x32e7e7d5, 0x43c8c88b, 0x5937376e, 0xb76d6dda,
+    0x8c8d8d01, 0x64d5d5b1, 0xd24e4e9c, 0xe0a9a949, 0xb46c6cd8, 0xfa5656ac,
+    0x7f4f4f3, 0x25eaeacf, 0xaf6565ca, 0x8e7a7af4, 0xe9aeae47, 0x18080810,
+    0xd5baba6f, 0x887878f0, 0x6f25254a, 0x722e2e5c, 0x241c1c38, 0xf1a6a657,
+    0xc7b4b473, 0x51c6c697, 0x23e8e8cb, 0x7cdddda1, 0x9c7474e8, 0x211f1f3e,
+    0xdd4b4b96, 0xdcbdbd61, 0x868b8b0d, 0x858a8a0f, 0x907070e0, 0x423e3e7c,
+    0xc4b5b571, 0xaa6666cc, 0xd8484890, 0x5030306, 0x1f6f6f7, 0x120e0e1c,
+    0xa36161c2, 0x5f35356a, 0xf95757ae, 0xd0b9b969, 0x91868617, 0x58c1c199,
+    0x271d1d3a, 0xb99e9e27, 0x38e1e1d9, 0x13f8f8eb, 0xb398982b, 0x33111122,
+    0xbb6969d2, 0x70d9d9a9, 0x898e8e07, 0xa7949433, 0xb69b9b2d, 0x221e1e3c,
+    0x92878715, 0x20e9e9c9, 0x49cece87, 0xff5555aa, 0x78282850, 0x7adfdfa5,
+    0x8f8c8c03, 0xf8a1a159, 0x80898909, 0x170d0d1a, 0xdabfbf65, 0x31e6e6d7,
+    0xc6424284, 0xb86868d0, 0xc3414182, 0xb0999929, 0x772d2d5a, 0x110f0f1e,
+    0xcbb0b07b, 0xfc5454a8, 0xd6bbbb6d, 0x3a16162c
+};
+
+static const unsign32 rtable[] =
+{
+    0x50a7f451, 0x5365417e, 0xc3a4171a, 0x965e273a, 0xcb6bab3b, 0xf1459d1f,
+    0xab58faac, 0x9303e34b, 0x55fa3020, 0xf66d76ad, 0x9176cc88, 0x254c02f5,
+    0xfcd7e54f, 0xd7cb2ac5, 0x80443526, 0x8fa362b5, 0x495ab1de, 0x671bba25,
+    0x980eea45, 0xe1c0fe5d, 0x2752fc3, 0x12f04c81, 0xa397468d, 0xc6f9d36b,
+    0xe75f8f03, 0x959c9215, 0xeb7a6dbf, 0xda595295, 0x2d83bed4, 0xd3217458,
+    0x2969e049, 0x44c8c98e, 0x6a89c275, 0x78798ef4, 0x6b3e5899, 0xdd71b927,
+    0xb64fe1be, 0x17ad88f0, 0x66ac20c9, 0xb43ace7d, 0x184adf63, 0x82311ae5,
+    0x60335197, 0x457f5362, 0xe07764b1, 0x84ae6bbb, 0x1ca081fe, 0x942b08f9,
+    0x58684870, 0x19fd458f, 0x876cde94, 0xb7f87b52, 0x23d373ab, 0xe2024b72,
+    0x578f1fe3, 0x2aab5566, 0x728ebb2, 0x3c2b52f, 0x9a7bc586, 0xa50837d3,
+    0xf2872830, 0xb2a5bf23, 0xba6a0302, 0x5c8216ed, 0x2b1ccf8a, 0x92b479a7,
+    0xf0f207f3, 0xa1e2694e, 0xcdf4da65, 0xd5be0506, 0x1f6234d1, 0x8afea6c4,
+    0x9d532e34, 0xa055f3a2, 0x32e18a05, 0x75ebf6a4, 0x39ec830b, 0xaaef6040,
+    0x69f715e, 0x51106ebd, 0xf98a213e, 0x3d06dd96, 0xae053edd, 0x46bde64d,
+    0xb58d5491, 0x55dc471, 0x6fd40604, 0xff155060, 0x24fb9819, 0x97e9bdd6,
+    0xcc434089, 0x779ed967, 0xbd42e8b0, 0x888b8907, 0x385b19e7, 0xdbeec879,
+    0x470a7ca1, 0xe90f427c, 0xc91e84f8, 0x0, 0x83868009, 0x48ed2b32,
+    0xac70111e, 0x4e725a6c, 0xfbff0efd, 0x5638850f, 0x1ed5ae3d, 0x27392d36,
+    0x64d90f0a, 0x21a65c68, 0xd1545b9b, 0x3a2e3624, 0xb1670a0c, 0xfe75793,
+    0xd296eeb4, 0x9e919b1b, 0x4fc5c080, 0xa220dc61, 0x694b775a, 0x161a121c,
+    0xaba93e2, 0xe52aa0c0, 0x43e0223c, 0x1d171b12, 0xb0d090e, 0xadc78bf2,
+    0xb9a8b62d, 0xc8a91e14, 0x8519f157, 0x4c0775af, 0xbbdd99ee, 0xfd607fa3,
+    0x9f2601f7, 0xbcf5725c, 0xc53b6644, 0x347efb5b, 0x7629438b, 0xdcc623cb,
+    0x68fcedb6, 0x63f1e4b8, 0xcadc31d7, 0x10856342, 0x40229713, 0x2011c684,
+    0x7d244a85, 0xf83dbbd2, 0x1132f9ae, 0x6da129c7, 0x4b2f9e1d, 0xf330b2dc,
+    0xec52860d, 0xd0e3c177, 0x6c16b32b, 0x99b970a9, 0xfa489411, 0x2264e947,
+    0xc48cfca8, 0x1a3ff0a0, 0xd82c7d56, 0xef903322, 0xc74e4987, 0xc1d138d9,
+    0xfea2ca8c, 0x360bd498, 0xcf81f5a6, 0x28de7aa5, 0x268eb7da, 0xa4bfad3f,
+    0xe49d3a2c, 0xd927850, 0x9bcc5f6a, 0x62467e54, 0xc2138df6, 0xe8b8d890,
+    0x5ef7392e, 0xf5afc382, 0xbe805d9f, 0x7c93d069, 0xa92dd56f, 0xb31225cf,
+    0x3b99acc8, 0xa77d1810, 0x6e639ce8, 0x7bbb3bdb, 0x97826cd, 0xf418596e,
+    0x1b79aec, 0xa89a4f83, 0x656e95e6, 0x7ee6ffaa, 0x8cfbc21, 0xe6e815ef,
+    0xd99be7ba, 0xce366f4a, 0xd4099fea, 0xd67cb029, 0xafb2a431, 0x31233f2a,
+    0x3094a5c6, 0xc066a235, 0x37bc4e74, 0xa6ca82fc, 0xb0d090e0, 0x15d8a733,
+    0x4a9804f1, 0xf7daec41, 0xe50cd7f, 0x2ff69117, 0x8dd64d76, 0x4db0ef43,
+    0x544daacc, 0xdf0496e4, 0xe3b5d19e, 0x1b886a4c, 0xb81f2cc1, 0x7f516546,
+    0x4ea5e9d, 0x5d358c01, 0x737487fa, 0x2e410bfb, 0x5a1d67b3, 0x52d2db92,
+    0x335610e9, 0x1347d66d, 0x8c61d79a, 0x7a0ca137, 0x8e14f859, 0x893c13eb,
+    0xee27a9ce, 0x35c961b7, 0xede51ce1, 0x3cb1477a, 0x59dfd29c, 0x3f73f255,
+    0x79ce1418, 0xbf37c773, 0xeacdf753, 0x5baafd5f, 0x146f3ddf, 0x86db4478,
+    0x81f3afca, 0x3ec468b9, 0x2c342438, 0x5f40a3c2, 0x72c31d16, 0xc25e2bc,
+    0x8b493c28, 0x41950dff, 0x7101a839, 0xdeb30c08, 0x9ce4b4d8, 0x90c15664,
+    0x6184cb7b, 0x70b632d5, 0x745c6c48, 0x4257b8d0
+};
+
+#define MR_TOBYTE(x) ((uchar)((x)))
+
+static unsign32 pack(const uchar *b)
+{
+    /* pack bytes into a 32-bit Word */
+    return ((unsign32)b[3] << 24) | ((unsign32)b[2] << 16) | ((unsign32)b[1] << 8) | (unsign32)b[0];
+}
+
+static void unpack(unsign32 a, uchar *b)
+{
+    /* unpack bytes from a word */
+    b[0] = MR_TOBYTE(a);
+    b[1] = MR_TOBYTE(a >> 8);
+    b[2] = MR_TOBYTE(a >> 16);
+    b[3] = MR_TOBYTE(a >> 24);
+}
+
+/* SU= 8 */
+static uchar bmul(uchar x, uchar y)
+{
+    /* x.y= AntiLog(Log(x) + Log(y)) */
+    if (x && y) return ptab[(ltab[x] + ltab[y]) % 255];
+    else return 0;
+}
+
+static unsign32 SubByte(unsign32 a)
+{
+    uchar b[4];
+    unpack(a, b);
+    b[0] = fbsub[b[0]];
+    b[1] = fbsub[b[1]];
+    b[2] = fbsub[b[2]];
+    b[3] = fbsub[b[3]];
+    return pack(b);
+}
+
+/* SU= 16 */
+static uchar product(unsign32 x, unsign32 y)
+{
+    /* dot product of two 4-byte arrays */
+    uchar xb[4], yb[4];
+    unpack(x, xb);
+    unpack(y, yb);
+    return bmul(xb[0], yb[0])^bmul(xb[1], yb[1])^bmul(xb[2], yb[2])^bmul(xb[3], yb[3]);
+}
+
+static unsign32 InvMixCol(unsign32 x)
+{
+    /* matrix Multiplication */
+    unsign32 y, m;
+    uchar b[4];
+
+    m = pack(InCo);
+    b[3] = product(m, x);
+    m = ROTL24(m);
+    b[2] = product(m, x);
+    m = ROTL24(m);
+    b[1] = product(m, x);
+    m = ROTL24(m);
+    b[0] = product(m, x);
+    y = pack(b);
+    return y;
+}
+
+/* SU= 8 */
+/* reset cipher */
+void core::AES_reset(core::aes *a, int mode, char *iv)
+{
+    /* reset mode, or reset iv */
+    int i;
+    a->mode = mode;
+    for (i = 0; i < 4 * NB; i++)
+        a->f[i] = 0;
+    if (mode != ECB && iv != NULL)
+    {
+        for (i = 0; i < 4 * NB; i++)
+            a->f[i] = iv[i];
+    }
+}
+
+void core::AES_getreg(core::aes *a, char *ir)
+{
+    int i;
+    for (i = 0; i < 4 * NB; i++) ir[i] = a->f[i];
+}
+
+/* SU= 72 */
+/* Initialise cipher */
+int core::AES_init(core::aes* a, int mode, int nk, char *key, char *iv)
+{
+    /* Key length Nk=16, 24 or 32 bytes */
+    /* Key Scheduler. Create expanded encryption key */
+    int i, j, k, N, nr;
+    unsign32 CipherKey[8];
+
+    nk /= 4;
+
+    if (nk != 4 && nk != 6 && nk != 8) return 0;
+
+    nr = 6 + nk;
+
+    a->Nk = nk;
+    a->Nr = nr;
+
+    AES_reset(a, mode, iv);
+
+    N = NB * (nr + 1);
+
+    for (i = j = 0; i < nk; i++, j += 4)
+    {
+        CipherKey[i] = pack((uchar *)&key[j]);
+    }
+    for (i = 0; i < nk; i++) a->fkey[i] = CipherKey[i];
+    for (j = nk, k = 0; j < N; j += nk, k++)
+    {
+        a->fkey[j] = a->fkey[j - nk] ^ SubByte(ROTL24(a->fkey[j - 1]))^rco[k];
+        if (nk <= 6)
+        {
+            for (i = 1; i < nk && (i + j) < N; i++)
+                a->fkey[i + j] = a->fkey[i + j - nk] ^ a->fkey[i + j - 1];
+        }
+        else
+        {
+            for (i = 1; i < 4 && (i + j) < N; i++)
+                a->fkey[i + j] = a->fkey[i + j - nk] ^ a->fkey[i + j - 1];
+            if ((j + 4) < N) a->fkey[j + 4] = a->fkey[j + 4 - nk] ^ SubByte(a->fkey[j + 3]);
+            for (i = 5; i < nk && (i + j) < N; i++)
+                a->fkey[i + j] = a->fkey[i + j - nk] ^ a->fkey[i + j - 1];
+        }
+
+    }
+    /* now for the expanded decrypt key in reverse order */
+
+    for (j = 0; j < NB; j++) a->rkey[j + N - NB] = a->fkey[j];
+    for (i = NB; i < N - NB; i += NB)
+    {
+        k = N - NB - i;
+        for (j = 0; j < NB; j++) a->rkey[k + j] = InvMixCol(a->fkey[i + j]);
+    }
+    for (j = N - NB; j < N; j++) a->rkey[j - N + NB] = a->fkey[j];
+    return 1;
+}
+
+/* SU= 80 */
+/* Encrypt a single block */
+void core::AES_ecb_encrypt(core::aes *a, uchar *buff)
+{
+    int i, j, k;
+    unsign32 p[4], q[4], *x, *y, *t;
+
+    for (i = j = 0; i < NB; i++, j += 4)
+    {
+        p[i] = pack((uchar *)&buff[j]);
+        p[i] ^= a->fkey[i];
+    }
+
+    k = NB;
+    x = p;
+    y = q;
+
+    /* State alternates between x and y */
+    for (i = 1; i < a->Nr; i++)
+    {
+
+        y[0] = a->fkey[k] ^ ftable[MR_TOBYTE(x[0])] ^
+               ROTL8(ftable[MR_TOBYTE(x[1] >> 8)])^
+               ROTL16(ftable[MR_TOBYTE(x[2] >> 16)])^
+               ROTL24(ftable[x[3] >> 24]);
+        y[1] = a->fkey[k + 1] ^ ftable[MR_TOBYTE(x[1])] ^
+               ROTL8(ftable[MR_TOBYTE(x[2] >> 8)])^
+               ROTL16(ftable[MR_TOBYTE(x[3] >> 16)])^
+               ROTL24(ftable[x[0] >> 24]);
+        y[2] = a->fkey[k + 2] ^ ftable[MR_TOBYTE(x[2])] ^
+               ROTL8(ftable[MR_TOBYTE(x[3] >> 8)])^
+               ROTL16(ftable[MR_TOBYTE(x[0] >> 16)])^
+               ROTL24(ftable[x[1] >> 24]);
+        y[3] = a->fkey[k + 3] ^ ftable[MR_TOBYTE(x[3])] ^
+               ROTL8(ftable[MR_TOBYTE(x[0] >> 8)])^
+               ROTL16(ftable[MR_TOBYTE(x[1] >> 16)])^
+               ROTL24(ftable[x[2] >> 24]);
+
+        k += 4;
+        t = x;
+        x = y;
+        y = t;    /* swap pointers */
+    }
+
+    /* Last Round */
+
+    y[0] = a->fkey[k] ^ (unsign32)fbsub[MR_TOBYTE(x[0])] ^
+           ROTL8((unsign32)fbsub[MR_TOBYTE(x[1] >> 8)])^
+           ROTL16((unsign32)fbsub[MR_TOBYTE(x[2] >> 16)])^
+           ROTL24((unsign32)fbsub[x[3] >> 24]);
+    y[1] = a->fkey[k + 1] ^ (unsign32)fbsub[MR_TOBYTE(x[1])] ^
+           ROTL8((unsign32)fbsub[MR_TOBYTE(x[2] >> 8)])^
+           ROTL16((unsign32)fbsub[MR_TOBYTE(x[3] >> 16)])^
+           ROTL24((unsign32)fbsub[x[0] >> 24]);
+    y[2] = a->fkey[k + 2] ^ (unsign32)fbsub[MR_TOBYTE(x[2])] ^
+           ROTL8((unsign32)fbsub[MR_TOBYTE(x[3] >> 8)])^
+           ROTL16((unsign32)fbsub[MR_TOBYTE(x[0] >> 16)])^
+           ROTL24((unsign32)fbsub[x[1] >> 24]);
+    y[3] = a->fkey[k + 3] ^ (unsign32)fbsub[MR_TOBYTE(x[3])] ^
+           ROTL8((unsign32)fbsub[MR_TOBYTE(x[0] >> 8)])^
+           ROTL16((unsign32)fbsub[MR_TOBYTE(x[1] >> 16)])^
+           ROTL24((unsign32)fbsub[x[2] >> 24]);
+
+    for (i = j = 0; i < NB; i++, j += 4)
+    {
+        unpack(y[i], (uchar *)&buff[j]);
+        x[i] = y[i] = 0; /* clean up stack */
+    }
+}
+
+/* SU= 80 */
+/* Decrypt a single block */
+void core::AES_ecb_decrypt(core::aes *a, uchar *buff)
+{
+    int i, j, k;
+    unsign32 p[4], q[4], *x, *y, *t;
+
+    for (i = j = 0; i < NB; i++, j += 4)
+    {
+        p[i] = pack((uchar *)&buff[j]);
+        p[i] ^= a->rkey[i];
+    }
+
+    k = NB;
+    x = p;
+    y = q;
+
+    /* State alternates between x and y */
+    for (i = 1; i < a->Nr; i++)
+    {
+        /* Nr is number of rounds. May be odd. */
+
+        y[0] = a->rkey[k] ^ rtable[MR_TOBYTE(x[0])] ^
+               ROTL8(rtable[MR_TOBYTE(x[3] >> 8)])^
+               ROTL16(rtable[MR_TOBYTE(x[2] >> 16)])^
+               ROTL24(rtable[x[1] >> 24]);
+        y[1] = a->rkey[k + 1] ^ rtable[MR_TOBYTE(x[1])] ^
+               ROTL8(rtable[MR_TOBYTE(x[0] >> 8)])^
+               ROTL16(rtable[MR_TOBYTE(x[3] >> 16)])^
+               ROTL24(rtable[x[2] >> 24]);
+        y[2] = a->rkey[k + 2] ^ rtable[MR_TOBYTE(x[2])] ^
+               ROTL8(rtable[MR_TOBYTE(x[1] >> 8)])^
+               ROTL16(rtable[MR_TOBYTE(x[0] >> 16)])^
+               ROTL24(rtable[x[3] >> 24]);
+        y[3] = a->rkey[k + 3] ^ rtable[MR_TOBYTE(x[3])] ^
+               ROTL8(rtable[MR_TOBYTE(x[2] >> 8)])^
+               ROTL16(rtable[MR_TOBYTE(x[1] >> 16)])^
+               ROTL24(rtable[x[0] >> 24]);
+
+        k += 4;
+        t = x;
+        x = y;
+        y = t;    /* swap pointers */
+    }
+
+
+    /* Last Round */
+    y[0] = a->rkey[k] ^ (unsign32)rbsub[MR_TOBYTE(x[0])] ^
+           ROTL8((unsign32)rbsub[MR_TOBYTE(x[3] >> 8)])^
+           ROTL16((unsign32)rbsub[MR_TOBYTE(x[2] >> 16)])^
+           ROTL24((unsign32)rbsub[x[1] >> 24]);
+    y[1] = a->rkey[k + 1] ^ (unsign32)rbsub[MR_TOBYTE(x[1])] ^
+           ROTL8((unsign32)rbsub[MR_TOBYTE(x[0] >> 8)])^
+           ROTL16((unsign32)rbsub[MR_TOBYTE(x[3] >> 16)])^
+           ROTL24((unsign32)rbsub[x[2] >> 24]);
+    y[2] = a->rkey[k + 2] ^ (unsign32)rbsub[MR_TOBYTE(x[2])] ^
+           ROTL8((unsign32)rbsub[MR_TOBYTE(x[1] >> 8)])^
+           ROTL16((unsign32)rbsub[MR_TOBYTE(x[0] >> 16)])^
+           ROTL24((unsign32)rbsub[x[3] >> 24]);
+    y[3] = a->rkey[k + 3] ^ (unsign32)rbsub[MR_TOBYTE(x[3])] ^
+           ROTL8((unsign32)rbsub[MR_TOBYTE(x[2] >> 8)])^
+           ROTL16((unsign32)rbsub[MR_TOBYTE(x[1] >> 16)])^
+           ROTL24((unsign32)rbsub[x[0] >> 24]);
+
+    for (i = j = 0; i < NB; i++, j += 4)
+    {
+        unpack(y[i], (uchar *)&buff[j]);
+        x[i] = y[i] = 0; /* clean up stack */
+    }
+
+}
+
+/* simple default increment function */
+static void increment(char *f)
+{
+    int i;
+    for (i = 0; i < 16; i++)
+    {
+        f[i]++;
+        if (f[i] != 0) break;
+    }
+}
+
+/* SU= 40 */
+/* Encrypt using selected mode of operation */
+unsign32 core::AES_encrypt(core::aes* a, char *buff)
+{
+    int j, bytes;
+    char st[16];
+    unsign32 fell_off;
+
+    /* Supported Modes of Operation */
+
+    fell_off = 0;
+    switch (a->mode)
+    {
+    case ECB:
+        AES_ecb_encrypt(a, (uchar *)buff);
+        return 0;
+    case CBC:
+        for (j = 0; j < 4 * NB; j++) buff[j] ^= a->f[j];
+        AES_ecb_encrypt(a, (uchar *)buff);
+        for (j = 0; j < 4 * NB; j++) a->f[j] = buff[j];
+        return 0;
+
+    case CFB1:
+    case CFB2:
+    case CFB4:
+        bytes = a->mode - CFB1 + 1;
+        for (j = 0; j < bytes; j++) fell_off = (fell_off << 8) | a->f[j];
+        for (j = 0; j < 4 * NB; j++) st[j] = a->f[j];
+        for (j = bytes; j < 4 * NB; j++) a->f[j - bytes] = a->f[j];
+        AES_ecb_encrypt(a, (uchar *)st);
+        for (j = 0; j < bytes; j++)
+        {
+            buff[j] ^= st[j];
+            a->f[16 - bytes + j] = buff[j];
+        }
+        return fell_off;
+
+    case OFB1:
+    case OFB2:
+    case OFB4:
+    case OFB8:
+    case OFB16:
+
+        bytes = a->mode - OFB1 + 1;
+        AES_ecb_encrypt(a, (uchar *)(a->f));
+        for (j = 0; j < bytes; j++) buff[j] ^= a->f[j];
+        return 0;
+
+    case CTR1:
+    case CTR2:
+    case CTR4:
+    case CTR8:
+    case CTR16:
+
+        bytes = a->mode - CTR1 + 1;
+        for (j = 0; j < 4 * NB; j++) st[j] = a->f[j];
+        AES_ecb_encrypt(a, (uchar *)st);
+        for (j = 0; j < bytes; j++) buff[j] ^= st[j];
+        increment(a->f);
+        return 0;
+
+    default:
+        return 0;
+    }
+}
+
+/* SU= 40 */
+/* Decrypt using selected mode of operation */
+unsign32 core::AES_decrypt(core::aes *a, char *buff)
+{
+    int j, bytes;
+    char st[16];
+    unsign32 fell_off;
+
+    /* Supported modes of operation */
+    fell_off = 0;
+    switch (a->mode)
+    {
+    case ECB:
+        AES_ecb_decrypt(a, (uchar *)buff);
+        return 0;
+    case CBC:
+        for (j = 0; j < 4 * NB; j++)
+        {
+            st[j] = a->f[j];
+            a->f[j] = buff[j];
+        }
+        AES_ecb_decrypt(a, (uchar *)buff);
+        for (j = 0; j < 4 * NB; j++)
+        {
+            buff[j] ^= st[j];
+            st[j] = 0;
+        }
+        return 0;
+    case CFB1:
+    case CFB2:
+    case CFB4:
+        bytes = a->mode - CFB1 + 1;
+        for (j = 0; j < bytes; j++) fell_off = (fell_off << 8) | a->f[j];
+        for (j = 0; j < 4 * NB; j++) st[j] = a->f[j];
+        for (j = bytes; j < 4 * NB; j++) a->f[j - bytes] = a->f[j];
+        AES_ecb_encrypt(a, (uchar *)st);
+        for (j = 0; j < bytes; j++)
+        {
+            a->f[16 - bytes + j] = buff[j];
+            buff[j] ^= st[j];
+        }
+        return fell_off;
+    case OFB1:
+    case OFB2:
+    case OFB4:
+    case OFB8:
+    case OFB16:
+        bytes = a->mode - OFB1 + 1;
+        AES_ecb_encrypt(a, (uchar *)(a->f));
+        for (j = 0; j < bytes; j++) buff[j] ^= a->f[j];
+        return 0;
+
+    case CTR1:
+    case CTR2:
+    case CTR4:
+    case CTR8:
+    case CTR16:
+
+        bytes = a->mode - CTR1 + 1;
+        for (j = 0; j < 4 * NB; j++) st[j] = a->f[j];
+        AES_ecb_encrypt(a, (uchar *)st);
+        for (j = 0; j < bytes; j++) buff[j] ^= st[j];
+        increment(a->f);
+        return 0;
+
+    default:
+        return 0;
+    }
+}
+
+/* Clean up and delete left-overs */
+void core::AES_end(core::aes *a)
+{
+    /* clean up */
+    int i;
+    for (i = 0; i < NB * (a->Nr + 1); i++)
+        a->fkey[i] = a->rkey[i] = 0;
+    for (i = 0; i < 4 * NB; i++)
+        a->f[i] = 0;
+}
+
+/* AES encryption/decryption. Encrypt byte array M using key K and returns ciphertext */
+void core::AES_CBC_IV0_ENCRYPT(octet *k, octet *m, octet *c)
+{
+    /* AES CBC encryption, with Null IV and key k */
+    /* Input is from an octet string m, output is to an octet string c */
+    /* Input is padded as necessary to make up a full final block */
+    aes a;
+    int fin;
+    int i, j, ipt, opt;
+    char buff[16];
+    int padlen;
+
+    OCT_clear(c);
+    if (m->len == 0) return;
+    AES_init(&a, CBC, k->len, k->val, NULL);
+
+    ipt = opt = 0;
+    fin = 0;
+    for (;;)
+    {
+        for (i = 0; i < 16; i++)
+        {
+            if (ipt < m->len) buff[i] = m->val[ipt++];
+            else
+            {
+                fin = 1;
+                break;
+            }
+        }
+        if (fin) break;
+        AES_encrypt(&a, buff);
+        for (i = 0; i < 16; i++)
+            if (opt < c->max) c->val[opt++] = buff[i];
+    }
+
+    /* last block, filled up to i-th index */
+
+    padlen = 16 - i;
+    for (j = i; j < 16; j++) buff[j] = padlen;
+    AES_encrypt(&a, buff);
+    for (i = 0; i < 16; i++)
+        if (opt < c->max) c->val[opt++] = buff[i];
+    AES_end(&a);
+    c->len = opt;
+}
+
+/* decrypts and returns TRUE if all consistent, else returns FALSE */
+int core::AES_CBC_IV0_DECRYPT(octet *k, octet *c, octet *m)
+{
+    /* padding is removed */
+    aes a;
+    int i, ipt, opt, ch;
+    char buff[16];
+    int fin, bad;
+    int padlen;
+    ipt = opt = 0;
+
+    OCT_clear(m);
+    if (c->len == 0) return 1;
+    ch = c->val[ipt++];
+
+    AES_init(&a, CBC, k->len, k->val, NULL);
+    fin = 0;
+
+    for (;;)
+    {
+        for (i = 0; i < 16; i++)
+        {
+            buff[i] = ch;
+            if (ipt >= c->len)
+            {
+                fin = 1;
+                break;
+            }
+            else ch = c->val[ipt++];
+        }
+        AES_decrypt(&a, buff);
+        if (fin) break;
+        for (i = 0; i < 16; i++)
+            if (opt < m->max) m->val[opt++] = buff[i];
+    }
+    AES_end(&a);
+    bad = 0;
+    padlen = buff[15];
+    if (i != 15 || padlen < 1 || padlen > 16) bad = 1;
+    if (padlen >= 2 && padlen <= 16)
+        for (i = 16 - padlen; i < 16; i++) if (buff[i] != padlen) bad = 1;
+
+    if (!bad) for (i = 0; i < 16 - padlen; i++)
+            if (opt < m->max) m->val[opt++] = buff[i];
+
+    m->len = opt;
+    if (bad) return 0;
+    return 1;
+}
+
+/*
+#include <stdio.h>
+
+#define KK 32
+
+int main()
+{
+    int i;
+    aes a;
+    unsign32 t;
+    uchar x,y;
+
+    char key[KK];
+    char block[16];
+    char iv[16];
+    for (i=0;i<KK;i++) key[i]=5;
+    key[0]=1;
+    for (i=0;i<16;i++) iv[i]=i;
+    for (i=0;i<16;i++) block[i]=i;
+
+    AES_init(&a,CTR16,KK,key,iv);
+
+    printf("Plain=   ");
+    for (i=0;i<16;i++) printf("%02x",block[i]);
+    printf("\n");
+    AES_encrypt(&a,block);
+    printf("Encrypt= ");
+    for (i=0;i<16;i++) printf("%02x",(uchar)block[i]);
+    printf("\n");
+    AES_reset(&a,CTR16,iv);
+    AES_decrypt(&a,block);
+    printf("Decrypt= ");
+    for (i=0;i<16;i++) printf("%02x",(uchar)block[i]);
+    printf("\n");
+
+    AES_end(&a);
+
+    return 0;
+}
+
+*/
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/arch.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/arch.h
new file mode 100644
index 0000000..b37fea3
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/arch.h
@@ -0,0 +1,106 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* Architecture definition header file */
+
+/**
+ * @file arch.h
+ * @author Mike Scott
+ * @date 23rd February 2016
+ * @brief Architecture Header File
+ *
+ * Specify Processor Architecture
+ *
+ */
+
+/* NOTE: There is only one user configurable section in this header - see below */
+
+#ifndef ARCH_H
+#define ARCH_H
+#include <stdint.h>
+
+#define WOULD_USE_VLAS   /* Would like to use variable length arrays? */
+
+#ifdef WOULD_USE_VLAS
+#if __cplusplus >= 201402L
+#define USE_VLAS
+#endif
+#endif
+
+namespace core {
+
+/*** START OF USER CONFIGURABLE SECTION - set architecture ***/
+
+#define CHUNK 64      /**< size of chunk in bits = wordlength of computer = 16, 32 or 64. Note not all curve options are supported on 16-bit processors */
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+/* Create Integer types */
+
+//#define byte uint8_t            /**< 8-bit unsigned integer */
+//#define sign8 int8_t            /**< 8-bit signed integer */
+//#define sign16 int16_t          /**< 16-bit signed integer */
+//#define sign32 int32_t          /**< 32-bit signed integer */
+//#define sign64 int64_t          /**< 64-bit signed integer */
+//#define unsign32 uint32_t       /**< 32-bit unsigned integer */
+//#define unsign64 uint64_t       /**< 64-bit unsigned integer */
+
+using byte = uint8_t;			/**< 8-bit unsigned integer */
+using sign8 = int8_t;			/**< 8-bit signed integer */
+using sign16 = int16_t;			/**< 16-bit signed integer */
+using sign32 = int32_t;			/**< 32-bit signed integer */
+using sign64 = int64_t;			/**< 64-bit signed integer */
+using unsign32 = uint32_t;		/**< 32-bit unsigned integer */
+using unsign64 = uint64_t;		/**< 64-bit unsigned integer */
+
+//#define uchar unsigned char  /**<  Unsigned char */
+using uchar = unsigned char;
+
+/* Don't mess with anything below this line unless you know what you are doing */
+
+#if CHUNK==16
+
+#define chunk int16_t       /**< C type corresponding to word length */
+#define dchunk int32_t      /**< Always define double length chunk type if available */
+
+#endif
+
+#if CHUNK == 32
+
+#define chunk int32_t       /**< C type corresponding to word length */
+#define dchunk int64_t      /**< Always define double length chunk type if available */
+
+#endif
+
+#if CHUNK == 64
+
+#define chunk int64_t       /**< C type corresponding to word length */
+#if defined(__SIZEOF_INT128__) && __SIZEOF_INT128__ == 16
+#define dchunk __int128
+#endif
+
+#endif
+
+#ifdef dchunk
+#define COMBA      /**< Use COMBA method for faster muls, sqrs and reductions */
+#endif
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/benchtest_all b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/benchtest_all
new file mode 100644
index 0000000..02ed847
Binary files /dev/null and b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/benchtest_all differ
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/benchtest_all.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/benchtest_all.cpp
new file mode 100644
index 0000000..0a5b42a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/benchtest_all.cpp
@@ -0,0 +1,1462 @@
+
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* Test and benchmark elliptic curve and RSA functions
+    First build core.a from config*.py file
+    g++ -O3 benchtest_all.c core.a -o benchtest_all
+*/
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <time.h>
+
+#include "rsa_RSA2048.h"
+#include "ecp_Ed25519.h"
+#include "pair_BN254.h"
+
+#if CHUNK==32 || CHUNK==64
+#include "ecp_NIST256.h"
+#include "ecp_Ed448.h"
+#include "pair_BLS12383.h"
+#include "pair4_BLS24479.h"
+#include "pair8_BLS48556.h"
+#endif
+
+#define MIN_TIME 10.0
+#define MIN_ITERS 10
+
+using namespace core;
+
+int ed25519(csprng *RNG)
+{
+    using namespace Ed25519;
+    using namespace Ed25519_BIG;
+    using namespace Ed25519_FP;
+
+    int i, iterations;
+    clock_t start;
+    double elapsed;
+    ECP EP, EG;
+    BIG s, r, x, y;
+    FP rw;
+    printf("\nTesting/Timing Ed25519 ECC\n");
+
+#if CURVETYPE_Ed25519==WEIERSTRASS
+    printf("Weierstrass parameterization\n");
+#endif
+#if CURVETYPE_Ed25519==EDWARDS
+    printf("Edwards parameterization\n");
+#endif
+#if CURVETYPE_Ed25519==MONTGOMERY
+    printf("Montgomery parameterization\n");
+#endif
+
+
+#if MODTYPE_F25519 == PSEUDO_MERSENNE
+    printf("Pseudo-Mersenne Modulus\n");
+#endif
+
+#if MODTYPE_F25519 == GENERALISED_MERSENNE
+    printf("Generalised-Mersenne Modulus\n");
+#endif
+
+#if MODTYPE_F25519 == MONTGOMERY_FRIENDLY
+    printf("Montgomery Friendly Modulus\n");
+#endif
+
+#if MODTYPE_F25519 == NOT_SPECIAL
+    printf("Not special Modulus\n");
+#endif
+
+
+#if CHUNK==16
+    printf("16-bit Build\n");
+#endif
+#if CHUNK==32
+    printf("32-bit Build\n");
+#endif
+#if CHUNK==64
+    printf("64-bit Build\n");
+#endif
+
+    ECP_generator(&EG);
+    BIG_rcopy(r, CURVE_Order);
+
+    FP_rand(&rw,RNG);
+
+    ECP_map2point(&EP,&rw);
+    ECP_cfp(&EP);
+
+    if (ECP_isinf(&EP))
+    {
+        printf("HASHING FAILURE - P=O\n");
+        return 0;
+    }
+    
+    ECP_mul(&EP,r);
+    if (!ECP_isinf(&EP))
+    {
+        printf("EP= "); ECP_output(&EP); printf("\n");
+        printf("HASHING FAILURE - P=O\n");
+        return 0;
+    }
+
+    BIG_randtrunc(s, r, 2 * CURVE_SECURITY_Ed25519, RNG);
+
+    ECP_copy(&EP, &EG);
+    ECP_mul(&EP, r);
+
+    if (!ECP_isinf(&EP))
+    {
+        printf("FAILURE - rG!=O\n");
+        return 0;
+    }
+
+    iterations = 0;
+    start = clock();
+    do {
+        ECP_copy(&EP, &EG);
+        ECP_mul(&EP, s);
+
+        iterations++;
+        elapsed = (clock() - start) / (double)CLOCKS_PER_SEC;
+    } while (elapsed < MIN_TIME || iterations < MIN_ITERS);
+    elapsed = 1000.0 * elapsed / iterations;
+    printf("EC  mul - %8d iterations  ", iterations);
+    printf(" %8.2lf ms per iteration\n", elapsed);
+
+    return 0;
+}
+
+#if CHUNK==32 || CHUNK==64
+int nist256(csprng *RNG)
+{
+    using namespace NIST256;
+    using namespace NIST256_BIG;
+    using namespace NIST256_FP;
+
+    int i, iterations;
+    clock_t start;
+    double elapsed;
+    ECP EP, EG;
+    BIG s, r, x, y;
+    FP rw;
+    printf("\nTesting/Timing NIST256 ECC\n");
+
+#if CURVETYPE_NIST256==WEIERSTRASS
+    printf("Weierstrass parameterization\n");
+#endif
+#if CURVETYPE_NIST256==EDWARDS
+    printf("Edwards parameterization\n");
+#endif
+#if CURVETYPE_NIST256==MONTGOMERY
+    printf("Montgomery parameterization\n");
+#endif
+
+
+#if MODTYPE_NIST256 == PSEUDO_MERSENNE
+    printf("Pseudo-Mersenne Modulus\n");
+#endif
+
+#if MODTYPE_NIST256 == GENERALISED_MERSENNE
+    printf("Generalised-Mersenne Modulus\n");
+#endif
+
+#if MODTYPE_NIST256 == MONTGOMERY_FRIENDLY
+    printf("Montgomery Friendly Modulus\n");
+#endif
+
+#if MODTYPE_NIST256 == NOT_SPECIAL
+    printf("Not special Modulus\n");
+#endif
+
+#if CHUNK==16
+    printf("16-bit Build\n");
+#endif
+#if CHUNK==32
+    printf("32-bit Build\n");
+#endif
+#if CHUNK==64
+    printf("64-bit Build\n");
+#endif
+
+    ECP_generator(&EG);
+
+    BIG_rcopy(r, CURVE_Order);
+
+    FP_rand(&rw,RNG);
+    ECP_map2point(&EP,&rw);
+    ECP_cfp(&EP);
+
+    if (ECP_isinf(&EP))
+    {
+        printf("HASHING FAILURE - P=O\n");
+        return 0;
+    }
+    ECP_mul(&EP,r);
+    if (!ECP_isinf(&EP))
+    {
+        printf("HASHING FAILURE - P=O\n");
+        return 0;
+    }
+
+    BIG_randtrunc(s, r, 2 * CURVE_SECURITY_NIST256, RNG);
+
+    ECP_copy(&EP, &EG);
+    ECP_mul(&EP, r);
+
+    if (!ECP_isinf(&EP))
+    {
+        printf("FAILURE - rG!=O\n");
+        return 0;
+    }
+
+    iterations = 0;
+    start = clock();
+    do {
+        ECP_copy(&EP, &EG);
+        ECP_mul(&EP, s);
+
+        iterations++;
+        elapsed = (clock() - start) / (double)CLOCKS_PER_SEC;
+    } while (elapsed < MIN_TIME || iterations < MIN_ITERS);
+    elapsed = 1000.0 * elapsed / iterations;
+    printf("EC  mul - %8d iterations  ", iterations);
+    printf(" %8.2lf ms per iteration\n", elapsed);
+
+    return 0;
+}
+
+int ed448(csprng *RNG)
+{
+    using namespace Ed448;
+    using namespace Ed448_BIG;
+    using namespace Ed448_FP;
+
+    int i, iterations;
+    clock_t start;
+    double elapsed;
+    ECP EP, EG;
+    BIG s, r, x, y;
+    FP rw;
+    printf("\nTesting/Timing Ed448 ECC\n");
+
+#if CURVETYPE_Ed448==WEIERSTRASS
+    printf("Weierstrass parameterization\n");
+#endif
+#if CURVETYPE_Ed448==EDWARDS
+    printf("Edwards parameterization\n");
+#endif
+#if CURVETYPE_Ed448==MONTGOMERY
+    printf("Montgomery parameterization\n");
+#endif
+
+#if MODTYPE_F448 == PSEUDO_MERSENNE
+    printf("Pseudo-Mersenne Modulus\n");
+#endif
+
+#if MODTYPE_F448 == GENERALISED_MERSENNE
+    printf("Generalised-Mersenne Modulus\n");
+#endif
+
+#if MODTYPE_F448 == MONTGOMERY_FRIENDLY
+    printf("Montgomery Friendly Modulus\n");
+#endif
+
+#if MODTYPE_F448 == NOT_SPECIAL
+    printf("Not special Modulus\n");
+#endif
+
+#if CHUNK==16
+    printf("16-bit Build\n");
+#endif
+#if CHUNK==32
+    printf("32-bit Build\n");
+#endif
+#if CHUNK==64
+    printf("64-bit Build\n");
+#endif
+
+    ECP_generator(&EG);
+    BIG_rcopy(r, CURVE_Order);
+    FP_rand(&rw,RNG);
+    ECP_map2point(&EP,&rw);
+    ECP_cfp(&EP);
+
+    if (ECP_isinf(&EP))
+    {
+        printf("HASHING FAILURE - P=O\n");
+        return 0;
+    }
+    ECP_mul(&EP,r);
+    if (!ECP_isinf(&EP))
+    {
+        printf("HASHING FAILURE - P=O\n");
+        return 0;
+    }
+
+    BIG_randtrunc(s, r, 2 * CURVE_SECURITY_Ed448, RNG);
+
+    ECP_copy(&EP, &EG);
+    ECP_mul(&EP, r);
+
+    if (!ECP_isinf(&EP))
+    {
+        printf("FAILURE - rG!=O\n");
+        return 0;
+    }
+
+    iterations = 0;
+    start = clock();
+    do {
+        ECP_copy(&EP, &EG);
+        ECP_mul(&EP, s);
+
+        iterations++;
+        elapsed = (clock() - start) / (double)CLOCKS_PER_SEC;
+    } while (elapsed < MIN_TIME || iterations < MIN_ITERS);
+    elapsed = 1000.0 * elapsed / iterations;
+    printf("EC  mul - %8d iterations  ", iterations);
+    printf(" %8.2lf ms per iteration\n", elapsed);
+
+    return 0;
+}
+#endif
+
+int bn254(csprng *RNG)
+{
+    using namespace BN254;
+    using namespace BN254_FP;
+    using namespace BN254_BIG;
+
+    int i, iterations;
+    clock_t start;
+    double elapsed;
+
+    ECP P, G;
+    ECP2 Q, W;
+    FP12 g, w;
+    FP4 cm;
+    FP2 rz2;
+    FP rz;
+
+    BIG s, r, x, y;
+    printf("\nTesting/Timing BN254 Pairings\n");
+
+    ECP_generator(&G);
+    BIG_rcopy(r, CURVE_Order);
+    FP_rand(&rz,RNG);
+    ECP_map2point(&P,&rz);
+    ECP_cfp(&P);
+
+    if (ECP_isinf(&P))
+    {
+        printf("HASHING FAILURE - P=O\n");
+        return 0;
+    }
+    ECP_mul(&P,r);
+    if (!ECP_isinf(&P))
+    {
+        printf("HASHING FAILURE - P=O\n");
+        return 0;
+    }
+
+    BIG_randtrunc(s, r, 2 * CURVE_SECURITY_BN254, RNG);
+
+    ECP_copy(&P, &G);
+    PAIR_G1mul(&P, r);
+
+    if (!ECP_isinf(&P))
+    {
+        printf("FAILURE - rG!=O\n");
+        return 0;
+    }
+
+    iterations = 0;
+    start = clock();
+    do {
+        ECP_copy(&P, &G);
+        PAIR_G1mul(&P, s);
+
+        iterations++;
+        elapsed = (clock() - start) / (double)CLOCKS_PER_SEC;
+    } while (elapsed < MIN_TIME || iterations < MIN_ITERS);
+    elapsed = 1000.0 * elapsed / iterations;
+    printf("G1 mul              - %8d iterations  ", iterations);
+    printf(" %8.2lf ms per iteration\n", elapsed);
+
+    ECP2_generator(&W);
+
+    FP2_rand(&rz2,RNG);
+    ECP2_map2point(&Q,&rz2);
+    ECP2_cfp(&Q);
+
+    if (ECP2_isinf(&Q))
+    {
+        printf("HASHING FAILURE - P=O\n");
+        return 0;
+    }
+
+    //printf("Q= "); ECP2_output(&Q); printf("\n");
+    ECP2_mul(&Q,r);
+    if (!ECP2_isinf(&Q))
+    {
+        printf("FAILURE - rQ!=O\n");
+        return 0;
+    }
+
+    ECP2_copy(&Q, &W);
+    ECP2_mul(&Q, r);
+
+    if (!ECP2_isinf(&Q))
+    {
+        printf("FAILURE - rQ!=O\n");
+        return 0;
+    }
+
+    iterations = 0;
+    start = clock();
+    do {
+        ECP2_copy(&Q, &W);
+        PAIR_G2mul(&Q, s);
+
+        iterations++;
+        elapsed = (clock() - start) / (double)CLOCKS_PER_SEC;
+    } while (elapsed < MIN_TIME || iterations < MIN_ITERS);
+    elapsed = 1000.0 * elapsed / iterations;
+    printf("G2 mul              - %8d iterations  ", iterations);
+    printf(" %8.2lf ms per iteration\n", elapsed);
+
+    PAIR_ate(&w, &Q, &P);
+    PAIR_fexp(&w);
+
+//printf("pairing= ");FP12_output(&w); printf("\n");
+
+    FP12_copy(&g, &w);
+
+    PAIR_GTpow(&g, r);
+
+    if (!FP12_isunity(&g))
+    {
+        printf("FAILURE - g^r!=1\n");
+        return 0;
+    }
+
+    iterations = 0;
+    start = clock();
+    do {
+        FP12_copy(&g, &w);
+        PAIR_GTpow(&g, s);
+
+        iterations++;
+        elapsed = (clock() - start) / (double)CLOCKS_PER_SEC;
+    } while (elapsed < MIN_TIME || iterations < MIN_ITERS);
+    elapsed = 1000.0 * elapsed / iterations;
+    printf("GT pow              - %8d iterations  ", iterations);
+    printf(" %8.2lf ms per iteration\n", elapsed);
+
+    FP12_copy(&g, &w);
+
+    iterations = 0;
+    start = clock();
+    do {
+        FP12_compow(&cm, &g, s, r);
+        iterations++;
+        elapsed = (clock() - start) / (double)CLOCKS_PER_SEC;
+    } while (elapsed < MIN_TIME || iterations < MIN_ITERS);
+    elapsed = 1000.0 * elapsed / iterations;
+    printf("GT pow (compressed) - %8d iterations  ", iterations);
+    printf(" %8.2lf ms per iteration\n", elapsed);
+
+    iterations = 0;
+    start = clock();
+    do {
+        PAIR_ate(&w, &Q, &P);
+        iterations++;
+        elapsed = (clock() - start) / (double)CLOCKS_PER_SEC;
+    } while (elapsed < MIN_TIME || iterations < MIN_ITERS);
+    elapsed = 1000.0 * elapsed / iterations;
+    printf("PAIRing ATE         - %8d iterations  ", iterations);
+    printf(" %8.2lf ms per iteration\n", elapsed);
+
+    iterations = 0;
+    start = clock();
+    do {
+        FP12_copy(&g, &w);
+        PAIR_fexp(&g);
+        iterations++;
+        elapsed = (clock() - start) / (double)CLOCKS_PER_SEC;
+    } while (elapsed < MIN_TIME || iterations < MIN_ITERS);
+    elapsed = 1000.0 * elapsed / iterations;
+    printf("PAIRing FEXP        - %8d iterations  ", iterations);
+    printf(" %8.2lf ms per iteration\n", elapsed);
+
+    ECP_copy(&P, &G);
+    ECP2_copy(&Q, &W);
+
+    PAIR_G1mul(&P, s);
+    PAIR_ate(&g, &Q, &P);
+    PAIR_fexp(&g);
+
+    ECP_copy(&P, &G);
+
+    PAIR_G2mul(&Q, s);
+    PAIR_ate(&w, &Q, &P);
+    PAIR_fexp(&w);
+
+	if (!PAIR_G1member(&P))
+	{
+        printf("FAILURE - P not in G1\n");
+        return 0;
+	}
+
+	if (!PAIR_G2member(&Q))
+	{
+        printf("FAILURE - Q not in G2\n");
+        return 0;
+	}
+
+	if (!PAIR_GTmember(&w))
+	{
+        printf("FAILURE - e(Q,P) not in GT\n");
+        return 0;
+	}
+
+    if (!FP12_equals(&g, &w))
+    {
+        printf("FAILURE - e(sQ,p)!=e(Q,sP) \n");
+        return 0;
+    }
+
+    ECP2_copy(&Q, &W);
+    PAIR_ate(&g, &Q, &P);
+    PAIR_fexp(&g);
+
+    PAIR_GTpow(&g, s);
+
+    if (!FP12_equals(&g, &w))
+    {
+        printf("FAILURE - e(sQ,p)!=e(Q,P)^s \n");
+        return 0;
+    }
+
+    ECP N1;
+    ECP2 N2;
+
+    ECP_inf(&N1);
+    ECP2_inf(&N2);
+
+    PAIR_ate(&g, &N2, &P);
+    PAIR_fexp(&g);
+
+    if (!FP12_isunity(&g))
+    {
+        printf("FAILURE - e(O,P) !=1 \n");
+        return 0;
+    }
+
+    PAIR_ate(&g, &Q, &N1);
+    PAIR_fexp(&g);
+
+    if (!FP12_isunity(&g))
+    {
+        printf("FAILURE - e(Q,O) !=1 \n");
+        return 0;
+    }
+ 
+	
+
+    return 0;
+}
+
+#if CHUNK==32 || CHUNK==64
+int bls383(csprng *RNG)
+{
+    using namespace BLS12383;
+    using namespace BLS12383_FP;
+    using namespace BLS12383_BIG;
+
+    int i, iterations;
+    clock_t start;
+    double elapsed;
+
+    ECP P, G;
+    ECP2 Q, W;
+    FP12 g, w;
+    FP4 cm;
+    FP2 rz2;
+    FP rz;
+
+    BIG s, r, x, y;
+    printf("\nTesting/Timing BLS12383 Pairings\n");
+
+    ECP_generator(&G);
+
+    BIG_rcopy(r, CURVE_Order);
+    FP_rand(&rz,RNG);
+
+/*
+    iterations = 0;
+    start = clock();
+    do {
+        BIG_randomnum(s,r,RNG);
+        iterations++;
+        elapsed = (clock() - start) / (double)CLOCKS_PER_SEC;
+    } while (elapsed < MIN_TIME || iterations < MIN_ITERS);
+    elapsed = 1000.0 * elapsed / iterations;
+    printf("BIG_randomnum  - %8d iterations  ", iterations);
+    printf(" %8.2lf ms per iteration\n", elapsed);
+    printf("nbits(r)= %d\n",BIG_nbits(r));
+*/
+//    iterations = 0;
+//    start = clock();
+//    do {
+        ECP_map2point(&P,&rz);
+        ECP_cfp(&P);
+//        iterations++;
+//        elapsed = (clock() - start) / (double)CLOCKS_PER_SEC;
+//    } while (elapsed < MIN_TIME || iterations < MIN_ITERS);
+//    elapsed = 1000.0 * elapsed / iterations;
+//    printf("G1 hash to point  - %8d iterations  ", iterations);
+//    printf(" %8.2lf ms per iteration\n", elapsed);
+
+
+    if (ECP_isinf(&P))
+    {
+        printf("HASHING FAILURE - P=O\n");
+        return 0;
+    }
+    ECP_mul(&P,r);
+    if (!ECP_isinf(&P))
+    {
+        printf("HASHING FAILURE - P=O\n");
+        return 0;
+    }
+
+    BIG_randtrunc(s, r, 2 * CURVE_SECURITY_BLS12383, RNG);
+
+
+    ECP_copy(&P, &G);
+    PAIR_G1mul(&P, r);
+
+    if (!ECP_isinf(&P))
+    {
+        printf("FAILURE - rG!=O\n");
+        return 0;
+    }
+
+    iterations = 0;
+    start = clock();
+    do {
+        ECP_copy(&P, &G);
+        PAIR_G1mul(&P, s);
+
+        iterations++;
+        elapsed = (clock() - start) / (double)CLOCKS_PER_SEC;
+    } while (elapsed < MIN_TIME || iterations < MIN_ITERS);
+    elapsed = 1000.0 * elapsed / iterations;
+    printf("G1 mul              - %8d iterations  ", iterations);
+    printf(" %8.2lf ms per iteration\n", elapsed);
+
+    ECP2_generator(&W);
+
+    FP2_rand(&rz2,RNG);
+    ECP2_map2point(&Q,&rz2);
+    ECP2_cfp(&Q);
+
+    if (ECP2_isinf(&Q))
+    {
+        printf("HASHING FAILURE - P=O\n");
+        return 0;
+    }
+
+    ECP2_mul(&Q,r);
+    if (!ECP2_isinf(&Q))
+    {
+        printf("FAILURE - rQ!=O\n");
+        return 0;
+    }
+
+
+    ECP2_copy(&Q, &W);
+    ECP2_mul(&Q, r);
+
+    if (!ECP2_isinf(&Q))
+    {
+        printf("FAILURE - rQ!=O\n");
+        return 0;
+    }
+
+    iterations = 0;
+    start = clock();
+    do {
+        ECP2_copy(&Q, &W);
+        PAIR_G2mul(&Q, s);
+
+        iterations++;
+        elapsed = (clock() - start) / (double)CLOCKS_PER_SEC;
+    } while (elapsed < MIN_TIME || iterations < MIN_ITERS);
+    elapsed = 1000.0 * elapsed / iterations;
+    printf("G2 mul              - %8d iterations  ", iterations);
+    printf(" %8.2lf ms per iteration\n", elapsed);
+
+    PAIR_ate(&w, &Q, &P);
+    PAIR_fexp(&w);
+
+    FP12_copy(&g, &w);
+
+    PAIR_GTpow(&g, r);
+
+    if (!FP12_isunity(&g))
+    {
+        printf("FAILURE - g^r!=1\n");
+        return 0;
+    }
+
+    iterations = 0;
+    start = clock();
+    do {
+        FP12_copy(&g, &w);
+        PAIR_GTpow(&g, s);
+
+        iterations++;
+        elapsed = (clock() - start) / (double)CLOCKS_PER_SEC;
+    } while (elapsed < MIN_TIME || iterations < MIN_ITERS);
+    elapsed = 1000.0 * elapsed / iterations;
+    printf("GT pow              - %8d iterations  ", iterations);
+    printf(" %8.2lf ms per iteration\n", elapsed);
+
+    FP12_copy(&g, &w);
+
+    iterations = 0;
+    start = clock();
+    do {
+        FP12_compow(&cm, &g, s, r);
+        iterations++;
+        elapsed = (clock() - start) / (double)CLOCKS_PER_SEC;
+    } while (elapsed < MIN_TIME || iterations < MIN_ITERS);
+    elapsed = 1000.0 * elapsed / iterations;
+    printf("GT pow (compressed) - %8d iterations  ", iterations);
+    printf(" %8.2lf ms per iteration\n", elapsed);
+
+    iterations = 0;
+    start = clock();
+    do {
+        PAIR_ate(&w, &Q, &P);
+        iterations++;
+        elapsed = (clock() - start) / (double)CLOCKS_PER_SEC;
+    } while (elapsed < MIN_TIME || iterations < MIN_ITERS);
+    elapsed = 1000.0 * elapsed / iterations;
+    printf("PAIRing ATE         - %8d iterations  ", iterations);
+    printf(" %8.2lf ms per iteration\n", elapsed);
+
+    iterations = 0;
+    start = clock();
+    do {
+        FP12_copy(&g, &w);
+        PAIR_fexp(&g);
+        iterations++;
+        elapsed = (clock() - start) / (double)CLOCKS_PER_SEC;
+    } while (elapsed < MIN_TIME || iterations < MIN_ITERS);
+    elapsed = 1000.0 * elapsed / iterations;
+    printf("PAIRing FEXP        - %8d iterations  ", iterations);
+    printf(" %8.2lf ms per iteration\n", elapsed);
+
+    ECP_copy(&P, &G);
+    ECP2_copy(&Q, &W);
+
+    PAIR_G1mul(&P, s);
+    PAIR_ate(&g, &Q, &P);
+    PAIR_fexp(&g);
+
+    ECP_copy(&P, &G);
+
+    PAIR_G2mul(&Q, s);
+    PAIR_ate(&w, &Q, &P);
+    PAIR_fexp(&w);
+
+	if (!PAIR_G1member(&P))
+	{
+        printf("FAILURE - P not in G1\n");
+        return 0;
+	}
+
+	if (!PAIR_G2member(&Q))
+	{
+        printf("FAILURE - Q not in G2\n");
+        return 0;
+	}
+
+	if (!PAIR_GTmember(&w))
+	{
+        printf("FAILURE - e(Q,P) not in GT\n");
+        return 0;
+	}
+
+    if (!FP12_equals(&g, &w))
+    {
+        printf("FAILURE - e(sQ,p)!=e(Q,sP) \n");
+        return 0;
+    }
+
+    ECP2_copy(&Q, &W);
+    PAIR_ate(&g, &Q, &P);
+    PAIR_fexp(&g);
+
+    PAIR_GTpow(&g, s);
+
+    if (!FP12_equals(&g, &w))
+    {
+        printf("FAILURE - e(sQ,p)!=e(Q,P)^s \n");
+        return 0;
+    }
+
+    ECP N1;
+    ECP2 N2;
+
+    ECP_inf(&N1);
+    ECP2_inf(&N2);
+
+    PAIR_ate(&g, &N2, &P);
+    PAIR_fexp(&g);
+
+    if (!FP12_isunity(&g))
+    {
+        printf("FAILURE - e(O,P) !=1 \n");
+        return 0;
+    }
+
+    PAIR_ate(&g, &Q, &N1);
+    PAIR_fexp(&g);
+
+    if (!FP12_isunity(&g))
+    {
+        printf("FAILURE - e(Q,O) !=1 \n");
+        return 0;
+    }
+
+    return 0;
+}
+
+int bls24(csprng *RNG)
+{
+    using namespace BLS24479;
+    using namespace BLS24479_FP;
+    using namespace BLS24479_BIG;
+
+    int i, iterations;
+    clock_t start;
+    double elapsed;
+
+    ECP P, G;
+    ECP4 Q, W;
+    FP24 g, w;
+    FP rz;
+    FP4 rz4;
+
+    FP8 cm;
+    BIG a, b, s, r;
+
+    printf("\nTesting/Timing BLS24479 Pairings\n");
+
+    ECP_generator(&G);
+    BIG_rcopy(r, CURVE_Order);
+    FP_rand(&rz,RNG);
+    ECP_map2point(&P,&rz);
+    ECP_cfp(&P);
+
+    if (ECP_isinf(&P))
+    {
+        printf("HASHING FAILURE - P=O\n");
+        return 0;
+    }
+    ECP_mul(&P,r);
+    if (!ECP_isinf(&P))
+    {
+        printf("HASHING FAILURE - P=O\n");
+        return 0;
+    }
+
+    BIG_randtrunc(s, r, 2 * CURVE_SECURITY_BLS24479, RNG);
+
+    ECP_copy(&P, &G);
+    PAIR_G1mul(&P, r);
+
+    if (!ECP_isinf(&P))
+    {
+        printf("FAILURE - rG!=O\n");
+        return 0;
+    }
+
+    iterations = 0;
+    start = clock();
+    do {
+        ECP_copy(&P, &G);
+        PAIR_G1mul(&P, s);
+
+        iterations++;
+        elapsed = (clock() - start) / (double)CLOCKS_PER_SEC;
+    } while (elapsed < MIN_TIME || iterations < MIN_ITERS);
+    elapsed = 1000.0 * elapsed / iterations;
+    printf("G1 mul              - %8d iterations  ", iterations);
+    printf(" %8.2lf ms per iteration\n", elapsed);
+
+    ECP4_generator(&W);
+
+    FP4_rand(&rz4,RNG);
+    ECP4_map2point(&Q,&rz4);
+    ECP4_cfp(&Q);
+
+    if (ECP4_isinf(&Q))
+    {
+        printf("HASHING FAILURE - P=O\n");
+        return 0;
+    }
+
+    ECP4_mul(&Q,r);
+    if (!ECP4_isinf(&Q))
+    {
+        printf("FAILURE - rQ!=O\n");
+        return 0;
+    }
+    ECP4_copy(&Q, &W);
+    ECP4_mul(&Q, r);
+
+    if (!ECP4_isinf(&Q))
+    {
+        printf("FAILURE - rQ!=O\n");
+        return 0;
+    }
+
+    iterations = 0;
+    start = clock();
+    do {
+        ECP4_copy(&Q, &W);
+        PAIR_G2mul(&Q, s);
+
+        iterations++;
+        elapsed = (clock() - start) / (double)CLOCKS_PER_SEC;
+    } while (elapsed < MIN_TIME || iterations < MIN_ITERS);
+    elapsed = 1000.0 * elapsed / iterations;
+    printf("G2 mul              - %8d iterations  ", iterations);
+    printf(" %8.2lf ms per iteration\n", elapsed);
+
+    PAIR_ate(&w, &Q, &P);
+    PAIR_fexp(&w);
+
+    FP24_copy(&g, &w);
+
+    PAIR_GTpow(&g, r);
+
+    if (!FP24_isunity(&g))
+    {
+        printf("FAILURE - g^r!=1\n");
+        return 0;
+    }
+
+    iterations = 0;
+    start = clock();
+    do {
+        FP24_copy(&g, &w);
+        PAIR_GTpow(&g, s);
+
+        iterations++;
+        elapsed = (clock() - start) / (double)CLOCKS_PER_SEC;
+    } while (elapsed < MIN_TIME || iterations < MIN_ITERS);
+    elapsed = 1000.0 * elapsed / iterations;
+    printf("GT pow              - %8d iterations  ", iterations);
+    printf(" %8.2lf ms per iteration\n", elapsed);
+/*
+    FP24_copy(&g, &w);
+
+    iterations = 0;
+    start = clock();
+    do {
+        FP24_compow(&cm, &g, s, r);
+        iterations++;
+        elapsed = (clock() - start) / (double)CLOCKS_PER_SEC;
+    } while (elapsed < MIN_TIME || iterations < MIN_ITERS);
+    elapsed = 1000.0 * elapsed / iterations;
+    printf("GT pow (compressed) - %8d iterations  ", iterations);
+    printf(" %8.2lf ms per iteration\n", elapsed);
+*/
+    iterations = 0;
+    start = clock();
+    do {
+        PAIR_ate(&w, &Q, &P);
+        iterations++;
+        elapsed = (clock() - start) / (double)CLOCKS_PER_SEC;
+    } while (elapsed < MIN_TIME || iterations < MIN_ITERS);
+    elapsed = 1000.0 * elapsed / iterations;
+    printf("PAIRing ATE         - %8d iterations  ", iterations);
+    printf(" %8.2lf ms per iteration\n", elapsed);
+
+    iterations = 0;
+    start = clock();
+    do {
+        FP24_copy(&g, &w);
+        PAIR_fexp(&g);
+        iterations++;
+        elapsed = (clock() - start) / (double)CLOCKS_PER_SEC;
+    } while (elapsed < MIN_TIME || iterations < MIN_ITERS);
+    elapsed = 1000.0 * elapsed / iterations;
+    printf("PAIRing FEXP        - %8d iterations  ", iterations);
+    printf(" %8.2lf ms per iteration\n", elapsed);
+
+    ECP_copy(&P, &G);
+    ECP4_copy(&Q, &W);
+
+    PAIR_G1mul(&P, s);
+    PAIR_ate(&g, &Q, &P);
+    PAIR_fexp(&g);
+
+    ECP_copy(&P, &G);
+
+    PAIR_G2mul(&Q, s);
+    PAIR_ate(&w, &Q, &P);
+    PAIR_fexp(&w);
+
+	if (!PAIR_G1member(&P))
+	{
+        printf("FAILURE - P not in G1\n");
+        return 0;
+	}
+
+	if (!PAIR_G2member(&Q))
+	{
+        printf("FAILURE - Q not in G2\n");
+        return 0;
+	}
+
+	if (!PAIR_GTmember(&w))
+	{
+        printf("FAILURE - e(Q,P) not in GT\n");
+        return 0;
+	}
+
+    if (!FP24_equals(&g, &w))
+    {
+        printf("FAILURE - e(sQ,p)!=e(Q,sP) \n");
+        return 0;
+    }
+
+    ECP4_copy(&Q, &W);
+    PAIR_ate(&g, &Q, &P);
+    PAIR_fexp(&g);
+
+    PAIR_GTpow(&g, s);
+
+    if (!FP24_equals(&g, &w))
+    {
+        printf("FAILURE - e(sQ,p)!=e(Q,P)^s \n");
+        return 0;
+    }
+
+    ECP N1;
+    ECP4 N2;
+
+    ECP_inf(&N1);
+    ECP4_inf(&N2);
+
+    PAIR_ate(&g, &N2, &P);
+    PAIR_fexp(&g);
+
+    if (!FP24_isunity(&g))
+    {
+        printf("FAILURE - e(O,P) !=1 \n");
+        return 0;
+    }
+
+    PAIR_ate(&g, &Q, &N1);
+    PAIR_fexp(&g);
+
+    if (!FP24_isunity(&g))
+    {
+        printf("FAILURE - e(Q,O) !=1 \n");
+        return 0;
+    }
+    /*
+        PAIR_ate(&g,&N2,&N1);
+        PAIR_fexp(&g);
+
+        if (!FP24_isunity(&g))
+        {
+            printf("FAILURE - e(O,O) !=1 \n");
+            return 0;
+        }
+    */
+    return 0;
+}
+
+int bls48(csprng *RNG)
+{
+    using namespace BLS48556;
+    using namespace BLS48556_FP;
+    using namespace BLS48556_BIG;
+
+    int i, iterations;
+    clock_t start;
+    double elapsed;
+
+    ECP P, G;
+    ECP8 Q, W;
+    FP48 g, w;
+    FP rz;
+    FP8 rz8;
+
+    FP16 cm;
+    BIG a, b, s, r;
+
+    printf("\nTesting/Timing BLS48556 Pairings\n");
+
+    ECP_generator(&G);
+    BIG_rcopy(r, CURVE_Order);
+    FP_rand(&rz,RNG);
+    ECP_map2point(&P,&rz);
+    ECP_cfp(&P);
+
+    if (ECP_isinf(&P))
+    {
+        printf("HASHING FAILURE - P=O\n");
+        return 0;
+    }
+    ECP_mul(&P,r);
+    if (!ECP_isinf(&P))
+    {
+        printf("HASHING FAILURE - P=O\n");
+        return 0;
+    }
+
+    BIG_randtrunc(s, r, 2 * CURVE_SECURITY_BLS48556, RNG);
+
+    ECP_copy(&P, &G);
+    PAIR_G1mul(&P, r);
+
+    if (!ECP_isinf(&P))
+    {
+        printf("FAILURE - rG!=O\n");
+        return 0;
+    }
+
+    iterations = 0;
+    start = clock();
+    do {
+        ECP_copy(&P, &G);
+        PAIR_G1mul(&P, s);
+
+        iterations++;
+        elapsed = (clock() - start) / (double)CLOCKS_PER_SEC;
+    } while (elapsed < MIN_TIME || iterations < MIN_ITERS);
+    elapsed = 1000.0 * elapsed / iterations;
+    printf("G1 mul              - %8d iterations  ", iterations);
+    printf(" %8.2lf ms per iteration\n", elapsed);
+
+
+    ECP8_generator(&W);
+
+    FP8_rand(&rz8,RNG);
+    ECP8_map2point(&Q,&rz8);
+    ECP8_cfp(&Q);
+
+    if (ECP8_isinf(&Q))
+    {
+        printf("HASHING FAILURE - P=O\n");
+        return 0;
+    }
+
+    ECP8_mul(&Q,r);
+    if (!ECP8_isinf(&Q))
+    {
+        printf("FAILURE - rQ!=O\n");
+        return 0;
+    }
+    ECP8_copy(&Q, &W);
+
+    //ECP8_mul(&Q,r);
+    PAIR_G2mul(&Q, r);
+
+    if (!ECP8_isinf(&Q))
+    {
+        printf("FAILURE - rQ!=O\n");
+        return 0;
+    }
+
+    iterations = 0;
+    start = clock();
+    do {
+        ECP8_copy(&Q, &W);
+        PAIR_G2mul(&Q, s);
+
+        iterations++;
+        elapsed = (clock() - start) / (double)CLOCKS_PER_SEC;
+    } while (elapsed < MIN_TIME || iterations < MIN_ITERS);
+    elapsed = 1000.0 * elapsed / iterations;
+    printf("G2 mul              - %8d iterations  ", iterations);
+    printf(" %8.2lf ms per iteration\n", elapsed);
+
+
+    PAIR_ate(&w, &Q, &P);
+    PAIR_fexp(&w);
+
+    FP48_copy(&g, &w);
+
+    PAIR_GTpow(&g, r);
+
+    if (!FP48_isunity(&g))
+    {
+        printf("FAILURE - g^r!=1\n");
+        return 0;
+    }
+
+    iterations = 0;
+    start = clock();
+    do {
+        FP48_copy(&g, &w);
+        PAIR_GTpow(&g, s);
+
+        iterations++;
+        elapsed = (clock() - start) / (double)CLOCKS_PER_SEC;
+    } while (elapsed < MIN_TIME || iterations < MIN_ITERS);
+    elapsed = 1000.0 * elapsed / iterations;
+    printf("GT pow              - %8d iterations  ", iterations);
+    printf(" %8.2lf ms per iteration\n", elapsed);
+/*
+    FP48_copy(&g, &w);
+
+    iterations = 0;
+    start = clock();
+    do {
+        FP48_compow(&cm, &g, s, r);
+        iterations++;
+        elapsed = (clock() - start) / (double)CLOCKS_PER_SEC;
+    } while (elapsed < MIN_TIME || iterations < MIN_ITERS);
+    elapsed = 1000.0 * elapsed / iterations;
+    printf("GT pow (compressed) - %8d iterations  ", iterations);
+    printf(" %8.2lf ms per iteration\n", elapsed);
+*/
+    iterations = 0;
+    start = clock();
+    do {
+        PAIR_ate(&w, &Q, &P);
+        iterations++;
+        elapsed = (clock() - start) / (double)CLOCKS_PER_SEC;
+    } while (elapsed < MIN_TIME || iterations < MIN_ITERS);
+    elapsed = 1000.0 * elapsed / iterations;
+    printf("PAIRing ATE         - %8d iterations  ", iterations);
+    printf(" %8.2lf ms per iteration\n", elapsed);
+
+    iterations = 0;
+    start = clock();
+    do {
+        FP48_copy(&g, &w);
+        PAIR_fexp(&g);
+        iterations++;
+        elapsed = (clock() - start) / (double)CLOCKS_PER_SEC;
+    } while (elapsed < MIN_TIME || iterations < MIN_ITERS);
+    elapsed = 1000.0 * elapsed / iterations;
+    printf("PAIRing FEXP        - %8d iterations  ", iterations);
+    printf(" %8.2lf ms per iteration\n", elapsed);
+
+    ECP_copy(&P, &G);
+    ECP8_copy(&Q, &W);
+
+    PAIR_G1mul(&P, s);
+    PAIR_ate(&g, &Q, &P);
+    PAIR_fexp(&g);
+
+    ECP_copy(&P, &G);
+
+    PAIR_G2mul(&Q, s);
+    //ECP8_mul(&Q,s);
+    PAIR_ate(&w, &Q, &P);
+    PAIR_fexp(&w);
+
+	if (!PAIR_G1member(&P))
+	{
+        printf("FAILURE - P not in G1\n");
+        return 0;
+	}
+
+	if (!PAIR_G2member(&Q))
+	{
+        printf("FAILURE - Q not in G2\n");
+        return 0;
+	}
+
+	if (!PAIR_GTmember(&w))
+	{
+        printf("FAILURE - e(Q,P) not in GT\n");
+        return 0;
+	}
+
+    if (!FP48_equals(&g, &w))
+    {
+        printf("FAILURE - e(sQ,p)!=e(Q,sP) \n");
+        return 0;
+    }
+
+    ECP8_copy(&Q, &W);
+    PAIR_ate(&g, &Q, &P);
+    PAIR_fexp(&g);
+
+    PAIR_GTpow(&g, s);
+
+    if (!FP48_equals(&g, &w))
+    {
+        printf("FAILURE - e(sQ,p)!=e(Q,P)^s \n");
+        return 0;
+    }
+
+    ECP N1;
+    ECP8 N2;
+
+    ECP_inf(&N1);
+    ECP8_inf(&N2);
+
+    PAIR_ate(&g, &N2, &P);
+    PAIR_fexp(&g);
+
+    if (!FP48_isunity(&g))
+    {
+        printf("FAILURE - e(O,P) !=1 \n");
+        return 0;
+    }
+
+    PAIR_ate(&g, &Q, &N1);
+    PAIR_fexp(&g);
+
+    if (!FP48_isunity(&g))
+    {
+        printf("FAILURE - e(Q,O) !=1 \n");
+        return 0;
+    }
+    /*
+        PAIR_ate(&g,&N2,&N1);
+        PAIR_fexp(&g);
+
+        if (!FP48_isunity(&g))
+        {
+            printf("FAILURE - e(O,O) !=1 \n");
+            return 0;
+        }
+    */
+    return 0;
+}
+#endif
+
+int rsa2048(csprng *RNG)
+{
+    using namespace RSA2048;
+
+    rsa_public_key pub;
+    rsa_private_key priv;
+
+    int i, iterations;
+    clock_t start;
+    double elapsed;
+
+    char m[RFS_RSA2048], d[RFS_RSA2048], c[RFS_RSA2048];
+    octet M = {0, sizeof(m), m};
+    octet D = {0, sizeof(d), d};
+    octet C = {0, sizeof(c), c};
+
+    printf("\nTesting/Timing 2048-bit RSA\n");
+
+    printf("Generating 2048-bit RSA public/private key pair\n");
+
+    iterations = 0;
+    start = clock();
+    do {
+        RSA_KEY_PAIR(RNG, 65537, &priv, &pub, NULL, NULL);
+        iterations++;
+        elapsed = (clock() - start) / (double)CLOCKS_PER_SEC;
+    } while (elapsed < MIN_TIME || iterations < 1);
+    elapsed = 1000.0 * elapsed / iterations;
+    printf("RSA gen - %8d iterations  ", iterations);
+    printf(" %8.2lf ms per iteration\n", elapsed);
+
+    M.len = RFS_RSA2048;
+    for (i = 0; i < RFS_RSA2048; i++) M.val[i] = i % 128;
+
+    iterations = 0;
+    start = clock();
+    do {
+        RSA_ENCRYPT(&pub, &M, &C);
+        iterations++;
+        elapsed = (clock() - start) / (double)CLOCKS_PER_SEC;
+    } while (elapsed < MIN_TIME || iterations < MIN_ITERS);
+    elapsed = 1000.0 * elapsed / iterations;
+    printf("RSA enc - %8d iterations  ", iterations);
+    printf(" %8.2lf ms per iteration\n", elapsed);
+
+    iterations = 0;
+    start = clock();
+    do {
+        RSA_DECRYPT(&priv, &C, &D);
+        iterations++;
+        elapsed = (clock() - start) / (double)CLOCKS_PER_SEC;
+    } while (elapsed < MIN_TIME || iterations < MIN_ITERS);
+    elapsed = 1000.0 * elapsed / iterations;
+    printf("RSA dec - %8d iterations  ", iterations);
+    printf(" %8.2lf ms per iteration\n", elapsed);
+
+    for (i = 0; i < RFS_RSA2048; i++)
+    {
+        if (M.val[i] != D.val[i])
+        {
+            printf("FAILURE - RSA decryption\n");
+            return 0;
+        }
+    }
+
+    printf("All tests pass\n");
+
+    return 0;
+}
+
+int main()
+{
+    csprng RNG;
+    int i;
+    char pr[10];
+    unsigned long ran;
+
+    time((time_t *)&ran);
+    pr[0] = ran;
+    pr[1] = ran >> 8;
+    pr[2] = ran >> 16;
+    pr[3] = ran >> 24;
+    for (i = 4; i < 10; i++) pr[i] = i; /*****4****/
+    RAND_seed(&RNG, 10, pr);
+
+    ed25519(&RNG);
+#if CHUNK==32 || CHUNK==64
+    nist256(&RNG);
+    ed448(&RNG);
+#endif
+    bn254(&RNG);
+#if CHUNK==32 || CHUNK==64
+    bls383(&RNG);
+    bls24(&RNG);
+    bls48(&RNG);
+#endif
+    rsa2048(&RNG);
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/big.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/big.cpp
new file mode 100644
index 0000000..3009e4d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/big.cpp
@@ -0,0 +1,1830 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* CORE basic functions for BIG type */
+/* SU=m, SU is Stack Usage */
+
+#include "big_XXX.h"
+
+//int XXX::BIGMULS=0;
+//int XXX::BIGSQRS=0;
+
+/* test a=0? */
+int XXX::BIG_iszilch(BIG a)
+{
+    int i;
+    chunk d=0;
+    for (i = 0; i < NLEN_XXX; i++)
+        d|=a[i];
+    return (1 & ((d-1)>>BASEBITS_XXX));
+}
+
+/* test a=1? */
+int XXX::BIG_isunity(BIG a)
+{
+    int i;
+    chunk d=0;
+    for (i = 1; i < NLEN_XXX; i++)
+        d|=a[i];
+    return (1 & ((d-1)>>BASEBITS_XXX) & (((a[0]^1)-1)>>BASEBITS_XXX));
+}
+
+/* test a=0? */
+int XXX::BIG_diszilch(DBIG a)
+{
+    int i;
+    chunk d=0;
+    for (i = 0; i < DNLEN_XXX; i++)
+        d|=a[i];
+    return (1 & ((d-1)>>BASEBITS_XXX));
+}
+
+/* SU= 56 */
+/* output a */
+void XXX::BIG_output(BIG a)
+{
+    BIG b;
+    int i, len;
+    len = BIG_nbits(a);
+    if (len % 4 == 0) len /= 4;
+    else
+    {
+        len /= 4;
+        len++;
+    }
+    if (len < MODBYTES_XXX * 2) len = MODBYTES_XXX * 2;
+
+    for (i = len - 1; i >= 0; i--)
+    {
+        BIG_copy(b, a);
+        BIG_shr(b, i * 4);
+        printf("%01x", (unsigned int) b[0] & 15);
+    }
+}
+
+/* SU= 16 */
+void XXX::BIG_rawoutput(BIG a)
+{
+    int i;
+    printf("(");
+    for (i = 0; i < NLEN_XXX - 1; i++)
+#if CHUNK==64
+        printf("%jx,", (uintmax_t) a[i]);
+    printf("%jx)", (uintmax_t) a[NLEN_XXX - 1]);
+#else
+        printf("%x,", (unsigned int) a[i]);
+    printf("%x)", (unsigned int) a[NLEN_XXX - 1]);
+#endif
+}
+
+// modified to prevent Nonce@Once side channel attack
+// Two tricks to thwart compiler optimization
+// 1. Prevent mask removal by performing transformation that might change the mask, but in fact does not
+// 2. Force the code to calculate an intermediate value, by making it part of (an unused) return value
+// problem is XORing with all zeros or XORing with "random" shows up in side-channel, and reveals d
+
+/* Swap a and b if d=1 */
+chunk XXX::BIG_cswap(BIG a, BIG b, int d)
+{
+    int i;
+    chunk e, r, ra, w, t, c = (chunk) - d;
+    w=0; 
+    r=a[0]^b[1];  // sort of random
+    ra=r+r; ra>>=1; // I know this doesn't change r, but the compiler doesn't!
+#ifdef DEBUG_NORM
+    for (i = 0; i < NLEN_XXX + 2; i++)
+#else
+    for (i = 0; i < NLEN_XXX; i++)
+#endif
+    {
+        t = c & (a[i] ^ b[i]);
+        t^=r; 
+        e=a[i]^t; w^=e;  // to force calculation of e
+        a[i]=e^ra;
+        e=b[i]^t; w^=e;
+        b[i]=e^ra;
+    }
+    return w; // to bewilder optimizer
+}
+
+/* Move g to f if d=1 */
+chunk XXX::BIG_cmove(BIG f, BIG g, int d)
+{
+    int i;
+    chunk e,w,r,ra,t,b = (chunk) - d;
+    w=0;
+    r=f[0]^g[1];
+    ra=r+r; ra>>=1; // I know this doesn't change r, but the compiler doesn't!
+#ifdef DEBUG_NORM
+    for (i = 0; i < NLEN_XXX + 2; i++)
+#else
+    for (i = 0; i < NLEN_XXX; i++)
+#endif
+    {
+        t=(f[i]^g[i])&b;
+        t^=r;
+        e=f[i]^t; w^=e;  // to force calculation of e
+        f[i]=e^ra;
+    }
+    return w; // to bewilder optimizer
+}
+
+/* Move g to f if d=1 */
+chunk XXX::BIG_dcmove(DBIG f, DBIG g, int d)
+{
+    int i;
+    chunk e,w,r,ra,t,b = (chunk) - d;
+    w=0;
+    r=f[0]^g[1];
+    ra=r+r; ra>>=1; // I know this doesn't change r, but the compiler doesn't!
+#ifdef DEBUG_NORM
+    for (i = 0; i < DNLEN_XXX + 2; i++)
+#else
+    for (i = 0; i < DNLEN_XXX; i++)
+#endif
+    {
+        t=(f[i]^g[i])&b;
+        t^=r;
+        e=f[i]^t; w^=e;
+        f[i]=e^ra;
+    }
+    return w;
+}
+
+/* convert BIG to/from bytes */
+/* SU= 64 */
+void XXX::BIG_toBytes(char *b, BIG a)
+{
+    int i;
+    BIG c;
+    BIG_copy(c, a);
+    BIG_norm(c);
+    for (i = MODBYTES_XXX - 1; i >= 0; i--)
+    {
+        b[i] = c[0] & 0xff;
+        BIG_fshr(c, 8);
+    }
+}
+
+/* SU= 16 */
+void XXX::BIG_fromBytes(BIG a, char *b)
+{
+    int i;
+    BIG_zero(a);
+    for (i = 0; i < MODBYTES_XXX; i++)
+    {
+        BIG_fshl(a, 8);
+        a[0] += (int)(unsigned char)b[i];
+    }
+#ifdef DEBUG_NORM
+    a[MPV_XXX] = 1; a[MNV_XXX] = 0;
+#endif
+}
+
+void XXX::BIG_fromBytesLen(BIG a, char *b, int s)
+{
+    int i, len = s;
+    BIG_zero(a);
+
+    if (len > MODBYTES_XXX) len = MODBYTES_XXX;
+    for (i = 0; i < len; i++)
+    {
+        BIG_fshl(a, 8);
+        a[0] += (int)(unsigned char)b[i];
+    }
+#ifdef DEBUG_NORM
+    a[MPV_XXX] = 1; a[MNV_XXX] = 0;
+#endif
+}
+
+
+
+/* SU= 88 */
+void XXX::BIG_doutput(DBIG a)
+{
+    DBIG b;
+    int i, len;
+    BIG_dnorm(a);
+    len = BIG_dnbits(a);
+    if (len % 4 == 0) len /= 4;
+    else
+    {
+        len /= 4;
+        len++;
+    }
+
+    for (i = len - 1; i >= 0; i--)
+    {
+        BIG_dcopy(b, a);
+        BIG_dshr(b, i * 4);
+        printf("%01x", (unsigned int) b[0] & 15);
+    }
+}
+
+
+void XXX::BIG_drawoutput(DBIG a)
+{
+    int i;
+    printf("(");
+    for (i = 0; i < DNLEN_XXX - 1; i++)
+#if CHUNK==64
+        printf("%jx,", (uintmax_t) a[i]);
+    printf("%jx)", (uintmax_t) a[DNLEN_XXX - 1]);
+#else
+        printf("%x,", (unsigned int) a[i]);
+    printf("%x)", (unsigned int) a[DNLEN_XXX - 1]);
+#endif
+}
+
+/* Copy b=a */
+void XXX::BIG_copy(BIG b, BIG a)
+{
+    int i;
+    for (i = 0; i < NLEN_XXX; i++)
+        b[i] = a[i];
+#ifdef DEBUG_NORM
+    b[MPV_XXX] = a[MPV_XXX];
+    b[MNV_XXX] = a[MNV_XXX];
+#endif
+}
+
+/* Copy from ROM b=a */
+void XXX::BIG_rcopy(BIG b, const BIG a)
+{
+    int i;
+    for (i = 0; i < NLEN_XXX; i++)
+        b[i] = a[i];
+#ifdef DEBUG_NORM
+    b[MPV_XXX] = 1; b[MNV_XXX] = 0;
+#endif
+}
+
+/* double length DBIG copy b=a */
+void XXX::BIG_dcopy(DBIG b, DBIG a)
+{
+    int i;
+    for (i = 0; i < DNLEN_XXX; i++)
+        b[i] = a[i];
+#ifdef DEBUG_NORM
+    b[DMPV_XXX] = a[DMPV_XXX];
+    b[DMNV_XXX] = a[DMNV_XXX];
+#endif
+}
+
+/* Copy BIG to bottom half of DBIG */
+void XXX::BIG_dscopy(DBIG b, BIG a)
+{
+    int i;
+    for (i = 0; i < NLEN_XXX - 1; i++)
+        b[i] = a[i];
+
+    b[NLEN_XXX - 1] = a[NLEN_XXX - 1] & BMASK_XXX; /* top word normalized */
+    b[NLEN_XXX] = a[NLEN_XXX - 1] >> BASEBITS_XXX;
+
+    for (i = NLEN_XXX + 1; i < DNLEN_XXX; i++) b[i] = 0;
+#ifdef DEBUG_NORM
+    b[DMPV_XXX] = a[MPV_XXX];
+    b[DMNV_XXX] = a[MNV_XXX];
+#endif
+}
+
+/* Copy BIG to top half of DBIG */
+void XXX::BIG_dsucopy(DBIG b, BIG a)
+{
+    int i;
+    for (i = 0; i < NLEN_XXX; i++)
+        b[i] = 0;
+    for (i = NLEN_XXX; i < DNLEN_XXX; i++)
+        b[i] = a[i - NLEN_XXX];
+#ifdef DEBUG_NORM
+    b[DMPV_XXX] = a[MPV_XXX];
+    b[DMNV_XXX] = a[MNV_XXX];
+#endif
+}
+
+/* Copy bottom half of DBIG to BIG */
+void XXX::BIG_sdcopy(BIG b, DBIG a)
+{
+    int i;
+    for (i = 0; i < NLEN_XXX; i++)
+        b[i] = a[i];
+#ifdef DEBUG_NORM
+    b[MPV_XXX] = a[DMPV_XXX];
+    b[MNV_XXX] = a[DMNV_XXX];
+#endif
+}
+
+/* Copy top half of DBIG to BIG */
+void XXX::BIG_sducopy(BIG b, DBIG a)
+{
+    int i;
+    for (i = 0; i < NLEN_XXX; i++)
+        b[i] = a[i + NLEN_XXX];
+#ifdef DEBUG_NORM
+    b[MPV_XXX] = a[DMPV_XXX];
+    b[MNV_XXX] = a[DMNV_XXX];
+
+#endif
+}
+
+/* Set a=0 */
+void XXX::BIG_zero(BIG a)
+{
+    int i;
+    for (i = 0; i < NLEN_XXX; i++)
+        a[i] = 0;
+#ifdef DEBUG_NORM
+    a[MPV_XXX] = a[MNV_XXX] = 0;
+#endif
+}
+
+void XXX::BIG_dzero(DBIG a)
+{
+    int i;
+    for (i = 0; i < DNLEN_XXX; i++)
+        a[i] = 0;
+#ifdef DEBUG_NORM
+    a[DMPV_XXX] = a[DMNV_XXX] = 0;
+#endif
+}
+
+/* set a=1 */
+void XXX::BIG_one(BIG a)
+{
+    int i;
+    a[0] = 1;
+    for (i = 1; i < NLEN_XXX; i++)
+        a[i] = 0;
+#ifdef DEBUG_NORM
+    a[MPV_XXX] = 1;
+    a[MNV_XXX] = 0;
+#endif
+}
+
+/* Set c=a+b */
+/* SU= 8 */
+void XXX::BIG_add(BIG c, BIG a, BIG b)
+{
+    int i;
+    for (i = 0; i < NLEN_XXX; i++)
+        c[i] = a[i] + b[i];
+#ifdef DEBUG_NORM
+    c[MPV_XXX] = a[MPV_XXX] + b[MPV_XXX];
+    c[MNV_XXX] = a[MNV_XXX] + b[MNV_XXX];
+    if (c[MPV_XXX] > NEXCESS_XXX)  printf("add problem - positive digit overflow %d\n", (int)c[MPV_XXX]);
+    if (c[MNV_XXX] > NEXCESS_XXX)  printf("add problem - negative digit overflow %d\n", (int)c[MNV_XXX]);
+
+#endif
+}
+
+/* Set c=a or b */
+/* SU= 8 */
+void XXX::BIG_or(BIG c, BIG a, BIG b)
+{
+    int i;
+    BIG_norm(a);
+    BIG_norm(b);
+    for (i = 0; i < NLEN_XXX; i++)
+        c[i] = a[i] | b[i];
+#ifdef DEBUG_NORM
+    c[MPV_XXX] = 1;
+    c[MNV_XXX] = 0;
+#endif
+
+}
+
+
+/* Set c=c+d */
+void XXX::BIG_inc(BIG c, int d)
+{
+    BIG_norm(c);
+    c[0] += (chunk)d;
+#ifdef DEBUG_NORM
+    c[MPV_XXX] += 1;
+#endif
+}
+
+/* Set c=a-b */
+/* SU= 8 */
+void XXX::BIG_sub(BIG c, BIG a, BIG b)
+{
+    int i;
+    for (i = 0; i < NLEN_XXX; i++)
+        c[i] = a[i] - b[i];
+#ifdef DEBUG_NORM
+    c[MPV_XXX] = a[MPV_XXX] + b[MNV_XXX];
+    c[MNV_XXX] = a[MNV_XXX] + b[MPV_XXX];
+    if (c[MPV_XXX] > NEXCESS_XXX)  printf("sub problem - positive digit overflow %d\n", (int)c[MPV_XXX]);
+    if (c[MNV_XXX] > NEXCESS_XXX)  printf("sub problem - negative digit overflow %d\n", (int)c[MNV_XXX]);
+
+#endif
+}
+
+/* SU= 8 */
+
+void XXX::BIG_dsub(DBIG c, DBIG a, DBIG b)
+{
+    int i;
+    for (i = 0; i < DNLEN_XXX; i++)
+        c[i] = a[i] - b[i];
+#ifdef DEBUG_NORM
+    c[DMPV_XXX] = a[DMPV_XXX] + b[DMNV_XXX];
+    c[DMNV_XXX] = a[DMNV_XXX] + b[DMPV_XXX];
+    if (c[DMPV_XXX] > NEXCESS_XXX)  printf("double sub problem - positive digit overflow %d\n", (int)c[DMPV_XXX]);
+    if (c[DMNV_XXX] > NEXCESS_XXX)  printf("double sub problem - negative digit overflow %d\n", (int)c[DMNV_XXX]);
+#endif
+}
+
+void XXX::BIG_dadd(DBIG c, DBIG a, DBIG b)
+{
+    int i;
+    for (i = 0; i < DNLEN_XXX; i++)
+        c[i] = a[i] + b[i];
+#ifdef DEBUG_NORM
+    c[DMPV_XXX] = a[DMPV_XXX] + b[DMNV_XXX];
+    c[DMNV_XXX] = a[DMNV_XXX] + b[DMPV_XXX];
+    if (c[DMPV_XXX] > NEXCESS_XXX)  printf("double add problem - positive digit overflow %d\n", (int)c[DMPV_XXX]);
+    if (c[DMNV_XXX] > NEXCESS_XXX)  printf("double add problem - negative digit overflow %d\n", (int)c[DMNV_XXX]);
+#endif
+}
+
+/* Set c=c-1 */
+void XXX::BIG_dec(BIG c, int d)
+{
+    BIG_norm(c);
+    c[0] -= (chunk)d;
+#ifdef DEBUG_NORM
+    c[MNV_XXX] += 1;
+#endif
+}
+
+/* multiplication r=a*c by c<=NEXCESS_XXX */
+void XXX::BIG_imul(BIG r, BIG a, int c)
+{
+    int i;
+    for (i = 0; i < NLEN_XXX; i++) r[i] = a[i] * c;
+#ifdef DEBUG_NORM
+    r[MPV_XXX] = a[MPV_XXX] * c;
+    r[MNV_XXX] = a[MNV_XXX] * c;
+    if (r[MPV_XXX] > NEXCESS_XXX)  printf("int mul problem - positive digit overflow %d\n", (int)r[MPV_XXX]);
+    if (r[MNV_XXX] > NEXCESS_XXX)  printf("int mul problem - negative digit overflow %d\n", (int)r[MNV_XXX]);
+
+#endif
+}
+
+/* multiplication r=a*c by larger integer - c<=FEXCESS */
+/* SU= 24 */
+chunk XXX::BIG_pmul(BIG r, BIG a, int c)
+{
+    int i;
+    chunk ak, carry = 0;
+    for (i = 0; i < NLEN_XXX; i++)
+    {
+        ak = a[i];
+        r[i] = 0;
+        carry = muladd(ak, (chunk)c, carry, &r[i]);
+    }
+#ifdef DEBUG_NORM
+    r[MPV_XXX] = 1;
+    r[MNV_XXX] = 0;
+#endif
+    return carry;
+}
+
+/* r/=3 */
+/* SU= 16 */
+/*
+int XXX::BIG_div3(BIG r)
+{
+    int i;
+    chunk ak,base,carry=0;
+    BIG_norm(r);
+    base=((chunk)1<<BASEBITS_XXX);
+    for (i=NLEN_XXX-1; i>=0; i--)
+    {
+        ak=(carry*base+r[i]);
+        r[i]=ak/3;
+        carry=ak%3;
+    }
+    return (int)carry;
+}
+*/
+/* multiplication c=a*b by even larger integer b>FEXCESS, resulting in DBIG */
+/* SU= 24 */
+void XXX::BIG_pxmul(DBIG c, BIG a, int b)
+{
+    int j;
+    chunk carry;
+    BIG_dzero(c);
+    carry = 0;
+    for (j = 0; j < NLEN_XXX; j++)
+        carry = muladd(a[j], (chunk)b, carry, &c[j]);
+    c[NLEN_XXX] = carry;
+#ifdef DEBUG_NORM
+    c[DMPV_XXX] = 1;
+    c[DMNV_XXX] = 0;
+#endif
+}
+
+/* .. if you know the result will fit in a BIG, c must be distinct from a and b */
+/* SU= 40 */
+void XXX::BIG_smul(BIG c, BIG a, BIG b)
+{
+    int i, j;
+    chunk carry;
+
+    BIG_zero(c);
+    for (i = 0; i < NLEN_XXX; i++)
+    {
+        carry = 0;
+        for (j = 0; j < NLEN_XXX; j++)
+        {
+            if (i + j < NLEN_XXX)
+                carry = muladd(a[i], b[j], carry, &c[i + j]);
+        }
+    }
+#ifdef DEBUG_NORM
+    c[MPV_XXX] = 1;
+    c[MNV_XXX] = 0;
+#endif
+
+}
+
+/* Set c=a*b */
+/* SU= 72 */
+void XXX::BIG_mul(DBIG c, BIG a, BIG b)
+{
+    int i,k;
+#ifdef dchunk
+    dchunk co,t;
+    dchunk s;
+    dchunk d[NLEN_XXX];
+    int m;
+#endif
+
+//XXX::BIGMULS++;
+
+#ifdef DEBUG_NORM
+    if ((a[MPV_XXX] != 1 && a[MPV_XXX] != 0) || a[MNV_XXX] != 0) printf("First input to mul not normed\n");
+    if ((b[MPV_XXX] != 1 && b[MPV_XXX] != 0) || b[MNV_XXX] != 0) printf("Second input to mul not normed\n");
+#endif
+
+    /* Faster to Combafy it.. Let the compiler unroll the loops! */
+
+#ifdef COMBA
+
+    /* faster psuedo-Karatsuba method */
+#ifdef UNWOUND
+
+#ifdef USE_KARATSUBA
+
+    INLINE_MUL2
+
+#else
+
+    INLINE_MUL1
+
+#endif
+
+#else
+
+#ifndef USE_KARATSUBA
+
+    t=(dchunk)a[0]*b[0];
+    c[0]=(chunk)t & BMASK_XXX;
+    t = t >> BASEBITS_XXX;
+    for (i=1;i<NLEN_XXX;i++)
+    {
+        k=0; 
+        while (k<=i) {t+=(dchunk)a[k]*b[i-k]; k++;}
+        c[i]=(chunk)t & BMASK_XXX;
+        t = t >> BASEBITS_XXX;
+    }
+
+    for (i=NLEN_XXX;i<2*NLEN_XXX-1;i++)
+    {
+        k=i-(NLEN_XXX-1);
+        while (k<=NLEN_XXX-1) {t+=(dchunk)a[k]*b[i-k]; k++;}
+        c[i]=(chunk)t & BMASK_XXX;
+        t = t >> BASEBITS_XXX;
+    }
+
+    c[2 * NLEN_XXX - 1] = (chunk)t;
+#else
+
+    for (i = 0; i < NLEN_XXX; i++)
+        d[i] = (dchunk)a[i] * b[i];
+
+    s = d[0];
+    t = s;
+    c[0] = (chunk)t & BMASK_XXX;
+    t = t >> BASEBITS_XXX;
+
+    for (k = 1; k < NLEN_XXX; k++)
+    {
+        s += d[k];
+        t += s;
+        /*for (i = k; i >= 1 + k / 2; i--) This causes a huge slow down! gcc/g++ optimizer problem (I think) */
+        for (i=1+k/2;i<=k;i++) t += (dchunk)(a[i] - a[k - i]) * (b[k - i] - b[i]);
+        c[k] = (chunk)t & BMASK_XXX;
+        t = t >> BASEBITS_XXX;
+    }
+    for (k = NLEN_XXX; k < 2 * NLEN_XXX - 1; k++)
+    {
+        s -= d[k - NLEN_XXX];
+        t += s;
+        for (i=1+k/2;i<NLEN_XXX;i++) t += (dchunk)(a[i] - a[k - i]) * (b[k - i] - b[i]);
+        c[k] = (chunk)t & BMASK_XXX;
+        t = t >> BASEBITS_XXX;
+    }
+    c[2 * NLEN_XXX - 1] = (chunk)t;
+#endif
+#endif
+
+#else
+    int j;
+    chunk carry;
+    BIG_dzero(c);
+    for (i = 0; i < NLEN_XXX; i++)
+    {
+        carry = 0;
+        for (j = 0; j < NLEN_XXX; j++)
+            carry = muladd(a[i], b[j], carry, &c[i + j]);
+
+        c[NLEN_XXX + i] = carry;
+    }
+
+#endif
+
+#ifdef DEBUG_NORM
+    c[DMPV_XXX] = 1;
+    c[DMNV_XXX] = 0;
+#endif
+}
+
+/* Set c=a*a */
+/* SU= 80 */
+void XXX::BIG_sqr(DBIG c, BIG a)
+{
+    int i, j;
+#ifdef dchunk
+    dchunk t, co;
+#endif
+//XXX::BIGSQRS++;
+#ifdef DEBUG_NORM
+    if ((a[MPV_XXX] != 1 && a[MPV_XXX] != 0) || a[MNV_XXX] != 0) printf("Input to sqr not normed\n");
+#endif
+    /* Note 2*a[i] in loop below and extra addition */
+
+#ifdef COMBA
+
+#ifdef UNWOUND
+
+    INLINE_SQR
+
+#else
+
+
+    t = (dchunk)a[0] * a[0];
+    c[0] = (chunk)t & BMASK_XXX;
+    co = t >> BASEBITS_XXX;
+
+    for (j = 1; j < NLEN_XXX - 1; )
+    {
+        t = (dchunk)a[j] * a[0];
+        for (i = 1; i < (j + 1) / 2; i++) {t += (dchunk)a[j - i] * a[i]; }
+        t += t; t += co;
+        c[j] = (chunk)t & BMASK_XXX;
+        co = t >> BASEBITS_XXX;
+        j++;
+        t = (dchunk)a[j] * a[0];
+        for (i = 1; i < (j + 1) / 2; i++) {t += (dchunk)a[j - i] * a[i]; }
+        t += t; t += co;
+        t += (dchunk)a[j / 2] * a[j / 2];
+        c[j] = (chunk)t & BMASK_XXX;
+        co = t >> BASEBITS_XXX;
+        j++;
+    }
+
+    for (j = NLEN_XXX - 1 + NLEN_XXX % 2; j < DNLEN_XXX - 3; )
+    {
+        t = (dchunk)a[NLEN_XXX - 1] * a[j - NLEN_XXX + 1];
+        for (i = j - NLEN_XXX + 2; i < (j + 1) / 2; i++) {t += (dchunk)a[j - i] * a[i];  }
+        t += t; t += co;
+        c[j] = (chunk)t & BMASK_XXX;
+        co = t >> BASEBITS_XXX;
+        j++;
+        t = (dchunk)a[NLEN_XXX - 1] * a[j - NLEN_XXX + 1];
+        for (i = j - NLEN_XXX + 2; i < (j + 1) / 2; i++) {t += (dchunk)a[j - i] * a[i];  }
+        t += t; t += co;
+        t += (dchunk)a[j / 2] * a[j / 2];
+        c[j] = (chunk)t & BMASK_XXX;
+        co = t >> BASEBITS_XXX;
+        j++;
+    }
+
+    t = (dchunk)a[NLEN_XXX - 2] * a[NLEN_XXX - 1];
+    t += t; t += co;
+    c[DNLEN_XXX - 3] = (chunk)t & BMASK_XXX;
+    co = t >> BASEBITS_XXX;
+
+    t = (dchunk)a[NLEN_XXX - 1] * a[NLEN_XXX - 1] + co;
+    c[DNLEN_XXX - 2] = (chunk)t & BMASK_XXX;
+    co = t >> BASEBITS_XXX;
+    c[DNLEN_XXX - 1] = (chunk)co;
+
+
+#endif
+
+#else
+    chunk carry;
+    BIG_dzero(c);
+    for (i = 0; i < NLEN_XXX; i++)
+    {
+        carry = 0;
+        for (j = i + 1; j < NLEN_XXX; j++)
+            carry = muladd(a[i], a[j], carry, &c[i + j]);
+        c[NLEN_XXX + i] = carry;
+    }
+
+    for (i = 0; i < DNLEN_XXX; i++) c[i] *= 2;
+
+    for (i = 0; i < NLEN_XXX; i++)
+        c[2 * i + 1] += muladd(a[i], a[i], 0, &c[2 * i]);
+
+    BIG_dnorm(c); 
+#endif
+
+
+#ifdef DEBUG_NORM
+    c[DMPV_XXX] = 1;
+    c[DMNV_XXX] = 0;
+#endif
+
+}
+
+/* Montgomery reduction */
+void XXX::BIG_monty(BIG a, BIG md, chunk MC, DBIG d)
+{
+    int i, k;
+
+#ifdef dchunk
+    dchunk c,t,s;
+    dchunk dd[NLEN_XXX];
+    chunk v[NLEN_XXX];
+#endif
+
+
+#ifdef DEBUG_NORM
+    if ((d[DMPV_XXX] != 1 && d[DMPV_XXX] != 0) || d[DMNV_XXX] != 0) printf("Input to redc not normed\n");
+#endif
+
+#ifdef COMBA
+
+#ifdef UNWOUND
+
+#ifdef USE_KARATSUBA
+
+    INLINE_REDC2
+
+#else
+
+    INLINE_REDC1
+
+#endif
+
+#else
+
+#ifndef USE_KARATSUBA 
+    t = d[0];
+    v[0] = ((chunk)t * MC)&BMASK_XXX;
+    t += (dchunk)v[0] * md[0];
+    t = (t >> BASEBITS_XXX) + d[1];
+   
+    for (i = 1; i < NLEN_XXX; i++)
+    {
+        k=1;
+        t += (dchunk)v[0] * md[i];
+        while (k<i) {t += (dchunk)v[k]*md[i-k]; k++;}
+        v[i] = ((chunk)t * MC)&BMASK_XXX;
+        t += (dchunk)v[i] * md[0];
+        t = (t >> BASEBITS_XXX) + d[i + 1];
+    }
+    for (i = NLEN_XXX; i < 2 * NLEN_XXX - 1; i++)
+    {
+        k=i-(NLEN_XXX-1);
+        while (k<=NLEN_XXX-1) {t += (dchunk)v[k]*md[i-k]; k++;}
+        a[i - NLEN_XXX] = (chunk)t & BMASK_XXX;
+        t = (t >> BASEBITS_XXX) + d[i + 1];
+    }
+    a[NLEN_XXX - 1] = (chunk)t & BMASK_XXX;
+#else
+
+    t = d[0];
+    v[0] = ((chunk)t * MC)&BMASK_XXX;
+    t += (dchunk)v[0] * md[0];
+    t = (t >> BASEBITS_XXX) + d[1];
+    s = 0;
+
+    for (k = 1; k < NLEN_XXX; k++)
+    {
+        t = t + s + (dchunk)v[0] * md[k];
+
+        for (i=1+k/2;i<k;i++) t += (dchunk)(v[k - i] - v[i]) * (md[i] - md[k - i]);
+        v[k] = ((chunk)t * MC)&BMASK_XXX;
+        t += (dchunk)v[k] * md[0];
+        t = (t >> BASEBITS_XXX) + d[k + 1];
+        dd[k] = (dchunk)v[k] * md[k];
+        s += dd[k];
+    }
+    for (k = NLEN_XXX; k < 2 * NLEN_XXX - 1; k++)
+    {
+        t = t + s;
+        for (i=1+k/2;i<NLEN_XXX;i++) t += (dchunk)(v[k - i] - v[i]) * (md[i] - md[k - i]);
+        a[k - NLEN_XXX] = (chunk)t & BMASK_XXX;
+        t = (t >> BASEBITS_XXX) + d[k + 1];
+        s -= dd[k - NLEN_XXX + 1];
+    }
+    a[NLEN_XXX - 1] = (chunk)t & BMASK_XXX;
+#endif
+
+#endif
+
+
+
+#else
+    int j;
+    chunk m, carry;
+    for (i = 0; i < NLEN_XXX; i++)
+    {
+        if (MC == -1) m = (-d[i])&BMASK_XXX;
+        else
+        {
+            if (MC == 1) m = d[i];
+            else m = (MC * d[i])&BMASK_XXX;
+        }
+        carry = 0;
+        for (j = 0; j < NLEN_XXX; j++)
+            carry = muladd(m, md[j], carry, &d[i + j]);
+        d[NLEN_XXX + i] += carry;
+    }
+    BIG_sducopy(a, d);
+    BIG_norm(a);
+
+#endif
+
+#ifdef DEBUG_NORM
+    a[MPV_XXX] = 1;  a[MNV_XXX] = 0;
+#endif
+}
+
+/* General shift left of a by n bits */
+/* a MUST be normalised */
+/* SU= 32 */
+void XXX::BIG_shl(BIG a, int k)
+{
+    int i;
+    int n = k % BASEBITS_XXX;
+    int m = k / BASEBITS_XXX;
+
+    a[NLEN_XXX - 1] = ((a[NLEN_XXX - 1 - m] << n));
+    if (NLEN_XXX >= m + 2) a[NLEN_XXX - 1] |= (a[NLEN_XXX - m - 2] >> (BASEBITS_XXX - n));
+
+    for (i = NLEN_XXX - 2; i > m; i--)
+        a[i] = ((a[i - m] << n)&BMASK_XXX) | (a[i - m - 1] >> (BASEBITS_XXX - n));
+    a[m] = (a[0] << n)&BMASK_XXX;
+    for (i = 0; i < m; i++) a[i] = 0;
+
+}
+
+/* Fast shift left of a by n bits, where n less than a word, Return excess (but store it as well) */
+/* a MUST be normalised */
+/* SU= 16 */
+int XXX::BIG_fshl(BIG a, int n)
+{
+    int i;
+
+    a[NLEN_XXX - 1] = ((a[NLEN_XXX - 1] << n)) | (a[NLEN_XXX - 2] >> (BASEBITS_XXX - n)); /* top word not masked */
+    for (i = NLEN_XXX - 2; i > 0; i--)
+        a[i] = ((a[i] << n)&BMASK_XXX) | (a[i - 1] >> (BASEBITS_XXX - n));
+    a[0] = (a[0] << n)&BMASK_XXX;
+
+    return (int)(a[NLEN_XXX - 1] >> ((8 * MODBYTES_XXX) % BASEBITS_XXX)); /* return excess - only used in ff.c */
+}
+
+/* double length left shift of a by k bits - k can be > BASEBITS_XXX , a MUST be normalised */
+/* SU= 32 */
+void XXX::BIG_dshl(DBIG a, int k)
+{
+    int i;
+    int n = k % BASEBITS_XXX;
+    int m = k / BASEBITS_XXX;
+
+    a[DNLEN_XXX - 1] = ((a[DNLEN_XXX - 1 - m] << n)) | (a[DNLEN_XXX - m - 2] >> (BASEBITS_XXX - n));
+
+    for (i = DNLEN_XXX - 2; i > m; i--)
+        a[i] = ((a[i - m] << n)&BMASK_XXX) | (a[i - m - 1] >> (BASEBITS_XXX - n));
+    a[m] = (a[0] << n)&BMASK_XXX;
+    for (i = 0; i < m; i++) a[i] = 0;
+
+}
+
+/* General shift right of a by k bits */
+/* a MUST be normalised */
+/* SU= 32 */
+void XXX::BIG_shr(BIG a, int k)
+{
+    int i;
+    int n = k % BASEBITS_XXX;
+    int m = k / BASEBITS_XXX;
+    for (i = 0; i < NLEN_XXX - m - 1; i++)
+        a[i] = (a[m + i] >> n) | ((a[m + i + 1] << (BASEBITS_XXX - n))&BMASK_XXX);
+    if (NLEN_XXX > m)  a[NLEN_XXX - m - 1] = a[NLEN_XXX - 1] >> n;
+    for (i = NLEN_XXX - m; i < NLEN_XXX; i++) a[i] = 0;
+
+}
+
+/* Fast combined shift, subtract and norm. Return sign of result */
+int XXX::BIG_ssn(BIG r, BIG a, BIG m)
+{
+    int i, n = NLEN_XXX - 1;
+    chunk carry;
+    m[0] = (m[0] >> 1) | ((m[1] << (BASEBITS_XXX - 1))&BMASK_XXX);
+    r[0] = a[0] - m[0];
+    carry = r[0] >> BASEBITS_XXX;
+    r[0] &= BMASK_XXX;
+
+    for (i = 1; i < n; i++)
+    {
+        m[i] = (m[i] >> 1) | ((m[i + 1] << (BASEBITS_XXX - 1))&BMASK_XXX);
+        r[i] = a[i] - m[i] + carry;
+        carry = r[i] >> BASEBITS_XXX;
+        r[i] &= BMASK_XXX;
+    }
+
+    m[n] >>= 1;
+    r[n] = a[n] - m[n] + carry;
+#ifdef DEBUG_NORM
+    r[MPV_XXX] = 1; r[MNV_XXX] = 0;
+#endif
+    return ((r[n] >> (CHUNK - 1)) & 1);
+}
+
+/* Faster shift right of a by k bits. Return shifted out part */
+/* a MUST be normalised */
+/* SU= 16 */
+int XXX::BIG_fshr(BIG a, int k)
+{
+    int i;
+    chunk r = a[0] & (((chunk)1 << k) - 1); /* shifted out part */
+    for (i = 0; i < NLEN_XXX - 1; i++)
+        a[i] = (a[i] >> k) | ((a[i + 1] << (BASEBITS_XXX - k))&BMASK_XXX);
+    a[NLEN_XXX - 1] = a[NLEN_XXX - 1] >> k;
+    return (int)r;
+}
+
+/* double length right shift of a by k bits - can be > BASEBITS_XXX */
+/* SU= 32 */
+void XXX::BIG_dshr(DBIG a, int k)
+{
+    int i;
+    int n = k % BASEBITS_XXX;
+    int m = k / BASEBITS_XXX;
+    for (i = 0; i < DNLEN_XXX - m - 1; i++)
+        a[i] = (a[m + i] >> n) | ((a[m + i + 1] << (BASEBITS_XXX - n))&BMASK_XXX);
+    a[DNLEN_XXX - m - 1] = a[DNLEN_XXX - 1] >> n;
+    for (i = DNLEN_XXX - m; i < DNLEN_XXX; i++ ) a[i] = 0;
+}
+
+/* Split DBIG d into two BIGs t|b. Split happens at n bits, where n falls into NLEN_XXX word */
+/* d MUST be normalised */
+/* SU= 24 */
+chunk XXX::BIG_split(BIG t, BIG b, DBIG d, int n)
+{
+    int i;
+    chunk nw, carry = 0;
+    int m = n % BASEBITS_XXX;
+
+    if (m == 0)
+    {
+        for (i = 0; i < NLEN_XXX; i++) b[i] = d[i];
+        if (t != b)
+        {
+            for (i = NLEN_XXX; i < 2 * NLEN_XXX; i++) t[i - NLEN_XXX] = d[i];
+            carry = t[NLEN_XXX - 1] >> BASEBITS_XXX;
+            t[NLEN_XXX - 1] = t[NLEN_XXX - 1] & BMASK_XXX; /* top word normalized */
+        }
+        return carry;
+    }
+
+    for (i = 0; i < NLEN_XXX - 1; i++) b[i] = d[i];
+
+    b[NLEN_XXX - 1] = d[NLEN_XXX - 1] & (((chunk)1 << m) - 1);
+
+    if (t != b)
+    {
+        carry = (d[DNLEN_XXX - 1] << (BASEBITS_XXX - m));
+        for (i = DNLEN_XXX - 2; i >= NLEN_XXX - 1; i--)
+        {
+            nw = (d[i] >> m) | carry;
+            carry = (d[i] << (BASEBITS_XXX - m))&BMASK_XXX;
+            t[i - NLEN_XXX + 1] = nw;
+        }
+    }
+#ifdef DEBUG_NORM
+    t[MPV_XXX] = 1; t[MNV_XXX] = 0;
+    b[MPV_XXX] = 1; b[MNV_XXX] = 0;
+#endif
+    return carry;
+}
+
+/* you gotta keep the sign of carry! Look - no branching! */
+/* Note that sign bit is needed to disambiguate between +ve and -ve values */
+/* normalise BIG - force all digits < 2^BASEBITS_XXX */
+chunk XXX::BIG_norm(BIG a)
+{
+    int i;
+    chunk d, carry;
+
+    carry=a[0]>>BASEBITS_XXX;
+    a[0]&=BMASK_XXX;
+
+    for (i = 1; i < NLEN_XXX - 1; i++)
+    {
+        d = a[i] + carry;
+        a[i] = d & BMASK_XXX;
+        carry = d >> BASEBITS_XXX;
+    }
+    a[NLEN_XXX - 1] = (a[NLEN_XXX - 1] + carry);
+
+#ifdef DEBUG_NORM
+    a[MPV_XXX] = 1; a[MNV_XXX] = 0;
+#endif
+    return (a[NLEN_XXX - 1] >> ((8 * MODBYTES_XXX) % BASEBITS_XXX)); /* only used in ff.c */
+}
+
+void XXX::BIG_dnorm(DBIG a)
+{
+    int i;
+    chunk d, carry;
+
+    carry=a[0]>>BASEBITS_XXX;
+    a[0]&=BMASK_XXX;
+
+    for (i = 1; i < DNLEN_XXX - 1; i++)
+    {
+        d = a[i] + carry;
+        a[i] = d & BMASK_XXX;
+        carry = d >> BASEBITS_XXX;
+    }
+    a[DNLEN_XXX - 1] = (a[DNLEN_XXX - 1] + carry);
+#ifdef DEBUG_NORM
+    a[DMPV_XXX] = 1; a[DMNV_XXX] = 0;
+#endif
+}
+
+/* Compare a and b. Return 1 for a>b, -1 for a<b, 0 for a==b */
+/* a and b MUST be normalised before call */
+/* sodium constant time implementation */
+
+int XXX::BIG_comp(BIG a, BIG b)
+{
+    int i;
+    chunk gt=0; chunk eq=1;
+    for (i = NLEN_XXX-1; i>=0; i--)
+    {
+        gt |= ((b[i]-a[i]) >> BASEBITS_XXX) & eq;
+        eq &= ((b[i]^a[i])-1) >> BASEBITS_XXX;
+    }
+    return (int)(gt+gt+eq-1);
+}
+
+int XXX::BIG_dcomp(DBIG a, DBIG b)
+{
+    int i;
+    chunk gt=0; chunk eq=1;
+    for (i = DNLEN_XXX-1; i>=0; i--)
+    {
+        gt |= ((b[i]-a[i]) >> BASEBITS_XXX) & eq;
+        eq &= ((b[i]^a[i])-1) >> BASEBITS_XXX;
+    }
+    return (int)(gt+gt+eq-1);
+}
+
+/* return number of bits in a */
+/* SU= 8 */
+int XXX::BIG_nbits(BIG a)
+{
+    int bts, k = NLEN_XXX - 1;
+    BIG t;
+    chunk c;
+    BIG_copy(t, a);
+    BIG_norm(t);
+    while (k >= 0 && t[k] == 0) k--;
+    if (k < 0) return 0;
+    bts = BASEBITS_XXX * k;
+    c = t[k];
+    while (c != 0)
+    {
+        c /= 2;
+        bts++;
+    }
+    return bts;
+}
+
+/* SU= 8, Calculate number of bits in a DBIG - output normalised */
+int XXX::BIG_dnbits(DBIG a)
+{
+    int bts, k = DNLEN_XXX - 1;
+    DBIG t;
+    chunk c;
+    BIG_dcopy(t, a);
+    BIG_dnorm(t);
+    while (k >= 0 && t[k] == 0) k--;
+    if (k < 0) return 0;
+    bts = BASEBITS_XXX * k;
+    c = t[k];
+    while (c != 0)
+    {
+        c /= 2;
+        bts++;
+    }
+    return bts;
+}
+
+// Set b=b mod m in constant time (if bd is known at compile time)
+// bd is Max number of bits in b - Actual number of bits in m
+void XXX::BIG_ctmod(BIG b, BIG m, int bd)
+{
+    int k=bd;
+    BIG r,c;
+    BIG_copy(c,m);
+    BIG_norm(b);
+
+    BIG_shl(c,k);
+    while (k>=0)
+    {
+        BIG_sub(r, b, c);
+        BIG_norm(r);
+        BIG_cmove(b, r, 1 - ((r[NLEN_XXX - 1] >> (CHUNK - 1)) & 1));
+        BIG_fshr(c, 1);
+        k--;
+    }
+}
+
+/* Set b=b mod m */
+/* SU= 16 */
+void XXX::BIG_mod(BIG b, BIG m)
+{
+    int k=BIG_nbits(b)-BIG_nbits(m);
+    if (k<0) k=0;
+    BIG_ctmod(b,m,k);
+/*
+    int k = 0;
+    BIG r; 
+    BIG c;
+    BIG_copy(c, m);
+
+    BIG_norm(b);
+    if (BIG_comp(b, c) < 0)
+        return;
+    do
+    {
+        BIG_fshl(c, 1);
+        k++;
+    }
+    while (BIG_comp(b, c) >= 0);
+
+    while (k > 0)
+    {
+        BIG_fshr(c, 1);
+
+// constant time...
+        BIG_sub(r, b, c);
+        BIG_norm(r);
+        BIG_cmove(b, r, 1 - ((r[NLEN_XXX - 1] >> (CHUNK - 1)) & 1));
+        k--;
+    } */
+}
+
+
+// Set a=b mod m in constant time (if bd is known at compile time)
+// bd is Max number of bits in b - Actual number of bits in m
+void XXX::BIG_ctdmod(BIG a, DBIG b, BIG m, int bd)
+{
+    int k=bd;
+    DBIG c,r;
+    BIG_dscopy(c,m);
+    BIG_dnorm(b);
+
+    BIG_dshl(c,k);
+    while (k>=0)
+    {
+        BIG_dsub(r, b, c);
+        BIG_dnorm(r);
+        BIG_dcmove(b, r, 1 - ((r[DNLEN_XXX - 1] >> (CHUNK - 1)) & 1));
+        BIG_dshr(c, 1);
+        k--;
+    }
+    BIG_sdcopy(a,b);
+}
+
+/* Set a=b mod c, b is destroyed. Slow but rarely used. */
+/* SU= 96 */
+void XXX::BIG_dmod(BIG a, DBIG b, BIG m)
+{
+    int k=BIG_dnbits(b)-BIG_nbits(m);
+    if (k<0) k=0;
+    BIG_ctdmod(a,b,m,k);
+
+/*
+    int k = 0;
+    DBIG c, r;
+    BIG_dnorm(b);
+    BIG_dscopy(c,m);
+
+    if (BIG_dcomp(b, c) < 0)
+    {
+        BIG_sdcopy(a, b);
+        return;
+    }
+
+    do
+    {
+        BIG_dshl(c, 1);
+        k++;
+    }
+    while (BIG_dcomp(b, c) >= 0);
+
+    while (k > 0)
+    {
+        BIG_dshr(c, 1);
+// constant time...
+        BIG_dsub(r, b, c);
+        BIG_dnorm(r);
+        BIG_dcmove(b, r, 1 - ((r[DNLEN_XXX - 1] >> (CHUNK - 1)) & 1));
+
+        k--;
+    }
+    BIG_sdcopy(a, b); */
+}
+
+// a=b/m  in constant time (if bd is known at compile time)
+// bd is Max number of bits in b - Actual number of bits in m
+void XXX::BIG_ctddiv(BIG a,DBIG b,BIG m,int bd)
+{
+    int d,k=bd;
+    DBIG c,dr;
+    BIG e,r;
+    BIG_dscopy(c,m);
+    BIG_dnorm(b);
+
+    BIG_zero(a);
+    BIG_zero(e);
+    BIG_inc(e, 1);
+
+    BIG_shl(e,k);
+    BIG_dshl(c,k);
+
+    while (k >= 0)
+    {
+        BIG_dsub(dr, b, c);
+        BIG_dnorm(dr);
+        d = 1 - ((dr[DNLEN_XXX - 1] >> (CHUNK - 1)) & 1);
+        BIG_dcmove(b, dr, d);
+
+        BIG_add(r, a, e);
+        BIG_norm(r);
+        BIG_cmove(a, r, d);
+
+        BIG_dshr(c, 1);
+        BIG_fshr(e, 1);
+        k--;
+    }
+}
+
+/* Set a=b/c,  b is destroyed. Slow but rarely used. */
+/* SU= 136 */
+void XXX::BIG_ddiv(BIG a, DBIG b, BIG m)
+{
+    int k=BIG_dnbits(b)-BIG_nbits(m);
+    if (k<0) k=0;
+    BIG_ctddiv(a,b,m,k);
+/*
+    int d, k = 0;
+    DBIG c, dr;
+    BIG e, r;
+    BIG_dnorm(b);
+    BIG_dscopy(c,m);
+
+    BIG_zero(a);
+    BIG_zero(e);
+    BIG_inc(e, 1);
+
+    while (BIG_dcomp(b, c) >= 0)
+    {
+        BIG_fshl(e, 1);
+        BIG_dshl(c, 1);
+        k++;
+    }
+
+    while (k > 0)
+    {
+        BIG_dshr(c, 1);
+        BIG_fshr(e, 1);
+
+        BIG_dsub(dr, b, c);
+        BIG_dnorm(dr);
+        d = 1 - ((dr[DNLEN_XXX - 1] >> (CHUNK - 1)) & 1);
+        BIG_dcmove(b, dr, d);
+
+        BIG_add(r, a, e);
+        BIG_norm(r);
+        BIG_cmove(a, r, d);
+
+        k--;
+    } */
+}
+
+// a=a/m  in constant time (if bd is known at compile time)
+// bd is Max number of bits in b - Actual number of bits in m
+void XXX::BIG_ctsdiv(BIG b,BIG m,int bd)
+{
+    int d, k=bd;
+    BIG e,a,r,c;
+    BIG_norm(b);
+    BIG_copy(a,b);
+    BIG_copy(c,m);
+    BIG_zero(b);
+    BIG_zero(e);
+    BIG_inc(e, 1);
+
+    BIG_shl(c,k);
+    BIG_shl(e,k);
+
+    while (k >= 0)
+    {
+        BIG_sub(r, a, c);
+        BIG_norm(r);
+        d = 1 - ((r[NLEN_XXX - 1] >> (CHUNK - 1)) & 1);
+        BIG_cmove(a, r, d);
+
+        BIG_add(r, b, e);
+        BIG_norm(r);
+        BIG_cmove(b, r, d);
+
+        BIG_fshr(c, 1);
+        BIG_fshr(e, 1);
+
+        k--;
+    }
+}
+
+void XXX::BIG_sdiv(BIG b, BIG m)
+{
+    int k=BIG_nbits(b)-BIG_nbits(m);
+    if (k<0) k=0;
+    BIG_ctsdiv(b,m,k);
+/*
+    int d, k = 0;
+    BIG c, e, a, r;
+    BIG_norm(b);
+    BIG_copy(a,b);
+    BIG_copy(c, m);
+
+    BIG_zero(b);
+    BIG_zero(e);
+    BIG_inc(e, 1);
+
+    while (BIG_comp(a, c) >= 0)
+    {
+        BIG_fshl(e, 1);
+        BIG_fshl(c, 1);
+        k++;
+    }
+
+    while (k > 0)
+    {
+        BIG_fshr(c, 1);
+        BIG_fshr(e, 1);
+
+        BIG_sub(r, a, c);
+        BIG_norm(r);
+        d = 1 - ((r[NLEN_XXX - 1] >> (CHUNK - 1)) & 1);
+        BIG_cmove(a, r, d);
+
+        BIG_add(r, b, e);
+        BIG_norm(r);
+        BIG_cmove(b, r, d);
+        k--;
+    } */
+}
+
+/* return LSB of a */
+int XXX::BIG_parity(BIG a)
+{
+    return a[0] % 2;
+}
+
+/* return n-th bit of a */
+/* SU= 16 */
+int XXX::BIG_bit(BIG a, int n)
+{
+    return (int)((a[n / BASEBITS_XXX] & ((chunk)1 << (n % BASEBITS_XXX))) >> (n%BASEBITS_XXX));
+}
+
+/* return last n bits of a, where n is small < BASEBITS_XXX */
+/* SU= 16 */
+int XXX::BIG_lastbits(BIG a, int n)
+{
+    int msk = (1 << n) - 1;
+    BIG_norm(a);
+    return ((int)a[0])&msk;
+}
+
+/* get 8*MODBYTES_XXX size random number */
+void XXX::BIG_random(BIG m, csprng *rng)
+{
+    int i, b, j = 0, r = 0;
+    int len = 8 * MODBYTES_XXX;
+
+    BIG_zero(m);
+    /* generate random BIG */
+    for (i = 0; i < len; i++)
+    {
+        if (j == 0) r = RAND_byte(rng);
+        else r >>= 1;
+        b = r & 1;
+        BIG_shl(m, 1);
+        m[0] += b;
+        j++;
+        j &= 7;
+    }
+
+#ifdef DEBUG_NORM
+    m[MPV_XXX] = 1; m[MNV_XXX] = 0;
+#endif
+}
+
+/* get random BIG from rng, modulo q. Done one bit at a time, so its portable */
+
+extern int NFILLPOOL;
+
+void XXX::BIG_randomnum(BIG m, BIG q, csprng *rng)
+{
+    int i, b, j = 0, r = 0;
+    int n=2 * BIG_nbits(q);
+    DBIG d;
+    BIG_dzero(d);
+
+    /* generate random DBIG */
+    for (i = 0; i < n; i++)
+    {
+        if (j == 0) r = RAND_byte(rng);
+        else r >>= 1;
+        b = r & 1;
+        BIG_dshl(d, 1);
+        d[0] += b;
+        j++;
+        j &= 7;
+    }
+    /* reduce modulo a BIG. Removes bias */
+    BIG_dmod(m, d, q);
+#ifdef DEBUG_NORM
+    m[MPV_XXX] = 1; m[MNV_XXX] = 0;
+#endif
+}
+
+/* create randum BIG less than r and less than trunc bits */
+void XXX::BIG_randtrunc(BIG s, BIG r, int trunc, csprng *rng)
+{
+    BIG_randomnum(s, r, rng);
+    if (BIG_nbits(r) > trunc)
+        BIG_mod2m(s, trunc);
+}
+
+/* Set r=a*b mod m */
+/* SU= 96 */
+void XXX::BIG_modmul(BIG r, BIG a1, BIG b1, BIG m)
+{
+    DBIG d;
+    BIG a, b;
+    BIG_copy(a, a1);
+    BIG_copy(b, b1);
+    BIG_mod(a, m);
+    BIG_mod(b, m);
+
+    BIG_mul(d, a, b);
+    BIG_ctdmod(r, d, m,BIG_nbits(m));
+}
+
+/* Set a=a*a mod m */
+/* SU= 88 */
+void XXX::BIG_modsqr(BIG r, BIG a1, BIG m)
+{
+    DBIG d;
+    BIG a;
+    BIG_copy(a, a1);
+    BIG_mod(a, m);
+    BIG_sqr(d, a);
+    BIG_ctdmod(r, d, m, BIG_nbits(m));
+}
+
+/* Set r=-a mod m */
+/* SU= 16 */
+void XXX::BIG_modneg(BIG r, BIG a1, BIG m)
+{
+    BIG a;
+    BIG_copy(a, a1);
+    BIG_mod(a, m);
+    BIG_sub(r, m, a); BIG_norm(r);
+}
+
+/* Set r=a+b mod m */
+void XXX::BIG_modadd(BIG r, BIG a1, BIG b1, BIG m)
+{
+    BIG a, b;
+    BIG_copy(a, a1);
+    BIG_copy(b, b1);
+    BIG_mod(a, m);
+    BIG_mod(b, m);
+    BIG_add(r,a,b); BIG_norm(r);
+    BIG_ctmod(r,m,1);
+}
+
+/* Set a=a/b mod m */
+/* SU= 136 */
+void XXX::BIG_moddiv(BIG r, BIG a1, BIG b1, BIG m)
+{
+    DBIG d;
+    BIG z;
+    BIG a, b;
+    BIG_copy(a, a1);
+    BIG_copy(b, b1);
+    BIG_mod(a, m);
+    BIG_invmodp(z, b, m);
+
+    BIG_mul(d, a, z);
+    BIG_ctdmod(r, d, m, BIG_nbits(m));
+}
+
+/* Get jacobi Symbol (a/p). Returns 0, 1 or -1 */
+/* SU= 216 */
+int XXX::BIG_jacobi(BIG a, BIG p)
+{
+    int n8, k, m = 0;
+    BIG t, x, n, zilch, one;
+    BIG_one(one);
+    BIG_zero(zilch);
+    if (BIG_parity(p) == 0 || BIG_comp(a, zilch) == 0 || BIG_comp(p, one) <= 0) return 0;
+    BIG_norm(a);
+    BIG_copy(x, a);
+    BIG_copy(n, p);
+    BIG_mod(x, p);
+
+    while (BIG_comp(n, one) > 0)
+    {
+        if (BIG_comp(x, zilch) == 0) return 0;
+        n8 = BIG_lastbits(n, 3);
+        k = 0;
+        while (BIG_parity(x) == 0)
+        {
+            k++;
+            BIG_shr(x, 1);
+        }
+        if (k % 2 == 1) m += (n8 * n8 - 1) / 8;
+        m += (n8 - 1) * (BIG_lastbits(x, 2) - 1) / 4;
+        BIG_copy(t, n);
+
+        BIG_mod(t, x);
+        BIG_copy(n, x);
+        BIG_copy(x, t);
+        m %= 2;
+
+    }
+    if (m == 0) return 1;
+    else return -1;
+}
+
+/*
+
+int XXX::step1(BIG u,BIG x,BIG p)
+{
+    int k=0;
+    BIG t;
+    while (BIG_bit(u,k)==0)
+    {
+        BIG_add(t,x,p);
+        BIG_cmove(x,t,BIG_parity(x));
+        BIG_norm(x);
+        BIG_fshr(x,1);
+        k++;
+    }
+    return k;
+}
+
+void XXX::step2(BIG xf,BIG xs,BIG p)
+{
+    BIG t;
+    BIG_add(t,xf,p);
+    BIG_cmove(xf,t,(BIG_comp(xf,xs)>>1)&1); // move if x1<x2 
+    BIG_sub(xf,xf,xs);
+    BIG_norm(xf);
+}
+
+*/
+
+/* Arazi and Qi inversion mod 256 */
+static int invmod256(int a)
+{
+    int U, t1, t2, b, c;
+    t1 = 0;
+    c = (a >> 1) & 1;
+    t1 += c;
+    t1 &= 1;
+    t1 = 2 - t1;
+    t1 <<= 1;
+    U = t1 + 1;
+
+// i=2
+    b = a & 3;
+    t1 = U * b;
+    t1 >>= 2;
+    c = (a >> 2) & 3;
+    t2 = (U * c) & 3;
+    t1 += t2;
+    t1 *= U;
+    t1 &= 3;
+    t1 = 4 - t1;
+    t1 <<= 2;
+    U += t1;
+
+// i=4
+    b = a & 15;
+    t1 = U * b;
+    t1 >>= 4;
+    c = (a >> 4) & 15;
+    t2 = (U * c) & 15;
+    t1 += t2;
+    t1 *= U;
+    t1 &= 15;
+    t1 = 16 - t1;
+    t1 <<= 4;
+    U += t1;
+
+    return U;
+}
+
+/* a=1/a mod 2^BIGBITS_XXX. This is very fast! */
+void XXX::BIG_invmod2m(BIG a)
+{
+    int i;
+    BIG U, t1, b, c;
+    BIG_zero(U);
+    BIG_inc(U, invmod256(BIG_lastbits(a, 8)));
+    for (i = 8; i < BIGBITS_XXX; i <<= 1)
+    {
+        BIG_norm(U);
+        BIG_copy(b, a);
+        BIG_mod2m(b, i);  // bottom i bits of a
+
+        BIG_smul(t1, U, b);
+        BIG_shr(t1, i); // top i bits of U*b
+
+        BIG_copy(c, a);
+        BIG_shr(c, i);
+        BIG_mod2m(c, i); // top i bits of a
+
+        BIG_smul(b, U, c);
+        BIG_mod2m(b, i); // bottom i bits of U*c
+
+        BIG_add(t1, t1, b);
+        BIG_norm(t1);
+        BIG_smul(b, t1, U);
+        BIG_copy(t1, b); // (t1+b)*U
+        BIG_mod2m(t1, i);               // bottom i bits of (t1+b)*U
+
+        BIG_one(b);
+        BIG_shl(b, i);
+        BIG_sub(t1, b, t1);
+        BIG_norm(t1);
+
+        BIG_shl(t1, i);
+
+        BIG_add(U, U, t1);
+    }
+    BIG_copy(a, U);
+    BIG_norm(a);
+    BIG_mod2m(a, BIGBITS_XXX);
+}
+
+// Set r=1/a mod p. Binary method 
+// NOTE: This function is NOT side-channel safe
+// If a is a secret then ALWAYS calculate 1/a = m*(1/am) mod p 
+// where m is a random masking value
+void XXX::BIG_invmodp(BIG r, BIG a, BIG p)
+{
+    BIG u, v, x1, x2, t, one;
+    int par,s;
+
+    BIG_mod(a, p);
+    if (BIG_iszilch(a))
+    {
+        BIG_zero(r);
+        return;
+    }
+
+    BIG_copy(u, a);
+    BIG_copy(v, p);
+    BIG_one(one);
+    BIG_copy(x1, one);
+    BIG_zero(x2);
+
+    while (BIG_comp(u, one) != 0 && BIG_comp(v, one) != 0)
+    {
+        while (BIG_parity(u) == 0)
+        {
+            BIG_fshr(u, 1);
+            BIG_add(t,x1,p);
+            BIG_cmove(x1,t,BIG_parity(x1));
+            BIG_norm(x1);
+            BIG_fshr(x1,1);
+        }
+        while (BIG_parity(v) == 0)
+        {
+            BIG_fshr(v, 1);
+            BIG_add(t,x2,p);
+            BIG_cmove(x2,t,BIG_parity(x2));
+            BIG_norm(x2);
+            BIG_fshr(x2,1);
+        } 
+        if (BIG_comp(u, v) >= 0) 
+        {
+            BIG_sub(u, u, v);
+            BIG_norm(u);
+            BIG_add(t,x1,p);
+            BIG_cmove(x1,t,(BIG_comp(x1,x2)>>1)&1); // move if x1<x2 
+            BIG_sub(x1,x1,x2);
+            BIG_norm(x1);
+        }
+        else
+        {
+            BIG_sub(v, v, u);
+            BIG_norm(v);
+            BIG_add(t,x2,p);
+            BIG_cmove(x2,t,(BIG_comp(x2,x1)>>1)&1); // move if x2<x1 
+            BIG_sub(x2,x2,x1);
+            BIG_norm(x2);
+        }
+    }
+    BIG_copy(r,x1);
+    BIG_cmove(r,x2,BIG_comp(u,one)&1);
+}
+
+
+/* set x = x mod 2^m */
+void XXX::BIG_mod2m(BIG x, int m)
+{
+    int i, wd, bt;
+    chunk msk;
+    BIG_norm(x);
+
+    wd = m / BASEBITS_XXX;
+    bt = m % BASEBITS_XXX;
+    msk = ((chunk)1 << bt) - 1;
+    x[wd] &= msk;
+    for (i = wd + 1; i < NLEN_XXX; i++) x[i] = 0;
+}
+
+// new
+/* Convert to DBIG number from byte array of given length */
+void XXX::BIG_dfromBytesLen(DBIG a, char *b, int s)
+{
+    int i, len = s;
+    BIG_dzero(a);
+
+    for (i = 0; i < len; i++)
+    {
+        BIG_dshl(a, 8);
+        a[0] += (int)(unsigned char)b[i];
+    }
+#ifdef DEBUG_NORM
+    a[DMPV_XXX] = 1; a[DMNV_XXX] = 0;
+#endif
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/big.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/big.h
new file mode 100644
index 0000000..894cc57
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/big.h
@@ -0,0 +1,697 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file big.h
+ * @author Mike Scott
+ * @date 23rd February 2016
+ * @brief Big number Header File
+ *
+ *
+ */
+
+#ifndef BIG_XXX_H
+#define BIG_XXX_H
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <inttypes.h>
+#include "arch.h"
+#include "core.h"
+#include "config_big_XXX.h"
+
+using namespace core;
+
+/* could comment this out if code size is a major issue */
+#define UNWOUND
+/* Normally recommended, but may not be optimal for some architectures, for example 32-bit ARM M4 */
+#define USE_KARATSUBA
+
+#define BIGBITS_XXX (8*MODBYTES_XXX)
+#define NLEN_XXX (1+((8*MODBYTES_XXX-1)/BASEBITS_XXX))
+#define DNLEN_XXX 2*NLEN_XXX
+#define BMASK_XXX (((chunk)1<<BASEBITS_XXX)-1) /**< Mask = 2^BASEBITS-1 */
+#define NEXCESS_XXX (1<<(CHUNK-BASEBITS_XXX-1))           /**< 2^(CHUNK-BASEBITS-1) - digit cannot be multiplied by more than this before normalisation */
+
+#define HBITS_XXX (BASEBITS_XXX/2)      /**< Number of bits in number base divided by 2 */
+#define HMASK_XXX (((chunk)1<<HBITS_XXX)-1)    /**< Mask = 2^HBITS-1 */
+
+//#define DEBUG_NORM
+
+#ifdef DEBUG_NORM  /* Add an extra location to track chunk extension */
+#define MPV_XXX NLEN_XXX
+#define MNV_XXX (NLEN_XXX+1)
+#define DMPV_XXX DNLEN_XXX
+#define DMNV_XXX (DNLEN_XXX+1)
+
+#endif
+
+namespace XXX {
+
+//extern int BIGMULS;
+//extern int BIGSQRS;
+
+#ifdef DEBUG_NORM
+typedef chunk BIG[NLEN_XXX + 2]; /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_XXX + 2]; /**< Define type DBIG as array of chunks */
+#else
+typedef chunk BIG[NLEN_XXX];     /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_XXX];   /**< Define type DBIG as array of chunks */
+#endif
+
+/* BIG number prototypes */
+
+/**	@brief Tests for BIG equal to zero (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_iszilch(BIG x);
+/**	@brief Tests for BIG equal to one (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if one, else returns 0
+ */
+extern int BIG_isunity(BIG x);
+/**	@brief Tests for DBIG equal to zero (Constant Time)
+ *
+	@param x a DBIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_diszilch(DBIG x);
+/**	@brief Outputs a BIG number to the console (Variable Time)
+ *
+	@param x a BIG number
+ */
+extern void BIG_output(BIG x);
+/**	@brief Outputs a BIG number to the console in raw form (Variable Time for debugging)
+ *
+	@param x a BIG number
+ */
+extern void BIG_rawoutput(BIG x);
+/**	@brief Conditional constant time swap of two BIG numbers
+ *
+	Conditionally swaps parameters in constant time (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s swap takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cswap(BIG x, BIG y, int s);
+/**	@brief Conditional copy of BIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cmove(BIG x, BIG y, int s);
+/**	@brief Conditional copy of DBIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a DBIG number
+	@param y another DBIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_dcmove(BIG x, BIG y, int s);
+/**	@brief Convert from BIG number to byte array (Constant Time)
+ *
+	@param a byte array
+	@param x BIG number
+ */
+extern void BIG_toBytes(char *a, BIG x);
+/**	@brief Convert to BIG number from byte array (Constant Time)
+ *
+	@param x BIG number
+	@param a byte array
+ */
+extern void BIG_fromBytes(BIG x, char *a);
+/**	@brief Convert to BIG number from byte array of given length (Variable Time)
+ *
+	@param x BIG number
+	@param a byte array
+	@param s byte array length
+ */
+extern void BIG_fromBytesLen(BIG x, char *a, int s);
+/**@brief Convert to DBIG number from byte array of given length (Variable Time)
+ *
+   @param x DBIG number
+   @param a byte array
+   @param s byte array length
+ */
+extern void BIG_dfromBytesLen(DBIG x, char *a, int s);
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_doutput(DBIG x); 
+
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_drawoutput(DBIG x);
+
+/**	@brief Copy BIG from Read-Only Memory to a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number in ROM
+ */
+extern void BIG_rcopy(BIG x, const BIG y);
+/**	@brief Copy BIG to another BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_copy(BIG x, BIG y);
+/**	@brief Copy DBIG to another DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_dcopy(DBIG x, DBIG y);
+/**	@brief Copy BIG to upper half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dsucopy(DBIG x, BIG y);
+/**	@brief Copy BIG to lower half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dscopy(DBIG x, BIG y);
+/**	@brief Copy lower half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sdcopy(BIG x, DBIG y);
+/**	@brief Copy upper half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sducopy(BIG x, DBIG y);
+/**	@brief Set BIG to zero (Constant Time)
+ *
+	@param x BIG number to be set to zero  
+ */
+extern void BIG_zero(BIG x);
+/**	@brief Set DBIG to zero (Constant Time)
+ *
+	@param x DBIG number to be set to zero
+ */
+extern void BIG_dzero(DBIG x);
+/**	@brief Set BIG to one (unity) (Constant Time)
+ *
+	@param x BIG number to be set to one.
+ */
+extern void BIG_one(BIG x);
+/**	@brief Set BIG to inverse mod 2^256 (Constant Time)
+ *
+	@param x BIG number to be inverted
+ */
+extern void BIG_invmod2m(BIG x);
+/**	@brief Set BIG to sum of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, sum of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_add(BIG x, BIG y, BIG z);
+
+/**	@brief Set BIG to logical or of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, or of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_or(BIG x, BIG y, BIG z);
+
+/**	@brief Increment BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be incremented
+	@param i integer
+ */
+extern void BIG_inc(BIG x, int i);
+/**	@brief Set BIG to difference of two BIGs (Constant Time)
+ *
+	@param x BIG number, difference of other two - output not normalised
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_sub(BIG x, BIG y, BIG z);
+/**	@brief Decrement BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be decremented
+	@param i integer
+ */
+extern void BIG_dec(BIG x, int i);
+/**	@brief Set DBIG to sum of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, sum of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dadd(DBIG x, DBIG y, DBIG z);
+/**	@brief Set DBIG to difference of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, difference of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dsub(DBIG x, DBIG y, DBIG z);
+/**	@brief Multiply BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_imul(BIG x, BIG y, int i);
+/**	@brief Multiply BIG by not-so-small small integer - output normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+	@return Overflowing bits
+ */
+extern chunk BIG_pmul(BIG x, BIG y, int i);
+/**	@brief Divide BIG by 3 - output normalised (Constant Time)
+ *
+	@param x BIG number
+	@return Remainder
+ */
+extern int BIG_div3(BIG x);
+/**	@brief Multiply BIG by even bigger small integer resulting in a DBIG - output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_pxmul(DBIG x, BIG y, int i);
+/**	@brief Multiply BIG by another BIG resulting in DBIG - inputs normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_mul(DBIG x, BIG y, BIG z);
+/**	@brief Multiply BIG by another BIG resulting in another BIG - inputs normalised and output normalised (Constant Time)
+ *
+	Note that the product must fit into a BIG, and x must be distinct from y and z
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_smul(BIG x, BIG y, BIG z);
+/**	@brief Square BIG resulting in a DBIG - input normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, square of a BIG
+	@param y BIG number to be squared
+ */
+extern void BIG_sqr(DBIG x, BIG y);
+
+/**	@brief Montgomery reduction of a DBIG to a BIG  - input normalised and output normalised (Constant Time)
+ *
+	@param a BIG number, reduction of a BIG
+	@param md BIG number, the modulus
+	@param MC the Montgomery Constant
+	@param d DBIG number to be reduced
+ */
+extern void BIG_monty(BIG a, BIG md, chunk MC, DBIG d);
+
+/**	@brief Shifts a BIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shl(BIG x, int s);
+/**	@brief Fast shifts a BIG left by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Overflow bits
+ */
+extern int BIG_fshl(BIG x, int s);
+/**	@brief Shifts a DBIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshl(DBIG x, int s);
+/**	@brief Shifts a BIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shr(BIG x, int s);
+
+
+/**	@brief Fast time-critical combined shift by 1 bit, subtract and normalise (Constant Time)
+ *
+	@param r BIG number normalised output
+	@param a BIG number to be subtracted from
+	@param m BIG number to be shifted and subtracted
+	@return sign of r
+ */
+extern int BIG_ssn(BIG r, BIG a, BIG m);
+
+/**	@brief Fast shifts a BIG right by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Shifted out bits
+ */
+extern int BIG_fshr(BIG x, int s);
+/**	@brief Shifts a DBIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshr(DBIG x, int s);
+/**	@brief Splits a DBIG into two BIGs - input must be normalised, outputs normalised (Constant Time as used)
+ *
+	Internal function. The value of s must be approximately in the middle of the DBIG.
+	Typically used to extract z mod 2^MODBITS and z/2^MODBITS
+	@param x BIG number, top half of z
+	@param y BIG number, bottom half of z
+	@param z DBIG number to be split in two.
+	@param s Bit position at which to split
+	@return carry-out from top half
+ */
+extern chunk BIG_split(BIG x, BIG y, DBIG z, int s);
+/**	@brief Normalizes a BIG number - output normalised (Constant Time)
+ *
+	All digits of the input BIG are reduced mod 2^BASEBITS
+	@param x BIG number to be normalised
+ */
+extern chunk BIG_norm(BIG x);
+/**	@brief Normalizes a DBIG number - output normalised (Constant Time)
+ *
+	All digits of the input DBIG are reduced mod 2^BASEBITS
+	@param x DBIG number to be normalised
+ */
+extern void BIG_dnorm(DBIG x);
+/**	@brief Compares two BIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first BIG number to be compared
+	@param y second BIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_comp(BIG x, BIG y);
+/**	@brief Compares two DBIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first DBIG number to be compared
+	@param y second DBIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_dcomp(DBIG x, DBIG y);
+/**	@brief Calculate number of bits in a BIG - output normalised (Variable Time)
+ *
+	@param x BIG number
+	@return Number of bits in x
+ */
+extern int BIG_nbits(BIG x);
+/**	@brief Calculate number of bits in a DBIG - output normalised (Variable Time)
+ *
+	@param x DBIG number
+	@return Number of bits in x
+ */
+extern int BIG_dnbits(DBIG x);
+
+/**	@brief Reduce x mod n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctmod(BIG x, BIG n, int bd);
+
+/**	@brief  x=y mod n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctdmod(BIG x, DBIG y, BIG n, int bd);
+
+/**	@brief Divide x by n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctsdiv(BIG x,BIG n,int bd);
+
+/**	@brief  x=y/n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctddiv(BIG x, DBIG y, BIG n,int bd);
+
+
+/**	@brief Reduce x mod n - input and output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+ */
+extern void BIG_mod(BIG x, BIG n);
+/**	@brief Divide x by n - output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+ */
+extern void BIG_sdiv(BIG x, BIG n);
+/**	@brief  x=y mod n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_dmod(BIG x, DBIG y, BIG n);
+/**	@brief  x=y/n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_ddiv(BIG x, DBIG y, BIG n);
+/**	@brief  return parity of BIG, that is the least significant bit (Constant Time)
+ *
+	@param x BIG number
+	@return 0 or 1
+ */
+extern int BIG_parity(BIG x);
+/**	@brief  return i-th of BIG (Constant Time)
+ *
+	@param x BIG number
+	@param i the bit of x to be returned
+	@return 0 or 1
+ */
+extern int BIG_bit(BIG x, int i);
+/**	@brief  return least significant bits of a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param n number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int BIG_lastbits(BIG x, int n);
+/**	@brief  Create a random BIG from a random number generator (Constant Time)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_random(BIG x, csprng *r);
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randomnum(BIG x, BIG n, csprng *r);
+
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus and truncated to max bit length (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param t Maximum bit length
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randtrunc(BIG x, BIG n, int t, csprng *r);
+
+/**	brief  return NAF (Non-Adjacent-Form) value as +/- 1, 3 or 5, inputs must be normalised
+ *
+	Given x and 3*x extracts NAF value from given bit position, and returns number of bits processed, and number of trailing zeros detected if any
+	param x BIG number
+	param x3 BIG number, three times x
+	param i bit position
+	param nbs pointer to integer returning number of bits processed
+	param nzs pointer to integer returning number of trailing 0s
+	return + or - 1, 3 or 5
+*/
+
+/**	@brief  Calculate x=y*z mod n (Variable Time)
+ *
+	Slow method for modular multiplication
+	@param x BIG number, on exit = y*z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modmul(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y/z mod n (Variable Time)
+ *
+	Slow method for modular division
+	@param x BIG number, on exit = y/z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_moddiv(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y^2 mod n (Variable Time)
+ *
+	Slow method for modular squaring
+	@param x BIG number, on exit = y^2 mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modsqr(BIG x, BIG y, BIG n);
+/**	@brief  Calculate x=-y mod n (Variable Time)
+ *
+	Modular negation
+	@param x BIG number, on exit = -y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modneg(BIG x, BIG y, BIG n);
+
+/**	@brief  Calculate x=y+z mod n (Variable Time)
+ *
+	Slow method for modular addition
+	@param x BIG number, on exit = y+z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modadd(BIG x, BIG y, BIG z, BIG n);
+
+/**	@brief  Calculate jacobi Symbol (x/y) (Variable Time)
+ *
+	@param x BIG number
+	@param y BIG number
+	@return Jacobi symbol, -1,0 or 1
+ */
+extern int BIG_jacobi(BIG x, BIG y);
+/**	@brief  Calculate x=1/y mod n (Variable Time)
+ *
+	Modular Inversion - This is slow. Uses binary method.
+	@param x BIG number, on exit = 1/y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_invmodp(BIG x, BIG y, BIG n);
+/** @brief Calculate x=x mod 2^m (Variable Time)
+ *
+	Truncation
+	@param x BIG number, on reduced mod 2^m
+	@param m new truncated size
+*/
+extern void BIG_mod2m(BIG x, int m);
+
+/**	@brief Calculates a*b+c+*d
+ *
+	Calculate partial product of a.b, add in carry c, and add total to d (Constant Time)
+	@param a multiplier
+	@param b multiplicand
+	@param c carry
+	@param d pointer to accumulated bottom half of result
+	@return top half of result
+ */
+
+
+extern int step1(BIG,BIG,BIG);
+extern void step2(BIG,BIG,BIG);
+
+#ifdef dchunk
+
+/* Method required to calculate x*y+c+r, bottom half in r, top half returned */
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    dchunk prod = (dchunk)x * y + c + *r;
+    *r = (chunk)prod & BMASK_XXX;
+    return (chunk)(prod >> BASEBITS_XXX);
+}
+
+#else
+
+/* No integer type available that can store double the wordlength */
+/* accumulate partial products */
+
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    chunk x0, x1, y0, y1;
+    chunk bot, top, mid, carry;
+    x0 = x & HMASK_XXX;
+    x1 = (x >> HBITS_XXX);
+    y0 = y & HMASK_XXX;
+    y1 = (y >> HBITS_XXX);
+    bot = x0 * y0;
+    top = x1 * y1;
+    mid = x0 * y1 + x1 * y0;
+    x0 = mid & HMASK_XXX;
+    x1 = (mid >> HBITS_XXX);
+    bot += x0 << HBITS_XXX;
+    bot += *r;
+    bot += c;
+
+    top += x1;
+    carry = bot >> BASEBITS_XXX;
+    bot &= BMASK_XXX;
+    top += carry;
+
+    *r = bot;
+    return top;
+}
+
+#endif
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/big_B160_56.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/big_B160_56.h
new file mode 100644
index 0000000..85ef05b
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/big_B160_56.h
@@ -0,0 +1,697 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file big.h
+ * @author Mike Scott
+ * @date 23rd February 2016
+ * @brief Big number Header File
+ *
+ *
+ */
+
+#ifndef BIG_B160_56_H
+#define BIG_B160_56_H
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <inttypes.h>
+#include "arch.h"
+#include "core.h"
+#include "config_big_B160_56.h"
+
+using namespace core;
+
+/* could comment this out if code size is a major issue */
+#define UNWOUND
+/* Normally recommended, but may not be optimal for some architectures, for example 32-bit ARM M4 */
+#define USE_KARATSUBA
+
+#define BIGBITS_B160_56 (8*MODBYTES_B160_56)
+#define NLEN_B160_56 (1+((8*MODBYTES_B160_56-1)/BASEBITS_B160_56))
+#define DNLEN_B160_56 2*NLEN_B160_56
+#define BMASK_B160_56 (((chunk)1<<BASEBITS_B160_56)-1) /**< Mask = 2^BASEBITS-1 */
+#define NEXCESS_B160_56 (1<<(CHUNK-BASEBITS_B160_56-1))           /**< 2^(CHUNK-BASEBITS-1) - digit cannot be multiplied by more than this before normalisation */
+
+#define HBITS_B160_56 (BASEBITS_B160_56/2)      /**< Number of bits in number base divided by 2 */
+#define HMASK_B160_56 (((chunk)1<<HBITS_B160_56)-1)    /**< Mask = 2^HBITS-1 */
+
+//#define DEBUG_NORM
+
+#ifdef DEBUG_NORM  /* Add an extra location to track chunk extension */
+#define MPV_B160_56 NLEN_B160_56
+#define MNV_B160_56 (NLEN_B160_56+1)
+#define DMPV_B160_56 DNLEN_B160_56
+#define DMNV_B160_56 (DNLEN_B160_56+1)
+
+#endif
+
+namespace B160_56 {
+
+//extern int BIGMULS;
+//extern int BIGSQRS;
+
+#ifdef DEBUG_NORM
+typedef chunk BIG[NLEN_B160_56 + 2]; /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B160_56 + 2]; /**< Define type DBIG as array of chunks */
+#else
+typedef chunk BIG[NLEN_B160_56];     /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B160_56];   /**< Define type DBIG as array of chunks */
+#endif
+
+/* BIG number prototypes */
+
+/**	@brief Tests for BIG equal to zero (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_iszilch(BIG x);
+/**	@brief Tests for BIG equal to one (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if one, else returns 0
+ */
+extern int BIG_isunity(BIG x);
+/**	@brief Tests for DBIG equal to zero (Constant Time)
+ *
+	@param x a DBIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_diszilch(DBIG x);
+/**	@brief Outputs a BIG number to the console (Variable Time)
+ *
+	@param x a BIG number
+ */
+extern void BIG_output(BIG x);
+/**	@brief Outputs a BIG number to the console in raw form (Variable Time for debugging)
+ *
+	@param x a BIG number
+ */
+extern void BIG_rawoutput(BIG x);
+/**	@brief Conditional constant time swap of two BIG numbers
+ *
+	Conditionally swaps parameters in constant time (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s swap takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cswap(BIG x, BIG y, int s);
+/**	@brief Conditional copy of BIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cmove(BIG x, BIG y, int s);
+/**	@brief Conditional copy of DBIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a DBIG number
+	@param y another DBIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_dcmove(BIG x, BIG y, int s);
+/**	@brief Convert from BIG number to byte array (Constant Time)
+ *
+	@param a byte array
+	@param x BIG number
+ */
+extern void BIG_toBytes(char *a, BIG x);
+/**	@brief Convert to BIG number from byte array (Constant Time)
+ *
+	@param x BIG number
+	@param a byte array
+ */
+extern void BIG_fromBytes(BIG x, char *a);
+/**	@brief Convert to BIG number from byte array of given length (Variable Time)
+ *
+	@param x BIG number
+	@param a byte array
+	@param s byte array length
+ */
+extern void BIG_fromBytesLen(BIG x, char *a, int s);
+/**@brief Convert to DBIG number from byte array of given length (Variable Time)
+ *
+   @param x DBIG number
+   @param a byte array
+   @param s byte array length
+ */
+extern void BIG_dfromBytesLen(DBIG x, char *a, int s);
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_doutput(DBIG x); 
+
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_drawoutput(DBIG x);
+
+/**	@brief Copy BIG from Read-Only Memory to a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number in ROM
+ */
+extern void BIG_rcopy(BIG x, const BIG y);
+/**	@brief Copy BIG to another BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_copy(BIG x, BIG y);
+/**	@brief Copy DBIG to another DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_dcopy(DBIG x, DBIG y);
+/**	@brief Copy BIG to upper half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dsucopy(DBIG x, BIG y);
+/**	@brief Copy BIG to lower half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dscopy(DBIG x, BIG y);
+/**	@brief Copy lower half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sdcopy(BIG x, DBIG y);
+/**	@brief Copy upper half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sducopy(BIG x, DBIG y);
+/**	@brief Set BIG to zero (Constant Time)
+ *
+	@param x BIG number to be set to zero  
+ */
+extern void BIG_zero(BIG x);
+/**	@brief Set DBIG to zero (Constant Time)
+ *
+	@param x DBIG number to be set to zero
+ */
+extern void BIG_dzero(DBIG x);
+/**	@brief Set BIG to one (unity) (Constant Time)
+ *
+	@param x BIG number to be set to one.
+ */
+extern void BIG_one(BIG x);
+/**	@brief Set BIG to inverse mod 2^256 (Constant Time)
+ *
+	@param x BIG number to be inverted
+ */
+extern void BIG_invmod2m(BIG x);
+/**	@brief Set BIG to sum of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, sum of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_add(BIG x, BIG y, BIG z);
+
+/**	@brief Set BIG to logical or of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, or of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_or(BIG x, BIG y, BIG z);
+
+/**	@brief Increment BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be incremented
+	@param i integer
+ */
+extern void BIG_inc(BIG x, int i);
+/**	@brief Set BIG to difference of two BIGs (Constant Time)
+ *
+	@param x BIG number, difference of other two - output not normalised
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_sub(BIG x, BIG y, BIG z);
+/**	@brief Decrement BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be decremented
+	@param i integer
+ */
+extern void BIG_dec(BIG x, int i);
+/**	@brief Set DBIG to sum of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, sum of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dadd(DBIG x, DBIG y, DBIG z);
+/**	@brief Set DBIG to difference of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, difference of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dsub(DBIG x, DBIG y, DBIG z);
+/**	@brief Multiply BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_imul(BIG x, BIG y, int i);
+/**	@brief Multiply BIG by not-so-small small integer - output normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+	@return Overflowing bits
+ */
+extern chunk BIG_pmul(BIG x, BIG y, int i);
+/**	@brief Divide BIG by 3 - output normalised (Constant Time)
+ *
+	@param x BIG number
+	@return Remainder
+ */
+extern int BIG_div3(BIG x);
+/**	@brief Multiply BIG by even bigger small integer resulting in a DBIG - output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_pxmul(DBIG x, BIG y, int i);
+/**	@brief Multiply BIG by another BIG resulting in DBIG - inputs normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_mul(DBIG x, BIG y, BIG z);
+/**	@brief Multiply BIG by another BIG resulting in another BIG - inputs normalised and output normalised (Constant Time)
+ *
+	Note that the product must fit into a BIG, and x must be distinct from y and z
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_smul(BIG x, BIG y, BIG z);
+/**	@brief Square BIG resulting in a DBIG - input normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, square of a BIG
+	@param y BIG number to be squared
+ */
+extern void BIG_sqr(DBIG x, BIG y);
+
+/**	@brief Montgomery reduction of a DBIG to a BIG  - input normalised and output normalised (Constant Time)
+ *
+	@param a BIG number, reduction of a BIG
+	@param md BIG number, the modulus
+	@param MC the Montgomery Constant
+	@param d DBIG number to be reduced
+ */
+extern void BIG_monty(BIG a, BIG md, chunk MC, DBIG d);
+
+/**	@brief Shifts a BIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shl(BIG x, int s);
+/**	@brief Fast shifts a BIG left by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Overflow bits
+ */
+extern int BIG_fshl(BIG x, int s);
+/**	@brief Shifts a DBIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshl(DBIG x, int s);
+/**	@brief Shifts a BIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shr(BIG x, int s);
+
+
+/**	@brief Fast time-critical combined shift by 1 bit, subtract and normalise (Constant Time)
+ *
+	@param r BIG number normalised output
+	@param a BIG number to be subtracted from
+	@param m BIG number to be shifted and subtracted
+	@return sign of r
+ */
+extern int BIG_ssn(BIG r, BIG a, BIG m);
+
+/**	@brief Fast shifts a BIG right by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Shifted out bits
+ */
+extern int BIG_fshr(BIG x, int s);
+/**	@brief Shifts a DBIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshr(DBIG x, int s);
+/**	@brief Splits a DBIG into two BIGs - input must be normalised, outputs normalised (Constant Time as used)
+ *
+	Internal function. The value of s must be approximately in the middle of the DBIG.
+	Typically used to extract z mod 2^MODBITS and z/2^MODBITS
+	@param x BIG number, top half of z
+	@param y BIG number, bottom half of z
+	@param z DBIG number to be split in two.
+	@param s Bit position at which to split
+	@return carry-out from top half
+ */
+extern chunk BIG_split(BIG x, BIG y, DBIG z, int s);
+/**	@brief Normalizes a BIG number - output normalised (Constant Time)
+ *
+	All digits of the input BIG are reduced mod 2^BASEBITS
+	@param x BIG number to be normalised
+ */
+extern chunk BIG_norm(BIG x);
+/**	@brief Normalizes a DBIG number - output normalised (Constant Time)
+ *
+	All digits of the input DBIG are reduced mod 2^BASEBITS
+	@param x DBIG number to be normalised
+ */
+extern void BIG_dnorm(DBIG x);
+/**	@brief Compares two BIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first BIG number to be compared
+	@param y second BIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_comp(BIG x, BIG y);
+/**	@brief Compares two DBIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first DBIG number to be compared
+	@param y second DBIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_dcomp(DBIG x, DBIG y);
+/**	@brief Calculate number of bits in a BIG - output normalised (Variable Time)
+ *
+	@param x BIG number
+	@return Number of bits in x
+ */
+extern int BIG_nbits(BIG x);
+/**	@brief Calculate number of bits in a DBIG - output normalised (Variable Time)
+ *
+	@param x DBIG number
+	@return Number of bits in x
+ */
+extern int BIG_dnbits(DBIG x);
+
+/**	@brief Reduce x mod n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctmod(BIG x, BIG n, int bd);
+
+/**	@brief  x=y mod n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctdmod(BIG x, DBIG y, BIG n, int bd);
+
+/**	@brief Divide x by n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctsdiv(BIG x,BIG n,int bd);
+
+/**	@brief  x=y/n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctddiv(BIG x, DBIG y, BIG n,int bd);
+
+
+/**	@brief Reduce x mod n - input and output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+ */
+extern void BIG_mod(BIG x, BIG n);
+/**	@brief Divide x by n - output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+ */
+extern void BIG_sdiv(BIG x, BIG n);
+/**	@brief  x=y mod n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_dmod(BIG x, DBIG y, BIG n);
+/**	@brief  x=y/n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_ddiv(BIG x, DBIG y, BIG n);
+/**	@brief  return parity of BIG, that is the least significant bit (Constant Time)
+ *
+	@param x BIG number
+	@return 0 or 1
+ */
+extern int BIG_parity(BIG x);
+/**	@brief  return i-th of BIG (Constant Time)
+ *
+	@param x BIG number
+	@param i the bit of x to be returned
+	@return 0 or 1
+ */
+extern int BIG_bit(BIG x, int i);
+/**	@brief  return least significant bits of a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param n number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int BIG_lastbits(BIG x, int n);
+/**	@brief  Create a random BIG from a random number generator (Constant Time)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_random(BIG x, csprng *r);
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randomnum(BIG x, BIG n, csprng *r);
+
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus and truncated to max bit length (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param t Maximum bit length
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randtrunc(BIG x, BIG n, int t, csprng *r);
+
+/**	brief  return NAF (Non-Adjacent-Form) value as +/- 1, 3 or 5, inputs must be normalised
+ *
+	Given x and 3*x extracts NAF value from given bit position, and returns number of bits processed, and number of trailing zeros detected if any
+	param x BIG number
+	param x3 BIG number, three times x
+	param i bit position
+	param nbs pointer to integer returning number of bits processed
+	param nzs pointer to integer returning number of trailing 0s
+	return + or - 1, 3 or 5
+*/
+
+/**	@brief  Calculate x=y*z mod n (Variable Time)
+ *
+	Slow method for modular multiplication
+	@param x BIG number, on exit = y*z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modmul(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y/z mod n (Variable Time)
+ *
+	Slow method for modular division
+	@param x BIG number, on exit = y/z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_moddiv(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y^2 mod n (Variable Time)
+ *
+	Slow method for modular squaring
+	@param x BIG number, on exit = y^2 mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modsqr(BIG x, BIG y, BIG n);
+/**	@brief  Calculate x=-y mod n (Variable Time)
+ *
+	Modular negation
+	@param x BIG number, on exit = -y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modneg(BIG x, BIG y, BIG n);
+
+/**	@brief  Calculate x=y+z mod n (Variable Time)
+ *
+	Slow method for modular addition
+	@param x BIG number, on exit = y+z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modadd(BIG x, BIG y, BIG z, BIG n);
+
+/**	@brief  Calculate jacobi Symbol (x/y) (Variable Time)
+ *
+	@param x BIG number
+	@param y BIG number
+	@return Jacobi symbol, -1,0 or 1
+ */
+extern int BIG_jacobi(BIG x, BIG y);
+/**	@brief  Calculate x=1/y mod n (Variable Time)
+ *
+	Modular Inversion - This is slow. Uses binary method.
+	@param x BIG number, on exit = 1/y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_invmodp(BIG x, BIG y, BIG n);
+/** @brief Calculate x=x mod 2^m (Variable Time)
+ *
+	Truncation
+	@param x BIG number, on reduced mod 2^m
+	@param m new truncated size
+*/
+extern void BIG_mod2m(BIG x, int m);
+
+/**	@brief Calculates a*b+c+*d
+ *
+	Calculate partial product of a.b, add in carry c, and add total to d (Constant Time)
+	@param a multiplier
+	@param b multiplicand
+	@param c carry
+	@param d pointer to accumulated bottom half of result
+	@return top half of result
+ */
+
+
+extern int step1(BIG,BIG,BIG);
+extern void step2(BIG,BIG,BIG);
+
+#ifdef dchunk
+
+/* Method required to calculate x*y+c+r, bottom half in r, top half returned */
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    dchunk prod = (dchunk)x * y + c + *r;
+    *r = (chunk)prod & BMASK_B160_56;
+    return (chunk)(prod >> BASEBITS_B160_56);
+}
+
+#else
+
+/* No integer type available that can store double the wordlength */
+/* accumulate partial products */
+
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    chunk x0, x1, y0, y1;
+    chunk bot, top, mid, carry;
+    x0 = x & HMASK_B160_56;
+    x1 = (x >> HBITS_B160_56);
+    y0 = y & HMASK_B160_56;
+    y1 = (y >> HBITS_B160_56);
+    bot = x0 * y0;
+    top = x1 * y1;
+    mid = x0 * y1 + x1 * y0;
+    x0 = mid & HMASK_B160_56;
+    x1 = (mid >> HBITS_B160_56);
+    bot += x0 << HBITS_B160_56;
+    bot += *r;
+    bot += c;
+
+    top += x1;
+    carry = bot >> BASEBITS_B160_56;
+    bot &= BMASK_B160_56;
+    top += carry;
+
+    *r = bot;
+    return top;
+}
+
+#endif
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/big_B168_60.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/big_B168_60.h
new file mode 100644
index 0000000..cf431a0
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/big_B168_60.h
@@ -0,0 +1,697 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file big.h
+ * @author Mike Scott
+ * @date 23rd February 2016
+ * @brief Big number Header File
+ *
+ *
+ */
+
+#ifndef BIG_B168_60_H
+#define BIG_B168_60_H
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <inttypes.h>
+#include "arch.h"
+#include "core.h"
+#include "config_big_B168_60.h"
+
+using namespace core;
+
+/* could comment this out if code size is a major issue */
+#define UNWOUND
+/* Normally recommended, but may not be optimal for some architectures, for example 32-bit ARM M4 */
+#define USE_KARATSUBA
+
+#define BIGBITS_B168_60 (8*MODBYTES_B168_60)
+#define NLEN_B168_60 (1+((8*MODBYTES_B168_60-1)/BASEBITS_B168_60))
+#define DNLEN_B168_60 2*NLEN_B168_60
+#define BMASK_B168_60 (((chunk)1<<BASEBITS_B168_60)-1) /**< Mask = 2^BASEBITS-1 */
+#define NEXCESS_B168_60 (1<<(CHUNK-BASEBITS_B168_60-1))           /**< 2^(CHUNK-BASEBITS-1) - digit cannot be multiplied by more than this before normalisation */
+
+#define HBITS_B168_60 (BASEBITS_B168_60/2)      /**< Number of bits in number base divided by 2 */
+#define HMASK_B168_60 (((chunk)1<<HBITS_B168_60)-1)    /**< Mask = 2^HBITS-1 */
+
+//#define DEBUG_NORM
+
+#ifdef DEBUG_NORM  /* Add an extra location to track chunk extension */
+#define MPV_B168_60 NLEN_B168_60
+#define MNV_B168_60 (NLEN_B168_60+1)
+#define DMPV_B168_60 DNLEN_B168_60
+#define DMNV_B168_60 (DNLEN_B168_60+1)
+
+#endif
+
+namespace B168_60 {
+
+//extern int BIGMULS;
+//extern int BIGSQRS;
+
+#ifdef DEBUG_NORM
+typedef chunk BIG[NLEN_B168_60 + 2]; /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B168_60 + 2]; /**< Define type DBIG as array of chunks */
+#else
+typedef chunk BIG[NLEN_B168_60];     /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B168_60];   /**< Define type DBIG as array of chunks */
+#endif
+
+/* BIG number prototypes */
+
+/**	@brief Tests for BIG equal to zero (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_iszilch(BIG x);
+/**	@brief Tests for BIG equal to one (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if one, else returns 0
+ */
+extern int BIG_isunity(BIG x);
+/**	@brief Tests for DBIG equal to zero (Constant Time)
+ *
+	@param x a DBIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_diszilch(DBIG x);
+/**	@brief Outputs a BIG number to the console (Variable Time)
+ *
+	@param x a BIG number
+ */
+extern void BIG_output(BIG x);
+/**	@brief Outputs a BIG number to the console in raw form (Variable Time for debugging)
+ *
+	@param x a BIG number
+ */
+extern void BIG_rawoutput(BIG x);
+/**	@brief Conditional constant time swap of two BIG numbers
+ *
+	Conditionally swaps parameters in constant time (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s swap takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cswap(BIG x, BIG y, int s);
+/**	@brief Conditional copy of BIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cmove(BIG x, BIG y, int s);
+/**	@brief Conditional copy of DBIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a DBIG number
+	@param y another DBIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_dcmove(BIG x, BIG y, int s);
+/**	@brief Convert from BIG number to byte array (Constant Time)
+ *
+	@param a byte array
+	@param x BIG number
+ */
+extern void BIG_toBytes(char *a, BIG x);
+/**	@brief Convert to BIG number from byte array (Constant Time)
+ *
+	@param x BIG number
+	@param a byte array
+ */
+extern void BIG_fromBytes(BIG x, char *a);
+/**	@brief Convert to BIG number from byte array of given length (Variable Time)
+ *
+	@param x BIG number
+	@param a byte array
+	@param s byte array length
+ */
+extern void BIG_fromBytesLen(BIG x, char *a, int s);
+/**@brief Convert to DBIG number from byte array of given length (Variable Time)
+ *
+   @param x DBIG number
+   @param a byte array
+   @param s byte array length
+ */
+extern void BIG_dfromBytesLen(DBIG x, char *a, int s);
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_doutput(DBIG x); 
+
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_drawoutput(DBIG x);
+
+/**	@brief Copy BIG from Read-Only Memory to a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number in ROM
+ */
+extern void BIG_rcopy(BIG x, const BIG y);
+/**	@brief Copy BIG to another BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_copy(BIG x, BIG y);
+/**	@brief Copy DBIG to another DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_dcopy(DBIG x, DBIG y);
+/**	@brief Copy BIG to upper half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dsucopy(DBIG x, BIG y);
+/**	@brief Copy BIG to lower half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dscopy(DBIG x, BIG y);
+/**	@brief Copy lower half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sdcopy(BIG x, DBIG y);
+/**	@brief Copy upper half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sducopy(BIG x, DBIG y);
+/**	@brief Set BIG to zero (Constant Time)
+ *
+	@param x BIG number to be set to zero  
+ */
+extern void BIG_zero(BIG x);
+/**	@brief Set DBIG to zero (Constant Time)
+ *
+	@param x DBIG number to be set to zero
+ */
+extern void BIG_dzero(DBIG x);
+/**	@brief Set BIG to one (unity) (Constant Time)
+ *
+	@param x BIG number to be set to one.
+ */
+extern void BIG_one(BIG x);
+/**	@brief Set BIG to inverse mod 2^256 (Constant Time)
+ *
+	@param x BIG number to be inverted
+ */
+extern void BIG_invmod2m(BIG x);
+/**	@brief Set BIG to sum of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, sum of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_add(BIG x, BIG y, BIG z);
+
+/**	@brief Set BIG to logical or of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, or of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_or(BIG x, BIG y, BIG z);
+
+/**	@brief Increment BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be incremented
+	@param i integer
+ */
+extern void BIG_inc(BIG x, int i);
+/**	@brief Set BIG to difference of two BIGs (Constant Time)
+ *
+	@param x BIG number, difference of other two - output not normalised
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_sub(BIG x, BIG y, BIG z);
+/**	@brief Decrement BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be decremented
+	@param i integer
+ */
+extern void BIG_dec(BIG x, int i);
+/**	@brief Set DBIG to sum of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, sum of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dadd(DBIG x, DBIG y, DBIG z);
+/**	@brief Set DBIG to difference of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, difference of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dsub(DBIG x, DBIG y, DBIG z);
+/**	@brief Multiply BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_imul(BIG x, BIG y, int i);
+/**	@brief Multiply BIG by not-so-small small integer - output normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+	@return Overflowing bits
+ */
+extern chunk BIG_pmul(BIG x, BIG y, int i);
+/**	@brief Divide BIG by 3 - output normalised (Constant Time)
+ *
+	@param x BIG number
+	@return Remainder
+ */
+extern int BIG_div3(BIG x);
+/**	@brief Multiply BIG by even bigger small integer resulting in a DBIG - output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_pxmul(DBIG x, BIG y, int i);
+/**	@brief Multiply BIG by another BIG resulting in DBIG - inputs normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_mul(DBIG x, BIG y, BIG z);
+/**	@brief Multiply BIG by another BIG resulting in another BIG - inputs normalised and output normalised (Constant Time)
+ *
+	Note that the product must fit into a BIG, and x must be distinct from y and z
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_smul(BIG x, BIG y, BIG z);
+/**	@brief Square BIG resulting in a DBIG - input normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, square of a BIG
+	@param y BIG number to be squared
+ */
+extern void BIG_sqr(DBIG x, BIG y);
+
+/**	@brief Montgomery reduction of a DBIG to a BIG  - input normalised and output normalised (Constant Time)
+ *
+	@param a BIG number, reduction of a BIG
+	@param md BIG number, the modulus
+	@param MC the Montgomery Constant
+	@param d DBIG number to be reduced
+ */
+extern void BIG_monty(BIG a, BIG md, chunk MC, DBIG d);
+
+/**	@brief Shifts a BIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shl(BIG x, int s);
+/**	@brief Fast shifts a BIG left by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Overflow bits
+ */
+extern int BIG_fshl(BIG x, int s);
+/**	@brief Shifts a DBIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshl(DBIG x, int s);
+/**	@brief Shifts a BIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shr(BIG x, int s);
+
+
+/**	@brief Fast time-critical combined shift by 1 bit, subtract and normalise (Constant Time)
+ *
+	@param r BIG number normalised output
+	@param a BIG number to be subtracted from
+	@param m BIG number to be shifted and subtracted
+	@return sign of r
+ */
+extern int BIG_ssn(BIG r, BIG a, BIG m);
+
+/**	@brief Fast shifts a BIG right by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Shifted out bits
+ */
+extern int BIG_fshr(BIG x, int s);
+/**	@brief Shifts a DBIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshr(DBIG x, int s);
+/**	@brief Splits a DBIG into two BIGs - input must be normalised, outputs normalised (Constant Time as used)
+ *
+	Internal function. The value of s must be approximately in the middle of the DBIG.
+	Typically used to extract z mod 2^MODBITS and z/2^MODBITS
+	@param x BIG number, top half of z
+	@param y BIG number, bottom half of z
+	@param z DBIG number to be split in two.
+	@param s Bit position at which to split
+	@return carry-out from top half
+ */
+extern chunk BIG_split(BIG x, BIG y, DBIG z, int s);
+/**	@brief Normalizes a BIG number - output normalised (Constant Time)
+ *
+	All digits of the input BIG are reduced mod 2^BASEBITS
+	@param x BIG number to be normalised
+ */
+extern chunk BIG_norm(BIG x);
+/**	@brief Normalizes a DBIG number - output normalised (Constant Time)
+ *
+	All digits of the input DBIG are reduced mod 2^BASEBITS
+	@param x DBIG number to be normalised
+ */
+extern void BIG_dnorm(DBIG x);
+/**	@brief Compares two BIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first BIG number to be compared
+	@param y second BIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_comp(BIG x, BIG y);
+/**	@brief Compares two DBIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first DBIG number to be compared
+	@param y second DBIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_dcomp(DBIG x, DBIG y);
+/**	@brief Calculate number of bits in a BIG - output normalised (Variable Time)
+ *
+	@param x BIG number
+	@return Number of bits in x
+ */
+extern int BIG_nbits(BIG x);
+/**	@brief Calculate number of bits in a DBIG - output normalised (Variable Time)
+ *
+	@param x DBIG number
+	@return Number of bits in x
+ */
+extern int BIG_dnbits(DBIG x);
+
+/**	@brief Reduce x mod n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctmod(BIG x, BIG n, int bd);
+
+/**	@brief  x=y mod n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctdmod(BIG x, DBIG y, BIG n, int bd);
+
+/**	@brief Divide x by n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctsdiv(BIG x,BIG n,int bd);
+
+/**	@brief  x=y/n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctddiv(BIG x, DBIG y, BIG n,int bd);
+
+
+/**	@brief Reduce x mod n - input and output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+ */
+extern void BIG_mod(BIG x, BIG n);
+/**	@brief Divide x by n - output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+ */
+extern void BIG_sdiv(BIG x, BIG n);
+/**	@brief  x=y mod n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_dmod(BIG x, DBIG y, BIG n);
+/**	@brief  x=y/n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_ddiv(BIG x, DBIG y, BIG n);
+/**	@brief  return parity of BIG, that is the least significant bit (Constant Time)
+ *
+	@param x BIG number
+	@return 0 or 1
+ */
+extern int BIG_parity(BIG x);
+/**	@brief  return i-th of BIG (Constant Time)
+ *
+	@param x BIG number
+	@param i the bit of x to be returned
+	@return 0 or 1
+ */
+extern int BIG_bit(BIG x, int i);
+/**	@brief  return least significant bits of a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param n number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int BIG_lastbits(BIG x, int n);
+/**	@brief  Create a random BIG from a random number generator (Constant Time)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_random(BIG x, csprng *r);
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randomnum(BIG x, BIG n, csprng *r);
+
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus and truncated to max bit length (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param t Maximum bit length
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randtrunc(BIG x, BIG n, int t, csprng *r);
+
+/**	brief  return NAF (Non-Adjacent-Form) value as +/- 1, 3 or 5, inputs must be normalised
+ *
+	Given x and 3*x extracts NAF value from given bit position, and returns number of bits processed, and number of trailing zeros detected if any
+	param x BIG number
+	param x3 BIG number, three times x
+	param i bit position
+	param nbs pointer to integer returning number of bits processed
+	param nzs pointer to integer returning number of trailing 0s
+	return + or - 1, 3 or 5
+*/
+
+/**	@brief  Calculate x=y*z mod n (Variable Time)
+ *
+	Slow method for modular multiplication
+	@param x BIG number, on exit = y*z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modmul(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y/z mod n (Variable Time)
+ *
+	Slow method for modular division
+	@param x BIG number, on exit = y/z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_moddiv(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y^2 mod n (Variable Time)
+ *
+	Slow method for modular squaring
+	@param x BIG number, on exit = y^2 mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modsqr(BIG x, BIG y, BIG n);
+/**	@brief  Calculate x=-y mod n (Variable Time)
+ *
+	Modular negation
+	@param x BIG number, on exit = -y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modneg(BIG x, BIG y, BIG n);
+
+/**	@brief  Calculate x=y+z mod n (Variable Time)
+ *
+	Slow method for modular addition
+	@param x BIG number, on exit = y+z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modadd(BIG x, BIG y, BIG z, BIG n);
+
+/**	@brief  Calculate jacobi Symbol (x/y) (Variable Time)
+ *
+	@param x BIG number
+	@param y BIG number
+	@return Jacobi symbol, -1,0 or 1
+ */
+extern int BIG_jacobi(BIG x, BIG y);
+/**	@brief  Calculate x=1/y mod n (Variable Time)
+ *
+	Modular Inversion - This is slow. Uses binary method.
+	@param x BIG number, on exit = 1/y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_invmodp(BIG x, BIG y, BIG n);
+/** @brief Calculate x=x mod 2^m (Variable Time)
+ *
+	Truncation
+	@param x BIG number, on reduced mod 2^m
+	@param m new truncated size
+*/
+extern void BIG_mod2m(BIG x, int m);
+
+/**	@brief Calculates a*b+c+*d
+ *
+	Calculate partial product of a.b, add in carry c, and add total to d (Constant Time)
+	@param a multiplier
+	@param b multiplicand
+	@param c carry
+	@param d pointer to accumulated bottom half of result
+	@return top half of result
+ */
+
+
+extern int step1(BIG,BIG,BIG);
+extern void step2(BIG,BIG,BIG);
+
+#ifdef dchunk
+
+/* Method required to calculate x*y+c+r, bottom half in r, top half returned */
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    dchunk prod = (dchunk)x * y + c + *r;
+    *r = (chunk)prod & BMASK_B168_60;
+    return (chunk)(prod >> BASEBITS_B168_60);
+}
+
+#else
+
+/* No integer type available that can store double the wordlength */
+/* accumulate partial products */
+
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    chunk x0, x1, y0, y1;
+    chunk bot, top, mid, carry;
+    x0 = x & HMASK_B168_60;
+    x1 = (x >> HBITS_B168_60);
+    y0 = y & HMASK_B168_60;
+    y1 = (y >> HBITS_B168_60);
+    bot = x0 * y0;
+    top = x1 * y1;
+    mid = x0 * y1 + x1 * y0;
+    x0 = mid & HMASK_B168_60;
+    x1 = (mid >> HBITS_B168_60);
+    bot += x0 << HBITS_B168_60;
+    bot += *r;
+    bot += c;
+
+    top += x1;
+    carry = bot >> BASEBITS_B168_60;
+    bot &= BMASK_B168_60;
+    top += carry;
+
+    *r = bot;
+    return top;
+}
+
+#endif
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/big_B256_56.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/big_B256_56.h
new file mode 100644
index 0000000..63e0e1d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/big_B256_56.h
@@ -0,0 +1,697 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file big.h
+ * @author Mike Scott
+ * @date 23rd February 2016
+ * @brief Big number Header File
+ *
+ *
+ */
+
+#ifndef BIG_B256_56_H
+#define BIG_B256_56_H
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <inttypes.h>
+#include "arch.h"
+#include "core.h"
+#include "config_big_B256_56.h"
+
+using namespace core;
+
+/* could comment this out if code size is a major issue */
+#define UNWOUND
+/* Normally recommended, but may not be optimal for some architectures, for example 32-bit ARM M4 */
+#define USE_KARATSUBA
+
+#define BIGBITS_B256_56 (8*MODBYTES_B256_56)
+#define NLEN_B256_56 (1+((8*MODBYTES_B256_56-1)/BASEBITS_B256_56))
+#define DNLEN_B256_56 2*NLEN_B256_56
+#define BMASK_B256_56 (((chunk)1<<BASEBITS_B256_56)-1) /**< Mask = 2^BASEBITS-1 */
+#define NEXCESS_B256_56 (1<<(CHUNK-BASEBITS_B256_56-1))           /**< 2^(CHUNK-BASEBITS-1) - digit cannot be multiplied by more than this before normalisation */
+
+#define HBITS_B256_56 (BASEBITS_B256_56/2)      /**< Number of bits in number base divided by 2 */
+#define HMASK_B256_56 (((chunk)1<<HBITS_B256_56)-1)    /**< Mask = 2^HBITS-1 */
+
+//#define DEBUG_NORM
+
+#ifdef DEBUG_NORM  /* Add an extra location to track chunk extension */
+#define MPV_B256_56 NLEN_B256_56
+#define MNV_B256_56 (NLEN_B256_56+1)
+#define DMPV_B256_56 DNLEN_B256_56
+#define DMNV_B256_56 (DNLEN_B256_56+1)
+
+#endif
+
+namespace B256_56 {
+
+//extern int BIGMULS;
+//extern int BIGSQRS;
+
+#ifdef DEBUG_NORM
+typedef chunk BIG[NLEN_B256_56 + 2]; /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B256_56 + 2]; /**< Define type DBIG as array of chunks */
+#else
+typedef chunk BIG[NLEN_B256_56];     /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B256_56];   /**< Define type DBIG as array of chunks */
+#endif
+
+/* BIG number prototypes */
+
+/**	@brief Tests for BIG equal to zero (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_iszilch(BIG x);
+/**	@brief Tests for BIG equal to one (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if one, else returns 0
+ */
+extern int BIG_isunity(BIG x);
+/**	@brief Tests for DBIG equal to zero (Constant Time)
+ *
+	@param x a DBIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_diszilch(DBIG x);
+/**	@brief Outputs a BIG number to the console (Variable Time)
+ *
+	@param x a BIG number
+ */
+extern void BIG_output(BIG x);
+/**	@brief Outputs a BIG number to the console in raw form (Variable Time for debugging)
+ *
+	@param x a BIG number
+ */
+extern void BIG_rawoutput(BIG x);
+/**	@brief Conditional constant time swap of two BIG numbers
+ *
+	Conditionally swaps parameters in constant time (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s swap takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cswap(BIG x, BIG y, int s);
+/**	@brief Conditional copy of BIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cmove(BIG x, BIG y, int s);
+/**	@brief Conditional copy of DBIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a DBIG number
+	@param y another DBIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_dcmove(BIG x, BIG y, int s);
+/**	@brief Convert from BIG number to byte array (Constant Time)
+ *
+	@param a byte array
+	@param x BIG number
+ */
+extern void BIG_toBytes(char *a, BIG x);
+/**	@brief Convert to BIG number from byte array (Constant Time)
+ *
+	@param x BIG number
+	@param a byte array
+ */
+extern void BIG_fromBytes(BIG x, char *a);
+/**	@brief Convert to BIG number from byte array of given length (Variable Time)
+ *
+	@param x BIG number
+	@param a byte array
+	@param s byte array length
+ */
+extern void BIG_fromBytesLen(BIG x, char *a, int s);
+/**@brief Convert to DBIG number from byte array of given length (Variable Time)
+ *
+   @param x DBIG number
+   @param a byte array
+   @param s byte array length
+ */
+extern void BIG_dfromBytesLen(DBIG x, char *a, int s);
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_doutput(DBIG x); 
+
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_drawoutput(DBIG x);
+
+/**	@brief Copy BIG from Read-Only Memory to a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number in ROM
+ */
+extern void BIG_rcopy(BIG x, const BIG y);
+/**	@brief Copy BIG to another BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_copy(BIG x, BIG y);
+/**	@brief Copy DBIG to another DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_dcopy(DBIG x, DBIG y);
+/**	@brief Copy BIG to upper half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dsucopy(DBIG x, BIG y);
+/**	@brief Copy BIG to lower half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dscopy(DBIG x, BIG y);
+/**	@brief Copy lower half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sdcopy(BIG x, DBIG y);
+/**	@brief Copy upper half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sducopy(BIG x, DBIG y);
+/**	@brief Set BIG to zero (Constant Time)
+ *
+	@param x BIG number to be set to zero  
+ */
+extern void BIG_zero(BIG x);
+/**	@brief Set DBIG to zero (Constant Time)
+ *
+	@param x DBIG number to be set to zero
+ */
+extern void BIG_dzero(DBIG x);
+/**	@brief Set BIG to one (unity) (Constant Time)
+ *
+	@param x BIG number to be set to one.
+ */
+extern void BIG_one(BIG x);
+/**	@brief Set BIG to inverse mod 2^256 (Constant Time)
+ *
+	@param x BIG number to be inverted
+ */
+extern void BIG_invmod2m(BIG x);
+/**	@brief Set BIG to sum of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, sum of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_add(BIG x, BIG y, BIG z);
+
+/**	@brief Set BIG to logical or of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, or of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_or(BIG x, BIG y, BIG z);
+
+/**	@brief Increment BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be incremented
+	@param i integer
+ */
+extern void BIG_inc(BIG x, int i);
+/**	@brief Set BIG to difference of two BIGs (Constant Time)
+ *
+	@param x BIG number, difference of other two - output not normalised
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_sub(BIG x, BIG y, BIG z);
+/**	@brief Decrement BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be decremented
+	@param i integer
+ */
+extern void BIG_dec(BIG x, int i);
+/**	@brief Set DBIG to sum of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, sum of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dadd(DBIG x, DBIG y, DBIG z);
+/**	@brief Set DBIG to difference of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, difference of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dsub(DBIG x, DBIG y, DBIG z);
+/**	@brief Multiply BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_imul(BIG x, BIG y, int i);
+/**	@brief Multiply BIG by not-so-small small integer - output normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+	@return Overflowing bits
+ */
+extern chunk BIG_pmul(BIG x, BIG y, int i);
+/**	@brief Divide BIG by 3 - output normalised (Constant Time)
+ *
+	@param x BIG number
+	@return Remainder
+ */
+extern int BIG_div3(BIG x);
+/**	@brief Multiply BIG by even bigger small integer resulting in a DBIG - output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_pxmul(DBIG x, BIG y, int i);
+/**	@brief Multiply BIG by another BIG resulting in DBIG - inputs normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_mul(DBIG x, BIG y, BIG z);
+/**	@brief Multiply BIG by another BIG resulting in another BIG - inputs normalised and output normalised (Constant Time)
+ *
+	Note that the product must fit into a BIG, and x must be distinct from y and z
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_smul(BIG x, BIG y, BIG z);
+/**	@brief Square BIG resulting in a DBIG - input normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, square of a BIG
+	@param y BIG number to be squared
+ */
+extern void BIG_sqr(DBIG x, BIG y);
+
+/**	@brief Montgomery reduction of a DBIG to a BIG  - input normalised and output normalised (Constant Time)
+ *
+	@param a BIG number, reduction of a BIG
+	@param md BIG number, the modulus
+	@param MC the Montgomery Constant
+	@param d DBIG number to be reduced
+ */
+extern void BIG_monty(BIG a, BIG md, chunk MC, DBIG d);
+
+/**	@brief Shifts a BIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shl(BIG x, int s);
+/**	@brief Fast shifts a BIG left by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Overflow bits
+ */
+extern int BIG_fshl(BIG x, int s);
+/**	@brief Shifts a DBIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshl(DBIG x, int s);
+/**	@brief Shifts a BIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shr(BIG x, int s);
+
+
+/**	@brief Fast time-critical combined shift by 1 bit, subtract and normalise (Constant Time)
+ *
+	@param r BIG number normalised output
+	@param a BIG number to be subtracted from
+	@param m BIG number to be shifted and subtracted
+	@return sign of r
+ */
+extern int BIG_ssn(BIG r, BIG a, BIG m);
+
+/**	@brief Fast shifts a BIG right by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Shifted out bits
+ */
+extern int BIG_fshr(BIG x, int s);
+/**	@brief Shifts a DBIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshr(DBIG x, int s);
+/**	@brief Splits a DBIG into two BIGs - input must be normalised, outputs normalised (Constant Time as used)
+ *
+	Internal function. The value of s must be approximately in the middle of the DBIG.
+	Typically used to extract z mod 2^MODBITS and z/2^MODBITS
+	@param x BIG number, top half of z
+	@param y BIG number, bottom half of z
+	@param z DBIG number to be split in two.
+	@param s Bit position at which to split
+	@return carry-out from top half
+ */
+extern chunk BIG_split(BIG x, BIG y, DBIG z, int s);
+/**	@brief Normalizes a BIG number - output normalised (Constant Time)
+ *
+	All digits of the input BIG are reduced mod 2^BASEBITS
+	@param x BIG number to be normalised
+ */
+extern chunk BIG_norm(BIG x);
+/**	@brief Normalizes a DBIG number - output normalised (Constant Time)
+ *
+	All digits of the input DBIG are reduced mod 2^BASEBITS
+	@param x DBIG number to be normalised
+ */
+extern void BIG_dnorm(DBIG x);
+/**	@brief Compares two BIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first BIG number to be compared
+	@param y second BIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_comp(BIG x, BIG y);
+/**	@brief Compares two DBIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first DBIG number to be compared
+	@param y second DBIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_dcomp(DBIG x, DBIG y);
+/**	@brief Calculate number of bits in a BIG - output normalised (Variable Time)
+ *
+	@param x BIG number
+	@return Number of bits in x
+ */
+extern int BIG_nbits(BIG x);
+/**	@brief Calculate number of bits in a DBIG - output normalised (Variable Time)
+ *
+	@param x DBIG number
+	@return Number of bits in x
+ */
+extern int BIG_dnbits(DBIG x);
+
+/**	@brief Reduce x mod n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctmod(BIG x, BIG n, int bd);
+
+/**	@brief  x=y mod n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctdmod(BIG x, DBIG y, BIG n, int bd);
+
+/**	@brief Divide x by n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctsdiv(BIG x,BIG n,int bd);
+
+/**	@brief  x=y/n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctddiv(BIG x, DBIG y, BIG n,int bd);
+
+
+/**	@brief Reduce x mod n - input and output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+ */
+extern void BIG_mod(BIG x, BIG n);
+/**	@brief Divide x by n - output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+ */
+extern void BIG_sdiv(BIG x, BIG n);
+/**	@brief  x=y mod n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_dmod(BIG x, DBIG y, BIG n);
+/**	@brief  x=y/n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_ddiv(BIG x, DBIG y, BIG n);
+/**	@brief  return parity of BIG, that is the least significant bit (Constant Time)
+ *
+	@param x BIG number
+	@return 0 or 1
+ */
+extern int BIG_parity(BIG x);
+/**	@brief  return i-th of BIG (Constant Time)
+ *
+	@param x BIG number
+	@param i the bit of x to be returned
+	@return 0 or 1
+ */
+extern int BIG_bit(BIG x, int i);
+/**	@brief  return least significant bits of a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param n number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int BIG_lastbits(BIG x, int n);
+/**	@brief  Create a random BIG from a random number generator (Constant Time)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_random(BIG x, csprng *r);
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randomnum(BIG x, BIG n, csprng *r);
+
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus and truncated to max bit length (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param t Maximum bit length
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randtrunc(BIG x, BIG n, int t, csprng *r);
+
+/**	brief  return NAF (Non-Adjacent-Form) value as +/- 1, 3 or 5, inputs must be normalised
+ *
+	Given x and 3*x extracts NAF value from given bit position, and returns number of bits processed, and number of trailing zeros detected if any
+	param x BIG number
+	param x3 BIG number, three times x
+	param i bit position
+	param nbs pointer to integer returning number of bits processed
+	param nzs pointer to integer returning number of trailing 0s
+	return + or - 1, 3 or 5
+*/
+
+/**	@brief  Calculate x=y*z mod n (Variable Time)
+ *
+	Slow method for modular multiplication
+	@param x BIG number, on exit = y*z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modmul(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y/z mod n (Variable Time)
+ *
+	Slow method for modular division
+	@param x BIG number, on exit = y/z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_moddiv(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y^2 mod n (Variable Time)
+ *
+	Slow method for modular squaring
+	@param x BIG number, on exit = y^2 mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modsqr(BIG x, BIG y, BIG n);
+/**	@brief  Calculate x=-y mod n (Variable Time)
+ *
+	Modular negation
+	@param x BIG number, on exit = -y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modneg(BIG x, BIG y, BIG n);
+
+/**	@brief  Calculate x=y+z mod n (Variable Time)
+ *
+	Slow method for modular addition
+	@param x BIG number, on exit = y+z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modadd(BIG x, BIG y, BIG z, BIG n);
+
+/**	@brief  Calculate jacobi Symbol (x/y) (Variable Time)
+ *
+	@param x BIG number
+	@param y BIG number
+	@return Jacobi symbol, -1,0 or 1
+ */
+extern int BIG_jacobi(BIG x, BIG y);
+/**	@brief  Calculate x=1/y mod n (Variable Time)
+ *
+	Modular Inversion - This is slow. Uses binary method.
+	@param x BIG number, on exit = 1/y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_invmodp(BIG x, BIG y, BIG n);
+/** @brief Calculate x=x mod 2^m (Variable Time)
+ *
+	Truncation
+	@param x BIG number, on reduced mod 2^m
+	@param m new truncated size
+*/
+extern void BIG_mod2m(BIG x, int m);
+
+/**	@brief Calculates a*b+c+*d
+ *
+	Calculate partial product of a.b, add in carry c, and add total to d (Constant Time)
+	@param a multiplier
+	@param b multiplicand
+	@param c carry
+	@param d pointer to accumulated bottom half of result
+	@return top half of result
+ */
+
+
+extern int step1(BIG,BIG,BIG);
+extern void step2(BIG,BIG,BIG);
+
+#ifdef dchunk
+
+/* Method required to calculate x*y+c+r, bottom half in r, top half returned */
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    dchunk prod = (dchunk)x * y + c + *r;
+    *r = (chunk)prod & BMASK_B256_56;
+    return (chunk)(prod >> BASEBITS_B256_56);
+}
+
+#else
+
+/* No integer type available that can store double the wordlength */
+/* accumulate partial products */
+
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    chunk x0, x1, y0, y1;
+    chunk bot, top, mid, carry;
+    x0 = x & HMASK_B256_56;
+    x1 = (x >> HBITS_B256_56);
+    y0 = y & HMASK_B256_56;
+    y1 = (y >> HBITS_B256_56);
+    bot = x0 * y0;
+    top = x1 * y1;
+    mid = x0 * y1 + x1 * y0;
+    x0 = mid & HMASK_B256_56;
+    x1 = (mid >> HBITS_B256_56);
+    bot += x0 << HBITS_B256_56;
+    bot += *r;
+    bot += c;
+
+    top += x1;
+    carry = bot >> BASEBITS_B256_56;
+    bot &= BMASK_B256_56;
+    top += carry;
+
+    *r = bot;
+    return top;
+}
+
+#endif
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/big_B288_60.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/big_B288_60.h
new file mode 100644
index 0000000..991383b
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/big_B288_60.h
@@ -0,0 +1,697 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file big.h
+ * @author Mike Scott
+ * @date 23rd February 2016
+ * @brief Big number Header File
+ *
+ *
+ */
+
+#ifndef BIG_B288_60_H
+#define BIG_B288_60_H
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <inttypes.h>
+#include "arch.h"
+#include "core.h"
+#include "config_big_B288_60.h"
+
+using namespace core;
+
+/* could comment this out if code size is a major issue */
+#define UNWOUND
+/* Normally recommended, but may not be optimal for some architectures, for example 32-bit ARM M4 */
+#define USE_KARATSUBA
+
+#define BIGBITS_B288_60 (8*MODBYTES_B288_60)
+#define NLEN_B288_60 (1+((8*MODBYTES_B288_60-1)/BASEBITS_B288_60))
+#define DNLEN_B288_60 2*NLEN_B288_60
+#define BMASK_B288_60 (((chunk)1<<BASEBITS_B288_60)-1) /**< Mask = 2^BASEBITS-1 */
+#define NEXCESS_B288_60 (1<<(CHUNK-BASEBITS_B288_60-1))           /**< 2^(CHUNK-BASEBITS-1) - digit cannot be multiplied by more than this before normalisation */
+
+#define HBITS_B288_60 (BASEBITS_B288_60/2)      /**< Number of bits in number base divided by 2 */
+#define HMASK_B288_60 (((chunk)1<<HBITS_B288_60)-1)    /**< Mask = 2^HBITS-1 */
+
+//#define DEBUG_NORM
+
+#ifdef DEBUG_NORM  /* Add an extra location to track chunk extension */
+#define MPV_B288_60 NLEN_B288_60
+#define MNV_B288_60 (NLEN_B288_60+1)
+#define DMPV_B288_60 DNLEN_B288_60
+#define DMNV_B288_60 (DNLEN_B288_60+1)
+
+#endif
+
+namespace B288_60 {
+
+//extern int BIGMULS;
+//extern int BIGSQRS;
+
+#ifdef DEBUG_NORM
+typedef chunk BIG[NLEN_B288_60 + 2]; /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B288_60 + 2]; /**< Define type DBIG as array of chunks */
+#else
+typedef chunk BIG[NLEN_B288_60];     /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B288_60];   /**< Define type DBIG as array of chunks */
+#endif
+
+/* BIG number prototypes */
+
+/**	@brief Tests for BIG equal to zero (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_iszilch(BIG x);
+/**	@brief Tests for BIG equal to one (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if one, else returns 0
+ */
+extern int BIG_isunity(BIG x);
+/**	@brief Tests for DBIG equal to zero (Constant Time)
+ *
+	@param x a DBIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_diszilch(DBIG x);
+/**	@brief Outputs a BIG number to the console (Variable Time)
+ *
+	@param x a BIG number
+ */
+extern void BIG_output(BIG x);
+/**	@brief Outputs a BIG number to the console in raw form (Variable Time for debugging)
+ *
+	@param x a BIG number
+ */
+extern void BIG_rawoutput(BIG x);
+/**	@brief Conditional constant time swap of two BIG numbers
+ *
+	Conditionally swaps parameters in constant time (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s swap takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cswap(BIG x, BIG y, int s);
+/**	@brief Conditional copy of BIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cmove(BIG x, BIG y, int s);
+/**	@brief Conditional copy of DBIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a DBIG number
+	@param y another DBIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_dcmove(BIG x, BIG y, int s);
+/**	@brief Convert from BIG number to byte array (Constant Time)
+ *
+	@param a byte array
+	@param x BIG number
+ */
+extern void BIG_toBytes(char *a, BIG x);
+/**	@brief Convert to BIG number from byte array (Constant Time)
+ *
+	@param x BIG number
+	@param a byte array
+ */
+extern void BIG_fromBytes(BIG x, char *a);
+/**	@brief Convert to BIG number from byte array of given length (Variable Time)
+ *
+	@param x BIG number
+	@param a byte array
+	@param s byte array length
+ */
+extern void BIG_fromBytesLen(BIG x, char *a, int s);
+/**@brief Convert to DBIG number from byte array of given length (Variable Time)
+ *
+   @param x DBIG number
+   @param a byte array
+   @param s byte array length
+ */
+extern void BIG_dfromBytesLen(DBIG x, char *a, int s);
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_doutput(DBIG x); 
+
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_drawoutput(DBIG x);
+
+/**	@brief Copy BIG from Read-Only Memory to a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number in ROM
+ */
+extern void BIG_rcopy(BIG x, const BIG y);
+/**	@brief Copy BIG to another BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_copy(BIG x, BIG y);
+/**	@brief Copy DBIG to another DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_dcopy(DBIG x, DBIG y);
+/**	@brief Copy BIG to upper half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dsucopy(DBIG x, BIG y);
+/**	@brief Copy BIG to lower half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dscopy(DBIG x, BIG y);
+/**	@brief Copy lower half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sdcopy(BIG x, DBIG y);
+/**	@brief Copy upper half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sducopy(BIG x, DBIG y);
+/**	@brief Set BIG to zero (Constant Time)
+ *
+	@param x BIG number to be set to zero  
+ */
+extern void BIG_zero(BIG x);
+/**	@brief Set DBIG to zero (Constant Time)
+ *
+	@param x DBIG number to be set to zero
+ */
+extern void BIG_dzero(DBIG x);
+/**	@brief Set BIG to one (unity) (Constant Time)
+ *
+	@param x BIG number to be set to one.
+ */
+extern void BIG_one(BIG x);
+/**	@brief Set BIG to inverse mod 2^256 (Constant Time)
+ *
+	@param x BIG number to be inverted
+ */
+extern void BIG_invmod2m(BIG x);
+/**	@brief Set BIG to sum of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, sum of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_add(BIG x, BIG y, BIG z);
+
+/**	@brief Set BIG to logical or of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, or of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_or(BIG x, BIG y, BIG z);
+
+/**	@brief Increment BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be incremented
+	@param i integer
+ */
+extern void BIG_inc(BIG x, int i);
+/**	@brief Set BIG to difference of two BIGs (Constant Time)
+ *
+	@param x BIG number, difference of other two - output not normalised
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_sub(BIG x, BIG y, BIG z);
+/**	@brief Decrement BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be decremented
+	@param i integer
+ */
+extern void BIG_dec(BIG x, int i);
+/**	@brief Set DBIG to sum of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, sum of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dadd(DBIG x, DBIG y, DBIG z);
+/**	@brief Set DBIG to difference of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, difference of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dsub(DBIG x, DBIG y, DBIG z);
+/**	@brief Multiply BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_imul(BIG x, BIG y, int i);
+/**	@brief Multiply BIG by not-so-small small integer - output normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+	@return Overflowing bits
+ */
+extern chunk BIG_pmul(BIG x, BIG y, int i);
+/**	@brief Divide BIG by 3 - output normalised (Constant Time)
+ *
+	@param x BIG number
+	@return Remainder
+ */
+extern int BIG_div3(BIG x);
+/**	@brief Multiply BIG by even bigger small integer resulting in a DBIG - output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_pxmul(DBIG x, BIG y, int i);
+/**	@brief Multiply BIG by another BIG resulting in DBIG - inputs normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_mul(DBIG x, BIG y, BIG z);
+/**	@brief Multiply BIG by another BIG resulting in another BIG - inputs normalised and output normalised (Constant Time)
+ *
+	Note that the product must fit into a BIG, and x must be distinct from y and z
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_smul(BIG x, BIG y, BIG z);
+/**	@brief Square BIG resulting in a DBIG - input normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, square of a BIG
+	@param y BIG number to be squared
+ */
+extern void BIG_sqr(DBIG x, BIG y);
+
+/**	@brief Montgomery reduction of a DBIG to a BIG  - input normalised and output normalised (Constant Time)
+ *
+	@param a BIG number, reduction of a BIG
+	@param md BIG number, the modulus
+	@param MC the Montgomery Constant
+	@param d DBIG number to be reduced
+ */
+extern void BIG_monty(BIG a, BIG md, chunk MC, DBIG d);
+
+/**	@brief Shifts a BIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shl(BIG x, int s);
+/**	@brief Fast shifts a BIG left by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Overflow bits
+ */
+extern int BIG_fshl(BIG x, int s);
+/**	@brief Shifts a DBIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshl(DBIG x, int s);
+/**	@brief Shifts a BIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shr(BIG x, int s);
+
+
+/**	@brief Fast time-critical combined shift by 1 bit, subtract and normalise (Constant Time)
+ *
+	@param r BIG number normalised output
+	@param a BIG number to be subtracted from
+	@param m BIG number to be shifted and subtracted
+	@return sign of r
+ */
+extern int BIG_ssn(BIG r, BIG a, BIG m);
+
+/**	@brief Fast shifts a BIG right by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Shifted out bits
+ */
+extern int BIG_fshr(BIG x, int s);
+/**	@brief Shifts a DBIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshr(DBIG x, int s);
+/**	@brief Splits a DBIG into two BIGs - input must be normalised, outputs normalised (Constant Time as used)
+ *
+	Internal function. The value of s must be approximately in the middle of the DBIG.
+	Typically used to extract z mod 2^MODBITS and z/2^MODBITS
+	@param x BIG number, top half of z
+	@param y BIG number, bottom half of z
+	@param z DBIG number to be split in two.
+	@param s Bit position at which to split
+	@return carry-out from top half
+ */
+extern chunk BIG_split(BIG x, BIG y, DBIG z, int s);
+/**	@brief Normalizes a BIG number - output normalised (Constant Time)
+ *
+	All digits of the input BIG are reduced mod 2^BASEBITS
+	@param x BIG number to be normalised
+ */
+extern chunk BIG_norm(BIG x);
+/**	@brief Normalizes a DBIG number - output normalised (Constant Time)
+ *
+	All digits of the input DBIG are reduced mod 2^BASEBITS
+	@param x DBIG number to be normalised
+ */
+extern void BIG_dnorm(DBIG x);
+/**	@brief Compares two BIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first BIG number to be compared
+	@param y second BIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_comp(BIG x, BIG y);
+/**	@brief Compares two DBIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first DBIG number to be compared
+	@param y second DBIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_dcomp(DBIG x, DBIG y);
+/**	@brief Calculate number of bits in a BIG - output normalised (Variable Time)
+ *
+	@param x BIG number
+	@return Number of bits in x
+ */
+extern int BIG_nbits(BIG x);
+/**	@brief Calculate number of bits in a DBIG - output normalised (Variable Time)
+ *
+	@param x DBIG number
+	@return Number of bits in x
+ */
+extern int BIG_dnbits(DBIG x);
+
+/**	@brief Reduce x mod n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctmod(BIG x, BIG n, int bd);
+
+/**	@brief  x=y mod n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctdmod(BIG x, DBIG y, BIG n, int bd);
+
+/**	@brief Divide x by n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctsdiv(BIG x,BIG n,int bd);
+
+/**	@brief  x=y/n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctddiv(BIG x, DBIG y, BIG n,int bd);
+
+
+/**	@brief Reduce x mod n - input and output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+ */
+extern void BIG_mod(BIG x, BIG n);
+/**	@brief Divide x by n - output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+ */
+extern void BIG_sdiv(BIG x, BIG n);
+/**	@brief  x=y mod n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_dmod(BIG x, DBIG y, BIG n);
+/**	@brief  x=y/n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_ddiv(BIG x, DBIG y, BIG n);
+/**	@brief  return parity of BIG, that is the least significant bit (Constant Time)
+ *
+	@param x BIG number
+	@return 0 or 1
+ */
+extern int BIG_parity(BIG x);
+/**	@brief  return i-th of BIG (Constant Time)
+ *
+	@param x BIG number
+	@param i the bit of x to be returned
+	@return 0 or 1
+ */
+extern int BIG_bit(BIG x, int i);
+/**	@brief  return least significant bits of a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param n number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int BIG_lastbits(BIG x, int n);
+/**	@brief  Create a random BIG from a random number generator (Constant Time)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_random(BIG x, csprng *r);
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randomnum(BIG x, BIG n, csprng *r);
+
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus and truncated to max bit length (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param t Maximum bit length
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randtrunc(BIG x, BIG n, int t, csprng *r);
+
+/**	brief  return NAF (Non-Adjacent-Form) value as +/- 1, 3 or 5, inputs must be normalised
+ *
+	Given x and 3*x extracts NAF value from given bit position, and returns number of bits processed, and number of trailing zeros detected if any
+	param x BIG number
+	param x3 BIG number, three times x
+	param i bit position
+	param nbs pointer to integer returning number of bits processed
+	param nzs pointer to integer returning number of trailing 0s
+	return + or - 1, 3 or 5
+*/
+
+/**	@brief  Calculate x=y*z mod n (Variable Time)
+ *
+	Slow method for modular multiplication
+	@param x BIG number, on exit = y*z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modmul(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y/z mod n (Variable Time)
+ *
+	Slow method for modular division
+	@param x BIG number, on exit = y/z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_moddiv(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y^2 mod n (Variable Time)
+ *
+	Slow method for modular squaring
+	@param x BIG number, on exit = y^2 mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modsqr(BIG x, BIG y, BIG n);
+/**	@brief  Calculate x=-y mod n (Variable Time)
+ *
+	Modular negation
+	@param x BIG number, on exit = -y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modneg(BIG x, BIG y, BIG n);
+
+/**	@brief  Calculate x=y+z mod n (Variable Time)
+ *
+	Slow method for modular addition
+	@param x BIG number, on exit = y+z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modadd(BIG x, BIG y, BIG z, BIG n);
+
+/**	@brief  Calculate jacobi Symbol (x/y) (Variable Time)
+ *
+	@param x BIG number
+	@param y BIG number
+	@return Jacobi symbol, -1,0 or 1
+ */
+extern int BIG_jacobi(BIG x, BIG y);
+/**	@brief  Calculate x=1/y mod n (Variable Time)
+ *
+	Modular Inversion - This is slow. Uses binary method.
+	@param x BIG number, on exit = 1/y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_invmodp(BIG x, BIG y, BIG n);
+/** @brief Calculate x=x mod 2^m (Variable Time)
+ *
+	Truncation
+	@param x BIG number, on reduced mod 2^m
+	@param m new truncated size
+*/
+extern void BIG_mod2m(BIG x, int m);
+
+/**	@brief Calculates a*b+c+*d
+ *
+	Calculate partial product of a.b, add in carry c, and add total to d (Constant Time)
+	@param a multiplier
+	@param b multiplicand
+	@param c carry
+	@param d pointer to accumulated bottom half of result
+	@return top half of result
+ */
+
+
+extern int step1(BIG,BIG,BIG);
+extern void step2(BIG,BIG,BIG);
+
+#ifdef dchunk
+
+/* Method required to calculate x*y+c+r, bottom half in r, top half returned */
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    dchunk prod = (dchunk)x * y + c + *r;
+    *r = (chunk)prod & BMASK_B288_60;
+    return (chunk)(prod >> BASEBITS_B288_60);
+}
+
+#else
+
+/* No integer type available that can store double the wordlength */
+/* accumulate partial products */
+
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    chunk x0, x1, y0, y1;
+    chunk bot, top, mid, carry;
+    x0 = x & HMASK_B288_60;
+    x1 = (x >> HBITS_B288_60);
+    y0 = y & HMASK_B288_60;
+    y1 = (y >> HBITS_B288_60);
+    bot = x0 * y0;
+    top = x1 * y1;
+    mid = x0 * y1 + x1 * y0;
+    x0 = mid & HMASK_B288_60;
+    x1 = (mid >> HBITS_B288_60);
+    bot += x0 << HBITS_B288_60;
+    bot += *r;
+    bot += c;
+
+    top += x1;
+    carry = bot >> BASEBITS_B288_60;
+    bot &= BMASK_B288_60;
+    top += carry;
+
+    *r = bot;
+    return top;
+}
+
+#endif
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/big_B336_60.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/big_B336_60.h
new file mode 100644
index 0000000..1072096
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/big_B336_60.h
@@ -0,0 +1,697 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file big.h
+ * @author Mike Scott
+ * @date 23rd February 2016
+ * @brief Big number Header File
+ *
+ *
+ */
+
+#ifndef BIG_B336_60_H
+#define BIG_B336_60_H
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <inttypes.h>
+#include "arch.h"
+#include "core.h"
+#include "config_big_B336_60.h"
+
+using namespace core;
+
+/* could comment this out if code size is a major issue */
+#define UNWOUND
+/* Normally recommended, but may not be optimal for some architectures, for example 32-bit ARM M4 */
+#define USE_KARATSUBA
+
+#define BIGBITS_B336_60 (8*MODBYTES_B336_60)
+#define NLEN_B336_60 (1+((8*MODBYTES_B336_60-1)/BASEBITS_B336_60))
+#define DNLEN_B336_60 2*NLEN_B336_60
+#define BMASK_B336_60 (((chunk)1<<BASEBITS_B336_60)-1) /**< Mask = 2^BASEBITS-1 */
+#define NEXCESS_B336_60 (1<<(CHUNK-BASEBITS_B336_60-1))           /**< 2^(CHUNK-BASEBITS-1) - digit cannot be multiplied by more than this before normalisation */
+
+#define HBITS_B336_60 (BASEBITS_B336_60/2)      /**< Number of bits in number base divided by 2 */
+#define HMASK_B336_60 (((chunk)1<<HBITS_B336_60)-1)    /**< Mask = 2^HBITS-1 */
+
+//#define DEBUG_NORM
+
+#ifdef DEBUG_NORM  /* Add an extra location to track chunk extension */
+#define MPV_B336_60 NLEN_B336_60
+#define MNV_B336_60 (NLEN_B336_60+1)
+#define DMPV_B336_60 DNLEN_B336_60
+#define DMNV_B336_60 (DNLEN_B336_60+1)
+
+#endif
+
+namespace B336_60 {
+
+//extern int BIGMULS;
+//extern int BIGSQRS;
+
+#ifdef DEBUG_NORM
+typedef chunk BIG[NLEN_B336_60 + 2]; /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B336_60 + 2]; /**< Define type DBIG as array of chunks */
+#else
+typedef chunk BIG[NLEN_B336_60];     /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B336_60];   /**< Define type DBIG as array of chunks */
+#endif
+
+/* BIG number prototypes */
+
+/**	@brief Tests for BIG equal to zero (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_iszilch(BIG x);
+/**	@brief Tests for BIG equal to one (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if one, else returns 0
+ */
+extern int BIG_isunity(BIG x);
+/**	@brief Tests for DBIG equal to zero (Constant Time)
+ *
+	@param x a DBIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_diszilch(DBIG x);
+/**	@brief Outputs a BIG number to the console (Variable Time)
+ *
+	@param x a BIG number
+ */
+extern void BIG_output(BIG x);
+/**	@brief Outputs a BIG number to the console in raw form (Variable Time for debugging)
+ *
+	@param x a BIG number
+ */
+extern void BIG_rawoutput(BIG x);
+/**	@brief Conditional constant time swap of two BIG numbers
+ *
+	Conditionally swaps parameters in constant time (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s swap takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cswap(BIG x, BIG y, int s);
+/**	@brief Conditional copy of BIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cmove(BIG x, BIG y, int s);
+/**	@brief Conditional copy of DBIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a DBIG number
+	@param y another DBIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_dcmove(BIG x, BIG y, int s);
+/**	@brief Convert from BIG number to byte array (Constant Time)
+ *
+	@param a byte array
+	@param x BIG number
+ */
+extern void BIG_toBytes(char *a, BIG x);
+/**	@brief Convert to BIG number from byte array (Constant Time)
+ *
+	@param x BIG number
+	@param a byte array
+ */
+extern void BIG_fromBytes(BIG x, char *a);
+/**	@brief Convert to BIG number from byte array of given length (Variable Time)
+ *
+	@param x BIG number
+	@param a byte array
+	@param s byte array length
+ */
+extern void BIG_fromBytesLen(BIG x, char *a, int s);
+/**@brief Convert to DBIG number from byte array of given length (Variable Time)
+ *
+   @param x DBIG number
+   @param a byte array
+   @param s byte array length
+ */
+extern void BIG_dfromBytesLen(DBIG x, char *a, int s);
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_doutput(DBIG x); 
+
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_drawoutput(DBIG x);
+
+/**	@brief Copy BIG from Read-Only Memory to a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number in ROM
+ */
+extern void BIG_rcopy(BIG x, const BIG y);
+/**	@brief Copy BIG to another BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_copy(BIG x, BIG y);
+/**	@brief Copy DBIG to another DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_dcopy(DBIG x, DBIG y);
+/**	@brief Copy BIG to upper half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dsucopy(DBIG x, BIG y);
+/**	@brief Copy BIG to lower half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dscopy(DBIG x, BIG y);
+/**	@brief Copy lower half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sdcopy(BIG x, DBIG y);
+/**	@brief Copy upper half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sducopy(BIG x, DBIG y);
+/**	@brief Set BIG to zero (Constant Time)
+ *
+	@param x BIG number to be set to zero  
+ */
+extern void BIG_zero(BIG x);
+/**	@brief Set DBIG to zero (Constant Time)
+ *
+	@param x DBIG number to be set to zero
+ */
+extern void BIG_dzero(DBIG x);
+/**	@brief Set BIG to one (unity) (Constant Time)
+ *
+	@param x BIG number to be set to one.
+ */
+extern void BIG_one(BIG x);
+/**	@brief Set BIG to inverse mod 2^256 (Constant Time)
+ *
+	@param x BIG number to be inverted
+ */
+extern void BIG_invmod2m(BIG x);
+/**	@brief Set BIG to sum of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, sum of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_add(BIG x, BIG y, BIG z);
+
+/**	@brief Set BIG to logical or of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, or of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_or(BIG x, BIG y, BIG z);
+
+/**	@brief Increment BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be incremented
+	@param i integer
+ */
+extern void BIG_inc(BIG x, int i);
+/**	@brief Set BIG to difference of two BIGs (Constant Time)
+ *
+	@param x BIG number, difference of other two - output not normalised
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_sub(BIG x, BIG y, BIG z);
+/**	@brief Decrement BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be decremented
+	@param i integer
+ */
+extern void BIG_dec(BIG x, int i);
+/**	@brief Set DBIG to sum of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, sum of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dadd(DBIG x, DBIG y, DBIG z);
+/**	@brief Set DBIG to difference of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, difference of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dsub(DBIG x, DBIG y, DBIG z);
+/**	@brief Multiply BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_imul(BIG x, BIG y, int i);
+/**	@brief Multiply BIG by not-so-small small integer - output normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+	@return Overflowing bits
+ */
+extern chunk BIG_pmul(BIG x, BIG y, int i);
+/**	@brief Divide BIG by 3 - output normalised (Constant Time)
+ *
+	@param x BIG number
+	@return Remainder
+ */
+extern int BIG_div3(BIG x);
+/**	@brief Multiply BIG by even bigger small integer resulting in a DBIG - output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_pxmul(DBIG x, BIG y, int i);
+/**	@brief Multiply BIG by another BIG resulting in DBIG - inputs normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_mul(DBIG x, BIG y, BIG z);
+/**	@brief Multiply BIG by another BIG resulting in another BIG - inputs normalised and output normalised (Constant Time)
+ *
+	Note that the product must fit into a BIG, and x must be distinct from y and z
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_smul(BIG x, BIG y, BIG z);
+/**	@brief Square BIG resulting in a DBIG - input normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, square of a BIG
+	@param y BIG number to be squared
+ */
+extern void BIG_sqr(DBIG x, BIG y);
+
+/**	@brief Montgomery reduction of a DBIG to a BIG  - input normalised and output normalised (Constant Time)
+ *
+	@param a BIG number, reduction of a BIG
+	@param md BIG number, the modulus
+	@param MC the Montgomery Constant
+	@param d DBIG number to be reduced
+ */
+extern void BIG_monty(BIG a, BIG md, chunk MC, DBIG d);
+
+/**	@brief Shifts a BIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shl(BIG x, int s);
+/**	@brief Fast shifts a BIG left by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Overflow bits
+ */
+extern int BIG_fshl(BIG x, int s);
+/**	@brief Shifts a DBIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshl(DBIG x, int s);
+/**	@brief Shifts a BIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shr(BIG x, int s);
+
+
+/**	@brief Fast time-critical combined shift by 1 bit, subtract and normalise (Constant Time)
+ *
+	@param r BIG number normalised output
+	@param a BIG number to be subtracted from
+	@param m BIG number to be shifted and subtracted
+	@return sign of r
+ */
+extern int BIG_ssn(BIG r, BIG a, BIG m);
+
+/**	@brief Fast shifts a BIG right by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Shifted out bits
+ */
+extern int BIG_fshr(BIG x, int s);
+/**	@brief Shifts a DBIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshr(DBIG x, int s);
+/**	@brief Splits a DBIG into two BIGs - input must be normalised, outputs normalised (Constant Time as used)
+ *
+	Internal function. The value of s must be approximately in the middle of the DBIG.
+	Typically used to extract z mod 2^MODBITS and z/2^MODBITS
+	@param x BIG number, top half of z
+	@param y BIG number, bottom half of z
+	@param z DBIG number to be split in two.
+	@param s Bit position at which to split
+	@return carry-out from top half
+ */
+extern chunk BIG_split(BIG x, BIG y, DBIG z, int s);
+/**	@brief Normalizes a BIG number - output normalised (Constant Time)
+ *
+	All digits of the input BIG are reduced mod 2^BASEBITS
+	@param x BIG number to be normalised
+ */
+extern chunk BIG_norm(BIG x);
+/**	@brief Normalizes a DBIG number - output normalised (Constant Time)
+ *
+	All digits of the input DBIG are reduced mod 2^BASEBITS
+	@param x DBIG number to be normalised
+ */
+extern void BIG_dnorm(DBIG x);
+/**	@brief Compares two BIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first BIG number to be compared
+	@param y second BIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_comp(BIG x, BIG y);
+/**	@brief Compares two DBIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first DBIG number to be compared
+	@param y second DBIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_dcomp(DBIG x, DBIG y);
+/**	@brief Calculate number of bits in a BIG - output normalised (Variable Time)
+ *
+	@param x BIG number
+	@return Number of bits in x
+ */
+extern int BIG_nbits(BIG x);
+/**	@brief Calculate number of bits in a DBIG - output normalised (Variable Time)
+ *
+	@param x DBIG number
+	@return Number of bits in x
+ */
+extern int BIG_dnbits(DBIG x);
+
+/**	@brief Reduce x mod n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctmod(BIG x, BIG n, int bd);
+
+/**	@brief  x=y mod n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctdmod(BIG x, DBIG y, BIG n, int bd);
+
+/**	@brief Divide x by n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctsdiv(BIG x,BIG n,int bd);
+
+/**	@brief  x=y/n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctddiv(BIG x, DBIG y, BIG n,int bd);
+
+
+/**	@brief Reduce x mod n - input and output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+ */
+extern void BIG_mod(BIG x, BIG n);
+/**	@brief Divide x by n - output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+ */
+extern void BIG_sdiv(BIG x, BIG n);
+/**	@brief  x=y mod n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_dmod(BIG x, DBIG y, BIG n);
+/**	@brief  x=y/n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_ddiv(BIG x, DBIG y, BIG n);
+/**	@brief  return parity of BIG, that is the least significant bit (Constant Time)
+ *
+	@param x BIG number
+	@return 0 or 1
+ */
+extern int BIG_parity(BIG x);
+/**	@brief  return i-th of BIG (Constant Time)
+ *
+	@param x BIG number
+	@param i the bit of x to be returned
+	@return 0 or 1
+ */
+extern int BIG_bit(BIG x, int i);
+/**	@brief  return least significant bits of a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param n number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int BIG_lastbits(BIG x, int n);
+/**	@brief  Create a random BIG from a random number generator (Constant Time)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_random(BIG x, csprng *r);
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randomnum(BIG x, BIG n, csprng *r);
+
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus and truncated to max bit length (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param t Maximum bit length
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randtrunc(BIG x, BIG n, int t, csprng *r);
+
+/**	brief  return NAF (Non-Adjacent-Form) value as +/- 1, 3 or 5, inputs must be normalised
+ *
+	Given x and 3*x extracts NAF value from given bit position, and returns number of bits processed, and number of trailing zeros detected if any
+	param x BIG number
+	param x3 BIG number, three times x
+	param i bit position
+	param nbs pointer to integer returning number of bits processed
+	param nzs pointer to integer returning number of trailing 0s
+	return + or - 1, 3 or 5
+*/
+
+/**	@brief  Calculate x=y*z mod n (Variable Time)
+ *
+	Slow method for modular multiplication
+	@param x BIG number, on exit = y*z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modmul(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y/z mod n (Variable Time)
+ *
+	Slow method for modular division
+	@param x BIG number, on exit = y/z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_moddiv(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y^2 mod n (Variable Time)
+ *
+	Slow method for modular squaring
+	@param x BIG number, on exit = y^2 mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modsqr(BIG x, BIG y, BIG n);
+/**	@brief  Calculate x=-y mod n (Variable Time)
+ *
+	Modular negation
+	@param x BIG number, on exit = -y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modneg(BIG x, BIG y, BIG n);
+
+/**	@brief  Calculate x=y+z mod n (Variable Time)
+ *
+	Slow method for modular addition
+	@param x BIG number, on exit = y+z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modadd(BIG x, BIG y, BIG z, BIG n);
+
+/**	@brief  Calculate jacobi Symbol (x/y) (Variable Time)
+ *
+	@param x BIG number
+	@param y BIG number
+	@return Jacobi symbol, -1,0 or 1
+ */
+extern int BIG_jacobi(BIG x, BIG y);
+/**	@brief  Calculate x=1/y mod n (Variable Time)
+ *
+	Modular Inversion - This is slow. Uses binary method.
+	@param x BIG number, on exit = 1/y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_invmodp(BIG x, BIG y, BIG n);
+/** @brief Calculate x=x mod 2^m (Variable Time)
+ *
+	Truncation
+	@param x BIG number, on reduced mod 2^m
+	@param m new truncated size
+*/
+extern void BIG_mod2m(BIG x, int m);
+
+/**	@brief Calculates a*b+c+*d
+ *
+	Calculate partial product of a.b, add in carry c, and add total to d (Constant Time)
+	@param a multiplier
+	@param b multiplicand
+	@param c carry
+	@param d pointer to accumulated bottom half of result
+	@return top half of result
+ */
+
+
+extern int step1(BIG,BIG,BIG);
+extern void step2(BIG,BIG,BIG);
+
+#ifdef dchunk
+
+/* Method required to calculate x*y+c+r, bottom half in r, top half returned */
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    dchunk prod = (dchunk)x * y + c + *r;
+    *r = (chunk)prod & BMASK_B336_60;
+    return (chunk)(prod >> BASEBITS_B336_60);
+}
+
+#else
+
+/* No integer type available that can store double the wordlength */
+/* accumulate partial products */
+
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    chunk x0, x1, y0, y1;
+    chunk bot, top, mid, carry;
+    x0 = x & HMASK_B336_60;
+    x1 = (x >> HBITS_B336_60);
+    y0 = y & HMASK_B336_60;
+    y1 = (y >> HBITS_B336_60);
+    bot = x0 * y0;
+    top = x1 * y1;
+    mid = x0 * y1 + x1 * y0;
+    x0 = mid & HMASK_B336_60;
+    x1 = (mid >> HBITS_B336_60);
+    bot += x0 << HBITS_B336_60;
+    bot += *r;
+    bot += c;
+
+    top += x1;
+    carry = bot >> BASEBITS_B336_60;
+    bot &= BMASK_B336_60;
+    top += carry;
+
+    *r = bot;
+    return top;
+}
+
+#endif
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/big_B384_56.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/big_B384_56.h
new file mode 100644
index 0000000..c160c76
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/big_B384_56.h
@@ -0,0 +1,697 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file big.h
+ * @author Mike Scott
+ * @date 23rd February 2016
+ * @brief Big number Header File
+ *
+ *
+ */
+
+#ifndef BIG_B384_56_H
+#define BIG_B384_56_H
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <inttypes.h>
+#include "arch.h"
+#include "core.h"
+#include "config_big_B384_56.h"
+
+using namespace core;
+
+/* could comment this out if code size is a major issue */
+#define UNWOUND
+/* Normally recommended, but may not be optimal for some architectures, for example 32-bit ARM M4 */
+#define USE_KARATSUBA
+
+#define BIGBITS_B384_56 (8*MODBYTES_B384_56)
+#define NLEN_B384_56 (1+((8*MODBYTES_B384_56-1)/BASEBITS_B384_56))
+#define DNLEN_B384_56 2*NLEN_B384_56
+#define BMASK_B384_56 (((chunk)1<<BASEBITS_B384_56)-1) /**< Mask = 2^BASEBITS-1 */
+#define NEXCESS_B384_56 (1<<(CHUNK-BASEBITS_B384_56-1))           /**< 2^(CHUNK-BASEBITS-1) - digit cannot be multiplied by more than this before normalisation */
+
+#define HBITS_B384_56 (BASEBITS_B384_56/2)      /**< Number of bits in number base divided by 2 */
+#define HMASK_B384_56 (((chunk)1<<HBITS_B384_56)-1)    /**< Mask = 2^HBITS-1 */
+
+//#define DEBUG_NORM
+
+#ifdef DEBUG_NORM  /* Add an extra location to track chunk extension */
+#define MPV_B384_56 NLEN_B384_56
+#define MNV_B384_56 (NLEN_B384_56+1)
+#define DMPV_B384_56 DNLEN_B384_56
+#define DMNV_B384_56 (DNLEN_B384_56+1)
+
+#endif
+
+namespace B384_56 {
+
+//extern int BIGMULS;
+//extern int BIGSQRS;
+
+#ifdef DEBUG_NORM
+typedef chunk BIG[NLEN_B384_56 + 2]; /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B384_56 + 2]; /**< Define type DBIG as array of chunks */
+#else
+typedef chunk BIG[NLEN_B384_56];     /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B384_56];   /**< Define type DBIG as array of chunks */
+#endif
+
+/* BIG number prototypes */
+
+/**	@brief Tests for BIG equal to zero (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_iszilch(BIG x);
+/**	@brief Tests for BIG equal to one (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if one, else returns 0
+ */
+extern int BIG_isunity(BIG x);
+/**	@brief Tests for DBIG equal to zero (Constant Time)
+ *
+	@param x a DBIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_diszilch(DBIG x);
+/**	@brief Outputs a BIG number to the console (Variable Time)
+ *
+	@param x a BIG number
+ */
+extern void BIG_output(BIG x);
+/**	@brief Outputs a BIG number to the console in raw form (Variable Time for debugging)
+ *
+	@param x a BIG number
+ */
+extern void BIG_rawoutput(BIG x);
+/**	@brief Conditional constant time swap of two BIG numbers
+ *
+	Conditionally swaps parameters in constant time (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s swap takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cswap(BIG x, BIG y, int s);
+/**	@brief Conditional copy of BIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cmove(BIG x, BIG y, int s);
+/**	@brief Conditional copy of DBIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a DBIG number
+	@param y another DBIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_dcmove(BIG x, BIG y, int s);
+/**	@brief Convert from BIG number to byte array (Constant Time)
+ *
+	@param a byte array
+	@param x BIG number
+ */
+extern void BIG_toBytes(char *a, BIG x);
+/**	@brief Convert to BIG number from byte array (Constant Time)
+ *
+	@param x BIG number
+	@param a byte array
+ */
+extern void BIG_fromBytes(BIG x, char *a);
+/**	@brief Convert to BIG number from byte array of given length (Variable Time)
+ *
+	@param x BIG number
+	@param a byte array
+	@param s byte array length
+ */
+extern void BIG_fromBytesLen(BIG x, char *a, int s);
+/**@brief Convert to DBIG number from byte array of given length (Variable Time)
+ *
+   @param x DBIG number
+   @param a byte array
+   @param s byte array length
+ */
+extern void BIG_dfromBytesLen(DBIG x, char *a, int s);
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_doutput(DBIG x); 
+
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_drawoutput(DBIG x);
+
+/**	@brief Copy BIG from Read-Only Memory to a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number in ROM
+ */
+extern void BIG_rcopy(BIG x, const BIG y);
+/**	@brief Copy BIG to another BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_copy(BIG x, BIG y);
+/**	@brief Copy DBIG to another DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_dcopy(DBIG x, DBIG y);
+/**	@brief Copy BIG to upper half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dsucopy(DBIG x, BIG y);
+/**	@brief Copy BIG to lower half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dscopy(DBIG x, BIG y);
+/**	@brief Copy lower half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sdcopy(BIG x, DBIG y);
+/**	@brief Copy upper half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sducopy(BIG x, DBIG y);
+/**	@brief Set BIG to zero (Constant Time)
+ *
+	@param x BIG number to be set to zero  
+ */
+extern void BIG_zero(BIG x);
+/**	@brief Set DBIG to zero (Constant Time)
+ *
+	@param x DBIG number to be set to zero
+ */
+extern void BIG_dzero(DBIG x);
+/**	@brief Set BIG to one (unity) (Constant Time)
+ *
+	@param x BIG number to be set to one.
+ */
+extern void BIG_one(BIG x);
+/**	@brief Set BIG to inverse mod 2^256 (Constant Time)
+ *
+	@param x BIG number to be inverted
+ */
+extern void BIG_invmod2m(BIG x);
+/**	@brief Set BIG to sum of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, sum of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_add(BIG x, BIG y, BIG z);
+
+/**	@brief Set BIG to logical or of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, or of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_or(BIG x, BIG y, BIG z);
+
+/**	@brief Increment BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be incremented
+	@param i integer
+ */
+extern void BIG_inc(BIG x, int i);
+/**	@brief Set BIG to difference of two BIGs (Constant Time)
+ *
+	@param x BIG number, difference of other two - output not normalised
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_sub(BIG x, BIG y, BIG z);
+/**	@brief Decrement BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be decremented
+	@param i integer
+ */
+extern void BIG_dec(BIG x, int i);
+/**	@brief Set DBIG to sum of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, sum of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dadd(DBIG x, DBIG y, DBIG z);
+/**	@brief Set DBIG to difference of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, difference of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dsub(DBIG x, DBIG y, DBIG z);
+/**	@brief Multiply BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_imul(BIG x, BIG y, int i);
+/**	@brief Multiply BIG by not-so-small small integer - output normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+	@return Overflowing bits
+ */
+extern chunk BIG_pmul(BIG x, BIG y, int i);
+/**	@brief Divide BIG by 3 - output normalised (Constant Time)
+ *
+	@param x BIG number
+	@return Remainder
+ */
+extern int BIG_div3(BIG x);
+/**	@brief Multiply BIG by even bigger small integer resulting in a DBIG - output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_pxmul(DBIG x, BIG y, int i);
+/**	@brief Multiply BIG by another BIG resulting in DBIG - inputs normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_mul(DBIG x, BIG y, BIG z);
+/**	@brief Multiply BIG by another BIG resulting in another BIG - inputs normalised and output normalised (Constant Time)
+ *
+	Note that the product must fit into a BIG, and x must be distinct from y and z
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_smul(BIG x, BIG y, BIG z);
+/**	@brief Square BIG resulting in a DBIG - input normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, square of a BIG
+	@param y BIG number to be squared
+ */
+extern void BIG_sqr(DBIG x, BIG y);
+
+/**	@brief Montgomery reduction of a DBIG to a BIG  - input normalised and output normalised (Constant Time)
+ *
+	@param a BIG number, reduction of a BIG
+	@param md BIG number, the modulus
+	@param MC the Montgomery Constant
+	@param d DBIG number to be reduced
+ */
+extern void BIG_monty(BIG a, BIG md, chunk MC, DBIG d);
+
+/**	@brief Shifts a BIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shl(BIG x, int s);
+/**	@brief Fast shifts a BIG left by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Overflow bits
+ */
+extern int BIG_fshl(BIG x, int s);
+/**	@brief Shifts a DBIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshl(DBIG x, int s);
+/**	@brief Shifts a BIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shr(BIG x, int s);
+
+
+/**	@brief Fast time-critical combined shift by 1 bit, subtract and normalise (Constant Time)
+ *
+	@param r BIG number normalised output
+	@param a BIG number to be subtracted from
+	@param m BIG number to be shifted and subtracted
+	@return sign of r
+ */
+extern int BIG_ssn(BIG r, BIG a, BIG m);
+
+/**	@brief Fast shifts a BIG right by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Shifted out bits
+ */
+extern int BIG_fshr(BIG x, int s);
+/**	@brief Shifts a DBIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshr(DBIG x, int s);
+/**	@brief Splits a DBIG into two BIGs - input must be normalised, outputs normalised (Constant Time as used)
+ *
+	Internal function. The value of s must be approximately in the middle of the DBIG.
+	Typically used to extract z mod 2^MODBITS and z/2^MODBITS
+	@param x BIG number, top half of z
+	@param y BIG number, bottom half of z
+	@param z DBIG number to be split in two.
+	@param s Bit position at which to split
+	@return carry-out from top half
+ */
+extern chunk BIG_split(BIG x, BIG y, DBIG z, int s);
+/**	@brief Normalizes a BIG number - output normalised (Constant Time)
+ *
+	All digits of the input BIG are reduced mod 2^BASEBITS
+	@param x BIG number to be normalised
+ */
+extern chunk BIG_norm(BIG x);
+/**	@brief Normalizes a DBIG number - output normalised (Constant Time)
+ *
+	All digits of the input DBIG are reduced mod 2^BASEBITS
+	@param x DBIG number to be normalised
+ */
+extern void BIG_dnorm(DBIG x);
+/**	@brief Compares two BIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first BIG number to be compared
+	@param y second BIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_comp(BIG x, BIG y);
+/**	@brief Compares two DBIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first DBIG number to be compared
+	@param y second DBIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_dcomp(DBIG x, DBIG y);
+/**	@brief Calculate number of bits in a BIG - output normalised (Variable Time)
+ *
+	@param x BIG number
+	@return Number of bits in x
+ */
+extern int BIG_nbits(BIG x);
+/**	@brief Calculate number of bits in a DBIG - output normalised (Variable Time)
+ *
+	@param x DBIG number
+	@return Number of bits in x
+ */
+extern int BIG_dnbits(DBIG x);
+
+/**	@brief Reduce x mod n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctmod(BIG x, BIG n, int bd);
+
+/**	@brief  x=y mod n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctdmod(BIG x, DBIG y, BIG n, int bd);
+
+/**	@brief Divide x by n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctsdiv(BIG x,BIG n,int bd);
+
+/**	@brief  x=y/n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctddiv(BIG x, DBIG y, BIG n,int bd);
+
+
+/**	@brief Reduce x mod n - input and output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+ */
+extern void BIG_mod(BIG x, BIG n);
+/**	@brief Divide x by n - output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+ */
+extern void BIG_sdiv(BIG x, BIG n);
+/**	@brief  x=y mod n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_dmod(BIG x, DBIG y, BIG n);
+/**	@brief  x=y/n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_ddiv(BIG x, DBIG y, BIG n);
+/**	@brief  return parity of BIG, that is the least significant bit (Constant Time)
+ *
+	@param x BIG number
+	@return 0 or 1
+ */
+extern int BIG_parity(BIG x);
+/**	@brief  return i-th of BIG (Constant Time)
+ *
+	@param x BIG number
+	@param i the bit of x to be returned
+	@return 0 or 1
+ */
+extern int BIG_bit(BIG x, int i);
+/**	@brief  return least significant bits of a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param n number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int BIG_lastbits(BIG x, int n);
+/**	@brief  Create a random BIG from a random number generator (Constant Time)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_random(BIG x, csprng *r);
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randomnum(BIG x, BIG n, csprng *r);
+
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus and truncated to max bit length (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param t Maximum bit length
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randtrunc(BIG x, BIG n, int t, csprng *r);
+
+/**	brief  return NAF (Non-Adjacent-Form) value as +/- 1, 3 or 5, inputs must be normalised
+ *
+	Given x and 3*x extracts NAF value from given bit position, and returns number of bits processed, and number of trailing zeros detected if any
+	param x BIG number
+	param x3 BIG number, three times x
+	param i bit position
+	param nbs pointer to integer returning number of bits processed
+	param nzs pointer to integer returning number of trailing 0s
+	return + or - 1, 3 or 5
+*/
+
+/**	@brief  Calculate x=y*z mod n (Variable Time)
+ *
+	Slow method for modular multiplication
+	@param x BIG number, on exit = y*z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modmul(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y/z mod n (Variable Time)
+ *
+	Slow method for modular division
+	@param x BIG number, on exit = y/z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_moddiv(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y^2 mod n (Variable Time)
+ *
+	Slow method for modular squaring
+	@param x BIG number, on exit = y^2 mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modsqr(BIG x, BIG y, BIG n);
+/**	@brief  Calculate x=-y mod n (Variable Time)
+ *
+	Modular negation
+	@param x BIG number, on exit = -y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modneg(BIG x, BIG y, BIG n);
+
+/**	@brief  Calculate x=y+z mod n (Variable Time)
+ *
+	Slow method for modular addition
+	@param x BIG number, on exit = y+z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modadd(BIG x, BIG y, BIG z, BIG n);
+
+/**	@brief  Calculate jacobi Symbol (x/y) (Variable Time)
+ *
+	@param x BIG number
+	@param y BIG number
+	@return Jacobi symbol, -1,0 or 1
+ */
+extern int BIG_jacobi(BIG x, BIG y);
+/**	@brief  Calculate x=1/y mod n (Variable Time)
+ *
+	Modular Inversion - This is slow. Uses binary method.
+	@param x BIG number, on exit = 1/y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_invmodp(BIG x, BIG y, BIG n);
+/** @brief Calculate x=x mod 2^m (Variable Time)
+ *
+	Truncation
+	@param x BIG number, on reduced mod 2^m
+	@param m new truncated size
+*/
+extern void BIG_mod2m(BIG x, int m);
+
+/**	@brief Calculates a*b+c+*d
+ *
+	Calculate partial product of a.b, add in carry c, and add total to d (Constant Time)
+	@param a multiplier
+	@param b multiplicand
+	@param c carry
+	@param d pointer to accumulated bottom half of result
+	@return top half of result
+ */
+
+
+extern int step1(BIG,BIG,BIG);
+extern void step2(BIG,BIG,BIG);
+
+#ifdef dchunk
+
+/* Method required to calculate x*y+c+r, bottom half in r, top half returned */
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    dchunk prod = (dchunk)x * y + c + *r;
+    *r = (chunk)prod & BMASK_B384_56;
+    return (chunk)(prod >> BASEBITS_B384_56);
+}
+
+#else
+
+/* No integer type available that can store double the wordlength */
+/* accumulate partial products */
+
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    chunk x0, x1, y0, y1;
+    chunk bot, top, mid, carry;
+    x0 = x & HMASK_B384_56;
+    x1 = (x >> HBITS_B384_56);
+    y0 = y & HMASK_B384_56;
+    y1 = (y >> HBITS_B384_56);
+    bot = x0 * y0;
+    top = x1 * y1;
+    mid = x0 * y1 + x1 * y0;
+    x0 = mid & HMASK_B384_56;
+    x1 = (mid >> HBITS_B384_56);
+    bot += x0 << HBITS_B384_56;
+    bot += *r;
+    bot += c;
+
+    top += x1;
+    carry = bot >> BASEBITS_B384_56;
+    bot &= BMASK_B384_56;
+    top += carry;
+
+    *r = bot;
+    return top;
+}
+
+#endif
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/big_B384_58.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/big_B384_58.h
new file mode 100644
index 0000000..4eda3e5
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/big_B384_58.h
@@ -0,0 +1,697 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file big.h
+ * @author Mike Scott
+ * @date 23rd February 2016
+ * @brief Big number Header File
+ *
+ *
+ */
+
+#ifndef BIG_B384_58_H
+#define BIG_B384_58_H
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <inttypes.h>
+#include "arch.h"
+#include "core.h"
+#include "config_big_B384_58.h"
+
+using namespace core;
+
+/* could comment this out if code size is a major issue */
+#define UNWOUND
+/* Normally recommended, but may not be optimal for some architectures, for example 32-bit ARM M4 */
+#define USE_KARATSUBA
+
+#define BIGBITS_B384_58 (8*MODBYTES_B384_58)
+#define NLEN_B384_58 (1+((8*MODBYTES_B384_58-1)/BASEBITS_B384_58))
+#define DNLEN_B384_58 2*NLEN_B384_58
+#define BMASK_B384_58 (((chunk)1<<BASEBITS_B384_58)-1) /**< Mask = 2^BASEBITS-1 */
+#define NEXCESS_B384_58 (1<<(CHUNK-BASEBITS_B384_58-1))           /**< 2^(CHUNK-BASEBITS-1) - digit cannot be multiplied by more than this before normalisation */
+
+#define HBITS_B384_58 (BASEBITS_B384_58/2)      /**< Number of bits in number base divided by 2 */
+#define HMASK_B384_58 (((chunk)1<<HBITS_B384_58)-1)    /**< Mask = 2^HBITS-1 */
+
+//#define DEBUG_NORM
+
+#ifdef DEBUG_NORM  /* Add an extra location to track chunk extension */
+#define MPV_B384_58 NLEN_B384_58
+#define MNV_B384_58 (NLEN_B384_58+1)
+#define DMPV_B384_58 DNLEN_B384_58
+#define DMNV_B384_58 (DNLEN_B384_58+1)
+
+#endif
+
+namespace B384_58 {
+
+//extern int BIGMULS;
+//extern int BIGSQRS;
+
+#ifdef DEBUG_NORM
+typedef chunk BIG[NLEN_B384_58 + 2]; /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B384_58 + 2]; /**< Define type DBIG as array of chunks */
+#else
+typedef chunk BIG[NLEN_B384_58];     /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B384_58];   /**< Define type DBIG as array of chunks */
+#endif
+
+/* BIG number prototypes */
+
+/**	@brief Tests for BIG equal to zero (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_iszilch(BIG x);
+/**	@brief Tests for BIG equal to one (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if one, else returns 0
+ */
+extern int BIG_isunity(BIG x);
+/**	@brief Tests for DBIG equal to zero (Constant Time)
+ *
+	@param x a DBIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_diszilch(DBIG x);
+/**	@brief Outputs a BIG number to the console (Variable Time)
+ *
+	@param x a BIG number
+ */
+extern void BIG_output(BIG x);
+/**	@brief Outputs a BIG number to the console in raw form (Variable Time for debugging)
+ *
+	@param x a BIG number
+ */
+extern void BIG_rawoutput(BIG x);
+/**	@brief Conditional constant time swap of two BIG numbers
+ *
+	Conditionally swaps parameters in constant time (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s swap takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cswap(BIG x, BIG y, int s);
+/**	@brief Conditional copy of BIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cmove(BIG x, BIG y, int s);
+/**	@brief Conditional copy of DBIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a DBIG number
+	@param y another DBIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_dcmove(BIG x, BIG y, int s);
+/**	@brief Convert from BIG number to byte array (Constant Time)
+ *
+	@param a byte array
+	@param x BIG number
+ */
+extern void BIG_toBytes(char *a, BIG x);
+/**	@brief Convert to BIG number from byte array (Constant Time)
+ *
+	@param x BIG number
+	@param a byte array
+ */
+extern void BIG_fromBytes(BIG x, char *a);
+/**	@brief Convert to BIG number from byte array of given length (Variable Time)
+ *
+	@param x BIG number
+	@param a byte array
+	@param s byte array length
+ */
+extern void BIG_fromBytesLen(BIG x, char *a, int s);
+/**@brief Convert to DBIG number from byte array of given length (Variable Time)
+ *
+   @param x DBIG number
+   @param a byte array
+   @param s byte array length
+ */
+extern void BIG_dfromBytesLen(DBIG x, char *a, int s);
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_doutput(DBIG x); 
+
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_drawoutput(DBIG x);
+
+/**	@brief Copy BIG from Read-Only Memory to a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number in ROM
+ */
+extern void BIG_rcopy(BIG x, const BIG y);
+/**	@brief Copy BIG to another BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_copy(BIG x, BIG y);
+/**	@brief Copy DBIG to another DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_dcopy(DBIG x, DBIG y);
+/**	@brief Copy BIG to upper half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dsucopy(DBIG x, BIG y);
+/**	@brief Copy BIG to lower half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dscopy(DBIG x, BIG y);
+/**	@brief Copy lower half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sdcopy(BIG x, DBIG y);
+/**	@brief Copy upper half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sducopy(BIG x, DBIG y);
+/**	@brief Set BIG to zero (Constant Time)
+ *
+	@param x BIG number to be set to zero  
+ */
+extern void BIG_zero(BIG x);
+/**	@brief Set DBIG to zero (Constant Time)
+ *
+	@param x DBIG number to be set to zero
+ */
+extern void BIG_dzero(DBIG x);
+/**	@brief Set BIG to one (unity) (Constant Time)
+ *
+	@param x BIG number to be set to one.
+ */
+extern void BIG_one(BIG x);
+/**	@brief Set BIG to inverse mod 2^256 (Constant Time)
+ *
+	@param x BIG number to be inverted
+ */
+extern void BIG_invmod2m(BIG x);
+/**	@brief Set BIG to sum of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, sum of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_add(BIG x, BIG y, BIG z);
+
+/**	@brief Set BIG to logical or of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, or of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_or(BIG x, BIG y, BIG z);
+
+/**	@brief Increment BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be incremented
+	@param i integer
+ */
+extern void BIG_inc(BIG x, int i);
+/**	@brief Set BIG to difference of two BIGs (Constant Time)
+ *
+	@param x BIG number, difference of other two - output not normalised
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_sub(BIG x, BIG y, BIG z);
+/**	@brief Decrement BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be decremented
+	@param i integer
+ */
+extern void BIG_dec(BIG x, int i);
+/**	@brief Set DBIG to sum of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, sum of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dadd(DBIG x, DBIG y, DBIG z);
+/**	@brief Set DBIG to difference of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, difference of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dsub(DBIG x, DBIG y, DBIG z);
+/**	@brief Multiply BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_imul(BIG x, BIG y, int i);
+/**	@brief Multiply BIG by not-so-small small integer - output normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+	@return Overflowing bits
+ */
+extern chunk BIG_pmul(BIG x, BIG y, int i);
+/**	@brief Divide BIG by 3 - output normalised (Constant Time)
+ *
+	@param x BIG number
+	@return Remainder
+ */
+extern int BIG_div3(BIG x);
+/**	@brief Multiply BIG by even bigger small integer resulting in a DBIG - output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_pxmul(DBIG x, BIG y, int i);
+/**	@brief Multiply BIG by another BIG resulting in DBIG - inputs normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_mul(DBIG x, BIG y, BIG z);
+/**	@brief Multiply BIG by another BIG resulting in another BIG - inputs normalised and output normalised (Constant Time)
+ *
+	Note that the product must fit into a BIG, and x must be distinct from y and z
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_smul(BIG x, BIG y, BIG z);
+/**	@brief Square BIG resulting in a DBIG - input normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, square of a BIG
+	@param y BIG number to be squared
+ */
+extern void BIG_sqr(DBIG x, BIG y);
+
+/**	@brief Montgomery reduction of a DBIG to a BIG  - input normalised and output normalised (Constant Time)
+ *
+	@param a BIG number, reduction of a BIG
+	@param md BIG number, the modulus
+	@param MC the Montgomery Constant
+	@param d DBIG number to be reduced
+ */
+extern void BIG_monty(BIG a, BIG md, chunk MC, DBIG d);
+
+/**	@brief Shifts a BIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shl(BIG x, int s);
+/**	@brief Fast shifts a BIG left by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Overflow bits
+ */
+extern int BIG_fshl(BIG x, int s);
+/**	@brief Shifts a DBIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshl(DBIG x, int s);
+/**	@brief Shifts a BIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shr(BIG x, int s);
+
+
+/**	@brief Fast time-critical combined shift by 1 bit, subtract and normalise (Constant Time)
+ *
+	@param r BIG number normalised output
+	@param a BIG number to be subtracted from
+	@param m BIG number to be shifted and subtracted
+	@return sign of r
+ */
+extern int BIG_ssn(BIG r, BIG a, BIG m);
+
+/**	@brief Fast shifts a BIG right by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Shifted out bits
+ */
+extern int BIG_fshr(BIG x, int s);
+/**	@brief Shifts a DBIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshr(DBIG x, int s);
+/**	@brief Splits a DBIG into two BIGs - input must be normalised, outputs normalised (Constant Time as used)
+ *
+	Internal function. The value of s must be approximately in the middle of the DBIG.
+	Typically used to extract z mod 2^MODBITS and z/2^MODBITS
+	@param x BIG number, top half of z
+	@param y BIG number, bottom half of z
+	@param z DBIG number to be split in two.
+	@param s Bit position at which to split
+	@return carry-out from top half
+ */
+extern chunk BIG_split(BIG x, BIG y, DBIG z, int s);
+/**	@brief Normalizes a BIG number - output normalised (Constant Time)
+ *
+	All digits of the input BIG are reduced mod 2^BASEBITS
+	@param x BIG number to be normalised
+ */
+extern chunk BIG_norm(BIG x);
+/**	@brief Normalizes a DBIG number - output normalised (Constant Time)
+ *
+	All digits of the input DBIG are reduced mod 2^BASEBITS
+	@param x DBIG number to be normalised
+ */
+extern void BIG_dnorm(DBIG x);
+/**	@brief Compares two BIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first BIG number to be compared
+	@param y second BIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_comp(BIG x, BIG y);
+/**	@brief Compares two DBIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first DBIG number to be compared
+	@param y second DBIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_dcomp(DBIG x, DBIG y);
+/**	@brief Calculate number of bits in a BIG - output normalised (Variable Time)
+ *
+	@param x BIG number
+	@return Number of bits in x
+ */
+extern int BIG_nbits(BIG x);
+/**	@brief Calculate number of bits in a DBIG - output normalised (Variable Time)
+ *
+	@param x DBIG number
+	@return Number of bits in x
+ */
+extern int BIG_dnbits(DBIG x);
+
+/**	@brief Reduce x mod n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctmod(BIG x, BIG n, int bd);
+
+/**	@brief  x=y mod n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctdmod(BIG x, DBIG y, BIG n, int bd);
+
+/**	@brief Divide x by n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctsdiv(BIG x,BIG n,int bd);
+
+/**	@brief  x=y/n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctddiv(BIG x, DBIG y, BIG n,int bd);
+
+
+/**	@brief Reduce x mod n - input and output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+ */
+extern void BIG_mod(BIG x, BIG n);
+/**	@brief Divide x by n - output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+ */
+extern void BIG_sdiv(BIG x, BIG n);
+/**	@brief  x=y mod n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_dmod(BIG x, DBIG y, BIG n);
+/**	@brief  x=y/n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_ddiv(BIG x, DBIG y, BIG n);
+/**	@brief  return parity of BIG, that is the least significant bit (Constant Time)
+ *
+	@param x BIG number
+	@return 0 or 1
+ */
+extern int BIG_parity(BIG x);
+/**	@brief  return i-th of BIG (Constant Time)
+ *
+	@param x BIG number
+	@param i the bit of x to be returned
+	@return 0 or 1
+ */
+extern int BIG_bit(BIG x, int i);
+/**	@brief  return least significant bits of a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param n number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int BIG_lastbits(BIG x, int n);
+/**	@brief  Create a random BIG from a random number generator (Constant Time)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_random(BIG x, csprng *r);
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randomnum(BIG x, BIG n, csprng *r);
+
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus and truncated to max bit length (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param t Maximum bit length
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randtrunc(BIG x, BIG n, int t, csprng *r);
+
+/**	brief  return NAF (Non-Adjacent-Form) value as +/- 1, 3 or 5, inputs must be normalised
+ *
+	Given x and 3*x extracts NAF value from given bit position, and returns number of bits processed, and number of trailing zeros detected if any
+	param x BIG number
+	param x3 BIG number, three times x
+	param i bit position
+	param nbs pointer to integer returning number of bits processed
+	param nzs pointer to integer returning number of trailing 0s
+	return + or - 1, 3 or 5
+*/
+
+/**	@brief  Calculate x=y*z mod n (Variable Time)
+ *
+	Slow method for modular multiplication
+	@param x BIG number, on exit = y*z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modmul(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y/z mod n (Variable Time)
+ *
+	Slow method for modular division
+	@param x BIG number, on exit = y/z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_moddiv(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y^2 mod n (Variable Time)
+ *
+	Slow method for modular squaring
+	@param x BIG number, on exit = y^2 mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modsqr(BIG x, BIG y, BIG n);
+/**	@brief  Calculate x=-y mod n (Variable Time)
+ *
+	Modular negation
+	@param x BIG number, on exit = -y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modneg(BIG x, BIG y, BIG n);
+
+/**	@brief  Calculate x=y+z mod n (Variable Time)
+ *
+	Slow method for modular addition
+	@param x BIG number, on exit = y+z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modadd(BIG x, BIG y, BIG z, BIG n);
+
+/**	@brief  Calculate jacobi Symbol (x/y) (Variable Time)
+ *
+	@param x BIG number
+	@param y BIG number
+	@return Jacobi symbol, -1,0 or 1
+ */
+extern int BIG_jacobi(BIG x, BIG y);
+/**	@brief  Calculate x=1/y mod n (Variable Time)
+ *
+	Modular Inversion - This is slow. Uses binary method.
+	@param x BIG number, on exit = 1/y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_invmodp(BIG x, BIG y, BIG n);
+/** @brief Calculate x=x mod 2^m (Variable Time)
+ *
+	Truncation
+	@param x BIG number, on reduced mod 2^m
+	@param m new truncated size
+*/
+extern void BIG_mod2m(BIG x, int m);
+
+/**	@brief Calculates a*b+c+*d
+ *
+	Calculate partial product of a.b, add in carry c, and add total to d (Constant Time)
+	@param a multiplier
+	@param b multiplicand
+	@param c carry
+	@param d pointer to accumulated bottom half of result
+	@return top half of result
+ */
+
+
+extern int step1(BIG,BIG,BIG);
+extern void step2(BIG,BIG,BIG);
+
+#ifdef dchunk
+
+/* Method required to calculate x*y+c+r, bottom half in r, top half returned */
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    dchunk prod = (dchunk)x * y + c + *r;
+    *r = (chunk)prod & BMASK_B384_58;
+    return (chunk)(prod >> BASEBITS_B384_58);
+}
+
+#else
+
+/* No integer type available that can store double the wordlength */
+/* accumulate partial products */
+
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    chunk x0, x1, y0, y1;
+    chunk bot, top, mid, carry;
+    x0 = x & HMASK_B384_58;
+    x1 = (x >> HBITS_B384_58);
+    y0 = y & HMASK_B384_58;
+    y1 = (y >> HBITS_B384_58);
+    bot = x0 * y0;
+    top = x1 * y1;
+    mid = x0 * y1 + x1 * y0;
+    x0 = mid & HMASK_B384_58;
+    x1 = (mid >> HBITS_B384_58);
+    bot += x0 << HBITS_B384_58;
+    bot += *r;
+    bot += c;
+
+    top += x1;
+    carry = bot >> BASEBITS_B384_58;
+    bot &= BMASK_B384_58;
+    top += carry;
+
+    *r = bot;
+    return top;
+}
+
+#endif
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/big_B416_60.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/big_B416_60.h
new file mode 100644
index 0000000..978bc98
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/big_B416_60.h
@@ -0,0 +1,697 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file big.h
+ * @author Mike Scott
+ * @date 23rd February 2016
+ * @brief Big number Header File
+ *
+ *
+ */
+
+#ifndef BIG_B416_60_H
+#define BIG_B416_60_H
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <inttypes.h>
+#include "arch.h"
+#include "core.h"
+#include "config_big_B416_60.h"
+
+using namespace core;
+
+/* could comment this out if code size is a major issue */
+#define UNWOUND
+/* Normally recommended, but may not be optimal for some architectures, for example 32-bit ARM M4 */
+#define USE_KARATSUBA
+
+#define BIGBITS_B416_60 (8*MODBYTES_B416_60)
+#define NLEN_B416_60 (1+((8*MODBYTES_B416_60-1)/BASEBITS_B416_60))
+#define DNLEN_B416_60 2*NLEN_B416_60
+#define BMASK_B416_60 (((chunk)1<<BASEBITS_B416_60)-1) /**< Mask = 2^BASEBITS-1 */
+#define NEXCESS_B416_60 (1<<(CHUNK-BASEBITS_B416_60-1))           /**< 2^(CHUNK-BASEBITS-1) - digit cannot be multiplied by more than this before normalisation */
+
+#define HBITS_B416_60 (BASEBITS_B416_60/2)      /**< Number of bits in number base divided by 2 */
+#define HMASK_B416_60 (((chunk)1<<HBITS_B416_60)-1)    /**< Mask = 2^HBITS-1 */
+
+//#define DEBUG_NORM
+
+#ifdef DEBUG_NORM  /* Add an extra location to track chunk extension */
+#define MPV_B416_60 NLEN_B416_60
+#define MNV_B416_60 (NLEN_B416_60+1)
+#define DMPV_B416_60 DNLEN_B416_60
+#define DMNV_B416_60 (DNLEN_B416_60+1)
+
+#endif
+
+namespace B416_60 {
+
+//extern int BIGMULS;
+//extern int BIGSQRS;
+
+#ifdef DEBUG_NORM
+typedef chunk BIG[NLEN_B416_60 + 2]; /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B416_60 + 2]; /**< Define type DBIG as array of chunks */
+#else
+typedef chunk BIG[NLEN_B416_60];     /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B416_60];   /**< Define type DBIG as array of chunks */
+#endif
+
+/* BIG number prototypes */
+
+/**	@brief Tests for BIG equal to zero (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_iszilch(BIG x);
+/**	@brief Tests for BIG equal to one (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if one, else returns 0
+ */
+extern int BIG_isunity(BIG x);
+/**	@brief Tests for DBIG equal to zero (Constant Time)
+ *
+	@param x a DBIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_diszilch(DBIG x);
+/**	@brief Outputs a BIG number to the console (Variable Time)
+ *
+	@param x a BIG number
+ */
+extern void BIG_output(BIG x);
+/**	@brief Outputs a BIG number to the console in raw form (Variable Time for debugging)
+ *
+	@param x a BIG number
+ */
+extern void BIG_rawoutput(BIG x);
+/**	@brief Conditional constant time swap of two BIG numbers
+ *
+	Conditionally swaps parameters in constant time (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s swap takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cswap(BIG x, BIG y, int s);
+/**	@brief Conditional copy of BIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cmove(BIG x, BIG y, int s);
+/**	@brief Conditional copy of DBIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a DBIG number
+	@param y another DBIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_dcmove(BIG x, BIG y, int s);
+/**	@brief Convert from BIG number to byte array (Constant Time)
+ *
+	@param a byte array
+	@param x BIG number
+ */
+extern void BIG_toBytes(char *a, BIG x);
+/**	@brief Convert to BIG number from byte array (Constant Time)
+ *
+	@param x BIG number
+	@param a byte array
+ */
+extern void BIG_fromBytes(BIG x, char *a);
+/**	@brief Convert to BIG number from byte array of given length (Variable Time)
+ *
+	@param x BIG number
+	@param a byte array
+	@param s byte array length
+ */
+extern void BIG_fromBytesLen(BIG x, char *a, int s);
+/**@brief Convert to DBIG number from byte array of given length (Variable Time)
+ *
+   @param x DBIG number
+   @param a byte array
+   @param s byte array length
+ */
+extern void BIG_dfromBytesLen(DBIG x, char *a, int s);
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_doutput(DBIG x); 
+
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_drawoutput(DBIG x);
+
+/**	@brief Copy BIG from Read-Only Memory to a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number in ROM
+ */
+extern void BIG_rcopy(BIG x, const BIG y);
+/**	@brief Copy BIG to another BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_copy(BIG x, BIG y);
+/**	@brief Copy DBIG to another DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_dcopy(DBIG x, DBIG y);
+/**	@brief Copy BIG to upper half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dsucopy(DBIG x, BIG y);
+/**	@brief Copy BIG to lower half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dscopy(DBIG x, BIG y);
+/**	@brief Copy lower half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sdcopy(BIG x, DBIG y);
+/**	@brief Copy upper half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sducopy(BIG x, DBIG y);
+/**	@brief Set BIG to zero (Constant Time)
+ *
+	@param x BIG number to be set to zero  
+ */
+extern void BIG_zero(BIG x);
+/**	@brief Set DBIG to zero (Constant Time)
+ *
+	@param x DBIG number to be set to zero
+ */
+extern void BIG_dzero(DBIG x);
+/**	@brief Set BIG to one (unity) (Constant Time)
+ *
+	@param x BIG number to be set to one.
+ */
+extern void BIG_one(BIG x);
+/**	@brief Set BIG to inverse mod 2^256 (Constant Time)
+ *
+	@param x BIG number to be inverted
+ */
+extern void BIG_invmod2m(BIG x);
+/**	@brief Set BIG to sum of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, sum of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_add(BIG x, BIG y, BIG z);
+
+/**	@brief Set BIG to logical or of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, or of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_or(BIG x, BIG y, BIG z);
+
+/**	@brief Increment BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be incremented
+	@param i integer
+ */
+extern void BIG_inc(BIG x, int i);
+/**	@brief Set BIG to difference of two BIGs (Constant Time)
+ *
+	@param x BIG number, difference of other two - output not normalised
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_sub(BIG x, BIG y, BIG z);
+/**	@brief Decrement BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be decremented
+	@param i integer
+ */
+extern void BIG_dec(BIG x, int i);
+/**	@brief Set DBIG to sum of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, sum of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dadd(DBIG x, DBIG y, DBIG z);
+/**	@brief Set DBIG to difference of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, difference of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dsub(DBIG x, DBIG y, DBIG z);
+/**	@brief Multiply BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_imul(BIG x, BIG y, int i);
+/**	@brief Multiply BIG by not-so-small small integer - output normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+	@return Overflowing bits
+ */
+extern chunk BIG_pmul(BIG x, BIG y, int i);
+/**	@brief Divide BIG by 3 - output normalised (Constant Time)
+ *
+	@param x BIG number
+	@return Remainder
+ */
+extern int BIG_div3(BIG x);
+/**	@brief Multiply BIG by even bigger small integer resulting in a DBIG - output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_pxmul(DBIG x, BIG y, int i);
+/**	@brief Multiply BIG by another BIG resulting in DBIG - inputs normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_mul(DBIG x, BIG y, BIG z);
+/**	@brief Multiply BIG by another BIG resulting in another BIG - inputs normalised and output normalised (Constant Time)
+ *
+	Note that the product must fit into a BIG, and x must be distinct from y and z
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_smul(BIG x, BIG y, BIG z);
+/**	@brief Square BIG resulting in a DBIG - input normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, square of a BIG
+	@param y BIG number to be squared
+ */
+extern void BIG_sqr(DBIG x, BIG y);
+
+/**	@brief Montgomery reduction of a DBIG to a BIG  - input normalised and output normalised (Constant Time)
+ *
+	@param a BIG number, reduction of a BIG
+	@param md BIG number, the modulus
+	@param MC the Montgomery Constant
+	@param d DBIG number to be reduced
+ */
+extern void BIG_monty(BIG a, BIG md, chunk MC, DBIG d);
+
+/**	@brief Shifts a BIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shl(BIG x, int s);
+/**	@brief Fast shifts a BIG left by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Overflow bits
+ */
+extern int BIG_fshl(BIG x, int s);
+/**	@brief Shifts a DBIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshl(DBIG x, int s);
+/**	@brief Shifts a BIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shr(BIG x, int s);
+
+
+/**	@brief Fast time-critical combined shift by 1 bit, subtract and normalise (Constant Time)
+ *
+	@param r BIG number normalised output
+	@param a BIG number to be subtracted from
+	@param m BIG number to be shifted and subtracted
+	@return sign of r
+ */
+extern int BIG_ssn(BIG r, BIG a, BIG m);
+
+/**	@brief Fast shifts a BIG right by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Shifted out bits
+ */
+extern int BIG_fshr(BIG x, int s);
+/**	@brief Shifts a DBIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshr(DBIG x, int s);
+/**	@brief Splits a DBIG into two BIGs - input must be normalised, outputs normalised (Constant Time as used)
+ *
+	Internal function. The value of s must be approximately in the middle of the DBIG.
+	Typically used to extract z mod 2^MODBITS and z/2^MODBITS
+	@param x BIG number, top half of z
+	@param y BIG number, bottom half of z
+	@param z DBIG number to be split in two.
+	@param s Bit position at which to split
+	@return carry-out from top half
+ */
+extern chunk BIG_split(BIG x, BIG y, DBIG z, int s);
+/**	@brief Normalizes a BIG number - output normalised (Constant Time)
+ *
+	All digits of the input BIG are reduced mod 2^BASEBITS
+	@param x BIG number to be normalised
+ */
+extern chunk BIG_norm(BIG x);
+/**	@brief Normalizes a DBIG number - output normalised (Constant Time)
+ *
+	All digits of the input DBIG are reduced mod 2^BASEBITS
+	@param x DBIG number to be normalised
+ */
+extern void BIG_dnorm(DBIG x);
+/**	@brief Compares two BIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first BIG number to be compared
+	@param y second BIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_comp(BIG x, BIG y);
+/**	@brief Compares two DBIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first DBIG number to be compared
+	@param y second DBIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_dcomp(DBIG x, DBIG y);
+/**	@brief Calculate number of bits in a BIG - output normalised (Variable Time)
+ *
+	@param x BIG number
+	@return Number of bits in x
+ */
+extern int BIG_nbits(BIG x);
+/**	@brief Calculate number of bits in a DBIG - output normalised (Variable Time)
+ *
+	@param x DBIG number
+	@return Number of bits in x
+ */
+extern int BIG_dnbits(DBIG x);
+
+/**	@brief Reduce x mod n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctmod(BIG x, BIG n, int bd);
+
+/**	@brief  x=y mod n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctdmod(BIG x, DBIG y, BIG n, int bd);
+
+/**	@brief Divide x by n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctsdiv(BIG x,BIG n,int bd);
+
+/**	@brief  x=y/n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctddiv(BIG x, DBIG y, BIG n,int bd);
+
+
+/**	@brief Reduce x mod n - input and output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+ */
+extern void BIG_mod(BIG x, BIG n);
+/**	@brief Divide x by n - output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+ */
+extern void BIG_sdiv(BIG x, BIG n);
+/**	@brief  x=y mod n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_dmod(BIG x, DBIG y, BIG n);
+/**	@brief  x=y/n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_ddiv(BIG x, DBIG y, BIG n);
+/**	@brief  return parity of BIG, that is the least significant bit (Constant Time)
+ *
+	@param x BIG number
+	@return 0 or 1
+ */
+extern int BIG_parity(BIG x);
+/**	@brief  return i-th of BIG (Constant Time)
+ *
+	@param x BIG number
+	@param i the bit of x to be returned
+	@return 0 or 1
+ */
+extern int BIG_bit(BIG x, int i);
+/**	@brief  return least significant bits of a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param n number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int BIG_lastbits(BIG x, int n);
+/**	@brief  Create a random BIG from a random number generator (Constant Time)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_random(BIG x, csprng *r);
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randomnum(BIG x, BIG n, csprng *r);
+
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus and truncated to max bit length (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param t Maximum bit length
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randtrunc(BIG x, BIG n, int t, csprng *r);
+
+/**	brief  return NAF (Non-Adjacent-Form) value as +/- 1, 3 or 5, inputs must be normalised
+ *
+	Given x and 3*x extracts NAF value from given bit position, and returns number of bits processed, and number of trailing zeros detected if any
+	param x BIG number
+	param x3 BIG number, three times x
+	param i bit position
+	param nbs pointer to integer returning number of bits processed
+	param nzs pointer to integer returning number of trailing 0s
+	return + or - 1, 3 or 5
+*/
+
+/**	@brief  Calculate x=y*z mod n (Variable Time)
+ *
+	Slow method for modular multiplication
+	@param x BIG number, on exit = y*z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modmul(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y/z mod n (Variable Time)
+ *
+	Slow method for modular division
+	@param x BIG number, on exit = y/z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_moddiv(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y^2 mod n (Variable Time)
+ *
+	Slow method for modular squaring
+	@param x BIG number, on exit = y^2 mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modsqr(BIG x, BIG y, BIG n);
+/**	@brief  Calculate x=-y mod n (Variable Time)
+ *
+	Modular negation
+	@param x BIG number, on exit = -y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modneg(BIG x, BIG y, BIG n);
+
+/**	@brief  Calculate x=y+z mod n (Variable Time)
+ *
+	Slow method for modular addition
+	@param x BIG number, on exit = y+z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modadd(BIG x, BIG y, BIG z, BIG n);
+
+/**	@brief  Calculate jacobi Symbol (x/y) (Variable Time)
+ *
+	@param x BIG number
+	@param y BIG number
+	@return Jacobi symbol, -1,0 or 1
+ */
+extern int BIG_jacobi(BIG x, BIG y);
+/**	@brief  Calculate x=1/y mod n (Variable Time)
+ *
+	Modular Inversion - This is slow. Uses binary method.
+	@param x BIG number, on exit = 1/y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_invmodp(BIG x, BIG y, BIG n);
+/** @brief Calculate x=x mod 2^m (Variable Time)
+ *
+	Truncation
+	@param x BIG number, on reduced mod 2^m
+	@param m new truncated size
+*/
+extern void BIG_mod2m(BIG x, int m);
+
+/**	@brief Calculates a*b+c+*d
+ *
+	Calculate partial product of a.b, add in carry c, and add total to d (Constant Time)
+	@param a multiplier
+	@param b multiplicand
+	@param c carry
+	@param d pointer to accumulated bottom half of result
+	@return top half of result
+ */
+
+
+extern int step1(BIG,BIG,BIG);
+extern void step2(BIG,BIG,BIG);
+
+#ifdef dchunk
+
+/* Method required to calculate x*y+c+r, bottom half in r, top half returned */
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    dchunk prod = (dchunk)x * y + c + *r;
+    *r = (chunk)prod & BMASK_B416_60;
+    return (chunk)(prod >> BASEBITS_B416_60);
+}
+
+#else
+
+/* No integer type available that can store double the wordlength */
+/* accumulate partial products */
+
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    chunk x0, x1, y0, y1;
+    chunk bot, top, mid, carry;
+    x0 = x & HMASK_B416_60;
+    x1 = (x >> HBITS_B416_60);
+    y0 = y & HMASK_B416_60;
+    y1 = (y >> HBITS_B416_60);
+    bot = x0 * y0;
+    top = x1 * y1;
+    mid = x0 * y1 + x1 * y0;
+    x0 = mid & HMASK_B416_60;
+    x1 = (mid >> HBITS_B416_60);
+    bot += x0 << HBITS_B416_60;
+    bot += *r;
+    bot += c;
+
+    top += x1;
+    carry = bot >> BASEBITS_B416_60;
+    bot &= BMASK_B416_60;
+    top += carry;
+
+    *r = bot;
+    return top;
+}
+
+#endif
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/big_B448_58.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/big_B448_58.h
new file mode 100644
index 0000000..8aa26f1
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/big_B448_58.h
@@ -0,0 +1,697 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file big.h
+ * @author Mike Scott
+ * @date 23rd February 2016
+ * @brief Big number Header File
+ *
+ *
+ */
+
+#ifndef BIG_B448_58_H
+#define BIG_B448_58_H
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <inttypes.h>
+#include "arch.h"
+#include "core.h"
+#include "config_big_B448_58.h"
+
+using namespace core;
+
+/* could comment this out if code size is a major issue */
+#define UNWOUND
+/* Normally recommended, but may not be optimal for some architectures, for example 32-bit ARM M4 */
+#define USE_KARATSUBA
+
+#define BIGBITS_B448_58 (8*MODBYTES_B448_58)
+#define NLEN_B448_58 (1+((8*MODBYTES_B448_58-1)/BASEBITS_B448_58))
+#define DNLEN_B448_58 2*NLEN_B448_58
+#define BMASK_B448_58 (((chunk)1<<BASEBITS_B448_58)-1) /**< Mask = 2^BASEBITS-1 */
+#define NEXCESS_B448_58 (1<<(CHUNK-BASEBITS_B448_58-1))           /**< 2^(CHUNK-BASEBITS-1) - digit cannot be multiplied by more than this before normalisation */
+
+#define HBITS_B448_58 (BASEBITS_B448_58/2)      /**< Number of bits in number base divided by 2 */
+#define HMASK_B448_58 (((chunk)1<<HBITS_B448_58)-1)    /**< Mask = 2^HBITS-1 */
+
+//#define DEBUG_NORM
+
+#ifdef DEBUG_NORM  /* Add an extra location to track chunk extension */
+#define MPV_B448_58 NLEN_B448_58
+#define MNV_B448_58 (NLEN_B448_58+1)
+#define DMPV_B448_58 DNLEN_B448_58
+#define DMNV_B448_58 (DNLEN_B448_58+1)
+
+#endif
+
+namespace B448_58 {
+
+//extern int BIGMULS;
+//extern int BIGSQRS;
+
+#ifdef DEBUG_NORM
+typedef chunk BIG[NLEN_B448_58 + 2]; /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B448_58 + 2]; /**< Define type DBIG as array of chunks */
+#else
+typedef chunk BIG[NLEN_B448_58];     /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B448_58];   /**< Define type DBIG as array of chunks */
+#endif
+
+/* BIG number prototypes */
+
+/**	@brief Tests for BIG equal to zero (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_iszilch(BIG x);
+/**	@brief Tests for BIG equal to one (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if one, else returns 0
+ */
+extern int BIG_isunity(BIG x);
+/**	@brief Tests for DBIG equal to zero (Constant Time)
+ *
+	@param x a DBIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_diszilch(DBIG x);
+/**	@brief Outputs a BIG number to the console (Variable Time)
+ *
+	@param x a BIG number
+ */
+extern void BIG_output(BIG x);
+/**	@brief Outputs a BIG number to the console in raw form (Variable Time for debugging)
+ *
+	@param x a BIG number
+ */
+extern void BIG_rawoutput(BIG x);
+/**	@brief Conditional constant time swap of two BIG numbers
+ *
+	Conditionally swaps parameters in constant time (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s swap takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cswap(BIG x, BIG y, int s);
+/**	@brief Conditional copy of BIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cmove(BIG x, BIG y, int s);
+/**	@brief Conditional copy of DBIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a DBIG number
+	@param y another DBIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_dcmove(BIG x, BIG y, int s);
+/**	@brief Convert from BIG number to byte array (Constant Time)
+ *
+	@param a byte array
+	@param x BIG number
+ */
+extern void BIG_toBytes(char *a, BIG x);
+/**	@brief Convert to BIG number from byte array (Constant Time)
+ *
+	@param x BIG number
+	@param a byte array
+ */
+extern void BIG_fromBytes(BIG x, char *a);
+/**	@brief Convert to BIG number from byte array of given length (Variable Time)
+ *
+	@param x BIG number
+	@param a byte array
+	@param s byte array length
+ */
+extern void BIG_fromBytesLen(BIG x, char *a, int s);
+/**@brief Convert to DBIG number from byte array of given length (Variable Time)
+ *
+   @param x DBIG number
+   @param a byte array
+   @param s byte array length
+ */
+extern void BIG_dfromBytesLen(DBIG x, char *a, int s);
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_doutput(DBIG x); 
+
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_drawoutput(DBIG x);
+
+/**	@brief Copy BIG from Read-Only Memory to a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number in ROM
+ */
+extern void BIG_rcopy(BIG x, const BIG y);
+/**	@brief Copy BIG to another BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_copy(BIG x, BIG y);
+/**	@brief Copy DBIG to another DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_dcopy(DBIG x, DBIG y);
+/**	@brief Copy BIG to upper half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dsucopy(DBIG x, BIG y);
+/**	@brief Copy BIG to lower half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dscopy(DBIG x, BIG y);
+/**	@brief Copy lower half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sdcopy(BIG x, DBIG y);
+/**	@brief Copy upper half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sducopy(BIG x, DBIG y);
+/**	@brief Set BIG to zero (Constant Time)
+ *
+	@param x BIG number to be set to zero  
+ */
+extern void BIG_zero(BIG x);
+/**	@brief Set DBIG to zero (Constant Time)
+ *
+	@param x DBIG number to be set to zero
+ */
+extern void BIG_dzero(DBIG x);
+/**	@brief Set BIG to one (unity) (Constant Time)
+ *
+	@param x BIG number to be set to one.
+ */
+extern void BIG_one(BIG x);
+/**	@brief Set BIG to inverse mod 2^256 (Constant Time)
+ *
+	@param x BIG number to be inverted
+ */
+extern void BIG_invmod2m(BIG x);
+/**	@brief Set BIG to sum of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, sum of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_add(BIG x, BIG y, BIG z);
+
+/**	@brief Set BIG to logical or of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, or of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_or(BIG x, BIG y, BIG z);
+
+/**	@brief Increment BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be incremented
+	@param i integer
+ */
+extern void BIG_inc(BIG x, int i);
+/**	@brief Set BIG to difference of two BIGs (Constant Time)
+ *
+	@param x BIG number, difference of other two - output not normalised
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_sub(BIG x, BIG y, BIG z);
+/**	@brief Decrement BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be decremented
+	@param i integer
+ */
+extern void BIG_dec(BIG x, int i);
+/**	@brief Set DBIG to sum of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, sum of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dadd(DBIG x, DBIG y, DBIG z);
+/**	@brief Set DBIG to difference of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, difference of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dsub(DBIG x, DBIG y, DBIG z);
+/**	@brief Multiply BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_imul(BIG x, BIG y, int i);
+/**	@brief Multiply BIG by not-so-small small integer - output normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+	@return Overflowing bits
+ */
+extern chunk BIG_pmul(BIG x, BIG y, int i);
+/**	@brief Divide BIG by 3 - output normalised (Constant Time)
+ *
+	@param x BIG number
+	@return Remainder
+ */
+extern int BIG_div3(BIG x);
+/**	@brief Multiply BIG by even bigger small integer resulting in a DBIG - output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_pxmul(DBIG x, BIG y, int i);
+/**	@brief Multiply BIG by another BIG resulting in DBIG - inputs normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_mul(DBIG x, BIG y, BIG z);
+/**	@brief Multiply BIG by another BIG resulting in another BIG - inputs normalised and output normalised (Constant Time)
+ *
+	Note that the product must fit into a BIG, and x must be distinct from y and z
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_smul(BIG x, BIG y, BIG z);
+/**	@brief Square BIG resulting in a DBIG - input normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, square of a BIG
+	@param y BIG number to be squared
+ */
+extern void BIG_sqr(DBIG x, BIG y);
+
+/**	@brief Montgomery reduction of a DBIG to a BIG  - input normalised and output normalised (Constant Time)
+ *
+	@param a BIG number, reduction of a BIG
+	@param md BIG number, the modulus
+	@param MC the Montgomery Constant
+	@param d DBIG number to be reduced
+ */
+extern void BIG_monty(BIG a, BIG md, chunk MC, DBIG d);
+
+/**	@brief Shifts a BIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shl(BIG x, int s);
+/**	@brief Fast shifts a BIG left by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Overflow bits
+ */
+extern int BIG_fshl(BIG x, int s);
+/**	@brief Shifts a DBIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshl(DBIG x, int s);
+/**	@brief Shifts a BIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shr(BIG x, int s);
+
+
+/**	@brief Fast time-critical combined shift by 1 bit, subtract and normalise (Constant Time)
+ *
+	@param r BIG number normalised output
+	@param a BIG number to be subtracted from
+	@param m BIG number to be shifted and subtracted
+	@return sign of r
+ */
+extern int BIG_ssn(BIG r, BIG a, BIG m);
+
+/**	@brief Fast shifts a BIG right by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Shifted out bits
+ */
+extern int BIG_fshr(BIG x, int s);
+/**	@brief Shifts a DBIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshr(DBIG x, int s);
+/**	@brief Splits a DBIG into two BIGs - input must be normalised, outputs normalised (Constant Time as used)
+ *
+	Internal function. The value of s must be approximately in the middle of the DBIG.
+	Typically used to extract z mod 2^MODBITS and z/2^MODBITS
+	@param x BIG number, top half of z
+	@param y BIG number, bottom half of z
+	@param z DBIG number to be split in two.
+	@param s Bit position at which to split
+	@return carry-out from top half
+ */
+extern chunk BIG_split(BIG x, BIG y, DBIG z, int s);
+/**	@brief Normalizes a BIG number - output normalised (Constant Time)
+ *
+	All digits of the input BIG are reduced mod 2^BASEBITS
+	@param x BIG number to be normalised
+ */
+extern chunk BIG_norm(BIG x);
+/**	@brief Normalizes a DBIG number - output normalised (Constant Time)
+ *
+	All digits of the input DBIG are reduced mod 2^BASEBITS
+	@param x DBIG number to be normalised
+ */
+extern void BIG_dnorm(DBIG x);
+/**	@brief Compares two BIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first BIG number to be compared
+	@param y second BIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_comp(BIG x, BIG y);
+/**	@brief Compares two DBIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first DBIG number to be compared
+	@param y second DBIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_dcomp(DBIG x, DBIG y);
+/**	@brief Calculate number of bits in a BIG - output normalised (Variable Time)
+ *
+	@param x BIG number
+	@return Number of bits in x
+ */
+extern int BIG_nbits(BIG x);
+/**	@brief Calculate number of bits in a DBIG - output normalised (Variable Time)
+ *
+	@param x DBIG number
+	@return Number of bits in x
+ */
+extern int BIG_dnbits(DBIG x);
+
+/**	@brief Reduce x mod n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctmod(BIG x, BIG n, int bd);
+
+/**	@brief  x=y mod n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctdmod(BIG x, DBIG y, BIG n, int bd);
+
+/**	@brief Divide x by n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctsdiv(BIG x,BIG n,int bd);
+
+/**	@brief  x=y/n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctddiv(BIG x, DBIG y, BIG n,int bd);
+
+
+/**	@brief Reduce x mod n - input and output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+ */
+extern void BIG_mod(BIG x, BIG n);
+/**	@brief Divide x by n - output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+ */
+extern void BIG_sdiv(BIG x, BIG n);
+/**	@brief  x=y mod n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_dmod(BIG x, DBIG y, BIG n);
+/**	@brief  x=y/n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_ddiv(BIG x, DBIG y, BIG n);
+/**	@brief  return parity of BIG, that is the least significant bit (Constant Time)
+ *
+	@param x BIG number
+	@return 0 or 1
+ */
+extern int BIG_parity(BIG x);
+/**	@brief  return i-th of BIG (Constant Time)
+ *
+	@param x BIG number
+	@param i the bit of x to be returned
+	@return 0 or 1
+ */
+extern int BIG_bit(BIG x, int i);
+/**	@brief  return least significant bits of a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param n number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int BIG_lastbits(BIG x, int n);
+/**	@brief  Create a random BIG from a random number generator (Constant Time)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_random(BIG x, csprng *r);
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randomnum(BIG x, BIG n, csprng *r);
+
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus and truncated to max bit length (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param t Maximum bit length
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randtrunc(BIG x, BIG n, int t, csprng *r);
+
+/**	brief  return NAF (Non-Adjacent-Form) value as +/- 1, 3 or 5, inputs must be normalised
+ *
+	Given x and 3*x extracts NAF value from given bit position, and returns number of bits processed, and number of trailing zeros detected if any
+	param x BIG number
+	param x3 BIG number, three times x
+	param i bit position
+	param nbs pointer to integer returning number of bits processed
+	param nzs pointer to integer returning number of trailing 0s
+	return + or - 1, 3 or 5
+*/
+
+/**	@brief  Calculate x=y*z mod n (Variable Time)
+ *
+	Slow method for modular multiplication
+	@param x BIG number, on exit = y*z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modmul(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y/z mod n (Variable Time)
+ *
+	Slow method for modular division
+	@param x BIG number, on exit = y/z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_moddiv(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y^2 mod n (Variable Time)
+ *
+	Slow method for modular squaring
+	@param x BIG number, on exit = y^2 mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modsqr(BIG x, BIG y, BIG n);
+/**	@brief  Calculate x=-y mod n (Variable Time)
+ *
+	Modular negation
+	@param x BIG number, on exit = -y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modneg(BIG x, BIG y, BIG n);
+
+/**	@brief  Calculate x=y+z mod n (Variable Time)
+ *
+	Slow method for modular addition
+	@param x BIG number, on exit = y+z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modadd(BIG x, BIG y, BIG z, BIG n);
+
+/**	@brief  Calculate jacobi Symbol (x/y) (Variable Time)
+ *
+	@param x BIG number
+	@param y BIG number
+	@return Jacobi symbol, -1,0 or 1
+ */
+extern int BIG_jacobi(BIG x, BIG y);
+/**	@brief  Calculate x=1/y mod n (Variable Time)
+ *
+	Modular Inversion - This is slow. Uses binary method.
+	@param x BIG number, on exit = 1/y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_invmodp(BIG x, BIG y, BIG n);
+/** @brief Calculate x=x mod 2^m (Variable Time)
+ *
+	Truncation
+	@param x BIG number, on reduced mod 2^m
+	@param m new truncated size
+*/
+extern void BIG_mod2m(BIG x, int m);
+
+/**	@brief Calculates a*b+c+*d
+ *
+	Calculate partial product of a.b, add in carry c, and add total to d (Constant Time)
+	@param a multiplier
+	@param b multiplicand
+	@param c carry
+	@param d pointer to accumulated bottom half of result
+	@return top half of result
+ */
+
+
+extern int step1(BIG,BIG,BIG);
+extern void step2(BIG,BIG,BIG);
+
+#ifdef dchunk
+
+/* Method required to calculate x*y+c+r, bottom half in r, top half returned */
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    dchunk prod = (dchunk)x * y + c + *r;
+    *r = (chunk)prod & BMASK_B448_58;
+    return (chunk)(prod >> BASEBITS_B448_58);
+}
+
+#else
+
+/* No integer type available that can store double the wordlength */
+/* accumulate partial products */
+
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    chunk x0, x1, y0, y1;
+    chunk bot, top, mid, carry;
+    x0 = x & HMASK_B448_58;
+    x1 = (x >> HBITS_B448_58);
+    y0 = y & HMASK_B448_58;
+    y1 = (y >> HBITS_B448_58);
+    bot = x0 * y0;
+    top = x1 * y1;
+    mid = x0 * y1 + x1 * y0;
+    x0 = mid & HMASK_B448_58;
+    x1 = (mid >> HBITS_B448_58);
+    bot += x0 << HBITS_B448_58;
+    bot += *r;
+    bot += c;
+
+    top += x1;
+    carry = bot >> BASEBITS_B448_58;
+    bot &= BMASK_B448_58;
+    top += carry;
+
+    *r = bot;
+    return top;
+}
+
+#endif
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/big_B448_60.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/big_B448_60.h
new file mode 100644
index 0000000..ce14891
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/big_B448_60.h
@@ -0,0 +1,697 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file big.h
+ * @author Mike Scott
+ * @date 23rd February 2016
+ * @brief Big number Header File
+ *
+ *
+ */
+
+#ifndef BIG_B448_60_H
+#define BIG_B448_60_H
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <inttypes.h>
+#include "arch.h"
+#include "core.h"
+#include "config_big_B448_60.h"
+
+using namespace core;
+
+/* could comment this out if code size is a major issue */
+#define UNWOUND
+/* Normally recommended, but may not be optimal for some architectures, for example 32-bit ARM M4 */
+#define USE_KARATSUBA
+
+#define BIGBITS_B448_60 (8*MODBYTES_B448_60)
+#define NLEN_B448_60 (1+((8*MODBYTES_B448_60-1)/BASEBITS_B448_60))
+#define DNLEN_B448_60 2*NLEN_B448_60
+#define BMASK_B448_60 (((chunk)1<<BASEBITS_B448_60)-1) /**< Mask = 2^BASEBITS-1 */
+#define NEXCESS_B448_60 (1<<(CHUNK-BASEBITS_B448_60-1))           /**< 2^(CHUNK-BASEBITS-1) - digit cannot be multiplied by more than this before normalisation */
+
+#define HBITS_B448_60 (BASEBITS_B448_60/2)      /**< Number of bits in number base divided by 2 */
+#define HMASK_B448_60 (((chunk)1<<HBITS_B448_60)-1)    /**< Mask = 2^HBITS-1 */
+
+//#define DEBUG_NORM
+
+#ifdef DEBUG_NORM  /* Add an extra location to track chunk extension */
+#define MPV_B448_60 NLEN_B448_60
+#define MNV_B448_60 (NLEN_B448_60+1)
+#define DMPV_B448_60 DNLEN_B448_60
+#define DMNV_B448_60 (DNLEN_B448_60+1)
+
+#endif
+
+namespace B448_60 {
+
+//extern int BIGMULS;
+//extern int BIGSQRS;
+
+#ifdef DEBUG_NORM
+typedef chunk BIG[NLEN_B448_60 + 2]; /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B448_60 + 2]; /**< Define type DBIG as array of chunks */
+#else
+typedef chunk BIG[NLEN_B448_60];     /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B448_60];   /**< Define type DBIG as array of chunks */
+#endif
+
+/* BIG number prototypes */
+
+/**	@brief Tests for BIG equal to zero (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_iszilch(BIG x);
+/**	@brief Tests for BIG equal to one (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if one, else returns 0
+ */
+extern int BIG_isunity(BIG x);
+/**	@brief Tests for DBIG equal to zero (Constant Time)
+ *
+	@param x a DBIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_diszilch(DBIG x);
+/**	@brief Outputs a BIG number to the console (Variable Time)
+ *
+	@param x a BIG number
+ */
+extern void BIG_output(BIG x);
+/**	@brief Outputs a BIG number to the console in raw form (Variable Time for debugging)
+ *
+	@param x a BIG number
+ */
+extern void BIG_rawoutput(BIG x);
+/**	@brief Conditional constant time swap of two BIG numbers
+ *
+	Conditionally swaps parameters in constant time (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s swap takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cswap(BIG x, BIG y, int s);
+/**	@brief Conditional copy of BIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cmove(BIG x, BIG y, int s);
+/**	@brief Conditional copy of DBIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a DBIG number
+	@param y another DBIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_dcmove(BIG x, BIG y, int s);
+/**	@brief Convert from BIG number to byte array (Constant Time)
+ *
+	@param a byte array
+	@param x BIG number
+ */
+extern void BIG_toBytes(char *a, BIG x);
+/**	@brief Convert to BIG number from byte array (Constant Time)
+ *
+	@param x BIG number
+	@param a byte array
+ */
+extern void BIG_fromBytes(BIG x, char *a);
+/**	@brief Convert to BIG number from byte array of given length (Variable Time)
+ *
+	@param x BIG number
+	@param a byte array
+	@param s byte array length
+ */
+extern void BIG_fromBytesLen(BIG x, char *a, int s);
+/**@brief Convert to DBIG number from byte array of given length (Variable Time)
+ *
+   @param x DBIG number
+   @param a byte array
+   @param s byte array length
+ */
+extern void BIG_dfromBytesLen(DBIG x, char *a, int s);
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_doutput(DBIG x); 
+
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_drawoutput(DBIG x);
+
+/**	@brief Copy BIG from Read-Only Memory to a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number in ROM
+ */
+extern void BIG_rcopy(BIG x, const BIG y);
+/**	@brief Copy BIG to another BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_copy(BIG x, BIG y);
+/**	@brief Copy DBIG to another DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_dcopy(DBIG x, DBIG y);
+/**	@brief Copy BIG to upper half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dsucopy(DBIG x, BIG y);
+/**	@brief Copy BIG to lower half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dscopy(DBIG x, BIG y);
+/**	@brief Copy lower half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sdcopy(BIG x, DBIG y);
+/**	@brief Copy upper half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sducopy(BIG x, DBIG y);
+/**	@brief Set BIG to zero (Constant Time)
+ *
+	@param x BIG number to be set to zero  
+ */
+extern void BIG_zero(BIG x);
+/**	@brief Set DBIG to zero (Constant Time)
+ *
+	@param x DBIG number to be set to zero
+ */
+extern void BIG_dzero(DBIG x);
+/**	@brief Set BIG to one (unity) (Constant Time)
+ *
+	@param x BIG number to be set to one.
+ */
+extern void BIG_one(BIG x);
+/**	@brief Set BIG to inverse mod 2^256 (Constant Time)
+ *
+	@param x BIG number to be inverted
+ */
+extern void BIG_invmod2m(BIG x);
+/**	@brief Set BIG to sum of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, sum of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_add(BIG x, BIG y, BIG z);
+
+/**	@brief Set BIG to logical or of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, or of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_or(BIG x, BIG y, BIG z);
+
+/**	@brief Increment BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be incremented
+	@param i integer
+ */
+extern void BIG_inc(BIG x, int i);
+/**	@brief Set BIG to difference of two BIGs (Constant Time)
+ *
+	@param x BIG number, difference of other two - output not normalised
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_sub(BIG x, BIG y, BIG z);
+/**	@brief Decrement BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be decremented
+	@param i integer
+ */
+extern void BIG_dec(BIG x, int i);
+/**	@brief Set DBIG to sum of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, sum of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dadd(DBIG x, DBIG y, DBIG z);
+/**	@brief Set DBIG to difference of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, difference of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dsub(DBIG x, DBIG y, DBIG z);
+/**	@brief Multiply BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_imul(BIG x, BIG y, int i);
+/**	@brief Multiply BIG by not-so-small small integer - output normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+	@return Overflowing bits
+ */
+extern chunk BIG_pmul(BIG x, BIG y, int i);
+/**	@brief Divide BIG by 3 - output normalised (Constant Time)
+ *
+	@param x BIG number
+	@return Remainder
+ */
+extern int BIG_div3(BIG x);
+/**	@brief Multiply BIG by even bigger small integer resulting in a DBIG - output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_pxmul(DBIG x, BIG y, int i);
+/**	@brief Multiply BIG by another BIG resulting in DBIG - inputs normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_mul(DBIG x, BIG y, BIG z);
+/**	@brief Multiply BIG by another BIG resulting in another BIG - inputs normalised and output normalised (Constant Time)
+ *
+	Note that the product must fit into a BIG, and x must be distinct from y and z
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_smul(BIG x, BIG y, BIG z);
+/**	@brief Square BIG resulting in a DBIG - input normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, square of a BIG
+	@param y BIG number to be squared
+ */
+extern void BIG_sqr(DBIG x, BIG y);
+
+/**	@brief Montgomery reduction of a DBIG to a BIG  - input normalised and output normalised (Constant Time)
+ *
+	@param a BIG number, reduction of a BIG
+	@param md BIG number, the modulus
+	@param MC the Montgomery Constant
+	@param d DBIG number to be reduced
+ */
+extern void BIG_monty(BIG a, BIG md, chunk MC, DBIG d);
+
+/**	@brief Shifts a BIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shl(BIG x, int s);
+/**	@brief Fast shifts a BIG left by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Overflow bits
+ */
+extern int BIG_fshl(BIG x, int s);
+/**	@brief Shifts a DBIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshl(DBIG x, int s);
+/**	@brief Shifts a BIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shr(BIG x, int s);
+
+
+/**	@brief Fast time-critical combined shift by 1 bit, subtract and normalise (Constant Time)
+ *
+	@param r BIG number normalised output
+	@param a BIG number to be subtracted from
+	@param m BIG number to be shifted and subtracted
+	@return sign of r
+ */
+extern int BIG_ssn(BIG r, BIG a, BIG m);
+
+/**	@brief Fast shifts a BIG right by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Shifted out bits
+ */
+extern int BIG_fshr(BIG x, int s);
+/**	@brief Shifts a DBIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshr(DBIG x, int s);
+/**	@brief Splits a DBIG into two BIGs - input must be normalised, outputs normalised (Constant Time as used)
+ *
+	Internal function. The value of s must be approximately in the middle of the DBIG.
+	Typically used to extract z mod 2^MODBITS and z/2^MODBITS
+	@param x BIG number, top half of z
+	@param y BIG number, bottom half of z
+	@param z DBIG number to be split in two.
+	@param s Bit position at which to split
+	@return carry-out from top half
+ */
+extern chunk BIG_split(BIG x, BIG y, DBIG z, int s);
+/**	@brief Normalizes a BIG number - output normalised (Constant Time)
+ *
+	All digits of the input BIG are reduced mod 2^BASEBITS
+	@param x BIG number to be normalised
+ */
+extern chunk BIG_norm(BIG x);
+/**	@brief Normalizes a DBIG number - output normalised (Constant Time)
+ *
+	All digits of the input DBIG are reduced mod 2^BASEBITS
+	@param x DBIG number to be normalised
+ */
+extern void BIG_dnorm(DBIG x);
+/**	@brief Compares two BIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first BIG number to be compared
+	@param y second BIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_comp(BIG x, BIG y);
+/**	@brief Compares two DBIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first DBIG number to be compared
+	@param y second DBIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_dcomp(DBIG x, DBIG y);
+/**	@brief Calculate number of bits in a BIG - output normalised (Variable Time)
+ *
+	@param x BIG number
+	@return Number of bits in x
+ */
+extern int BIG_nbits(BIG x);
+/**	@brief Calculate number of bits in a DBIG - output normalised (Variable Time)
+ *
+	@param x DBIG number
+	@return Number of bits in x
+ */
+extern int BIG_dnbits(DBIG x);
+
+/**	@brief Reduce x mod n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctmod(BIG x, BIG n, int bd);
+
+/**	@brief  x=y mod n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctdmod(BIG x, DBIG y, BIG n, int bd);
+
+/**	@brief Divide x by n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctsdiv(BIG x,BIG n,int bd);
+
+/**	@brief  x=y/n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctddiv(BIG x, DBIG y, BIG n,int bd);
+
+
+/**	@brief Reduce x mod n - input and output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+ */
+extern void BIG_mod(BIG x, BIG n);
+/**	@brief Divide x by n - output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+ */
+extern void BIG_sdiv(BIG x, BIG n);
+/**	@brief  x=y mod n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_dmod(BIG x, DBIG y, BIG n);
+/**	@brief  x=y/n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_ddiv(BIG x, DBIG y, BIG n);
+/**	@brief  return parity of BIG, that is the least significant bit (Constant Time)
+ *
+	@param x BIG number
+	@return 0 or 1
+ */
+extern int BIG_parity(BIG x);
+/**	@brief  return i-th of BIG (Constant Time)
+ *
+	@param x BIG number
+	@param i the bit of x to be returned
+	@return 0 or 1
+ */
+extern int BIG_bit(BIG x, int i);
+/**	@brief  return least significant bits of a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param n number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int BIG_lastbits(BIG x, int n);
+/**	@brief  Create a random BIG from a random number generator (Constant Time)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_random(BIG x, csprng *r);
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randomnum(BIG x, BIG n, csprng *r);
+
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus and truncated to max bit length (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param t Maximum bit length
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randtrunc(BIG x, BIG n, int t, csprng *r);
+
+/**	brief  return NAF (Non-Adjacent-Form) value as +/- 1, 3 or 5, inputs must be normalised
+ *
+	Given x and 3*x extracts NAF value from given bit position, and returns number of bits processed, and number of trailing zeros detected if any
+	param x BIG number
+	param x3 BIG number, three times x
+	param i bit position
+	param nbs pointer to integer returning number of bits processed
+	param nzs pointer to integer returning number of trailing 0s
+	return + or - 1, 3 or 5
+*/
+
+/**	@brief  Calculate x=y*z mod n (Variable Time)
+ *
+	Slow method for modular multiplication
+	@param x BIG number, on exit = y*z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modmul(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y/z mod n (Variable Time)
+ *
+	Slow method for modular division
+	@param x BIG number, on exit = y/z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_moddiv(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y^2 mod n (Variable Time)
+ *
+	Slow method for modular squaring
+	@param x BIG number, on exit = y^2 mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modsqr(BIG x, BIG y, BIG n);
+/**	@brief  Calculate x=-y mod n (Variable Time)
+ *
+	Modular negation
+	@param x BIG number, on exit = -y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modneg(BIG x, BIG y, BIG n);
+
+/**	@brief  Calculate x=y+z mod n (Variable Time)
+ *
+	Slow method for modular addition
+	@param x BIG number, on exit = y+z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modadd(BIG x, BIG y, BIG z, BIG n);
+
+/**	@brief  Calculate jacobi Symbol (x/y) (Variable Time)
+ *
+	@param x BIG number
+	@param y BIG number
+	@return Jacobi symbol, -1,0 or 1
+ */
+extern int BIG_jacobi(BIG x, BIG y);
+/**	@brief  Calculate x=1/y mod n (Variable Time)
+ *
+	Modular Inversion - This is slow. Uses binary method.
+	@param x BIG number, on exit = 1/y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_invmodp(BIG x, BIG y, BIG n);
+/** @brief Calculate x=x mod 2^m (Variable Time)
+ *
+	Truncation
+	@param x BIG number, on reduced mod 2^m
+	@param m new truncated size
+*/
+extern void BIG_mod2m(BIG x, int m);
+
+/**	@brief Calculates a*b+c+*d
+ *
+	Calculate partial product of a.b, add in carry c, and add total to d (Constant Time)
+	@param a multiplier
+	@param b multiplicand
+	@param c carry
+	@param d pointer to accumulated bottom half of result
+	@return top half of result
+ */
+
+
+extern int step1(BIG,BIG,BIG);
+extern void step2(BIG,BIG,BIG);
+
+#ifdef dchunk
+
+/* Method required to calculate x*y+c+r, bottom half in r, top half returned */
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    dchunk prod = (dchunk)x * y + c + *r;
+    *r = (chunk)prod & BMASK_B448_60;
+    return (chunk)(prod >> BASEBITS_B448_60);
+}
+
+#else
+
+/* No integer type available that can store double the wordlength */
+/* accumulate partial products */
+
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    chunk x0, x1, y0, y1;
+    chunk bot, top, mid, carry;
+    x0 = x & HMASK_B448_60;
+    x1 = (x >> HBITS_B448_60);
+    y0 = y & HMASK_B448_60;
+    y1 = (y >> HBITS_B448_60);
+    bot = x0 * y0;
+    top = x1 * y1;
+    mid = x0 * y1 + x1 * y0;
+    x0 = mid & HMASK_B448_60;
+    x1 = (mid >> HBITS_B448_60);
+    bot += x0 << HBITS_B448_60;
+    bot += *r;
+    bot += c;
+
+    top += x1;
+    carry = bot >> BASEBITS_B448_60;
+    bot &= BMASK_B448_60;
+    top += carry;
+
+    *r = bot;
+    return top;
+}
+
+#endif
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/big_B464_60.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/big_B464_60.h
new file mode 100644
index 0000000..0af3c14
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/big_B464_60.h
@@ -0,0 +1,697 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file big.h
+ * @author Mike Scott
+ * @date 23rd February 2016
+ * @brief Big number Header File
+ *
+ *
+ */
+
+#ifndef BIG_B464_60_H
+#define BIG_B464_60_H
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <inttypes.h>
+#include "arch.h"
+#include "core.h"
+#include "config_big_B464_60.h"
+
+using namespace core;
+
+/* could comment this out if code size is a major issue */
+#define UNWOUND
+/* Normally recommended, but may not be optimal for some architectures, for example 32-bit ARM M4 */
+#define USE_KARATSUBA
+
+#define BIGBITS_B464_60 (8*MODBYTES_B464_60)
+#define NLEN_B464_60 (1+((8*MODBYTES_B464_60-1)/BASEBITS_B464_60))
+#define DNLEN_B464_60 2*NLEN_B464_60
+#define BMASK_B464_60 (((chunk)1<<BASEBITS_B464_60)-1) /**< Mask = 2^BASEBITS-1 */
+#define NEXCESS_B464_60 (1<<(CHUNK-BASEBITS_B464_60-1))           /**< 2^(CHUNK-BASEBITS-1) - digit cannot be multiplied by more than this before normalisation */
+
+#define HBITS_B464_60 (BASEBITS_B464_60/2)      /**< Number of bits in number base divided by 2 */
+#define HMASK_B464_60 (((chunk)1<<HBITS_B464_60)-1)    /**< Mask = 2^HBITS-1 */
+
+//#define DEBUG_NORM
+
+#ifdef DEBUG_NORM  /* Add an extra location to track chunk extension */
+#define MPV_B464_60 NLEN_B464_60
+#define MNV_B464_60 (NLEN_B464_60+1)
+#define DMPV_B464_60 DNLEN_B464_60
+#define DMNV_B464_60 (DNLEN_B464_60+1)
+
+#endif
+
+namespace B464_60 {
+
+//extern int BIGMULS;
+//extern int BIGSQRS;
+
+#ifdef DEBUG_NORM
+typedef chunk BIG[NLEN_B464_60 + 2]; /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B464_60 + 2]; /**< Define type DBIG as array of chunks */
+#else
+typedef chunk BIG[NLEN_B464_60];     /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B464_60];   /**< Define type DBIG as array of chunks */
+#endif
+
+/* BIG number prototypes */
+
+/**	@brief Tests for BIG equal to zero (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_iszilch(BIG x);
+/**	@brief Tests for BIG equal to one (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if one, else returns 0
+ */
+extern int BIG_isunity(BIG x);
+/**	@brief Tests for DBIG equal to zero (Constant Time)
+ *
+	@param x a DBIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_diszilch(DBIG x);
+/**	@brief Outputs a BIG number to the console (Variable Time)
+ *
+	@param x a BIG number
+ */
+extern void BIG_output(BIG x);
+/**	@brief Outputs a BIG number to the console in raw form (Variable Time for debugging)
+ *
+	@param x a BIG number
+ */
+extern void BIG_rawoutput(BIG x);
+/**	@brief Conditional constant time swap of two BIG numbers
+ *
+	Conditionally swaps parameters in constant time (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s swap takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cswap(BIG x, BIG y, int s);
+/**	@brief Conditional copy of BIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cmove(BIG x, BIG y, int s);
+/**	@brief Conditional copy of DBIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a DBIG number
+	@param y another DBIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_dcmove(BIG x, BIG y, int s);
+/**	@brief Convert from BIG number to byte array (Constant Time)
+ *
+	@param a byte array
+	@param x BIG number
+ */
+extern void BIG_toBytes(char *a, BIG x);
+/**	@brief Convert to BIG number from byte array (Constant Time)
+ *
+	@param x BIG number
+	@param a byte array
+ */
+extern void BIG_fromBytes(BIG x, char *a);
+/**	@brief Convert to BIG number from byte array of given length (Variable Time)
+ *
+	@param x BIG number
+	@param a byte array
+	@param s byte array length
+ */
+extern void BIG_fromBytesLen(BIG x, char *a, int s);
+/**@brief Convert to DBIG number from byte array of given length (Variable Time)
+ *
+   @param x DBIG number
+   @param a byte array
+   @param s byte array length
+ */
+extern void BIG_dfromBytesLen(DBIG x, char *a, int s);
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_doutput(DBIG x); 
+
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_drawoutput(DBIG x);
+
+/**	@brief Copy BIG from Read-Only Memory to a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number in ROM
+ */
+extern void BIG_rcopy(BIG x, const BIG y);
+/**	@brief Copy BIG to another BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_copy(BIG x, BIG y);
+/**	@brief Copy DBIG to another DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_dcopy(DBIG x, DBIG y);
+/**	@brief Copy BIG to upper half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dsucopy(DBIG x, BIG y);
+/**	@brief Copy BIG to lower half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dscopy(DBIG x, BIG y);
+/**	@brief Copy lower half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sdcopy(BIG x, DBIG y);
+/**	@brief Copy upper half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sducopy(BIG x, DBIG y);
+/**	@brief Set BIG to zero (Constant Time)
+ *
+	@param x BIG number to be set to zero  
+ */
+extern void BIG_zero(BIG x);
+/**	@brief Set DBIG to zero (Constant Time)
+ *
+	@param x DBIG number to be set to zero
+ */
+extern void BIG_dzero(DBIG x);
+/**	@brief Set BIG to one (unity) (Constant Time)
+ *
+	@param x BIG number to be set to one.
+ */
+extern void BIG_one(BIG x);
+/**	@brief Set BIG to inverse mod 2^256 (Constant Time)
+ *
+	@param x BIG number to be inverted
+ */
+extern void BIG_invmod2m(BIG x);
+/**	@brief Set BIG to sum of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, sum of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_add(BIG x, BIG y, BIG z);
+
+/**	@brief Set BIG to logical or of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, or of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_or(BIG x, BIG y, BIG z);
+
+/**	@brief Increment BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be incremented
+	@param i integer
+ */
+extern void BIG_inc(BIG x, int i);
+/**	@brief Set BIG to difference of two BIGs (Constant Time)
+ *
+	@param x BIG number, difference of other two - output not normalised
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_sub(BIG x, BIG y, BIG z);
+/**	@brief Decrement BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be decremented
+	@param i integer
+ */
+extern void BIG_dec(BIG x, int i);
+/**	@brief Set DBIG to sum of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, sum of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dadd(DBIG x, DBIG y, DBIG z);
+/**	@brief Set DBIG to difference of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, difference of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dsub(DBIG x, DBIG y, DBIG z);
+/**	@brief Multiply BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_imul(BIG x, BIG y, int i);
+/**	@brief Multiply BIG by not-so-small small integer - output normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+	@return Overflowing bits
+ */
+extern chunk BIG_pmul(BIG x, BIG y, int i);
+/**	@brief Divide BIG by 3 - output normalised (Constant Time)
+ *
+	@param x BIG number
+	@return Remainder
+ */
+extern int BIG_div3(BIG x);
+/**	@brief Multiply BIG by even bigger small integer resulting in a DBIG - output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_pxmul(DBIG x, BIG y, int i);
+/**	@brief Multiply BIG by another BIG resulting in DBIG - inputs normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_mul(DBIG x, BIG y, BIG z);
+/**	@brief Multiply BIG by another BIG resulting in another BIG - inputs normalised and output normalised (Constant Time)
+ *
+	Note that the product must fit into a BIG, and x must be distinct from y and z
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_smul(BIG x, BIG y, BIG z);
+/**	@brief Square BIG resulting in a DBIG - input normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, square of a BIG
+	@param y BIG number to be squared
+ */
+extern void BIG_sqr(DBIG x, BIG y);
+
+/**	@brief Montgomery reduction of a DBIG to a BIG  - input normalised and output normalised (Constant Time)
+ *
+	@param a BIG number, reduction of a BIG
+	@param md BIG number, the modulus
+	@param MC the Montgomery Constant
+	@param d DBIG number to be reduced
+ */
+extern void BIG_monty(BIG a, BIG md, chunk MC, DBIG d);
+
+/**	@brief Shifts a BIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shl(BIG x, int s);
+/**	@brief Fast shifts a BIG left by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Overflow bits
+ */
+extern int BIG_fshl(BIG x, int s);
+/**	@brief Shifts a DBIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshl(DBIG x, int s);
+/**	@brief Shifts a BIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shr(BIG x, int s);
+
+
+/**	@brief Fast time-critical combined shift by 1 bit, subtract and normalise (Constant Time)
+ *
+	@param r BIG number normalised output
+	@param a BIG number to be subtracted from
+	@param m BIG number to be shifted and subtracted
+	@return sign of r
+ */
+extern int BIG_ssn(BIG r, BIG a, BIG m);
+
+/**	@brief Fast shifts a BIG right by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Shifted out bits
+ */
+extern int BIG_fshr(BIG x, int s);
+/**	@brief Shifts a DBIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshr(DBIG x, int s);
+/**	@brief Splits a DBIG into two BIGs - input must be normalised, outputs normalised (Constant Time as used)
+ *
+	Internal function. The value of s must be approximately in the middle of the DBIG.
+	Typically used to extract z mod 2^MODBITS and z/2^MODBITS
+	@param x BIG number, top half of z
+	@param y BIG number, bottom half of z
+	@param z DBIG number to be split in two.
+	@param s Bit position at which to split
+	@return carry-out from top half
+ */
+extern chunk BIG_split(BIG x, BIG y, DBIG z, int s);
+/**	@brief Normalizes a BIG number - output normalised (Constant Time)
+ *
+	All digits of the input BIG are reduced mod 2^BASEBITS
+	@param x BIG number to be normalised
+ */
+extern chunk BIG_norm(BIG x);
+/**	@brief Normalizes a DBIG number - output normalised (Constant Time)
+ *
+	All digits of the input DBIG are reduced mod 2^BASEBITS
+	@param x DBIG number to be normalised
+ */
+extern void BIG_dnorm(DBIG x);
+/**	@brief Compares two BIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first BIG number to be compared
+	@param y second BIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_comp(BIG x, BIG y);
+/**	@brief Compares two DBIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first DBIG number to be compared
+	@param y second DBIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_dcomp(DBIG x, DBIG y);
+/**	@brief Calculate number of bits in a BIG - output normalised (Variable Time)
+ *
+	@param x BIG number
+	@return Number of bits in x
+ */
+extern int BIG_nbits(BIG x);
+/**	@brief Calculate number of bits in a DBIG - output normalised (Variable Time)
+ *
+	@param x DBIG number
+	@return Number of bits in x
+ */
+extern int BIG_dnbits(DBIG x);
+
+/**	@brief Reduce x mod n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctmod(BIG x, BIG n, int bd);
+
+/**	@brief  x=y mod n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctdmod(BIG x, DBIG y, BIG n, int bd);
+
+/**	@brief Divide x by n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctsdiv(BIG x,BIG n,int bd);
+
+/**	@brief  x=y/n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctddiv(BIG x, DBIG y, BIG n,int bd);
+
+
+/**	@brief Reduce x mod n - input and output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+ */
+extern void BIG_mod(BIG x, BIG n);
+/**	@brief Divide x by n - output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+ */
+extern void BIG_sdiv(BIG x, BIG n);
+/**	@brief  x=y mod n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_dmod(BIG x, DBIG y, BIG n);
+/**	@brief  x=y/n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_ddiv(BIG x, DBIG y, BIG n);
+/**	@brief  return parity of BIG, that is the least significant bit (Constant Time)
+ *
+	@param x BIG number
+	@return 0 or 1
+ */
+extern int BIG_parity(BIG x);
+/**	@brief  return i-th of BIG (Constant Time)
+ *
+	@param x BIG number
+	@param i the bit of x to be returned
+	@return 0 or 1
+ */
+extern int BIG_bit(BIG x, int i);
+/**	@brief  return least significant bits of a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param n number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int BIG_lastbits(BIG x, int n);
+/**	@brief  Create a random BIG from a random number generator (Constant Time)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_random(BIG x, csprng *r);
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randomnum(BIG x, BIG n, csprng *r);
+
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus and truncated to max bit length (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param t Maximum bit length
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randtrunc(BIG x, BIG n, int t, csprng *r);
+
+/**	brief  return NAF (Non-Adjacent-Form) value as +/- 1, 3 or 5, inputs must be normalised
+ *
+	Given x and 3*x extracts NAF value from given bit position, and returns number of bits processed, and number of trailing zeros detected if any
+	param x BIG number
+	param x3 BIG number, three times x
+	param i bit position
+	param nbs pointer to integer returning number of bits processed
+	param nzs pointer to integer returning number of trailing 0s
+	return + or - 1, 3 or 5
+*/
+
+/**	@brief  Calculate x=y*z mod n (Variable Time)
+ *
+	Slow method for modular multiplication
+	@param x BIG number, on exit = y*z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modmul(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y/z mod n (Variable Time)
+ *
+	Slow method for modular division
+	@param x BIG number, on exit = y/z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_moddiv(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y^2 mod n (Variable Time)
+ *
+	Slow method for modular squaring
+	@param x BIG number, on exit = y^2 mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modsqr(BIG x, BIG y, BIG n);
+/**	@brief  Calculate x=-y mod n (Variable Time)
+ *
+	Modular negation
+	@param x BIG number, on exit = -y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modneg(BIG x, BIG y, BIG n);
+
+/**	@brief  Calculate x=y+z mod n (Variable Time)
+ *
+	Slow method for modular addition
+	@param x BIG number, on exit = y+z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modadd(BIG x, BIG y, BIG z, BIG n);
+
+/**	@brief  Calculate jacobi Symbol (x/y) (Variable Time)
+ *
+	@param x BIG number
+	@param y BIG number
+	@return Jacobi symbol, -1,0 or 1
+ */
+extern int BIG_jacobi(BIG x, BIG y);
+/**	@brief  Calculate x=1/y mod n (Variable Time)
+ *
+	Modular Inversion - This is slow. Uses binary method.
+	@param x BIG number, on exit = 1/y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_invmodp(BIG x, BIG y, BIG n);
+/** @brief Calculate x=x mod 2^m (Variable Time)
+ *
+	Truncation
+	@param x BIG number, on reduced mod 2^m
+	@param m new truncated size
+*/
+extern void BIG_mod2m(BIG x, int m);
+
+/**	@brief Calculates a*b+c+*d
+ *
+	Calculate partial product of a.b, add in carry c, and add total to d (Constant Time)
+	@param a multiplier
+	@param b multiplicand
+	@param c carry
+	@param d pointer to accumulated bottom half of result
+	@return top half of result
+ */
+
+
+extern int step1(BIG,BIG,BIG);
+extern void step2(BIG,BIG,BIG);
+
+#ifdef dchunk
+
+/* Method required to calculate x*y+c+r, bottom half in r, top half returned */
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    dchunk prod = (dchunk)x * y + c + *r;
+    *r = (chunk)prod & BMASK_B464_60;
+    return (chunk)(prod >> BASEBITS_B464_60);
+}
+
+#else
+
+/* No integer type available that can store double the wordlength */
+/* accumulate partial products */
+
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    chunk x0, x1, y0, y1;
+    chunk bot, top, mid, carry;
+    x0 = x & HMASK_B464_60;
+    x1 = (x >> HBITS_B464_60);
+    y0 = y & HMASK_B464_60;
+    y1 = (y >> HBITS_B464_60);
+    bot = x0 * y0;
+    top = x1 * y1;
+    mid = x0 * y1 + x1 * y0;
+    x0 = mid & HMASK_B464_60;
+    x1 = (mid >> HBITS_B464_60);
+    bot += x0 << HBITS_B464_60;
+    bot += *r;
+    bot += c;
+
+    top += x1;
+    carry = bot >> BASEBITS_B464_60;
+    bot &= BMASK_B464_60;
+    top += carry;
+
+    *r = bot;
+    return top;
+}
+
+#endif
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/big_B480_56.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/big_B480_56.h
new file mode 100644
index 0000000..7c76010
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/big_B480_56.h
@@ -0,0 +1,697 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file big.h
+ * @author Mike Scott
+ * @date 23rd February 2016
+ * @brief Big number Header File
+ *
+ *
+ */
+
+#ifndef BIG_B480_56_H
+#define BIG_B480_56_H
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <inttypes.h>
+#include "arch.h"
+#include "core.h"
+#include "config_big_B480_56.h"
+
+using namespace core;
+
+/* could comment this out if code size is a major issue */
+#define UNWOUND
+/* Normally recommended, but may not be optimal for some architectures, for example 32-bit ARM M4 */
+#define USE_KARATSUBA
+
+#define BIGBITS_B480_56 (8*MODBYTES_B480_56)
+#define NLEN_B480_56 (1+((8*MODBYTES_B480_56-1)/BASEBITS_B480_56))
+#define DNLEN_B480_56 2*NLEN_B480_56
+#define BMASK_B480_56 (((chunk)1<<BASEBITS_B480_56)-1) /**< Mask = 2^BASEBITS-1 */
+#define NEXCESS_B480_56 (1<<(CHUNK-BASEBITS_B480_56-1))           /**< 2^(CHUNK-BASEBITS-1) - digit cannot be multiplied by more than this before normalisation */
+
+#define HBITS_B480_56 (BASEBITS_B480_56/2)      /**< Number of bits in number base divided by 2 */
+#define HMASK_B480_56 (((chunk)1<<HBITS_B480_56)-1)    /**< Mask = 2^HBITS-1 */
+
+//#define DEBUG_NORM
+
+#ifdef DEBUG_NORM  /* Add an extra location to track chunk extension */
+#define MPV_B480_56 NLEN_B480_56
+#define MNV_B480_56 (NLEN_B480_56+1)
+#define DMPV_B480_56 DNLEN_B480_56
+#define DMNV_B480_56 (DNLEN_B480_56+1)
+
+#endif
+
+namespace B480_56 {
+
+//extern int BIGMULS;
+//extern int BIGSQRS;
+
+#ifdef DEBUG_NORM
+typedef chunk BIG[NLEN_B480_56 + 2]; /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B480_56 + 2]; /**< Define type DBIG as array of chunks */
+#else
+typedef chunk BIG[NLEN_B480_56];     /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B480_56];   /**< Define type DBIG as array of chunks */
+#endif
+
+/* BIG number prototypes */
+
+/**	@brief Tests for BIG equal to zero (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_iszilch(BIG x);
+/**	@brief Tests for BIG equal to one (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if one, else returns 0
+ */
+extern int BIG_isunity(BIG x);
+/**	@brief Tests for DBIG equal to zero (Constant Time)
+ *
+	@param x a DBIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_diszilch(DBIG x);
+/**	@brief Outputs a BIG number to the console (Variable Time)
+ *
+	@param x a BIG number
+ */
+extern void BIG_output(BIG x);
+/**	@brief Outputs a BIG number to the console in raw form (Variable Time for debugging)
+ *
+	@param x a BIG number
+ */
+extern void BIG_rawoutput(BIG x);
+/**	@brief Conditional constant time swap of two BIG numbers
+ *
+	Conditionally swaps parameters in constant time (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s swap takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cswap(BIG x, BIG y, int s);
+/**	@brief Conditional copy of BIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cmove(BIG x, BIG y, int s);
+/**	@brief Conditional copy of DBIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a DBIG number
+	@param y another DBIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_dcmove(BIG x, BIG y, int s);
+/**	@brief Convert from BIG number to byte array (Constant Time)
+ *
+	@param a byte array
+	@param x BIG number
+ */
+extern void BIG_toBytes(char *a, BIG x);
+/**	@brief Convert to BIG number from byte array (Constant Time)
+ *
+	@param x BIG number
+	@param a byte array
+ */
+extern void BIG_fromBytes(BIG x, char *a);
+/**	@brief Convert to BIG number from byte array of given length (Variable Time)
+ *
+	@param x BIG number
+	@param a byte array
+	@param s byte array length
+ */
+extern void BIG_fromBytesLen(BIG x, char *a, int s);
+/**@brief Convert to DBIG number from byte array of given length (Variable Time)
+ *
+   @param x DBIG number
+   @param a byte array
+   @param s byte array length
+ */
+extern void BIG_dfromBytesLen(DBIG x, char *a, int s);
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_doutput(DBIG x); 
+
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_drawoutput(DBIG x);
+
+/**	@brief Copy BIG from Read-Only Memory to a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number in ROM
+ */
+extern void BIG_rcopy(BIG x, const BIG y);
+/**	@brief Copy BIG to another BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_copy(BIG x, BIG y);
+/**	@brief Copy DBIG to another DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_dcopy(DBIG x, DBIG y);
+/**	@brief Copy BIG to upper half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dsucopy(DBIG x, BIG y);
+/**	@brief Copy BIG to lower half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dscopy(DBIG x, BIG y);
+/**	@brief Copy lower half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sdcopy(BIG x, DBIG y);
+/**	@brief Copy upper half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sducopy(BIG x, DBIG y);
+/**	@brief Set BIG to zero (Constant Time)
+ *
+	@param x BIG number to be set to zero  
+ */
+extern void BIG_zero(BIG x);
+/**	@brief Set DBIG to zero (Constant Time)
+ *
+	@param x DBIG number to be set to zero
+ */
+extern void BIG_dzero(DBIG x);
+/**	@brief Set BIG to one (unity) (Constant Time)
+ *
+	@param x BIG number to be set to one.
+ */
+extern void BIG_one(BIG x);
+/**	@brief Set BIG to inverse mod 2^256 (Constant Time)
+ *
+	@param x BIG number to be inverted
+ */
+extern void BIG_invmod2m(BIG x);
+/**	@brief Set BIG to sum of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, sum of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_add(BIG x, BIG y, BIG z);
+
+/**	@brief Set BIG to logical or of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, or of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_or(BIG x, BIG y, BIG z);
+
+/**	@brief Increment BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be incremented
+	@param i integer
+ */
+extern void BIG_inc(BIG x, int i);
+/**	@brief Set BIG to difference of two BIGs (Constant Time)
+ *
+	@param x BIG number, difference of other two - output not normalised
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_sub(BIG x, BIG y, BIG z);
+/**	@brief Decrement BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be decremented
+	@param i integer
+ */
+extern void BIG_dec(BIG x, int i);
+/**	@brief Set DBIG to sum of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, sum of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dadd(DBIG x, DBIG y, DBIG z);
+/**	@brief Set DBIG to difference of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, difference of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dsub(DBIG x, DBIG y, DBIG z);
+/**	@brief Multiply BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_imul(BIG x, BIG y, int i);
+/**	@brief Multiply BIG by not-so-small small integer - output normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+	@return Overflowing bits
+ */
+extern chunk BIG_pmul(BIG x, BIG y, int i);
+/**	@brief Divide BIG by 3 - output normalised (Constant Time)
+ *
+	@param x BIG number
+	@return Remainder
+ */
+extern int BIG_div3(BIG x);
+/**	@brief Multiply BIG by even bigger small integer resulting in a DBIG - output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_pxmul(DBIG x, BIG y, int i);
+/**	@brief Multiply BIG by another BIG resulting in DBIG - inputs normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_mul(DBIG x, BIG y, BIG z);
+/**	@brief Multiply BIG by another BIG resulting in another BIG - inputs normalised and output normalised (Constant Time)
+ *
+	Note that the product must fit into a BIG, and x must be distinct from y and z
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_smul(BIG x, BIG y, BIG z);
+/**	@brief Square BIG resulting in a DBIG - input normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, square of a BIG
+	@param y BIG number to be squared
+ */
+extern void BIG_sqr(DBIG x, BIG y);
+
+/**	@brief Montgomery reduction of a DBIG to a BIG  - input normalised and output normalised (Constant Time)
+ *
+	@param a BIG number, reduction of a BIG
+	@param md BIG number, the modulus
+	@param MC the Montgomery Constant
+	@param d DBIG number to be reduced
+ */
+extern void BIG_monty(BIG a, BIG md, chunk MC, DBIG d);
+
+/**	@brief Shifts a BIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shl(BIG x, int s);
+/**	@brief Fast shifts a BIG left by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Overflow bits
+ */
+extern int BIG_fshl(BIG x, int s);
+/**	@brief Shifts a DBIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshl(DBIG x, int s);
+/**	@brief Shifts a BIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shr(BIG x, int s);
+
+
+/**	@brief Fast time-critical combined shift by 1 bit, subtract and normalise (Constant Time)
+ *
+	@param r BIG number normalised output
+	@param a BIG number to be subtracted from
+	@param m BIG number to be shifted and subtracted
+	@return sign of r
+ */
+extern int BIG_ssn(BIG r, BIG a, BIG m);
+
+/**	@brief Fast shifts a BIG right by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Shifted out bits
+ */
+extern int BIG_fshr(BIG x, int s);
+/**	@brief Shifts a DBIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshr(DBIG x, int s);
+/**	@brief Splits a DBIG into two BIGs - input must be normalised, outputs normalised (Constant Time as used)
+ *
+	Internal function. The value of s must be approximately in the middle of the DBIG.
+	Typically used to extract z mod 2^MODBITS and z/2^MODBITS
+	@param x BIG number, top half of z
+	@param y BIG number, bottom half of z
+	@param z DBIG number to be split in two.
+	@param s Bit position at which to split
+	@return carry-out from top half
+ */
+extern chunk BIG_split(BIG x, BIG y, DBIG z, int s);
+/**	@brief Normalizes a BIG number - output normalised (Constant Time)
+ *
+	All digits of the input BIG are reduced mod 2^BASEBITS
+	@param x BIG number to be normalised
+ */
+extern chunk BIG_norm(BIG x);
+/**	@brief Normalizes a DBIG number - output normalised (Constant Time)
+ *
+	All digits of the input DBIG are reduced mod 2^BASEBITS
+	@param x DBIG number to be normalised
+ */
+extern void BIG_dnorm(DBIG x);
+/**	@brief Compares two BIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first BIG number to be compared
+	@param y second BIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_comp(BIG x, BIG y);
+/**	@brief Compares two DBIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first DBIG number to be compared
+	@param y second DBIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_dcomp(DBIG x, DBIG y);
+/**	@brief Calculate number of bits in a BIG - output normalised (Variable Time)
+ *
+	@param x BIG number
+	@return Number of bits in x
+ */
+extern int BIG_nbits(BIG x);
+/**	@brief Calculate number of bits in a DBIG - output normalised (Variable Time)
+ *
+	@param x DBIG number
+	@return Number of bits in x
+ */
+extern int BIG_dnbits(DBIG x);
+
+/**	@brief Reduce x mod n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctmod(BIG x, BIG n, int bd);
+
+/**	@brief  x=y mod n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctdmod(BIG x, DBIG y, BIG n, int bd);
+
+/**	@brief Divide x by n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctsdiv(BIG x,BIG n,int bd);
+
+/**	@brief  x=y/n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctddiv(BIG x, DBIG y, BIG n,int bd);
+
+
+/**	@brief Reduce x mod n - input and output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+ */
+extern void BIG_mod(BIG x, BIG n);
+/**	@brief Divide x by n - output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+ */
+extern void BIG_sdiv(BIG x, BIG n);
+/**	@brief  x=y mod n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_dmod(BIG x, DBIG y, BIG n);
+/**	@brief  x=y/n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_ddiv(BIG x, DBIG y, BIG n);
+/**	@brief  return parity of BIG, that is the least significant bit (Constant Time)
+ *
+	@param x BIG number
+	@return 0 or 1
+ */
+extern int BIG_parity(BIG x);
+/**	@brief  return i-th of BIG (Constant Time)
+ *
+	@param x BIG number
+	@param i the bit of x to be returned
+	@return 0 or 1
+ */
+extern int BIG_bit(BIG x, int i);
+/**	@brief  return least significant bits of a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param n number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int BIG_lastbits(BIG x, int n);
+/**	@brief  Create a random BIG from a random number generator (Constant Time)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_random(BIG x, csprng *r);
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randomnum(BIG x, BIG n, csprng *r);
+
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus and truncated to max bit length (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param t Maximum bit length
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randtrunc(BIG x, BIG n, int t, csprng *r);
+
+/**	brief  return NAF (Non-Adjacent-Form) value as +/- 1, 3 or 5, inputs must be normalised
+ *
+	Given x and 3*x extracts NAF value from given bit position, and returns number of bits processed, and number of trailing zeros detected if any
+	param x BIG number
+	param x3 BIG number, three times x
+	param i bit position
+	param nbs pointer to integer returning number of bits processed
+	param nzs pointer to integer returning number of trailing 0s
+	return + or - 1, 3 or 5
+*/
+
+/**	@brief  Calculate x=y*z mod n (Variable Time)
+ *
+	Slow method for modular multiplication
+	@param x BIG number, on exit = y*z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modmul(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y/z mod n (Variable Time)
+ *
+	Slow method for modular division
+	@param x BIG number, on exit = y/z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_moddiv(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y^2 mod n (Variable Time)
+ *
+	Slow method for modular squaring
+	@param x BIG number, on exit = y^2 mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modsqr(BIG x, BIG y, BIG n);
+/**	@brief  Calculate x=-y mod n (Variable Time)
+ *
+	Modular negation
+	@param x BIG number, on exit = -y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modneg(BIG x, BIG y, BIG n);
+
+/**	@brief  Calculate x=y+z mod n (Variable Time)
+ *
+	Slow method for modular addition
+	@param x BIG number, on exit = y+z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modadd(BIG x, BIG y, BIG z, BIG n);
+
+/**	@brief  Calculate jacobi Symbol (x/y) (Variable Time)
+ *
+	@param x BIG number
+	@param y BIG number
+	@return Jacobi symbol, -1,0 or 1
+ */
+extern int BIG_jacobi(BIG x, BIG y);
+/**	@brief  Calculate x=1/y mod n (Variable Time)
+ *
+	Modular Inversion - This is slow. Uses binary method.
+	@param x BIG number, on exit = 1/y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_invmodp(BIG x, BIG y, BIG n);
+/** @brief Calculate x=x mod 2^m (Variable Time)
+ *
+	Truncation
+	@param x BIG number, on reduced mod 2^m
+	@param m new truncated size
+*/
+extern void BIG_mod2m(BIG x, int m);
+
+/**	@brief Calculates a*b+c+*d
+ *
+	Calculate partial product of a.b, add in carry c, and add total to d (Constant Time)
+	@param a multiplier
+	@param b multiplicand
+	@param c carry
+	@param d pointer to accumulated bottom half of result
+	@return top half of result
+ */
+
+
+extern int step1(BIG,BIG,BIG);
+extern void step2(BIG,BIG,BIG);
+
+#ifdef dchunk
+
+/* Method required to calculate x*y+c+r, bottom half in r, top half returned */
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    dchunk prod = (dchunk)x * y + c + *r;
+    *r = (chunk)prod & BMASK_B480_56;
+    return (chunk)(prod >> BASEBITS_B480_56);
+}
+
+#else
+
+/* No integer type available that can store double the wordlength */
+/* accumulate partial products */
+
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    chunk x0, x1, y0, y1;
+    chunk bot, top, mid, carry;
+    x0 = x & HMASK_B480_56;
+    x1 = (x >> HBITS_B480_56);
+    y0 = y & HMASK_B480_56;
+    y1 = (y >> HBITS_B480_56);
+    bot = x0 * y0;
+    top = x1 * y1;
+    mid = x0 * y1 + x1 * y0;
+    x0 = mid & HMASK_B480_56;
+    x1 = (mid >> HBITS_B480_56);
+    bot += x0 << HBITS_B480_56;
+    bot += *r;
+    bot += c;
+
+    top += x1;
+    carry = bot >> BASEBITS_B480_56;
+    bot &= BMASK_B480_56;
+    top += carry;
+
+    *r = bot;
+    return top;
+}
+
+#endif
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/big_B512_60.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/big_B512_60.h
new file mode 100644
index 0000000..fa72a4a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/big_B512_60.h
@@ -0,0 +1,697 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file big.h
+ * @author Mike Scott
+ * @date 23rd February 2016
+ * @brief Big number Header File
+ *
+ *
+ */
+
+#ifndef BIG_B512_60_H
+#define BIG_B512_60_H
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <inttypes.h>
+#include "arch.h"
+#include "core.h"
+#include "config_big_B512_60.h"
+
+using namespace core;
+
+/* could comment this out if code size is a major issue */
+#define UNWOUND
+/* Normally recommended, but may not be optimal for some architectures, for example 32-bit ARM M4 */
+#define USE_KARATSUBA
+
+#define BIGBITS_B512_60 (8*MODBYTES_B512_60)
+#define NLEN_B512_60 (1+((8*MODBYTES_B512_60-1)/BASEBITS_B512_60))
+#define DNLEN_B512_60 2*NLEN_B512_60
+#define BMASK_B512_60 (((chunk)1<<BASEBITS_B512_60)-1) /**< Mask = 2^BASEBITS-1 */
+#define NEXCESS_B512_60 (1<<(CHUNK-BASEBITS_B512_60-1))           /**< 2^(CHUNK-BASEBITS-1) - digit cannot be multiplied by more than this before normalisation */
+
+#define HBITS_B512_60 (BASEBITS_B512_60/2)      /**< Number of bits in number base divided by 2 */
+#define HMASK_B512_60 (((chunk)1<<HBITS_B512_60)-1)    /**< Mask = 2^HBITS-1 */
+
+//#define DEBUG_NORM
+
+#ifdef DEBUG_NORM  /* Add an extra location to track chunk extension */
+#define MPV_B512_60 NLEN_B512_60
+#define MNV_B512_60 (NLEN_B512_60+1)
+#define DMPV_B512_60 DNLEN_B512_60
+#define DMNV_B512_60 (DNLEN_B512_60+1)
+
+#endif
+
+namespace B512_60 {
+
+//extern int BIGMULS;
+//extern int BIGSQRS;
+
+#ifdef DEBUG_NORM
+typedef chunk BIG[NLEN_B512_60 + 2]; /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B512_60 + 2]; /**< Define type DBIG as array of chunks */
+#else
+typedef chunk BIG[NLEN_B512_60];     /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B512_60];   /**< Define type DBIG as array of chunks */
+#endif
+
+/* BIG number prototypes */
+
+/**	@brief Tests for BIG equal to zero (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_iszilch(BIG x);
+/**	@brief Tests for BIG equal to one (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if one, else returns 0
+ */
+extern int BIG_isunity(BIG x);
+/**	@brief Tests for DBIG equal to zero (Constant Time)
+ *
+	@param x a DBIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_diszilch(DBIG x);
+/**	@brief Outputs a BIG number to the console (Variable Time)
+ *
+	@param x a BIG number
+ */
+extern void BIG_output(BIG x);
+/**	@brief Outputs a BIG number to the console in raw form (Variable Time for debugging)
+ *
+	@param x a BIG number
+ */
+extern void BIG_rawoutput(BIG x);
+/**	@brief Conditional constant time swap of two BIG numbers
+ *
+	Conditionally swaps parameters in constant time (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s swap takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cswap(BIG x, BIG y, int s);
+/**	@brief Conditional copy of BIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cmove(BIG x, BIG y, int s);
+/**	@brief Conditional copy of DBIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a DBIG number
+	@param y another DBIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_dcmove(BIG x, BIG y, int s);
+/**	@brief Convert from BIG number to byte array (Constant Time)
+ *
+	@param a byte array
+	@param x BIG number
+ */
+extern void BIG_toBytes(char *a, BIG x);
+/**	@brief Convert to BIG number from byte array (Constant Time)
+ *
+	@param x BIG number
+	@param a byte array
+ */
+extern void BIG_fromBytes(BIG x, char *a);
+/**	@brief Convert to BIG number from byte array of given length (Variable Time)
+ *
+	@param x BIG number
+	@param a byte array
+	@param s byte array length
+ */
+extern void BIG_fromBytesLen(BIG x, char *a, int s);
+/**@brief Convert to DBIG number from byte array of given length (Variable Time)
+ *
+   @param x DBIG number
+   @param a byte array
+   @param s byte array length
+ */
+extern void BIG_dfromBytesLen(DBIG x, char *a, int s);
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_doutput(DBIG x); 
+
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_drawoutput(DBIG x);
+
+/**	@brief Copy BIG from Read-Only Memory to a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number in ROM
+ */
+extern void BIG_rcopy(BIG x, const BIG y);
+/**	@brief Copy BIG to another BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_copy(BIG x, BIG y);
+/**	@brief Copy DBIG to another DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_dcopy(DBIG x, DBIG y);
+/**	@brief Copy BIG to upper half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dsucopy(DBIG x, BIG y);
+/**	@brief Copy BIG to lower half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dscopy(DBIG x, BIG y);
+/**	@brief Copy lower half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sdcopy(BIG x, DBIG y);
+/**	@brief Copy upper half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sducopy(BIG x, DBIG y);
+/**	@brief Set BIG to zero (Constant Time)
+ *
+	@param x BIG number to be set to zero  
+ */
+extern void BIG_zero(BIG x);
+/**	@brief Set DBIG to zero (Constant Time)
+ *
+	@param x DBIG number to be set to zero
+ */
+extern void BIG_dzero(DBIG x);
+/**	@brief Set BIG to one (unity) (Constant Time)
+ *
+	@param x BIG number to be set to one.
+ */
+extern void BIG_one(BIG x);
+/**	@brief Set BIG to inverse mod 2^256 (Constant Time)
+ *
+	@param x BIG number to be inverted
+ */
+extern void BIG_invmod2m(BIG x);
+/**	@brief Set BIG to sum of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, sum of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_add(BIG x, BIG y, BIG z);
+
+/**	@brief Set BIG to logical or of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, or of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_or(BIG x, BIG y, BIG z);
+
+/**	@brief Increment BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be incremented
+	@param i integer
+ */
+extern void BIG_inc(BIG x, int i);
+/**	@brief Set BIG to difference of two BIGs (Constant Time)
+ *
+	@param x BIG number, difference of other two - output not normalised
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_sub(BIG x, BIG y, BIG z);
+/**	@brief Decrement BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be decremented
+	@param i integer
+ */
+extern void BIG_dec(BIG x, int i);
+/**	@brief Set DBIG to sum of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, sum of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dadd(DBIG x, DBIG y, DBIG z);
+/**	@brief Set DBIG to difference of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, difference of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dsub(DBIG x, DBIG y, DBIG z);
+/**	@brief Multiply BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_imul(BIG x, BIG y, int i);
+/**	@brief Multiply BIG by not-so-small small integer - output normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+	@return Overflowing bits
+ */
+extern chunk BIG_pmul(BIG x, BIG y, int i);
+/**	@brief Divide BIG by 3 - output normalised (Constant Time)
+ *
+	@param x BIG number
+	@return Remainder
+ */
+extern int BIG_div3(BIG x);
+/**	@brief Multiply BIG by even bigger small integer resulting in a DBIG - output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_pxmul(DBIG x, BIG y, int i);
+/**	@brief Multiply BIG by another BIG resulting in DBIG - inputs normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_mul(DBIG x, BIG y, BIG z);
+/**	@brief Multiply BIG by another BIG resulting in another BIG - inputs normalised and output normalised (Constant Time)
+ *
+	Note that the product must fit into a BIG, and x must be distinct from y and z
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_smul(BIG x, BIG y, BIG z);
+/**	@brief Square BIG resulting in a DBIG - input normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, square of a BIG
+	@param y BIG number to be squared
+ */
+extern void BIG_sqr(DBIG x, BIG y);
+
+/**	@brief Montgomery reduction of a DBIG to a BIG  - input normalised and output normalised (Constant Time)
+ *
+	@param a BIG number, reduction of a BIG
+	@param md BIG number, the modulus
+	@param MC the Montgomery Constant
+	@param d DBIG number to be reduced
+ */
+extern void BIG_monty(BIG a, BIG md, chunk MC, DBIG d);
+
+/**	@brief Shifts a BIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shl(BIG x, int s);
+/**	@brief Fast shifts a BIG left by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Overflow bits
+ */
+extern int BIG_fshl(BIG x, int s);
+/**	@brief Shifts a DBIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshl(DBIG x, int s);
+/**	@brief Shifts a BIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shr(BIG x, int s);
+
+
+/**	@brief Fast time-critical combined shift by 1 bit, subtract and normalise (Constant Time)
+ *
+	@param r BIG number normalised output
+	@param a BIG number to be subtracted from
+	@param m BIG number to be shifted and subtracted
+	@return sign of r
+ */
+extern int BIG_ssn(BIG r, BIG a, BIG m);
+
+/**	@brief Fast shifts a BIG right by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Shifted out bits
+ */
+extern int BIG_fshr(BIG x, int s);
+/**	@brief Shifts a DBIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshr(DBIG x, int s);
+/**	@brief Splits a DBIG into two BIGs - input must be normalised, outputs normalised (Constant Time as used)
+ *
+	Internal function. The value of s must be approximately in the middle of the DBIG.
+	Typically used to extract z mod 2^MODBITS and z/2^MODBITS
+	@param x BIG number, top half of z
+	@param y BIG number, bottom half of z
+	@param z DBIG number to be split in two.
+	@param s Bit position at which to split
+	@return carry-out from top half
+ */
+extern chunk BIG_split(BIG x, BIG y, DBIG z, int s);
+/**	@brief Normalizes a BIG number - output normalised (Constant Time)
+ *
+	All digits of the input BIG are reduced mod 2^BASEBITS
+	@param x BIG number to be normalised
+ */
+extern chunk BIG_norm(BIG x);
+/**	@brief Normalizes a DBIG number - output normalised (Constant Time)
+ *
+	All digits of the input DBIG are reduced mod 2^BASEBITS
+	@param x DBIG number to be normalised
+ */
+extern void BIG_dnorm(DBIG x);
+/**	@brief Compares two BIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first BIG number to be compared
+	@param y second BIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_comp(BIG x, BIG y);
+/**	@brief Compares two DBIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first DBIG number to be compared
+	@param y second DBIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_dcomp(DBIG x, DBIG y);
+/**	@brief Calculate number of bits in a BIG - output normalised (Variable Time)
+ *
+	@param x BIG number
+	@return Number of bits in x
+ */
+extern int BIG_nbits(BIG x);
+/**	@brief Calculate number of bits in a DBIG - output normalised (Variable Time)
+ *
+	@param x DBIG number
+	@return Number of bits in x
+ */
+extern int BIG_dnbits(DBIG x);
+
+/**	@brief Reduce x mod n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctmod(BIG x, BIG n, int bd);
+
+/**	@brief  x=y mod n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctdmod(BIG x, DBIG y, BIG n, int bd);
+
+/**	@brief Divide x by n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctsdiv(BIG x,BIG n,int bd);
+
+/**	@brief  x=y/n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctddiv(BIG x, DBIG y, BIG n,int bd);
+
+
+/**	@brief Reduce x mod n - input and output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+ */
+extern void BIG_mod(BIG x, BIG n);
+/**	@brief Divide x by n - output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+ */
+extern void BIG_sdiv(BIG x, BIG n);
+/**	@brief  x=y mod n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_dmod(BIG x, DBIG y, BIG n);
+/**	@brief  x=y/n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_ddiv(BIG x, DBIG y, BIG n);
+/**	@brief  return parity of BIG, that is the least significant bit (Constant Time)
+ *
+	@param x BIG number
+	@return 0 or 1
+ */
+extern int BIG_parity(BIG x);
+/**	@brief  return i-th of BIG (Constant Time)
+ *
+	@param x BIG number
+	@param i the bit of x to be returned
+	@return 0 or 1
+ */
+extern int BIG_bit(BIG x, int i);
+/**	@brief  return least significant bits of a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param n number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int BIG_lastbits(BIG x, int n);
+/**	@brief  Create a random BIG from a random number generator (Constant Time)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_random(BIG x, csprng *r);
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randomnum(BIG x, BIG n, csprng *r);
+
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus and truncated to max bit length (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param t Maximum bit length
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randtrunc(BIG x, BIG n, int t, csprng *r);
+
+/**	brief  return NAF (Non-Adjacent-Form) value as +/- 1, 3 or 5, inputs must be normalised
+ *
+	Given x and 3*x extracts NAF value from given bit position, and returns number of bits processed, and number of trailing zeros detected if any
+	param x BIG number
+	param x3 BIG number, three times x
+	param i bit position
+	param nbs pointer to integer returning number of bits processed
+	param nzs pointer to integer returning number of trailing 0s
+	return + or - 1, 3 or 5
+*/
+
+/**	@brief  Calculate x=y*z mod n (Variable Time)
+ *
+	Slow method for modular multiplication
+	@param x BIG number, on exit = y*z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modmul(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y/z mod n (Variable Time)
+ *
+	Slow method for modular division
+	@param x BIG number, on exit = y/z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_moddiv(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y^2 mod n (Variable Time)
+ *
+	Slow method for modular squaring
+	@param x BIG number, on exit = y^2 mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modsqr(BIG x, BIG y, BIG n);
+/**	@brief  Calculate x=-y mod n (Variable Time)
+ *
+	Modular negation
+	@param x BIG number, on exit = -y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modneg(BIG x, BIG y, BIG n);
+
+/**	@brief  Calculate x=y+z mod n (Variable Time)
+ *
+	Slow method for modular addition
+	@param x BIG number, on exit = y+z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modadd(BIG x, BIG y, BIG z, BIG n);
+
+/**	@brief  Calculate jacobi Symbol (x/y) (Variable Time)
+ *
+	@param x BIG number
+	@param y BIG number
+	@return Jacobi symbol, -1,0 or 1
+ */
+extern int BIG_jacobi(BIG x, BIG y);
+/**	@brief  Calculate x=1/y mod n (Variable Time)
+ *
+	Modular Inversion - This is slow. Uses binary method.
+	@param x BIG number, on exit = 1/y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_invmodp(BIG x, BIG y, BIG n);
+/** @brief Calculate x=x mod 2^m (Variable Time)
+ *
+	Truncation
+	@param x BIG number, on reduced mod 2^m
+	@param m new truncated size
+*/
+extern void BIG_mod2m(BIG x, int m);
+
+/**	@brief Calculates a*b+c+*d
+ *
+	Calculate partial product of a.b, add in carry c, and add total to d (Constant Time)
+	@param a multiplier
+	@param b multiplicand
+	@param c carry
+	@param d pointer to accumulated bottom half of result
+	@return top half of result
+ */
+
+
+extern int step1(BIG,BIG,BIG);
+extern void step2(BIG,BIG,BIG);
+
+#ifdef dchunk
+
+/* Method required to calculate x*y+c+r, bottom half in r, top half returned */
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    dchunk prod = (dchunk)x * y + c + *r;
+    *r = (chunk)prod & BMASK_B512_60;
+    return (chunk)(prod >> BASEBITS_B512_60);
+}
+
+#else
+
+/* No integer type available that can store double the wordlength */
+/* accumulate partial products */
+
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    chunk x0, x1, y0, y1;
+    chunk bot, top, mid, carry;
+    x0 = x & HMASK_B512_60;
+    x1 = (x >> HBITS_B512_60);
+    y0 = y & HMASK_B512_60;
+    y1 = (y >> HBITS_B512_60);
+    bot = x0 * y0;
+    top = x1 * y1;
+    mid = x0 * y1 + x1 * y0;
+    x0 = mid & HMASK_B512_60;
+    x1 = (mid >> HBITS_B512_60);
+    bot += x0 << HBITS_B512_60;
+    bot += *r;
+    bot += c;
+
+    top += x1;
+    carry = bot >> BASEBITS_B512_60;
+    bot &= BMASK_B512_60;
+    top += carry;
+
+    *r = bot;
+    return top;
+}
+
+#endif
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/big_B528_60.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/big_B528_60.h
new file mode 100644
index 0000000..971a677
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/big_B528_60.h
@@ -0,0 +1,697 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file big.h
+ * @author Mike Scott
+ * @date 23rd February 2016
+ * @brief Big number Header File
+ *
+ *
+ */
+
+#ifndef BIG_B528_60_H
+#define BIG_B528_60_H
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <inttypes.h>
+#include "arch.h"
+#include "core.h"
+#include "config_big_B528_60.h"
+
+using namespace core;
+
+/* could comment this out if code size is a major issue */
+#define UNWOUND
+/* Normally recommended, but may not be optimal for some architectures, for example 32-bit ARM M4 */
+#define USE_KARATSUBA
+
+#define BIGBITS_B528_60 (8*MODBYTES_B528_60)
+#define NLEN_B528_60 (1+((8*MODBYTES_B528_60-1)/BASEBITS_B528_60))
+#define DNLEN_B528_60 2*NLEN_B528_60
+#define BMASK_B528_60 (((chunk)1<<BASEBITS_B528_60)-1) /**< Mask = 2^BASEBITS-1 */
+#define NEXCESS_B528_60 (1<<(CHUNK-BASEBITS_B528_60-1))           /**< 2^(CHUNK-BASEBITS-1) - digit cannot be multiplied by more than this before normalisation */
+
+#define HBITS_B528_60 (BASEBITS_B528_60/2)      /**< Number of bits in number base divided by 2 */
+#define HMASK_B528_60 (((chunk)1<<HBITS_B528_60)-1)    /**< Mask = 2^HBITS-1 */
+
+//#define DEBUG_NORM
+
+#ifdef DEBUG_NORM  /* Add an extra location to track chunk extension */
+#define MPV_B528_60 NLEN_B528_60
+#define MNV_B528_60 (NLEN_B528_60+1)
+#define DMPV_B528_60 DNLEN_B528_60
+#define DMNV_B528_60 (DNLEN_B528_60+1)
+
+#endif
+
+namespace B528_60 {
+
+//extern int BIGMULS;
+//extern int BIGSQRS;
+
+#ifdef DEBUG_NORM
+typedef chunk BIG[NLEN_B528_60 + 2]; /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B528_60 + 2]; /**< Define type DBIG as array of chunks */
+#else
+typedef chunk BIG[NLEN_B528_60];     /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B528_60];   /**< Define type DBIG as array of chunks */
+#endif
+
+/* BIG number prototypes */
+
+/**	@brief Tests for BIG equal to zero (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_iszilch(BIG x);
+/**	@brief Tests for BIG equal to one (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if one, else returns 0
+ */
+extern int BIG_isunity(BIG x);
+/**	@brief Tests for DBIG equal to zero (Constant Time)
+ *
+	@param x a DBIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_diszilch(DBIG x);
+/**	@brief Outputs a BIG number to the console (Variable Time)
+ *
+	@param x a BIG number
+ */
+extern void BIG_output(BIG x);
+/**	@brief Outputs a BIG number to the console in raw form (Variable Time for debugging)
+ *
+	@param x a BIG number
+ */
+extern void BIG_rawoutput(BIG x);
+/**	@brief Conditional constant time swap of two BIG numbers
+ *
+	Conditionally swaps parameters in constant time (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s swap takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cswap(BIG x, BIG y, int s);
+/**	@brief Conditional copy of BIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cmove(BIG x, BIG y, int s);
+/**	@brief Conditional copy of DBIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a DBIG number
+	@param y another DBIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_dcmove(BIG x, BIG y, int s);
+/**	@brief Convert from BIG number to byte array (Constant Time)
+ *
+	@param a byte array
+	@param x BIG number
+ */
+extern void BIG_toBytes(char *a, BIG x);
+/**	@brief Convert to BIG number from byte array (Constant Time)
+ *
+	@param x BIG number
+	@param a byte array
+ */
+extern void BIG_fromBytes(BIG x, char *a);
+/**	@brief Convert to BIG number from byte array of given length (Variable Time)
+ *
+	@param x BIG number
+	@param a byte array
+	@param s byte array length
+ */
+extern void BIG_fromBytesLen(BIG x, char *a, int s);
+/**@brief Convert to DBIG number from byte array of given length (Variable Time)
+ *
+   @param x DBIG number
+   @param a byte array
+   @param s byte array length
+ */
+extern void BIG_dfromBytesLen(DBIG x, char *a, int s);
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_doutput(DBIG x); 
+
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_drawoutput(DBIG x);
+
+/**	@brief Copy BIG from Read-Only Memory to a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number in ROM
+ */
+extern void BIG_rcopy(BIG x, const BIG y);
+/**	@brief Copy BIG to another BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_copy(BIG x, BIG y);
+/**	@brief Copy DBIG to another DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_dcopy(DBIG x, DBIG y);
+/**	@brief Copy BIG to upper half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dsucopy(DBIG x, BIG y);
+/**	@brief Copy BIG to lower half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dscopy(DBIG x, BIG y);
+/**	@brief Copy lower half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sdcopy(BIG x, DBIG y);
+/**	@brief Copy upper half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sducopy(BIG x, DBIG y);
+/**	@brief Set BIG to zero (Constant Time)
+ *
+	@param x BIG number to be set to zero  
+ */
+extern void BIG_zero(BIG x);
+/**	@brief Set DBIG to zero (Constant Time)
+ *
+	@param x DBIG number to be set to zero
+ */
+extern void BIG_dzero(DBIG x);
+/**	@brief Set BIG to one (unity) (Constant Time)
+ *
+	@param x BIG number to be set to one.
+ */
+extern void BIG_one(BIG x);
+/**	@brief Set BIG to inverse mod 2^256 (Constant Time)
+ *
+	@param x BIG number to be inverted
+ */
+extern void BIG_invmod2m(BIG x);
+/**	@brief Set BIG to sum of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, sum of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_add(BIG x, BIG y, BIG z);
+
+/**	@brief Set BIG to logical or of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, or of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_or(BIG x, BIG y, BIG z);
+
+/**	@brief Increment BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be incremented
+	@param i integer
+ */
+extern void BIG_inc(BIG x, int i);
+/**	@brief Set BIG to difference of two BIGs (Constant Time)
+ *
+	@param x BIG number, difference of other two - output not normalised
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_sub(BIG x, BIG y, BIG z);
+/**	@brief Decrement BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be decremented
+	@param i integer
+ */
+extern void BIG_dec(BIG x, int i);
+/**	@brief Set DBIG to sum of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, sum of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dadd(DBIG x, DBIG y, DBIG z);
+/**	@brief Set DBIG to difference of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, difference of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dsub(DBIG x, DBIG y, DBIG z);
+/**	@brief Multiply BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_imul(BIG x, BIG y, int i);
+/**	@brief Multiply BIG by not-so-small small integer - output normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+	@return Overflowing bits
+ */
+extern chunk BIG_pmul(BIG x, BIG y, int i);
+/**	@brief Divide BIG by 3 - output normalised (Constant Time)
+ *
+	@param x BIG number
+	@return Remainder
+ */
+extern int BIG_div3(BIG x);
+/**	@brief Multiply BIG by even bigger small integer resulting in a DBIG - output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_pxmul(DBIG x, BIG y, int i);
+/**	@brief Multiply BIG by another BIG resulting in DBIG - inputs normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_mul(DBIG x, BIG y, BIG z);
+/**	@brief Multiply BIG by another BIG resulting in another BIG - inputs normalised and output normalised (Constant Time)
+ *
+	Note that the product must fit into a BIG, and x must be distinct from y and z
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_smul(BIG x, BIG y, BIG z);
+/**	@brief Square BIG resulting in a DBIG - input normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, square of a BIG
+	@param y BIG number to be squared
+ */
+extern void BIG_sqr(DBIG x, BIG y);
+
+/**	@brief Montgomery reduction of a DBIG to a BIG  - input normalised and output normalised (Constant Time)
+ *
+	@param a BIG number, reduction of a BIG
+	@param md BIG number, the modulus
+	@param MC the Montgomery Constant
+	@param d DBIG number to be reduced
+ */
+extern void BIG_monty(BIG a, BIG md, chunk MC, DBIG d);
+
+/**	@brief Shifts a BIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shl(BIG x, int s);
+/**	@brief Fast shifts a BIG left by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Overflow bits
+ */
+extern int BIG_fshl(BIG x, int s);
+/**	@brief Shifts a DBIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshl(DBIG x, int s);
+/**	@brief Shifts a BIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shr(BIG x, int s);
+
+
+/**	@brief Fast time-critical combined shift by 1 bit, subtract and normalise (Constant Time)
+ *
+	@param r BIG number normalised output
+	@param a BIG number to be subtracted from
+	@param m BIG number to be shifted and subtracted
+	@return sign of r
+ */
+extern int BIG_ssn(BIG r, BIG a, BIG m);
+
+/**	@brief Fast shifts a BIG right by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Shifted out bits
+ */
+extern int BIG_fshr(BIG x, int s);
+/**	@brief Shifts a DBIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshr(DBIG x, int s);
+/**	@brief Splits a DBIG into two BIGs - input must be normalised, outputs normalised (Constant Time as used)
+ *
+	Internal function. The value of s must be approximately in the middle of the DBIG.
+	Typically used to extract z mod 2^MODBITS and z/2^MODBITS
+	@param x BIG number, top half of z
+	@param y BIG number, bottom half of z
+	@param z DBIG number to be split in two.
+	@param s Bit position at which to split
+	@return carry-out from top half
+ */
+extern chunk BIG_split(BIG x, BIG y, DBIG z, int s);
+/**	@brief Normalizes a BIG number - output normalised (Constant Time)
+ *
+	All digits of the input BIG are reduced mod 2^BASEBITS
+	@param x BIG number to be normalised
+ */
+extern chunk BIG_norm(BIG x);
+/**	@brief Normalizes a DBIG number - output normalised (Constant Time)
+ *
+	All digits of the input DBIG are reduced mod 2^BASEBITS
+	@param x DBIG number to be normalised
+ */
+extern void BIG_dnorm(DBIG x);
+/**	@brief Compares two BIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first BIG number to be compared
+	@param y second BIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_comp(BIG x, BIG y);
+/**	@brief Compares two DBIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first DBIG number to be compared
+	@param y second DBIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_dcomp(DBIG x, DBIG y);
+/**	@brief Calculate number of bits in a BIG - output normalised (Variable Time)
+ *
+	@param x BIG number
+	@return Number of bits in x
+ */
+extern int BIG_nbits(BIG x);
+/**	@brief Calculate number of bits in a DBIG - output normalised (Variable Time)
+ *
+	@param x DBIG number
+	@return Number of bits in x
+ */
+extern int BIG_dnbits(DBIG x);
+
+/**	@brief Reduce x mod n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctmod(BIG x, BIG n, int bd);
+
+/**	@brief  x=y mod n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctdmod(BIG x, DBIG y, BIG n, int bd);
+
+/**	@brief Divide x by n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctsdiv(BIG x,BIG n,int bd);
+
+/**	@brief  x=y/n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctddiv(BIG x, DBIG y, BIG n,int bd);
+
+
+/**	@brief Reduce x mod n - input and output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+ */
+extern void BIG_mod(BIG x, BIG n);
+/**	@brief Divide x by n - output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+ */
+extern void BIG_sdiv(BIG x, BIG n);
+/**	@brief  x=y mod n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_dmod(BIG x, DBIG y, BIG n);
+/**	@brief  x=y/n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_ddiv(BIG x, DBIG y, BIG n);
+/**	@brief  return parity of BIG, that is the least significant bit (Constant Time)
+ *
+	@param x BIG number
+	@return 0 or 1
+ */
+extern int BIG_parity(BIG x);
+/**	@brief  return i-th of BIG (Constant Time)
+ *
+	@param x BIG number
+	@param i the bit of x to be returned
+	@return 0 or 1
+ */
+extern int BIG_bit(BIG x, int i);
+/**	@brief  return least significant bits of a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param n number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int BIG_lastbits(BIG x, int n);
+/**	@brief  Create a random BIG from a random number generator (Constant Time)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_random(BIG x, csprng *r);
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randomnum(BIG x, BIG n, csprng *r);
+
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus and truncated to max bit length (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param t Maximum bit length
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randtrunc(BIG x, BIG n, int t, csprng *r);
+
+/**	brief  return NAF (Non-Adjacent-Form) value as +/- 1, 3 or 5, inputs must be normalised
+ *
+	Given x and 3*x extracts NAF value from given bit position, and returns number of bits processed, and number of trailing zeros detected if any
+	param x BIG number
+	param x3 BIG number, three times x
+	param i bit position
+	param nbs pointer to integer returning number of bits processed
+	param nzs pointer to integer returning number of trailing 0s
+	return + or - 1, 3 or 5
+*/
+
+/**	@brief  Calculate x=y*z mod n (Variable Time)
+ *
+	Slow method for modular multiplication
+	@param x BIG number, on exit = y*z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modmul(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y/z mod n (Variable Time)
+ *
+	Slow method for modular division
+	@param x BIG number, on exit = y/z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_moddiv(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y^2 mod n (Variable Time)
+ *
+	Slow method for modular squaring
+	@param x BIG number, on exit = y^2 mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modsqr(BIG x, BIG y, BIG n);
+/**	@brief  Calculate x=-y mod n (Variable Time)
+ *
+	Modular negation
+	@param x BIG number, on exit = -y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modneg(BIG x, BIG y, BIG n);
+
+/**	@brief  Calculate x=y+z mod n (Variable Time)
+ *
+	Slow method for modular addition
+	@param x BIG number, on exit = y+z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modadd(BIG x, BIG y, BIG z, BIG n);
+
+/**	@brief  Calculate jacobi Symbol (x/y) (Variable Time)
+ *
+	@param x BIG number
+	@param y BIG number
+	@return Jacobi symbol, -1,0 or 1
+ */
+extern int BIG_jacobi(BIG x, BIG y);
+/**	@brief  Calculate x=1/y mod n (Variable Time)
+ *
+	Modular Inversion - This is slow. Uses binary method.
+	@param x BIG number, on exit = 1/y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_invmodp(BIG x, BIG y, BIG n);
+/** @brief Calculate x=x mod 2^m (Variable Time)
+ *
+	Truncation
+	@param x BIG number, on reduced mod 2^m
+	@param m new truncated size
+*/
+extern void BIG_mod2m(BIG x, int m);
+
+/**	@brief Calculates a*b+c+*d
+ *
+	Calculate partial product of a.b, add in carry c, and add total to d (Constant Time)
+	@param a multiplier
+	@param b multiplicand
+	@param c carry
+	@param d pointer to accumulated bottom half of result
+	@return top half of result
+ */
+
+
+extern int step1(BIG,BIG,BIG);
+extern void step2(BIG,BIG,BIG);
+
+#ifdef dchunk
+
+/* Method required to calculate x*y+c+r, bottom half in r, top half returned */
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    dchunk prod = (dchunk)x * y + c + *r;
+    *r = (chunk)prod & BMASK_B528_60;
+    return (chunk)(prod >> BASEBITS_B528_60);
+}
+
+#else
+
+/* No integer type available that can store double the wordlength */
+/* accumulate partial products */
+
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    chunk x0, x1, y0, y1;
+    chunk bot, top, mid, carry;
+    x0 = x & HMASK_B528_60;
+    x1 = (x >> HBITS_B528_60);
+    y0 = y & HMASK_B528_60;
+    y1 = (y >> HBITS_B528_60);
+    bot = x0 * y0;
+    top = x1 * y1;
+    mid = x0 * y1 + x1 * y0;
+    x0 = mid & HMASK_B528_60;
+    x1 = (mid >> HBITS_B528_60);
+    bot += x0 << HBITS_B528_60;
+    bot += *r;
+    bot += c;
+
+    top += x1;
+    carry = bot >> BASEBITS_B528_60;
+    bot &= BMASK_B528_60;
+    top += carry;
+
+    *r = bot;
+    return top;
+}
+
+#endif
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/big_B560_58.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/big_B560_58.h
new file mode 100644
index 0000000..c9341c4
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/big_B560_58.h
@@ -0,0 +1,697 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file big.h
+ * @author Mike Scott
+ * @date 23rd February 2016
+ * @brief Big number Header File
+ *
+ *
+ */
+
+#ifndef BIG_B560_58_H
+#define BIG_B560_58_H
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <inttypes.h>
+#include "arch.h"
+#include "core.h"
+#include "config_big_B560_58.h"
+
+using namespace core;
+
+/* could comment this out if code size is a major issue */
+#define UNWOUND
+/* Normally recommended, but may not be optimal for some architectures, for example 32-bit ARM M4 */
+#define USE_KARATSUBA
+
+#define BIGBITS_B560_58 (8*MODBYTES_B560_58)
+#define NLEN_B560_58 (1+((8*MODBYTES_B560_58-1)/BASEBITS_B560_58))
+#define DNLEN_B560_58 2*NLEN_B560_58
+#define BMASK_B560_58 (((chunk)1<<BASEBITS_B560_58)-1) /**< Mask = 2^BASEBITS-1 */
+#define NEXCESS_B560_58 (1<<(CHUNK-BASEBITS_B560_58-1))           /**< 2^(CHUNK-BASEBITS-1) - digit cannot be multiplied by more than this before normalisation */
+
+#define HBITS_B560_58 (BASEBITS_B560_58/2)      /**< Number of bits in number base divided by 2 */
+#define HMASK_B560_58 (((chunk)1<<HBITS_B560_58)-1)    /**< Mask = 2^HBITS-1 */
+
+//#define DEBUG_NORM
+
+#ifdef DEBUG_NORM  /* Add an extra location to track chunk extension */
+#define MPV_B560_58 NLEN_B560_58
+#define MNV_B560_58 (NLEN_B560_58+1)
+#define DMPV_B560_58 DNLEN_B560_58
+#define DMNV_B560_58 (DNLEN_B560_58+1)
+
+#endif
+
+namespace B560_58 {
+
+//extern int BIGMULS;
+//extern int BIGSQRS;
+
+#ifdef DEBUG_NORM
+typedef chunk BIG[NLEN_B560_58 + 2]; /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B560_58 + 2]; /**< Define type DBIG as array of chunks */
+#else
+typedef chunk BIG[NLEN_B560_58];     /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B560_58];   /**< Define type DBIG as array of chunks */
+#endif
+
+/* BIG number prototypes */
+
+/**	@brief Tests for BIG equal to zero (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_iszilch(BIG x);
+/**	@brief Tests for BIG equal to one (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if one, else returns 0
+ */
+extern int BIG_isunity(BIG x);
+/**	@brief Tests for DBIG equal to zero (Constant Time)
+ *
+	@param x a DBIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_diszilch(DBIG x);
+/**	@brief Outputs a BIG number to the console (Variable Time)
+ *
+	@param x a BIG number
+ */
+extern void BIG_output(BIG x);
+/**	@brief Outputs a BIG number to the console in raw form (Variable Time for debugging)
+ *
+	@param x a BIG number
+ */
+extern void BIG_rawoutput(BIG x);
+/**	@brief Conditional constant time swap of two BIG numbers
+ *
+	Conditionally swaps parameters in constant time (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s swap takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cswap(BIG x, BIG y, int s);
+/**	@brief Conditional copy of BIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cmove(BIG x, BIG y, int s);
+/**	@brief Conditional copy of DBIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a DBIG number
+	@param y another DBIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_dcmove(BIG x, BIG y, int s);
+/**	@brief Convert from BIG number to byte array (Constant Time)
+ *
+	@param a byte array
+	@param x BIG number
+ */
+extern void BIG_toBytes(char *a, BIG x);
+/**	@brief Convert to BIG number from byte array (Constant Time)
+ *
+	@param x BIG number
+	@param a byte array
+ */
+extern void BIG_fromBytes(BIG x, char *a);
+/**	@brief Convert to BIG number from byte array of given length (Variable Time)
+ *
+	@param x BIG number
+	@param a byte array
+	@param s byte array length
+ */
+extern void BIG_fromBytesLen(BIG x, char *a, int s);
+/**@brief Convert to DBIG number from byte array of given length (Variable Time)
+ *
+   @param x DBIG number
+   @param a byte array
+   @param s byte array length
+ */
+extern void BIG_dfromBytesLen(DBIG x, char *a, int s);
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_doutput(DBIG x); 
+
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_drawoutput(DBIG x);
+
+/**	@brief Copy BIG from Read-Only Memory to a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number in ROM
+ */
+extern void BIG_rcopy(BIG x, const BIG y);
+/**	@brief Copy BIG to another BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_copy(BIG x, BIG y);
+/**	@brief Copy DBIG to another DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_dcopy(DBIG x, DBIG y);
+/**	@brief Copy BIG to upper half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dsucopy(DBIG x, BIG y);
+/**	@brief Copy BIG to lower half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dscopy(DBIG x, BIG y);
+/**	@brief Copy lower half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sdcopy(BIG x, DBIG y);
+/**	@brief Copy upper half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sducopy(BIG x, DBIG y);
+/**	@brief Set BIG to zero (Constant Time)
+ *
+	@param x BIG number to be set to zero  
+ */
+extern void BIG_zero(BIG x);
+/**	@brief Set DBIG to zero (Constant Time)
+ *
+	@param x DBIG number to be set to zero
+ */
+extern void BIG_dzero(DBIG x);
+/**	@brief Set BIG to one (unity) (Constant Time)
+ *
+	@param x BIG number to be set to one.
+ */
+extern void BIG_one(BIG x);
+/**	@brief Set BIG to inverse mod 2^256 (Constant Time)
+ *
+	@param x BIG number to be inverted
+ */
+extern void BIG_invmod2m(BIG x);
+/**	@brief Set BIG to sum of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, sum of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_add(BIG x, BIG y, BIG z);
+
+/**	@brief Set BIG to logical or of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, or of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_or(BIG x, BIG y, BIG z);
+
+/**	@brief Increment BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be incremented
+	@param i integer
+ */
+extern void BIG_inc(BIG x, int i);
+/**	@brief Set BIG to difference of two BIGs (Constant Time)
+ *
+	@param x BIG number, difference of other two - output not normalised
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_sub(BIG x, BIG y, BIG z);
+/**	@brief Decrement BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be decremented
+	@param i integer
+ */
+extern void BIG_dec(BIG x, int i);
+/**	@brief Set DBIG to sum of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, sum of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dadd(DBIG x, DBIG y, DBIG z);
+/**	@brief Set DBIG to difference of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, difference of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dsub(DBIG x, DBIG y, DBIG z);
+/**	@brief Multiply BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_imul(BIG x, BIG y, int i);
+/**	@brief Multiply BIG by not-so-small small integer - output normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+	@return Overflowing bits
+ */
+extern chunk BIG_pmul(BIG x, BIG y, int i);
+/**	@brief Divide BIG by 3 - output normalised (Constant Time)
+ *
+	@param x BIG number
+	@return Remainder
+ */
+extern int BIG_div3(BIG x);
+/**	@brief Multiply BIG by even bigger small integer resulting in a DBIG - output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_pxmul(DBIG x, BIG y, int i);
+/**	@brief Multiply BIG by another BIG resulting in DBIG - inputs normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_mul(DBIG x, BIG y, BIG z);
+/**	@brief Multiply BIG by another BIG resulting in another BIG - inputs normalised and output normalised (Constant Time)
+ *
+	Note that the product must fit into a BIG, and x must be distinct from y and z
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_smul(BIG x, BIG y, BIG z);
+/**	@brief Square BIG resulting in a DBIG - input normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, square of a BIG
+	@param y BIG number to be squared
+ */
+extern void BIG_sqr(DBIG x, BIG y);
+
+/**	@brief Montgomery reduction of a DBIG to a BIG  - input normalised and output normalised (Constant Time)
+ *
+	@param a BIG number, reduction of a BIG
+	@param md BIG number, the modulus
+	@param MC the Montgomery Constant
+	@param d DBIG number to be reduced
+ */
+extern void BIG_monty(BIG a, BIG md, chunk MC, DBIG d);
+
+/**	@brief Shifts a BIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shl(BIG x, int s);
+/**	@brief Fast shifts a BIG left by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Overflow bits
+ */
+extern int BIG_fshl(BIG x, int s);
+/**	@brief Shifts a DBIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshl(DBIG x, int s);
+/**	@brief Shifts a BIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shr(BIG x, int s);
+
+
+/**	@brief Fast time-critical combined shift by 1 bit, subtract and normalise (Constant Time)
+ *
+	@param r BIG number normalised output
+	@param a BIG number to be subtracted from
+	@param m BIG number to be shifted and subtracted
+	@return sign of r
+ */
+extern int BIG_ssn(BIG r, BIG a, BIG m);
+
+/**	@brief Fast shifts a BIG right by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Shifted out bits
+ */
+extern int BIG_fshr(BIG x, int s);
+/**	@brief Shifts a DBIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshr(DBIG x, int s);
+/**	@brief Splits a DBIG into two BIGs - input must be normalised, outputs normalised (Constant Time as used)
+ *
+	Internal function. The value of s must be approximately in the middle of the DBIG.
+	Typically used to extract z mod 2^MODBITS and z/2^MODBITS
+	@param x BIG number, top half of z
+	@param y BIG number, bottom half of z
+	@param z DBIG number to be split in two.
+	@param s Bit position at which to split
+	@return carry-out from top half
+ */
+extern chunk BIG_split(BIG x, BIG y, DBIG z, int s);
+/**	@brief Normalizes a BIG number - output normalised (Constant Time)
+ *
+	All digits of the input BIG are reduced mod 2^BASEBITS
+	@param x BIG number to be normalised
+ */
+extern chunk BIG_norm(BIG x);
+/**	@brief Normalizes a DBIG number - output normalised (Constant Time)
+ *
+	All digits of the input DBIG are reduced mod 2^BASEBITS
+	@param x DBIG number to be normalised
+ */
+extern void BIG_dnorm(DBIG x);
+/**	@brief Compares two BIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first BIG number to be compared
+	@param y second BIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_comp(BIG x, BIG y);
+/**	@brief Compares two DBIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first DBIG number to be compared
+	@param y second DBIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_dcomp(DBIG x, DBIG y);
+/**	@brief Calculate number of bits in a BIG - output normalised (Variable Time)
+ *
+	@param x BIG number
+	@return Number of bits in x
+ */
+extern int BIG_nbits(BIG x);
+/**	@brief Calculate number of bits in a DBIG - output normalised (Variable Time)
+ *
+	@param x DBIG number
+	@return Number of bits in x
+ */
+extern int BIG_dnbits(DBIG x);
+
+/**	@brief Reduce x mod n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctmod(BIG x, BIG n, int bd);
+
+/**	@brief  x=y mod n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctdmod(BIG x, DBIG y, BIG n, int bd);
+
+/**	@brief Divide x by n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctsdiv(BIG x,BIG n,int bd);
+
+/**	@brief  x=y/n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctddiv(BIG x, DBIG y, BIG n,int bd);
+
+
+/**	@brief Reduce x mod n - input and output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+ */
+extern void BIG_mod(BIG x, BIG n);
+/**	@brief Divide x by n - output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+ */
+extern void BIG_sdiv(BIG x, BIG n);
+/**	@brief  x=y mod n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_dmod(BIG x, DBIG y, BIG n);
+/**	@brief  x=y/n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_ddiv(BIG x, DBIG y, BIG n);
+/**	@brief  return parity of BIG, that is the least significant bit (Constant Time)
+ *
+	@param x BIG number
+	@return 0 or 1
+ */
+extern int BIG_parity(BIG x);
+/**	@brief  return i-th of BIG (Constant Time)
+ *
+	@param x BIG number
+	@param i the bit of x to be returned
+	@return 0 or 1
+ */
+extern int BIG_bit(BIG x, int i);
+/**	@brief  return least significant bits of a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param n number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int BIG_lastbits(BIG x, int n);
+/**	@brief  Create a random BIG from a random number generator (Constant Time)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_random(BIG x, csprng *r);
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randomnum(BIG x, BIG n, csprng *r);
+
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus and truncated to max bit length (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param t Maximum bit length
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randtrunc(BIG x, BIG n, int t, csprng *r);
+
+/**	brief  return NAF (Non-Adjacent-Form) value as +/- 1, 3 or 5, inputs must be normalised
+ *
+	Given x and 3*x extracts NAF value from given bit position, and returns number of bits processed, and number of trailing zeros detected if any
+	param x BIG number
+	param x3 BIG number, three times x
+	param i bit position
+	param nbs pointer to integer returning number of bits processed
+	param nzs pointer to integer returning number of trailing 0s
+	return + or - 1, 3 or 5
+*/
+
+/**	@brief  Calculate x=y*z mod n (Variable Time)
+ *
+	Slow method for modular multiplication
+	@param x BIG number, on exit = y*z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modmul(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y/z mod n (Variable Time)
+ *
+	Slow method for modular division
+	@param x BIG number, on exit = y/z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_moddiv(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y^2 mod n (Variable Time)
+ *
+	Slow method for modular squaring
+	@param x BIG number, on exit = y^2 mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modsqr(BIG x, BIG y, BIG n);
+/**	@brief  Calculate x=-y mod n (Variable Time)
+ *
+	Modular negation
+	@param x BIG number, on exit = -y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modneg(BIG x, BIG y, BIG n);
+
+/**	@brief  Calculate x=y+z mod n (Variable Time)
+ *
+	Slow method for modular addition
+	@param x BIG number, on exit = y+z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modadd(BIG x, BIG y, BIG z, BIG n);
+
+/**	@brief  Calculate jacobi Symbol (x/y) (Variable Time)
+ *
+	@param x BIG number
+	@param y BIG number
+	@return Jacobi symbol, -1,0 or 1
+ */
+extern int BIG_jacobi(BIG x, BIG y);
+/**	@brief  Calculate x=1/y mod n (Variable Time)
+ *
+	Modular Inversion - This is slow. Uses binary method.
+	@param x BIG number, on exit = 1/y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_invmodp(BIG x, BIG y, BIG n);
+/** @brief Calculate x=x mod 2^m (Variable Time)
+ *
+	Truncation
+	@param x BIG number, on reduced mod 2^m
+	@param m new truncated size
+*/
+extern void BIG_mod2m(BIG x, int m);
+
+/**	@brief Calculates a*b+c+*d
+ *
+	Calculate partial product of a.b, add in carry c, and add total to d (Constant Time)
+	@param a multiplier
+	@param b multiplicand
+	@param c carry
+	@param d pointer to accumulated bottom half of result
+	@return top half of result
+ */
+
+
+extern int step1(BIG,BIG,BIG);
+extern void step2(BIG,BIG,BIG);
+
+#ifdef dchunk
+
+/* Method required to calculate x*y+c+r, bottom half in r, top half returned */
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    dchunk prod = (dchunk)x * y + c + *r;
+    *r = (chunk)prod & BMASK_B560_58;
+    return (chunk)(prod >> BASEBITS_B560_58);
+}
+
+#else
+
+/* No integer type available that can store double the wordlength */
+/* accumulate partial products */
+
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    chunk x0, x1, y0, y1;
+    chunk bot, top, mid, carry;
+    x0 = x & HMASK_B560_58;
+    x1 = (x >> HBITS_B560_58);
+    y0 = y & HMASK_B560_58;
+    y1 = (y >> HBITS_B560_58);
+    bot = x0 * y0;
+    top = x1 * y1;
+    mid = x0 * y1 + x1 * y0;
+    x0 = mid & HMASK_B560_58;
+    x1 = (mid >> HBITS_B560_58);
+    bot += x0 << HBITS_B560_58;
+    bot += *r;
+    bot += c;
+
+    top += x1;
+    carry = bot >> BASEBITS_B560_58;
+    bot &= BMASK_B560_58;
+    top += carry;
+
+    *r = bot;
+    return top;
+}
+
+#endif
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/big_B584_60.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/big_B584_60.h
new file mode 100644
index 0000000..6024967
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/big_B584_60.h
@@ -0,0 +1,697 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file big.h
+ * @author Mike Scott
+ * @date 23rd February 2016
+ * @brief Big number Header File
+ *
+ *
+ */
+
+#ifndef BIG_B584_60_H
+#define BIG_B584_60_H
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <inttypes.h>
+#include "arch.h"
+#include "core.h"
+#include "config_big_B584_60.h"
+
+using namespace core;
+
+/* could comment this out if code size is a major issue */
+#define UNWOUND
+/* Normally recommended, but may not be optimal for some architectures, for example 32-bit ARM M4 */
+#define USE_KARATSUBA
+
+#define BIGBITS_B584_60 (8*MODBYTES_B584_60)
+#define NLEN_B584_60 (1+((8*MODBYTES_B584_60-1)/BASEBITS_B584_60))
+#define DNLEN_B584_60 2*NLEN_B584_60
+#define BMASK_B584_60 (((chunk)1<<BASEBITS_B584_60)-1) /**< Mask = 2^BASEBITS-1 */
+#define NEXCESS_B584_60 (1<<(CHUNK-BASEBITS_B584_60-1))           /**< 2^(CHUNK-BASEBITS-1) - digit cannot be multiplied by more than this before normalisation */
+
+#define HBITS_B584_60 (BASEBITS_B584_60/2)      /**< Number of bits in number base divided by 2 */
+#define HMASK_B584_60 (((chunk)1<<HBITS_B584_60)-1)    /**< Mask = 2^HBITS-1 */
+
+//#define DEBUG_NORM
+
+#ifdef DEBUG_NORM  /* Add an extra location to track chunk extension */
+#define MPV_B584_60 NLEN_B584_60
+#define MNV_B584_60 (NLEN_B584_60+1)
+#define DMPV_B584_60 DNLEN_B584_60
+#define DMNV_B584_60 (DNLEN_B584_60+1)
+
+#endif
+
+namespace B584_60 {
+
+//extern int BIGMULS;
+//extern int BIGSQRS;
+
+#ifdef DEBUG_NORM
+typedef chunk BIG[NLEN_B584_60 + 2]; /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B584_60 + 2]; /**< Define type DBIG as array of chunks */
+#else
+typedef chunk BIG[NLEN_B584_60];     /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B584_60];   /**< Define type DBIG as array of chunks */
+#endif
+
+/* BIG number prototypes */
+
+/**	@brief Tests for BIG equal to zero (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_iszilch(BIG x);
+/**	@brief Tests for BIG equal to one (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if one, else returns 0
+ */
+extern int BIG_isunity(BIG x);
+/**	@brief Tests for DBIG equal to zero (Constant Time)
+ *
+	@param x a DBIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_diszilch(DBIG x);
+/**	@brief Outputs a BIG number to the console (Variable Time)
+ *
+	@param x a BIG number
+ */
+extern void BIG_output(BIG x);
+/**	@brief Outputs a BIG number to the console in raw form (Variable Time for debugging)
+ *
+	@param x a BIG number
+ */
+extern void BIG_rawoutput(BIG x);
+/**	@brief Conditional constant time swap of two BIG numbers
+ *
+	Conditionally swaps parameters in constant time (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s swap takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cswap(BIG x, BIG y, int s);
+/**	@brief Conditional copy of BIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cmove(BIG x, BIG y, int s);
+/**	@brief Conditional copy of DBIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a DBIG number
+	@param y another DBIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_dcmove(BIG x, BIG y, int s);
+/**	@brief Convert from BIG number to byte array (Constant Time)
+ *
+	@param a byte array
+	@param x BIG number
+ */
+extern void BIG_toBytes(char *a, BIG x);
+/**	@brief Convert to BIG number from byte array (Constant Time)
+ *
+	@param x BIG number
+	@param a byte array
+ */
+extern void BIG_fromBytes(BIG x, char *a);
+/**	@brief Convert to BIG number from byte array of given length (Variable Time)
+ *
+	@param x BIG number
+	@param a byte array
+	@param s byte array length
+ */
+extern void BIG_fromBytesLen(BIG x, char *a, int s);
+/**@brief Convert to DBIG number from byte array of given length (Variable Time)
+ *
+   @param x DBIG number
+   @param a byte array
+   @param s byte array length
+ */
+extern void BIG_dfromBytesLen(DBIG x, char *a, int s);
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_doutput(DBIG x); 
+
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_drawoutput(DBIG x);
+
+/**	@brief Copy BIG from Read-Only Memory to a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number in ROM
+ */
+extern void BIG_rcopy(BIG x, const BIG y);
+/**	@brief Copy BIG to another BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_copy(BIG x, BIG y);
+/**	@brief Copy DBIG to another DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_dcopy(DBIG x, DBIG y);
+/**	@brief Copy BIG to upper half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dsucopy(DBIG x, BIG y);
+/**	@brief Copy BIG to lower half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dscopy(DBIG x, BIG y);
+/**	@brief Copy lower half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sdcopy(BIG x, DBIG y);
+/**	@brief Copy upper half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sducopy(BIG x, DBIG y);
+/**	@brief Set BIG to zero (Constant Time)
+ *
+	@param x BIG number to be set to zero  
+ */
+extern void BIG_zero(BIG x);
+/**	@brief Set DBIG to zero (Constant Time)
+ *
+	@param x DBIG number to be set to zero
+ */
+extern void BIG_dzero(DBIG x);
+/**	@brief Set BIG to one (unity) (Constant Time)
+ *
+	@param x BIG number to be set to one.
+ */
+extern void BIG_one(BIG x);
+/**	@brief Set BIG to inverse mod 2^256 (Constant Time)
+ *
+	@param x BIG number to be inverted
+ */
+extern void BIG_invmod2m(BIG x);
+/**	@brief Set BIG to sum of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, sum of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_add(BIG x, BIG y, BIG z);
+
+/**	@brief Set BIG to logical or of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, or of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_or(BIG x, BIG y, BIG z);
+
+/**	@brief Increment BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be incremented
+	@param i integer
+ */
+extern void BIG_inc(BIG x, int i);
+/**	@brief Set BIG to difference of two BIGs (Constant Time)
+ *
+	@param x BIG number, difference of other two - output not normalised
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_sub(BIG x, BIG y, BIG z);
+/**	@brief Decrement BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be decremented
+	@param i integer
+ */
+extern void BIG_dec(BIG x, int i);
+/**	@brief Set DBIG to sum of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, sum of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dadd(DBIG x, DBIG y, DBIG z);
+/**	@brief Set DBIG to difference of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, difference of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dsub(DBIG x, DBIG y, DBIG z);
+/**	@brief Multiply BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_imul(BIG x, BIG y, int i);
+/**	@brief Multiply BIG by not-so-small small integer - output normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+	@return Overflowing bits
+ */
+extern chunk BIG_pmul(BIG x, BIG y, int i);
+/**	@brief Divide BIG by 3 - output normalised (Constant Time)
+ *
+	@param x BIG number
+	@return Remainder
+ */
+extern int BIG_div3(BIG x);
+/**	@brief Multiply BIG by even bigger small integer resulting in a DBIG - output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_pxmul(DBIG x, BIG y, int i);
+/**	@brief Multiply BIG by another BIG resulting in DBIG - inputs normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_mul(DBIG x, BIG y, BIG z);
+/**	@brief Multiply BIG by another BIG resulting in another BIG - inputs normalised and output normalised (Constant Time)
+ *
+	Note that the product must fit into a BIG, and x must be distinct from y and z
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_smul(BIG x, BIG y, BIG z);
+/**	@brief Square BIG resulting in a DBIG - input normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, square of a BIG
+	@param y BIG number to be squared
+ */
+extern void BIG_sqr(DBIG x, BIG y);
+
+/**	@brief Montgomery reduction of a DBIG to a BIG  - input normalised and output normalised (Constant Time)
+ *
+	@param a BIG number, reduction of a BIG
+	@param md BIG number, the modulus
+	@param MC the Montgomery Constant
+	@param d DBIG number to be reduced
+ */
+extern void BIG_monty(BIG a, BIG md, chunk MC, DBIG d);
+
+/**	@brief Shifts a BIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shl(BIG x, int s);
+/**	@brief Fast shifts a BIG left by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Overflow bits
+ */
+extern int BIG_fshl(BIG x, int s);
+/**	@brief Shifts a DBIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshl(DBIG x, int s);
+/**	@brief Shifts a BIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shr(BIG x, int s);
+
+
+/**	@brief Fast time-critical combined shift by 1 bit, subtract and normalise (Constant Time)
+ *
+	@param r BIG number normalised output
+	@param a BIG number to be subtracted from
+	@param m BIG number to be shifted and subtracted
+	@return sign of r
+ */
+extern int BIG_ssn(BIG r, BIG a, BIG m);
+
+/**	@brief Fast shifts a BIG right by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Shifted out bits
+ */
+extern int BIG_fshr(BIG x, int s);
+/**	@brief Shifts a DBIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshr(DBIG x, int s);
+/**	@brief Splits a DBIG into two BIGs - input must be normalised, outputs normalised (Constant Time as used)
+ *
+	Internal function. The value of s must be approximately in the middle of the DBIG.
+	Typically used to extract z mod 2^MODBITS and z/2^MODBITS
+	@param x BIG number, top half of z
+	@param y BIG number, bottom half of z
+	@param z DBIG number to be split in two.
+	@param s Bit position at which to split
+	@return carry-out from top half
+ */
+extern chunk BIG_split(BIG x, BIG y, DBIG z, int s);
+/**	@brief Normalizes a BIG number - output normalised (Constant Time)
+ *
+	All digits of the input BIG are reduced mod 2^BASEBITS
+	@param x BIG number to be normalised
+ */
+extern chunk BIG_norm(BIG x);
+/**	@brief Normalizes a DBIG number - output normalised (Constant Time)
+ *
+	All digits of the input DBIG are reduced mod 2^BASEBITS
+	@param x DBIG number to be normalised
+ */
+extern void BIG_dnorm(DBIG x);
+/**	@brief Compares two BIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first BIG number to be compared
+	@param y second BIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_comp(BIG x, BIG y);
+/**	@brief Compares two DBIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first DBIG number to be compared
+	@param y second DBIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_dcomp(DBIG x, DBIG y);
+/**	@brief Calculate number of bits in a BIG - output normalised (Variable Time)
+ *
+	@param x BIG number
+	@return Number of bits in x
+ */
+extern int BIG_nbits(BIG x);
+/**	@brief Calculate number of bits in a DBIG - output normalised (Variable Time)
+ *
+	@param x DBIG number
+	@return Number of bits in x
+ */
+extern int BIG_dnbits(DBIG x);
+
+/**	@brief Reduce x mod n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctmod(BIG x, BIG n, int bd);
+
+/**	@brief  x=y mod n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctdmod(BIG x, DBIG y, BIG n, int bd);
+
+/**	@brief Divide x by n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctsdiv(BIG x,BIG n,int bd);
+
+/**	@brief  x=y/n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctddiv(BIG x, DBIG y, BIG n,int bd);
+
+
+/**	@brief Reduce x mod n - input and output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+ */
+extern void BIG_mod(BIG x, BIG n);
+/**	@brief Divide x by n - output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+ */
+extern void BIG_sdiv(BIG x, BIG n);
+/**	@brief  x=y mod n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_dmod(BIG x, DBIG y, BIG n);
+/**	@brief  x=y/n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_ddiv(BIG x, DBIG y, BIG n);
+/**	@brief  return parity of BIG, that is the least significant bit (Constant Time)
+ *
+	@param x BIG number
+	@return 0 or 1
+ */
+extern int BIG_parity(BIG x);
+/**	@brief  return i-th of BIG (Constant Time)
+ *
+	@param x BIG number
+	@param i the bit of x to be returned
+	@return 0 or 1
+ */
+extern int BIG_bit(BIG x, int i);
+/**	@brief  return least significant bits of a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param n number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int BIG_lastbits(BIG x, int n);
+/**	@brief  Create a random BIG from a random number generator (Constant Time)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_random(BIG x, csprng *r);
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randomnum(BIG x, BIG n, csprng *r);
+
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus and truncated to max bit length (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param t Maximum bit length
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randtrunc(BIG x, BIG n, int t, csprng *r);
+
+/**	brief  return NAF (Non-Adjacent-Form) value as +/- 1, 3 or 5, inputs must be normalised
+ *
+	Given x and 3*x extracts NAF value from given bit position, and returns number of bits processed, and number of trailing zeros detected if any
+	param x BIG number
+	param x3 BIG number, three times x
+	param i bit position
+	param nbs pointer to integer returning number of bits processed
+	param nzs pointer to integer returning number of trailing 0s
+	return + or - 1, 3 or 5
+*/
+
+/**	@brief  Calculate x=y*z mod n (Variable Time)
+ *
+	Slow method for modular multiplication
+	@param x BIG number, on exit = y*z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modmul(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y/z mod n (Variable Time)
+ *
+	Slow method for modular division
+	@param x BIG number, on exit = y/z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_moddiv(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y^2 mod n (Variable Time)
+ *
+	Slow method for modular squaring
+	@param x BIG number, on exit = y^2 mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modsqr(BIG x, BIG y, BIG n);
+/**	@brief  Calculate x=-y mod n (Variable Time)
+ *
+	Modular negation
+	@param x BIG number, on exit = -y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modneg(BIG x, BIG y, BIG n);
+
+/**	@brief  Calculate x=y+z mod n (Variable Time)
+ *
+	Slow method for modular addition
+	@param x BIG number, on exit = y+z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modadd(BIG x, BIG y, BIG z, BIG n);
+
+/**	@brief  Calculate jacobi Symbol (x/y) (Variable Time)
+ *
+	@param x BIG number
+	@param y BIG number
+	@return Jacobi symbol, -1,0 or 1
+ */
+extern int BIG_jacobi(BIG x, BIG y);
+/**	@brief  Calculate x=1/y mod n (Variable Time)
+ *
+	Modular Inversion - This is slow. Uses binary method.
+	@param x BIG number, on exit = 1/y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_invmodp(BIG x, BIG y, BIG n);
+/** @brief Calculate x=x mod 2^m (Variable Time)
+ *
+	Truncation
+	@param x BIG number, on reduced mod 2^m
+	@param m new truncated size
+*/
+extern void BIG_mod2m(BIG x, int m);
+
+/**	@brief Calculates a*b+c+*d
+ *
+	Calculate partial product of a.b, add in carry c, and add total to d (Constant Time)
+	@param a multiplier
+	@param b multiplicand
+	@param c carry
+	@param d pointer to accumulated bottom half of result
+	@return top half of result
+ */
+
+
+extern int step1(BIG,BIG,BIG);
+extern void step2(BIG,BIG,BIG);
+
+#ifdef dchunk
+
+/* Method required to calculate x*y+c+r, bottom half in r, top half returned */
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    dchunk prod = (dchunk)x * y + c + *r;
+    *r = (chunk)prod & BMASK_B584_60;
+    return (chunk)(prod >> BASEBITS_B584_60);
+}
+
+#else
+
+/* No integer type available that can store double the wordlength */
+/* accumulate partial products */
+
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    chunk x0, x1, y0, y1;
+    chunk bot, top, mid, carry;
+    x0 = x & HMASK_B584_60;
+    x1 = (x >> HBITS_B584_60);
+    y0 = y & HMASK_B584_60;
+    y1 = (y >> HBITS_B584_60);
+    bot = x0 * y0;
+    top = x1 * y1;
+    mid = x0 * y1 + x1 * y0;
+    x0 = mid & HMASK_B584_60;
+    x1 = (mid >> HBITS_B584_60);
+    bot += x0 << HBITS_B584_60;
+    bot += *r;
+    bot += c;
+
+    top += x1;
+    carry = bot >> BASEBITS_B584_60;
+    bot &= BMASK_B584_60;
+    top += carry;
+
+    *r = bot;
+    return top;
+}
+
+#endif
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/bls.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/bls.cpp
new file mode 100644
index 0000000..e5e204e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/bls.cpp
@@ -0,0 +1,188 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* Boneh-Lynn-Shacham signature 128-bit API */
+
+/* Loosely (for now) following https://datatracker.ietf.org/doc/html/draft-irtf-cfrg-bls-signature-02 */
+
+// Minimal-signature-size variant
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include "bls_ZZZ.h"
+
+using namespace XXX;
+using namespace YYY;
+
+#ifndef CORE_ARDUINO
+static FP4 G2_TAB[G2_TABLE_ZZZ];  // space for precomputation on fixed G2 parameter
+#endif
+
+#define CEIL(a,b) (((a)-1)/(b)+1)
+
+/* output u[i] \in F_p */
+/* https://datatracker.ietf.org/doc/draft-irtf-cfrg-hash-to-curve/ */
+static void hash_to_field(int hash,int hlen,FP *u,octet *DST,octet *M, int ctr)
+{
+    int i,j,L,nbq;
+    BIG q,w;
+    DBIG dx;
+    char okm[256],fd[128];
+    octet OKM = {0,sizeof(okm),okm};
+
+    BIG_rcopy(q, Modulus);
+    nbq=BIG_nbits(q);
+    L=CEIL(nbq+CURVE_SECURITY_ZZZ,8);
+
+    XMD_Expand(hash,hlen,&OKM,L*ctr,DST,M);
+    for (i=0;i<ctr;i++)
+    {
+        for (j=0;j<L;j++)
+            fd[j]=OKM.val[i*L+j];
+        
+        BIG_dfromBytesLen(dx,fd,L);
+        BIG_ctdmod(w,dx,q,8*L-nbq);
+        FP_nres(&u[i],w);
+    }
+}
+
+/* hash a message to an ECP point, using SHA2, random oracle method */
+static void BLS_HASH_TO_POINT(ECP *P, octet *M)
+{
+    FP u[2];
+    ECP P1;
+    char dst[50];
+    octet DST = {0,sizeof(dst),dst};
+
+    OCT_jstring(&DST,(char *)"BLS_SIG_ZZZG1_XMD:SHA-256_SVDW_RO_NUL_");
+    hash_to_field(MC_SHA2,HASH_TYPE_ZZZ,u,&DST,M,2);
+
+    ECP_map2point(P,&u[0]);
+    ECP_map2point(&P1,&u[1]);
+
+    ECP_add(P,&P1);
+    ECP_cfp(P);
+    ECP_affine(P);
+}
+
+#ifdef CORE_ARDUINO
+int ZZZ::BLS_INIT()
+{
+    return BLS_OK;
+}
+#else
+int ZZZ::BLS_INIT()
+{
+    ECP2 G;
+    if (!ECP2_generator(&G)) return BLS_FAIL;
+    PAIR_precomp(G2_TAB, &G);  // should be done just once on start-up
+    return BLS_OK;
+}
+#endif
+
+/* generate key pair, private key S, public key W */
+
+int ZZZ::BLS_KEY_PAIR_GENERATE(octet *IKM, octet* S, octet *W)
+{
+    int nbr,L;
+    BIG r,s;
+    DBIG dx;
+    ECP2 G;
+    char salt[20],prk[HASH_TYPE_ZZZ],okm[128],aikm[65],len[2];
+    octet SALT = {0,sizeof(salt),salt};
+    octet PRK = {0,sizeof(prk),prk};
+    octet OKM = {0,sizeof(okm),okm};
+    octet AIKM = {0,sizeof(aikm),aikm};
+    octet LEN = {0,sizeof(len),len};
+
+    OCT_copy(&AIKM,IKM);
+    OCT_jbyte(&AIKM,0,1);
+
+    BIG_rcopy(r, CURVE_Order);
+    nbr=BIG_nbits(r);
+    L=CEIL(3*CEIL(nbr,8),2);
+    OCT_jint(&LEN,L,2);
+
+    if (!ECP2_generator(&G)) return BLS_FAIL;
+
+    OCT_jstring(&SALT,(char *)"BLS-SIG-KEYGEN-SALT-");
+    HKDF_Extract(MC_SHA2,HASH_TYPE_ZZZ,&PRK,&SALT,&AIKM);
+    HKDF_Expand(MC_SHA2,HASH_TYPE_ZZZ,&OKM,L,&PRK,&LEN);
+
+    BIG_dfromBytesLen(dx,OKM.val,L);
+    BIG_ctdmod(s,dx,r,8*L-nbr);
+    BIG_toBytes(S->val, s);
+    S->len = MODBYTES_XXX;
+
+// SkToPk
+
+    PAIR_G2mul(&G, s);
+    ECP2_toOctet(W, &G, true);
+    return BLS_OK;
+}
+
+
+/* Sign message M using private key S to produce signature SIG */
+
+int ZZZ::BLS_CORE_SIGN(octet *SIG, octet *M, octet *S)
+{
+    BIG s;
+    ECP D;
+    BLS_HASH_TO_POINT(&D, M);
+    BIG_fromBytes(s, S->val);
+    PAIR_G1mul(&D, s);
+    ECP_toOctet(SIG, &D, true); /* compress output */
+    return BLS_OK;
+}
+
+/* Verify signature given message M, the signature SIG, and the public key W */
+int ZZZ::BLS_CORE_VERIFY(octet *SIG, octet *M, octet *W)
+{
+    FP12 v;
+    ECP2 G, PK;
+    ECP D, HM;
+    BLS_HASH_TO_POINT(&HM, M);
+
+    ECP_fromOctet(&D, SIG);
+	if (!PAIR_G1member(&D)) return BLS_FAIL;
+    ECP_neg(&D);
+
+    ECP2_fromOctet(&PK, W);
+	if (!PAIR_G2member(&PK)) return BLS_FAIL;
+
+// Use multi-pairing mechanism and precomputation on G2
+#ifndef CORE_ARDUINO
+    FP12 r[ATE_BITS_ZZZ];  // space for accumulated line functions
+
+    PAIR_initmp(r);
+    PAIR_another_pc(r, G2_TAB, &D);
+    PAIR_another(r, &PK, &HM);
+    PAIR_miller(&v, r);
+#else
+//.. or alternatively just
+    if (!ECP2_generator(&G)) return BLS_FAIL;
+    PAIR_double_ate(&v, &G, &D, &PK, &HM);
+#endif
+    PAIR_fexp(&v);
+
+    if (FP12_isunity(&v)) return BLS_OK;
+    return BLS_FAIL;
+}
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/bls.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/bls.h
new file mode 100644
index 0000000..d91ee9d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/bls.h
@@ -0,0 +1,87 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file bls.h
+ * @author Mike Scott
+ * @date 28th Novemebr 2018
+ * @brief BLS Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef BLS_ZZZ_H
+#define BLS_ZZZ_H
+
+#include "pair_ZZZ.h"
+
+using namespace core;
+
+namespace ZZZ {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define BGS_ZZZ MODBYTES_XXX  /**< BLS Group Size */
+#define BFS_ZZZ MODBYTES_XXX  /**< BLS Field Size */
+
+#define BLS_OK           0  /**< Function completed without error */
+#define BLS_FAIL        -1  /**< Point is NOT on the curve */
+
+/* BLS API functions */
+
+
+/** @brief Initialise BLS
+ *
+    @return BLS_OK if worked, otherwise BLS_FAIL
+ */
+int BLS_INIT();
+
+/** @brief Generate Key Pair
+ *
+    @param IKM contains truly random keying material
+    @param S on output a private key
+    @param W on output a public key = S*G, where G is fixed generator
+    @return BLS_OK
+ */
+int BLS_KEY_PAIR_GENERATE(octet *IKM, octet* S, octet *W);
+
+/** @brief Calculate a signature
+ *
+    @param SIG the ouput signature
+    @param M is the message to be signed
+    @param S an input private key
+    @return BLS_OK
+ */
+int BLS_CORE_SIGN(octet *SIG, octet *M, octet *S);
+
+/** @brief Verify a signature
+ *
+    @param SIG an input signature
+    @param M is the message whose signature is to be verified.
+    @param W an public key
+    @return BLS_OK if verified, otherwise BLS_FAIL
+ */
+int BLS_CORE_VERIFY(octet *SIG, octet *M, octet *W);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/bls192.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/bls192.cpp
new file mode 100644
index 0000000..e9c48ed
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/bls192.cpp
@@ -0,0 +1,189 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* Boneh-Lynn-Shacham signature 192-bit API */
+
+/* Loosely (for now) following https://datatracker.ietf.org/doc/html/draft-irtf-cfrg-bls-signature-02 */
+
+// Minimal-signature-size variant
+
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include "bls192_ZZZ.h"
+
+using namespace XXX;
+using namespace YYY;
+
+#ifndef CORE_ARDUINO
+static FP8 G2_TAB[G2_TABLE_ZZZ];  // space for precomputation on fixed G2 parameter
+#endif
+
+#define CEIL(a,b) (((a)-1)/(b)+1)
+
+/* output u[i] \in F_p */
+/* https://datatracker.ietf.org/doc/draft-irtf-cfrg-hash-to-curve/ */
+static void hash_to_field(int hash,int hlen,FP *u,octet *DST,octet *M, int ctr)
+{
+    int i,j,L,nbq;
+    BIG q,w;
+    DBIG dx;
+    char okm[256],fd[128];
+    octet OKM = {0,sizeof(okm),okm};
+
+    BIG_rcopy(q, Modulus);
+    nbq=BIG_nbits(q);
+    L=CEIL(nbq+CURVE_SECURITY_ZZZ,8);
+
+    XMD_Expand(hash,hlen,&OKM,L*ctr,DST,M);
+    for (i=0;i<ctr;i++)
+    {
+        for (j=0;j<L;j++)
+            fd[j]=OKM.val[i*L+j];
+        
+        BIG_dfromBytesLen(dx,fd,L);
+        BIG_ctdmod(w,dx,q,8*L-nbq);
+        FP_nres(&u[i],w);
+    }
+}
+
+/* hash a message to an ECP point, using SHA2, random oracle method */
+static void BLS_HASH_TO_POINT(ECP *P, octet *M)
+{
+    FP u[2];
+    ECP P1;
+    char dst[50];
+    octet DST = {0,sizeof(dst),dst};
+
+    OCT_jstring(&DST,(char *)"BLS_SIG_ZZZG1_XMD:SHA-384_SVDW_RO_NUL_");
+    hash_to_field(MC_SHA2,HASH_TYPE_ZZZ,u,&DST,M,2);
+
+    ECP_map2point(P,&u[0]);
+    ECP_map2point(&P1,&u[1]);
+
+    ECP_add(P,&P1);
+    ECP_cfp(P);
+    ECP_affine(P);
+}
+
+#ifdef CORE_ARDUINO
+int ZZZ::BLS_INIT()
+{
+    return BLS_OK;
+}
+#else
+int ZZZ::BLS_INIT()
+{
+    ECP4 G;
+    if (!ECP4_generator(&G)) return BLS_FAIL;
+    PAIR_precomp(G2_TAB, &G);  // should be done just once on start-up
+    return BLS_OK;
+}
+#endif
+
+/* generate key pair, private key S, public key W */
+
+int ZZZ::BLS_KEY_PAIR_GENERATE(octet *IKM, octet* S, octet *W)
+{
+    int nbr,L;
+    BIG r,s;
+    DBIG dx;
+    ECP4 G;
+    char salt[20],prk[HASH_TYPE_ZZZ],okm[128],aikm[65],len[2];
+    octet SALT = {0,sizeof(salt),salt};
+    octet PRK = {0,sizeof(prk),prk};
+    octet OKM = {0,sizeof(okm),okm};
+    octet AIKM = {0,sizeof(aikm),aikm};
+    octet LEN = {0,sizeof(len),len};
+
+    OCT_copy(&AIKM,IKM);
+    OCT_jbyte(&AIKM,0,1);
+
+    BIG_rcopy(r, CURVE_Order);
+    nbr=BIG_nbits(r);
+    L=CEIL(3*CEIL(nbr,8),2);
+    OCT_jint(&LEN,L,2);
+
+    if (!ECP4_generator(&G)) return BLS_FAIL;
+
+    OCT_jstring(&SALT,(char *)"BLS-SIG-KEYGEN-SALT-");
+    HKDF_Extract(MC_SHA2,HASH_TYPE_ZZZ,&PRK,&SALT,&AIKM);
+    HKDF_Expand(MC_SHA2,HASH_TYPE_ZZZ,&OKM,L,&PRK,&LEN);
+
+    BIG_dfromBytesLen(dx,OKM.val,L);
+    BIG_ctdmod(s,dx,r,8*L-nbr);
+    BIG_toBytes(S->val, s);
+    S->len = MODBYTES_XXX;
+
+// SkToPk
+
+    PAIR_G2mul(&G, s);
+    ECP4_toOctet(W, &G, true);
+    return BLS_OK;
+}
+
+
+/* Sign message m using private key S to produce signature SIG */
+
+int ZZZ::BLS_CORE_SIGN(octet *SIG, octet *M, octet *S)
+{
+    BIG s;
+    ECP D;
+    BLS_HASH_TO_POINT(&D, M);
+    BIG_fromBytes(s, S->val);
+    PAIR_G1mul(&D, s);
+    ECP_toOctet(SIG, &D, true); /* compress output */
+    return BLS_OK;
+}
+
+/* Verify signature given message M, the signature SIG, and the public key W */
+int ZZZ::BLS_CORE_VERIFY(octet *SIG, octet *M, octet *W)
+{
+    FP24 v;
+    ECP4 G, PK;
+    ECP D, HM;
+    BLS_HASH_TO_POINT(&HM, M);
+
+    ECP_fromOctet(&D, SIG);
+	if (!PAIR_G1member(&D)) return BLS_FAIL;
+    ECP_neg(&D);
+
+    ECP4_fromOctet(&PK, W);
+	if (!PAIR_G2member(&PK)) return BLS_FAIL;
+
+// Use new multi-pairing mechanism
+#ifndef CORE_ARDUINO
+    FP24 r[ATE_BITS_ZZZ];
+
+    PAIR_initmp(r);
+    PAIR_another_pc(r, G2_TAB, &D);
+    PAIR_another(r, &PK, &HM);
+    PAIR_miller(&v, r);
+#else
+//.. or alternatively
+    if (!ECP4_generator(&G)) return BLS_FAIL;
+    PAIR_double_ate(&v, &G, &D, &PK, &HM);
+#endif
+    PAIR_fexp(&v);
+
+    if (FP24_isunity(&v)) return BLS_OK;
+    return BLS_FAIL;
+}
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/bls192.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/bls192.h
new file mode 100644
index 0000000..2432d91
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/bls192.h
@@ -0,0 +1,86 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file bls192.h
+ * @author Mike Scott
+ * @date 28th Novemebr 2018
+ * @brief BLS Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef BLS192_ZZZ_H
+#define BLS192_ZZZ_H
+
+#include "pair4_ZZZ.h"
+
+using namespace core;
+
+namespace ZZZ {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define BGS_ZZZ MODBYTES_XXX  /**< BLS Group Size */
+#define BFS_ZZZ MODBYTES_XXX  /**< BLS Field Size */
+
+#define BLS_OK           0  /**< Function completed without error */
+#define BLS_FAIL        -1  /**< Point is NOT on the curve */
+
+/* BLS API functions */
+
+/** @brief Initialise BLS
+ *
+    @return BLS_OK if worked, otherwise BLS_FAIL
+ */
+int BLS_INIT();
+
+/** @brief Generate Key Pair
+ *
+    @param IKM contains truly random keying material
+    @param S on output a private key
+    @param W on output a public key = S*G, where G is fixed generator
+    @return BLS_OK
+ */
+int BLS_KEY_PAIR_GENERATE(octet *IKM, octet* S, octet *W);
+
+/** @brief Calculate a signature
+ *
+    @param SIG the ouput signature
+    @param M is the message to be signed
+    @param S an input private key
+    @return BLS_OK
+ */
+int BLS_CORE_SIGN(octet *SIG, octet *M, octet *S);
+
+/** @brief Verify a signature
+ *
+    @param SIG an input signature
+    @param M is the message whose signature is to be verified.
+    @param W an public key
+    @return BLS_OK if verified, otherwise BLS_FAIL
+ */
+int BLS_CORE_VERIFY(octet *SIG, octet *M, octet *W);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/bls192_BLS24479.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/bls192_BLS24479.h
new file mode 100644
index 0000000..e5b67f5
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/bls192_BLS24479.h
@@ -0,0 +1,86 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file bls192.h
+ * @author Mike Scott
+ * @date 28th Novemebr 2018
+ * @brief BLS Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef BLS192_BLS24479_H
+#define BLS192_BLS24479_H
+
+#include "pair4_BLS24479.h"
+
+using namespace core;
+
+namespace BLS24479 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define BGS_BLS24479 MODBYTES_B480_56  /**< BLS Group Size */
+#define BFS_BLS24479 MODBYTES_B480_56  /**< BLS Field Size */
+
+#define BLS_OK           0  /**< Function completed without error */
+#define BLS_FAIL        -1  /**< Point is NOT on the curve */
+
+/* BLS API functions */
+
+/** @brief Initialise BLS
+ *
+    @return BLS_OK if worked, otherwise BLS_FAIL
+ */
+int BLS_INIT();
+
+/** @brief Generate Key Pair
+ *
+    @param IKM contains truly random keying material
+    @param S on output a private key
+    @param W on output a public key = S*G, where G is fixed generator
+    @return BLS_OK
+ */
+int BLS_KEY_PAIR_GENERATE(octet *IKM, octet* S, octet *W);
+
+/** @brief Calculate a signature
+ *
+    @param SIG the ouput signature
+    @param M is the message to be signed
+    @param S an input private key
+    @return BLS_OK
+ */
+int BLS_CORE_SIGN(octet *SIG, octet *M, octet *S);
+
+/** @brief Verify a signature
+ *
+    @param SIG an input signature
+    @param M is the message whose signature is to be verified.
+    @param W an public key
+    @return BLS_OK if verified, otherwise BLS_FAIL
+ */
+int BLS_CORE_VERIFY(octet *SIG, octet *M, octet *W);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/bls256.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/bls256.cpp
new file mode 100644
index 0000000..ba36355
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/bls256.cpp
@@ -0,0 +1,185 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* Boneh-Lynn-Shacham signature 256-bit API */
+
+/* Loosely (for now) following https://datatracker.ietf.org/doc/html/draft-irtf-cfrg-bls-signature-02 */
+
+// Minimal-signature-size variant
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include "bls256_ZZZ.h"
+
+using namespace XXX;
+using namespace YYY;
+
+#ifndef CORE_ARDUINO
+static FP16 G2_TAB[G2_TABLE_ZZZ];  // space for precomputation on fixed G2 parameter
+#endif
+
+#define CEIL(a,b) (((a)-1)/(b)+1)
+
+/* output u[i] \in F_p */
+/* https://datatracker.ietf.org/doc/draft-irtf-cfrg-hash-to-curve/ */
+static void hash_to_field(int hash,int hlen,FP *u,octet *DST,octet *M, int ctr)
+{
+    int i,j,L,nbq;
+    BIG q,w;
+    DBIG dx;
+    char okm[256],fd[128];
+    octet OKM = {0,sizeof(okm),okm};
+
+    BIG_rcopy(q, Modulus);
+    nbq=BIG_nbits(q);
+    L=CEIL(nbq+CURVE_SECURITY_ZZZ,8);
+
+    XMD_Expand(hash,hlen,&OKM,L*ctr,DST,M);
+    for (i=0;i<ctr;i++)
+    {
+        for (j=0;j<L;j++)
+            fd[j]=OKM.val[i*L+j];
+        
+        BIG_dfromBytesLen(dx,fd,L);
+        BIG_ctdmod(w,dx,q,8*L-nbq);
+        FP_nres(&u[i],w);
+    }
+}
+
+/* hash a message to an ECP point, using SHA2, random oracle method */
+static void BLS_HASH_TO_POINT(ECP *P, octet *M)
+{
+    FP u[2];
+    ECP P1;
+    char dst[50];
+    octet DST = {0,sizeof(dst),dst};
+
+    OCT_jstring(&DST,(char *)"BLS_SIG_ZZZG1_XMD:SHA-512_SVDW_RO_NUL_");
+    hash_to_field(MC_SHA2,HASH_TYPE_ZZZ,u,&DST,M,2);
+
+    ECP_map2point(P,&u[0]);
+    ECP_map2point(&P1,&u[1]);
+
+    ECP_add(P,&P1);
+    ECP_cfp(P);
+    ECP_affine(P);
+}
+
+#ifdef CORE_ARDUINO
+int ZZZ::BLS_INIT()
+{
+    return BLS_OK;
+}
+#else
+int ZZZ::BLS_INIT()
+{
+    ECP8 G;
+    if (!ECP8_generator(&G)) return BLS_FAIL;
+    PAIR_precomp(G2_TAB, &G);  // should be done just once on start-up
+    return BLS_OK;
+}
+#endif
+
+/* generate key pair, private key S, public key W */
+
+int ZZZ::BLS_KEY_PAIR_GENERATE(octet *IKM, octet* S, octet *W)
+{
+    int nbr,L;
+    BIG r,s;
+    DBIG dx;
+    ECP8 G;
+    char salt[20],prk[HASH_TYPE_ZZZ],okm[128],aikm[65],len[2];
+    octet SALT = {0,sizeof(salt),salt};
+    octet PRK = {0,sizeof(prk),prk};
+    octet OKM = {0,sizeof(okm),okm};
+    octet AIKM = {0,sizeof(aikm),aikm};
+    octet LEN = {0,sizeof(len),len};
+
+    OCT_copy(&AIKM,IKM);
+    OCT_jbyte(&AIKM,0,1);
+
+    BIG_rcopy(r, CURVE_Order);
+    nbr=BIG_nbits(r);
+    L=CEIL(3*CEIL(nbr,8),2);
+    OCT_jint(&LEN,L,2);
+
+    if (!ECP8_generator(&G)) return BLS_FAIL;
+
+    OCT_jstring(&SALT,(char *)"BLS-SIG-KEYGEN-SALT-");
+    HKDF_Extract(MC_SHA2,HASH_TYPE_ZZZ,&PRK,&SALT,&AIKM);
+    HKDF_Expand(MC_SHA2,HASH_TYPE_ZZZ,&OKM,L,&PRK,&LEN);
+
+    BIG_dfromBytesLen(dx,OKM.val,L);
+    BIG_ctdmod(s,dx,r,8*L-nbr);
+    BIG_toBytes(S->val, s);
+    S->len = MODBYTES_XXX;
+
+// SkToPk
+
+    PAIR_G2mul(&G, s);
+    ECP8_toOctet(W, &G, true);
+    return BLS_OK;
+}
+/* Sign message m using private key S to produce signature SIG */
+
+int ZZZ::BLS_CORE_SIGN(octet *SIG, octet *M, octet *S)
+{
+    BIG s;
+    ECP D;
+    BLS_HASH_TO_POINT(&D, M);
+    BIG_fromBytes(s, S->val);
+    PAIR_G1mul(&D, s);
+    ECP_toOctet(SIG, &D, true); /* compress output */
+    return BLS_OK;
+}
+
+/* Verify signature of message M, the signature SIG, and the public key W */
+int ZZZ::BLS_CORE_VERIFY(octet *SIG, octet *M, octet *W)
+{
+    FP48 v;
+    ECP8 G, PK;
+    ECP D, HM;
+    BLS_HASH_TO_POINT(&HM, M);
+
+    ECP_fromOctet(&D, SIG);
+	if (!PAIR_G1member(&D)) return BLS_FAIL;
+    ECP_neg(&D);
+
+    ECP8_fromOctet(&PK, W);
+	if (!PAIR_G2member(&PK)) return BLS_FAIL;
+
+// Use new multi-pairing mechanism
+#ifndef CORE_ARDUINO
+    FP48 r[ATE_BITS_ZZZ];
+    PAIR_initmp(r);
+    PAIR_another_pc(r, G2_TAB, &D);
+    PAIR_another(r, &PK, &HM);
+    PAIR_miller(&v, r);
+#else
+//.. or alternatively
+    if (!ECP8_generator(&G)) return BLS_FAIL;
+    PAIR_double_ate(&v, &G, &D, &PK, &HM);
+#endif
+
+    PAIR_fexp(&v);
+    if (FP48_isunity(&v)) return BLS_OK;
+    return BLS_FAIL;
+}
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/bls256.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/bls256.h
new file mode 100644
index 0000000..97a8031
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/bls256.h
@@ -0,0 +1,86 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file bls256.h
+ * @author Mike Scott
+ * @date 28th Novemebr 2018
+ * @brief BLS Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef BLS256_ZZZ_H
+#define BLS256_ZZZ_H
+
+#include "pair8_ZZZ.h"
+
+using namespace core;
+
+namespace ZZZ {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define BGS_ZZZ MODBYTES_XXX  /**< BLS Group Size */
+#define BFS_ZZZ MODBYTES_XXX  /**< BLS Field Size */
+
+#define BLS_OK           0  /**< Function completed without error */
+#define BLS_FAIL        -1  /**< Point is NOT on the curve */
+
+/* BLS API functions */
+
+/** @brief Initialise BLS
+ *
+    @return BLS_OK if worked, otherwise BLS_FAIL
+ */
+int BLS_INIT();
+
+/** @brief Generate Key Pair
+ *
+    @param IKM contains truly random keying material
+    @param S on output a private key
+    @param W on output a public key = S*G, where G is fixed generator
+    @return BLS_OK
+ */
+int BLS_KEY_PAIR_GENERATE(octet *IKM, octet* S, octet *W);
+
+/** @brief Calculate a signature
+ *
+    @param SIG the ouput signature
+    @param m is the message to be signed
+    @param S an input private key
+    @return BLS_OK
+ */
+int BLS_CORE_SIGN(octet *SIG, octet *M, octet *S);
+
+/** @brief Verify a signature
+ *
+    @param SIG an input signature
+    @param m is the message whose signature is to be verified.
+    @param W an public key
+    @return BLS_OK if verified, otherwise BLS_FAIL
+ */
+int BLS_CORE_VERIFY(octet *SIG, octet *M, octet *W);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/bls256_BLS48286.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/bls256_BLS48286.h
new file mode 100644
index 0000000..323f20b
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/bls256_BLS48286.h
@@ -0,0 +1,86 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file bls256.h
+ * @author Mike Scott
+ * @date 28th Novemebr 2018
+ * @brief BLS Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef BLS256_BLS48286_H
+#define BLS256_BLS48286_H
+
+#include "pair8_BLS48286.h"
+
+using namespace core;
+
+namespace BLS48286 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define BGS_BLS48286 MODBYTES_B288_60  /**< BLS Group Size */
+#define BFS_BLS48286 MODBYTES_B288_60  /**< BLS Field Size */
+
+#define BLS_OK           0  /**< Function completed without error */
+#define BLS_FAIL        -1  /**< Point is NOT on the curve */
+
+/* BLS API functions */
+
+/** @brief Initialise BLS
+ *
+    @return BLS_OK if worked, otherwise BLS_FAIL
+ */
+int BLS_INIT();
+
+/** @brief Generate Key Pair
+ *
+    @param IKM contains truly random keying material
+    @param S on output a private key
+    @param W on output a public key = S*G, where G is fixed generator
+    @return BLS_OK
+ */
+int BLS_KEY_PAIR_GENERATE(octet *IKM, octet* S, octet *W);
+
+/** @brief Calculate a signature
+ *
+    @param SIG the ouput signature
+    @param m is the message to be signed
+    @param S an input private key
+    @return BLS_OK
+ */
+int BLS_CORE_SIGN(octet *SIG, octet *M, octet *S);
+
+/** @brief Verify a signature
+ *
+    @param SIG an input signature
+    @param m is the message whose signature is to be verified.
+    @param W an public key
+    @return BLS_OK if verified, otherwise BLS_FAIL
+ */
+int BLS_CORE_VERIFY(octet *SIG, octet *M, octet *W);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/bls256_BLS48556.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/bls256_BLS48556.h
new file mode 100644
index 0000000..a0b79b2
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/bls256_BLS48556.h
@@ -0,0 +1,86 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file bls256.h
+ * @author Mike Scott
+ * @date 28th Novemebr 2018
+ * @brief BLS Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef BLS256_BLS48556_H
+#define BLS256_BLS48556_H
+
+#include "pair8_BLS48556.h"
+
+using namespace core;
+
+namespace BLS48556 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define BGS_BLS48556 MODBYTES_B560_58  /**< BLS Group Size */
+#define BFS_BLS48556 MODBYTES_B560_58  /**< BLS Field Size */
+
+#define BLS_OK           0  /**< Function completed without error */
+#define BLS_FAIL        -1  /**< Point is NOT on the curve */
+
+/* BLS API functions */
+
+/** @brief Initialise BLS
+ *
+    @return BLS_OK if worked, otherwise BLS_FAIL
+ */
+int BLS_INIT();
+
+/** @brief Generate Key Pair
+ *
+    @param IKM contains truly random keying material
+    @param S on output a private key
+    @param W on output a public key = S*G, where G is fixed generator
+    @return BLS_OK
+ */
+int BLS_KEY_PAIR_GENERATE(octet *IKM, octet* S, octet *W);
+
+/** @brief Calculate a signature
+ *
+    @param SIG the ouput signature
+    @param m is the message to be signed
+    @param S an input private key
+    @return BLS_OK
+ */
+int BLS_CORE_SIGN(octet *SIG, octet *M, octet *S);
+
+/** @brief Verify a signature
+ *
+    @param SIG an input signature
+    @param m is the message whose signature is to be verified.
+    @param W an public key
+    @return BLS_OK if verified, otherwise BLS_FAIL
+ */
+int BLS_CORE_VERIFY(octet *SIG, octet *M, octet *W);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/bls256_BLS48581.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/bls256_BLS48581.h
new file mode 100644
index 0000000..1196da4
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/bls256_BLS48581.h
@@ -0,0 +1,86 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file bls256.h
+ * @author Mike Scott
+ * @date 28th Novemebr 2018
+ * @brief BLS Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef BLS256_BLS48581_H
+#define BLS256_BLS48581_H
+
+#include "pair8_BLS48581.h"
+
+using namespace core;
+
+namespace BLS48581 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define BGS_BLS48581 MODBYTES_B584_60  /**< BLS Group Size */
+#define BFS_BLS48581 MODBYTES_B584_60  /**< BLS Field Size */
+
+#define BLS_OK           0  /**< Function completed without error */
+#define BLS_FAIL        -1  /**< Point is NOT on the curve */
+
+/* BLS API functions */
+
+/** @brief Initialise BLS
+ *
+    @return BLS_OK if worked, otherwise BLS_FAIL
+ */
+int BLS_INIT();
+
+/** @brief Generate Key Pair
+ *
+    @param IKM contains truly random keying material
+    @param S on output a private key
+    @param W on output a public key = S*G, where G is fixed generator
+    @return BLS_OK
+ */
+int BLS_KEY_PAIR_GENERATE(octet *IKM, octet* S, octet *W);
+
+/** @brief Calculate a signature
+ *
+    @param SIG the ouput signature
+    @param m is the message to be signed
+    @param S an input private key
+    @return BLS_OK
+ */
+int BLS_CORE_SIGN(octet *SIG, octet *M, octet *S);
+
+/** @brief Verify a signature
+ *
+    @param SIG an input signature
+    @param m is the message whose signature is to be verified.
+    @param W an public key
+    @return BLS_OK if verified, otherwise BLS_FAIL
+ */
+int BLS_CORE_VERIFY(octet *SIG, octet *M, octet *W);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/bls_BLS12381.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/bls_BLS12381.h
new file mode 100644
index 0000000..e1bf9ff
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/bls_BLS12381.h
@@ -0,0 +1,87 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file bls.h
+ * @author Mike Scott
+ * @date 28th Novemebr 2018
+ * @brief BLS Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef BLS_BLS12381_H
+#define BLS_BLS12381_H
+
+#include "pair_BLS12381.h"
+
+using namespace core;
+
+namespace BLS12381 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define BGS_BLS12381 MODBYTES_B384_58  /**< BLS Group Size */
+#define BFS_BLS12381 MODBYTES_B384_58  /**< BLS Field Size */
+
+#define BLS_OK           0  /**< Function completed without error */
+#define BLS_FAIL        -1  /**< Point is NOT on the curve */
+
+/* BLS API functions */
+
+
+/** @brief Initialise BLS
+ *
+    @return BLS_OK if worked, otherwise BLS_FAIL
+ */
+int BLS_INIT();
+
+/** @brief Generate Key Pair
+ *
+    @param IKM contains truly random keying material
+    @param S on output a private key
+    @param W on output a public key = S*G, where G is fixed generator
+    @return BLS_OK
+ */
+int BLS_KEY_PAIR_GENERATE(octet *IKM, octet* S, octet *W);
+
+/** @brief Calculate a signature
+ *
+    @param SIG the ouput signature
+    @param M is the message to be signed
+    @param S an input private key
+    @return BLS_OK
+ */
+int BLS_CORE_SIGN(octet *SIG, octet *M, octet *S);
+
+/** @brief Verify a signature
+ *
+    @param SIG an input signature
+    @param M is the message whose signature is to be verified.
+    @param W an public key
+    @return BLS_OK if verified, otherwise BLS_FAIL
+ */
+int BLS_CORE_VERIFY(octet *SIG, octet *M, octet *W);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/bls_BLS12383.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/bls_BLS12383.h
new file mode 100644
index 0000000..32bd832
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/bls_BLS12383.h
@@ -0,0 +1,87 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file bls.h
+ * @author Mike Scott
+ * @date 28th Novemebr 2018
+ * @brief BLS Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef BLS_BLS12383_H
+#define BLS_BLS12383_H
+
+#include "pair_BLS12383.h"
+
+using namespace core;
+
+namespace BLS12383 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define BGS_BLS12383 MODBYTES_B384_58  /**< BLS Group Size */
+#define BFS_BLS12383 MODBYTES_B384_58  /**< BLS Field Size */
+
+#define BLS_OK           0  /**< Function completed without error */
+#define BLS_FAIL        -1  /**< Point is NOT on the curve */
+
+/* BLS API functions */
+
+
+/** @brief Initialise BLS
+ *
+    @return BLS_OK if worked, otherwise BLS_FAIL
+ */
+int BLS_INIT();
+
+/** @brief Generate Key Pair
+ *
+    @param IKM contains truly random keying material
+    @param S on output a private key
+    @param W on output a public key = S*G, where G is fixed generator
+    @return BLS_OK
+ */
+int BLS_KEY_PAIR_GENERATE(octet *IKM, octet* S, octet *W);
+
+/** @brief Calculate a signature
+ *
+    @param SIG the ouput signature
+    @param M is the message to be signed
+    @param S an input private key
+    @return BLS_OK
+ */
+int BLS_CORE_SIGN(octet *SIG, octet *M, octet *S);
+
+/** @brief Verify a signature
+ *
+    @param SIG an input signature
+    @param M is the message whose signature is to be verified.
+    @param W an public key
+    @return BLS_OK if verified, otherwise BLS_FAIL
+ */
+int BLS_CORE_VERIFY(octet *SIG, octet *M, octet *W);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/bls_BLS12443.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/bls_BLS12443.h
new file mode 100644
index 0000000..42b13f5
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/bls_BLS12443.h
@@ -0,0 +1,87 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file bls.h
+ * @author Mike Scott
+ * @date 28th Novemebr 2018
+ * @brief BLS Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef BLS_BLS12443_H
+#define BLS_BLS12443_H
+
+#include "pair_BLS12443.h"
+
+using namespace core;
+
+namespace BLS12443 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define BGS_BLS12443 MODBYTES_B448_60  /**< BLS Group Size */
+#define BFS_BLS12443 MODBYTES_B448_60  /**< BLS Field Size */
+
+#define BLS_OK           0  /**< Function completed without error */
+#define BLS_FAIL        -1  /**< Point is NOT on the curve */
+
+/* BLS API functions */
+
+
+/** @brief Initialise BLS
+ *
+    @return BLS_OK if worked, otherwise BLS_FAIL
+ */
+int BLS_INIT();
+
+/** @brief Generate Key Pair
+ *
+    @param IKM contains truly random keying material
+    @param S on output a private key
+    @param W on output a public key = S*G, where G is fixed generator
+    @return BLS_OK
+ */
+int BLS_KEY_PAIR_GENERATE(octet *IKM, octet* S, octet *W);
+
+/** @brief Calculate a signature
+ *
+    @param SIG the ouput signature
+    @param M is the message to be signed
+    @param S an input private key
+    @return BLS_OK
+ */
+int BLS_CORE_SIGN(octet *SIG, octet *M, octet *S);
+
+/** @brief Verify a signature
+ *
+    @param SIG an input signature
+    @param M is the message whose signature is to be verified.
+    @param W an public key
+    @return BLS_OK if verified, otherwise BLS_FAIL
+ */
+int BLS_CORE_VERIFY(octet *SIG, octet *M, octet *W);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/bls_BLS12461.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/bls_BLS12461.h
new file mode 100644
index 0000000..f52b401
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/bls_BLS12461.h
@@ -0,0 +1,87 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file bls.h
+ * @author Mike Scott
+ * @date 28th Novemebr 2018
+ * @brief BLS Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef BLS_BLS12461_H
+#define BLS_BLS12461_H
+
+#include "pair_BLS12461.h"
+
+using namespace core;
+
+namespace BLS12461 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define BGS_BLS12461 MODBYTES_B464_60  /**< BLS Group Size */
+#define BFS_BLS12461 MODBYTES_B464_60  /**< BLS Field Size */
+
+#define BLS_OK           0  /**< Function completed without error */
+#define BLS_FAIL        -1  /**< Point is NOT on the curve */
+
+/* BLS API functions */
+
+
+/** @brief Initialise BLS
+ *
+    @return BLS_OK if worked, otherwise BLS_FAIL
+ */
+int BLS_INIT();
+
+/** @brief Generate Key Pair
+ *
+    @param IKM contains truly random keying material
+    @param S on output a private key
+    @param W on output a public key = S*G, where G is fixed generator
+    @return BLS_OK
+ */
+int BLS_KEY_PAIR_GENERATE(octet *IKM, octet* S, octet *W);
+
+/** @brief Calculate a signature
+ *
+    @param SIG the ouput signature
+    @param M is the message to be signed
+    @param S an input private key
+    @return BLS_OK
+ */
+int BLS_CORE_SIGN(octet *SIG, octet *M, octet *S);
+
+/** @brief Verify a signature
+ *
+    @param SIG an input signature
+    @param M is the message whose signature is to be verified.
+    @param W an public key
+    @return BLS_OK if verified, otherwise BLS_FAIL
+ */
+int BLS_CORE_VERIFY(octet *SIG, octet *M, octet *W);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/bls_BN158.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/bls_BN158.h
new file mode 100644
index 0000000..5ae3c37
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/bls_BN158.h
@@ -0,0 +1,87 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file bls.h
+ * @author Mike Scott
+ * @date 28th Novemebr 2018
+ * @brief BLS Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef BLS_BN158_H
+#define BLS_BN158_H
+
+#include "pair_BN158.h"
+
+using namespace core;
+
+namespace BN158 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define BGS_BN158 MODBYTES_B160_56  /**< BLS Group Size */
+#define BFS_BN158 MODBYTES_B160_56  /**< BLS Field Size */
+
+#define BLS_OK           0  /**< Function completed without error */
+#define BLS_FAIL        -1  /**< Point is NOT on the curve */
+
+/* BLS API functions */
+
+
+/** @brief Initialise BLS
+ *
+    @return BLS_OK if worked, otherwise BLS_FAIL
+ */
+int BLS_INIT();
+
+/** @brief Generate Key Pair
+ *
+    @param IKM contains truly random keying material
+    @param S on output a private key
+    @param W on output a public key = S*G, where G is fixed generator
+    @return BLS_OK
+ */
+int BLS_KEY_PAIR_GENERATE(octet *IKM, octet* S, octet *W);
+
+/** @brief Calculate a signature
+ *
+    @param SIG the ouput signature
+    @param M is the message to be signed
+    @param S an input private key
+    @return BLS_OK
+ */
+int BLS_CORE_SIGN(octet *SIG, octet *M, octet *S);
+
+/** @brief Verify a signature
+ *
+    @param SIG an input signature
+    @param M is the message whose signature is to be verified.
+    @param W an public key
+    @return BLS_OK if verified, otherwise BLS_FAIL
+ */
+int BLS_CORE_VERIFY(octet *SIG, octet *M, octet *W);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/bls_BN254.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/bls_BN254.h
new file mode 100644
index 0000000..3c725b6
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/bls_BN254.h
@@ -0,0 +1,87 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file bls.h
+ * @author Mike Scott
+ * @date 28th Novemebr 2018
+ * @brief BLS Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef BLS_BN254_H
+#define BLS_BN254_H
+
+#include "pair_BN254.h"
+
+using namespace core;
+
+namespace BN254 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define BGS_BN254 MODBYTES_B256_56  /**< BLS Group Size */
+#define BFS_BN254 MODBYTES_B256_56  /**< BLS Field Size */
+
+#define BLS_OK           0  /**< Function completed without error */
+#define BLS_FAIL        -1  /**< Point is NOT on the curve */
+
+/* BLS API functions */
+
+
+/** @brief Initialise BLS
+ *
+    @return BLS_OK if worked, otherwise BLS_FAIL
+ */
+int BLS_INIT();
+
+/** @brief Generate Key Pair
+ *
+    @param IKM contains truly random keying material
+    @param S on output a private key
+    @param W on output a public key = S*G, where G is fixed generator
+    @return BLS_OK
+ */
+int BLS_KEY_PAIR_GENERATE(octet *IKM, octet* S, octet *W);
+
+/** @brief Calculate a signature
+ *
+    @param SIG the ouput signature
+    @param M is the message to be signed
+    @param S an input private key
+    @return BLS_OK
+ */
+int BLS_CORE_SIGN(octet *SIG, octet *M, octet *S);
+
+/** @brief Verify a signature
+ *
+    @param SIG an input signature
+    @param M is the message whose signature is to be verified.
+    @param W an public key
+    @return BLS_OK if verified, otherwise BLS_FAIL
+ */
+int BLS_CORE_VERIFY(octet *SIG, octet *M, octet *W);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/bls_BN254CX.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/bls_BN254CX.h
new file mode 100644
index 0000000..a8e89b7
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/bls_BN254CX.h
@@ -0,0 +1,87 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file bls.h
+ * @author Mike Scott
+ * @date 28th Novemebr 2018
+ * @brief BLS Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef BLS_BN254CX_H
+#define BLS_BN254CX_H
+
+#include "pair_BN254CX.h"
+
+using namespace core;
+
+namespace BN254CX {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define BGS_BN254CX MODBYTES_B256_56  /**< BLS Group Size */
+#define BFS_BN254CX MODBYTES_B256_56  /**< BLS Field Size */
+
+#define BLS_OK           0  /**< Function completed without error */
+#define BLS_FAIL        -1  /**< Point is NOT on the curve */
+
+/* BLS API functions */
+
+
+/** @brief Initialise BLS
+ *
+    @return BLS_OK if worked, otherwise BLS_FAIL
+ */
+int BLS_INIT();
+
+/** @brief Generate Key Pair
+ *
+    @param IKM contains truly random keying material
+    @param S on output a private key
+    @param W on output a public key = S*G, where G is fixed generator
+    @return BLS_OK
+ */
+int BLS_KEY_PAIR_GENERATE(octet *IKM, octet* S, octet *W);
+
+/** @brief Calculate a signature
+ *
+    @param SIG the ouput signature
+    @param M is the message to be signed
+    @param S an input private key
+    @return BLS_OK
+ */
+int BLS_CORE_SIGN(octet *SIG, octet *M, octet *S);
+
+/** @brief Verify a signature
+ *
+    @param SIG an input signature
+    @param M is the message whose signature is to be verified.
+    @param W an public key
+    @return BLS_OK if verified, otherwise BLS_FAIL
+ */
+int BLS_CORE_VERIFY(octet *SIG, octet *M, octet *W);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/bls_BN462.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/bls_BN462.h
new file mode 100644
index 0000000..4593746
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/bls_BN462.h
@@ -0,0 +1,87 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file bls.h
+ * @author Mike Scott
+ * @date 28th Novemebr 2018
+ * @brief BLS Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef BLS_BN462_H
+#define BLS_BN462_H
+
+#include "pair_BN462.h"
+
+using namespace core;
+
+namespace BN462 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define BGS_BN462 MODBYTES_B464_60  /**< BLS Group Size */
+#define BFS_BN462 MODBYTES_B464_60  /**< BLS Field Size */
+
+#define BLS_OK           0  /**< Function completed without error */
+#define BLS_FAIL        -1  /**< Point is NOT on the curve */
+
+/* BLS API functions */
+
+
+/** @brief Initialise BLS
+ *
+    @return BLS_OK if worked, otherwise BLS_FAIL
+ */
+int BLS_INIT();
+
+/** @brief Generate Key Pair
+ *
+    @param IKM contains truly random keying material
+    @param S on output a private key
+    @param W on output a public key = S*G, where G is fixed generator
+    @return BLS_OK
+ */
+int BLS_KEY_PAIR_GENERATE(octet *IKM, octet* S, octet *W);
+
+/** @brief Calculate a signature
+ *
+    @param SIG the ouput signature
+    @param M is the message to be signed
+    @param S an input private key
+    @return BLS_OK
+ */
+int BLS_CORE_SIGN(octet *SIG, octet *M, octet *S);
+
+/** @brief Verify a signature
+ *
+    @param SIG an input signature
+    @param M is the message whose signature is to be verified.
+    @param W an public key
+    @return BLS_OK if verified, otherwise BLS_FAIL
+ */
+int BLS_CORE_VERIFY(octet *SIG, octet *M, octet *W);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/bls_FP256BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/bls_FP256BN.h
new file mode 100644
index 0000000..d699d50
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/bls_FP256BN.h
@@ -0,0 +1,87 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file bls.h
+ * @author Mike Scott
+ * @date 28th Novemebr 2018
+ * @brief BLS Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef BLS_FP256BN_H
+#define BLS_FP256BN_H
+
+#include "pair_FP256BN.h"
+
+using namespace core;
+
+namespace FP256BN {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define BGS_FP256BN MODBYTES_B256_56  /**< BLS Group Size */
+#define BFS_FP256BN MODBYTES_B256_56  /**< BLS Field Size */
+
+#define BLS_OK           0  /**< Function completed without error */
+#define BLS_FAIL        -1  /**< Point is NOT on the curve */
+
+/* BLS API functions */
+
+
+/** @brief Initialise BLS
+ *
+    @return BLS_OK if worked, otherwise BLS_FAIL
+ */
+int BLS_INIT();
+
+/** @brief Generate Key Pair
+ *
+    @param IKM contains truly random keying material
+    @param S on output a private key
+    @param W on output a public key = S*G, where G is fixed generator
+    @return BLS_OK
+ */
+int BLS_KEY_PAIR_GENERATE(octet *IKM, octet* S, octet *W);
+
+/** @brief Calculate a signature
+ *
+    @param SIG the ouput signature
+    @param M is the message to be signed
+    @param S an input private key
+    @return BLS_OK
+ */
+int BLS_CORE_SIGN(octet *SIG, octet *M, octet *S);
+
+/** @brief Verify a signature
+ *
+    @param SIG an input signature
+    @param M is the message whose signature is to be verified.
+    @param W an public key
+    @return BLS_OK if verified, otherwise BLS_FAIL
+ */
+int BLS_CORE_VERIFY(octet *SIG, octet *M, octet *W);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/bls_FP512BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/bls_FP512BN.h
new file mode 100644
index 0000000..ce2b275
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/bls_FP512BN.h
@@ -0,0 +1,87 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file bls.h
+ * @author Mike Scott
+ * @date 28th Novemebr 2018
+ * @brief BLS Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef BLS_FP512BN_H
+#define BLS_FP512BN_H
+
+#include "pair_FP512BN.h"
+
+using namespace core;
+
+namespace FP512BN {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define BGS_FP512BN MODBYTES_B512_60  /**< BLS Group Size */
+#define BFS_FP512BN MODBYTES_B512_60  /**< BLS Field Size */
+
+#define BLS_OK           0  /**< Function completed without error */
+#define BLS_FAIL        -1  /**< Point is NOT on the curve */
+
+/* BLS API functions */
+
+
+/** @brief Initialise BLS
+ *
+    @return BLS_OK if worked, otherwise BLS_FAIL
+ */
+int BLS_INIT();
+
+/** @brief Generate Key Pair
+ *
+    @param IKM contains truly random keying material
+    @param S on output a private key
+    @param W on output a public key = S*G, where G is fixed generator
+    @return BLS_OK
+ */
+int BLS_KEY_PAIR_GENERATE(octet *IKM, octet* S, octet *W);
+
+/** @brief Calculate a signature
+ *
+    @param SIG the ouput signature
+    @param M is the message to be signed
+    @param S an input private key
+    @return BLS_OK
+ */
+int BLS_CORE_SIGN(octet *SIG, octet *M, octet *S);
+
+/** @brief Verify a signature
+ *
+    @param SIG an input signature
+    @param M is the message whose signature is to be verified.
+    @param W an public key
+    @return BLS_OK if verified, otherwise BLS_FAIL
+ */
+int BLS_CORE_VERIFY(octet *SIG, octet *M, octet *W);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/blsrev.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/blsrev.cpp
new file mode 100644
index 0000000..0f449f5
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/blsrev.cpp
@@ -0,0 +1,165 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* Boneh-Lynn-Shacham signature 128-bit API */
+
+/* Loosely (for now) following https://datatracker.ietf.org/doc/html/draft-irtf-cfrg-bls-signature-00 */
+
+// Minimal-pubkey-size variant
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include "bls_ZZZ.h"
+
+using namespace XXX;
+using namespace YYY;
+
+#define CEIL(a,b) (((a)-1)/(b)+1)
+
+/* output u[i] \in F_p */
+/* https://datatracker.ietf.org/doc/draft-irtf-cfrg-hash-to-curve/ */
+static void hash_to_field(int hash,int hlen,FP2 *u,octet *DST,octet *M, int ctr)
+{
+    int i,j,k,L,nbq;
+    BIG q,a[2];
+    DBIG dx;
+    char okm[512],fd[128];
+    octet OKM = {0,sizeof(okm),okm};
+
+    BIG_rcopy(q, Modulus);
+    nbq=BIG_nbits(q);
+    L=CEIL(nbq+CURVE_SECURITY_ZZZ,8);
+
+    XMD_Expand(hash,hlen,&OKM,L*ctr*2,DST,M);
+    for (i=0;i<ctr;i++)
+    {
+        for (k=0;k<2;k++)
+        {
+            for (j=0;j<L;j++)
+                fd[j]=OKM.val[(2*i+k)*L+j];
+        
+            BIG_dfromBytesLen(dx,fd,L);
+            BIG_ctdmod(a[k],dx,q,8*L-nbq);
+        }
+        FP2_from_BIGs(&u[i],a[0],a[1]);
+    }
+}
+
+/* hash a message to an ECP2 point, using SHA2, random oracle method */
+static void BLS_HASH_TO_POINT(ECP2 *P, octet *M)
+{
+    FP2 u[2];
+    ECP2 P1;
+    char dst[50];
+    octet DST = {0,sizeof(dst),dst};
+
+    OCT_jstring(&DST,(char *)"BLS_SIG_ZZZG2_XMD:SHA256-SVDW-RO-_NUL_");
+    hash_to_field(MC_SHA2,HASH_TYPE_ZZZ,u,&DST,M,2);
+
+    ECP2_map2point(P,&u[0]);
+    ECP2_map2point(&P1,&u[1]);
+
+    ECP2_add(P,&P1);
+    ECP2_cfp(P);
+    ECP2_affine(P);
+}
+
+int ZZZ::BLS_INIT()
+{
+    return BLS_OK;
+}
+
+/* generate key pair, private key S, public key W */
+int ZZZ::BLS_KEY_PAIR_GENERATE(octet *IKM, octet* S, octet *W)
+{
+    int nbr,L;
+    BIG r,s;
+    DBIG dx;
+    ECP G;
+    char salt[20],prk[HASH_TYPE_ZZZ],okm[128],aikm[65],len[2];
+    octet SALT = {0,sizeof(salt),salt};
+    octet PRK = {0,sizeof(prk),prk};
+    octet OKM = {0,sizeof(okm),okm};
+    octet AIKM = {0,sizeof(aikm),aikm};
+    octet LEN = {0,sizeof(len),len};
+
+    OCT_copy(&AIKM,IKM);
+    OCT_jbyte(&AIKM,0,1);
+
+    BIG_rcopy(r, CURVE_Order);
+    nbr=BIG_nbits(r);
+    L=CEIL(3*CEIL(nbr,8),2);
+    OCT_jint(&LEN,L,2);
+
+    if (!ECP_generator(&G)) return BLS_FAIL;
+
+    OCT_jstring(&SALT,(char *)"BLS-SIG-KEYGEN-SALT-");
+    HKDF_Extract(MC_SHA2,HASH_TYPE_ZZZ,&PRK,&SALT,&AIKM);
+    HKDF_Expand(MC_SHA2,HASH_TYPE_ZZZ,&OKM,L,&PRK,&LEN);
+
+    BIG_dfromBytesLen(dx,OKM.val,L);
+    BIG_ctdmod(s,dx,r,8*L-nbr);
+    BIG_toBytes(S->val, s);
+    S->len = MODBYTES_XXX;
+
+// SkToPk
+
+    PAIR_G1mul(&G, s);
+    ECP_toOctet(W, &G, true);
+    return BLS_OK;
+}
+
+/* Sign message M using private key S to produce signature SIG */
+
+int ZZZ::BLS_CORE_SIGN(octet *SIG, octet *M, octet *S)
+{
+    BIG s;
+    ECP2 D;
+    BLS_HASH_TO_POINT(&D, M);
+    BIG_fromBytes(s, S->val);
+    PAIR_G2mul(&D, s);
+
+    ECP2_toOctet(SIG, &D, true); /* compress output */
+    return BLS_OK;
+}
+
+/* Verify signature given message m, the signature SIG, and the public key W */
+int ZZZ::BLS_CORE_VERIFY(octet *SIG, octet *M, octet *W)
+{
+    FP12 v;
+    ECP G, PK;
+    ECP2 D, HM;
+    BLS_HASH_TO_POINT(&HM, M);
+
+    ECP2_fromOctet(&D, SIG);
+	if (!PAIR_G2member(&D)) return BLS_FAIL;
+    ECP2_neg(&D);
+
+    ECP_fromOctet(&PK, W);
+
+    if (!ECP_generator(&G)) return BLS_FAIL;
+    PAIR_double_ate(&v, &D, &G, &HM, &PK);
+
+    PAIR_fexp(&v);
+
+    if (FP12_isunity(&v)) return BLS_OK;
+    return BLS_FAIL;
+}
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/blsrev192.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/blsrev192.cpp
new file mode 100644
index 0000000..1a4cd90
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/blsrev192.cpp
@@ -0,0 +1,167 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* Boneh-Lynn-Shacham signature 192-bit API */
+
+/* Loosely (for now) following https://datatracker.ietf.org/doc/html/draft-irtf-cfrg-bls-signature-00 */
+
+// Minimal-pubkey-size variant
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include "bls192_ZZZ.h"
+
+using namespace XXX;
+using namespace YYY;
+
+#define CEIL(a,b) (((a)-1)/(b)+1)
+
+/* output u[i] \in F_p */
+/* https://datatracker.ietf.org/doc/draft-irtf-cfrg-hash-to-curve/ */
+static void hash_to_field(int hash,int hlen,FP4 *u,octet *DST,octet *M, int ctr)
+{
+    int i,j,k,L,nbq;
+    BIG q,a[4];
+    FP2 c,d;
+    DBIG dx;
+    char okm[1024],fd[128];
+    octet OKM = {0,sizeof(okm),okm};
+
+    BIG_rcopy(q, Modulus);
+    nbq=BIG_nbits(q);
+    L=CEIL(nbq+CURVE_SECURITY_ZZZ,8);
+
+    XMD_Expand(hash,hlen,&OKM,L*ctr*4,DST,M);
+    for (i=0;i<ctr;i++)
+    {
+        for (k=0;k<4;k++)
+        {
+            for (j=0;j<L;j++)
+                fd[j]=OKM.val[(4*i+k)*L+j];
+        
+            BIG_dfromBytesLen(dx,fd,L);
+            BIG_ctdmod(a[k],dx,q,8*L-nbq);
+        }
+        FP2_from_BIGs(&c,a[0],a[1]);
+        FP2_from_BIGs(&d,a[2],a[3]);
+        FP4_from_FP2s(&u[i],&c,&d);
+    }
+}
+
+/* hash a message to an ECP4 point, using SHA2, random oracle method */
+static void BLS_HASH_TO_POINT(ECP4 *P, octet *M)
+{
+    FP4 u[2];
+    ECP4 P1;
+    char dst[50];
+    octet DST = {0,sizeof(dst),dst};
+
+    OCT_jstring(&DST,(char *)"BLS_SIG_ZZZG2_XMD:SHA384-SVDW-RO-_NUL_");
+    hash_to_field(MC_SHA2,HASH_TYPE_ZZZ,u,&DST,M,2);
+
+    ECP4_map2point(P,&u[0]);
+    ECP4_map2point(&P1,&u[1]);
+
+    ECP4_add(P,&P1);
+    ECP4_cfp(P);
+    ECP4_affine(P);
+}
+
+int ZZZ::BLS_INIT()
+{
+    return BLS_OK;
+}
+
+/* generate key pair, private key S, public key W */
+int ZZZ::BLS_KEY_PAIR_GENERATE(octet *IKM, octet* S, octet *W)
+{
+    int nbr,L;
+    BIG r,s;
+    DBIG dx;
+    ECP G;
+    char salt[20],prk[HASH_TYPE_ZZZ],okm[128],aikm[65],len[2];
+    octet SALT = {0,sizeof(salt),salt};
+    octet PRK = {0,sizeof(prk),prk};
+    octet OKM = {0,sizeof(okm),okm};
+    octet AIKM = {0,sizeof(aikm),aikm};
+    octet LEN = {0,sizeof(len),len};
+
+    OCT_copy(&AIKM,IKM);
+    OCT_jbyte(&AIKM,0,1);
+
+    BIG_rcopy(r, CURVE_Order);
+    nbr=BIG_nbits(r);
+    L=CEIL(3*CEIL(nbr,8),2);
+    OCT_jint(&LEN,L,2);
+
+    if (!ECP_generator(&G)) return BLS_FAIL;
+
+    OCT_jstring(&SALT,(char *)"BLS-SIG-KEYGEN-SALT-");
+    HKDF_Extract(MC_SHA2,HASH_TYPE_ZZZ,&PRK,&SALT,&AIKM);
+    HKDF_Expand(MC_SHA2,HASH_TYPE_ZZZ,&OKM,L,&PRK,&LEN);
+
+    BIG_dfromBytesLen(dx,OKM.val,L);
+    BIG_ctdmod(s,dx,r,8*L-nbr);
+    BIG_toBytes(S->val, s);
+    S->len = MODBYTES_XXX;
+
+// SkToPk
+
+    PAIR_G1mul(&G, s);
+    ECP_toOctet(W, &G, true);
+    return BLS_OK;
+}
+
+/* Sign message M using private key S to produce signature SIG */
+
+int ZZZ::BLS_CORE_SIGN(octet *SIG, octet *M, octet *S)
+{
+    BIG s;
+    ECP4 D;
+    BLS_HASH_TO_POINT(&D, M);
+    BIG_fromBytes(s, S->val);
+    PAIR_G2mul(&D, s);
+
+    ECP4_toOctet(SIG, &D, true); /* compress output */
+    return BLS_OK;
+}
+
+/* Verify signature given message m, the signature SIG, and the public key W */
+int ZZZ::BLS_CORE_VERIFY(octet *SIG, octet *M, octet *W)
+{
+    FP24 v;
+    ECP G, PK;
+    ECP4 D, HM;
+
+    BLS_HASH_TO_POINT(&HM, M);
+
+    ECP4_fromOctet(&D, SIG);
+	if (!PAIR_G2member(&D)) return BLS_FAIL;
+    ECP4_neg(&D);
+
+    ECP_fromOctet(&PK, W);
+    if (!ECP_generator(&G)) return BLS_FAIL;
+    PAIR_double_ate(&v, &D, &G, &HM, &PK);
+
+    PAIR_fexp(&v);
+    if (FP24_isunity(&v)) return BLS_OK;
+    return BLS_FAIL;
+}
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/blsrev256.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/blsrev256.cpp
new file mode 100644
index 0000000..a6a2f59
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/blsrev256.cpp
@@ -0,0 +1,172 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* Boneh-Lynn-Shacham signature 256-bit API */
+
+/* Loosely (for now) following https://datatracker.ietf.org/doc/html/draft-irtf-cfrg-bls-signature-00 */
+
+// Minimal-pubkey-size variant
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include "bls256_ZZZ.h"
+
+using namespace XXX;
+using namespace YYY;
+
+#define CEIL(a,b) (((a)-1)/(b)+1)
+
+/* output u[i] \in F_p */
+/* https://datatracker.ietf.org/doc/draft-irtf-cfrg-hash-to-curve/ */
+static void hash_to_field(int hash,int hlen,FP8 *u,octet *DST,octet *M, int ctr)
+{
+    int i,j,k,L,nbq;
+    BIG q,a[8];
+    FP2 c,d;
+    FP4 e,f;
+    DBIG dx;
+    char okm[2048],fd[128];
+    octet OKM = {0,sizeof(okm),okm};
+
+    BIG_rcopy(q, Modulus);
+    nbq=BIG_nbits(q);
+    L=CEIL(nbq+CURVE_SECURITY_ZZZ,8);
+
+    XMD_Expand(hash,hlen,&OKM,L*ctr*8,DST,M);
+    for (i=0;i<ctr;i++)
+    {
+        for (k=0;k<8;k++)
+        {
+            for (j=0;j<L;j++)
+                fd[j]=OKM.val[(8*i+k)*L+j];
+        
+            BIG_dfromBytesLen(dx,fd,L);
+            BIG_ctdmod(a[k],dx,q,8*L-nbq);
+        }
+        FP2_from_BIGs(&c,a[0],a[1]);
+        FP2_from_BIGs(&d,a[2],a[3]);
+        FP4_from_FP2s(&e,&c,&d);
+
+        FP2_from_BIGs(&c,a[4],a[5]);
+        FP2_from_BIGs(&d,a[6],a[7]);
+        FP4_from_FP2s(&f,&c,&d);
+
+        FP8_from_FP4s(&u[i],&e,&f);
+    }
+}
+
+/* hash a message to an ECP8 point, using SHA2, random oracle method */
+static void BLS_HASH_TO_POINT(ECP8 *P, octet *M)
+{
+    FP8 u[2];
+    ECP8 P1;
+    char dst[50];
+    octet DST = {0,sizeof(dst),dst};
+
+    OCT_jstring(&DST,(char *)"BLS_SIG_ZZZG2_XMD:SHA512-SVDW-RO-_NUL_");
+    hash_to_field(MC_SHA2,HASH_TYPE_ZZZ,u,&DST,M,2);
+
+    ECP8_map2point(P,&u[0]);
+    ECP8_map2point(&P1,&u[1]);
+    ECP8_add(P,&P1);
+    ECP8_cfp(P);
+    ECP8_affine(P);
+}
+
+int ZZZ::BLS_INIT()
+{
+    return BLS_OK;
+}
+
+/* generate key pair, private key S, public key W */
+int ZZZ::BLS_KEY_PAIR_GENERATE(octet *IKM, octet* S, octet *W)
+{
+    int nbr,L;
+    BIG r,s;
+    DBIG dx;
+    ECP G;
+    char salt[20],prk[HASH_TYPE_ZZZ],okm[128],aikm[65],len[2];
+    octet SALT = {0,sizeof(salt),salt};
+    octet PRK = {0,sizeof(prk),prk};
+    octet OKM = {0,sizeof(okm),okm};
+    octet AIKM = {0,sizeof(aikm),aikm};
+    octet LEN = {0,sizeof(len),len};
+
+    OCT_copy(&AIKM,IKM);
+    OCT_jbyte(&AIKM,0,1);
+
+    BIG_rcopy(r, CURVE_Order);
+    nbr=BIG_nbits(r);
+    L=CEIL(3*CEIL(nbr,8),2);
+    OCT_jint(&LEN,L,2);
+
+    if (!ECP_generator(&G)) return BLS_FAIL;
+
+    OCT_jstring(&SALT,(char *)"BLS-SIG-KEYGEN-SALT-");
+    HKDF_Extract(MC_SHA2,HASH_TYPE_ZZZ,&PRK,&SALT,&AIKM);
+    HKDF_Expand(MC_SHA2,HASH_TYPE_ZZZ,&OKM,L,&PRK,&LEN);
+
+    BIG_dfromBytesLen(dx,OKM.val,L);
+    BIG_ctdmod(s,dx,r,8*L-nbr);
+    BIG_toBytes(S->val, s);
+    S->len = MODBYTES_XXX;
+
+// SkToPk
+
+    PAIR_G1mul(&G, s);
+    ECP_toOctet(W, &G, true);
+    return BLS_OK;
+}
+
+/* Sign message M using private key S to produce signature SIG */
+
+int ZZZ::BLS_CORE_SIGN(octet *SIG, octet *M, octet *S)
+{
+    BIG s;
+    ECP8 D;
+    BLS_HASH_TO_POINT(&D, M);
+    BIG_fromBytes(s, S->val);
+    PAIR_G2mul(&D, s);
+    ECP8_toOctet(SIG, &D, true); /* compress output */
+    return BLS_OK;
+}
+
+/* Verify signature of message m, the signature SIG, and the public key W */
+int ZZZ::BLS_CORE_VERIFY(octet *SIG, octet *M, octet *W)
+{
+    FP48 v;
+    ECP G, PK;
+    ECP8 D, HM;
+    BLS_HASH_TO_POINT(&HM, M);
+
+    ECP8_fromOctet(&D, SIG);
+	if (!PAIR_G2member(&D)) return BLS_FAIL;
+    ECP8_neg(&D);
+
+    ECP_fromOctet(&PK, W);
+
+    if (!ECP_generator(&G)) return BLS_FAIL;
+    PAIR_double_ate(&v, &D, &G, &HM, &PK);
+
+    PAIR_fexp(&v);
+    if (FP48_isunity(&v)) return BLS_OK;
+    return BLS_FAIL;
+}
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config16.py b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config16.py
new file mode 100644
index 0000000..94f2564
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config16.py
@@ -0,0 +1,744 @@
+#!/usr/bin/env python3
+
+#
+# Copyright (c) 2012-2020 MIRACL UK Ltd.
+#
+# This file is part of MIRACL Core
+# (see https://github.com/miracl/core).
+#
+# Licensed under the Apache License, Version 2.0 (the "License");
+# you may not use this file except in compliance with the License.
+# You may obtain a copy of the License at
+#
+#     http://www.apache.org/licenses/LICENSE-2.0
+#
+# Unless required by applicable law or agreed to in writing, software
+# distributed under the License is distributed on an "AS IS" BASIS,
+# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+# See the License for the specific language governing permissions and
+# limitations under the License.
+#
+
+import os
+import sys
+import shutil
+import fnmatch
+
+testing=False
+keep_querying=True
+
+if len(sys.argv)==2 :
+    if sys.argv[1]=="test":
+        testing=True
+
+my_compiler = "g++"
+generated_files = []
+
+def copy_keep_file(file, target):
+    shutil.copyfile(file, target)
+
+def copy_temp_file(file, target):
+    shutil.copyfile(file, target)
+    generated_files.append(target)
+
+def delete_file(expression):
+    for root, dirs, files in os.walk(os.path.abspath(os.path.dirname(__file__))):
+        for name in files:
+            if fnmatch.fnmatch(name, expression):
+                os.remove(os.path.join(root, name))
+
+class miracl_compile:
+    def compile_file(optim, file):
+        print("Processing " + file + "..", end = "", flush=True)
+        if optim != 0:
+            flags = " -O%d -c %s" % (optim, file)
+        else:
+            flags = " -c %s" % (file)
+        os.system(my_compiler + flags)
+        print(". [DONE]")
+
+    def compile_binary(optim, file, lib, bin):
+        print("Processing " + file + "..", end = "", flush=True)
+        if sys.platform.startswith("win"):
+            bin += ".exe"
+        if optim != 0:
+            flags = " -O%d %s %s -o %s" % (optim, file, lib, bin)
+        else:
+            flags = " %s %s -o %s" % (file, lib, bin)
+        os.system(my_compiler + flags)
+        print(". [DONE]")
+
+def inline_mul1(N,base)  :
+    str=""
+    str+="\tt=(dchunk)a[0]*b[0]; c[0]=(chunk)t & BMASK_XXX; t=t>>BASEBITS_XXX;\n"
+
+    for i in range(1,N) :
+        k=0;
+        str+="\tt=t"
+        while (k<=i) :
+            str+="+(dchunk)a[{}]*b[{}]".format(k,i-k)
+            k+=1
+        str+="; c[{}]=(chunk)t & BMASK_XXX; ".format(i)
+        str+="t=t>>BASEBITS_XXX;\n"
+
+    for i in range(N,2*N-1) :
+        k=i-(N-1)
+        str+="\tt=t"
+        while (k<=N-1) :
+            str+="+(dchunk)a[{}]*b[{}]".format(k,i-k)
+            k+=1
+        str+="; c[{}]=(chunk)t & BMASK_XXX; ".format(i)
+        str+="t=t>>BASEBITS_XXX;\n"
+
+    str+="\tc[{}]=(chunk)t;\n".format(2*N-1)
+
+    return str.replace("XXX",base)
+
+def inline_mul2(N,base)  :
+    str=""
+    for i in range(0,N) :
+        str+="\td[{}]=(dchunk)a[{}]*b[{}];\n".format(i, i, i)
+    str+="\n\ts=d[0];\n\tt = s; c[0]=(chunk)t&BMASK_XXX; co=t>>BASEBITS_XXX;\n"
+    for k in range(1,N) :
+        str+="\ts+=d[{}]; t=co+s ".format(k)
+        for i in range(k,int(k/2),-1) :
+            str+="+(dchunk)(a[{}]-a[{}])*(b[{}]-b[{}])".format(i,k - i, k - i, i)
+        str+="; c[{}]=(chunk)t&BMASK_XXX; co=t>>BASEBITS_XXX; \n".format(k)
+    str+="\n"
+    for k in range(N,2 * N - 1) :
+        str+="\ts-=d[{}]; t=co+s ".format(k - N)
+        for i in range(N-1,int(k/2),-1) :
+            str+="+(dchunk)(a[{}]-a[{}])*(b[{}]-b[{}])".format(i, k - i, k - i, i)
+        str+="; c[{}]=(chunk)t&BMASK_XXX; co=t>>BASEBITS_XXX; \n".format(k)
+
+    str+="\tc[{}]=(chunk)co;\n".format(2 * N - 1)
+    return str.replace("XXX",base)
+
+def inline_sqr(N,base) :
+    str=""
+    str+="\n\tt=(dchunk)a[0]*a[0]; c[0]=(chunk)t&BMASK_XXX; co=t>>BASEBITS_XXX;\n"
+
+    for k in range(1,N) :
+        str+="\tt= "
+        for i in range(k,int(k/2),-1) :
+            str+="+(dchunk)a[{}]*a[{}]".format(i, k - i)
+        str+="; t+=t; t+=co;"
+        if k % 2 == 0 :
+            str+=" t+=(dchunk)a[{}]*a[{}];".format(int(k/2), int(k/2))
+        str+=" c[{}]=(chunk)t&BMASK_XXX; co=t>>BASEBITS_XXX; \n".format(k)
+    str+="\n"
+
+    for k in range(N,2*N-2) :
+        str+="\tt= "
+        for i in range(N-1,int(k/2),-1) :
+            str+="+(dchunk)a[{}]*a[{}]".format(i, k - i)
+        str+="; t+=t; t+=co;"
+        if k % 2 == 0 :
+            str+=" t+=(dchunk)a[{}]*a[{}];".format(int(k/2),int(k/2))
+        str+=" c[{}]=(chunk)t&BMASK_XXX; co=t>>BASEBITS_XXX; \n".format(k)
+
+    str+="\tt=co; t+=(dchunk)a[{}]*a[{}]; c[{}]=(chunk)t&BMASK_XXX; co=t>>BASEBITS_XXX; \n ".format(N-1,N-1,2*N-2)
+
+    str+="\tc[{}]=(chunk)co;\n".format(2 * N - 1)
+    return str.replace("XXX",base)
+
+def inline_redc2(N,base) :
+    str=""
+    str+="\tt=d[0]; v[0]=((chunk)t*MC)&BMASK_XXX; t+=(dchunk)v[0]*md[0];  s=0; c=(t>>BASEBITS_XXX);\n\n"
+
+    for k in range(1,N) :
+        str+="\tt=d[{}]+c+s+(dchunk)v[0]*md[{}]".format(k, k)
+        for i in range(k-1,int(k/2),-1) :
+            str+="+(dchunk)(v[{}]-v[{}])*(md[{}]-md[{}])".format(k - i, i, i, k - i)
+        str+="; v[{}]=((chunk)t*MC)&BMASK_XXX; t+=(dchunk)v[{}]*md[0]; ".format(k, k)
+        str+=" dd[{}]=(dchunk)v[{}]*md[{}]; s+=dd[{}]; c=(t>>BASEBITS_XXX); \n".format(k, k, k, k)
+
+    str+="\n"
+    for k in range(N,2*N-1) :
+        str+="\tt=d[{}]+c+s".format(k)
+        for i in range(N-1,int(k/2),-1) :
+            str+="+(dchunk)(v[{}]-v[{}])*(md[{}]-md[{}])".format(k - i, i, i, k - i)
+        str+="; a[{}]=(chunk)t&BMASK_XXX;  s-=dd[{}]; c=(t>>BASEBITS_XXX); \n".format(k - N, k - N + 1)
+
+    str+="\ta[{}]=d[{}]+((chunk)c&BMASK_XXX);\n".format(N-1,2*N-1)
+    return str.replace("XXX",base)
+
+def inline_redc1(N,base) :
+    str=""
+
+    str+="\tt = d[0];\n"
+    str+="\tv[0] = ((chunk)t * MC)&BMASK_XXX;\n"
+    str+="\tt += (dchunk)v[0] * md[0];\n"
+    str+="\tt = (t >> BASEBITS_XXX) + d[1];\n"
+
+    for i in range(1,N) :
+        k=1
+        str+="\tt += (dchunk)v[0] * md[{}] ".format(i)
+        while k<i :
+            str+="+ (dchunk)v[{}]*md[{}]".format(k,i-k)
+            k+=1
+        str+="; v[{}] = ((chunk)t * MC)&BMASK_XXX; ".format(i)
+        str+="t += (dchunk)v[{}] * md[0]; ".format(i)
+        str+="t = (t >> BASEBITS_XXX) + d[{}];\n".format(i+1)
+
+    for i in range(N,2*N-1) :
+        k=i-(N-1)
+        str+="\tt=t "
+        while k<=N-1 :
+            str+="+ (dchunk)v[{}]*md[{}] ".format(k,i-k)
+            k+=1
+        str+="; a[{}] = (chunk)t & BMASK_XXX; ".format(i-N)
+        str+="t = (t >> BASEBITS_XXX) + d[{}];\n".format(i+1)
+
+    str+="\ta[{}] = (chunk)t & BMASK_XXX;\n".format(N-1)
+    return str.replace("XXX",base)
+
+
+def replace(namefile,oldtext,newtext):
+    f = open(namefile,'r')
+    filedata = f.read()
+    f.close()
+
+    newdata = filedata.replace(oldtext,newtext)
+
+    f = open(namefile,'w')
+    f.write(newdata)
+    f.close()
+
+# rsaset(big,ring,bit_bits_in_base,multiplier)
+# for each choice give distinct names for "big" and "ring".
+# Typically "big" is the length in bits of the underlying big number type
+# "ring" is the RSA modulus size = "big" times 2^m
+# Next give the number base used for 32 bit architectures, as n where the base is 2^n
+# multiplier is 2^m (see above)
+def rsaset(tb,tff,base,ml) :
+
+    itb=int(tb)
+    inb=int(itb/8)
+    nb=str(inb)
+    ib=int(base)
+    inb=int(nb)
+
+    nlen=(1+((8*inb-1)//ib))
+
+    bd="B"+tb+"_"+base
+    fnameh="config_big_"+bd+".h"
+    copy_keep_file("config_big.h", fnameh)
+    replace(fnameh,"XXX",bd)
+    replace(fnameh,"@NB@",nb)
+    replace(fnameh,"@BASE@",base)
+
+    fnameh="config_ff_"+tff+".h"
+    copy_keep_file("config_ff.h", fnameh)
+    replace(fnameh,"XXX",bd)
+    replace(fnameh,"WWW",tff)
+    replace(fnameh,"@ML@",ml);
+
+    fnamec="big_"+bd+".cpp"
+    fnameh="big_"+bd+".h"
+
+    copy_temp_file("big.cpp", fnamec)
+    copy_keep_file("big.h", fnameh)
+
+    replace(fnamec,"XXX",bd)
+    replace(fnameh,"XXX",bd)
+
+    replace(fnamec,"INLINE_MUL1",inline_mul1(nlen,bd))
+    replace(fnamec,"INLINE_MUL2",inline_mul2(nlen,bd))
+    replace(fnamec,"INLINE_SQR",inline_sqr(nlen,bd))
+    replace(fnamec,"INLINE_REDC1",inline_redc1(nlen,bd))
+    replace(fnamec,"INLINE_REDC2",inline_redc2(nlen,bd))
+
+    miracl_compile.compile_file(3, fnamec)
+
+    fnamec="ff_"+tff+".cpp"
+    fnameh="ff_"+tff+".h"
+
+    copy_temp_file("ff.cpp", fnamec)
+    copy_keep_file("ff.h", fnameh)
+
+    replace(fnamec,"WWW",tff)
+    replace(fnamec,"XXX",bd)
+    replace(fnameh,"WWW",tff)
+    replace(fnameh,"XXX",bd)
+    miracl_compile.compile_file(3, fnamec)
+
+    fnamec="rsa_"+tff+".cpp"
+    fnameh="rsa_"+tff+".h"
+
+    copy_temp_file("rsa.cpp", fnamec)
+    copy_keep_file("rsa.h", fnameh)
+
+    replace(fnamec,"WWW",tff)
+    replace(fnamec,"XXX",bd)
+    replace(fnameh,"WWW",tff)
+    replace(fnameh,"XXX",bd)
+    miracl_compile.compile_file(3, fnamec)
+
+# curveset(modulus_bits,field,curve,bits_in_base,modulus_mod_8,Z,modulus_type,curve_type,Curve A,pairing_friendly,sextic twist,sign of x,g2_table size,ate bits,curve security)
+# for each curve give names for field and curve. In many cases the latter two will be the same.
+# modulus_bits is the bit length of the modulus, typically the same or slightly smaller than "big"
+# Typically "field" describes the modulus, and "curve" is the common name for the elliptic curve
+# Next give the number base used for 32 bit architecture, as n where the base is 2^n (note that these must be fixed for the same "big" name, if is ever re-used for another curve)
+# m8 max m such that 2^m | modulus-1
+# rz Z value for hash_to_point, If list G1 Z value is in [0], G2 Z value (=a+bz) is in [1], [2]
+# modulus_type is NOT_SPECIAL, or PSEUDO_MERSENNE, or MONTGOMERY_Friendly, or GENERALISED_MERSENNE (supported for Ed448 only)
+# i for Fp2 QNR 2^i+sqrt(-1) (relevant for PFCs only, else =0). Or QNR over Fp if p=1 mod 8
+# curve_type is WEIERSTRASS, EDWARDS or MONTGOMERY
+# Curve A parameter
+# pairing_friendly is BN, BLS or NOT (if not pairing friendly)
+# if pairing friendly. M or D type twist, and sign of the family parameter x
+# g2_table size is number of entries in precomputed table
+# ate bits is number of bits in Ate parameter (from romgen program)
+# curve security is AES equivalent, rounded up.
+def curveset(nbt,tf,tc,base,m8,rz,mt,qi,ct,ca,pf,stw,sx,g2,ab,cs) :
+    inbt=int(nbt)
+    itb=int(inbt+(8-inbt%8)%8)
+    inb=int(itb/8)
+    tb=str(itb)
+    nb=str(inb)
+
+    bd="B"+tb+"_"+base
+    fnameh="config_big_"+bd+".h"
+    copy_keep_file("config_big.h", fnameh)
+
+    replace(fnameh,"XXX",bd)
+    replace(fnameh,"@NB@",nb)
+    replace(fnameh,"@BASE@",base)
+
+    fnameh="config_field_"+tf+".h"
+    copy_keep_file("config_field.h", fnameh)
+
+    replace(fnameh,"XXX",bd)
+    replace(fnameh,"YYY",tf)
+    replace(fnameh,"@NBT@",nbt)
+    replace(fnameh,"@M8@",m8)
+    replace(fnameh,"@MT@",mt)
+    hc="0"
+    hc2="0"
+# Get Hash-to-Curve Z for G1 and G2
+
+    if isinstance(rz,list) :
+        if len(rz)==2 :     # Z followed by SSWU isogeny degree
+            replace(fnameh,"@RZ@",rz[0])
+            replace(fnameh,"@RZ2A@","0")
+            replace(fnameh,"@RZ2B@","0")
+            hc=rz[1]
+        if len(rz)==3 :     # Z for G1 followed by Z for G2 (for SVDW)
+            replace(fnameh,"@RZ@",rz[0])
+            replace(fnameh,"@RZ2A@",rz[1])
+            replace(fnameh,"@RZ2B@",rz[2])
+        if len(rz)==5 :     # Z for G1, Z for G2, SSWU isogeny degree for G1, SSWU isogeny degree for G2
+            replace(fnameh,"@RZ@",rz[0])
+            replace(fnameh,"@RZ2A@",rz[1])
+            replace(fnameh,"@RZ2B@",rz[2])
+            hc=rz[3]
+            hc2=rz[4]
+    else :
+        replace(fnameh,"@RZ@",rz)   # just Z for SSWU, or indicates RFC7748 or Generic for Elligator
+        replace(fnameh,"@RZ2A@","0")
+        replace(fnameh,"@RZ2B@","0")
+
+    itw=int(qi)%10
+    replace(fnameh,"@QI@",str(itw))
+    if int(qi)//10 > 0 :
+        replace(fnameh,"@TW@","POSITOWER")
+    else :
+        replace(fnameh,"@TW@","NEGATOWER")
+
+    ib=int(base)
+    inb=int(nb)
+    inbt=int(nbt)
+    nlen=(1+((8*inb-1)//ib))
+    sh=ib*nlen-inbt
+
+    if sh > 6 :
+        sh=6
+    replace(fnameh,"@SH@",str(sh))
+
+    fnameh="config_curve_"+tc+".h"
+    copy_keep_file("config_curve.h", fnameh)
+
+    replace(fnameh,"XXX",bd)
+    replace(fnameh,"YYY",tf)
+    replace(fnameh,"ZZZ",tc)
+    replace(fnameh,"@CT@",ct)
+    replace(fnameh,"@CA@",ca)
+    replace(fnameh,"@PF@",pf)
+
+    replace(fnameh,"@ST@",stw)
+    replace(fnameh,"@SX@",sx)
+    replace(fnameh,"@CS@",cs)
+    replace(fnameh,"@AB@",ab)
+    replace(fnameh,"@G2@",g2)
+
+    replace(fnameh,"@HC@",hc)
+    replace(fnameh,"@HC2@",hc2)
+
+    fnamec="big_"+bd+".cpp"
+    fnameh="big_"+bd+".h"
+
+    copy_temp_file("big.cpp", fnamec)
+    copy_keep_file("big.h", fnameh)
+
+    replace(fnamec,"XXX",bd)
+    replace(fnameh,"XXX",bd)
+
+    replace(fnamec,"INLINE_MUL1",inline_mul1(nlen,bd))
+    replace(fnamec,"INLINE_MUL2",inline_mul2(nlen,bd))
+    replace(fnamec,"INLINE_SQR",inline_sqr(nlen,bd))
+    replace(fnamec,"INLINE_REDC1",inline_redc1(nlen,bd))
+    replace(fnamec,"INLINE_REDC2",inline_redc2(nlen,bd))
+
+    miracl_compile.compile_file(3, fnamec)
+
+    fnamec="fp_"+tf+".cpp"
+    fnameh="fp_"+tf+".h"
+
+    copy_temp_file("fp.cpp", fnamec)
+    copy_keep_file("fp.h", fnameh)
+
+    replace(fnamec,"YYY",tf)
+    replace(fnamec,"XXX",bd)
+    replace(fnameh,"YYY",tf)
+    replace(fnameh,"XXX",bd)
+    miracl_compile.compile_file(3, fnamec)
+
+    miracl_compile.compile_file(3, "rom_field_"+tf+".cpp");
+
+    fnamec="ecp_"+tc+".cpp"
+    fnameh="ecp_"+tc+".h"
+
+    copy_temp_file("ecp.cpp", fnamec)
+    copy_keep_file("ecp.h", fnameh)
+
+    replace(fnamec,"ZZZ",tc)
+    replace(fnamec,"YYY",tf)
+    replace(fnamec,"XXX",bd)
+    replace(fnameh,"ZZZ",tc)
+    replace(fnameh,"YYY",tf)
+    replace(fnameh,"XXX",bd)
+    miracl_compile.compile_file(3, fnamec)
+
+    fnamec="ecdh_"+tc+".cpp"
+    fnameh="ecdh_"+tc+".h"
+
+    copy_temp_file("ecdh.cpp", fnamec)
+    copy_keep_file("ecdh.h", fnameh)
+
+    replace(fnamec,"ZZZ",tc)
+    replace(fnamec,"YYY",tf)
+    replace(fnamec,"XXX",bd)
+    replace(fnameh,"ZZZ",tc)
+    replace(fnameh,"YYY",tf)
+    replace(fnameh,"XXX",bd)
+    miracl_compile.compile_file(3, fnamec)
+
+    miracl_compile.compile_file(3, "rom_curve_"+tc+".cpp");
+
+    if pf != "NOT_PF" :
+        fnamec="fp2_"+tf+".cpp"
+        fnameh="fp2_"+tf+".h"
+
+        copy_temp_file("fp2.cpp", fnamec)
+        copy_keep_file("fp2.h", fnameh)
+
+        replace(fnamec,"YYY",tf)
+        replace(fnamec,"XXX",bd)
+        replace(fnameh,"YYY",tf)
+        replace(fnameh,"XXX",bd)
+        miracl_compile.compile_file(3, fnamec)
+
+        fnamec="fp4_"+tf+".cpp"
+        fnameh="fp4_"+tf+".h"
+
+        copy_temp_file("fp4.cpp", fnamec)
+        copy_keep_file("fp4.h", fnameh)
+
+        replace(fnamec,"YYY",tf)
+        replace(fnamec,"XXX",bd)
+        replace(fnamec,"ZZZ",tc)
+        replace(fnameh,"YYY",tf)
+        replace(fnameh,"XXX",bd)
+        replace(fnameh,"ZZZ",tc)
+        miracl_compile.compile_file(3, fnamec)
+
+        fnamec="fp12_"+tf+".cpp"
+        fnameh="fp12_"+tf+".h"
+
+        copy_temp_file("fp12.cpp", fnamec)
+        copy_keep_file("fp12.h", fnameh)
+
+        replace(fnamec,"YYY",tf)
+        replace(fnamec,"XXX",bd)
+        replace(fnamec,"ZZZ",tc)
+        replace(fnameh,"YYY",tf)
+        replace(fnameh,"XXX",bd)
+        replace(fnameh,"ZZZ",tc)
+        miracl_compile.compile_file(3, fnamec)
+
+        fnamec="ecp2_"+tc+".cpp"
+        fnameh="ecp2_"+tc+".h"
+
+        copy_temp_file("ecp2.cpp", fnamec)
+        copy_keep_file("ecp2.h", fnameh)
+
+        replace(fnamec,"ZZZ",tc)
+        replace(fnamec,"YYY",tf)
+        replace(fnamec,"XXX",bd)
+        replace(fnameh,"ZZZ",tc)
+        replace(fnameh,"YYY",tf)
+        replace(fnameh,"XXX",bd)
+        miracl_compile.compile_file(3, fnamec)
+
+        fnamec="pair_"+tc+".cpp"
+        fnameh="pair_"+tc+".h"
+
+        copy_temp_file("pair.cpp", fnamec)
+        copy_keep_file("pair.h", fnameh)
+
+        replace(fnamec,"ZZZ",tc)
+        replace(fnamec,"YYY",tf)
+        replace(fnamec,"XXX",bd)
+        replace(fnameh,"ZZZ",tc)
+        replace(fnameh,"YYY",tf)
+        replace(fnameh,"XXX",bd)
+        miracl_compile.compile_file(3, fnamec)
+
+        fnamec="mpin_"+tc+".cpp"
+        fnameh="mpin_"+tc+".h"
+
+        copy_temp_file("mpin.cpp", fnamec)
+        copy_keep_file("mpin.h", fnameh)
+
+        replace(fnamec,"ZZZ",tc)
+        replace(fnamec,"YYY",tf)
+        replace(fnamec,"XXX",bd)
+        replace(fnameh,"ZZZ",tc)
+        replace(fnameh,"YYY",tf)
+        replace(fnameh,"XXX",bd)
+        miracl_compile.compile_file(3, fnamec)
+
+        fnamec="bls_"+tc+".cpp"
+        fnameh="bls_"+tc+".h"
+
+        copy_temp_file("bls.cpp", fnamec)
+        copy_keep_file("bls.h", fnameh)
+
+        replace(fnamec,"ZZZ",tc)
+        replace(fnamec,"YYY",tf)
+        replace(fnamec,"XXX",bd)
+        replace(fnameh,"ZZZ",tc)
+        replace(fnameh,"YYY",tf)
+        replace(fnameh,"XXX",bd)
+        miracl_compile.compile_file(3, fnamec)
+
+replace("arch.h","@WL@","16")
+
+class miracl_crypto:
+    np_curves = (
+        ( "255", "F25519", "Ed25519", "13", "2", "1", "PSEUDO_MERSENNE", "0", "EDWARDS", "-1", "NOT_PF", "", "", "", "", "128"),
+        ( "256", "F256PME", "NUMS256E", "13", "1", "1", "PSEUDO_MERSENNE", "0", "EDWARDS", "1", "NOT_PF", "", "", "", "", "128"),
+        ( "160", "SECP160R1", "SECP160R1", "13", "1", "3", "NOT_SPECIAL", "0", "WEIERSTRASS", "-3", "NOT_PF", "", "", "", "", "128")
+    )
+
+    pf_curves = (
+        ( "254", "BN254", "BN254", "13", "1",["-1", "-1", "0"],"NOT_SPECIAL", "0", "WEIERSTRASS", "0", "BN_CURVE", "D_TYPE", "NEGATIVEX", "71", "66", "128"),
+        ( "254", "BN254CX", "BN254CX", "13", "1",["-1", "-1", "0"],"NOT_SPECIAL", "0", "WEIERSTRASS", "0", "BN_CURVE", "D_TYPE", "NEGATIVEX", "76", "66", "128")
+    )
+
+    # There are choices here, different ways of getting the same result, but some faster than others
+    rsa_params = (
+        # 256 is slower but may allow reuse of 256-bit BIGs used for elliptic curve
+        # 512 is faster.. but best is 1024
+        ( "256", "RSA2048", "13", "8")
+    )
+
+    total_entries = len(np_curves)+len(pf_curves)+len(rsa_params)
+
+    def valid_query(number):
+        return number >= 0 and number <= miracl_crypto.total_entries
+
+def interactive_prompt_print():
+    index = 1
+    print("Elliptic Curves")
+    for tuple in miracl_crypto.np_curves:
+        print(str(index) + ".", tuple[2])
+        index += 1
+
+    print("\nPairing-Friendly Elliptic Curves")
+    for tuple in miracl_crypto.pf_curves:
+        print(str(index) + ".", tuple[2])
+        index += 1
+
+    print("\nRSA")
+    # Python interprets the singular RSA entry in a way
+    # that doesn't allow for nested tuples if there aren't
+    # more than one entry, the original code has been commented
+    # out and replaced with a subpar fix
+    #
+    # If you are adding more RSA curves, it will error out
+    # Uncomment the original code if you intend to do so and
+    # comment out the patch
+    #
+    # for tuple in miracl_crypto.rsa_params:
+    #    print(str(index) + ".", "RSA" + str(tuple[1]))
+    #    index += 1
+    # ----BEGIN PATCH-------------
+    print(str(index) + ".", miracl_crypto.rsa_params[1])
+    index += 1
+    # ----END   PATCH--------------
+
+def interactive_prompt_exect(index):
+    index -= 1 # Python internally is zero-indexed
+    if index < len(miracl_crypto.np_curves):
+        tuple = miracl_crypto.np_curves[index]
+        curveset(
+            tuple[0], tuple[1], tuple[2], tuple[3], tuple[4],
+            tuple[5], tuple[6], tuple[7], tuple[8], tuple[9],
+            tuple[10], tuple[11], tuple[12],
+            tuple[13], tuple[14], tuple[15]
+        )
+    elif index < len(miracl_crypto.np_curves) + len(miracl_crypto.pf_curves):
+        tuple = miracl_crypto.pf_curves[index-len(miracl_crypto.np_curves)]
+        curveset(
+            tuple[0], tuple[1], tuple[2], tuple[3], tuple[4],
+            tuple[5], tuple[6], tuple[7], tuple[8], tuple[9],
+            tuple[10], tuple[11], tuple[12],
+            tuple[13], tuple[14], tuple[15]
+        )
+    else:
+        # Python interprets the singular RSA entry in a way
+        # that doesn't allow for nested tuples if there aren't
+        # more than one entry, the original code has been commented
+        # out and replaced with a subpar fix
+        #
+        # If you are adding more RSA curves, it will error out
+        # Uncomment the original code if you intend to do so and
+        # comment out the patch
+        #
+        # tuple = miracl_crypto.rsa_params[index-(len(miracl_crypto.np_curves)+len(miracl_crypto.pf_curves))]
+        # rsaset(
+        #     tuple[0], tuple[1], tuple[2], tuple[3]
+        # )
+        # ----BEGIN PATCH-------------
+        rsaset(
+            miracl_crypto.rsa_params[0], miracl_crypto.rsa_params[1], miracl_crypto.rsa_params[2], miracl_crypto.rsa_params[3]
+        )
+        # ----END   PATCH--------------
+
+def interactive_prompt_input():
+    while True:
+        userInput = input("\nChoose schemes to support (select 0 to finish): ")
+        try:
+            return int(userInput)
+        except:
+            if (userInput == ''):
+                return 0
+            print("Non-integer input, select values between 1 and " + str(miracl_crypto.total_entries))
+            interactive_prompt_input()
+
+interactive_prompt_print()
+while keep_querying and not testing:
+    query_val = -1
+    while not miracl_crypto.valid_query(query_val):
+        query_val = interactive_prompt_input()
+        if not miracl_crypto.valid_query(query_val):
+            print("Number out of range, select values between 1 and " + str(miracl_crypto.total_entries))
+        elif query_val == 0:
+            keep_querying = False
+        else:
+            interactive_prompt_exect(query_val)
+
+if testing:
+    for i in range(0, miracl_crypto.total_entries):
+        interactive_prompt_exect(i+1)
+
+# create library
+miracl_compile.compile_file(3, "randapi.cpp")
+miracl_compile.compile_file(3, "hash.cpp")
+miracl_compile.compile_file(3, "hmac.cpp")
+miracl_compile.compile_file(3, "rand.cpp")
+miracl_compile.compile_file(3, "oct.cpp")
+miracl_compile.compile_file(3, "share.cpp")
+miracl_compile.compile_file(3, "aes.cpp")
+miracl_compile.compile_file(3, "gcm.cpp")
+miracl_compile.compile_file(3, "newhope.cpp")
+miracl_compile.compile_file(3, "dilithium.cpp")
+miracl_compile.compile_file(3, "kyber.cpp")
+miracl_compile.compile_file(3, "x509.cpp")
+
+if sys.platform.startswith("win") :
+    os.system("for %i in (*.o) do @echo %~nxi >> f.list")
+    os.system("ar rc core.a @f.list")
+    delete_file("f.list")
+else :
+    os.system("ar rc core.a *.o")
+
+if testing :
+    miracl_compile.compile_binary(2, "testecc.cpp", "core.a", "testecc")
+    miracl_compile.compile_binary(2, "testmpin.cpp", "core.a", "testmpin")
+    miracl_compile.compile_binary(2, "testbls.cpp", "core.a", "testbls")
+    miracl_compile.compile_binary(2, "benchtest_all.cpp", "core.a", "benchtest_all")
+
+#clean up
+for file in generated_files:
+    delete_file(file)
+
+delete_file("*.o")
+delete_file("big.*")
+delete_file("fp.*")
+delete_file("ecp.*")
+delete_file("ecdh.*")
+delete_file("hpke.*")
+delete_file("ff.*")
+delete_file("rsa.*")
+delete_file("config_big.h")
+delete_file("config_field.h")
+delete_file("config_curve.h")
+delete_file("config_ff.h")
+delete_file("fp2.*")
+delete_file("fp4.*")
+delete_file("fp8.*")
+delete_file("fp16.*")
+delete_file("share.cpp")
+delete_file("x509.cpp")
+delete_file("gcm.cpp")
+delete_file("hash.cpp")
+delete_file("hmac.cpp")
+delete_file("aes.cpp")
+delete_file("oct.cpp");
+delete_file("newhope.cpp")
+delete_file("dilithium.cpp")
+delete_file("kyber.cpp")
+delete_file("Doxyfile")
+delete_file("refman.pdf")
+delete_file("readme.md")
+delete_file("rand.cpp")
+delete_file("randapi.cpp")
+delete_file("config*.py")
+
+delete_file("fp12.*")
+delete_file("fp24.*")
+delete_file("fp48.*")
+
+delete_file("ecp2.*")
+delete_file("ecp4.*")
+delete_file("ecp8.*")
+
+delete_file("pair.*")
+delete_file("mpin.*")
+delete_file("bls.*")
+
+delete_file("pair4.*")
+delete_file("mpin192.*")
+delete_file("bls192.*")
+
+delete_file("pair8.*")
+delete_file("mpin256.*")
+delete_file("bls256.*")
+
+delete_file("rom_field*.cpp")
+delete_file("rom_curve*.cpp")
+
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config32.py b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config32.py
new file mode 100644
index 0000000..38e83a1
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config32.py
@@ -0,0 +1,983 @@
+#!/usr/bin/env python3
+
+#
+# Copyright (c) 2012-2020 MIRACL UK Ltd.
+#
+# This file is part of MIRACL Core
+# (see https://github.com/miracl/core).
+#
+# Licensed under the Apache License, Version 2.0 (the "License");
+# you may not use this file except in compliance with the License.
+# You may obtain a copy of the License at
+#
+#     http://www.apache.org/licenses/LICENSE-2.0
+#
+# Unless required by applicable law or agreed to in writing, software
+# distributed under the License is distributed on an "AS IS" BASIS,
+# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+# See the License for the specific language governing permissions and
+# limitations under the License.
+#
+
+import os
+import sys
+import shutil
+import fnmatch
+
+testing=False
+keep_querying=True
+
+if len(sys.argv)==2 :
+    if sys.argv[1]=="test":
+        testing=True
+
+my_compiler = "g++"
+generated_files = []
+
+def copy_keep_file(file, target):
+    shutil.copyfile(file, target)
+
+def copy_temp_file(file, target):
+    shutil.copyfile(file, target)
+    generated_files.append(target)
+
+def delete_file(expression):
+    for root, dirs, files in os.walk(os.path.abspath(os.path.dirname(__file__))):
+        for name in files:
+            if fnmatch.fnmatch(name, expression):
+                os.remove(os.path.join(root, name))
+
+class miracl_compile:
+    def compile_file(optim, file):
+        print("Processing " + file + "..", end = "", flush=True)
+        if optim != 0:
+            flags = " -O%d -c %s" % (optim, file)
+        else:
+            flags = "  -c %s" % (file)
+        os.system(my_compiler + flags)
+        print(". [DONE]")
+
+    def compile_binary(optim, file, lib, bin):
+        print("Processing " + file + "..", end = "", flush=True)
+        if sys.platform.startswith("win"):
+            bin += ".exe"
+        if optim != 0:
+            flags = "  -O%d %s %s -o %s" % (optim, file, lib, bin)
+        else:
+            flags = "  %s %s -o %s" % (file, lib, bin)
+        os.system(my_compiler + flags)
+        print(". [DONE]")
+
+def inline_mul1(N,base)  :
+    str=""
+    str+="\tt=(dchunk)a[0]*b[0]; c[0]=(chunk)t & BMASK_XXX; t=t>>BASEBITS_XXX;\n"
+
+    for i in range(1,N) :
+        k=0;
+        str+="\tt=t"
+        while (k<=i) :
+            str+="+(dchunk)a[{}]*b[{}]".format(k,i-k)
+            k+=1
+        str+="; c[{}]=(chunk)t & BMASK_XXX; ".format(i)
+        str+="t=t>>BASEBITS_XXX;\n"
+
+    for i in range(N,2*N-1) :
+        k=i-(N-1)
+        str+="\tt=t"
+        while (k<=N-1) :
+            str+="+(dchunk)a[{}]*b[{}]".format(k,i-k)
+            k+=1
+        str+="; c[{}]=(chunk)t & BMASK_XXX; ".format(i)
+        str+="t=t>>BASEBITS_XXX;\n"
+
+    str+="\tc[{}]=(chunk)t;\n".format(2*N-1)
+
+    return str.replace("XXX",base)
+
+def inline_mul2(N,base)  :
+    str=""
+    for i in range(0,N) :
+        str+="\td[{}]=(dchunk)a[{}]*b[{}];\n".format(i, i, i)
+    str+="\n\ts=d[0];\n\tt = s; c[0]=(chunk)t&BMASK_XXX; co=t>>BASEBITS_XXX;\n"
+    for k in range(1,N) :
+        str+="\ts+=d[{}]; t=co+s ".format(k)
+        for i in range(k,int(k/2),-1) :
+            str+="+(dchunk)(a[{}]-a[{}])*(b[{}]-b[{}])".format(i,k - i, k - i, i)
+        str+="; c[{}]=(chunk)t&BMASK_XXX; co=t>>BASEBITS_XXX; \n".format(k)
+    str+="\n"
+    for k in range(N,2 * N - 1) :
+        str+="\ts-=d[{}]; t=co+s ".format(k - N)
+        for i in range(N-1,int(k/2),-1) :
+            str+="+(dchunk)(a[{}]-a[{}])*(b[{}]-b[{}])".format(i, k - i, k - i, i)
+        str+="; c[{}]=(chunk)t&BMASK_XXX; co=t>>BASEBITS_XXX; \n".format(k)
+
+    str+="\tc[{}]=(chunk)co;\n".format(2 * N - 1)
+    return str.replace("XXX",base)
+
+def inline_sqr(N,base) :
+    str=""
+    str+="\n\tt=(dchunk)a[0]*a[0]; c[0]=(chunk)t&BMASK_XXX; co=t>>BASEBITS_XXX;\n"
+
+    for k in range(1,N) :
+        str+="\tt= "
+        for i in range(k,int(k/2),-1) :
+            str+="+(dchunk)a[{}]*a[{}]".format(i, k - i)
+        str+="; t+=t; t+=co;"
+        if k % 2 == 0 :
+            str+=" t+=(dchunk)a[{}]*a[{}];".format(int(k/2), int(k/2))
+        str+=" c[{}]=(chunk)t&BMASK_XXX; co=t>>BASEBITS_XXX; \n".format(k)
+    str+="\n"
+
+    for k in range(N,2*N-2) :
+        str+="\tt= "
+        for i in range(N-1,int(k/2),-1) :
+            str+="+(dchunk)a[{}]*a[{}]".format(i, k - i)
+        str+="; t+=t; t+=co;"
+        if k % 2 == 0 :
+            str+=" t+=(dchunk)a[{}]*a[{}];".format(int(k/2),int(k/2))
+        str+=" c[{}]=(chunk)t&BMASK_XXX; co=t>>BASEBITS_XXX; \n".format(k)
+
+    str+="\tt=co; t+=(dchunk)a[{}]*a[{}]; c[{}]=(chunk)t&BMASK_XXX; co=t>>BASEBITS_XXX; \n ".format(N-1,N-1,2*N-2)
+
+    str+="\tc[{}]=(chunk)co;\n".format(2 * N - 1)
+    return str.replace("XXX",base)
+
+def inline_redc2(N,base) :
+    str=""
+    str+="\tt=d[0]; v[0]=((chunk)t*MC)&BMASK_XXX; t+=(dchunk)v[0]*md[0];  s=0; c=(t>>BASEBITS_XXX);\n\n"
+
+    for k in range(1,N) :
+        str+="\tt=d[{}]+c+s+(dchunk)v[0]*md[{}]".format(k, k)
+        for i in range(k-1,int(k/2),-1) :
+            str+="+(dchunk)(v[{}]-v[{}])*(md[{}]-md[{}])".format(k - i, i, i, k - i)
+        str+="; v[{}]=((chunk)t*MC)&BMASK_XXX; t+=(dchunk)v[{}]*md[0]; ".format(k, k)
+        str+=" dd[{}]=(dchunk)v[{}]*md[{}]; s+=dd[{}]; c=(t>>BASEBITS_XXX); \n".format(k, k, k, k)
+
+    str+="\n"
+    for k in range(N,2*N-1) :
+        str+="\tt=d[{}]+c+s".format(k)
+        for i in range(N-1,int(k/2),-1) :
+            str+="+(dchunk)(v[{}]-v[{}])*(md[{}]-md[{}])".format(k - i, i, i, k - i)
+        str+="; a[{}]=(chunk)t&BMASK_XXX;  s-=dd[{}]; c=(t>>BASEBITS_XXX); \n".format(k - N, k - N + 1)
+
+    str+="\ta[{}]=d[{}]+((chunk)c&BMASK_XXX);\n".format(N-1,2*N-1)
+    return str.replace("XXX",base)
+
+def inline_redc1(N,base) :
+    str=""
+
+    str+="\tt = d[0];\n"
+    str+="\tv[0] = ((chunk)t * MC)&BMASK_XXX;\n"
+    str+="\tt += (dchunk)v[0] * md[0];\n"
+    str+="\tt = (t >> BASEBITS_XXX) + d[1];\n"
+
+    for i in range(1,N) :
+        k=1
+        str+="\tt += (dchunk)v[0] * md[{}] ".format(i)
+        while k<i :
+            str+="+ (dchunk)v[{}]*md[{}]".format(k,i-k)
+            k+=1
+        str+="; v[{}] = ((chunk)t * MC)&BMASK_XXX; ".format(i)
+        str+="t += (dchunk)v[{}] * md[0]; ".format(i)
+        str+="t = (t >> BASEBITS_XXX) + d[{}];\n".format(i+1)
+
+    for i in range(N,2*N-1) :
+        k=i-(N-1)
+        str+="\tt=t "
+        while k<=N-1 :
+            str+="+ (dchunk)v[{}]*md[{}] ".format(k,i-k)
+            k+=1
+        str+="; a[{}] = (chunk)t & BMASK_XXX; ".format(i-N)
+        str+="t = (t >> BASEBITS_XXX) + d[{}];\n".format(i+1)
+
+    str+="\ta[{}] = (chunk)t & BMASK_XXX;\n".format(N-1)
+    return str.replace("XXX",base)
+
+
+def replace(namefile,oldtext,newtext):
+    f = open(namefile,'r')
+    filedata = f.read()
+    f.close()
+
+    newdata = filedata.replace(oldtext,newtext)
+
+    f = open(namefile,'w')
+    f.write(newdata)
+    f.close()
+
+# rsaset(big,ring,bit_bits_in_base,multiplier)
+# for each choice give distinct names for "big" and "ring".
+# Typically "big" is the length in bits of the underlying big number type
+# "ring" is the RSA modulus size = "big" times 2^m
+# Next give the number base used for 32 bit architectures, as n where the base is 2^n
+# multiplier is 2^m (see above)
+def rsaset(tb,tff,base,ml) :
+    itb=int(tb)
+    inb=int(itb/8)
+    nb=str(inb)
+    ib=int(base)
+    inb=int(nb)
+
+    nlen=(1+((8*inb-1)//ib))
+
+    bd="B"+tb+"_"+base
+    fnameh="config_big_"+bd+".h"
+    copy_keep_file("config_big.h", fnameh)
+    replace(fnameh,"XXX",bd)
+    replace(fnameh,"@NB@",nb)
+    replace(fnameh,"@BASE@",base)
+
+    fnameh="config_ff_"+tff+".h"
+    copy_keep_file("config_ff.h", fnameh)
+    replace(fnameh,"XXX",bd)
+    replace(fnameh,"WWW",tff)
+    replace(fnameh,"@ML@",ml);
+
+    fnamec="big_"+bd+".cpp"
+    fnameh="big_"+bd+".h"
+
+    copy_temp_file("big.cpp", fnamec)
+    copy_keep_file("big.h", fnameh)
+
+    replace(fnamec,"XXX",bd)
+    replace(fnameh,"XXX",bd)
+
+    replace(fnamec,"INLINE_MUL1",inline_mul1(nlen,bd))
+    replace(fnamec,"INLINE_MUL2",inline_mul2(nlen,bd))
+    replace(fnamec,"INLINE_SQR",inline_sqr(nlen,bd))
+    replace(fnamec,"INLINE_REDC1",inline_redc1(nlen,bd))
+    replace(fnamec,"INLINE_REDC2",inline_redc2(nlen,bd))
+
+
+    miracl_compile.compile_file(3, fnamec)
+
+    fnamec="ff_"+tff+".cpp"
+    fnameh="ff_"+tff+".h"
+
+    copy_temp_file("ff.cpp", fnamec)
+    copy_keep_file("ff.h", fnameh)
+
+    replace(fnamec,"WWW",tff)
+    replace(fnamec,"XXX",bd)
+    replace(fnameh,"WWW",tff)
+    replace(fnameh,"XXX",bd)
+    miracl_compile.compile_file(3, fnamec)
+
+    fnamec="rsa_"+tff+".cpp"
+    fnameh="rsa_"+tff+".h"
+
+    copy_temp_file("rsa.cpp", fnamec)
+    copy_keep_file("rsa.h", fnameh)
+
+    replace(fnamec,"WWW",tff)
+    replace(fnamec,"XXX",bd)
+    replace(fnameh,"WWW",tff)
+    replace(fnameh,"XXX",bd)
+    miracl_compile.compile_file(3, fnamec)
+
+# curveset(modulus_bits,field,curve,bits_in_base,modulus_mod_8,Z,modulus_type,curve_type,Curve A,pairing_friendly,sextic twist,sign of x,g2_table size,ate bits,curve security)
+# for each curve give names for field and curve. In many cases the latter two will be the same.
+# modulus_bits is the bit length of the modulus, typically the same or slightly smaller than "big"
+# Typically "field" describes the modulus, and "curve" is the common name for the elliptic curve
+# Next give the number base used for 32 bit architecture, as n where the base is 2^n (note that these must be fixed for the same "big" name, if is ever re-used for another curve)
+# m8 max m such that 2^m | modulus-1
+# rz Z value for hash_to_point, If list G1 Z value is in [0], G2 Z value (=a+bz) is in [1], [2]
+# modulus_type is NOT_SPECIAL, or PSEUDO_MERSENNE, or MONTGOMERY_Friendly, or GENERALISED_MERSENNE (supported for Ed448 only)
+# i for Fp2 QNR 2^i+sqrt(-1) (relevant for PFCs only, else =0). Or QNR over Fp if p=1 mod 8
+# curve_type is WEIERSTRASS, EDWARDS or MONTGOMERY
+# Curve A parameter
+# pairing_friendly is BN_CURVE, BLS_CURVE or NOT_PF (if not pairing friendly)
+# if pairing friendly. M or D type twist, and sign of the family parameter x
+# g2_table size is number of entries in precomputed table
+# ate bits is number of bits in Ate parameter (from romgen program)
+# curve security is AES equiavlent, rounded up.
+def curveset(nbt,tf,tc,base,m8,rz,mt,qi,ct,ca,pf,stw,sx,g2,ab,cs) :
+    inbt=int(nbt)
+    itb=int(inbt+(8-inbt%8)%8)
+    inb=int(itb/8)
+    tb=str(itb)
+    nb=str(inb)
+
+    bd="B"+tb+"_"+base
+
+    fnameh="config_big_"+bd+".h"
+    copy_keep_file("config_big.h", fnameh)
+
+    replace(fnameh,"XXX",bd)
+    replace(fnameh,"@NB@",nb)
+    replace(fnameh,"@BASE@",base)
+
+    fnameh="config_field_"+tf+".h"
+    copy_keep_file("config_field.h", fnameh)
+
+    replace(fnameh,"XXX",bd)
+    replace(fnameh,"YYY",tf)
+    replace(fnameh,"@NBT@",nbt)
+    replace(fnameh,"@M8@",m8)
+    replace(fnameh,"@MT@",mt)
+    hc="0"
+    hc2="0"
+# Get Hash-to-Curve Z for G1 and G2
+
+    if isinstance(rz,list) :
+        if len(rz)==2 :     # Z followed by SSWU isogeny degree
+            replace(fnameh,"@RZ@",rz[0])
+            replace(fnameh,"@RZ2A@","0")
+            replace(fnameh,"@RZ2B@","0")
+            hc=rz[1]
+        if len(rz)==3 :     # Z for G1 followed by Z for G2 (for SVDW)
+            replace(fnameh,"@RZ@",rz[0])
+            replace(fnameh,"@RZ2A@",rz[1])
+            replace(fnameh,"@RZ2B@",rz[2])
+        if len(rz)==5 :     # Z for G1, Z for G2, SSWU isogeny degree for G1, SSWU isogeny degree for G2
+            replace(fnameh,"@RZ@",rz[0])
+            replace(fnameh,"@RZ2A@",rz[1])
+            replace(fnameh,"@RZ2B@",rz[2])
+            hc=rz[3]
+            hc2=rz[4]
+    else :
+        replace(fnameh,"@RZ@",rz)   # just Z for SSWU, or indicates RFC7748 or Generic for Elligator
+        replace(fnameh,"@RZ2A@","0")
+        replace(fnameh,"@RZ2B@","0")
+    itw=int(qi)%10
+    replace(fnameh,"@QI@",str(itw))
+    if int(qi)//10 > 0 :
+        replace(fnameh,"@TW@","POSITOWER")
+    else :
+        replace(fnameh,"@TW@","NEGATOWER")
+
+    ib=int(base)
+    inb=int(nb)
+    inbt=int(nbt)
+    nlen=(1+((8*inb-1)//ib))
+    sh=ib*nlen-inbt
+
+    if sh > 14 :
+        sh=14
+    replace(fnameh,"@SH@",str(sh))
+
+    fnameh="config_curve_"+tc+".h"
+    copy_keep_file("config_curve.h", fnameh)
+
+    replace(fnameh,"XXX",bd)
+    replace(fnameh,"YYY",tf)
+    replace(fnameh,"ZZZ",tc)
+    replace(fnameh,"@CT@",ct)
+    replace(fnameh,"@CA@",ca)
+    replace(fnameh,"@PF@",pf)
+
+    replace(fnameh,"@ST@",stw)
+    replace(fnameh,"@SX@",sx)
+    replace(fnameh,"@CS@",cs)
+    replace(fnameh,"@AB@",ab)
+    replace(fnameh,"@G2@",g2)
+
+    replace(fnameh,"@HC@",hc)
+    replace(fnameh,"@HC2@",hc2)
+
+    fnamec="big_"+bd+".cpp"
+    fnameh="big_"+bd+".h"
+
+    copy_temp_file("big.cpp", fnamec)
+    copy_keep_file("big.h", fnameh)
+
+    replace(fnamec,"XXX",bd)
+    replace(fnameh,"XXX",bd)
+
+    replace(fnamec,"INLINE_MUL1",inline_mul1(nlen,bd))
+    replace(fnamec,"INLINE_MUL2",inline_mul2(nlen,bd))
+    replace(fnamec,"INLINE_SQR",inline_sqr(nlen,bd))
+    replace(fnamec,"INLINE_REDC1",inline_redc1(nlen,bd))
+    replace(fnamec,"INLINE_REDC2",inline_redc2(nlen,bd))
+
+    miracl_compile.compile_file(3, fnamec)
+
+    fnamec="fp_"+tf+".cpp"
+    fnameh="fp_"+tf+".h"
+
+    copy_temp_file("fp.cpp", fnamec)
+    copy_keep_file("fp.h", fnameh)
+
+    replace(fnamec,"YYY",tf)
+    replace(fnamec,"XXX",bd)
+    replace(fnameh,"YYY",tf)
+    replace(fnameh,"XXX",bd)
+    miracl_compile.compile_file(3, fnamec)
+
+    miracl_compile.compile_file(3, "rom_field_"+tf+".cpp");
+
+    fnamec="ecp_"+tc+".cpp"
+    fnameh="ecp_"+tc+".h"
+
+    copy_temp_file("ecp.cpp", fnamec)
+    copy_keep_file("ecp.h", fnameh)
+
+    replace(fnamec,"ZZZ",tc)
+    replace(fnamec,"YYY",tf)
+    replace(fnamec,"XXX",bd)
+    replace(fnameh,"ZZZ",tc)
+    replace(fnameh,"YYY",tf)
+    replace(fnameh,"XXX",bd)
+    miracl_compile.compile_file(3, fnamec)
+
+    fnamec="ecdh_"+tc+".cpp"
+    fnameh="ecdh_"+tc+".h"
+
+    copy_temp_file("ecdh.cpp", fnamec)
+    copy_keep_file("ecdh.h", fnameh)
+
+    replace(fnamec,"ZZZ",tc)
+    replace(fnamec,"YYY",tf)
+    replace(fnamec,"XXX",bd)
+    replace(fnameh,"ZZZ",tc)
+    replace(fnameh,"YYY",tf)
+    replace(fnameh,"XXX",bd)
+    miracl_compile.compile_file(3, fnamec)
+
+
+    fnamec="eddsa_"+tc+".cpp"
+    fnameh="eddsa_"+tc+".h"
+
+    copy_temp_file("eddsa.cpp", fnamec)
+    copy_keep_file("eddsa.h", fnameh)
+
+    replace(fnamec,"ZZZ",tc)
+    replace(fnamec,"YYY",tf)
+    replace(fnamec,"XXX",bd)
+    replace(fnameh,"ZZZ",tc)
+    replace(fnameh,"YYY",tf)
+    replace(fnameh,"XXX",bd)
+    miracl_compile.compile_file(3, fnamec)
+
+
+    fnamec="hpke_"+tc+".cpp"
+    fnameh="hpke_"+tc+".h"
+
+    copy_temp_file("hpke.cpp", fnamec)
+    copy_keep_file("hpke.h", fnameh)
+
+    replace(fnamec,"ZZZ",tc)
+    replace(fnameh,"ZZZ",tc)
+    miracl_compile.compile_file(3, fnamec)
+
+    miracl_compile.compile_file(3, "rom_curve_"+tc+".cpp");
+
+    if pf != "NOT_PF" :
+        fnamec="fp2_"+tf+".cpp"
+        fnameh="fp2_"+tf+".h"
+
+        copy_temp_file("fp2.cpp", fnamec)
+        copy_keep_file("fp2.h", fnameh)
+        replace(fnamec,"YYY",tf)
+        replace(fnamec,"XXX",bd)
+        replace(fnameh,"YYY",tf)
+        replace(fnameh,"XXX",bd)
+        miracl_compile.compile_file(3, fnamec)
+
+        fnamec="fp4_"+tf+".cpp"
+        fnameh="fp4_"+tf+".h"
+
+        copy_temp_file("fp4.cpp", fnamec)
+        copy_keep_file("fp4.h", fnameh)
+
+        replace(fnamec,"YYY",tf)
+        replace(fnamec,"XXX",bd)
+        replace(fnamec,"ZZZ",tc)
+        replace(fnameh,"YYY",tf)
+        replace(fnameh,"XXX",bd)
+        replace(fnameh,"ZZZ",tc)
+        miracl_compile.compile_file(3, fnamec)
+
+
+        if pf == "BN_CURVE" or pf == "BLS12_CURVE" :
+            fnamec="fp12_"+tf+".cpp"
+            fnameh="fp12_"+tf+".h"
+
+            copy_temp_file("fp12.cpp", fnamec)
+            copy_keep_file("fp12.h", fnameh)
+
+            replace(fnamec,"YYY",tf)
+            replace(fnamec,"XXX",bd)
+            replace(fnamec,"ZZZ",tc)
+            replace(fnameh,"YYY",tf)
+            replace(fnameh,"XXX",bd)
+            replace(fnameh,"ZZZ",tc)
+            miracl_compile.compile_file(3, fnamec)
+
+            fnamec="ecp2_"+tc+".cpp"
+            fnameh="ecp2_"+tc+".h"
+
+            copy_temp_file("ecp2.cpp", fnamec)
+            copy_keep_file("ecp2.h", fnameh)
+
+            replace(fnamec,"ZZZ",tc)
+            replace(fnamec,"YYY",tf)
+            replace(fnamec,"XXX",bd)
+            replace(fnameh,"ZZZ",tc)
+            replace(fnameh,"YYY",tf)
+            replace(fnameh,"XXX",bd)
+            miracl_compile.compile_file(3, fnamec)
+
+            fnamec="pair_"+tc+".cpp"
+            fnameh="pair_"+tc+".h"
+
+            copy_temp_file("pair.cpp", fnamec)
+            copy_keep_file("pair.h", fnameh)
+
+            replace(fnamec,"ZZZ",tc)
+            replace(fnamec,"YYY",tf)
+            replace(fnamec,"XXX",bd)
+            replace(fnameh,"ZZZ",tc)
+            replace(fnameh,"YYY",tf)
+            replace(fnameh,"XXX",bd)
+            miracl_compile.compile_file(3, fnamec)
+
+            fnamec="mpin_"+tc+".cpp"
+            fnameh="mpin_"+tc+".h"
+
+            copy_temp_file("mpin.cpp", fnamec)
+            copy_keep_file("mpin.h", fnameh)
+
+            replace(fnamec,"ZZZ",tc)
+            replace(fnamec,"YYY",tf)
+            replace(fnamec,"XXX",bd)
+            replace(fnameh,"ZZZ",tc)
+            replace(fnameh,"YYY",tf)
+            replace(fnameh,"XXX",bd)
+            miracl_compile.compile_file(3, fnamec)
+
+            fnamec="bls_"+tc+".cpp"
+            fnameh="bls_"+tc+".h"
+
+            copy_temp_file("bls.cpp", fnamec)
+            copy_keep_file("bls.h", fnameh)
+
+            replace(fnamec,"ZZZ",tc)
+            replace(fnamec,"YYY",tf)
+            replace(fnamec,"XXX",bd)
+            replace(fnameh,"ZZZ",tc)
+            replace(fnameh,"YYY",tf)
+            replace(fnameh,"XXX",bd)
+            miracl_compile.compile_file(3, fnamec)
+
+        if pf == "BLS24_CURVE" :
+            fnamec="fp8_"+tf+".cpp"
+            fnameh="fp8_"+tf+".h"
+
+            copy_temp_file("fp8.cpp", fnamec)
+            copy_keep_file("fp8.h", fnameh)
+
+            replace(fnamec,"YYY",tf)
+            replace(fnamec,"XXX",bd)
+            replace(fnamec,"ZZZ",tc)
+            replace(fnameh,"YYY",tf)
+            replace(fnameh,"XXX",bd)
+            replace(fnameh,"ZZZ",tc)
+            miracl_compile.compile_file(3, fnamec)
+
+
+            fnamec="fp24_"+tf+".cpp"
+            fnameh="fp24_"+tf+".h"
+
+            copy_temp_file("fp24.cpp", fnamec)
+            copy_keep_file("fp24.h", fnameh)
+
+            replace(fnamec,"YYY",tf)
+            replace(fnamec,"XXX",bd)
+            replace(fnamec,"ZZZ",tc)
+            replace(fnameh,"YYY",tf)
+            replace(fnameh,"XXX",bd)
+            replace(fnameh,"ZZZ",tc)
+            miracl_compile.compile_file(3, fnamec)
+
+            fnamec="ecp4_"+tc+".cpp"
+            fnameh="ecp4_"+tc+".h"
+
+            copy_temp_file("ecp4.cpp", fnamec)
+            copy_keep_file("ecp4.h", fnameh)
+
+            replace(fnamec,"ZZZ",tc)
+            replace(fnamec,"YYY",tf)
+            replace(fnamec,"XXX",bd)
+            replace(fnameh,"ZZZ",tc)
+            replace(fnameh,"YYY",tf)
+            replace(fnameh,"XXX",bd)
+            miracl_compile.compile_file(3, fnamec)
+
+            fnamec="pair4_"+tc+".cpp"
+            fnameh="pair4_"+tc+".h"
+
+            copy_temp_file("pair4.cpp", fnamec)
+            copy_keep_file("pair4.h", fnameh)
+
+            replace(fnamec,"ZZZ",tc)
+            replace(fnamec,"YYY",tf)
+            replace(fnamec,"XXX",bd)
+            replace(fnameh,"ZZZ",tc)
+            replace(fnameh,"YYY",tf)
+            replace(fnameh,"XXX",bd)
+            miracl_compile.compile_file(3, fnamec)
+
+            fnamec="mpin192_"+tc+".cpp"
+            fnameh="mpin192_"+tc+".h"
+
+            copy_temp_file("mpin192.cpp", fnamec)
+            copy_keep_file("mpin192.h", fnameh)
+
+            replace(fnamec,"ZZZ",tc)
+            replace(fnamec,"YYY",tf)
+            replace(fnamec,"XXX",bd)
+            replace(fnameh,"ZZZ",tc)
+            replace(fnameh,"YYY",tf)
+            replace(fnameh,"XXX",bd)
+            miracl_compile.compile_file(3, fnamec)
+
+            fnamec="bls192_"+tc+".cpp"
+            fnameh="bls192_"+tc+".h"
+
+            copy_temp_file("bls192.cpp", fnamec)
+            copy_keep_file("bls192.h", fnameh)
+
+            replace(fnamec,"ZZZ",tc)
+            replace(fnamec,"YYY",tf)
+            replace(fnamec,"XXX",bd)
+            replace(fnameh,"ZZZ",tc)
+            replace(fnameh,"YYY",tf)
+            replace(fnameh,"XXX",bd)
+            miracl_compile.compile_file(3, fnamec)
+
+        if pf == "BLS48_CURVE" :
+
+            fnamec="fp8_"+tf+".cpp"
+            fnameh="fp8_"+tf+".h"
+
+            copy_temp_file("fp8.cpp", fnamec)
+            copy_keep_file("fp8.h", fnameh)
+
+            replace(fnamec,"YYY",tf)
+            replace(fnamec,"XXX",bd)
+            replace(fnamec,"ZZZ",tc)
+            replace(fnameh,"YYY",tf)
+            replace(fnameh,"XXX",bd)
+            replace(fnameh,"ZZZ",tc)
+            miracl_compile.compile_file(3, fnamec)
+
+
+            fnamec="ecp8_"+tc+".cpp"
+            fnameh="ecp8_"+tc+".h"
+
+            copy_temp_file("ecp8.cpp", fnamec)
+            copy_keep_file("ecp8.h", fnameh)
+
+            replace(fnamec,"ZZZ",tc)
+            replace(fnamec,"YYY",tf)
+            replace(fnamec,"XXX",bd)
+            replace(fnameh,"ZZZ",tc)
+            replace(fnameh,"YYY",tf)
+            replace(fnameh,"XXX",bd)
+            miracl_compile.compile_file(3, fnamec)
+
+
+            fnamec="fp16_"+tf+".cpp"
+            fnameh="fp16_"+tf+".h"
+
+            copy_temp_file("fp16.cpp", fnamec)
+            copy_keep_file("fp16.h", fnameh)
+
+            replace(fnamec,"YYY",tf)
+            replace(fnamec,"XXX",bd)
+            replace(fnamec,"ZZZ",tc)
+            replace(fnameh,"YYY",tf)
+            replace(fnameh,"XXX",bd)
+            replace(fnameh,"ZZZ",tc)
+            miracl_compile.compile_file(3, fnamec)
+
+
+            fnamec="fp48_"+tf+".cpp"
+            fnameh="fp48_"+tf+".h"
+
+            copy_temp_file("fp48.cpp", fnamec)
+            copy_keep_file("fp48.h", fnameh)
+
+            replace(fnamec,"YYY",tf)
+            replace(fnamec,"XXX",bd)
+            replace(fnamec,"ZZZ",tc)
+            replace(fnameh,"YYY",tf)
+            replace(fnameh,"XXX",bd)
+            replace(fnameh,"ZZZ",tc)
+            miracl_compile.compile_file(3, fnamec)
+
+
+            fnamec="pair8_"+tc+".cpp"
+            fnameh="pair8_"+tc+".h"
+
+            copy_temp_file("pair8.cpp", fnamec)
+            copy_keep_file("pair8.h", fnameh)
+  
+            replace(fnamec,"ZZZ",tc)
+            replace(fnamec,"YYY",tf)
+            replace(fnamec,"XXX",bd)
+            replace(fnameh,"ZZZ",tc)
+            replace(fnameh,"YYY",tf)
+            replace(fnameh,"XXX",bd)
+            miracl_compile.compile_file(3, fnamec)
+
+            fnamec="mpin256_"+tc+".cpp"
+            fnameh="mpin256_"+tc+".h"
+
+            copy_temp_file("mpin256.cpp", fnamec)
+            copy_keep_file("mpin256.h", fnameh)
+
+            replace(fnamec,"ZZZ",tc)
+            replace(fnamec,"YYY",tf)
+            replace(fnamec,"XXX",bd)
+            replace(fnameh,"ZZZ",tc)
+            replace(fnameh,"YYY",tf)
+            replace(fnameh,"XXX",bd)
+            miracl_compile.compile_file(3, fnamec)
+
+            fnamec="bls256_"+tc+".cpp"
+            fnameh="bls256_"+tc+".h"
+
+            copy_temp_file("bls256.cpp", fnamec)
+            copy_keep_file("bls256.h", fnameh)
+
+            replace(fnamec,"ZZZ",tc)
+            replace(fnamec,"YYY",tf)
+            replace(fnamec,"XXX",bd)
+            replace(fnameh,"ZZZ",tc)
+            replace(fnameh,"YYY",tf)
+            replace(fnameh,"XXX",bd)
+            miracl_compile.compile_file(3, fnamec)
+
+replace("arch.h","@WL@","32")
+
+class miracl_crypto:
+    np_curves = (
+        ( "255", "F25519", "Ed25519", "29", "2", "1", "PSEUDO_MERSENNE", "0", "EDWARDS", "-1", "NOT_PF", "", "", "", "", "128"),
+        ( "255", "F25519", "C25519", "29", "2", "1", "PSEUDO_MERSENNE", "0", "MONTGOMERY", "486662", "NOT_PF", "", "", "", "", "128"),
+        ( "256", "NIST256", "NIST256", "28", "1", "-10", "NOT_SPECIAL", "0", "WEIERSTRASS", "-3", "NOT_PF", "", "", "", "", "128"),
+        ( "256", "BRAINPOOL", "BRAINPOOL", "28", "1", "-3", "NOT_SPECIAL", "0", "WEIERSTRASS", "-3", "NOT_PF", "", "", "", "", "128"),
+        ( "256", "ANSSI", "ANSSI", "28", "1", "-5", "NOT_SPECIAL", "0", "WEIERSTRASS", "-3", "NOT_PF", "", "", "", "", "128"),
+        ( "336", "HIFIVE", "HIFIVE", "29", "2", "1", "PSEUDO_MERSENNE", "0", "EDWARDS", "1", "NOT_PF", "", "", "", "", "192"),
+        ( "448", "F448", "Ed448", "29", "1", "0", "GENERALISED_MERSENNE", "0", "EDWARDS", "1", "NOT_PF", "", "", "", "", "256"),
+        ( "384", "NIST384", "NIST384", "29", "1", "-12", "NOT_SPECIAL", "0", "WEIERSTRASS", "-3", "NOT_PF", "", "", "", "", "192"),
+        ( "414", "C41417", "C41417", "29", "1", "1", "PSEUDO_MERSENNE", "0", "EDWARDS", "1", "NOT_PF", "", "", "", "", "256"),
+        ( "521", "NIST521", "NIST521", "28", "1", "-4", "PSEUDO_MERSENNE", "0", "WEIERSTRASS", "-3", "NOT_PF", "", "", "", "", "256"),
+        ( "256", "F256PMW", "NUMS256W", "28", "1", "7", "PSEUDO_MERSENNE", "0", "WEIERSTRASS", "-3", "NOT_PF", "", "", "", "", "128"),
+        ( "256", "F256PME", "NUMS256E", "29", "1", "0", "PSEUDO_MERSENNE", "0", "EDWARDS", "1", "NOT_PF", "", "", "", "", "128"),
+        ( "384", "F384PM", "NUMS384W", "29", "1", "-4", "PSEUDO_MERSENNE", "0", "WEIERSTRASS", "-3", "NOT_PF", "", "", "", "", "192"),
+        ( "384", "F384PM", "NUMS384E", "29", "1", "0", "PSEUDO_MERSENNE", "0", "EDWARDS", "1", "NOT_PF", "", "", "", "", "192"),
+        ( "512", "F512PM", "NUMS512W", "29", "1", "-4", "PSEUDO_MERSENNE", "0", "WEIERSTRASS", "-3", "NOT_PF", "", "", "", "", "256"),
+        ( "512", "F512PM", "NUMS512E", "29", "1", "0", "PSEUDO_MERSENNE", "0", "EDWARDS", "1", "NOT_PF", "", "", "", "", "256"),
+        #                                             ,"1", for SVDW
+        # set for SSWU plus isogenies
+        ( "256", "SECP256K1", "SECP256K1", "28", "1",["-11", "3"],"NOT_SPECIAL", "0", "WEIERSTRASS", "0", "NOT_PF", "", "", "", "", "128"),
+        ( "256", "SM2", "SM2", "28", "1", "-9", "NOT_SPECIAL", "0", "WEIERSTRASS", "-3", "NOT_PF", "", "", "", "", "128"),
+        ( "255", "F25519", "C13318", "29", "2", "2", "PSEUDO_MERSENNE", "0", "WEIERSTRASS", "-3", "NOT_PF", "", "", "", "", "128"),
+        ( "255", "JUBJUB", "JUBJUB", "29", "32", "1", "NOT_SPECIAL", "5", "EDWARDS", "-1", "NOT_PF", "", "", "", "", "128"),
+        ( "448", "F448", "X448", "29", "1", "0", "GENERALISED_MERSENNE", "0", "MONTGOMERY", "156326", "NOT_PF", "", "", "", "", "256"),
+        ( "160", "SECP160R1", "SECP160R1", "29", "1", "3", "NOT_SPECIAL", "0", "WEIERSTRASS", "-3", "NOT_PF", "", "", "", "", "128"),
+        ( "251", "C1174", "C1174", "29", "1", "0", "PSEUDO_MERSENNE", "0", "EDWARDS", "1", "NOT_PF", "", "", "", "", "128"),
+        ( "166", "C1665", "C1665", "29", "1", "0", "PSEUDO_MERSENNE", "0", "EDWARDS", "1", "NOT_PF", "", "", "", "", "128"),
+        ( "256", "MDC", "MDC", "28", "1", "0", "NOT_SPECIAL", "0", "EDWARDS", "1", "NOT_PF", "", "", "", "", "128"),
+        ( "255", "TWEEDLEDUM", "TWEEDLEDUM", "29", "33", "1", "NOT_SPECIAL", "5", "WEIERSTRASS", "0", "NOT_PF", "", "", "", "", "128"),
+        ( "255", "TWEEDLEDEE", "TWEEDLEDEE", "29", "34", "1", "NOT_SPECIAL", "5", "WEIERSTRASS", "0", "NOT_PF", "", "", "", "", "128")
+    )
+
+    pf_curves = (
+        ( "254", "BN254", "BN254", "28", "1",["-1", "-1", "0"],"NOT_SPECIAL", "0", "WEIERSTRASS", "0", "BN_CURVE", "D_TYPE", "NEGATIVEX", "71", "66", "128"),
+        ( "254", "BN254CX", "BN254CX", "28", "1",["-1", "-1", "0"],"NOT_SPECIAL", "0", "WEIERSTRASS", "0", "BN_CURVE", "D_TYPE", "NEGATIVEX", "76", "66", "128"),
+        ( "383", "BLS12383", "BLS12383", "29", "1",["1", "1", "0"],"NOT_SPECIAL", "0", "WEIERSTRASS", "0", "BLS12_CURVE", "M_TYPE", "POSITIVEX", "68", "65", "128"),
+        #                                        ["-3" ,"-1", "0"]  for SVDW
+        # set for SSWU plus isogenies
+        ( "381", "BLS12381", "BLS12381", "29", "1",["11", "-2", "-1", "11", "3"],"NOT_SPECIAL", "0", "WEIERSTRASS", "0", "BLS12_CURVE", "M_TYPE", "NEGATIVEX", "69", "65", "128"),
+        ( "256", "FP256BN", "FP256BN", "28", "1",["1", "1", "0"],"NOT_SPECIAL", "0", "WEIERSTRASS", "0", "BN_CURVE", "M_TYPE", "NEGATIVEX", "83", "66", "128"),
+        ( "512", "FP512BN", "FP512BN", "29", "1",["1", "1", "0"],"NOT_SPECIAL", "0", "WEIERSTRASS", "0", "BN_CURVE", "M_TYPE", "POSITIVEX", "172", "130", "128"),
+        ( "443", "BLS12443", "BLS12443", "29", "1",["-7", "1", "1", "11", "3"],"NOT_SPECIAL", "0", "WEIERSTRASS", "0", "BLS12_CURVE", "M_TYPE", "POSITIVEX", "78", "75", "128"),
+        # https://eprint.iacr.org/2017/334.pdf
+        ( "461", "BLS12461", "BLS12461", "28", "1",["1", "4", "0"],"NOT_SPECIAL", "0", "WEIERSTRASS", "0", "BLS12_CURVE", "M_TYPE", "NEGATIVEX", "79", "78", "128"),
+        ( "462", "BN462", "BN462", "28", "1",["1","1","0"],"NOT_SPECIAL", "1", "WEIERSTRASS", "0", "BN_CURVE", "D_TYPE", "POSITIVEX", "125", "118", "128"),
+        ( "479", "BLS24479", "BLS24479", "29", "1",["1", "4", "0"],"NOT_SPECIAL", "0", "WEIERSTRASS", "0", "BLS24_CURVE", "M_TYPE", "POSITIVEX", "52", "49", "192"),
+        ( "556", "BLS48556", "BLS48556", "29", "1",["-1", "2", "0"],"NOT_SPECIAL", "0", "WEIERSTRASS", "0", "BLS48_CURVE", "M_TYPE", "POSITIVEX", "35", "32", "256"),
+        ( "581", "BLS48581", "BLS48581", "29", "1",["2", "2", "0"],"NOT_SPECIAL", "10", "WEIERSTRASS", "0", "BLS48_CURVE", "D_TYPE", "NEGATIVEX", "36", "33", "256"),
+        ( "286", "BLS48286", "BLS48286", "29", "1",["1", "1", "0"],"NOT_SPECIAL", "0", "WEIERSTRASS", "0", "BLS48_CURVE", "M_TYPE", "POSITIVEX", "20", "17", "128"),
+        ( "158", "BN158", "BN158", "28","1",["1", "1", "0"], "NOT_SPECIAL", "0", "WEIERSTRASS", "0","BN_CURVE","M_TYPE","NEGATIVEX","49","42","128")
+    )
+
+    # There are choices here, different ways of getting the same result, but some faster than others
+    rsa_params = (
+        # 256 is slower but may allow reuse of 256-bit BIGs used for elliptic curve
+        # 512 is faster.. but best is 1024
+        #("1024", "RSA2048", "28", "2"),
+        ("512","RSA2048","29","4"),
+        #("256","RSA2048","29","8"),
+        ("384", "RSA3072", "28", "8"),
+        #("256","RSA4096","29","16"),
+        ("512", "RSA4096", "29", "8")
+    )
+
+    total_entries = len(np_curves)+len(pf_curves)+len(rsa_params)
+
+    def valid_query(number):
+        return number >= 0 and number <= miracl_crypto.total_entries
+
+def interactive_prompt_print():
+    index = 1
+    print("Elliptic Curves")
+    for tuple in miracl_crypto.np_curves:
+        print(str(index) + ".", tuple[2])
+        index += 1
+
+    print("\nPairing-Friendly Elliptic Curves")
+    for tuple in miracl_crypto.pf_curves:
+        print(str(index) + ".", tuple[2])
+        index += 1
+
+    print("\nRSA")
+    for tuple in miracl_crypto.rsa_params:
+        print(str(index) + ".", tuple[1])
+        index += 1
+
+def interactive_prompt_exect(index):
+    index -= 1 # Python internally is zero-indexed
+    if index < len(miracl_crypto.np_curves):
+        tuple = miracl_crypto.np_curves[index]
+        curveset(
+            tuple[0], tuple[1], tuple[2], tuple[3], tuple[4],
+            tuple[5], tuple[6], tuple[7], tuple[8], tuple[9],
+            tuple[10], tuple[11], tuple[12],
+            tuple[13], tuple[14], tuple[15]
+        )
+    elif index < len(miracl_crypto.np_curves) + len(miracl_crypto.pf_curves):
+        tuple = miracl_crypto.pf_curves[index-len(miracl_crypto.np_curves)]
+        curveset(
+            tuple[0], tuple[1], tuple[2], tuple[3], tuple[4],
+            tuple[5], tuple[6], tuple[7], tuple[8], tuple[9],
+            tuple[10], tuple[11], tuple[12],
+            tuple[13], tuple[14], tuple[15]
+        )
+    else:
+        tuple = miracl_crypto.rsa_params[index-(len(miracl_crypto.np_curves)+len(miracl_crypto.pf_curves))]
+        rsaset(
+            tuple[0], tuple[1], tuple[2], tuple[3]
+        )
+
+def interactive_prompt_input():
+    while True:
+        userInput = input("\nChoose schemes to support (select 0 to finish): ")
+        try:
+            return int(userInput)
+        except:
+            if (userInput == ''):
+                return 0
+            print("Non-integer input, select values between 1 and " + str(miracl_crypto.total_entries))
+            interactive_prompt_input()
+
+interactive_prompt_print()
+while keep_querying and not testing:
+    query_val = -1
+    while not miracl_crypto.valid_query(query_val):
+        query_val = interactive_prompt_input()
+        if not miracl_crypto.valid_query(query_val):
+            print("Number out of range, select values between 1 and " + str(miracl_crypto.total_entries))
+        elif query_val == 0:
+            keep_querying = False
+        else:
+            interactive_prompt_exect(query_val)
+
+if testing:
+    for i in range(0, miracl_crypto.total_entries):
+        interactive_prompt_exect(i+1)
+
+# create library
+miracl_compile.compile_file(3, "randapi.cpp")
+miracl_compile.compile_file(3, "hash.cpp")
+miracl_compile.compile_file(3, "hmac.cpp")
+miracl_compile.compile_file(3, "rand.cpp")
+miracl_compile.compile_file(3, "oct.cpp")
+miracl_compile.compile_file(3, "share.cpp")
+miracl_compile.compile_file(3, "aes.cpp")
+miracl_compile.compile_file(3, "gcm.cpp")
+miracl_compile.compile_file(3, "newhope.cpp")
+miracl_compile.compile_file(3, "dilithium.cpp")
+miracl_compile.compile_file(3, "kyber.cpp")
+miracl_compile.compile_file(3, "x509.cpp")
+
+if sys.platform.startswith("win") :
+    os.system("for %i in (*.o) do @echo %~nxi >> f.list")
+    os.system("ar rc core.a @f.list")
+    delete_file("f.list")
+else :
+    os.system("ar rc core.a *.o")
+
+if testing :
+    miracl_compile.compile_binary(2, "testecc.cpp", "core.a", "testecc")
+    miracl_compile.compile_binary(2, "testeddsa.cpp", "core.a", "testeddsa")
+    miracl_compile.compile_binary(2, "testmpin.cpp", "core.a", "testmpin")
+    miracl_compile.compile_binary(2, "testbls.cpp", "core.a", "testbls")
+    miracl_compile.compile_binary(2, "benchtest_all.cpp", "core.a", "benchtest_all")
+    miracl_compile.compile_binary(2, "testnhs.cpp", "core.a", "testnhs")
+    miracl_compile.compile_binary(2, "testdlthm.cpp", "core.a", "testdlthm")
+    miracl_compile.compile_binary(2, "testkyber.cpp", "core.a", "testkyber")
+
+#clean up
+for file in generated_files:
+    delete_file(file)
+
+delete_file("*.o")
+delete_file("big.*")
+delete_file("fp.*")
+delete_file("ecp.*")
+delete_file("ecdh.*")
+delete_file("hpke.*")
+delete_file("ff.*")
+delete_file("rsa.*")
+delete_file("config_big.h")
+delete_file("config_field.h")
+delete_file("config_curve.h")
+delete_file("config_ff.h")
+delete_file("fp2.*")
+delete_file("fp4.*")
+delete_file("fp8.*")
+delete_file("fp16.*")
+delete_file("share.cpp")
+delete_file("x509.cpp")
+delete_file("gcm.cpp")
+delete_file("hash.cpp")
+delete_file("hmac.cpp")
+delete_file("aes.cpp")
+delete_file("oct.cpp");
+delete_file("newhope.cpp")
+delete_file("dilithium.cpp")
+delete_file("kyber.cpp")
+delete_file("Doxyfile")
+delete_file("refman.pdf")
+delete_file("readme.md")
+delete_file("rand.cpp")
+delete_file("randapi.cpp")
+delete_file("config*.py")
+
+delete_file("fp12.*")
+delete_file("fp24.*")
+delete_file("fp48.*")
+
+delete_file("ecp2.*")
+delete_file("ecp4.*")
+delete_file("ecp8.*")
+
+delete_file("pair.*")
+delete_file("mpin.*")
+delete_file("bls.*")
+
+delete_file("pair4.*")
+delete_file("mpin192.*")
+delete_file("bls192.*")
+
+delete_file("pair8.*")
+delete_file("mpin256.*")
+delete_file("bls256.*")
+
+delete_file("rom_field*.cpp")
+delete_file("rom_curve*.cpp")
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config64.py b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config64.py
new file mode 100644
index 0000000..b25021b
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config64.py
@@ -0,0 +1,1036 @@
+#!/usr/bin/env python3
+
+#
+# Copyright (c) 2012-2020 MIRACL UK Ltd.
+#
+# This file is part of MIRACL Core
+# (see https://github.com/miracl/core).
+#
+# Licensed under the Apache License, Version 2.0 (the "License");
+# you may not use this file except in compliance with the License.
+# You may obtain a copy of the License at
+#
+#     http://www.apache.org/licenses/LICENSE-2.0
+#
+# Unless required by applicable law or agreed to in writing, software
+# distributed under the License is distributed on an "AS IS" BASIS,
+# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+# See the License for the specific language governing permissions and
+# limitations under the License.
+#
+
+import os
+import sys
+import getopt
+import shutil
+import fnmatch
+
+intr=False
+arg_options=False
+testing=False
+fast_fail=True
+keep_querying=True
+ignore_variables=False
+
+my_compiler = "g++"
+generated_files = []
+
+def copy_keep_file(file, target):
+    shutil.copyfile(file, target)
+
+def copy_temp_file(file, target):
+    shutil.copyfile(file, target)
+    generated_files.append(target)
+
+def delete_file(expression):
+    for root, dirs, files in os.walk(os.path.abspath(os.path.dirname(__file__))):
+        for name in files:
+            if fnmatch.fnmatch(name, expression):
+                os.remove(os.path.join(root, name))
+
+def request_compile(compiler_path, cflags, optim, file, lib, bin):
+    flags = " -std=c++11"
+    if optim != 0:
+        flags += " -O%d" % optim
+    if cflags != None:
+        flags += " %s" % cflags
+    if lib == None and bin == None:
+        flags += " -c %s" % (file)
+    else:
+        if sys.platform.startswith("win"):
+            bin += ".exe"
+        flags += " %s %s -o %s" % (file, lib, bin)
+    print("Processing " + file + "..", end = "", flush=True)
+    if sys.platform.startswith("win") :
+        os.system(compiler_path + flags)
+        print(". [DONE]")
+    else :
+        if os.WEXITSTATUS(os.system(compiler_path + flags)) == 0:
+            print(". [DONE]")
+        elif fast_fail:
+            print("unable to process. Fast-fail enabled, quitting!")
+            sys.exit(1)
+        else:
+            print(". [ERROR]")
+
+class miracl_compile:
+    def compile_file(optim, file):
+        if (os.environ.get('CXX') != None and not ignore_variables):
+            request_compile(os.environ.get('CXX'), os.environ.get('CXXFLAGS'), optim, file, None, None)
+        else:
+            request_compile(my_compiler, None, optim, file, None, None)
+
+    def compile_binary(optim, file, lib, bin):
+        if (os.environ.get('CXX') != None and not ignore_variables):
+            request_compile(os.environ.get('CXX'), os.environ.get('CXXFLAGS'), optim, file, lib, bin)
+        else:
+            request_compile(my_compiler, None, optim, file, lib, bin)
+
+
+def inline_mul1(N,base)  :
+    str=""
+    str+="\tt=(dchunk)a[0]*b[0]; c[0]=(chunk)t & BMASK_XXX; t=t>>BASEBITS_XXX;\n"
+
+    for i in range(1,N) :
+        k=0;
+        str+="\tt=t"
+        while (k<=i) :
+            str+="+(dchunk)a[{}]*b[{}]".format(k,i-k)
+            k+=1
+        str+="; c[{}]=(chunk)t & BMASK_XXX; ".format(i)
+        str+="t=t>>BASEBITS_XXX;\n"
+
+    for i in range(N,2*N-1) :
+        k=i-(N-1)
+        str+="\tt=t"
+        while (k<=N-1) :
+            str+="+(dchunk)a[{}]*b[{}]".format(k,i-k)
+            k+=1
+        str+="; c[{}]=(chunk)t & BMASK_XXX; ".format(i)
+        str+="t=t>>BASEBITS_XXX;\n"
+
+    str+="\tc[{}]=(chunk)t;\n".format(2*N-1)
+
+    return str.replace("XXX",base)
+
+def inline_mul2(N,base)  :
+    str=""
+    for i in range(0,N) :
+        str+="\td[{}]=(dchunk)a[{}]*b[{}];\n".format(i, i, i)
+    str+="\n\ts=d[0];\n\tt = s; c[0]=(chunk)t&BMASK_XXX; co=t>>BASEBITS_XXX;\n"
+    for k in range(1,N) :
+        str+="\ts+=d[{}]; t=co+s ".format(k)
+        for i in range(k,int(k/2),-1) :
+            str+="+(dchunk)(a[{}]-a[{}])*(b[{}]-b[{}])".format(i,k - i, k - i, i)
+        str+="; c[{}]=(chunk)t&BMASK_XXX; co=t>>BASEBITS_XXX; \n".format(k)
+    str+="\n"
+    for k in range(N,2 * N - 1) :
+        str+="\ts-=d[{}]; t=co+s ".format(k - N)
+        for i in range(N-1,int(k/2),-1) :
+            str+="+(dchunk)(a[{}]-a[{}])*(b[{}]-b[{}])".format(i, k - i, k - i, i)
+        str+="; c[{}]=(chunk)t&BMASK_XXX; co=t>>BASEBITS_XXX; \n".format(k)
+
+    str+="\tc[{}]=(chunk)co;\n".format(2 * N - 1)
+    return str.replace("XXX",base)
+
+def inline_sqr(N,base) :
+    str=""
+    str+="\n\tt=(dchunk)a[0]*a[0]; c[0]=(chunk)t&BMASK_XXX; co=t>>BASEBITS_XXX;\n"
+
+    for k in range(1,N) :
+        str+="\tt= "
+        for i in range(k,int(k/2),-1) :
+            str+="+(dchunk)a[{}]*a[{}]".format(i, k - i)
+        str+="; t+=t; t+=co;"
+        if k % 2 == 0 :
+            str+=" t+=(dchunk)a[{}]*a[{}];".format(int(k/2), int(k/2))
+        str+=" c[{}]=(chunk)t&BMASK_XXX; co=t>>BASEBITS_XXX; \n".format(k)
+    str+="\n"
+
+    for k in range(N,2*N-2) :
+        str+="\tt= "
+        for i in range(N-1,int(k/2),-1) :
+            str+="+(dchunk)a[{}]*a[{}]".format(i, k - i)
+        str+="; t+=t; t+=co;"
+        if k % 2 == 0 :
+            str+=" t+=(dchunk)a[{}]*a[{}];".format(int(k/2),int(k/2))
+        str+=" c[{}]=(chunk)t&BMASK_XXX; co=t>>BASEBITS_XXX; \n".format(k)
+
+    str+="\tt=co; t+=(dchunk)a[{}]*a[{}]; c[{}]=(chunk)t&BMASK_XXX; co=t>>BASEBITS_XXX; \n ".format(N-1,N-1,2*N-2)
+
+    str+="\tc[{}]=(chunk)co;\n".format(2 * N - 1)
+    return str.replace("XXX",base)
+
+def inline_redc2(N,base) :
+    str=""
+    str+="\tt=d[0]; v[0]=((chunk)t*MC)&BMASK_XXX; t+=(dchunk)v[0]*md[0];  s=0; c=(t>>BASEBITS_XXX);\n\n"
+
+    for k in range(1,N) :
+        str+="\tt=d[{}]+c+s+(dchunk)v[0]*md[{}]".format(k, k)
+        for i in range(k-1,int(k/2),-1) :
+            str+="+(dchunk)(v[{}]-v[{}])*(md[{}]-md[{}])".format(k - i, i, i, k - i)
+        str+="; v[{}]=((chunk)t*MC)&BMASK_XXX; t+=(dchunk)v[{}]*md[0]; ".format(k, k)
+        str+=" dd[{}]=(dchunk)v[{}]*md[{}]; s+=dd[{}]; c=(t>>BASEBITS_XXX); \n".format(k, k, k, k)
+
+    str+="\n"
+    for k in range(N,2*N-1) :
+        str+="\tt=d[{}]+c+s".format(k)
+        for i in range(N-1,int(k/2),-1) :
+            str+="+(dchunk)(v[{}]-v[{}])*(md[{}]-md[{}])".format(k - i, i, i, k - i)
+        str+="; a[{}]=(chunk)t&BMASK_XXX;  s-=dd[{}]; c=(t>>BASEBITS_XXX); \n".format(k - N, k - N + 1)
+
+    str+="\ta[{}]=d[{}]+((chunk)c&BMASK_XXX);\n".format(N-1,2*N-1)
+    return str.replace("XXX",base)
+
+def inline_redc1(N,base) :
+    str=""
+
+    str+="\tt = d[0];\n"
+    str+="\tv[0] = ((chunk)t * MC)&BMASK_XXX;\n"
+    str+="\tt += (dchunk)v[0] * md[0];\n"
+    str+="\tt = (t >> BASEBITS_XXX) + d[1];\n"
+
+    for i in range(1,N) :
+        k=1
+        str+="\tt += (dchunk)v[0] * md[{}] ".format(i)
+        while k<i :
+            str+="+ (dchunk)v[{}]*md[{}]".format(k,i-k)
+            k+=1
+        str+="; v[{}] = ((chunk)t * MC)&BMASK_XXX; ".format(i)
+        str+="t += (dchunk)v[{}] * md[0]; ".format(i)
+        str+="t = (t >> BASEBITS_XXX) + d[{}];\n".format(i+1)
+
+    for i in range(N,2*N-1) :
+        k=i-(N-1)
+        str+="\tt=t "
+        while k<=N-1 :
+            str+="+ (dchunk)v[{}]*md[{}] ".format(k,i-k)
+            k+=1
+        str+="; a[{}] = (chunk)t & BMASK_XXX; ".format(i-N)
+        str+="t = (t >> BASEBITS_XXX) + d[{}];\n".format(i+1)
+
+    str+="\ta[{}] = (chunk)t & BMASK_XXX;\n".format(N-1)
+    return str.replace("XXX",base)
+
+
+def replace(namefile,oldtext,newtext):
+    f = open(namefile,'r')
+    filedata = f.read()
+    f.close()
+
+    newdata = filedata.replace(oldtext,newtext)
+
+    f = open(namefile,'w')
+    f.write(newdata)
+    f.close()
+
+# rsaset(big,ring,bit_bits_in_base,multiplier)
+# for each choice give distinct names for "big" and "ring".
+# Typically "big" is the length in bits of the underlying big number type
+# "ring" is the RSA modulus size = "big" times 2^m
+# Next give the number base used for 32 bit architectures, as n where the base is 2^n
+# multiplier is 2^m (see above)
+def rsaset(tb,tff,base,ml) :
+
+    itb=int(tb)
+    inb=int(itb/8)
+    nb=str(inb)
+
+    ib=int(base)
+    inb=int(nb)
+
+    nlen=(1+((8*inb-1)//ib))
+
+    bd="B"+tb+"_"+base
+    fnameh="config_big_"+bd+".h"
+    copy_keep_file("config_big.h", fnameh)
+    replace(fnameh,"XXX",bd)
+    replace(fnameh,"@NB@",nb)
+    replace(fnameh,"@BASE@",base)
+
+    fnameh="config_ff_"+tff+".h"
+    copy_keep_file("config_ff.h", fnameh)
+    replace(fnameh,"XXX",bd)
+    replace(fnameh,"WWW",tff)
+    replace(fnameh,"@ML@",ml);
+
+    fnamec="big_"+bd+".cpp"
+    fnameh="big_"+bd+".h"
+
+    copy_temp_file("big.cpp", fnamec)
+    copy_keep_file("big.h", fnameh)
+
+    replace(fnamec,"XXX",bd)
+    replace(fnameh,"XXX",bd)
+
+    replace(fnamec,"INLINE_MUL1",inline_mul1(nlen,bd))
+    replace(fnamec,"INLINE_MUL2",inline_mul2(nlen,bd))
+    replace(fnamec,"INLINE_SQR",inline_sqr(nlen,bd))
+    replace(fnamec,"INLINE_REDC1",inline_redc1(nlen,bd))
+    replace(fnamec,"INLINE_REDC2",inline_redc2(nlen,bd))
+
+    miracl_compile.compile_file(3, fnamec)
+
+    fnamec="ff_"+tff+".cpp"
+    fnameh="ff_"+tff+".h"
+
+    copy_temp_file("ff.cpp", fnamec)
+    copy_keep_file("ff.h", fnameh)
+
+    replace(fnamec,"WWW",tff)
+    replace(fnamec,"XXX",bd)
+    replace(fnameh,"WWW",tff)
+    replace(fnameh,"XXX",bd)
+    miracl_compile.compile_file(3, fnamec)
+
+    fnamec="rsa_"+tff+".cpp"
+    fnameh="rsa_"+tff+".h"
+
+    copy_temp_file("rsa.cpp", fnamec)
+    copy_keep_file("rsa.h", fnameh)
+
+    replace(fnamec,"WWW",tff)
+    replace(fnamec,"XXX",bd)
+    replace(fnameh,"WWW",tff)
+    replace(fnameh,"XXX",bd)
+    miracl_compile.compile_file(3, fnamec)
+
+# curveset(modulus_bits,field,curve,bits_in_base,modulus_mod_8,Z,modulus_type,curve_type,Curve A,pairing_friendly,sextic twist,sign of x,g2_table size,ate bits,curve security)
+# for each curve give names for field and curve. In many cases the latter two will be the same.
+# modulus_bits is the bit length of the modulus, typically the same or slightly smaller than "big"
+# Typically "field" describes the modulus, and "curve" is the common name for the elliptic curve
+# Next give the number base used for 32 bit architecture, as n where the base is 2^n (note that these must be fixed for the same "big" name, if is ever re-used for another curve)
+# m8 max m such that 2^m | modulus-1
+# rz Z value for hash_to_point, If list G1 Z value is in [0], G2 Z value (=a+bz) is in [1], [2]
+# modulus_type is NOT_SPECIAL, or PSEUDO_MERSENNE, or MONTGOMERY_Friendly, or GENERALISED_MERSENNE (supported for Ed448 only)
+# i for Fp2 QNR 2^i+sqrt(-1) (relevant for PFCs only, else =0). Or QNR over Fp if p=1 mod 8
+# curve_type is WEIERSTRASS, EDWARDS or MONTGOMERY
+# Curve A parameter
+# pairing_friendly is BN, BLS or NOT (if not pairing friendly)
+# if pairing friendly. M or D type twist, and sign of the family parameter x
+# g2_table size is number of entries in precomputed table
+# ate bits is number of bits in Ate parameter (from romgen program)
+# curve security is AES equivalent, rounded up.
+
+def curveset(nbt,tf,tc,base,m8,rz,mt,qi,ct,ca,pf,stw,sx,g2,ab,cs) :
+
+    inbt=int(nbt)
+    itb=int(inbt+(8-inbt%8)%8)
+    inb=int(itb/8)
+    tb=str(itb)
+    nb=str(inb)
+
+    bd="B"+tb+"_"+base
+    fnameh="config_big_"+bd+".h"
+    copy_keep_file("config_big.h", fnameh)
+
+    replace(fnameh,"XXX",bd)
+    replace(fnameh,"@NB@",nb)
+    replace(fnameh,"@BASE@",base)
+
+    fnameh="config_field_"+tf+".h"
+    copy_keep_file("config_field.h", fnameh)
+
+    replace(fnameh,"XXX",bd)
+    replace(fnameh,"YYY",tf)
+    replace(fnameh,"@NBT@",nbt)
+    replace(fnameh,"@M8@",m8)
+    replace(fnameh,"@MT@",mt)
+    hc="0"
+    hc2="0"
+# Get Hash-to-Curve Z for G1 and G2
+
+    if isinstance(rz,list) :
+        if len(rz)==2 :     # Z followed by SSWU isogeny degree
+            replace(fnameh,"@RZ@",rz[0])
+            replace(fnameh,"@RZ2A@","0")
+            replace(fnameh,"@RZ2B@","0")
+            hc=rz[1]
+        if len(rz)==3 :     # Z for G1 followed by Z for G2 (for SVDW)
+            replace(fnameh,"@RZ@",rz[0])
+            replace(fnameh,"@RZ2A@",rz[1])
+            replace(fnameh,"@RZ2B@",rz[2])
+        if len(rz)==5 :     # Z for G1, Z for G2, SSWU isogeny degree for G1, SSWU isogeny degree for G2
+            replace(fnameh,"@RZ@",rz[0])
+            replace(fnameh,"@RZ2A@",rz[1])
+            replace(fnameh,"@RZ2B@",rz[2])
+            hc=rz[3]
+            hc2=rz[4]
+    else :
+        replace(fnameh,"@RZ@",rz)   # just Z for SSWU, or indicates RFC7748 or Generic for Elligator
+        replace(fnameh,"@RZ2A@","0")
+        replace(fnameh,"@RZ2B@","0")
+
+    itw=int(qi)%10
+    replace(fnameh,"@QI@",str(itw))
+    if int(qi)//10 > 0 :
+        replace(fnameh,"@TW@","POSITOWER")
+    else :
+        replace(fnameh,"@TW@","NEGATOWER")
+
+    ib=int(base)
+    inb=int(nb)
+    inbt=int(nbt)
+    nlen=(1+((8*inb-1)//ib))
+    sh=ib*nlen-inbt
+
+    if sh > 30 :
+        sh=30
+    replace(fnameh,"@SH@",str(sh))
+
+    fnameh="config_curve_"+tc+".h"
+    copy_keep_file("config_curve.h", fnameh)
+
+    replace(fnameh,"XXX",bd)
+    replace(fnameh,"YYY",tf)
+    replace(fnameh,"ZZZ",tc)
+    replace(fnameh,"@CT@",ct)
+    replace(fnameh,"@CA@",ca)
+    replace(fnameh,"@PF@",pf)
+
+    replace(fnameh,"@ST@",stw)
+    replace(fnameh,"@SX@",sx)
+    replace(fnameh,"@CS@",cs)
+    replace(fnameh,"@AB@",ab)
+    replace(fnameh,"@G2@",g2)
+
+    replace(fnameh,"@HC@",hc)
+    replace(fnameh,"@HC2@",hc2)
+
+    fnamec="big_"+bd+".cpp"
+    fnameh="big_"+bd+".h"
+
+    copy_temp_file("big.cpp", fnamec)
+    copy_keep_file("big.h", fnameh)
+
+    replace(fnamec,"XXX",bd)
+    replace(fnameh,"XXX",bd)
+
+    replace(fnamec,"INLINE_MUL1",inline_mul1(nlen,bd))
+    replace(fnamec,"INLINE_MUL2",inline_mul2(nlen,bd))
+    replace(fnamec,"INLINE_SQR",inline_sqr(nlen,bd))
+    replace(fnamec,"INLINE_REDC1",inline_redc1(nlen,bd))
+    replace(fnamec,"INLINE_REDC2",inline_redc2(nlen,bd))
+
+
+    miracl_compile.compile_file(3, fnamec)
+
+    fnamec="fp_"+tf+".cpp"
+    fnameh="fp_"+tf+".h"
+
+    copy_temp_file("fp.cpp", fnamec)
+    copy_keep_file("fp.h", fnameh)
+
+    replace(fnamec,"YYY",tf)
+    replace(fnamec,"XXX",bd)
+    replace(fnameh,"YYY",tf)
+    replace(fnameh,"XXX",bd)
+    miracl_compile.compile_file(3, fnamec)
+
+    miracl_compile.compile_file(3, "rom_field_"+tf+".cpp");
+
+    fnamec="ecp_"+tc+".cpp"
+    fnameh="ecp_"+tc+".h"
+
+    copy_temp_file("ecp.cpp", fnamec)
+    copy_keep_file("ecp.h", fnameh)
+
+    replace(fnamec,"ZZZ",tc)
+    replace(fnamec,"YYY",tf)
+    replace(fnamec,"XXX",bd)
+    replace(fnameh,"ZZZ",tc)
+    replace(fnameh,"YYY",tf)
+    replace(fnameh,"XXX",bd)
+    miracl_compile.compile_file(3, fnamec)
+
+    fnamec="ecdh_"+tc+".cpp"
+    fnameh="ecdh_"+tc+".h"
+
+    copy_temp_file("ecdh.cpp", fnamec)
+    copy_keep_file("ecdh.h", fnameh)
+
+    replace(fnamec,"ZZZ",tc)
+    replace(fnamec,"YYY",tf)
+    replace(fnamec,"XXX",bd)
+    replace(fnameh,"ZZZ",tc)
+    replace(fnameh,"YYY",tf)
+    replace(fnameh,"XXX",bd)
+    miracl_compile.compile_file(3, fnamec)
+
+    fnamec="eddsa_"+tc+".cpp"
+    fnameh="eddsa_"+tc+".h"
+
+    copy_temp_file("eddsa.cpp", fnamec)
+    copy_keep_file("eddsa.h", fnameh)
+
+    replace(fnamec,"ZZZ",tc)
+    replace(fnamec,"YYY",tf)
+    replace(fnamec,"XXX",bd)
+    replace(fnameh,"ZZZ",tc)
+    replace(fnameh,"YYY",tf)
+    replace(fnameh,"XXX",bd)
+    miracl_compile.compile_file(3, fnamec)
+
+
+    fnamec="hpke_"+tc+".cpp"
+    fnameh="hpke_"+tc+".h"
+
+    copy_temp_file("hpke.cpp", fnamec)
+    copy_keep_file("hpke.h", fnameh)
+
+    replace(fnamec,"ZZZ",tc)
+    replace(fnameh,"ZZZ",tc)
+    miracl_compile.compile_file(3, fnamec)
+
+    miracl_compile.compile_file(3, "rom_curve_"+tc+".cpp");
+
+    if pf != "NOT_PF" :
+        fnamec="fp2_"+tf+".cpp"
+        fnameh="fp2_"+tf+".h"
+
+        copy_temp_file("fp2.cpp", fnamec)
+        copy_keep_file("fp2.h", fnameh)
+        replace(fnamec,"YYY",tf)
+        replace(fnamec,"XXX",bd)
+        replace(fnameh,"YYY",tf)
+        replace(fnameh,"XXX",bd)
+        miracl_compile.compile_file(3, fnamec)
+
+        fnamec="fp4_"+tf+".cpp"
+        fnameh="fp4_"+tf+".h"
+
+        copy_temp_file("fp4.cpp", fnamec)
+        copy_keep_file("fp4.h", fnameh)
+
+        replace(fnamec,"YYY",tf)
+        replace(fnamec,"XXX",bd)
+        replace(fnamec,"ZZZ",tc)
+        replace(fnameh,"YYY",tf)
+        replace(fnameh,"XXX",bd)
+        replace(fnameh,"ZZZ",tc)
+        miracl_compile.compile_file(3, fnamec)
+
+        if pf == "BN_CURVE" or pf == "BLS12_CURVE" :
+            fnamec="fp12_"+tf+".cpp"
+            fnameh="fp12_"+tf+".h"
+
+            copy_temp_file("fp12.cpp", fnamec)
+            copy_keep_file("fp12.h", fnameh)
+
+            replace(fnamec,"YYY",tf)
+            replace(fnamec,"XXX",bd)
+            replace(fnamec,"ZZZ",tc)
+            replace(fnameh,"YYY",tf)
+            replace(fnameh,"XXX",bd)
+            replace(fnameh,"ZZZ",tc)
+            miracl_compile.compile_file(3, fnamec)
+
+            fnamec="ecp2_"+tc+".cpp"
+            fnameh="ecp2_"+tc+".h"
+
+            copy_temp_file("ecp2.cpp", fnamec)
+            copy_keep_file("ecp2.h", fnameh)
+
+            replace(fnamec,"ZZZ",tc)
+            replace(fnamec,"YYY",tf)
+            replace(fnamec,"XXX",bd)
+            replace(fnameh,"ZZZ",tc)
+            replace(fnameh,"YYY",tf)
+            replace(fnameh,"XXX",bd)
+            miracl_compile.compile_file(3, fnamec)
+
+            fnamec="pair_"+tc+".cpp"
+            fnameh="pair_"+tc+".h"
+
+            copy_temp_file("pair.cpp", fnamec)
+            copy_keep_file("pair.h", fnameh)
+
+            replace(fnamec,"ZZZ",tc)
+            replace(fnamec,"YYY",tf)
+            replace(fnamec,"XXX",bd)
+            replace(fnameh,"ZZZ",tc)
+            replace(fnameh,"YYY",tf)
+            replace(fnameh,"XXX",bd)
+            miracl_compile.compile_file(3, fnamec)
+
+            fnamec="mpin_"+tc+".cpp"
+            fnameh="mpin_"+tc+".h"
+
+            copy_temp_file("mpin.cpp", fnamec)
+            copy_keep_file("mpin.h", fnameh)
+
+            replace(fnamec,"ZZZ",tc)
+            replace(fnamec,"YYY",tf)
+            replace(fnamec,"XXX",bd)
+            replace(fnameh,"ZZZ",tc)
+            replace(fnameh,"YYY",tf)
+            replace(fnameh,"XXX",bd)
+            miracl_compile.compile_file(3, fnamec)
+
+            fnamec="bls_"+tc+".cpp"
+            fnameh="bls_"+tc+".h"
+
+            copy_temp_file("bls.cpp", fnamec)
+            copy_keep_file("bls.h", fnameh)
+
+            replace(fnamec,"ZZZ",tc)
+            replace(fnamec,"YYY",tf)
+            replace(fnamec,"XXX",bd)
+            replace(fnameh,"ZZZ",tc)
+            replace(fnameh,"YYY",tf)
+            replace(fnameh,"XXX",bd)
+            miracl_compile.compile_file(3, fnamec)
+
+        if pf == "BLS24_CURVE" :
+            fnamec="fp8_"+tf+".cpp"
+            fnameh="fp8_"+tf+".h"
+
+            copy_temp_file("fp8.cpp", fnamec)
+            copy_keep_file("fp8.h", fnameh)
+
+            replace(fnamec,"YYY",tf)
+            replace(fnamec,"XXX",bd)
+            replace(fnamec,"ZZZ",tc)
+            replace(fnameh,"YYY",tf)
+            replace(fnameh,"XXX",bd)
+            replace(fnameh,"ZZZ",tc)
+            miracl_compile.compile_file(3, fnamec)
+
+
+            fnamec="fp24_"+tf+".cpp"
+            fnameh="fp24_"+tf+".h"
+
+            copy_temp_file("fp24.cpp", fnamec)
+            copy_keep_file("fp24.h", fnameh)
+
+            replace(fnamec,"YYY",tf)
+            replace(fnamec,"XXX",bd)
+            replace(fnamec,"ZZZ",tc)
+            replace(fnameh,"YYY",tf)
+            replace(fnameh,"XXX",bd)
+            replace(fnameh,"ZZZ",tc)
+            miracl_compile.compile_file(3, fnamec)
+
+            fnamec="ecp4_"+tc+".cpp"
+            fnameh="ecp4_"+tc+".h"
+
+            copy_temp_file("ecp4.cpp", fnamec)
+            copy_keep_file("ecp4.h", fnameh)
+
+            replace(fnamec,"ZZZ",tc)
+            replace(fnamec,"YYY",tf)
+            replace(fnamec,"XXX",bd)
+            replace(fnameh,"ZZZ",tc)
+            replace(fnameh,"YYY",tf)
+            replace(fnameh,"XXX",bd)
+            miracl_compile.compile_file(3, fnamec)
+
+            fnamec="pair4_"+tc+".cpp"
+            fnameh="pair4_"+tc+".h"
+
+            copy_temp_file("pair4.cpp", fnamec)
+            copy_keep_file("pair4.h", fnameh)
+
+            replace(fnamec,"ZZZ",tc)
+            replace(fnamec,"YYY",tf)
+            replace(fnamec,"XXX",bd)
+            replace(fnameh,"ZZZ",tc)
+            replace(fnameh,"YYY",tf)
+            replace(fnameh,"XXX",bd)
+            miracl_compile.compile_file(3, fnamec)
+
+            fnamec="mpin192_"+tc+".cpp"
+            fnameh="mpin192_"+tc+".h"
+
+            copy_temp_file("mpin192.cpp", fnamec)
+            copy_keep_file("mpin192.h", fnameh)
+
+            replace(fnamec,"ZZZ",tc)
+            replace(fnamec,"YYY",tf)
+            replace(fnamec,"XXX",bd)
+            replace(fnameh,"ZZZ",tc)
+            replace(fnameh,"YYY",tf)
+            replace(fnameh,"XXX",bd)
+            miracl_compile.compile_file(3, fnamec)
+
+            fnamec="bls192_"+tc+".cpp"
+            fnameh="bls192_"+tc+".h"
+
+            copy_temp_file("bls192.cpp", fnamec)
+            copy_keep_file("bls192.h", fnameh)
+
+            replace(fnamec,"ZZZ",tc)
+            replace(fnamec,"YYY",tf)
+            replace(fnamec,"XXX",bd)
+            replace(fnameh,"ZZZ",tc)
+            replace(fnameh,"YYY",tf)
+            replace(fnameh,"XXX",bd)
+            miracl_compile.compile_file(3, fnamec)
+
+        if pf == "BLS48_CURVE" :
+
+            fnamec="fp8_"+tf+".cpp"
+            fnameh="fp8_"+tf+".h"
+
+            copy_temp_file("fp8.cpp", fnamec)
+            copy_keep_file("fp8.h", fnameh)
+
+            replace(fnamec,"YYY",tf)
+            replace(fnamec,"XXX",bd)
+            replace(fnamec,"ZZZ",tc)
+            replace(fnameh,"YYY",tf)
+            replace(fnameh,"XXX",bd)
+            replace(fnameh,"ZZZ",tc)
+            miracl_compile.compile_file(3, fnamec)
+
+
+            fnamec="ecp8_"+tc+".cpp"
+            fnameh="ecp8_"+tc+".h"
+
+            copy_temp_file("ecp8.cpp", fnamec)
+            copy_keep_file("ecp8.h", fnameh)
+
+            replace(fnamec,"ZZZ",tc)
+            replace(fnamec,"YYY",tf)
+            replace(fnamec,"XXX",bd)
+            replace(fnameh,"ZZZ",tc)
+            replace(fnameh,"YYY",tf)
+            replace(fnameh,"XXX",bd)
+            miracl_compile.compile_file(3, fnamec)
+
+
+            fnamec="fp16_"+tf+".cpp"
+            fnameh="fp16_"+tf+".h"
+
+            copy_temp_file("fp16.cpp", fnamec)
+            copy_keep_file("fp16.h", fnameh)
+
+            replace(fnamec,"YYY",tf)
+            replace(fnamec,"XXX",bd)
+            replace(fnamec,"ZZZ",tc)
+            replace(fnameh,"YYY",tf)
+            replace(fnameh,"XXX",bd)
+            replace(fnameh,"ZZZ",tc)
+            miracl_compile.compile_file(3, fnamec)
+
+
+            fnamec="fp48_"+tf+".cpp"
+            fnameh="fp48_"+tf+".h"
+
+            copy_temp_file("fp48.cpp", fnamec)
+            copy_keep_file("fp48.h", fnameh)
+
+            replace(fnamec,"YYY",tf)
+            replace(fnamec,"XXX",bd)
+            replace(fnamec,"ZZZ",tc)
+            replace(fnameh,"YYY",tf)
+            replace(fnameh,"XXX",bd)
+            replace(fnameh,"ZZZ",tc)
+            miracl_compile.compile_file(3, fnamec)
+
+
+            fnamec="pair8_"+tc+".cpp"
+            fnameh="pair8_"+tc+".h"
+
+            copy_temp_file("pair8.cpp", fnamec)
+            copy_keep_file("pair8.h", fnameh)
+
+            replace(fnamec,"ZZZ",tc)
+            replace(fnamec,"YYY",tf)
+            replace(fnamec,"XXX",bd)
+            replace(fnameh,"ZZZ",tc)
+            replace(fnameh,"YYY",tf)
+            replace(fnameh,"XXX",bd)
+            miracl_compile.compile_file(3, fnamec)
+
+            fnamec="mpin256_"+tc+".cpp"
+            fnameh="mpin256_"+tc+".h"
+
+            copy_temp_file("mpin256.cpp", fnamec)
+            copy_keep_file("mpin256.h", fnameh)
+
+            replace(fnamec,"ZZZ",tc)
+            replace(fnamec,"YYY",tf)
+            replace(fnamec,"XXX",bd)
+            replace(fnameh,"ZZZ",tc)
+            replace(fnameh,"YYY",tf)
+            replace(fnameh,"XXX",bd)
+            miracl_compile.compile_file(3, fnamec)
+
+            fnamec="bls256_"+tc+".cpp"
+            fnameh="bls256_"+tc+".h"
+
+            copy_temp_file("bls256.cpp", fnamec)
+            copy_keep_file("bls256.h", fnameh)
+
+            replace(fnamec,"ZZZ",tc)
+            replace(fnamec,"YYY",tf)
+            replace(fnamec,"XXX",bd)
+            replace(fnameh,"ZZZ",tc)
+            replace(fnameh,"YYY",tf)
+            replace(fnameh,"XXX",bd)
+            miracl_compile.compile_file(3, fnamec)
+
+class miracl_crypto:
+    np_curves = (
+        ( "255", "F25519", "Ed25519", "56", "2", "1", "PSEUDO_MERSENNE", "0", "EDWARDS", "-1", "NOT_PF", "", "", "", "", "128" ),
+        ( "255", "F25519", "C25519", "56", "2", "1", "PSEUDO_MERSENNE", "0", "MONTGOMERY", "486662", "NOT_PF", "", "", "", "", "128" ),
+        ( "256", "NIST256", "NIST256", "56", "1", "-10", "NOT_SPECIAL", "0", "WEIERSTRASS", "-3", "NOT_PF", "", "", "", "", "128" ),
+        ( "256", "BRAINPOOL", "BRAINPOOL", "56", "1", "-3", "NOT_SPECIAL", "0", "WEIERSTRASS", "-3", "NOT_PF", "", "", "", "", "128" ),
+        ( "256", "ANSSI", "ANSSI", "56", "1", "-5", "NOT_SPECIAL", "0", "WEIERSTRASS", "-3", "NOT_PF", "", "", "", "", "128" ),
+        ( "336", "HIFIVE", "HIFIVE", "60", "2", "1", "PSEUDO_MERSENNE", "0", "EDWARDS", "1", "NOT_PF", "", "", "", "", "192" ),
+        ( "448", "F448", "Ed448", "58", "1", "0", "GENERALISED_MERSENNE", "0", "EDWARDS", "1", "NOT_PF", "", "", "", "", "256" ),
+        ( "384", "NIST384", "NIST384", "56", "1", "-12", "NOT_SPECIAL", "0", "WEIERSTRASS", "-3", "NOT_PF", "", "", "", "", "192" ),
+        ( "414", "C41417", "C41417", "60", "1", "1", "PSEUDO_MERSENNE", "0", "EDWARDS", "1", "NOT_PF", "", "", "", "", "256" ),
+        ( "521", "NIST521", "NIST521", "60", "1", "-4", "PSEUDO_MERSENNE", "0", "WEIERSTRASS", "-3", "NOT_PF", "", "", "", "", "256" ),
+        ( "256", "F256PMW", "NUMS256W", "56", "1", "7", "PSEUDO_MERSENNE", "0", "WEIERSTRASS", "-3", "NOT_PF", "", "", "", "", "128" ),
+        ( "256", "F256PME", "NUMS256E", "56", "1", "0", "PSEUDO_MERSENNE", "0", "EDWARDS", "1", "NOT_PF", "", "", "", "", "128" ),
+        ( "384", "F384PM", "NUMS384W", "58", "1", "-4", "PSEUDO_MERSENNE", "0", "WEIERSTRASS", "-3", "NOT_PF", "", "", "", "", "192" ),
+        ( "384", "F384PM", "NUMS384E", "58", "1", "0", "PSEUDO_MERSENNE", "0", "EDWARDS", "1", "NOT_PF", "", "", "", "", "192" ),
+        ( "512", "F512PM", "NUMS512W", "60", "1", "-4", "PSEUDO_MERSENNE", "0", "WEIERSTRASS", "-3", "NOT_PF", "", "", "", "", "256" ),
+        ( "512", "F512PM", "NUMS512E", "60", "1", "0", "PSEUDO_MERSENNE", "0", "EDWARDS", "1", "NOT_PF", "", "", "", "", "256" ),
+        #                                            ,"1", for SVDW
+        # set for SSWU plus isogenies
+        ( "256", "SECP256K1", "SECP256K1", "56", "1",["-11", "3"], "NOT_SPECIAL", "0", "WEIERSTRASS", "0", "NOT_PF", "", "", "", "", "128" ),
+        ( "256", "SM2", "SM2", "56", "1", "-9", "NOT_SPECIAL", "0", "WEIERSTRASS", "-3", "NOT_PF", "", "", "", "", "128" ),
+        ( "255", "F25519", "C13318", "56", "2", "2", "PSEUDO_MERSENNE", "0", "WEIERSTRASS", "-3", "NOT_PF", "", "", "", "", "128" ),
+        ( "255", "JUBJUB", "JUBJUB", "56", "32", "1", "NOT_SPECIAL", "5", "EDWARDS", "-1", "NOT_PF", "", "", "", "", "128" ),
+        ( "448", "F448", "X448", "58", "1", "0", "GENERALISED_MERSENNE", "0", "MONTGOMERY", "156326", "NOT_PF", "", "", "", "", "256" ),
+        ( "160", "SECP160R1", "SECP160R1", "56", "1", "3", "NOT_SPECIAL", "0", "WEIERSTRASS", "-3", "NOT_PF", "", "", "", "", "128" ),
+        ( "251", "C1174", "C1174", "56", "1", "0", "PSEUDO_MERSENNE", "0", "EDWARDS", "1", "NOT_PF", "", "", "", "", "128" ),
+        ( "166", "C1665", "C1665", "60", "1", "0", "PSEUDO_MERSENNE", "0", "EDWARDS", "1", "NOT_PF", "", "", "", "", "128" ),
+        ( "256", "MDC", "MDC", "56", "1", "0", "NOT_SPECIAL", "0", "EDWARDS", "1", "NOT_PF", "", "", "", "", "128" ),
+        ( "255", "TWEEDLEDUM", "TWEEDLEDUM", "56", "33", "1", "NOT_SPECIAL", "5", "WEIERSTRASS", "0", "NOT_PF", "", "", "", "", "128" ),
+        ( "255", "TWEEDLEDEE", "TWEEDLEDEE", "56", "34", "1", "NOT_SPECIAL", "5", "WEIERSTRASS", "0", "NOT_PF", "", "", "", "", "128" )
+    )
+
+    pf_curves = (
+        ( "254", "BN254", "BN254", "56", "1",["-1", "-1", "0"], "NOT_SPECIAL", "0", "WEIERSTRASS", "0", "BN_CURVE", "D_TYPE", "NEGATIVEX", "71", "66", "128" ),
+        ( "254", "BN254CX", "BN254CX", "56", "1",["-1", "-1", "0"], "NOT_SPECIAL", "0", "WEIERSTRASS", "0", "BN_CURVE", "D_TYPE", "NEGATIVEX", "76", "66", "128" ),
+        ( "383", "BLS12383", "BLS12383", "58", "1",["1", "1", "0"], "NOT_SPECIAL", "0", "WEIERSTRASS", "0", "BLS12_CURVE", "M_TYPE", "POSITIVEX", "68", "65", "128" ),
+        #                                           ["-3" ,"-1", "0"]  for SVDW
+        # set for SSWU plus isogenies
+        ( "381", "BLS12381", "BLS12381", "58", "1",["11", "-2", "-1", "11", "3"], "NOT_SPECIAL", "0", "WEIERSTRASS", "0", "BLS12_CURVE", "M_TYPE", "NEGATIVEX", "69", "65", "128" ),
+        ( "256", "FP256BN", "FP256BN", "56", "1",["1", "1", "0"], "NOT_SPECIAL", "0", "WEIERSTRASS", "0", "BN_CURVE", "M_TYPE", "NEGATIVEX", "83", "66", "128" ),
+        ( "512", "FP512BN", "FP512BN", "60", "1",["1", "1", "0"], "NOT_SPECIAL", "0", "WEIERSTRASS", "0", "BN_CURVE", "M_TYPE", "POSITIVEX", "172", "130", "128" ),
+        ( "443", "BLS12443", "BLS12443", "60", "1",["-7", "1", "1", "11", "3"], "NOT_SPECIAL", "0", "WEIERSTRASS", "0", "BLS12_CURVE", "M_TYPE", "POSITIVEX", "78", "75", "128" ),
+        # https://eprint.iacr.org/2017/334.pdf
+        ( "461", "BLS12461", "BLS12461", "60", "1",["1", "4", "0"], "NOT_SPECIAL", "0", "WEIERSTRASS", "0", "BLS12_CURVE", "M_TYPE", "NEGATIVEX", "79", "78", "128" ),
+        ( "462", "BN462", "BN462", "60", "1",["1", "1", "0"], "NOT_SPECIAL", "1", "WEIERSTRASS", "0", "BN_CURVE", "D_TYPE", "POSITIVEX", "125", "118", "128" ),
+        ( "479", "BLS24479", "BLS24479", "56", "1",["1", "4", "0"], "NOT_SPECIAL", "0", "WEIERSTRASS", "0", "BLS24_CURVE", "M_TYPE", "POSITIVEX", "52", "49", "192" ),
+        ( "556", "BLS48556", "BLS48556", "58", "1",["-1", "2", "0"], "NOT_SPECIAL", "0", "WEIERSTRASS", "0", "BLS48_CURVE", "M_TYPE", "POSITIVEX", "35", "32", "256" ),
+        ( "581", "BLS48581", "BLS48581", "60", "1",["2", "2", "0"], "NOT_SPECIAL", "10", "WEIERSTRASS", "0", "BLS48_CURVE", "D_TYPE", "NEGATIVEX", "36", "33", "256" ),
+        ( "286", "BLS48286", "BLS48286", "60", "1",["1", "1", "0"], "NOT_SPECIAL", "0", "WEIERSTRASS", "0", "BLS48_CURVE", "M_TYPE", "POSITIVEX", "20", "17", "128" ),
+        ( "158", "BN158", "BN158", "56","1",["1", "1", "0"], "NOT_SPECIAL", "0", "WEIERSTRASS", "0","BN_CURVE","M_TYPE","NEGATIVEX","49","42","128")
+    )
+
+    # There are choices here, different ways of getting the same result, but some faster than others
+    rsa_params = (
+        # 256 is slower but may allow reuse of 256-bit BIGs used for elliptic curve
+        # 512 is faster.. but best is 1024
+        #("1024", "RSA2048", "58", "2"),
+        ("512", "RSA2048", "60", "4"),
+        #("256", "RSA2048", "56", "8"),
+        ("384", "RSA3072", "56", "8"),
+        #("256", "RSA4096", "56", "16"),
+        ("512", "RSA4096", "60", "8")
+    )
+
+    min_core_library = (
+        "randapi.cpp",
+        "hash.cpp",
+        "hmac.cpp",
+        "rand.cpp",
+        "oct.cpp",
+        "share.cpp",
+        "aes.cpp",
+        "gcm.cpp",
+        "newhope.cpp",
+        "dilithium.cpp",
+        "kyber.cpp",
+        "x509.cpp"
+    )
+
+    total_entries = len(np_curves)+len(pf_curves)+len(rsa_params)
+
+    def valid_query(number):
+        return number >= 0 and number <= miracl_crypto.total_entries
+
+def interactive_prompt_print():
+    index = 1
+    print("Elliptic Curves")
+    for tuple in miracl_crypto.np_curves:
+        print(str(index) + ".", tuple[2])
+        index += 1
+
+    print("\nPairing-Friendly Elliptic Curves")
+    for tuple in miracl_crypto.pf_curves:
+        print(str(index) + ".", tuple[2])
+        index += 1
+
+    print("\nRSA")
+    for tuple in miracl_crypto.rsa_params:
+        print(str(index) + ".", tuple[1])
+        index += 1
+
+def interactive_prompt_exect(index):
+    index -= 1 # Python internally is zero-indexed
+    if index < len(miracl_crypto.np_curves):
+        tuple = miracl_crypto.np_curves[index]
+        curveset(
+            tuple[0], tuple[1], tuple[2], tuple[3], tuple[4],
+            tuple[5], tuple[6], tuple[7], tuple[8], tuple[9],
+            tuple[10], tuple[11], tuple[12],
+            tuple[13], tuple[14], tuple[15]
+        )
+        #curve_selected=True
+    elif index < len(miracl_crypto.np_curves) + len(miracl_crypto.pf_curves):
+        tuple = miracl_crypto.pf_curves[index-len(miracl_crypto.np_curves)]
+        curveset(
+            tuple[0], tuple[1], tuple[2], tuple[3], tuple[4],
+            tuple[5], tuple[6], tuple[7], tuple[8], tuple[9],
+            tuple[10], tuple[11], tuple[12],
+            tuple[13], tuple[14], tuple[15]
+        )
+        #pfcurve_selected=True
+    else:
+        tuple = miracl_crypto.rsa_params[index-(len(miracl_crypto.np_curves)+len(miracl_crypto.pf_curves))]
+        rsaset(
+            tuple[0], tuple[1], tuple[2], tuple[3]
+        )
+        #rsa_selected=True
+
+def interactive_prompt_input():
+    while True:
+        userInput = input("\nChoose schemes to support (select 0 to finish): ")
+        try:
+            return int(userInput)
+        except:
+            if (userInput == ''):
+                return 0
+            print("Non-integer input, select values between 1 and " + str(miracl_crypto.total_entries))
+            interactive_prompt_input()
+
+def usage():
+    print("Usage: ./config64.py [OPTIONS] [ARGUMENTS]\n")
+    print("Option              Long Option              Action")
+    print("   -h, -?           --help                   Shows this message\n")
+    print("Script Behaviour:")
+    print("   -d               --disable-fastfail       Disable script termination if build fails (default: false)")
+    print("   -i               --ignore-environment     Do not read environment variables, rely on shell instead (default: false)\n")
+    print("Build Configuration:")
+    print("   -o               --options=1 --options=64 Disable interactive mode and select specific options")
+    print("   -r               --run-tests              Disable interactive mode, select all options, build and run tests")
+    print("                                             (implies --disable-fastfail, --ignore-environment)\n")
+
+def arg_manager(argv, build_options):
+    global testing, arg_options, fast_fail, intr, ignore_variables
+    # Account for legacy behaviour
+    # Should be removed in future releases
+    if len(argv) == 0:
+        intr = True
+        return False
+    if len(argv) == 1:
+        if (argv[0] == "test"):
+            testing = True
+            return False
+    # Now let's try to actually make sense of arguments
+    try:
+        opts, args = getopt.getopt(
+            argv,
+            "hdiro:",
+            ["help", "disable-fastfail", "ignore-environment", "run-tests", "options="]
+        )
+    except getopt.GetoptError as err:
+        print(err)
+        usage()
+        sys.exit(2)
+
+    for opt, arg in opts:
+        if opt in ['-h', '--help']:
+            usage()
+            sys.exit(0)
+        elif opt in ['-d', '--disable-fastfail']:
+            fast_fail = False
+        elif opt in ['-i', '--ignore-environment']:
+            ignore_variables = True
+        elif opt in ['-r', '--run-tests']:
+            testing = True
+            fast_fail = False
+            ignore_variables = True
+        elif opt in ['-o', '--options']:
+            arg_options = True
+            try:
+                intarg = int(arg)
+                if (intarg <= miracl_crypto.total_entries and intarg > 0):
+                    build_options.append(intarg)
+                else:
+                    raise ValueError("Value too low or too high!")
+            except:
+                print("config64.py: Error! You have passed an invalid option, exiting.")
+                print("             If you are trying to select multiple options, please repeat the flag\n")
+                print("             e.g. ")
+                print("                  ./config64.py -o 1 -o 23 -o 25")
+                sys.exit(1)
+    return len(opts) > 0 and not testing and arg_options
+
+def main(argv):
+    global testing, keep_querying, my_compiler, generated_files, arg_options, intr
+    options_list = []
+
+    replace("arch.h","@WL@","64")
+
+    if not arg_manager(argv, options_list):
+        if intr:
+            if not testing:
+                interactive_prompt_print()
+            while keep_querying and not testing:
+                query_val = -1
+                while not miracl_crypto.valid_query(query_val):
+                    query_val = interactive_prompt_input()
+                    if not miracl_crypto.valid_query(query_val):
+                        print("Number out of range, select values between 1 and " + str(miracl_crypto.total_entries))
+                    elif query_val == 0:
+                        keep_querying = False
+                    else:
+                        interactive_prompt_exect(query_val)
+        elif not arg_options and not testing:
+            print("config64.py: Invalid input, program terminating")
+            sys.exit(2)
+    else:
+        for i in options_list:
+            interactive_prompt_exect(i)
+
+    if testing:
+        for i in range(0, miracl_crypto.total_entries):
+            interactive_prompt_exect(i+1)
+
+    # create library
+    for f in miracl_crypto.min_core_library:
+        miracl_compile.compile_file(3, f)
+
+    if sys.platform.startswith("win") :
+        os.system("for %i in (*.o) do @echo %~nxi >> f.list")
+        os.system("ar rc core.a @f.list")
+        delete_file("f.list")
+    else :
+        os.system("ar rc core.a *.o")
+
+    if testing :
+        miracl_compile.compile_binary(2, "testecc.cpp", "core.a", "testecc")
+        miracl_compile.compile_binary(2, "testeddsa.cpp", "core.a", "testeddsa")
+        miracl_compile.compile_binary(2, "testmpin.cpp", "core.a", "testmpin")
+        miracl_compile.compile_binary(2, "testbls.cpp", "core.a", "testbls")
+        miracl_compile.compile_binary(2, "benchtest_all.cpp", "core.a", "benchtest_all")
+        miracl_compile.compile_binary(2, "testnhs.cpp", "core.a", "testnhs")
+        miracl_compile.compile_binary(2, "testdlthm.cpp", "core.a", "testdlthm")
+        miracl_compile.compile_binary(2, "testkyber.cpp", "core.a", "testkyber")
+
+    #clean up
+    for file in generated_files:
+        delete_file(file)
+    delete_file("*.o")
+    sys.exit(0)
+
+if __name__ == "__main__":
+    main(sys.argv[1:])
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_big.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_big.h
new file mode 100644
index 0000000..ce262ec
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_big.h
@@ -0,0 +1,31 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_BIG_XXX_H
+#define CONFIG_BIG_XXX_H
+
+#include"core.h"
+
+// BIG stuff
+
+#define MODBYTES_XXX @NB@
+#define BASEBITS_XXX @BASE@
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_big_B160_56.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_big_B160_56.h
new file mode 100644
index 0000000..e07a289
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_big_B160_56.h
@@ -0,0 +1,31 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_BIG_B160_56_H
+#define CONFIG_BIG_B160_56_H
+
+#include"core.h"
+
+// BIG stuff
+
+#define MODBYTES_B160_56 20
+#define BASEBITS_B160_56 56
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_big_B168_60.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_big_B168_60.h
new file mode 100644
index 0000000..5180f26
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_big_B168_60.h
@@ -0,0 +1,31 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_BIG_B168_60_H
+#define CONFIG_BIG_B168_60_H
+
+#include"core.h"
+
+// BIG stuff
+
+#define MODBYTES_B168_60 21
+#define BASEBITS_B168_60 60
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_big_B256_56.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_big_B256_56.h
new file mode 100644
index 0000000..0cb6488
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_big_B256_56.h
@@ -0,0 +1,31 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_BIG_B256_56_H
+#define CONFIG_BIG_B256_56_H
+
+#include"core.h"
+
+// BIG stuff
+
+#define MODBYTES_B256_56 32
+#define BASEBITS_B256_56 56
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_big_B288_60.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_big_B288_60.h
new file mode 100644
index 0000000..7aa116a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_big_B288_60.h
@@ -0,0 +1,31 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_BIG_B288_60_H
+#define CONFIG_BIG_B288_60_H
+
+#include"core.h"
+
+// BIG stuff
+
+#define MODBYTES_B288_60 36
+#define BASEBITS_B288_60 60
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_big_B336_60.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_big_B336_60.h
new file mode 100644
index 0000000..5cdd05d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_big_B336_60.h
@@ -0,0 +1,31 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_BIG_B336_60_H
+#define CONFIG_BIG_B336_60_H
+
+#include"core.h"
+
+// BIG stuff
+
+#define MODBYTES_B336_60 42
+#define BASEBITS_B336_60 60
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_big_B384_56.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_big_B384_56.h
new file mode 100644
index 0000000..acfb14f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_big_B384_56.h
@@ -0,0 +1,31 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_BIG_B384_56_H
+#define CONFIG_BIG_B384_56_H
+
+#include"core.h"
+
+// BIG stuff
+
+#define MODBYTES_B384_56 48
+#define BASEBITS_B384_56 56
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_big_B384_58.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_big_B384_58.h
new file mode 100644
index 0000000..0d9dce8
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_big_B384_58.h
@@ -0,0 +1,31 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_BIG_B384_58_H
+#define CONFIG_BIG_B384_58_H
+
+#include"core.h"
+
+// BIG stuff
+
+#define MODBYTES_B384_58 48
+#define BASEBITS_B384_58 58
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_big_B416_60.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_big_B416_60.h
new file mode 100644
index 0000000..8aaab21
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_big_B416_60.h
@@ -0,0 +1,31 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_BIG_B416_60_H
+#define CONFIG_BIG_B416_60_H
+
+#include"core.h"
+
+// BIG stuff
+
+#define MODBYTES_B416_60 52
+#define BASEBITS_B416_60 60
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_big_B448_58.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_big_B448_58.h
new file mode 100644
index 0000000..83fff6c
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_big_B448_58.h
@@ -0,0 +1,31 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_BIG_B448_58_H
+#define CONFIG_BIG_B448_58_H
+
+#include"core.h"
+
+// BIG stuff
+
+#define MODBYTES_B448_58 56
+#define BASEBITS_B448_58 58
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_big_B448_60.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_big_B448_60.h
new file mode 100644
index 0000000..c031342
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_big_B448_60.h
@@ -0,0 +1,31 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_BIG_B448_60_H
+#define CONFIG_BIG_B448_60_H
+
+#include"core.h"
+
+// BIG stuff
+
+#define MODBYTES_B448_60 56
+#define BASEBITS_B448_60 60
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_big_B464_60.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_big_B464_60.h
new file mode 100644
index 0000000..cc0daa5
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_big_B464_60.h
@@ -0,0 +1,31 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_BIG_B464_60_H
+#define CONFIG_BIG_B464_60_H
+
+#include"core.h"
+
+// BIG stuff
+
+#define MODBYTES_B464_60 58
+#define BASEBITS_B464_60 60
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_big_B480_56.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_big_B480_56.h
new file mode 100644
index 0000000..1b0f11f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_big_B480_56.h
@@ -0,0 +1,31 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_BIG_B480_56_H
+#define CONFIG_BIG_B480_56_H
+
+#include"core.h"
+
+// BIG stuff
+
+#define MODBYTES_B480_56 60
+#define BASEBITS_B480_56 56
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_big_B512_60.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_big_B512_60.h
new file mode 100644
index 0000000..e2dce43
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_big_B512_60.h
@@ -0,0 +1,31 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_BIG_B512_60_H
+#define CONFIG_BIG_B512_60_H
+
+#include"core.h"
+
+// BIG stuff
+
+#define MODBYTES_B512_60 64
+#define BASEBITS_B512_60 60
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_big_B528_60.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_big_B528_60.h
new file mode 100644
index 0000000..fa3c8dc
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_big_B528_60.h
@@ -0,0 +1,31 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_BIG_B528_60_H
+#define CONFIG_BIG_B528_60_H
+
+#include"core.h"
+
+// BIG stuff
+
+#define MODBYTES_B528_60 66
+#define BASEBITS_B528_60 60
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_big_B560_58.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_big_B560_58.h
new file mode 100644
index 0000000..c2f9f59
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_big_B560_58.h
@@ -0,0 +1,31 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_BIG_B560_58_H
+#define CONFIG_BIG_B560_58_H
+
+#include"core.h"
+
+// BIG stuff
+
+#define MODBYTES_B560_58 70
+#define BASEBITS_B560_58 58
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_big_B584_60.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_big_B584_60.h
new file mode 100644
index 0000000..733d55e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_big_B584_60.h
@@ -0,0 +1,31 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_BIG_B584_60_H
+#define CONFIG_BIG_B584_60_H
+
+#include"core.h"
+
+// BIG stuff
+
+#define MODBYTES_B584_60 73
+#define BASEBITS_B584_60 60
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve.h
new file mode 100644
index 0000000..d7858d8
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_ZZZ_H
+#define CONFIG_CURVE_ZZZ_H
+
+#include"core.h"
+#include"config_field_YYY.h"
+
+// ECP stuff
+
+#define CURVETYPE_ZZZ @CT@
+#define CURVE_A_ZZZ @CA@
+#define PAIRING_FRIENDLY_ZZZ @PF@
+#define CURVE_SECURITY_ZZZ @CS@
+#define HTC_ISO_ZZZ @HC@
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_ZZZ
+
+#if PAIRING_FRIENDLY_ZZZ != NOT_PF
+
+#define HTC_ISO_G2_ZZZ @HC2@
+
+#define USE_GLV_ZZZ   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_ZZZ /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_ZZZ /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_ZZZ @ST@
+#define SIGN_OF_X_ZZZ @SX@
+
+#define ATE_BITS_ZZZ @AB@
+#define G2_TABLE_ZZZ @G2@
+
+#endif
+
+
+#if CURVE_SECURITY_ZZZ == 128
+#define AESKEY_ZZZ 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_ZZZ SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_ZZZ == 192
+#define AESKEY_ZZZ 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_ZZZ SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_ZZZ == 256
+#define AESKEY_ZZZ 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_ZZZ SHA512  /**< Hash type */
+#endif
+
+
+namespace ZZZ_BIG = XXX;
+namespace ZZZ_FP = YYY;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_ANSSI.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_ANSSI.h
new file mode 100644
index 0000000..9b5648f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_ANSSI.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_ANSSI_H
+#define CONFIG_CURVE_ANSSI_H
+
+#include"core.h"
+#include"config_field_ANSSI.h"
+
+// ECP stuff
+
+#define CURVETYPE_ANSSI WEIERSTRASS
+#define CURVE_A_ANSSI -3
+#define PAIRING_FRIENDLY_ANSSI NOT_PF
+#define CURVE_SECURITY_ANSSI 128
+#define HTC_ISO_ANSSI 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_ANSSI
+
+#if PAIRING_FRIENDLY_ANSSI != NOT_PF
+
+#define HTC_ISO_G2_ANSSI 0
+
+#define USE_GLV_ANSSI   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_ANSSI /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_ANSSI /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_ANSSI 
+#define SIGN_OF_X_ANSSI 
+
+#define ATE_BITS_ANSSI 
+#define G2_TABLE_ANSSI 
+
+#endif
+
+
+#if CURVE_SECURITY_ANSSI == 128
+#define AESKEY_ANSSI 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_ANSSI SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_ANSSI == 192
+#define AESKEY_ANSSI 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_ANSSI SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_ANSSI == 256
+#define AESKEY_ANSSI 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_ANSSI SHA512  /**< Hash type */
+#endif
+
+
+namespace ANSSI_BIG = B256_56;
+namespace ANSSI_FP = ANSSI;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_BLS12381.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_BLS12381.h
new file mode 100644
index 0000000..14993f8
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_BLS12381.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_BLS12381_H
+#define CONFIG_CURVE_BLS12381_H
+
+#include"core.h"
+#include"config_field_BLS12381.h"
+
+// ECP stuff
+
+#define CURVETYPE_BLS12381 WEIERSTRASS
+#define CURVE_A_BLS12381 0
+#define PAIRING_FRIENDLY_BLS12381 BLS12_CURVE
+#define CURVE_SECURITY_BLS12381 128
+#define HTC_ISO_BLS12381 11
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_BLS12381
+
+#if PAIRING_FRIENDLY_BLS12381 != NOT_PF
+
+#define HTC_ISO_G2_BLS12381 3
+
+#define USE_GLV_BLS12381   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_BLS12381 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_BLS12381 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_BLS12381 M_TYPE
+#define SIGN_OF_X_BLS12381 NEGATIVEX
+
+#define ATE_BITS_BLS12381 65
+#define G2_TABLE_BLS12381 69
+
+#endif
+
+
+#if CURVE_SECURITY_BLS12381 == 128
+#define AESKEY_BLS12381 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_BLS12381 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BLS12381 == 192
+#define AESKEY_BLS12381 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_BLS12381 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BLS12381 == 256
+#define AESKEY_BLS12381 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_BLS12381 SHA512  /**< Hash type */
+#endif
+
+
+namespace BLS12381_BIG = B384_58;
+namespace BLS12381_FP = BLS12381;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_BLS12383.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_BLS12383.h
new file mode 100644
index 0000000..9c50bfc
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_BLS12383.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_BLS12383_H
+#define CONFIG_CURVE_BLS12383_H
+
+#include"core.h"
+#include"config_field_BLS12383.h"
+
+// ECP stuff
+
+#define CURVETYPE_BLS12383 WEIERSTRASS
+#define CURVE_A_BLS12383 0
+#define PAIRING_FRIENDLY_BLS12383 BLS12_CURVE
+#define CURVE_SECURITY_BLS12383 128
+#define HTC_ISO_BLS12383 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_BLS12383
+
+#if PAIRING_FRIENDLY_BLS12383 != NOT_PF
+
+#define HTC_ISO_G2_BLS12383 0
+
+#define USE_GLV_BLS12383   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_BLS12383 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_BLS12383 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_BLS12383 M_TYPE
+#define SIGN_OF_X_BLS12383 POSITIVEX
+
+#define ATE_BITS_BLS12383 65
+#define G2_TABLE_BLS12383 68
+
+#endif
+
+
+#if CURVE_SECURITY_BLS12383 == 128
+#define AESKEY_BLS12383 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_BLS12383 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BLS12383 == 192
+#define AESKEY_BLS12383 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_BLS12383 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BLS12383 == 256
+#define AESKEY_BLS12383 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_BLS12383 SHA512  /**< Hash type */
+#endif
+
+
+namespace BLS12383_BIG = B384_58;
+namespace BLS12383_FP = BLS12383;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_BLS12443.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_BLS12443.h
new file mode 100644
index 0000000..087b02f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_BLS12443.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_BLS12443_H
+#define CONFIG_CURVE_BLS12443_H
+
+#include"core.h"
+#include"config_field_BLS12443.h"
+
+// ECP stuff
+
+#define CURVETYPE_BLS12443 WEIERSTRASS
+#define CURVE_A_BLS12443 0
+#define PAIRING_FRIENDLY_BLS12443 BLS12_CURVE
+#define CURVE_SECURITY_BLS12443 128
+#define HTC_ISO_BLS12443 11
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_BLS12443
+
+#if PAIRING_FRIENDLY_BLS12443 != NOT_PF
+
+#define HTC_ISO_G2_BLS12443 3
+
+#define USE_GLV_BLS12443   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_BLS12443 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_BLS12443 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_BLS12443 M_TYPE
+#define SIGN_OF_X_BLS12443 POSITIVEX
+
+#define ATE_BITS_BLS12443 75
+#define G2_TABLE_BLS12443 78
+
+#endif
+
+
+#if CURVE_SECURITY_BLS12443 == 128
+#define AESKEY_BLS12443 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_BLS12443 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BLS12443 == 192
+#define AESKEY_BLS12443 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_BLS12443 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BLS12443 == 256
+#define AESKEY_BLS12443 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_BLS12443 SHA512  /**< Hash type */
+#endif
+
+
+namespace BLS12443_BIG = B448_60;
+namespace BLS12443_FP = BLS12443;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_BLS12461.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_BLS12461.h
new file mode 100644
index 0000000..1648b99
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_BLS12461.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_BLS12461_H
+#define CONFIG_CURVE_BLS12461_H
+
+#include"core.h"
+#include"config_field_BLS12461.h"
+
+// ECP stuff
+
+#define CURVETYPE_BLS12461 WEIERSTRASS
+#define CURVE_A_BLS12461 0
+#define PAIRING_FRIENDLY_BLS12461 BLS12_CURVE
+#define CURVE_SECURITY_BLS12461 128
+#define HTC_ISO_BLS12461 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_BLS12461
+
+#if PAIRING_FRIENDLY_BLS12461 != NOT_PF
+
+#define HTC_ISO_G2_BLS12461 0
+
+#define USE_GLV_BLS12461   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_BLS12461 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_BLS12461 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_BLS12461 M_TYPE
+#define SIGN_OF_X_BLS12461 NEGATIVEX
+
+#define ATE_BITS_BLS12461 78
+#define G2_TABLE_BLS12461 79
+
+#endif
+
+
+#if CURVE_SECURITY_BLS12461 == 128
+#define AESKEY_BLS12461 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_BLS12461 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BLS12461 == 192
+#define AESKEY_BLS12461 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_BLS12461 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BLS12461 == 256
+#define AESKEY_BLS12461 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_BLS12461 SHA512  /**< Hash type */
+#endif
+
+
+namespace BLS12461_BIG = B464_60;
+namespace BLS12461_FP = BLS12461;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_BLS24479.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_BLS24479.h
new file mode 100644
index 0000000..1c1735b
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_BLS24479.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_BLS24479_H
+#define CONFIG_CURVE_BLS24479_H
+
+#include"core.h"
+#include"config_field_BLS24479.h"
+
+// ECP stuff
+
+#define CURVETYPE_BLS24479 WEIERSTRASS
+#define CURVE_A_BLS24479 0
+#define PAIRING_FRIENDLY_BLS24479 BLS24_CURVE
+#define CURVE_SECURITY_BLS24479 192
+#define HTC_ISO_BLS24479 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_BLS24479
+
+#if PAIRING_FRIENDLY_BLS24479 != NOT_PF
+
+#define HTC_ISO_G2_BLS24479 0
+
+#define USE_GLV_BLS24479   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_BLS24479 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_BLS24479 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_BLS24479 M_TYPE
+#define SIGN_OF_X_BLS24479 POSITIVEX
+
+#define ATE_BITS_BLS24479 49
+#define G2_TABLE_BLS24479 52
+
+#endif
+
+
+#if CURVE_SECURITY_BLS24479 == 128
+#define AESKEY_BLS24479 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_BLS24479 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BLS24479 == 192
+#define AESKEY_BLS24479 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_BLS24479 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BLS24479 == 256
+#define AESKEY_BLS24479 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_BLS24479 SHA512  /**< Hash type */
+#endif
+
+
+namespace BLS24479_BIG = B480_56;
+namespace BLS24479_FP = BLS24479;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_BLS48286.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_BLS48286.h
new file mode 100644
index 0000000..792c00e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_BLS48286.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_BLS48286_H
+#define CONFIG_CURVE_BLS48286_H
+
+#include"core.h"
+#include"config_field_BLS48286.h"
+
+// ECP stuff
+
+#define CURVETYPE_BLS48286 WEIERSTRASS
+#define CURVE_A_BLS48286 0
+#define PAIRING_FRIENDLY_BLS48286 BLS48_CURVE
+#define CURVE_SECURITY_BLS48286 128
+#define HTC_ISO_BLS48286 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_BLS48286
+
+#if PAIRING_FRIENDLY_BLS48286 != NOT_PF
+
+#define HTC_ISO_G2_BLS48286 0
+
+#define USE_GLV_BLS48286   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_BLS48286 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_BLS48286 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_BLS48286 M_TYPE
+#define SIGN_OF_X_BLS48286 POSITIVEX
+
+#define ATE_BITS_BLS48286 17
+#define G2_TABLE_BLS48286 20
+
+#endif
+
+
+#if CURVE_SECURITY_BLS48286 == 128
+#define AESKEY_BLS48286 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_BLS48286 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BLS48286 == 192
+#define AESKEY_BLS48286 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_BLS48286 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BLS48286 == 256
+#define AESKEY_BLS48286 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_BLS48286 SHA512  /**< Hash type */
+#endif
+
+
+namespace BLS48286_BIG = B288_60;
+namespace BLS48286_FP = BLS48286;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_BLS48556.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_BLS48556.h
new file mode 100644
index 0000000..dd20b2a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_BLS48556.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_BLS48556_H
+#define CONFIG_CURVE_BLS48556_H
+
+#include"core.h"
+#include"config_field_BLS48556.h"
+
+// ECP stuff
+
+#define CURVETYPE_BLS48556 WEIERSTRASS
+#define CURVE_A_BLS48556 0
+#define PAIRING_FRIENDLY_BLS48556 BLS48_CURVE
+#define CURVE_SECURITY_BLS48556 256
+#define HTC_ISO_BLS48556 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_BLS48556
+
+#if PAIRING_FRIENDLY_BLS48556 != NOT_PF
+
+#define HTC_ISO_G2_BLS48556 0
+
+#define USE_GLV_BLS48556   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_BLS48556 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_BLS48556 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_BLS48556 M_TYPE
+#define SIGN_OF_X_BLS48556 POSITIVEX
+
+#define ATE_BITS_BLS48556 32
+#define G2_TABLE_BLS48556 35
+
+#endif
+
+
+#if CURVE_SECURITY_BLS48556 == 128
+#define AESKEY_BLS48556 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_BLS48556 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BLS48556 == 192
+#define AESKEY_BLS48556 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_BLS48556 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BLS48556 == 256
+#define AESKEY_BLS48556 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_BLS48556 SHA512  /**< Hash type */
+#endif
+
+
+namespace BLS48556_BIG = B560_58;
+namespace BLS48556_FP = BLS48556;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_BLS48581.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_BLS48581.h
new file mode 100644
index 0000000..fe21b47
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_BLS48581.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_BLS48581_H
+#define CONFIG_CURVE_BLS48581_H
+
+#include"core.h"
+#include"config_field_BLS48581.h"
+
+// ECP stuff
+
+#define CURVETYPE_BLS48581 WEIERSTRASS
+#define CURVE_A_BLS48581 0
+#define PAIRING_FRIENDLY_BLS48581 BLS48_CURVE
+#define CURVE_SECURITY_BLS48581 256
+#define HTC_ISO_BLS48581 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_BLS48581
+
+#if PAIRING_FRIENDLY_BLS48581 != NOT_PF
+
+#define HTC_ISO_G2_BLS48581 0
+
+#define USE_GLV_BLS48581   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_BLS48581 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_BLS48581 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_BLS48581 D_TYPE
+#define SIGN_OF_X_BLS48581 NEGATIVEX
+
+#define ATE_BITS_BLS48581 33
+#define G2_TABLE_BLS48581 36
+
+#endif
+
+
+#if CURVE_SECURITY_BLS48581 == 128
+#define AESKEY_BLS48581 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_BLS48581 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BLS48581 == 192
+#define AESKEY_BLS48581 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_BLS48581 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BLS48581 == 256
+#define AESKEY_BLS48581 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_BLS48581 SHA512  /**< Hash type */
+#endif
+
+
+namespace BLS48581_BIG = B584_60;
+namespace BLS48581_FP = BLS48581;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_BN158.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_BN158.h
new file mode 100644
index 0000000..821f6ac
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_BN158.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_BN158_H
+#define CONFIG_CURVE_BN158_H
+
+#include"core.h"
+#include"config_field_BN158.h"
+
+// ECP stuff
+
+#define CURVETYPE_BN158 WEIERSTRASS
+#define CURVE_A_BN158 0
+#define PAIRING_FRIENDLY_BN158 BN_CURVE
+#define CURVE_SECURITY_BN158 128
+#define HTC_ISO_BN158 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_BN158
+
+#if PAIRING_FRIENDLY_BN158 != NOT_PF
+
+#define HTC_ISO_G2_BN158 0
+
+#define USE_GLV_BN158   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_BN158 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_BN158 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_BN158 M_TYPE
+#define SIGN_OF_X_BN158 NEGATIVEX
+
+#define ATE_BITS_BN158 42
+#define G2_TABLE_BN158 49
+
+#endif
+
+
+#if CURVE_SECURITY_BN158 == 128
+#define AESKEY_BN158 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_BN158 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BN158 == 192
+#define AESKEY_BN158 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_BN158 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BN158 == 256
+#define AESKEY_BN158 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_BN158 SHA512  /**< Hash type */
+#endif
+
+
+namespace BN158_BIG = B160_56;
+namespace BN158_FP = BN158;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_BN254.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_BN254.h
new file mode 100644
index 0000000..f1bef15
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_BN254.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_BN254_H
+#define CONFIG_CURVE_BN254_H
+
+#include"core.h"
+#include"config_field_BN254.h"
+
+// ECP stuff
+
+#define CURVETYPE_BN254 WEIERSTRASS
+#define CURVE_A_BN254 0
+#define PAIRING_FRIENDLY_BN254 BN_CURVE
+#define CURVE_SECURITY_BN254 128
+#define HTC_ISO_BN254 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_BN254
+
+#if PAIRING_FRIENDLY_BN254 != NOT_PF
+
+#define HTC_ISO_G2_BN254 0
+
+#define USE_GLV_BN254   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_BN254 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_BN254 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_BN254 D_TYPE
+#define SIGN_OF_X_BN254 NEGATIVEX
+
+#define ATE_BITS_BN254 66
+#define G2_TABLE_BN254 71
+
+#endif
+
+
+#if CURVE_SECURITY_BN254 == 128
+#define AESKEY_BN254 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_BN254 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BN254 == 192
+#define AESKEY_BN254 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_BN254 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BN254 == 256
+#define AESKEY_BN254 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_BN254 SHA512  /**< Hash type */
+#endif
+
+
+namespace BN254_BIG = B256_56;
+namespace BN254_FP = BN254;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_BN254CX.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_BN254CX.h
new file mode 100644
index 0000000..f446cac
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_BN254CX.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_BN254CX_H
+#define CONFIG_CURVE_BN254CX_H
+
+#include"core.h"
+#include"config_field_BN254CX.h"
+
+// ECP stuff
+
+#define CURVETYPE_BN254CX WEIERSTRASS
+#define CURVE_A_BN254CX 0
+#define PAIRING_FRIENDLY_BN254CX BN_CURVE
+#define CURVE_SECURITY_BN254CX 128
+#define HTC_ISO_BN254CX 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_BN254CX
+
+#if PAIRING_FRIENDLY_BN254CX != NOT_PF
+
+#define HTC_ISO_G2_BN254CX 0
+
+#define USE_GLV_BN254CX   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_BN254CX /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_BN254CX /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_BN254CX D_TYPE
+#define SIGN_OF_X_BN254CX NEGATIVEX
+
+#define ATE_BITS_BN254CX 66
+#define G2_TABLE_BN254CX 76
+
+#endif
+
+
+#if CURVE_SECURITY_BN254CX == 128
+#define AESKEY_BN254CX 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_BN254CX SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BN254CX == 192
+#define AESKEY_BN254CX 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_BN254CX SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BN254CX == 256
+#define AESKEY_BN254CX 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_BN254CX SHA512  /**< Hash type */
+#endif
+
+
+namespace BN254CX_BIG = B256_56;
+namespace BN254CX_FP = BN254CX;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_BN462.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_BN462.h
new file mode 100644
index 0000000..51b4309
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_BN462.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_BN462_H
+#define CONFIG_CURVE_BN462_H
+
+#include"core.h"
+#include"config_field_BN462.h"
+
+// ECP stuff
+
+#define CURVETYPE_BN462 WEIERSTRASS
+#define CURVE_A_BN462 0
+#define PAIRING_FRIENDLY_BN462 BN_CURVE
+#define CURVE_SECURITY_BN462 128
+#define HTC_ISO_BN462 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_BN462
+
+#if PAIRING_FRIENDLY_BN462 != NOT_PF
+
+#define HTC_ISO_G2_BN462 0
+
+#define USE_GLV_BN462   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_BN462 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_BN462 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_BN462 D_TYPE
+#define SIGN_OF_X_BN462 POSITIVEX
+
+#define ATE_BITS_BN462 118
+#define G2_TABLE_BN462 125
+
+#endif
+
+
+#if CURVE_SECURITY_BN462 == 128
+#define AESKEY_BN462 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_BN462 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BN462 == 192
+#define AESKEY_BN462 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_BN462 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BN462 == 256
+#define AESKEY_BN462 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_BN462 SHA512  /**< Hash type */
+#endif
+
+
+namespace BN462_BIG = B464_60;
+namespace BN462_FP = BN462;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_BRAINPOOL.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_BRAINPOOL.h
new file mode 100644
index 0000000..29cd927
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_BRAINPOOL.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_BRAINPOOL_H
+#define CONFIG_CURVE_BRAINPOOL_H
+
+#include"core.h"
+#include"config_field_BRAINPOOL.h"
+
+// ECP stuff
+
+#define CURVETYPE_BRAINPOOL WEIERSTRASS
+#define CURVE_A_BRAINPOOL -3
+#define PAIRING_FRIENDLY_BRAINPOOL NOT_PF
+#define CURVE_SECURITY_BRAINPOOL 128
+#define HTC_ISO_BRAINPOOL 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_BRAINPOOL
+
+#if PAIRING_FRIENDLY_BRAINPOOL != NOT_PF
+
+#define HTC_ISO_G2_BRAINPOOL 0
+
+#define USE_GLV_BRAINPOOL   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_BRAINPOOL /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_BRAINPOOL /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_BRAINPOOL 
+#define SIGN_OF_X_BRAINPOOL 
+
+#define ATE_BITS_BRAINPOOL 
+#define G2_TABLE_BRAINPOOL 
+
+#endif
+
+
+#if CURVE_SECURITY_BRAINPOOL == 128
+#define AESKEY_BRAINPOOL 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_BRAINPOOL SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BRAINPOOL == 192
+#define AESKEY_BRAINPOOL 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_BRAINPOOL SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BRAINPOOL == 256
+#define AESKEY_BRAINPOOL 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_BRAINPOOL SHA512  /**< Hash type */
+#endif
+
+
+namespace BRAINPOOL_BIG = B256_56;
+namespace BRAINPOOL_FP = BRAINPOOL;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_C1174.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_C1174.h
new file mode 100644
index 0000000..d759ba7
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_C1174.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_C1174_H
+#define CONFIG_CURVE_C1174_H
+
+#include"core.h"
+#include"config_field_C1174.h"
+
+// ECP stuff
+
+#define CURVETYPE_C1174 EDWARDS
+#define CURVE_A_C1174 1
+#define PAIRING_FRIENDLY_C1174 NOT_PF
+#define CURVE_SECURITY_C1174 128
+#define HTC_ISO_C1174 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_C1174
+
+#if PAIRING_FRIENDLY_C1174 != NOT_PF
+
+#define HTC_ISO_G2_C1174 0
+
+#define USE_GLV_C1174   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_C1174 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_C1174 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_C1174 
+#define SIGN_OF_X_C1174 
+
+#define ATE_BITS_C1174 
+#define G2_TABLE_C1174 
+
+#endif
+
+
+#if CURVE_SECURITY_C1174 == 128
+#define AESKEY_C1174 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_C1174 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_C1174 == 192
+#define AESKEY_C1174 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_C1174 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_C1174 == 256
+#define AESKEY_C1174 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_C1174 SHA512  /**< Hash type */
+#endif
+
+
+namespace C1174_BIG = B256_56;
+namespace C1174_FP = C1174;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_C13318.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_C13318.h
new file mode 100644
index 0000000..eea03ff
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_C13318.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_C13318_H
+#define CONFIG_CURVE_C13318_H
+
+#include"core.h"
+#include"config_field_F25519.h"
+
+// ECP stuff
+
+#define CURVETYPE_C13318 WEIERSTRASS
+#define CURVE_A_C13318 -3
+#define PAIRING_FRIENDLY_C13318 NOT_PF
+#define CURVE_SECURITY_C13318 128
+#define HTC_ISO_C13318 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_C13318
+
+#if PAIRING_FRIENDLY_C13318 != NOT_PF
+
+#define HTC_ISO_G2_C13318 0
+
+#define USE_GLV_C13318   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_C13318 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_C13318 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_C13318 
+#define SIGN_OF_X_C13318 
+
+#define ATE_BITS_C13318 
+#define G2_TABLE_C13318 
+
+#endif
+
+
+#if CURVE_SECURITY_C13318 == 128
+#define AESKEY_C13318 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_C13318 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_C13318 == 192
+#define AESKEY_C13318 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_C13318 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_C13318 == 256
+#define AESKEY_C13318 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_C13318 SHA512  /**< Hash type */
+#endif
+
+
+namespace C13318_BIG = B256_56;
+namespace C13318_FP = F25519;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_C1665.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_C1665.h
new file mode 100644
index 0000000..f8239c7
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_C1665.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_C1665_H
+#define CONFIG_CURVE_C1665_H
+
+#include"core.h"
+#include"config_field_C1665.h"
+
+// ECP stuff
+
+#define CURVETYPE_C1665 EDWARDS
+#define CURVE_A_C1665 1
+#define PAIRING_FRIENDLY_C1665 NOT_PF
+#define CURVE_SECURITY_C1665 128
+#define HTC_ISO_C1665 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_C1665
+
+#if PAIRING_FRIENDLY_C1665 != NOT_PF
+
+#define HTC_ISO_G2_C1665 0
+
+#define USE_GLV_C1665   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_C1665 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_C1665 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_C1665 
+#define SIGN_OF_X_C1665 
+
+#define ATE_BITS_C1665 
+#define G2_TABLE_C1665 
+
+#endif
+
+
+#if CURVE_SECURITY_C1665 == 128
+#define AESKEY_C1665 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_C1665 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_C1665 == 192
+#define AESKEY_C1665 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_C1665 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_C1665 == 256
+#define AESKEY_C1665 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_C1665 SHA512  /**< Hash type */
+#endif
+
+
+namespace C1665_BIG = B168_60;
+namespace C1665_FP = C1665;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_C25519.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_C25519.h
new file mode 100644
index 0000000..ffa0325
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_C25519.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_C25519_H
+#define CONFIG_CURVE_C25519_H
+
+#include"core.h"
+#include"config_field_F25519.h"
+
+// ECP stuff
+
+#define CURVETYPE_C25519 MONTGOMERY
+#define CURVE_A_C25519 486662
+#define PAIRING_FRIENDLY_C25519 NOT_PF
+#define CURVE_SECURITY_C25519 128
+#define HTC_ISO_C25519 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_C25519
+
+#if PAIRING_FRIENDLY_C25519 != NOT_PF
+
+#define HTC_ISO_G2_C25519 0
+
+#define USE_GLV_C25519   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_C25519 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_C25519 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_C25519 
+#define SIGN_OF_X_C25519 
+
+#define ATE_BITS_C25519 
+#define G2_TABLE_C25519 
+
+#endif
+
+
+#if CURVE_SECURITY_C25519 == 128
+#define AESKEY_C25519 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_C25519 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_C25519 == 192
+#define AESKEY_C25519 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_C25519 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_C25519 == 256
+#define AESKEY_C25519 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_C25519 SHA512  /**< Hash type */
+#endif
+
+
+namespace C25519_BIG = B256_56;
+namespace C25519_FP = F25519;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_C41417.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_C41417.h
new file mode 100644
index 0000000..f66b588
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_C41417.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_C41417_H
+#define CONFIG_CURVE_C41417_H
+
+#include"core.h"
+#include"config_field_C41417.h"
+
+// ECP stuff
+
+#define CURVETYPE_C41417 EDWARDS
+#define CURVE_A_C41417 1
+#define PAIRING_FRIENDLY_C41417 NOT_PF
+#define CURVE_SECURITY_C41417 256
+#define HTC_ISO_C41417 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_C41417
+
+#if PAIRING_FRIENDLY_C41417 != NOT_PF
+
+#define HTC_ISO_G2_C41417 0
+
+#define USE_GLV_C41417   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_C41417 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_C41417 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_C41417 
+#define SIGN_OF_X_C41417 
+
+#define ATE_BITS_C41417 
+#define G2_TABLE_C41417 
+
+#endif
+
+
+#if CURVE_SECURITY_C41417 == 128
+#define AESKEY_C41417 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_C41417 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_C41417 == 192
+#define AESKEY_C41417 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_C41417 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_C41417 == 256
+#define AESKEY_C41417 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_C41417 SHA512  /**< Hash type */
+#endif
+
+
+namespace C41417_BIG = B416_60;
+namespace C41417_FP = C41417;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_Ed25519.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_Ed25519.h
new file mode 100644
index 0000000..3f5ace7
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_Ed25519.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_Ed25519_H
+#define CONFIG_CURVE_Ed25519_H
+
+#include"core.h"
+#include"config_field_F25519.h"
+
+// ECP stuff
+
+#define CURVETYPE_Ed25519 EDWARDS
+#define CURVE_A_Ed25519 -1
+#define PAIRING_FRIENDLY_Ed25519 NOT_PF
+#define CURVE_SECURITY_Ed25519 128
+#define HTC_ISO_Ed25519 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_Ed25519
+
+#if PAIRING_FRIENDLY_Ed25519 != NOT_PF
+
+#define HTC_ISO_G2_Ed25519 0
+
+#define USE_GLV_Ed25519   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_Ed25519 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_Ed25519 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_Ed25519 
+#define SIGN_OF_X_Ed25519 
+
+#define ATE_BITS_Ed25519 
+#define G2_TABLE_Ed25519 
+
+#endif
+
+
+#if CURVE_SECURITY_Ed25519 == 128
+#define AESKEY_Ed25519 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_Ed25519 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_Ed25519 == 192
+#define AESKEY_Ed25519 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_Ed25519 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_Ed25519 == 256
+#define AESKEY_Ed25519 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_Ed25519 SHA512  /**< Hash type */
+#endif
+
+
+namespace Ed25519_BIG = B256_56;
+namespace Ed25519_FP = F25519;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_Ed448.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_Ed448.h
new file mode 100644
index 0000000..f85c80e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_Ed448.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_Ed448_H
+#define CONFIG_CURVE_Ed448_H
+
+#include"core.h"
+#include"config_field_F448.h"
+
+// ECP stuff
+
+#define CURVETYPE_Ed448 EDWARDS
+#define CURVE_A_Ed448 1
+#define PAIRING_FRIENDLY_Ed448 NOT_PF
+#define CURVE_SECURITY_Ed448 256
+#define HTC_ISO_Ed448 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_Ed448
+
+#if PAIRING_FRIENDLY_Ed448 != NOT_PF
+
+#define HTC_ISO_G2_Ed448 0
+
+#define USE_GLV_Ed448   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_Ed448 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_Ed448 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_Ed448 
+#define SIGN_OF_X_Ed448 
+
+#define ATE_BITS_Ed448 
+#define G2_TABLE_Ed448 
+
+#endif
+
+
+#if CURVE_SECURITY_Ed448 == 128
+#define AESKEY_Ed448 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_Ed448 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_Ed448 == 192
+#define AESKEY_Ed448 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_Ed448 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_Ed448 == 256
+#define AESKEY_Ed448 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_Ed448 SHA512  /**< Hash type */
+#endif
+
+
+namespace Ed448_BIG = B448_58;
+namespace Ed448_FP = F448;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_FP256BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_FP256BN.h
new file mode 100644
index 0000000..3174557
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_FP256BN.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_FP256BN_H
+#define CONFIG_CURVE_FP256BN_H
+
+#include"core.h"
+#include"config_field_FP256BN.h"
+
+// ECP stuff
+
+#define CURVETYPE_FP256BN WEIERSTRASS
+#define CURVE_A_FP256BN 0
+#define PAIRING_FRIENDLY_FP256BN BN_CURVE
+#define CURVE_SECURITY_FP256BN 128
+#define HTC_ISO_FP256BN 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_FP256BN
+
+#if PAIRING_FRIENDLY_FP256BN != NOT_PF
+
+#define HTC_ISO_G2_FP256BN 0
+
+#define USE_GLV_FP256BN   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_FP256BN /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_FP256BN /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_FP256BN M_TYPE
+#define SIGN_OF_X_FP256BN NEGATIVEX
+
+#define ATE_BITS_FP256BN 66
+#define G2_TABLE_FP256BN 83
+
+#endif
+
+
+#if CURVE_SECURITY_FP256BN == 128
+#define AESKEY_FP256BN 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_FP256BN SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_FP256BN == 192
+#define AESKEY_FP256BN 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_FP256BN SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_FP256BN == 256
+#define AESKEY_FP256BN 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_FP256BN SHA512  /**< Hash type */
+#endif
+
+
+namespace FP256BN_BIG = B256_56;
+namespace FP256BN_FP = FP256BN;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_FP512BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_FP512BN.h
new file mode 100644
index 0000000..c66ae27
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_FP512BN.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_FP512BN_H
+#define CONFIG_CURVE_FP512BN_H
+
+#include"core.h"
+#include"config_field_FP512BN.h"
+
+// ECP stuff
+
+#define CURVETYPE_FP512BN WEIERSTRASS
+#define CURVE_A_FP512BN 0
+#define PAIRING_FRIENDLY_FP512BN BN_CURVE
+#define CURVE_SECURITY_FP512BN 128
+#define HTC_ISO_FP512BN 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_FP512BN
+
+#if PAIRING_FRIENDLY_FP512BN != NOT_PF
+
+#define HTC_ISO_G2_FP512BN 0
+
+#define USE_GLV_FP512BN   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_FP512BN /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_FP512BN /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_FP512BN M_TYPE
+#define SIGN_OF_X_FP512BN POSITIVEX
+
+#define ATE_BITS_FP512BN 130
+#define G2_TABLE_FP512BN 172
+
+#endif
+
+
+#if CURVE_SECURITY_FP512BN == 128
+#define AESKEY_FP512BN 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_FP512BN SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_FP512BN == 192
+#define AESKEY_FP512BN 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_FP512BN SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_FP512BN == 256
+#define AESKEY_FP512BN 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_FP512BN SHA512  /**< Hash type */
+#endif
+
+
+namespace FP512BN_BIG = B512_60;
+namespace FP512BN_FP = FP512BN;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_HIFIVE.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_HIFIVE.h
new file mode 100644
index 0000000..436a71f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_HIFIVE.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_HIFIVE_H
+#define CONFIG_CURVE_HIFIVE_H
+
+#include"core.h"
+#include"config_field_HIFIVE.h"
+
+// ECP stuff
+
+#define CURVETYPE_HIFIVE EDWARDS
+#define CURVE_A_HIFIVE 1
+#define PAIRING_FRIENDLY_HIFIVE NOT_PF
+#define CURVE_SECURITY_HIFIVE 192
+#define HTC_ISO_HIFIVE 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_HIFIVE
+
+#if PAIRING_FRIENDLY_HIFIVE != NOT_PF
+
+#define HTC_ISO_G2_HIFIVE 0
+
+#define USE_GLV_HIFIVE   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_HIFIVE /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_HIFIVE /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_HIFIVE 
+#define SIGN_OF_X_HIFIVE 
+
+#define ATE_BITS_HIFIVE 
+#define G2_TABLE_HIFIVE 
+
+#endif
+
+
+#if CURVE_SECURITY_HIFIVE == 128
+#define AESKEY_HIFIVE 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_HIFIVE SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_HIFIVE == 192
+#define AESKEY_HIFIVE 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_HIFIVE SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_HIFIVE == 256
+#define AESKEY_HIFIVE 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_HIFIVE SHA512  /**< Hash type */
+#endif
+
+
+namespace HIFIVE_BIG = B336_60;
+namespace HIFIVE_FP = HIFIVE;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_JUBJUB.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_JUBJUB.h
new file mode 100644
index 0000000..bfe0f80
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_JUBJUB.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_JUBJUB_H
+#define CONFIG_CURVE_JUBJUB_H
+
+#include"core.h"
+#include"config_field_JUBJUB.h"
+
+// ECP stuff
+
+#define CURVETYPE_JUBJUB EDWARDS
+#define CURVE_A_JUBJUB -1
+#define PAIRING_FRIENDLY_JUBJUB NOT_PF
+#define CURVE_SECURITY_JUBJUB 128
+#define HTC_ISO_JUBJUB 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_JUBJUB
+
+#if PAIRING_FRIENDLY_JUBJUB != NOT_PF
+
+#define HTC_ISO_G2_JUBJUB 0
+
+#define USE_GLV_JUBJUB   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_JUBJUB /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_JUBJUB /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_JUBJUB 
+#define SIGN_OF_X_JUBJUB 
+
+#define ATE_BITS_JUBJUB 
+#define G2_TABLE_JUBJUB 
+
+#endif
+
+
+#if CURVE_SECURITY_JUBJUB == 128
+#define AESKEY_JUBJUB 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_JUBJUB SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_JUBJUB == 192
+#define AESKEY_JUBJUB 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_JUBJUB SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_JUBJUB == 256
+#define AESKEY_JUBJUB 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_JUBJUB SHA512  /**< Hash type */
+#endif
+
+
+namespace JUBJUB_BIG = B256_56;
+namespace JUBJUB_FP = JUBJUB;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_MDC.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_MDC.h
new file mode 100644
index 0000000..6828668
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_MDC.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_MDC_H
+#define CONFIG_CURVE_MDC_H
+
+#include"core.h"
+#include"config_field_MDC.h"
+
+// ECP stuff
+
+#define CURVETYPE_MDC EDWARDS
+#define CURVE_A_MDC 1
+#define PAIRING_FRIENDLY_MDC NOT_PF
+#define CURVE_SECURITY_MDC 128
+#define HTC_ISO_MDC 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_MDC
+
+#if PAIRING_FRIENDLY_MDC != NOT_PF
+
+#define HTC_ISO_G2_MDC 0
+
+#define USE_GLV_MDC   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_MDC /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_MDC /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_MDC 
+#define SIGN_OF_X_MDC 
+
+#define ATE_BITS_MDC 
+#define G2_TABLE_MDC 
+
+#endif
+
+
+#if CURVE_SECURITY_MDC == 128
+#define AESKEY_MDC 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_MDC SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_MDC == 192
+#define AESKEY_MDC 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_MDC SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_MDC == 256
+#define AESKEY_MDC 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_MDC SHA512  /**< Hash type */
+#endif
+
+
+namespace MDC_BIG = B256_56;
+namespace MDC_FP = MDC;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_NIST256.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_NIST256.h
new file mode 100644
index 0000000..78c0807
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_NIST256.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_NIST256_H
+#define CONFIG_CURVE_NIST256_H
+
+#include"core.h"
+#include"config_field_NIST256.h"
+
+// ECP stuff
+
+#define CURVETYPE_NIST256 WEIERSTRASS
+#define CURVE_A_NIST256 -3
+#define PAIRING_FRIENDLY_NIST256 NOT_PF
+#define CURVE_SECURITY_NIST256 128
+#define HTC_ISO_NIST256 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_NIST256
+
+#if PAIRING_FRIENDLY_NIST256 != NOT_PF
+
+#define HTC_ISO_G2_NIST256 0
+
+#define USE_GLV_NIST256   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_NIST256 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_NIST256 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_NIST256 
+#define SIGN_OF_X_NIST256 
+
+#define ATE_BITS_NIST256 
+#define G2_TABLE_NIST256 
+
+#endif
+
+
+#if CURVE_SECURITY_NIST256 == 128
+#define AESKEY_NIST256 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_NIST256 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_NIST256 == 192
+#define AESKEY_NIST256 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_NIST256 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_NIST256 == 256
+#define AESKEY_NIST256 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_NIST256 SHA512  /**< Hash type */
+#endif
+
+
+namespace NIST256_BIG = B256_56;
+namespace NIST256_FP = NIST256;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_NIST384.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_NIST384.h
new file mode 100644
index 0000000..1a089b1
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_NIST384.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_NIST384_H
+#define CONFIG_CURVE_NIST384_H
+
+#include"core.h"
+#include"config_field_NIST384.h"
+
+// ECP stuff
+
+#define CURVETYPE_NIST384 WEIERSTRASS
+#define CURVE_A_NIST384 -3
+#define PAIRING_FRIENDLY_NIST384 NOT_PF
+#define CURVE_SECURITY_NIST384 192
+#define HTC_ISO_NIST384 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_NIST384
+
+#if PAIRING_FRIENDLY_NIST384 != NOT_PF
+
+#define HTC_ISO_G2_NIST384 0
+
+#define USE_GLV_NIST384   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_NIST384 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_NIST384 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_NIST384 
+#define SIGN_OF_X_NIST384 
+
+#define ATE_BITS_NIST384 
+#define G2_TABLE_NIST384 
+
+#endif
+
+
+#if CURVE_SECURITY_NIST384 == 128
+#define AESKEY_NIST384 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_NIST384 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_NIST384 == 192
+#define AESKEY_NIST384 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_NIST384 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_NIST384 == 256
+#define AESKEY_NIST384 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_NIST384 SHA512  /**< Hash type */
+#endif
+
+
+namespace NIST384_BIG = B384_56;
+namespace NIST384_FP = NIST384;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_NIST521.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_NIST521.h
new file mode 100644
index 0000000..9bad49d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_NIST521.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_NIST521_H
+#define CONFIG_CURVE_NIST521_H
+
+#include"core.h"
+#include"config_field_NIST521.h"
+
+// ECP stuff
+
+#define CURVETYPE_NIST521 WEIERSTRASS
+#define CURVE_A_NIST521 -3
+#define PAIRING_FRIENDLY_NIST521 NOT_PF
+#define CURVE_SECURITY_NIST521 256
+#define HTC_ISO_NIST521 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_NIST521
+
+#if PAIRING_FRIENDLY_NIST521 != NOT_PF
+
+#define HTC_ISO_G2_NIST521 0
+
+#define USE_GLV_NIST521   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_NIST521 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_NIST521 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_NIST521 
+#define SIGN_OF_X_NIST521 
+
+#define ATE_BITS_NIST521 
+#define G2_TABLE_NIST521 
+
+#endif
+
+
+#if CURVE_SECURITY_NIST521 == 128
+#define AESKEY_NIST521 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_NIST521 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_NIST521 == 192
+#define AESKEY_NIST521 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_NIST521 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_NIST521 == 256
+#define AESKEY_NIST521 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_NIST521 SHA512  /**< Hash type */
+#endif
+
+
+namespace NIST521_BIG = B528_60;
+namespace NIST521_FP = NIST521;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_NUMS256E.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_NUMS256E.h
new file mode 100644
index 0000000..765d71f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_NUMS256E.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_NUMS256E_H
+#define CONFIG_CURVE_NUMS256E_H
+
+#include"core.h"
+#include"config_field_F256PME.h"
+
+// ECP stuff
+
+#define CURVETYPE_NUMS256E EDWARDS
+#define CURVE_A_NUMS256E 1
+#define PAIRING_FRIENDLY_NUMS256E NOT_PF
+#define CURVE_SECURITY_NUMS256E 128
+#define HTC_ISO_NUMS256E 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_NUMS256E
+
+#if PAIRING_FRIENDLY_NUMS256E != NOT_PF
+
+#define HTC_ISO_G2_NUMS256E 0
+
+#define USE_GLV_NUMS256E   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_NUMS256E /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_NUMS256E /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_NUMS256E 
+#define SIGN_OF_X_NUMS256E 
+
+#define ATE_BITS_NUMS256E 
+#define G2_TABLE_NUMS256E 
+
+#endif
+
+
+#if CURVE_SECURITY_NUMS256E == 128
+#define AESKEY_NUMS256E 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_NUMS256E SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_NUMS256E == 192
+#define AESKEY_NUMS256E 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_NUMS256E SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_NUMS256E == 256
+#define AESKEY_NUMS256E 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_NUMS256E SHA512  /**< Hash type */
+#endif
+
+
+namespace NUMS256E_BIG = B256_56;
+namespace NUMS256E_FP = F256PME;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_NUMS256W.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_NUMS256W.h
new file mode 100644
index 0000000..3c7901f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_NUMS256W.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_NUMS256W_H
+#define CONFIG_CURVE_NUMS256W_H
+
+#include"core.h"
+#include"config_field_F256PMW.h"
+
+// ECP stuff
+
+#define CURVETYPE_NUMS256W WEIERSTRASS
+#define CURVE_A_NUMS256W -3
+#define PAIRING_FRIENDLY_NUMS256W NOT_PF
+#define CURVE_SECURITY_NUMS256W 128
+#define HTC_ISO_NUMS256W 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_NUMS256W
+
+#if PAIRING_FRIENDLY_NUMS256W != NOT_PF
+
+#define HTC_ISO_G2_NUMS256W 0
+
+#define USE_GLV_NUMS256W   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_NUMS256W /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_NUMS256W /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_NUMS256W 
+#define SIGN_OF_X_NUMS256W 
+
+#define ATE_BITS_NUMS256W 
+#define G2_TABLE_NUMS256W 
+
+#endif
+
+
+#if CURVE_SECURITY_NUMS256W == 128
+#define AESKEY_NUMS256W 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_NUMS256W SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_NUMS256W == 192
+#define AESKEY_NUMS256W 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_NUMS256W SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_NUMS256W == 256
+#define AESKEY_NUMS256W 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_NUMS256W SHA512  /**< Hash type */
+#endif
+
+
+namespace NUMS256W_BIG = B256_56;
+namespace NUMS256W_FP = F256PMW;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_NUMS384E.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_NUMS384E.h
new file mode 100644
index 0000000..db14475
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_NUMS384E.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_NUMS384E_H
+#define CONFIG_CURVE_NUMS384E_H
+
+#include"core.h"
+#include"config_field_F384PM.h"
+
+// ECP stuff
+
+#define CURVETYPE_NUMS384E EDWARDS
+#define CURVE_A_NUMS384E 1
+#define PAIRING_FRIENDLY_NUMS384E NOT_PF
+#define CURVE_SECURITY_NUMS384E 192
+#define HTC_ISO_NUMS384E 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_NUMS384E
+
+#if PAIRING_FRIENDLY_NUMS384E != NOT_PF
+
+#define HTC_ISO_G2_NUMS384E 0
+
+#define USE_GLV_NUMS384E   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_NUMS384E /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_NUMS384E /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_NUMS384E 
+#define SIGN_OF_X_NUMS384E 
+
+#define ATE_BITS_NUMS384E 
+#define G2_TABLE_NUMS384E 
+
+#endif
+
+
+#if CURVE_SECURITY_NUMS384E == 128
+#define AESKEY_NUMS384E 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_NUMS384E SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_NUMS384E == 192
+#define AESKEY_NUMS384E 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_NUMS384E SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_NUMS384E == 256
+#define AESKEY_NUMS384E 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_NUMS384E SHA512  /**< Hash type */
+#endif
+
+
+namespace NUMS384E_BIG = B384_58;
+namespace NUMS384E_FP = F384PM;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_NUMS384W.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_NUMS384W.h
new file mode 100644
index 0000000..83ea507
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_NUMS384W.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_NUMS384W_H
+#define CONFIG_CURVE_NUMS384W_H
+
+#include"core.h"
+#include"config_field_F384PM.h"
+
+// ECP stuff
+
+#define CURVETYPE_NUMS384W WEIERSTRASS
+#define CURVE_A_NUMS384W -3
+#define PAIRING_FRIENDLY_NUMS384W NOT_PF
+#define CURVE_SECURITY_NUMS384W 192
+#define HTC_ISO_NUMS384W 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_NUMS384W
+
+#if PAIRING_FRIENDLY_NUMS384W != NOT_PF
+
+#define HTC_ISO_G2_NUMS384W 0
+
+#define USE_GLV_NUMS384W   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_NUMS384W /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_NUMS384W /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_NUMS384W 
+#define SIGN_OF_X_NUMS384W 
+
+#define ATE_BITS_NUMS384W 
+#define G2_TABLE_NUMS384W 
+
+#endif
+
+
+#if CURVE_SECURITY_NUMS384W == 128
+#define AESKEY_NUMS384W 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_NUMS384W SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_NUMS384W == 192
+#define AESKEY_NUMS384W 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_NUMS384W SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_NUMS384W == 256
+#define AESKEY_NUMS384W 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_NUMS384W SHA512  /**< Hash type */
+#endif
+
+
+namespace NUMS384W_BIG = B384_58;
+namespace NUMS384W_FP = F384PM;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_NUMS512E.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_NUMS512E.h
new file mode 100644
index 0000000..6cc80c8
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_NUMS512E.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_NUMS512E_H
+#define CONFIG_CURVE_NUMS512E_H
+
+#include"core.h"
+#include"config_field_F512PM.h"
+
+// ECP stuff
+
+#define CURVETYPE_NUMS512E EDWARDS
+#define CURVE_A_NUMS512E 1
+#define PAIRING_FRIENDLY_NUMS512E NOT_PF
+#define CURVE_SECURITY_NUMS512E 256
+#define HTC_ISO_NUMS512E 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_NUMS512E
+
+#if PAIRING_FRIENDLY_NUMS512E != NOT_PF
+
+#define HTC_ISO_G2_NUMS512E 0
+
+#define USE_GLV_NUMS512E   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_NUMS512E /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_NUMS512E /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_NUMS512E 
+#define SIGN_OF_X_NUMS512E 
+
+#define ATE_BITS_NUMS512E 
+#define G2_TABLE_NUMS512E 
+
+#endif
+
+
+#if CURVE_SECURITY_NUMS512E == 128
+#define AESKEY_NUMS512E 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_NUMS512E SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_NUMS512E == 192
+#define AESKEY_NUMS512E 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_NUMS512E SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_NUMS512E == 256
+#define AESKEY_NUMS512E 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_NUMS512E SHA512  /**< Hash type */
+#endif
+
+
+namespace NUMS512E_BIG = B512_60;
+namespace NUMS512E_FP = F512PM;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_NUMS512W.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_NUMS512W.h
new file mode 100644
index 0000000..6d9d739
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_NUMS512W.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_NUMS512W_H
+#define CONFIG_CURVE_NUMS512W_H
+
+#include"core.h"
+#include"config_field_F512PM.h"
+
+// ECP stuff
+
+#define CURVETYPE_NUMS512W WEIERSTRASS
+#define CURVE_A_NUMS512W -3
+#define PAIRING_FRIENDLY_NUMS512W NOT_PF
+#define CURVE_SECURITY_NUMS512W 256
+#define HTC_ISO_NUMS512W 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_NUMS512W
+
+#if PAIRING_FRIENDLY_NUMS512W != NOT_PF
+
+#define HTC_ISO_G2_NUMS512W 0
+
+#define USE_GLV_NUMS512W   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_NUMS512W /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_NUMS512W /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_NUMS512W 
+#define SIGN_OF_X_NUMS512W 
+
+#define ATE_BITS_NUMS512W 
+#define G2_TABLE_NUMS512W 
+
+#endif
+
+
+#if CURVE_SECURITY_NUMS512W == 128
+#define AESKEY_NUMS512W 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_NUMS512W SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_NUMS512W == 192
+#define AESKEY_NUMS512W 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_NUMS512W SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_NUMS512W == 256
+#define AESKEY_NUMS512W 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_NUMS512W SHA512  /**< Hash type */
+#endif
+
+
+namespace NUMS512W_BIG = B512_60;
+namespace NUMS512W_FP = F512PM;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_SECP160R1.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_SECP160R1.h
new file mode 100644
index 0000000..21bdc09
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_SECP160R1.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_SECP160R1_H
+#define CONFIG_CURVE_SECP160R1_H
+
+#include"core.h"
+#include"config_field_SECP160R1.h"
+
+// ECP stuff
+
+#define CURVETYPE_SECP160R1 WEIERSTRASS
+#define CURVE_A_SECP160R1 -3
+#define PAIRING_FRIENDLY_SECP160R1 NOT_PF
+#define CURVE_SECURITY_SECP160R1 128
+#define HTC_ISO_SECP160R1 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_SECP160R1
+
+#if PAIRING_FRIENDLY_SECP160R1 != NOT_PF
+
+#define HTC_ISO_G2_SECP160R1 0
+
+#define USE_GLV_SECP160R1   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_SECP160R1 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_SECP160R1 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_SECP160R1 
+#define SIGN_OF_X_SECP160R1 
+
+#define ATE_BITS_SECP160R1 
+#define G2_TABLE_SECP160R1 
+
+#endif
+
+
+#if CURVE_SECURITY_SECP160R1 == 128
+#define AESKEY_SECP160R1 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_SECP160R1 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_SECP160R1 == 192
+#define AESKEY_SECP160R1 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_SECP160R1 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_SECP160R1 == 256
+#define AESKEY_SECP160R1 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_SECP160R1 SHA512  /**< Hash type */
+#endif
+
+
+namespace SECP160R1_BIG = B160_56;
+namespace SECP160R1_FP = SECP160R1;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_SECP256K1.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_SECP256K1.h
new file mode 100644
index 0000000..01676ab
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_SECP256K1.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_SECP256K1_H
+#define CONFIG_CURVE_SECP256K1_H
+
+#include"core.h"
+#include"config_field_SECP256K1.h"
+
+// ECP stuff
+
+#define CURVETYPE_SECP256K1 WEIERSTRASS
+#define CURVE_A_SECP256K1 0
+#define PAIRING_FRIENDLY_SECP256K1 NOT_PF
+#define CURVE_SECURITY_SECP256K1 128
+#define HTC_ISO_SECP256K1 3
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_SECP256K1
+
+#if PAIRING_FRIENDLY_SECP256K1 != NOT_PF
+
+#define HTC_ISO_G2_SECP256K1 0
+
+#define USE_GLV_SECP256K1   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_SECP256K1 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_SECP256K1 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_SECP256K1 
+#define SIGN_OF_X_SECP256K1 
+
+#define ATE_BITS_SECP256K1 
+#define G2_TABLE_SECP256K1 
+
+#endif
+
+
+#if CURVE_SECURITY_SECP256K1 == 128
+#define AESKEY_SECP256K1 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_SECP256K1 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_SECP256K1 == 192
+#define AESKEY_SECP256K1 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_SECP256K1 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_SECP256K1 == 256
+#define AESKEY_SECP256K1 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_SECP256K1 SHA512  /**< Hash type */
+#endif
+
+
+namespace SECP256K1_BIG = B256_56;
+namespace SECP256K1_FP = SECP256K1;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_SM2.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_SM2.h
new file mode 100644
index 0000000..6207f4f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_SM2.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_SM2_H
+#define CONFIG_CURVE_SM2_H
+
+#include"core.h"
+#include"config_field_SM2.h"
+
+// ECP stuff
+
+#define CURVETYPE_SM2 WEIERSTRASS
+#define CURVE_A_SM2 -3
+#define PAIRING_FRIENDLY_SM2 NOT_PF
+#define CURVE_SECURITY_SM2 128
+#define HTC_ISO_SM2 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_SM2
+
+#if PAIRING_FRIENDLY_SM2 != NOT_PF
+
+#define HTC_ISO_G2_SM2 0
+
+#define USE_GLV_SM2   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_SM2 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_SM2 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_SM2 
+#define SIGN_OF_X_SM2 
+
+#define ATE_BITS_SM2 
+#define G2_TABLE_SM2 
+
+#endif
+
+
+#if CURVE_SECURITY_SM2 == 128
+#define AESKEY_SM2 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_SM2 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_SM2 == 192
+#define AESKEY_SM2 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_SM2 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_SM2 == 256
+#define AESKEY_SM2 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_SM2 SHA512  /**< Hash type */
+#endif
+
+
+namespace SM2_BIG = B256_56;
+namespace SM2_FP = SM2;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_TWEEDLEDEE.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_TWEEDLEDEE.h
new file mode 100644
index 0000000..329e004
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_TWEEDLEDEE.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_TWEEDLEDEE_H
+#define CONFIG_CURVE_TWEEDLEDEE_H
+
+#include"core.h"
+#include"config_field_TWEEDLEDEE.h"
+
+// ECP stuff
+
+#define CURVETYPE_TWEEDLEDEE WEIERSTRASS
+#define CURVE_A_TWEEDLEDEE 0
+#define PAIRING_FRIENDLY_TWEEDLEDEE NOT_PF
+#define CURVE_SECURITY_TWEEDLEDEE 128
+#define HTC_ISO_TWEEDLEDEE 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_TWEEDLEDEE
+
+#if PAIRING_FRIENDLY_TWEEDLEDEE != NOT_PF
+
+#define HTC_ISO_G2_TWEEDLEDEE 0
+
+#define USE_GLV_TWEEDLEDEE   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_TWEEDLEDEE /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_TWEEDLEDEE /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_TWEEDLEDEE 
+#define SIGN_OF_X_TWEEDLEDEE 
+
+#define ATE_BITS_TWEEDLEDEE 
+#define G2_TABLE_TWEEDLEDEE 
+
+#endif
+
+
+#if CURVE_SECURITY_TWEEDLEDEE == 128
+#define AESKEY_TWEEDLEDEE 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_TWEEDLEDEE SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_TWEEDLEDEE == 192
+#define AESKEY_TWEEDLEDEE 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_TWEEDLEDEE SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_TWEEDLEDEE == 256
+#define AESKEY_TWEEDLEDEE 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_TWEEDLEDEE SHA512  /**< Hash type */
+#endif
+
+
+namespace TWEEDLEDEE_BIG = B256_56;
+namespace TWEEDLEDEE_FP = TWEEDLEDEE;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_TWEEDLEDUM.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_TWEEDLEDUM.h
new file mode 100644
index 0000000..07fb3d7
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_TWEEDLEDUM.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_TWEEDLEDUM_H
+#define CONFIG_CURVE_TWEEDLEDUM_H
+
+#include"core.h"
+#include"config_field_TWEEDLEDUM.h"
+
+// ECP stuff
+
+#define CURVETYPE_TWEEDLEDUM WEIERSTRASS
+#define CURVE_A_TWEEDLEDUM 0
+#define PAIRING_FRIENDLY_TWEEDLEDUM NOT_PF
+#define CURVE_SECURITY_TWEEDLEDUM 128
+#define HTC_ISO_TWEEDLEDUM 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_TWEEDLEDUM
+
+#if PAIRING_FRIENDLY_TWEEDLEDUM != NOT_PF
+
+#define HTC_ISO_G2_TWEEDLEDUM 0
+
+#define USE_GLV_TWEEDLEDUM   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_TWEEDLEDUM /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_TWEEDLEDUM /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_TWEEDLEDUM 
+#define SIGN_OF_X_TWEEDLEDUM 
+
+#define ATE_BITS_TWEEDLEDUM 
+#define G2_TABLE_TWEEDLEDUM 
+
+#endif
+
+
+#if CURVE_SECURITY_TWEEDLEDUM == 128
+#define AESKEY_TWEEDLEDUM 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_TWEEDLEDUM SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_TWEEDLEDUM == 192
+#define AESKEY_TWEEDLEDUM 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_TWEEDLEDUM SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_TWEEDLEDUM == 256
+#define AESKEY_TWEEDLEDUM 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_TWEEDLEDUM SHA512  /**< Hash type */
+#endif
+
+
+namespace TWEEDLEDUM_BIG = B256_56;
+namespace TWEEDLEDUM_FP = TWEEDLEDUM;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_X448.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_X448.h
new file mode 100644
index 0000000..aa8e596
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_curve_X448.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_X448_H
+#define CONFIG_CURVE_X448_H
+
+#include"core.h"
+#include"config_field_F448.h"
+
+// ECP stuff
+
+#define CURVETYPE_X448 MONTGOMERY
+#define CURVE_A_X448 156326
+#define PAIRING_FRIENDLY_X448 NOT_PF
+#define CURVE_SECURITY_X448 256
+#define HTC_ISO_X448 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_X448
+
+#if PAIRING_FRIENDLY_X448 != NOT_PF
+
+#define HTC_ISO_G2_X448 0
+
+#define USE_GLV_X448   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_X448 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_X448 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_X448 
+#define SIGN_OF_X_X448 
+
+#define ATE_BITS_X448 
+#define G2_TABLE_X448 
+
+#endif
+
+
+#if CURVE_SECURITY_X448 == 128
+#define AESKEY_X448 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_X448 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_X448 == 192
+#define AESKEY_X448 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_X448 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_X448 == 256
+#define AESKEY_X448 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_X448 SHA512  /**< Hash type */
+#endif
+
+
+namespace X448_BIG = B448_58;
+namespace X448_FP = F448;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_ff.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_ff.h
new file mode 100644
index 0000000..cc6744a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_ff.h
@@ -0,0 +1,32 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_RSA_WWW_H
+#define CONFIG_RSA_WWW_H
+
+#include "core.h"
+#include "config_big_XXX.h"
+
+// FF stuff
+
+#define FFLEN_WWW @ML@ /**< 2^n multiplier of BIGBITS to specify supported Finite Field size, e.g 2048=256*2^3 where BIGBITS=256 */
+
+namespace WWW_BIG = XXX;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_ff_RSA2048.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_ff_RSA2048.h
new file mode 100644
index 0000000..9295409
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_ff_RSA2048.h
@@ -0,0 +1,32 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_RSA_RSA2048_H
+#define CONFIG_RSA_RSA2048_H
+
+#include "core.h"
+#include "config_big_B512_60.h"
+
+// FF stuff
+
+#define FFLEN_RSA2048 4 /**< 2^n multiplier of BIGBITS to specify supported Finite Field size, e.g 2048=256*2^3 where BIGBITS=256 */
+
+namespace RSA2048_BIG = B512_60;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_ff_RSA3072.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_ff_RSA3072.h
new file mode 100644
index 0000000..aa73885
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_ff_RSA3072.h
@@ -0,0 +1,32 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_RSA_RSA3072_H
+#define CONFIG_RSA_RSA3072_H
+
+#include "core.h"
+#include "config_big_B384_56.h"
+
+// FF stuff
+
+#define FFLEN_RSA3072 8 /**< 2^n multiplier of BIGBITS to specify supported Finite Field size, e.g 2048=256*2^3 where BIGBITS=256 */
+
+namespace RSA3072_BIG = B384_56;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_ff_RSA4096.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_ff_RSA4096.h
new file mode 100644
index 0000000..8b0323c
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_ff_RSA4096.h
@@ -0,0 +1,32 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_RSA_RSA4096_H
+#define CONFIG_RSA_RSA4096_H
+
+#include "core.h"
+#include "config_big_B512_60.h"
+
+// FF stuff
+
+#define FFLEN_RSA4096 8 /**< 2^n multiplier of BIGBITS to specify supported Finite Field size, e.g 2048=256*2^3 where BIGBITS=256 */
+
+namespace RSA4096_BIG = B512_60;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field.h
new file mode 100644
index 0000000..88f4d7b
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_YYY_H
+#define CONFIG_FIELD_YYY_H
+
+#include"core.h"
+#include "config_big_XXX.h"
+
+// FP stuff
+
+#define MBITS_YYY @NBT@
+#define PM1D2_YYY @M8@
+#define MODTYPE_YYY @MT@
+#define MAXXES_YYY @SH@
+#define QNRI_YYY @QI@
+#define RIADZ_YYY @RZ@
+#define RIADZG2A_YYY @RZ2A@
+#define RIADZG2B_YYY @RZ2B@
+#define TOWER_YYY @TW@
+
+//#define BIG_ENDIAN_SIGN_YYY 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_ANSSI.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_ANSSI.h
new file mode 100644
index 0000000..e810e76
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_ANSSI.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_ANSSI_H
+#define CONFIG_FIELD_ANSSI_H
+
+#include"core.h"
+#include "config_big_B256_56.h"
+
+// FP stuff
+
+#define MBITS_ANSSI 256
+#define PM1D2_ANSSI 1
+#define MODTYPE_ANSSI NOT_SPECIAL
+#define MAXXES_ANSSI 24
+#define QNRI_ANSSI 0
+#define RIADZ_ANSSI -5
+#define RIADZG2A_ANSSI 0
+#define RIADZG2B_ANSSI 0
+#define TOWER_ANSSI NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_ANSSI 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_BLS12381.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_BLS12381.h
new file mode 100644
index 0000000..53923e3
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_BLS12381.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_BLS12381_H
+#define CONFIG_FIELD_BLS12381_H
+
+#include"core.h"
+#include "config_big_B384_58.h"
+
+// FP stuff
+
+#define MBITS_BLS12381 381
+#define PM1D2_BLS12381 1
+#define MODTYPE_BLS12381 NOT_SPECIAL
+#define MAXXES_BLS12381 25
+#define QNRI_BLS12381 0
+#define RIADZ_BLS12381 11
+#define RIADZG2A_BLS12381 -2
+#define RIADZG2B_BLS12381 -1
+#define TOWER_BLS12381 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_BLS12381 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_BLS12383.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_BLS12383.h
new file mode 100644
index 0000000..48fef18
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_BLS12383.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_BLS12383_H
+#define CONFIG_FIELD_BLS12383_H
+
+#include"core.h"
+#include "config_big_B384_58.h"
+
+// FP stuff
+
+#define MBITS_BLS12383 383
+#define PM1D2_BLS12383 1
+#define MODTYPE_BLS12383 NOT_SPECIAL
+#define MAXXES_BLS12383 23
+#define QNRI_BLS12383 0
+#define RIADZ_BLS12383 1
+#define RIADZG2A_BLS12383 1
+#define RIADZG2B_BLS12383 0
+#define TOWER_BLS12383 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_BLS12383 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_BLS12443.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_BLS12443.h
new file mode 100644
index 0000000..9201da4
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_BLS12443.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_BLS12443_H
+#define CONFIG_FIELD_BLS12443_H
+
+#include"core.h"
+#include "config_big_B448_60.h"
+
+// FP stuff
+
+#define MBITS_BLS12443 443
+#define PM1D2_BLS12443 1
+#define MODTYPE_BLS12443 NOT_SPECIAL
+#define MAXXES_BLS12443 30
+#define QNRI_BLS12443 0
+#define RIADZ_BLS12443 -7
+#define RIADZG2A_BLS12443 1
+#define RIADZG2B_BLS12443 1
+#define TOWER_BLS12443 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_BLS12443 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_BLS12461.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_BLS12461.h
new file mode 100644
index 0000000..08e8713
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_BLS12461.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_BLS12461_H
+#define CONFIG_FIELD_BLS12461_H
+
+#include"core.h"
+#include "config_big_B464_60.h"
+
+// FP stuff
+
+#define MBITS_BLS12461 461
+#define PM1D2_BLS12461 1
+#define MODTYPE_BLS12461 NOT_SPECIAL
+#define MAXXES_BLS12461 19
+#define QNRI_BLS12461 0
+#define RIADZ_BLS12461 1
+#define RIADZG2A_BLS12461 4
+#define RIADZG2B_BLS12461 0
+#define TOWER_BLS12461 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_BLS12461 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_BLS24479.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_BLS24479.h
new file mode 100644
index 0000000..2feefdc
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_BLS24479.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_BLS24479_H
+#define CONFIG_FIELD_BLS24479_H
+
+#include"core.h"
+#include "config_big_B480_56.h"
+
+// FP stuff
+
+#define MBITS_BLS24479 479
+#define PM1D2_BLS24479 1
+#define MODTYPE_BLS24479 NOT_SPECIAL
+#define MAXXES_BLS24479 25
+#define QNRI_BLS24479 0
+#define RIADZ_BLS24479 1
+#define RIADZG2A_BLS24479 4
+#define RIADZG2B_BLS24479 0
+#define TOWER_BLS24479 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_BLS24479 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_BLS48286.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_BLS48286.h
new file mode 100644
index 0000000..c7c8b56
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_BLS48286.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_BLS48286_H
+#define CONFIG_FIELD_BLS48286_H
+
+#include"core.h"
+#include "config_big_B288_60.h"
+
+// FP stuff
+
+#define MBITS_BLS48286 286
+#define PM1D2_BLS48286 1
+#define MODTYPE_BLS48286 NOT_SPECIAL
+#define MAXXES_BLS48286 14
+#define QNRI_BLS48286 0
+#define RIADZ_BLS48286 1
+#define RIADZG2A_BLS48286 1
+#define RIADZG2B_BLS48286 0
+#define TOWER_BLS48286 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_BLS48286 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_BLS48556.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_BLS48556.h
new file mode 100644
index 0000000..5837180
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_BLS48556.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_BLS48556_H
+#define CONFIG_FIELD_BLS48556_H
+
+#include"core.h"
+#include "config_big_B560_58.h"
+
+// FP stuff
+
+#define MBITS_BLS48556 556
+#define PM1D2_BLS48556 1
+#define MODTYPE_BLS48556 NOT_SPECIAL
+#define MAXXES_BLS48556 24
+#define QNRI_BLS48556 0
+#define RIADZ_BLS48556 -1
+#define RIADZG2A_BLS48556 2
+#define RIADZG2B_BLS48556 0
+#define TOWER_BLS48556 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_BLS48556 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_BLS48581.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_BLS48581.h
new file mode 100644
index 0000000..9250ec0
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_BLS48581.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_BLS48581_H
+#define CONFIG_FIELD_BLS48581_H
+
+#include"core.h"
+#include "config_big_B584_60.h"
+
+// FP stuff
+
+#define MBITS_BLS48581 581
+#define PM1D2_BLS48581 1
+#define MODTYPE_BLS48581 NOT_SPECIAL
+#define MAXXES_BLS48581 19
+#define QNRI_BLS48581 0
+#define RIADZ_BLS48581 2
+#define RIADZG2A_BLS48581 2
+#define RIADZG2B_BLS48581 0
+#define TOWER_BLS48581 POSITOWER
+
+//#define BIG_ENDIAN_SIGN_BLS48581 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_BN158.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_BN158.h
new file mode 100644
index 0000000..8ca6c82
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_BN158.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_BN158_H
+#define CONFIG_FIELD_BN158_H
+
+#include"core.h"
+#include "config_big_B160_56.h"
+
+// FP stuff
+
+#define MBITS_BN158 158
+#define PM1D2_BN158 1
+#define MODTYPE_BN158 NOT_SPECIAL
+#define MAXXES_BN158 10
+#define QNRI_BN158 0
+#define RIADZ_BN158 1
+#define RIADZG2A_BN158 1
+#define RIADZG2B_BN158 0
+#define TOWER_BN158 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_BN158 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_BN254.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_BN254.h
new file mode 100644
index 0000000..6f1849c
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_BN254.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_BN254_H
+#define CONFIG_FIELD_BN254_H
+
+#include"core.h"
+#include "config_big_B256_56.h"
+
+// FP stuff
+
+#define MBITS_BN254 254
+#define PM1D2_BN254 1
+#define MODTYPE_BN254 NOT_SPECIAL
+#define MAXXES_BN254 26
+#define QNRI_BN254 0
+#define RIADZ_BN254 -1
+#define RIADZG2A_BN254 -1
+#define RIADZG2B_BN254 0
+#define TOWER_BN254 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_BN254 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_BN254CX.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_BN254CX.h
new file mode 100644
index 0000000..5a65df1
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_BN254CX.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_BN254CX_H
+#define CONFIG_FIELD_BN254CX_H
+
+#include"core.h"
+#include "config_big_B256_56.h"
+
+// FP stuff
+
+#define MBITS_BN254CX 254
+#define PM1D2_BN254CX 1
+#define MODTYPE_BN254CX NOT_SPECIAL
+#define MAXXES_BN254CX 26
+#define QNRI_BN254CX 0
+#define RIADZ_BN254CX -1
+#define RIADZG2A_BN254CX -1
+#define RIADZG2B_BN254CX 0
+#define TOWER_BN254CX NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_BN254CX 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_BN462.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_BN462.h
new file mode 100644
index 0000000..8210e2f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_BN462.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_BN462_H
+#define CONFIG_FIELD_BN462_H
+
+#include"core.h"
+#include "config_big_B464_60.h"
+
+// FP stuff
+
+#define MBITS_BN462 462
+#define PM1D2_BN462 1
+#define MODTYPE_BN462 NOT_SPECIAL
+#define MAXXES_BN462 18
+#define QNRI_BN462 1
+#define RIADZ_BN462 1
+#define RIADZG2A_BN462 1
+#define RIADZG2B_BN462 0
+#define TOWER_BN462 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_BN462 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_BRAINPOOL.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_BRAINPOOL.h
new file mode 100644
index 0000000..3747fb2
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_BRAINPOOL.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_BRAINPOOL_H
+#define CONFIG_FIELD_BRAINPOOL_H
+
+#include"core.h"
+#include "config_big_B256_56.h"
+
+// FP stuff
+
+#define MBITS_BRAINPOOL 256
+#define PM1D2_BRAINPOOL 1
+#define MODTYPE_BRAINPOOL NOT_SPECIAL
+#define MAXXES_BRAINPOOL 24
+#define QNRI_BRAINPOOL 0
+#define RIADZ_BRAINPOOL -3
+#define RIADZG2A_BRAINPOOL 0
+#define RIADZG2B_BRAINPOOL 0
+#define TOWER_BRAINPOOL NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_BRAINPOOL 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_C1174.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_C1174.h
new file mode 100644
index 0000000..c7386c8
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_C1174.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_C1174_H
+#define CONFIG_FIELD_C1174_H
+
+#include"core.h"
+#include "config_big_B256_56.h"
+
+// FP stuff
+
+#define MBITS_C1174 251
+#define PM1D2_C1174 1
+#define MODTYPE_C1174 PSEUDO_MERSENNE
+#define MAXXES_C1174 29
+#define QNRI_C1174 0
+#define RIADZ_C1174 0
+#define RIADZG2A_C1174 0
+#define RIADZG2B_C1174 0
+#define TOWER_C1174 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_C1174 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_C1665.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_C1665.h
new file mode 100644
index 0000000..3759646
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_C1665.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_C1665_H
+#define CONFIG_FIELD_C1665_H
+
+#include"core.h"
+#include "config_big_B168_60.h"
+
+// FP stuff
+
+#define MBITS_C1665 166
+#define PM1D2_C1665 1
+#define MODTYPE_C1665 PSEUDO_MERSENNE
+#define MAXXES_C1665 14
+#define QNRI_C1665 0
+#define RIADZ_C1665 0
+#define RIADZG2A_C1665 0
+#define RIADZG2B_C1665 0
+#define TOWER_C1665 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_C1665 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_C41417.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_C41417.h
new file mode 100644
index 0000000..4424809
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_C41417.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_C41417_H
+#define CONFIG_FIELD_C41417_H
+
+#include"core.h"
+#include "config_big_B416_60.h"
+
+// FP stuff
+
+#define MBITS_C41417 414
+#define PM1D2_C41417 1
+#define MODTYPE_C41417 PSEUDO_MERSENNE
+#define MAXXES_C41417 6
+#define QNRI_C41417 0
+#define RIADZ_C41417 1
+#define RIADZG2A_C41417 0
+#define RIADZG2B_C41417 0
+#define TOWER_C41417 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_C41417 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_F25519.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_F25519.h
new file mode 100644
index 0000000..0546ad7
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_F25519.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_F25519_H
+#define CONFIG_FIELD_F25519_H
+
+#include"core.h"
+#include "config_big_B256_56.h"
+
+// FP stuff
+
+#define MBITS_F25519 255
+#define PM1D2_F25519 2
+#define MODTYPE_F25519 PSEUDO_MERSENNE
+#define MAXXES_F25519 25
+#define QNRI_F25519 0
+#define RIADZ_F25519 2
+#define RIADZG2A_F25519 0
+#define RIADZG2B_F25519 0
+#define TOWER_F25519 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_F25519 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_F256PME.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_F256PME.h
new file mode 100644
index 0000000..721f005
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_F256PME.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_F256PME_H
+#define CONFIG_FIELD_F256PME_H
+
+#include"core.h"
+#include "config_big_B256_56.h"
+
+// FP stuff
+
+#define MBITS_F256PME 256
+#define PM1D2_F256PME 1
+#define MODTYPE_F256PME PSEUDO_MERSENNE
+#define MAXXES_F256PME 24
+#define QNRI_F256PME 0
+#define RIADZ_F256PME 0
+#define RIADZG2A_F256PME 0
+#define RIADZG2B_F256PME 0
+#define TOWER_F256PME NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_F256PME 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_F256PMW.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_F256PMW.h
new file mode 100644
index 0000000..16e7daa
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_F256PMW.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_F256PMW_H
+#define CONFIG_FIELD_F256PMW_H
+
+#include"core.h"
+#include "config_big_B256_56.h"
+
+// FP stuff
+
+#define MBITS_F256PMW 256
+#define PM1D2_F256PMW 1
+#define MODTYPE_F256PMW PSEUDO_MERSENNE
+#define MAXXES_F256PMW 24
+#define QNRI_F256PMW 0
+#define RIADZ_F256PMW 7
+#define RIADZG2A_F256PMW 0
+#define RIADZG2B_F256PMW 0
+#define TOWER_F256PMW NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_F256PMW 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_F384PM.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_F384PM.h
new file mode 100644
index 0000000..014d251
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_F384PM.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_F384PM_H
+#define CONFIG_FIELD_F384PM_H
+
+#include"core.h"
+#include "config_big_B384_58.h"
+
+// FP stuff
+
+#define MBITS_F384PM 384
+#define PM1D2_F384PM 1
+#define MODTYPE_F384PM PSEUDO_MERSENNE
+#define MAXXES_F384PM 22
+#define QNRI_F384PM 0
+#define RIADZ_F384PM 0
+#define RIADZG2A_F384PM 0
+#define RIADZG2B_F384PM 0
+#define TOWER_F384PM NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_F384PM 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_F448.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_F448.h
new file mode 100644
index 0000000..bd806f0
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_F448.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_F448_H
+#define CONFIG_FIELD_F448_H
+
+#include"core.h"
+#include "config_big_B448_58.h"
+
+// FP stuff
+
+#define MBITS_F448 448
+#define PM1D2_F448 1
+#define MODTYPE_F448 GENERALISED_MERSENNE
+#define MAXXES_F448 16
+#define QNRI_F448 0
+#define RIADZ_F448 0
+#define RIADZG2A_F448 0
+#define RIADZG2B_F448 0
+#define TOWER_F448 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_F448 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_F512PM.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_F512PM.h
new file mode 100644
index 0000000..b39db70
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_F512PM.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_F512PM_H
+#define CONFIG_FIELD_F512PM_H
+
+#include"core.h"
+#include "config_big_B512_60.h"
+
+// FP stuff
+
+#define MBITS_F512PM 512
+#define PM1D2_F512PM 1
+#define MODTYPE_F512PM PSEUDO_MERSENNE
+#define MAXXES_F512PM 28
+#define QNRI_F512PM 0
+#define RIADZ_F512PM 0
+#define RIADZG2A_F512PM 0
+#define RIADZG2B_F512PM 0
+#define TOWER_F512PM NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_F512PM 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_FP256BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_FP256BN.h
new file mode 100644
index 0000000..45a6bb5
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_FP256BN.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_FP256BN_H
+#define CONFIG_FIELD_FP256BN_H
+
+#include"core.h"
+#include "config_big_B256_56.h"
+
+// FP stuff
+
+#define MBITS_FP256BN 256
+#define PM1D2_FP256BN 1
+#define MODTYPE_FP256BN NOT_SPECIAL
+#define MAXXES_FP256BN 24
+#define QNRI_FP256BN 0
+#define RIADZ_FP256BN 1
+#define RIADZG2A_FP256BN 1
+#define RIADZG2B_FP256BN 0
+#define TOWER_FP256BN NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_FP256BN 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_FP512BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_FP512BN.h
new file mode 100644
index 0000000..33b9c78
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_FP512BN.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_FP512BN_H
+#define CONFIG_FIELD_FP512BN_H
+
+#include"core.h"
+#include "config_big_B512_60.h"
+
+// FP stuff
+
+#define MBITS_FP512BN 512
+#define PM1D2_FP512BN 1
+#define MODTYPE_FP512BN NOT_SPECIAL
+#define MAXXES_FP512BN 28
+#define QNRI_FP512BN 0
+#define RIADZ_FP512BN 1
+#define RIADZG2A_FP512BN 1
+#define RIADZG2B_FP512BN 0
+#define TOWER_FP512BN NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_FP512BN 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_HIFIVE.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_HIFIVE.h
new file mode 100644
index 0000000..b5ed2e7
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_HIFIVE.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_HIFIVE_H
+#define CONFIG_FIELD_HIFIVE_H
+
+#include"core.h"
+#include "config_big_B336_60.h"
+
+// FP stuff
+
+#define MBITS_HIFIVE 336
+#define PM1D2_HIFIVE 2
+#define MODTYPE_HIFIVE PSEUDO_MERSENNE
+#define MAXXES_HIFIVE 24
+#define QNRI_HIFIVE 0
+#define RIADZ_HIFIVE 1
+#define RIADZG2A_HIFIVE 0
+#define RIADZG2B_HIFIVE 0
+#define TOWER_HIFIVE NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_HIFIVE 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_JUBJUB.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_JUBJUB.h
new file mode 100644
index 0000000..e6a1450
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_JUBJUB.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_JUBJUB_H
+#define CONFIG_FIELD_JUBJUB_H
+
+#include"core.h"
+#include "config_big_B256_56.h"
+
+// FP stuff
+
+#define MBITS_JUBJUB 255
+#define PM1D2_JUBJUB 32
+#define MODTYPE_JUBJUB NOT_SPECIAL
+#define MAXXES_JUBJUB 25
+#define QNRI_JUBJUB 5
+#define RIADZ_JUBJUB 1
+#define RIADZG2A_JUBJUB 0
+#define RIADZG2B_JUBJUB 0
+#define TOWER_JUBJUB NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_JUBJUB 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_MDC.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_MDC.h
new file mode 100644
index 0000000..995ae7f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_MDC.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_MDC_H
+#define CONFIG_FIELD_MDC_H
+
+#include"core.h"
+#include "config_big_B256_56.h"
+
+// FP stuff
+
+#define MBITS_MDC 256
+#define PM1D2_MDC 1
+#define MODTYPE_MDC NOT_SPECIAL
+#define MAXXES_MDC 24
+#define QNRI_MDC 0
+#define RIADZ_MDC 0
+#define RIADZG2A_MDC 0
+#define RIADZG2B_MDC 0
+#define TOWER_MDC NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_MDC 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_NIST256.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_NIST256.h
new file mode 100644
index 0000000..0923d5d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_NIST256.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_NIST256_H
+#define CONFIG_FIELD_NIST256_H
+
+#include"core.h"
+#include "config_big_B256_56.h"
+
+// FP stuff
+
+#define MBITS_NIST256 256
+#define PM1D2_NIST256 1
+#define MODTYPE_NIST256 NOT_SPECIAL
+#define MAXXES_NIST256 24
+#define QNRI_NIST256 0
+#define RIADZ_NIST256 -10
+#define RIADZG2A_NIST256 0
+#define RIADZG2B_NIST256 0
+#define TOWER_NIST256 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_NIST256 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_NIST384.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_NIST384.h
new file mode 100644
index 0000000..d3c7219
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_NIST384.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_NIST384_H
+#define CONFIG_FIELD_NIST384_H
+
+#include"core.h"
+#include "config_big_B384_56.h"
+
+// FP stuff
+
+#define MBITS_NIST384 384
+#define PM1D2_NIST384 1
+#define MODTYPE_NIST384 NOT_SPECIAL
+#define MAXXES_NIST384 8
+#define QNRI_NIST384 0
+#define RIADZ_NIST384 -12
+#define RIADZG2A_NIST384 0
+#define RIADZG2B_NIST384 0
+#define TOWER_NIST384 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_NIST384 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_NIST521.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_NIST521.h
new file mode 100644
index 0000000..b89d9ac
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_NIST521.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_NIST521_H
+#define CONFIG_FIELD_NIST521_H
+
+#include"core.h"
+#include "config_big_B528_60.h"
+
+// FP stuff
+
+#define MBITS_NIST521 521
+#define PM1D2_NIST521 1
+#define MODTYPE_NIST521 PSEUDO_MERSENNE
+#define MAXXES_NIST521 19
+#define QNRI_NIST521 0
+#define RIADZ_NIST521 -4
+#define RIADZG2A_NIST521 0
+#define RIADZG2B_NIST521 0
+#define TOWER_NIST521 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_NIST521 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_SECP160R1.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_SECP160R1.h
new file mode 100644
index 0000000..e32db36
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_SECP160R1.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_SECP160R1_H
+#define CONFIG_FIELD_SECP160R1_H
+
+#include"core.h"
+#include "config_big_B160_56.h"
+
+// FP stuff
+
+#define MBITS_SECP160R1 160
+#define PM1D2_SECP160R1 1
+#define MODTYPE_SECP160R1 NOT_SPECIAL
+#define MAXXES_SECP160R1 8
+#define QNRI_SECP160R1 0
+#define RIADZ_SECP160R1 3
+#define RIADZG2A_SECP160R1 0
+#define RIADZG2B_SECP160R1 0
+#define TOWER_SECP160R1 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_SECP160R1 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_SECP256K1.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_SECP256K1.h
new file mode 100644
index 0000000..5efff7a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_SECP256K1.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_SECP256K1_H
+#define CONFIG_FIELD_SECP256K1_H
+
+#include"core.h"
+#include "config_big_B256_56.h"
+
+// FP stuff
+
+#define MBITS_SECP256K1 256
+#define PM1D2_SECP256K1 1
+#define MODTYPE_SECP256K1 NOT_SPECIAL
+#define MAXXES_SECP256K1 24
+#define QNRI_SECP256K1 0
+#define RIADZ_SECP256K1 -11
+#define RIADZG2A_SECP256K1 0
+#define RIADZG2B_SECP256K1 0
+#define TOWER_SECP256K1 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_SECP256K1 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_SM2.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_SM2.h
new file mode 100644
index 0000000..951875f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_SM2.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_SM2_H
+#define CONFIG_FIELD_SM2_H
+
+#include"core.h"
+#include "config_big_B256_56.h"
+
+// FP stuff
+
+#define MBITS_SM2 256
+#define PM1D2_SM2 1
+#define MODTYPE_SM2 NOT_SPECIAL
+#define MAXXES_SM2 24
+#define QNRI_SM2 0
+#define RIADZ_SM2 -9
+#define RIADZG2A_SM2 0
+#define RIADZG2B_SM2 0
+#define TOWER_SM2 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_SM2 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_TWEEDLEDEE.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_TWEEDLEDEE.h
new file mode 100644
index 0000000..a29cb68
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_TWEEDLEDEE.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_TWEEDLEDEE_H
+#define CONFIG_FIELD_TWEEDLEDEE_H
+
+#include"core.h"
+#include "config_big_B256_56.h"
+
+// FP stuff
+
+#define MBITS_TWEEDLEDEE 255
+#define PM1D2_TWEEDLEDEE 34
+#define MODTYPE_TWEEDLEDEE NOT_SPECIAL
+#define MAXXES_TWEEDLEDEE 25
+#define QNRI_TWEEDLEDEE 5
+#define RIADZ_TWEEDLEDEE 1
+#define RIADZG2A_TWEEDLEDEE 0
+#define RIADZG2B_TWEEDLEDEE 0
+#define TOWER_TWEEDLEDEE NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_TWEEDLEDEE 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_TWEEDLEDUM.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_TWEEDLEDUM.h
new file mode 100644
index 0000000..68a6689
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/config_field_TWEEDLEDUM.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_TWEEDLEDUM_H
+#define CONFIG_FIELD_TWEEDLEDUM_H
+
+#include"core.h"
+#include "config_big_B256_56.h"
+
+// FP stuff
+
+#define MBITS_TWEEDLEDUM 255
+#define PM1D2_TWEEDLEDUM 33
+#define MODTYPE_TWEEDLEDUM NOT_SPECIAL
+#define MAXXES_TWEEDLEDUM 25
+#define QNRI_TWEEDLEDUM 5
+#define RIADZ_TWEEDLEDUM 1
+#define RIADZG2A_TWEEDLEDUM 0
+#define RIADZG2B_TWEEDLEDUM 0
+#define TOWER_TWEEDLEDUM NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_TWEEDLEDUM 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/core.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/core.h
new file mode 100644
index 0000000..a829258
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/core.h
@@ -0,0 +1,860 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CORE_H
+#define CORE_H
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <stdbool.h>
+#include <stdint.h>
+#include "arch.h"
+
+namespace core {
+
+//#define CORE_ARDUINO
+
+/* modulus types */
+
+#define NOT_SPECIAL 0	       /**< Modulus of no exploitable form */
+#define PSEUDO_MERSENNE 1      /**< Pseudo-mersenne modulus of form $2^n-c$  */
+#define MONTGOMERY_FRIENDLY 3  /**< Montgomery Friendly modulus of form $2^a(2^b-c)-1$  */
+#define GENERALISED_MERSENNE 2 /**< Generalised-mersenne modulus of form $2^n-2^m-1$, Ed448 only */
+
+/* Curve types */
+
+#define WEIERSTRASS 0 /**< Short Weierstrass form curve  */
+#define EDWARDS 1     /**< Edwards or Twisted Edwards curve  */
+#define MONTGOMERY 2  /**< Montgomery form curve  */
+
+/* Pairing-Friendly types */
+
+#define NOT_PF 0
+#define BN_CURVE 1
+#define BLS12_CURVE 2
+#define BLS24_CURVE 3
+#define BLS48_CURVE 4
+
+#define D_TYPE 0
+#define M_TYPE 1
+
+#define FP_ZILCH 0			// 0
+#define FP_UNITY 1			// 1
+#define FP_SPARSEST 2		// [[AB][c0][00]]
+#define FP_SPARSER 3		// [[AB][C0][00]]
+#define FP_SPARSE 4			// [[AB][CD][E0]]
+#define FP_DENSE 5			// [[AB][CD][EF]]
+
+#define NEGATOWER 0			// Extension field tower type
+#define POSITOWER 1
+
+/**
+ * @brief SHA256 hash function instance */
+typedef struct
+{
+    unsign32 length[2]; /**< 64-bit input length */
+    unsign32 h[8];      /**< Internal state */
+    unsign32 w[64];	/**< Internal state */
+    int hlen;		/**< Hash length in bytes */
+} hash256;
+
+/**
+ * @brief SHA384-512 hash function instance */
+typedef struct
+{
+    unsign64 length[2]; /**< 64-bit input length */
+    unsign64 h[8];      /**< Internal state */
+    unsign64 w[80];	/**< Internal state */
+    int hlen;           /**< Hash length in bytes */
+} hash512;
+
+/**
+ * @brief SHA384 hash function instance */
+typedef hash512 hash384;
+
+/**
+ * @brief SHA3 hash function instance */
+typedef struct {
+    int length;
+    unsign64 S[25];
+    int rate, len;
+} sha3;
+
+#define MC_SHA2 2
+#define MC_SHA3 3
+
+#define SHA256 32 /**< SHA-256 hashing */
+#define SHA384 48 /**< SHA-384 hashing */
+#define SHA512 64 /**< SHA-512 hashing */
+
+#define SHA3_HASH224 28 /**< SHA3 224 bit hash */
+#define SHA3_HASH256 32 /**< SHA3 256 bit hash */
+#define SHA3_HASH384 48 /**< SHA3 384 bit hash */
+#define SHA3_HASH512 64 /**< SHA3 512 bit hash */
+
+#define SHAKE128 16 /**< SHAKE128   hash */
+#define SHAKE256 32 /**< SHAKE256   hash */
+
+/* Symmetric Encryption AES structure */
+
+#define ECB   0  /**< Electronic Code Book */
+#define CBC   1  /**< Cipher Block Chaining */
+#define CFB1  2  /**< Cipher Feedback - 1 byte */
+#define CFB2  3  /**< Cipher Feedback - 2 bytes */
+#define CFB4  5  /**< Cipher Feedback - 4 bytes */
+#define OFB1  14 /**< Output Feedback - 1 byte */
+#define OFB2  15 /**< Output Feedback - 2 bytes */
+#define OFB4  17 /**< Output Feedback - 4 bytes */
+#define OFB8  21 /**< Output Feedback - 8 bytes */
+#define OFB16 29 /**< Output Feedback - 16 bytes */
+#define CTR1  30 /**< Counter Mode - 1 byte */
+#define CTR2  31 /**< Counter Mode - 2 bytes */
+#define CTR4  33 /**< Counter Mode - 4 bytes */
+#define CTR8  37 /**< Counter Mode - 8 bytes */
+#define CTR16 45 /**< Counter Mode - 16 bytes */
+
+#define uchar unsigned char  /**<  Unsigned char */
+
+/**
+	@brief AES instance
+*/
+
+
+typedef struct
+{
+    int Nk;            /**< AES Key Length */
+    int Nr;            /**< AES Number of rounds */
+    int mode;          /**< AES mode of operation */
+    unsign32 fkey[60]; /**< subkeys for encrypton */
+    unsign32 rkey[60]; /**< subkeys for decrypton */
+    char f[16];        /**< buffer for chaining vector */
+} aes;
+
+/* AES-GCM suppport.  */
+
+#define GCM_ACCEPTING_HEADER 0   /**< GCM status */
+#define GCM_ACCEPTING_CIPHER 1   /**< GCM status */
+#define GCM_NOT_ACCEPTING_MORE 2 /**< GCM status */
+#define GCM_FINISHED 3           /**< GCM status */
+#define GCM_ENCRYPTING 0         /**< GCM mode */
+#define GCM_DECRYPTING 1         /**< GCM mode */
+
+
+/**
+	@brief GCM mode instance, using AES internally
+*/
+
+typedef struct
+{
+    unsign32 table[128][4]; /**< 2k byte table */
+    uchar stateX[16];	    /**< GCM Internal State */
+    uchar Y_0[16];	    /**< GCM Internal State */
+    unsign32 lenA[2];	    /**< GCM 64-bit length of header */
+    unsign32 lenC[2];	    /**< GCM 64-bit length of ciphertext */
+    int status;		    /**< GCM Status */
+    aes a;		    /**< Internal Instance of aes cipher */
+} gcm;
+
+/* Marsaglia & Zaman Random number generator constants */
+
+#define NK   21 /**< PRNG constant */
+#define NJ   6  /**< PRNG constant */
+#define NV   8  /**< PRNG constant */
+
+
+/**
+	@brief Cryptographically secure pseudo-random number generator instance
+*/
+
+typedef struct
+{
+    unsign32 ira[NK]; /**< random number array   */
+    int      rndptr;  /**< pointer into array */
+    unsign32 borrow;  /**<  borrow as a result of subtraction */
+    int pool_ptr;     /**< pointer into random pool */
+    char pool[32];    /**< random pool */
+} csprng;
+
+
+/**
+	@brief Portable representation of a big positive number
+*/
+
+typedef struct
+{
+    int len;   /**< length in bytes  */
+    int max;   /**< max length allowed - enforce truncation  */
+    char *val; /**< byte array  */
+} octet;
+
+/**
+ * @brief Share instance */
+typedef struct
+{
+    int id;  /**< Unique Share ID */
+    int nsr; /**< number of shares required */
+    octet *B; /**< share as octet */
+} share;
+
+/* Octet string handlers */
+/**	@brief Formats and outputs an octet to the console in hex
+ *
+	@param O Octet to be output
+ */
+extern void OCT_output(octet *O);
+/**	@brief Formats and outputs an octet to the console as a character string
+ *
+	@param O Octet to be output
+ */
+extern void OCT_output_string(octet *O);
+/**	@brief Wipe clean an octet
+ *
+	@param O Octet to be cleaned
+ */
+extern void OCT_clear(octet *O);
+
+/**	@brief Reverse bytes in an octet
+ *
+	@param O Octet to be reversed
+ */
+extern void OCT_reverse(octet *O);
+
+/**	@brief Compare two octets
+ *
+	@param O first Octet to be compared
+	@param P second Octet to be compared
+	@return 1 if equal, else 0
+ */
+extern int  OCT_comp(octet *O, octet *P);
+
+
+/**	@brief Compare first n bytes of two octets
+ *
+	@param O first Octet to be compared
+	@param P second Octet to be compared
+	@param n number of bytes to compare
+	@return 1 if equal, else 0
+ */
+extern int  OCT_ncomp(octet *O, octet *P, int n);
+/**	@brief Join from a C string to end of an octet
+ *
+	Truncates if there is no room
+	@param O Octet to be written to
+	@param s zero terminated string to be joined to octet
+ */
+extern void OCT_jstring(octet *O, char *s);
+/**	@brief Join bytes to end of an octet
+ *
+	Truncates if there is no room
+	@param O Octet to be written to
+	@param s bytes to be joined to end of octet
+	@param n number of bytes to join
+ */
+extern void OCT_jbytes(octet *O, char *s, int n);
+/**	@brief Join single byte to end of an octet, repeated n times
+ *
+	Truncates if there is no room
+	@param O Octet to be written to
+	@param b byte to be joined to end of octet
+	@param n number of times b is to be joined
+ */
+extern void OCT_jbyte(octet *O, int b, int n);
+/**	@brief Join one octet to the end of another
+ *
+	Truncates if there is no room
+	@param O Octet to be written to
+	@param P Octet to be joined to the end of O
+ */
+extern void OCT_joctet(octet *O, octet *P);
+/**	@brief XOR common bytes of a pair of Octets
+ *
+	@param O Octet - on exit = O xor P
+	@param P Octet to be xored into O
+ */
+extern void OCT_xor(octet *O, octet *P);
+/**	@brief reset Octet to zero length
+ *
+	@param O Octet to be emptied
+ */
+extern void OCT_empty(octet *O);
+/**	@brief Pad out an Octet to the given length
+ *
+	Padding is done by inserting leading zeros, so abcd becomes 00abcd
+	@param O Octet to be padded
+	@param n new length of Octet
+ */
+extern int OCT_pad(octet *O, int n);
+/**	@brief Convert an Octet to printable base64 number
+ *
+	@param b zero terminated byte array to take base64 conversion
+	@param O Octet to be converted
+ */
+extern void OCT_tobase64(char *b, octet *O);
+/**	@brief Populate an Octet from base64 number
+ *
+ 	@param O Octet to be populated
+	@param b zero terminated base64 string
+
+ */
+extern void OCT_frombase64(octet *O, char *b);
+/**	@brief Copy one Octet into another
+ *
+ 	@param O Octet to be copied to
+	@param P Octet to be copied from
+
+ */
+extern void OCT_copy(octet *O, octet *P);
+/**	@brief XOR every byte of an octet with input m
+ *
+ 	@param O Octet
+	@param m byte to be XORed with every byte of O
+
+ */
+extern void OCT_xorbyte(octet *O, int m);
+/**	@brief Chops Octet into two, leaving first n bytes in O, moving the rest to P
+ *
+ 	@param O Octet to be chopped
+	@param P new Octet to be created
+	@param n number of bytes to chop off O
+
+ */
+extern void OCT_chop(octet *O, octet *P, int n);
+/**	@brief Join n bytes of integer m to end of Octet O (big endian)
+ *
+	Typically n is 4 for a 32-bit integer
+ 	@param O Octet to be appended to
+	@param m integer to be appended to O
+	@param n number of bytes in m
+
+ */
+extern void OCT_jint(octet *O, unsigned int m, int n);
+/**	@brief Create an Octet from bytes taken from a random number generator
+ *
+	Truncates if there is no room
+ 	@param O Octet to be populated
+	@param R an instance of a Cryptographically Secure Random Number Generator
+	@param n number of bytes to extracted from R
+
+ */
+extern void OCT_rand(octet *O, csprng *R, int n);
+/**	@brief Shifts Octet left by n bytes
+ *
+	Leftmost bytes disappear
+ 	@param O Octet to be shifted
+	@param n number of bytes to shift
+
+ */
+extern void OCT_shl(octet *O, int n);
+/**	@brief Convert a hex number to an Octet
+ *
+	@param dst Octet
+	@param src Hex string to be converted
+ */
+extern void OCT_fromHex(octet *dst, char *src);
+/**	@brief Convert an Octet to printable hex number
+ *
+	@param dst hex value
+	@param src Octet to be converted
+ */
+extern void OCT_toHex(octet *src, char *dst);
+/**	@brief Convert an Octet to string
+ *
+	@param dst string value
+	@param src Octet to be converted
+ */
+extern void OCT_toStr(octet *src, char *dst);
+
+
+
+/* Hash function */
+/**	@brief Initialise an instance of SHA256
+ *
+	@param H an instance SHA256
+ */
+extern void HASH256_init(hash256 *H);
+/**	@brief Add a byte to the hash
+ *
+	@param H an instance SHA256
+	@param b byte to be included in hash
+ */
+extern void HASH256_process(hash256 *H, int b);
+/**	@brief Generate 32-byte final hash
+ *
+	@param H an instance SHA256
+	@param h is the output 32-byte hash
+ */
+extern void HASH256_hash(hash256 *H, char *h);
+
+/**	@brief Generate 32-byte intermediate hash
+ *
+	@param H an instance SHA256
+	@param h is the output 32-byte hash
+ */
+extern void HASH256_continuing_hash(hash256 *H, char *h);
+
+/**	@brief Initialise an instance of SHA384
+ *
+	@param H an instance SHA384
+ */
+extern void HASH384_init(hash384 *H);
+/**	@brief Add a byte to the hash
+ *
+	@param H an instance SHA384
+	@param b byte to be included in hash
+ */
+extern void HASH384_process(hash384 *H, int b);
+/**	@brief Generate 48-byte final hash
+ *
+	@param H an instance SHA384
+	@param h is the output 48-byte hash
+ */
+extern void HASH384_hash(hash384 *H, char *h);
+
+/**	@brief Generate 48-byte intermediate hash
+ *
+	@param H an instance SHA384
+	@param h is the output 48-byte hash
+ */
+extern void HASH384_continuing_hash(hash384 *H, char *h);
+
+/**	@brief Initialise an instance of SHA512
+ *
+	@param H an instance SHA512
+ */
+extern void HASH512_init(hash512 *H);
+/**	@brief Add a byte to the hash
+ *
+	@param H an instance SHA512
+	@param b byte to be included in hash
+ */
+extern void HASH512_process(hash512 *H, int b);
+/**	@brief Generate 64-byte final hash
+ *
+	@param H an instance SHA512
+	@param h is the output 64-byte hash
+ */
+extern void HASH512_hash(hash512 *H, char *h);
+
+/**	@brief Generate 64-byte intermediate hash
+ *
+	@param H an instance SHA512
+	@param h is the output 64-byte hash
+ */
+extern void HASH512_continuing_hash(hash512 *H, char *h);
+
+/**	@brief Initialise an instance of SHA3
+ *
+	@param H an instance SHA3
+	@param t the instance type
+ */
+extern void  SHA3_init(sha3 *H, int t);
+/**	@brief process a byte for SHA3
+ *
+	@param H an instance SHA3
+	@param b a byte of date to be processed
+ */
+extern void  SHA3_process(sha3 *H, int b);
+/**	@brief create fixed length final hash output of SHA3
+ *
+	@param H an instance SHA3
+	@param h a byte array to take hash
+ */
+extern void  SHA3_hash(sha3 *H, char *h);
+
+/**	@brief create fixed length intermediate hash output of SHA3
+ *
+	@param H an instance SHA3
+	@param h a byte array to take hash
+ */
+extern void  SHA3_continuing_hash(sha3 *H, char *h);
+
+/**	@brief create variable length final hash output of SHA3
+ *
+	@param H an instance SHA3
+	@param h a byte array to take hash
+	@param len is the length of the hash
+ */
+extern void  SHA3_shake(sha3 *H, char *h, int len);
+
+/**	@brief create variable length intermediate hash output of SHA3
+ *
+	@param H an instance SHA3
+	@param h a byte array to take hash
+	@param len is the length of the hash
+ */
+extern void  SHA3_continuing_shake(sha3 *H, char *h, int len);
+
+/**	@brief generate further hash output of SHA3
+ *
+	@param H an instance SHA3
+	@param h a byte array to take hash
+	@param len is the length of the hash
+ */
+extern void  SHA3_squeeze(sha3 *H, char *h, int len);
+
+/* MAC functions */
+
+/**	@brief General Purpose Hashing function
+ *
+    @param hash the hash family (SHA2 or SHA3)
+	@param hlen the hash function output length (32,48 or 64)
+	@param w an output octet
+    @param olen the output length
+    @param pad zero padding
+    @param p an input octet
+    @param n an input 32-bit integer
+    @param x an optional input octet
+ */
+extern void GPhash(int hash,int hlen,octet *w,int olen,int pad,octet *p,int n,octet *x);
+
+/**	@brief Simple purpose Hashing function
+ *
+    @param hash the hash family (SHA2 or SHA3)
+	@param hlen the hash function output length (32,48 or 64)
+	@param w an output octet
+    @param p an input octet
+ */
+extern void SPhash(int hash, int hlen,octet *w, octet *p);
+
+/**	@brief HMAC function
+ *
+	@param T an output tag
+    @param len the tag length
+    @param K an input key, or salt
+    @param M an input message
+    @param hash the hash family (SHA2 or SHA3)
+	@param hlen the hash function output length (32,48 or 64)
+ */
+extern void HMAC(int hash,int hlen,octet *T,int len,octet *K,octet *M);
+
+
+/**	@brief HKDF_Extract function
+ *
+    @param hash the hash family (SHA2 or SHA3)
+	@param hlen the hash function output length (32,48 or 64)
+	@param K an output Key
+    @param P public input salt
+    @param S raw secret keying material
+ */
+extern void HKDF_Extract(int hash,int hlen,octet *K,octet *P,octet *S);
+
+/**	@brief HKDF_Expand function
+ *
+    @param hash the hash family (SHA2 or SHA3)
+	@param hlen the hash function output length (32,48 or 64)
+	@param E an expanded output Key
+    @param olen is the desired length of the expanded key
+    @param K is the fixed length input key
+    @param I is public context information
+
+ */
+extern void HKDF_Expand(int hash,int hlen,octet *E,int olen,octet *K,octet *I);
+
+/**	@brief XOF_Expand function
+ *
+	@param hlen the SHA3 output length (16 or 32)
+	@param E an expanded messsage
+    @param olen is the desired length of the expanded key
+    @param P is Domain Separator
+    @param S input message
+
+ */
+extern void XOF_Expand(int hlen,octet *E,int olen,octet *P,octet *S);
+
+/**	@brief XOF_Expand function
+ *
+    @param hash the hash family (SHA2 or SHA3)
+	@param hlen the SHA3 output length (16 or 32)
+	@param E an expanded messsage
+    @param olen is the desired length of the expanded key
+    @param P is Domain Separator
+    @param S input message
+
+ */
+extern void XMD_Expand(int hash,int hlen,octet *E,int olen,octet *P,octet *S);
+
+
+/** @brief PKCS V1.5 padding of a message prior to RSA signature
+ *
+    @param h is the hash type
+    @param M is the input message
+    @param W is the output encoding, ready for RSA signature
+    @return 1 if OK, else 0
+ */
+extern int PKCS15(int h, octet *M, octet *W);
+
+/** @brief Alternative PKCS V1.5 padding of a message prior to RSA signature
+ *
+    @param h is the hash type
+    @param M is the input message
+    @param W is the output encoding, ready for RSA signature
+    @return 1 if OK, else 0
+ */
+extern int PKCS15b(int h, octet *M, octet *W);
+
+/** @brief PSS padding of a message prior to RSA signature
+ *
+    @param h is the hash type
+    @param M is the input message
+    @param R is a pointer to a cryptographically secure random number generator
+    @param W is the output encoding, ready for RSA signature
+    @return 1 if OK, else 0
+ */
+extern int PSS_ENCODE(int h, octet *M, csprng *R, octet *W);
+
+/** @brief PSS verification
+ *
+    @param h is the hash type
+    @param M is the message
+    @param W is the message encoding
+    @return 1 if OK, else 0
+ */
+extern int PSS_VERIFY(int h, octet *M, octet *W);
+
+
+/** @brief OAEP padding of a message prior to RSA encryption
+ *
+    @param h is the hash type
+    @param M is the input message
+    @param R is a pointer to a cryptographically secure random number generator
+    @param P are input encoding parameter string (could be NULL)
+    @param F is the output encoding, ready for RSA encryption
+    @return 1 if OK, else 0
+ */
+extern int  OAEP_ENCODE(int h, octet *M, csprng *R, octet *P, octet *F);
+/** @brief OAEP unpadding of a message after RSA decryption
+ *
+    Unpadding is done in-place
+    @param h is the hash type
+    @param P are input encoding parameter string (could be NULL)
+    @param F is input padded message, unpadded on output
+    @return 1 if OK, else 0
+ */
+extern int  OAEP_DECODE(int h, octet *P, octet *F);
+
+/**	@brief Key Derivation Function - generates key K from inputs Z and P
+ *
+	IEEE-1363 KDF2 Key Derivation Function. 
+	@param hash is the hash family (SHA2 or SHA3)
+    @param hlen the hash function output length (32,48 or 64)
+	@param Z input octet
+	@param P input key derivation parameters - can be NULL
+	@param len is output desired length of key
+	@param K is the derived key
+ */
+extern void KDF2(int hash, int hlen, octet *K, int len, octet *Z, octet *P);
+/**	@brief Password Based Key Derivation Function - generates key K from password, salt and repeat counter
+ *
+	PBKDF2 Password Based Key Derivation Function. 
+	@param hash is the hash family (SHA2 or SHA3)
+    @param hlen the hash function output length (32,48 or 64)
+	@param P input password
+	@param S input salt
+	@param rep Number of times to be iterated.
+	@param len is output desired length
+	@param K is the derived key
+ */
+extern void PBKDF2(int hash, int hlen, octet *K, int len, octet *P, octet *S, int rep);
+
+/* AES functions */
+/**	@brief Reset AES mode or IV
+ *
+	@param A an instance of the aes
+	@param m is the new active mode of operation (ECB, CBC, OFB, CFB etc)
+	@param iv the new Initialisation Vector
+ */
+extern void AES_reset(aes *A, int m, char *iv);
+/**	@brief Extract chaining vector from aes instance
+ *
+	@param A an instance of the aes
+	@param f the extracted chaining vector
+ */
+extern void AES_getreg(aes *A, char * f);
+/**	@brief Initialise an instance of aes and its mode of operation
+ *
+	@param A an instance aes
+	@param m is the active mode of operation (ECB, CBC, OFB, CFB etc)
+	@param n is the key length in bytes, 16, 24 or 32
+	@param k the AES key as an array of 16 bytes
+	@param iv the Initialisation Vector
+	@return 0 for invalid n
+ */
+extern int AES_init(aes *A, int m, int n, char *k, char *iv);
+/**	@brief Encrypt a single 16 byte block in ECB mode
+ *
+	@param A an instance of the aes
+	@param b is an array of 16 plaintext bytes, on exit becomes ciphertext
+ */
+extern void AES_ecb_encrypt(aes *A, uchar * b);
+/**	@brief Decrypt a single 16 byte block in ECB mode
+ *
+	@param A an instance of the aes
+	@param b is an array of 16 cipherext bytes, on exit becomes plaintext
+ */
+extern void AES_ecb_decrypt(aes *A, uchar * b);
+/**	@brief Encrypt a single 16 byte block in active mode
+ *
+	@param A an instance of the aes
+	@param b is an array of 16 plaintext bytes, on exit becomes ciphertext
+	@return 0, or overflow bytes from CFB mode
+ */
+extern unsign32 AES_encrypt(aes *A, char *b );
+/**	@brief Decrypt a single 16 byte block in active mode
+ *
+	@param A an instance of the aes
+	@param b is an array of 16 ciphertext bytes, on exit becomes plaintext
+	@return 0, or overflow bytes from CFB mode
+ */
+extern unsign32 AES_decrypt(aes *A, char *b);
+/**	@brief Clean up after application of AES
+ *
+	@param A an instance of the aes
+ */
+extern void AES_end(aes *A);
+
+/**	@brief AES encrypts a plaintext to a ciphtertext
+ *
+	IEEE-1363 AES_CBC_IV0_ENCRYPT function. Encrypts in CBC mode with a zero IV, padding as necessary to create a full final block.
+	@param K AES key
+	@param P input plaintext octet
+	@param C output ciphertext octet
+ */
+extern void AES_CBC_IV0_ENCRYPT(octet *K, octet *P, octet *C);
+/**	@brief AES encrypts a plaintext to a ciphtertext
+ *
+	IEEE-1363 AES_CBC_IV0_DECRYPT function. Decrypts in CBC mode with a zero IV.
+	@param K AES key
+	@param C input ciphertext octet
+	@param P output plaintext octet
+	@return 0 if bad input, else 1
+ */
+extern int AES_CBC_IV0_DECRYPT(octet *K, octet *C, octet *P);
+
+/* AES-GCM functions */
+/**	@brief Initialise an instance of AES-GCM mode
+ *
+	@param G an instance AES-GCM
+	@param nk is the key length in bytes, 16, 24 or 32
+	@param k the AES key as an array of 16 bytes
+	@param n the number of bytes in the Initialisation Vector (IV)
+	@param iv the IV
+ */
+extern void GCM_init(gcm *G, int nk, char *k, int n, char *iv);
+/**	@brief Add header (material to be authenticated but not encrypted)
+ *
+	Note that this function can be called any number of times with n a multiple of 16, and then one last time with any value for n
+	@param G an instance AES-GCM
+	@param b is the header material to be added
+	@param n the number of bytes in the header
+ */
+extern int GCM_add_header(gcm *G, char *b, int n);
+/**	@brief Add plaintext and extract ciphertext
+ *
+	Note that this function can be called any number of times with n a multiple of 16, and then one last time with any value for n
+	@param G an instance AES-GCM
+	@param c is the ciphertext generated
+	@param p is the plaintext material to be added
+	@param n the number of bytes in the plaintext
+ */
+extern int GCM_add_plain(gcm *G, char *c, char *p, int n);
+/**	@brief Add ciphertext and extract plaintext
+ *
+	Note that this function can be called any number of times with n a multiple of 16, and then one last time with any value for n
+	@param G an instance AES-GCM
+	@param p is the plaintext generated
+	@param c is the ciphertext material to be added
+	@param n the number of bytes in the ciphertext
+ */
+extern int GCM_add_cipher(gcm *G, char *p, char *c, int n);
+/**	@brief Finish off and extract authentication tag (HMAC)
+ *
+	@param G is an active instance AES-GCM
+	@param t is the output 16 byte authentication tag
+ */
+extern void GCM_finish(gcm *G, char *t);
+
+/**	@brief AES-GCM Encryption
+ *
+	@param K  AES key
+	@param IV Initialization vector
+	@param H Header
+	@param P Plaintext
+	@param C Ciphertext
+	@param T Checksum
+ */
+void AES_GCM_ENCRYPT(octet *K, octet *IV, octet *H, octet *P, octet *C, octet *T);
+
+/**	@brief AES-GCM Decryption
+ *
+	@param K  AES key
+	@param IV Initialization vector
+	@param H Header
+	@param P Plaintext
+	@param C Ciphertext
+	@param T Checksum
+ */
+void AES_GCM_DECRYPT(octet *K, octet *IV, octet *H, octet *C, octet *P, octet *T);
+
+
+/* secret sharing */
+
+/**	@brief Get a share of a message
+ *
+    @param id unique share ID
+    @param nsr number of shares needed for message recovery
+    @param S the output share as an octet
+    @param M the Message octet to be shared
+	@param R an octet of random seed bytes
+	@return a share structure
+
+ */
+extern share getshare(int id,int nsr,octet *S,octet *M,octet *R);
+/**	@brief Recover message from shares
+ *
+    @param M the recovered Message octet
+    @param S an array of sufficient shares
+    @return 0 on success else -1
+ */
+extern int recover(octet *M,share *S);
+
+/* random numbers */
+/**	@brief Seed a random number generator from an array of bytes
+ *
+	The provided seed should be truly random
+	@param R an instance of a Cryptographically Secure Random Number Generator
+	@param n the number of seed bytes provided
+	@param b an array of seed bytes
+
+ */
+extern void RAND_seed(csprng *R, int n, char *b);
+/**	@brief Delete all internal state of a random number generator
+ *
+	@param R an instance of a Cryptographically Secure Random Number Generator
+ */
+extern void RAND_clean(csprng *R);
+/**	@brief Return a random byte from a random number generator
+ *
+	@param R an instance of a Cryptographically Secure Random Number Generator
+	@return a random byte
+ */
+extern int RAND_byte(csprng *R);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/dilithium.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/dilithium.cpp
new file mode 100644
index 0000000..dfa9849
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/dilithium.cpp
@@ -0,0 +1,1224 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* Dilithium API implementation. Constant time where it matters. Spends nearly all of its time running SHA3. Small.
+
+The Matrix A is calculated on-the-fly to keep memory requirement minimal
+Note that 
+1. A precalculated A can be included in the public key, for use by signature and verification (which blows up public key size)
+2. Precalculating A for signature calculation means that the A does not have to re-calculated for each attempt to find a good signature
+
+Might be simpler to wait for hardware support for SHA3 before attempting further optimization!
+
+   M.Scott 30/09/2021
+*/
+
+#include "dilithium.h"
+
+using namespace core;
+
+#define round(a,b) (((a)+((b)/2))/(b))
+
+// parameters for each security level
+// tau,gamma1,gamma2,K,L,eta,lg(2*eta+1),omega
+const int PARAMS_2[8]={39,17,88,4,4,2,3,80};
+const int PARAMS_3[8]={49,19,32,6,5,4,4,55};
+const int PARAMS_5[8]={60,19,32,8,7,2,3,75};
+
+const sign32 roots[] = {0x3ffe00,0x64f7,0x581103,0x77f504,0x39e44,0x740119,0x728129,0x71e24,0x1bde2b,0x23e92b,0x7a64ae,0x5ff480,0x2f9a75,0x53db0a,0x2f7a49,0x28e527,0x299658,0xfa070,0x6f65a5,0x36b788,0x777d91,0x6ecaa1,0x27f968,0x5fb37c,0x5f8dd7,0x44fae8,0x6a84f8,0x4ddc99,0x1ad035,0x7f9423,0x3d3201,0x445c5,0x294a67,0x17620,0x2ef4cd,0x35dec5,0x668504,0x49102d,0x5927d5,0x3bbeaf,0x44f586,0x516e7d,0x368a96,0x541e42,0x360400,0x7b4a4e,0x23d69c,0x77a55e,0x65f23e,0x66cad7,0x357e1e,0x458f5a,0x35843f,0x5f3618,0x67745d,0x38738c,0xc63a8,0x81b9a,0xe8f76,0x3b3853,0x3b8534,0x58dc31,0x1f9d54,0x552f2e,0x43e6e6,0x688c82,0x47c1d0,0x51781a,0x69b65e,0x3509ee,0x2135c7,0x67afbc,0x6caf76,0x1d9772,0x419073,0x709cf7,0x4f3281,0x4fb2af,0x4870e1,0x1efca,0x3410f2,0x70de86,0x20c638,0x296e9f,0x5297a4,0x47844c,0x799a6e,0x5a140a,0x75a283,0x6d2114,0x7f863c,0x6be9f8,0x7a0bde,0x1495d4,0x1c4563,0x6a0c63,0x4cdbea,0x40af0,0x7c417,0x2f4588,0xad00,0x6f16bf,0xdcd44,0x3c675a,0x470bcb,0x7fbe7f,0x193948,0x4e49c1,0x24756c,0x7ca7e0,0xb98a1,0x6bc809,0x2e46c,0x49a809,0x3036c2,0x639ff7,0x5b1c94,0x7d2ae1,0x141305,0x147792,0x139e25,0x67b0e1,0x737945,0x69e803,0x51cea3,0x44a79d,0x488058,0x3a97d9,0x1fea93,0x33ff5a,0x2358d4,0x3a41f8,0x4cdf73,0x223dfb,0x5a8ba0,0x498423,0x412f5,0x252587,0x6d04f1,0x359b5d,0x4a28a1,0x4682fd,0x6d9b57,0x4f25df,0xdbe5e,0x1c5e1a,0xde0e6,0xc7f5a,0x78f83,0x67428b,0x7f3705,0x77e6fd,0x75e022,0x503af7,0x1f0084,0x30ef86,0x49997e,0x77dcd7,0x742593,0x4901c3,0x53919,0x4610c,0x5aad42,0x3eb01b,0x3472e7,0x4ce03c,0x1a7cc7,0x31924,0x2b5ee5,0x291199,0x585a3b,0x134d71,0x3de11c,0x130984,0x25f051,0x185a46,0x466519,0x1314be,0x283891,0x49bb91,0x52308a,0x1c853f,0x1d0b4b,0x6fd6a7,0x6b88bf,0x12e11b,0x4d3e3f,0x6a0d30,0x78fde5,0x1406c7,0x327283,0x61ed6f,0x6c5954,0x1d4099,0x590579,0x6ae5ae,0x16e405,0xbdbe7,0x221de8,0x33f8cf,0x779935,0x54aa0d,0x665ff9,0x63b158,0x58711c,0x470c13,0x910d8,0x463e20,0x612659,0x251d8b,0x2573b7,0x7d5c90,0x1ddd98,0x336898,0x2d4bb,0x6d73a8,0x4f4cbf,0x27c1c,0x18aa08,0x2dfd71,0xc5ca5,0x19379a,0x478168,0x646c3e,0x51813d,0x35c539,0x3b0115,0x41dc0,0x21c4f7,0x70fbf5,0x1a35e7,0x7340e,0x795d46,0x1a4cd0,0x645caf,0x1d2668,0x666e99,0x6f0634,0x7be5db,0x455fdc,0x530765,0x5dc1b0,0x7973de,0x5cfd0a,0x2cc93,0x70f806,0x189c2a,0x49c5aa,0x776a51,0x3bcf2c,0x7f234f,0x6b16e0,0x3c15ca,0x155e68,0x72f6b7,0x1e29ce};
+const sign32 iroots[] = {0x3ffe00,0x7f7b0a,0x7eafd,0x27cefe,0x78c1dd,0xd5ed8,0xbdee8,0x7c41bd,0x56fada,0x5065b8,0x2c04f7,0x50458c,0x1feb81,0x57b53,0x5bf6d6,0x6401d6,0x7b9a3c,0x42ae00,0x4bde,0x650fcc,0x320368,0x155b09,0x3ae519,0x20522a,0x202c85,0x57e699,0x111560,0x86270,0x492879,0x107a5c,0x703f91,0x5649a9,0x2ab0d3,0x6042ad,0x2703d0,0x445acd,0x44a7ae,0x71508b,0x77c467,0x737c59,0x476c75,0x186ba4,0x20a9e9,0x4a5bc2,0x3a50a7,0x4a61e3,0x19152a,0x19edc3,0x83aa3,0x5c0965,0x495b3,0x49dc01,0x2bc1bf,0x49556b,0x2e7184,0x3aea7b,0x442152,0x26b82c,0x36cfd4,0x195afd,0x4a013c,0x50eb34,0x7e69e1,0x56959a,0x454828,0x375fa9,0x3b3864,0x2e115e,0x15f7fe,0xc66bc,0x182f20,0x6c41dc,0x6b686f,0x6bccfc,0x2b520,0x24c36d,0x1c400a,0x4fa93f,0x3637f8,0x7cfb95,0x1417f8,0x744760,0x33821,0x5b6a95,0x319640,0x66a6b9,0x2182,0x38d436,0x4378a7,0x7212bd,0x10c942,0x7f3301,0x509a79,0x781bea,0x7bd511,0x330417,0x15d39e,0x639a9e,0x6b4a2d,0x5d423,0x13f609,0x59c5,0x12beed,0xa3d7e,0x25cbf7,0x64593,0x385bb5,0x2d485d,0x567162,0x5f19c9,0xf017b,0x4bcf0f,0x7df037,0x376f20,0x302d52,0x30ad80,0xf430a,0x3e4f8e,0x62488f,0x13308b,0x183045,0x5eaa3a,0x4ad613,0x1629a3,0x2e67e7,0x381e31,0x17537f,0x3bf91b,0x61b633,0xce94a,0x6a8199,0x43ca37,0x14c921,0xbcb2,0x4410d5,0x875b0,0x361a57,0x6743d7,0xee7fb,0x7d136e,0x22e2f7,0x66c23,0x221e51,0x2cd89c,0x3a8025,0x3fa26,0x10d9cd,0x197168,0x62b999,0x1b8352,0x659331,0x682bb,0x78abf3,0x65aa1a,0xee40c,0x5e1b0a,0x7bc241,0x44deec,0x4a1ac8,0x2e5ec4,0x1b73c3,0x385e99,0x66a867,0x73835c,0x51e290,0x6735f9,0x7d63e5,0x309342,0x126c59,0x7d0b46,0x4c7769,0x620269,0x28371,0x5a6c4a,0x5ac276,0x1eb9a8,0x39a1e1,0x76cf29,0x38d3ee,0x276ee5,0x1c2ea9,0x198008,0x2b35f4,0x846cc,0x4be732,0x5dc219,0x74041a,0x68fbfc,0x14fa53,0x26da88,0x629f68,0x1386ad,0x1df292,0x4d6d7e,0x6bd93a,0x6e21c,0x15d2d1,0x32a1c2,0x6cfee6,0x145742,0x10095a,0x62d4b6,0x635ac2,0x2daf77,0x362470,0x57a770,0x6ccb43,0x397ae8,0x6785bb,0x59efb0,0x6cd67d,0x41fee5,0x6c9290,0x2785c6,0x56ce68,0x54811c,0x7cc6dd,0x65633a,0x32ffc5,0x4b6d1a,0x412fe6,0x2532bf,0x7b7ef5,0x7aa6e8,0x36de3e,0xbba6e,0x8032a,0x364683,0x4ef07b,0x60df7d,0x2fa50a,0x9ffdf,0x7f904,0xa8fc,0x189d76,0x78507e,0x7360a7,0x71ff1b,0x6381e7,0x7221a3,0x30ba22,0x1244aa,0x395d04,0x35b760,0x4a44a4,0x12db10,0x5aba7a,0x7bcd0c,0x365bde,0x255461,0x5da206,0x33008e,0x459e09,0x5c872d,0x4be0a7,0x5ff56e};
+
+/* Montgomery stuff */
+
+static sign32 redc(unsign64 T)
+{
+    unsign32 m = (unsign32)T * (unsign32)DL_ND;
+    return ((unsign64)m * DL_PRIME + T) >> 32;
+}
+
+static sign32 nres(unsign32 x)
+{
+    return redc((unsign64)x * DL_R2MODP);
+}
+
+static sign32 modmul(unsign32 a, unsign32 b)
+{
+    return redc((unsign64)a * b);
+}
+
+// make all elements +ve
+static void poly_pos(sign32 *p)
+{
+    int i;
+    for (i=0;i<DL_DEGREE;i++)
+        p[i]+=(p[i]>>31)&DL_PRIME; 
+}
+
+// NTT code
+
+// Important!
+// nres(x); ntt(x)
+// nres(y); ntt(y)
+// z=x*y
+// intt(z);
+// redc(z);
+
+// is equivalent to (note that nres() and redc() cancel out)
+
+// ntt(x);
+// nres(y); ntt(y);
+// z=x*y
+// intt(z)
+
+// is equivalent to
+
+// ntt(x)
+// ntt(y)
+// z=x*y
+// intt(z)
+// nres(z)
+
+// In all cases z ends up in normal (non-Montgomery) form!
+// So the conversion to Montgomery form can be "pushed" through the calculation.
+
+// Here intt(z) <- intt(z);nres(z); 
+// Combining is more efficient
+// note that ntt() and intt() are not mutually inverse
+
+/* NTT code */
+/* Cooley-Tukey NTT */
+/* Excess of 2 allowed on input - coefficients must be < 2*PRIME */
+
+static void ntt(sign32 *x)
+{
+    int m, i, j, start, len = DL_DEGREE / 2;
+    sign32 S, V, q = DL_PRIME;
+
+    /* Make positive */
+    poly_pos(x);
+    m = 1;
+    while (m < DL_DEGREE)
+    {
+        start = 0;
+        for (i = 0; i < m; i++)
+        {
+            S = roots[m + i];
+            for (j = start; j < start + len; j++)
+            {
+                V = modmul(x[j + len], S);
+                x[j + len] = x[j] + 2 * q - V;
+                x[j] = x[j] + V;
+            }
+            start += 2 * len;
+        }
+        len /= 2;
+        m *= 2;
+    }
+}
+
+/* Gentleman-Sande INTT */
+/* Excess of 2 allowed on input - coefficients must be < 2*PRIME */
+/* Output fully reduced */
+#define NTTL 1 // maybe should be 2?
+
+static void intt(sign32 *x)
+{
+    int m, i, j, k, n,lim,t = 1;
+    sign32 S, U, V, W, q = DL_PRIME;
+
+    m = DL_DEGREE/2;
+    n=DL_LGN;
+    while (m >= 1)
+    {
+		lim=NTTL>>n;
+		n--;
+        k = 0;
+        for (i = 0; i < m; i++)
+        {
+            S = iroots[m + i];
+            for (j = k; j < k + t; j++)
+            {
+#if NTTL>1
+				if (m<NTTL && j<k+lim)   // This should be unwound for timings
+				{ // need to knock back excesses. Never used if NTTL=1.
+					U=modmul(x[j],DL_ONE);  
+					V=modmul(x[j+t],DL_ONE); 
+				} else {
+                    U = x[j];
+                    V = x[j + t];
+                }
+#else
+                U = x[j];
+                V = x[j + t];                
+#endif
+                x[j] = U + V;
+                W = U + (DL_DEGREE/NTTL) * q - V; 
+                x[j + t] = modmul(W, S); 
+            }
+            k += 2 * t;
+        }
+        t *= 2;
+        m /= 2;
+    }
+
+    for (j = 0; j < DL_DEGREE; j++)
+    { // fully reduce, nres combined with 1/DEGREE
+        x[j]=  modmul(x[j],DL_COMBO);
+        x[j] -= q;
+        x[j] += (x[j] >> 31)&q;
+    } 
+}
+
+static void nres_it(sign32 *p)
+{
+    int i;
+    for (i = 0; i < DL_DEGREE; i++)
+        p[i] = nres(p[i]);
+}
+
+static void redc_it(sign32 *p)
+{
+    int i;
+    for (i = 0; i < DL_DEGREE; i++)
+        p[i] = redc(p[i]);
+}
+
+// copy polynomial
+static void poly_copy(sign32 *p1, sign32 *p2)
+{
+    int i;
+    for (i = 0; i < DL_DEGREE; i++)
+        p1[i] = p2[i];
+}
+
+// copy from small polynomial
+static void poly_scopy(sign32 *p1, sign8 *p2)
+{
+    int i;
+    for (i = 0; i < DL_DEGREE; i++)
+        p1[i] = (sign32)p2[i];
+}
+
+// copy from medium polynomial
+static void poly_mcopy(sign32 *p1, sign16 *p2)
+{
+    int i;
+    for (i = 0; i < DL_DEGREE; i++)
+        p1[i] = (sign32)p2[i];
+}
+
+static void poly_zero(sign32 *p1)
+{
+    int i;
+    for (i = 0; i < DL_DEGREE; i++)
+        p1[i] = 0;
+}
+
+static void poly_negate(sign32 *p1,sign32 *p2)
+{
+    int i;
+    for (i = 0; i < DL_DEGREE; i++)
+        p1[i] = DL_PRIME-p2[i];
+}
+
+static void poly_mul(sign32 *p1, sign32 *p2, sign32 *p3)
+{
+    int i;
+    for (i = 0; i < DL_DEGREE; i++)
+        p1[i] = modmul(p2[i], p3[i]);
+}
+
+static void poly_add(sign32 *p1, sign32 *p2, sign32 *p3)
+{
+    int i;
+    for (i = 0; i < DL_DEGREE; i++)
+        p1[i] = (p2[i] + p3[i]);
+}
+
+static void poly_sub(sign32 *p1, sign32 *p2, sign32 *p3)
+{
+    int i;
+    for (i = 0; i < DL_DEGREE; i++)
+        p1[i] = (p2[i] + DL_PRIME - p3[i]);
+}
+
+/* reduces inputs that are already < 2q */
+static void poly_soft_reduce(sign32 *poly)
+{
+    int i;
+    sign32 e;
+    for (i = 0; i < DL_DEGREE; i++)
+    {
+        e = poly[i] - DL_PRIME;
+        poly[i] = e + ((e >> 31)&DL_PRIME);
+    }
+}
+
+/* fully reduces modulo q */
+static void poly_hard_reduce(sign32 *poly)
+{
+    int i;
+    sign32 e;
+    for (i = 0; i < DL_DEGREE; i++)
+    {
+        e = modmul(poly[i], DL_ONE); // reduces to < 2q
+        e = e - DL_PRIME;
+        poly[i] = e + ((e >> 31)&DL_PRIME); // finishes it off
+    }
+}
+
+// Generate A[i][j] from rho
+static void ExpandAij(byte rho[32],sign32 Aij[],int i,int j)
+{
+    sha3 sh;
+    int m,n;
+    unsign32 b0,b1,b2;
+    sign32 cf;
+    SHA3_init(&sh, SHAKE128);
+    byte buff[840];  // should be plenty
+    for (m=0;m<32;m++)
+        SHA3_process(&sh,rho[m]);
+    SHA3_process(&sh,j&0xff);
+    SHA3_process(&sh,i&0xff);
+    SHA3_shake(&sh,(char *)buff,840);
+    m=n=0;
+    while (m<DL_DEGREE)
+    {
+        b0=(unsign32)buff[n++]; b1=(unsign32)buff[n++]; b2=(unsign32)buff[n++]; 
+        cf=((b2&0x7F)<<16)+(b1<<8)+b0;
+        if (cf>=DL_PRIME) continue;
+        Aij[m++]=cf;
+    }
+}
+
+// array t has ab active bits per word
+// extract bytes from array of words
+// if max!=0 then -max<=t[i]<=+max
+static byte nextbyte32(int ab,int max,sign32 t[],int &ptr, int &bts)
+{
+    sign32 r,w;
+    int left=ab-bts; // number of bits left in this word
+    int i=0;
+    w=t[ptr];
+    if (max!=0)
+        w=max-w;
+    r=w>>bts;
+    while (left<8)
+    {
+        i++;
+        w=t[ptr+i];
+        if (max!=0)
+            w=max-w;
+        r|=w<<left;
+        left+=ab;
+    }
+
+    bts+=8;
+    while (bts>=ab)
+    {
+        bts-=ab;
+        ptr++;
+    }
+    return (byte)r&0xff;        
+}
+
+// array t has ab active bits per word
+// extract dense bytes from array of words
+// if max!=0 then -max<=t[i]<=+max
+static byte nextbyte16(int ab,int max,sign16 t[],int &ptr, int &bts)
+{
+    sign32 r,w;
+    int left=ab-bts; // number of bits left in this word
+    int i=0;
+    w=t[ptr];
+    if (max!=0)
+        w=max-w;
+    r=w>>bts;
+    while (left<8)
+    {
+        i++;
+        w=t[ptr+i];
+        if (max!=0)
+            w=max-w;
+        r|=w<<left;
+        left+=ab;
+    }
+
+    bts+=8;
+    while (bts>=ab)
+    {
+        bts-=ab;
+        ptr++;
+    }
+    return (byte)r&0xff;        
+}
+
+// array t has ab active bits per word
+// extract dense bytes from array of words
+// if max!=0 then -max<=t[i]<=+max
+static byte nextbyte8(int ab,int max,sign8 t[],int &ptr, int &bts)
+{
+    sign32 r,w;
+    int left=ab-bts; // number of bits left in this word
+    int i=0;
+    w=t[ptr];
+    if (max!=0)
+        w=max-w;
+    r=w>>bts;
+    while (left<8)
+    {
+        i++;
+        w=t[ptr+i];
+        if (max!=0)
+            w=max-w;
+        r|=w<<left;
+        left+=ab;
+    }
+
+    bts+=8;
+    while (bts>=ab)
+    {
+        bts-=ab;
+        ptr++;
+    }
+    return (byte)r&0xff;        
+}
+
+// extract ab bits into word from dense byte stream
+static sign32 nextword(const int ab,int max,byte t[],int &ptr, int &bts)
+{
+    sign32 r=t[ptr]>>bts;
+    sign32 mask=(1<<ab)-1;
+    sign32 w;
+    int i=0;
+    int gotbits=8-bts; // bits left in current byte
+    while (gotbits<ab)
+    {
+        i++;
+        w=(sign32)t[ptr+i];
+        r|=w<<gotbits;
+        gotbits+=8;
+    }
+    bts+=ab;
+    while (bts>=8)
+    {
+        bts-=8;
+        ptr++;
+    }
+    w=r&mask;
+    if (max!=0)
+        w=max-w;
+    return w;  
+}
+
+// pack public key
+static int pack_pk(const int *params,byte pk[],byte rho[32],sign16 t1[])
+{
+    int ptr,bts,i,n=0;
+    int ck=params[3];
+    for (i=0;i<32;i++)
+        pk[i]=rho[i];
+    n=32; ptr=bts=0;
+    for (i=0;i<(ck*DL_DEGREE*DL_TD)/8;i++ )
+        pk[n++]=nextbyte16(DL_TD,0,t1,ptr,bts);
+    return n;
+}
+
+// unpack public key
+static void unpack_pk(const int *params,byte rho[32],sign16 t1[],byte pk[])
+{
+    int ptr,bts,i;
+    int ck=params[3];
+    for (i=0;i<32;i++)
+        rho[i]=pk[i];
+    ptr=bts=0;
+    for (i=0;i<ck*DL_DEGREE;i++ )
+        t1[i]=(sign16)nextword(DL_TD,0,&pk[32],ptr,bts);
+}
+
+// secret key of size 32*3+DEGREE*(K*D+L*LG2ETA1+K*LG2ETA1)/8
+static int pack_sk(const int *params,byte sk[],byte rho[32],byte bK[32],byte tr[32],sign8 s1[],sign8 s2[],sign16 t0[])
+{
+    int ptr,bts,i,n=32;
+    int ck=params[3];
+    int el=params[4];
+    int eta=params[5];
+    int lg2eta1=params[6];
+
+    for (i=0;i<32;i++)
+        sk[i]=rho[i];
+    for (i=0;i<32;i++)
+        sk[n++]=bK[i];
+    for (i=0;i<32;i++)
+        sk[n++]=tr[i];
+    ptr=bts=0;
+    for (i=0;i<(el*DL_DEGREE*lg2eta1)/8;i++)
+        sk[n++]=nextbyte8(lg2eta1,eta,s1,ptr,bts);
+    ptr=bts=0;
+    for (i=0;i<(ck*DL_DEGREE*lg2eta1)/8;i++)
+        sk[n++]=nextbyte8(lg2eta1,eta,s2,ptr,bts);
+    ptr=bts=0;
+    for (i=0;i<(ck*DL_DEGREE*DL_D)/8;i++)
+        sk[n++]=nextbyte16(DL_D,(1<<(DL_D-1)),t0,ptr,bts);
+    return n;
+}
+
+static void unpack_sk(const int *params,byte rho[32],byte bK[32],byte tr[32],sign8 s1[],sign8 s2[],sign16 t0[],byte sk[])
+{
+    int ptr,bts,i,n=32;
+    int ck=params[3];
+    int el=params[4];
+    int eta=params[5];
+    int lg2eta1=params[6];
+
+    for (i=0;i<32;i++)
+        rho[i]=sk[i];
+    for (i=0;i<32;i++)
+        bK[i]=sk[n++];
+    for (i=0;i<32;i++)
+        tr[i]=sk[n++];
+    ptr=bts=0; 
+    for (i=0;i<el*DL_DEGREE;i++ )
+        s1[i]=(sign8)nextword(lg2eta1,eta,&sk[n],ptr,bts);
+    n+=ptr;
+    ptr=bts=0; 
+    for (i=0;i<ck*DL_DEGREE;i++ )
+        s2[i]=(sign8)nextword(lg2eta1,eta,&sk[n],ptr,bts);
+    n+=ptr;
+    ptr=bts=0;
+    for (i=0;i<ck*DL_DEGREE;i++ )
+        t0[i]=(sign16)nextword(DL_D,(1<<(DL_D-1)),&sk[n],ptr,bts);
+}
+
+// pack signature - changes z 
+static int pack_sig(const int *params,byte sig[],sign32 z[],byte ct[],byte h[])
+{
+    int lg=params[1];
+    int gamma1=1<<lg;
+    int ck=params[3];
+    int el=params[4];
+    int omega=params[7];
+    int ptr,bts,i,m,n,row,k=(el*DL_DEGREE*(lg+1))/8;
+    sign32 t;
+
+    for (i=0;i<32;i++)
+      sig[i]=ct[i];   
+    n=32;
+    ptr=bts=0;
+//pre-process z
+    for (i=0;i<el;i++)
+    {
+        row=DL_DEGREE*i;
+        for (m=0;m<DL_DEGREE;m++)
+        {
+            t=z[row+m];
+            if (t>DL_PRIME/2) t-=DL_PRIME;
+            t=gamma1-t;
+            z[row+m]=t;
+        }
+    }
+    for (i=0;i<k;i++) {
+        sig[n++]=nextbyte32(lg+1,0,z,ptr,bts);
+    }
+    for (i=0;i<omega+ck;i++)
+        sig[n++]=h[i];
+    return n;
+}
+
+static void unpack_sig(const int *params,sign32 z[],byte ct[],byte h[],byte sig[])
+{
+    int lg=params[1];
+    int gamma1=1<<lg;
+    int ck=params[3];
+    int el=params[4];
+    int omega=params[7];
+
+    int ptr,bts,i,n=el*DL_DEGREE;
+    sign32 t;
+    int m=32+(el*DL_DEGREE*(lg+1))/8;
+    for (i=0;i<32;i++)
+        ct[i]=sig[i];
+
+    ptr=bts=0;
+    for (i=0;i<n;i++) {
+        t=nextword(lg+1,0,&sig[32],ptr,bts);
+        t=gamma1-t;
+        if (t<0) t+=DL_PRIME;
+        z[i]=t;
+    }
+
+    for (i=0;i<omega+ck;i++)
+        h[i]=sig[m++];    
+}
+
+// rejection sampling in range -ETA to +ETA
+static void sample_Sn(const int *params,byte rhod[64],sign8 s[],int n)
+{
+    int m,ptr,bts;
+    int eta=params[5];
+    int lg2eta1=params[6];
+    sha3 sh;
+    byte buff[272];
+    SHA3_init(&sh, SHAKE256);
+    for (m=0;m<64;m++)
+        SHA3_process(&sh,rhod[m]);
+    SHA3_process(&sh,n&0xff);
+    SHA3_process(&sh,(n>>8)&0xff);
+    SHA3_shake(&sh,(char *)buff,272);
+    ptr=bts=0;
+    for (m=0;m<DL_DEGREE;m++)
+    {
+        do
+        {
+            s[m]=nextword(lg2eta1,0,buff,ptr,bts);
+        }
+        while (s[m]>2*eta);
+        s[m]=eta-s[m];
+    }
+}
+
+// uniform random sampling
+static void sample_Y(const int *params,int k,byte rhod[64],sign32 y[])
+{
+    int i,j,m,ki,row,ptr,bts;   // 2^n-1
+    int lg=params[1];
+    int gamma1=1<<lg;
+    int el=params[4];
+    sha3 sh;
+    sign32 w,t;
+    byte buff[DL_YBYTES];
+
+    for (i=0;i<el;i++)
+    {
+        row=DL_DEGREE*i;
+        SHA3_init(&sh, SHAKE256);
+        for (j=0;j<64;j++)
+            SHA3_process(&sh,rhod[j]);
+        ki=k+i;
+        SHA3_process(&sh,ki&0xff);
+        SHA3_process(&sh,ki>>8);
+        SHA3_shake(&sh,(char *)buff,DL_YBYTES);
+
+        ptr=bts=0;
+        for (m=0;m<DL_DEGREE;m++)
+        {  // take in LG+1 bits at a time
+            w=nextword(lg+1,0,buff,ptr,bts);  // 20 bits
+            w=gamma1-w;
+            t=w>>31;
+            y[row+m]=w+(DL_PRIME&t);
+        }
+    }
+}
+
+// CRH(rho,t1)
+static void CRH1(const int *params,byte H[32],byte rho[32],sign16 t1[])
+{
+    int i;
+    int ptr,bts;
+    int ck=params[3];
+    sha3 sh;
+    SHA3_init(&sh, SHAKE256);
+    for (i=0;i<32;i++)
+        SHA3_process(&sh,rho[i]);
+    ptr=bts=0;
+    for (i=0;i<(ck*DL_DEGREE*DL_TD)/8;i++)
+            SHA3_process(&sh,nextbyte16(DL_TD,0,t1,ptr,bts));
+    SHA3_shake(&sh,(char *)H,32);
+}
+
+// CRH(tr,M)
+static void CRH2(byte H[64],byte tr[32],byte mess[],int mlen)
+{
+    int i;
+    sha3 sh;
+    SHA3_init(&sh, SHAKE256);
+    for (i=0;i<32;i++)
+        SHA3_process(&sh,tr[i]);
+    for (i=0;i<mlen;i++)
+        SHA3_process(&sh,mess[i]);
+    SHA3_shake(&sh,(char *)H,64);
+}
+
+// CRH(K,mu)
+static void CRH3(byte H[64],byte bK[32],byte mu[64])
+{
+    int i;
+    sha3 sh;
+    SHA3_init(&sh, SHAKE256);
+    for (i=0;i<32;i++)
+        SHA3_process(&sh,bK[i]);
+    for (i=0;i<64;i++)
+        SHA3_process(&sh,mu[i]);
+    SHA3_shake(&sh,(char *)H,64);
+}
+
+// H(mu,w1)
+static void H4(const int *params,byte CT[32],byte mu[64],sign8 w1[])
+{
+    int i;
+    int ptr,bts;
+    int ck=params[3];
+    int dv=params[2];
+    sha3 sh;
+    int w1b=4;
+    if (dv==88) w1b=6;
+    SHA3_init(&sh, SHAKE256);
+    for (i=0;i<64;i++)
+        SHA3_process(&sh,mu[i]);
+    ptr=bts=0;
+    for (i=0;i<(ck*DL_DEGREE*w1b)/8;i++)
+        SHA3_process(&sh,nextbyte8(w1b,0,w1,ptr,bts));
+    SHA3_shake(&sh,(char *)CT,32);
+}
+
+static void SampleInBall(const int *params,byte ct[32],sign32 c[DL_DEGREE])
+{
+    int i,j,k,n,b,sn;
+    int tau=params[0];
+    byte signs[8],buff[136];
+    sha3 sh;
+    SHA3_init(&sh, SHAKE256);
+    for (i=0;i<32;i++)
+        SHA3_process(&sh,ct[i]);
+    SHA3_shake(&sh,(char *)buff,136);
+    for (i=0;i<8;i++)
+        signs[i]=buff[i];
+    k=8; 
+    b=0;
+    poly_zero(c);
+    sn=signs[0]; n=1;
+    for (i=DL_DEGREE-tau;i<DL_DEGREE;i++)
+    {
+        do
+        {
+            j=buff[k++];
+        } while (j>i);
+        c[i]=c[j];
+        c[j]=1-2*((sign32)sn&1);
+        sn>>=1; b++;
+        if (b==8) {
+            sn=signs[n++]; b=0;
+        }
+    }
+}
+
+static sign16 p2r(sign32 *r0)
+{
+    sign32 d=(1<<DL_D);
+    sign32 r1;
+    r1=(*r0+d/2-1)>>DL_D;  
+    *r0-=(r1 << DL_D);
+    return (sign16)r1;
+}
+
+static void Power2Round(sign32 t[],sign16 t0[],sign16 t1[])
+{
+    int m;
+    sign32 w;
+    for (m=0;m<DL_DEGREE;m++)
+    {   
+        w=t[m];
+        t1[m]=p2r(&w);
+        t0[m]=(sign16)w;
+    }
+}
+
+// ALPHA = (Q-1)/16 - borrowed from dilithium ref implementation
+static sign32 decompose_lo(const int *params,sign32 a) {
+    int gamma2,dv=params[2];
+    sign32 a0,a1;
+    a1  = (a + 127) >> 7;
+
+    if (dv==32)
+    {
+        a1  = (a1*1025 + (1 << 21)) >> 22;
+        a1 &= 15;
+        gamma2=(DL_PRIME-1)/32;
+    } else { // 88
+        a1  = (a1*11275 + (1 << 23)) >> 24;
+        a1 ^= ((43 - a1) >> 31) & a1;
+        gamma2=(DL_PRIME-1)/88;
+    }
+
+    a0  = a - a1*2*gamma2;  // (Q-1)/2R=alpha
+    a0 -= (((DL_PRIME-1)/2 - a0) >> 31) & DL_PRIME;
+    a0 += (a0>>31)&DL_PRIME;
+    return a0;
+}
+
+// ALPHA = (Q-1)/16
+static sign8 decompose_hi(const int *params,sign32 a) {
+    int dv=params[2];
+    sign32 a1;
+    a1  = (a + 127) >> 7;
+    if (dv==32) {
+        a1  = (a1*1025 + (1 << 21)) >> 22;
+        a1 &= 15;
+    } else {
+        a1  = (a1*11275 + (1 << 23)) >> 24;
+        a1 ^= ((43 - a1) >> 31) & a1;
+    }
+    return (sign8)a1;
+}
+
+static void lobits(const int *params,sign32 r0[],sign32 r[])
+{
+    int m;
+    for (m=0;m<DL_DEGREE;m++)
+            r0[m]=decompose_lo(params,r[m]);
+}
+
+static void hibits(const int *params,sign8 r1[],sign32 r[])
+{
+    int m;
+    for (m=0;m<DL_DEGREE;m++)
+        r1[m]=decompose_hi(params,r[m]);
+}    
+
+
+// before h initialised to zeros, hptr=0
+// after new hptr returned and h[OMEGA+i]= hptr
+static int MakePartialHint(const int *params,byte h[],int hptr,sign32 z[],sign32 r[])
+{
+    int m;
+    sign8 a0,a1;
+    sign32 rz;
+    int omega=params[7];
+    for (m=0;m<DL_DEGREE;m++)
+    {
+        a0=decompose_hi(params,r[m]);
+        rz=r[m]+z[m];
+        rz-=DL_PRIME;
+        rz=rz+((rz>>31)&DL_PRIME);
+        a1=decompose_hi(params,rz);
+        if (a0!=a1) {
+            if (hptr>=omega) return omega+1;
+            h[hptr++]=m&0xff;
+        }
+    }
+    return hptr;
+}
+
+static int UsePartialHint(const int *params,sign8 r[],byte h[],int hptr,int i,sign32 w[])
+{
+    int dv=(sign8)params[2];
+    int omega=params[7];
+    sign8 a1,md=dv/2;
+    sign32 a0;
+    int m;
+    for (m=0;m<DL_DEGREE;m++)
+    {
+        a1=decompose_hi(params,w[m]);
+        if (m==h[hptr] && hptr<h[omega+i])
+        {
+            hptr++;
+            a0=decompose_lo(params,w[m]);
+            if (a0<=DL_PRIME/2) {
+                a1++;
+                if (a1>=md) a1-=md;
+            } else {
+                a1--;
+                if (a1<0) a1+=md;
+            }
+        }
+        r[m]=a1;
+    }
+    return hptr;
+}
+
+static sign32 infinity_norm(sign32 w[])
+{
+    int m;
+    sign32 az,n=0;
+    for (m=0;m<DL_DEGREE;m++)
+    {
+        az=w[m];
+        if (az>DL_PRIME/2) az=DL_PRIME-az;
+        if (az>n) n=az;    
+    }
+    return n;
+}
+
+// Dilithium API
+
+static void keypair(const int *params,byte *tau,octet *sk,octet *pk)
+{
+    int i,row,j;
+    sha3 sh;
+    byte buff[128];
+    byte rho[32];
+    byte rhod[64];
+    byte bK[32];
+    byte tr[32];          // 320 bytes
+    sign32 Aij[DL_DEGREE];     // 1024 bytes
+    sign32 w[DL_DEGREE]; // work space  1024 bytes
+    sign32 r[DL_DEGREE]; // work space  1024 bytes total = 12352
+
+    int ck=params[3];
+    int el=params[4];
+
+#ifdef USE_VLAS
+    sign8 s1[el*DL_DEGREE];     // 1280 bytes
+    sign8 s2[ck*DL_DEGREE];     // 1536 bytes
+    sign16 t0[ck*DL_DEGREE];    // 3072 bytes
+    sign16 t1[ck*DL_DEGREE];    // 3072 bytes
+#else    
+    sign8 s1[DL_MAXL*DL_DEGREE];     // 1280 bytes
+    sign8 s2[DL_MAXK*DL_DEGREE];     // 1536 bytes
+    sign16 t0[DL_MAXK*DL_DEGREE];    // 3072 bytes
+    sign16 t1[DL_MAXK*DL_DEGREE];    // 3072 bytes
+#endif
+    SHA3_init(&sh, SHAKE256);
+  
+    for (i=0;i<32;i++)
+        SHA3_process(&sh,tau[i]); 
+    SHA3_shake(&sh,(char *)buff,128);
+    for (i=0;i<32;i++)
+    {
+        rho[i]=buff[i];
+        bK[i]=buff[i+96];
+    }
+    for (i=0;i<64;i++)
+        rhod[i]=buff[32+i];
+
+    for (i=0;i<el;i++)
+    {
+        row=DL_DEGREE*i;
+        sample_Sn(params,rhod,&s1[row],i);
+    }
+
+    for (i=0;i<ck;i++)
+    {
+        row=DL_DEGREE*i;
+        sample_Sn(params,rhod,&s2[row],el+i);
+        poly_zero(r);
+        for (j=0;j<el;j++)
+        {
+            poly_scopy(w,&s1[j*DL_DEGREE]);
+            ntt(w);  
+            ExpandAij(rho,Aij,i,j);  // This is bottleneck
+            poly_mul(w,w,Aij);
+            poly_add(r,r,w);
+            //poly_soft_reduce(r);  // be lazy
+        }
+        poly_hard_reduce(r);  
+        intt(r);
+        poly_scopy(w,&s2[row]);
+        poly_pos(w);
+        poly_add(r,r,w);
+        poly_soft_reduce(r);
+        Power2Round(r,&t0[row],&t1[row]);
+    }
+
+    CRH1(params,tr,rho,t1);
+
+    pk->len=pack_pk(params,(byte *)pk->val,rho,t1);
+    sk->len=pack_sk(params,(byte *)sk->val,rho,bK,tr,s1,s2,t0);
+}
+
+static int signature(const int *params,octet *sk,octet *M,octet *sig)
+{
+    int i,k,nh,fk,row,j;
+    bool badone;
+    byte rho[32];
+    byte bK[32];
+    byte ct[32];
+    byte tr[32];
+    byte mu[64];
+    byte rhod[64];   // 288 bytes
+    byte hint[100]; // 61 bytes
+
+    sign32 c[DL_DEGREE];  // 1024 bytes
+    sign32 w[DL_DEGREE];  // work space 1024 bytes
+    sign32 r[DL_DEGREE];  // work space 1024 bytes total= 21673 bytes
+    //sign32 Aij[DL_DEGREE]; // 1024 bytes
+
+    int ck=params[3];
+    int el=params[4];
+
+#ifdef USE_VLAS
+    sign8 s1[el*DL_DEGREE]; // 1280 bytes
+    sign8 s2[ck*DL_DEGREE]; // 1536 bytes
+    sign16 t0[ck*DL_DEGREE]; // 3072 bytes
+    sign32 y[el*DL_DEGREE];  // 5120 bytes
+    sign32 Ay[ck*DL_DEGREE]; // 6144 bytes
+    sign8 w1[ck*DL_DEGREE]; // 1280 bytes
+#else
+    sign8 s1[DL_MAXL*DL_DEGREE]; // 1280 bytes
+    sign8 s2[DL_MAXK*DL_DEGREE]; // 1536 bytes
+    sign16 t0[DL_MAXK*DL_DEGREE]; // 3072 bytes
+    sign32 y[DL_MAXL*DL_DEGREE];  // 5120 bytes
+    sign32 Ay[DL_MAXK*DL_DEGREE]; // 6144 bytes
+    sign8 w1[DL_MAXK*DL_DEGREE]; // 1280 bytes
+#endif
+    int tau=params[0];
+    int lg=params[1];
+    int gamma1=(sign32)(1<<lg);
+    int dv=(sign32)params[2];
+    int gamma2=(DL_PRIME-1)/dv;
+    int eta=params[5];
+    int beta=(sign32)(tau*eta);
+    int omega=params[7];
+    unpack_sk(params,rho,bK,tr,s1,s2,t0,(byte *)sk->val);
+
+// signature
+    CRH2(mu,tr,(byte*)M->val,M->len);
+    CRH3(rhod,bK,mu);
+
+    for (k=0; ;k++ )
+    {
+        fk=k*el;
+        sample_Y(params,fk,rhod,y);
+
+// NTT y
+        for (i=0;i<el;i++)
+        {
+            row=DL_DEGREE*i;
+            ntt(&y[row]);
+        }
+
+// Calculate Ay 
+        for (i=0;i<ck;i++)
+        {
+            row=DL_DEGREE*i;
+            poly_zero(r);
+            for (j=0;j<el;j++)
+            { // Note: no NTTs in here
+                poly_copy(w,&y[j*DL_DEGREE]);
+                ExpandAij(rho,c,i,j);  // This is bottleneck // re-use c for Aij 
+                poly_mul(w,w,c);
+                poly_add(r,r,w);
+                //poly_soft_reduce(r);  // be lazy
+            }
+            poly_hard_reduce(r);
+            intt(r);
+            poly_copy(&Ay[row],r);
+// Calculate w1
+            hibits(params,&w1[row],&Ay[row]);
+        }
+
+// Calculate c
+        H4(params,ct,mu,w1);
+        SampleInBall(params,ct,c);
+
+        badone=false;
+// Calculate z=y+c.s1
+        ntt(c);
+        for (i=0;i<el;i++)
+        {
+            row=DL_DEGREE*i;
+            poly_scopy(w,&s1[row]);
+            ntt(w);
+            poly_mul(w,w,c);
+            nres_it(w);
+            poly_add(&y[row],&y[row],w);  // re-use y for z 
+            redc_it(&y[row]);  // unNTT y
+            intt(&y[row]);
+            poly_soft_reduce(&y[row]);
+            if (infinity_norm(&y[row])>=gamma1-beta)
+            {
+                badone=true;
+                break;
+            }
+        }
+
+        if (badone) continue;
+ 
+// Calculate Ay=w-c.s2 and r0=lobits(w-c.s2)
+        nh=0;
+        for (i=0;i<omega+ck;i++)
+            hint[i]=0;
+        for (i=0;i<ck;i++)
+        {
+            row=DL_DEGREE*i;
+            poly_scopy(w,&s2[row]);
+            ntt(w);
+            poly_mul(w,w,c);
+            
+            intt(w);
+            poly_sub(&Ay[row],&Ay[row],w);
+            poly_soft_reduce(&Ay[row]);   //Ay=w-cs2
+            lobits(params,w,&Ay[row]);    // r0
+            if (infinity_norm(w)>=gamma2-beta)
+            {
+                badone=true;
+                break;
+            }
+            poly_mcopy(w,&t0[row]);
+            ntt(w);
+            poly_mul(w,w,c);
+            
+            intt(w);
+            poly_negate(r,w);  // -ct0
+            if (infinity_norm(r)>=gamma2)
+            {
+                badone=true;
+                break;
+            }
+            poly_sub(&Ay[row],&Ay[row],r);
+            poly_soft_reduce(&Ay[row]);
+
+            nh=MakePartialHint(params,hint,nh,r,&Ay[row]);
+            if (nh>omega)
+            {
+                badone=true;
+                break;
+            }
+            hint[omega+i]=nh;
+        }
+        if (badone) continue;
+        break;
+    }
+    sig->len=pack_sig(params,(byte *)sig->val,y,ct,hint);
+    return k+1;      
+}
+
+static bool verify(const int *params,octet *pk,octet *M,octet *sig)
+{
+    int i,row,j,m,hints;
+    byte rho[32];
+    byte mu[64];
+    byte ct[32];
+    byte cct[32];
+    byte tr[32];         // 192 bytes
+    byte hint[100];  // 61 bytes
+
+
+    sign32 Aij[DL_DEGREE];  // 1024 bytes
+    sign32 c[DL_DEGREE];    // 1024 bytes
+    sign32 w[DL_DEGREE]; // work space // 1024 bytes
+    sign32 r[DL_DEGREE]; // work space // 1024 bytes total=14077 bytes
+
+    int ck=params[3];
+    int el=params[4];
+
+#ifdef USE_VLAS
+    sign32 z[el*DL_DEGREE];  // 5120 bytes
+    sign16 t1[ck*DL_DEGREE]; // 3072 bytes
+    sign8 w1d[ck*DL_DEGREE]; // 1536 bytes 
+#else
+    sign32 z[DL_MAXL*DL_DEGREE];  // 5120 bytes
+    sign16 t1[DL_MAXK*DL_DEGREE]; // 3072 bytes
+    sign8 w1d[DL_MAXK*DL_DEGREE]; // 1536 bytes 
+#endif
+    int tau=params[0];
+    int lg=params[1];
+    int gamma1=(sign32)(1<<lg);
+    int eta=params[5];
+    int beta=(sign32)(tau*eta);
+    int omega=params[7];
+
+// unpack public key and signature
+    unpack_pk(params,rho,t1,(byte *)pk->val);
+    unpack_sig(params,z,ct,hint,(byte *)sig->val);
+
+    for (i=0;i<el;i++)
+    {
+        row=DL_DEGREE*i;
+        if (infinity_norm(&z[row])>=gamma1-beta)
+            return false;
+        ntt(&z[row]); // convert to ntt form
+    }
+
+    CRH1(params,tr,rho,t1);
+    CRH2(mu,tr,(byte *)M->val,M->len);
+    SampleInBall(params,ct,c);
+    ntt(c);
+
+// Calculate Az
+    hints=0;
+    for (i=0;i<ck;i++)
+    {
+        row=DL_DEGREE*i;
+        poly_zero(r);
+        for (j=0;j<el;j++)
+        { // Note: no NTTs in here
+            poly_copy(w,&z[j*DL_DEGREE]);
+            ExpandAij(rho,Aij,i,j);    // This is bottleneck
+            poly_mul(w,w,Aij);
+            poly_add(r,r,w);
+            //poly_soft_reduce(r);  // be lazy
+        }
+        poly_hard_reduce(r);
+
+// Calculate Az-ct1.2^d
+        for (m=0;m<DL_DEGREE;m++)
+            w[m]=(sign32)(t1[row+m])<<DL_D;
+        ntt(w);
+        poly_mul(w,w,c);
+        poly_sub(r,r,w);
+        intt(r);
+
+        hints=UsePartialHint(params,&w1d[row],hint,hints,i,r);
+        if (hints>omega) return false;
+    }
+
+    H4(params,cct,mu,w1d);
+
+    for (i=0;i<32;i++)
+        if (ct[i]!=cct[i])
+            return false;
+    return true;
+}
+
+void core::DLTHM_keypair_2(byte *tau,octet *sk,octet *pk)
+{
+    keypair(PARAMS_2,tau,sk,pk);
+}
+
+int core::DLTHM_signature_2(octet *sk,octet *M,octet *sig)
+{
+    return signature(PARAMS_2,sk,M,sig);
+}
+
+bool core::DLTHM_verify_2(octet *pk,octet *M,octet *sig)
+{
+    return verify(PARAMS_2,pk,M,sig);
+}
+
+
+void core::DLTHM_keypair_3(byte *tau,octet *sk,octet *pk)
+{
+    keypair(PARAMS_3,tau,sk,pk);
+}
+
+int core::DLTHM_signature_3(octet *sk,octet *M,octet *sig)
+{
+    return signature(PARAMS_3,sk,M,sig);
+}
+
+bool core::DLTHM_verify_3(octet *pk,octet *M,octet *sig)
+{
+    return verify(PARAMS_3,pk,M,sig);
+}
+
+void core::DLTHM_keypair_5(byte *tau,octet *sk,octet *pk)
+{
+    keypair(PARAMS_5,tau,sk,pk);
+}
+
+int core::DLTHM_signature_5(octet *sk,octet *M,octet *sig)
+{
+    return signature(PARAMS_5,sk,M,sig);
+}
+
+bool core::DLTHM_verify_5(octet *pk,octet *M,octet *sig)
+{
+    return verify(PARAMS_5,pk,M,sig);
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/dilithium.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/dilithium.h
new file mode 100644
index 0000000..73ccbb1
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/dilithium.h
@@ -0,0 +1,151 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* Dilithium API */
+
+#ifndef DILITHIUM_H
+#define DILITHIUM_H
+
+#include "core.h"
+
+/* DILITHIUM parameters */
+
+//q= 8380417
+#define DL_LGN 8
+#define DL_DEGREE (1 << DL_LGN)
+#define DL_PRIME 0x7fe001
+#define DL_D 13
+#define DL_TD (23-DL_D)
+
+#define DL_ONE 0x3FFE00    // R mod Q
+#define DL_COMBO 0xA3FA    // ONE*inv mod Q
+#define DL_R2MODP 0x2419FF // R^2 mod Q
+#define DL_ND 0xFC7FDFFF   // 1/(R-Q) mod R
+
+#define DL_MAXLG 19
+#define DL_MAXK 8     // could reduce these if not using highest security
+#define DL_MAXL 7
+#define DL_YBYTES (((DL_MAXLG+1)*DL_DEGREE)/8)
+
+#define DL_SK_SIZE_2 (32*3+DL_DEGREE*(4*13+4*3+4*3)/8)
+#define DL_PK_SIZE_2 ((4*DL_DEGREE*DL_TD)/8+32)
+#define DL_SIG_SIZE_2 ((DL_DEGREE*4*(17+1))/8+80+4+32)
+
+#define DL_SK_SIZE_3 (32*3+DL_DEGREE*(6*13+5*4+6*4)/8)
+#define DL_PK_SIZE_3 ((6*DL_DEGREE*DL_TD)/8+32)
+#define DL_SIG_SIZE_3 ((DL_DEGREE*5*(19+1))/8+55+6+32)
+
+#define DL_SK_SIZE_5 (32*3+DL_DEGREE*(8*13+7*3+8*3)/8)
+#define DL_PK_SIZE_5 ((8*DL_DEGREE*DL_TD)/8+32)
+#define DL_SIG_SIZE_5 ((DL_DEGREE*7*(19+1))/8+75+8+32)
+
+
+namespace core {
+
+/** @brief Dilithium signature key pair generation
+ *
+    @param tau Random Numbers
+    @param SK secret key
+    @param PK public key
+
+ */
+extern void DLTHM_keypair_2(byte *tau,octet *SK,octet *PK);
+
+/** @brief Dilithium create signature on a message 
+ *
+    @param SK secret key
+    @param M the message to be signed
+    @param SIG the output signature
+    @return numbers of attempts needed to create signature
+
+ */
+extern int DLTHM_signature_2(octet *SK,octet *M, octet *SIG);
+
+/** @brief Dilithium verify signature on a message 
+ *
+    @param PK public key key
+    @param M the signed message
+    @param SIG the signature
+    @return true if signature is good, else false
+
+ */
+extern bool DLTHM_verify_2(octet *PK,octet *M,octet *SIG);
+
+
+/** @brief Dilithium signature key pair generation
+ *
+    @param tau Random Numbers
+    @param SK secret key
+    @param PK public key
+
+ */
+extern void DLTHM_keypair_3(byte *tau,octet *SK,octet *PK);
+
+/** @brief Dilithium create signature on a message 
+ *
+    @param SK secret key
+    @param M the message to be signed
+    @param SIG the output signature
+    @return numbers of attempts needed to create signature
+
+ */
+extern int DLTHM_signature_3(octet *SK,octet *M, octet *SIG);
+
+/** @brief Dilithium verify signature on a message 
+ *
+    @param PK public key key
+    @param M the signed message
+    @param SIG the signature
+    @return true if signature is good, else false
+
+ */
+extern bool DLTHM_verify_3(octet *PK,octet *M,octet *SIG);
+
+
+/** @brief Dilithium signature key pair generation
+ *
+    @param tau Random Numbers
+    @param SK secret key
+    @param PK public key
+
+ */
+extern void DLTHM_keypair_5(byte *tau,octet *SK,octet *PK);
+
+/** @brief Dilithium create signature on a message 
+ *
+    @param SK secret key
+    @param M the message to be signed
+    @param SIG the output signature
+    @return numbers of attempts needed to create signature
+
+ */
+extern int DLTHM_signature_5(octet *SK,octet *M, octet *SIG);
+
+/** @brief Dilithium verify signature on a message 
+ *
+    @param PK public key key
+    @param M the signed message
+    @param SIG the signature
+    @return true if signature is good, else false
+
+ */
+extern bool DLTHM_verify_5(octet *PK,octet *M,octet *SIG);
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh.cpp
new file mode 100644
index 0000000..dcba8b4
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh.cpp
@@ -0,0 +1,394 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* ECDH/ECIES/ECDSA API Functions */
+
+#include <stdio.h>
+#include <string.h>
+#include <stdlib.h>
+#include <time.h>
+
+#include "ecdh_ZZZ.h"
+
+using namespace XXX;
+using namespace YYY;
+
+#if CURVETYPE_ZZZ!=WEIERSTRASS
+// Process a random BIG r by RFC7748 (for Montgomery & Edwards curves only)
+static void RFC7748(BIG r)
+{
+    int c,lg=0;
+    BIG t;
+    c=ZZZ::CURVE_Cof_I;
+    while (c!=1)
+    {
+        lg++;
+        c/=2;
+    }
+    int n=8*EGS_ZZZ-lg+1;
+    BIG_mod2m(r,n);
+    BIG_zero(t); BIG_inc(t,1); BIG_shl(t,n);
+    BIG_add(r,r,t);
+    c=BIG_lastbits(r,lg);
+    BIG_dec(r,c);
+//    printf("lg= %d n=%d\n",lg,n);
+}
+#endif
+
+/* return 1 if S is in ranger 0 < S < order , else return 0 */
+int ZZZ::ECP_IN_RANGE(octet* S)
+{
+    BIG r,s;
+    BIG_rcopy(r, CURVE_Order);
+    BIG_fromBytes(s,S->val);
+    if (BIG_iszilch(s)) return 0;
+    if (BIG_comp(s,r)>=0) return 0;
+    return 1;
+}
+ 
+/* Calculate a public/private EC GF(p) key pair. W=S.G mod EC(p),
+ * where S is the secret key and W is the public key
+ * and G is fixed generator.
+ * If RNG is NULL then the private key is provided externally in S
+ * otherwise it is generated randomly internally */
+int ZZZ::ECP_KEY_PAIR_GENERATE(csprng *RNG, octet* S, octet *W)
+{
+    BIG r, gx, gy, s;
+    ECP G;
+    int res = 0;
+
+    ECP_generator(&G);
+    BIG_rcopy(r, CURVE_Order);
+
+    if (RNG != NULL)
+    {
+#if CURVETYPE_ZZZ!=WEIERSTRASS
+        BIG_random(s,RNG);          // from random bytes
+#else
+        BIG_randomnum(s, r, RNG);   // Removes biases
+#endif
+    }
+    else
+    {
+        BIG_fromBytes(s, S->val);
+    }
+
+#if CURVETYPE_ZZZ!=WEIERSTRASS
+    RFC7748(s);                     // For Montgomery or Edwards, apply RFC7748 transformation
+#endif
+    S->len = EGS_ZZZ;
+    BIG_toBytes(S->val, s);
+
+    ECP_clmul(&G, s, r);
+    ECP_toOctet(W, &G, false);      // To use point compression on public keys, change to true
+
+    return res;
+}
+
+/* Validate public key */
+int ZZZ::ECP_PUBLIC_KEY_VALIDATE(octet *W)
+{
+    BIG q, r, wx, k;
+    ECP WP;
+    int valid, nb;
+    int res = 0;
+
+    BIG_rcopy(q, Modulus);
+    BIG_rcopy(r, CURVE_Order);
+
+    valid = ECP_fromOctet(&WP, W);
+    if (!valid) res = ECDH_INVALID_PUBLIC_KEY;
+
+    if (res == 0)
+    {
+
+        nb = BIG_nbits(q);
+        BIG_one(k);
+        BIG_shl(k, (nb + 4) / 2);
+        BIG_add(k, q, k);
+        BIG_sdiv(k, r); /* get co-factor */
+        while (BIG_parity(k) == 0)
+        {
+            ECP_dbl(&WP);
+            BIG_fshr(k, 1);
+        }
+
+        if (!BIG_isunity(k)) ECP_mul(&WP, k);
+        if (ECP_isinf(&WP)) res = ECDH_INVALID_PUBLIC_KEY;
+    }
+
+    return res;
+}
+
+/* IEEE-1363 Diffie-Hellman online calculation Z=S.WD */
+// type = 0 is just x coordinate output
+// type = 1 for standard compressed output
+// type = 2 for standard uncompress output 04|x|y
+int ZZZ::ECP_SVDP_DH(octet *S, octet *WD, octet *Z,int type)
+{
+    BIG r, s, wx;
+    int valid;
+    ECP W;
+    int res = 0;
+
+    BIG_fromBytes(s, S->val);
+    valid = ECP_fromOctet(&W, WD);
+
+    if (!valid) res = ECDH_ERROR;
+    if (res == 0)
+    {
+        BIG_rcopy(r, CURVE_Order);
+        ECP_clmul(&W, s, r);
+        if (ECP_isinf(&W)) res = ECDH_ERROR;
+        else
+        {
+#if CURVETYPE_ZZZ!=MONTGOMERY
+            if (type>0)
+            {
+                if (type==1) ECP_toOctet(Z,&W,true);
+                else ECP_toOctet(Z,&W,false);
+                return res;
+            }
+            else
+                ECP_get(wx, wx, &W);
+#else
+            ECP_get(wx, &W);
+#endif
+        }
+        Z->len = EFS_ZZZ;
+        BIG_toBytes(Z->val, wx);
+    }
+    return res;
+}
+
+#if CURVETYPE_ZZZ!=MONTGOMERY
+
+/* IEEE ECDSA Signature, C and D are signature on F using private key S */
+int ZZZ::ECP_SP_DSA(int hlen, csprng *RNG, octet *K, octet *S, octet *F, octet *C, octet *D)
+{
+    char h[128];
+    octet H = {0, sizeof(h), h};
+
+    BIG r, s, f, c, d, u, vx, w;
+    ECP G, V;
+
+    SPhash(MC_SHA2, hlen, &H, F);
+
+    ECP_generator(&G);
+    BIG_rcopy(r, CURVE_Order);
+
+    BIG_fromBytes(s, S->val);
+
+    int blen = H.len;
+    if (H.len > EGS_ZZZ) blen = EGS_ZZZ;
+    BIG_fromBytesLen(f, H.val, blen);
+
+    if (RNG != NULL)
+    {
+        do
+        {
+            BIG_randomnum(u, r, RNG);
+            BIG_randomnum(w, r, RNG); /* IMPORTANT - side channel masking to protect invmodp() */
+
+            ECP_copy(&V, &G);
+            ECP_clmul(&V, u, r);
+
+            ECP_get(vx, vx, &V);
+
+            BIG_copy(c, vx);
+            BIG_mod(c, r);
+            if (BIG_iszilch(c)) continue;
+
+            BIG_modmul(u, u, w, r);
+
+            BIG_invmodp(u, u, r);
+            BIG_modmul(d, s, c, r);
+
+            BIG_modadd(d, f, d, r);
+            BIG_modmul(d, d, w, r);
+            BIG_modmul(d, u, d, r);
+
+        }
+        while (BIG_iszilch(d));
+    }
+    else
+    {
+        BIG_fromBytes(u, K->val);
+
+        ECP_copy(&V, &G);
+        ECP_clmul(&V, u, r);
+
+        ECP_get(vx, vx, &V);
+
+        BIG_copy(c, vx);
+        BIG_mod(c, r);
+        if (BIG_iszilch(c)) return ECDH_ERROR;
+
+        BIG_invmodp(u, u, r);
+        BIG_modmul(d, s, c, r);
+
+        BIG_modadd(d, f, d, r);
+        BIG_modmul(d, u, d, r);
+        if (BIG_iszilch(d)) return ECDH_ERROR;
+    }
+
+    C->len = D->len = EGS_ZZZ;
+
+    BIG_toBytes(C->val, c);
+    BIG_toBytes(D->val, d);
+
+    return 0;
+}
+
+/* IEEE1363 ECDSA Signature Verification. Signature C and D on F is verified using public key W */
+int ZZZ::ECP_VP_DSA(int hlen, octet *W, octet *F, octet *C, octet *D)
+{
+    char h[128];
+    octet H = {0, sizeof(h), h};
+
+    BIG r, wx, wy, f, c, d, h2;
+    int res = 0;
+    ECP G, WP;
+    int valid;
+
+    SPhash(MC_SHA2, hlen, &H, F);
+
+    ECP_generator(&G);
+    BIG_rcopy(r, CURVE_Order);
+
+    BIG_fromBytes(c, C->val);
+    BIG_fromBytes(d, D->val);
+
+    int blen = H.len;
+    if (blen > EGS_ZZZ) blen = EGS_ZZZ;
+
+    BIG_fromBytesLen(f, H.val, blen);
+
+    if (BIG_iszilch(c) || BIG_comp(c, r) >= 0 || BIG_iszilch(d) || BIG_comp(d, r) >= 0)
+        res = ECDH_ERROR;
+
+    if (res == 0)
+    {
+        BIG_invmodp(d, d, r);
+        BIG_modmul(f, f, d, r);
+        BIG_modmul(h2, c, d, r);
+
+        valid = ECP_fromOctet(&WP, W);
+        if (!valid) res = ECDH_ERROR;
+        else
+        {
+            ECP_mul2(&WP, &G, h2, f);
+            if (ECP_isinf(&WP)) res = ECDH_ERROR;
+            else
+            {
+                ECP_get(d, d, &WP);
+                BIG_mod(d, r);
+                if (BIG_comp(d, c) != 0) res = ECDH_ERROR;
+            }
+        }
+    }
+
+    return res;
+}
+
+/* IEEE1363 ECIES encryption. Encryption of plaintext M uses public key W and produces ciphertext V,C,T */
+void ZZZ::ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *RNG, octet *W, octet *M, int tlen, octet *V, octet *C, octet *T)
+{
+
+    int i, len;
+    char z[EFS_ZZZ], vz[3 * EFS_ZZZ + 1], k[2 * AESKEY_ZZZ], k1[AESKEY_ZZZ], k2[AESKEY_ZZZ], l2[8], u[EFS_ZZZ];
+    octet Z = {0, sizeof(z), z};
+    octet VZ = {0, sizeof(vz), vz};
+    octet K = {0, sizeof(k), k};
+    octet K1 = {0, sizeof(k1), k1};
+    octet K2 = {0, sizeof(k2), k2};
+    octet L2 = {0, sizeof(l2), l2};
+    octet U = {0, sizeof(u), u};
+
+    if (ECP_KEY_PAIR_GENERATE(RNG, &U, V) != 0) return;
+    if (ECP_SVDP_DH(&U, W, &Z,0) != 0) return;
+
+    OCT_copy(&VZ, V);
+    OCT_joctet(&VZ, &Z);
+
+    KDF2(MC_SHA2, hlen, &K, 2 * AESKEY_ZZZ, &VZ, P1);
+
+    K1.len = K2.len = AESKEY_ZZZ;
+    for (i = 0; i < AESKEY_ZZZ; i++)
+    {
+        K1.val[i] = K.val[i];
+        K2.val[i] = K.val[AESKEY_ZZZ + i];
+    }
+
+    AES_CBC_IV0_ENCRYPT(&K1, M, C);
+
+    OCT_jint(&L2, P2->len, 8);
+
+    len = C->len;
+    OCT_joctet(C, P2);
+    OCT_joctet(C, &L2);
+    HMAC(MC_SHA2, hlen, T, tlen, &K2, C);
+    C->len = len;
+}
+
+/* IEEE1363 ECIES decryption. Decryption of ciphertext V,C,T using private key U outputs plaintext M */
+int ZZZ::ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M)
+{
+
+    int i, len;
+    char z[EFS_ZZZ], vz[3 * EFS_ZZZ + 1], k[2 * AESKEY_ZZZ], k1[AESKEY_ZZZ], k2[AESKEY_ZZZ], l2[8], tag[32];
+    octet Z = {0, sizeof(z), z};
+    octet VZ = {0, sizeof(vz), vz};
+    octet K = {0, sizeof(k), k};
+    octet K1 = {0, sizeof(k1), k1};
+    octet K2 = {0, sizeof(k2), k2};
+    octet L2 = {0, sizeof(l2), l2};
+    octet TAG = {0, sizeof(tag), tag};
+
+    if (ECP_SVDP_DH(U, V, &Z,0) != 0) return 0;
+
+    OCT_copy(&VZ, V);
+    OCT_joctet(&VZ, &Z);
+
+    KDF2(MC_SHA2, hlen, &K, 2 * AESKEY_ZZZ, &VZ, P1);
+
+    K1.len = K2.len = AESKEY_ZZZ;
+    for (i = 0; i < AESKEY_ZZZ; i++)
+    {
+        K1.val[i] = K.val[i];
+        K2.val[i] = K.val[AESKEY_ZZZ + i];
+    }
+
+    if (!AES_CBC_IV0_DECRYPT(&K1, C, M)) return 0;
+
+    OCT_jint(&L2, P2->len, 8);
+
+    len = C->len;
+    OCT_joctet(C, P2);
+    OCT_joctet(C, &L2);
+    HMAC(MC_SHA2, hlen, &TAG, T->len, &K2, C);
+    C->len = len;
+
+    if (!OCT_ncomp(T, &TAG, T->len)) return 0;
+
+    return 1;
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh.h
new file mode 100644
index 0000000..9e1bad1
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_ZZZ_H
+#define ECDH_ZZZ_H
+
+#include "ecp_ZZZ.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_ZZZ MODBYTES_XXX  /**< ECC Group Size in bytes */
+#define EFS_ZZZ MODBYTES_XXX  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace ZZZ {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_ANSSI.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_ANSSI.h
new file mode 100644
index 0000000..53c64d9
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_ANSSI.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_ANSSI_H
+#define ECDH_ANSSI_H
+
+#include "ecp_ANSSI.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_ANSSI MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_ANSSI MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace ANSSI {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_BLS12381.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_BLS12381.h
new file mode 100644
index 0000000..a115148
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_BLS12381.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_BLS12381_H
+#define ECDH_BLS12381_H
+
+#include "ecp_BLS12381.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_BLS12381 MODBYTES_B384_58  /**< ECC Group Size in bytes */
+#define EFS_BLS12381 MODBYTES_B384_58  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace BLS12381 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_BLS12383.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_BLS12383.h
new file mode 100644
index 0000000..838aee2
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_BLS12383.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_BLS12383_H
+#define ECDH_BLS12383_H
+
+#include "ecp_BLS12383.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_BLS12383 MODBYTES_B384_58  /**< ECC Group Size in bytes */
+#define EFS_BLS12383 MODBYTES_B384_58  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace BLS12383 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_BLS12443.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_BLS12443.h
new file mode 100644
index 0000000..b274db0
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_BLS12443.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_BLS12443_H
+#define ECDH_BLS12443_H
+
+#include "ecp_BLS12443.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_BLS12443 MODBYTES_B448_60  /**< ECC Group Size in bytes */
+#define EFS_BLS12443 MODBYTES_B448_60  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace BLS12443 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_BLS12461.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_BLS12461.h
new file mode 100644
index 0000000..6bd3804
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_BLS12461.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_BLS12461_H
+#define ECDH_BLS12461_H
+
+#include "ecp_BLS12461.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_BLS12461 MODBYTES_B464_60  /**< ECC Group Size in bytes */
+#define EFS_BLS12461 MODBYTES_B464_60  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace BLS12461 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_BLS24479.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_BLS24479.h
new file mode 100644
index 0000000..b889779
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_BLS24479.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_BLS24479_H
+#define ECDH_BLS24479_H
+
+#include "ecp_BLS24479.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_BLS24479 MODBYTES_B480_56  /**< ECC Group Size in bytes */
+#define EFS_BLS24479 MODBYTES_B480_56  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace BLS24479 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_BLS48286.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_BLS48286.h
new file mode 100644
index 0000000..5505bca
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_BLS48286.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_BLS48286_H
+#define ECDH_BLS48286_H
+
+#include "ecp_BLS48286.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_BLS48286 MODBYTES_B288_60  /**< ECC Group Size in bytes */
+#define EFS_BLS48286 MODBYTES_B288_60  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace BLS48286 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_BLS48556.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_BLS48556.h
new file mode 100644
index 0000000..625a80a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_BLS48556.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_BLS48556_H
+#define ECDH_BLS48556_H
+
+#include "ecp_BLS48556.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_BLS48556 MODBYTES_B560_58  /**< ECC Group Size in bytes */
+#define EFS_BLS48556 MODBYTES_B560_58  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace BLS48556 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_BLS48581.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_BLS48581.h
new file mode 100644
index 0000000..87f3972
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_BLS48581.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_BLS48581_H
+#define ECDH_BLS48581_H
+
+#include "ecp_BLS48581.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_BLS48581 MODBYTES_B584_60  /**< ECC Group Size in bytes */
+#define EFS_BLS48581 MODBYTES_B584_60  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace BLS48581 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_BN158.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_BN158.h
new file mode 100644
index 0000000..ddcba94
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_BN158.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_BN158_H
+#define ECDH_BN158_H
+
+#include "ecp_BN158.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_BN158 MODBYTES_B160_56  /**< ECC Group Size in bytes */
+#define EFS_BN158 MODBYTES_B160_56  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace BN158 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_BN254.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_BN254.h
new file mode 100644
index 0000000..6c86d75
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_BN254.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_BN254_H
+#define ECDH_BN254_H
+
+#include "ecp_BN254.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_BN254 MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_BN254 MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace BN254 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_BN254CX.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_BN254CX.h
new file mode 100644
index 0000000..08c88a2
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_BN254CX.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_BN254CX_H
+#define ECDH_BN254CX_H
+
+#include "ecp_BN254CX.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_BN254CX MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_BN254CX MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace BN254CX {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_BN462.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_BN462.h
new file mode 100644
index 0000000..c54dcdf
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_BN462.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_BN462_H
+#define ECDH_BN462_H
+
+#include "ecp_BN462.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_BN462 MODBYTES_B464_60  /**< ECC Group Size in bytes */
+#define EFS_BN462 MODBYTES_B464_60  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace BN462 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_BRAINPOOL.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_BRAINPOOL.h
new file mode 100644
index 0000000..7e7fdc8
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_BRAINPOOL.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_BRAINPOOL_H
+#define ECDH_BRAINPOOL_H
+
+#include "ecp_BRAINPOOL.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_BRAINPOOL MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_BRAINPOOL MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace BRAINPOOL {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_C1174.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_C1174.h
new file mode 100644
index 0000000..29386f2
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_C1174.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_C1174_H
+#define ECDH_C1174_H
+
+#include "ecp_C1174.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_C1174 MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_C1174 MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace C1174 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_C13318.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_C13318.h
new file mode 100644
index 0000000..fd60112
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_C13318.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_C13318_H
+#define ECDH_C13318_H
+
+#include "ecp_C13318.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_C13318 MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_C13318 MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace C13318 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_C1665.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_C1665.h
new file mode 100644
index 0000000..bd74dc9
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_C1665.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_C1665_H
+#define ECDH_C1665_H
+
+#include "ecp_C1665.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_C1665 MODBYTES_B168_60  /**< ECC Group Size in bytes */
+#define EFS_C1665 MODBYTES_B168_60  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace C1665 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_C25519.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_C25519.h
new file mode 100644
index 0000000..f4bc2a2
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_C25519.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_C25519_H
+#define ECDH_C25519_H
+
+#include "ecp_C25519.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_C25519 MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_C25519 MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace C25519 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_C41417.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_C41417.h
new file mode 100644
index 0000000..d7ba0ab
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_C41417.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_C41417_H
+#define ECDH_C41417_H
+
+#include "ecp_C41417.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_C41417 MODBYTES_B416_60  /**< ECC Group Size in bytes */
+#define EFS_C41417 MODBYTES_B416_60  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace C41417 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_Ed25519.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_Ed25519.h
new file mode 100644
index 0000000..b5dcd9e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_Ed25519.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_Ed25519_H
+#define ECDH_Ed25519_H
+
+#include "ecp_Ed25519.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_Ed25519 MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_Ed25519 MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace Ed25519 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_Ed448.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_Ed448.h
new file mode 100644
index 0000000..e18a67d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_Ed448.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_Ed448_H
+#define ECDH_Ed448_H
+
+#include "ecp_Ed448.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_Ed448 MODBYTES_B448_58  /**< ECC Group Size in bytes */
+#define EFS_Ed448 MODBYTES_B448_58  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace Ed448 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_FP256BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_FP256BN.h
new file mode 100644
index 0000000..5667ae1
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_FP256BN.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_FP256BN_H
+#define ECDH_FP256BN_H
+
+#include "ecp_FP256BN.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_FP256BN MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_FP256BN MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace FP256BN {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_FP512BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_FP512BN.h
new file mode 100644
index 0000000..9d05890
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_FP512BN.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_FP512BN_H
+#define ECDH_FP512BN_H
+
+#include "ecp_FP512BN.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_FP512BN MODBYTES_B512_60  /**< ECC Group Size in bytes */
+#define EFS_FP512BN MODBYTES_B512_60  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace FP512BN {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_HIFIVE.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_HIFIVE.h
new file mode 100644
index 0000000..cfbb6eb
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_HIFIVE.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_HIFIVE_H
+#define ECDH_HIFIVE_H
+
+#include "ecp_HIFIVE.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_HIFIVE MODBYTES_B336_60  /**< ECC Group Size in bytes */
+#define EFS_HIFIVE MODBYTES_B336_60  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace HIFIVE {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_JUBJUB.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_JUBJUB.h
new file mode 100644
index 0000000..8942a38
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_JUBJUB.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_JUBJUB_H
+#define ECDH_JUBJUB_H
+
+#include "ecp_JUBJUB.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_JUBJUB MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_JUBJUB MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace JUBJUB {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_MDC.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_MDC.h
new file mode 100644
index 0000000..0eca124
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_MDC.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_MDC_H
+#define ECDH_MDC_H
+
+#include "ecp_MDC.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_MDC MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_MDC MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace MDC {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_NIST256.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_NIST256.h
new file mode 100644
index 0000000..bd35741
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_NIST256.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_NIST256_H
+#define ECDH_NIST256_H
+
+#include "ecp_NIST256.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_NIST256 MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_NIST256 MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace NIST256 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_NIST384.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_NIST384.h
new file mode 100644
index 0000000..4855851
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_NIST384.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_NIST384_H
+#define ECDH_NIST384_H
+
+#include "ecp_NIST384.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_NIST384 MODBYTES_B384_56  /**< ECC Group Size in bytes */
+#define EFS_NIST384 MODBYTES_B384_56  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace NIST384 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_NIST521.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_NIST521.h
new file mode 100644
index 0000000..fdfb94c
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_NIST521.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_NIST521_H
+#define ECDH_NIST521_H
+
+#include "ecp_NIST521.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_NIST521 MODBYTES_B528_60  /**< ECC Group Size in bytes */
+#define EFS_NIST521 MODBYTES_B528_60  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace NIST521 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_NUMS256E.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_NUMS256E.h
new file mode 100644
index 0000000..c0b0e30
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_NUMS256E.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_NUMS256E_H
+#define ECDH_NUMS256E_H
+
+#include "ecp_NUMS256E.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_NUMS256E MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_NUMS256E MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace NUMS256E {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_NUMS256W.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_NUMS256W.h
new file mode 100644
index 0000000..5049996
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_NUMS256W.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_NUMS256W_H
+#define ECDH_NUMS256W_H
+
+#include "ecp_NUMS256W.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_NUMS256W MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_NUMS256W MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace NUMS256W {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_NUMS384E.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_NUMS384E.h
new file mode 100644
index 0000000..bab56d8
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_NUMS384E.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_NUMS384E_H
+#define ECDH_NUMS384E_H
+
+#include "ecp_NUMS384E.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_NUMS384E MODBYTES_B384_58  /**< ECC Group Size in bytes */
+#define EFS_NUMS384E MODBYTES_B384_58  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace NUMS384E {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_NUMS384W.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_NUMS384W.h
new file mode 100644
index 0000000..fc360dc
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_NUMS384W.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_NUMS384W_H
+#define ECDH_NUMS384W_H
+
+#include "ecp_NUMS384W.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_NUMS384W MODBYTES_B384_58  /**< ECC Group Size in bytes */
+#define EFS_NUMS384W MODBYTES_B384_58  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace NUMS384W {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_NUMS512E.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_NUMS512E.h
new file mode 100644
index 0000000..61da8c2
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_NUMS512E.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_NUMS512E_H
+#define ECDH_NUMS512E_H
+
+#include "ecp_NUMS512E.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_NUMS512E MODBYTES_B512_60  /**< ECC Group Size in bytes */
+#define EFS_NUMS512E MODBYTES_B512_60  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace NUMS512E {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_NUMS512W.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_NUMS512W.h
new file mode 100644
index 0000000..685b0bf
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_NUMS512W.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_NUMS512W_H
+#define ECDH_NUMS512W_H
+
+#include "ecp_NUMS512W.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_NUMS512W MODBYTES_B512_60  /**< ECC Group Size in bytes */
+#define EFS_NUMS512W MODBYTES_B512_60  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace NUMS512W {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_SECP160R1.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_SECP160R1.h
new file mode 100644
index 0000000..ad71565
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_SECP160R1.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_SECP160R1_H
+#define ECDH_SECP160R1_H
+
+#include "ecp_SECP160R1.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_SECP160R1 MODBYTES_B160_56  /**< ECC Group Size in bytes */
+#define EFS_SECP160R1 MODBYTES_B160_56  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace SECP160R1 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_SECP256K1.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_SECP256K1.h
new file mode 100644
index 0000000..17a8e9c
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_SECP256K1.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_SECP256K1_H
+#define ECDH_SECP256K1_H
+
+#include "ecp_SECP256K1.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_SECP256K1 MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_SECP256K1 MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace SECP256K1 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_SM2.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_SM2.h
new file mode 100644
index 0000000..bf8fa02
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_SM2.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_SM2_H
+#define ECDH_SM2_H
+
+#include "ecp_SM2.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_SM2 MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_SM2 MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace SM2 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_TWEEDLEDEE.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_TWEEDLEDEE.h
new file mode 100644
index 0000000..efe1212
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_TWEEDLEDEE.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_TWEEDLEDEE_H
+#define ECDH_TWEEDLEDEE_H
+
+#include "ecp_TWEEDLEDEE.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_TWEEDLEDEE MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_TWEEDLEDEE MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace TWEEDLEDEE {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_TWEEDLEDUM.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_TWEEDLEDUM.h
new file mode 100644
index 0000000..d75dc9d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_TWEEDLEDUM.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_TWEEDLEDUM_H
+#define ECDH_TWEEDLEDUM_H
+
+#include "ecp_TWEEDLEDUM.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_TWEEDLEDUM MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_TWEEDLEDUM MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace TWEEDLEDUM {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_X448.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_X448.h
new file mode 100644
index 0000000..e171dc5
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecdh_X448.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_X448_H
+#define ECDH_X448_H
+
+#include "ecp_X448.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_X448 MODBYTES_B448_58  /**< ECC Group Size in bytes */
+#define EFS_X448 MODBYTES_B448_58  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace X448 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp.cpp
new file mode 100644
index 0000000..1ea8a2d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp.cpp
@@ -0,0 +1,1798 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* CORE Elliptic Curve Functions */
+/* SU=m, SU is Stack Usage (Weierstrass Curves) */
+
+//#define HAS_MAIN
+
+#include "ecp_ZZZ.h"
+
+using namespace XXX;
+using namespace YYY;
+
+/* test for P=O point-at-infinity */
+int ZZZ::ECP_isinf(ECP *P)
+{
+
+#if CURVETYPE_ZZZ==EDWARDS
+    return (FP_iszilch(&(P->x)) && FP_equals(&(P->y), &(P->z)));
+#endif
+#if CURVETYPE_ZZZ==WEIERSTRASS
+    return (FP_iszilch(&(P->x)) && FP_iszilch(&(P->z)));
+#endif
+#if CURVETYPE_ZZZ==MONTGOMERY
+    return FP_iszilch(&(P->z));
+#endif
+
+}
+
+/* Conditional swap of P and Q dependant on d */
+static void ECP_cswap(ZZZ::ECP *P, ZZZ::ECP *Q, int d)
+{
+    FP_cswap(&(P->x), &(Q->x), d);
+#if CURVETYPE_ZZZ!=MONTGOMERY
+    FP_cswap(&(P->y), &(Q->y), d);
+#endif
+    FP_cswap(&(P->z), &(Q->z), d);
+
+}
+
+#if CURVETYPE_ZZZ!=MONTGOMERY
+/* Conditional move Q to P dependant on d */
+static void ECP_cmove(ZZZ::ECP *P, ZZZ::ECP *Q, int d)
+{
+    FP_cmove(&(P->x), &(Q->x), d);
+#if CURVETYPE_ZZZ!=MONTGOMERY
+    FP_cmove(&(P->y), &(Q->y), d);
+#endif
+    FP_cmove(&(P->z), &(Q->z), d);
+
+}
+
+/* return 1 if b==c, no branching */
+static int teq(sign32 b, sign32 c)
+{
+    sign32 x = b ^ c;
+    x -= 1; // if x=0, x now -1
+    return (int)((x >> 31) & 1);
+}
+#endif // CURVETYPE_ZZZ!=MONTGOMERY
+
+#if CURVETYPE_ZZZ!=MONTGOMERY
+/* Constant time select from pre-computed table */
+static void ECP_select(ZZZ::ECP *P, ZZZ::ECP W[], sign32 b)
+{
+    ZZZ::ECP MP;
+    sign32 m = b >> 31;
+    sign32 babs = (b ^ m) - m;
+
+    babs = (babs - 1) / 2;
+
+    ECP_cmove(P, &W[0], teq(babs, 0)); // conditional move
+    ECP_cmove(P, &W[1], teq(babs, 1));
+    ECP_cmove(P, &W[2], teq(babs, 2));
+    ECP_cmove(P, &W[3], teq(babs, 3));
+    ECP_cmove(P, &W[4], teq(babs, 4));
+    ECP_cmove(P, &W[5], teq(babs, 5));
+    ECP_cmove(P, &W[6], teq(babs, 6));
+    ECP_cmove(P, &W[7], teq(babs, 7));
+
+    ECP_copy(&MP, P);
+    ECP_neg(&MP);  // minus P
+    ECP_cmove(P, &MP, (int)(m & 1));
+}
+#endif
+
+/* Test P == Q */
+/* SU=168 */
+int ZZZ::ECP_equals(ECP *P, ECP *Q)
+{
+    FP a, b;
+    FP_mul(&a, &(P->x), &(Q->z));
+    FP_mul(&b, &(Q->x), &(P->z));
+    if (!FP_equals(&a, &b)) return 0;
+
+#if CURVETYPE_ZZZ!=MONTGOMERY
+    FP_mul(&a, &(P->y), &(Q->z));
+    FP_mul(&b, &(Q->y), &(P->z));
+    if (!FP_equals(&a, &b)) return 0;
+#endif
+
+    return 1;
+}
+
+/* Set P=Q */
+/* SU=16 */
+void ZZZ::ECP_copy(ECP *P, ECP *Q)
+{
+    FP_copy(&(P->x), &(Q->x));
+#if CURVETYPE_ZZZ!=MONTGOMERY
+    FP_copy(&(P->y), &(Q->y));
+#endif
+    FP_copy(&(P->z), &(Q->z));
+}
+
+/* Set P=-Q */
+#if CURVETYPE_ZZZ!=MONTGOMERY
+/* SU=8 */
+void ZZZ::ECP_neg(ECP *P)
+{
+#if CURVETYPE_ZZZ==WEIERSTRASS
+    FP_neg(&(P->y), &(P->y));
+    FP_norm(&(P->y));
+#else
+    FP_neg(&(P->x), &(P->x));
+    FP_norm(&(P->x));
+#endif
+
+}
+#endif
+
+/* Set P=O */
+void ZZZ::ECP_inf(ECP *P)
+{
+    FP_zero(&(P->x));
+#if CURVETYPE_ZZZ!=MONTGOMERY
+    FP_one(&(P->y));
+#endif
+#if CURVETYPE_ZZZ!=EDWARDS
+    FP_zero(&(P->z));
+#else
+    FP_one(&(P->z));
+#endif
+}
+
+/* Calculate right Hand Side of curve equation y^2=RHS */
+/* SU=56 */
+void ZZZ::ECP_rhs(FP *v, FP *x)
+{
+#if CURVETYPE_ZZZ==WEIERSTRASS
+    /* x^3+Ax+B */
+    FP t;
+    FP_sqr(&t, x);
+    FP_mul(&t, &t, x);
+
+#if CURVE_A_ZZZ == -3    
+
+    FP_neg(v, x);
+    FP_norm(v);
+    FP_imul(v, v, -CURVE_A_ZZZ);
+    FP_norm(v);
+    FP_add(v, &t, v);
+#else
+    FP_copy(v, &t);
+#endif
+    FP_rcopy(&t, CURVE_B);
+
+    FP_add(v, &t, v);
+    FP_reduce(v);
+#endif
+
+#if CURVETYPE_ZZZ==EDWARDS
+    /* (Ax^2-1)/(Bx^2-1) */
+    FP t, one;
+    FP_sqr(v, x);
+    FP_one(&one);
+    FP_rcopy(&t, CURVE_B);
+
+    FP_mul(&t, v, &t);
+    FP_sub(&t, &t, &one);
+    FP_norm(&t);
+#if CURVE_A_ZZZ == 1
+    FP_sub(v, v, &one);
+#endif
+#if CURVE_A_ZZZ == -1
+    FP_add(v, v, &one);
+    FP_norm(v);
+    FP_neg(v, v);
+#endif
+    FP_norm(v);
+    FP_inv(&t, &t, NULL);
+    FP_mul(v, v, &t);
+    FP_reduce(v);
+#endif
+
+#if CURVETYPE_ZZZ==MONTGOMERY
+    /* x^3+Ax^2+x */
+    FP x2, x3;
+    FP_sqr(&x2, x);
+    FP_mul(&x3, &x2, x);
+    FP_copy(v, x);
+    FP_imul(&x2, &x2, CURVE_A_ZZZ);
+    FP_add(v, v, &x2);
+    FP_add(v, v, &x3);
+    FP_reduce(v);
+#endif
+}
+
+/* Set P=(x,y) */
+
+#if CURVETYPE_ZZZ==MONTGOMERY
+
+/* Set P=(x,{y}) */
+
+int ZZZ::ECP_set(ECP *P, BIG x)
+{
+    FP rhs;
+    FP_nres(&rhs, x);
+
+    ECP_rhs(&rhs, &rhs);
+
+    if (!FP_qr(&rhs,NULL))
+    {
+        ECP_inf(P);
+        return 0;
+    }
+
+    FP_nres(&(P->x), x);
+    FP_one(&(P->z));
+    return 1;
+}
+
+/* Extract x coordinate as BIG */
+int ZZZ::ECP_get(BIG x, ECP *P)
+{
+    ECP W;
+    ECP_copy(&W, P);
+    ECP_affine(&W);
+    if (ECP_isinf(&W)) return -1;
+    FP_redc(x, &(W.x));
+    return 0;
+}
+
+
+#else
+/* Extract (x,y) and return sign of y. If x and y are the same return only x */
+/* SU=16 */
+int ZZZ::ECP_get(BIG x, BIG y, ECP *P)
+{
+    ECP W;
+    ECP_copy(&W, P);
+    ECP_affine(&W);
+    if (ECP_isinf(&W)) return -1;
+    FP_redc(y, &(W.y));
+    FP_redc(x, &(W.x));
+    return FP_sign(&(W.y));
+}
+
+/* Set P=(x,{y}) */
+/* SU=96 */
+int ZZZ::ECP_set(ECP *P, BIG x, BIG y)
+{
+    FP rhs, y2;
+
+    FP_nres(&y2, y);
+    FP_sqr(&y2, &y2);
+    FP_reduce(&y2);
+
+    FP_nres(&rhs, x);
+    ECP_rhs(&rhs, &rhs);
+
+    if (!FP_equals(&y2, &rhs))
+    {
+        ECP_inf(P);
+        return 0;
+    }
+
+    FP_nres(&(P->x), x);
+    FP_nres(&(P->y), y);
+    FP_one(&(P->z));
+    return 1;
+}
+
+/* Set P=(x,y), where y is calculated from x with sign s */
+/* SU=136 */
+int ZZZ::ECP_setx(ECP *P, BIG x, int s)
+{
+    FP rhs,hint;
+    FP_nres(&rhs, x);
+
+    ECP_rhs(&rhs, &rhs);
+
+    if (!FP_qr(&rhs,&hint))
+    {
+        ECP_inf(P);
+        return 0;
+    }
+
+    FP_nres(&(P->x), x);
+    FP_sqrt(&(P->y), &rhs, &hint);
+
+    if (FP_sign(&(P->y))!=s)
+        FP_neg(&(P->y), &(P->y));
+    FP_reduce(&(P->y));
+    FP_one(&(P->z));
+    return 1;
+}
+
+#endif
+
+/* Convert P to Affine, from (x,y,z) to (x,y) */
+/* SU=160 */
+void ZZZ::ECP_affine(ECP *P)
+{
+    FP one, iz;
+    if (ECP_isinf(P)) return;
+    FP_one(&one);
+    if (FP_equals(&(P->z), &one)) return;
+
+    FP_inv(&iz, &(P->z), NULL);
+    FP_mul(&(P->x), &(P->x), &iz);
+
+#if CURVETYPE_ZZZ==EDWARDS || CURVETYPE_ZZZ==WEIERSTRASS
+
+    FP_mul(&(P->y), &(P->y), &iz);
+    FP_reduce(&(P->y));
+
+#endif
+
+    FP_reduce(&(P->x));
+    FP_copy(&(P->z), &one);
+}
+
+/* SU=120 */
+void ZZZ::ECP_outputxyz(ECP *P)
+{
+    BIG x, z;
+    if (ECP_isinf(P))
+    {
+        printf("Infinity\n");
+        return;
+    }
+    FP_reduce(&(P->x));
+    FP_redc(x, &(P->x));
+    FP_reduce(&(P->z));
+    FP_redc(z, &(P->z));
+
+#if CURVETYPE_ZZZ!=MONTGOMERY
+    BIG y;
+    FP_reduce(&(P->y));
+    FP_redc(y, &(P->y));
+    printf("(");
+    BIG_output(x);
+    printf(",");
+    BIG_output(y);
+    printf(",");
+    BIG_output(z);
+    printf(")\n");
+
+#else
+    printf("(");
+    BIG_output(x);
+    printf(",");
+    BIG_output(z);
+    printf(")\n");
+#endif
+}
+
+/* SU=16 */
+/* Output point P */
+void ZZZ::ECP_output(ECP *P)
+{
+    BIG x, y;
+    if (ECP_isinf(P))
+    {
+        printf("Infinity\n");
+        return;
+    }
+    ECP_affine(P);
+#if CURVETYPE_ZZZ!=MONTGOMERY
+    FP_reduce(&(P->x));
+    FP_reduce(&(P->y));
+    FP_redc(x, &(P->x));
+    FP_redc(y, &(P->y));
+    printf("(");
+    BIG_output(x);
+    printf(",");
+    BIG_output(y);
+    printf(")\n");
+#else
+    FP_reduce(&(P->x));
+    FP_redc(x, &(P->x));
+    printf("(");
+    BIG_output(x);
+    printf(")\n");
+#endif
+}
+
+/* SU=16 */
+/* Output point P */
+void ZZZ::ECP_rawoutput(ECP *P)
+{
+    BIG x, y, z;
+
+#if CURVETYPE_ZZZ!=MONTGOMERY
+    FP_redc(x, &(P->x));
+    FP_redc(y, &(P->y));
+    FP_redc(z, &(P->z));
+    printf("(");
+    BIG_output(x);
+    printf(",");
+    BIG_output(y);
+    printf(",");
+    BIG_output(z);
+    printf(")\n");
+#else
+    FP_redc(x, &(P->x));
+    FP_redc(z, &(P->z));
+    printf("(");
+    BIG_output(x);
+    printf(",");
+    BIG_output(z);
+    printf(")\n");
+#endif
+}
+
+/* SU=88 */
+/* Convert P to octet string, compressing if desired */
+void ZZZ::ECP_toOctet(octet *W, ECP *P, bool compress)
+{
+#if CURVETYPE_ZZZ==MONTGOMERY
+    BIG x;
+    ECP_get(x, P);
+    W->len = MODBYTES_XXX; // + 1;
+    BIG_toBytes(&(W->val[0]), x);
+#else
+    BIG x, y;
+    bool alt=false;
+    ECP_affine(P);
+    ECP_get(x, y, P);
+
+#if (MBITS-1)%8 <= 4
+#ifdef ALLOW_ALT_COMPRESS_ZZZ
+    alt=true;
+#endif
+#endif
+
+    if (alt)
+    {
+        BIG_toBytes(&(W->val[0]), x);
+        if (compress)
+        {
+            W->len = MODBYTES_XXX;
+            W->val[0]|=0x80;
+            if (FP_islarger(&(P->y))==1) W->val[0]|=0x20;
+        } else {
+            W->len = 2 * MODBYTES_XXX;
+            BIG_toBytes(&(W->val[MODBYTES_XXX]), y);
+        }
+    } else {
+        BIG_toBytes(&(W->val[1]), x);
+        if (compress)
+        {
+            W->val[0] = 0x02;
+            if (FP_sign(&(P->y)) == 1) W->val[0] = 0x03;
+            W->len = MODBYTES_XXX + 1;
+        } else {
+            W->val[0] = 0x04;
+            W->len = 2 * MODBYTES_XXX + 1;
+            BIG_toBytes(&(W->val[MODBYTES_XXX + 1]), y);
+        }
+    }
+#endif
+}
+
+/* SU=88 */
+/* Restore P from octet string */
+int ZZZ::ECP_fromOctet(ECP *P, octet *W)
+{
+#if CURVETYPE_ZZZ==MONTGOMERY
+    BIG x;
+    BIG_fromBytes(x, &(W->val[0]));
+    if (ECP_set(P, x)) return 1;
+    return 0;
+#else
+    BIG x, y;
+    bool alt=false;
+    int sgn,cmp,typ = W->val[0];
+
+#if (MBITS-1)%8 <= 4
+#ifdef ALLOW_ALT_COMPRESS_ZZZ
+    alt=true;
+#endif
+#endif
+
+    if (alt)
+    {
+        W->val[0]&=0x1f;
+        BIG_fromBytes(x, &(W->val[0]));
+        W->val[0]=typ;
+        if ((typ&0x80)==0)
+        {
+            BIG_fromBytes(y, &(W->val[MODBYTES_XXX]));
+            if (ECP_set(P, x, y)) return 1;
+            return 0;
+        } else {
+            if (!ECP_setx(P,x,0)) return 0;
+            sgn=(typ&0x20)>>5;
+            cmp=FP_islarger(&(P->y));
+            if ((sgn==1 && cmp!=1) || (sgn==0 && cmp==1)) ECP_neg(P);
+            return 1;
+        }
+
+    } else {
+        BIG_fromBytes(x, &(W->val[1]));
+        if (typ == 0x04)
+        {
+            BIG_fromBytes(y, &(W->val[MODBYTES_XXX + 1]));
+            if (ECP_set(P, x, y)) return 1;
+        }
+        if (typ == 0x02 || typ == 0x03)
+        {
+            if (ECP_setx(P, x, typ & 1)) return 1;
+        }
+    }
+    return 0;
+#endif
+}
+
+
+/* Set P=2P */
+/* SU=272 */
+void ZZZ::ECP_dbl(ECP *P)
+{
+#if CURVETYPE_ZZZ==WEIERSTRASS
+    FP t0, t1, t2, t3, x3, y3, z3, b;
+
+#if CURVE_A_ZZZ == 0
+
+        FP_sqr(&t0, &(P->y));                   //t0.sqr();
+        FP_mul(&t1, &(P->y), &(P->z));          //t1.mul(z);
+
+        FP_sqr(&t2, &(P->z));                   //t2.sqr();
+
+        FP_add(&(P->z), &t0, &t0);          //z.add(t0);
+        FP_norm(&(P->z));                   //z.norm();
+        FP_add(&(P->z), &(P->z), &(P->z));  //z.add(z);
+        FP_add(&(P->z), &(P->z), &(P->z));  //z.add(z);
+        FP_norm(&(P->z));                   //z.norm();
+
+        FP_imul(&t2, &t2, 3 * CURVE_B_I);   //t2.imul(3*ROM.CURVE_B_I);
+        FP_mul(&x3, &t2, &(P->z));          //x3.mul(z);
+
+        FP_add(&y3, &t0, &t2);              //y3.add(t2);
+        FP_norm(&y3);                       //y3.norm();
+        FP_mul(&(P->z), &(P->z), &t1);      //z.mul(t1);
+
+        FP_add(&t1, &t2, &t2);              //t1.add(t2);
+        FP_add(&t2, &t2, &t1);              //t2.add(t1);
+        FP_sub(&t0, &t0, &t2);              //t0.sub(t2);
+        FP_norm(&t0);                       //t0.norm();
+        FP_mul(&y3, &y3, &t0);              //y3.mul(t0);
+        FP_add(&y3, &y3, &x3);              //y3.add(x3);
+
+        FP_mul(&t1, &(P->x), &(P->y));          //t1.mul(y);
+        FP_norm(&t0);                   //x.norm();
+        FP_mul(&(P->x), &t0, &t1);      //x.mul(t1);
+        FP_add(&(P->x), &(P->x), &(P->x));  //x.add(x);
+        FP_norm(&(P->x));                   //x.norm();
+        FP_copy(&(P->y), &y3);              //y.copy(y3);
+        FP_norm(&(P->y));                   //y.norm();
+#else
+
+        if (CURVE_B_I == 0)                 //if (ROM.CURVE_B_I==0)
+            FP_rcopy(&b, CURVE_B);          //b.copy(new FP(new BIG(ROM.CURVE_B)));
+
+        FP_sqr(&t0, &(P->x));                   //t0.sqr();  //1    x^2
+        FP_sqr(&t1, &(P->y));                   //t1.sqr();  //2    y^2
+        FP_sqr(&t2, &(P->z));                   //t2.sqr();  //3
+
+        FP_mul(&t3, &(P->x), &(P->y));          //t3.mul(y); //4
+        FP_add(&t3, &t3, &t3);              //t3.add(t3);
+        FP_norm(&t3);                       //t3.norm();//5
+
+        FP_mul(&z3, &(P->z), &(P->x));          //z3.mul(x);   //6
+        FP_add(&z3, &z3, &z3);              //z3.add(z3);
+        FP_norm(&z3);                       //z3.norm();//7
+
+        if (CURVE_B_I == 0)                     //if (ROM.CURVE_B_I==0)
+            FP_mul(&y3, &t2, &b);           //y3.mul(b); //8
+        else
+            FP_imul(&y3, &t2, CURVE_B_I);   //y3.imul(ROM.CURVE_B_I);
+
+        FP_sub(&y3, &y3, &z3);              //y3.sub(z3); //y3.norm(); //9  ***
+        FP_add(&x3, &y3, &y3);              //x3.add(y3);
+        FP_norm(&x3);                       //x3.norm();//10
+
+        FP_add(&y3, &y3, &x3);              //y3.add(x3); //y3.norm();//11
+        FP_sub(&x3, &t1, &y3);              //x3.sub(y3);
+        FP_norm(&x3);                       //x3.norm();//12
+        FP_add(&y3, &y3, &t1);              //y3.add(t1);
+        FP_norm(&y3);                       //y3.norm();//13
+        FP_mul(&y3, &y3, &x3);              //y3.mul(x3); //14
+        FP_mul(&x3, &x3, &t3);              //x3.mul(t3); //15
+        FP_add(&t3, &t2, &t2);              //t3.add(t2);  //16
+        FP_add(&t2, &t2, &t3);              //t2.add(t3); //17
+
+        if (CURVE_B_I == 0)                 //if (ROM.CURVE_B_I==0)
+            FP_mul(&z3, &z3, &b);           //z3.mul(b); //18
+        else
+            FP_imul(&z3, &z3, CURVE_B_I); //z3.imul(ROM.CURVE_B_I);
+
+        FP_sub(&z3, &z3, &t2);              //z3.sub(t2); //z3.norm();//19
+        FP_sub(&z3, &z3, &t0);              //z3.sub(t0);
+        FP_norm(&z3);                       //z3.norm();//20  ***
+        FP_add(&t3, &z3, &z3);              //t3.add(z3); //t3.norm();//21
+
+        FP_add(&z3, &z3, &t3);              //z3.add(t3);
+        FP_norm(&z3);                       //z3.norm(); //22
+        FP_add(&t3, &t0, &t0);              //t3.add(t0); //t3.norm(); //23
+        FP_add(&t0, &t0, &t3);              //t0.add(t3); //t0.norm();//24
+        FP_sub(&t0, &t0, &t2);              //t0.sub(t2);
+        FP_norm(&t0);                       //t0.norm();//25
+
+        FP_mul(&t0, &t0, &z3);              //t0.mul(z3);//26
+        FP_add(&y3, &y3, &t0);              //y3.add(t0); //y3.norm();//27
+        FP_mul(&t0, &(P->y), &(P->z));          //t0.mul(z);//28
+        FP_add(&t0, &t0, &t0);              //t0.add(t0);
+        FP_norm(&t0);                       //t0.norm(); //29
+        FP_mul(&z3, &z3, &t0);              //z3.mul(t0);//30
+        FP_sub(&(P->x), &x3, &z3);              //x3.sub(z3); //x3.norm();//31
+        FP_add(&t0, &t0, &t0);              //t0.add(t0);
+        FP_norm(&t0);                       //t0.norm();//32
+        FP_add(&t1, &t1, &t1);              //t1.add(t1);
+        FP_norm(&t1);                       //t1.norm();//33
+        FP_mul(&(P->z), &t0, &t1);              //z3.mul(t1);//34
+
+        FP_norm(&(P->x));                   //x.norm();
+        FP_copy(&(P->y), &y3);              //y.copy(y3);
+        FP_norm(&(P->y));                   //y.norm();
+        FP_norm(&(P->z));                   //z.norm();
+#endif
+#endif
+
+#if CURVETYPE_ZZZ==EDWARDS
+    /* Not using square for multiplication swap, as (1) it needs more adds, and (2) it triggers more reductions */
+
+    FP C, D, H, J;
+    FP_sqr(&C, &(P->x));                    //C.sqr();
+    FP_mul(&(P->x), &(P->x), &(P->y));      //x.mul(y);
+    FP_add(&(P->x), &(P->x), &(P->x));      //x.add(x);
+    FP_norm(&(P->x));                       //x.norm();
+
+    FP_sqr(&D, &(P->y));                        //D.sqr();
+
+#if CURVE_A_ZZZ == -1    
+    FP_neg(&C, &C);             //  C.neg();
+#endif
+    FP_add(&(P->y), &C, &D);    //y.add(D);
+    FP_norm(&(P->y));               //y.norm();
+    FP_sqr(&H, &(P->z));                //H.sqr();
+    FP_add(&H, &H, &H);             //H.add(H);
+
+    FP_sub(&J, &(P->y), &H);            //J.sub(H);
+    FP_norm(&J);                    //J.norm();
+
+    FP_mul(&(P->x), &(P->x), &J);   //x.mul(J);
+    FP_sub(&C, &C, &D);             //C.sub(D);
+    FP_norm(&C);                    //C.norm();
+    FP_mul(&(P->z), &(P->y), &J);   //z.mul(J);
+    FP_mul(&(P->y), &(P->y), &C);   //y.mul(C);
+
+
+#endif
+
+#if CURVETYPE_ZZZ==MONTGOMERY
+    FP A, B, AA, BB, C;
+
+    FP_add(&A, &(P->x), &(P->z));   //A.add(z);
+    FP_norm(&A);                    //A.norm();
+    FP_sqr(&AA, &A);                //AA.sqr();
+    FP_sub(&B, &(P->x), &(P->z));   //B.sub(z);
+    FP_norm(&B);                    //B.norm();
+    FP_sqr(&BB, &B);                //BB.sqr();
+    FP_sub(&C, &AA, &BB);           //C.sub(BB);
+    FP_norm(&C);                    //C.norm();
+    FP_mul(&(P->x), &AA, &BB);      //x.mul(BB);
+
+    FP_imul(&A, &C, (CURVE_A_ZZZ + 2) / 4); //A.imul((ROM.CURVE_A+2)/4);
+
+    FP_add(&BB, &BB, &A);           //BB.add(A);
+    FP_norm(&BB);                   //BB.norm();
+    FP_mul(&(P->z), &BB, &C);   //z.mul(C);
+
+#endif
+}
+
+#if CURVETYPE_ZZZ==MONTGOMERY
+
+/* Set P+=Q. W is difference between P and Q and is affine */
+void ZZZ::ECP_add(ECP *P, ECP *Q, ECP *W)
+{
+    FP A, B, C, D, DA, CB;
+
+    FP_add(&A, &(P->x), &(P->z)); //A.add(z);
+    FP_sub(&B, &(P->x), &(P->z)); //B.sub(z);
+
+    FP_add(&C, &(Q->x), &(Q->z)); //C.add(Q.z);
+    FP_sub(&D, &(Q->x), &(Q->z)); //D.sub(Q.z);
+
+    FP_norm(&A);            //A.norm();
+    FP_norm(&D);            //D.norm();
+    FP_mul(&DA, &D, &A);    //DA.mul(A);
+
+    FP_norm(&C);            //C.norm();
+    FP_norm(&B);            //B.norm();
+    FP_mul(&CB, &C, &B);    //CB.mul(B);
+
+    FP_add(&A, &DA, &CB);   //A.add(CB);
+    FP_norm(&A);            //A.norm();
+    FP_sqr(&(P->x), &A);    //A.sqr();
+    FP_sub(&B, &DA, &CB);   //B.sub(CB);
+    FP_norm(&B);            //B.norm();
+    FP_sqr(&B, &B);         //B.sqr();
+
+    FP_mul(&(P->z), &(W->x), &B); //z.mul(B);
+}
+
+#else
+
+/* Set P+=Q */
+/* SU=248 */
+void ZZZ::ECP_add(ECP *P, ECP *Q)
+{
+#if CURVETYPE_ZZZ==WEIERSTRASS
+
+    int b3;
+    FP t0, t1, t2, t3, t4, x3, y3, z3, b;
+
+#if CURVE_A_ZZZ == 0
+        b3 = 3 * CURVE_B_I;             //int b=3*ROM.CURVE_B_I;
+        FP_mul(&t0, &(P->x), &(Q->x));      //t0.mul(Q.x);
+        FP_mul(&t1, &(P->y), &(Q->y));      //t1.mul(Q.y);
+        FP_mul(&t2, &(P->z), &(Q->z));      //t2.mul(Q.z);
+        FP_add(&t3, &(P->x), &(P->y));      //t3.add(y);
+        FP_norm(&t3);                   //t3.norm();
+        FP_add(&t4, &(Q->x), &(Q->y));      //t4.add(Q.y);
+        FP_norm(&t4);                   //t4.norm();
+        FP_mul(&t3, &t3, &t4);          //t3.mul(t4);
+        FP_add(&t4, &t0, &t1);          //t4.add(t1);
+
+        FP_sub(&t3, &t3, &t4);          //t3.sub(t4);
+        FP_norm(&t3);                   //t3.norm();
+        FP_add(&t4, &(P->y), &(P->z));      //t4.add(z);
+        FP_norm(&t4);                   //t4.norm();
+        FP_add(&x3, &(Q->y), &(Q->z));      //x3.add(Q.z);
+        FP_norm(&x3);                   //x3.norm();
+
+        FP_mul(&t4, &t4, &x3);          //t4.mul(x3);
+        FP_add(&x3, &t1, &t2);          //x3.add(t2);
+
+        FP_sub(&t4, &t4, &x3);          //t4.sub(x3);
+        FP_norm(&t4);                   //t4.norm();
+        FP_add(&x3, &(P->x), &(P->z));      //x3.add(z);
+        FP_norm(&x3);                   //x3.norm();
+        FP_add(&y3, &(Q->x), &(Q->z));      //y3.add(Q.z);
+        FP_norm(&y3);                   //y3.norm();
+        FP_mul(&x3, &x3, &y3);          //x3.mul(y3);
+        FP_add(&y3, &t0, &t2);          //y3.add(t2);
+        FP_sub(&y3, &x3, &y3);          //y3.rsub(x3);
+        FP_norm(&y3);                   //y3.norm();
+        FP_add(&x3, &t0, &t0);          //x3.add(t0);
+        FP_add(&t0, &t0, &x3);          //t0.add(x3);
+        FP_norm(&t0);                   //t0.norm();
+        FP_imul(&t2, &t2, b3);          //t2.imul(b);
+
+        FP_add(&z3, &t1, &t2);          //z3.add(t2);
+        FP_norm(&z3);                   //z3.norm();
+        FP_sub(&t1, &t1, &t2);          //t1.sub(t2);
+        FP_norm(&t1);                   //t1.norm();
+        FP_imul(&y3, &y3, b3);          //y3.imul(b);
+
+        FP_mul(&x3, &y3, &t4);          //x3.mul(t4);
+        FP_mul(&t2, &t3, &t1);          //t2.mul(t1);
+        FP_sub(&(P->x), &t2, &x3);          //x3.rsub(t2);
+        FP_mul(&y3, &y3, &t0);          //y3.mul(t0);
+        FP_mul(&t1, &t1, &z3);          //t1.mul(z3);
+        FP_add(&(P->y), &y3, &t1);          //y3.add(t1);
+        FP_mul(&t0, &t0, &t3);          //t0.mul(t3);
+        FP_mul(&z3, &z3, &t4);          //z3.mul(t4);
+        FP_add(&(P->z), &z3, &t0);          //z3.add(t0);
+
+        FP_norm(&(P->x));               //x.norm();
+        FP_norm(&(P->y));               //y.norm();
+        FP_norm(&(P->z));               //z.norm();
+#else
+
+        if (CURVE_B_I == 0)             //if (ROM.CURVE_B_I==0)
+            FP_rcopy(&b, CURVE_B);  //b.copy(new FP(new BIG(ROM.CURVE_B)));
+
+        FP_mul(&t0, &(P->x), &(Q->x));      //t0.mul(Q.x); //1
+        FP_mul(&t1, &(P->y), &(Q->y));      //t1.mul(Q.y); //2
+        FP_mul(&t2, &(P->z), &(Q->z));      //t2.mul(Q.z); //3
+
+        FP_add(&t3, &(P->x), &(P->y));      //t3.add(y);
+        FP_norm(&t3);                   //t3.norm(); //4
+        FP_add(&t4, &(Q->x), &(Q->y));      //t4.add(Q.y);
+        FP_norm(&t4);                   //t4.norm();//5
+        FP_mul(&t3, &t3, &t4);          //t3.mul(t4);//6
+        FP_add(&t4, &t0, &t1);          //t4.add(t1); //t4.norm(); //7
+        FP_sub(&t3, &t3, &t4);          //t3.sub(t4);
+        FP_norm(&t3);                   //t3.norm(); //8
+        FP_add(&t4, &(P->y), &(P->z));      //t4.add(z);
+        FP_norm(&t4);                   //t4.norm();//9
+        FP_add(&x3, &(Q->y), &(Q->z));      //x3.add(Q.z);
+        FP_norm(&x3);                   //x3.norm();//10
+        FP_mul(&t4, &t4, &x3);          //t4.mul(x3); //11
+        FP_add(&x3, &t1, &t2);          //x3.add(t2); //x3.norm();//12
+
+        FP_sub(&t4, &t4, &x3);          //t4.sub(x3);
+        FP_norm(&t4);                   //t4.norm();//13
+        FP_add(&x3, &(P->x), &(P->z));      //x3.add(z);
+        FP_norm(&x3);                   //x3.norm(); //14
+        FP_add(&y3, &(Q->x), &(Q->z));      //y3.add(Q.z);
+        FP_norm(&y3);                   //y3.norm();//15
+
+        FP_mul(&x3, &x3, &y3);          //x3.mul(y3); //16
+        FP_add(&y3, &t0, &t2);          //y3.add(t2); //y3.norm();//17
+
+        FP_sub(&y3, &x3, &y3);          //y3.rsub(x3);
+        FP_norm(&y3);                   //y3.norm(); //18
+
+        if (CURVE_B_I == 0)             //if (ROM.CURVE_B_I==0)
+            FP_mul(&z3, &t2, &b);       //z3.mul(b); //18
+        else
+            FP_imul(&z3, &t2, CURVE_B_I); //z3.imul(ROM.CURVE_B_I);
+
+        FP_sub(&x3, &y3, &z3);          //x3.sub(z3);
+        FP_norm(&x3);                   //x3.norm(); //20
+        FP_add(&z3, &x3, &x3);          //z3.add(x3); //z3.norm(); //21
+
+        FP_add(&x3, &x3, &z3);          //x3.add(z3); //x3.norm(); //22
+        FP_sub(&z3, &t1, &x3);          //z3.sub(x3);
+        FP_norm(&z3);                   //z3.norm(); //23
+        FP_add(&x3, &x3, &t1);          //x3.add(t1);
+        FP_norm(&x3);                   //x3.norm(); //24
+
+        if (CURVE_B_I == 0)             //if (ROM.CURVE_B_I==0)
+            FP_mul(&y3, &y3, &b);       //y3.mul(b); //18
+        else
+            FP_imul(&y3, &y3, CURVE_B_I); //y3.imul(ROM.CURVE_B_I);
+
+        FP_add(&t1, &t2, &t2);          //t1.add(t2); //t1.norm();//26
+        FP_add(&t2, &t2, &t1);          //t2.add(t1); //t2.norm();//27
+
+        FP_sub(&y3, &y3, &t2);          //y3.sub(t2); //y3.norm(); //28
+
+        FP_sub(&y3, &y3, &t0);          //y3.sub(t0);
+        FP_norm(&y3);                   //y3.norm(); //29
+        FP_add(&t1, &y3, &y3);          //t1.add(y3); //t1.norm();//30
+        FP_add(&y3, &y3, &t1);          //y3.add(t1);
+        FP_norm(&y3);                   //y3.norm(); //31
+
+        FP_add(&t1, &t0, &t0);          //t1.add(t0); //t1.norm(); //32
+        FP_add(&t0, &t0, &t1);          //t0.add(t1); //t0.norm();//33
+        FP_sub(&t0, &t0, &t2);          //t0.sub(t2);
+        FP_norm(&t0);                   //t0.norm();//34
+        FP_mul(&t1, &t4, &y3);          //t1.mul(y3);//35
+        FP_mul(&t2, &t0, &y3);          //t2.mul(y3);//36
+        FP_mul(&y3, &x3, &z3);          //y3.mul(z3);//37
+        FP_add(&(P->y), &y3, &t2);          //y3.add(t2); //y3.norm();//38
+        FP_mul(&x3, &x3, &t3);          //x3.mul(t3);//39
+        FP_sub(&(P->x), &x3, &t1);          //x3.sub(t1);//40
+        FP_mul(&z3, &z3, &t4);          //z3.mul(t4);//41
+
+        FP_mul(&t1, &t3, &t0);          //t1.mul(t0);//42
+        FP_add(&(P->z), &z3, &t1);          //z3.add(t1);
+        FP_norm(&(P->x));               //x.norm();
+        FP_norm(&(P->y));               //y.norm();
+        FP_norm(&(P->z));               //z.norm();
+#endif
+
+#else
+    FP A, B, C, D, E, F, G, b;
+
+    FP_mul(&A, &(P->z), &(Q->z));   //A.mul(Q.z);
+    FP_sqr(&B, &A);                 //B.sqr();
+    FP_mul(&C, &(P->x), &(Q->x));   //C.mul(Q.x);
+    FP_mul(&D, &(P->y), &(Q->y));   //D.mul(Q.y);
+
+    FP_mul(&E, &C, &D);             //E.mul(D);
+
+    if (CURVE_B_I == 0)         //if (ROM.CURVE_B_I==0)
+    {
+        FP_rcopy(&b, CURVE_B);  //FP b=new FP(new BIG(ROM.CURVE_B));
+        FP_mul(&E, &E, &b);         //E.mul(b);
+    }
+    else
+        FP_imul(&E, &E, CURVE_B_I); //E.imul(ROM.CURVE_B_I);
+
+    FP_sub(&F, &B, &E);         //F.sub(E);
+    FP_add(&G, &B, &E);         //G.add(E);
+
+#if CURVE_A_ZZZ == 1
+    FP_sub(&E, &D, &C);     //E.sub(C);
+#endif
+    FP_add(&C, &C, &D);         //C.add(D);
+
+    FP_add(&B, &(P->x), &(P->y));   //B.add(y);
+    FP_add(&D, &(Q->x), &(Q->y));   //D.add(Q.y);
+    FP_norm(&B);                //B.norm();
+    FP_norm(&D);                //D.norm();
+    FP_mul(&B, &B, &D);         //B.mul(D);
+    FP_sub(&B, &B, &C);         //B.sub(C);
+    FP_norm(&B);                //B.norm();
+    FP_norm(&F);                //F.norm();
+    FP_mul(&B, &B, &F);         //B.mul(F);
+    FP_mul(&(P->x), &A, &B); //x.mul(B);
+    FP_norm(&G);                //G.norm();
+
+#if CURVE_A_ZZZ == 1
+    FP_norm(&E);            //E.norm();
+    FP_mul(&C, &E, &G);     //C.mul(G);
+#endif
+
+#if CURVE_A_ZZZ == -1
+    FP_norm(&C);            //C.norm();
+    FP_mul(&C, &C, &G);     //C.mul(G);
+#endif
+    FP_mul(&(P->y), &A, &C); //y.mul(C);
+    FP_mul(&(P->z), &F, &G); //z.mul(G);
+
+#endif
+}
+
+/* Set P-=Q */
+/* SU=16 */
+void  ZZZ::ECP_sub(ECP *P, ECP *Q)
+{
+    ECP NQ;
+    ECP_copy(&NQ, Q);
+    ECP_neg(&NQ);
+    ECP_add(P, &NQ);
+}
+
+#endif
+
+#if CURVETYPE_ZZZ!=MONTGOMERY
+/* constant time multiply by small integer of length bts - use ladder */
+void ZZZ::ECP_pinmul(ECP *P, int e, int bts)
+{
+    int i, b;
+    ECP R0, R1;
+
+    ECP_affine(P);
+    ECP_inf(&R0);
+    ECP_copy(&R1, P);
+
+    for (i = bts - 1; i >= 0; i--)
+    {
+        b = (e >> i) & 1;
+        ECP_copy(P, &R1);
+        ECP_add(P, &R0);
+        ECP_cswap(&R0, &R1, b);
+        ECP_copy(&R1, P);
+        ECP_dbl(&R0);
+        ECP_cswap(&R0, &R1, b);
+    }
+    ECP_copy(P, &R0);
+}
+#endif
+
+// Point multiplication, multiplies a point P by a scalar e
+// This code has no inherent awareness of the order of the curve, or the order of the point.
+// The order of the curve will be h.r, where h is a cofactor, and r is a large prime
+// Typically P will be of order r (but not always), and typically e will be less than r (but not always)
+// A problem can arise if a secret e is a few bits less than r, as the leading zeros in e will leak via a timing attack
+// The secret e may however be greater than r (see RFC7748 which combines elimination of a small cofactor h with the point multiplication, using an e>r)
+// Our solution is to use as a multiplier an e, whose length in bits is that of the logical OR of e and r, hence allowing e>r while forcing inclusion of leading zeros if e<r. 
+// The point multiplication methods used will process leading zeros correctly.
+
+// So this function leaks information about the length of e...
+void ZZZ::ECP_mul(ECP *P,BIG e)
+{
+    ECP_clmul(P,e,e);
+}
+
+// .. but this one does not (typically set maxe=r)
+// Set P=e*P 
+void ZZZ::ECP_clmul(ECP *P, BIG e, BIG maxe)
+{
+    BIG cm;
+    BIG_or(cm,e,maxe);
+    int max=BIG_nbits(cm);
+#if CURVETYPE_ZZZ==MONTGOMERY
+    /* Montgomery ladder */
+    int nb, i, b;
+    ECP R0, R1, D;
+    if (ECP_isinf(P)) return;
+    if (BIG_iszilch(e))
+    {
+        ECP_inf(P);
+        return;
+    }
+
+    ECP_copy(&R0, P);
+    ECP_copy(&R1, P);
+    ECP_dbl(&R1);
+
+    ECP_copy(&D, P);
+    ECP_affine(&D);
+
+    nb = max;
+    for (i = nb - 2; i >= 0; i--)
+    {
+        b = BIG_bit(e, i);
+        ECP_copy(P, &R1);
+        ECP_add(P, &R0, &D);
+        ECP_cswap(&R0, &R1, b);
+        ECP_copy(&R1, P);
+        ECP_dbl(&R0);
+
+        ECP_cswap(&R0, &R1, b);
+    }
+
+    ECP_copy(P, &R0);
+
+#else
+    /* fixed size windows */
+    int i, nb, s, ns;
+    BIG mt, t;
+    ECP Q, W[8], C;
+    sign8 w[1 + (NLEN_XXX * BASEBITS_XXX + 3) / 4];
+
+    if (ECP_isinf(P)) return;
+    if (BIG_iszilch(e))
+    {
+        ECP_inf(P);
+        return;
+    }
+
+    /* precompute table */
+    ECP_copy(&Q, P);
+    ECP_dbl(&Q);
+    ECP_copy(&W[0], P);
+
+    for (i = 1; i < 8; i++)
+    {
+        ECP_copy(&W[i], &W[i - 1]);
+        ECP_add(&W[i], &Q);
+    }
+
+    /* make exponent odd - add 2P if even, P if odd */
+    BIG_copy(t, e);
+    s = BIG_parity(t);
+    BIG_inc(t, 1);
+    BIG_norm(t);
+    ns = BIG_parity(t);
+    BIG_copy(mt, t);
+    BIG_inc(mt, 1);
+    BIG_norm(mt);
+    BIG_cmove(t, mt, s);
+    ECP_cmove(&Q, P, ns);
+    ECP_copy(&C, &Q);
+
+    nb = 1 + (max + 3) / 4;
+    /* convert exponent to signed 4-bit window */
+    for (i = 0; i < nb; i++)
+    {
+        w[i] = BIG_lastbits(t, 5) - 16;
+        BIG_dec(t, w[i]);
+        BIG_norm(t);
+        BIG_fshr(t, 4);
+    }
+    w[nb] = BIG_lastbits(t, 5);
+
+    ECP_select(P, W, w[nb]);
+    for (i = nb - 1; i >= 0; i--)
+    {
+        ECP_select(&Q, W, w[i]);
+        ECP_dbl(P);
+        ECP_dbl(P);
+        ECP_dbl(P);
+        ECP_dbl(P);
+        ECP_add(P, &Q);
+    }
+    ECP_sub(P, &C); /* apply correction */
+#endif
+}
+
+#if CURVETYPE_ZZZ!=MONTGOMERY
+
+// Generic multi-multiplication, fixed 4-bit window, P=Sigma e_i*X_i
+// m point doublings
+void ZZZ::ECP_muln(ECP *P,int n,ECP X[],BIG e[])
+{
+    int i,j,k,nb;
+    BIG t,mt;
+    ECP S,R,B[16];
+    ECP_inf(P);
+
+    BIG_copy(mt,e[0]); BIG_norm(mt);
+    for (i=1;i<n;i++)
+    { // find biggest
+        BIG_copy(t,e[i]); BIG_norm(t);
+        k=BIG_comp(t,mt);
+        BIG_cmove(mt,t,(k+1)/2);
+    }
+    nb=(BIG_nbits(mt)+3)/4;
+    for (int i=nb-1;i>=0;i--)
+    { // Pippenger's algorithm
+        for (j=0;j<16;j++)
+            ECP_inf(&B[j]);
+        for (j=0;j<n;j++)
+        { 
+            BIG_copy(mt,e[j]); BIG_norm(mt);
+            BIG_shr(mt,4*i);
+            k=BIG_lastbits(mt,4);
+            ECP_add(&B[k],&X[j]);  // side channel risky
+        }
+        ECP_inf(&R); ECP_inf(&S);
+        for (j=15;j>=1;j--)
+        {
+            ECP_add(&R,&B[j]);
+            ECP_add(&S,&R);
+        }
+        for (j=0;j<4;j++)
+            ECP_dbl(P);
+        ECP_add(P,&S);
+    }
+}
+
+void ZZZ::ECP_mul2(ECP *P, ECP *Q, BIG e, BIG f)
+{
+    ECP_clmul2(P,Q,e,f,e);
+}
+
+/* Set P=eP+fQ double multiplication */
+/* constant time - as useful for GLV method in pairings */
+/* SU=456 */
+
+void ZZZ::ECP_clmul2(ECP *P, ECP *Q, BIG e, BIG f, BIG maxe)
+{
+    BIG cm;
+    BIG te, tf, mt;
+    ECP S, T, W[8], C;
+    sign8 w[1 + (NLEN_XXX * BASEBITS_XXX + 1) / 2];
+    int i, a, b, s, ns, nb;
+
+    BIG_copy(cm,maxe); BIG_or(cm,cm,e); BIG_or(cm,cm,f);
+    int max=BIG_nbits(cm);
+
+    BIG_copy(te, e);
+    BIG_copy(tf, f);
+
+    /* precompute table */
+    ECP_copy(&W[1], P);
+    ECP_sub(&W[1], Q); /* P+Q */
+    ECP_copy(&W[2], P);
+    ECP_add(&W[2], Q); /* P-Q */
+    ECP_copy(&S, Q);
+    ECP_dbl(&S);  /* S=2Q */
+    ECP_copy(&W[0], &W[1]);
+    ECP_sub(&W[0], &S);
+    ECP_copy(&W[3], &W[2]);
+    ECP_add(&W[3], &S);
+    ECP_copy(&T, P);
+    ECP_dbl(&T); /* T=2P */
+    ECP_copy(&W[5], &W[1]);
+    ECP_add(&W[5], &T);
+    ECP_copy(&W[6], &W[2]);
+    ECP_add(&W[6], &T);
+    ECP_copy(&W[4], &W[5]);
+    ECP_sub(&W[4], &S);
+    ECP_copy(&W[7], &W[6]);
+    ECP_add(&W[7], &S);
+
+    /* if multiplier is odd, add 2, else add 1 to multiplier, and add 2P or P to correction */
+
+    s = BIG_parity(te);
+    BIG_inc(te, 1);
+    BIG_norm(te);
+    ns = BIG_parity(te);
+    BIG_copy(mt, te);
+    BIG_inc(mt, 1);
+    BIG_norm(mt);
+    BIG_cmove(te, mt, s);
+    ECP_cmove(&T, P, ns);
+    ECP_copy(&C, &T);
+
+    s = BIG_parity(tf);
+    BIG_inc(tf, 1);
+    BIG_norm(tf);
+    ns = BIG_parity(tf);
+    BIG_copy(mt, tf);
+    BIG_inc(mt, 1);
+    BIG_norm(mt);
+    BIG_cmove(tf, mt, s);
+    ECP_cmove(&S, Q, ns);
+    ECP_add(&C, &S);
+
+    //BIG_add(mt, te, tf);
+    //BIG_norm(mt);
+    nb = 1 + (max + 1) / 2;
+
+    /* convert exponent to signed 2-bit window */
+    for (i = 0; i < nb; i++)
+    {
+        a = BIG_lastbits(te, 3) - 4;
+        BIG_dec(te, a);
+        BIG_norm(te);
+        BIG_fshr(te, 2);
+        b = BIG_lastbits(tf, 3) - 4;
+        BIG_dec(tf, b);
+        BIG_norm(tf);
+        BIG_fshr(tf, 2);
+        w[i] = 4 * a + b;
+    }
+    w[nb] = (4 * BIG_lastbits(te, 3) + BIG_lastbits(tf, 3));
+
+    //ECP_copy(P, &W[(w[nb] - 1) / 2]);
+    ECP_select(P, W, w[nb]);
+    for (i = nb - 1; i >= 0; i--)
+    {
+        ECP_select(&T, W, w[i]);
+        ECP_dbl(P);
+        ECP_dbl(P);
+        ECP_add(P, &T);
+    }
+    ECP_sub(P, &C); /* apply correction */
+}
+
+#endif
+
+void ZZZ::ECP_cfp(ECP *P)
+{   /* multiply point by curves cofactor */
+    BIG c;
+    int cf = CURVE_Cof_I;
+    if (cf == 1) return;
+    if (cf == 4)
+    {
+        ECP_dbl(P);
+        ECP_dbl(P);
+        return;
+    }
+    if (cf == 8)
+    {
+        ECP_dbl(P);
+        ECP_dbl(P);
+        ECP_dbl(P);
+        return;
+    }
+    BIG_rcopy(c, CURVE_Cof);
+    ECP_mul(P, c);
+    return;
+}
+
+/* Constant time Map to Point */
+void ZZZ::ECP_map2point(ECP *P,FP *h)
+{
+#if CURVETYPE_ZZZ==MONTGOMERY
+// Elligator 2
+    int qres;
+    BIG a;
+    FP X1,X2,w,N,t,one,A,D,hint;
+    //BIG_zero(a); BIG_inc(a,CURVE_A); BIG_norm(a); FP_nres(&A,a);
+    FP_from_int(&A,CURVE_A_ZZZ);
+    FP_copy(&t,h);
+    FP_sqr(&t,&t);   // t^2
+
+    if (PM1D2_YYY == 2)
+         FP_add(&t,&t,&t);  // 2t^2
+    if (PM1D2_YYY == 1)
+        FP_neg(&t,&t);      // -t^2
+    if (PM1D2_YYY > 2)
+        FP_imul(&t,&t,QNRI_YYY); // precomputed QNR
+    FP_norm(&t);  // z.t^2
+
+    FP_one(&one);
+    FP_add(&D,&t,&one); FP_norm(&D);  // Denominator D=1+z.t^2
+
+    FP_copy(&X1,&A);
+    FP_neg(&X1,&X1);  FP_norm(&X1);  // X1 = -A/D
+    FP_copy(&X2,&X1);
+    FP_mul(&X2,&X2,&t);             // X2 = -At/D
+
+    FP_sqr(&w,&X1); FP_mul(&N,&w,&X1);  // w=X1^2, N=X1^3
+    FP_mul(&w,&w,&A); FP_mul(&w,&w,&D); FP_add(&N,&N,&w);  // N = X1^3+ADX1^2
+    FP_sqr(&t,&D);
+    FP_mul(&t,&t,&X1);  
+    FP_add(&N,&N,&t);  // N=X1^3+ADX1^2+D^2X1  // Numerator of gx =  N/D^3
+    FP_norm(&N);
+
+    FP_mul(&t,&N,&D);                   // N.D
+    qres=FP_qr(&t,&hint);  // *** exp
+    FP_inv(&w,&t,&hint);
+    FP_mul(&D,&w,&N);     // 1/D
+    FP_mul(&X1,&X1,&D);    // get X1
+    FP_mul(&X2,&X2,&D);    // get X2
+    FP_cmove(&X1,&X2,1-qres);
+    FP_redc(a,&X1);
+
+    ECP_set(P,a);
+    return;
+#endif
+#if CURVETYPE_ZZZ==EDWARDS
+// Elligator 2 - map to Montgomery, place point, map back
+    int qres,ne,rfc,qnr;
+    BIG x,y;
+    FP X1,X2,t,w,one,A,w1,w2,B,Y,K,D,hint;
+    FP_one(&one);
+
+#if MODTYPE_YYY != GENERALISED_MERSENNE
+// its NOT ed448!
+// Figure out the Montgomery curve parameters
+
+    FP_rcopy(&B,CURVE_B);
+
+#if CURVE_A_ZZZ == 1
+    FP_add(&A,&B,&one);  // A=B+1  // A = a+d
+    FP_sub(&B,&B,&one);  // B=B-1  // B = -a+d
+#else
+    FP_sub(&A,&B,&one);  // A=B-1
+    FP_add(&B,&B,&one);  // B=B+1
+#endif
+    FP_norm(&A); FP_norm(&B);
+
+    FP_div2(&A,&A);    // (A+B)/2     // (a+d)/2  = J/K
+    FP_div2(&B,&B);    // (B-A)/2     // (-a+d)/2
+    FP_div2(&B,&B);    // (B-A)/4     // (-a+d)/4 = -1/K
+
+    FP_neg(&K,&B); FP_norm(&K);
+    //FP_inv(&K,&K,NULL);    // K
+    FP_invsqrt(&K,&w1,&K);                      // *** return K, w1=sqrt(1/K) - - could be precalculated!
+
+    rfc=RIADZ_YYY;
+    if (rfc)
+    { // RFC7748 method applies
+        FP_mul(&A,&A,&K);   // = J
+        FP_mul(&K,&K,&w1);
+//        FP_sqrt(&K,&K,NULL);
+    } else { // generic method
+        FP_sqr(&B,&B);
+    }
+#else
+    FP_from_int(&A,156326);
+    rfc=1;
+#endif
+// Map to this Montgomery curve X^2=X^3+AX^2+BX
+
+    FP_copy(&t,h); 
+    FP_sqr(&t,&t);   // t^2
+
+    if (PM1D2_YYY == 2)
+    {
+        FP_add(&t,&t,&t);  // 2t^2
+        qnr=2;
+    }
+    if (PM1D2_YYY == 1)
+    {
+        FP_neg(&t,&t);      // -t^2
+        qnr=-1;
+    }
+    if (PM1D2_YYY > 2)
+    {
+        FP_imul(&t,&t,QNRI_YYY);  // precomputed QNR
+        qnr=QNRI_YYY;
+    }
+    FP_norm(&t);
+    FP_add(&D,&t,&one); FP_norm(&D);  // Denominator=(1+z.u^2)
+
+    FP_copy(&X1,&A);
+    FP_neg(&X1,&X1);   FP_norm(&X1);  // X1=-(J/K).inv(1+z.u^2)
+    FP_mul(&X2,&X1,&t);  // X2=X1*z.u^2
+
+// Figure out RHS of Montgomery curve in rational form gx1/d^3
+
+    FP_sqr(&w,&X1); FP_mul(&w1,&w,&X1);  // w=X1^2, w1=X1^3
+    FP_mul(&w,&w,&A); FP_mul(&w,&w,&D); FP_add(&w1,&w1,&w);  // w1 = X1^3+ADX1^2
+    FP_sqr(&w2,&D);
+    if (!rfc)
+    {
+        FP_mul(&w,&X1,&B);
+        FP_mul(&w2,&w2,&w); //
+        FP_add(&w1,&w1,&w2);   // w1=X1^3+ADX1^2+BD^2X1
+    } else {
+        FP_mul(&w2,&w2,&X1);  
+        FP_add(&w1,&w1,&w2);  // w1=X1^3+ADX1^2+D^2X1  // was &X1
+    }
+    FP_norm(&w1);
+
+    FP_mul(&B,&w1,&D);     // gx1=num/den^3 - is_qr num*den (same as num/den, same as num/den^3)
+    qres=FP_qr(&B,&hint);  // ***
+    FP_inv(&w,&B,&hint);
+    FP_mul(&D,&w,&w1);     // 1/D
+    FP_mul(&X1,&X1,&D);    // get X1
+    FP_mul(&X2,&X2,&D);    // get X2
+    FP_sqr(&D,&D);
+
+    FP_imul(&w1,&B,qnr);       // now for gx2 = Z.u^2.gx1
+    FP_rcopy(&w,CURVE_HTPC);   // qnr^C3  
+    FP_mul(&w,&w,&hint);    // modify hint for gx2
+    FP_mul(&w2,&D,h);
+
+    FP_cmove(&X1,&X2,1-qres);  // pick correct one
+    FP_cmove(&B,&w1,1-qres);
+    FP_cmove(&hint,&w,1-qres);
+    FP_cmove(&D,&w2,1-qres);
+     
+    FP_sqrt(&Y,&B,&hint);   // sqrt(num*den)
+    FP_mul(&Y,&Y,&D);       // sqrt(num/den^3)
+
+// correct sign of Y
+    FP_neg(&w,&Y); FP_norm(&w);
+    FP_cmove(&Y,&w,qres^FP_sign(&Y));
+
+    if (!rfc)
+    {
+        FP_mul(&X1,&X1,&K);
+        FP_mul(&Y,&Y,&K);
+    }
+
+#if MODTYPE_YYY == GENERALISED_MERSENNE
+// Ed448 isogeny
+    FP_sqr(&t,&X1);  // t=u^2
+    FP_add(&w,&t,&one); // w=u^2+1
+    FP_norm(&w);
+    FP_sub(&t,&t,&one); // t=u^2-1
+    FP_norm(&t);
+    FP_mul(&w1,&t,&Y);  // w1=v(u^2-1)
+    FP_add(&w1,&w1,&w1);
+    FP_add(&X2,&w1,&w1);
+    FP_norm(&X2);       // w1=4v(u^2-1)
+    FP_sqr(&t,&t);      // t=(u^2-1)^2
+    FP_sqr(&Y,&Y);      // v^2
+    FP_add(&Y,&Y,&Y);
+    FP_add(&Y,&Y,&Y);
+    FP_norm(&Y);        // 4v^2
+    FP_add(&B,&t,&Y);  // w2=(u^2-1)^2+4v^2
+    FP_norm(&B);                                   // X1=w1/w2 - X2=w1, B=w2
+
+    FP_sub(&w2,&Y,&t);   // w2=4v^2-(u^2-1)^2
+    FP_norm(&w2);
+    FP_mul(&w2,&w2,&X1); // w2=u(4v^2-(u^2-1)^2)
+    FP_mul(&t,&t,&X1);   // t=u(u^2-1)^2
+    FP_div2(&Y,&Y);      // 2v^2
+    FP_mul(&w1,&Y,&w);  // w1=2v^2(u^2+1)
+    FP_sub(&w1,&t,&w1);  // w1=u(u^2-1)^2 - 2v^2(u^2+1)
+    FP_norm(&w1);                                   // Y=w2/w1
+
+    FP_mul(&t,&X2,&w1);    // output in projective to avoid inversion
+    FP_copy(&(P->x),&t);
+    FP_mul(&t,&w2,&B);
+    FP_copy(&(P->y),&t);
+    FP_mul(&t,&w1,&B);
+    FP_copy(&(P->z),&t);
+
+    return;
+
+#else
+    FP_add(&w1,&X1,&one); FP_norm(&w1); // (s+1)
+    FP_sub(&w2,&X1,&one); FP_norm(&w2); // (s-1)
+    FP_mul(&t,&w1,&Y);
+    FP_mul(&X1,&X1,&w1);
+
+    if (rfc)
+        FP_mul(&X1,&X1,&K);
+
+    FP_mul(&Y,&Y,&w2);      // output in projective to avoid inversion
+    FP_copy(&(P->x),&X1);
+    FP_copy(&(P->y),&Y);
+    FP_copy(&(P->z),&t);
+    return;
+#endif
+
+#endif
+
+#if CURVETYPE_ZZZ==WEIERSTRASS
+// SSWU or SVDW method
+    int sgn,ne;
+    BIG a,x,y;
+    FP X1,X2,X3,t,w,one,A,B,Y,D;
+    FP D2,hint,GX1;
+
+#if HTC_ISO_ZZZ != 0
+// Map to point on isogenous curve
+    int i,k,isox,isoy,iso=HTC_ISO_ZZZ;
+    FP xnum,xden,ynum,yden;
+    BIG z;
+    FP_rcopy(&A,CURVE_Ad);
+    FP_rcopy(&B,CURVE_Bd);
+#else
+    FP_from_int(&A,CURVE_A_ZZZ);
+    FP_rcopy(&B,CURVE_B);
+#endif
+
+    FP_one(&one);
+    FP_copy(&t,h);
+    sgn=FP_sign(&t);
+
+#if CURVE_A_ZZZ != 0 || HTC_ISO_ZZZ != 0
+
+        FP_sqr(&t,&t);
+        FP_imul(&t,&t,RIADZ_YYY);  // Z from hash-to-point draft standard
+        FP_add(&w,&t,&one);     // w=Zt^2+1
+        FP_norm(&w);
+
+        FP_mul(&w,&w,&t);      // w=Z^2*t^4+Zt^2
+        FP_mul(&D,&A,&w);      // A=Aw
+                               
+        FP_add(&w,&w,&one); FP_norm(&w);
+        FP_mul(&w,&w,&B);
+        FP_neg(&w,&w);          // -B(w+1)
+        FP_norm(&w);
+
+        FP_copy(&X2,&w);        // Numerators
+        FP_mul(&X3,&t,&X2);
+
+// x^3+Ad^2x+Bd^3
+        FP_sqr(&GX1,&X2);
+        FP_sqr(&D2,&D); FP_mul(&w,&A,&D2); FP_add(&GX1,&GX1,&w); FP_norm(&GX1); FP_mul(&GX1,&GX1,&X2); FP_mul(&D2,&D2,&D); FP_mul(&w,&B,&D2); FP_add(&GX1,&GX1,&w); FP_norm(&GX1);
+
+        FP_mul(&w,&GX1,&D);
+        int qr=FP_qr(&w,&hint);   // qr(ad) - only exp happens here
+        FP_inv(&D,&w,&hint);     // d=1/(ad)
+        FP_mul(&D,&D,&GX1);     // 1/d
+        FP_mul(&X2,&X2,&D);     // X2/=D
+        FP_mul(&X3,&X3,&D);     // X3/=D
+        FP_mul(&t,&t,h);        // t=Z.u^3
+        FP_sqr(&D2,&D);
+
+        FP_mul(&D,&D2,&t);
+        FP_imul(&t,&w,RIADZ_YYY);
+        FP_rcopy(&X1,CURVE_HTPC);     
+        FP_mul(&X1,&X1,&hint); // modify hint
+
+        FP_cmove(&X2,&X3,1-qr); 
+        FP_cmove(&D2,&D,1-qr);
+        FP_cmove(&w,&t,1-qr);
+        FP_cmove(&hint,&X1,1-qr);
+
+        FP_sqrt(&Y,&w,&hint);  // first candidate if X2 is correct
+        FP_mul(&Y,&Y,&D2);
+
+        ne=FP_sign(&Y)^sgn;
+        FP_neg(&w,&Y); FP_norm(&w);
+        FP_cmove(&Y,&w,ne);
+
+#if HTC_ISO_ZZZ != 0
+
+// (X2,Y) is on isogenous curve
+        k=0;
+        isox=iso;
+        isoy=3*(iso-1)/2;
+
+// xnum
+        FP_rcopy(&xnum,PC[k++]);
+        for (i=0;i<isox;i++)
+        {
+            FP_mul(&xnum,&xnum,&X2); 
+            FP_rcopy(&w,PC[k++]);
+            FP_add(&xnum,&xnum,&w); FP_norm(&xnum);
+        }
+
+// xden
+        FP_copy(&xden,&X2);
+        FP_rcopy(&w,PC[k++]);
+        FP_add(&xden,&xden,&w); FP_norm(&xden);
+ 
+        for (i=0;i<isox-2;i++)
+        {
+            FP_mul(&xden,&xden,&X2);
+            FP_rcopy(&w,PC[k++]);
+            FP_add(&xden,&xden,&w); FP_norm(&xden);
+        }
+
+// ynum
+        FP_rcopy(&ynum,PC[k++]);
+        for (i=0;i<isoy;i++)
+        {
+            FP_mul(&ynum,&ynum,&X2); 
+            FP_rcopy(&w,PC[k++]);
+            FP_add(&ynum,&ynum,&w); FP_norm(&ynum);
+        }
+
+// yden 
+        FP_copy(&yden,&X2);
+        FP_rcopy(&w,PC[k++]);
+        FP_add(&yden,&yden,&w); FP_norm(&yden);
+      
+        for (i=0;i<isoy-1;i++)
+        {
+            FP_mul(&yden,&yden,&X2); 
+            FP_rcopy(&w,PC[k++]);
+            FP_add(&yden,&yden,&w); FP_norm(&yden);
+        }
+
+        FP_mul(&ynum,&ynum,&Y);
+
+// return in projective coordinates
+        FP_mul(&t,&xnum,&yden);
+        FP_copy(&(P->x),&t);
+
+        FP_mul(&t,&ynum,&xden);
+        FP_copy(&(P->y),&t);
+
+        FP_mul(&t,&xden,&yden);
+        FP_copy(&(P->z),&t);
+        return;
+#else
+
+        FP_redc(x,&X2);
+        FP_redc(y,&Y);
+        ECP_set(P,x,y);
+        return;
+#endif
+#else 
+// SVDW - Shallue and van de Woestijne
+        FP_from_int(&Y,RIADZ_YYY);
+        ECP_rhs(&A,&Y);  // A=g(Z)
+        FP_rcopy(&B,SQRTm3);
+        FP_imul(&B,&B,RIADZ_YYY); // B=Z*sqrt(-3)
+
+        FP_sqr(&t,&t);
+        FP_mul(&Y,&A,&t);   // Y=tv1=u^2*g(Z)
+        FP_add(&t,&one,&Y); FP_norm(&t); // t=tv2=1+tv1
+        FP_sub(&Y,&one,&Y); FP_norm(&Y); // Y=tv1=1-tv1
+        FP_mul(&D,&t,&Y);
+        FP_mul(&D,&D,&B);
+
+        FP_copy(&w,&A);
+        FP_tpo(&D,&w);   // D=tv3=inv0(tv1*tv2*Z*sqrt(-3)) and w=sqrt(g(Z))   // ***
+
+        FP_mul(&w,&w,&B);  // w=tv4=Z.sqrt(-3).sqrt(g(Z))
+        if (FP_sign(&w)==1)
+        { // depends only on sign of constant RIADZ
+            FP_neg(&w,&w);
+            FP_norm(&w);
+        }
+        FP_mul(&w,&w,&B);  // Z.sqrt(-3)
+        FP_mul(&w,&w,h);    // u
+        FP_mul(&w,&w,&Y);   // tv1
+        FP_mul(&w,&w,&D);  // tv3   // tv5=u*tv1*tv3*tv4*Z*sqrt(-3)
+
+        FP_from_int(&X1,RIADZ_YYY);
+        FP_copy(&X3,&X1);
+        FP_neg(&X1,&X1); FP_norm(&X1); FP_div2(&X1,&X1); // -Z/2
+        FP_copy(&X2,&X1);
+        FP_sub(&X1,&X1,&w); FP_norm(&X1);
+        FP_add(&X2,&X2,&w); FP_norm(&X2);
+        FP_add(&A,&A,&A);
+        FP_add(&A,&A,&A);
+        FP_norm(&A);      // 4*g(Z)
+        FP_sqr(&t,&t);
+        FP_mul(&t,&t,&D);
+        FP_sqr(&t,&t);    // (tv2^2*tv3)^2
+        FP_mul(&A,&A,&t); // 4*g(Z)*(tv2^2*tv3)^2
+        FP_add(&X3,&X3,&A); FP_norm(&X3);
+
+        ECP_rhs(&w,&X2);
+        FP_cmove(&X3,&X2,FP_qr(&w,NULL));                           // ***
+        ECP_rhs(&w,&X1);
+        FP_cmove(&X3,&X1,FP_qr(&w,NULL));                           // ***
+        ECP_rhs(&w,&X3);
+        FP_sqrt(&Y,&w,NULL);                                        // ***
+
+        ne=FP_sign(&Y)^sgn;
+        FP_neg(&w,&Y); FP_norm(&w);
+        FP_cmove(&Y,&w,ne);
+
+        FP_redc(x,&X3);
+        FP_redc(y,&Y);
+        ECP_set(P,x,y);
+        return;
+#endif
+
+#endif
+}
+
+/* Hunt and Peck a BIG to a curve point */
+/*
+void ZZZ::ECP_hap2point(ECP *P,BIG h)
+{
+    BIG x;
+    BIG_copy(x,h);
+	for (;;)
+	{
+#if CURVETYPE_ZZZ!=MONTGOMERY
+		ECP_setx(P,x,0);
+#else
+		ECP_set(P,x);
+#endif
+		BIG_inc(x,1); BIG_norm(x);
+		if (!ECP_isinf(P)) break;
+	}
+}
+*/
+/* Map octet to point */
+/*
+void ZZZ::ECP_mapit(ECP *P, octet *W)
+{
+    BIG q, x;
+    DBIG dx;
+    BIG_rcopy(q, Modulus);
+
+    BIG_dfromBytesLen(dx,W->val,W->len);
+    BIG_dmod(x,dx,q);
+
+    ECP_hap2point(P,x);
+    ECP_cfp(P);
+}
+*/
+int ZZZ::ECP_generator(ECP *G)
+{
+    BIG x, y;
+    BIG_rcopy(x, CURVE_Gx);
+#if CURVETYPE_ZZZ!=MONTGOMERY
+    BIG_rcopy(y, CURVE_Gy);
+    return ECP_set(G, x, y);
+#else
+    return ECP_set(G, x);
+#endif
+}
+
+#ifdef HAS_MAIN
+
+using namespace ZZZ;
+
+int main()
+{
+    int i;
+    ECP G, P;
+    csprng RNG;
+    BIG r, s, x, y, b, m, w, q;
+    BIG_rcopy(x, CURVE_Gx);
+#if CURVETYPE_ZZZ!=MONTGOMERY
+    BIG_rcopy(y, CURVE_Gy);
+#endif
+    BIG_rcopy(m, Modulus);
+
+    printf("x= ");
+    BIG_output(x);
+    printf("\n");
+#if CURVETYPE_ZZZ!=MONTGOMERY
+    printf("y= ");
+    BIG_output(y);
+    printf("\n");
+#endif
+    RNG_seed(&RNG, 3, "abc");
+
+#if CURVETYPE_ZZZ!=MONTGOMERY
+    ECP_set(&G, x, y);
+#else
+    ECP_set(&G, x);
+#endif
+    if (ECP_isinf(&G)) printf("Failed to set - point not on curve\n");
+    else printf("set success\n");
+
+    ECP_output(&G);
+
+    BIG_rcopy(r, CURVE_Order); //BIG_dec(r,7);
+    printf("r= ");
+    BIG_output(r);
+    printf("\n");
+
+    ECP_copy(&P, &G);
+
+    ECP_mul(&P, r);
+
+    ECP_output(&P);
+    BIG_randomnum(w, &RNG);
+    BIG_mod(w, r);
+
+    ECP_copy(&P, &G);
+    ECP_mul(&P, w);
+
+    ECP_output(&P);
+
+    return 0;
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp.h
new file mode 100644
index 0000000..a78e2c1
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_ZZZ_H
+#define ECP_ZZZ_H
+
+#include "fp_YYY.h"
+#include "config_curve_ZZZ.h"
+
+using namespace core;
+
+namespace ZZZ {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const XXX::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const XXX::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const XXX::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const XXX::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const XXX::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const XXX::BIG CURVE_Ad;
+extern const XXX::BIG CURVE_Bd;
+extern const XXX::BIG PC[];
+
+extern const XXX::BIG CURVE_Adr;
+extern const XXX::BIG CURVE_Adi;
+extern const XXX::BIG CURVE_Bdr;
+extern const XXX::BIG CURVE_Bdi;
+extern const XXX::BIG PCR[];
+extern const XXX::BIG PCI[];
+
+/* Generator point on G1 */
+extern const XXX::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const XXX::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const XXX::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const XXX::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const XXX::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const XXX::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const XXX::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const XXX::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const XXX::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const XXX::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const XXX::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const XXX::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const XXX::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    YYY::FP x; /**< x-coordinate of point */
+#if CURVETYPE_ZZZ!=MONTGOMERY
+    YYY::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    YYY::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(YYY::FP *r, YYY::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, XXX::BIG x, int s);
+
+#if CURVETYPE_ZZZ==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, XXX::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(XXX::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, XXX::BIG x, XXX::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(XXX::BIG x, XXX::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, XXX::BIG e, XXX::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, XXX::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, XXX::BIG e, XXX::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, XXX::BIG e, XXX::BIG f, XXX::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],XXX::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, YYY::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, XXX::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp2.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp2.cpp
new file mode 100644
index 0000000..c76094a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp2.cpp
@@ -0,0 +1,998 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* CORE Weierstrass elliptic curve functions over FP2 */
+/* SU=m, m is Stack Usage */
+
+#include "ecp2_ZZZ.h"
+#include "ecp_ZZZ.h"
+
+using namespace XXX;
+using namespace YYY;
+
+int ZZZ::ECP2_isinf(ECP2 *P)
+{
+    return (FP2_iszilch(&(P->x)) & FP2_iszilch(&(P->z)));
+}
+
+/* Set P=Q */
+/* SU= 16 */
+void ZZZ::ECP2_copy(ECP2 *P, ECP2 *Q)
+{
+    FP2_copy(&(P->x), &(Q->x));
+    FP2_copy(&(P->y), &(Q->y));
+    FP2_copy(&(P->z), &(Q->z));
+}
+
+/* set P to Infinity */
+/* SU= 8 */
+void ZZZ::ECP2_inf(ECP2 *P)
+{
+    FP2_zero(&(P->x));
+    FP2_one(&(P->y));
+    FP2_zero(&(P->z));
+}
+
+/* Conditional move Q to P dependant on d */
+static void ECP2_cmove(ZZZ::ECP2 *P, ZZZ::ECP2 *Q, int d)
+{
+    FP2_cmove(&(P->x), &(Q->x), d);
+    FP2_cmove(&(P->y), &(Q->y), d);
+    FP2_cmove(&(P->z), &(Q->z), d);
+}
+
+/* return 1 if b==c, no branching */
+static int teq(sign32 b, sign32 c)
+{
+    sign32 x = b ^ c;
+    x -= 1; // if x=0, x now -1
+    return (int)((x >> 31) & 1);
+}
+
+/* Constant time select from pre-computed table */
+static void ECP2_select(ZZZ::ECP2 *P, ZZZ::ECP2 W[], sign32 b)
+{
+    ZZZ::ECP2 MP;
+    sign32 m = b >> 31;
+    sign32 babs = (b ^ m) - m;
+
+    babs = (babs - 1) / 2;
+
+    ECP2_cmove(P, &W[0], teq(babs, 0)); // conditional move
+    ECP2_cmove(P, &W[1], teq(babs, 1));
+    ECP2_cmove(P, &W[2], teq(babs, 2));
+    ECP2_cmove(P, &W[3], teq(babs, 3));
+    ECP2_cmove(P, &W[4], teq(babs, 4));
+    ECP2_cmove(P, &W[5], teq(babs, 5));
+    ECP2_cmove(P, &W[6], teq(babs, 6));
+    ECP2_cmove(P, &W[7], teq(babs, 7));
+
+    ECP2_copy(&MP, P);
+    ECP2_neg(&MP);  // minus P
+    ECP2_cmove(P, &MP, (int)(m & 1));
+}
+
+/* return 1 if P==Q, else 0 */
+/* SU= 312 */
+int ZZZ::ECP2_equals(ECP2 *P, ECP2 *Q)
+{
+    FP2 a, b;
+
+    FP2_mul(&a, &(P->x), &(Q->z));
+    FP2_mul(&b, &(Q->x), &(P->z));
+    if (!FP2_equals(&a, &b)) return 0;
+
+    FP2_mul(&a, &(P->y), &(Q->z));
+    FP2_mul(&b, &(Q->y), &(P->z));
+    if (!FP2_equals(&a, &b)) return 0;
+    return 1;
+}
+
+/* Make P affine (so z=1) */
+/* SU= 232 */
+void ZZZ::ECP2_affine(ECP2 *P)
+{
+    FP2 one, iz;
+    if (ECP2_isinf(P)) return;
+
+    FP2_one(&one);
+    if (FP2_isunity(&(P->z)))
+    {
+        FP2_reduce(&(P->x));
+        FP2_reduce(&(P->y));
+        return;
+    }
+
+    FP2_inv(&iz, &(P->z), NULL);
+    FP2_mul(&(P->x), &(P->x), &iz);
+    FP2_mul(&(P->y), &(P->y), &iz);
+
+    FP2_reduce(&(P->x));
+    FP2_reduce(&(P->y));
+    FP2_copy(&(P->z), &one);
+}
+
+/* extract x, y from point P */
+/* SU= 16 */
+int ZZZ::ECP2_get(FP2 *x, FP2 *y, ECP2 *P)
+{
+    ECP2 W;
+    ECP2_copy(&W, P);
+    ECP2_affine(&W);
+    if (ECP2_isinf(&W)) return -1;
+
+    FP2_copy(y, &(W.y));
+    FP2_copy(x, &(W.x));
+    return 0;
+}
+
+/* SU= 152 */
+/* Output point P */
+void ZZZ::ECP2_output(ECP2 *P)
+{
+    FP2 x, y;
+    if (ECP2_isinf(P))
+    {
+        printf("Infinity\n");
+        return;
+    }
+    ECP2_get(&x, &y, P);
+    printf("(");
+    FP2_output(&x);
+    printf(",");
+    FP2_output(&y);
+    printf(")\n");
+}
+
+/* SU= 232 */
+void ZZZ::ECP2_outputxyz(ECP2 *P)
+{
+    ECP2 Q;
+    if (ECP2_isinf(P))
+    {
+        printf("Infinity\n");
+        return;
+    }
+    ECP2_copy(&Q, P);
+    printf("(");
+    FP2_output(&(Q.x));
+    printf(",");
+    FP2_output(&(Q.y));
+    printf(",");
+    FP2_output(&(Q.z));
+    printf(")\n");
+}
+
+/* SU= 168 */
+/* Convert Q to octet string */
+void ZZZ::ECP2_toOctet(octet *W, ECP2 *Q, bool compress)
+{
+    FP2 qx, qy;
+    bool alt=false;
+    ECP2_get(&qx, &qy, Q);
+
+#if (MBITS-1)%8 <= 4
+#ifdef ALLOW_ALT_COMPRESS_ZZZ
+    alt=true;
+#endif
+#endif
+
+    if (alt)
+    {
+        FP2_toBytes(&(W->val[0]),&qx);
+        if (!compress)
+        {
+            W->len=4*MODBYTES_XXX;
+            FP2_toBytes(&(W->val[2*MODBYTES_XXX]), &qy);
+        } else {
+            W->val[0]|=0x80;
+            if (FP2_islarger(&qy)==1) W->val[0]|=0x20;
+            W->len=2*MODBYTES_XXX;
+        }
+    } else {
+        FP2_toBytes(&(W->val[1]),&qx);
+        if (!compress)
+        {
+            W->val[0] = 0x04;
+            FP2_toBytes(&(W->val[2 * MODBYTES_XXX+1]), &qy);
+            W->len = 4 * MODBYTES_XXX + 1;
+        } else {
+            W->val[0]=0x02;
+            if (FP2_sign(&qy)==1) W->val[0] = 0x03;
+            W->len = 2 * MODBYTES_XXX + 1;
+        }
+    }
+}
+/* SU= 176 */
+/* restore Q from octet string */
+int ZZZ::ECP2_fromOctet(ECP2 *Q, octet *W)
+{
+    FP2 qx, qy;
+    bool alt=false;
+    int sgn,cmp,typ = W->val[0];
+
+#if (MBITS-1)%8 <= 4
+#ifdef ALLOW_ALT_COMPRESS_ZZZ
+    alt=true;
+#endif
+#endif
+
+    if (alt)
+    {
+        W->val[0]&=0x1f;
+        FP2_fromBytes(&qx,&(W->val[0]));
+        W->val[0]=typ;
+        if ((typ&0x80)==0)
+        {
+            FP2_fromBytes(&qy,&(W->val[2*MODBYTES_XXX]));
+            if (ECP2_set(Q, &qx, &qy)) return 1;
+            return 0;
+        } else {
+            if (!ECP2_setx(Q,&qx,0)) return 0;
+            sgn=(typ&0x20)>>5;
+            cmp=FP2_islarger(&(Q->y));
+            if ((sgn==1 && cmp!=1) || (sgn==0 && cmp==1)) ECP2_neg(Q);
+            return 1;
+        }
+
+    } else {
+        FP2_fromBytes(&qx,&(W->val[1]));
+        if (typ == 0x04)
+        {
+            FP2_fromBytes(&qy,&(W->val[2 * MODBYTES_XXX+1]));
+            if (ECP2_set(Q, &qx, &qy)) return 1;
+        } else {
+            if (ECP2_setx(Q, &qx, typ&1)) return 1;
+        }
+    }
+    return 0;
+}
+
+/* SU= 128 */
+/* Calculate RHS of twisted curve equation x^3+B/i or x^3+Bi*/
+void ZZZ::ECP2_rhs(FP2 *rhs, FP2 *x)
+{
+    /* calculate RHS of elliptic curve equation */
+    FP2 t;
+    BIG b;
+
+    FP2_sqr(&t, x);
+    FP2_mul(rhs, &t, x);
+
+    /* Assuming CURVE_A=0 */
+
+    BIG_rcopy(b, CURVE_B);
+    FP2_from_BIG(&t, b);
+#if SEXTIC_TWIST_ZZZ == D_TYPE
+    FP2_div_ip(&t);   /* IMPORTANT - here we use the correct SEXTIC twist of the curve */
+#endif
+
+#if SEXTIC_TWIST_ZZZ == M_TYPE
+    FP2_norm(&t);
+    FP2_mul_ip(&t);   /* IMPORTANT - here we use the correct SEXTIC twist of the curve */
+    FP2_norm(&t);
+
+#endif
+
+    FP2_add(rhs, &t, rhs);
+    FP2_reduce(rhs);
+}
+
+
+/* Set P=(x,y). Return 1 if (x,y) is on the curve, else return 0*/
+/* SU= 232 */
+int ZZZ::ECP2_set(ECP2 *P, FP2 *x, FP2 *y)
+{
+    FP2 rhs, y2;
+    FP2_sqr(&y2, y);
+    ECP2_rhs(&rhs, x);
+
+    if (!FP2_equals(&y2, &rhs))
+    {
+        ECP2_inf(P);
+        return 0;
+    }
+
+    FP2_copy(&(P->x), x);
+    FP2_copy(&(P->y), y);
+
+    FP2_one(&(P->z));
+    return 1;
+}
+
+/* Set P=(x,y). Return 1 if (x,.) is on the curve, else return 0 */
+/* SU= 232 */
+int ZZZ::ECP2_setx(ECP2 *P, FP2 *x, int s)
+{
+    FP2 y;
+    FP hint;
+    ECP2_rhs(&y, x);
+
+    if (!FP2_qr(&y,&hint))
+    {
+        ECP2_inf(P);
+        return 0;
+    }
+
+    FP2_sqrt(&y,&y,&hint);
+
+    FP2_copy(&(P->x), x);
+    FP2_copy(&(P->y), &y);
+    FP2_one(&(P->z));
+
+    if (FP2_sign(&(P->y)) != s)
+        FP2_neg(&(P->y),&(P->y));
+    FP2_reduce(&(P->y));
+    return 1;
+}
+
+/* Set P=-P */
+/* SU= 8 */
+void ZZZ::ECP2_neg(ECP2 *P)
+{
+    FP2_norm(&(P->y));
+    FP2_neg(&(P->y), &(P->y));
+    FP2_norm(&(P->y));
+}
+
+/* R+=R */
+/* return -1 for Infinity, 0 for addition, 1 for doubling */
+/* SU= 448 */
+int ZZZ::ECP2_dbl(ECP2 *P)
+{
+    FP2 t0, t1, t2, iy, x3, y3;
+
+    FP2_copy(&iy, &(P->y));     //FP2 iy=new FP2(y);
+#if SEXTIC_TWIST_ZZZ==D_TYPE
+    FP2_mul_ip(&iy);            //iy.mul_ip();
+    FP2_norm(&iy);              //iy.norm();
+#endif
+    FP2_sqr(&t0, &(P->y));          //t0.sqr();
+#if SEXTIC_TWIST_ZZZ==D_TYPE
+    FP2_mul_ip(&t0);            //t0.mul_ip();
+#endif
+    FP2_mul(&t1, &iy, &(P->z)); //t1.mul(z);
+    FP2_sqr(&t2, &(P->z));              //t2.sqr();
+
+    FP2_add(&(P->z), &t0, &t0); //z.add(t0);
+    FP2_norm(&(P->z));              //z.norm();
+    FP2_add(&(P->z), &(P->z), &(P->z)); //z.add(z);
+    FP2_add(&(P->z), &(P->z), &(P->z)); //z.add(z);
+    FP2_norm(&(P->z));          //z.norm();
+
+    FP2_imul(&t2, &t2, 3 * CURVE_B_I); //t2.imul(3*ROM.CURVE_B_I);
+#if SEXTIC_TWIST_ZZZ==M_TYPE
+    FP2_mul_ip(&t2);
+    FP2_norm(&t2);
+#endif
+
+    FP2_mul(&x3, &t2, &(P->z)); //x3.mul(z);
+
+    FP2_add(&y3, &t0, &t2);     //y3.add(t2);
+    FP2_norm(&y3);              //y3.norm();
+    FP2_mul(&(P->z), &(P->z), &t1); //z.mul(t1);
+
+    FP2_add(&t1, &t2, &t2);     //t1.add(t2);
+    FP2_add(&t2, &t2, &t1);     //t2.add(t1);
+    FP2_norm(&t2);              //t2.norm();
+    FP2_sub(&t0, &t0, &t2);     //t0.sub(t2);
+    FP2_norm(&t0);              //t0.norm();                           //y^2-9bz^2
+    FP2_mul(&y3, &y3, &t0);     //y3.mul(t0);
+    FP2_add(&(P->y), &y3, &x3);     //y3.add(x3);                      //(y^2+3z*2)(y^2-9z^2)+3b.z^2.8y^2
+    FP2_mul(&t1, &(P->x), &iy);     //t1.mul(iy);
+
+    FP2_norm(&t0);          //x.norm();
+    FP2_mul(&(P->x), &t0, &t1); //x.mul(t1);
+    FP2_add(&(P->x), &(P->x), &(P->x)); //x.add(x);       //(y^2-9bz^2)xy2
+
+    FP2_norm(&(P->x));          //x.norm();
+    FP2_norm(&(P->y));          //y.norm();
+
+    return 1;
+}
+
+/* Set P+=Q */
+/* SU= 400 */
+int ZZZ::ECP2_add(ECP2 *P, ECP2 *Q)
+{
+    FP2 t0, t1, t2, t3, t4, x3, y3, z3;
+    int b3 = 3 * CURVE_B_I;
+
+    FP2_mul(&t0, &(P->x), &(Q->x)); //t0.mul(Q.x);         // x.Q.x
+    FP2_mul(&t1, &(P->y), &(Q->y)); //t1.mul(Q.y);       // y.Q.y
+
+    FP2_mul(&t2, &(P->z), &(Q->z)); //t2.mul(Q.z);
+
+    FP2_add(&t3, &(P->x), &(P->y)); //t3.add(y);
+    FP2_norm(&t3);              //t3.norm();          //t3=X1+Y1
+    FP2_add(&t4, &(Q->x), &(Q->y)); //t4.add(Q.y);
+    FP2_norm(&t4);              //t4.norm();            //t4=X2+Y2
+    FP2_mul(&t3, &t3, &t4);     //t3.mul(t4);                       //t3=(X1+Y1)(X2+Y2)
+
+    FP2_add(&t4, &t0, &t1);     //t4.add(t1);       //t4=X1.X2+Y1.Y2
+
+    FP2_sub(&t3, &t3, &t4);     //t3.sub(t4);
+    FP2_norm(&t3);              //t3.norm();
+#if SEXTIC_TWIST_ZZZ==D_TYPE
+    FP2_mul_ip(&t3);            //t3.mul_ip();
+    FP2_norm(&t3);              //t3.norm();         //t3=(X1+Y1)(X2+Y2)-(X1.X2+Y1.Y2) = X1.Y2+X2.Y1
+#endif
+    FP2_add(&t4, &(P->y), &(P->z)); //t4.add(z);
+    FP2_norm(&t4);              //t4.norm();            //t4=Y1+Z1
+    FP2_add(&x3, &(Q->y), &(Q->z)); //x3.add(Q.z);
+    FP2_norm(&x3);              //x3.norm();            //x3=Y2+Z2
+
+    FP2_mul(&t4, &t4, &x3);     //t4.mul(x3);                       //t4=(Y1+Z1)(Y2+Z2)
+    FP2_add(&x3, &t1, &t2);     //x3.add(t2);                       //X3=Y1.Y2+Z1.Z2
+
+    FP2_sub(&t4, &t4, &x3);     //t4.sub(x3);
+    FP2_norm(&t4);              //t4.norm();
+#if SEXTIC_TWIST_ZZZ==D_TYPE
+    FP2_mul_ip(&t4);            //t4.mul_ip();
+    FP2_norm(&t4);              //t4.norm();          //t4=(Y1+Z1)(Y2+Z2) - (Y1.Y2+Z1.Z2) = Y1.Z2+Y2.Z1
+#endif
+    FP2_add(&x3, &(P->x), &(P->z)); //x3.add(z);
+    FP2_norm(&x3);              //x3.norm();    // x3=X1+Z1
+    FP2_add(&y3, &(Q->x), &(Q->z)); //y3.add(Q.z);
+    FP2_norm(&y3);              //y3.norm();                // y3=X2+Z2
+    FP2_mul(&x3, &x3, &y3);     //x3.mul(y3);                           // x3=(X1+Z1)(X2+Z2)
+    FP2_add(&y3, &t0, &t2);     //y3.add(t2);                           // y3=X1.X2+Z1+Z2
+    FP2_sub(&y3, &x3, &y3);     //y3.rsub(x3);
+    FP2_norm(&y3);              //y3.norm();                // y3=(X1+Z1)(X2+Z2) - (X1.X2+Z1.Z2) = X1.Z2+X2.Z1
+#if SEXTIC_TWIST_ZZZ==D_TYPE
+    FP2_mul_ip(&t0);            //t0.mul_ip();
+    FP2_norm(&t0);              //t0.norm(); // x.Q.x
+    FP2_mul_ip(&t1);            //t1.mul_ip();
+    FP2_norm(&t1);              //t1.norm(); // y.Q.y
+#endif
+
+    FP2_add(&x3, &t0, &t0);     //x3.add(t0);
+    FP2_add(&t0, &t0, &x3);     //t0.add(x3);
+    FP2_norm(&t0);              //t0.norm();
+    FP2_imul(&t2, &t2, b3);     //t2.imul(b);
+#if SEXTIC_TWIST_ZZZ==M_TYPE
+    FP2_mul_ip(&t2);
+    FP2_norm(&t2);
+#endif
+
+    FP2_add(&z3, &t1, &t2);     //z3.add(t2);
+    FP2_norm(&z3);              //z3.norm();
+    FP2_sub(&t1, &t1, &t2);     //t1.sub(t2);
+    FP2_norm(&t1);              //t1.norm();
+
+    FP2_imul(&y3, &y3, b3);     //y3.imul(b);
+#if SEXTIC_TWIST_ZZZ==M_TYPE
+    FP2_mul_ip(&y3);
+    FP2_norm(&y3);
+#endif
+
+    FP2_mul(&x3, &y3, &t4);     //x3.mul(t4);
+    FP2_mul(&t2, &t3, &t1);     //t2.mul(t1);
+    FP2_sub(&(P->x), &t2, &x3);     //x3.rsub(t2);
+    FP2_mul(&y3, &y3, &t0);     //y3.mul(t0);
+    FP2_mul(&t1, &t1, &z3);     //t1.mul(z3);
+    FP2_add(&(P->y), &y3, &t1);     //y3.add(t1);
+
+    FP2_mul(&t0, &t0, &t3);     //t0.mul(t3);
+    FP2_mul(&z3, &z3, &t4);     //z3.mul(t4);
+    FP2_add(&(P->z), &z3, &t0);     //z3.add(t0);
+
+    FP2_norm(&(P->x));          //x.norm();
+    FP2_norm(&(P->y));          //y.norm();
+    FP2_norm(&(P->z));          //z.norm();
+
+    return 0;
+}
+
+/* Set P-=Q */
+/* SU= 16 */
+void ZZZ::ECP2_sub(ECP2 *P, ECP2 *Q)
+{
+    ECP2 NQ;
+    ECP2_copy(&NQ, Q);
+    ECP2_neg(&NQ);
+    ECP2_add(P, &NQ);
+}
+
+/* P*=e */
+/* SU= 280 */
+void ZZZ::ECP2_mul(ECP2 *P, BIG e)
+{
+    /* fixed size windows */
+    int i, nb, s, ns;
+    BIG mt, t;
+    ECP2 Q, W[8], C;
+    sign8 w[1 + (NLEN_XXX * BASEBITS_XXX + 3) / 4];
+
+    if (ECP2_isinf(P)) return;
+
+    /* precompute table */
+
+    ECP2_copy(&Q, P);
+    ECP2_dbl(&Q);
+    ECP2_copy(&W[0], P);
+
+    for (i = 1; i < 8; i++)
+    {
+        ECP2_copy(&W[i], &W[i - 1]);
+        ECP2_add(&W[i], &Q);
+    }
+
+    /* make exponent odd - add 2P if even, P if odd */
+    BIG_copy(t, e);
+    s = BIG_parity(t);
+    BIG_inc(t, 1);
+    BIG_norm(t);
+    ns = BIG_parity(t);
+    BIG_copy(mt, t);
+    BIG_inc(mt, 1);
+    BIG_norm(mt);
+    BIG_cmove(t, mt, s);
+    ECP2_cmove(&Q, P, ns);
+    ECP2_copy(&C, &Q);
+
+    nb = 1 + (BIG_nbits(t) + 3) / 4;
+
+    /* convert exponent to signed 4-bit window */
+    for (i = 0; i < nb; i++)
+    {
+        w[i] = BIG_lastbits(t, 5) - 16;
+        BIG_dec(t, w[i]);
+        BIG_norm(t);
+        BIG_fshr(t, 4);
+    }
+    w[nb] = BIG_lastbits(t, 5);
+
+    //ECP2_copy(P, &W[(w[nb] - 1) / 2]);
+    ECP2_select(P, W, w[nb]);
+    for (i = nb - 1; i >= 0; i--)
+    {
+        ECP2_select(&Q, W, w[i]);
+        ECP2_dbl(P);
+        ECP2_dbl(P);
+        ECP2_dbl(P);
+        ECP2_dbl(P);
+        ECP2_add(P, &Q);
+    }
+    ECP2_sub(P, &C); /* apply correction */
+}
+
+/* Calculates q.P using Frobenius constant X */
+/* SU= 96 */
+void ZZZ::ECP2_frob(ECP2 *P, FP2 *X)
+{
+    FP2 X2;
+    FP2_sqr(&X2, X);
+    FP2_conj(&(P->x), &(P->x));
+    FP2_conj(&(P->y), &(P->y));
+    FP2_conj(&(P->z), &(P->z));
+    FP2_reduce(&(P->z));
+    FP2_mul(&(P->x), &X2, &(P->x));
+    FP2_mul(&(P->y), &X2, &(P->y));
+    FP2_mul(&(P->y), X, &(P->y));
+}
+
+// Bos & Costello https://eprint.iacr.org/2013/458.pdf
+// Faz-Hernandez & Longa & Sanchez  https://eprint.iacr.org/2013/158.pdf
+// Side channel attack secure
+
+void ZZZ::ECP2_mul4(ECP2 *P, ECP2 Q[4], BIG u[4])
+{
+    int i, j, k, nb, pb, bt;
+    ECP2 T[8], W;
+    BIG t[4], mt;
+    sign8 w[NLEN_XXX * BASEBITS_XXX + 1];
+    sign8 s[NLEN_XXX * BASEBITS_XXX + 1];
+
+    for (i = 0; i < 4; i++)
+    {
+        BIG_copy(t[i], u[i]);
+    }
+
+// Precomputed table
+    ECP2_copy(&T[0], &Q[0]); // Q[0]
+    ECP2_copy(&T[1], &T[0]);
+    ECP2_add(&T[1], &Q[1]); // Q[0]+Q[1]
+    ECP2_copy(&T[2], &T[0]);
+    ECP2_add(&T[2], &Q[2]); // Q[0]+Q[2]
+    ECP2_copy(&T[3], &T[1]);
+    ECP2_add(&T[3], &Q[2]); // Q[0]+Q[1]+Q[2]
+    ECP2_copy(&T[4], &T[0]);
+    ECP2_add(&T[4], &Q[3]); // Q[0]+Q[3]
+    ECP2_copy(&T[5], &T[1]);
+    ECP2_add(&T[5], &Q[3]); // Q[0]+Q[1]+Q[3]
+    ECP2_copy(&T[6], &T[2]);
+    ECP2_add(&T[6], &Q[3]); // Q[0]+Q[2]+Q[3]
+    ECP2_copy(&T[7], &T[3]);
+    ECP2_add(&T[7], &Q[3]); // Q[0]+Q[1]+Q[2]+Q[3]
+
+// Make it odd
+    pb = 1 - BIG_parity(t[0]);
+    BIG_inc(t[0], pb);
+    BIG_norm(t[0]);
+
+// Number of bits
+    BIG_zero(mt);
+    for (i = 0; i < 4; i++)
+    {
+        BIG_or(mt, mt, t[i]);
+    }
+    nb = 1 + BIG_nbits(mt);
+
+// Sign pivot
+    s[nb - 1] = 1;
+    for (i = 0; i < nb - 1; i++)
+    {
+        BIG_fshr(t[0], 1);
+        s[i] = 2 * BIG_parity(t[0]) - 1;
+    }
+
+// Recoded exponent
+    for (i = 0; i < nb; i++)
+    {
+        w[i] = 0;
+        k = 1;
+        for (j = 1; j < 4; j++)
+        {
+            bt = s[i] * BIG_parity(t[j]);
+            BIG_fshr(t[j], 1);
+
+            BIG_dec(t[j], (bt >> 1));
+            BIG_norm(t[j]);
+            w[i] += bt * k;
+            k *= 2;
+        }
+    }
+
+// Main loop
+    ECP2_select(P, T, 2 * w[nb - 1] + 1);
+    for (i = nb - 2; i >= 0; i--)
+    {
+        ECP2_select(&W, T, 2 * w[i] + s[i]);
+        ECP2_dbl(P);
+        ECP2_add(P, &W);
+    }
+
+// apply correction
+    ECP2_copy(&W, P);
+    ECP2_sub(&W, &Q[0]);
+    ECP2_cmove(P, &W, pb);
+}
+
+/* Hunt and Peck a BIG to G2 curve point */
+/*
+void ZZZ::ECP2_hap2point(ECP2 *Q,BIG h)
+{
+    BIG one,hv;
+    FP2 X;
+    BIG_one(one);
+    BIG_copy(hv,h);
+    for (;;)
+    {
+        FP2_from_BIGs(&X,one,hv);
+        if (ECP2_setx(Q,&X,0)) break;
+        BIG_inc(hv,1);
+        BIG_norm(hv);
+    }
+}
+*/
+
+/* Constant time Map FP2 to Point in G2 */
+void ZZZ::ECP2_map2point(ECP2 *Q,FP2 *H)
+{
+// SSWU plus isogenies method
+    int i,k,sgn,ne,isox,isoy,iso=HTC_ISO_G2_ZZZ;
+    FP2 X1,X2,X3,W,Y,T,A,NY;
+    FP s;
+#if HTC_ISO_G2_ZZZ != 0
+    FP hint;
+    FP2 ZZ,Ad,Bd,D,D2,GX1;
+    FP2 xnum,xden,ynum,yden;
+    FP2_from_ints(&ZZ,RIADZG2A_ZZZ,RIADZG2B_ZZZ);
+
+    FP2_rcopy(&Ad,CURVE_Adr,CURVE_Adi);
+    FP2_rcopy(&Bd,CURVE_Bdr,CURVE_Bdi);
+
+    FP2_one(&NY);
+    FP2_copy(&T,H);
+    sgn=FP2_sign(&T);
+
+    FP2_sqr(&T,&T);
+    FP2_mul(&T,&T,&ZZ);
+    FP2_add(&W,&T,&NY);
+    FP2_norm(&W);
+
+    FP2_mul(&W,&W,&T);
+    FP2_mul(&D,&Ad,&W);
+
+    FP2_add(&W,&W,&NY);
+    FP2_norm(&W);
+    FP2_mul(&W,&W,&Bd);
+    FP2_neg(&W,&W);
+    FP2_norm(&W);
+
+    FP2_copy(&X2,&W);        // Numerators
+    FP2_mul(&X3,&T,&X2);
+
+// x^3+Ad^2x+Bd^3
+    FP2_sqr(&GX1,&X2);
+    FP2_sqr(&D2,&D); FP2_mul(&W,&Ad,&D2); FP2_add(&GX1,&GX1,&W); FP2_norm(&GX1); FP2_mul(&GX1,&GX1,&X2); FP2_mul(&D2,&D2,&D); FP2_mul(&W,&Bd,&D2); FP2_add(&GX1,&GX1,&W); FP2_norm(&GX1);
+
+    FP2_mul(&W,&GX1,&D);
+    int qr=FP2_qr(&W,&hint);   // qr(ad) - only exp happens here
+    FP2_inv(&D,&W,&hint);     // d=1/(ad)
+    FP2_mul(&D,&D,&GX1);     // 1/d
+    FP2_mul(&X2,&X2,&D);     // X2/=D
+    FP2_mul(&X3,&X3,&D);     // X3/=D
+    FP2_mul(&T,&T,H);        // t=Z.u^3
+    FP2_sqr(&D2,&D);
+
+// first solution - X2, W, hint, D2
+
+    FP2_mul(&D,&D2,&T);     // second candidate if X3 is correct
+    FP2_mul(&T,&W,&ZZ); 
+
+    FP_rcopy(&s,CURVE_HTPC2);     
+    FP_mul(&s,&s,&hint); // modify hint
+
+    FP2_cmove(&X2,&X3,1-qr); 
+    FP2_cmove(&W,&T,1-qr);
+    FP2_cmove(&D2,&D,1-qr);
+    FP_cmove(&hint,&s,1-qr);
+
+    FP2_sqrt(&Y,&W,&hint);  // first candidate if X2 is correct
+    FP2_mul(&Y,&Y,&D2);
+
+    ne=FP2_sign(&Y)^sgn;
+    FP2_neg(&NY,&Y); FP2_norm(&NY);
+    FP2_cmove(&Y,&NY,ne);
+
+// (X2,Y) is on isogenous curve
+
+    k=0;
+    isox=iso;
+    isoy=3*(iso-1)/2;
+
+// xnum
+    FP2_rcopy(&xnum,PCR[k],PCI[k]); k++;
+    for (i=0;i<isox;i++)
+    {
+        FP2_mul(&xnum,&xnum,&X2); 
+        FP2_rcopy(&W,PCR[k],PCI[k]); k++;
+        FP2_add(&xnum,&xnum,&W); FP2_norm(&xnum);
+    }
+
+// xden
+    FP2_copy(&xden,&X2);
+    FP2_rcopy(&W,PCR[k],PCI[k]); k++;
+    FP2_add(&xden,&xden,&W); FP2_norm(&xden);
+    for (i=0;i<isox-2;i++)
+    {
+        FP2_mul(&xden,&xden,&X2);
+        FP2_rcopy(&W,PCR[k],PCI[k]); k++;
+        FP2_add(&xden,&xden,&W); FP2_norm(&xden);
+    }
+
+// ynum
+        FP2_rcopy(&ynum,PCR[k],PCI[k]); k++;
+        for (i=0;i<isoy;i++)
+        {
+            FP2_mul(&ynum,&ynum,&X2); 
+            FP2_rcopy(&W,PCR[k],PCI[k]); k++;
+            FP2_add(&ynum,&ynum,&W); FP2_norm(&ynum);
+        }
+
+// yden 
+        FP2_copy(&yden,&X2);
+        FP2_rcopy(&W,PCR[k],PCI[k]); k++;
+        FP2_add(&yden,&yden,&W); FP2_norm(&yden);
+      
+        for (i=0;i<isoy-1;i++)
+        {
+            FP2_mul(&yden,&yden,&X2); 
+            FP2_rcopy(&W,PCR[k],PCI[k]); k++;
+            FP2_add(&yden,&yden,&W); FP2_norm(&yden);
+        }
+
+        FP2_mul(&ynum,&ynum,&Y);
+
+        FP2_mul(&T,&xnum,&yden);
+        FP2_copy(&(Q->x),&T);
+
+        FP2_mul(&T,&ynum,&xden);
+        FP2_copy(&(Q->y),&T);
+
+        FP2_mul(&T,&xden,&yden);
+        FP2_copy(&(Q->z),&T);
+
+#else
+// SVDW - Shallue and van de Woestijne method.
+    FP Z;
+    FP2_one(&NY);
+    FP2_copy(&T,H);
+    sgn=FP2_sign(&T);
+
+    FP_from_int(&Z,RIADZG2A_YYY);
+    FP2_from_FP(&A,&Z);
+    ECP2_rhs(&A,&A);  // A=g(Z)
+
+    if (CURVE_B_I==4 && SEXTIC_TWIST_ZZZ==M_TYPE && RIADZG2A_YYY==-1 && RIADZG2B_YYY==0)
+    { // special case for BLS12381
+        FP2_from_ints(&W,2,1);
+    } else {
+        FP2_sqrt(&W,&A,NULL);   // sqrt(g(Z))
+    }
+    FP_rcopy(&s,SQRTm3);
+
+    FP_mul(&Z,&Z,&s);     // Z.sqrt(-3)
+
+    FP2_sqr(&T,&T);
+    FP2_mul(&Y,&A,&T);   // tv1=u^2*g(Z)
+    FP2_add(&T,&NY,&Y); FP2_norm(&T); // tv2=1+tv1
+    FP2_sub(&Y,&NY,&Y); FP2_norm(&Y); // tv1=1-tv1
+    FP2_mul(&NY,&T,&Y);
+
+    FP2_pmul(&NY,&NY,&Z);
+    FP2_inv(&NY,&NY,NULL);     // tv3=inv0(tv1*tv2*Z*sqrt(-3))
+
+    FP2_pmul(&W,&W,&Z); // tv4=Z*sqrt(-3).sqrt(g(Z))
+    if (FP2_sign(&W)==1)
+    {
+        FP2_neg(&W,&W);
+        FP2_norm(&W);
+    }
+    FP2_pmul(&W,&W,&Z);
+    FP2_mul(&W,&W,H);
+    FP2_mul(&W,&W,&Y);
+    FP2_mul(&W,&W,&NY);     // tv5=u*tv1*tv3*tv4*Z*sqrt(-3)
+   
+    FP2_from_ints(&X1,RIADZG2A_YYY,RIADZG2B_YYY);
+    FP2_copy(&X3,&X1);
+    FP2_neg(&X1,&X1); FP2_norm(&X1); FP2_div2(&X1,&X1); // -Z/2
+    FP2_copy(&X2,&X1);
+    FP2_sub(&X1,&X1,&W); FP2_norm(&X1);
+    FP2_add(&X2,&X2,&W); FP2_norm(&X2);
+    FP2_add(&A,&A,&A);
+    FP2_add(&A,&A,&A);
+    FP2_norm(&A);      // 4*g(Z)
+    FP2_sqr(&T,&T);
+    FP2_mul(&T,&T,&NY);
+    FP2_sqr(&T,&T);    // (tv2^2*tv3)^2
+    FP2_mul(&A,&A,&T); // 4*g(Z)*(tv2^2*tv3)^2
+    FP2_add(&X3,&X3,&A); FP2_norm(&X3);
+
+    ECP2_rhs(&W,&X2);
+    FP2_cmove(&X3,&X2,FP2_qr(&W,NULL));
+    ECP2_rhs(&W,&X1);
+    FP2_cmove(&X3,&X1,FP2_qr(&W,NULL));
+    ECP2_rhs(&W,&X3);
+    FP2_sqrt(&Y,&W,NULL);
+
+    ne=FP2_sign(&Y)^sgn;
+    FP2_neg(&W,&Y); FP2_norm(&W);
+    FP2_cmove(&Y,&W,ne);
+
+    ECP2_set(Q,&X3,&Y);
+#endif
+}
+
+/* Map octet to point on G2 */
+/*
+void ZZZ::ECP2_mapit(ECP2 *Q, octet *W)
+{
+    BIG q, x;
+    DBIG dx;
+    BIG_rcopy(q, Modulus);
+
+    BIG_dfromBytesLen(dx,W->val,W->len);
+    BIG_dmod(x,dx,q);
+
+    ECP2_hap2point(Q,x);
+    ECP2_cfp(Q);
+}
+*/
+/* cofactor product */
+void ZZZ::ECP2_cfp(ECP2 *Q)
+{
+//    FP Fx, Fy;
+    FP2 X;
+    BIG x;
+#if (PAIRING_FRIENDLY_ZZZ == BN_CURVE)
+    ECP2 T, K;
+#elif (PAIRING_FRIENDLY_ZZZ > BN_CURVE)
+    ECP2 xQ, x2Q;
+#endif
+//    FP_rcopy(&Fx, Fra);
+//    FP_rcopy(&Fy, Frb);
+//    FP2_from_FPs(&X, &Fx, &Fy);
+
+    FP2_rcopy(&X,Fra,Frb);
+
+#if SEXTIC_TWIST_ZZZ==M_TYPE
+    FP2_inv(&X, &X,NULL);
+    FP2_norm(&X);
+#endif
+
+    BIG_rcopy(x, CURVE_Bnx);
+
+#if (PAIRING_FRIENDLY_ZZZ == BN_CURVE)
+
+    // Faster Hashing to G2 - Fuentes-Castaneda, Knapp and Rodriguez-Henriquez
+    // Q -> xQ + F(3xQ) + F(F(xQ)) + F(F(F(Q))).
+    ECP2_copy(&T, Q);
+    ECP2_mul(&T, x);
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    ECP2_neg(&T);   // our x is negative
+#endif
+    ECP2_copy(&K, &T);
+    ECP2_dbl(&K);
+    ECP2_add(&K, &T);
+
+    ECP2_frob(&K, &X);
+    ECP2_frob(Q, &X);
+    ECP2_frob(Q, &X);
+    ECP2_frob(Q, &X);
+    ECP2_add(Q, &T);
+    ECP2_add(Q, &K);
+    ECP2_frob(&T, &X);
+    ECP2_frob(&T, &X);
+    ECP2_add(Q, &T);
+#elif (PAIRING_FRIENDLY_ZZZ > BN_CURVE)
+
+    // Efficient hash maps to G2 on BLS curves - Budroni, Pintore
+    // Q -> x2Q -xQ -Q +F(xQ -Q) +F(F(2Q))
+
+    ECP2_copy(&xQ, Q);
+    ECP2_mul(&xQ, x);
+    ECP2_copy(&x2Q, &xQ);
+    ECP2_mul(&x2Q, x);
+
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    ECP2_neg(&xQ);
+#endif
+
+    ECP2_sub(&x2Q, &xQ);
+    ECP2_sub(&x2Q, Q);
+
+    ECP2_sub(&xQ, Q);
+    ECP2_frob(&xQ, &X);
+
+    ECP2_dbl(Q);
+    ECP2_frob(Q, &X);
+    ECP2_frob(Q, &X);
+
+    ECP2_add(Q, &x2Q);
+    ECP2_add(Q, &xQ);
+
+#endif
+}
+
+int ZZZ::ECP2_generator(ECP2 *G)
+{
+    FP2 wx, wy;
+    FP2_rcopy(&wx,CURVE_Pxa,CURVE_Pxb);
+    FP2_rcopy(&wy,CURVE_Pya,CURVE_Pyb);
+//    FP_rcopy(&(wx.a), CURVE_Pxa);
+//    FP_rcopy(&(wx.b), CURVE_Pxb);
+//    FP_rcopy(&(wy.a), CURVE_Pya);
+//    FP_rcopy(&(wy.b), CURVE_Pyb);
+    return ECP2_set(G, &wx, &wy);
+}
+
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp2.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp2.h
new file mode 100644
index 0000000..d4daa30
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp2.h
@@ -0,0 +1,249 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP2_ZZZ_H
+#define ECP2_ZZZ_H
+
+#include "fp2_YYY.h"
+#include "config_curve_ZZZ.h"
+
+using namespace core;
+
+
+namespace YYY {
+
+extern const XXX::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const XXX::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+}
+
+namespace ZZZ {
+
+/**
+	@brief ECP2 Structure - Elliptic Curve Point over quadratic extension field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag */
+    YYY::FP2 x;   /**< x-coordinate of point */
+    YYY::FP2 y;   /**< y-coordinate of point */
+    YYY::FP2 z;   /**< z-coordinate of point */
+} ECP2;
+
+
+/* Curve Params - see rom*.cpp */
+
+extern const int CURVE_B_I;		/**< Elliptic curve B parameter */
+extern const XXX::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const XXX::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const XXX::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const XXX::BIG CURVE_Bnx;   /**< Elliptic curve parameter */
+extern const XXX::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+
+/* Generator point on G1 */
+extern const XXX::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const XXX::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const XXX::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+/* ECP2 E(Fp2) prototypes */
+/**	@brief Tests for ECP2 point equal to infinity
+ *
+	@param P ECP2 point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP2_isinf(ECP2 *P);
+/**	@brief Copy ECP2 point to another ECP2 point
+ *
+	@param P ECP2 instance, on exit = Q
+	@param Q ECP2 instance to be copied
+ */
+extern void ECP2_copy(ECP2 *P, ECP2 *Q);
+/**	@brief Set ECP2 to point-at-infinity
+ *
+	@param P ECP2 instance to be set to infinity
+ */
+extern void ECP2_inf(ECP2 *P);
+/**	@brief Tests for equality of two ECP2s
+ *
+	@param P ECP2 instance to be compared
+	@param Q ECP2 instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP2_equals(ECP2 *P, ECP2 *Q);
+/**	@brief Converts an ECP2 point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP2 instance to be converted to affine form
+ */
+extern void ECP2_affine(ECP2 *P);
+/**	@brief Extract x and y coordinates of an ECP2 point P
+ *
+	If x=y, returns only x
+	@param x FP2 on exit = x coordinate of point
+	@param y FP2 on exit = y coordinate of point (unless x=y)
+	@param P ECP2 instance (x,y)
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP2_get(YYY::FP2 *x, YYY::FP2 *y, ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, converted to affine coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_output(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, in projective coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_outputxyz(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to an octet string
+ *
+	The octet string is created in the form x|y or just x if compressed
+	Convert the real and imaginary parts of the x and y coordinates to big-endian base 256 form.
+    If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param S output octet string
+	@param P ECP2 instance to be converted to an octet string
+    @param c true for compression
+ */
+extern void ECP2_toOctet(octet *S, ECP2 *P, bool c);
+/**	@brief Creates an ECP2 point from an octet string
+ *
+	The octet string is in the form x|y
+	The real and imaginary parts of the x and y coordinates are in big-endian base 256 form.
+    If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP2 instance to be created from the octet string
+	@param S input octet string
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP2_fromOctet(ECP2 *P, octet *S);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x)=x^3+Ax+B
+	Used internally.
+	@param r FP2 value of f(x)
+	@param x FP2 instance
+ */
+extern void ECP2_rhs(YYY::FP2 *r, YYY::FP2 *x);
+/**	@brief Set ECP2 to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP2 instance to be set (x,y)
+	@param x FP2 x coordinate of point
+	@param y FP2 y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_set(ECP2 *P, YYY::FP2 *x, YYY::FP2 *y);
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Otherwise y coordinate is calculated from x.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+    @param s sign of y
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_setx(ECP2 *P, YYY::FP2 *x, int s);
+/**	@brief Negation of an ECP2 point
+ *
+	@param P ECP2 instance, on exit = -P
+ */
+extern void ECP2_neg(ECP2 *P);
+/**	@brief Doubles an ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =2*P
+ */
+extern int ECP2_dbl(ECP2 *P);
+/**	@brief Adds ECP2 instance Q to ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P+Q
+	@param Q ECP2 instance to be added to P
+ */
+extern int ECP2_add(ECP2 *P, ECP2 *Q);
+/**	@brief Subtracts ECP instance Q from ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P-Q
+	@param Q ECP2 instance to be subtracted from P
+ */
+extern void ECP2_sub(ECP2 *P, ECP2 *Q);
+/**	@brief Multiplies an ECP2 instance P by a BIG, side-channel resistant
+ *
+	Uses fixed sized windows.
+	@param P ECP2 instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP2_mul(ECP2 *P, XXX::BIG b);
+/**	@brief Multiplies an ECP2 instance P by the internal modulus p, using precalculated Frobenius constant f
+ *
+	Fast point multiplication using Frobenius
+	@param P ECP2 instance, on exit = p*P
+	@param f FP2 precalculated Frobenius constant
+
+ */
+extern void ECP2_frob(ECP2 *P, YYY::FP2 *f);
+/**	@brief Calculates P=b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+ *
+	@param P ECP2 instance, on exit = b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+	@param Q ECP2 array of 4 points
+	@param b BIG array of 4 multipliers
+ */
+extern void ECP2_mul4(ECP2 *P, ECP2 *Q, XXX::BIG *b);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP2 multiplied by co-factor
+ */
+extern void ECP2_cfp(ECP2 *Q);
+
+/**	@brief Maps random FP2 to curve point in constant time
+ *
+	@param Q ECP2 instance 
+	@param x FP2 derived from hash
+ */
+extern void ECP2_map2point(ECP2 *Q, YYY::FP2 *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP2 instance 
+	@param x Fp derived from hash
+ */
+extern void ECP2_hap2point(ECP2 *Q, XXX::BIG  x);
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param P ECP2 instance of correct order
+	@param W OCTET byte array to be mapped
+ */
+extern void ECP2_mapit(ECP2 *P, octet *w);
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP2 instance
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_generator(ECP2 *G);
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp2_BLS12381.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp2_BLS12381.h
new file mode 100644
index 0000000..0e31bcb
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp2_BLS12381.h
@@ -0,0 +1,249 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP2_BLS12381_H
+#define ECP2_BLS12381_H
+
+#include "fp2_BLS12381.h"
+#include "config_curve_BLS12381.h"
+
+using namespace core;
+
+
+namespace BLS12381 {
+
+extern const B384_58::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B384_58::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+}
+
+namespace BLS12381 {
+
+/**
+	@brief ECP2 Structure - Elliptic Curve Point over quadratic extension field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag */
+    BLS12381::FP2 x;   /**< x-coordinate of point */
+    BLS12381::FP2 y;   /**< y-coordinate of point */
+    BLS12381::FP2 z;   /**< z-coordinate of point */
+} ECP2;
+
+
+/* Curve Params - see rom*.cpp */
+
+extern const int CURVE_B_I;		/**< Elliptic curve B parameter */
+extern const B384_58::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B384_58::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B384_58::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B384_58::BIG CURVE_Bnx;   /**< Elliptic curve parameter */
+extern const B384_58::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+
+/* Generator point on G1 */
+extern const B384_58::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B384_58::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B384_58::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+/* ECP2 E(Fp2) prototypes */
+/**	@brief Tests for ECP2 point equal to infinity
+ *
+	@param P ECP2 point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP2_isinf(ECP2 *P);
+/**	@brief Copy ECP2 point to another ECP2 point
+ *
+	@param P ECP2 instance, on exit = Q
+	@param Q ECP2 instance to be copied
+ */
+extern void ECP2_copy(ECP2 *P, ECP2 *Q);
+/**	@brief Set ECP2 to point-at-infinity
+ *
+	@param P ECP2 instance to be set to infinity
+ */
+extern void ECP2_inf(ECP2 *P);
+/**	@brief Tests for equality of two ECP2s
+ *
+	@param P ECP2 instance to be compared
+	@param Q ECP2 instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP2_equals(ECP2 *P, ECP2 *Q);
+/**	@brief Converts an ECP2 point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP2 instance to be converted to affine form
+ */
+extern void ECP2_affine(ECP2 *P);
+/**	@brief Extract x and y coordinates of an ECP2 point P
+ *
+	If x=y, returns only x
+	@param x FP2 on exit = x coordinate of point
+	@param y FP2 on exit = y coordinate of point (unless x=y)
+	@param P ECP2 instance (x,y)
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP2_get(BLS12381::FP2 *x, BLS12381::FP2 *y, ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, converted to affine coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_output(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, in projective coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_outputxyz(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to an octet string
+ *
+	The octet string is created in the form x|y or just x if compressed
+	Convert the real and imaginary parts of the x and y coordinates to big-endian base 256 form.
+    If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param S output octet string
+	@param P ECP2 instance to be converted to an octet string
+    @param c true for compression
+ */
+extern void ECP2_toOctet(octet *S, ECP2 *P, bool c);
+/**	@brief Creates an ECP2 point from an octet string
+ *
+	The octet string is in the form x|y
+	The real and imaginary parts of the x and y coordinates are in big-endian base 256 form.
+    If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP2 instance to be created from the octet string
+	@param S input octet string
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP2_fromOctet(ECP2 *P, octet *S);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x)=x^3+Ax+B
+	Used internally.
+	@param r FP2 value of f(x)
+	@param x FP2 instance
+ */
+extern void ECP2_rhs(BLS12381::FP2 *r, BLS12381::FP2 *x);
+/**	@brief Set ECP2 to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP2 instance to be set (x,y)
+	@param x FP2 x coordinate of point
+	@param y FP2 y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_set(ECP2 *P, BLS12381::FP2 *x, BLS12381::FP2 *y);
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Otherwise y coordinate is calculated from x.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+    @param s sign of y
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_setx(ECP2 *P, BLS12381::FP2 *x, int s);
+/**	@brief Negation of an ECP2 point
+ *
+	@param P ECP2 instance, on exit = -P
+ */
+extern void ECP2_neg(ECP2 *P);
+/**	@brief Doubles an ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =2*P
+ */
+extern int ECP2_dbl(ECP2 *P);
+/**	@brief Adds ECP2 instance Q to ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P+Q
+	@param Q ECP2 instance to be added to P
+ */
+extern int ECP2_add(ECP2 *P, ECP2 *Q);
+/**	@brief Subtracts ECP instance Q from ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P-Q
+	@param Q ECP2 instance to be subtracted from P
+ */
+extern void ECP2_sub(ECP2 *P, ECP2 *Q);
+/**	@brief Multiplies an ECP2 instance P by a BIG, side-channel resistant
+ *
+	Uses fixed sized windows.
+	@param P ECP2 instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP2_mul(ECP2 *P, B384_58::BIG b);
+/**	@brief Multiplies an ECP2 instance P by the internal modulus p, using precalculated Frobenius constant f
+ *
+	Fast point multiplication using Frobenius
+	@param P ECP2 instance, on exit = p*P
+	@param f FP2 precalculated Frobenius constant
+
+ */
+extern void ECP2_frob(ECP2 *P, BLS12381::FP2 *f);
+/**	@brief Calculates P=b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+ *
+	@param P ECP2 instance, on exit = b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+	@param Q ECP2 array of 4 points
+	@param b BIG array of 4 multipliers
+ */
+extern void ECP2_mul4(ECP2 *P, ECP2 *Q, B384_58::BIG *b);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP2 multiplied by co-factor
+ */
+extern void ECP2_cfp(ECP2 *Q);
+
+/**	@brief Maps random FP2 to curve point in constant time
+ *
+	@param Q ECP2 instance 
+	@param x FP2 derived from hash
+ */
+extern void ECP2_map2point(ECP2 *Q, BLS12381::FP2 *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP2 instance 
+	@param x Fp derived from hash
+ */
+extern void ECP2_hap2point(ECP2 *Q, B384_58::BIG  x);
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param P ECP2 instance of correct order
+	@param W OCTET byte array to be mapped
+ */
+extern void ECP2_mapit(ECP2 *P, octet *w);
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP2 instance
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_generator(ECP2 *G);
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp2_BLS12383.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp2_BLS12383.h
new file mode 100644
index 0000000..101c09f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp2_BLS12383.h
@@ -0,0 +1,249 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP2_BLS12383_H
+#define ECP2_BLS12383_H
+
+#include "fp2_BLS12383.h"
+#include "config_curve_BLS12383.h"
+
+using namespace core;
+
+
+namespace BLS12383 {
+
+extern const B384_58::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B384_58::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+}
+
+namespace BLS12383 {
+
+/**
+	@brief ECP2 Structure - Elliptic Curve Point over quadratic extension field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag */
+    BLS12383::FP2 x;   /**< x-coordinate of point */
+    BLS12383::FP2 y;   /**< y-coordinate of point */
+    BLS12383::FP2 z;   /**< z-coordinate of point */
+} ECP2;
+
+
+/* Curve Params - see rom*.cpp */
+
+extern const int CURVE_B_I;		/**< Elliptic curve B parameter */
+extern const B384_58::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B384_58::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B384_58::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B384_58::BIG CURVE_Bnx;   /**< Elliptic curve parameter */
+extern const B384_58::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+
+/* Generator point on G1 */
+extern const B384_58::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B384_58::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B384_58::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+/* ECP2 E(Fp2) prototypes */
+/**	@brief Tests for ECP2 point equal to infinity
+ *
+	@param P ECP2 point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP2_isinf(ECP2 *P);
+/**	@brief Copy ECP2 point to another ECP2 point
+ *
+	@param P ECP2 instance, on exit = Q
+	@param Q ECP2 instance to be copied
+ */
+extern void ECP2_copy(ECP2 *P, ECP2 *Q);
+/**	@brief Set ECP2 to point-at-infinity
+ *
+	@param P ECP2 instance to be set to infinity
+ */
+extern void ECP2_inf(ECP2 *P);
+/**	@brief Tests for equality of two ECP2s
+ *
+	@param P ECP2 instance to be compared
+	@param Q ECP2 instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP2_equals(ECP2 *P, ECP2 *Q);
+/**	@brief Converts an ECP2 point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP2 instance to be converted to affine form
+ */
+extern void ECP2_affine(ECP2 *P);
+/**	@brief Extract x and y coordinates of an ECP2 point P
+ *
+	If x=y, returns only x
+	@param x FP2 on exit = x coordinate of point
+	@param y FP2 on exit = y coordinate of point (unless x=y)
+	@param P ECP2 instance (x,y)
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP2_get(BLS12383::FP2 *x, BLS12383::FP2 *y, ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, converted to affine coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_output(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, in projective coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_outputxyz(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to an octet string
+ *
+	The octet string is created in the form x|y or just x if compressed
+	Convert the real and imaginary parts of the x and y coordinates to big-endian base 256 form.
+    If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param S output octet string
+	@param P ECP2 instance to be converted to an octet string
+    @param c true for compression
+ */
+extern void ECP2_toOctet(octet *S, ECP2 *P, bool c);
+/**	@brief Creates an ECP2 point from an octet string
+ *
+	The octet string is in the form x|y
+	The real and imaginary parts of the x and y coordinates are in big-endian base 256 form.
+    If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP2 instance to be created from the octet string
+	@param S input octet string
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP2_fromOctet(ECP2 *P, octet *S);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x)=x^3+Ax+B
+	Used internally.
+	@param r FP2 value of f(x)
+	@param x FP2 instance
+ */
+extern void ECP2_rhs(BLS12383::FP2 *r, BLS12383::FP2 *x);
+/**	@brief Set ECP2 to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP2 instance to be set (x,y)
+	@param x FP2 x coordinate of point
+	@param y FP2 y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_set(ECP2 *P, BLS12383::FP2 *x, BLS12383::FP2 *y);
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Otherwise y coordinate is calculated from x.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+    @param s sign of y
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_setx(ECP2 *P, BLS12383::FP2 *x, int s);
+/**	@brief Negation of an ECP2 point
+ *
+	@param P ECP2 instance, on exit = -P
+ */
+extern void ECP2_neg(ECP2 *P);
+/**	@brief Doubles an ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =2*P
+ */
+extern int ECP2_dbl(ECP2 *P);
+/**	@brief Adds ECP2 instance Q to ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P+Q
+	@param Q ECP2 instance to be added to P
+ */
+extern int ECP2_add(ECP2 *P, ECP2 *Q);
+/**	@brief Subtracts ECP instance Q from ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P-Q
+	@param Q ECP2 instance to be subtracted from P
+ */
+extern void ECP2_sub(ECP2 *P, ECP2 *Q);
+/**	@brief Multiplies an ECP2 instance P by a BIG, side-channel resistant
+ *
+	Uses fixed sized windows.
+	@param P ECP2 instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP2_mul(ECP2 *P, B384_58::BIG b);
+/**	@brief Multiplies an ECP2 instance P by the internal modulus p, using precalculated Frobenius constant f
+ *
+	Fast point multiplication using Frobenius
+	@param P ECP2 instance, on exit = p*P
+	@param f FP2 precalculated Frobenius constant
+
+ */
+extern void ECP2_frob(ECP2 *P, BLS12383::FP2 *f);
+/**	@brief Calculates P=b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+ *
+	@param P ECP2 instance, on exit = b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+	@param Q ECP2 array of 4 points
+	@param b BIG array of 4 multipliers
+ */
+extern void ECP2_mul4(ECP2 *P, ECP2 *Q, B384_58::BIG *b);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP2 multiplied by co-factor
+ */
+extern void ECP2_cfp(ECP2 *Q);
+
+/**	@brief Maps random FP2 to curve point in constant time
+ *
+	@param Q ECP2 instance 
+	@param x FP2 derived from hash
+ */
+extern void ECP2_map2point(ECP2 *Q, BLS12383::FP2 *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP2 instance 
+	@param x Fp derived from hash
+ */
+extern void ECP2_hap2point(ECP2 *Q, B384_58::BIG  x);
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param P ECP2 instance of correct order
+	@param W OCTET byte array to be mapped
+ */
+extern void ECP2_mapit(ECP2 *P, octet *w);
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP2 instance
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_generator(ECP2 *G);
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp2_BLS12443.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp2_BLS12443.h
new file mode 100644
index 0000000..d99989b
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp2_BLS12443.h
@@ -0,0 +1,249 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP2_BLS12443_H
+#define ECP2_BLS12443_H
+
+#include "fp2_BLS12443.h"
+#include "config_curve_BLS12443.h"
+
+using namespace core;
+
+
+namespace BLS12443 {
+
+extern const B448_60::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B448_60::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+}
+
+namespace BLS12443 {
+
+/**
+	@brief ECP2 Structure - Elliptic Curve Point over quadratic extension field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag */
+    BLS12443::FP2 x;   /**< x-coordinate of point */
+    BLS12443::FP2 y;   /**< y-coordinate of point */
+    BLS12443::FP2 z;   /**< z-coordinate of point */
+} ECP2;
+
+
+/* Curve Params - see rom*.cpp */
+
+extern const int CURVE_B_I;		/**< Elliptic curve B parameter */
+extern const B448_60::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B448_60::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B448_60::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B448_60::BIG CURVE_Bnx;   /**< Elliptic curve parameter */
+extern const B448_60::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+
+/* Generator point on G1 */
+extern const B448_60::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B448_60::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B448_60::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+/* ECP2 E(Fp2) prototypes */
+/**	@brief Tests for ECP2 point equal to infinity
+ *
+	@param P ECP2 point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP2_isinf(ECP2 *P);
+/**	@brief Copy ECP2 point to another ECP2 point
+ *
+	@param P ECP2 instance, on exit = Q
+	@param Q ECP2 instance to be copied
+ */
+extern void ECP2_copy(ECP2 *P, ECP2 *Q);
+/**	@brief Set ECP2 to point-at-infinity
+ *
+	@param P ECP2 instance to be set to infinity
+ */
+extern void ECP2_inf(ECP2 *P);
+/**	@brief Tests for equality of two ECP2s
+ *
+	@param P ECP2 instance to be compared
+	@param Q ECP2 instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP2_equals(ECP2 *P, ECP2 *Q);
+/**	@brief Converts an ECP2 point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP2 instance to be converted to affine form
+ */
+extern void ECP2_affine(ECP2 *P);
+/**	@brief Extract x and y coordinates of an ECP2 point P
+ *
+	If x=y, returns only x
+	@param x FP2 on exit = x coordinate of point
+	@param y FP2 on exit = y coordinate of point (unless x=y)
+	@param P ECP2 instance (x,y)
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP2_get(BLS12443::FP2 *x, BLS12443::FP2 *y, ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, converted to affine coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_output(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, in projective coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_outputxyz(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to an octet string
+ *
+	The octet string is created in the form x|y or just x if compressed
+	Convert the real and imaginary parts of the x and y coordinates to big-endian base 256 form.
+    If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param S output octet string
+	@param P ECP2 instance to be converted to an octet string
+    @param c true for compression
+ */
+extern void ECP2_toOctet(octet *S, ECP2 *P, bool c);
+/**	@brief Creates an ECP2 point from an octet string
+ *
+	The octet string is in the form x|y
+	The real and imaginary parts of the x and y coordinates are in big-endian base 256 form.
+    If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP2 instance to be created from the octet string
+	@param S input octet string
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP2_fromOctet(ECP2 *P, octet *S);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x)=x^3+Ax+B
+	Used internally.
+	@param r FP2 value of f(x)
+	@param x FP2 instance
+ */
+extern void ECP2_rhs(BLS12443::FP2 *r, BLS12443::FP2 *x);
+/**	@brief Set ECP2 to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP2 instance to be set (x,y)
+	@param x FP2 x coordinate of point
+	@param y FP2 y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_set(ECP2 *P, BLS12443::FP2 *x, BLS12443::FP2 *y);
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Otherwise y coordinate is calculated from x.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+    @param s sign of y
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_setx(ECP2 *P, BLS12443::FP2 *x, int s);
+/**	@brief Negation of an ECP2 point
+ *
+	@param P ECP2 instance, on exit = -P
+ */
+extern void ECP2_neg(ECP2 *P);
+/**	@brief Doubles an ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =2*P
+ */
+extern int ECP2_dbl(ECP2 *P);
+/**	@brief Adds ECP2 instance Q to ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P+Q
+	@param Q ECP2 instance to be added to P
+ */
+extern int ECP2_add(ECP2 *P, ECP2 *Q);
+/**	@brief Subtracts ECP instance Q from ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P-Q
+	@param Q ECP2 instance to be subtracted from P
+ */
+extern void ECP2_sub(ECP2 *P, ECP2 *Q);
+/**	@brief Multiplies an ECP2 instance P by a BIG, side-channel resistant
+ *
+	Uses fixed sized windows.
+	@param P ECP2 instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP2_mul(ECP2 *P, B448_60::BIG b);
+/**	@brief Multiplies an ECP2 instance P by the internal modulus p, using precalculated Frobenius constant f
+ *
+	Fast point multiplication using Frobenius
+	@param P ECP2 instance, on exit = p*P
+	@param f FP2 precalculated Frobenius constant
+
+ */
+extern void ECP2_frob(ECP2 *P, BLS12443::FP2 *f);
+/**	@brief Calculates P=b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+ *
+	@param P ECP2 instance, on exit = b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+	@param Q ECP2 array of 4 points
+	@param b BIG array of 4 multipliers
+ */
+extern void ECP2_mul4(ECP2 *P, ECP2 *Q, B448_60::BIG *b);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP2 multiplied by co-factor
+ */
+extern void ECP2_cfp(ECP2 *Q);
+
+/**	@brief Maps random FP2 to curve point in constant time
+ *
+	@param Q ECP2 instance 
+	@param x FP2 derived from hash
+ */
+extern void ECP2_map2point(ECP2 *Q, BLS12443::FP2 *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP2 instance 
+	@param x Fp derived from hash
+ */
+extern void ECP2_hap2point(ECP2 *Q, B448_60::BIG  x);
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param P ECP2 instance of correct order
+	@param W OCTET byte array to be mapped
+ */
+extern void ECP2_mapit(ECP2 *P, octet *w);
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP2 instance
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_generator(ECP2 *G);
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp2_BLS12461.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp2_BLS12461.h
new file mode 100644
index 0000000..00d03f9
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp2_BLS12461.h
@@ -0,0 +1,249 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP2_BLS12461_H
+#define ECP2_BLS12461_H
+
+#include "fp2_BLS12461.h"
+#include "config_curve_BLS12461.h"
+
+using namespace core;
+
+
+namespace BLS12461 {
+
+extern const B464_60::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B464_60::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+}
+
+namespace BLS12461 {
+
+/**
+	@brief ECP2 Structure - Elliptic Curve Point over quadratic extension field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag */
+    BLS12461::FP2 x;   /**< x-coordinate of point */
+    BLS12461::FP2 y;   /**< y-coordinate of point */
+    BLS12461::FP2 z;   /**< z-coordinate of point */
+} ECP2;
+
+
+/* Curve Params - see rom*.cpp */
+
+extern const int CURVE_B_I;		/**< Elliptic curve B parameter */
+extern const B464_60::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B464_60::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B464_60::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B464_60::BIG CURVE_Bnx;   /**< Elliptic curve parameter */
+extern const B464_60::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+
+/* Generator point on G1 */
+extern const B464_60::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B464_60::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B464_60::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+/* ECP2 E(Fp2) prototypes */
+/**	@brief Tests for ECP2 point equal to infinity
+ *
+	@param P ECP2 point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP2_isinf(ECP2 *P);
+/**	@brief Copy ECP2 point to another ECP2 point
+ *
+	@param P ECP2 instance, on exit = Q
+	@param Q ECP2 instance to be copied
+ */
+extern void ECP2_copy(ECP2 *P, ECP2 *Q);
+/**	@brief Set ECP2 to point-at-infinity
+ *
+	@param P ECP2 instance to be set to infinity
+ */
+extern void ECP2_inf(ECP2 *P);
+/**	@brief Tests for equality of two ECP2s
+ *
+	@param P ECP2 instance to be compared
+	@param Q ECP2 instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP2_equals(ECP2 *P, ECP2 *Q);
+/**	@brief Converts an ECP2 point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP2 instance to be converted to affine form
+ */
+extern void ECP2_affine(ECP2 *P);
+/**	@brief Extract x and y coordinates of an ECP2 point P
+ *
+	If x=y, returns only x
+	@param x FP2 on exit = x coordinate of point
+	@param y FP2 on exit = y coordinate of point (unless x=y)
+	@param P ECP2 instance (x,y)
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP2_get(BLS12461::FP2 *x, BLS12461::FP2 *y, ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, converted to affine coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_output(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, in projective coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_outputxyz(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to an octet string
+ *
+	The octet string is created in the form x|y or just x if compressed
+	Convert the real and imaginary parts of the x and y coordinates to big-endian base 256 form.
+    If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param S output octet string
+	@param P ECP2 instance to be converted to an octet string
+    @param c true for compression
+ */
+extern void ECP2_toOctet(octet *S, ECP2 *P, bool c);
+/**	@brief Creates an ECP2 point from an octet string
+ *
+	The octet string is in the form x|y
+	The real and imaginary parts of the x and y coordinates are in big-endian base 256 form.
+    If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP2 instance to be created from the octet string
+	@param S input octet string
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP2_fromOctet(ECP2 *P, octet *S);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x)=x^3+Ax+B
+	Used internally.
+	@param r FP2 value of f(x)
+	@param x FP2 instance
+ */
+extern void ECP2_rhs(BLS12461::FP2 *r, BLS12461::FP2 *x);
+/**	@brief Set ECP2 to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP2 instance to be set (x,y)
+	@param x FP2 x coordinate of point
+	@param y FP2 y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_set(ECP2 *P, BLS12461::FP2 *x, BLS12461::FP2 *y);
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Otherwise y coordinate is calculated from x.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+    @param s sign of y
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_setx(ECP2 *P, BLS12461::FP2 *x, int s);
+/**	@brief Negation of an ECP2 point
+ *
+	@param P ECP2 instance, on exit = -P
+ */
+extern void ECP2_neg(ECP2 *P);
+/**	@brief Doubles an ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =2*P
+ */
+extern int ECP2_dbl(ECP2 *P);
+/**	@brief Adds ECP2 instance Q to ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P+Q
+	@param Q ECP2 instance to be added to P
+ */
+extern int ECP2_add(ECP2 *P, ECP2 *Q);
+/**	@brief Subtracts ECP instance Q from ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P-Q
+	@param Q ECP2 instance to be subtracted from P
+ */
+extern void ECP2_sub(ECP2 *P, ECP2 *Q);
+/**	@brief Multiplies an ECP2 instance P by a BIG, side-channel resistant
+ *
+	Uses fixed sized windows.
+	@param P ECP2 instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP2_mul(ECP2 *P, B464_60::BIG b);
+/**	@brief Multiplies an ECP2 instance P by the internal modulus p, using precalculated Frobenius constant f
+ *
+	Fast point multiplication using Frobenius
+	@param P ECP2 instance, on exit = p*P
+	@param f FP2 precalculated Frobenius constant
+
+ */
+extern void ECP2_frob(ECP2 *P, BLS12461::FP2 *f);
+/**	@brief Calculates P=b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+ *
+	@param P ECP2 instance, on exit = b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+	@param Q ECP2 array of 4 points
+	@param b BIG array of 4 multipliers
+ */
+extern void ECP2_mul4(ECP2 *P, ECP2 *Q, B464_60::BIG *b);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP2 multiplied by co-factor
+ */
+extern void ECP2_cfp(ECP2 *Q);
+
+/**	@brief Maps random FP2 to curve point in constant time
+ *
+	@param Q ECP2 instance 
+	@param x FP2 derived from hash
+ */
+extern void ECP2_map2point(ECP2 *Q, BLS12461::FP2 *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP2 instance 
+	@param x Fp derived from hash
+ */
+extern void ECP2_hap2point(ECP2 *Q, B464_60::BIG  x);
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param P ECP2 instance of correct order
+	@param W OCTET byte array to be mapped
+ */
+extern void ECP2_mapit(ECP2 *P, octet *w);
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP2 instance
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_generator(ECP2 *G);
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp2_BN158.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp2_BN158.h
new file mode 100644
index 0000000..63fe5ba
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp2_BN158.h
@@ -0,0 +1,249 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP2_BN158_H
+#define ECP2_BN158_H
+
+#include "fp2_BN158.h"
+#include "config_curve_BN158.h"
+
+using namespace core;
+
+
+namespace BN158 {
+
+extern const B160_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B160_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+}
+
+namespace BN158 {
+
+/**
+	@brief ECP2 Structure - Elliptic Curve Point over quadratic extension field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag */
+    BN158::FP2 x;   /**< x-coordinate of point */
+    BN158::FP2 y;   /**< y-coordinate of point */
+    BN158::FP2 z;   /**< z-coordinate of point */
+} ECP2;
+
+
+/* Curve Params - see rom*.cpp */
+
+extern const int CURVE_B_I;		/**< Elliptic curve B parameter */
+extern const B160_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B160_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B160_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B160_56::BIG CURVE_Bnx;   /**< Elliptic curve parameter */
+extern const B160_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+
+/* Generator point on G1 */
+extern const B160_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B160_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B160_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+/* ECP2 E(Fp2) prototypes */
+/**	@brief Tests for ECP2 point equal to infinity
+ *
+	@param P ECP2 point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP2_isinf(ECP2 *P);
+/**	@brief Copy ECP2 point to another ECP2 point
+ *
+	@param P ECP2 instance, on exit = Q
+	@param Q ECP2 instance to be copied
+ */
+extern void ECP2_copy(ECP2 *P, ECP2 *Q);
+/**	@brief Set ECP2 to point-at-infinity
+ *
+	@param P ECP2 instance to be set to infinity
+ */
+extern void ECP2_inf(ECP2 *P);
+/**	@brief Tests for equality of two ECP2s
+ *
+	@param P ECP2 instance to be compared
+	@param Q ECP2 instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP2_equals(ECP2 *P, ECP2 *Q);
+/**	@brief Converts an ECP2 point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP2 instance to be converted to affine form
+ */
+extern void ECP2_affine(ECP2 *P);
+/**	@brief Extract x and y coordinates of an ECP2 point P
+ *
+	If x=y, returns only x
+	@param x FP2 on exit = x coordinate of point
+	@param y FP2 on exit = y coordinate of point (unless x=y)
+	@param P ECP2 instance (x,y)
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP2_get(BN158::FP2 *x, BN158::FP2 *y, ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, converted to affine coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_output(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, in projective coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_outputxyz(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to an octet string
+ *
+	The octet string is created in the form x|y or just x if compressed
+	Convert the real and imaginary parts of the x and y coordinates to big-endian base 256 form.
+    If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param S output octet string
+	@param P ECP2 instance to be converted to an octet string
+    @param c true for compression
+ */
+extern void ECP2_toOctet(octet *S, ECP2 *P, bool c);
+/**	@brief Creates an ECP2 point from an octet string
+ *
+	The octet string is in the form x|y
+	The real and imaginary parts of the x and y coordinates are in big-endian base 256 form.
+    If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP2 instance to be created from the octet string
+	@param S input octet string
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP2_fromOctet(ECP2 *P, octet *S);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x)=x^3+Ax+B
+	Used internally.
+	@param r FP2 value of f(x)
+	@param x FP2 instance
+ */
+extern void ECP2_rhs(BN158::FP2 *r, BN158::FP2 *x);
+/**	@brief Set ECP2 to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP2 instance to be set (x,y)
+	@param x FP2 x coordinate of point
+	@param y FP2 y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_set(ECP2 *P, BN158::FP2 *x, BN158::FP2 *y);
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Otherwise y coordinate is calculated from x.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+    @param s sign of y
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_setx(ECP2 *P, BN158::FP2 *x, int s);
+/**	@brief Negation of an ECP2 point
+ *
+	@param P ECP2 instance, on exit = -P
+ */
+extern void ECP2_neg(ECP2 *P);
+/**	@brief Doubles an ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =2*P
+ */
+extern int ECP2_dbl(ECP2 *P);
+/**	@brief Adds ECP2 instance Q to ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P+Q
+	@param Q ECP2 instance to be added to P
+ */
+extern int ECP2_add(ECP2 *P, ECP2 *Q);
+/**	@brief Subtracts ECP instance Q from ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P-Q
+	@param Q ECP2 instance to be subtracted from P
+ */
+extern void ECP2_sub(ECP2 *P, ECP2 *Q);
+/**	@brief Multiplies an ECP2 instance P by a BIG, side-channel resistant
+ *
+	Uses fixed sized windows.
+	@param P ECP2 instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP2_mul(ECP2 *P, B160_56::BIG b);
+/**	@brief Multiplies an ECP2 instance P by the internal modulus p, using precalculated Frobenius constant f
+ *
+	Fast point multiplication using Frobenius
+	@param P ECP2 instance, on exit = p*P
+	@param f FP2 precalculated Frobenius constant
+
+ */
+extern void ECP2_frob(ECP2 *P, BN158::FP2 *f);
+/**	@brief Calculates P=b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+ *
+	@param P ECP2 instance, on exit = b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+	@param Q ECP2 array of 4 points
+	@param b BIG array of 4 multipliers
+ */
+extern void ECP2_mul4(ECP2 *P, ECP2 *Q, B160_56::BIG *b);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP2 multiplied by co-factor
+ */
+extern void ECP2_cfp(ECP2 *Q);
+
+/**	@brief Maps random FP2 to curve point in constant time
+ *
+	@param Q ECP2 instance 
+	@param x FP2 derived from hash
+ */
+extern void ECP2_map2point(ECP2 *Q, BN158::FP2 *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP2 instance 
+	@param x Fp derived from hash
+ */
+extern void ECP2_hap2point(ECP2 *Q, B160_56::BIG  x);
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param P ECP2 instance of correct order
+	@param W OCTET byte array to be mapped
+ */
+extern void ECP2_mapit(ECP2 *P, octet *w);
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP2 instance
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_generator(ECP2 *G);
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp2_BN254.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp2_BN254.h
new file mode 100644
index 0000000..3a14b73
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp2_BN254.h
@@ -0,0 +1,249 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP2_BN254_H
+#define ECP2_BN254_H
+
+#include "fp2_BN254.h"
+#include "config_curve_BN254.h"
+
+using namespace core;
+
+
+namespace BN254 {
+
+extern const B256_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+}
+
+namespace BN254 {
+
+/**
+	@brief ECP2 Structure - Elliptic Curve Point over quadratic extension field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag */
+    BN254::FP2 x;   /**< x-coordinate of point */
+    BN254::FP2 y;   /**< y-coordinate of point */
+    BN254::FP2 z;   /**< z-coordinate of point */
+} ECP2;
+
+
+/* Curve Params - see rom*.cpp */
+
+extern const int CURVE_B_I;		/**< Elliptic curve B parameter */
+extern const B256_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_56::BIG CURVE_Bnx;   /**< Elliptic curve parameter */
+extern const B256_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+
+/* Generator point on G1 */
+extern const B256_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+/* ECP2 E(Fp2) prototypes */
+/**	@brief Tests for ECP2 point equal to infinity
+ *
+	@param P ECP2 point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP2_isinf(ECP2 *P);
+/**	@brief Copy ECP2 point to another ECP2 point
+ *
+	@param P ECP2 instance, on exit = Q
+	@param Q ECP2 instance to be copied
+ */
+extern void ECP2_copy(ECP2 *P, ECP2 *Q);
+/**	@brief Set ECP2 to point-at-infinity
+ *
+	@param P ECP2 instance to be set to infinity
+ */
+extern void ECP2_inf(ECP2 *P);
+/**	@brief Tests for equality of two ECP2s
+ *
+	@param P ECP2 instance to be compared
+	@param Q ECP2 instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP2_equals(ECP2 *P, ECP2 *Q);
+/**	@brief Converts an ECP2 point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP2 instance to be converted to affine form
+ */
+extern void ECP2_affine(ECP2 *P);
+/**	@brief Extract x and y coordinates of an ECP2 point P
+ *
+	If x=y, returns only x
+	@param x FP2 on exit = x coordinate of point
+	@param y FP2 on exit = y coordinate of point (unless x=y)
+	@param P ECP2 instance (x,y)
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP2_get(BN254::FP2 *x, BN254::FP2 *y, ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, converted to affine coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_output(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, in projective coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_outputxyz(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to an octet string
+ *
+	The octet string is created in the form x|y or just x if compressed
+	Convert the real and imaginary parts of the x and y coordinates to big-endian base 256 form.
+    If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param S output octet string
+	@param P ECP2 instance to be converted to an octet string
+    @param c true for compression
+ */
+extern void ECP2_toOctet(octet *S, ECP2 *P, bool c);
+/**	@brief Creates an ECP2 point from an octet string
+ *
+	The octet string is in the form x|y
+	The real and imaginary parts of the x and y coordinates are in big-endian base 256 form.
+    If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP2 instance to be created from the octet string
+	@param S input octet string
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP2_fromOctet(ECP2 *P, octet *S);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x)=x^3+Ax+B
+	Used internally.
+	@param r FP2 value of f(x)
+	@param x FP2 instance
+ */
+extern void ECP2_rhs(BN254::FP2 *r, BN254::FP2 *x);
+/**	@brief Set ECP2 to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP2 instance to be set (x,y)
+	@param x FP2 x coordinate of point
+	@param y FP2 y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_set(ECP2 *P, BN254::FP2 *x, BN254::FP2 *y);
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Otherwise y coordinate is calculated from x.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+    @param s sign of y
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_setx(ECP2 *P, BN254::FP2 *x, int s);
+/**	@brief Negation of an ECP2 point
+ *
+	@param P ECP2 instance, on exit = -P
+ */
+extern void ECP2_neg(ECP2 *P);
+/**	@brief Doubles an ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =2*P
+ */
+extern int ECP2_dbl(ECP2 *P);
+/**	@brief Adds ECP2 instance Q to ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P+Q
+	@param Q ECP2 instance to be added to P
+ */
+extern int ECP2_add(ECP2 *P, ECP2 *Q);
+/**	@brief Subtracts ECP instance Q from ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P-Q
+	@param Q ECP2 instance to be subtracted from P
+ */
+extern void ECP2_sub(ECP2 *P, ECP2 *Q);
+/**	@brief Multiplies an ECP2 instance P by a BIG, side-channel resistant
+ *
+	Uses fixed sized windows.
+	@param P ECP2 instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP2_mul(ECP2 *P, B256_56::BIG b);
+/**	@brief Multiplies an ECP2 instance P by the internal modulus p, using precalculated Frobenius constant f
+ *
+	Fast point multiplication using Frobenius
+	@param P ECP2 instance, on exit = p*P
+	@param f FP2 precalculated Frobenius constant
+
+ */
+extern void ECP2_frob(ECP2 *P, BN254::FP2 *f);
+/**	@brief Calculates P=b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+ *
+	@param P ECP2 instance, on exit = b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+	@param Q ECP2 array of 4 points
+	@param b BIG array of 4 multipliers
+ */
+extern void ECP2_mul4(ECP2 *P, ECP2 *Q, B256_56::BIG *b);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP2 multiplied by co-factor
+ */
+extern void ECP2_cfp(ECP2 *Q);
+
+/**	@brief Maps random FP2 to curve point in constant time
+ *
+	@param Q ECP2 instance 
+	@param x FP2 derived from hash
+ */
+extern void ECP2_map2point(ECP2 *Q, BN254::FP2 *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP2 instance 
+	@param x Fp derived from hash
+ */
+extern void ECP2_hap2point(ECP2 *Q, B256_56::BIG  x);
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param P ECP2 instance of correct order
+	@param W OCTET byte array to be mapped
+ */
+extern void ECP2_mapit(ECP2 *P, octet *w);
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP2 instance
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_generator(ECP2 *G);
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp2_BN254CX.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp2_BN254CX.h
new file mode 100644
index 0000000..550fb25
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp2_BN254CX.h
@@ -0,0 +1,249 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP2_BN254CX_H
+#define ECP2_BN254CX_H
+
+#include "fp2_BN254CX.h"
+#include "config_curve_BN254CX.h"
+
+using namespace core;
+
+
+namespace BN254CX {
+
+extern const B256_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+}
+
+namespace BN254CX {
+
+/**
+	@brief ECP2 Structure - Elliptic Curve Point over quadratic extension field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag */
+    BN254CX::FP2 x;   /**< x-coordinate of point */
+    BN254CX::FP2 y;   /**< y-coordinate of point */
+    BN254CX::FP2 z;   /**< z-coordinate of point */
+} ECP2;
+
+
+/* Curve Params - see rom*.cpp */
+
+extern const int CURVE_B_I;		/**< Elliptic curve B parameter */
+extern const B256_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_56::BIG CURVE_Bnx;   /**< Elliptic curve parameter */
+extern const B256_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+
+/* Generator point on G1 */
+extern const B256_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+/* ECP2 E(Fp2) prototypes */
+/**	@brief Tests for ECP2 point equal to infinity
+ *
+	@param P ECP2 point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP2_isinf(ECP2 *P);
+/**	@brief Copy ECP2 point to another ECP2 point
+ *
+	@param P ECP2 instance, on exit = Q
+	@param Q ECP2 instance to be copied
+ */
+extern void ECP2_copy(ECP2 *P, ECP2 *Q);
+/**	@brief Set ECP2 to point-at-infinity
+ *
+	@param P ECP2 instance to be set to infinity
+ */
+extern void ECP2_inf(ECP2 *P);
+/**	@brief Tests for equality of two ECP2s
+ *
+	@param P ECP2 instance to be compared
+	@param Q ECP2 instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP2_equals(ECP2 *P, ECP2 *Q);
+/**	@brief Converts an ECP2 point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP2 instance to be converted to affine form
+ */
+extern void ECP2_affine(ECP2 *P);
+/**	@brief Extract x and y coordinates of an ECP2 point P
+ *
+	If x=y, returns only x
+	@param x FP2 on exit = x coordinate of point
+	@param y FP2 on exit = y coordinate of point (unless x=y)
+	@param P ECP2 instance (x,y)
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP2_get(BN254CX::FP2 *x, BN254CX::FP2 *y, ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, converted to affine coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_output(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, in projective coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_outputxyz(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to an octet string
+ *
+	The octet string is created in the form x|y or just x if compressed
+	Convert the real and imaginary parts of the x and y coordinates to big-endian base 256 form.
+    If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param S output octet string
+	@param P ECP2 instance to be converted to an octet string
+    @param c true for compression
+ */
+extern void ECP2_toOctet(octet *S, ECP2 *P, bool c);
+/**	@brief Creates an ECP2 point from an octet string
+ *
+	The octet string is in the form x|y
+	The real and imaginary parts of the x and y coordinates are in big-endian base 256 form.
+    If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP2 instance to be created from the octet string
+	@param S input octet string
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP2_fromOctet(ECP2 *P, octet *S);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x)=x^3+Ax+B
+	Used internally.
+	@param r FP2 value of f(x)
+	@param x FP2 instance
+ */
+extern void ECP2_rhs(BN254CX::FP2 *r, BN254CX::FP2 *x);
+/**	@brief Set ECP2 to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP2 instance to be set (x,y)
+	@param x FP2 x coordinate of point
+	@param y FP2 y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_set(ECP2 *P, BN254CX::FP2 *x, BN254CX::FP2 *y);
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Otherwise y coordinate is calculated from x.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+    @param s sign of y
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_setx(ECP2 *P, BN254CX::FP2 *x, int s);
+/**	@brief Negation of an ECP2 point
+ *
+	@param P ECP2 instance, on exit = -P
+ */
+extern void ECP2_neg(ECP2 *P);
+/**	@brief Doubles an ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =2*P
+ */
+extern int ECP2_dbl(ECP2 *P);
+/**	@brief Adds ECP2 instance Q to ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P+Q
+	@param Q ECP2 instance to be added to P
+ */
+extern int ECP2_add(ECP2 *P, ECP2 *Q);
+/**	@brief Subtracts ECP instance Q from ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P-Q
+	@param Q ECP2 instance to be subtracted from P
+ */
+extern void ECP2_sub(ECP2 *P, ECP2 *Q);
+/**	@brief Multiplies an ECP2 instance P by a BIG, side-channel resistant
+ *
+	Uses fixed sized windows.
+	@param P ECP2 instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP2_mul(ECP2 *P, B256_56::BIG b);
+/**	@brief Multiplies an ECP2 instance P by the internal modulus p, using precalculated Frobenius constant f
+ *
+	Fast point multiplication using Frobenius
+	@param P ECP2 instance, on exit = p*P
+	@param f FP2 precalculated Frobenius constant
+
+ */
+extern void ECP2_frob(ECP2 *P, BN254CX::FP2 *f);
+/**	@brief Calculates P=b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+ *
+	@param P ECP2 instance, on exit = b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+	@param Q ECP2 array of 4 points
+	@param b BIG array of 4 multipliers
+ */
+extern void ECP2_mul4(ECP2 *P, ECP2 *Q, B256_56::BIG *b);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP2 multiplied by co-factor
+ */
+extern void ECP2_cfp(ECP2 *Q);
+
+/**	@brief Maps random FP2 to curve point in constant time
+ *
+	@param Q ECP2 instance 
+	@param x FP2 derived from hash
+ */
+extern void ECP2_map2point(ECP2 *Q, BN254CX::FP2 *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP2 instance 
+	@param x Fp derived from hash
+ */
+extern void ECP2_hap2point(ECP2 *Q, B256_56::BIG  x);
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param P ECP2 instance of correct order
+	@param W OCTET byte array to be mapped
+ */
+extern void ECP2_mapit(ECP2 *P, octet *w);
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP2 instance
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_generator(ECP2 *G);
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp2_BN462.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp2_BN462.h
new file mode 100644
index 0000000..1fdd8bc
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp2_BN462.h
@@ -0,0 +1,249 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP2_BN462_H
+#define ECP2_BN462_H
+
+#include "fp2_BN462.h"
+#include "config_curve_BN462.h"
+
+using namespace core;
+
+
+namespace BN462 {
+
+extern const B464_60::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B464_60::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+}
+
+namespace BN462 {
+
+/**
+	@brief ECP2 Structure - Elliptic Curve Point over quadratic extension field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag */
+    BN462::FP2 x;   /**< x-coordinate of point */
+    BN462::FP2 y;   /**< y-coordinate of point */
+    BN462::FP2 z;   /**< z-coordinate of point */
+} ECP2;
+
+
+/* Curve Params - see rom*.cpp */
+
+extern const int CURVE_B_I;		/**< Elliptic curve B parameter */
+extern const B464_60::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B464_60::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B464_60::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B464_60::BIG CURVE_Bnx;   /**< Elliptic curve parameter */
+extern const B464_60::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+
+/* Generator point on G1 */
+extern const B464_60::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B464_60::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B464_60::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+/* ECP2 E(Fp2) prototypes */
+/**	@brief Tests for ECP2 point equal to infinity
+ *
+	@param P ECP2 point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP2_isinf(ECP2 *P);
+/**	@brief Copy ECP2 point to another ECP2 point
+ *
+	@param P ECP2 instance, on exit = Q
+	@param Q ECP2 instance to be copied
+ */
+extern void ECP2_copy(ECP2 *P, ECP2 *Q);
+/**	@brief Set ECP2 to point-at-infinity
+ *
+	@param P ECP2 instance to be set to infinity
+ */
+extern void ECP2_inf(ECP2 *P);
+/**	@brief Tests for equality of two ECP2s
+ *
+	@param P ECP2 instance to be compared
+	@param Q ECP2 instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP2_equals(ECP2 *P, ECP2 *Q);
+/**	@brief Converts an ECP2 point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP2 instance to be converted to affine form
+ */
+extern void ECP2_affine(ECP2 *P);
+/**	@brief Extract x and y coordinates of an ECP2 point P
+ *
+	If x=y, returns only x
+	@param x FP2 on exit = x coordinate of point
+	@param y FP2 on exit = y coordinate of point (unless x=y)
+	@param P ECP2 instance (x,y)
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP2_get(BN462::FP2 *x, BN462::FP2 *y, ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, converted to affine coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_output(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, in projective coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_outputxyz(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to an octet string
+ *
+	The octet string is created in the form x|y or just x if compressed
+	Convert the real and imaginary parts of the x and y coordinates to big-endian base 256 form.
+    If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param S output octet string
+	@param P ECP2 instance to be converted to an octet string
+    @param c true for compression
+ */
+extern void ECP2_toOctet(octet *S, ECP2 *P, bool c);
+/**	@brief Creates an ECP2 point from an octet string
+ *
+	The octet string is in the form x|y
+	The real and imaginary parts of the x and y coordinates are in big-endian base 256 form.
+    If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP2 instance to be created from the octet string
+	@param S input octet string
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP2_fromOctet(ECP2 *P, octet *S);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x)=x^3+Ax+B
+	Used internally.
+	@param r FP2 value of f(x)
+	@param x FP2 instance
+ */
+extern void ECP2_rhs(BN462::FP2 *r, BN462::FP2 *x);
+/**	@brief Set ECP2 to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP2 instance to be set (x,y)
+	@param x FP2 x coordinate of point
+	@param y FP2 y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_set(ECP2 *P, BN462::FP2 *x, BN462::FP2 *y);
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Otherwise y coordinate is calculated from x.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+    @param s sign of y
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_setx(ECP2 *P, BN462::FP2 *x, int s);
+/**	@brief Negation of an ECP2 point
+ *
+	@param P ECP2 instance, on exit = -P
+ */
+extern void ECP2_neg(ECP2 *P);
+/**	@brief Doubles an ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =2*P
+ */
+extern int ECP2_dbl(ECP2 *P);
+/**	@brief Adds ECP2 instance Q to ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P+Q
+	@param Q ECP2 instance to be added to P
+ */
+extern int ECP2_add(ECP2 *P, ECP2 *Q);
+/**	@brief Subtracts ECP instance Q from ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P-Q
+	@param Q ECP2 instance to be subtracted from P
+ */
+extern void ECP2_sub(ECP2 *P, ECP2 *Q);
+/**	@brief Multiplies an ECP2 instance P by a BIG, side-channel resistant
+ *
+	Uses fixed sized windows.
+	@param P ECP2 instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP2_mul(ECP2 *P, B464_60::BIG b);
+/**	@brief Multiplies an ECP2 instance P by the internal modulus p, using precalculated Frobenius constant f
+ *
+	Fast point multiplication using Frobenius
+	@param P ECP2 instance, on exit = p*P
+	@param f FP2 precalculated Frobenius constant
+
+ */
+extern void ECP2_frob(ECP2 *P, BN462::FP2 *f);
+/**	@brief Calculates P=b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+ *
+	@param P ECP2 instance, on exit = b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+	@param Q ECP2 array of 4 points
+	@param b BIG array of 4 multipliers
+ */
+extern void ECP2_mul4(ECP2 *P, ECP2 *Q, B464_60::BIG *b);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP2 multiplied by co-factor
+ */
+extern void ECP2_cfp(ECP2 *Q);
+
+/**	@brief Maps random FP2 to curve point in constant time
+ *
+	@param Q ECP2 instance 
+	@param x FP2 derived from hash
+ */
+extern void ECP2_map2point(ECP2 *Q, BN462::FP2 *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP2 instance 
+	@param x Fp derived from hash
+ */
+extern void ECP2_hap2point(ECP2 *Q, B464_60::BIG  x);
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param P ECP2 instance of correct order
+	@param W OCTET byte array to be mapped
+ */
+extern void ECP2_mapit(ECP2 *P, octet *w);
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP2 instance
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_generator(ECP2 *G);
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp2_FP256BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp2_FP256BN.h
new file mode 100644
index 0000000..981ea27
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp2_FP256BN.h
@@ -0,0 +1,249 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP2_FP256BN_H
+#define ECP2_FP256BN_H
+
+#include "fp2_FP256BN.h"
+#include "config_curve_FP256BN.h"
+
+using namespace core;
+
+
+namespace FP256BN {
+
+extern const B256_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+}
+
+namespace FP256BN {
+
+/**
+	@brief ECP2 Structure - Elliptic Curve Point over quadratic extension field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag */
+    FP256BN::FP2 x;   /**< x-coordinate of point */
+    FP256BN::FP2 y;   /**< y-coordinate of point */
+    FP256BN::FP2 z;   /**< z-coordinate of point */
+} ECP2;
+
+
+/* Curve Params - see rom*.cpp */
+
+extern const int CURVE_B_I;		/**< Elliptic curve B parameter */
+extern const B256_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_56::BIG CURVE_Bnx;   /**< Elliptic curve parameter */
+extern const B256_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+
+/* Generator point on G1 */
+extern const B256_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+/* ECP2 E(Fp2) prototypes */
+/**	@brief Tests for ECP2 point equal to infinity
+ *
+	@param P ECP2 point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP2_isinf(ECP2 *P);
+/**	@brief Copy ECP2 point to another ECP2 point
+ *
+	@param P ECP2 instance, on exit = Q
+	@param Q ECP2 instance to be copied
+ */
+extern void ECP2_copy(ECP2 *P, ECP2 *Q);
+/**	@brief Set ECP2 to point-at-infinity
+ *
+	@param P ECP2 instance to be set to infinity
+ */
+extern void ECP2_inf(ECP2 *P);
+/**	@brief Tests for equality of two ECP2s
+ *
+	@param P ECP2 instance to be compared
+	@param Q ECP2 instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP2_equals(ECP2 *P, ECP2 *Q);
+/**	@brief Converts an ECP2 point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP2 instance to be converted to affine form
+ */
+extern void ECP2_affine(ECP2 *P);
+/**	@brief Extract x and y coordinates of an ECP2 point P
+ *
+	If x=y, returns only x
+	@param x FP2 on exit = x coordinate of point
+	@param y FP2 on exit = y coordinate of point (unless x=y)
+	@param P ECP2 instance (x,y)
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP2_get(FP256BN::FP2 *x, FP256BN::FP2 *y, ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, converted to affine coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_output(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, in projective coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_outputxyz(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to an octet string
+ *
+	The octet string is created in the form x|y or just x if compressed
+	Convert the real and imaginary parts of the x and y coordinates to big-endian base 256 form.
+    If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param S output octet string
+	@param P ECP2 instance to be converted to an octet string
+    @param c true for compression
+ */
+extern void ECP2_toOctet(octet *S, ECP2 *P, bool c);
+/**	@brief Creates an ECP2 point from an octet string
+ *
+	The octet string is in the form x|y
+	The real and imaginary parts of the x and y coordinates are in big-endian base 256 form.
+    If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP2 instance to be created from the octet string
+	@param S input octet string
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP2_fromOctet(ECP2 *P, octet *S);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x)=x^3+Ax+B
+	Used internally.
+	@param r FP2 value of f(x)
+	@param x FP2 instance
+ */
+extern void ECP2_rhs(FP256BN::FP2 *r, FP256BN::FP2 *x);
+/**	@brief Set ECP2 to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP2 instance to be set (x,y)
+	@param x FP2 x coordinate of point
+	@param y FP2 y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_set(ECP2 *P, FP256BN::FP2 *x, FP256BN::FP2 *y);
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Otherwise y coordinate is calculated from x.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+    @param s sign of y
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_setx(ECP2 *P, FP256BN::FP2 *x, int s);
+/**	@brief Negation of an ECP2 point
+ *
+	@param P ECP2 instance, on exit = -P
+ */
+extern void ECP2_neg(ECP2 *P);
+/**	@brief Doubles an ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =2*P
+ */
+extern int ECP2_dbl(ECP2 *P);
+/**	@brief Adds ECP2 instance Q to ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P+Q
+	@param Q ECP2 instance to be added to P
+ */
+extern int ECP2_add(ECP2 *P, ECP2 *Q);
+/**	@brief Subtracts ECP instance Q from ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P-Q
+	@param Q ECP2 instance to be subtracted from P
+ */
+extern void ECP2_sub(ECP2 *P, ECP2 *Q);
+/**	@brief Multiplies an ECP2 instance P by a BIG, side-channel resistant
+ *
+	Uses fixed sized windows.
+	@param P ECP2 instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP2_mul(ECP2 *P, B256_56::BIG b);
+/**	@brief Multiplies an ECP2 instance P by the internal modulus p, using precalculated Frobenius constant f
+ *
+	Fast point multiplication using Frobenius
+	@param P ECP2 instance, on exit = p*P
+	@param f FP2 precalculated Frobenius constant
+
+ */
+extern void ECP2_frob(ECP2 *P, FP256BN::FP2 *f);
+/**	@brief Calculates P=b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+ *
+	@param P ECP2 instance, on exit = b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+	@param Q ECP2 array of 4 points
+	@param b BIG array of 4 multipliers
+ */
+extern void ECP2_mul4(ECP2 *P, ECP2 *Q, B256_56::BIG *b);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP2 multiplied by co-factor
+ */
+extern void ECP2_cfp(ECP2 *Q);
+
+/**	@brief Maps random FP2 to curve point in constant time
+ *
+	@param Q ECP2 instance 
+	@param x FP2 derived from hash
+ */
+extern void ECP2_map2point(ECP2 *Q, FP256BN::FP2 *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP2 instance 
+	@param x Fp derived from hash
+ */
+extern void ECP2_hap2point(ECP2 *Q, B256_56::BIG  x);
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param P ECP2 instance of correct order
+	@param W OCTET byte array to be mapped
+ */
+extern void ECP2_mapit(ECP2 *P, octet *w);
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP2 instance
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_generator(ECP2 *G);
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp2_FP512BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp2_FP512BN.h
new file mode 100644
index 0000000..643426b
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp2_FP512BN.h
@@ -0,0 +1,249 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP2_FP512BN_H
+#define ECP2_FP512BN_H
+
+#include "fp2_FP512BN.h"
+#include "config_curve_FP512BN.h"
+
+using namespace core;
+
+
+namespace FP512BN {
+
+extern const B512_60::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B512_60::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+}
+
+namespace FP512BN {
+
+/**
+	@brief ECP2 Structure - Elliptic Curve Point over quadratic extension field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag */
+    FP512BN::FP2 x;   /**< x-coordinate of point */
+    FP512BN::FP2 y;   /**< y-coordinate of point */
+    FP512BN::FP2 z;   /**< z-coordinate of point */
+} ECP2;
+
+
+/* Curve Params - see rom*.cpp */
+
+extern const int CURVE_B_I;		/**< Elliptic curve B parameter */
+extern const B512_60::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B512_60::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B512_60::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B512_60::BIG CURVE_Bnx;   /**< Elliptic curve parameter */
+extern const B512_60::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+
+/* Generator point on G1 */
+extern const B512_60::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B512_60::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B512_60::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+/* ECP2 E(Fp2) prototypes */
+/**	@brief Tests for ECP2 point equal to infinity
+ *
+	@param P ECP2 point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP2_isinf(ECP2 *P);
+/**	@brief Copy ECP2 point to another ECP2 point
+ *
+	@param P ECP2 instance, on exit = Q
+	@param Q ECP2 instance to be copied
+ */
+extern void ECP2_copy(ECP2 *P, ECP2 *Q);
+/**	@brief Set ECP2 to point-at-infinity
+ *
+	@param P ECP2 instance to be set to infinity
+ */
+extern void ECP2_inf(ECP2 *P);
+/**	@brief Tests for equality of two ECP2s
+ *
+	@param P ECP2 instance to be compared
+	@param Q ECP2 instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP2_equals(ECP2 *P, ECP2 *Q);
+/**	@brief Converts an ECP2 point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP2 instance to be converted to affine form
+ */
+extern void ECP2_affine(ECP2 *P);
+/**	@brief Extract x and y coordinates of an ECP2 point P
+ *
+	If x=y, returns only x
+	@param x FP2 on exit = x coordinate of point
+	@param y FP2 on exit = y coordinate of point (unless x=y)
+	@param P ECP2 instance (x,y)
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP2_get(FP512BN::FP2 *x, FP512BN::FP2 *y, ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, converted to affine coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_output(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, in projective coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_outputxyz(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to an octet string
+ *
+	The octet string is created in the form x|y or just x if compressed
+	Convert the real and imaginary parts of the x and y coordinates to big-endian base 256 form.
+    If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param S output octet string
+	@param P ECP2 instance to be converted to an octet string
+    @param c true for compression
+ */
+extern void ECP2_toOctet(octet *S, ECP2 *P, bool c);
+/**	@brief Creates an ECP2 point from an octet string
+ *
+	The octet string is in the form x|y
+	The real and imaginary parts of the x and y coordinates are in big-endian base 256 form.
+    If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP2 instance to be created from the octet string
+	@param S input octet string
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP2_fromOctet(ECP2 *P, octet *S);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x)=x^3+Ax+B
+	Used internally.
+	@param r FP2 value of f(x)
+	@param x FP2 instance
+ */
+extern void ECP2_rhs(FP512BN::FP2 *r, FP512BN::FP2 *x);
+/**	@brief Set ECP2 to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP2 instance to be set (x,y)
+	@param x FP2 x coordinate of point
+	@param y FP2 y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_set(ECP2 *P, FP512BN::FP2 *x, FP512BN::FP2 *y);
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Otherwise y coordinate is calculated from x.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+    @param s sign of y
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_setx(ECP2 *P, FP512BN::FP2 *x, int s);
+/**	@brief Negation of an ECP2 point
+ *
+	@param P ECP2 instance, on exit = -P
+ */
+extern void ECP2_neg(ECP2 *P);
+/**	@brief Doubles an ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =2*P
+ */
+extern int ECP2_dbl(ECP2 *P);
+/**	@brief Adds ECP2 instance Q to ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P+Q
+	@param Q ECP2 instance to be added to P
+ */
+extern int ECP2_add(ECP2 *P, ECP2 *Q);
+/**	@brief Subtracts ECP instance Q from ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P-Q
+	@param Q ECP2 instance to be subtracted from P
+ */
+extern void ECP2_sub(ECP2 *P, ECP2 *Q);
+/**	@brief Multiplies an ECP2 instance P by a BIG, side-channel resistant
+ *
+	Uses fixed sized windows.
+	@param P ECP2 instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP2_mul(ECP2 *P, B512_60::BIG b);
+/**	@brief Multiplies an ECP2 instance P by the internal modulus p, using precalculated Frobenius constant f
+ *
+	Fast point multiplication using Frobenius
+	@param P ECP2 instance, on exit = p*P
+	@param f FP2 precalculated Frobenius constant
+
+ */
+extern void ECP2_frob(ECP2 *P, FP512BN::FP2 *f);
+/**	@brief Calculates P=b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+ *
+	@param P ECP2 instance, on exit = b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+	@param Q ECP2 array of 4 points
+	@param b BIG array of 4 multipliers
+ */
+extern void ECP2_mul4(ECP2 *P, ECP2 *Q, B512_60::BIG *b);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP2 multiplied by co-factor
+ */
+extern void ECP2_cfp(ECP2 *Q);
+
+/**	@brief Maps random FP2 to curve point in constant time
+ *
+	@param Q ECP2 instance 
+	@param x FP2 derived from hash
+ */
+extern void ECP2_map2point(ECP2 *Q, FP512BN::FP2 *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP2 instance 
+	@param x Fp derived from hash
+ */
+extern void ECP2_hap2point(ECP2 *Q, B512_60::BIG  x);
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param P ECP2 instance of correct order
+	@param W OCTET byte array to be mapped
+ */
+extern void ECP2_mapit(ECP2 *P, octet *w);
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP2 instance
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_generator(ECP2 *G);
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp4.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp4.cpp
new file mode 100644
index 0000000..cdcfd15
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp4.cpp
@@ -0,0 +1,952 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* CORE Weierstrass elliptic curve functions over FP2 */
+
+//#include <iostream>
+#include "ecp4_ZZZ.h"
+
+using namespace std;
+using namespace XXX;
+using namespace YYY;
+
+int ZZZ::ECP4_isinf(ECP4 *P)
+{
+    return (FP4_iszilch(&(P->x)) & FP4_iszilch(&(P->z)));
+}
+
+/* Set P=Q */
+void ZZZ::ECP4_copy(ECP4 *P, ECP4 *Q)
+{
+    FP4_copy(&(P->x), &(Q->x));
+    FP4_copy(&(P->y), &(Q->y));
+    FP4_copy(&(P->z), &(Q->z));
+}
+
+/* set P to Infinity */
+void ZZZ::ECP4_inf(ECP4 *P)
+{
+    FP4_zero(&(P->x));
+    FP4_one(&(P->y));
+    FP4_zero(&(P->z));
+}
+
+/* Conditional move Q to P dependant on d */
+static void ECP4_cmove(ZZZ::ECP4 *P, ZZZ::ECP4 *Q, int d)
+{
+    FP4_cmove(&(P->x), &(Q->x), d);
+    FP4_cmove(&(P->y), &(Q->y), d);
+    FP4_cmove(&(P->z), &(Q->z), d);
+}
+
+/* return 1 if b==c, no branching */
+static int teq(sign32 b, sign32 c)
+{
+    sign32 x = b ^ c;
+    x -= 1; // if x=0, x now -1
+    return (int)((x >> 31) & 1);
+}
+
+/* Constant time select from pre-computed table */
+static void ECP4_select(ZZZ::ECP4 *P, ZZZ::ECP4 W[], sign32 b)
+{
+    ZZZ::ECP4 MP;
+    sign32 m = b >> 31;
+    sign32 babs = (b ^ m) - m;
+
+    babs = (babs - 1) / 2;
+
+    ECP4_cmove(P, &W[0], teq(babs, 0)); // conditional move
+    ECP4_cmove(P, &W[1], teq(babs, 1));
+    ECP4_cmove(P, &W[2], teq(babs, 2));
+    ECP4_cmove(P, &W[3], teq(babs, 3));
+    ECP4_cmove(P, &W[4], teq(babs, 4));
+    ECP4_cmove(P, &W[5], teq(babs, 5));
+    ECP4_cmove(P, &W[6], teq(babs, 6));
+    ECP4_cmove(P, &W[7], teq(babs, 7));
+
+    ECP4_copy(&MP, P);
+    ECP4_neg(&MP);  // minus P
+    ECP4_cmove(P, &MP, (int)(m & 1));
+}
+
+/* Make P affine (so z=1) */
+void ZZZ::ECP4_affine(ECP4 *P)
+{
+    FP4 one, iz;
+    if (ECP4_isinf(P)) return;
+
+    FP4_one(&one);
+    if (FP4_isunity(&(P->z)))
+    {
+        FP4_reduce(&(P->x));
+        FP4_reduce(&(P->y));
+        return;
+    }
+
+    FP4_inv(&iz, &(P->z),NULL);
+    FP4_mul(&(P->x), &(P->x), &iz);
+    FP4_mul(&(P->y), &(P->y), &iz);
+
+    FP4_reduce(&(P->x));
+    FP4_reduce(&(P->y));
+    FP4_copy(&(P->z), &one);
+}
+
+/* return 1 if P==Q, else 0 */
+/* SU= 312 */
+int ZZZ::ECP4_equals(ECP4 *P, ECP4 *Q)
+{
+    FP4 a, b;
+
+    FP4_mul(&a, &(P->x), &(Q->z));
+    FP4_mul(&b, &(Q->x), &(P->z));
+    if (!FP4_equals(&a, &b)) return 0;
+
+    FP4_mul(&a, &(P->y), &(Q->z));
+    FP4_mul(&b, &(Q->y), &(P->z));
+    if (!FP4_equals(&a, &b)) return 0;
+    return 1;
+
+}
+
+/* extract x, y from point P */
+int ZZZ::ECP4_get(FP4 *x, FP4 *y, ECP4 *P)
+{
+    ECP4 W;
+    ECP4_copy(&W, P);
+    ECP4_affine(&W);
+    if (ECP4_isinf(&W)) return -1;
+    FP4_copy(y, &(W.y));
+    FP4_copy(x, &(W.x));
+    return 0;
+}
+
+/* Output point P */
+void ZZZ::ECP4_output(ECP4 *P)
+{
+    FP4 x, y;
+    if (ECP4_isinf(P))
+    {
+        printf("Infinity\n");
+        return;
+    }
+    ECP4_get(&x, &y, P);
+    printf("(");
+    FP4_output(&x);
+    printf(",");
+    FP4_output(&y);
+    printf(")\n");
+}
+
+/* Convert Q to octet string */
+void ZZZ::ECP4_toOctet(octet *W, ECP4 *Q,bool compress)
+{
+    FP4 qx, qy;
+    bool alt=false;
+    ECP4_get(&qx, &qy, Q);
+  
+#if (MBITS-1)%8 <= 4
+#ifdef ALLOW_ALT_COMPRESS_ZZZ
+    alt=true;
+#endif
+#endif
+
+    if (alt)
+    {
+        FP4_toBytes(&(W->val[0]),&qx);
+        if (!compress)
+        {
+            W->len=8*MODBYTES_XXX;
+            FP4_toBytes(&(W->val[4*MODBYTES_XXX]), &qy);
+        } else {
+            W->val[0]|=0x80;
+            if (FP4_islarger(&qy)==1) W->val[0]|=0x20;
+            W->len=4*MODBYTES_XXX;
+        }
+    } else {
+        FP4_toBytes(&(W->val[1]),&qx);
+        if (!compress)
+        {
+            W->val[0] = 0x04;
+            FP4_toBytes(&(W->val[4 * MODBYTES_XXX+1]), &qy);
+            W->len = 8 * MODBYTES_XXX+1;
+        } else {
+            W->val[0]=0x02;
+            if (FP4_sign(&qy)==1) W->val[0] = 0x03;
+            W->len = 4 * MODBYTES_XXX+1;
+        }
+    }
+}
+
+/* restore Q from octet string */
+int ZZZ::ECP4_fromOctet(ECP4 *Q, octet *W)
+{
+    FP4 qx, qy;
+    bool alt=false;
+    int sgn,cmp,typ = W->val[0];
+
+#if (MBITS-1)%8 <= 4
+#ifdef ALLOW_ALT_COMPRESS_ZZZ
+    alt=true;
+#endif
+#endif
+
+    if (alt)
+    {
+        W->val[0]&=0x1f;
+        FP4_fromBytes(&qx,&(W->val[0]));
+        W->val[0]=typ;
+        if ((typ&0x80)==0)
+        {
+            FP4_fromBytes(&qy,&(W->val[4*MODBYTES_XXX]));
+            if (ECP4_set(Q, &qx, &qy)) return 1;
+            return 0;
+        } else {
+            if (!ECP4_setx(Q,&qx,0)) return 0;
+            sgn=(typ&0x20)>>5;
+            cmp=FP4_islarger(&(Q->y));
+            if ((sgn==1 && cmp!=1) || (sgn==0 && cmp==1)) ECP4_neg(Q);
+            return 1;
+        }
+    } else {
+        FP4_fromBytes(&qx,&(W->val[1]));
+        if (typ == 0x04)
+        {
+            FP4_fromBytes(&qy,&(W->val[4 * MODBYTES_XXX+1]));
+            if (ECP4_set(Q, &qx, &qy)) return 1;
+        } else {
+            if (ECP4_setx(Q, &qx, typ&1)) return 1;
+        }
+    }
+    return 0;
+}
+
+/* Calculate RHS of twisted curve equation x^3+B/i or x^3+Bi*/
+void ZZZ::ECP4_rhs(FP4 *rhs, FP4 *x)
+{
+    /* calculate RHS of elliptic curve equation */
+    FP4 t;
+    FP2 t2;
+    BIG b;
+    FP4_sqr(&t, x);
+
+    FP4_mul(rhs, &t, x);
+
+    /* Assuming CURVE_A=0 */
+
+    BIG_rcopy(b, CURVE_B);
+
+    FP2_from_BIG(&t2, b);
+    FP4_from_FP2(&t, &t2);
+
+#if SEXTIC_TWIST_ZZZ == D_TYPE
+    FP4_div_i(&t);   /* IMPORTANT - here we use the correct SEXTIC twist of the curve */
+#endif
+
+#if SEXTIC_TWIST_ZZZ == M_TYPE
+    FP4_times_i(&t);   /* IMPORTANT - here we use the correct SEXTIC twist of the curve */
+#endif
+
+    FP4_add(rhs, &t, rhs);
+    FP4_reduce(rhs);
+}
+
+/* Set P=(x,y). Return 1 if (x,y) is on the curve, else return 0*/
+/* SU= 232 */
+int ZZZ::ECP4_set(ECP4 *P, FP4 *x, FP4 *y)
+{
+    FP4 rhs, y2;
+
+    FP4_sqr(&y2, y);
+    ECP4_rhs(&rhs, x);
+
+    if (!FP4_equals(&y2, &rhs))
+    {
+        ECP4_inf(P);
+        return 0;
+    }
+
+    FP4_copy(&(P->x), x);
+    FP4_copy(&(P->y), y);
+
+    FP4_one(&(P->z));
+    return 1;
+}
+
+/* Set P=(x,y). Return 1 if (x,.) is on the curve, else return 0 */
+/* SU= 232 */
+int ZZZ::ECP4_setx(ECP4 *P, FP4 *x, int s)
+{
+    FP4 y;
+    FP hint;
+    ECP4_rhs(&y, x);
+
+    if (!FP4_qr(&y,&hint))
+    {
+        ECP4_inf(P);
+        return 0;
+    }
+    FP4_sqrt(&y, &y, &hint);
+    
+    FP4_copy(&(P->x), x);
+    FP4_copy(&(P->y), &y);
+    FP4_one(&(P->z));
+
+    if (FP4_sign(&(P->y)) != s)
+        FP4_neg(&(P->y),&(P->y));
+    FP4_reduce(&(P->y));
+
+    return 1;
+}
+
+/* Set P=-P */
+/* SU= 8 */
+void ZZZ::ECP4_neg(ECP4 *P)
+{
+    FP4_norm(&(P->y));
+    FP4_neg(&(P->y), &(P->y));
+    FP4_norm(&(P->y));
+}
+
+/* R+=R */
+/* return -1 for Infinity, 0 for addition, 1 for doubling */
+int ZZZ::ECP4_dbl(ECP4 *P)
+{
+    FP4 t0, t1, t2, t3, iy, x3, y3;
+
+    FP4_copy(&iy, &(P->y));     //FP4 iy=new FP4(y);
+#if SEXTIC_TWIST_ZZZ==D_TYPE
+    FP4_times_i(&iy);           //iy.mul_ip();
+#endif
+
+    FP4_sqr(&t0, &(P->y));          //t0.sqr();
+#if SEXTIC_TWIST_ZZZ==D_TYPE
+    FP4_times_i(&t0);           //t0.mul_ip();
+#endif
+
+    FP4_mul(&t1, &iy, &(P->z)); //t1.mul(z);
+    FP4_sqr(&t2, &(P->z));              //t2.sqr();
+
+    FP4_add(&(P->z), &t0, &t0); //z.add(t0);
+    FP4_norm(&(P->z));              //z.norm();
+    FP4_add(&(P->z), &(P->z), &(P->z)); //z.add(z);
+    FP4_add(&(P->z), &(P->z), &(P->z)); //z.add(z);
+    FP4_norm(&(P->z));          //z.norm();
+
+    FP4_imul(&t2, &t2, 3 * CURVE_B_I); //t2.imul(3*ROM.CURVE_B_I);
+#if SEXTIC_TWIST_ZZZ==M_TYPE
+    FP4_times_i(&t2);
+#endif
+
+    FP4_mul(&x3, &t2, &(P->z)); //x3.mul(z);
+
+    FP4_add(&y3, &t0, &t2);     //y3.add(t2);
+    FP4_norm(&y3);              //y3.norm();
+    FP4_mul(&(P->z), &(P->z), &t1); //z.mul(t1);
+
+    FP4_add(&t1, &t2, &t2);     //t1.add(t2);
+    FP4_add(&t2, &t2, &t1);     //t2.add(t1);
+    FP4_norm(&t2);              //t2.norm();
+    FP4_sub(&t0, &t0, &t2);     //t0.sub(t2);
+    FP4_norm(&t0);              //t0.norm();                           //y^2-9bz^2
+    FP4_mul(&y3, &y3, &t0);     //y3.mul(t0);
+    FP4_add(&(P->y), &y3, &x3);     //y3.add(x3);                          //(y^2+3z*2)(y^2-9z^2)+3b.z^2.8y^2
+
+    FP4_mul(&t1, &(P->x), &iy);     //t1.mul(iy);                       //
+
+    FP4_norm(&t0);          //x.norm();
+    FP4_mul(&(P->x), &t0, &t1); //x.mul(t1);
+    FP4_add(&(P->x), &(P->x), &(P->x)); //x.add(x);       //(y^2-9bz^2)xy2
+
+    FP4_norm(&(P->x));          //x.norm();
+
+    FP4_norm(&(P->y));          //y.norm();
+
+    return 1;
+}
+
+/* Set P+=Q */
+
+int ZZZ::ECP4_add(ECP4 *P, ECP4 *Q)
+{
+    FP4 t0, t1, t2, t3, t4, x3, y3, z3;
+    int b3 = 3 * CURVE_B_I;
+
+    FP4_mul(&t0, &(P->x), &(Q->x)); //t0.mul(Q.x);         // x.Q.x
+    FP4_mul(&t1, &(P->y), &(Q->y)); //t1.mul(Q.y);       // y.Q.y
+
+    FP4_mul(&t2, &(P->z), &(Q->z)); //t2.mul(Q.z);
+    FP4_add(&t3, &(P->x), &(P->y)); //t3.add(y);
+    FP4_norm(&t3);              //t3.norm();          //t3=X1+Y1
+    FP4_add(&t4, &(Q->x), &(Q->y)); //t4.add(Q.y);
+    FP4_norm(&t4);              //t4.norm();            //t4=X2+Y2
+    FP4_mul(&t3, &t3, &t4);     //t3.mul(t4);                       //t3=(X1+Y1)(X2+Y2)
+    FP4_add(&t4, &t0, &t1);     //t4.add(t1);       //t4=X1.X2+Y1.Y2
+
+    FP4_sub(&t3, &t3, &t4);     //t3.sub(t4);
+    FP4_norm(&t3);              //t3.norm();
+#if SEXTIC_TWIST_ZZZ==D_TYPE
+    FP4_times_i(&t3);           //t3.mul_ip();
+#endif
+
+    FP4_add(&t4, &(P->y), &(P->z)); //t4.add(z);
+    FP4_norm(&t4);              //t4.norm();            //t4=Y1+Z1
+
+    FP4_add(&x3, &(Q->y), &(Q->z)); //x3.add(Q.z);
+    FP4_norm(&x3);              //x3.norm();            //x3=Y2+Z2
+
+    FP4_mul(&t4, &t4, &x3);     //t4.mul(x3);                       //t4=(Y1+Z1)(Y2+Z2)
+
+    FP4_add(&x3, &t1, &t2);     //x3.add(t2);                       //X3=Y1.Y2+Z1.Z2
+
+    FP4_sub(&t4, &t4, &x3);     //t4.sub(x3);
+    FP4_norm(&t4);              //t4.norm();
+#if SEXTIC_TWIST_ZZZ==D_TYPE
+    FP4_times_i(&t4);           //t4.mul_ip();
+#endif
+
+    FP4_add(&x3, &(P->x), &(P->z)); //x3.add(z);
+    FP4_norm(&x3);              //x3.norm();    // x3=X1+Z1
+
+    FP4_add(&y3, &(Q->x), &(Q->z)); //y3.add(Q.z);
+    FP4_norm(&y3);              //y3.norm();                // y3=X2+Z2
+    FP4_mul(&x3, &x3, &y3);     //x3.mul(y3);                           // x3=(X1+Z1)(X2+Z2)
+
+    FP4_add(&y3, &t0, &t2);     //y3.add(t2);                           // y3=X1.X2+Z1+Z2
+    FP4_sub(&y3, &x3, &y3);     //y3.rsub(x3);
+    FP4_norm(&y3);              //y3.norm();                // y3=(X1+Z1)(X2+Z2) - (X1.X2+Z1.Z2) = X1.Z2+X2.Z1
+#if SEXTIC_TWIST_ZZZ==D_TYPE
+    FP4_times_i(&t0);           //t0.mul_ip();
+    FP4_times_i(&t1);           //t1.mul_ip();
+#endif
+
+    FP4_add(&x3, &t0, &t0);     //x3.add(t0);
+    FP4_add(&t0, &t0, &x3);     //t0.add(x3);
+    FP4_norm(&t0);              //t0.norm();
+    FP4_imul(&t2, &t2, b3);     //t2.imul(b);
+#if SEXTIC_TWIST_ZZZ==M_TYPE
+    FP4_times_i(&t2);
+#endif
+
+    FP4_add(&z3, &t1, &t2);     //z3.add(t2);
+    FP4_norm(&z3);              //z3.norm();
+    FP4_sub(&t1, &t1, &t2);     //t1.sub(t2);
+    FP4_norm(&t1);              //t1.norm();
+    FP4_imul(&y3, &y3, b3);     //y3.imul(b);
+#if SEXTIC_TWIST_ZZZ==M_TYPE
+    FP4_times_i(&y3);
+#endif
+
+    FP4_mul(&x3, &y3, &t4);     //x3.mul(t4);
+
+    FP4_mul(&t2, &t3, &t1);     //t2.mul(t1);
+    FP4_sub(&(P->x), &t2, &x3);     //x3.rsub(t2);
+    FP4_mul(&y3, &y3, &t0);     //y3.mul(t0);
+    FP4_mul(&t1, &t1, &z3);     //t1.mul(z3);
+    FP4_add(&(P->y), &y3, &t1);     //y3.add(t1);
+    FP4_mul(&t0, &t0, &t3);     //t0.mul(t3);
+    FP4_mul(&z3, &z3, &t4);     //z3.mul(t4);
+    FP4_add(&(P->z), &z3, &t0);     //z3.add(t0);
+
+    FP4_norm(&(P->x));          //x.norm();
+    FP4_norm(&(P->y));          //y.norm();
+    FP4_norm(&(P->z));          //z.norm();
+
+    return 0;
+}
+
+/* Set P-=Q */
+/* SU= 16 */
+void ZZZ::ECP4_sub(ECP4 *P, ECP4 *Q)
+{
+    ECP4 NQ;
+    ECP4_copy(&NQ, Q);
+    ECP4_neg(&NQ);
+    ECP4_add(P, &NQ);
+}
+
+
+void ZZZ::ECP4_reduce(ECP4 *P)
+{
+    FP4_reduce(&(P->x));
+    FP4_reduce(&(P->y));
+    FP4_reduce(&(P->z));
+}
+
+/* P*=e */
+/* SU= 280 */
+void ZZZ::ECP4_mul(ECP4 *P, BIG e)
+{
+    /* fixed size windows */
+    int i, nb, s, ns;
+    BIG mt, t;
+    ECP4 Q, W[8], C;
+    sign8 w[1 + (NLEN_XXX * BASEBITS_XXX + 3) / 4];
+
+    if (ECP4_isinf(P)) return;
+
+    /* precompute table */
+
+    ECP4_copy(&Q, P);
+    ECP4_dbl(&Q);
+    ECP4_copy(&W[0], P);
+
+    for (i = 1; i < 8; i++)
+    {
+        ECP4_copy(&W[i], &W[i - 1]);
+        ECP4_add(&W[i], &Q);
+    }
+
+    /* make exponent odd - add 2P if even, P if odd */
+    BIG_copy(t, e);
+    s = BIG_parity(t);
+    BIG_inc(t, 1);
+    BIG_norm(t);
+    ns = BIG_parity(t);
+    BIG_copy(mt, t);
+    BIG_inc(mt, 1);
+    BIG_norm(mt);
+    BIG_cmove(t, mt, s);
+    ECP4_cmove(&Q, P, ns);
+    ECP4_copy(&C, &Q);
+
+    nb = 1 + (BIG_nbits(t) + 3) / 4;
+
+    /* convert exponent to signed 4-bit window */
+    for (i = 0; i < nb; i++)
+    {
+        w[i] = BIG_lastbits(t, 5) - 16;
+        BIG_dec(t, w[i]);
+        BIG_norm(t);
+        BIG_fshr(t, 4);
+    }
+    w[nb] = BIG_lastbits(t, 5);
+
+    //ECP4_copy(P, &W[(w[nb] - 1) / 2]);
+    ECP4_select(P, W, w[nb]);
+    for (i = nb - 1; i >= 0; i--)
+    {
+        ECP4_select(&Q, W, w[i]);
+        ECP4_dbl(P);
+        ECP4_dbl(P);
+        ECP4_dbl(P);
+        ECP4_dbl(P);
+        ECP4_add(P, &Q);
+    }
+    ECP4_sub(P, &C); /* apply correction */
+    ECP4_affine(P);
+}
+
+// calculate frobenius constants
+void ZZZ::ECP4_frob_constants(FP2 F[3])
+{
+    FP fx, fy;
+    FP2 X;
+
+    FP_rcopy(&fx, Fra);
+    FP_rcopy(&fy, Frb);
+    FP2_from_FPs(&X, &fx, &fy);
+
+    FP2_sqr(&F[0], &X);     // FF=F^2=(1+i)^(p-7)/6
+    FP2_copy(&F[2], &F[0]);
+    FP2_mul_ip(&F[2]);      // W=(1+i)^6/6.(1+i)^(p-7)/6 = (1+i)^(p-1)/6
+    FP2_norm(&F[2]);
+    FP2_sqr(&F[1], &F[2]);
+    FP2_mul(&F[2], &F[2], &F[1]); // W=(1+i)^(p-1)/2
+
+    FP2_copy(&F[1], &X);
+
+#if SEXTIC_TWIST_ZZZ == M_TYPE
+    FP2_mul_ip(&F[1]);      // (1+i)^12/12.(1+i)^(p-7)/12 = (1+i)^(p+5)/12
+    FP2_inv(&F[1], &F[1], NULL);      // (1+i)^-(p+5)/12
+    FP2_sqr(&F[0], &F[1]);      // (1+i)^-(p+5)/6
+#endif
+
+    FP2_mul_ip(&F[0]);      // FF=(1+i)^(p-7)/6.(1+i) = (1+i)^(p-1)/6                   // (1+i)^6/6.(1+i)^-(p+5)/6 = (1+i)^-(p-1)/6
+    FP2_norm(&F[0]);
+    FP2_mul(&F[1], &F[1], &F[0]); // FFF = (1+i)^(p-7)/12 . (1+i)^(p-1)/6 = (1+i)^(p-3)/4    // (1+i)^-(p+5)/12 . (1+i)^-(p-1)/6 = (1+i)^-(p+1)/4
+
+}
+
+/* Calculates q^n.P using Frobenius constants */
+void ZZZ::ECP4_frob(ECP4 *P, FP2 F[3], int n)
+{
+    int i;
+    FP4 X, Y, Z;
+
+    FP4_copy(&X, &(P->x));
+    FP4_copy(&Y, &(P->y));
+    FP4_copy(&Z, &(P->z));
+
+    for (i = 0; i < n; i++)
+    {
+        FP4_frob(&X, &F[2]);    // X^p
+        FP4_pmul(&X, &X, &F[0]); // X^p.(1+i)^(p-1)/6                                    // X^p.(1+i)^-(p-1)/6
+
+        FP4_frob(&Y, &F[2]);    // Y^p
+        FP4_pmul(&Y, &Y, &F[1]);
+        FP4_times_i(&Y);        // Y.p.(1+i)^(p-3)/4.(1+i)^(2/4) = Y^p.(1+i)^(p-1)/4    // (1+i)^-(p+1)/4 .(1+i)^2/4 = Y^p.(1+i)^-(p-1)/4
+
+        FP4_frob(&Z, &F[2]);
+    }
+
+    FP4_copy(&(P->x), &X);
+    FP4_copy(&(P->y), &Y);
+    FP4_copy(&(P->z), &Z);
+
+
+    //ECP4_set(P,&X,&Y);
+}
+
+/* Side channel attack secure */
+// Bos & Costello https://eprint.iacr.org/2013/458.pdf
+// Faz-Hernandez & Longa & Sanchez  https://eprint.iacr.org/2013/158.pdf
+
+void ZZZ::ECP4_mul8(ECP4 *P, ECP4 Q[8], BIG u[8])
+{
+    int i, j, k, nb, pb1, pb2, bt;
+    ECP4 T1[8], T2[8], W;
+    BIG mt, t[8];
+    sign8 w1[NLEN_XXX * BASEBITS_XXX + 1];
+    sign8 s1[NLEN_XXX * BASEBITS_XXX + 1];
+    sign8 w2[NLEN_XXX * BASEBITS_XXX + 1];
+    sign8 s2[NLEN_XXX * BASEBITS_XXX + 1];
+//  FP2 X[3];
+    /*
+        ECP4_frob_constants(X);
+    */
+    for (i = 0; i < 8; i++)
+    {
+        BIG_copy(t[i], u[i]);
+    }
+// Precomputed tables
+    ECP4_copy(&T1[0], &Q[0]); // Q[0]
+    ECP4_copy(&T1[1], &T1[0]);
+    ECP4_add(&T1[1], &Q[1]); // Q[0]+Q[1]
+    ECP4_copy(&T1[2], &T1[0]);
+    ECP4_add(&T1[2], &Q[2]); // Q[0]+Q[2]
+    ECP4_copy(&T1[3], &T1[1]);
+    ECP4_add(&T1[3], &Q[2]); // Q[0]+Q[1]+Q[2]
+    ECP4_copy(&T1[4], &T1[0]);
+    ECP4_add(&T1[4], &Q[3]); // Q[0]+Q[3]
+    ECP4_copy(&T1[5], &T1[1]);
+    ECP4_add(&T1[5], &Q[3]); // Q[0]+Q[1]+Q[3]
+    ECP4_copy(&T1[6], &T1[2]);
+    ECP4_add(&T1[6], &Q[3]); // Q[0]+Q[2]+Q[3]
+    ECP4_copy(&T1[7], &T1[3]);
+    ECP4_add(&T1[7], &Q[3]); // Q[0]+Q[1]+Q[2]+Q[3]
+
+    ECP4_copy(&T2[0], &Q[4]); // Q[0]
+    ECP4_copy(&T2[1], &T2[0]);
+    ECP4_add(&T2[1], &Q[5]); // Q[0]+Q[1]
+    ECP4_copy(&T2[2], &T2[0]);
+    ECP4_add(&T2[2], &Q[6]); // Q[0]+Q[2]
+    ECP4_copy(&T2[3], &T2[1]);
+    ECP4_add(&T2[3], &Q[6]); // Q[0]+Q[1]+Q[2]
+    ECP4_copy(&T2[4], &T2[0]);
+    ECP4_add(&T2[4], &Q[7]); // Q[0]+Q[3]
+    ECP4_copy(&T2[5], &T2[1]);
+    ECP4_add(&T2[5], &Q[7]); // Q[0]+Q[1]+Q[3]
+    ECP4_copy(&T2[6], &T2[2]);
+    ECP4_add(&T2[6], &Q[7]); // Q[0]+Q[2]+Q[3]
+    ECP4_copy(&T2[7], &T2[3]);
+    ECP4_add(&T2[7], &Q[7]); // Q[0]+Q[1]+Q[2]+Q[3]
+
+//  Use Frobenius
+    /*
+        for (i=0;i<8;i++)
+        {
+            ECP4_copy(&T2[i],&T1[i]);
+            ECP4_frob(&T2[i],X,4);
+        }
+    */
+// Make them odd
+    pb1 = 1 - BIG_parity(t[0]);
+    BIG_inc(t[0], pb1);
+    BIG_norm(t[0]);
+
+    pb2 = 1 - BIG_parity(t[4]);
+    BIG_inc(t[4], pb2);
+    BIG_norm(t[4]);
+
+// Number of bits
+    BIG_zero(mt);
+    for (i = 0; i < 8; i++)
+    {
+        BIG_or(mt, mt, t[i]);
+    }
+    nb = 1 + BIG_nbits(mt);
+
+// Sign pivot
+    s1[nb - 1] = 1;
+    s2[nb - 1] = 1;
+    for (i = 0; i < nb - 1; i++)
+    {
+        BIG_fshr(t[0], 1);
+        s1[i] = 2 * BIG_parity(t[0]) - 1;
+        BIG_fshr(t[4], 1);
+        s2[i] = 2 * BIG_parity(t[4]) - 1;
+    }
+
+
+// Recoded exponents
+    for (i = 0; i < nb; i++)
+    {
+        w1[i] = 0;
+        k = 1;
+        for (j = 1; j < 4; j++)
+        {
+            bt = s1[i] * BIG_parity(t[j]);
+            BIG_fshr(t[j], 1);
+
+            BIG_dec(t[j], (bt >> 1));
+            BIG_norm(t[j]);
+            w1[i] += bt * k;
+            k *= 2;
+        }
+
+        w2[i] = 0;
+        k = 1;
+        for (j = 5; j < 8; j++)
+        {
+            bt = s2[i] * BIG_parity(t[j]);
+            BIG_fshr(t[j], 1);
+
+            BIG_dec(t[j], (bt >> 1));
+            BIG_norm(t[j]);
+            w2[i] += bt * k;
+            k *= 2;
+        }
+    }
+
+// Main loop
+    ECP4_select(P, T1, 2 * w1[nb - 1] + 1);
+    ECP4_select(&W, T2, 2 * w2[nb - 1] + 1);
+    ECP4_add(P, &W);
+    for (i = nb - 2; i >= 0; i--)
+    {
+        ECP4_dbl(P);
+        ECP4_select(&W, T1, 2 * w1[i] + s1[i]);
+        ECP4_add(P, &W);
+        ECP4_select(&W, T2, 2 * w2[i] + s2[i]);
+        ECP4_add(P, &W);
+    }
+
+// apply corrections
+    ECP4_copy(&W, P);
+    ECP4_sub(&W, &Q[0]);
+    ECP4_cmove(P, &W, pb1);
+    ECP4_copy(&W, P);
+    ECP4_sub(&W, &Q[4]);
+    ECP4_cmove(P, &W, pb2);
+
+    ECP4_affine(P);
+}
+
+/* Hunt and Peck a BIG to G2 curve point */
+/*
+void ZZZ::ECP4_hap2point(ECP4 *Q,BIG h)
+{
+    BIG one,hv;
+    FP2 X2;
+    FP4 X4;
+    BIG_one(one);
+    BIG_copy(hv,h);
+
+    for (;;)
+    {
+        FP2_from_BIGs(&X2,one,hv); 
+		FP4_from_FP2(&X4,&X2);
+        if (ECP4_setx(Q,&X4,0)) break;
+        BIG_inc(hv,1);
+        BIG_norm(hv);
+    }
+}
+*/
+/* Constant time Map BIG to Point in G2 */
+void ZZZ::ECP4_map2point(ECP4 *Q,FP4 *H)
+{
+    int sgn,ne;
+    FP4 X1,X2,X3,W,Y,T,A,NY;
+    FP Z,s;
+
+    FP4_one(&NY);
+    FP4_copy(&T,H);
+    sgn=FP4_sign(&T);
+     
+    FP_from_int(&Z,RIADZG2A_YYY);
+    FP4_from_FP(&A,&Z);
+    ECP4_rhs(&A,&A);  // A=g(Z)
+
+    FP4_sqrt(&W,&A,NULL);
+    FP_rcopy(&s,SQRTm3);
+
+    FP_mul(&Z,&Z,&s);
+
+    FP4_sqr(&T,&T);   
+    FP4_mul(&Y,&A,&T);   // tv1=u^2*g(Z)
+    FP4_add(&T,&NY,&Y); FP4_norm(&T); // tv2=1+tv1
+    FP4_sub(&Y,&NY,&Y); FP4_norm(&Y); // tv1=1-tv1 
+    FP4_mul(&NY,&T,&Y);
+
+    FP4_qmul(&NY,&NY,&Z);
+
+    FP4_inv(&NY,&NY,NULL);     // tv3=inv0(tv1*tv2*Z*sqrt(-3))
+    FP4_qmul(&W,&W,&Z); // tv4=Z*sqrt(-3).sqrt(g(Z))
+    if (FP4_sign(&W)==1)
+    {
+        FP4_neg(&W,&W);
+        FP4_norm(&W);
+    }
+    FP4_qmul(&W,&W,&Z);
+    FP4_mul(&W,&W,H);
+    FP4_mul(&W,&W,&Y);
+    FP4_mul(&W,&W,&NY);     // tv5=u*tv1*tv3*tv4*Z*sqrt(-3)
+   
+    FP_from_int(&s,RIADZG2A_YYY);
+    FP4_from_FP(&X1,&s);
+
+    FP4_copy(&X3,&X1);
+    FP4_neg(&X1,&X1); FP4_norm(&X1); FP4_div2(&X1,&X1); // -Z/2
+    FP4_copy(&X2,&X1);
+    FP4_sub(&X1,&X1,&W); FP4_norm(&X1);
+    FP4_add(&X2,&X2,&W); FP4_norm(&X2);
+    FP4_add(&A,&A,&A);
+    FP4_add(&A,&A,&A); 
+    FP4_norm(&A);      // 4*g(Z)
+    FP4_sqr(&T,&T);
+    FP4_mul(&T,&T,&NY);
+    FP4_sqr(&T,&T);    // (tv2^2*tv3)^2
+    FP4_mul(&A,&A,&T); // -4*g(Z)*(tv2^2*tv3)^2
+
+    FP4_add(&X3,&X3,&A); FP4_norm(&X3);
+
+    ECP4_rhs(&W,&X2);
+    FP4_cmove(&X3,&X2,FP4_qr(&W,NULL));
+    ECP4_rhs(&W,&X1);
+    FP4_cmove(&X3,&X1,FP4_qr(&W,NULL));
+    ECP4_rhs(&W,&X3);
+    FP4_sqrt(&Y,&W,NULL);
+    
+    ne=FP4_sign(&Y)^sgn;
+    FP4_neg(&W,&Y); FP4_norm(&W);
+    FP4_cmove(&Y,&W,ne);
+ 
+    ECP4_set(Q,&X3,&Y);
+}
+
+/* Map octet to point on G2 */
+/*
+void ZZZ::ECP4_mapit(ECP4 *Q, octet *W)
+{
+    BIG q, x;
+    DBIG dx;
+    BIG_rcopy(q, Modulus);
+
+    BIG_dfromBytesLen(dx,W->val,W->len);
+    BIG_dmod(x,dx,q);
+
+    ECP4_hap2point(Q,x);   
+    ECP4_cfp(Q);
+}
+*/
+/* cofactor product */
+void ZZZ::ECP4_cfp(ECP4 *Q)
+{
+    FP2 X[3];
+    ECP4 xQ, x2Q, x3Q, x4Q;
+    BIG x;
+
+    ECP4_frob_constants(X);
+
+    BIG_rcopy(x, CURVE_Bnx);
+
+    // Efficient hash maps to G2 on BLS24 curves - Budroni, Pintore
+    // Q -> x4Q -x3Q -Q + F(x3Q-x2Q) + F(F(x2Q-xQ)) + F(F(F(xQ-Q))) +F(F(F(F(2Q))))
+
+    ECP4_copy(&xQ, Q);
+    ECP4_mul(&xQ, x);
+    ECP4_copy(&x2Q, &xQ);
+    ECP4_mul(&x2Q, x);
+    ECP4_copy(&x3Q, &x2Q);
+    ECP4_mul(&x3Q, x);
+    ECP4_copy(&x4Q, &x3Q);
+    ECP4_mul(&x4Q, x);
+
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    ECP4_neg(&xQ);
+    ECP4_neg(&x3Q);
+#endif
+
+    ECP4_sub(&x4Q, &x3Q);
+    ECP4_sub(&x4Q, Q);
+
+    ECP4_sub(&x3Q, &x2Q);
+    ECP4_frob(&x3Q, X, 1);
+
+    ECP4_sub(&x2Q, &xQ);
+    ECP4_frob(&x2Q, X, 2);
+
+    ECP4_sub(&xQ, Q);
+    ECP4_frob(&xQ, X, 3);
+
+    ECP4_dbl(Q);
+    ECP4_frob(Q, X, 4);
+
+    ECP4_add(Q, &x4Q);
+    ECP4_add(Q, &x3Q);
+    ECP4_add(Q, &x2Q);
+    ECP4_add(Q, &xQ);
+
+    ECP4_affine(Q);
+
+}
+
+// ECP$ Get Group Generator
+
+int ZZZ::ECP4_generator(ECP4 *G)
+{
+    BIG a, b;
+    FP2 Aa, Bb;
+    FP4 X, Y;
+
+    BIG_rcopy(a, CURVE_Pxaa);
+    BIG_rcopy(b, CURVE_Pxab);
+    FP2_from_BIGs(&Aa, a, b);
+
+    BIG_rcopy(a, CURVE_Pxba);
+    BIG_rcopy(b, CURVE_Pxbb);
+    FP2_from_BIGs(&Bb, a, b);
+
+    FP4_from_FP2s(&X, &Aa, &Bb);
+
+    BIG_rcopy(a, CURVE_Pyaa);
+    BIG_rcopy(b, CURVE_Pyab);
+    FP2_from_BIGs(&Aa, a, b);
+
+    BIG_rcopy(a, CURVE_Pyba);
+    BIG_rcopy(b, CURVE_Pybb);
+    FP2_from_BIGs(&Bb, a, b);
+
+    FP4_from_FP2s(&Y, &Aa, &Bb);
+
+    return ECP4_set(G, &X, &Y);
+}
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp4.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp4.h
new file mode 100644
index 0000000..27b6475
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp4.h
@@ -0,0 +1,268 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP4_ZZZ_H
+#define ECP4_ZZZ_H
+
+#include "fp4_YYY.h"
+#include "config_curve_ZZZ.h"
+
+using namespace core;
+
+namespace YYY {
+
+extern const XXX::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const XXX::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+}
+
+namespace ZZZ {
+
+/**
+	@brief ECP4 Structure - Elliptic Curve Point over quadratic extension field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag */
+    YYY::FP4 x;   /**< x-coordinate of point */
+    YYY::FP4 y;   /**< y-coordinate of point */
+    YYY::FP4 z;   /**< z-coordinate of point */
+} ECP4;
+
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;		/**< Elliptic curve B parameter */
+extern const XXX::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const XXX::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const XXX::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const XXX::BIG CURVE_Bnx;   /**< Elliptic curve parameter */
+extern const XXX::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+
+/* Generator point on G1 */
+extern const XXX::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const XXX::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const XXX::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/* ECP4 E(FP4) prototypes */
+/**	@brief Tests for ECP4 point equal to infinity
+ *
+	@param P ECP4 point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP4_isinf(ECP4 *P);
+/**	@brief Copy ECP4 point to another ECP4 point
+ *
+	@param P ECP4 instance, on exit = Q
+	@param Q ECP4 instance to be copied
+ */
+extern void ECP4_copy(ECP4 *P, ECP4 *Q);
+/**	@brief Set ECP4 to point-at-infinity
+ *
+	@param P ECP4 instance to be set to infinity
+ */
+extern void ECP4_inf(ECP4 *P);
+/**	@brief Tests for equality of two ECP4s
+ *
+	@param P ECP4 instance to be compared
+	@param Q ECP4 instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP4_equals(ECP4 *P, ECP4 *Q);
+
+/**	@brief Converts an ECP4 point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP4 instance to be converted to affine form
+ */
+extern void ECP4_affine(ECP4 *P);
+
+
+/**	@brief Extract x and y coordinates of an ECP4 point P
+ *
+	If x=y, returns only x
+	@param x FP4 on exit = x coordinate of point
+	@param y FP4 on exit = y coordinate of point (unless x=y)
+	@param P ECP4 instance (x,y)
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP4_get(YYY::FP4 *x, YYY::FP4 *y, ECP4 *P);
+/**	@brief Formats and outputs an ECP4 point to the console, converted to affine coordinates
+ *
+	@param P ECP4 instance to be printed
+ */
+extern void ECP4_output(ECP4 *P);
+
+/**	@brief Formats and outputs an ECP4 point to an octet string
+ *
+	The octet string is created in the form x|y or just x if compressed
+	Convert the real and imaginary parts of the x and y coordinates to big-endian base 256 form.
+	@param S output octet string
+	@param P ECP4 instance to be converted to an octet string
+    @param c true for compression
+ */
+extern void ECP4_toOctet(octet *S, ECP4 *P, bool c);
+/**	@brief Creates an ECP4 point from an octet string
+ *
+	The octet string is in the form x|y
+	The real and imaginary parts of the x and y coordinates are in big-endian base 256 form.
+	@param P ECP4 instance to be created from the octet string
+	@param S input octet string
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP4_fromOctet(ECP4 *P, octet *S);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x)=x^3+Ax+B
+	Used internally.
+	@param r FP4 value of f(x)
+	@param x FP4 instance
+ */
+extern void ECP4_rhs(YYY::FP4 *r, YYY::FP4 *x);
+/**	@brief Set ECP4 to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP4 instance to be set (x,y)
+	@param x FP4 x coordinate of point
+	@param y FP4 y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP4_set(ECP4 *P, YYY::FP4 *x, YYY::FP4 *y);
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Otherwise y coordinate is calculated from x.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+    @param s sign of y
+	@return 1 if point exists, else 0
+ */
+extern int ECP4_setx(ECP4 *P, YYY::FP4 *x, int s);
+/**	@brief Negation of an ECP4 point
+ *
+	@param P ECP4 instance, on exit = -P
+ */
+extern void ECP4_neg(ECP4 *P);
+
+/**	@brief Reduction of an ECP4 point
+ *
+	@param P ECP4 instance, on exit (x,y) are reduced wrt the modulus
+ */
+extern void ECP4_reduce(ECP4 *P);
+
+
+/**	@brief Doubles an ECP4 instance P
+ *
+	@param P ECP4 instance, on exit =2*P
+ */
+extern int ECP4_dbl(ECP4 *P);
+/**	@brief Adds ECP4 instance Q to ECP4 instance P
+ *
+	@param P ECP4 instance, on exit =P+Q
+	@param Q ECP4 instance to be added to P
+ */
+extern int ECP4_add(ECP4 *P, ECP4 *Q);
+/**	@brief Subtracts ECP instance Q from ECP4 instance P
+ *
+	@param P ECP4 instance, on exit =P-Q
+	@param Q ECP4 instance to be subtracted from P
+ */
+extern void ECP4_sub(ECP4 *P, ECP4 *Q);
+/**	@brief Multiplies an ECP4 instance P by a BIG, side-channel resistant
+ *
+	Uses fixed sized windows.
+	@param P ECP4 instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP4_mul(ECP4 *P, XXX::BIG b);
+
+/**	@brief Calculates required Frobenius constants
+ *
+	Calculate Frobenius constants
+	@param F array of FP2 precalculated constants
+
+ */
+extern void ECP4_frob_constants(YYY::FP2 F[3]);
+
+/**	@brief Multiplies an ECP4 instance P by the internal modulus p^n, using precalculated Frobenius constants
+ *
+	Fast point multiplication using Frobenius
+	@param P ECP4 instance, on exit = p^n*P
+	@param F array of FP2 precalculated Frobenius constant
+	@param n power of prime
+
+ */
+extern void ECP4_frob(ECP4 *P, YYY::FP2 F[3], int n);
+
+/**	@brief Calculates P=Sigma b[i]*Q[i] for i=0 to 7
+ *
+	@param P ECP4 instance, on exit = Sigma b[i]*Q[i] for i=0 to 7
+	@param Q ECP4 array of 4 points
+	@param b BIG array of 4 multipliers
+ */
+extern void ECP4_mul8(ECP4 *P, ECP4 *Q, XXX::BIG *b);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP4 multiplied by co-factor
+ */
+extern void ECP4_cfp(ECP4 *Q);
+
+/**	@brief Maps random FP4 to curve point in constant time
+ *
+	@param Q ECP4 instance 
+	@param x FP4 derived from hash
+ */
+extern void ECP4_map2point(ECP4 *Q, YYY::FP4 *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP4 instance 
+	@param x Fp derived from hash
+ */
+extern void ECP4_hap2point(ECP4 *Q, XXX::BIG  x);
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param P ECP4 instance of correct order
+	@param W OCTET byte array to be mapped
+ */
+extern void ECP4_mapit(ECP4 *P, octet *W);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP4 instance
+	@return 1 if point exists, else 0
+ */
+extern int ECP4_generator(ECP4 *G);
+
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp4_BLS24479.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp4_BLS24479.h
new file mode 100644
index 0000000..f962546
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp4_BLS24479.h
@@ -0,0 +1,268 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP4_BLS24479_H
+#define ECP4_BLS24479_H
+
+#include "fp4_BLS24479.h"
+#include "config_curve_BLS24479.h"
+
+using namespace core;
+
+namespace BLS24479 {
+
+extern const B480_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B480_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+}
+
+namespace BLS24479 {
+
+/**
+	@brief ECP4 Structure - Elliptic Curve Point over quadratic extension field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag */
+    BLS24479::FP4 x;   /**< x-coordinate of point */
+    BLS24479::FP4 y;   /**< y-coordinate of point */
+    BLS24479::FP4 z;   /**< z-coordinate of point */
+} ECP4;
+
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;		/**< Elliptic curve B parameter */
+extern const B480_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B480_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B480_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B480_56::BIG CURVE_Bnx;   /**< Elliptic curve parameter */
+extern const B480_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+
+/* Generator point on G1 */
+extern const B480_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B480_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B480_56::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/* ECP4 E(FP4) prototypes */
+/**	@brief Tests for ECP4 point equal to infinity
+ *
+	@param P ECP4 point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP4_isinf(ECP4 *P);
+/**	@brief Copy ECP4 point to another ECP4 point
+ *
+	@param P ECP4 instance, on exit = Q
+	@param Q ECP4 instance to be copied
+ */
+extern void ECP4_copy(ECP4 *P, ECP4 *Q);
+/**	@brief Set ECP4 to point-at-infinity
+ *
+	@param P ECP4 instance to be set to infinity
+ */
+extern void ECP4_inf(ECP4 *P);
+/**	@brief Tests for equality of two ECP4s
+ *
+	@param P ECP4 instance to be compared
+	@param Q ECP4 instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP4_equals(ECP4 *P, ECP4 *Q);
+
+/**	@brief Converts an ECP4 point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP4 instance to be converted to affine form
+ */
+extern void ECP4_affine(ECP4 *P);
+
+
+/**	@brief Extract x and y coordinates of an ECP4 point P
+ *
+	If x=y, returns only x
+	@param x FP4 on exit = x coordinate of point
+	@param y FP4 on exit = y coordinate of point (unless x=y)
+	@param P ECP4 instance (x,y)
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP4_get(BLS24479::FP4 *x, BLS24479::FP4 *y, ECP4 *P);
+/**	@brief Formats and outputs an ECP4 point to the console, converted to affine coordinates
+ *
+	@param P ECP4 instance to be printed
+ */
+extern void ECP4_output(ECP4 *P);
+
+/**	@brief Formats and outputs an ECP4 point to an octet string
+ *
+	The octet string is created in the form x|y or just x if compressed
+	Convert the real and imaginary parts of the x and y coordinates to big-endian base 256 form.
+	@param S output octet string
+	@param P ECP4 instance to be converted to an octet string
+    @param c true for compression
+ */
+extern void ECP4_toOctet(octet *S, ECP4 *P, bool c);
+/**	@brief Creates an ECP4 point from an octet string
+ *
+	The octet string is in the form x|y
+	The real and imaginary parts of the x and y coordinates are in big-endian base 256 form.
+	@param P ECP4 instance to be created from the octet string
+	@param S input octet string
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP4_fromOctet(ECP4 *P, octet *S);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x)=x^3+Ax+B
+	Used internally.
+	@param r FP4 value of f(x)
+	@param x FP4 instance
+ */
+extern void ECP4_rhs(BLS24479::FP4 *r, BLS24479::FP4 *x);
+/**	@brief Set ECP4 to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP4 instance to be set (x,y)
+	@param x FP4 x coordinate of point
+	@param y FP4 y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP4_set(ECP4 *P, BLS24479::FP4 *x, BLS24479::FP4 *y);
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Otherwise y coordinate is calculated from x.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+    @param s sign of y
+	@return 1 if point exists, else 0
+ */
+extern int ECP4_setx(ECP4 *P, BLS24479::FP4 *x, int s);
+/**	@brief Negation of an ECP4 point
+ *
+	@param P ECP4 instance, on exit = -P
+ */
+extern void ECP4_neg(ECP4 *P);
+
+/**	@brief Reduction of an ECP4 point
+ *
+	@param P ECP4 instance, on exit (x,y) are reduced wrt the modulus
+ */
+extern void ECP4_reduce(ECP4 *P);
+
+
+/**	@brief Doubles an ECP4 instance P
+ *
+	@param P ECP4 instance, on exit =2*P
+ */
+extern int ECP4_dbl(ECP4 *P);
+/**	@brief Adds ECP4 instance Q to ECP4 instance P
+ *
+	@param P ECP4 instance, on exit =P+Q
+	@param Q ECP4 instance to be added to P
+ */
+extern int ECP4_add(ECP4 *P, ECP4 *Q);
+/**	@brief Subtracts ECP instance Q from ECP4 instance P
+ *
+	@param P ECP4 instance, on exit =P-Q
+	@param Q ECP4 instance to be subtracted from P
+ */
+extern void ECP4_sub(ECP4 *P, ECP4 *Q);
+/**	@brief Multiplies an ECP4 instance P by a BIG, side-channel resistant
+ *
+	Uses fixed sized windows.
+	@param P ECP4 instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP4_mul(ECP4 *P, B480_56::BIG b);
+
+/**	@brief Calculates required Frobenius constants
+ *
+	Calculate Frobenius constants
+	@param F array of FP2 precalculated constants
+
+ */
+extern void ECP4_frob_constants(BLS24479::FP2 F[3]);
+
+/**	@brief Multiplies an ECP4 instance P by the internal modulus p^n, using precalculated Frobenius constants
+ *
+	Fast point multiplication using Frobenius
+	@param P ECP4 instance, on exit = p^n*P
+	@param F array of FP2 precalculated Frobenius constant
+	@param n power of prime
+
+ */
+extern void ECP4_frob(ECP4 *P, BLS24479::FP2 F[3], int n);
+
+/**	@brief Calculates P=Sigma b[i]*Q[i] for i=0 to 7
+ *
+	@param P ECP4 instance, on exit = Sigma b[i]*Q[i] for i=0 to 7
+	@param Q ECP4 array of 4 points
+	@param b BIG array of 4 multipliers
+ */
+extern void ECP4_mul8(ECP4 *P, ECP4 *Q, B480_56::BIG *b);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP4 multiplied by co-factor
+ */
+extern void ECP4_cfp(ECP4 *Q);
+
+/**	@brief Maps random FP4 to curve point in constant time
+ *
+	@param Q ECP4 instance 
+	@param x FP4 derived from hash
+ */
+extern void ECP4_map2point(ECP4 *Q, BLS24479::FP4 *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP4 instance 
+	@param x Fp derived from hash
+ */
+extern void ECP4_hap2point(ECP4 *Q, B480_56::BIG  x);
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param P ECP4 instance of correct order
+	@param W OCTET byte array to be mapped
+ */
+extern void ECP4_mapit(ECP4 *P, octet *W);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP4 instance
+	@return 1 if point exists, else 0
+ */
+extern int ECP4_generator(ECP4 *G);
+
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp8.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp8.cpp
new file mode 100644
index 0000000..17de76a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp8.cpp
@@ -0,0 +1,1118 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* CORE Weierstrass elliptic curve functions over FP2 */
+
+//#include <iostream>
+#include "ecp8_ZZZ.h"
+
+using namespace std;
+using namespace XXX;
+using namespace YYY;
+
+int ZZZ::ECP8_isinf(ECP8 *P)
+{
+    return (FP8_iszilch(&(P->x)) & FP8_iszilch(&(P->z)));
+}
+
+/* Set P=Q */
+void ZZZ::ECP8_copy(ECP8 *P, ECP8 *Q)
+{
+    FP8_copy(&(P->x), &(Q->x));
+    FP8_copy(&(P->y), &(Q->y));
+    FP8_copy(&(P->z), &(Q->z));
+}
+
+/* set P to Infinity */
+void ZZZ::ECP8_inf(ECP8 *P)
+{
+    FP8_zero(&(P->x));
+    FP8_one(&(P->y));
+    FP8_zero(&(P->z));
+}
+
+/* Conditional move Q to P dependant on d */
+static void ECP8_cmove(ZZZ::ECP8 *P, ZZZ::ECP8 *Q, int d)
+{
+    FP8_cmove(&(P->x), &(Q->x), d);
+    FP8_cmove(&(P->y), &(Q->y), d);
+    FP8_cmove(&(P->z), &(Q->z), d);
+}
+
+/* return 1 if b==c, no branching */
+static int teq(sign32 b, sign32 c)
+{
+    sign32 x = b ^ c;
+    x -= 1; // if x=0, x now -1
+    return (int)((x >> 31) & 1);
+}
+
+/* Constant time select from pre-computed table */
+static void ECP8_select(ZZZ::ECP8 *P, ZZZ::ECP8 W[], sign32 b)
+{
+    ZZZ::ECP8 MP;
+    sign32 m = b >> 31;
+    sign32 babs = (b ^ m) - m;
+
+    babs = (babs - 1) / 2;
+
+    ECP8_cmove(P, &W[0], teq(babs, 0)); // conditional move
+    ECP8_cmove(P, &W[1], teq(babs, 1));
+    ECP8_cmove(P, &W[2], teq(babs, 2));
+    ECP8_cmove(P, &W[3], teq(babs, 3));
+    ECP8_cmove(P, &W[4], teq(babs, 4));
+    ECP8_cmove(P, &W[5], teq(babs, 5));
+    ECP8_cmove(P, &W[6], teq(babs, 6));
+    ECP8_cmove(P, &W[7], teq(babs, 7));
+
+    ECP8_copy(&MP, P);
+    ECP8_neg(&MP);  // minus P
+    ECP8_cmove(P, &MP, (int)(m & 1));
+}
+
+/* Make P affine (so z=1) */
+void ZZZ::ECP8_affine(ECP8 *P)
+{
+    FP8 one, iz;
+    if (ECP8_isinf(P)) return;
+
+    FP8_one(&one);
+    if (FP8_isunity(&(P->z)))
+    {
+        FP8_reduce(&(P->x));
+        FP8_reduce(&(P->y));
+        return;
+    }
+
+    FP8_inv(&iz, &(P->z),NULL);
+    FP8_mul(&(P->x), &(P->x), &iz);
+    FP8_mul(&(P->y), &(P->y), &iz);
+
+    FP8_reduce(&(P->x));
+    FP8_reduce(&(P->y));
+    FP8_copy(&(P->z), &one);
+}
+
+/* return 1 if P==Q, else 0 */
+/* SU= 312 */
+int ZZZ::ECP8_equals(ECP8 *P, ECP8 *Q)
+{
+    FP8 a, b;
+
+    FP8_mul(&a, &(P->x), &(Q->z));
+    FP8_mul(&b, &(Q->x), &(P->z));
+    if (!FP8_equals(&a, &b)) return 0;
+
+    FP8_mul(&a, &(P->y), &(Q->z));
+    FP8_mul(&b, &(Q->y), &(P->z));
+    if (!FP8_equals(&a, &b)) return 0;
+    return 1;
+}
+
+/* extract x, y from point P */
+int ZZZ::ECP8_get(FP8 *x, FP8 *y, ECP8 *P)
+{
+    ECP8 W;
+    ECP8_copy(&W, P);
+    ECP8_affine(&W);
+    if (ECP8_isinf(&W)) return -1;
+    FP8_copy(y, &(W.y));
+    FP8_copy(x, &(W.x));
+    return 0;
+}
+
+/* Output point P */
+void ZZZ::ECP8_output(ECP8 *P)
+{
+    FP8 x, y;
+    if (ECP8_isinf(P))
+    {
+        printf("Infinity\n");
+        return;
+    }
+    ECP8_get(&x, &y, P);
+    printf("(");
+    FP8_output(&x);
+    printf(",");
+    FP8_output(&y);
+    printf(")\n");
+}
+
+/* Convert Q to octet string */
+void ZZZ::ECP8_toOctet(octet *W, ECP8 *Q,bool compress)
+{
+    FP8 qx, qy;
+    bool alt=false;
+    ECP8_get(&qx, &qy, Q);
+  
+#if (MBITS-1)%8 <= 4
+#ifdef ALLOW_ALT_COMPRESS_ZZZ
+    alt=true;
+#endif
+#endif
+
+    if (alt)
+    {
+        FP8_toBytes(&(W->val[0]),&qx);
+        if (!compress)
+        {
+            W->len=16*MODBYTES_XXX;
+            FP8_toBytes(&(W->val[8*MODBYTES_XXX]), &qy);
+        } else {
+            W->val[0]|=0x80;
+            if (FP8_islarger(&qy)==1) W->val[0]|=0x20;
+            W->len=8*MODBYTES_XXX;
+        }
+    } else {
+        FP8_toBytes(&(W->val[1]),&qx);
+        if (!compress)
+        {
+            W->val[0] = 0x04;
+
+            FP8_toBytes(&(W->val[8 * MODBYTES_XXX+1]), &qy);
+            W->len = 16 * MODBYTES_XXX+1;
+        } else {
+            W->val[0]=0x02;
+            if (FP8_sign(&qy)==1) W->val[0] = 0x03;
+            W->len = 8 * MODBYTES_XXX+1;
+        }
+    }
+}
+
+/* restore Q from octet string */
+int ZZZ::ECP8_fromOctet(ECP8 *Q, octet *W)
+{
+    FP8 qx, qy;
+    bool alt=false;
+    int sgn,cmp,typ = W->val[0];
+
+#if (MBITS-1)%8 <= 4
+#ifdef ALLOW_ALT_COMPRESS_ZZZ
+    alt=true;
+#endif
+#endif
+
+    if (alt)
+    {
+        W->val[0]&=0x1f;
+        FP8_fromBytes(&qx,&(W->val[0]));
+        W->val[0]=typ;
+        if ((typ&0x80)==0)
+        {
+            FP8_fromBytes(&qy,&(W->val[8*MODBYTES_XXX]));
+            if (ECP8_set(Q, &qx, &qy)) return 1;
+            return 0;
+        } else {
+            if (!ECP8_setx(Q,&qx,0)) return 0;
+            sgn=(typ&0x20)>>5;
+            cmp=FP8_islarger(&(Q->y));
+            if ((sgn==1 && cmp!=1) || (sgn==0 && cmp==1)) ECP8_neg(Q);
+            return 1;
+        }
+    } else {
+        FP8_fromBytes(&qx,&(W->val[1]));
+
+        if (typ == 0x04)
+        {
+            FP8_fromBytes(&qy,&(W->val[8 * MODBYTES_XXX+1]));
+            if (ECP8_set(Q, &qx, &qy)) return 1;
+        } else {
+            if (ECP8_setx(Q, &qx, typ&1)) return 1;
+        }
+    }
+    return 0;
+}
+
+/* Calculate RHS of twisted curve equation x^3+B/i or x^3+Bi*/
+void ZZZ::ECP8_rhs(FP8 *rhs, FP8 *x)
+{
+    /* calculate RHS of elliptic curve equation */
+    FP8 t;
+    FP4 t4;
+    FP2 t2;
+    BIG b;
+    FP8_sqr(&t, x);
+
+    FP8_mul(rhs, &t, x);
+
+    /* Assuming CURVE_A=0 */
+
+    BIG_rcopy(b, CURVE_B);
+
+    FP2_from_BIG(&t2, b);
+    FP4_from_FP2(&t4, &t2);
+    FP8_from_FP4(&t, &t4);
+
+#if SEXTIC_TWIST_ZZZ == D_TYPE
+    FP8_div_i(&t);   /* IMPORTANT - here we use the correct SEXTIC twist of the curve */
+#endif
+
+#if SEXTIC_TWIST_ZZZ == M_TYPE
+    FP8_times_i(&t);   /* IMPORTANT - here we use the correct SEXTIC twist of the curve */
+#endif
+
+    FP8_add(rhs, &t, rhs);
+    FP8_reduce(rhs);
+}
+
+/* Set P=(x,y). Return 1 if (x,y) is on the curve, else return 0*/
+/* SU= 232 */
+int ZZZ::ECP8_set(ECP8 *P, FP8 *x, FP8 *y)
+{
+    FP8 rhs, y2;
+
+    FP8_sqr(&y2, y);
+    ECP8_rhs(&rhs, x);
+
+    if (!FP8_equals(&y2, &rhs))
+    {
+        ECP8_inf(P);
+        return 0;
+    }
+
+    FP8_copy(&(P->x), x);
+    FP8_copy(&(P->y), y);
+    FP8_one(&(P->z));
+    return 1;
+}
+
+/* Set P=(x,y). Return 1 if (x,.) is on the curve, else return 0 */
+/* SU= 232 */
+int ZZZ::ECP8_setx(ECP8 *P, FP8 *x, int s)
+{
+    FP8 y;
+    FP hint;
+    ECP8_rhs(&y, x);
+
+    if (!FP8_qr(&y,&hint))
+    {
+        ECP8_inf(P);
+        return 0;
+    }
+    FP8_sqrt(&y,&y,&hint);
+
+    FP8_copy(&(P->x), x);
+    FP8_copy(&(P->y), &y);
+    FP8_one(&(P->z));
+
+    if (FP8_sign(&(P->y)) != s)
+        FP8_neg(&(P->y),&(P->y));
+    FP8_reduce(&(P->y));
+
+    return 1;
+}
+
+/* Set P=-P */
+/* SU= 8 */
+void ZZZ::ECP8_neg(ECP8 *P)
+{
+    FP8_norm(&(P->y));
+    FP8_neg(&(P->y), &(P->y));
+    FP8_norm(&(P->y));
+}
+
+
+/* R+=R */
+/* return -1 for Infinity, 0 for addition, 1 for doubling */
+int ZZZ::ECP8_dbl(ECP8 *P)
+{
+    FP8 t0, t1, t2, t3, iy, x3, y3;
+
+    FP8_copy(&iy, &(P->y));     //FP8 iy=new FP8(y);
+#if SEXTIC_TWIST_ZZZ==D_TYPE
+    FP8_times_i(&iy);           //iy.mul_ip();
+#endif
+
+    FP8_sqr(&t0, &(P->y));          //t0.sqr();
+#if SEXTIC_TWIST_ZZZ==D_TYPE
+    FP8_times_i(&t0);           //t0.mul_ip();
+#endif
+
+    FP8_mul(&t1, &iy, &(P->z)); //t1.mul(z);
+    FP8_sqr(&t2, &(P->z));              //t2.sqr();
+
+    FP8_add(&(P->z), &t0, &t0); //z.add(t0);
+    FP8_norm(&(P->z));              //z.norm();
+    FP8_add(&(P->z), &(P->z), &(P->z)); //z.add(z);
+    FP8_add(&(P->z), &(P->z), &(P->z)); //z.add(z);
+    FP8_norm(&(P->z));          //z.norm();
+
+    FP8_imul(&t2, &t2, 3 * CURVE_B_I); //t2.imul(3*ROM.CURVE_B_I);
+#if SEXTIC_TWIST_ZZZ==M_TYPE
+    FP8_times_i(&t2);
+#endif
+
+    FP8_mul(&x3, &t2, &(P->z)); //x3.mul(z);
+
+    FP8_add(&y3, &t0, &t2);     //y3.add(t2);
+    FP8_norm(&y3);              //y3.norm();
+    FP8_mul(&(P->z), &(P->z), &t1); //z.mul(t1);
+
+    FP8_add(&t1, &t2, &t2);     //t1.add(t2);
+    FP8_add(&t2, &t2, &t1);     //t2.add(t1);
+    FP8_norm(&t2);              //t2.norm();
+    FP8_sub(&t0, &t0, &t2);     //t0.sub(t2);
+    FP8_norm(&t0);              //t0.norm();                           //y^2-9bz^2
+    FP8_mul(&y3, &y3, &t0);     //y3.mul(t0);
+    FP8_add(&(P->y), &y3, &x3);     //y3.add(x3);                          //(y^2+3z*2)(y^2-9z^2)+3b.z^2.8y^2
+
+    FP8_mul(&t1, &(P->x), &iy);     //t1.mul(iy);                       //
+
+    FP8_norm(&t0);          //x.norm();
+    FP8_mul(&(P->x), &t0, &t1); //x.mul(t1);
+    FP8_add(&(P->x), &(P->x), &(P->x)); //x.add(x);       //(y^2-9bz^2)xy2
+
+    FP8_norm(&(P->x));          //x.norm();
+
+    FP8_norm(&(P->y));          //y.norm();
+
+    return 1;
+}
+
+/* Set P+=Q */
+
+int ZZZ::ECP8_add(ECP8 *P, ECP8 *Q)
+{
+    FP8 t0, t1, t2, t3, t4, x3, y3, z3;
+    int b3 = 3 * CURVE_B_I;
+
+    FP8_mul(&t0, &(P->x), &(Q->x)); //t0.mul(Q.x);         // x.Q.x
+    FP8_mul(&t1, &(P->y), &(Q->y)); //t1.mul(Q.y);       // y.Q.y
+
+    FP8_mul(&t2, &(P->z), &(Q->z)); //t2.mul(Q.z);
+    FP8_add(&t3, &(P->x), &(P->y)); //t3.add(y);
+    FP8_norm(&t3);              //t3.norm();          //t3=X1+Y1
+    FP8_add(&t4, &(Q->x), &(Q->y)); //t4.add(Q.y);
+    FP8_norm(&t4);              //t4.norm();            //t4=X2+Y2
+    FP8_mul(&t3, &t3, &t4);     //t3.mul(t4);                       //t3=(X1+Y1)(X2+Y2)
+    FP8_add(&t4, &t0, &t1);     //t4.add(t1);       //t4=X1.X2+Y1.Y2
+
+    FP8_sub(&t3, &t3, &t4);     //t3.sub(t4);
+    FP8_norm(&t3);              //t3.norm();
+#if SEXTIC_TWIST_ZZZ==D_TYPE
+    FP8_times_i(&t3);           //t3.mul_ip();
+#endif
+
+    FP8_add(&t4, &(P->y), &(P->z)); //t4.add(z);
+    FP8_norm(&t4);              //t4.norm();            //t4=Y1+Z1
+
+    FP8_add(&x3, &(Q->y), &(Q->z)); //x3.add(Q.z);
+    FP8_norm(&x3);              //x3.norm();            //x3=Y2+Z2
+
+    FP8_mul(&t4, &t4, &x3);     //t4.mul(x3);                       //t4=(Y1+Z1)(Y2+Z2)
+
+    FP8_add(&x3, &t1, &t2);     //x3.add(t2);                       //X3=Y1.Y2+Z1.Z2
+
+    FP8_sub(&t4, &t4, &x3);     //t4.sub(x3);
+    FP8_norm(&t4);              //t4.norm();
+#if SEXTIC_TWIST_ZZZ==D_TYPE
+    FP8_times_i(&t4);           //t4.mul_ip(); //t4=(Y1+Z1)(Y2+Z2) - (Y1.Y2+Z1.Z2) = Y1.Z2+Y2.Z1
+#endif
+
+    FP8_add(&x3, &(P->x), &(P->z)); //x3.add(z);
+    FP8_norm(&x3);              //x3.norm();    // x3=X1+Z1
+
+    FP8_add(&y3, &(Q->x), &(Q->z)); //y3.add(Q.z);
+    FP8_norm(&y3);              //y3.norm();                // y3=X2+Z2
+    FP8_mul(&x3, &x3, &y3);     //x3.mul(y3);                           // x3=(X1+Z1)(X2+Z2)
+
+    FP8_add(&y3, &t0, &t2);     //y3.add(t2);                           // y3=X1.X2+Z1+Z2
+    FP8_sub(&y3, &x3, &y3);     //y3.rsub(x3);
+    FP8_norm(&y3);              //y3.norm();                // y3=(X1+Z1)(X2+Z2) - (X1.X2+Z1.Z2) = X1.Z2+X2.Z1
+#if SEXTIC_TWIST_ZZZ==D_TYPE
+    FP8_times_i(&t0);           //t0.mul_ip();
+    FP8_times_i(&t1);           //t1.mul_ip();
+#endif
+
+    FP8_add(&x3, &t0, &t0);     //x3.add(t0);
+    FP8_add(&t0, &t0, &x3);     //t0.add(x3);
+    FP8_norm(&t0);              //t0.norm();
+    FP8_imul(&t2, &t2, b3);     //t2.imul(b);
+#if SEXTIC_TWIST_ZZZ==M_TYPE
+    FP8_times_i(&t2);
+#endif
+
+    FP8_add(&z3, &t1, &t2);     //z3.add(t2);
+    FP8_norm(&z3);              //z3.norm();
+    FP8_sub(&t1, &t1, &t2);     //t1.sub(t2);
+    FP8_norm(&t1);              //t1.norm();
+    FP8_imul(&y3, &y3, b3);     //y3.imul(b);
+#if SEXTIC_TWIST_ZZZ==M_TYPE
+    FP8_times_i(&y3);
+#endif
+
+    FP8_mul(&x3, &y3, &t4);     //x3.mul(t4);
+
+    FP8_mul(&t2, &t3, &t1);     //t2.mul(t1);
+    FP8_sub(&(P->x), &t2, &x3);     //x3.rsub(t2);
+    FP8_mul(&y3, &y3, &t0);     //y3.mul(t0);
+    FP8_mul(&t1, &t1, &z3);     //t1.mul(z3);
+    FP8_add(&(P->y), &y3, &t1);     //y3.add(t1);
+    FP8_mul(&t0, &t0, &t3);     //t0.mul(t3);
+    FP8_mul(&z3, &z3, &t4);     //z3.mul(t4);
+    FP8_add(&(P->z), &z3, &t0);     //z3.add(t0);
+
+
+    FP8_norm(&(P->x));          //x.norm();
+    FP8_norm(&(P->y));          //y.norm();
+    FP8_norm(&(P->z));          //z.norm();
+
+    return 0;
+}
+
+/* Set P-=Q */
+/* SU= 16 */
+void ZZZ::ECP8_sub(ECP8 *P, ECP8 *Q)
+{
+    ECP8 NQ;
+    ECP8_copy(&NQ, Q);
+    ECP8_neg(&NQ);
+    ECP8_add(P, &NQ);
+}
+
+
+void ZZZ::ECP8_reduce(ECP8 *P)
+{
+    FP8_reduce(&(P->x));
+    FP8_reduce(&(P->y));
+}
+
+/* P*=e */
+/* SU= 280 */
+void ZZZ::ECP8_mul(ECP8 *P, BIG e)
+{
+    /* fixed size windows */
+    int i, nb, s, ns;
+    BIG mt, t;
+    ECP8 Q, W[8], C;
+    sign8 w[1 + (NLEN_XXX * BASEBITS_XXX + 3) / 4];
+
+    if (ECP8_isinf(P)) return;
+
+    /* precompute table */
+
+    ECP8_copy(&Q, P);
+    ECP8_dbl(&Q);
+    ECP8_copy(&W[0], P);
+
+    for (i = 1; i < 8; i++)
+    {
+        ECP8_copy(&W[i], &W[i - 1]);
+        ECP8_add(&W[i], &Q);
+    }
+
+    /* make exponent odd - add 2P if even, P if odd */
+    BIG_copy(t, e);
+    s = BIG_parity(t);
+    BIG_inc(t, 1);
+    BIG_norm(t);
+    ns = BIG_parity(t);
+    BIG_copy(mt, t);
+    BIG_inc(mt, 1);
+    BIG_norm(mt);
+    BIG_cmove(t, mt, s);
+    ECP8_cmove(&Q, P, ns);
+    ECP8_copy(&C, &Q);
+
+    nb = 1 + (BIG_nbits(t) + 3) / 4;
+
+    /* convert exponent to signed 4-bit window */
+    for (i = 0; i < nb; i++)
+    {
+        w[i] = BIG_lastbits(t, 5) - 16;
+        BIG_dec(t, w[i]);
+        BIG_norm(t);
+        BIG_fshr(t, 4);
+    }
+    w[nb] = BIG_lastbits(t, 5);
+
+    //ECP8_copy(P, &W[(w[nb] - 1) / 2]);
+    ECP8_select(P, W, w[nb]);
+    for (i = nb - 1; i >= 0; i--)
+    {
+        ECP8_select(&Q, W, w[i]);
+        ECP8_dbl(P);
+        ECP8_dbl(P);
+        ECP8_dbl(P);
+        ECP8_dbl(P);
+        ECP8_add(P, &Q);
+    }
+    ECP8_sub(P, &C); /* apply correction */
+    ECP8_affine(P);
+}
+
+void ZZZ::ECP8_frob_constants(FP2 F[3])
+{
+    FP fx, fy;
+    FP2 X;
+
+    FP_rcopy(&fx, Fra);
+    FP_rcopy(&fy, Frb);
+    FP2_from_FPs(&X, &fx, &fy); // u^(p-19)/24
+
+    FP2_sqr(&F[0], &X);     // F[0]=u^(p-19)/12
+    FP2_copy(&F[2], &F[0]);
+    FP2_mul_ip(&F[2]);          // W=u^12/12.u^(p-19)/12 = u^(p-7)/12
+    FP2_norm(&F[2]);
+    FP2_sqr(&F[1], &F[2]);
+    FP2_mul(&F[2], &F[2], &F[1]); // W=u^(p-7)/4
+
+    FP2_mul_ip(&F[2]);          // W=u^4/4.W=u^(p-7)/4 = u^(p-3)/4
+    FP2_norm(&F[2]);
+
+    FP2_copy(&F[1], &X);
+
+#if SEXTIC_TWIST_ZZZ == M_TYPE
+    FP2_mul_ip(&F[1]);      // u^24/24.u^(p-19)/24 = u^(p+5)/24
+    FP2_norm(&F[1]);
+    FP2_inv(&F[1], &F[1], NULL);      // u^-(p+5)/24
+    FP2_sqr(&F[0], &F[1]);      // u^-(p+5)/12 - ***
+    FP2_mul(&F[1], &F[1], &F[0]); // u^-(p+5)/8  - ***
+#endif
+
+#if SEXTIC_TWIST_ZZZ == D_TYPE
+    FP2_sqr(&F[0], &F[1]);  // u^(p-19)/12
+    FP2_mul(&F[1], &F[1], &F[0]); // u^(p-19)/8
+    FP2_mul_ip(&F[0]);      // u^(p-7)/12  - ***
+    FP2_norm(&F[0]);
+    FP2_mul_ip(&F[1]);      // u^(p-11)/8
+    FP2_norm(&F[1]);
+    FP2_mul_ip(&F[1]);      // u^(p-3)/8   - ***
+    FP2_norm(&F[1]);
+#endif
+
+}
+
+/* Calculates q^n.P using Frobenius constant X */
+void ZZZ::ECP8_frob(ECP8 *P, FP2 F[3], int n)
+{
+    int i;
+    FP8 X, Y, Z;
+// F=u^(p-19)/24
+
+    FP8_copy(&X, &(P->x));
+    FP8_copy(&Y, &(P->y));
+    FP8_copy(&Z, &(P->z));
+
+    for (i = 0; i < n; i++)
+    {
+        FP8_frob(&X, &F[2]);    // X^p
+
+#if SEXTIC_TWIST_ZZZ == M_TYPE
+        FP8_qmul(&X, &X, &F[0]); // X^p.u^-(p+5)/12
+        FP8_times_i2(&X);       // X^p.u^{1/2}.u^-(p+5)/12 = X^p.u^-(p-1)/12
+#endif
+#if SEXTIC_TWIST_ZZZ == D_TYPE
+        FP8_qmul(&X, &X, &F[0]); // X^p.u^(p-7)/12
+        FP8_times_i2(&X);       // X^p.u^{1/2}.u^(p-7)/12 = X^p.u^(p-1)/12
+#endif
+
+        FP8_frob(&Y, &F[2]);    // Y^p
+
+
+#if SEXTIC_TWIST_ZZZ == M_TYPE
+        FP8_qmul(&Y, &Y, &F[1]); // Y^p.u^-(p+5)/8
+        FP8_times_i2(&Y);
+        FP8_times_i(&Y);        // Y^p.u^(3/4}.u^-(p+5)/8 = Y.p.u^(p-1)/8
+
+#endif
+#if SEXTIC_TWIST_ZZZ == D_TYPE
+        FP8_qmul(&Y, &Y, &F[1]); // Y^p.u^(p-3)/8
+        FP8_times_i(&Y);        // Y^p.u^(1/4}.u^(p-3)/8 = Y^p.u^(p-1)/8
+#endif
+        FP8_frob(&Z, &F[2]);
+    }
+
+    FP8_copy(&(P->x), &X);
+    FP8_copy(&(P->y), &Y);
+    FP8_copy(&(P->z), &Z);
+
+}
+
+/* Side channel attack secure */
+// Bos & Costello https://eprint.iacr.org/2013/458.pdf
+// Faz-Hernandez & Longa & Sanchez  https://eprint.iacr.org/2013/158.pdf
+
+void ZZZ::ECP8_mul16(ECP8 *P, ECP8 Q[16], BIG u[16])
+{
+    int i, j, k, nb, pb1, pb2, pb3, pb4, bt;
+    ECP8 T1[8], T2[8], T3[8], T4[8], W;
+    BIG mt, t[16];
+    sign8 w1[NLEN_XXX * BASEBITS_XXX + 1];
+    sign8 s1[NLEN_XXX * BASEBITS_XXX + 1];
+    sign8 w2[NLEN_XXX * BASEBITS_XXX + 1];
+    sign8 s2[NLEN_XXX * BASEBITS_XXX + 1];
+    sign8 w3[NLEN_XXX * BASEBITS_XXX + 1];
+    sign8 s3[NLEN_XXX * BASEBITS_XXX + 1];
+    sign8 w4[NLEN_XXX * BASEBITS_XXX + 1];
+    sign8 s4[NLEN_XXX * BASEBITS_XXX + 1];
+
+    for (i = 0; i < 16; i++)
+    {
+        BIG_copy(t[i], u[i]);
+    }
+// Precomputed tables
+    ECP8_copy(&T1[0], &Q[0]); // Q[0]
+    ECP8_copy(&T1[1], &T1[0]);
+    ECP8_add(&T1[1], &Q[1]); // Q[0]+Q[1]
+    ECP8_copy(&T1[2], &T1[0]);
+    ECP8_add(&T1[2], &Q[2]); // Q[0]+Q[2]
+    ECP8_copy(&T1[3], &T1[1]);
+    ECP8_add(&T1[3], &Q[2]); // Q[0]+Q[1]+Q[2]
+    ECP8_copy(&T1[4], &T1[0]);
+    ECP8_add(&T1[4], &Q[3]); // Q[0]+Q[3]
+    ECP8_copy(&T1[5], &T1[1]);
+    ECP8_add(&T1[5], &Q[3]); // Q[0]+Q[1]+Q[3]
+    ECP8_copy(&T1[6], &T1[2]);
+    ECP8_add(&T1[6], &Q[3]); // Q[0]+Q[2]+Q[3]
+    ECP8_copy(&T1[7], &T1[3]);
+    ECP8_add(&T1[7], &Q[3]); // Q[0]+Q[1]+Q[2]+Q[3]
+
+    ECP8_copy(&T2[0], &Q[4]); // Q[0]
+    ECP8_copy(&T2[1], &T2[0]);
+    ECP8_add(&T2[1], &Q[5]); // Q[0]+Q[1]
+    ECP8_copy(&T2[2], &T2[0]);
+    ECP8_add(&T2[2], &Q[6]); // Q[0]+Q[2]
+    ECP8_copy(&T2[3], &T2[1]);
+    ECP8_add(&T2[3], &Q[6]); // Q[0]+Q[1]+Q[2]
+    ECP8_copy(&T2[4], &T2[0]);
+    ECP8_add(&T2[4], &Q[7]); // Q[0]+Q[3]
+    ECP8_copy(&T2[5], &T2[1]);
+    ECP8_add(&T2[5], &Q[7]); // Q[0]+Q[1]+Q[3]
+    ECP8_copy(&T2[6], &T2[2]);
+    ECP8_add(&T2[6], &Q[7]); // Q[0]+Q[2]+Q[3]
+    ECP8_copy(&T2[7], &T2[3]);
+    ECP8_add(&T2[7], &Q[7]); // Q[0]+Q[1]+Q[2]+Q[3]
+
+    ECP8_copy(&T3[0], &Q[8]); // Q[0]
+    ECP8_copy(&T3[1], &T3[0]);
+    ECP8_add(&T3[1], &Q[9]); // Q[0]+Q[1]
+    ECP8_copy(&T3[2], &T3[0]);
+    ECP8_add(&T3[2], &Q[10]);   // Q[0]+Q[2]
+    ECP8_copy(&T3[3], &T3[1]);
+    ECP8_add(&T3[3], &Q[10]);   // Q[0]+Q[1]+Q[2]
+    ECP8_copy(&T3[4], &T3[0]);
+    ECP8_add(&T3[4], &Q[11]); // Q[0]+Q[3]
+    ECP8_copy(&T3[5], &T3[1]);
+    ECP8_add(&T3[5], &Q[11]);   // Q[0]+Q[1]+Q[3]
+    ECP8_copy(&T3[6], &T3[2]);
+    ECP8_add(&T3[6], &Q[11]);   // Q[0]+Q[2]+Q[3]
+    ECP8_copy(&T3[7], &T3[3]);
+    ECP8_add(&T3[7], &Q[11]);   // Q[0]+Q[1]+Q[2]+Q[3]
+
+    ECP8_copy(&T4[0], &Q[12]); // Q[0]
+    ECP8_copy(&T4[1], &T4[0]);
+    ECP8_add(&T4[1], &Q[13]);   // Q[0]+Q[1]
+    ECP8_copy(&T4[2], &T4[0]);
+    ECP8_add(&T4[2], &Q[14]);   // Q[0]+Q[2]
+    ECP8_copy(&T4[3], &T4[1]);
+    ECP8_add(&T4[3], &Q[14]);   // Q[0]+Q[1]+Q[2]
+    ECP8_copy(&T4[4], &T4[0]);
+    ECP8_add(&T4[4], &Q[15]); // Q[0]+Q[3]
+    ECP8_copy(&T4[5], &T4[1]);
+    ECP8_add(&T4[5], &Q[15]);   // Q[0]+Q[1]+Q[3]
+    ECP8_copy(&T4[6], &T4[2]);
+    ECP8_add(&T4[6], &Q[15]);   // Q[0]+Q[2]+Q[3]
+    ECP8_copy(&T4[7], &T4[3]);
+    ECP8_add(&T4[7], &Q[15]);   // Q[0]+Q[1]+Q[2]+Q[3]
+
+// Make them odd
+    pb1 = 1 - BIG_parity(t[0]);
+    BIG_inc(t[0], pb1);
+    BIG_norm(t[0]);
+
+    pb2 = 1 - BIG_parity(t[4]);
+    BIG_inc(t[4], pb2);
+    BIG_norm(t[4]);
+
+    pb3 = 1 - BIG_parity(t[8]);
+    BIG_inc(t[8], pb3);
+    BIG_norm(t[8]);
+
+    pb4 = 1 - BIG_parity(t[12]);
+    BIG_inc(t[12], pb4);
+    BIG_norm(t[12]);
+
+// Number of bits
+    BIG_zero(mt);
+    for (i = 0; i < 16; i++)
+    {
+        BIG_or(mt, mt, t[i]);
+    }
+    nb = 1 + BIG_nbits(mt);
+
+// Sign pivot
+    s1[nb - 1] = 1;
+    s2[nb - 1] = 1;
+    s3[nb - 1] = 1;
+    s4[nb - 1] = 1;
+    for (i = 0; i < nb - 1; i++)
+    {
+        BIG_fshr(t[0], 1);
+        s1[i] = 2 * BIG_parity(t[0]) - 1;
+        BIG_fshr(t[4], 1);
+        s2[i] = 2 * BIG_parity(t[4]) - 1;
+        BIG_fshr(t[8], 1);
+        s3[i] = 2 * BIG_parity(t[8]) - 1;
+        BIG_fshr(t[12], 1);
+        s4[i] = 2 * BIG_parity(t[12]) - 1;
+    }
+
+// Recoded exponents
+    for (i = 0; i < nb; i++)
+    {
+        w1[i] = 0;
+        k = 1;
+        for (j = 1; j < 4; j++)
+        {
+            bt = s1[i] * BIG_parity(t[j]);
+            BIG_fshr(t[j], 1);
+
+            BIG_dec(t[j], (bt >> 1));
+            BIG_norm(t[j]);
+            w1[i] += bt * k;
+            k *= 2;
+        }
+
+        w2[i] = 0;
+        k = 1;
+        for (j = 5; j < 8; j++)
+        {
+            bt = s2[i] * BIG_parity(t[j]);
+            BIG_fshr(t[j], 1);
+
+            BIG_dec(t[j], (bt >> 1));
+            BIG_norm(t[j]);
+            w2[i] += bt * k;
+            k *= 2;
+        }
+
+        w3[i] = 0;
+        k = 1;
+        for (j = 9; j < 12; j++)
+        {
+            bt = s3[i] * BIG_parity(t[j]);
+            BIG_fshr(t[j], 1);
+
+            BIG_dec(t[j], (bt >> 1));
+            BIG_norm(t[j]);
+            w3[i] += bt * k;
+            k *= 2;
+        }
+
+        w4[i] = 0;
+        k = 1;
+        for (j = 13; j < 16; j++)
+        {
+            bt = s4[i] * BIG_parity(t[j]);
+            BIG_fshr(t[j], 1);
+
+            BIG_dec(t[j], (bt >> 1));
+            BIG_norm(t[j]);
+            w4[i] += bt * k;
+            k *= 2;
+        }
+    }
+
+// Main loop
+
+    ECP8_select(P, T1, 2 * w1[nb - 1] + 1);
+    ECP8_select(&W, T2, 2 * w2[nb - 1] + 1);
+    ECP8_add(P, &W);
+    ECP8_select(&W, T3, 2 * w3[nb - 1] + 1);
+    ECP8_add(P, &W);
+    ECP8_select(&W, T4, 2 * w4[nb - 1] + 1);
+    ECP8_add(P, &W);
+
+    for (i = nb - 2; i >= 0; i--)
+    {
+        ECP8_dbl(P);
+        ECP8_select(&W, T1, 2 * w1[i] + s1[i]);
+        ECP8_add(P, &W);
+        ECP8_select(&W, T2, 2 * w2[i] + s2[i]);
+        ECP8_add(P, &W);
+        ECP8_select(&W, T3, 2 * w3[i] + s3[i]);
+        ECP8_add(P, &W);
+        ECP8_select(&W, T4, 2 * w4[i] + s4[i]);
+        ECP8_add(P, &W);
+    }
+
+// apply corrections
+    ECP8_copy(&W, P);
+    ECP8_sub(&W, &Q[0]);
+    ECP8_cmove(P, &W, pb1);
+    ECP8_copy(&W, P);
+    ECP8_sub(&W, &Q[4]);
+    ECP8_cmove(P, &W, pb2);
+
+    ECP8_copy(&W, P);
+    ECP8_sub(&W, &Q[8]);
+    ECP8_cmove(P, &W, pb3);
+    ECP8_copy(&W, P);
+    ECP8_sub(&W, &Q[12]);
+    ECP8_cmove(P, &W, pb4);
+
+    ECP8_affine(P);
+}
+
+/* Hunt and Peck a BIG to G2 curve point */
+/*
+void ZZZ::ECP8_hap2point(ECP8 *Q,BIG h)
+{
+    BIG one,hv;
+    FP2 X2;
+    FP4 X4;
+    FP8 X8;
+    BIG_one(one);
+    BIG_copy(hv,h);
+
+    for (;;)
+    {
+        FP2_from_BIGs(&X2,one,hv);  
+		FP4_from_FP2(&X4,&X2);
+		FP8_from_FP4(&X8,&X4);
+        if (ECP8_setx(Q,&X8,0)) break;
+        BIG_inc(hv,1);
+        BIG_norm(hv);
+    }
+}
+*/
+/* Constant time Map BIG to Point in G2 */
+void ZZZ::ECP8_map2point(ECP8 *Q,FP8 *H)
+{
+    int sgn,ne;
+    FP8 X1,X2,X3,W,Y,T,A,NY;
+    FP Z,s;
+
+    FP8_one(&NY);
+    FP8_copy(&T,H);
+    sgn=FP8_sign(&T);
+ 
+    FP_from_int(&Z,RIADZG2A_YYY);
+    FP8_from_FP(&A,&Z);
+    ECP8_rhs(&A,&A);  // A=g(Z)
+
+    FP8_sqrt(&W,&A,NULL);
+    FP_rcopy(&s,SQRTm3);
+
+    FP_mul(&Z,&Z,&s);
+
+    FP8_sqr(&T,&T);   
+    FP8_mul(&Y,&A,&T);   // tv1=u^2*g(Z)
+    FP8_add(&T,&NY,&Y); FP8_norm(&T); // tv2=1+tv1
+    FP8_sub(&Y,&NY,&Y); FP8_norm(&Y); // tv1=1-tv1 
+    FP8_mul(&NY,&T,&Y);
+
+    FP8_tmul(&NY,&NY,&Z);
+
+    FP8_inv(&NY,&NY,NULL);     // tv3=inv0(tv1*tv2*Z*sqrt(-3))
+    FP8_tmul(&W,&W,&Z); // tv4=Z*sqrt(-3).sqrt(g(Z))
+    if (FP8_sign(&W)==1)
+    {
+        FP8_neg(&W,&W);
+        FP8_norm(&W);
+    }
+    FP8_tmul(&W,&W,&Z);
+    FP8_mul(&W,&W,H);
+    FP8_mul(&W,&W,&Y);
+    FP8_mul(&W,&W,&NY);     // tv5=u*tv1*tv3*tv4
+
+    FP_from_int(&s,RIADZG2A_YYY);
+    FP8_from_FP(&X1,&s);
+
+    FP8_copy(&X3,&X1);
+    FP8_neg(&X1,&X1); FP8_norm(&X1); FP8_div2(&X1,&X1); // -Z/2
+    FP8_copy(&X2,&X1);
+    FP8_sub(&X1,&X1,&W); FP8_norm(&X1);
+    FP8_add(&X2,&X2,&W); FP8_norm(&X2);
+    FP8_add(&A,&A,&A);
+    FP8_add(&A,&A,&A); 
+    FP8_norm(&A);      // 4*g(Z)
+    FP8_sqr(&T,&T);
+    FP8_mul(&T,&T,&NY);
+    FP8_sqr(&T,&T);    // (tv2^2*tv3)^2
+    FP8_mul(&A,&A,&T); // -4*g(Z)*(tv2^2*tv3)^2
+
+    FP8_add(&X3,&X3,&A); FP8_norm(&X3);   
+
+    ECP8_rhs(&W,&X2);
+    FP8_cmove(&X3,&X2,FP8_qr(&W,NULL));
+    ECP8_rhs(&W,&X1);
+    FP8_cmove(&X3,&X1,FP8_qr(&W,NULL));
+    ECP8_rhs(&W,&X3);
+    FP8_sqrt(&Y,&W,NULL);
+    
+    ne=FP8_sign(&Y)^sgn;
+    FP8_neg(&W,&Y); FP8_norm(&W);
+    FP8_cmove(&Y,&W,ne);
+ 
+    ECP8_set(Q,&X3,&Y);
+}
+
+/* Map octet to point on G2 */
+/*
+void ZZZ::ECP8_mapit(ECP8 *Q, octet *W)
+{
+    BIG q, x;
+    DBIG dx;
+    BIG_rcopy(q, Modulus);
+
+    BIG_dfromBytesLen(dx,W->val,W->len);
+    BIG_dmod(x,dx,q);
+
+    ECP8_hap2point(Q,x);   
+    ECP8_cfp(Q);
+}
+*/
+/* cofactor product */
+void ZZZ::ECP8_cfp(ECP8 *Q)
+{
+    FP2 X[3];
+    ECP8 xQ, x2Q, x3Q, x4Q , x5Q, x6Q, x7Q, x8Q;
+    BIG x;
+
+    ECP8_frob_constants(X);
+
+    BIG_rcopy(x, CURVE_Bnx);
+
+    // Efficient hash maps to G2 on BLS48 curves - Budroni, Pintore
+    // Q -> x8Q -x7Q -Q +  F(x7Q-x6Q) + F(F(x6Q-x5Q)) +F(F(F(x5Q-x4Q))) +F(F(F(F(x4Q-x3Q)))) + F(F(F(F(F(x3Q-x2Q))))) + F(F(F(F(F(F(x2Q-xQ)))))) + F(F(F(F(F(F(F(xQ-Q))))))) +F(F(F(F(F(F(F(F(2Q))))))))
+
+    ECP8_copy(&xQ, Q);
+    ECP8_mul(&xQ, x);
+    ECP8_copy(&x2Q, &xQ);
+    ECP8_mul(&x2Q, x);
+    ECP8_copy(&x3Q, &x2Q);
+    ECP8_mul(&x3Q, x);
+    ECP8_copy(&x4Q, &x3Q);
+
+    ECP8_mul(&x4Q, x);
+    ECP8_copy(&x5Q, &x4Q);
+    ECP8_mul(&x5Q, x);
+    ECP8_copy(&x6Q, &x5Q);
+    ECP8_mul(&x6Q, x);
+    ECP8_copy(&x7Q, &x6Q);
+    ECP8_mul(&x7Q, x);
+    ECP8_copy(&x8Q, &x7Q);
+    ECP8_mul(&x8Q, x);
+
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    ECP8_neg(&xQ);
+    ECP8_neg(&x3Q);
+    ECP8_neg(&x5Q);
+    ECP8_neg(&x7Q);
+#endif
+
+    ECP8_sub(&x8Q, &x7Q);
+    ECP8_sub(&x8Q, Q);
+
+    ECP8_sub(&x7Q, &x6Q);
+    ECP8_frob(&x7Q, X, 1);
+
+    ECP8_sub(&x6Q, &x5Q);
+    ECP8_frob(&x6Q, X, 2);
+
+    ECP8_sub(&x5Q, &x4Q);
+    ECP8_frob(&x5Q, X, 3);
+
+    ECP8_sub(&x4Q, &x3Q);
+    ECP8_frob(&x4Q, X, 4);
+
+    ECP8_sub(&x3Q, &x2Q);
+    ECP8_frob(&x3Q, X, 5);
+
+    ECP8_sub(&x2Q, &xQ);
+    ECP8_frob(&x2Q, X, 6);
+
+    ECP8_sub(&xQ, Q);
+    ECP8_frob(&xQ, X, 7);
+
+    ECP8_dbl(Q);
+    ECP8_frob(Q, X, 8);
+
+
+    ECP8_add(Q, &x8Q);
+    ECP8_add(Q, &x7Q);
+    ECP8_add(Q, &x6Q);
+    ECP8_add(Q, &x5Q);
+
+    ECP8_add(Q, &x4Q);
+    ECP8_add(Q, &x3Q);
+    ECP8_add(Q, &x2Q);
+    ECP8_add(Q, &xQ);
+
+    ECP8_affine(Q);
+
+}
+
+// ECP$ Get Group Generator
+
+int ZZZ::ECP8_generator(ECP8 *G)
+{
+    BIG a, b;
+    FP2 Aa, Bb;
+    FP4 A, B;
+    FP8 X, Y;
+
+    BIG_rcopy(a, CURVE_Pxaaa);
+    BIG_rcopy(b, CURVE_Pxaab);
+    FP2_from_BIGs(&Aa, a, b);
+
+    BIG_rcopy(a, CURVE_Pxaba);
+    BIG_rcopy(b, CURVE_Pxabb);
+    FP2_from_BIGs(&Bb, a, b);
+
+    FP4_from_FP2s(&A, &Aa, &Bb);
+
+    BIG_rcopy(a, CURVE_Pxbaa);
+    BIG_rcopy(b, CURVE_Pxbab);
+    FP2_from_BIGs(&Aa, a, b);
+
+    BIG_rcopy(a, CURVE_Pxbba);
+    BIG_rcopy(b, CURVE_Pxbbb);
+    FP2_from_BIGs(&Bb, a, b);
+
+    FP4_from_FP2s(&B, &Aa, &Bb);
+
+    FP8_from_FP4s(&X, &A, &B);
+
+    BIG_rcopy(a, CURVE_Pyaaa);
+    BIG_rcopy(b, CURVE_Pyaab);
+    FP2_from_BIGs(&Aa, a, b);
+
+    BIG_rcopy(a, CURVE_Pyaba);
+    BIG_rcopy(b, CURVE_Pyabb);
+    FP2_from_BIGs(&Bb, a, b);
+
+    FP4_from_FP2s(&A, &Aa, &Bb);
+
+    BIG_rcopy(a, CURVE_Pybaa);
+    BIG_rcopy(b, CURVE_Pybab);
+    FP2_from_BIGs(&Aa, a, b);
+
+    BIG_rcopy(a, CURVE_Pybba);
+    BIG_rcopy(b, CURVE_Pybbb);
+    FP2_from_BIGs(&Bb, a, b);
+
+    FP4_from_FP2s(&B, &Aa, &Bb);
+
+    FP8_from_FP4s(&Y, &A, &B);
+
+    return ECP8_set(G, &X, &Y);
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp8.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp8.h
new file mode 100644
index 0000000..bf67972
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp8.h
@@ -0,0 +1,278 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP8_ZZZ_H
+#define ECP8_ZZZ_H
+
+#include "fp8_YYY.h"
+#include "config_curve_ZZZ.h"
+
+using namespace core;
+
+namespace YYY {
+
+extern const XXX::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const XXX::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+}
+
+namespace ZZZ {
+
+/**
+	@brief ECP8 Structure - Elliptic Curve Point over quadratic extension field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag */
+    YYY::FP8 x;   /**< x-coordinate of point */
+    YYY::FP8 y;   /**< y-coordinate of point */
+    YYY::FP8 z;   /**< z-coordinate of point */
+} ECP8;
+
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;		/**< Elliptic curve B parameter */
+extern const XXX::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const XXX::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const XXX::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const XXX::BIG CURVE_Bnx;   /**< Elliptic curve parameter */
+extern const XXX::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+
+/* Generator point on G1 */
+extern const XXX::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const XXX::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const XXX::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const XXX::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+/* ECP8 E(FP8) prototypes */
+/**	@brief Tests for ECP8 point equal to infinity
+ *
+	@param P ECP8 point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP8_isinf(ECP8 *P);
+/**	@brief Copy ECP8 point to another ECP8 point
+ *
+	@param P ECP8 instance, on exit = Q
+	@param Q ECP8 instance to be copied
+ */
+extern void ECP8_copy(ECP8 *P, ECP8 *Q);
+/**	@brief Set ECP8 to point-at-infinity
+ *
+	@param P ECP8 instance to be set to infinity
+ */
+extern void ECP8_inf(ECP8 *P);
+/**	@brief Tests for equality of two ECP8s
+ *
+	@param P ECP8 instance to be compared
+	@param Q ECP8 instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP8_equals(ECP8 *P, ECP8 *Q);
+
+/**	@brief Converts an ECP8 point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP8 instance to be converted to affine form
+ */
+extern void ECP8_affine(ECP8 *P);
+
+
+/**	@brief Extract x and y coordinates of an ECP8 point P
+ *
+	If x=y, returns only x
+	@param x FP8 on exit = x coordinate of point
+	@param y FP8 on exit = y coordinate of point (unless x=y)
+	@param P ECP8 instance (x,y)
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP8_get(YYY::FP8 *x, YYY::FP8 *y, ECP8 *P);
+/**	@brief Formats and outputs an ECP8 point to the console, converted to affine coordinates
+ *
+	@param P ECP8 instance to be printed
+ */
+extern void ECP8_output(ECP8 *P);
+
+/**	@brief Formats and outputs an ECP8 point to an octet string
+ *
+	The octet string is created in the form x|y or just x if compressed
+	Convert the real and imaginary parts of the x and y coordinates to big-endian base 256 form.
+	@param S output octet string
+	@param P ECP8 instance to be converted to an octet string
+    @param c true for compression
+ */
+extern void ECP8_toOctet(octet *S, ECP8 *P, bool c);
+/**	@brief Creates an ECP8 point from an octet string
+ *
+	The octet string is in the form x|y
+	The real and imaginary parts of the x and y coordinates are in big-endian base 256 form.
+	@param P ECP8 instance to be created from the octet string
+	@param S input octet string
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP8_fromOctet(ECP8 *P, octet *S);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x)=x^3+Ax+B
+	Used internally.
+	@param r FP8 value of f(x)
+	@param x FP8 instance
+ */
+extern void ECP8_rhs(YYY::FP8 *r, YYY::FP8 *x);
+/**	@brief Set ECP8 to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP8 instance to be set (x,y)
+	@param x FP8 x coordinate of point
+	@param y FP8 y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP8_set(ECP8 *P, YYY::FP8 *x, YYY::FP8 *y);
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Otherwise y coordinate is calculated from x.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+    @param s sign of y
+	@return 1 if point exists, else 0
+ */
+extern int ECP8_setx(ECP8 *P, YYY::FP8 *x,int s);
+/**	@brief Negation of an ECP8 point
+ *
+	@param P ECP8 instance, on exit = -P
+ */
+extern void ECP8_neg(ECP8 *P);
+
+/**	@brief Reduction of an ECP8 point
+ *
+	@param P ECP8 instance, on exit (x,y) are reduced wrt the modulus
+ */
+extern void ECP8_reduce(ECP8 *P);
+
+
+/**	@brief Doubles an ECP8 instance P
+ *
+	@param P ECP8 instance, on exit =2*P
+ */
+extern int ECP8_dbl(ECP8 *P);
+/**	@brief Adds ECP8 instance Q to ECP8 instance P
+ *
+	@param P ECP8 instance, on exit =P+Q
+	@param Q ECP8 instance to be added to P
+ */
+extern int ECP8_add(ECP8 *P, ECP8 *Q);
+/**	@brief Subtracts ECP instance Q from ECP8 instance P
+ *
+	@param P ECP8 instance, on exit =P-Q
+	@param Q ECP8 instance to be subtracted from P
+ */
+extern void ECP8_sub(ECP8 *P, ECP8 *Q);
+/**	@brief Multiplies an ECP8 instance P by a BIG, side-channel resistant
+ *
+	Uses fixed sized windows.
+	@param P ECP8 instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP8_mul(ECP8 *P, XXX::BIG b);
+
+/**	@brief Calculates required Frobenius constants
+ *
+	Calculate Frobenius constants
+	@param F array of FP2 precalculated constants
+
+ */
+extern void ECP8_frob_constants(YYY::FP2 F[3]);
+
+/**	@brief Multiplies an ECP8 instance P by the internal modulus p^n, using precalculated Frobenius constants
+ *
+	Fast point multiplication using Frobenius
+	@param P ECP8 instance, on exit = p^n*P
+	@param F array of FP2 precalculated Frobenius constant
+	@param n power of prime
+
+ */
+extern void ECP8_frob(ECP8 *P, YYY::FP2 F[3], int n);
+
+/**	@brief Calculates P=Sigma b[i]*Q[i] for i=0 to 7
+ *
+	@param P ECP8 instance, on exit = Sigma b[i]*Q[i] for i=0 to 7
+	@param Q ECP8 array of 4 points
+	@param b BIG array of 4 multipliers
+ */
+extern void ECP8_mul16(ECP8 *P, ECP8 *Q, XXX::BIG *b);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP8 multiplied by co-factor
+ */
+extern void ECP8_cfp(ECP8 *Q);
+
+/**	@brief Maps random FP8 to curve point in constant time
+ *
+	@param Q ECP8 instance 
+	@param x FP8 derived from hash
+ */
+extern void ECP8_map2point(ECP8 *Q, YYY::FP8 *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck 
+ *
+	@param Q ECP8 instance 
+	@param x Fp derived from hash
+ */
+extern void ECP8_hap2point(ECP8 *Q, XXX::BIG  x);
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param P ECP8 instance of correct order
+	@param W OCTET byte array to be mapped
+ */
+extern void ECP8_mapit(ECP8 *P, octet *W);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP8 instance
+	@return 1 if point exists, else 0
+ */
+extern int ECP8_generator(ECP8 *G);
+
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp8_BLS48286.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp8_BLS48286.h
new file mode 100644
index 0000000..b8dc3b0
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp8_BLS48286.h
@@ -0,0 +1,278 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP8_BLS48286_H
+#define ECP8_BLS48286_H
+
+#include "fp8_BLS48286.h"
+#include "config_curve_BLS48286.h"
+
+using namespace core;
+
+namespace BLS48286 {
+
+extern const B288_60::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B288_60::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+}
+
+namespace BLS48286 {
+
+/**
+	@brief ECP8 Structure - Elliptic Curve Point over quadratic extension field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag */
+    BLS48286::FP8 x;   /**< x-coordinate of point */
+    BLS48286::FP8 y;   /**< y-coordinate of point */
+    BLS48286::FP8 z;   /**< z-coordinate of point */
+} ECP8;
+
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;		/**< Elliptic curve B parameter */
+extern const B288_60::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B288_60::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B288_60::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B288_60::BIG CURVE_Bnx;   /**< Elliptic curve parameter */
+extern const B288_60::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+
+/* Generator point on G1 */
+extern const B288_60::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B288_60::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B288_60::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B288_60::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+/* ECP8 E(FP8) prototypes */
+/**	@brief Tests for ECP8 point equal to infinity
+ *
+	@param P ECP8 point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP8_isinf(ECP8 *P);
+/**	@brief Copy ECP8 point to another ECP8 point
+ *
+	@param P ECP8 instance, on exit = Q
+	@param Q ECP8 instance to be copied
+ */
+extern void ECP8_copy(ECP8 *P, ECP8 *Q);
+/**	@brief Set ECP8 to point-at-infinity
+ *
+	@param P ECP8 instance to be set to infinity
+ */
+extern void ECP8_inf(ECP8 *P);
+/**	@brief Tests for equality of two ECP8s
+ *
+	@param P ECP8 instance to be compared
+	@param Q ECP8 instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP8_equals(ECP8 *P, ECP8 *Q);
+
+/**	@brief Converts an ECP8 point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP8 instance to be converted to affine form
+ */
+extern void ECP8_affine(ECP8 *P);
+
+
+/**	@brief Extract x and y coordinates of an ECP8 point P
+ *
+	If x=y, returns only x
+	@param x FP8 on exit = x coordinate of point
+	@param y FP8 on exit = y coordinate of point (unless x=y)
+	@param P ECP8 instance (x,y)
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP8_get(BLS48286::FP8 *x, BLS48286::FP8 *y, ECP8 *P);
+/**	@brief Formats and outputs an ECP8 point to the console, converted to affine coordinates
+ *
+	@param P ECP8 instance to be printed
+ */
+extern void ECP8_output(ECP8 *P);
+
+/**	@brief Formats and outputs an ECP8 point to an octet string
+ *
+	The octet string is created in the form x|y or just x if compressed
+	Convert the real and imaginary parts of the x and y coordinates to big-endian base 256 form.
+	@param S output octet string
+	@param P ECP8 instance to be converted to an octet string
+    @param c true for compression
+ */
+extern void ECP8_toOctet(octet *S, ECP8 *P, bool c);
+/**	@brief Creates an ECP8 point from an octet string
+ *
+	The octet string is in the form x|y
+	The real and imaginary parts of the x and y coordinates are in big-endian base 256 form.
+	@param P ECP8 instance to be created from the octet string
+	@param S input octet string
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP8_fromOctet(ECP8 *P, octet *S);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x)=x^3+Ax+B
+	Used internally.
+	@param r FP8 value of f(x)
+	@param x FP8 instance
+ */
+extern void ECP8_rhs(BLS48286::FP8 *r, BLS48286::FP8 *x);
+/**	@brief Set ECP8 to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP8 instance to be set (x,y)
+	@param x FP8 x coordinate of point
+	@param y FP8 y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP8_set(ECP8 *P, BLS48286::FP8 *x, BLS48286::FP8 *y);
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Otherwise y coordinate is calculated from x.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+    @param s sign of y
+	@return 1 if point exists, else 0
+ */
+extern int ECP8_setx(ECP8 *P, BLS48286::FP8 *x,int s);
+/**	@brief Negation of an ECP8 point
+ *
+	@param P ECP8 instance, on exit = -P
+ */
+extern void ECP8_neg(ECP8 *P);
+
+/**	@brief Reduction of an ECP8 point
+ *
+	@param P ECP8 instance, on exit (x,y) are reduced wrt the modulus
+ */
+extern void ECP8_reduce(ECP8 *P);
+
+
+/**	@brief Doubles an ECP8 instance P
+ *
+	@param P ECP8 instance, on exit =2*P
+ */
+extern int ECP8_dbl(ECP8 *P);
+/**	@brief Adds ECP8 instance Q to ECP8 instance P
+ *
+	@param P ECP8 instance, on exit =P+Q
+	@param Q ECP8 instance to be added to P
+ */
+extern int ECP8_add(ECP8 *P, ECP8 *Q);
+/**	@brief Subtracts ECP instance Q from ECP8 instance P
+ *
+	@param P ECP8 instance, on exit =P-Q
+	@param Q ECP8 instance to be subtracted from P
+ */
+extern void ECP8_sub(ECP8 *P, ECP8 *Q);
+/**	@brief Multiplies an ECP8 instance P by a BIG, side-channel resistant
+ *
+	Uses fixed sized windows.
+	@param P ECP8 instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP8_mul(ECP8 *P, B288_60::BIG b);
+
+/**	@brief Calculates required Frobenius constants
+ *
+	Calculate Frobenius constants
+	@param F array of FP2 precalculated constants
+
+ */
+extern void ECP8_frob_constants(BLS48286::FP2 F[3]);
+
+/**	@brief Multiplies an ECP8 instance P by the internal modulus p^n, using precalculated Frobenius constants
+ *
+	Fast point multiplication using Frobenius
+	@param P ECP8 instance, on exit = p^n*P
+	@param F array of FP2 precalculated Frobenius constant
+	@param n power of prime
+
+ */
+extern void ECP8_frob(ECP8 *P, BLS48286::FP2 F[3], int n);
+
+/**	@brief Calculates P=Sigma b[i]*Q[i] for i=0 to 7
+ *
+	@param P ECP8 instance, on exit = Sigma b[i]*Q[i] for i=0 to 7
+	@param Q ECP8 array of 4 points
+	@param b BIG array of 4 multipliers
+ */
+extern void ECP8_mul16(ECP8 *P, ECP8 *Q, B288_60::BIG *b);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP8 multiplied by co-factor
+ */
+extern void ECP8_cfp(ECP8 *Q);
+
+/**	@brief Maps random FP8 to curve point in constant time
+ *
+	@param Q ECP8 instance 
+	@param x FP8 derived from hash
+ */
+extern void ECP8_map2point(ECP8 *Q, BLS48286::FP8 *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck 
+ *
+	@param Q ECP8 instance 
+	@param x Fp derived from hash
+ */
+extern void ECP8_hap2point(ECP8 *Q, B288_60::BIG  x);
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param P ECP8 instance of correct order
+	@param W OCTET byte array to be mapped
+ */
+extern void ECP8_mapit(ECP8 *P, octet *W);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP8 instance
+	@return 1 if point exists, else 0
+ */
+extern int ECP8_generator(ECP8 *G);
+
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp8_BLS48556.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp8_BLS48556.h
new file mode 100644
index 0000000..14d4041
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp8_BLS48556.h
@@ -0,0 +1,278 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP8_BLS48556_H
+#define ECP8_BLS48556_H
+
+#include "fp8_BLS48556.h"
+#include "config_curve_BLS48556.h"
+
+using namespace core;
+
+namespace BLS48556 {
+
+extern const B560_58::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B560_58::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+}
+
+namespace BLS48556 {
+
+/**
+	@brief ECP8 Structure - Elliptic Curve Point over quadratic extension field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag */
+    BLS48556::FP8 x;   /**< x-coordinate of point */
+    BLS48556::FP8 y;   /**< y-coordinate of point */
+    BLS48556::FP8 z;   /**< z-coordinate of point */
+} ECP8;
+
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;		/**< Elliptic curve B parameter */
+extern const B560_58::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B560_58::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B560_58::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B560_58::BIG CURVE_Bnx;   /**< Elliptic curve parameter */
+extern const B560_58::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+
+/* Generator point on G1 */
+extern const B560_58::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B560_58::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B560_58::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B560_58::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+/* ECP8 E(FP8) prototypes */
+/**	@brief Tests for ECP8 point equal to infinity
+ *
+	@param P ECP8 point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP8_isinf(ECP8 *P);
+/**	@brief Copy ECP8 point to another ECP8 point
+ *
+	@param P ECP8 instance, on exit = Q
+	@param Q ECP8 instance to be copied
+ */
+extern void ECP8_copy(ECP8 *P, ECP8 *Q);
+/**	@brief Set ECP8 to point-at-infinity
+ *
+	@param P ECP8 instance to be set to infinity
+ */
+extern void ECP8_inf(ECP8 *P);
+/**	@brief Tests for equality of two ECP8s
+ *
+	@param P ECP8 instance to be compared
+	@param Q ECP8 instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP8_equals(ECP8 *P, ECP8 *Q);
+
+/**	@brief Converts an ECP8 point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP8 instance to be converted to affine form
+ */
+extern void ECP8_affine(ECP8 *P);
+
+
+/**	@brief Extract x and y coordinates of an ECP8 point P
+ *
+	If x=y, returns only x
+	@param x FP8 on exit = x coordinate of point
+	@param y FP8 on exit = y coordinate of point (unless x=y)
+	@param P ECP8 instance (x,y)
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP8_get(BLS48556::FP8 *x, BLS48556::FP8 *y, ECP8 *P);
+/**	@brief Formats and outputs an ECP8 point to the console, converted to affine coordinates
+ *
+	@param P ECP8 instance to be printed
+ */
+extern void ECP8_output(ECP8 *P);
+
+/**	@brief Formats and outputs an ECP8 point to an octet string
+ *
+	The octet string is created in the form x|y or just x if compressed
+	Convert the real and imaginary parts of the x and y coordinates to big-endian base 256 form.
+	@param S output octet string
+	@param P ECP8 instance to be converted to an octet string
+    @param c true for compression
+ */
+extern void ECP8_toOctet(octet *S, ECP8 *P, bool c);
+/**	@brief Creates an ECP8 point from an octet string
+ *
+	The octet string is in the form x|y
+	The real and imaginary parts of the x and y coordinates are in big-endian base 256 form.
+	@param P ECP8 instance to be created from the octet string
+	@param S input octet string
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP8_fromOctet(ECP8 *P, octet *S);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x)=x^3+Ax+B
+	Used internally.
+	@param r FP8 value of f(x)
+	@param x FP8 instance
+ */
+extern void ECP8_rhs(BLS48556::FP8 *r, BLS48556::FP8 *x);
+/**	@brief Set ECP8 to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP8 instance to be set (x,y)
+	@param x FP8 x coordinate of point
+	@param y FP8 y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP8_set(ECP8 *P, BLS48556::FP8 *x, BLS48556::FP8 *y);
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Otherwise y coordinate is calculated from x.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+    @param s sign of y
+	@return 1 if point exists, else 0
+ */
+extern int ECP8_setx(ECP8 *P, BLS48556::FP8 *x,int s);
+/**	@brief Negation of an ECP8 point
+ *
+	@param P ECP8 instance, on exit = -P
+ */
+extern void ECP8_neg(ECP8 *P);
+
+/**	@brief Reduction of an ECP8 point
+ *
+	@param P ECP8 instance, on exit (x,y) are reduced wrt the modulus
+ */
+extern void ECP8_reduce(ECP8 *P);
+
+
+/**	@brief Doubles an ECP8 instance P
+ *
+	@param P ECP8 instance, on exit =2*P
+ */
+extern int ECP8_dbl(ECP8 *P);
+/**	@brief Adds ECP8 instance Q to ECP8 instance P
+ *
+	@param P ECP8 instance, on exit =P+Q
+	@param Q ECP8 instance to be added to P
+ */
+extern int ECP8_add(ECP8 *P, ECP8 *Q);
+/**	@brief Subtracts ECP instance Q from ECP8 instance P
+ *
+	@param P ECP8 instance, on exit =P-Q
+	@param Q ECP8 instance to be subtracted from P
+ */
+extern void ECP8_sub(ECP8 *P, ECP8 *Q);
+/**	@brief Multiplies an ECP8 instance P by a BIG, side-channel resistant
+ *
+	Uses fixed sized windows.
+	@param P ECP8 instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP8_mul(ECP8 *P, B560_58::BIG b);
+
+/**	@brief Calculates required Frobenius constants
+ *
+	Calculate Frobenius constants
+	@param F array of FP2 precalculated constants
+
+ */
+extern void ECP8_frob_constants(BLS48556::FP2 F[3]);
+
+/**	@brief Multiplies an ECP8 instance P by the internal modulus p^n, using precalculated Frobenius constants
+ *
+	Fast point multiplication using Frobenius
+	@param P ECP8 instance, on exit = p^n*P
+	@param F array of FP2 precalculated Frobenius constant
+	@param n power of prime
+
+ */
+extern void ECP8_frob(ECP8 *P, BLS48556::FP2 F[3], int n);
+
+/**	@brief Calculates P=Sigma b[i]*Q[i] for i=0 to 7
+ *
+	@param P ECP8 instance, on exit = Sigma b[i]*Q[i] for i=0 to 7
+	@param Q ECP8 array of 4 points
+	@param b BIG array of 4 multipliers
+ */
+extern void ECP8_mul16(ECP8 *P, ECP8 *Q, B560_58::BIG *b);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP8 multiplied by co-factor
+ */
+extern void ECP8_cfp(ECP8 *Q);
+
+/**	@brief Maps random FP8 to curve point in constant time
+ *
+	@param Q ECP8 instance 
+	@param x FP8 derived from hash
+ */
+extern void ECP8_map2point(ECP8 *Q, BLS48556::FP8 *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck 
+ *
+	@param Q ECP8 instance 
+	@param x Fp derived from hash
+ */
+extern void ECP8_hap2point(ECP8 *Q, B560_58::BIG  x);
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param P ECP8 instance of correct order
+	@param W OCTET byte array to be mapped
+ */
+extern void ECP8_mapit(ECP8 *P, octet *W);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP8 instance
+	@return 1 if point exists, else 0
+ */
+extern int ECP8_generator(ECP8 *G);
+
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp8_BLS48581.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp8_BLS48581.h
new file mode 100644
index 0000000..ddebefe
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp8_BLS48581.h
@@ -0,0 +1,278 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP8_BLS48581_H
+#define ECP8_BLS48581_H
+
+#include "fp8_BLS48581.h"
+#include "config_curve_BLS48581.h"
+
+using namespace core;
+
+namespace BLS48581 {
+
+extern const B584_60::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B584_60::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+}
+
+namespace BLS48581 {
+
+/**
+	@brief ECP8 Structure - Elliptic Curve Point over quadratic extension field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag */
+    BLS48581::FP8 x;   /**< x-coordinate of point */
+    BLS48581::FP8 y;   /**< y-coordinate of point */
+    BLS48581::FP8 z;   /**< z-coordinate of point */
+} ECP8;
+
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;		/**< Elliptic curve B parameter */
+extern const B584_60::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B584_60::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B584_60::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B584_60::BIG CURVE_Bnx;   /**< Elliptic curve parameter */
+extern const B584_60::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+
+/* Generator point on G1 */
+extern const B584_60::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B584_60::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B584_60::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B584_60::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+/* ECP8 E(FP8) prototypes */
+/**	@brief Tests for ECP8 point equal to infinity
+ *
+	@param P ECP8 point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP8_isinf(ECP8 *P);
+/**	@brief Copy ECP8 point to another ECP8 point
+ *
+	@param P ECP8 instance, on exit = Q
+	@param Q ECP8 instance to be copied
+ */
+extern void ECP8_copy(ECP8 *P, ECP8 *Q);
+/**	@brief Set ECP8 to point-at-infinity
+ *
+	@param P ECP8 instance to be set to infinity
+ */
+extern void ECP8_inf(ECP8 *P);
+/**	@brief Tests for equality of two ECP8s
+ *
+	@param P ECP8 instance to be compared
+	@param Q ECP8 instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP8_equals(ECP8 *P, ECP8 *Q);
+
+/**	@brief Converts an ECP8 point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP8 instance to be converted to affine form
+ */
+extern void ECP8_affine(ECP8 *P);
+
+
+/**	@brief Extract x and y coordinates of an ECP8 point P
+ *
+	If x=y, returns only x
+	@param x FP8 on exit = x coordinate of point
+	@param y FP8 on exit = y coordinate of point (unless x=y)
+	@param P ECP8 instance (x,y)
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP8_get(BLS48581::FP8 *x, BLS48581::FP8 *y, ECP8 *P);
+/**	@brief Formats and outputs an ECP8 point to the console, converted to affine coordinates
+ *
+	@param P ECP8 instance to be printed
+ */
+extern void ECP8_output(ECP8 *P);
+
+/**	@brief Formats and outputs an ECP8 point to an octet string
+ *
+	The octet string is created in the form x|y or just x if compressed
+	Convert the real and imaginary parts of the x and y coordinates to big-endian base 256 form.
+	@param S output octet string
+	@param P ECP8 instance to be converted to an octet string
+    @param c true for compression
+ */
+extern void ECP8_toOctet(octet *S, ECP8 *P, bool c);
+/**	@brief Creates an ECP8 point from an octet string
+ *
+	The octet string is in the form x|y
+	The real and imaginary parts of the x and y coordinates are in big-endian base 256 form.
+	@param P ECP8 instance to be created from the octet string
+	@param S input octet string
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP8_fromOctet(ECP8 *P, octet *S);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x)=x^3+Ax+B
+	Used internally.
+	@param r FP8 value of f(x)
+	@param x FP8 instance
+ */
+extern void ECP8_rhs(BLS48581::FP8 *r, BLS48581::FP8 *x);
+/**	@brief Set ECP8 to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP8 instance to be set (x,y)
+	@param x FP8 x coordinate of point
+	@param y FP8 y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP8_set(ECP8 *P, BLS48581::FP8 *x, BLS48581::FP8 *y);
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Otherwise y coordinate is calculated from x.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+    @param s sign of y
+	@return 1 if point exists, else 0
+ */
+extern int ECP8_setx(ECP8 *P, BLS48581::FP8 *x,int s);
+/**	@brief Negation of an ECP8 point
+ *
+	@param P ECP8 instance, on exit = -P
+ */
+extern void ECP8_neg(ECP8 *P);
+
+/**	@brief Reduction of an ECP8 point
+ *
+	@param P ECP8 instance, on exit (x,y) are reduced wrt the modulus
+ */
+extern void ECP8_reduce(ECP8 *P);
+
+
+/**	@brief Doubles an ECP8 instance P
+ *
+	@param P ECP8 instance, on exit =2*P
+ */
+extern int ECP8_dbl(ECP8 *P);
+/**	@brief Adds ECP8 instance Q to ECP8 instance P
+ *
+	@param P ECP8 instance, on exit =P+Q
+	@param Q ECP8 instance to be added to P
+ */
+extern int ECP8_add(ECP8 *P, ECP8 *Q);
+/**	@brief Subtracts ECP instance Q from ECP8 instance P
+ *
+	@param P ECP8 instance, on exit =P-Q
+	@param Q ECP8 instance to be subtracted from P
+ */
+extern void ECP8_sub(ECP8 *P, ECP8 *Q);
+/**	@brief Multiplies an ECP8 instance P by a BIG, side-channel resistant
+ *
+	Uses fixed sized windows.
+	@param P ECP8 instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP8_mul(ECP8 *P, B584_60::BIG b);
+
+/**	@brief Calculates required Frobenius constants
+ *
+	Calculate Frobenius constants
+	@param F array of FP2 precalculated constants
+
+ */
+extern void ECP8_frob_constants(BLS48581::FP2 F[3]);
+
+/**	@brief Multiplies an ECP8 instance P by the internal modulus p^n, using precalculated Frobenius constants
+ *
+	Fast point multiplication using Frobenius
+	@param P ECP8 instance, on exit = p^n*P
+	@param F array of FP2 precalculated Frobenius constant
+	@param n power of prime
+
+ */
+extern void ECP8_frob(ECP8 *P, BLS48581::FP2 F[3], int n);
+
+/**	@brief Calculates P=Sigma b[i]*Q[i] for i=0 to 7
+ *
+	@param P ECP8 instance, on exit = Sigma b[i]*Q[i] for i=0 to 7
+	@param Q ECP8 array of 4 points
+	@param b BIG array of 4 multipliers
+ */
+extern void ECP8_mul16(ECP8 *P, ECP8 *Q, B584_60::BIG *b);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP8 multiplied by co-factor
+ */
+extern void ECP8_cfp(ECP8 *Q);
+
+/**	@brief Maps random FP8 to curve point in constant time
+ *
+	@param Q ECP8 instance 
+	@param x FP8 derived from hash
+ */
+extern void ECP8_map2point(ECP8 *Q, BLS48581::FP8 *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck 
+ *
+	@param Q ECP8 instance 
+	@param x Fp derived from hash
+ */
+extern void ECP8_hap2point(ECP8 *Q, B584_60::BIG  x);
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param P ECP8 instance of correct order
+	@param W OCTET byte array to be mapped
+ */
+extern void ECP8_mapit(ECP8 *P, octet *W);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP8 instance
+	@return 1 if point exists, else 0
+ */
+extern int ECP8_generator(ECP8 *G);
+
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_ANSSI.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_ANSSI.h
new file mode 100644
index 0000000..176ee14
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_ANSSI.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_ANSSI_H
+#define ECP_ANSSI_H
+
+#include "fp_ANSSI.h"
+#include "config_curve_ANSSI.h"
+
+using namespace core;
+
+namespace ANSSI {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B256_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B256_56::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B256_56::BIG CURVE_Ad;
+extern const B256_56::BIG CURVE_Bd;
+extern const B256_56::BIG PC[];
+
+extern const B256_56::BIG CURVE_Adr;
+extern const B256_56::BIG CURVE_Adi;
+extern const B256_56::BIG CURVE_Bdr;
+extern const B256_56::BIG CURVE_Bdi;
+extern const B256_56::BIG PCR[];
+extern const B256_56::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B256_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B256_56::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B256_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B256_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B256_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    ANSSI::FP x; /**< x-coordinate of point */
+#if CURVETYPE_ANSSI!=MONTGOMERY
+    ANSSI::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    ANSSI::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(ANSSI::FP *r, ANSSI::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B256_56::BIG x, int s);
+
+#if CURVETYPE_ANSSI==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B256_56::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x, B256_56::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B256_56::BIG x, B256_56::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B256_56::BIG e, B256_56::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B256_56::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f, B256_56::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B256_56::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, ANSSI::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B256_56::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_BLS12381.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_BLS12381.h
new file mode 100644
index 0000000..8a5f68e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_BLS12381.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_BLS12381_H
+#define ECP_BLS12381_H
+
+#include "fp_BLS12381.h"
+#include "config_curve_BLS12381.h"
+
+using namespace core;
+
+namespace BLS12381 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B384_58::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B384_58::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B384_58::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B384_58::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B384_58::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B384_58::BIG CURVE_Ad;
+extern const B384_58::BIG CURVE_Bd;
+extern const B384_58::BIG PC[];
+
+extern const B384_58::BIG CURVE_Adr;
+extern const B384_58::BIG CURVE_Adi;
+extern const B384_58::BIG CURVE_Bdr;
+extern const B384_58::BIG CURVE_Bdi;
+extern const B384_58::BIG PCR[];
+extern const B384_58::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B384_58::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B384_58::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B384_58::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B384_58::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B384_58::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B384_58::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B384_58::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B384_58::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B384_58::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B384_58::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B384_58::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B384_58::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B384_58::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    BLS12381::FP x; /**< x-coordinate of point */
+#if CURVETYPE_BLS12381!=MONTGOMERY
+    BLS12381::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    BLS12381::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(BLS12381::FP *r, BLS12381::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B384_58::BIG x, int s);
+
+#if CURVETYPE_BLS12381==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B384_58::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B384_58::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B384_58::BIG x, B384_58::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B384_58::BIG x, B384_58::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B384_58::BIG e, B384_58::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B384_58::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B384_58::BIG e, B384_58::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B384_58::BIG e, B384_58::BIG f, B384_58::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B384_58::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, BLS12381::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B384_58::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_BLS12383.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_BLS12383.h
new file mode 100644
index 0000000..733fde1
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_BLS12383.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_BLS12383_H
+#define ECP_BLS12383_H
+
+#include "fp_BLS12383.h"
+#include "config_curve_BLS12383.h"
+
+using namespace core;
+
+namespace BLS12383 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B384_58::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B384_58::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B384_58::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B384_58::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B384_58::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B384_58::BIG CURVE_Ad;
+extern const B384_58::BIG CURVE_Bd;
+extern const B384_58::BIG PC[];
+
+extern const B384_58::BIG CURVE_Adr;
+extern const B384_58::BIG CURVE_Adi;
+extern const B384_58::BIG CURVE_Bdr;
+extern const B384_58::BIG CURVE_Bdi;
+extern const B384_58::BIG PCR[];
+extern const B384_58::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B384_58::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B384_58::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B384_58::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B384_58::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B384_58::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B384_58::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B384_58::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B384_58::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B384_58::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B384_58::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B384_58::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B384_58::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B384_58::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    BLS12383::FP x; /**< x-coordinate of point */
+#if CURVETYPE_BLS12383!=MONTGOMERY
+    BLS12383::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    BLS12383::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(BLS12383::FP *r, BLS12383::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B384_58::BIG x, int s);
+
+#if CURVETYPE_BLS12383==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B384_58::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B384_58::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B384_58::BIG x, B384_58::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B384_58::BIG x, B384_58::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B384_58::BIG e, B384_58::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B384_58::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B384_58::BIG e, B384_58::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B384_58::BIG e, B384_58::BIG f, B384_58::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B384_58::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, BLS12383::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B384_58::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_BLS12443.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_BLS12443.h
new file mode 100644
index 0000000..b2c1265
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_BLS12443.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_BLS12443_H
+#define ECP_BLS12443_H
+
+#include "fp_BLS12443.h"
+#include "config_curve_BLS12443.h"
+
+using namespace core;
+
+namespace BLS12443 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B448_60::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B448_60::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B448_60::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B448_60::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B448_60::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B448_60::BIG CURVE_Ad;
+extern const B448_60::BIG CURVE_Bd;
+extern const B448_60::BIG PC[];
+
+extern const B448_60::BIG CURVE_Adr;
+extern const B448_60::BIG CURVE_Adi;
+extern const B448_60::BIG CURVE_Bdr;
+extern const B448_60::BIG CURVE_Bdi;
+extern const B448_60::BIG PCR[];
+extern const B448_60::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B448_60::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B448_60::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B448_60::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B448_60::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B448_60::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B448_60::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B448_60::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B448_60::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B448_60::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B448_60::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B448_60::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B448_60::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B448_60::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    BLS12443::FP x; /**< x-coordinate of point */
+#if CURVETYPE_BLS12443!=MONTGOMERY
+    BLS12443::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    BLS12443::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(BLS12443::FP *r, BLS12443::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B448_60::BIG x, int s);
+
+#if CURVETYPE_BLS12443==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B448_60::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B448_60::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B448_60::BIG x, B448_60::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B448_60::BIG x, B448_60::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B448_60::BIG e, B448_60::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B448_60::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B448_60::BIG e, B448_60::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B448_60::BIG e, B448_60::BIG f, B448_60::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B448_60::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, BLS12443::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B448_60::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_BLS12461.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_BLS12461.h
new file mode 100644
index 0000000..1018610
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_BLS12461.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_BLS12461_H
+#define ECP_BLS12461_H
+
+#include "fp_BLS12461.h"
+#include "config_curve_BLS12461.h"
+
+using namespace core;
+
+namespace BLS12461 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B464_60::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B464_60::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B464_60::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B464_60::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B464_60::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B464_60::BIG CURVE_Ad;
+extern const B464_60::BIG CURVE_Bd;
+extern const B464_60::BIG PC[];
+
+extern const B464_60::BIG CURVE_Adr;
+extern const B464_60::BIG CURVE_Adi;
+extern const B464_60::BIG CURVE_Bdr;
+extern const B464_60::BIG CURVE_Bdi;
+extern const B464_60::BIG PCR[];
+extern const B464_60::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B464_60::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B464_60::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B464_60::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B464_60::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B464_60::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B464_60::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B464_60::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B464_60::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B464_60::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B464_60::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B464_60::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B464_60::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B464_60::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    BLS12461::FP x; /**< x-coordinate of point */
+#if CURVETYPE_BLS12461!=MONTGOMERY
+    BLS12461::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    BLS12461::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(BLS12461::FP *r, BLS12461::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B464_60::BIG x, int s);
+
+#if CURVETYPE_BLS12461==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B464_60::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B464_60::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B464_60::BIG x, B464_60::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B464_60::BIG x, B464_60::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B464_60::BIG e, B464_60::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B464_60::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B464_60::BIG e, B464_60::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B464_60::BIG e, B464_60::BIG f, B464_60::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B464_60::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, BLS12461::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B464_60::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_BLS24479.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_BLS24479.h
new file mode 100644
index 0000000..e68501f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_BLS24479.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_BLS24479_H
+#define ECP_BLS24479_H
+
+#include "fp_BLS24479.h"
+#include "config_curve_BLS24479.h"
+
+using namespace core;
+
+namespace BLS24479 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B480_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B480_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B480_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B480_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B480_56::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B480_56::BIG CURVE_Ad;
+extern const B480_56::BIG CURVE_Bd;
+extern const B480_56::BIG PC[];
+
+extern const B480_56::BIG CURVE_Adr;
+extern const B480_56::BIG CURVE_Adi;
+extern const B480_56::BIG CURVE_Bdr;
+extern const B480_56::BIG CURVE_Bdi;
+extern const B480_56::BIG PCR[];
+extern const B480_56::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B480_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B480_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B480_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B480_56::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B480_56::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B480_56::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B480_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B480_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B480_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B480_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B480_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B480_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B480_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    BLS24479::FP x; /**< x-coordinate of point */
+#if CURVETYPE_BLS24479!=MONTGOMERY
+    BLS24479::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    BLS24479::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(BLS24479::FP *r, BLS24479::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B480_56::BIG x, int s);
+
+#if CURVETYPE_BLS24479==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B480_56::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B480_56::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B480_56::BIG x, B480_56::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B480_56::BIG x, B480_56::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B480_56::BIG e, B480_56::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B480_56::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B480_56::BIG e, B480_56::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B480_56::BIG e, B480_56::BIG f, B480_56::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B480_56::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, BLS24479::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B480_56::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_BLS48286.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_BLS48286.h
new file mode 100644
index 0000000..0647689
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_BLS48286.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_BLS48286_H
+#define ECP_BLS48286_H
+
+#include "fp_BLS48286.h"
+#include "config_curve_BLS48286.h"
+
+using namespace core;
+
+namespace BLS48286 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B288_60::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B288_60::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B288_60::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B288_60::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B288_60::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B288_60::BIG CURVE_Ad;
+extern const B288_60::BIG CURVE_Bd;
+extern const B288_60::BIG PC[];
+
+extern const B288_60::BIG CURVE_Adr;
+extern const B288_60::BIG CURVE_Adi;
+extern const B288_60::BIG CURVE_Bdr;
+extern const B288_60::BIG CURVE_Bdi;
+extern const B288_60::BIG PCR[];
+extern const B288_60::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B288_60::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B288_60::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B288_60::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B288_60::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B288_60::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B288_60::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B288_60::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B288_60::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B288_60::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B288_60::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B288_60::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B288_60::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B288_60::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    BLS48286::FP x; /**< x-coordinate of point */
+#if CURVETYPE_BLS48286!=MONTGOMERY
+    BLS48286::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    BLS48286::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(BLS48286::FP *r, BLS48286::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B288_60::BIG x, int s);
+
+#if CURVETYPE_BLS48286==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B288_60::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B288_60::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B288_60::BIG x, B288_60::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B288_60::BIG x, B288_60::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B288_60::BIG e, B288_60::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B288_60::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B288_60::BIG e, B288_60::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B288_60::BIG e, B288_60::BIG f, B288_60::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B288_60::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, BLS48286::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B288_60::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_BLS48556.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_BLS48556.h
new file mode 100644
index 0000000..7834b20
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_BLS48556.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_BLS48556_H
+#define ECP_BLS48556_H
+
+#include "fp_BLS48556.h"
+#include "config_curve_BLS48556.h"
+
+using namespace core;
+
+namespace BLS48556 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B560_58::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B560_58::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B560_58::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B560_58::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B560_58::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B560_58::BIG CURVE_Ad;
+extern const B560_58::BIG CURVE_Bd;
+extern const B560_58::BIG PC[];
+
+extern const B560_58::BIG CURVE_Adr;
+extern const B560_58::BIG CURVE_Adi;
+extern const B560_58::BIG CURVE_Bdr;
+extern const B560_58::BIG CURVE_Bdi;
+extern const B560_58::BIG PCR[];
+extern const B560_58::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B560_58::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B560_58::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B560_58::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B560_58::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B560_58::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B560_58::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B560_58::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B560_58::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B560_58::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B560_58::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B560_58::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B560_58::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B560_58::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    BLS48556::FP x; /**< x-coordinate of point */
+#if CURVETYPE_BLS48556!=MONTGOMERY
+    BLS48556::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    BLS48556::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(BLS48556::FP *r, BLS48556::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B560_58::BIG x, int s);
+
+#if CURVETYPE_BLS48556==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B560_58::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B560_58::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B560_58::BIG x, B560_58::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B560_58::BIG x, B560_58::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B560_58::BIG e, B560_58::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B560_58::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B560_58::BIG e, B560_58::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B560_58::BIG e, B560_58::BIG f, B560_58::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B560_58::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, BLS48556::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B560_58::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_BLS48581.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_BLS48581.h
new file mode 100644
index 0000000..9c3e94b
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_BLS48581.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_BLS48581_H
+#define ECP_BLS48581_H
+
+#include "fp_BLS48581.h"
+#include "config_curve_BLS48581.h"
+
+using namespace core;
+
+namespace BLS48581 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B584_60::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B584_60::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B584_60::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B584_60::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B584_60::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B584_60::BIG CURVE_Ad;
+extern const B584_60::BIG CURVE_Bd;
+extern const B584_60::BIG PC[];
+
+extern const B584_60::BIG CURVE_Adr;
+extern const B584_60::BIG CURVE_Adi;
+extern const B584_60::BIG CURVE_Bdr;
+extern const B584_60::BIG CURVE_Bdi;
+extern const B584_60::BIG PCR[];
+extern const B584_60::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B584_60::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B584_60::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B584_60::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B584_60::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B584_60::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B584_60::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B584_60::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B584_60::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B584_60::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B584_60::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B584_60::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B584_60::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B584_60::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    BLS48581::FP x; /**< x-coordinate of point */
+#if CURVETYPE_BLS48581!=MONTGOMERY
+    BLS48581::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    BLS48581::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(BLS48581::FP *r, BLS48581::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B584_60::BIG x, int s);
+
+#if CURVETYPE_BLS48581==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B584_60::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B584_60::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B584_60::BIG x, B584_60::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B584_60::BIG x, B584_60::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B584_60::BIG e, B584_60::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B584_60::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B584_60::BIG e, B584_60::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B584_60::BIG e, B584_60::BIG f, B584_60::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B584_60::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, BLS48581::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B584_60::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_BN158.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_BN158.h
new file mode 100644
index 0000000..1d926de
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_BN158.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_BN158_H
+#define ECP_BN158_H
+
+#include "fp_BN158.h"
+#include "config_curve_BN158.h"
+
+using namespace core;
+
+namespace BN158 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B160_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B160_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B160_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B160_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B160_56::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B160_56::BIG CURVE_Ad;
+extern const B160_56::BIG CURVE_Bd;
+extern const B160_56::BIG PC[];
+
+extern const B160_56::BIG CURVE_Adr;
+extern const B160_56::BIG CURVE_Adi;
+extern const B160_56::BIG CURVE_Bdr;
+extern const B160_56::BIG CURVE_Bdi;
+extern const B160_56::BIG PCR[];
+extern const B160_56::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B160_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B160_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B160_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B160_56::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B160_56::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B160_56::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B160_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B160_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B160_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B160_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B160_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B160_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B160_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    BN158::FP x; /**< x-coordinate of point */
+#if CURVETYPE_BN158!=MONTGOMERY
+    BN158::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    BN158::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(BN158::FP *r, BN158::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B160_56::BIG x, int s);
+
+#if CURVETYPE_BN158==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B160_56::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B160_56::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B160_56::BIG x, B160_56::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B160_56::BIG x, B160_56::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B160_56::BIG e, B160_56::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B160_56::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B160_56::BIG e, B160_56::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B160_56::BIG e, B160_56::BIG f, B160_56::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B160_56::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, BN158::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B160_56::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_BN254.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_BN254.h
new file mode 100644
index 0000000..ce46807
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_BN254.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_BN254_H
+#define ECP_BN254_H
+
+#include "fp_BN254.h"
+#include "config_curve_BN254.h"
+
+using namespace core;
+
+namespace BN254 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B256_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B256_56::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B256_56::BIG CURVE_Ad;
+extern const B256_56::BIG CURVE_Bd;
+extern const B256_56::BIG PC[];
+
+extern const B256_56::BIG CURVE_Adr;
+extern const B256_56::BIG CURVE_Adi;
+extern const B256_56::BIG CURVE_Bdr;
+extern const B256_56::BIG CURVE_Bdi;
+extern const B256_56::BIG PCR[];
+extern const B256_56::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B256_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B256_56::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B256_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B256_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B256_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    BN254::FP x; /**< x-coordinate of point */
+#if CURVETYPE_BN254!=MONTGOMERY
+    BN254::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    BN254::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(BN254::FP *r, BN254::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B256_56::BIG x, int s);
+
+#if CURVETYPE_BN254==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B256_56::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x, B256_56::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B256_56::BIG x, B256_56::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B256_56::BIG e, B256_56::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B256_56::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f, B256_56::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B256_56::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, BN254::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B256_56::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_BN254CX.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_BN254CX.h
new file mode 100644
index 0000000..5430206
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_BN254CX.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_BN254CX_H
+#define ECP_BN254CX_H
+
+#include "fp_BN254CX.h"
+#include "config_curve_BN254CX.h"
+
+using namespace core;
+
+namespace BN254CX {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B256_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B256_56::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B256_56::BIG CURVE_Ad;
+extern const B256_56::BIG CURVE_Bd;
+extern const B256_56::BIG PC[];
+
+extern const B256_56::BIG CURVE_Adr;
+extern const B256_56::BIG CURVE_Adi;
+extern const B256_56::BIG CURVE_Bdr;
+extern const B256_56::BIG CURVE_Bdi;
+extern const B256_56::BIG PCR[];
+extern const B256_56::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B256_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B256_56::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B256_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B256_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B256_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    BN254CX::FP x; /**< x-coordinate of point */
+#if CURVETYPE_BN254CX!=MONTGOMERY
+    BN254CX::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    BN254CX::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(BN254CX::FP *r, BN254CX::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B256_56::BIG x, int s);
+
+#if CURVETYPE_BN254CX==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B256_56::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x, B256_56::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B256_56::BIG x, B256_56::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B256_56::BIG e, B256_56::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B256_56::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f, B256_56::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B256_56::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, BN254CX::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B256_56::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_BN462.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_BN462.h
new file mode 100644
index 0000000..ebbb40e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_BN462.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_BN462_H
+#define ECP_BN462_H
+
+#include "fp_BN462.h"
+#include "config_curve_BN462.h"
+
+using namespace core;
+
+namespace BN462 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B464_60::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B464_60::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B464_60::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B464_60::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B464_60::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B464_60::BIG CURVE_Ad;
+extern const B464_60::BIG CURVE_Bd;
+extern const B464_60::BIG PC[];
+
+extern const B464_60::BIG CURVE_Adr;
+extern const B464_60::BIG CURVE_Adi;
+extern const B464_60::BIG CURVE_Bdr;
+extern const B464_60::BIG CURVE_Bdi;
+extern const B464_60::BIG PCR[];
+extern const B464_60::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B464_60::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B464_60::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B464_60::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B464_60::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B464_60::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B464_60::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B464_60::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B464_60::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B464_60::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B464_60::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B464_60::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B464_60::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B464_60::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    BN462::FP x; /**< x-coordinate of point */
+#if CURVETYPE_BN462!=MONTGOMERY
+    BN462::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    BN462::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(BN462::FP *r, BN462::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B464_60::BIG x, int s);
+
+#if CURVETYPE_BN462==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B464_60::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B464_60::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B464_60::BIG x, B464_60::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B464_60::BIG x, B464_60::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B464_60::BIG e, B464_60::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B464_60::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B464_60::BIG e, B464_60::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B464_60::BIG e, B464_60::BIG f, B464_60::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B464_60::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, BN462::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B464_60::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_BRAINPOOL.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_BRAINPOOL.h
new file mode 100644
index 0000000..75e9eb9
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_BRAINPOOL.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_BRAINPOOL_H
+#define ECP_BRAINPOOL_H
+
+#include "fp_BRAINPOOL.h"
+#include "config_curve_BRAINPOOL.h"
+
+using namespace core;
+
+namespace BRAINPOOL {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B256_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B256_56::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B256_56::BIG CURVE_Ad;
+extern const B256_56::BIG CURVE_Bd;
+extern const B256_56::BIG PC[];
+
+extern const B256_56::BIG CURVE_Adr;
+extern const B256_56::BIG CURVE_Adi;
+extern const B256_56::BIG CURVE_Bdr;
+extern const B256_56::BIG CURVE_Bdi;
+extern const B256_56::BIG PCR[];
+extern const B256_56::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B256_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B256_56::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B256_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B256_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B256_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    BRAINPOOL::FP x; /**< x-coordinate of point */
+#if CURVETYPE_BRAINPOOL!=MONTGOMERY
+    BRAINPOOL::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    BRAINPOOL::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(BRAINPOOL::FP *r, BRAINPOOL::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B256_56::BIG x, int s);
+
+#if CURVETYPE_BRAINPOOL==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B256_56::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x, B256_56::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B256_56::BIG x, B256_56::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B256_56::BIG e, B256_56::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B256_56::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f, B256_56::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B256_56::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, BRAINPOOL::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B256_56::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_C1174.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_C1174.h
new file mode 100644
index 0000000..86ce027
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_C1174.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_C1174_H
+#define ECP_C1174_H
+
+#include "fp_C1174.h"
+#include "config_curve_C1174.h"
+
+using namespace core;
+
+namespace C1174 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B256_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B256_56::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B256_56::BIG CURVE_Ad;
+extern const B256_56::BIG CURVE_Bd;
+extern const B256_56::BIG PC[];
+
+extern const B256_56::BIG CURVE_Adr;
+extern const B256_56::BIG CURVE_Adi;
+extern const B256_56::BIG CURVE_Bdr;
+extern const B256_56::BIG CURVE_Bdi;
+extern const B256_56::BIG PCR[];
+extern const B256_56::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B256_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B256_56::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B256_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B256_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B256_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    C1174::FP x; /**< x-coordinate of point */
+#if CURVETYPE_C1174!=MONTGOMERY
+    C1174::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    C1174::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(C1174::FP *r, C1174::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B256_56::BIG x, int s);
+
+#if CURVETYPE_C1174==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B256_56::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x, B256_56::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B256_56::BIG x, B256_56::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B256_56::BIG e, B256_56::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B256_56::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f, B256_56::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B256_56::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, C1174::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B256_56::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_C13318.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_C13318.h
new file mode 100644
index 0000000..8e8e598
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_C13318.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_C13318_H
+#define ECP_C13318_H
+
+#include "fp_F25519.h"
+#include "config_curve_C13318.h"
+
+using namespace core;
+
+namespace C13318 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B256_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B256_56::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B256_56::BIG CURVE_Ad;
+extern const B256_56::BIG CURVE_Bd;
+extern const B256_56::BIG PC[];
+
+extern const B256_56::BIG CURVE_Adr;
+extern const B256_56::BIG CURVE_Adi;
+extern const B256_56::BIG CURVE_Bdr;
+extern const B256_56::BIG CURVE_Bdi;
+extern const B256_56::BIG PCR[];
+extern const B256_56::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B256_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B256_56::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B256_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B256_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B256_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    F25519::FP x; /**< x-coordinate of point */
+#if CURVETYPE_C13318!=MONTGOMERY
+    F25519::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    F25519::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(F25519::FP *r, F25519::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B256_56::BIG x, int s);
+
+#if CURVETYPE_C13318==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B256_56::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x, B256_56::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B256_56::BIG x, B256_56::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B256_56::BIG e, B256_56::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B256_56::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f, B256_56::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B256_56::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, F25519::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B256_56::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_C1665.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_C1665.h
new file mode 100644
index 0000000..9b9e8a9
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_C1665.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_C1665_H
+#define ECP_C1665_H
+
+#include "fp_C1665.h"
+#include "config_curve_C1665.h"
+
+using namespace core;
+
+namespace C1665 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B168_60::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B168_60::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B168_60::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B168_60::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B168_60::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B168_60::BIG CURVE_Ad;
+extern const B168_60::BIG CURVE_Bd;
+extern const B168_60::BIG PC[];
+
+extern const B168_60::BIG CURVE_Adr;
+extern const B168_60::BIG CURVE_Adi;
+extern const B168_60::BIG CURVE_Bdr;
+extern const B168_60::BIG CURVE_Bdi;
+extern const B168_60::BIG PCR[];
+extern const B168_60::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B168_60::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B168_60::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B168_60::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B168_60::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B168_60::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B168_60::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B168_60::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B168_60::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B168_60::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B168_60::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B168_60::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B168_60::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B168_60::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B168_60::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B168_60::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B168_60::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B168_60::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B168_60::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B168_60::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B168_60::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B168_60::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B168_60::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B168_60::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B168_60::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B168_60::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B168_60::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B168_60::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B168_60::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B168_60::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B168_60::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B168_60::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B168_60::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B168_60::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B168_60::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B168_60::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B168_60::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B168_60::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    C1665::FP x; /**< x-coordinate of point */
+#if CURVETYPE_C1665!=MONTGOMERY
+    C1665::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    C1665::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(C1665::FP *r, C1665::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B168_60::BIG x, int s);
+
+#if CURVETYPE_C1665==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B168_60::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B168_60::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B168_60::BIG x, B168_60::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B168_60::BIG x, B168_60::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B168_60::BIG e, B168_60::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B168_60::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B168_60::BIG e, B168_60::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B168_60::BIG e, B168_60::BIG f, B168_60::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B168_60::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, C1665::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B168_60::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_C25519.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_C25519.h
new file mode 100644
index 0000000..7079636
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_C25519.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_C25519_H
+#define ECP_C25519_H
+
+#include "fp_F25519.h"
+#include "config_curve_C25519.h"
+
+using namespace core;
+
+namespace C25519 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B256_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B256_56::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B256_56::BIG CURVE_Ad;
+extern const B256_56::BIG CURVE_Bd;
+extern const B256_56::BIG PC[];
+
+extern const B256_56::BIG CURVE_Adr;
+extern const B256_56::BIG CURVE_Adi;
+extern const B256_56::BIG CURVE_Bdr;
+extern const B256_56::BIG CURVE_Bdi;
+extern const B256_56::BIG PCR[];
+extern const B256_56::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B256_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B256_56::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B256_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B256_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B256_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    F25519::FP x; /**< x-coordinate of point */
+#if CURVETYPE_C25519!=MONTGOMERY
+    F25519::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    F25519::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(F25519::FP *r, F25519::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B256_56::BIG x, int s);
+
+#if CURVETYPE_C25519==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B256_56::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x, B256_56::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B256_56::BIG x, B256_56::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B256_56::BIG e, B256_56::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B256_56::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f, B256_56::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B256_56::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, F25519::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B256_56::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_C41417.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_C41417.h
new file mode 100644
index 0000000..5e7ada0
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_C41417.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_C41417_H
+#define ECP_C41417_H
+
+#include "fp_C41417.h"
+#include "config_curve_C41417.h"
+
+using namespace core;
+
+namespace C41417 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B416_60::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B416_60::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B416_60::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B416_60::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B416_60::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B416_60::BIG CURVE_Ad;
+extern const B416_60::BIG CURVE_Bd;
+extern const B416_60::BIG PC[];
+
+extern const B416_60::BIG CURVE_Adr;
+extern const B416_60::BIG CURVE_Adi;
+extern const B416_60::BIG CURVE_Bdr;
+extern const B416_60::BIG CURVE_Bdi;
+extern const B416_60::BIG PCR[];
+extern const B416_60::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B416_60::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B416_60::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B416_60::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B416_60::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B416_60::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B416_60::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B416_60::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B416_60::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B416_60::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B416_60::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B416_60::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B416_60::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B416_60::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B416_60::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B416_60::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B416_60::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B416_60::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B416_60::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B416_60::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B416_60::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B416_60::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B416_60::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B416_60::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B416_60::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B416_60::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B416_60::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B416_60::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B416_60::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B416_60::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B416_60::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B416_60::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B416_60::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B416_60::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B416_60::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B416_60::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B416_60::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B416_60::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    C41417::FP x; /**< x-coordinate of point */
+#if CURVETYPE_C41417!=MONTGOMERY
+    C41417::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    C41417::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(C41417::FP *r, C41417::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B416_60::BIG x, int s);
+
+#if CURVETYPE_C41417==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B416_60::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B416_60::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B416_60::BIG x, B416_60::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B416_60::BIG x, B416_60::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B416_60::BIG e, B416_60::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B416_60::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B416_60::BIG e, B416_60::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B416_60::BIG e, B416_60::BIG f, B416_60::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B416_60::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, C41417::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B416_60::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_Ed25519.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_Ed25519.h
new file mode 100644
index 0000000..99b699b
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_Ed25519.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_Ed25519_H
+#define ECP_Ed25519_H
+
+#include "fp_F25519.h"
+#include "config_curve_Ed25519.h"
+
+using namespace core;
+
+namespace Ed25519 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B256_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B256_56::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B256_56::BIG CURVE_Ad;
+extern const B256_56::BIG CURVE_Bd;
+extern const B256_56::BIG PC[];
+
+extern const B256_56::BIG CURVE_Adr;
+extern const B256_56::BIG CURVE_Adi;
+extern const B256_56::BIG CURVE_Bdr;
+extern const B256_56::BIG CURVE_Bdi;
+extern const B256_56::BIG PCR[];
+extern const B256_56::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B256_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B256_56::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B256_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B256_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B256_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    F25519::FP x; /**< x-coordinate of point */
+#if CURVETYPE_Ed25519!=MONTGOMERY
+    F25519::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    F25519::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(F25519::FP *r, F25519::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B256_56::BIG x, int s);
+
+#if CURVETYPE_Ed25519==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B256_56::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x, B256_56::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B256_56::BIG x, B256_56::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B256_56::BIG e, B256_56::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B256_56::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f, B256_56::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B256_56::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, F25519::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B256_56::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_Ed448.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_Ed448.h
new file mode 100644
index 0000000..c42afc3
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_Ed448.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_Ed448_H
+#define ECP_Ed448_H
+
+#include "fp_F448.h"
+#include "config_curve_Ed448.h"
+
+using namespace core;
+
+namespace Ed448 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B448_58::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B448_58::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B448_58::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B448_58::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B448_58::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B448_58::BIG CURVE_Ad;
+extern const B448_58::BIG CURVE_Bd;
+extern const B448_58::BIG PC[];
+
+extern const B448_58::BIG CURVE_Adr;
+extern const B448_58::BIG CURVE_Adi;
+extern const B448_58::BIG CURVE_Bdr;
+extern const B448_58::BIG CURVE_Bdi;
+extern const B448_58::BIG PCR[];
+extern const B448_58::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B448_58::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B448_58::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B448_58::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B448_58::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B448_58::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B448_58::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B448_58::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B448_58::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B448_58::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B448_58::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B448_58::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B448_58::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B448_58::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    F448::FP x; /**< x-coordinate of point */
+#if CURVETYPE_Ed448!=MONTGOMERY
+    F448::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    F448::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(F448::FP *r, F448::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B448_58::BIG x, int s);
+
+#if CURVETYPE_Ed448==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B448_58::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B448_58::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B448_58::BIG x, B448_58::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B448_58::BIG x, B448_58::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B448_58::BIG e, B448_58::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B448_58::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B448_58::BIG e, B448_58::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B448_58::BIG e, B448_58::BIG f, B448_58::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B448_58::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, F448::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B448_58::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_FP256BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_FP256BN.h
new file mode 100644
index 0000000..9d2a861
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_FP256BN.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_FP256BN_H
+#define ECP_FP256BN_H
+
+#include "fp_FP256BN.h"
+#include "config_curve_FP256BN.h"
+
+using namespace core;
+
+namespace FP256BN {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B256_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B256_56::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B256_56::BIG CURVE_Ad;
+extern const B256_56::BIG CURVE_Bd;
+extern const B256_56::BIG PC[];
+
+extern const B256_56::BIG CURVE_Adr;
+extern const B256_56::BIG CURVE_Adi;
+extern const B256_56::BIG CURVE_Bdr;
+extern const B256_56::BIG CURVE_Bdi;
+extern const B256_56::BIG PCR[];
+extern const B256_56::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B256_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B256_56::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B256_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B256_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B256_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    FP256BN::FP x; /**< x-coordinate of point */
+#if CURVETYPE_FP256BN!=MONTGOMERY
+    FP256BN::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    FP256BN::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(FP256BN::FP *r, FP256BN::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B256_56::BIG x, int s);
+
+#if CURVETYPE_FP256BN==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B256_56::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x, B256_56::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B256_56::BIG x, B256_56::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B256_56::BIG e, B256_56::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B256_56::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f, B256_56::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B256_56::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, FP256BN::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B256_56::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_FP512BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_FP512BN.h
new file mode 100644
index 0000000..975dfe1
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_FP512BN.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_FP512BN_H
+#define ECP_FP512BN_H
+
+#include "fp_FP512BN.h"
+#include "config_curve_FP512BN.h"
+
+using namespace core;
+
+namespace FP512BN {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B512_60::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B512_60::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B512_60::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B512_60::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B512_60::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B512_60::BIG CURVE_Ad;
+extern const B512_60::BIG CURVE_Bd;
+extern const B512_60::BIG PC[];
+
+extern const B512_60::BIG CURVE_Adr;
+extern const B512_60::BIG CURVE_Adi;
+extern const B512_60::BIG CURVE_Bdr;
+extern const B512_60::BIG CURVE_Bdi;
+extern const B512_60::BIG PCR[];
+extern const B512_60::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B512_60::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B512_60::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B512_60::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B512_60::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B512_60::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B512_60::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B512_60::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B512_60::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B512_60::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B512_60::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B512_60::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B512_60::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B512_60::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    FP512BN::FP x; /**< x-coordinate of point */
+#if CURVETYPE_FP512BN!=MONTGOMERY
+    FP512BN::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    FP512BN::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(FP512BN::FP *r, FP512BN::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B512_60::BIG x, int s);
+
+#if CURVETYPE_FP512BN==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B512_60::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B512_60::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B512_60::BIG x, B512_60::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B512_60::BIG x, B512_60::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B512_60::BIG e, B512_60::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B512_60::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B512_60::BIG e, B512_60::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B512_60::BIG e, B512_60::BIG f, B512_60::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B512_60::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, FP512BN::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B512_60::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_HIFIVE.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_HIFIVE.h
new file mode 100644
index 0000000..ed58119
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_HIFIVE.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_HIFIVE_H
+#define ECP_HIFIVE_H
+
+#include "fp_HIFIVE.h"
+#include "config_curve_HIFIVE.h"
+
+using namespace core;
+
+namespace HIFIVE {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B336_60::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B336_60::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B336_60::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B336_60::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B336_60::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B336_60::BIG CURVE_Ad;
+extern const B336_60::BIG CURVE_Bd;
+extern const B336_60::BIG PC[];
+
+extern const B336_60::BIG CURVE_Adr;
+extern const B336_60::BIG CURVE_Adi;
+extern const B336_60::BIG CURVE_Bdr;
+extern const B336_60::BIG CURVE_Bdi;
+extern const B336_60::BIG PCR[];
+extern const B336_60::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B336_60::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B336_60::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B336_60::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B336_60::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B336_60::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B336_60::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B336_60::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B336_60::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B336_60::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B336_60::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B336_60::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B336_60::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B336_60::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B336_60::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B336_60::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B336_60::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B336_60::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B336_60::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B336_60::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B336_60::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B336_60::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B336_60::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B336_60::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B336_60::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B336_60::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B336_60::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B336_60::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B336_60::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B336_60::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B336_60::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B336_60::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B336_60::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B336_60::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B336_60::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B336_60::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B336_60::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B336_60::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    HIFIVE::FP x; /**< x-coordinate of point */
+#if CURVETYPE_HIFIVE!=MONTGOMERY
+    HIFIVE::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    HIFIVE::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(HIFIVE::FP *r, HIFIVE::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B336_60::BIG x, int s);
+
+#if CURVETYPE_HIFIVE==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B336_60::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B336_60::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B336_60::BIG x, B336_60::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B336_60::BIG x, B336_60::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B336_60::BIG e, B336_60::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B336_60::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B336_60::BIG e, B336_60::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B336_60::BIG e, B336_60::BIG f, B336_60::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B336_60::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, HIFIVE::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B336_60::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_JUBJUB.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_JUBJUB.h
new file mode 100644
index 0000000..bb5a575
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_JUBJUB.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_JUBJUB_H
+#define ECP_JUBJUB_H
+
+#include "fp_JUBJUB.h"
+#include "config_curve_JUBJUB.h"
+
+using namespace core;
+
+namespace JUBJUB {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B256_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B256_56::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B256_56::BIG CURVE_Ad;
+extern const B256_56::BIG CURVE_Bd;
+extern const B256_56::BIG PC[];
+
+extern const B256_56::BIG CURVE_Adr;
+extern const B256_56::BIG CURVE_Adi;
+extern const B256_56::BIG CURVE_Bdr;
+extern const B256_56::BIG CURVE_Bdi;
+extern const B256_56::BIG PCR[];
+extern const B256_56::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B256_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B256_56::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B256_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B256_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B256_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    JUBJUB::FP x; /**< x-coordinate of point */
+#if CURVETYPE_JUBJUB!=MONTGOMERY
+    JUBJUB::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    JUBJUB::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(JUBJUB::FP *r, JUBJUB::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B256_56::BIG x, int s);
+
+#if CURVETYPE_JUBJUB==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B256_56::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x, B256_56::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B256_56::BIG x, B256_56::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B256_56::BIG e, B256_56::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B256_56::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f, B256_56::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B256_56::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, JUBJUB::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B256_56::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_MDC.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_MDC.h
new file mode 100644
index 0000000..15a221c
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_MDC.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_MDC_H
+#define ECP_MDC_H
+
+#include "fp_MDC.h"
+#include "config_curve_MDC.h"
+
+using namespace core;
+
+namespace MDC {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B256_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B256_56::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B256_56::BIG CURVE_Ad;
+extern const B256_56::BIG CURVE_Bd;
+extern const B256_56::BIG PC[];
+
+extern const B256_56::BIG CURVE_Adr;
+extern const B256_56::BIG CURVE_Adi;
+extern const B256_56::BIG CURVE_Bdr;
+extern const B256_56::BIG CURVE_Bdi;
+extern const B256_56::BIG PCR[];
+extern const B256_56::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B256_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B256_56::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B256_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B256_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B256_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    MDC::FP x; /**< x-coordinate of point */
+#if CURVETYPE_MDC!=MONTGOMERY
+    MDC::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    MDC::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(MDC::FP *r, MDC::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B256_56::BIG x, int s);
+
+#if CURVETYPE_MDC==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B256_56::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x, B256_56::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B256_56::BIG x, B256_56::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B256_56::BIG e, B256_56::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B256_56::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f, B256_56::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B256_56::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, MDC::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B256_56::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_NIST256.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_NIST256.h
new file mode 100644
index 0000000..4ba5005
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_NIST256.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_NIST256_H
+#define ECP_NIST256_H
+
+#include "fp_NIST256.h"
+#include "config_curve_NIST256.h"
+
+using namespace core;
+
+namespace NIST256 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B256_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B256_56::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B256_56::BIG CURVE_Ad;
+extern const B256_56::BIG CURVE_Bd;
+extern const B256_56::BIG PC[];
+
+extern const B256_56::BIG CURVE_Adr;
+extern const B256_56::BIG CURVE_Adi;
+extern const B256_56::BIG CURVE_Bdr;
+extern const B256_56::BIG CURVE_Bdi;
+extern const B256_56::BIG PCR[];
+extern const B256_56::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B256_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B256_56::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B256_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B256_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B256_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    NIST256::FP x; /**< x-coordinate of point */
+#if CURVETYPE_NIST256!=MONTGOMERY
+    NIST256::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    NIST256::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(NIST256::FP *r, NIST256::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B256_56::BIG x, int s);
+
+#if CURVETYPE_NIST256==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B256_56::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x, B256_56::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B256_56::BIG x, B256_56::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B256_56::BIG e, B256_56::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B256_56::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f, B256_56::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B256_56::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, NIST256::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B256_56::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_NIST384.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_NIST384.h
new file mode 100644
index 0000000..e011082
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_NIST384.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_NIST384_H
+#define ECP_NIST384_H
+
+#include "fp_NIST384.h"
+#include "config_curve_NIST384.h"
+
+using namespace core;
+
+namespace NIST384 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B384_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B384_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B384_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B384_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B384_56::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B384_56::BIG CURVE_Ad;
+extern const B384_56::BIG CURVE_Bd;
+extern const B384_56::BIG PC[];
+
+extern const B384_56::BIG CURVE_Adr;
+extern const B384_56::BIG CURVE_Adi;
+extern const B384_56::BIG CURVE_Bdr;
+extern const B384_56::BIG CURVE_Bdi;
+extern const B384_56::BIG PCR[];
+extern const B384_56::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B384_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B384_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B384_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B384_56::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_56::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_56::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_56::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_56::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_56::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_56::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_56::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B384_56::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_56::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_56::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_56::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_56::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_56::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_56::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_56::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B384_56::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_56::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_56::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_56::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_56::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_56::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_56::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_56::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B384_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B384_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B384_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B384_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B384_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B384_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B384_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    NIST384::FP x; /**< x-coordinate of point */
+#if CURVETYPE_NIST384!=MONTGOMERY
+    NIST384::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    NIST384::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(NIST384::FP *r, NIST384::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B384_56::BIG x, int s);
+
+#if CURVETYPE_NIST384==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B384_56::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B384_56::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B384_56::BIG x, B384_56::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B384_56::BIG x, B384_56::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B384_56::BIG e, B384_56::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B384_56::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B384_56::BIG e, B384_56::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B384_56::BIG e, B384_56::BIG f, B384_56::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B384_56::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, NIST384::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B384_56::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_NIST521.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_NIST521.h
new file mode 100644
index 0000000..82e0f0f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_NIST521.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_NIST521_H
+#define ECP_NIST521_H
+
+#include "fp_NIST521.h"
+#include "config_curve_NIST521.h"
+
+using namespace core;
+
+namespace NIST521 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B528_60::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B528_60::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B528_60::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B528_60::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B528_60::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B528_60::BIG CURVE_Ad;
+extern const B528_60::BIG CURVE_Bd;
+extern const B528_60::BIG PC[];
+
+extern const B528_60::BIG CURVE_Adr;
+extern const B528_60::BIG CURVE_Adi;
+extern const B528_60::BIG CURVE_Bdr;
+extern const B528_60::BIG CURVE_Bdi;
+extern const B528_60::BIG PCR[];
+extern const B528_60::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B528_60::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B528_60::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B528_60::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B528_60::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B528_60::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B528_60::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B528_60::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B528_60::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B528_60::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B528_60::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B528_60::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B528_60::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B528_60::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B528_60::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B528_60::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B528_60::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B528_60::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B528_60::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B528_60::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B528_60::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B528_60::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B528_60::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B528_60::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B528_60::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B528_60::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B528_60::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B528_60::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B528_60::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B528_60::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B528_60::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B528_60::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B528_60::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B528_60::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B528_60::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B528_60::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B528_60::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B528_60::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    NIST521::FP x; /**< x-coordinate of point */
+#if CURVETYPE_NIST521!=MONTGOMERY
+    NIST521::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    NIST521::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(NIST521::FP *r, NIST521::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B528_60::BIG x, int s);
+
+#if CURVETYPE_NIST521==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B528_60::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B528_60::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B528_60::BIG x, B528_60::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B528_60::BIG x, B528_60::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B528_60::BIG e, B528_60::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B528_60::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B528_60::BIG e, B528_60::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B528_60::BIG e, B528_60::BIG f, B528_60::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B528_60::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, NIST521::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B528_60::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_NUMS256E.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_NUMS256E.h
new file mode 100644
index 0000000..dada781
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_NUMS256E.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_NUMS256E_H
+#define ECP_NUMS256E_H
+
+#include "fp_F256PME.h"
+#include "config_curve_NUMS256E.h"
+
+using namespace core;
+
+namespace NUMS256E {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B256_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B256_56::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B256_56::BIG CURVE_Ad;
+extern const B256_56::BIG CURVE_Bd;
+extern const B256_56::BIG PC[];
+
+extern const B256_56::BIG CURVE_Adr;
+extern const B256_56::BIG CURVE_Adi;
+extern const B256_56::BIG CURVE_Bdr;
+extern const B256_56::BIG CURVE_Bdi;
+extern const B256_56::BIG PCR[];
+extern const B256_56::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B256_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B256_56::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B256_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B256_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B256_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    F256PME::FP x; /**< x-coordinate of point */
+#if CURVETYPE_NUMS256E!=MONTGOMERY
+    F256PME::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    F256PME::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(F256PME::FP *r, F256PME::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B256_56::BIG x, int s);
+
+#if CURVETYPE_NUMS256E==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B256_56::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x, B256_56::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B256_56::BIG x, B256_56::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B256_56::BIG e, B256_56::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B256_56::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f, B256_56::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B256_56::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, F256PME::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B256_56::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_NUMS256W.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_NUMS256W.h
new file mode 100644
index 0000000..7670540
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_NUMS256W.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_NUMS256W_H
+#define ECP_NUMS256W_H
+
+#include "fp_F256PMW.h"
+#include "config_curve_NUMS256W.h"
+
+using namespace core;
+
+namespace NUMS256W {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B256_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B256_56::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B256_56::BIG CURVE_Ad;
+extern const B256_56::BIG CURVE_Bd;
+extern const B256_56::BIG PC[];
+
+extern const B256_56::BIG CURVE_Adr;
+extern const B256_56::BIG CURVE_Adi;
+extern const B256_56::BIG CURVE_Bdr;
+extern const B256_56::BIG CURVE_Bdi;
+extern const B256_56::BIG PCR[];
+extern const B256_56::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B256_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B256_56::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B256_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B256_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B256_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    F256PMW::FP x; /**< x-coordinate of point */
+#if CURVETYPE_NUMS256W!=MONTGOMERY
+    F256PMW::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    F256PMW::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(F256PMW::FP *r, F256PMW::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B256_56::BIG x, int s);
+
+#if CURVETYPE_NUMS256W==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B256_56::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x, B256_56::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B256_56::BIG x, B256_56::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B256_56::BIG e, B256_56::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B256_56::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f, B256_56::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B256_56::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, F256PMW::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B256_56::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_NUMS384E.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_NUMS384E.h
new file mode 100644
index 0000000..61573b8
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_NUMS384E.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_NUMS384E_H
+#define ECP_NUMS384E_H
+
+#include "fp_F384PM.h"
+#include "config_curve_NUMS384E.h"
+
+using namespace core;
+
+namespace NUMS384E {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B384_58::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B384_58::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B384_58::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B384_58::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B384_58::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B384_58::BIG CURVE_Ad;
+extern const B384_58::BIG CURVE_Bd;
+extern const B384_58::BIG PC[];
+
+extern const B384_58::BIG CURVE_Adr;
+extern const B384_58::BIG CURVE_Adi;
+extern const B384_58::BIG CURVE_Bdr;
+extern const B384_58::BIG CURVE_Bdi;
+extern const B384_58::BIG PCR[];
+extern const B384_58::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B384_58::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B384_58::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B384_58::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B384_58::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B384_58::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B384_58::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B384_58::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B384_58::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B384_58::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B384_58::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B384_58::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B384_58::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B384_58::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    F384PM::FP x; /**< x-coordinate of point */
+#if CURVETYPE_NUMS384E!=MONTGOMERY
+    F384PM::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    F384PM::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(F384PM::FP *r, F384PM::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B384_58::BIG x, int s);
+
+#if CURVETYPE_NUMS384E==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B384_58::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B384_58::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B384_58::BIG x, B384_58::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B384_58::BIG x, B384_58::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B384_58::BIG e, B384_58::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B384_58::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B384_58::BIG e, B384_58::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B384_58::BIG e, B384_58::BIG f, B384_58::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B384_58::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, F384PM::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B384_58::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_NUMS384W.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_NUMS384W.h
new file mode 100644
index 0000000..6fe0051
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_NUMS384W.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_NUMS384W_H
+#define ECP_NUMS384W_H
+
+#include "fp_F384PM.h"
+#include "config_curve_NUMS384W.h"
+
+using namespace core;
+
+namespace NUMS384W {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B384_58::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B384_58::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B384_58::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B384_58::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B384_58::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B384_58::BIG CURVE_Ad;
+extern const B384_58::BIG CURVE_Bd;
+extern const B384_58::BIG PC[];
+
+extern const B384_58::BIG CURVE_Adr;
+extern const B384_58::BIG CURVE_Adi;
+extern const B384_58::BIG CURVE_Bdr;
+extern const B384_58::BIG CURVE_Bdi;
+extern const B384_58::BIG PCR[];
+extern const B384_58::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B384_58::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B384_58::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B384_58::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B384_58::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B384_58::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B384_58::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B384_58::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B384_58::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B384_58::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B384_58::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B384_58::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B384_58::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B384_58::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    F384PM::FP x; /**< x-coordinate of point */
+#if CURVETYPE_NUMS384W!=MONTGOMERY
+    F384PM::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    F384PM::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(F384PM::FP *r, F384PM::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B384_58::BIG x, int s);
+
+#if CURVETYPE_NUMS384W==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B384_58::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B384_58::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B384_58::BIG x, B384_58::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B384_58::BIG x, B384_58::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B384_58::BIG e, B384_58::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B384_58::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B384_58::BIG e, B384_58::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B384_58::BIG e, B384_58::BIG f, B384_58::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B384_58::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, F384PM::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B384_58::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_NUMS512E.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_NUMS512E.h
new file mode 100644
index 0000000..b4333f8
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_NUMS512E.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_NUMS512E_H
+#define ECP_NUMS512E_H
+
+#include "fp_F512PM.h"
+#include "config_curve_NUMS512E.h"
+
+using namespace core;
+
+namespace NUMS512E {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B512_60::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B512_60::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B512_60::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B512_60::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B512_60::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B512_60::BIG CURVE_Ad;
+extern const B512_60::BIG CURVE_Bd;
+extern const B512_60::BIG PC[];
+
+extern const B512_60::BIG CURVE_Adr;
+extern const B512_60::BIG CURVE_Adi;
+extern const B512_60::BIG CURVE_Bdr;
+extern const B512_60::BIG CURVE_Bdi;
+extern const B512_60::BIG PCR[];
+extern const B512_60::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B512_60::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B512_60::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B512_60::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B512_60::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B512_60::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B512_60::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B512_60::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B512_60::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B512_60::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B512_60::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B512_60::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B512_60::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B512_60::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    F512PM::FP x; /**< x-coordinate of point */
+#if CURVETYPE_NUMS512E!=MONTGOMERY
+    F512PM::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    F512PM::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(F512PM::FP *r, F512PM::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B512_60::BIG x, int s);
+
+#if CURVETYPE_NUMS512E==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B512_60::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B512_60::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B512_60::BIG x, B512_60::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B512_60::BIG x, B512_60::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B512_60::BIG e, B512_60::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B512_60::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B512_60::BIG e, B512_60::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B512_60::BIG e, B512_60::BIG f, B512_60::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B512_60::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, F512PM::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B512_60::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_NUMS512W.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_NUMS512W.h
new file mode 100644
index 0000000..a791911
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_NUMS512W.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_NUMS512W_H
+#define ECP_NUMS512W_H
+
+#include "fp_F512PM.h"
+#include "config_curve_NUMS512W.h"
+
+using namespace core;
+
+namespace NUMS512W {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B512_60::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B512_60::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B512_60::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B512_60::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B512_60::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B512_60::BIG CURVE_Ad;
+extern const B512_60::BIG CURVE_Bd;
+extern const B512_60::BIG PC[];
+
+extern const B512_60::BIG CURVE_Adr;
+extern const B512_60::BIG CURVE_Adi;
+extern const B512_60::BIG CURVE_Bdr;
+extern const B512_60::BIG CURVE_Bdi;
+extern const B512_60::BIG PCR[];
+extern const B512_60::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B512_60::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B512_60::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B512_60::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B512_60::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B512_60::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B512_60::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B512_60::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B512_60::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B512_60::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B512_60::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B512_60::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B512_60::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B512_60::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    F512PM::FP x; /**< x-coordinate of point */
+#if CURVETYPE_NUMS512W!=MONTGOMERY
+    F512PM::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    F512PM::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(F512PM::FP *r, F512PM::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B512_60::BIG x, int s);
+
+#if CURVETYPE_NUMS512W==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B512_60::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B512_60::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B512_60::BIG x, B512_60::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B512_60::BIG x, B512_60::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B512_60::BIG e, B512_60::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B512_60::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B512_60::BIG e, B512_60::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B512_60::BIG e, B512_60::BIG f, B512_60::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B512_60::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, F512PM::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B512_60::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_SECP160R1.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_SECP160R1.h
new file mode 100644
index 0000000..b31d8ab
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_SECP160R1.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_SECP160R1_H
+#define ECP_SECP160R1_H
+
+#include "fp_SECP160R1.h"
+#include "config_curve_SECP160R1.h"
+
+using namespace core;
+
+namespace SECP160R1 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B160_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B160_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B160_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B160_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B160_56::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B160_56::BIG CURVE_Ad;
+extern const B160_56::BIG CURVE_Bd;
+extern const B160_56::BIG PC[];
+
+extern const B160_56::BIG CURVE_Adr;
+extern const B160_56::BIG CURVE_Adi;
+extern const B160_56::BIG CURVE_Bdr;
+extern const B160_56::BIG CURVE_Bdi;
+extern const B160_56::BIG PCR[];
+extern const B160_56::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B160_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B160_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B160_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B160_56::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B160_56::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B160_56::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B160_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B160_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B160_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B160_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B160_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B160_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B160_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    SECP160R1::FP x; /**< x-coordinate of point */
+#if CURVETYPE_SECP160R1!=MONTGOMERY
+    SECP160R1::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    SECP160R1::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(SECP160R1::FP *r, SECP160R1::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B160_56::BIG x, int s);
+
+#if CURVETYPE_SECP160R1==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B160_56::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B160_56::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B160_56::BIG x, B160_56::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B160_56::BIG x, B160_56::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B160_56::BIG e, B160_56::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B160_56::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B160_56::BIG e, B160_56::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B160_56::BIG e, B160_56::BIG f, B160_56::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B160_56::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, SECP160R1::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B160_56::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_SECP256K1.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_SECP256K1.h
new file mode 100644
index 0000000..642f10e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_SECP256K1.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_SECP256K1_H
+#define ECP_SECP256K1_H
+
+#include "fp_SECP256K1.h"
+#include "config_curve_SECP256K1.h"
+
+using namespace core;
+
+namespace SECP256K1 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B256_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B256_56::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B256_56::BIG CURVE_Ad;
+extern const B256_56::BIG CURVE_Bd;
+extern const B256_56::BIG PC[];
+
+extern const B256_56::BIG CURVE_Adr;
+extern const B256_56::BIG CURVE_Adi;
+extern const B256_56::BIG CURVE_Bdr;
+extern const B256_56::BIG CURVE_Bdi;
+extern const B256_56::BIG PCR[];
+extern const B256_56::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B256_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B256_56::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B256_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B256_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B256_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    SECP256K1::FP x; /**< x-coordinate of point */
+#if CURVETYPE_SECP256K1!=MONTGOMERY
+    SECP256K1::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    SECP256K1::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(SECP256K1::FP *r, SECP256K1::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B256_56::BIG x, int s);
+
+#if CURVETYPE_SECP256K1==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B256_56::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x, B256_56::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B256_56::BIG x, B256_56::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B256_56::BIG e, B256_56::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B256_56::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f, B256_56::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B256_56::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, SECP256K1::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B256_56::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_SM2.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_SM2.h
new file mode 100644
index 0000000..236495e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_SM2.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_SM2_H
+#define ECP_SM2_H
+
+#include "fp_SM2.h"
+#include "config_curve_SM2.h"
+
+using namespace core;
+
+namespace SM2 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B256_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B256_56::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B256_56::BIG CURVE_Ad;
+extern const B256_56::BIG CURVE_Bd;
+extern const B256_56::BIG PC[];
+
+extern const B256_56::BIG CURVE_Adr;
+extern const B256_56::BIG CURVE_Adi;
+extern const B256_56::BIG CURVE_Bdr;
+extern const B256_56::BIG CURVE_Bdi;
+extern const B256_56::BIG PCR[];
+extern const B256_56::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B256_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B256_56::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B256_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B256_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B256_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    SM2::FP x; /**< x-coordinate of point */
+#if CURVETYPE_SM2!=MONTGOMERY
+    SM2::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    SM2::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(SM2::FP *r, SM2::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B256_56::BIG x, int s);
+
+#if CURVETYPE_SM2==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B256_56::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x, B256_56::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B256_56::BIG x, B256_56::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B256_56::BIG e, B256_56::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B256_56::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f, B256_56::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B256_56::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, SM2::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B256_56::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_TWEEDLEDEE.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_TWEEDLEDEE.h
new file mode 100644
index 0000000..9e4d19e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_TWEEDLEDEE.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_TWEEDLEDEE_H
+#define ECP_TWEEDLEDEE_H
+
+#include "fp_TWEEDLEDEE.h"
+#include "config_curve_TWEEDLEDEE.h"
+
+using namespace core;
+
+namespace TWEEDLEDEE {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B256_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B256_56::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B256_56::BIG CURVE_Ad;
+extern const B256_56::BIG CURVE_Bd;
+extern const B256_56::BIG PC[];
+
+extern const B256_56::BIG CURVE_Adr;
+extern const B256_56::BIG CURVE_Adi;
+extern const B256_56::BIG CURVE_Bdr;
+extern const B256_56::BIG CURVE_Bdi;
+extern const B256_56::BIG PCR[];
+extern const B256_56::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B256_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B256_56::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B256_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B256_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B256_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    TWEEDLEDEE::FP x; /**< x-coordinate of point */
+#if CURVETYPE_TWEEDLEDEE!=MONTGOMERY
+    TWEEDLEDEE::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    TWEEDLEDEE::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(TWEEDLEDEE::FP *r, TWEEDLEDEE::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B256_56::BIG x, int s);
+
+#if CURVETYPE_TWEEDLEDEE==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B256_56::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x, B256_56::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B256_56::BIG x, B256_56::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B256_56::BIG e, B256_56::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B256_56::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f, B256_56::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B256_56::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, TWEEDLEDEE::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B256_56::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_TWEEDLEDUM.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_TWEEDLEDUM.h
new file mode 100644
index 0000000..fcb9fd1
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_TWEEDLEDUM.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_TWEEDLEDUM_H
+#define ECP_TWEEDLEDUM_H
+
+#include "fp_TWEEDLEDUM.h"
+#include "config_curve_TWEEDLEDUM.h"
+
+using namespace core;
+
+namespace TWEEDLEDUM {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B256_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B256_56::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B256_56::BIG CURVE_Ad;
+extern const B256_56::BIG CURVE_Bd;
+extern const B256_56::BIG PC[];
+
+extern const B256_56::BIG CURVE_Adr;
+extern const B256_56::BIG CURVE_Adi;
+extern const B256_56::BIG CURVE_Bdr;
+extern const B256_56::BIG CURVE_Bdi;
+extern const B256_56::BIG PCR[];
+extern const B256_56::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B256_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B256_56::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B256_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B256_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B256_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    TWEEDLEDUM::FP x; /**< x-coordinate of point */
+#if CURVETYPE_TWEEDLEDUM!=MONTGOMERY
+    TWEEDLEDUM::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    TWEEDLEDUM::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(TWEEDLEDUM::FP *r, TWEEDLEDUM::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B256_56::BIG x, int s);
+
+#if CURVETYPE_TWEEDLEDUM==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B256_56::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x, B256_56::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B256_56::BIG x, B256_56::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B256_56::BIG e, B256_56::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B256_56::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f, B256_56::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B256_56::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, TWEEDLEDUM::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B256_56::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_X448.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_X448.h
new file mode 100644
index 0000000..5507d98
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ecp_X448.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_X448_H
+#define ECP_X448_H
+
+#include "fp_F448.h"
+#include "config_curve_X448.h"
+
+using namespace core;
+
+namespace X448 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B448_58::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B448_58::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B448_58::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B448_58::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B448_58::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B448_58::BIG CURVE_Ad;
+extern const B448_58::BIG CURVE_Bd;
+extern const B448_58::BIG PC[];
+
+extern const B448_58::BIG CURVE_Adr;
+extern const B448_58::BIG CURVE_Adi;
+extern const B448_58::BIG CURVE_Bdr;
+extern const B448_58::BIG CURVE_Bdi;
+extern const B448_58::BIG PCR[];
+extern const B448_58::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B448_58::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B448_58::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B448_58::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B448_58::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B448_58::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B448_58::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B448_58::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B448_58::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B448_58::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B448_58::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B448_58::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B448_58::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B448_58::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    F448::FP x; /**< x-coordinate of point */
+#if CURVETYPE_X448!=MONTGOMERY
+    F448::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    F448::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(F448::FP *r, F448::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B448_58::BIG x, int s);
+
+#if CURVETYPE_X448==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B448_58::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B448_58::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B448_58::BIG x, B448_58::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B448_58::BIG x, B448_58::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B448_58::BIG e, B448_58::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B448_58::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B448_58::BIG e, B448_58::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B448_58::BIG e, B448_58::BIG f, B448_58::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B448_58::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, F448::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B448_58::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa.cpp
new file mode 100644
index 0000000..22b890b
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa.cpp
@@ -0,0 +1,409 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+// EDDSA API functions
+
+// see https://nvlpubs.nist.gov/nistpubs/FIPS/NIST.FIPS.186-5.pdf
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <time.h>
+
+#include "eddsa_ZZZ.h"
+
+#if CURVETYPE_ZZZ == EDWARDS
+
+using namespace XXX;
+using namespace YYY;
+
+// Process a random BIG r by RFC7748 (for Montgomery & Edwards curves only)
+static void RFC7748(BIG r)
+{
+    int c,lg=0;
+    BIG t;
+    c=ZZZ::CURVE_Cof_I;
+    while (c!=1)
+    {
+        lg++;
+        c/=2;
+    }
+    int n=8*MODBYTES_XXX-lg+1;
+    BIG_mod2m(r,n);
+    BIG_zero(t); BIG_inc(t,1); BIG_shl(t,n);
+    BIG_add(r,r,t);
+    c=BIG_lastbits(r,lg);
+    BIG_dec(r,c);
+//    printf("lg= %d n=%d\n",lg,n);
+}
+
+// reverse first n bytes of buff - for little endian
+static void reverse(int n,char *buff) {
+    for (int i = 0; i < n/2; i++) { 
+        char ch = buff[i]; 
+        buff[i] = buff[n - i - 1]; 
+        buff[n - i - 1] = ch; 
+    } 
+}
+
+// dom2 - context still needs to be appended
+static void dom2(bool ph,int cl,octet *DOM) {
+    OCT_jstring(DOM,(char *)"SigZZZ no ZZZ collisions");
+    if (ph)
+        OCT_jbyte(DOM,1,1);
+    else 
+        OCT_jbyte(DOM,0,1);
+    OCT_jbyte(DOM,cl,1); // context length
+}
+
+// dom4 - context still needs to be appended
+static void dom4(bool ph,int cl,octet *DOM) {
+    OCT_jstring(DOM,(char *)"SigZZZ");
+    if (ph)
+        OCT_jbyte(DOM,1,1);
+    else 
+        OCT_jbyte(DOM,0,1);
+    OCT_jbyte(DOM,cl,1); // context length
+}
+
+static void H(octet *S,char *digest)
+{
+#if CURVE_SECURITY_ZZZ <= 128  // for ed25519?
+    hash512 sh512;
+    HASH512_init(&sh512);
+    for (int i=0;i<S->len;i++ )
+        HASH512_process(&sh512,S->val[i]);
+    HASH512_hash(&sh512,digest);
+#else                          // for ed448?
+    sha3 SHA3;
+    SHA3_init(&SHA3,SHAKE256);
+    for (int i=0;i<S->len;i++) 
+        SHA3_process(&SHA3,S->val[i]);
+    SHA3_shake(&SHA3,digest,2*S->len); 
+#endif
+}
+
+static int H2(bool ph,octet *context,octet *R,octet *Q,octet *M,DBIG dr)
+{
+    char h[128];
+    int b=Q->len;
+    char dom[64];
+    octet DOM={0,sizeof(dom),dom};
+    int cl;
+    if (context==NULL) cl=0;
+    else cl=context->len&0xff;
+#if CURVE_SECURITY_ZZZ <= 128  // for ed25519?
+    hash512 sh512;
+    HASH512_init(&sh512);
+    if (ph || cl>0)
+    {                   // if not prehash and no context, omit dom2()
+        dom2(ph,cl,&DOM);
+        for (int i=0;i<DOM.len;i++)
+            HASH512_process(&sh512,DOM.val[i]);
+        for (int i=0;i<cl;i++)
+            HASH512_process(&sh512,context->val[i]);
+    }
+    for (int i=0;i<b;i++ )
+        HASH512_process(&sh512,R->val[i]);
+    for (int i=0;i<b;i++ )
+        HASH512_process(&sh512,Q->val[i]);
+    for (int i=0;i<M->len;i++ )
+        HASH512_process(&sh512,M->val[i]);
+    HASH512_hash(&sh512,h);
+#else                          // for ed448?
+    dom4(ph,cl,&DOM);
+    sha3 SHA3;
+    SHA3_init(&SHA3,SHAKE256);
+    for (int i=0;i<DOM.len;i++)
+        SHA3_process(&SHA3,DOM.val[i]);
+    for (int i=0;i<cl;i++)
+        SHA3_process(&SHA3,context->val[i]);
+    for (int i=0;i<b;i++) 
+        SHA3_process(&SHA3,R->val[i]);
+    for (int i=0;i<b;i++) 
+        SHA3_process(&SHA3,Q->val[i]);
+    for (int i=0;i<M->len;i++) 
+        SHA3_process(&SHA3,M->val[i]);
+    SHA3_shake(&SHA3,h,2*b);
+#endif
+    reverse(2*b,h);
+    BIG_dfromBytesLen(dr,h,2*b);
+    return 2*b;
+}
+
+static void getR(bool ph,int b,char *digest,octet *context,octet *M,DBIG dr) {
+    char h[128];
+    char dom[64];
+    octet DOM={0,sizeof(dom),dom};
+    int cl;
+    if (context==NULL) cl=0;
+    else cl=context->len&0xff;
+
+#if CURVE_SECURITY_ZZZ <= 128  // for ed25519?
+    hash512 sh512;
+    HASH512_init(&sh512);
+    if (ph || cl>0)
+    {                   // if not prehash and no context, omit dom2()
+        dom2(ph,cl,&DOM);
+        for (int i=0;i<DOM.len;i++)
+            HASH512_process(&sh512,DOM.val[i]);
+        for (int i=0;i<cl;i++)
+            HASH512_process(&sh512,context->val[i]);
+    }
+    for (int i=b;i<2*b;i++ )
+        HASH512_process(&sh512,digest[i]);
+    for (int i=0;i<M->len;i++)
+        HASH512_process(&sh512,M->val[i]);
+    HASH512_hash(&sh512,h);
+
+#else                       // for ed448?
+    dom4(ph,cl,&DOM);
+    sha3 SHA3;
+    SHA3_init(&SHA3,SHAKE256);
+    for (int i=0;i<DOM.len;i++)
+        SHA3_process(&SHA3,DOM.val[i]);
+    for (int i=0;i<cl;i++)
+        SHA3_process(&SHA3,context->val[i]);
+    for (int i=b;i<2*b;i++ )
+        SHA3_process(&SHA3,digest[i]);
+    for (int i=0;i<M->len;i++) 
+        SHA3_process(&SHA3,M->val[i]);
+    SHA3_shake(&SHA3,h,2*b); 
+#endif
+
+    reverse(2*b,h);
+    BIG_dfromBytesLen(dr,h,2*b);
+}
+// encode integer (little endian)
+static int encode_int(XXX::BIG x,char *ei) {
+    int b,index=0;
+
+    if (8*MODBYTES_XXX==MBITS_YYY) index=1; // extra byte needed for compression        
+    b=MODBYTES_XXX+index;
+
+    ei[0]=0;
+    BIG_toBytes(&ei[index],x);
+    reverse(b,ei);
+    return b;
+}
+
+// encode point
+static void encode(ZZZ::ECP *P,octet *W) {
+    BIG x,y;
+    int b,index=0;
+
+    if (8*MODBYTES_XXX==MBITS_YYY) index=1; // extra byte needed for compression        
+    b=MODBYTES_XXX+index;
+
+    ECP_get(x, y, P);
+    b=encode_int(y,W->val);
+    W->val[b-1]|=BIG_parity(x)<<7;
+    W->len=b;
+}
+
+// decode integer (little endian)
+static int decode_int(bool strip_sign,char *ei,XXX::BIG x) {
+    int b,index=0;
+    int sign=0;
+    char r[MODBYTES_XXX+1];
+
+    if (8*MODBYTES_XXX==MBITS_YYY) index=1; // extra byte needed for compression        
+    b=MODBYTES_XXX+index;
+
+    for (int i=0;i<b;i++)
+        r[i]=ei[i];
+  
+    reverse(b,r);
+    if ((r[0]&0x80)!=0)
+        sign=1;
+    if (strip_sign)
+        r[0]&=0x7f;
+
+    if (r[0]==0) // remove leading zero
+        BIG_fromBytesLen(x,&r[1],b-1);
+    else
+        BIG_fromBytesLen(x,&r[0],b);
+    return sign;
+}
+
+// decode compressed point
+static void decode(octet *W,ZZZ::ECP *P) {
+    BIG X,Y;
+    FP x,d,t,one,hint;
+    int sign=decode_int(true,W->val,Y); // LSB of x
+    FP_nres(&x,Y); 
+    FP_sqr(&x,&x);
+    FP_copy(&d,&x); FP_one(&one);
+    FP_sub(&x,&x,&one);
+    FP_norm(&x);
+    FP_rcopy(&t, ZZZ::CURVE_B);
+
+    FP_mul(&d,&d,&t);
+#if CURVE_A_ZZZ == 1
+    FP_sub(&d,&d,&one);
+#else
+    FP_add(&d,&d,&one);
+#endif  
+    FP_norm(&d);
+// inverse square root trick for sqrt(x/d)
+    FP_sqr(&t,&x);
+    FP_mul(&x,&x,&t);
+    FP_mul(&x,&x,&d);
+    if (!FP_qr(&x,&hint))
+    {
+        ECP_inf(P);
+        return;
+    }
+    FP_sqrt(&d,&x,&hint);
+    FP_inv(&x,&x,&hint);
+    FP_mul(&x,&x,&d);
+    FP_mul(&x,&x,&t);
+
+    FP_reduce(&x);
+    FP_redc(X,&x);
+    if (BIG_parity(X)!=sign)
+        FP_neg(&x,&x);
+    FP_norm(&x);
+    FP_redc(X,&x);
+    ECP_set(P,X,Y);
+}
+
+/* Calculate a public/private EC GF(p) key pair. Q=D.G mod EC(p),
+ * where D is the secret key and Q is the public key
+ * and G is fixed generator.
+ * RNG is a cryptographically strong RNG 
+ * If RNG==NULL, D is generated externally 
+ */
+int ZZZ::EDDSA_KEY_PAIR_GENERATE(csprng *RNG,octet* D,octet *Q)
+{
+    BIG r, x, y, s;
+    ECP G;
+    char digest[128];
+    int res = EDDSA_OK;
+    int b,index=0;
+
+    if (8*MODBYTES_XXX==MBITS_YYY) index=1; // extra byte needed for compression        
+    b=MODBYTES_XXX+index;
+
+    ECP_generator(&G);
+
+    if (RNG != NULL)
+        OCT_rand(D, RNG, b); // create random private key
+
+    H(D,digest);
+
+// reverse bytes for little endian
+    reverse(b,digest);
+    BIG_fromBytes(s,&digest[index]);
+    RFC7748(s);
+    ECP_mul(&G, s);
+
+    encode(&G,Q);
+    return res;
+}
+
+// Generate a signature using key pair (D,Q) on message M
+// Set ph=true if message has already been pre-hashed
+// if ph=false, then context should be NULL for ed25519. However RFC8032 mode ed25519ctx is supported by supplying a non-NULL or non-empty context
+int ZZZ::EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG)
+{
+    DBIG dr;
+    BIG s,sr,sd,q;
+    ECP R;
+    char digest[128];
+    char pq[MODBYTES_XXX+1];
+    octet Q={0,sizeof(pq),pq};
+    H(D,digest);   // hash of private key
+    int res = EDDSA_OK;
+    int b,index=0;
+    if (8*MODBYTES_XXX==MBITS_YYY) index=1; // extra byte needed for compression        
+    b=MODBYTES_XXX+index;
+
+    EDDSA_KEY_PAIR_GENERATE(NULL,D,&Q);
+
+    BIG_rcopy(q, CURVE_Order);
+    ECP_generator(&R);
+
+    if (D->len!=Q.len || D->len!=b)
+        res=EDDSA_INVALID_PUBLIC_KEY;
+    if (res==EDDSA_OK)
+    {
+        getR(ph,b,digest,context,M,dr);
+        BIG_dmod(sr,dr,q);
+        ECP_mul(&R,sr);
+        encode(&R,SIG);
+// reverse bytes for little endian        
+        reverse(b,digest);
+        BIG_fromBytes(s,&digest[index]);
+        RFC7748(s);
+        H2(ph,context,SIG,&Q,M,dr);
+        BIG_dmod(sd,dr,q);
+        BIG_modmul(s,s,sd,q);
+        BIG_modadd(s,s,sr,q);
+        encode_int(s,&SIG->val[b]);
+        SIG->len=2*b;
+    }
+    return res;
+}
+
+// verify a signature using public key Q
+// same context (if any) as used for signature
+bool ZZZ::EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG) 
+{
+    DBIG du;
+    BIG q,t,su;
+    ECP R,QD,G;
+    int res = EDDSA_OK;
+    bool dr,dq;
+    int lg=0;
+    int c,b,index=0;
+    if (8*MODBYTES_XXX==MBITS_YYY) index=1; // extra byte needed for compression        
+    b=MODBYTES_XXX+index;
+
+    c=ZZZ::CURVE_Cof_I;
+    while (c!=1)
+    {
+        lg++;
+        c/=2;
+    }
+    BIG_rcopy(q, CURVE_Order);
+
+    decode(SIG,&R);
+    if (ECP_isinf(&R)) return false;
+    decode_int(false,&SIG->val[b],t);
+    if (BIG_comp(t,q)>=0) return false;
+    decode(Q,&QD);
+    if (ECP_isinf(&QD)) return false;
+
+    H2(ph,context,SIG,Q,M,du);
+    BIG_dmod(su,du,q);
+    ECP_generator(&G);
+    for (int i=0;i<lg;i++)
+    { // use cofactor 2^c
+        ECP_dbl(&G); ECP_dbl(&QD); ECP_dbl(&R);
+    }
+
+    ECP_neg(&QD);
+    ECP_mul2(&G,&QD,t,su);
+
+    if (!ECP_equals(&G,&R)) return false;
+
+    return true;
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa.h
new file mode 100644
index 0000000..a7cb9ab
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_ZZZ_H
+#define EDDSA_ZZZ_H
+
+#include "ecp_ZZZ.h"
+
+using namespace core;
+
+#define EGS_ZZZ MODBYTES_XXX  /**< ECC Group Size in bytes */
+#define EFS_ZZZ MODBYTES_XXX  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace ZZZ {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_ANSSI.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_ANSSI.h
new file mode 100644
index 0000000..603b6a4
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_ANSSI.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_ANSSI_H
+#define EDDSA_ANSSI_H
+
+#include "ecp_ANSSI.h"
+
+using namespace core;
+
+#define EGS_ANSSI MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_ANSSI MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace ANSSI {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_BLS12381.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_BLS12381.h
new file mode 100644
index 0000000..096a4dc
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_BLS12381.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_BLS12381_H
+#define EDDSA_BLS12381_H
+
+#include "ecp_BLS12381.h"
+
+using namespace core;
+
+#define EGS_BLS12381 MODBYTES_B384_58  /**< ECC Group Size in bytes */
+#define EFS_BLS12381 MODBYTES_B384_58  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace BLS12381 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_BLS12383.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_BLS12383.h
new file mode 100644
index 0000000..b7058db
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_BLS12383.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_BLS12383_H
+#define EDDSA_BLS12383_H
+
+#include "ecp_BLS12383.h"
+
+using namespace core;
+
+#define EGS_BLS12383 MODBYTES_B384_58  /**< ECC Group Size in bytes */
+#define EFS_BLS12383 MODBYTES_B384_58  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace BLS12383 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_BLS12443.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_BLS12443.h
new file mode 100644
index 0000000..3412e90
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_BLS12443.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_BLS12443_H
+#define EDDSA_BLS12443_H
+
+#include "ecp_BLS12443.h"
+
+using namespace core;
+
+#define EGS_BLS12443 MODBYTES_B448_60  /**< ECC Group Size in bytes */
+#define EFS_BLS12443 MODBYTES_B448_60  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace BLS12443 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_BLS12461.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_BLS12461.h
new file mode 100644
index 0000000..751cf70
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_BLS12461.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_BLS12461_H
+#define EDDSA_BLS12461_H
+
+#include "ecp_BLS12461.h"
+
+using namespace core;
+
+#define EGS_BLS12461 MODBYTES_B464_60  /**< ECC Group Size in bytes */
+#define EFS_BLS12461 MODBYTES_B464_60  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace BLS12461 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_BLS24479.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_BLS24479.h
new file mode 100644
index 0000000..0cc685a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_BLS24479.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_BLS24479_H
+#define EDDSA_BLS24479_H
+
+#include "ecp_BLS24479.h"
+
+using namespace core;
+
+#define EGS_BLS24479 MODBYTES_B480_56  /**< ECC Group Size in bytes */
+#define EFS_BLS24479 MODBYTES_B480_56  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace BLS24479 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_BLS48286.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_BLS48286.h
new file mode 100644
index 0000000..790104a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_BLS48286.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_BLS48286_H
+#define EDDSA_BLS48286_H
+
+#include "ecp_BLS48286.h"
+
+using namespace core;
+
+#define EGS_BLS48286 MODBYTES_B288_60  /**< ECC Group Size in bytes */
+#define EFS_BLS48286 MODBYTES_B288_60  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace BLS48286 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_BLS48556.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_BLS48556.h
new file mode 100644
index 0000000..d1e8fc2
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_BLS48556.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_BLS48556_H
+#define EDDSA_BLS48556_H
+
+#include "ecp_BLS48556.h"
+
+using namespace core;
+
+#define EGS_BLS48556 MODBYTES_B560_58  /**< ECC Group Size in bytes */
+#define EFS_BLS48556 MODBYTES_B560_58  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace BLS48556 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_BLS48581.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_BLS48581.h
new file mode 100644
index 0000000..1e847e9
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_BLS48581.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_BLS48581_H
+#define EDDSA_BLS48581_H
+
+#include "ecp_BLS48581.h"
+
+using namespace core;
+
+#define EGS_BLS48581 MODBYTES_B584_60  /**< ECC Group Size in bytes */
+#define EFS_BLS48581 MODBYTES_B584_60  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace BLS48581 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_BN158.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_BN158.h
new file mode 100644
index 0000000..690089e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_BN158.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_BN158_H
+#define EDDSA_BN158_H
+
+#include "ecp_BN158.h"
+
+using namespace core;
+
+#define EGS_BN158 MODBYTES_B160_56  /**< ECC Group Size in bytes */
+#define EFS_BN158 MODBYTES_B160_56  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace BN158 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_BN254.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_BN254.h
new file mode 100644
index 0000000..c480692
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_BN254.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_BN254_H
+#define EDDSA_BN254_H
+
+#include "ecp_BN254.h"
+
+using namespace core;
+
+#define EGS_BN254 MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_BN254 MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace BN254 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_BN254CX.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_BN254CX.h
new file mode 100644
index 0000000..4efb2c6
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_BN254CX.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_BN254CX_H
+#define EDDSA_BN254CX_H
+
+#include "ecp_BN254CX.h"
+
+using namespace core;
+
+#define EGS_BN254CX MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_BN254CX MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace BN254CX {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_BN462.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_BN462.h
new file mode 100644
index 0000000..d6ea2f6
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_BN462.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_BN462_H
+#define EDDSA_BN462_H
+
+#include "ecp_BN462.h"
+
+using namespace core;
+
+#define EGS_BN462 MODBYTES_B464_60  /**< ECC Group Size in bytes */
+#define EFS_BN462 MODBYTES_B464_60  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace BN462 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_BRAINPOOL.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_BRAINPOOL.h
new file mode 100644
index 0000000..9060701
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_BRAINPOOL.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_BRAINPOOL_H
+#define EDDSA_BRAINPOOL_H
+
+#include "ecp_BRAINPOOL.h"
+
+using namespace core;
+
+#define EGS_BRAINPOOL MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_BRAINPOOL MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace BRAINPOOL {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_C1174.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_C1174.h
new file mode 100644
index 0000000..c0ad055
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_C1174.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_C1174_H
+#define EDDSA_C1174_H
+
+#include "ecp_C1174.h"
+
+using namespace core;
+
+#define EGS_C1174 MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_C1174 MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace C1174 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_C13318.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_C13318.h
new file mode 100644
index 0000000..1748c9d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_C13318.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_C13318_H
+#define EDDSA_C13318_H
+
+#include "ecp_C13318.h"
+
+using namespace core;
+
+#define EGS_C13318 MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_C13318 MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace C13318 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_C1665.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_C1665.h
new file mode 100644
index 0000000..8ec25ee
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_C1665.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_C1665_H
+#define EDDSA_C1665_H
+
+#include "ecp_C1665.h"
+
+using namespace core;
+
+#define EGS_C1665 MODBYTES_B168_60  /**< ECC Group Size in bytes */
+#define EFS_C1665 MODBYTES_B168_60  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace C1665 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_C25519.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_C25519.h
new file mode 100644
index 0000000..3617524
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_C25519.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_C25519_H
+#define EDDSA_C25519_H
+
+#include "ecp_C25519.h"
+
+using namespace core;
+
+#define EGS_C25519 MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_C25519 MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace C25519 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_C41417.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_C41417.h
new file mode 100644
index 0000000..de4b76c
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_C41417.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_C41417_H
+#define EDDSA_C41417_H
+
+#include "ecp_C41417.h"
+
+using namespace core;
+
+#define EGS_C41417 MODBYTES_B416_60  /**< ECC Group Size in bytes */
+#define EFS_C41417 MODBYTES_B416_60  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace C41417 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_Ed25519.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_Ed25519.h
new file mode 100644
index 0000000..3e8edda
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_Ed25519.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_Ed25519_H
+#define EDDSA_Ed25519_H
+
+#include "ecp_Ed25519.h"
+
+using namespace core;
+
+#define EGS_Ed25519 MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_Ed25519 MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace Ed25519 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_Ed448.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_Ed448.h
new file mode 100644
index 0000000..6893ad8
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_Ed448.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_Ed448_H
+#define EDDSA_Ed448_H
+
+#include "ecp_Ed448.h"
+
+using namespace core;
+
+#define EGS_Ed448 MODBYTES_B448_58  /**< ECC Group Size in bytes */
+#define EFS_Ed448 MODBYTES_B448_58  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace Ed448 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_FP256BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_FP256BN.h
new file mode 100644
index 0000000..d6e38b5
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_FP256BN.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_FP256BN_H
+#define EDDSA_FP256BN_H
+
+#include "ecp_FP256BN.h"
+
+using namespace core;
+
+#define EGS_FP256BN MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_FP256BN MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace FP256BN {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_FP512BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_FP512BN.h
new file mode 100644
index 0000000..2550f15
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_FP512BN.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_FP512BN_H
+#define EDDSA_FP512BN_H
+
+#include "ecp_FP512BN.h"
+
+using namespace core;
+
+#define EGS_FP512BN MODBYTES_B512_60  /**< ECC Group Size in bytes */
+#define EFS_FP512BN MODBYTES_B512_60  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace FP512BN {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_HIFIVE.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_HIFIVE.h
new file mode 100644
index 0000000..4c189f7
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_HIFIVE.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_HIFIVE_H
+#define EDDSA_HIFIVE_H
+
+#include "ecp_HIFIVE.h"
+
+using namespace core;
+
+#define EGS_HIFIVE MODBYTES_B336_60  /**< ECC Group Size in bytes */
+#define EFS_HIFIVE MODBYTES_B336_60  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace HIFIVE {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_JUBJUB.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_JUBJUB.h
new file mode 100644
index 0000000..0c2ce16
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_JUBJUB.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_JUBJUB_H
+#define EDDSA_JUBJUB_H
+
+#include "ecp_JUBJUB.h"
+
+using namespace core;
+
+#define EGS_JUBJUB MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_JUBJUB MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace JUBJUB {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_MDC.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_MDC.h
new file mode 100644
index 0000000..8ac00c0
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_MDC.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_MDC_H
+#define EDDSA_MDC_H
+
+#include "ecp_MDC.h"
+
+using namespace core;
+
+#define EGS_MDC MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_MDC MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace MDC {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_NIST256.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_NIST256.h
new file mode 100644
index 0000000..14b5908
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_NIST256.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_NIST256_H
+#define EDDSA_NIST256_H
+
+#include "ecp_NIST256.h"
+
+using namespace core;
+
+#define EGS_NIST256 MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_NIST256 MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace NIST256 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_NIST384.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_NIST384.h
new file mode 100644
index 0000000..4ab51fd
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_NIST384.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_NIST384_H
+#define EDDSA_NIST384_H
+
+#include "ecp_NIST384.h"
+
+using namespace core;
+
+#define EGS_NIST384 MODBYTES_B384_56  /**< ECC Group Size in bytes */
+#define EFS_NIST384 MODBYTES_B384_56  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace NIST384 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_NIST521.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_NIST521.h
new file mode 100644
index 0000000..817ab61
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_NIST521.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_NIST521_H
+#define EDDSA_NIST521_H
+
+#include "ecp_NIST521.h"
+
+using namespace core;
+
+#define EGS_NIST521 MODBYTES_B528_60  /**< ECC Group Size in bytes */
+#define EFS_NIST521 MODBYTES_B528_60  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace NIST521 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_NUMS256E.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_NUMS256E.h
new file mode 100644
index 0000000..a9eee5d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_NUMS256E.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_NUMS256E_H
+#define EDDSA_NUMS256E_H
+
+#include "ecp_NUMS256E.h"
+
+using namespace core;
+
+#define EGS_NUMS256E MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_NUMS256E MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace NUMS256E {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_NUMS256W.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_NUMS256W.h
new file mode 100644
index 0000000..bd9a769
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_NUMS256W.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_NUMS256W_H
+#define EDDSA_NUMS256W_H
+
+#include "ecp_NUMS256W.h"
+
+using namespace core;
+
+#define EGS_NUMS256W MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_NUMS256W MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace NUMS256W {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_NUMS384E.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_NUMS384E.h
new file mode 100644
index 0000000..cd9872f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_NUMS384E.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_NUMS384E_H
+#define EDDSA_NUMS384E_H
+
+#include "ecp_NUMS384E.h"
+
+using namespace core;
+
+#define EGS_NUMS384E MODBYTES_B384_58  /**< ECC Group Size in bytes */
+#define EFS_NUMS384E MODBYTES_B384_58  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace NUMS384E {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_NUMS384W.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_NUMS384W.h
new file mode 100644
index 0000000..c7467b3
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_NUMS384W.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_NUMS384W_H
+#define EDDSA_NUMS384W_H
+
+#include "ecp_NUMS384W.h"
+
+using namespace core;
+
+#define EGS_NUMS384W MODBYTES_B384_58  /**< ECC Group Size in bytes */
+#define EFS_NUMS384W MODBYTES_B384_58  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace NUMS384W {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_NUMS512E.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_NUMS512E.h
new file mode 100644
index 0000000..89591b9
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_NUMS512E.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_NUMS512E_H
+#define EDDSA_NUMS512E_H
+
+#include "ecp_NUMS512E.h"
+
+using namespace core;
+
+#define EGS_NUMS512E MODBYTES_B512_60  /**< ECC Group Size in bytes */
+#define EFS_NUMS512E MODBYTES_B512_60  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace NUMS512E {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_NUMS512W.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_NUMS512W.h
new file mode 100644
index 0000000..a5bddd7
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_NUMS512W.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_NUMS512W_H
+#define EDDSA_NUMS512W_H
+
+#include "ecp_NUMS512W.h"
+
+using namespace core;
+
+#define EGS_NUMS512W MODBYTES_B512_60  /**< ECC Group Size in bytes */
+#define EFS_NUMS512W MODBYTES_B512_60  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace NUMS512W {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_SECP160R1.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_SECP160R1.h
new file mode 100644
index 0000000..1baad57
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_SECP160R1.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_SECP160R1_H
+#define EDDSA_SECP160R1_H
+
+#include "ecp_SECP160R1.h"
+
+using namespace core;
+
+#define EGS_SECP160R1 MODBYTES_B160_56  /**< ECC Group Size in bytes */
+#define EFS_SECP160R1 MODBYTES_B160_56  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace SECP160R1 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_SECP256K1.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_SECP256K1.h
new file mode 100644
index 0000000..f72a77e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_SECP256K1.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_SECP256K1_H
+#define EDDSA_SECP256K1_H
+
+#include "ecp_SECP256K1.h"
+
+using namespace core;
+
+#define EGS_SECP256K1 MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_SECP256K1 MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace SECP256K1 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_SM2.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_SM2.h
new file mode 100644
index 0000000..c292cc5
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_SM2.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_SM2_H
+#define EDDSA_SM2_H
+
+#include "ecp_SM2.h"
+
+using namespace core;
+
+#define EGS_SM2 MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_SM2 MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace SM2 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_TWEEDLEDEE.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_TWEEDLEDEE.h
new file mode 100644
index 0000000..21685e3
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_TWEEDLEDEE.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_TWEEDLEDEE_H
+#define EDDSA_TWEEDLEDEE_H
+
+#include "ecp_TWEEDLEDEE.h"
+
+using namespace core;
+
+#define EGS_TWEEDLEDEE MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_TWEEDLEDEE MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace TWEEDLEDEE {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_TWEEDLEDUM.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_TWEEDLEDUM.h
new file mode 100644
index 0000000..8eb3b4d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_TWEEDLEDUM.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_TWEEDLEDUM_H
+#define EDDSA_TWEEDLEDUM_H
+
+#include "ecp_TWEEDLEDUM.h"
+
+using namespace core;
+
+#define EGS_TWEEDLEDUM MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_TWEEDLEDUM MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace TWEEDLEDUM {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_X448.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_X448.h
new file mode 100644
index 0000000..7251cd8
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/eddsa_X448.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_X448_H
+#define EDDSA_X448_H
+
+#include "ecp_X448.h"
+
+using namespace core;
+
+#define EGS_X448 MODBYTES_B448_58  /**< ECC Group Size in bytes */
+#define EFS_X448 MODBYTES_B448_58  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace X448 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ff.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ff.cpp
new file mode 100644
index 0000000..df30ac2
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ff.cpp
@@ -0,0 +1,1039 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* CORE basic functions for Large Finite Field support */
+
+#include "ff_WWW.h"
+
+using namespace XXX;
+
+namespace WWW {
+static void FF_dsucopy(BIG x[], BIG y[], int);
+static void FF_dscopy(BIG x[], BIG y[], int);
+static void FF_sducopy(BIG x[], BIG y[], int);
+static void FF_shrw(BIG a[], int);
+static void FF_shlw(BIG a[], int);
+static void FF_radd(BIG z[], int, BIG x[], int, BIG y[], int, int);
+static void FF_rinc(BIG z[], int, BIG y[], int, int);
+static void FF_rdec(BIG z[], int, BIG y[], int, int);
+static void FF_rnorm(BIG z[], int, int);
+static void FF_cswap(BIG a[], BIG b[], int, int);
+static void FF_karmul(BIG z[], int, BIG x[], int, BIG y[], int, BIG t[], int, int);
+static void FF_karsqr(BIG z[], int, BIG x[], int, BIG t[], int, int);
+static void FF_karmul_lower(BIG z[], int, BIG x[], int, BIG y[], int, BIG t[], int, int);
+static void FF_karmul_upper(BIG z[], BIG x[], BIG y[], BIG t[], int);
+static void FF_lmul(BIG z[], BIG x[], BIG y[], int);
+static void FF_reduce(BIG r[], BIG T[], BIG N[], BIG ND[], int);
+static void FF_nres(BIG a[], BIG m[], int);
+static void FF_redc(BIG a[], BIG m[], BIG ND[], int);
+static void FF_invmod2m(BIG U[], BIG a[], int);
+static void FF_modmul(BIG z[], BIG x[], BIG y[], BIG p[], BIG ND[], int);
+static void FF_modsqr(BIG z[], BIG x[], BIG p[], BIG ND[], int);
+}
+
+/* x=y */
+void WWW::FF_copy(BIG x[], BIG y[], int n)
+{
+    int i;
+    for (i = 0; i < n; i++)
+        BIG_copy(x[i], y[i]);
+}
+
+/* x=y<<n */
+static void WWW::FF_dsucopy(BIG x[], BIG y[], int n)
+{
+    int i;
+    for (i = 0; i < n; i++)
+    {
+        BIG_copy(x[n + i], y[i]);
+        BIG_zero(x[i]);
+    }
+}
+
+/* x=y */
+static void WWW::FF_dscopy(BIG x[], BIG y[], int n)
+{
+    int i;
+    for (i = 0; i < n; i++)
+    {
+        BIG_copy(x[i], y[i]);
+        BIG_zero(x[n + i]);
+    }
+}
+
+/* x=y>>n */
+static void WWW::FF_sducopy(BIG x[], BIG y[], int n)
+{
+    int i;
+    for (i = 0; i < n; i++)
+        BIG_copy(x[i], y[n + i]);
+}
+
+/* set to zero */
+void WWW::FF_zero(BIG x[], int n)
+{
+    int i;
+    for (i = 0; i < n; i++)
+        BIG_zero(x[i]);
+}
+
+/* test equals 0 */
+int WWW::FF_iszilch(BIG x[], int n)
+{
+    int i;
+    for (i = 0; i < n; i++)
+        if (!BIG_iszilch(x[i])) return 0;
+    return 1;
+}
+
+/* shift right by BIGBITS_XXX-bit words */
+static void WWW::FF_shrw(BIG a[], int n)
+{
+    int i;
+    for (i = 0; i < n; i++)
+    {
+        BIG_copy(a[i], a[i + n]);
+        BIG_zero(a[i + n]);
+    }
+}
+
+/* shift left by BIGBITS_XXX-bit words */
+static void WWW::FF_shlw(BIG a[], int n)
+{
+    int i;
+    for (i = 0; i < n; i++)
+    {
+        BIG_copy(a[i + n], a[i]);
+        BIG_zero(a[i]);
+    }
+}
+
+/* extract last bit */
+int WWW::FF_parity(BIG x[])
+{
+    return BIG_parity(x[0]);
+}
+
+/* extract last m bits */
+int WWW::FF_lastbits(BIG x[], int m)
+{
+    return BIG_lastbits(x[0], m);
+}
+
+/* x=1 */
+void WWW::FF_one(BIG x[], int n)
+{
+    int i;
+    BIG_one(x[0]);
+    for (i = 1; i < n; i++)
+        BIG_zero(x[i]);
+}
+
+/* x=m, where m is 32-bit int */
+void WWW::FF_init(BIG x[], sign32 m, int n)
+{
+    int i;
+    BIG_zero(x[0]);
+#if CHUNK<64
+    x[0][0] = (chunk)(m & BMASK_XXX);
+    x[0][1] = (chunk)(m >> BASEBITS_XXX);
+#else
+    x[0][0] = (chunk)m;
+#endif
+    for (i = 1; i < n; i++)
+        BIG_zero(x[i]);
+}
+
+/* compare x and y - must be normalised */
+int WWW::FF_comp(BIG x[], BIG y[], int n)
+{
+    int i, j;
+    for (i = n - 1; i >= 0; i--)
+    {
+        j = BIG_comp(x[i], y[i]);
+        if (j != 0) return j;
+    }
+    return 0;
+}
+
+/* recursive add */
+static void WWW::FF_radd(BIG z[], int zp, BIG x[], int xp, BIG y[], int yp, int n)
+{
+    int i;
+    for (i = 0; i < n; i++)
+        BIG_add(z[zp + i], x[xp + i], y[yp + i]);
+}
+
+/* recursive inc */
+static void WWW::FF_rinc(BIG z[], int zp, BIG y[], int yp, int n)
+{
+    int i;
+    for (i = 0; i < n; i++)
+        BIG_add(z[zp + i], z[zp + i], y[yp + i]);
+}
+
+/* recursive dec */
+static void WWW::FF_rdec(BIG z[], int zp, BIG y[], int yp, int n)
+{
+    int i;
+    for (i = 0; i < n; i++)
+        BIG_sub(z[zp + i], z[zp + i], y[yp + i]);
+}
+
+/* simple add */
+void WWW::FF_add(BIG z[], BIG x[], BIG y[], int n)
+{
+    int i;
+    for (i = 0; i < n; i++)
+        BIG_add(z[i], x[i], y[i]);
+}
+
+/* simple sub */
+void WWW::FF_sub(BIG z[], BIG x[], BIG y[], int n)
+{
+    int i;
+    for (i = 0; i < n; i++)
+        BIG_sub(z[i], x[i], y[i]);
+}
+
+/* increment/decrement by a small integer */
+void WWW::FF_inc(BIG x[], int m, int n)
+{
+    BIG_inc(x[0], m);
+    FF_norm(x, n);
+}
+
+void WWW::FF_dec(BIG x[], int m, int n)
+{
+    BIG_dec(x[0], m);
+    FF_norm(x, n);
+}
+
+/* normalise - but hold any overflow in top part unless n<0 */
+static void WWW::FF_rnorm(BIG z[], int zp, int n)
+{
+    int i, trunc = 0;
+    chunk carry;
+    if (n < 0)
+    {
+        /* -v n signals to do truncation */
+        n = -n;
+        trunc = 1;
+    }
+    for (i = 0; i < n - 1; i++)
+    {
+        carry = BIG_norm(z[zp + i]);
+
+        z[zp + i][NLEN_XXX - 1] ^= carry << P_TBITS_WWW; /* remove it */
+        z[zp + i + 1][0] += carry;
+    }
+    carry = BIG_norm(z[zp + n - 1]);
+    if (trunc) z[zp + n - 1][NLEN_XXX - 1] ^= carry << P_TBITS_WWW;
+}
+
+void WWW::FF_norm(BIG z[], int n)
+{
+    FF_rnorm(z, 0, n);
+}
+
+/* shift left by one bit */
+void WWW::FF_shl(BIG x[], int n)
+{
+    int i;
+    int carry, delay_carry = 0;
+    for (i = 0; i < n - 1; i++)
+    {
+        carry = BIG_fshl(x[i], 1);
+        x[i][0] |= delay_carry;
+        x[i][NLEN_XXX - 1] ^= (chunk)carry << P_TBITS_WWW;
+        delay_carry = carry;
+    }
+    BIG_fshl(x[n - 1], 1);
+    x[n - 1][0] |= delay_carry;
+}
+
+/* shift right by one bit */
+void WWW::FF_shr(BIG x[], int n)
+{
+    int i;
+    int carry;
+    for (i = n - 1; i > 0; i--)
+    {
+        carry = BIG_fshr(x[i], 1);
+        x[i - 1][NLEN_XXX - 1] |= (chunk)carry << P_TBITS_WWW;
+    }
+    BIG_fshr(x[0], 1);
+}
+
+void WWW::FF_output(BIG x[], int n)
+{
+    int i;
+    FF_norm(x, n);
+    for (i = n - 1; i >= 0; i--)
+    {
+        BIG_output(x[i]);
+        printf(" ");
+    }
+}
+
+void WWW::FF_rawoutput(BIG x[], int n)
+{
+    int i;
+    for (i = n - 1; i >= 0; i--)
+    {
+        BIG_rawoutput(x[i]);
+        printf(" ");
+    }
+}
+
+/* Convert FFs to/from octet strings */
+void WWW::FF_toOctet(octet *w, BIG x[], int n)
+{
+    int i;
+    w->len = n * MODBYTES_XXX;
+    for (i = 0; i < n; i++)
+    {
+        BIG_toBytes(&(w->val[(n - i - 1)*MODBYTES_XXX]), x[i]);
+    }
+}
+
+void WWW::FF_fromOctet(BIG x[], octet *w, int n)
+{
+    int i;
+    for (i = 0; i < n; i++)
+    {
+        BIG_fromBytes(x[i], &(w->val[(n - i - 1)*MODBYTES_XXX]));
+    }
+}
+
+/* in-place swapping using xor - side channel resistant */
+static void WWW::FF_cswap(BIG a[], BIG b[], int d, int n)
+{
+    int i;
+    for (i = 0; i < n; i++)
+        BIG_cswap(a[i], b[i], d);
+    return;
+}
+
+/* z=x*y, t is workspace */
+static void WWW::FF_karmul(BIG z[], int zp, BIG x[], int xp, BIG y[], int yp, BIG t[], int tp, int n)
+{
+    int nd2;
+    if (n == 1)
+    {
+        BIG_norm(x[xp]);
+        BIG_norm(y[yp]);
+        BIG_mul(t[tp], x[xp], y[yp]);
+        BIG_split(z[zp + 1], z[zp], t[tp], BIGBITS_XXX);
+        return;
+    }
+
+    nd2 = n / 2;
+    FF_radd(z, zp, x, xp, x, xp + nd2, nd2);
+    FF_rnorm(z, zp, nd2); /* needs this if recursion level too deep */
+
+    FF_radd(z, zp + nd2, y, yp, y, yp + nd2, nd2);
+    FF_rnorm(z, zp + nd2, nd2);
+    FF_karmul(t, tp, z, zp, z, zp + nd2, t, tp + n, nd2);
+    FF_karmul(z, zp, x, xp, y, yp, t, tp + n, nd2);
+    FF_karmul(z, zp + n, x, xp + nd2, y, yp + nd2, t, tp + n, nd2);
+    FF_rdec(t, tp, z, zp, n);
+    FF_rdec(t, tp, z, zp + n, n);
+    FF_rinc(z, zp + nd2, t, tp, n);
+    FF_rnorm(z, zp, 2 * n);
+}
+
+static void WWW::FF_karsqr(BIG z[], int zp, BIG x[], int xp, BIG t[], int tp, int n)
+{
+    int nd2;
+    if (n == 1)
+    {
+        BIG_norm(x[xp]);
+        BIG_sqr(t[tp], x[xp]);
+        BIG_split(z[zp + 1], z[zp], t[tp], BIGBITS_XXX);
+        return;
+    }
+    nd2 = n / 2;
+    FF_karsqr(z, zp, x, xp, t, tp + n, nd2);
+    FF_karsqr(z, zp + n, x, xp + nd2, t, tp + n, nd2);
+    FF_karmul(t, tp, x, xp, x, xp + nd2, t, tp + n, nd2);
+    FF_rinc(z, zp + nd2, t, tp, n);
+    FF_rinc(z, zp + nd2, t, tp, n);
+
+    FF_rnorm(z, zp + nd2, n); /* was FF_rnorm(z,zp,2*n)  */
+}
+
+static void WWW::FF_karmul_lower(BIG z[], int zp, BIG x[], int xp, BIG y[], int yp, BIG t[], int tp, int n)
+{
+    /* Calculates Least Significant bottom half of x*y */
+    int nd2;
+    if (n == 1)
+    {
+        /* only calculate bottom half of product */
+        BIG_norm(x[xp]);
+        BIG_norm(y[yp]);
+        BIG_smul(z[zp], x[xp], y[yp]);
+        return;
+    }
+    nd2 = n / 2;
+    FF_karmul(z, zp, x, xp, y, yp, t, tp + n, nd2);
+    FF_karmul_lower(t, tp, x, xp + nd2, y, yp, t, tp + n, nd2);
+    FF_rinc(z, zp + nd2, t, tp, nd2);
+    FF_karmul_lower(t, tp, x, xp, y, yp + nd2, t, tp + n, nd2);
+    FF_rinc(z, zp + nd2, t, tp, nd2);
+    FF_rnorm(z, zp + nd2, -nd2); /* truncate it */
+}
+
+static void WWW::FF_karmul_upper(BIG z[], BIG x[], BIG y[], BIG t[], int n)
+{
+    /* Calculates Most Significant upper half of x*y, given lower part */
+    int nd2;
+
+    nd2 = n / 2;
+    FF_radd(z, n, x, 0, x, nd2, nd2);
+    FF_radd(z, n + nd2, y, 0, y, nd2, nd2);
+    FF_rnorm(z, n, nd2);
+    FF_rnorm(z, n + nd2, nd2);
+
+    FF_karmul(t, 0, z, n + nd2, z, n, t, n, nd2); /* t = (a0+a1)(b0+b1) */
+    FF_karmul(z, n, x, nd2, y, nd2, t, n, nd2); /* z[n]= a1*b1 */
+    /* z[0-nd2]=l(a0b0) z[nd2-n]= h(a0b0)+l(t)-l(a0b0)-l(a1b1) */
+    FF_rdec(t, 0, z, n, n);          /* t=t-a1b1  */
+    FF_rinc(z, nd2, z, 0, nd2); /* z[nd2-n]+=l(a0b0) = h(a0b0)+l(t)-l(a1b1)  */
+    FF_rdec(z, nd2, t, 0, nd2); /* z[nd2-n]=h(a0b0)+l(t)-l(a1b1)-l(t-a1b1)=h(a0b0) */
+    FF_rnorm(z, 0, -n);                 /* a0b0 now in z - truncate it */
+    FF_rdec(t, 0, z, 0, n);     /* (a0+a1)(b0+b1) - a0b0 */
+    FF_rinc(z, nd2, t, 0, n);
+
+    FF_rnorm(z, nd2, n);
+}
+
+/* z=x*y */
+void WWW::FF_mul(BIG z[], BIG x[], BIG y[], int n)
+{
+#ifndef USE_VLAS
+    BIG t[2 * FFLEN_WWW];
+#else
+    BIG t[2 * n];
+#endif
+    FF_karmul(z, 0, x, 0, y, 0, t, 0, n);
+}
+
+/* return low part of product */
+static void WWW::FF_lmul(BIG z[], BIG x[], BIG y[], int n)
+{
+#ifndef USE_VLAS
+    BIG t[2 * FFLEN_WWW];
+#else
+    BIG t[2 * n];
+#endif
+    FF_karmul_lower(z, 0, x, 0, y, 0, t, 0, n);
+}
+
+/* Set b=b mod c */
+void WWW::FF_mod(BIG b[], BIG c[], int n)
+{
+    int k = 0;
+
+    FF_norm(b, n);
+    if (FF_comp(b, c, n) < 0)
+        return;
+    do
+    {
+        FF_shl(c, n);
+        k++;
+    }
+    while (FF_comp(b, c, n) >= 0);
+
+    while (k > 0)
+    {
+        FF_shr(c, n);
+        if (FF_comp(b, c, n) >= 0)
+        {
+            FF_sub(b, b, c, n);
+            FF_norm(b, n);
+        }
+        k--;
+    }
+}
+
+/* z=x^2 */
+void WWW::FF_sqr(BIG z[], BIG x[], int n)
+{
+#ifndef USE_VLAS
+    BIG t[2 * FFLEN_WWW];
+#else
+    BIG t[2 * n];
+#endif
+    FF_karsqr(z, 0, x, 0, t, 0, n);
+}
+
+/* r=t mod modulus, N is modulus, ND is Montgomery Constant */
+static void WWW::FF_reduce(BIG r[], BIG T[], BIG N[], BIG ND[], int n)
+{
+    /* fast karatsuba Montgomery reduction */
+#ifndef USE_VLAS
+    BIG t[2 * FFLEN_WWW];
+    BIG m[FFLEN_WWW];
+#else
+    BIG t[2 * n];
+    BIG m[n];
+#endif
+    WWW::FF_sducopy(r, T, n); /* keep top half of T */
+    FF_karmul_lower(m, 0, T, 0, ND, 0, t, 0, n); /* m=T.(1/N) mod R */
+
+    FF_karmul_upper(T, N, m, t, n); /* T=mN */
+    FF_sducopy(m, T, n);
+
+    FF_add(r, r, N, n);
+    FF_sub(r, r, m, n);
+    FF_norm(r, n);
+}
+
+
+/* Set r=a mod b */
+/* a is of length - 2*n */
+/* r,b is of length - n */
+void WWW::FF_dmod(BIG r[], BIG a[], BIG b[], int n)
+{
+    int k;
+#ifndef USE_VLAS
+    BIG m[2 * FFLEN_WWW];
+    BIG x[2 * FFLEN_WWW];
+#else
+    BIG m[2 * n];
+    BIG x[2 * n];
+#endif
+    FF_copy(x, a, 2 * n);
+    FF_norm(x, 2 * n);
+    FF_dsucopy(m, b, n);
+    k = BIGBITS_XXX * n;
+
+    while (FF_comp(x, m, 2 * n) >= 0)
+    {
+        FF_sub(x, x, m, 2 * n);
+        FF_norm(x, 2 * n);
+    }
+
+    while (k > 0)
+    {
+        FF_shr(m, 2 * n);
+
+        if (FF_comp(x, m, 2 * n) >= 0)
+        {
+            FF_sub(x, x, m, 2 * n);
+            FF_norm(x, 2 * n);
+        }
+
+        k--;
+    }
+    FF_copy(r, x, n);
+    FF_mod(r, b, n);
+}
+
+/* Set r=1/a mod p. Binary method - a<p on entry */
+
+void WWW::FF_invmodp(BIG r[], BIG a[], BIG p[], int n)
+{
+#ifndef USE_VLAS
+    BIG u[FFLEN_WWW], v[FFLEN_WWW], x1[FFLEN_WWW], x2[FFLEN_WWW], t[FFLEN_WWW], one[FFLEN_WWW];
+#else
+    BIG u[n], v[n], x1[n], x2[n], t[n], one[n];
+#endif
+    FF_copy(u, a, n);
+    FF_copy(v, p, n);
+    FF_one(one, n);
+    FF_copy(x1, one, n);
+    FF_zero(x2, n);
+
+// reduce n in here as well!
+    while (FF_comp(u, one, n) != 0 && FF_comp(v, one, n) != 0)
+    {
+        while (FF_parity(u) == 0)
+        {
+            FF_shr(u, n);
+            if (FF_parity(x1) != 0)
+            {
+                FF_add(x1, p, x1, n);
+                FF_norm(x1, n);
+            }
+            FF_shr(x1, n);
+        }
+        while (FF_parity(v) == 0)
+        {
+            FF_shr(v, n);
+            if (FF_parity(x2) != 0)
+            {
+                FF_add(x2, p, x2, n);
+                FF_norm(x2, n);
+            }
+            FF_shr(x2, n);
+        }
+        if (FF_comp(u, v, n) >= 0)
+        {
+
+            FF_sub(u, u, v, n);
+            FF_norm(u, n);
+            if (FF_comp(x1, x2, n) >= 0) FF_sub(x1, x1, x2, n);
+            else
+            {
+                FF_sub(t, p, x2, n);
+                FF_add(x1, x1, t, n);
+            }
+            FF_norm(x1, n);
+        }
+        else
+        {
+            FF_sub(v, v, u, n);
+            FF_norm(v, n);
+            if (FF_comp(x2, x1, n) >= 0) FF_sub(x2, x2, x1, n);
+            else
+            {
+                FF_sub(t, p, x1, n);
+                FF_add(x2, x2, t, n);
+            }
+            FF_norm(x2, n);
+        }
+    }
+    if (FF_comp(u, one, n) == 0)
+        FF_copy(r, x1, n);
+    else
+        FF_copy(r, x2, n);
+}
+
+/* nesidue mod m */
+static void WWW::FF_nres(BIG a[], BIG m[], int n)
+{
+#ifndef USE_VLAS
+    BIG d[2 * FFLEN_WWW];
+#else
+    BIG d[2 * n];
+#endif
+    if (n == 1)
+    {
+        BIG_dscopy(d[0], a[0]);
+        BIG_dshl(d[0], NLEN_XXX * BASEBITS_XXX);
+        BIG_dmod(a[0], d[0], m[0]);
+    }
+    else
+    {
+        FF_dsucopy(d, a, n);
+        FF_dmod(a, d, m, n);
+    }
+}
+
+static void WWW::FF_redc(BIG a[], BIG m[], BIG ND[], int n)
+{
+#ifndef USE_VLAS
+    BIG d[2 * FFLEN_WWW];
+#else
+    BIG d[2 * n];
+#endif
+    if (n == 1)
+    {
+        BIG_dzero(d[0]);
+        BIG_dscopy(d[0], a[0]);
+        BIG_monty(a[0], m[0], ((chunk)1 << BASEBITS_XXX) - ND[0][0], d[0]);
+    }
+    else
+    {
+        FF_mod(a, m, n);
+        FF_dscopy(d, a, n);
+        FF_reduce(a, d, m, ND, n);
+        FF_mod(a, m, n);
+    }
+}
+
+/* U=1/a mod 2^m - Arazi & Qi */
+static void WWW::FF_invmod2m(BIG U[], BIG a[], int n)
+{
+    int i;
+#ifndef USE_VLAS
+    BIG t1[2*FFLEN_WWW], b[FFLEN_WWW], c[FFLEN_WWW];
+#else
+    BIG t1[2 * n], b[n], c[n];
+#endif
+
+    FF_zero(U, n);
+    FF_zero(b, n);
+    FF_zero(c, n);
+    FF_zero(t1, 2 * n);
+
+    BIG_copy(U[0], a[0]);
+    BIG_invmod2m(U[0]);
+    for (i = 1; i < n; i <<= 1)
+    {
+        FF_copy(b, a, i);
+        FF_mul(t1, U, b, i);
+        FF_shrw(t1, i); // top half to bottom half, top half=0
+
+        FF_copy(c, a, 2 * i);
+        FF_shrw(c, i); // top half of c
+        FF_lmul(b, U, c, i); // should set top half of b=0
+        FF_add(t1, t1, b, i);
+        FF_norm(t1, 2 * i);
+        FF_lmul(b, t1, U, i);
+        FF_copy(t1, b, i);
+        FF_one(b, i);
+        FF_shlw(b, i);
+        FF_sub(t1, b, t1, 2 * i);
+        FF_norm(t1, 2 * i);
+        FF_shlw(t1, i);
+        FF_add(U, U, t1, 2 * i);
+    }
+
+    FF_norm(U, n);
+}
+
+void WWW::FF_random(BIG x[], csprng *rng, int n)
+{
+    int i;
+    for (i = 0; i < n; i++)
+    {
+        BIG_random(x[i], rng);
+    }
+    /* make sure top bit is 1 */
+    while (BIG_nbits(x[n - 1]) < MODBYTES_XXX * 8) BIG_random(x[n - 1], rng);
+}
+
+/* generate random x mod p */
+void WWW::FF_randomnum(BIG x[], BIG p[], csprng *rng, int n)
+{
+    int i;
+#ifndef USE_VLAS
+    BIG d[2 * FFLEN_WWW];
+#else
+    BIG d[2 * n];
+#endif
+    for (i = 0; i < 2 * n; i++)
+    {
+        BIG_random(d[i], rng);
+    }
+    FF_dmod(x, d, p, n);
+}
+
+static void WWW::FF_modmul(BIG z[], BIG x[], BIG y[], BIG p[], BIG ND[], int n)
+{
+#ifndef USE_VLAS
+    BIG d[2 * FFLEN_WWW];
+#else
+    BIG d[2 * n];
+#endif
+    chunk ex = P_EXCESS_WWW(x[n - 1]);
+    chunk ey = P_EXCESS_WWW(y[n - 1]);
+#ifdef dchunk
+    if ((dchunk)(ex + 1) * (ey + 1) > (dchunk)P_FEXCESS_WWW)
+#else
+    if ((ex + 1) > P_FEXCESS_WWW / (ey + 1))
+#endif
+    {
+#ifdef DEBUG_REDUCE
+        printf("Product too large - reducing it %d %d\n", ex, ey);
+#endif
+        FF_mod(x, p, n);
+    }
+
+    if (n == 1)
+    {
+        BIG_mul(d[0], x[0], y[0]);
+        BIG_monty(z[0], p[0], ((chunk)1 << BASEBITS_XXX) - ND[0][0], d[0]);
+    }
+    else
+    {
+        FF_mul(d, x, y, n);
+        FF_reduce(z, d, p, ND, n);
+    }
+}
+
+static void WWW::FF_modsqr(BIG z[], BIG x[], BIG p[], BIG ND[], int n)
+{
+#ifndef USE_VLAS
+    BIG d[2 * FFLEN_WWW];
+#else
+    BIG d[2 * n];
+#endif
+    chunk ex = P_EXCESS_WWW(x[n - 1]);
+#ifdef dchunk
+    if ((dchunk)(ex + 1) * (ex + 1) > (dchunk)P_FEXCESS_WWW)
+#else
+    if ((ex + 1) > P_FEXCESS_WWW / (ex + 1))
+#endif
+    {
+#ifdef DEBUG_REDUCE
+        printf("Product too large - reducing it %d\n", ex);
+#endif
+        FF_mod(x, p, n);
+    }
+    if (n == 1)
+    {
+        BIG_sqr(d[0], x[0]);
+        BIG_monty(z[0], p[0], ((chunk)1 << BASEBITS_XXX) - ND[0][0], d[0]);
+    }
+    else
+    {
+        FF_sqr(d, x, n);
+        FF_reduce(z, d, p, ND, n);
+    }
+}
+
+/* r=x^e mod p using side-channel resistant Montgomery Ladder, for large e */
+void WWW::FF_skpow(BIG r[], BIG x[], BIG e[], BIG p[], int n)
+{
+    int i, b;
+#ifndef USE_VLAS
+    BIG R0[FFLEN_WWW], R1[FFLEN_WWW], ND[FFLEN_WWW];
+#else
+    BIG R0[n], R1[n], ND[n];
+#endif
+    FF_invmod2m(ND, p, n);
+
+    FF_one(R0, n);
+    FF_copy(R1, x, n);
+    FF_nres(R0, p, n);
+    FF_nres(R1, p, n);
+
+    for (i = 8 * MODBYTES_XXX * n - 1; i >= 0; i--)
+    {
+        b = BIG_bit(e[i / BIGBITS_XXX], i % BIGBITS_XXX);
+        FF_modmul(r, R0, R1, p, ND, n);
+
+        FF_cswap(R0, R1, b, n);
+        FF_modsqr(R0, R0, p, ND, n);
+
+        FF_copy(R1, r, n);
+        FF_cswap(R0, R1, b, n);
+    }
+    FF_copy(r, R0, n);
+    FF_redc(r, p, ND, n);
+}
+
+/* r=x^e mod p using side-channel resistant Montgomery Ladder, for short e */
+void WWW::FF_skspow(BIG r[], BIG x[], BIG e, BIG p[], int n)
+{
+    int i, b;
+#ifndef USE_VLAS
+    BIG R0[FFLEN_WWW], R1[FFLEN_WWW], ND[FFLEN_WWW];
+#else
+    BIG R0[n], R1[n], ND[n];
+#endif
+    FF_invmod2m(ND, p, n);
+    FF_one(R0, n);
+    FF_copy(R1, x, n);
+    FF_nres(R0, p, n);
+    FF_nres(R1, p, n);
+    for (i = 8 * MODBYTES_XXX - 1; i >= 0; i--)
+    {
+        b = BIG_bit(e, i);
+        FF_modmul(r, R0, R1, p, ND, n);
+        FF_cswap(R0, R1, b, n);
+        FF_modsqr(R0, R0, p, ND, n);
+        FF_copy(R1, r, n);
+        FF_cswap(R0, R1, b, n);
+    }
+    FF_copy(r, R0, n);
+    FF_redc(r, p, ND, n);
+}
+
+/* raise to an integer power - right-to-left method */
+void WWW::FF_power(BIG r[], BIG x[], int e, BIG p[], int n)
+{
+    int f = 1;
+#ifndef USE_VLAS
+    BIG w[FFLEN_WWW], ND[FFLEN_WWW];
+#else
+    BIG w[n], ND[n];
+#endif
+    FF_invmod2m(ND, p, n);
+
+    FF_copy(w, x, n);
+    FF_nres(w, p, n);
+
+    if (e == 2)
+    {
+        FF_modsqr(r, w, p, ND, n);
+    }
+    else for (;;)
+        {
+            if (e % 2 == 1)
+            {
+                if (f) FF_copy(r, w, n);
+                else FF_modmul(r, r, w, p, ND, n);
+                f = 0;
+            }
+            e >>= 1;
+            if (e == 0) break;
+            FF_modsqr(w, w, p, ND, n);
+        }
+
+    FF_redc(r, p, ND, n);
+}
+
+/* r=x^e mod p, faster but not side channel resistant */
+void WWW::FF_pow(BIG r[], BIG x[], BIG e[], BIG p[], int n)
+{
+    int i, b;
+#ifndef USE_VLAS
+    BIG w[FFLEN_WWW], ND[FFLEN_WWW];
+#else
+    BIG w[n], ND[n];
+#endif
+    FF_invmod2m(ND, p, n);
+
+    FF_copy(w, x, n);
+    FF_one(r, n);
+    FF_nres(r, p, n);
+    FF_nres(w, p, n);
+
+    for (i = 8 * MODBYTES_XXX * n - 1; i >= 0; i--)
+    {
+        FF_modsqr(r, r, p, ND, n);
+        b = BIG_bit(e[i / BIGBITS_XXX], i % BIGBITS_XXX);
+        if (b == 1) FF_modmul(r, r, w, p, ND, n);
+    }
+    FF_redc(r, p, ND, n);
+}
+
+/* double exponentiation r=x^e.y^f mod p */
+void WWW::FF_pow2(BIG r[], BIG x[], BIG e, BIG y[], BIG f, BIG p[], int n)
+{
+    int i, eb, fb;
+#ifndef USE_VLAS
+    BIG xn[FFLEN_WWW], yn[FFLEN_WWW], xy[FFLEN_WWW], ND[FFLEN_WWW];
+#else
+    BIG xn[n], yn[n], xy[n], ND[n];
+#endif
+
+    FF_invmod2m(ND, p, n);
+
+    FF_copy(xn, x, n);
+    FF_copy(yn, y, n);
+    FF_nres(xn, p, n);
+    FF_nres(yn, p, n);
+    FF_modmul(xy, xn, yn, p, ND, n);
+    FF_one(r, n);
+    FF_nres(r, p, n);
+
+    for (i = 8 * MODBYTES_XXX - 1; i >= 0; i--)
+    {
+        eb = BIG_bit(e, i);
+        fb = BIG_bit(f, i);
+        FF_modsqr(r, r, p, ND, n);
+        if (eb == 1)
+        {
+            if (fb == 1) FF_modmul(r, r, xy, p, ND, n);
+            else FF_modmul(r, r, xn, p, ND, n);
+        }
+        else
+        {
+            if (fb == 1) FF_modmul(r, r, yn, p, ND, n);
+        }
+    }
+    FF_redc(r, p, ND, n);
+}
+
+static sign32 igcd(sign32 x, sign32 y)
+{
+    /* integer GCD, returns GCD of x and y */
+    sign32 r;
+    if (y == 0) return x;
+    while ((r = x % y) != 0)
+        x = y, y = r;
+    return y;
+}
+
+/* quick and dirty check for common factor with s */
+int WWW::FF_cfactor(BIG w[], sign32 s, int n)
+{
+    int r;
+    sign32 g;
+#ifndef USE_VLAS
+    BIG x[FFLEN_WWW], y[FFLEN_WWW];
+#else
+    BIG x[n], y[n];
+#endif
+    FF_init(y, s, n);
+    FF_copy(x, w, n);
+    FF_norm(x, n);
+
+    do
+    {
+        FF_sub(x, x, y, n);
+        FF_norm(x, n);
+        while (!FF_iszilch(x, n) && FF_parity(x) == 0) FF_shr(x, n);
+    }
+    while (FF_comp(x, y, n) > 0);
+#if CHUNK<32
+    g = x[0][0] + ((sign32)(x[0][1]) << BASEBITS_XXX);
+#else
+    g = (sign32)x[0][0];
+#endif
+    r = igcd(s, g);
+    if (r > 1) return 1;
+    return 0;
+}
+
+/* Miller-Rabin test for primality. Slow. */
+int WWW::FF_prime(BIG p[], csprng *rng, int n)
+{
+    int i, j, loop, s = 0;
+#ifndef USE_VLAS
+    BIG d[FFLEN_WWW], x[FFLEN_WWW], unity[FFLEN_WWW], nm1[FFLEN_WWW];
+#else
+    BIG d[n], x[n], unity[n], nm1[n];
+#endif
+    sign32 sf = 4849845; /* 3*5*.. *19 */
+
+    FF_norm(p, n);
+
+    if (FF_cfactor(p, sf, n)) return 0;
+
+    FF_one(unity, n);
+    FF_sub(nm1, p, unity, n);
+    FF_norm(nm1, n);
+    FF_copy(d, nm1, n);
+    while (FF_parity(d) == 0)
+    {
+        FF_shr(d, n);
+        s++;
+    }
+    if (s == 0) return 0;
+
+    for (i = 0; i < 10; i++)
+    {
+        FF_randomnum(x, p, rng, n);
+        FF_pow(x, x, d, p, n);
+        if (FF_comp(x, unity, n) == 0 || FF_comp(x, nm1, n) == 0) continue;
+        loop = 0;
+        for (j = 1; j < s; j++)
+        {
+            FF_power(x, x, 2, p, n);
+            if (FF_comp(x, unity, n) == 0) return 0;
+            if (FF_comp(x, nm1, n) == 0 )
+            {
+                loop = 1;
+                break;
+            }
+        }
+        if (loop) continue;
+        return 0;
+    }
+
+    return 1;
+}
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ff.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ff.h
new file mode 100644
index 0000000..8220fa0
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ff.h
@@ -0,0 +1,295 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FF_WWW_H
+#define FF_WWW_H
+
+#include "big_XXX.h"
+#include "config_ff_WWW.h"
+
+using namespace core;
+
+#define HFLEN_WWW (FFLEN_WWW/2) /**< Useful for half-size RSA private key operations */
+#define P_MBITS_WWW (MODBYTES_XXX*8)
+#define P_TBITS_WWW (P_MBITS_WWW%BASEBITS_XXX)
+#define P_EXCESS_WWW(a) (((a[NLEN_XXX-1])>>(P_TBITS_WWW))+1)
+#define P_FEXCESS_WWW ((chunk)1<<(BASEBITS_XXX*NLEN_XXX-P_MBITS_WWW-1))
+
+
+namespace WWW {
+
+/* Finite Field Prototypes */
+/**	@brief Copy one FF element of given length to another
+ *
+	@param x FF instance to be copied to, on exit = y
+	@param y FF instance to be copied from
+	@param n size of FF in BIGs
+
+ */
+extern void FF_copy(XXX::BIG *x, XXX::BIG *y, int n);
+/**	@brief Initialize an FF element of given length from a 32-bit integer m
+ *
+	@param x FF instance to be copied to, on exit = m
+	@param m integer
+	@param n size of FF in BIGs
+ */
+extern void FF_init(XXX::BIG *x, sign32 m, int n);
+/**	@brief Set FF element of given size to zero
+ *
+	@param x FF instance to be set to zero
+	@param n size of FF in BIGs
+ */
+extern void FF_zero(XXX::BIG *x, int n);
+/**	@brief Tests for FF element equal to zero
+ *
+	@param x FF number to be tested
+	@param n size of FF in BIGs
+	@return 1 if zero, else returns 0
+ */
+extern int FF_iszilch(XXX::BIG *x, int n);
+/**	@brief  return parity of an FF, that is the least significant bit
+ *
+	@param x FF number
+	@return 0 or 1
+ */
+extern int FF_parity(XXX::BIG *x);
+/**	@brief  return least significant m bits of an FF
+ *
+	@param x FF number
+	@param m number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int FF_lastbits(XXX::BIG *x, int m);
+/**	@brief Set FF element of given size to unity
+ *
+	@param x FF instance to be set to unity
+	@param n size of FF in BIGs
+ */
+extern void FF_one(XXX::BIG *x, int n);
+/**	@brief Compares two FF numbers. Inputs must be normalised externally
+ *
+	@param x first FF number to be compared
+	@param y second FF number to be compared
+	@param n size of FF in BIGs
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int FF_comp(XXX::BIG *x, XXX::BIG *y, int n);
+/**	@brief addition of two FFs
+ *
+	@param x FF instance, on exit = y+z
+	@param y FF instance
+	@param z FF instance
+	@param n size of FF in BIGs
+ */
+extern void FF_add(XXX::BIG *x, XXX::BIG *y, XXX::BIG *z, int n);
+/**	@brief subtraction of two FFs
+ *
+	@param x FF instance, on exit = y-z
+	@param y FF instance
+	@param z FF instance
+	@param n size of FF in BIGs
+ */
+extern void FF_sub(XXX::BIG *x, XXX::BIG *y, XXX::BIG *z, int n);
+/**	@brief increment an FF by an integer,and normalise
+ *
+	@param x FF instance, on exit = x+m
+	@param m an integer to be added to x
+	@param n size of FF in BIGs
+ */
+extern void FF_inc(XXX::BIG *x, int m, int n);
+/**	@brief Decrement an FF by an integer,and normalise
+ *
+	@param x FF instance, on exit = x-m
+	@param m an integer to be subtracted from x
+	@param n size of FF in BIGs
+ */
+extern void FF_dec(XXX::BIG *x, int m, int n);
+/**	@brief Normalises the components of an FF
+ *
+	@param x FF instance to be normalised
+	@param n size of FF in BIGs
+ */
+extern void FF_norm(XXX::BIG *x, int n);
+/**	@brief Shift left an FF by 1 bit
+ *
+	@param x FF instance to be shifted left
+	@param n size of FF in BIGs
+ */
+extern void FF_shl(XXX::BIG *x, int n);
+/**	@brief Shift right an FF by 1 bit
+ *
+	@param x FF instance to be shifted right
+	@param n size of FF in BIGs
+ */
+extern void FF_shr(XXX::BIG *x, int n);
+/**	@brief Formats and outputs an FF to the console
+ *
+	@param x FF instance to be printed
+	@param n size of FF in BIGs
+ */
+extern void FF_output(XXX::BIG *x, int n);
+/**	@brief Formats and outputs an FF to the console, in raw form
+ *
+ 	@param x FF instance to be printed
+ 	@param n size of FF in BIGs
+ */
+extern void FF_rawoutput(XXX::BIG *x, int n);
+/**	@brief Formats and outputs an FF instance to an octet string
+ *
+	Converts an FF to big-endian base 256 form.
+	@param S output octet string
+	@param x FF instance to be converted to an octet string
+	@param n size of FF in BIGs
+ */
+extern void FF_toOctet(octet *S, XXX::BIG *x, int n);
+/**	@brief Populates an FF instance from an octet string
+ *
+	Creates FF from big-endian base 256 form.
+	@param x FF instance to be created from an octet string
+	@param S input octet string
+	@param n size of FF in BIGs
+ */
+extern void FF_fromOctet(XXX::BIG *x, octet *S, int n);
+/**	@brief Multiplication of two FFs
+ *
+	Uses Karatsuba method internally
+	@param x FF instance, on exit = y*z
+	@param y FF instance
+	@param z FF instance
+	@param n size of FF in BIGs
+ */
+extern void FF_mul(XXX::BIG *x, XXX::BIG *y, XXX::BIG *z, int n);
+/**	@brief Reduce FF mod a modulus
+ *
+	This is slow
+	@param x FF instance to be reduced mod m - on exit = x mod m
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_mod(XXX::BIG *x, XXX::BIG *m, int n);
+/**	@brief Square an FF
+ *
+	Uses Karatsuba method internally
+	@param x FF instance, on exit = y^2
+	@param y FF instance to be squared
+	@param n size of FF in BIGs
+ */
+extern void FF_sqr(XXX::BIG *x, XXX::BIG *y, int n);
+/**	@brief Reduces a double-length FF with respect to a given modulus
+ *
+	This is slow
+	@param x FF instance, on exit = y mod z
+	@param y FF instance, of double length 2*n
+	@param z FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_dmod(XXX::BIG *x, XXX::BIG *y, XXX::BIG *z, int n);
+/**	@brief Invert an FF mod a prime modulus
+ *
+	@param x FF instance, on exit = 1/y mod z
+	@param y FF instance
+	@param z FF prime modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_invmodp(XXX::BIG *x, XXX::BIG *y, XXX::BIG *z, int n);
+/**	@brief Create an FF from a random number generator
+ *
+	@param x FF instance, on exit x is a random number of length n BIGs with most significant bit a 1
+	@param R an instance of a Cryptographically Secure Random Number Generator
+	@param n size of FF in BIGs
+ */
+extern void FF_random(XXX::BIG *x, csprng *R, int n);
+/**	@brief Create a random FF less than a given modulus from a random number generator
+ *
+	@param x FF instance, on exit x is a random number < y
+	@param y FF instance, the modulus
+	@param R an instance of a Cryptographically Secure Random Number Generator
+	@param n size of FF in BIGs
+ */
+extern void FF_randomnum(XXX::BIG *x, XXX::BIG *y, csprng *R, int n);
+/**	@brief Calculate r=x^e mod m, side channel resistant
+ *
+	@param r FF instance, on exit = x^e mod p
+	@param x FF instance
+	@param e FF exponent
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_skpow(XXX::BIG *r, XXX::BIG *x, XXX::BIG * e, XXX::BIG *m, int n);
+/**	@brief Calculate r=x^e mod m, side channel resistant
+ *
+	For short BIG exponent
+	@param r FF instance, on exit = x^e mod p
+	@param x FF instance
+	@param e BIG exponent
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_skspow(XXX::BIG *r, XXX::BIG *x, XXX::BIG e, XXX::BIG *m, int n);
+/**	@brief Calculate r=x^e mod m
+ *
+	For very short integer exponent
+	@param r FF instance, on exit = x^e mod p
+	@param x FF instance
+	@param e integer exponent
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_power(XXX::BIG *r, XXX::BIG *x, int e, XXX::BIG *m, int n);
+/**	@brief Calculate r=x^e mod m
+ *
+	@param r FF instance, on exit = x^e mod p
+	@param x FF instance
+	@param e FF exponent
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_pow(XXX::BIG *r, XXX::BIG *x, XXX::BIG *e, XXX::BIG *m, int n);
+/**	@brief Test if an FF has factor in common with integer s
+ *
+	@param x FF instance to be tested
+	@param s the supplied integer
+	@param n size of FF in BIGs
+	@return 1 if gcd(x,s)!=1, else return 0
+ */
+extern int FF_cfactor(XXX::BIG *x, sign32 s, int n);
+/**	@brief Test if an FF is prime
+ *
+	Uses Miller-Rabin Method
+	@param x FF instance to be tested
+	@param R an instance of a Cryptographically Secure Random Number Generator
+	@param n size of FF in BIGs
+	@return 1 if x is (almost certainly) prime, else return 0
+ */
+extern int FF_prime(XXX::BIG *x, csprng *R, int n);
+/**	@brief Calculate r=x^e.y^f mod m
+ *
+	@param r FF instance, on exit = x^e.y^f mod p
+	@param x FF instance
+	@param e BIG exponent
+	@param y FF instance
+	@param f BIG exponent
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_pow2(XXX::BIG *r, XXX::BIG *x, XXX::BIG e, XXX::BIG *y, XXX::BIG f, XXX::BIG *m, int n);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ff_RSA2048.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ff_RSA2048.h
new file mode 100644
index 0000000..55adf04
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ff_RSA2048.h
@@ -0,0 +1,295 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FF_RSA2048_H
+#define FF_RSA2048_H
+
+#include "big_B512_60.h"
+#include "config_ff_RSA2048.h"
+
+using namespace core;
+
+#define HFLEN_RSA2048 (FFLEN_RSA2048/2) /**< Useful for half-size RSA private key operations */
+#define P_MBITS_RSA2048 (MODBYTES_B512_60*8)
+#define P_TBITS_RSA2048 (P_MBITS_RSA2048%BASEBITS_B512_60)
+#define P_EXCESS_RSA2048(a) (((a[NLEN_B512_60-1])>>(P_TBITS_RSA2048))+1)
+#define P_FEXCESS_RSA2048 ((chunk)1<<(BASEBITS_B512_60*NLEN_B512_60-P_MBITS_RSA2048-1))
+
+
+namespace RSA2048 {
+
+/* Finite Field Prototypes */
+/**	@brief Copy one FF element of given length to another
+ *
+	@param x FF instance to be copied to, on exit = y
+	@param y FF instance to be copied from
+	@param n size of FF in BIGs
+
+ */
+extern void FF_copy(B512_60::BIG *x, B512_60::BIG *y, int n);
+/**	@brief Initialize an FF element of given length from a 32-bit integer m
+ *
+	@param x FF instance to be copied to, on exit = m
+	@param m integer
+	@param n size of FF in BIGs
+ */
+extern void FF_init(B512_60::BIG *x, sign32 m, int n);
+/**	@brief Set FF element of given size to zero
+ *
+	@param x FF instance to be set to zero
+	@param n size of FF in BIGs
+ */
+extern void FF_zero(B512_60::BIG *x, int n);
+/**	@brief Tests for FF element equal to zero
+ *
+	@param x FF number to be tested
+	@param n size of FF in BIGs
+	@return 1 if zero, else returns 0
+ */
+extern int FF_iszilch(B512_60::BIG *x, int n);
+/**	@brief  return parity of an FF, that is the least significant bit
+ *
+	@param x FF number
+	@return 0 or 1
+ */
+extern int FF_parity(B512_60::BIG *x);
+/**	@brief  return least significant m bits of an FF
+ *
+	@param x FF number
+	@param m number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int FF_lastbits(B512_60::BIG *x, int m);
+/**	@brief Set FF element of given size to unity
+ *
+	@param x FF instance to be set to unity
+	@param n size of FF in BIGs
+ */
+extern void FF_one(B512_60::BIG *x, int n);
+/**	@brief Compares two FF numbers. Inputs must be normalised externally
+ *
+	@param x first FF number to be compared
+	@param y second FF number to be compared
+	@param n size of FF in BIGs
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int FF_comp(B512_60::BIG *x, B512_60::BIG *y, int n);
+/**	@brief addition of two FFs
+ *
+	@param x FF instance, on exit = y+z
+	@param y FF instance
+	@param z FF instance
+	@param n size of FF in BIGs
+ */
+extern void FF_add(B512_60::BIG *x, B512_60::BIG *y, B512_60::BIG *z, int n);
+/**	@brief subtraction of two FFs
+ *
+	@param x FF instance, on exit = y-z
+	@param y FF instance
+	@param z FF instance
+	@param n size of FF in BIGs
+ */
+extern void FF_sub(B512_60::BIG *x, B512_60::BIG *y, B512_60::BIG *z, int n);
+/**	@brief increment an FF by an integer,and normalise
+ *
+	@param x FF instance, on exit = x+m
+	@param m an integer to be added to x
+	@param n size of FF in BIGs
+ */
+extern void FF_inc(B512_60::BIG *x, int m, int n);
+/**	@brief Decrement an FF by an integer,and normalise
+ *
+	@param x FF instance, on exit = x-m
+	@param m an integer to be subtracted from x
+	@param n size of FF in BIGs
+ */
+extern void FF_dec(B512_60::BIG *x, int m, int n);
+/**	@brief Normalises the components of an FF
+ *
+	@param x FF instance to be normalised
+	@param n size of FF in BIGs
+ */
+extern void FF_norm(B512_60::BIG *x, int n);
+/**	@brief Shift left an FF by 1 bit
+ *
+	@param x FF instance to be shifted left
+	@param n size of FF in BIGs
+ */
+extern void FF_shl(B512_60::BIG *x, int n);
+/**	@brief Shift right an FF by 1 bit
+ *
+	@param x FF instance to be shifted right
+	@param n size of FF in BIGs
+ */
+extern void FF_shr(B512_60::BIG *x, int n);
+/**	@brief Formats and outputs an FF to the console
+ *
+	@param x FF instance to be printed
+	@param n size of FF in BIGs
+ */
+extern void FF_output(B512_60::BIG *x, int n);
+/**	@brief Formats and outputs an FF to the console, in raw form
+ *
+ 	@param x FF instance to be printed
+ 	@param n size of FF in BIGs
+ */
+extern void FF_rawoutput(B512_60::BIG *x, int n);
+/**	@brief Formats and outputs an FF instance to an octet string
+ *
+	Converts an FF to big-endian base 256 form.
+	@param S output octet string
+	@param x FF instance to be converted to an octet string
+	@param n size of FF in BIGs
+ */
+extern void FF_toOctet(octet *S, B512_60::BIG *x, int n);
+/**	@brief Populates an FF instance from an octet string
+ *
+	Creates FF from big-endian base 256 form.
+	@param x FF instance to be created from an octet string
+	@param S input octet string
+	@param n size of FF in BIGs
+ */
+extern void FF_fromOctet(B512_60::BIG *x, octet *S, int n);
+/**	@brief Multiplication of two FFs
+ *
+	Uses Karatsuba method internally
+	@param x FF instance, on exit = y*z
+	@param y FF instance
+	@param z FF instance
+	@param n size of FF in BIGs
+ */
+extern void FF_mul(B512_60::BIG *x, B512_60::BIG *y, B512_60::BIG *z, int n);
+/**	@brief Reduce FF mod a modulus
+ *
+	This is slow
+	@param x FF instance to be reduced mod m - on exit = x mod m
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_mod(B512_60::BIG *x, B512_60::BIG *m, int n);
+/**	@brief Square an FF
+ *
+	Uses Karatsuba method internally
+	@param x FF instance, on exit = y^2
+	@param y FF instance to be squared
+	@param n size of FF in BIGs
+ */
+extern void FF_sqr(B512_60::BIG *x, B512_60::BIG *y, int n);
+/**	@brief Reduces a double-length FF with respect to a given modulus
+ *
+	This is slow
+	@param x FF instance, on exit = y mod z
+	@param y FF instance, of double length 2*n
+	@param z FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_dmod(B512_60::BIG *x, B512_60::BIG *y, B512_60::BIG *z, int n);
+/**	@brief Invert an FF mod a prime modulus
+ *
+	@param x FF instance, on exit = 1/y mod z
+	@param y FF instance
+	@param z FF prime modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_invmodp(B512_60::BIG *x, B512_60::BIG *y, B512_60::BIG *z, int n);
+/**	@brief Create an FF from a random number generator
+ *
+	@param x FF instance, on exit x is a random number of length n BIGs with most significant bit a 1
+	@param R an instance of a Cryptographically Secure Random Number Generator
+	@param n size of FF in BIGs
+ */
+extern void FF_random(B512_60::BIG *x, csprng *R, int n);
+/**	@brief Create a random FF less than a given modulus from a random number generator
+ *
+	@param x FF instance, on exit x is a random number < y
+	@param y FF instance, the modulus
+	@param R an instance of a Cryptographically Secure Random Number Generator
+	@param n size of FF in BIGs
+ */
+extern void FF_randomnum(B512_60::BIG *x, B512_60::BIG *y, csprng *R, int n);
+/**	@brief Calculate r=x^e mod m, side channel resistant
+ *
+	@param r FF instance, on exit = x^e mod p
+	@param x FF instance
+	@param e FF exponent
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_skpow(B512_60::BIG *r, B512_60::BIG *x, B512_60::BIG * e, B512_60::BIG *m, int n);
+/**	@brief Calculate r=x^e mod m, side channel resistant
+ *
+	For short BIG exponent
+	@param r FF instance, on exit = x^e mod p
+	@param x FF instance
+	@param e BIG exponent
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_skspow(B512_60::BIG *r, B512_60::BIG *x, B512_60::BIG e, B512_60::BIG *m, int n);
+/**	@brief Calculate r=x^e mod m
+ *
+	For very short integer exponent
+	@param r FF instance, on exit = x^e mod p
+	@param x FF instance
+	@param e integer exponent
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_power(B512_60::BIG *r, B512_60::BIG *x, int e, B512_60::BIG *m, int n);
+/**	@brief Calculate r=x^e mod m
+ *
+	@param r FF instance, on exit = x^e mod p
+	@param x FF instance
+	@param e FF exponent
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_pow(B512_60::BIG *r, B512_60::BIG *x, B512_60::BIG *e, B512_60::BIG *m, int n);
+/**	@brief Test if an FF has factor in common with integer s
+ *
+	@param x FF instance to be tested
+	@param s the supplied integer
+	@param n size of FF in BIGs
+	@return 1 if gcd(x,s)!=1, else return 0
+ */
+extern int FF_cfactor(B512_60::BIG *x, sign32 s, int n);
+/**	@brief Test if an FF is prime
+ *
+	Uses Miller-Rabin Method
+	@param x FF instance to be tested
+	@param R an instance of a Cryptographically Secure Random Number Generator
+	@param n size of FF in BIGs
+	@return 1 if x is (almost certainly) prime, else return 0
+ */
+extern int FF_prime(B512_60::BIG *x, csprng *R, int n);
+/**	@brief Calculate r=x^e.y^f mod m
+ *
+	@param r FF instance, on exit = x^e.y^f mod p
+	@param x FF instance
+	@param e BIG exponent
+	@param y FF instance
+	@param f BIG exponent
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_pow2(B512_60::BIG *r, B512_60::BIG *x, B512_60::BIG e, B512_60::BIG *y, B512_60::BIG f, B512_60::BIG *m, int n);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ff_RSA3072.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ff_RSA3072.h
new file mode 100644
index 0000000..82554cf
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ff_RSA3072.h
@@ -0,0 +1,295 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FF_RSA3072_H
+#define FF_RSA3072_H
+
+#include "big_B384_56.h"
+#include "config_ff_RSA3072.h"
+
+using namespace core;
+
+#define HFLEN_RSA3072 (FFLEN_RSA3072/2) /**< Useful for half-size RSA private key operations */
+#define P_MBITS_RSA3072 (MODBYTES_B384_56*8)
+#define P_TBITS_RSA3072 (P_MBITS_RSA3072%BASEBITS_B384_56)
+#define P_EXCESS_RSA3072(a) (((a[NLEN_B384_56-1])>>(P_TBITS_RSA3072))+1)
+#define P_FEXCESS_RSA3072 ((chunk)1<<(BASEBITS_B384_56*NLEN_B384_56-P_MBITS_RSA3072-1))
+
+
+namespace RSA3072 {
+
+/* Finite Field Prototypes */
+/**	@brief Copy one FF element of given length to another
+ *
+	@param x FF instance to be copied to, on exit = y
+	@param y FF instance to be copied from
+	@param n size of FF in BIGs
+
+ */
+extern void FF_copy(B384_56::BIG *x, B384_56::BIG *y, int n);
+/**	@brief Initialize an FF element of given length from a 32-bit integer m
+ *
+	@param x FF instance to be copied to, on exit = m
+	@param m integer
+	@param n size of FF in BIGs
+ */
+extern void FF_init(B384_56::BIG *x, sign32 m, int n);
+/**	@brief Set FF element of given size to zero
+ *
+	@param x FF instance to be set to zero
+	@param n size of FF in BIGs
+ */
+extern void FF_zero(B384_56::BIG *x, int n);
+/**	@brief Tests for FF element equal to zero
+ *
+	@param x FF number to be tested
+	@param n size of FF in BIGs
+	@return 1 if zero, else returns 0
+ */
+extern int FF_iszilch(B384_56::BIG *x, int n);
+/**	@brief  return parity of an FF, that is the least significant bit
+ *
+	@param x FF number
+	@return 0 or 1
+ */
+extern int FF_parity(B384_56::BIG *x);
+/**	@brief  return least significant m bits of an FF
+ *
+	@param x FF number
+	@param m number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int FF_lastbits(B384_56::BIG *x, int m);
+/**	@brief Set FF element of given size to unity
+ *
+	@param x FF instance to be set to unity
+	@param n size of FF in BIGs
+ */
+extern void FF_one(B384_56::BIG *x, int n);
+/**	@brief Compares two FF numbers. Inputs must be normalised externally
+ *
+	@param x first FF number to be compared
+	@param y second FF number to be compared
+	@param n size of FF in BIGs
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int FF_comp(B384_56::BIG *x, B384_56::BIG *y, int n);
+/**	@brief addition of two FFs
+ *
+	@param x FF instance, on exit = y+z
+	@param y FF instance
+	@param z FF instance
+	@param n size of FF in BIGs
+ */
+extern void FF_add(B384_56::BIG *x, B384_56::BIG *y, B384_56::BIG *z, int n);
+/**	@brief subtraction of two FFs
+ *
+	@param x FF instance, on exit = y-z
+	@param y FF instance
+	@param z FF instance
+	@param n size of FF in BIGs
+ */
+extern void FF_sub(B384_56::BIG *x, B384_56::BIG *y, B384_56::BIG *z, int n);
+/**	@brief increment an FF by an integer,and normalise
+ *
+	@param x FF instance, on exit = x+m
+	@param m an integer to be added to x
+	@param n size of FF in BIGs
+ */
+extern void FF_inc(B384_56::BIG *x, int m, int n);
+/**	@brief Decrement an FF by an integer,and normalise
+ *
+	@param x FF instance, on exit = x-m
+	@param m an integer to be subtracted from x
+	@param n size of FF in BIGs
+ */
+extern void FF_dec(B384_56::BIG *x, int m, int n);
+/**	@brief Normalises the components of an FF
+ *
+	@param x FF instance to be normalised
+	@param n size of FF in BIGs
+ */
+extern void FF_norm(B384_56::BIG *x, int n);
+/**	@brief Shift left an FF by 1 bit
+ *
+	@param x FF instance to be shifted left
+	@param n size of FF in BIGs
+ */
+extern void FF_shl(B384_56::BIG *x, int n);
+/**	@brief Shift right an FF by 1 bit
+ *
+	@param x FF instance to be shifted right
+	@param n size of FF in BIGs
+ */
+extern void FF_shr(B384_56::BIG *x, int n);
+/**	@brief Formats and outputs an FF to the console
+ *
+	@param x FF instance to be printed
+	@param n size of FF in BIGs
+ */
+extern void FF_output(B384_56::BIG *x, int n);
+/**	@brief Formats and outputs an FF to the console, in raw form
+ *
+ 	@param x FF instance to be printed
+ 	@param n size of FF in BIGs
+ */
+extern void FF_rawoutput(B384_56::BIG *x, int n);
+/**	@brief Formats and outputs an FF instance to an octet string
+ *
+	Converts an FF to big-endian base 256 form.
+	@param S output octet string
+	@param x FF instance to be converted to an octet string
+	@param n size of FF in BIGs
+ */
+extern void FF_toOctet(octet *S, B384_56::BIG *x, int n);
+/**	@brief Populates an FF instance from an octet string
+ *
+	Creates FF from big-endian base 256 form.
+	@param x FF instance to be created from an octet string
+	@param S input octet string
+	@param n size of FF in BIGs
+ */
+extern void FF_fromOctet(B384_56::BIG *x, octet *S, int n);
+/**	@brief Multiplication of two FFs
+ *
+	Uses Karatsuba method internally
+	@param x FF instance, on exit = y*z
+	@param y FF instance
+	@param z FF instance
+	@param n size of FF in BIGs
+ */
+extern void FF_mul(B384_56::BIG *x, B384_56::BIG *y, B384_56::BIG *z, int n);
+/**	@brief Reduce FF mod a modulus
+ *
+	This is slow
+	@param x FF instance to be reduced mod m - on exit = x mod m
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_mod(B384_56::BIG *x, B384_56::BIG *m, int n);
+/**	@brief Square an FF
+ *
+	Uses Karatsuba method internally
+	@param x FF instance, on exit = y^2
+	@param y FF instance to be squared
+	@param n size of FF in BIGs
+ */
+extern void FF_sqr(B384_56::BIG *x, B384_56::BIG *y, int n);
+/**	@brief Reduces a double-length FF with respect to a given modulus
+ *
+	This is slow
+	@param x FF instance, on exit = y mod z
+	@param y FF instance, of double length 2*n
+	@param z FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_dmod(B384_56::BIG *x, B384_56::BIG *y, B384_56::BIG *z, int n);
+/**	@brief Invert an FF mod a prime modulus
+ *
+	@param x FF instance, on exit = 1/y mod z
+	@param y FF instance
+	@param z FF prime modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_invmodp(B384_56::BIG *x, B384_56::BIG *y, B384_56::BIG *z, int n);
+/**	@brief Create an FF from a random number generator
+ *
+	@param x FF instance, on exit x is a random number of length n BIGs with most significant bit a 1
+	@param R an instance of a Cryptographically Secure Random Number Generator
+	@param n size of FF in BIGs
+ */
+extern void FF_random(B384_56::BIG *x, csprng *R, int n);
+/**	@brief Create a random FF less than a given modulus from a random number generator
+ *
+	@param x FF instance, on exit x is a random number < y
+	@param y FF instance, the modulus
+	@param R an instance of a Cryptographically Secure Random Number Generator
+	@param n size of FF in BIGs
+ */
+extern void FF_randomnum(B384_56::BIG *x, B384_56::BIG *y, csprng *R, int n);
+/**	@brief Calculate r=x^e mod m, side channel resistant
+ *
+	@param r FF instance, on exit = x^e mod p
+	@param x FF instance
+	@param e FF exponent
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_skpow(B384_56::BIG *r, B384_56::BIG *x, B384_56::BIG * e, B384_56::BIG *m, int n);
+/**	@brief Calculate r=x^e mod m, side channel resistant
+ *
+	For short BIG exponent
+	@param r FF instance, on exit = x^e mod p
+	@param x FF instance
+	@param e BIG exponent
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_skspow(B384_56::BIG *r, B384_56::BIG *x, B384_56::BIG e, B384_56::BIG *m, int n);
+/**	@brief Calculate r=x^e mod m
+ *
+	For very short integer exponent
+	@param r FF instance, on exit = x^e mod p
+	@param x FF instance
+	@param e integer exponent
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_power(B384_56::BIG *r, B384_56::BIG *x, int e, B384_56::BIG *m, int n);
+/**	@brief Calculate r=x^e mod m
+ *
+	@param r FF instance, on exit = x^e mod p
+	@param x FF instance
+	@param e FF exponent
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_pow(B384_56::BIG *r, B384_56::BIG *x, B384_56::BIG *e, B384_56::BIG *m, int n);
+/**	@brief Test if an FF has factor in common with integer s
+ *
+	@param x FF instance to be tested
+	@param s the supplied integer
+	@param n size of FF in BIGs
+	@return 1 if gcd(x,s)!=1, else return 0
+ */
+extern int FF_cfactor(B384_56::BIG *x, sign32 s, int n);
+/**	@brief Test if an FF is prime
+ *
+	Uses Miller-Rabin Method
+	@param x FF instance to be tested
+	@param R an instance of a Cryptographically Secure Random Number Generator
+	@param n size of FF in BIGs
+	@return 1 if x is (almost certainly) prime, else return 0
+ */
+extern int FF_prime(B384_56::BIG *x, csprng *R, int n);
+/**	@brief Calculate r=x^e.y^f mod m
+ *
+	@param r FF instance, on exit = x^e.y^f mod p
+	@param x FF instance
+	@param e BIG exponent
+	@param y FF instance
+	@param f BIG exponent
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_pow2(B384_56::BIG *r, B384_56::BIG *x, B384_56::BIG e, B384_56::BIG *y, B384_56::BIG f, B384_56::BIG *m, int n);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ff_RSA4096.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ff_RSA4096.h
new file mode 100644
index 0000000..91b37ae
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/ff_RSA4096.h
@@ -0,0 +1,295 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FF_RSA4096_H
+#define FF_RSA4096_H
+
+#include "big_B512_60.h"
+#include "config_ff_RSA4096.h"
+
+using namespace core;
+
+#define HFLEN_RSA4096 (FFLEN_RSA4096/2) /**< Useful for half-size RSA private key operations */
+#define P_MBITS_RSA4096 (MODBYTES_B512_60*8)
+#define P_TBITS_RSA4096 (P_MBITS_RSA4096%BASEBITS_B512_60)
+#define P_EXCESS_RSA4096(a) (((a[NLEN_B512_60-1])>>(P_TBITS_RSA4096))+1)
+#define P_FEXCESS_RSA4096 ((chunk)1<<(BASEBITS_B512_60*NLEN_B512_60-P_MBITS_RSA4096-1))
+
+
+namespace RSA4096 {
+
+/* Finite Field Prototypes */
+/**	@brief Copy one FF element of given length to another
+ *
+	@param x FF instance to be copied to, on exit = y
+	@param y FF instance to be copied from
+	@param n size of FF in BIGs
+
+ */
+extern void FF_copy(B512_60::BIG *x, B512_60::BIG *y, int n);
+/**	@brief Initialize an FF element of given length from a 32-bit integer m
+ *
+	@param x FF instance to be copied to, on exit = m
+	@param m integer
+	@param n size of FF in BIGs
+ */
+extern void FF_init(B512_60::BIG *x, sign32 m, int n);
+/**	@brief Set FF element of given size to zero
+ *
+	@param x FF instance to be set to zero
+	@param n size of FF in BIGs
+ */
+extern void FF_zero(B512_60::BIG *x, int n);
+/**	@brief Tests for FF element equal to zero
+ *
+	@param x FF number to be tested
+	@param n size of FF in BIGs
+	@return 1 if zero, else returns 0
+ */
+extern int FF_iszilch(B512_60::BIG *x, int n);
+/**	@brief  return parity of an FF, that is the least significant bit
+ *
+	@param x FF number
+	@return 0 or 1
+ */
+extern int FF_parity(B512_60::BIG *x);
+/**	@brief  return least significant m bits of an FF
+ *
+	@param x FF number
+	@param m number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int FF_lastbits(B512_60::BIG *x, int m);
+/**	@brief Set FF element of given size to unity
+ *
+	@param x FF instance to be set to unity
+	@param n size of FF in BIGs
+ */
+extern void FF_one(B512_60::BIG *x, int n);
+/**	@brief Compares two FF numbers. Inputs must be normalised externally
+ *
+	@param x first FF number to be compared
+	@param y second FF number to be compared
+	@param n size of FF in BIGs
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int FF_comp(B512_60::BIG *x, B512_60::BIG *y, int n);
+/**	@brief addition of two FFs
+ *
+	@param x FF instance, on exit = y+z
+	@param y FF instance
+	@param z FF instance
+	@param n size of FF in BIGs
+ */
+extern void FF_add(B512_60::BIG *x, B512_60::BIG *y, B512_60::BIG *z, int n);
+/**	@brief subtraction of two FFs
+ *
+	@param x FF instance, on exit = y-z
+	@param y FF instance
+	@param z FF instance
+	@param n size of FF in BIGs
+ */
+extern void FF_sub(B512_60::BIG *x, B512_60::BIG *y, B512_60::BIG *z, int n);
+/**	@brief increment an FF by an integer,and normalise
+ *
+	@param x FF instance, on exit = x+m
+	@param m an integer to be added to x
+	@param n size of FF in BIGs
+ */
+extern void FF_inc(B512_60::BIG *x, int m, int n);
+/**	@brief Decrement an FF by an integer,and normalise
+ *
+	@param x FF instance, on exit = x-m
+	@param m an integer to be subtracted from x
+	@param n size of FF in BIGs
+ */
+extern void FF_dec(B512_60::BIG *x, int m, int n);
+/**	@brief Normalises the components of an FF
+ *
+	@param x FF instance to be normalised
+	@param n size of FF in BIGs
+ */
+extern void FF_norm(B512_60::BIG *x, int n);
+/**	@brief Shift left an FF by 1 bit
+ *
+	@param x FF instance to be shifted left
+	@param n size of FF in BIGs
+ */
+extern void FF_shl(B512_60::BIG *x, int n);
+/**	@brief Shift right an FF by 1 bit
+ *
+	@param x FF instance to be shifted right
+	@param n size of FF in BIGs
+ */
+extern void FF_shr(B512_60::BIG *x, int n);
+/**	@brief Formats and outputs an FF to the console
+ *
+	@param x FF instance to be printed
+	@param n size of FF in BIGs
+ */
+extern void FF_output(B512_60::BIG *x, int n);
+/**	@brief Formats and outputs an FF to the console, in raw form
+ *
+ 	@param x FF instance to be printed
+ 	@param n size of FF in BIGs
+ */
+extern void FF_rawoutput(B512_60::BIG *x, int n);
+/**	@brief Formats and outputs an FF instance to an octet string
+ *
+	Converts an FF to big-endian base 256 form.
+	@param S output octet string
+	@param x FF instance to be converted to an octet string
+	@param n size of FF in BIGs
+ */
+extern void FF_toOctet(octet *S, B512_60::BIG *x, int n);
+/**	@brief Populates an FF instance from an octet string
+ *
+	Creates FF from big-endian base 256 form.
+	@param x FF instance to be created from an octet string
+	@param S input octet string
+	@param n size of FF in BIGs
+ */
+extern void FF_fromOctet(B512_60::BIG *x, octet *S, int n);
+/**	@brief Multiplication of two FFs
+ *
+	Uses Karatsuba method internally
+	@param x FF instance, on exit = y*z
+	@param y FF instance
+	@param z FF instance
+	@param n size of FF in BIGs
+ */
+extern void FF_mul(B512_60::BIG *x, B512_60::BIG *y, B512_60::BIG *z, int n);
+/**	@brief Reduce FF mod a modulus
+ *
+	This is slow
+	@param x FF instance to be reduced mod m - on exit = x mod m
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_mod(B512_60::BIG *x, B512_60::BIG *m, int n);
+/**	@brief Square an FF
+ *
+	Uses Karatsuba method internally
+	@param x FF instance, on exit = y^2
+	@param y FF instance to be squared
+	@param n size of FF in BIGs
+ */
+extern void FF_sqr(B512_60::BIG *x, B512_60::BIG *y, int n);
+/**	@brief Reduces a double-length FF with respect to a given modulus
+ *
+	This is slow
+	@param x FF instance, on exit = y mod z
+	@param y FF instance, of double length 2*n
+	@param z FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_dmod(B512_60::BIG *x, B512_60::BIG *y, B512_60::BIG *z, int n);
+/**	@brief Invert an FF mod a prime modulus
+ *
+	@param x FF instance, on exit = 1/y mod z
+	@param y FF instance
+	@param z FF prime modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_invmodp(B512_60::BIG *x, B512_60::BIG *y, B512_60::BIG *z, int n);
+/**	@brief Create an FF from a random number generator
+ *
+	@param x FF instance, on exit x is a random number of length n BIGs with most significant bit a 1
+	@param R an instance of a Cryptographically Secure Random Number Generator
+	@param n size of FF in BIGs
+ */
+extern void FF_random(B512_60::BIG *x, csprng *R, int n);
+/**	@brief Create a random FF less than a given modulus from a random number generator
+ *
+	@param x FF instance, on exit x is a random number < y
+	@param y FF instance, the modulus
+	@param R an instance of a Cryptographically Secure Random Number Generator
+	@param n size of FF in BIGs
+ */
+extern void FF_randomnum(B512_60::BIG *x, B512_60::BIG *y, csprng *R, int n);
+/**	@brief Calculate r=x^e mod m, side channel resistant
+ *
+	@param r FF instance, on exit = x^e mod p
+	@param x FF instance
+	@param e FF exponent
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_skpow(B512_60::BIG *r, B512_60::BIG *x, B512_60::BIG * e, B512_60::BIG *m, int n);
+/**	@brief Calculate r=x^e mod m, side channel resistant
+ *
+	For short BIG exponent
+	@param r FF instance, on exit = x^e mod p
+	@param x FF instance
+	@param e BIG exponent
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_skspow(B512_60::BIG *r, B512_60::BIG *x, B512_60::BIG e, B512_60::BIG *m, int n);
+/**	@brief Calculate r=x^e mod m
+ *
+	For very short integer exponent
+	@param r FF instance, on exit = x^e mod p
+	@param x FF instance
+	@param e integer exponent
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_power(B512_60::BIG *r, B512_60::BIG *x, int e, B512_60::BIG *m, int n);
+/**	@brief Calculate r=x^e mod m
+ *
+	@param r FF instance, on exit = x^e mod p
+	@param x FF instance
+	@param e FF exponent
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_pow(B512_60::BIG *r, B512_60::BIG *x, B512_60::BIG *e, B512_60::BIG *m, int n);
+/**	@brief Test if an FF has factor in common with integer s
+ *
+	@param x FF instance to be tested
+	@param s the supplied integer
+	@param n size of FF in BIGs
+	@return 1 if gcd(x,s)!=1, else return 0
+ */
+extern int FF_cfactor(B512_60::BIG *x, sign32 s, int n);
+/**	@brief Test if an FF is prime
+ *
+	Uses Miller-Rabin Method
+	@param x FF instance to be tested
+	@param R an instance of a Cryptographically Secure Random Number Generator
+	@param n size of FF in BIGs
+	@return 1 if x is (almost certainly) prime, else return 0
+ */
+extern int FF_prime(B512_60::BIG *x, csprng *R, int n);
+/**	@brief Calculate r=x^e.y^f mod m
+ *
+	@param r FF instance, on exit = x^e.y^f mod p
+	@param x FF instance
+	@param e BIG exponent
+	@param y FF instance
+	@param f BIG exponent
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_pow2(B512_60::BIG *r, B512_60::BIG *x, B512_60::BIG e, B512_60::BIG *y, B512_60::BIG f, B512_60::BIG *m, int n);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp.cpp
new file mode 100644
index 0000000..a646c57
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp.cpp
@@ -0,0 +1,940 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* CORE mod p functions */
+/* Small Finite Field arithmetic */
+/* SU=m, SU is Stack Usage (NOT_SPECIAL Modulus) */
+
+#include "fp_YYY.h"
+
+using namespace XXX;
+
+/* Fast Modular Reduction Methods */
+
+/* r=d mod m */
+/* d MUST be normalised */
+/* Products must be less than pR in all cases !!! */
+/* So when multiplying two numbers, their product *must* be less than MODBITS_YYY+BASEBITS_XXX*NLEN_XXX */
+/* Results *may* be one bit bigger than MODBITS_YYY */
+
+#if MODTYPE_YYY == PSEUDO_MERSENNE
+/* r=d mod m */
+
+/* Converts from BIG integer to residue form mod Modulus */
+void YYY::FP_nres(FP *y, BIG x)
+{
+    BIG mdls;
+    BIG_rcopy(mdls, Modulus);
+    BIG_copy(y->g, x);
+    BIG_mod(y->g,mdls);
+    y->XES = 1;
+}
+
+/* Converts from residue form back to BIG integer form */
+void YYY::FP_redc(BIG x, FP *y)
+{
+    BIG_copy(x, y->g);
+}
+
+/* reduce a DBIG to a BIG exploiting the special form of the modulus */
+void YYY::FP_mod(BIG r, DBIG d)
+{
+    BIG t, b;
+    chunk v, tw;
+    BIG_split(t, b, d, MODBITS_YYY);
+
+    /* Note that all of the excess gets pushed into t. So if squaring a value with a 4-bit excess, this results in
+       t getting all 8 bits of the excess product! So products must be less than pR which is Montgomery compatible */
+
+    if (MConst < NEXCESS_XXX)
+    {
+        BIG_imul(t, t, MConst);
+        BIG_norm(t);
+        BIG_add(r, t, b);
+        BIG_norm(r);
+        tw = r[NLEN_XXX - 1];
+        r[NLEN_XXX - 1] &= TMASK_YYY;
+        r[0] += MConst * ((tw >> TBITS_YYY));
+    }
+    else
+    {
+        v = BIG_pmul(t, t, MConst);
+        BIG_add(r, t, b);
+        BIG_norm(r);
+        tw = r[NLEN_XXX - 1];
+        r[NLEN_XXX - 1] &= TMASK_YYY;
+#if CHUNK == 16
+        r[1] += muladd(MConst, ((tw >> TBITS_YYY) + (v << (BASEBITS_XXX - TBITS_YYY))), 0, &r[0]);
+#else
+        r[0] += MConst * ((tw >> TBITS_YYY) + (v << (BASEBITS_XXX - TBITS_YYY)));
+#endif
+    }
+    BIG_norm(r);
+}
+#endif
+
+/* This only applies to Curve C448, so specialised (for now) */
+#if MODTYPE_YYY == GENERALISED_MERSENNE
+
+void YYY::FP_nres(FP *y, BIG x)
+{
+    BIG mdls;
+    BIG_rcopy(mdls, Modulus);
+    BIG_copy(y->g, x);
+    BIG_mod(y->g,mdls);
+    y->XES = 1;
+}
+
+/* Converts from residue form back to BIG integer form */
+void YYY::FP_redc(BIG x, FP *y)
+{
+    BIG_copy(x, y->g);
+}
+
+/* reduce a DBIG to a BIG exploiting the special form of a modulus 2^m - 2^n -c */
+void YYY::FP_mod(BIG r, DBIG d)
+{
+
+    BIG t, b;
+    chunk carry;
+    BIG_split(t, b, d, MBITS_YYY);
+
+    BIG_add(r, t, b);
+
+    BIG_dscopy(d, t);
+    BIG_dshl(d, MBITS_YYY / 2);
+
+    BIG_split(t, b, d, MBITS_YYY);
+
+    BIG_add(r, r, t);
+    BIG_add(r, r, b);
+    BIG_norm(r);
+    BIG_shl(t, MBITS_YYY / 2);
+
+    BIG_add(r, r, t);
+
+    carry = r[NLEN_XXX - 1] >> TBITS_YYY;
+
+    r[NLEN_XXX - 1] &= TMASK_YYY;
+    r[0] += carry;
+
+    r[224 / BASEBITS_XXX] += carry << (224 % BASEBITS_XXX); /* need to check that this falls mid-word */
+    BIG_norm(r);
+
+/*
+
+    BIG t, b, t2, b2;
+    int BTset = MBITS_YYY / 2;
+    chunk carry;
+    BIG_split(t, b, d, MBITS_YYY);
+
+    BIG_dscopy(d, t);
+    BIG_dshl(d, BTset);
+
+    BIG_split(t2, b2, d, MBITS_YYY);
+
+    BIG_add(b, b, b2); // 2
+    BIG_add(t, t, t2); // 2
+
+    BIG_shl(t2, BTset);
+
+    BIG_add(b, b, t2); // 3
+    BIG_norm(t);
+
+//  carry=0;
+// Now multiply t by MConst..(?) and extract carry
+//  if (MConst!=1)
+//      carry=BIG_pmul(t,t,MConst);
+
+    BIG_add(r, t, b);
+    BIG_norm(r);
+
+    carry = r[NLEN_XXX - 1] >> TBITS_YYY; // + (carry<<(BASEBITS_XXX-TBITS_YYY));
+    r[NLEN_XXX - 1] &= TMASK_YYY;
+
+    r[BTset / BASEBITS_XXX] += carry << (BTset % BASEBITS_XXX); // need to check that this falls mid-word 
+//  if (MConst!=1) carry*=MConst;
+    r[0] += carry;
+
+    BIG_norm(r);
+*/
+}
+
+#endif
+
+#if MODTYPE_YYY == MONTGOMERY_FRIENDLY
+
+/* convert to Montgomery n-residue form */
+void YYY::FP_nres(FP *y, BIG x)
+{
+    DBIG d;
+    BIG r;
+    BIG_rcopy(r, R2modp);
+    BIG_mul(d, x, r);
+    FP_mod(y->g, d);
+    y->XES = 2;
+}
+
+/* convert back to regular form */
+void YYY::FP_redc(BIG x, FP *y)
+{
+    DBIG d;
+    BIG_dzero(d);
+    BIG_dscopy(d, y->g);
+    FP_mod(x, d);
+}
+
+/* fast modular reduction from DBIG to BIG exploiting special form of the modulus */
+void YYY::FP_mod(BIG a, DBIG d)
+{
+    int i;
+
+    for (i = 0; i < NLEN_XXX; i++)
+        d[NLEN_XXX + i] += muladd(d[i], MConst - 1, d[i], &d[NLEN_XXX + i - 1]);
+
+    BIG_sducopy(a, d);
+    BIG_norm(a);
+}
+
+#endif
+
+#if MODTYPE_YYY == NOT_SPECIAL
+
+/* convert to Montgomery n-residue form */
+void YYY::FP_nres(FP *y, BIG x)
+{
+    DBIG d;
+    BIG r;
+    BIG_rcopy(r, R2modp);
+    BIG_mul(d, x, r);
+    FP_mod(y->g, d);
+    y->XES = 2;
+}
+
+/* convert back to regular form */
+void YYY::FP_redc(BIG x, FP *y)
+{
+    DBIG d;
+    BIG_dzero(d);
+    BIG_dscopy(d, y->g);
+    FP_mod(x, d);
+}
+
+
+/* reduce a DBIG to a BIG using Montgomery's no trial division method */
+/* d is expected to be dnormed before entry */
+/* SU= 112 */
+void YYY::FP_mod(BIG a, DBIG d)
+{
+    BIG mdls;
+    BIG_rcopy(mdls, Modulus);
+    BIG_monty(a, mdls, MConst, d);
+}
+
+#endif
+
+void YYY::FP_from_int(FP *x,int a)
+{
+    BIG w;
+    if (a<0) BIG_rcopy(w, Modulus);
+    else BIG_zero(w); 
+    BIG_inc(w,a); BIG_norm(w); 
+    FP_nres(x,w);
+}
+
+/* test x==0 ? */
+/* SU= 48 */
+int YYY::FP_iszilch(FP *x)
+{
+    BIG m;
+    FP y;
+    FP_copy(&y,x);
+    FP_reduce(&y);
+    FP_redc(m,&y);
+    return BIG_iszilch(m);
+}
+
+/* input must be reduced */
+int YYY::FP_isunity(FP *x)
+{
+    BIG m;
+    FP y;
+    FP_copy(&y,x);
+    FP_reduce(&y);
+    FP_redc(m,&y);
+    return BIG_isunity(m);
+}
+
+void YYY::FP_copy(FP *y, FP *x)
+{
+    BIG_copy(y->g, x->g);
+    y->XES = x->XES;
+}
+
+void YYY::FP_rcopy(FP *y, const BIG c)
+{
+    BIG b;
+    BIG_rcopy(b, c);
+    FP_nres(y, b);
+}
+
+/* Swap a and b if d=1 */
+void YYY::FP_cswap(FP *a, FP *b, int d)
+{
+    sign32 t, c = d;
+    BIG_cswap(a->g, b->g, d);
+
+    c = ~(c - 1);
+    t = c & ((a->XES) ^ (b->XES));
+    a->XES ^= t;
+    b->XES ^= t;
+
+}
+
+/* Move b to a if d=1 */
+void YYY::FP_cmove(FP *a, FP *b, int d)
+{
+    sign32 c = -d;
+
+    BIG_cmove(a->g, b->g, d);
+    a->XES ^= (a->XES ^ b->XES)&c;
+}
+
+void YYY::FP_zero(FP *x)
+{
+    BIG_zero(x->g);
+    x->XES = 1;
+}
+
+int YYY::FP_equals(FP *x, FP *y)
+{
+    FP xg, yg;
+    FP_copy(&xg, x);
+    FP_copy(&yg, y);
+    FP_reduce(&xg); FP_reduce(&yg);
+
+    if (BIG_comp(xg.g, yg.g) == 0) return 1;
+    return 0;
+}
+
+// Is x lexically larger than p-x?
+// return -1 for no, 0 if x=0, 1 for yes
+int YYY::FP_islarger(FP *x)
+{
+    BIG p,fx,sx;
+    if (FP_iszilch(x)) return 0;
+    BIG_rcopy(p,Modulus);
+    FP_redc(fx,x);
+    BIG_sub(sx,p,fx);  BIG_norm(sx); 
+    return BIG_comp(fx,sx);
+}
+
+void YYY::FP_toBytes(char *b,FP *x)
+{
+    BIG t;
+    FP_redc(t, x);
+    BIG_toBytes(b, t);
+}
+
+void YYY::FP_fromBytes(FP *x,char *b)
+{
+    BIG t;
+    BIG_fromBytes(t, b);
+    FP_nres(x, t);
+}
+
+/* output FP */
+/* SU= 48 */
+void YYY::FP_output(FP *r)
+{
+    BIG c;
+    FP_reduce(r);
+    FP_redc(c, r);
+    BIG_output(c);
+}
+
+void YYY::FP_rawoutput(FP *r)
+{
+    BIG_rawoutput(r->g);
+}
+
+#ifdef GET_STATS
+int tsqr = 0, rsqr = 0, tmul = 0, rmul = 0;
+int tadd = 0, radd = 0, tneg = 0, rneg = 0;
+int tdadd = 0, rdadd = 0, tdneg = 0, rdneg = 0;
+#endif
+
+#ifdef FUSED_MODMUL
+
+/* Insert fastest code here */
+
+#endif
+
+/* r=a*b mod Modulus */
+/* product must be less that p.R - and we need to know this in advance! */
+/* SU= 88 */
+void YYY::FP_mul(FP *r, FP *a, FP *b)
+{
+    DBIG d;
+
+    if ((sign64)a->XES * b->XES > (sign64)FEXCESS_YYY)
+    {
+#ifdef DEBUG_REDUCE
+        printf("Product too large - reducing it\n");
+#endif
+        FP_reduce(a);  /* it is sufficient to fully reduce just one of them < p */
+    }
+
+#ifdef FUSED_MODMUL
+    FP_modmul(r->g, a->g, b->g);
+#else
+    BIG_mul(d, a->g, b->g);
+    FP_mod(r->g, d);
+#endif
+    r->XES = 2;
+}
+
+
+/* multiplication by an integer, r=a*c */
+/* SU= 136 */
+void YYY::FP_imul(FP *r, FP *a, int c)
+{
+    DBIG d;
+    BIG k;
+    FP f;
+
+    int s = 0;
+
+    if (c < 0)
+    {
+        c = -c;
+        s = 1;
+    }
+
+#if MODTYPE_YYY==PSEUDO_MERSENNE || MODTYPE_YYY==GENERALISED_MERSENNE
+
+    BIG_pxmul(d, a->g, c);
+    FP_mod(r->g, d);
+    r->XES = 2;
+
+#else
+    //Montgomery
+    if (a->XES * c <= FEXCESS_YYY)
+    {
+        BIG_pmul(r->g, a->g, c);
+        r->XES = a->XES * c; // careful here - XES jumps!
+    }
+    else
+    {   // don't want to do this - only a problem for Montgomery modulus and larger constants
+        BIG_zero(k);
+        BIG_inc(k, c);
+        BIG_norm(k);
+        FP_nres(&f, k);
+        FP_mul(r, a, &f);
+    }
+#endif
+
+    if (s)
+    {
+        FP_neg(r, r);
+        FP_norm(r);
+    }
+}
+
+/* Set r=a^2 mod m */
+/* SU= 88 */
+void YYY::FP_sqr(FP *r, FP *a)
+{
+    DBIG d;
+
+    if ((sign64)a->XES * a->XES > (sign64)FEXCESS_YYY)
+    {
+#ifdef DEBUG_REDUCE
+        printf("Product too large - reducing it\n");
+#endif
+        FP_reduce(a);
+    }
+
+    BIG_sqr(d, a->g);
+    FP_mod(r->g, d);
+    r->XES = 2;
+}
+
+/* SU= 16 */
+/* Set r=a+b */
+void YYY::FP_add(FP *r, FP *a, FP *b)
+{
+    BIG_add(r->g, a->g, b->g);
+    r->XES = a->XES + b->XES;
+    if (r->XES > FEXCESS_YYY)
+    {
+#ifdef DEBUG_REDUCE
+        printf("Sum too large - reducing it \n");
+#endif
+        FP_reduce(r);
+    }
+}
+
+/* Set r=a-b mod m */
+/* SU= 56 */
+void YYY::FP_sub(FP *r, FP *a, FP *b)
+{
+    FP n;
+    FP_neg(&n, b);
+    FP_add(r, a, &n);
+}
+
+// https://graphics.stanford.edu/~seander/bithacks.html
+// constant time log to base 2 (or number of bits in)
+
+static int logb2(unsign32 v)
+{
+    int r;
+    v |= v >> 1;
+    v |= v >> 2;
+    v |= v >> 4;
+    v |= v >> 8;
+    v |= v >> 16;
+
+    v = v - ((v >> 1) & 0x55555555);
+    v = (v & 0x33333333) + ((v >> 2) & 0x33333333);
+    r = (((v + (v >> 4)) & 0xF0F0F0F) * 0x1010101) >> 24;
+    return r;
+}
+
+// find appoximation to quotient of a/m
+// Out by at most 2.
+// Note that MAXXES is bounded to be 2-bits less than half a word
+static int quo(BIG n, BIG m)
+{
+    int sh;
+    chunk num, den;
+    int hb = CHUNK / 2;
+    if (TBITS_YYY < hb)
+    {
+        sh = hb - TBITS_YYY;
+        num = (n[NLEN_XXX - 1] << sh) | (n[NLEN_XXX - 2] >> (BASEBITS_XXX - sh));
+        den = (m[NLEN_XXX - 1] << sh) | (m[NLEN_XXX - 2] >> (BASEBITS_XXX - sh));
+    }
+    else
+    {
+        num = n[NLEN_XXX - 1];
+        den = m[NLEN_XXX - 1];
+    }
+    return (int)(num / (den + 1));
+}
+
+/* SU= 48 */
+/* Fully reduce a mod Modulus */
+void YYY::FP_reduce(FP *a)
+{
+    BIG m, r;
+    int sr, sb, q;
+    chunk carry;
+
+    BIG_rcopy(m, Modulus);
+    BIG_norm(a->g);
+
+    if (a->XES > 16)
+    {
+        q = quo(a->g, m);
+        carry = BIG_pmul(r, m, q);
+        r[NLEN_XXX - 1] += (carry << BASEBITS_XXX); // correction - put any carry out back in again
+        BIG_sub(a->g, a->g, r);
+        BIG_norm(a->g);
+        sb = 2;
+    }
+    else sb = logb2(a->XES - 1); // sb does not depend on the actual data
+
+    BIG_fshl(m, sb);
+    while (sb > 0)
+    {
+// constant time...
+        sr = BIG_ssn(r, a->g, m); // optimized combined shift, subtract and norm
+        BIG_cmove(a->g, r, 1 - sr);
+        sb--;
+    }
+
+    a->XES = 1;
+}
+
+void YYY::FP_norm(FP *x)
+{
+    BIG_norm(x->g);
+}
+
+/* Set r=-a mod Modulus */
+/* SU= 64 */
+void YYY::FP_neg(FP *r, FP *a)
+{
+    int sb;
+    BIG m;
+
+    BIG_rcopy(m, Modulus);
+
+    sb = logb2(a->XES - 1);
+    BIG_fshl(m, sb);
+    BIG_sub(r->g, m, a->g);
+    r->XES = ((sign32)1 << sb) + 1; // +1 to cover case where a is zero ?
+
+    if (r->XES > FEXCESS_YYY)
+    {
+#ifdef DEBUG_REDUCE
+        printf("Negation too large -  reducing it \n");
+#endif
+        FP_reduce(r);
+    }
+
+}
+
+/* Set r=a/2. */
+/* SU= 56 */
+void YYY::FP_div2(FP *r, FP *a)
+{
+    BIG m;
+    BIG w;
+    BIG_rcopy(m, Modulus);
+    int pr=BIG_parity(a->g);
+
+    FP_copy(r, a);
+    BIG_copy(w,r->g);
+    BIG_fshr(r->g,1);
+    BIG_add(w, w, m);
+    BIG_norm(w);
+    BIG_fshr(w, 1);   
+    
+    BIG_cmove(r->g,w,pr);
+}
+
+// Could leak size of b
+// but not used here with secret exponent b
+void YYY::FP_pow(FP *r, FP *a, BIG b)
+{
+    sign8 w[1 + (NLEN_XXX * BASEBITS_XXX + 3) / 4];
+    FP tb[16];
+    BIG t;
+    int i, nb;
+
+    FP_copy(r,a);
+    FP_norm(r);
+    BIG_copy(t, b);
+    BIG_norm(t);
+    nb = 1 + (BIG_nbits(t) + 3) / 4;
+    // convert exponent to 4-bit window
+    for (i = 0; i < nb; i++)
+    {
+        w[i] = BIG_lastbits(t, 4);
+        BIG_dec(t, w[i]);
+        BIG_norm(t);
+        BIG_fshr(t, 4);
+    }
+
+    FP_one(&tb[0]);
+    FP_copy(&tb[1], r);
+    for (i = 2; i < 16; i++)
+        FP_mul(&tb[i], &tb[i - 1], r);
+
+    FP_copy(r, &tb[w[nb - 1]]);
+    for (i = nb - 2; i >= 0; i--)
+    {
+        FP_sqr(r, r);
+        FP_sqr(r, r);
+        FP_sqr(r, r);
+        FP_sqr(r, r);
+        FP_mul(r, r, &tb[w[i]]);
+    }
+    FP_reduce(r);
+}
+
+#if MODTYPE_YYY==PSEUDO_MERSENNE  || MODTYPE_YYY==GENERALISED_MERSENNE
+
+// See eprint paper https://eprint.iacr.org/2018/1038
+// e.g. If p=3 mod 4 r= x^{(p-3)/4}, if p=5 mod 8 r=x^{(p-5)/8}
+
+void YYY::FP_fpow(FP *r, FP *x)
+{
+    int i, j, k, bw, w, nw, lo, m, n, c, nd, e=PM1D2_YYY;
+    FP xp[11], t, key;
+    const int ac[] = {1, 2, 3, 6, 12, 15, 30, 60, 120, 240, 255};
+// phase 1
+    FP_copy(&xp[0], x); // 1
+    FP_sqr(&xp[1], x); // 2
+    FP_mul(&xp[2], &xp[1], x); //3
+    FP_sqr(&xp[3], &xp[2]); // 6
+    FP_sqr(&xp[4], &xp[3]); // 12
+    FP_mul(&xp[5], &xp[4], &xp[2]); // 15
+    FP_sqr(&xp[6], &xp[5]); // 30
+    FP_sqr(&xp[7], &xp[6]); // 60
+    FP_sqr(&xp[8], &xp[7]); // 120
+    FP_sqr(&xp[9], &xp[8]); // 240
+    FP_mul(&xp[10], &xp[9], &xp[5]); // 255
+
+#if MODTYPE_YYY==PSEUDO_MERSENNE
+    n = MODBITS_YYY;
+#endif
+#if MODTYPE_YYY==GENERALISED_MERSENNE  // Ed448 ONLY
+    n = MODBITS_YYY / 2;
+#endif
+
+    n-=(e+1);
+    c=(MConst+(1<<e)+1)/(1<<(e+1));
+
+// need c to be odd
+    nd=0;
+    while (c%2==0)
+    {
+        c/=2;
+        n-=1;
+        nd++;
+    }
+
+    bw = 0; w = 1; while (w < c) {w *= 2; bw += 1;}
+    k = w - c;
+
+    if (k != 0)
+    {
+        i = 10; while (ac[i] > k) i--;
+        FP_copy(&key, &xp[i]);
+        k -= ac[i];
+    }
+    while (k != 0)
+    {
+        i--;
+        if (ac[i] > k) continue;
+        FP_mul(&key, &key, &xp[i]);
+        k -= ac[i];
+    }
+
+// phase 2
+    FP_copy(&xp[1], &xp[2]);
+    FP_copy(&xp[2], &xp[5]);
+    FP_copy(&xp[3], &xp[10]);
+
+    j = 3; m = 8;
+    nw = n - bw;
+    while (2 * m < nw)
+    {
+        FP_copy(&t, &xp[j++]);
+        for (i = 0; i < m; i++)
+            FP_sqr(&t, &t);
+        FP_mul(&xp[j], &xp[j - 1], &t);
+        m *= 2;
+    }
+
+    lo = nw - m;
+    FP_copy(r, &xp[j]);
+
+    while (lo != 0)
+    {
+        m /= 2; j--;
+        if (lo < m) continue;
+        lo -= m;
+        FP_copy(&t, r);
+        for (i = 0; i < m; i++)
+            FP_sqr(&t, &t);
+        FP_mul(r, &t, &xp[j]);
+    }
+// phase 3
+
+    if (bw != 0)
+    {
+        for (i = 0; i < bw; i++ )
+            FP_sqr(r, r);
+        FP_mul(r, r, &key);
+    }
+
+#if MODTYPE_YYY==GENERALISED_MERSENNE  // Ed448 ONLY
+    FP_copy(&key, r);
+    FP_sqr(&t, &key);
+    FP_mul(r, &t, &xp[0]);
+    for (i = 0; i < n + 1; i++)
+        FP_sqr(r, r);
+    FP_mul(r, r, &key);
+#endif
+
+    for (i=0;i<nd;i++)
+        FP_sqr(r,r);
+
+}
+
+#endif
+
+// calculates r=x^(p-1-2^e)/2^{e+1) where 2^e|p-1
+void YYY::FP_progen(FP *r,FP *x)
+{
+#if MODTYPE_YYY==PSEUDO_MERSENNE  || MODTYPE_YYY==GENERALISED_MERSENNE
+    FP_fpow(r, x);  
+#else
+    int e=PM1D2_YYY;
+    BIG m;
+    BIG_rcopy(m, Modulus);
+    BIG_dec(m,1);
+    BIG_shr(m,e);
+    BIG_dec(m,1);
+    BIG_fshr(m,1);
+    FP_pow(r,x,m);
+#endif
+}
+
+/* Is x a QR? return optional hint for fast follow-up square root */
+int YYY::FP_qr(FP *x,FP *h)
+{
+    FP r;
+    int i,e=PM1D2_YYY;
+    FP_progen(&r,x);
+    if (h!=NULL)
+        FP_copy(h,&r);
+
+    FP_sqr(&r,&r);
+    FP_mul(&r,x,&r);
+    for (i=0;i<e-1;i++ )
+        FP_sqr(&r,&r);
+
+    return FP_isunity(&r);
+}
+
+/* Modular inversion */
+void YYY::FP_inv(FP *r,FP *x,FP *h)
+{
+    int i,e=PM1D2_YYY;
+    FP s,t;
+    FP_norm(x);
+    FP_copy(&s,x);
+
+    if (h==NULL)
+        FP_progen(&t,x);
+    else
+        FP_copy(&t,h);
+
+    for (i=0;i<e-1;i++)
+    {  
+        FP_sqr(&s,&s);
+        FP_mul(&s,&s,x);
+    }
+    for (i=0;i<=e;i++)
+        FP_sqr(&t,&t);
+
+    FP_mul(r,&t,&s);
+    FP_reduce(r);
+}
+
+// Tonelli-Shanks constant time
+void YYY::FP_sqrt(FP *r, FP *a, FP* h)
+{
+    int i,j,k,u,e=PM1D2_YYY;
+    FP v,g,t,b;
+    BIG m;
+
+    if (h==NULL)
+        FP_progen(&g,a);
+    else
+        FP_copy(&g,h);
+
+    BIG_rcopy(m,ROI);
+    FP_nres(&v,m);
+
+    FP_sqr(&t,&g);
+    FP_mul(&t,&t,a);
+   
+    FP_mul(r,&g,a);
+    FP_copy(&b,&t);
+    for (k=e;k>1;k--)
+    {
+        for (j=1;j<k-1;j++)
+            FP_sqr(&b,&b);
+        u=1-FP_isunity(&b);
+        FP_mul(&g,r,&v);
+        FP_cmove(r,&g,u);
+        FP_sqr(&v,&v);
+        FP_mul(&g,&t,&v);
+        FP_cmove(&t,&g,u);
+        FP_copy(&b,&t);
+    }
+// always return +ve square root
+    k=FP_sign(r);
+    FP_neg(&v,r); FP_norm(&v);
+    FP_cmove(r,&v,k);
+}
+
+// Calculate both inverse and square root of x, return QR
+int YYY::FP_invsqrt(FP *i, FP *s, FP *x)
+{
+    FP h;
+    int qr=FP_qr(x,&h);
+    FP_sqrt(s,x,&h);
+    FP_inv(i,x,&h);
+    return qr;
+}
+
+// Two for Price of One - See Hamburg https://eprint.iacr.org/2012/309.pdf
+// Calculate inverse of i and square root of s, return QR
+int YYY::FP_tpo(FP* i, FP* s)
+{
+    int qr;
+    FP w,t;
+    FP_mul(&w,s,i);
+    FP_mul(&t,&w,i);
+    qr=FP_invsqrt(i,s,&t);
+    FP_mul(i,i,&w);
+    FP_mul(s,s,i);
+    return qr;
+}
+
+/* SU=8 */
+/* set n=1 */
+void YYY::FP_one(FP *n)
+{
+    BIG b;
+    BIG_one(b);
+    FP_nres(n, b);
+}
+
+int YYY::FP_sign(FP *x)
+{
+#ifdef BIG_ENDIAN_SIGN_YYY
+    int cp;
+    BIG m,pm1d2;
+    FP y;
+    BIG_rcopy(pm1d2, Modulus);
+    BIG_dec(pm1d2,1);
+    BIG_fshr(pm1d2,1); //(p-1)/2
+     
+    FP_copy(&y,x);
+    FP_reduce(&y);
+    FP_redc(m,&y);
+    cp=BIG_comp(m,pm1d2);
+    return ((cp+1)&2)>>1;
+
+#else
+    BIG m;
+    FP y;
+    FP_copy(&y,x);
+    FP_reduce(&y);
+    FP_redc(m,&y);
+    return BIG_parity(m);
+#endif
+}
+
+void YYY::FP_rand(FP *x,csprng *rng)
+{
+    BIG w,m;
+    BIG_rcopy(m,Modulus);
+    BIG_randomnum(w,m,rng);
+    FP_nres(x,w);
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp.h
new file mode 100644
index 0000000..4392395
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_YYY_H
+#define FP_YYY_H
+
+#include "big_XXX.h"
+#include "config_field_YYY.h"
+
+using namespace core;
+
+#define MODBITS_YYY MBITS_YYY
+#define TBITS_YYY (MBITS_YYY%BASEBITS_XXX)              /**< Number of active bits in top word */
+#define TMASK_YYY (((chunk)1<<TBITS_YYY)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_YYY (((sign32)1<<MAXXES_YYY)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_YYY (-((chunk)(1)<<TBITS_YYY))            /**<  for masking out overflow bits */
+
+namespace YYY {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    XXX::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const XXX::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const XXX::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const XXX::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const XXX::BIG SQRTm3;      /**< Square root of -3 */
+extern const XXX::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const XXX::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const XXX::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const XXX::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const XXX::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, XXX::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(XXX::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(XXX::BIG r, XXX::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(XXX::BIG, XXX::BIG, XXX::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, XXX::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp12.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp12.cpp
new file mode 100644
index 0000000..61ac4f3
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp12.cpp
@@ -0,0 +1,952 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* CORE Fp^12 functions */
+/* SU=m, m is Stack Usage (no lazy )*/
+/* FP12 elements are of the form a+i.b+i^2.c */
+
+#include "fp12_YYY.h"
+#include "config_curve_ZZZ.h"
+
+using namespace XXX;
+
+/* return 1 if b==c, no branching */
+static int teq(sign32 b, sign32 c)
+{
+    sign32 x = b ^ c;
+    x -= 1; // if x=0, x now -1
+    return (int)((x >> 31) & 1);
+}
+
+
+/* Constant time select from pre-computed table */
+static void FP12_select(YYY::FP12 *f, YYY::FP12 g[], sign32 b)
+{
+    YYY::FP12 invf;
+    sign32 m = b >> 31;
+    sign32 babs = (b ^ m) - m;
+
+    babs = (babs - 1) / 2;
+
+    FP12_cmove(f, &g[0], teq(babs, 0)); // conditional move
+    FP12_cmove(f, &g[1], teq(babs, 1));
+    FP12_cmove(f, &g[2], teq(babs, 2));
+    FP12_cmove(f, &g[3], teq(babs, 3));
+    FP12_cmove(f, &g[4], teq(babs, 4));
+    FP12_cmove(f, &g[5], teq(babs, 5));
+    FP12_cmove(f, &g[6], teq(babs, 6));
+    FP12_cmove(f, &g[7], teq(babs, 7));
+
+    FP12_copy(&invf, f);
+    FP12_conj(&invf, &invf); // 1/f
+    FP12_cmove(f, &invf, (int)(m & 1));
+}
+
+/* test x==0 ? */
+/* SU= 8 */
+int YYY::FP12_iszilch(FP12 *x)
+{
+    if (FP4_iszilch(&(x->a)) && FP4_iszilch(&(x->b)) && FP4_iszilch(&(x->c))) return 1;
+    return 0;
+}
+
+/* test x==1 ? */
+/* SU= 8 */
+int YYY::FP12_isunity(FP12 *x)
+{
+    if (FP4_isunity(&(x->a)) && FP4_iszilch(&(x->b)) && FP4_iszilch(&(x->c))) return 1;
+    return 0;
+}
+
+/* FP12 copy w=x */
+/* SU= 16 */
+void YYY::FP12_copy(FP12 *w, FP12 *x)
+{
+    if (x == w) return;
+    FP4_copy(&(w->a), &(x->a));
+    FP4_copy(&(w->b), &(x->b));
+    FP4_copy(&(w->c), &(x->c));
+    w->type = x->type;
+}
+
+/* FP12 w=1 */
+/* SU= 8 */
+void YYY::FP12_one(FP12 *w)
+{
+    FP4_one(&(w->a));
+    FP4_zero(&(w->b));
+    FP4_zero(&(w->c));
+    w->type = FP_UNITY;
+}
+
+void YYY::FP12_zero(FP12 *w)
+{
+    FP4_zero(&(w->a));
+    FP4_zero(&(w->b));
+    FP4_zero(&(w->c));
+    w->type = FP_ZILCH;
+}
+
+/* return 1 if x==y, else 0 */
+/* SU= 16 */
+int YYY::FP12_equals(FP12 *x, FP12 *y)
+{
+    if (FP4_equals(&(x->a), &(y->a)) && FP4_equals(&(x->b), &(y->b)) && FP4_equals(&(x->c), &(y->c)))
+        return 1;
+    return 0;
+}
+
+/* Set w=conj(x) */
+/* SU= 8 */
+void YYY::FP12_conj(FP12 *w, FP12 *x)
+{
+    FP12_copy(w, x);
+    FP4_conj(&(w->a), &(w->a));
+    FP4_nconj(&(w->b), &(w->b));
+    FP4_conj(&(w->c), &(w->c));
+}
+
+/* Create FP12 from FP4 */
+/* SU= 8 */
+void YYY::FP12_from_FP4(FP12 *w, FP4 *a)
+{
+    FP4_copy(&(w->a), a);
+    FP4_zero(&(w->b));
+    FP4_zero(&(w->c));
+    w->type = FP_SPARSEST;
+}
+
+/* Create FP12 from 3 FP4's */
+/* SU= 16 */
+void YYY::FP12_from_FP4s(FP12 *w, FP4 *a, FP4 *b, FP4 *c)
+{
+    FP4_copy(&(w->a), a);
+    FP4_copy(&(w->b), b);
+    FP4_copy(&(w->c), c);
+    w->type = FP_DENSE;
+}
+
+/* Granger-Scott Unitary Squaring. This does not benefit from lazy reduction */
+/* SU= 600 */
+void YYY::FP12_usqr(FP12 *w, FP12 *x)
+{
+    FP4 A, B, C, D;
+
+    FP4_copy(&A, &(x->a));
+
+    FP4_sqr(&(w->a), &(x->a)); // Wa XES=2
+    FP4_add(&D, &(w->a), &(w->a)); // Wa XES=4
+    FP4_add(&(w->a), &D, &(w->a)); // Wa XES=6
+
+    FP4_norm(&(w->a));
+    FP4_nconj(&A, &A);
+
+    FP4_add(&A, &A, &A);
+    FP4_add(&(w->a), &(w->a), &A); // Wa XES=8
+    FP4_sqr(&B, &(x->c));
+    FP4_times_i(&B);
+
+    FP4_add(&D, &B, &B);
+    FP4_add(&B, &B, &D);
+    FP4_norm(&B);
+
+    FP4_sqr(&C, &(x->b));
+
+    FP4_add(&D, &C, &C);
+    FP4_add(&C, &C, &D);
+
+    FP4_norm(&C);
+    FP4_conj(&(w->b), &(x->b));
+    FP4_add(&(w->b), &(w->b), &(w->b));
+    FP4_nconj(&(w->c), &(x->c));
+
+    FP4_add(&(w->c), &(w->c), &(w->c));
+    FP4_add(&(w->b), &B, &(w->b));
+    FP4_add(&(w->c), &C, &(w->c));
+
+    w->type = FP_DENSE;
+    //FP12_norm(w);
+    FP12_reduce(w);     /* reduce here as in pow function repeated squarings would trigger multiple reductions */
+}
+
+/* FP12 squaring w=x^2 */
+/* SU= 600 */
+void YYY::FP12_sqr(FP12 *w, FP12 *x)
+{
+    /* Use Chung-Hasan SQR2 method from http://cacr.uwaterloo.ca/techreports/2006/cacr2006-24.pdf */
+
+    FP4 A, B, C, D;
+
+    if (x->type <= FP_UNITY)
+    {
+        FP12_copy(w, x);
+        return;
+    }
+
+    FP4_sqr(&A, &(x->a));
+    FP4_mul(&B, &(x->b), &(x->c));
+    FP4_add(&B, &B, &B);
+    FP4_norm(&B);
+    FP4_sqr(&C, &(x->c));
+
+    FP4_mul(&D, &(x->a), &(x->b));
+    FP4_add(&D, &D, &D);
+    FP4_add(&(w->c), &(x->a), &(x->c));
+    FP4_add(&(w->c), &(x->b), &(w->c));
+    FP4_norm(&(w->c));
+
+    FP4_sqr(&(w->c), &(w->c));
+
+    FP4_copy(&(w->a), &A);
+    FP4_add(&A, &A, &B);
+
+    FP4_norm(&A);
+
+    FP4_add(&A, &A, &C);
+    FP4_add(&A, &A, &D);
+
+    FP4_norm(&A);
+    FP4_neg(&A, &A);
+    FP4_times_i(&B);
+    FP4_times_i(&C);
+
+    FP4_add(&(w->a), &(w->a), &B);
+    FP4_add(&(w->b), &C, &D);
+    FP4_add(&(w->c), &(w->c), &A);
+
+    if (x->type == FP_SPARSER || x->type == FP_SPARSEST)
+        w->type = FP_SPARSE;
+    else
+        w->type = FP_DENSE;
+    FP12_norm(w);
+}
+
+// Use FP12_mul when both multiplicands are dense
+// Use FP12smul when it is known that both multiplicands are line functions
+// Use FP12ssmul when it is suspected that one or both multiplicands could have some sparsity
+
+
+/* FP12 full multiplication w=w*y */
+void YYY::FP12_mul(FP12 *w, FP12 *y)
+{
+    FP4 z0, z1, z2, z3, t0, t1;
+
+    FP4_mul(&z0, &(w->a), &(y->a)); // xa.ya   always 11x11
+
+    FP4_mul(&z2, &(w->b), &(y->b)); // xb.yb  could be 00x00 or 01x01 or or 10x10 or 11x00 or 11x10 or 11x01 or 11x11
+
+    FP4_add(&t0, &(w->a), &(w->b)); // (xa+xb)
+    FP4_add(&t1, &(y->a), &(y->b)); // (ya+yb)
+
+    FP4_norm(&t0);
+    FP4_norm(&t1);
+
+    FP4_mul(&z1, &t0, &t1); // (xa+xb)(ya+yb)  always 11x11
+    FP4_add(&t0, &(w->b), &(w->c)); // (xb+xc)
+    FP4_add(&t1, &(y->b), &(y->c)); // (yb+yc)
+
+    FP4_norm(&t0);
+    FP4_norm(&t1);
+
+    FP4_mul(&z3, &t0, &t1); // (xb+xc)(yb+yc)   could be anything...
+    FP4_neg(&t0, &z0);      // -(xa.ya)
+    FP4_neg(&t1, &z2);      // -(xb.yb)
+
+    FP4_add(&z1, &z1, &t0);
+    FP4_add(&(w->b), &z1, &t1); // /wb = (xa+xb)(ya+yb) -(xa.ya) -(xb.yb)                     = xa.yb + xb.ya
+
+    FP4_add(&z3, &z3, &t1);      // (xb+xc)(yb+yc) -(xb.yb)
+    FP4_add(&z2, &z2, &t0);      // (xb.yb) - (xa.ya)
+
+    FP4_add(&t0, &(w->a), &(w->c)); // (xa+xc)
+    FP4_add(&t1, &(y->a), &(y->c)); // (ya+yc)
+
+    FP4_norm(&t0);
+    FP4_norm(&t1);
+
+    FP4_mul(&t0, &t1, &t0); // (xa+xc)(ya+yc)    always 11x11
+    FP4_add(&z2, &z2, &t0); // (xb.yb) - (xa.ya) + (xa+xc)(ya+yc)
+
+    FP4_mul(&t0, &(w->c), &(y->c)); // (xc.yc)  could be anything
+    FP4_neg(&t1, &t0);            // -(xc.yc)
+
+    FP4_add(&(w->c), &z2, &t1);     // wc = (xb.yb) - (xa.ya) + (xa+xc)(ya+yc) - (xc.yc)    =  xb.yb + xc.ya + xa.yc
+    FP4_add(&z3, &z3, &t1);         // (xb+xc)(yb+yc) -(xb.yb) - (xc.yc)                    =  xb.yc + xc.yb
+    FP4_times_i(&t0);               // i.(xc.yc)
+    FP4_add(&(w->b), &(w->b), &t0); // wb = (xa+xb)(ya+yb) -(xa.ya) -(xb.yb) +i(xc.yc)
+    FP4_norm(&z3);
+    FP4_times_i(&z3);               // i[(xb+xc)(yb+yc) -(xb.yb) - (xc.yc)]                 = i(xb.yc + xc.yb)
+    FP4_add(&(w->a), &z0, &z3);     // wa = xa.ya + i(xb.yc + xc.yb)
+
+    FP12_norm(w);
+    w->type = FP_DENSE;
+}
+
+/* FP12 full multiplication w=w*y */
+/* Supports sparse multiplicands */
+/* Usually w is denser than y */
+void YYY::FP12_ssmul(FP12 *w, FP12 *y)
+{
+    FP4 z0, z1, z2, z3, t0, t1;
+    if (w->type == FP_UNITY)
+    {
+        FP12_copy(w, y);
+        return;
+    }
+    if (y->type == FP_UNITY)
+        return;
+
+    if (y->type >= FP_SPARSE)
+    {
+        FP4_mul(&z0, &(w->a), &(y->a)); // xa.ya   always 11x11
+
+#if SEXTIC_TWIST_ZZZ == M_TYPE
+        if (y->type == FP_SPARSE || w->type == FP_SPARSE)
+        {
+            FP2_mul(&z2.b, &(w->b).b, &(y->b).b);
+            FP2_zero(&z2.a);
+            if (y->type != FP_SPARSE)
+                FP2_mul(&z2.a, &(w->b).b, &(y->b).a);
+            if (w->type != FP_SPARSE)
+                FP2_mul(&z2.a, &(w->b).a, &(y->b).b);
+            FP4_times_i(&z2);
+        }
+        else
+#endif
+            FP4_mul(&z2, &(w->b), &(y->b)); // xb.yb  could be 00x00 or 01x01 or or 10x10 or 11x00 or 11x10 or 11x01 or 11x11
+
+        FP4_add(&t0, &(w->a), &(w->b)); // (xa+xb)
+        FP4_add(&t1, &(y->a), &(y->b)); // (ya+yb)
+
+        FP4_norm(&t0);
+        FP4_norm(&t1);
+
+        FP4_mul(&z1, &t0, &t1); // (xa+xb)(ya+yb)  always 11x11
+        FP4_add(&t0, &(w->b), &(w->c)); // (xb+xc)
+        FP4_add(&t1, &(y->b), &(y->c)); // (yb+yc)
+
+        FP4_norm(&t0);
+        FP4_norm(&t1);
+
+        FP4_mul(&z3, &t0, &t1); // (xb+xc)(yb+yc)   could be anything...
+        FP4_neg(&t0, &z0);      // -(xa.ya)
+        FP4_neg(&t1, &z2);      // -(xb.yb)
+
+        FP4_add(&z1, &z1, &t0);
+        FP4_add(&(w->b), &z1, &t1); // /wb = (xa+xb)(ya+yb) -(xa.ya) -(xb.yb)                     = xa.yb + xb.ya
+
+        FP4_add(&z3, &z3, &t1);      // (xb+xc)(yb+yc) -(xb.yb)
+        FP4_add(&z2, &z2, &t0);      // (xb.yb) - (xa.ya)
+
+        FP4_add(&t0, &(w->a), &(w->c)); // (xa+xc)
+        FP4_add(&t1, &(y->a), &(y->c)); // (ya+yc)
+
+        FP4_norm(&t0);
+        FP4_norm(&t1);
+
+        FP4_mul(&t0, &t1, &t0); // (xa+xc)(ya+yc)    always 11x11
+        FP4_add(&z2, &z2, &t0); // (xb.yb) - (xa.ya) + (xa+xc)(ya+yc)
+
+#if SEXTIC_TWIST_ZZZ == D_TYPE
+        if (y->type == FP_SPARSE || w->type == FP_SPARSE)
+        {
+            FP2_mul(&t0.a, &(w->c).a, &(y->c).a);
+            FP2_zero(&t0.b);
+            if (y->type != FP_SPARSE)
+                FP2_mul(&t0.b, &(w->c).a, &(y->c).b);
+            if (w->type != FP_SPARSE)
+                FP2_mul(&t0.b, &(w->c).b, &(y->c).a);
+        }
+        else
+#endif
+            FP4_mul(&t0, &(w->c), &(y->c)); // (xc.yc)  could be anything
+
+        FP4_neg(&t1, &t0);            // -(xc.yc)
+
+        FP4_add(&(w->c), &z2, &t1);     // wc = (xb.yb) - (xa.ya) + (xa+xc)(ya+yc) - (xc.yc)    =  xb.yb + xc.ya + xa.yc
+        FP4_add(&z3, &z3, &t1);         // (xb+xc)(yb+yc) -(xb.yb) - (xc.yc)                    =  xb.yc + xc.yb
+        FP4_times_i(&t0);               // i.(xc.yc)
+        FP4_add(&(w->b), &(w->b), &t0); // wb = (xa+xb)(ya+yb) -(xa.ya) -(xb.yb) +i(xc.yc)
+        FP4_norm(&z3);
+        FP4_times_i(&z3);               // i[(xb+xc)(yb+yc) -(xb.yb) - (xc.yc)]                 = i(xb.yc + xc.yb)
+        FP4_add(&(w->a), &z0, &z3);     // wa = xa.ya + i(xb.yc + xc.yb)
+    } else {
+        if (w->type == FP_SPARSER || w->type == FP_SPARSEST)
+        {
+            FP12_smul(w, y);
+            return;
+        }
+// dense by sparser or sparsest - 13m
+#if SEXTIC_TWIST_ZZZ == D_TYPE
+        FP4_copy(&z3, &(w->b));
+        FP4_mul(&z0, &(w->a), &(y->a));
+
+        if (y->type == FP_SPARSEST)
+            FP4_qmul(&z2, &(w->b), &(y->b).a.a);
+        else
+            FP4_pmul(&z2, &(w->b), &(y->b).a);
+
+        FP4_add(&(w->b), &(w->a), &(w->b));
+        FP4_copy(&t1, &(y->a));
+        FP2_add(&t1.a, &t1.a, &(y->b).a);
+
+        FP4_norm(&t1);
+        FP4_norm(&(w->b));
+
+        FP4_mul(&(w->b), &(w->b), &t1);
+        FP4_add(&z3, &z3, &(w->c));
+        FP4_norm(&z3);
+
+        if (y->type == FP_SPARSEST)
+            FP4_qmul(&z3, &z3, &(y->b).a.a);
+        else
+            FP4_pmul(&z3, &z3, &(y->b).a);
+
+        FP4_neg(&t0, &z0);
+        FP4_neg(&t1, &z2);
+
+        FP4_add(&(w->b), &(w->b), &t0); // z1=z1-z0
+        FP4_add(&(w->b), &(w->b), &t1); // z1=z1-z2
+
+        FP4_add(&z3, &z3, &t1);      // z3=z3-z2
+        FP4_add(&z2, &z2, &t0);      // z2=z2-z0
+
+        FP4_add(&t0, &(w->a), &(w->c));
+        FP4_norm(&t0);
+        FP4_norm(&z3);
+
+        FP4_mul(&t0, &(y->a), &t0);
+        FP4_add(&(w->c), &z2, &t0);
+
+        FP4_times_i(&z3);
+        FP4_add(&(w->a), &z0, &z3);
+#endif
+#if SEXTIC_TWIST_ZZZ == M_TYPE
+        FP4_mul(&z0, &(w->a), &(y->a));
+        FP4_add(&t0, &(w->a), &(w->b));
+        FP4_norm(&t0);
+
+        FP4_mul(&z1, &t0, &(y->a));
+        FP4_add(&t0, &(w->b), &(w->c));
+        FP4_norm(&t0);
+
+        if (y->type == FP_SPARSEST)
+            FP4_qmul(&z3, &t0, &(y->c).b.a);
+        else
+            FP4_pmul(&z3, &t0, &(y->c).b);
+
+        FP4_times_i(&z3);
+
+        FP4_neg(&t0, &z0);
+        FP4_add(&z1, &z1, &t0); // z1=z1-z0
+
+        FP4_copy(&(w->b), &z1);
+        FP4_copy(&z2, &t0);
+
+        FP4_add(&t0, &(w->a), &(w->c));
+        FP4_add(&t1, &(y->a), &(y->c));
+
+        FP4_norm(&t0);
+        FP4_norm(&t1);
+
+        FP4_mul(&t0, &t1, &t0);
+        FP4_add(&z2, &z2, &t0);
+
+        if (y->type == FP_SPARSEST)
+            FP4_qmul(&t0, &(w->c), &(y->c).b.a);
+        else
+            FP4_pmul(&t0, &(w->c), &(y->c).b);
+
+        FP4_times_i(&t0);
+        FP4_neg(&t1, &t0);
+        FP4_times_i(&t0);
+
+        FP4_add(&(w->c), &z2, &t1);
+        FP4_add(&z3, &z3, &t1);
+
+        FP4_add(&(w->b), &(w->b), &t0);
+        FP4_norm(&z3);
+        FP4_times_i(&z3);
+        FP4_add(&(w->a), &z0, &z3);
+
+#endif
+    }
+    w->type = FP_DENSE;
+    FP12_norm(w);
+}
+
+/* FP12 multiplication w=w*y */
+/* catering for special case that arises from special form of ATE pairing line function */
+/* w and y are both sparser or sparsest line functions - cost = 6m */
+void YYY::FP12_smul(FP12 *w, FP12 *y)
+{
+    FP2 w1, w2, w3, ta, tb, tc, td, te, t;
+
+#if SEXTIC_TWIST_ZZZ == D_TYPE
+    FP2_mul(&w1, &(w->a).a, &(y->a).a); // A1.A2
+    FP2_mul(&w2, &(w->a).b, &(y->a).b); // B1.B2
+
+    if (y->type == FP_SPARSEST || w->type == FP_SPARSEST)
+    {
+        if (y->type == FP_SPARSEST && w->type == FP_SPARSEST)
+        {
+            FP_mul(&w3.a, &(w->b).a.a, &(y->b).a.a);
+            FP_zero(&w3.b);
+        } else {
+            if (y->type != FP_SPARSEST)
+                FP2_pmul(&w3, &(y->b).a, &(w->b).a.a);
+            if (w->type != FP_SPARSEST)
+                FP2_pmul(&w3, &(w->b).a, &(y->b).a.a);
+        }
+    }
+    else
+        FP2_mul(&w3, &(w->b).a, &(y->b).a); // C1.C2
+
+    FP2_add(&ta, &(w->a).a, &(w->a).b); // A1+B1
+    FP2_add(&tb, &(y->a).a, &(y->a).b); // A2+B2
+    FP2_norm(&ta);
+    FP2_norm(&tb);
+    FP2_mul(&tc, &ta, &tb);         // (A1+B1)(A2+B2)
+    FP2_add(&t, &w1, &w2);
+    FP2_neg(&t, &t);
+    FP2_add(&tc, &tc, &t);          // (A1+B1)(A2+B2)-A1.A2-B1*B2 =  (A1.B2+A2.B1)
+
+    FP2_add(&ta, &(w->a).a, &(w->b).a); // A1+C1
+    FP2_add(&tb, &(y->a).a, &(y->b).a); // A2+C2
+    FP2_norm(&ta);
+    FP2_norm(&tb);
+    FP2_mul(&td, &ta, &tb);         // (A1+C1)(A2+C2)
+    FP2_add(&t, &w1, &w3);
+    FP2_neg(&t, &t);
+    FP2_add(&td, &td, &t);          // (A1+C1)(A2+C2)-A1.A2-C1*C2 =  (A1.C2+A2.C1)
+
+    FP2_add(&ta, &(w->a).b, &(w->b).a); // B1+C1
+    FP2_add(&tb, &(y->a).b, &(y->b).a); // B2+C2
+    FP2_norm(&ta);
+    FP2_norm(&tb);
+    FP2_mul(&te, &ta, &tb);         // (B1+C1)(B2+C2)
+    FP2_add(&t, &w2, &w3);
+    FP2_neg(&t, &t);
+    FP2_add(&te, &te, &t);          // (B1+C1)(B2+C2)-B1.B2-C1*C2 =  (B1.C2+B2.C1)
+
+    FP2_mul_ip(&w2);
+    FP2_add(&w1, &w1, &w2);
+    FP4_from_FP2s(&(w->a), &w1, &tc);
+    FP4_from_FP2s(&(w->b), &td, &te); // only norm these 2
+    FP4_from_FP2(&(w->c), &w3);
+
+    FP4_norm(&(w->a));
+    FP4_norm(&(w->b));
+#endif
+//  } else {
+#if SEXTIC_TWIST_ZZZ == M_TYPE
+    FP2_mul(&w1, &(w->a).a, &(y->a).a); // A1.A2
+    FP2_mul(&w2, &(w->a).b, &(y->a).b); // B1.B2
+
+    if (y->type == FP_SPARSEST || w->type == FP_SPARSEST)
+    {
+        if (y->type == FP_SPARSEST && w->type == FP_SPARSEST)
+        {
+            FP_mul(&w3.a, &(w->c).b.a, &(y->c).b.a);
+            FP_zero(&w3.b);
+        } else {
+            if (y->type != FP_SPARSEST)
+                FP2_pmul(&w3, &(y->c).b, &(w->c).b.a);
+            if (w->type != FP_SPARSEST)
+                FP2_pmul(&w3, &(w->c).b, &(y->c).b.a);
+        }
+    }
+    else
+        FP2_mul(&w3, &(w->c).b, &(y->c).b); // F1.F2
+
+    FP2_add(&ta, &(w->a).a, &(w->a).b); // A1+B1
+    FP2_add(&tb, &(y->a).a, &(y->a).b); // A2+B2
+    FP2_norm(&ta);
+    FP2_norm(&tb);
+    FP2_mul(&tc, &ta, &tb);         // (A1+B1)(A2+B2)
+    FP2_add(&t, &w1, &w2);
+    FP2_neg(&t, &t);
+    FP2_add(&tc, &tc, &t);          // (A1+B1)(A2+B2)-A1.A2-B1*B2 =  (A1.B2+A2.B1)
+
+    FP2_add(&ta, &(w->a).a, &(w->c).b); // A1+F1
+    FP2_add(&tb, &(y->a).a, &(y->c).b); // A2+F2
+    FP2_norm(&ta);
+    FP2_norm(&tb);
+    FP2_mul(&td, &ta, &tb);         // (A1+F1)(A2+F2)
+    FP2_add(&t, &w1, &w3);
+    FP2_neg(&t, &t);
+    FP2_add(&td, &td, &t);          // (A1+F1)(A2+F2)-A1.A2-F1*F2 =  (A1.F2+A2.F1)
+
+    FP2_add(&ta, &(w->a).b, &(w->c).b); // B1+F1
+    FP2_add(&tb, &(y->a).b, &(y->c).b); // B2+F2
+    FP2_norm(&ta);
+    FP2_norm(&tb);
+    FP2_mul(&te, &ta, &tb);         // (B1+F1)(B2+F2)
+    FP2_add(&t, &w2, &w3);
+    FP2_neg(&t, &t);
+    FP2_add(&te, &te, &t);          // (B1+F1)(B2+F2)-B1.B2-F1*F2 =  (B1.F2+B2.F1)
+
+    FP2_mul_ip(&w2);
+    FP2_add(&w1, &w1, &w2);
+    FP4_from_FP2s(&(w->a), &w1, &tc);
+
+    FP2_mul_ip(&w3);
+    FP2_norm(&w3);
+    FP4_from_FP2H(&(w->b), &w3);
+
+    FP2_norm(&te);
+    FP2_mul_ip(&te);
+    FP4_from_FP2s(&(w->c), &te, &td);
+
+    FP4_norm(&(w->a));
+    FP4_norm(&(w->c));
+#endif
+
+//  }
+    w->type = FP_SPARSE;
+}
+
+/* Set w=1/x */
+/* SU= 600 */
+void YYY::FP12_inv(FP12 *w, FP12 *x)
+{
+    FP4 f0, f1, f2, f3;
+
+    FP4_sqr(&f0, &(x->a));
+    FP4_mul(&f1, &(x->b), &(x->c));
+    FP4_times_i(&f1);
+    FP4_sub(&f0, &f0, &f1); /* y.a */
+    FP4_norm(&f0);
+
+    FP4_sqr(&f1, &(x->c));
+    FP4_times_i(&f1);
+    FP4_mul(&f2, &(x->a), &(x->b));
+    FP4_sub(&f1, &f1, &f2); /* y.b */
+    FP4_norm(&f1);
+
+    FP4_sqr(&f2, &(x->b));
+    FP4_mul(&f3, &(x->a), &(x->c));
+    FP4_sub(&f2, &f2, &f3); /* y.c */
+    FP4_norm(&f2);
+
+    FP4_mul(&f3, &(x->b), &f2);
+    FP4_times_i(&f3);
+    FP4_mul(&(w->a), &f0, &(x->a));
+    FP4_add(&f3, &(w->a), &f3);
+    FP4_mul(&(w->c), &f1, &(x->c));
+    FP4_times_i(&(w->c));
+
+    FP4_add(&f3, &(w->c), &f3);
+    FP4_norm(&f3);
+
+    FP4_inv(&f3, &f3, NULL);
+
+    FP4_mul(&(w->a), &f0, &f3);
+    FP4_mul(&(w->b), &f1, &f3);
+    FP4_mul(&(w->c), &f2, &f3);
+    w->type = FP_DENSE;
+}
+
+/* constant time powering by small integer of max length bts */
+
+void YYY::FP12_pinpow(FP12 *r, int e, int bts)
+{
+    int i, b;
+    FP12 R[2];
+
+    FP12_one(&R[0]);
+    FP12_copy(&R[1], r);
+
+    for (i = bts - 1; i >= 0; i--)
+    {
+        b = (e >> i) & 1;
+        FP12_mul(&R[1 - b], &R[b]);
+        FP12_usqr(&R[b], &R[b]);
+    }
+    FP12_copy(r, &R[0]);
+}
+
+/* Compressed powering of unitary elements y=x^(e mod r) */
+
+void YYY::FP12_compow(FP4 *c, FP12 *x, BIG e, BIG r)
+{
+    FP12 g1, g2;
+    FP4 cp, cpm1, cpm2;
+    FP2 f;
+    BIG q, a, b, m;
+
+    BIG_rcopy(a, Fra);
+    BIG_rcopy(b, Frb);
+    FP2_from_BIGs(&f, a, b);
+
+    BIG_rcopy(q, Modulus);
+
+    FP12_copy(&g1, x);
+    FP12_copy(&g2, x);
+
+    BIG_copy(m, q);
+    BIG_mod(m, r);
+
+    BIG_copy(a, e);
+    BIG_mod(a, m);
+
+    BIG_copy(b, e);
+    BIG_sdiv(b, m);
+
+    FP12_trace(c, &g1);
+
+    if (BIG_iszilch(b))
+    {
+        FP4_xtr_pow(c, c, e);
+        return;
+    }
+
+    FP12_frob(&g2, &f);
+    FP12_trace(&cp, &g2);
+
+    FP12_conj(&g1, &g1);
+    FP12_mul(&g2, &g1);
+    FP12_trace(&cpm1, &g2);
+    FP12_mul(&g2, &g1);
+    FP12_trace(&cpm2, &g2);
+
+    FP4_xtr_pow2(c, &cp, c, &cpm1, &cpm2, a, b);
+
+}
+
+/* Note this is simple square and multiply, so not side-channel safe */
+/* But fast for final exponentiation where exponent is not a secret */
+
+void YYY::FP12_pow(FP12 *r, FP12 *a, BIG b)
+{
+    FP12 w, sf;
+    BIG b1, b3;
+    int i, nb, bt;
+    BIG_copy(b1, b);
+    BIG_norm(b1);
+    BIG_pmul(b3, b1, 3);
+    BIG_norm(b3);
+    FP12_copy(&sf, a);
+    FP12_norm(&sf);
+    FP12_copy(&w, &sf);
+
+    if (BIG_iszilch(b3))
+    {
+        FP12_one(r);
+        return;
+    }
+
+    nb = BIG_nbits(b3);
+    for (i = nb - 2; i >= 1; i--)
+    {
+        FP12_usqr(&w, &w);
+        bt = BIG_bit(b3, i) - BIG_bit(b1, i);
+        if (bt == 1)
+            FP12_mul(&w, &sf);
+        if (bt == -1)
+        {
+            FP12_conj(&sf, &sf);
+            FP12_mul(&w, &sf);
+            FP12_conj(&sf, &sf);
+        }
+    }
+
+    FP12_copy(r, &w);
+    FP12_reduce(r);
+
+
+}
+
+
+/* p=q0^u0.q1^u1.q2^u2.q3^u3 */
+/* Side channel attack secure */
+// Bos & Costello https://eprint.iacr.org/2013/458.pdf
+// Faz-Hernandez & Longa & Sanchez  https://eprint.iacr.org/2013/158.pdf
+
+void YYY::FP12_pow4(FP12 *p, FP12 *q, BIG u[4])
+{
+    int i, j, k, nb, pb, bt;
+    FP12 g[8], r;
+    BIG t[4], mt;
+    sign8 w[NLEN_XXX * BASEBITS_XXX + 1];
+    sign8 s[NLEN_XXX * BASEBITS_XXX + 1];
+
+    for (i = 0; i < 4; i++)
+        BIG_copy(t[i], u[i]);
+
+
+// Precomputed table
+    FP12_copy(&g[0], &q[0]); // q[0]
+    FP12_copy(&g[1], &g[0]);
+    FP12_mul(&g[1], &q[1]); // q[0].q[1]
+    FP12_copy(&g[2], &g[0]);
+    FP12_mul(&g[2], &q[2]); // q[0].q[2]
+    FP12_copy(&g[3], &g[1]);
+    FP12_mul(&g[3], &q[2]); // q[0].q[1].q[2]
+    FP12_copy(&g[4], &g[0]);
+    FP12_mul(&g[4], &q[3]); // q[0].q[3]
+    FP12_copy(&g[5], &g[1]);
+    FP12_mul(&g[5], &q[3]); // q[0].q[1].q[3]
+    FP12_copy(&g[6], &g[2]);
+    FP12_mul(&g[6], &q[3]); // q[0].q[2].q[3]
+    FP12_copy(&g[7], &g[3]);
+    FP12_mul(&g[7], &q[3]); // q[0].q[1].q[2].q[3]
+
+// Make it odd
+    pb = 1 - BIG_parity(t[0]);
+    BIG_inc(t[0], pb);
+    BIG_norm(t[0]);
+
+// Number of bits
+    BIG_zero(mt);
+    for (i = 0; i < 4; i++)
+    {
+        BIG_or(mt, mt, t[i]);
+    }
+    nb = 1 + BIG_nbits(mt);
+
+// Sign pivot
+    s[nb - 1] = 1;
+    for (i = 0; i < nb - 1; i++)
+    {
+        BIG_fshr(t[0], 1);
+        s[i] = 2 * BIG_parity(t[0]) - 1;
+    }
+
+// Recoded exponent
+    for (i = 0; i < nb; i++)
+    {
+        w[i] = 0;
+        k = 1;
+        for (j = 1; j < 4; j++)
+        {
+            bt = s[i] * BIG_parity(t[j]);
+            BIG_fshr(t[j], 1);
+
+            BIG_dec(t[j], (bt >> 1));
+            BIG_norm(t[j]);
+            w[i] += bt * k;
+            k *= 2;
+        }
+    }
+
+// Main loop
+    FP12_select(p, g, 2 * w[nb - 1] + 1);
+    for (i = nb - 2; i >= 0; i--)
+    {
+        FP12_select(&r, g, 2 * w[i] + s[i]);
+        FP12_usqr(p, p);
+        FP12_mul(p, &r);
+    }
+// apply correction
+    FP12_conj(&r, &q[0]);
+    FP12_mul(&r, p);
+    FP12_cmove(p, &r, pb);
+
+    FP12_reduce(p);
+}
+
+/* Set w=w^p using Frobenius */
+/* SU= 160 */
+void YYY::FP12_frob(FP12 *w, FP2 *f)
+{
+    FP2 f2, f3;
+    FP2_sqr(&f2, f);    /* f2=f^2 */
+    FP2_mul(&f3, &f2, f); /* f3=f^3 */
+
+    FP4_frob(&(w->a), &f3);
+    FP4_frob(&(w->b), &f3);
+    FP4_frob(&(w->c), &f3);
+
+    FP4_pmul(&(w->b), &(w->b), f);
+    FP4_pmul(&(w->c), &(w->c), &f2);
+    w->type = FP_DENSE;
+}
+
+/* SU= 8 */
+/* normalise all components of w */
+void YYY::FP12_norm(FP12 *w)
+{
+    FP4_norm(&(w->a));
+    FP4_norm(&(w->b));
+    FP4_norm(&(w->c));
+}
+
+/* SU= 8 */
+/* reduce all components of w */
+void YYY::FP12_reduce(FP12 *w)
+{
+    FP4_reduce(&(w->a));
+    FP4_reduce(&(w->b));
+    FP4_reduce(&(w->c));
+}
+
+/* trace function w=trace(x) */
+/* SU= 8 */
+void YYY::FP12_trace(FP4 *w, FP12 *x)
+{
+    FP4_imul(w, &(x->a), 3);
+    FP4_reduce(w);
+}
+
+/* SU= 8 */
+/* Output w in hex */
+void YYY::FP12_output(FP12 *w)
+{
+    printf("[");
+    FP4_output(&(w->a));
+    printf(",");
+    FP4_output(&(w->b));
+    printf(",");
+    FP4_output(&(w->c));
+    printf("]");
+}
+
+/* SU= 64 */
+/* Convert g to octet string w */
+void YYY::FP12_toOctet(octet *W, FP12 *g)
+{
+    W->len = 12 * MODBYTES_XXX;
+    FP4_toBytes(&(W->val[0]),&(g->c));
+    FP4_toBytes(&(W->val[4 * MODBYTES_XXX]),&(g->b));
+    FP4_toBytes(&(W->val[8 * MODBYTES_XXX]),&(g->a));
+}
+
+/* SU= 24 */
+/* Restore g from octet string w */
+void YYY::FP12_fromOctet(FP12 *g, octet *W)
+{
+    FP4_fromBytes(&(g->c),&(W->val[0]));
+    FP4_fromBytes(&(g->b),&(W->val[4 * MODBYTES_XXX]));
+    FP4_fromBytes(&(g->a),&(W->val[8 * MODBYTES_XXX]));
+
+}
+
+/* Move g to f
+if d=1 */
+void YYY::FP12_cmove(FP12 *f, FP12 *g, int d)
+{
+    FP4_cmove(&(f->a), &(g->a), d);
+    FP4_cmove(&(f->b), &(g->b), d);
+    FP4_cmove(&(f->c), &(g->c), d);
+    d = ~(d - 1);
+    f->type ^= (f->type ^ g->type)&d;
+}
+
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp12.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp12.h
new file mode 100644
index 0000000..5bd7b69
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp12.h
@@ -0,0 +1,230 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP12_YYY_H
+#define FP12_YYY_H
+
+#include "fp4_YYY.h"
+
+using namespace core;
+
+namespace YYY {
+/**
+	@brief FP12 Structure - towered over three FP4
+*/
+
+typedef struct
+{
+    FP4 a; /**< first part of FP12 */
+    FP4 b; /**< second part of FP12 */
+    FP4 c; /**< third part of FP12 */
+    int type;
+} FP12;
+
+extern const XXX::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const XXX::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+/* FP12 prototypes */
+/**	@brief Tests for FP12 equal to zero
+ *
+	@param x FP12 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP12_iszilch(FP12 *x);
+/**	@brief Tests for FP12 equal to unity
+ *
+	@param x FP12 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP12_isunity(FP12 *x);
+/**	@brief Copy FP12 to another FP12
+ *
+	@param x FP12 instance, on exit = y
+	@param y FP12 instance to be copied
+ */
+extern void FP12_copy(FP12 *x, FP12 *y);
+/**	@brief Set FP12 to unity
+ *
+	@param x FP12 instance to be set to one
+ */
+extern void FP12_one(FP12 *x);
+
+/**	@brief Set FP12 to zero
+ *
+	@param x FP12 instance to be set to zero
+ */
+extern void FP12_zero(FP12 *x);
+
+/**	@brief Tests for equality of two FP12s
+ *
+	@param x FP12 instance to be compared
+	@param y FP12 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP12_equals(FP12 *x, FP12 *y);
+/**	@brief Conjugation of FP12
+ *
+	If y=(a,b,c) (where a,b,c are its three FP4 components) on exit x=(conj(a),-conj(b),conj(c))
+	@param x FP12 instance, on exit = conj(y)
+	@param y FP12 instance
+ */
+extern void FP12_conj(FP12 *x, FP12 *y);
+/**	@brief Initialise FP12 from single FP4
+ *
+	Sets first FP4 component of an FP12, other components set to zero
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP4
+ */
+extern void FP12_from_FP4(FP12 *x, FP4 *a);
+/**	@brief Initialise FP12 from three FP4s
+ *
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP12
+	@param b FP4 to form second part of FP12
+	@param c FP4 to form third part of FP12
+ */
+extern void FP12_from_FP4s(FP12 *x, FP4 *a, FP4* b, FP4 *c);
+/**	@brief Fast Squaring of an FP12 in "unitary" form
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP4 instance, must be unitary
+ */
+extern void FP12_usqr(FP12 *x, FP12 *y);
+/**	@brief Squaring an FP12
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP12 instance
+ */
+extern void FP12_sqr(FP12 *x, FP12 *y);
+/**	@brief Fast multiplication of two sparse FP12s that arises from ATE pairing line functions
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_smul(FP12 *x, FP12 *y);
+
+/**	@brief Fast multiplication of what may be sparse multiplicands
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_ssmul(FP12 *x, FP12 *y);
+
+
+/**	@brief Full unconditional Multiplication of two FP12s
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, the multiplier
+ */
+extern void FP12_mul(FP12 *x, FP12 *y);
+
+/**	@brief Inverting an FP12
+ *
+	@param x FP12 instance, on exit = 1/y
+	@param y FP12 instance
+	@param t D_TYPE or M_TYPE twist
+ */
+extern void FP12_inv(FP12 *x, FP12 *y);
+/**	@brief Raises an FP12 to the power of a BIG
+ *
+	@param r FP12 instance, on exit = y^b
+	@param x FP12 instance
+	@param b BIG number
+ */
+extern void FP12_pow(FP12 *r, FP12 *x, XXX::BIG b);
+/**	@brief Raises an FP12 instance x to a small integer power, side-channel resistant
+ *
+	@param x FP12 instance, on exit = x^i
+	@param i small integer exponent
+	@param b maximum number of bits in exponent
+ */
+extern void FP12_pinpow(FP12 *x, int i, int b);
+
+/**	@brief Raises an FP12 instance x to a BIG power, compressed to FP4
+ *
+	@param c FP4 instance, on exit = x^(e mod r) as FP4
+	@param x FP12 input
+	@param e BIG exponent
+	@param r BIG group order
+ */
+extern void FP12_compow(FP4 *c, FP12 *x, XXX::BIG e, XXX::BIG r);
+
+/**	@brief Calculate x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3], side-channel resistant
+ *
+	@param r FP12 instance, on exit = x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3]
+	@param x FP12 array with 4 FP12s
+	@param b BIG array of 4 exponents
+ */
+extern void FP12_pow4(FP12 *r, FP12 *x, XXX::BIG *b);
+/**	@brief Raises an FP12 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP12 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP12_frob(FP12 *x, FP2 *f);
+/**	@brief Reduces all components of possibly unreduced FP12 mod Modulus
+ *
+	@param x FP12 instance, on exit reduced mod Modulus
+ */
+extern void FP12_reduce(FP12 *x);
+/**	@brief Normalises the components of an FP12
+ *
+	@param x FP12 instance to be normalised
+ */
+extern void FP12_norm(FP12 *x);
+/**	@brief Formats and outputs an FP12 to the console
+ *
+	@param x FP12 instance to be printed
+ */
+extern void FP12_output(FP12 *x);
+/**	@brief Formats and outputs an FP12 instance to an octet string
+ *
+	Serializes the components of an FP12 to big-endian base 256 form.
+	@param S output octet string
+	@param x FP12 instance to be converted to an octet string
+ */
+extern void FP12_toOctet(octet *S, FP12 *x);
+/**	@brief Creates an FP12 instance from an octet string
+ *
+	De-serializes the components of an FP12 to create an FP12 from big-endian base 256 components.
+	@param x FP12 instance to be created from an octet string
+	@param S input octet string
+
+ */
+extern void FP12_fromOctet(FP12 *x, octet *S);
+/**	@brief Calculate the trace of an FP12
+ *
+	@param t FP4 trace of x, on exit = tr(x)
+	@param x FP12 instance
+
+ */
+extern void FP12_trace(FP4 *t, FP12 *x);
+
+/**	@brief Conditional copy of FP12 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP12 instance, set to y if s!=0
+	@param y another FP12 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP12_cmove(FP12 *x, FP12 *y, int s);
+
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp12_BLS12381.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp12_BLS12381.h
new file mode 100644
index 0000000..9e5135a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp12_BLS12381.h
@@ -0,0 +1,230 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP12_BLS12381_H
+#define FP12_BLS12381_H
+
+#include "fp4_BLS12381.h"
+
+using namespace core;
+
+namespace BLS12381 {
+/**
+	@brief FP12 Structure - towered over three FP4
+*/
+
+typedef struct
+{
+    FP4 a; /**< first part of FP12 */
+    FP4 b; /**< second part of FP12 */
+    FP4 c; /**< third part of FP12 */
+    int type;
+} FP12;
+
+extern const B384_58::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B384_58::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+/* FP12 prototypes */
+/**	@brief Tests for FP12 equal to zero
+ *
+	@param x FP12 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP12_iszilch(FP12 *x);
+/**	@brief Tests for FP12 equal to unity
+ *
+	@param x FP12 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP12_isunity(FP12 *x);
+/**	@brief Copy FP12 to another FP12
+ *
+	@param x FP12 instance, on exit = y
+	@param y FP12 instance to be copied
+ */
+extern void FP12_copy(FP12 *x, FP12 *y);
+/**	@brief Set FP12 to unity
+ *
+	@param x FP12 instance to be set to one
+ */
+extern void FP12_one(FP12 *x);
+
+/**	@brief Set FP12 to zero
+ *
+	@param x FP12 instance to be set to zero
+ */
+extern void FP12_zero(FP12 *x);
+
+/**	@brief Tests for equality of two FP12s
+ *
+	@param x FP12 instance to be compared
+	@param y FP12 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP12_equals(FP12 *x, FP12 *y);
+/**	@brief Conjugation of FP12
+ *
+	If y=(a,b,c) (where a,b,c are its three FP4 components) on exit x=(conj(a),-conj(b),conj(c))
+	@param x FP12 instance, on exit = conj(y)
+	@param y FP12 instance
+ */
+extern void FP12_conj(FP12 *x, FP12 *y);
+/**	@brief Initialise FP12 from single FP4
+ *
+	Sets first FP4 component of an FP12, other components set to zero
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP4
+ */
+extern void FP12_from_FP4(FP12 *x, FP4 *a);
+/**	@brief Initialise FP12 from three FP4s
+ *
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP12
+	@param b FP4 to form second part of FP12
+	@param c FP4 to form third part of FP12
+ */
+extern void FP12_from_FP4s(FP12 *x, FP4 *a, FP4* b, FP4 *c);
+/**	@brief Fast Squaring of an FP12 in "unitary" form
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP4 instance, must be unitary
+ */
+extern void FP12_usqr(FP12 *x, FP12 *y);
+/**	@brief Squaring an FP12
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP12 instance
+ */
+extern void FP12_sqr(FP12 *x, FP12 *y);
+/**	@brief Fast multiplication of two sparse FP12s that arises from ATE pairing line functions
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_smul(FP12 *x, FP12 *y);
+
+/**	@brief Fast multiplication of what may be sparse multiplicands
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_ssmul(FP12 *x, FP12 *y);
+
+
+/**	@brief Full unconditional Multiplication of two FP12s
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, the multiplier
+ */
+extern void FP12_mul(FP12 *x, FP12 *y);
+
+/**	@brief Inverting an FP12
+ *
+	@param x FP12 instance, on exit = 1/y
+	@param y FP12 instance
+	@param t D_TYPE or M_TYPE twist
+ */
+extern void FP12_inv(FP12 *x, FP12 *y);
+/**	@brief Raises an FP12 to the power of a BIG
+ *
+	@param r FP12 instance, on exit = y^b
+	@param x FP12 instance
+	@param b BIG number
+ */
+extern void FP12_pow(FP12 *r, FP12 *x, B384_58::BIG b);
+/**	@brief Raises an FP12 instance x to a small integer power, side-channel resistant
+ *
+	@param x FP12 instance, on exit = x^i
+	@param i small integer exponent
+	@param b maximum number of bits in exponent
+ */
+extern void FP12_pinpow(FP12 *x, int i, int b);
+
+/**	@brief Raises an FP12 instance x to a BIG power, compressed to FP4
+ *
+	@param c FP4 instance, on exit = x^(e mod r) as FP4
+	@param x FP12 input
+	@param e BIG exponent
+	@param r BIG group order
+ */
+extern void FP12_compow(FP4 *c, FP12 *x, B384_58::BIG e, B384_58::BIG r);
+
+/**	@brief Calculate x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3], side-channel resistant
+ *
+	@param r FP12 instance, on exit = x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3]
+	@param x FP12 array with 4 FP12s
+	@param b BIG array of 4 exponents
+ */
+extern void FP12_pow4(FP12 *r, FP12 *x, B384_58::BIG *b);
+/**	@brief Raises an FP12 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP12 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP12_frob(FP12 *x, FP2 *f);
+/**	@brief Reduces all components of possibly unreduced FP12 mod Modulus
+ *
+	@param x FP12 instance, on exit reduced mod Modulus
+ */
+extern void FP12_reduce(FP12 *x);
+/**	@brief Normalises the components of an FP12
+ *
+	@param x FP12 instance to be normalised
+ */
+extern void FP12_norm(FP12 *x);
+/**	@brief Formats and outputs an FP12 to the console
+ *
+	@param x FP12 instance to be printed
+ */
+extern void FP12_output(FP12 *x);
+/**	@brief Formats and outputs an FP12 instance to an octet string
+ *
+	Serializes the components of an FP12 to big-endian base 256 form.
+	@param S output octet string
+	@param x FP12 instance to be converted to an octet string
+ */
+extern void FP12_toOctet(octet *S, FP12 *x);
+/**	@brief Creates an FP12 instance from an octet string
+ *
+	De-serializes the components of an FP12 to create an FP12 from big-endian base 256 components.
+	@param x FP12 instance to be created from an octet string
+	@param S input octet string
+
+ */
+extern void FP12_fromOctet(FP12 *x, octet *S);
+/**	@brief Calculate the trace of an FP12
+ *
+	@param t FP4 trace of x, on exit = tr(x)
+	@param x FP12 instance
+
+ */
+extern void FP12_trace(FP4 *t, FP12 *x);
+
+/**	@brief Conditional copy of FP12 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP12 instance, set to y if s!=0
+	@param y another FP12 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP12_cmove(FP12 *x, FP12 *y, int s);
+
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp12_BLS12383.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp12_BLS12383.h
new file mode 100644
index 0000000..5fd942b
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp12_BLS12383.h
@@ -0,0 +1,230 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP12_BLS12383_H
+#define FP12_BLS12383_H
+
+#include "fp4_BLS12383.h"
+
+using namespace core;
+
+namespace BLS12383 {
+/**
+	@brief FP12 Structure - towered over three FP4
+*/
+
+typedef struct
+{
+    FP4 a; /**< first part of FP12 */
+    FP4 b; /**< second part of FP12 */
+    FP4 c; /**< third part of FP12 */
+    int type;
+} FP12;
+
+extern const B384_58::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B384_58::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+/* FP12 prototypes */
+/**	@brief Tests for FP12 equal to zero
+ *
+	@param x FP12 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP12_iszilch(FP12 *x);
+/**	@brief Tests for FP12 equal to unity
+ *
+	@param x FP12 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP12_isunity(FP12 *x);
+/**	@brief Copy FP12 to another FP12
+ *
+	@param x FP12 instance, on exit = y
+	@param y FP12 instance to be copied
+ */
+extern void FP12_copy(FP12 *x, FP12 *y);
+/**	@brief Set FP12 to unity
+ *
+	@param x FP12 instance to be set to one
+ */
+extern void FP12_one(FP12 *x);
+
+/**	@brief Set FP12 to zero
+ *
+	@param x FP12 instance to be set to zero
+ */
+extern void FP12_zero(FP12 *x);
+
+/**	@brief Tests for equality of two FP12s
+ *
+	@param x FP12 instance to be compared
+	@param y FP12 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP12_equals(FP12 *x, FP12 *y);
+/**	@brief Conjugation of FP12
+ *
+	If y=(a,b,c) (where a,b,c are its three FP4 components) on exit x=(conj(a),-conj(b),conj(c))
+	@param x FP12 instance, on exit = conj(y)
+	@param y FP12 instance
+ */
+extern void FP12_conj(FP12 *x, FP12 *y);
+/**	@brief Initialise FP12 from single FP4
+ *
+	Sets first FP4 component of an FP12, other components set to zero
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP4
+ */
+extern void FP12_from_FP4(FP12 *x, FP4 *a);
+/**	@brief Initialise FP12 from three FP4s
+ *
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP12
+	@param b FP4 to form second part of FP12
+	@param c FP4 to form third part of FP12
+ */
+extern void FP12_from_FP4s(FP12 *x, FP4 *a, FP4* b, FP4 *c);
+/**	@brief Fast Squaring of an FP12 in "unitary" form
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP4 instance, must be unitary
+ */
+extern void FP12_usqr(FP12 *x, FP12 *y);
+/**	@brief Squaring an FP12
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP12 instance
+ */
+extern void FP12_sqr(FP12 *x, FP12 *y);
+/**	@brief Fast multiplication of two sparse FP12s that arises from ATE pairing line functions
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_smul(FP12 *x, FP12 *y);
+
+/**	@brief Fast multiplication of what may be sparse multiplicands
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_ssmul(FP12 *x, FP12 *y);
+
+
+/**	@brief Full unconditional Multiplication of two FP12s
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, the multiplier
+ */
+extern void FP12_mul(FP12 *x, FP12 *y);
+
+/**	@brief Inverting an FP12
+ *
+	@param x FP12 instance, on exit = 1/y
+	@param y FP12 instance
+	@param t D_TYPE or M_TYPE twist
+ */
+extern void FP12_inv(FP12 *x, FP12 *y);
+/**	@brief Raises an FP12 to the power of a BIG
+ *
+	@param r FP12 instance, on exit = y^b
+	@param x FP12 instance
+	@param b BIG number
+ */
+extern void FP12_pow(FP12 *r, FP12 *x, B384_58::BIG b);
+/**	@brief Raises an FP12 instance x to a small integer power, side-channel resistant
+ *
+	@param x FP12 instance, on exit = x^i
+	@param i small integer exponent
+	@param b maximum number of bits in exponent
+ */
+extern void FP12_pinpow(FP12 *x, int i, int b);
+
+/**	@brief Raises an FP12 instance x to a BIG power, compressed to FP4
+ *
+	@param c FP4 instance, on exit = x^(e mod r) as FP4
+	@param x FP12 input
+	@param e BIG exponent
+	@param r BIG group order
+ */
+extern void FP12_compow(FP4 *c, FP12 *x, B384_58::BIG e, B384_58::BIG r);
+
+/**	@brief Calculate x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3], side-channel resistant
+ *
+	@param r FP12 instance, on exit = x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3]
+	@param x FP12 array with 4 FP12s
+	@param b BIG array of 4 exponents
+ */
+extern void FP12_pow4(FP12 *r, FP12 *x, B384_58::BIG *b);
+/**	@brief Raises an FP12 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP12 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP12_frob(FP12 *x, FP2 *f);
+/**	@brief Reduces all components of possibly unreduced FP12 mod Modulus
+ *
+	@param x FP12 instance, on exit reduced mod Modulus
+ */
+extern void FP12_reduce(FP12 *x);
+/**	@brief Normalises the components of an FP12
+ *
+	@param x FP12 instance to be normalised
+ */
+extern void FP12_norm(FP12 *x);
+/**	@brief Formats and outputs an FP12 to the console
+ *
+	@param x FP12 instance to be printed
+ */
+extern void FP12_output(FP12 *x);
+/**	@brief Formats and outputs an FP12 instance to an octet string
+ *
+	Serializes the components of an FP12 to big-endian base 256 form.
+	@param S output octet string
+	@param x FP12 instance to be converted to an octet string
+ */
+extern void FP12_toOctet(octet *S, FP12 *x);
+/**	@brief Creates an FP12 instance from an octet string
+ *
+	De-serializes the components of an FP12 to create an FP12 from big-endian base 256 components.
+	@param x FP12 instance to be created from an octet string
+	@param S input octet string
+
+ */
+extern void FP12_fromOctet(FP12 *x, octet *S);
+/**	@brief Calculate the trace of an FP12
+ *
+	@param t FP4 trace of x, on exit = tr(x)
+	@param x FP12 instance
+
+ */
+extern void FP12_trace(FP4 *t, FP12 *x);
+
+/**	@brief Conditional copy of FP12 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP12 instance, set to y if s!=0
+	@param y another FP12 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP12_cmove(FP12 *x, FP12 *y, int s);
+
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp12_BLS12443.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp12_BLS12443.h
new file mode 100644
index 0000000..d2b98bd
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp12_BLS12443.h
@@ -0,0 +1,230 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP12_BLS12443_H
+#define FP12_BLS12443_H
+
+#include "fp4_BLS12443.h"
+
+using namespace core;
+
+namespace BLS12443 {
+/**
+	@brief FP12 Structure - towered over three FP4
+*/
+
+typedef struct
+{
+    FP4 a; /**< first part of FP12 */
+    FP4 b; /**< second part of FP12 */
+    FP4 c; /**< third part of FP12 */
+    int type;
+} FP12;
+
+extern const B448_60::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B448_60::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+/* FP12 prototypes */
+/**	@brief Tests for FP12 equal to zero
+ *
+	@param x FP12 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP12_iszilch(FP12 *x);
+/**	@brief Tests for FP12 equal to unity
+ *
+	@param x FP12 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP12_isunity(FP12 *x);
+/**	@brief Copy FP12 to another FP12
+ *
+	@param x FP12 instance, on exit = y
+	@param y FP12 instance to be copied
+ */
+extern void FP12_copy(FP12 *x, FP12 *y);
+/**	@brief Set FP12 to unity
+ *
+	@param x FP12 instance to be set to one
+ */
+extern void FP12_one(FP12 *x);
+
+/**	@brief Set FP12 to zero
+ *
+	@param x FP12 instance to be set to zero
+ */
+extern void FP12_zero(FP12 *x);
+
+/**	@brief Tests for equality of two FP12s
+ *
+	@param x FP12 instance to be compared
+	@param y FP12 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP12_equals(FP12 *x, FP12 *y);
+/**	@brief Conjugation of FP12
+ *
+	If y=(a,b,c) (where a,b,c are its three FP4 components) on exit x=(conj(a),-conj(b),conj(c))
+	@param x FP12 instance, on exit = conj(y)
+	@param y FP12 instance
+ */
+extern void FP12_conj(FP12 *x, FP12 *y);
+/**	@brief Initialise FP12 from single FP4
+ *
+	Sets first FP4 component of an FP12, other components set to zero
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP4
+ */
+extern void FP12_from_FP4(FP12 *x, FP4 *a);
+/**	@brief Initialise FP12 from three FP4s
+ *
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP12
+	@param b FP4 to form second part of FP12
+	@param c FP4 to form third part of FP12
+ */
+extern void FP12_from_FP4s(FP12 *x, FP4 *a, FP4* b, FP4 *c);
+/**	@brief Fast Squaring of an FP12 in "unitary" form
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP4 instance, must be unitary
+ */
+extern void FP12_usqr(FP12 *x, FP12 *y);
+/**	@brief Squaring an FP12
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP12 instance
+ */
+extern void FP12_sqr(FP12 *x, FP12 *y);
+/**	@brief Fast multiplication of two sparse FP12s that arises from ATE pairing line functions
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_smul(FP12 *x, FP12 *y);
+
+/**	@brief Fast multiplication of what may be sparse multiplicands
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_ssmul(FP12 *x, FP12 *y);
+
+
+/**	@brief Full unconditional Multiplication of two FP12s
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, the multiplier
+ */
+extern void FP12_mul(FP12 *x, FP12 *y);
+
+/**	@brief Inverting an FP12
+ *
+	@param x FP12 instance, on exit = 1/y
+	@param y FP12 instance
+	@param t D_TYPE or M_TYPE twist
+ */
+extern void FP12_inv(FP12 *x, FP12 *y);
+/**	@brief Raises an FP12 to the power of a BIG
+ *
+	@param r FP12 instance, on exit = y^b
+	@param x FP12 instance
+	@param b BIG number
+ */
+extern void FP12_pow(FP12 *r, FP12 *x, B448_60::BIG b);
+/**	@brief Raises an FP12 instance x to a small integer power, side-channel resistant
+ *
+	@param x FP12 instance, on exit = x^i
+	@param i small integer exponent
+	@param b maximum number of bits in exponent
+ */
+extern void FP12_pinpow(FP12 *x, int i, int b);
+
+/**	@brief Raises an FP12 instance x to a BIG power, compressed to FP4
+ *
+	@param c FP4 instance, on exit = x^(e mod r) as FP4
+	@param x FP12 input
+	@param e BIG exponent
+	@param r BIG group order
+ */
+extern void FP12_compow(FP4 *c, FP12 *x, B448_60::BIG e, B448_60::BIG r);
+
+/**	@brief Calculate x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3], side-channel resistant
+ *
+	@param r FP12 instance, on exit = x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3]
+	@param x FP12 array with 4 FP12s
+	@param b BIG array of 4 exponents
+ */
+extern void FP12_pow4(FP12 *r, FP12 *x, B448_60::BIG *b);
+/**	@brief Raises an FP12 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP12 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP12_frob(FP12 *x, FP2 *f);
+/**	@brief Reduces all components of possibly unreduced FP12 mod Modulus
+ *
+	@param x FP12 instance, on exit reduced mod Modulus
+ */
+extern void FP12_reduce(FP12 *x);
+/**	@brief Normalises the components of an FP12
+ *
+	@param x FP12 instance to be normalised
+ */
+extern void FP12_norm(FP12 *x);
+/**	@brief Formats and outputs an FP12 to the console
+ *
+	@param x FP12 instance to be printed
+ */
+extern void FP12_output(FP12 *x);
+/**	@brief Formats and outputs an FP12 instance to an octet string
+ *
+	Serializes the components of an FP12 to big-endian base 256 form.
+	@param S output octet string
+	@param x FP12 instance to be converted to an octet string
+ */
+extern void FP12_toOctet(octet *S, FP12 *x);
+/**	@brief Creates an FP12 instance from an octet string
+ *
+	De-serializes the components of an FP12 to create an FP12 from big-endian base 256 components.
+	@param x FP12 instance to be created from an octet string
+	@param S input octet string
+
+ */
+extern void FP12_fromOctet(FP12 *x, octet *S);
+/**	@brief Calculate the trace of an FP12
+ *
+	@param t FP4 trace of x, on exit = tr(x)
+	@param x FP12 instance
+
+ */
+extern void FP12_trace(FP4 *t, FP12 *x);
+
+/**	@brief Conditional copy of FP12 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP12 instance, set to y if s!=0
+	@param y another FP12 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP12_cmove(FP12 *x, FP12 *y, int s);
+
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp12_BLS12461.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp12_BLS12461.h
new file mode 100644
index 0000000..7717d3f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp12_BLS12461.h
@@ -0,0 +1,230 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP12_BLS12461_H
+#define FP12_BLS12461_H
+
+#include "fp4_BLS12461.h"
+
+using namespace core;
+
+namespace BLS12461 {
+/**
+	@brief FP12 Structure - towered over three FP4
+*/
+
+typedef struct
+{
+    FP4 a; /**< first part of FP12 */
+    FP4 b; /**< second part of FP12 */
+    FP4 c; /**< third part of FP12 */
+    int type;
+} FP12;
+
+extern const B464_60::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B464_60::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+/* FP12 prototypes */
+/**	@brief Tests for FP12 equal to zero
+ *
+	@param x FP12 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP12_iszilch(FP12 *x);
+/**	@brief Tests for FP12 equal to unity
+ *
+	@param x FP12 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP12_isunity(FP12 *x);
+/**	@brief Copy FP12 to another FP12
+ *
+	@param x FP12 instance, on exit = y
+	@param y FP12 instance to be copied
+ */
+extern void FP12_copy(FP12 *x, FP12 *y);
+/**	@brief Set FP12 to unity
+ *
+	@param x FP12 instance to be set to one
+ */
+extern void FP12_one(FP12 *x);
+
+/**	@brief Set FP12 to zero
+ *
+	@param x FP12 instance to be set to zero
+ */
+extern void FP12_zero(FP12 *x);
+
+/**	@brief Tests for equality of two FP12s
+ *
+	@param x FP12 instance to be compared
+	@param y FP12 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP12_equals(FP12 *x, FP12 *y);
+/**	@brief Conjugation of FP12
+ *
+	If y=(a,b,c) (where a,b,c are its three FP4 components) on exit x=(conj(a),-conj(b),conj(c))
+	@param x FP12 instance, on exit = conj(y)
+	@param y FP12 instance
+ */
+extern void FP12_conj(FP12 *x, FP12 *y);
+/**	@brief Initialise FP12 from single FP4
+ *
+	Sets first FP4 component of an FP12, other components set to zero
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP4
+ */
+extern void FP12_from_FP4(FP12 *x, FP4 *a);
+/**	@brief Initialise FP12 from three FP4s
+ *
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP12
+	@param b FP4 to form second part of FP12
+	@param c FP4 to form third part of FP12
+ */
+extern void FP12_from_FP4s(FP12 *x, FP4 *a, FP4* b, FP4 *c);
+/**	@brief Fast Squaring of an FP12 in "unitary" form
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP4 instance, must be unitary
+ */
+extern void FP12_usqr(FP12 *x, FP12 *y);
+/**	@brief Squaring an FP12
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP12 instance
+ */
+extern void FP12_sqr(FP12 *x, FP12 *y);
+/**	@brief Fast multiplication of two sparse FP12s that arises from ATE pairing line functions
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_smul(FP12 *x, FP12 *y);
+
+/**	@brief Fast multiplication of what may be sparse multiplicands
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_ssmul(FP12 *x, FP12 *y);
+
+
+/**	@brief Full unconditional Multiplication of two FP12s
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, the multiplier
+ */
+extern void FP12_mul(FP12 *x, FP12 *y);
+
+/**	@brief Inverting an FP12
+ *
+	@param x FP12 instance, on exit = 1/y
+	@param y FP12 instance
+	@param t D_TYPE or M_TYPE twist
+ */
+extern void FP12_inv(FP12 *x, FP12 *y);
+/**	@brief Raises an FP12 to the power of a BIG
+ *
+	@param r FP12 instance, on exit = y^b
+	@param x FP12 instance
+	@param b BIG number
+ */
+extern void FP12_pow(FP12 *r, FP12 *x, B464_60::BIG b);
+/**	@brief Raises an FP12 instance x to a small integer power, side-channel resistant
+ *
+	@param x FP12 instance, on exit = x^i
+	@param i small integer exponent
+	@param b maximum number of bits in exponent
+ */
+extern void FP12_pinpow(FP12 *x, int i, int b);
+
+/**	@brief Raises an FP12 instance x to a BIG power, compressed to FP4
+ *
+	@param c FP4 instance, on exit = x^(e mod r) as FP4
+	@param x FP12 input
+	@param e BIG exponent
+	@param r BIG group order
+ */
+extern void FP12_compow(FP4 *c, FP12 *x, B464_60::BIG e, B464_60::BIG r);
+
+/**	@brief Calculate x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3], side-channel resistant
+ *
+	@param r FP12 instance, on exit = x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3]
+	@param x FP12 array with 4 FP12s
+	@param b BIG array of 4 exponents
+ */
+extern void FP12_pow4(FP12 *r, FP12 *x, B464_60::BIG *b);
+/**	@brief Raises an FP12 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP12 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP12_frob(FP12 *x, FP2 *f);
+/**	@brief Reduces all components of possibly unreduced FP12 mod Modulus
+ *
+	@param x FP12 instance, on exit reduced mod Modulus
+ */
+extern void FP12_reduce(FP12 *x);
+/**	@brief Normalises the components of an FP12
+ *
+	@param x FP12 instance to be normalised
+ */
+extern void FP12_norm(FP12 *x);
+/**	@brief Formats and outputs an FP12 to the console
+ *
+	@param x FP12 instance to be printed
+ */
+extern void FP12_output(FP12 *x);
+/**	@brief Formats and outputs an FP12 instance to an octet string
+ *
+	Serializes the components of an FP12 to big-endian base 256 form.
+	@param S output octet string
+	@param x FP12 instance to be converted to an octet string
+ */
+extern void FP12_toOctet(octet *S, FP12 *x);
+/**	@brief Creates an FP12 instance from an octet string
+ *
+	De-serializes the components of an FP12 to create an FP12 from big-endian base 256 components.
+	@param x FP12 instance to be created from an octet string
+	@param S input octet string
+
+ */
+extern void FP12_fromOctet(FP12 *x, octet *S);
+/**	@brief Calculate the trace of an FP12
+ *
+	@param t FP4 trace of x, on exit = tr(x)
+	@param x FP12 instance
+
+ */
+extern void FP12_trace(FP4 *t, FP12 *x);
+
+/**	@brief Conditional copy of FP12 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP12 instance, set to y if s!=0
+	@param y another FP12 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP12_cmove(FP12 *x, FP12 *y, int s);
+
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp12_BN158.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp12_BN158.h
new file mode 100644
index 0000000..aa89990
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp12_BN158.h
@@ -0,0 +1,230 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP12_BN158_H
+#define FP12_BN158_H
+
+#include "fp4_BN158.h"
+
+using namespace core;
+
+namespace BN158 {
+/**
+	@brief FP12 Structure - towered over three FP4
+*/
+
+typedef struct
+{
+    FP4 a; /**< first part of FP12 */
+    FP4 b; /**< second part of FP12 */
+    FP4 c; /**< third part of FP12 */
+    int type;
+} FP12;
+
+extern const B160_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B160_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+/* FP12 prototypes */
+/**	@brief Tests for FP12 equal to zero
+ *
+	@param x FP12 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP12_iszilch(FP12 *x);
+/**	@brief Tests for FP12 equal to unity
+ *
+	@param x FP12 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP12_isunity(FP12 *x);
+/**	@brief Copy FP12 to another FP12
+ *
+	@param x FP12 instance, on exit = y
+	@param y FP12 instance to be copied
+ */
+extern void FP12_copy(FP12 *x, FP12 *y);
+/**	@brief Set FP12 to unity
+ *
+	@param x FP12 instance to be set to one
+ */
+extern void FP12_one(FP12 *x);
+
+/**	@brief Set FP12 to zero
+ *
+	@param x FP12 instance to be set to zero
+ */
+extern void FP12_zero(FP12 *x);
+
+/**	@brief Tests for equality of two FP12s
+ *
+	@param x FP12 instance to be compared
+	@param y FP12 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP12_equals(FP12 *x, FP12 *y);
+/**	@brief Conjugation of FP12
+ *
+	If y=(a,b,c) (where a,b,c are its three FP4 components) on exit x=(conj(a),-conj(b),conj(c))
+	@param x FP12 instance, on exit = conj(y)
+	@param y FP12 instance
+ */
+extern void FP12_conj(FP12 *x, FP12 *y);
+/**	@brief Initialise FP12 from single FP4
+ *
+	Sets first FP4 component of an FP12, other components set to zero
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP4
+ */
+extern void FP12_from_FP4(FP12 *x, FP4 *a);
+/**	@brief Initialise FP12 from three FP4s
+ *
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP12
+	@param b FP4 to form second part of FP12
+	@param c FP4 to form third part of FP12
+ */
+extern void FP12_from_FP4s(FP12 *x, FP4 *a, FP4* b, FP4 *c);
+/**	@brief Fast Squaring of an FP12 in "unitary" form
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP4 instance, must be unitary
+ */
+extern void FP12_usqr(FP12 *x, FP12 *y);
+/**	@brief Squaring an FP12
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP12 instance
+ */
+extern void FP12_sqr(FP12 *x, FP12 *y);
+/**	@brief Fast multiplication of two sparse FP12s that arises from ATE pairing line functions
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_smul(FP12 *x, FP12 *y);
+
+/**	@brief Fast multiplication of what may be sparse multiplicands
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_ssmul(FP12 *x, FP12 *y);
+
+
+/**	@brief Full unconditional Multiplication of two FP12s
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, the multiplier
+ */
+extern void FP12_mul(FP12 *x, FP12 *y);
+
+/**	@brief Inverting an FP12
+ *
+	@param x FP12 instance, on exit = 1/y
+	@param y FP12 instance
+	@param t D_TYPE or M_TYPE twist
+ */
+extern void FP12_inv(FP12 *x, FP12 *y);
+/**	@brief Raises an FP12 to the power of a BIG
+ *
+	@param r FP12 instance, on exit = y^b
+	@param x FP12 instance
+	@param b BIG number
+ */
+extern void FP12_pow(FP12 *r, FP12 *x, B160_56::BIG b);
+/**	@brief Raises an FP12 instance x to a small integer power, side-channel resistant
+ *
+	@param x FP12 instance, on exit = x^i
+	@param i small integer exponent
+	@param b maximum number of bits in exponent
+ */
+extern void FP12_pinpow(FP12 *x, int i, int b);
+
+/**	@brief Raises an FP12 instance x to a BIG power, compressed to FP4
+ *
+	@param c FP4 instance, on exit = x^(e mod r) as FP4
+	@param x FP12 input
+	@param e BIG exponent
+	@param r BIG group order
+ */
+extern void FP12_compow(FP4 *c, FP12 *x, B160_56::BIG e, B160_56::BIG r);
+
+/**	@brief Calculate x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3], side-channel resistant
+ *
+	@param r FP12 instance, on exit = x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3]
+	@param x FP12 array with 4 FP12s
+	@param b BIG array of 4 exponents
+ */
+extern void FP12_pow4(FP12 *r, FP12 *x, B160_56::BIG *b);
+/**	@brief Raises an FP12 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP12 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP12_frob(FP12 *x, FP2 *f);
+/**	@brief Reduces all components of possibly unreduced FP12 mod Modulus
+ *
+	@param x FP12 instance, on exit reduced mod Modulus
+ */
+extern void FP12_reduce(FP12 *x);
+/**	@brief Normalises the components of an FP12
+ *
+	@param x FP12 instance to be normalised
+ */
+extern void FP12_norm(FP12 *x);
+/**	@brief Formats and outputs an FP12 to the console
+ *
+	@param x FP12 instance to be printed
+ */
+extern void FP12_output(FP12 *x);
+/**	@brief Formats and outputs an FP12 instance to an octet string
+ *
+	Serializes the components of an FP12 to big-endian base 256 form.
+	@param S output octet string
+	@param x FP12 instance to be converted to an octet string
+ */
+extern void FP12_toOctet(octet *S, FP12 *x);
+/**	@brief Creates an FP12 instance from an octet string
+ *
+	De-serializes the components of an FP12 to create an FP12 from big-endian base 256 components.
+	@param x FP12 instance to be created from an octet string
+	@param S input octet string
+
+ */
+extern void FP12_fromOctet(FP12 *x, octet *S);
+/**	@brief Calculate the trace of an FP12
+ *
+	@param t FP4 trace of x, on exit = tr(x)
+	@param x FP12 instance
+
+ */
+extern void FP12_trace(FP4 *t, FP12 *x);
+
+/**	@brief Conditional copy of FP12 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP12 instance, set to y if s!=0
+	@param y another FP12 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP12_cmove(FP12 *x, FP12 *y, int s);
+
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp12_BN254.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp12_BN254.h
new file mode 100644
index 0000000..15a03d8
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp12_BN254.h
@@ -0,0 +1,230 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP12_BN254_H
+#define FP12_BN254_H
+
+#include "fp4_BN254.h"
+
+using namespace core;
+
+namespace BN254 {
+/**
+	@brief FP12 Structure - towered over three FP4
+*/
+
+typedef struct
+{
+    FP4 a; /**< first part of FP12 */
+    FP4 b; /**< second part of FP12 */
+    FP4 c; /**< third part of FP12 */
+    int type;
+} FP12;
+
+extern const B256_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+/* FP12 prototypes */
+/**	@brief Tests for FP12 equal to zero
+ *
+	@param x FP12 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP12_iszilch(FP12 *x);
+/**	@brief Tests for FP12 equal to unity
+ *
+	@param x FP12 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP12_isunity(FP12 *x);
+/**	@brief Copy FP12 to another FP12
+ *
+	@param x FP12 instance, on exit = y
+	@param y FP12 instance to be copied
+ */
+extern void FP12_copy(FP12 *x, FP12 *y);
+/**	@brief Set FP12 to unity
+ *
+	@param x FP12 instance to be set to one
+ */
+extern void FP12_one(FP12 *x);
+
+/**	@brief Set FP12 to zero
+ *
+	@param x FP12 instance to be set to zero
+ */
+extern void FP12_zero(FP12 *x);
+
+/**	@brief Tests for equality of two FP12s
+ *
+	@param x FP12 instance to be compared
+	@param y FP12 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP12_equals(FP12 *x, FP12 *y);
+/**	@brief Conjugation of FP12
+ *
+	If y=(a,b,c) (where a,b,c are its three FP4 components) on exit x=(conj(a),-conj(b),conj(c))
+	@param x FP12 instance, on exit = conj(y)
+	@param y FP12 instance
+ */
+extern void FP12_conj(FP12 *x, FP12 *y);
+/**	@brief Initialise FP12 from single FP4
+ *
+	Sets first FP4 component of an FP12, other components set to zero
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP4
+ */
+extern void FP12_from_FP4(FP12 *x, FP4 *a);
+/**	@brief Initialise FP12 from three FP4s
+ *
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP12
+	@param b FP4 to form second part of FP12
+	@param c FP4 to form third part of FP12
+ */
+extern void FP12_from_FP4s(FP12 *x, FP4 *a, FP4* b, FP4 *c);
+/**	@brief Fast Squaring of an FP12 in "unitary" form
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP4 instance, must be unitary
+ */
+extern void FP12_usqr(FP12 *x, FP12 *y);
+/**	@brief Squaring an FP12
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP12 instance
+ */
+extern void FP12_sqr(FP12 *x, FP12 *y);
+/**	@brief Fast multiplication of two sparse FP12s that arises from ATE pairing line functions
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_smul(FP12 *x, FP12 *y);
+
+/**	@brief Fast multiplication of what may be sparse multiplicands
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_ssmul(FP12 *x, FP12 *y);
+
+
+/**	@brief Full unconditional Multiplication of two FP12s
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, the multiplier
+ */
+extern void FP12_mul(FP12 *x, FP12 *y);
+
+/**	@brief Inverting an FP12
+ *
+	@param x FP12 instance, on exit = 1/y
+	@param y FP12 instance
+	@param t D_TYPE or M_TYPE twist
+ */
+extern void FP12_inv(FP12 *x, FP12 *y);
+/**	@brief Raises an FP12 to the power of a BIG
+ *
+	@param r FP12 instance, on exit = y^b
+	@param x FP12 instance
+	@param b BIG number
+ */
+extern void FP12_pow(FP12 *r, FP12 *x, B256_56::BIG b);
+/**	@brief Raises an FP12 instance x to a small integer power, side-channel resistant
+ *
+	@param x FP12 instance, on exit = x^i
+	@param i small integer exponent
+	@param b maximum number of bits in exponent
+ */
+extern void FP12_pinpow(FP12 *x, int i, int b);
+
+/**	@brief Raises an FP12 instance x to a BIG power, compressed to FP4
+ *
+	@param c FP4 instance, on exit = x^(e mod r) as FP4
+	@param x FP12 input
+	@param e BIG exponent
+	@param r BIG group order
+ */
+extern void FP12_compow(FP4 *c, FP12 *x, B256_56::BIG e, B256_56::BIG r);
+
+/**	@brief Calculate x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3], side-channel resistant
+ *
+	@param r FP12 instance, on exit = x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3]
+	@param x FP12 array with 4 FP12s
+	@param b BIG array of 4 exponents
+ */
+extern void FP12_pow4(FP12 *r, FP12 *x, B256_56::BIG *b);
+/**	@brief Raises an FP12 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP12 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP12_frob(FP12 *x, FP2 *f);
+/**	@brief Reduces all components of possibly unreduced FP12 mod Modulus
+ *
+	@param x FP12 instance, on exit reduced mod Modulus
+ */
+extern void FP12_reduce(FP12 *x);
+/**	@brief Normalises the components of an FP12
+ *
+	@param x FP12 instance to be normalised
+ */
+extern void FP12_norm(FP12 *x);
+/**	@brief Formats and outputs an FP12 to the console
+ *
+	@param x FP12 instance to be printed
+ */
+extern void FP12_output(FP12 *x);
+/**	@brief Formats and outputs an FP12 instance to an octet string
+ *
+	Serializes the components of an FP12 to big-endian base 256 form.
+	@param S output octet string
+	@param x FP12 instance to be converted to an octet string
+ */
+extern void FP12_toOctet(octet *S, FP12 *x);
+/**	@brief Creates an FP12 instance from an octet string
+ *
+	De-serializes the components of an FP12 to create an FP12 from big-endian base 256 components.
+	@param x FP12 instance to be created from an octet string
+	@param S input octet string
+
+ */
+extern void FP12_fromOctet(FP12 *x, octet *S);
+/**	@brief Calculate the trace of an FP12
+ *
+	@param t FP4 trace of x, on exit = tr(x)
+	@param x FP12 instance
+
+ */
+extern void FP12_trace(FP4 *t, FP12 *x);
+
+/**	@brief Conditional copy of FP12 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP12 instance, set to y if s!=0
+	@param y another FP12 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP12_cmove(FP12 *x, FP12 *y, int s);
+
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp12_BN254CX.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp12_BN254CX.h
new file mode 100644
index 0000000..f795f5b
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp12_BN254CX.h
@@ -0,0 +1,230 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP12_BN254CX_H
+#define FP12_BN254CX_H
+
+#include "fp4_BN254CX.h"
+
+using namespace core;
+
+namespace BN254CX {
+/**
+	@brief FP12 Structure - towered over three FP4
+*/
+
+typedef struct
+{
+    FP4 a; /**< first part of FP12 */
+    FP4 b; /**< second part of FP12 */
+    FP4 c; /**< third part of FP12 */
+    int type;
+} FP12;
+
+extern const B256_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+/* FP12 prototypes */
+/**	@brief Tests for FP12 equal to zero
+ *
+	@param x FP12 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP12_iszilch(FP12 *x);
+/**	@brief Tests for FP12 equal to unity
+ *
+	@param x FP12 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP12_isunity(FP12 *x);
+/**	@brief Copy FP12 to another FP12
+ *
+	@param x FP12 instance, on exit = y
+	@param y FP12 instance to be copied
+ */
+extern void FP12_copy(FP12 *x, FP12 *y);
+/**	@brief Set FP12 to unity
+ *
+	@param x FP12 instance to be set to one
+ */
+extern void FP12_one(FP12 *x);
+
+/**	@brief Set FP12 to zero
+ *
+	@param x FP12 instance to be set to zero
+ */
+extern void FP12_zero(FP12 *x);
+
+/**	@brief Tests for equality of two FP12s
+ *
+	@param x FP12 instance to be compared
+	@param y FP12 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP12_equals(FP12 *x, FP12 *y);
+/**	@brief Conjugation of FP12
+ *
+	If y=(a,b,c) (where a,b,c are its three FP4 components) on exit x=(conj(a),-conj(b),conj(c))
+	@param x FP12 instance, on exit = conj(y)
+	@param y FP12 instance
+ */
+extern void FP12_conj(FP12 *x, FP12 *y);
+/**	@brief Initialise FP12 from single FP4
+ *
+	Sets first FP4 component of an FP12, other components set to zero
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP4
+ */
+extern void FP12_from_FP4(FP12 *x, FP4 *a);
+/**	@brief Initialise FP12 from three FP4s
+ *
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP12
+	@param b FP4 to form second part of FP12
+	@param c FP4 to form third part of FP12
+ */
+extern void FP12_from_FP4s(FP12 *x, FP4 *a, FP4* b, FP4 *c);
+/**	@brief Fast Squaring of an FP12 in "unitary" form
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP4 instance, must be unitary
+ */
+extern void FP12_usqr(FP12 *x, FP12 *y);
+/**	@brief Squaring an FP12
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP12 instance
+ */
+extern void FP12_sqr(FP12 *x, FP12 *y);
+/**	@brief Fast multiplication of two sparse FP12s that arises from ATE pairing line functions
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_smul(FP12 *x, FP12 *y);
+
+/**	@brief Fast multiplication of what may be sparse multiplicands
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_ssmul(FP12 *x, FP12 *y);
+
+
+/**	@brief Full unconditional Multiplication of two FP12s
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, the multiplier
+ */
+extern void FP12_mul(FP12 *x, FP12 *y);
+
+/**	@brief Inverting an FP12
+ *
+	@param x FP12 instance, on exit = 1/y
+	@param y FP12 instance
+	@param t D_TYPE or M_TYPE twist
+ */
+extern void FP12_inv(FP12 *x, FP12 *y);
+/**	@brief Raises an FP12 to the power of a BIG
+ *
+	@param r FP12 instance, on exit = y^b
+	@param x FP12 instance
+	@param b BIG number
+ */
+extern void FP12_pow(FP12 *r, FP12 *x, B256_56::BIG b);
+/**	@brief Raises an FP12 instance x to a small integer power, side-channel resistant
+ *
+	@param x FP12 instance, on exit = x^i
+	@param i small integer exponent
+	@param b maximum number of bits in exponent
+ */
+extern void FP12_pinpow(FP12 *x, int i, int b);
+
+/**	@brief Raises an FP12 instance x to a BIG power, compressed to FP4
+ *
+	@param c FP4 instance, on exit = x^(e mod r) as FP4
+	@param x FP12 input
+	@param e BIG exponent
+	@param r BIG group order
+ */
+extern void FP12_compow(FP4 *c, FP12 *x, B256_56::BIG e, B256_56::BIG r);
+
+/**	@brief Calculate x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3], side-channel resistant
+ *
+	@param r FP12 instance, on exit = x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3]
+	@param x FP12 array with 4 FP12s
+	@param b BIG array of 4 exponents
+ */
+extern void FP12_pow4(FP12 *r, FP12 *x, B256_56::BIG *b);
+/**	@brief Raises an FP12 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP12 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP12_frob(FP12 *x, FP2 *f);
+/**	@brief Reduces all components of possibly unreduced FP12 mod Modulus
+ *
+	@param x FP12 instance, on exit reduced mod Modulus
+ */
+extern void FP12_reduce(FP12 *x);
+/**	@brief Normalises the components of an FP12
+ *
+	@param x FP12 instance to be normalised
+ */
+extern void FP12_norm(FP12 *x);
+/**	@brief Formats and outputs an FP12 to the console
+ *
+	@param x FP12 instance to be printed
+ */
+extern void FP12_output(FP12 *x);
+/**	@brief Formats and outputs an FP12 instance to an octet string
+ *
+	Serializes the components of an FP12 to big-endian base 256 form.
+	@param S output octet string
+	@param x FP12 instance to be converted to an octet string
+ */
+extern void FP12_toOctet(octet *S, FP12 *x);
+/**	@brief Creates an FP12 instance from an octet string
+ *
+	De-serializes the components of an FP12 to create an FP12 from big-endian base 256 components.
+	@param x FP12 instance to be created from an octet string
+	@param S input octet string
+
+ */
+extern void FP12_fromOctet(FP12 *x, octet *S);
+/**	@brief Calculate the trace of an FP12
+ *
+	@param t FP4 trace of x, on exit = tr(x)
+	@param x FP12 instance
+
+ */
+extern void FP12_trace(FP4 *t, FP12 *x);
+
+/**	@brief Conditional copy of FP12 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP12 instance, set to y if s!=0
+	@param y another FP12 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP12_cmove(FP12 *x, FP12 *y, int s);
+
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp12_BN462.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp12_BN462.h
new file mode 100644
index 0000000..4130fc6
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp12_BN462.h
@@ -0,0 +1,230 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP12_BN462_H
+#define FP12_BN462_H
+
+#include "fp4_BN462.h"
+
+using namespace core;
+
+namespace BN462 {
+/**
+	@brief FP12 Structure - towered over three FP4
+*/
+
+typedef struct
+{
+    FP4 a; /**< first part of FP12 */
+    FP4 b; /**< second part of FP12 */
+    FP4 c; /**< third part of FP12 */
+    int type;
+} FP12;
+
+extern const B464_60::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B464_60::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+/* FP12 prototypes */
+/**	@brief Tests for FP12 equal to zero
+ *
+	@param x FP12 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP12_iszilch(FP12 *x);
+/**	@brief Tests for FP12 equal to unity
+ *
+	@param x FP12 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP12_isunity(FP12 *x);
+/**	@brief Copy FP12 to another FP12
+ *
+	@param x FP12 instance, on exit = y
+	@param y FP12 instance to be copied
+ */
+extern void FP12_copy(FP12 *x, FP12 *y);
+/**	@brief Set FP12 to unity
+ *
+	@param x FP12 instance to be set to one
+ */
+extern void FP12_one(FP12 *x);
+
+/**	@brief Set FP12 to zero
+ *
+	@param x FP12 instance to be set to zero
+ */
+extern void FP12_zero(FP12 *x);
+
+/**	@brief Tests for equality of two FP12s
+ *
+	@param x FP12 instance to be compared
+	@param y FP12 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP12_equals(FP12 *x, FP12 *y);
+/**	@brief Conjugation of FP12
+ *
+	If y=(a,b,c) (where a,b,c are its three FP4 components) on exit x=(conj(a),-conj(b),conj(c))
+	@param x FP12 instance, on exit = conj(y)
+	@param y FP12 instance
+ */
+extern void FP12_conj(FP12 *x, FP12 *y);
+/**	@brief Initialise FP12 from single FP4
+ *
+	Sets first FP4 component of an FP12, other components set to zero
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP4
+ */
+extern void FP12_from_FP4(FP12 *x, FP4 *a);
+/**	@brief Initialise FP12 from three FP4s
+ *
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP12
+	@param b FP4 to form second part of FP12
+	@param c FP4 to form third part of FP12
+ */
+extern void FP12_from_FP4s(FP12 *x, FP4 *a, FP4* b, FP4 *c);
+/**	@brief Fast Squaring of an FP12 in "unitary" form
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP4 instance, must be unitary
+ */
+extern void FP12_usqr(FP12 *x, FP12 *y);
+/**	@brief Squaring an FP12
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP12 instance
+ */
+extern void FP12_sqr(FP12 *x, FP12 *y);
+/**	@brief Fast multiplication of two sparse FP12s that arises from ATE pairing line functions
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_smul(FP12 *x, FP12 *y);
+
+/**	@brief Fast multiplication of what may be sparse multiplicands
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_ssmul(FP12 *x, FP12 *y);
+
+
+/**	@brief Full unconditional Multiplication of two FP12s
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, the multiplier
+ */
+extern void FP12_mul(FP12 *x, FP12 *y);
+
+/**	@brief Inverting an FP12
+ *
+	@param x FP12 instance, on exit = 1/y
+	@param y FP12 instance
+	@param t D_TYPE or M_TYPE twist
+ */
+extern void FP12_inv(FP12 *x, FP12 *y);
+/**	@brief Raises an FP12 to the power of a BIG
+ *
+	@param r FP12 instance, on exit = y^b
+	@param x FP12 instance
+	@param b BIG number
+ */
+extern void FP12_pow(FP12 *r, FP12 *x, B464_60::BIG b);
+/**	@brief Raises an FP12 instance x to a small integer power, side-channel resistant
+ *
+	@param x FP12 instance, on exit = x^i
+	@param i small integer exponent
+	@param b maximum number of bits in exponent
+ */
+extern void FP12_pinpow(FP12 *x, int i, int b);
+
+/**	@brief Raises an FP12 instance x to a BIG power, compressed to FP4
+ *
+	@param c FP4 instance, on exit = x^(e mod r) as FP4
+	@param x FP12 input
+	@param e BIG exponent
+	@param r BIG group order
+ */
+extern void FP12_compow(FP4 *c, FP12 *x, B464_60::BIG e, B464_60::BIG r);
+
+/**	@brief Calculate x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3], side-channel resistant
+ *
+	@param r FP12 instance, on exit = x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3]
+	@param x FP12 array with 4 FP12s
+	@param b BIG array of 4 exponents
+ */
+extern void FP12_pow4(FP12 *r, FP12 *x, B464_60::BIG *b);
+/**	@brief Raises an FP12 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP12 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP12_frob(FP12 *x, FP2 *f);
+/**	@brief Reduces all components of possibly unreduced FP12 mod Modulus
+ *
+	@param x FP12 instance, on exit reduced mod Modulus
+ */
+extern void FP12_reduce(FP12 *x);
+/**	@brief Normalises the components of an FP12
+ *
+	@param x FP12 instance to be normalised
+ */
+extern void FP12_norm(FP12 *x);
+/**	@brief Formats and outputs an FP12 to the console
+ *
+	@param x FP12 instance to be printed
+ */
+extern void FP12_output(FP12 *x);
+/**	@brief Formats and outputs an FP12 instance to an octet string
+ *
+	Serializes the components of an FP12 to big-endian base 256 form.
+	@param S output octet string
+	@param x FP12 instance to be converted to an octet string
+ */
+extern void FP12_toOctet(octet *S, FP12 *x);
+/**	@brief Creates an FP12 instance from an octet string
+ *
+	De-serializes the components of an FP12 to create an FP12 from big-endian base 256 components.
+	@param x FP12 instance to be created from an octet string
+	@param S input octet string
+
+ */
+extern void FP12_fromOctet(FP12 *x, octet *S);
+/**	@brief Calculate the trace of an FP12
+ *
+	@param t FP4 trace of x, on exit = tr(x)
+	@param x FP12 instance
+
+ */
+extern void FP12_trace(FP4 *t, FP12 *x);
+
+/**	@brief Conditional copy of FP12 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP12 instance, set to y if s!=0
+	@param y another FP12 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP12_cmove(FP12 *x, FP12 *y, int s);
+
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp12_FP256BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp12_FP256BN.h
new file mode 100644
index 0000000..621f981
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp12_FP256BN.h
@@ -0,0 +1,230 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP12_FP256BN_H
+#define FP12_FP256BN_H
+
+#include "fp4_FP256BN.h"
+
+using namespace core;
+
+namespace FP256BN {
+/**
+	@brief FP12 Structure - towered over three FP4
+*/
+
+typedef struct
+{
+    FP4 a; /**< first part of FP12 */
+    FP4 b; /**< second part of FP12 */
+    FP4 c; /**< third part of FP12 */
+    int type;
+} FP12;
+
+extern const B256_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+/* FP12 prototypes */
+/**	@brief Tests for FP12 equal to zero
+ *
+	@param x FP12 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP12_iszilch(FP12 *x);
+/**	@brief Tests for FP12 equal to unity
+ *
+	@param x FP12 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP12_isunity(FP12 *x);
+/**	@brief Copy FP12 to another FP12
+ *
+	@param x FP12 instance, on exit = y
+	@param y FP12 instance to be copied
+ */
+extern void FP12_copy(FP12 *x, FP12 *y);
+/**	@brief Set FP12 to unity
+ *
+	@param x FP12 instance to be set to one
+ */
+extern void FP12_one(FP12 *x);
+
+/**	@brief Set FP12 to zero
+ *
+	@param x FP12 instance to be set to zero
+ */
+extern void FP12_zero(FP12 *x);
+
+/**	@brief Tests for equality of two FP12s
+ *
+	@param x FP12 instance to be compared
+	@param y FP12 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP12_equals(FP12 *x, FP12 *y);
+/**	@brief Conjugation of FP12
+ *
+	If y=(a,b,c) (where a,b,c are its three FP4 components) on exit x=(conj(a),-conj(b),conj(c))
+	@param x FP12 instance, on exit = conj(y)
+	@param y FP12 instance
+ */
+extern void FP12_conj(FP12 *x, FP12 *y);
+/**	@brief Initialise FP12 from single FP4
+ *
+	Sets first FP4 component of an FP12, other components set to zero
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP4
+ */
+extern void FP12_from_FP4(FP12 *x, FP4 *a);
+/**	@brief Initialise FP12 from three FP4s
+ *
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP12
+	@param b FP4 to form second part of FP12
+	@param c FP4 to form third part of FP12
+ */
+extern void FP12_from_FP4s(FP12 *x, FP4 *a, FP4* b, FP4 *c);
+/**	@brief Fast Squaring of an FP12 in "unitary" form
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP4 instance, must be unitary
+ */
+extern void FP12_usqr(FP12 *x, FP12 *y);
+/**	@brief Squaring an FP12
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP12 instance
+ */
+extern void FP12_sqr(FP12 *x, FP12 *y);
+/**	@brief Fast multiplication of two sparse FP12s that arises from ATE pairing line functions
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_smul(FP12 *x, FP12 *y);
+
+/**	@brief Fast multiplication of what may be sparse multiplicands
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_ssmul(FP12 *x, FP12 *y);
+
+
+/**	@brief Full unconditional Multiplication of two FP12s
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, the multiplier
+ */
+extern void FP12_mul(FP12 *x, FP12 *y);
+
+/**	@brief Inverting an FP12
+ *
+	@param x FP12 instance, on exit = 1/y
+	@param y FP12 instance
+	@param t D_TYPE or M_TYPE twist
+ */
+extern void FP12_inv(FP12 *x, FP12 *y);
+/**	@brief Raises an FP12 to the power of a BIG
+ *
+	@param r FP12 instance, on exit = y^b
+	@param x FP12 instance
+	@param b BIG number
+ */
+extern void FP12_pow(FP12 *r, FP12 *x, B256_56::BIG b);
+/**	@brief Raises an FP12 instance x to a small integer power, side-channel resistant
+ *
+	@param x FP12 instance, on exit = x^i
+	@param i small integer exponent
+	@param b maximum number of bits in exponent
+ */
+extern void FP12_pinpow(FP12 *x, int i, int b);
+
+/**	@brief Raises an FP12 instance x to a BIG power, compressed to FP4
+ *
+	@param c FP4 instance, on exit = x^(e mod r) as FP4
+	@param x FP12 input
+	@param e BIG exponent
+	@param r BIG group order
+ */
+extern void FP12_compow(FP4 *c, FP12 *x, B256_56::BIG e, B256_56::BIG r);
+
+/**	@brief Calculate x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3], side-channel resistant
+ *
+	@param r FP12 instance, on exit = x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3]
+	@param x FP12 array with 4 FP12s
+	@param b BIG array of 4 exponents
+ */
+extern void FP12_pow4(FP12 *r, FP12 *x, B256_56::BIG *b);
+/**	@brief Raises an FP12 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP12 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP12_frob(FP12 *x, FP2 *f);
+/**	@brief Reduces all components of possibly unreduced FP12 mod Modulus
+ *
+	@param x FP12 instance, on exit reduced mod Modulus
+ */
+extern void FP12_reduce(FP12 *x);
+/**	@brief Normalises the components of an FP12
+ *
+	@param x FP12 instance to be normalised
+ */
+extern void FP12_norm(FP12 *x);
+/**	@brief Formats and outputs an FP12 to the console
+ *
+	@param x FP12 instance to be printed
+ */
+extern void FP12_output(FP12 *x);
+/**	@brief Formats and outputs an FP12 instance to an octet string
+ *
+	Serializes the components of an FP12 to big-endian base 256 form.
+	@param S output octet string
+	@param x FP12 instance to be converted to an octet string
+ */
+extern void FP12_toOctet(octet *S, FP12 *x);
+/**	@brief Creates an FP12 instance from an octet string
+ *
+	De-serializes the components of an FP12 to create an FP12 from big-endian base 256 components.
+	@param x FP12 instance to be created from an octet string
+	@param S input octet string
+
+ */
+extern void FP12_fromOctet(FP12 *x, octet *S);
+/**	@brief Calculate the trace of an FP12
+ *
+	@param t FP4 trace of x, on exit = tr(x)
+	@param x FP12 instance
+
+ */
+extern void FP12_trace(FP4 *t, FP12 *x);
+
+/**	@brief Conditional copy of FP12 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP12 instance, set to y if s!=0
+	@param y another FP12 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP12_cmove(FP12 *x, FP12 *y, int s);
+
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp12_FP512BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp12_FP512BN.h
new file mode 100644
index 0000000..30c0522
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp12_FP512BN.h
@@ -0,0 +1,230 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP12_FP512BN_H
+#define FP12_FP512BN_H
+
+#include "fp4_FP512BN.h"
+
+using namespace core;
+
+namespace FP512BN {
+/**
+	@brief FP12 Structure - towered over three FP4
+*/
+
+typedef struct
+{
+    FP4 a; /**< first part of FP12 */
+    FP4 b; /**< second part of FP12 */
+    FP4 c; /**< third part of FP12 */
+    int type;
+} FP12;
+
+extern const B512_60::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B512_60::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+/* FP12 prototypes */
+/**	@brief Tests for FP12 equal to zero
+ *
+	@param x FP12 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP12_iszilch(FP12 *x);
+/**	@brief Tests for FP12 equal to unity
+ *
+	@param x FP12 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP12_isunity(FP12 *x);
+/**	@brief Copy FP12 to another FP12
+ *
+	@param x FP12 instance, on exit = y
+	@param y FP12 instance to be copied
+ */
+extern void FP12_copy(FP12 *x, FP12 *y);
+/**	@brief Set FP12 to unity
+ *
+	@param x FP12 instance to be set to one
+ */
+extern void FP12_one(FP12 *x);
+
+/**	@brief Set FP12 to zero
+ *
+	@param x FP12 instance to be set to zero
+ */
+extern void FP12_zero(FP12 *x);
+
+/**	@brief Tests for equality of two FP12s
+ *
+	@param x FP12 instance to be compared
+	@param y FP12 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP12_equals(FP12 *x, FP12 *y);
+/**	@brief Conjugation of FP12
+ *
+	If y=(a,b,c) (where a,b,c are its three FP4 components) on exit x=(conj(a),-conj(b),conj(c))
+	@param x FP12 instance, on exit = conj(y)
+	@param y FP12 instance
+ */
+extern void FP12_conj(FP12 *x, FP12 *y);
+/**	@brief Initialise FP12 from single FP4
+ *
+	Sets first FP4 component of an FP12, other components set to zero
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP4
+ */
+extern void FP12_from_FP4(FP12 *x, FP4 *a);
+/**	@brief Initialise FP12 from three FP4s
+ *
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP12
+	@param b FP4 to form second part of FP12
+	@param c FP4 to form third part of FP12
+ */
+extern void FP12_from_FP4s(FP12 *x, FP4 *a, FP4* b, FP4 *c);
+/**	@brief Fast Squaring of an FP12 in "unitary" form
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP4 instance, must be unitary
+ */
+extern void FP12_usqr(FP12 *x, FP12 *y);
+/**	@brief Squaring an FP12
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP12 instance
+ */
+extern void FP12_sqr(FP12 *x, FP12 *y);
+/**	@brief Fast multiplication of two sparse FP12s that arises from ATE pairing line functions
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_smul(FP12 *x, FP12 *y);
+
+/**	@brief Fast multiplication of what may be sparse multiplicands
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_ssmul(FP12 *x, FP12 *y);
+
+
+/**	@brief Full unconditional Multiplication of two FP12s
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, the multiplier
+ */
+extern void FP12_mul(FP12 *x, FP12 *y);
+
+/**	@brief Inverting an FP12
+ *
+	@param x FP12 instance, on exit = 1/y
+	@param y FP12 instance
+	@param t D_TYPE or M_TYPE twist
+ */
+extern void FP12_inv(FP12 *x, FP12 *y);
+/**	@brief Raises an FP12 to the power of a BIG
+ *
+	@param r FP12 instance, on exit = y^b
+	@param x FP12 instance
+	@param b BIG number
+ */
+extern void FP12_pow(FP12 *r, FP12 *x, B512_60::BIG b);
+/**	@brief Raises an FP12 instance x to a small integer power, side-channel resistant
+ *
+	@param x FP12 instance, on exit = x^i
+	@param i small integer exponent
+	@param b maximum number of bits in exponent
+ */
+extern void FP12_pinpow(FP12 *x, int i, int b);
+
+/**	@brief Raises an FP12 instance x to a BIG power, compressed to FP4
+ *
+	@param c FP4 instance, on exit = x^(e mod r) as FP4
+	@param x FP12 input
+	@param e BIG exponent
+	@param r BIG group order
+ */
+extern void FP12_compow(FP4 *c, FP12 *x, B512_60::BIG e, B512_60::BIG r);
+
+/**	@brief Calculate x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3], side-channel resistant
+ *
+	@param r FP12 instance, on exit = x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3]
+	@param x FP12 array with 4 FP12s
+	@param b BIG array of 4 exponents
+ */
+extern void FP12_pow4(FP12 *r, FP12 *x, B512_60::BIG *b);
+/**	@brief Raises an FP12 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP12 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP12_frob(FP12 *x, FP2 *f);
+/**	@brief Reduces all components of possibly unreduced FP12 mod Modulus
+ *
+	@param x FP12 instance, on exit reduced mod Modulus
+ */
+extern void FP12_reduce(FP12 *x);
+/**	@brief Normalises the components of an FP12
+ *
+	@param x FP12 instance to be normalised
+ */
+extern void FP12_norm(FP12 *x);
+/**	@brief Formats and outputs an FP12 to the console
+ *
+	@param x FP12 instance to be printed
+ */
+extern void FP12_output(FP12 *x);
+/**	@brief Formats and outputs an FP12 instance to an octet string
+ *
+	Serializes the components of an FP12 to big-endian base 256 form.
+	@param S output octet string
+	@param x FP12 instance to be converted to an octet string
+ */
+extern void FP12_toOctet(octet *S, FP12 *x);
+/**	@brief Creates an FP12 instance from an octet string
+ *
+	De-serializes the components of an FP12 to create an FP12 from big-endian base 256 components.
+	@param x FP12 instance to be created from an octet string
+	@param S input octet string
+
+ */
+extern void FP12_fromOctet(FP12 *x, octet *S);
+/**	@brief Calculate the trace of an FP12
+ *
+	@param t FP4 trace of x, on exit = tr(x)
+	@param x FP12 instance
+
+ */
+extern void FP12_trace(FP4 *t, FP12 *x);
+
+/**	@brief Conditional copy of FP12 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP12 instance, set to y if s!=0
+	@param y another FP12 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP12_cmove(FP12 *x, FP12 *y, int s);
+
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp16.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp16.cpp
new file mode 100644
index 0000000..cb257aa
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp16.cpp
@@ -0,0 +1,610 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* CORE Fp^8 functions */
+
+/* FP16 elements are of the form a+ib, where i is sqrt(sqrt(-1+sqrt(-1))) */
+
+#include "fp16_YYY.h"
+
+using namespace XXX;
+
+/* test x==0 ? */
+int YYY::FP16_iszilch(FP16 *x)
+{
+    if (FP8_iszilch(&(x->a)) && FP8_iszilch(&(x->b))) return 1;
+    return 0;
+}
+
+/* test x==1 ? */
+int YYY::FP16_isunity(FP16 *x)
+{
+    if (FP8_isunity(&(x->a)) && FP8_iszilch(&(x->b))) return 1;
+    return 0;
+}
+
+/* test is w real? That is in a+ib test b is zero */
+int YYY::FP16_isreal(FP16 *w)
+{
+    return FP8_iszilch(&(w->b));
+}
+
+/* return 1 if x==y, else 0 */
+int YYY::FP16_equals(FP16 *x, FP16 *y)
+{
+    if (FP8_equals(&(x->a), &(y->a)) && FP8_equals(&(x->b), &(y->b)))
+        return 1;
+    return 0;
+}
+
+
+void YYY::FP16_toBytes(char *b,FP16 *x)
+{
+    FP8_toBytes(b,&(x->b));
+    FP8_toBytes(&b[8*MODBYTES_XXX],&(x->a));
+}
+
+void YYY::FP16_fromBytes(FP16 *x,char *b)
+{
+    FP8_fromBytes(&(x->b),b);
+    FP8_fromBytes(&(x->a),&b[8*MODBYTES_XXX]);
+}
+
+
+/* set FP16 from two FP8s */
+void YYY::FP16_from_FP8s(FP16 *w, FP8 * x, FP8* y)
+{
+    FP8_copy(&(w->a), x);
+    FP8_copy(&(w->b), y);
+}
+
+/* set FP16 from FP8 */
+void YYY::FP16_from_FP8(FP16 *w, FP8 *x)
+{
+    FP8_copy(&(w->a), x);
+    FP8_zero(&(w->b));
+}
+
+/* set high part of FP16 from FP8 */
+void YYY::FP16_from_FP8H(FP16 *w, FP8 *x)
+{
+    FP8_copy(&(w->b), x);
+    FP8_zero(&(w->a));
+}
+
+/* FP16 copy w=x */
+void YYY::FP16_copy(FP16 *w, FP16 *x)
+{
+    if (w == x) return;
+    FP8_copy(&(w->a), &(x->a));
+    FP8_copy(&(w->b), &(x->b));
+}
+
+/* FP16 w=0 */
+void YYY::FP16_zero(FP16 *w)
+{
+    FP8_zero(&(w->a));
+    FP8_zero(&(w->b));
+}
+
+/* FP16 w=1 */
+void YYY::FP16_one(FP16 *w)
+{
+    FP8_one(&(w->a));
+    FP8_zero(&(w->b));
+}
+
+/* Set w=-x */
+void YYY::FP16_neg(FP16 *w, FP16 *x)
+{
+    /* Just one field neg */
+    FP8 m, t;
+    FP16_norm(x);
+    FP8_add(&m, &(x->a), &(x->b));
+    FP8_norm(&m);
+    FP8_neg(&m, &m);
+    FP8_add(&t, &m, &(x->b));
+    FP8_add(&(w->b), &m, &(x->a));
+    FP8_copy(&(w->a), &t);
+    FP16_norm(w);
+}
+
+/* Set w=conj(x) */
+void YYY::FP16_conj(FP16 *w, FP16 *x)
+{
+    FP8_copy(&(w->a), &(x->a));
+    FP8_neg(&(w->b), &(x->b));
+    FP16_norm(w);
+}
+
+/* Set w=-conj(x) */
+void YYY::FP16_nconj(FP16 *w, FP16 *x)
+{
+    FP8_copy(&(w->b), &(x->b));
+    FP8_neg(&(w->a), &(x->a));
+    FP16_norm(w);
+}
+
+/* Set w=x+y */
+void YYY::FP16_add(FP16 *w, FP16 *x, FP16 *y)
+{
+    FP8_add(&(w->a), &(x->a), &(y->a));
+    FP8_add(&(w->b), &(x->b), &(y->b));
+}
+
+/* Set w=x-y */
+/* Input y MUST be normed */
+void YYY::FP16_sub(FP16 *w, FP16 *x, FP16 *y)
+{
+    FP16 my;
+
+    FP16_neg(&my, y);
+    FP16_add(w, x, &my);
+
+}
+
+/* reduce all components of w mod Modulus */
+void YYY::FP16_reduce(FP16 *w)
+{
+    FP8_reduce(&(w->a));
+    FP8_reduce(&(w->b));
+}
+
+/* normalise all elements of w */
+void YYY::FP16_norm(FP16 *w)
+{
+    FP8_norm(&(w->a));
+    FP8_norm(&(w->b));
+}
+
+/* Set w=s*x, where s is FP8 */
+void YYY::FP16_pmul(FP16 *w, FP16 *x, FP8 *s)
+{
+    FP8_mul(&(w->a), &(x->a), s);
+    FP8_mul(&(w->b), &(x->b), s);
+}
+
+/* Set w=s*x, where s is FP2 */
+void YYY::FP16_qmul(FP16 *w, FP16 *x, FP2 *s)
+{
+    FP8_qmul(&(w->a), &(x->a), s);
+    FP8_qmul(&(w->b), &(x->b), s);
+}
+
+/* Set w=s*x, where s is FP */
+void YYY::FP16_tmul(FP16 *w, FP16 *x, FP *s)
+{
+    FP8_tmul(&(w->a), &(x->a), s);
+    FP8_tmul(&(w->b), &(x->b), s);
+}
+
+/* Set w=s*x, where s is int */
+void YYY::FP16_imul(FP16 *w, FP16 *x, int s)
+{
+    FP8_imul(&(w->a), &(x->a), s);
+    FP8_imul(&(w->b), &(x->b), s);
+}
+
+/* Set w=x^2 */
+/* Input MUST be normed  */
+void YYY::FP16_sqr(FP16 *w, FP16 *x)
+{
+    FP8 t1, t2, t3;
+
+    FP8_mul(&t3, &(x->a), &(x->b)); /* norms x */
+    FP8_copy(&t2, &(x->b));
+    FP8_add(&t1, &(x->a), &(x->b));
+    FP8_times_i(&t2);
+
+    FP8_add(&t2, &(x->a), &t2);
+
+    FP8_norm(&t1);  // 2
+    FP8_norm(&t2);  // 2
+
+    FP8_mul(&(w->a), &t1, &t2);
+
+    FP8_copy(&t2, &t3);
+    FP8_times_i(&t2);
+
+    FP8_add(&t2, &t2, &t3);
+
+    FP8_norm(&t2);  // 2
+    FP8_neg(&t2, &t2);
+    FP8_add(&(w->a), &(w->a), &t2); /* a=(a+b)(a+i^2.b)-i^2.ab-ab = a*a+ib*ib */
+    FP8_add(&(w->b), &t3, &t3); /* b=2ab */
+
+    FP16_norm(w);
+}
+
+/* Set w=x*y */
+/* Inputs MUST be normed  */
+void YYY::FP16_mul(FP16 *w, FP16 *x, FP16 *y)
+{
+
+    FP8 t1, t2, t3, t4;
+    FP8_mul(&t1, &(x->a), &(y->a));
+    FP8_mul(&t2, &(x->b), &(y->b));
+
+    FP8_add(&t3, &(y->b), &(y->a));
+    FP8_add(&t4, &(x->b), &(x->a));
+
+    FP8_norm(&t4); // 2
+    FP8_norm(&t3); // 2
+
+    FP8_mul(&t4, &t4, &t3); /* (xa+xb)(ya+yb) */
+    FP8_neg(&t3, &t1); // 1
+    FP8_add(&t4, &t4, &t3); //t4E=3
+    FP8_norm(&t4);
+
+    FP8_neg(&t3, &t2); // 1
+    FP8_add(&(w->b), &t4, &t3); //wbE=3
+
+    FP8_times_i(&t2);
+    FP8_add(&(w->a), &t2, &t1);
+
+    FP16_norm(w);
+}
+
+/* output FP16 in format [a,b] */
+void YYY::FP16_output(FP16 *w)
+{
+    printf("[");
+    FP8_output(&(w->a));
+    printf(",");
+    FP8_output(&(w->b));
+    printf("]");
+}
+
+void YYY::FP16_rawoutput(FP16 *w)
+{
+    printf("[");
+    FP8_rawoutput(&(w->a));
+    printf(",");
+    FP8_rawoutput(&(w->b));
+    printf("]");
+}
+
+/* Set w=1/x */
+void YYY::FP16_inv(FP16 *w, FP16 *x)
+{
+    FP8 t1, t2;
+    FP8_sqr(&t1, &(x->a));
+    FP8_sqr(&t2, &(x->b));
+    FP8_times_i(&t2);
+    FP8_norm(&t2);
+
+    FP8_sub(&t1, &t1, &t2);
+    FP8_norm(&t1);
+
+    FP8_inv(&t1, &t1, NULL);
+
+    FP8_mul(&(w->a), &t1, &(x->a));
+    FP8_neg(&t1, &t1);
+    FP8_norm(&t1);
+    FP8_mul(&(w->b), &t1, &(x->b));
+}
+
+/* w*=i where i = sqrt(sqrt(-1+sqrt(-1))) */
+void YYY::FP16_times_i(FP16 *w)
+{
+    FP8 s, t;
+    FP8_copy(&s, &(w->b));
+    FP8_copy(&t, &(w->a));
+    FP8_times_i(&s);
+    FP8_copy(&(w->a), &s);
+    FP8_copy(&(w->b), &t);
+    FP16_norm(w);
+
+    //FP16_neg(w,w);   // ***
+    //FP16_norm(w);
+}
+
+void YYY::FP16_times_i2(FP16 *w)
+{
+    FP8_times_i(&(w->a));
+    FP8_times_i(&(w->b));
+}
+
+void YYY::FP16_times_i4(FP16 *w)
+{
+    FP8_times_i2(&(w->a));
+    FP8_times_i2(&(w->b));
+}
+
+/* Set w=w^p using Frobenius */
+void YYY::FP16_frob(FP16 *w, FP2 *f)
+{   // f=(i+1)^(p-3)/8
+    FP2 ff;
+    FP2_sqr(&ff, f); // (i+1)^(p-3)/4
+    FP2_norm(&ff);
+
+    FP8_frob(&(w->a), &ff);
+    FP8_frob(&(w->b), &ff);
+
+    FP8_qmul(&(w->b), &(w->b), f); // times (1+i)^(p-3)/8
+    FP8_times_i(&(w->b));       // (i+1)^(p-1)/8
+}
+
+/* Set r=a^b mod m */
+void YYY::FP16_pow(FP16 *r, FP16* a, BIG b)
+{
+    FP16 w;
+    BIG z, zilch;
+    int bt;
+
+    BIG_zero(zilch);
+
+    BIG_copy(z, b);
+    FP16_copy(&w, a);
+    FP16_one(r);
+    BIG_norm(z);
+    while (1)
+    {
+        bt = BIG_parity(z);
+        BIG_shr(z, 1);
+        if (bt) FP16_mul(r, r, &w);
+        if (BIG_comp(z, zilch) == 0) break;
+        FP16_sqr(&w, &w);
+    }
+    FP16_reduce(r);
+}
+
+/* Move b to a if d=1 */
+void YYY::FP16_cmove(FP16 *f, FP16 *g, int d)
+{
+    FP8_cmove(&(f->a), &(g->a), d);
+    FP8_cmove(&(f->b), &(g->b), d);
+}
+
+//#if CURVE_SECURITY_ZZZ == 256
+
+/* XTR xtr_a function */
+/*
+void YYY::FP16_xtr_A(FP16 *r, FP16 *w, FP16 *x, FP16 *y, FP16 *z)
+{
+    FP16 t1, t2;
+
+    FP16_copy(r, x);
+    FP16_sub(&t1, w, y);
+    FP16_norm(&t1);
+    FP16_pmul(&t1, &t1, &(r->a));
+    FP16_add(&t2, w, y);
+    FP16_norm(&t2);
+    FP16_pmul(&t2, &t2, &(r->b));
+    FP16_times_i(&t2);
+
+    FP16_add(r, &t1, &t2);
+    FP16_add(r, r, z);
+
+    FP16_reduce(r);
+}
+*/
+/* XTR xtr_d function */
+/*
+void YYY::FP16_xtr_D(FP16 *r, FP16 *x)
+{
+    FP16 w;
+    FP16_copy(r, x);
+    FP16_conj(&w, r);
+    FP16_add(&w, &w, &w);
+    FP16_sqr(r, r);
+    FP16_norm(&w);
+    FP16_sub(r, r, &w);
+    FP16_reduce(r);    // reduce here as multiple calls trigger automatic reductions
+}
+*/
+
+/* r=x^n using XTR method on traces of FP48s */
+/*
+void YYY::FP16_xtr_pow(FP16 *r, FP16 *x, BIG n)
+{
+    int i, par, nb;
+    BIG v;
+    FP2 w2;
+    FP4 w4;
+    FP8 w8;
+    FP16 t, a, b, c, sf;
+
+    FP16_copy(&sf, x);
+    FP16_norm(&sf);
+    BIG_zero(v);
+    BIG_inc(v, 3);
+    BIG_norm(v);
+    FP2_from_BIG(&w2, v);
+    FP4_from_FP2(&w4, &w2);
+    FP8_from_FP4(&w8, &w4);
+    FP16_from_FP8(&a, &w8);
+
+    FP16_copy(&b, &sf);
+    FP16_xtr_D(&c, &sf);
+
+
+    par = BIG_parity(n);
+    BIG_copy(v, n);
+    BIG_norm(v);
+    BIG_shr(v, 1);
+    if (par == 0)
+    {
+        BIG_dec(v, 1);
+        BIG_norm(v);
+    }
+
+    nb = BIG_nbits(v);
+    for (i = nb - 1; i >= 0; i--)
+    {
+        if (!BIG_bit(v, i))
+        {
+            FP16_copy(&t, &b);
+            FP16_conj(&sf, &sf);
+            FP16_conj(&c, &c);
+            FP16_xtr_A(&b, &a, &b, &sf, &c);
+            FP16_conj(&sf, &sf);
+            FP16_xtr_D(&c, &t);
+            FP16_xtr_D(&a, &a);
+        }
+        else
+        {
+            FP16_conj(&t, &a);
+            FP16_xtr_D(&a, &b);
+            FP16_xtr_A(&b, &c, &b, &sf, &t);
+            FP16_xtr_D(&c, &c);
+        }
+    }
+
+    if (par == 0) FP16_copy(r, &c);
+    else FP16_copy(r, &b);
+    FP16_reduce(r);
+}
+*/
+/* r=ck^a.cl^n using XTR double exponentiation method on traces of FP48s. See Stam thesis. */
+/*
+void YYY::FP16_xtr_pow2(FP16 *r, FP16 *ck, FP16 *cl, FP16 *ckml, FP16 *ckm2l, BIG a, BIG b)
+{
+    int i, f2;
+    BIG d, e, w;
+    FP16 t, cu, cv, cumv, cum2v;
+
+
+    BIG_copy(e, a);
+    BIG_copy(d, b);
+    BIG_norm(d);
+    BIG_norm(e);
+    FP16_copy(&cu, ck);
+    FP16_copy(&cv, cl);
+    FP16_copy(&cumv, ckml);
+    FP16_copy(&cum2v, ckm2l);
+
+    f2 = 0;
+    while (BIG_parity(d) == 0 && BIG_parity(e) == 0)
+    {
+        BIG_shr(d, 1);
+        BIG_shr(e, 1);
+        f2++;
+    }
+    while (BIG_comp(d, e) != 0)
+    {
+        if (BIG_comp(d, e) > 0)
+        {
+            BIG_imul(w, e, 4);
+            BIG_norm(w);
+            if (BIG_comp(d, w) <= 0)
+            {
+                BIG_copy(w, d);
+                BIG_copy(d, e);
+                BIG_sub(e, w, e);
+                BIG_norm(e);
+                FP16_xtr_A(&t, &cu, &cv, &cumv, &cum2v);
+                FP16_conj(&cum2v, &cumv);
+                FP16_copy(&cumv, &cv);
+                FP16_copy(&cv, &cu);
+                FP16_copy(&cu, &t);
+            }
+            else if (BIG_parity(d) == 0)
+            {
+                BIG_shr(d, 1);
+                FP16_conj(r, &cum2v);
+                FP16_xtr_A(&t, &cu, &cumv, &cv, r);
+                FP16_xtr_D(&cum2v, &cumv);
+                FP16_copy(&cumv, &t);
+                FP16_xtr_D(&cu, &cu);
+            }
+            else if (BIG_parity(e) == 1)
+            {
+                BIG_sub(d, d, e);
+                BIG_norm(d);
+                BIG_shr(d, 1);
+                FP16_xtr_A(&t, &cu, &cv, &cumv, &cum2v);
+                FP16_xtr_D(&cu, &cu);
+                FP16_xtr_D(&cum2v, &cv);
+                FP16_conj(&cum2v, &cum2v);
+                FP16_copy(&cv, &t);
+            }
+            else
+            {
+                BIG_copy(w, d);
+                BIG_copy(d, e);
+                BIG_shr(d, 1);
+                BIG_copy(e, w);
+                FP16_xtr_D(&t, &cumv);
+                FP16_conj(&cumv, &cum2v);
+                FP16_conj(&cum2v, &t);
+                FP16_xtr_D(&t, &cv);
+                FP16_copy(&cv, &cu);
+                FP16_copy(&cu, &t);
+            }
+        }
+        if (BIG_comp(d, e) < 0)
+        {
+            BIG_imul(w, d, 4);
+            BIG_norm(w);
+            if (BIG_comp(e, w) <= 0)
+            {
+                BIG_sub(e, e, d);
+                BIG_norm(e);
+                FP16_xtr_A(&t, &cu, &cv, &cumv, &cum2v);
+                FP16_copy(&cum2v, &cumv);
+                FP16_copy(&cumv, &cu);
+                FP16_copy(&cu, &t);
+            }
+            else if (BIG_parity(e) == 0)
+            {
+                BIG_copy(w, d);
+                BIG_copy(d, e);
+                BIG_shr(d, 1);
+                BIG_copy(e, w);
+                FP16_xtr_D(&t, &cumv);
+                FP16_conj(&cumv, &cum2v);
+                FP16_conj(&cum2v, &t);
+                FP16_xtr_D(&t, &cv);
+                FP16_copy(&cv, &cu);
+                FP16_copy(&cu, &t);
+            }
+            else if (BIG_parity(d) == 1)
+            {
+                BIG_copy(w, e);
+                BIG_copy(e, d);
+                BIG_sub(w, w, d);
+                BIG_norm(w);
+                BIG_copy(d, w);
+                BIG_shr(d, 1);
+                FP16_xtr_A(&t, &cu, &cv, &cumv, &cum2v);
+                FP16_conj(&cumv, &cumv);
+                FP16_xtr_D(&cum2v, &cu);
+                FP16_conj(&cum2v, &cum2v);
+                FP16_xtr_D(&cu, &cv);
+                FP16_copy(&cv, &t);
+            }
+            else
+            {
+                BIG_shr(d, 1);
+                FP16_conj(r, &cum2v);
+                FP16_xtr_A(&t, &cu, &cumv, &cv, r);
+                FP16_xtr_D(&cum2v, &cumv);
+                FP16_copy(&cumv, &t);
+                FP16_xtr_D(&cu, &cu);
+            }
+        }
+    }
+    FP16_xtr_A(r, &cu, &cv, &cumv, &cum2v);
+    for (i = 0; i < f2; i++)    FP16_xtr_D(r, r);
+    FP16_xtr_pow(r, r, d);
+}
+
+#endif
+*/
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp16.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp16.h
new file mode 100644
index 0000000..348ac92
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp16.h
@@ -0,0 +1,308 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP16_YYY_H
+#define FP16_YYY_H
+
+#include "fp8_YYY.h"
+#include "config_curve_ZZZ.h"
+
+using namespace core;
+
+namespace YYY {
+
+/**
+	@brief FP16 Structure - towered over two FP4
+*/
+
+typedef struct
+{
+    FP8 a; /**< real part of FP16 */
+    FP8 b; /**< imaginary part of FP16 */
+} FP16;
+
+
+/* FP16 prototypes */
+/**	@brief Tests for FP16 equal to zero
+ *
+	@param x FP16 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP16_iszilch(FP16 *x);
+/**	@brief Tests for FP16 equal to unity
+ *
+	@param x FP16 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP16_isunity(FP16 *x);
+/**	@brief Tests for equality of two FP16s
+ *
+	@param x FP16 instance to be compared
+	@param y FP16 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP16_equals(FP16 *x, FP16 *y);
+
+/**	@brief Serialize in FP16  
+ *
+    @param b buffer for output
+	@param x FP16 number to be serialized
+ */
+extern void FP16_toBytes(char *b,FP16 *x);
+/**	@brief Serialize out FP16  
+ *
+	@param x FP16 number to be serialized
+    @param b buffer for input
+ */
+extern void FP16_fromBytes(FP16 *x,char *b);
+
+/**	@brief Tests for FP16 having only a real part and no imaginary part
+ *
+	@param x FP16 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP16_isreal(FP16 *x);
+/**	@brief Initialise FP16 from two FP8s
+ *
+	@param x FP16 instance to be initialised
+	@param a FP8 to form real part of FP16
+	@param b FP8 to form imaginary part of FP16
+ */
+extern void FP16_from_FP8s(FP16 *x, FP8 *a, FP8 *b);
+/**	@brief Initialise FP16 from single FP8
+ *
+	Imaginary part is set to zero
+	@param x FP16 instance to be initialised
+	@param a FP8 to form real part of FP16
+ */
+extern void FP16_from_FP8(FP16 *x, FP8 *a);
+
+/**	@brief Initialise FP16 from single FP8
+ *
+	real part is set to zero
+	@param x FP16 instance to be initialised
+	@param a FP8 to form imaginary part of FP16
+ */
+extern void FP16_from_FP8H(FP16 *x, FP8 *a);
+
+
+/**	@brief Copy FP16 to another FP16
+ *
+	@param x FP16 instance, on exit = y
+	@param y FP16 instance to be copied
+ */
+extern void FP16_copy(FP16 *x, FP16 *y);
+/**	@brief Set FP16 to zero
+ *
+	@param x FP16 instance to be set to zero
+ */
+extern void FP16_zero(FP16 *x);
+/**	@brief Set FP16 to unity
+ *
+	@param x FP16 instance to be set to one
+ */
+extern void FP16_one(FP16 *x);
+/**	@brief Negation of FP16
+ *
+	@param x FP16 instance, on exit = -y
+	@param y FP16 instance
+ */
+extern void FP16_neg(FP16 *x, FP16 *y);
+/**	@brief Conjugation of FP16
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP16 instance, on exit = conj(y)
+	@param y FP16 instance
+ */
+extern void FP16_conj(FP16 *x, FP16 *y);
+/**	@brief Negative conjugation of FP16
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP16 instance, on exit = -conj(y)
+	@param y FP16 instance
+ */
+extern void FP16_nconj(FP16 *x, FP16 *y);
+/**	@brief addition of two FP16s
+ *
+	@param x FP16 instance, on exit = y+z
+	@param y FP16 instance
+	@param z FP16 instance
+ */
+extern void FP16_add(FP16 *x, FP16 *y, FP16 *z);
+/**	@brief subtraction of two FP16s
+ *
+	@param x FP16 instance, on exit = y-z
+	@param y FP16 instance
+	@param z FP16 instance
+ */
+extern void FP16_sub(FP16 *x, FP16 *y, FP16 *z);
+/**	@brief Multiplication of an FP16 by an FP8
+ *
+	@param x FP16 instance, on exit = y*a
+	@param y FP16 instance
+	@param a FP4 multiplier
+ */
+extern void FP16_pmul(FP16 *x, FP16 *y, FP8 *a);
+
+/**	@brief Multiplication of an FP16 by an FP2
+ *
+	@param x FP16 instance, on exit = y*a
+	@param y FP16 instance
+	@param a FP2 multiplier
+ */
+extern void FP16_qmul(FP16 *x, FP16 *y, FP2 *a);
+
+
+/**	@brief Multiplication of an FP16 by an FP
+ *
+	@param x FP16 instance, on exit = y*a
+	@param y FP16 instance
+	@param a FP multiplier
+ */
+extern void FP16_tmul(FP16 *x, FP16 *y, FP *a);
+
+
+
+/**	@brief Multiplication of an FP16 by a small integer
+ *
+	@param x FP16 instance, on exit = y*i
+	@param y FP16 instance
+	@param i an integer
+ */
+extern void FP16_imul(FP16 *x, FP16 *y, int i);
+/**	@brief Squaring an FP16
+ *
+	@param x FP16 instance, on exit = y^2
+	@param y FP16 instance
+ */
+extern void FP16_sqr(FP16 *x, FP16 *y);
+/**	@brief Multiplication of two FP16s
+ *
+	@param x FP16 instance, on exit = y*z
+	@param y FP16 instance
+	@param z FP16 instance
+ */
+extern void FP16_mul(FP16 *x, FP16 *y, FP16 *z);
+/**	@brief Inverting an FP16
+ *
+	@param x FP16 instance, on exit = 1/y
+	@param y FP16 instance
+ */
+extern void FP16_inv(FP16 *x, FP16 *y);
+/**	@brief Formats and outputs an FP16 to the console
+ *
+	@param x FP16 instance to be printed
+ */
+extern void FP16_output(FP16 *x);
+/**	@brief Formats and outputs an FP16 to the console in raw form (for debugging)
+ *
+	@param x FP16 instance to be printed
+ */
+extern void FP16_rawoutput(FP16 *x);
+/**	@brief multiplies an FP16 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP16 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP16_times_i(FP16 *x);
+/**	@brief multiplies an FP16 instance by irreducible polynomial (1+sqrt(-1))
+ *
+	@param x FP16 instance, on exit = sqrt(1+sqrt(-1))^2*x
+ */
+extern void FP16_times_i2(FP16 *x);
+
+/**	@brief multiplies an FP16 instance by irreducible polynomial (1+sqrt(-1))
+ *
+	@param x FP16 instance, on exit = sqrt(1+sqrt(-1))^4*x
+ */
+extern void FP16_times_i4(FP16 *x);
+
+
+/**	@brief Normalises the components of an FP16
+ *
+	@param x FP16 instance to be normalised
+ */
+extern void FP16_norm(FP16 *x);
+/**	@brief Reduces all components of possibly unreduced FP16 mod Modulus
+ *
+	@param x FP16 instance, on exit reduced mod Modulus
+ */
+extern void FP16_reduce(FP16 *x);
+/**	@brief Raises an FP16 to the power of a BIG
+ *
+	@param x FP16 instance, on exit = y^b
+	@param y FP16 instance
+	@param b BIG number
+ */
+extern void FP16_pow(FP16 *x, FP16 *y, XXX::BIG b);
+/**	@brief Raises an FP16 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP16 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP16_frob(FP16 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP16 instance, on exit = w*x-conj(x)*y+z
+	@param w FP16 instance
+	@param x FP16 instance
+	@param y FP16 instance
+	@param z FP16 instance
+ */
+extern void FP16_xtr_A(FP16 *r, FP16 *w, FP16 *x, FP16 *y, FP16 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP16 instance, on exit = x^2-2*conj(x)
+	@param x FP16 instance
+ */
+extern void FP16_xtr_D(FP16 *r, FP16 *x);
+/**	@brief Calculates FP16 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP16 instance, on exit = trace(w^b)
+	@param x FP16 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP16_xtr_pow(FP16 *r, FP16 *x, XXX::BIG b);
+/**	@brief Calculates FP16 trace of c^a.d^b, where c and d are derived from FP16 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP16 instance, on exit = trace(c^a.d^b)
+	@param c FP16 instance, trace of an FP12
+	@param d FP16 instance, trace of an FP12
+	@param e FP16 instance, trace of an FP12
+	@param f FP16 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP16_xtr_pow2(FP16 *r, FP16 *c, FP16 *d, FP16 *e, FP16 *f, XXX::BIG a, XXX::BIG b);
+
+/**	@brief Conditional copy of FP16 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP16 instance, set to y if s!=0
+	@param y another FP16 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP16_cmove(FP16 *x, FP16 *y, int s);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp16_BLS48286.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp16_BLS48286.h
new file mode 100644
index 0000000..36a9cb9
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp16_BLS48286.h
@@ -0,0 +1,308 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP16_BLS48286_H
+#define FP16_BLS48286_H
+
+#include "fp8_BLS48286.h"
+#include "config_curve_BLS48286.h"
+
+using namespace core;
+
+namespace BLS48286 {
+
+/**
+	@brief FP16 Structure - towered over two FP4
+*/
+
+typedef struct
+{
+    FP8 a; /**< real part of FP16 */
+    FP8 b; /**< imaginary part of FP16 */
+} FP16;
+
+
+/* FP16 prototypes */
+/**	@brief Tests for FP16 equal to zero
+ *
+	@param x FP16 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP16_iszilch(FP16 *x);
+/**	@brief Tests for FP16 equal to unity
+ *
+	@param x FP16 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP16_isunity(FP16 *x);
+/**	@brief Tests for equality of two FP16s
+ *
+	@param x FP16 instance to be compared
+	@param y FP16 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP16_equals(FP16 *x, FP16 *y);
+
+/**	@brief Serialize in FP16  
+ *
+    @param b buffer for output
+	@param x FP16 number to be serialized
+ */
+extern void FP16_toBytes(char *b,FP16 *x);
+/**	@brief Serialize out FP16  
+ *
+	@param x FP16 number to be serialized
+    @param b buffer for input
+ */
+extern void FP16_fromBytes(FP16 *x,char *b);
+
+/**	@brief Tests for FP16 having only a real part and no imaginary part
+ *
+	@param x FP16 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP16_isreal(FP16 *x);
+/**	@brief Initialise FP16 from two FP8s
+ *
+	@param x FP16 instance to be initialised
+	@param a FP8 to form real part of FP16
+	@param b FP8 to form imaginary part of FP16
+ */
+extern void FP16_from_FP8s(FP16 *x, FP8 *a, FP8 *b);
+/**	@brief Initialise FP16 from single FP8
+ *
+	Imaginary part is set to zero
+	@param x FP16 instance to be initialised
+	@param a FP8 to form real part of FP16
+ */
+extern void FP16_from_FP8(FP16 *x, FP8 *a);
+
+/**	@brief Initialise FP16 from single FP8
+ *
+	real part is set to zero
+	@param x FP16 instance to be initialised
+	@param a FP8 to form imaginary part of FP16
+ */
+extern void FP16_from_FP8H(FP16 *x, FP8 *a);
+
+
+/**	@brief Copy FP16 to another FP16
+ *
+	@param x FP16 instance, on exit = y
+	@param y FP16 instance to be copied
+ */
+extern void FP16_copy(FP16 *x, FP16 *y);
+/**	@brief Set FP16 to zero
+ *
+	@param x FP16 instance to be set to zero
+ */
+extern void FP16_zero(FP16 *x);
+/**	@brief Set FP16 to unity
+ *
+	@param x FP16 instance to be set to one
+ */
+extern void FP16_one(FP16 *x);
+/**	@brief Negation of FP16
+ *
+	@param x FP16 instance, on exit = -y
+	@param y FP16 instance
+ */
+extern void FP16_neg(FP16 *x, FP16 *y);
+/**	@brief Conjugation of FP16
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP16 instance, on exit = conj(y)
+	@param y FP16 instance
+ */
+extern void FP16_conj(FP16 *x, FP16 *y);
+/**	@brief Negative conjugation of FP16
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP16 instance, on exit = -conj(y)
+	@param y FP16 instance
+ */
+extern void FP16_nconj(FP16 *x, FP16 *y);
+/**	@brief addition of two FP16s
+ *
+	@param x FP16 instance, on exit = y+z
+	@param y FP16 instance
+	@param z FP16 instance
+ */
+extern void FP16_add(FP16 *x, FP16 *y, FP16 *z);
+/**	@brief subtraction of two FP16s
+ *
+	@param x FP16 instance, on exit = y-z
+	@param y FP16 instance
+	@param z FP16 instance
+ */
+extern void FP16_sub(FP16 *x, FP16 *y, FP16 *z);
+/**	@brief Multiplication of an FP16 by an FP8
+ *
+	@param x FP16 instance, on exit = y*a
+	@param y FP16 instance
+	@param a FP4 multiplier
+ */
+extern void FP16_pmul(FP16 *x, FP16 *y, FP8 *a);
+
+/**	@brief Multiplication of an FP16 by an FP2
+ *
+	@param x FP16 instance, on exit = y*a
+	@param y FP16 instance
+	@param a FP2 multiplier
+ */
+extern void FP16_qmul(FP16 *x, FP16 *y, FP2 *a);
+
+
+/**	@brief Multiplication of an FP16 by an FP
+ *
+	@param x FP16 instance, on exit = y*a
+	@param y FP16 instance
+	@param a FP multiplier
+ */
+extern void FP16_tmul(FP16 *x, FP16 *y, FP *a);
+
+
+
+/**	@brief Multiplication of an FP16 by a small integer
+ *
+	@param x FP16 instance, on exit = y*i
+	@param y FP16 instance
+	@param i an integer
+ */
+extern void FP16_imul(FP16 *x, FP16 *y, int i);
+/**	@brief Squaring an FP16
+ *
+	@param x FP16 instance, on exit = y^2
+	@param y FP16 instance
+ */
+extern void FP16_sqr(FP16 *x, FP16 *y);
+/**	@brief Multiplication of two FP16s
+ *
+	@param x FP16 instance, on exit = y*z
+	@param y FP16 instance
+	@param z FP16 instance
+ */
+extern void FP16_mul(FP16 *x, FP16 *y, FP16 *z);
+/**	@brief Inverting an FP16
+ *
+	@param x FP16 instance, on exit = 1/y
+	@param y FP16 instance
+ */
+extern void FP16_inv(FP16 *x, FP16 *y);
+/**	@brief Formats and outputs an FP16 to the console
+ *
+	@param x FP16 instance to be printed
+ */
+extern void FP16_output(FP16 *x);
+/**	@brief Formats and outputs an FP16 to the console in raw form (for debugging)
+ *
+	@param x FP16 instance to be printed
+ */
+extern void FP16_rawoutput(FP16 *x);
+/**	@brief multiplies an FP16 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP16 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP16_times_i(FP16 *x);
+/**	@brief multiplies an FP16 instance by irreducible polynomial (1+sqrt(-1))
+ *
+	@param x FP16 instance, on exit = sqrt(1+sqrt(-1))^2*x
+ */
+extern void FP16_times_i2(FP16 *x);
+
+/**	@brief multiplies an FP16 instance by irreducible polynomial (1+sqrt(-1))
+ *
+	@param x FP16 instance, on exit = sqrt(1+sqrt(-1))^4*x
+ */
+extern void FP16_times_i4(FP16 *x);
+
+
+/**	@brief Normalises the components of an FP16
+ *
+	@param x FP16 instance to be normalised
+ */
+extern void FP16_norm(FP16 *x);
+/**	@brief Reduces all components of possibly unreduced FP16 mod Modulus
+ *
+	@param x FP16 instance, on exit reduced mod Modulus
+ */
+extern void FP16_reduce(FP16 *x);
+/**	@brief Raises an FP16 to the power of a BIG
+ *
+	@param x FP16 instance, on exit = y^b
+	@param y FP16 instance
+	@param b BIG number
+ */
+extern void FP16_pow(FP16 *x, FP16 *y, B288_60::BIG b);
+/**	@brief Raises an FP16 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP16 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP16_frob(FP16 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP16 instance, on exit = w*x-conj(x)*y+z
+	@param w FP16 instance
+	@param x FP16 instance
+	@param y FP16 instance
+	@param z FP16 instance
+ */
+extern void FP16_xtr_A(FP16 *r, FP16 *w, FP16 *x, FP16 *y, FP16 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP16 instance, on exit = x^2-2*conj(x)
+	@param x FP16 instance
+ */
+extern void FP16_xtr_D(FP16 *r, FP16 *x);
+/**	@brief Calculates FP16 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP16 instance, on exit = trace(w^b)
+	@param x FP16 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP16_xtr_pow(FP16 *r, FP16 *x, B288_60::BIG b);
+/**	@brief Calculates FP16 trace of c^a.d^b, where c and d are derived from FP16 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP16 instance, on exit = trace(c^a.d^b)
+	@param c FP16 instance, trace of an FP12
+	@param d FP16 instance, trace of an FP12
+	@param e FP16 instance, trace of an FP12
+	@param f FP16 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP16_xtr_pow2(FP16 *r, FP16 *c, FP16 *d, FP16 *e, FP16 *f, B288_60::BIG a, B288_60::BIG b);
+
+/**	@brief Conditional copy of FP16 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP16 instance, set to y if s!=0
+	@param y another FP16 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP16_cmove(FP16 *x, FP16 *y, int s);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp16_BLS48556.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp16_BLS48556.h
new file mode 100644
index 0000000..e3811dc
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp16_BLS48556.h
@@ -0,0 +1,308 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP16_BLS48556_H
+#define FP16_BLS48556_H
+
+#include "fp8_BLS48556.h"
+#include "config_curve_BLS48556.h"
+
+using namespace core;
+
+namespace BLS48556 {
+
+/**
+	@brief FP16 Structure - towered over two FP4
+*/
+
+typedef struct
+{
+    FP8 a; /**< real part of FP16 */
+    FP8 b; /**< imaginary part of FP16 */
+} FP16;
+
+
+/* FP16 prototypes */
+/**	@brief Tests for FP16 equal to zero
+ *
+	@param x FP16 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP16_iszilch(FP16 *x);
+/**	@brief Tests for FP16 equal to unity
+ *
+	@param x FP16 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP16_isunity(FP16 *x);
+/**	@brief Tests for equality of two FP16s
+ *
+	@param x FP16 instance to be compared
+	@param y FP16 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP16_equals(FP16 *x, FP16 *y);
+
+/**	@brief Serialize in FP16  
+ *
+    @param b buffer for output
+	@param x FP16 number to be serialized
+ */
+extern void FP16_toBytes(char *b,FP16 *x);
+/**	@brief Serialize out FP16  
+ *
+	@param x FP16 number to be serialized
+    @param b buffer for input
+ */
+extern void FP16_fromBytes(FP16 *x,char *b);
+
+/**	@brief Tests for FP16 having only a real part and no imaginary part
+ *
+	@param x FP16 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP16_isreal(FP16 *x);
+/**	@brief Initialise FP16 from two FP8s
+ *
+	@param x FP16 instance to be initialised
+	@param a FP8 to form real part of FP16
+	@param b FP8 to form imaginary part of FP16
+ */
+extern void FP16_from_FP8s(FP16 *x, FP8 *a, FP8 *b);
+/**	@brief Initialise FP16 from single FP8
+ *
+	Imaginary part is set to zero
+	@param x FP16 instance to be initialised
+	@param a FP8 to form real part of FP16
+ */
+extern void FP16_from_FP8(FP16 *x, FP8 *a);
+
+/**	@brief Initialise FP16 from single FP8
+ *
+	real part is set to zero
+	@param x FP16 instance to be initialised
+	@param a FP8 to form imaginary part of FP16
+ */
+extern void FP16_from_FP8H(FP16 *x, FP8 *a);
+
+
+/**	@brief Copy FP16 to another FP16
+ *
+	@param x FP16 instance, on exit = y
+	@param y FP16 instance to be copied
+ */
+extern void FP16_copy(FP16 *x, FP16 *y);
+/**	@brief Set FP16 to zero
+ *
+	@param x FP16 instance to be set to zero
+ */
+extern void FP16_zero(FP16 *x);
+/**	@brief Set FP16 to unity
+ *
+	@param x FP16 instance to be set to one
+ */
+extern void FP16_one(FP16 *x);
+/**	@brief Negation of FP16
+ *
+	@param x FP16 instance, on exit = -y
+	@param y FP16 instance
+ */
+extern void FP16_neg(FP16 *x, FP16 *y);
+/**	@brief Conjugation of FP16
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP16 instance, on exit = conj(y)
+	@param y FP16 instance
+ */
+extern void FP16_conj(FP16 *x, FP16 *y);
+/**	@brief Negative conjugation of FP16
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP16 instance, on exit = -conj(y)
+	@param y FP16 instance
+ */
+extern void FP16_nconj(FP16 *x, FP16 *y);
+/**	@brief addition of two FP16s
+ *
+	@param x FP16 instance, on exit = y+z
+	@param y FP16 instance
+	@param z FP16 instance
+ */
+extern void FP16_add(FP16 *x, FP16 *y, FP16 *z);
+/**	@brief subtraction of two FP16s
+ *
+	@param x FP16 instance, on exit = y-z
+	@param y FP16 instance
+	@param z FP16 instance
+ */
+extern void FP16_sub(FP16 *x, FP16 *y, FP16 *z);
+/**	@brief Multiplication of an FP16 by an FP8
+ *
+	@param x FP16 instance, on exit = y*a
+	@param y FP16 instance
+	@param a FP4 multiplier
+ */
+extern void FP16_pmul(FP16 *x, FP16 *y, FP8 *a);
+
+/**	@brief Multiplication of an FP16 by an FP2
+ *
+	@param x FP16 instance, on exit = y*a
+	@param y FP16 instance
+	@param a FP2 multiplier
+ */
+extern void FP16_qmul(FP16 *x, FP16 *y, FP2 *a);
+
+
+/**	@brief Multiplication of an FP16 by an FP
+ *
+	@param x FP16 instance, on exit = y*a
+	@param y FP16 instance
+	@param a FP multiplier
+ */
+extern void FP16_tmul(FP16 *x, FP16 *y, FP *a);
+
+
+
+/**	@brief Multiplication of an FP16 by a small integer
+ *
+	@param x FP16 instance, on exit = y*i
+	@param y FP16 instance
+	@param i an integer
+ */
+extern void FP16_imul(FP16 *x, FP16 *y, int i);
+/**	@brief Squaring an FP16
+ *
+	@param x FP16 instance, on exit = y^2
+	@param y FP16 instance
+ */
+extern void FP16_sqr(FP16 *x, FP16 *y);
+/**	@brief Multiplication of two FP16s
+ *
+	@param x FP16 instance, on exit = y*z
+	@param y FP16 instance
+	@param z FP16 instance
+ */
+extern void FP16_mul(FP16 *x, FP16 *y, FP16 *z);
+/**	@brief Inverting an FP16
+ *
+	@param x FP16 instance, on exit = 1/y
+	@param y FP16 instance
+ */
+extern void FP16_inv(FP16 *x, FP16 *y);
+/**	@brief Formats and outputs an FP16 to the console
+ *
+	@param x FP16 instance to be printed
+ */
+extern void FP16_output(FP16 *x);
+/**	@brief Formats and outputs an FP16 to the console in raw form (for debugging)
+ *
+	@param x FP16 instance to be printed
+ */
+extern void FP16_rawoutput(FP16 *x);
+/**	@brief multiplies an FP16 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP16 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP16_times_i(FP16 *x);
+/**	@brief multiplies an FP16 instance by irreducible polynomial (1+sqrt(-1))
+ *
+	@param x FP16 instance, on exit = sqrt(1+sqrt(-1))^2*x
+ */
+extern void FP16_times_i2(FP16 *x);
+
+/**	@brief multiplies an FP16 instance by irreducible polynomial (1+sqrt(-1))
+ *
+	@param x FP16 instance, on exit = sqrt(1+sqrt(-1))^4*x
+ */
+extern void FP16_times_i4(FP16 *x);
+
+
+/**	@brief Normalises the components of an FP16
+ *
+	@param x FP16 instance to be normalised
+ */
+extern void FP16_norm(FP16 *x);
+/**	@brief Reduces all components of possibly unreduced FP16 mod Modulus
+ *
+	@param x FP16 instance, on exit reduced mod Modulus
+ */
+extern void FP16_reduce(FP16 *x);
+/**	@brief Raises an FP16 to the power of a BIG
+ *
+	@param x FP16 instance, on exit = y^b
+	@param y FP16 instance
+	@param b BIG number
+ */
+extern void FP16_pow(FP16 *x, FP16 *y, B560_58::BIG b);
+/**	@brief Raises an FP16 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP16 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP16_frob(FP16 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP16 instance, on exit = w*x-conj(x)*y+z
+	@param w FP16 instance
+	@param x FP16 instance
+	@param y FP16 instance
+	@param z FP16 instance
+ */
+extern void FP16_xtr_A(FP16 *r, FP16 *w, FP16 *x, FP16 *y, FP16 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP16 instance, on exit = x^2-2*conj(x)
+	@param x FP16 instance
+ */
+extern void FP16_xtr_D(FP16 *r, FP16 *x);
+/**	@brief Calculates FP16 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP16 instance, on exit = trace(w^b)
+	@param x FP16 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP16_xtr_pow(FP16 *r, FP16 *x, B560_58::BIG b);
+/**	@brief Calculates FP16 trace of c^a.d^b, where c and d are derived from FP16 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP16 instance, on exit = trace(c^a.d^b)
+	@param c FP16 instance, trace of an FP12
+	@param d FP16 instance, trace of an FP12
+	@param e FP16 instance, trace of an FP12
+	@param f FP16 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP16_xtr_pow2(FP16 *r, FP16 *c, FP16 *d, FP16 *e, FP16 *f, B560_58::BIG a, B560_58::BIG b);
+
+/**	@brief Conditional copy of FP16 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP16 instance, set to y if s!=0
+	@param y another FP16 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP16_cmove(FP16 *x, FP16 *y, int s);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp16_BLS48581.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp16_BLS48581.h
new file mode 100644
index 0000000..d0e7754
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp16_BLS48581.h
@@ -0,0 +1,308 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP16_BLS48581_H
+#define FP16_BLS48581_H
+
+#include "fp8_BLS48581.h"
+#include "config_curve_BLS48581.h"
+
+using namespace core;
+
+namespace BLS48581 {
+
+/**
+	@brief FP16 Structure - towered over two FP4
+*/
+
+typedef struct
+{
+    FP8 a; /**< real part of FP16 */
+    FP8 b; /**< imaginary part of FP16 */
+} FP16;
+
+
+/* FP16 prototypes */
+/**	@brief Tests for FP16 equal to zero
+ *
+	@param x FP16 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP16_iszilch(FP16 *x);
+/**	@brief Tests for FP16 equal to unity
+ *
+	@param x FP16 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP16_isunity(FP16 *x);
+/**	@brief Tests for equality of two FP16s
+ *
+	@param x FP16 instance to be compared
+	@param y FP16 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP16_equals(FP16 *x, FP16 *y);
+
+/**	@brief Serialize in FP16  
+ *
+    @param b buffer for output
+	@param x FP16 number to be serialized
+ */
+extern void FP16_toBytes(char *b,FP16 *x);
+/**	@brief Serialize out FP16  
+ *
+	@param x FP16 number to be serialized
+    @param b buffer for input
+ */
+extern void FP16_fromBytes(FP16 *x,char *b);
+
+/**	@brief Tests for FP16 having only a real part and no imaginary part
+ *
+	@param x FP16 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP16_isreal(FP16 *x);
+/**	@brief Initialise FP16 from two FP8s
+ *
+	@param x FP16 instance to be initialised
+	@param a FP8 to form real part of FP16
+	@param b FP8 to form imaginary part of FP16
+ */
+extern void FP16_from_FP8s(FP16 *x, FP8 *a, FP8 *b);
+/**	@brief Initialise FP16 from single FP8
+ *
+	Imaginary part is set to zero
+	@param x FP16 instance to be initialised
+	@param a FP8 to form real part of FP16
+ */
+extern void FP16_from_FP8(FP16 *x, FP8 *a);
+
+/**	@brief Initialise FP16 from single FP8
+ *
+	real part is set to zero
+	@param x FP16 instance to be initialised
+	@param a FP8 to form imaginary part of FP16
+ */
+extern void FP16_from_FP8H(FP16 *x, FP8 *a);
+
+
+/**	@brief Copy FP16 to another FP16
+ *
+	@param x FP16 instance, on exit = y
+	@param y FP16 instance to be copied
+ */
+extern void FP16_copy(FP16 *x, FP16 *y);
+/**	@brief Set FP16 to zero
+ *
+	@param x FP16 instance to be set to zero
+ */
+extern void FP16_zero(FP16 *x);
+/**	@brief Set FP16 to unity
+ *
+	@param x FP16 instance to be set to one
+ */
+extern void FP16_one(FP16 *x);
+/**	@brief Negation of FP16
+ *
+	@param x FP16 instance, on exit = -y
+	@param y FP16 instance
+ */
+extern void FP16_neg(FP16 *x, FP16 *y);
+/**	@brief Conjugation of FP16
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP16 instance, on exit = conj(y)
+	@param y FP16 instance
+ */
+extern void FP16_conj(FP16 *x, FP16 *y);
+/**	@brief Negative conjugation of FP16
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP16 instance, on exit = -conj(y)
+	@param y FP16 instance
+ */
+extern void FP16_nconj(FP16 *x, FP16 *y);
+/**	@brief addition of two FP16s
+ *
+	@param x FP16 instance, on exit = y+z
+	@param y FP16 instance
+	@param z FP16 instance
+ */
+extern void FP16_add(FP16 *x, FP16 *y, FP16 *z);
+/**	@brief subtraction of two FP16s
+ *
+	@param x FP16 instance, on exit = y-z
+	@param y FP16 instance
+	@param z FP16 instance
+ */
+extern void FP16_sub(FP16 *x, FP16 *y, FP16 *z);
+/**	@brief Multiplication of an FP16 by an FP8
+ *
+	@param x FP16 instance, on exit = y*a
+	@param y FP16 instance
+	@param a FP4 multiplier
+ */
+extern void FP16_pmul(FP16 *x, FP16 *y, FP8 *a);
+
+/**	@brief Multiplication of an FP16 by an FP2
+ *
+	@param x FP16 instance, on exit = y*a
+	@param y FP16 instance
+	@param a FP2 multiplier
+ */
+extern void FP16_qmul(FP16 *x, FP16 *y, FP2 *a);
+
+
+/**	@brief Multiplication of an FP16 by an FP
+ *
+	@param x FP16 instance, on exit = y*a
+	@param y FP16 instance
+	@param a FP multiplier
+ */
+extern void FP16_tmul(FP16 *x, FP16 *y, FP *a);
+
+
+
+/**	@brief Multiplication of an FP16 by a small integer
+ *
+	@param x FP16 instance, on exit = y*i
+	@param y FP16 instance
+	@param i an integer
+ */
+extern void FP16_imul(FP16 *x, FP16 *y, int i);
+/**	@brief Squaring an FP16
+ *
+	@param x FP16 instance, on exit = y^2
+	@param y FP16 instance
+ */
+extern void FP16_sqr(FP16 *x, FP16 *y);
+/**	@brief Multiplication of two FP16s
+ *
+	@param x FP16 instance, on exit = y*z
+	@param y FP16 instance
+	@param z FP16 instance
+ */
+extern void FP16_mul(FP16 *x, FP16 *y, FP16 *z);
+/**	@brief Inverting an FP16
+ *
+	@param x FP16 instance, on exit = 1/y
+	@param y FP16 instance
+ */
+extern void FP16_inv(FP16 *x, FP16 *y);
+/**	@brief Formats and outputs an FP16 to the console
+ *
+	@param x FP16 instance to be printed
+ */
+extern void FP16_output(FP16 *x);
+/**	@brief Formats and outputs an FP16 to the console in raw form (for debugging)
+ *
+	@param x FP16 instance to be printed
+ */
+extern void FP16_rawoutput(FP16 *x);
+/**	@brief multiplies an FP16 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP16 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP16_times_i(FP16 *x);
+/**	@brief multiplies an FP16 instance by irreducible polynomial (1+sqrt(-1))
+ *
+	@param x FP16 instance, on exit = sqrt(1+sqrt(-1))^2*x
+ */
+extern void FP16_times_i2(FP16 *x);
+
+/**	@brief multiplies an FP16 instance by irreducible polynomial (1+sqrt(-1))
+ *
+	@param x FP16 instance, on exit = sqrt(1+sqrt(-1))^4*x
+ */
+extern void FP16_times_i4(FP16 *x);
+
+
+/**	@brief Normalises the components of an FP16
+ *
+	@param x FP16 instance to be normalised
+ */
+extern void FP16_norm(FP16 *x);
+/**	@brief Reduces all components of possibly unreduced FP16 mod Modulus
+ *
+	@param x FP16 instance, on exit reduced mod Modulus
+ */
+extern void FP16_reduce(FP16 *x);
+/**	@brief Raises an FP16 to the power of a BIG
+ *
+	@param x FP16 instance, on exit = y^b
+	@param y FP16 instance
+	@param b BIG number
+ */
+extern void FP16_pow(FP16 *x, FP16 *y, B584_60::BIG b);
+/**	@brief Raises an FP16 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP16 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP16_frob(FP16 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP16 instance, on exit = w*x-conj(x)*y+z
+	@param w FP16 instance
+	@param x FP16 instance
+	@param y FP16 instance
+	@param z FP16 instance
+ */
+extern void FP16_xtr_A(FP16 *r, FP16 *w, FP16 *x, FP16 *y, FP16 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP16 instance, on exit = x^2-2*conj(x)
+	@param x FP16 instance
+ */
+extern void FP16_xtr_D(FP16 *r, FP16 *x);
+/**	@brief Calculates FP16 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP16 instance, on exit = trace(w^b)
+	@param x FP16 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP16_xtr_pow(FP16 *r, FP16 *x, B584_60::BIG b);
+/**	@brief Calculates FP16 trace of c^a.d^b, where c and d are derived from FP16 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP16 instance, on exit = trace(c^a.d^b)
+	@param c FP16 instance, trace of an FP12
+	@param d FP16 instance, trace of an FP12
+	@param e FP16 instance, trace of an FP12
+	@param f FP16 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP16_xtr_pow2(FP16 *r, FP16 *c, FP16 *d, FP16 *e, FP16 *f, B584_60::BIG a, B584_60::BIG b);
+
+/**	@brief Conditional copy of FP16 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP16 instance, set to y if s!=0
+	@param y another FP16 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP16_cmove(FP16 *x, FP16 *y, int s);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp2.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp2.cpp
new file mode 100644
index 0000000..4c8fc67
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp2.cpp
@@ -0,0 +1,527 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* CORE Fp^2 functions */
+/* SU=m, m is Stack Usage (no lazy )*/
+
+/* FP2 elements are of the form a+ib, where i is sqrt(-1) */
+
+#include "fp2_YYY.h"
+
+//namespace YYY {
+//extern int fp2muls;
+//extern int fp2sqrs;
+//}
+
+using namespace XXX;
+
+/* test x==0 ? */
+/* SU= 8 */
+int YYY::FP2_iszilch(FP2 *x)
+{
+    return (FP_iszilch(&(x->a)) & FP_iszilch(&(x->b)));
+}
+
+/* Move g to f if d=1 */
+void YYY::FP2_cmove(FP2 *f, FP2 *g, int d)
+{
+    FP_cmove(&(f->a), &(g->a), d);
+    FP_cmove(&(f->b), &(g->b), d);
+}
+
+/* test x==1 ? */
+/* SU= 48 */
+int YYY::FP2_isunity(FP2 *x)
+{
+    FP one;
+    FP_one(&one);
+    return (FP_equals(&(x->a), &one) & FP_iszilch(&(x->b)));
+}
+
+/* SU= 8 */
+/* Fully reduce a and b mod Modulus */
+void YYY::FP2_reduce(FP2 *w)
+{
+    FP_reduce(&(w->a));
+    FP_reduce(&(w->b));
+}
+
+/* return 1 if x==y, else 0 */
+/* SU= 16 */
+int YYY::FP2_equals(FP2 *x, FP2 *y)
+{
+    return (FP_equals(&(x->a), &(y->a)) & FP_equals(&(x->b), &(y->b)));
+}
+
+// Is x lexically larger than p-x?
+// return -1 for no, 0 if x=0, 1 for yes
+int YYY::FP2_islarger(FP2 *x)
+{
+    int cmp;
+    if (FP2_iszilch(x)) return 0;
+    cmp=FP_islarger(&(x->b));
+    if (cmp!=0) return cmp;
+    return FP_islarger(&(x->a));
+}
+
+void YYY::FP2_toBytes(char *b,FP2 *x)
+{
+    FP_toBytes(b,&(x->b));
+    FP_toBytes(&b[MODBYTES_XXX],&(x->a));
+}
+
+void YYY::FP2_fromBytes(FP2 *x,char *b)
+{
+    FP_fromBytes(&(x->b),b);
+    FP_fromBytes(&(x->a),&b[MODBYTES_XXX]);
+}
+
+/* Create FP2 from two FPs */
+/* SU= 16 */
+void YYY::FP2_from_FPs(FP2 *w, FP *x, FP *y)
+{
+    FP_copy(&(w->a), x);
+    FP_copy(&(w->b), y);
+}
+
+/* Create FP2 from two BIGS */
+/* SU= 16 */
+void YYY::FP2_from_BIGs(FP2 *w, BIG x, BIG y)
+{
+    FP_nres(&(w->a), x);
+    FP_nres(&(w->b), y);
+}
+
+/* Create FP2 from two ints */
+void YYY::FP2_from_ints(FP2 *w, int xa, int xb)
+{
+    FP a,b;
+    FP_from_int(&a,xa);
+    FP_from_int(&b,xb);
+    FP2_from_FPs(w,&a,&b);
+}
+
+/* Create FP2 from FP */
+/* SU= 8 */
+void YYY::FP2_from_FP(FP2 *w, FP *x)
+{
+    FP_copy(&(w->a), x);
+    FP_zero(&(w->b));
+}
+
+/* Create FP2 from BIG */
+/* SU= 8 */
+void YYY::FP2_from_BIG(FP2 *w, BIG x)
+{
+    FP_nres(&(w->a), x);
+    FP_zero(&(w->b));
+}
+
+/* FP2 copy w=x */
+/* SU= 16 */
+void YYY::FP2_copy(FP2 *w, FP2 *x)
+{
+    if (w == x) return;
+    FP_copy(&(w->a), &(x->a));
+    FP_copy(&(w->b), &(x->b));
+}
+
+/* FP2 set w=0 */
+/* SU= 8 */
+void YYY::FP2_zero(FP2 *w)
+{
+    FP_zero(&(w->a));
+    FP_zero(&(w->b));
+}
+
+/* FP2 set w=1 */
+/* SU= 48 */
+void YYY::FP2_one(FP2 *w)
+{
+    FP one;
+    FP_one(&one);
+    FP2_from_FP(w, &one);
+}
+
+void YYY::FP2_rcopy(FP2 *w,const BIG a,const BIG b)
+{
+    FP_rcopy(&(w->a),a);
+    FP_rcopy(&(w->b),b);
+}
+
+int YYY::FP2_sign(FP2 *w)
+{
+    int p1,p2;
+    p1=FP_sign(&(w->a));
+    p2=FP_sign(&(w->b));
+#ifdef BIG_ENDIAN_SIGN_YYY
+    p2 ^= (p1 ^ p2)&FP_iszilch(&(w->b));
+    return p2;
+#else
+    p1 ^= (p1 ^ p2)&FP_iszilch(&(w->a));
+    return p1;
+#endif
+
+}
+
+/* Set w=-x */
+/* SU= 88 */
+void YYY::FP2_neg(FP2 *w, FP2 *x)
+{
+    /* Just one neg! */
+    FP m, t;
+    FP_add(&m, &(x->a), &(x->b));
+    FP_neg(&m, &m);
+    FP_add(&t, &m, &(x->b));
+    FP_add(&(w->b), &m, &(x->a));
+    FP_copy(&(w->a), &t);
+
+}
+
+/* Set w=conj(x) */
+/* SU= 16 */
+void YYY::FP2_conj(FP2 *w, FP2 *x)
+{
+    FP_copy(&(w->a), &(x->a));
+    FP_neg(&(w->b), &(x->b));
+    FP_norm(&(w->b));
+}
+
+/* Set w=x+y */
+/* SU= 16 */
+void YYY::FP2_add(FP2 *w, FP2 *x, FP2 *y)
+{
+    FP_add(&(w->a), &(x->a), &(y->a));
+    FP_add(&(w->b), &(x->b), &(y->b));
+}
+
+/* Set w=x-y */
+/* Input y MUST be normed */
+void YYY::FP2_sub(FP2 *w, FP2 *x, FP2 *y)
+{
+    FP2 m;
+    FP2_neg(&m, y);
+    FP2_add(w, x, &m);
+}
+
+/* Set w=s*x, where s is FP */
+/* SU= 16 */
+void YYY::FP2_pmul(FP2 *w, FP2 *x, FP *s)
+{
+    FP_mul(&(w->a), &(x->a), s);
+    FP_mul(&(w->b), &(x->b), s);
+}
+
+/* SU= 16 */
+/* Set w=s*x, where s is int */
+void YYY::FP2_imul(FP2 *w, FP2 *x, int s)
+{
+    FP_imul(&(w->a), &(x->a), s);
+    FP_imul(&(w->b), &(x->b), s);
+}
+
+/* Set w=x^2 */
+/* SU= 128 */
+void YYY::FP2_sqr(FP2 *w, FP2 *x)
+{
+    FP w1, w3, mb;
+
+    FP_add(&w1, &(x->a), &(x->b));
+    FP_neg(&mb, &(x->b));
+
+    FP_add(&w3, &(x->a), &(x->a));
+    FP_norm(&w3);
+    FP_mul(&(w->b), &w3, &(x->b));
+
+    FP_add(&(w->a), &(x->a), &mb);
+
+    FP_norm(&w1);
+    FP_norm(&(w->a));
+
+    FP_mul(&(w->a), &w1, &(w->a));   /* w->a#2 w->a=1 w1&w2=6 w1*w2=2 */
+
+//  YYY::fp2sqrs++;
+}
+
+
+/* Set w=x*y */
+/* Inputs MUST be normed  */
+/* Now uses Lazy reduction */
+void YYY::FP2_mul(FP2 *w, FP2 *x, FP2 *y)
+{
+    DBIG A, B, E, F, pR;
+    BIG C, D, p;
+
+    BIG_rcopy(p, Modulus);
+    BIG_dsucopy(pR, p);
+
+// reduce excesses of a and b as required (so product < pR)
+
+    if ((sign64)(x->a.XES + x->b.XES) * (y->a.XES + y->b.XES) > (sign64)FEXCESS_YYY)
+    {
+#ifdef DEBUG_REDUCE
+        printf("FP2 Product too large - reducing it\n");
+#endif
+        if (x->a.XES > 1) FP_reduce(&(x->a));
+        if (x->b.XES > 1) FP_reduce(&(x->b));
+    }
+
+    BIG_mul(A, x->a.g, y->a.g);
+    BIG_mul(B, x->b.g, y->b.g);
+
+    BIG_add(C, x->a.g, x->b.g); BIG_norm(C);
+    BIG_add(D, y->a.g, y->b.g); BIG_norm(D);
+
+    BIG_mul(E, C, D);
+    BIG_dadd(F, A, B);
+    BIG_dsub(B, pR, B); //
+
+    BIG_dadd(A, A, B);  // A<pR? Not necessarily, but <2pR
+    BIG_dsub(E, E, F);  // E<pR ? Yes
+
+    BIG_dnorm(A); FP_mod(w->a.g, A);  w->a.XES = 3; // may drift above 2p...
+    BIG_dnorm(E); FP_mod(w->b.g, E);  w->b.XES = 2;
+
+//  YYY::fp2muls++;
+}
+
+/* output FP2 in hex format [a,b] */
+/* SU= 16 */
+void YYY::FP2_output(FP2 *w)
+{
+    BIG bx, by;
+    FP2_reduce(w);
+    FP_redc(bx, &(w->a));
+    FP_redc(by, &(w->b));
+    printf("[");
+    BIG_output(bx);
+    printf(",");
+    BIG_output(by);
+    printf("]");
+    FP_nres(&(w->a), bx);
+    FP_nres(&(w->b), by);
+}
+
+/* SU= 8 */
+void YYY::FP2_rawoutput(FP2 *w)
+{
+    printf("[");
+    BIG_rawoutput(w->a.g);
+    printf(",");
+    BIG_rawoutput(w->b.g);
+    printf("]");
+}
+
+
+/* Set w=1/x */
+/* SU= 128 */
+void YYY::FP2_inv(FP2 *w, FP2 *x, FP *h)
+{
+    FP w1, w2;
+
+    FP2_norm(x);
+    FP_sqr(&w1, &(x->a));
+    FP_sqr(&w2, &(x->b));
+    FP_add(&w1, &w1, &w2);
+    FP_inv(&w1, &w1, h);
+    FP_mul(&(w->a), &(x->a), &w1);
+    FP_neg(&w1, &w1);
+    FP_norm(&w1);
+    FP_mul(&(w->b), &(x->b), &w1);
+}
+
+
+/* Set w=x/2 */
+/* SU= 16 */
+void YYY::FP2_div2(FP2 *w, FP2 *x)
+{
+    FP_div2(&(w->a), &(x->a));
+    FP_div2(&(w->b), &(x->b));
+}
+
+/* Input MUST be normed */
+void YYY::FP2_times_i(FP2 *w)
+{
+    FP z;
+    FP_copy(&z, &(w->a));
+    FP_neg(&(w->a), &(w->b));
+    FP_copy(&(w->b), &z);
+
+//    Output NOT normed, so use with care
+}
+
+/* Set w*=(2^i+sqrt(-1)) */
+/* where X^2-(2^i+sqrt(-1)) is irreducible for FP4 */
+
+/* Input MUST be normed */
+void YYY::FP2_mul_ip(FP2 *w)
+{
+    FP2 t;
+    int i = QNRI_YYY;
+
+    FP2_copy(&t, w);
+    FP2_times_i(w);
+
+// add 2^i.t
+    while (i > 0)
+    {
+        FP2_add(&t, &t, &t);
+        FP2_norm(&t);
+        i--;
+    }
+    FP2_add(w, &t, w);
+
+#if TOWER_YYY == POSITOWER
+    FP2_norm(w);
+    FP2_neg(w, w);  // ***
+#endif
+
+//    Output NOT normed, so use with care
+}
+
+/* Set w/=(2^i+sqrt(-1)) */
+/* Slow */
+void YYY::FP2_div_ip(FP2 *w)
+{
+    FP2 z;
+    FP2_norm(w);
+    FP2_from_ints(&z, (1 << QNRI_YYY), 1);
+    FP2_inv(&z, &z, NULL);
+    FP2_mul(w, &z, w);
+#if TOWER_YYY == POSITOWER
+    FP2_neg(w, w);  // ***
+#endif
+}
+
+/* SU= 8 */
+/* normalise a and b components of w */
+void YYY::FP2_norm(FP2 *w)
+{
+    FP_norm(&(w->a));
+    FP_norm(&(w->b));
+}
+
+/* Set w=a^b mod m */
+/* SU= 208 */
+/*
+void YYY::FP2_pow(FP2 *r, FP2* a, BIG b)
+{
+    FP2 w;
+    FP one;
+    BIG z, zilch;
+    int bt;
+
+    BIG_norm(b);
+    BIG_copy(z, b);
+    FP2_copy(&w, a);
+    FP_one(&one);
+    BIG_zero(zilch);
+    FP2_from_FP(r, &one);
+    while (1)
+    {
+        bt = BIG_parity(z);
+        BIG_shr(z, 1);
+        if (bt) FP2_mul(r, r, &w);
+        if (BIG_comp(z, zilch) == 0) break;
+        FP2_sqr(&w, &w);
+    }
+    FP2_reduce(r);
+} */
+
+/* test for x a QR */
+int YYY::FP2_qr(FP2 *x,FP *h)
+{ /* test x^(p^2-1)/2 = 1 */
+
+    FP2 c;
+    FP2_conj(&c,x);
+    FP2_mul(&c,&c,x);
+
+    return FP_qr(&(c.a),h);
+}
+
+/* sqrt(a+ib) = sqrt(a+sqrt(a*a-n*b*b))/2+ib/(2*sqrt(a+sqrt(a*a-n*b*b))/2) */
+
+void YYY::FP2_sqrt(FP2 *w, FP2 *u, FP *h)
+{
+    FP w1, w2, w3, w4, hint;
+    FP2 nw;
+    int sgn,qr;
+    FP2_copy(w, u);
+    if (FP2_iszilch(w)) return;
+
+    FP_sqr(&w1, &(w->b));  // b^2
+    FP_sqr(&w2, &(w->a));  // a^2
+    FP_add(&w1, &w1, &w2); FP_norm(&w1);  // a^2+b^2
+
+    FP_sqrt(&w1, &w1, h);              // sqrt(a^2+b^2)  - could use an input hint to avoid exp!
+
+    FP_add(&w2, &(w->a), &w1);            // a+sqrt(a^2+b^2)
+    FP_norm(&w2);
+    FP_div2(&w2, &w2);                    // w2=(a+sqrt(a^2+b^2))/2
+// **
+    FP_div2(&w1,&(w->b));                   // w1=b/2
+    qr=FP_qr(&w2,&hint);                    // only exp!
+
+// tweak hint
+    FP_neg(&w3,&hint); FP_norm(&w3);    // QNR = -1
+    FP_neg(&w4,&w2); FP_norm(&w4);
+
+    FP_cmove(&w2,&w4,1-qr);
+    FP_cmove(&hint,&w3,1-qr);
+
+    FP_sqrt(&(w->a),&w2,&hint);             // a=sqrt(w2)
+    FP_inv(&w3,&w2,&hint);                  // w3=1/w2
+    FP_mul(&w3,&w3,&(w->a));                // w3=1/sqrt(w2)
+    FP_mul(&(w->b),&w3,&w1);                // b=(b/2)*1/sqrt(w2)
+    FP_copy(&w4,&(w->a));
+
+    FP_cmove(&(w->a),&(w->b),1-qr);
+    FP_cmove(&(w->b),&w4,1-qr);
+
+
+/*
+
+    FP_sqrt(&(w->a),&w2,&hint);             // a=sqrt(w2)
+    FP_inv(&w3,&w2,&hint);                  // w3=1/w2
+    FP_mul(&w3,&w3,&(w->a));                // w3=1/sqrt(w2)
+    FP_mul(&(w->b),&w3,&w1);                // b=(b/2)*1/sqrt(w2)
+
+// tweak hint
+    FP_neg(&hint,&hint); FP_norm(&hint);    // QNR = -1
+    FP_neg(&w2,&w2); FP_norm(&w2);
+
+    FP_sqrt(&w4,&w2,&hint);                 // w4=sqrt(w2)
+    FP_inv(&w3,&w2,&hint);                  // w3=1/w2    
+    FP_mul(&w3,&w3,&w4);                    // w3=1/sqrt(w2)
+    FP_mul(&w3,&w3,&w1);                    // w3=(b/2)*1/sqrt(w2)
+
+    FP_cmove(&(w->a),&w3,1-qr);
+    FP_cmove(&(w->b),&w4,1-qr);
+*/
+// return +ve root
+    sgn=FP2_sign(w);
+    FP2_neg(&nw,w); FP2_norm(&nw);
+    FP2_cmove(w,&nw,sgn);
+}
+
+void YYY::FP2_rand(FP2 *x,csprng *rng)
+{
+    FP_rand(&(x->a),rng);
+    FP_rand(&(x->b),rng);
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp2.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp2.h
new file mode 100644
index 0000000..58c03fd
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp2.h
@@ -0,0 +1,306 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP2_YYY_H
+#define FP2_YYY_H
+
+#include "fp_YYY.h"
+
+using namespace core;
+
+namespace YYY {
+
+/**
+	@brief FP2 Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    FP a; /**< real part of FP2 */
+    FP b; /**< imaginary part of FP2 */
+} FP2;
+
+/* FP2 prototypes */
+
+/**	@brief Tests for FP2 equal to zero
+ *
+	@param x FP2 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP2_iszilch(FP2 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP2 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP2_islarger(FP2 *x);
+
+
+/**	@brief Serialize out FP2  
+ *
+    @param b buffer for output
+	@param x FP2 number to be serialized
+ */
+extern void FP2_toBytes(char *b,FP2 *x);
+
+/**	@brief Serialize in FP2  
+ *
+	@param x FP2 number to be serialized
+    @param b buffer for input
+ */
+extern void FP2_fromBytes(FP2 *x,char *b);
+
+/**	@brief Conditional copy of FP2 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP2 instance, set to y if s!=0
+	@param y another FP2 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP2_cmove(FP2 *x, FP2 *y, int s);
+/**	@brief Tests for FP2 equal to one
+ *
+	@param x FP2 instance to be tested
+	@return 1 if x=1, else returns 0
+ */
+extern int FP2_isunity(FP2 *x);
+/**	@brief Tests for equality of two FP2s
+ *
+	@param x FP2 instance to be compared
+	@param y FP2 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP2_equals(FP2 *x, FP2 *y);
+/**	@brief Initialise FP2 from two FP numbers
+ *
+	@param x FP2 instance to be initialised
+	@param a FP to form real part of FP2
+	@param b FP to form imaginary part of FP2
+ */
+extern void FP2_from_FPs(FP2 *x, FP *a, FP *b);
+/**	@brief Initialise FP2 from two BIG integers
+ *
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+	@param b BIG to form imaginary part of FP2
+ */
+extern void FP2_from_BIGs(FP2 *x, XXX::BIG a, XXX::BIG b);
+
+
+/**	@brief Initialise FP2 from two integers
+ *
+	@param x FP2 instance to be initialised
+	@param a int to form real part of FP2
+	@param b int to form imaginary part of FP2
+ */
+extern void FP2_from_ints(FP2 *x, int a, int b);
+
+
+
+/**	@brief Initialise FP2 from single FP
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param an FP to form real part of FP2
+ */
+extern void FP2_from_FP(FP2 *x, FP *a);
+/**	@brief Initialise FP2 from single BIG
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+ */
+extern void FP2_from_BIG(FP2 *x, XXX::BIG a);
+/**	@brief Copy FP2 to another FP2
+ *
+	@param x FP2 instance, on exit = y
+	@param y FP2 instance to be copied
+ */
+extern void FP2_copy(FP2 *x, FP2 *y);
+/**	@brief Set FP2 to zero
+ *
+	@param x FP2 instance to be set to zero
+ */
+extern void FP2_zero(FP2 *x);
+/**	@brief Set FP2 to unity
+ *
+	@param x FP2 instance to be set to one
+ */
+extern void FP2_one(FP2 *x);
+
+/**	@brief Copy from ROM to an FP2
+ *
+	@param w FP2 number to be copied to
+	@param a BIG real part to be copied from ROM
+	@param b BIG imag part to be copied from ROM
+ */
+extern void FP2_rcopy(FP2 *w,const XXX::BIG a,const XXX::BIG b);
+
+/**	@brief Sign of FP2
+ *
+	@param x FP2 instance
+	@return "sign" of FP2
+ */
+extern int FP2_sign(FP2 *x);
+
+/**	@brief Negation of FP2
+ *
+	@param x FP2 instance, on exit = -y
+	@param y FP2 instance
+ */
+extern void FP2_neg(FP2 *x, FP2 *y);
+
+
+/**	@brief Conjugation of FP2
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP2 instance, on exit = conj(y)
+	@param y FP2 instance
+ */
+extern void FP2_conj(FP2 *x, FP2 *y);
+/**	@brief addition of two FP2s
+ *
+	@param x FP2 instance, on exit = y+z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_add(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief subtraction of two FP2s
+ *
+	@param x FP2 instance, on exit = y-z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_sub(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Multiplication of an FP2 by an FP
+ *
+	@param x FP2 instance, on exit = y*b
+	@param y FP2 instance
+	@param b FP residue
+ */
+extern void FP2_pmul(FP2 *x, FP2 *y, FP *b);
+/**	@brief Multiplication of an FP2 by a small integer
+ *
+	@param x FP2 instance, on exit = y*i
+	@param y FP2 instance
+	@param i an integer
+ */
+extern void FP2_imul(FP2 *x, FP2 *y, int i);
+/**	@brief Squaring an FP2
+ *
+	@param x FP2 instance, on exit = y^2
+	@param y FP2 instance
+ */
+extern void FP2_sqr(FP2 *x, FP2 *y);
+/**	@brief Multiplication of two FP2s
+ *
+	@param x FP2 instance, on exit = y*z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_mul(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Formats and outputs an FP2 to the console
+ *
+	@param x FP2 instance
+ */
+extern void FP2_output(FP2 *x);
+/**	@brief Formats and outputs an FP2 to the console in raw form (for debugging)
+ *
+	@param x FP2 instance
+ */
+extern void FP2_rawoutput(FP2 *x);
+/**	@brief Inverting an FP2
+ *
+	@param x FP2 instance, on exit = 1/y
+	@param y FP2 instance
+ */
+extern void FP2_inv(FP2 *x, FP2 *y, FP *h);
+/**	@brief Divide an FP2 by 2
+ *
+	@param x FP2 instance, on exit = y/2
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_div2(FP2 *x, FP2 *y);
+/**	@brief Multiply an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x*(1+sqrt(-1))
+ */
+extern void FP2_mul_ip(FP2 *x);
+
+/**	@brief Divide an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x/(1+sqrt(-1))
+ */
+extern void FP2_div_ip(FP2 *x);
+/**	@brief Normalises the components of an FP2
+ *
+	@param x FP2 instance to be normalised
+ */
+extern void FP2_norm(FP2 *x);
+/**	@brief Reduces all components of possibly unreduced FP2 mod Modulus
+ *
+	@param x FP2 instance, on exit reduced mod Modulus
+ */
+extern void FP2_reduce(FP2 *x);
+/**	@brief Raises an FP2 to the power of a BIG
+ *
+	@param x FP2 instance, on exit = y^b
+	@param y FP2 instance
+	@param b BIG number
+ */
+extern void FP2_pow(FP2 *x, FP2 *y, XXX::BIG b);
+
+/**	@brief Test FP2 for QR
+ *
+	@param x FP2 instance
+    @param h optional generated hint
+	@return true or false
+ */
+extern int FP2_qr(FP2 *x,FP *h);
+
+
+/**	@brief Square root of an FP2
+ *
+	@param x FP2 instance, on exit = sqrt(y)
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_sqrt(FP2 *x, FP2 *y, FP *h);
+
+/**	@brief Multiply an FP2 by sqrt(-1)
+ *
+	Note that -1 is QNR
+	@param x FP2 instance, on exit = x*sqrt(-1)
+ */
+extern void FP2_times_i(FP2 *x);
+
+/**	@brief Generate random FP2
+ *
+	@param x random FP2 number
+	@param rng random number generator
+ */
+extern void FP2_rand(FP2 *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp24.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp24.cpp
new file mode 100644
index 0000000..5c821dc
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp24.cpp
@@ -0,0 +1,1018 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* CORE Fp^24 functions */
+/* SU=m, m is Stack Usage (no lazy )*/
+/* FP24 elements are of the form a+i.b+i^2.c */
+
+#include "fp24_YYY.h"
+#include "config_curve_ZZZ.h"
+
+using namespace XXX;
+
+/* return 1 if b==c, no branching */
+static int teq(sign32 b, sign32 c)
+{
+    sign32 x = b ^ c;
+    x -= 1; // if x=0, x now -1
+    return (int)((x >> 31) & 1);
+}
+
+
+/* Constant time select from pre-computed table */
+static void FP24_select(YYY::FP24 *f, YYY::FP24 g[], sign32 b)
+{
+    YYY::FP24 invf;
+    sign32 m = b >> 31;
+    sign32 babs = (b ^ m) - m;
+
+    babs = (babs - 1) / 2;
+
+    FP24_cmove(f, &g[0], teq(babs, 0)); // conditional move
+    FP24_cmove(f, &g[1], teq(babs, 1));
+    FP24_cmove(f, &g[2], teq(babs, 2));
+    FP24_cmove(f, &g[3], teq(babs, 3));
+    FP24_cmove(f, &g[4], teq(babs, 4));
+    FP24_cmove(f, &g[5], teq(babs, 5));
+    FP24_cmove(f, &g[6], teq(babs, 6));
+    FP24_cmove(f, &g[7], teq(babs, 7));
+
+    FP24_copy(&invf, f);
+    FP24_conj(&invf, &invf); // 1/f
+    FP24_cmove(f, &invf, (int)(m & 1));
+}
+
+/* test x==0 ? */
+/* SU= 8 */
+int YYY::FP24_iszilch(FP24 *x)
+{
+    if (FP8_iszilch(&(x->a)) && FP8_iszilch(&(x->b)) && FP8_iszilch(&(x->c))) return 1;
+    return 0;
+}
+
+/* test x==1 ? */
+/* SU= 8 */
+int YYY::FP24_isunity(FP24 *x)
+{
+    if (FP8_isunity(&(x->a)) && FP8_iszilch(&(x->b)) && FP8_iszilch(&(x->c))) return 1;
+    return 0;
+}
+
+/* FP24 copy w=x */
+/* SU= 16 */
+void YYY::FP24_copy(FP24 *w, FP24 *x)
+{
+    if (x == w) return;
+    FP8_copy(&(w->a), &(x->a));
+    FP8_copy(&(w->b), &(x->b));
+    FP8_copy(&(w->c), &(x->c));
+    w->type = x->type;
+}
+
+/* FP24 w=1 */
+/* SU= 8 */
+void YYY::FP24_one(FP24 *w)
+{
+    FP8_one(&(w->a));
+    FP8_zero(&(w->b));
+    FP8_zero(&(w->c));
+    w->type = FP_UNITY;
+
+}
+
+void YYY::FP24_zero(FP24 *w)
+{
+    FP8_zero(&(w->a));
+    FP8_zero(&(w->b));
+    FP8_zero(&(w->c));
+    w->type = FP_ZILCH;
+
+}
+
+/* return 1 if x==y, else 0 */
+/* SU= 16 */
+int YYY::FP24_equals(FP24 *x, FP24 *y)
+{
+    if (FP8_equals(&(x->a), &(y->a)) && FP8_equals(&(x->b), &(y->b)) && FP8_equals(&(x->c), &(y->c)))
+        return 1;
+    return 0;
+}
+
+/* Set w=conj(x) */
+/* SU= 8 */
+void YYY::FP24_conj(FP24 *w, FP24 *x)
+{
+    FP24_copy(w, x);
+    FP8_conj(&(w->a), &(w->a));
+    FP8_nconj(&(w->b), &(w->b));
+    FP8_conj(&(w->c), &(w->c));
+}
+
+/* Create FP24 from FP8 */
+/* SU= 8 */
+void YYY::FP24_from_FP8(FP24 *w, FP8 *a)
+{
+    FP8_copy(&(w->a), a);
+    FP8_zero(&(w->b));
+    FP8_zero(&(w->c));
+    w->type = FP_SPARSEST;
+}
+
+/* Create FP24 from 3 FP8's */
+/* SU= 16 */
+void YYY::FP24_from_FP8s(FP24 *w, FP8 *a, FP8 *b, FP8 *c)
+{
+    FP8_copy(&(w->a), a);
+    FP8_copy(&(w->b), b);
+    FP8_copy(&(w->c), c);
+    w->type = FP_DENSE;
+}
+
+/* Granger-Scott Unitary Squaring. This does not benefit from lazy reduction */
+/* SU= 600 */
+void YYY::FP24_usqr(FP24 *w, FP24 *x)
+{
+    FP8 A, B, C, D;
+
+    FP8_copy(&A, &(x->a));
+
+    FP8_sqr(&(w->a), &(x->a));
+    FP8_add(&D, &(w->a), &(w->a));
+    FP8_add(&(w->a), &D, &(w->a));
+
+    FP8_norm(&(w->a));
+    FP8_nconj(&A, &A);
+
+    FP8_add(&A, &A, &A);
+    FP8_add(&(w->a), &(w->a), &A);
+    FP8_sqr(&B, &(x->c));
+    FP8_times_i(&B);
+
+    FP8_add(&D, &B, &B);
+    FP8_add(&B, &B, &D);
+    FP8_norm(&B);
+
+    FP8_sqr(&C, &(x->b));
+
+    FP8_add(&D, &C, &C);
+    FP8_add(&C, &C, &D);
+
+    FP8_norm(&C);
+    FP8_conj(&(w->b), &(x->b));
+    FP8_add(&(w->b), &(w->b), &(w->b));
+    FP8_nconj(&(w->c), &(x->c));
+
+    FP8_add(&(w->c), &(w->c), &(w->c));
+    FP8_add(&(w->b), &B, &(w->b));
+    FP8_add(&(w->c), &C, &(w->c));
+    w->type = FP_DENSE;
+
+    FP24_reduce(w);     /* reduce here as in pow function repeated squarings would trigger multiple reductions */
+}
+
+/* FP24 squaring w=x^2 */
+/* SU= 600 */
+void YYY::FP24_sqr(FP24 *w, FP24 *x)
+{
+    /* Use Chung-Hasan SQR2 method from http://cacr.uwaterloo.ca/techreports/2006/cacr2006-24.pdf */
+
+    FP8 A, B, C, D;
+
+    if (x->type <= FP_UNITY)
+    {
+        FP24_copy(w, x);
+        return;
+    }
+
+    FP8_sqr(&A, &(x->a));
+    FP8_mul(&B, &(x->b), &(x->c));
+    FP8_add(&B, &B, &B);
+    FP8_norm(&B);
+    FP8_sqr(&C, &(x->c));
+
+    FP8_mul(&D, &(x->a), &(x->b));
+    FP8_add(&D, &D, &D);
+
+    FP8_add(&(w->c), &(x->a), &(x->c));
+    FP8_add(&(w->c), &(x->b), &(w->c));
+    FP8_norm(&(w->c));
+
+    FP8_sqr(&(w->c), &(w->c));
+
+    FP8_copy(&(w->a), &A);
+    FP8_add(&A, &A, &B);
+
+    FP8_norm(&A);
+
+    FP8_add(&A, &A, &C);
+    FP8_add(&A, &A, &D);
+
+    FP8_norm(&A);
+
+    FP8_neg(&A, &A);
+    FP8_times_i(&B);
+    FP8_times_i(&C);
+
+    FP8_add(&(w->a), &(w->a), &B);
+    FP8_add(&(w->b), &C, &D);
+    FP8_add(&(w->c), &(w->c), &A);
+
+    if (x->type == FP_SPARSER || x->type == FP_SPARSEST)
+        w->type = FP_SPARSE;
+    else
+        w->type = FP_DENSE;
+
+    FP24_norm(w);
+}
+
+// Use FP24_mul when both multiplicands are dense
+// Use FP24smul when it is known that both multiplicands are line functions
+// Use FP24ssmul when it is suspected that one or both multiplicands could have some sparsity
+
+
+/* FP24 full multiplication w=w*y */
+void YYY::FP24_mul(FP24 *w, FP24 *y)
+{
+    FP8 z0, z1, z2, z3, t0, t1;
+
+    FP8_mul(&z0, &(w->a), &(y->a));
+    FP8_mul(&z2, &(w->b), &(y->b)); //
+
+    FP8_add(&t0, &(w->a), &(w->b));
+    FP8_add(&t1, &(y->a), &(y->b)); //
+
+    FP8_norm(&t0);
+    FP8_norm(&t1);
+
+    FP8_mul(&z1, &t0, &t1);
+    FP8_add(&t0, &(w->b), &(w->c));
+    FP8_add(&t1, &(y->b), &(y->c)); //
+
+    FP8_norm(&t0);
+    FP8_norm(&t1);
+
+    FP8_mul(&z3, &t0, &t1);
+
+    FP8_neg(&t0, &z0);
+    FP8_neg(&t1, &z2);
+
+    FP8_add(&z1, &z1, &t0); // z1=z1-z0
+    FP8_add(&(w->b), &z1, &t1); // z1=z1-z2
+    FP8_add(&z3, &z3, &t1);      // z3=z3-z2
+    FP8_add(&z2, &z2, &t0);      // z2=z2-z0
+
+    FP8_add(&t0, &(w->a), &(w->c));
+    FP8_add(&t1, &(y->a), &(y->c));
+
+    FP8_norm(&t0);
+    FP8_norm(&t1);
+
+    FP8_mul(&t0, &t1, &t0);
+    FP8_add(&z2, &z2, &t0);
+
+    FP8_mul(&t0, &(w->c), &(y->c));
+    FP8_neg(&t1, &t0);
+
+    FP8_add(&(w->c), &z2, &t1);
+    FP8_add(&z3, &z3, &t1);
+    FP8_times_i(&t0);
+    FP8_add(&(w->b), &(w->b), &t0);
+    FP8_norm(&z3);
+    FP8_times_i(&z3);
+    FP8_add(&(w->a), &z0, &z3);
+
+    FP24_norm(w);
+    w->type = FP_DENSE;
+}
+
+/* FP24 full multiplication w=w*y */
+/* Supports sparse multiplicands */
+/* Usually w is denser than y */
+void YYY::FP24_ssmul(FP24 *w, FP24 *y)
+{
+    FP8 z0, z1, z2, z3, t0, t1;
+    if (w->type == FP_UNITY)
+    {
+        FP24_copy(w, y);
+        return;
+    }
+    if (y->type == FP_UNITY)
+        return;
+
+    if (y->type >= FP_SPARSE)
+    {
+        FP8_mul(&z0, &(w->a), &(y->a)); // xa.ya   always 11x11
+
+#if SEXTIC_TWIST_ZZZ == M_TYPE
+        if (y->type == FP_SPARSE || w->type == FP_SPARSE)
+        {
+            FP4_mul(&z2.b, &(w->b).b, &(y->b).b);
+            FP4_zero(&z2.a);
+            if (y->type != FP_SPARSE)
+                FP4_mul(&z2.a, &(w->b).b, &(y->b).a);
+            if (w->type != FP_SPARSE)
+                FP4_mul(&z2.a, &(w->b).a, &(y->b).b);
+            FP8_times_i(&z2);
+        }
+        else
+#endif
+            FP8_mul(&z2, &(w->b), &(y->b)); // xb.yb  could be 00x00 or 01x01 or or 10x10 or 11x00 or 11x10 or 11x01 or 11x11
+
+        FP8_add(&t0, &(w->a), &(w->b)); // (xa+xb)
+        FP8_add(&t1, &(y->a), &(y->b)); // (ya+yb)
+
+        FP8_norm(&t0);
+        FP8_norm(&t1);
+
+        FP8_mul(&z1, &t0, &t1); // (xa+xb)(ya+yb)  always 11x11
+        FP8_add(&t0, &(w->b), &(w->c)); // (xb+xc)
+        FP8_add(&t1, &(y->b), &(y->c)); // (yb+yc)
+
+        FP8_norm(&t0);
+        FP8_norm(&t1);
+
+        FP8_mul(&z3, &t0, &t1); // (xb+xc)(yb+yc)   could be anything...
+        FP8_neg(&t0, &z0);      // -(xa.ya)
+        FP8_neg(&t1, &z2);      // -(xb.yb)
+
+        FP8_add(&z1, &z1, &t0);
+        FP8_add(&(w->b), &z1, &t1); // /wb = (xa+xb)(ya+yb) -(xa.ya) -(xb.yb)                     = xa.yb + xb.ya
+
+        FP8_add(&z3, &z3, &t1);      // (xb+xc)(yb+yc) -(xb.yb)
+        FP8_add(&z2, &z2, &t0);      // (xb.yb) - (xa.ya)
+
+        FP8_add(&t0, &(w->a), &(w->c)); // (xa+xc)
+        FP8_add(&t1, &(y->a), &(y->c)); // (ya+yc)
+
+        FP8_norm(&t0);
+        FP8_norm(&t1);
+
+        FP8_mul(&t0, &t1, &t0); // (xa+xc)(ya+yc)    always 11x11
+        FP8_add(&z2, &z2, &t0); // (xb.yb) - (xa.ya) + (xa+xc)(ya+yc)
+
+#if SEXTIC_TWIST_ZZZ == D_TYPE
+        if (y->type == FP_SPARSE || w->type == FP_SPARSE)
+        {
+            FP4_mul(&t0.a, &(w->c).a, &(y->c).a);
+            FP4_zero(&t0.b);
+            if (y->type != FP_SPARSE)
+                FP4_mul(&t0.b, &(w->c).a, &(y->c).b);
+            if (w->type != FP_SPARSE)
+                FP4_mul(&t0.b, &(w->c).b, &(y->c).a);
+        }
+        else
+#endif
+            FP8_mul(&t0, &(w->c), &(y->c)); // (xc.yc)  could be anything
+
+        FP8_neg(&t1, &t0);            // -(xc.yc)
+
+        FP8_add(&(w->c), &z2, &t1);     // wc = (xb.yb) - (xa.ya) + (xa+xc)(ya+yc) - (xc.yc)    =  xb.yb + xc.ya + xa.yc
+        FP8_add(&z3, &z3, &t1);         // (xb+xc)(yb+yc) -(xb.yb) - (xc.yc)                    =  xb.yc + xc.yb
+        FP8_times_i(&t0);               // i.(xc.yc)
+        FP8_add(&(w->b), &(w->b), &t0); // wb = (xa+xb)(ya+yb) -(xa.ya) -(xb.yb) +i(xc.yc)
+        FP8_norm(&z3);
+        FP8_times_i(&z3);               // i[(xb+xc)(yb+yc) -(xb.yb) - (xc.yc)]                 = i(xb.yc + xc.yb)
+        FP8_add(&(w->a), &z0, &z3);     // wa = xa.ya + i(xb.yc + xc.yb)
+    } else {
+        if (w->type == FP_SPARSER || w->type == FP_SPARSEST)
+        {
+            FP24_smul(w, y);
+            return;
+        }
+// dense by sparser - 13m
+#if SEXTIC_TWIST_ZZZ == D_TYPE
+        FP8_copy(&z3, &(w->b));
+        FP8_mul(&z0, &(w->a), &(y->a));
+
+        if (y->type == FP_SPARSEST)
+            FP8_tmul(&z2, &(w->b), &(y->b).a.a.a);
+        else
+            FP8_pmul(&z2, &(w->b), &(y->b).a);
+
+
+        FP8_add(&(w->b), &(w->a), &(w->b));
+        FP8_copy(&t1, &(y->a));
+        FP4_add(&t1.a, &t1.a, &(y->b).a);
+
+        FP8_norm(&t1);
+        FP8_norm(&(w->b));
+
+        FP8_mul(&(w->b), &(w->b), &t1);
+        FP8_add(&z3, &z3, &(w->c));
+        FP8_norm(&z3);
+
+        if (y->type == FP_SPARSEST)
+            FP8_tmul(&z3, &z3, &(y->b).a.a.a);
+        else
+            FP8_pmul(&z3, &z3, &(y->b).a);
+
+        FP8_neg(&t0, &z0);
+        FP8_neg(&t1, &z2);
+
+        FP8_add(&(w->b), &(w->b), &t0); // z1=z1-z0
+        FP8_add(&(w->b), &(w->b), &t1); // z1=z1-z2
+
+        FP8_add(&z3, &z3, &t1);      // z3=z3-z2
+        FP8_add(&z2, &z2, &t0);      // z2=z2-z0
+
+        FP8_add(&t0, &(w->a), &(w->c));
+        FP8_norm(&t0);
+        FP8_norm(&z3);
+
+        FP8_mul(&t0, &(y->a), &t0);
+        FP8_add(&(w->c), &z2, &t0);
+
+        FP8_times_i(&z3);
+        FP8_add(&(w->a), &z0, &z3);
+#endif
+#if SEXTIC_TWIST_ZZZ == M_TYPE
+        FP8_mul(&z0, &(w->a), &(y->a));
+        FP8_add(&t0, &(w->a), &(w->b));
+        FP8_norm(&t0);
+
+        FP8_mul(&z1, &t0, &(y->a));
+        FP8_add(&t0, &(w->b), &(w->c));
+        FP8_norm(&t0);
+
+
+        if (y->type == FP_SPARSEST)
+            FP8_tmul(&z3, &t0, &(y->c).b.a.a);
+        else
+            FP8_pmul(&z3, &t0, &(y->c).b);
+
+
+        FP8_times_i(&z3);
+
+        FP8_neg(&t0, &z0);
+        FP8_add(&z1, &z1, &t0); // z1=z1-z0
+
+        FP8_copy(&(w->b), &z1);
+        FP8_copy(&z2, &t0);
+
+        FP8_add(&t0, &(w->a), &(w->c));
+        FP8_add(&t1, &(y->a), &(y->c));
+
+        FP8_norm(&t0);
+        FP8_norm(&t1);
+
+        FP8_mul(&t0, &t1, &t0);
+        FP8_add(&z2, &z2, &t0);
+
+        if (y->type == FP_SPARSEST)
+            FP8_tmul(&t0, &(w->c), &(y->c).b.a.a);
+        else
+            FP8_pmul(&t0, &(w->c), &(y->c).b);
+
+
+        FP8_times_i(&t0);
+        FP8_neg(&t1, &t0);
+        FP8_times_i(&t0);
+
+        FP8_add(&(w->c), &z2, &t1);
+        FP8_add(&z3, &z3, &t1);
+
+        FP8_add(&(w->b), &(w->b), &t0);
+        FP8_norm(&z3);
+        FP8_times_i(&z3);
+        FP8_add(&(w->a), &z0, &z3);
+#endif
+    }
+    w->type = FP_DENSE;
+    FP24_norm(w);
+}
+
+/* FP24 multiplication w=w*y */
+/* catering for special case that arises from special form of ATE pairing line function */
+/* w and y are both sparser line functions - cost = 6m */
+void YYY::FP24_smul(FP24 *w, FP24 *y)
+{
+    FP4 w1, w2, w3, ta, tb, tc, td, te, t;
+
+
+#if SEXTIC_TWIST_ZZZ == D_TYPE
+    FP4_mul(&w1, &(w->a).a, &(y->a).a); // A1.A2
+    FP4_mul(&w2, &(w->a).b, &(y->a).b); // B1.B2
+
+    if (y->type == FP_SPARSEST || w->type == FP_SPARSEST)
+    {
+        if (y->type == FP_SPARSEST && w->type == FP_SPARSEST)
+        {
+            FP4_zero(&w3);
+            FP_mul(&w3.a.a, &(w->b).a.a.a, &(y->b).a.a.a);
+        } else {
+            if (y->type != FP_SPARSEST)
+                FP4_qmul(&w3, &(y->b).a, &(w->b).a.a.a);
+            if (w->type != FP_SPARSEST)
+                FP4_qmul(&w3, &(w->b).a, &(y->b).a.a.a);
+        }
+    }
+    else
+        FP4_mul(&w3, &(w->b).a, &(y->b).a); // C1.C2
+
+    FP4_add(&ta, &(w->a).a, &(w->a).b); // A1+B1
+    FP4_add(&tb, &(y->a).a, &(y->a).b); // A2+B2
+    FP4_norm(&ta);
+    FP4_norm(&tb);
+    FP4_mul(&tc, &ta, &tb);         // (A1+B1)(A2+B2)
+    FP4_add(&t, &w1, &w2);
+    FP4_neg(&t, &t);
+    FP4_add(&tc, &tc, &t);          // (A1+B1)(A2+B2)-A1.A2-B1*B2 =  (A1.B2+A2.B1)
+
+    FP4_add(&ta, &(w->a).a, &(w->b).a); // A1+C1
+    FP4_add(&tb, &(y->a).a, &(y->b).a); // A2+C2
+    FP4_norm(&ta);
+    FP4_norm(&tb);
+    FP4_mul(&td, &ta, &tb);         // (A1+C1)(A2+C2)
+    FP4_add(&t, &w1, &w3);
+    FP4_neg(&t, &t);
+    FP4_add(&td, &td, &t);          // (A1+C1)(A2+C2)-A1.A2-C1*C2 =  (A1.C2+A2.C1)
+
+    FP4_add(&ta, &(w->a).b, &(w->b).a); // B1+C1
+    FP4_add(&tb, &(y->a).b, &(y->b).a); // B2+C2
+    FP4_norm(&ta);
+    FP4_norm(&tb);
+    FP4_mul(&te, &ta, &tb);         // (B1+C1)(B2+C2)
+    FP4_add(&t, &w2, &w3);
+    FP4_neg(&t, &t);
+    FP4_add(&te, &te, &t);          // (B1+C1)(B2+C2)-B1.B2-C1*C2 =  (B1.C2+B2.C1)
+
+    FP4_times_i(&w2);
+    FP4_add(&w1, &w1, &w2);
+    FP8_from_FP4s(&(w->a), &w1, &tc);
+    FP8_from_FP4s(&(w->b), &td, &te); // only norm these 2
+    FP8_from_FP4(&(w->c), &w3);
+
+    FP8_norm(&(w->a));
+    FP8_norm(&(w->b));
+#endif
+#if SEXTIC_TWIST_ZZZ == M_TYPE
+    FP4_mul(&w1, &(w->a).a, &(y->a).a); // A1.A2
+    FP4_mul(&w2, &(w->a).b, &(y->a).b); // B1.B2
+
+    if (y->type == FP_SPARSEST || w->type == FP_SPARSEST)
+    {
+        if (y->type == FP_SPARSEST && w->type == FP_SPARSEST)
+        {
+            FP4_zero(&w3);
+            FP_mul(&w3.a.a, &(w->c).b.a.a, &(y->c).b.a.a);
+        } else {
+            if (y->type != FP_SPARSEST)
+                FP4_qmul(&w3, &(y->c).b, &(w->c).b.a.a);
+            if (w->type != FP_SPARSEST)
+                FP4_qmul(&w3, &(w->c).b, &(y->c).b.a.a);
+        }
+    }
+    else
+        FP4_mul(&w3, &(w->c).b, &(y->c).b); // F1.F2
+
+    FP4_add(&ta, &(w->a).a, &(w->a).b); // A1+B1
+    FP4_add(&tb, &(y->a).a, &(y->a).b); // A2+B2
+    FP4_norm(&ta);
+    FP4_norm(&tb);
+    FP4_mul(&tc, &ta, &tb);         // (A1+B1)(A2+B2)
+    FP4_add(&t, &w1, &w2);
+    FP4_neg(&t, &t);
+    FP4_add(&tc, &tc, &t);          // (A1+B1)(A2+B2)-A1.A2-B1*B2 =  (A1.B2+A2.B1)
+
+    FP4_add(&ta, &(w->a).a, &(w->c).b); // A1+F1
+    FP4_add(&tb, &(y->a).a, &(y->c).b); // A2+F2
+    FP4_norm(&ta);
+    FP4_norm(&tb);
+    FP4_mul(&td, &ta, &tb);         // (A1+F1)(A2+F2)
+    FP4_add(&t, &w1, &w3);
+    FP4_neg(&t, &t);
+    FP4_add(&td, &td, &t);          // (A1+F1)(A2+F2)-A1.A2-F1*F2 =  (A1.F2+A2.F1)
+
+    FP4_add(&ta, &(w->a).b, &(w->c).b); // B1+F1
+    FP4_add(&tb, &(y->a).b, &(y->c).b); // B2+F2
+    FP4_norm(&ta);
+    FP4_norm(&tb);
+    FP4_mul(&te, &ta, &tb);         // (B1+F1)(B2+F2)
+    FP4_add(&t, &w2, &w3);
+    FP4_neg(&t, &t);
+    FP4_add(&te, &te, &t);          // (B1+F1)(B2+F2)-B1.B2-F1*F2 =  (B1.F2+B2.F1)
+
+    FP4_times_i(&w2);
+    FP4_add(&w1, &w1, &w2);
+    FP8_from_FP4s(&(w->a), &w1, &tc);
+
+    FP4_times_i(&w3);
+    FP4_norm(&w3);
+    FP8_from_FP4H(&(w->b), &w3);
+
+    FP4_norm(&te);
+    FP4_times_i(&te);
+    FP8_from_FP4s(&(w->c), &te, &td);
+
+    FP8_norm(&(w->a));
+    FP8_norm(&(w->c));
+#endif
+
+    w->type = FP_SPARSE;
+}
+
+/* Set w=1/x */
+/* SU= 600 */
+void YYY::FP24_inv(FP24 *w, FP24 *x)
+{
+    FP8 f0, f1, f2, f3;
+
+    FP8_sqr(&f0, &(x->a));
+    FP8_mul(&f1, &(x->b), &(x->c));
+    FP8_times_i(&f1);
+    FP8_sub(&f0, &f0, &f1); /* y.a */
+    FP8_norm(&f0);
+
+    FP8_sqr(&f1, &(x->c));
+    FP8_times_i(&f1);
+    FP8_mul(&f2, &(x->a), &(x->b));
+    FP8_sub(&f1, &f1, &f2); /* y.b */
+    FP8_norm(&f1);
+
+    FP8_sqr(&f2, &(x->b));
+    FP8_mul(&f3, &(x->a), &(x->c));
+    FP8_sub(&f2, &f2, &f3); /* y.c */
+    FP8_norm(&f2);
+
+    FP8_mul(&f3, &(x->b), &f2);
+    FP8_times_i(&f3);
+    FP8_mul(&(w->a), &f0, &(x->a));
+    FP8_add(&f3, &(w->a), &f3);
+    FP8_mul(&(w->c), &f1, &(x->c));
+    FP8_times_i(&(w->c));
+
+    FP8_add(&f3, &(w->c), &f3);
+    FP8_norm(&f3);
+
+    FP8_inv(&f3, &f3, NULL);
+    FP8_mul(&(w->a), &f0, &f3);
+    FP8_mul(&(w->b), &f1, &f3);
+    FP8_mul(&(w->c), &f2, &f3);
+    w->type = FP_DENSE;
+}
+
+/* constant time powering by small integer of max length bts */
+
+void YYY::FP24_pinpow(FP24 *r, int e, int bts)
+{
+    int i, b;
+    FP24 R[2];
+
+    FP24_one(&R[0]);
+    FP24_copy(&R[1], r);
+
+    for (i = bts - 1; i >= 0; i--)
+    {
+        b = (e >> i) & 1;
+        FP24_mul(&R[1 - b], &R[b]);
+        FP24_usqr(&R[b], &R[b]);
+    }
+    FP24_copy(r, &R[0]);
+}
+
+/* Compressed powering of unitary elements y=x^(e mod r) */
+
+/*
+void YYY::FP24_compow(FP8 *c, FP24 *x, BIG e, BIG r)
+{
+    FP24 g1, g2;
+    FP8 cp, cpm1, cpm2;
+    FP2 f;
+    BIG q, a, b, m;
+
+    BIG_rcopy(a, Fra);
+    BIG_rcopy(b, Frb);
+    FP2_from_BIGs(&f, a, b);
+
+    BIG_rcopy(q, Modulus);
+
+    FP24_copy(&g1, x);
+    FP24_copy(&g2, x);
+
+    BIG_copy(m, q);
+    BIG_mod(m, r);
+
+    BIG_copy(a, e);
+    BIG_mod(a, m);
+
+    BIG_copy(b, e);
+    BIG_sdiv(b, m);
+
+    FP24_trace(c, &g1);
+
+    if (BIG_iszilch(b))
+    {
+        FP8_xtr_pow(c, c, e);
+        return;
+    }
+
+    FP24_frob(&g2, &f, 1);
+    FP24_trace(&cp, &g2);
+    FP24_conj(&g1, &g1);
+    FP24_mul(&g2, &g1);
+    FP24_trace(&cpm1, &g2);
+    FP24_mul(&g2, &g1);
+
+    FP24_trace(&cpm2, &g2);
+
+    FP8_xtr_pow2(c, &cp, c, &cpm1, &cpm2, a, b);
+
+}
+*/
+/* Note this is simple square and multiply, so not side-channel safe */
+
+void YYY::FP24_pow(FP24 *r, FP24 *a, BIG b)
+{
+    FP24 w, sf;
+    BIG b1, b3;
+    int i, nb, bt;
+    BIG_copy(b1, b);
+    BIG_norm(b1);
+    BIG_pmul(b3, b1, 3);
+    BIG_norm(b3);
+
+    FP24_copy(&sf, a);
+    FP24_norm(&sf);
+    FP24_copy(&w, &sf);
+
+    if (BIG_iszilch(b3))
+    {
+        FP24_one(r);
+        return;
+    }
+
+    nb = BIG_nbits(b3);
+    for (i = nb - 2; i >= 1; i--)
+    {
+        FP24_usqr(&w, &w);
+        bt = BIG_bit(b3, i) - BIG_bit(b1, i);
+        if (bt == 1)
+            FP24_mul(&w, &sf);
+        if (bt == -1)
+        {
+            FP24_conj(&sf, &sf);
+            FP24_mul(&w, &sf);
+            FP24_conj(&sf, &sf);
+        }
+    }
+
+    FP24_copy(r, &w);
+    FP24_reduce(r);
+}
+
+/* p=q0^u0.q1^u1.q2^u2.q3^u3... */
+/* Side channel attack secure */
+// Bos & Costello https://eprint.iacr.org/2013/458.pdf
+// Faz-Hernandez & Longa & Sanchez  https://eprint.iacr.org/2013/158.pdf
+
+void YYY::FP24_pow8(FP24 *p, FP24 *q, BIG u[8])
+{
+    int i, j, k, nb, pb1, pb2, bt;
+    FP24 g1[8], g2[8], r;
+    BIG t[8], mt;
+    sign8 w1[NLEN_XXX * BASEBITS_XXX + 1];
+    sign8 s1[NLEN_XXX * BASEBITS_XXX + 1];
+    sign8 w2[NLEN_XXX * BASEBITS_XXX + 1];
+    sign8 s2[NLEN_XXX * BASEBITS_XXX + 1];
+//    FP fx,fy;
+//  FP2 X;
+    /*
+        FP_rcopy(&fx,Fra);
+        FP_rcopy(&fy,Frb);
+        FP2_from_FPs(&X,&fx,&fy);
+    */
+    for (i = 0; i < 8; i++)
+        BIG_copy(t[i], u[i]);
+
+// Precomputed table
+    FP24_copy(&g1[0], &q[0]); // q[0]
+    FP24_copy(&g1[1], &g1[0]);
+    FP24_mul(&g1[1], &q[1]); // q[0].q[1]
+    FP24_copy(&g1[2], &g1[0]);
+    FP24_mul(&g1[2], &q[2]); // q[0].q[2]
+    FP24_copy(&g1[3], &g1[1]);
+    FP24_mul(&g1[3], &q[2]); // q[0].q[1].q[2]
+    FP24_copy(&g1[4], &g1[0]);
+    FP24_mul(&g1[4], &q[3]); // q[0].q[3]
+    FP24_copy(&g1[5], &g1[1]);
+    FP24_mul(&g1[5], &q[3]); // q[0].q[1].q[3]
+    FP24_copy(&g1[6], &g1[2]);
+    FP24_mul(&g1[6], &q[3]); // q[0].q[2].q[3]
+    FP24_copy(&g1[7], &g1[3]);
+    FP24_mul(&g1[7], &q[3]); // q[0].q[1].q[2].q[3]
+
+    FP24_copy(&g2[0], &q[4]); // q[0]
+    FP24_copy(&g2[1], &g2[0]);
+    FP24_mul(&g2[1], &q[5]); // q[0].q[1]
+    FP24_copy(&g2[2], &g2[0]);
+    FP24_mul(&g2[2], &q[6]); // q[0].q[2]
+    FP24_copy(&g2[3], &g2[1]);
+    FP24_mul(&g2[3], &q[6]); // q[0].q[1].q[2]
+    FP24_copy(&g2[4], &g2[0]);
+    FP24_mul(&g2[4], &q[7]); // q[0].q[3]
+    FP24_copy(&g2[5], &g2[1]);
+    FP24_mul(&g2[5], &q[7]); // q[0].q[1].q[3]
+    FP24_copy(&g2[6], &g2[2]);
+    FP24_mul(&g2[6], &q[7]); // q[0].q[2].q[3]
+    FP24_copy(&g2[7], &g2[3]);
+    FP24_mul(&g2[7], &q[7]); // q[0].q[1].q[2].q[3]
+
+// Use Frobenius
+    /*
+        for (i=0;i<8;i++)
+        {
+            FP24_copy(&g2[i],&g1[i]);
+            FP24_frob(&g2[i],&X,4);
+        }
+    */
+// Make it odd
+    pb1 = 1 - BIG_parity(t[0]);
+    BIG_inc(t[0], pb1);
+    BIG_norm(t[0]);
+
+    pb2 = 1 - BIG_parity(t[4]);
+    BIG_inc(t[4], pb2);
+    BIG_norm(t[4]);
+
+// Number of bits
+    BIG_zero(mt);
+    for (i = 0; i < 8; i++)
+    {
+        BIG_or(mt, mt, t[i]);
+    }
+    nb = 1 + BIG_nbits(mt);
+
+// Sign pivot
+    s1[nb - 1] = 1;
+    s2[nb - 1] = 1;
+    for (i = 0; i < nb - 1; i++)
+    {
+        BIG_fshr(t[0], 1);
+        s1[i] = 2 * BIG_parity(t[0]) - 1;
+        BIG_fshr(t[4], 1);
+        s2[i] = 2 * BIG_parity(t[4]) - 1;
+    }
+
+// Recoded exponents
+    for (i = 0; i < nb; i++)
+    {
+        w1[i] = 0;
+        k = 1;
+        for (j = 1; j < 4; j++)
+        {
+            bt = s1[i] * BIG_parity(t[j]);
+            BIG_fshr(t[j], 1);
+
+            BIG_dec(t[j], (bt >> 1));
+            BIG_norm(t[j]);
+            w1[i] += bt * k;
+            k *= 2;
+        }
+
+        w2[i] = 0;
+        k = 1;
+        for (j = 5; j < 8; j++)
+        {
+            bt = s2[i] * BIG_parity(t[j]);
+            BIG_fshr(t[j], 1);
+
+            BIG_dec(t[j], (bt >> 1));
+            BIG_norm(t[j]);
+            w2[i] += bt * k;
+            k *= 2;
+        }
+    }
+
+// Main loop
+    FP24_select(p, g1, 2 * w1[nb - 1] + 1);
+    FP24_select(&r, g2, 2 * w2[nb - 1] + 1);
+    FP24_mul(p, &r);
+    for (i = nb - 2; i >= 0; i--)
+    {
+        FP24_usqr(p, p);
+        FP24_select(&r, g1, 2 * w1[i] + s1[i]);
+        FP24_mul(p, &r);
+        FP24_select(&r, g2, 2 * w2[i] + s2[i]);
+        FP24_mul(p, &r);
+    }
+
+// apply correction
+    FP24_conj(&r, &q[0]);
+    FP24_mul(&r, p);
+    FP24_cmove(p, &r, pb1);
+    FP24_conj(&r, &q[4]);
+    FP24_mul(&r, p);
+    FP24_cmove(p, &r, pb2);
+
+    FP24_reduce(p);
+}
+
+/* Set w=w^p using Frobenius */
+/* SU= 160 */
+void YYY::FP24_frob(FP24 *w, FP2 *f, int n)
+{
+    int i;
+    FP4 X2, X4;
+    FP2 f3, f2;             // f=(1+i)^(p-7)/12
+    FP2_sqr(&f2, f);    //
+    FP2_mul(&f3, &f2, f); // f3=f^3=(1+i)^(p-7)/4
+
+    FP2_mul_ip(&f3);    // f3 = (1+i).f3 = (1+i)^(p-3)/4
+    FP2_norm(&f3);
+
+    for (i = 0; i < n; i++)
+    {
+        FP8_frob(&(w->a), &f3);  // a=a^p
+        FP8_frob(&(w->b), &f3);  // b=b^p
+        FP8_frob(&(w->c), &f3);  // c=c^p
+
+        FP8_qmul(&(w->b), &(w->b), f); FP8_times_i2(&(w->b));
+        FP8_qmul(&(w->c), &(w->c), &f2); FP8_times_i2(&(w->c)); FP8_times_i2(&(w->c));
+    }
+    w->type = FP_DENSE;
+}
+
+
+/* SU= 8 */
+/* normalise all components of w */
+void YYY::FP24_norm(FP24 *w)
+{
+    FP8_norm(&(w->a));
+    FP8_norm(&(w->b));
+    FP8_norm(&(w->c));
+}
+
+/* SU= 8 */
+/* reduce all components of w */
+void YYY::FP24_reduce(FP24 *w)
+{
+    FP8_reduce(&(w->a));
+    FP8_reduce(&(w->b));
+    FP8_reduce(&(w->c));
+}
+
+/* trace function w=trace(x) */
+/* SU= 8 */
+void YYY::FP24_trace(FP8 *w, FP24 *x)
+{
+    FP8_imul(w, &(x->a), 3);
+    FP8_reduce(w);
+}
+
+/* SU= 8 */
+/* Output w in hex */
+void YYY::FP24_output(FP24 *w)
+{
+    printf("[");
+    FP8_output(&(w->a));
+    printf(",");
+    FP8_output(&(w->b));
+    printf(",");
+    FP8_output(&(w->c));
+    printf("]");
+}
+
+/* SU= 64 */
+/* Convert g to octet string w */
+void YYY::FP24_toOctet(octet *W, FP24 *g)
+{
+    W->len = 24 * MODBYTES_XXX;
+    FP8_toBytes(&(W->val[0]),&(g->c));
+    FP8_toBytes(&(W->val[8 * MODBYTES_XXX]),&(g->b));
+    FP8_toBytes(&(W->val[16 * MODBYTES_XXX]),&(g->a));
+}
+
+/* SU= 24 */
+/* Restore g from octet string w */
+void YYY::FP24_fromOctet(FP24 *g, octet *W)
+{
+    FP8_fromBytes(&(g->c),&(W->val[0]));
+    FP8_fromBytes(&(g->b),&(W->val[8 * MODBYTES_XXX]));
+    FP8_fromBytes(&(g->a),&(W->val[16 * MODBYTES_XXX]));
+}
+
+/* Move b to a if d=1 */
+void YYY::FP24_cmove(FP24 *f, FP24 *g, int d)
+{
+    FP8_cmove(&(f->a), &(g->a), d);
+    FP8_cmove(&(f->b), &(g->b), d);
+    FP8_cmove(&(f->c), &(g->c), d);
+    d = ~(d - 1);
+    f->type ^= (f->type ^ g->type)&d;
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp24.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp24.h
new file mode 100644
index 0000000..1b4b3c9
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp24.h
@@ -0,0 +1,236 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP24_YYY_H
+#define FP24_YYY_H
+
+#include "fp8_YYY.h"
+
+using namespace core;
+
+namespace YYY {
+/**
+	@brief FP12 Structure - towered over three FP8
+*/
+
+
+typedef struct
+{
+    FP8 a; /**< first part of FP12 */
+    FP8 b; /**< second part of FP12 */
+    FP8 c; /**< third part of FP12 */
+    int type;
+} FP24;
+
+extern const XXX::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const XXX::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+/* FP24 prototypes */
+/**	@brief Tests for FP24 equal to zero
+ *
+	@param x FP24 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP24_iszilch(FP24 *x);
+/**	@brief Tests for FP24 equal to unity
+ *
+	@param x FP24 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP24_isunity(FP24 *x);
+/**	@brief Copy FP24 to another FP24
+ *
+	@param x FP24 instance, on exit = y
+	@param y FP24 instance to be copied
+ */
+extern void FP24_copy(FP24 *x, FP24 *y);
+/**	@brief Set FP24 to unity
+ *
+	@param x FP24 instance to be set to one
+ */
+extern void FP24_one(FP24 *x);
+
+/**	@brief Set FP24 to zero
+ *
+	@param x FP24 instance to be set to zero
+ */
+extern void FP24_zero(FP24 *x);
+
+
+/**	@brief Tests for equality of two FP24s
+ *
+	@param x FP24 instance to be compared
+	@param y FP24 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP24_equals(FP24 *x, FP24 *y);
+/**	@brief Conjugation of FP24
+ *
+	If y=(a,b,c) (where a,b,c are its three FP8 components) on exit x=(conj(a),-conj(b),conj(c))
+	@param x FP24 instance, on exit = conj(y)
+	@param y FP24 instance
+ */
+extern void FP24_conj(FP24 *x, FP24 *y);
+/**	@brief Initialise FP24 from single FP8
+ *
+	Sets first FP8 component of an FP24, other components set to zero
+	@param x FP24 instance to be initialised
+	@param a FP8 to form first part of FP8
+ */
+extern void FP24_from_FP8(FP24 *x, FP8 *a);
+/**	@brief Initialise FP24 from three FP8s
+ *
+	@param x FP24 instance to be initialised
+	@param a FP8 to form first part of FP24
+	@param b FP8 to form second part of FP24
+	@param c FP8 to form third part of FP24
+ */
+extern void FP24_from_FP8s(FP24 *x, FP8 *a, FP8* b, FP8 *c);
+/**	@brief Fast Squaring of an FP24 in "unitary" form
+ *
+	@param x FP24 instance, on exit = y^2
+	@param y FP8 instance, must be unitary
+ */
+extern void FP24_usqr(FP24 *x, FP24 *y);
+/**	@brief Squaring an FP24
+ *
+	@param x FP24 instance, on exit = y^2
+	@param y FP24 instance
+ */
+extern void FP24_sqr(FP24 *x, FP24 *y);
+
+/**	@brief Fast multiplication of two sparse FP24s that arises from ATE pairing line functions
+ *
+	@param x FP24 instance, on exit = x*y
+	@param y FP24 instance, of special form
+ */
+extern void FP24_smul(FP24 *x, FP24 *y);
+
+/**	@brief Fast multiplication of what may be sparse multiplicands
+ *
+	@param x FP24 instance, on exit = x*y
+	@param y FP24 instance, of special form
+ */
+extern void FP24_ssmul(FP24 *x, FP24 *y);
+/**	@brief Full unconditional Multiplication of two FP24s
+ *
+	@param x FP24 instance, on exit = x*y
+	@param y FP24 instance, the multiplier
+ */
+extern void FP24_mul(FP24 *x, FP24 *y);
+
+/**	@brief Inverting an FP24
+ *
+	@param x FP24 instance, on exit = 1/y
+	@param y FP24 instance
+ */
+extern void FP24_inv(FP24 *x, FP24 *y);
+/**	@brief Raises an FP24 to the power of a BIG
+ *
+	@param r FP24 instance, on exit = y^b
+	@param x FP24 instance
+	@param b BIG number
+ */
+extern void FP24_pow(FP24 *r, FP24 *x, XXX::BIG b);
+
+//extern void FP24_ppow(FP24 *r,FP24 *x,XXX::BIG b);
+
+/**	@brief Raises an FP24 instance x to a small integer power, side-channel resistant
+ *
+	@param x FP24 instance, on exit = x^i
+	@param i small integer exponent
+	@param b maximum number of bits in exponent
+ */
+extern void FP24_pinpow(FP24 *x, int i, int b);
+
+/**	@brief Raises an FP24 instance x to a BIG power, compressed to FP8
+ *
+	@param c FP8 instance, on exit = x^(e mod r) as FP8
+	@param x FP24 input
+	@param e BIG exponent
+	@param r BIG group order
+ */
+extern void FP24_compow(FP8 *c, FP24 *x, XXX::BIG e, XXX::BIG r);
+
+/**	@brief Calculate Pi x[i]^b[i] for i=0 to 7, side-channel resistant
+ *
+	@param r FP24 instance, on exit = Pi x[i]^b[i] for i=0 to 7
+	@param x FP24 array with 4 FP24s
+	@param b BIG array of 4 exponents
+ */
+extern void FP24_pow8(FP24 *r, FP24 *x, XXX::BIG *b);
+
+
+/**	@brief Raises an FP24 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP24 instance, on exit = x^p^n
+	@param f FP2 precalculated Frobenius constant
+	@param n power of p
+ */
+extern void FP24_frob(FP24 *x, FP2 *f, int n);
+
+/**	@brief Reduces all components of possibly unreduced FP24 mod Modulus
+ *
+	@param x FP24 instance, on exit reduced mod Modulus
+ */
+extern void FP24_reduce(FP24 *x);
+/**	@brief Normalises the components of an FP24
+ *
+	@param x FP24 instance to be normalised
+ */
+extern void FP24_norm(FP24 *x);
+/**	@brief Formats and outputs an FP24 to the console
+ *
+	@param x FP24 instance to be printed
+ */
+extern void FP24_output(FP24 *x);
+/**	@brief Formats and outputs an FP24 instance to an octet string
+ *
+	Serializes the components of an FP24 to big-endian base 256 form.
+	@param S output octet string
+	@param x FP24 instance to be converted to an octet string
+ */
+extern void FP24_toOctet(octet *S, FP24 *x);
+/**	@brief Creates an FP24 instance from an octet string
+ *
+	De-serializes the components of an FP24 to create an FP24 from big-endian base 256 components.
+	@param x FP24 instance to be created from an octet string
+	@param S input octet string
+
+ */
+extern void FP24_fromOctet(FP24 *x, octet *S);
+/**	@brief Calculate the trace of an FP24
+ *
+	@param t FP8 trace of x, on exit = tr(x)
+	@param x FP24 instance
+
+ */
+extern void FP24_trace(FP8 *t, FP24 *x);
+
+/**	@brief Conditional copy of FP24 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP24 instance, set to y if s!=0
+	@param y another FP24 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP24_cmove(FP24 *x, FP24 *y, int s);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp24_BLS24479.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp24_BLS24479.h
new file mode 100644
index 0000000..1c75a26
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp24_BLS24479.h
@@ -0,0 +1,236 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP24_BLS24479_H
+#define FP24_BLS24479_H
+
+#include "fp8_BLS24479.h"
+
+using namespace core;
+
+namespace BLS24479 {
+/**
+	@brief FP12 Structure - towered over three FP8
+*/
+
+
+typedef struct
+{
+    FP8 a; /**< first part of FP12 */
+    FP8 b; /**< second part of FP12 */
+    FP8 c; /**< third part of FP12 */
+    int type;
+} FP24;
+
+extern const B480_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B480_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+/* FP24 prototypes */
+/**	@brief Tests for FP24 equal to zero
+ *
+	@param x FP24 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP24_iszilch(FP24 *x);
+/**	@brief Tests for FP24 equal to unity
+ *
+	@param x FP24 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP24_isunity(FP24 *x);
+/**	@brief Copy FP24 to another FP24
+ *
+	@param x FP24 instance, on exit = y
+	@param y FP24 instance to be copied
+ */
+extern void FP24_copy(FP24 *x, FP24 *y);
+/**	@brief Set FP24 to unity
+ *
+	@param x FP24 instance to be set to one
+ */
+extern void FP24_one(FP24 *x);
+
+/**	@brief Set FP24 to zero
+ *
+	@param x FP24 instance to be set to zero
+ */
+extern void FP24_zero(FP24 *x);
+
+
+/**	@brief Tests for equality of two FP24s
+ *
+	@param x FP24 instance to be compared
+	@param y FP24 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP24_equals(FP24 *x, FP24 *y);
+/**	@brief Conjugation of FP24
+ *
+	If y=(a,b,c) (where a,b,c are its three FP8 components) on exit x=(conj(a),-conj(b),conj(c))
+	@param x FP24 instance, on exit = conj(y)
+	@param y FP24 instance
+ */
+extern void FP24_conj(FP24 *x, FP24 *y);
+/**	@brief Initialise FP24 from single FP8
+ *
+	Sets first FP8 component of an FP24, other components set to zero
+	@param x FP24 instance to be initialised
+	@param a FP8 to form first part of FP8
+ */
+extern void FP24_from_FP8(FP24 *x, FP8 *a);
+/**	@brief Initialise FP24 from three FP8s
+ *
+	@param x FP24 instance to be initialised
+	@param a FP8 to form first part of FP24
+	@param b FP8 to form second part of FP24
+	@param c FP8 to form third part of FP24
+ */
+extern void FP24_from_FP8s(FP24 *x, FP8 *a, FP8* b, FP8 *c);
+/**	@brief Fast Squaring of an FP24 in "unitary" form
+ *
+	@param x FP24 instance, on exit = y^2
+	@param y FP8 instance, must be unitary
+ */
+extern void FP24_usqr(FP24 *x, FP24 *y);
+/**	@brief Squaring an FP24
+ *
+	@param x FP24 instance, on exit = y^2
+	@param y FP24 instance
+ */
+extern void FP24_sqr(FP24 *x, FP24 *y);
+
+/**	@brief Fast multiplication of two sparse FP24s that arises from ATE pairing line functions
+ *
+	@param x FP24 instance, on exit = x*y
+	@param y FP24 instance, of special form
+ */
+extern void FP24_smul(FP24 *x, FP24 *y);
+
+/**	@brief Fast multiplication of what may be sparse multiplicands
+ *
+	@param x FP24 instance, on exit = x*y
+	@param y FP24 instance, of special form
+ */
+extern void FP24_ssmul(FP24 *x, FP24 *y);
+/**	@brief Full unconditional Multiplication of two FP24s
+ *
+	@param x FP24 instance, on exit = x*y
+	@param y FP24 instance, the multiplier
+ */
+extern void FP24_mul(FP24 *x, FP24 *y);
+
+/**	@brief Inverting an FP24
+ *
+	@param x FP24 instance, on exit = 1/y
+	@param y FP24 instance
+ */
+extern void FP24_inv(FP24 *x, FP24 *y);
+/**	@brief Raises an FP24 to the power of a BIG
+ *
+	@param r FP24 instance, on exit = y^b
+	@param x FP24 instance
+	@param b BIG number
+ */
+extern void FP24_pow(FP24 *r, FP24 *x, B480_56::BIG b);
+
+//extern void FP24_ppow(FP24 *r,FP24 *x,B480_56::BIG b);
+
+/**	@brief Raises an FP24 instance x to a small integer power, side-channel resistant
+ *
+	@param x FP24 instance, on exit = x^i
+	@param i small integer exponent
+	@param b maximum number of bits in exponent
+ */
+extern void FP24_pinpow(FP24 *x, int i, int b);
+
+/**	@brief Raises an FP24 instance x to a BIG power, compressed to FP8
+ *
+	@param c FP8 instance, on exit = x^(e mod r) as FP8
+	@param x FP24 input
+	@param e BIG exponent
+	@param r BIG group order
+ */
+extern void FP24_compow(FP8 *c, FP24 *x, B480_56::BIG e, B480_56::BIG r);
+
+/**	@brief Calculate Pi x[i]^b[i] for i=0 to 7, side-channel resistant
+ *
+	@param r FP24 instance, on exit = Pi x[i]^b[i] for i=0 to 7
+	@param x FP24 array with 4 FP24s
+	@param b BIG array of 4 exponents
+ */
+extern void FP24_pow8(FP24 *r, FP24 *x, B480_56::BIG *b);
+
+
+/**	@brief Raises an FP24 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP24 instance, on exit = x^p^n
+	@param f FP2 precalculated Frobenius constant
+	@param n power of p
+ */
+extern void FP24_frob(FP24 *x, FP2 *f, int n);
+
+/**	@brief Reduces all components of possibly unreduced FP24 mod Modulus
+ *
+	@param x FP24 instance, on exit reduced mod Modulus
+ */
+extern void FP24_reduce(FP24 *x);
+/**	@brief Normalises the components of an FP24
+ *
+	@param x FP24 instance to be normalised
+ */
+extern void FP24_norm(FP24 *x);
+/**	@brief Formats and outputs an FP24 to the console
+ *
+	@param x FP24 instance to be printed
+ */
+extern void FP24_output(FP24 *x);
+/**	@brief Formats and outputs an FP24 instance to an octet string
+ *
+	Serializes the components of an FP24 to big-endian base 256 form.
+	@param S output octet string
+	@param x FP24 instance to be converted to an octet string
+ */
+extern void FP24_toOctet(octet *S, FP24 *x);
+/**	@brief Creates an FP24 instance from an octet string
+ *
+	De-serializes the components of an FP24 to create an FP24 from big-endian base 256 components.
+	@param x FP24 instance to be created from an octet string
+	@param S input octet string
+
+ */
+extern void FP24_fromOctet(FP24 *x, octet *S);
+/**	@brief Calculate the trace of an FP24
+ *
+	@param t FP8 trace of x, on exit = tr(x)
+	@param x FP24 instance
+
+ */
+extern void FP24_trace(FP8 *t, FP24 *x);
+
+/**	@brief Conditional copy of FP24 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP24 instance, set to y if s!=0
+	@param y another FP24 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP24_cmove(FP24 *x, FP24 *y, int s);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp2_BLS12381.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp2_BLS12381.h
new file mode 100644
index 0000000..1ce1489
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp2_BLS12381.h
@@ -0,0 +1,306 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP2_BLS12381_H
+#define FP2_BLS12381_H
+
+#include "fp_BLS12381.h"
+
+using namespace core;
+
+namespace BLS12381 {
+
+/**
+	@brief FP2 Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    FP a; /**< real part of FP2 */
+    FP b; /**< imaginary part of FP2 */
+} FP2;
+
+/* FP2 prototypes */
+
+/**	@brief Tests for FP2 equal to zero
+ *
+	@param x FP2 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP2_iszilch(FP2 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP2 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP2_islarger(FP2 *x);
+
+
+/**	@brief Serialize out FP2  
+ *
+    @param b buffer for output
+	@param x FP2 number to be serialized
+ */
+extern void FP2_toBytes(char *b,FP2 *x);
+
+/**	@brief Serialize in FP2  
+ *
+	@param x FP2 number to be serialized
+    @param b buffer for input
+ */
+extern void FP2_fromBytes(FP2 *x,char *b);
+
+/**	@brief Conditional copy of FP2 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP2 instance, set to y if s!=0
+	@param y another FP2 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP2_cmove(FP2 *x, FP2 *y, int s);
+/**	@brief Tests for FP2 equal to one
+ *
+	@param x FP2 instance to be tested
+	@return 1 if x=1, else returns 0
+ */
+extern int FP2_isunity(FP2 *x);
+/**	@brief Tests for equality of two FP2s
+ *
+	@param x FP2 instance to be compared
+	@param y FP2 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP2_equals(FP2 *x, FP2 *y);
+/**	@brief Initialise FP2 from two FP numbers
+ *
+	@param x FP2 instance to be initialised
+	@param a FP to form real part of FP2
+	@param b FP to form imaginary part of FP2
+ */
+extern void FP2_from_FPs(FP2 *x, FP *a, FP *b);
+/**	@brief Initialise FP2 from two BIG integers
+ *
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+	@param b BIG to form imaginary part of FP2
+ */
+extern void FP2_from_BIGs(FP2 *x, B384_58::BIG a, B384_58::BIG b);
+
+
+/**	@brief Initialise FP2 from two integers
+ *
+	@param x FP2 instance to be initialised
+	@param a int to form real part of FP2
+	@param b int to form imaginary part of FP2
+ */
+extern void FP2_from_ints(FP2 *x, int a, int b);
+
+
+
+/**	@brief Initialise FP2 from single FP
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param an FP to form real part of FP2
+ */
+extern void FP2_from_FP(FP2 *x, FP *a);
+/**	@brief Initialise FP2 from single BIG
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+ */
+extern void FP2_from_BIG(FP2 *x, B384_58::BIG a);
+/**	@brief Copy FP2 to another FP2
+ *
+	@param x FP2 instance, on exit = y
+	@param y FP2 instance to be copied
+ */
+extern void FP2_copy(FP2 *x, FP2 *y);
+/**	@brief Set FP2 to zero
+ *
+	@param x FP2 instance to be set to zero
+ */
+extern void FP2_zero(FP2 *x);
+/**	@brief Set FP2 to unity
+ *
+	@param x FP2 instance to be set to one
+ */
+extern void FP2_one(FP2 *x);
+
+/**	@brief Copy from ROM to an FP2
+ *
+	@param w FP2 number to be copied to
+	@param a BIG real part to be copied from ROM
+	@param b BIG imag part to be copied from ROM
+ */
+extern void FP2_rcopy(FP2 *w,const B384_58::BIG a,const B384_58::BIG b);
+
+/**	@brief Sign of FP2
+ *
+	@param x FP2 instance
+	@return "sign" of FP2
+ */
+extern int FP2_sign(FP2 *x);
+
+/**	@brief Negation of FP2
+ *
+	@param x FP2 instance, on exit = -y
+	@param y FP2 instance
+ */
+extern void FP2_neg(FP2 *x, FP2 *y);
+
+
+/**	@brief Conjugation of FP2
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP2 instance, on exit = conj(y)
+	@param y FP2 instance
+ */
+extern void FP2_conj(FP2 *x, FP2 *y);
+/**	@brief addition of two FP2s
+ *
+	@param x FP2 instance, on exit = y+z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_add(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief subtraction of two FP2s
+ *
+	@param x FP2 instance, on exit = y-z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_sub(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Multiplication of an FP2 by an FP
+ *
+	@param x FP2 instance, on exit = y*b
+	@param y FP2 instance
+	@param b FP residue
+ */
+extern void FP2_pmul(FP2 *x, FP2 *y, FP *b);
+/**	@brief Multiplication of an FP2 by a small integer
+ *
+	@param x FP2 instance, on exit = y*i
+	@param y FP2 instance
+	@param i an integer
+ */
+extern void FP2_imul(FP2 *x, FP2 *y, int i);
+/**	@brief Squaring an FP2
+ *
+	@param x FP2 instance, on exit = y^2
+	@param y FP2 instance
+ */
+extern void FP2_sqr(FP2 *x, FP2 *y);
+/**	@brief Multiplication of two FP2s
+ *
+	@param x FP2 instance, on exit = y*z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_mul(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Formats and outputs an FP2 to the console
+ *
+	@param x FP2 instance
+ */
+extern void FP2_output(FP2 *x);
+/**	@brief Formats and outputs an FP2 to the console in raw form (for debugging)
+ *
+	@param x FP2 instance
+ */
+extern void FP2_rawoutput(FP2 *x);
+/**	@brief Inverting an FP2
+ *
+	@param x FP2 instance, on exit = 1/y
+	@param y FP2 instance
+ */
+extern void FP2_inv(FP2 *x, FP2 *y, FP *h);
+/**	@brief Divide an FP2 by 2
+ *
+	@param x FP2 instance, on exit = y/2
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_div2(FP2 *x, FP2 *y);
+/**	@brief Multiply an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x*(1+sqrt(-1))
+ */
+extern void FP2_mul_ip(FP2 *x);
+
+/**	@brief Divide an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x/(1+sqrt(-1))
+ */
+extern void FP2_div_ip(FP2 *x);
+/**	@brief Normalises the components of an FP2
+ *
+	@param x FP2 instance to be normalised
+ */
+extern void FP2_norm(FP2 *x);
+/**	@brief Reduces all components of possibly unreduced FP2 mod Modulus
+ *
+	@param x FP2 instance, on exit reduced mod Modulus
+ */
+extern void FP2_reduce(FP2 *x);
+/**	@brief Raises an FP2 to the power of a BIG
+ *
+	@param x FP2 instance, on exit = y^b
+	@param y FP2 instance
+	@param b BIG number
+ */
+extern void FP2_pow(FP2 *x, FP2 *y, B384_58::BIG b);
+
+/**	@brief Test FP2 for QR
+ *
+	@param x FP2 instance
+    @param h optional generated hint
+	@return true or false
+ */
+extern int FP2_qr(FP2 *x,FP *h);
+
+
+/**	@brief Square root of an FP2
+ *
+	@param x FP2 instance, on exit = sqrt(y)
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_sqrt(FP2 *x, FP2 *y, FP *h);
+
+/**	@brief Multiply an FP2 by sqrt(-1)
+ *
+	Note that -1 is QNR
+	@param x FP2 instance, on exit = x*sqrt(-1)
+ */
+extern void FP2_times_i(FP2 *x);
+
+/**	@brief Generate random FP2
+ *
+	@param x random FP2 number
+	@param rng random number generator
+ */
+extern void FP2_rand(FP2 *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp2_BLS12383.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp2_BLS12383.h
new file mode 100644
index 0000000..cc7c945
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp2_BLS12383.h
@@ -0,0 +1,306 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP2_BLS12383_H
+#define FP2_BLS12383_H
+
+#include "fp_BLS12383.h"
+
+using namespace core;
+
+namespace BLS12383 {
+
+/**
+	@brief FP2 Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    FP a; /**< real part of FP2 */
+    FP b; /**< imaginary part of FP2 */
+} FP2;
+
+/* FP2 prototypes */
+
+/**	@brief Tests for FP2 equal to zero
+ *
+	@param x FP2 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP2_iszilch(FP2 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP2 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP2_islarger(FP2 *x);
+
+
+/**	@brief Serialize out FP2  
+ *
+    @param b buffer for output
+	@param x FP2 number to be serialized
+ */
+extern void FP2_toBytes(char *b,FP2 *x);
+
+/**	@brief Serialize in FP2  
+ *
+	@param x FP2 number to be serialized
+    @param b buffer for input
+ */
+extern void FP2_fromBytes(FP2 *x,char *b);
+
+/**	@brief Conditional copy of FP2 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP2 instance, set to y if s!=0
+	@param y another FP2 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP2_cmove(FP2 *x, FP2 *y, int s);
+/**	@brief Tests for FP2 equal to one
+ *
+	@param x FP2 instance to be tested
+	@return 1 if x=1, else returns 0
+ */
+extern int FP2_isunity(FP2 *x);
+/**	@brief Tests for equality of two FP2s
+ *
+	@param x FP2 instance to be compared
+	@param y FP2 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP2_equals(FP2 *x, FP2 *y);
+/**	@brief Initialise FP2 from two FP numbers
+ *
+	@param x FP2 instance to be initialised
+	@param a FP to form real part of FP2
+	@param b FP to form imaginary part of FP2
+ */
+extern void FP2_from_FPs(FP2 *x, FP *a, FP *b);
+/**	@brief Initialise FP2 from two BIG integers
+ *
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+	@param b BIG to form imaginary part of FP2
+ */
+extern void FP2_from_BIGs(FP2 *x, B384_58::BIG a, B384_58::BIG b);
+
+
+/**	@brief Initialise FP2 from two integers
+ *
+	@param x FP2 instance to be initialised
+	@param a int to form real part of FP2
+	@param b int to form imaginary part of FP2
+ */
+extern void FP2_from_ints(FP2 *x, int a, int b);
+
+
+
+/**	@brief Initialise FP2 from single FP
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param an FP to form real part of FP2
+ */
+extern void FP2_from_FP(FP2 *x, FP *a);
+/**	@brief Initialise FP2 from single BIG
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+ */
+extern void FP2_from_BIG(FP2 *x, B384_58::BIG a);
+/**	@brief Copy FP2 to another FP2
+ *
+	@param x FP2 instance, on exit = y
+	@param y FP2 instance to be copied
+ */
+extern void FP2_copy(FP2 *x, FP2 *y);
+/**	@brief Set FP2 to zero
+ *
+	@param x FP2 instance to be set to zero
+ */
+extern void FP2_zero(FP2 *x);
+/**	@brief Set FP2 to unity
+ *
+	@param x FP2 instance to be set to one
+ */
+extern void FP2_one(FP2 *x);
+
+/**	@brief Copy from ROM to an FP2
+ *
+	@param w FP2 number to be copied to
+	@param a BIG real part to be copied from ROM
+	@param b BIG imag part to be copied from ROM
+ */
+extern void FP2_rcopy(FP2 *w,const B384_58::BIG a,const B384_58::BIG b);
+
+/**	@brief Sign of FP2
+ *
+	@param x FP2 instance
+	@return "sign" of FP2
+ */
+extern int FP2_sign(FP2 *x);
+
+/**	@brief Negation of FP2
+ *
+	@param x FP2 instance, on exit = -y
+	@param y FP2 instance
+ */
+extern void FP2_neg(FP2 *x, FP2 *y);
+
+
+/**	@brief Conjugation of FP2
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP2 instance, on exit = conj(y)
+	@param y FP2 instance
+ */
+extern void FP2_conj(FP2 *x, FP2 *y);
+/**	@brief addition of two FP2s
+ *
+	@param x FP2 instance, on exit = y+z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_add(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief subtraction of two FP2s
+ *
+	@param x FP2 instance, on exit = y-z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_sub(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Multiplication of an FP2 by an FP
+ *
+	@param x FP2 instance, on exit = y*b
+	@param y FP2 instance
+	@param b FP residue
+ */
+extern void FP2_pmul(FP2 *x, FP2 *y, FP *b);
+/**	@brief Multiplication of an FP2 by a small integer
+ *
+	@param x FP2 instance, on exit = y*i
+	@param y FP2 instance
+	@param i an integer
+ */
+extern void FP2_imul(FP2 *x, FP2 *y, int i);
+/**	@brief Squaring an FP2
+ *
+	@param x FP2 instance, on exit = y^2
+	@param y FP2 instance
+ */
+extern void FP2_sqr(FP2 *x, FP2 *y);
+/**	@brief Multiplication of two FP2s
+ *
+	@param x FP2 instance, on exit = y*z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_mul(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Formats and outputs an FP2 to the console
+ *
+	@param x FP2 instance
+ */
+extern void FP2_output(FP2 *x);
+/**	@brief Formats and outputs an FP2 to the console in raw form (for debugging)
+ *
+	@param x FP2 instance
+ */
+extern void FP2_rawoutput(FP2 *x);
+/**	@brief Inverting an FP2
+ *
+	@param x FP2 instance, on exit = 1/y
+	@param y FP2 instance
+ */
+extern void FP2_inv(FP2 *x, FP2 *y, FP *h);
+/**	@brief Divide an FP2 by 2
+ *
+	@param x FP2 instance, on exit = y/2
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_div2(FP2 *x, FP2 *y);
+/**	@brief Multiply an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x*(1+sqrt(-1))
+ */
+extern void FP2_mul_ip(FP2 *x);
+
+/**	@brief Divide an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x/(1+sqrt(-1))
+ */
+extern void FP2_div_ip(FP2 *x);
+/**	@brief Normalises the components of an FP2
+ *
+	@param x FP2 instance to be normalised
+ */
+extern void FP2_norm(FP2 *x);
+/**	@brief Reduces all components of possibly unreduced FP2 mod Modulus
+ *
+	@param x FP2 instance, on exit reduced mod Modulus
+ */
+extern void FP2_reduce(FP2 *x);
+/**	@brief Raises an FP2 to the power of a BIG
+ *
+	@param x FP2 instance, on exit = y^b
+	@param y FP2 instance
+	@param b BIG number
+ */
+extern void FP2_pow(FP2 *x, FP2 *y, B384_58::BIG b);
+
+/**	@brief Test FP2 for QR
+ *
+	@param x FP2 instance
+    @param h optional generated hint
+	@return true or false
+ */
+extern int FP2_qr(FP2 *x,FP *h);
+
+
+/**	@brief Square root of an FP2
+ *
+	@param x FP2 instance, on exit = sqrt(y)
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_sqrt(FP2 *x, FP2 *y, FP *h);
+
+/**	@brief Multiply an FP2 by sqrt(-1)
+ *
+	Note that -1 is QNR
+	@param x FP2 instance, on exit = x*sqrt(-1)
+ */
+extern void FP2_times_i(FP2 *x);
+
+/**	@brief Generate random FP2
+ *
+	@param x random FP2 number
+	@param rng random number generator
+ */
+extern void FP2_rand(FP2 *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp2_BLS12443.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp2_BLS12443.h
new file mode 100644
index 0000000..a4e8fd2
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp2_BLS12443.h
@@ -0,0 +1,306 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP2_BLS12443_H
+#define FP2_BLS12443_H
+
+#include "fp_BLS12443.h"
+
+using namespace core;
+
+namespace BLS12443 {
+
+/**
+	@brief FP2 Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    FP a; /**< real part of FP2 */
+    FP b; /**< imaginary part of FP2 */
+} FP2;
+
+/* FP2 prototypes */
+
+/**	@brief Tests for FP2 equal to zero
+ *
+	@param x FP2 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP2_iszilch(FP2 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP2 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP2_islarger(FP2 *x);
+
+
+/**	@brief Serialize out FP2  
+ *
+    @param b buffer for output
+	@param x FP2 number to be serialized
+ */
+extern void FP2_toBytes(char *b,FP2 *x);
+
+/**	@brief Serialize in FP2  
+ *
+	@param x FP2 number to be serialized
+    @param b buffer for input
+ */
+extern void FP2_fromBytes(FP2 *x,char *b);
+
+/**	@brief Conditional copy of FP2 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP2 instance, set to y if s!=0
+	@param y another FP2 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP2_cmove(FP2 *x, FP2 *y, int s);
+/**	@brief Tests for FP2 equal to one
+ *
+	@param x FP2 instance to be tested
+	@return 1 if x=1, else returns 0
+ */
+extern int FP2_isunity(FP2 *x);
+/**	@brief Tests for equality of two FP2s
+ *
+	@param x FP2 instance to be compared
+	@param y FP2 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP2_equals(FP2 *x, FP2 *y);
+/**	@brief Initialise FP2 from two FP numbers
+ *
+	@param x FP2 instance to be initialised
+	@param a FP to form real part of FP2
+	@param b FP to form imaginary part of FP2
+ */
+extern void FP2_from_FPs(FP2 *x, FP *a, FP *b);
+/**	@brief Initialise FP2 from two BIG integers
+ *
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+	@param b BIG to form imaginary part of FP2
+ */
+extern void FP2_from_BIGs(FP2 *x, B448_60::BIG a, B448_60::BIG b);
+
+
+/**	@brief Initialise FP2 from two integers
+ *
+	@param x FP2 instance to be initialised
+	@param a int to form real part of FP2
+	@param b int to form imaginary part of FP2
+ */
+extern void FP2_from_ints(FP2 *x, int a, int b);
+
+
+
+/**	@brief Initialise FP2 from single FP
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param an FP to form real part of FP2
+ */
+extern void FP2_from_FP(FP2 *x, FP *a);
+/**	@brief Initialise FP2 from single BIG
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+ */
+extern void FP2_from_BIG(FP2 *x, B448_60::BIG a);
+/**	@brief Copy FP2 to another FP2
+ *
+	@param x FP2 instance, on exit = y
+	@param y FP2 instance to be copied
+ */
+extern void FP2_copy(FP2 *x, FP2 *y);
+/**	@brief Set FP2 to zero
+ *
+	@param x FP2 instance to be set to zero
+ */
+extern void FP2_zero(FP2 *x);
+/**	@brief Set FP2 to unity
+ *
+	@param x FP2 instance to be set to one
+ */
+extern void FP2_one(FP2 *x);
+
+/**	@brief Copy from ROM to an FP2
+ *
+	@param w FP2 number to be copied to
+	@param a BIG real part to be copied from ROM
+	@param b BIG imag part to be copied from ROM
+ */
+extern void FP2_rcopy(FP2 *w,const B448_60::BIG a,const B448_60::BIG b);
+
+/**	@brief Sign of FP2
+ *
+	@param x FP2 instance
+	@return "sign" of FP2
+ */
+extern int FP2_sign(FP2 *x);
+
+/**	@brief Negation of FP2
+ *
+	@param x FP2 instance, on exit = -y
+	@param y FP2 instance
+ */
+extern void FP2_neg(FP2 *x, FP2 *y);
+
+
+/**	@brief Conjugation of FP2
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP2 instance, on exit = conj(y)
+	@param y FP2 instance
+ */
+extern void FP2_conj(FP2 *x, FP2 *y);
+/**	@brief addition of two FP2s
+ *
+	@param x FP2 instance, on exit = y+z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_add(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief subtraction of two FP2s
+ *
+	@param x FP2 instance, on exit = y-z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_sub(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Multiplication of an FP2 by an FP
+ *
+	@param x FP2 instance, on exit = y*b
+	@param y FP2 instance
+	@param b FP residue
+ */
+extern void FP2_pmul(FP2 *x, FP2 *y, FP *b);
+/**	@brief Multiplication of an FP2 by a small integer
+ *
+	@param x FP2 instance, on exit = y*i
+	@param y FP2 instance
+	@param i an integer
+ */
+extern void FP2_imul(FP2 *x, FP2 *y, int i);
+/**	@brief Squaring an FP2
+ *
+	@param x FP2 instance, on exit = y^2
+	@param y FP2 instance
+ */
+extern void FP2_sqr(FP2 *x, FP2 *y);
+/**	@brief Multiplication of two FP2s
+ *
+	@param x FP2 instance, on exit = y*z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_mul(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Formats and outputs an FP2 to the console
+ *
+	@param x FP2 instance
+ */
+extern void FP2_output(FP2 *x);
+/**	@brief Formats and outputs an FP2 to the console in raw form (for debugging)
+ *
+	@param x FP2 instance
+ */
+extern void FP2_rawoutput(FP2 *x);
+/**	@brief Inverting an FP2
+ *
+	@param x FP2 instance, on exit = 1/y
+	@param y FP2 instance
+ */
+extern void FP2_inv(FP2 *x, FP2 *y, FP *h);
+/**	@brief Divide an FP2 by 2
+ *
+	@param x FP2 instance, on exit = y/2
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_div2(FP2 *x, FP2 *y);
+/**	@brief Multiply an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x*(1+sqrt(-1))
+ */
+extern void FP2_mul_ip(FP2 *x);
+
+/**	@brief Divide an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x/(1+sqrt(-1))
+ */
+extern void FP2_div_ip(FP2 *x);
+/**	@brief Normalises the components of an FP2
+ *
+	@param x FP2 instance to be normalised
+ */
+extern void FP2_norm(FP2 *x);
+/**	@brief Reduces all components of possibly unreduced FP2 mod Modulus
+ *
+	@param x FP2 instance, on exit reduced mod Modulus
+ */
+extern void FP2_reduce(FP2 *x);
+/**	@brief Raises an FP2 to the power of a BIG
+ *
+	@param x FP2 instance, on exit = y^b
+	@param y FP2 instance
+	@param b BIG number
+ */
+extern void FP2_pow(FP2 *x, FP2 *y, B448_60::BIG b);
+
+/**	@brief Test FP2 for QR
+ *
+	@param x FP2 instance
+    @param h optional generated hint
+	@return true or false
+ */
+extern int FP2_qr(FP2 *x,FP *h);
+
+
+/**	@brief Square root of an FP2
+ *
+	@param x FP2 instance, on exit = sqrt(y)
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_sqrt(FP2 *x, FP2 *y, FP *h);
+
+/**	@brief Multiply an FP2 by sqrt(-1)
+ *
+	Note that -1 is QNR
+	@param x FP2 instance, on exit = x*sqrt(-1)
+ */
+extern void FP2_times_i(FP2 *x);
+
+/**	@brief Generate random FP2
+ *
+	@param x random FP2 number
+	@param rng random number generator
+ */
+extern void FP2_rand(FP2 *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp2_BLS12461.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp2_BLS12461.h
new file mode 100644
index 0000000..b1479eb
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp2_BLS12461.h
@@ -0,0 +1,306 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP2_BLS12461_H
+#define FP2_BLS12461_H
+
+#include "fp_BLS12461.h"
+
+using namespace core;
+
+namespace BLS12461 {
+
+/**
+	@brief FP2 Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    FP a; /**< real part of FP2 */
+    FP b; /**< imaginary part of FP2 */
+} FP2;
+
+/* FP2 prototypes */
+
+/**	@brief Tests for FP2 equal to zero
+ *
+	@param x FP2 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP2_iszilch(FP2 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP2 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP2_islarger(FP2 *x);
+
+
+/**	@brief Serialize out FP2  
+ *
+    @param b buffer for output
+	@param x FP2 number to be serialized
+ */
+extern void FP2_toBytes(char *b,FP2 *x);
+
+/**	@brief Serialize in FP2  
+ *
+	@param x FP2 number to be serialized
+    @param b buffer for input
+ */
+extern void FP2_fromBytes(FP2 *x,char *b);
+
+/**	@brief Conditional copy of FP2 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP2 instance, set to y if s!=0
+	@param y another FP2 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP2_cmove(FP2 *x, FP2 *y, int s);
+/**	@brief Tests for FP2 equal to one
+ *
+	@param x FP2 instance to be tested
+	@return 1 if x=1, else returns 0
+ */
+extern int FP2_isunity(FP2 *x);
+/**	@brief Tests for equality of two FP2s
+ *
+	@param x FP2 instance to be compared
+	@param y FP2 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP2_equals(FP2 *x, FP2 *y);
+/**	@brief Initialise FP2 from two FP numbers
+ *
+	@param x FP2 instance to be initialised
+	@param a FP to form real part of FP2
+	@param b FP to form imaginary part of FP2
+ */
+extern void FP2_from_FPs(FP2 *x, FP *a, FP *b);
+/**	@brief Initialise FP2 from two BIG integers
+ *
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+	@param b BIG to form imaginary part of FP2
+ */
+extern void FP2_from_BIGs(FP2 *x, B464_60::BIG a, B464_60::BIG b);
+
+
+/**	@brief Initialise FP2 from two integers
+ *
+	@param x FP2 instance to be initialised
+	@param a int to form real part of FP2
+	@param b int to form imaginary part of FP2
+ */
+extern void FP2_from_ints(FP2 *x, int a, int b);
+
+
+
+/**	@brief Initialise FP2 from single FP
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param an FP to form real part of FP2
+ */
+extern void FP2_from_FP(FP2 *x, FP *a);
+/**	@brief Initialise FP2 from single BIG
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+ */
+extern void FP2_from_BIG(FP2 *x, B464_60::BIG a);
+/**	@brief Copy FP2 to another FP2
+ *
+	@param x FP2 instance, on exit = y
+	@param y FP2 instance to be copied
+ */
+extern void FP2_copy(FP2 *x, FP2 *y);
+/**	@brief Set FP2 to zero
+ *
+	@param x FP2 instance to be set to zero
+ */
+extern void FP2_zero(FP2 *x);
+/**	@brief Set FP2 to unity
+ *
+	@param x FP2 instance to be set to one
+ */
+extern void FP2_one(FP2 *x);
+
+/**	@brief Copy from ROM to an FP2
+ *
+	@param w FP2 number to be copied to
+	@param a BIG real part to be copied from ROM
+	@param b BIG imag part to be copied from ROM
+ */
+extern void FP2_rcopy(FP2 *w,const B464_60::BIG a,const B464_60::BIG b);
+
+/**	@brief Sign of FP2
+ *
+	@param x FP2 instance
+	@return "sign" of FP2
+ */
+extern int FP2_sign(FP2 *x);
+
+/**	@brief Negation of FP2
+ *
+	@param x FP2 instance, on exit = -y
+	@param y FP2 instance
+ */
+extern void FP2_neg(FP2 *x, FP2 *y);
+
+
+/**	@brief Conjugation of FP2
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP2 instance, on exit = conj(y)
+	@param y FP2 instance
+ */
+extern void FP2_conj(FP2 *x, FP2 *y);
+/**	@brief addition of two FP2s
+ *
+	@param x FP2 instance, on exit = y+z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_add(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief subtraction of two FP2s
+ *
+	@param x FP2 instance, on exit = y-z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_sub(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Multiplication of an FP2 by an FP
+ *
+	@param x FP2 instance, on exit = y*b
+	@param y FP2 instance
+	@param b FP residue
+ */
+extern void FP2_pmul(FP2 *x, FP2 *y, FP *b);
+/**	@brief Multiplication of an FP2 by a small integer
+ *
+	@param x FP2 instance, on exit = y*i
+	@param y FP2 instance
+	@param i an integer
+ */
+extern void FP2_imul(FP2 *x, FP2 *y, int i);
+/**	@brief Squaring an FP2
+ *
+	@param x FP2 instance, on exit = y^2
+	@param y FP2 instance
+ */
+extern void FP2_sqr(FP2 *x, FP2 *y);
+/**	@brief Multiplication of two FP2s
+ *
+	@param x FP2 instance, on exit = y*z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_mul(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Formats and outputs an FP2 to the console
+ *
+	@param x FP2 instance
+ */
+extern void FP2_output(FP2 *x);
+/**	@brief Formats and outputs an FP2 to the console in raw form (for debugging)
+ *
+	@param x FP2 instance
+ */
+extern void FP2_rawoutput(FP2 *x);
+/**	@brief Inverting an FP2
+ *
+	@param x FP2 instance, on exit = 1/y
+	@param y FP2 instance
+ */
+extern void FP2_inv(FP2 *x, FP2 *y, FP *h);
+/**	@brief Divide an FP2 by 2
+ *
+	@param x FP2 instance, on exit = y/2
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_div2(FP2 *x, FP2 *y);
+/**	@brief Multiply an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x*(1+sqrt(-1))
+ */
+extern void FP2_mul_ip(FP2 *x);
+
+/**	@brief Divide an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x/(1+sqrt(-1))
+ */
+extern void FP2_div_ip(FP2 *x);
+/**	@brief Normalises the components of an FP2
+ *
+	@param x FP2 instance to be normalised
+ */
+extern void FP2_norm(FP2 *x);
+/**	@brief Reduces all components of possibly unreduced FP2 mod Modulus
+ *
+	@param x FP2 instance, on exit reduced mod Modulus
+ */
+extern void FP2_reduce(FP2 *x);
+/**	@brief Raises an FP2 to the power of a BIG
+ *
+	@param x FP2 instance, on exit = y^b
+	@param y FP2 instance
+	@param b BIG number
+ */
+extern void FP2_pow(FP2 *x, FP2 *y, B464_60::BIG b);
+
+/**	@brief Test FP2 for QR
+ *
+	@param x FP2 instance
+    @param h optional generated hint
+	@return true or false
+ */
+extern int FP2_qr(FP2 *x,FP *h);
+
+
+/**	@brief Square root of an FP2
+ *
+	@param x FP2 instance, on exit = sqrt(y)
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_sqrt(FP2 *x, FP2 *y, FP *h);
+
+/**	@brief Multiply an FP2 by sqrt(-1)
+ *
+	Note that -1 is QNR
+	@param x FP2 instance, on exit = x*sqrt(-1)
+ */
+extern void FP2_times_i(FP2 *x);
+
+/**	@brief Generate random FP2
+ *
+	@param x random FP2 number
+	@param rng random number generator
+ */
+extern void FP2_rand(FP2 *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp2_BLS24479.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp2_BLS24479.h
new file mode 100644
index 0000000..a67e351
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp2_BLS24479.h
@@ -0,0 +1,306 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP2_BLS24479_H
+#define FP2_BLS24479_H
+
+#include "fp_BLS24479.h"
+
+using namespace core;
+
+namespace BLS24479 {
+
+/**
+	@brief FP2 Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    FP a; /**< real part of FP2 */
+    FP b; /**< imaginary part of FP2 */
+} FP2;
+
+/* FP2 prototypes */
+
+/**	@brief Tests for FP2 equal to zero
+ *
+	@param x FP2 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP2_iszilch(FP2 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP2 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP2_islarger(FP2 *x);
+
+
+/**	@brief Serialize out FP2  
+ *
+    @param b buffer for output
+	@param x FP2 number to be serialized
+ */
+extern void FP2_toBytes(char *b,FP2 *x);
+
+/**	@brief Serialize in FP2  
+ *
+	@param x FP2 number to be serialized
+    @param b buffer for input
+ */
+extern void FP2_fromBytes(FP2 *x,char *b);
+
+/**	@brief Conditional copy of FP2 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP2 instance, set to y if s!=0
+	@param y another FP2 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP2_cmove(FP2 *x, FP2 *y, int s);
+/**	@brief Tests for FP2 equal to one
+ *
+	@param x FP2 instance to be tested
+	@return 1 if x=1, else returns 0
+ */
+extern int FP2_isunity(FP2 *x);
+/**	@brief Tests for equality of two FP2s
+ *
+	@param x FP2 instance to be compared
+	@param y FP2 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP2_equals(FP2 *x, FP2 *y);
+/**	@brief Initialise FP2 from two FP numbers
+ *
+	@param x FP2 instance to be initialised
+	@param a FP to form real part of FP2
+	@param b FP to form imaginary part of FP2
+ */
+extern void FP2_from_FPs(FP2 *x, FP *a, FP *b);
+/**	@brief Initialise FP2 from two BIG integers
+ *
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+	@param b BIG to form imaginary part of FP2
+ */
+extern void FP2_from_BIGs(FP2 *x, B480_56::BIG a, B480_56::BIG b);
+
+
+/**	@brief Initialise FP2 from two integers
+ *
+	@param x FP2 instance to be initialised
+	@param a int to form real part of FP2
+	@param b int to form imaginary part of FP2
+ */
+extern void FP2_from_ints(FP2 *x, int a, int b);
+
+
+
+/**	@brief Initialise FP2 from single FP
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param an FP to form real part of FP2
+ */
+extern void FP2_from_FP(FP2 *x, FP *a);
+/**	@brief Initialise FP2 from single BIG
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+ */
+extern void FP2_from_BIG(FP2 *x, B480_56::BIG a);
+/**	@brief Copy FP2 to another FP2
+ *
+	@param x FP2 instance, on exit = y
+	@param y FP2 instance to be copied
+ */
+extern void FP2_copy(FP2 *x, FP2 *y);
+/**	@brief Set FP2 to zero
+ *
+	@param x FP2 instance to be set to zero
+ */
+extern void FP2_zero(FP2 *x);
+/**	@brief Set FP2 to unity
+ *
+	@param x FP2 instance to be set to one
+ */
+extern void FP2_one(FP2 *x);
+
+/**	@brief Copy from ROM to an FP2
+ *
+	@param w FP2 number to be copied to
+	@param a BIG real part to be copied from ROM
+	@param b BIG imag part to be copied from ROM
+ */
+extern void FP2_rcopy(FP2 *w,const B480_56::BIG a,const B480_56::BIG b);
+
+/**	@brief Sign of FP2
+ *
+	@param x FP2 instance
+	@return "sign" of FP2
+ */
+extern int FP2_sign(FP2 *x);
+
+/**	@brief Negation of FP2
+ *
+	@param x FP2 instance, on exit = -y
+	@param y FP2 instance
+ */
+extern void FP2_neg(FP2 *x, FP2 *y);
+
+
+/**	@brief Conjugation of FP2
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP2 instance, on exit = conj(y)
+	@param y FP2 instance
+ */
+extern void FP2_conj(FP2 *x, FP2 *y);
+/**	@brief addition of two FP2s
+ *
+	@param x FP2 instance, on exit = y+z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_add(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief subtraction of two FP2s
+ *
+	@param x FP2 instance, on exit = y-z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_sub(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Multiplication of an FP2 by an FP
+ *
+	@param x FP2 instance, on exit = y*b
+	@param y FP2 instance
+	@param b FP residue
+ */
+extern void FP2_pmul(FP2 *x, FP2 *y, FP *b);
+/**	@brief Multiplication of an FP2 by a small integer
+ *
+	@param x FP2 instance, on exit = y*i
+	@param y FP2 instance
+	@param i an integer
+ */
+extern void FP2_imul(FP2 *x, FP2 *y, int i);
+/**	@brief Squaring an FP2
+ *
+	@param x FP2 instance, on exit = y^2
+	@param y FP2 instance
+ */
+extern void FP2_sqr(FP2 *x, FP2 *y);
+/**	@brief Multiplication of two FP2s
+ *
+	@param x FP2 instance, on exit = y*z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_mul(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Formats and outputs an FP2 to the console
+ *
+	@param x FP2 instance
+ */
+extern void FP2_output(FP2 *x);
+/**	@brief Formats and outputs an FP2 to the console in raw form (for debugging)
+ *
+	@param x FP2 instance
+ */
+extern void FP2_rawoutput(FP2 *x);
+/**	@brief Inverting an FP2
+ *
+	@param x FP2 instance, on exit = 1/y
+	@param y FP2 instance
+ */
+extern void FP2_inv(FP2 *x, FP2 *y, FP *h);
+/**	@brief Divide an FP2 by 2
+ *
+	@param x FP2 instance, on exit = y/2
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_div2(FP2 *x, FP2 *y);
+/**	@brief Multiply an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x*(1+sqrt(-1))
+ */
+extern void FP2_mul_ip(FP2 *x);
+
+/**	@brief Divide an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x/(1+sqrt(-1))
+ */
+extern void FP2_div_ip(FP2 *x);
+/**	@brief Normalises the components of an FP2
+ *
+	@param x FP2 instance to be normalised
+ */
+extern void FP2_norm(FP2 *x);
+/**	@brief Reduces all components of possibly unreduced FP2 mod Modulus
+ *
+	@param x FP2 instance, on exit reduced mod Modulus
+ */
+extern void FP2_reduce(FP2 *x);
+/**	@brief Raises an FP2 to the power of a BIG
+ *
+	@param x FP2 instance, on exit = y^b
+	@param y FP2 instance
+	@param b BIG number
+ */
+extern void FP2_pow(FP2 *x, FP2 *y, B480_56::BIG b);
+
+/**	@brief Test FP2 for QR
+ *
+	@param x FP2 instance
+    @param h optional generated hint
+	@return true or false
+ */
+extern int FP2_qr(FP2 *x,FP *h);
+
+
+/**	@brief Square root of an FP2
+ *
+	@param x FP2 instance, on exit = sqrt(y)
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_sqrt(FP2 *x, FP2 *y, FP *h);
+
+/**	@brief Multiply an FP2 by sqrt(-1)
+ *
+	Note that -1 is QNR
+	@param x FP2 instance, on exit = x*sqrt(-1)
+ */
+extern void FP2_times_i(FP2 *x);
+
+/**	@brief Generate random FP2
+ *
+	@param x random FP2 number
+	@param rng random number generator
+ */
+extern void FP2_rand(FP2 *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp2_BLS48286.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp2_BLS48286.h
new file mode 100644
index 0000000..a5c6fce
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp2_BLS48286.h
@@ -0,0 +1,306 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP2_BLS48286_H
+#define FP2_BLS48286_H
+
+#include "fp_BLS48286.h"
+
+using namespace core;
+
+namespace BLS48286 {
+
+/**
+	@brief FP2 Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    FP a; /**< real part of FP2 */
+    FP b; /**< imaginary part of FP2 */
+} FP2;
+
+/* FP2 prototypes */
+
+/**	@brief Tests for FP2 equal to zero
+ *
+	@param x FP2 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP2_iszilch(FP2 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP2 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP2_islarger(FP2 *x);
+
+
+/**	@brief Serialize out FP2  
+ *
+    @param b buffer for output
+	@param x FP2 number to be serialized
+ */
+extern void FP2_toBytes(char *b,FP2 *x);
+
+/**	@brief Serialize in FP2  
+ *
+	@param x FP2 number to be serialized
+    @param b buffer for input
+ */
+extern void FP2_fromBytes(FP2 *x,char *b);
+
+/**	@brief Conditional copy of FP2 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP2 instance, set to y if s!=0
+	@param y another FP2 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP2_cmove(FP2 *x, FP2 *y, int s);
+/**	@brief Tests for FP2 equal to one
+ *
+	@param x FP2 instance to be tested
+	@return 1 if x=1, else returns 0
+ */
+extern int FP2_isunity(FP2 *x);
+/**	@brief Tests for equality of two FP2s
+ *
+	@param x FP2 instance to be compared
+	@param y FP2 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP2_equals(FP2 *x, FP2 *y);
+/**	@brief Initialise FP2 from two FP numbers
+ *
+	@param x FP2 instance to be initialised
+	@param a FP to form real part of FP2
+	@param b FP to form imaginary part of FP2
+ */
+extern void FP2_from_FPs(FP2 *x, FP *a, FP *b);
+/**	@brief Initialise FP2 from two BIG integers
+ *
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+	@param b BIG to form imaginary part of FP2
+ */
+extern void FP2_from_BIGs(FP2 *x, B288_60::BIG a, B288_60::BIG b);
+
+
+/**	@brief Initialise FP2 from two integers
+ *
+	@param x FP2 instance to be initialised
+	@param a int to form real part of FP2
+	@param b int to form imaginary part of FP2
+ */
+extern void FP2_from_ints(FP2 *x, int a, int b);
+
+
+
+/**	@brief Initialise FP2 from single FP
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param an FP to form real part of FP2
+ */
+extern void FP2_from_FP(FP2 *x, FP *a);
+/**	@brief Initialise FP2 from single BIG
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+ */
+extern void FP2_from_BIG(FP2 *x, B288_60::BIG a);
+/**	@brief Copy FP2 to another FP2
+ *
+	@param x FP2 instance, on exit = y
+	@param y FP2 instance to be copied
+ */
+extern void FP2_copy(FP2 *x, FP2 *y);
+/**	@brief Set FP2 to zero
+ *
+	@param x FP2 instance to be set to zero
+ */
+extern void FP2_zero(FP2 *x);
+/**	@brief Set FP2 to unity
+ *
+	@param x FP2 instance to be set to one
+ */
+extern void FP2_one(FP2 *x);
+
+/**	@brief Copy from ROM to an FP2
+ *
+	@param w FP2 number to be copied to
+	@param a BIG real part to be copied from ROM
+	@param b BIG imag part to be copied from ROM
+ */
+extern void FP2_rcopy(FP2 *w,const B288_60::BIG a,const B288_60::BIG b);
+
+/**	@brief Sign of FP2
+ *
+	@param x FP2 instance
+	@return "sign" of FP2
+ */
+extern int FP2_sign(FP2 *x);
+
+/**	@brief Negation of FP2
+ *
+	@param x FP2 instance, on exit = -y
+	@param y FP2 instance
+ */
+extern void FP2_neg(FP2 *x, FP2 *y);
+
+
+/**	@brief Conjugation of FP2
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP2 instance, on exit = conj(y)
+	@param y FP2 instance
+ */
+extern void FP2_conj(FP2 *x, FP2 *y);
+/**	@brief addition of two FP2s
+ *
+	@param x FP2 instance, on exit = y+z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_add(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief subtraction of two FP2s
+ *
+	@param x FP2 instance, on exit = y-z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_sub(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Multiplication of an FP2 by an FP
+ *
+	@param x FP2 instance, on exit = y*b
+	@param y FP2 instance
+	@param b FP residue
+ */
+extern void FP2_pmul(FP2 *x, FP2 *y, FP *b);
+/**	@brief Multiplication of an FP2 by a small integer
+ *
+	@param x FP2 instance, on exit = y*i
+	@param y FP2 instance
+	@param i an integer
+ */
+extern void FP2_imul(FP2 *x, FP2 *y, int i);
+/**	@brief Squaring an FP2
+ *
+	@param x FP2 instance, on exit = y^2
+	@param y FP2 instance
+ */
+extern void FP2_sqr(FP2 *x, FP2 *y);
+/**	@brief Multiplication of two FP2s
+ *
+	@param x FP2 instance, on exit = y*z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_mul(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Formats and outputs an FP2 to the console
+ *
+	@param x FP2 instance
+ */
+extern void FP2_output(FP2 *x);
+/**	@brief Formats and outputs an FP2 to the console in raw form (for debugging)
+ *
+	@param x FP2 instance
+ */
+extern void FP2_rawoutput(FP2 *x);
+/**	@brief Inverting an FP2
+ *
+	@param x FP2 instance, on exit = 1/y
+	@param y FP2 instance
+ */
+extern void FP2_inv(FP2 *x, FP2 *y, FP *h);
+/**	@brief Divide an FP2 by 2
+ *
+	@param x FP2 instance, on exit = y/2
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_div2(FP2 *x, FP2 *y);
+/**	@brief Multiply an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x*(1+sqrt(-1))
+ */
+extern void FP2_mul_ip(FP2 *x);
+
+/**	@brief Divide an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x/(1+sqrt(-1))
+ */
+extern void FP2_div_ip(FP2 *x);
+/**	@brief Normalises the components of an FP2
+ *
+	@param x FP2 instance to be normalised
+ */
+extern void FP2_norm(FP2 *x);
+/**	@brief Reduces all components of possibly unreduced FP2 mod Modulus
+ *
+	@param x FP2 instance, on exit reduced mod Modulus
+ */
+extern void FP2_reduce(FP2 *x);
+/**	@brief Raises an FP2 to the power of a BIG
+ *
+	@param x FP2 instance, on exit = y^b
+	@param y FP2 instance
+	@param b BIG number
+ */
+extern void FP2_pow(FP2 *x, FP2 *y, B288_60::BIG b);
+
+/**	@brief Test FP2 for QR
+ *
+	@param x FP2 instance
+    @param h optional generated hint
+	@return true or false
+ */
+extern int FP2_qr(FP2 *x,FP *h);
+
+
+/**	@brief Square root of an FP2
+ *
+	@param x FP2 instance, on exit = sqrt(y)
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_sqrt(FP2 *x, FP2 *y, FP *h);
+
+/**	@brief Multiply an FP2 by sqrt(-1)
+ *
+	Note that -1 is QNR
+	@param x FP2 instance, on exit = x*sqrt(-1)
+ */
+extern void FP2_times_i(FP2 *x);
+
+/**	@brief Generate random FP2
+ *
+	@param x random FP2 number
+	@param rng random number generator
+ */
+extern void FP2_rand(FP2 *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp2_BLS48556.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp2_BLS48556.h
new file mode 100644
index 0000000..a569c2d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp2_BLS48556.h
@@ -0,0 +1,306 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP2_BLS48556_H
+#define FP2_BLS48556_H
+
+#include "fp_BLS48556.h"
+
+using namespace core;
+
+namespace BLS48556 {
+
+/**
+	@brief FP2 Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    FP a; /**< real part of FP2 */
+    FP b; /**< imaginary part of FP2 */
+} FP2;
+
+/* FP2 prototypes */
+
+/**	@brief Tests for FP2 equal to zero
+ *
+	@param x FP2 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP2_iszilch(FP2 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP2 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP2_islarger(FP2 *x);
+
+
+/**	@brief Serialize out FP2  
+ *
+    @param b buffer for output
+	@param x FP2 number to be serialized
+ */
+extern void FP2_toBytes(char *b,FP2 *x);
+
+/**	@brief Serialize in FP2  
+ *
+	@param x FP2 number to be serialized
+    @param b buffer for input
+ */
+extern void FP2_fromBytes(FP2 *x,char *b);
+
+/**	@brief Conditional copy of FP2 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP2 instance, set to y if s!=0
+	@param y another FP2 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP2_cmove(FP2 *x, FP2 *y, int s);
+/**	@brief Tests for FP2 equal to one
+ *
+	@param x FP2 instance to be tested
+	@return 1 if x=1, else returns 0
+ */
+extern int FP2_isunity(FP2 *x);
+/**	@brief Tests for equality of two FP2s
+ *
+	@param x FP2 instance to be compared
+	@param y FP2 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP2_equals(FP2 *x, FP2 *y);
+/**	@brief Initialise FP2 from two FP numbers
+ *
+	@param x FP2 instance to be initialised
+	@param a FP to form real part of FP2
+	@param b FP to form imaginary part of FP2
+ */
+extern void FP2_from_FPs(FP2 *x, FP *a, FP *b);
+/**	@brief Initialise FP2 from two BIG integers
+ *
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+	@param b BIG to form imaginary part of FP2
+ */
+extern void FP2_from_BIGs(FP2 *x, B560_58::BIG a, B560_58::BIG b);
+
+
+/**	@brief Initialise FP2 from two integers
+ *
+	@param x FP2 instance to be initialised
+	@param a int to form real part of FP2
+	@param b int to form imaginary part of FP2
+ */
+extern void FP2_from_ints(FP2 *x, int a, int b);
+
+
+
+/**	@brief Initialise FP2 from single FP
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param an FP to form real part of FP2
+ */
+extern void FP2_from_FP(FP2 *x, FP *a);
+/**	@brief Initialise FP2 from single BIG
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+ */
+extern void FP2_from_BIG(FP2 *x, B560_58::BIG a);
+/**	@brief Copy FP2 to another FP2
+ *
+	@param x FP2 instance, on exit = y
+	@param y FP2 instance to be copied
+ */
+extern void FP2_copy(FP2 *x, FP2 *y);
+/**	@brief Set FP2 to zero
+ *
+	@param x FP2 instance to be set to zero
+ */
+extern void FP2_zero(FP2 *x);
+/**	@brief Set FP2 to unity
+ *
+	@param x FP2 instance to be set to one
+ */
+extern void FP2_one(FP2 *x);
+
+/**	@brief Copy from ROM to an FP2
+ *
+	@param w FP2 number to be copied to
+	@param a BIG real part to be copied from ROM
+	@param b BIG imag part to be copied from ROM
+ */
+extern void FP2_rcopy(FP2 *w,const B560_58::BIG a,const B560_58::BIG b);
+
+/**	@brief Sign of FP2
+ *
+	@param x FP2 instance
+	@return "sign" of FP2
+ */
+extern int FP2_sign(FP2 *x);
+
+/**	@brief Negation of FP2
+ *
+	@param x FP2 instance, on exit = -y
+	@param y FP2 instance
+ */
+extern void FP2_neg(FP2 *x, FP2 *y);
+
+
+/**	@brief Conjugation of FP2
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP2 instance, on exit = conj(y)
+	@param y FP2 instance
+ */
+extern void FP2_conj(FP2 *x, FP2 *y);
+/**	@brief addition of two FP2s
+ *
+	@param x FP2 instance, on exit = y+z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_add(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief subtraction of two FP2s
+ *
+	@param x FP2 instance, on exit = y-z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_sub(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Multiplication of an FP2 by an FP
+ *
+	@param x FP2 instance, on exit = y*b
+	@param y FP2 instance
+	@param b FP residue
+ */
+extern void FP2_pmul(FP2 *x, FP2 *y, FP *b);
+/**	@brief Multiplication of an FP2 by a small integer
+ *
+	@param x FP2 instance, on exit = y*i
+	@param y FP2 instance
+	@param i an integer
+ */
+extern void FP2_imul(FP2 *x, FP2 *y, int i);
+/**	@brief Squaring an FP2
+ *
+	@param x FP2 instance, on exit = y^2
+	@param y FP2 instance
+ */
+extern void FP2_sqr(FP2 *x, FP2 *y);
+/**	@brief Multiplication of two FP2s
+ *
+	@param x FP2 instance, on exit = y*z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_mul(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Formats and outputs an FP2 to the console
+ *
+	@param x FP2 instance
+ */
+extern void FP2_output(FP2 *x);
+/**	@brief Formats and outputs an FP2 to the console in raw form (for debugging)
+ *
+	@param x FP2 instance
+ */
+extern void FP2_rawoutput(FP2 *x);
+/**	@brief Inverting an FP2
+ *
+	@param x FP2 instance, on exit = 1/y
+	@param y FP2 instance
+ */
+extern void FP2_inv(FP2 *x, FP2 *y, FP *h);
+/**	@brief Divide an FP2 by 2
+ *
+	@param x FP2 instance, on exit = y/2
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_div2(FP2 *x, FP2 *y);
+/**	@brief Multiply an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x*(1+sqrt(-1))
+ */
+extern void FP2_mul_ip(FP2 *x);
+
+/**	@brief Divide an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x/(1+sqrt(-1))
+ */
+extern void FP2_div_ip(FP2 *x);
+/**	@brief Normalises the components of an FP2
+ *
+	@param x FP2 instance to be normalised
+ */
+extern void FP2_norm(FP2 *x);
+/**	@brief Reduces all components of possibly unreduced FP2 mod Modulus
+ *
+	@param x FP2 instance, on exit reduced mod Modulus
+ */
+extern void FP2_reduce(FP2 *x);
+/**	@brief Raises an FP2 to the power of a BIG
+ *
+	@param x FP2 instance, on exit = y^b
+	@param y FP2 instance
+	@param b BIG number
+ */
+extern void FP2_pow(FP2 *x, FP2 *y, B560_58::BIG b);
+
+/**	@brief Test FP2 for QR
+ *
+	@param x FP2 instance
+    @param h optional generated hint
+	@return true or false
+ */
+extern int FP2_qr(FP2 *x,FP *h);
+
+
+/**	@brief Square root of an FP2
+ *
+	@param x FP2 instance, on exit = sqrt(y)
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_sqrt(FP2 *x, FP2 *y, FP *h);
+
+/**	@brief Multiply an FP2 by sqrt(-1)
+ *
+	Note that -1 is QNR
+	@param x FP2 instance, on exit = x*sqrt(-1)
+ */
+extern void FP2_times_i(FP2 *x);
+
+/**	@brief Generate random FP2
+ *
+	@param x random FP2 number
+	@param rng random number generator
+ */
+extern void FP2_rand(FP2 *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp2_BLS48581.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp2_BLS48581.h
new file mode 100644
index 0000000..ef3b7fd
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp2_BLS48581.h
@@ -0,0 +1,306 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP2_BLS48581_H
+#define FP2_BLS48581_H
+
+#include "fp_BLS48581.h"
+
+using namespace core;
+
+namespace BLS48581 {
+
+/**
+	@brief FP2 Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    FP a; /**< real part of FP2 */
+    FP b; /**< imaginary part of FP2 */
+} FP2;
+
+/* FP2 prototypes */
+
+/**	@brief Tests for FP2 equal to zero
+ *
+	@param x FP2 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP2_iszilch(FP2 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP2 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP2_islarger(FP2 *x);
+
+
+/**	@brief Serialize out FP2  
+ *
+    @param b buffer for output
+	@param x FP2 number to be serialized
+ */
+extern void FP2_toBytes(char *b,FP2 *x);
+
+/**	@brief Serialize in FP2  
+ *
+	@param x FP2 number to be serialized
+    @param b buffer for input
+ */
+extern void FP2_fromBytes(FP2 *x,char *b);
+
+/**	@brief Conditional copy of FP2 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP2 instance, set to y if s!=0
+	@param y another FP2 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP2_cmove(FP2 *x, FP2 *y, int s);
+/**	@brief Tests for FP2 equal to one
+ *
+	@param x FP2 instance to be tested
+	@return 1 if x=1, else returns 0
+ */
+extern int FP2_isunity(FP2 *x);
+/**	@brief Tests for equality of two FP2s
+ *
+	@param x FP2 instance to be compared
+	@param y FP2 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP2_equals(FP2 *x, FP2 *y);
+/**	@brief Initialise FP2 from two FP numbers
+ *
+	@param x FP2 instance to be initialised
+	@param a FP to form real part of FP2
+	@param b FP to form imaginary part of FP2
+ */
+extern void FP2_from_FPs(FP2 *x, FP *a, FP *b);
+/**	@brief Initialise FP2 from two BIG integers
+ *
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+	@param b BIG to form imaginary part of FP2
+ */
+extern void FP2_from_BIGs(FP2 *x, B584_60::BIG a, B584_60::BIG b);
+
+
+/**	@brief Initialise FP2 from two integers
+ *
+	@param x FP2 instance to be initialised
+	@param a int to form real part of FP2
+	@param b int to form imaginary part of FP2
+ */
+extern void FP2_from_ints(FP2 *x, int a, int b);
+
+
+
+/**	@brief Initialise FP2 from single FP
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param an FP to form real part of FP2
+ */
+extern void FP2_from_FP(FP2 *x, FP *a);
+/**	@brief Initialise FP2 from single BIG
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+ */
+extern void FP2_from_BIG(FP2 *x, B584_60::BIG a);
+/**	@brief Copy FP2 to another FP2
+ *
+	@param x FP2 instance, on exit = y
+	@param y FP2 instance to be copied
+ */
+extern void FP2_copy(FP2 *x, FP2 *y);
+/**	@brief Set FP2 to zero
+ *
+	@param x FP2 instance to be set to zero
+ */
+extern void FP2_zero(FP2 *x);
+/**	@brief Set FP2 to unity
+ *
+	@param x FP2 instance to be set to one
+ */
+extern void FP2_one(FP2 *x);
+
+/**	@brief Copy from ROM to an FP2
+ *
+	@param w FP2 number to be copied to
+	@param a BIG real part to be copied from ROM
+	@param b BIG imag part to be copied from ROM
+ */
+extern void FP2_rcopy(FP2 *w,const B584_60::BIG a,const B584_60::BIG b);
+
+/**	@brief Sign of FP2
+ *
+	@param x FP2 instance
+	@return "sign" of FP2
+ */
+extern int FP2_sign(FP2 *x);
+
+/**	@brief Negation of FP2
+ *
+	@param x FP2 instance, on exit = -y
+	@param y FP2 instance
+ */
+extern void FP2_neg(FP2 *x, FP2 *y);
+
+
+/**	@brief Conjugation of FP2
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP2 instance, on exit = conj(y)
+	@param y FP2 instance
+ */
+extern void FP2_conj(FP2 *x, FP2 *y);
+/**	@brief addition of two FP2s
+ *
+	@param x FP2 instance, on exit = y+z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_add(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief subtraction of two FP2s
+ *
+	@param x FP2 instance, on exit = y-z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_sub(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Multiplication of an FP2 by an FP
+ *
+	@param x FP2 instance, on exit = y*b
+	@param y FP2 instance
+	@param b FP residue
+ */
+extern void FP2_pmul(FP2 *x, FP2 *y, FP *b);
+/**	@brief Multiplication of an FP2 by a small integer
+ *
+	@param x FP2 instance, on exit = y*i
+	@param y FP2 instance
+	@param i an integer
+ */
+extern void FP2_imul(FP2 *x, FP2 *y, int i);
+/**	@brief Squaring an FP2
+ *
+	@param x FP2 instance, on exit = y^2
+	@param y FP2 instance
+ */
+extern void FP2_sqr(FP2 *x, FP2 *y);
+/**	@brief Multiplication of two FP2s
+ *
+	@param x FP2 instance, on exit = y*z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_mul(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Formats and outputs an FP2 to the console
+ *
+	@param x FP2 instance
+ */
+extern void FP2_output(FP2 *x);
+/**	@brief Formats and outputs an FP2 to the console in raw form (for debugging)
+ *
+	@param x FP2 instance
+ */
+extern void FP2_rawoutput(FP2 *x);
+/**	@brief Inverting an FP2
+ *
+	@param x FP2 instance, on exit = 1/y
+	@param y FP2 instance
+ */
+extern void FP2_inv(FP2 *x, FP2 *y, FP *h);
+/**	@brief Divide an FP2 by 2
+ *
+	@param x FP2 instance, on exit = y/2
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_div2(FP2 *x, FP2 *y);
+/**	@brief Multiply an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x*(1+sqrt(-1))
+ */
+extern void FP2_mul_ip(FP2 *x);
+
+/**	@brief Divide an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x/(1+sqrt(-1))
+ */
+extern void FP2_div_ip(FP2 *x);
+/**	@brief Normalises the components of an FP2
+ *
+	@param x FP2 instance to be normalised
+ */
+extern void FP2_norm(FP2 *x);
+/**	@brief Reduces all components of possibly unreduced FP2 mod Modulus
+ *
+	@param x FP2 instance, on exit reduced mod Modulus
+ */
+extern void FP2_reduce(FP2 *x);
+/**	@brief Raises an FP2 to the power of a BIG
+ *
+	@param x FP2 instance, on exit = y^b
+	@param y FP2 instance
+	@param b BIG number
+ */
+extern void FP2_pow(FP2 *x, FP2 *y, B584_60::BIG b);
+
+/**	@brief Test FP2 for QR
+ *
+	@param x FP2 instance
+    @param h optional generated hint
+	@return true or false
+ */
+extern int FP2_qr(FP2 *x,FP *h);
+
+
+/**	@brief Square root of an FP2
+ *
+	@param x FP2 instance, on exit = sqrt(y)
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_sqrt(FP2 *x, FP2 *y, FP *h);
+
+/**	@brief Multiply an FP2 by sqrt(-1)
+ *
+	Note that -1 is QNR
+	@param x FP2 instance, on exit = x*sqrt(-1)
+ */
+extern void FP2_times_i(FP2 *x);
+
+/**	@brief Generate random FP2
+ *
+	@param x random FP2 number
+	@param rng random number generator
+ */
+extern void FP2_rand(FP2 *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp2_BN158.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp2_BN158.h
new file mode 100644
index 0000000..5904174
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp2_BN158.h
@@ -0,0 +1,306 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP2_BN158_H
+#define FP2_BN158_H
+
+#include "fp_BN158.h"
+
+using namespace core;
+
+namespace BN158 {
+
+/**
+	@brief FP2 Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    FP a; /**< real part of FP2 */
+    FP b; /**< imaginary part of FP2 */
+} FP2;
+
+/* FP2 prototypes */
+
+/**	@brief Tests for FP2 equal to zero
+ *
+	@param x FP2 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP2_iszilch(FP2 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP2 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP2_islarger(FP2 *x);
+
+
+/**	@brief Serialize out FP2  
+ *
+    @param b buffer for output
+	@param x FP2 number to be serialized
+ */
+extern void FP2_toBytes(char *b,FP2 *x);
+
+/**	@brief Serialize in FP2  
+ *
+	@param x FP2 number to be serialized
+    @param b buffer for input
+ */
+extern void FP2_fromBytes(FP2 *x,char *b);
+
+/**	@brief Conditional copy of FP2 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP2 instance, set to y if s!=0
+	@param y another FP2 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP2_cmove(FP2 *x, FP2 *y, int s);
+/**	@brief Tests for FP2 equal to one
+ *
+	@param x FP2 instance to be tested
+	@return 1 if x=1, else returns 0
+ */
+extern int FP2_isunity(FP2 *x);
+/**	@brief Tests for equality of two FP2s
+ *
+	@param x FP2 instance to be compared
+	@param y FP2 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP2_equals(FP2 *x, FP2 *y);
+/**	@brief Initialise FP2 from two FP numbers
+ *
+	@param x FP2 instance to be initialised
+	@param a FP to form real part of FP2
+	@param b FP to form imaginary part of FP2
+ */
+extern void FP2_from_FPs(FP2 *x, FP *a, FP *b);
+/**	@brief Initialise FP2 from two BIG integers
+ *
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+	@param b BIG to form imaginary part of FP2
+ */
+extern void FP2_from_BIGs(FP2 *x, B160_56::BIG a, B160_56::BIG b);
+
+
+/**	@brief Initialise FP2 from two integers
+ *
+	@param x FP2 instance to be initialised
+	@param a int to form real part of FP2
+	@param b int to form imaginary part of FP2
+ */
+extern void FP2_from_ints(FP2 *x, int a, int b);
+
+
+
+/**	@brief Initialise FP2 from single FP
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param an FP to form real part of FP2
+ */
+extern void FP2_from_FP(FP2 *x, FP *a);
+/**	@brief Initialise FP2 from single BIG
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+ */
+extern void FP2_from_BIG(FP2 *x, B160_56::BIG a);
+/**	@brief Copy FP2 to another FP2
+ *
+	@param x FP2 instance, on exit = y
+	@param y FP2 instance to be copied
+ */
+extern void FP2_copy(FP2 *x, FP2 *y);
+/**	@brief Set FP2 to zero
+ *
+	@param x FP2 instance to be set to zero
+ */
+extern void FP2_zero(FP2 *x);
+/**	@brief Set FP2 to unity
+ *
+	@param x FP2 instance to be set to one
+ */
+extern void FP2_one(FP2 *x);
+
+/**	@brief Copy from ROM to an FP2
+ *
+	@param w FP2 number to be copied to
+	@param a BIG real part to be copied from ROM
+	@param b BIG imag part to be copied from ROM
+ */
+extern void FP2_rcopy(FP2 *w,const B160_56::BIG a,const B160_56::BIG b);
+
+/**	@brief Sign of FP2
+ *
+	@param x FP2 instance
+	@return "sign" of FP2
+ */
+extern int FP2_sign(FP2 *x);
+
+/**	@brief Negation of FP2
+ *
+	@param x FP2 instance, on exit = -y
+	@param y FP2 instance
+ */
+extern void FP2_neg(FP2 *x, FP2 *y);
+
+
+/**	@brief Conjugation of FP2
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP2 instance, on exit = conj(y)
+	@param y FP2 instance
+ */
+extern void FP2_conj(FP2 *x, FP2 *y);
+/**	@brief addition of two FP2s
+ *
+	@param x FP2 instance, on exit = y+z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_add(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief subtraction of two FP2s
+ *
+	@param x FP2 instance, on exit = y-z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_sub(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Multiplication of an FP2 by an FP
+ *
+	@param x FP2 instance, on exit = y*b
+	@param y FP2 instance
+	@param b FP residue
+ */
+extern void FP2_pmul(FP2 *x, FP2 *y, FP *b);
+/**	@brief Multiplication of an FP2 by a small integer
+ *
+	@param x FP2 instance, on exit = y*i
+	@param y FP2 instance
+	@param i an integer
+ */
+extern void FP2_imul(FP2 *x, FP2 *y, int i);
+/**	@brief Squaring an FP2
+ *
+	@param x FP2 instance, on exit = y^2
+	@param y FP2 instance
+ */
+extern void FP2_sqr(FP2 *x, FP2 *y);
+/**	@brief Multiplication of two FP2s
+ *
+	@param x FP2 instance, on exit = y*z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_mul(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Formats and outputs an FP2 to the console
+ *
+	@param x FP2 instance
+ */
+extern void FP2_output(FP2 *x);
+/**	@brief Formats and outputs an FP2 to the console in raw form (for debugging)
+ *
+	@param x FP2 instance
+ */
+extern void FP2_rawoutput(FP2 *x);
+/**	@brief Inverting an FP2
+ *
+	@param x FP2 instance, on exit = 1/y
+	@param y FP2 instance
+ */
+extern void FP2_inv(FP2 *x, FP2 *y, FP *h);
+/**	@brief Divide an FP2 by 2
+ *
+	@param x FP2 instance, on exit = y/2
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_div2(FP2 *x, FP2 *y);
+/**	@brief Multiply an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x*(1+sqrt(-1))
+ */
+extern void FP2_mul_ip(FP2 *x);
+
+/**	@brief Divide an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x/(1+sqrt(-1))
+ */
+extern void FP2_div_ip(FP2 *x);
+/**	@brief Normalises the components of an FP2
+ *
+	@param x FP2 instance to be normalised
+ */
+extern void FP2_norm(FP2 *x);
+/**	@brief Reduces all components of possibly unreduced FP2 mod Modulus
+ *
+	@param x FP2 instance, on exit reduced mod Modulus
+ */
+extern void FP2_reduce(FP2 *x);
+/**	@brief Raises an FP2 to the power of a BIG
+ *
+	@param x FP2 instance, on exit = y^b
+	@param y FP2 instance
+	@param b BIG number
+ */
+extern void FP2_pow(FP2 *x, FP2 *y, B160_56::BIG b);
+
+/**	@brief Test FP2 for QR
+ *
+	@param x FP2 instance
+    @param h optional generated hint
+	@return true or false
+ */
+extern int FP2_qr(FP2 *x,FP *h);
+
+
+/**	@brief Square root of an FP2
+ *
+	@param x FP2 instance, on exit = sqrt(y)
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_sqrt(FP2 *x, FP2 *y, FP *h);
+
+/**	@brief Multiply an FP2 by sqrt(-1)
+ *
+	Note that -1 is QNR
+	@param x FP2 instance, on exit = x*sqrt(-1)
+ */
+extern void FP2_times_i(FP2 *x);
+
+/**	@brief Generate random FP2
+ *
+	@param x random FP2 number
+	@param rng random number generator
+ */
+extern void FP2_rand(FP2 *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp2_BN254.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp2_BN254.h
new file mode 100644
index 0000000..2e2f476
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp2_BN254.h
@@ -0,0 +1,306 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP2_BN254_H
+#define FP2_BN254_H
+
+#include "fp_BN254.h"
+
+using namespace core;
+
+namespace BN254 {
+
+/**
+	@brief FP2 Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    FP a; /**< real part of FP2 */
+    FP b; /**< imaginary part of FP2 */
+} FP2;
+
+/* FP2 prototypes */
+
+/**	@brief Tests for FP2 equal to zero
+ *
+	@param x FP2 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP2_iszilch(FP2 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP2 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP2_islarger(FP2 *x);
+
+
+/**	@brief Serialize out FP2  
+ *
+    @param b buffer for output
+	@param x FP2 number to be serialized
+ */
+extern void FP2_toBytes(char *b,FP2 *x);
+
+/**	@brief Serialize in FP2  
+ *
+	@param x FP2 number to be serialized
+    @param b buffer for input
+ */
+extern void FP2_fromBytes(FP2 *x,char *b);
+
+/**	@brief Conditional copy of FP2 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP2 instance, set to y if s!=0
+	@param y another FP2 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP2_cmove(FP2 *x, FP2 *y, int s);
+/**	@brief Tests for FP2 equal to one
+ *
+	@param x FP2 instance to be tested
+	@return 1 if x=1, else returns 0
+ */
+extern int FP2_isunity(FP2 *x);
+/**	@brief Tests for equality of two FP2s
+ *
+	@param x FP2 instance to be compared
+	@param y FP2 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP2_equals(FP2 *x, FP2 *y);
+/**	@brief Initialise FP2 from two FP numbers
+ *
+	@param x FP2 instance to be initialised
+	@param a FP to form real part of FP2
+	@param b FP to form imaginary part of FP2
+ */
+extern void FP2_from_FPs(FP2 *x, FP *a, FP *b);
+/**	@brief Initialise FP2 from two BIG integers
+ *
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+	@param b BIG to form imaginary part of FP2
+ */
+extern void FP2_from_BIGs(FP2 *x, B256_56::BIG a, B256_56::BIG b);
+
+
+/**	@brief Initialise FP2 from two integers
+ *
+	@param x FP2 instance to be initialised
+	@param a int to form real part of FP2
+	@param b int to form imaginary part of FP2
+ */
+extern void FP2_from_ints(FP2 *x, int a, int b);
+
+
+
+/**	@brief Initialise FP2 from single FP
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param an FP to form real part of FP2
+ */
+extern void FP2_from_FP(FP2 *x, FP *a);
+/**	@brief Initialise FP2 from single BIG
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+ */
+extern void FP2_from_BIG(FP2 *x, B256_56::BIG a);
+/**	@brief Copy FP2 to another FP2
+ *
+	@param x FP2 instance, on exit = y
+	@param y FP2 instance to be copied
+ */
+extern void FP2_copy(FP2 *x, FP2 *y);
+/**	@brief Set FP2 to zero
+ *
+	@param x FP2 instance to be set to zero
+ */
+extern void FP2_zero(FP2 *x);
+/**	@brief Set FP2 to unity
+ *
+	@param x FP2 instance to be set to one
+ */
+extern void FP2_one(FP2 *x);
+
+/**	@brief Copy from ROM to an FP2
+ *
+	@param w FP2 number to be copied to
+	@param a BIG real part to be copied from ROM
+	@param b BIG imag part to be copied from ROM
+ */
+extern void FP2_rcopy(FP2 *w,const B256_56::BIG a,const B256_56::BIG b);
+
+/**	@brief Sign of FP2
+ *
+	@param x FP2 instance
+	@return "sign" of FP2
+ */
+extern int FP2_sign(FP2 *x);
+
+/**	@brief Negation of FP2
+ *
+	@param x FP2 instance, on exit = -y
+	@param y FP2 instance
+ */
+extern void FP2_neg(FP2 *x, FP2 *y);
+
+
+/**	@brief Conjugation of FP2
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP2 instance, on exit = conj(y)
+	@param y FP2 instance
+ */
+extern void FP2_conj(FP2 *x, FP2 *y);
+/**	@brief addition of two FP2s
+ *
+	@param x FP2 instance, on exit = y+z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_add(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief subtraction of two FP2s
+ *
+	@param x FP2 instance, on exit = y-z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_sub(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Multiplication of an FP2 by an FP
+ *
+	@param x FP2 instance, on exit = y*b
+	@param y FP2 instance
+	@param b FP residue
+ */
+extern void FP2_pmul(FP2 *x, FP2 *y, FP *b);
+/**	@brief Multiplication of an FP2 by a small integer
+ *
+	@param x FP2 instance, on exit = y*i
+	@param y FP2 instance
+	@param i an integer
+ */
+extern void FP2_imul(FP2 *x, FP2 *y, int i);
+/**	@brief Squaring an FP2
+ *
+	@param x FP2 instance, on exit = y^2
+	@param y FP2 instance
+ */
+extern void FP2_sqr(FP2 *x, FP2 *y);
+/**	@brief Multiplication of two FP2s
+ *
+	@param x FP2 instance, on exit = y*z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_mul(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Formats and outputs an FP2 to the console
+ *
+	@param x FP2 instance
+ */
+extern void FP2_output(FP2 *x);
+/**	@brief Formats and outputs an FP2 to the console in raw form (for debugging)
+ *
+	@param x FP2 instance
+ */
+extern void FP2_rawoutput(FP2 *x);
+/**	@brief Inverting an FP2
+ *
+	@param x FP2 instance, on exit = 1/y
+	@param y FP2 instance
+ */
+extern void FP2_inv(FP2 *x, FP2 *y, FP *h);
+/**	@brief Divide an FP2 by 2
+ *
+	@param x FP2 instance, on exit = y/2
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_div2(FP2 *x, FP2 *y);
+/**	@brief Multiply an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x*(1+sqrt(-1))
+ */
+extern void FP2_mul_ip(FP2 *x);
+
+/**	@brief Divide an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x/(1+sqrt(-1))
+ */
+extern void FP2_div_ip(FP2 *x);
+/**	@brief Normalises the components of an FP2
+ *
+	@param x FP2 instance to be normalised
+ */
+extern void FP2_norm(FP2 *x);
+/**	@brief Reduces all components of possibly unreduced FP2 mod Modulus
+ *
+	@param x FP2 instance, on exit reduced mod Modulus
+ */
+extern void FP2_reduce(FP2 *x);
+/**	@brief Raises an FP2 to the power of a BIG
+ *
+	@param x FP2 instance, on exit = y^b
+	@param y FP2 instance
+	@param b BIG number
+ */
+extern void FP2_pow(FP2 *x, FP2 *y, B256_56::BIG b);
+
+/**	@brief Test FP2 for QR
+ *
+	@param x FP2 instance
+    @param h optional generated hint
+	@return true or false
+ */
+extern int FP2_qr(FP2 *x,FP *h);
+
+
+/**	@brief Square root of an FP2
+ *
+	@param x FP2 instance, on exit = sqrt(y)
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_sqrt(FP2 *x, FP2 *y, FP *h);
+
+/**	@brief Multiply an FP2 by sqrt(-1)
+ *
+	Note that -1 is QNR
+	@param x FP2 instance, on exit = x*sqrt(-1)
+ */
+extern void FP2_times_i(FP2 *x);
+
+/**	@brief Generate random FP2
+ *
+	@param x random FP2 number
+	@param rng random number generator
+ */
+extern void FP2_rand(FP2 *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp2_BN254CX.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp2_BN254CX.h
new file mode 100644
index 0000000..e3b65b2
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp2_BN254CX.h
@@ -0,0 +1,306 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP2_BN254CX_H
+#define FP2_BN254CX_H
+
+#include "fp_BN254CX.h"
+
+using namespace core;
+
+namespace BN254CX {
+
+/**
+	@brief FP2 Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    FP a; /**< real part of FP2 */
+    FP b; /**< imaginary part of FP2 */
+} FP2;
+
+/* FP2 prototypes */
+
+/**	@brief Tests for FP2 equal to zero
+ *
+	@param x FP2 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP2_iszilch(FP2 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP2 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP2_islarger(FP2 *x);
+
+
+/**	@brief Serialize out FP2  
+ *
+    @param b buffer for output
+	@param x FP2 number to be serialized
+ */
+extern void FP2_toBytes(char *b,FP2 *x);
+
+/**	@brief Serialize in FP2  
+ *
+	@param x FP2 number to be serialized
+    @param b buffer for input
+ */
+extern void FP2_fromBytes(FP2 *x,char *b);
+
+/**	@brief Conditional copy of FP2 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP2 instance, set to y if s!=0
+	@param y another FP2 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP2_cmove(FP2 *x, FP2 *y, int s);
+/**	@brief Tests for FP2 equal to one
+ *
+	@param x FP2 instance to be tested
+	@return 1 if x=1, else returns 0
+ */
+extern int FP2_isunity(FP2 *x);
+/**	@brief Tests for equality of two FP2s
+ *
+	@param x FP2 instance to be compared
+	@param y FP2 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP2_equals(FP2 *x, FP2 *y);
+/**	@brief Initialise FP2 from two FP numbers
+ *
+	@param x FP2 instance to be initialised
+	@param a FP to form real part of FP2
+	@param b FP to form imaginary part of FP2
+ */
+extern void FP2_from_FPs(FP2 *x, FP *a, FP *b);
+/**	@brief Initialise FP2 from two BIG integers
+ *
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+	@param b BIG to form imaginary part of FP2
+ */
+extern void FP2_from_BIGs(FP2 *x, B256_56::BIG a, B256_56::BIG b);
+
+
+/**	@brief Initialise FP2 from two integers
+ *
+	@param x FP2 instance to be initialised
+	@param a int to form real part of FP2
+	@param b int to form imaginary part of FP2
+ */
+extern void FP2_from_ints(FP2 *x, int a, int b);
+
+
+
+/**	@brief Initialise FP2 from single FP
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param an FP to form real part of FP2
+ */
+extern void FP2_from_FP(FP2 *x, FP *a);
+/**	@brief Initialise FP2 from single BIG
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+ */
+extern void FP2_from_BIG(FP2 *x, B256_56::BIG a);
+/**	@brief Copy FP2 to another FP2
+ *
+	@param x FP2 instance, on exit = y
+	@param y FP2 instance to be copied
+ */
+extern void FP2_copy(FP2 *x, FP2 *y);
+/**	@brief Set FP2 to zero
+ *
+	@param x FP2 instance to be set to zero
+ */
+extern void FP2_zero(FP2 *x);
+/**	@brief Set FP2 to unity
+ *
+	@param x FP2 instance to be set to one
+ */
+extern void FP2_one(FP2 *x);
+
+/**	@brief Copy from ROM to an FP2
+ *
+	@param w FP2 number to be copied to
+	@param a BIG real part to be copied from ROM
+	@param b BIG imag part to be copied from ROM
+ */
+extern void FP2_rcopy(FP2 *w,const B256_56::BIG a,const B256_56::BIG b);
+
+/**	@brief Sign of FP2
+ *
+	@param x FP2 instance
+	@return "sign" of FP2
+ */
+extern int FP2_sign(FP2 *x);
+
+/**	@brief Negation of FP2
+ *
+	@param x FP2 instance, on exit = -y
+	@param y FP2 instance
+ */
+extern void FP2_neg(FP2 *x, FP2 *y);
+
+
+/**	@brief Conjugation of FP2
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP2 instance, on exit = conj(y)
+	@param y FP2 instance
+ */
+extern void FP2_conj(FP2 *x, FP2 *y);
+/**	@brief addition of two FP2s
+ *
+	@param x FP2 instance, on exit = y+z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_add(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief subtraction of two FP2s
+ *
+	@param x FP2 instance, on exit = y-z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_sub(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Multiplication of an FP2 by an FP
+ *
+	@param x FP2 instance, on exit = y*b
+	@param y FP2 instance
+	@param b FP residue
+ */
+extern void FP2_pmul(FP2 *x, FP2 *y, FP *b);
+/**	@brief Multiplication of an FP2 by a small integer
+ *
+	@param x FP2 instance, on exit = y*i
+	@param y FP2 instance
+	@param i an integer
+ */
+extern void FP2_imul(FP2 *x, FP2 *y, int i);
+/**	@brief Squaring an FP2
+ *
+	@param x FP2 instance, on exit = y^2
+	@param y FP2 instance
+ */
+extern void FP2_sqr(FP2 *x, FP2 *y);
+/**	@brief Multiplication of two FP2s
+ *
+	@param x FP2 instance, on exit = y*z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_mul(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Formats and outputs an FP2 to the console
+ *
+	@param x FP2 instance
+ */
+extern void FP2_output(FP2 *x);
+/**	@brief Formats and outputs an FP2 to the console in raw form (for debugging)
+ *
+	@param x FP2 instance
+ */
+extern void FP2_rawoutput(FP2 *x);
+/**	@brief Inverting an FP2
+ *
+	@param x FP2 instance, on exit = 1/y
+	@param y FP2 instance
+ */
+extern void FP2_inv(FP2 *x, FP2 *y, FP *h);
+/**	@brief Divide an FP2 by 2
+ *
+	@param x FP2 instance, on exit = y/2
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_div2(FP2 *x, FP2 *y);
+/**	@brief Multiply an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x*(1+sqrt(-1))
+ */
+extern void FP2_mul_ip(FP2 *x);
+
+/**	@brief Divide an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x/(1+sqrt(-1))
+ */
+extern void FP2_div_ip(FP2 *x);
+/**	@brief Normalises the components of an FP2
+ *
+	@param x FP2 instance to be normalised
+ */
+extern void FP2_norm(FP2 *x);
+/**	@brief Reduces all components of possibly unreduced FP2 mod Modulus
+ *
+	@param x FP2 instance, on exit reduced mod Modulus
+ */
+extern void FP2_reduce(FP2 *x);
+/**	@brief Raises an FP2 to the power of a BIG
+ *
+	@param x FP2 instance, on exit = y^b
+	@param y FP2 instance
+	@param b BIG number
+ */
+extern void FP2_pow(FP2 *x, FP2 *y, B256_56::BIG b);
+
+/**	@brief Test FP2 for QR
+ *
+	@param x FP2 instance
+    @param h optional generated hint
+	@return true or false
+ */
+extern int FP2_qr(FP2 *x,FP *h);
+
+
+/**	@brief Square root of an FP2
+ *
+	@param x FP2 instance, on exit = sqrt(y)
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_sqrt(FP2 *x, FP2 *y, FP *h);
+
+/**	@brief Multiply an FP2 by sqrt(-1)
+ *
+	Note that -1 is QNR
+	@param x FP2 instance, on exit = x*sqrt(-1)
+ */
+extern void FP2_times_i(FP2 *x);
+
+/**	@brief Generate random FP2
+ *
+	@param x random FP2 number
+	@param rng random number generator
+ */
+extern void FP2_rand(FP2 *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp2_BN462.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp2_BN462.h
new file mode 100644
index 0000000..eb096e0
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp2_BN462.h
@@ -0,0 +1,306 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP2_BN462_H
+#define FP2_BN462_H
+
+#include "fp_BN462.h"
+
+using namespace core;
+
+namespace BN462 {
+
+/**
+	@brief FP2 Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    FP a; /**< real part of FP2 */
+    FP b; /**< imaginary part of FP2 */
+} FP2;
+
+/* FP2 prototypes */
+
+/**	@brief Tests for FP2 equal to zero
+ *
+	@param x FP2 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP2_iszilch(FP2 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP2 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP2_islarger(FP2 *x);
+
+
+/**	@brief Serialize out FP2  
+ *
+    @param b buffer for output
+	@param x FP2 number to be serialized
+ */
+extern void FP2_toBytes(char *b,FP2 *x);
+
+/**	@brief Serialize in FP2  
+ *
+	@param x FP2 number to be serialized
+    @param b buffer for input
+ */
+extern void FP2_fromBytes(FP2 *x,char *b);
+
+/**	@brief Conditional copy of FP2 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP2 instance, set to y if s!=0
+	@param y another FP2 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP2_cmove(FP2 *x, FP2 *y, int s);
+/**	@brief Tests for FP2 equal to one
+ *
+	@param x FP2 instance to be tested
+	@return 1 if x=1, else returns 0
+ */
+extern int FP2_isunity(FP2 *x);
+/**	@brief Tests for equality of two FP2s
+ *
+	@param x FP2 instance to be compared
+	@param y FP2 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP2_equals(FP2 *x, FP2 *y);
+/**	@brief Initialise FP2 from two FP numbers
+ *
+	@param x FP2 instance to be initialised
+	@param a FP to form real part of FP2
+	@param b FP to form imaginary part of FP2
+ */
+extern void FP2_from_FPs(FP2 *x, FP *a, FP *b);
+/**	@brief Initialise FP2 from two BIG integers
+ *
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+	@param b BIG to form imaginary part of FP2
+ */
+extern void FP2_from_BIGs(FP2 *x, B464_60::BIG a, B464_60::BIG b);
+
+
+/**	@brief Initialise FP2 from two integers
+ *
+	@param x FP2 instance to be initialised
+	@param a int to form real part of FP2
+	@param b int to form imaginary part of FP2
+ */
+extern void FP2_from_ints(FP2 *x, int a, int b);
+
+
+
+/**	@brief Initialise FP2 from single FP
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param an FP to form real part of FP2
+ */
+extern void FP2_from_FP(FP2 *x, FP *a);
+/**	@brief Initialise FP2 from single BIG
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+ */
+extern void FP2_from_BIG(FP2 *x, B464_60::BIG a);
+/**	@brief Copy FP2 to another FP2
+ *
+	@param x FP2 instance, on exit = y
+	@param y FP2 instance to be copied
+ */
+extern void FP2_copy(FP2 *x, FP2 *y);
+/**	@brief Set FP2 to zero
+ *
+	@param x FP2 instance to be set to zero
+ */
+extern void FP2_zero(FP2 *x);
+/**	@brief Set FP2 to unity
+ *
+	@param x FP2 instance to be set to one
+ */
+extern void FP2_one(FP2 *x);
+
+/**	@brief Copy from ROM to an FP2
+ *
+	@param w FP2 number to be copied to
+	@param a BIG real part to be copied from ROM
+	@param b BIG imag part to be copied from ROM
+ */
+extern void FP2_rcopy(FP2 *w,const B464_60::BIG a,const B464_60::BIG b);
+
+/**	@brief Sign of FP2
+ *
+	@param x FP2 instance
+	@return "sign" of FP2
+ */
+extern int FP2_sign(FP2 *x);
+
+/**	@brief Negation of FP2
+ *
+	@param x FP2 instance, on exit = -y
+	@param y FP2 instance
+ */
+extern void FP2_neg(FP2 *x, FP2 *y);
+
+
+/**	@brief Conjugation of FP2
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP2 instance, on exit = conj(y)
+	@param y FP2 instance
+ */
+extern void FP2_conj(FP2 *x, FP2 *y);
+/**	@brief addition of two FP2s
+ *
+	@param x FP2 instance, on exit = y+z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_add(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief subtraction of two FP2s
+ *
+	@param x FP2 instance, on exit = y-z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_sub(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Multiplication of an FP2 by an FP
+ *
+	@param x FP2 instance, on exit = y*b
+	@param y FP2 instance
+	@param b FP residue
+ */
+extern void FP2_pmul(FP2 *x, FP2 *y, FP *b);
+/**	@brief Multiplication of an FP2 by a small integer
+ *
+	@param x FP2 instance, on exit = y*i
+	@param y FP2 instance
+	@param i an integer
+ */
+extern void FP2_imul(FP2 *x, FP2 *y, int i);
+/**	@brief Squaring an FP2
+ *
+	@param x FP2 instance, on exit = y^2
+	@param y FP2 instance
+ */
+extern void FP2_sqr(FP2 *x, FP2 *y);
+/**	@brief Multiplication of two FP2s
+ *
+	@param x FP2 instance, on exit = y*z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_mul(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Formats and outputs an FP2 to the console
+ *
+	@param x FP2 instance
+ */
+extern void FP2_output(FP2 *x);
+/**	@brief Formats and outputs an FP2 to the console in raw form (for debugging)
+ *
+	@param x FP2 instance
+ */
+extern void FP2_rawoutput(FP2 *x);
+/**	@brief Inverting an FP2
+ *
+	@param x FP2 instance, on exit = 1/y
+	@param y FP2 instance
+ */
+extern void FP2_inv(FP2 *x, FP2 *y, FP *h);
+/**	@brief Divide an FP2 by 2
+ *
+	@param x FP2 instance, on exit = y/2
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_div2(FP2 *x, FP2 *y);
+/**	@brief Multiply an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x*(1+sqrt(-1))
+ */
+extern void FP2_mul_ip(FP2 *x);
+
+/**	@brief Divide an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x/(1+sqrt(-1))
+ */
+extern void FP2_div_ip(FP2 *x);
+/**	@brief Normalises the components of an FP2
+ *
+	@param x FP2 instance to be normalised
+ */
+extern void FP2_norm(FP2 *x);
+/**	@brief Reduces all components of possibly unreduced FP2 mod Modulus
+ *
+	@param x FP2 instance, on exit reduced mod Modulus
+ */
+extern void FP2_reduce(FP2 *x);
+/**	@brief Raises an FP2 to the power of a BIG
+ *
+	@param x FP2 instance, on exit = y^b
+	@param y FP2 instance
+	@param b BIG number
+ */
+extern void FP2_pow(FP2 *x, FP2 *y, B464_60::BIG b);
+
+/**	@brief Test FP2 for QR
+ *
+	@param x FP2 instance
+    @param h optional generated hint
+	@return true or false
+ */
+extern int FP2_qr(FP2 *x,FP *h);
+
+
+/**	@brief Square root of an FP2
+ *
+	@param x FP2 instance, on exit = sqrt(y)
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_sqrt(FP2 *x, FP2 *y, FP *h);
+
+/**	@brief Multiply an FP2 by sqrt(-1)
+ *
+	Note that -1 is QNR
+	@param x FP2 instance, on exit = x*sqrt(-1)
+ */
+extern void FP2_times_i(FP2 *x);
+
+/**	@brief Generate random FP2
+ *
+	@param x random FP2 number
+	@param rng random number generator
+ */
+extern void FP2_rand(FP2 *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp2_FP256BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp2_FP256BN.h
new file mode 100644
index 0000000..9b6d01f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp2_FP256BN.h
@@ -0,0 +1,306 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP2_FP256BN_H
+#define FP2_FP256BN_H
+
+#include "fp_FP256BN.h"
+
+using namespace core;
+
+namespace FP256BN {
+
+/**
+	@brief FP2 Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    FP a; /**< real part of FP2 */
+    FP b; /**< imaginary part of FP2 */
+} FP2;
+
+/* FP2 prototypes */
+
+/**	@brief Tests for FP2 equal to zero
+ *
+	@param x FP2 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP2_iszilch(FP2 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP2 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP2_islarger(FP2 *x);
+
+
+/**	@brief Serialize out FP2  
+ *
+    @param b buffer for output
+	@param x FP2 number to be serialized
+ */
+extern void FP2_toBytes(char *b,FP2 *x);
+
+/**	@brief Serialize in FP2  
+ *
+	@param x FP2 number to be serialized
+    @param b buffer for input
+ */
+extern void FP2_fromBytes(FP2 *x,char *b);
+
+/**	@brief Conditional copy of FP2 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP2 instance, set to y if s!=0
+	@param y another FP2 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP2_cmove(FP2 *x, FP2 *y, int s);
+/**	@brief Tests for FP2 equal to one
+ *
+	@param x FP2 instance to be tested
+	@return 1 if x=1, else returns 0
+ */
+extern int FP2_isunity(FP2 *x);
+/**	@brief Tests for equality of two FP2s
+ *
+	@param x FP2 instance to be compared
+	@param y FP2 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP2_equals(FP2 *x, FP2 *y);
+/**	@brief Initialise FP2 from two FP numbers
+ *
+	@param x FP2 instance to be initialised
+	@param a FP to form real part of FP2
+	@param b FP to form imaginary part of FP2
+ */
+extern void FP2_from_FPs(FP2 *x, FP *a, FP *b);
+/**	@brief Initialise FP2 from two BIG integers
+ *
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+	@param b BIG to form imaginary part of FP2
+ */
+extern void FP2_from_BIGs(FP2 *x, B256_56::BIG a, B256_56::BIG b);
+
+
+/**	@brief Initialise FP2 from two integers
+ *
+	@param x FP2 instance to be initialised
+	@param a int to form real part of FP2
+	@param b int to form imaginary part of FP2
+ */
+extern void FP2_from_ints(FP2 *x, int a, int b);
+
+
+
+/**	@brief Initialise FP2 from single FP
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param an FP to form real part of FP2
+ */
+extern void FP2_from_FP(FP2 *x, FP *a);
+/**	@brief Initialise FP2 from single BIG
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+ */
+extern void FP2_from_BIG(FP2 *x, B256_56::BIG a);
+/**	@brief Copy FP2 to another FP2
+ *
+	@param x FP2 instance, on exit = y
+	@param y FP2 instance to be copied
+ */
+extern void FP2_copy(FP2 *x, FP2 *y);
+/**	@brief Set FP2 to zero
+ *
+	@param x FP2 instance to be set to zero
+ */
+extern void FP2_zero(FP2 *x);
+/**	@brief Set FP2 to unity
+ *
+	@param x FP2 instance to be set to one
+ */
+extern void FP2_one(FP2 *x);
+
+/**	@brief Copy from ROM to an FP2
+ *
+	@param w FP2 number to be copied to
+	@param a BIG real part to be copied from ROM
+	@param b BIG imag part to be copied from ROM
+ */
+extern void FP2_rcopy(FP2 *w,const B256_56::BIG a,const B256_56::BIG b);
+
+/**	@brief Sign of FP2
+ *
+	@param x FP2 instance
+	@return "sign" of FP2
+ */
+extern int FP2_sign(FP2 *x);
+
+/**	@brief Negation of FP2
+ *
+	@param x FP2 instance, on exit = -y
+	@param y FP2 instance
+ */
+extern void FP2_neg(FP2 *x, FP2 *y);
+
+
+/**	@brief Conjugation of FP2
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP2 instance, on exit = conj(y)
+	@param y FP2 instance
+ */
+extern void FP2_conj(FP2 *x, FP2 *y);
+/**	@brief addition of two FP2s
+ *
+	@param x FP2 instance, on exit = y+z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_add(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief subtraction of two FP2s
+ *
+	@param x FP2 instance, on exit = y-z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_sub(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Multiplication of an FP2 by an FP
+ *
+	@param x FP2 instance, on exit = y*b
+	@param y FP2 instance
+	@param b FP residue
+ */
+extern void FP2_pmul(FP2 *x, FP2 *y, FP *b);
+/**	@brief Multiplication of an FP2 by a small integer
+ *
+	@param x FP2 instance, on exit = y*i
+	@param y FP2 instance
+	@param i an integer
+ */
+extern void FP2_imul(FP2 *x, FP2 *y, int i);
+/**	@brief Squaring an FP2
+ *
+	@param x FP2 instance, on exit = y^2
+	@param y FP2 instance
+ */
+extern void FP2_sqr(FP2 *x, FP2 *y);
+/**	@brief Multiplication of two FP2s
+ *
+	@param x FP2 instance, on exit = y*z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_mul(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Formats and outputs an FP2 to the console
+ *
+	@param x FP2 instance
+ */
+extern void FP2_output(FP2 *x);
+/**	@brief Formats and outputs an FP2 to the console in raw form (for debugging)
+ *
+	@param x FP2 instance
+ */
+extern void FP2_rawoutput(FP2 *x);
+/**	@brief Inverting an FP2
+ *
+	@param x FP2 instance, on exit = 1/y
+	@param y FP2 instance
+ */
+extern void FP2_inv(FP2 *x, FP2 *y, FP *h);
+/**	@brief Divide an FP2 by 2
+ *
+	@param x FP2 instance, on exit = y/2
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_div2(FP2 *x, FP2 *y);
+/**	@brief Multiply an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x*(1+sqrt(-1))
+ */
+extern void FP2_mul_ip(FP2 *x);
+
+/**	@brief Divide an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x/(1+sqrt(-1))
+ */
+extern void FP2_div_ip(FP2 *x);
+/**	@brief Normalises the components of an FP2
+ *
+	@param x FP2 instance to be normalised
+ */
+extern void FP2_norm(FP2 *x);
+/**	@brief Reduces all components of possibly unreduced FP2 mod Modulus
+ *
+	@param x FP2 instance, on exit reduced mod Modulus
+ */
+extern void FP2_reduce(FP2 *x);
+/**	@brief Raises an FP2 to the power of a BIG
+ *
+	@param x FP2 instance, on exit = y^b
+	@param y FP2 instance
+	@param b BIG number
+ */
+extern void FP2_pow(FP2 *x, FP2 *y, B256_56::BIG b);
+
+/**	@brief Test FP2 for QR
+ *
+	@param x FP2 instance
+    @param h optional generated hint
+	@return true or false
+ */
+extern int FP2_qr(FP2 *x,FP *h);
+
+
+/**	@brief Square root of an FP2
+ *
+	@param x FP2 instance, on exit = sqrt(y)
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_sqrt(FP2 *x, FP2 *y, FP *h);
+
+/**	@brief Multiply an FP2 by sqrt(-1)
+ *
+	Note that -1 is QNR
+	@param x FP2 instance, on exit = x*sqrt(-1)
+ */
+extern void FP2_times_i(FP2 *x);
+
+/**	@brief Generate random FP2
+ *
+	@param x random FP2 number
+	@param rng random number generator
+ */
+extern void FP2_rand(FP2 *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp2_FP512BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp2_FP512BN.h
new file mode 100644
index 0000000..f7dc57d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp2_FP512BN.h
@@ -0,0 +1,306 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP2_FP512BN_H
+#define FP2_FP512BN_H
+
+#include "fp_FP512BN.h"
+
+using namespace core;
+
+namespace FP512BN {
+
+/**
+	@brief FP2 Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    FP a; /**< real part of FP2 */
+    FP b; /**< imaginary part of FP2 */
+} FP2;
+
+/* FP2 prototypes */
+
+/**	@brief Tests for FP2 equal to zero
+ *
+	@param x FP2 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP2_iszilch(FP2 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP2 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP2_islarger(FP2 *x);
+
+
+/**	@brief Serialize out FP2  
+ *
+    @param b buffer for output
+	@param x FP2 number to be serialized
+ */
+extern void FP2_toBytes(char *b,FP2 *x);
+
+/**	@brief Serialize in FP2  
+ *
+	@param x FP2 number to be serialized
+    @param b buffer for input
+ */
+extern void FP2_fromBytes(FP2 *x,char *b);
+
+/**	@brief Conditional copy of FP2 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP2 instance, set to y if s!=0
+	@param y another FP2 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP2_cmove(FP2 *x, FP2 *y, int s);
+/**	@brief Tests for FP2 equal to one
+ *
+	@param x FP2 instance to be tested
+	@return 1 if x=1, else returns 0
+ */
+extern int FP2_isunity(FP2 *x);
+/**	@brief Tests for equality of two FP2s
+ *
+	@param x FP2 instance to be compared
+	@param y FP2 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP2_equals(FP2 *x, FP2 *y);
+/**	@brief Initialise FP2 from two FP numbers
+ *
+	@param x FP2 instance to be initialised
+	@param a FP to form real part of FP2
+	@param b FP to form imaginary part of FP2
+ */
+extern void FP2_from_FPs(FP2 *x, FP *a, FP *b);
+/**	@brief Initialise FP2 from two BIG integers
+ *
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+	@param b BIG to form imaginary part of FP2
+ */
+extern void FP2_from_BIGs(FP2 *x, B512_60::BIG a, B512_60::BIG b);
+
+
+/**	@brief Initialise FP2 from two integers
+ *
+	@param x FP2 instance to be initialised
+	@param a int to form real part of FP2
+	@param b int to form imaginary part of FP2
+ */
+extern void FP2_from_ints(FP2 *x, int a, int b);
+
+
+
+/**	@brief Initialise FP2 from single FP
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param an FP to form real part of FP2
+ */
+extern void FP2_from_FP(FP2 *x, FP *a);
+/**	@brief Initialise FP2 from single BIG
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+ */
+extern void FP2_from_BIG(FP2 *x, B512_60::BIG a);
+/**	@brief Copy FP2 to another FP2
+ *
+	@param x FP2 instance, on exit = y
+	@param y FP2 instance to be copied
+ */
+extern void FP2_copy(FP2 *x, FP2 *y);
+/**	@brief Set FP2 to zero
+ *
+	@param x FP2 instance to be set to zero
+ */
+extern void FP2_zero(FP2 *x);
+/**	@brief Set FP2 to unity
+ *
+	@param x FP2 instance to be set to one
+ */
+extern void FP2_one(FP2 *x);
+
+/**	@brief Copy from ROM to an FP2
+ *
+	@param w FP2 number to be copied to
+	@param a BIG real part to be copied from ROM
+	@param b BIG imag part to be copied from ROM
+ */
+extern void FP2_rcopy(FP2 *w,const B512_60::BIG a,const B512_60::BIG b);
+
+/**	@brief Sign of FP2
+ *
+	@param x FP2 instance
+	@return "sign" of FP2
+ */
+extern int FP2_sign(FP2 *x);
+
+/**	@brief Negation of FP2
+ *
+	@param x FP2 instance, on exit = -y
+	@param y FP2 instance
+ */
+extern void FP2_neg(FP2 *x, FP2 *y);
+
+
+/**	@brief Conjugation of FP2
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP2 instance, on exit = conj(y)
+	@param y FP2 instance
+ */
+extern void FP2_conj(FP2 *x, FP2 *y);
+/**	@brief addition of two FP2s
+ *
+	@param x FP2 instance, on exit = y+z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_add(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief subtraction of two FP2s
+ *
+	@param x FP2 instance, on exit = y-z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_sub(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Multiplication of an FP2 by an FP
+ *
+	@param x FP2 instance, on exit = y*b
+	@param y FP2 instance
+	@param b FP residue
+ */
+extern void FP2_pmul(FP2 *x, FP2 *y, FP *b);
+/**	@brief Multiplication of an FP2 by a small integer
+ *
+	@param x FP2 instance, on exit = y*i
+	@param y FP2 instance
+	@param i an integer
+ */
+extern void FP2_imul(FP2 *x, FP2 *y, int i);
+/**	@brief Squaring an FP2
+ *
+	@param x FP2 instance, on exit = y^2
+	@param y FP2 instance
+ */
+extern void FP2_sqr(FP2 *x, FP2 *y);
+/**	@brief Multiplication of two FP2s
+ *
+	@param x FP2 instance, on exit = y*z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_mul(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Formats and outputs an FP2 to the console
+ *
+	@param x FP2 instance
+ */
+extern void FP2_output(FP2 *x);
+/**	@brief Formats and outputs an FP2 to the console in raw form (for debugging)
+ *
+	@param x FP2 instance
+ */
+extern void FP2_rawoutput(FP2 *x);
+/**	@brief Inverting an FP2
+ *
+	@param x FP2 instance, on exit = 1/y
+	@param y FP2 instance
+ */
+extern void FP2_inv(FP2 *x, FP2 *y, FP *h);
+/**	@brief Divide an FP2 by 2
+ *
+	@param x FP2 instance, on exit = y/2
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_div2(FP2 *x, FP2 *y);
+/**	@brief Multiply an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x*(1+sqrt(-1))
+ */
+extern void FP2_mul_ip(FP2 *x);
+
+/**	@brief Divide an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x/(1+sqrt(-1))
+ */
+extern void FP2_div_ip(FP2 *x);
+/**	@brief Normalises the components of an FP2
+ *
+	@param x FP2 instance to be normalised
+ */
+extern void FP2_norm(FP2 *x);
+/**	@brief Reduces all components of possibly unreduced FP2 mod Modulus
+ *
+	@param x FP2 instance, on exit reduced mod Modulus
+ */
+extern void FP2_reduce(FP2 *x);
+/**	@brief Raises an FP2 to the power of a BIG
+ *
+	@param x FP2 instance, on exit = y^b
+	@param y FP2 instance
+	@param b BIG number
+ */
+extern void FP2_pow(FP2 *x, FP2 *y, B512_60::BIG b);
+
+/**	@brief Test FP2 for QR
+ *
+	@param x FP2 instance
+    @param h optional generated hint
+	@return true or false
+ */
+extern int FP2_qr(FP2 *x,FP *h);
+
+
+/**	@brief Square root of an FP2
+ *
+	@param x FP2 instance, on exit = sqrt(y)
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_sqrt(FP2 *x, FP2 *y, FP *h);
+
+/**	@brief Multiply an FP2 by sqrt(-1)
+ *
+	Note that -1 is QNR
+	@param x FP2 instance, on exit = x*sqrt(-1)
+ */
+extern void FP2_times_i(FP2 *x);
+
+/**	@brief Generate random FP2
+ *
+	@param x random FP2 number
+	@param rng random number generator
+ */
+extern void FP2_rand(FP2 *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp4.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp4.cpp
new file mode 100644
index 0000000..2b0650e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp4.cpp
@@ -0,0 +1,729 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* CORE Fp^4 functions */
+/* SU=m, m is Stack Usage (no lazy )*/
+
+/* FP4 elements are of the form a+ib, where i is sqrt(-1+sqrt(-1)) */
+
+#include "fp4_YYY.h"
+
+using namespace XXX;
+
+/* test x==0 ? */
+/* SU= 8 */
+int YYY::FP4_iszilch(FP4 *x)
+{
+    return (FP2_iszilch(&(x->a)) & FP2_iszilch(&(x->b)));
+}
+
+/* test x==1 ? */
+/* SU= 8 */
+int YYY::FP4_isunity(FP4 *x)
+{
+    return (FP2_isunity(&(x->a)) & FP2_iszilch(&(x->b)));
+}
+
+/* test is w real? That is in a+ib test b is zero */
+int YYY::FP4_isreal(FP4 *w)
+{
+    return FP2_iszilch(&(w->b));
+}
+
+
+// Is x lexically larger than p-x?
+// return -1 for no, 0 if x=0, 1 for yes
+int YYY::FP4_islarger(FP4 *x)
+{
+    int cmp;
+    if (FP4_iszilch(x)) return 0;
+    cmp=FP2_islarger(&(x->b));
+    if (cmp!=0) return cmp;
+    return FP2_islarger(&(x->a));
+}
+
+void YYY::FP4_toBytes(char *b,FP4 *x)
+{
+    FP2_toBytes(b,&(x->b));
+    FP2_toBytes(&b[2*MODBYTES_XXX],&(x->a));
+}
+
+void YYY::FP4_fromBytes(FP4 *x,char *b)
+{
+    FP2_fromBytes(&(x->b),b);
+    FP2_fromBytes(&(x->a),&b[2*MODBYTES_XXX]);
+}
+
+/* return 1 if x==y, else 0 */
+/* SU= 16 */
+int YYY::FP4_equals(FP4 *x, FP4 *y)
+{
+    return (FP2_equals(&(x->a), &(y->a)) & FP2_equals(&(x->b), &(y->b)));
+}
+
+/* set FP4 from two FP2s */
+/* SU= 16 */
+void YYY::FP4_from_FP2s(FP4 *w, FP2 * x, FP2* y)
+{
+    FP2_copy(&(w->a), x);
+    FP2_copy(&(w->b), y);
+}
+
+/* set FP4 from FP2 */
+/* SU= 8 */
+void YYY::FP4_from_FP2(FP4 *w, FP2 *x)
+{
+    FP2_copy(&(w->a), x);
+    FP2_zero(&(w->b));
+}
+
+/* set high part of FP4 from FP2 */
+/* SU= 8 */
+void YYY::FP4_from_FP2H(FP4 *w, FP2 *x)
+{
+    FP2_copy(&(w->b), x);
+    FP2_zero(&(w->a));
+}
+
+/* set FP4 from FP */
+void YYY::FP4_from_FP(FP4 *w, FP *x)
+{
+    FP2 t;
+    FP2_from_FP(&t, x);
+    FP4_from_FP2(w, &t);
+}
+
+/* FP4 copy w=x */
+/* SU= 16 */
+void YYY::FP4_copy(FP4 *w, FP4 *x)
+{
+    if (w == x) return;
+    FP2_copy(&(w->a), &(x->a));
+    FP2_copy(&(w->b), &(x->b));
+}
+
+/* FP4 w=0 */
+/* SU= 8 */
+void YYY::FP4_zero(FP4 *w)
+{
+    FP2_zero(&(w->a));
+    FP2_zero(&(w->b));
+}
+
+/* FP4 w=1 */
+/* SU= 8 */
+void YYY::FP4_one(FP4 *w)
+{
+    FP2_one(&(w->a));
+    FP2_zero(&(w->b));
+}
+
+int YYY::FP4_sign(FP4 *w)
+{
+    int p1,p2;
+    p1=FP2_sign(&(w->a));
+    p2=FP2_sign(&(w->b));
+#ifdef BIG_ENDIAN_SIGN_YYY
+    p2 ^= (p1 ^ p2)&FP2_iszilch(&(w->b));
+    return p2;
+#else
+    p1 ^= (p1 ^ p2)&FP2_iszilch(&(w->a));
+    return p1;
+#endif
+
+}
+
+/* Set w=-x */
+/* SU= 160 */
+void YYY::FP4_neg(FP4 *w, FP4 *x)
+{
+    /* Just one field neg */
+    FP2 m, t;
+    FP4_norm(x);
+
+    FP2_add(&m, &(x->a), &(x->b));
+    FP2_neg(&m, &m);
+    FP2_add(&t, &m, &(x->b));
+    FP2_add(&(w->b), &m, &(x->a));
+    FP2_copy(&(w->a), &t);
+    FP4_norm(w);
+}
+
+/* Set w=conj(x) */
+/* SU= 16 */
+void YYY::FP4_conj(FP4 *w, FP4 *x)
+{
+    FP2_copy(&(w->a), &(x->a));
+    FP2_neg(&(w->b), &(x->b));
+    FP4_norm(w);
+}
+
+/* Set w=-conj(x) */
+/* SU= 16 */
+void YYY::FP4_nconj(FP4 *w, FP4 *x)
+{
+    FP2_copy(&(w->b), &(x->b));
+    FP2_neg(&(w->a), &(x->a));
+    FP4_norm(w);
+}
+
+/* Set w=x+y */
+/* SU= 16 */
+void YYY::FP4_add(FP4 *w, FP4 *x, FP4 *y)
+{
+    FP2_add(&(w->a), &(x->a), &(y->a));
+    FP2_add(&(w->b), &(x->b), &(y->b));
+}
+
+/* Set w=x-y */
+/* Input y MUST be normed */
+void YYY::FP4_sub(FP4 *w, FP4 *x, FP4 *y)
+{
+    FP4 my;
+    FP4_neg(&my, y);
+    FP4_add(w, x, &my);
+}
+/* SU= 8 */
+/* reduce all components of w mod Modulus */
+void YYY::FP4_reduce(FP4 *w)
+{
+    FP2_reduce(&(w->a));
+    FP2_reduce(&(w->b));
+}
+
+/* SU= 8 */
+/* normalise all elements of w */
+void YYY::FP4_norm(FP4 *w)
+{
+    FP2_norm(&(w->a));
+    FP2_norm(&(w->b));
+}
+
+/* Set w=s*x, where s is FP2 */
+/* SU= 16 */
+void YYY::FP4_pmul(FP4 *w, FP4 *x, FP2 *s)
+{
+    FP2_mul(&(w->a), &(x->a), s);
+    FP2_mul(&(w->b), &(x->b), s);
+}
+
+/* Set w=s*x, where s is FP */
+void YYY::FP4_qmul(FP4 *w, FP4 *x, FP *s)
+{
+    FP2_pmul(&(w->a), &(x->a), s);
+    FP2_pmul(&(w->b), &(x->b), s);
+}
+
+/* SU= 16 */
+/* Set w=s*x, where s is int */
+void YYY::FP4_imul(FP4 *w, FP4 *x, int s)
+{
+    FP2_imul(&(w->a), &(x->a), s);
+    FP2_imul(&(w->b), &(x->b), s);
+}
+
+/* Set w=x^2 */
+/* Input MUST be normed  */
+void YYY::FP4_sqr(FP4 *w, FP4 *x)
+{
+    FP2 t1, t2, t3;
+
+    FP2_mul(&t3, &(x->a), &(x->b)); /* norms x */
+    FP2_copy(&t2, &(x->b));
+    FP2_add(&t1, &(x->a), &(x->b));
+    FP2_mul_ip(&t2);
+
+    FP2_add(&t2, &(x->a), &t2);
+
+    FP2_norm(&t1);  // 2
+    FP2_norm(&t2);  // 2
+
+    FP2_mul(&(w->a), &t1, &t2);
+
+    FP2_copy(&t2, &t3);
+    FP2_mul_ip(&t2);
+
+    FP2_add(&t2, &t2, &t3);
+
+    FP2_norm(&t2);  // 2
+    FP2_neg(&t2, &t2);
+    FP2_add(&(w->a), &(w->a), &t2); /* a=(a+b)(a+i^2.b)-i^2.ab-ab = a*a+ib*ib */
+    FP2_add(&(w->b), &t3, &t3); /* b=2ab */
+
+    FP4_norm(w);
+}
+
+/* Set w=x*y */
+/* Inputs MUST be normed  */
+void YYY::FP4_mul(FP4 *w, FP4 *x, FP4 *y)
+{
+
+    FP2 t1, t2, t3, t4;
+
+    FP2_mul(&t1, &(x->a), &(y->a));
+
+    FP2_mul(&t2, &(x->b), &(y->b));
+    FP2_add(&t3, &(y->b), &(y->a));
+    FP2_add(&t4, &(x->b), &(x->a));
+
+    FP2_norm(&t4); // 2
+    FP2_norm(&t3); // 2
+
+    FP2_mul(&t4, &t4, &t3); /* (xa+xb)(ya+yb) */
+
+    FP2_neg(&t3, &t1); // 1
+    FP2_add(&t4, &t4, &t3); //t4E=3
+    FP2_norm(&t4);
+
+    FP2_neg(&t3, &t2); // 1
+    FP2_add(&(w->b), &t4, &t3); //wbE=3
+
+    FP2_mul_ip(&t2);
+    FP2_add(&(w->a), &t2, &t1);
+
+    FP4_norm(w);
+}
+
+/* output FP4 in format [a,b] */
+/* SU= 8 */
+void YYY::FP4_output(FP4 *w)
+{
+    printf("[");
+    FP2_output(&(w->a));
+    printf(",");
+    FP2_output(&(w->b));
+    printf("]");
+}
+
+/* SU= 8 */
+void YYY::FP4_rawoutput(FP4 *w)
+{
+    printf("[");
+    FP2_rawoutput(&(w->a));
+    printf(",");
+    FP2_rawoutput(&(w->b));
+    printf("]");
+}
+
+/* Set w=1/x */
+/* SU= 160 */
+void YYY::FP4_inv(FP4 *w, FP4 *x, FP *h)
+{
+    FP2 t1, t2;
+    FP2_sqr(&t1, &(x->a));
+    FP2_sqr(&t2, &(x->b));
+    FP2_mul_ip(&t2);
+    FP2_norm(&t2);
+    FP2_sub(&t1, &t1, &t2);
+    FP2_inv(&t1, &t1, h);
+    FP2_mul(&(w->a), &t1, &(x->a));
+    FP2_neg(&t1, &t1);
+    FP2_norm(&t1);
+    FP2_mul(&(w->b), &t1, &(x->b));
+}
+
+/* w*=i where i = sqrt(2^i+sqrt(-1)) */
+/* SU= 200 */
+void YYY::FP4_times_i(FP4 *w)
+{
+    FP2 t;
+    FP2_copy(&t, &(w->b));
+    FP2_copy(&(w->b), &(w->a));
+    FP2_mul_ip(&t);
+    FP2_copy(&(w->a), &t);
+    FP4_norm(w);
+#if TOWER_YYY == POSITOWER
+    FP4_neg(w, w);  // ***
+    FP4_norm(w);
+#endif
+}
+
+/* Set w=w^p using Frobenius */
+/* SU= 16 */
+void YYY::FP4_frob(FP4 *w, FP2 *f)
+{
+    FP2_conj(&(w->a), &(w->a));
+    FP2_conj(&(w->b), &(w->b));
+    FP2_mul( &(w->b), f, &(w->b));
+}
+
+/* Set r=a^b mod m */
+/* SU= 240 */
+/*
+void YYY::FP4_pow(FP4 *r, FP4* a, BIG b)
+{
+    FP4 w;
+    BIG z, zilch;
+    int bt;
+
+    BIG_zero(zilch);
+    BIG_copy(z, b);
+    BIG_norm(z);
+    FP4_copy(&w, a);
+    FP4_norm(&w);
+    FP4_one(r);
+
+    while (1)
+    {
+        bt = BIG_parity(z);
+        BIG_shr(z, 1);
+        if (bt) FP4_mul(r, r, &w);
+        if (BIG_comp(z, zilch) == 0) break;
+        FP4_sqr(&w, &w);
+    }
+    FP4_reduce(r);
+}
+*/
+#if CURVE_SECURITY_ZZZ == 128
+
+/* SU= 304 */
+/* XTR xtr_a function */
+void YYY::FP4_xtr_A(FP4 *r, FP4 *w, FP4 *x, FP4 *y, FP4 *z)
+{
+    FP4 t1, t2;
+
+    FP4_copy(r, x);
+    FP4_sub(&t1, w, y);
+    FP4_norm(&t1);
+    FP4_pmul(&t1, &t1, &(r->a));
+    FP4_add(&t2, w, y);
+    FP4_norm(&t2);
+    FP4_pmul(&t2, &t2, &(r->b));
+    FP4_times_i(&t2);
+
+    FP4_add(r, &t1, &t2);
+    FP4_add(r, r, z);
+
+    FP4_reduce(r);
+}
+
+/* SU= 152 */
+/* XTR xtr_d function */
+void YYY::FP4_xtr_D(FP4 *r, FP4 *x)
+{
+    FP4 w;
+    FP4_copy(r, x);
+    FP4_conj(&w, r);
+    FP4_add(&w, &w, &w);
+    FP4_sqr(r, r);
+    FP4_norm(&w);
+    FP4_sub(r, r, &w);
+    FP4_reduce(r);    /* reduce here as multiple calls trigger automatic reductions */
+}
+
+/* SU= 728 */
+/* r=x^n using XTR method on traces of FP12s */
+void YYY::FP4_xtr_pow(FP4 *r, FP4 *x, BIG n)
+{
+    int i, par, nb;
+    BIG v;
+    FP2 w;
+    FP4 t, a, b, c, sf;
+
+    BIG_zero(v);
+    BIG_inc(v, 3);
+    BIG_norm(v);
+    FP2_from_BIG(&w, v);
+    FP4_from_FP2(&a, &w);
+    FP4_copy(&sf, x);
+    FP4_norm(&sf);
+    FP4_copy(&b, &sf);
+    FP4_xtr_D(&c, &sf);
+
+    par = BIG_parity(n);
+    BIG_copy(v, n);
+    BIG_norm(v);
+    BIG_shr(v, 1);
+    if (par == 0)
+    {
+        BIG_dec(v, 1);
+        BIG_norm(v);
+    }
+
+    nb = BIG_nbits(v);
+    for (i = nb - 1; i >= 0; i--)
+    {
+        if (!BIG_bit(v, i))
+        {
+            FP4_copy(&t, &b);
+            FP4_conj(&sf, &sf);
+            FP4_conj(&c, &c);
+            FP4_xtr_A(&b, &a, &b, &sf, &c);
+            FP4_conj(&sf, &sf);
+            FP4_xtr_D(&c, &t);
+            FP4_xtr_D(&a, &a);
+        }
+        else
+        {
+            FP4_conj(&t, &a);
+            FP4_xtr_D(&a, &b);
+            FP4_xtr_A(&b, &c, &b, &sf, &t);
+            FP4_xtr_D(&c, &c);
+        }
+    }
+
+    if (par == 0) FP4_copy(r, &c);
+    else FP4_copy(r, &b);
+    FP4_reduce(r);
+}
+
+/* SU= 872 */
+/* r=ck^a.cl^n using XTR double exponentiation method on traces of FP12s. See Stam thesis. */
+void YYY::FP4_xtr_pow2(FP4 *r, FP4 *ck, FP4 *cl, FP4 *ckml, FP4 *ckm2l, BIG a, BIG b)
+{
+    int i, f2;
+    BIG d, e, w;
+    FP4 t, cu, cv, cumv, cum2v;
+
+
+    BIG_copy(e, a);
+    BIG_copy(d, b);
+    BIG_norm(e);
+    BIG_norm(d);
+    FP4_copy(&cu, ck);
+    FP4_copy(&cv, cl);
+    FP4_copy(&cumv, ckml);
+    FP4_copy(&cum2v, ckm2l);
+
+    f2 = 0;
+    while (BIG_parity(d) == 0 && BIG_parity(e) == 0)
+    {
+        BIG_shr(d, 1);
+        BIG_shr(e, 1);
+        f2++;
+    }
+    while (BIG_comp(d, e) != 0)
+    {
+        if (BIG_comp(d, e) > 0)
+        {
+            BIG_imul(w, e, 4);
+            BIG_norm(w);
+            if (BIG_comp(d, w) <= 0)
+            {
+                BIG_copy(w, d);
+                BIG_copy(d, e);
+                BIG_sub(e, w, e);
+                BIG_norm(e);
+                FP4_xtr_A(&t, &cu, &cv, &cumv, &cum2v);
+                FP4_conj(&cum2v, &cumv);
+                FP4_copy(&cumv, &cv);
+                FP4_copy(&cv, &cu);
+                FP4_copy(&cu, &t);
+            }
+            else if (BIG_parity(d) == 0)
+            {
+                BIG_shr(d, 1);
+                FP4_conj(r, &cum2v);
+                FP4_xtr_A(&t, &cu, &cumv, &cv, r);
+                FP4_xtr_D(&cum2v, &cumv);
+                FP4_copy(&cumv, &t);
+                FP4_xtr_D(&cu, &cu);
+            }
+            else if (BIG_parity(e) == 1)
+            {
+                BIG_sub(d, d, e);
+                BIG_norm(d);
+                BIG_shr(d, 1);
+                FP4_xtr_A(&t, &cu, &cv, &cumv, &cum2v);
+                FP4_xtr_D(&cu, &cu);
+                FP4_xtr_D(&cum2v, &cv);
+                FP4_conj(&cum2v, &cum2v);
+                FP4_copy(&cv, &t);
+            }
+            else
+            {
+                BIG_copy(w, d);
+                BIG_copy(d, e);
+                BIG_shr(d, 1);
+                BIG_copy(e, w);
+                FP4_xtr_D(&t, &cumv);
+                FP4_conj(&cumv, &cum2v);
+                FP4_conj(&cum2v, &t);
+                FP4_xtr_D(&t, &cv);
+                FP4_copy(&cv, &cu);
+                FP4_copy(&cu, &t);
+            }
+        }
+        if (BIG_comp(d, e) < 0)
+        {
+            BIG_imul(w, d, 4);
+            BIG_norm(w);
+            if (BIG_comp(e, w) <= 0)
+            {
+                BIG_sub(e, e, d);
+                BIG_norm(e);
+                FP4_xtr_A(&t, &cu, &cv, &cumv, &cum2v);
+                FP4_copy(&cum2v, &cumv);
+                FP4_copy(&cumv, &cu);
+                FP4_copy(&cu, &t);
+            }
+            else if (BIG_parity(e) == 0)
+            {
+                BIG_copy(w, d);
+                BIG_copy(d, e);
+                BIG_shr(d, 1);
+                BIG_copy(e, w);
+                FP4_xtr_D(&t, &cumv);
+                FP4_conj(&cumv, &cum2v);
+                FP4_conj(&cum2v, &t);
+                FP4_xtr_D(&t, &cv);
+                FP4_copy(&cv, &cu);
+                FP4_copy(&cu, &t);
+            }
+            else if (BIG_parity(d) == 1)
+            {
+                BIG_copy(w, e);
+                BIG_copy(e, d);
+                BIG_sub(w, w, d);
+                BIG_norm(w);
+                BIG_copy(d, w);
+                BIG_shr(d, 1);
+                FP4_xtr_A(&t, &cu, &cv, &cumv, &cum2v);
+                FP4_conj(&cumv, &cumv);
+                FP4_xtr_D(&cum2v, &cu);
+                FP4_conj(&cum2v, &cum2v);
+                FP4_xtr_D(&cu, &cv);
+                FP4_copy(&cv, &t);
+            }
+            else
+            {
+                BIG_shr(d, 1);
+                FP4_conj(r, &cum2v);
+                FP4_xtr_A(&t, &cu, &cumv, &cv, r);
+                FP4_xtr_D(&cum2v, &cumv);
+                FP4_copy(&cumv, &t);
+                FP4_xtr_D(&cu, &cu);
+            }
+        }
+    }
+    FP4_xtr_A(r, &cu, &cv, &cumv, &cum2v);
+    for (i = 0; i < f2; i++)    FP4_xtr_D(r, r);
+    FP4_xtr_pow(r, r, d);
+}
+
+#endif
+
+/* New stuff for ECp4 support */
+
+/* Set w=x/2 */
+void YYY::FP4_div2(FP4 *w, FP4 *x)
+{
+    FP2_div2(&(w->a), &(x->a));
+    FP2_div2(&(w->b), &(x->b));
+}
+
+/* Move b to a if d=1 */
+void YYY::FP4_cmove(FP4 *f, FP4 *g, int d)
+{
+    FP2_cmove(&(f->a), &(g->a), d);
+    FP2_cmove(&(f->b), &(g->b), d);
+}
+
+void YYY::FP4_rand(FP4 *x,csprng *rng)
+{
+    FP2_rand(&(x->a),rng);
+    FP2_rand(&(x->b),rng);
+}
+
+#if PAIRING_FRIENDLY_ZZZ >= BLS24_CURVE
+
+/* test for x a QR */
+int YYY::FP4_qr(FP4 *x, FP *h)
+{ /* test x^(p^4-1)/2 = 1 */
+    
+    FP4 c;
+    FP4_conj(&c,x);
+    FP4_mul(&c,&c,x);
+
+    return FP2_qr(&(c.a),h);
+}
+
+/* sqrt(a+xb) = sqrt((a+sqrt(a*a-n*b*b))/2)+x.b/(2*sqrt((a+sqrt(a*a-n*b*b))/2)) */
+
+void YYY::FP4_sqrt(FP4 *r, FP4* x, FP *h)
+{
+    FP2 a, b, s, t;
+    FP hint,twk;
+    FP4 nr;
+    int sgn,qr;
+
+    FP4_copy(r, x);
+    if (FP4_iszilch(x)) return;
+
+    FP2_copy(&a, &(x->a));
+    FP2_copy(&s, &(x->b));
+
+    FP2_sqr(&s, &s); // s*=s
+    FP2_sqr(&a, &a); // a*=a
+    FP2_mul_ip(&s);
+    FP2_norm(&s);
+    FP2_sub(&a, &a, &s); // a-=txx(s)
+    FP2_norm(&a); // **
+
+    FP2_sqrt(&s, &a, h);            // Cost = +1
+
+    FP2_add(&a, &(r->a), &s);
+    FP2_norm(&a);
+    FP2_div2(&a, &a);
+
+    FP2_div2(&b,&(r->b));                   // w1=b/2
+    qr=FP2_qr(&a,&hint);                    // only exp! Cost=+1
+
+// tweak hint - multiply old hint by Norm(1/Beta)^e where Beta is irreducible polynomial
+    FP2_copy(&s,&a);
+    FP_rcopy(&twk,TWK);
+    FP_mul(&twk,&twk,&hint);
+    FP2_div_ip(&s); FP2_norm(&s); // switch to other candidate
+
+    FP2_cmove(&a,&s,1-qr);
+    FP_cmove(&hint,&twk,1-qr);
+
+    FP2_sqrt(&(r->a),&a,&hint);             // a=sqrt(w2)  Cost=+1
+    FP2_inv(&s,&a,&hint);                  // w3=1/w2
+    FP2_mul(&s,&s,&(r->a));                // w3=1/sqrt(w2)
+    FP2_mul(&(r->b),&s,&b);                // b=(b/2)*1/sqrt(w2)
+    FP2_copy(&t,&(r->a));
+
+    FP2_cmove(&(r->a),&(r->b),1-qr);
+    FP2_cmove(&(r->b),&t,1-qr);
+
+    sgn=FP4_sign(r);
+    FP4_neg(&nr,r); FP4_norm(&nr);
+    FP4_cmove(r,&nr,sgn);
+}
+
+void YYY::FP4_div_i(FP4 *f)
+{
+    FP2 u, v;
+    FP2_copy(&u, &(f->a));
+    FP2_copy(&v, &(f->b));
+
+    FP2_div_ip(&u);
+
+    FP2_copy(&(f->a), &v);
+    FP2_copy(&(f->b), &u);
+
+#if TOWER_YYY == POSITOWER
+    FP4_neg(f, f);  // ***
+    FP4_norm(f);
+#endif
+}
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp4.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp4.h
new file mode 100644
index 0000000..b889fa3
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp4.h
@@ -0,0 +1,349 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP4_YYY_H
+#define FP4_YYY_H
+
+#include "fp2_YYY.h"
+#include "config_curve_ZZZ.h"
+
+using namespace core;
+
+namespace YYY {
+
+/**
+	@brief FP4 Structure - towered over two FP2
+*/
+
+typedef struct
+{
+    FP2 a; /**< real part of FP4 */
+    FP2 b; /**< imaginary part of FP4 */
+} FP4;
+
+
+/* FP4 prototypes */
+/**	@brief Tests for FP4 equal to zero
+ *
+	@param x FP4 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP4_iszilch(FP4 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP4 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP4_islarger(FP4 *x);
+
+/**	@brief Serialize out FP4  
+ *
+    @param b buffer for output
+	@param x FP4 number to be serialized
+ */
+extern void FP4_toBytes(char *b,FP4 *x);
+
+/**	@brief Serialize in FP4  
+ *
+	@param x FP4 number to be serialized
+    @param b buffer for input
+ */
+extern void FP4_fromBytes(FP4 *x,char *b);
+
+/**	@brief Tests for FP4 equal to unity
+ *
+	@param x FP4 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP4_isunity(FP4 *x);
+/**	@brief Tests for equality of two FP4s
+ *
+	@param x FP4 instance to be compared
+	@param y FP4 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP4_equals(FP4 *x, FP4 *y);
+/**	@brief Tests for FP4 having only a real part and no imaginary part
+ *
+	@param x FP4 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP4_isreal(FP4 *x);
+/**	@brief Initialise FP4 from two FP2s
+ *
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+	@param b FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2s(FP4 *x, FP2 *a, FP2 *b);
+/**	@brief Initialise FP4 from single FP2
+ *
+	Imaginary part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+ */
+extern void FP4_from_FP2(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP2
+ *
+	real part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2H(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP
+ *
+	@param x FP4 instance to be initialised
+	@param a FP to form real part of FP4
+ */
+extern void FP4_from_FP(FP4 *x, FP *a);
+
+/**	@brief Copy FP4 to another FP4
+ *
+	@param x FP4 instance, on exit = y
+	@param y FP4 instance to be copied
+ */
+extern void FP4_copy(FP4 *x, FP4 *y);
+/**	@brief Set FP4 to zero
+ *
+	@param x FP4 instance to be set to zero
+ */
+extern void FP4_zero(FP4 *x);
+/**	@brief Set FP4 to unity
+ *
+	@param x FP4 instance to be set to one
+ */
+extern void FP4_one(FP4 *x);
+
+/**	@brief Sign of FP4
+ *
+	@param x FP4 instance
+	@return "sign" of FP4
+ */
+extern int FP4_sign(FP4 *x);
+
+/**	@brief Negation of FP4
+ *
+	@param x FP4 instance, on exit = -y
+	@param y FP4 instance
+ */
+extern void FP4_neg(FP4 *x, FP4 *y);
+/**	@brief Conjugation of FP4
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP4 instance, on exit = conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_conj(FP4 *x, FP4 *y);
+/**	@brief Negative conjugation of FP4
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP4 instance, on exit = -conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_nconj(FP4 *x, FP4 *y);
+/**	@brief addition of two FP4s
+ *
+	@param x FP4 instance, on exit = y+z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_add(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief subtraction of two FP4s
+ *
+	@param x FP4 instance, on exit = y-z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_sub(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Multiplication of an FP4 by an FP2
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP2 multiplier
+ */
+extern void FP4_pmul(FP4 *x, FP4 *y, FP2 *a);
+
+
+/**	@brief Multiplication of an FP4 by an FP
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP multiplier
+ */
+extern void FP4_qmul(FP4 *x, FP4 *y, FP *a);
+
+/**	@brief Multiplication of an FP4 by a small integer
+ *
+	@param x FP4 instance, on exit = y*i
+	@param y FP4 instance
+	@param i an integer
+ */
+extern void FP4_imul(FP4 *x, FP4 *y, int i);
+/**	@brief Squaring an FP4
+ *
+	@param x FP4 instance, on exit = y^2
+	@param y FP4 instance
+ */
+extern void FP4_sqr(FP4 *x, FP4 *y);
+/**	@brief Multiplication of two FP4s
+ *
+	@param x FP4 instance, on exit = y*z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_mul(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Inverting an FP4
+ *
+	@param x FP4 instance, on exit = 1/y
+	@param y FP4 instance
+    @param h optional input hint
+ */
+extern void FP4_inv(FP4 *x, FP4 *y, FP *h);
+
+/**	@brief Divide an FP4 by 2
+ *
+	@param x FP4 instance, on exit = y/2
+	@param y FP4 instance
+ */
+extern void FP4_div2(FP4 *x, FP4 *y);
+
+
+/**	@brief Formats and outputs an FP4 to the console
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_output(FP4 *x);
+/**	@brief Formats and outputs an FP4 to the console in raw form (for debugging)
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_rawoutput(FP4 *x);
+/**	@brief multiplies an FP4 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP4 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP4_times_i(FP4 *x);
+/**	@brief Normalises the components of an FP4
+ *
+	@param x FP4 instance to be normalised
+ */
+extern void FP4_norm(FP4 *x);
+/**	@brief Reduces all components of possibly unreduced FP4 mod Modulus
+ *
+	@param x FP4 instance, on exit reduced mod Modulus
+ */
+extern void FP4_reduce(FP4 *x);
+/**	@brief Raises an FP4 to the power of a BIG
+ *
+	@param x FP4 instance, on exit = y^b
+	@param y FP4 instance
+	@param b BIG number
+ */
+extern void FP4_pow(FP4 *x, FP4 *y, XXX::BIG b);
+/**	@brief Raises an FP4 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP4 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP4_frob(FP4 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP4 instance, on exit = w*x-conj(x)*y+z
+	@param w FP4 instance
+	@param x FP4 instance
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_xtr_A(FP4 *r, FP4 *w, FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP4 instance, on exit = x^2-2*conj(x)
+	@param x FP4 instance
+ */
+extern void FP4_xtr_D(FP4 *r, FP4 *x);
+/**	@brief Calculates FP4 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP4 instance, on exit = trace(w^b)
+	@param x FP4 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP4_xtr_pow(FP4 *r, FP4 *x, XXX::BIG b);
+/**	@brief Calculates FP4 trace of c^a.d^b, where c and d are derived from FP4 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP4 instance, on exit = trace(c^a.d^b)
+	@param c FP4 instance, trace of an FP12
+	@param d FP4 instance, trace of an FP12
+	@param e FP4 instance, trace of an FP12
+	@param f FP4 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP4_xtr_pow2(FP4 *r, FP4 *c, FP4 *d, FP4 *e, FP4 *f, XXX::BIG a, XXX::BIG b);
+
+/**	@brief Test FP4 for QR
+ * 
+	@param r FP4 instance
+    @param h optional generated hint
+	@return 1 x is a QR, otherwise 0
+ */
+extern int  FP4_qr(FP4 *r, FP *h);
+
+/**	@brief Calculate square root of an FP4
+ *
+	Square root
+	@param r FP4 instance, on exit = sqrt(x)
+	@param x FP4 instance
+    @param h optional input hint
+ */
+extern void  FP4_sqrt(FP4 *r, FP4 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP4 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP4 instance, set to y if s!=0
+	@param y another FP4 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP4_cmove(FP4 *x, FP4 *y, int s);
+
+
+/**	@brief Divide FP4 number by QNR
+ *
+	Divide FP4 by the QNR
+	@param x FP4 instance
+ */
+extern void FP4_div_i(FP4 *x);
+
+/**	@brief Generate random FP4
+ *
+	@param x random FP4 number
+	@param rng random number generator
+ */
+extern void FP4_rand(FP4 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp48.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp48.cpp
new file mode 100644
index 0000000..9f0905c
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp48.cpp
@@ -0,0 +1,1092 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* CORE Fp^12 functions */
+/* SU=m, m is Stack Usage (no lazy )*/
+/* FP48 elements are of the form a+i.b+i^2.c */
+
+#include "fp48_YYY.h"
+#include "config_curve_ZZZ.h"
+
+using namespace XXX;
+
+/* return 1 if b==c, no branching */
+static int teq(sign32 b, sign32 c)
+{
+    sign32 x = b ^ c;
+    x -= 1; // if x=0, x now -1
+    return (int)((x >> 31) & 1);
+}
+
+
+/* Constant time select from pre-computed table */
+static void FP48_select(YYY::FP48 *f, YYY::FP48 g[], sign32 b)
+{
+    YYY::FP48 invf;
+    sign32 m = b >> 31;
+    sign32 babs = (b ^ m) - m;
+
+    babs = (babs - 1) / 2;
+
+    FP48_cmove(f, &g[0], teq(babs, 0)); // conditional move
+    FP48_cmove(f, &g[1], teq(babs, 1));
+    FP48_cmove(f, &g[2], teq(babs, 2));
+    FP48_cmove(f, &g[3], teq(babs, 3));
+    FP48_cmove(f, &g[4], teq(babs, 4));
+    FP48_cmove(f, &g[5], teq(babs, 5));
+    FP48_cmove(f, &g[6], teq(babs, 6));
+    FP48_cmove(f, &g[7], teq(babs, 7));
+
+    FP48_copy(&invf, f);
+    FP48_conj(&invf, &invf); // 1/f
+    FP48_cmove(f, &invf, (int)(m & 1));
+}
+
+
+/* test x==0 ? */
+/* SU= 8 */
+int YYY::FP48_iszilch(FP48 *x)
+{
+    if (FP16_iszilch(&(x->a)) && FP16_iszilch(&(x->b)) && FP16_iszilch(&(x->c))) return 1;
+    return 0;
+}
+
+/* test x==1 ? */
+/* SU= 8 */
+int YYY::FP48_isunity(FP48 *x)
+{
+    if (FP16_isunity(&(x->a)) && FP16_iszilch(&(x->b)) && FP16_iszilch(&(x->c))) return 1;
+    return 0;
+}
+
+/* FP48 copy w=x */
+/* SU= 16 */
+void YYY::FP48_copy(FP48 *w, FP48 *x)
+{
+    if (x == w) return;
+    FP16_copy(&(w->a), &(x->a));
+    FP16_copy(&(w->b), &(x->b));
+    FP16_copy(&(w->c), &(x->c));
+    w->type = x->type;
+}
+
+/* FP48 w=1 */
+/* SU= 8 */
+void YYY::FP48_one(FP48 *w)
+{
+    FP16_one(&(w->a));
+    FP16_zero(&(w->b));
+    FP16_zero(&(w->c));
+    w->type = FP_UNITY;
+}
+
+void YYY::FP48_zero(FP48 *w)
+{
+    FP16_zero(&(w->a));
+    FP16_zero(&(w->b));
+    FP16_zero(&(w->c));
+    w->type = FP_ZILCH;
+}
+
+/* return 1 if x==y, else 0 */
+/* SU= 16 */
+int YYY::FP48_equals(FP48 *x, FP48 *y)
+{
+    if (FP16_equals(&(x->a), &(y->a)) && FP16_equals(&(x->b), &(y->b)) && FP16_equals(&(x->c), &(y->c)))
+        return 1;
+    return 0;
+}
+
+/* Set w=conj(x) */
+/* SU= 8 */
+void YYY::FP48_conj(FP48 *w, FP48 *x)
+{
+    FP48_copy(w, x);
+    FP16_conj(&(w->a), &(w->a));
+    FP16_nconj(&(w->b), &(w->b));
+    FP16_conj(&(w->c), &(w->c));
+}
+
+/* Create FP48 from FP16 */
+/* SU= 8 */
+void YYY::FP48_from_FP16(FP48 *w, FP16 *a)
+{
+    FP16_copy(&(w->a), a);
+    FP16_zero(&(w->b));
+    FP16_zero(&(w->c));
+    w->type = FP_SPARSEST;
+}
+
+/* Create FP48 from 3 FP16's */
+/* SU= 16 */
+void YYY::FP48_from_FP16s(FP48 *w, FP16 *a, FP16 *b, FP16 *c)
+{
+    FP16_copy(&(w->a), a);
+    FP16_copy(&(w->b), b);
+    FP16_copy(&(w->c), c);
+    w->type = FP_DENSE;
+}
+
+/* Granger-Scott Unitary Squaring. This does not benefit from lazy reduction */
+/* SU= 600 */
+void YYY::FP48_usqr(FP48 *w, FP48 *x)
+{
+    FP16 A, B, C, D;
+
+    FP16_copy(&A, &(x->a));
+
+    FP16_sqr(&(w->a), &(x->a));
+    FP16_add(&D, &(w->a), &(w->a));
+    FP16_add(&(w->a), &D, &(w->a));
+
+    FP16_norm(&(w->a));
+    FP16_nconj(&A, &A);
+
+    FP16_add(&A, &A, &A);
+    FP16_add(&(w->a), &(w->a), &A);
+    FP16_sqr(&B, &(x->c));
+    FP16_times_i(&B);
+
+    FP16_add(&D, &B, &B);
+    FP16_add(&B, &B, &D);
+    FP16_norm(&B);
+
+    FP16_sqr(&C, &(x->b));
+
+    FP16_add(&D, &C, &C);
+    FP16_add(&C, &C, &D);
+
+    FP16_norm(&C);
+    FP16_conj(&(w->b), &(x->b));
+    FP16_add(&(w->b), &(w->b), &(w->b));
+    FP16_nconj(&(w->c), &(x->c));
+
+    FP16_add(&(w->c), &(w->c), &(w->c));
+    FP16_add(&(w->b), &B, &(w->b));
+    FP16_add(&(w->c), &C, &(w->c));
+    w->type = FP_DENSE;
+
+    FP48_reduce(w);     /* reduce here as in pow function repeated squarings would trigger multiple reductions */
+}
+
+/* FP48 squaring w=x^2 */
+/* SU= 600 */
+void YYY::FP48_sqr(FP48 *w, FP48 *x)
+{
+    /* Use Chung-Hasan SQR2 method from http://cacr.uwaterloo.ca/techreports/2006/cacr2006-24.pdf */
+
+    FP16 A, B, C, D;
+
+    if (x->type <= FP_UNITY)
+    {
+        FP48_copy(w, x);
+        return;
+    }
+
+    FP16_sqr(&A, &(x->a));
+    FP16_mul(&B, &(x->b), &(x->c));
+    FP16_add(&B, &B, &B);
+    FP16_norm(&B);
+    FP16_sqr(&C, &(x->c));
+
+    FP16_mul(&D, &(x->a), &(x->b));
+    FP16_add(&D, &D, &D);
+
+    FP16_add(&(w->c), &(x->a), &(x->c));
+    FP16_add(&(w->c), &(x->b), &(w->c));
+    FP16_norm(&(w->c));
+
+    FP16_sqr(&(w->c), &(w->c));
+
+    FP16_copy(&(w->a), &A);
+    FP16_add(&A, &A, &B);
+
+    FP16_norm(&A);
+
+    FP16_add(&A, &A, &C);
+    FP16_add(&A, &A, &D);
+
+    FP16_norm(&A);
+
+    FP16_neg(&A, &A);
+    FP16_times_i(&B);
+    FP16_times_i(&C);
+
+    FP16_add(&(w->a), &(w->a), &B);
+    FP16_add(&(w->b), &C, &D);
+    FP16_add(&(w->c), &(w->c), &A);
+
+    if (x->type == FP_SPARSER || x->type == FP_SPARSEST)
+        w->type = FP_SPARSE;
+    else
+        w->type = FP_DENSE;
+
+    FP48_norm(w);
+}
+
+/* FP48 full multiplication w=w*y */
+
+
+/* SU= 896 */
+/* FP48 full multiplication w=w*y */
+void YYY::FP48_mul(FP48 *w, FP48 *y)
+{
+    FP16 z0, z1, z2, z3, t0, t1;
+
+    FP16_mul(&z0, &(w->a), &(y->a));
+    FP16_mul(&z2, &(w->b), &(y->b)); //
+
+    FP16_add(&t0, &(w->a), &(w->b));
+    FP16_add(&t1, &(y->a), &(y->b)); //
+
+    FP16_norm(&t0);
+    FP16_norm(&t1);
+
+    FP16_mul(&z1, &t0, &t1);
+    FP16_add(&t0, &(w->b), &(w->c));
+    FP16_add(&t1, &(y->b), &(y->c)); //
+
+    FP16_norm(&t0);
+    FP16_norm(&t1);
+
+    FP16_mul(&z3, &t0, &t1);
+
+    FP16_neg(&t0, &z0);
+    FP16_neg(&t1, &z2);
+
+    FP16_add(&z1, &z1, &t0); // z1=z1-z0
+    FP16_add(&(w->b), &z1, &t1); // z1=z1-z2
+    FP16_add(&z3, &z3, &t1);      // z3=z3-z2
+    FP16_add(&z2, &z2, &t0);      // z2=z2-z0
+
+    FP16_add(&t0, &(w->a), &(w->c));
+    FP16_add(&t1, &(y->a), &(y->c));
+
+    FP16_norm(&t0);
+    FP16_norm(&t1);
+
+    FP16_mul(&t0, &t1, &t0);
+    FP16_add(&z2, &z2, &t0);
+
+    FP16_mul(&t0, &(w->c), &(y->c));
+    FP16_neg(&t1, &t0);
+
+    FP16_add(&(w->c), &z2, &t1);
+    FP16_add(&z3, &z3, &t1);
+    FP16_times_i(&t0);
+    FP16_add(&(w->b), &(w->b), &t0);
+    FP16_norm(&z3);
+    FP16_times_i(&z3);
+    FP16_add(&(w->a), &z0, &z3);
+
+    FP48_norm(w);
+    w->type = FP_DENSE;
+}
+
+/* FP48 full multiplication w=w*y */
+/* Supports sparse multiplicands */
+/* Usually w is denser than y */
+void YYY::FP48_ssmul(FP48 *w, FP48 *y)
+{
+    FP16 z0, z1, z2, z3, t0, t1;
+    if (w->type == FP_UNITY)
+    {
+        FP48_copy(w, y);
+        return;
+    }
+    if (y->type == FP_UNITY)
+        return;
+
+//  FP48_mul(w,y); return;
+
+    if (y->type >= FP_SPARSE)
+    {
+        FP16_mul(&z0, &(w->a), &(y->a)); // xa.ya   always 11x11
+
+#if SEXTIC_TWIST_ZZZ == M_TYPE
+        if (y->type == FP_SPARSE || w->type == FP_SPARSE)
+        {
+            FP8_mul(&z2.b, &(w->b).b, &(y->b).b);
+            FP8_zero(&z2.a);
+            if (y->type != FP_SPARSE)
+                FP8_mul(&z2.a, &(w->b).b, &(y->b).a);
+            if (w->type != FP_SPARSE)
+                FP8_mul(&z2.a, &(w->b).a, &(y->b).b);
+            FP16_times_i(&z2);
+        }
+        else
+#endif
+            FP16_mul(&z2, &(w->b), &(y->b)); // xb.yb  could be 00x00 or 01x01 or or 10x10 or 11x00 or 11x10 or 11x01 or 11x11
+
+        FP16_add(&t0, &(w->a), &(w->b)); // (xa+xb)
+        FP16_add(&t1, &(y->a), &(y->b)); // (ya+yb)
+
+        FP16_norm(&t0);
+        FP16_norm(&t1);
+
+        FP16_mul(&z1, &t0, &t1); // (xa+xb)(ya+yb)  always 11x11
+        FP16_add(&t0, &(w->b), &(w->c)); // (xb+xc)
+        FP16_add(&t1, &(y->b), &(y->c)); // (yb+yc)
+
+        FP16_norm(&t0);
+        FP16_norm(&t1);
+
+        FP16_mul(&z3, &t0, &t1); // (xb+xc)(yb+yc)   could be anything...
+        FP16_neg(&t0, &z0);     // -(xa.ya)
+        FP16_neg(&t1, &z2);     // -(xb.yb)
+
+        FP16_add(&z1, &z1, &t0);
+        FP16_add(&(w->b), &z1, &t1); // /wb = (xa+xb)(ya+yb) -(xa.ya) -(xb.yb)                        = xa.yb + xb.ya
+
+        FP16_add(&z3, &z3, &t1);      // (xb+xc)(yb+yc) -(xb.yb)
+        FP16_add(&z2, &z2, &t0);      // (xb.yb) - (xa.ya)
+
+        FP16_add(&t0, &(w->a), &(w->c)); // (xa+xc)
+        FP16_add(&t1, &(y->a), &(y->c)); // (ya+yc)
+
+        FP16_norm(&t0);
+        FP16_norm(&t1);
+
+        FP16_mul(&t0, &t1, &t0); // (xa+xc)(ya+yc)    always 11x11
+        FP16_add(&z2, &z2, &t0); // (xb.yb) - (xa.ya) + (xa+xc)(ya+yc)
+
+#if SEXTIC_TWIST_ZZZ == D_TYPE
+        if (y->type == FP_SPARSE || w->type == FP_SPARSE)
+        {
+            FP8_mul(&t0.a, &(w->c).a, &(y->c).a);
+            FP8_zero(&t0.b);
+            if (y->type != FP_SPARSE)
+                FP8_mul(&t0.b, &(w->c).a, &(y->c).b);
+            if (w->type != FP_SPARSE)
+                FP8_mul(&t0.b, &(w->c).b, &(y->c).a);
+        }
+        else
+#endif
+            FP16_mul(&t0, &(w->c), &(y->c)); // (xc.yc)  could be anything
+
+        FP16_neg(&t1, &t0);           // -(xc.yc)
+
+        FP16_add(&(w->c), &z2, &t1);    // wc = (xb.yb) - (xa.ya) + (xa+xc)(ya+yc) - (xc.yc)    =  xb.yb + xc.ya + xa.yc
+        FP16_add(&z3, &z3, &t1);        // (xb+xc)(yb+yc) -(xb.yb) - (xc.yc)                    =  xb.yc + xc.yb
+        FP16_times_i(&t0);              // i.(xc.yc)
+        FP16_add(&(w->b), &(w->b), &t0); // wb = (xa+xb)(ya+yb) -(xa.ya) -(xb.yb) +i(xc.yc)
+        FP16_norm(&z3);
+        FP16_times_i(&z3);              // i[(xb+xc)(yb+yc) -(xb.yb) - (xc.yc)]                 = i(xb.yc + xc.yb)
+        FP16_add(&(w->a), &z0, &z3);    // wa = xa.ya + i(xb.yc + xc.yb)
+    } else {
+        if (w->type == FP_SPARSER || w->type == FP_SPARSEST)
+        {
+            FP48_smul(w, y);
+            return;
+        }
+// dense by sparser - 13m
+#if SEXTIC_TWIST_ZZZ == D_TYPE
+        FP16_copy(&z3, &(w->b));
+        FP16_mul(&z0, &(w->a), &(y->a));
+
+        if (y->type == FP_SPARSEST)
+            FP16_tmul(&z2, &(w->b), &(y->b).a.a.a.a);
+        else
+            FP16_pmul(&z2, &(w->b), &(y->b).a);
+
+        FP16_add(&(w->b), &(w->a), &(w->b));
+        FP16_copy(&t1, &(y->a));
+        FP8_add(&t1.a, &t1.a, &(y->b).a);
+
+        FP16_norm(&t1);
+        FP16_norm(&(w->b));
+
+        FP16_mul(&(w->b), &(w->b), &t1);
+        FP16_add(&z3, &z3, &(w->c));
+        FP16_norm(&z3);
+
+        if (y->type == FP_SPARSEST)
+            FP16_tmul(&z3, &z3, &(y->b).a.a.a.a);
+        else
+            FP16_pmul(&z3, &z3, &(y->b).a);
+
+        FP16_neg(&t0, &z0);
+        FP16_neg(&t1, &z2);
+
+        FP16_add(&(w->b), &(w->b), &t0); // z1=z1-z0
+        FP16_add(&(w->b), &(w->b), &t1); // z1=z1-z2
+
+        FP16_add(&z3, &z3, &t1);      // z3=z3-z2
+        FP16_add(&z2, &z2, &t0);      // z2=z2-z0
+
+        FP16_add(&t0, &(w->a), &(w->c));
+        FP16_norm(&t0);
+        FP16_norm(&z3);
+
+        FP16_mul(&t0, &(y->a), &t0);
+        FP16_add(&(w->c), &z2, &t0);
+
+        FP16_times_i(&z3);
+        FP16_add(&(w->a), &z0, &z3);
+#endif
+#if SEXTIC_TWIST_ZZZ == M_TYPE
+        FP16_mul(&z0, &(w->a), &(y->a));
+        FP16_add(&t0, &(w->a), &(w->b));
+        FP16_norm(&t0);
+
+        FP16_mul(&z1, &t0, &(y->a));
+        FP16_add(&t0, &(w->b), &(w->c));
+        FP16_norm(&t0);
+
+        if (y->type == FP_SPARSEST)
+            FP16_tmul(&z3, &t0, &(y->c).b.a.a.a);
+        else
+            FP16_pmul(&z3, &t0, &(y->c).b);
+
+        FP16_times_i(&z3);
+
+        FP16_neg(&t0, &z0);
+        FP16_add(&z1, &z1, &t0); // z1=z1-z0
+
+        FP16_copy(&(w->b), &z1);
+        FP16_copy(&z2, &t0);
+
+        FP16_add(&t0, &(w->a), &(w->c));
+        FP16_add(&t1, &(y->a), &(y->c));
+
+        FP16_norm(&t0);
+        FP16_norm(&t1);
+
+        FP16_mul(&t0, &t1, &t0);
+        FP16_add(&z2, &z2, &t0);
+
+        if (y->type == FP_SPARSEST)
+            FP16_tmul(&t0, &(w->c), &(y->c).b.a.a.a);
+        else
+            FP16_pmul(&t0, &(w->c), &(y->c).b);
+
+        FP16_times_i(&t0);
+        FP16_neg(&t1, &t0);
+        FP16_times_i(&t0);
+
+        FP16_add(&(w->c), &z2, &t1);
+        FP16_add(&z3, &z3, &t1);
+
+        FP16_add(&(w->b), &(w->b), &t0);
+        FP16_norm(&z3);
+        FP16_times_i(&z3);
+        FP16_add(&(w->a), &z0, &z3);
+#endif
+    }
+    w->type = FP_DENSE;
+    FP48_norm(w);
+}
+
+/* FP48 multiplication w=w*y */
+/* catering for special case that arises from special form of ATE pairing line function */
+/* w and y are both sparser line functions - cost = 6m */
+void YYY::FP48_smul(FP48 *w, FP48 *y)
+{
+    FP8 w1, w2, w3, ta, tb, tc, td, te, t;
+
+//  FP48_mul(w,y); return;
+
+#if SEXTIC_TWIST_ZZZ == D_TYPE
+    FP8_mul(&w1, &(w->a).a, &(y->a).a); // A1.A2
+    FP8_mul(&w2, &(w->a).b, &(y->a).b); // B1.B2
+
+    if (y->type == FP_SPARSEST || w->type == FP_SPARSEST)
+    {
+        if (y->type == FP_SPARSEST && w->type == FP_SPARSEST)
+        {
+            FP8_zero(&w3);
+            FP_mul(&w3.a.a.a, &(w->b).a.a.a.a, &(y->b).a.a.a.a);
+        } else {
+            if (y->type != FP_SPARSEST)
+                FP8_tmul(&w3, &(y->b).a, &(w->b).a.a.a.a);
+            if (w->type != FP_SPARSEST)
+                FP8_tmul(&w3, &(w->b).a, &(y->b).a.a.a.a);
+        }
+    }
+    else
+        FP8_mul(&w3, &(w->b).a, &(y->b).a); // C1.C2
+
+    FP8_add(&ta, &(w->a).a, &(w->a).b); // A1+B1
+    FP8_add(&tb, &(y->a).a, &(y->a).b); // A2+B2
+    FP8_norm(&ta);
+    FP8_norm(&tb);
+    FP8_mul(&tc, &ta, &tb);         // (A1+B1)(A2+B2)
+    FP8_add(&t, &w1, &w2);
+    FP8_neg(&t, &t);
+    FP8_add(&tc, &tc, &t);          // (A1+B1)(A2+B2)-A1.A2-B1*B2 =  (A1.B2+A2.B1)
+
+    FP8_add(&ta, &(w->a).a, &(w->b).a); // A1+C1
+    FP8_add(&tb, &(y->a).a, &(y->b).a); // A2+C2
+    FP8_norm(&ta);
+    FP8_norm(&tb);
+    FP8_mul(&td, &ta, &tb);         // (A1+C1)(A2+C2)
+    FP8_add(&t, &w1, &w3);
+    FP8_neg(&t, &t);
+    FP8_add(&td, &td, &t);          // (A1+C1)(A2+C2)-A1.A2-C1*C2 =  (A1.C2+A2.C1)
+
+    FP8_add(&ta, &(w->a).b, &(w->b).a); // B1+C1
+    FP8_add(&tb, &(y->a).b, &(y->b).a); // B2+C2
+    FP8_norm(&ta);
+    FP8_norm(&tb);
+    FP8_mul(&te, &ta, &tb);         // (B1+C1)(B2+C2)
+    FP8_add(&t, &w2, &w3);
+    FP8_neg(&t, &t);
+    FP8_add(&te, &te, &t);          // (B1+C1)(B2+C2)-B1.B2-C1*C2 =  (B1.C2+B2.C1)
+
+    FP8_times_i(&w2);
+    FP8_add(&w1, &w1, &w2);
+    FP16_from_FP8s(&(w->a), &w1, &tc);
+    FP16_from_FP8s(&(w->b), &td, &te); // only norm these 2
+    FP16_from_FP8(&(w->c), &w3);
+
+    FP16_norm(&(w->a));
+    FP16_norm(&(w->b));
+#endif
+#if SEXTIC_TWIST_ZZZ == M_TYPE
+    FP8_mul(&w1, &(w->a).a, &(y->a).a); // A1.A2
+    FP8_mul(&w2, &(w->a).b, &(y->a).b); // B1.B2
+
+    if (y->type == FP_SPARSEST || w->type == FP_SPARSEST)
+    {
+        if (y->type == FP_SPARSEST && w->type == FP_SPARSEST)
+        {
+            FP8_zero(&w3);
+            FP_mul(&w3.a.a.a, &(w->c).b.a.a.a, &(y->c).b.a.a.a);
+        } else {
+            if (y->type != FP_SPARSEST)
+                FP8_tmul(&w3, &(y->c).b, &(w->c).b.a.a.a);
+            if (w->type != FP_SPARSEST)
+                FP8_tmul(&w3, &(w->c).b, &(y->c).b.a.a.a);
+        }
+    }
+    else
+        FP8_mul(&w3, &(w->c).b, &(y->c).b); // F1.F2
+
+    FP8_add(&ta, &(w->a).a, &(w->a).b); // A1+B1
+    FP8_add(&tb, &(y->a).a, &(y->a).b); // A2+B2
+    FP8_norm(&ta);
+    FP8_norm(&tb);
+    FP8_mul(&tc, &ta, &tb);         // (A1+B1)(A2+B2)
+    FP8_add(&t, &w1, &w2);
+    FP8_neg(&t, &t);
+    FP8_add(&tc, &tc, &t);          // (A1+B1)(A2+B2)-A1.A2-B1*B2 =  (A1.B2+A2.B1)
+
+    FP8_add(&ta, &(w->a).a, &(w->c).b); // A1+F1
+    FP8_add(&tb, &(y->a).a, &(y->c).b); // A2+F2
+    FP8_norm(&ta);
+    FP8_norm(&tb);
+    FP8_mul(&td, &ta, &tb);         // (A1+F1)(A2+F2)
+    FP8_add(&t, &w1, &w3);
+    FP8_neg(&t, &t);
+    FP8_add(&td, &td, &t);          // (A1+F1)(A2+F2)-A1.A2-F1*F2 =  (A1.F2+A2.F1)
+
+    FP8_add(&ta, &(w->a).b, &(w->c).b); // B1+F1
+    FP8_add(&tb, &(y->a).b, &(y->c).b); // B2+F2
+    FP8_norm(&ta);
+    FP8_norm(&tb);
+    FP8_mul(&te, &ta, &tb);         // (B1+F1)(B2+F2)
+    FP8_add(&t, &w2, &w3);
+    FP8_neg(&t, &t);
+    FP8_add(&te, &te, &t);          // (B1+F1)(B2+F2)-B1.B2-F1*F2 =  (B1.F2+B2.F1)
+
+    FP8_times_i(&w2);
+    FP8_add(&w1, &w1, &w2);
+    FP16_from_FP8s(&(w->a), &w1, &tc);
+
+    FP8_times_i(&w3);
+    FP8_norm(&w3);
+    FP16_from_FP8H(&(w->b), &w3);
+
+    FP8_norm(&te);
+    FP8_times_i(&te);
+    FP16_from_FP8s(&(w->c), &te, &td);
+
+    FP16_norm(&(w->a));
+    FP16_norm(&(w->c));
+#endif
+
+    w->type = FP_SPARSE;
+}
+
+/* Set w=1/x */
+/* SU= 600 */
+void YYY::FP48_inv(FP48 *w, FP48 *x)
+{
+    FP16 f0, f1, f2, f3;
+
+    FP16_sqr(&f0, &(x->a));
+    FP16_mul(&f1, &(x->b), &(x->c));
+    FP16_times_i(&f1);
+    FP16_sub(&f0, &f0, &f1); /* y.a */
+    FP16_norm(&f0);
+
+    FP16_sqr(&f1, &(x->c));
+    FP16_times_i(&f1);
+    FP16_mul(&f2, &(x->a), &(x->b));
+    FP16_sub(&f1, &f1, &f2); /* y.b */
+    FP16_norm(&f1);
+
+    FP16_sqr(&f2, &(x->b));
+    FP16_mul(&f3, &(x->a), &(x->c));
+    FP16_sub(&f2, &f2, &f3); /* y.c */
+    FP16_norm(&f2);
+
+    FP16_mul(&f3, &(x->b), &f2);
+    FP16_times_i(&f3);
+    FP16_mul(&(w->a), &f0, &(x->a));
+    FP16_add(&f3, &(w->a), &f3);
+    FP16_mul(&(w->c), &f1, &(x->c));
+    FP16_times_i(&(w->c));
+
+    FP16_add(&f3, &(w->c), &f3);
+    FP16_norm(&f3);
+
+    FP16_inv(&f3, &f3);
+    FP16_mul(&(w->a), &f0, &f3);
+    FP16_mul(&(w->b), &f1, &f3);
+    FP16_mul(&(w->c), &f2, &f3);
+    w->type = FP_DENSE;
+}
+
+/* constant time powering by small integer of max length bts */
+
+void YYY::FP48_pinpow(FP48 *r, int e, int bts)
+{
+    int i, b;
+    FP48 R[2];
+
+    FP48_one(&R[0]);
+    FP48_copy(&R[1], r);
+
+    for (i = bts - 1; i >= 0; i--)
+    {
+        b = (e >> i) & 1;
+        FP48_mul(&R[1 - b], &R[b]);
+        FP48_usqr(&R[b], &R[b]);
+    }
+    FP48_copy(r, &R[0]);
+}
+
+/* Compressed powering of unitary elements y=x^(e mod r) */
+/*
+void YYY::FP48_compow(FP16 *c, FP48 *x, BIG e, BIG r)
+{
+    FP48 g1, g2;
+    FP16 cp, cpm1, cpm2;
+    FP2 f;
+    BIG q, a, b, m;
+
+    BIG_rcopy(a, Fra);
+    BIG_rcopy(b, Frb);
+    FP2_from_BIGs(&f, a, b);
+
+    BIG_rcopy(q, Modulus);
+
+    FP48_copy(&g1, x);
+    FP48_copy(&g2, x);
+
+    BIG_copy(m, q);
+    BIG_mod(m, r);
+
+    BIG_copy(a, e);
+    BIG_mod(a, m);
+
+    BIG_copy(b, e);
+    BIG_sdiv(b, m);
+
+    FP48_trace(c, &g1);
+
+    if (BIG_iszilch(b))
+    {
+        FP16_xtr_pow(c, c, e);
+        return;
+    }
+
+    FP48_frob(&g2, &f, 1);
+    FP48_trace(&cp, &g2);
+    FP48_conj(&g1, &g1);
+    FP48_mul(&g2, &g1);
+    FP48_trace(&cpm1, &g2);
+    FP48_mul(&g2, &g1);
+
+    FP48_trace(&cpm2, &g2);
+
+    FP16_xtr_pow2(c, &cp, c, &cpm1, &cpm2, a, b);
+
+}
+*/
+/* Note this is simple square and multiply, so not side-channel safe */
+
+void YYY::FP48_pow(FP48 *r, FP48 *a, BIG b)
+{
+    FP48 w, sf;
+    BIG b1, b3;
+    int i, nb, bt;
+    BIG_copy(b1, b);
+    BIG_norm(b1);
+    BIG_pmul(b3, b1, 3);
+    BIG_norm(b3);
+
+    FP48_copy(&sf, a);
+    FP48_norm(&sf);
+    FP48_copy(&w, &sf);
+
+    if (BIG_iszilch(b3))
+    {
+        FP48_one(r);
+        return;
+    }
+
+    nb = BIG_nbits(b3);
+    for (i = nb - 2; i >= 1; i--)
+    {
+        FP48_usqr(&w, &w);
+        bt = BIG_bit(b3, i) - BIG_bit(b1, i);
+        if (bt == 1)
+            FP48_mul(&w, &sf);
+        if (bt == -1)
+        {
+            FP48_conj(&sf, &sf);
+            FP48_mul(&w, &sf);
+            FP48_conj(&sf, &sf);
+        }
+    }
+
+    FP48_copy(r, &w);
+    FP48_reduce(r);
+}
+
+/* p=q0^u0.q1^u1.q2^u2.q3^u3... */
+/* Side channel attack secure */
+// Bos & Costello https://eprint.iacr.org/2013/458.pdf
+// Faz-Hernandez & Longa & Sanchez  https://eprint.iacr.org/2013/158.pdf
+
+void YYY::FP48_pow16(FP48 *p, FP48 *q, BIG u[16])
+{
+    int i, j, k, nb, pb1, pb2, pb3, pb4, bt;
+    FP48 g1[8], g2[8], g3[8], g4[8], r;
+    BIG t[16], mt;
+    sign8 w1[NLEN_XXX * BASEBITS_XXX + 1];
+    sign8 s1[NLEN_XXX * BASEBITS_XXX + 1];
+    sign8 w2[NLEN_XXX * BASEBITS_XXX + 1];
+    sign8 s2[NLEN_XXX * BASEBITS_XXX + 1];
+    sign8 w3[NLEN_XXX * BASEBITS_XXX + 1];
+    sign8 s3[NLEN_XXX * BASEBITS_XXX + 1];
+    sign8 w4[NLEN_XXX * BASEBITS_XXX + 1];
+    sign8 s4[NLEN_XXX * BASEBITS_XXX + 1];
+
+    for (i = 0; i < 16; i++)
+        BIG_copy(t[i], u[i]);
+
+// Precomputed tables
+    FP48_copy(&g1[0], &q[0]); // q[0]
+    FP48_copy(&g1[1], &g1[0]);
+    FP48_mul(&g1[1], &q[1]); // q[0].q[1]
+    FP48_copy(&g1[2], &g1[0]);
+    FP48_mul(&g1[2], &q[2]); // q[0].q[2]
+    FP48_copy(&g1[3], &g1[1]);
+    FP48_mul(&g1[3], &q[2]); // q[0].q[1].q[2]
+    FP48_copy(&g1[4], &g1[0]);
+    FP48_mul(&g1[4], &q[3]); // q[0].q[3]
+    FP48_copy(&g1[5], &g1[1]);
+    FP48_mul(&g1[5], &q[3]); // q[0].q[1].q[3]
+    FP48_copy(&g1[6], &g1[2]);
+    FP48_mul(&g1[6], &q[3]); // q[0].q[2].q[3]
+    FP48_copy(&g1[7], &g1[3]);
+    FP48_mul(&g1[7], &q[3]); // q[0].q[1].q[2].q[3]
+
+    FP48_copy(&g2[0], &q[4]); // q[0]
+    FP48_copy(&g2[1], &g2[0]);
+    FP48_mul(&g2[1], &q[5]); // q[0].q[1]
+    FP48_copy(&g2[2], &g2[0]);
+    FP48_mul(&g2[2], &q[6]); // q[0].q[2]
+    FP48_copy(&g2[3], &g2[1]);
+    FP48_mul(&g2[3], &q[6]); // q[0].q[1].q[2]
+    FP48_copy(&g2[4], &g2[0]);
+    FP48_mul(&g2[4], &q[7]); // q[0].q[3]
+    FP48_copy(&g2[5], &g2[1]);
+    FP48_mul(&g2[5], &q[7]); // q[0].q[1].q[3]
+    FP48_copy(&g2[6], &g2[2]);
+    FP48_mul(&g2[6], &q[7]); // q[0].q[2].q[3]
+    FP48_copy(&g2[7], &g2[3]);
+    FP48_mul(&g2[7], &q[7]); // q[0].q[1].q[2].q[3]
+
+    FP48_copy(&g3[0], &q[8]); // q[0]
+    FP48_copy(&g3[1], &g3[0]);
+    FP48_mul(&g3[1], &q[9]); // q[0].q[1]
+    FP48_copy(&g3[2], &g3[0]);
+    FP48_mul(&g3[2], &q[10]);   // q[0].q[2]
+    FP48_copy(&g3[3], &g3[1]);
+    FP48_mul(&g3[3], &q[10]);   // q[0].q[1].q[2]
+    FP48_copy(&g3[4], &g3[0]);
+    FP48_mul(&g3[4], &q[11]); // q[0].q[3]
+    FP48_copy(&g3[5], &g3[1]);
+    FP48_mul(&g3[5], &q[11]);   // q[0].q[1].q[3]
+    FP48_copy(&g3[6], &g3[2]);
+    FP48_mul(&g3[6], &q[11]);   // q[0].q[2].q[3]
+    FP48_copy(&g3[7], &g3[3]);
+    FP48_mul(&g3[7], &q[11]);   // q[0].q[1].q[2].q[3]
+
+    FP48_copy(&g4[0], &q[12]); // q[0]
+    FP48_copy(&g4[1], &g4[0]);
+    FP48_mul(&g4[1], &q[13]);   // q[0].q[1]
+    FP48_copy(&g4[2], &g4[0]);
+    FP48_mul(&g4[2], &q[14]);   // q[0].q[2]
+    FP48_copy(&g4[3], &g4[1]);
+    FP48_mul(&g4[3], &q[14]);   // q[0].q[1].q[2]
+    FP48_copy(&g4[4], &g4[0]);
+    FP48_mul(&g4[4], &q[15]); // q[0].q[3]
+    FP48_copy(&g4[5], &g4[1]);
+    FP48_mul(&g4[5], &q[15]);   // q[0].q[1].q[3]
+    FP48_copy(&g4[6], &g4[2]);
+    FP48_mul(&g4[6], &q[15]);   // q[0].q[2].q[3]
+    FP48_copy(&g4[7], &g4[3]);
+    FP48_mul(&g4[7], &q[15]);   // q[0].q[1].q[2].q[3]
+
+// Make them odd
+    pb1 = 1 - BIG_parity(t[0]);
+    BIG_inc(t[0], pb1);
+    BIG_norm(t[0]);
+
+    pb2 = 1 - BIG_parity(t[4]);
+    BIG_inc(t[4], pb2);
+    BIG_norm(t[4]);
+
+    pb3 = 1 - BIG_parity(t[8]);
+    BIG_inc(t[8], pb3);
+    BIG_norm(t[8]);
+
+    pb4 = 1 - BIG_parity(t[12]);
+    BIG_inc(t[12], pb4);
+    BIG_norm(t[12]);
+
+// Number of bits
+    BIG_zero(mt);
+    for (i = 0; i < 16; i++)
+    {
+        BIG_or(mt, mt, t[i]);
+    }
+    nb = 1 + BIG_nbits(mt);
+
+// Sign pivot
+    s1[nb - 1] = 1;
+    s2[nb - 1] = 1;
+    s3[nb - 1] = 1;
+    s4[nb - 1] = 1;
+    for (i = 0; i < nb - 1; i++)
+    {
+        BIG_fshr(t[0], 1);
+        s1[i] = 2 * BIG_parity(t[0]) - 1;
+        BIG_fshr(t[4], 1);
+        s2[i] = 2 * BIG_parity(t[4]) - 1;
+        BIG_fshr(t[8], 1);
+        s3[i] = 2 * BIG_parity(t[8]) - 1;
+        BIG_fshr(t[12], 1);
+        s4[i] = 2 * BIG_parity(t[12]) - 1;
+    }
+
+// Recoded exponents
+    for (i = 0; i < nb; i++)
+    {
+        w1[i] = 0;
+        k = 1;
+        for (j = 1; j < 4; j++)
+        {
+            bt = s1[i] * BIG_parity(t[j]);
+            BIG_fshr(t[j], 1);
+
+            BIG_dec(t[j], (bt >> 1));
+            BIG_norm(t[j]);
+            w1[i] += bt * k;
+            k *= 2;
+        }
+
+        w2[i] = 0;
+        k = 1;
+        for (j = 5; j < 8; j++)
+        {
+            bt = s2[i] * BIG_parity(t[j]);
+            BIG_fshr(t[j], 1);
+
+            BIG_dec(t[j], (bt >> 1));
+            BIG_norm(t[j]);
+            w2[i] += bt * k;
+            k *= 2;
+        }
+
+        w3[i] = 0;
+        k = 1;
+        for (j = 9; j < 12; j++)
+        {
+            bt = s3[i] * BIG_parity(t[j]);
+            BIG_fshr(t[j], 1);
+
+            BIG_dec(t[j], (bt >> 1));
+            BIG_norm(t[j]);
+            w3[i] += bt * k;
+            k *= 2;
+        }
+
+        w4[i] = 0;
+        k = 1;
+        for (j = 13; j < 16; j++)
+        {
+            bt = s4[i] * BIG_parity(t[j]);
+            BIG_fshr(t[j], 1);
+
+            BIG_dec(t[j], (bt >> 1));
+            BIG_norm(t[j]);
+            w4[i] += bt * k;
+            k *= 2;
+        }
+    }
+
+// Main loop
+    FP48_select(p, g1, 2 * w1[nb - 1] + 1);
+    FP48_select(&r, g2, 2 * w2[nb - 1] + 1);
+    FP48_mul(p, &r);
+    FP48_select(&r, g3, 2 * w3[nb - 1] + 1);
+    FP48_mul(p, &r);
+    FP48_select(&r, g4, 2 * w4[nb - 1] + 1);
+    FP48_mul(p, &r);
+    for (i = nb - 2; i >= 0; i--)
+    {
+        FP48_usqr(p, p);
+        FP48_select(&r, g1, 2 * w1[i] + s1[i]);
+        FP48_mul(p, &r);
+        FP48_select(&r, g2, 2 * w2[i] + s2[i]);
+        FP48_mul(p, &r);
+        FP48_select(&r, g3, 2 * w3[i] + s3[i]);
+        FP48_mul(p, &r);
+        FP48_select(&r, g4, 2 * w4[i] + s4[i]);
+        FP48_mul(p, &r);
+    }
+
+// apply correction
+    FP48_conj(&r, &q[0]);
+    FP48_mul(&r, p);
+    FP48_cmove(p, &r, pb1);
+    FP48_conj(&r, &q[4]);
+    FP48_mul(&r, p);
+    FP48_cmove(p, &r, pb2);
+
+    FP48_conj(&r, &q[8]);
+    FP48_mul(&r, p);
+    FP48_cmove(p, &r, pb3);
+    FP48_conj(&r, &q[12]);
+    FP48_mul(&r, p);
+    FP48_cmove(p, &r, pb4);
+
+    FP48_reduce(p);
+}
+
+/* Set w=w^p using Frobenius */
+/* SU= 160 */
+void YYY::FP48_frob(FP48 *w, FP2 *f, int n)
+{
+    int i;
+    FP8 X2, X4;
+    FP4 F;
+    FP2 f3, f2;             // f=(1+i)^(p-19)/24
+    FP2_sqr(&f2, f);    //
+    FP2_mul(&f3, &f2, f); // f3=f^3=(1+i)^(p-19)/8
+
+    FP2_mul_ip(&f3);
+    FP2_norm(&f3);
+    FP2_mul_ip(&f3);    // f3 = (1+i)^16/8.(1+i)^(p-19)/8 = (1+i)^(p-3)/8
+    FP2_norm(&f3);
+
+    for (i = 0; i < n; i++)
+    {
+        FP16_frob(&(w->a), &f3);  // a=a^p
+        FP16_frob(&(w->b), &f3);  // b=b^p
+        FP16_frob(&(w->c), &f3);  // c=c^p
+
+        FP16_qmul(&(w->b), &(w->b), f); FP16_times_i4(&(w->b)); FP16_times_i2(&(w->b));
+        FP16_qmul(&(w->c), &(w->c), &f2); FP16_times_i4(&(w->c)); FP16_times_i4(&(w->c)); FP16_times_i4(&(w->c));
+    }
+    w->type = FP_DENSE;
+}
+
+/* SU= 8 */
+/* normalise all components of w */
+void YYY::FP48_norm(FP48 *w)
+{
+    FP16_norm(&(w->a));
+    FP16_norm(&(w->b));
+    FP16_norm(&(w->c));
+}
+
+/* SU= 8 */
+/* reduce all components of w */
+void YYY::FP48_reduce(FP48 *w)
+{
+    FP16_reduce(&(w->a));
+    FP16_reduce(&(w->b));
+    FP16_reduce(&(w->c));
+}
+
+/* trace function w=trace(x) */
+/* SU= 8 */
+void YYY::FP48_trace(FP16 *w, FP48 *x)
+{
+    FP16_imul(w, &(x->a), 3);
+    FP16_reduce(w);
+}
+
+/* SU= 8 */
+/* Output w in hex */
+void YYY::FP48_output(FP48 *w)
+{
+    printf("[");
+    FP16_output(&(w->a));
+    printf(",");
+    FP16_output(&(w->b));
+    printf(",");
+    FP16_output(&(w->c));
+    printf("]");
+}
+
+/* Convert g to octet string w */
+void YYY::FP48_toOctet(octet *W, FP48 *g)
+{
+    W->len = 48 * MODBYTES_XXX;
+    FP16_toBytes(&(W->val[0]),&(g->c));
+    FP16_toBytes(&(W->val[16 * MODBYTES_XXX]),&(g->b));
+    FP16_toBytes(&(W->val[32 * MODBYTES_XXX]),&(g->a));
+}
+
+/* Restore g from octet string w */
+void YYY::FP48_fromOctet(FP48 *g, octet *W)
+{
+    FP16_fromBytes(&(g->c),&(W->val[0]));
+    FP16_fromBytes(&(g->b),&(W->val[16 * MODBYTES_XXX]));
+    FP16_fromBytes(&(g->a),&(W->val[32 * MODBYTES_XXX]));
+}
+
+/* Move b to a if d=1 */
+void YYY::FP48_cmove(FP48 *f, FP48 *g, int d)
+{
+    FP16_cmove(&(f->a), &(g->a), d);
+    FP16_cmove(&(f->b), &(g->b), d);
+    FP16_cmove(&(f->c), &(g->c), d);
+    d = ~(d - 1);
+    f->type ^= (f->type ^ g->type)&d;
+}
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp48.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp48.h
new file mode 100644
index 0000000..b1095f9
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp48.h
@@ -0,0 +1,231 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP48_YYY_H
+#define FP48_YYY_H
+
+#include "fp16_YYY.h"
+
+using namespace core;
+
+namespace YYY {
+/**
+	@brief FP12 Structure - towered over three FP16
+*/
+
+typedef struct
+{
+    FP16 a; /**< first part of FP12 */
+    FP16 b; /**< second part of FP12 */
+    FP16 c; /**< third part of FP12 */
+    int type;
+} FP48;
+
+extern const XXX::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const XXX::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+/* FP48 prototypes */
+/**	@brief Tests for FP48 equal to zero
+ *
+	@param x FP48 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP48_iszilch(FP48 *x);
+/**	@brief Tests for FP48 equal to unity
+ *
+	@param x FP48 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP48_isunity(FP48 *x);
+/**	@brief Copy FP48 to another FP48
+ *
+	@param x FP48 instance, on exit = y
+	@param y FP48 instance to be copied
+ */
+extern void FP48_copy(FP48 *x, FP48 *y);
+/**	@brief Set FP48 to unity
+ *
+	@param x FP48 instance to be set to one
+ */
+extern void FP48_one(FP48 *x);
+
+/**	@brief Set FP48 to zero
+ *
+	@param x FP48 instance to be set to zero
+ */
+extern void FP48_zero(FP48 *x);
+
+/**	@brief Tests for equality of two FP48s
+ *
+	@param x FP48 instance to be compared
+	@param y FP48 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP48_equals(FP48 *x, FP48 *y);
+/**	@brief Conjugation of FP48
+ *
+	If y=(a,b,c) (where a,b,c are its three FP16 components) on exit x=(conj(a),-conj(b),conj(c))
+	@param x FP48 instance, on exit = conj(y)
+	@param y FP48 instance
+ */
+extern void FP48_conj(FP48 *x, FP48 *y);
+/**	@brief Initialise FP48 from single FP16
+ *
+	Sets first FP16 component of an FP48, other components set to zero
+	@param x FP48 instance to be initialised
+	@param a FP16 to form first part of FP48
+ */
+extern void FP48_from_FP16(FP48 *x, FP16 *a);
+/**	@brief Initialise FP48 from three FP16s
+ *
+	@param x FP48 instance to be initialised
+	@param a FP16 to form first part of FP48
+	@param b FP16 to form second part of FP48
+	@param c FP16 to form third part of FP48
+ */
+extern void FP48_from_FP16s(FP48 *x, FP16 *a, FP16* b, FP16 *c);
+/**	@brief Fast Squaring of an FP48 in "unitary" form
+ *
+	@param x FP48 instance, on exit = y^2
+	@param y FP16 instance, must be unitary
+ */
+extern void FP48_usqr(FP48 *x, FP48 *y);
+/**	@brief Squaring an FP48
+ *
+	@param x FP48 instance, on exit = y^2
+	@param y FP48 instance
+ */
+extern void FP48_sqr(FP48 *x, FP48 *y);
+/**	@brief Fast multiplication of two sparse FP24s that arises from ATE pairing line functions
+ *
+	@param x FP48 instance, on exit = x*y
+	@param y FP48 instance, of special form
+ */
+extern void FP48_smul(FP48 *x, FP48 *y);
+
+/**	@brief Fast multiplication of what may be sparse multiplicands
+ *
+	@param x FP48 instance, on exit = x*y
+	@param y FP48 instance, of special form
+ */
+extern void FP48_ssmul(FP48 *x, FP48 *y);
+/**	@brief Full unconditional Multiplication of two FP24s
+ *
+	@param x FP48 instance, on exit = x*y
+	@param y FP48 instance, the multiplier
+ */
+extern void FP48_mul(FP48 *x, FP48 *y);
+/**	@brief Inverting an FP48
+ *
+	@param x FP48 instance, on exit = 1/y
+	@param y FP48 instance
+ */
+extern void FP48_inv(FP48 *x, FP48 *y);
+/**	@brief Raises an FP48 to the power of a BIG
+ *
+	@param r FP48 instance, on exit = y^b
+	@param x FP48 instance
+	@param b BIG number
+ */
+extern void FP48_pow(FP48 *r, FP48 *x, XXX::BIG b);
+
+//extern void FP48_ppow(FP48 *r,FP48 *x,XXX::BIG b);
+
+/**	@brief Raises an FP48 instance x to a small integer power, side-channel resistant
+ *
+	@param x FP48 instance, on exit = x^i
+	@param i small integer exponent
+	@param b maximum number of bits in exponent
+ */
+extern void FP48_pinpow(FP48 *x, int i, int b);
+
+/**	@brief Raises an FP48 instance x to a BIG power, compressed to FP16
+ *
+	@param c FP16 instance, on exit = x^(e mod r) as FP16
+	@param x FP48 input
+	@param e BIG exponent
+	@param r BIG group order
+ */
+extern void FP48_compow(FP16 *c, FP48 *x, XXX::BIG e, XXX::BIG r);
+
+/**	@brief Calculate Pi x[i]^b[i] for i=0 to 15, side-channel resistant
+ *
+	@param r FP48 instance, on exit = Pi x[i]^b[i] for i=0 to 15
+	@param x FP48 array with 16 FP48s
+	@param b BIG array of 16 exponents
+ */
+extern void FP48_pow16(FP48 *r, FP48 *x, XXX::BIG *b);
+
+
+/**	@brief Raises an FP48 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP48 instance, on exit = x^p^n
+	@param f FP2 precalculated Frobenius constant
+	@param n power of p
+ */
+extern void FP48_frob(FP48 *x, FP2 *f, int n);
+
+/**	@brief Reduces all components of possibly unreduced FP48 mod Modulus
+ *
+	@param x FP48 instance, on exit reduced mod Modulus
+ */
+extern void FP48_reduce(FP48 *x);
+/**	@brief Normalises the components of an FP48
+ *
+	@param x FP48 instance to be normalised
+ */
+extern void FP48_norm(FP48 *x);
+/**	@brief Formats and outputs an FP48 to the console
+ *
+	@param x FP48 instance to be printed
+ */
+extern void FP48_output(FP48 *x);
+/**	@brief Formats and outputs an FP48 instance to an octet string
+ *
+	Serializes the components of an FP48 to big-endian base 256 form.
+	@param S output octet string
+	@param x FP48 instance to be converted to an octet string
+ */
+extern void FP48_toOctet(octet *S, FP48 *x);
+/**	@brief Creates an FP48 instance from an octet string
+ *
+	De-serializes the components of an FP48 to create an FP48 from big-endian base 256 components.
+	@param x FP48 instance to be created from an octet string
+	@param S input octet string
+
+ */
+extern void FP48_fromOctet(FP48 *x, octet *S);
+/**	@brief Calculate the trace of an FP48
+ *
+	@param t FP16 trace of x, on exit = tr(x)
+	@param x FP48 instance
+
+ */
+extern void FP48_trace(FP16 *t, FP48 *x);
+
+/**	@brief Conditional copy of FP48 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP48 instance, set to y if s!=0
+	@param y another FP48 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP48_cmove(FP48 *x, FP48 *y, int s);
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp48_BLS48286.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp48_BLS48286.h
new file mode 100644
index 0000000..3179845
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp48_BLS48286.h
@@ -0,0 +1,231 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP48_BLS48286_H
+#define FP48_BLS48286_H
+
+#include "fp16_BLS48286.h"
+
+using namespace core;
+
+namespace BLS48286 {
+/**
+	@brief FP12 Structure - towered over three FP16
+*/
+
+typedef struct
+{
+    FP16 a; /**< first part of FP12 */
+    FP16 b; /**< second part of FP12 */
+    FP16 c; /**< third part of FP12 */
+    int type;
+} FP48;
+
+extern const B288_60::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B288_60::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+/* FP48 prototypes */
+/**	@brief Tests for FP48 equal to zero
+ *
+	@param x FP48 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP48_iszilch(FP48 *x);
+/**	@brief Tests for FP48 equal to unity
+ *
+	@param x FP48 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP48_isunity(FP48 *x);
+/**	@brief Copy FP48 to another FP48
+ *
+	@param x FP48 instance, on exit = y
+	@param y FP48 instance to be copied
+ */
+extern void FP48_copy(FP48 *x, FP48 *y);
+/**	@brief Set FP48 to unity
+ *
+	@param x FP48 instance to be set to one
+ */
+extern void FP48_one(FP48 *x);
+
+/**	@brief Set FP48 to zero
+ *
+	@param x FP48 instance to be set to zero
+ */
+extern void FP48_zero(FP48 *x);
+
+/**	@brief Tests for equality of two FP48s
+ *
+	@param x FP48 instance to be compared
+	@param y FP48 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP48_equals(FP48 *x, FP48 *y);
+/**	@brief Conjugation of FP48
+ *
+	If y=(a,b,c) (where a,b,c are its three FP16 components) on exit x=(conj(a),-conj(b),conj(c))
+	@param x FP48 instance, on exit = conj(y)
+	@param y FP48 instance
+ */
+extern void FP48_conj(FP48 *x, FP48 *y);
+/**	@brief Initialise FP48 from single FP16
+ *
+	Sets first FP16 component of an FP48, other components set to zero
+	@param x FP48 instance to be initialised
+	@param a FP16 to form first part of FP48
+ */
+extern void FP48_from_FP16(FP48 *x, FP16 *a);
+/**	@brief Initialise FP48 from three FP16s
+ *
+	@param x FP48 instance to be initialised
+	@param a FP16 to form first part of FP48
+	@param b FP16 to form second part of FP48
+	@param c FP16 to form third part of FP48
+ */
+extern void FP48_from_FP16s(FP48 *x, FP16 *a, FP16* b, FP16 *c);
+/**	@brief Fast Squaring of an FP48 in "unitary" form
+ *
+	@param x FP48 instance, on exit = y^2
+	@param y FP16 instance, must be unitary
+ */
+extern void FP48_usqr(FP48 *x, FP48 *y);
+/**	@brief Squaring an FP48
+ *
+	@param x FP48 instance, on exit = y^2
+	@param y FP48 instance
+ */
+extern void FP48_sqr(FP48 *x, FP48 *y);
+/**	@brief Fast multiplication of two sparse FP24s that arises from ATE pairing line functions
+ *
+	@param x FP48 instance, on exit = x*y
+	@param y FP48 instance, of special form
+ */
+extern void FP48_smul(FP48 *x, FP48 *y);
+
+/**	@brief Fast multiplication of what may be sparse multiplicands
+ *
+	@param x FP48 instance, on exit = x*y
+	@param y FP48 instance, of special form
+ */
+extern void FP48_ssmul(FP48 *x, FP48 *y);
+/**	@brief Full unconditional Multiplication of two FP24s
+ *
+	@param x FP48 instance, on exit = x*y
+	@param y FP48 instance, the multiplier
+ */
+extern void FP48_mul(FP48 *x, FP48 *y);
+/**	@brief Inverting an FP48
+ *
+	@param x FP48 instance, on exit = 1/y
+	@param y FP48 instance
+ */
+extern void FP48_inv(FP48 *x, FP48 *y);
+/**	@brief Raises an FP48 to the power of a BIG
+ *
+	@param r FP48 instance, on exit = y^b
+	@param x FP48 instance
+	@param b BIG number
+ */
+extern void FP48_pow(FP48 *r, FP48 *x, B288_60::BIG b);
+
+//extern void FP48_ppow(FP48 *r,FP48 *x,B288_60::BIG b);
+
+/**	@brief Raises an FP48 instance x to a small integer power, side-channel resistant
+ *
+	@param x FP48 instance, on exit = x^i
+	@param i small integer exponent
+	@param b maximum number of bits in exponent
+ */
+extern void FP48_pinpow(FP48 *x, int i, int b);
+
+/**	@brief Raises an FP48 instance x to a BIG power, compressed to FP16
+ *
+	@param c FP16 instance, on exit = x^(e mod r) as FP16
+	@param x FP48 input
+	@param e BIG exponent
+	@param r BIG group order
+ */
+extern void FP48_compow(FP16 *c, FP48 *x, B288_60::BIG e, B288_60::BIG r);
+
+/**	@brief Calculate Pi x[i]^b[i] for i=0 to 15, side-channel resistant
+ *
+	@param r FP48 instance, on exit = Pi x[i]^b[i] for i=0 to 15
+	@param x FP48 array with 16 FP48s
+	@param b BIG array of 16 exponents
+ */
+extern void FP48_pow16(FP48 *r, FP48 *x, B288_60::BIG *b);
+
+
+/**	@brief Raises an FP48 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP48 instance, on exit = x^p^n
+	@param f FP2 precalculated Frobenius constant
+	@param n power of p
+ */
+extern void FP48_frob(FP48 *x, FP2 *f, int n);
+
+/**	@brief Reduces all components of possibly unreduced FP48 mod Modulus
+ *
+	@param x FP48 instance, on exit reduced mod Modulus
+ */
+extern void FP48_reduce(FP48 *x);
+/**	@brief Normalises the components of an FP48
+ *
+	@param x FP48 instance to be normalised
+ */
+extern void FP48_norm(FP48 *x);
+/**	@brief Formats and outputs an FP48 to the console
+ *
+	@param x FP48 instance to be printed
+ */
+extern void FP48_output(FP48 *x);
+/**	@brief Formats and outputs an FP48 instance to an octet string
+ *
+	Serializes the components of an FP48 to big-endian base 256 form.
+	@param S output octet string
+	@param x FP48 instance to be converted to an octet string
+ */
+extern void FP48_toOctet(octet *S, FP48 *x);
+/**	@brief Creates an FP48 instance from an octet string
+ *
+	De-serializes the components of an FP48 to create an FP48 from big-endian base 256 components.
+	@param x FP48 instance to be created from an octet string
+	@param S input octet string
+
+ */
+extern void FP48_fromOctet(FP48 *x, octet *S);
+/**	@brief Calculate the trace of an FP48
+ *
+	@param t FP16 trace of x, on exit = tr(x)
+	@param x FP48 instance
+
+ */
+extern void FP48_trace(FP16 *t, FP48 *x);
+
+/**	@brief Conditional copy of FP48 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP48 instance, set to y if s!=0
+	@param y another FP48 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP48_cmove(FP48 *x, FP48 *y, int s);
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp48_BLS48556.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp48_BLS48556.h
new file mode 100644
index 0000000..c473883
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp48_BLS48556.h
@@ -0,0 +1,231 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP48_BLS48556_H
+#define FP48_BLS48556_H
+
+#include "fp16_BLS48556.h"
+
+using namespace core;
+
+namespace BLS48556 {
+/**
+	@brief FP12 Structure - towered over three FP16
+*/
+
+typedef struct
+{
+    FP16 a; /**< first part of FP12 */
+    FP16 b; /**< second part of FP12 */
+    FP16 c; /**< third part of FP12 */
+    int type;
+} FP48;
+
+extern const B560_58::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B560_58::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+/* FP48 prototypes */
+/**	@brief Tests for FP48 equal to zero
+ *
+	@param x FP48 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP48_iszilch(FP48 *x);
+/**	@brief Tests for FP48 equal to unity
+ *
+	@param x FP48 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP48_isunity(FP48 *x);
+/**	@brief Copy FP48 to another FP48
+ *
+	@param x FP48 instance, on exit = y
+	@param y FP48 instance to be copied
+ */
+extern void FP48_copy(FP48 *x, FP48 *y);
+/**	@brief Set FP48 to unity
+ *
+	@param x FP48 instance to be set to one
+ */
+extern void FP48_one(FP48 *x);
+
+/**	@brief Set FP48 to zero
+ *
+	@param x FP48 instance to be set to zero
+ */
+extern void FP48_zero(FP48 *x);
+
+/**	@brief Tests for equality of two FP48s
+ *
+	@param x FP48 instance to be compared
+	@param y FP48 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP48_equals(FP48 *x, FP48 *y);
+/**	@brief Conjugation of FP48
+ *
+	If y=(a,b,c) (where a,b,c are its three FP16 components) on exit x=(conj(a),-conj(b),conj(c))
+	@param x FP48 instance, on exit = conj(y)
+	@param y FP48 instance
+ */
+extern void FP48_conj(FP48 *x, FP48 *y);
+/**	@brief Initialise FP48 from single FP16
+ *
+	Sets first FP16 component of an FP48, other components set to zero
+	@param x FP48 instance to be initialised
+	@param a FP16 to form first part of FP48
+ */
+extern void FP48_from_FP16(FP48 *x, FP16 *a);
+/**	@brief Initialise FP48 from three FP16s
+ *
+	@param x FP48 instance to be initialised
+	@param a FP16 to form first part of FP48
+	@param b FP16 to form second part of FP48
+	@param c FP16 to form third part of FP48
+ */
+extern void FP48_from_FP16s(FP48 *x, FP16 *a, FP16* b, FP16 *c);
+/**	@brief Fast Squaring of an FP48 in "unitary" form
+ *
+	@param x FP48 instance, on exit = y^2
+	@param y FP16 instance, must be unitary
+ */
+extern void FP48_usqr(FP48 *x, FP48 *y);
+/**	@brief Squaring an FP48
+ *
+	@param x FP48 instance, on exit = y^2
+	@param y FP48 instance
+ */
+extern void FP48_sqr(FP48 *x, FP48 *y);
+/**	@brief Fast multiplication of two sparse FP24s that arises from ATE pairing line functions
+ *
+	@param x FP48 instance, on exit = x*y
+	@param y FP48 instance, of special form
+ */
+extern void FP48_smul(FP48 *x, FP48 *y);
+
+/**	@brief Fast multiplication of what may be sparse multiplicands
+ *
+	@param x FP48 instance, on exit = x*y
+	@param y FP48 instance, of special form
+ */
+extern void FP48_ssmul(FP48 *x, FP48 *y);
+/**	@brief Full unconditional Multiplication of two FP24s
+ *
+	@param x FP48 instance, on exit = x*y
+	@param y FP48 instance, the multiplier
+ */
+extern void FP48_mul(FP48 *x, FP48 *y);
+/**	@brief Inverting an FP48
+ *
+	@param x FP48 instance, on exit = 1/y
+	@param y FP48 instance
+ */
+extern void FP48_inv(FP48 *x, FP48 *y);
+/**	@brief Raises an FP48 to the power of a BIG
+ *
+	@param r FP48 instance, on exit = y^b
+	@param x FP48 instance
+	@param b BIG number
+ */
+extern void FP48_pow(FP48 *r, FP48 *x, B560_58::BIG b);
+
+//extern void FP48_ppow(FP48 *r,FP48 *x,B560_58::BIG b);
+
+/**	@brief Raises an FP48 instance x to a small integer power, side-channel resistant
+ *
+	@param x FP48 instance, on exit = x^i
+	@param i small integer exponent
+	@param b maximum number of bits in exponent
+ */
+extern void FP48_pinpow(FP48 *x, int i, int b);
+
+/**	@brief Raises an FP48 instance x to a BIG power, compressed to FP16
+ *
+	@param c FP16 instance, on exit = x^(e mod r) as FP16
+	@param x FP48 input
+	@param e BIG exponent
+	@param r BIG group order
+ */
+extern void FP48_compow(FP16 *c, FP48 *x, B560_58::BIG e, B560_58::BIG r);
+
+/**	@brief Calculate Pi x[i]^b[i] for i=0 to 15, side-channel resistant
+ *
+	@param r FP48 instance, on exit = Pi x[i]^b[i] for i=0 to 15
+	@param x FP48 array with 16 FP48s
+	@param b BIG array of 16 exponents
+ */
+extern void FP48_pow16(FP48 *r, FP48 *x, B560_58::BIG *b);
+
+
+/**	@brief Raises an FP48 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP48 instance, on exit = x^p^n
+	@param f FP2 precalculated Frobenius constant
+	@param n power of p
+ */
+extern void FP48_frob(FP48 *x, FP2 *f, int n);
+
+/**	@brief Reduces all components of possibly unreduced FP48 mod Modulus
+ *
+	@param x FP48 instance, on exit reduced mod Modulus
+ */
+extern void FP48_reduce(FP48 *x);
+/**	@brief Normalises the components of an FP48
+ *
+	@param x FP48 instance to be normalised
+ */
+extern void FP48_norm(FP48 *x);
+/**	@brief Formats and outputs an FP48 to the console
+ *
+	@param x FP48 instance to be printed
+ */
+extern void FP48_output(FP48 *x);
+/**	@brief Formats and outputs an FP48 instance to an octet string
+ *
+	Serializes the components of an FP48 to big-endian base 256 form.
+	@param S output octet string
+	@param x FP48 instance to be converted to an octet string
+ */
+extern void FP48_toOctet(octet *S, FP48 *x);
+/**	@brief Creates an FP48 instance from an octet string
+ *
+	De-serializes the components of an FP48 to create an FP48 from big-endian base 256 components.
+	@param x FP48 instance to be created from an octet string
+	@param S input octet string
+
+ */
+extern void FP48_fromOctet(FP48 *x, octet *S);
+/**	@brief Calculate the trace of an FP48
+ *
+	@param t FP16 trace of x, on exit = tr(x)
+	@param x FP48 instance
+
+ */
+extern void FP48_trace(FP16 *t, FP48 *x);
+
+/**	@brief Conditional copy of FP48 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP48 instance, set to y if s!=0
+	@param y another FP48 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP48_cmove(FP48 *x, FP48 *y, int s);
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp48_BLS48581.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp48_BLS48581.h
new file mode 100644
index 0000000..c00bcd1
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp48_BLS48581.h
@@ -0,0 +1,231 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP48_BLS48581_H
+#define FP48_BLS48581_H
+
+#include "fp16_BLS48581.h"
+
+using namespace core;
+
+namespace BLS48581 {
+/**
+	@brief FP12 Structure - towered over three FP16
+*/
+
+typedef struct
+{
+    FP16 a; /**< first part of FP12 */
+    FP16 b; /**< second part of FP12 */
+    FP16 c; /**< third part of FP12 */
+    int type;
+} FP48;
+
+extern const B584_60::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B584_60::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+/* FP48 prototypes */
+/**	@brief Tests for FP48 equal to zero
+ *
+	@param x FP48 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP48_iszilch(FP48 *x);
+/**	@brief Tests for FP48 equal to unity
+ *
+	@param x FP48 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP48_isunity(FP48 *x);
+/**	@brief Copy FP48 to another FP48
+ *
+	@param x FP48 instance, on exit = y
+	@param y FP48 instance to be copied
+ */
+extern void FP48_copy(FP48 *x, FP48 *y);
+/**	@brief Set FP48 to unity
+ *
+	@param x FP48 instance to be set to one
+ */
+extern void FP48_one(FP48 *x);
+
+/**	@brief Set FP48 to zero
+ *
+	@param x FP48 instance to be set to zero
+ */
+extern void FP48_zero(FP48 *x);
+
+/**	@brief Tests for equality of two FP48s
+ *
+	@param x FP48 instance to be compared
+	@param y FP48 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP48_equals(FP48 *x, FP48 *y);
+/**	@brief Conjugation of FP48
+ *
+	If y=(a,b,c) (where a,b,c are its three FP16 components) on exit x=(conj(a),-conj(b),conj(c))
+	@param x FP48 instance, on exit = conj(y)
+	@param y FP48 instance
+ */
+extern void FP48_conj(FP48 *x, FP48 *y);
+/**	@brief Initialise FP48 from single FP16
+ *
+	Sets first FP16 component of an FP48, other components set to zero
+	@param x FP48 instance to be initialised
+	@param a FP16 to form first part of FP48
+ */
+extern void FP48_from_FP16(FP48 *x, FP16 *a);
+/**	@brief Initialise FP48 from three FP16s
+ *
+	@param x FP48 instance to be initialised
+	@param a FP16 to form first part of FP48
+	@param b FP16 to form second part of FP48
+	@param c FP16 to form third part of FP48
+ */
+extern void FP48_from_FP16s(FP48 *x, FP16 *a, FP16* b, FP16 *c);
+/**	@brief Fast Squaring of an FP48 in "unitary" form
+ *
+	@param x FP48 instance, on exit = y^2
+	@param y FP16 instance, must be unitary
+ */
+extern void FP48_usqr(FP48 *x, FP48 *y);
+/**	@brief Squaring an FP48
+ *
+	@param x FP48 instance, on exit = y^2
+	@param y FP48 instance
+ */
+extern void FP48_sqr(FP48 *x, FP48 *y);
+/**	@brief Fast multiplication of two sparse FP24s that arises from ATE pairing line functions
+ *
+	@param x FP48 instance, on exit = x*y
+	@param y FP48 instance, of special form
+ */
+extern void FP48_smul(FP48 *x, FP48 *y);
+
+/**	@brief Fast multiplication of what may be sparse multiplicands
+ *
+	@param x FP48 instance, on exit = x*y
+	@param y FP48 instance, of special form
+ */
+extern void FP48_ssmul(FP48 *x, FP48 *y);
+/**	@brief Full unconditional Multiplication of two FP24s
+ *
+	@param x FP48 instance, on exit = x*y
+	@param y FP48 instance, the multiplier
+ */
+extern void FP48_mul(FP48 *x, FP48 *y);
+/**	@brief Inverting an FP48
+ *
+	@param x FP48 instance, on exit = 1/y
+	@param y FP48 instance
+ */
+extern void FP48_inv(FP48 *x, FP48 *y);
+/**	@brief Raises an FP48 to the power of a BIG
+ *
+	@param r FP48 instance, on exit = y^b
+	@param x FP48 instance
+	@param b BIG number
+ */
+extern void FP48_pow(FP48 *r, FP48 *x, B584_60::BIG b);
+
+//extern void FP48_ppow(FP48 *r,FP48 *x,B584_60::BIG b);
+
+/**	@brief Raises an FP48 instance x to a small integer power, side-channel resistant
+ *
+	@param x FP48 instance, on exit = x^i
+	@param i small integer exponent
+	@param b maximum number of bits in exponent
+ */
+extern void FP48_pinpow(FP48 *x, int i, int b);
+
+/**	@brief Raises an FP48 instance x to a BIG power, compressed to FP16
+ *
+	@param c FP16 instance, on exit = x^(e mod r) as FP16
+	@param x FP48 input
+	@param e BIG exponent
+	@param r BIG group order
+ */
+extern void FP48_compow(FP16 *c, FP48 *x, B584_60::BIG e, B584_60::BIG r);
+
+/**	@brief Calculate Pi x[i]^b[i] for i=0 to 15, side-channel resistant
+ *
+	@param r FP48 instance, on exit = Pi x[i]^b[i] for i=0 to 15
+	@param x FP48 array with 16 FP48s
+	@param b BIG array of 16 exponents
+ */
+extern void FP48_pow16(FP48 *r, FP48 *x, B584_60::BIG *b);
+
+
+/**	@brief Raises an FP48 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP48 instance, on exit = x^p^n
+	@param f FP2 precalculated Frobenius constant
+	@param n power of p
+ */
+extern void FP48_frob(FP48 *x, FP2 *f, int n);
+
+/**	@brief Reduces all components of possibly unreduced FP48 mod Modulus
+ *
+	@param x FP48 instance, on exit reduced mod Modulus
+ */
+extern void FP48_reduce(FP48 *x);
+/**	@brief Normalises the components of an FP48
+ *
+	@param x FP48 instance to be normalised
+ */
+extern void FP48_norm(FP48 *x);
+/**	@brief Formats and outputs an FP48 to the console
+ *
+	@param x FP48 instance to be printed
+ */
+extern void FP48_output(FP48 *x);
+/**	@brief Formats and outputs an FP48 instance to an octet string
+ *
+	Serializes the components of an FP48 to big-endian base 256 form.
+	@param S output octet string
+	@param x FP48 instance to be converted to an octet string
+ */
+extern void FP48_toOctet(octet *S, FP48 *x);
+/**	@brief Creates an FP48 instance from an octet string
+ *
+	De-serializes the components of an FP48 to create an FP48 from big-endian base 256 components.
+	@param x FP48 instance to be created from an octet string
+	@param S input octet string
+
+ */
+extern void FP48_fromOctet(FP48 *x, octet *S);
+/**	@brief Calculate the trace of an FP48
+ *
+	@param t FP16 trace of x, on exit = tr(x)
+	@param x FP48 instance
+
+ */
+extern void FP48_trace(FP16 *t, FP48 *x);
+
+/**	@brief Conditional copy of FP48 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP48 instance, set to y if s!=0
+	@param y another FP48 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP48_cmove(FP48 *x, FP48 *y, int s);
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp4_BLS12381.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp4_BLS12381.h
new file mode 100644
index 0000000..2397117
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp4_BLS12381.h
@@ -0,0 +1,349 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP4_BLS12381_H
+#define FP4_BLS12381_H
+
+#include "fp2_BLS12381.h"
+#include "config_curve_BLS12381.h"
+
+using namespace core;
+
+namespace BLS12381 {
+
+/**
+	@brief FP4 Structure - towered over two FP2
+*/
+
+typedef struct
+{
+    FP2 a; /**< real part of FP4 */
+    FP2 b; /**< imaginary part of FP4 */
+} FP4;
+
+
+/* FP4 prototypes */
+/**	@brief Tests for FP4 equal to zero
+ *
+	@param x FP4 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP4_iszilch(FP4 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP4 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP4_islarger(FP4 *x);
+
+/**	@brief Serialize out FP4  
+ *
+    @param b buffer for output
+	@param x FP4 number to be serialized
+ */
+extern void FP4_toBytes(char *b,FP4 *x);
+
+/**	@brief Serialize in FP4  
+ *
+	@param x FP4 number to be serialized
+    @param b buffer for input
+ */
+extern void FP4_fromBytes(FP4 *x,char *b);
+
+/**	@brief Tests for FP4 equal to unity
+ *
+	@param x FP4 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP4_isunity(FP4 *x);
+/**	@brief Tests for equality of two FP4s
+ *
+	@param x FP4 instance to be compared
+	@param y FP4 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP4_equals(FP4 *x, FP4 *y);
+/**	@brief Tests for FP4 having only a real part and no imaginary part
+ *
+	@param x FP4 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP4_isreal(FP4 *x);
+/**	@brief Initialise FP4 from two FP2s
+ *
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+	@param b FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2s(FP4 *x, FP2 *a, FP2 *b);
+/**	@brief Initialise FP4 from single FP2
+ *
+	Imaginary part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+ */
+extern void FP4_from_FP2(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP2
+ *
+	real part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2H(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP
+ *
+	@param x FP4 instance to be initialised
+	@param a FP to form real part of FP4
+ */
+extern void FP4_from_FP(FP4 *x, FP *a);
+
+/**	@brief Copy FP4 to another FP4
+ *
+	@param x FP4 instance, on exit = y
+	@param y FP4 instance to be copied
+ */
+extern void FP4_copy(FP4 *x, FP4 *y);
+/**	@brief Set FP4 to zero
+ *
+	@param x FP4 instance to be set to zero
+ */
+extern void FP4_zero(FP4 *x);
+/**	@brief Set FP4 to unity
+ *
+	@param x FP4 instance to be set to one
+ */
+extern void FP4_one(FP4 *x);
+
+/**	@brief Sign of FP4
+ *
+	@param x FP4 instance
+	@return "sign" of FP4
+ */
+extern int FP4_sign(FP4 *x);
+
+/**	@brief Negation of FP4
+ *
+	@param x FP4 instance, on exit = -y
+	@param y FP4 instance
+ */
+extern void FP4_neg(FP4 *x, FP4 *y);
+/**	@brief Conjugation of FP4
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP4 instance, on exit = conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_conj(FP4 *x, FP4 *y);
+/**	@brief Negative conjugation of FP4
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP4 instance, on exit = -conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_nconj(FP4 *x, FP4 *y);
+/**	@brief addition of two FP4s
+ *
+	@param x FP4 instance, on exit = y+z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_add(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief subtraction of two FP4s
+ *
+	@param x FP4 instance, on exit = y-z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_sub(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Multiplication of an FP4 by an FP2
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP2 multiplier
+ */
+extern void FP4_pmul(FP4 *x, FP4 *y, FP2 *a);
+
+
+/**	@brief Multiplication of an FP4 by an FP
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP multiplier
+ */
+extern void FP4_qmul(FP4 *x, FP4 *y, FP *a);
+
+/**	@brief Multiplication of an FP4 by a small integer
+ *
+	@param x FP4 instance, on exit = y*i
+	@param y FP4 instance
+	@param i an integer
+ */
+extern void FP4_imul(FP4 *x, FP4 *y, int i);
+/**	@brief Squaring an FP4
+ *
+	@param x FP4 instance, on exit = y^2
+	@param y FP4 instance
+ */
+extern void FP4_sqr(FP4 *x, FP4 *y);
+/**	@brief Multiplication of two FP4s
+ *
+	@param x FP4 instance, on exit = y*z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_mul(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Inverting an FP4
+ *
+	@param x FP4 instance, on exit = 1/y
+	@param y FP4 instance
+    @param h optional input hint
+ */
+extern void FP4_inv(FP4 *x, FP4 *y, FP *h);
+
+/**	@brief Divide an FP4 by 2
+ *
+	@param x FP4 instance, on exit = y/2
+	@param y FP4 instance
+ */
+extern void FP4_div2(FP4 *x, FP4 *y);
+
+
+/**	@brief Formats and outputs an FP4 to the console
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_output(FP4 *x);
+/**	@brief Formats and outputs an FP4 to the console in raw form (for debugging)
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_rawoutput(FP4 *x);
+/**	@brief multiplies an FP4 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP4 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP4_times_i(FP4 *x);
+/**	@brief Normalises the components of an FP4
+ *
+	@param x FP4 instance to be normalised
+ */
+extern void FP4_norm(FP4 *x);
+/**	@brief Reduces all components of possibly unreduced FP4 mod Modulus
+ *
+	@param x FP4 instance, on exit reduced mod Modulus
+ */
+extern void FP4_reduce(FP4 *x);
+/**	@brief Raises an FP4 to the power of a BIG
+ *
+	@param x FP4 instance, on exit = y^b
+	@param y FP4 instance
+	@param b BIG number
+ */
+extern void FP4_pow(FP4 *x, FP4 *y, B384_58::BIG b);
+/**	@brief Raises an FP4 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP4 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP4_frob(FP4 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP4 instance, on exit = w*x-conj(x)*y+z
+	@param w FP4 instance
+	@param x FP4 instance
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_xtr_A(FP4 *r, FP4 *w, FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP4 instance, on exit = x^2-2*conj(x)
+	@param x FP4 instance
+ */
+extern void FP4_xtr_D(FP4 *r, FP4 *x);
+/**	@brief Calculates FP4 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP4 instance, on exit = trace(w^b)
+	@param x FP4 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP4_xtr_pow(FP4 *r, FP4 *x, B384_58::BIG b);
+/**	@brief Calculates FP4 trace of c^a.d^b, where c and d are derived from FP4 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP4 instance, on exit = trace(c^a.d^b)
+	@param c FP4 instance, trace of an FP12
+	@param d FP4 instance, trace of an FP12
+	@param e FP4 instance, trace of an FP12
+	@param f FP4 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP4_xtr_pow2(FP4 *r, FP4 *c, FP4 *d, FP4 *e, FP4 *f, B384_58::BIG a, B384_58::BIG b);
+
+/**	@brief Test FP4 for QR
+ * 
+	@param r FP4 instance
+    @param h optional generated hint
+	@return 1 x is a QR, otherwise 0
+ */
+extern int  FP4_qr(FP4 *r, FP *h);
+
+/**	@brief Calculate square root of an FP4
+ *
+	Square root
+	@param r FP4 instance, on exit = sqrt(x)
+	@param x FP4 instance
+    @param h optional input hint
+ */
+extern void  FP4_sqrt(FP4 *r, FP4 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP4 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP4 instance, set to y if s!=0
+	@param y another FP4 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP4_cmove(FP4 *x, FP4 *y, int s);
+
+
+/**	@brief Divide FP4 number by QNR
+ *
+	Divide FP4 by the QNR
+	@param x FP4 instance
+ */
+extern void FP4_div_i(FP4 *x);
+
+/**	@brief Generate random FP4
+ *
+	@param x random FP4 number
+	@param rng random number generator
+ */
+extern void FP4_rand(FP4 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp4_BLS12383.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp4_BLS12383.h
new file mode 100644
index 0000000..0a944fe
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp4_BLS12383.h
@@ -0,0 +1,349 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP4_BLS12383_H
+#define FP4_BLS12383_H
+
+#include "fp2_BLS12383.h"
+#include "config_curve_BLS12383.h"
+
+using namespace core;
+
+namespace BLS12383 {
+
+/**
+	@brief FP4 Structure - towered over two FP2
+*/
+
+typedef struct
+{
+    FP2 a; /**< real part of FP4 */
+    FP2 b; /**< imaginary part of FP4 */
+} FP4;
+
+
+/* FP4 prototypes */
+/**	@brief Tests for FP4 equal to zero
+ *
+	@param x FP4 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP4_iszilch(FP4 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP4 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP4_islarger(FP4 *x);
+
+/**	@brief Serialize out FP4  
+ *
+    @param b buffer for output
+	@param x FP4 number to be serialized
+ */
+extern void FP4_toBytes(char *b,FP4 *x);
+
+/**	@brief Serialize in FP4  
+ *
+	@param x FP4 number to be serialized
+    @param b buffer for input
+ */
+extern void FP4_fromBytes(FP4 *x,char *b);
+
+/**	@brief Tests for FP4 equal to unity
+ *
+	@param x FP4 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP4_isunity(FP4 *x);
+/**	@brief Tests for equality of two FP4s
+ *
+	@param x FP4 instance to be compared
+	@param y FP4 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP4_equals(FP4 *x, FP4 *y);
+/**	@brief Tests for FP4 having only a real part and no imaginary part
+ *
+	@param x FP4 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP4_isreal(FP4 *x);
+/**	@brief Initialise FP4 from two FP2s
+ *
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+	@param b FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2s(FP4 *x, FP2 *a, FP2 *b);
+/**	@brief Initialise FP4 from single FP2
+ *
+	Imaginary part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+ */
+extern void FP4_from_FP2(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP2
+ *
+	real part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2H(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP
+ *
+	@param x FP4 instance to be initialised
+	@param a FP to form real part of FP4
+ */
+extern void FP4_from_FP(FP4 *x, FP *a);
+
+/**	@brief Copy FP4 to another FP4
+ *
+	@param x FP4 instance, on exit = y
+	@param y FP4 instance to be copied
+ */
+extern void FP4_copy(FP4 *x, FP4 *y);
+/**	@brief Set FP4 to zero
+ *
+	@param x FP4 instance to be set to zero
+ */
+extern void FP4_zero(FP4 *x);
+/**	@brief Set FP4 to unity
+ *
+	@param x FP4 instance to be set to one
+ */
+extern void FP4_one(FP4 *x);
+
+/**	@brief Sign of FP4
+ *
+	@param x FP4 instance
+	@return "sign" of FP4
+ */
+extern int FP4_sign(FP4 *x);
+
+/**	@brief Negation of FP4
+ *
+	@param x FP4 instance, on exit = -y
+	@param y FP4 instance
+ */
+extern void FP4_neg(FP4 *x, FP4 *y);
+/**	@brief Conjugation of FP4
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP4 instance, on exit = conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_conj(FP4 *x, FP4 *y);
+/**	@brief Negative conjugation of FP4
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP4 instance, on exit = -conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_nconj(FP4 *x, FP4 *y);
+/**	@brief addition of two FP4s
+ *
+	@param x FP4 instance, on exit = y+z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_add(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief subtraction of two FP4s
+ *
+	@param x FP4 instance, on exit = y-z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_sub(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Multiplication of an FP4 by an FP2
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP2 multiplier
+ */
+extern void FP4_pmul(FP4 *x, FP4 *y, FP2 *a);
+
+
+/**	@brief Multiplication of an FP4 by an FP
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP multiplier
+ */
+extern void FP4_qmul(FP4 *x, FP4 *y, FP *a);
+
+/**	@brief Multiplication of an FP4 by a small integer
+ *
+	@param x FP4 instance, on exit = y*i
+	@param y FP4 instance
+	@param i an integer
+ */
+extern void FP4_imul(FP4 *x, FP4 *y, int i);
+/**	@brief Squaring an FP4
+ *
+	@param x FP4 instance, on exit = y^2
+	@param y FP4 instance
+ */
+extern void FP4_sqr(FP4 *x, FP4 *y);
+/**	@brief Multiplication of two FP4s
+ *
+	@param x FP4 instance, on exit = y*z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_mul(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Inverting an FP4
+ *
+	@param x FP4 instance, on exit = 1/y
+	@param y FP4 instance
+    @param h optional input hint
+ */
+extern void FP4_inv(FP4 *x, FP4 *y, FP *h);
+
+/**	@brief Divide an FP4 by 2
+ *
+	@param x FP4 instance, on exit = y/2
+	@param y FP4 instance
+ */
+extern void FP4_div2(FP4 *x, FP4 *y);
+
+
+/**	@brief Formats and outputs an FP4 to the console
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_output(FP4 *x);
+/**	@brief Formats and outputs an FP4 to the console in raw form (for debugging)
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_rawoutput(FP4 *x);
+/**	@brief multiplies an FP4 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP4 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP4_times_i(FP4 *x);
+/**	@brief Normalises the components of an FP4
+ *
+	@param x FP4 instance to be normalised
+ */
+extern void FP4_norm(FP4 *x);
+/**	@brief Reduces all components of possibly unreduced FP4 mod Modulus
+ *
+	@param x FP4 instance, on exit reduced mod Modulus
+ */
+extern void FP4_reduce(FP4 *x);
+/**	@brief Raises an FP4 to the power of a BIG
+ *
+	@param x FP4 instance, on exit = y^b
+	@param y FP4 instance
+	@param b BIG number
+ */
+extern void FP4_pow(FP4 *x, FP4 *y, B384_58::BIG b);
+/**	@brief Raises an FP4 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP4 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP4_frob(FP4 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP4 instance, on exit = w*x-conj(x)*y+z
+	@param w FP4 instance
+	@param x FP4 instance
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_xtr_A(FP4 *r, FP4 *w, FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP4 instance, on exit = x^2-2*conj(x)
+	@param x FP4 instance
+ */
+extern void FP4_xtr_D(FP4 *r, FP4 *x);
+/**	@brief Calculates FP4 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP4 instance, on exit = trace(w^b)
+	@param x FP4 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP4_xtr_pow(FP4 *r, FP4 *x, B384_58::BIG b);
+/**	@brief Calculates FP4 trace of c^a.d^b, where c and d are derived from FP4 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP4 instance, on exit = trace(c^a.d^b)
+	@param c FP4 instance, trace of an FP12
+	@param d FP4 instance, trace of an FP12
+	@param e FP4 instance, trace of an FP12
+	@param f FP4 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP4_xtr_pow2(FP4 *r, FP4 *c, FP4 *d, FP4 *e, FP4 *f, B384_58::BIG a, B384_58::BIG b);
+
+/**	@brief Test FP4 for QR
+ * 
+	@param r FP4 instance
+    @param h optional generated hint
+	@return 1 x is a QR, otherwise 0
+ */
+extern int  FP4_qr(FP4 *r, FP *h);
+
+/**	@brief Calculate square root of an FP4
+ *
+	Square root
+	@param r FP4 instance, on exit = sqrt(x)
+	@param x FP4 instance
+    @param h optional input hint
+ */
+extern void  FP4_sqrt(FP4 *r, FP4 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP4 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP4 instance, set to y if s!=0
+	@param y another FP4 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP4_cmove(FP4 *x, FP4 *y, int s);
+
+
+/**	@brief Divide FP4 number by QNR
+ *
+	Divide FP4 by the QNR
+	@param x FP4 instance
+ */
+extern void FP4_div_i(FP4 *x);
+
+/**	@brief Generate random FP4
+ *
+	@param x random FP4 number
+	@param rng random number generator
+ */
+extern void FP4_rand(FP4 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp4_BLS12443.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp4_BLS12443.h
new file mode 100644
index 0000000..51b5803
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp4_BLS12443.h
@@ -0,0 +1,349 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP4_BLS12443_H
+#define FP4_BLS12443_H
+
+#include "fp2_BLS12443.h"
+#include "config_curve_BLS12443.h"
+
+using namespace core;
+
+namespace BLS12443 {
+
+/**
+	@brief FP4 Structure - towered over two FP2
+*/
+
+typedef struct
+{
+    FP2 a; /**< real part of FP4 */
+    FP2 b; /**< imaginary part of FP4 */
+} FP4;
+
+
+/* FP4 prototypes */
+/**	@brief Tests for FP4 equal to zero
+ *
+	@param x FP4 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP4_iszilch(FP4 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP4 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP4_islarger(FP4 *x);
+
+/**	@brief Serialize out FP4  
+ *
+    @param b buffer for output
+	@param x FP4 number to be serialized
+ */
+extern void FP4_toBytes(char *b,FP4 *x);
+
+/**	@brief Serialize in FP4  
+ *
+	@param x FP4 number to be serialized
+    @param b buffer for input
+ */
+extern void FP4_fromBytes(FP4 *x,char *b);
+
+/**	@brief Tests for FP4 equal to unity
+ *
+	@param x FP4 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP4_isunity(FP4 *x);
+/**	@brief Tests for equality of two FP4s
+ *
+	@param x FP4 instance to be compared
+	@param y FP4 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP4_equals(FP4 *x, FP4 *y);
+/**	@brief Tests for FP4 having only a real part and no imaginary part
+ *
+	@param x FP4 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP4_isreal(FP4 *x);
+/**	@brief Initialise FP4 from two FP2s
+ *
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+	@param b FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2s(FP4 *x, FP2 *a, FP2 *b);
+/**	@brief Initialise FP4 from single FP2
+ *
+	Imaginary part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+ */
+extern void FP4_from_FP2(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP2
+ *
+	real part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2H(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP
+ *
+	@param x FP4 instance to be initialised
+	@param a FP to form real part of FP4
+ */
+extern void FP4_from_FP(FP4 *x, FP *a);
+
+/**	@brief Copy FP4 to another FP4
+ *
+	@param x FP4 instance, on exit = y
+	@param y FP4 instance to be copied
+ */
+extern void FP4_copy(FP4 *x, FP4 *y);
+/**	@brief Set FP4 to zero
+ *
+	@param x FP4 instance to be set to zero
+ */
+extern void FP4_zero(FP4 *x);
+/**	@brief Set FP4 to unity
+ *
+	@param x FP4 instance to be set to one
+ */
+extern void FP4_one(FP4 *x);
+
+/**	@brief Sign of FP4
+ *
+	@param x FP4 instance
+	@return "sign" of FP4
+ */
+extern int FP4_sign(FP4 *x);
+
+/**	@brief Negation of FP4
+ *
+	@param x FP4 instance, on exit = -y
+	@param y FP4 instance
+ */
+extern void FP4_neg(FP4 *x, FP4 *y);
+/**	@brief Conjugation of FP4
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP4 instance, on exit = conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_conj(FP4 *x, FP4 *y);
+/**	@brief Negative conjugation of FP4
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP4 instance, on exit = -conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_nconj(FP4 *x, FP4 *y);
+/**	@brief addition of two FP4s
+ *
+	@param x FP4 instance, on exit = y+z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_add(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief subtraction of two FP4s
+ *
+	@param x FP4 instance, on exit = y-z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_sub(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Multiplication of an FP4 by an FP2
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP2 multiplier
+ */
+extern void FP4_pmul(FP4 *x, FP4 *y, FP2 *a);
+
+
+/**	@brief Multiplication of an FP4 by an FP
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP multiplier
+ */
+extern void FP4_qmul(FP4 *x, FP4 *y, FP *a);
+
+/**	@brief Multiplication of an FP4 by a small integer
+ *
+	@param x FP4 instance, on exit = y*i
+	@param y FP4 instance
+	@param i an integer
+ */
+extern void FP4_imul(FP4 *x, FP4 *y, int i);
+/**	@brief Squaring an FP4
+ *
+	@param x FP4 instance, on exit = y^2
+	@param y FP4 instance
+ */
+extern void FP4_sqr(FP4 *x, FP4 *y);
+/**	@brief Multiplication of two FP4s
+ *
+	@param x FP4 instance, on exit = y*z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_mul(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Inverting an FP4
+ *
+	@param x FP4 instance, on exit = 1/y
+	@param y FP4 instance
+    @param h optional input hint
+ */
+extern void FP4_inv(FP4 *x, FP4 *y, FP *h);
+
+/**	@brief Divide an FP4 by 2
+ *
+	@param x FP4 instance, on exit = y/2
+	@param y FP4 instance
+ */
+extern void FP4_div2(FP4 *x, FP4 *y);
+
+
+/**	@brief Formats and outputs an FP4 to the console
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_output(FP4 *x);
+/**	@brief Formats and outputs an FP4 to the console in raw form (for debugging)
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_rawoutput(FP4 *x);
+/**	@brief multiplies an FP4 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP4 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP4_times_i(FP4 *x);
+/**	@brief Normalises the components of an FP4
+ *
+	@param x FP4 instance to be normalised
+ */
+extern void FP4_norm(FP4 *x);
+/**	@brief Reduces all components of possibly unreduced FP4 mod Modulus
+ *
+	@param x FP4 instance, on exit reduced mod Modulus
+ */
+extern void FP4_reduce(FP4 *x);
+/**	@brief Raises an FP4 to the power of a BIG
+ *
+	@param x FP4 instance, on exit = y^b
+	@param y FP4 instance
+	@param b BIG number
+ */
+extern void FP4_pow(FP4 *x, FP4 *y, B448_60::BIG b);
+/**	@brief Raises an FP4 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP4 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP4_frob(FP4 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP4 instance, on exit = w*x-conj(x)*y+z
+	@param w FP4 instance
+	@param x FP4 instance
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_xtr_A(FP4 *r, FP4 *w, FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP4 instance, on exit = x^2-2*conj(x)
+	@param x FP4 instance
+ */
+extern void FP4_xtr_D(FP4 *r, FP4 *x);
+/**	@brief Calculates FP4 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP4 instance, on exit = trace(w^b)
+	@param x FP4 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP4_xtr_pow(FP4 *r, FP4 *x, B448_60::BIG b);
+/**	@brief Calculates FP4 trace of c^a.d^b, where c and d are derived from FP4 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP4 instance, on exit = trace(c^a.d^b)
+	@param c FP4 instance, trace of an FP12
+	@param d FP4 instance, trace of an FP12
+	@param e FP4 instance, trace of an FP12
+	@param f FP4 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP4_xtr_pow2(FP4 *r, FP4 *c, FP4 *d, FP4 *e, FP4 *f, B448_60::BIG a, B448_60::BIG b);
+
+/**	@brief Test FP4 for QR
+ * 
+	@param r FP4 instance
+    @param h optional generated hint
+	@return 1 x is a QR, otherwise 0
+ */
+extern int  FP4_qr(FP4 *r, FP *h);
+
+/**	@brief Calculate square root of an FP4
+ *
+	Square root
+	@param r FP4 instance, on exit = sqrt(x)
+	@param x FP4 instance
+    @param h optional input hint
+ */
+extern void  FP4_sqrt(FP4 *r, FP4 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP4 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP4 instance, set to y if s!=0
+	@param y another FP4 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP4_cmove(FP4 *x, FP4 *y, int s);
+
+
+/**	@brief Divide FP4 number by QNR
+ *
+	Divide FP4 by the QNR
+	@param x FP4 instance
+ */
+extern void FP4_div_i(FP4 *x);
+
+/**	@brief Generate random FP4
+ *
+	@param x random FP4 number
+	@param rng random number generator
+ */
+extern void FP4_rand(FP4 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp4_BLS12461.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp4_BLS12461.h
new file mode 100644
index 0000000..68244fc
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp4_BLS12461.h
@@ -0,0 +1,349 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP4_BLS12461_H
+#define FP4_BLS12461_H
+
+#include "fp2_BLS12461.h"
+#include "config_curve_BLS12461.h"
+
+using namespace core;
+
+namespace BLS12461 {
+
+/**
+	@brief FP4 Structure - towered over two FP2
+*/
+
+typedef struct
+{
+    FP2 a; /**< real part of FP4 */
+    FP2 b; /**< imaginary part of FP4 */
+} FP4;
+
+
+/* FP4 prototypes */
+/**	@brief Tests for FP4 equal to zero
+ *
+	@param x FP4 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP4_iszilch(FP4 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP4 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP4_islarger(FP4 *x);
+
+/**	@brief Serialize out FP4  
+ *
+    @param b buffer for output
+	@param x FP4 number to be serialized
+ */
+extern void FP4_toBytes(char *b,FP4 *x);
+
+/**	@brief Serialize in FP4  
+ *
+	@param x FP4 number to be serialized
+    @param b buffer for input
+ */
+extern void FP4_fromBytes(FP4 *x,char *b);
+
+/**	@brief Tests for FP4 equal to unity
+ *
+	@param x FP4 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP4_isunity(FP4 *x);
+/**	@brief Tests for equality of two FP4s
+ *
+	@param x FP4 instance to be compared
+	@param y FP4 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP4_equals(FP4 *x, FP4 *y);
+/**	@brief Tests for FP4 having only a real part and no imaginary part
+ *
+	@param x FP4 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP4_isreal(FP4 *x);
+/**	@brief Initialise FP4 from two FP2s
+ *
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+	@param b FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2s(FP4 *x, FP2 *a, FP2 *b);
+/**	@brief Initialise FP4 from single FP2
+ *
+	Imaginary part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+ */
+extern void FP4_from_FP2(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP2
+ *
+	real part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2H(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP
+ *
+	@param x FP4 instance to be initialised
+	@param a FP to form real part of FP4
+ */
+extern void FP4_from_FP(FP4 *x, FP *a);
+
+/**	@brief Copy FP4 to another FP4
+ *
+	@param x FP4 instance, on exit = y
+	@param y FP4 instance to be copied
+ */
+extern void FP4_copy(FP4 *x, FP4 *y);
+/**	@brief Set FP4 to zero
+ *
+	@param x FP4 instance to be set to zero
+ */
+extern void FP4_zero(FP4 *x);
+/**	@brief Set FP4 to unity
+ *
+	@param x FP4 instance to be set to one
+ */
+extern void FP4_one(FP4 *x);
+
+/**	@brief Sign of FP4
+ *
+	@param x FP4 instance
+	@return "sign" of FP4
+ */
+extern int FP4_sign(FP4 *x);
+
+/**	@brief Negation of FP4
+ *
+	@param x FP4 instance, on exit = -y
+	@param y FP4 instance
+ */
+extern void FP4_neg(FP4 *x, FP4 *y);
+/**	@brief Conjugation of FP4
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP4 instance, on exit = conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_conj(FP4 *x, FP4 *y);
+/**	@brief Negative conjugation of FP4
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP4 instance, on exit = -conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_nconj(FP4 *x, FP4 *y);
+/**	@brief addition of two FP4s
+ *
+	@param x FP4 instance, on exit = y+z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_add(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief subtraction of two FP4s
+ *
+	@param x FP4 instance, on exit = y-z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_sub(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Multiplication of an FP4 by an FP2
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP2 multiplier
+ */
+extern void FP4_pmul(FP4 *x, FP4 *y, FP2 *a);
+
+
+/**	@brief Multiplication of an FP4 by an FP
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP multiplier
+ */
+extern void FP4_qmul(FP4 *x, FP4 *y, FP *a);
+
+/**	@brief Multiplication of an FP4 by a small integer
+ *
+	@param x FP4 instance, on exit = y*i
+	@param y FP4 instance
+	@param i an integer
+ */
+extern void FP4_imul(FP4 *x, FP4 *y, int i);
+/**	@brief Squaring an FP4
+ *
+	@param x FP4 instance, on exit = y^2
+	@param y FP4 instance
+ */
+extern void FP4_sqr(FP4 *x, FP4 *y);
+/**	@brief Multiplication of two FP4s
+ *
+	@param x FP4 instance, on exit = y*z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_mul(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Inverting an FP4
+ *
+	@param x FP4 instance, on exit = 1/y
+	@param y FP4 instance
+    @param h optional input hint
+ */
+extern void FP4_inv(FP4 *x, FP4 *y, FP *h);
+
+/**	@brief Divide an FP4 by 2
+ *
+	@param x FP4 instance, on exit = y/2
+	@param y FP4 instance
+ */
+extern void FP4_div2(FP4 *x, FP4 *y);
+
+
+/**	@brief Formats and outputs an FP4 to the console
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_output(FP4 *x);
+/**	@brief Formats and outputs an FP4 to the console in raw form (for debugging)
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_rawoutput(FP4 *x);
+/**	@brief multiplies an FP4 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP4 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP4_times_i(FP4 *x);
+/**	@brief Normalises the components of an FP4
+ *
+	@param x FP4 instance to be normalised
+ */
+extern void FP4_norm(FP4 *x);
+/**	@brief Reduces all components of possibly unreduced FP4 mod Modulus
+ *
+	@param x FP4 instance, on exit reduced mod Modulus
+ */
+extern void FP4_reduce(FP4 *x);
+/**	@brief Raises an FP4 to the power of a BIG
+ *
+	@param x FP4 instance, on exit = y^b
+	@param y FP4 instance
+	@param b BIG number
+ */
+extern void FP4_pow(FP4 *x, FP4 *y, B464_60::BIG b);
+/**	@brief Raises an FP4 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP4 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP4_frob(FP4 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP4 instance, on exit = w*x-conj(x)*y+z
+	@param w FP4 instance
+	@param x FP4 instance
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_xtr_A(FP4 *r, FP4 *w, FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP4 instance, on exit = x^2-2*conj(x)
+	@param x FP4 instance
+ */
+extern void FP4_xtr_D(FP4 *r, FP4 *x);
+/**	@brief Calculates FP4 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP4 instance, on exit = trace(w^b)
+	@param x FP4 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP4_xtr_pow(FP4 *r, FP4 *x, B464_60::BIG b);
+/**	@brief Calculates FP4 trace of c^a.d^b, where c and d are derived from FP4 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP4 instance, on exit = trace(c^a.d^b)
+	@param c FP4 instance, trace of an FP12
+	@param d FP4 instance, trace of an FP12
+	@param e FP4 instance, trace of an FP12
+	@param f FP4 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP4_xtr_pow2(FP4 *r, FP4 *c, FP4 *d, FP4 *e, FP4 *f, B464_60::BIG a, B464_60::BIG b);
+
+/**	@brief Test FP4 for QR
+ * 
+	@param r FP4 instance
+    @param h optional generated hint
+	@return 1 x is a QR, otherwise 0
+ */
+extern int  FP4_qr(FP4 *r, FP *h);
+
+/**	@brief Calculate square root of an FP4
+ *
+	Square root
+	@param r FP4 instance, on exit = sqrt(x)
+	@param x FP4 instance
+    @param h optional input hint
+ */
+extern void  FP4_sqrt(FP4 *r, FP4 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP4 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP4 instance, set to y if s!=0
+	@param y another FP4 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP4_cmove(FP4 *x, FP4 *y, int s);
+
+
+/**	@brief Divide FP4 number by QNR
+ *
+	Divide FP4 by the QNR
+	@param x FP4 instance
+ */
+extern void FP4_div_i(FP4 *x);
+
+/**	@brief Generate random FP4
+ *
+	@param x random FP4 number
+	@param rng random number generator
+ */
+extern void FP4_rand(FP4 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp4_BLS24479.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp4_BLS24479.h
new file mode 100644
index 0000000..eb8af81
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp4_BLS24479.h
@@ -0,0 +1,349 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP4_BLS24479_H
+#define FP4_BLS24479_H
+
+#include "fp2_BLS24479.h"
+#include "config_curve_BLS24479.h"
+
+using namespace core;
+
+namespace BLS24479 {
+
+/**
+	@brief FP4 Structure - towered over two FP2
+*/
+
+typedef struct
+{
+    FP2 a; /**< real part of FP4 */
+    FP2 b; /**< imaginary part of FP4 */
+} FP4;
+
+
+/* FP4 prototypes */
+/**	@brief Tests for FP4 equal to zero
+ *
+	@param x FP4 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP4_iszilch(FP4 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP4 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP4_islarger(FP4 *x);
+
+/**	@brief Serialize out FP4  
+ *
+    @param b buffer for output
+	@param x FP4 number to be serialized
+ */
+extern void FP4_toBytes(char *b,FP4 *x);
+
+/**	@brief Serialize in FP4  
+ *
+	@param x FP4 number to be serialized
+    @param b buffer for input
+ */
+extern void FP4_fromBytes(FP4 *x,char *b);
+
+/**	@brief Tests for FP4 equal to unity
+ *
+	@param x FP4 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP4_isunity(FP4 *x);
+/**	@brief Tests for equality of two FP4s
+ *
+	@param x FP4 instance to be compared
+	@param y FP4 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP4_equals(FP4 *x, FP4 *y);
+/**	@brief Tests for FP4 having only a real part and no imaginary part
+ *
+	@param x FP4 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP4_isreal(FP4 *x);
+/**	@brief Initialise FP4 from two FP2s
+ *
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+	@param b FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2s(FP4 *x, FP2 *a, FP2 *b);
+/**	@brief Initialise FP4 from single FP2
+ *
+	Imaginary part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+ */
+extern void FP4_from_FP2(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP2
+ *
+	real part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2H(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP
+ *
+	@param x FP4 instance to be initialised
+	@param a FP to form real part of FP4
+ */
+extern void FP4_from_FP(FP4 *x, FP *a);
+
+/**	@brief Copy FP4 to another FP4
+ *
+	@param x FP4 instance, on exit = y
+	@param y FP4 instance to be copied
+ */
+extern void FP4_copy(FP4 *x, FP4 *y);
+/**	@brief Set FP4 to zero
+ *
+	@param x FP4 instance to be set to zero
+ */
+extern void FP4_zero(FP4 *x);
+/**	@brief Set FP4 to unity
+ *
+	@param x FP4 instance to be set to one
+ */
+extern void FP4_one(FP4 *x);
+
+/**	@brief Sign of FP4
+ *
+	@param x FP4 instance
+	@return "sign" of FP4
+ */
+extern int FP4_sign(FP4 *x);
+
+/**	@brief Negation of FP4
+ *
+	@param x FP4 instance, on exit = -y
+	@param y FP4 instance
+ */
+extern void FP4_neg(FP4 *x, FP4 *y);
+/**	@brief Conjugation of FP4
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP4 instance, on exit = conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_conj(FP4 *x, FP4 *y);
+/**	@brief Negative conjugation of FP4
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP4 instance, on exit = -conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_nconj(FP4 *x, FP4 *y);
+/**	@brief addition of two FP4s
+ *
+	@param x FP4 instance, on exit = y+z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_add(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief subtraction of two FP4s
+ *
+	@param x FP4 instance, on exit = y-z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_sub(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Multiplication of an FP4 by an FP2
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP2 multiplier
+ */
+extern void FP4_pmul(FP4 *x, FP4 *y, FP2 *a);
+
+
+/**	@brief Multiplication of an FP4 by an FP
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP multiplier
+ */
+extern void FP4_qmul(FP4 *x, FP4 *y, FP *a);
+
+/**	@brief Multiplication of an FP4 by a small integer
+ *
+	@param x FP4 instance, on exit = y*i
+	@param y FP4 instance
+	@param i an integer
+ */
+extern void FP4_imul(FP4 *x, FP4 *y, int i);
+/**	@brief Squaring an FP4
+ *
+	@param x FP4 instance, on exit = y^2
+	@param y FP4 instance
+ */
+extern void FP4_sqr(FP4 *x, FP4 *y);
+/**	@brief Multiplication of two FP4s
+ *
+	@param x FP4 instance, on exit = y*z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_mul(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Inverting an FP4
+ *
+	@param x FP4 instance, on exit = 1/y
+	@param y FP4 instance
+    @param h optional input hint
+ */
+extern void FP4_inv(FP4 *x, FP4 *y, FP *h);
+
+/**	@brief Divide an FP4 by 2
+ *
+	@param x FP4 instance, on exit = y/2
+	@param y FP4 instance
+ */
+extern void FP4_div2(FP4 *x, FP4 *y);
+
+
+/**	@brief Formats and outputs an FP4 to the console
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_output(FP4 *x);
+/**	@brief Formats and outputs an FP4 to the console in raw form (for debugging)
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_rawoutput(FP4 *x);
+/**	@brief multiplies an FP4 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP4 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP4_times_i(FP4 *x);
+/**	@brief Normalises the components of an FP4
+ *
+	@param x FP4 instance to be normalised
+ */
+extern void FP4_norm(FP4 *x);
+/**	@brief Reduces all components of possibly unreduced FP4 mod Modulus
+ *
+	@param x FP4 instance, on exit reduced mod Modulus
+ */
+extern void FP4_reduce(FP4 *x);
+/**	@brief Raises an FP4 to the power of a BIG
+ *
+	@param x FP4 instance, on exit = y^b
+	@param y FP4 instance
+	@param b BIG number
+ */
+extern void FP4_pow(FP4 *x, FP4 *y, B480_56::BIG b);
+/**	@brief Raises an FP4 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP4 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP4_frob(FP4 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP4 instance, on exit = w*x-conj(x)*y+z
+	@param w FP4 instance
+	@param x FP4 instance
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_xtr_A(FP4 *r, FP4 *w, FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP4 instance, on exit = x^2-2*conj(x)
+	@param x FP4 instance
+ */
+extern void FP4_xtr_D(FP4 *r, FP4 *x);
+/**	@brief Calculates FP4 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP4 instance, on exit = trace(w^b)
+	@param x FP4 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP4_xtr_pow(FP4 *r, FP4 *x, B480_56::BIG b);
+/**	@brief Calculates FP4 trace of c^a.d^b, where c and d are derived from FP4 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP4 instance, on exit = trace(c^a.d^b)
+	@param c FP4 instance, trace of an FP12
+	@param d FP4 instance, trace of an FP12
+	@param e FP4 instance, trace of an FP12
+	@param f FP4 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP4_xtr_pow2(FP4 *r, FP4 *c, FP4 *d, FP4 *e, FP4 *f, B480_56::BIG a, B480_56::BIG b);
+
+/**	@brief Test FP4 for QR
+ * 
+	@param r FP4 instance
+    @param h optional generated hint
+	@return 1 x is a QR, otherwise 0
+ */
+extern int  FP4_qr(FP4 *r, FP *h);
+
+/**	@brief Calculate square root of an FP4
+ *
+	Square root
+	@param r FP4 instance, on exit = sqrt(x)
+	@param x FP4 instance
+    @param h optional input hint
+ */
+extern void  FP4_sqrt(FP4 *r, FP4 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP4 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP4 instance, set to y if s!=0
+	@param y another FP4 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP4_cmove(FP4 *x, FP4 *y, int s);
+
+
+/**	@brief Divide FP4 number by QNR
+ *
+	Divide FP4 by the QNR
+	@param x FP4 instance
+ */
+extern void FP4_div_i(FP4 *x);
+
+/**	@brief Generate random FP4
+ *
+	@param x random FP4 number
+	@param rng random number generator
+ */
+extern void FP4_rand(FP4 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp4_BLS48286.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp4_BLS48286.h
new file mode 100644
index 0000000..bd2be86
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp4_BLS48286.h
@@ -0,0 +1,349 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP4_BLS48286_H
+#define FP4_BLS48286_H
+
+#include "fp2_BLS48286.h"
+#include "config_curve_BLS48286.h"
+
+using namespace core;
+
+namespace BLS48286 {
+
+/**
+	@brief FP4 Structure - towered over two FP2
+*/
+
+typedef struct
+{
+    FP2 a; /**< real part of FP4 */
+    FP2 b; /**< imaginary part of FP4 */
+} FP4;
+
+
+/* FP4 prototypes */
+/**	@brief Tests for FP4 equal to zero
+ *
+	@param x FP4 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP4_iszilch(FP4 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP4 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP4_islarger(FP4 *x);
+
+/**	@brief Serialize out FP4  
+ *
+    @param b buffer for output
+	@param x FP4 number to be serialized
+ */
+extern void FP4_toBytes(char *b,FP4 *x);
+
+/**	@brief Serialize in FP4  
+ *
+	@param x FP4 number to be serialized
+    @param b buffer for input
+ */
+extern void FP4_fromBytes(FP4 *x,char *b);
+
+/**	@brief Tests for FP4 equal to unity
+ *
+	@param x FP4 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP4_isunity(FP4 *x);
+/**	@brief Tests for equality of two FP4s
+ *
+	@param x FP4 instance to be compared
+	@param y FP4 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP4_equals(FP4 *x, FP4 *y);
+/**	@brief Tests for FP4 having only a real part and no imaginary part
+ *
+	@param x FP4 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP4_isreal(FP4 *x);
+/**	@brief Initialise FP4 from two FP2s
+ *
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+	@param b FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2s(FP4 *x, FP2 *a, FP2 *b);
+/**	@brief Initialise FP4 from single FP2
+ *
+	Imaginary part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+ */
+extern void FP4_from_FP2(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP2
+ *
+	real part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2H(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP
+ *
+	@param x FP4 instance to be initialised
+	@param a FP to form real part of FP4
+ */
+extern void FP4_from_FP(FP4 *x, FP *a);
+
+/**	@brief Copy FP4 to another FP4
+ *
+	@param x FP4 instance, on exit = y
+	@param y FP4 instance to be copied
+ */
+extern void FP4_copy(FP4 *x, FP4 *y);
+/**	@brief Set FP4 to zero
+ *
+	@param x FP4 instance to be set to zero
+ */
+extern void FP4_zero(FP4 *x);
+/**	@brief Set FP4 to unity
+ *
+	@param x FP4 instance to be set to one
+ */
+extern void FP4_one(FP4 *x);
+
+/**	@brief Sign of FP4
+ *
+	@param x FP4 instance
+	@return "sign" of FP4
+ */
+extern int FP4_sign(FP4 *x);
+
+/**	@brief Negation of FP4
+ *
+	@param x FP4 instance, on exit = -y
+	@param y FP4 instance
+ */
+extern void FP4_neg(FP4 *x, FP4 *y);
+/**	@brief Conjugation of FP4
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP4 instance, on exit = conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_conj(FP4 *x, FP4 *y);
+/**	@brief Negative conjugation of FP4
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP4 instance, on exit = -conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_nconj(FP4 *x, FP4 *y);
+/**	@brief addition of two FP4s
+ *
+	@param x FP4 instance, on exit = y+z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_add(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief subtraction of two FP4s
+ *
+	@param x FP4 instance, on exit = y-z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_sub(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Multiplication of an FP4 by an FP2
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP2 multiplier
+ */
+extern void FP4_pmul(FP4 *x, FP4 *y, FP2 *a);
+
+
+/**	@brief Multiplication of an FP4 by an FP
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP multiplier
+ */
+extern void FP4_qmul(FP4 *x, FP4 *y, FP *a);
+
+/**	@brief Multiplication of an FP4 by a small integer
+ *
+	@param x FP4 instance, on exit = y*i
+	@param y FP4 instance
+	@param i an integer
+ */
+extern void FP4_imul(FP4 *x, FP4 *y, int i);
+/**	@brief Squaring an FP4
+ *
+	@param x FP4 instance, on exit = y^2
+	@param y FP4 instance
+ */
+extern void FP4_sqr(FP4 *x, FP4 *y);
+/**	@brief Multiplication of two FP4s
+ *
+	@param x FP4 instance, on exit = y*z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_mul(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Inverting an FP4
+ *
+	@param x FP4 instance, on exit = 1/y
+	@param y FP4 instance
+    @param h optional input hint
+ */
+extern void FP4_inv(FP4 *x, FP4 *y, FP *h);
+
+/**	@brief Divide an FP4 by 2
+ *
+	@param x FP4 instance, on exit = y/2
+	@param y FP4 instance
+ */
+extern void FP4_div2(FP4 *x, FP4 *y);
+
+
+/**	@brief Formats and outputs an FP4 to the console
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_output(FP4 *x);
+/**	@brief Formats and outputs an FP4 to the console in raw form (for debugging)
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_rawoutput(FP4 *x);
+/**	@brief multiplies an FP4 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP4 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP4_times_i(FP4 *x);
+/**	@brief Normalises the components of an FP4
+ *
+	@param x FP4 instance to be normalised
+ */
+extern void FP4_norm(FP4 *x);
+/**	@brief Reduces all components of possibly unreduced FP4 mod Modulus
+ *
+	@param x FP4 instance, on exit reduced mod Modulus
+ */
+extern void FP4_reduce(FP4 *x);
+/**	@brief Raises an FP4 to the power of a BIG
+ *
+	@param x FP4 instance, on exit = y^b
+	@param y FP4 instance
+	@param b BIG number
+ */
+extern void FP4_pow(FP4 *x, FP4 *y, B288_60::BIG b);
+/**	@brief Raises an FP4 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP4 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP4_frob(FP4 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP4 instance, on exit = w*x-conj(x)*y+z
+	@param w FP4 instance
+	@param x FP4 instance
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_xtr_A(FP4 *r, FP4 *w, FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP4 instance, on exit = x^2-2*conj(x)
+	@param x FP4 instance
+ */
+extern void FP4_xtr_D(FP4 *r, FP4 *x);
+/**	@brief Calculates FP4 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP4 instance, on exit = trace(w^b)
+	@param x FP4 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP4_xtr_pow(FP4 *r, FP4 *x, B288_60::BIG b);
+/**	@brief Calculates FP4 trace of c^a.d^b, where c and d are derived from FP4 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP4 instance, on exit = trace(c^a.d^b)
+	@param c FP4 instance, trace of an FP12
+	@param d FP4 instance, trace of an FP12
+	@param e FP4 instance, trace of an FP12
+	@param f FP4 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP4_xtr_pow2(FP4 *r, FP4 *c, FP4 *d, FP4 *e, FP4 *f, B288_60::BIG a, B288_60::BIG b);
+
+/**	@brief Test FP4 for QR
+ * 
+	@param r FP4 instance
+    @param h optional generated hint
+	@return 1 x is a QR, otherwise 0
+ */
+extern int  FP4_qr(FP4 *r, FP *h);
+
+/**	@brief Calculate square root of an FP4
+ *
+	Square root
+	@param r FP4 instance, on exit = sqrt(x)
+	@param x FP4 instance
+    @param h optional input hint
+ */
+extern void  FP4_sqrt(FP4 *r, FP4 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP4 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP4 instance, set to y if s!=0
+	@param y another FP4 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP4_cmove(FP4 *x, FP4 *y, int s);
+
+
+/**	@brief Divide FP4 number by QNR
+ *
+	Divide FP4 by the QNR
+	@param x FP4 instance
+ */
+extern void FP4_div_i(FP4 *x);
+
+/**	@brief Generate random FP4
+ *
+	@param x random FP4 number
+	@param rng random number generator
+ */
+extern void FP4_rand(FP4 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp4_BLS48556.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp4_BLS48556.h
new file mode 100644
index 0000000..673d738
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp4_BLS48556.h
@@ -0,0 +1,349 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP4_BLS48556_H
+#define FP4_BLS48556_H
+
+#include "fp2_BLS48556.h"
+#include "config_curve_BLS48556.h"
+
+using namespace core;
+
+namespace BLS48556 {
+
+/**
+	@brief FP4 Structure - towered over two FP2
+*/
+
+typedef struct
+{
+    FP2 a; /**< real part of FP4 */
+    FP2 b; /**< imaginary part of FP4 */
+} FP4;
+
+
+/* FP4 prototypes */
+/**	@brief Tests for FP4 equal to zero
+ *
+	@param x FP4 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP4_iszilch(FP4 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP4 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP4_islarger(FP4 *x);
+
+/**	@brief Serialize out FP4  
+ *
+    @param b buffer for output
+	@param x FP4 number to be serialized
+ */
+extern void FP4_toBytes(char *b,FP4 *x);
+
+/**	@brief Serialize in FP4  
+ *
+	@param x FP4 number to be serialized
+    @param b buffer for input
+ */
+extern void FP4_fromBytes(FP4 *x,char *b);
+
+/**	@brief Tests for FP4 equal to unity
+ *
+	@param x FP4 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP4_isunity(FP4 *x);
+/**	@brief Tests for equality of two FP4s
+ *
+	@param x FP4 instance to be compared
+	@param y FP4 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP4_equals(FP4 *x, FP4 *y);
+/**	@brief Tests for FP4 having only a real part and no imaginary part
+ *
+	@param x FP4 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP4_isreal(FP4 *x);
+/**	@brief Initialise FP4 from two FP2s
+ *
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+	@param b FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2s(FP4 *x, FP2 *a, FP2 *b);
+/**	@brief Initialise FP4 from single FP2
+ *
+	Imaginary part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+ */
+extern void FP4_from_FP2(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP2
+ *
+	real part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2H(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP
+ *
+	@param x FP4 instance to be initialised
+	@param a FP to form real part of FP4
+ */
+extern void FP4_from_FP(FP4 *x, FP *a);
+
+/**	@brief Copy FP4 to another FP4
+ *
+	@param x FP4 instance, on exit = y
+	@param y FP4 instance to be copied
+ */
+extern void FP4_copy(FP4 *x, FP4 *y);
+/**	@brief Set FP4 to zero
+ *
+	@param x FP4 instance to be set to zero
+ */
+extern void FP4_zero(FP4 *x);
+/**	@brief Set FP4 to unity
+ *
+	@param x FP4 instance to be set to one
+ */
+extern void FP4_one(FP4 *x);
+
+/**	@brief Sign of FP4
+ *
+	@param x FP4 instance
+	@return "sign" of FP4
+ */
+extern int FP4_sign(FP4 *x);
+
+/**	@brief Negation of FP4
+ *
+	@param x FP4 instance, on exit = -y
+	@param y FP4 instance
+ */
+extern void FP4_neg(FP4 *x, FP4 *y);
+/**	@brief Conjugation of FP4
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP4 instance, on exit = conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_conj(FP4 *x, FP4 *y);
+/**	@brief Negative conjugation of FP4
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP4 instance, on exit = -conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_nconj(FP4 *x, FP4 *y);
+/**	@brief addition of two FP4s
+ *
+	@param x FP4 instance, on exit = y+z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_add(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief subtraction of two FP4s
+ *
+	@param x FP4 instance, on exit = y-z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_sub(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Multiplication of an FP4 by an FP2
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP2 multiplier
+ */
+extern void FP4_pmul(FP4 *x, FP4 *y, FP2 *a);
+
+
+/**	@brief Multiplication of an FP4 by an FP
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP multiplier
+ */
+extern void FP4_qmul(FP4 *x, FP4 *y, FP *a);
+
+/**	@brief Multiplication of an FP4 by a small integer
+ *
+	@param x FP4 instance, on exit = y*i
+	@param y FP4 instance
+	@param i an integer
+ */
+extern void FP4_imul(FP4 *x, FP4 *y, int i);
+/**	@brief Squaring an FP4
+ *
+	@param x FP4 instance, on exit = y^2
+	@param y FP4 instance
+ */
+extern void FP4_sqr(FP4 *x, FP4 *y);
+/**	@brief Multiplication of two FP4s
+ *
+	@param x FP4 instance, on exit = y*z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_mul(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Inverting an FP4
+ *
+	@param x FP4 instance, on exit = 1/y
+	@param y FP4 instance
+    @param h optional input hint
+ */
+extern void FP4_inv(FP4 *x, FP4 *y, FP *h);
+
+/**	@brief Divide an FP4 by 2
+ *
+	@param x FP4 instance, on exit = y/2
+	@param y FP4 instance
+ */
+extern void FP4_div2(FP4 *x, FP4 *y);
+
+
+/**	@brief Formats and outputs an FP4 to the console
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_output(FP4 *x);
+/**	@brief Formats and outputs an FP4 to the console in raw form (for debugging)
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_rawoutput(FP4 *x);
+/**	@brief multiplies an FP4 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP4 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP4_times_i(FP4 *x);
+/**	@brief Normalises the components of an FP4
+ *
+	@param x FP4 instance to be normalised
+ */
+extern void FP4_norm(FP4 *x);
+/**	@brief Reduces all components of possibly unreduced FP4 mod Modulus
+ *
+	@param x FP4 instance, on exit reduced mod Modulus
+ */
+extern void FP4_reduce(FP4 *x);
+/**	@brief Raises an FP4 to the power of a BIG
+ *
+	@param x FP4 instance, on exit = y^b
+	@param y FP4 instance
+	@param b BIG number
+ */
+extern void FP4_pow(FP4 *x, FP4 *y, B560_58::BIG b);
+/**	@brief Raises an FP4 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP4 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP4_frob(FP4 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP4 instance, on exit = w*x-conj(x)*y+z
+	@param w FP4 instance
+	@param x FP4 instance
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_xtr_A(FP4 *r, FP4 *w, FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP4 instance, on exit = x^2-2*conj(x)
+	@param x FP4 instance
+ */
+extern void FP4_xtr_D(FP4 *r, FP4 *x);
+/**	@brief Calculates FP4 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP4 instance, on exit = trace(w^b)
+	@param x FP4 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP4_xtr_pow(FP4 *r, FP4 *x, B560_58::BIG b);
+/**	@brief Calculates FP4 trace of c^a.d^b, where c and d are derived from FP4 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP4 instance, on exit = trace(c^a.d^b)
+	@param c FP4 instance, trace of an FP12
+	@param d FP4 instance, trace of an FP12
+	@param e FP4 instance, trace of an FP12
+	@param f FP4 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP4_xtr_pow2(FP4 *r, FP4 *c, FP4 *d, FP4 *e, FP4 *f, B560_58::BIG a, B560_58::BIG b);
+
+/**	@brief Test FP4 for QR
+ * 
+	@param r FP4 instance
+    @param h optional generated hint
+	@return 1 x is a QR, otherwise 0
+ */
+extern int  FP4_qr(FP4 *r, FP *h);
+
+/**	@brief Calculate square root of an FP4
+ *
+	Square root
+	@param r FP4 instance, on exit = sqrt(x)
+	@param x FP4 instance
+    @param h optional input hint
+ */
+extern void  FP4_sqrt(FP4 *r, FP4 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP4 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP4 instance, set to y if s!=0
+	@param y another FP4 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP4_cmove(FP4 *x, FP4 *y, int s);
+
+
+/**	@brief Divide FP4 number by QNR
+ *
+	Divide FP4 by the QNR
+	@param x FP4 instance
+ */
+extern void FP4_div_i(FP4 *x);
+
+/**	@brief Generate random FP4
+ *
+	@param x random FP4 number
+	@param rng random number generator
+ */
+extern void FP4_rand(FP4 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp4_BLS48581.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp4_BLS48581.h
new file mode 100644
index 0000000..775f4b5
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp4_BLS48581.h
@@ -0,0 +1,349 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP4_BLS48581_H
+#define FP4_BLS48581_H
+
+#include "fp2_BLS48581.h"
+#include "config_curve_BLS48581.h"
+
+using namespace core;
+
+namespace BLS48581 {
+
+/**
+	@brief FP4 Structure - towered over two FP2
+*/
+
+typedef struct
+{
+    FP2 a; /**< real part of FP4 */
+    FP2 b; /**< imaginary part of FP4 */
+} FP4;
+
+
+/* FP4 prototypes */
+/**	@brief Tests for FP4 equal to zero
+ *
+	@param x FP4 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP4_iszilch(FP4 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP4 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP4_islarger(FP4 *x);
+
+/**	@brief Serialize out FP4  
+ *
+    @param b buffer for output
+	@param x FP4 number to be serialized
+ */
+extern void FP4_toBytes(char *b,FP4 *x);
+
+/**	@brief Serialize in FP4  
+ *
+	@param x FP4 number to be serialized
+    @param b buffer for input
+ */
+extern void FP4_fromBytes(FP4 *x,char *b);
+
+/**	@brief Tests for FP4 equal to unity
+ *
+	@param x FP4 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP4_isunity(FP4 *x);
+/**	@brief Tests for equality of two FP4s
+ *
+	@param x FP4 instance to be compared
+	@param y FP4 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP4_equals(FP4 *x, FP4 *y);
+/**	@brief Tests for FP4 having only a real part and no imaginary part
+ *
+	@param x FP4 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP4_isreal(FP4 *x);
+/**	@brief Initialise FP4 from two FP2s
+ *
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+	@param b FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2s(FP4 *x, FP2 *a, FP2 *b);
+/**	@brief Initialise FP4 from single FP2
+ *
+	Imaginary part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+ */
+extern void FP4_from_FP2(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP2
+ *
+	real part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2H(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP
+ *
+	@param x FP4 instance to be initialised
+	@param a FP to form real part of FP4
+ */
+extern void FP4_from_FP(FP4 *x, FP *a);
+
+/**	@brief Copy FP4 to another FP4
+ *
+	@param x FP4 instance, on exit = y
+	@param y FP4 instance to be copied
+ */
+extern void FP4_copy(FP4 *x, FP4 *y);
+/**	@brief Set FP4 to zero
+ *
+	@param x FP4 instance to be set to zero
+ */
+extern void FP4_zero(FP4 *x);
+/**	@brief Set FP4 to unity
+ *
+	@param x FP4 instance to be set to one
+ */
+extern void FP4_one(FP4 *x);
+
+/**	@brief Sign of FP4
+ *
+	@param x FP4 instance
+	@return "sign" of FP4
+ */
+extern int FP4_sign(FP4 *x);
+
+/**	@brief Negation of FP4
+ *
+	@param x FP4 instance, on exit = -y
+	@param y FP4 instance
+ */
+extern void FP4_neg(FP4 *x, FP4 *y);
+/**	@brief Conjugation of FP4
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP4 instance, on exit = conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_conj(FP4 *x, FP4 *y);
+/**	@brief Negative conjugation of FP4
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP4 instance, on exit = -conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_nconj(FP4 *x, FP4 *y);
+/**	@brief addition of two FP4s
+ *
+	@param x FP4 instance, on exit = y+z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_add(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief subtraction of two FP4s
+ *
+	@param x FP4 instance, on exit = y-z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_sub(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Multiplication of an FP4 by an FP2
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP2 multiplier
+ */
+extern void FP4_pmul(FP4 *x, FP4 *y, FP2 *a);
+
+
+/**	@brief Multiplication of an FP4 by an FP
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP multiplier
+ */
+extern void FP4_qmul(FP4 *x, FP4 *y, FP *a);
+
+/**	@brief Multiplication of an FP4 by a small integer
+ *
+	@param x FP4 instance, on exit = y*i
+	@param y FP4 instance
+	@param i an integer
+ */
+extern void FP4_imul(FP4 *x, FP4 *y, int i);
+/**	@brief Squaring an FP4
+ *
+	@param x FP4 instance, on exit = y^2
+	@param y FP4 instance
+ */
+extern void FP4_sqr(FP4 *x, FP4 *y);
+/**	@brief Multiplication of two FP4s
+ *
+	@param x FP4 instance, on exit = y*z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_mul(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Inverting an FP4
+ *
+	@param x FP4 instance, on exit = 1/y
+	@param y FP4 instance
+    @param h optional input hint
+ */
+extern void FP4_inv(FP4 *x, FP4 *y, FP *h);
+
+/**	@brief Divide an FP4 by 2
+ *
+	@param x FP4 instance, on exit = y/2
+	@param y FP4 instance
+ */
+extern void FP4_div2(FP4 *x, FP4 *y);
+
+
+/**	@brief Formats and outputs an FP4 to the console
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_output(FP4 *x);
+/**	@brief Formats and outputs an FP4 to the console in raw form (for debugging)
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_rawoutput(FP4 *x);
+/**	@brief multiplies an FP4 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP4 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP4_times_i(FP4 *x);
+/**	@brief Normalises the components of an FP4
+ *
+	@param x FP4 instance to be normalised
+ */
+extern void FP4_norm(FP4 *x);
+/**	@brief Reduces all components of possibly unreduced FP4 mod Modulus
+ *
+	@param x FP4 instance, on exit reduced mod Modulus
+ */
+extern void FP4_reduce(FP4 *x);
+/**	@brief Raises an FP4 to the power of a BIG
+ *
+	@param x FP4 instance, on exit = y^b
+	@param y FP4 instance
+	@param b BIG number
+ */
+extern void FP4_pow(FP4 *x, FP4 *y, B584_60::BIG b);
+/**	@brief Raises an FP4 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP4 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP4_frob(FP4 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP4 instance, on exit = w*x-conj(x)*y+z
+	@param w FP4 instance
+	@param x FP4 instance
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_xtr_A(FP4 *r, FP4 *w, FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP4 instance, on exit = x^2-2*conj(x)
+	@param x FP4 instance
+ */
+extern void FP4_xtr_D(FP4 *r, FP4 *x);
+/**	@brief Calculates FP4 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP4 instance, on exit = trace(w^b)
+	@param x FP4 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP4_xtr_pow(FP4 *r, FP4 *x, B584_60::BIG b);
+/**	@brief Calculates FP4 trace of c^a.d^b, where c and d are derived from FP4 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP4 instance, on exit = trace(c^a.d^b)
+	@param c FP4 instance, trace of an FP12
+	@param d FP4 instance, trace of an FP12
+	@param e FP4 instance, trace of an FP12
+	@param f FP4 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP4_xtr_pow2(FP4 *r, FP4 *c, FP4 *d, FP4 *e, FP4 *f, B584_60::BIG a, B584_60::BIG b);
+
+/**	@brief Test FP4 for QR
+ * 
+	@param r FP4 instance
+    @param h optional generated hint
+	@return 1 x is a QR, otherwise 0
+ */
+extern int  FP4_qr(FP4 *r, FP *h);
+
+/**	@brief Calculate square root of an FP4
+ *
+	Square root
+	@param r FP4 instance, on exit = sqrt(x)
+	@param x FP4 instance
+    @param h optional input hint
+ */
+extern void  FP4_sqrt(FP4 *r, FP4 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP4 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP4 instance, set to y if s!=0
+	@param y another FP4 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP4_cmove(FP4 *x, FP4 *y, int s);
+
+
+/**	@brief Divide FP4 number by QNR
+ *
+	Divide FP4 by the QNR
+	@param x FP4 instance
+ */
+extern void FP4_div_i(FP4 *x);
+
+/**	@brief Generate random FP4
+ *
+	@param x random FP4 number
+	@param rng random number generator
+ */
+extern void FP4_rand(FP4 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp4_BN158.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp4_BN158.h
new file mode 100644
index 0000000..c1f625c
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp4_BN158.h
@@ -0,0 +1,349 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP4_BN158_H
+#define FP4_BN158_H
+
+#include "fp2_BN158.h"
+#include "config_curve_BN158.h"
+
+using namespace core;
+
+namespace BN158 {
+
+/**
+	@brief FP4 Structure - towered over two FP2
+*/
+
+typedef struct
+{
+    FP2 a; /**< real part of FP4 */
+    FP2 b; /**< imaginary part of FP4 */
+} FP4;
+
+
+/* FP4 prototypes */
+/**	@brief Tests for FP4 equal to zero
+ *
+	@param x FP4 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP4_iszilch(FP4 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP4 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP4_islarger(FP4 *x);
+
+/**	@brief Serialize out FP4  
+ *
+    @param b buffer for output
+	@param x FP4 number to be serialized
+ */
+extern void FP4_toBytes(char *b,FP4 *x);
+
+/**	@brief Serialize in FP4  
+ *
+	@param x FP4 number to be serialized
+    @param b buffer for input
+ */
+extern void FP4_fromBytes(FP4 *x,char *b);
+
+/**	@brief Tests for FP4 equal to unity
+ *
+	@param x FP4 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP4_isunity(FP4 *x);
+/**	@brief Tests for equality of two FP4s
+ *
+	@param x FP4 instance to be compared
+	@param y FP4 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP4_equals(FP4 *x, FP4 *y);
+/**	@brief Tests for FP4 having only a real part and no imaginary part
+ *
+	@param x FP4 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP4_isreal(FP4 *x);
+/**	@brief Initialise FP4 from two FP2s
+ *
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+	@param b FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2s(FP4 *x, FP2 *a, FP2 *b);
+/**	@brief Initialise FP4 from single FP2
+ *
+	Imaginary part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+ */
+extern void FP4_from_FP2(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP2
+ *
+	real part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2H(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP
+ *
+	@param x FP4 instance to be initialised
+	@param a FP to form real part of FP4
+ */
+extern void FP4_from_FP(FP4 *x, FP *a);
+
+/**	@brief Copy FP4 to another FP4
+ *
+	@param x FP4 instance, on exit = y
+	@param y FP4 instance to be copied
+ */
+extern void FP4_copy(FP4 *x, FP4 *y);
+/**	@brief Set FP4 to zero
+ *
+	@param x FP4 instance to be set to zero
+ */
+extern void FP4_zero(FP4 *x);
+/**	@brief Set FP4 to unity
+ *
+	@param x FP4 instance to be set to one
+ */
+extern void FP4_one(FP4 *x);
+
+/**	@brief Sign of FP4
+ *
+	@param x FP4 instance
+	@return "sign" of FP4
+ */
+extern int FP4_sign(FP4 *x);
+
+/**	@brief Negation of FP4
+ *
+	@param x FP4 instance, on exit = -y
+	@param y FP4 instance
+ */
+extern void FP4_neg(FP4 *x, FP4 *y);
+/**	@brief Conjugation of FP4
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP4 instance, on exit = conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_conj(FP4 *x, FP4 *y);
+/**	@brief Negative conjugation of FP4
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP4 instance, on exit = -conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_nconj(FP4 *x, FP4 *y);
+/**	@brief addition of two FP4s
+ *
+	@param x FP4 instance, on exit = y+z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_add(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief subtraction of two FP4s
+ *
+	@param x FP4 instance, on exit = y-z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_sub(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Multiplication of an FP4 by an FP2
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP2 multiplier
+ */
+extern void FP4_pmul(FP4 *x, FP4 *y, FP2 *a);
+
+
+/**	@brief Multiplication of an FP4 by an FP
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP multiplier
+ */
+extern void FP4_qmul(FP4 *x, FP4 *y, FP *a);
+
+/**	@brief Multiplication of an FP4 by a small integer
+ *
+	@param x FP4 instance, on exit = y*i
+	@param y FP4 instance
+	@param i an integer
+ */
+extern void FP4_imul(FP4 *x, FP4 *y, int i);
+/**	@brief Squaring an FP4
+ *
+	@param x FP4 instance, on exit = y^2
+	@param y FP4 instance
+ */
+extern void FP4_sqr(FP4 *x, FP4 *y);
+/**	@brief Multiplication of two FP4s
+ *
+	@param x FP4 instance, on exit = y*z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_mul(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Inverting an FP4
+ *
+	@param x FP4 instance, on exit = 1/y
+	@param y FP4 instance
+    @param h optional input hint
+ */
+extern void FP4_inv(FP4 *x, FP4 *y, FP *h);
+
+/**	@brief Divide an FP4 by 2
+ *
+	@param x FP4 instance, on exit = y/2
+	@param y FP4 instance
+ */
+extern void FP4_div2(FP4 *x, FP4 *y);
+
+
+/**	@brief Formats and outputs an FP4 to the console
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_output(FP4 *x);
+/**	@brief Formats and outputs an FP4 to the console in raw form (for debugging)
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_rawoutput(FP4 *x);
+/**	@brief multiplies an FP4 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP4 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP4_times_i(FP4 *x);
+/**	@brief Normalises the components of an FP4
+ *
+	@param x FP4 instance to be normalised
+ */
+extern void FP4_norm(FP4 *x);
+/**	@brief Reduces all components of possibly unreduced FP4 mod Modulus
+ *
+	@param x FP4 instance, on exit reduced mod Modulus
+ */
+extern void FP4_reduce(FP4 *x);
+/**	@brief Raises an FP4 to the power of a BIG
+ *
+	@param x FP4 instance, on exit = y^b
+	@param y FP4 instance
+	@param b BIG number
+ */
+extern void FP4_pow(FP4 *x, FP4 *y, B160_56::BIG b);
+/**	@brief Raises an FP4 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP4 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP4_frob(FP4 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP4 instance, on exit = w*x-conj(x)*y+z
+	@param w FP4 instance
+	@param x FP4 instance
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_xtr_A(FP4 *r, FP4 *w, FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP4 instance, on exit = x^2-2*conj(x)
+	@param x FP4 instance
+ */
+extern void FP4_xtr_D(FP4 *r, FP4 *x);
+/**	@brief Calculates FP4 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP4 instance, on exit = trace(w^b)
+	@param x FP4 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP4_xtr_pow(FP4 *r, FP4 *x, B160_56::BIG b);
+/**	@brief Calculates FP4 trace of c^a.d^b, where c and d are derived from FP4 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP4 instance, on exit = trace(c^a.d^b)
+	@param c FP4 instance, trace of an FP12
+	@param d FP4 instance, trace of an FP12
+	@param e FP4 instance, trace of an FP12
+	@param f FP4 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP4_xtr_pow2(FP4 *r, FP4 *c, FP4 *d, FP4 *e, FP4 *f, B160_56::BIG a, B160_56::BIG b);
+
+/**	@brief Test FP4 for QR
+ * 
+	@param r FP4 instance
+    @param h optional generated hint
+	@return 1 x is a QR, otherwise 0
+ */
+extern int  FP4_qr(FP4 *r, FP *h);
+
+/**	@brief Calculate square root of an FP4
+ *
+	Square root
+	@param r FP4 instance, on exit = sqrt(x)
+	@param x FP4 instance
+    @param h optional input hint
+ */
+extern void  FP4_sqrt(FP4 *r, FP4 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP4 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP4 instance, set to y if s!=0
+	@param y another FP4 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP4_cmove(FP4 *x, FP4 *y, int s);
+
+
+/**	@brief Divide FP4 number by QNR
+ *
+	Divide FP4 by the QNR
+	@param x FP4 instance
+ */
+extern void FP4_div_i(FP4 *x);
+
+/**	@brief Generate random FP4
+ *
+	@param x random FP4 number
+	@param rng random number generator
+ */
+extern void FP4_rand(FP4 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp4_BN254.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp4_BN254.h
new file mode 100644
index 0000000..dfcf3b6
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp4_BN254.h
@@ -0,0 +1,349 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP4_BN254_H
+#define FP4_BN254_H
+
+#include "fp2_BN254.h"
+#include "config_curve_BN254.h"
+
+using namespace core;
+
+namespace BN254 {
+
+/**
+	@brief FP4 Structure - towered over two FP2
+*/
+
+typedef struct
+{
+    FP2 a; /**< real part of FP4 */
+    FP2 b; /**< imaginary part of FP4 */
+} FP4;
+
+
+/* FP4 prototypes */
+/**	@brief Tests for FP4 equal to zero
+ *
+	@param x FP4 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP4_iszilch(FP4 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP4 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP4_islarger(FP4 *x);
+
+/**	@brief Serialize out FP4  
+ *
+    @param b buffer for output
+	@param x FP4 number to be serialized
+ */
+extern void FP4_toBytes(char *b,FP4 *x);
+
+/**	@brief Serialize in FP4  
+ *
+	@param x FP4 number to be serialized
+    @param b buffer for input
+ */
+extern void FP4_fromBytes(FP4 *x,char *b);
+
+/**	@brief Tests for FP4 equal to unity
+ *
+	@param x FP4 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP4_isunity(FP4 *x);
+/**	@brief Tests for equality of two FP4s
+ *
+	@param x FP4 instance to be compared
+	@param y FP4 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP4_equals(FP4 *x, FP4 *y);
+/**	@brief Tests for FP4 having only a real part and no imaginary part
+ *
+	@param x FP4 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP4_isreal(FP4 *x);
+/**	@brief Initialise FP4 from two FP2s
+ *
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+	@param b FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2s(FP4 *x, FP2 *a, FP2 *b);
+/**	@brief Initialise FP4 from single FP2
+ *
+	Imaginary part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+ */
+extern void FP4_from_FP2(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP2
+ *
+	real part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2H(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP
+ *
+	@param x FP4 instance to be initialised
+	@param a FP to form real part of FP4
+ */
+extern void FP4_from_FP(FP4 *x, FP *a);
+
+/**	@brief Copy FP4 to another FP4
+ *
+	@param x FP4 instance, on exit = y
+	@param y FP4 instance to be copied
+ */
+extern void FP4_copy(FP4 *x, FP4 *y);
+/**	@brief Set FP4 to zero
+ *
+	@param x FP4 instance to be set to zero
+ */
+extern void FP4_zero(FP4 *x);
+/**	@brief Set FP4 to unity
+ *
+	@param x FP4 instance to be set to one
+ */
+extern void FP4_one(FP4 *x);
+
+/**	@brief Sign of FP4
+ *
+	@param x FP4 instance
+	@return "sign" of FP4
+ */
+extern int FP4_sign(FP4 *x);
+
+/**	@brief Negation of FP4
+ *
+	@param x FP4 instance, on exit = -y
+	@param y FP4 instance
+ */
+extern void FP4_neg(FP4 *x, FP4 *y);
+/**	@brief Conjugation of FP4
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP4 instance, on exit = conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_conj(FP4 *x, FP4 *y);
+/**	@brief Negative conjugation of FP4
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP4 instance, on exit = -conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_nconj(FP4 *x, FP4 *y);
+/**	@brief addition of two FP4s
+ *
+	@param x FP4 instance, on exit = y+z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_add(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief subtraction of two FP4s
+ *
+	@param x FP4 instance, on exit = y-z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_sub(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Multiplication of an FP4 by an FP2
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP2 multiplier
+ */
+extern void FP4_pmul(FP4 *x, FP4 *y, FP2 *a);
+
+
+/**	@brief Multiplication of an FP4 by an FP
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP multiplier
+ */
+extern void FP4_qmul(FP4 *x, FP4 *y, FP *a);
+
+/**	@brief Multiplication of an FP4 by a small integer
+ *
+	@param x FP4 instance, on exit = y*i
+	@param y FP4 instance
+	@param i an integer
+ */
+extern void FP4_imul(FP4 *x, FP4 *y, int i);
+/**	@brief Squaring an FP4
+ *
+	@param x FP4 instance, on exit = y^2
+	@param y FP4 instance
+ */
+extern void FP4_sqr(FP4 *x, FP4 *y);
+/**	@brief Multiplication of two FP4s
+ *
+	@param x FP4 instance, on exit = y*z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_mul(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Inverting an FP4
+ *
+	@param x FP4 instance, on exit = 1/y
+	@param y FP4 instance
+    @param h optional input hint
+ */
+extern void FP4_inv(FP4 *x, FP4 *y, FP *h);
+
+/**	@brief Divide an FP4 by 2
+ *
+	@param x FP4 instance, on exit = y/2
+	@param y FP4 instance
+ */
+extern void FP4_div2(FP4 *x, FP4 *y);
+
+
+/**	@brief Formats and outputs an FP4 to the console
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_output(FP4 *x);
+/**	@brief Formats and outputs an FP4 to the console in raw form (for debugging)
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_rawoutput(FP4 *x);
+/**	@brief multiplies an FP4 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP4 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP4_times_i(FP4 *x);
+/**	@brief Normalises the components of an FP4
+ *
+	@param x FP4 instance to be normalised
+ */
+extern void FP4_norm(FP4 *x);
+/**	@brief Reduces all components of possibly unreduced FP4 mod Modulus
+ *
+	@param x FP4 instance, on exit reduced mod Modulus
+ */
+extern void FP4_reduce(FP4 *x);
+/**	@brief Raises an FP4 to the power of a BIG
+ *
+	@param x FP4 instance, on exit = y^b
+	@param y FP4 instance
+	@param b BIG number
+ */
+extern void FP4_pow(FP4 *x, FP4 *y, B256_56::BIG b);
+/**	@brief Raises an FP4 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP4 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP4_frob(FP4 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP4 instance, on exit = w*x-conj(x)*y+z
+	@param w FP4 instance
+	@param x FP4 instance
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_xtr_A(FP4 *r, FP4 *w, FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP4 instance, on exit = x^2-2*conj(x)
+	@param x FP4 instance
+ */
+extern void FP4_xtr_D(FP4 *r, FP4 *x);
+/**	@brief Calculates FP4 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP4 instance, on exit = trace(w^b)
+	@param x FP4 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP4_xtr_pow(FP4 *r, FP4 *x, B256_56::BIG b);
+/**	@brief Calculates FP4 trace of c^a.d^b, where c and d are derived from FP4 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP4 instance, on exit = trace(c^a.d^b)
+	@param c FP4 instance, trace of an FP12
+	@param d FP4 instance, trace of an FP12
+	@param e FP4 instance, trace of an FP12
+	@param f FP4 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP4_xtr_pow2(FP4 *r, FP4 *c, FP4 *d, FP4 *e, FP4 *f, B256_56::BIG a, B256_56::BIG b);
+
+/**	@brief Test FP4 for QR
+ * 
+	@param r FP4 instance
+    @param h optional generated hint
+	@return 1 x is a QR, otherwise 0
+ */
+extern int  FP4_qr(FP4 *r, FP *h);
+
+/**	@brief Calculate square root of an FP4
+ *
+	Square root
+	@param r FP4 instance, on exit = sqrt(x)
+	@param x FP4 instance
+    @param h optional input hint
+ */
+extern void  FP4_sqrt(FP4 *r, FP4 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP4 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP4 instance, set to y if s!=0
+	@param y another FP4 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP4_cmove(FP4 *x, FP4 *y, int s);
+
+
+/**	@brief Divide FP4 number by QNR
+ *
+	Divide FP4 by the QNR
+	@param x FP4 instance
+ */
+extern void FP4_div_i(FP4 *x);
+
+/**	@brief Generate random FP4
+ *
+	@param x random FP4 number
+	@param rng random number generator
+ */
+extern void FP4_rand(FP4 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp4_BN254CX.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp4_BN254CX.h
new file mode 100644
index 0000000..005dc0a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp4_BN254CX.h
@@ -0,0 +1,349 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP4_BN254CX_H
+#define FP4_BN254CX_H
+
+#include "fp2_BN254CX.h"
+#include "config_curve_BN254CX.h"
+
+using namespace core;
+
+namespace BN254CX {
+
+/**
+	@brief FP4 Structure - towered over two FP2
+*/
+
+typedef struct
+{
+    FP2 a; /**< real part of FP4 */
+    FP2 b; /**< imaginary part of FP4 */
+} FP4;
+
+
+/* FP4 prototypes */
+/**	@brief Tests for FP4 equal to zero
+ *
+	@param x FP4 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP4_iszilch(FP4 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP4 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP4_islarger(FP4 *x);
+
+/**	@brief Serialize out FP4  
+ *
+    @param b buffer for output
+	@param x FP4 number to be serialized
+ */
+extern void FP4_toBytes(char *b,FP4 *x);
+
+/**	@brief Serialize in FP4  
+ *
+	@param x FP4 number to be serialized
+    @param b buffer for input
+ */
+extern void FP4_fromBytes(FP4 *x,char *b);
+
+/**	@brief Tests for FP4 equal to unity
+ *
+	@param x FP4 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP4_isunity(FP4 *x);
+/**	@brief Tests for equality of two FP4s
+ *
+	@param x FP4 instance to be compared
+	@param y FP4 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP4_equals(FP4 *x, FP4 *y);
+/**	@brief Tests for FP4 having only a real part and no imaginary part
+ *
+	@param x FP4 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP4_isreal(FP4 *x);
+/**	@brief Initialise FP4 from two FP2s
+ *
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+	@param b FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2s(FP4 *x, FP2 *a, FP2 *b);
+/**	@brief Initialise FP4 from single FP2
+ *
+	Imaginary part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+ */
+extern void FP4_from_FP2(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP2
+ *
+	real part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2H(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP
+ *
+	@param x FP4 instance to be initialised
+	@param a FP to form real part of FP4
+ */
+extern void FP4_from_FP(FP4 *x, FP *a);
+
+/**	@brief Copy FP4 to another FP4
+ *
+	@param x FP4 instance, on exit = y
+	@param y FP4 instance to be copied
+ */
+extern void FP4_copy(FP4 *x, FP4 *y);
+/**	@brief Set FP4 to zero
+ *
+	@param x FP4 instance to be set to zero
+ */
+extern void FP4_zero(FP4 *x);
+/**	@brief Set FP4 to unity
+ *
+	@param x FP4 instance to be set to one
+ */
+extern void FP4_one(FP4 *x);
+
+/**	@brief Sign of FP4
+ *
+	@param x FP4 instance
+	@return "sign" of FP4
+ */
+extern int FP4_sign(FP4 *x);
+
+/**	@brief Negation of FP4
+ *
+	@param x FP4 instance, on exit = -y
+	@param y FP4 instance
+ */
+extern void FP4_neg(FP4 *x, FP4 *y);
+/**	@brief Conjugation of FP4
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP4 instance, on exit = conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_conj(FP4 *x, FP4 *y);
+/**	@brief Negative conjugation of FP4
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP4 instance, on exit = -conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_nconj(FP4 *x, FP4 *y);
+/**	@brief addition of two FP4s
+ *
+	@param x FP4 instance, on exit = y+z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_add(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief subtraction of two FP4s
+ *
+	@param x FP4 instance, on exit = y-z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_sub(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Multiplication of an FP4 by an FP2
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP2 multiplier
+ */
+extern void FP4_pmul(FP4 *x, FP4 *y, FP2 *a);
+
+
+/**	@brief Multiplication of an FP4 by an FP
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP multiplier
+ */
+extern void FP4_qmul(FP4 *x, FP4 *y, FP *a);
+
+/**	@brief Multiplication of an FP4 by a small integer
+ *
+	@param x FP4 instance, on exit = y*i
+	@param y FP4 instance
+	@param i an integer
+ */
+extern void FP4_imul(FP4 *x, FP4 *y, int i);
+/**	@brief Squaring an FP4
+ *
+	@param x FP4 instance, on exit = y^2
+	@param y FP4 instance
+ */
+extern void FP4_sqr(FP4 *x, FP4 *y);
+/**	@brief Multiplication of two FP4s
+ *
+	@param x FP4 instance, on exit = y*z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_mul(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Inverting an FP4
+ *
+	@param x FP4 instance, on exit = 1/y
+	@param y FP4 instance
+    @param h optional input hint
+ */
+extern void FP4_inv(FP4 *x, FP4 *y, FP *h);
+
+/**	@brief Divide an FP4 by 2
+ *
+	@param x FP4 instance, on exit = y/2
+	@param y FP4 instance
+ */
+extern void FP4_div2(FP4 *x, FP4 *y);
+
+
+/**	@brief Formats and outputs an FP4 to the console
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_output(FP4 *x);
+/**	@brief Formats and outputs an FP4 to the console in raw form (for debugging)
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_rawoutput(FP4 *x);
+/**	@brief multiplies an FP4 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP4 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP4_times_i(FP4 *x);
+/**	@brief Normalises the components of an FP4
+ *
+	@param x FP4 instance to be normalised
+ */
+extern void FP4_norm(FP4 *x);
+/**	@brief Reduces all components of possibly unreduced FP4 mod Modulus
+ *
+	@param x FP4 instance, on exit reduced mod Modulus
+ */
+extern void FP4_reduce(FP4 *x);
+/**	@brief Raises an FP4 to the power of a BIG
+ *
+	@param x FP4 instance, on exit = y^b
+	@param y FP4 instance
+	@param b BIG number
+ */
+extern void FP4_pow(FP4 *x, FP4 *y, B256_56::BIG b);
+/**	@brief Raises an FP4 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP4 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP4_frob(FP4 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP4 instance, on exit = w*x-conj(x)*y+z
+	@param w FP4 instance
+	@param x FP4 instance
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_xtr_A(FP4 *r, FP4 *w, FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP4 instance, on exit = x^2-2*conj(x)
+	@param x FP4 instance
+ */
+extern void FP4_xtr_D(FP4 *r, FP4 *x);
+/**	@brief Calculates FP4 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP4 instance, on exit = trace(w^b)
+	@param x FP4 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP4_xtr_pow(FP4 *r, FP4 *x, B256_56::BIG b);
+/**	@brief Calculates FP4 trace of c^a.d^b, where c and d are derived from FP4 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP4 instance, on exit = trace(c^a.d^b)
+	@param c FP4 instance, trace of an FP12
+	@param d FP4 instance, trace of an FP12
+	@param e FP4 instance, trace of an FP12
+	@param f FP4 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP4_xtr_pow2(FP4 *r, FP4 *c, FP4 *d, FP4 *e, FP4 *f, B256_56::BIG a, B256_56::BIG b);
+
+/**	@brief Test FP4 for QR
+ * 
+	@param r FP4 instance
+    @param h optional generated hint
+	@return 1 x is a QR, otherwise 0
+ */
+extern int  FP4_qr(FP4 *r, FP *h);
+
+/**	@brief Calculate square root of an FP4
+ *
+	Square root
+	@param r FP4 instance, on exit = sqrt(x)
+	@param x FP4 instance
+    @param h optional input hint
+ */
+extern void  FP4_sqrt(FP4 *r, FP4 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP4 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP4 instance, set to y if s!=0
+	@param y another FP4 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP4_cmove(FP4 *x, FP4 *y, int s);
+
+
+/**	@brief Divide FP4 number by QNR
+ *
+	Divide FP4 by the QNR
+	@param x FP4 instance
+ */
+extern void FP4_div_i(FP4 *x);
+
+/**	@brief Generate random FP4
+ *
+	@param x random FP4 number
+	@param rng random number generator
+ */
+extern void FP4_rand(FP4 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp4_BN462.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp4_BN462.h
new file mode 100644
index 0000000..f6726b6
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp4_BN462.h
@@ -0,0 +1,349 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP4_BN462_H
+#define FP4_BN462_H
+
+#include "fp2_BN462.h"
+#include "config_curve_BN462.h"
+
+using namespace core;
+
+namespace BN462 {
+
+/**
+	@brief FP4 Structure - towered over two FP2
+*/
+
+typedef struct
+{
+    FP2 a; /**< real part of FP4 */
+    FP2 b; /**< imaginary part of FP4 */
+} FP4;
+
+
+/* FP4 prototypes */
+/**	@brief Tests for FP4 equal to zero
+ *
+	@param x FP4 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP4_iszilch(FP4 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP4 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP4_islarger(FP4 *x);
+
+/**	@brief Serialize out FP4  
+ *
+    @param b buffer for output
+	@param x FP4 number to be serialized
+ */
+extern void FP4_toBytes(char *b,FP4 *x);
+
+/**	@brief Serialize in FP4  
+ *
+	@param x FP4 number to be serialized
+    @param b buffer for input
+ */
+extern void FP4_fromBytes(FP4 *x,char *b);
+
+/**	@brief Tests for FP4 equal to unity
+ *
+	@param x FP4 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP4_isunity(FP4 *x);
+/**	@brief Tests for equality of two FP4s
+ *
+	@param x FP4 instance to be compared
+	@param y FP4 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP4_equals(FP4 *x, FP4 *y);
+/**	@brief Tests for FP4 having only a real part and no imaginary part
+ *
+	@param x FP4 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP4_isreal(FP4 *x);
+/**	@brief Initialise FP4 from two FP2s
+ *
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+	@param b FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2s(FP4 *x, FP2 *a, FP2 *b);
+/**	@brief Initialise FP4 from single FP2
+ *
+	Imaginary part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+ */
+extern void FP4_from_FP2(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP2
+ *
+	real part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2H(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP
+ *
+	@param x FP4 instance to be initialised
+	@param a FP to form real part of FP4
+ */
+extern void FP4_from_FP(FP4 *x, FP *a);
+
+/**	@brief Copy FP4 to another FP4
+ *
+	@param x FP4 instance, on exit = y
+	@param y FP4 instance to be copied
+ */
+extern void FP4_copy(FP4 *x, FP4 *y);
+/**	@brief Set FP4 to zero
+ *
+	@param x FP4 instance to be set to zero
+ */
+extern void FP4_zero(FP4 *x);
+/**	@brief Set FP4 to unity
+ *
+	@param x FP4 instance to be set to one
+ */
+extern void FP4_one(FP4 *x);
+
+/**	@brief Sign of FP4
+ *
+	@param x FP4 instance
+	@return "sign" of FP4
+ */
+extern int FP4_sign(FP4 *x);
+
+/**	@brief Negation of FP4
+ *
+	@param x FP4 instance, on exit = -y
+	@param y FP4 instance
+ */
+extern void FP4_neg(FP4 *x, FP4 *y);
+/**	@brief Conjugation of FP4
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP4 instance, on exit = conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_conj(FP4 *x, FP4 *y);
+/**	@brief Negative conjugation of FP4
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP4 instance, on exit = -conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_nconj(FP4 *x, FP4 *y);
+/**	@brief addition of two FP4s
+ *
+	@param x FP4 instance, on exit = y+z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_add(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief subtraction of two FP4s
+ *
+	@param x FP4 instance, on exit = y-z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_sub(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Multiplication of an FP4 by an FP2
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP2 multiplier
+ */
+extern void FP4_pmul(FP4 *x, FP4 *y, FP2 *a);
+
+
+/**	@brief Multiplication of an FP4 by an FP
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP multiplier
+ */
+extern void FP4_qmul(FP4 *x, FP4 *y, FP *a);
+
+/**	@brief Multiplication of an FP4 by a small integer
+ *
+	@param x FP4 instance, on exit = y*i
+	@param y FP4 instance
+	@param i an integer
+ */
+extern void FP4_imul(FP4 *x, FP4 *y, int i);
+/**	@brief Squaring an FP4
+ *
+	@param x FP4 instance, on exit = y^2
+	@param y FP4 instance
+ */
+extern void FP4_sqr(FP4 *x, FP4 *y);
+/**	@brief Multiplication of two FP4s
+ *
+	@param x FP4 instance, on exit = y*z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_mul(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Inverting an FP4
+ *
+	@param x FP4 instance, on exit = 1/y
+	@param y FP4 instance
+    @param h optional input hint
+ */
+extern void FP4_inv(FP4 *x, FP4 *y, FP *h);
+
+/**	@brief Divide an FP4 by 2
+ *
+	@param x FP4 instance, on exit = y/2
+	@param y FP4 instance
+ */
+extern void FP4_div2(FP4 *x, FP4 *y);
+
+
+/**	@brief Formats and outputs an FP4 to the console
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_output(FP4 *x);
+/**	@brief Formats and outputs an FP4 to the console in raw form (for debugging)
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_rawoutput(FP4 *x);
+/**	@brief multiplies an FP4 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP4 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP4_times_i(FP4 *x);
+/**	@brief Normalises the components of an FP4
+ *
+	@param x FP4 instance to be normalised
+ */
+extern void FP4_norm(FP4 *x);
+/**	@brief Reduces all components of possibly unreduced FP4 mod Modulus
+ *
+	@param x FP4 instance, on exit reduced mod Modulus
+ */
+extern void FP4_reduce(FP4 *x);
+/**	@brief Raises an FP4 to the power of a BIG
+ *
+	@param x FP4 instance, on exit = y^b
+	@param y FP4 instance
+	@param b BIG number
+ */
+extern void FP4_pow(FP4 *x, FP4 *y, B464_60::BIG b);
+/**	@brief Raises an FP4 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP4 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP4_frob(FP4 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP4 instance, on exit = w*x-conj(x)*y+z
+	@param w FP4 instance
+	@param x FP4 instance
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_xtr_A(FP4 *r, FP4 *w, FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP4 instance, on exit = x^2-2*conj(x)
+	@param x FP4 instance
+ */
+extern void FP4_xtr_D(FP4 *r, FP4 *x);
+/**	@brief Calculates FP4 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP4 instance, on exit = trace(w^b)
+	@param x FP4 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP4_xtr_pow(FP4 *r, FP4 *x, B464_60::BIG b);
+/**	@brief Calculates FP4 trace of c^a.d^b, where c and d are derived from FP4 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP4 instance, on exit = trace(c^a.d^b)
+	@param c FP4 instance, trace of an FP12
+	@param d FP4 instance, trace of an FP12
+	@param e FP4 instance, trace of an FP12
+	@param f FP4 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP4_xtr_pow2(FP4 *r, FP4 *c, FP4 *d, FP4 *e, FP4 *f, B464_60::BIG a, B464_60::BIG b);
+
+/**	@brief Test FP4 for QR
+ * 
+	@param r FP4 instance
+    @param h optional generated hint
+	@return 1 x is a QR, otherwise 0
+ */
+extern int  FP4_qr(FP4 *r, FP *h);
+
+/**	@brief Calculate square root of an FP4
+ *
+	Square root
+	@param r FP4 instance, on exit = sqrt(x)
+	@param x FP4 instance
+    @param h optional input hint
+ */
+extern void  FP4_sqrt(FP4 *r, FP4 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP4 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP4 instance, set to y if s!=0
+	@param y another FP4 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP4_cmove(FP4 *x, FP4 *y, int s);
+
+
+/**	@brief Divide FP4 number by QNR
+ *
+	Divide FP4 by the QNR
+	@param x FP4 instance
+ */
+extern void FP4_div_i(FP4 *x);
+
+/**	@brief Generate random FP4
+ *
+	@param x random FP4 number
+	@param rng random number generator
+ */
+extern void FP4_rand(FP4 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp4_FP256BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp4_FP256BN.h
new file mode 100644
index 0000000..b53223a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp4_FP256BN.h
@@ -0,0 +1,349 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP4_FP256BN_H
+#define FP4_FP256BN_H
+
+#include "fp2_FP256BN.h"
+#include "config_curve_FP256BN.h"
+
+using namespace core;
+
+namespace FP256BN {
+
+/**
+	@brief FP4 Structure - towered over two FP2
+*/
+
+typedef struct
+{
+    FP2 a; /**< real part of FP4 */
+    FP2 b; /**< imaginary part of FP4 */
+} FP4;
+
+
+/* FP4 prototypes */
+/**	@brief Tests for FP4 equal to zero
+ *
+	@param x FP4 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP4_iszilch(FP4 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP4 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP4_islarger(FP4 *x);
+
+/**	@brief Serialize out FP4  
+ *
+    @param b buffer for output
+	@param x FP4 number to be serialized
+ */
+extern void FP4_toBytes(char *b,FP4 *x);
+
+/**	@brief Serialize in FP4  
+ *
+	@param x FP4 number to be serialized
+    @param b buffer for input
+ */
+extern void FP4_fromBytes(FP4 *x,char *b);
+
+/**	@brief Tests for FP4 equal to unity
+ *
+	@param x FP4 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP4_isunity(FP4 *x);
+/**	@brief Tests for equality of two FP4s
+ *
+	@param x FP4 instance to be compared
+	@param y FP4 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP4_equals(FP4 *x, FP4 *y);
+/**	@brief Tests for FP4 having only a real part and no imaginary part
+ *
+	@param x FP4 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP4_isreal(FP4 *x);
+/**	@brief Initialise FP4 from two FP2s
+ *
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+	@param b FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2s(FP4 *x, FP2 *a, FP2 *b);
+/**	@brief Initialise FP4 from single FP2
+ *
+	Imaginary part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+ */
+extern void FP4_from_FP2(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP2
+ *
+	real part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2H(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP
+ *
+	@param x FP4 instance to be initialised
+	@param a FP to form real part of FP4
+ */
+extern void FP4_from_FP(FP4 *x, FP *a);
+
+/**	@brief Copy FP4 to another FP4
+ *
+	@param x FP4 instance, on exit = y
+	@param y FP4 instance to be copied
+ */
+extern void FP4_copy(FP4 *x, FP4 *y);
+/**	@brief Set FP4 to zero
+ *
+	@param x FP4 instance to be set to zero
+ */
+extern void FP4_zero(FP4 *x);
+/**	@brief Set FP4 to unity
+ *
+	@param x FP4 instance to be set to one
+ */
+extern void FP4_one(FP4 *x);
+
+/**	@brief Sign of FP4
+ *
+	@param x FP4 instance
+	@return "sign" of FP4
+ */
+extern int FP4_sign(FP4 *x);
+
+/**	@brief Negation of FP4
+ *
+	@param x FP4 instance, on exit = -y
+	@param y FP4 instance
+ */
+extern void FP4_neg(FP4 *x, FP4 *y);
+/**	@brief Conjugation of FP4
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP4 instance, on exit = conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_conj(FP4 *x, FP4 *y);
+/**	@brief Negative conjugation of FP4
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP4 instance, on exit = -conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_nconj(FP4 *x, FP4 *y);
+/**	@brief addition of two FP4s
+ *
+	@param x FP4 instance, on exit = y+z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_add(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief subtraction of two FP4s
+ *
+	@param x FP4 instance, on exit = y-z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_sub(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Multiplication of an FP4 by an FP2
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP2 multiplier
+ */
+extern void FP4_pmul(FP4 *x, FP4 *y, FP2 *a);
+
+
+/**	@brief Multiplication of an FP4 by an FP
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP multiplier
+ */
+extern void FP4_qmul(FP4 *x, FP4 *y, FP *a);
+
+/**	@brief Multiplication of an FP4 by a small integer
+ *
+	@param x FP4 instance, on exit = y*i
+	@param y FP4 instance
+	@param i an integer
+ */
+extern void FP4_imul(FP4 *x, FP4 *y, int i);
+/**	@brief Squaring an FP4
+ *
+	@param x FP4 instance, on exit = y^2
+	@param y FP4 instance
+ */
+extern void FP4_sqr(FP4 *x, FP4 *y);
+/**	@brief Multiplication of two FP4s
+ *
+	@param x FP4 instance, on exit = y*z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_mul(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Inverting an FP4
+ *
+	@param x FP4 instance, on exit = 1/y
+	@param y FP4 instance
+    @param h optional input hint
+ */
+extern void FP4_inv(FP4 *x, FP4 *y, FP *h);
+
+/**	@brief Divide an FP4 by 2
+ *
+	@param x FP4 instance, on exit = y/2
+	@param y FP4 instance
+ */
+extern void FP4_div2(FP4 *x, FP4 *y);
+
+
+/**	@brief Formats and outputs an FP4 to the console
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_output(FP4 *x);
+/**	@brief Formats and outputs an FP4 to the console in raw form (for debugging)
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_rawoutput(FP4 *x);
+/**	@brief multiplies an FP4 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP4 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP4_times_i(FP4 *x);
+/**	@brief Normalises the components of an FP4
+ *
+	@param x FP4 instance to be normalised
+ */
+extern void FP4_norm(FP4 *x);
+/**	@brief Reduces all components of possibly unreduced FP4 mod Modulus
+ *
+	@param x FP4 instance, on exit reduced mod Modulus
+ */
+extern void FP4_reduce(FP4 *x);
+/**	@brief Raises an FP4 to the power of a BIG
+ *
+	@param x FP4 instance, on exit = y^b
+	@param y FP4 instance
+	@param b BIG number
+ */
+extern void FP4_pow(FP4 *x, FP4 *y, B256_56::BIG b);
+/**	@brief Raises an FP4 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP4 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP4_frob(FP4 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP4 instance, on exit = w*x-conj(x)*y+z
+	@param w FP4 instance
+	@param x FP4 instance
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_xtr_A(FP4 *r, FP4 *w, FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP4 instance, on exit = x^2-2*conj(x)
+	@param x FP4 instance
+ */
+extern void FP4_xtr_D(FP4 *r, FP4 *x);
+/**	@brief Calculates FP4 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP4 instance, on exit = trace(w^b)
+	@param x FP4 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP4_xtr_pow(FP4 *r, FP4 *x, B256_56::BIG b);
+/**	@brief Calculates FP4 trace of c^a.d^b, where c and d are derived from FP4 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP4 instance, on exit = trace(c^a.d^b)
+	@param c FP4 instance, trace of an FP12
+	@param d FP4 instance, trace of an FP12
+	@param e FP4 instance, trace of an FP12
+	@param f FP4 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP4_xtr_pow2(FP4 *r, FP4 *c, FP4 *d, FP4 *e, FP4 *f, B256_56::BIG a, B256_56::BIG b);
+
+/**	@brief Test FP4 for QR
+ * 
+	@param r FP4 instance
+    @param h optional generated hint
+	@return 1 x is a QR, otherwise 0
+ */
+extern int  FP4_qr(FP4 *r, FP *h);
+
+/**	@brief Calculate square root of an FP4
+ *
+	Square root
+	@param r FP4 instance, on exit = sqrt(x)
+	@param x FP4 instance
+    @param h optional input hint
+ */
+extern void  FP4_sqrt(FP4 *r, FP4 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP4 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP4 instance, set to y if s!=0
+	@param y another FP4 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP4_cmove(FP4 *x, FP4 *y, int s);
+
+
+/**	@brief Divide FP4 number by QNR
+ *
+	Divide FP4 by the QNR
+	@param x FP4 instance
+ */
+extern void FP4_div_i(FP4 *x);
+
+/**	@brief Generate random FP4
+ *
+	@param x random FP4 number
+	@param rng random number generator
+ */
+extern void FP4_rand(FP4 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp4_FP512BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp4_FP512BN.h
new file mode 100644
index 0000000..b3d88c0
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp4_FP512BN.h
@@ -0,0 +1,349 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP4_FP512BN_H
+#define FP4_FP512BN_H
+
+#include "fp2_FP512BN.h"
+#include "config_curve_FP512BN.h"
+
+using namespace core;
+
+namespace FP512BN {
+
+/**
+	@brief FP4 Structure - towered over two FP2
+*/
+
+typedef struct
+{
+    FP2 a; /**< real part of FP4 */
+    FP2 b; /**< imaginary part of FP4 */
+} FP4;
+
+
+/* FP4 prototypes */
+/**	@brief Tests for FP4 equal to zero
+ *
+	@param x FP4 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP4_iszilch(FP4 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP4 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP4_islarger(FP4 *x);
+
+/**	@brief Serialize out FP4  
+ *
+    @param b buffer for output
+	@param x FP4 number to be serialized
+ */
+extern void FP4_toBytes(char *b,FP4 *x);
+
+/**	@brief Serialize in FP4  
+ *
+	@param x FP4 number to be serialized
+    @param b buffer for input
+ */
+extern void FP4_fromBytes(FP4 *x,char *b);
+
+/**	@brief Tests for FP4 equal to unity
+ *
+	@param x FP4 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP4_isunity(FP4 *x);
+/**	@brief Tests for equality of two FP4s
+ *
+	@param x FP4 instance to be compared
+	@param y FP4 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP4_equals(FP4 *x, FP4 *y);
+/**	@brief Tests for FP4 having only a real part and no imaginary part
+ *
+	@param x FP4 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP4_isreal(FP4 *x);
+/**	@brief Initialise FP4 from two FP2s
+ *
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+	@param b FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2s(FP4 *x, FP2 *a, FP2 *b);
+/**	@brief Initialise FP4 from single FP2
+ *
+	Imaginary part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+ */
+extern void FP4_from_FP2(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP2
+ *
+	real part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2H(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP
+ *
+	@param x FP4 instance to be initialised
+	@param a FP to form real part of FP4
+ */
+extern void FP4_from_FP(FP4 *x, FP *a);
+
+/**	@brief Copy FP4 to another FP4
+ *
+	@param x FP4 instance, on exit = y
+	@param y FP4 instance to be copied
+ */
+extern void FP4_copy(FP4 *x, FP4 *y);
+/**	@brief Set FP4 to zero
+ *
+	@param x FP4 instance to be set to zero
+ */
+extern void FP4_zero(FP4 *x);
+/**	@brief Set FP4 to unity
+ *
+	@param x FP4 instance to be set to one
+ */
+extern void FP4_one(FP4 *x);
+
+/**	@brief Sign of FP4
+ *
+	@param x FP4 instance
+	@return "sign" of FP4
+ */
+extern int FP4_sign(FP4 *x);
+
+/**	@brief Negation of FP4
+ *
+	@param x FP4 instance, on exit = -y
+	@param y FP4 instance
+ */
+extern void FP4_neg(FP4 *x, FP4 *y);
+/**	@brief Conjugation of FP4
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP4 instance, on exit = conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_conj(FP4 *x, FP4 *y);
+/**	@brief Negative conjugation of FP4
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP4 instance, on exit = -conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_nconj(FP4 *x, FP4 *y);
+/**	@brief addition of two FP4s
+ *
+	@param x FP4 instance, on exit = y+z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_add(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief subtraction of two FP4s
+ *
+	@param x FP4 instance, on exit = y-z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_sub(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Multiplication of an FP4 by an FP2
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP2 multiplier
+ */
+extern void FP4_pmul(FP4 *x, FP4 *y, FP2 *a);
+
+
+/**	@brief Multiplication of an FP4 by an FP
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP multiplier
+ */
+extern void FP4_qmul(FP4 *x, FP4 *y, FP *a);
+
+/**	@brief Multiplication of an FP4 by a small integer
+ *
+	@param x FP4 instance, on exit = y*i
+	@param y FP4 instance
+	@param i an integer
+ */
+extern void FP4_imul(FP4 *x, FP4 *y, int i);
+/**	@brief Squaring an FP4
+ *
+	@param x FP4 instance, on exit = y^2
+	@param y FP4 instance
+ */
+extern void FP4_sqr(FP4 *x, FP4 *y);
+/**	@brief Multiplication of two FP4s
+ *
+	@param x FP4 instance, on exit = y*z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_mul(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Inverting an FP4
+ *
+	@param x FP4 instance, on exit = 1/y
+	@param y FP4 instance
+    @param h optional input hint
+ */
+extern void FP4_inv(FP4 *x, FP4 *y, FP *h);
+
+/**	@brief Divide an FP4 by 2
+ *
+	@param x FP4 instance, on exit = y/2
+	@param y FP4 instance
+ */
+extern void FP4_div2(FP4 *x, FP4 *y);
+
+
+/**	@brief Formats and outputs an FP4 to the console
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_output(FP4 *x);
+/**	@brief Formats and outputs an FP4 to the console in raw form (for debugging)
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_rawoutput(FP4 *x);
+/**	@brief multiplies an FP4 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP4 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP4_times_i(FP4 *x);
+/**	@brief Normalises the components of an FP4
+ *
+	@param x FP4 instance to be normalised
+ */
+extern void FP4_norm(FP4 *x);
+/**	@brief Reduces all components of possibly unreduced FP4 mod Modulus
+ *
+	@param x FP4 instance, on exit reduced mod Modulus
+ */
+extern void FP4_reduce(FP4 *x);
+/**	@brief Raises an FP4 to the power of a BIG
+ *
+	@param x FP4 instance, on exit = y^b
+	@param y FP4 instance
+	@param b BIG number
+ */
+extern void FP4_pow(FP4 *x, FP4 *y, B512_60::BIG b);
+/**	@brief Raises an FP4 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP4 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP4_frob(FP4 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP4 instance, on exit = w*x-conj(x)*y+z
+	@param w FP4 instance
+	@param x FP4 instance
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_xtr_A(FP4 *r, FP4 *w, FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP4 instance, on exit = x^2-2*conj(x)
+	@param x FP4 instance
+ */
+extern void FP4_xtr_D(FP4 *r, FP4 *x);
+/**	@brief Calculates FP4 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP4 instance, on exit = trace(w^b)
+	@param x FP4 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP4_xtr_pow(FP4 *r, FP4 *x, B512_60::BIG b);
+/**	@brief Calculates FP4 trace of c^a.d^b, where c and d are derived from FP4 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP4 instance, on exit = trace(c^a.d^b)
+	@param c FP4 instance, trace of an FP12
+	@param d FP4 instance, trace of an FP12
+	@param e FP4 instance, trace of an FP12
+	@param f FP4 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP4_xtr_pow2(FP4 *r, FP4 *c, FP4 *d, FP4 *e, FP4 *f, B512_60::BIG a, B512_60::BIG b);
+
+/**	@brief Test FP4 for QR
+ * 
+	@param r FP4 instance
+    @param h optional generated hint
+	@return 1 x is a QR, otherwise 0
+ */
+extern int  FP4_qr(FP4 *r, FP *h);
+
+/**	@brief Calculate square root of an FP4
+ *
+	Square root
+	@param r FP4 instance, on exit = sqrt(x)
+	@param x FP4 instance
+    @param h optional input hint
+ */
+extern void  FP4_sqrt(FP4 *r, FP4 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP4 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP4 instance, set to y if s!=0
+	@param y another FP4 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP4_cmove(FP4 *x, FP4 *y, int s);
+
+
+/**	@brief Divide FP4 number by QNR
+ *
+	Divide FP4 by the QNR
+	@param x FP4 instance
+ */
+extern void FP4_div_i(FP4 *x);
+
+/**	@brief Generate random FP4
+ *
+	@param x random FP4 number
+	@param rng random number generator
+ */
+extern void FP4_rand(FP4 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp8.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp8.cpp
new file mode 100644
index 0000000..d6a628c
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp8.cpp
@@ -0,0 +1,732 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* CORE Fp^8 functions */
+
+/* FP8 elements are of the form a+ib, where i is sqrt(sqrt(-1+sqrt(-1))) */
+
+#include "fp8_YYY.h"
+
+using namespace XXX;
+
+/* test x==0 ? */
+int YYY::FP8_iszilch(FP8 *x)
+{
+    return (FP4_iszilch(&(x->a)) & FP4_iszilch(&(x->b)));
+}
+
+/* test x==1 ? */
+int YYY::FP8_isunity(FP8 *x)
+{
+    return (FP4_isunity(&(x->a)) & FP4_iszilch(&(x->b)));
+}
+
+/* test is w real? That is in a+ib test b is zero */
+int YYY::FP8_isreal(FP8 *w)
+{
+    return FP4_iszilch(&(w->b));
+}
+
+// Is x lexically larger than p-x?
+// return -1 for no, 0 if x=0, 1 for yes
+int YYY::FP8_islarger(FP8 *x)
+{
+    int cmp;
+    if (FP8_iszilch(x)) return 0;
+    cmp=FP4_islarger(&(x->b));
+    if (cmp!=0) return cmp;
+    return FP4_islarger(&(x->a));
+}
+
+void YYY::FP8_toBytes(char *b,FP8 *x)
+{
+    FP4_toBytes(b,&(x->b));
+    FP4_toBytes(&b[4*MODBYTES_XXX],&(x->a));
+}
+
+void YYY::FP8_fromBytes(FP8 *x,char *b)
+{
+    FP4_fromBytes(&(x->b),b);
+    FP4_fromBytes(&(x->a),&b[4*MODBYTES_XXX]);
+}
+
+/* return 1 if x==y, else 0 */
+int YYY::FP8_equals(FP8 *x, FP8 *y)
+{
+    return (FP4_equals(&(x->a), &(y->a)) & FP4_equals(&(x->b), &(y->b)));
+}
+
+/* set FP8 from two FP4s */
+void YYY::FP8_from_FP4s(FP8 *w, FP4 * x, FP4* y)
+{
+    FP4_copy(&(w->a), x);
+    FP4_copy(&(w->b), y);
+}
+
+/* set FP8 from FP4 */
+void YYY::FP8_from_FP4(FP8 *w, FP4 *x)
+{
+    FP4_copy(&(w->a), x);
+    FP4_zero(&(w->b));
+}
+
+/* set high part of FP8 from FP4 */
+void YYY::FP8_from_FP4H(FP8 *w, FP4 *x)
+{
+    FP4_copy(&(w->b), x);
+    FP4_zero(&(w->a));
+}
+
+/* set FP8 from FP */
+void YYY::FP8_from_FP(FP8 *w, FP *x)
+{
+    FP2 t;
+    FP4 t4;
+    FP2_from_FP(&t, x);
+    FP4_from_FP2(&t4, &t);
+    FP8_from_FP4(w, &t4);
+}
+
+/* FP8 copy w=x */
+void YYY::FP8_copy(FP8 *w, FP8 *x)
+{
+    if (w == x) return;
+    FP4_copy(&(w->a), &(x->a));
+    FP4_copy(&(w->b), &(x->b));
+}
+
+/* FP8 w=0 */
+void YYY::FP8_zero(FP8 *w)
+{
+    FP4_zero(&(w->a));
+    FP4_zero(&(w->b));
+}
+
+/* FP8 w=1 */
+void YYY::FP8_one(FP8 *w)
+{
+    FP4_one(&(w->a));
+    FP4_zero(&(w->b));
+}
+
+int YYY::FP8_sign(FP8 *w)
+{
+    int p1,p2;
+    p1=FP4_sign(&(w->a));
+    p2=FP4_sign(&(w->b));
+#ifdef BIG_ENDIAN_SIGN_YYY
+    p2 ^= (p1 ^ p2)&FP4_iszilch(&(w->b));
+    return p2;
+#else
+    p1 ^= (p1 ^ p2)&FP4_iszilch(&(w->a));
+    return p1;
+#endif
+
+}
+
+/* Set w=-x */
+void YYY::FP8_neg(FP8 *w, FP8 *x)
+{
+    /* Just one field neg */
+    FP4 m, t;
+    FP8_norm(x);
+    FP4_add(&m, &(x->a), &(x->b));
+    FP4_norm(&m);
+    FP4_neg(&m, &m);
+    FP4_add(&t, &m, &(x->b));
+    FP4_add(&(w->b), &m, &(x->a));
+    FP4_copy(&(w->a), &t);
+    FP8_norm(w);
+}
+
+/* Set w=conj(x) */
+void YYY::FP8_conj(FP8 *w, FP8 *x)
+{
+    FP4_copy(&(w->a), &(x->a));
+    FP4_neg(&(w->b), &(x->b));
+    FP8_norm(w);
+}
+
+/* Set w=-conj(x) */
+void YYY::FP8_nconj(FP8 *w, FP8 *x)
+{
+    FP4_copy(&(w->b), &(x->b));
+    FP4_neg(&(w->a), &(x->a));
+    FP8_norm(w);
+}
+
+/* Set w=x+y */
+void YYY::FP8_add(FP8 *w, FP8 *x, FP8 *y)
+{
+    FP4_add(&(w->a), &(x->a), &(y->a));
+    FP4_add(&(w->b), &(x->b), &(y->b));
+}
+
+/* Set w=x-y */
+/* Input y MUST be normed */
+void YYY::FP8_sub(FP8 *w, FP8 *x, FP8 *y)
+{
+    FP8 my;
+
+    FP8_neg(&my, y);
+    FP8_add(w, x, &my);
+
+}
+
+/* reduce all components of w mod Modulus */
+void YYY::FP8_reduce(FP8 *w)
+{
+    FP4_reduce(&(w->a));
+    FP4_reduce(&(w->b));
+}
+
+/* normalise all elements of w */
+void YYY::FP8_norm(FP8 *w)
+{
+    FP4_norm(&(w->a));
+    FP4_norm(&(w->b));
+}
+
+/* Set w=s*x, where s is FP4 */
+void YYY::FP8_pmul(FP8 *w, FP8 *x, FP4 *s)
+{
+    FP4_mul(&(w->a), &(x->a), s);
+    FP4_mul(&(w->b), &(x->b), s);
+}
+
+/* Set w=s*x, where s is FP2 */
+void YYY::FP8_qmul(FP8 *w, FP8 *x, FP2 *s)
+{
+    FP4_pmul(&(w->a), &(x->a), s);
+    FP4_pmul(&(w->b), &(x->b), s);
+}
+
+/* Set w=s*x, where s is FP */
+void YYY::FP8_tmul(FP8 *w, FP8 *x, FP *s)
+{
+    FP4_qmul(&(w->a), &(x->a), s);
+    FP4_qmul(&(w->b), &(x->b), s);
+}
+
+/* Set w=s*x, where s is int */
+void YYY::FP8_imul(FP8 *w, FP8 *x, int s)
+{
+    FP4_imul(&(w->a), &(x->a), s);
+    FP4_imul(&(w->b), &(x->b), s);
+}
+
+/* Set w=x^2 */
+/* Input MUST be normed  */
+void YYY::FP8_sqr(FP8 *w, FP8 *x)
+{
+    FP4 t1, t2, t3;
+
+    FP4_mul(&t3, &(x->a), &(x->b)); /* norms x */
+    FP4_copy(&t2, &(x->b));
+    FP4_add(&t1, &(x->a), &(x->b));
+    FP4_times_i(&t2);
+
+    FP4_add(&t2, &(x->a), &t2);
+
+    FP4_norm(&t1);  // 2
+    FP4_norm(&t2);  // 2
+
+    FP4_mul(&(w->a), &t1, &t2);
+
+    FP4_copy(&t2, &t3);
+    FP4_times_i(&t2);
+
+    FP4_add(&t2, &t2, &t3);
+
+    FP4_norm(&t2);  // 2
+    FP4_neg(&t2, &t2);
+    FP4_add(&(w->a), &(w->a), &t2); /* a=(a+b)(a+i^2.b)-i^2.ab-ab = a*a+ib*ib */
+    FP4_add(&(w->b), &t3, &t3); /* b=2ab */
+
+    FP8_norm(w);
+}
+
+/* Set w=x*y */
+/* Inputs MUST be normed  */
+void YYY::FP8_mul(FP8 *w, FP8 *x, FP8 *y)
+{
+
+    FP4 t1, t2, t3, t4;
+
+    FP4_mul(&t1, &(x->a), &(y->a));
+    FP4_mul(&t2, &(x->b), &(y->b));
+    FP4_add(&t3, &(y->b), &(y->a));
+    FP4_add(&t4, &(x->b), &(x->a));
+
+    FP4_norm(&t4); // 2
+    FP4_norm(&t3); // 2
+
+    FP4_mul(&t4, &t4, &t3); /* (xa+xb)(ya+yb) */
+    FP4_neg(&t3, &t1); // 1
+    FP4_add(&t4, &t4, &t3); //t4E=3
+    FP4_norm(&t4);
+
+    FP4_neg(&t3, &t2); // 1
+    FP4_add(&(w->b), &t4, &t3); //wbE=3
+
+    FP4_times_i(&t2);
+    FP4_add(&(w->a), &t2, &t1);
+
+    FP8_norm(w);
+}
+
+/* output FP8 in format [a,b] */
+void YYY::FP8_output(FP8 *w)
+{
+    printf("[");
+    FP4_output(&(w->a));
+    printf(",");
+    FP4_output(&(w->b));
+    printf("]");
+}
+
+void YYY::FP8_rawoutput(FP8 *w)
+{
+    printf("[");
+    FP4_rawoutput(&(w->a));
+    printf(",");
+    FP4_rawoutput(&(w->b));
+    printf("]");
+}
+
+/* Set w=1/x */
+void YYY::FP8_inv(FP8 *w, FP8 *x, FP *h)
+{
+    FP4 t1, t2;
+    FP4_sqr(&t1, &(x->a));
+    FP4_sqr(&t2, &(x->b));
+    FP4_times_i(&t2);
+    FP4_norm(&t2);
+
+    FP4_sub(&t1, &t1, &t2);
+    FP4_norm(&t1);
+    FP4_inv(&t1, &t1, h);
+
+    FP4_mul(&(w->a), &t1, &(x->a));
+    FP4_neg(&t1, &t1);
+    FP4_norm(&t1);
+    FP4_mul(&(w->b), &t1, &(x->b));
+}
+
+/* w*=i where i = sqrt(sqrt(-1+sqrt(-1))) */
+void YYY::FP8_times_i(FP8 *w)
+{
+    FP4 s, t;
+    FP4_copy(&s, &(w->b));
+    FP4_copy(&t, &(w->a));
+    FP4_times_i(&s);
+    FP4_copy(&(w->a), &s);
+    FP4_copy(&(w->b), &t);
+    FP8_norm(w);
+#if TOWER_YYY == POSITOWER
+    FP8_neg(w, w);  // ***
+    FP8_norm(w);
+#endif
+}
+
+void YYY::FP8_times_i2(FP8 *w)
+{
+    FP4_times_i(&(w->a));
+    FP4_times_i(&(w->b));
+}
+
+/* Set w=w^p using Frobenius */
+void YYY::FP8_frob(FP8 *w, FP2 *f)
+{   // f=(i+1)^(p-3)/4
+    FP2 ff;
+    FP2_sqr(&ff, f); // (i+1)^(p-3)/2
+    FP2_mul_ip(&ff); // (i+1)^(p-1)/2
+    FP2_norm(&ff);
+    FP4_frob(&(w->a), &ff);
+    FP4_frob(&(w->b), &ff);
+    FP4_pmul(&(w->b), &(w->b), f); // times (1+i)^(p-3)/4
+    FP4_times_i(&(w->b));       // (i+1)^(p-1)/4
+}
+
+/* Set r=a^b mod m */
+/*
+void YYY::FP8_pow(FP8 *r, FP8* a, BIG b)
+{
+    FP8 w;
+    BIG z, zilch;
+    int bt;
+
+    BIG_zero(zilch);
+
+    BIG_copy(z, b);
+    FP8_copy(&w, a);
+    FP8_one(r);
+    BIG_norm(z);
+
+    while (1)
+    {
+        bt = BIG_parity(z);
+        BIG_shr(z, 1);
+        if (bt) FP8_mul(r, r, &w);
+        if (BIG_comp(z, zilch) == 0) break;
+        FP8_sqr(&w, &w);
+    }
+    FP8_reduce(r);
+}*/
+/*
+#if CURVE_SECURITY_ZZZ == 192
+*/
+/* XTR xtr_a function */
+/*
+void YYY::FP8_xtr_A(FP8 *r, FP8 *w, FP8 *x, FP8 *y, FP8 *z)
+{
+    FP8 t1, t2;
+
+    FP8_copy(r, x);
+    FP8_sub(&t1, w, y);
+    FP8_norm(&t1);
+    FP8_pmul(&t1, &t1, &(r->a));
+    FP8_add(&t2, w, y);
+    FP8_norm(&t2);
+    FP8_pmul(&t2, &t2, &(r->b));
+    FP8_times_i(&t2);
+
+    FP8_add(r, &t1, &t2);
+    FP8_add(r, r, z);
+
+    FP8_reduce(r);
+}
+*/
+/* XTR xtr_d function */
+/*
+void YYY::FP8_xtr_D(FP8 *r, FP8 *x)
+{
+    FP8 w;
+    FP8_copy(r, x);
+    FP8_conj(&w, r);
+    FP8_add(&w, &w, &w);
+    FP8_sqr(r, r);
+    FP8_norm(&w);
+    FP8_sub(r, r, &w);
+    FP8_reduce(r);    // reduce here as multiple calls trigger automatic reductions
+}
+*/
+/* r=x^n using XTR method on traces of FP24s */
+/*
+void YYY::FP8_xtr_pow(FP8 *r, FP8 *x, BIG n)
+{
+    int i, par, nb;
+    BIG v;
+    FP2 w2;
+    FP4 w4;
+    FP8 t, a, b, c, sf;
+
+    BIG_zero(v);
+    BIG_inc(v, 3);
+    BIG_norm(v);
+    FP2_from_BIG(&w2, v);
+    FP4_from_FP2(&w4, &w2);
+    FP8_from_FP4(&a, &w4);
+
+    FP8_copy(&sf, x);
+    FP8_norm(&sf);
+    FP8_copy(&b, &sf);
+    FP8_xtr_D(&c, &sf);
+
+    par = BIG_parity(n);
+    BIG_copy(v, n);
+    BIG_norm(v);
+    BIG_shr(v, 1);
+    if (par == 0)
+    {
+        BIG_dec(v, 1);
+        BIG_norm(v);
+    }
+
+    nb = BIG_nbits(v);
+    for (i = nb - 1; i >= 0; i--)
+    {
+        if (!BIG_bit(v, i))
+        {
+            FP8_copy(&t, &b);
+            FP8_conj(&sf, &sf);
+            FP8_conj(&c, &c);
+            FP8_xtr_A(&b, &a, &b, &sf, &c);
+            FP8_conj(&sf, &sf);
+            FP8_xtr_D(&c, &t);
+            FP8_xtr_D(&a, &a);
+        }
+        else
+        {
+            FP8_conj(&t, &a);
+            FP8_xtr_D(&a, &b);
+            FP8_xtr_A(&b, &c, &b, &sf, &t);
+            FP8_xtr_D(&c, &c);
+        }
+    }
+
+    if (par == 0) FP8_copy(r, &c);
+    else FP8_copy(r, &b);
+    FP8_reduce(r);
+}
+*/
+/* r=ck^a.cl^n using XTR double exponentiation method on traces of FP24s. See Stam thesis. */
+/*
+void YYY::FP8_xtr_pow2(FP8 *r, FP8 *ck, FP8 *cl, FP8 *ckml, FP8 *ckm2l, BIG a, BIG b)
+{
+    int i, f2;
+    BIG d, e, w;
+    FP8 t, cu, cv, cumv, cum2v;
+
+
+    BIG_copy(e, a);
+    BIG_copy(d, b);
+    BIG_norm(e);
+    BIG_norm(d);
+
+    FP8_copy(&cu, ck);
+    FP8_copy(&cv, cl);
+    FP8_copy(&cumv, ckml);
+    FP8_copy(&cum2v, ckm2l);
+
+    f2 = 0;
+    while (BIG_parity(d) == 0 && BIG_parity(e) == 0)
+    {
+        BIG_shr(d, 1);
+        BIG_shr(e, 1);
+        f2++;
+    }
+    while (BIG_comp(d, e) != 0)
+    {
+        if (BIG_comp(d, e) > 0)
+        {
+            BIG_imul(w, e, 4);
+            BIG_norm(w);
+            if (BIG_comp(d, w) <= 0)
+            {
+                BIG_copy(w, d);
+                BIG_copy(d, e);
+                BIG_sub(e, w, e);
+                BIG_norm(e);
+                FP8_xtr_A(&t, &cu, &cv, &cumv, &cum2v);
+                FP8_conj(&cum2v, &cumv);
+                FP8_copy(&cumv, &cv);
+                FP8_copy(&cv, &cu);
+                FP8_copy(&cu, &t);
+            }
+            else if (BIG_parity(d) == 0)
+            {
+                BIG_shr(d, 1);
+                FP8_conj(r, &cum2v);
+                FP8_xtr_A(&t, &cu, &cumv, &cv, r);
+                FP8_xtr_D(&cum2v, &cumv);
+                FP8_copy(&cumv, &t);
+                FP8_xtr_D(&cu, &cu);
+            }
+            else if (BIG_parity(e) == 1)
+            {
+                BIG_sub(d, d, e);
+                BIG_norm(d);
+                BIG_shr(d, 1);
+                FP8_xtr_A(&t, &cu, &cv, &cumv, &cum2v);
+                FP8_xtr_D(&cu, &cu);
+                FP8_xtr_D(&cum2v, &cv);
+                FP8_conj(&cum2v, &cum2v);
+                FP8_copy(&cv, &t);
+            }
+            else
+            {
+                BIG_copy(w, d);
+                BIG_copy(d, e);
+                BIG_shr(d, 1);
+                BIG_copy(e, w);
+                FP8_xtr_D(&t, &cumv);
+                FP8_conj(&cumv, &cum2v);
+                FP8_conj(&cum2v, &t);
+                FP8_xtr_D(&t, &cv);
+                FP8_copy(&cv, &cu);
+                FP8_copy(&cu, &t);
+            }
+        }
+        if (BIG_comp(d, e) < 0)
+        {
+            BIG_imul(w, d, 4);
+            BIG_norm(w);
+            if (BIG_comp(e, w) <= 0)
+            {
+                BIG_sub(e, e, d);
+                BIG_norm(e);
+                FP8_xtr_A(&t, &cu, &cv, &cumv, &cum2v);
+                FP8_copy(&cum2v, &cumv);
+                FP8_copy(&cumv, &cu);
+                FP8_copy(&cu, &t);
+            }
+            else if (BIG_parity(e) == 0)
+            {
+                BIG_copy(w, d);
+                BIG_copy(d, e);
+                BIG_shr(d, 1);
+                BIG_copy(e, w);
+                FP8_xtr_D(&t, &cumv);
+                FP8_conj(&cumv, &cum2v);
+                FP8_conj(&cum2v, &t);
+                FP8_xtr_D(&t, &cv);
+                FP8_copy(&cv, &cu);
+                FP8_copy(&cu, &t);
+            }
+            else if (BIG_parity(d) == 1)
+            {
+                BIG_copy(w, e);
+                BIG_copy(e, d);
+                BIG_sub(w, w, d);
+                BIG_norm(w);
+                BIG_copy(d, w);
+                BIG_shr(d, 1);
+                FP8_xtr_A(&t, &cu, &cv, &cumv, &cum2v);
+                FP8_conj(&cumv, &cumv);
+                FP8_xtr_D(&cum2v, &cu);
+                FP8_conj(&cum2v, &cum2v);
+                FP8_xtr_D(&cu, &cv);
+                FP8_copy(&cv, &t);
+            }
+            else
+            {
+                BIG_shr(d, 1);
+                FP8_conj(r, &cum2v);
+                FP8_xtr_A(&t, &cu, &cumv, &cv, r);
+                FP8_xtr_D(&cum2v, &cumv);
+                FP8_copy(&cumv, &t);
+                FP8_xtr_D(&cu, &cu);
+            }
+        }
+    }
+    FP8_xtr_A(r, &cu, &cv, &cumv, &cum2v);
+    for (i = 0; i < f2; i++)    FP8_xtr_D(r, r);
+    FP8_xtr_pow(r, r, d);
+}
+
+#endif
+*/
+
+/* New stuff for ECp8 support */
+
+/* Set w=x/2 */
+void YYY::FP8_div2(FP8 *w, FP8 *x)
+{
+    FP4_div2(&(w->a), &(x->a));
+    FP4_div2(&(w->b), &(x->b));
+}
+
+/* Move b to a if d=1 */
+void YYY::FP8_cmove(FP8 *f, FP8 *g, int d)
+{
+    FP4_cmove(&(f->a), &(g->a), d);
+    FP4_cmove(&(f->b), &(g->b), d);
+}
+
+void YYY::FP8_rand(FP8 *x,csprng *rng)
+{
+    FP4_rand(&(x->a),rng);
+    FP4_rand(&(x->b),rng);
+}
+
+#if PAIRING_FRIENDLY_ZZZ == BLS48_CURVE
+
+/* test for x a QR */
+int YYY::FP8_qr(FP8 *x,FP *h)
+{ /* test x^(p^4-1)/2 = 1 */
+    FP8 c;
+    FP8_conj(&c,x);
+    FP8_mul(&c,&c,x);
+
+    return FP4_qr(&(c.a),h);
+}
+
+/* sqrt(a+xb) = sqrt((a+sqrt(a*a-n*b*b))/2)+x.b/(2*sqrt((a+sqrt(a*a-n*b*b))/2)) */
+
+void YYY::FP8_sqrt(FP8 *r, FP8* x, FP *h)
+{
+    FP4 a, b, s, t;
+    FP8 nr;
+    FP hint,twk;
+    int sgn,qr;
+    FP8_copy(r, x);
+    if (FP8_iszilch(x)) return;
+
+    FP4_copy(&a, &(x->a));
+    FP4_copy(&s, &(x->b));
+
+    FP4_sqr(&s, &s); // s*=s
+    FP4_sqr(&a, &a); // a*=a
+    FP4_times_i(&s);
+    FP4_norm(&s);
+    FP4_sub(&a, &a, &s); // a-=txx(s)
+    FP4_norm(&a);  // **
+    FP4_sqrt(&s, &a, h);
+
+    FP4_copy(&t, &(x->a));
+    FP4_add(&a, &t, &s);
+    FP4_norm(&a);
+    FP4_div2(&a, &a);
+
+    FP4_div2(&b,&(r->b));                   // w1=b/2
+    qr=FP4_qr(&a,&hint);                    // only exp! Cost=+1
+
+// tweak hint - multiply old hint by Norm(1/Beta)^e where Beta is irreducible polynomial
+    FP4_copy(&s,&a);
+    FP_rcopy(&twk,TWK);
+    FP_mul(&twk,&twk,&hint);
+    FP4_div_i(&s); FP4_norm(&s); // switch to other candidate
+
+    FP4_cmove(&a,&s,1-qr);
+    FP_cmove(&hint,&twk,1-qr);
+
+    FP4_sqrt(&(r->a),&a,&hint);             // a=sqrt(w2)  Cost=+1
+    FP4_inv(&s,&a,&hint);                  // w3=1/w2
+    FP4_mul(&s,&s,&(r->a));                // w3=1/sqrt(w2)
+    FP4_mul(&(r->b),&s,&b);                // b=(b/2)*1/sqrt(w2)
+    FP4_copy(&t,&(r->a));
+
+    FP4_cmove(&(r->a),&(r->b),1-qr);
+    FP4_cmove(&(r->b),&t,1-qr);
+
+    sgn=FP8_sign(r);
+    FP8_neg(&nr,r); FP8_norm(&nr);
+    FP8_cmove(r,&nr,sgn);
+}
+
+void YYY::FP8_div_i(FP8 *f)
+{
+    FP4 u, v;
+    FP4_copy(&u, &(f->a));
+    FP4_copy(&v, &(f->b));
+
+    FP4_div_i(&u);
+
+    FP4_copy(&(f->a), &v);
+    FP4_copy(&(f->b), &u);
+#if TOWER_YYY == POSITOWER
+    FP8_neg(f, f);  // ***
+    FP8_norm(f);
+#endif
+}
+
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp8.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp8.h
new file mode 100644
index 0000000..e9ed770
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp8.h
@@ -0,0 +1,365 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP8_YYY_H
+#define FP8_YYY_H
+
+#include "fp4_YYY.h"
+#include "config_curve_ZZZ.h"
+
+using namespace core;
+
+namespace YYY {
+
+/**
+	@brief FP8 Structure - towered over two FP4
+*/
+
+typedef struct
+{
+    FP4 a; /**< real part of FP8 */
+    FP4 b; /**< imaginary part of FP8 */
+} FP8;
+
+
+/* FP8 prototypes */
+/**	@brief Tests for FP8 equal to zero
+ *
+	@param x FP8 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP8_iszilch(FP8 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP8 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP8_islarger(FP8 *x);
+
+/**	@brief Serialize in FP8  
+ *
+    @param b buffer for output
+	@param x FP8 number to be serialized
+ */
+extern void FP8_toBytes(char *b,FP8 *x);
+/**	@brief Serialize out FP8  
+ *
+	@param x FP8 number to be serialized
+    @param b buffer for input
+ */
+extern void FP8_fromBytes(FP8 *x,char *b);
+
+
+/**	@brief Tests for FP8 equal to unity
+ *
+	@param x FP8 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP8_isunity(FP8 *x);
+/**	@brief Tests for equality of two FP8s
+ *
+	@param x FP8 instance to be compared
+	@param y FP8 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP8_equals(FP8 *x, FP8 *y);
+/**	@brief Tests for FP8 having only a real part and no imaginary part
+ *
+	@param x FP8 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP8_isreal(FP8 *x);
+/**	@brief Initialise FP8 from two FP4s
+ *
+	@param x FP8 instance to be initialised
+	@param a FP4 to form real part of FP8
+	@param b FP4 to form imaginary part of FP8
+ */
+extern void FP8_from_FP4s(FP8 *x, FP4 *a, FP4 *b);
+/**	@brief Initialise FP8 from single FP4
+ *
+	Imaginary part is set to zero
+	@param x FP8 instance to be initialised
+	@param a FP4 to form real part of FP8
+ */
+extern void FP8_from_FP4(FP8 *x, FP4 *a);
+
+/**	@brief Initialise FP8 from single FP4
+ *
+	real part is set to zero
+	@param x FP8 instance to be initialised
+	@param a FP4 to form imaginary part of FP8
+ */
+extern void FP8_from_FP4H(FP8 *x, FP4 *a);
+
+/**	@brief Initialise FP8 from single FP
+ *
+	@param x FP8 instance to be initialised
+	@param a FP to form real part of FP8
+ */
+extern void FP8_from_FP(FP8 *x, FP *a);
+
+/**	@brief Copy FP8 to another FP8
+ *
+	@param x FP8 instance, on exit = y
+	@param y FP8 instance to be copied
+ */
+extern void FP8_copy(FP8 *x, FP8 *y);
+
+/**	@brief Set FP8 to zero
+ *
+	@param x FP8 instance to be set to zero
+ */
+extern void FP8_zero(FP8 *x);
+/**	@brief Set FP8 to unity
+ *
+	@param x FP8 instance to be set to one
+ */
+extern void FP8_one(FP8 *x);
+
+/**	@brief Sign of FP8
+ *
+	@param x FP8 instance
+	@return "sign" of FP8
+ */
+extern int FP8_sign(FP8 *x);
+
+/**	@brief Negation of FP8
+ *
+	@param x FP8 instance, on exit = -y
+	@param y FP8 instance
+ */
+extern void FP8_neg(FP8 *x, FP8 *y);
+/**	@brief Conjugation of FP8
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP8 instance, on exit = conj(y)
+	@param y FP8 instance
+ */
+extern void FP8_conj(FP8 *x, FP8 *y);
+/**	@brief Negative conjugation of FP8
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP8 instance, on exit = -conj(y)
+	@param y FP8 instance
+ */
+extern void FP8_nconj(FP8 *x, FP8 *y);
+/**	@brief addition of two FP8s
+ *
+	@param x FP8 instance, on exit = y+z
+	@param y FP8 instance
+	@param z FP8 instance
+ */
+extern void FP8_add(FP8 *x, FP8 *y, FP8 *z);
+/**	@brief subtraction of two FP8s
+ *
+	@param x FP8 instance, on exit = y-z
+	@param y FP8 instance
+	@param z FP8 instance
+ */
+extern void FP8_sub(FP8 *x, FP8 *y, FP8 *z);
+/**	@brief Multiplication of an FP8 by an FP4
+ *
+	@param x FP8 instance, on exit = y*a
+	@param y FP8 instance
+	@param a FP4 multiplier
+ */
+extern void FP8_pmul(FP8 *x, FP8 *y, FP4 *a);
+
+/**	@brief Multiplication of an FP8 by an FP2
+ *
+	@param x FP8 instance, on exit = y*a
+	@param y FP8 instance
+	@param a FP2 multiplier
+ */
+extern void FP8_qmul(FP8 *x, FP8 *y, FP2 *a);
+
+/**	@brief Multiplication of an FP8 by an FP
+ *
+	@param x FP8 instance, on exit = y*a
+	@param y FP8 instance
+	@param a FP multiplier
+ */
+extern void FP8_tmul(FP8 *x, FP8 *y, FP *a);
+
+
+
+/**	@brief Multiplication of an FP8 by a small integer
+ *
+	@param x FP8 instance, on exit = y*i
+	@param y FP8 instance
+	@param i an integer
+ */
+extern void FP8_imul(FP8 *x, FP8 *y, int i);
+/**	@brief Squaring an FP8
+ *
+	@param x FP8 instance, on exit = y^2
+	@param y FP8 instance
+ */
+extern void FP8_sqr(FP8 *x, FP8 *y);
+/**	@brief Multiplication of two FP8s
+ *
+	@param x FP8 instance, on exit = y*z
+	@param y FP8 instance
+	@param z FP8 instance
+ */
+extern void FP8_mul(FP8 *x, FP8 *y, FP8 *z);
+/**	@brief Inverting an FP8
+ *
+	@param x FP8 instance, on exit = 1/y
+	@param y FP8 instance
+    @param h optional input hint
+ */
+extern void FP8_inv(FP8 *x, FP8 *y, FP *h);
+/**	@brief Formats and outputs an FP8 to the console
+ *
+	@param x FP8 instance to be printed
+ */
+extern void FP8_output(FP8 *x);
+/**	@brief Divide an FP8 by 2
+ *
+	@param x FP8 instance, on exit = y/2
+	@param y FP8 instance
+ */
+extern void FP8_div2(FP8 *x, FP8 *y);
+
+/**	@brief Formats and outputs an FP8 to the console in raw form (for debugging)
+ *
+	@param x FP8 instance to be printed
+ */
+extern void FP8_rawoutput(FP8 *x);
+/**	@brief multiplies an FP8 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP8 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP8_times_i(FP8 *x);
+/**	@brief multiplies an FP8 instance by irreducible polynomial (1+sqrt(-1))
+ *
+	@param x FP8 instance, on exit = (1+sqrt(-1)*x
+ */
+extern void FP8_times_i2(FP8 *x);
+
+/**	@brief Normalises the components of an FP8
+ *
+	@param x FP8 instance to be normalised
+ */
+extern void FP8_norm(FP8 *x);
+/**	@brief Reduces all components of possibly unreduced FP8 mod Modulus
+ *
+	@param x FP8 instance, on exit reduced mod Modulus
+ */
+extern void FP8_reduce(FP8 *x);
+/**	@brief Raises an FP8 to the power of a BIG
+ *
+	@param x FP8 instance, on exit = y^b
+	@param y FP8 instance
+	@param b BIG number
+ */
+extern void FP8_pow(FP8 *x, FP8 *y, XXX::BIG b);
+/**	@brief Raises an FP8 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP8 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP8_frob(FP8 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP8 instance, on exit = w*x-conj(x)*y+z
+	@param w FP8 instance
+	@param x FP8 instance
+	@param y FP8 instance
+	@param z FP8 instance
+ */
+extern void FP8_xtr_A(FP8 *r, FP8 *w, FP8 *x, FP8 *y, FP8 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP8 instance, on exit = x^2-2*conj(x)
+	@param x FP8 instance
+ */
+extern void FP8_xtr_D(FP8 *r, FP8 *x);
+/**	@brief Calculates FP8 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP8 instance, on exit = trace(w^b)
+	@param x FP8 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP8_xtr_pow(FP8 *r, FP8 *x, XXX::BIG b);
+/**	@brief Calculates FP8 trace of c^a.d^b, where c and d are derived from FP8 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP8 instance, on exit = trace(c^a.d^b)
+	@param c FP8 instance, trace of an FP12
+	@param d FP8 instance, trace of an FP12
+	@param e FP8 instance, trace of an FP12
+	@param f FP8 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP8_xtr_pow2(FP8 *r, FP8 *c, FP8 *d, FP8 *e, FP8 *f, XXX::BIG a, XXX::BIG b);
+
+/**	@brief Test FP8 for QR
+ *
+	Square root
+	@param r FP8 instance
+    @param h optional generated hint
+	@return 1 r is a QR, otherwise 0
+ */
+extern int  FP8_qr(FP8 *r, FP *h);
+
+
+/**	@brief Calculate square root of an FP8
+ *
+	Square root
+	@param r FP8 instance, on exit = sqrt(x)
+	@param x FP8 instance
+    @param h optional input hint
+ */
+extern void  FP8_sqrt(FP8 *r, FP8 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP8 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP8 instance, set to y if s!=0
+	@param y another FP8 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP8_cmove(FP8 *x, FP8 *y, int s);
+
+
+/**	@brief Divide FP8 number by QNR
+ *
+	Divide FP8 by the QNR
+	@param x FP8 instance
+ */
+extern void FP8_div_i(FP8 *x);
+
+/**	@brief Generate random FP8
+ *
+	@param x random FP8 number
+	@param rng random number generator
+ */
+extern void FP8_rand(FP8 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp8_BLS24479.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp8_BLS24479.h
new file mode 100644
index 0000000..03ebc33
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp8_BLS24479.h
@@ -0,0 +1,365 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP8_BLS24479_H
+#define FP8_BLS24479_H
+
+#include "fp4_BLS24479.h"
+#include "config_curve_BLS24479.h"
+
+using namespace core;
+
+namespace BLS24479 {
+
+/**
+	@brief FP8 Structure - towered over two FP4
+*/
+
+typedef struct
+{
+    FP4 a; /**< real part of FP8 */
+    FP4 b; /**< imaginary part of FP8 */
+} FP8;
+
+
+/* FP8 prototypes */
+/**	@brief Tests for FP8 equal to zero
+ *
+	@param x FP8 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP8_iszilch(FP8 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP8 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP8_islarger(FP8 *x);
+
+/**	@brief Serialize in FP8  
+ *
+    @param b buffer for output
+	@param x FP8 number to be serialized
+ */
+extern void FP8_toBytes(char *b,FP8 *x);
+/**	@brief Serialize out FP8  
+ *
+	@param x FP8 number to be serialized
+    @param b buffer for input
+ */
+extern void FP8_fromBytes(FP8 *x,char *b);
+
+
+/**	@brief Tests for FP8 equal to unity
+ *
+	@param x FP8 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP8_isunity(FP8 *x);
+/**	@brief Tests for equality of two FP8s
+ *
+	@param x FP8 instance to be compared
+	@param y FP8 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP8_equals(FP8 *x, FP8 *y);
+/**	@brief Tests for FP8 having only a real part and no imaginary part
+ *
+	@param x FP8 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP8_isreal(FP8 *x);
+/**	@brief Initialise FP8 from two FP4s
+ *
+	@param x FP8 instance to be initialised
+	@param a FP4 to form real part of FP8
+	@param b FP4 to form imaginary part of FP8
+ */
+extern void FP8_from_FP4s(FP8 *x, FP4 *a, FP4 *b);
+/**	@brief Initialise FP8 from single FP4
+ *
+	Imaginary part is set to zero
+	@param x FP8 instance to be initialised
+	@param a FP4 to form real part of FP8
+ */
+extern void FP8_from_FP4(FP8 *x, FP4 *a);
+
+/**	@brief Initialise FP8 from single FP4
+ *
+	real part is set to zero
+	@param x FP8 instance to be initialised
+	@param a FP4 to form imaginary part of FP8
+ */
+extern void FP8_from_FP4H(FP8 *x, FP4 *a);
+
+/**	@brief Initialise FP8 from single FP
+ *
+	@param x FP8 instance to be initialised
+	@param a FP to form real part of FP8
+ */
+extern void FP8_from_FP(FP8 *x, FP *a);
+
+/**	@brief Copy FP8 to another FP8
+ *
+	@param x FP8 instance, on exit = y
+	@param y FP8 instance to be copied
+ */
+extern void FP8_copy(FP8 *x, FP8 *y);
+
+/**	@brief Set FP8 to zero
+ *
+	@param x FP8 instance to be set to zero
+ */
+extern void FP8_zero(FP8 *x);
+/**	@brief Set FP8 to unity
+ *
+	@param x FP8 instance to be set to one
+ */
+extern void FP8_one(FP8 *x);
+
+/**	@brief Sign of FP8
+ *
+	@param x FP8 instance
+	@return "sign" of FP8
+ */
+extern int FP8_sign(FP8 *x);
+
+/**	@brief Negation of FP8
+ *
+	@param x FP8 instance, on exit = -y
+	@param y FP8 instance
+ */
+extern void FP8_neg(FP8 *x, FP8 *y);
+/**	@brief Conjugation of FP8
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP8 instance, on exit = conj(y)
+	@param y FP8 instance
+ */
+extern void FP8_conj(FP8 *x, FP8 *y);
+/**	@brief Negative conjugation of FP8
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP8 instance, on exit = -conj(y)
+	@param y FP8 instance
+ */
+extern void FP8_nconj(FP8 *x, FP8 *y);
+/**	@brief addition of two FP8s
+ *
+	@param x FP8 instance, on exit = y+z
+	@param y FP8 instance
+	@param z FP8 instance
+ */
+extern void FP8_add(FP8 *x, FP8 *y, FP8 *z);
+/**	@brief subtraction of two FP8s
+ *
+	@param x FP8 instance, on exit = y-z
+	@param y FP8 instance
+	@param z FP8 instance
+ */
+extern void FP8_sub(FP8 *x, FP8 *y, FP8 *z);
+/**	@brief Multiplication of an FP8 by an FP4
+ *
+	@param x FP8 instance, on exit = y*a
+	@param y FP8 instance
+	@param a FP4 multiplier
+ */
+extern void FP8_pmul(FP8 *x, FP8 *y, FP4 *a);
+
+/**	@brief Multiplication of an FP8 by an FP2
+ *
+	@param x FP8 instance, on exit = y*a
+	@param y FP8 instance
+	@param a FP2 multiplier
+ */
+extern void FP8_qmul(FP8 *x, FP8 *y, FP2 *a);
+
+/**	@brief Multiplication of an FP8 by an FP
+ *
+	@param x FP8 instance, on exit = y*a
+	@param y FP8 instance
+	@param a FP multiplier
+ */
+extern void FP8_tmul(FP8 *x, FP8 *y, FP *a);
+
+
+
+/**	@brief Multiplication of an FP8 by a small integer
+ *
+	@param x FP8 instance, on exit = y*i
+	@param y FP8 instance
+	@param i an integer
+ */
+extern void FP8_imul(FP8 *x, FP8 *y, int i);
+/**	@brief Squaring an FP8
+ *
+	@param x FP8 instance, on exit = y^2
+	@param y FP8 instance
+ */
+extern void FP8_sqr(FP8 *x, FP8 *y);
+/**	@brief Multiplication of two FP8s
+ *
+	@param x FP8 instance, on exit = y*z
+	@param y FP8 instance
+	@param z FP8 instance
+ */
+extern void FP8_mul(FP8 *x, FP8 *y, FP8 *z);
+/**	@brief Inverting an FP8
+ *
+	@param x FP8 instance, on exit = 1/y
+	@param y FP8 instance
+    @param h optional input hint
+ */
+extern void FP8_inv(FP8 *x, FP8 *y, FP *h);
+/**	@brief Formats and outputs an FP8 to the console
+ *
+	@param x FP8 instance to be printed
+ */
+extern void FP8_output(FP8 *x);
+/**	@brief Divide an FP8 by 2
+ *
+	@param x FP8 instance, on exit = y/2
+	@param y FP8 instance
+ */
+extern void FP8_div2(FP8 *x, FP8 *y);
+
+/**	@brief Formats and outputs an FP8 to the console in raw form (for debugging)
+ *
+	@param x FP8 instance to be printed
+ */
+extern void FP8_rawoutput(FP8 *x);
+/**	@brief multiplies an FP8 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP8 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP8_times_i(FP8 *x);
+/**	@brief multiplies an FP8 instance by irreducible polynomial (1+sqrt(-1))
+ *
+	@param x FP8 instance, on exit = (1+sqrt(-1)*x
+ */
+extern void FP8_times_i2(FP8 *x);
+
+/**	@brief Normalises the components of an FP8
+ *
+	@param x FP8 instance to be normalised
+ */
+extern void FP8_norm(FP8 *x);
+/**	@brief Reduces all components of possibly unreduced FP8 mod Modulus
+ *
+	@param x FP8 instance, on exit reduced mod Modulus
+ */
+extern void FP8_reduce(FP8 *x);
+/**	@brief Raises an FP8 to the power of a BIG
+ *
+	@param x FP8 instance, on exit = y^b
+	@param y FP8 instance
+	@param b BIG number
+ */
+extern void FP8_pow(FP8 *x, FP8 *y, B480_56::BIG b);
+/**	@brief Raises an FP8 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP8 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP8_frob(FP8 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP8 instance, on exit = w*x-conj(x)*y+z
+	@param w FP8 instance
+	@param x FP8 instance
+	@param y FP8 instance
+	@param z FP8 instance
+ */
+extern void FP8_xtr_A(FP8 *r, FP8 *w, FP8 *x, FP8 *y, FP8 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP8 instance, on exit = x^2-2*conj(x)
+	@param x FP8 instance
+ */
+extern void FP8_xtr_D(FP8 *r, FP8 *x);
+/**	@brief Calculates FP8 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP8 instance, on exit = trace(w^b)
+	@param x FP8 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP8_xtr_pow(FP8 *r, FP8 *x, B480_56::BIG b);
+/**	@brief Calculates FP8 trace of c^a.d^b, where c and d are derived from FP8 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP8 instance, on exit = trace(c^a.d^b)
+	@param c FP8 instance, trace of an FP12
+	@param d FP8 instance, trace of an FP12
+	@param e FP8 instance, trace of an FP12
+	@param f FP8 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP8_xtr_pow2(FP8 *r, FP8 *c, FP8 *d, FP8 *e, FP8 *f, B480_56::BIG a, B480_56::BIG b);
+
+/**	@brief Test FP8 for QR
+ *
+	Square root
+	@param r FP8 instance
+    @param h optional generated hint
+	@return 1 r is a QR, otherwise 0
+ */
+extern int  FP8_qr(FP8 *r, FP *h);
+
+
+/**	@brief Calculate square root of an FP8
+ *
+	Square root
+	@param r FP8 instance, on exit = sqrt(x)
+	@param x FP8 instance
+    @param h optional input hint
+ */
+extern void  FP8_sqrt(FP8 *r, FP8 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP8 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP8 instance, set to y if s!=0
+	@param y another FP8 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP8_cmove(FP8 *x, FP8 *y, int s);
+
+
+/**	@brief Divide FP8 number by QNR
+ *
+	Divide FP8 by the QNR
+	@param x FP8 instance
+ */
+extern void FP8_div_i(FP8 *x);
+
+/**	@brief Generate random FP8
+ *
+	@param x random FP8 number
+	@param rng random number generator
+ */
+extern void FP8_rand(FP8 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp8_BLS48286.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp8_BLS48286.h
new file mode 100644
index 0000000..36279fb
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp8_BLS48286.h
@@ -0,0 +1,365 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP8_BLS48286_H
+#define FP8_BLS48286_H
+
+#include "fp4_BLS48286.h"
+#include "config_curve_BLS48286.h"
+
+using namespace core;
+
+namespace BLS48286 {
+
+/**
+	@brief FP8 Structure - towered over two FP4
+*/
+
+typedef struct
+{
+    FP4 a; /**< real part of FP8 */
+    FP4 b; /**< imaginary part of FP8 */
+} FP8;
+
+
+/* FP8 prototypes */
+/**	@brief Tests for FP8 equal to zero
+ *
+	@param x FP8 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP8_iszilch(FP8 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP8 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP8_islarger(FP8 *x);
+
+/**	@brief Serialize in FP8  
+ *
+    @param b buffer for output
+	@param x FP8 number to be serialized
+ */
+extern void FP8_toBytes(char *b,FP8 *x);
+/**	@brief Serialize out FP8  
+ *
+	@param x FP8 number to be serialized
+    @param b buffer for input
+ */
+extern void FP8_fromBytes(FP8 *x,char *b);
+
+
+/**	@brief Tests for FP8 equal to unity
+ *
+	@param x FP8 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP8_isunity(FP8 *x);
+/**	@brief Tests for equality of two FP8s
+ *
+	@param x FP8 instance to be compared
+	@param y FP8 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP8_equals(FP8 *x, FP8 *y);
+/**	@brief Tests for FP8 having only a real part and no imaginary part
+ *
+	@param x FP8 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP8_isreal(FP8 *x);
+/**	@brief Initialise FP8 from two FP4s
+ *
+	@param x FP8 instance to be initialised
+	@param a FP4 to form real part of FP8
+	@param b FP4 to form imaginary part of FP8
+ */
+extern void FP8_from_FP4s(FP8 *x, FP4 *a, FP4 *b);
+/**	@brief Initialise FP8 from single FP4
+ *
+	Imaginary part is set to zero
+	@param x FP8 instance to be initialised
+	@param a FP4 to form real part of FP8
+ */
+extern void FP8_from_FP4(FP8 *x, FP4 *a);
+
+/**	@brief Initialise FP8 from single FP4
+ *
+	real part is set to zero
+	@param x FP8 instance to be initialised
+	@param a FP4 to form imaginary part of FP8
+ */
+extern void FP8_from_FP4H(FP8 *x, FP4 *a);
+
+/**	@brief Initialise FP8 from single FP
+ *
+	@param x FP8 instance to be initialised
+	@param a FP to form real part of FP8
+ */
+extern void FP8_from_FP(FP8 *x, FP *a);
+
+/**	@brief Copy FP8 to another FP8
+ *
+	@param x FP8 instance, on exit = y
+	@param y FP8 instance to be copied
+ */
+extern void FP8_copy(FP8 *x, FP8 *y);
+
+/**	@brief Set FP8 to zero
+ *
+	@param x FP8 instance to be set to zero
+ */
+extern void FP8_zero(FP8 *x);
+/**	@brief Set FP8 to unity
+ *
+	@param x FP8 instance to be set to one
+ */
+extern void FP8_one(FP8 *x);
+
+/**	@brief Sign of FP8
+ *
+	@param x FP8 instance
+	@return "sign" of FP8
+ */
+extern int FP8_sign(FP8 *x);
+
+/**	@brief Negation of FP8
+ *
+	@param x FP8 instance, on exit = -y
+	@param y FP8 instance
+ */
+extern void FP8_neg(FP8 *x, FP8 *y);
+/**	@brief Conjugation of FP8
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP8 instance, on exit = conj(y)
+	@param y FP8 instance
+ */
+extern void FP8_conj(FP8 *x, FP8 *y);
+/**	@brief Negative conjugation of FP8
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP8 instance, on exit = -conj(y)
+	@param y FP8 instance
+ */
+extern void FP8_nconj(FP8 *x, FP8 *y);
+/**	@brief addition of two FP8s
+ *
+	@param x FP8 instance, on exit = y+z
+	@param y FP8 instance
+	@param z FP8 instance
+ */
+extern void FP8_add(FP8 *x, FP8 *y, FP8 *z);
+/**	@brief subtraction of two FP8s
+ *
+	@param x FP8 instance, on exit = y-z
+	@param y FP8 instance
+	@param z FP8 instance
+ */
+extern void FP8_sub(FP8 *x, FP8 *y, FP8 *z);
+/**	@brief Multiplication of an FP8 by an FP4
+ *
+	@param x FP8 instance, on exit = y*a
+	@param y FP8 instance
+	@param a FP4 multiplier
+ */
+extern void FP8_pmul(FP8 *x, FP8 *y, FP4 *a);
+
+/**	@brief Multiplication of an FP8 by an FP2
+ *
+	@param x FP8 instance, on exit = y*a
+	@param y FP8 instance
+	@param a FP2 multiplier
+ */
+extern void FP8_qmul(FP8 *x, FP8 *y, FP2 *a);
+
+/**	@brief Multiplication of an FP8 by an FP
+ *
+	@param x FP8 instance, on exit = y*a
+	@param y FP8 instance
+	@param a FP multiplier
+ */
+extern void FP8_tmul(FP8 *x, FP8 *y, FP *a);
+
+
+
+/**	@brief Multiplication of an FP8 by a small integer
+ *
+	@param x FP8 instance, on exit = y*i
+	@param y FP8 instance
+	@param i an integer
+ */
+extern void FP8_imul(FP8 *x, FP8 *y, int i);
+/**	@brief Squaring an FP8
+ *
+	@param x FP8 instance, on exit = y^2
+	@param y FP8 instance
+ */
+extern void FP8_sqr(FP8 *x, FP8 *y);
+/**	@brief Multiplication of two FP8s
+ *
+	@param x FP8 instance, on exit = y*z
+	@param y FP8 instance
+	@param z FP8 instance
+ */
+extern void FP8_mul(FP8 *x, FP8 *y, FP8 *z);
+/**	@brief Inverting an FP8
+ *
+	@param x FP8 instance, on exit = 1/y
+	@param y FP8 instance
+    @param h optional input hint
+ */
+extern void FP8_inv(FP8 *x, FP8 *y, FP *h);
+/**	@brief Formats and outputs an FP8 to the console
+ *
+	@param x FP8 instance to be printed
+ */
+extern void FP8_output(FP8 *x);
+/**	@brief Divide an FP8 by 2
+ *
+	@param x FP8 instance, on exit = y/2
+	@param y FP8 instance
+ */
+extern void FP8_div2(FP8 *x, FP8 *y);
+
+/**	@brief Formats and outputs an FP8 to the console in raw form (for debugging)
+ *
+	@param x FP8 instance to be printed
+ */
+extern void FP8_rawoutput(FP8 *x);
+/**	@brief multiplies an FP8 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP8 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP8_times_i(FP8 *x);
+/**	@brief multiplies an FP8 instance by irreducible polynomial (1+sqrt(-1))
+ *
+	@param x FP8 instance, on exit = (1+sqrt(-1)*x
+ */
+extern void FP8_times_i2(FP8 *x);
+
+/**	@brief Normalises the components of an FP8
+ *
+	@param x FP8 instance to be normalised
+ */
+extern void FP8_norm(FP8 *x);
+/**	@brief Reduces all components of possibly unreduced FP8 mod Modulus
+ *
+	@param x FP8 instance, on exit reduced mod Modulus
+ */
+extern void FP8_reduce(FP8 *x);
+/**	@brief Raises an FP8 to the power of a BIG
+ *
+	@param x FP8 instance, on exit = y^b
+	@param y FP8 instance
+	@param b BIG number
+ */
+extern void FP8_pow(FP8 *x, FP8 *y, B288_60::BIG b);
+/**	@brief Raises an FP8 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP8 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP8_frob(FP8 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP8 instance, on exit = w*x-conj(x)*y+z
+	@param w FP8 instance
+	@param x FP8 instance
+	@param y FP8 instance
+	@param z FP8 instance
+ */
+extern void FP8_xtr_A(FP8 *r, FP8 *w, FP8 *x, FP8 *y, FP8 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP8 instance, on exit = x^2-2*conj(x)
+	@param x FP8 instance
+ */
+extern void FP8_xtr_D(FP8 *r, FP8 *x);
+/**	@brief Calculates FP8 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP8 instance, on exit = trace(w^b)
+	@param x FP8 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP8_xtr_pow(FP8 *r, FP8 *x, B288_60::BIG b);
+/**	@brief Calculates FP8 trace of c^a.d^b, where c and d are derived from FP8 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP8 instance, on exit = trace(c^a.d^b)
+	@param c FP8 instance, trace of an FP12
+	@param d FP8 instance, trace of an FP12
+	@param e FP8 instance, trace of an FP12
+	@param f FP8 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP8_xtr_pow2(FP8 *r, FP8 *c, FP8 *d, FP8 *e, FP8 *f, B288_60::BIG a, B288_60::BIG b);
+
+/**	@brief Test FP8 for QR
+ *
+	Square root
+	@param r FP8 instance
+    @param h optional generated hint
+	@return 1 r is a QR, otherwise 0
+ */
+extern int  FP8_qr(FP8 *r, FP *h);
+
+
+/**	@brief Calculate square root of an FP8
+ *
+	Square root
+	@param r FP8 instance, on exit = sqrt(x)
+	@param x FP8 instance
+    @param h optional input hint
+ */
+extern void  FP8_sqrt(FP8 *r, FP8 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP8 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP8 instance, set to y if s!=0
+	@param y another FP8 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP8_cmove(FP8 *x, FP8 *y, int s);
+
+
+/**	@brief Divide FP8 number by QNR
+ *
+	Divide FP8 by the QNR
+	@param x FP8 instance
+ */
+extern void FP8_div_i(FP8 *x);
+
+/**	@brief Generate random FP8
+ *
+	@param x random FP8 number
+	@param rng random number generator
+ */
+extern void FP8_rand(FP8 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp8_BLS48556.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp8_BLS48556.h
new file mode 100644
index 0000000..c6d00fe
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp8_BLS48556.h
@@ -0,0 +1,365 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP8_BLS48556_H
+#define FP8_BLS48556_H
+
+#include "fp4_BLS48556.h"
+#include "config_curve_BLS48556.h"
+
+using namespace core;
+
+namespace BLS48556 {
+
+/**
+	@brief FP8 Structure - towered over two FP4
+*/
+
+typedef struct
+{
+    FP4 a; /**< real part of FP8 */
+    FP4 b; /**< imaginary part of FP8 */
+} FP8;
+
+
+/* FP8 prototypes */
+/**	@brief Tests for FP8 equal to zero
+ *
+	@param x FP8 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP8_iszilch(FP8 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP8 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP8_islarger(FP8 *x);
+
+/**	@brief Serialize in FP8  
+ *
+    @param b buffer for output
+	@param x FP8 number to be serialized
+ */
+extern void FP8_toBytes(char *b,FP8 *x);
+/**	@brief Serialize out FP8  
+ *
+	@param x FP8 number to be serialized
+    @param b buffer for input
+ */
+extern void FP8_fromBytes(FP8 *x,char *b);
+
+
+/**	@brief Tests for FP8 equal to unity
+ *
+	@param x FP8 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP8_isunity(FP8 *x);
+/**	@brief Tests for equality of two FP8s
+ *
+	@param x FP8 instance to be compared
+	@param y FP8 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP8_equals(FP8 *x, FP8 *y);
+/**	@brief Tests for FP8 having only a real part and no imaginary part
+ *
+	@param x FP8 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP8_isreal(FP8 *x);
+/**	@brief Initialise FP8 from two FP4s
+ *
+	@param x FP8 instance to be initialised
+	@param a FP4 to form real part of FP8
+	@param b FP4 to form imaginary part of FP8
+ */
+extern void FP8_from_FP4s(FP8 *x, FP4 *a, FP4 *b);
+/**	@brief Initialise FP8 from single FP4
+ *
+	Imaginary part is set to zero
+	@param x FP8 instance to be initialised
+	@param a FP4 to form real part of FP8
+ */
+extern void FP8_from_FP4(FP8 *x, FP4 *a);
+
+/**	@brief Initialise FP8 from single FP4
+ *
+	real part is set to zero
+	@param x FP8 instance to be initialised
+	@param a FP4 to form imaginary part of FP8
+ */
+extern void FP8_from_FP4H(FP8 *x, FP4 *a);
+
+/**	@brief Initialise FP8 from single FP
+ *
+	@param x FP8 instance to be initialised
+	@param a FP to form real part of FP8
+ */
+extern void FP8_from_FP(FP8 *x, FP *a);
+
+/**	@brief Copy FP8 to another FP8
+ *
+	@param x FP8 instance, on exit = y
+	@param y FP8 instance to be copied
+ */
+extern void FP8_copy(FP8 *x, FP8 *y);
+
+/**	@brief Set FP8 to zero
+ *
+	@param x FP8 instance to be set to zero
+ */
+extern void FP8_zero(FP8 *x);
+/**	@brief Set FP8 to unity
+ *
+	@param x FP8 instance to be set to one
+ */
+extern void FP8_one(FP8 *x);
+
+/**	@brief Sign of FP8
+ *
+	@param x FP8 instance
+	@return "sign" of FP8
+ */
+extern int FP8_sign(FP8 *x);
+
+/**	@brief Negation of FP8
+ *
+	@param x FP8 instance, on exit = -y
+	@param y FP8 instance
+ */
+extern void FP8_neg(FP8 *x, FP8 *y);
+/**	@brief Conjugation of FP8
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP8 instance, on exit = conj(y)
+	@param y FP8 instance
+ */
+extern void FP8_conj(FP8 *x, FP8 *y);
+/**	@brief Negative conjugation of FP8
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP8 instance, on exit = -conj(y)
+	@param y FP8 instance
+ */
+extern void FP8_nconj(FP8 *x, FP8 *y);
+/**	@brief addition of two FP8s
+ *
+	@param x FP8 instance, on exit = y+z
+	@param y FP8 instance
+	@param z FP8 instance
+ */
+extern void FP8_add(FP8 *x, FP8 *y, FP8 *z);
+/**	@brief subtraction of two FP8s
+ *
+	@param x FP8 instance, on exit = y-z
+	@param y FP8 instance
+	@param z FP8 instance
+ */
+extern void FP8_sub(FP8 *x, FP8 *y, FP8 *z);
+/**	@brief Multiplication of an FP8 by an FP4
+ *
+	@param x FP8 instance, on exit = y*a
+	@param y FP8 instance
+	@param a FP4 multiplier
+ */
+extern void FP8_pmul(FP8 *x, FP8 *y, FP4 *a);
+
+/**	@brief Multiplication of an FP8 by an FP2
+ *
+	@param x FP8 instance, on exit = y*a
+	@param y FP8 instance
+	@param a FP2 multiplier
+ */
+extern void FP8_qmul(FP8 *x, FP8 *y, FP2 *a);
+
+/**	@brief Multiplication of an FP8 by an FP
+ *
+	@param x FP8 instance, on exit = y*a
+	@param y FP8 instance
+	@param a FP multiplier
+ */
+extern void FP8_tmul(FP8 *x, FP8 *y, FP *a);
+
+
+
+/**	@brief Multiplication of an FP8 by a small integer
+ *
+	@param x FP8 instance, on exit = y*i
+	@param y FP8 instance
+	@param i an integer
+ */
+extern void FP8_imul(FP8 *x, FP8 *y, int i);
+/**	@brief Squaring an FP8
+ *
+	@param x FP8 instance, on exit = y^2
+	@param y FP8 instance
+ */
+extern void FP8_sqr(FP8 *x, FP8 *y);
+/**	@brief Multiplication of two FP8s
+ *
+	@param x FP8 instance, on exit = y*z
+	@param y FP8 instance
+	@param z FP8 instance
+ */
+extern void FP8_mul(FP8 *x, FP8 *y, FP8 *z);
+/**	@brief Inverting an FP8
+ *
+	@param x FP8 instance, on exit = 1/y
+	@param y FP8 instance
+    @param h optional input hint
+ */
+extern void FP8_inv(FP8 *x, FP8 *y, FP *h);
+/**	@brief Formats and outputs an FP8 to the console
+ *
+	@param x FP8 instance to be printed
+ */
+extern void FP8_output(FP8 *x);
+/**	@brief Divide an FP8 by 2
+ *
+	@param x FP8 instance, on exit = y/2
+	@param y FP8 instance
+ */
+extern void FP8_div2(FP8 *x, FP8 *y);
+
+/**	@brief Formats and outputs an FP8 to the console in raw form (for debugging)
+ *
+	@param x FP8 instance to be printed
+ */
+extern void FP8_rawoutput(FP8 *x);
+/**	@brief multiplies an FP8 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP8 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP8_times_i(FP8 *x);
+/**	@brief multiplies an FP8 instance by irreducible polynomial (1+sqrt(-1))
+ *
+	@param x FP8 instance, on exit = (1+sqrt(-1)*x
+ */
+extern void FP8_times_i2(FP8 *x);
+
+/**	@brief Normalises the components of an FP8
+ *
+	@param x FP8 instance to be normalised
+ */
+extern void FP8_norm(FP8 *x);
+/**	@brief Reduces all components of possibly unreduced FP8 mod Modulus
+ *
+	@param x FP8 instance, on exit reduced mod Modulus
+ */
+extern void FP8_reduce(FP8 *x);
+/**	@brief Raises an FP8 to the power of a BIG
+ *
+	@param x FP8 instance, on exit = y^b
+	@param y FP8 instance
+	@param b BIG number
+ */
+extern void FP8_pow(FP8 *x, FP8 *y, B560_58::BIG b);
+/**	@brief Raises an FP8 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP8 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP8_frob(FP8 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP8 instance, on exit = w*x-conj(x)*y+z
+	@param w FP8 instance
+	@param x FP8 instance
+	@param y FP8 instance
+	@param z FP8 instance
+ */
+extern void FP8_xtr_A(FP8 *r, FP8 *w, FP8 *x, FP8 *y, FP8 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP8 instance, on exit = x^2-2*conj(x)
+	@param x FP8 instance
+ */
+extern void FP8_xtr_D(FP8 *r, FP8 *x);
+/**	@brief Calculates FP8 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP8 instance, on exit = trace(w^b)
+	@param x FP8 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP8_xtr_pow(FP8 *r, FP8 *x, B560_58::BIG b);
+/**	@brief Calculates FP8 trace of c^a.d^b, where c and d are derived from FP8 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP8 instance, on exit = trace(c^a.d^b)
+	@param c FP8 instance, trace of an FP12
+	@param d FP8 instance, trace of an FP12
+	@param e FP8 instance, trace of an FP12
+	@param f FP8 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP8_xtr_pow2(FP8 *r, FP8 *c, FP8 *d, FP8 *e, FP8 *f, B560_58::BIG a, B560_58::BIG b);
+
+/**	@brief Test FP8 for QR
+ *
+	Square root
+	@param r FP8 instance
+    @param h optional generated hint
+	@return 1 r is a QR, otherwise 0
+ */
+extern int  FP8_qr(FP8 *r, FP *h);
+
+
+/**	@brief Calculate square root of an FP8
+ *
+	Square root
+	@param r FP8 instance, on exit = sqrt(x)
+	@param x FP8 instance
+    @param h optional input hint
+ */
+extern void  FP8_sqrt(FP8 *r, FP8 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP8 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP8 instance, set to y if s!=0
+	@param y another FP8 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP8_cmove(FP8 *x, FP8 *y, int s);
+
+
+/**	@brief Divide FP8 number by QNR
+ *
+	Divide FP8 by the QNR
+	@param x FP8 instance
+ */
+extern void FP8_div_i(FP8 *x);
+
+/**	@brief Generate random FP8
+ *
+	@param x random FP8 number
+	@param rng random number generator
+ */
+extern void FP8_rand(FP8 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp8_BLS48581.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp8_BLS48581.h
new file mode 100644
index 0000000..91c6ff6
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp8_BLS48581.h
@@ -0,0 +1,365 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP8_BLS48581_H
+#define FP8_BLS48581_H
+
+#include "fp4_BLS48581.h"
+#include "config_curve_BLS48581.h"
+
+using namespace core;
+
+namespace BLS48581 {
+
+/**
+	@brief FP8 Structure - towered over two FP4
+*/
+
+typedef struct
+{
+    FP4 a; /**< real part of FP8 */
+    FP4 b; /**< imaginary part of FP8 */
+} FP8;
+
+
+/* FP8 prototypes */
+/**	@brief Tests for FP8 equal to zero
+ *
+	@param x FP8 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP8_iszilch(FP8 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP8 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP8_islarger(FP8 *x);
+
+/**	@brief Serialize in FP8  
+ *
+    @param b buffer for output
+	@param x FP8 number to be serialized
+ */
+extern void FP8_toBytes(char *b,FP8 *x);
+/**	@brief Serialize out FP8  
+ *
+	@param x FP8 number to be serialized
+    @param b buffer for input
+ */
+extern void FP8_fromBytes(FP8 *x,char *b);
+
+
+/**	@brief Tests for FP8 equal to unity
+ *
+	@param x FP8 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP8_isunity(FP8 *x);
+/**	@brief Tests for equality of two FP8s
+ *
+	@param x FP8 instance to be compared
+	@param y FP8 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP8_equals(FP8 *x, FP8 *y);
+/**	@brief Tests for FP8 having only a real part and no imaginary part
+ *
+	@param x FP8 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP8_isreal(FP8 *x);
+/**	@brief Initialise FP8 from two FP4s
+ *
+	@param x FP8 instance to be initialised
+	@param a FP4 to form real part of FP8
+	@param b FP4 to form imaginary part of FP8
+ */
+extern void FP8_from_FP4s(FP8 *x, FP4 *a, FP4 *b);
+/**	@brief Initialise FP8 from single FP4
+ *
+	Imaginary part is set to zero
+	@param x FP8 instance to be initialised
+	@param a FP4 to form real part of FP8
+ */
+extern void FP8_from_FP4(FP8 *x, FP4 *a);
+
+/**	@brief Initialise FP8 from single FP4
+ *
+	real part is set to zero
+	@param x FP8 instance to be initialised
+	@param a FP4 to form imaginary part of FP8
+ */
+extern void FP8_from_FP4H(FP8 *x, FP4 *a);
+
+/**	@brief Initialise FP8 from single FP
+ *
+	@param x FP8 instance to be initialised
+	@param a FP to form real part of FP8
+ */
+extern void FP8_from_FP(FP8 *x, FP *a);
+
+/**	@brief Copy FP8 to another FP8
+ *
+	@param x FP8 instance, on exit = y
+	@param y FP8 instance to be copied
+ */
+extern void FP8_copy(FP8 *x, FP8 *y);
+
+/**	@brief Set FP8 to zero
+ *
+	@param x FP8 instance to be set to zero
+ */
+extern void FP8_zero(FP8 *x);
+/**	@brief Set FP8 to unity
+ *
+	@param x FP8 instance to be set to one
+ */
+extern void FP8_one(FP8 *x);
+
+/**	@brief Sign of FP8
+ *
+	@param x FP8 instance
+	@return "sign" of FP8
+ */
+extern int FP8_sign(FP8 *x);
+
+/**	@brief Negation of FP8
+ *
+	@param x FP8 instance, on exit = -y
+	@param y FP8 instance
+ */
+extern void FP8_neg(FP8 *x, FP8 *y);
+/**	@brief Conjugation of FP8
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP8 instance, on exit = conj(y)
+	@param y FP8 instance
+ */
+extern void FP8_conj(FP8 *x, FP8 *y);
+/**	@brief Negative conjugation of FP8
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP8 instance, on exit = -conj(y)
+	@param y FP8 instance
+ */
+extern void FP8_nconj(FP8 *x, FP8 *y);
+/**	@brief addition of two FP8s
+ *
+	@param x FP8 instance, on exit = y+z
+	@param y FP8 instance
+	@param z FP8 instance
+ */
+extern void FP8_add(FP8 *x, FP8 *y, FP8 *z);
+/**	@brief subtraction of two FP8s
+ *
+	@param x FP8 instance, on exit = y-z
+	@param y FP8 instance
+	@param z FP8 instance
+ */
+extern void FP8_sub(FP8 *x, FP8 *y, FP8 *z);
+/**	@brief Multiplication of an FP8 by an FP4
+ *
+	@param x FP8 instance, on exit = y*a
+	@param y FP8 instance
+	@param a FP4 multiplier
+ */
+extern void FP8_pmul(FP8 *x, FP8 *y, FP4 *a);
+
+/**	@brief Multiplication of an FP8 by an FP2
+ *
+	@param x FP8 instance, on exit = y*a
+	@param y FP8 instance
+	@param a FP2 multiplier
+ */
+extern void FP8_qmul(FP8 *x, FP8 *y, FP2 *a);
+
+/**	@brief Multiplication of an FP8 by an FP
+ *
+	@param x FP8 instance, on exit = y*a
+	@param y FP8 instance
+	@param a FP multiplier
+ */
+extern void FP8_tmul(FP8 *x, FP8 *y, FP *a);
+
+
+
+/**	@brief Multiplication of an FP8 by a small integer
+ *
+	@param x FP8 instance, on exit = y*i
+	@param y FP8 instance
+	@param i an integer
+ */
+extern void FP8_imul(FP8 *x, FP8 *y, int i);
+/**	@brief Squaring an FP8
+ *
+	@param x FP8 instance, on exit = y^2
+	@param y FP8 instance
+ */
+extern void FP8_sqr(FP8 *x, FP8 *y);
+/**	@brief Multiplication of two FP8s
+ *
+	@param x FP8 instance, on exit = y*z
+	@param y FP8 instance
+	@param z FP8 instance
+ */
+extern void FP8_mul(FP8 *x, FP8 *y, FP8 *z);
+/**	@brief Inverting an FP8
+ *
+	@param x FP8 instance, on exit = 1/y
+	@param y FP8 instance
+    @param h optional input hint
+ */
+extern void FP8_inv(FP8 *x, FP8 *y, FP *h);
+/**	@brief Formats and outputs an FP8 to the console
+ *
+	@param x FP8 instance to be printed
+ */
+extern void FP8_output(FP8 *x);
+/**	@brief Divide an FP8 by 2
+ *
+	@param x FP8 instance, on exit = y/2
+	@param y FP8 instance
+ */
+extern void FP8_div2(FP8 *x, FP8 *y);
+
+/**	@brief Formats and outputs an FP8 to the console in raw form (for debugging)
+ *
+	@param x FP8 instance to be printed
+ */
+extern void FP8_rawoutput(FP8 *x);
+/**	@brief multiplies an FP8 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP8 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP8_times_i(FP8 *x);
+/**	@brief multiplies an FP8 instance by irreducible polynomial (1+sqrt(-1))
+ *
+	@param x FP8 instance, on exit = (1+sqrt(-1)*x
+ */
+extern void FP8_times_i2(FP8 *x);
+
+/**	@brief Normalises the components of an FP8
+ *
+	@param x FP8 instance to be normalised
+ */
+extern void FP8_norm(FP8 *x);
+/**	@brief Reduces all components of possibly unreduced FP8 mod Modulus
+ *
+	@param x FP8 instance, on exit reduced mod Modulus
+ */
+extern void FP8_reduce(FP8 *x);
+/**	@brief Raises an FP8 to the power of a BIG
+ *
+	@param x FP8 instance, on exit = y^b
+	@param y FP8 instance
+	@param b BIG number
+ */
+extern void FP8_pow(FP8 *x, FP8 *y, B584_60::BIG b);
+/**	@brief Raises an FP8 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP8 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP8_frob(FP8 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP8 instance, on exit = w*x-conj(x)*y+z
+	@param w FP8 instance
+	@param x FP8 instance
+	@param y FP8 instance
+	@param z FP8 instance
+ */
+extern void FP8_xtr_A(FP8 *r, FP8 *w, FP8 *x, FP8 *y, FP8 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP8 instance, on exit = x^2-2*conj(x)
+	@param x FP8 instance
+ */
+extern void FP8_xtr_D(FP8 *r, FP8 *x);
+/**	@brief Calculates FP8 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP8 instance, on exit = trace(w^b)
+	@param x FP8 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP8_xtr_pow(FP8 *r, FP8 *x, B584_60::BIG b);
+/**	@brief Calculates FP8 trace of c^a.d^b, where c and d are derived from FP8 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP8 instance, on exit = trace(c^a.d^b)
+	@param c FP8 instance, trace of an FP12
+	@param d FP8 instance, trace of an FP12
+	@param e FP8 instance, trace of an FP12
+	@param f FP8 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP8_xtr_pow2(FP8 *r, FP8 *c, FP8 *d, FP8 *e, FP8 *f, B584_60::BIG a, B584_60::BIG b);
+
+/**	@brief Test FP8 for QR
+ *
+	Square root
+	@param r FP8 instance
+    @param h optional generated hint
+	@return 1 r is a QR, otherwise 0
+ */
+extern int  FP8_qr(FP8 *r, FP *h);
+
+
+/**	@brief Calculate square root of an FP8
+ *
+	Square root
+	@param r FP8 instance, on exit = sqrt(x)
+	@param x FP8 instance
+    @param h optional input hint
+ */
+extern void  FP8_sqrt(FP8 *r, FP8 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP8 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP8 instance, set to y if s!=0
+	@param y another FP8 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP8_cmove(FP8 *x, FP8 *y, int s);
+
+
+/**	@brief Divide FP8 number by QNR
+ *
+	Divide FP8 by the QNR
+	@param x FP8 instance
+ */
+extern void FP8_div_i(FP8 *x);
+
+/**	@brief Generate random FP8
+ *
+	@param x random FP8 number
+	@param rng random number generator
+ */
+extern void FP8_rand(FP8 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_ANSSI.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_ANSSI.h
new file mode 100644
index 0000000..05670eb
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_ANSSI.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_ANSSI_H
+#define FP_ANSSI_H
+
+#include "big_B256_56.h"
+#include "config_field_ANSSI.h"
+
+using namespace core;
+
+#define MODBITS_ANSSI MBITS_ANSSI
+#define TBITS_ANSSI (MBITS_ANSSI%BASEBITS_B256_56)              /**< Number of active bits in top word */
+#define TMASK_ANSSI (((chunk)1<<TBITS_ANSSI)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_ANSSI (((sign32)1<<MAXXES_ANSSI)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_ANSSI (-((chunk)(1)<<TBITS_ANSSI))            /**<  for masking out overflow bits */
+
+namespace ANSSI {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B256_56::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B256_56::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B256_56::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B256_56::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B256_56::BIG SQRTm3;      /**< Square root of -3 */
+extern const B256_56::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B256_56::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B256_56::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B256_56::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B256_56::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B256_56::BIG r, B256_56::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B256_56::BIG, B256_56::BIG, B256_56::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B256_56::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_BLS12381.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_BLS12381.h
new file mode 100644
index 0000000..6b3cdef
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_BLS12381.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_BLS12381_H
+#define FP_BLS12381_H
+
+#include "big_B384_58.h"
+#include "config_field_BLS12381.h"
+
+using namespace core;
+
+#define MODBITS_BLS12381 MBITS_BLS12381
+#define TBITS_BLS12381 (MBITS_BLS12381%BASEBITS_B384_58)              /**< Number of active bits in top word */
+#define TMASK_BLS12381 (((chunk)1<<TBITS_BLS12381)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_BLS12381 (((sign32)1<<MAXXES_BLS12381)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_BLS12381 (-((chunk)(1)<<TBITS_BLS12381))            /**<  for masking out overflow bits */
+
+namespace BLS12381 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B384_58::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B384_58::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B384_58::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B384_58::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B384_58::BIG SQRTm3;      /**< Square root of -3 */
+extern const B384_58::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B384_58::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B384_58::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B384_58::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B384_58::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B384_58::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B384_58::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B384_58::BIG r, B384_58::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B384_58::BIG, B384_58::BIG, B384_58::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B384_58::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_BLS12383.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_BLS12383.h
new file mode 100644
index 0000000..9d29cf8
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_BLS12383.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_BLS12383_H
+#define FP_BLS12383_H
+
+#include "big_B384_58.h"
+#include "config_field_BLS12383.h"
+
+using namespace core;
+
+#define MODBITS_BLS12383 MBITS_BLS12383
+#define TBITS_BLS12383 (MBITS_BLS12383%BASEBITS_B384_58)              /**< Number of active bits in top word */
+#define TMASK_BLS12383 (((chunk)1<<TBITS_BLS12383)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_BLS12383 (((sign32)1<<MAXXES_BLS12383)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_BLS12383 (-((chunk)(1)<<TBITS_BLS12383))            /**<  for masking out overflow bits */
+
+namespace BLS12383 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B384_58::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B384_58::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B384_58::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B384_58::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B384_58::BIG SQRTm3;      /**< Square root of -3 */
+extern const B384_58::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B384_58::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B384_58::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B384_58::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B384_58::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B384_58::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B384_58::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B384_58::BIG r, B384_58::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B384_58::BIG, B384_58::BIG, B384_58::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B384_58::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_BLS12443.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_BLS12443.h
new file mode 100644
index 0000000..a52850b
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_BLS12443.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_BLS12443_H
+#define FP_BLS12443_H
+
+#include "big_B448_60.h"
+#include "config_field_BLS12443.h"
+
+using namespace core;
+
+#define MODBITS_BLS12443 MBITS_BLS12443
+#define TBITS_BLS12443 (MBITS_BLS12443%BASEBITS_B448_60)              /**< Number of active bits in top word */
+#define TMASK_BLS12443 (((chunk)1<<TBITS_BLS12443)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_BLS12443 (((sign32)1<<MAXXES_BLS12443)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_BLS12443 (-((chunk)(1)<<TBITS_BLS12443))            /**<  for masking out overflow bits */
+
+namespace BLS12443 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B448_60::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B448_60::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B448_60::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B448_60::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B448_60::BIG SQRTm3;      /**< Square root of -3 */
+extern const B448_60::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B448_60::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B448_60::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B448_60::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B448_60::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B448_60::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B448_60::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B448_60::BIG r, B448_60::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B448_60::BIG, B448_60::BIG, B448_60::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B448_60::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_BLS12461.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_BLS12461.h
new file mode 100644
index 0000000..c163c46
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_BLS12461.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_BLS12461_H
+#define FP_BLS12461_H
+
+#include "big_B464_60.h"
+#include "config_field_BLS12461.h"
+
+using namespace core;
+
+#define MODBITS_BLS12461 MBITS_BLS12461
+#define TBITS_BLS12461 (MBITS_BLS12461%BASEBITS_B464_60)              /**< Number of active bits in top word */
+#define TMASK_BLS12461 (((chunk)1<<TBITS_BLS12461)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_BLS12461 (((sign32)1<<MAXXES_BLS12461)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_BLS12461 (-((chunk)(1)<<TBITS_BLS12461))            /**<  for masking out overflow bits */
+
+namespace BLS12461 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B464_60::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B464_60::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B464_60::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B464_60::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B464_60::BIG SQRTm3;      /**< Square root of -3 */
+extern const B464_60::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B464_60::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B464_60::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B464_60::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B464_60::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B464_60::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B464_60::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B464_60::BIG r, B464_60::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B464_60::BIG, B464_60::BIG, B464_60::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B464_60::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_BLS24479.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_BLS24479.h
new file mode 100644
index 0000000..569afce
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_BLS24479.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_BLS24479_H
+#define FP_BLS24479_H
+
+#include "big_B480_56.h"
+#include "config_field_BLS24479.h"
+
+using namespace core;
+
+#define MODBITS_BLS24479 MBITS_BLS24479
+#define TBITS_BLS24479 (MBITS_BLS24479%BASEBITS_B480_56)              /**< Number of active bits in top word */
+#define TMASK_BLS24479 (((chunk)1<<TBITS_BLS24479)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_BLS24479 (((sign32)1<<MAXXES_BLS24479)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_BLS24479 (-((chunk)(1)<<TBITS_BLS24479))            /**<  for masking out overflow bits */
+
+namespace BLS24479 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B480_56::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B480_56::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B480_56::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B480_56::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B480_56::BIG SQRTm3;      /**< Square root of -3 */
+extern const B480_56::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B480_56::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B480_56::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B480_56::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B480_56::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B480_56::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B480_56::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B480_56::BIG r, B480_56::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B480_56::BIG, B480_56::BIG, B480_56::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B480_56::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_BLS48286.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_BLS48286.h
new file mode 100644
index 0000000..5ad0012
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_BLS48286.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_BLS48286_H
+#define FP_BLS48286_H
+
+#include "big_B288_60.h"
+#include "config_field_BLS48286.h"
+
+using namespace core;
+
+#define MODBITS_BLS48286 MBITS_BLS48286
+#define TBITS_BLS48286 (MBITS_BLS48286%BASEBITS_B288_60)              /**< Number of active bits in top word */
+#define TMASK_BLS48286 (((chunk)1<<TBITS_BLS48286)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_BLS48286 (((sign32)1<<MAXXES_BLS48286)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_BLS48286 (-((chunk)(1)<<TBITS_BLS48286))            /**<  for masking out overflow bits */
+
+namespace BLS48286 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B288_60::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B288_60::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B288_60::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B288_60::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B288_60::BIG SQRTm3;      /**< Square root of -3 */
+extern const B288_60::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B288_60::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B288_60::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B288_60::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B288_60::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B288_60::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B288_60::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B288_60::BIG r, B288_60::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B288_60::BIG, B288_60::BIG, B288_60::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B288_60::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_BLS48556.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_BLS48556.h
new file mode 100644
index 0000000..e485183
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_BLS48556.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_BLS48556_H
+#define FP_BLS48556_H
+
+#include "big_B560_58.h"
+#include "config_field_BLS48556.h"
+
+using namespace core;
+
+#define MODBITS_BLS48556 MBITS_BLS48556
+#define TBITS_BLS48556 (MBITS_BLS48556%BASEBITS_B560_58)              /**< Number of active bits in top word */
+#define TMASK_BLS48556 (((chunk)1<<TBITS_BLS48556)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_BLS48556 (((sign32)1<<MAXXES_BLS48556)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_BLS48556 (-((chunk)(1)<<TBITS_BLS48556))            /**<  for masking out overflow bits */
+
+namespace BLS48556 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B560_58::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B560_58::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B560_58::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B560_58::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B560_58::BIG SQRTm3;      /**< Square root of -3 */
+extern const B560_58::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B560_58::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B560_58::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B560_58::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B560_58::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B560_58::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B560_58::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B560_58::BIG r, B560_58::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B560_58::BIG, B560_58::BIG, B560_58::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B560_58::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_BLS48581.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_BLS48581.h
new file mode 100644
index 0000000..2bc8d01
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_BLS48581.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_BLS48581_H
+#define FP_BLS48581_H
+
+#include "big_B584_60.h"
+#include "config_field_BLS48581.h"
+
+using namespace core;
+
+#define MODBITS_BLS48581 MBITS_BLS48581
+#define TBITS_BLS48581 (MBITS_BLS48581%BASEBITS_B584_60)              /**< Number of active bits in top word */
+#define TMASK_BLS48581 (((chunk)1<<TBITS_BLS48581)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_BLS48581 (((sign32)1<<MAXXES_BLS48581)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_BLS48581 (-((chunk)(1)<<TBITS_BLS48581))            /**<  for masking out overflow bits */
+
+namespace BLS48581 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B584_60::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B584_60::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B584_60::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B584_60::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B584_60::BIG SQRTm3;      /**< Square root of -3 */
+extern const B584_60::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B584_60::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B584_60::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B584_60::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B584_60::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B584_60::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B584_60::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B584_60::BIG r, B584_60::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B584_60::BIG, B584_60::BIG, B584_60::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B584_60::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_BN158.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_BN158.h
new file mode 100644
index 0000000..cefa4f1
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_BN158.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_BN158_H
+#define FP_BN158_H
+
+#include "big_B160_56.h"
+#include "config_field_BN158.h"
+
+using namespace core;
+
+#define MODBITS_BN158 MBITS_BN158
+#define TBITS_BN158 (MBITS_BN158%BASEBITS_B160_56)              /**< Number of active bits in top word */
+#define TMASK_BN158 (((chunk)1<<TBITS_BN158)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_BN158 (((sign32)1<<MAXXES_BN158)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_BN158 (-((chunk)(1)<<TBITS_BN158))            /**<  for masking out overflow bits */
+
+namespace BN158 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B160_56::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B160_56::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B160_56::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B160_56::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B160_56::BIG SQRTm3;      /**< Square root of -3 */
+extern const B160_56::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B160_56::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B160_56::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B160_56::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B160_56::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B160_56::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B160_56::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B160_56::BIG r, B160_56::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B160_56::BIG, B160_56::BIG, B160_56::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B160_56::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_BN254.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_BN254.h
new file mode 100644
index 0000000..e6279fd
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_BN254.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_BN254_H
+#define FP_BN254_H
+
+#include "big_B256_56.h"
+#include "config_field_BN254.h"
+
+using namespace core;
+
+#define MODBITS_BN254 MBITS_BN254
+#define TBITS_BN254 (MBITS_BN254%BASEBITS_B256_56)              /**< Number of active bits in top word */
+#define TMASK_BN254 (((chunk)1<<TBITS_BN254)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_BN254 (((sign32)1<<MAXXES_BN254)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_BN254 (-((chunk)(1)<<TBITS_BN254))            /**<  for masking out overflow bits */
+
+namespace BN254 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B256_56::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B256_56::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B256_56::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B256_56::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B256_56::BIG SQRTm3;      /**< Square root of -3 */
+extern const B256_56::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B256_56::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B256_56::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B256_56::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B256_56::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B256_56::BIG r, B256_56::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B256_56::BIG, B256_56::BIG, B256_56::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B256_56::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_BN254CX.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_BN254CX.h
new file mode 100644
index 0000000..29175a5
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_BN254CX.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_BN254CX_H
+#define FP_BN254CX_H
+
+#include "big_B256_56.h"
+#include "config_field_BN254CX.h"
+
+using namespace core;
+
+#define MODBITS_BN254CX MBITS_BN254CX
+#define TBITS_BN254CX (MBITS_BN254CX%BASEBITS_B256_56)              /**< Number of active bits in top word */
+#define TMASK_BN254CX (((chunk)1<<TBITS_BN254CX)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_BN254CX (((sign32)1<<MAXXES_BN254CX)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_BN254CX (-((chunk)(1)<<TBITS_BN254CX))            /**<  for masking out overflow bits */
+
+namespace BN254CX {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B256_56::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B256_56::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B256_56::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B256_56::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B256_56::BIG SQRTm3;      /**< Square root of -3 */
+extern const B256_56::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B256_56::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B256_56::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B256_56::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B256_56::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B256_56::BIG r, B256_56::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B256_56::BIG, B256_56::BIG, B256_56::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B256_56::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_BN462.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_BN462.h
new file mode 100644
index 0000000..02c9de8
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_BN462.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_BN462_H
+#define FP_BN462_H
+
+#include "big_B464_60.h"
+#include "config_field_BN462.h"
+
+using namespace core;
+
+#define MODBITS_BN462 MBITS_BN462
+#define TBITS_BN462 (MBITS_BN462%BASEBITS_B464_60)              /**< Number of active bits in top word */
+#define TMASK_BN462 (((chunk)1<<TBITS_BN462)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_BN462 (((sign32)1<<MAXXES_BN462)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_BN462 (-((chunk)(1)<<TBITS_BN462))            /**<  for masking out overflow bits */
+
+namespace BN462 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B464_60::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B464_60::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B464_60::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B464_60::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B464_60::BIG SQRTm3;      /**< Square root of -3 */
+extern const B464_60::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B464_60::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B464_60::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B464_60::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B464_60::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B464_60::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B464_60::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B464_60::BIG r, B464_60::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B464_60::BIG, B464_60::BIG, B464_60::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B464_60::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_BRAINPOOL.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_BRAINPOOL.h
new file mode 100644
index 0000000..5a44e32
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_BRAINPOOL.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_BRAINPOOL_H
+#define FP_BRAINPOOL_H
+
+#include "big_B256_56.h"
+#include "config_field_BRAINPOOL.h"
+
+using namespace core;
+
+#define MODBITS_BRAINPOOL MBITS_BRAINPOOL
+#define TBITS_BRAINPOOL (MBITS_BRAINPOOL%BASEBITS_B256_56)              /**< Number of active bits in top word */
+#define TMASK_BRAINPOOL (((chunk)1<<TBITS_BRAINPOOL)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_BRAINPOOL (((sign32)1<<MAXXES_BRAINPOOL)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_BRAINPOOL (-((chunk)(1)<<TBITS_BRAINPOOL))            /**<  for masking out overflow bits */
+
+namespace BRAINPOOL {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B256_56::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B256_56::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B256_56::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B256_56::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B256_56::BIG SQRTm3;      /**< Square root of -3 */
+extern const B256_56::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B256_56::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B256_56::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B256_56::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B256_56::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B256_56::BIG r, B256_56::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B256_56::BIG, B256_56::BIG, B256_56::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B256_56::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_C1174.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_C1174.h
new file mode 100644
index 0000000..139c316
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_C1174.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_C1174_H
+#define FP_C1174_H
+
+#include "big_B256_56.h"
+#include "config_field_C1174.h"
+
+using namespace core;
+
+#define MODBITS_C1174 MBITS_C1174
+#define TBITS_C1174 (MBITS_C1174%BASEBITS_B256_56)              /**< Number of active bits in top word */
+#define TMASK_C1174 (((chunk)1<<TBITS_C1174)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_C1174 (((sign32)1<<MAXXES_C1174)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_C1174 (-((chunk)(1)<<TBITS_C1174))            /**<  for masking out overflow bits */
+
+namespace C1174 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B256_56::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B256_56::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B256_56::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B256_56::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B256_56::BIG SQRTm3;      /**< Square root of -3 */
+extern const B256_56::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B256_56::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B256_56::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B256_56::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B256_56::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B256_56::BIG r, B256_56::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B256_56::BIG, B256_56::BIG, B256_56::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B256_56::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_C1665.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_C1665.h
new file mode 100644
index 0000000..3413c2b
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_C1665.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_C1665_H
+#define FP_C1665_H
+
+#include "big_B168_60.h"
+#include "config_field_C1665.h"
+
+using namespace core;
+
+#define MODBITS_C1665 MBITS_C1665
+#define TBITS_C1665 (MBITS_C1665%BASEBITS_B168_60)              /**< Number of active bits in top word */
+#define TMASK_C1665 (((chunk)1<<TBITS_C1665)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_C1665 (((sign32)1<<MAXXES_C1665)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_C1665 (-((chunk)(1)<<TBITS_C1665))            /**<  for masking out overflow bits */
+
+namespace C1665 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B168_60::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B168_60::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B168_60::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B168_60::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B168_60::BIG SQRTm3;      /**< Square root of -3 */
+extern const B168_60::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B168_60::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B168_60::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B168_60::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B168_60::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B168_60::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B168_60::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B168_60::BIG r, B168_60::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B168_60::BIG, B168_60::BIG, B168_60::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B168_60::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_C41417.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_C41417.h
new file mode 100644
index 0000000..d9d0a79
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_C41417.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_C41417_H
+#define FP_C41417_H
+
+#include "big_B416_60.h"
+#include "config_field_C41417.h"
+
+using namespace core;
+
+#define MODBITS_C41417 MBITS_C41417
+#define TBITS_C41417 (MBITS_C41417%BASEBITS_B416_60)              /**< Number of active bits in top word */
+#define TMASK_C41417 (((chunk)1<<TBITS_C41417)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_C41417 (((sign32)1<<MAXXES_C41417)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_C41417 (-((chunk)(1)<<TBITS_C41417))            /**<  for masking out overflow bits */
+
+namespace C41417 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B416_60::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B416_60::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B416_60::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B416_60::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B416_60::BIG SQRTm3;      /**< Square root of -3 */
+extern const B416_60::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B416_60::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B416_60::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B416_60::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B416_60::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B416_60::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B416_60::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B416_60::BIG r, B416_60::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B416_60::BIG, B416_60::BIG, B416_60::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B416_60::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_F25519.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_F25519.h
new file mode 100644
index 0000000..c1c24eb
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_F25519.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_F25519_H
+#define FP_F25519_H
+
+#include "big_B256_56.h"
+#include "config_field_F25519.h"
+
+using namespace core;
+
+#define MODBITS_F25519 MBITS_F25519
+#define TBITS_F25519 (MBITS_F25519%BASEBITS_B256_56)              /**< Number of active bits in top word */
+#define TMASK_F25519 (((chunk)1<<TBITS_F25519)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_F25519 (((sign32)1<<MAXXES_F25519)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_F25519 (-((chunk)(1)<<TBITS_F25519))            /**<  for masking out overflow bits */
+
+namespace F25519 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B256_56::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B256_56::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B256_56::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B256_56::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B256_56::BIG SQRTm3;      /**< Square root of -3 */
+extern const B256_56::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B256_56::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B256_56::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B256_56::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B256_56::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B256_56::BIG r, B256_56::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B256_56::BIG, B256_56::BIG, B256_56::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B256_56::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_F256PME.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_F256PME.h
new file mode 100644
index 0000000..6bdba2f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_F256PME.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_F256PME_H
+#define FP_F256PME_H
+
+#include "big_B256_56.h"
+#include "config_field_F256PME.h"
+
+using namespace core;
+
+#define MODBITS_F256PME MBITS_F256PME
+#define TBITS_F256PME (MBITS_F256PME%BASEBITS_B256_56)              /**< Number of active bits in top word */
+#define TMASK_F256PME (((chunk)1<<TBITS_F256PME)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_F256PME (((sign32)1<<MAXXES_F256PME)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_F256PME (-((chunk)(1)<<TBITS_F256PME))            /**<  for masking out overflow bits */
+
+namespace F256PME {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B256_56::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B256_56::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B256_56::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B256_56::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B256_56::BIG SQRTm3;      /**< Square root of -3 */
+extern const B256_56::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B256_56::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B256_56::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B256_56::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B256_56::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B256_56::BIG r, B256_56::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B256_56::BIG, B256_56::BIG, B256_56::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B256_56::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_F256PMW.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_F256PMW.h
new file mode 100644
index 0000000..5d2548f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_F256PMW.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_F256PMW_H
+#define FP_F256PMW_H
+
+#include "big_B256_56.h"
+#include "config_field_F256PMW.h"
+
+using namespace core;
+
+#define MODBITS_F256PMW MBITS_F256PMW
+#define TBITS_F256PMW (MBITS_F256PMW%BASEBITS_B256_56)              /**< Number of active bits in top word */
+#define TMASK_F256PMW (((chunk)1<<TBITS_F256PMW)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_F256PMW (((sign32)1<<MAXXES_F256PMW)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_F256PMW (-((chunk)(1)<<TBITS_F256PMW))            /**<  for masking out overflow bits */
+
+namespace F256PMW {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B256_56::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B256_56::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B256_56::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B256_56::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B256_56::BIG SQRTm3;      /**< Square root of -3 */
+extern const B256_56::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B256_56::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B256_56::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B256_56::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B256_56::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B256_56::BIG r, B256_56::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B256_56::BIG, B256_56::BIG, B256_56::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B256_56::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_F384PM.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_F384PM.h
new file mode 100644
index 0000000..a025924
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_F384PM.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_F384PM_H
+#define FP_F384PM_H
+
+#include "big_B384_58.h"
+#include "config_field_F384PM.h"
+
+using namespace core;
+
+#define MODBITS_F384PM MBITS_F384PM
+#define TBITS_F384PM (MBITS_F384PM%BASEBITS_B384_58)              /**< Number of active bits in top word */
+#define TMASK_F384PM (((chunk)1<<TBITS_F384PM)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_F384PM (((sign32)1<<MAXXES_F384PM)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_F384PM (-((chunk)(1)<<TBITS_F384PM))            /**<  for masking out overflow bits */
+
+namespace F384PM {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B384_58::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B384_58::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B384_58::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B384_58::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B384_58::BIG SQRTm3;      /**< Square root of -3 */
+extern const B384_58::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B384_58::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B384_58::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B384_58::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B384_58::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B384_58::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B384_58::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B384_58::BIG r, B384_58::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B384_58::BIG, B384_58::BIG, B384_58::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B384_58::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_F448.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_F448.h
new file mode 100644
index 0000000..ed477a4
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_F448.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_F448_H
+#define FP_F448_H
+
+#include "big_B448_58.h"
+#include "config_field_F448.h"
+
+using namespace core;
+
+#define MODBITS_F448 MBITS_F448
+#define TBITS_F448 (MBITS_F448%BASEBITS_B448_58)              /**< Number of active bits in top word */
+#define TMASK_F448 (((chunk)1<<TBITS_F448)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_F448 (((sign32)1<<MAXXES_F448)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_F448 (-((chunk)(1)<<TBITS_F448))            /**<  for masking out overflow bits */
+
+namespace F448 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B448_58::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B448_58::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B448_58::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B448_58::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B448_58::BIG SQRTm3;      /**< Square root of -3 */
+extern const B448_58::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B448_58::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B448_58::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B448_58::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B448_58::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B448_58::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B448_58::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B448_58::BIG r, B448_58::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B448_58::BIG, B448_58::BIG, B448_58::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B448_58::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_F512PM.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_F512PM.h
new file mode 100644
index 0000000..0ef3e36
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_F512PM.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_F512PM_H
+#define FP_F512PM_H
+
+#include "big_B512_60.h"
+#include "config_field_F512PM.h"
+
+using namespace core;
+
+#define MODBITS_F512PM MBITS_F512PM
+#define TBITS_F512PM (MBITS_F512PM%BASEBITS_B512_60)              /**< Number of active bits in top word */
+#define TMASK_F512PM (((chunk)1<<TBITS_F512PM)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_F512PM (((sign32)1<<MAXXES_F512PM)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_F512PM (-((chunk)(1)<<TBITS_F512PM))            /**<  for masking out overflow bits */
+
+namespace F512PM {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B512_60::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B512_60::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B512_60::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B512_60::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B512_60::BIG SQRTm3;      /**< Square root of -3 */
+extern const B512_60::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B512_60::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B512_60::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B512_60::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B512_60::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B512_60::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B512_60::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B512_60::BIG r, B512_60::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B512_60::BIG, B512_60::BIG, B512_60::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B512_60::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_FP256BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_FP256BN.h
new file mode 100644
index 0000000..dd35ed7
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_FP256BN.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_FP256BN_H
+#define FP_FP256BN_H
+
+#include "big_B256_56.h"
+#include "config_field_FP256BN.h"
+
+using namespace core;
+
+#define MODBITS_FP256BN MBITS_FP256BN
+#define TBITS_FP256BN (MBITS_FP256BN%BASEBITS_B256_56)              /**< Number of active bits in top word */
+#define TMASK_FP256BN (((chunk)1<<TBITS_FP256BN)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_FP256BN (((sign32)1<<MAXXES_FP256BN)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_FP256BN (-((chunk)(1)<<TBITS_FP256BN))            /**<  for masking out overflow bits */
+
+namespace FP256BN {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B256_56::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B256_56::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B256_56::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B256_56::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B256_56::BIG SQRTm3;      /**< Square root of -3 */
+extern const B256_56::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B256_56::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B256_56::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B256_56::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B256_56::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B256_56::BIG r, B256_56::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B256_56::BIG, B256_56::BIG, B256_56::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B256_56::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_FP512BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_FP512BN.h
new file mode 100644
index 0000000..12818ea
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_FP512BN.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_FP512BN_H
+#define FP_FP512BN_H
+
+#include "big_B512_60.h"
+#include "config_field_FP512BN.h"
+
+using namespace core;
+
+#define MODBITS_FP512BN MBITS_FP512BN
+#define TBITS_FP512BN (MBITS_FP512BN%BASEBITS_B512_60)              /**< Number of active bits in top word */
+#define TMASK_FP512BN (((chunk)1<<TBITS_FP512BN)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_FP512BN (((sign32)1<<MAXXES_FP512BN)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_FP512BN (-((chunk)(1)<<TBITS_FP512BN))            /**<  for masking out overflow bits */
+
+namespace FP512BN {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B512_60::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B512_60::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B512_60::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B512_60::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B512_60::BIG SQRTm3;      /**< Square root of -3 */
+extern const B512_60::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B512_60::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B512_60::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B512_60::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B512_60::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B512_60::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B512_60::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B512_60::BIG r, B512_60::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B512_60::BIG, B512_60::BIG, B512_60::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B512_60::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_HIFIVE.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_HIFIVE.h
new file mode 100644
index 0000000..98fc314
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_HIFIVE.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_HIFIVE_H
+#define FP_HIFIVE_H
+
+#include "big_B336_60.h"
+#include "config_field_HIFIVE.h"
+
+using namespace core;
+
+#define MODBITS_HIFIVE MBITS_HIFIVE
+#define TBITS_HIFIVE (MBITS_HIFIVE%BASEBITS_B336_60)              /**< Number of active bits in top word */
+#define TMASK_HIFIVE (((chunk)1<<TBITS_HIFIVE)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_HIFIVE (((sign32)1<<MAXXES_HIFIVE)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_HIFIVE (-((chunk)(1)<<TBITS_HIFIVE))            /**<  for masking out overflow bits */
+
+namespace HIFIVE {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B336_60::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B336_60::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B336_60::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B336_60::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B336_60::BIG SQRTm3;      /**< Square root of -3 */
+extern const B336_60::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B336_60::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B336_60::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B336_60::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B336_60::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B336_60::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B336_60::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B336_60::BIG r, B336_60::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B336_60::BIG, B336_60::BIG, B336_60::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B336_60::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_JUBJUB.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_JUBJUB.h
new file mode 100644
index 0000000..500826f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_JUBJUB.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_JUBJUB_H
+#define FP_JUBJUB_H
+
+#include "big_B256_56.h"
+#include "config_field_JUBJUB.h"
+
+using namespace core;
+
+#define MODBITS_JUBJUB MBITS_JUBJUB
+#define TBITS_JUBJUB (MBITS_JUBJUB%BASEBITS_B256_56)              /**< Number of active bits in top word */
+#define TMASK_JUBJUB (((chunk)1<<TBITS_JUBJUB)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_JUBJUB (((sign32)1<<MAXXES_JUBJUB)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_JUBJUB (-((chunk)(1)<<TBITS_JUBJUB))            /**<  for masking out overflow bits */
+
+namespace JUBJUB {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B256_56::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B256_56::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B256_56::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B256_56::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B256_56::BIG SQRTm3;      /**< Square root of -3 */
+extern const B256_56::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B256_56::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B256_56::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B256_56::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B256_56::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B256_56::BIG r, B256_56::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B256_56::BIG, B256_56::BIG, B256_56::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B256_56::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_MDC.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_MDC.h
new file mode 100644
index 0000000..f64f0fa
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_MDC.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_MDC_H
+#define FP_MDC_H
+
+#include "big_B256_56.h"
+#include "config_field_MDC.h"
+
+using namespace core;
+
+#define MODBITS_MDC MBITS_MDC
+#define TBITS_MDC (MBITS_MDC%BASEBITS_B256_56)              /**< Number of active bits in top word */
+#define TMASK_MDC (((chunk)1<<TBITS_MDC)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_MDC (((sign32)1<<MAXXES_MDC)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_MDC (-((chunk)(1)<<TBITS_MDC))            /**<  for masking out overflow bits */
+
+namespace MDC {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B256_56::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B256_56::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B256_56::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B256_56::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B256_56::BIG SQRTm3;      /**< Square root of -3 */
+extern const B256_56::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B256_56::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B256_56::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B256_56::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B256_56::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B256_56::BIG r, B256_56::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B256_56::BIG, B256_56::BIG, B256_56::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B256_56::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_NIST256.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_NIST256.h
new file mode 100644
index 0000000..182f6ac
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_NIST256.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_NIST256_H
+#define FP_NIST256_H
+
+#include "big_B256_56.h"
+#include "config_field_NIST256.h"
+
+using namespace core;
+
+#define MODBITS_NIST256 MBITS_NIST256
+#define TBITS_NIST256 (MBITS_NIST256%BASEBITS_B256_56)              /**< Number of active bits in top word */
+#define TMASK_NIST256 (((chunk)1<<TBITS_NIST256)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_NIST256 (((sign32)1<<MAXXES_NIST256)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_NIST256 (-((chunk)(1)<<TBITS_NIST256))            /**<  for masking out overflow bits */
+
+namespace NIST256 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B256_56::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B256_56::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B256_56::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B256_56::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B256_56::BIG SQRTm3;      /**< Square root of -3 */
+extern const B256_56::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B256_56::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B256_56::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B256_56::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B256_56::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B256_56::BIG r, B256_56::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B256_56::BIG, B256_56::BIG, B256_56::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B256_56::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_NIST384.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_NIST384.h
new file mode 100644
index 0000000..f9d6a0c
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_NIST384.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_NIST384_H
+#define FP_NIST384_H
+
+#include "big_B384_56.h"
+#include "config_field_NIST384.h"
+
+using namespace core;
+
+#define MODBITS_NIST384 MBITS_NIST384
+#define TBITS_NIST384 (MBITS_NIST384%BASEBITS_B384_56)              /**< Number of active bits in top word */
+#define TMASK_NIST384 (((chunk)1<<TBITS_NIST384)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_NIST384 (((sign32)1<<MAXXES_NIST384)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_NIST384 (-((chunk)(1)<<TBITS_NIST384))            /**<  for masking out overflow bits */
+
+namespace NIST384 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B384_56::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B384_56::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B384_56::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B384_56::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B384_56::BIG SQRTm3;      /**< Square root of -3 */
+extern const B384_56::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B384_56::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B384_56::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B384_56::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B384_56::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B384_56::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B384_56::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B384_56::BIG r, B384_56::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B384_56::BIG, B384_56::BIG, B384_56::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B384_56::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_NIST521.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_NIST521.h
new file mode 100644
index 0000000..618166e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_NIST521.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_NIST521_H
+#define FP_NIST521_H
+
+#include "big_B528_60.h"
+#include "config_field_NIST521.h"
+
+using namespace core;
+
+#define MODBITS_NIST521 MBITS_NIST521
+#define TBITS_NIST521 (MBITS_NIST521%BASEBITS_B528_60)              /**< Number of active bits in top word */
+#define TMASK_NIST521 (((chunk)1<<TBITS_NIST521)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_NIST521 (((sign32)1<<MAXXES_NIST521)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_NIST521 (-((chunk)(1)<<TBITS_NIST521))            /**<  for masking out overflow bits */
+
+namespace NIST521 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B528_60::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B528_60::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B528_60::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B528_60::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B528_60::BIG SQRTm3;      /**< Square root of -3 */
+extern const B528_60::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B528_60::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B528_60::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B528_60::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B528_60::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B528_60::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B528_60::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B528_60::BIG r, B528_60::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B528_60::BIG, B528_60::BIG, B528_60::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B528_60::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_SECP160R1.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_SECP160R1.h
new file mode 100644
index 0000000..6dda085
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_SECP160R1.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_SECP160R1_H
+#define FP_SECP160R1_H
+
+#include "big_B160_56.h"
+#include "config_field_SECP160R1.h"
+
+using namespace core;
+
+#define MODBITS_SECP160R1 MBITS_SECP160R1
+#define TBITS_SECP160R1 (MBITS_SECP160R1%BASEBITS_B160_56)              /**< Number of active bits in top word */
+#define TMASK_SECP160R1 (((chunk)1<<TBITS_SECP160R1)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_SECP160R1 (((sign32)1<<MAXXES_SECP160R1)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_SECP160R1 (-((chunk)(1)<<TBITS_SECP160R1))            /**<  for masking out overflow bits */
+
+namespace SECP160R1 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B160_56::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B160_56::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B160_56::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B160_56::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B160_56::BIG SQRTm3;      /**< Square root of -3 */
+extern const B160_56::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B160_56::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B160_56::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B160_56::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B160_56::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B160_56::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B160_56::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B160_56::BIG r, B160_56::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B160_56::BIG, B160_56::BIG, B160_56::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B160_56::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_SECP256K1.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_SECP256K1.h
new file mode 100644
index 0000000..4bbfc83
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_SECP256K1.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_SECP256K1_H
+#define FP_SECP256K1_H
+
+#include "big_B256_56.h"
+#include "config_field_SECP256K1.h"
+
+using namespace core;
+
+#define MODBITS_SECP256K1 MBITS_SECP256K1
+#define TBITS_SECP256K1 (MBITS_SECP256K1%BASEBITS_B256_56)              /**< Number of active bits in top word */
+#define TMASK_SECP256K1 (((chunk)1<<TBITS_SECP256K1)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_SECP256K1 (((sign32)1<<MAXXES_SECP256K1)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_SECP256K1 (-((chunk)(1)<<TBITS_SECP256K1))            /**<  for masking out overflow bits */
+
+namespace SECP256K1 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B256_56::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B256_56::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B256_56::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B256_56::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B256_56::BIG SQRTm3;      /**< Square root of -3 */
+extern const B256_56::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B256_56::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B256_56::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B256_56::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B256_56::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B256_56::BIG r, B256_56::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B256_56::BIG, B256_56::BIG, B256_56::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B256_56::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_SM2.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_SM2.h
new file mode 100644
index 0000000..f0c0354
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_SM2.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_SM2_H
+#define FP_SM2_H
+
+#include "big_B256_56.h"
+#include "config_field_SM2.h"
+
+using namespace core;
+
+#define MODBITS_SM2 MBITS_SM2
+#define TBITS_SM2 (MBITS_SM2%BASEBITS_B256_56)              /**< Number of active bits in top word */
+#define TMASK_SM2 (((chunk)1<<TBITS_SM2)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_SM2 (((sign32)1<<MAXXES_SM2)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_SM2 (-((chunk)(1)<<TBITS_SM2))            /**<  for masking out overflow bits */
+
+namespace SM2 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B256_56::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B256_56::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B256_56::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B256_56::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B256_56::BIG SQRTm3;      /**< Square root of -3 */
+extern const B256_56::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B256_56::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B256_56::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B256_56::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B256_56::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B256_56::BIG r, B256_56::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B256_56::BIG, B256_56::BIG, B256_56::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B256_56::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_TWEEDLEDEE.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_TWEEDLEDEE.h
new file mode 100644
index 0000000..7187183
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_TWEEDLEDEE.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_TWEEDLEDEE_H
+#define FP_TWEEDLEDEE_H
+
+#include "big_B256_56.h"
+#include "config_field_TWEEDLEDEE.h"
+
+using namespace core;
+
+#define MODBITS_TWEEDLEDEE MBITS_TWEEDLEDEE
+#define TBITS_TWEEDLEDEE (MBITS_TWEEDLEDEE%BASEBITS_B256_56)              /**< Number of active bits in top word */
+#define TMASK_TWEEDLEDEE (((chunk)1<<TBITS_TWEEDLEDEE)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_TWEEDLEDEE (((sign32)1<<MAXXES_TWEEDLEDEE)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_TWEEDLEDEE (-((chunk)(1)<<TBITS_TWEEDLEDEE))            /**<  for masking out overflow bits */
+
+namespace TWEEDLEDEE {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B256_56::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B256_56::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B256_56::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B256_56::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B256_56::BIG SQRTm3;      /**< Square root of -3 */
+extern const B256_56::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B256_56::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B256_56::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B256_56::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B256_56::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B256_56::BIG r, B256_56::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B256_56::BIG, B256_56::BIG, B256_56::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B256_56::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_TWEEDLEDUM.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_TWEEDLEDUM.h
new file mode 100644
index 0000000..18f9b86
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/fp_TWEEDLEDUM.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_TWEEDLEDUM_H
+#define FP_TWEEDLEDUM_H
+
+#include "big_B256_56.h"
+#include "config_field_TWEEDLEDUM.h"
+
+using namespace core;
+
+#define MODBITS_TWEEDLEDUM MBITS_TWEEDLEDUM
+#define TBITS_TWEEDLEDUM (MBITS_TWEEDLEDUM%BASEBITS_B256_56)              /**< Number of active bits in top word */
+#define TMASK_TWEEDLEDUM (((chunk)1<<TBITS_TWEEDLEDUM)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_TWEEDLEDUM (((sign32)1<<MAXXES_TWEEDLEDUM)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_TWEEDLEDUM (-((chunk)(1)<<TBITS_TWEEDLEDUM))            /**<  for masking out overflow bits */
+
+namespace TWEEDLEDUM {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B256_56::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B256_56::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B256_56::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B256_56::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B256_56::BIG SQRTm3;      /**< Square root of -3 */
+extern const B256_56::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B256_56::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B256_56::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B256_56::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B256_56::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B256_56::BIG r, B256_56::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B256_56::BIG, B256_56::BIG, B256_56::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B256_56::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/gcm.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/gcm.cpp
new file mode 100644
index 0000000..843ab0f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/gcm.cpp
@@ -0,0 +1,440 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/*
+ * Implementation of the AES-GCM Encryption/Authentication
+ *
+ * Some restrictions..
+ * 1. Only for use with AES
+ * 2. Returned tag is always 128-bits. Truncate at your own risk.
+ * 3. The order of function calls must follow some rules
+ *
+ * Typical sequence of calls..
+ * 1. call GCM_init
+ * 2. call GCM_add_header any number of times, as long as length of header is multiple of 16 bytes (block size)
+ * 3. call GCM_add_header one last time with any length of header
+ * 4. call GCM_add_cipher any number of times, as long as length of cipher/plaintext is multiple of 16 bytes
+ * 5. call GCM_add_cipher one last time with any length of cipher/plaintext
+ * 6. call GCM_finish to extract the tag.
+ *
+ * See http://www.mindspring.com/~dmcgrew/gcm-nist-6.pdf
+ */
+/* SU=m, m is Stack Usage */
+
+#include <stdlib.h>
+#include <string.h>
+#include "arch.h"
+#include "core.h"
+
+using namespace core;
+
+#define NB 4
+#define MR_TOBYTE(x) ((uchar)((x)))
+
+static unsign32 pack(const uchar *b)
+{
+    /* pack bytes into a 32-bit Word */
+    return ((unsign32)b[0] << 24) | ((unsign32)b[1] << 16) | ((unsign32)b[2] << 8) | (unsign32)b[3];
+}
+
+static void unpack(unsign32 a, uchar *b)
+{
+    /* unpack bytes from a word */
+    b[3] = MR_TOBYTE(a);
+    b[2] = MR_TOBYTE(a >> 8);
+    b[1] = MR_TOBYTE(a >> 16);
+    b[0] = MR_TOBYTE(a >> 24);
+}
+
+static void precompute(gcm *g, uchar *H)
+{
+    /* precompute small 2k bytes gf2m table of x^n.H */
+    int i, j;
+    unsign32 *last, *next, b;
+
+    for (i = j = 0; i < NB; i++, j += 4) g->table[0][i] = pack((uchar *)&H[j]);
+
+    for (i = 1; i < 128; i++)
+    {
+        next = g->table[i];
+        last = g->table[i - 1];
+        b = 0;
+        for (j = 0; j < NB; j++)
+        {
+            next[j] = b | (last[j]) >> 1;
+            b = last[j] << 31;
+        }
+        if (b) next[0] ^= 0xE1000000; /* irreducible polynomial */
+    }
+}
+
+/* SU= 32 */
+static void gf2mul(gcm *g)
+{
+    /* gf2m mul - Z=H*X mod 2^128 */
+    int i, j, m, k;
+    unsign32 P[4];
+    unsign32 b;
+
+    P[0] = P[1] = P[2] = P[3] = 0;
+    j = 8;
+    m = 0;
+    for (i = 0; i < 128; i++)
+    {
+        b = (unsign32)(g->stateX[m] >> (--j)) & 1;
+        b = ~b + 1;
+        for (k = 0; k < NB; k++) P[k] ^= (g->table[i][k] & b);
+        if (j == 0)
+        {
+            j = 8;
+            m++;
+            if (m == 16) break;
+        }
+    }
+    for (i = j = 0; i < NB; i++, j += 4) unpack(P[i], (uchar *)&g->stateX[j]);
+}
+
+/* SU= 32 */
+static void GCM_wrap(gcm *g)
+{
+    /* Finish off GHASH */
+    int i, j;
+    unsign32 F[4];
+    uchar L[16];
+
+    /* convert lengths from bytes to bits */
+    F[0] = (g->lenA[0] << 3) | (g->lenA[1] & 0xE0000000) >> 29;
+    F[1] = g->lenA[1] << 3;
+    F[2] = (g->lenC[0] << 3) | (g->lenC[1] & 0xE0000000) >> 29;
+    F[3] = g->lenC[1] << 3;
+    for (i = j = 0; i < NB; i++, j += 4) unpack(F[i], (uchar *)&L[j]);
+
+    for (i = 0; i < 16; i++) g->stateX[i] ^= L[i];
+    gf2mul(g);
+}
+
+static int GCM_ghash(gcm *g, char *plain, int len)
+{
+    int i, j = 0;
+    if (g->status == GCM_ACCEPTING_HEADER) g->status = GCM_ACCEPTING_CIPHER;
+    if (g->status != GCM_ACCEPTING_CIPHER) return 0;
+
+    while (j < len)
+    {
+        for (i = 0; i < 16 && j < len; i++)
+        {
+            g->stateX[i] ^= plain[j++];
+            g->lenC[1]++;
+            if (g->lenC[1] == 0) g->lenC[0]++;
+        }
+        gf2mul(g);
+    }
+    if (len % 16 != 0) g->status = GCM_NOT_ACCEPTING_MORE;
+    return 1;
+}
+
+/* SU= 48 */
+/* Initialize GCM mode */
+void core::GCM_init(gcm* g, int nk, char *key, int niv, char *iv)
+{
+    /* iv size niv is usually 12 bytes (96 bits). AES key size nk can be 16,24 or 32 bytes */
+    int i;
+    uchar H[16];
+    for (i = 0; i < 16; i++)
+    {
+        H[i] = 0;
+        g->stateX[i] = 0;
+    }
+
+    AES_init(&(g->a), ECB, nk, key, iv);
+    AES_ecb_encrypt(&(g->a), H);    /* E(K,0) */
+    precompute(g, H);
+
+    g->lenA[0] = g->lenC[0] = g->lenA[1] = g->lenC[1] = 0;
+    if (niv == 12)
+    {
+        for (i = 0; i < 12; i++) g->a.f[i] = iv[i];
+        unpack((unsign32)1, (uchar *) & (g->a.f[12])); /* initialise IV */
+        for (i = 0; i < 16; i++) g->Y_0[i] = g->a.f[i];
+    }
+    else
+    {
+        g->status = GCM_ACCEPTING_CIPHER;
+        GCM_ghash(g, iv, niv); /* GHASH(H,0,IV) */
+        GCM_wrap(g);
+        for (i = 0; i < 16; i++)
+        {
+            g->a.f[i] = g->stateX[i];
+            g->Y_0[i] = g->a.f[i];
+            g->stateX[i] = 0;
+        }
+        g->lenA[0] = g->lenC[0] = g->lenA[1] = g->lenC[1] = 0;
+    }
+    g->status = GCM_ACCEPTING_HEADER;
+}
+
+/* SU= 24 */
+/* Add Header data - included but not encrypted */
+int core::GCM_add_header(gcm* g, char *header, int len)
+{
+    /* Add some header. Won't be encrypted, but will be authenticated. len is length of header */
+    int i, j = 0;
+    if (g->status != GCM_ACCEPTING_HEADER) return 0;
+
+    while (j < len)
+    {
+        for (i = 0; i < 16 && j < len; i++)
+        {
+            g->stateX[i] ^= header[j++];
+            g->lenA[1]++;
+            if (g->lenA[1] == 0) g->lenA[0]++;
+        }
+        gf2mul(g);
+    }
+    if (len % 16 != 0) g->status = GCM_ACCEPTING_CIPHER;
+    return 1;
+}
+
+/* SU= 48 */
+/* Add Plaintext - included and encrypted */
+int core::GCM_add_plain(gcm *g, char *cipher, char *plain, int len)
+{
+    /* Add plaintext to extract ciphertext, len is length of plaintext.  */
+    int i, j = 0;
+    unsign32 counter;
+    uchar B[16];
+    if (g->status == GCM_ACCEPTING_HEADER) g->status = GCM_ACCEPTING_CIPHER;
+    if (g->status != GCM_ACCEPTING_CIPHER) return 0;
+
+    while (j < len)
+    {
+        counter = pack((uchar *) & (g->a.f[12]));
+        counter++;
+        unpack(counter, (uchar *) & (g->a.f[12])); /* increment counter */
+        for (i = 0; i < 16; i++) B[i] = g->a.f[i];
+        AES_ecb_encrypt(&(g->a), B);       /* encrypt it  */
+
+        for (i = 0; i < 16 && j < len; i++)
+        {
+            cipher[j] = plain[j] ^ B[i];
+            g->stateX[i] ^= cipher[j++];
+            g->lenC[1]++;
+            if (g->lenC[1] == 0) g->lenC[0]++;
+        }
+        gf2mul(g);
+    }
+    if (len % 16 != 0) g->status = GCM_NOT_ACCEPTING_MORE;
+    return 1;
+}
+
+/* SU= 48 */
+/* Add Ciphertext - decrypts to plaintext */
+int core::GCM_add_cipher(gcm *g, char *plain, char *cipher, int len)
+{
+    /* Add ciphertext to extract plaintext, len is length of ciphertext. */
+    int i, j = 0;
+    unsign32 counter;
+    char oc;
+    uchar B[16];
+    if (g->status == GCM_ACCEPTING_HEADER) g->status = GCM_ACCEPTING_CIPHER;
+    if (g->status != GCM_ACCEPTING_CIPHER) return 0;
+
+    while (j < len)
+    {
+        counter = pack((uchar *) & (g->a.f[12]));
+        counter++;
+        unpack(counter, (uchar *) & (g->a.f[12])); /* increment counter */
+        for (i = 0; i < 16; i++) B[i] = g->a.f[i];
+        AES_ecb_encrypt(&(g->a), B);       /* encrypt it  */
+        for (i = 0; i < 16 && j < len; i++)
+        {
+            oc = cipher[j];
+            plain[j] = cipher[j] ^ B[i];
+            g->stateX[i] ^= oc;
+            j++;
+            g->lenC[1]++;
+            if (g->lenC[1] == 0) g->lenC[0]++;
+        }
+        gf2mul(g);
+    }
+    if (len % 16 != 0) g->status = GCM_NOT_ACCEPTING_MORE;
+    return 1;
+}
+
+/* SU= 16 */
+/* Finish and extract Tag */
+void core::GCM_finish(gcm *g, char *tag)
+{
+    /* Finish off GHASH and extract tag (MAC) */
+    int i;
+
+    GCM_wrap(g);
+
+    /* extract tag */
+    if (tag != NULL)
+    {
+        AES_ecb_encrypt(&(g->a), g->Y_0);       /* E(K,Y0) */
+        for (i = 0; i < 16; i++) g->Y_0[i] ^= g->stateX[i];
+        for (i = 0; i < 16; i++)
+        {
+            tag[i] = g->Y_0[i];
+            g->Y_0[i] = g->stateX[i] = 0;
+        }
+    }
+
+    g->status = GCM_FINISHED;
+    AES_end(&(g->a));
+}
+
+/* AES-GCM Encryption of octets, K is key, H is header,
+   P is plaintext, C is ciphertext, T is authentication tag */
+void core::AES_GCM_ENCRYPT(octet *K, octet *IV, octet *H, octet *P, octet *C, octet *T)
+{
+    gcm g;
+    GCM_init(&g, K->len, K->val, IV->len, IV->val);
+    GCM_add_header(&g, H->val, H->len);
+    GCM_add_plain(&g, C->val, P->val, P->len);
+    C->len = P->len;
+    GCM_finish(&g, T->val);
+    T->len = 16;
+}
+
+/* AES-GCM Decryption of octets, K is key, H is header,
+   P is plaintext, C is ciphertext, T is authentication tag */
+void core::AES_GCM_DECRYPT(octet *K, octet *IV, octet *H, octet *C, octet *P, octet *T)
+{
+    gcm g;
+    GCM_init(&g, K->len, K->val, IV->len, IV->val);
+    GCM_add_header(&g, H->val, H->len);
+    GCM_add_cipher(&g, P->val, C->val, C->len);
+    P->len = C->len;
+    GCM_finish(&g, T->val);
+    T->len = 16;
+}
+
+
+// Compile with
+// gcc -O2 gcm.c aes.c -o gcm.exe
+/* SU= 16
+*/
+
+/* static void hex2bytes(char *hex,char *bin) */
+/* { */
+/*  int i; */
+/*  char v; */
+/*  int len=strlen(hex); */
+/*  for (i = 0; i < len/2; i++) { */
+/*         char c = hex[2*i]; */
+/*         if (c >= '0' && c <= '9') { */
+/*             v = c - '0'; */
+/*         } else if (c >= 'A' && c <= 'F') { */
+/*             v = c - 'A' + 10; */
+/*         } else if (c >= 'a' && c <= 'f') { */
+/*             v = c - 'a' + 10; */
+/*         } else { */
+/*             v = 0; */
+/*         } */
+/*         v <<= 4; */
+/*         c = hex[2*i + 1]; */
+/*         if (c >= '0' && c <= '9') { */
+/*             v += c - '0'; */
+/*         } else if (c >= 'A' && c <= 'F') { */
+/*             v += c - 'A' + 10; */
+/*         } else if (c >= 'a' && c <= 'f') { */
+/*             v += c - 'a' + 10; */
+/*         } else { */
+/*             v = 0; */
+/*         } */
+/*         bin[i] = v; */
+/*     } */
+/* } */
+
+/*
+int main()
+{
+    int i;
+
+//  char* KT="feffe9928665731c6d6a8f9467308308";
+//  char* MT="d9313225f88406e5a55909c5aff5269a86a7a9531534f7da2e4c303d8a318a721c3c0c95956809532fcf0e2449a6b525b16aedf5aa0de657ba637b39";
+//  char* HT="feedfacedeadbeeffeedfacedeadbeefabaddad2";
+//  char* NT="cafebabefacedbaddecaf888";
+// Tag should be 5bc94fbc3221a5db94fae95ae7121a47
+//  char* NT="9313225df88406e555909c5aff5269aa6a7a9538534f7da1e4c303d2a318a728c3c0c95156809539fcf0e2429a6b525416aedbf5a0de6a57a637b39b";
+// Tag should be 619cc5aefffe0bfa462af43c1699d050
+
+  char* KT="6dfb5dc68af6ae2f3242e9184f100918";
+  char* MT="47809d16c2c6ec685962c90e53fe1bba";
+  char* HT="dd0fa6e494031139d71ee45f00d56fa4";
+  char* NT="37d36f5c54d53479d4745dd1";
+
+
+    int len=strlen(MT)/2;
+    int lenH=strlen(HT)/2;
+    int lenK=strlen(KT)/2;
+    int lenIV=strlen(NT)/2;
+
+    char T[16];   // Tag
+    char K[16];   // AES Key
+    char H[64];   // Header - to be included in Authentication, but not encrypted
+    char N[100];   // IV - Initialisation vector
+    char M[100];  // Plaintext to be encrypted/authenticated
+    char C[100];  // Ciphertext
+    char P[100];  // Recovered Plaintext
+
+    gcm g;
+
+    hex2bytes(MT, M);
+    hex2bytes(HT, H);
+    hex2bytes(NT, N);
+    hex2bytes(KT, K);
+
+    printf("lenK= %d\n",lenK);
+
+    printf("Plaintext=\n");
+    for (i=0;i<len;i++) printf("%02x",(unsigned char)M[i]);
+    printf("\n");
+
+    GCM_init(&g,16,K,lenIV,N);
+    GCM_add_header(&g,H,lenH);
+    GCM_add_plain(&g,C,M,len);
+    GCM_finish(&g,T);
+
+    printf("Ciphertext=\n");
+    for (i=0;i<len;i++) printf("%02x",(unsigned char)C[i]);
+    printf("\n");
+
+    printf("Tag=\n");
+    for (i=0;i<16;i++) printf("%02x",(unsigned char)T[i]);
+    printf("\n");
+
+    GCM_init(&g,16,K,lenIV,N);
+    GCM_add_header(&g,H,lenH);
+    GCM_add_cipher(&g,P,C,len);
+    GCM_finish(&g,T);
+
+    printf("Plaintext=\n");
+    for (i=0;i<len;i++) printf("%02x",(unsigned char)P[i]);
+    printf("\n");
+
+    printf("Tag=\n");
+    for (i=0;i<16;i++) printf("%02x",(unsigned char)T[i]);
+    printf("\n");
+}
+
+*/
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hash.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hash.cpp
new file mode 100644
index 0000000..5c1c3ac
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hash.cpp
@@ -0,0 +1,659 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/*
+ * Implementation of the Secure Hashing Algorithm (SHA-256/384/512 and SHA3)
+ *
+ * Generates a message digest. It should be impossible to come
+ * come up with two messages that hash to the same value ("collision free").
+ *
+ * For use with byte-oriented messages only. Could/Should be speeded
+ * up by unwinding loops in HASH_transform(), and assembly patches.
+ */
+
+#include "arch.h"
+#include "core.h"
+
+using namespace core;
+
+#define H0_256 0x6A09E667L
+#define H1_256 0xBB67AE85L
+#define H2_256 0x3C6EF372L
+#define H3_256 0xA54FF53AL
+#define H4_256 0x510E527FL
+#define H5_256 0x9B05688CL
+#define H6_256 0x1F83D9ABL
+#define H7_256 0x5BE0CD19L
+
+static const unsign32 K_256[64] =
+{
+    0x428a2f98L, 0x71374491L, 0xb5c0fbcfL, 0xe9b5dba5L, 0x3956c25bL, 0x59f111f1L, 0x923f82a4L, 0xab1c5ed5L,
+    0xd807aa98L, 0x12835b01L, 0x243185beL, 0x550c7dc3L, 0x72be5d74L, 0x80deb1feL, 0x9bdc06a7L, 0xc19bf174L,
+    0xe49b69c1L, 0xefbe4786L, 0x0fc19dc6L, 0x240ca1ccL, 0x2de92c6fL, 0x4a7484aaL, 0x5cb0a9dcL, 0x76f988daL,
+    0x983e5152L, 0xa831c66dL, 0xb00327c8L, 0xbf597fc7L, 0xc6e00bf3L, 0xd5a79147L, 0x06ca6351L, 0x14292967L,
+    0x27b70a85L, 0x2e1b2138L, 0x4d2c6dfcL, 0x53380d13L, 0x650a7354L, 0x766a0abbL, 0x81c2c92eL, 0x92722c85L,
+    0xa2bfe8a1L, 0xa81a664bL, 0xc24b8b70L, 0xc76c51a3L, 0xd192e819L, 0xd6990624L, 0xf40e3585L, 0x106aa070L,
+    0x19a4c116L, 0x1e376c08L, 0x2748774cL, 0x34b0bcb5L, 0x391c0cb3L, 0x4ed8aa4aL, 0x5b9cca4fL, 0x682e6ff3L,
+    0x748f82eeL, 0x78a5636fL, 0x84c87814L, 0x8cc70208L, 0x90befffaL, 0xa4506cebL, 0xbef9a3f7L, 0xc67178f2L
+};
+
+#define PAD  0x80
+#define ZERO 0
+
+/* functions */
+
+#define S(m,n,x) (((x)>>n) | ((x)<<(m-n)))
+#define R(n,x) ((x)>>n)
+
+#define Ch(x,y,z)  ((x&y)^(~(x)&z))
+#define Maj(x,y,z) ((x&y)^(x&z)^(y&z))
+#define Sig0_256(x)    (S(32,2,x)^S(32,13,x)^S(32,22,x))
+#define Sig1_256(x)    (S(32,6,x)^S(32,11,x)^S(32,25,x))
+#define theta0_256(x)  (S(32,7,x)^S(32,18,x)^R(3,x))
+#define theta1_256(x)  (S(32,17,x)^S(32,19,x)^R(10,x))
+
+#define Sig0_512(x)    (S(64,28,x)^S(64,34,x)^S(64,39,x))
+#define Sig1_512(x)    (S(64,14,x)^S(64,18,x)^S(64,41,x))
+#define theta0_512(x)  (S(64,1,x)^S(64,8,x)^R(7,x))
+#define theta1_512(x)  (S(64,19,x)^S(64,61,x)^R(6,x))
+
+
+/* SU= 72 */
+static void HASH256_transform(hash256 *sh)
+{
+    /* basic transformation step */
+    unsign32 a, b, c, d, e, f, g, h, t1, t2;
+    int j;
+    for (j = 16; j < 64; j++)
+        sh->w[j] = theta1_256(sh->w[j - 2]) + sh->w[j - 7] + theta0_256(sh->w[j - 15]) + sh->w[j - 16];
+
+    a = sh->h[0];
+    b = sh->h[1];
+    c = sh->h[2];
+    d = sh->h[3];
+    e = sh->h[4];
+    f = sh->h[5];
+    g = sh->h[6];
+    h = sh->h[7];
+
+    for (j = 0; j < 64; j++)
+    {
+        /* 64 times - mush it up */
+        t1 = h + Sig1_256(e) + Ch(e, f, g) + K_256[j] + sh->w[j];
+        t2 = Sig0_256(a) + Maj(a, b, c);
+        h = g;
+        g = f;
+        f = e;
+        e = d + t1;
+        d = c;
+        c = b;
+        b = a;
+        a = t1 + t2;
+    }
+
+    sh->h[0] += a;
+    sh->h[1] += b;
+    sh->h[2] += c;
+    sh->h[3] += d;
+    sh->h[4] += e;
+    sh->h[5] += f;
+    sh->h[6] += g;
+    sh->h[7] += h;
+}
+
+/* Initialise Hash function */
+void core::HASH256_init(hash256 *sh)
+{
+    /* re-initialise */
+    int i;
+    for (i = 0; i < 64; i++) sh->w[i] = 0L;
+    sh->length[0] = sh->length[1] = 0L;
+    sh->h[0] = H0_256;
+    sh->h[1] = H1_256;
+    sh->h[2] = H2_256;
+    sh->h[3] = H3_256;
+    sh->h[4] = H4_256;
+    sh->h[5] = H5_256;
+    sh->h[6] = H6_256;
+    sh->h[7] = H7_256;
+
+    sh->hlen = 32;
+}
+
+/* process a single byte */
+void core::HASH256_process(hash256 *sh, int byt)
+{
+    /* process the next message byte */
+    int cnt;
+    cnt = (int)((sh->length[0] / 32) % 16);
+
+    sh->w[cnt] <<= 8;
+    sh->w[cnt] |= (unsign32)(byt & 0xFF);
+
+    sh->length[0] += 8;
+    if (sh->length[0] == 0L)
+    {
+        sh->length[1]++;
+        sh->length[0] = 0L;
+    }
+    if ((sh->length[0] % 512) == 0) HASH256_transform(sh);
+}
+
+/* SU= 24 */
+/* Generate 32-byte final Hash */
+void core::HASH256_hash(hash256 *sh, char *digest)
+{
+    /* pad message and finish - supply digest */
+    int i;
+    unsign32 len0, len1;
+    len0 = sh->length[0];
+    len1 = sh->length[1];
+    HASH256_process(sh, PAD);
+    while ((sh->length[0] % 512) != 448) HASH256_process(sh, ZERO);
+    sh->w[14] = len1;
+    sh->w[15] = len0;
+    HASH256_transform(sh);
+    for (i = 0; i < sh->hlen; i++)
+    {
+        /* convert to bytes */
+        digest[i] = (char)((sh->h[i / 4] >> (8 * (3 - i % 4))) & 0xffL);
+    }
+    HASH256_init(sh);
+}
+
+/* return 32-byte intermediate hash */
+void core::HASH256_continuing_hash(hash256 *sh,char *digest)
+{
+    hash256 cp=*sh;
+    HASH256_hash(&cp,digest);
+}
+
+
+#define H0_512 0x6a09e667f3bcc908
+#define H1_512 0xbb67ae8584caa73b
+#define H2_512 0x3c6ef372fe94f82b
+#define H3_512 0xa54ff53a5f1d36f1
+#define H4_512 0x510e527fade682d1
+#define H5_512 0x9b05688c2b3e6c1f
+#define H6_512 0x1f83d9abfb41bd6b
+#define H7_512 0x5be0cd19137e2179
+
+#define H8_512 0xcbbb9d5dc1059ed8
+#define H9_512 0x629a292a367cd507
+#define HA_512 0x9159015a3070dd17
+#define HB_512 0x152fecd8f70e5939
+#define HC_512 0x67332667ffc00b31
+#define HD_512 0x8eb44a8768581511
+#define HE_512 0xdb0c2e0d64f98fa7
+#define HF_512 0x47b5481dbefa4fa4
+
+/* */
+
+static const unsign64 K_512[80] =
+{
+    0x428a2f98d728ae22 , 0x7137449123ef65cd , 0xb5c0fbcfec4d3b2f , 0xe9b5dba58189dbbc ,
+    0x3956c25bf348b538 , 0x59f111f1b605d019 , 0x923f82a4af194f9b , 0xab1c5ed5da6d8118 ,
+    0xd807aa98a3030242 , 0x12835b0145706fbe , 0x243185be4ee4b28c , 0x550c7dc3d5ffb4e2 ,
+    0x72be5d74f27b896f , 0x80deb1fe3b1696b1 , 0x9bdc06a725c71235 , 0xc19bf174cf692694 ,
+    0xe49b69c19ef14ad2 , 0xefbe4786384f25e3 , 0x0fc19dc68b8cd5b5 , 0x240ca1cc77ac9c65 ,
+    0x2de92c6f592b0275 , 0x4a7484aa6ea6e483 , 0x5cb0a9dcbd41fbd4 , 0x76f988da831153b5 ,
+    0x983e5152ee66dfab , 0xa831c66d2db43210 , 0xb00327c898fb213f , 0xbf597fc7beef0ee4 ,
+    0xc6e00bf33da88fc2 , 0xd5a79147930aa725 , 0x06ca6351e003826f , 0x142929670a0e6e70 ,
+    0x27b70a8546d22ffc , 0x2e1b21385c26c926 , 0x4d2c6dfc5ac42aed , 0x53380d139d95b3df ,
+    0x650a73548baf63de , 0x766a0abb3c77b2a8 , 0x81c2c92e47edaee6 , 0x92722c851482353b ,
+    0xa2bfe8a14cf10364 , 0xa81a664bbc423001 , 0xc24b8b70d0f89791 , 0xc76c51a30654be30 ,
+    0xd192e819d6ef5218 , 0xd69906245565a910 , 0xf40e35855771202a , 0x106aa07032bbd1b8 ,
+    0x19a4c116b8d2d0c8 , 0x1e376c085141ab53 , 0x2748774cdf8eeb99 , 0x34b0bcb5e19b48a8 ,
+    0x391c0cb3c5c95a63 , 0x4ed8aa4ae3418acb , 0x5b9cca4f7763e373 , 0x682e6ff3d6b2b8a3 ,
+    0x748f82ee5defb2fc , 0x78a5636f43172f60 , 0x84c87814a1f0ab72 , 0x8cc702081a6439ec ,
+    0x90befffa23631e28 , 0xa4506cebde82bde9 , 0xbef9a3f7b2c67915 , 0xc67178f2e372532b ,
+    0xca273eceea26619c , 0xd186b8c721c0c207 , 0xeada7dd6cde0eb1e , 0xf57d4f7fee6ed178 ,
+    0x06f067aa72176fba , 0x0a637dc5a2c898a6 , 0x113f9804bef90dae , 0x1b710b35131c471b ,
+    0x28db77f523047d84 , 0x32caab7b40c72493 , 0x3c9ebe0a15c9bebc , 0x431d67c49c100d4c ,
+    0x4cc5d4becb3e42b6 , 0x597f299cfc657e2a , 0x5fcb6fab3ad6faec , 0x6c44198c4a475817
+};
+
+static void HASH512_transform(hash512 *sh)
+{
+    /* basic transformation step */
+    unsign64 a, b, c, d, e, f, g, h, t1, t2;
+    int j;
+    for (j = 16; j < 80; j++)
+        sh->w[j] = theta1_512(sh->w[j - 2]) + sh->w[j - 7] + theta0_512(sh->w[j - 15]) + sh->w[j - 16];
+
+    a = sh->h[0];
+    b = sh->h[1];
+    c = sh->h[2];
+    d = sh->h[3];
+    e = sh->h[4];
+    f = sh->h[5];
+    g = sh->h[6];
+    h = sh->h[7];
+
+    for (j = 0; j < 80; j++)
+    {
+        /* 80 times - mush it up */
+        t1 = h + Sig1_512(e) + Ch(e, f, g) + K_512[j] + sh->w[j];
+        t2 = Sig0_512(a) + Maj(a, b, c);
+        h = g;
+        g = f;
+        f = e;
+        e = d + t1;
+        d = c;
+        c = b;
+        b = a;
+        a = t1 + t2;
+    }
+    sh->h[0] += a;
+    sh->h[1] += b;
+    sh->h[2] += c;
+    sh->h[3] += d;
+    sh->h[4] += e;
+    sh->h[5] += f;
+    sh->h[6] += g;
+    sh->h[7] += h;
+}
+
+void core::HASH384_init(hash384 *sh)
+{
+    /* re-initialise */
+    int i;
+    for (i = 0; i < 80; i++) sh->w[i] = 0;
+    sh->length[0] = sh->length[1] = 0;
+    sh->h[0] = H8_512;
+    sh->h[1] = H9_512;
+    sh->h[2] = HA_512;
+    sh->h[3] = HB_512;
+    sh->h[4] = HC_512;
+    sh->h[5] = HD_512;
+    sh->h[6] = HE_512;
+    sh->h[7] = HF_512;
+
+    sh->hlen = 48;
+}
+
+void core::HASH384_process(hash384 *sh, int byt)
+{
+    /* process the next message byte */
+    HASH512_process(sh, byt);
+}
+
+void core::HASH384_hash(hash384 *sh, char *digest)
+{
+    /* pad message and finish - supply digest */
+    HASH512_hash(sh, digest);
+}
+
+/* return intermediate hash */
+void core::HASH384_continuing_hash(hash384 *sh,char *digest)
+{
+    hash384 cp=*sh;
+    HASH384_hash(&cp,digest);
+}
+
+void core::HASH512_init(hash512 *sh)
+{
+    /* re-initialise */
+    int i;
+
+    for (i = 0; i < 80; i++) sh->w[i] = 0;
+    sh->length[0] = sh->length[1] = 0;
+    sh->h[0] = H0_512;
+    sh->h[1] = H1_512;
+    sh->h[2] = H2_512;
+    sh->h[3] = H3_512;
+    sh->h[4] = H4_512;
+    sh->h[5] = H5_512;
+    sh->h[6] = H6_512;
+    sh->h[7] = H7_512;
+
+    sh->hlen = 64;
+}
+
+void core::HASH512_process(hash512 *sh, int byt)
+{
+    /* process the next message byte */
+    int cnt;
+
+    cnt = (int)((sh->length[0] / 64) % 16);
+
+    sh->w[cnt] <<= 8;
+    sh->w[cnt] |= (unsign64)(byt & 0xFF);
+
+    sh->length[0] += 8;
+    if (sh->length[0] == 0L)
+    {
+        sh->length[1]++;
+        sh->length[0] = 0L;
+    }
+    if ((sh->length[0] % 1024) == 0) HASH512_transform(sh);
+}
+
+void core::HASH512_hash(hash512 *sh, char *digest)
+{
+    /* pad message and finish - supply digest */
+    int i;
+    unsign64 len0, len1;
+    len0 = sh->length[0];
+    len1 = sh->length[1];
+    HASH512_process(sh, PAD);
+    while ((sh->length[0] % 1024) != 896) HASH512_process(sh, ZERO);
+    sh->w[14] = len1;
+    sh->w[15] = len0;
+    HASH512_transform(sh);
+    for (i = 0; i < sh->hlen; i++)
+    {
+        /* convert to bytes */
+        digest[i] = (char)((sh->h[i / 8] >> (8 * (7 - i % 8))) & 0xffL);
+    }
+    HASH512_init(sh);
+}
+
+/* return intermediate hash */
+void core::HASH512_continuing_hash(hash512 *sh,char *digest)
+{
+    hash512 cp=*sh;
+    HASH512_hash(&cp,digest);
+}
+
+/* SHA3 */
+
+#define SHA3_ROUNDS 24
+#define rotl(x,n) (((x)<<n) | ((x)>>(64-n)))
+
+/* round constants */
+
+static const unsign64 RC[24] = {
+    0x0000000000000001UL, 0x0000000000008082UL, 0x800000000000808AUL, 0x8000000080008000UL,
+    0x000000000000808BUL, 0x0000000080000001UL, 0x8000000080008081UL, 0x8000000000008009UL,
+    0x000000000000008AUL, 0x0000000000000088UL, 0x0000000080008009UL, 0x000000008000000AUL,
+    0x000000008000808BUL, 0x800000000000008BUL, 0x8000000000008089UL, 0x8000000000008003UL,
+    0x8000000000008002UL, 0x8000000000000080UL, 0x000000000000800AUL, 0x800000008000000AUL,
+    0x8000000080008081UL, 0x8000000000008080UL, 0x0000000080000001UL, 0x8000000080008008UL
+};
+
+static void SHA3_transform(sha3 *sh)
+{
+    int k;
+    unsign64 B00,B01,B02,B03,B04,B10,B11,B12,B13,B14,B20,B21,B22,B23,B24,B30,B31,B32,B33,B34,B40,B41,B42,B43,B44;
+    unsign64 C0,C1,C2,C3,C4,D0,D1,D2,D3,D4;
+
+    for (k = 0; k < SHA3_ROUNDS; k++)
+    {
+
+        C0=sh->S[0] ^ sh->S[5] ^ sh->S[10] ^ sh->S[15] ^ sh->S[20];
+        C1=sh->S[1] ^ sh->S[6] ^ sh->S[11] ^ sh->S[16] ^ sh->S[21];
+        C2=sh->S[2] ^ sh->S[7] ^ sh->S[12] ^ sh->S[17] ^ sh->S[22];
+        C3=sh->S[3] ^ sh->S[8] ^ sh->S[13] ^ sh->S[18] ^ sh->S[23];
+        C4=sh->S[4] ^ sh->S[9] ^ sh->S[14] ^ sh->S[19] ^ sh->S[24];
+
+        D0 = C4 ^ rotl(C1, 1);
+        D1 = C0 ^ rotl(C2, 1);
+        D2 = C1 ^ rotl(C3, 1);
+        D3 = C2 ^ rotl(C4, 1);
+        D4 = C3 ^ rotl(C0, 1);
+
+        B00 =      sh->S[0]^D0;
+        B02 = rotl(sh->S[1]^D1, 1);
+        B04 = rotl(sh->S[2]^D2, 62);
+        B01 = rotl(sh->S[3]^D3, 28);
+        B03 = rotl(sh->S[4]^D4, 27);
+
+        B13 = rotl(sh->S[5]^D0, 36);
+        B10 = rotl(sh->S[6]^D1, 44);
+        B12 = rotl(sh->S[7]^D2, 6);
+        B14 = rotl(sh->S[8]^D3, 55);
+        B11 = rotl(sh->S[9]^D4, 20);
+
+        B21 = rotl(sh->S[10]^D0, 3);
+        B23 = rotl(sh->S[11]^D1, 10);
+        B20 = rotl(sh->S[12]^D2, 43);
+        B22 = rotl(sh->S[13]^D3, 25);
+        B24 = rotl(sh->S[14]^D4, 39);
+
+        B34 = rotl(sh->S[15]^D0, 41);
+        B31 = rotl(sh->S[16]^D1, 45);
+        B33 = rotl(sh->S[17]^D2, 15);
+        B30 = rotl(sh->S[18]^D3, 21);
+        B32 = rotl(sh->S[19]^D4, 8);
+
+        B42 = rotl(sh->S[20]^D0, 18);
+        B44 = rotl(sh->S[21]^D1, 2);
+        B41 = rotl(sh->S[22]^D2, 61);
+        B43 = rotl(sh->S[23]^D3, 56);
+        B40 = rotl(sh->S[24]^D4, 14);    
+
+        sh->S[0]=B00^(~B10&B20);
+        sh->S[1]=B10^(~B20&B30);
+        sh->S[2]=B20^(~B30&B40);
+        sh->S[3]=B30^(~B40&B00);
+        sh->S[4]=B40^(~B00&B10);
+
+        sh->S[5]=B01^(~B11&B21);
+        sh->S[6]=B11^(~B21&B31);
+        sh->S[7]=B21^(~B31&B41);
+        sh->S[8]=B31^(~B41&B01);
+        sh->S[9]=B41^(~B01&B11);
+
+        sh->S[10]=B02^(~B12&B22);
+        sh->S[11]=B12^(~B22&B32);
+        sh->S[12]=B22^(~B32&B42);
+        sh->S[13]=B32^(~B42&B02);
+        sh->S[14]=B42^(~B02&B12);
+
+        sh->S[15]=B03^(~B13&B23);
+        sh->S[16]=B13^(~B23&B33);
+        sh->S[17]=B23^(~B33&B43);
+        sh->S[18]=B33^(~B43&B03);
+        sh->S[19]=B43^(~B03&B13);
+
+        sh->S[20]=B04^(~B14&B24);
+        sh->S[21]=B14^(~B24&B34);
+        sh->S[22]=B24^(~B34&B44);
+        sh->S[23]=B34^(~B44&B04);
+        sh->S[24]=B44^(~B04&B14);
+
+        sh->S[0] ^= RC[k];
+    }
+}
+
+/* Re-Initialize. olen is output length in bytes -
+   should be 28, 32, 48 or 64 (224, 256, 384, 512 bits resp.) */
+
+void core::SHA3_init(sha3 *sh, int olen)
+{
+    int i;
+    for (i = 0; i < 25; i++)
+        sh->S[i] = 0;           /* 5x5x8 bytes = 200 bytes of state */
+
+    sh->length = 0;
+    sh->len = olen;
+    sh->rate = 200 - 2 * olen; /* number of bytes consumed in one gulp. Note that some bytes in the
+                            state ("capacity") are not touched. Gulps are smaller for larger digests.
+                            Important that olen<rate */
+}
+
+/* process a single byte */
+void core::SHA3_process(sha3 *sh, int byt)
+{
+    int cnt = (int)(sh->length);
+    int b = cnt % 8;
+    cnt /= 8;
+    sh->S[cnt] ^= ((unsign64)(byt & 0xff) << (8 * b));
+    sh->length++;
+    if (sh->length == sh->rate)
+    {
+        sh->length=0;
+        SHA3_transform(sh);
+    }
+}
+
+/* squeeze the sponge */
+void core::SHA3_squeeze(sha3 *sh, char *buff, int len)
+{
+    int i, j, k, m = 0;
+    unsign64 el;
+    int nb=len/sh->rate;
+// squeeze out full blocks
+    for (j=0;j<nb;j++ )
+    {
+        for (i=0;i<sh->rate/8;i++)
+        {
+            el=sh->S[i];
+            for (k=0;k<8;k++)
+            {
+               buff[m++] = (el & 0xff);
+               el >>= 8;
+            }
+        }
+        SHA3_transform(sh);    
+    }
+   
+// squeeze out whats left
+    i=0;
+    while (m<len)
+    {
+        el = sh->S[i++];
+        for (k = 0; k < 8; k++)
+        {
+            buff[m++] = (el & 0xff);
+            if (m >= len) break;
+            el >>= 8;
+        }    
+    } 
+}
+
+void core::SHA3_hash(sha3 *sh, char *digest)
+{   /* generate a SHA3 hash of appropriate size */
+    int q = sh->rate - sh->length;
+    if (q == 1) SHA3_process(sh, 0x86);
+    else
+    {
+        SHA3_process(sh, 0x06);  /* 0x06 for SHA-3 */
+        while (sh->length != sh->rate - 1) SHA3_process(sh, 0x00);
+        SHA3_process(sh, 0x80); /* this will force a final transform */
+    }
+    SHA3_squeeze(sh, digest, sh->len);
+}
+
+/* return intermediate hash */
+void core::SHA3_continuing_hash(sha3 *sh,char *digest)
+{
+    sha3 cp=*sh;
+    SHA3_hash(&cp,digest);
+}
+
+void core::SHA3_shake(sha3 *sh, char *digest, int len)
+{   /* SHAKE out a buffer of variable length len */
+    int q = sh->rate - sh->length;
+    if (q == 1) SHA3_process(sh, 0x9f);
+    else
+    {
+        SHA3_process(sh, 0x1f);  // 0x06 for SHA-3 !!!!
+        while (sh->length != sh->rate - 1) SHA3_process(sh, 0x00);
+        SHA3_process(sh, 0x80); /* this will force a final transform */
+    }
+    SHA3_squeeze(sh, digest, len);
+}
+
+/* return intermediate hash */
+void core::SHA3_continuing_shake(sha3 *sh,char *digest,int len)
+{
+    sha3 cp=*sh;
+    SHA3_shake(&cp,digest,len);
+}
+
+/* test program: should produce digest
+
+160 bit
+
+84983e44 1c3bd26e baae4aa1 f95129e5 e54670f1
+
+256 bit
+
+248d6a61 d20638b8 e5c02693 0c3e6039 a33ce459 64ff2167 f6ecedd4 19db06c1
+
+512 bit
+
+8e959b75dae313da 8cf4f72814fc143f 8f7779c6eb9f7fa1 7299aeadb6889018
+501d289e4900f7e4 331b99dec4b5433a c7d329eeb6dd2654 5e96e55b874be909
+
+384 bit
+
+09330c33f71147e8 3d192fc782cd1b47 53111b173b3b05d2 2fa08086e3b0f712
+fcc7c71a557e2db9 66c3e9fa91746039
+*/
+/*
+#include <stdio.h>
+
+char test160[]="abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq";
+char test256[]="abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq";
+char test512[]="abcdefghbcdefghicdefghijdefghijkefghijklfghijklmghijklmnhijklmnoijklmnopjklmnopqklmnopqrlmnopqrsmnopqrstnopqrstu";
+
+int main()
+{
+    char digest[100];
+    int i;
+
+    hash256 sh256;
+    hash384 sh384;
+    hash512 sh512;
+    sha3 SHA3;
+
+    HASH256_init(&sh256);
+    for (i=0;test256[i]!=0;i++) HASH256_process(&sh256,test256[i]);
+    HASH256_hash(&sh256,digest);
+    for (i=0;i<32;i++) printf("%02x",(unsigned char)digest[i]);
+    printf("\n");
+
+    HASH384_init(&sh384);
+    for (i=0;test512[i]!=0;i++) HASH384_process(&sh384,test512[i]);
+    HASH384_hash(&sh384,digest);
+    for (i=0;i<48;i++) printf("%02x",(unsigned char)digest[i]);
+    printf("\n");
+
+    HASH512_init(&sh512);
+    for (i=0;test512[i]!=0;i++) HASH512_process(&sh512,test512[i]);
+    HASH512_hash(&sh512,digest);
+    for (i=0;i<64;i++) printf("%02x",(unsigned char)digest[i]);
+    printf("\n");
+
+    SHA3_init(&SHA3,SHA3_HASH256);
+    for (i=0;test512[i]!=0;i++) SHA3_process(&SHA3,test512[i]);
+    SHA3_hash(&SHA3,digest);
+    for (i=0;i<32;i++) printf("%02x",(unsigned char)digest[i]);
+    printf("\n");
+
+    SHA3_init(&SHA3,SHA3_HASH512);
+    for (i=0;test512[i]!=0;i++) SHA3_process(&SHA3,test512[i]);
+    SHA3_hash(&SHA3,digest);
+    for (i=0;i<64;i++) printf("%02x",(unsigned char)digest[i]);
+    printf("\n");
+
+    SHA3_init(&SHA3,SHAKE256);
+    for (i=0;test512[i]!=0;i++) SHA3_process(&SHA3,test512[i]);
+    SHA3_shake(&SHA3,digest,72);
+    for (i=0;i<72;i++) printf("%02x",(unsigned char)digest[i]);
+    printf("\n");
+
+
+    return 0;
+}
+
+*/
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hmac.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hmac.cpp
new file mode 100644
index 0000000..37d221d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hmac.cpp
@@ -0,0 +1,701 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/*
+    HMAC functions
+*/
+
+#include "arch.h"
+#include "core.h"
+
+using namespace core;
+
+#define ROUNDUP(a,b) ((a)-1)/(b)+1
+#define CEIL(a,b) (((a)-1)/(b)+1)
+
+/* General Purpose hash function, padding with zeros, optional input octets p and x, optional integer n,hash to octet w of length olen */
+/* hash is the Hash family, either MC_SHA2 or MC_SHA3 */
+/* hlen should be 32,48 or 64 for MC_SHA2 (that is SHA256/384/512) */
+/* hlen should be 24,32,48,64 for MC_SHA3 */
+/* olen=0 -     output = hlen bytes */
+/* olen<=hlen -  output = olen bytes */
+/* olen>hlen  -  output is padded with leading zeros and then hlen bytes */
+
+void core::GPhash(int hash,int hlen,octet *w,int olen,int pad,octet *p,int n,octet *x)
+{
+    hash256 sh256;
+    hash384 sh384;
+    hash512 sh512;
+    sha3 sh3;
+    int i,c[4];
+    char hh[64];
+
+    if (n>=0)
+    {
+        c[0] = (n >> 24) & 0xff;
+        c[1] = (n >> 16) & 0xff;
+        c[2] = (n >> 8) & 0xff;
+        c[3] = (n) & 0xff;
+    }
+
+    switch (hash)
+    {
+    case MC_SHA2 :
+        switch (hlen)
+        {
+        case SHA256 :
+            HASH256_init(&sh256);
+            for (i=0;i<pad;i++) HASH256_process(&sh256,0);
+            if (p!=NULL)
+                for (i=0;i<p->len;i++) HASH256_process(&sh256,p->val[i]);
+            if (n>=0)
+                for (i=0;i<4;i++) HASH256_process(&sh256,c[i]);
+            if (x!=NULL)
+                for (i=0;i<x->len;i++) HASH256_process(&sh256,x->val[i]);
+            HASH256_hash(&sh256,hh);
+            break;
+        case SHA384 :
+            HASH384_init(&sh384);
+            for (i=0;i<pad;i++) HASH384_process(&sh384,0);
+            if (p!=NULL)
+                for (i=0;i<p->len;i++) HASH384_process(&sh384,p->val[i]);
+            if (n>=0)
+                for (i=0;i<4;i++) HASH384_process(&sh384,c[i]);
+            if (x!=NULL)
+                for (i=0;i<x->len;i++) HASH384_process(&sh384,x->val[i]);
+            HASH384_hash(&sh384,hh);
+            break;
+        case SHA512 :
+            HASH512_init(&sh512);
+            for (i=0;i<pad;i++) HASH512_process(&sh512,0);
+            if (p!=NULL)
+                for (i=0;i<p->len;i++) HASH512_process(&sh512,p->val[i]);
+            if (n>=0)
+                for (i=0;i<4;i++) HASH512_process(&sh512,c[i]);
+            if (x!=NULL)
+                for (i=0;i<x->len;i++) HASH512_process(&sh512,x->val[i]);
+            HASH512_hash(&sh512,hh);   
+            break;
+        }
+        break;
+    case MC_SHA3 :
+        SHA3_init(&sh3,hlen);
+        for (i=0;i<pad;i++) SHA3_process(&sh3,0);
+        if (p!=NULL)
+            for (i=0;p->len;i++) SHA3_process(&sh3,p->val[i]);
+        if (n>=0)
+            for (i=0;i<4;i++) SHA3_process(&sh3,c[i]);
+        if (x!=NULL)
+            for (i=0;x->len;i++) SHA3_process(&sh3,x->val[i]);
+        SHA3_hash(&sh3,hh);  
+        break;
+    default: return;
+    }
+    OCT_empty(w);
+    if (!olen)
+        OCT_jbytes(w,hh,hlen);
+    else
+    {
+        if (olen<=hlen)
+        {
+            OCT_jbytes(w,hh,olen);
+        } else {
+            OCT_jbyte(w, 0, olen - hlen);
+            OCT_jbytes(w, hh, hlen);
+        }
+    }
+}
+
+/* Simple hash octet p to octet w of length hlen */
+void core::SPhash(int hash, int hlen,octet *w, octet *p)
+{
+    GPhash(hash, hlen, w, 0, 0, p, -1, NULL);
+}
+
+static int blksize(int hash,int hlen)
+{
+    int blk=0;
+    switch (hash)
+    {
+    case MC_SHA2 :
+            blk=64;
+            if (hlen>32) blk=128;
+            break;
+    case MC_SHA3 :
+            blk=200-2*hlen;
+            break;
+    default: break;
+    }
+    return blk;
+}
+
+
+/* RFC 2104 */
+void core::HMAC(int hash,int hlen,octet *TAG,int olen,octet *K,octet *M)
+{
+    int blk;
+    char h[128],k0[200];   // assumes max block sizes
+    octet K0 = {0, sizeof(k0), k0};
+    octet H={0,sizeof(h),h};
+
+    blk=blksize(hash,hlen);
+    if (blk==0) return;
+
+    if (K->len > blk) SPhash(hash,hlen,&K0,K);
+    else              OCT_copy(&K0,K);
+
+    OCT_jbyte(&K0,0,blk-K0.len); 
+
+    OCT_xorbyte(&K0,0x36);
+
+
+    GPhash(hash,hlen,&H,0,0,&K0,-1,M); 
+
+    OCT_xorbyte(&K0,0x6a);   /* 0x6a = 0x36 ^ 0x5c */
+    GPhash(hash,hlen,&H,0,0,&K0,-1,&H);
+
+    OCT_empty(TAG);
+    OCT_jbytes(TAG,H.val,olen);
+
+    OCT_clear(&H);
+    OCT_clear(&K0);
+}
+
+/* RFC 5869 */
+
+void core::HKDF_Extract(int hash,int hlen,octet *PRK,octet *SALT,octet *IKM)
+{
+    char h[64];
+    octet H={0,sizeof(h),h};
+    if (SALT==NULL) {
+        OCT_jbyte(&H,0,hlen);
+        HMAC(hash,hlen,PRK,hlen,&H,IKM);
+    } else {
+        HMAC(hash,hlen,PRK,hlen,SALT,IKM);
+    }
+}
+
+void core::HKDF_Expand(int hash,int hlen,octet *OKM,int olen,octet *PRK,octet *INFO)
+{
+    int i;
+    char t[1024];  // >= info.length+hlen+1
+    octet T={0,sizeof(t),t};
+    int n=olen/hlen; 
+    int flen=olen%hlen;
+    OCT_empty(OKM);
+
+    for (i=1;i<=n;i++)
+    {
+        OCT_joctet(&T,INFO);
+        OCT_jbyte(&T,i,1);
+        HMAC(hash,hlen,&T,hlen,PRK,&T);
+        OCT_joctet(OKM,&T);
+    }
+    if (flen>0)
+    {
+        OCT_joctet(&T,INFO);
+        OCT_jbyte(&T,n+1,1);
+        HMAC(hash,hlen,&T,flen,PRK,&T);
+        OCT_joctet(OKM,&T);
+    }
+}
+
+/* https://datatracker.ietf.org/doc/draft-irtf-cfrg-hash-to-curve/ */
+
+void core::XOF_Expand(int hlen,octet *OKM,int olen,octet *DST,octet *M)
+{
+    int i;
+    sha3 SHA3;
+    SHA3_init(&SHA3,hlen);
+    for (i=0;i<M->len;i++) SHA3_process(&SHA3,M->val[i]);
+    SHA3_process(&SHA3,olen/256);
+    SHA3_process(&SHA3,olen%256);
+
+    for (i=0;i<DST->len;i++)
+        SHA3_process(&SHA3,DST->val[i]);
+    SHA3_process(&SHA3,DST->len);
+
+    SHA3_shake(&SHA3,OKM->val,olen);
+    OKM->len=olen;
+}
+
+static void XMD_Expand_Short_DST(int hash, int hlen,octet *OKM,int olen,octet *DST,octet *M)
+{
+    int i,blk;
+    int ell=CEIL(olen,hlen);
+    char tmp[260]; 
+    octet TMP={0,sizeof(tmp),tmp};
+    char h0[64];
+    octet H0 = {0, sizeof(h0), h0};
+    char h1[64];
+    octet H1 = {0, sizeof(h1), h1};
+
+    blk=blksize(hash,hlen);
+    OCT_jint(&TMP,olen,2);
+    OCT_jint(&TMP,0,1);
+    OCT_joctet(&TMP,DST);
+    OCT_jint(&TMP,DST->len,1);
+
+    GPhash(hash,hlen,&H0,0,blk,M,-1,&TMP);
+    OCT_empty(&TMP);
+    OCT_jint(&TMP,1,1);
+    OCT_joctet(&TMP,DST);
+    OCT_jint(&TMP,DST->len,1);
+
+    GPhash(hash,hlen,&H1,0,0,&H0,-1,&TMP);
+    OCT_empty(OKM);
+    OCT_joctet(OKM,&H1);
+    for (i=2;i<=ell;i++)
+    {
+        OCT_xor(&H1,&H0);
+        OCT_empty(&TMP);
+        OCT_jint(&TMP,i,1);
+        OCT_joctet(&TMP,DST);
+        OCT_jint(&TMP,DST->len,1);
+        GPhash(hash,hlen,&H1,0,0,&H1,-1,&TMP);
+        OCT_joctet(OKM,&H1);
+    }
+    OKM->len=olen; 
+}
+
+void core::XMD_Expand(int hash, int hlen,octet *OKM,int olen,octet *DST,octet *M)
+{
+    char w[64];
+    octet W = {0, sizeof(w), w};
+    char os[20];
+    octet OS={0,sizeof(os),os};
+    OCT_jstring(&OS,(char *)"H2C-OVERSIZE-DST-");
+    if (DST->len>=256)
+    {
+        GPhash(hash,hlen,&W,0,0,&OS,-1,DST);
+        XMD_Expand_Short_DST(hash,hlen,OKM,olen,&W,M);
+    } else {
+        XMD_Expand_Short_DST(hash,hlen,OKM,olen,DST,M);
+    }
+}
+
+/* Key Derivation Function */
+
+void core::KDF2(int hash, int hlen, octet *key, int olen, octet *z, octet *p)
+{
+    /* NOTE: the parameter olen is the length of the output k in bytes */
+    char h[64];
+    octet H = {0, sizeof(h), h};
+    int counter, cthreshold;
+
+    OCT_empty(key);
+
+    cthreshold = ROUNDUP(olen, hlen);
+
+    for (counter = 1; counter <= cthreshold; counter++)
+    {
+        GPhash(hash,hlen, &H, 0, 0, z, counter, p);
+        if (key->len + hlen > olen)  OCT_jbytes(key, H.val, olen % hlen);
+        else                     OCT_joctet(key, &H);
+    }
+
+}
+
+/* Password based Key Derivation Function */
+/* Input password p, salt s, and repeat count */
+/* Output key of length olen */
+void core::PBKDF2(int hash, int hlen, octet *key, int olen, octet *p, octet *s, int rep)
+{
+    int i, j, len, d = ROUNDUP(olen, hlen);
+    char f[64], u[64];
+    octet F = {0, sizeof(f), f};
+    octet U = {0, sizeof(u), u};
+    OCT_empty(key);
+
+    for (i = 1; i <= d; i++)
+    {
+        len = s->len;
+        OCT_jint(s, i, 4);
+
+        HMAC(hash, hlen, &F, hlen, s, p);
+
+        s->len = len;
+        OCT_copy(&U, &F);
+        for (j = 2; j <= rep; j++)
+        {
+            HMAC(hash, hlen, &U, hlen, &U, p);
+            OCT_xor(&F, &U);
+        }
+
+        OCT_joctet(key, &F);
+    }
+
+    OCT_chop(key, NULL, olen);
+}
+
+/* RSA Auxiliary Functions */
+
+#define MAX_RSA_BYTES 512 /**< Maximum of 4096 */
+
+/* Mask Generation Function */
+
+static void MGF1(int sha, octet *z, int olen, octet *mask)
+{
+    char h[64];
+    octet H = {0, sizeof(h), h};
+    int hlen = sha;
+    int counter, cthreshold;
+
+    OCT_empty(mask);
+
+    cthreshold = ROUNDUP(olen, hlen);
+    for (counter = 0; counter < cthreshold; counter++)
+    {
+        GPhash(MC_SHA2,sha,&H,0,0,z,counter,NULL);
+        //hashit(sha, z, counter, &H);
+        if (mask->len + hlen > olen) OCT_jbytes(mask, H.val, olen % hlen);
+        else                     OCT_joctet(mask, &H);
+    }
+    OCT_clear(&H);
+}
+
+/* MGF1 plus masking */
+static void MGF1XOR(int sha, octet *z, octet *w)
+{
+    char h[64];
+    octet H = {0, sizeof(h), h};
+    int i,len,wlen,hlen = sha;
+    int counter, cthreshold;
+
+    wlen=0;
+    cthreshold = ROUNDUP(w->len, hlen);
+    for (counter = 0; counter < cthreshold; counter++)
+    {
+        GPhash(MC_SHA2,sha,&H,0,0,z,counter,NULL);
+        if (wlen+hlen <= w->len)
+            len=hlen;
+        else 
+            len=w->len%hlen;
+  
+        for (i=0;i<len;i++)
+            w->val[wlen+i]^=H.val[i];
+        wlen+=len;
+    }      
+    OCT_clear(&H);
+}
+
+
+/* SHAXXX identifier strings */
+const unsigned char SHA256ID[] = {0x30, 0x31, 0x30, 0x0d, 0x06, 0x09, 0x60, 0x86, 0x48, 0x01, 0x65, 0x03, 0x04, 0x02, 0x01, 0x05, 0x00, 0x04, 0x20};
+const unsigned char SHA384ID[] = {0x30, 0x41, 0x30, 0x0d, 0x06, 0x09, 0x60, 0x86, 0x48, 0x01, 0x65, 0x03, 0x04, 0x02, 0x02, 0x05, 0x00, 0x04, 0x30};
+const unsigned char SHA512ID[] = {0x30, 0x51, 0x30, 0x0d, 0x06, 0x09, 0x60, 0x86, 0x48, 0x01, 0x65, 0x03, 0x04, 0x02, 0x03, 0x05, 0x00, 0x04, 0x40};
+
+/* PKCS 1.5 padding of a message to be signed */
+
+int core::PKCS15(int sha, octet *m, octet *w)
+{
+    int olen = w->max;
+    int hlen = sha;
+    int idlen = 19;
+    char h[64];
+    octet H = {0, sizeof(h), h};
+
+    if (olen < idlen + hlen + 10) return 0;
+    GPhash(MC_SHA2,sha,&H,0,0,m,-1,NULL);
+
+    OCT_empty(w);
+    OCT_jbyte(w, 0x00, 1);
+    OCT_jbyte(w, 0x01, 1);
+    OCT_jbyte(w, 0xff, olen - idlen - hlen - 3);
+    OCT_jbyte(w, 0x00, 1);
+
+    if (hlen == 32) OCT_jbytes(w, (char *)SHA256ID, idlen);
+    if (hlen == 48) OCT_jbytes(w, (char *)SHA384ID, idlen);
+    if (hlen == 64) OCT_jbytes(w, (char *)SHA512ID, idlen);
+
+    OCT_joctet(w, &H);
+
+    return 1;
+}
+
+/* Alternate form, without the NULL 0500 */
+
+/* SHAXXX identifier strings */
+const unsigned char SHA256IDb[] = {0x30, 0x2f, 0x30, 0x0b, 0x06, 0x09, 0x60, 0x86, 0x48, 0x01, 0x65, 0x03, 0x04, 0x02, 0x01, 0x04, 0x20};
+const unsigned char SHA384IDb[] = {0x30, 0x3f, 0x30, 0x0b, 0x06, 0x09, 0x60, 0x86, 0x48, 0x01, 0x65, 0x03, 0x04, 0x02, 0x02, 0x04, 0x30};
+const unsigned char SHA512IDb[] = {0x30, 0x4f, 0x30, 0x0b, 0x06, 0x09, 0x60, 0x86, 0x48, 0x01, 0x65, 0x03, 0x04, 0x02, 0x03, 0x04, 0x40};
+
+/* PKCS 1.5 padding of a message to be signed */
+
+int core::PKCS15b(int sha, octet *m, octet *w)
+{
+    int olen = w->max;
+    int hlen = sha;
+    int idlen = 17;
+    char h[64];
+    octet H = {0, sizeof(h), h};
+
+    if (olen < idlen + hlen + 10) return 0;
+    GPhash(MC_SHA2,sha,&H,0,0,m,-1,NULL);
+
+    OCT_empty(w);
+    OCT_jbyte(w, 0x00, 1);
+    OCT_jbyte(w, 0x01, 1);
+    OCT_jbyte(w, 0xff, olen - idlen - hlen - 3);
+    OCT_jbyte(w, 0x00, 1);
+
+    if (hlen == 32) OCT_jbytes(w, (char *)SHA256IDb, idlen);
+    if (hlen == 48) OCT_jbytes(w, (char *)SHA384IDb, idlen);
+    if (hlen == 64) OCT_jbytes(w, (char *)SHA512IDb, idlen);
+
+    OCT_joctet(w, &H);
+
+    return 1;
+}
+
+/* PSS Encoding of message to be signed. Salt is hlen */
+
+int core::PSS_ENCODE(int sha, octet *m, csprng *RNG, octet *w)
+{ 
+    unsigned char mask;
+    char h[64];
+    octet H = {0, sizeof(h), h};
+    char md[136];
+    octet MD={0,sizeof(md),md};
+    char  salt[64];
+    octet SALT={0,sizeof(salt),salt};
+    int hlen=sha;
+    int emlen=w->max;
+    int embits=8*emlen-1;
+
+    OCT_rand(&SALT, RNG, hlen);  
+
+    mask=(0xff)>>(8*emlen-embits);
+
+    GPhash(MC_SHA2,sha,&H,0,0,m,-1,NULL);
+    if (emlen < hlen + hlen +  2) return 0; 
+
+    OCT_jbyte(&MD,0,8);
+    OCT_joctet(&MD,&H);
+    OCT_joctet(&MD,&SALT);
+
+    GPhash(MC_SHA2,sha,&H,0,0,&MD,-1,NULL);
+    OCT_clear(w);
+    OCT_jbyte(w,0,emlen-hlen-hlen-2);
+    OCT_jbyte(w,0x01,1);
+    OCT_joctet(w,&SALT);
+    MGF1XOR(sha,&H,w);
+    w->val[0]&=mask;
+
+    OCT_joctet(w,&H);
+    OCT_jbyte(w,0xbc,1);
+
+    return 1;
+}
+
+int core::PSS_VERIFY(int sha, octet *m,octet *w)
+{
+    int i,k;
+    unsigned char mask;
+    char hmask[64];
+    octet HMASK = {0, sizeof(hmask), hmask};
+    char h[64];
+    octet H = {0, sizeof(h), h};
+    char db[MAX_RSA_BYTES];
+    octet DB = {0, sizeof(db), db};
+    char salt[64];
+    octet SALT={0,sizeof(salt),salt};
+    int hlen=sha;
+    int emlen=w->len;
+    int embits=8*emlen-1;
+
+    mask=(0xff)>>(8*emlen-embits);
+
+    GPhash(MC_SHA2,sha,&HMASK,0,0,m,-1,NULL);
+    if (emlen < hlen + hlen +  2) return 0; 
+    if (w->val[emlen-1]!=(char)0xbc) return 0;
+    if ((w->val[0]&(~mask))!=0) return 0;
+
+    OCT_jbytes(&DB,w->val,emlen-hlen-1);
+    OCT_jbytes(&H,&w->val[emlen-hlen-1],hlen);
+    
+    MGF1XOR(sha,&H,&DB);
+    DB.val[0]&=mask;
+
+    k=0;
+    for (i=0;i<emlen-hlen-hlen-2;i++)
+        k|=DB.val[i];
+    if (k!=0) return 0;
+    if (DB.val[emlen-hlen-hlen-2]!=0x01) return 0;
+    OCT_jbytes(&SALT,&DB.val[DB.len-hlen],hlen);
+    
+    OCT_clear(&DB);
+    OCT_jbyte(&DB,0,8);
+    OCT_joctet(&DB,&HMASK);
+    OCT_joctet(&DB,&SALT);
+    GPhash(MC_SHA2,sha,&HMASK,0,0,&DB,-1,NULL);
+
+    if (!OCT_ncomp(&H,&HMASK,H.len))
+        return 0;
+
+    return 1;
+}
+
+/* OAEP Message Encoding for Encryption */
+
+int core::OAEP_ENCODE(int sha, octet *m, csprng *RNG, octet *p, octet *f)
+{
+    int slen, olen = f->max - 1;
+    int mlen = m->len;
+    int hlen, seedlen;
+    char dbmask[MAX_RSA_BYTES], seed[64];
+    octet DBMASK = {0, sizeof(dbmask), dbmask};
+    octet SEED = {0, sizeof(seed), seed};
+
+    hlen = seedlen = sha;
+    if (mlen > olen - hlen - seedlen - 1) return 0;
+    if (m == f) return 0; /* must be distinct octets */
+
+    GPhash(MC_SHA2,sha,f,0,0,p,-1,NULL);
+    //hashit(sha, p, -1, f);
+
+    slen = olen - mlen - hlen - seedlen - 1;
+
+    OCT_jbyte(f, 0, slen);
+    OCT_jbyte(f, 0x1, 1);
+    OCT_joctet(f, m);
+
+    OCT_rand(&SEED, RNG, seedlen);
+
+    MGF1(sha, &SEED, olen - seedlen, &DBMASK);
+
+    OCT_xor(&DBMASK, f);
+    MGF1(sha, &DBMASK, seedlen, f);
+
+    OCT_xor(f, &SEED);
+
+    OCT_joctet(f, &DBMASK);
+
+    OCT_pad(f, f->max);
+    OCT_clear(&SEED);
+    OCT_clear(&DBMASK);
+
+    return 1;
+}
+
+/* OAEP Message Decoding for Decryption */
+
+int core::OAEP_DECODE(int sha, octet *p, octet *f)
+{
+    int comp, x, t;
+    int i, k, olen = f->max - 1;
+    int hlen, seedlen;
+    char dbmask[MAX_RSA_BYTES], seed[64], chash[64];
+    octet DBMASK = {0, sizeof(dbmask), dbmask};
+    octet SEED = {0, sizeof(seed), seed};
+    octet CHASH = {0, sizeof(chash), chash};
+
+    seedlen = hlen = sha;
+    if (olen < seedlen + hlen + 1) return 0;
+    if (!OCT_pad(f, olen + 1)) return 0;
+
+    GPhash(MC_SHA2,sha,&CHASH,0,0,p,-1,NULL);
+    //hashit(sha, p, -1, &CHASH);
+
+    x = f->val[0];
+    for (i = seedlen; i < olen; i++)
+        DBMASK.val[i - seedlen] = f->val[i + 1];
+    DBMASK.len = olen - seedlen;
+
+    MGF1(sha, &DBMASK, seedlen, &SEED);
+    for (i = 0; i < seedlen; i++) SEED.val[i] ^= f->val[i + 1];
+    MGF1(sha, &SEED, olen - seedlen, f);
+    OCT_xor(&DBMASK, f);
+
+    comp = OCT_ncomp(&CHASH, &DBMASK, hlen);
+
+    OCT_shl(&DBMASK, hlen);
+
+    OCT_clear(&SEED);
+    OCT_clear(&CHASH);
+
+// find first non-zero t in array
+    t=k=0;
+    for (i=0;i<DBMASK.len;i++)
+    {
+        if (t==0 && DBMASK.val[i]!=0) {
+            k=i;
+            t=DBMASK.val[i];
+        }
+    }
+
+    if (!comp || x != 0 || t != 0x01)
+    {
+        OCT_clear(&DBMASK);
+        return 0;
+    }
+
+    OCT_shl(&DBMASK, k + 1);
+    OCT_copy(f, &DBMASK);
+    OCT_clear(&DBMASK);
+
+    return 1;
+}
+
+
+
+/* g++ -O2 hmac.cpp oct.cpp hash.cpp rand.cpp -o hmac 
+
+int main()
+{
+    char dst[100],msg[100],okm[100];
+    octet DST={0,sizeof(dst),dst};
+    octet MSG={0,sizeof(msg),msg};
+    octet OKM={0,sizeof(okm),okm};
+
+    OCT_jstring(&MSG,(char *)"abc");
+    OCT_jstring(&DST,(char *)"P256_XMD:SHA-256_SSWU_RO_TESTGEN");
+//    XMD_Expand(MC_SHA2,32,&OKM,48,&DST,&MSG);
+    XOF_Expand(SHAKE128,&OKM,48,&DST,&MSG);
+
+    printf("OKM= %d ",OKM.len); OCT_output(&OKM);
+
+    char ikm[22],salt[13],prk[32],info[10],okm[50];  
+    octet IKM = {0, sizeof(ikm), ikm};
+    octet SALT={0,sizeof(salt),salt};
+    octet PRK={0,sizeof(prk),prk};
+    octet OKM={0,sizeof(okm),okm};
+    octet INFO={0,sizeof(info),info};
+    int i;
+    for (i=0;i<22;i++) IKM.val[i]=0x0b;
+    for (i=0;i<13;i++) SALT.val[i]=i;
+    for (i=0;i<10;i++) INFO.val[i]=0xf0+i;
+    
+    IKM.len=22; SALT.len=13; INFO.len=10;
+
+    printf("IKM= "); OCT_output(&IKM); 
+    printf("SALT= "); OCT_output(&SALT); 
+
+    HKDF_Extract(MC_SHA2,32,&PRK,&SALT,&IKM);
+
+    //HMAC(&PRK,32,&SALT,&IKM,SHA2,32);
+
+    printf("PRK= "); OCT_output(&PRK); 
+
+    HKDF_Expand(MC_SHA2,32,&OKM,42,&PRK,&INFO);
+
+    printf("OKM= %d ",OKM.len); OCT_output(&OKM);  
+}
+
+*/
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke.cpp
new file mode 100644
index 0000000..f9cd209
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke.cpp
@@ -0,0 +1,281 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* Hybrid Public Key Encryption */
+
+/* Following https://datatracker.ietf.org/doc/draft-irtf-cfrg-hpke/?include_text=1 */
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include "hpke_ZZZ.h"
+
+#define GROUP EGS_ZZZ
+#define POINT (2*EFS_ZZZ+1)
+#define MAX_HASH HASH_TYPE_ZZZ
+#define MAX_LABEL 20                // may need adjustment
+
+static void ZZZ::LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM)
+{
+    char likm[18+MAX_LABEL+2*POINT];
+    octet LIKM={0,sizeof(likm),likm};
+    OCT_jstring(&LIKM,(char *)"HPKE-v1");
+    OCT_joctet(&LIKM,SUITE_ID);
+    OCT_jstring(&LIKM,label);
+    if (IKM!=NULL)
+        OCT_joctet(&LIKM,IKM);
+    HKDF_Extract(MC_SHA2,HASH_TYPE_ZZZ,PRK,SALT,&LIKM);
+}
+
+static void ZZZ::LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L)
+{
+    char linfo[20+MAX_LABEL+3*POINT];
+    octet LINFO={0,sizeof(linfo),linfo};
+    OCT_jint(&LINFO,L,2);    
+    OCT_jstring(&LINFO,(char *)"HPKE-v1");
+    OCT_joctet(&LINFO,SUITE_ID);
+    OCT_jstring(&LINFO,label);
+    if (INFO!=NULL)
+        OCT_joctet(&LINFO,INFO);
+    HKDF_Expand(MC_SHA2,HASH_TYPE_ZZZ,OKM,L,PRK,&LINFO);
+}
+
+static void ZZZ::ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT)
+{
+    char prk[MAX_HASH];
+    octet PRK={0,sizeof(prk),prk};
+    char suite_id[10];
+    octet SUITE_ID={0,sizeof(suite_id),suite_id};
+
+    int kem_id=config_id&255;
+    OCT_jstring(&SUITE_ID,(char *)"KEM");
+    OCT_jint(&SUITE_ID,kem_id,2);
+
+    LabeledExtract(&PRK,NULL,&SUITE_ID,(char *)"eae_prk",DH);
+    LabeledExpand(OKM, &PRK,&SUITE_ID,(char *)"shared_secret",CONTEXT,HASH_TYPE_ZZZ);  
+}
+
+int ZZZ::DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED)
+{
+    int counter=0;
+    char prk[MAX_HASH];
+    octet PRK={0,sizeof(prk),prk};
+    char suite_id[10];
+    octet SUITE_ID={0,sizeof(suite_id),suite_id};
+    char info[2];
+    octet INFO={0,sizeof(info),info};
+    int bit_mask,kem=config_id&255;
+    OCT_jstring(&SUITE_ID,(char *)"KEM");
+    OCT_jint(&SUITE_ID,kem,2);
+    LabeledExtract(&PRK,NULL,&SUITE_ID,(char *)"dkp_prk",SEED);
+
+//printf("PRK= ");OCT_output(&PRK); printf("\n");
+
+    if (kem==32 || kem==33)
+    { // RFC7748
+        LabeledExpand(SK,&PRK,&SUITE_ID,(char *)"sk",NULL,GROUP);
+        OCT_reverse(SK);
+        if (kem==32)
+        {
+            SK->val[GROUP-1]&=248;  
+            SK->val[0]&=127;
+            SK->val[0]|=64;
+        } else {
+            SK->val[GROUP-1]&=252;
+            SK->val[0]|=128;
+        }
+
+    } else {
+        if (kem==18) bit_mask=1;
+        else bit_mask=0xFF;
+        OCT_clear(SK);
+        while (!ECP_IN_RANGE(SK) && counter<256)
+        {
+            OCT_empty(&INFO);
+            OCT_jbyte(&INFO,counter,1);
+            LabeledExpand(SK,&PRK,&SUITE_ID,(char *)"candidate",&INFO,GROUP);
+            SK->val[0]&=bit_mask;
+            counter++;
+        }
+    }
+//printf("SK= ");OCT_output(SK); printf("\n");
+//printf("kem= %d\n",kem);
+//printf("counter= %d\n",counter);
+    ECP_KEY_PAIR_GENERATE(NULL, SK, PK);
+    if (kem==32 || kem==33)
+        OCT_reverse(PK);
+ 
+    if (counter<256) return 1;
+    else return 0;
+}
+
+void ZZZ::HPKE_Encap(int config_id,octet *skE,octet *Z,octet *pkE,octet *pkR)
+{
+    int res,kem;
+    char dh[POINT];
+    octet DH={0,sizeof(dh),dh};
+    char kemcontext[2*POINT];
+    octet KEMCONTEXT={0,sizeof(kemcontext),kemcontext};
+    kem=config_id&255;
+
+    if (kem==32 || kem==33) 
+    {
+        OCT_reverse(pkR);
+        res=ECP_SVDP_DH(skE, pkR, &DH, 0);
+        OCT_reverse(pkR);
+        OCT_reverse(&DH);
+    } else {
+        res=ECP_SVDP_DH(skE, pkR, &DH, 0);
+    }
+
+    OCT_copy(&KEMCONTEXT,pkE);
+    OCT_joctet(&KEMCONTEXT,pkR);
+    ExtractAndExpand(config_id,Z,&DH,&KEMCONTEXT);
+}
+
+void ZZZ::HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR)
+{
+    int res,kem;
+    char dh[POINT];
+    octet DH={0,sizeof(dh),dh};
+    char kemcontext[2*POINT];
+    octet KEMCONTEXT={0,sizeof(kemcontext),kemcontext};
+    kem=config_id&255;
+
+    if (kem==32 || kem==33)
+    {
+        OCT_reverse(pkE);
+        ECP_SVDP_DH(skR, pkE, &DH, 0);
+        OCT_reverse(pkE);
+        OCT_reverse(&DH);
+    } else {
+        ECP_SVDP_DH(skR, pkE, &DH, 0);
+    }
+
+    OCT_copy(&KEMCONTEXT,pkE);
+    OCT_joctet(&KEMCONTEXT,pkR);
+
+    ExtractAndExpand(config_id,Z,&DH,&KEMCONTEXT);
+}
+
+void ZZZ::HPKE_AuthEncap(int config_id,octet *skE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS)
+{
+    int res,kem;
+    char dh[2*POINT];
+    octet DH={0,sizeof(dh),dh};
+    char dh1[POINT];
+    octet DH1={0,sizeof(dh1),dh1};
+    char kemcontext[3*POINT];
+    octet KEMCONTEXT={0,sizeof(kemcontext),kemcontext};
+
+    kem=config_id&255;
+
+    if (kem==32 || kem==33)
+    {
+        OCT_reverse(pkR);
+        ECP_SVDP_DH(skE, pkR, &DH,0);
+        ECP_SVDP_DH(skS, pkR, &DH1,0);
+        OCT_reverse(pkR);
+        OCT_reverse(&DH);
+        OCT_reverse(&DH1);
+    } else {
+        ECP_SVDP_DH(skE, pkR, &DH, 0);
+        ECP_SVDP_DH(skS, pkR, &DH1,0);
+    }
+
+    OCT_joctet(&DH,&DH1);
+    OCT_copy(&KEMCONTEXT,pkE);
+    OCT_joctet(&KEMCONTEXT,pkR);
+    OCT_joctet(&KEMCONTEXT,pkS);
+
+    ExtractAndExpand(config_id,Z,&DH,&KEMCONTEXT);
+}
+
+void ZZZ::HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS)
+{
+    int res,kem;
+    char dh[2*POINT];
+    octet DH={0,sizeof(dh),dh};
+    char dh1[POINT];
+    octet DH1={0,sizeof(dh1),dh1};
+    char kemcontext[3*POINT];
+    octet KEMCONTEXT={0,sizeof(kemcontext),kemcontext};
+
+    kem=config_id&255;
+
+    if (kem==32 || kem==33) {
+        OCT_reverse(pkE);
+        OCT_reverse(pkS);
+        ECP_SVDP_DH(skR, pkE, &DH,0);
+        ECP_SVDP_DH(skR, pkS, &DH1,0);
+        OCT_reverse(pkE);
+        OCT_reverse(pkS);
+        OCT_reverse(&DH);
+        OCT_reverse(&DH1);
+    } else {
+        ECP_SVDP_DH(skR, pkE, &DH, 0);
+        ECP_SVDP_DH(skR, pkS, &DH1, 0);
+    }
+    OCT_joctet(&DH,&DH1);
+
+    OCT_copy(&KEMCONTEXT,pkE);
+    OCT_joctet(&KEMCONTEXT,pkR);
+    OCT_joctet(&KEMCONTEXT,pkS);
+
+    ExtractAndExpand(config_id,Z,&DH,&KEMCONTEXT);
+}
+
+void ZZZ::HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID)
+{
+    char context[1+2*MAX_HASH];
+    octet CONTEXT={0,sizeof(context),context};
+
+    char h[MAX_HASH];
+    octet H={0,sizeof(h),h};
+    char secret_h[MAX_HASH];
+    octet secret={0,sizeof(secret_h),secret_h};
+
+    int kem_id=config_id&255;
+    int kdf_id=(config_id>>8)&3;
+    int aead_id=(config_id>>10)&3;
+
+    char suite_id[10];
+    octet SUITE_ID={0,sizeof(suite_id),suite_id};
+    OCT_jstring(&SUITE_ID,(char *)"HPKE");
+    OCT_jint(&SUITE_ID,kem_id,2);
+    OCT_jint(&SUITE_ID,kdf_id,2);
+    OCT_jint(&SUITE_ID,aead_id,2);
+
+    OCT_jint(&CONTEXT,mode,1);
+
+    LabeledExtract(&H,NULL,&SUITE_ID,(char *)"psk_id_hash",pskID);
+    OCT_joctet(&CONTEXT,&H);
+    LabeledExtract(&H,NULL,&SUITE_ID,(char *)"info_hash",info);
+    OCT_joctet(&CONTEXT,&H);
+
+    LabeledExtract(&secret,Z,&SUITE_ID,(char *)"secret",psk);
+
+    //LabeledExtract(&H,NULL,&SUITE_ID,(char *)"psk_hash",psk);
+    //LabeledExtract(&secret,&H,&SUITE_ID,(char *)"secret",Z);
+
+    LabeledExpand(key,&secret,&SUITE_ID,(char *)"key",&CONTEXT,AESKEY_ZZZ);
+    LabeledExpand(nonce,&secret,&SUITE_ID,(char *)"base_nonce",&CONTEXT,12);
+    if (exp_secret!=NULL)
+        LabeledExpand(exp_secret,&secret,&SUITE_ID,(char *)"exp",&CONTEXT,HASH_TYPE_ZZZ);
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke.h
new file mode 100644
index 0000000..db21187
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_ZZZ_H
+#define HPKE_ZZZ_H
+
+#include "ecdh_ZZZ.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace ZZZ {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_ANSSI.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_ANSSI.h
new file mode 100644
index 0000000..daeb126
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_ANSSI.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_ANSSI_H
+#define HPKE_ANSSI_H
+
+#include "ecdh_ANSSI.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace ANSSI {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_BLS12381.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_BLS12381.h
new file mode 100644
index 0000000..f8d4cc0
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_BLS12381.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_BLS12381_H
+#define HPKE_BLS12381_H
+
+#include "ecdh_BLS12381.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace BLS12381 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_BLS12383.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_BLS12383.h
new file mode 100644
index 0000000..ea309e5
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_BLS12383.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_BLS12383_H
+#define HPKE_BLS12383_H
+
+#include "ecdh_BLS12383.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace BLS12383 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_BLS12443.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_BLS12443.h
new file mode 100644
index 0000000..f42b80c
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_BLS12443.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_BLS12443_H
+#define HPKE_BLS12443_H
+
+#include "ecdh_BLS12443.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace BLS12443 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_BLS12461.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_BLS12461.h
new file mode 100644
index 0000000..012bdcb
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_BLS12461.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_BLS12461_H
+#define HPKE_BLS12461_H
+
+#include "ecdh_BLS12461.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace BLS12461 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_BLS24479.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_BLS24479.h
new file mode 100644
index 0000000..2fd5184
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_BLS24479.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_BLS24479_H
+#define HPKE_BLS24479_H
+
+#include "ecdh_BLS24479.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace BLS24479 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_BLS48286.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_BLS48286.h
new file mode 100644
index 0000000..a4d3dd5
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_BLS48286.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_BLS48286_H
+#define HPKE_BLS48286_H
+
+#include "ecdh_BLS48286.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace BLS48286 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_BLS48556.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_BLS48556.h
new file mode 100644
index 0000000..70621eb
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_BLS48556.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_BLS48556_H
+#define HPKE_BLS48556_H
+
+#include "ecdh_BLS48556.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace BLS48556 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_BLS48581.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_BLS48581.h
new file mode 100644
index 0000000..ad329fd
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_BLS48581.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_BLS48581_H
+#define HPKE_BLS48581_H
+
+#include "ecdh_BLS48581.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace BLS48581 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_BN158.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_BN158.h
new file mode 100644
index 0000000..5e10ae2
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_BN158.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_BN158_H
+#define HPKE_BN158_H
+
+#include "ecdh_BN158.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace BN158 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_BN254.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_BN254.h
new file mode 100644
index 0000000..57a1c9f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_BN254.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_BN254_H
+#define HPKE_BN254_H
+
+#include "ecdh_BN254.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace BN254 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_BN254CX.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_BN254CX.h
new file mode 100644
index 0000000..7808cc1
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_BN254CX.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_BN254CX_H
+#define HPKE_BN254CX_H
+
+#include "ecdh_BN254CX.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace BN254CX {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_BN462.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_BN462.h
new file mode 100644
index 0000000..99da642
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_BN462.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_BN462_H
+#define HPKE_BN462_H
+
+#include "ecdh_BN462.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace BN462 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_BRAINPOOL.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_BRAINPOOL.h
new file mode 100644
index 0000000..f5f98a1
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_BRAINPOOL.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_BRAINPOOL_H
+#define HPKE_BRAINPOOL_H
+
+#include "ecdh_BRAINPOOL.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace BRAINPOOL {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_C1174.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_C1174.h
new file mode 100644
index 0000000..231f891
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_C1174.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_C1174_H
+#define HPKE_C1174_H
+
+#include "ecdh_C1174.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace C1174 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_C13318.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_C13318.h
new file mode 100644
index 0000000..af67e5c
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_C13318.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_C13318_H
+#define HPKE_C13318_H
+
+#include "ecdh_C13318.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace C13318 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_C1665.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_C1665.h
new file mode 100644
index 0000000..4ee5c46
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_C1665.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_C1665_H
+#define HPKE_C1665_H
+
+#include "ecdh_C1665.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace C1665 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_C25519.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_C25519.h
new file mode 100644
index 0000000..3e92ef8
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_C25519.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_C25519_H
+#define HPKE_C25519_H
+
+#include "ecdh_C25519.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace C25519 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_C41417.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_C41417.h
new file mode 100644
index 0000000..734fc38
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_C41417.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_C41417_H
+#define HPKE_C41417_H
+
+#include "ecdh_C41417.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace C41417 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_Ed25519.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_Ed25519.h
new file mode 100644
index 0000000..91e6bf5
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_Ed25519.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_Ed25519_H
+#define HPKE_Ed25519_H
+
+#include "ecdh_Ed25519.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace Ed25519 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_Ed448.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_Ed448.h
new file mode 100644
index 0000000..0c61a15
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_Ed448.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_Ed448_H
+#define HPKE_Ed448_H
+
+#include "ecdh_Ed448.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace Ed448 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_FP256BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_FP256BN.h
new file mode 100644
index 0000000..2d0502d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_FP256BN.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_FP256BN_H
+#define HPKE_FP256BN_H
+
+#include "ecdh_FP256BN.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace FP256BN {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_FP512BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_FP512BN.h
new file mode 100644
index 0000000..951c23c
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_FP512BN.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_FP512BN_H
+#define HPKE_FP512BN_H
+
+#include "ecdh_FP512BN.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace FP512BN {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_HIFIVE.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_HIFIVE.h
new file mode 100644
index 0000000..4ef9302
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_HIFIVE.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_HIFIVE_H
+#define HPKE_HIFIVE_H
+
+#include "ecdh_HIFIVE.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace HIFIVE {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_JUBJUB.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_JUBJUB.h
new file mode 100644
index 0000000..7393f7f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_JUBJUB.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_JUBJUB_H
+#define HPKE_JUBJUB_H
+
+#include "ecdh_JUBJUB.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace JUBJUB {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_MDC.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_MDC.h
new file mode 100644
index 0000000..394f649
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_MDC.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_MDC_H
+#define HPKE_MDC_H
+
+#include "ecdh_MDC.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace MDC {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_NIST256.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_NIST256.h
new file mode 100644
index 0000000..48d077a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_NIST256.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_NIST256_H
+#define HPKE_NIST256_H
+
+#include "ecdh_NIST256.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace NIST256 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_NIST384.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_NIST384.h
new file mode 100644
index 0000000..d5cb821
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_NIST384.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_NIST384_H
+#define HPKE_NIST384_H
+
+#include "ecdh_NIST384.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace NIST384 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_NIST521.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_NIST521.h
new file mode 100644
index 0000000..0e6fa05
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_NIST521.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_NIST521_H
+#define HPKE_NIST521_H
+
+#include "ecdh_NIST521.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace NIST521 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_NUMS256E.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_NUMS256E.h
new file mode 100644
index 0000000..60b741a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_NUMS256E.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_NUMS256E_H
+#define HPKE_NUMS256E_H
+
+#include "ecdh_NUMS256E.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace NUMS256E {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_NUMS256W.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_NUMS256W.h
new file mode 100644
index 0000000..da77e24
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_NUMS256W.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_NUMS256W_H
+#define HPKE_NUMS256W_H
+
+#include "ecdh_NUMS256W.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace NUMS256W {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_NUMS384E.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_NUMS384E.h
new file mode 100644
index 0000000..24f53e3
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_NUMS384E.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_NUMS384E_H
+#define HPKE_NUMS384E_H
+
+#include "ecdh_NUMS384E.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace NUMS384E {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_NUMS384W.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_NUMS384W.h
new file mode 100644
index 0000000..8ac40c0
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_NUMS384W.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_NUMS384W_H
+#define HPKE_NUMS384W_H
+
+#include "ecdh_NUMS384W.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace NUMS384W {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_NUMS512E.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_NUMS512E.h
new file mode 100644
index 0000000..beb58a1
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_NUMS512E.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_NUMS512E_H
+#define HPKE_NUMS512E_H
+
+#include "ecdh_NUMS512E.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace NUMS512E {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_NUMS512W.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_NUMS512W.h
new file mode 100644
index 0000000..77b7724
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_NUMS512W.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_NUMS512W_H
+#define HPKE_NUMS512W_H
+
+#include "ecdh_NUMS512W.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace NUMS512W {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_SECP160R1.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_SECP160R1.h
new file mode 100644
index 0000000..5d4ea2e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_SECP160R1.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_SECP160R1_H
+#define HPKE_SECP160R1_H
+
+#include "ecdh_SECP160R1.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace SECP160R1 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_SECP256K1.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_SECP256K1.h
new file mode 100644
index 0000000..f459811
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_SECP256K1.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_SECP256K1_H
+#define HPKE_SECP256K1_H
+
+#include "ecdh_SECP256K1.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace SECP256K1 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_SM2.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_SM2.h
new file mode 100644
index 0000000..f1fee5e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_SM2.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_SM2_H
+#define HPKE_SM2_H
+
+#include "ecdh_SM2.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace SM2 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_TWEEDLEDEE.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_TWEEDLEDEE.h
new file mode 100644
index 0000000..84253c6
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_TWEEDLEDEE.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_TWEEDLEDEE_H
+#define HPKE_TWEEDLEDEE_H
+
+#include "ecdh_TWEEDLEDEE.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace TWEEDLEDEE {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_TWEEDLEDUM.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_TWEEDLEDUM.h
new file mode 100644
index 0000000..e5244d0
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_TWEEDLEDUM.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_TWEEDLEDUM_H
+#define HPKE_TWEEDLEDUM_H
+
+#include "ecdh_TWEEDLEDUM.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace TWEEDLEDUM {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_X448.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_X448.h
new file mode 100644
index 0000000..91efa1f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/hpke_X448.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_X448_H
+#define HPKE_X448_H
+
+#include "ecdh_X448.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace X448 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/kyber.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/kyber.cpp
new file mode 100644
index 0000000..3956e8c
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/kyber.cpp
@@ -0,0 +1,812 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* Kyber API implementation. Constant time where it matters. Spends nearly all of its time running SHA3. Small.
+
+   M.Scott 22/11/2021
+*/
+
+#include "kyber.h"
+
+using namespace core;
+
+// parameters for each security level
+// K,eta1,eta2,du,dv,shared secret
+const int PARAMS_512[6]={2,3,2,10,4,32};
+const int PARAMS_768[6]={3,2,2,10,4,32};
+const int PARAMS_1024[6]={4,2,2,11,5,32};
+
+/* Start of public domain reference implementation code - taken from https://github.com/pq-crystals/kyber */
+
+const sign16 zetas[128] = {
+  -1044,  -758,  -359, -1517,  1493,  1422,   287,   202,
+   -171,   622,  1577,   182,   962, -1202, -1474,  1468,
+    573, -1325,   264,   383,  -829,  1458, -1602,  -130,
+   -681,  1017,   732,   608, -1542,   411,  -205, -1571,
+   1223,   652,  -552,  1015, -1293,  1491,  -282, -1544,
+    516,    -8,  -320,  -666, -1618, -1162,   126,  1469,
+   -853,   -90,  -271,   830,   107, -1421,  -247,  -951,
+   -398,   961, -1508,  -725,   448, -1065,   677, -1275,
+  -1103,   430,   555,   843, -1251,   871,  1550,   105,
+    422,   587,   177,  -235,  -291,  -460,  1574,  1653,
+   -246,   778,  1159,  -147,  -777,  1483,  -602,  1119,
+  -1590,   644,  -872,   349,   418,   329,  -156,   -75,
+    817,  1097,   603,   610,  1322, -1285, -1465,   384,
+  -1215,  -136,  1218, -1335,  -874,   220, -1187, -1659,
+  -1185, -1530, -1278,   794, -1510,  -854,  -870,   478,
+   -108,  -308,   996,   991,   958, -1460,  1522,  1628
+};
+
+static int16_t montgomery_reduce(int32_t a)
+{
+  int16_t t;
+
+  t = (int16_t)a*KY_QINV;
+  t = (a - (int32_t)t*KY_PRIME) >> 16;
+  return t;
+}
+
+static int16_t barrett_reduce(int16_t a) {
+  int16_t t;
+  const int16_t v = ((1<<26) + KY_PRIME/2)/KY_PRIME;
+
+  t  = ((int32_t)v*a + (1<<25)) >> 26;
+  t *= KY_PRIME;
+  return a - t;
+}
+
+static sign16 fqmul(sign16 a, sign16 b) {
+  return montgomery_reduce((sign32)a*b);
+}
+
+static void ntt(int16_t r[256]) {
+  unsigned int len, start, j, k;
+  int16_t t, zeta;
+
+  k = 1;
+  for(len = 128; len >= 2; len >>= 1) {
+    for(start = 0; start < 256; start = j + len) {
+      zeta = zetas[k++];
+      for(j = start; j < start + len; j++) {
+        t = fqmul(zeta, r[j + len]);
+        r[j + len] = r[j] - t;
+        r[j] = r[j] + t;
+      }
+    }
+  }
+}
+
+static void invntt(int16_t r[256]) {
+  unsigned int start, len, j, k;
+  int16_t t, zeta;
+  const int16_t f = 1441; // mont^2/128
+
+  k = 127;
+  for(len = 2; len <= 128; len <<= 1) {
+    for(start = 0; start < 256; start = j + len) {
+      zeta = zetas[k--];
+      for(j = start; j < start + len; j++) {
+        t = r[j];
+        r[j] = barrett_reduce(t + r[j + len]);
+        r[j + len] = r[j + len] - t;
+        r[j + len] = fqmul(zeta, r[j + len]);
+      }
+    }
+  }
+
+  for(j = 0; j < 256; j++)
+    r[j] = fqmul(r[j], f);
+}
+
+static void basemul(sign16 r[2], const sign16 a[2], const sign16 b[2], sign16 zeta) {
+    r[0]  = fqmul(a[1], b[1]);
+    r[0]  = fqmul(r[0], zeta);
+    r[0] += fqmul(a[0], b[0]);
+    r[1]  = fqmul(a[0], b[1]);
+    r[1] += fqmul(a[1], b[0]);
+}
+
+static void poly_reduce(sign16 *r)
+{
+    int i;
+    for(i=0;i<KY_DEGREE;i++)
+        r[i] = barrett_reduce(r[i]);
+}
+
+static void poly_ntt(sign16 *r)
+{
+    ntt(r);
+    poly_reduce(r);
+}
+
+static void poly_invntt(sign16 *r)
+{
+    invntt(r);
+}
+
+// Note r must be distinct from a and b
+static void poly_mul(sign16 *r, const sign16 *a, const sign16 *b)
+{
+    int i;
+    for(i = 0; i < KY_DEGREE/4; i++) {
+        basemul(&r[4*i], &a[4*i], &b[4*i], zetas[64 + i]);
+        basemul(&r[4*i + 2], &a[4*i + 2], &b[4*i + 2], -zetas[64 + i]);
+    }
+}
+
+static void poly_tomont(sign16 *r)
+{
+    int i;
+    const sign16 f = KY_ONE;
+    for(i=0;i<KY_DEGREE;i++)
+        r[i] = montgomery_reduce((sign32)r[i]*f);
+}
+
+/* End of public domain reference code use */
+
+// copy polynomial
+static void poly_copy(sign16 *p1, sign16 *p2)
+{
+    int i;
+    for (i = 0; i < KY_DEGREE; i++)
+        p1[i] = p2[i];
+}
+
+// zero polynomial
+static void poly_zero(sign16 *p1)
+{
+    int i;
+    for (i = 0; i < KY_DEGREE; i++)
+        p1[i] = 0;
+}
+
+// add polynomials
+static void poly_add(sign16 *p1, sign16 *p2, sign16 *p3)
+{
+    int i;
+    for (i = 0; i < KY_DEGREE; i++)
+        p1[i] = (p2[i] + p3[i]);
+}
+
+// subtract polynomials
+static void poly_sub(sign16 *p1, sign16 *p2, sign16 *p3)
+{
+    int i;
+    for (i = 0; i < KY_DEGREE; i++)
+        p1[i] = (p2[i] - p3[i]);
+}
+
+// Generate A[i][j] from rho
+static void ExpandAij(byte rho[32],sign16 Aij[],int i,int j)
+{
+    int m;
+    sha3 sh;
+    SHA3_init(&sh, SHAKE128);
+    byte buff[640];  // should be plenty (?)
+    for (m=0;m<32;m++)
+        SHA3_process(&sh,rho[m]);
+    SHA3_process(&sh,j&0xff);
+    SHA3_process(&sh,i&0xff);
+    SHA3_shake(&sh,(char *)buff,640);
+    i=j=0;
+    while (j<KY_DEGREE)
+    {
+        int d1=buff[i]+256*(buff[i+1]&0x0F);
+        int d2=buff[i+1]/16+16*buff[i+2];
+        if (d1<KY_PRIME)
+            Aij[j++]=d1;
+        if (d2<KY_PRIME && j<KY_DEGREE)
+            Aij[j++]=d2;
+        i+=3;
+    }
+}
+
+// get n-th bit from byte array
+static int getbit(byte b[],int n)
+{
+    int wd=n/8;
+    int bt=n%8;
+    return (b[wd]>>bt)&1;
+}
+
+// centered binomial distribution
+static void CBD(byte bts[],int eta,sign16 f[KY_DEGREE])
+{
+    int a,b;
+    for (int i=0;i<KY_DEGREE;i++)
+    {
+        a=b=0;
+        for (int j=0;j<eta;j++)
+        {
+            a+=getbit(bts,2*i*eta+j);
+            b+=getbit(bts,2*i*eta+eta+j);
+        }
+        f[i]=a-b; 
+    }
+}
+
+// extract ab bits into word from dense byte stream
+static sign16 nextword(int ab,byte t[],int &ptr, int &bts)
+{
+    sign16 r=t[ptr]>>bts;
+    sign16 mask=(1<<ab)-1;
+    sign16 w;
+    int i=0;
+    int gotbits=8-bts; // bits left in current byte
+    while (gotbits<ab)
+    {
+        i++;
+        w=(sign16)t[ptr+i];
+        r|=w<<gotbits;
+        gotbits+=8;
+    }
+    bts+=ab;
+    while (bts>=8)
+    {
+        bts-=8;
+        ptr++;
+    }
+    w=r&mask;
+    return w;  
+}
+
+// array t has ab active bits per word
+// extract bytes from array of words
+// if max!=0 then -max<=t[i]<=+max
+static byte nextbyte16(int ab,sign16 t[],int &ptr, int &bts)
+{
+    sign16 r,w;
+    int left=ab-bts; // number of bits left in this word
+    int i=0;
+
+    w=t[ptr]; w+=(w>>15)&KY_PRIME;
+    r=w>>bts;
+    while (left<8)
+    {
+        i++;
+        w=t[ptr+i]; w+=(w>>15)&KY_PRIME;
+        r|=w<<left;
+        left+=ab;
+    }
+
+    bts+=8;
+    while (bts>=ab)
+    {
+        bts-=ab;
+        ptr++;
+    }
+    return (byte)r&0xff;        
+}
+
+// encode polynomial vector of length len with coefficients of length L, into packed bytes
+static void encode(sign16 t[],int len,int L,byte pack[])
+{
+    int ptr,bts,n;
+    ptr=bts=0;
+    for (n=0;n<len*(KY_DEGREE*L)/8;n++ ) {
+        pack[n]=nextbyte16(L,t,ptr,bts);
+    }
+}
+
+static byte chk_encode(sign16 t[],int len,int L,byte pack[])
+{
+    int ptr,bts,n;
+    byte m,diff=0;
+    ptr=bts=0;
+    for (n=0;n<len*(KY_DEGREE*L)/8;n++ ) {
+        m=nextbyte16(L,t,ptr,bts);
+        diff|=(m^pack[n]);
+    }    
+    return diff;
+}
+
+// decode packed bytes into polynomial vector of length len, with coefficients of length L
+static void decode(byte pack[],int L,sign16 t[],int len)
+{
+    int ptr,bts,i;
+    ptr=bts=0;
+    for (i=0;i<len*KY_DEGREE;i++ )
+        t[i]=nextword(L,pack,ptr,bts);
+}
+
+// Bernsteins safe division by 0xD01
+static int32_t safediv(int32_t x)
+{
+    int32_t qpart,q=0;    
+
+    qpart=(int32_t)(((int64_t)x*645083)>>31);
+    x-=qpart*0xD01; q += qpart;
+
+    qpart=(int32_t)(((int64_t)x*645083)>>31)+1;
+    x-=qpart*0xD01; q += qpart+(x>>31);
+
+    return q;
+}
+
+// compress polynomial coefficents in place, for polynomial vector of length len
+static void compress(sign16 t[],int len,int d)
+{
+    sign32 twod=(1<<d);
+    for (int i=0;i<len*KY_DEGREE;i++)
+    {
+        t[i]+=(t[i]>>15)&KY_PRIME;
+        t[i]= (sign16)(safediv(twod*t[i]+KY_PRIME/2)&(twod-1));
+    }
+}
+
+// decompress polynomial coefficents in place, for polynomial vector of length len
+static void decompress(sign16 t[],int len,int d)
+{
+    int twod1=(1<<(d-1));
+    for (int i=0;i<len*KY_DEGREE;i++)
+        t[i]=(KY_PRIME*t[i]+twod1)>>d;
+}
+
+// input entropy, output key pair
+static void KYBER_CPA_keypair(const int *params,byte *tau,octet *sk,octet *pk)
+{
+    int i,j,k,row;
+    sha3 sh;
+    byte rho[32];
+    byte sigma[33];
+    byte buff[256];
+
+    int ck=params[0];
+    sign16 r[KY_DEGREE];
+    sign16 w[KY_DEGREE];
+    sign16 Aij[KY_DEGREE]; 
+#ifdef USE_VLAS
+    sign16 s[ck*KY_DEGREE];
+    sign16 e[ck*KY_DEGREE];
+    sign16 p[ck*KY_DEGREE];
+#else
+    sign16 s[KY_MAXK*KY_DEGREE];
+    sign16 e[KY_MAXK*KY_DEGREE];
+    sign16 p[KY_MAXK*KY_DEGREE];
+#endif
+
+    int eta1=params[1];
+    int public_key_size=32+ck*(KY_DEGREE*3)/2;
+    int secret_cpa_key_size=ck*(KY_DEGREE*3)/2;
+
+    SHA3_init(&sh,SHA3_HASH512);
+   
+    for (i=0;i<32;i++)
+        SHA3_process(&sh,tau[i]); 
+    SHA3_hash(&sh,(char *)buff);
+    for (i=0;i<32;i++)
+    {
+        rho[i]=buff[i];
+        sigma[i]=buff[i+32];
+    }
+    sigma[32]=0;   // N
+
+// create s
+    for (i=0;i<ck;i++)
+    {
+        SHA3_init(&sh,SHAKE256);
+        for (j=0;j<33;j++)
+            SHA3_process(&sh,sigma[j]); 
+        SHA3_shake(&sh,(char *)buff,64*eta1);
+        CBD(buff,eta1,&s[i*KY_DEGREE]);
+        sigma[32]+=1;
+    }
+
+// create e
+    for (i=0;i<ck;i++)
+    {
+        SHA3_init(&sh,SHAKE256);
+        for (j=0;j<33;j++)
+            SHA3_process(&sh,sigma[j]); 
+        SHA3_shake(&sh,(char *)buff,64*eta1);
+        CBD(buff,eta1,&e[i*KY_DEGREE]);
+        sigma[32]+=1;
+    }
+
+    for (k=0;k<ck;k++)
+    {
+        row=KY_DEGREE*k;
+        poly_ntt(&s[row]);
+        poly_ntt(&e[row]);
+    }
+
+    for (i=0;i<ck;i++)
+    {
+        row=KY_DEGREE*i;
+        ExpandAij(rho,Aij,i,0);
+        poly_mul(r,Aij,s);
+        for (j=1;j<ck;j++)
+        {
+            ExpandAij(rho,Aij,i,j);
+            poly_mul(w,&s[j*KY_DEGREE],Aij);
+            poly_add(r,r,w);
+        }
+        poly_reduce(r);
+        poly_tomont(r);
+        poly_add(&p[row],r,&e[row]);
+        poly_reduce(&p[row]);
+    }
+
+    encode(s,ck,12,(byte *)sk->val);
+    sk->len=secret_cpa_key_size;
+    encode(p,ck,12,(byte *)pk->val);
+    pk->len=public_key_size;
+    for (i=0;i<32;i++)
+        pk->val[public_key_size-32+i]=rho[i];
+}
+
+// input 64 random bytes, output secret and public keys
+static void KYBER_CCA_keypair(const int *params,byte *randbytes64,octet *sk,octet *pk)
+{
+    int i;
+    sha3 sh;
+    byte h[32];
+
+    KYBER_CPA_keypair(params,randbytes64,sk,pk);
+    OCT_joctet(sk,pk);
+
+    SHA3_init(&sh,SHA3_HASH256);
+    for (i=0;i<pk->len;i++)
+        SHA3_process(&sh,(byte)pk->val[i]);
+    SHA3_hash(&sh,(char *)h);
+    OCT_jbytes(sk,(char *)h,32);
+    OCT_jbytes(sk,(char *)&randbytes64[32],32);
+}
+
+static void KYBER_CPA_base_encrypt(const int *params,byte *coins,octet *pk,octet *ss,sign16 *u, sign16* v)
+{
+    int i,row,j,len;
+    sha3 sh;
+    byte sigma[33];
+    byte buff[256];
+    byte rho[32];
+
+    int ck=params[0];
+    sign16 r[KY_DEGREE];
+    sign16 w[KY_DEGREE];
+    sign16 Aij[KY_DEGREE]; 
+#ifdef USE_VLAS
+    sign16 q[ck*KY_DEGREE];
+    sign16 p[ck*KY_DEGREE];
+#else
+    sign16 q[KY_MAXK*KY_DEGREE];
+    sign16 p[KY_MAXK*KY_DEGREE];
+#endif
+
+    int eta1=params[1];
+    int eta2=params[2];
+    int du=params[3];
+    int dv=params[4];
+    int public_key_size=32+ck*(KY_DEGREE*3)/2;
+
+    for (i=0;i<32;i++)
+        sigma[i]=coins[i];//i+6; //RAND_byte(RNG);
+    sigma[32]=0;
+
+    for (i=0;i<32;i++)
+        rho[i]=pk->val[pk->len-32+i];
+
+// create q
+    for (i=0;i<ck;i++)
+    {
+        SHA3_init(&sh,SHAKE256);
+        for (j=0;j<33;j++)
+            SHA3_process(&sh,sigma[j]); 
+        SHA3_shake(&sh,(char *)buff,64*eta1);
+        CBD(buff,eta1,&q[i*KY_DEGREE]);
+        sigma[32]+=1;
+    }
+
+// create e1
+    for (i=0;i<ck;i++)
+    {
+        SHA3_init(&sh,SHAKE256);
+        for (j=0;j<33;j++)
+            SHA3_process(&sh,sigma[j]); 
+        SHA3_shake(&sh,(char *)buff,64*eta2);
+        CBD(buff,eta1,&u[i*KY_DEGREE]);          // e1
+        sigma[32]+=1;
+    }
+
+    for (i=0;i<ck;i++)
+    {
+        row=KY_DEGREE*i;
+        poly_ntt(&q[row]);
+    }
+
+    for (i=0;i<ck;i++)
+    {
+        row=KY_DEGREE*i;
+        ExpandAij(rho,Aij,0,i);
+        poly_mul(r,Aij,q);
+        for (j=1;j<ck;j++)
+        {
+            ExpandAij(rho,Aij,j,i);
+            poly_mul(w,&q[j*KY_DEGREE],Aij);
+            poly_add(r,r,w);
+        }
+        poly_reduce(r);
+        poly_invntt(r);
+        poly_add(&u[row],&u[row],r);
+        poly_reduce(&u[row]);
+    }
+
+    decode((byte *)pk->val,12,p,ck);
+
+    poly_mul(v,p,q);
+    for (i=1;i<ck;i++)
+    {
+        row=KY_DEGREE*i;
+        poly_mul(r,&p[row],&q[row]);
+        poly_add(v,v,r);
+    }
+    poly_invntt(v);
+
+// create e2
+    SHA3_init(&sh,SHAKE256);
+    for (j=0;j<33;j++)
+        SHA3_process(&sh,sigma[j]); 
+    SHA3_shake(&sh,(char *)buff,64*eta2);
+    CBD(buff,eta1,w);  // e2
+
+    poly_add(v,v,w);
+    
+    decode((byte *)ss->val,1,r,1);
+    decompress(r,1,1);
+   
+    poly_add(v,v,r);
+    poly_reduce(v);
+
+    compress(u,ck,du);
+    compress(v,1,dv);
+}
+
+// Given input of entropy, public key and shared secret is an input, outputs ciphertext
+static void KYBER_CPA_encrypt(const int *params,byte *coins,octet *pk,octet *ss,octet *ct)
+{
+    int ck=params[0];
+    sign16 v[KY_DEGREE]; 
+#ifdef USE_VLAS
+    sign16 u[ck*KY_DEGREE];
+#else
+    sign16 u[KY_MAXK*KY_DEGREE];
+#endif
+
+    int du=params[3];
+    int dv=params[4];
+    int ciphertext_size=(du*ck+dv)*KY_DEGREE/8;
+    KYBER_CPA_base_encrypt(params,coins,pk,ss,u,v);
+    encode(u,ck,du,(byte *)ct->val);
+    encode(v,1,dv,(byte *)&ct->val[ciphertext_size-(dv*KY_DEGREE/8)]);
+    ct->len=ciphertext_size;
+}
+
+// Re-encrypt and check that ct is OK (if so return is zero)
+static byte KYBER_CPA_check_encrypt(const int *params,byte *coins,octet *pk,octet *ss,octet *ct)
+{
+    int ck=params[0];
+    sign16 v[KY_DEGREE]; 
+#ifdef USE_VLAS
+    sign16 u[ck*KY_DEGREE];
+#else
+    sign16 u[KY_MAXK*KY_DEGREE];
+#endif  
+    int du=params[3];
+    int dv=params[4];
+    int ciphertext_size=(du*ck+dv)*KY_DEGREE/8;
+    byte d1,d2;
+    KYBER_CPA_base_encrypt(params,coins,pk,ss,u,v);
+    d1=chk_encode(u,ck,du,(byte *)ct->val);
+    d2=chk_encode(v,1,dv,(byte *)&ct->val[ciphertext_size-(dv*KY_DEGREE/8)]);
+    if ((d1|d2)==0)
+        return 0;
+    else
+        return 0xff;
+}
+
+// Given entropy and public key, outputs 32-byte shared secret and ciphertext
+static void KYBER_CCA_encrypt(const int *params,byte *randbytes32,octet *pk,octet *ss,octet *ct)
+{
+    int i;
+    sha3 sh;
+    byte h[32],hm[32],g[64],coins[32];
+    octet HM={32,sizeof(hm),(char *)hm};
+    int ck=params[0];
+    int du=params[3];
+    int dv=params[4];
+    int shared_secret_size=params[5];
+
+    SHA3_init(&sh,SHA3_HASH256);               // H(m)
+    for (i=0;i<32;i++)
+        SHA3_process(&sh,randbytes32[i]);
+    SHA3_hash(&sh,(char *)hm);
+
+    SHA3_init(&sh,SHA3_HASH256);               // H(pk)
+    for (i=0;i<pk->len;i++)
+        SHA3_process(&sh,(byte)pk->val[i]);
+    SHA3_hash(&sh,(char *)h);
+
+    SHA3_init(&sh,SHA3_HASH512);               // Kb,r = G(H(m)|H(pk)
+    for (i=0;i<32;i++)
+        SHA3_process(&sh,hm[i]);
+    for (i=0;i<32;i++)
+        SHA3_process(&sh,h[i]);
+    SHA3_hash(&sh,(char *)g);
+
+    for (i=0;i<32;i++)
+        coins[i]=g[i+32];
+    KYBER_CPA_encrypt(params,coins,pk,&HM,ct);
+    
+    SHA3_init(&sh,SHA3_HASH256);              // H(ct)
+    for (i=0;i<ct->len;i++)
+        SHA3_process(&sh,(byte)ct->val[i]);
+    SHA3_hash(&sh,(char *)h);
+
+    SHA3_init(&sh,SHAKE256);                  // K=KDF(Kb|H(ct))
+    for (i=0;i<32;i++)
+        SHA3_process(&sh,g[i]);
+    for (i=0;i<32;i++)
+        SHA3_process(&sh,h[i]);
+
+    SHA3_shake(&sh,ss->val,shared_secret_size); // could be any length?
+    ss->len=shared_secret_size;
+}
+
+// Input secret key and ciphertext, outputs shared 32-byte secret
+static void KYBER_CPA_decrypt(const int *params,octet *sk,octet *ct,octet *ss)
+{
+    int i,j,row;
+    int ck=params[0];
+    sign16 w[KY_DEGREE];
+    sign16 v[KY_DEGREE];
+    sign16 r[KY_DEGREE];
+#ifdef USE_VLAS
+    sign16 u[ck*KY_DEGREE];
+    sign16 s[ck*KY_DEGREE];
+#else
+    sign16 u[KY_MAXK*KY_DEGREE];
+    sign16 s[KY_MAXK*KY_DEGREE];
+#endif
+
+    int du=params[3];
+    int dv=params[4];
+    int shared_secret_size=params[5];
+
+    decode((byte *)ct->val,du,u,ck);
+    decode((byte *)&ct->val[du*ck*KY_DEGREE/8],dv,v,1);
+    decompress(u,ck,du);
+    decompress(v,1,dv);
+    decode((byte *)sk->val,12,s,ck);
+
+    poly_ntt(u);
+    poly_mul(w,u,s);
+    for (i=1;i<ck;i++)
+    {
+        row=KY_DEGREE*i;
+        poly_ntt(&u[row]);
+        poly_mul(r,&u[row],&s[row]);
+        poly_add(w,w,r);
+    }
+    poly_reduce(w);
+    poly_invntt(w);
+    poly_sub(v,v,w);
+    compress(v,1,1);
+    encode(v,1,1,(byte *)ss->val); 
+    ss->len=shared_secret_size;
+}
+
+static void KYBER_CCA_decrypt(const int *params,octet *sk,octet *ct,octet *ss)
+{ 
+    int i,olen,same;
+    sha3 sh;
+    byte h[32],z[32],m[32],coins[32],g[64],mask;
+    octet M={32,sizeof(m),(char *)m};
+    int ck=params[0];
+    int du=params[3];
+    int dv=params[4];
+    int secret_cpa_key_size=ck*(KY_DEGREE*3)/2;
+    int public_key_size=32+ck*(KY_DEGREE*3)/2;
+    int shared_secret_size=params[5];
+    octet PK={public_key_size,public_key_size,&sk->val[secret_cpa_key_size]}; // public key is here
+
+    olen=sk->len;
+    sk->len=secret_cpa_key_size;  // chop off CPA secret
+    for (i=0;i<32;i++)
+        h[i]=sk->val[secret_cpa_key_size+public_key_size+i];
+    for (i=0;i<32;i++)
+        z[i]=sk->val[secret_cpa_key_size+public_key_size+32+i];
+
+    KYBER_CPA_decrypt(params,sk,ct,&M);
+
+    SHA3_init(&sh,SHA3_HASH512);               // Kb,r = G(H(m)|H(pk)
+    for (i=0;i<32;i++)
+        SHA3_process(&sh,m[i]);
+    for (i=0;i<32;i++)
+        SHA3_process(&sh,h[i]);
+    SHA3_hash(&sh,(char *)g);
+
+    for (i=0;i<32;i++)
+        coins[i]=g[i+32];
+    mask=KYBER_CPA_check_encrypt(params,coins,&PK,&M,ct);       // encrypt again with public key - FO transform CPA->CCA 
+
+    for (i=0;i<32;i++)
+        g[i]^=(g[i]^z[i])&mask;               // substitute z for Kb on failure
+
+    SHA3_init(&sh,SHA3_HASH256);              // H(ct)
+    for (i=0;i<ct->len;i++)
+        SHA3_process(&sh,(byte)ct->val[i]);
+    SHA3_hash(&sh,(char *)h);
+
+    SHA3_init(&sh,SHAKE256);                  // K=KDF(Kb|H(ct))
+    for (i=0;i<32;i++)
+        SHA3_process(&sh,g[i]);
+    for (i=0;i<32;i++)
+        SHA3_process(&sh,h[i]);
+    
+    SHA3_shake(&sh,ss->val,shared_secret_size); // could be any length?
+    ss->len=shared_secret_size;
+    sk->len=olen; // restore length
+}
+
+// ********************* Kyber API ******************************
+
+void core::KYBER512_keypair(byte *r64,octet *SK,octet *PK)
+{
+    KYBER_CCA_keypair(PARAMS_512,r64,SK,PK);
+}
+
+void core::KYBER768_keypair(byte *r64,octet *SK,octet *PK)
+{
+    KYBER_CCA_keypair(PARAMS_768,r64,SK,PK);
+}
+
+void core::KYBER1024_keypair(byte *r64,octet *SK,octet *PK)
+{
+    KYBER_CCA_keypair(PARAMS_1024,r64,SK,PK);
+}
+
+void core::KYBER512_encrypt(byte *r32,octet *PK,octet *SS,octet *CT)
+{
+    KYBER_CCA_encrypt(PARAMS_512,r32,PK,SS,CT);
+}
+
+void core::KYBER768_encrypt(byte *r32,octet *PK,octet *SS,octet *CT)
+{
+    KYBER_CCA_encrypt(PARAMS_768,r32,PK,SS,CT);
+}
+
+void core::KYBER1024_encrypt(byte *r32,octet *PK,octet *SS,octet *CT)
+{
+    KYBER_CCA_encrypt(PARAMS_1024,r32,PK,SS,CT);
+}
+
+void core::KYBER512_decrypt(octet *SK,octet *CT,octet *SS)
+{
+    KYBER_CCA_decrypt(PARAMS_512,SK,CT,SS);
+}
+
+void core::KYBER768_decrypt(octet *SK,octet *CT,octet *SS)
+{
+    KYBER_CCA_decrypt(PARAMS_768,SK,CT,SS);
+}
+
+void core::KYBER1024_decrypt(octet *SK,octet *CT,octet *SS)
+{
+    KYBER_CCA_decrypt(PARAMS_1024,SK,CT,SS);
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/kyber.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/kyber.h
new file mode 100644
index 0000000..08da3b8
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/kyber.h
@@ -0,0 +1,139 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* Kyber API */
+
+#ifndef KYBER_H
+#define KYBER_H
+
+#include "core.h"
+
+//q= 3329
+#define KY_LGN 8
+#define KY_DEGREE (1 << KY_LGN)
+#define KY_PRIME 0xD01
+
+#define KY_ONE 0x549		// R mod Q
+#define KY_QINV 62209   // q^(-1) mod 2^16
+
+#define KYBER_SECRET_CPA_SIZE_512 (2*(KY_DEGREE*3)/2)
+#define KYBER_PUBLIC_SIZE_512 (32+2*(KY_DEGREE*3)/2)
+#define KYBER_CIPHERTEXT_SIZE_512  ((10*2+4)*KY_DEGREE/8)
+#define KYBER_SECRET_CCA_SIZE_512 (KYBER_SECRET_CPA_SIZE_512+KYBER_PUBLIC_SIZE_512+64)
+#define KYBER_SHARED_SECRET_512 32
+
+#define KYBER_SECRET_CPA_SIZE_768 (3*(KY_DEGREE*3)/2)
+#define KYBER_PUBLIC_SIZE_768 (32+3*(KY_DEGREE*3)/2)
+#define KYBER_CIPHERTEXT_SIZE_768  ((10*3+4)*KY_DEGREE/8)
+#define KYBER_SECRET_CCA_SIZE_768 (KYBER_SECRET_CPA_SIZE_768+KYBER_PUBLIC_SIZE_768+64)
+#define KYBER_SHARED_SECRET_768 32
+
+#define KYBER_SECRET_CPA_SIZE_1024 (4*(KY_DEGREE*3)/2)
+#define KYBER_PUBLIC_SIZE_1024 (32+4*(KY_DEGREE*3)/2)
+#define KYBER_CIPHERTEXT_SIZE_1024  ((11*4+5)*KY_DEGREE/8)
+#define KYBER_SECRET_CCA_SIZE_1024 (KYBER_SECRET_CPA_SIZE_1024+KYBER_PUBLIC_SIZE_1024+64)
+#define KYBER_SHARED_SECRET_1024 32
+
+#define KY_MAXK 4
+
+namespace core {
+
+/** @brief Kyber KEM CCA key pair generation
+ *
+    @param r64 64 random bytes
+    @param SK secret key
+    @param PK public key
+
+ */
+extern void KYBER512_keypair(byte *r64,octet *SK,octet *PK);
+
+/** @brief Kyber KEM CCA encrypt
+ *
+    @param r32 32 random bytes
+    @param PK public key
+	@param SS random session key generated
+	@param CT ciphertext
+
+ */
+extern void KYBER512_encrypt(byte *r32,octet *PK,octet *SS,octet *CT);
+
+/** @brief Kyber KEM CCA decrypt
+ *
+    @param SK secret key
+	@param CT ciphertext
+	@param SS output session key 
+ */
+extern void KYBER512_decrypt(octet *SK,octet *CT,octet *SS);
+
+/** @brief Kyber KEM CCA key pair generation
+ *
+    @param r64 64 random bytes
+    @param SK secret key
+    @param PK public key
+
+ */
+extern void KYBER768_keypair(byte *r64,octet *SK,octet *PK);
+
+/** @brief Kyber KEM CCA encrypt
+ *
+    @param r32 32 random bytes
+    @param PK public key
+	@param SS random session key generated
+	@param CT ciphertext
+
+ */
+extern void KYBER768_encrypt(byte *r32,octet *PK,octet *SS,octet *CT);
+
+/** @brief Kyber KEM CCA decrypt
+ *
+    @param SK secret key
+	@param CT ciphertext
+	@param SS output session key 
+ */
+extern void KYBER768_decrypt(octet *SK,octet *CT,octet *SS);
+
+/** @brief Kyber KEM CCA key pair generation
+ *
+    @param r64 64 random bytes
+    @param SK secret key
+    @param PK public key
+
+ */
+extern void KYBER1024_keypair(byte *r64,octet *SK,octet *PK);
+
+/** @brief Kyber KEM CCA encrypt
+ *
+    @param r32 32 random bytes
+    @param PK public key
+	@param SS random session key generated
+	@param CT ciphertext
+
+ */
+extern void KYBER1024_encrypt(byte *r32,octet *PK,octet *SS,octet *CT);
+
+/** @brief Kyber KEM CCA decrypt
+ *
+    @param SK secret key
+	@param CT ciphertext
+	@param SS output session key 
+ */
+extern void KYBER1024_decrypt(octet *SK,octet *CT,octet *SS);
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/mpin.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/mpin.cpp
new file mode 100644
index 0000000..8261cf9
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/mpin.cpp
@@ -0,0 +1,229 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* MPIN 128-bit API Functions */
+
+/* Version 3.0  */
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include <time.h>
+#include "mpin_ZZZ.h"
+
+using namespace XXX;
+using namespace YYY;
+
+#define ROUNDUP(a,b) ((a)-1)/(b)+1
+
+/* Encode octet to curve point */
+void ZZZ::MPIN_ENCODE_TO_CURVE(octet *DST,octet *ID,octet *HCID)
+{
+    int j,k,m,L;
+    char okm[512],fd[256];
+    BIG q,r,w;
+    ECP P;
+    FP u;
+    DBIG dx;
+    octet OKM = {0,sizeof(okm),okm};
+    BIG_rcopy(q,Modulus);
+    k=BIG_nbits(q);
+    BIG_rcopy(r, CURVE_Order);
+    m=BIG_nbits(r);
+    L=ROUNDUP(k+ROUNDUP(m,2),8);
+    XMD_Expand(MC_SHA2,HASH_TYPE_ZZZ,&OKM,L,DST,ID);
+    for (j=0;j<L;j++)
+        fd[j]=OKM.val[j];
+        
+    BIG_dfromBytesLen(dx,fd,L);
+    BIG_dmod(w,dx,q);
+    FP_nres(&u,w);
+    ECP_map2point(&P,&u);
+    ECP_cfp(&P);
+    ECP_affine(&P);
+    ECP_toOctet(HCID, &P, false);
+}
+
+/* create random secret S */
+int ZZZ::MPIN_RANDOM_GENERATE(csprng *RNG, octet* S)
+{
+    BIG r, s;
+    BIG_rcopy(r, CURVE_Order);
+    BIG_randtrunc(s, r, 2 * CURVE_SECURITY_ZZZ, RNG);
+    BIG_toBytes(S->val, s);
+    S->len = MODBYTES_XXX;
+    return 0;
+}
+
+/* Extract PIN from TOKEN for identity CID */
+int ZZZ::MPIN_EXTRACT_PIN(octet *CID, int pin, octet *TOKEN)
+{
+    ECP P, R;
+    int res = 0;
+    pin %= MAXPIN;
+
+    if (!ECP_fromOctet(&P, TOKEN))  res = MPIN_INVALID_POINT;
+    if (res == 0)
+    {
+        if (!ECP_fromOctet(&R,CID)) res=MPIN_INVALID_POINT;
+    }
+    if (res==0)
+    {
+        ECP_pinmul(&R, pin, PBLEN);
+        ECP_sub(&P, &R);
+        ECP_toOctet(TOKEN, &P, false);
+    }
+    return res;
+}
+
+/* Implement step 2 on client side of MPin protocol - SEC=-(x+y)*SEC */
+int ZZZ::MPIN_CLIENT_2(octet *X, octet *Y, octet *SEC)
+{
+    BIG px, py, r;
+    ECP P;
+    int res = 0;
+    BIG_rcopy(r, CURVE_Order);
+    if (!ECP_fromOctet(&P, SEC)) res = MPIN_INVALID_POINT;
+    if (res == 0)
+    {
+        BIG_fromBytes(px, X->val);
+        BIG_fromBytes(py, Y->val);
+        BIG_add(px, px, py);
+        BIG_mod(px, r);
+        PAIR_G1mul(&P, px);
+        ECP_neg(&P);
+        ECP_toOctet(SEC, &P, false); /* change to TRUE for point compression */
+    }
+    return res;
+}
+
+/* Client secret CST=s*IDHTC where IDHTC is client ID hashed to a curve point, and s is the master secret */
+int ZZZ::MPIN_GET_CLIENT_SECRET(octet *S, octet *IDHTC, octet *CST)
+{
+    ECP P;
+    BIG s;
+    int res = 0;
+    BIG_fromBytes(s, S->val);
+    if (!ECP_fromOctet(&P, IDHTC)) res = MPIN_INVALID_POINT;
+  
+    if (res==0)
+    {
+        PAIR_G1mul(&P, s);
+        ECP_toOctet(CST, &P, false); /* change to TRUE for point compression */
+    }
+    return res;
+}
+
+/* Implement step 1 on client side of MPin protocol */
+int ZZZ::MPIN_CLIENT_1(octet *CID, csprng *RNG, octet *X, int pin, octet *TOKEN, octet *SEC, octet *xID)
+{
+    BIG r, x;
+    ECP P, T, W;
+    int res = 0;
+
+    BIG_rcopy(r, CURVE_Order);
+    if (RNG != NULL)
+    {
+        BIG_randtrunc(x, r, 2 * CURVE_SECURITY_ZZZ, RNG);
+        X->len = MODBYTES_XXX;
+        BIG_toBytes(X->val, x);
+    }
+    else
+        BIG_fromBytes(x, X->val);
+
+    if (!ECP_fromOctet(&P,CID)) res=MPIN_INVALID_POINT;
+
+    if (res==0)
+    {
+        if (!ECP_fromOctet(&T, TOKEN)) res = MPIN_INVALID_POINT;
+    }
+    if (res == 0)
+    {
+        pin %= MAXPIN;
+
+        ECP_copy(&W, &P);               // W=H(ID)
+        ECP_pinmul(&W, pin, PBLEN);     // W=alpha.H(ID)
+        ECP_add(&T, &W);                // T=Token+alpha.H(ID) = s.H(ID)
+        PAIR_G1mul(&P, x);              // P=x.H(ID)
+        ECP_toOctet(xID, &P, false);    // xID     /* change to TRUE for point compression */
+    }
+
+    if (res == 0)
+    {
+        ECP_toOctet(SEC, &T, false); // V    /* change to TRUE for point compression */
+    }
+    return res;
+}
+
+/* Extract Server Secret SST=S*Q where Q is fixed generator in G2 and S is master secret */
+int ZZZ::MPIN_GET_SERVER_SECRET(octet *S, octet *SST)
+{
+    BIG r, s;
+    ECP2 Q;
+    int res = 0;
+    BIG_rcopy(r, CURVE_Order);
+    ECP2_generator(&Q);
+    if (res == 0)
+    {
+        BIG_fromBytes(s, S->val);
+        PAIR_G2mul(&Q, s);
+        ECP2_toOctet(SST, &Q, false);
+    }
+    return res;
+}
+
+/* Implement M-Pin on server side */
+int ZZZ::MPIN_SERVER(octet *HID, octet *Y, octet *SST, octet *xID, octet *mSEC)
+{
+    BIG y;
+    FP12 g;
+    ECP2 Q, sQ;
+    ECP P, R;
+    int res = 0;
+
+    ECP2_generator(&Q);
+    if (!ECP2_fromOctet(&sQ, SST)) res = MPIN_INVALID_POINT;
+    if (res == 0)
+    {
+        if (!ECP_fromOctet(&R, xID))  res = MPIN_INVALID_POINT;
+    }
+    if (res == 0)
+    {
+        BIG_fromBytes(y, Y->val);
+        if (!ECP_fromOctet(&P, HID))  res = MPIN_INVALID_POINT;
+    }
+    if (res == 0)
+    {
+        PAIR_G1mul(&P, y); 
+        ECP_add(&P, &R); 
+        if (!ECP_fromOctet(&R, mSEC))  res = MPIN_INVALID_POINT; // V
+    }
+    if (res == 0)
+    {
+        PAIR_double_ate(&g, &Q, &R, &sQ, &P);
+        PAIR_fexp(&g);
+
+        if (!FP12_isunity(&g))
+        {
+            res = MPIN_BAD_PIN;
+        }
+    }
+    return res;
+}
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/mpin.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/mpin.h
new file mode 100644
index 0000000..2ed645d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/mpin.h
@@ -0,0 +1,136 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file mpin.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief M-Pin Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef MPIN_ZZZ_H
+#define MPIN_ZZZ_H
+
+#include "pair_ZZZ.h"
+//#include "pbc_support.h"
+
+using namespace core;
+
+
+namespace ZZZ {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define PGS_ZZZ MODBYTES_XXX  /**< MPIN Group Size */
+#define PFS_ZZZ MODBYTES_XXX  /**< MPIN Field Size */
+
+#define MPIN_OK             0   /**< Function completed without error */
+#define MPIN_INVALID_POINT  -14	/**< Point is NOT on the curve */
+#define MPIN_BAD_PIN        -19 /**< Bad PIN number entered */
+
+#define MAXPIN 10000         /**< max PIN */
+#define PBLEN 14             /**< max length of PIN in bits */
+
+//#define PAS_ZZZ 16        /**< MPIN Symmetric Key Size 128 bits */
+//#define HASH_TYPE_MPIN_ZZZ SHA256   /**< Choose Hash function */
+
+/* MPIN support functions */
+
+/* MPIN primitives */
+
+/**	@brief Encode a string to a curve point (in constant time)
+ *
+	@param DST is the Domain Separation Tag
+    @param ID is the input string
+    @param HID is the output point in G1
+*/
+void MPIN_ENCODE_TO_CURVE(octet *DST,octet *ID,octet *HID);
+
+/**	@brief Extract a PIN number from a client secret
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param pin is an input PIN number
+	@param CS is the client secret from which the PIN is to be extracted
+	@return 0 or an error code
+ */
+int MPIN_EXTRACT_PIN(octet *HID, int pin, octet *CS);
+
+/**	@brief Perform first pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param R is a pointer to a cryptographically secure random number generator
+	@param x an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param pin is the input PIN number
+	@param T is the input M-Pin token (the client secret with PIN portion removed)
+	@param S is the reconstructed client secret
+	@param U is output = x.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_1(octet *HID, csprng *R, octet *x, int pin, octet *T, octet *S, octet *U);
+/**	@brief Generate a random group element
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param S is the output random octet
+	@return 0 or an error code
+ */
+int MPIN_RANDOM_GENERATE(csprng *R, octet *S);
+/**	@brief Perform second pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param x an input, a locally generated random number
+	@param y an input random challenge from the server
+	@param V on output = -(x+y).V
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_2(octet *x, octet *y, octet *V);
+
+/**	@brief Perform final pass on the server side of the M-Pin protocol
+
+	@param HID is input H(ID), a hash of the client ID
+	@param y is the input server's randomly generated challenge
+	@param SS is the input server secret
+	@param U is input from the client = x.H(ID)
+	@param V is an input from the client
+	@return 0 or an error code
+ */
+int MPIN_SERVER(octet *HID, octet *y, octet *SS, octet *U, octet *V);
+
+/**	@brief Create a client secret in G1 from a master secret and the client ID
+ *
+	@param S is an input master secret
+	@param HID is the input client identity hashed to curve
+	@param CS is the full client secret = s.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_GET_CLIENT_SECRET(octet *S, octet *HID, octet *CS);
+
+/**	@brief Create a server secret in G2 from a master secret
+ *
+	@param S is an input master secret
+	@param SS is the server secret = s.Q where Q is a fixed generator of G2
+	@return 0 or an error code
+ */
+int MPIN_GET_SERVER_SECRET(octet *S, octet *SS);
+}
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/mpin192.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/mpin192.cpp
new file mode 100644
index 0000000..1aa6471
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/mpin192.cpp
@@ -0,0 +1,224 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* MPIN 192-bit API Functions */
+
+/* Version 3.0  */
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include <time.h>
+#include "mpin192_ZZZ.h"
+
+using namespace XXX;
+using namespace YYY;
+
+#define ROUNDUP(a,b) ((a)-1)/(b)+1
+
+void ZZZ::MPIN_ENCODE_TO_CURVE(octet *DST,octet *ID,octet *HCID)
+{
+    int j,k,m,L;
+    char okm[512],fd[256];
+    BIG q,r,w;
+    ECP P;
+    FP u;
+    DBIG dx;
+    octet OKM = {0,sizeof(okm),okm};
+    BIG_rcopy(q,Modulus);
+    k=BIG_nbits(q);
+    BIG_rcopy(r, CURVE_Order);
+    m=BIG_nbits(r);
+    L=ROUNDUP(k+ROUNDUP(m,2),8);
+    XMD_Expand(MC_SHA2,HASH_TYPE_ZZZ,&OKM,L,DST,ID);
+    for (j=0;j<L;j++)
+        fd[j]=OKM.val[j];
+        
+    BIG_dfromBytesLen(dx,fd,L);
+    BIG_dmod(w,dx,q);
+    FP_nres(&u,w);
+    ECP_map2point(&P,&u);
+    ECP_cfp(&P);
+    ECP_affine(&P);
+    ECP_toOctet(HCID, &P, false);
+}
+
+/* create random secret S */
+int ZZZ::MPIN_RANDOM_GENERATE(csprng *RNG, octet* S)
+{
+    BIG r, s;
+    BIG_rcopy(r, CURVE_Order);
+    BIG_randtrunc(s, r, 2 * CURVE_SECURITY_ZZZ, RNG);
+    BIG_toBytes(S->val, s);
+    S->len = MODBYTES_XXX;
+    return 0;
+}
+
+/* Extract PIN from TOKEN for identity CID */
+int ZZZ::MPIN_EXTRACT_PIN(octet *CID, int pin, octet *TOKEN)
+{
+    ECP P, R;
+    int res = 0;
+    pin %= MAXPIN;
+
+    if (!ECP_fromOctet(&P, TOKEN))  res = MPIN_INVALID_POINT;
+    if (res == 0)
+    {
+        if (!ECP_fromOctet(&R,CID)) res=MPIN_INVALID_POINT;
+    }
+    if (res==0)
+    {
+        ECP_pinmul(&R, pin, PBLEN);
+        ECP_sub(&P, &R);
+        ECP_toOctet(TOKEN, &P, false);
+    }
+    return res;
+}
+
+/* Implement step 2 on client side of MPin protocol - SEC=-(x+y)*SEC */
+int ZZZ::MPIN_CLIENT_2(octet *X, octet *Y, octet *SEC)
+{
+    BIG px, py, r;
+    ECP P;
+    int res = 0;
+    BIG_rcopy(r, CURVE_Order);
+    if (!ECP_fromOctet(&P, SEC)) res = MPIN_INVALID_POINT;
+    if (res == 0)
+    {
+        BIG_fromBytes(px, X->val);
+        BIG_fromBytes(py, Y->val);
+        BIG_add(px, px, py);
+        BIG_mod(px, r);
+        PAIR_G1mul(&P, px);
+        ECP_neg(&P);
+        ECP_toOctet(SEC, &P, false);
+    }
+    return res;
+}
+
+/* Client secret CST=s*IDHTC where IDHTC is client ID hashed to a curve point, and s is the master secret */
+int ZZZ::MPIN_GET_CLIENT_SECRET(octet *S, octet *IDHTC, octet *CST)
+{
+    ECP P;
+    BIG s;
+    int res = 0;
+    BIG_fromBytes(s, S->val);
+    if (!ECP_fromOctet(&P, IDHTC)) res = MPIN_INVALID_POINT;
+    if (res==0)
+    {
+        PAIR_G1mul(&P, s);
+        ECP_toOctet(CST, &P, false); /* change to TRUE for point compression */
+    }
+    return res;
+}
+
+/* Implement step 1 on client side of MPin protocol */
+int ZZZ::MPIN_CLIENT_1(octet *CID, csprng *RNG, octet *X, int pin, octet *TOKEN, octet *SEC, octet *xID)
+{
+    BIG r, x;
+    ECP P, T, W;
+    int res = 0;
+    BIG_rcopy(r, CURVE_Order);
+    if (RNG != NULL)
+    {
+        BIG_randtrunc(x, r, 2 * CURVE_SECURITY_ZZZ, RNG);
+        X->len = MODBYTES_XXX;
+        BIG_toBytes(X->val, x);
+    }
+    else
+        BIG_fromBytes(x, X->val);
+
+    if (!ECP_fromOctet(&P,CID)) res=MPIN_INVALID_POINT;
+
+    if (res==0)
+    {
+        if (!ECP_fromOctet(&T, TOKEN)) res = MPIN_INVALID_POINT;
+    }
+    if (res == 0)
+    {
+        pin %= MAXPIN;
+        ECP_copy(&W, &P);               // W=H(ID)
+        ECP_pinmul(&W, pin, PBLEN);         // W=alpha.H(ID)
+        ECP_add(&T, &W);                // T=Token+alpha.H(ID) = s.H(ID)
+        PAIR_G1mul(&P, x);              // P=x.H(ID)
+        ECP_toOctet(xID, &P, false); // xID
+    }
+
+    if (res == 0)
+    {
+        ECP_toOctet(SEC, &T, false); // V
+    }
+    return res;
+}
+
+/* Extract Server Secret SST=S*Q where Q is fixed generator in G2 and S is master secret */
+int ZZZ::MPIN_GET_SERVER_SECRET(octet *S, octet *SST)
+{
+    BIG r, s;
+    ECP4 Q;
+    int res = 0;
+    BIG_rcopy(r, CURVE_Order);
+    ECP4_generator(&Q);
+    if (res == 0)
+    {
+        BIG_fromBytes(s, S->val);
+        PAIR_G2mul(&Q, s);
+        ECP4_toOctet(SST, &Q, false);
+    }
+    return res;
+}
+
+/* Implement M-Pin on server side */
+int ZZZ::MPIN_SERVER(octet *HID, octet *Y, octet *SST, octet *xID, octet *mSEC)
+{
+    BIG y;
+    FP24 g;
+    ECP4 Q, sQ;
+    ECP P, R;
+    int res = 0;
+    ECP4_generator(&Q);
+
+    if (!ECP4_fromOctet(&sQ, SST)) res = MPIN_INVALID_POINT;
+    if (res == 0)
+    {
+        if (!ECP_fromOctet(&R, xID))  res = MPIN_INVALID_POINT;
+    }
+    if (res == 0)
+    {
+        BIG_fromBytes(y, Y->val);
+        if (!ECP_fromOctet(&P, HID))  res = MPIN_INVALID_POINT;
+    }
+    if (res == 0)
+    {
+        PAIR_G1mul(&P, y); // y(A+AT)
+        ECP_add(&P, &R); // x(A+AT)+y(A+T)
+        if (!ECP_fromOctet(&R, mSEC))  res = MPIN_INVALID_POINT; // V
+    }
+    if (res == 0)
+    {
+        PAIR_double_ate(&g, &Q, &R, &sQ, &P);
+        PAIR_fexp(&g);
+        if (!FP24_isunity(&g))
+        {
+            res = MPIN_BAD_PIN;
+        }
+    }
+    return res;
+}
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/mpin192.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/mpin192.h
new file mode 100644
index 0000000..6aac781
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/mpin192.h
@@ -0,0 +1,136 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file mpin.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief M-Pin Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef MPIN_ZZZ_H
+#define MPIN_ZZZ_H
+
+#include "pair4_ZZZ.h"
+//#include "pbc_support.h"
+
+using namespace core;
+
+
+namespace ZZZ {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define PGS_ZZZ MODBYTES_XXX  /**< MPIN Group Size */
+#define PFS_ZZZ MODBYTES_XXX  /**< MPIN Field Size */
+
+#define MPIN_OK             0   /**< Function completed without error */
+#define MPIN_INVALID_POINT  -14	/**< Point is NOT on the curve */
+#define MPIN_BAD_PIN        -19 /**< Bad PIN number entered */
+
+#define MAXPIN 10000         /**< max PIN */
+#define PBLEN 14             /**< max length of PIN in bits */
+
+//#define PAS_ZZZ 24        /**< MPIN Symmetric Key Size 192 bits  */
+//#define HASH_TYPE_MPIN_ZZZ SHA384   /**< Choose Hash function */
+
+/* MPIN support functions */
+
+/* MPIN primitives */
+
+/**	@brief Encode a string to a curve point (in constant time)
+ *
+	@param DST is the Domain Separation Tag
+    @param ID is the input string
+    @param HID is the output point in G1
+*/
+void MPIN_ENCODE_TO_CURVE(octet *DST,octet *ID,octet *HID);
+
+/**	@brief Extract a PIN number from a client secret
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param pin is an input PIN number
+	@param CS is the client secret from which the PIN is to be extracted
+	@return 0 or an error code
+ */
+int MPIN_EXTRACT_PIN(octet *HID, int pin, octet *CS);
+
+/**	@brief Perform first pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param R is a pointer to a cryptographically secure random number generator
+	@param x an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param pin is the input PIN number
+	@param T is the input M-Pin token (the client secret with PIN portion removed)
+	@param S is the reconstructed client secret
+	@param U is output = x.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_1(octet *HID, csprng *R, octet *x, int pin, octet *T, octet *S, octet *U);
+/**	@brief Generate a random group element
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param S is the output random octet
+	@return 0 or an error code
+ */
+int MPIN_RANDOM_GENERATE(csprng *R, octet *S);
+/**	@brief Perform second pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param x an input, a locally generated random number
+	@param y an input random challenge from the server
+	@param V on output = -(x+y).V
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_2(octet *x, octet *y, octet *V);
+
+/**	@brief Perform third pass on the server side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is input H(ID), a hash of the client ID
+	@param y is the input server's randomly generated challenge
+	@param SS is the input server secret
+	@param U is input from the client = x.H(ID)
+	@param V is an input from the client
+	@return 0 or an error code
+ */
+int MPIN_SERVER(octet *HID, octet *y, octet *SS, octet *U, octet *V);
+
+/**	@brief Create a client secret in G1 from a master secret and the client ID
+ *
+	@param S is an input master secret
+	@param HID is the input client identity hashed to point
+	@param CS is the full client secret = s.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_GET_CLIENT_SECRET(octet *S, octet *HID, octet *CS);
+
+/**	@brief Create a server secret in G2 from a master secret
+ *
+	@param S is an input master secret
+	@param SS is the server secret = s.Q where Q is a fixed generator of G2
+	@return 0 or an error code
+ */
+int MPIN_GET_SERVER_SECRET(octet *S, octet *SS);
+}
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/mpin192_BLS24479.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/mpin192_BLS24479.h
new file mode 100644
index 0000000..1656a0d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/mpin192_BLS24479.h
@@ -0,0 +1,136 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file mpin.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief M-Pin Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef MPIN_BLS24479_H
+#define MPIN_BLS24479_H
+
+#include "pair4_BLS24479.h"
+//#include "pbc_support.h"
+
+using namespace core;
+
+
+namespace BLS24479 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define PGS_BLS24479 MODBYTES_B480_56  /**< MPIN Group Size */
+#define PFS_BLS24479 MODBYTES_B480_56  /**< MPIN Field Size */
+
+#define MPIN_OK             0   /**< Function completed without error */
+#define MPIN_INVALID_POINT  -14	/**< Point is NOT on the curve */
+#define MPIN_BAD_PIN        -19 /**< Bad PIN number entered */
+
+#define MAXPIN 10000         /**< max PIN */
+#define PBLEN 14             /**< max length of PIN in bits */
+
+//#define PAS_BLS24479 24        /**< MPIN Symmetric Key Size 192 bits  */
+//#define HASH_TYPE_MPIN_BLS24479 SHA384   /**< Choose Hash function */
+
+/* MPIN support functions */
+
+/* MPIN primitives */
+
+/**	@brief Encode a string to a curve point (in constant time)
+ *
+	@param DST is the Domain Separation Tag
+    @param ID is the input string
+    @param HID is the output point in G1
+*/
+void MPIN_ENCODE_TO_CURVE(octet *DST,octet *ID,octet *HID);
+
+/**	@brief Extract a PIN number from a client secret
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param pin is an input PIN number
+	@param CS is the client secret from which the PIN is to be extracted
+	@return 0 or an error code
+ */
+int MPIN_EXTRACT_PIN(octet *HID, int pin, octet *CS);
+
+/**	@brief Perform first pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param R is a pointer to a cryptographically secure random number generator
+	@param x an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param pin is the input PIN number
+	@param T is the input M-Pin token (the client secret with PIN portion removed)
+	@param S is the reconstructed client secret
+	@param U is output = x.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_1(octet *HID, csprng *R, octet *x, int pin, octet *T, octet *S, octet *U);
+/**	@brief Generate a random group element
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param S is the output random octet
+	@return 0 or an error code
+ */
+int MPIN_RANDOM_GENERATE(csprng *R, octet *S);
+/**	@brief Perform second pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param x an input, a locally generated random number
+	@param y an input random challenge from the server
+	@param V on output = -(x+y).V
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_2(octet *x, octet *y, octet *V);
+
+/**	@brief Perform third pass on the server side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is input H(ID), a hash of the client ID
+	@param y is the input server's randomly generated challenge
+	@param SS is the input server secret
+	@param U is input from the client = x.H(ID)
+	@param V is an input from the client
+	@return 0 or an error code
+ */
+int MPIN_SERVER(octet *HID, octet *y, octet *SS, octet *U, octet *V);
+
+/**	@brief Create a client secret in G1 from a master secret and the client ID
+ *
+	@param S is an input master secret
+	@param HID is the input client identity hashed to point
+	@param CS is the full client secret = s.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_GET_CLIENT_SECRET(octet *S, octet *HID, octet *CS);
+
+/**	@brief Create a server secret in G2 from a master secret
+ *
+	@param S is an input master secret
+	@param SS is the server secret = s.Q where Q is a fixed generator of G2
+	@return 0 or an error code
+ */
+int MPIN_GET_SERVER_SECRET(octet *S, octet *SS);
+}
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/mpin256.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/mpin256.cpp
new file mode 100644
index 0000000..14230c6
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/mpin256.cpp
@@ -0,0 +1,224 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* MPIN 256-bit API Functions */
+
+/* Version 3.0  */
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include <time.h>
+#include "mpin256_ZZZ.h"
+
+using namespace XXX;
+using namespace YYY;
+
+#define ROUNDUP(a,b) ((a)-1)/(b)+1
+
+void ZZZ::MPIN_ENCODE_TO_CURVE(octet *DST,octet *ID,octet *HCID)
+{
+    int j,k,m,L;
+    char okm[512],fd[256];
+    BIG q,r,w;
+    ECP P;
+    FP u;
+    DBIG dx;
+    octet OKM = {0,sizeof(okm),okm};
+    BIG_rcopy(q,Modulus);
+    k=BIG_nbits(q);
+    BIG_rcopy(r, CURVE_Order);
+    m=BIG_nbits(r);
+    L=ROUNDUP(k+ROUNDUP(m,2),8);
+    XMD_Expand(MC_SHA2,HASH_TYPE_ZZZ,&OKM,L,DST,ID);
+    for (j=0;j<L;j++)
+        fd[j]=OKM.val[j];
+        
+    BIG_dfromBytesLen(dx,fd,L);
+    BIG_dmod(w,dx,q);
+    FP_nres(&u,w);
+    ECP_map2point(&P,&u);
+    ECP_cfp(&P);
+    ECP_affine(&P);
+    ECP_toOctet(HCID, &P, false);
+}
+
+/* create random secret S */
+int ZZZ::MPIN_RANDOM_GENERATE(csprng *RNG, octet* S)
+{
+    BIG r, s;
+
+    BIG_rcopy(r, CURVE_Order);
+    BIG_randtrunc(s, r, 2 * CURVE_SECURITY_ZZZ, RNG);
+    BIG_toBytes(S->val, s);
+    S->len = MODBYTES_XXX;
+    return 0;
+}
+
+/* Extract PIN from TOKEN for identity CID */
+int ZZZ::MPIN_EXTRACT_PIN(octet *CID, int pin, octet *TOKEN)
+{
+    ECP P, R;
+    int res = 0;
+    pin %= MAXPIN;
+    if (!ECP_fromOctet(&P, TOKEN))  res = MPIN_INVALID_POINT;
+    if (res == 0)
+    {
+        if (!ECP_fromOctet(&R,CID)) res=MPIN_INVALID_POINT;
+    }
+    if (res==0)
+    {
+        ECP_pinmul(&R, pin, PBLEN);
+        ECP_sub(&P, &R);
+        ECP_toOctet(TOKEN, &P, false);
+    }
+    return res;
+}
+
+/* Implement step 2 on client side of MPin protocol - SEC=-(x+y)*SEC */
+int ZZZ::MPIN_CLIENT_2(octet *X, octet *Y, octet *SEC)
+{
+    BIG px, py, r;
+    ECP P;
+    int res = 0;
+    BIG_rcopy(r, CURVE_Order);
+    if (!ECP_fromOctet(&P, SEC)) res = MPIN_INVALID_POINT;
+    if (res == 0)
+    {
+        BIG_fromBytes(px, X->val);
+        BIG_fromBytes(py, Y->val);
+        BIG_add(px, px, py);
+        BIG_mod(px, r);
+        PAIR_G1mul(&P, px);
+        ECP_neg(&P);
+        ECP_toOctet(SEC, &P, false);
+    }
+    return res;
+}
+
+/* Client secret CST=s*IDHTC where IDHTC is client ID hashed to a curve point, and s is the master secret */
+int ZZZ::MPIN_GET_CLIENT_SECRET(octet *S, octet *IDHTC, octet *CST)
+{
+    ECP P;
+    BIG s;
+    int res = 0;
+    BIG_fromBytes(s, S->val);
+    if (!ECP_fromOctet(&P, IDHTC)) res = MPIN_INVALID_POINT;
+    if (res==0)
+    {
+        PAIR_G1mul(&P, s);
+        ECP_toOctet(CST, &P, false); /* change to TRUE for point compression */
+    }
+    return res;
+}
+
+/* Implement step 1 on client side of MPin protocol */
+int ZZZ::MPIN_CLIENT_1(octet *CID, csprng *RNG, octet *X, int pin, octet *TOKEN, octet *SEC, octet *xID)
+{
+    BIG r, x;
+    ECP P, T, W;
+    int res = 0;
+    BIG_rcopy(r, CURVE_Order);
+    if (RNG != NULL)
+    {
+        BIG_randtrunc(x, r, 2 * CURVE_SECURITY_ZZZ, RNG);
+        X->len = MODBYTES_XXX;
+        BIG_toBytes(X->val, x);
+    }
+    else
+        BIG_fromBytes(x, X->val);
+
+    if (!ECP_fromOctet(&P,CID)) res=MPIN_INVALID_POINT;
+
+    if (res==0)
+    {    
+        if (!ECP_fromOctet(&T, TOKEN)) res = MPIN_INVALID_POINT;
+    }
+    if (res == 0)
+    {
+        pin %= MAXPIN;
+        ECP_copy(&W, &P);               // W=H(ID)
+        ECP_pinmul(&W, pin, PBLEN);         // W=alpha.H(ID)
+        ECP_add(&T, &W);                // T=Token+alpha.H(ID) = s.H(ID)
+        PAIR_G1mul(&P, x);              // P=x.H(ID)
+        ECP_toOctet(xID, &P, false); // xID
+    }
+    if (res == 0)
+    {
+        ECP_toOctet(SEC, &T, false); // V
+    }
+    return res;
+}
+
+/* Extract Server Secret SST=S*Q where Q is fixed generator in G2 and S is master secret */
+int ZZZ::MPIN_GET_SERVER_SECRET(octet *S, octet *SST)
+{
+    BIG r, s;
+    ECP8 Q;
+    int res = 0;
+    BIG_rcopy(r, CURVE_Order);
+    ECP8_generator(&Q);
+    if (res == 0)
+    {
+        BIG_fromBytes(s, S->val);
+        PAIR_G2mul(&Q, s);
+        ECP8_toOctet(SST, &Q, false);
+    }
+    return res;
+}
+
+/* Implement M-Pin on server side */
+int ZZZ::MPIN_SERVER(octet *HID, octet *Y, octet *SST, octet *xID, octet *mSEC)
+{
+    BIG y;
+    FP48 g;
+    ECP8 Q, sQ;
+    ECP P, R;
+    int res = 0;
+    ECP8_generator(&Q);
+
+    if (!ECP8_fromOctet(&sQ, SST)) res = MPIN_INVALID_POINT;
+
+    if (res == 0)
+    {
+        if (!ECP_fromOctet(&R, xID))  res = MPIN_INVALID_POINT;
+    }
+    if (res == 0)
+    {
+        BIG_fromBytes(y, Y->val);
+        if (!ECP_fromOctet(&P, HID))  res = MPIN_INVALID_POINT;
+    }
+    if (res == 0)
+    {
+        PAIR_G1mul(&P, y); // y(A+AT)
+        ECP_add(&P, &R); // x(A+AT)+y(A+T)
+        if (!ECP_fromOctet(&R, mSEC))  res = MPIN_INVALID_POINT; // V
+    }
+    if (res == 0)
+    {
+        PAIR_double_ate(&g, &Q, &R, &sQ, &P);
+        PAIR_fexp(&g);
+        if (!FP48_isunity(&g))
+        {
+            res = MPIN_BAD_PIN;
+        }
+    }
+    return res;
+}
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/mpin256.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/mpin256.h
new file mode 100644
index 0000000..0dfbbbb
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/mpin256.h
@@ -0,0 +1,133 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file mpin.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief M-Pin Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef MPIN_ZZZ_H
+#define MPIN_ZZZ_H
+
+#include "pair8_ZZZ.h"
+//#include "pbc_support.h"
+
+using namespace core;
+
+
+namespace ZZZ {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define PGS_ZZZ MODBYTES_XXX  /**< MPIN Group Size */
+#define PFS_ZZZ MODBYTES_XXX  /**< MPIN Field Size */
+
+#define MPIN_OK             0   /**< Function completed without error */
+#define MPIN_INVALID_POINT  -14	/**< Point is NOT on the curve */
+#define MPIN_BAD_PIN        -19 /**< Bad PIN number entered */
+
+#define MAXPIN 10000         /**< max PIN */
+#define PBLEN 14             /**< max length of PIN in bits */
+
+//#define PAS_ZZZ 24        /**< MPIN Symmetric Key Size 192 bits  */
+//#define HASH_TYPE_MPIN_ZZZ SHA384   /**< Choose Hash function */
+
+/* MPIN support functions */
+/* MPIN primitives */
+
+/**	@brief Encode a string to a curve point (in constant time)
+ *
+	@param DST is the Domain Separation Tag
+    @param ID is the input string
+    @param HCID is the output point in G1
+*/
+void MPIN_ENCODE_TO_CURVE(octet *DST,octet *ID,octet *HCID);
+
+/**	@brief Extract a PIN number from a client secret
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param pin is an input PIN number
+	@param CS is the client secret from which the PIN is to be extracted
+	@return 0 or an error code
+ */
+int MPIN_EXTRACT_PIN(octet *HID, int pin, octet *CS);
+
+/**	@brief Perform first pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param R is a pointer to a cryptographically secure random number generator
+	@param x an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param pin is the input PIN number
+	@param T is the input M-Pin token (the client secret with PIN portion removed)
+	@param S is output = CS+TP, where CS=is the reconstructed client secret, and TP is the time permit
+	@param U is output = x.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_1(octet *HID, csprng *R, octet *x, int pin, octet *T, octet *S, octet *U);
+/**	@brief Generate a random group element
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param S is the output random octet
+	@return 0 or an error code
+ */
+int MPIN_RANDOM_GENERATE(csprng *R, octet *S);
+/**	@brief Perform second pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param x an input, a locally generated random number
+	@param y an input random challenge from the server
+	@param V on output = -(x+y).V
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_2(octet *x, octet *y, octet *V);
+/**	@brief Perform third pass on the server side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is input H(ID), a hash of the client ID
+	@param y is the input server's randomly generated challenge
+	@param SS is the input server secret
+	@param U is input from the client = x.H(ID)
+	@param V is an input from the client
+	@return 0 or an error code
+ */
+int MPIN_SERVER(octet *HID, octet *y, octet *SS, octet *U, octet *V);
+/**	@brief Create a client secret in G1 from a master secret and the client ID
+ *
+	@param S is an input master secret
+	@param HID is the input client identity hashed to point
+	@param CS is the full client secret = s.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_GET_CLIENT_SECRET(octet *S, octet *HID, octet *CS);
+
+/**	@brief Create a server secret in G2 from a master secret
+ *
+	@param S is an input master secret
+	@param SS is the server secret = s.Q where Q is a fixed generator of G2
+	@return 0 or an error code
+ */
+int MPIN_GET_SERVER_SECRET(octet *S, octet *SS);
+}
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/mpin256_BLS48286.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/mpin256_BLS48286.h
new file mode 100644
index 0000000..127dd28
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/mpin256_BLS48286.h
@@ -0,0 +1,133 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file mpin.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief M-Pin Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef MPIN_BLS48286_H
+#define MPIN_BLS48286_H
+
+#include "pair8_BLS48286.h"
+//#include "pbc_support.h"
+
+using namespace core;
+
+
+namespace BLS48286 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define PGS_BLS48286 MODBYTES_B288_60  /**< MPIN Group Size */
+#define PFS_BLS48286 MODBYTES_B288_60  /**< MPIN Field Size */
+
+#define MPIN_OK             0   /**< Function completed without error */
+#define MPIN_INVALID_POINT  -14	/**< Point is NOT on the curve */
+#define MPIN_BAD_PIN        -19 /**< Bad PIN number entered */
+
+#define MAXPIN 10000         /**< max PIN */
+#define PBLEN 14             /**< max length of PIN in bits */
+
+//#define PAS_BLS48286 24        /**< MPIN Symmetric Key Size 192 bits  */
+//#define HASH_TYPE_MPIN_BLS48286 SHA384   /**< Choose Hash function */
+
+/* MPIN support functions */
+/* MPIN primitives */
+
+/**	@brief Encode a string to a curve point (in constant time)
+ *
+	@param DST is the Domain Separation Tag
+    @param ID is the input string
+    @param HCID is the output point in G1
+*/
+void MPIN_ENCODE_TO_CURVE(octet *DST,octet *ID,octet *HCID);
+
+/**	@brief Extract a PIN number from a client secret
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param pin is an input PIN number
+	@param CS is the client secret from which the PIN is to be extracted
+	@return 0 or an error code
+ */
+int MPIN_EXTRACT_PIN(octet *HID, int pin, octet *CS);
+
+/**	@brief Perform first pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param R is a pointer to a cryptographically secure random number generator
+	@param x an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param pin is the input PIN number
+	@param T is the input M-Pin token (the client secret with PIN portion removed)
+	@param S is output = CS+TP, where CS=is the reconstructed client secret, and TP is the time permit
+	@param U is output = x.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_1(octet *HID, csprng *R, octet *x, int pin, octet *T, octet *S, octet *U);
+/**	@brief Generate a random group element
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param S is the output random octet
+	@return 0 or an error code
+ */
+int MPIN_RANDOM_GENERATE(csprng *R, octet *S);
+/**	@brief Perform second pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param x an input, a locally generated random number
+	@param y an input random challenge from the server
+	@param V on output = -(x+y).V
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_2(octet *x, octet *y, octet *V);
+/**	@brief Perform third pass on the server side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is input H(ID), a hash of the client ID
+	@param y is the input server's randomly generated challenge
+	@param SS is the input server secret
+	@param U is input from the client = x.H(ID)
+	@param V is an input from the client
+	@return 0 or an error code
+ */
+int MPIN_SERVER(octet *HID, octet *y, octet *SS, octet *U, octet *V);
+/**	@brief Create a client secret in G1 from a master secret and the client ID
+ *
+	@param S is an input master secret
+	@param HID is the input client identity hashed to point
+	@param CS is the full client secret = s.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_GET_CLIENT_SECRET(octet *S, octet *HID, octet *CS);
+
+/**	@brief Create a server secret in G2 from a master secret
+ *
+	@param S is an input master secret
+	@param SS is the server secret = s.Q where Q is a fixed generator of G2
+	@return 0 or an error code
+ */
+int MPIN_GET_SERVER_SECRET(octet *S, octet *SS);
+}
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/mpin256_BLS48556.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/mpin256_BLS48556.h
new file mode 100644
index 0000000..46b77cd
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/mpin256_BLS48556.h
@@ -0,0 +1,133 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file mpin.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief M-Pin Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef MPIN_BLS48556_H
+#define MPIN_BLS48556_H
+
+#include "pair8_BLS48556.h"
+//#include "pbc_support.h"
+
+using namespace core;
+
+
+namespace BLS48556 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define PGS_BLS48556 MODBYTES_B560_58  /**< MPIN Group Size */
+#define PFS_BLS48556 MODBYTES_B560_58  /**< MPIN Field Size */
+
+#define MPIN_OK             0   /**< Function completed without error */
+#define MPIN_INVALID_POINT  -14	/**< Point is NOT on the curve */
+#define MPIN_BAD_PIN        -19 /**< Bad PIN number entered */
+
+#define MAXPIN 10000         /**< max PIN */
+#define PBLEN 14             /**< max length of PIN in bits */
+
+//#define PAS_BLS48556 24        /**< MPIN Symmetric Key Size 192 bits  */
+//#define HASH_TYPE_MPIN_BLS48556 SHA384   /**< Choose Hash function */
+
+/* MPIN support functions */
+/* MPIN primitives */
+
+/**	@brief Encode a string to a curve point (in constant time)
+ *
+	@param DST is the Domain Separation Tag
+    @param ID is the input string
+    @param HCID is the output point in G1
+*/
+void MPIN_ENCODE_TO_CURVE(octet *DST,octet *ID,octet *HCID);
+
+/**	@brief Extract a PIN number from a client secret
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param pin is an input PIN number
+	@param CS is the client secret from which the PIN is to be extracted
+	@return 0 or an error code
+ */
+int MPIN_EXTRACT_PIN(octet *HID, int pin, octet *CS);
+
+/**	@brief Perform first pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param R is a pointer to a cryptographically secure random number generator
+	@param x an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param pin is the input PIN number
+	@param T is the input M-Pin token (the client secret with PIN portion removed)
+	@param S is output = CS+TP, where CS=is the reconstructed client secret, and TP is the time permit
+	@param U is output = x.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_1(octet *HID, csprng *R, octet *x, int pin, octet *T, octet *S, octet *U);
+/**	@brief Generate a random group element
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param S is the output random octet
+	@return 0 or an error code
+ */
+int MPIN_RANDOM_GENERATE(csprng *R, octet *S);
+/**	@brief Perform second pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param x an input, a locally generated random number
+	@param y an input random challenge from the server
+	@param V on output = -(x+y).V
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_2(octet *x, octet *y, octet *V);
+/**	@brief Perform third pass on the server side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is input H(ID), a hash of the client ID
+	@param y is the input server's randomly generated challenge
+	@param SS is the input server secret
+	@param U is input from the client = x.H(ID)
+	@param V is an input from the client
+	@return 0 or an error code
+ */
+int MPIN_SERVER(octet *HID, octet *y, octet *SS, octet *U, octet *V);
+/**	@brief Create a client secret in G1 from a master secret and the client ID
+ *
+	@param S is an input master secret
+	@param HID is the input client identity hashed to point
+	@param CS is the full client secret = s.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_GET_CLIENT_SECRET(octet *S, octet *HID, octet *CS);
+
+/**	@brief Create a server secret in G2 from a master secret
+ *
+	@param S is an input master secret
+	@param SS is the server secret = s.Q where Q is a fixed generator of G2
+	@return 0 or an error code
+ */
+int MPIN_GET_SERVER_SECRET(octet *S, octet *SS);
+}
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/mpin256_BLS48581.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/mpin256_BLS48581.h
new file mode 100644
index 0000000..08ee9ad
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/mpin256_BLS48581.h
@@ -0,0 +1,133 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file mpin.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief M-Pin Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef MPIN_BLS48581_H
+#define MPIN_BLS48581_H
+
+#include "pair8_BLS48581.h"
+//#include "pbc_support.h"
+
+using namespace core;
+
+
+namespace BLS48581 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define PGS_BLS48581 MODBYTES_B584_60  /**< MPIN Group Size */
+#define PFS_BLS48581 MODBYTES_B584_60  /**< MPIN Field Size */
+
+#define MPIN_OK             0   /**< Function completed without error */
+#define MPIN_INVALID_POINT  -14	/**< Point is NOT on the curve */
+#define MPIN_BAD_PIN        -19 /**< Bad PIN number entered */
+
+#define MAXPIN 10000         /**< max PIN */
+#define PBLEN 14             /**< max length of PIN in bits */
+
+//#define PAS_BLS48581 24        /**< MPIN Symmetric Key Size 192 bits  */
+//#define HASH_TYPE_MPIN_BLS48581 SHA384   /**< Choose Hash function */
+
+/* MPIN support functions */
+/* MPIN primitives */
+
+/**	@brief Encode a string to a curve point (in constant time)
+ *
+	@param DST is the Domain Separation Tag
+    @param ID is the input string
+    @param HCID is the output point in G1
+*/
+void MPIN_ENCODE_TO_CURVE(octet *DST,octet *ID,octet *HCID);
+
+/**	@brief Extract a PIN number from a client secret
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param pin is an input PIN number
+	@param CS is the client secret from which the PIN is to be extracted
+	@return 0 or an error code
+ */
+int MPIN_EXTRACT_PIN(octet *HID, int pin, octet *CS);
+
+/**	@brief Perform first pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param R is a pointer to a cryptographically secure random number generator
+	@param x an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param pin is the input PIN number
+	@param T is the input M-Pin token (the client secret with PIN portion removed)
+	@param S is output = CS+TP, where CS=is the reconstructed client secret, and TP is the time permit
+	@param U is output = x.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_1(octet *HID, csprng *R, octet *x, int pin, octet *T, octet *S, octet *U);
+/**	@brief Generate a random group element
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param S is the output random octet
+	@return 0 or an error code
+ */
+int MPIN_RANDOM_GENERATE(csprng *R, octet *S);
+/**	@brief Perform second pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param x an input, a locally generated random number
+	@param y an input random challenge from the server
+	@param V on output = -(x+y).V
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_2(octet *x, octet *y, octet *V);
+/**	@brief Perform third pass on the server side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is input H(ID), a hash of the client ID
+	@param y is the input server's randomly generated challenge
+	@param SS is the input server secret
+	@param U is input from the client = x.H(ID)
+	@param V is an input from the client
+	@return 0 or an error code
+ */
+int MPIN_SERVER(octet *HID, octet *y, octet *SS, octet *U, octet *V);
+/**	@brief Create a client secret in G1 from a master secret and the client ID
+ *
+	@param S is an input master secret
+	@param HID is the input client identity hashed to point
+	@param CS is the full client secret = s.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_GET_CLIENT_SECRET(octet *S, octet *HID, octet *CS);
+
+/**	@brief Create a server secret in G2 from a master secret
+ *
+	@param S is an input master secret
+	@param SS is the server secret = s.Q where Q is a fixed generator of G2
+	@return 0 or an error code
+ */
+int MPIN_GET_SERVER_SECRET(octet *S, octet *SS);
+}
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/mpin_BLS12381.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/mpin_BLS12381.h
new file mode 100644
index 0000000..319c196
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/mpin_BLS12381.h
@@ -0,0 +1,136 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file mpin.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief M-Pin Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef MPIN_BLS12381_H
+#define MPIN_BLS12381_H
+
+#include "pair_BLS12381.h"
+//#include "pbc_support.h"
+
+using namespace core;
+
+
+namespace BLS12381 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define PGS_BLS12381 MODBYTES_B384_58  /**< MPIN Group Size */
+#define PFS_BLS12381 MODBYTES_B384_58  /**< MPIN Field Size */
+
+#define MPIN_OK             0   /**< Function completed without error */
+#define MPIN_INVALID_POINT  -14	/**< Point is NOT on the curve */
+#define MPIN_BAD_PIN        -19 /**< Bad PIN number entered */
+
+#define MAXPIN 10000         /**< max PIN */
+#define PBLEN 14             /**< max length of PIN in bits */
+
+//#define PAS_BLS12381 16        /**< MPIN Symmetric Key Size 128 bits */
+//#define HASH_TYPE_MPIN_BLS12381 SHA256   /**< Choose Hash function */
+
+/* MPIN support functions */
+
+/* MPIN primitives */
+
+/**	@brief Encode a string to a curve point (in constant time)
+ *
+	@param DST is the Domain Separation Tag
+    @param ID is the input string
+    @param HID is the output point in G1
+*/
+void MPIN_ENCODE_TO_CURVE(octet *DST,octet *ID,octet *HID);
+
+/**	@brief Extract a PIN number from a client secret
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param pin is an input PIN number
+	@param CS is the client secret from which the PIN is to be extracted
+	@return 0 or an error code
+ */
+int MPIN_EXTRACT_PIN(octet *HID, int pin, octet *CS);
+
+/**	@brief Perform first pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param R is a pointer to a cryptographically secure random number generator
+	@param x an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param pin is the input PIN number
+	@param T is the input M-Pin token (the client secret with PIN portion removed)
+	@param S is the reconstructed client secret
+	@param U is output = x.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_1(octet *HID, csprng *R, octet *x, int pin, octet *T, octet *S, octet *U);
+/**	@brief Generate a random group element
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param S is the output random octet
+	@return 0 or an error code
+ */
+int MPIN_RANDOM_GENERATE(csprng *R, octet *S);
+/**	@brief Perform second pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param x an input, a locally generated random number
+	@param y an input random challenge from the server
+	@param V on output = -(x+y).V
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_2(octet *x, octet *y, octet *V);
+
+/**	@brief Perform final pass on the server side of the M-Pin protocol
+
+	@param HID is input H(ID), a hash of the client ID
+	@param y is the input server's randomly generated challenge
+	@param SS is the input server secret
+	@param U is input from the client = x.H(ID)
+	@param V is an input from the client
+	@return 0 or an error code
+ */
+int MPIN_SERVER(octet *HID, octet *y, octet *SS, octet *U, octet *V);
+
+/**	@brief Create a client secret in G1 from a master secret and the client ID
+ *
+	@param S is an input master secret
+	@param HID is the input client identity hashed to curve
+	@param CS is the full client secret = s.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_GET_CLIENT_SECRET(octet *S, octet *HID, octet *CS);
+
+/**	@brief Create a server secret in G2 from a master secret
+ *
+	@param S is an input master secret
+	@param SS is the server secret = s.Q where Q is a fixed generator of G2
+	@return 0 or an error code
+ */
+int MPIN_GET_SERVER_SECRET(octet *S, octet *SS);
+}
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/mpin_BLS12383.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/mpin_BLS12383.h
new file mode 100644
index 0000000..4107a91
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/mpin_BLS12383.h
@@ -0,0 +1,136 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file mpin.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief M-Pin Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef MPIN_BLS12383_H
+#define MPIN_BLS12383_H
+
+#include "pair_BLS12383.h"
+//#include "pbc_support.h"
+
+using namespace core;
+
+
+namespace BLS12383 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define PGS_BLS12383 MODBYTES_B384_58  /**< MPIN Group Size */
+#define PFS_BLS12383 MODBYTES_B384_58  /**< MPIN Field Size */
+
+#define MPIN_OK             0   /**< Function completed without error */
+#define MPIN_INVALID_POINT  -14	/**< Point is NOT on the curve */
+#define MPIN_BAD_PIN        -19 /**< Bad PIN number entered */
+
+#define MAXPIN 10000         /**< max PIN */
+#define PBLEN 14             /**< max length of PIN in bits */
+
+//#define PAS_BLS12383 16        /**< MPIN Symmetric Key Size 128 bits */
+//#define HASH_TYPE_MPIN_BLS12383 SHA256   /**< Choose Hash function */
+
+/* MPIN support functions */
+
+/* MPIN primitives */
+
+/**	@brief Encode a string to a curve point (in constant time)
+ *
+	@param DST is the Domain Separation Tag
+    @param ID is the input string
+    @param HID is the output point in G1
+*/
+void MPIN_ENCODE_TO_CURVE(octet *DST,octet *ID,octet *HID);
+
+/**	@brief Extract a PIN number from a client secret
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param pin is an input PIN number
+	@param CS is the client secret from which the PIN is to be extracted
+	@return 0 or an error code
+ */
+int MPIN_EXTRACT_PIN(octet *HID, int pin, octet *CS);
+
+/**	@brief Perform first pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param R is a pointer to a cryptographically secure random number generator
+	@param x an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param pin is the input PIN number
+	@param T is the input M-Pin token (the client secret with PIN portion removed)
+	@param S is the reconstructed client secret
+	@param U is output = x.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_1(octet *HID, csprng *R, octet *x, int pin, octet *T, octet *S, octet *U);
+/**	@brief Generate a random group element
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param S is the output random octet
+	@return 0 or an error code
+ */
+int MPIN_RANDOM_GENERATE(csprng *R, octet *S);
+/**	@brief Perform second pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param x an input, a locally generated random number
+	@param y an input random challenge from the server
+	@param V on output = -(x+y).V
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_2(octet *x, octet *y, octet *V);
+
+/**	@brief Perform final pass on the server side of the M-Pin protocol
+
+	@param HID is input H(ID), a hash of the client ID
+	@param y is the input server's randomly generated challenge
+	@param SS is the input server secret
+	@param U is input from the client = x.H(ID)
+	@param V is an input from the client
+	@return 0 or an error code
+ */
+int MPIN_SERVER(octet *HID, octet *y, octet *SS, octet *U, octet *V);
+
+/**	@brief Create a client secret in G1 from a master secret and the client ID
+ *
+	@param S is an input master secret
+	@param HID is the input client identity hashed to curve
+	@param CS is the full client secret = s.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_GET_CLIENT_SECRET(octet *S, octet *HID, octet *CS);
+
+/**	@brief Create a server secret in G2 from a master secret
+ *
+	@param S is an input master secret
+	@param SS is the server secret = s.Q where Q is a fixed generator of G2
+	@return 0 or an error code
+ */
+int MPIN_GET_SERVER_SECRET(octet *S, octet *SS);
+}
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/mpin_BLS12443.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/mpin_BLS12443.h
new file mode 100644
index 0000000..c857955
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/mpin_BLS12443.h
@@ -0,0 +1,136 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file mpin.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief M-Pin Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef MPIN_BLS12443_H
+#define MPIN_BLS12443_H
+
+#include "pair_BLS12443.h"
+//#include "pbc_support.h"
+
+using namespace core;
+
+
+namespace BLS12443 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define PGS_BLS12443 MODBYTES_B448_60  /**< MPIN Group Size */
+#define PFS_BLS12443 MODBYTES_B448_60  /**< MPIN Field Size */
+
+#define MPIN_OK             0   /**< Function completed without error */
+#define MPIN_INVALID_POINT  -14	/**< Point is NOT on the curve */
+#define MPIN_BAD_PIN        -19 /**< Bad PIN number entered */
+
+#define MAXPIN 10000         /**< max PIN */
+#define PBLEN 14             /**< max length of PIN in bits */
+
+//#define PAS_BLS12443 16        /**< MPIN Symmetric Key Size 128 bits */
+//#define HASH_TYPE_MPIN_BLS12443 SHA256   /**< Choose Hash function */
+
+/* MPIN support functions */
+
+/* MPIN primitives */
+
+/**	@brief Encode a string to a curve point (in constant time)
+ *
+	@param DST is the Domain Separation Tag
+    @param ID is the input string
+    @param HID is the output point in G1
+*/
+void MPIN_ENCODE_TO_CURVE(octet *DST,octet *ID,octet *HID);
+
+/**	@brief Extract a PIN number from a client secret
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param pin is an input PIN number
+	@param CS is the client secret from which the PIN is to be extracted
+	@return 0 or an error code
+ */
+int MPIN_EXTRACT_PIN(octet *HID, int pin, octet *CS);
+
+/**	@brief Perform first pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param R is a pointer to a cryptographically secure random number generator
+	@param x an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param pin is the input PIN number
+	@param T is the input M-Pin token (the client secret with PIN portion removed)
+	@param S is the reconstructed client secret
+	@param U is output = x.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_1(octet *HID, csprng *R, octet *x, int pin, octet *T, octet *S, octet *U);
+/**	@brief Generate a random group element
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param S is the output random octet
+	@return 0 or an error code
+ */
+int MPIN_RANDOM_GENERATE(csprng *R, octet *S);
+/**	@brief Perform second pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param x an input, a locally generated random number
+	@param y an input random challenge from the server
+	@param V on output = -(x+y).V
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_2(octet *x, octet *y, octet *V);
+
+/**	@brief Perform final pass on the server side of the M-Pin protocol
+
+	@param HID is input H(ID), a hash of the client ID
+	@param y is the input server's randomly generated challenge
+	@param SS is the input server secret
+	@param U is input from the client = x.H(ID)
+	@param V is an input from the client
+	@return 0 or an error code
+ */
+int MPIN_SERVER(octet *HID, octet *y, octet *SS, octet *U, octet *V);
+
+/**	@brief Create a client secret in G1 from a master secret and the client ID
+ *
+	@param S is an input master secret
+	@param HID is the input client identity hashed to curve
+	@param CS is the full client secret = s.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_GET_CLIENT_SECRET(octet *S, octet *HID, octet *CS);
+
+/**	@brief Create a server secret in G2 from a master secret
+ *
+	@param S is an input master secret
+	@param SS is the server secret = s.Q where Q is a fixed generator of G2
+	@return 0 or an error code
+ */
+int MPIN_GET_SERVER_SECRET(octet *S, octet *SS);
+}
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/mpin_BLS12461.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/mpin_BLS12461.h
new file mode 100644
index 0000000..8491e09
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/mpin_BLS12461.h
@@ -0,0 +1,136 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file mpin.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief M-Pin Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef MPIN_BLS12461_H
+#define MPIN_BLS12461_H
+
+#include "pair_BLS12461.h"
+//#include "pbc_support.h"
+
+using namespace core;
+
+
+namespace BLS12461 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define PGS_BLS12461 MODBYTES_B464_60  /**< MPIN Group Size */
+#define PFS_BLS12461 MODBYTES_B464_60  /**< MPIN Field Size */
+
+#define MPIN_OK             0   /**< Function completed without error */
+#define MPIN_INVALID_POINT  -14	/**< Point is NOT on the curve */
+#define MPIN_BAD_PIN        -19 /**< Bad PIN number entered */
+
+#define MAXPIN 10000         /**< max PIN */
+#define PBLEN 14             /**< max length of PIN in bits */
+
+//#define PAS_BLS12461 16        /**< MPIN Symmetric Key Size 128 bits */
+//#define HASH_TYPE_MPIN_BLS12461 SHA256   /**< Choose Hash function */
+
+/* MPIN support functions */
+
+/* MPIN primitives */
+
+/**	@brief Encode a string to a curve point (in constant time)
+ *
+	@param DST is the Domain Separation Tag
+    @param ID is the input string
+    @param HID is the output point in G1
+*/
+void MPIN_ENCODE_TO_CURVE(octet *DST,octet *ID,octet *HID);
+
+/**	@brief Extract a PIN number from a client secret
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param pin is an input PIN number
+	@param CS is the client secret from which the PIN is to be extracted
+	@return 0 or an error code
+ */
+int MPIN_EXTRACT_PIN(octet *HID, int pin, octet *CS);
+
+/**	@brief Perform first pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param R is a pointer to a cryptographically secure random number generator
+	@param x an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param pin is the input PIN number
+	@param T is the input M-Pin token (the client secret with PIN portion removed)
+	@param S is the reconstructed client secret
+	@param U is output = x.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_1(octet *HID, csprng *R, octet *x, int pin, octet *T, octet *S, octet *U);
+/**	@brief Generate a random group element
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param S is the output random octet
+	@return 0 or an error code
+ */
+int MPIN_RANDOM_GENERATE(csprng *R, octet *S);
+/**	@brief Perform second pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param x an input, a locally generated random number
+	@param y an input random challenge from the server
+	@param V on output = -(x+y).V
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_2(octet *x, octet *y, octet *V);
+
+/**	@brief Perform final pass on the server side of the M-Pin protocol
+
+	@param HID is input H(ID), a hash of the client ID
+	@param y is the input server's randomly generated challenge
+	@param SS is the input server secret
+	@param U is input from the client = x.H(ID)
+	@param V is an input from the client
+	@return 0 or an error code
+ */
+int MPIN_SERVER(octet *HID, octet *y, octet *SS, octet *U, octet *V);
+
+/**	@brief Create a client secret in G1 from a master secret and the client ID
+ *
+	@param S is an input master secret
+	@param HID is the input client identity hashed to curve
+	@param CS is the full client secret = s.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_GET_CLIENT_SECRET(octet *S, octet *HID, octet *CS);
+
+/**	@brief Create a server secret in G2 from a master secret
+ *
+	@param S is an input master secret
+	@param SS is the server secret = s.Q where Q is a fixed generator of G2
+	@return 0 or an error code
+ */
+int MPIN_GET_SERVER_SECRET(octet *S, octet *SS);
+}
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/mpin_BN158.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/mpin_BN158.h
new file mode 100644
index 0000000..e10f187
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/mpin_BN158.h
@@ -0,0 +1,136 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file mpin.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief M-Pin Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef MPIN_BN158_H
+#define MPIN_BN158_H
+
+#include "pair_BN158.h"
+//#include "pbc_support.h"
+
+using namespace core;
+
+
+namespace BN158 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define PGS_BN158 MODBYTES_B160_56  /**< MPIN Group Size */
+#define PFS_BN158 MODBYTES_B160_56  /**< MPIN Field Size */
+
+#define MPIN_OK             0   /**< Function completed without error */
+#define MPIN_INVALID_POINT  -14	/**< Point is NOT on the curve */
+#define MPIN_BAD_PIN        -19 /**< Bad PIN number entered */
+
+#define MAXPIN 10000         /**< max PIN */
+#define PBLEN 14             /**< max length of PIN in bits */
+
+//#define PAS_BN158 16        /**< MPIN Symmetric Key Size 128 bits */
+//#define HASH_TYPE_MPIN_BN158 SHA256   /**< Choose Hash function */
+
+/* MPIN support functions */
+
+/* MPIN primitives */
+
+/**	@brief Encode a string to a curve point (in constant time)
+ *
+	@param DST is the Domain Separation Tag
+    @param ID is the input string
+    @param HID is the output point in G1
+*/
+void MPIN_ENCODE_TO_CURVE(octet *DST,octet *ID,octet *HID);
+
+/**	@brief Extract a PIN number from a client secret
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param pin is an input PIN number
+	@param CS is the client secret from which the PIN is to be extracted
+	@return 0 or an error code
+ */
+int MPIN_EXTRACT_PIN(octet *HID, int pin, octet *CS);
+
+/**	@brief Perform first pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param R is a pointer to a cryptographically secure random number generator
+	@param x an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param pin is the input PIN number
+	@param T is the input M-Pin token (the client secret with PIN portion removed)
+	@param S is the reconstructed client secret
+	@param U is output = x.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_1(octet *HID, csprng *R, octet *x, int pin, octet *T, octet *S, octet *U);
+/**	@brief Generate a random group element
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param S is the output random octet
+	@return 0 or an error code
+ */
+int MPIN_RANDOM_GENERATE(csprng *R, octet *S);
+/**	@brief Perform second pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param x an input, a locally generated random number
+	@param y an input random challenge from the server
+	@param V on output = -(x+y).V
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_2(octet *x, octet *y, octet *V);
+
+/**	@brief Perform final pass on the server side of the M-Pin protocol
+
+	@param HID is input H(ID), a hash of the client ID
+	@param y is the input server's randomly generated challenge
+	@param SS is the input server secret
+	@param U is input from the client = x.H(ID)
+	@param V is an input from the client
+	@return 0 or an error code
+ */
+int MPIN_SERVER(octet *HID, octet *y, octet *SS, octet *U, octet *V);
+
+/**	@brief Create a client secret in G1 from a master secret and the client ID
+ *
+	@param S is an input master secret
+	@param HID is the input client identity hashed to curve
+	@param CS is the full client secret = s.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_GET_CLIENT_SECRET(octet *S, octet *HID, octet *CS);
+
+/**	@brief Create a server secret in G2 from a master secret
+ *
+	@param S is an input master secret
+	@param SS is the server secret = s.Q where Q is a fixed generator of G2
+	@return 0 or an error code
+ */
+int MPIN_GET_SERVER_SECRET(octet *S, octet *SS);
+}
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/mpin_BN254.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/mpin_BN254.h
new file mode 100644
index 0000000..df3682a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/mpin_BN254.h
@@ -0,0 +1,136 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file mpin.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief M-Pin Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef MPIN_BN254_H
+#define MPIN_BN254_H
+
+#include "pair_BN254.h"
+//#include "pbc_support.h"
+
+using namespace core;
+
+
+namespace BN254 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define PGS_BN254 MODBYTES_B256_56  /**< MPIN Group Size */
+#define PFS_BN254 MODBYTES_B256_56  /**< MPIN Field Size */
+
+#define MPIN_OK             0   /**< Function completed without error */
+#define MPIN_INVALID_POINT  -14	/**< Point is NOT on the curve */
+#define MPIN_BAD_PIN        -19 /**< Bad PIN number entered */
+
+#define MAXPIN 10000         /**< max PIN */
+#define PBLEN 14             /**< max length of PIN in bits */
+
+//#define PAS_BN254 16        /**< MPIN Symmetric Key Size 128 bits */
+//#define HASH_TYPE_MPIN_BN254 SHA256   /**< Choose Hash function */
+
+/* MPIN support functions */
+
+/* MPIN primitives */
+
+/**	@brief Encode a string to a curve point (in constant time)
+ *
+	@param DST is the Domain Separation Tag
+    @param ID is the input string
+    @param HID is the output point in G1
+*/
+void MPIN_ENCODE_TO_CURVE(octet *DST,octet *ID,octet *HID);
+
+/**	@brief Extract a PIN number from a client secret
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param pin is an input PIN number
+	@param CS is the client secret from which the PIN is to be extracted
+	@return 0 or an error code
+ */
+int MPIN_EXTRACT_PIN(octet *HID, int pin, octet *CS);
+
+/**	@brief Perform first pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param R is a pointer to a cryptographically secure random number generator
+	@param x an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param pin is the input PIN number
+	@param T is the input M-Pin token (the client secret with PIN portion removed)
+	@param S is the reconstructed client secret
+	@param U is output = x.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_1(octet *HID, csprng *R, octet *x, int pin, octet *T, octet *S, octet *U);
+/**	@brief Generate a random group element
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param S is the output random octet
+	@return 0 or an error code
+ */
+int MPIN_RANDOM_GENERATE(csprng *R, octet *S);
+/**	@brief Perform second pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param x an input, a locally generated random number
+	@param y an input random challenge from the server
+	@param V on output = -(x+y).V
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_2(octet *x, octet *y, octet *V);
+
+/**	@brief Perform final pass on the server side of the M-Pin protocol
+
+	@param HID is input H(ID), a hash of the client ID
+	@param y is the input server's randomly generated challenge
+	@param SS is the input server secret
+	@param U is input from the client = x.H(ID)
+	@param V is an input from the client
+	@return 0 or an error code
+ */
+int MPIN_SERVER(octet *HID, octet *y, octet *SS, octet *U, octet *V);
+
+/**	@brief Create a client secret in G1 from a master secret and the client ID
+ *
+	@param S is an input master secret
+	@param HID is the input client identity hashed to curve
+	@param CS is the full client secret = s.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_GET_CLIENT_SECRET(octet *S, octet *HID, octet *CS);
+
+/**	@brief Create a server secret in G2 from a master secret
+ *
+	@param S is an input master secret
+	@param SS is the server secret = s.Q where Q is a fixed generator of G2
+	@return 0 or an error code
+ */
+int MPIN_GET_SERVER_SECRET(octet *S, octet *SS);
+}
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/mpin_BN254CX.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/mpin_BN254CX.h
new file mode 100644
index 0000000..0418b17
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/mpin_BN254CX.h
@@ -0,0 +1,136 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file mpin.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief M-Pin Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef MPIN_BN254CX_H
+#define MPIN_BN254CX_H
+
+#include "pair_BN254CX.h"
+//#include "pbc_support.h"
+
+using namespace core;
+
+
+namespace BN254CX {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define PGS_BN254CX MODBYTES_B256_56  /**< MPIN Group Size */
+#define PFS_BN254CX MODBYTES_B256_56  /**< MPIN Field Size */
+
+#define MPIN_OK             0   /**< Function completed without error */
+#define MPIN_INVALID_POINT  -14	/**< Point is NOT on the curve */
+#define MPIN_BAD_PIN        -19 /**< Bad PIN number entered */
+
+#define MAXPIN 10000         /**< max PIN */
+#define PBLEN 14             /**< max length of PIN in bits */
+
+//#define PAS_BN254CX 16        /**< MPIN Symmetric Key Size 128 bits */
+//#define HASH_TYPE_MPIN_BN254CX SHA256   /**< Choose Hash function */
+
+/* MPIN support functions */
+
+/* MPIN primitives */
+
+/**	@brief Encode a string to a curve point (in constant time)
+ *
+	@param DST is the Domain Separation Tag
+    @param ID is the input string
+    @param HID is the output point in G1
+*/
+void MPIN_ENCODE_TO_CURVE(octet *DST,octet *ID,octet *HID);
+
+/**	@brief Extract a PIN number from a client secret
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param pin is an input PIN number
+	@param CS is the client secret from which the PIN is to be extracted
+	@return 0 or an error code
+ */
+int MPIN_EXTRACT_PIN(octet *HID, int pin, octet *CS);
+
+/**	@brief Perform first pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param R is a pointer to a cryptographically secure random number generator
+	@param x an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param pin is the input PIN number
+	@param T is the input M-Pin token (the client secret with PIN portion removed)
+	@param S is the reconstructed client secret
+	@param U is output = x.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_1(octet *HID, csprng *R, octet *x, int pin, octet *T, octet *S, octet *U);
+/**	@brief Generate a random group element
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param S is the output random octet
+	@return 0 or an error code
+ */
+int MPIN_RANDOM_GENERATE(csprng *R, octet *S);
+/**	@brief Perform second pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param x an input, a locally generated random number
+	@param y an input random challenge from the server
+	@param V on output = -(x+y).V
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_2(octet *x, octet *y, octet *V);
+
+/**	@brief Perform final pass on the server side of the M-Pin protocol
+
+	@param HID is input H(ID), a hash of the client ID
+	@param y is the input server's randomly generated challenge
+	@param SS is the input server secret
+	@param U is input from the client = x.H(ID)
+	@param V is an input from the client
+	@return 0 or an error code
+ */
+int MPIN_SERVER(octet *HID, octet *y, octet *SS, octet *U, octet *V);
+
+/**	@brief Create a client secret in G1 from a master secret and the client ID
+ *
+	@param S is an input master secret
+	@param HID is the input client identity hashed to curve
+	@param CS is the full client secret = s.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_GET_CLIENT_SECRET(octet *S, octet *HID, octet *CS);
+
+/**	@brief Create a server secret in G2 from a master secret
+ *
+	@param S is an input master secret
+	@param SS is the server secret = s.Q where Q is a fixed generator of G2
+	@return 0 or an error code
+ */
+int MPIN_GET_SERVER_SECRET(octet *S, octet *SS);
+}
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/mpin_BN462.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/mpin_BN462.h
new file mode 100644
index 0000000..ae70918
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/mpin_BN462.h
@@ -0,0 +1,136 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file mpin.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief M-Pin Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef MPIN_BN462_H
+#define MPIN_BN462_H
+
+#include "pair_BN462.h"
+//#include "pbc_support.h"
+
+using namespace core;
+
+
+namespace BN462 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define PGS_BN462 MODBYTES_B464_60  /**< MPIN Group Size */
+#define PFS_BN462 MODBYTES_B464_60  /**< MPIN Field Size */
+
+#define MPIN_OK             0   /**< Function completed without error */
+#define MPIN_INVALID_POINT  -14	/**< Point is NOT on the curve */
+#define MPIN_BAD_PIN        -19 /**< Bad PIN number entered */
+
+#define MAXPIN 10000         /**< max PIN */
+#define PBLEN 14             /**< max length of PIN in bits */
+
+//#define PAS_BN462 16        /**< MPIN Symmetric Key Size 128 bits */
+//#define HASH_TYPE_MPIN_BN462 SHA256   /**< Choose Hash function */
+
+/* MPIN support functions */
+
+/* MPIN primitives */
+
+/**	@brief Encode a string to a curve point (in constant time)
+ *
+	@param DST is the Domain Separation Tag
+    @param ID is the input string
+    @param HID is the output point in G1
+*/
+void MPIN_ENCODE_TO_CURVE(octet *DST,octet *ID,octet *HID);
+
+/**	@brief Extract a PIN number from a client secret
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param pin is an input PIN number
+	@param CS is the client secret from which the PIN is to be extracted
+	@return 0 or an error code
+ */
+int MPIN_EXTRACT_PIN(octet *HID, int pin, octet *CS);
+
+/**	@brief Perform first pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param R is a pointer to a cryptographically secure random number generator
+	@param x an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param pin is the input PIN number
+	@param T is the input M-Pin token (the client secret with PIN portion removed)
+	@param S is the reconstructed client secret
+	@param U is output = x.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_1(octet *HID, csprng *R, octet *x, int pin, octet *T, octet *S, octet *U);
+/**	@brief Generate a random group element
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param S is the output random octet
+	@return 0 or an error code
+ */
+int MPIN_RANDOM_GENERATE(csprng *R, octet *S);
+/**	@brief Perform second pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param x an input, a locally generated random number
+	@param y an input random challenge from the server
+	@param V on output = -(x+y).V
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_2(octet *x, octet *y, octet *V);
+
+/**	@brief Perform final pass on the server side of the M-Pin protocol
+
+	@param HID is input H(ID), a hash of the client ID
+	@param y is the input server's randomly generated challenge
+	@param SS is the input server secret
+	@param U is input from the client = x.H(ID)
+	@param V is an input from the client
+	@return 0 or an error code
+ */
+int MPIN_SERVER(octet *HID, octet *y, octet *SS, octet *U, octet *V);
+
+/**	@brief Create a client secret in G1 from a master secret and the client ID
+ *
+	@param S is an input master secret
+	@param HID is the input client identity hashed to curve
+	@param CS is the full client secret = s.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_GET_CLIENT_SECRET(octet *S, octet *HID, octet *CS);
+
+/**	@brief Create a server secret in G2 from a master secret
+ *
+	@param S is an input master secret
+	@param SS is the server secret = s.Q where Q is a fixed generator of G2
+	@return 0 or an error code
+ */
+int MPIN_GET_SERVER_SECRET(octet *S, octet *SS);
+}
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/mpin_FP256BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/mpin_FP256BN.h
new file mode 100644
index 0000000..19a4d81
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/mpin_FP256BN.h
@@ -0,0 +1,136 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file mpin.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief M-Pin Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef MPIN_FP256BN_H
+#define MPIN_FP256BN_H
+
+#include "pair_FP256BN.h"
+//#include "pbc_support.h"
+
+using namespace core;
+
+
+namespace FP256BN {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define PGS_FP256BN MODBYTES_B256_56  /**< MPIN Group Size */
+#define PFS_FP256BN MODBYTES_B256_56  /**< MPIN Field Size */
+
+#define MPIN_OK             0   /**< Function completed without error */
+#define MPIN_INVALID_POINT  -14	/**< Point is NOT on the curve */
+#define MPIN_BAD_PIN        -19 /**< Bad PIN number entered */
+
+#define MAXPIN 10000         /**< max PIN */
+#define PBLEN 14             /**< max length of PIN in bits */
+
+//#define PAS_FP256BN 16        /**< MPIN Symmetric Key Size 128 bits */
+//#define HASH_TYPE_MPIN_FP256BN SHA256   /**< Choose Hash function */
+
+/* MPIN support functions */
+
+/* MPIN primitives */
+
+/**	@brief Encode a string to a curve point (in constant time)
+ *
+	@param DST is the Domain Separation Tag
+    @param ID is the input string
+    @param HID is the output point in G1
+*/
+void MPIN_ENCODE_TO_CURVE(octet *DST,octet *ID,octet *HID);
+
+/**	@brief Extract a PIN number from a client secret
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param pin is an input PIN number
+	@param CS is the client secret from which the PIN is to be extracted
+	@return 0 or an error code
+ */
+int MPIN_EXTRACT_PIN(octet *HID, int pin, octet *CS);
+
+/**	@brief Perform first pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param R is a pointer to a cryptographically secure random number generator
+	@param x an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param pin is the input PIN number
+	@param T is the input M-Pin token (the client secret with PIN portion removed)
+	@param S is the reconstructed client secret
+	@param U is output = x.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_1(octet *HID, csprng *R, octet *x, int pin, octet *T, octet *S, octet *U);
+/**	@brief Generate a random group element
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param S is the output random octet
+	@return 0 or an error code
+ */
+int MPIN_RANDOM_GENERATE(csprng *R, octet *S);
+/**	@brief Perform second pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param x an input, a locally generated random number
+	@param y an input random challenge from the server
+	@param V on output = -(x+y).V
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_2(octet *x, octet *y, octet *V);
+
+/**	@brief Perform final pass on the server side of the M-Pin protocol
+
+	@param HID is input H(ID), a hash of the client ID
+	@param y is the input server's randomly generated challenge
+	@param SS is the input server secret
+	@param U is input from the client = x.H(ID)
+	@param V is an input from the client
+	@return 0 or an error code
+ */
+int MPIN_SERVER(octet *HID, octet *y, octet *SS, octet *U, octet *V);
+
+/**	@brief Create a client secret in G1 from a master secret and the client ID
+ *
+	@param S is an input master secret
+	@param HID is the input client identity hashed to curve
+	@param CS is the full client secret = s.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_GET_CLIENT_SECRET(octet *S, octet *HID, octet *CS);
+
+/**	@brief Create a server secret in G2 from a master secret
+ *
+	@param S is an input master secret
+	@param SS is the server secret = s.Q where Q is a fixed generator of G2
+	@return 0 or an error code
+ */
+int MPIN_GET_SERVER_SECRET(octet *S, octet *SS);
+}
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/mpin_FP512BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/mpin_FP512BN.h
new file mode 100644
index 0000000..f21ac4c
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/mpin_FP512BN.h
@@ -0,0 +1,136 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file mpin.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief M-Pin Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef MPIN_FP512BN_H
+#define MPIN_FP512BN_H
+
+#include "pair_FP512BN.h"
+//#include "pbc_support.h"
+
+using namespace core;
+
+
+namespace FP512BN {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define PGS_FP512BN MODBYTES_B512_60  /**< MPIN Group Size */
+#define PFS_FP512BN MODBYTES_B512_60  /**< MPIN Field Size */
+
+#define MPIN_OK             0   /**< Function completed without error */
+#define MPIN_INVALID_POINT  -14	/**< Point is NOT on the curve */
+#define MPIN_BAD_PIN        -19 /**< Bad PIN number entered */
+
+#define MAXPIN 10000         /**< max PIN */
+#define PBLEN 14             /**< max length of PIN in bits */
+
+//#define PAS_FP512BN 16        /**< MPIN Symmetric Key Size 128 bits */
+//#define HASH_TYPE_MPIN_FP512BN SHA256   /**< Choose Hash function */
+
+/* MPIN support functions */
+
+/* MPIN primitives */
+
+/**	@brief Encode a string to a curve point (in constant time)
+ *
+	@param DST is the Domain Separation Tag
+    @param ID is the input string
+    @param HID is the output point in G1
+*/
+void MPIN_ENCODE_TO_CURVE(octet *DST,octet *ID,octet *HID);
+
+/**	@brief Extract a PIN number from a client secret
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param pin is an input PIN number
+	@param CS is the client secret from which the PIN is to be extracted
+	@return 0 or an error code
+ */
+int MPIN_EXTRACT_PIN(octet *HID, int pin, octet *CS);
+
+/**	@brief Perform first pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param R is a pointer to a cryptographically secure random number generator
+	@param x an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param pin is the input PIN number
+	@param T is the input M-Pin token (the client secret with PIN portion removed)
+	@param S is the reconstructed client secret
+	@param U is output = x.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_1(octet *HID, csprng *R, octet *x, int pin, octet *T, octet *S, octet *U);
+/**	@brief Generate a random group element
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param S is the output random octet
+	@return 0 or an error code
+ */
+int MPIN_RANDOM_GENERATE(csprng *R, octet *S);
+/**	@brief Perform second pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param x an input, a locally generated random number
+	@param y an input random challenge from the server
+	@param V on output = -(x+y).V
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_2(octet *x, octet *y, octet *V);
+
+/**	@brief Perform final pass on the server side of the M-Pin protocol
+
+	@param HID is input H(ID), a hash of the client ID
+	@param y is the input server's randomly generated challenge
+	@param SS is the input server secret
+	@param U is input from the client = x.H(ID)
+	@param V is an input from the client
+	@return 0 or an error code
+ */
+int MPIN_SERVER(octet *HID, octet *y, octet *SS, octet *U, octet *V);
+
+/**	@brief Create a client secret in G1 from a master secret and the client ID
+ *
+	@param S is an input master secret
+	@param HID is the input client identity hashed to curve
+	@param CS is the full client secret = s.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_GET_CLIENT_SECRET(octet *S, octet *HID, octet *CS);
+
+/**	@brief Create a server secret in G2 from a master secret
+ *
+	@param S is an input master secret
+	@param SS is the server secret = s.Q where Q is a fixed generator of G2
+	@return 0 or an error code
+ */
+int MPIN_GET_SERVER_SECRET(octet *S, octet *SS);
+}
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/newhope.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/newhope.cpp
new file mode 100644
index 0000000..b3b4c4c
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/newhope.cpp
@@ -0,0 +1,517 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* NewHope API implementation. Constant time.
+
+    LOOK - no if statements!
+
+   M.Scott 21/07/2017
+*/
+
+#include "newhope.h"
+
+using namespace core;
+
+const sign16 roots[] = {0x2ac8, 0x2baf, 0x299b, 0x685, 0x2f04, 0x158d, 0x2d49, 0x24b5, 0x1edc, 0xab3, 0x2a95, 0x24d, 0x3cb, 0x6a8, 0x12f9, 0x15ba, 0x1861, 0x2a89, 0x1c5c, 0xbe6, 0xc1e, 0x2024, 0x207, 0x19ce, 0x2710, 0x1744, 0x18bc, 0x2cd7, 0x396, 0x18d5, 0x1c45, 0xc4, 0x21a6, 0xe03, 0x2b3c, 0x2d91, 0xc5d, 0x432, 0x1fbc, 0xcae, 0x2512, 0x2979, 0x3b2, 0x714, 0xb2e, 0x1a97, 0x1a03, 0x1bcd, 0x2216, 0x2701, 0xa, 0x263c, 0x1179, 0x200c, 0x2d08, 0x1c34, 0x291, 0x2c99, 0x2a5a, 0x723, 0xb1d, 0x1ccc, 0x1fb6, 0x2f58, 0x2bfe, 0x1cda, 0x2a0, 0x5f1, 0x2de, 0x1fc7, 0x1ea8, 0x1719, 0x2fa7, 0x27ec, 0x20ff, 0x12c0, 0x1ac1, 0x2232, 0x2f9b, 0xd3e, 0x2aed, 0x15f0, 0x11e8, 0xed0, 0x26a, 0x1de5, 0xa3f, 0xf43, 0xebf, 0x204e, 0xac7, 0x2d9c, 0x5ea, 0x25d1, 0xb6, 0x49c, 0x995, 0x2555, 0x26e2, 0x100, 0x1878, 0x5aa, 0x2e10, 0x271c, 0xcb, 0x1b4c, 0x2fb8, 0x25b7, 0x1543, 0x2c7b, 0x241a, 0x2223, 0x20ca, 0x24ed, 0x137, 0x1b65, 0x1dc2, 0x7c7, 0x2ec3, 0xd0c, 0x1169, 0x1c7a, 0x1ea1, 0xf89, 0x2199, 0x291d, 0x1088, 0x2046, 0x256d, 0x2bc7, 0x2e9b, 0x41f, 0x1b55, 0x2b38, 0xd0, 0x2e6a, 0x1755, 0x6bc, 0x2724, 0x3ba, 0x222e, 0x2c5c, 0x2da5, 0x213c, 0x10fe, 0x169a, 0x1552, 0x5d3, 0x300, 0x1b5d, 0x1342, 0x2004, 0x256f, 0x2039, 0x667, 0x23b5, 0x1123, 0xdb, 0x2da0, 0xe1e, 0x2f54, 0x2767, 0x154a, 0x40a, 0x11d3, 0x2821, 0xc09, 0x974, 0x694, 0xfbf, 0x27ba, 0x132, 0x83f, 0x2d06, 0x10e, 0x183f, 0x29ae, 0x28c3, 0x2dc9, 0x1144, 0x2c70, 0x2a4a, 0xf3c, 0x1e32, 0x1171, 0x1e43, 0xdd4, 0x2ddf, 0x28d2, 0xfac, 0x3c4, 0x2f19, 0x10a6, 0x2f7, 0xe1d, 0x828, 0x138f, 0x1332, 0xfab, 0xcf6, 0x13f8, 0x24a0, 0x112d, 0x2717, 0x6e7, 0x1044, 0x36e, 0xfe8, 0x6a, 0xba7, 0x1d69, 0x29ec, 0x23b2, 0xaee, 0x16df, 0x1068, 0x1a7e, 0x253f, 0x24c, 0xb33, 0x2683, 0x15ce, 0x1ad3, 0x1a36, 0xc96, 0xaea, 0x260a, 0xce, 0x28b1, 0xe4f, 0x2b11, 0x5f8, 0x1fc4, 0xe77, 0x2366, 0x11f9, 0x153c, 0x24eb, 0x20cd, 0x1398, 0x22, 0x2b97, 0x249b, 0x8eb, 0x12b2, 0x2fe3, 0x29c1, 0x1b00, 0x2663, 0xeaa, 0x2e06, 0xe0, 0x1569, 0x10f5, 0x284e, 0xa38, 0x201d, 0x1c53, 0x1681, 0x1f6f, 0x2f95, 0x2fe8, 0xacb, 0x1680, 0x17fd, 0x2c39, 0x165a, 0x10bb, 0x29d8, 0x2622, 0x1196, 0x884, 0x2a79, 0x140e, 0x2d80, 0x6fa, 0x11b2, 0x26c4, 0x355, 0x1054, 0x29e9, 0x23ed, 0xbe3, 0x24fa, 0x1fb3, 0x10ac, 0x2919, 0x2584, 0x10a4, 0xe85, 0x650, 0x1893, 0x1dc1, 0xd8e, 0x12dc, 0x2d42, 0x284d, 0xfff, 0x250f, 0xacd, 0x13c3, 0x6cc, 0x1a79, 0x1221, 0x2614, 0x270a, 0x1ea, 0x155, 0x2818, 0x222c, 0x2e5b, 0x25d8, 0x1dbf, 0x191c, 0xb0f, 0xdac, 0x1082, 0x12ef, 0x11b6, 0xfa8, 0x2b72, 0x159d, 0x209e, 0x31b, 0x2c7c, 0x14f7, 0xe09, 0x1bb2, 0x1ec7, 0x2404, 0x20ae, 0x6ad, 0xed6, 0x2b70, 0x1c7b, 0x18d1, 0x2732, 0x12da, 0xd56, 0x5c1, 0x1648, 0x18b7, 0x1605, 0x1bc4, 0x280, 0x2ece, 0xc, 0x1aae, 0x1c4, 0x1cdb, 0x22d6, 0x21d8, 0x257c, 0x51f, 0x211b, 0xff, 0x2ee0, 0x2585, 0xe1, 0x2c35, 0x26db, 0x2971, 0x2208, 0x17e1, 0x21be, 0x135e, 0x28d6, 0x2891, 0x1689, 0x2138, 0xb86, 0x2e3a, 0x1204, 0x2d10, 0x2324, 0xf3f, 0x2508, 0x33d, 0xcb2, 0x292a, 0xe27, 0x2e64, 0x29f8, 0x2d46, 0x9b7, 0x20eb, 0x1b7c, 0x9eb, 0x2b2a, 0x58c, 0x27d0, 0x121b, 0x272e, 0x29f6, 0x2dbd, 0x2697, 0x2aac, 0xd6f, 0x1c67, 0x2c5b, 0x108d, 0x363, 0x249d, 0x2d5e, 0x2fd, 0x2cb2, 0x1f8f, 0x20a4, 0xa19, 0x2ac9, 0x19b1, 0x1581, 0x17a2, 0x29eb, 0x1b72, 0x13b0, 0xee4, 0xa8f, 0x2315, 0x5e6, 0x951, 0x2e29, 0xdad, 0x1f2b, 0x224e, 0x37f, 0x1a72, 0xa91, 0x1407, 0x2df9, 0x3ad, 0x23f7, 0x1a24, 0x1d2a, 0x234b, 0x1df3, 0x1143, 0x7ff, 0x1a6d, 0x2774, 0x2690, 0x2ab5, 0x586, 0x2781, 0x2009, 0x2fdd, 0x2881, 0x399, 0x2fb6, 0x144, 0x137f, 0xfa0, 0x2e4c, 0x1c7f, 0x2fac, 0xb09, 0x1264, 0x127b, 0x198c, 0x2b40, 0x230, 0x1cf4, 0x180b, 0xb58, 0x144a, 0x2aec, 0xfb, 0x2602, 0x14ee, 0x783, 0x1098, 0x23d8, 0x203, 0xe9, 0x108a, 0x14b8, 0xeec, 0xc58, 0x1248, 0x243c, 0x28aa, 0x6bf, 0x27c4, 0x276e, 0x19b8, 0x1d11, 0x2e16, 0x472, 0x1464, 0x24b9, 0x662, 0x1097, 0x2067, 0x20d6, 0x171c, 0x4, 0x682, 0x17bb, 0x1186, 0x4f2, 0x3ff, 0x2a43, 0x1dc7, 0x1ae5, 0x8cc, 0x2e7c, 0x2ef8, 0x2ae0, 0x2904, 0xed4, 0x6c5, 0x14ae, 0xb72, 0x11c3, 0x337, 0x2da3, 0x2916, 0x6d8, 0x1cf9, 0x10ee, 0x1800, 0x1ae4, 0xa0d, 0x101b, 0x1a8d, 0x2e98, 0x24cd, 0x813, 0x1aa4, 0x9b9, 0x680, 0x2349, 0x24d1, 0x20f8, 0xe31, 0x249f, 0x216b, 0x12d9, 0x1d21, 0x19db, 0x191a, 0x1dd0, 0x5df, 0x55c, 0x2b86, 0x213, 0xe9e, 0x1ef1, 0x268a, 0x1d5e, 0x1e20, 0x28c1, 0x1379, 0x249, 0x19de, 0x18b, 0x1e41, 0x2a1e, 0x2612, 0x297, 0x2e96, 0x2102, 0x46, 0x1b9f, 0x1a4d, 0x2050, 0x1b32, 0x568, 0x11f7, 0x1829, 0x870, 0x1f4, 0x1dca, 0x990, 0x1df6, 0x2b62, 0x13ec, 0x9f2, 0x1260, 0x2997, 0x1412, 0x1e6d, 0x1694, 0x11ac, 0x2d8b, 0x276f, 0x26f5, 0x233e, 0x2b44, 0x2f5a, 0x2d37, 0x2cb1, 0xc75, 0x98d, 0x1d56, 0x7ae, 0x10e6, 0x113f, 0x17b8, 0xad3, 0x737, 0x221e, 0x1b70, 0x1f3e, 0x2966, 0x18b2, 0x4fa, 0x2044, 0x1312, 0x154e, 0x2029, 0x700, 0x1b45, 0x27a6, 0x226a, 0x21bf, 0x58d, 0x2f11, 0x2e02, 0x17fc, 0x4d2, 0x1757, 0xcb1, 0x2ef1, 0x2582, 0x1276, 0x881, 0x2fc0, 0x104a, 0x670, 0x274f, 0x2b53, 0x19dd, 0x752, 0x1663, 0xcbd, 0x2b2b, 0x2fc6, 0x13b6, 0x21e6, 0x15f6, 0x126b, 0x2637, 0x1cd9, 0x2f50, 0xe82, 0x5b0, 0x24e0, 0x1350, 0x2f24, 0x21f7, 0x1a16, 0x2f3e, 0x167e, 0x1f7d, 0x28a0, 0x16f0, 0xe33, 0x53b, 0x28c5, 0x1500, 0x2f88, 0x26cc, 0x2018, 0x1604, 0x218b, 0x2cd1, 0x9ee, 0x17f3, 0x5fd, 0x1f5a, 0x2d0, 0x2b46, 0x23cc, 0x503, 0x1c46, 0x1cc3, 0x28e2, 0x243e, 0x122b, 0x2e0c, 0xe37, 0x2611, 0x85e, 0x9b8, 0x1b24, 0x762, 0x19b6, 0x3bc, 0x2d50, 0x2079, 0x18da, 0x170a, 0x800, 0xaa2, 0x135a, 0x1a15, 0x13d1, 0xca, 0x2113, 0x2db9, 0xdb2, 0x1a5c, 0x29a9, 0x1488, 0x14c1, 0x2c9, 0x917, 0x28e7, 0x265c, 0xdab, 0x2ab9, 0x2bc6, 0x105b, 0x1839, 0x219c, 0x50, 0x11da, 0x1802, 0xf56, 0x2e6, 0x2190, 0xddb, 0x56e, 0x9d9, 0x1c81, 0x1016, 0x12d6, 0x296f, 0x14b4, 0x1014, 0x1e64, 0x1d90, 0x89f, 0x2bc2, 0x2777, 0x2819, 0x1c65, 0x1a41, 0x5a2, 0x2cd2, 0x427, 0xd71, 0x29c8, 0x1e58, 0x53f, 0x7c5, 0x1dcd, 0x4a1, 0x1268, 0x2597, 0x2926, 0xee, 0x111b, 0x1038, 0xe6c, 0x22dc, 0x2f2f, 0x441, 0x2cfd, 0x1cb0, 0x6a4, 0x2224, 0x620, 0x5dc, 0x16b1, 0x2a1d, 0x1787, 0x20c7, 0x641, 0xd84, 0x1c05, 0x2d0d, 0x2f52, 0x1b8c, 0xd7d, 0x17e8, 0x1589, 0xc73, 0x151b, 0x4e2, 0x1ae9, 0x1b18, 0xb9b, 0x949, 0x2c60, 0x1e7a, 0xd5, 0x1bdc, 0x1f57, 0x1753, 0x124a, 0x559, 0xb76, 0x2334, 0x12d1, 0x1de1, 0x14b2, 0x2faa, 0x1697, 0x147a, 0x5a1, 0x2c30, 0x1c02, 0x1043, 0x2ee1, 0x2402, 0x1cc8, 0x2a16, 0xff7, 0x1364, 0x1b9a, 0x2a53, 0x2f94, 0x294c, 0x1ee5, 0x1a87, 0x2141, 0xd66, 0x953, 0x28a3, 0x2f30, 0x2477, 0x18e3, 0x1035, 0x1fc1, 0x1d68, 0x2fb3, 0x138c, 0x2487, 0x1bf8, 0xd96, 0x1018, 0x748, 0x244e, 0x15bd, 0x175e, 0x2be, 0x23d, 0x1da, 0x176d, 0xc17, 0x24be, 0x2ebb, 0x7d8, 0x100a, 0x759, 0x1db4, 0x2259, 0x23f4, 0x2d59, 0x2847, 0xbf5, 0x1cfe, 0xa20, 0x258, 0x1180, 0x279c, 0x54, 0x2abf, 0xc5c, 0x9f9, 0x3d5, 0x2ce4, 0x165f, 0x23d9, 0x27b9, 0x6f9, 0x281a, 0x169e, 0x627, 0x156d, 0x1ff8, 0x211, 0x2e34, 0x1724, 0x2c2e, 0x2790, 0x2dd5, 0x2bf2, 0xdbc, 0x2884, 0x20a9, 0x2390, 0x1e1a, 0x1b6a, 0x5f7, 0xab7, 0x1333, 0x16ab, 0x28dd, 0x20, 0x30f, 0x24b6, 0x5c2, 0x1ce4, 0x1400, 0x2669, 0x60, 0x156c, 0xe20, 0x26d4, 0x26ab, 0x1ebb, 0x223d, 0x5b4, 0x2025, 0x1e1c, 0xaae, 0x2e08, 0x6cd, 0x1677, 0x13d9, 0x17b5, 0x1046, 0x1d8c, 0x14eb, 0x18d8, 0x1ce5, 0x2478, 0x16ae, 0xb79, 0x23d4, 0x684, 0x156b, 0x567, 0x1a, 0x29ce, 0x83a, 0x19e8, 0x58e, 0x294a, 0x1136, 0x2319, 0x2fba, 0x1a29, 0x1d, 0x1879, 0x291b, 0x19f6, 0x2c2f, 0x21c9, 0x19bb, 0xbbc, 0x26f9, 0xc22, 0x708, 0x11a1, 0x18d3, 0x7f8, 0x28f8, 0x2427, 0x1deb, 0xaed, 0x26aa, 0x2482, 0x203b, 0x2f05, 0x2b82, 0x192f, 0x2df4, 0x8dc, 0x2877, 0xd5e, 0x240e, 0x775, 0x2dae, 0x1d3e, 0x20ba, 0x215b, 0x22d1, 0xeba, 0xf50, 0xaa8, 0x184a, 0x1f67, 0x2e04, 0xc6e, 0x6dd, 0x1a09, 0x27f, 0x494, 0x1426, 0xae3, 0xe15, 0x65f, 0x13c4, 0x105, 0x872, 0x2667, 0x1ff6, 0xd9f, 0x2ca1, 0x2f39, 0x2657, 0x23fd, 0x2405, 0xb73, 0x2294, 0x1f1e, 0x2eba, 0x110a, 0x2cae, 0x141f, 0x22cd, 0x25d6, 0x11c1, 0x1c, 0x2d8e, 0x161a, 0x1aa8, 0x229e, 0x1bf9, 0x7cf, 0x106d, 0x2c40, 0xd93, 0x255e, 0x28c2, 0xc1a, 0x2f17, 0x7ca, 0x2f63, 0xbf};
+const sign16 iroots[] = {0x2ac8, 0x452, 0x297c, 0x666, 0xb4c, 0x2b8, 0x1a74, 0xfd, 0x1a47, 0x1d08, 0x2959, 0x2c36, 0x2db4, 0x56c, 0x254e, 0x1125, 0x2f3d, 0x13bc, 0x172c, 0x2c6b, 0x32a, 0x1745, 0x18bd, 0x8f1, 0x1633, 0x2dfa, 0xfdd, 0x23e3, 0x241b, 0x13a5, 0x578, 0x17a0, 0xa9, 0x104b, 0x1335, 0x24e4, 0x28de, 0x5a7, 0x368, 0x2d70, 0x13cd, 0x2f9, 0xff5, 0x1e88, 0x9c5, 0x2ff7, 0x900, 0xdeb, 0x1434, 0x15fe, 0x156a, 0x24d3, 0x28ed, 0x2c4f, 0x688, 0xaef, 0x2353, 0x1045, 0x2bcf, 0x23a4, 0x270, 0x4c5, 0x21fe, 0xe5b, 0xfbb, 0x1f79, 0x6e4, 0xe68, 0x2078, 0x1160, 0x1387, 0x1e98, 0x22f5, 0x13e, 0x283a, 0x123f, 0x149c, 0x2eca, 0xb14, 0xf37, 0xdde, 0xbe7, 0x386, 0x1abe, 0xa4a, 0x49, 0x14b5, 0x2f36, 0x8e5, 0x1f1, 0x2a57, 0x1789, 0x2f01, 0x91f, 0xaac, 0x266c, 0x2b65, 0x2f4b, 0xa30, 0x2a17, 0x265, 0x253a, 0xfb3, 0x2142, 0x20be, 0x25c2, 0x121c, 0x2d97, 0x2131, 0x1e19, 0x1a11, 0x514, 0x22c3, 0x66, 0xdcf, 0x1540, 0x1d41, 0xf02, 0x815, 0x5a, 0x18e8, 0x1159, 0x103a, 0x2d23, 0x2a10, 0x2d61, 0x1327, 0x403, 0x25c9, 0x7b3, 0x1f0c, 0x1a98, 0x2f21, 0x1fb, 0x2157, 0x99e, 0x1501, 0x640, 0x1e, 0x1d4f, 0x2716, 0xb66, 0x46a, 0x2fdf, 0x1c69, 0xf34, 0xb16, 0x1ac5, 0x1e08, 0xc9b, 0x218a, 0x103d, 0x2a09, 0x4f0, 0x21b2, 0x750, 0x2f33, 0x9f7, 0x2517, 0x236b, 0x15cb, 0x152e, 0x1a33, 0x97e, 0x24ce, 0x2db5, 0xac2, 0x1583, 0x1f99, 0x1922, 0x2513, 0xc4f, 0x615, 0x1298, 0x245a, 0x2f97, 0x2019, 0x2c93, 0x1fbd, 0x291a, 0x8ea, 0x1ed4, 0xb61, 0x1c09, 0x230b, 0x2056, 0x1ccf, 0x1c72, 0x27d9, 0x21e4, 0x2d0a, 0x1f5b, 0xe8, 0x2c3d, 0x2055, 0x72f, 0x222, 0x222d, 0x11be, 0x1e90, 0x11cf, 0x20c5, 0x5b7, 0x391, 0x1ebd, 0x238, 0x73e, 0x653, 0x17c2, 0x2ef3, 0x2fb, 0x27c2, 0x2ecf, 0x847, 0x2042, 0x296d, 0x268d, 0x23f8, 0x7e0, 0x1e2e, 0x2bf7, 0x1ab7, 0x89a, 0xad, 0x21e3, 0x261, 0x2f26, 0x1ede, 0xc4c, 0x299a, 0xfc8, 0xa92, 0xffd, 0x1cbf, 0x14a4, 0x2d01, 0x2a2e, 0x1aaf, 0x1967, 0x1f03, 0xec5, 0x25c, 0x3a5, 0xdd3, 0x2c47, 0x8dd, 0x2945, 0x18ac, 0x197, 0x2f31, 0x4c9, 0x14ac, 0x2be2, 0x166, 0x43a, 0xa94, 0x1b53, 0x293c, 0x212d, 0x6fd, 0x521, 0x109, 0x185, 0x2735, 0x151c, 0x123a, 0x5be, 0x2c02, 0x2b0f, 0x1e7b, 0x1846, 0x297f, 0x2ffd, 0x18e5, 0xf2b, 0xf9a, 0x1f6a, 0x299f, 0xb48, 0x1b9d, 0x2b8f, 0x1eb, 0x12f0, 0x1649, 0x893, 0x83d, 0x2942, 0x757, 0xbc5, 0x1db9, 0x23a9, 0x2115, 0x1b49, 0x1f77, 0x2f18, 0x2dfe, 0xc29, 0x1f69, 0x287e, 0x1b13, 0x9ff, 0x2f06, 0x515, 0x1bb7, 0x24a9, 0x17f6, 0x130d, 0x2dd1, 0x4c1, 0x1675, 0x1d86, 0x1d9d, 0x24f8, 0x55, 0x1382, 0x1b5, 0x2061, 0x1c82, 0x2ebd, 0x4b, 0x2c68, 0x780, 0x24, 0xff8, 0x880, 0x2a7b, 0x54c, 0x971, 0x88d, 0x1594, 0x2802, 0x1ebe, 0x120e, 0xcb6, 0x12d7, 0x15dd, 0xc0a, 0x2c54, 0x208, 0x1bfa, 0x2570, 0x158f, 0x2c82, 0xdb3, 0x10d6, 0x2254, 0x1d8, 0x26b0, 0x2a1b, 0xcec, 0x2572, 0x211d, 0x1c51, 0x148f, 0x616, 0x185f, 0x1a80, 0x1650, 0x538, 0x25e8, 0xf5d, 0x1072, 0x34f, 0x2d04, 0x2a3, 0xb64, 0x2c9e, 0x1f74, 0x3a6, 0x139a, 0x2292, 0x555, 0x96a, 0x244, 0x60b, 0x8d3, 0x1de6, 0x831, 0x2a75, 0x4d7, 0x2616, 0x1485, 0xf16, 0x264a, 0x2bb, 0x609, 0x19d, 0x21da, 0x6d7, 0x234f, 0x2cc4, 0xaf9, 0x20c2, 0xcdd, 0x2f1, 0x1dfd, 0x1c7, 0x247b, 0xec9, 0x1978, 0x770, 0x72b, 0x1ca3, 0xe43, 0x1820, 0xdf9, 0x690, 0x926, 0x3cc, 0x2f20, 0xa7c, 0x121, 0x2f02, 0xee6, 0x2ae2, 0xa85, 0xe29, 0xd2b, 0x1326, 0x2e3d, 0x1553, 0x2ff5, 0x133, 0x2d81, 0x143d, 0x19fc, 0x174a, 0x19b9, 0x2a40, 0x22ab, 0x1d27, 0x8cf, 0x1730, 0x1386, 0x491, 0x212b, 0x2954, 0xf53, 0xbfd, 0x113a, 0x144f, 0x21f8, 0x1b0a, 0x385, 0x2ce6, 0xf63, 0x1a64, 0x48f, 0x2059, 0x1e4b, 0x1d12, 0x1f7f, 0x2255, 0x24f2, 0x16e5, 0x1242, 0xa29, 0x1a6, 0xdd5, 0x7e9, 0x2eac, 0x2e17, 0x8f7, 0x9ed, 0x1de0, 0x1588, 0x2935, 0x1c3e, 0x2534, 0xaf2, 0x2002, 0x7b4, 0x2bf, 0x1d25, 0x2273, 0x1240, 0x176e, 0x29b1, 0x217c, 0x1f5d, 0xa7d, 0x6e8, 0x1f55, 0x104e, 0xb07, 0x241e, 0xc14, 0x618, 0x1fad, 0x2cac, 0x93d, 0x1e4f, 0x2907, 0x281, 0x1bf3, 0x588, 0x277d, 0x1e6b, 0x9df, 0x629, 0x1f46, 0x19a7, 0x3c8, 0x1804, 0x1981, 0x2536, 0x19, 0x6c, 0x1092, 0x1980, 0x13ae, 0xfe4, 0x2f42, 0x9e, 0x2837, 0xea, 0x23e7, 0x73f, 0xaa3, 0x226e, 0x3c1, 0x1f94, 0x2832, 0x1408, 0xd63, 0x1559, 0x19e7, 0x273, 0x2fe5, 0x1e40, 0xa2b, 0xd34, 0x1be2, 0x353, 0x1ef7, 0x147, 0x10e3, 0xd6d, 0x248e, 0xbfc, 0xc04, 0x9aa, 0xc8, 0x360, 0x2262, 0x100b, 0x99a, 0x278f, 0x2efc, 0x1c3d, 0x29a2, 0x21ec, 0x251e, 0x1bdb, 0x2b6d, 0x2d82, 0x15f8, 0x2924, 0x2393, 0x1fd, 0x109a, 0x17b7, 0x2559, 0x20b1, 0x2147, 0xd30, 0xea6, 0xf47, 0x12c3, 0x253, 0x288c, 0xbf3, 0x22a3, 0x78a, 0x2725, 0x20d, 0x16d2, 0x47f, 0xfc, 0xfc6, 0xb7f, 0x957, 0x2514, 0x1216, 0xbda, 0x709, 0x2809, 0x172e, 0x1e60, 0x28f9, 0x23df, 0x908, 0x2445, 0x1646, 0xe38, 0x3d2, 0x160b, 0x6e6, 0x1788, 0x2fe4, 0x15d8, 0x47, 0xce8, 0x1ecb, 0x6b7, 0x2a73, 0x1619, 0x27c7, 0x633, 0x2fe7, 0x2a9a, 0x1a96, 0x297d, 0xc2d, 0x2488, 0x1953, 0xb89, 0x131c, 0x1729, 0x1b16, 0x1275, 0x1fbb, 0x184c, 0x1c28, 0x198a, 0x2934, 0x1f9, 0x2553, 0x11e5, 0xfdc, 0x2a4d, 0xdc4, 0x1146, 0x956, 0x92d, 0x21e1, 0x1a95, 0x2fa1, 0x998, 0x1c01, 0x131d, 0x2a3f, 0xb4b, 0x2cf2, 0x2fe1, 0x724, 0x1956, 0x1cce, 0x254a, 0x2a0a, 0x1497, 0x11e7, 0xc71, 0xf58, 0x77d, 0x2245, 0x40f, 0x22c, 0x871, 0x3d3, 0x18dd, 0x1cd, 0x2df0, 0x1009, 0x1a94, 0x29da, 0x1963, 0x7e7, 0x2908, 0x848, 0xc28, 0x19a2, 0x31d, 0x2c2c, 0x2608, 0x23a5, 0x542, 0x2fad, 0x865, 0x1e81, 0x2da9, 0x25e1, 0x1303, 0x240c, 0x7ba, 0x2a8, 0xc0d, 0xda8, 0x124d, 0x28a8, 0x1ff7, 0x2829, 0x146, 0xb43, 0x23ea, 0x1894, 0x2e27, 0x2dc4, 0x2d43, 0x18a3, 0x1a44, 0xbb3, 0x28b9, 0x1fe9, 0x226b, 0x1409, 0xb7a, 0x1c75, 0x4e, 0x1299, 0x1040, 0x1fcc, 0x171e, 0xb8a, 0xd1, 0x75e, 0x26ae, 0x229b, 0xec0, 0x157a, 0x111c, 0x6b5, 0x6d, 0x5ae, 0x1467, 0x1c9d, 0x200a, 0x5eb, 0x1339, 0xbff, 0x120, 0x1fbe, 0x13ff, 0x3d1, 0x2a60, 0x1b87, 0x196a, 0x57, 0x1b4f, 0x1220, 0x1d30, 0xccd, 0x248b, 0x2aa8, 0x1db7, 0x18ae, 0x10aa, 0x1425, 0x2f2c, 0x1187, 0x3a1, 0x26b8, 0x2466, 0x14e9, 0x1518, 0x2b1f, 0x1ae6, 0x238e, 0x1a78, 0x1819, 0x2284, 0x1475, 0xaf, 0x2f4, 0x13fc, 0x227d, 0x29c0, 0xf3a, 0x187a, 0x5e4, 0x1950, 0x2a25, 0x29e1, 0xddd, 0x295d, 0x1351, 0x304, 0x2bc0, 0xd2, 0xd25, 0x2195, 0x1fc9, 0x1ee6, 0x2f13, 0x6db, 0xa6a, 0x1d99, 0x2b60, 0x1234, 0x283c, 0x2ac2, 0x11a9, 0x639, 0x2290, 0x2bda, 0x32f, 0x2a5f, 0x15c0, 0x139c, 0x7e8, 0x88a, 0x43f, 0x2762, 0x1271, 0x119d, 0x1fed, 0x1b4d, 0x692, 0x1d2b, 0x1feb, 0x1380, 0x2628, 0x2a93, 0x2226, 0xe71, 0x2d1b, 0x20ab, 0x17ff, 0x1e27, 0x2fb1, 0xe65, 0x17c8, 0x1fa6, 0x43b, 0x548, 0x2256, 0x9a5, 0x71a, 0x26ea, 0x2d38, 0x1b40, 0x1b79, 0x658, 0x15a5, 0x224f, 0x248, 0xeee, 0x2f37, 0x1c30, 0x15ec, 0x1ca7, 0x255f, 0x2801, 0x18f7, 0x1727, 0xf88, 0x2b1, 0x2c45, 0x164b, 0x289f, 0x14dd, 0x2649, 0x27a3, 0x9f0, 0x21ca, 0x1f5, 0x1dd6, 0xbc3, 0x71f, 0x133e, 0x13bb, 0x2afe, 0xc35, 0x4bb, 0x2d31, 0x10a7, 0x2a04, 0x180e, 0x2613, 0x330, 0xe76, 0x19fd, 0xfe9, 0x935, 0x79, 0x1b01, 0x73c, 0x2ac6, 0x21ce, 0x1911, 0x761, 0x1084, 0x1983, 0xc3, 0x15eb, 0xe0a, 0xdd, 0x1cb1, 0xb21, 0x2a51, 0x217f, 0xb1, 0x1328, 0x9ca, 0x1d96, 0x1a0b, 0xe1b, 0x1c4b, 0x3b, 0x4d6, 0x2344, 0x199e, 0x28af, 0x1624, 0x4ae, 0x8b2, 0x2991, 0x1fb7, 0x41, 0x2780, 0x1d8b, 0xa7f, 0x110, 0x2350, 0x18aa, 0x2b2f, 0x1805, 0x1ff, 0xf0, 0x2a74, 0xe42, 0xd97, 0x85b, 0x14bc, 0x2901, 0xfd8, 0x1ab3, 0x1cef, 0xfbd, 0x2b07, 0x174f, 0x69b, 0x10c3, 0x1491, 0xde3, 0x28ca, 0x252e, 0x1849, 0x1ec2, 0x1f1b, 0x2853, 0x12ab, 0x2674, 0x238c, 0x350, 0x2ca, 0xa7, 0x4bd, 0xcc3, 0x90c, 0x892, 0x276, 0x1e55, 0x196d, 0x1194, 0x1bef, 0x66a, 0x1da1, 0x260f, 0x1c15, 0x49f, 0x120b, 0x2671, 0x1237, 0x2e0d, 0x2791, 0x17d8, 0x1e0a, 0x2a99, 0x14cf, 0xfb1, 0x15b4, 0x1462, 0x2fbb, 0xeff, 0x16b, 0x2d6a, 0x9ef, 0x5e3, 0x11c0, 0x2e76, 0x1623, 0x2db8, 0x1c88, 0x740, 0x11e1, 0x12a3, 0x977, 0x1110, 0x2163, 0x2dee, 0x47b, 0x2aa5, 0x2a22, 0x1231, 0x16e7, 0x1626, 0x12e0, 0x1d28, 0xe96, 0xb62, 0x21d0, 0xf09, 0xb30, 0xcb8, 0x2981, 0x2648, 0x155d, 0x27ee, 0xb34, 0x169, 0x1574, 0x1fe6, 0x25f4, 0x151d, 0x1801, 0x1f13, 0x1308, 0x2929, 0x6eb, 0x25e, 0x2cca, 0x1e3e, 0x248f};
+const sign16 inv = 0xeab;
+const sign16 invpr = 0x2c2a;
+
+#define DEGREE (1<<RLWE_LGN)
+#define WL 32
+
+#define round(a,b) (((a)+((b)/2))/(b))
+
+/* constant time absolute vaue */
+static sign32 nabs(sign32 x)
+{
+    sign32 mask = (x >> 31);
+    return (x + mask)^mask;
+}
+
+/* Montgomery stuff */
+
+static sign32 redc(unsign64 T)
+{
+    unsign32 m = (unsign32)T * (unsign32)RLWE_ND;
+    return ((unsign64)m * RLWE_PRIME + T) >> WL;
+}
+
+static sign32 nres(unsign32 x)
+{
+    return redc((unsign64)x * RLWE_R2MODP);
+}
+
+static sign32 modmul(unsign32 a, unsign32 b)
+{
+    return redc((unsign64)a * b);
+}
+
+/* NTT code */
+/* Cooley-Tukey NTT */
+
+static void ntt(sign32 *x)
+{
+    int m, i, j, k, t = DEGREE / 2;
+    sign32 S, U, V, W, q = RLWE_PRIME;
+
+    /* Convert to Montgomery form */
+    for (j = 0; j < DEGREE; j++)
+        x[j] = nres(x[j]);
+
+    m = 1;
+    while (m < DEGREE)
+    {
+        k = 0;
+        for (i = 0; i < m; i++)
+        {
+            S = roots[m + i];
+            for (j = k; j < k + t; j++)
+            {
+                U = x[j];
+                V = modmul(x[j + t], S);
+                x[j] = U + V;
+                x[j + t] = U + 2 * q - V;
+            }
+            k += 2 * t;
+        }
+        t /= 2;
+        m *= 2;
+    }
+}
+
+/* Gentleman-Sande INTT */
+
+static void intt(sign32 *x)
+{
+    int m, i, j, k, t = 1;
+    sign32 S, U, V, W, q = RLWE_PRIME;
+
+    m = DEGREE / 2;
+    while (m > 1)
+    {
+        k = 0;
+        for (i = 0; i < m; i++)
+        {
+            S = iroots[m + i];
+            for (j = k; j < k + t; j++)
+            {
+                U = x[j];
+                V = x[j + t];
+                x[j] = U + V;
+                W = U + DEGREE * q - V;
+                x[j + t] = modmul(W, S);
+            }
+            k += 2 * t;
+        }
+        t *= 2;
+        m /= 2;
+    }
+
+    /* Last iteration merged with n^-1 */
+
+    t = DEGREE / 2;
+    for (j = 0; j < t; j++)
+    {
+        U = x[j];
+        V = x[j + t];
+        W = U + DEGREE * q - V;
+        x[j + t] = modmul(W, (sign32)invpr);
+        x[j] = modmul(U + V, (sign32)inv);
+    }
+    /* convert back from Montgomery to "normal" form */
+    for (j = 0; j < DEGREE; j++)
+    {
+        x[j] = redc(x[j]);
+        x[j] -= q;
+        x[j] += (x[j] >> (WL - 1))&q;
+    }
+}
+
+/* See https://eprint.iacr.org/2016/1157.pdf */
+
+static void NHSEncode(byte *key, sign32 *poly)
+{
+    int i, j, b, k, kj, q2;
+
+    q2 = RLWE_PRIME / 2;
+    for (i = j = 0; i < 256;)
+    {
+        kj = key[j++];
+        for (k = 0; k < 8; k++)
+        {
+            b = kj & 1;
+            poly[i] = b * q2;
+            poly[i + 256] = b * q2;
+            poly[i + 512] = b * q2;
+            poly[i + 768] = b * q2;
+            kj >>= 1;
+            i++;
+        }
+    }
+}
+
+static void NHSDecode(sign32 *poly, byte *key)
+{
+    int i, j, k;
+    sign32 b, t, q2;
+    q2 = RLWE_PRIME / 2;
+    for (i = 0; i < 32; i++)
+        key[i] = 0;
+
+    for (i = j = 0; i < 256;)
+    {
+        for (k = 0; k < 8; k++)
+        {
+            t = nabs(poly[i] - q2) + nabs(poly[i + 256] - q2) + nabs(poly[i + 512] - q2) + nabs(poly[i + 768] - q2);
+
+            b = t - RLWE_PRIME;
+            b = (b >> 31) & 1;
+            key[j] = (key[j] >> 1) + (b << 7);
+            i++;
+        }
+        j++;
+    }
+}
+
+/* convert 32-byte seed to random polynomial */
+
+static void parse(byte *seed, sign32 *poly)
+{
+    int i, j;
+    sign32 n;
+    byte hash[4 * DEGREE];
+    sha3 sh;
+
+    SHA3_init(&sh, SHAKE128);
+    for (i = 0; i < 32; i++)
+        SHA3_process(&sh, seed[i]);
+    SHA3_shake(&sh, (char *)hash, 4 * DEGREE);
+
+    for (i = j = 0; i < DEGREE; i++)
+    {
+
+        n = hash[j] & 0x7f; n <<= 8;
+        n += hash[j + 1]; n <<= 8;
+        n += hash[j + 2]; n <<= 8;
+        n += hash[j + 3]; j += 4;
+        poly[i] = nres(n);
+    }
+}
+
+/* Compress 14 bits polynomial coefficients into byte array */
+/* 7 bytes is 3x14 */
+
+static void NHSpack(sign32 *poly, byte *array)
+{
+    int i, j;
+    sign32 a, b, c, d;
+
+    for (i = j = 0; i < DEGREE; )
+    {
+        a = poly[i++]; b = poly[i++]; c = poly[i++]; d = poly[i++];
+        array[j++] = (byte)(a & 0xff);
+        array[j++] = (byte)(((a >> 8) | (b << 6)) & 0xff);
+        array[j++] = (byte)((b >> 2) & 0xff);
+        array[j++] = (byte)(((b >> 10) | (c << 4)) & 0xff);
+        array[j++] = (byte)((c >> 4) & 0xff);
+        array[j++] = (byte)(((c >> 12) | (d << 2)) & 0xff);
+        array[j++] = (byte)(d >> 6);
+    }
+}
+
+static void NHSunpack(byte *array, sign32 *poly)
+{
+    int i, j;
+    sign32 a, b, c, d, e, f, g;
+
+    for (i = j = 0; i < DEGREE; )
+    {
+        a = ((sign32)array[j++]) & 0xff; b = ((sign32)array[j++]) & 0xff; c = ((sign32)array[j++]) & 0xff; d = ((sign32)array[j++]) & 0xff; e = ((sign32)array[j++]) & 0xff; f = ((sign32)array[j++]) & 0xff; g = ((sign32)array[j++]) & 0xff;
+        poly[i++] = a | ((b & 0x3f) << 8);
+        poly[i++] = (b >> 6) | (c << 2) | ((d & 0xf) << 10);
+        poly[i++] = (d >> 4) | (e << 4) | ((f & 3) << 12);
+        poly[i++] = (f >> 2) | (g << 6);
+    }
+}
+
+/* See https://eprint.iacr.org/2016/1157.pdf */
+
+static void NHSCompress(sign32 *poly, byte *array)
+{
+    int i, j, k, b;
+    unsign32 col = 0;
+
+    for (i = j = 0; i < DEGREE;)
+    {
+        for (k = 0; k < 8; k++)
+        {
+            b = round((poly[i] * 8), RLWE_PRIME) & 7;
+            col = (col << 3) + b;
+            i++;
+        }
+        array[j] = col & 0xff;
+        array[j + 1] = (col >> 8) & 0xff;
+        array[j + 2] = (col >> 16) & 0xff;
+        j += 3; col = 0;
+    }
+}
+
+static void NHSDecompress(byte *array, sign32 *poly)
+{
+    int i, j, k, b;
+    unsign32 col = 0;
+
+    for (i = j = 0; i < DEGREE;)
+    {
+        col = array[j + 2];
+        col = (col << 8) + array[j + 1];
+        col = (col << 8) + array[j];
+        j += 3;
+        for (k = 0; k < 8; k++)
+        {
+            b = (col & 0xe00000) >> 21; col <<= 3;
+            poly[i] = round((b * RLWE_PRIME), 8);
+            i++;
+        }
+    }
+}
+
+/* generate centered binomial distribution */
+
+static void NHSError(csprng *RNG, sign32 *poly)
+{
+    int i, j;
+    sign32 n1, n2, r;
+    for (i = 0; i < DEGREE; i++)
+    {
+        n1 = RAND_byte(RNG) + (RAND_byte(RNG) << 8);
+        n2 = RAND_byte(RNG) + (RAND_byte(RNG) << 8);
+        r = 0;
+        for (j = 0; j < 16; j++)
+        {
+            r += (n1 & 1) - (n2 & 1);
+            n1 >>= 1; n2 >>= 1;
+        }
+        poly[i] = (r + RLWE_PRIME);
+    }
+}
+
+static void redc_it(sign32 *p)
+{
+    int i;
+    for (i = 0; i < DEGREE; i++)
+        p[i] = redc(p[i]);
+}
+
+static void nres_it(sign32 *p)
+{
+    int i;
+    for (i = 0; i < DEGREE; i++)
+        p[i] = nres(p[i]);
+}
+
+static void poly_mul(sign32 *p1, sign32 *p2, sign32 *p3)
+{
+    int i;
+    for (i = 0; i < DEGREE; i++)
+        p1[i] = modmul(p2[i], p3[i]);
+}
+
+static void poly_add(sign32 *p1, sign32 *p2, sign32 *p3)
+{
+    int i;
+    for (i = 0; i < DEGREE; i++)
+        p1[i] = (p2[i] + p3[i]);
+}
+
+static void poly_sub(sign32 *p1, sign32 *p2, sign32 *p3)
+{
+    int i;
+    for (i = 0; i < DEGREE; i++)
+        p1[i] = (p2[i] + RLWE_PRIME - p3[i]);
+}
+
+/* reduces inputs < 2q */
+static void poly_soft_reduce(sign32 *poly)
+{
+    int i;
+    sign32 e;
+    for (i = 0; i < DEGREE; i++)
+    {
+        e = poly[i] - RLWE_PRIME;
+        poly[i] = e + ((e >> (WL - 1))&RLWE_PRIME);
+    }
+}
+
+/* fully reduces modulo q */
+static void poly_hard_reduce(sign32 *poly)
+{
+    int i;
+    sign32 e;
+    for (i = 0; i < DEGREE; i++)
+    {
+        e = modmul(poly[i], RLWE_ONE);
+        e = e - RLWE_PRIME;
+        poly[i] = e + ((e >> (WL - 1))&RLWE_PRIME);
+    }
+}
+
+/* API functions. See https://eprint.iacr.org/2016/1157.pdf Protocol 1 */
+// S is secret key key, SB is seed|public key to be sent to client
+void core::NHS_SERVER_1(csprng *RNG, octet *SB, octet *S)
+{
+    int i;
+    byte seed[32], array[1792];
+    sign32 s[DEGREE], e[DEGREE], b[DEGREE];
+
+    for (i = 0; i < 32; i++)
+        seed[i] = RAND_byte(RNG);
+
+    parse(seed, b);
+
+    NHSError(RNG, e);
+    NHSError(RNG, s);
+
+	ntt(s);
+	ntt(e);
+
+    poly_mul(b, b, s);
+    poly_add(b, b, e);
+    poly_hard_reduce(b);
+
+    redc_it(b);
+    NHSpack(b, array);
+
+    OCT_empty(SB);
+    OCT_jbytes(SB, (char *)seed, 32);
+    OCT_jbytes(SB, (char *)array, 1792);
+
+    poly_hard_reduce(s);
+
+    NHSpack(s, array);
+    OCT_empty(S);
+    OCT_jbytes(S, (char *)array, 1792);
+
+}
+
+// optimized to reduce memory
+// UC is U|cbar to be returned to server
+// KEY is shared key
+void core::NHS_CLIENT(csprng *RNG, octet *SB, octet *UC, octet *KEY)
+{
+    int i;
+    sha3 sh;
+    byte seed[32], array[1792], key[32], cc[384];
+    sign32 sd[DEGREE], ed[DEGREE], u[DEGREE];
+    NHSError(RNG, sd);
+    NHSError(RNG, ed);
+
+    ntt(sd);
+    ntt(ed);
+
+    for (i = 0; i < 32; i++)
+        seed[i] = SB->val[i];
+
+    parse(seed, u);
+
+    poly_mul(u, u, sd);
+    poly_add(u, u, ed);
+    poly_hard_reduce(u);
+
+    redc_it(u);
+    NHSpack(u, array);
+    OCT_empty(UC);
+    OCT_jbytes(UC, (char *)array, 1792);
+
+    for (i = 0; i < 32; i++)
+        key[i] = RAND_byte(RNG);
+
+    SHA3_init(&sh, SHA3_HASH256);
+    for (i = 0; i < 32; i++)
+        SHA3_process(&sh, key[i]);
+    SHA3_hash(&sh, (char *)key);
+
+    for (i = 0; i < 1792; i++)
+        array[i] = SB->val[i + 32];
+
+    NHSunpack(array, u);
+    nres_it(u);
+
+    poly_mul(u, u, sd);
+    intt(u);
+    NHSError(RNG, ed);
+    poly_add(u, u, ed);
+
+    NHSEncode(key, sd);
+    poly_add(u, u, sd);
+
+    NHSCompress(u, cc);
+
+    SHA3_init(&sh, SHA3_HASH256);
+    for (i = 0; i < 32; i++)
+        SHA3_process(&sh, key[i]);
+    SHA3_hash(&sh, (char *)key);
+
+    OCT_empty(KEY);
+    OCT_jbytes(KEY, (char *)key, 32);
+
+    OCT_jbytes(UC, (char *)cc, 384);
+}
+
+// calculate shared key from UC and secret key S
+void core::NHS_SERVER_2(octet *S, octet *UC, octet *KEY)
+{
+    int i;
+    sha3 sh;
+    sign32 c[DEGREE], s[DEGREE], k[DEGREE];
+    byte array[1792], key[32], cc[384];
+
+    for (i = 0; i < 1792; i++)
+        array[i] = UC->val[i];
+
+    NHSunpack(array, k);
+    nres_it(k);
+
+    for (i = 0; i < 384; i++)
+        cc[i] = UC->val[i + 1792];
+
+    NHSDecompress(cc, c);
+
+    for (i = 0; i < 1792; i++)
+        array[i] = S->val[i];
+
+    NHSunpack(array, s);
+
+    poly_mul(k, k, s);
+    intt(k);
+    poly_sub(k, c, k);
+    poly_soft_reduce(k);
+
+    NHSDecode(k, key);
+
+    SHA3_init(&sh, SHA3_HASH256);
+    for (i = 0; i < 32; i++)
+        SHA3_process(&sh, key[i]);
+    SHA3_hash(&sh, (char *)key);
+
+    OCT_empty(KEY);
+    OCT_jbytes(KEY, (char *)key, 32);
+}
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/newhope.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/newhope.h
new file mode 100644
index 0000000..d7d6ee1
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/newhope.h
@@ -0,0 +1,64 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* NewHope Simple API */
+
+#ifndef NHS_H
+#define NHS_H
+
+#include "core.h"
+
+/* NewHope parameters */
+
+//q= 12289
+
+#define RLWE_PRIME 0x3001	// q in Hex
+#define RLWE_LGN 10			// Degree n=2^LGN
+#define RLWE_ND 0xF7002FFF	// 1/(R-q) mod R
+#define RLWE_ONE 0x2AC8		// R mod q
+#define RLWE_R2MODP 0x1620	// R^2 mod q
+
+namespace core {
+/** @brief NHS server first pass
+ *
+    @param RNG Random Number Generator handle
+    @param SB seed and polynomial B concatenated - output
+    @param S server secret - output
+
+ */
+extern void NHS_SERVER_1(csprng *RNG, octet *SB, octet *S);
+/** @brief NHS client pass
+ *
+    @param RNG Random Number Generator handle
+    @param SB seed and polynomial B concatenated - input
+    @param UC polynomial U and compressed polynomial c - output
+    @param KEY client key
+ */
+extern void NHS_CLIENT(csprng *RNG, octet *SB, octet *UC, octet *KEY);
+/** @brief NHS server second pass
+ *
+    @param S server secret - input
+    @param UC polynomial U and compressed polynomial c - input
+    @param KEY server key
+ */
+extern void NHS_SERVER_2(octet *S, octet *UC, octet *KEY);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/oct.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/oct.cpp
new file mode 100644
index 0000000..9146202
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/oct.cpp
@@ -0,0 +1,446 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/*** Basic Octet string maintainance routines  ***/
+/* SU=m, m is Stack Usage */
+
+#include <string.h>
+#include "core.h"
+
+#ifdef CORE_ARDUINO
+#include <Arduino.h>
+#endif
+
+using namespace core;
+
+/* Output an octet string (Debug Only) */
+
+/* SU= 16 */
+/* output octet */
+void core::OCT_output(octet *w)
+{
+    int i;
+    unsigned char ch;
+    for (i = 0; i < w->len; i++)
+    {
+        ch = w->val[i];
+#ifdef CORE_ARDUINO
+        char my_data[3];
+        sprintf(my_data, "%02x", ch);
+        Serial.print(my_data);
+#else
+        printf("%02x", ch);
+#endif
+    }
+#ifdef CORE_ARDUINO
+    Serial.println("");
+#else
+    printf("\n");
+#endif
+}
+
+/* reverse bytes. Useful if dealing with those little-endian bastards */
+void core::OCT_reverse(octet *w)
+{
+    int i;
+    unsigned char ch;
+    for (i = 0; i < w->len/2; i++) { 
+        ch = w->val[i]; 
+        w->val[i] = w->val[w->len - i - 1]; 
+        w->val[w->len - i - 1] = ch; 
+    } 
+}
+
+//#define PUT_IN_SPACES
+
+/* SU= 16 */
+void core::OCT_output_string(octet *w)
+{
+    int i;
+    unsigned char ch;
+    for (i = 0; i < w->len; i++)
+    {
+
+        ch = w->val[i];
+#ifdef CORE_ARDUINO
+        char my_data[3];
+#ifdef PUT_IN_SPACES
+        sprintf(my_data, "%c ", ch);
+#else
+        sprintf(my_data, "%c", ch);
+#endif
+        Serial.print(my_data);
+#else
+#ifdef PUT_IN_SPACES
+        printf("%c ", ch);
+#else
+        printf("%c", ch);
+#endif
+#endif
+    }
+}
+
+/* Convert C string to octet format - truncates if no room  */
+void core::OCT_jstring(octet *y, char *s)
+{
+    int i, j;
+    i = y->len;
+    j = 0;
+    while (s[j] != 0 && i < y->max)
+    {
+        y->val[i] = s[j];
+        y->len++;
+        i++;
+        j++;
+    }
+}
+
+/* compare 2 octet strings.
+ * If x==y return TRUE, else return FALSE */
+/* SU= 8 */
+int core::OCT_comp(octet *x, octet *y)
+{
+    int i;
+    if (x->len > y->len) return 0;
+    if (x->len < y->len) return 0;
+    for (i = 0; i < x->len; i++)
+    {
+        if (x->val[i] != y->val[i]) return 0;
+    }
+    return 1;
+}
+
+/* check are first n bytes the same (in constant time) */
+
+int core::OCT_ncomp(octet *x, octet *y, int n)
+{
+    int i, res = 0;
+    if (n > y->len || n > x->len) return 0;
+    for (i = 0; i < n; i++)
+    {
+        res |= (int)(x->val[i] ^ y->val[i]);
+    }
+    if (res == 0) return 1;
+    return 0;
+}
+
+/* Shift octet to the left by n bytes. Leftmost bytes disappear  */
+void core::OCT_shl(octet *x, int n)
+{
+    int i;
+    if (n >= x->len)
+    {
+        x->len = 0;
+        return;
+    }
+    x->len -= n;
+    for (i = 0; i < x->len; i++)
+        x->val[i] = x->val[i + n];
+}
+
+/* Append binary string to octet - truncates if no room */
+/* SU= 12 */
+void core::OCT_jbytes(octet *y, char *b, int len)
+{
+    int i, j;
+    i = y->len;
+    for (j = 0; j < len && i < y->max; j++)
+    {
+        y->val[i] = b[j];
+        y->len++;
+        i++;
+    }
+}
+
+/* Concatenates two octet strings */
+/* SU= 8 */
+void core::OCT_joctet(octet *y, octet *x)
+{
+    /* y=y || x */
+    int i, j;
+    if (x == NULL) return;
+
+    for (i = 0; i < x->len; i++)
+    {
+        j = y->len + i;
+        if (j >= y->max)
+        {
+            y->len = y->max;
+            return;
+        }
+        y->val[j] = x->val[i];
+    }
+    y->len += x->len;
+}
+
+/* Append byte to octet rep times */
+/* SU= 8 */
+void core::OCT_jbyte(octet *y, int ch, int rep)
+{
+    int i, j;
+    i = y->len;
+    for (j = 0; j < rep && i < y->max; j++)
+    {
+        y->val[i] = ch;
+        y->len++;
+        i++;
+    }
+}
+
+/* XOR common bytes of x with y */
+/* SU= 8 */
+void core::OCT_xor(octet *y, octet *x)
+{
+    /* xor first x->len bytes of y */
+
+    int i;
+    for (i = 0; i < x->len && i < y->len; i++)
+    {
+        y->val[i] ^= x->val[i];
+    }
+}
+
+/* clear an octet */
+void core::OCT_empty(octet *w)
+{
+    w->len = 0;
+}
+
+/* Kill an octet string - Zeroise it for security */
+void core::OCT_clear(octet *w)
+{
+    int i;
+    for (i = 0; i < w->max; i++) w->val[i] = 0;
+    w->len = 0;
+}
+
+/* appends int x of length len bytes to OCTET string */
+/* SU= 8 */
+void core::OCT_jint(octet *y, unsigned int x, int len)
+{
+    int i, n;
+    n = y->len + len;
+    if (n > y->max || len <= 0) return;
+    for (i = y->len; i < n; i++) y->val[i] = 0;
+    y->len = n;
+
+    i = y->len;
+    while (x > 0 && i > 0)
+    {
+        i--;
+        y->val[i] = x % 256;
+        x /= 256;
+    }
+}
+
+/* Pad an octet to a given length */
+/* SU= 8 */
+int core::OCT_pad(octet *w, int n)
+{
+    int i, d;
+    if (w->len > n || n > w->max) return 0;
+    if (n == w->len) return 1;
+    d = n - w->len;
+    for (i = n - 1; i >= d; i--)
+        w->val[i] = w->val[i - d];
+    for (i = d - 1; i >= 0; i--)
+        w->val[i] = 0;
+    w->len = n;
+    return 1;
+}
+
+
+/* Convert an octet string to base64 string */
+/* SU= 56 */
+void core::OCT_tobase64(char *b, octet *w)
+{
+    int i, j, k, rem, last;
+    int c, ch[4];
+    unsigned char ptr[3];
+    rem = w->len % 3;
+    j = k = 0;
+    last = 4;
+    while (j < w->len)
+    {
+        for (i = 0; i < 3; i++)
+        {
+            if (j < w->len) ptr[i] = w->val[j++];
+            else
+            {
+                ptr[i] = 0;
+                last--;
+            }
+        }
+        ch[0] = (ptr[0] >> 2) & 0x3f;
+        ch[1] = ((ptr[0] << 4) | (ptr[1] >> 4)) & 0x3f;
+        ch[2] = ((ptr[1] << 2) | (ptr[2] >> 6)) & 0x3f;
+        ch[3] = ptr[2] & 0x3f;
+        for (i = 0; i < last; i++)
+        {
+            c = ch[i];
+            if (c < 26) c += 65;
+            if (c >= 26 && c < 52) c += 71;
+            if (c >= 52 && c < 62) c -= 4;
+            if (c == 62) c = '+';
+            if (c == 63) c = '/';
+            b[k++] = c;
+        }
+    }
+    if (rem > 0) for (i = rem; i < 3; i++) b[k++] = '=';
+    b[k] = '\0'; /* dangerous! */
+}
+
+/* SU= 56 */
+void core::OCT_frombase64(octet *w, char *b)
+{
+    int i, j, k, pads, len = (int)strlen(b);
+    int c, ch[4], ptr[3];
+    j = k = 0;
+    while (j < len && k < w->max)
+    {
+        pads = 0; i=0;
+        while (i<4)
+        {
+            c = 80 + b[j++];
+            if (c <= 112) continue; /* ignore white space */
+            if (c > 144 && c < 171) c -= 145;
+            if (c > 176 && c < 203) c -= 151;
+            if (c > 127 && c < 138) c -= 76;
+            if (c == 123) c = 62;
+            if (c == 127) c = 63;
+            if (c == 141)
+            {
+                pads++;    /* ignore pads '=' */
+                i++;
+                continue;
+            }
+            ch[i++] = c;
+        }
+        ptr[0] = (ch[0] << 2) | (ch[1] >> 4);
+        ptr[1] = (ch[1] << 4) | (ch[2] >> 2);
+        ptr[2] = (ch[2] << 6) | ch[3];
+        for (i = 0; i < 3 - pads && k < w->max; i++)
+        {
+            /* don't put in leading zeros */
+            w->val[k++] = ptr[i];
+        }
+
+    }
+    w->len = k;
+}
+
+/* copy an octet string - truncates if no room */
+/* SU= 16 */
+void core::OCT_copy(octet *y, octet *x)
+{
+    int i;
+    OCT_clear(y);
+    y->len = x->len;
+    if (y->len > y->max) y->len = y->max;
+
+    for (i = 0; i < y->len; i++)
+        y->val[i] = x->val[i];
+}
+
+/* XOR m with all of x */
+void core::OCT_xorbyte(octet *x, int m)
+{
+    int i;
+    for (i = 0; i < x->len; i++) x->val[i] ^= m;
+}
+
+/* truncates x to n bytes and places the rest in y (if y is not NULL) */
+/* SU= 8 */
+void core::OCT_chop(octet *x, octet *y, int n)
+{
+    int i;
+    if (n >= x->len)
+    {
+        if (y != NULL) y->len = 0;
+        return;
+    }
+    if (y != NULL) y->len = x->len - n;
+    x->len = n;
+
+    if (y != NULL)
+    {
+        for (i = 0; i < y->len && i < y->max; i++) y->val[i] = x->val[i + n];
+    }
+}
+
+/* set x to len random bytes */
+void core::OCT_rand(octet *x, csprng *RNG, int len)
+{
+    int i;
+    if (len > x->max) len = x->max;
+    x->len = len;
+
+    for (i = 0; i < len; i++) x->val[i] = RAND_byte(RNG);
+}
+
+/* Convert an octet to a hex string */
+void core::OCT_toHex(octet *src, char *dst)
+{
+    int i,len=src->len;
+    unsigned char ch;
+    for (i = 0; i < len; i++)
+    {
+        ch = src->val[i];
+        sprintf(&dst[i * 2], "%02x", ch);
+    }
+    dst[2*len]='\0';
+}
+
+static int char2int(char input)
+{
+    if (input >= '0' && input <= '9')
+        return input - '0';
+    if (input >= 'A' && input <= 'F')
+        return input - 'A' + 10;
+    if (input >= 'a' && input <= 'f')
+        return input - 'a' + 10;
+    return 0;
+}
+
+/* Convert from a hex string */
+void core::OCT_fromHex(octet *dst, char *src)
+{
+    int i = 0;
+    int j = 0;
+    OCT_clear(dst);
+    while (src[j] != 0)
+    {
+        dst->val[i++] = char2int(src[j]) * 16 + char2int(src[j + 1]);
+        j += 2;
+    }
+    dst->len = i;
+}
+
+
+/* Convert an octet to a string */
+void core::OCT_toStr(octet *src, char *dst)
+{
+    int i;
+    unsigned char ch;
+    for (i = 0; i < src->len; i++)
+    {
+        ch = src->val[i];
+        sprintf(&dst[i], "%c", ch);
+    }
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/pair.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/pair.cpp
new file mode 100644
index 0000000..0d202bd
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/pair.cpp
@@ -0,0 +1,1233 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* CORE BN Curve pairing functions */
+
+//#define HAS_MAIN
+
+#include "pair_ZZZ.h"
+
+using namespace XXX;
+using namespace YYY;
+
+namespace ZZZ {
+static void PAIR_line(FP12 *, ECP2 *, ECP2 *, FP *, FP *);
+static void PAIR_double(ECP2 *, FP2 *, FP2 *, FP2 *);
+static void PAIR_add(ECP2 *, ECP2 *B, FP2 *, FP2 *, FP2 *);
+static void PAIR_pack(FP4 *, FP2 *, FP2 *, FP2 *);
+static void PAIR_unpack(FP12 *, FP4 *, FP *, FP *);
+static void glv(BIG u[2], BIG);
+static void gs(BIG u[4], BIG);
+}
+
+// Point doubling for pairings
+static void ZZZ::PAIR_double(ECP2 *A, FP2 *AA, FP2 *BB, FP2 *CC)
+{
+    FP2 YY;
+    FP2_copy(CC, &(A->x));  //FP2 XX=new FP2(A.getx());  //X
+    FP2_copy(&YY, &(A->y)); //FP2 YY=new FP2(A.gety());  //Y
+    FP2_copy(BB, &(A->z));  //FP2 ZZ=new FP2(A.getz());  //Z
+
+    FP2_copy(AA, &YY);      //FP2 YZ=new FP2(YY);        //Y
+    FP2_mul(AA, AA, BB);    //YZ.mul(ZZ);                //YZ
+    FP2_sqr(CC, CC);        //XX.sqr();                //X^2
+    FP2_sqr(&YY, &YY);      //YY.sqr();                //Y^2
+    FP2_sqr(BB, BB);        //ZZ.sqr();                //Z^2
+
+    FP2_add(AA, AA, AA);
+    FP2_neg(AA, AA);
+    FP2_norm(AA);           // -2YZ
+    FP2_mul_ip(AA);
+    FP2_norm(AA);           // -2YZi
+
+    FP2_imul(BB, BB, 3 * CURVE_B_I); //3Bz^2
+    FP2_imul(CC, CC, 3);            //3X^2
+
+#if SEXTIC_TWIST_ZZZ==D_TYPE
+    FP2_mul_ip(&YY);                    // Y^2.i
+    FP2_norm(&YY);
+    FP2_mul_ip(CC);                 // 3X^2.i
+    FP2_norm(CC);
+#endif
+
+#if SEXTIC_TWIST_ZZZ==M_TYPE
+    FP2_mul_ip(BB);                 // 3Bz^2.i
+    FP2_norm(BB);
+#endif
+
+    FP2_sub(BB, BB, &YY);
+    FP2_norm(BB);
+
+    ECP2_dbl(A);            //A.dbl();
+}
+
+// Point addition for pairings
+static void ZZZ::PAIR_add(ECP2 *A, ECP2 *B, FP2 *AA, FP2 *BB, FP2 *CC)
+{
+    FP2 T1;
+    FP2_copy(AA, &(A->x));      //FP2 X1=new FP2(A.getx());    // X1
+    FP2_copy(CC, &(A->y));      //FP2 Y1=new FP2(A.gety());    // Y1
+    FP2_copy(&T1, &(A->z));     //FP2 T1=new FP2(A.getz());    // Z1
+
+    FP2_copy(BB, &T1);          //FP2 T2=new FP2(A.getz());    // Z1
+
+    FP2_mul(&T1, &T1, &(B->y)); //T1.mul(B.gety());    // T1=Z1.Y2
+    FP2_mul(BB, BB, &(B->x));   //T2.mul(B.getx());    // T2=Z1.X2
+
+    FP2_sub(AA, AA, BB);        //X1.sub(T2);
+    FP2_norm(AA);               //X1.norm();  // X1=X1-Z1.X2
+    FP2_sub(CC, CC, &T1);       //Y1.sub(T1);
+    FP2_norm(CC);               //Y1.norm();  // Y1=Y1-Z1.Y2
+
+    FP2_copy(&T1, AA);          //T1.copy(X1);            // T1=X1-Z1.X2
+
+#if SEXTIC_TWIST_ZZZ==M_TYPE
+    FP2_mul_ip(AA);
+    FP2_norm(AA);
+#endif
+
+    FP2_mul(&T1, &T1, &(B->y)); //T1.mul(B.gety());       // T1=(X1-Z1.X2).Y2
+
+    FP2_copy(BB, CC);           //T2.copy(Y1);            // T2=Y1-Z1.Y2
+    FP2_mul(BB, BB, &(B->x));   //T2.mul(B.getx());       // T2=(Y1-Z1.Y2).X2
+    FP2_sub(BB, BB, &T1);       //T2.sub(T1);
+    FP2_norm(BB);               //T2.norm();          // T2=(Y1-Z1.Y2).X2 - (X1-Z1.X2).Y2
+
+    FP2_neg(CC, CC);            //Y1.neg();
+    FP2_norm(CC);               //Y1.norm(); // Y1=-(Y1-Z1.Y2).Xs                - ***
+
+    ECP2_add(A, B);             //A.add(B);
+}
+
+/* Line function */
+static void ZZZ::PAIR_line(FP12 *v, ECP2 *A, ECP2 *B, FP *Qx, FP *Qy)
+{
+    FP2 AA, BB, CC;
+    FP4 a, b, c;
+
+    if (A == B)
+        PAIR_double(A, &AA, &BB, &CC);
+    else
+        PAIR_add(A, B, &AA, &BB, &CC);
+
+    FP2_pmul(&CC, &CC, Qx);
+    FP2_pmul(&AA, &AA, Qy);
+
+    FP4_from_FP2s(&a, &AA, &BB);
+#if SEXTIC_TWIST_ZZZ==D_TYPE
+    FP4_from_FP2(&b, &CC);
+    FP4_zero(&c);
+#endif
+#if SEXTIC_TWIST_ZZZ==M_TYPE
+    FP4_zero(&b);
+    FP4_from_FP2H(&c, &CC);
+#endif
+
+    FP12_from_FP4s(v, &a, &b, &c);
+    v->type = FP_SPARSER;
+}
+
+/* prepare ate parameter, n=6u+2 (BN) or n=u (BLS), n3=3*n */
+int ZZZ::PAIR_nbits(BIG n3, BIG n)
+{
+    BIG x;
+    BIG_rcopy(x, CURVE_Bnx);
+
+#if PAIRING_FRIENDLY_ZZZ==BN_CURVE
+    BIG_pmul(n, x, 6);
+#if SIGN_OF_X_ZZZ==POSITIVEX
+    BIG_inc(n, 2);
+#else
+    BIG_dec(n, 2);
+#endif
+
+#else
+    BIG_copy(n, x);
+#endif
+
+    BIG_norm(n);
+    BIG_pmul(n3, n, 3);
+    BIG_norm(n3);
+
+    return BIG_nbits(n3);
+}
+
+/*
+    For multi-pairing, product of n pairings
+    1. Declare FP12 array of length number of bits in Ate parameter
+    2. Initialise this array by calling PAIR_initmp()
+    3. Accumulate each pairing by calling PAIR_another() n times
+    4. Call PAIR_miller()
+    5. Call final exponentiation PAIR_fexp()
+*/
+
+/* prepare for multi-pairing */
+void ZZZ::PAIR_initmp(FP12 r[])
+{
+    int i;
+    for (i = ATE_BITS_ZZZ - 1; i >= 0; i--)
+        FP12_one(&r[i]);
+    return;
+}
+
+/* basic Miller loop */
+void ZZZ::PAIR_miller(FP12 *res, FP12 r[])
+{
+    int i;
+    FP12_one(res);
+    for (i = ATE_BITS_ZZZ - 1; i >= 1; i--)
+    {
+        FP12_sqr(res, res);
+        FP12_ssmul(res, &r[i]);
+        FP12_zero(&r[i]);
+    }
+
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    FP12_conj(res, res);
+#endif
+    FP12_ssmul(res, &r[0]);
+    FP12_zero(&r[0]);
+    return;
+}
+
+// Store precomputed line details in an FP4
+static void ZZZ::PAIR_pack(FP4 *T, FP2* AA, FP2* BB, FP2 *CC)
+{
+    FP2 I, A, B;
+    FP2_inv(&I, CC, NULL);
+    FP2_mul(&A, AA, &I);
+    FP2_mul(&B, BB, &I);
+    FP4_from_FP2s(T, &A, &B);
+}
+
+// Unpack G2 line function details and include G1
+static void ZZZ::PAIR_unpack(FP12 *v, FP4* T, FP *Qx, FP *Qy)
+{
+    FP4 a, b, c;
+    FP2 t;
+    FP4_copy(&a, T);
+    FP2_pmul(&a.a, &a.a, Qy);
+    FP2_from_FP(&t, Qx);
+
+#if SEXTIC_TWIST_ZZZ==D_TYPE
+    FP4_from_FP2(&b, &t);
+    FP4_zero(&c);
+#endif
+#if SEXTIC_TWIST_ZZZ==M_TYPE
+    FP4_zero(&b);
+    FP4_from_FP2H(&c, &t);
+#endif
+
+    FP12_from_FP4s(v, &a, &b, &c);
+    v->type = FP_SPARSEST;
+}
+
+// Precompute table of line functions for fixed G2 value
+void ZZZ::PAIR_precomp(FP4 T[], ECP2* GV)
+{
+    int i, j, nb, bt;
+    BIG n, n3;
+    FP2 AA, BB, CC;
+    ECP2 A, G, NG;
+#if PAIRING_FRIENDLY_ZZZ==BN_CURVE
+    ECP2 K;
+    FP2 X;
+    FP Qx, Qy;
+    FP_rcopy(&Qx, Fra);
+    FP_rcopy(&Qy, Frb);
+    FP2_from_FPs(&X, &Qx, &Qy);
+#if SEXTIC_TWIST_ZZZ==M_TYPE
+    FP2_inv(&X, &X, NULL);
+    FP2_norm(&X);
+#endif
+#endif
+
+    ECP2_copy(&A, GV);
+    ECP2_copy(&G, GV);
+    ECP2_copy(&NG, GV);
+    ECP2_neg(&NG);
+
+    nb = PAIR_nbits(n3, n);
+    j = 0;
+
+    for (i = nb - 2; i >= 1; i--)
+    {
+        PAIR_double(&A, &AA, &BB, &CC);
+        PAIR_pack(&T[j++], &AA, &BB, &CC);
+
+        bt = BIG_bit(n3, i) - BIG_bit(n, i); // bt=BIG_bit(n,i);
+        if (bt == 1)
+        {
+            PAIR_add(&A, &G, &AA, &BB, &CC);
+            PAIR_pack(&T[j++], &AA, &BB, &CC);
+        }
+        if (bt == -1)
+        {
+            PAIR_add(&A, &NG, &AA, &BB, &CC);
+            PAIR_pack(&T[j++], &AA, &BB, &CC);
+        }
+    }
+#if PAIRING_FRIENDLY_ZZZ==BN_CURVE
+
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    ECP2_neg(&A);
+#endif
+
+    ECP2_copy(&K, &G);
+    ECP2_frob(&K, &X);
+    PAIR_add(&A, &K, &AA, &BB, &CC);
+    PAIR_pack(&T[j++], &AA, &BB, &CC);
+    ECP2_frob(&K, &X);
+    ECP2_neg(&K);
+    PAIR_add(&A, &K, &AA, &BB, &CC);
+    PAIR_pack(&T[j++], &AA, &BB, &CC);
+
+#endif
+
+}
+
+/* Accumulate another set of line functions for n-pairing, assuming precomputation on G2 */
+void ZZZ::PAIR_another_pc(FP12 r[], FP4 T[], ECP *QV)
+{
+    int i, j, nb, bt;
+    BIG n, n3;
+    FP12 lv, lv2;
+    ECP Q;
+    FP Qx, Qy;
+
+    if (ECP_isinf(QV)) return;
+
+    nb = PAIR_nbits(n3, n);
+
+    ECP_copy(&Q, QV);
+    ECP_affine(&Q);
+
+    FP_copy(&Qx, &(Q.x));
+    FP_copy(&Qy, &(Q.y));
+
+    j = 0;
+    for (i = nb - 2; i >= 1; i--)
+    {
+        PAIR_unpack(&lv, &T[j++], &Qx, &Qy);
+
+        bt = BIG_bit(n3, i) - BIG_bit(n, i); // bt=BIG_bit(n,i);
+        if (bt == 1)
+        {
+            PAIR_unpack(&lv2, &T[j++], &Qx, &Qy);
+            FP12_smul(&lv, &lv2);
+        }
+        if (bt == -1)
+        {
+            PAIR_unpack(&lv2, &T[j++], &Qx, &Qy);
+            FP12_smul(&lv, &lv2);
+        }
+        FP12_ssmul(&r[i], &lv);
+    }
+
+#if PAIRING_FRIENDLY_ZZZ==BN_CURVE
+    PAIR_unpack(&lv, &T[j++], &Qx, &Qy);
+    PAIR_unpack(&lv2, &T[j++], &Qx, &Qy);
+    FP12_smul(&lv, &lv2);
+    FP12_ssmul(&r[0], &lv);
+#endif
+}
+
+/* Accumulate another set of line functions for n-pairing */
+void ZZZ::PAIR_another(FP12 r[], ECP2* PV, ECP* QV)
+{
+    int i, nb, bt;
+    BIG n, n3;
+    FP12 lv, lv2;
+    ECP2 A, NP, P;
+    ECP Q;
+    FP Qx, Qy;
+#if PAIRING_FRIENDLY_ZZZ==BN_CURVE
+    ECP2 K;
+    FP2 X;
+    FP_rcopy(&Qx, Fra);
+    FP_rcopy(&Qy, Frb);
+    FP2_from_FPs(&X, &Qx, &Qy);
+#if SEXTIC_TWIST_ZZZ==M_TYPE
+    FP2_inv(&X, &X, NULL);
+    FP2_norm(&X);
+#endif
+#endif
+
+    if (ECP_isinf(QV)) return;
+
+    nb = PAIR_nbits(n3, n);
+
+    ECP2_copy(&P, PV);
+    ECP_copy(&Q, QV);
+
+    ECP2_affine(&P);
+    ECP_affine(&Q);
+
+    FP_copy(&Qx, &(Q.x));
+    FP_copy(&Qy, &(Q.y));
+
+    ECP2_copy(&A, &P);
+    ECP2_copy(&NP, &P); ECP2_neg(&NP);
+
+    for (i = nb - 2; i >= 1; i--)
+    {
+        PAIR_line(&lv, &A, &A, &Qx, &Qy);
+
+        bt = BIG_bit(n3, i) - BIG_bit(n, i); // bt=BIG_bit(n,i);
+        if (bt == 1)
+        {
+            PAIR_line(&lv2, &A, &P, &Qx, &Qy);
+            FP12_smul(&lv, &lv2);
+        }
+        if (bt == -1)
+        {
+            PAIR_line(&lv2, &A, &NP, &Qx, &Qy);
+            FP12_smul(&lv, &lv2);
+        }
+        FP12_ssmul(&r[i], &lv);
+    }
+
+#if PAIRING_FRIENDLY_ZZZ==BN_CURVE
+
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    ECP2_neg(&A);
+#endif
+
+    ECP2_copy(&K, &P);
+    ECP2_frob(&K, &X);
+    PAIR_line(&lv, &A, &K, &Qx, &Qy);
+    ECP2_frob(&K, &X);
+    ECP2_neg(&K);
+    PAIR_line(&lv2, &A, &K, &Qx, &Qy);
+    FP12_smul(&lv, &lv2);
+    FP12_ssmul(&r[0], &lv);
+
+#endif
+}
+
+/* Optimal single R-ate pairing r=e(P,Q) */
+void ZZZ::PAIR_ate(FP12 *r, ECP2 *P1, ECP *Q1)
+{
+    BIG n, n3;
+    FP Qx, Qy;
+    int i, nb, bt;
+    ECP2 A, NP, P;
+    ECP Q;
+    FP12 lv, lv2;
+#if PAIRING_FRIENDLY_ZZZ==BN_CURVE
+    ECP2 KA;
+    FP2 X;
+
+    FP_rcopy(&Qx, Fra);
+    FP_rcopy(&Qy, Frb);
+    FP2_from_FPs(&X, &Qx, &Qy);
+
+#if SEXTIC_TWIST_ZZZ==M_TYPE
+    FP2_inv(&X, &X, NULL);
+    FP2_norm(&X);
+#endif
+
+#endif
+
+    FP12_one(r);
+    if (ECP_isinf(Q1)) return;
+
+    nb = PAIR_nbits(n3, n);
+
+    ECP2_copy(&P, P1);
+    ECP_copy(&Q, Q1);
+
+    ECP2_affine(&P);
+    ECP_affine(&Q);
+
+    FP_copy(&Qx, &(Q.x));
+    FP_copy(&Qy, &(Q.y));
+
+    ECP2_copy(&A, &P);
+    ECP2_copy(&NP, &P); ECP2_neg(&NP);
+
+    /* Main Miller Loop */
+    for (i = nb - 2; i >= 1; i--)
+    {
+        FP12_sqr(r, r);
+        PAIR_line(&lv, &A, &A, &Qx, &Qy);
+
+        bt = BIG_bit(n3, i) - BIG_bit(n, i); // bt=BIG_bit(n,i);
+        if (bt == 1)
+        {
+            PAIR_line(&lv2, &A, &P, &Qx, &Qy);
+            FP12_smul(&lv, &lv2);
+        }
+        if (bt == -1)
+        {
+            PAIR_line(&lv2, &A, &NP, &Qx, &Qy);
+            FP12_smul(&lv, &lv2);
+        }
+        FP12_ssmul(r, &lv);
+    }
+
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    FP12_conj(r, r);
+#endif
+
+    /* R-ate fixup required for BN curves */
+#if PAIRING_FRIENDLY_ZZZ==BN_CURVE
+
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    ECP2_neg(&A);
+#endif
+
+    ECP2_copy(&KA, &P);
+    ECP2_frob(&KA, &X);
+    PAIR_line(&lv, &A, &KA, &Qx, &Qy);
+    ECP2_frob(&KA, &X);
+    ECP2_neg(&KA);
+    PAIR_line(&lv2, &A, &KA, &Qx, &Qy);
+    FP12_smul(&lv, &lv2);
+    FP12_ssmul(r, &lv);
+#endif
+}
+
+/* Optimal R-ate double pairing e(P,Q).e(R,S) */
+void ZZZ::PAIR_double_ate(FP12 *r, ECP2 *P1, ECP *Q1, ECP2 *R1, ECP *S1)
+{
+
+    BIG n, n3;
+    FP Qx, Qy, Sx, Sy;
+    int i, nb, bt;
+    ECP2 A, B, NP, NR, P, R;
+    ECP Q, S;
+    FP12 lv, lv2;
+#if PAIRING_FRIENDLY_ZZZ==BN_CURVE
+    ECP2 K;
+    FP2 X;
+
+    FP_rcopy(&Qx, Fra);
+    FP_rcopy(&Qy, Frb);
+    FP2_from_FPs(&X, &Qx, &Qy);
+
+#if SEXTIC_TWIST_ZZZ==M_TYPE
+    FP2_inv(&X, &X, NULL);
+    FP2_norm(&X);
+#endif
+
+#endif
+
+    if (ECP_isinf(Q1))
+    {
+        PAIR_ate(r, R1, S1);
+        return;
+    }
+    if (ECP_isinf(S1))
+    {
+        PAIR_ate(r, P1, Q1);
+        return;
+    }
+
+    nb = PAIR_nbits(n3, n);
+
+    ECP2_copy(&P, P1);
+    ECP_copy(&Q, Q1);
+
+    ECP2_affine(&P);
+    ECP_affine(&Q);
+
+    ECP2_copy(&R, R1);
+    ECP_copy(&S, S1);
+
+    ECP2_affine(&R);
+    ECP_affine(&S);
+
+    FP_copy(&Qx, &(Q.x));
+    FP_copy(&Qy, &(Q.y));
+
+    FP_copy(&Sx, &(S.x));
+    FP_copy(&Sy, &(S.y));
+
+    ECP2_copy(&A, &P);
+    ECP2_copy(&B, &R);
+
+    ECP2_copy(&NP, &P); ECP2_neg(&NP);
+    ECP2_copy(&NR, &R); ECP2_neg(&NR);
+
+    FP12_one(r);
+
+    /* Main Miller Loop */
+    for (i = nb - 2; i >= 1; i--)
+    {
+        FP12_sqr(r, r);
+        PAIR_line(&lv, &A, &A, &Qx, &Qy);
+        PAIR_line(&lv2, &B, &B, &Sx, &Sy);
+        FP12_smul(&lv, &lv2);
+        FP12_ssmul(r, &lv);
+
+        bt = BIG_bit(n3, i) - BIG_bit(n, i); // bt=BIG_bit(n,i);
+        if (bt == 1)
+        {
+            PAIR_line(&lv, &A, &P, &Qx, &Qy);
+            PAIR_line(&lv2, &B, &R, &Sx, &Sy);
+            FP12_smul(&lv, &lv2);
+            FP12_ssmul(r, &lv);
+        }
+        if (bt == -1)
+        {
+            PAIR_line(&lv, &A, &NP, &Qx, &Qy);
+            PAIR_line(&lv2, &B, &NR, &Sx, &Sy);
+            FP12_smul(&lv, &lv2);
+            FP12_ssmul(r, &lv);
+        }
+    }
+
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    FP12_conj(r, r);
+#endif
+    /* R-ate fixup required for BN curves */
+#if PAIRING_FRIENDLY_ZZZ==BN_CURVE
+
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    ECP2_neg(&A);
+    ECP2_neg(&B);
+#endif
+
+    ECP2_copy(&K, &P);
+    ECP2_frob(&K, &X);
+    PAIR_line(&lv, &A, &K, &Qx, &Qy);
+    ECP2_frob(&K, &X);
+    ECP2_neg(&K);
+    PAIR_line(&lv2, &A, &K, &Qx, &Qy);
+    FP12_smul(&lv, &lv2);
+    FP12_ssmul(r, &lv);
+
+    ECP2_copy(&K, &R);
+    ECP2_frob(&K, &X);
+    PAIR_line(&lv, &B, &K, &Sx, &Sy);
+    ECP2_frob(&K, &X);
+    ECP2_neg(&K);
+    PAIR_line(&lv2, &B, &K, &Sx, &Sy);
+    FP12_smul(&lv, &lv2);
+    FP12_ssmul(r, &lv);
+#endif
+}
+
+/* final exponentiation - keep separate for multi-pairings and to avoid thrashing stack */
+void ZZZ::PAIR_fexp(FP12 *r)
+{
+    FP2 X;
+    BIG x;
+    FP a, b;
+    FP12 t0, y0, y1;
+#if PAIRING_FRIENDLY_ZZZ==BN_CURVE
+    FP12 y2, y3;
+#endif
+    BIG_rcopy(x, CURVE_Bnx);
+    FP_rcopy(&a, Fra);
+    FP_rcopy(&b, Frb);
+    FP2_from_FPs(&X, &a, &b);
+
+    /* Easy part of final exp */
+
+    FP12_inv(&t0, r);
+    FP12_conj(r, r);
+
+    FP12_mul(r, &t0);
+    FP12_copy(&t0, r);
+
+    FP12_frob(r, &X);
+    FP12_frob(r, &X);
+    FP12_mul(r, &t0);
+
+    /* Hard part of final exp - see Duquesne & Ghamman eprint 2015/192.pdf */
+#if PAIRING_FRIENDLY_ZZZ==BN_CURVE
+    FP12_pow(&t0, r, x); // t0=f^-u
+#if SIGN_OF_X_ZZZ==POSITIVEX
+    FP12_conj(&t0, &t0);
+#endif
+    FP12_usqr(&y3, &t0); // y3=t0^2
+    FP12_copy(&y0, &t0);
+    FP12_mul(&y0, &y3); // y0=t0*y3
+    FP12_copy(&y2, &y3);
+    FP12_frob(&y2, &X); // y2=y3^p
+    FP12_mul(&y2, &y3); //y2=y2*y3
+    FP12_usqr(&y2, &y2); //y2=y2^2
+    FP12_mul(&y2, &y3); // y2=y2*y3
+
+    FP12_pow(&t0, &y0, x); //t0=y0^-u
+#if SIGN_OF_X_ZZZ==POSITIVEX
+    FP12_conj(&t0, &t0);
+#endif
+    FP12_conj(&y0, r);    //y0=~r
+    FP12_copy(&y1, &t0);
+    FP12_frob(&y1, &X);
+    FP12_frob(&y1, &X); //y1=t0^p^2
+    FP12_mul(&y1, &y0); // y1=y0*y1
+    FP12_conj(&t0, &t0); // t0=~t0
+    FP12_copy(&y3, &t0);
+    FP12_frob(&y3, &X); //y3=t0^p
+    FP12_mul(&y3, &t0); // y3=t0*y3
+    FP12_usqr(&t0, &t0); // t0=t0^2
+    FP12_mul(&y1, &t0); // y1=t0*y1
+
+    FP12_pow(&t0, &y3, x); // t0=y3^-u
+#if SIGN_OF_X_ZZZ==POSITIVEX
+    FP12_conj(&t0, &t0);
+#endif
+    FP12_usqr(&t0, &t0); //t0=t0^2
+    FP12_conj(&t0, &t0); //t0=~t0
+    FP12_mul(&y3, &t0); // y3=t0*y3
+
+    FP12_frob(r, &X);
+    FP12_copy(&y0, r);
+    FP12_frob(r, &X);
+    FP12_mul(&y0, r);
+    FP12_frob(r, &X);
+    FP12_mul(&y0, r);
+
+    FP12_usqr(r, &y3); //r=y3^2
+    FP12_mul(r, &y2);  //r=y2*r
+    FP12_copy(&y3, r);
+    FP12_mul(&y3, &y0); // y3=r*y0
+    FP12_mul(r, &y1); // r=r*y1
+    FP12_usqr(r, r); // r=r^2
+    FP12_mul(r, &y3); // r=r*y3
+    FP12_reduce(r);
+#else
+ 
+// See https://eprint.iacr.org/2020/875.pdf
+    FP12_usqr(&y1,r);
+    FP12_mul(&y1,r);     // y1=r^3
+
+    FP12_pow(&y0,r,x);   // y0=r^x
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    FP12_conj(&y0, &y0);
+#endif
+    FP12_conj(&t0,r);    // t0=r^-1
+    FP12_copy(r,&y0);
+    FP12_mul(r,&t0);    // r=r^(x-1)
+
+    FP12_pow(&y0,r,x);   // y0=r^x
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    FP12_conj(&y0, &y0);
+#endif
+    FP12_conj(&t0,r);    // t0=r^-1
+    FP12_copy(r,&y0);
+    FP12_mul(r,&t0);    // r=r^(x-1)
+
+// ^(x+p)
+    FP12_pow(&y0,r,x);  // y0=r^x
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    FP12_conj(&y0, &y0);
+#endif
+    FP12_copy(&t0,r);   
+    FP12_frob(&t0,&X); // t0=r^p
+    FP12_copy(r,&y0);
+    FP12_mul(r,&t0); // r=r^x.r^p
+
+// ^(x^2+p^2-1)
+    FP12_pow(&y0,r,x);  
+    FP12_pow(&y0,&y0,x); // y0=r^x^2
+    FP12_copy(&t0,r);    
+    FP12_frob(&t0,&X);
+    FP12_frob(&t0,&X);   // t0=r^p^2
+    FP12_mul(&y0,&t0);   // y0=r^x^2.r^p^2
+    FP12_conj(&t0,r);    // t0=r^-1
+    FP12_copy(r,&y0);    // 
+    FP12_mul(r,&t0);     // r=r^x^2.r^p^2.r^-1
+
+    FP12_mul(r,&y1);    
+    FP12_reduce(r);
+#endif
+}
+
+#ifdef USE_GLV_ZZZ
+/* GLV method */
+static void ZZZ::glv(BIG u[2], BIG ee)
+{
+    BIG q;
+    BIG_rcopy(q, CURVE_Order);
+#if PAIRING_FRIENDLY_ZZZ==BN_CURVE
+    int i, j;
+    BIG v[2], t;
+    DBIG d;
+
+    for (i = 0; i < 2; i++)
+    {
+        BIG_rcopy(t, CURVE_W[i]);
+        BIG_mul(d, t, ee);
+        BIG_ctddiv(v[i],d,q,BIG_nbits(t));
+        BIG_zero(u[i]);
+    }
+    BIG_copy(u[0], ee);
+    for (i = 0; i < 2; i++)
+        for (j = 0; j < 2; j++)
+        {
+            BIG_rcopy(t, CURVE_SB[j][i]);
+            BIG_modmul(t, v[j], t, q);
+            BIG_add(u[i], u[i], q);
+            BIG_sub(u[i], u[i], t);
+            BIG_ctmod(u[i],q,1);
+        }
+
+    //BIG x, x2;
+    //BIG_rcopy(x, CURVE_Bnx);
+    //BIG_smul(x2, x, x);
+    //BIG_imul(x2,x2,6);
+    //printf("bits(6x^2) = %d \n",BIG_nbits(x2));
+
+#else
+// -(x^2).P = (Beta.x,y)
+    int bd;
+    BIG x, x2;
+    BIG_rcopy(x, CURVE_Bnx);
+
+    BIG_smul(x2, x, x);
+    bd=BIG_nbits(q)-BIG_nbits(x2); // fixed
+    BIG_copy(u[0], ee);
+    BIG_ctmod(u[0], x2, bd);
+    BIG_copy(u[1], ee);
+    BIG_ctsdiv(u[1], x2, bd);
+
+    BIG_sub(u[1], q, u[1]);
+
+#endif
+
+    return;
+}
+#endif // USE_GLV
+
+/* Galbraith & Scott Method */
+static void ZZZ::gs(BIG u[4], BIG ee)
+{
+    int i;
+    BIG q;
+    BIG_rcopy(q, CURVE_Order);
+
+#if PAIRING_FRIENDLY_ZZZ==BN_CURVE
+    int j;
+    BIG v[4], t;
+    DBIG d;
+
+    for (i = 0; i < 4; i++)
+    {
+        BIG_rcopy(t, CURVE_WB[i]);
+        BIG_mul(d, t, ee);
+        BIG_ctddiv(v[i],d,q,BIG_nbits(t));
+        BIG_zero(u[i]);
+    }
+
+    BIG_copy(u[0], ee);
+    for (i = 0; i < 4; i++)
+        for (j = 0; j < 4; j++)
+        {
+            BIG_rcopy(t, CURVE_BB[j][i]);
+            BIG_modmul(t, v[j], t, q);
+            BIG_add(u[i], u[i], q);
+            BIG_sub(u[i], u[i], t);
+            BIG_ctmod(u[i],q,1);
+        }
+
+    //BIG x;
+    //BIG_rcopy(x, CURVE_Bnx);
+    //BIG_imul(x,x,3);
+    //printf("bits(3x) = %d \n",BIG_nbits(x));
+
+#else
+    int bd;
+    BIG x, w;
+
+    BIG_rcopy(x, CURVE_Bnx);
+    BIG_copy(w, ee);
+    bd=BIG_nbits(q)-BIG_nbits(x); // fixed
+
+    for (i = 0; i < 3; i++)
+    {
+        BIG_copy(u[i], w);
+        BIG_ctmod(u[i],x,bd);
+        BIG_ctsdiv(w,x,bd);
+    }
+    BIG_copy(u[3], w);
+
+    /*  */
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    BIG_modneg(u[1], u[1], q);
+    BIG_modneg(u[3], u[3], q);
+#endif
+
+#endif
+    return;
+}
+
+/* Multiply P by e in group G1 */
+void ZZZ::PAIR_G1mul(ECP *P, BIG e)
+{
+    BIG ee,q;
+    BIG_copy(ee,e);
+    BIG_rcopy(q, CURVE_Order);
+    BIG_mod(ee,q);
+#ifdef USE_GLV_ZZZ   /* Note this method is patented */
+    int np, nn;
+    ECP Q;
+    FP cru;
+    BIG t;
+    BIG u[2];
+    glv(u, ee);
+
+    ECP_copy(&Q, P); ECP_affine(&Q);
+    FP_rcopy(&cru, CRu);
+    FP_mul(&(Q.x), &(Q.x), &cru);
+
+    /* note that -a.B = a.(-B). Use a or -a depending on which is smaller */
+
+    np = BIG_nbits(u[0]);
+    BIG_modneg(t, u[0], q);
+    nn = BIG_nbits(t);
+    if (nn < np)
+    {
+        BIG_copy(u[0], t);
+        ECP_neg(P);
+    }
+
+    np = BIG_nbits(u[1]);
+    BIG_modneg(t, u[1], q);
+    nn = BIG_nbits(t);
+    if (nn < np)
+    {
+        BIG_copy(u[1], t);
+        ECP_neg(&Q);
+    }
+    BIG_norm(u[0]);
+    BIG_norm(u[1]);
+    ECP_mul2(P, &Q, u[0], u[1]);
+
+    //printf("nbits(q) = %d\n",BIG_nbits(q));
+    //printf("nbits(q)/2 = %d\n",BIG_nbits(q)/2);
+    //printf("u[0] %d = ",BIG_nbits(u[0]));BIG_output(u[0]); printf("\n");
+    //printf("u[1] %d = ",BIG_nbits(u[1]));BIG_output(u[1]); printf("\n");
+#else
+    ECP_clmul(P, ee, q);
+#endif
+}
+
+/* Multiply P by e in group G2 */
+void ZZZ::PAIR_G2mul(ECP2 *P, BIG e)
+{
+    BIG ee,q;
+    BIG_copy(ee,e);
+    BIG_rcopy(q, CURVE_Order);
+    BIG_mod(ee,q);
+#ifdef USE_GS_G2_ZZZ   /* Well I didn't patent it :) */
+    int i, np, nn;
+    ECP2 Q[4];
+    FP2 X;
+    FP fx, fy;
+    BIG x, u[4];
+
+    FP_rcopy(&fx, Fra);
+    FP_rcopy(&fy, Frb);
+    FP2_from_FPs(&X, &fx, &fy);
+
+#if SEXTIC_TWIST_ZZZ==M_TYPE
+    FP2_inv(&X, &X, NULL);
+    FP2_norm(&X);
+#endif
+
+    gs(u, ee);
+
+    ECP2_copy(&Q[0], P);
+    for (i = 1; i < 4; i++)
+    {
+        ECP2_copy(&Q[i], &Q[i - 1]);
+        ECP2_frob(&Q[i], &X);
+    }
+
+    for (i = 0; i < 4; i++)
+    {
+        np = BIG_nbits(u[i]);
+        BIG_modneg(x, u[i], q);
+        nn = BIG_nbits(x);
+        if (nn < np)
+        {
+            BIG_copy(u[i], x);
+            ECP2_neg(&Q[i]);
+        }
+        BIG_norm(u[i]);
+    }
+    ECP2_mul4(P, Q, u);
+
+    //printf("nbits(q) = %d\n",BIG_nbits(q));
+    //printf("nbits(q)/4 = %d\n",BIG_nbits(q)/4);
+    //printf("u[0] %d = ",BIG_nbits(u[0]));BIG_output(u[0]); printf("\n");
+    //printf("u[1] %d = ",BIG_nbits(u[1]));BIG_output(u[1]); printf("\n");
+    //printf("u[2] %d = ",BIG_nbits(u[2]));BIG_output(u[2]); printf("\n");
+    //printf("u[3] %d = ",BIG_nbits(u[3]));BIG_output(u[3]); printf("\n");
+
+
+#else
+    ECP2_mul(P, ee);
+#endif
+}
+
+/* f=f^e */
+void ZZZ::PAIR_GTpow(FP12 *f, BIG e)
+{
+    BIG ee,q;
+    BIG_copy(ee,e);
+    BIG_rcopy(q, CURVE_Order);
+    BIG_mod(ee,q);
+#ifdef USE_GS_GT_ZZZ   /* Note that this option requires a lot of RAM! Maybe better to use compressed XTR method, see fp4.c */
+    int i, np, nn;
+    FP12 g[4];
+    FP2 X;
+    BIG t;
+    FP fx, fy;
+    BIG u[4];
+
+    FP_rcopy(&fx, Fra);
+    FP_rcopy(&fy, Frb);
+    FP2_from_FPs(&X, &fx, &fy);
+
+    gs(u, ee);
+
+    FP12_copy(&g[0], f);
+    for (i = 1; i < 4; i++)
+    {
+        FP12_copy(&g[i], &g[i - 1]);
+        FP12_frob(&g[i], &X);
+    }
+
+    for (i = 0; i < 4; i++)
+    {
+        np = BIG_nbits(u[i]);
+        BIG_modneg(t, u[i], q);
+        nn = BIG_nbits(t);
+        if (nn < np)
+        {
+            BIG_copy(u[i], t);
+            FP12_conj(&g[i], &g[i]);
+        }
+        BIG_norm(u[i]);
+    }
+    FP12_pow4(f, g, u);
+
+#else
+    FP12_pow(f, f, ee);
+#endif
+}
+
+/* test G1 group membership */
+
+int ZZZ::PAIR_G1member(ECP *P)
+{
+    ECP W,T;
+    BIG x;
+    FP cru;
+    if (ECP_isinf(P)) return 0;
+#if PAIRING_FRIENDLY_ZZZ!=BN_CURVE
+    BIG_rcopy(x, CURVE_Bnx);
+    ECP_copy(&W,P);
+    ECP_copy(&T,P);
+    ECP_mul(&T,x);
+    if (ECP_equals(P,&T)) return 0;    // P is of low order
+    ECP_mul(&T,x);
+    ECP_neg(&T);
+
+    FP_rcopy(&cru, CRu);
+    FP_mul(&(W.x), &(W.x), &cru);
+    if (!ECP_equals(&W,&T)) return 0;  // check that Endomorphism works
+
+// Not needed
+//    ECP_add(&W,P);
+//    FP_mul(&(T.x), &(T.x), &cru);
+//    ECP_add(&W,&T);
+//    if (!ECP_isinf(&W)) return 0;      // use it to check order
+/*
+    BIG_rcopy(q, CURVE_Order);
+	ECP_copy(&W,P);
+	ECP_mul(&W,q);
+	if (!ECP_isinf(&W)) return 0; */
+#endif
+	return 1; 
+}
+
+/* test G2 group membership */
+int ZZZ::PAIR_G2member(ECP2 *P)
+{
+    ECP2 W,T;
+    BIG x;
+    FP2 X;
+    FP fx, fy;
+
+    if (ECP2_isinf(P)) return 0;
+    FP_rcopy(&fx, Fra);
+    FP_rcopy(&fy, Frb);
+    FP2_from_FPs(&X, &fx, &fy);
+#if SEXTIC_TWIST_ZZZ==M_TYPE
+    FP2_inv(&X, &X, NULL);
+    FP2_norm(&X);
+#endif
+    BIG_rcopy(x, CURVE_Bnx);
+
+    ECP2_copy(&T,P);
+    ECP2_mul(&T,x);
+
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    ECP2_neg(&T);
+#endif
+
+#if PAIRING_FRIENDLY_ZZZ==BN_CURVE
+//https://eprint.iacr.org/2022/348.pdf
+    ECP2_copy(&W,&T);
+    ECP2_frob(&W,&X); // W=\psi(xP)
+    ECP2_add(&T,P); // T=xP+P
+    ECP2_add(&T,&W); // T=xP+P+\psi(xP)
+    ECP2_frob(&W,&X); // W=\psi^2(xP)
+    ECP2_add(&T,&W); // T=xp+P+\psi(xP)+\psi^2(xP)
+    ECP2_frob(&W,&X); // W=\psi^3(xP)
+    ECP2_dbl(&W); // W=\psi^3(2xP)
+#else
+//https://eprint.iacr.org/2021/1130
+    ECP2_copy(&W,P);
+    ECP2_frob(&W, &X);    // W=\psi(P)    
+#endif
+
+    if (ECP2_equals(&W,&T)) return 1;
+    return 0;
+}
+
+/* Check that m is in cyclotomic sub-group */
+/* Check that m!=1, conj(m)*m==1, and m.m^{p^4}=m^{p^2} */
+int ZZZ::PAIR_GTcyclotomic(FP12 *m)
+{
+	FP fx,fy;
+	FP2 X;
+	FP12 r,w;
+	if (FP12_isunity(m)) return 0;
+	FP12_conj(&r,m);
+	FP12_mul(&r,m);
+	if (!FP12_isunity(&r)) return 0;
+
+	FP_rcopy(&fx,Fra);
+	FP_rcopy(&fy,Frb);
+	FP2_from_FPs(&X,&fx,&fy);
+
+	FP12_copy(&r,m); FP12_frob(&r,&X); FP12_frob(&r,&X);
+	FP12_copy(&w,&r); FP12_frob(&w,&X); FP12_frob(&w,&X);
+	FP12_mul(&w,m);
+
+	if (!FP12_equals(&w,&r)) return 0;
+    return 1;
+}
+
+/* test for full GT group membership */
+int ZZZ::PAIR_GTmember(FP12 *m)
+{
+    BIG x;
+    FP2 X;
+    FP fx, fy;
+    FP12 r,t;
+    if (!PAIR_GTcyclotomic(m)) return 0;
+
+    FP_rcopy(&fx, Fra);
+    FP_rcopy(&fy, Frb);
+    FP2_from_FPs(&X, &fx, &fy);
+    BIG_rcopy(x, CURVE_Bnx);
+
+    FP12_pow(&t,m,x);
+
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    FP12_conj(&t,&t);
+#endif
+
+#if PAIRING_FRIENDLY_ZZZ==BN_CURVE
+//https://eprint.iacr.org/2022/348.pdf
+    FP12_copy(&r,&t);
+    FP12_frob(&r,&X); // r=(m^x)^p
+    FP12_mul(&t,m); // t=(m^x).m
+    FP12_mul(&t,&r); // t=(m^x).m.(m^x)^p
+    FP12_frob(&r,&X); // r=(m^x)^p^2
+    FP12_mul(&t,&r); // t=(m^x).m.(m^x)^p.(m^x)^p^2
+    FP12_frob(&r,&X); // r=(m^x)^p^3
+    FP12_usqr(&r,&r); // r=(m^2x)^p^3
+#else
+//https://eprint.iacr.org/2021/1130
+    FP12_copy(&r,m);
+    FP12_frob(&r, &X);  
+#endif
+
+    if (FP12_equals(&r,&t)) return 1;
+    return 0;
+}
+
+#ifdef HAS_MAIN
+
+int main()
+{
+    int i;
+    char byt[32];
+    csprng rng;
+    BIG xa, xb, ya, yb, w, a, b, t1, q, u[2], v[4], m, r;
+    ECP2 P, G;
+    ECP Q, R;
+    FP12 g, gp;
+    FP4 t, c, cp, cpm1, cpm2;
+    FP2 x, y, X;
+
+
+    BIG_rcopy(a, CURVE_Fra);
+    BIG_rcopy(b, CURVE_Frb);
+    FP2_from_BIGs(&X, a, b);
+
+    BIG_rcopy(xa, CURVE_Gx);
+    BIG_rcopy(ya, CURVE_Gy);
+
+    ECP_set(&Q, xa, ya);
+    if (Q.inf) printf("Failed to set - point not on curve\n");
+    else printf("G1 set success\n");
+
+    printf("Q= ");
+    ECP_output(&Q);
+    printf("\n");
+
+    BIG_rcopy(xa, CURVE_Pxa);
+    BIG_rcopy(xb, CURVE_Pxb);
+    BIG_rcopy(ya, CURVE_Pya);
+    BIG_rcopy(yb, CURVE_Pyb);
+
+    FP2_from_BIGs(&x, xa, xb);
+    FP2_from_BIGs(&y, ya, yb);
+
+    ECP2_set(&P, &x, &y);
+    if (P.inf) printf("Failed to set - point not on curve\n");
+    else printf("G2 set success\n");
+
+    printf("P= ");
+    ECP2_output(&P);
+    printf("\n");
+
+    for (i = 0; i < 1000; i++ )
+    {
+        PAIR_ate(&g, &P, &Q);
+        PAIR_fexp(&g);
+    }
+    printf("g= ");
+    FP12_output(&g);
+    printf("\n");
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/pair.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/pair.h
new file mode 100644
index 0000000..e7e445f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/pair.h
@@ -0,0 +1,183 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef PAIR_ZZZ_H
+#define PAIR_ZZZ_H
+
+#include "fp12_YYY.h"
+#include "ecp2_ZZZ.h"
+#include "ecp_ZZZ.h"
+
+using namespace core;
+
+namespace ZZZ {
+/* Pairing constants */
+
+extern const XXX::BIG CURVE_Bnx; /**< BN curve x parameter */
+extern const XXX::BIG CURVE_Cru; /**< BN curve Cube Root of Unity */
+
+extern const XXX::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const XXX::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const XXX::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const XXX::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+/* Pairing function prototypes */
+
+
+/**	@brief Precompute line functions details for fixed G2 value
+ *
+	@param T array of precomputed FP4 partial line functions
+	@param GV a fixed ECP2 instance
+ */
+extern void PAIR_precomp(YYY::FP4 T[], ECP2* GV);
+
+/**	@brief Compute line functions for n-pairing
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param PV ECP2 instance, an element of G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another(YYY::FP12 r[], ECP2* PV, ECP* QV);
+
+
+/**	@brief Compute line functions for n-pairing, assuming precomputation on G2
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param T array contains precomputed partial line fucntions from G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another_pc(YYY::FP12 r[], YYY::FP4 T[], ECP *QV);
+
+
+
+/**	@brief Calculate Miller loop for Optimal ATE pairing e(P,Q)
+ *
+	@param r FP12 result of the pairing calculation e(P,Q)
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+
+ */
+extern void PAIR_ate(YYY::FP12 *r, ECP2 *P, ECP *Q);
+/**	@brief Calculate Miller loop for Optimal ATE double-pairing e(P,Q).e(R,S)
+ *
+	Faster than calculating two separate pairings
+	@param r FP12 result of the pairing calculation e(P,Q).e(R,S), an element of GT
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+	@param R ECP2 instance, an element of G2
+	@param S ECP instance, an element of G1
+ */
+extern void PAIR_double_ate(YYY::FP12 *r, ECP2 *P, ECP *Q, ECP2 *R, ECP *S);
+/**	@brief Final exponentiation of pairing, converts output of Miller loop to element in GT
+ *
+	Here p is the internal modulus, and r is the group order
+	@param x FP12, on exit = x^((p^12-1)/r)
+ */
+extern void PAIR_fexp(YYY::FP12 *x);
+/**	@brief Fast point multiplication of a member of the group G1 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param Q ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G1mul(ECP *Q, XXX::BIG b);
+/**	@brief Fast point multiplication of a member of the group G2 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param P ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G2mul(ECP2 *P, XXX::BIG b);
+
+
+
+/**	@brief Fast raising of a member of GT to a BIG power
+ *
+	May exploit endomorphism for speed.
+	@param x FP12 member of GT.
+	@param b BIG exponent
+
+ */
+extern void PAIR_GTpow(YYY::FP12 *x, XXX::BIG b);
+
+
+/**	@brief Tests ECP for membership of G1
+ *
+	@param P ECP member of G1
+	@return true or false
+
+ */
+extern int PAIR_G1member(ZZZ::ECP *P);
+
+/**	@brief Tests ECP2 for membership of G2
+ *
+	@param P ECP2 member of G2
+	@return true or false
+
+ */
+extern int PAIR_G2member(ZZZ::ECP2 *P);
+
+/**	@brief Tests FP12 for membership of cyclotomic sub-group
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTcyclotomic(YYY::FP12 *x);
+
+/**	@brief Tests FP12 for membership of GT
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTmember(YYY::FP12 *x);
+
+/**	@brief Prepare Ate parameter
+ *
+	@param n BIG parameter
+	@param n3 BIG paramter = 3*n
+	@return number of nits in n3
+
+ */
+extern int PAIR_nbits(XXX::BIG n3, XXX::BIG n);
+
+/**	@brief Initialise structure for multi-pairing
+ *
+	@param r FP12 array, to be initialised to 1
+
+ */
+extern void PAIR_initmp(YYY::FP12 r[]);
+
+
+/**	@brief Miller loop
+ *
+ 	@param res FP12 result
+	@param r FP12 precomputed array of accumulated line functions
+
+ */
+extern void PAIR_miller(YYY::FP12 *res, YYY::FP12 r[]);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/pair4.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/pair4.cpp
new file mode 100644
index 0000000..53b53e0
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/pair4.cpp
@@ -0,0 +1,1087 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* CORE BLS Curve pairing functions */
+
+//#define HAS_MAIN
+
+#include "pair4_ZZZ.h"
+
+using namespace XXX;
+using namespace YYY;
+
+namespace ZZZ {
+static void PAIR_line(FP24 *, ECP4 *, ECP4 *, FP *, FP *);
+static void PAIR_double(ECP4 *, FP4 *, FP4 *, FP4 *);
+static void PAIR_add(ECP4 *, ECP4 *B, FP4 *, FP4 *, FP4 *);
+static void PAIR_pack(FP8 *, FP4 *, FP4 *, FP4 *);
+static void PAIR_unpack(FP24 *, FP8 *, FP *, FP *);
+static void glv(BIG u[2], BIG);
+static void gs(BIG u[4], BIG);
+}
+
+
+// Point doubling for pairings
+static void ZZZ::PAIR_double(ECP4 *A, FP4 *AA, FP4 *BB, FP4 *CC)
+{
+    FP4 YY;
+    FP4_copy(CC, &(A->x));  //FP4 XX=new FP4(A.getx());  //X
+    FP4_copy(&YY, &(A->y)); //FP4 YY=new FP4(A.gety());  //Y
+    FP4_copy(BB, &(A->z));  //FP4 ZZ=new FP4(A.getz());  //Z
+
+    FP4_copy(AA, &YY);      //FP4 YZ=new FP4(YY);        //Y
+    FP4_mul(AA, AA, BB);    //YZ.mul(ZZ);                //YZ
+    FP4_sqr(CC, CC);        //XX.sqr();                //X^2
+    FP4_sqr(&YY, &YY);      //YY.sqr();                //Y^2
+    FP4_sqr(BB, BB);        //ZZ.sqr();                //Z^2
+
+    FP4_add(AA, AA, AA);
+    FP4_neg(AA, AA);
+    FP4_norm(AA);           // -2YZ
+    FP4_times_i(AA);        // -2YZi
+
+    FP4_imul(BB, BB, 3 * CURVE_B_I); //3Bz^2
+    FP4_imul(CC, CC, 3);            //3X^2
+
+#if SEXTIC_TWIST_ZZZ==D_TYPE
+    FP4_times_i(&YY);                   // Y^2.i
+    FP4_times_i(CC);                    // 3X^2.i
+#endif
+
+#if SEXTIC_TWIST_ZZZ==M_TYPE
+    FP4_times_i(BB);                    // 3Bz^2.i
+#endif
+
+    FP4_sub(BB, BB, &YY);
+    FP4_norm(BB);
+
+    ECP4_dbl(A);            //A.dbl();
+
+}
+
+// Point addition for pairings
+static void ZZZ::PAIR_add(ECP4 *A, ECP4 *B, FP4 *AA, FP4 *BB, FP4 *CC)
+{
+    FP4 T1;
+    FP4_copy(AA, &(A->x));      //FP4 X1=new FP4(A.getx());    // X1
+    FP4_copy(CC, &(A->y));      //FP4 Y1=new FP4(A.gety());    // Y1
+    FP4_copy(&T1, &(A->z));     //FP4 T1=new FP4(A.getz());    // Z1
+
+    FP4_copy(BB, &T1);          //FP4 T2=new FP4(A.getz());    // Z1
+
+    FP4_mul(&T1, &T1, &(B->y)); //T1.mul(B.gety());    // T1=Z1.Y2
+    FP4_mul(BB, BB, &(B->x));   //T2.mul(B.getx());    // T2=Z1.X2
+
+    FP4_sub(AA, AA, BB);        //X1.sub(T2);
+    FP4_norm(AA);               //X1.norm();  // X1=X1-Z1.X2
+    FP4_sub(CC, CC, &T1);       //Y1.sub(T1);
+    FP4_norm(CC);               //Y1.norm();  // Y1=Y1-Z1.Y2
+
+    FP4_copy(&T1, AA);          //T1.copy(X1);            // T1=X1-Z1.X2
+
+#if SEXTIC_TWIST_ZZZ==M_TYPE
+    FP4_times_i(AA);
+    FP4_norm(AA);
+#endif
+
+    FP4_mul(&T1, &T1, &(B->y)); //T1.mul(B.gety());       // T1=(X1-Z1.X2).Y2
+
+    FP4_copy(BB, CC);           //T2.copy(Y1);            // T2=Y1-Z1.Y2
+    FP4_mul(BB, BB, &(B->x));   //T2.mul(B.getx());       // T2=(Y1-Z1.Y2).X2
+    FP4_sub(BB, BB, &T1);       //T2.sub(T1);
+    FP4_norm(BB);               //T2.norm();          // T2=(Y1-Z1.Y2).X2 - (X1-Z1.X2).Y2
+
+    FP4_neg(CC, CC);            //Y1.neg();
+    FP4_norm(CC);               //Y1.norm(); // Y1=-(Y1-Z1.Y2).Xs                - ***
+
+    ECP4_add(A, B);             //A.add(B);
+}
+
+/* Line function */
+static void ZZZ::PAIR_line(FP24 *v, ECP4 *A, ECP4 *B, FP *Qx, FP *Qy)
+{
+    FP4 AA, BB, CC;
+    FP8 a, b, c;
+
+    if (A == B)
+        PAIR_double(A, &AA, &BB, &CC);
+    else
+        PAIR_add(A, B, &AA, &BB, &CC);
+
+    FP4_qmul(&CC, &CC, Qx);
+    FP4_qmul(&AA, &AA, Qy);
+
+    FP8_from_FP4s(&a, &AA, &BB);
+#if SEXTIC_TWIST_ZZZ==D_TYPE
+    FP8_from_FP4(&b, &CC);
+    FP8_zero(&c);
+#endif
+#if SEXTIC_TWIST_ZZZ==M_TYPE
+    FP8_zero(&b);
+    FP8_from_FP4H(&c, &CC);
+#endif
+
+    FP24_from_FP8s(v, &a, &b, &c);
+    v->type = FP_SPARSER;
+}
+
+/* prepare ate parameter, n=6u+2 (BN) or n=u (BLS), n3=3*n */
+int ZZZ::PAIR_nbits(BIG n3, BIG n)
+{
+    BIG x;
+    BIG_rcopy(x, CURVE_Bnx);
+
+    BIG_copy(n, x);
+    BIG_norm(n);
+    BIG_pmul(n3, n, 3);
+    BIG_norm(n3);
+
+    return BIG_nbits(n3);
+}
+
+/*
+    For multi-pairing, product of n pairings
+    1. Declare FP24 array of length number of bits in Ate parameter
+    2. Initialise this array by calling PAIR_initmp()
+    3. Accumulate each pairing by calling PAIR_another() n times
+    4. Call PAIR_miller()
+    5. Call final exponentiation PAIR_fexp()
+*/
+
+/* prepare for multi-pairing */
+void ZZZ::PAIR_initmp(FP24 r[])
+{
+    int i;
+    for (i = ATE_BITS_ZZZ - 1; i >= 0; i--)
+        FP24_one(&r[i]);
+    return;
+}
+
+/* basic Miller loop */
+void ZZZ::PAIR_miller(FP24 *res, FP24 r[])
+{
+    int i;
+    FP24_one(res);
+    for (i = ATE_BITS_ZZZ - 1; i >= 1; i--)
+    {
+        FP24_sqr(res, res);
+        FP24_ssmul(res, &r[i]);
+        FP24_zero(&r[i]);
+    }
+
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    FP24_conj(res, res);
+#endif
+    FP24_ssmul(res, &r[0]);
+    FP24_zero(&r[0]);
+    return;
+}
+
+
+// Store precomputed line details in an FP4
+static void ZZZ::PAIR_pack(FP8 *T, FP4* AA, FP4* BB, FP4 *CC)
+{
+    FP4 I, A, B;
+    FP4_inv(&I, CC, NULL);
+    FP4_mul(&A, AA, &I);
+    FP4_mul(&B, BB, &I);
+    FP8_from_FP4s(T, &A, &B);
+}
+
+// Unpack G2 line function details and include G1
+static void ZZZ::PAIR_unpack(FP24 *v, FP8* T, FP *Qx, FP *Qy)
+{
+    FP8 a, b, c;
+    FP4 t;
+    FP8_copy(&a, T);
+    FP4_qmul(&a.a, &a.a, Qy);
+    FP4_from_FP(&t, Qx);
+
+#if SEXTIC_TWIST_ZZZ==D_TYPE
+    FP8_from_FP4(&b, &t);
+    FP8_zero(&c);
+#endif
+#if SEXTIC_TWIST_ZZZ==M_TYPE
+    FP8_zero(&b);
+    FP8_from_FP4H(&c, &t);
+#endif
+
+    FP24_from_FP8s(v, &a, &b, &c);
+    v->type = FP_SPARSEST;
+}
+
+
+// Precompute table of line functions for fixed G2 value
+void ZZZ::PAIR_precomp(FP8 T[], ECP4* GV)
+{
+    int i, j, nb, bt;
+    BIG n, n3;
+    FP4 AA, BB, CC;
+    ECP4 A, G, NG;
+
+    ECP4_copy(&A, GV);
+    ECP4_copy(&G, GV);
+    ECP4_copy(&NG, GV);
+    ECP4_neg(&NG);
+
+    nb = PAIR_nbits(n3, n);
+    j = 0;
+
+    for (i = nb - 2; i >= 1; i--)
+    {
+        PAIR_double(&A, &AA, &BB, &CC);
+        PAIR_pack(&T[j++], &AA, &BB, &CC);
+
+        bt = BIG_bit(n3, i) - BIG_bit(n, i); // bt=BIG_bit(n,i);
+        if (bt == 1)
+        {
+            PAIR_add(&A, &G, &AA, &BB, &CC);
+            PAIR_pack(&T[j++], &AA, &BB, &CC);
+        }
+        if (bt == -1)
+        {
+            PAIR_add(&A, &NG, &AA, &BB, &CC);
+            PAIR_pack(&T[j++], &AA, &BB, &CC);
+        }
+    }
+}
+
+/* Accumulate another set of line functions for n-pairing, assuming precomputation on G2 */
+void ZZZ::PAIR_another_pc(FP24 r[], FP8 T[], ECP *QV)
+{
+    int i, j, nb, bt;
+    BIG x, n, n3;
+    FP24 lv, lv2;
+    ECP Q;
+    FP Qx, Qy;
+
+    if (ECP_isinf(QV)) return;
+
+    nb = PAIR_nbits(n3, n);
+
+    ECP_copy(&Q, QV);
+    ECP_affine(&Q);
+
+    FP_copy(&Qx, &(Q.x));
+    FP_copy(&Qy, &(Q.y));
+
+    j = 0;
+    for (i = nb - 2; i >= 1; i--)
+    {
+        PAIR_unpack(&lv, &T[j++], &Qx, &Qy);
+
+        bt = BIG_bit(n3, i) - BIG_bit(n, i); // bt=BIG_bit(n,i);
+        if (bt == 1)
+        {
+            PAIR_unpack(&lv2, &T[j++], &Qx, &Qy);
+            FP24_smul(&lv, &lv2);
+        }
+        if (bt == -1)
+        {
+            PAIR_unpack(&lv2, &T[j++], &Qx, &Qy);
+            FP24_smul(&lv, &lv2);
+        }
+        FP24_ssmul(&r[i], &lv);
+    }
+}
+
+/* Accumulate another set of line functions for n-pairing */
+void ZZZ::PAIR_another(FP24 r[], ECP4* PV, ECP* QV)
+{
+    int i, j, nb, bt;
+    BIG x, n, n3;
+    FP24 lv, lv2;
+    ECP4 A, NP, P;
+    ECP Q;
+    FP Qx, Qy;
+
+    if (ECP_isinf(QV)) return;
+
+    nb = PAIR_nbits(n3, n);
+
+    ECP4_copy(&P, PV);
+    ECP_copy(&Q, QV);
+
+    ECP4_affine(&P);
+    ECP_affine(&Q);
+
+    FP_copy(&Qx, &(Q.x));
+    FP_copy(&Qy, &(Q.y));
+
+    ECP4_copy(&A, &P);
+    ECP4_copy(&NP, &P); ECP4_neg(&NP);
+
+    for (i = nb - 2; i >= 1; i--)
+    {
+        PAIR_line(&lv, &A, &A, &Qx, &Qy);
+
+        bt = BIG_bit(n3, i) - BIG_bit(n, i); // bt=BIG_bit(n,i);
+        if (bt == 1)
+        {
+            PAIR_line(&lv2, &A, &P, &Qx, &Qy);
+            FP24_smul(&lv, &lv2);
+        }
+        if (bt == -1)
+        {
+            PAIR_line(&lv2, &A, &NP, &Qx, &Qy);
+            FP24_smul(&lv, &lv2);
+        }
+        FP24_ssmul(&r[i], &lv);
+    }
+}
+
+/* Optimal R-ate pairing r=e(P,Q) */
+void ZZZ::PAIR_ate(FP24 *r, ECP4 *P1, ECP *Q1)
+{
+    BIG x, n, n3;
+    FP Qx, Qy;
+    int i, nb, bt;
+    ECP4 A, NP, P;
+    ECP Q;
+    FP24 lv, lv2;
+
+    FP24_one(r);
+    if (ECP_isinf(Q1)) return;
+
+    nb = PAIR_nbits(n3, n);
+
+    ECP4_copy(&P, P1);
+    ECP_copy(&Q, Q1);
+
+    ECP4_affine(&P);
+    ECP_affine(&Q);
+
+    FP_copy(&Qx, &(Q.x));
+    FP_copy(&Qy, &(Q.y));
+
+    ECP4_copy(&A, &P);
+    ECP4_copy(&NP, &P); ECP4_neg(&NP);
+
+    /* Main Miller Loop */
+    for (i = nb - 2; i >= 1; i--)
+    {
+        FP24_sqr(r, r);
+        PAIR_line(&lv, &A, &A, &Qx, &Qy);
+
+        bt = BIG_bit(n3, i) - BIG_bit(n, i); // BIG_bit(n,i);
+        if (bt == 1)
+        {
+            PAIR_line(&lv2, &A, &P, &Qx, &Qy);
+            FP24_smul(&lv, &lv2);
+        }
+        if (bt == -1)
+        {
+            PAIR_line(&lv2, &A, &NP, &Qx, &Qy);
+            FP24_smul(&lv, &lv2);
+        }
+        FP24_ssmul(r, &lv);
+
+    }
+
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    FP24_conj(r, r);
+#endif
+
+}
+
+/* Optimal R-ate double pairing e(P,Q).e(R,S) */
+void ZZZ::PAIR_double_ate(FP24 *r, ECP4 *P1, ECP *Q1, ECP4 *R1, ECP *S1)
+{
+    BIG x, n, n3;
+    FP Qx, Qy, Sx, Sy;
+    int i, nb, bt;
+    ECP4 A, B, NP, NR, P, R;
+    ECP Q, S;
+    FP24 lv, lv2;
+
+    if (ECP_isinf(Q1))
+    {
+        PAIR_ate(r, R1, S1);
+        return;
+    }
+    if (ECP_isinf(S1))
+    {
+        PAIR_ate(r, P1, Q1);
+        return;
+    }
+    nb = PAIR_nbits(n3, n);
+
+    ECP4_copy(&P, P1);
+    ECP_copy(&Q, Q1);
+
+    ECP4_affine(&P);
+    ECP_affine(&Q);
+
+    ECP4_copy(&R, R1);
+    ECP_copy(&S, S1);
+
+    ECP4_affine(&R);
+    ECP_affine(&S);
+
+    FP_copy(&Qx, &(Q.x));
+    FP_copy(&Qy, &(Q.y));
+
+    FP_copy(&Sx, &(S.x));
+    FP_copy(&Sy, &(S.y));
+
+    ECP4_copy(&A, &P);
+    ECP4_copy(&B, &R);
+
+    ECP4_copy(&NP, &P); ECP4_neg(&NP);
+    ECP4_copy(&NR, &R); ECP4_neg(&NR);
+
+
+    FP24_one(r);
+
+    /* Main Miller Loop */
+    for (i = nb - 2; i >= 1; i--)
+    {
+        FP24_sqr(r, r);
+        PAIR_line(&lv, &A, &A, &Qx, &Qy);
+        PAIR_line(&lv2, &B, &B, &Sx, &Sy);
+        FP24_smul(&lv, &lv2);
+        FP24_ssmul(r, &lv);
+
+        bt = BIG_bit(n3, i) - BIG_bit(n, i); // bt=BIG_bit(n,i);
+        if (bt == 1)
+        {
+            PAIR_line(&lv, &A, &P, &Qx, &Qy);
+            PAIR_line(&lv2, &B, &R, &Sx, &Sy);
+            FP24_smul(&lv, &lv2);
+            FP24_ssmul(r, &lv);
+        }
+        if (bt == -1)
+        {
+            PAIR_line(&lv, &A, &NP, &Qx, &Qy);
+            PAIR_line(&lv2, &B, &NR, &Sx, &Sy);
+            FP24_smul(&lv, &lv2);
+            FP24_ssmul(r, &lv);
+        }
+    }
+
+
+
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    FP24_conj(r, r);
+#endif
+
+}
+
+/* final exponentiation - keep separate for multi-pairings and to avoid thrashing stack */
+
+void ZZZ::PAIR_fexp(FP24 *r)
+{
+    FP2 X;
+    BIG x;
+    FP a, b;
+    FP24 t0, t1, t2; //, t3, t4, t5, t6, t7; // could lose one of these - r=t3
+
+    BIG_rcopy(x, CURVE_Bnx);
+    FP_rcopy(&a, Fra);
+    FP_rcopy(&b, Frb);
+    FP2_from_FPs(&X, &a, &b);
+
+    /* Easy part of final exp - r^(p^12-1)(p^4+1)*/
+
+    FP24_inv(&t0, r);
+    FP24_conj(r, r);
+
+    FP24_mul(r, &t0);
+    FP24_copy(&t0, r);
+
+    FP24_frob(r, &X, 4);
+
+    FP24_mul(r, &t0);
+
+// See https://eprint.iacr.org/2020/875.pdf
+    FP24_usqr(&t2,r);
+    FP24_mul(&t2,r);     // t2=r^3
+
+    FP24_pow(&t1,r,x);   // t1=r^x
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    FP24_conj(&t1, &t1);
+#endif
+    FP24_conj(&t0,r);    // t0=r^-1
+    FP24_copy(r,&t1);
+    FP24_mul(r,&t0);    // r=r^(x-1)
+
+    FP24_pow(&t1,r,x);   // t1=r^x
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    FP24_conj(&t1, &t1);
+#endif
+    FP24_conj(&t0,r);    // t0=r^-1
+    FP24_copy(r,&t1);
+    FP24_mul(r,&t0);    // r=r^(x-1)
+
+// ^(x+p)
+    FP24_pow(&t1,r,x);  // t1=r^x
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    FP24_conj(&t1, &t1);
+#endif
+    FP24_copy(&t0,r);   
+    FP24_frob(&t0,&X,1); // t0=r^p
+    FP24_copy(r,&t1);
+    FP24_mul(r,&t0); // r=r^x.r^p
+
+// ^(x^2+p^2)
+    FP24_pow(&t1,r,x);  
+    FP24_pow(&t1,&t1,x); // t1=r^x^2
+    FP24_copy(&t0,r);    
+    FP24_frob(&t0,&X,2);   // t0=r^p^2
+    FP24_mul(&t1,&t0);   // t1=r^x^2.r^p^2
+    FP24_copy(r,&t1);
+
+// ^(x^4+p^4-1)
+    FP24_pow(&t1,r,x);  
+    FP24_pow(&t1,&t1,x); 
+    FP24_pow(&t1,&t1,x); 
+    FP24_pow(&t1,&t1,x); // t1=r^x^4
+    FP24_copy(&t0,r);    
+    FP24_frob(&t0,&X,4); // t0=r^p^4
+    FP24_mul(&t1,&t0);   // t1=r^x^4.r^p^4
+    FP24_conj(&t0,r);    // t0=r^-1
+    FP24_copy(r,&t1);    
+    FP24_mul(r,&t0);     // r=r^x^4.r^p^4.r^-1
+
+    FP24_mul(r,&t2);    
+    FP24_reduce(r);
+
+/*
+// Ghamman & Fouotsa Method - (completely garbled in  https://eprint.iacr.org/2016/130)
+
+    FP24_usqr(&t7, r);          // t7=f^2
+    FP24_pow(&t1, &t7, x);      // t1=t7^u
+
+    BIG_fshr(x, 1);
+    FP24_pow(&t2, &t1, x);      // t2=t1^(u/2)
+    BIG_fshl(x, 1); // x must be even
+
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    FP24_conj(&t1, &t1);
+#endif
+
+    FP24_conj(&t3, &t1);    // t3=1/t1
+    FP24_mul(&t2, &t3);     // t2=t1*t3
+    FP24_mul(&t2, r);       // t2=t2*f
+
+
+    FP24_pow(&t3, &t2, x);      // t3=t2^u
+    FP24_pow(&t4, &t3, x);      // t4=t3^u
+    FP24_pow(&t5, &t4, x);      // t5=t4^u
+
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    FP24_conj(&t3, &t3);
+    FP24_conj(&t5, &t5);
+#endif
+
+    FP24_frob(&t3, &X, 6);
+    FP24_frob(&t4, &X, 5);
+
+    FP24_mul(&t3, &t4);     // t3=t3.t4
+
+
+    FP24_pow(&t6, &t5, x);      // t6=t5^u
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    FP24_conj(&t6, &t6);
+#endif
+
+
+    FP24_frob(&t5, &X, 4);
+    FP24_mul(&t3, &t5); // ??
+
+
+    FP24_conj(&t0, &t2);        // t0=1/t2
+    FP24_mul(&t6, &t0);     // t6=t6*t0
+
+    FP24_copy(&t5, &t6);
+    FP24_frob(&t5, &X, 3);
+
+    FP24_mul(&t3, &t5);     // t3=t3*t5
+    FP24_pow(&t5, &t6, x);  // t5=t6^x
+    FP24_pow(&t6, &t5, x);  // t6=t5^x
+
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    FP24_conj(&t5, &t5);
+#endif
+
+    FP24_copy(&t0, &t5);
+    FP24_frob(&t0, &X, 2);
+    FP24_mul(&t3, &t0);     // t3=t3*t0
+    FP24_copy(&t0, &t6);    //
+    FP24_frob(&t0, &X, 1);
+
+    FP24_mul(&t3, &t0);     // t3=t3*t0
+    FP24_pow(&t5, &t6, x);  // t5=t6*x
+
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    FP24_conj(&t5, &t5);
+#endif
+
+    FP24_frob(&t2, &X, 7);
+
+    FP24_mul(&t5, &t7);     // t5=t5*t7
+    FP24_mul(&t3, &t2);     // t3=t3*t2
+    FP24_mul(&t3, &t5);     // t3=t3*t5
+
+    FP24_mul(r, &t3);
+    FP24_reduce(r);
+*/
+}
+
+#ifdef USE_GLV_ZZZ
+/* GLV method */
+static void ZZZ::glv(BIG u[2], BIG ee)
+{
+    int bd;
+    BIG q,x,x2;
+    BIG_rcopy(q, CURVE_Order);
+
+// -(x^4).P = (Beta.x,y)
+
+    BIG_rcopy(x, CURVE_Bnx);
+
+    BIG_smul(x2, x, x);
+    BIG_smul(x, x2, x2);
+    bd=BIG_nbits(q)-BIG_nbits(x); // fixed x^4
+
+    BIG_copy(u[0], ee);
+    BIG_ctmod(u[0], x, bd);
+    BIG_copy(u[1], ee);
+    BIG_ctsdiv(u[1], x, bd);
+ 
+    BIG_sub(u[1], q, u[1]);
+
+
+    return;
+}
+#endif // USE_GLV
+
+/* Galbraith & Scott Method */
+static void ZZZ::gs(BIG u[8], BIG ee)
+{
+    int i,bd;
+    BIG q,x,w;
+    BIG_rcopy(q, CURVE_Order);
+
+    BIG_rcopy(x, CURVE_Bnx);
+    BIG_copy(w, ee);
+    bd=BIG_nbits(q)-BIG_nbits(x); // fixed
+
+    for (i = 0; i < 7; i++)
+    {
+        BIG_copy(u[i], w);
+        BIG_ctmod(u[i], x, bd);
+        BIG_ctsdiv(w, x, bd);
+    }
+    BIG_copy(u[7], w);
+
+    /*  */
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    BIG_modneg(u[1], u[1], q);
+    BIG_modneg(u[3], u[3], q);
+    BIG_modneg(u[5], u[5], q);
+    BIG_modneg(u[7], u[7], q);
+#endif
+
+    return;
+}
+
+/* Multiply P by e in group G1 */
+void ZZZ::PAIR_G1mul(ECP *P, BIG e)
+{
+    BIG ee,q;
+    BIG_copy(ee,e);
+    BIG_rcopy(q, CURVE_Order);
+    BIG_mod(ee,q);
+#ifdef USE_GLV_ZZZ   /* Note this method is patented */
+    int np, nn;
+    ECP Q;
+    FP cru;
+    BIG t;
+    BIG u[2];
+
+    glv(u, ee);
+
+    ECP_copy(&Q, P); ECP_affine(&Q);
+    FP_rcopy(&cru, CRu);
+    FP_mul(&(Q.x), &(Q.x), &cru);
+
+    /* note that -a.B = a.(-B). Use a or -a depending on which is smaller */
+
+    np = BIG_nbits(u[0]);
+    BIG_modneg(t, u[0], q);
+    nn = BIG_nbits(t);
+    if (nn < np)
+    {
+        BIG_copy(u[0], t);
+        ECP_neg(P);
+    }
+
+    np = BIG_nbits(u[1]);
+    BIG_modneg(t, u[1], q);
+    nn = BIG_nbits(t);
+    if (nn < np)
+    {
+        BIG_copy(u[1], t);
+        ECP_neg(&Q);
+    }
+    BIG_norm(u[0]);
+    BIG_norm(u[1]);
+    ECP_mul2(P, &Q, u[0], u[1]);
+
+#else
+    ECP_clmul(P, ee, q);
+#endif
+}
+
+/* Multiply P by e in group G2 */
+void ZZZ::PAIR_G2mul(ECP4 *P, BIG e)
+{
+    BIG ee,q;
+    BIG_copy(ee,e);
+    BIG_rcopy(q, CURVE_Order);
+    BIG_mod(ee,q);
+#ifdef USE_GS_G2_ZZZ   /* Well I didn't patent it :) */
+    int i, np, nn;
+    ECP4 Q[8];
+    FP2 X[3];
+    BIG x, u[8];
+
+    ECP4_frob_constants(X);
+
+    gs(u, ee);
+
+    ECP4_copy(&Q[0], P);
+    for (i = 1; i < 8; i++)
+    {
+        ECP4_copy(&Q[i], &Q[i - 1]);
+        ECP4_frob(&Q[i], X, 1);
+    }
+
+    for (i = 0; i < 8; i++)
+    {
+        np = BIG_nbits(u[i]);
+        BIG_modneg(x, u[i], q);
+        nn = BIG_nbits(x);
+        if (nn < np)
+        {
+            BIG_copy(u[i], x);
+            ECP4_neg(&Q[i]);
+        }
+        BIG_norm(u[i]);
+    }
+
+    ECP4_mul8(P, Q, u);
+
+#else
+    ECP4_mul(P, ee);
+#endif
+}
+
+/* f=f^e */
+void ZZZ::PAIR_GTpow(FP24 *f, BIG e)
+{
+    BIG ee,q;
+    BIG_copy(ee,e);
+    BIG_rcopy(q, CURVE_Order);
+    BIG_mod(ee,q);
+#ifdef USE_GS_GT_ZZZ   /* Note that this option requires a lot of RAM! Maybe better to use compressed XTR method, see FP8.c */
+    int i, np, nn;
+    FP24 g[8];
+    FP2 X;
+    BIG t;
+    FP fx, fy;
+    BIG u[8];
+
+    FP_rcopy(&fx, Fra);
+    FP_rcopy(&fy, Frb);
+    FP2_from_FPs(&X, &fx, &fy);
+
+    gs(u, ee);
+
+    FP24_copy(&g[0], f);
+    for (i = 1; i < 8; i++)
+    {
+        FP24_copy(&g[i], &g[i - 1]);
+        FP24_frob(&g[i], &X, 1);
+    }
+
+    for (i = 0; i < 8; i++)
+    {
+        np = BIG_nbits(u[i]);
+        BIG_modneg(t, u[i], q);
+        nn = BIG_nbits(t);
+        if (nn < np)
+        {
+            BIG_copy(u[i], t);
+            FP24_conj(&g[i], &g[i]);
+        }
+        BIG_norm(u[i]);
+    }
+    FP24_pow8(f, g, u);
+
+#else
+    FP24_pow(f, f, ee);
+#endif
+}
+
+/* test G1 group membership */
+
+int ZZZ::PAIR_G1member(ECP *P)
+{
+    ECP W,T;
+    BIG x;
+    FP cru;
+    if (ECP_isinf(P)) return 0;
+
+    BIG_rcopy(x, CURVE_Bnx);
+    ECP_copy(&W,P);
+    ECP_copy(&T,P);
+    ECP_mul(&T,x); 
+    if (ECP_equals(P,&T)) return 0;    // P is of low order    
+    ECP_mul(&T,x);
+    ECP_mul(&T,x); ECP_mul(&T,x);
+    ECP_neg(&T);
+
+    FP_rcopy(&cru, CRu);
+    FP_mul(&(W.x), &(W.x), &cru);
+    if (!ECP_equals(&W,&T)) return 0;  // check that Endomorphism works
+
+// Not needed
+//    ECP_add(&W,P);
+//    FP_mul(&(T.x), &(T.x), &cru);
+//    ECP_add(&W,&T);
+//    if (!ECP_isinf(&W)) return 0;      // use it to check order
+
+/*
+	BIG q;
+	ECP W;
+    if (ECP_isinf(P)) return 0;
+    BIG_rcopy(q, CURVE_Order);
+	ECP_copy(&W,P);
+	ECP_mul(&W,q);
+	if (!ECP_isinf(&W)) return 0; */
+	return 1;
+}
+
+/* test G2 group membership */
+
+int ZZZ::PAIR_G2member(ECP4 *P)
+{
+    ECP4 W,T;
+    BIG x;
+    FP2 X[3];
+
+    if (ECP4_isinf(P)) return 0;
+    ECP4_frob_constants(X);
+    BIG_rcopy(x, CURVE_Bnx);
+
+    ECP4_copy(&W,P);
+    ECP4_frob(&W, X, 1);
+
+    ECP4_copy(&T,P);
+    ECP4_mul(&T,x);
+
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    ECP4_neg(&T);
+#endif
+/*
+    ECP4_copy(&R,&W);
+    ECP4_frob(&R,X,1);    // R=\psi^2(P)
+    ECP4_sub(&W,&R);
+    ECP4_copy(&R,&T);    // R=xP
+    ECP4_frob(&R,X,1);
+    ECP4_add(&W,&R);     // W=\psi(P)-\psi^2(P)+\psi(xP)
+*/
+    if (ECP4_equals(&W,&T)) return 1;
+    return 0;
+
+/*
+	BIG q;
+	ECP4 W;
+    if (ECP4_isinf(P)) return 0;
+    BIG_rcopy(q, CURVE_Order);
+	ECP4_copy(&W,P);
+	ECP4_mul(&W,q);
+	if (!ECP4_isinf(&W)) return 0;
+	return 1; */
+}
+
+/* Check that m is in cyclotomic sub-group */
+/* Check that m!=1, conj(m)*m==1, and m.m^{p^8}=m^{p^4} */
+int ZZZ::PAIR_GTcyclotomic(FP24 *m)
+{
+	FP fx,fy;
+	FP2 X;
+	FP24 r,w;
+	if (FP24_isunity(m)) return 0;
+	FP24_conj(&r,m);
+	FP24_mul(&r,m);
+	if (!FP24_isunity(&r)) return 0;
+
+	FP_rcopy(&fx,Fra);
+	FP_rcopy(&fy,Frb);
+	FP2_from_FPs(&X,&fx,&fy);
+
+	FP24_copy(&r,m); FP24_frob(&r,&X,4); 
+	FP24_copy(&w,&r); FP24_frob(&w,&X,4); 
+	FP24_mul(&w,m);
+
+	if (!FP24_equals(&w,&r)) return 0;
+    return 1;
+}
+/* test for full GT group membership */
+
+int ZZZ::PAIR_GTmember(FP24 *m)
+{
+    BIG x;
+    FP2 X;
+    FP fx, fy;
+    FP24 r,t;
+    if (!PAIR_GTcyclotomic(m)) return 0;
+
+    FP_rcopy(&fx, Fra);
+    FP_rcopy(&fy, Frb);
+    FP2_from_FPs(&X, &fx, &fy);
+    BIG_rcopy(x, CURVE_Bnx);
+
+    FP24_copy(&r,m);
+    FP24_frob(&r, &X, 1);
+
+    FP24_pow(&t,m,x);
+
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    FP24_conj(&t,&t);
+#endif
+
+    if (FP24_equals(&r,&t)) return 1;
+    return 0;
+/*
+    BIG_rcopy(q, CURVE_Order);
+    FP24_pow(&r, m, q);
+	if (!FP24_isunity(&r)) return 0;
+	return 1; */
+}
+
+#ifdef HAS_MAIN
+
+using namespace std;
+using namespace ZZZ;
+
+
+// g++ -O2 pair4_BLS24.cpp ecp4_BLS24.cpp fp24_BLS24.cpp fp8_BLS24.cpp fp4_BLS24.cpp fp2_BLS24.cpp ecp_BLS24.cpp fp_BLS24.cpp big_XXX.cpp rom_curve_BLS24.cpp rom_field_BLS24.cpp rand.cpp hash.cpp oct.cpp -o pair4_BLS24.exe
+
+int main()
+{
+    int i;
+    char byt[32];
+    csprng rng;
+    BIG xa, xb, ya, yb, w, a, b, t1, q, u[2], v[4], m, r, xx, x2, x4, p;
+    ECP4 P, G;
+    ECP Q, R;
+    FP24 g, gp;
+    FP8 t, c, cp, cpm1, cpm2;
+    FP4 X, Y;
+    FP2 x, y, f, Aa, Bb;
+    FP cru;
+
+    for (i = 0; i < 32; i++)
+        byt[i] = i + 9;
+    RAND_seed(&rng, 32, byt);
+
+    BIG_rcopy(r, CURVE_Order);
+    BIG_rcopy(p, Modulus);
+
+
+    BIG_rcopy(xa, CURVE_Gx);
+    BIG_rcopy(ya, CURVE_Gy);
+
+    ECP_set(&Q, xa, ya);
+    if (Q.inf) printf("Failed to set - point not on curve\n");
+    else printf("G1 set success\n");
+
+    printf("Q= ");
+    ECP_output(&Q);
+    printf("\n");
+
+    ECP4_generator(&P);
+
+    if (P.inf) printf("Failed to set - point not on curve\n");
+    else printf("G2 set success\n");
+
+    BIG_rcopy(a, Fra);
+    BIG_rcopy(b, Frb);
+    FP2_from_BIGs(&f, a, b);
+
+    PAIR_ate(&g, &P, &Q);
+
+    printf("gb= ");
+    FP24_output(&g);
+    printf("\n");
+    PAIR_fexp(&g);
+
+    printf("g= ");
+    FP24_output(&g);
+    printf("\n");
+
+    ECP_copy(&R, &Q);
+    ECP4_copy(&G, &P);
+
+    ECP4_dbl(&G);
+    ECP_dbl(&R);
+    ECP_affine(&R);
+
+    PAIR_ate(&g, &G, &Q);
+    PAIR_fexp(&g);
+
+    printf("g1= ");
+    FP24_output(&g);
+    printf("\n");
+
+    PAIR_ate(&g, &P, &R);
+    PAIR_fexp(&g);
+
+    printf("g2= ");
+    FP24_output(&g);
+    printf("\n");
+
+
+    PAIR_G1mul(&Q, r);
+    printf("rQ= "); ECP_output(&Q); printf("\n");
+
+    PAIR_G2mul(&P, r);
+    printf("rP= "); ECP4_output(&P); printf("\n");
+
+    BIG_randomnum(w, r, &rng);
+
+    FP24_copy(&gp, &g);
+
+    PAIR_GTpow(&g, w);
+
+    FP24_trace(&t, &g);
+
+    printf("g^r=  "); FP8_output(&t); printf("\n");
+
+    FP24_compow(&t, &gp, w, r);
+
+    printf("t(g)= "); FP8_output(&t); printf("\n");
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/pair4.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/pair4.h
new file mode 100644
index 0000000..c9b9571
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/pair4.h
@@ -0,0 +1,180 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef PAIR4_ZZZ_H
+#define PAIR4_ZZZ_H
+
+#include "fp24_YYY.h"
+#include "ecp4_ZZZ.h"
+#include "ecp_ZZZ.h"
+
+using namespace core;
+
+namespace ZZZ {
+/* Pairing constants */
+
+extern const XXX::BIG CURVE_Bnx; /**< BN curve x parameter */
+extern const XXX::BIG CURVE_Cru; /**< BN curve Cube Root of Unity */
+
+extern const XXX::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const XXX::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const XXX::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const XXX::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+/* Pairing function prototypes */
+
+/**	@brief Precompute line functions details for fixed G2 value
+ *
+	@param T array of precomputed FP8 partial line functions
+	@param GV a fixed ECP4 instance
+ */
+extern void PAIR_precomp(YYY::FP8 T[], ECP4* GV);
+
+
+/**	@brief Calculate Miller loop for Optimal ATE pairing e(P,Q)
+ *
+	@param r FP24 result of the pairing calculation e(P,Q)
+	@param P ECP4 instance, an element of G2
+	@param Q ECP instance, an element of G1
+
+ */
+extern void PAIR_ate(YYY::FP24 *r, ECP4 *P, ECP *Q);
+/**	@brief Calculate Miller loop for Optimal ATE double-pairing e(P,Q).e(R,S)
+ *
+	Faster than calculating two separate pairings
+	@param r FP24 result of the pairing calculation e(P,Q).e(R,S), an element of GT
+	@param P ECP4 instance, an element of G2
+	@param Q ECP instance, an element of G1
+	@param R ECP4 instance, an element of G2
+	@param S ECP instance, an element of G1
+ */
+extern void PAIR_double_ate(YYY::FP24 *r, ECP4 *P, ECP *Q, ECP4 *R, ECP *S);
+/**	@brief Final exponentiation of pairing, converts output of Miller loop to element in GT
+ *
+	Here p is the internal modulus, and r is the group order
+	@param x FP24, on exit = x^((p^12-1)/r)
+ */
+extern void PAIR_fexp(YYY::FP24 *x);
+/**	@brief Fast point multiplication of a member of the group G1 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param Q ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G1mul(ECP *Q, XXX::BIG b);
+/**	@brief Fast point multiplication of a member of the group G2 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param P ECP4 member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G2mul(ECP4 *P, XXX::BIG b);
+/**	@brief Fast raising of a member of GT to a BIG power
+ *
+	May exploit endomorphism for speed.
+	@param x FP24 member of GT.
+	@param b BIG exponent
+
+ */
+extern void PAIR_GTpow(YYY::FP24 *x, XXX::BIG b);
+
+/**	@brief Tests ECP for membership of G1
+ *
+	@param P ECP member of G1
+	@return true or false
+
+ */
+extern int PAIR_G1member(ZZZ::ECP *P);
+
+/**	@brief Tests ECP4 for membership of G2
+ *
+	@param P ECP4 member of G2
+	@return true or false
+
+ */
+extern int PAIR_G2member(ZZZ::ECP4 *P);
+
+
+/**	@brief Tests FP24 for membership of cyclotomic subgroup
+ *
+	@param x FP24 instance
+	@return 1 if x is cyclotomic, else return 0
+
+ */
+extern int PAIR_GTcyclotomic(YYY::FP24 *x);
+
+
+/**	@brief Tests FP24 for full membership of GT
+ *
+	@param x FP24 instance
+	@return 1 if x is in GT, else return 0
+
+ */
+extern int PAIR_GTmember(YYY::FP24 *x);
+
+
+/**	@brief Precompute line functions for n-pairing
+ *
+	@param r array of precomputed FP24 products of line functions
+	@param PV ECP4 instance, an element of G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another(YYY::FP24 r[], ECP4* PV, ECP* QV);
+
+/**	@brief Compute line functions for n-pairing, assuming precomputation on G2
+ *
+	@param r array of precomputed FP24 products of line functions
+	@param T array contains precomputed partial line fucntions from G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another_pc(YYY::FP24 r[], YYY::FP8 T[], ECP *QV);
+
+
+/**	@brief Prepare Ate parameter
+ *
+	@param n BIG parameter
+	@param n3 BIG paramter = 3*n
+	@return number of nits in n3
+
+ */
+extern int PAIR_nbits(XXX::BIG n3, XXX::BIG n);
+
+/**	@brief Initialise structure for multi-pairing
+ *
+	@param r FP24 array, to be initialised to 1
+
+ */
+extern void PAIR_initmp(YYY::FP24 r[]);
+
+
+/**	@brief Miller loop
+ *
+ 	@param res FP24 result
+	@param r FP24 precomputed array of accumulated line functions
+
+ */
+extern void PAIR_miller(YYY::FP24 *res, YYY::FP24 r[]);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/pair4_BLS24479.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/pair4_BLS24479.h
new file mode 100644
index 0000000..4c97139
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/pair4_BLS24479.h
@@ -0,0 +1,180 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef PAIR4_BLS24479_H
+#define PAIR4_BLS24479_H
+
+#include "fp24_BLS24479.h"
+#include "ecp4_BLS24479.h"
+#include "ecp_BLS24479.h"
+
+using namespace core;
+
+namespace BLS24479 {
+/* Pairing constants */
+
+extern const B480_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+extern const B480_56::BIG CURVE_Cru; /**< BN curve Cube Root of Unity */
+
+extern const B480_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B480_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B480_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B480_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+/* Pairing function prototypes */
+
+/**	@brief Precompute line functions details for fixed G2 value
+ *
+	@param T array of precomputed FP8 partial line functions
+	@param GV a fixed ECP4 instance
+ */
+extern void PAIR_precomp(BLS24479::FP8 T[], ECP4* GV);
+
+
+/**	@brief Calculate Miller loop for Optimal ATE pairing e(P,Q)
+ *
+	@param r FP24 result of the pairing calculation e(P,Q)
+	@param P ECP4 instance, an element of G2
+	@param Q ECP instance, an element of G1
+
+ */
+extern void PAIR_ate(BLS24479::FP24 *r, ECP4 *P, ECP *Q);
+/**	@brief Calculate Miller loop for Optimal ATE double-pairing e(P,Q).e(R,S)
+ *
+	Faster than calculating two separate pairings
+	@param r FP24 result of the pairing calculation e(P,Q).e(R,S), an element of GT
+	@param P ECP4 instance, an element of G2
+	@param Q ECP instance, an element of G1
+	@param R ECP4 instance, an element of G2
+	@param S ECP instance, an element of G1
+ */
+extern void PAIR_double_ate(BLS24479::FP24 *r, ECP4 *P, ECP *Q, ECP4 *R, ECP *S);
+/**	@brief Final exponentiation of pairing, converts output of Miller loop to element in GT
+ *
+	Here p is the internal modulus, and r is the group order
+	@param x FP24, on exit = x^((p^12-1)/r)
+ */
+extern void PAIR_fexp(BLS24479::FP24 *x);
+/**	@brief Fast point multiplication of a member of the group G1 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param Q ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G1mul(ECP *Q, B480_56::BIG b);
+/**	@brief Fast point multiplication of a member of the group G2 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param P ECP4 member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G2mul(ECP4 *P, B480_56::BIG b);
+/**	@brief Fast raising of a member of GT to a BIG power
+ *
+	May exploit endomorphism for speed.
+	@param x FP24 member of GT.
+	@param b BIG exponent
+
+ */
+extern void PAIR_GTpow(BLS24479::FP24 *x, B480_56::BIG b);
+
+/**	@brief Tests ECP for membership of G1
+ *
+	@param P ECP member of G1
+	@return true or false
+
+ */
+extern int PAIR_G1member(BLS24479::ECP *P);
+
+/**	@brief Tests ECP4 for membership of G2
+ *
+	@param P ECP4 member of G2
+	@return true or false
+
+ */
+extern int PAIR_G2member(BLS24479::ECP4 *P);
+
+
+/**	@brief Tests FP24 for membership of cyclotomic subgroup
+ *
+	@param x FP24 instance
+	@return 1 if x is cyclotomic, else return 0
+
+ */
+extern int PAIR_GTcyclotomic(BLS24479::FP24 *x);
+
+
+/**	@brief Tests FP24 for full membership of GT
+ *
+	@param x FP24 instance
+	@return 1 if x is in GT, else return 0
+
+ */
+extern int PAIR_GTmember(BLS24479::FP24 *x);
+
+
+/**	@brief Precompute line functions for n-pairing
+ *
+	@param r array of precomputed FP24 products of line functions
+	@param PV ECP4 instance, an element of G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another(BLS24479::FP24 r[], ECP4* PV, ECP* QV);
+
+/**	@brief Compute line functions for n-pairing, assuming precomputation on G2
+ *
+	@param r array of precomputed FP24 products of line functions
+	@param T array contains precomputed partial line fucntions from G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another_pc(BLS24479::FP24 r[], BLS24479::FP8 T[], ECP *QV);
+
+
+/**	@brief Prepare Ate parameter
+ *
+	@param n BIG parameter
+	@param n3 BIG paramter = 3*n
+	@return number of nits in n3
+
+ */
+extern int PAIR_nbits(B480_56::BIG n3, B480_56::BIG n);
+
+/**	@brief Initialise structure for multi-pairing
+ *
+	@param r FP24 array, to be initialised to 1
+
+ */
+extern void PAIR_initmp(BLS24479::FP24 r[]);
+
+
+/**	@brief Miller loop
+ *
+ 	@param res FP24 result
+	@param r FP24 precomputed array of accumulated line functions
+
+ */
+extern void PAIR_miller(BLS24479::FP24 *res, BLS24479::FP24 r[]);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/pair8.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/pair8.cpp
new file mode 100644
index 0000000..7bfba83
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/pair8.cpp
@@ -0,0 +1,1181 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* CORE BLS Curve pairing functions */
+
+//#define HAS_MAIN
+
+#include "pair8_ZZZ.h"
+
+using namespace XXX;
+using namespace YYY;
+
+namespace ZZZ {
+static void PAIR_line(FP48 *, ECP8 *, ECP8 *, FP *, FP *);
+static void PAIR_double(ECP8 *, FP8 *, FP8 *, FP8 *);
+static void PAIR_add(ECP8 *, ECP8 *B, FP8 *, FP8 *, FP8 *);
+static void PAIR_pack(FP16 *, FP8 *, FP8 *, FP8 *);
+static void PAIR_unpack(FP48 *, FP16 *, FP *, FP *);
+static void glv(BIG u[2], BIG);
+static void gs(BIG u[4], BIG);
+}
+
+
+// Point doubling for pairings
+static void ZZZ::PAIR_double(ECP8 *A, FP8 *AA, FP8 *BB, FP8 *CC)
+{
+    FP8 YY;
+    FP8_copy(CC, &(A->x));  //FP8 XX=new FP8(A.getx());  //X
+    FP8_copy(&YY, &(A->y)); //FP8 YY=new FP8(A.gety());  //Y
+    FP8_copy(BB, &(A->z));  //FP8 ZZ=new FP8(A.getz());  //Z
+
+    FP8_copy(AA, &YY);      //FP8 YZ=new FP8(YY);        //Y
+    FP8_mul(AA, AA, BB);    //YZ.mul(ZZ);                //YZ
+    FP8_sqr(CC, CC);        //XX.sqr();                //X^2
+    FP8_sqr(&YY, &YY);      //YY.sqr();                //Y^2
+    FP8_sqr(BB, BB);        //ZZ.sqr();                //Z^2
+
+    FP8_add(AA, AA, AA);
+    FP8_neg(AA, AA);
+    FP8_norm(AA);           // -2YZ
+    FP8_times_i(AA);        // -2YZi
+
+    FP8_imul(BB, BB, 3 * CURVE_B_I); //3Bz^2
+    FP8_imul(CC, CC, 3);            //3X^2
+
+#if SEXTIC_TWIST_ZZZ==D_TYPE
+    FP8_times_i(&YY);                   // Y^2.i
+    FP8_times_i(CC);                    // 3X^2.i
+#endif
+
+#if SEXTIC_TWIST_ZZZ==M_TYPE
+    FP8_times_i(BB);                    // 3Bz^2.i
+#endif
+
+    FP8_sub(BB, BB, &YY);
+    FP8_norm(BB);
+
+    ECP8_dbl(A);            //A.dbl();
+
+}
+
+// Point addition for pairings
+static void ZZZ::PAIR_add(ECP8 *A, ECP8 *B, FP8 *AA, FP8 *BB, FP8 *CC)
+{
+    FP8 T1;
+    FP8_copy(AA, &(A->x));      //FP8 X1=new FP8(A.getx());    // X1
+    FP8_copy(CC, &(A->y));      //FP8 Y1=new FP8(A.gety());    // Y1
+    FP8_copy(&T1, &(A->z));     //FP8 T1=new FP8(A.getz());    // Z1
+
+    FP8_copy(BB, &T1);          //FP8 T2=new FP8(A.getz());    // Z1
+
+    FP8_mul(&T1, &T1, &(B->y)); //T1.mul(B.gety());    // T1=Z1.Y2
+    FP8_mul(BB, BB, &(B->x));   //T2.mul(B.getx());    // T2=Z1.X2
+
+    FP8_sub(AA, AA, BB);        //X1.sub(T2);
+    FP8_norm(AA);               //X1.norm();  // X1=X1-Z1.X2
+    FP8_sub(CC, CC, &T1);       //Y1.sub(T1);
+    FP8_norm(CC);               //Y1.norm();  // Y1=Y1-Z1.Y2
+
+    FP8_copy(&T1, AA);          //T1.copy(X1);            // T1=X1-Z1.X2
+
+#if SEXTIC_TWIST_ZZZ==M_TYPE
+    FP8_times_i(AA);
+    FP8_norm(AA);
+#endif
+
+    FP8_mul(&T1, &T1, &(B->y)); //T1.mul(B.gety());       // T1=(X1-Z1.X2).Y2
+
+    FP8_copy(BB, CC);           //T2.copy(Y1);            // T2=Y1-Z1.Y2
+    FP8_mul(BB, BB, &(B->x));   //T2.mul(B.getx());       // T2=(Y1-Z1.Y2).X2
+    FP8_sub(BB, BB, &T1);       //T2.sub(T1);
+    FP8_norm(BB);               //T2.norm();          // T2=(Y1-Z1.Y2).X2 - (X1-Z1.X2).Y2
+
+    FP8_neg(CC, CC);            //Y1.neg();
+    FP8_norm(CC);               //Y1.norm(); // Y1=-(Y1-Z1.Y2).Xs                - ***
+
+    ECP8_add(A, B);             //A.add(B);
+}
+
+/* Line function */
+static void ZZZ::PAIR_line(FP48 *v, ECP8 *A, ECP8 *B, FP *Qx, FP *Qy)
+{
+    FP8 AA, BB, CC;
+    FP16 a, b, c;
+
+    if (A == B)
+        PAIR_double(A, &AA, &BB, &CC);
+    else
+        PAIR_add(A, B, &AA, &BB, &CC);
+
+    FP8_tmul(&CC, &CC, Qx);
+    FP8_tmul(&AA, &AA, Qy);
+
+    FP16_from_FP8s(&a, &AA, &BB);
+#if SEXTIC_TWIST_ZZZ==D_TYPE
+    FP16_from_FP8(&b, &CC);
+    FP16_zero(&c);
+#endif
+#if SEXTIC_TWIST_ZZZ==M_TYPE
+    FP16_zero(&b);
+    FP16_from_FP8H(&c, &CC);
+#endif
+
+    FP48_from_FP16s(v, &a, &b, &c);
+    v->type = FP_SPARSER;
+}
+
+
+/* prepare ate parameter, n=6u+2 (BN) or n=u (BLS), n3=3*n */
+int ZZZ::PAIR_nbits(BIG n3, BIG n)
+{
+    BIG x;
+    BIG_rcopy(x, CURVE_Bnx);
+
+    BIG_copy(n, x);
+    BIG_norm(n);
+    BIG_pmul(n3, n, 3);
+    BIG_norm(n3);
+
+    return BIG_nbits(n3);
+}
+
+/*
+    For multi-pairing, product of n pairings
+    1. Declare FP48 array of length number of bits in Ate parameter
+    2. Initialise this array by calling PAIR_initmp()
+    3. Accumulate each pairing by calling PAIR_another() n times
+    4. Call PAIR_miller()
+    5. Call final exponentiation PAIR_fexp()
+*/
+
+/* prepare for multi-pairing */
+void ZZZ::PAIR_initmp(FP48 r[])
+{
+    int i;
+    for (i = ATE_BITS_ZZZ - 1; i >= 0; i--)
+        FP48_one(&r[i]);
+    return;
+}
+
+/* basic Miller loop */
+void ZZZ::PAIR_miller(FP48 *res, FP48 r[])
+{
+    int i;
+    FP48_one(res);
+    for (i = ATE_BITS_ZZZ - 1; i >= 1; i--)
+    {
+        FP48_sqr(res, res);
+        FP48_ssmul(res, &r[i]);
+        FP48_zero(&r[i]);
+    }
+
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    FP48_conj(res, res);
+#endif
+    FP48_ssmul(res, &r[0]);
+    FP48_zero(&r[0]);
+    return;
+}
+
+
+// Store precomputed line details in an FP4
+static void ZZZ::PAIR_pack(FP16 *T, FP8* AA, FP8* BB, FP8 *CC)
+{
+    FP8 I, A, B;
+    FP8_inv(&I, CC, NULL);
+    FP8_mul(&A, AA, &I);
+    FP8_mul(&B, BB, &I);
+    FP16_from_FP8s(T, &A, &B);
+}
+
+// Unpack G2 line function details and include G1
+static void ZZZ::PAIR_unpack(FP48 *v, FP16* T, FP *Qx, FP *Qy)
+{
+    FP16 a, b, c;
+    FP8 t;
+    FP16_copy(&a, T);
+    FP8_tmul(&a.a, &a.a, Qy);
+    FP8_from_FP(&t, Qx);
+
+#if SEXTIC_TWIST_ZZZ==D_TYPE
+    FP16_from_FP8(&b, &t);
+    FP16_zero(&c);
+#endif
+#if SEXTIC_TWIST_ZZZ==M_TYPE
+    FP16_zero(&b);
+    FP16_from_FP8H(&c, &t);
+#endif
+
+    FP48_from_FP16s(v, &a, &b, &c);
+    v->type = FP_SPARSEST;
+}
+
+// Precompute table of line functions for fixed G2 value
+void ZZZ::PAIR_precomp(FP16 T[], ECP8* GV)
+{
+    int i, j, nb, bt;
+    BIG n, n3;
+    FP8 AA, BB, CC;
+    ECP8 A, G, NG;
+
+    ECP8_copy(&A, GV);
+    ECP8_copy(&G, GV);
+    ECP8_copy(&NG, GV);
+    ECP8_neg(&NG);
+
+    nb = PAIR_nbits(n3, n);
+    j = 0;
+
+    for (i = nb - 2; i >= 1; i--)
+    {
+        PAIR_double(&A, &AA, &BB, &CC);
+        PAIR_pack(&T[j++], &AA, &BB, &CC);
+
+        bt = BIG_bit(n3, i) - BIG_bit(n, i); // bt=BIG_bit(n,i);
+        if (bt == 1)
+        {
+            PAIR_add(&A, &G, &AA, &BB, &CC);
+            PAIR_pack(&T[j++], &AA, &BB, &CC);
+        }
+        if (bt == -1)
+        {
+            PAIR_add(&A, &NG, &AA, &BB, &CC);
+            PAIR_pack(&T[j++], &AA, &BB, &CC);
+        }
+    }
+}
+
+/* Accumulate another set of line functions for n-pairing, assuming precomputation on G2 */
+void ZZZ::PAIR_another_pc(FP48 r[], FP16 T[], ECP *QV)
+{
+    int i, j, nb, bt;
+    BIG x, n, n3;
+    FP48 lv, lv2;
+    ECP Q;
+    FP Qx, Qy;
+
+    if (ECP_isinf(QV)) return;
+
+    nb = PAIR_nbits(n3, n);
+
+    ECP_copy(&Q, QV);
+    ECP_affine(&Q);
+
+    FP_copy(&Qx, &(Q.x));
+    FP_copy(&Qy, &(Q.y));
+
+    j = 0;
+    for (i = nb - 2; i >= 1; i--)
+    {
+        PAIR_unpack(&lv, &T[j++], &Qx, &Qy);
+
+        bt = BIG_bit(n3, i) - BIG_bit(n, i); // bt=BIG_bit(n,i);
+        if (bt == 1)
+        {
+            PAIR_unpack(&lv2, &T[j++], &Qx, &Qy);
+            FP48_smul(&lv, &lv2);
+        }
+        if (bt == -1)
+        {
+            PAIR_unpack(&lv2, &T[j++], &Qx, &Qy);
+            FP48_smul(&lv, &lv2);
+        }
+        FP48_ssmul(&r[i], &lv);
+    }
+}
+
+/* Accumulate another set of line functions for n-pairing */
+void ZZZ::PAIR_another(FP48 r[], ECP8* PV, ECP* QV)
+{
+    int i, j, nb, bt;
+    BIG x, n, n3;
+    FP48 lv, lv2;
+    ECP8 A, NP, P;
+    ECP Q;
+    FP Qx, Qy;
+
+    if (ECP_isinf(QV)) return;
+
+    nb = PAIR_nbits(n3, n);
+
+    ECP8_copy(&P, PV);
+    ECP_copy(&Q, QV);
+
+    ECP8_affine(&P);
+    ECP_affine(&Q);
+
+    FP_copy(&Qx, &(Q.x));
+    FP_copy(&Qy, &(Q.y));
+
+    ECP8_copy(&A, &P);
+    ECP8_copy(&NP, &P); ECP8_neg(&NP);
+
+    for (i = nb - 2; i >= 1; i--)
+    {
+        PAIR_line(&lv, &A, &A, &Qx, &Qy);
+
+        bt = BIG_bit(n3, i) - BIG_bit(n, i); // bt=BIG_bit(n,i);
+        if (bt == 1)
+        {
+            PAIR_line(&lv2, &A, &P, &Qx, &Qy);
+            FP48_smul(&lv, &lv2);
+        }
+        if (bt == -1)
+        {
+            PAIR_line(&lv2, &A, &NP, &Qx, &Qy);
+            FP48_smul(&lv, &lv2);
+        }
+        FP48_ssmul(&r[i], &lv);
+    }
+}
+
+/* Optimal R-ate pairing r=e(P,Q) */
+void ZZZ::PAIR_ate(FP48 *r, ECP8 *P1, ECP *Q1)
+{
+    BIG x, n, n3;
+    FP Qx, Qy;
+    int i, nb, bt;
+    ECP8 A, NP, P;
+    ECP Q;
+    FP48 lv, lv2;
+
+    FP48_one(r);
+    if (ECP_isinf(Q1)) return;
+
+    nb = PAIR_nbits(n3, n);
+
+    ECP8_copy(&P, P1);
+    ECP_copy(&Q, Q1);
+
+    ECP8_affine(&P);
+    ECP_affine(&Q);
+
+
+    FP_copy(&Qx, &(Q.x));
+    FP_copy(&Qy, &(Q.y));
+
+    ECP8_copy(&A, &P);
+    ECP8_copy(&NP, &P); ECP8_neg(&NP);
+
+    /* Main Miller Loop */
+    for (i = nb - 2; i >= 1; i--)
+    {
+        FP48_sqr(r, r);
+        PAIR_line(&lv, &A, &A, &Qx, &Qy);
+
+        bt = BIG_bit(n3, i) - BIG_bit(n, i); // BIG_bit(n,i);
+        if (bt == 1)
+        {
+            PAIR_line(&lv2, &A, &P, &Qx, &Qy);
+            FP48_smul(&lv, &lv2);
+        }
+        if (bt == -1)
+        {
+            PAIR_line(&lv2, &A, &NP, &Qx, &Qy);
+            FP48_smul(&lv, &lv2);
+        }
+        FP48_ssmul(r, &lv);
+
+    }
+
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    FP48_conj(r, r);
+#endif
+
+}
+
+/* Optimal R-ate double pairing e(P,Q).e(R,S) */
+void ZZZ::PAIR_double_ate(FP48 *r, ECP8 *P1, ECP *Q1, ECP8 *R1, ECP *S1)
+{
+    BIG x, n, n3;
+    FP Qx, Qy, Sx, Sy;
+    int i, nb, bt;
+    ECP8 A, B, NP, NR, P, R;
+    ECP Q, S;
+    FP48 lv, lv2;
+
+    if (ECP_isinf(Q1))
+    {
+        PAIR_ate(r, R1, S1);
+        return;
+    }
+    if (ECP_isinf(S1))
+    {
+        PAIR_ate(r, P1, Q1);
+        return;
+    }
+    nb = PAIR_nbits(n3, n);
+
+    ECP8_copy(&P, P1);
+    ECP_copy(&Q, Q1);
+
+    ECP8_affine(&P);
+    ECP_affine(&Q);
+
+    ECP8_copy(&R, R1);
+    ECP_copy(&S, S1);
+
+    ECP8_affine(&R);
+    ECP_affine(&S);
+
+    FP_copy(&Qx, &(Q.x));
+    FP_copy(&Qy, &(Q.y));
+
+    FP_copy(&Sx, &(S.x));
+    FP_copy(&Sy, &(S.y));
+
+    ECP8_copy(&A, &P);
+    ECP8_copy(&B, &R);
+
+    ECP8_copy(&NP, &P); ECP8_neg(&NP);
+    ECP8_copy(&NR, &R); ECP8_neg(&NR);
+
+    FP48_one(r);
+
+    /* Main Miller Loop */
+    for (i = nb - 2; i >= 1; i--)
+    {
+        FP48_sqr(r, r);
+        PAIR_line(&lv, &A, &A, &Qx, &Qy);
+        PAIR_line(&lv2, &B, &B, &Sx, &Sy);
+        FP48_smul(&lv, &lv2);
+        FP48_ssmul(r, &lv);
+
+        bt = BIG_bit(n3, i) - BIG_bit(n, i); // bt=BIG_bit(n,i);
+        if (bt == 1)
+        {
+            PAIR_line(&lv, &A, &P, &Qx, &Qy);
+            PAIR_line(&lv2, &B, &R, &Sx, &Sy);
+            FP48_smul(&lv, &lv2);
+            FP48_ssmul(r, &lv);
+        }
+        if (bt == -1)
+        {
+            PAIR_line(&lv, &A, &NP, &Qx, &Qy);
+            PAIR_line(&lv2, &B, &NR, &Sx, &Sy);
+            FP48_smul(&lv, &lv2);
+            FP48_ssmul(r, &lv);
+        }
+    }
+
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    FP48_conj(r, r);
+#endif
+
+}
+
+/* final exponentiation - keep separate for multi-pairings and to avoid thrashing stack */
+
+void ZZZ::PAIR_fexp(FP48 *r)
+{
+    FP2 X;
+    BIG x;
+    FP a, b;
+    FP48 t0, t1, t2;//, t3;
+
+    BIG_rcopy(x, CURVE_Bnx);
+    FP_rcopy(&a, Fra);
+    FP_rcopy(&b, Frb);
+    FP2_from_FPs(&X, &a, &b);
+
+    /* Easy part of final exp - r^(p^24-1)(p^8+1)*/
+
+    FP48_inv(&t0, r);
+    FP48_conj(r, r);
+
+    FP48_mul(r, &t0);
+    FP48_copy(&t0, r);
+
+    FP48_frob(r, &X, 8);
+
+    FP48_mul(r, &t0);
+
+// See https://eprint.iacr.org/2020/875.pdf
+    FP48_usqr(&t2,r);
+    FP48_mul(&t2,r);     // t2=r^3
+
+    FP48_pow(&t1,r,x);   // t1=r^x
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    FP48_conj(&t1, &t1);
+#endif
+    FP48_conj(&t0,r);    // t0=r^-1
+    FP48_copy(r,&t1);
+    FP48_mul(r,&t0);    // r=r^(x-1)
+
+    FP48_pow(&t1,r,x);   // t1=r^x
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    FP48_conj(&t1, &t1);
+#endif
+    FP48_conj(&t0,r);    // t0=r^-1
+    FP48_copy(r,&t1);
+    FP48_mul(r,&t0);    // r=r^(x-1)
+
+// ^(x+p)
+    FP48_pow(&t1,r,x);  // t1=r^x
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    FP48_conj(&t1, &t1);
+#endif
+    FP48_copy(&t0,r);   
+    FP48_frob(&t0,&X,1); // t0=r^p
+    FP48_copy(r,&t1);
+    FP48_mul(r,&t0); // r=r^x.r^p
+
+// ^(x^2+p^2)
+    FP48_pow(&t1,r,x);  
+    FP48_pow(&t1,&t1,x); // t1=r^x^2
+    FP48_copy(&t0,r);    
+    FP48_frob(&t0,&X,2);   // t0=r^p^2
+    FP48_mul(&t1,&t0);   // t1=r^x^2.r^p^2
+    FP48_copy(r,&t1);
+
+// ^(x^4+p^4)
+    FP48_pow(&t1,r,x);  
+    FP48_pow(&t1,&t1,x);
+    FP48_pow(&t1,&t1,x); 
+    FP48_pow(&t1,&t1,x); // t1=r^x^4
+    FP48_copy(&t0,r);    
+    FP48_frob(&t0,&X,4);   // t0=r^p^4
+    FP48_mul(&t1,&t0);   // t1=r^x^4.r^p^4
+    FP48_copy(r,&t1);
+
+// ^(x^8+p^8-1)
+    FP48_pow(&t1,r,x);  
+    FP48_pow(&t1,&t1,x); 
+    FP48_pow(&t1,&t1,x); 
+    FP48_pow(&t1,&t1,x); 
+    FP48_pow(&t1,&t1,x);
+    FP48_pow(&t1,&t1,x);
+    FP48_pow(&t1,&t1,x); 
+    FP48_pow(&t1,&t1,x); // t1=r^x^8
+    FP48_copy(&t0,r);    
+    FP48_frob(&t0,&X,8); // t0=r^p^8
+    FP48_mul(&t1,&t0);   // t1=r^x^8.r^p^8
+    FP48_conj(&t0,r);    // t0=r^-1
+    FP48_copy(r,&t1);    
+    FP48_mul(r,&t0);     // r=r^x^4.r^p^4.r^-1
+
+    FP48_mul(r,&t2);    
+    FP48_reduce(r);
+/*
+// f^e0.f^e1^p.f^e2^p^2.. .. f^e14^p^14.f^e15^p^15
+
+    FP48_usqr(&t7, r);          // t7=f^2
+
+    if (BIG_parity(x) == 1)
+    {
+        FP48_pow(&t2, r, x);    // f^u
+        FP48_usqr(&t1, &t2);    // f^(2u)
+        FP48_pow(&t2, &t2, x);  // f^u^2
+    } else {
+        FP48_pow(&t1, &t7, x);      // t1=f^2u
+        BIG_fshr(x, 1);
+        FP48_pow(&t2, &t1, x);      // t2=f^2u^(u/2) =  f^u^2
+        BIG_fshl(x, 1);             // x must be even
+    }
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    FP48_conj(&t1, &t1);
+#endif
+
+    FP48_conj(&t3, &t1);    // t3=f^-2u
+    FP48_mul(&t2, &t3);     // t2=f^u^2.f^-2u
+    FP48_mul(&t2, r);       // t2=f^u^2.f^-2u.f = f^(u^2-2u+1) = f^e15
+
+    FP48_mul(r, &t7);       // f^3
+
+    FP48_pow(&t1, &t2, x);  // f^e15^u = f^(u.e15) = f^(u^3-2u^2+u) = f^(e14)
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    FP48_conj(&t1, &t1);
+#endif
+    FP48_copy(&t3, &t1);
+    FP48_frob(&t3, &X, 14); // f^(u^3-2u^2+u)^p^14
+    FP48_mul(r, &t3);       // f^3.f^(u^3-2u^2+u)^p^14
+
+    FP48_pow(&t1, &t1, x);  // f^(u.e14) = f^(u^4-2u^3+u^2) =  f^(e13)
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    FP48_conj(&t1, &t1);
+#endif
+    FP48_copy(&t3, &t1);
+    FP48_frob(&t3, &X, 13); // f^(e13)^p^13
+    FP48_mul(r, &t3);       // f^3.f^(u^3-2u^2+u)^p^14.f^(u^4-2u^3+u^2)^p^13
+
+    FP48_pow(&t1, &t1, x);  // f^(u.e13)
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    FP48_conj(&t1, &t1);
+#endif
+    FP48_copy(&t3, &t1);
+    FP48_frob(&t3, &X, 12); // f^(e12)^p^12
+    FP48_mul(r, &t3);
+
+    FP48_pow(&t1, &t1, x);  // f^(u.e12)
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    FP48_conj(&t1, &t1);
+#endif
+    FP48_copy(&t3, &t1);
+    FP48_frob(&t3, &X, 11); // f^(e11)^p^11
+    FP48_mul(r, &t3);
+
+    FP48_pow(&t1, &t1, x);  // f^(u.e11)
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    FP48_conj(&t1, &t1);
+#endif
+    FP48_copy(&t3, &t1);
+    FP48_frob(&t3, &X, 10); // f^(e10)^p^10
+    FP48_mul(r, &t3);
+
+    FP48_pow(&t1, &t1, x);  // f^(u.e10)
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    FP48_conj(&t1, &t1);
+#endif
+    FP48_copy(&t3, &t1);
+    FP48_frob(&t3, &X, 9);  // f^(e9)^p^9
+    FP48_mul(r, &t3);
+
+    FP48_pow(&t1, &t1, x);  // f^(u.e9)
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    FP48_conj(&t1, &t1);
+#endif
+    FP48_copy(&t3, &t1);
+    FP48_frob(&t3, &X, 8);  // f^(e8)^p^8
+    FP48_mul(r, &t3);
+
+    FP48_pow(&t1, &t1, x);  // f^(u.e8)
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    FP48_conj(&t1, &t1);
+#endif
+    FP48_conj(&t3, &t2);
+    FP48_mul(&t1, &t3); // f^(u.e8).f^-e15
+    FP48_copy(&t3, &t1);
+    FP48_frob(&t3, &X, 7);  // f^(e7)^p^7
+    FP48_mul(r, &t3);
+
+    FP48_pow(&t1, &t1, x);  // f^(u.e7)
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    FP48_conj(&t1, &t1);
+#endif
+    FP48_copy(&t3, &t1);
+    FP48_frob(&t3, &X, 6);  // f^(e6)^p^6
+    FP48_mul(r, &t3);
+
+    FP48_pow(&t1, &t1, x);  // f^(u.e6)
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    FP48_conj(&t1, &t1);
+#endif
+    FP48_copy(&t3, &t1);
+    FP48_frob(&t3, &X, 5);  // f^(e5)^p^5
+    FP48_mul(r, &t3);
+
+    FP48_pow(&t1, &t1, x);  // f^(u.e5)
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    FP48_conj(&t1, &t1);
+#endif
+    FP48_copy(&t3, &t1);
+    FP48_frob(&t3, &X, 4);  // f^(e4)^p^4
+    FP48_mul(r, &t3);
+
+    FP48_pow(&t1, &t1, x);  // f^(u.e4)
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    FP48_conj(&t1, &t1);
+#endif
+    FP48_copy(&t3, &t1);
+    FP48_frob(&t3, &X, 3);  // f^(e3)^p^3
+    FP48_mul(r, &t3);
+
+    FP48_pow(&t1, &t1, x);  // f^(u.e3)
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    FP48_conj(&t1, &t1);
+#endif
+    FP48_copy(&t3, &t1);
+    FP48_frob(&t3, &X, 2);  // f^(e2)^p^2
+    FP48_mul(r, &t3);
+
+    FP48_pow(&t1, &t1, x);  // f^(u.e2)
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    FP48_conj(&t1, &t1);
+#endif
+    FP48_copy(&t3, &t1);
+    FP48_frob(&t3, &X, 1);  // f^(e1)^p^1
+    FP48_mul(r, &t3);
+
+    FP48_pow(&t1, &t1, x);  // f^(u.e1)
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    FP48_conj(&t1, &t1);
+#endif
+    FP48_mul(r, &t1);       // r.f^e0
+
+    FP48_frob(&t2, &X, 15); // f^(e15.p^15)
+    FP48_mul(r, &t2);
+
+    FP48_reduce(r);
+*/
+}
+
+#ifdef USE_GLV_ZZZ
+/* GLV method */
+static void ZZZ::glv(BIG u[2], BIG ee)
+{
+
+    int bd;
+    BIG q,x,x2;
+    BIG_rcopy(q, CURVE_Order);
+
+// -(x^8).P = (Beta.x,y)
+
+    BIG_rcopy(x, CURVE_Bnx);
+
+    BIG_smul(x2, x, x);
+    BIG_smul(x, x2, x2);
+    BIG_smul(x2, x, x);
+    bd=BIG_nbits(q)-BIG_nbits(x2); // fixed x^8
+
+    BIG_copy(u[0], ee);
+    BIG_ctmod(u[0], x2, bd);
+    BIG_copy(u[1], ee);
+    BIG_ctsdiv(u[1], x2, bd);
+
+    BIG_sub(u[1], q, u[1]);
+
+    return;
+}
+#endif // USE_GLV
+
+/* Galbraith & Scott Method */
+static void ZZZ::gs(BIG u[16], BIG ee)
+{
+    int i,bd;
+    BIG q,x,w;
+    BIG_rcopy(q, CURVE_Order);
+
+    BIG_rcopy(x, CURVE_Bnx);
+    BIG_copy(w, ee);
+    bd=BIG_nbits(q)-BIG_nbits(x); // fixed
+
+    for (i = 0; i < 15; i++)
+    {
+        BIG_copy(u[i], w);
+        BIG_ctmod(u[i], x, bd);
+        BIG_ctsdiv(w, x, bd);
+    }
+    BIG_copy(u[15], w);
+
+    /*  */
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    BIG_modneg(u[1], u[1], q);
+    BIG_modneg(u[3], u[3], q);
+    BIG_modneg(u[5], u[5], q);
+    BIG_modneg(u[7], u[7], q);
+    BIG_modneg(u[9], u[9], q);
+    BIG_modneg(u[11], u[11], q);
+    BIG_modneg(u[13], u[13], q);
+    BIG_modneg(u[15], u[15], q);
+#endif
+
+
+    return;
+}
+
+/* Multiply P by e in group G1 */
+void ZZZ::PAIR_G1mul(ECP *P, BIG e)
+{
+    BIG ee,q;
+    BIG_copy(ee,e);
+    BIG_rcopy(q, CURVE_Order);
+    BIG_mod(ee,q);
+#ifdef USE_GLV_ZZZ   /* Note this method is patented */
+    int np, nn;
+    ECP Q;
+    FP cru;
+    BIG t;
+    BIG u[2];
+
+    glv(u, ee);
+
+    ECP_copy(&Q, P); ECP_affine(&Q);
+    FP_rcopy(&cru, CRu);
+    FP_mul(&(Q.x), &(Q.x), &cru);
+
+    /* note that -a.B = a.(-B). Use a or -a depending on which is smaller */
+
+    np = BIG_nbits(u[0]);
+    BIG_modneg(t, u[0], q);
+    nn = BIG_nbits(t);
+    if (nn < np)
+    {
+        BIG_copy(u[0], t);
+        ECP_neg(P);
+    }
+
+    np = BIG_nbits(u[1]);
+    BIG_modneg(t, u[1], q);
+    nn = BIG_nbits(t);
+    if (nn < np)
+    {
+        BIG_copy(u[1], t);
+        ECP_neg(&Q);
+    }
+    BIG_norm(u[0]);
+    BIG_norm(u[1]);
+    ECP_mul2(P, &Q, u[0], u[1]);
+
+#else
+    ECP_clmul(P, ee, q);
+#endif
+}
+
+/* Multiply P by e in group G2 */
+void ZZZ::PAIR_G2mul(ECP8 *P, BIG e)
+{
+    BIG ee,q;
+    BIG_copy(ee,e);
+    BIG_rcopy(q, CURVE_Order);
+    BIG_mod(ee,q);
+#ifdef USE_GS_G2_ZZZ   /* Well we didn't patent it :) */
+    int i, np, nn;
+    ECP8 Q[16], T;
+    FP2 X[3];
+    BIG x, u[16];
+
+    ECP8_frob_constants(X);
+
+    gs(u, ee);
+
+    ECP8_copy(&Q[0], P);
+
+    for (i = 1; i < 16; i++)
+    {
+        ECP8_copy(&Q[i], &Q[i - 1]);
+        ECP8_frob(&Q[i], X, 1);
+    }
+
+    for (i = 0; i < 16; i++)
+    {
+        np = BIG_nbits(u[i]);
+        BIG_modneg(x, u[i], q);
+        BIG_norm(x);
+        nn = BIG_nbits(x);
+        if (nn < np)
+        {
+            BIG_copy(u[i], x);
+            ECP8_neg(&Q[i]);
+        }
+        BIG_norm(u[i]);
+    }
+
+    ECP8_mul16(P, Q, u);
+
+#else
+    ECP8_mul(P, ee);
+#endif
+}
+
+/* f=f^e */
+void ZZZ::PAIR_GTpow(FP48 *f, BIG e)
+{
+    BIG ee,q;
+    BIG_copy(ee,e);
+    BIG_rcopy(q, CURVE_Order);
+    BIG_mod(ee,q);
+#ifdef USE_GS_GT_ZZZ   /* Note that this option requires a lot of RAM! Maybe better to use compressed XTR method, see FP16.cpp */
+    int i, np, nn;
+    FP48 g[16];
+    FP2 X;
+    BIG t;
+    FP fx, fy;
+    BIG u[16];
+
+    FP_rcopy(&fx, Fra);
+    FP_rcopy(&fy, Frb);
+    FP2_from_FPs(&X, &fx, &fy);
+
+    gs(u, ee);
+
+    FP48_copy(&g[0], f);
+    for (i = 1; i < 16; i++)
+    {
+        FP48_copy(&g[i], &g[i - 1]);
+        FP48_frob(&g[i], &X, 1);
+    }
+
+    for (i = 0; i < 16; i++)
+    {
+        np = BIG_nbits(u[i]);
+        BIG_modneg(t, u[i], q);
+        nn = BIG_nbits(t);
+        if (nn < np)
+        {
+            BIG_copy(u[i], t);
+            FP48_conj(&g[i], &g[i]);
+        }
+        BIG_norm(u[i]);
+    }
+    FP48_pow16(f, g, u);
+
+#else
+    FP48_pow(f, f, ee);
+#endif
+}
+
+/* test G1 group membership */
+
+int ZZZ::PAIR_G1member(ECP *P)
+{
+    ECP W,T;
+    BIG x;
+    FP cru;
+    if (ECP_isinf(P)) return 0;
+
+    BIG_rcopy(x, CURVE_Bnx);
+    ECP_copy(&W,P);
+    ECP_copy(&T,P);
+    ECP_mul(&T,x); 
+    if (ECP_equals(P,&T)) return 0;    // P is of low order    
+    ECP_mul(&T,x);
+    ECP_mul(&T,x); ECP_mul(&T,x);
+    ECP_mul(&T,x); ECP_mul(&T,x);
+    ECP_mul(&T,x); ECP_mul(&T,x);
+    ECP_neg(&T);
+
+    FP_rcopy(&cru, CRu);
+    FP_mul(&(W.x), &(W.x), &cru);
+    if (!ECP_equals(&W,&T)) return 0;  // check that Endomorphism works
+
+// Not needed
+//    ECP_add(&W,P);
+//    FP_mul(&(T.x), &(T.x), &cru);
+//    ECP_add(&W,&T);
+//    if (!ECP_isinf(&W)) return 0;      // use it to check order
+/*
+	BIG q;
+	ECP W;
+    if (ECP_isinf(P)) return 0;
+    BIG_rcopy(q, CURVE_Order);
+	ECP_copy(&W,P);
+	ECP_mul(&W,q);
+	if (!ECP_isinf(&W)) return 0; */
+	return 1; 
+}
+
+/* test G2 group membership */
+
+int ZZZ::PAIR_G2member(ECP8 *P)
+{
+    ECP8 W,T;
+    BIG x;
+    FP2 X[3];
+
+    if (ECP8_isinf(P)) return 0;
+    ECP8_frob_constants(X);
+    BIG_rcopy(x, CURVE_Bnx);
+
+    ECP8_copy(&W,P);
+    ECP8_frob(&W, X, 1);
+
+    ECP8_copy(&T,P);
+    ECP8_mul(&T,x);
+
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    ECP8_neg(&T);
+#endif
+/*
+    ECP8_copy(&R,&W);
+    ECP8_frob(&R,X,1);    // R=\psi^2(P)
+    ECP8_sub(&W,&R);
+    ECP8_copy(&R,&T);    // R=xP
+    ECP8_frob(&R,X,1);
+    ECP8_add(&W,&R);     // W=\psi(P)-\psi^2(P)+\psi(xP)
+*/
+    if (ECP8_equals(&W,&T)) return 1;
+    return 0;
+
+
+/*	BIG q;
+	ECP8 W;
+    if (ECP8_isinf(P)) return 0;
+    BIG_rcopy(q, CURVE_Order);
+	ECP8_copy(&W,P);
+	ECP8_mul(&W,q);
+	if (!ECP8_isinf(&W)) return 0;
+	return 1; */
+}
+
+
+/* Check that m is in cyclotomic sub-group */
+/* Check that m!=1, conj(m)*m==1, and m.m^{p^16}=m^{p^8} */
+int ZZZ::PAIR_GTcyclotomic(FP48 *m)
+{
+	FP fx,fy;
+	FP2 X;
+	FP48 r,w;
+	if (FP48_isunity(m)) return 0;
+	FP48_conj(&r,m);
+	FP48_mul(&r,m);
+	if (!FP48_isunity(&r)) return 0;
+
+	FP_rcopy(&fx,Fra);
+	FP_rcopy(&fy,Frb);
+	FP2_from_FPs(&X,&fx,&fy);
+
+	FP48_copy(&r,m); FP48_frob(&r,&X,8); 
+	FP48_copy(&w,&r); FP48_frob(&w,&X,8); 
+	FP48_mul(&w,m);
+
+	if (!FP48_equals(&w,&r)) return 0;
+    return 1;
+}
+
+/* test for full GT group membership */
+int ZZZ::PAIR_GTmember(FP48 *m)
+{
+    BIG x;
+    FP2 X;
+    FP fx, fy;
+    FP48 r,t;
+    if (!PAIR_GTcyclotomic(m)) return 0;
+
+    FP_rcopy(&fx, Fra);
+    FP_rcopy(&fy, Frb);
+    FP2_from_FPs(&X, &fx, &fy);
+    BIG_rcopy(x, CURVE_Bnx);
+
+    FP48_copy(&r,m);
+    FP48_frob(&r, &X, 1);
+
+    FP48_pow(&t,m,x);
+
+#if SIGN_OF_X_ZZZ==NEGATIVEX
+    FP48_conj(&t,&t);
+#endif
+
+    if (FP48_equals(&r,&t)) return 1;
+    return 0;
+/*
+    BIG_rcopy(q, CURVE_Order);
+    FP48_pow(&r, m, q);
+	if (!FP48_isunity(&r)) return 0;
+	return 1; */
+}
+
+#ifdef HAS_MAIN
+
+using namespace std;
+using namespace ZZZ;
+
+
+// g++ -O2 pair8_BLS48.cpp ecp8_BLS48.cpp fp48_BLS48.cpp fp16_BLS48.cpp fp8_BLS48.cpp fp4_BLS48.cpp fp2_BLS48.cpp ecp_BLS48.cpp fp_BLS48.cpp big_B560_29.cpp rom_curve_BLS48.cpp rom_field_BLS48.cpp rand.cpp hash.cpp oct.cpp -o pair8_BLS48.exe
+
+int main()
+{
+    int i;
+    char byt[32];
+    csprng rng;
+    BIG xa, xb, ya, yb, w, a, b, t1, q, u[2], v[4], m, r, xx, x2, x4, p;
+    ECP8 P, G;
+    ECP Q, R;
+    FP48 g, gp;
+    FP16 t, c, cp, cpm1, cpm2;
+    FP8 X, Y;
+    FP2 x, y, f, Aa, Bb;
+    FP cru;
+
+    for (i = 0; i < 32; i++)
+        byt[i] = i + 9;
+    RAND_seed(&rng, 32, byt);
+
+    BIG_rcopy(r, CURVE_Order);
+    BIG_rcopy(p, Modulus);
+
+
+    BIG_rcopy(xa, CURVE_Gx);
+    BIG_rcopy(ya, CURVE_Gy);
+
+    ECP_set(&Q, xa, ya);
+    if (Q.inf) printf("Failed to set - point not on curve\n");
+    else printf("G1 set success\n");
+
+    printf("Q= ");
+    ECP_output(&Q);
+    printf("\n");
+
+    ECP8_generator(&P);
+
+    if (P.inf) printf("Failed to set - point not on curve\n");
+    else printf("G2 set success\n");
+
+    BIG_rcopy(a, Fra);
+    BIG_rcopy(b, Frb);
+    FP2_from_BIGs(&f, a, b);
+
+    PAIR_ate(&g, &P, &Q);
+
+    printf("gb= ");
+    FP48_output(&g);
+    printf("\n");
+    PAIR_fexp(&g);
+
+    printf("g= ");
+    FP48_output(&g);
+    printf("\n");
+
+    ECP_copy(&R, &Q);
+    ECP8_copy(&G, &P);
+
+    ECP8_dbl(&G);
+    ECP_dbl(&R);
+    ECP_affine(&R);
+
+    PAIR_ate(&g, &G, &Q);
+    PAIR_fexp(&g);
+
+    printf("g1= ");
+    FP48_output(&g);
+    printf("\n");
+
+    PAIR_ate(&g, &P, &R);
+    PAIR_fexp(&g);
+
+    printf("g2= ");
+    FP48_output(&g);
+    printf("\n");
+
+    PAIR_G1mul(&Q, r);
+    printf("rQ= "); ECP_output(&Q); printf("\n");
+
+    PAIR_G2mul(&P, r);
+    printf("rP= "); ECP8_output(&P); printf("\n");
+
+    PAIR_GTpow(&g, r);
+    printf("g^r= "); FP48_output(&g); printf("\n");
+
+    BIG_randomnum(w, r, &rng);
+
+    FP48_copy(&gp, &g);
+
+    PAIR_GTpow(&g, w);
+
+    FP48_trace(&t, &g);
+
+    printf("g^r=  "); FP16_output(&t); printf("\n");
+
+    FP48_compow(&t, &gp, w, r);
+
+    printf("t(g)= "); FP16_output(&t); printf("\n");
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/pair8.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/pair8.h
new file mode 100644
index 0000000..cfd12ee
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/pair8.h
@@ -0,0 +1,179 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef PAIR8_ZZZ_H
+#define PAIR8_ZZZ_H
+
+#include "fp48_YYY.h"
+#include "ecp8_ZZZ.h"
+#include "ecp_ZZZ.h"
+
+using namespace core;
+
+namespace ZZZ {
+/* Pairing constants */
+
+extern const XXX::BIG CURVE_Bnx; /**< BN curve x parameter */
+extern const XXX::BIG CURVE_Cru; /**< BN curve Cube Root of Unity */
+
+extern const XXX::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const XXX::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const XXX::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const XXX::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+/* Pairing function prototypes */
+
+/**	@brief Precompute line functions details for fixed G2 value
+ *
+	@param T array of precomputed FP16 partial line functions
+	@param GV a fixed ECP8 instance
+ */
+extern void PAIR_precomp(YYY::FP16 T[], ECP8* GV);
+
+
+/**	@brief Calculate Miller loop for Optimal ATE pairing e(P,Q)
+ *
+	@param r FP48 result of the pairing calculation e(P,Q)
+	@param P ECP8 instance, an element of G2
+	@param Q ECP instance, an element of G1
+
+ */
+extern void PAIR_ate(YYY::FP48 *r, ECP8 *P, ECP *Q);
+/**	@brief Calculate Miller loop for Optimal ATE double-pairing e(P,Q).e(R,S)
+ *
+	Faster than calculating two separate pairings
+	@param r FP48 result of the pairing calculation e(P,Q).e(R,S), an element of GT
+	@param P ECP8 instance, an element of G2
+	@param Q ECP instance, an element of G1
+	@param R ECP8 instance, an element of G2
+	@param S ECP instance, an element of G1
+ */
+extern void PAIR_double_ate(YYY::FP48 *r, ECP8 *P, ECP *Q, ECP8 *R, ECP *S);
+/**	@brief Final exponentiation of pairing, converts output of Miller loop to element in GT
+ *
+	Here p is the internal modulus, and r is the group order
+	@param x FP48, on exit = x^((p^12-1)/r)
+ */
+extern void PAIR_fexp(YYY::FP48 *x);
+/**	@brief Fast point multiplication of a member of the group G1 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param Q ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G1mul(ECP *Q, XXX::BIG b);
+/**	@brief Fast point multiplication of a member of the group G2 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param P ECP8 member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G2mul(ECP8 *P, XXX::BIG b);
+/**	@brief Fast raising of a member of GT to a BIG power
+ *
+	May exploit endomorphism for speed.
+	@param x FP48 member of GT.
+	@param b BIG exponent
+
+ */
+extern void PAIR_GTpow(YYY::FP48 *x, XXX::BIG b);
+
+/**	@brief Tests ECP for membership of G1
+ *
+	@param P ECP member of G1
+	@return true or false
+
+ */
+extern int PAIR_G1member(ZZZ::ECP *P);
+
+/**	@brief Tests ECP8 for membership of G2
+ *
+	@param P ECP8 member of G2
+	@return true or false
+
+ */
+extern int PAIR_G2member(ZZZ::ECP8 *P);
+
+/**	@brief Tests FP48 for membership of cyclotomic subgroup
+ *
+	@param x FP48 instance
+	@return 1 if x is cyclotomic, else return 0
+
+ */
+extern int PAIR_GTcyclotomic(YYY::FP48 *x);
+
+/**	@brief Tests FP48 for full membership of GT
+ *
+	@param x FP48 instance
+	@return 1 if x is in GT, else return 0
+
+ */
+extern int PAIR_GTmember(YYY::FP48 *x);
+
+/**	@brief Precompute line functions for n-pairing
+ *
+	@param r array of precomputed FP48 products of line functions
+	@param PV ECP8 instance, an element of G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another(YYY::FP48 r[], ECP8* PV, ECP* QV);
+
+
+/**	@brief Compute line functions for n-pairing, assuming precomputation on G2
+ *
+	@param r array of precomputed FP48 products of line functions
+	@param T array contains precomputed partial line fucntions from G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another_pc(YYY::FP48 r[], YYY::FP16 T[], ECP *QV);
+
+
+
+/**	@brief Prepare Ate parameter
+ *
+	@param n BIG parameter
+	@param n3 BIG paramter = 3*n
+	@return number of nits in n3
+
+ */
+extern int PAIR_nbits(XXX::BIG n3, XXX::BIG n);
+
+/**	@brief Initialise structure for multi-pairing
+ *
+	@param r FP48 array, to be initialised to 1
+
+ */
+extern void PAIR_initmp(YYY::FP48 r[]);
+
+
+/**	@brief Miller loop
+ *
+ 	@param res FP48 result
+	@param r FP48 precomputed array of accumulated line functions
+
+ */
+extern void PAIR_miller(YYY::FP48 *res, YYY::FP48 r[]);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/pair8_BLS48286.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/pair8_BLS48286.h
new file mode 100644
index 0000000..15ad558
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/pair8_BLS48286.h
@@ -0,0 +1,179 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef PAIR8_BLS48286_H
+#define PAIR8_BLS48286_H
+
+#include "fp48_BLS48286.h"
+#include "ecp8_BLS48286.h"
+#include "ecp_BLS48286.h"
+
+using namespace core;
+
+namespace BLS48286 {
+/* Pairing constants */
+
+extern const B288_60::BIG CURVE_Bnx; /**< BN curve x parameter */
+extern const B288_60::BIG CURVE_Cru; /**< BN curve Cube Root of Unity */
+
+extern const B288_60::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B288_60::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B288_60::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B288_60::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+/* Pairing function prototypes */
+
+/**	@brief Precompute line functions details for fixed G2 value
+ *
+	@param T array of precomputed FP16 partial line functions
+	@param GV a fixed ECP8 instance
+ */
+extern void PAIR_precomp(BLS48286::FP16 T[], ECP8* GV);
+
+
+/**	@brief Calculate Miller loop for Optimal ATE pairing e(P,Q)
+ *
+	@param r FP48 result of the pairing calculation e(P,Q)
+	@param P ECP8 instance, an element of G2
+	@param Q ECP instance, an element of G1
+
+ */
+extern void PAIR_ate(BLS48286::FP48 *r, ECP8 *P, ECP *Q);
+/**	@brief Calculate Miller loop for Optimal ATE double-pairing e(P,Q).e(R,S)
+ *
+	Faster than calculating two separate pairings
+	@param r FP48 result of the pairing calculation e(P,Q).e(R,S), an element of GT
+	@param P ECP8 instance, an element of G2
+	@param Q ECP instance, an element of G1
+	@param R ECP8 instance, an element of G2
+	@param S ECP instance, an element of G1
+ */
+extern void PAIR_double_ate(BLS48286::FP48 *r, ECP8 *P, ECP *Q, ECP8 *R, ECP *S);
+/**	@brief Final exponentiation of pairing, converts output of Miller loop to element in GT
+ *
+	Here p is the internal modulus, and r is the group order
+	@param x FP48, on exit = x^((p^12-1)/r)
+ */
+extern void PAIR_fexp(BLS48286::FP48 *x);
+/**	@brief Fast point multiplication of a member of the group G1 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param Q ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G1mul(ECP *Q, B288_60::BIG b);
+/**	@brief Fast point multiplication of a member of the group G2 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param P ECP8 member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G2mul(ECP8 *P, B288_60::BIG b);
+/**	@brief Fast raising of a member of GT to a BIG power
+ *
+	May exploit endomorphism for speed.
+	@param x FP48 member of GT.
+	@param b BIG exponent
+
+ */
+extern void PAIR_GTpow(BLS48286::FP48 *x, B288_60::BIG b);
+
+/**	@brief Tests ECP for membership of G1
+ *
+	@param P ECP member of G1
+	@return true or false
+
+ */
+extern int PAIR_G1member(BLS48286::ECP *P);
+
+/**	@brief Tests ECP8 for membership of G2
+ *
+	@param P ECP8 member of G2
+	@return true or false
+
+ */
+extern int PAIR_G2member(BLS48286::ECP8 *P);
+
+/**	@brief Tests FP48 for membership of cyclotomic subgroup
+ *
+	@param x FP48 instance
+	@return 1 if x is cyclotomic, else return 0
+
+ */
+extern int PAIR_GTcyclotomic(BLS48286::FP48 *x);
+
+/**	@brief Tests FP48 for full membership of GT
+ *
+	@param x FP48 instance
+	@return 1 if x is in GT, else return 0
+
+ */
+extern int PAIR_GTmember(BLS48286::FP48 *x);
+
+/**	@brief Precompute line functions for n-pairing
+ *
+	@param r array of precomputed FP48 products of line functions
+	@param PV ECP8 instance, an element of G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another(BLS48286::FP48 r[], ECP8* PV, ECP* QV);
+
+
+/**	@brief Compute line functions for n-pairing, assuming precomputation on G2
+ *
+	@param r array of precomputed FP48 products of line functions
+	@param T array contains precomputed partial line fucntions from G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another_pc(BLS48286::FP48 r[], BLS48286::FP16 T[], ECP *QV);
+
+
+
+/**	@brief Prepare Ate parameter
+ *
+	@param n BIG parameter
+	@param n3 BIG paramter = 3*n
+	@return number of nits in n3
+
+ */
+extern int PAIR_nbits(B288_60::BIG n3, B288_60::BIG n);
+
+/**	@brief Initialise structure for multi-pairing
+ *
+	@param r FP48 array, to be initialised to 1
+
+ */
+extern void PAIR_initmp(BLS48286::FP48 r[]);
+
+
+/**	@brief Miller loop
+ *
+ 	@param res FP48 result
+	@param r FP48 precomputed array of accumulated line functions
+
+ */
+extern void PAIR_miller(BLS48286::FP48 *res, BLS48286::FP48 r[]);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/pair8_BLS48556.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/pair8_BLS48556.h
new file mode 100644
index 0000000..11201ca
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/pair8_BLS48556.h
@@ -0,0 +1,179 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef PAIR8_BLS48556_H
+#define PAIR8_BLS48556_H
+
+#include "fp48_BLS48556.h"
+#include "ecp8_BLS48556.h"
+#include "ecp_BLS48556.h"
+
+using namespace core;
+
+namespace BLS48556 {
+/* Pairing constants */
+
+extern const B560_58::BIG CURVE_Bnx; /**< BN curve x parameter */
+extern const B560_58::BIG CURVE_Cru; /**< BN curve Cube Root of Unity */
+
+extern const B560_58::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B560_58::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B560_58::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B560_58::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+/* Pairing function prototypes */
+
+/**	@brief Precompute line functions details for fixed G2 value
+ *
+	@param T array of precomputed FP16 partial line functions
+	@param GV a fixed ECP8 instance
+ */
+extern void PAIR_precomp(BLS48556::FP16 T[], ECP8* GV);
+
+
+/**	@brief Calculate Miller loop for Optimal ATE pairing e(P,Q)
+ *
+	@param r FP48 result of the pairing calculation e(P,Q)
+	@param P ECP8 instance, an element of G2
+	@param Q ECP instance, an element of G1
+
+ */
+extern void PAIR_ate(BLS48556::FP48 *r, ECP8 *P, ECP *Q);
+/**	@brief Calculate Miller loop for Optimal ATE double-pairing e(P,Q).e(R,S)
+ *
+	Faster than calculating two separate pairings
+	@param r FP48 result of the pairing calculation e(P,Q).e(R,S), an element of GT
+	@param P ECP8 instance, an element of G2
+	@param Q ECP instance, an element of G1
+	@param R ECP8 instance, an element of G2
+	@param S ECP instance, an element of G1
+ */
+extern void PAIR_double_ate(BLS48556::FP48 *r, ECP8 *P, ECP *Q, ECP8 *R, ECP *S);
+/**	@brief Final exponentiation of pairing, converts output of Miller loop to element in GT
+ *
+	Here p is the internal modulus, and r is the group order
+	@param x FP48, on exit = x^((p^12-1)/r)
+ */
+extern void PAIR_fexp(BLS48556::FP48 *x);
+/**	@brief Fast point multiplication of a member of the group G1 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param Q ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G1mul(ECP *Q, B560_58::BIG b);
+/**	@brief Fast point multiplication of a member of the group G2 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param P ECP8 member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G2mul(ECP8 *P, B560_58::BIG b);
+/**	@brief Fast raising of a member of GT to a BIG power
+ *
+	May exploit endomorphism for speed.
+	@param x FP48 member of GT.
+	@param b BIG exponent
+
+ */
+extern void PAIR_GTpow(BLS48556::FP48 *x, B560_58::BIG b);
+
+/**	@brief Tests ECP for membership of G1
+ *
+	@param P ECP member of G1
+	@return true or false
+
+ */
+extern int PAIR_G1member(BLS48556::ECP *P);
+
+/**	@brief Tests ECP8 for membership of G2
+ *
+	@param P ECP8 member of G2
+	@return true or false
+
+ */
+extern int PAIR_G2member(BLS48556::ECP8 *P);
+
+/**	@brief Tests FP48 for membership of cyclotomic subgroup
+ *
+	@param x FP48 instance
+	@return 1 if x is cyclotomic, else return 0
+
+ */
+extern int PAIR_GTcyclotomic(BLS48556::FP48 *x);
+
+/**	@brief Tests FP48 for full membership of GT
+ *
+	@param x FP48 instance
+	@return 1 if x is in GT, else return 0
+
+ */
+extern int PAIR_GTmember(BLS48556::FP48 *x);
+
+/**	@brief Precompute line functions for n-pairing
+ *
+	@param r array of precomputed FP48 products of line functions
+	@param PV ECP8 instance, an element of G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another(BLS48556::FP48 r[], ECP8* PV, ECP* QV);
+
+
+/**	@brief Compute line functions for n-pairing, assuming precomputation on G2
+ *
+	@param r array of precomputed FP48 products of line functions
+	@param T array contains precomputed partial line fucntions from G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another_pc(BLS48556::FP48 r[], BLS48556::FP16 T[], ECP *QV);
+
+
+
+/**	@brief Prepare Ate parameter
+ *
+	@param n BIG parameter
+	@param n3 BIG paramter = 3*n
+	@return number of nits in n3
+
+ */
+extern int PAIR_nbits(B560_58::BIG n3, B560_58::BIG n);
+
+/**	@brief Initialise structure for multi-pairing
+ *
+	@param r FP48 array, to be initialised to 1
+
+ */
+extern void PAIR_initmp(BLS48556::FP48 r[]);
+
+
+/**	@brief Miller loop
+ *
+ 	@param res FP48 result
+	@param r FP48 precomputed array of accumulated line functions
+
+ */
+extern void PAIR_miller(BLS48556::FP48 *res, BLS48556::FP48 r[]);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/pair8_BLS48581.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/pair8_BLS48581.h
new file mode 100644
index 0000000..2d220b8
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/pair8_BLS48581.h
@@ -0,0 +1,179 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef PAIR8_BLS48581_H
+#define PAIR8_BLS48581_H
+
+#include "fp48_BLS48581.h"
+#include "ecp8_BLS48581.h"
+#include "ecp_BLS48581.h"
+
+using namespace core;
+
+namespace BLS48581 {
+/* Pairing constants */
+
+extern const B584_60::BIG CURVE_Bnx; /**< BN curve x parameter */
+extern const B584_60::BIG CURVE_Cru; /**< BN curve Cube Root of Unity */
+
+extern const B584_60::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B584_60::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B584_60::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B584_60::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+/* Pairing function prototypes */
+
+/**	@brief Precompute line functions details for fixed G2 value
+ *
+	@param T array of precomputed FP16 partial line functions
+	@param GV a fixed ECP8 instance
+ */
+extern void PAIR_precomp(BLS48581::FP16 T[], ECP8* GV);
+
+
+/**	@brief Calculate Miller loop for Optimal ATE pairing e(P,Q)
+ *
+	@param r FP48 result of the pairing calculation e(P,Q)
+	@param P ECP8 instance, an element of G2
+	@param Q ECP instance, an element of G1
+
+ */
+extern void PAIR_ate(BLS48581::FP48 *r, ECP8 *P, ECP *Q);
+/**	@brief Calculate Miller loop for Optimal ATE double-pairing e(P,Q).e(R,S)
+ *
+	Faster than calculating two separate pairings
+	@param r FP48 result of the pairing calculation e(P,Q).e(R,S), an element of GT
+	@param P ECP8 instance, an element of G2
+	@param Q ECP instance, an element of G1
+	@param R ECP8 instance, an element of G2
+	@param S ECP instance, an element of G1
+ */
+extern void PAIR_double_ate(BLS48581::FP48 *r, ECP8 *P, ECP *Q, ECP8 *R, ECP *S);
+/**	@brief Final exponentiation of pairing, converts output of Miller loop to element in GT
+ *
+	Here p is the internal modulus, and r is the group order
+	@param x FP48, on exit = x^((p^12-1)/r)
+ */
+extern void PAIR_fexp(BLS48581::FP48 *x);
+/**	@brief Fast point multiplication of a member of the group G1 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param Q ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G1mul(ECP *Q, B584_60::BIG b);
+/**	@brief Fast point multiplication of a member of the group G2 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param P ECP8 member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G2mul(ECP8 *P, B584_60::BIG b);
+/**	@brief Fast raising of a member of GT to a BIG power
+ *
+	May exploit endomorphism for speed.
+	@param x FP48 member of GT.
+	@param b BIG exponent
+
+ */
+extern void PAIR_GTpow(BLS48581::FP48 *x, B584_60::BIG b);
+
+/**	@brief Tests ECP for membership of G1
+ *
+	@param P ECP member of G1
+	@return true or false
+
+ */
+extern int PAIR_G1member(BLS48581::ECP *P);
+
+/**	@brief Tests ECP8 for membership of G2
+ *
+	@param P ECP8 member of G2
+	@return true or false
+
+ */
+extern int PAIR_G2member(BLS48581::ECP8 *P);
+
+/**	@brief Tests FP48 for membership of cyclotomic subgroup
+ *
+	@param x FP48 instance
+	@return 1 if x is cyclotomic, else return 0
+
+ */
+extern int PAIR_GTcyclotomic(BLS48581::FP48 *x);
+
+/**	@brief Tests FP48 for full membership of GT
+ *
+	@param x FP48 instance
+	@return 1 if x is in GT, else return 0
+
+ */
+extern int PAIR_GTmember(BLS48581::FP48 *x);
+
+/**	@brief Precompute line functions for n-pairing
+ *
+	@param r array of precomputed FP48 products of line functions
+	@param PV ECP8 instance, an element of G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another(BLS48581::FP48 r[], ECP8* PV, ECP* QV);
+
+
+/**	@brief Compute line functions for n-pairing, assuming precomputation on G2
+ *
+	@param r array of precomputed FP48 products of line functions
+	@param T array contains precomputed partial line fucntions from G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another_pc(BLS48581::FP48 r[], BLS48581::FP16 T[], ECP *QV);
+
+
+
+/**	@brief Prepare Ate parameter
+ *
+	@param n BIG parameter
+	@param n3 BIG paramter = 3*n
+	@return number of nits in n3
+
+ */
+extern int PAIR_nbits(B584_60::BIG n3, B584_60::BIG n);
+
+/**	@brief Initialise structure for multi-pairing
+ *
+	@param r FP48 array, to be initialised to 1
+
+ */
+extern void PAIR_initmp(BLS48581::FP48 r[]);
+
+
+/**	@brief Miller loop
+ *
+ 	@param res FP48 result
+	@param r FP48 precomputed array of accumulated line functions
+
+ */
+extern void PAIR_miller(BLS48581::FP48 *res, BLS48581::FP48 r[]);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/pair_BLS12381.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/pair_BLS12381.h
new file mode 100644
index 0000000..2008cc8
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/pair_BLS12381.h
@@ -0,0 +1,183 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef PAIR_BLS12381_H
+#define PAIR_BLS12381_H
+
+#include "fp12_BLS12381.h"
+#include "ecp2_BLS12381.h"
+#include "ecp_BLS12381.h"
+
+using namespace core;
+
+namespace BLS12381 {
+/* Pairing constants */
+
+extern const B384_58::BIG CURVE_Bnx; /**< BN curve x parameter */
+extern const B384_58::BIG CURVE_Cru; /**< BN curve Cube Root of Unity */
+
+extern const B384_58::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B384_58::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B384_58::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B384_58::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+/* Pairing function prototypes */
+
+
+/**	@brief Precompute line functions details for fixed G2 value
+ *
+	@param T array of precomputed FP4 partial line functions
+	@param GV a fixed ECP2 instance
+ */
+extern void PAIR_precomp(BLS12381::FP4 T[], ECP2* GV);
+
+/**	@brief Compute line functions for n-pairing
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param PV ECP2 instance, an element of G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another(BLS12381::FP12 r[], ECP2* PV, ECP* QV);
+
+
+/**	@brief Compute line functions for n-pairing, assuming precomputation on G2
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param T array contains precomputed partial line fucntions from G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another_pc(BLS12381::FP12 r[], BLS12381::FP4 T[], ECP *QV);
+
+
+
+/**	@brief Calculate Miller loop for Optimal ATE pairing e(P,Q)
+ *
+	@param r FP12 result of the pairing calculation e(P,Q)
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+
+ */
+extern void PAIR_ate(BLS12381::FP12 *r, ECP2 *P, ECP *Q);
+/**	@brief Calculate Miller loop for Optimal ATE double-pairing e(P,Q).e(R,S)
+ *
+	Faster than calculating two separate pairings
+	@param r FP12 result of the pairing calculation e(P,Q).e(R,S), an element of GT
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+	@param R ECP2 instance, an element of G2
+	@param S ECP instance, an element of G1
+ */
+extern void PAIR_double_ate(BLS12381::FP12 *r, ECP2 *P, ECP *Q, ECP2 *R, ECP *S);
+/**	@brief Final exponentiation of pairing, converts output of Miller loop to element in GT
+ *
+	Here p is the internal modulus, and r is the group order
+	@param x FP12, on exit = x^((p^12-1)/r)
+ */
+extern void PAIR_fexp(BLS12381::FP12 *x);
+/**	@brief Fast point multiplication of a member of the group G1 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param Q ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G1mul(ECP *Q, B384_58::BIG b);
+/**	@brief Fast point multiplication of a member of the group G2 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param P ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G2mul(ECP2 *P, B384_58::BIG b);
+
+
+
+/**	@brief Fast raising of a member of GT to a BIG power
+ *
+	May exploit endomorphism for speed.
+	@param x FP12 member of GT.
+	@param b BIG exponent
+
+ */
+extern void PAIR_GTpow(BLS12381::FP12 *x, B384_58::BIG b);
+
+
+/**	@brief Tests ECP for membership of G1
+ *
+	@param P ECP member of G1
+	@return true or false
+
+ */
+extern int PAIR_G1member(BLS12381::ECP *P);
+
+/**	@brief Tests ECP2 for membership of G2
+ *
+	@param P ECP2 member of G2
+	@return true or false
+
+ */
+extern int PAIR_G2member(BLS12381::ECP2 *P);
+
+/**	@brief Tests FP12 for membership of cyclotomic sub-group
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTcyclotomic(BLS12381::FP12 *x);
+
+/**	@brief Tests FP12 for membership of GT
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTmember(BLS12381::FP12 *x);
+
+/**	@brief Prepare Ate parameter
+ *
+	@param n BIG parameter
+	@param n3 BIG paramter = 3*n
+	@return number of nits in n3
+
+ */
+extern int PAIR_nbits(B384_58::BIG n3, B384_58::BIG n);
+
+/**	@brief Initialise structure for multi-pairing
+ *
+	@param r FP12 array, to be initialised to 1
+
+ */
+extern void PAIR_initmp(BLS12381::FP12 r[]);
+
+
+/**	@brief Miller loop
+ *
+ 	@param res FP12 result
+	@param r FP12 precomputed array of accumulated line functions
+
+ */
+extern void PAIR_miller(BLS12381::FP12 *res, BLS12381::FP12 r[]);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/pair_BLS12383.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/pair_BLS12383.h
new file mode 100644
index 0000000..a15eb52
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/pair_BLS12383.h
@@ -0,0 +1,183 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef PAIR_BLS12383_H
+#define PAIR_BLS12383_H
+
+#include "fp12_BLS12383.h"
+#include "ecp2_BLS12383.h"
+#include "ecp_BLS12383.h"
+
+using namespace core;
+
+namespace BLS12383 {
+/* Pairing constants */
+
+extern const B384_58::BIG CURVE_Bnx; /**< BN curve x parameter */
+extern const B384_58::BIG CURVE_Cru; /**< BN curve Cube Root of Unity */
+
+extern const B384_58::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B384_58::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B384_58::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B384_58::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+/* Pairing function prototypes */
+
+
+/**	@brief Precompute line functions details for fixed G2 value
+ *
+	@param T array of precomputed FP4 partial line functions
+	@param GV a fixed ECP2 instance
+ */
+extern void PAIR_precomp(BLS12383::FP4 T[], ECP2* GV);
+
+/**	@brief Compute line functions for n-pairing
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param PV ECP2 instance, an element of G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another(BLS12383::FP12 r[], ECP2* PV, ECP* QV);
+
+
+/**	@brief Compute line functions for n-pairing, assuming precomputation on G2
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param T array contains precomputed partial line fucntions from G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another_pc(BLS12383::FP12 r[], BLS12383::FP4 T[], ECP *QV);
+
+
+
+/**	@brief Calculate Miller loop for Optimal ATE pairing e(P,Q)
+ *
+	@param r FP12 result of the pairing calculation e(P,Q)
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+
+ */
+extern void PAIR_ate(BLS12383::FP12 *r, ECP2 *P, ECP *Q);
+/**	@brief Calculate Miller loop for Optimal ATE double-pairing e(P,Q).e(R,S)
+ *
+	Faster than calculating two separate pairings
+	@param r FP12 result of the pairing calculation e(P,Q).e(R,S), an element of GT
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+	@param R ECP2 instance, an element of G2
+	@param S ECP instance, an element of G1
+ */
+extern void PAIR_double_ate(BLS12383::FP12 *r, ECP2 *P, ECP *Q, ECP2 *R, ECP *S);
+/**	@brief Final exponentiation of pairing, converts output of Miller loop to element in GT
+ *
+	Here p is the internal modulus, and r is the group order
+	@param x FP12, on exit = x^((p^12-1)/r)
+ */
+extern void PAIR_fexp(BLS12383::FP12 *x);
+/**	@brief Fast point multiplication of a member of the group G1 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param Q ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G1mul(ECP *Q, B384_58::BIG b);
+/**	@brief Fast point multiplication of a member of the group G2 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param P ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G2mul(ECP2 *P, B384_58::BIG b);
+
+
+
+/**	@brief Fast raising of a member of GT to a BIG power
+ *
+	May exploit endomorphism for speed.
+	@param x FP12 member of GT.
+	@param b BIG exponent
+
+ */
+extern void PAIR_GTpow(BLS12383::FP12 *x, B384_58::BIG b);
+
+
+/**	@brief Tests ECP for membership of G1
+ *
+	@param P ECP member of G1
+	@return true or false
+
+ */
+extern int PAIR_G1member(BLS12383::ECP *P);
+
+/**	@brief Tests ECP2 for membership of G2
+ *
+	@param P ECP2 member of G2
+	@return true or false
+
+ */
+extern int PAIR_G2member(BLS12383::ECP2 *P);
+
+/**	@brief Tests FP12 for membership of cyclotomic sub-group
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTcyclotomic(BLS12383::FP12 *x);
+
+/**	@brief Tests FP12 for membership of GT
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTmember(BLS12383::FP12 *x);
+
+/**	@brief Prepare Ate parameter
+ *
+	@param n BIG parameter
+	@param n3 BIG paramter = 3*n
+	@return number of nits in n3
+
+ */
+extern int PAIR_nbits(B384_58::BIG n3, B384_58::BIG n);
+
+/**	@brief Initialise structure for multi-pairing
+ *
+	@param r FP12 array, to be initialised to 1
+
+ */
+extern void PAIR_initmp(BLS12383::FP12 r[]);
+
+
+/**	@brief Miller loop
+ *
+ 	@param res FP12 result
+	@param r FP12 precomputed array of accumulated line functions
+
+ */
+extern void PAIR_miller(BLS12383::FP12 *res, BLS12383::FP12 r[]);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/pair_BLS12443.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/pair_BLS12443.h
new file mode 100644
index 0000000..14a0257
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/pair_BLS12443.h
@@ -0,0 +1,183 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef PAIR_BLS12443_H
+#define PAIR_BLS12443_H
+
+#include "fp12_BLS12443.h"
+#include "ecp2_BLS12443.h"
+#include "ecp_BLS12443.h"
+
+using namespace core;
+
+namespace BLS12443 {
+/* Pairing constants */
+
+extern const B448_60::BIG CURVE_Bnx; /**< BN curve x parameter */
+extern const B448_60::BIG CURVE_Cru; /**< BN curve Cube Root of Unity */
+
+extern const B448_60::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B448_60::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B448_60::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B448_60::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+/* Pairing function prototypes */
+
+
+/**	@brief Precompute line functions details for fixed G2 value
+ *
+	@param T array of precomputed FP4 partial line functions
+	@param GV a fixed ECP2 instance
+ */
+extern void PAIR_precomp(BLS12443::FP4 T[], ECP2* GV);
+
+/**	@brief Compute line functions for n-pairing
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param PV ECP2 instance, an element of G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another(BLS12443::FP12 r[], ECP2* PV, ECP* QV);
+
+
+/**	@brief Compute line functions for n-pairing, assuming precomputation on G2
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param T array contains precomputed partial line fucntions from G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another_pc(BLS12443::FP12 r[], BLS12443::FP4 T[], ECP *QV);
+
+
+
+/**	@brief Calculate Miller loop for Optimal ATE pairing e(P,Q)
+ *
+	@param r FP12 result of the pairing calculation e(P,Q)
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+
+ */
+extern void PAIR_ate(BLS12443::FP12 *r, ECP2 *P, ECP *Q);
+/**	@brief Calculate Miller loop for Optimal ATE double-pairing e(P,Q).e(R,S)
+ *
+	Faster than calculating two separate pairings
+	@param r FP12 result of the pairing calculation e(P,Q).e(R,S), an element of GT
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+	@param R ECP2 instance, an element of G2
+	@param S ECP instance, an element of G1
+ */
+extern void PAIR_double_ate(BLS12443::FP12 *r, ECP2 *P, ECP *Q, ECP2 *R, ECP *S);
+/**	@brief Final exponentiation of pairing, converts output of Miller loop to element in GT
+ *
+	Here p is the internal modulus, and r is the group order
+	@param x FP12, on exit = x^((p^12-1)/r)
+ */
+extern void PAIR_fexp(BLS12443::FP12 *x);
+/**	@brief Fast point multiplication of a member of the group G1 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param Q ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G1mul(ECP *Q, B448_60::BIG b);
+/**	@brief Fast point multiplication of a member of the group G2 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param P ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G2mul(ECP2 *P, B448_60::BIG b);
+
+
+
+/**	@brief Fast raising of a member of GT to a BIG power
+ *
+	May exploit endomorphism for speed.
+	@param x FP12 member of GT.
+	@param b BIG exponent
+
+ */
+extern void PAIR_GTpow(BLS12443::FP12 *x, B448_60::BIG b);
+
+
+/**	@brief Tests ECP for membership of G1
+ *
+	@param P ECP member of G1
+	@return true or false
+
+ */
+extern int PAIR_G1member(BLS12443::ECP *P);
+
+/**	@brief Tests ECP2 for membership of G2
+ *
+	@param P ECP2 member of G2
+	@return true or false
+
+ */
+extern int PAIR_G2member(BLS12443::ECP2 *P);
+
+/**	@brief Tests FP12 for membership of cyclotomic sub-group
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTcyclotomic(BLS12443::FP12 *x);
+
+/**	@brief Tests FP12 for membership of GT
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTmember(BLS12443::FP12 *x);
+
+/**	@brief Prepare Ate parameter
+ *
+	@param n BIG parameter
+	@param n3 BIG paramter = 3*n
+	@return number of nits in n3
+
+ */
+extern int PAIR_nbits(B448_60::BIG n3, B448_60::BIG n);
+
+/**	@brief Initialise structure for multi-pairing
+ *
+	@param r FP12 array, to be initialised to 1
+
+ */
+extern void PAIR_initmp(BLS12443::FP12 r[]);
+
+
+/**	@brief Miller loop
+ *
+ 	@param res FP12 result
+	@param r FP12 precomputed array of accumulated line functions
+
+ */
+extern void PAIR_miller(BLS12443::FP12 *res, BLS12443::FP12 r[]);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/pair_BLS12461.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/pair_BLS12461.h
new file mode 100644
index 0000000..e50fc19
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/pair_BLS12461.h
@@ -0,0 +1,183 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef PAIR_BLS12461_H
+#define PAIR_BLS12461_H
+
+#include "fp12_BLS12461.h"
+#include "ecp2_BLS12461.h"
+#include "ecp_BLS12461.h"
+
+using namespace core;
+
+namespace BLS12461 {
+/* Pairing constants */
+
+extern const B464_60::BIG CURVE_Bnx; /**< BN curve x parameter */
+extern const B464_60::BIG CURVE_Cru; /**< BN curve Cube Root of Unity */
+
+extern const B464_60::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B464_60::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B464_60::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B464_60::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+/* Pairing function prototypes */
+
+
+/**	@brief Precompute line functions details for fixed G2 value
+ *
+	@param T array of precomputed FP4 partial line functions
+	@param GV a fixed ECP2 instance
+ */
+extern void PAIR_precomp(BLS12461::FP4 T[], ECP2* GV);
+
+/**	@brief Compute line functions for n-pairing
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param PV ECP2 instance, an element of G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another(BLS12461::FP12 r[], ECP2* PV, ECP* QV);
+
+
+/**	@brief Compute line functions for n-pairing, assuming precomputation on G2
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param T array contains precomputed partial line fucntions from G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another_pc(BLS12461::FP12 r[], BLS12461::FP4 T[], ECP *QV);
+
+
+
+/**	@brief Calculate Miller loop for Optimal ATE pairing e(P,Q)
+ *
+	@param r FP12 result of the pairing calculation e(P,Q)
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+
+ */
+extern void PAIR_ate(BLS12461::FP12 *r, ECP2 *P, ECP *Q);
+/**	@brief Calculate Miller loop for Optimal ATE double-pairing e(P,Q).e(R,S)
+ *
+	Faster than calculating two separate pairings
+	@param r FP12 result of the pairing calculation e(P,Q).e(R,S), an element of GT
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+	@param R ECP2 instance, an element of G2
+	@param S ECP instance, an element of G1
+ */
+extern void PAIR_double_ate(BLS12461::FP12 *r, ECP2 *P, ECP *Q, ECP2 *R, ECP *S);
+/**	@brief Final exponentiation of pairing, converts output of Miller loop to element in GT
+ *
+	Here p is the internal modulus, and r is the group order
+	@param x FP12, on exit = x^((p^12-1)/r)
+ */
+extern void PAIR_fexp(BLS12461::FP12 *x);
+/**	@brief Fast point multiplication of a member of the group G1 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param Q ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G1mul(ECP *Q, B464_60::BIG b);
+/**	@brief Fast point multiplication of a member of the group G2 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param P ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G2mul(ECP2 *P, B464_60::BIG b);
+
+
+
+/**	@brief Fast raising of a member of GT to a BIG power
+ *
+	May exploit endomorphism for speed.
+	@param x FP12 member of GT.
+	@param b BIG exponent
+
+ */
+extern void PAIR_GTpow(BLS12461::FP12 *x, B464_60::BIG b);
+
+
+/**	@brief Tests ECP for membership of G1
+ *
+	@param P ECP member of G1
+	@return true or false
+
+ */
+extern int PAIR_G1member(BLS12461::ECP *P);
+
+/**	@brief Tests ECP2 for membership of G2
+ *
+	@param P ECP2 member of G2
+	@return true or false
+
+ */
+extern int PAIR_G2member(BLS12461::ECP2 *P);
+
+/**	@brief Tests FP12 for membership of cyclotomic sub-group
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTcyclotomic(BLS12461::FP12 *x);
+
+/**	@brief Tests FP12 for membership of GT
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTmember(BLS12461::FP12 *x);
+
+/**	@brief Prepare Ate parameter
+ *
+	@param n BIG parameter
+	@param n3 BIG paramter = 3*n
+	@return number of nits in n3
+
+ */
+extern int PAIR_nbits(B464_60::BIG n3, B464_60::BIG n);
+
+/**	@brief Initialise structure for multi-pairing
+ *
+	@param r FP12 array, to be initialised to 1
+
+ */
+extern void PAIR_initmp(BLS12461::FP12 r[]);
+
+
+/**	@brief Miller loop
+ *
+ 	@param res FP12 result
+	@param r FP12 precomputed array of accumulated line functions
+
+ */
+extern void PAIR_miller(BLS12461::FP12 *res, BLS12461::FP12 r[]);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/pair_BN158.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/pair_BN158.h
new file mode 100644
index 0000000..13b27c0
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/pair_BN158.h
@@ -0,0 +1,183 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef PAIR_BN158_H
+#define PAIR_BN158_H
+
+#include "fp12_BN158.h"
+#include "ecp2_BN158.h"
+#include "ecp_BN158.h"
+
+using namespace core;
+
+namespace BN158 {
+/* Pairing constants */
+
+extern const B160_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+extern const B160_56::BIG CURVE_Cru; /**< BN curve Cube Root of Unity */
+
+extern const B160_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B160_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B160_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B160_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+/* Pairing function prototypes */
+
+
+/**	@brief Precompute line functions details for fixed G2 value
+ *
+	@param T array of precomputed FP4 partial line functions
+	@param GV a fixed ECP2 instance
+ */
+extern void PAIR_precomp(BN158::FP4 T[], ECP2* GV);
+
+/**	@brief Compute line functions for n-pairing
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param PV ECP2 instance, an element of G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another(BN158::FP12 r[], ECP2* PV, ECP* QV);
+
+
+/**	@brief Compute line functions for n-pairing, assuming precomputation on G2
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param T array contains precomputed partial line fucntions from G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another_pc(BN158::FP12 r[], BN158::FP4 T[], ECP *QV);
+
+
+
+/**	@brief Calculate Miller loop for Optimal ATE pairing e(P,Q)
+ *
+	@param r FP12 result of the pairing calculation e(P,Q)
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+
+ */
+extern void PAIR_ate(BN158::FP12 *r, ECP2 *P, ECP *Q);
+/**	@brief Calculate Miller loop for Optimal ATE double-pairing e(P,Q).e(R,S)
+ *
+	Faster than calculating two separate pairings
+	@param r FP12 result of the pairing calculation e(P,Q).e(R,S), an element of GT
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+	@param R ECP2 instance, an element of G2
+	@param S ECP instance, an element of G1
+ */
+extern void PAIR_double_ate(BN158::FP12 *r, ECP2 *P, ECP *Q, ECP2 *R, ECP *S);
+/**	@brief Final exponentiation of pairing, converts output of Miller loop to element in GT
+ *
+	Here p is the internal modulus, and r is the group order
+	@param x FP12, on exit = x^((p^12-1)/r)
+ */
+extern void PAIR_fexp(BN158::FP12 *x);
+/**	@brief Fast point multiplication of a member of the group G1 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param Q ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G1mul(ECP *Q, B160_56::BIG b);
+/**	@brief Fast point multiplication of a member of the group G2 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param P ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G2mul(ECP2 *P, B160_56::BIG b);
+
+
+
+/**	@brief Fast raising of a member of GT to a BIG power
+ *
+	May exploit endomorphism for speed.
+	@param x FP12 member of GT.
+	@param b BIG exponent
+
+ */
+extern void PAIR_GTpow(BN158::FP12 *x, B160_56::BIG b);
+
+
+/**	@brief Tests ECP for membership of G1
+ *
+	@param P ECP member of G1
+	@return true or false
+
+ */
+extern int PAIR_G1member(BN158::ECP *P);
+
+/**	@brief Tests ECP2 for membership of G2
+ *
+	@param P ECP2 member of G2
+	@return true or false
+
+ */
+extern int PAIR_G2member(BN158::ECP2 *P);
+
+/**	@brief Tests FP12 for membership of cyclotomic sub-group
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTcyclotomic(BN158::FP12 *x);
+
+/**	@brief Tests FP12 for membership of GT
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTmember(BN158::FP12 *x);
+
+/**	@brief Prepare Ate parameter
+ *
+	@param n BIG parameter
+	@param n3 BIG paramter = 3*n
+	@return number of nits in n3
+
+ */
+extern int PAIR_nbits(B160_56::BIG n3, B160_56::BIG n);
+
+/**	@brief Initialise structure for multi-pairing
+ *
+	@param r FP12 array, to be initialised to 1
+
+ */
+extern void PAIR_initmp(BN158::FP12 r[]);
+
+
+/**	@brief Miller loop
+ *
+ 	@param res FP12 result
+	@param r FP12 precomputed array of accumulated line functions
+
+ */
+extern void PAIR_miller(BN158::FP12 *res, BN158::FP12 r[]);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/pair_BN254.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/pair_BN254.h
new file mode 100644
index 0000000..dc0e5b3
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/pair_BN254.h
@@ -0,0 +1,183 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef PAIR_BN254_H
+#define PAIR_BN254_H
+
+#include "fp12_BN254.h"
+#include "ecp2_BN254.h"
+#include "ecp_BN254.h"
+
+using namespace core;
+
+namespace BN254 {
+/* Pairing constants */
+
+extern const B256_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+extern const B256_56::BIG CURVE_Cru; /**< BN curve Cube Root of Unity */
+
+extern const B256_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+/* Pairing function prototypes */
+
+
+/**	@brief Precompute line functions details for fixed G2 value
+ *
+	@param T array of precomputed FP4 partial line functions
+	@param GV a fixed ECP2 instance
+ */
+extern void PAIR_precomp(BN254::FP4 T[], ECP2* GV);
+
+/**	@brief Compute line functions for n-pairing
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param PV ECP2 instance, an element of G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another(BN254::FP12 r[], ECP2* PV, ECP* QV);
+
+
+/**	@brief Compute line functions for n-pairing, assuming precomputation on G2
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param T array contains precomputed partial line fucntions from G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another_pc(BN254::FP12 r[], BN254::FP4 T[], ECP *QV);
+
+
+
+/**	@brief Calculate Miller loop for Optimal ATE pairing e(P,Q)
+ *
+	@param r FP12 result of the pairing calculation e(P,Q)
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+
+ */
+extern void PAIR_ate(BN254::FP12 *r, ECP2 *P, ECP *Q);
+/**	@brief Calculate Miller loop for Optimal ATE double-pairing e(P,Q).e(R,S)
+ *
+	Faster than calculating two separate pairings
+	@param r FP12 result of the pairing calculation e(P,Q).e(R,S), an element of GT
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+	@param R ECP2 instance, an element of G2
+	@param S ECP instance, an element of G1
+ */
+extern void PAIR_double_ate(BN254::FP12 *r, ECP2 *P, ECP *Q, ECP2 *R, ECP *S);
+/**	@brief Final exponentiation of pairing, converts output of Miller loop to element in GT
+ *
+	Here p is the internal modulus, and r is the group order
+	@param x FP12, on exit = x^((p^12-1)/r)
+ */
+extern void PAIR_fexp(BN254::FP12 *x);
+/**	@brief Fast point multiplication of a member of the group G1 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param Q ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G1mul(ECP *Q, B256_56::BIG b);
+/**	@brief Fast point multiplication of a member of the group G2 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param P ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G2mul(ECP2 *P, B256_56::BIG b);
+
+
+
+/**	@brief Fast raising of a member of GT to a BIG power
+ *
+	May exploit endomorphism for speed.
+	@param x FP12 member of GT.
+	@param b BIG exponent
+
+ */
+extern void PAIR_GTpow(BN254::FP12 *x, B256_56::BIG b);
+
+
+/**	@brief Tests ECP for membership of G1
+ *
+	@param P ECP member of G1
+	@return true or false
+
+ */
+extern int PAIR_G1member(BN254::ECP *P);
+
+/**	@brief Tests ECP2 for membership of G2
+ *
+	@param P ECP2 member of G2
+	@return true or false
+
+ */
+extern int PAIR_G2member(BN254::ECP2 *P);
+
+/**	@brief Tests FP12 for membership of cyclotomic sub-group
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTcyclotomic(BN254::FP12 *x);
+
+/**	@brief Tests FP12 for membership of GT
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTmember(BN254::FP12 *x);
+
+/**	@brief Prepare Ate parameter
+ *
+	@param n BIG parameter
+	@param n3 BIG paramter = 3*n
+	@return number of nits in n3
+
+ */
+extern int PAIR_nbits(B256_56::BIG n3, B256_56::BIG n);
+
+/**	@brief Initialise structure for multi-pairing
+ *
+	@param r FP12 array, to be initialised to 1
+
+ */
+extern void PAIR_initmp(BN254::FP12 r[]);
+
+
+/**	@brief Miller loop
+ *
+ 	@param res FP12 result
+	@param r FP12 precomputed array of accumulated line functions
+
+ */
+extern void PAIR_miller(BN254::FP12 *res, BN254::FP12 r[]);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/pair_BN254CX.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/pair_BN254CX.h
new file mode 100644
index 0000000..f00bd52
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/pair_BN254CX.h
@@ -0,0 +1,183 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef PAIR_BN254CX_H
+#define PAIR_BN254CX_H
+
+#include "fp12_BN254CX.h"
+#include "ecp2_BN254CX.h"
+#include "ecp_BN254CX.h"
+
+using namespace core;
+
+namespace BN254CX {
+/* Pairing constants */
+
+extern const B256_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+extern const B256_56::BIG CURVE_Cru; /**< BN curve Cube Root of Unity */
+
+extern const B256_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+/* Pairing function prototypes */
+
+
+/**	@brief Precompute line functions details for fixed G2 value
+ *
+	@param T array of precomputed FP4 partial line functions
+	@param GV a fixed ECP2 instance
+ */
+extern void PAIR_precomp(BN254CX::FP4 T[], ECP2* GV);
+
+/**	@brief Compute line functions for n-pairing
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param PV ECP2 instance, an element of G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another(BN254CX::FP12 r[], ECP2* PV, ECP* QV);
+
+
+/**	@brief Compute line functions for n-pairing, assuming precomputation on G2
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param T array contains precomputed partial line fucntions from G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another_pc(BN254CX::FP12 r[], BN254CX::FP4 T[], ECP *QV);
+
+
+
+/**	@brief Calculate Miller loop for Optimal ATE pairing e(P,Q)
+ *
+	@param r FP12 result of the pairing calculation e(P,Q)
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+
+ */
+extern void PAIR_ate(BN254CX::FP12 *r, ECP2 *P, ECP *Q);
+/**	@brief Calculate Miller loop for Optimal ATE double-pairing e(P,Q).e(R,S)
+ *
+	Faster than calculating two separate pairings
+	@param r FP12 result of the pairing calculation e(P,Q).e(R,S), an element of GT
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+	@param R ECP2 instance, an element of G2
+	@param S ECP instance, an element of G1
+ */
+extern void PAIR_double_ate(BN254CX::FP12 *r, ECP2 *P, ECP *Q, ECP2 *R, ECP *S);
+/**	@brief Final exponentiation of pairing, converts output of Miller loop to element in GT
+ *
+	Here p is the internal modulus, and r is the group order
+	@param x FP12, on exit = x^((p^12-1)/r)
+ */
+extern void PAIR_fexp(BN254CX::FP12 *x);
+/**	@brief Fast point multiplication of a member of the group G1 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param Q ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G1mul(ECP *Q, B256_56::BIG b);
+/**	@brief Fast point multiplication of a member of the group G2 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param P ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G2mul(ECP2 *P, B256_56::BIG b);
+
+
+
+/**	@brief Fast raising of a member of GT to a BIG power
+ *
+	May exploit endomorphism for speed.
+	@param x FP12 member of GT.
+	@param b BIG exponent
+
+ */
+extern void PAIR_GTpow(BN254CX::FP12 *x, B256_56::BIG b);
+
+
+/**	@brief Tests ECP for membership of G1
+ *
+	@param P ECP member of G1
+	@return true or false
+
+ */
+extern int PAIR_G1member(BN254CX::ECP *P);
+
+/**	@brief Tests ECP2 for membership of G2
+ *
+	@param P ECP2 member of G2
+	@return true or false
+
+ */
+extern int PAIR_G2member(BN254CX::ECP2 *P);
+
+/**	@brief Tests FP12 for membership of cyclotomic sub-group
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTcyclotomic(BN254CX::FP12 *x);
+
+/**	@brief Tests FP12 for membership of GT
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTmember(BN254CX::FP12 *x);
+
+/**	@brief Prepare Ate parameter
+ *
+	@param n BIG parameter
+	@param n3 BIG paramter = 3*n
+	@return number of nits in n3
+
+ */
+extern int PAIR_nbits(B256_56::BIG n3, B256_56::BIG n);
+
+/**	@brief Initialise structure for multi-pairing
+ *
+	@param r FP12 array, to be initialised to 1
+
+ */
+extern void PAIR_initmp(BN254CX::FP12 r[]);
+
+
+/**	@brief Miller loop
+ *
+ 	@param res FP12 result
+	@param r FP12 precomputed array of accumulated line functions
+
+ */
+extern void PAIR_miller(BN254CX::FP12 *res, BN254CX::FP12 r[]);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/pair_BN462.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/pair_BN462.h
new file mode 100644
index 0000000..77dd802
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/pair_BN462.h
@@ -0,0 +1,183 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef PAIR_BN462_H
+#define PAIR_BN462_H
+
+#include "fp12_BN462.h"
+#include "ecp2_BN462.h"
+#include "ecp_BN462.h"
+
+using namespace core;
+
+namespace BN462 {
+/* Pairing constants */
+
+extern const B464_60::BIG CURVE_Bnx; /**< BN curve x parameter */
+extern const B464_60::BIG CURVE_Cru; /**< BN curve Cube Root of Unity */
+
+extern const B464_60::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B464_60::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B464_60::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B464_60::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+/* Pairing function prototypes */
+
+
+/**	@brief Precompute line functions details for fixed G2 value
+ *
+	@param T array of precomputed FP4 partial line functions
+	@param GV a fixed ECP2 instance
+ */
+extern void PAIR_precomp(BN462::FP4 T[], ECP2* GV);
+
+/**	@brief Compute line functions for n-pairing
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param PV ECP2 instance, an element of G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another(BN462::FP12 r[], ECP2* PV, ECP* QV);
+
+
+/**	@brief Compute line functions for n-pairing, assuming precomputation on G2
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param T array contains precomputed partial line fucntions from G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another_pc(BN462::FP12 r[], BN462::FP4 T[], ECP *QV);
+
+
+
+/**	@brief Calculate Miller loop for Optimal ATE pairing e(P,Q)
+ *
+	@param r FP12 result of the pairing calculation e(P,Q)
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+
+ */
+extern void PAIR_ate(BN462::FP12 *r, ECP2 *P, ECP *Q);
+/**	@brief Calculate Miller loop for Optimal ATE double-pairing e(P,Q).e(R,S)
+ *
+	Faster than calculating two separate pairings
+	@param r FP12 result of the pairing calculation e(P,Q).e(R,S), an element of GT
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+	@param R ECP2 instance, an element of G2
+	@param S ECP instance, an element of G1
+ */
+extern void PAIR_double_ate(BN462::FP12 *r, ECP2 *P, ECP *Q, ECP2 *R, ECP *S);
+/**	@brief Final exponentiation of pairing, converts output of Miller loop to element in GT
+ *
+	Here p is the internal modulus, and r is the group order
+	@param x FP12, on exit = x^((p^12-1)/r)
+ */
+extern void PAIR_fexp(BN462::FP12 *x);
+/**	@brief Fast point multiplication of a member of the group G1 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param Q ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G1mul(ECP *Q, B464_60::BIG b);
+/**	@brief Fast point multiplication of a member of the group G2 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param P ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G2mul(ECP2 *P, B464_60::BIG b);
+
+
+
+/**	@brief Fast raising of a member of GT to a BIG power
+ *
+	May exploit endomorphism for speed.
+	@param x FP12 member of GT.
+	@param b BIG exponent
+
+ */
+extern void PAIR_GTpow(BN462::FP12 *x, B464_60::BIG b);
+
+
+/**	@brief Tests ECP for membership of G1
+ *
+	@param P ECP member of G1
+	@return true or false
+
+ */
+extern int PAIR_G1member(BN462::ECP *P);
+
+/**	@brief Tests ECP2 for membership of G2
+ *
+	@param P ECP2 member of G2
+	@return true or false
+
+ */
+extern int PAIR_G2member(BN462::ECP2 *P);
+
+/**	@brief Tests FP12 for membership of cyclotomic sub-group
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTcyclotomic(BN462::FP12 *x);
+
+/**	@brief Tests FP12 for membership of GT
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTmember(BN462::FP12 *x);
+
+/**	@brief Prepare Ate parameter
+ *
+	@param n BIG parameter
+	@param n3 BIG paramter = 3*n
+	@return number of nits in n3
+
+ */
+extern int PAIR_nbits(B464_60::BIG n3, B464_60::BIG n);
+
+/**	@brief Initialise structure for multi-pairing
+ *
+	@param r FP12 array, to be initialised to 1
+
+ */
+extern void PAIR_initmp(BN462::FP12 r[]);
+
+
+/**	@brief Miller loop
+ *
+ 	@param res FP12 result
+	@param r FP12 precomputed array of accumulated line functions
+
+ */
+extern void PAIR_miller(BN462::FP12 *res, BN462::FP12 r[]);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/pair_FP256BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/pair_FP256BN.h
new file mode 100644
index 0000000..bfdf8ba
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/pair_FP256BN.h
@@ -0,0 +1,183 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef PAIR_FP256BN_H
+#define PAIR_FP256BN_H
+
+#include "fp12_FP256BN.h"
+#include "ecp2_FP256BN.h"
+#include "ecp_FP256BN.h"
+
+using namespace core;
+
+namespace FP256BN {
+/* Pairing constants */
+
+extern const B256_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+extern const B256_56::BIG CURVE_Cru; /**< BN curve Cube Root of Unity */
+
+extern const B256_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+/* Pairing function prototypes */
+
+
+/**	@brief Precompute line functions details for fixed G2 value
+ *
+	@param T array of precomputed FP4 partial line functions
+	@param GV a fixed ECP2 instance
+ */
+extern void PAIR_precomp(FP256BN::FP4 T[], ECP2* GV);
+
+/**	@brief Compute line functions for n-pairing
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param PV ECP2 instance, an element of G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another(FP256BN::FP12 r[], ECP2* PV, ECP* QV);
+
+
+/**	@brief Compute line functions for n-pairing, assuming precomputation on G2
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param T array contains precomputed partial line fucntions from G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another_pc(FP256BN::FP12 r[], FP256BN::FP4 T[], ECP *QV);
+
+
+
+/**	@brief Calculate Miller loop for Optimal ATE pairing e(P,Q)
+ *
+	@param r FP12 result of the pairing calculation e(P,Q)
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+
+ */
+extern void PAIR_ate(FP256BN::FP12 *r, ECP2 *P, ECP *Q);
+/**	@brief Calculate Miller loop for Optimal ATE double-pairing e(P,Q).e(R,S)
+ *
+	Faster than calculating two separate pairings
+	@param r FP12 result of the pairing calculation e(P,Q).e(R,S), an element of GT
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+	@param R ECP2 instance, an element of G2
+	@param S ECP instance, an element of G1
+ */
+extern void PAIR_double_ate(FP256BN::FP12 *r, ECP2 *P, ECP *Q, ECP2 *R, ECP *S);
+/**	@brief Final exponentiation of pairing, converts output of Miller loop to element in GT
+ *
+	Here p is the internal modulus, and r is the group order
+	@param x FP12, on exit = x^((p^12-1)/r)
+ */
+extern void PAIR_fexp(FP256BN::FP12 *x);
+/**	@brief Fast point multiplication of a member of the group G1 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param Q ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G1mul(ECP *Q, B256_56::BIG b);
+/**	@brief Fast point multiplication of a member of the group G2 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param P ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G2mul(ECP2 *P, B256_56::BIG b);
+
+
+
+/**	@brief Fast raising of a member of GT to a BIG power
+ *
+	May exploit endomorphism for speed.
+	@param x FP12 member of GT.
+	@param b BIG exponent
+
+ */
+extern void PAIR_GTpow(FP256BN::FP12 *x, B256_56::BIG b);
+
+
+/**	@brief Tests ECP for membership of G1
+ *
+	@param P ECP member of G1
+	@return true or false
+
+ */
+extern int PAIR_G1member(FP256BN::ECP *P);
+
+/**	@brief Tests ECP2 for membership of G2
+ *
+	@param P ECP2 member of G2
+	@return true or false
+
+ */
+extern int PAIR_G2member(FP256BN::ECP2 *P);
+
+/**	@brief Tests FP12 for membership of cyclotomic sub-group
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTcyclotomic(FP256BN::FP12 *x);
+
+/**	@brief Tests FP12 for membership of GT
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTmember(FP256BN::FP12 *x);
+
+/**	@brief Prepare Ate parameter
+ *
+	@param n BIG parameter
+	@param n3 BIG paramter = 3*n
+	@return number of nits in n3
+
+ */
+extern int PAIR_nbits(B256_56::BIG n3, B256_56::BIG n);
+
+/**	@brief Initialise structure for multi-pairing
+ *
+	@param r FP12 array, to be initialised to 1
+
+ */
+extern void PAIR_initmp(FP256BN::FP12 r[]);
+
+
+/**	@brief Miller loop
+ *
+ 	@param res FP12 result
+	@param r FP12 precomputed array of accumulated line functions
+
+ */
+extern void PAIR_miller(FP256BN::FP12 *res, FP256BN::FP12 r[]);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/pair_FP512BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/pair_FP512BN.h
new file mode 100644
index 0000000..c54ca92
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/pair_FP512BN.h
@@ -0,0 +1,183 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef PAIR_FP512BN_H
+#define PAIR_FP512BN_H
+
+#include "fp12_FP512BN.h"
+#include "ecp2_FP512BN.h"
+#include "ecp_FP512BN.h"
+
+using namespace core;
+
+namespace FP512BN {
+/* Pairing constants */
+
+extern const B512_60::BIG CURVE_Bnx; /**< BN curve x parameter */
+extern const B512_60::BIG CURVE_Cru; /**< BN curve Cube Root of Unity */
+
+extern const B512_60::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B512_60::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B512_60::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B512_60::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+/* Pairing function prototypes */
+
+
+/**	@brief Precompute line functions details for fixed G2 value
+ *
+	@param T array of precomputed FP4 partial line functions
+	@param GV a fixed ECP2 instance
+ */
+extern void PAIR_precomp(FP512BN::FP4 T[], ECP2* GV);
+
+/**	@brief Compute line functions for n-pairing
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param PV ECP2 instance, an element of G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another(FP512BN::FP12 r[], ECP2* PV, ECP* QV);
+
+
+/**	@brief Compute line functions for n-pairing, assuming precomputation on G2
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param T array contains precomputed partial line fucntions from G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another_pc(FP512BN::FP12 r[], FP512BN::FP4 T[], ECP *QV);
+
+
+
+/**	@brief Calculate Miller loop for Optimal ATE pairing e(P,Q)
+ *
+	@param r FP12 result of the pairing calculation e(P,Q)
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+
+ */
+extern void PAIR_ate(FP512BN::FP12 *r, ECP2 *P, ECP *Q);
+/**	@brief Calculate Miller loop for Optimal ATE double-pairing e(P,Q).e(R,S)
+ *
+	Faster than calculating two separate pairings
+	@param r FP12 result of the pairing calculation e(P,Q).e(R,S), an element of GT
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+	@param R ECP2 instance, an element of G2
+	@param S ECP instance, an element of G1
+ */
+extern void PAIR_double_ate(FP512BN::FP12 *r, ECP2 *P, ECP *Q, ECP2 *R, ECP *S);
+/**	@brief Final exponentiation of pairing, converts output of Miller loop to element in GT
+ *
+	Here p is the internal modulus, and r is the group order
+	@param x FP12, on exit = x^((p^12-1)/r)
+ */
+extern void PAIR_fexp(FP512BN::FP12 *x);
+/**	@brief Fast point multiplication of a member of the group G1 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param Q ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G1mul(ECP *Q, B512_60::BIG b);
+/**	@brief Fast point multiplication of a member of the group G2 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param P ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G2mul(ECP2 *P, B512_60::BIG b);
+
+
+
+/**	@brief Fast raising of a member of GT to a BIG power
+ *
+	May exploit endomorphism for speed.
+	@param x FP12 member of GT.
+	@param b BIG exponent
+
+ */
+extern void PAIR_GTpow(FP512BN::FP12 *x, B512_60::BIG b);
+
+
+/**	@brief Tests ECP for membership of G1
+ *
+	@param P ECP member of G1
+	@return true or false
+
+ */
+extern int PAIR_G1member(FP512BN::ECP *P);
+
+/**	@brief Tests ECP2 for membership of G2
+ *
+	@param P ECP2 member of G2
+	@return true or false
+
+ */
+extern int PAIR_G2member(FP512BN::ECP2 *P);
+
+/**	@brief Tests FP12 for membership of cyclotomic sub-group
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTcyclotomic(FP512BN::FP12 *x);
+
+/**	@brief Tests FP12 for membership of GT
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTmember(FP512BN::FP12 *x);
+
+/**	@brief Prepare Ate parameter
+ *
+	@param n BIG parameter
+	@param n3 BIG paramter = 3*n
+	@return number of nits in n3
+
+ */
+extern int PAIR_nbits(B512_60::BIG n3, B512_60::BIG n);
+
+/**	@brief Initialise structure for multi-pairing
+ *
+	@param r FP12 array, to be initialised to 1
+
+ */
+extern void PAIR_initmp(FP512BN::FP12 r[]);
+
+
+/**	@brief Miller loop
+ *
+ 	@param res FP12 result
+	@param r FP12 precomputed array of accumulated line functions
+
+ */
+extern void PAIR_miller(FP512BN::FP12 *res, FP512BN::FP12 r[]);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rand.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rand.cpp
new file mode 100644
index 0000000..a3bda7b
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rand.cpp
@@ -0,0 +1,174 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/*
+ *   Cryptographic strong random number generator
+ *
+ *   Unguessable seed -> SHA -> PRNG internal state -> SHA -> random numbers
+ *   Slow - but secure
+ *
+ *   See ftp://ftp.rsasecurity.com/pub/pdfs/bull-1.pdf for a justification
+ */
+/* SU=m, m is Stack Usage */
+
+#include "core.h"
+
+using namespace core;
+
+/* SU= 20 */
+static unsign32 sbrand(csprng *rng)
+{
+    /* Marsaglia & Zaman random number generator */
+    int i, k;
+    unsign32 pdiff, t;
+    rng->rndptr++;
+    if (rng->rndptr < NK) return rng->ira[rng->rndptr];
+    rng->rndptr = 0;
+    for (i = 0, k = NK - NJ; i < NK; i++, k++)
+    {
+        /* calculate next NK values */
+        if (k == NK) k = 0;
+        t = rng->ira[k];
+        pdiff = t - rng->ira[i] - rng->borrow;
+
+        if (pdiff < t) rng->borrow = 0;
+        if (pdiff > t) rng->borrow = 1;
+        rng->ira[i] = pdiff;
+    }
+    return rng->ira[0];
+}
+
+/* SU= 20 */
+static void sirand(csprng* rng, unsign32 seed)
+{
+    /* initialise random number system */
+    /* modified so that a subsequent call "stirs" in another seed value */
+    /* in this way as many seed bits as desired may be used */
+    int i, in;
+    unsign32 t, m = 1;
+    rng->borrow = 0L;
+    rng->rndptr = 0;
+    rng->ira[0] ^= seed;
+    for (i = 1; i < NK; i++)
+    {
+        /* fill initialisation vector */
+        in = (NV * i) % NK;
+        rng->ira[in] ^= m;    /* note XOR */
+        t = m;
+        m = seed - m;
+        seed = t;
+    }
+    for (i = 0; i < 10000; i++) sbrand(rng ); /* "warm-up" & stir the generator */
+}
+
+/* SU= 312 */
+static void fill_pool(csprng *rng)
+{
+    /* hash down output of RNG to re-fill the pool */
+    int i;
+    hash256 sh;
+    HASH256_init(&sh);
+    for (i = 0; i < 128; i++) HASH256_process(&sh, sbrand(rng));
+    HASH256_hash(&sh, rng->pool);
+    rng->pool_ptr = 0;
+}
+
+static unsign32 pack(const uchar *b)
+{
+    /* pack bytes into a 32-bit Word */
+    return ((unsign32)b[3] << 24) | ((unsign32)b[2] << 16) | ((unsign32)b[1] << 8) | (unsign32)b[0];
+}
+
+/* SU= 360 */
+/* Initialize RNG with some real entropy from some external source */
+void core::RAND_seed(csprng *rng, int rawlen, char *raw)
+{
+    /* initialise from at least 128 byte string of raw  *
+     * random (keyboard?) input, and 32-bit time-of-day */
+    int i;
+    char digest[32];
+    uchar b[4];
+    hash256 sh;
+    rng->pool_ptr = 0;
+    for (i = 0; i < NK; i++) rng->ira[i] = 0;
+    if (rawlen > 0)
+    {
+        HASH256_init(&sh);
+        for (i = 0; i < rawlen; i++)
+            HASH256_process(&sh, raw[i]);
+        HASH256_hash(&sh, digest);
+
+        /* initialise PRNG from distilled randomness */
+
+        for (i = 0; i < 8; i++)
+        {
+            b[0] = digest[4 * i];
+            b[1] = digest[4 * i + 1];
+            b[2] = digest[4 * i + 2];
+            b[3] = digest[4 * i + 3];
+            //  printf("%08x\n",pack(b));
+            sirand(rng, pack(b));
+        }
+    }
+    fill_pool(rng);
+}
+
+/* Terminate and clean up */
+void core::RAND_clean(csprng *rng)
+{
+    /* kill internal state */
+    int i;
+    rng->pool_ptr = rng->rndptr = 0;
+    for (i = 0; i < 32; i++) rng->pool[i] = 0;
+    for (i = 0; i < NK; i++) rng->ira[i] = 0;
+    rng->borrow = 0;
+}
+
+/* get random byte */
+/* SU= 8 */
+int core::RAND_byte(csprng *rng)
+{
+    int r;
+    r = rng->pool[rng->pool_ptr++];
+    if (rng->pool_ptr >= 32) fill_pool(rng);
+    return (r & 0xff);
+}
+
+/* test main program */
+/*
+#include <stdio.h>
+#include <string.h>
+
+void main()
+{
+    int i;
+    char raw[256];
+    csprng rng;
+
+    RAND_clean(&rng);
+
+
+    for (i=0;i<256;i++) raw[i]=(char)i;
+    RAND_seed(&rng,256,raw);
+
+    for (i=0;i<1000;i++)
+        printf("%02x ",(unsigned char)RAND_byte(&rng));
+}
+
+*/
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/randapi.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/randapi.cpp
new file mode 100644
index 0000000..9f2d5c5
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/randapi.cpp
@@ -0,0 +1,36 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#include "randapi.h"
+
+using namespace core;
+
+/* Initialise a Cryptographically Strong Random Number Generator from
+   an octet of raw random data */
+
+void core::CREATE_CSPRNG(csprng *RNG, octet *RAW)
+{
+    RAND_seed(RNG, RAW->len, RAW->val);
+}
+
+void core::KILL_CSPRNG(csprng *RNG)
+{
+    RAND_clean(RNG);
+}
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/randapi.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/randapi.h
new file mode 100644
index 0000000..4038228
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/randapi.h
@@ -0,0 +1,43 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef RANDOM_H
+#define RANDOM_H
+
+#include "core.h"
+
+namespace core {
+
+/** @brief Initialise a random number generator
+ *
+    @param R is a pointer to a cryptographically secure random number generator
+    @param S is an input truly random seed value
+ */
+extern void CREATE_CSPRNG(csprng *R, octet *S);
+/** @brief Kill a random number generator
+ *
+    Deletes all internal state
+    @param R is a pointer to a cryptographically secure random number generator
+ */
+extern void KILL_CSPRNG(csprng *R);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/readme.md b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/readme.md
new file mode 100644
index 0000000..a998d83
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/readme.md
@@ -0,0 +1,124 @@
+# Description
+
+This C++ version is really just C plus namespaces. Namespaces are the 
+only feature of C++ that is used
+
+Separate ROM files provide the constants required for each curve. The
+associated header files (big.h, fp.h and ecp.h) also specify 
+certain constants that must be set for the particular curve.
+
+# Installation and Testing
+
+To build a library and see it in action, copy all of the files in this 
+directory to a fresh directory. Then execute the python3 script config32.py 
+for a 32-bit build, or config64.py for a 64-bit build, and select the curves 
+that you wish to support. Note that support for 16-bit builds is currently 
+somewhat limited - see config16.py. A library is built automatically 
+including all of the modules that you will need.
+
+The configuration files assume the g++ compiler. For clang++ edit the
+config*.py files and substitute "clang++" for "g++".
+Note that clang++ is about 10-15% faster.*
+
+Make sure to use a 64-bit compiler on a 64-bit architecture.
+
+---------------------------------------
+
+To create a 32-bit library
+
+    python3 config32.py
+
+Then select options 1, 3, 7, 28, 30, 37, 38 and 42, which are fixed for the example 
+programs. (For a 16-bit build select 1, 4 and 6). Select 0 then to exit.
+
+Then compile
+
+    g++ -O2  testecc.cpp core.a -o testecc
+
+(if using MINGW-W64 in Windows change -o testecc to -o testecc.exe)
+
+The test program exercises 3 different ordinary elliptic curves (for ECDH 
+Key exchange, ECDSA signature and ECIES encryption), plus RSA, all in the 
+one binary
+
+Next compile
+
+    g++ -O2  testeddsa.cpp core.a -o testeddsa
+
+This test program exercises the EDDSA signature algorithm using the Edwards curves Ed25519 and Ed448
+
+
+Next compile
+
+    g++ -O2  testmpin.cpp core.a -o testmpin
+
+This test program exercises 4 different pairing friendly curves using 
+the MPIN authentication protocol.
+
+The correct PIN is 1234
+
+
+Next compile
+
+    g++ -O2  testbls.cpp core.a -o testbls
+
+This program implements the pairing-based BLS signature
+
+
+Next compile 
+
+    g++ -O2  benchtest_all.cpp core.a -o benchtest_all
+
+This program provides some timings.
+
+Finally
+
+     g++ -O2  testnhs.cpp core.a -o testnhs
+
+-------------------------------------------------
+
+Alternatively building and testing can be combined via
+
+    python3 configXX.py test
+
+where XX can be 16, 32 or 64
+
+Note that this builds the library for ALL of the options. 
+Executables of the above test programs are created, and can be run immediately.
+
+-------------------------------------------------
+
+NEW: support for emerging Hash To Curve standard.
+See https://datatracker.ietf.org/doc/draft-irtf-cfrg-hash-to-curve/
+
+
+Create 32 or 64-bit library selecting curves 1, 2, 3, 7, 17 and 31 (Ed25519, C25519, NIST256, Ed448, SECP256K1 and BLS12381)
+
+    g++ -O2 testhtp.cpp core.a -o testhtp
+
+Test program runs through test vectors from the draft standard.
+
+-------------------------------------------------
+
+NEW: Experimental support for emerging HPKE (Hybrid Public Key Encryption) standard.
+See https://datatracker.ietf.org/doc/draft-irtf-cfrg-hpke/
+
+New hpke.cpp/.h api files
+
+- Supports KEM_IDs for X25519, X448, P256 and P521
+- Supports HDF_IDs for SHA256/512
+- Supports AEAD_IDs for AES-GCM-128/256 only
+
+Create 32 or 64-bit library selecting curves 2 and 10 (X25519 and P521)
+
+    g++ -O2 testhpke.cpp core.a -o testhpke
+
+Test program runs through test vectors for all modes 0-3.
+
+---------------------------------------------------
+
+*Using clang on Windows.
+Download latest clang from http://releases.llvm.org/download.html.
+Choose Clang for Windows (64-bit) (.sig).
+Install a free version of Microsoft Visual C++ https://www.visualstudio.com/downloads/.
+Now use "clang++" wherever "g++" was used before.
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_ANSSI.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_ANSSI.cpp
new file mode 100644
index 0000000..2414943
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_ANSSI.cpp
@@ -0,0 +1,60 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "ecp_ANSSI.h"
+
+
+namespace ANSSI {
+/* ANSSI Curve */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B256_28;
+
+const int CURVE_Cof_I=1;
+const BIG CURVE_Cof= {0x1,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const int CURVE_B_I= 0;
+const BIG CURVE_B= {0xB7BB73F,0x75ED967,0x1A18030,0xC9AE4B,0xFDFEC,0x754A44C,0xD4ABA,0x5428A93,0xE353FCA,0xE};
+const BIG CURVE_Order= {0x6D655E1,0xFDD459C,0x2BF941F,0x67E140D,0x35B53DC,0xE8CE424,0xF10126D,0xB3AD58,0x1FD178C,0xF};
+const BIG CURVE_Gx= {0x98F5CFF,0xC97A2DD,0x8B70164,0xD2DCAF9,0x3958C27,0x4749D42,0xB31183D,0x56C139E,0x6B3D4C3,0xB};
+const BIG CURVE_Gy= {0x4062CFB,0x115A155,0x4C9E183,0xC307E8E,0xF8C2701,0xF0F3ECE,0x11F9271,0xC8B2049,0x142E0F7,0x6};
+const BIG CURVE_HTPC= {0x1A725D0,0xA8983E2,0x77B349E,0x66D2BB4,0x676B54C,0x119A095,0xCAC6DC7,0xFD18A3A,0x2906D4D,0x7};
+#endif
+
+#if CHUNK==64
+
+using namespace B256_56;
+
+const int CURVE_Cof_I=1;
+const BIG CURVE_Cof= {0x1L,0x0L,0x0L,0x0L,0x0L};
+const int CURVE_B_I= 0;
+const BIG CURVE_B= {0x75ED967B7BB73FL,0xC9AE4B1A18030L,0x754A44C00FDFECL,0x5428A9300D4ABAL,0xEE353FCAL};
+const BIG CURVE_Order= {0xFDD459C6D655E1L,0x67E140D2BF941FL,0xE8CE42435B53DCL,0xB3AD58F10126DL,0xF1FD178CL};
+const BIG CURVE_Gx= {0xC97A2DD98F5CFFL,0xD2DCAF98B70164L,0x4749D423958C27L,0x56C139EB31183DL,0xB6B3D4C3L};
+const BIG CURVE_Gy= {0x115A1554062CFBL,0xC307E8E4C9E183L,0xF0F3ECEF8C2701L,0xC8B204911F9271L,0x6142E0F7L};
+const BIG CURVE_HTPC= {0xA8983E21A725D0L,0x66D2BB477B349EL,0x119A095676B54CL,0xFD18A3ACAC6DC7L,0x72906D4DL};
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_BLS12381.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_BLS12381.cpp
new file mode 100644
index 0000000..016b7af
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_BLS12381.cpp
@@ -0,0 +1,113 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "ecp_BLS12381.h"
+
+namespace BLS12381 {
+/* Curve BLS12381 - Pairing friendly BLS curve */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B384_29;
+
+const int CURVE_Cof_I=0;
+const int CURVE_B_I= 4;
+const BIG CURVE_B= {0x4,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Order= {0x1,0x1FFFFFF8,0x1F96FFBF,0x1B4805FF,0x1D80553B,0xC0404D0,0x1520CCE7,0xA6533AF,0x73EDA7,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Gx= {0x1B22C6BB,0x19D78056,0x1E86BBFE,0xBD07FF2,0x1AC586C5,0x1D1F8B8D,0x4168538,0x9F2EE97,0xFC3688C,0x27D4D60,0x9A558E3,0x32FAF28,0x1F1D3A73,0xB};
+const BIG CURVE_Gy= {0x6C5E7E1,0x551194A,0x222B903,0x198E8945,0xB3EDD03,0xC659602,0xBD8036C,0x12BABA01,0x4FCF5E0,0xBA0EC57,0x8278C3B,0x75541E3,0xB3F481E,0x4};
+//const BIG CURVE_HTPC= {0x1AAAE,0xFD80000,0xFFFFED7,0x189FAFDA,0x1C912627,0x14945F,0xBA6AF26,0xEC3ECC4,0x13EFA3BF,0x1422F081,0x33A3655,0x12FFCD33,0x111EA3,0xD};
+const BIG CURVE_HTPC= {0x1DE821B8,0x6288315,0x1715FEDF,0xD2A41DC,0x1C31088B,0xDEEA01F,0x7FC11BB,0x1E9291A1,0x1A12F01D,0xD1EB8DE,0x16CE3D2A,0x16D97EE9,0x1F7462C8,0x0};
+const BIG CURVE_Bnx= {0x10000,0x10080000,0x34,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Cof= {0x10001,0x10080000,0x34,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+//const BIG CURVE_Cof= {0xAAAB,0x55558,0x157855A3,0x191800AA,0x396,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+
+const BIG CURVE_Pxa= {0x121BDB8,0x402B646,0x16EFBF5,0x18064D50,0x1D1770BA,0x5B23D71,0xC0AD144,0x1A9F4807,0x11C6E47A,0x196E2882,0x9820149,0x11E1522,0x4AA2B2F,0x1};
+const BIG CURVE_Pxb= {0x1D042B7E,0xD63E82A,0x51755F9,0x19E22427,0x15049334,0x10DDEE3F,0x186AD769,0x1A132416,0x5596BD0,0x4413A7B,0x1F6B34E8,0x4E33EC0,0x1E02B605,0x9};
+const BIG CURVE_Pya= {0x8B82801,0xC9AA430,0xB28A278,0x15939877,0xD12C923,0xD34A8B0,0xE9DB50A,0x155197BA,0x1AADFD9B,0x16D171A8,0x3327371,0x4FADC23,0xE5D5277,0x6};
+const BIG CURVE_Pyb= {0x105F79BE,0x15483AFF,0x1B07686A,0xE1A4EB9,0x99AB3F3,0x955AB97,0xEBC99D2,0xFD0B4EC,0x19CB3E28,0x15E145C,0xCAB34AC,0x1D4E6998,0x6C4A02,0x3};
+
+#if HTC_ISO_BLS12381 != 0
+
+const BIG CURVE_Ad= {0xD584C1D,0x7A14041,0x183E5FD7,0x6DF1B41,0x81AC989,0xC0D77EC,0x1AA363A2,0xA707DCC,0x2B0EA98,0x164B6A4C,0xF5A4E80,0x771D286,0x144698A,0x0};
+const BIG CURVE_Bd= {0xE172BE0,0xE62474C,0x1B3AA974,0x642B462,0x15EF55A2,0xA7E779,0x1C282E7,0x1E1E49E8,0x1B2016C1,0x3A9F771,0x62C4BA,0x2D10060,0xE2908D1,0x9};
+const BIG PC[53]= {{0xBA2D229,0xE45D174,0x134E47EA,0x1637016C,0x6B68C24,0x1F8DE126,0x1EF08F02,0xFC45906,0x1D31D79D,0x1C0F6F71,0xF47A588,0x1C4C1CE1,0xE08C248,0x3},{0x1605FB7B,0x133EF9F8,0xA177B32,0x16EE3F18,0x14866F69,0x19B001D8,0x1E5B542B,0x1BBCCF0F,0xDFA7DCC,0xE92B2D8,0x1CB63B02,0x139C0FC4,0x321DA07,0x8},{0x1E390C9E,0x1920833D,0xC9DE5F,0x12165DB8,0x11B7FA31,0xA5D7A5D,0x12659D8C,0x1007418B,0x2DD2ECB,0xAE89C79,0xB830DD4,0x179F4F88,0x9B1F8E1,0xB},{0x497E317,0xB8CC354,0xDD3A55B,0x52BE52D,0x1D1DE4FA,0xB649462,0x15D28B16,0xD9CF3EA,0xDC43B75,0xB1DF4C8,0x1EE42CCD,0x134F1F88,0xD3CF1F,0x4},{0x3F0C88E,0x65AB0C7,0x1D1D6BE7,0xF91F191,0x753339B,0x3177879,0x16C69A0B,0x1564EB69,0x13356DE5,0x6888BF2,0x1A1D0E21,0x357B7C5,0x1B81E770,0xB},{0x139ED84,0xEBF912D,0x14BB2B7,0x4A25182,0x6B2A8DA,0x110C7CE4,0x13864023,0x4C9E1F1,0x1FB11586,0x1C573295,0x1A8DC9B0,0x1FC89A52,0x16ED6553,0x6},{0xF652983,0x89E0E33,0x19CF4673,0xE1A5B95,0x8F90A08,0x15C84BF3,0x66E7B4E,0xFBB2A4F,0x15DB3CB1,0x1FBD3A55,0x744806,0x1AE627FE,0x30C3250,0xB},{0xC8895D9,0x8AA674D,0x79DF114,0x1450DE60,0x1AC18985,0x15B2CC17,0xCFC21BB,0xB424AFF,0x1499DB99,0x1F208C72,0x1990AD2C,0x333E886,0x99726A3,0x7},{0x1D9B6861,0xD9C4320,0x41C64F1,0xDC4B9C6,0x13083533,0x1944F8D9,0x1C97C6CC,0xCAD51B7,0x12D7F5E4,0x183F2AA0,0x13818274,0x1F98DB6E,0x178E7166,0xB},{0xC9EDCB0,0xBCFCED,0x25CA7F8,0x187C7A54,0xE25C958,0x1280F634,0xF95A1E3,0xE652B30,0x1BCE0324,0xE8854D0,0x7441231,0x12ECF1D8,0x154005DB,0x6},{0x13CB83BB,0x1A7778D,0x630D5BA,0x11E54DE6,0x1E86B483,0x119E3868,0x105FD597,0xB65ED50,0x1C7C17E7,0x110A3D40,0x1622EAC,0x1287565E,0x1294ED3E,0xB},{0x134649B7,0x1560B313,0x198B5BAB,0x185ABE5,0xE2C8561,0x1DAB66DA,0x17FC989,0x11145AE0,0x56B303E,0xECCC0AC,0xE024407,0x1D066681,0x1A05F2B1,0x8},{0x8ECDD0A,0xB1C268B,0x1E19400B,0xE9C9696,0x11C15931,0x99CBC79,0xDDDB7D,0x1DD2DEFA,0xF682B4,0x159D2B34,0x11DB5B8F,0x13D255A8,0x15FC13AB,0x4},{0x19A1D641,0x1BB761D3,0xE90DC11,0x4CD2557,0x18835038,0x6D33F9C,0x19ADD040,0x3AE2C26,0xCE07F8D,0xD7E3D1E,0x17A482CF,0x1B4A9F04,0x10ECF6A,0x5},{0x1DCC5A5E,0xFBECCDD,0x478B4C4,0xB72913A,0x2C580FA,0x10E6FCC1,0x2A0665B,0x1843794D,0x196E7F63,0x3A6780C,0xC2CFD6C,0x1AC95164,0xA7AC2A9,0xA},{0xEE84A3A,0x12BA24B,0x3781B3B,0x766A71E,0xDE9CEA7,0x3983157,0x62538B8,0x1335EA74,0x1570F57,0x1F02CB39,0x3CF8318,0x2D26C32,0x172CAACF,0x3},{0x1F6304A5,0x16FCD14,0x8A3C470,0x1A49788,0x982F740,0x1E77925C,0x1534290E,0x1D39D395,0x9395735,0x18283637,0x154E43DF,0x9CCCF72,0x7355F8E,0x7},{0x1532A21E,0x1CE9CAD9,0xD5E0754,0x537503E,0x106DA9BD,0x27419D9,0xAEE35AD,0xB34240C,0x1DFFDFC7,0x1A1F3D03,0x29BC757,0x4522950,0x1A8E1620,0x9},{0xDC62CD8,0x186F449C,0x1B3D7104,0xDAA487D,0x16FD0497,0x1455E146,0x15455332,0x7E2D62C,0x145B0824,0x1BE2075A,0x120EABFB,0xB15C5FD,0x1425581A,0x1},{0x1CB83E19,0x611CDD2,0x53FB73F,0x7A12CF9,0xCEACD6A,0x700588D,0x1347F299,0xDEB4E31,0x1F6F8941,0xDFF94C8,0x4DF98A,0xF4644BD,0x12962FE5,0x5},{0x82B3BFF,0xE413B76,0xC09BA79,0x155108D9,0xBF5713D,0x12C4624,0x30049B,0x19419E10,0x167041E8,0x14C729B1,0x122D1C44,0x16AB3886,0x561A5DE,0x9},{0xD21B1C,0x9E7CFD2,0xD0F7E26,0x11AD037C,0xAC62B55,0x430BFE4,0x2EA7256,0x9746B69,0xF01D5EF,0x1A5E9FD3,0x62CB98B,0x19FE335C,0xCA8D548,0x4},{0x9C8B604,0x5A2B5F3,0x10071DC1,0xA04FDFD,0x101B2B66,0xA7D4AD7,0x8E55EB7,0x11F092CB,0x15CB181D,0x1A16F975,0x13A942CE,0x121E079C,0x1E6BE4E9,0xA},{0x1475224B,0x1358F38A,0x1E6BEDE1,0x20936CA,0x7CE46BA,0x7AE9CB5,0x15A366AC,0x103AFD0C,0x1C5E673D,0x1A46251F,0xA8567D,0x1C899E22,0x1C129645,0x2},{0x1B980133,0x16CE9FAE,0x8CA9910,0x1F215A38,0x659CC6C,0x11969E20,0x16004F99,0x101A982,0x1C757B3B,0x13DF18AE,0x1CBF002B,0x1A3D9536,0x45A394A,0x1},{0xB971EF8,0xA602780,0x4847C83,0x10A38323,0x633F06C,0x87403DA,0x23B009C,0x54684D6,0x47AA7B1,0x27A9FA,0x14554258,0x372733,0x1182CAC1,0x5},{0x10074D8E,0x103E4526,0x113581B3,0x139BE836,0x1643249D,0x1F3FC88F,0x918B9AF,0x17155E18,0xC523559,0x1FF6976E,0xE463050,0x1E6DEDBD,0xB46A908,0xC},{0x1011C132,0x9B88D6,0xFEEBF3A,0x1E74B99C,0x1E61031B,0x1F20B1C4,0x4FF4460,0x196D95E9,0x13CD2FCB,0x18EA1FDC,0x37F42E3,0x6F9A37C,0x1713E479,0xC},{0xA731C30,0x1D7D575E,0x13AE9BCA,0x1EE0ABBA,0xD43B9B3,0xF3F68F2,0x1BF81A61,0x14F22B5E,0x3C42A0C,0x1D6D0A51,0x88EAF79,0x30D7B6A,0x1BBA7A1,0x7},{0x1BDBA587,0x1B872BB,0x181E8D8,0xCA4038F,0xCABE69D,0x17350F90,0x9B07A2D,0x2CCF3B8,0x1B8F3ABD,0x10F26D0D,0x1A232788,0x1B2CD097,0x1FC4018B,0x4},{0x1870FB29,0xAF26518,0x17FA4D68,0xC8AA1FD,0x842642F,0x6D36136,0x7FF40E,0x17FC77BB,0x14170A05,0x9653633,0x17A649AF,0x67570DF,0x187C8D53,0x4},{0x1FE9D6F2,0xB0FC42A,0x3D057B2,0x10F5848C,0x14F3747A,0x9E26B1,0x132D48C5,0x19457C30,0x1CE75BB8,0x13BCB59,0xCB25DF4,0x1F583779,0xAB0B9BC,0x2},{0x1633A5F0,0xD91D589,0x16A01CA6,0x1EC64D92,0x1544E203,0xE1E9D6A,0x1EF5D941,0x1A95F5B6,0x74A7D0,0xDC78535,0x8847847,0xC696D4,0x603FCA4,0xB},{0x12E8FEDB,0xDB6D767,0x4102A10,0xFF1B813,0x11ADC2EE,0x1FE9109A,0x2E1E60C,0x1F7C79CA,0x4195536,0x1510A94E,0x172BD3F8,0x1FC1FE26,0xCC03FDE,0x4},{0x10E5F4CB,0x11AAE3BD,0x11877B29,0xB5753D,0x11CF9DE4,0x11F60192,0x4702792,0x1721DD6F,0x17D42AA7,0x16C3A33A,0x1E261D46,0x11303842,0x1F86376E,0x0},{0x72DE1F6,0x6FF1206,0xC0148EE,0x1AA42C51,0xDA7D26,0x1F25C8A0,0x138B0D12,0x1ACB1463,0x142552E2,0x351DA4C,0x1D28E132,0x152CDCCD,0xCC786BA,0x0},{0xE41C696,0x4BF3AD1,0xBEA2FF8,0xACE232C,0x1AD34D6C,0x11A1F5B3,0xF43E41,0xD84A9E7,0x31223E9,0x1BB7DA34,0x15440DB5,0x9DCB023,0x14996A10,0x9},{0x1707BB33,0x14C22B8C,0xEE8F0AF,0x18F5DD36,0x143D3CD0,0x17B64AB2,0x548AD4A,0x11C9150D,0x1A11AD13,0xA4C06E7,0x96747C2,0x17449DC0,0x10D97C81,0x4},{0x1D634B8F,0xAA39D0,0xD25E011,0x5EAE1E2,0xAA205CA,0x1E6B1AB6,0x14CC93B,0xCBC4E77,0x171C40F,0x106BC0CE,0x1AC90957,0xDBB807C,0xFA1D81,0x7},{0x6ED06F7,0xFD6E099,0x5332034,0xA2F7B0E,0x480E420,0x6F93CA1,0x1F072DD2,0x129CE524,0x12BF565B,0xA9E6BB7,0x18A2F743,0x165C9E76,0x660400E,0x1},{0x173345CC,0x14CD89C2,0xE42B047,0xEC7C7,0x19B86930,0x177CD006,0x899F573,0x1B315BE0,0x16543346,0x5A2F8A4,0x10D84C51,0x18ECFFC7,0xD6B9514,0x5},{0x2561092,0x1425A94F,0x1FAEFAA5,0x12D130DE,0x1913516F,0xD446753,0xB4A303E,0x115DF9C8,0x77F94FF,0x12462862,0x1D614B07,0x103A067F,0xCCBB674,0x5},{0x1A8F6AA8,0x7C5A4E5,0xC18100,0xB853E9F,0xA5C871A,0xD9B731B,0x18A43964,0x7376C34,0x1D9C6DD0,0xD69488,0x123C0428,0x1D480B7A,0xD2F259E,0x2},{0x18913F55,0x377A45D,0xA6CD78D,0x10BD47AA,0x1D4FBC73,0xC973F53,0x1EED4C21,0xC7C27B0,0x103216F7,0x1ECA5424,0x1AA08165,0xE14DC39,0x7A55CDA,0xB},{0x15535D4A,0x1919ECEA,0x49220DA,0x1FC5EF77,0x19B4852C,0x1A8625F9,0x482AF15,0x1C98D5EB,0x4F9FB0C,0x1E8EBA66,0x686F953,0x6D8C246,0x66C8ED3,0xC},{0x15812ED9,0x7720AD0,0x77B918,0x1EB6010,0x17132B92,0x7E9031A,0x1F5FFACD,0xBDF43E9,0xEE5A437,0x15DD37FB,0xEF377E,0x1C7D4FD4,0xA3EF08B,0xB},{0x126A775C,0x8D09CC8,0x2C7EE4F,0x1538034B,0x51D5F,0x12DE2005,0x3BD774D,0x1F51A19F,0xB5EECFD,0x5674C12,0x10EEA1CD,0x1533B65F,0x6007C08,0xB},{0xAF9B7AC,0x16323BFD,0xA733880,0x71B73BF,0x15A6449F,0xC3DB787,0x20717B3,0x18CAAA1B,0x2B70152,0x1563C18C,0x7EC99BA,0x30DB65B,0xD9E5297,0x4},{0x11A5001D,0x11C8A118,0x14BB7B76,0x162BB81F,0xC916A20,0xD07E4EF,0xEC150BB,0x13E1ED37,0x1CC6D19C,0x17C1146E,0xC033244,0x8BE87C9,0x1E0E0795,0x5},{0x45F5416,0x6936CC2,0xA5EB6A,0x6C9E585,0xAF41727,0x1244F393,0xC3848F6,0x1B7BB79A,0x11D115C5,0x1C4F6DA6,0x1C8348EF,0x131CA72B,0xB7D2887,0xB},{0x1DBF67F2,0x1129C5A9,0x1E5BE247,0xAF9AC6D,0xD2ECA67,0x12EE93CE,0x1CC430D6,0xAAA35CF,0x1778C485,0xB74758A,0x1BEAAB9F,0xC81B44E,0x18DF3306,0x2},{0xE49A03D,0x17B08161,0x14A78D4C,0x84C0EC6,0x1E01F78A,0x1AB7A29,0x16729284,0x1EE6389A,0x1885C84F,0x21E1A45,0x6832F5B,0x702403C,0x162D75C2,0xC},{0x103663C1,0xA3C929D,0x3081B40,0x6D11DEC,0x12E7A07F,0x1195ADF3,0xF9BBB0C,0x1CAF1301,0x9601A6D,0x7D68757,0x14860450,0x15393164,0x112C4C3,0xB}};
+
+#endif
+
+#if HTC_ISO_G2_BLS12381 != 0
+const BIG CURVE_HTPC2= {0xF8492B,0x13B89D4,0x1AA68D1F,0x108A10FD,0x16D9723B,0x1B0EEA65,0x1CD7D27C,0xDC4EA3A,0x149FAD53,0x10F6735,0x4075923,0x180F008F,0x52988B9,0x0};
+const BIG CURVE_Adr= {0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Adi= {0xF0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Bdr= {0x3F4,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Bdi= {0x3F4,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG PCR[13]= {{0xAAA5ED1,0x7155555,0x19C71C62,0x11C71A1E,0x18575709,0x8478A15,0x2A88B58,0x1CFE9D02,0x14CB14B4,0x8FAFDB0,0x1B5B7A9A,0x147199F5,0x11D6541F,0xB},{0x1FFFC71E,0x154FFFFF,0x3555549,0x5555397,0xA418147,0x635A790,0x11FE6882,0x15BEF5C1,0xF984F87,0x16BC3E44,0xC849BF3,0x17553378,0x1560BF17,0x8},{0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0xAAA97D6,0x11C55555,0x1671C718,0xC71C687,0xE15D5C2,0x211E285,0x10AA22D6,0x73FA740,0x532C52D,0x123EBF6C,0xED6DEA6,0x1D1C667D,0x1C759507,0x2},{0xC,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0x1C718B10,0xD9B8E38,0x1712F678,0x1212F4AD,0x74524E7,0x1BE34D51,0xA1AC3A5,0x6F43C4C,0x10761B0F,0xF1C08D6,0x1EFDC10F,0x16D9EF37,0x4C9AD43,0x9},{0x1FFFC71C,0x154FFFFF,0x3555549,0x5555397,0xA418147,0x635A790,0x11FE6882,0x15BEF5C1,0xF984F87,0x16BC3E44,0xC849BF3,0x17553378,0x1560BF17,0x8},{0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0x11C6D706,0x167E38E3,0x124BDA04,0x184BD7F1,0x1E500FC8,0x1CEC3E93,0x126FD510,0x1A940FEC,0x130F7DA5,0x183B688C,0x16693062,0x15682276,0x130477C7,0xA},{0x12,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0x1FFFA8FB,0xFF7FFFF,0x14FFFFEE,0x17FFFD62,0xF6241EA,0x9507B58,0xAFD9CC3,0x109E70A2,0x1764774B,0x121A5D66,0x12C6E9ED,0x12FFCD34,0x111EA3,0xD}};
+const BIG PCI[13]= {{0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0x1FFFE38D,0x1AA7FFFF,0x11AAAAA4,0x12AAA9CB,0x520C0A3,0x31AD3C8,0x18FF3441,0x1ADF7AE0,0x7CC27C3,0x1B5E1F22,0x6424DF9,0x1BAA99BC,0xAB05F8B,0x4},{0x1FFFC71A,0x154FFFFF,0x3555549,0x5555397,0xA418147,0x635A790,0x11FE6882,0x15BEF5C1,0xF984F87,0x16BC3E44,0xC849BF3,0x17553378,0x1560BF17,0x8},{0xAAA97D6,0x11C55555,0x1671C718,0xC71C687,0xE15D5C2,0x211E285,0x10AA22D6,0x73FA740,0x532C52D,0x123EBF6C,0xED6DEA6,0x1D1C667D,0x1C759507,0x2},{0x1FFFAA9F,0xFF7FFFF,0x14FFFFEE,0x17FFFD62,0xF6241EA,0x9507B58,0xAFD9CC3,0x109E70A2,0x1764774B,0x121A5D66,0x12C6E9ED,0x12FFCD34,0x111EA3,0xD},{0x1FFFAA63,0xFF7FFFF,0x14FFFFEE,0x17FFFD62,0xF6241EA,0x9507B58,0xAFD9CC3,0x109E70A2,0x1764774B,0x121A5D66,0x12C6E9ED,0x12FFCD34,0x111EA3,0xD},{0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0x1FFFE38F,0x1AA7FFFF,0x11AAAAA4,0x12AAA9CB,0x520C0A3,0x31AD3C8,0x18FF3441,0x1ADF7AE0,0x7CC27C3,0x1B5E1F22,0x6424DF9,0x1BAA99BC,0xAB05F8B,0x4},{0xAAA97BE,0x11C55555,0x1671C718,0xC71C687,0xE15D5C2,0x211E285,0x10AA22D6,0x73FA740,0x532C52D,0x123EBF6C,0xED6DEA6,0x1D1C667D,0x1C759507,0x2},{0x11C6D706,0x167E38E3,0x124BDA04,0x184BD7F1,0x1E500FC8,0x1CEC3E93,0x126FD510,0x1A940FEC,0x130F7DA5,0x183B688C,0x16693062,0x15682276,0x130477C7,0xA},{0x1FFFAA99,0xFF7FFFF,0x14FFFFEE,0x17FFFD62,0xF6241EA,0x9507B58,0xAFD9CC3,0x109E70A2,0x1764774B,0x121A5D66,0x12C6E9ED,0x12FFCD34,0x111EA3,0xD},{0x1FFFA9D3,0xFF7FFFF,0x14FFFFEE,0x17FFFD62,0xF6241EA,0x9507B58,0xAFD9CC3,0x109E70A2,0x1764774B,0x121A5D66,0x12C6E9ED,0x12FFCD34,0x111EA3,0xD},{0x1FFFA8FB,0xFF7FFFF,0x14FFFFEE,0x17FFFD62,0xF6241EA,0x9507B58,0xAFD9CC3,0x109E70A2,0x1764774B,0x121A5D66,0x12C6E9ED,0x12FFCD34,0x111EA3,0xD}};
+
+#endif
+
+#endif
+
+#if CHUNK==64
+
+using namespace B384_58;
+
+const int CURVE_Cof_I=0;
+const int CURVE_B_I= 4;
+const BIG CURVE_B= {0x4L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_Order= {0x3FFFFFF00000001L,0x36900BFFF96FFBFL,0x180809A1D80553BL,0x14CA675F520CCE7L,0x73EDA7L,0x0L,0x0L};
+const BIG CURVE_Gx= {0x33AF00ADB22C6BBL,0x17A0FFE5E86BBFEL,0x3A3F171BAC586C5L,0x13E5DD2E4168538L,0x4FA9AC0FC3688CL,0x65F5E509A558E3L,0x17F1D3A73L};
+const BIG CURVE_Gy= {0xAA232946C5E7E1L,0x331D128A222B903L,0x18CB2C04B3EDD03L,0x25757402BD8036CL,0x1741D8AE4FCF5E0L,0xEAA83C68278C3BL,0x8B3F481EL};
+//const BIG CURVE_HTPC= {0x1FB00000001AAAEL,0x313F5FB4FFFFED7L,0x2928BFC912627L,0x1D87D988BA6AF26L,0x2845E1033EFA3BFL,0x25FF9A6633A3655L,0x1A0111EA3L};
+const BIG CURVE_HTPC= {0xC51062BDE821B8L,0x1A5483B9715FEDFL,0x1BDD403FC31088BL,0x3D2523427FC11BBL,0x1A3D71BDA12F01DL,0x2DB2FDD36CE3D2AL,0x1F7462C8L};
+
+const BIG CURVE_Bnx= {0x201000000010000L,0x34L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_Cof= {0x201000000010001L,0x34L,0x0L,0x0L,0x0L,0x0L,0x0L};
+//const BIG CURVE_Cof= {0xAAAB0000AAABL,0x3230015557855A3L,0x396L,0x0L,0x0L,0x0L,0x0L};
+
+const BIG CURVE_Pxa= {0x8056C8C121BDB8L,0x300C9AA016EFBF5L,0xB647AE3D1770BAL,0x353E900EC0AD144L,0x32DC51051C6E47AL,0x23C2A449820149L,0x24AA2B2FL};
+const BIG CURVE_Pxb= {0x1AC7D055D042B7EL,0x33C4484E51755F9L,0x21BBDC7F5049334L,0x3426482D86AD769L,0x88274F65596BD0L,0x9C67D81F6B34E8L,0x13E02B605L};
+const BIG CURVE_Pya= {0x193548608B82801L,0x2B2730EEB28A278L,0x1A695160D12C923L,0x2AA32F74E9DB50AL,0x2DA2E351AADFD9BL,0x9F5B8463327371L,0xCE5D5277L};
+const BIG CURVE_Pyb= {0x2A9075FF05F79BEL,0x1C349D73B07686AL,0x12AB572E99AB3F3L,0x1FA169D8EBC99D2L,0x2BC28B99CB3E28L,0x3A9CD330CAB34ACL,0x606C4A02L};
+
+#if HTC_ISO_BLS12381 != 0
+const BIG CURVE_Ad= {0xF428082D584C1DL,0xDBE368383E5FD7L,0x181AEFD881AC989L,0x14E0FB99AA363A2L,0x2C96D4982B0EA98L,0xEE3A50CF5A4E80L,0x144698AL};
+const BIG CURVE_Bd= {0x1CC48E98E172BE0L,0xC8568C5B3AA974L,0x14FCEF35EF55A2L,0x3C3C93D01C282E7L,0x753EEE3B2016C1L,0x5A200C0062C4BAL,0x12E2908D1L};
+const BIG PC[53]= {{0x1C8BA2E8BA2D229L,0x2C6E02D934E47EAL,0x3F1BC24C6B68C24L,0x1F88B20DEF08F02L,0x381EDEE3D31D79DL,0x389839C2F47A588L,0x6E08C248L},{0x267DF3F1605FB7BL,0x2DDC7E30A177B32L,0x336003B14866F69L,0x37799E1FE5B542BL,0x1D2565B0DFA7DCCL,0x27381F89CB63B02L,0x10321DA07L},{0x3241067BE390C9EL,0x242CBB700C9DE5FL,0x14BAF4BB1B7FA31L,0x200E83172659D8CL,0x15D138F22DD2ECBL,0x2F3E9F10B830DD4L,0x169B1F8E1L},{0x171986A8497E317L,0xA57CA5ADD3A55BL,0x16C928C5D1DE4FAL,0x1B39E7D55D28B16L,0x163BE990DC43B75L,0x269E3F11EE42CCDL,0x80D3CF1FL},{0xCB5618E3F0C88EL,0x1F23E323D1D6BE7L,0x62EF0F2753339BL,0x2AC9D6D36C69A0BL,0xD1117E53356DE5L,0x6AF6F8BA1D0E21L,0x17B81E770L},{0x1D7F225A139ED84L,0x944A30414BB2B7L,0x2218F9C86B2A8DAL,0x993C3E33864023L,0x38AE652BFB11586L,0x3F9134A5A8DC9B0L,0xD6ED6553L},{0x113C1C66F652983L,0x1C34B72B9CF4673L,0x2B9097E68F90A08L,0x1F76549E66E7B4EL,0x3F7A74AB5DB3CB1L,0x35CC4FFC0744806L,0x1630C3250L},{0x1154CE9AC8895D9L,0x28A1BCC079DF114L,0x2B65982FAC18985L,0x168495FECFC21BBL,0x3E4118E5499DB99L,0x667D10D990AD2CL,0xE99726A3L},{0x1B388641D9B6861L,0x1B89738C41C64F1L,0x3289F1B33083533L,0x195AA36FC97C6CCL,0x307E55412D7F5E4L,0x3F31B6DD3818274L,0x1778E7166L},{0x179F9DAC9EDCB0L,0x30F8F4A825CA7F8L,0x2501EC68E25C958L,0x1CCA5660F95A1E3L,0x1D10A9A1BCE0324L,0x25D9E3B07441231L,0xD54005DBL},{0x34EEF1B3CB83BBL,0x23CA9BCC630D5BAL,0x233C70D1E86B483L,0x16CBDAA105FD597L,0x22147A81C7C17E7L,0x250EACBC1622EACL,0x17294ED3EL},{0x2AC1662734649B7L,0x30B57CB98B5BABL,0x3B56CDB4E2C8561L,0x2228B5C017FC989L,0x1D99815856B303EL,0x3A0CCD02E024407L,0x11A05F2B1L},{0x16384D168ECDD0AL,0x1D392D2DE19400BL,0x133978F31C15931L,0x3BA5BDF40DDDB7DL,0x2B3A56680F682B4L,0x27A4AB511DB5B8FL,0x95FC13ABL},{0x376EC3A79A1D641L,0x99A4AAEE90DC11L,0xDA67F398835038L,0x75C584D9ADD040L,0x1AFC7A3CCE07F8DL,0x36953E097A482CFL,0xA10ECF6AL},{0x1F7D99BBDCC5A5EL,0x16E52274478B4C4L,0x21CDF9822C580FAL,0x3086F29A2A0665BL,0x74CF01996E7F63L,0x3592A2C8C2CFD6CL,0x14A7AC2A9L},{0x2574496EE84A3AL,0xECD4E3C3781B3BL,0x73062AEDE9CEA7L,0x266BD4E862538B8L,0x3E0596721570F57L,0x5A4D8643CF8318L,0x772CAACFL},{0x2DF9A29F6304A5L,0x3492F108A3C470L,0x3CEF24B8982F740L,0x3A73A72B534290EL,0x30506C6E9395735L,0x13999EE554E43DFL,0xE7355F8EL},{0x39D395B3532A21EL,0xA6EA07CD5E0754L,0x4E833B306DA9BDL,0x16684818AEE35ADL,0x343E7A07DFFDFC7L,0x8A452A029BC757L,0x13A8E1620L},{0x30DE8938DC62CD8L,0x1B5490FBB3D7104L,0x28ABC28D6FD0497L,0xFC5AC595455332L,0x37C40EB545B0824L,0x162B8BFB20EABFBL,0x3425581AL},{0xC239BA5CB83E19L,0xF4259F253FB73FL,0xE00B11ACEACD6AL,0x1BD69C63347F299L,0x1BFF2991F6F8941L,0x1E8C897A04DF98AL,0xB2962FE5L},{0x1C8276EC82B3BFFL,0x2AA211B2C09BA79L,0x2588C48BF5713DL,0x32833C20030049BL,0x298E536367041E8L,0x2D56710D22D1C44L,0x12561A5DEL},{0x13CF9FA40D21B1CL,0x235A06F8D0F7E26L,0x8617FC8AC62B55L,0x12E8D6D22EA7256L,0x34BD3FA6F01D5EFL,0x33FC66B862CB98BL,0x8CA8D548L},{0xB456BE69C8B604L,0x1409FBFB0071DC1L,0x14FA95AF01B2B66L,0x23E125968E55EB7L,0x342DF2EB5CB181DL,0x243C0F393A942CEL,0x15E6BE4E9L},{0x26B1E715475224BL,0x4126D95E6BEDE1L,0xF5D396A7CE46BAL,0x2075FA195A366ACL,0x348C4A3FC5E673DL,0x39133C440A8567DL,0x5C129645L},{0x2D9D3F5DB980133L,0x3E42B4708CA9910L,0x232D3C40659CC6CL,0x20353056004F99L,0x27BE315DC757B3BL,0x347B2A6DCBF002BL,0x245A394AL},{0x14C04F00B971EF8L,0x214706464847C83L,0x10E807B4633F06CL,0xA8D09AC23B009CL,0x4F53F447AA7B1L,0x6E4E674554258L,0xB182CAC1L},{0x207C8A4D0074D8EL,0x2737D06D13581B3L,0x3E7F911F643249DL,0x2E2ABC30918B9AFL,0x3FED2EDCC523559L,0x3CDBDB7AE463050L,0x18B46A908L},{0x13711AD011C132L,0x3CE97338FEEBF3AL,0x3E416389E61031BL,0x32DB2BD24FF4460L,0x31D43FB93CD2FCBL,0xDF346F837F42E3L,0x19713E479L},{0x3AFAAEBCA731C30L,0x3DC157753AE9BCAL,0x1E7ED1E4D43B9B3L,0x29E456BDBF81A61L,0x3ADA14A23C42A0CL,0x61AF6D488EAF79L,0xE1BBA7A1L},{0x370E577BDBA587L,0x1948071E181E8D8L,0x2E6A1F20CABE69DL,0x599E7709B07A2DL,0x21E4DA1BB8F3ABDL,0x3659A12FA232788L,0x9FC4018BL},{0x15E4CA31870FB29L,0x191543FB7FA4D68L,0xDA6C26C842642FL,0x2FF8EF7607FF40EL,0x12CA6C674170A05L,0xCEAE1BF7A649AFL,0x987C8D53L},{0x161F8855FE9D6F2L,0x21EB09183D057B2L,0x13C4D634F3747AL,0x328AF86132D48C5L,0x27796B3CE75BB8L,0x3EB06EF2CB25DF4L,0x4AB0B9BCL},{0x1B23AB13633A5F0L,0x3D8C9B256A01CA6L,0x1C3D3AD5544E203L,0x352BEB6DEF5D941L,0x1B8F0A6A074A7D0L,0x18D2DA88847847L,0x16603FCA4L},{0x1B6DAECF2E8FEDBL,0x1FE370264102A10L,0x3FD221351ADC2EEL,0x3EF8F3942E1E60CL,0x2A21529C4195536L,0x3F83FC4D72BD3F8L,0x8CC03FDEL},{0x2355C77B0E5F4CBL,0x16AEA7B1877B29L,0x23EC03251CF9DE4L,0x2E43BADE4702792L,0x2D8746757D42AA7L,0x22607085E261D46L,0x1F86376EL},{0xDFE240C72DE1F6L,0x354858A2C0148EEL,0x3E4B91400DA7D26L,0x359628C738B0D12L,0x6A3B49942552E2L,0x2A59B99BD28E132L,0xCC786BAL},{0x97E75A2E41C696L,0x159C4658BEA2FF8L,0x2343EB67AD34D6CL,0x1B0953CE0F43E41L,0x376FB46831223E9L,0x13B960475440DB5L,0x134996A10L},{0x29845719707BB33L,0x31EBBA6CEE8F0AFL,0x2F6C956543D3CD0L,0x23922A1A548AD4AL,0x14980DCFA11AD13L,0x2E893B8096747C2L,0x90D97C81L},{0x15473A1D634B8FL,0xBD5C3C4D25E011L,0x3CD6356CAA205CAL,0x19789CEE14CC93BL,0x20D7819C171C40FL,0x1B7700F9AC90957L,0xE0FA1D81L},{0x1FADC1326ED06F7L,0x145EF61C5332034L,0xDF27942480E420L,0x2539CA49F072DD2L,0x153CD76F2BF565BL,0x2CB93CED8A2F743L,0x2660400EL},{0x299B138573345CCL,0x1D8F8EE42B047L,0x2EF9A00D9B86930L,0x3662B7C0899F573L,0xB45F1496543346L,0x31D9FF8F0D84C51L,0xAD6B9514L},{0x284B529E2561092L,0x25A261BDFAEFAA5L,0x1A88CEA7913516FL,0x22BBF390B4A303EL,0x248C50C477F94FFL,0x20740CFFD614B07L,0xACCBB674L},{0xF8B49CBA8F6AA8L,0x170A7D3E0C18100L,0x1B36E636A5C871AL,0xE6ED8698A43964L,0x1AD2911D9C6DD0L,0x3A9016F523C0428L,0x4D2F259EL},{0x6EF48BB8913F55L,0x217A8F54A6CD78DL,0x192E7EA7D4FBC73L,0x18F84F61EED4C21L,0x3D94A84903216F7L,0x1C29B873AA08165L,0x167A55CDAL},{0x3233D9D55535D4AL,0x3F8BDEEE49220DAL,0x350C4BF39B4852CL,0x3931ABD6482AF15L,0x3D1D74CC4F9FB0CL,0xDB1848C686F953L,0x1866C8ED3L},{0xEE415A15812ED9L,0x3D6C020077B918L,0xFD206357132B92L,0x17BE87D3F5FFACDL,0x2BBA6FF6EE5A437L,0x38FA9FA80EF377EL,0x16A3EF08BL},{0x11A1399126A775CL,0x2A7006962C7EE4FL,0x25BC400A0051D5FL,0x3EA3433E3BD774DL,0xACE9824B5EECFDL,0x2A676CBF0EEA1CDL,0x166007C08L},{0x2C6477FAAF9B7ACL,0xE36E77EA733880L,0x187B6F0F5A6449FL,0x3195543620717B3L,0x2AC783182B70152L,0x61B6CB67EC99BAL,0x8D9E5297L},{0x239142311A5001DL,0x2C57703F4BB7B76L,0x1A0FC9DEC916A20L,0x27C3DA6EEC150BBL,0x2F8228DDCC6D19CL,0x117D0F92C033244L,0xBE0E0795L},{0xD26D98445F5416L,0xD93CB0A0A5EB6AL,0x2489E726AF41727L,0x36F76F34C3848F6L,0x389EDB4D1D115C5L,0x26394E57C8348EFL,0x16B7D2887L},{0x22538B53DBF67F2L,0x15F358DBE5BE247L,0x25DD279CD2ECA67L,0x15546B9FCC430D6L,0x16E8EB15778C485L,0x1903689DBEAAB9FL,0x58DF3306L},{0x2F6102C2E49A03DL,0x10981D8D4A78D4CL,0x356F453E01F78AL,0x3DCC71356729284L,0x43C348B885C84FL,0xE0480786832F5BL,0x1962D75C2L},{0x1479253B03663C1L,0xDA23BD83081B40L,0x232B5BE72E7A07FL,0x395E2602F9BBB0CL,0xFAD0EAE9601A6DL,0x2A7262C94860450L,0x16112C4C3L}};
+#endif
+
+#if HTC_ISO_G2_BLS12381 != 0
+const BIG CURVE_HTPC2= {0x27713A80F8492BL,0x211421FBAA68D1FL,0x361DD4CB6D9723BL,0x1B89D475CD7D27CL,0x21ECE6B49FAD53L,0x301E011E4075923L,0x52988B9L};
+const BIG CURVE_Adr= {0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_Adi= {0xF0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_Bdr= {0x3F4L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_Bdi= {0x3F4L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const BIG PCR[13]= {{0xE2AAAAAAAA5ED1L,0x238E343D9C71C62L,0x108F142B8575709L,0x39FD3A042A88B58L,0x11F5FB614CB14B4L,0x28E333EBB5B7A9AL,0x171D6541FL},{0x2A9FFFFFFFFC71EL,0xAAAA72E3555549L,0xC6B4F20A418147L,0x2B7DEB831FE6882L,0x2D787C88F984F87L,0x2EAA66F0C849BF3L,0x11560BF17L},{0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L},{0x238AAAAAAAA97D6L,0x18E38D0F671C718L,0x423C50AE15D5C2L,0xE7F4E810AA22D6L,0x247D7ED8532C52DL,0x3A38CCFAED6DEA6L,0x5C759507L},{0xCL,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L},{0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L},{0x1B371C71C718B10L,0x2425E95B712F678L,0x37C69AA274524E7L,0xDE87898A1AC3A5L,0x1E3811AD0761B0FL,0x2DB3DE6FEFDC10FL,0x124C9AD43L},{0x2A9FFFFFFFFC71CL,0xAAAA72E3555549L,0xC6B4F20A418147L,0x2B7DEB831FE6882L,0x2D787C88F984F87L,0x2EAA66F0C849BF3L,0x11560BF17L},{0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L},{0x2CFC71C71C6D706L,0x3097AFE324BDA04L,0x39D87D27E500FC8L,0x35281FD926FD510L,0x3076D11930F7DA5L,0x2AD044ED6693062L,0x1530477C7L},{0x12L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L},{0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L},{0x1FEFFFFFFFFA8FBL,0x2FFFFAC54FFFFEEL,0x12A0F6B0F6241EAL,0x213CE144AFD9CC3L,0x2434BACD764774BL,0x25FF9A692C6E9EDL,0x1A0111EA3L}};
+const BIG PCI[13]= {{0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L},{0x354FFFFFFFFE38DL,0x255553971AAAAA4L,0x635A790520C0A3L,0x35BEF5C18FF3441L,0x36BC3E447CC27C3L,0x375533786424DF9L,0x8AB05F8BL},{0x2A9FFFFFFFFC71AL,0xAAAA72E3555549L,0xC6B4F20A418147L,0x2B7DEB831FE6882L,0x2D787C88F984F87L,0x2EAA66F0C849BF3L,0x11560BF17L},{0x238AAAAAAAA97D6L,0x18E38D0F671C718L,0x423C50AE15D5C2L,0xE7F4E810AA22D6L,0x247D7ED8532C52DL,0x3A38CCFAED6DEA6L,0x5C759507L},{0x1FEFFFFFFFFAA9FL,0x2FFFFAC54FFFFEEL,0x12A0F6B0F6241EAL,0x213CE144AFD9CC3L,0x2434BACD764774BL,0x25FF9A692C6E9EDL,0x1A0111EA3L},{0x1FEFFFFFFFFAA63L,0x2FFFFAC54FFFFEEL,0x12A0F6B0F6241EAL,0x213CE144AFD9CC3L,0x2434BACD764774BL,0x25FF9A692C6E9EDL,0x1A0111EA3L},{0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L},{0x354FFFFFFFFE38FL,0x255553971AAAAA4L,0x635A790520C0A3L,0x35BEF5C18FF3441L,0x36BC3E447CC27C3L,0x375533786424DF9L,0x8AB05F8BL},{0x238AAAAAAAA97BEL,0x18E38D0F671C718L,0x423C50AE15D5C2L,0xE7F4E810AA22D6L,0x247D7ED8532C52DL,0x3A38CCFAED6DEA6L,0x5C759507L},{0x2CFC71C71C6D706L,0x3097AFE324BDA04L,0x39D87D27E500FC8L,0x35281FD926FD510L,0x3076D11930F7DA5L,0x2AD044ED6693062L,0x1530477C7L},{0x1FEFFFFFFFFAA99L,0x2FFFFAC54FFFFEEL,0x12A0F6B0F6241EAL,0x213CE144AFD9CC3L,0x2434BACD764774BL,0x25FF9A692C6E9EDL,0x1A0111EA3L},{0x1FEFFFFFFFFA9D3L,0x2FFFFAC54FFFFEEL,0x12A0F6B0F6241EAL,0x213CE144AFD9CC3L,0x2434BACD764774BL,0x25FF9A692C6E9EDL,0x1A0111EA3L},{0x1FEFFFFFFFFA8FBL,0x2FFFFAC54FFFFEEL,0x12A0F6B0F6241EAL,0x213CE144AFD9CC3L,0x2434BACD764774BL,0x25FF9A692C6E9EDL,0x1A0111EA3L}};
+#endif
+
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_BLS12383.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_BLS12383.cpp
new file mode 100644
index 0000000..dcc4a28
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_BLS12383.cpp
@@ -0,0 +1,79 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "ecp_BLS12383.h"
+
+namespace BLS12383 {
+/* Curve BLS12383 - Pairing friendly BLS curve */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B384_29;
+
+// Base Bits= 29
+
+const int CURVE_Cof_I= 0;
+const BIG CURVE_Cof= {0x10011FF,0x400000,0x40,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+//const BIG CURVE_Cof= {0x15169EAB,0xA82AB0A,0xAAEFFED,0x15558001,0x555,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const int CURVE_B_I= 15;
+const BIG CURVE_B= {0xF,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Order= {0x1EBC0001,0x1904CF5F,0x834E5CE,0xBE12B42,0xB381DE0,0xE40B4C,0x270110,0x10018017,0x1002001,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Gx= {0x8734573,0x623B9C8,0x1D1DC11E,0xBB7E107,0x1E3445C5,0x1D6C2578,0x10B0BE1E,0xED6103E,0x10F31D9F,0x296ED82,0x18E0D7D0,0x12F3D9C9,0x1FCBA55B,0x20};
+const BIG CURVE_Gy= {0x3F224,0x968B2F4,0x1FE63F48,0xFA93D90,0x14D2DDE5,0x54A56F5,0x12441D4C,0x18CD76C8,0x199D0DAD,0xE18E236,0x92BA73,0x99F6600,0x8F16727,0x3};
+const BIG CURVE_HTPC= {0x1,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+
+const BIG CURVE_Bnx= {0x1001200,0x400000,0x40,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+
+const BIG CURVE_Pxa= {0xD7F2D86,0x1E59DB1,0x17474F85,0x1FB56CF2,0x572EE81,0xE487AB1,0x96F51FC,0x190A5AAE,0x6432501,0x13E58F3A,0x101E6425,0xFD807D1,0x34D2240,0x3};
+const BIG CURVE_Pxb= {0x452DE15,0x1ECF20F6,0x1FF9837B,0x95651AA,0xD5D75B5,0x5D44749,0x12277F66,0x1DB3A0B9,0x1D24F498,0x19441B0E,0x1CDE9DC5,0x2C975,0xD78006,0x18};
+const BIG CURVE_Pya= {0x1408CB41,0x34785DC,0x3586597,0x13DBC9E4,0x1A2E75B4,0x1D65489,0xCF9A25E,0x1ACE7933,0x1B6E990E,0x19FF31A3,0x12527615,0x1A44A68F,0x1792CF93,0x19};
+const BIG CURVE_Pyb= {0x1F479093,0x16C2321B,0x1889218E,0x87961BC,0x1BC98B01,0x197A24FB,0xA3DEBC2,0x88D67DF,0x1CE0D,0x1E8AD3D7,0x93B9EE9,0x59B18D6,0xE5247DD,0x10};
+#endif
+
+#if CHUNK==64
+
+using namespace B384_58;
+
+// Base Bits= 58
+
+const int CURVE_Cof_I= 0;
+const BIG CURVE_Cof= {0x80000010011FFL,0x40L,0x0L,0x0L,0x0L,0x0L,0x0L};
+//const BIG CURVE_Cof= {0x150556155169EABL,0x2AAB0002AAEFFEDL,0x555L,0x0L,0x0L,0x0L,0x0L};
+const int CURVE_B_I= 15;
+const BIG CURVE_B= {0xFL,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_Order= {0x32099EBFEBC0001L,0x17C25684834E5CEL,0x1C81698B381DE0L,0x2003002E0270110L,0x1002001L,0x0L,0x0L};
+const BIG CURVE_Gx= {0xC4773908734573L,0x176FC20FD1DC11EL,0x3AD84AF1E3445C5L,0x1DAC207D0B0BE1EL,0x52DDB050F31D9FL,0x25E7B3938E0D7D0L,0x41FCBA55BL};
+const BIG CURVE_Gy= {0x12D165E8003F224L,0x1F527B21FE63F48L,0xA94ADEB4D2DDE5L,0x319AED912441D4CL,0x1C31C46D99D0DADL,0x133ECC00092BA73L,0x68F16727L};
+const BIG CURVE_HTPC= {0x1L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_Bnx= {0x8000001001200L,0x40L,0x0L,0x0L,0x0L,0x0L,0x0L};
+
+const BIG CURVE_Pxa= {0x3CB3B62D7F2D86L,0x3F6AD9E57474F85L,0x1C90F562572EE81L,0x3214B55C96F51FCL,0x27CB1E746432501L,0x1FB00FA301E6425L,0x634D2240L};
+const BIG CURVE_Pxb= {0x3D9E41EC452DE15L,0x12ACA355FF9837BL,0xBA88E92D5D75B5L,0x3B6741732277F66L,0x3288361DD24F498L,0x592EBCDE9DC5L,0x300D78006L};
+const BIG CURVE_Pya= {0x68F0BB9408CB41L,0x27B793C83586597L,0x3ACA913A2E75B4L,0x359CF266CF9A25EL,0x33FE6347B6E990EL,0x34894D1F2527615L,0x33792CF93L};
+const BIG CURVE_Pyb= {0x2D846437F479093L,0x10F2C379889218EL,0x32F449F7BC98B01L,0x111ACFBEA3DEBC2L,0x3D15A7AE001CE0DL,0xB3631AC93B9EE9L,0x20E5247DDL};
+
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_BLS12443.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_BLS12443.cpp
new file mode 100644
index 0000000..3ad1d29
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_BLS12443.cpp
@@ -0,0 +1,97 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "ecp_BLS12443.h"
+
+namespace BLS12443 {
+/* Curve BLS12443 - Pairing friendly BLS curve */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B448_29;
+
+// Base Bits= 29
+
+const int CURVE_Cof_I= 0;
+const BIG CURVE_Cof= {0x11FFFFFF,0x1F800000,0x100FF,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const int CURVE_B_I= 4;
+const BIG CURVE_B= {0x4,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Order= {0x1,0x15E00000,0x8FFFFF,0x330FEE0,0x5A3E808,0x1A0482EE,0x174DC4C0,0x6E9E59B,0x1062F694,0x2F9E86,0x41,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Gx= {0x18ABC574,0x13652D93,0xF8A9B4B,0x18DD91D9,0x40BFDDF,0xDEBE0C3,0x1CA5E24A,0x29B37A3,0x9049E88,0x11415BE7,0x1C4F9EAE,0x2569C1B,0x1681E434,0x8BDF6ED,0x19B12D89,0x73};
+const BIG CURVE_Gy= {0x17A9CE3F,0xCA0ABAC,0x710C772,0x120BAD6D,0x900742F,0x3B52AB4,0x1D0A758D,0x13CBE7A7,0x15769DB0,0xC676B97,0x7EF77EB,0x30FC21B,0x43B2B19,0x21C2EEA,0x1887E1D4,0x24};
+const BIG CURVE_HTPC= {0x911B6DF,0xA620224,0x155D68,0xBAE768,0x43A6AA,0xCE9FFD0,0x14EAAC40,0x19772A08,0x10074A9D,0xC451CC1,0xE84AE3C,0xDED8262,0x9680088,0x1A07DE19,0x19648C8F,0x9E};
+
+const BIG CURVE_Bnx= {0x12000000,0x1F800000,0x100FF,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Pxa= {0x1F3AF148,0x12812AAB,0x11B9D6E1,0x1E9B7A3E,0x4DD695A,0x19843AAA,0x15D8C5C5,0xF509C60,0x139FC8E3,0x1060B671,0x11CFC89D,0x1F708C93,0x2219258,0x167260A8,0x117B1177,0x5};
+const BIG CURVE_Pxb= {0x136279B6,0x27B735D,0xB60056F,0x61C6492,0x19E29515,0x18B4393A,0x9480BCF,0x9596877,0x9BD13DD,0x370B284,0x1FEBABF8,0x12D6CB9C,0x164C9DA2,0x9DA997,0x192E45BB,0x1E};
+const BIG CURVE_Pya= {0x11C0B975,0x1FE07513,0x1C67EDF6,0xE36130E,0x1A91EFB9,0x1AC39A4,0x1316E89E,0x4DC3C2C,0x1122B65B,0x173710A4,0x10067CD2,0x1C58269E,0x1BD2F919,0x16A8822B,0x1A81C011,0x8B};
+const BIG CURVE_Pyb= {0x82464AD,0x1F70FF80,0x3C33C6C,0x10AAF915,0x77B77F,0x3152868,0x1BBD7AD8,0xDADC2F9,0x17218280,0xAECA451,0x103E4E3E,0x1BD9B92,0xB9E9169,0x1F547AC3,0x577AC6,0x68};
+
+const BIG CURVE_Ad= {0x98E3466,0x15BE78D9,0x12B6D628,0xD93FCB0,0x1D091D0,0x130C6222,0x14B30AEB,0x13910DCD,0xCA78F64,0xD0F66FC,0xEEC9DEF,0x7F9B01B,0x1760C9FC,0x78FCB94,0x1A839D35,0x33};
+const BIG CURVE_Bd= {0x10F780D9,0xE65C309,0x1D294680,0x1AB4F80F,0x101A1BB2,0xD28DB7E,0x9192026,0x1C25665C,0x14D2890A,0xE458245,0x14A22C11,0x963FDB1,0x8F5BAD7,0x19106B58,0x146889DA,0x53};
+const BIG PC[53]= {{0x3F34E48,0x651745D,0xE259428,0x1383ECF5,0x7BA3300,0x27D38ED,0x1D7FF700,0x9431A4,0x1689CD1,0x545B0E1,0x187C27A6,0x1969C0B2,0xA0C6C03,0x1BF55844,0xA442AE5,0x1E},{0x604D319,0x6D5B3BB,0x1FC7CA7A,0x1C6674A9,0x4CBF065,0x35A66CF,0x159ADD2C,0x1B552927,0x19CC61F8,0x9D5A2C5,0xC0A549B,0x1F40B1BF,0x10CB5BAC,0xFCEF9F5,0x1F238FE7,0x7B},{0x1EA1F60A,0x1A99A439,0x1F84EA1B,0xA936DD8,0x4E25589,0xEA2C846,0x1DE6DCE9,0x1AE6724D,0x191243E0,0x10C3978C,0x134B2B37,0x1BDC07A,0x8D2C8E0,0x7A49BE0,0x14F4B45A,0xA7},{0x17499741,0x260A801,0x7616D51,0x17AEAADD,0x521E193,0x5A429A4,0x1BD4909C,0x19D689BE,0x138A814D,0x101764AE,0xE5495FD,0xD6862F8,0x6EABD3B,0x139CBE79,0x102FAAE0,0x1E},{0x8A9B7DD,0xBC06177,0xE848FDB,0x17FA150F,0x56E9B75,0x1820A4D3,0x5A69ED,0x7B1B04A,0x1B5A80FB,0x17F1C270,0x8B8B6E,0x1CDB6D31,0xD4D2E33,0x1EAB98E9,0x18FD46B7,0x4F},{0x41C4477,0x170C7C9E,0x1A7CEED7,0x104562CB,0x151713B8,0xDE756B,0x100E4CFE,0x1FAAEA0A,0x16BAE1F3,0x1D349BB5,0xC6D2950,0x18311C0F,0x39A42E2,0x182C5CBC,0x4853E91,0x25},{0x10815090,0x2323376,0x20A1BDB,0x5508EE7,0x5B59C38,0xA0AFD37,0x165A6095,0x19B7465E,0x6474F,0x15D05C5C,0x1F4B70EF,0xFDBD849,0x6F8D806,0x1AEA48A0,0xC688DC,0x4E},{0x1500BAD1,0x11B8B8DE,0x169485E4,0x9CBB577,0x18400475,0x1CF76B6C,0xF9C2EC0,0xC5678B7,0x60B689F,0x14149AEA,0x1904CD6D,0x19952882,0x169C5E37,0xDBAA643,0x1C756EAA,0x9E},{0x1E8081C0,0x4410E14,0xAC7DCFD,0x1621F086,0x135547E8,0x199A0DEF,0xB5938FC,0x1B1450DE,0x5AFD544,0x79F9A9F,0x199ED81F,0x17543471,0x126B077C,0x1CE6BCD,0x1DF891D0,0x2B},{0x17226171,0x1C950142,0x16E104BB,0xE1B0949,0x92190E6,0x3F99D6,0x354C7D3,0xF8472E3,0x118257FE,0x1F5B17E4,0x16FD305B,0x1EBF4465,0x63A6551,0x115C8EEB,0xEE9A889,0xA2},{0x7A91954,0x9CA1080,0x12A3E384,0x112E1137,0x18E69E7C,0x1CB385BF,0x10F0213C,0x1AB981F5,0xD5D73EC,0x1172365C,0x1E0EB929,0xB0CA35E,0xE794D69,0x6BF5788,0x73D5885,0x94},{0x192801A5,0x81AFAC5,0x15B7E81,0x1BA422EB,0x39F6E89,0x2A238D6,0x1A3E1907,0x9488AB6,0x7933000,0x1F9A227A,0x1ABA3F3A,0x12DD9604,0x1BB10A18,0xC5456C7,0xD84DE,0x8},{0xF9D1C0A,0x92C9E14,0xD40ECC4,0x1CA779A4,0x14378709,0x7F8AF5E,0x1400B55D,0x9A45554,0x2C03381,0x6B22956,0x1606538F,0x14ED05D5,0x77F1CED,0xCA45FB0,0x1858F2A3,0x96},{0x1F0A734C,0x14ABBA56,0x62122B9,0x149E1F5E,0x11502173,0x194DC7FF,0xCB2DB28,0x1497703A,0x1BF898CF,0x1A9F7152,0x133A7119,0x1EE3FFE6,0x1D9A176F,0xEB09FF5,0x18EC7E61,0x95},{0x11F37A8D,0x137B967F,0x7ED1992,0x112A56C,0xB74C59C,0xF981054,0x1B16179D,0x6FDEA23,0x7CFCEF8,0x170947AC,0x165FEEB3,0x17304126,0x4045C68,0x1EAC0CF1,0x16C0476,0x26},{0x1124740B,0x56CC8D1,0x11A7A71A,0x374C848,0x8B0336B,0x828068D,0x17B3591B,0x12F676CC,0xC2A2446,0x8945941,0x79445E2,0x1FD486BC,0x1D89A7C5,0xCC0BCD2,0x150AFD2,0x6E},{0xD27D311,0x175A4D55,0x68B0D25,0x89656E1,0x18EEF0CC,0x1ECB7F5C,0x141F2E5,0x1FC71B9D,0xB3FF9ED,0x1816DAFB,0x124875C,0x8ECB03B,0x152F5A8E,0xE62A638,0x944C294,0x8F},{0x1F1FC577,0x171D678,0xAE5DEF,0x1033B90B,0x82CAB80,0x558A914,0x1CF59E4B,0x12019535,0x171CE7C8,0xACC9CB1,0x16CD1D1E,0x1C4BE058,0x1BE1ACDC,0xC595284,0x1342A963,0x5F},{0x9150A48,0x12B944D7,0x1D088301,0x118D6111,0xD0F4583,0x1A41F59C,0x5E0D400,0x12013D5F,0x1235B458,0x1DC12203,0xC5391FA,0x14E54599,0xDCCF56C,0x17E1395E,0x770FA99,0x87},{0x1357D628,0x1311EF7C,0x178C48D1,0x1AF751CF,0xDB9E8BF,0xE02049C,0x14F36DA6,0x1FC80D93,0x11A703B0,0x7B2DF3A,0x11F7AF4E,0x6E20944,0x169657CA,0x12D90851,0xCB4DFB2,0x72},{0x117D6EEC,0x111FF17D,0xDCAAB9E,0xF57E6E9,0x877F70,0x1615F8C3,0x15089BD8,0x8C6A10B,0x768CC8C,0xD87AB83,0x1AC4BCA5,0x192138F5,0xEC4C227,0xBB626C5,0x1EAD484,0x59},{0x180B7137,0x17C45952,0xF72FD01,0x14038FD8,0x1BC6906,0x1D30FF2A,0x272EF9D,0x3DDAEBC,0xEF123C2,0x36325B3,0xE4BD355,0x1CA82937,0x11E3AE9B,0x1F3E2015,0x10AA89CD,0x4A},{0x5BEFD8,0x1AC19637,0xCEC24BD,0x1BF4B873,0x39C9045,0x60B6244,0x113A2DBA,0x5DEED3D,0x5F23CCD,0x7AB2FD,0x1C6860B2,0x24F6E9B,0x1B1866E9,0x1CB93691,0x1834BE14,0x2},{0xACA5AD9,0xCDA044,0x1F06B705,0x60D70E0,0x16099A07,0x6B0FFD7,0xA3D226B,0x3BDE7A2,0x76F4EC5,0x1B842F45,0x3EC2206,0x1673113C,0x7E552D3,0x18F5183E,0x1CF7F587,0x97},{0x12C72185,0x141B8D52,0x14B678E2,0x1D6934AB,0x17932E98,0x16339B40,0x1590A131,0x17E6E0AE,0x1943949D,0x1D0E5D2D,0xD2A9510,0x15EB21C4,0x1D89CD87,0xFE5601A,0x11A001F4,0x5F},{0xEFEE0EA,0x1F50A4DD,0x111B4E23,0x19E8C81C,0x5EDC2C3,0x126703FF,0x13C16387,0x12147E91,0xD63425F,0xCF00CF7,0x47A627C,0x5E7D6B1,0xEE08F4E,0x1766140F,0xBB95F5F,0x96},{0x16887410,0x1FA80776,0x93C0854,0x1EA20D2,0x1CBCC511,0x179B0F85,0x5396256,0x8D385B5,0x19CDF1BA,0x18ECD9E9,0xF80B760,0x1072505E,0x5BD4CB5,0x22FBE14,0x1EA80B78,0x7B},{0xDD0AA9,0x1F70909A,0xD5597D7,0x101CE2A8,0x617757C,0xDEEDA0C,0x11EA1972,0x114E055,0xF76A90,0x1A95E01E,0x15379DEC,0x175A609C,0x14C8FDB9,0x115156DE,0xCBF4809,0x96},{0x1E428BFD,0x16F21A08,0x3ADF604,0x82249C5,0x1CB7A3FA,0x1E570ACB,0x1EB4B47B,0xECB355A,0x84B430D,0x1BBAA20E,0x1C8EF513,0x115C7B9F,0x1D5EB53A,0x122DD3FB,0x17BB0101,0x50},{0x12540F1F,0x13939806,0x18268D14,0x1FBD962B,0xB448310,0xEF54811,0x23A248,0x162322C2,0x3AF19BB,0x13AB6F20,0x179673B2,0x1B141CDA,0x40D00EE,0x1B1F7AD8,0x9046568,0xA4},{0x1545BF96,0x11613F77,0x1925835E,0x14B70DE1,0x14CA0A0A,0x17FB7979,0x43DDB1A,0xA1AFFB6,0x5E74A2D,0x1DA600F1,0x4D0C711,0x9107354,0x2A96CA7,0x7460C2C,0x4772C30,0x9C},{0xC96D5DE,0x11B3C719,0x12C44E72,0x62A8455,0xB3522DF,0x1722392D,0x17C4C84A,0xC5B08EF,0x1C73E4E8,0x184F76C5,0x1BE85639,0x4178224,0x5F1ADAC,0x1004293E,0x14020923,0x6C},{0x1A433825,0xF576BC3,0x159F38EF,0x1A9CD3BC,0x5854D83,0x1C7BD842,0x113DF3CB,0x195CCF87,0xF553CAE,0x4937DAE,0x12924884,0x15F7F1B0,0x18EBD637,0x1A325E15,0x1CE00B35,0x33},{0xF92004C,0x960B5AD,0x16377D4C,0x6B9BC92,0x1B008FFB,0x1235B5EB,0x1CCD413F,0x15FF451A,0x22BBD23,0x18E7FA12,0x15789412,0x1407F3AD,0xE34E149,0x1DD9EF60,0x85B4C28,0xA1},{0x93FF538,0x7AA0B71,0x3D2CEB3,0x61BCB1E,0xACC622E,0x1A3767DE,0x61F027B,0x185CDCB1,0x13E6A1E9,0xE361803,0x1880218F,0x62895FE,0x14B2BBFE,0xD240288,0x1C1FC271,0x13},{0x1B349B02,0xB53E37C,0x1ED9EA61,0x5AB2858,0xB67832E,0x2AA71F7,0xDB9D08F,0xC73B305,0x73FA5E7,0x13B8B1BB,0x55FF6BB,0x85C4222,0x1CE8EB95,0xFFD7A2F,0xE35B9C2,0x7B},{0x1E8BF419,0x58C0D7E,0x1E8CB5A2,0x73EC57B,0x1BA6872,0x8468C61,0x188BEA65,0x1816C6AF,0x13946FCA,0x1CAB443C,0x1A0B0CBE,0x133FAF0E,0x1DFEAF70,0x81B1972,0x7C15DCD,0x2F},{0x15EA6770,0x153E7411,0x194A07B0,0x3DE3153,0x1B272CD3,0x1457211A,0xBBE8481,0x124FDB0F,0x1D9F0AB1,0x1C1A31DD,0x1C1A7078,0xE0FBD4B,0x4C2F512,0x1E9AA0A2,0xD77577F,0x9D},{0x6C0FF64,0xDED97C9,0x1ABFB826,0x10A18BCB,0xA2E9E97,0x2F2BF0C,0x1BE37B6,0x15083D61,0x1F0EAD50,0x1285E151,0xE8C9A5,0xAACDD1C,0x21BAABC,0x12A1AB54,0xDF074C8,0x33},{0x1AD61CD4,0x15B2A8D2,0xE89EDBC,0x1FC8A43B,0x1B234A16,0x56FF55F,0x4434214,0x19A164DF,0x6FD7D0B,0x1F59707F,0x4024A6B,0x3C55387,0xB3B4937,0xC2440D9,0x151CFAE4,0x25},{0x13196AB7,0x1C4BE1B9,0x12338A3D,0x43704AC,0x5D1A5BF,0x1B56BCC6,0x907C135,0x111C7910,0x3E32A73,0xBF1FC0B,0xE4F0527,0x5083EC8,0x17B28B9,0x6268B6,0x55F070B,0x39},{0xA64A98B,0x1F4F594,0x1090DE8C,0x1CCB6B44,0x1BDBE18A,0x1915B90,0x1837267C,0x13AA0893,0x9E2045F,0x140227B2,0x151C8D7,0x1CF5C8F1,0x16B1A688,0x1E328319,0x174847C4,0x29},{0x23F15E0,0x20AE21E,0x2250855,0x13008AB4,0x73F6DF,0x111C5B0C,0x159AF9C6,0xB7FE152,0x79DF96D,0x9C80D6,0x8824E75,0xEA4AE30,0xD1ACD04,0x186AA2D2,0x1089D613,0x3F},{0xDEEFD29,0xE27AD26,0x1D3C7648,0x114BFF08,0x1E99583F,0x117A1E0B,0xBEB066D,0x888DA10,0x3FCD8,0x452C56F,0x1151FB02,0x1BBC16F2,0x5BDE13E,0xF9C061A,0x5F0DF6F,0x4A},{0xC6AA7A5,0xB730285,0x16623E6B,0x11428639,0xE16EF5A,0xB3CA060,0xD95CDD3,0xCD03F43,0xCC34C0E,0x1E6D50EB,0x1454A80,0x1DDE2C91,0x18D93981,0x1F2FBD71,0xD51A6B7,0x52},{0x8B3D97C,0x93E33A9,0xE5BECEC,0x1B419BCC,0x19948005,0x17561899,0xAB43192,0x62F209E,0x72E20EB,0x1404250C,0x1DE0C492,0x3B72CA1,0x10C7D312,0x1AC39F4F,0xCC2FE92,0x24},{0x17E5B5CD,0xAC10F48,0x4D24A06,0x13D52E8B,0x3CAC1AD,0x9AFA89C,0x15A904CE,0x1973387C,0xE4F654D,0x6BDE920,0x2894302,0x115601A7,0x6F09153,0x6D61B04,0xC0C09D6,0x2F},{0x20CBB48,0x1CD36C35,0x1D1ECCAD,0xA4A2E64,0x6410B48,0x1F0178A6,0x140D5A2A,0xBC9E98D,0x25196AD,0x1D674AE6,0x17968F26,0x170DF7C0,0x14FA6C21,0x11136ABF,0x16E9371E,0x84},{0x120E7325,0x2081D06,0x1178C70E,0x18029A79,0x1D1A3656,0x8BD4833,0x678C01,0x1FFEA081,0x1E52B15F,0x6DB1DE3,0x1312FB85,0xCF17DA,0xD42415A,0xE097FC3,0x14AF9D8F,0x91},{0x3BCD51F,0x1252FE3F,0x1CFC6139,0x865D2A9,0x351F9EE,0x94E9CD5,0x16A17578,0x1D1A2E67,0x18D6D662,0x15C773CC,0x15DFD11A,0xC186191,0x261488A,0x14F3BFC3,0x13D7B4DA,0x58},{0x1F460AFF,0xEBF619A,0x21112D1,0x6519E28,0x16301DF6,0x122DCCC,0x199520F0,0x18B93BAA,0x1066120A,0xAB20E15,0x153840C7,0x1553B357,0x65990C8,0x1480086C,0x70D3E2F,0x16},{0x188381C1,0x61392FE,0x106D2339,0x1FF56EA5,0x2C827C6,0x1542A2B,0x102CF503,0x25FD7D8,0x8F93EAA,0xA554551,0xEC5FC64,0x18684127,0x71BE49B,0xAD4A921,0x2AA5579,0x11},{0x20F40C4,0xE3CE918,0xEF3E41,0x6819DB7,0xA3F7AA3,0x1704BF3,0x1FC1BE3A,0x1D2E30CC,0x1D39A6D9,0x1340E096,0xDBC8405,0x5CE2E57,0x117283E0,0x1F8CF7E8,0x95C44F4,0xA7}};
+const BIG CURVE_HTPC2= {0x152C1DFF,0x99DA487,0x18C185A2,0x6546AF3,0x144EC7F8,0xEF3797,0x1994DD57,0x179C04E7,0x57CDB0F,0x2585126,0x49E8583,0xCA412D5,0x6BFAFF3,0x14C442E4,0xBD9A0,0x1B};
+const BIG CURVE_Adr= {0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Adi= {0xF0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Bdr= {0x3F4,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Bdi= {0x3F4,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG PCR[13]= {{0xB425ED1,0xA84BDA1,0x81DED55,0x1E8897B4,0x73D0AA2,0x1D575C73,0x3B6AF6,0xBF03B37,0x19D6C70F,0x14E85262,0x3AB4A64,0x1D1426CB,0x12C9C7B1,0x121291F5,0x967F827,0x9B},{0x71C71E,0x1FE38E39,0x61671FF,0x6E671C7,0xD6DC7FA,0x6018556,0x82C9039,0x10F42C69,0x361154B,0xFAE3DCA,0xAC077CB,0xDCF1D18,0x61755C5,0x158DED78,0xF0DFA1D,0x74},{0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0xAD097D6,0xAA12F68,0x2077B55,0x17A225ED,0x19CF42A8,0x1755D71C,0x180EDABD,0x1AFC0ECD,0x1675B1C3,0x53A1498,0x18EAD299,0xF4509B2,0xCB271EC,0x1C84A47D,0x1A59FE09,0x26},{0xC,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0xEDD3C0D,0x18BA7819,0x8CB1671,0x6694F03,0x1A8220DB,0x1A73F97C,0x1D95B3E0,0x14EEEAD0,0xBFE0250,0x16A65940,0xBF99097,0xCD5D4B1,0x1AFEDAB,0x63EC8CA,0x785F780,0xA8},{0x1038E38F,0x1FF1C71C,0x130B38FF,0x37338E3,0x6B6E3FD,0x1300C2AB,0x1416481C,0x187A1634,0x1B08AA5,0x17D71EE5,0x5603BE5,0x16E78E8C,0x30BAAE2,0x1AC6F6BC,0x786FD0E,0x3A},{0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0x974F017,0x369E065,0x17C758C7,0x1A983C0C,0xD9A7F86,0x1EC90DEE,0x18E4681,0x1770E36A,0xC3296E,0x4094EF4,0x1F84274B,0x5334FD7,0xB56B4B5,0x7FC768B,0x1A58F87B,0x94},{0x12,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0x10AAA8FB,0x1FD55555,0x1921AAFF,0xA59AAAA,0x1424ABF7,0x19024801,0x1C42D855,0x96E429D,0x5119FF1,0x7855CAF,0x1020B3B1,0x4B6ABA4,0x92300A8,0x1054E434,0x1694F72C,0xAE}};
+const BIG PCI[13]= {{0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0x1038E38D,0x1FF1C71C,0x130B38FF,0x37338E3,0x6B6E3FD,0x1300C2AB,0x1416481C,0x187A1634,0x1B08AA5,0x17D71EE5,0x5603BE5,0x16E78E8C,0x30BAAE2,0x1AC6F6BC,0x786FD0E,0x3A},{0x71C71A,0x1FE38E39,0x61671FF,0x6E671C7,0xD6DC7FA,0x6018556,0x82C9039,0x10F42C69,0x361154B,0xFAE3DCA,0xAC077CB,0xDCF1D18,0x61755C5,0x158DED78,0xF0DFA1D,0x74},{0xAD097D6,0xAA12F68,0x2077B55,0x17A225ED,0x19CF42A8,0x1755D71C,0x180EDABD,0x1AFC0ECD,0x1675B1C3,0x53A1498,0x18EAD299,0xF4509B2,0xCB271EC,0x1C84A47D,0x1A59FE09,0x26},{0x10AAAA9F,0x1FD55555,0x1921AAFF,0xA59AAAA,0x1424ABF7,0x19024801,0x1C42D855,0x96E429D,0x5119FF1,0x7855CAF,0x1020B3B1,0x4B6ABA4,0x92300A8,0x1054E434,0x1694F72C,0xAE},{0x10AAAA63,0x1FD55555,0x1921AAFF,0xA59AAAA,0x1424ABF7,0x19024801,0x1C42D855,0x96E429D,0x5119FF1,0x7855CAF,0x1020B3B1,0x4B6ABA4,0x92300A8,0x1054E434,0x1694F72C,0xAE},{0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0x71C71C,0x1FE38E39,0x61671FF,0x6E671C7,0xD6DC7FA,0x6018556,0x82C9039,0x10F42C69,0x361154B,0xFAE3DCA,0xAC077CB,0xDCF1D18,0x61755C5,0x158DED78,0xF0DFA1D,0x74},{0x5DA12ED,0x153425ED,0x171A2FAA,0x12B784BD,0x1A55694E,0x1AC70E4,0x433FD98,0xE7233D0,0xE9BEE2D,0x24B4816,0x1735E118,0x1571A1F1,0x1C708EBB,0x13D03FB6,0x1C3AF922,0x87},{0x974F017,0x369E065,0x17C758C7,0x1A983C0C,0xD9A7F86,0x1EC90DEE,0x18E4681,0x1770E36A,0xC3296E,0x4094EF4,0x1F84274B,0x5334FD7,0xB56B4B5,0x7FC768B,0x1A58F87B,0x94},{0x10AAAA99,0x1FD55555,0x1921AAFF,0xA59AAAA,0x1424ABF7,0x19024801,0x1C42D855,0x96E429D,0x5119FF1,0x7855CAF,0x1020B3B1,0x4B6ABA4,0x92300A8,0x1054E434,0x1694F72C,0xAE},{0x10AAA9D3,0x1FD55555,0x1921AAFF,0xA59AAAA,0x1424ABF7,0x19024801,0x1C42D855,0x96E429D,0x5119FF1,0x7855CAF,0x1020B3B1,0x4B6ABA4,0x92300A8,0x1054E434,0x1694F72C,0xAE},{0x10AAA8FB,0x1FD55555,0x1921AAFF,0xA59AAAA,0x1424ABF7,0x19024801,0x1C42D855,0x96E429D,0x5119FF1,0x7855CAF,0x1020B3B1,0x4B6ABA4,0x92300A8,0x1054E434,0x1694F72C,0xAE}};
+#endif
+
+#if CHUNK==64
+
+using namespace B448_60;
+
+// Base Bits= 60
+
+const int CURVE_Cof_I= 0;
+const BIG CURVE_Cof= {0xFF0000011FFFFFFL,0x403FL,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const int CURVE_B_I= 4;
+const BIG CURVE_B= {0x4L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_Order= {0xEBC000000000001L,0x81987F70023FFFFL,0x340905DC5A3E80L,0x94374F2CDDD3713L,0x10405F3D0D062F6L,0x0L,0x0L,0x0L};
+const BIG CURVE_Gx= {0xE6CA5B278ABC574L,0xFC6EC8ECBE2A6D2L,0x29BD7C18640BFDDL,0x8814D9BD1F29789L,0xABA282B7CE9049EL,0x43412B4E0DF13E7L,0xB62517BEDDB681EL,0x39E6C4L};
+const BIG CURVE_Gy= {0x994157597A9CE3FL,0xF905D6B69C431DCL,0x3476A5568900742L,0xB09E5F3D3F429D6L,0xFAD8CED72F5769DL,0xB19187E10D9FBDDL,0x87504385DD443B2L,0x12621FL};
+const BIG CURVE_HTPC= {0x14C40448911B6DFL,0xA05D73B4005575AL,0x19D3FFA0043A6AL,0x9DCBB950453AAB1L,0x8F188A39830074AL,0x886F6C1313A12BL,0x323F40FBC329680L,0x4F6592L};
+
+const BIG CURVE_Bnx= {0xFF0000012000000L,0x403FL,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_Pxa= {0x65025557F3AF148L,0xAF4DBD1F46E75B8L,0x1730875544DD695L,0xE37A84E30576317L,0x2760C16CE339FC8L,0x258FB84649C73F2L,0x45DECE4C1502219L,0x2C5ECL};
+const BIG CURVE_Pxb= {0xC4F6E6BB36279B6L,0x530E32492D8015BL,0x3F16872759E2951L,0xDD4ACB43BA5202FL,0xFE06E165089BD13L,0xDA296B65CE7FAEAL,0x16EC13B532F64C9L,0xF64B9L};
+const BIG CURVE_Pya= {0xBFC0EA271C0B975L,0x971B0987719FB7DL,0x783587349A91EFBL,0x5B26E1E164C5BA2L,0x34AE6E2149122B6L,0x919E2C134F4019FL,0x46D510457BD2FL,0x45EA07L};
+const BIG CURVE_Pyb= {0x3EE1FF0082464ADL,0xF8557C8A8F0CF1BL,0x6062A50D0077B77L,0x806D6E17CEEF5EBL,0x8F95D948A372182L,0x1690DECDC940F93L,0xEB1BEA8F586B9E9L,0x34015DL};
+
+const BIG CURVE_Ad= {0x2B7CF1B298E3466L,0x6C9FE584ADB58AL,0xAE618C4441D091DL,0x649C886E6D2CC2BL,0x7BDA1ECDF8CA78FL,0x9FC3FCD80DBBB27L,0x74D4F1F9729760CL,0x19EA0EL};
+const BIG CURVE_Bd= {0x1CCB86130F780D9L,0x2D5A7C07F4A51A0L,0x99A51B6FD01A1BBL,0xAE12B32E246480L,0x45C8B048B4D289L,0xAD74B1FED8D288BL,0x276B220D6B08F5BL,0x29D1A2L};
+const BIG PC[53]= {{0xCA2E8BA3F34E48L,0x9C1F67AB89650AL,0x4FA71DA7BA330L,0xD104A18D275FFDCL,0xE98A8B61C21689CL,0xC03CB4E05961F09L,0xAB977EAB088A0C6L,0xF2910L},{0x8DAB6776604D319L,0x5E333A54FF1F29EL,0xB06B4CD9E4CBF06L,0xF8DAA9493D66B74L,0x26D3AB458B9CC61L,0xBACFA058DFB0295L,0x3F9DF9DF3EB0CB5L,0x3DFC8EL},{0xF5334873EA1F60AL,0x9549B6EC7E13A86L,0xA5D45908C4E2558L,0xE0D733926F79B73L,0xCDE1872F1991243L,0x8E00DEE03D4D2CAL,0xD168F4937C08D2CL,0x53D3D2L},{0x44C150037499741L,0x3BD7556E9D85B54L,0x70B485348521E19L,0x4DCEB44DF6F5242L,0x7F602EC95D38A81L,0xD3B6B4317C39525L,0xAB827397CF26EABL,0xF40BEL},{0xD780C2EE8A9B7DDL,0x5BFD0A87BA123F6L,0xB704149A656E9B7L,0xFB3D8D8250169A7L,0xDBAFE384E1B5A80L,0xE33E6DB698822E2L,0x1ADFD5731D2D4D2L,0x27E3F5L},{0xEE18F93C41C4477L,0x8822B165E9F3BB5L,0xF81BCEAD751713BL,0xF3FD57505403933L,0x543A69376B6BAE1L,0x2E2C188E07B1B4AL,0xFA47058B97839A4L,0x129214L},{0xC46466ED0815090L,0x82A8477388286F6L,0x55415FA6E5B59C3L,0x4FCDBA32F596982L,0x3BEBA0B8B800647L,0x8067EDEC24FD2DCL,0x23735D491406F8DL,0x27031AL},{0x237171BD500BAD1L,0x54E5DABBDA52179L,0x39EED6D9840047L,0x9F62B3C5BBE70BBL,0x5B682935D460B68L,0xE37CCA944164133L,0xBAA9B754C8769C5L,0x4F71D5L},{0x48821C29E8081C0L,0x8B10F8432B1F73FL,0xF33341BDF35547EL,0x44D8A286F2D64E3L,0x7CF3F353E5AFD5L,0x77CBAA1A38E67B6L,0x474039CD79B26B0L,0x15F7E2L},{0xF92A02857226171L,0x670D84A4DB8412EL,0x4C07F33AC92190EL,0xFE7C239718D531FL,0x16FEB62FC918257L,0x551F5FA232DBF4CL,0xA2262B91DD663A6L,0x513BA6L},{0x139421007A91954L,0xC897089BCA8F8E1L,0xF39670B7F8E69E7L,0xECD5CC0FAC3C084L,0x4A62E46CB8D5D73L,0xD6958651AF783AEL,0x6214D7EAF10E794L,0x4A1CF5L},{0x5035F58B92801A5L,0x9DD21175856DFA0L,0x1C54471AC39F6E8L,0x4A4455B68F864L,0xCEBF3444F479330L,0xA1896ECB026AE8FL,0x13798A8AD8FBB10L,0x40036L},{0x12593C28F9D1C0AL,0x9E53BCD23503B31L,0x74FF15EBD437870L,0x814D22AAA5002D5L,0xE3CD6452AC2C033L,0xCEDA7682EAD8194L,0xCA8D948BF6077F1L,0x4B6163L},{0x695774ADF0A734CL,0x3A4F0FAF18848AEL,0xA329B8FFF150217L,0xCFA4BB81D32CB6CL,0x46753EE2A5BF898L,0x76FF71FFF34CE9CL,0xF985D613FEBD9A1L,0x4AE3B1L},{0xA6F72CFF1F37A8DL,0xC08952B61FB4664L,0x75F3020A8B74C59L,0xF837EF511EC585EL,0xACEE128F587CFCEL,0xC68B982093597FBL,0x11DBD5819E24045L,0x1305B0L},{0x8AD991A3124740BL,0xB1BA6424469E9C6L,0x6D0500D1A8B0336L,0x4697B3B665ECD64L,0x789128B282C2A24L,0x7C5FEA435E1E511L,0xBF4998179A5D89AL,0x370542L},{0x6EB49AAAD27D311L,0xC44B2B709A2C349L,0x97D96FEB98EEF0CL,0xEDFE38DCE8507CBL,0xD7302DB5F6B3FF9L,0xA8E476581D84921L,0xA51CC54C7152F5L,0x47A513L},{0xC2E3ACF1F1FC577L,0x819DC8582B977BL,0x2CAB1522882CAB8L,0xC8900CA9AF3D679L,0x479599396371CE7L,0xCDCE25F02C5B347L,0xA58D8B2A509BE1AL,0x2FCD0AL},{0x657289AE9150A48L,0x38C6B088F4220C0L,0x3483EB38D0F458L,0x589009EAF978350L,0x7EBB824407235B4L,0x56CA72A2CCB14E4L,0xEA66FC272BCDCCFL,0x439DC3L},{0x6623DEF9357D628L,0xFD7BA8E7DE31234L,0x99C040938DB9E8BL,0xB0FE406C9D3CDB6L,0xD38F65BE751A703L,0x7CA37104A247DEBL,0x7ECA5B210A36965L,0x3932D3L},{0xA23FE2FB17D6EECL,0x7ABF374B72AAE7L,0x62C2BF1860877F7L,0x8C4635085D4226FL,0x295B0F5706768CCL,0x227C909C7AEB12FL,0x521176C4D8AEC4CL,0x2C87ABL},{0x6F88B2A580B7137L,0x6A01C7EC3DCBF40L,0x77A61FE541BC690L,0xC21EED75E09CBBEL,0xD546C64B66EF123L,0xE9BE54149BB92F4L,0x2737E7C402B1E3AL,0x2542AAL},{0x75832C6E05BEFD8L,0x5DFA5C39B3B092FL,0xE8C16C48839C904L,0xCD2EF769EC4E8B6L,0x2C80F565FA5F23CL,0x6E9127B74DF1A18L,0xF8539726D23B186L,0x160D2L},{0x419B4088ACA5AD9L,0x7306B8707C1ADC1L,0xACD61FFAF6099A0L,0xC51DEF3D128F489L,0x81B7085E8A76F4EL,0x2D3B39889E0FB08L,0xD61F1EA307C7E55L,0x4BF3DFL},{0xA8371AA52C72185L,0x8EB49A55D2D9E38L,0xC6C6736817932E9L,0x9DBF37057564284L,0x443A1CBA5B94394L,0xD87AF590E234AA5L,0x7D1FCAC035D89CL,0x2FC680L},{0xFEA149BAEFEE0EAL,0x3CF4640E446D388L,0x1E4CE07FE5EDC2CL,0x5F90A3F48CF058EL,0x9F19E019EED6342L,0xF4E2F3EB5891E98L,0x7D7EECC281EEE08L,0x4B2EE5L},{0x3F500EED6887410L,0x10F5106924F0215L,0x5AF361F0BCBCC51L,0xBA469C2DA94E589L,0xD831D9B3D39CDF1L,0xCB5839282F3E02DL,0x2DE045F7C285BD4L,0x3DFAA0L},{0xFEE121340DD0AA9L,0xC80E715435565F5L,0xC9BDDB418617757L,0x9008A702AC7A865L,0x7B352BC03C0F76AL,0xDB9BAD304E54DE7L,0x20262A2ADBD4C8FL,0x4B32FDL},{0x2DE43411E428BFDL,0xA41124E28EB7D81L,0xEFCAE1597CB7A3FL,0xD7659AAD7AD2D1L,0x44F775441C84B43L,0x53A8AE3DCFF23BDL,0x40645BA7F7D5EBL,0x285EECL},{0x2727300D2540F1FL,0xFDECB15E09A345L,0x21DEA9022B44831L,0xBBB119161008E89L,0xECA756DE403AF19L,0xEED8A0E6D5E59CL,0x95A363EF5B040D0L,0x522411L},{0xA2C27EEF545BF96L,0xAA5B86F0E4960D7L,0x6AFF6F2F34CA0A0L,0x2D50D7FDB10F76CL,0xC47B4C01E25E74AL,0xCA748839AA13431L,0xB0C0E8C18582A96L,0x4E11DCL},{0xA3678E32C96D5DEL,0xF315422ACB1139CL,0x2AE44725AB3522DL,0xE862D8477DF1321L,0x8E709EED8BC73E4L,0xDAC20BC1126FA15L,0x248E008527C5F1AL,0x365008L},{0xDEAED787A433825L,0x3D4E69DE567CE3BL,0x2F8F7B0845854D8L,0xAECAE67C3C4F7CFL,0x210926FB5CF553CL,0x637AFBF8D84A492L,0x2CD7464BC2B8EBDL,0x19F380L},{0x12C16B5AF92004CL,0xB35CDE4958DDF53L,0xFE46B6BD7B008FFL,0x23AFFA28D733504L,0x4B1CFF42422BBDL,0x149A03F9D6D5E25L,0x30A3BB3DEC0E34EL,0x50A16DL},{0xCF5416E293FF538L,0xE30DE58F0F4B3ACL,0xEF46ECFBCACC622L,0xE9C2E6E58987C09L,0x63DC6C30073E6A1L,0xBFE3144AFF62008L,0x9C5A4805114B2BL,0x9F07FL},{0x56A7C6F9B349B02L,0xE2D5942C7B67A98L,0x3C554E3EEB67832L,0xE7639D982B6E742L,0xAEE771637673FA5L,0xB9542E2111157FDL,0xE709FFAF45FCE8EL,0x3DB8D6L},{0x8B181AFDE8BF419L,0x239F62BDFA32D68L,0x9508D18C21BA687L,0xCAC0B6357E22FA9L,0x2FB95688793946FL,0xF7099FD787682C3L,0x773503632E5DFEAL,0x179F05L},{0x2A7CE8235EA6770L,0x31EF18A9E5281ECL,0x68AE4235B272CDL,0xB1927ED87AEFA12L,0x1E383463BBD9F0AL,0x512707DEA5F069CL,0x5DFFD3541444C2FL,0x4EB5DDL},{0x9BDB2F926C0FF64L,0x7850C5E5EAFEE09L,0xD85E57E18A2E9E9L,0x50A841EB086F8DEL,0x69650BC2A3F0EADL,0xABC5566E8E03A32L,0xD32254356A821BAL,0x19B7C1L},{0x2B6551A5AD61CD4L,0x6FE4521DBA27B6FL,0x50ADFEABFB234A1L,0xBCD0B26F910D08L,0x9AFEB2E0FE6FD7DL,0x9371E2A9C390092L,0xEB9184881B2B3B4L,0x12D473L},{0x7897C3733196AB7L,0xF21B825648CE28FL,0xD76AD798C5D1A5BL,0x7388E3C88241F04L,0x49D7E3F8163E32AL,0x8B92841F64393C1L,0x1C2C0C4D16C17B2L,0x1C957CL},{0x3E9EB28A64A98BL,0xAE65B5A242437A3L,0xF0322B721BDBE18L,0x5F9D50449E0DC99L,0x35E8044F649E204L,0x688E7AE47885472L,0x1F13C6506336B1AL,0x14DD21L},{0x4415C43C23F15E0L,0xF980455A0894215L,0x1A238B618073F6DL,0x6D5BFF0A9566BE7L,0x9D413901AC79DF9L,0xD04752571822093L,0x584F0D545A4D1ACL,0x1FC227L},{0x1C4F5A4CDEEFD29L,0xF8A5FF8474F1D92L,0xB62F43C17E99583L,0xD84446D082FAC19L,0xC088A58ADE003FCL,0x13EDDE0B794547EL,0x7DBDF380C345BDEL,0x2517C3L},{0xD6E6050AC6AA7A5L,0xA8A1431CD988F9AL,0x4D67940C0E16EF5L,0xE6681FA1B65737L,0xA03CDAA1D6CC34CL,0x981EEF164885152L,0x9ADFE5F7AE38D93L,0x293546L},{0x127C67528B3D97CL,0x5DA0CDE6396FB3BL,0x4AEAC3133994800L,0xEB317904F2AD0C6L,0x24A8084A1872E20L,0x3121DB9650F7831L,0xFA4B5873E9F0C7DL,0x12330BL},{0x95821E917E5B5CDL,0xD9EA97459349281L,0x3935F51383CAC1AL,0x4DCB99C3E56A413L,0xC08D7BD240E4F65L,0x1538AB00D38A250L,0x2758DAC36086F09L,0x17B030L},{0x79A6D86A20CBB48L,0x85251732747B32BL,0xABE02F14C6410B4L,0xAD5E4F4C6D03568L,0xC9BACE95CC25196L,0xC21B86FBE05E5A3L,0xDC7A226D57F4FA6L,0x425BA4L},{0x84103A0D20E7325L,0x6C014D3CC5E31C3L,0x517A9067D1A365L,0x5FFFF5040819E30L,0xE14DB63BC7E52B1L,0x15A0678BED4C4BEL,0x763DC12FF86D424L,0x48D2BEL},{0x64A5FC7E3BCD51FL,0xE432E954F3F184EL,0xE129D39AA351F9EL,0x62E8D1733DA85D5L,0x46AB8EE7998D6D6L,0x88A60C30C8D77F4L,0xD36A9E77F862614L,0x2C4F5EL},{0x5D7EC335F460AFFL,0x6328CF1408444B4L,0xC0245B9996301DFL,0xAC5C9DD5665483L,0x31D5641C2B06612L,0xC8AA9D9ABD4E10L,0xF8BE90010D86599L,0xB1C34L},{0x4C2725FD88381C1L,0x6FFAB752C1B48CEL,0xC2A854562C827CL,0xAA12FEBEC40B3D4L,0x1914AA8AA28F93EL,0x49BC342093BB17FL,0x55E55A9524271BEL,0x88AA9L},{0x5C79D23020F40C4L,0x3340CEDB83BCF90L,0xE82E097E6A3F7AAL,0xD9E9718667F06F8L,0x16681C12DD39A6L,0x3E02E7172BB6F21L,0x13D3F19EFD11728L,0x53A571L}};
+const BIG CURVE_HTPC2= {0x933B490F52C1DFFL,0x832A3579E306168L,0x5C1DE6F2F44EC7FL,0xFBCE0273E65375L,0x60C4B0A24C57CDBL,0xFF3652096A927A1L,0x668298885C86BFAL,0xD802FL};
+const BIG CURVE_Adr= {0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_Adi= {0xF0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_Bdr= {0x3F4L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_Bdi= {0x3F4L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const BIG PCR[13]= {{0x55097B42B425ED1L,0x2F444BDA2077B55L,0xDBAAEB8E673D0AAL,0xF5F81D9B80EDABL,0x9929D0A4C59D6C7L,0x7B1E8A13658EAD2L,0xE09E42523EB2C9CL,0x4DA59FL},{0xFFC71C72071C71EL,0xA37338E39859C7FL,0xE4C030AACD6DC7FL,0x4B87A1634A0B240L,0xF2DF5C7B9436115L,0x5C56E78E8C2B01DL,0xE876B1BDAF06175L,0x3A3C37L},{0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L},{0x55425ED0AD097D6L,0x8BD112F6881DED5L,0xF6EABAE399CF42AL,0xC3D7E0766E03B6AL,0xA64A742931675B1L,0x1EC7A284D963AB4L,0xF82790948FACB27L,0x136967L},{0xCL,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L},{0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L},{0x7174F032EDD3C0DL,0xB334A781A32C59CL,0x834E7F2F9A8220DL,0x50A7775687656CFL,0x25ED4CB280BFE02L,0xDAB66AEA58AFE64L,0xDE00C7D91941AFEL,0x541E17L},{0xFFE38E39038E38FL,0xD1B99C71CC2CE3FL,0x7260185566B6E3FL,0xA5C3D0B1A505920L,0xF96FAE3DCA1B08AL,0xAE2B73C7461580EL,0xF43B58DED7830BAL,0x1D1E1BL},{0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L},{0xC6D3C0CA974F017L,0x6D4C1E065F1D631L,0x7D921BDCD9A7F8L,0x6EBB871B506391AL,0xD2C8129DE80C329L,0x4B5299A7EBFE109L,0xE1ECFF8ED16B56BL,0x4A6963L},{0x12L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L},{0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L},{0xFFAAAAAB0AAA8FBL,0x752CD5556486ABFL,0x572049003424ABFL,0xF14B7214EF10B61L,0xEC4F0AB95E5119FL,0xA825B55D24082CL,0xDCB20A9C8689230L,0x575A53L}};
+const BIG PCI[13]= {{0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L},{0xFFE38E39038E38DL,0xD1B99C71CC2CE3FL,0x7260185566B6E3FL,0xA5C3D0B1A505920L,0xF96FAE3DCA1B08AL,0xAE2B73C7461580EL,0xF43B58DED7830BAL,0x1D1E1BL},{0xFFC71C72071C71AL,0xA37338E39859C7FL,0xE4C030AACD6DC7FL,0x4B87A1634A0B240L,0xF2DF5C7B9436115L,0x5C56E78E8C2B01DL,0xE876B1BDAF06175L,0x3A3C37L},{0x55425ED0AD097D6L,0x8BD112F6881DED5L,0xF6EABAE399CF42AL,0xC3D7E0766E03B6AL,0xA64A742931675B1L,0x1EC7A284D963AB4L,0xF82790948FACB27L,0x136967L},{0xFFAAAAAB0AAAA9FL,0x752CD5556486ABFL,0x572049003424ABFL,0xF14B7214EF10B61L,0xEC4F0AB95E5119FL,0xA825B55D24082CL,0xDCB20A9C8689230L,0x575A53L},{0xFFAAAAAB0AAAA63L,0x752CD5556486ABFL,0x572049003424ABFL,0xF14B7214EF10B61L,0xEC4F0AB95E5119FL,0xA825B55D24082CL,0xDCB20A9C8689230L,0x575A53L},{0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L},{0xFFC71C72071C71CL,0xA37338E39859C7FL,0xE4C030AACD6DC7FL,0x4B87A1634A0B240L,0xF2DF5C7B9436115L,0x5C56E78E8C2B01DL,0xE876B1BDAF06175L,0x3A3C37L},{0xAA684BDA5DA12EDL,0xE95BC25EDC68BEAL,0x60358E1C9A55694L,0x2D73919E810CFF6L,0x460496902CE9BEEL,0xEBBAB8D0F8DCD78L,0xE48A7A07F6DC708L,0x43F0EBL},{0xC6D3C0CA974F017L,0x6D4C1E065F1D631L,0x7D921BDCD9A7F8L,0x6EBB871B506391AL,0xD2C8129DE80C329L,0x4B5299A7EBFE109L,0xE1ECFF8ED16B56BL,0x4A6963L},{0xFFAAAAAB0AAAA99L,0x752CD5556486ABFL,0x572049003424ABFL,0xF14B7214EF10B61L,0xEC4F0AB95E5119FL,0xA825B55D24082CL,0xDCB20A9C8689230L,0x575A53L},{0xFFAAAAAB0AAA9D3L,0x752CD5556486ABFL,0x572049003424ABFL,0xF14B7214EF10B61L,0xEC4F0AB95E5119FL,0xA825B55D24082CL,0xDCB20A9C8689230L,0x575A53L},{0xFFAAAAAB0AAA8FBL,0x752CD5556486ABFL,0x572049003424ABFL,0xF14B7214EF10B61L,0xEC4F0AB95E5119FL,0xA825B55D24082CL,0xDCB20A9C8689230L,0x575A53L}};
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_BLS12461.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_BLS12461.cpp
new file mode 100644
index 0000000..f16bf58
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_BLS12461.cpp
@@ -0,0 +1,79 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "ecp_BLS12461.h"
+
+namespace BLS12461 {
+/* Curve BLS12461 - Pairing friendly BLS curve */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B464_28;
+
+const int CURVE_Cof_I=0;
+const int CURVE_B_I= 9;
+const BIG CURVE_B= {0x9,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Order= {0x1,0x0,0xFFFFC00,0x7FEFFFE,0x110000,0x7FFC800,0x801FC01,0x5FD000E,0x17FE0,0xFFFC018,0xFFFFFF7,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Gx= {0xADEE93D,0x4D026A8,0x74B7411,0xD9C00EE,0x31AC7F2,0xC3981B5,0x9218229,0xD3564DC,0xA096650,0x6F7C292,0x9743616,0xBE922B1,0x12CF668,0xC81327,0x463B73A,0xE74E99B,0xAD0};
+const BIG CURVE_Gy= {0xAD1D465,0xF763157,0xC4FF470,0x17884C8,0xB8D215D,0xA819E66,0xF4959D0,0xE5C3245,0xB84910A,0xB8BFA40,0xBE96EEC,0x8BF9F8C,0xF277ACC,0x5F1C3F2,0x5F68C9,0xCDB14B3,0x77B};
+const BIG CURVE_HTPC= {0x1,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+
+const BIG CURVE_Bnx= {0x0,0xFBFFFE0,0x1FFFFF,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Cof= {0x1,0xFBFFFE0,0x1FFFFF,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+//const BIG CURVE_Cof= {0xAAAAAAB,0xA7FFFEA,0x1556AA,0xD55AAAB,0x554FFFF,0x1555,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+
+
+const BIG CURVE_Pxa= {0x6D0A37C,0x5B50318,0x75DCC46,0xC2E492E,0xD6878A9,0xE01F919,0xF92F564,0x86DB74F,0x66803F0,0x46D581A,0x7ED78D,0x2F97C29,0xC270C89,0xF679453,0x6A50A9A,0x54138A0,0x10CC};
+const BIG CURVE_Pxb= {0x2C1C0AD,0xF85CA8C,0x25CADE9,0x6CD66C4,0xA289609,0xC612951,0xEE2401A,0x529ABEB,0xF65B17D,0xBA09D33,0xD4C5AF5,0x4D4371E,0x46A672E,0xA279D22,0xACEA37C,0x1FB4FE5,0x95C};
+const BIG CURVE_Pya= {0x2FB006,0xCCD0C1B,0xA12A337,0x3D194A4,0xC92C895,0x4960CFC,0x39FC68B,0x3A9B00F,0xED1BA0F,0xA7DBBC5,0xA9CDFD8,0x27CC2F7,0x4E73ED2,0x6070F4F,0xEBA7E67,0xAC848E7,0x226};
+const BIG CURVE_Pyb= {0xDF1457C,0xA506ADF,0x4C20A8,0xD6A31DC,0x36E3FB4,0xEA9A8F1,0x92F5668,0x3C3BE44,0x67A1297,0x74BEABA,0x56A20BE,0x4C42E38,0x45157F0,0x2AB1D00,0xBB402EA,0x101B4FA,0xE38};
+
+#endif
+
+#if CHUNK==64
+
+using namespace B464_60;
+
+const int CURVE_Cof_I=0;
+const int CURVE_B_I= 9;
+const BIG CURVE_B= {0x9L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_Order= {0x1L,0x7FEFFFEFFFFC0L,0xC017FFC80001100L,0x7FE05FD000E801FL,0xFFFF7FFFC018001L,0xFFL,0x0L,0x0L};
+const BIG CURVE_Gx= {0x14D026A8ADEE93DL,0xF2D9C00EE74B741L,0x229C3981B531AC7L,0x6650D3564DC9218L,0x436166F7C292A09L,0x2CF668BE922B197L,0x463B73A0C813271L,0xAD0E74E99BL};
+const BIG CURVE_Gy= {0xF763157AD1D465L,0x5D17884C8C4FF47L,0x9D0A819E66B8D21L,0x910AE5C3245F495L,0x96EECB8BFA40B84L,0x277ACC8BF9F8CBEL,0x5F68C95F1C3F2FL,0x77BCDB14B3L};
+const BIG CURVE_HTPC= {0x1L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+
+const BIG CURVE_Bnx= {0xFFBFFFE00000000L,0x1FFFFL,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_Cof= {0xFFBFFFE00000001L,0x1FFFFL,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+//const BIG CURVE_Cof= {0xAA7FFFEAAAAAAABL,0xFFD55AAAB01556AL,0x1555554FFL,0x0L,0x0L,0x0L,0x0L,0x0L};
+
+
+const BIG CURVE_Pxa= {0x65B503186D0A37CL,0xA9C2E492E75DCC4L,0x564E01F919D6878L,0x3F086DB74FF92FL,0xED78D46D581A668L,0x270C892F97C2907L,0x6A50A9AF679453CL,0x10CC54138A0L};
+const BIG CURVE_Pxb= {0x9F85CA8C2C1C0ADL,0x96CD66C425CADEL,0x1AC612951A2896L,0xB17D529ABEBEE24L,0xC5AF5BA09D33F65L,0x6A672E4D4371ED4L,0xACEA37CA279D224L,0x95C1FB4FE5L};
+const BIG CURVE_Pya= {0x7CCD0C1B02FB006L,0x953D194A4A12A33L,0x68B4960CFCC92C8L,0xBA0F3A9B00F39FCL,0xCDFD8A7DBBC5ED1L,0xE73ED227CC2F7A9L,0xEBA7E676070F4F4L,0x226AC848E7L};
+const BIG CURVE_Pyb= {0x8A506ADFDF1457CL,0xB4D6A31DC04C20AL,0x668EA9A8F136E3FL,0x12973C3BE4492F5L,0xA20BE74BEABA67AL,0x5157F04C42E3856L,0xBB402EA2AB1D004L,0xE38101B4FAL};
+
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_BLS24479.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_BLS24479.cpp
new file mode 100644
index 0000000..dac4cb1
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_BLS24479.cpp
@@ -0,0 +1,90 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "ecp_BLS24479.h"
+
+namespace BLS24479 {
+/* Curve BLS24479 - Pairing friendly BLS curve */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B480_29;
+
+// Base Bits= 29
+
+const int CURVE_Cof_I=0;
+const int CURVE_B_I= 19;
+const BIG CURVE_B= {0x13,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Order= {0x10000001,0xD047FF,0x1FD54464,0x1E3CE067,0xE322DDA,0x1D356F3F,0x7433B44,0x49091F9,0x1729CC2,0x250286C,0x16E62ED,0xB403E1E,0x1001000,0x80,0x0,0x0,0x0};
+const BIG CURVE_Gx= {0xBE3CCD4,0x33B07AF,0x1B67D159,0x3DFC5B5,0xEBA1FCC,0x1A3C1F84,0x56BE204,0xEF8DF1B,0x11AE2D84,0x5FEE546,0x161B3BF9,0x183B20EE,0x1EA5D99B,0x14F0C5BF,0xBE521B7,0x17C682F9,0x1AB2};
+const BIG CURVE_Gy= {0x121E5245,0x65D2E56,0x11577DB1,0x16DACC11,0x14F39746,0x459F694,0x12483FCF,0xC828B04,0xFD63E5A,0x7B1D52,0xAFDE738,0xF349254,0x1A4529FF,0x10E53353,0xF91DEE1,0x16E18D8A,0x47FC};
+const BIG CURVE_HTPC= {0x1,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+
+const BIG CURVE_Bnx= {0x11FF80,0x80010,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Cof= {0x11FF7F,0x80010,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+//const BIG CURVE_Cof= {0x19F415AB,0x1E0FFDFF,0x15AAADFF,0xAA,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+
+const BIG CURVE_Pxaa= {0x14E24678,0x1F149A9B,0x9609022,0x1C186868,0xCDEFC69,0x1C87BB2E,0x14A2235F,0x7586755,0x5896747,0x159BFE92,0x3B5572E,0x1710A521,0x71EB14A,0xC643C33,0x12581DE5,0x1BCA747D,0x959};
+const BIG CURVE_Pxab= {0x1FB099B8,0x3FCF5D7,0x4A91C0E,0xC6EEB40,0x11FC2385,0x11B5AE8D,0x1A9CC3E7,0x194FE144,0x185DB2A5,0x930E1C7,0x14F85F9A,0x1F2ED4E,0x1D1BE5AD,0xF26169C,0xCF7F194,0x1DA1062E,0x3B0D};
+const BIG CURVE_Pxba= {0x11AD15D3,0xD0E6F38,0x17DB85BB,0x30A62F1,0x1EA3E09A,0x17B25FA1,0x1B7959AC,0x1165B19A,0x6C74FDB,0x18F790E1,0x12278FDA,0x1E008F79,0x103F329,0x14619FF1,0x1EBCAA8,0xFF5A9CA,0x3EC2};
+const BIG CURVE_Pxbb= {0x1EE0F480,0x3D5943A,0xF5B12E3,0x128AADC8,0x180E1CB9,0x1EFD916F,0x48BC7F,0x1D5EE1FA,0x5698EF5,0x11D6AED9,0x1386BC6E,0x196E900B,0x1CE2E465,0xC2A8ED3,0x1E67DF99,0x71B7940,0xA5B};
+const BIG CURVE_Pyaa= {0x14781AA0,0xC324C98,0xEDC2AC,0x16C13B46,0x145FC44B,0x12529530,0x1310A8C4,0x1768C5C0,0xE19AE68,0x56E1C1D,0x13DAF93F,0x17E94366,0xF901AD0,0x76800CC,0x10250D8B,0x1E6BAE6D,0x5057};
+const BIG CURVE_Pyab= {0xEAE08FA,0xDDF62BF,0xA97E5AB,0xF0EE97,0x99A42CA,0x1C326578,0xF33DC11,0x8B913F7,0xFEF8552,0x19F35B90,0x58DDBDE,0xFC32FF2,0x1587B5DF,0xB5EB07A,0x1A258DE0,0x1692CC3D,0x2CE2};
+const BIG CURVE_Pyba= {0x5F0CC41,0xB9813B5,0x14C2A87D,0xFF1264A,0x19AF8A14,0x6CE6C3,0x2A7F8A2,0x121DCA7D,0x7D37153,0x19D21078,0x15466DC7,0x1362982B,0x1DD3CB5B,0x1CFC0D1C,0x18C69AF8,0x8CC7DC,0x1807};
+const BIG CURVE_Pybb= {0x115C1CAE,0x78D9732,0x16C26237,0x5A81A6A,0x1C38A777,0x56121FE,0x4DAD9D7,0x1BEBA670,0xA1D72FC,0xD60B274,0x19734258,0x1D621775,0x4691771,0x14206B68,0x17B22DE4,0x29D5B37,0x499D};
+
+
+#endif
+
+#if CHUNK==64
+
+using namespace B480_56;
+
+// Base Bits= 56
+
+const int CURVE_Cof_I=0;
+const int CURVE_B_I= 19;
+const BIG CURVE_B= {0x13L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_Order= {0x1A08FFF0000001L,0x1E7033FF551190L,0x6ADE7EE322DDAFL,0x848FC9D0CED13AL,0x50D81729CC224L,0x1F0F05B98BB44AL,0x10010010005A0L,0x0L,0x0L};
+const BIG CURVE_Gx= {0x6760F5EBE3CCD4L,0xEFE2DAED9F4564L,0x783F08EBA1FCC1L,0xC6F8D95AF88134L,0xDCA8D1AE2D8477L,0x9077586CEFE4BFL,0x8B7FEA5D99BC1DL,0x17CAF9486DE9E1L,0x1AB2BE34L};
+const BIG CURVE_Gy= {0xCBA5CAD21E5245L,0x6D6608C55DF6C4L,0xB3ED294F39746BL,0x145824920FF3C8L,0x63AA4FD63E5A64L,0x492A2BF79CE00FL,0x66A7A4529FF79AL,0x6C53E477B861CAL,0x47FCB70CL};
+const BIG CURVE_HTPC= {0x1L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+
+const BIG CURVE_Bnx= {0x100020011FF80L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_Cof= {0x100020011FF7FL,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+//const BIG CURVE_Cof= {0xC1FFBFF9F415ABL,0x5556AAB7FFL,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+
+const BIG CURVE_Pxaa= {0xE2935374E24678L,0xC34342582408BL,0xF765CCDEFC69EL,0xC33AAD2888D7F9L,0x7FD2458967473AL,0x52908ED55CBAB3L,0x786671EB14AB88L,0xA3EC96077958C8L,0x959DE53L};
+const BIG CURVE_Pxab= {0x7F9EBAFFB099B8L,0x3775A012A47038L,0x6B5D1B1FC23856L,0x7F0A26A730F9E3L,0x1C38F85DB2A5CAL,0x76A753E17E6926L,0x2D39D1BE5AD0F9L,0x31733DFC651E4CL,0x3B0DED08L};
+const BIG CURVE_Pxba= {0xA1CDE711AD15D3L,0x853178DF6E16EDL,0x64BF43EA3E09A1L,0x2D8CD6DE566B2FL,0xF21C26C74FDB8BL,0x47BCC89E3F6B1EL,0x3FE2103F329F00L,0x4E507AF2AA28C3L,0x3EC27FADL};
+const BIG CURVE_Pxbb= {0x7AB2875EE0F480L,0x4556E43D6C4B8CL,0xFB22DF80E1CB99L,0xF70FD0122F1FFDL,0xD5DB25698EF5EAL,0x4805CE1AF1BA3AL,0x1DA7CE2E465CB7L,0xCA0799F7E65855L,0xA5B38DBL};
+const BIG CURVE_Pyaa= {0x86499314781AA0L,0x609DA303B70AB1L,0xA52A6145FC44BBL,0x462E04C42A3124L,0xC383AE19AE68BBL,0xA1B34F6BE4FCADL,0x198F901AD0BF4L,0x736C094362CED0L,0x5057F35DL};
+const BIG CURVE_Pyab= {0xBBEC57EEAE08FAL,0x78774BAA5F96ADL,0x64CAF099A42CA0L,0xC89FBBCCF70478L,0x6B720FEF855245L,0x97F916376F7B3EL,0x60F5587B5DF7E1L,0x61EE89637816BDL,0x2CE2B496L};
+const BIG CURVE_Pyba= {0x730276A5F0CC41L,0xF89325530AA1F5L,0xD9CD879AF8A147L,0xEE53E8A9FE2880L,0x420F07D3715390L,0x4C15D519B71F3AL,0x1A39DD3CB5B9B1L,0x3EE631A6BE39F8L,0x18070466L};
+const BIG CURVE_Pybb= {0xF1B2E6515C1CAEL,0xD40D355B0988DCL,0xC243FDC38A7772L,0x5D338136B675CAL,0x164E8A1D72FCDFL,0xBBAE5CD0961ACL,0xD6D04691771EB1L,0xD9BDEC8B792840L,0x499D14EAL};
+
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_BLS48286.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_BLS48286.cpp
new file mode 100644
index 0000000..b7cff1d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_BLS48286.cpp
@@ -0,0 +1,102 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "ecp_BLS48286.h"
+
+namespace BLS48286 {
+/* Curve BLS48286 - Pairing friendly BLS curve */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B288_29;
+
+// Base Bits= 29
+
+const int CURVE_Cof_I= 62958;
+const BIG CURVE_Cof= {0xF5EE,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const int CURVE_B_I= 10;
+const BIG CURVE_B= {0xA,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Order= {0x1D612C81,0x1E208D97,0x1CA5C07F,0x11E51045,0x1E4FE229,0x13154A7D,0x127B79AC,0x1602A6BF,0x86BC9E,0x0};
+const BIG CURVE_Gx= {0x95D59E0,0x44BF518,0x1BEE8577,0x1B2E8EB9,0xE84D19D,0xA23A0D2,0x103C1301,0x111F68ED,0x13D120DB,0x34B921};
+const BIG CURVE_Gy= {0x10ABEB43,0x177B4FCB,0x38F8BB,0x6F9CD6B,0x1B0AC1F2,0x1846F729,0x1E5E6A8C,0x5AF112F,0xA1E656E,0x101C720};
+const BIG CURVE_HTPC= {0x1,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+
+const BIG CURVE_Bnx= {0xF5EF,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Pxaaa= {0x56106B5,0x20B1A4C,0x113303FA,0x187639D9,0x1D9F51AC,0xA96D657,0x132BADEA,0x1A544F60,0x531C71,0x11567EA};
+const BIG CURVE_Pxaab= {0x96D1A55,0xF668DEC,0xE2476A7,0x4EE30AA,0x1EF56B94,0x5192C97,0x121CF932,0x14B1A4A1,0x196B5C85,0xC6DDCC};
+const BIG CURVE_Pxaba= {0x7D7A35E,0x408D1D3,0x1162980E,0x1F5E9D19,0x12AF41C9,0xCD2835A,0x17875370,0x62F5C57,0x15DE0A7C,0x541496};
+const BIG CURVE_Pxabb= {0x2F023E8,0x14742906,0xCF4B428,0x3236B9E,0x1B62D89F,0x192E7AEF,0x1E4BA079,0x19B17763,0x155FAC94,0x1015F06};
+const BIG CURVE_Pxbaa= {0xF14CB9B,0x5CC6ADC,0x18955362,0x142FAC5F,0x11B96A21,0x18F7B6AA,0x96591F1,0xC5096A4,0x9A1E3F7,0xBA939B};
+const BIG CURVE_Pxbab= {0xB60DD54,0x1FB59436,0x1C68910E,0x10A65726,0x6BE9C0B,0x1C6AA6BF,0x14DD8358,0x1E68D885,0x85E9D59,0x880F52};
+const BIG CURVE_Pxbba= {0x19D776DA,0x1052D855,0x844D7E8,0xCAE4EC2,0x4ADABAA,0x120A2C5F,0x192AB537,0x3F9DEC1,0xE261FE4,0x7B037E};
+const BIG CURVE_Pxbbb= {0x8B50A8E,0x19FF11C1,0x18273AD7,0xEAA9DE4,0x1EC9A57,0x1670C91D,0x300009C,0xACD8A2D,0x6920D19,0xF85987};
+const BIG CURVE_Pyaaa= {0x7E988BE,0x1366AFEB,0x5E2F3B8,0x1FCBDF1D,0x114E8B31,0x1CD92A27,0x1A53FC0,0xAAF8FE7,0xDA962CD,0x10F87C6};
+const BIG CURVE_Pyaab= {0xDF11B92,0x1BC2B368,0x1AF17821,0x6663003,0xDB40CB8,0x20094F8,0x1856186E,0x1528744B,0x1EC6FED7,0x700E0F};
+const BIG CURVE_Pyaba= {0xBFDD06A,0x3E7D33D,0x13F96495,0x179B5611,0x12EB8E64,0xD7054C6,0xD7BFC95,0x145B3D76,0x18C3D6BE,0x9607FD};
+const BIG CURVE_Pyabb= {0x188A47F4,0x19EEFE9B,0x41ACCA2,0x12BF346C,0x11F157D1,0x19429C28,0x14D4ACD2,0x743BB7B,0x55BDFFF,0xAB418F};
+const BIG CURVE_Pybaa= {0x5E39E77,0x1B76DB9A,0x54E3132,0x190321FF,0x5119324,0x123E6F79,0x1064FB7D,0x1D69EBDE,0xAA01884,0x39C720};
+const BIG CURVE_Pybab= {0x164975C6,0x194140A1,0xA2302C0,0x1C495B39,0x613723B,0xB4D86D7,0x1A6F8686,0x7238A06,0x6896E24,0x9B2C3B};
+const BIG CURVE_Pybba= {0x1BF2D7C,0x1E99CD5E,0xEA89102,0xE27DE36,0x13837F1B,0xA2D04CE,0x23E06D8,0x18BDC695,0x175143C9,0xFD8541};
+const BIG CURVE_Pybbb= {0x51130A6,0x154D068F,0x18954F6A,0x173CE106,0x7C687EE,0xD23B3B5,0xB58CC3B,0x1342EEF6,0xDC6AC9E,0xC9F9BC};
+
+
+#endif
+
+#if CHUNK==64
+
+using namespace B288_60;
+
+// Base Bits= 60
+
+const int CURVE_Cof_I= 62958;
+const BIG CURVE_Cof= {0xF5EEL,0x0L,0x0L,0x0L,0x0L};
+const int CURVE_B_I= 10;
+const BIG CURVE_B= {0xAL,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_Order= {0xFC411B2FD612C81L,0x98F28822F29701FL,0xB262A94FBE4FE22L,0x9EB01535FC9EDE6L,0x86BCL};
+const BIG CURVE_Gx= {0xC897EA3095D59E0L,0xDD97475CEFBA15DL,0x544741A4E84D19L,0xDB88FB476C0F04CL,0x6972433D120L};
+const BIG CURVE_Gy= {0xEEF69F970ABEB43L,0x237CE6B580E3E2EL,0x3308DEE53B0AC1FL,0x6E2D78897F979AAL,0x2038E40A1E65L};
+const BIG CURVE_HTPC= {0x1L,0x0L,0x0L,0x0L,0x0L};
+
+const BIG CURVE_Bnx= {0xF5EFL,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_Pxaaa= {0x8416349856106B5L,0xCC3B1CECC4CC0FEL,0xA952DACAFD9F51AL,0x71D2A27B04CAEB7L,0x22ACFD40531CL};
+const BIG CURVE_Pxaab= {0xDECD1BD896D1A55L,0x427718553891DA9L,0xC8A32592FEF56B9L,0x85A58D250C873E4L,0x18DBB9996B5CL};
+const BIG CURVE_Pxaba= {0x8811A3A67D7A35EL,0x9FAF4E8CC58A603L,0xC19A506B52AF41CL,0x7C317AE2BDE1D4DL,0xA8292D5DE0AL};
+const BIG CURVE_Pxabb= {0x28E8520C2F023E8L,0xF191B5CF33D2D0AL,0xE725CF5DFB62D89L,0x94CD8BBB1F92E81L,0x202BE0D55FACL};
+const BIG CURVE_Pxbaa= {0x8B98D5B8F14CB9BL,0x1A17D62FE2554D8L,0xC71EF6D551B96A2L,0xF76284B52259647L,0x17527369A1E3L};
+const BIG CURVE_Pxbab= {0xBF6B286CB60DD54L,0xB8532B9371A2443L,0x638D54D7E6BE9C0L,0x59F346C42D3760DL,0x1101EA485E9DL};
+const BIG CURVE_Pxbba= {0x20A5B0AB9D776DAL,0xA657276121135FAL,0xDE41458BE4ADABAL,0xE41FCEF60E4AAD4L,0xF606FCE261FL};
+const BIG CURVE_Pxbbb= {0xF3FE23828B50A8EL,0x77554EF2609CEB5L,0x72CE1923A1EC9A5L,0x19566C5168C0002L,0x1F0B30E6920DL};
+const BIG CURVE_Pyaaa= {0x26CD5FD67E988BEL,0x1FE5EF8E978BCEEL,0x39B2544F14E8B3L,0xCD557C7F38694FFL,0x21F0F8CDA962L};
+const BIG CURVE_Pyaab= {0x778566D0DF11B92L,0x83331801EBC5E08L,0xB840129F0DB40CBL,0xD7A943A25E15861L,0xE01C1FEC6FEL};
+const BIG CURVE_Pyaba= {0x47CFA67ABFDD06AL,0x4BCDAB08CFE5925L,0x55AE0A98D2EB8E6L,0xBEA2D9EBB35EFF2L,0x12C0FFB8C3D6L};
+const BIG CURVE_Pyabb= {0xB3DDFD3788A47F4L,0x195F9A36106B328L,0x4B28538511F157DL,0xFF3A1DDBDD352B3L,0x156831E55BDFL};
+const BIG CURVE_Pybaa= {0xB6EDB7345E39E77L,0x4C8190FF9538C4CL,0xF647CDEF2511932L,0x84EB4F5EF4193EDL,0x738E40AA018L};
+const BIG CURVE_Pybab= {0x3282814364975C6L,0xBE24AD9CA88C0B0L,0x1969B0DAE613723L,0x24391C50369BE1AL,0x13658766896EL};
+const BIG CURVE_Pybba= {0xBD339ABC1BF2D7CL,0xB713EF1B3AA2440L,0x6145A099D3837F1L,0xC9C5EE34A88F81BL,0x1FB0A8375143L};
+const BIG CURVE_Pybbb= {0xAA9A0D1E51130A6L,0xEB9E708362553DAL,0xEDA47676A7C687EL,0x9E9A1777B2D6330L,0x193F378DC6ACL};
+
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_BLS48556.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_BLS48556.cpp
new file mode 100644
index 0000000..efce0cb
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_BLS48556.cpp
@@ -0,0 +1,107 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "ecp_BLS48556.h"
+
+namespace BLS48556 {
+/* Curve BLS48556 - Pairing friendly BLS curve */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B560_29;
+
+// Base Bits= 29
+
+const int CURVE_Cof_I=0;
+const int CURVE_B_I= 17;
+const BIG CURVE_B= {0x11,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Order= {0x1,0x17FFF800,0xA769C21,0x8AA813C,0x2029C21,0xA68F58B,0xB6307F4,0x1184DA51,0x6DFED78,0x1A3C85E9,0x571037B,0x1637F1F9,0x1C465FB0,0x98354B9,0x118DF17A,0x1422355D,0x43BF73E,0x6,0x0,0x0};
+const BIG CURVE_Gx= {0x5D71D33,0x1943697B,0x18CB783F,0x1B00AA9F,0x1711EE0B,0x7F80B23,0x129FD8CC,0x1345E03F,0x9A80F66,0x7038173,0xC056511,0x142801F5,0x42B2C3A,0x1AF09869,0x7924166,0x8381264,0x957EDD7,0xBACAEDC,0xA27A4A1,0x13};
+const BIG CURVE_Gy= {0xA6ED83A,0x14D2D9FF,0xA29C33D,0x1B8972A9,0x6958677,0x19C8F547,0x1DED7E3E,0x14F9E3DC,0x18FB7229,0x27171C0,0x1551E32D,0xE6184CC,0x6260E3C,0x733D204,0x579C437,0x1534665C,0x2B3349D,0x3162FD7,0xB634253,0x1};
+const BIG CURVE_HTPC= {0x1,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+
+const BIG CURVE_Bnx= {0x1DE40020,0x3,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Cof= {0x1DE4001F,0x3,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+//const BIG CURVE_Cof= {0x1F12ABEB,0x516887B,0x5,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+
+const BIG CURVE_Pxaaa= {0x923CE4A,0x14697474,0xAE04F4A,0x17AE205A,0x1313A20C,0x10B2EC50,0x18DF074F,0x15FE3FE8,0x7C90B98,0x959BF85,0xE57BD37,0x14376C96,0xBF57375,0xE20B625,0x12EE2172,0x1CBBCE85,0x1A5D9487,0xD0E024B,0x195E3602,0x1C};
+const BIG CURVE_Pxaab= {0xC0A1BE1,0x138E6E2D,0x1DF5FDC,0x151FC760,0x33972C5,0x56AA3C2,0x2491D8C,0x115B9FD7,0x140A11FA,0x1873AE35,0x1F259C26,0x74B0647,0x12D18B04,0x4672431,0x1C27F419,0x1CAA4D35,0x18DB48B6,0x13A54BDA,0x5080497,0x5};
+const BIG CURVE_Pxaba= {0x170C5DC4,0x11D39263,0x16B3BCB6,0x152C95BB,0x19BEC736,0x8849A12,0x49AB2A8,0xC7162D3,0xC58CD55,0x15C2659,0x11EE8B90,0xB40CAFC,0xE233167,0x7BEC8BE,0x129335BD,0x151C7DBB,0x78B689B,0x1B6B8EED,0x14BFBE3D,0x16};
+const BIG CURVE_Pxabb= {0x1A64B740,0x6B14B34,0x12481578,0x23FA931,0x323ADD1,0x206B82A,0xD789E1B,0x1FCFA666,0x1F4EEA7,0xF1E39E2,0x1968610,0xAF3EBD3,0x590D3B,0xDA0C35A,0x17306AAF,0xCF9DD2B,0x3F63B1A,0x96FF2F9,0xE102A76,0x12};
+const BIG CURVE_Pxbaa= {0x12F1E01F,0xDD8630B,0x12C29802,0x186239A6,0x19218788,0x4C87D1,0x16AE2501,0x775C076,0x870C80B,0x1A394429,0x1637D478,0x4A420E8,0x1C3AD4D4,0x10E5E713,0x111E6AD5,0x514FCF0,0x7CC49D3,0xC678A2,0x1787BDFD,0x1B};
+const BIG CURVE_Pxbab= {0x637383D,0x1851C11C,0x661F866,0x14404A7F,0x15D3D212,0x9AE28F6,0x8051F25,0x1E1CE2BF,0x137D882F,0xB231CEB,0xA8DB8FC,0x18957645,0x5E54DA8,0x1FF41C44,0x1A297414,0x17E1CBC5,0x1014F91F,0x4282AB7,0xB6CE9E3,0x10};
+const BIG CURVE_Pxbba= {0x1711939C,0xB41ED9E,0x69066BA,0x137CA3AD,0xCF2F6C0,0x5E6DAB9,0x2CE1323,0x946E448,0xF353D1C,0x14D9919F,0x46B7046,0x1A12015,0x3D6070,0x18C3E8D2,0x1F23BA45,0x1F1A337C,0x435A9CC,0x6CA1DF1,0x8A9CE1,0x15};
+const BIG CURVE_Pxbbb= {0x56F4899,0x196A0854,0xA959750,0x38A3D72,0x190BC9BC,0x145752BC,0x1E9E26DA,0x1403F88,0x71895E3,0x14162F5D,0x19FEC5FF,0x14190B16,0x7597C,0x19A3CF18,0x26A4B00,0x113D1BB6,0x7857A32,0xE0B78AB,0x1DD51E0F,0x1B};
+const BIG CURVE_Pyaaa= {0x14137844,0x1704BE7D,0x1FD3CCDD,0x189D8C93,0x1C768851,0xF5C37D5,0xE29C659,0x20AB1C1,0xF8896E0,0x1E08663E,0x1D1D539C,0x117E1C47,0x156CDD39,0x161F1017,0x143E8C72,0x174B22FD,0x18706190,0x49AA47E,0x19BB42E1,0xE};
+const BIG CURVE_Pyaab= {0xDC83190,0x12F19247,0x1AA26424,0x15D55E88,0xC418D32,0xB0E91DD,0x47CBFF7,0x2D992C1,0xDE03C1F,0x7694AE5,0x5C741A2,0x1D423AC6,0x5E02B9E,0x1E903F10,0x4EA6513,0x433A1F1,0x8EFA1C4,0xED54713,0x1E72CE4F,0x4};
+const BIG CURVE_Pyaba= {0x1985C0D,0xEE2FE82,0x64770FA,0x11A809B4,0x1483ACE9,0x18BCD2FA,0x171F32C,0x1612D58D,0x1E658341,0x1CBE2201,0x186E971,0x73F0E1,0xB0A5F40,0xAC90FB0,0x1635E008,0x237498B,0x1F3140D6,0xBF789A9,0x1166F259,0x1A};
+const BIG CURVE_Pyabb= {0x159D42F8,0x1B7F0540,0x45895D7,0x14875FA2,0x1E9E7F2B,0x10139D87,0x10F3FD7D,0x11D3717F,0x69E5006,0xF9BB3C4,0x13C9ED8D,0x16516DA,0x102F51DE,0x2725FEC,0x1F125B66,0xFFC324,0x1ED80731,0x1C16C4D,0x383AAA8,0x14};
+const BIG CURVE_Pybaa= {0x1F38039F,0x6A8959C,0x13C68984,0x11DD12AF,0x58093CF,0x1C8550A0,0xFFA1622,0xFF85979,0x1F2ABB75,0x18862E62,0x1EB6A2C9,0x1EC80B64,0x8EC2F18,0xE7BF713,0xC36B65A,0x19C5DD89,0x18A1D1AB,0xF772C8D,0xC11927C,0x5};
+const BIG CURVE_Pybab= {0x95F7865,0x134F0379,0x1CE9A0E,0x17E0EADD,0x1DACADD7,0x1B18F9F8,0x181D3943,0x186679A,0x2505BB0,0x1FDF1DC8,0x11B36A49,0x11E254E9,0xA438576,0x102B09AE,0x139984F4,0x15BC0233,0x1B6F180E,0x960562B,0x48CA65B,0x6};
+const BIG CURVE_Pybba= {0x7CC1979,0xEC1D4FB,0x1D89E6F0,0x955F38E,0x1635FDA9,0x123D8E10,0x10076209,0x494404A,0xD733D7,0x17678BCF,0x153841F9,0x10696FFD,0x5BC9FE8,0x1A20D8B2,0xE22EC9D,0x18449116,0x108C86C5,0x1B4CD720,0x34967,0x19};
+const BIG CURVE_Pybbb= {0xFC9F25B,0x7E44AB1,0xE9AB5D3,0x589F00D,0x1C9D264F,0xC7478B4,0x16B24A13,0x1D2C146B,0xEF84D9A,0xF47ECDE,0x1BFEE16A,0x1B69071E,0x11AB4C1C,0xBE9D9EF,0x390F005,0x78C8288,0x1B9BF549,0x9320730,0x3D84D97,0x14};
+
+
+#endif
+
+#if CHUNK==64
+
+using namespace B560_58;
+
+// Base Bits= 58
+
+const int CURVE_Cof_I=0;
+const int CURVE_B_I= 17;
+const BIG CURVE_B= {0x11L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_Order= {0x2FFFF0000000001L,0x11550278A769C21L,0x14D1EB162029C21L,0x2309B4A2B6307F4L,0x34790BD26DFED78L,0x2C6FE3F2571037BL,0x1306A973C465FB0L,0x28446ABB18DF17AL,0xC43BF73EL,0x0L};
+const BIG CURVE_Gx= {0x3286D2F65D71D33L,0x3601553F8CB783FL,0xFF01647711EE0BL,0x268BC07F29FD8CCL,0xE0702E69A80F66L,0x285003EAC056511L,0x35E130D242B2C3AL,0x107024C87924166L,0x17595DB8957EDD7L,0x26A27A4A1L};
+const BIG CURVE_Gy= {0x29A5B3FEA6ED83AL,0x3712E552A29C33DL,0x3391EA8E6958677L,0x29F3C7B9DED7E3EL,0x4E2E3818FB7229L,0x1CC30999551E32DL,0xE67A4086260E3CL,0x2A68CCB8579C437L,0x62C5FAE2B3349DL,0x2B634253L};
+const BIG CURVE_HTPC= {0x1L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+
+const BIG CURVE_Bnx= {0x7DE40020L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_Cof= {0x7DE4001FL,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+//const BIG CURVE_Cof= {0xA2D10F7F12ABEBL,0x5L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+
+const BIG CURVE_Pxaaa= {0x28D2E8E8923CE4AL,0x2F5C40B4AE04F4AL,0x2165D8A1313A20CL,0x2BFC7FD18DF074FL,0x12B37F0A7C90B98L,0x286ED92CE57BD37L,0x1C416C4ABF57375L,0x39779D0B2EE2172L,0x1A1C0497A5D9487L,0x3995E3602L};
+const BIG CURVE_Pxaab= {0x271CDC5AC0A1BE1L,0x2A3F8EC01DF5FDCL,0xAD5478433972C5L,0x22B73FAE2491D8CL,0x30E75C6B40A11FAL,0xE960C8FF259C26L,0x8CE48632D18B04L,0x39549A6BC27F419L,0x274A97B58DB48B6L,0xA5080497L};
+const BIG CURVE_Pxaba= {0x23A724C770C5DC4L,0x2A592B776B3BCB6L,0x110934259BEC736L,0x18E2C5A649AB2A8L,0x2B84CB2C58CD55L,0x168195F91EE8B90L,0xF7D917CE233167L,0x2A38FB7729335BDL,0x36D71DDA78B689BL,0x2D4BFBE3DL};
+const BIG CURVE_Pxabb= {0xD629669A64B740L,0x47F52632481578L,0x40D7054323ADD1L,0x3F9F4CCCD789E1BL,0x1E3C73C41F4EEA7L,0x15E7D7A61968610L,0x1B4186B40590D3BL,0x19F3BA577306AAFL,0x12DFE5F23F63B1AL,0x24E102A76L};
+const BIG CURVE_Pxbaa= {0x1BB0C6172F1E01FL,0x30C4734D2C29802L,0x990FA39218788L,0xEEB80ED6AE2501L,0x34728852870C80BL,0x94841D1637D478L,0x21CBCE27C3AD4D4L,0xA29F9E111E6AD5L,0x18CF1447CC49D3L,0x37787BDFDL};
+const BIG CURVE_Pxbab= {0x30A38238637383DL,0x288094FE661F866L,0x135C51ED5D3D212L,0x3C39C57E8051F25L,0x164639D737D882FL,0x312AEC8AA8DB8FCL,0x3FE838885E54DA8L,0x2FC3978BA297414L,0x850556F014F91FL,0x20B6CE9E3L};
+const BIG CURVE_Pxbba= {0x1683DB3D711939CL,0x26F9475A69066BAL,0xBCDB572CF2F6C0L,0x128DC8902CE1323L,0x29B3233EF353D1CL,0x342402A46B7046L,0x3187D1A403D6070L,0x3E3466F9F23BA45L,0xD943BE2435A9CCL,0x2A08A9CE1L};
+const BIG CURVE_Pxbbb= {0x32D410A856F4899L,0x7147AE4A959750L,0x28AEA57990BC9BCL,0x2807F11E9E26DAL,0x282C5EBA71895E3L,0x2832162D9FEC5FFL,0x33479E30007597CL,0x227A376C26A4B00L,0x1C16F1567857A32L,0x37DD51E0FL};
+const BIG CURVE_Pyaaa= {0x2E097CFB4137844L,0x313B1927FD3CCDDL,0x1EB86FABC768851L,0x4156382E29C659L,0x3C10CC7CF8896E0L,0x22FC388FD1D539CL,0x2C3E202F56CDD39L,0x2E9645FB43E8C72L,0x93548FD8706190L,0x1D9BB42E1L};
+const BIG CURVE_Pyaab= {0x25E3248EDC83190L,0x2BAABD11AA26424L,0x161D23BAC418D32L,0x5B3258247CBFF7L,0xED295CADE03C1FL,0x3A84758C5C741A2L,0x3D207E205E02B9EL,0x86743E24EA6513L,0x1DAA8E268EFA1C4L,0x9E72CE4FL};
+const BIG CURVE_Pyaba= {0x1DC5FD041985C0DL,0x2350136864770FAL,0x3179A5F5483ACE9L,0x2C25AB1A171F32CL,0x397C4403E658341L,0xE7E1C2186E971L,0x15921F60B0A5F40L,0x46E9317635E008L,0x17EF1353F3140D6L,0x35166F259L};
+const BIG CURVE_Pyabb= {0x36FE0A8159D42F8L,0x290EBF4445895D7L,0x20273B0FE9E7F2BL,0x23A6E2FF0F3FD7DL,0x1F37678869E5006L,0x2CA2DB53C9ED8DL,0x4E4BFD902F51DEL,0x1FF8649F125B66L,0x382D89BED80731L,0x28383AAA8L};
+const BIG CURVE_Pybaa= {0xD512B39F38039FL,0x23BA255F3C68984L,0x390AA14058093CFL,0x1FF0B2F2FFA1622L,0x310C5CC5F2ABB75L,0x3D9016C9EB6A2C9L,0x1CF7EE268EC2F18L,0x338BBB12C36B65AL,0x1EEE591B8A1D1ABL,0xAC11927CL};
+const BIG CURVE_Pybab= {0x269E06F295F7865L,0x2FC1D5BA1CE9A0EL,0x3631F3F1DACADD7L,0x30CCF3581D3943L,0x3FBE3B902505BB0L,0x23C4A9D31B36A49L,0x2056135CA438576L,0x2B78046739984F4L,0x12C0AC57B6F180EL,0xC48CA65BL};
+const BIG CURVE_Pybba= {0x1D83A9F67CC1979L,0x12ABE71DD89E6F0L,0x247B1C21635FDA9L,0x92880950076209L,0x2ECF179E0D733D7L,0x20D2DFFB53841F9L,0x3441B1645BC9FE8L,0x3089222CE22EC9DL,0x3699AE4108C86C5L,0x320034967L};
+const BIG CURVE_Pybbb= {0xFC89562FC9F25BL,0xB13E01AE9AB5D3L,0x18E8F169C9D264FL,0x3A5828D76B24A13L,0x1E8FD9BCEF84D9AL,0x36D20E3DBFEE16AL,0x17D3B3DF1AB4C1CL,0xF190510390F005L,0x12640E61B9BF549L,0x283D84D97L};
+
+
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_BLS48581.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_BLS48581.cpp
new file mode 100644
index 0000000..77258c0
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_BLS48581.cpp
@@ -0,0 +1,107 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "ecp_BLS48581.h"
+
+namespace BLS48581 {
+/* Curve BLS48581 - Pairing friendly BLS curve */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B584_29;
+
+//*** rom curve parameters *****
+// Base Bits= 29
+// Ate Bits= 33
+// G2 Table size= 36
+
+const int CURVE_Cof_I= 0;
+const BIG CURVE_Cof= {0x382,0xA,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const int CURVE_B_I= 1;
+const BIG CURVE_B= {0x1,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Order= {0xD671C01,0x52FF37E,0x10936846,0x1CB328CF,0x103C4CCB,0x1E682B11,0x5AA171,0x6989924,0x741969D,0xB961737,0xFEB5AF2,0x16797C00,0x1387A3F0,0x6B631A,0x13305857,0xBC46753,0x925E288,0x11C37C5,0x0,0x0,0x0};
+const BIG CURVE_Gx= {0x115AF640,0x1E743991,0x79B630E,0x9B4BA74,0x11786CB7,0x1ED9B458,0x1BAF6F15,0xBB0B246,0x4584766,0x14EFB7CB,0x1154151A,0x1F73EEA8,0xBDBAEDF,0x3467B0D,0x15F83A1A,0xC1BC7E4,0x1F1E93F8,0x1D795B9E,0xB0D03CA,0x55EB36F,0x0};
+const BIG CURVE_Gy= {0x2587A70,0xDDAEF1F,0x49AD5DB,0x6F5DEF7,0x11B2E35F,0x1BE143B6,0x8BD21FD,0xB0987DE,0x1E80F678,0x1CC57729,0xEDEFBFE,0x16E41DEF,0x1279DD41,0x52974C8,0xF27BFAE,0x149114AA,0xD1FB398,0xFC359D1,0x1D94C7E4,0x19DFB489,0x0};
+const BIG CURVE_HTPC= {0x31193EC,0x1C9F85F0,0x1D6090C,0x5112C88,0x10D4620C,0x1F255473,0x1F5583B6,0x4F7AABD,0xCD0706B,0x14B125F7,0xECD8492,0x4D5AF8A,0xC755E26,0x2D4C018,0xB0B7761,0x1369CD4C,0x1FD42938,0x782EC54,0x17716BE5,0x1246919A,0x0};
+
+const BIG CURVE_Bnx= {0x381,0xA,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+
+const BIG CURVE_Pxaaa= {0xCE8BFAB,0x1A7E85A5,0x85537B0,0xF2ECC64,0x1510317B,0x6C0248F,0x140C01,0x140C25E8,0x281A63C,0x168D4621,0x1BFDE6EA,0x1DE2AD88,0x64DB3A2,0xDE65BEF,0x1F1C0D13,0x1BD7577D,0x45A2775,0x11C11BFD,0x9E1C792,0xBAC2BB3,0x0};
+const BIG CURVE_Pxaab= {0x16B47C57,0x134D9B33,0x1E850FC5,0xAAD4035,0x30FFD75,0x1186CBCB,0x13C30F1D,0x1FF4C4A0,0x214A76A,0x15FF6F8B,0xE50E802,0xFE9C38,0xF6DA123,0x111F4A93,0x1B660385,0x1D164576,0x86ABC07,0x9034D87,0x13889614,0xF892E7D,0x0};
+const BIG CURVE_Pxaba= {0x55A3E6A,0x440AB65,0xCFC2D19,0x1E99BDAD,0x1D5FEA8E,0x1EFDDC3C,0x157C0A32,0x1E1A54DA,0xFFAE766,0xDE8C921,0x18058707,0x156B56D0,0x16957CCB,0x1BE53D36,0x1B2A6B88,0x178E7514,0x1853AD83,0x70D9750,0x663C4CD,0x3F998E0,0x0};
+const BIG CURVE_Pxabb= {0x1B7FEAFE,0xD3819E5,0x2F0FC2,0x171969D,0xCA5231,0x292BE10,0x51A30C7,0x16364F37,0xE6EC143,0x11F0E3BB,0x862A57D,0x1F17C198,0x1B92A393,0x1F2C10DB,0x16B18BC,0x17FD1EB3,0x12954D4,0x2E3C6C0,0x973AD86,0x17C44318,0x0};
+const BIG CURVE_Pxbaa= {0x13F8CCE5,0x1CE1D0E2,0x7532EDC,0x16BEE8D9,0x1AA80C65,0xAFE0C44,0x49D3EB5,0x9255CB1,0xC10B2EF,0x40CCEAD,0x6607E79,0xA70CD3,0x1F0E7C58,0x15AB3AF,0x1D742C59,0xC600F8C,0x4CAA9DD,0x1D1E2CC7,0x2CD644,0x717238C,0x0};
+const BIG CURVE_Pxbab= {0xA3C093A,0x10026C8A,0x138CDC3C,0x12C1221F,0xF097FC7,0xF8BBB09,0x175D656A,0x1738162B,0x1EB57B40,0x1AE944CB,0x77D8E0,0x6E8303,0x58677BB,0xBBD1E8D,0xD773BC2,0x111EF71E,0x1E4ECDA0,0x101F8988,0x1FAC1CE1,0x192D8EF2,0x0};
+const BIG CURVE_Pxbba= {0x750E057,0xB03F30,0x170CD539,0x16B61C40,0x2D63334,0x1F219261,0xCAAB472,0xBDF9E68,0x10FD0CAA,0x9D89E76,0x13BC47CA,0x16F4893,0x1908BA2C,0x1C295B6D,0x106CE744,0x1CCC1BD4,0x98908AE,0x1F80CBD2,0x118187B8,0x1736F2A3,0x0};
+const BIG CURVE_Pxbbb= {0x1BC6AE34,0x10CED007,0x5F0FE13,0x15E5F93D,0x1FC44E56,0x1EB575FC,0x116151E6,0x16FC561A,0x164A7190,0x1F94E7F9,0x1E33F2A4,0xE514FF3,0xF741719,0x3DA908E,0xA77BEBD,0x563CBAF,0xC4F4AAA,0x2941312,0xBECAF7B,0x104FAB84,0x0};
+const BIG CURVE_Pyaaa= {0xD2D7971,0x1F6E9FF2,0xB03FCC8,0xA025562,0x6D65904,0x15FBBF75,0x18F05666,0xDB15CA2,0xD90F733,0x17D13BA4,0x24188D6,0x86BF556,0x1B39EBFC,0x12BBF379,0x108E0166,0x4972316,0x16452F30,0xFD24B90,0x1B0DD6D7,0x1D6A66A,0x0};
+const BIG CURVE_Pyaab= {0x16CD5665,0xA38EDC9,0x1FF1EC44,0x16846A4B,0xE2E588,0x1D04BEBB,0x1877484B,0x11255649,0x12C5C3D1,0x121D8F8C,0xBEC25AC,0x65F97E7,0x1D729647,0xF37DD00,0x108AE8C9,0x1B856EB4,0x11815FCA,0xA26D329,0x5E783FC,0x509B8EB,0x0};
+const BIG CURVE_Pyaba= {0xA2A8474,0x1995293,0xEE3F79A,0x18F88DF8,0x52269CB,0x9AEA8D3,0x178BC307,0x194652BC,0x11515536,0xE874820,0x17DF5726,0xE0A288E,0x13A480D3,0x16AD88CE,0x1140C085,0x13DE585F,0x17036766,0x1F210F7D,0x17402148,0x166D4403,0x0};
+const BIG CURVE_Pyabb= {0x841589D,0x1109ED49,0x194CDCC5,0x7B17143,0x5E578FB,0x1ED281F7,0xE84359E,0xEE84EE1,0xDCED281,0x199FD20,0xB226C89,0x245A4E8,0xB0E710E,0x7711EEC,0x1B4CD837,0x563859B,0x1BD47876,0x144111FD,0x1887B701,0x15D84B48,0x0};
+const BIG CURVE_Pybaa= {0x2E50137,0x3C18FCC,0x13DE90FD,0xAFFBBBF,0x1137B088,0x9ACA2E,0x13D67D0C,0x9CA256C,0x8A1E2CA,0x111C66E7,0x16171DFE,0x2530AFD,0x159805F1,0xEC9DAD4,0x11506D0F,0xB44AA9B,0x1A5A8832,0x148B281F,0x88EA711,0x1A413AB4,0x0};
+const BIG CURVE_Pybab= {0xF90BEE4,0x776E2C6,0x1B3CE965,0xB3DB044,0x12B679DA,0xCC6553,0xE78EABF,0xF8301A2,0x1F6824F4,0x6138420,0xA0D083A,0x156EA09F,0x182E2055,0x1915AC4E,0x159BAC59,0x17208435,0x1D5AD537,0x1289E99C,0x115CDADE,0xFA1A06E,0x0};
+const BIG CURVE_Pybba= {0x1EB23986,0xA0FD757,0x6A98ACF,0x110802FB,0x13DCCC9E,0x7D31CFA,0x62D6ED0,0x118E964C,0x122C1FAB,0x11D14327,0x63D096B,0x10334DBF,0x15F14E4C,0xD8320A,0xD93F021,0x1F1400DE,0x1DFDD17A,0x112E1682,0x46F997A,0x112CECF0,0x0};
+const BIG CURVE_Pybbb= {0x132718B6,0x133FFE5B,0x1A71575,0x158CDD08,0x13F748E5,0x6C62559,0x1505CC0,0x7D8E324,0x1E1AD033,0x14E18F4B,0xCE8FE39,0x1D95352A,0x149B6EF8,0x728643A,0x1C501AFA,0x36BC0D1,0x7E84F98,0x9C9D2E0,0x1FE240A7,0x6BC4A49,0x0};
+
+#endif
+
+#if CHUNK==64
+
+using namespace B584_60;
+
+// Base Bits= 60
+// Ate Bits= 33
+// G2 Table size= 36
+
+const int CURVE_Cof_I= 0;
+const BIG CURVE_Cof= {0x140000382L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const int CURVE_B_I= 1;
+const BIG CURVE_B= {0x1L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_Order= {0x8A5FE6FCD671C01L,0xBE599467C24DA11L,0xC7CD0562303C4CCL,0x9D34C4C92016A85L,0xBC972C2E6E74196L,0x3F0B3CBE003FAD6L,0x615C0D6C635387AL,0xE2885E233A9CCC1L,0x2386F8A925L,0x0L};
+const BIG CURVE_Gx= {0xBCE8732315AF640L,0x74DA5D3A1E6D8C3L,0x57DB368B11786CBL,0x665D859236EBDBCL,0x46A9DF6F9645847L,0xEDFFB9F75445505L,0xE86868CF61ABDBAL,0x93F860DE3F257E0L,0x40F2BAF2B73DF1EL,0x2AF59B7AC3L};
+const BIG CURVE_Gy= {0xDBB5DE3E2587A70L,0xF37AEF7B926B576L,0xF77C2876D1B2E35L,0x78584C3EF22F487L,0xFFB98AEE53E80F6L,0xD41B720EF7BB7BEL,0xFEB8A52E991279DL,0xB398A488A553C9EL,0x31F91F86B3A2D1FL,0xCEFDA44F65L};
+const BIG CURVE_HTPC= {0x393F0BE031193ECL,0xC28896440758243L,0xDBE4AA8E70D4620L,0x6B27BD55EFD560EL,0x24A9624BEECD070L,0xE2626AD7C53B361L,0xDD845A98030C755L,0x29389B4E6A62C2DL,0x5AF94F05D8A9FD4L,0x92348CD5DCL};
+const BIG CURVE_Bnx= {0x140000381L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+
+const BIG CURVE_Pxaaa= {0x34FD0B4ACE8BFABL,0xB79766322154DECL,0x4D80491F510317L,0x3CA0612F4005030L,0xBAAD1A8C42281A6L,0x3A2EF156C46FF79L,0x344DBCCB7DE64DBL,0x2775DEBABBEFC70L,0x71E4A38237FA45AL,0x5D615D9A78L};
+const BIG CURVE_Pxaab= {0x669B36676B47C57L,0x5556A01AFA143F1L,0x7630D979630FFD7L,0x6AFFA62504F0C3CL,0xABFEDF16214A7L,0x12307F4E1C3943AL,0xE1623E9526F6DAL,0xBC07E8B22BB6D98L,0x258512069B0E86AL,0x7C4973ECE2L};
+const BIG CURVE_Pxaba= {0x488156CA55A3E6AL,0xEF4CDED6B3F0B46L,0xCBDFBB879D5FEA8L,0x66F0D2A6D55F028L,0xC1DBD19242FFAE7L,0xCCBAB5AB6860161L,0xAE237CA7A6D6957L,0xAD83BC73A8A6CA9L,0xF1334E1B2EA1853L,0x1FCCC70198L};
+const BIG CURVE_Pxabb= {0x9A7033CBB7FEAFEL,0x10B8CB4E80BC3F0L,0x1C5257C200CA523L,0x43B1B279B9468C3L,0x5F63E1C776E6EC1L,0x393F8BE0CC218A9L,0x62F3E5821B7B92AL,0x54D4BFE8F5985ACL,0xEB6185C78D80129L,0xBE2218C25CL};
+const BIG CURVE_Pxbaa= {0x39C3A1C53F8CCE5L,0x5B5F746C9D4CBB7L,0xD55FC1889AA80C6L,0xEF492AE589274FAL,0x9E48199D5AC10B2L,0xC5805386699981FL,0xB1642B5675FF0E7L,0xA9DD63007C675D0L,0x35913A3C598E4CAL,0x38B91C600BL};
+const BIG CURVE_Pxbab= {0x2004D914A3C093AL,0x7960910FCE3370FL,0xA9F177612F097FCL,0x40B9C0B15DD7595L,0x3835D28997EB57BL,0x7BB037418181DF6L,0xEF0977A3D1A5867L,0xCDA088F7B8F35DCL,0x738603F1311E4EL,0xC96C7797EBL};
+const BIG CURVE_Pxbba= {0x41607E60750E057L,0x4B5B0E205C3354EL,0xCBE4324C22D6333L,0xAA5EFCF3432AAD1L,0xF293B13CED0FD0CL,0xA2C0B7A449CEF11L,0x9D13852B6DB908BL,0x8AEE660DEA41B3L,0x61EE3F0197A4989L,0xB9B7951C60L};
+const BIG CURVE_Pxbbb= {0xE19DA00FBC6AE34L,0x6AF2FC9E97C3F84L,0x9BD6AEBF9FC44E5L,0x90B7E2B0D458547L,0xA93F29CFF364A71L,0x719728A7F9F8CFCL,0xFAF47B5211CF741L,0x4AAA2B1E5D7A9DEL,0x2BDEC5282624C4FL,0x827D5C22FBL};
+const BIG CURVE_Pyaaa= {0x3EDD3FE4D2D7971L,0x45012AB12C0FF32L,0x9ABF77EEA6D6590L,0x336D8AE5163C159L,0x35AFA27748D90F7L,0xBFC435FAAB09062L,0x59A577E6F3B39EL,0x2F3024B918B4238L,0x75B5DFA49721645L,0xEB53356C3L};
+const BIG CURVE_Pyaab= {0x1471DB936CD5665L,0x8B423525FFC7B11L,0x2FA097D760E2E58L,0xD1892AB24E1DD21L,0x6B243B1F192C5C3L,0x64732FCBF3AFB09L,0xA325E6FBA01D729L,0x5FCADC2B75A422BL,0xE0FF144DA653181L,0x284DC75979L};
+const BIG CURVE_Pyaba= {0x8332A526A2A8474L,0xBC7C46FC3B8FDE6L,0x1D35D51A652269CL,0x36CA3295E5E2F0CL,0xC99D0E904115155L,0xD370514475F7D5L,0x216D5B119D3A48L,0x67669EF2C2FC503L,0x8523E421EFB703L,0xB36A201DD0L};
+const BIG CURVE_Pyabb= {0x6213DA92841589DL,0xB3D8B8A1E533731L,0x7BDA503EE5E578FL,0x817742770BA10D6L,0x224333FA40DCED2L,0x10E122D2742C89BL,0x60DCEE23DD8B0E7L,0x78762B1C2CDED33L,0xEDC0688223FBBD4L,0xAEC25A4621L};
+const BIG CURVE_Pybaa= {0x47831F982E50137L,0x857FDDDFCF7A43FL,0x30135945D137B08L,0xCA4E512B64F59F4L,0x7FA238CDCE8A1E2L,0x5F1129857ED85C7L,0xB43DD93B5A95980L,0x88325A2554DC541L,0xA9C46916503FA5AL,0xD209D5A223L};
+const BIG CURVE_Pybab= {0x4EEDC58CF90BEE4L,0xA59ED8226CF3A59L,0xFC198CAA72B679DL,0xF47C180D139E3AAL,0xE8C270841F6824L,0x55AB7504FA8342L,0xB16722B589D82E2L,0xD537B90421AD66EL,0x36B7A513D339D5AL,0x7D0D037457L};
+const BIG CURVE_Pybba= {0xD41FAEAFEB23986L,0xE884017D9AA62B3L,0x40FA639F53DCCC9L,0xAB8C74B2618B5BBL,0x5AE3A2864F22C1FL,0xE4C819A6DF98F42L,0xC0841B064155F14L,0xD17AF8A006F364FL,0xE65EA25C2D05DFDL,0x896767811BL};
+const BIG CURVE_Pybbb= {0x667FFCB732718B6L,0x5AC66E84069C55DL,0xD8C4AB33F748EL,0x333EC7192054173L,0x8E69C31E97E1AD0L,0xEF8ECA9A9533A3FL,0x6BE8E50C87549B6L,0x4F981B5E068F140L,0x9029D393A5C07E8L,0x35E2524FF8L};
+
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_BN158.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_BN158.cpp
new file mode 100644
index 0000000..4dd5e9b
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_BN158.cpp
@@ -0,0 +1,82 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "ecp_BN158.h"
+
+namespace BN158 {
+
+/* Curve BN158  */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B160_28;
+
+const int CURVE_Cof_I= 1;
+const BIG CURVE_Cof= {0x1,0x0,0x0,0x0,0x0,0x0};
+const int CURVE_B_I= 5;
+const BIG CURVE_B= {0x5,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Order= {0xF04200D,0xD59F209,0xF73FA14,0x9953CF6,0x27628C,0x24012};
+const BIG CURVE_Gx= {0xB04E012,0x72280A,0xFD3FB95,0x9953CF6,0x27628C,0x24012};
+const BIG CURVE_Gy= {0x2,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_HTPC= {0x1,0x0,0x0,0x0,0x0,0x0};
+
+const BIG CURVE_Bnx= {0x801001,0x400,0x0,0x0,0x0,0x0};
+const BIG CURVE_Pxa= {0x33A5768,0x3B27650,0x3022922,0x1EECE2B,0xF882728,0x1EA35};
+const BIG CURVE_Pxb= {0x776A2F5,0x7B04ACE,0x14F9D68,0x5D05BA3,0x611EB92,0x23485};
+const BIG CURVE_Pya= {0x30CFE24,0x69AB26E,0xF92C435,0x1FB7A85,0xF906B6E,0x1C952};
+const BIG CURVE_Pyb= {0x8E8609D,0x9101773,0xA0F3EE2,0x8445B3B,0x9544ED8,0x23E28};
+const BIG CURVE_W[2]= {{0xA008003,0x3182600,0x600180,0x0,0x0,0x0},{0x1002001,0x800,0x0,0x0,0x0,0x0}};
+const BIG CURVE_SB[2][2]= {{{0xB00A004,0x3182E00,0x600180,0x0,0x0,0x0},{0x1002001,0x800,0x0,0x0,0x0,0x0}},{{0x1002001,0x800,0x0,0x0,0x0,0x0},{0x503A00A,0xA41CC09,0xF13F894,0x9953CF6,0x27628C,0x24012}}};
+const BIG CURVE_WB[4]= {{0x2801000,0x1080600,0x200080,0x0,0x0,0x0},{0x6815005,0xF907C02,0x2519090,0x120264,0x30,0x0},{0x380B003,0x7C84001,0x128C848,0x90132,0x18,0x0},{0x3803001,0x1080E00,0x200080,0x0,0x0,0x0}};
+const BIG CURVE_BB[4][4]= {{{0xE84100D,0xD59EE09,0xF73FA14,0x9953CF6,0x27628C,0x24012},{0xE84100C,0xD59EE09,0xF73FA14,0x9953CF6,0x27628C,0x24012},{0xE84100C,0xD59EE09,0xF73FA14,0x9953CF6,0x27628C,0x24012},{0x1002002,0x800,0x0,0x0,0x0,0x0}},{{0x1002001,0x800,0x0,0x0,0x0,0x0},{0xE84100C,0xD59EE09,0xF73FA14,0x9953CF6,0x27628C,0x24012},{0xE84100D,0xD59EE09,0xF73FA14,0x9953CF6,0x27628C,0x24012},{0xE84100C,0xD59EE09,0xF73FA14,0x9953CF6,0x27628C,0x24012}},{{0x1002002,0x800,0x0,0x0,0x0,0x0},{0x1002001,0x800,0x0,0x0,0x0,0x0},{0x1002001,0x800,0x0,0x0,0x0,0x0},{0x1002001,0x800,0x0,0x0,0x0,0x0}},{{0x801002,0x400,0x0,0x0,0x0,0x0},{0x2004002,0x1000,0x0,0x0,0x0,0x0},{0xE04000A,0xD59EA09,0xF73FA14,0x9953CF6,0x27628C,0x24012},{0x801002,0x400,0x0,0x0,0x0,0x0}}};
+
+#endif
+
+#if CHUNK==64
+
+using namespace B160_56;
+
+const int CURVE_Cof_I= 1;
+const BIG CURVE_Cof= {0x1L,0x0L,0x0L};
+const int CURVE_B_I= 5;
+const BIG CURVE_B= {0x5L,0x0L,0x0L};
+const BIG CURVE_Order= {0xD59F209F04200DL,0x9953CF6F73FA14L,0x24012027628CL};
+const BIG CURVE_Gx= {0x72280AB04E012L,0x9953CF6FD3FB95L,0x24012027628CL};
+const BIG CURVE_Gy= {0x2L,0x0L,0x0L};
+const BIG CURVE_HTPC= {0x1L,0x0L,0x0L};
+
+const BIG CURVE_Bnx= {0x4000801001L,0x0L,0x0L};
+const BIG CURVE_Pxa= {0x3B2765033A5768L,0x1EECE2B3022922L,0x1EA35F882728L};
+const BIG CURVE_Pxb= {0x7B04ACE776A2F5L,0x5D05BA314F9D68L,0x23485611EB92L};
+const BIG CURVE_Pya= {0x69AB26E30CFE24L,0x1FB7A85F92C435L,0x1C952F906B6EL};
+const BIG CURVE_Pyb= {0x91017738E8609DL,0x8445B3BA0F3EE2L,0x23E289544ED8L};
+const BIG CURVE_W[2]= {{0x3182600A008003L,0x600180L,0x0L},{0x8001002001L,0x0L,0x0L}};
+const BIG CURVE_SB[2][2]= {{{0x3182E00B00A004L,0x600180L,0x0L},{0x8001002001L,0x0L,0x0L}},{{0x8001002001L,0x0L,0x0L},{0xA41CC09503A00AL,0x9953CF6F13F894L,0x24012027628CL}}};
+const BIG CURVE_WB[4]= {{0x10806002801000L,0x200080L,0x0L},{0xF907C026815005L,0x1202642519090L,0x30L},{0x7C84001380B003L,0x90132128C848L,0x18L},{0x1080E003803001L,0x200080L,0x0L}};
+const BIG CURVE_BB[4][4]= {{{0xD59EE09E84100DL,0x9953CF6F73FA14L,0x24012027628CL},{0xD59EE09E84100CL,0x9953CF6F73FA14L,0x24012027628CL},{0xD59EE09E84100CL,0x9953CF6F73FA14L,0x24012027628CL},{0x8001002002L,0x0L,0x0L}},{{0x8001002001L,0x0L,0x0L},{0xD59EE09E84100CL,0x9953CF6F73FA14L,0x24012027628CL},{0xD59EE09E84100DL,0x9953CF6F73FA14L,0x24012027628CL},{0xD59EE09E84100CL,0x9953CF6F73FA14L,0x24012027628CL}},{{0x8001002002L,0x0L,0x0L},{0x8001002001L,0x0L,0x0L},{0x8001002001L,0x0L,0x0L},{0x8001002001L,0x0L,0x0L}},{{0x4000801002L,0x0L,0x0L},{0x10002004002L,0x0L,0x0L},{0xD59EA09E04000AL,0x9953CF6F73FA14L,0x24012027628CL},{0x4000801002L,0x0L,0x0L}}};
+
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_BN254.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_BN254.cpp
new file mode 100644
index 0000000..cfdb78d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_BN254.cpp
@@ -0,0 +1,107 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "ecp_BN254.h"
+
+namespace BN254 {
+
+/* Curve BN254 - Pairing friendly BN curve */
+
+/* Nogami's fast curve */
+
+#if CHUNK==16
+
+using namespace B256_13;
+
+const int CURVE_Cof_I=1;
+const int CURVE_B_I= 2;
+const BIG CURVE_B= {0x2,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Order= {0xD,0x0,0x0,0x0,0xA10,0x8,0x0,0x0,0x1F80,0x1FFC,0x1,0x0,0x1800,0x1A26,0x6E8,0x0,0x0,0x412,0x8D9,0x4A};
+const BIG CURVE_Gx= {0x12,0x0,0x0,0x0,0x1A70,0x9,0x0,0x0,0x100,0x309,0x2,0x0,0x1800,0x1A26,0x6E8,0x0,0x0,0x412,0x8D9,0x4A};
+const BIG CURVE_Gy= {0x1,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_HTPC= {0x1,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+
+const BIG CURVE_Bnx= {0x1,0x0,0x0,0x0,0x408,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Cof= {0x1,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+
+const BIG CURVE_Pxa= {0x1B2B,0x1F,0x932,0x1C84,0x191E,0x1F86,0x262,0x1769,0x48B,0x1523,0x1B6D,0x18C3,0x7E8,0x6C6,0x1FAE,0x16C5,0x119E,0x5DA,0x684,0xC};
+const BIG CURVE_Pxb= {0xCF3,0x1EAA,0x1079,0x1869,0x10D8,0x25B,0x18DE,0xD75,0xD74,0x18FA,0xA96,0x1305,0x18C5,0x553,0xCC4,0xF06,0x1A73,0x17CD,0x5AA,0xA};
+const BIG CURVE_Pya= {0xB9A,0xE69,0x1E24,0x1C0,0x119F,0x4DE,0x16F8,0x1CD7,0x1D0A,0x194D,0x88,0x1319,0x966,0x870,0xE6A,0x1268,0xBAF,0x1D03,0x625,0x4};
+const BIG CURVE_Pyb= {0xE9B,0x19D6,0x1B1A,0x1A35,0x18A2,0x4AB,0x1CE7,0x1FFA,0x1006,0x1D84,0x34D,0xBE7,0x56F,0x16A2,0x1A3D,0x2A4,0x1C8B,0x1873,0xECA,0x1D};
+const BIG CURVE_W[2]= {{0x3,0x0,0x0,0x0,0x40,0x1,0x0,0x0,0x180,0x30C,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0x1,0x0,0x0,0x0,0x810,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0}};
+const BIG CURVE_SB[2][2]= {{{0x4,0x0,0x0,0x0,0x850,0x1,0x0,0x0,0x180,0x30C,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0x1,0x0,0x0,0x0,0x810,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0}},{{0x1,0x0,0x0,0x0,0x810,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0xA,0x0,0x0,0x0,0x9D0,0x7,0x0,0x0,0x1E00,0x1CF0,0x1,0x0,0x1800,0x1A26,0x6E8,0x0,0x0,0x412,0x8D9,0x4A}}};
+const BIG CURVE_WB[4]= {{0x0,0x0,0x0,0x0,0x408,0x0,0x0,0x0,0x80,0x104,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0x5,0x0,0x0,0x0,0x14A8,0x2,0x0,0x0,0x700,0xE38,0x0,0x0,0x1800,0x1120,0xC4,0x0,0x0,0x0,0x0,0x0},{0x3,0x0,0x0,0x0,0xC58,0x1,0x0,0x0,0x380,0x71C,0x0,0x0,0xC00,0x890,0x62,0x0,0x0,0x0,0x0,0x0},{0x1,0x0,0x0,0x0,0xC18,0x0,0x0,0x0,0x80,0x104,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0}};
+const BIG CURVE_BB[4][4]= {{{0xD,0x0,0x0,0x0,0x608,0x8,0x0,0x0,0x1F80,0x1FFC,0x1,0x0,0x1800,0x1A26,0x6E8,0x0,0x0,0x412,0x8D9,0x4A},{0xC,0x0,0x0,0x0,0x608,0x8,0x0,0x0,0x1F80,0x1FFC,0x1,0x0,0x1800,0x1A26,0x6E8,0x0,0x0,0x412,0x8D9,0x4A},{0xC,0x0,0x0,0x0,0x608,0x8,0x0,0x0,0x1F80,0x1FFC,0x1,0x0,0x1800,0x1A26,0x6E8,0x0,0x0,0x412,0x8D9,0x4A},{0x2,0x0,0x0,0x0,0x810,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0}},{{0x1,0x0,0x0,0x0,0x810,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0xC,0x0,0x0,0x0,0x608,0x8,0x0,0x0,0x1F80,0x1FFC,0x1,0x0,0x1800,0x1A26,0x6E8,0x0,0x0,0x412,0x8D9,0x4A},{0xD,0x0,0x0,0x0,0x608,0x8,0x0,0x0,0x1F80,0x1FFC,0x1,0x0,0x1800,0x1A26,0x6E8,0x0,0x0,0x412,0x8D9,0x4A},{0xC,0x0,0x0,0x0,0x608,0x8,0x0,0x0,0x1F80,0x1FFC,0x1,0x0,0x1800,0x1A26,0x6E8,0x0,0x0,0x412,0x8D9,0x4A}},{{0x2,0x0,0x0,0x0,0x810,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0x1,0x0,0x0,0x0,0x810,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0x1,0x0,0x0,0x0,0x810,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0x1,0x0,0x0,0x0,0x810,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0}},{{0x2,0x0,0x0,0x0,0x408,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0x2,0x0,0x0,0x0,0x1020,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0xA,0x0,0x0,0x0,0x200,0x8,0x0,0x0,0x1F80,0x1FFC,0x1,0x0,0x1800,0x1A26,0x6E8,0x0,0x0,0x412,0x8D9,0x4A},{0x2,0x0,0x0,0x0,0x408,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0}}};
+
+
+#endif
+
+#if CHUNK==32
+
+using namespace B256_28;
+
+const int CURVE_Cof_I=1;
+const int CURVE_B_I= 2;
+const BIG CURVE_B= {0x2,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Order= {0xD,0x0,0x10A1,0x8000000,0x7FF9F,0x8000000,0x1BA344D,0x4000000,0x5236482,0x2};
+const BIG CURVE_Gx= {0x12,0x0,0x13A7,0x0,0x86121,0x8000000,0x1BA344D,0x4000000,0x5236482,0x2};
+const BIG CURVE_Gy= {0x1,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_HTPC= {0x1,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+
+const BIG CURVE_Bnx= {0x1,0x8000000,0x40,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Cof= {0x1,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+
+const BIG CURVE_Pxa= {0x803FB2B,0xEE4224C,0x8BF0D91,0x8BBB489,0xDB6A464,0x7E8C61E,0xFEB8D8C,0x519EB62,0x61A10BB,0x0};
+const BIG CURVE_Pxb= {0x7D54CF3,0x8C34C1E,0x784B70D,0x746BAE3,0xA5B1F4D,0x8C5982A,0x3310AA7,0xBA73783,0x516AAF9,0x0};
+const BIG CURVE_Pya= {0x1CD2B9A,0xF0E0789,0xE09BD19,0xAE6BDB,0x22329BD,0x96698C8,0x39A90E0,0x6BAF934,0x21897A0,0x0};
+const BIG CURVE_Pyb= {0xB3ACE9B,0x2D1AEC6,0x9C9578A,0x6FFD73,0xD37B090,0x56F5F38,0x68F6D44,0x7C8B152,0xEBB2B0E,0x0};
+const BIG CURVE_W[2]= {{0x3,0x0,0x204,0x8000000,0x6181,0x0,0x0,0x0,0x0,0x0},{0x1,0x0,0x81,0x0,0x0,0x0,0x0,0x0,0x0,0x0}};
+const BIG CURVE_SB[2][2]= {{{0x4,0x0,0x285,0x8000000,0x6181,0x0,0x0,0x0,0x0,0x0},{0x1,0x0,0x81,0x0,0x0,0x0,0x0,0x0,0x0,0x0}},{{0x1,0x0,0x81,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0xA,0x0,0xE9D,0x0,0x79E1E,0x8000000,0x1BA344D,0x4000000,0x5236482,0x2}}};
+const BIG CURVE_WB[4]= {{0x0,0x8000000,0x40,0x8000000,0x2080,0x0,0x0,0x0,0x0,0x0},{0x5,0x8000000,0x54A,0x0,0x1C707,0x8000000,0x312241,0x0,0x0,0x0},{0x3,0x8000000,0x2C5,0x8000000,0xE383,0xC000000,0x189120,0x0,0x0,0x0},{0x1,0x8000000,0xC1,0x8000000,0x2080,0x0,0x0,0x0,0x0,0x0}};
+const BIG CURVE_BB[4][4]= {{{0xD,0x8000000,0x1060,0x8000000,0x7FF9F,0x8000000,0x1BA344D,0x4000000,0x5236482,0x2},{0xC,0x8000000,0x1060,0x8000000,0x7FF9F,0x8000000,0x1BA344D,0x4000000,0x5236482,0x2},{0xC,0x8000000,0x1060,0x8000000,0x7FF9F,0x8000000,0x1BA344D,0x4000000,0x5236482,0x2},{0x2,0x0,0x81,0x0,0x0,0x0,0x0,0x0,0x0,0x0}},{{0x1,0x0,0x81,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0xC,0x8000000,0x1060,0x8000000,0x7FF9F,0x8000000,0x1BA344D,0x4000000,0x5236482,0x2},{0xD,0x8000000,0x1060,0x8000000,0x7FF9F,0x8000000,0x1BA344D,0x4000000,0x5236482,0x2},{0xC,0x8000000,0x1060,0x8000000,0x7FF9F,0x8000000,0x1BA344D,0x4000000,0x5236482,0x2}},{{0x2,0x0,0x81,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0x1,0x0,0x81,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0x1,0x0,0x81,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0x1,0x0,0x81,0x0,0x0,0x0,0x0,0x0,0x0,0x0}},{{0x2,0x8000000,0x40,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0x2,0x0,0x102,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0xA,0x0,0x1020,0x8000000,0x7FF9F,0x8000000,0x1BA344D,0x4000000,0x5236482,0x2},{0x2,0x8000000,0x40,0x0,0x0,0x0,0x0,0x0,0x0,0x0}}};
+#endif
+
+#if CHUNK==64
+
+using namespace B256_56;
+
+const int CURVE_Cof_I=1;
+const int CURVE_B_I= 2;
+const BIG CURVE_B= {0x2L,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_Order= {0xDL,0x800000000010A1L,0x8000000007FF9FL,0x40000001BA344DL,0x25236482L};
+const BIG CURVE_Gx= {0x12L,0x13A7L,0x80000000086121L,0x40000001BA344DL,0x25236482L};
+const BIG CURVE_Gy= {0x1L,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_HTPC= {0x1L,0x0L,0x0L,0x0L,0x0L};
+
+const BIG CURVE_Bnx= {0x80000000000001L,0x40L,0x0L,0x0L,0x0L};
+const BIG CURVE_Cof= {0x1L,0x0L,0x0L,0x0L,0x0L};
+
+const BIG CURVE_Pxa= {0xEE4224C803FB2BL,0x8BBB4898BF0D91L,0x7E8C61EDB6A464L,0x519EB62FEB8D8CL,0x61A10BBL};
+const BIG CURVE_Pxb= {0x8C34C1E7D54CF3L,0x746BAE3784B70DL,0x8C5982AA5B1F4DL,0xBA737833310AA7L,0x516AAF9L};
+const BIG CURVE_Pya= {0xF0E07891CD2B9AL,0xAE6BDBE09BD19L,0x96698C822329BDL,0x6BAF93439A90E0L,0x21897A0L};
+const BIG CURVE_Pyb= {0x2D1AEC6B3ACE9BL,0x6FFD739C9578AL,0x56F5F38D37B090L,0x7C8B15268F6D44L,0xEBB2B0EL};
+const BIG CURVE_W[2]= {{0x3L,0x80000000000204L,0x6181L,0x0L,0x0L},{0x1L,0x81L,0x0L,0x0L,0x0L}};
+const BIG CURVE_SB[2][2]= {{{0x4L,0x80000000000285L,0x6181L,0x0L,0x0L},{0x1L,0x81L,0x0L,0x0L,0x0L}},{{0x1L,0x81L,0x0L,0x0L,0x0L},{0xAL,0xE9DL,0x80000000079E1EL,0x40000001BA344DL,0x25236482L}}};
+const BIG CURVE_WB[4]= {{0x80000000000000L,0x80000000000040L,0x2080L,0x0L,0x0L},{0x80000000000005L,0x54AL,0x8000000001C707L,0x312241L,0x0L},{0x80000000000003L,0x800000000002C5L,0xC000000000E383L,0x189120L,0x0L},{0x80000000000001L,0x800000000000C1L,0x2080L,0x0L,0x0L}};
+const BIG CURVE_BB[4][4]= {{{0x8000000000000DL,0x80000000001060L,0x8000000007FF9FL,0x40000001BA344DL,0x25236482L},{0x8000000000000CL,0x80000000001060L,0x8000000007FF9FL,0x40000001BA344DL,0x25236482L},{0x8000000000000CL,0x80000000001060L,0x8000000007FF9FL,0x40000001BA344DL,0x25236482L},{0x2L,0x81L,0x0L,0x0L,0x0L}},{{0x1L,0x81L,0x0L,0x0L,0x0L},{0x8000000000000CL,0x80000000001060L,0x8000000007FF9FL,0x40000001BA344DL,0x25236482L},{0x8000000000000DL,0x80000000001060L,0x8000000007FF9FL,0x40000001BA344DL,0x25236482L},{0x8000000000000CL,0x80000000001060L,0x8000000007FF9FL,0x40000001BA344DL,0x25236482L}},{{0x2L,0x81L,0x0L,0x0L,0x0L},{0x1L,0x81L,0x0L,0x0L,0x0L},{0x1L,0x81L,0x0L,0x0L,0x0L},{0x1L,0x81L,0x0L,0x0L,0x0L}},{{0x80000000000002L,0x40L,0x0L,0x0L,0x0L},{0x2L,0x102L,0x0L,0x0L,0x0L},{0xAL,0x80000000001020L,0x8000000007FF9FL,0x40000001BA344DL,0x25236482L},{0x80000000000002L,0x40L,0x0L,0x0L,0x0L}}};
+
+
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_BN254CX.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_BN254CX.cpp
new file mode 100644
index 0000000..c24535a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_BN254CX.cpp
@@ -0,0 +1,104 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "ecp_BN254CX.h"
+
+namespace BN254CX {
+
+/* Curve BN254CX - Pairing friendly BN curve */
+
+/* CertiVox BN curve/field  */
+
+
+#if CHUNK==16
+
+using namespace B256_13;
+
+const int CURVE_Cof_I=1;
+const int CURVE_B_I= 2;
+const BIG CURVE_B= {0x2,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Order= {0x1F6D,0x1758,0x98D,0x381,0xBE1,0x367,0x1324,0x1DC1,0x1FD6,0x1621,0x19B4,0x14C6,0x1647,0x1EEF,0x16C2,0x541,0x870,0x0,0x0,0x48};
+const BIG CURVE_Gx= {0x15B2,0xDA,0x1BD7,0xC47,0x1BE6,0x1F70,0x24,0x1DC3,0x1FD6,0x1921,0x19B4,0x14C6,0x1647,0x1EEF,0x16C2,0x541,0x870,0x0,0x0,0x48};
+const BIG CURVE_Gy= {0x1,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_HTPC= {0x1,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+
+const BIG CURVE_Bnx= {0x12B1,0x1E00,0x0,0x0,0x400,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Cof= {0x1,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+
+const BIG CURVE_Pxa= {0xAF5,0x1AFD,0x1B2,0x7D0,0x51C,0x1B14,0xE64,0x1CC3,0xFB8,0x4A2,0x10BC,0x1633,0x73C,0x90E,0x1E9C,0x1369,0x1F9A,0x12DB,0x1256,0x35};
+const BIG CURVE_Pxb= {0x1433,0xAF,0x183F,0xA00,0x1EDE,0x4A6,0xF68,0x1435,0x1A33,0xDD,0xD93,0x103E,0xD16,0x8E1,0x10FC,0xCC0,0x365,0x8,0xF4C,0xA};
+const BIG CURVE_Pya= {0x299,0x1B95,0x1AA5,0x642,0x683,0x427,0x1A8D,0x126D,0x1FF0,0x3CE,0x1019,0x1230,0x1FEF,0x35D,0xBB8,0xDF6,0x109E,0xB85,0x1C9E,0x2A};
+const BIG CURVE_Pyb= {0x8CD,0x24F,0x7E7,0x1782,0x1C41,0x10D6,0x681,0xC12,0x5,0x1699,0x59,0xC0E,0x17F5,0x1DEB,0x1F55,0x313,0x2AC,0xB60,0xF2D,0x23};
+const BIG CURVE_W[2]= {{0xB83,0x117F,0x1245,0x8C6,0x5,0x1C09,0xD00,0x1,0x0,0x300,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0x561,0x1C01,0x1,0x0,0x800,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0}};
+const BIG CURVE_SB[2][2]= {{{0x10E4,0xD80,0x1247,0x8C6,0x805,0x1C09,0xD00,0x1,0x0,0x300,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0x561,0x1C01,0x1,0x0,0x800,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0}},{{0x561,0x1C01,0x1,0x0,0x800,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0x13EA,0x5D9,0x1748,0x1ABA,0xBDB,0x75E,0x623,0x1DC0,0x1FD6,0x1321,0x19B4,0x14C6,0x1647,0x1EEF,0x16C2,0x541,0x870,0x0,0x0,0x48}}};
+const BIG CURVE_WB[4]= {{0x4B0,0x13D4,0x615,0x1842,0x401,0x958,0xF00,0x0,0x0,0x100,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0x475,0x1110,0x56F,0x1BF3,0x36C,0x1FCD,0x329,0x1DB5,0x1E94,0xE03,0xA83,0x10E0,0x0,0x0,0xC0,0x0,0x0,0x0,0x0,0x0},{0xB93,0x788,0x12B8,0xDF9,0x13B6,0x1FE6,0x1194,0xEDA,0x1F4A,0x1701,0x541,0x870,0x0,0x0,0x60,0x0,0x0,0x0,0x0,0x0},{0xA11,0xFD5,0x617,0x1842,0xC01,0x958,0xF00,0x0,0x0,0x100,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0}};
+const BIG CURVE_BB[4][4]= {{{0xCBD,0x1958,0x98C,0x381,0x7E1,0x367,0x1324,0x1DC1,0x1FD6,0x1621,0x19B4,0x14C6,0x1647,0x1EEF,0x16C2,0x541,0x870,0x0,0x0,0x48},{0xCBC,0x1958,0x98C,0x381,0x7E1,0x367,0x1324,0x1DC1,0x1FD6,0x1621,0x19B4,0x14C6,0x1647,0x1EEF,0x16C2,0x541,0x870,0x0,0x0,0x48},{0xCBC,0x1958,0x98C,0x381,0x7E1,0x367,0x1324,0x1DC1,0x1FD6,0x1621,0x19B4,0x14C6,0x1647,0x1EEF,0x16C2,0x541,0x870,0x0,0x0,0x48},{0x562,0x1C01,0x1,0x0,0x800,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0}},{{0x561,0x1C01,0x1,0x0,0x800,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0xCBC,0x1958,0x98C,0x381,0x7E1,0x367,0x1324,0x1DC1,0x1FD6,0x1621,0x19B4,0x14C6,0x1647,0x1EEF,0x16C2,0x541,0x870,0x0,0x0,0x48},{0xCBD,0x1958,0x98C,0x381,0x7E1,0x367,0x1324,0x1DC1,0x1FD6,0x1621,0x19B4,0x14C6,0x1647,0x1EEF,0x16C2,0x541,0x870,0x0,0x0,0x48},{0xCBC,0x1958,0x98C,0x381,0x7E1,0x367,0x1324,0x1DC1,0x1FD6,0x1621,0x19B4,0x14C6,0x1647,0x1EEF,0x16C2,0x541,0x870,0x0,0x0,0x48}},{{0x562,0x1C01,0x1,0x0,0x800,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0x561,0x1C01,0x1,0x0,0x800,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0x561,0x1C01,0x1,0x0,0x800,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0x561,0x1C01,0x1,0x0,0x800,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0}},{{0x12B2,0x1E00,0x0,0x0,0x400,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0xAC2,0x1802,0x3,0x0,0x1000,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0x1A0A,0x1B57,0x98B,0x381,0x3E1,0x367,0x1324,0x1DC1,0x1FD6,0x1621,0x19B4,0x14C6,0x1647,0x1EEF,0x16C2,0x541,0x870,0x0,0x0,0x48},{0x12B2,0x1E00,0x0,0x0,0x400,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0}}};
+#endif
+
+#if CHUNK==32
+
+using namespace B256_28;
+
+const int CURVE_Cof_I=1;
+const int CURVE_B_I= 2;
+const BIG CURVE_B= {0x2,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Order= {0x6EB1F6D,0x11C0A63,0x906CEBE,0xD6EE0CC,0x6D2C43F,0x647A636,0xDB0BDDF,0x8702A0,0x4000000,0x2};
+const BIG CURVE_Gx= {0xC1B55B2,0x6623EF5,0x93EE1BE,0xD6EE180,0x6D3243F,0x647A636,0xDB0BDDF,0x8702A0,0x4000000,0x2};
+const BIG CURVE_Gy= {0x1,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_HTPC= {0x1,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+
+const BIG CURVE_Bnx= {0x3C012B1,0x0,0x40,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Cof= {0x1,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+
+const BIG CURVE_Pxa= {0xB5FAAF5,0xC3E806C,0x9362851,0xB8E61B9,0x2F0944F,0x73CB19C,0xFA7121C,0x7F9A9B4,0xAC95A5B,0x1};
+const BIG CURVE_Pxb= {0xC15F433,0xE50060F,0xA094DED,0x33A1ABD,0x64C1BBA,0xD1681F3,0x43F11C2,0x365660,0x53D3001,0x0};
+const BIG CURVE_Pya= {0x772A299,0x33216A9,0x3484E68,0xF0936EA,0x6479DF,0xFEF9184,0x2EE06BB,0xB09E6FB,0x5727970,0x1};
+const BIG CURVE_Pyb= {0xC49E8CD,0x1BC11F9,0x61ADC4,0x56091A,0x166D320,0x7F56070,0xFD57BD7,0x2AC189,0x1BCB56C,0x1};
+const BIG CURVE_W[2]= {{0x62FEB83,0x5463491,0x381200,0xB4,0x6000,0x0,0x0,0x0,0x0,0x0},{0x7802561,0x0,0x80,0x0,0x0,0x0,0x0,0x0,0x0,0x0}};
+const BIG CURVE_SB[2][2]= {{{0xDB010E4,0x5463491,0x381280,0xB4,0x6000,0x0,0x0,0x0,0x0,0x0},{0x7802561,0x0,0x80,0x0,0x0,0x0,0x0,0x0,0x0,0x0}},{{0x7802561,0x0,0x80,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0xBB33EA,0xBD5D5D2,0x8CEBCBD,0xD6EE018,0x6D2643F,0x647A636,0xDB0BDDF,0x8702A0,0x4000000,0x2}}};
+const BIG CURVE_WB[4]= {{0x67A84B0,0x1C21185,0x12B040,0x3C,0x2000,0x0,0x0,0x0,0x0,0x0},{0xE220475,0xCDF995B,0xA7F9A36,0x94EDA8C,0xA0DC07E,0x8702,0x300000,0x0,0x0,0x0},{0xF10B93,0x66FCCAE,0x53FCD3B,0x4A76D46,0x506E03F,0x4381,0x180000,0x0,0x0,0x0},{0xDFAAA11,0x1C21185,0x12B0C0,0x3C,0x2000,0x0,0x0,0x0,0x0,0x0}};
+const BIG CURVE_BB[4][4]= {{{0x32B0CBD,0x11C0A63,0x906CE7E,0xD6EE0CC,0x6D2C43F,0x647A636,0xDB0BDDF,0x8702A0,0x4000000,0x2},{0x32B0CBC,0x11C0A63,0x906CE7E,0xD6EE0CC,0x6D2C43F,0x647A636,0xDB0BDDF,0x8702A0,0x4000000,0x2},{0x32B0CBC,0x11C0A63,0x906CE7E,0xD6EE0CC,0x6D2C43F,0x647A636,0xDB0BDDF,0x8702A0,0x4000000,0x2},{0x7802562,0x0,0x80,0x0,0x0,0x0,0x0,0x0,0x0,0x0}},{{0x7802561,0x0,0x80,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0x32B0CBC,0x11C0A63,0x906CE7E,0xD6EE0CC,0x6D2C43F,0x647A636,0xDB0BDDF,0x8702A0,0x4000000,0x2},{0x32B0CBD,0x11C0A63,0x906CE7E,0xD6EE0CC,0x6D2C43F,0x647A636,0xDB0BDDF,0x8702A0,0x4000000,0x2},{0x32B0CBC,0x11C0A63,0x906CE7E,0xD6EE0CC,0x6D2C43F,0x647A636,0xDB0BDDF,0x8702A0,0x4000000,0x2}},{{0x7802562,0x0,0x80,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0x7802561,0x0,0x80,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0x7802561,0x0,0x80,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0x7802561,0x0,0x80,0x0,0x0,0x0,0x0,0x0,0x0,0x0}},{{0x3C012B2,0x0,0x40,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0xF004AC2,0x0,0x100,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0xF6AFA0A,0x11C0A62,0x906CE3E,0xD6EE0CC,0x6D2C43F,0x647A636,0xDB0BDDF,0x8702A0,0x4000000,0x2},{0x3C012B2,0x0,0x40,0x0,0x0,0x0,0x0,0x0,0x0,0x0}}};
+#endif
+
+#if CHUNK==64
+
+using namespace B256_56;
+
+const int CURVE_Cof_I=1;
+const int CURVE_B_I= 2;
+const BIG CURVE_B= {0x2L,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_Order= {0x11C0A636EB1F6DL,0xD6EE0CC906CEBEL,0x647A6366D2C43FL,0x8702A0DB0BDDFL,0x24000000L};
+const BIG CURVE_Gx= {0x6623EF5C1B55B2L,0xD6EE18093EE1BEL,0x647A6366D3243FL,0x8702A0DB0BDDFL,0x24000000L};
+const BIG CURVE_Gy= {0x1L,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_HTPC= {0x1L,0x0L,0x0L,0x0L,0x0L};
+
+const BIG CURVE_Bnx= {0x3C012B1L,0x40L,0x0L,0x0L,0x0L};
+const BIG CURVE_Cof= {0x1L,0x0L,0x0L,0x0L,0x0L};
+
+const BIG CURVE_Pxa= {0xC3E806CB5FAAF5L,0xB8E61B99362851L,0x73CB19C2F0944FL,0x7F9A9B4FA7121CL,0x1AC95A5BL};
+const BIG CURVE_Pxb= {0xE50060FC15F433L,0x33A1ABDA094DEDL,0xD1681F364C1BBAL,0x36566043F11C2L,0x53D3001L};
+const BIG CURVE_Pya= {0x33216A9772A299L,0xF0936EA3484E68L,0xFEF918406479DFL,0xB09E6FB2EE06BBL,0x15727970L};
+const BIG CURVE_Pyb= {0x1BC11F9C49E8CDL,0x56091A061ADC4L,0x7F56070166D320L,0x2AC189FD57BD7L,0x11BCB56CL};
+const BIG CURVE_W[2]= {{0x546349162FEB83L,0xB40381200L,0x6000L,0x0L,0x0L},{0x7802561L,0x80L,0x0L,0x0L,0x0L}};
+const BIG CURVE_SB[2][2]= {{{0x5463491DB010E4L,0xB40381280L,0x6000L,0x0L,0x0L},{0x7802561L,0x80L,0x0L,0x0L,0x0L}},{{0x7802561L,0x80L,0x0L,0x0L,0x0L},{0xBD5D5D20BB33EAL,0xD6EE0188CEBCBDL,0x647A6366D2643FL,0x8702A0DB0BDDFL,0x24000000L}}};
+const BIG CURVE_WB[4]= {{0x1C2118567A84B0L,0x3C012B040L,0x2000L,0x0L,0x0L},{0xCDF995BE220475L,0x94EDA8CA7F9A36L,0x8702A0DC07EL,0x300000L,0x0L},{0x66FCCAE0F10B93L,0x4A76D4653FCD3BL,0x4381506E03FL,0x180000L,0x0L},{0x1C21185DFAAA11L,0x3C012B0C0L,0x2000L,0x0L,0x0L}};
+const BIG CURVE_BB[4][4]= {{{0x11C0A6332B0CBDL,0xD6EE0CC906CE7EL,0x647A6366D2C43FL,0x8702A0DB0BDDFL,0x24000000L},{0x11C0A6332B0CBCL,0xD6EE0CC906CE7EL,0x647A6366D2C43FL,0x8702A0DB0BDDFL,0x24000000L},{0x11C0A6332B0CBCL,0xD6EE0CC906CE7EL,0x647A6366D2C43FL,0x8702A0DB0BDDFL,0x24000000L},{0x7802562L,0x80L,0x0L,0x0L,0x0L}},{{0x7802561L,0x80L,0x0L,0x0L,0x0L},{0x11C0A6332B0CBCL,0xD6EE0CC906CE7EL,0x647A6366D2C43FL,0x8702A0DB0BDDFL,0x24000000L},{0x11C0A6332B0CBDL,0xD6EE0CC906CE7EL,0x647A6366D2C43FL,0x8702A0DB0BDDFL,0x24000000L},{0x11C0A6332B0CBCL,0xD6EE0CC906CE7EL,0x647A6366D2C43FL,0x8702A0DB0BDDFL,0x24000000L}},{{0x7802562L,0x80L,0x0L,0x0L,0x0L},{0x7802561L,0x80L,0x0L,0x0L,0x0L},{0x7802561L,0x80L,0x0L,0x0L,0x0L},{0x7802561L,0x80L,0x0L,0x0L,0x0L}},{{0x3C012B2L,0x40L,0x0L,0x0L,0x0L},{0xF004AC2L,0x100L,0x0L,0x0L,0x0L},{0x11C0A62F6AFA0AL,0xD6EE0CC906CE3EL,0x647A6366D2C43FL,0x8702A0DB0BDDFL,0x24000000L},{0x3C012B2L,0x40L,0x0L,0x0L,0x0L}}};
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_BN462.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_BN462.cpp
new file mode 100644
index 0000000..ac358ab
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_BN462.cpp
@@ -0,0 +1,92 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "ecp_BN462.h"
+
+namespace BN462 {
+/* Curve BN462 - Pairing friendly BN curve */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B464_28;
+
+//*** rom curve parameters *****
+// Base Bits= 28
+// Ate Bits= 118
+// G2 Table size= 125
+
+const int CURVE_Cof_I= 1;
+const BIG CURVE_Cof= {0x1,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const int CURVE_B_I= 5;
+const BIG CURVE_B= {0x5,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Order= {0x10800D,0x1B007E,0x24,0xF7C0000,0xC7BF717,0xF6FF66F,0xFFFFFFF,0xC201F7F,0x2908EE1,0xD81,0xA000000,0xB7D9BFC,0x6FF0CF6,0xFFFFFFF,0x23FFF,0x8036012,0x2404};
+const BIG CURVE_Gx= {0x6B6980D,0x98D91F3,0xD70113C,0x372E5C,0xE79239C,0x416A0B1,0xBB4E69A,0x689DB1B,0x3CF4B2E,0xB3EDBEC,0x6F95F63,0xAC9264B,0x30160B9,0xBA34A0A,0x191FAD,0xD67EF25,0x21A6};
+const BIG CURVE_Gy= {0x6FB03DE,0xA5734D3,0x22ECAA8,0xC666006,0xF475432,0xE40EB80,0xDF11B8A,0x6E6AF77,0x5965042,0x7D788C6,0x42CCCFA,0x90EEDA8,0xA7432A4,0x2B33676,0x7F7ABB8,0xEA0460F,0x118};
+const BIG CURVE_HTPC= {0x1,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Bnx= {0xFFFBFFF,0xFFFFFFF,0xFFFFFFF,0x1FFFF,0x4,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+
+const BIG CURVE_Pxa= {0xAE1E4DF,0x8E3D934,0x769546,0x6A8B488,0xAE1F0AA,0x92E0032,0x2699BAD,0x208F9AD,0x3820408,0xED61C91,0x7C1CD96,0x2E0337E,0xCBDC548,0xB38E3A8,0x8DDA0DF,0xCCC85B5,0x257};
+const BIG CURVE_Pxb= {0xA8CD283,0x108BA6A,0x50E9B73,0x59BF7E8,0xF50AF8B,0xB783718,0x6BAE555,0x8134DD8,0x84058B1,0xED91768,0x54730CB,0xC98E2A3,0x9566BA3,0x8EDCA84,0x99102AF,0x4343E85,0x1D2E};
+const BIG CURVE_Pya= {0xDB7154E,0x5B68DF0,0x7C3376E,0xE7B11D,0x3695A14,0xDAE32E0,0x1F41C9D,0xF1399A,0xB42FE81,0x3FA7A6B,0x706E23C,0xA035634,0x20809EC,0x517427A,0x22C1979,0x50439DA,0xA06};
+const BIG CURVE_Pyb= {0xCA2A93A,0x14CC552,0x93B9EBA,0xD537434,0x387AA68,0xA04EF87,0x7692444,0x725CC64,0xAB370FD,0x7B393F1,0xC69AC5,0x44D5E6B,0x306324D,0x2C8AE37,0x8CBE017,0xF0CBD43,0x73E};
+const BIG CURVE_W[2]= {{0x20003,0x6,0x0,0xFF00000,0xFF3FF7F,0xFFFFFFF,0xFFFFFFF,0x60017F,0x60,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0xFFF7FFF,0xFFFFFFF,0xFFFFFFF,0x3FFFF,0x8,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0}};
+const BIG CURVE_SB[2][2]= {{{0x28004,0x6,0x0,0xFEC0000,0xFF3FF77,0xFFFFFFF,0xFFFFFFF,0x60017F,0x60,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0x11000E,0x1B007E,0x24,0xF780000,0xC7BF70F,0xF6FF66F,0xFFFFFFF,0xC201F7F,0x2908EE1,0xD81,0xA000000,0xB7D9BFC,0x6FF0CF6,0xFFFFFFF,0x23FFF,0x8036012,0x2404}},{{0xFFF7FFF,0xFFFFFFF,0xFFFFFFF,0x3FFFF,0x8,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0x20003,0x6,0x0,0xFF00000,0xFF3FF7F,0xFFFFFFF,0xFFFFFFF,0x60017F,0x60,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0}}};
+const BIG CURVE_WB[4]= {{0x4000,0x2,0x0,0xFFE0000,0xFFBFFDB,0xFFFFFFF,0xFFFFFFF,0x20007F,0x20,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0xFFABFFB,0xFFCFFE3,0xFFFFFFF,0x29FFFF,0x800214,0x90,0x0,0xBFFF900,0xF6FF53F,0xFFFFFFF,0x5FFFFFF,0x4802400,0x300,0x0,0x0,0x0,0x0},{0xFFD3FFD,0xFFE7FF1,0xFFFFFFF,0x15FFFF,0x40010C,0x48,0x0,0xDFFFC80,0xFB7FA9F,0xFFFFFFF,0x2FFFFFF,0x2401200,0x180,0x0,0x0,0x0,0x0},{0xC001,0x2,0x0,0xFFA0000,0xFFBFFD3,0xFFFFFFF,0xFFFFFFF,0x20007F,0x20,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0}};
+const BIG CURVE_BB[4][4]= {{{0xFFFC000,0xFFFFFFF,0xFFFFFFF,0x1FFFF,0x4,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0xFFFBFFF,0xFFFFFFF,0xFFFFFFF,0x1FFFF,0x4,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0xFFFBFFF,0xFFFFFFF,0xFFFFFFF,0x1FFFF,0x4,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0x11000F,0x1B007E,0x24,0xF780000,0xC7BF70F,0xF6FF66F,0xFFFFFFF,0xC201F7F,0x2908EE1,0xD81,0xA000000,0xB7D9BFC,0x6FF0CF6,0xFFFFFFF,0x23FFF,0x8036012,0x2404}},{{0xFFF7FFF,0xFFFFFFF,0xFFFFFFF,0x3FFFF,0x8,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0x10C00E,0x1B007E,0x24,0xF7A0000,0xC7BF713,0xF6FF66F,0xFFFFFFF,0xC201F7F,0x2908EE1,0xD81,0xA000000,0xB7D9BFC,0x6FF0CF6,0xFFFFFFF,0x23FFF,0x8036012,0x2404},{0x10C00D,0x1B007E,0x24,0xF7A0000,0xC7BF713,0xF6FF66F,0xFFFFFFF,0xC201F7F,0x2908EE1,0xD81,0xA000000,0xB7D9BFC,0x6FF0CF6,0xFFFFFFF,0x23FFF,0x8036012,0x2404},{0x10C00E,0x1B007E,0x24,0xF7A0000,0xC7BF713,0xF6FF66F,0xFFFFFFF,0xC201F7F,0x2908EE1,0xD81,0xA000000,0xB7D9BFC,0x6FF0CF6,0xFFFFFFF,0x23FFF,0x8036012,0x2404}},{{0xFFF7FFE,0xFFFFFFF,0xFFFFFFF,0x3FFFF,0x8,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0xFFF7FFF,0xFFFFFFF,0xFFFFFFF,0x3FFFF,0x8,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0xFFF7FFF,0xFFFFFFF,0xFFFFFFF,0x3FFFF,0x8,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0xFFF7FFF,0xFFFFFFF,0xFFFFFFF,0x3FFFF,0x8,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0}},{{0x10C00F,0x1B007E,0x24,0xF7A0000,0xC7BF713,0xF6FF66F,0xFFFFFFF,0xC201F7F,0x2908EE1,0xD81,0xA000000,0xB7D9BFC,0x6FF0CF6,0xFFFFFFF,0x23FFF,0x8036012,0x2404},{0x11800F,0x1B007E,0x24,0xF740000,0xC7BF707,0xF6FF66F,0xFFFFFFF,0xC201F7F,0x2908EE1,0xD81,0xA000000,0xB7D9BFC,0x6FF0CF6,0xFFFFFFF,0x23FFF,0x8036012,0x2404},{0xFFF7FFD,0xFFFFFFF,0xFFFFFFF,0x3FFFF,0x8,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0x10C00F,0x1B007E,0x24,0xF7A0000,0xC7BF713,0xF6FF66F,0xFFFFFFF,0xC201F7F,0x2908EE1,0xD81,0xA000000,0xB7D9BFC,0x6FF0CF6,0xFFFFFFF,0x23FFF,0x8036012,0x2404}}};
+
+#endif
+
+#if CHUNK==64
+
+using namespace B464_60;
+
+//*** rom curve parameters *****
+// Base Bits= 60
+// Ate Bits= 118
+// G2 Table size= 125
+
+const int CURVE_Cof_I= 1;
+const BIG CURVE_Cof= {0x1L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const int CURVE_B_I= 5;
+const BIG CURVE_B= {0x5L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_Order= {0x401B007E010800DL,0x17F7C0000000002L,0xFFFF6FF66FC7BF7L,0x8EE1C201F7FFFFFL,0xD81290L,0xFF0CF6B7D9BFCA0L,0x23FFFFFFFFFF6L,0x24048036012L};
+const BIG CURVE_Gx= {0xC98D91F36B6980DL,0x9C0372E5CD70113L,0x69A416A0B1E7923L,0x4B2E689DB1BBB4EL,0x95F63B3EDBEC3CFL,0x160B9AC9264B6FL,0x191FADBA34A0A3L,0x21A6D67EF25L};
+const BIG CURVE_Gy= {0x8A5734D36FB03DEL,0x32C66600622ECAAL,0xB8AE40EB80F4754L,0x50426E6AF77DF11L,0xCCCFA7D788C6596L,0x7432A490EEDA842L,0x7F7ABB82B33676AL,0x118EA0460FL};
+const BIG CURVE_HTPC= {0x1L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+
+const BIG CURVE_Bnx= {0xFFFFFFFFFFFBFFFL,0x4001FFFFFFFFFFL,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_Cru= {0x401F80A801A401AL,0xDBF2E0000000002L,0xFFFF6FF597BBBF3L,0x9F0222029FFFFFFL,0xD81368L,0xFF08764BD65FC10L,0x23FFFFFFFFFF6L,0x24048036012L};
+const BIG CURVE_Pxa= {0x68E3D934AE1E4DFL,0xAA6A8B488076954L,0xBAD92E0032AE1F0L,0x408208F9AD2699L,0x1CD96ED61C91382L,0xBDC5482E0337E7CL,0x8DDA0DFB38E3A8CL,0x257CCC85B5L};
+const BIG CURVE_Pxb= {0x3108BA6AA8CD283L,0x8B59BF7E850E9B7L,0x555B783718F50AFL,0x58B18134DD86BAEL,0x730CBED91768840L,0x566BA3C98E2A354L,0x99102AF8EDCA849L,0x1D2E4343E85L};
+const BIG CURVE_Pya= {0xE5B68DF0DB7154EL,0x140E7B11D7C3376L,0xC9DDAE32E03695AL,0xFE810F1399A1F41L,0x6E23C3FA7A6BB42L,0x809ECA03563470L,0x22C1979517427A2L,0xA0650439DAL};
+const BIG CURVE_Pyb= {0xA14CC552CA2A93AL,0x68D53743493B9EBL,0x444A04EF87387AAL,0x70FD725CC647692L,0x69AC57B393F1AB3L,0x6324D44D5E6B0CL,0x8CBE0172C8AE373L,0x73EF0CBD43L};
+const BIG CURVE_W[2]= {{0x60020003L,0x7FFF00000000000L,0xFFFFFFFFFFFF3FFL,0x60060017FFFFFL,0x0L,0x0L,0x0L,0x0L},{0xFFFFFFFFFFF7FFFL,0x8003FFFFFFFFFFL,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L}};
+const BIG CURVE_SB[2][2]= {{{0x60028004L,0x77FEC0000000000L,0xFFFFFFFFFFFF3FFL,0x60060017FFFFFL,0x0L,0x0L,0x0L,0x0L},{0x401B007E011000EL,0xFF780000000002L,0xFFFF6FF66FC7BF7L,0x8EE1C201F7FFFFFL,0xD81290L,0xFF0CF6B7D9BFCA0L,0x23FFFFFFFFFF6L,0x24048036012L}},{{0xFFFFFFFFFFF7FFFL,0x8003FFFFFFFFFFL,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L},{0x60020003L,0x7FFF00000000000L,0xFFFFFFFFFFFF3FFL,0x60060017FFFFFL,0x0L,0x0L,0x0L,0x0L}}};
+const BIG CURVE_WB[4]= {{0x20004000L,0xDBFFE0000000000L,0xFFFFFFFFFFFFBFFL,0x20020007FFFFFL,0x0L,0x0L,0x0L,0x0L},{0xFFFCFFE3FFABFFBL,0x14029FFFFFFFFFFL,0x9008002L,0xF53FBFFF9000000L,0xFFFFFFFFFFFFF6FL,0x30048024005FL,0x0L,0x0L},{0xFFFE7FF1FFD3FFDL,0xC015FFFFFFFFFFL,0x4804001L,0xFA9FDFFFC800000L,0xFFFFFFFFFFFFFB7L,0x18024012002FL,0x0L,0x0L},{0x2000C001L,0xD3FFA0000000000L,0xFFFFFFFFFFFFBFFL,0x20020007FFFFFL,0x0L,0x0L,0x0L,0x0L}};
+const BIG CURVE_BB[4][4]= {{{0xFFFFFFFFFFFC000L,0x4001FFFFFFFFFFL,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L},{0xFFFFFFFFFFFBFFFL,0x4001FFFFFFFFFFL,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L},{0xFFFFFFFFFFFBFFFL,0x4001FFFFFFFFFFL,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L},{0x401B007E011000FL,0xFF780000000002L,0xFFFF6FF66FC7BF7L,0x8EE1C201F7FFFFFL,0xD81290L,0xFF0CF6B7D9BFCA0L,0x23FFFFFFFFFF6L,0x24048036012L}},{{0xFFFFFFFFFFF7FFFL,0x8003FFFFFFFFFFL,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L},{0x401B007E010C00EL,0x13F7A0000000002L,0xFFFF6FF66FC7BF7L,0x8EE1C201F7FFFFFL,0xD81290L,0xFF0CF6B7D9BFCA0L,0x23FFFFFFFFFF6L,0x24048036012L},{0x401B007E010C00DL,0x13F7A0000000002L,0xFFFF6FF66FC7BF7L,0x8EE1C201F7FFFFFL,0xD81290L,0xFF0CF6B7D9BFCA0L,0x23FFFFFFFFFF6L,0x24048036012L},{0x401B007E010C00EL,0x13F7A0000000002L,0xFFFF6FF66FC7BF7L,0x8EE1C201F7FFFFFL,0xD81290L,0xFF0CF6B7D9BFCA0L,0x23FFFFFFFFFF6L,0x24048036012L}},{{0xFFFFFFFFFFF7FFEL,0x8003FFFFFFFFFFL,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L},{0xFFFFFFFFFFF7FFFL,0x8003FFFFFFFFFFL,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L},{0xFFFFFFFFFFF7FFFL,0x8003FFFFFFFFFFL,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L},{0xFFFFFFFFFFF7FFFL,0x8003FFFFFFFFFFL,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L}},{{0x401B007E010C00FL,0x13F7A0000000002L,0xFFFF6FF66FC7BF7L,0x8EE1C201F7FFFFFL,0xD81290L,0xFF0CF6B7D9BFCA0L,0x23FFFFFFFFFF6L,0x24048036012L},{0x401B007E011800FL,0x7F740000000002L,0xFFFF6FF66FC7BF7L,0x8EE1C201F7FFFFFL,0xD81290L,0xFF0CF6B7D9BFCA0L,0x23FFFFFFFFFF6L,0x24048036012L},{0xFFFFFFFFFFF7FFDL,0x8003FFFFFFFFFFL,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L},{0x401B007E010C00FL,0x13F7A0000000002L,0xFFFF6FF66FC7BF7L,0x8EE1C201F7FFFFFL,0xD81290L,0xFF0CF6B7D9BFCA0L,0x23FFFFFFFFFF6L,0x24048036012L}}};
+
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_BRAINPOOL.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_BRAINPOOL.cpp
new file mode 100644
index 0000000..93b5380
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_BRAINPOOL.cpp
@@ -0,0 +1,61 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "ecp_BRAINPOOL.h"
+
+namespace BRAINPOOL {
+
+/* Brainpool Curve  */
+/* Note that the original curve has been transformed to an isomorphic curve with A=-3 */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B256_28;
+
+const int CURVE_Cof_I=1;
+const BIG CURVE_Cof= {0x1,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const int CURVE_B_I= 0;
+const BIG CURVE_B= {0xEE92B04,0xE58101F,0xF49256A,0xEBC4AF2,0x6B7BF93,0x733D0B7,0x4FE66A7,0x30D84EA,0x62C61C4,0x6};
+const BIG CURVE_Order= {0x74856A7,0x1E0E829,0x1A6F790,0x7AA3B56,0xD718C39,0x909D838,0xC3E660A,0xA1EEA9B,0x9FB57DB,0xA};
+const BIG CURVE_Gx= {0xE1305F4,0xA191562,0xFBC2B79,0x42C47AA,0x149AFA1,0xB23A656,0x7732213,0xC1CFE7B,0x3E8EB3C,0xA};
+const BIG CURVE_Gy= {0xB25C9BE,0xABE8F35,0x27001D,0xB6DE39D,0x17E69BC,0xE146444,0xD7F7B22,0x3439C56,0xD996C82,0x2};
+const BIG CURVE_HTPC= {0x3BC7B16,0xBC14BB0,0xAE888EB,0x30D22DE,0xD959247,0xDF0183F,0x1737593,0xF0C052E,0x665C79C,0x6};
+#endif
+
+#if CHUNK==64
+
+using namespace B256_56;
+
+const int CURVE_Cof_I=1;
+const BIG CURVE_Cof= {0x1L,0x0L,0x0L,0x0L,0x0L};
+const int CURVE_B_I= 0;
+const BIG CURVE_B= {0xE58101FEE92B04L,0xEBC4AF2F49256AL,0x733D0B76B7BF93L,0x30D84EA4FE66A7L,0x662C61C4L};
+const BIG CURVE_Order= {0x1E0E82974856A7L,0x7AA3B561A6F790L,0x909D838D718C39L,0xA1EEA9BC3E660AL,0xA9FB57DBL};
+const BIG CURVE_Gx= {0xA191562E1305F4L,0x42C47AAFBC2B79L,0xB23A656149AFA1L,0xC1CFE7B7732213L,0xA3E8EB3CL};
+const BIG CURVE_Gy= {0xABE8F35B25C9BEL,0xB6DE39D027001DL,0xE14644417E69BCL,0x3439C56D7F7B22L,0x2D996C82L};
+const BIG CURVE_HTPC= {0xBC14BB03BC7B16L,0x30D22DEAE888EBL,0xDF0183FD959247L,0xF0C052E1737593L,0x6665C79CL};
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_C1174.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_C1174.cpp
new file mode 100644
index 0000000..072be5e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_C1174.cpp
@@ -0,0 +1,60 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "ecp_C1174.h"
+
+namespace C1174 {
+
+/* Curve C1174 */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B256_29;
+
+const int CURVE_Cof_I= 4;
+const BIG CURVE_Cof= {0x4,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const int CURVE_B_I= -1174;
+const BIG CURVE_B= {0x1FFFFB61,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x7FFFF};
+const BIG CURVE_Order= {0x1166C971,0xA26A2FE,0x14C1CD22,0x12CB89BF,0x1FFFFF77,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFF};
+const BIG CURVE_Gx= {0x1CE29EDA,0x1091F93D,0xBB35945,0x3B2D492,0x1A190C02,0x1773E014,0x111E4D0E,0x19D4611,0x37FBB};
+const BIG CURVE_Gy= {0x1B46360E,0x6658DFC,0xFE5DAE9,0x5BDC55E,0xE0C4FE,0x208B4C2,0x1F31995A,0x105A8FF6,0x6B72F};
+const BIG CURVE_HTPC= {0x1FFFFFF6,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x7FFFF};
+#endif
+
+#if CHUNK==64
+
+using namespace B256_56;
+
+const int CURVE_Cof_I= 4;
+const BIG CURVE_Cof= {0x4L,0x0L,0x0L,0x0L,0x0L};
+const int CURVE_B_I= -1174;
+const BIG CURVE_B= {0xFFFFFFFFFFFB61L,0xFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFL,0x7FFFFFFL};
+const BIG CURVE_Order= {0x44D45FD166C971L,0x65C4DFD3073489L,0xFFFFFFFFFFF779L,0xFFFFFFFFFFFFFFL,0x1FFFFFFL};
+const BIG CURVE_Gx= {0x123F27BCE29EDAL,0xD96A492ECD6516L,0xE7C029A190C021L,0xEA308C479343AEL,0x37FBB0CL};
+const BIG CURVE_Gy= {0xCCB1BF9B46360EL,0xDEE2AF3F976BA4L,0x1169840E0C4FE2L,0xD47FB7CC665684L,0x6B72F82L};
+const BIG CURVE_HTPC= {0xFFFFFFFFFFFFF6L,0xFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFL,0x7FFFFFFL};
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_C13318.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_C13318.cpp
new file mode 100644
index 0000000..a7ca2a5
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_C13318.cpp
@@ -0,0 +1,60 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "ecp_C13318.h"
+
+namespace C13318 {
+
+/* C13318 */
+
+#if CHUNK==16
+/* C13318 Curve */
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B256_29;
+
+const int CURVE_Cof_I= 1;
+const BIG CURVE_Cof= {0x1,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const int CURVE_B_I= 13318;
+const BIG CURVE_B= {0x3406,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Order= {0xDC2CBE3,0x1BE896E2,0x1AE345BA,0xCA9F07B,0xF4F,0x0,0x0,0x0,0x800000};
+const BIG CURVE_Gx= {0x5,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Gy= {0xB6EAD0B,0x6469AA3,0x5B6D6E,0x1996099E,0x166369D4,0x18728B34,0x1BC4E058,0x1B24D794,0x6675AA};
+const BIG CURVE_HTPC= {0x507504F,0x13B86C9D,0x5FC8F18,0x31806AD,0x1EBD397A,0x264F7E,0x1E16569A,0x804FC1D,0x55C192};
+#endif
+
+#if CHUNK==64
+
+using namespace B256_56;
+
+const int CURVE_Cof_I= 1;
+const BIG CURVE_Cof= {0x1L,0x0L,0x0L,0x0L,0x0L};
+const int CURVE_B_I= 13318;
+const BIG CURVE_B= {0x3406L,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_Order= {0x7D12DC4DC2CBE3L,0x54F83DEB8D16EBL,0xF4F6L,0x0L,0x80000000L};
+const BIG CURVE_Gx= {0x5L,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_Gy= {0xC8D3546B6EAD0BL,0xCB04CF016DB5B8L,0xE5166966369D4CL,0x26BCA6F1381630L,0x6675AAD9L};
+const BIG CURVE_HTPC= {0x770D93A507504FL,0x8C035697F23C62L,0x4C9EFDEBD397A1L,0x27E0EF8595A680L,0x55C19240L};
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_C1665.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_C1665.cpp
new file mode 100644
index 0000000..c7f513e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_C1665.cpp
@@ -0,0 +1,60 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "ecp_C1665.h"
+
+namespace C1665 {
+
+/* Curve C1665 */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B168_29;
+
+const int CURVE_Cof_I= 4;
+const BIG CURVE_Cof= {0x4,0x0,0x0,0x0,0x0,0x0};
+const int CURVE_B_I= 5766;
+const BIG CURVE_B= {0x1686,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Order= {0x1DBA8B27,0x7F854C,0x1F57BC06,0x1FFFFFFF,0x1FFFFFFF,0x7FFFF};
+const BIG CURVE_Gx= {0x19D52398,0x138DCEDF,0x183D99B1,0x1340C31D,0x1A505B80,0xA64A6};
+const BIG CURVE_Gy= {0x4920345,0x3843D92,0x758B70B,0x77F8EE7,0x149BC0A1,0x14A0A2};
+const BIG CURVE_HTPC= {0x1,0x0,0x0,0x0,0x0,0x0};
+#endif
+
+#if CHUNK==64
+
+using namespace B168_60;
+
+const int CURVE_Cof_I= 4;
+const BIG CURVE_Cof= {0x4L,0x0L,0x0L};
+const int CURVE_B_I= 5766;
+const BIG CURVE_B= {0x1686L,0x0L,0x0L};
+const BIG CURVE_Order= {0x80FF0A99DBA8B27L,0xFFFFFFFFFD5EF01L,0xFFFFFFFFFFFL};
+const BIG CURVE_Gx= {0x671B9DBF9D52398L,0x9A0618EE0F666CL,0x14C94DA505B8L};
+const BIG CURVE_Gy= {0xC7087B244920345L,0x13BFC7739D62DC2L,0x29414549BC0AL};
+const BIG CURVE_HTPC= {0x1L,0x0L,0x0L};
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_C25519.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_C25519.cpp
new file mode 100644
index 0000000..9dcf93b
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_C25519.cpp
@@ -0,0 +1,54 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "ecp_C25519.h"
+
+namespace C25519 {
+
+/* Curve 25519 */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B256_29;
+
+const int CURVE_Cof_I=8;
+const BIG CURVE_Cof= {0x8,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Order= {0x1CF5D3ED,0x9318D2,0x1DE73596,0x1DF3BD45,0x14D,0x0,0x0,0x0,0x100000};
+const BIG CURVE_Gx= {0x9};
+const BIG CURVE_HTPC= {0x507504F,0x13B86C9D,0x5FC8F18,0x31806AD,0x1EBD397A,0x264F7E,0x1E16569A,0x804FC1D,0x55C192};
+#endif
+
+#if CHUNK==64
+
+using namespace B256_56;
+
+const int CURVE_Cof_I=8;
+const BIG CURVE_Cof= {0x8L,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_Order= {0x12631A5CF5D3ED,0xF9DEA2F79CD658,0x14DE,0x0,0x10000000};
+const BIG CURVE_Gx= {0x9};
+const BIG CURVE_HTPC= {0x770D93A507504FL,0x8C035697F23C62L,0x4C9EFDEBD397A1L,0x27E0EF8595A680L,0x55C19240L};
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_C41417.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_C41417.cpp
new file mode 100644
index 0000000..29331e6
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_C41417.cpp
@@ -0,0 +1,60 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "ecp_C41417.h"
+
+namespace C41417 {
+
+/* Curve C41417 */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B416_29;
+
+const int CURVE_Cof_I=8;
+const BIG CURVE_Cof= {0x8,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const int CURVE_B_I= 3617;
+const BIG CURVE_B= {0xE21,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Order= {0x106AF79,0x18738D2F,0x18F3C606,0x1806715A,0x22B36F1,0xA67B830,0xCF32490,0x1FFFFFFD,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1F};
+const BIG CURVE_Gx= {0x13CBC595,0x7E9C097,0x14DF1931,0x14E7F550,0x1A111301,0x15A6B6B5,0xD526292,0x18FEAFFE,0x1F44C03E,0x1E6A31B4,0x70C9B97,0x43180C6,0x1443300,0x19A4828A,0x68};
+const BIG CURVE_Gy= {0x22,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_HTPC= {0x1FFFFFEE,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0xFF};
+#endif
+
+#if CHUNK==64
+
+using namespace B416_60;
+
+const int CURVE_Cof_I=8;
+const BIG CURVE_Cof= {0x8L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const int CURVE_B_I= 3617;
+const BIG CURVE_B= {0xE21L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_Order= {0xB0E71A5E106AF79L,0x1C0338AD63CF181L,0x414CF706022B36FL,0xFFFFFFFFEB3CC92L,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0x7FFFFFFFFFFFFL};
+const BIG CURVE_Gx= {0x4FD3812F3CBC595L,0x1A73FAA8537C64CL,0x4AB4D6D6BA11130L,0x3EC7F57FF35498AL,0xE5FCD46369F44C0L,0x300218C0631C326L,0x1A334905141443L};
+const BIG CURVE_Gy= {0x22L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_HTPC= {0xFFFFFFFFFFFFFEEL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFL};
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_Ed25519.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_Ed25519.cpp
new file mode 100644
index 0000000..da51d2e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_Ed25519.cpp
@@ -0,0 +1,70 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "ecp_Ed25519.h"
+
+namespace Ed25519 {
+
+/* Ed25519 */
+
+#if CHUNK==16
+/* Ed25519 Curve */
+
+using namespace B256_13;
+
+const int CURVE_Cof_I=8;
+const BIG CURVE_Cof= {0x8,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const int CURVE_B_I= 0;
+const BIG CURVE_B= {0x18A3,0x1ACB,0x1284,0x169B,0x175E,0xC55,0x507,0x9A8,0x100A,0x3,0x1A26,0xEF3,0x797,0x3A0,0xE33,0x1FCE,0xB6F,0x771,0xDB,0xA4};
+const BIG CURVE_Order= {0x13ED,0x7AE,0x697,0x4C6,0x581,0xE6B,0xBDE,0x1BD4,0x1EF9,0xA6,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x20};
+const BIG CURVE_Gx= {0x151A,0x192E,0x1823,0xC5A,0xC95,0x13D9,0x1496,0xC12,0xCC7,0x349,0x1717,0x1BAD,0x31F,0x1271,0x1B02,0xA7F,0xD6E,0x169E,0x1A4D,0x42};
+const BIG CURVE_Gy= {0x658,0x1333,0x1999,0xCCC,0x666,0x1333,0x1999,0xCCC,0x666,0x1333,0x1999,0xCCC,0x666,0x1333,0x1999,0xCCC,0x666,0x1333,0x1999,0xCC};
+const BIG CURVE_HTPC= {0x104F,0x83A,0x4E9,0xE1B,0x627,0x191E,0x1A5F,0x6A,0x18C,0x1CBD,0x1AF4,0x1DFB,0x4C9,0x1340,0x1656,0x1DF0,0x7E0,0x1201,0x1064,0xAB};
+#endif
+
+#if CHUNK==32
+
+using namespace B256_29;
+
+const int CURVE_Cof_I=8;
+const BIG CURVE_Cof= {0x8,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const int CURVE_B_I= 0;
+const BIG CURVE_B= {0x135978A3,0xF5A6E50,0x10762ADD,0x149A82,0x1E898007,0x3CBBBC,0x19CE331D,0x1DC56DFF,0x52036C};
+const BIG CURVE_Order= {0x1CF5D3ED,0x9318D2,0x1DE73596,0x1DF3BD45,0x14D,0x0,0x0,0x0,0x100000};
+const BIG CURVE_Gx= {0xF25D51A,0xAB16B04,0x969ECB2,0x198EC12A,0xDC5C692,0x1118FEEB,0xFFB0293,0x1A79ADCA,0x216936};
+const BIG CURVE_Gy= {0x6666658,0x13333333,0x19999999,0xCCCCCCC,0x6666666,0x13333333,0x19999999,0xCCCCCCC,0x666666};
+const BIG CURVE_HTPC= {0x507504F,0x13B86C9D,0x5FC8F18,0x31806AD,0x1EBD397A,0x264F7E,0x1E16569A,0x804FC1D,0x55C192};
+
+#endif
+
+#if CHUNK==64
+
+using namespace B256_56;
+
+const int CURVE_Cof_I=8;
+const BIG CURVE_Cof= {0x8L,0x0L,0x0L,0x0L,0x0L};
+const int CURVE_B_I= 0;
+const BIG CURVE_B= {0xEB4DCA135978A3L,0xA4D4141D8AB75L,0x797779E8980070L,0x2B6FFE738CC740L,0x52036CEEL};
+const BIG CURVE_Order= {0x12631A5CF5D3EDL,0xF9DEA2F79CD658L,0x14DEL,0x0L,0x10000000L};
+const BIG CURVE_Gx= {0x562D608F25D51AL,0xC7609525A7B2C9L,0x31FDD6DC5C692CL,0xCD6E53FEC0A4E2L,0x216936D3L};
+const BIG CURVE_Gy= {0x66666666666658L,0x66666666666666L,0x66666666666666L,0x66666666666666L,0x66666666L};
+const BIG CURVE_HTPC= {0x770D93A507504FL,0x8C035697F23C62L,0x4C9EFDEBD397A1L,0x27E0EF8595A680L,0x55C19240L};
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_Ed448.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_Ed448.cpp
new file mode 100644
index 0000000..36a900a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_Ed448.cpp
@@ -0,0 +1,64 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "ecp_Ed448.h"
+
+namespace Ed448 {
+
+/* Curve Ed448 */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B448_29;
+
+const int CURVE_Cof_I=4;
+const BIG CURVE_Cof= {0x4,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const int CURVE_B_I= -39081;
+const BIG CURVE_B= {0x1FFF6756,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FDFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFF};
+const BIG CURVE_Order= {0xB5844F3,0x1BC61495,0x1163D548,0x1984E51B,0x3690216,0xDA4D76B,0xFA7113B,0x1FEF9944,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x7FF};
+//const BIG CURVE_Gx= {0x15555555,0xAAAAAAA,0x15555555,0xAAAAAAA,0x15555555,0xAAAAAAA,0x15555555,0x152AAAAA,0xAAAAAAA,0x15555555,0xAAAAAAA,0x15555555,0xAAAAAAA,0x15555555,0xAAAAAAA,0x1555};
+//const BIG CURVE_Gy= {0xA9386ED,0x1757DE6F,0x13681AF6,0x19657DA3,0x3098BBB,0x12C19D15,0x12E03595,0xE515B18,0x17B7E36D,0x1AC426E,0xDBB5E8,0x10D8560,0x159D6205,0xB8246D9,0x17A58D2B,0x15C0};
+const BIG CURVE_Gx= {0x70CC05E,0x1135415E,0x24E389,0x1701C316,0x6511433,0xD7B955B,0x11904AB8,0x4947A74,0x7EA6DE3,0x23878BB,0x785195C,0x57E6DB5,0x1D15A62,0x1686F691,0x5C319AF,0x9E3};
+const BIG CURVE_Gy= {0x1230FA14,0x43CADF,0x15F22B66,0x1A26589D,0x39C4FDB,0x1F8E733E,0xB5CEB4F,0x3C0B418,0x87789C,0x1B651CC2,0x12FA9CDC,0xD938EC4,0x7620375,0x1B5E1244,0x1D19C5BA,0xD27};
+const BIG CURVE_HTPC= {0x1FFFFFFE,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FDFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFF};
+#endif
+
+#if CHUNK==64
+
+using namespace B448_58;
+
+const int CURVE_Cof_I=4;
+const BIG CURVE_Cof= {0x4L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const int CURVE_B_I= -39081;
+const BIG CURVE_B= {0x3FFFFFFFFFF6756L,0x3FFFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFFL,0x3FBFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFFL,0x3FFFFFFFFFFL};
+const BIG CURVE_Order= {0x378C292AB5844F3L,0x3309CA37163D548L,0x1B49AED63690216L,0x3FDF3288FA7113BL,0x3FFFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFFL,0xFFFFFFFFFFL};
+//const BIG CURVE_Gx= {0x155555555555555L,0x155555555555555L,0x155555555555555L,0x2A5555555555555L,0x2AAAAAAAAAAAAAAL,0x2AAAAAAAAAAAAAAL,0x2AAAAAAAAAAAAAAL,0x2AAAAAAAAAAL};
+//const BIG CURVE_Gy= {0x2EAFBCDEA9386EDL,0x32CAFB473681AF6L,0x25833A2A3098BBBL,0x1CA2B6312E03595L,0x35884DD7B7E36DL,0x21B0AC00DBB5E8L,0x17048DB359D6205L,0x2B817A58D2BL};
+const BIG CURVE_Gx= {0x226A82BC70CC05EL,0x2E03862C024E389L,0x1AF72AB66511433L,0x928F4E91904AB8L,0x470F1767EA6DE3L,0xAFCDB6A785195CL,0x2D0DED221D15A62L,0x13C65C319AFL};
+const BIG CURVE_Gy= {0x8795BF230FA14L,0x344CB13B5F22B66L,0x3F1CE67C39C4FDBL,0x7816830B5CEB4FL,0x36CA3984087789CL,0x1B271D892FA9CDCL,0x36BC24887620375L,0x1A4FD19C5BAL};
+const BIG CURVE_HTPC= {0x3FFFFFFFFFFFFFEL,0x3FFFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFFL,0x3FBFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFFL,0x3FFFFFFFFFFL};
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_FP256BN.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_FP256BN.cpp
new file mode 100644
index 0000000..85140ad
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_FP256BN.cpp
@@ -0,0 +1,104 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "ecp_FP256BN.h"
+
+namespace FP256BN {
+
+/* Curve BN254 - Pairing friendly BN curve */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B256_28;
+
+const int CURVE_Cof_I=1;
+const int CURVE_B_I= 3;
+const BIG CURVE_B= {0x3,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Order= {0x10B500D,0x2D536CD,0x9921AF6,0x65FB129,0x49E0CDC,0x5EEE71A,0xD46E5F2,0xFFFCF0C,0xFFFFFFF,0xF};
+const BIG CURVE_Gx= {0x1,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Gy= {0x2,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_HTPC= {0x1,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+
+const BIG CURVE_Bnx= {0xB0A801,0x82F5C03,0x68,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Cof= {0x1,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+
+const BIG CURVE_Pxa= {0x9C09EFB,0x2616B68,0xF843CD2,0x539A12B,0x13ACE1C,0x577C289,0x28560F,0xB4C96C2,0xE0C3350,0xF};
+const BIG CURVE_Pxb= {0x37E6A2B,0x69ED34A,0x3589D2,0x78E287D,0x3B924DD,0xC637D81,0x4DB5AE1,0x738AC05,0xEA66057,0x4};
+const BIG CURVE_Pya= {0xEDC27FF,0x9B481B,0x15848E9,0x24758D6,0xE51EFCB,0x75124E3,0x376770D,0xC542A3B,0x2046E7,0x7};
+const BIG CURVE_Pyb= {0xAAD049B,0x1281114,0xA98B3E0,0xBE80821,0x29F8B4C,0x49297EB,0x42EEA6,0xD388C29,0x554E3BC,0x0};
+const BIG CURVE_W[2]= {{0xB054003,0xF0036E1,0xE78663A,0xFFFFFFF,0xFFFF,0x0,0x0,0x0,0x0,0x0},{0x1615001,0x5EB806,0xD1,0x0,0x0,0x0,0x0,0x0,0x0,0x0}};
+const BIG CURVE_SB[2][2]= {{{0xC669004,0xF5EEEE7,0xE78670B,0xFFFFFFF,0xFFFF,0x0,0x0,0x0,0x0,0x0},{0x1615001,0x5EB806,0xD1,0x0,0x0,0x0,0x0,0x0,0x0,0x0}},{{0x1615001,0x5EB806,0xD1,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0x606100A,0x3D4FFEB,0xB19B4BB,0x65FB129,0x49D0CDC,0x5EEE71A,0xD46E5F2,0xFFFCF0C,0xFFFFFFF,0xF}}};
+const BIG CURVE_WB[4]= {{0xD30A800,0x20678F0,0x4D2CC10,0x5555555,0x5555,0x0,0x0,0x0,0x0,0x0},{0xD7DC805,0xD6764C0,0xBC3AD1A,0x8FBEA10,0x4467DE,0x8061601,0xD105EB,0x0,0x0,0x0},{0xF173803,0xACB6061,0x5E1D6C1,0x47DF508,0x82233EF,0xC030B00,0x6882F5,0x0,0x0,0x0},{0xE91F801,0x26530F6,0x4D2CCE1,0x5555555,0x5555,0x0,0x0,0x0,0x0,0x0}};
+const BIG CURVE_BB[4][4]= {{{0x5AA80D,0xAA5DACA,0x9921A8D,0x65FB129,0x49E0CDC,0x5EEE71A,0xD46E5F2,0xFFFCF0C,0xFFFFFFF,0xF},
+                                           {0x5AA80C,0xAA5DACA,0x9921A8D,0x65FB129,0x49E0CDC,0x5EEE71A,0xD46E5F2,0xFFFCF0C,0xFFFFFFF,0xF},
+	                                       {0x5AA80C,0xAA5DACA,0x9921A8D,0x65FB129,0x49E0CDC,0x5EEE71A,0xD46E5F2,0xFFFCF0C,0xFFFFFFF,0xF},
+	                                       {0x1615002,0x5EB806,0xD1,0x0,0x0,0x0,0x0,0x0,0x0,0x0}},
+	                                       {{0x1615001,0x5EB806,0xD1,0x0,0x0,0x0,0x0,0x0,0x0,0x0},
+	                                        {0x5AA80C,0xAA5DACA,0x9921A8D,0x65FB129,0x49E0CDC,0x5EEE71A,0xD46E5F2,0xFFFCF0C,0xFFFFFFF,0xF},
+	                                        {0x5AA80D,0xAA5DACA,0x9921A8D,0x65FB129,0x49E0CDC,0x5EEE71A,0xD46E5F2,0xFFFCF0C,0xFFFFFFF,0xF},
+	                                        {0x5AA80C,0xAA5DACA,0x9921A8D,0x65FB129,0x49E0CDC,0x5EEE71A,0xD46E5F2,0xFFFCF0C,0xFFFFFFF,0xF}},
+	                                        {{0x1615002,0x5EB806,0xD1,0x0,0x0,0x0,0x0,0x0,0x0,0x0},
+	                                         {0x1615001,0x5EB806,0xD1,0x0,0x0,0x0,0x0,0x0,0x0,0x0},
+	                                         {0x1615001,0x5EB806,0xD1,0x0,0x0,0x0,0x0,0x0,0x0,0x0},
+	                                         {0x1615001,0x5EB806,0xD1,0x0,0x0,0x0,0x0,0x0,0x0,0x0}},
+	                                         {{0xB0A802,0x82F5C03,0x68,0x0,0x0,0x0,0x0,0x0,0x0,0x0},
+	                                          {0x2C2A002,0xBD700C,0x1A2,0x0,0x0,0x0,0x0,0x0,0x0,0x0},
+	                                          {0xFAA000A,0x2767EC6,0x9921A25,0x65FB129,0x49E0CDC,0x5EEE71A,0xD46E5F2,0xFFFCF0C,0xFFFFFFF,0xF},
+	                                          {0xB0A802,0x82F5C03,0x68,0x0,0x0,0x0,0x0,0x0,0x0,0x0}}};
+
+
+
+
+#endif
+
+#if CHUNK==64
+
+using namespace B256_56;
+
+const int CURVE_Cof_I=1;
+const int CURVE_B_I= 3;
+const BIG CURVE_B= {0x3L,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_Order= {0x2D536CD10B500DL,0x65FB1299921AF6L,0x5EEE71A49E0CDCL,0xFFFCF0CD46E5F2L,0xFFFFFFFFL};
+const BIG CURVE_Gx= {0x1L,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_Gy= {0x2L,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_HTPC= {0x1L,0x0L,0x0L,0x0L,0x0L};
+
+const BIG CURVE_Bnx= {0x82F5C030B0A801L,0x68L,0x0L,0x0L,0x0L};
+const BIG CURVE_Cof= {0x1L,0x0L,0x0L,0x0L,0x0L};
+
+const BIG CURVE_Pxa= {0x2616B689C09EFBL,0x539A12BF843CD2L,0x577C28913ACE1CL,0xB4C96C2028560FL,0xFE0C3350L};
+const BIG CURVE_Pxb= {0x69ED34A37E6A2BL,0x78E287D03589D2L,0xC637D813B924DDL,0x738AC054DB5AE1L,0x4EA66057L};
+const BIG CURVE_Pya= {0x9B481BEDC27FFL,0x24758D615848E9L,0x75124E3E51EFCBL,0xC542A3B376770DL,0x702046E7L};
+const BIG CURVE_Pyb= {0x1281114AAD049BL,0xBE80821A98B3E0L,0x49297EB29F8B4CL,0xD388C29042EEA6L,0x554E3BCL};
+const BIG CURVE_W[2]= {{0xF0036E1B054003L,0xFFFFFFFE78663AL,0xFFFFL,0x0L,0x0L},{0x5EB8061615001L,0xD1L,0x0L,0x0L,0x0L}};
+const BIG CURVE_SB[2][2]= {{{0xF5EEEE7C669004L,0xFFFFFFFE78670BL,0xFFFFL,0x0L,0x0L},{0x5EB8061615001L,0xD1L,0x0L,0x0L,0x0L}},{{0x5EB8061615001L,0xD1L,0x0L,0x0L,0x0L},{0x3D4FFEB606100AL,0x65FB129B19B4BBL,0x5EEE71A49D0CDCL,0xFFFCF0CD46E5F2L,0xFFFFFFFFL}}};
+const BIG CURVE_WB[4]= {{0x20678F0D30A800L,0x55555554D2CC10L,0x5555L,0x0L,0x0L},{0xD6764C0D7DC805L,0x8FBEA10BC3AD1AL,0x806160104467DEL,0xD105EBL,0x0L},{0xACB6061F173803L,0x47DF5085E1D6C1L,0xC030B0082233EFL,0x6882F5L,0x0L},{0x26530F6E91F801L,0x55555554D2CCE1L,0x5555L,0x0L,0x0L}};
+const BIG CURVE_BB[4][4]= {{{0xAA5DACA05AA80DL,0x65FB1299921A8DL,0x5EEE71A49E0CDCL,0xFFFCF0CD46E5F2L,0xFFFFFFFFL},{0xAA5DACA05AA80CL,0x65FB1299921A8DL,0x5EEE71A49E0CDCL,0xFFFCF0CD46E5F2L,0xFFFFFFFFL},{0xAA5DACA05AA80CL,0x65FB1299921A8DL,0x5EEE71A49E0CDCL,0xFFFCF0CD46E5F2L,0xFFFFFFFFL},{0x5EB8061615002L,0xD1L,0x0L,0x0L,0x0L}},{{0x5EB8061615001L,0xD1L,0x0L,0x0L,0x0L},{0xAA5DACA05AA80CL,0x65FB1299921A8DL,0x5EEE71A49E0CDCL,0xFFFCF0CD46E5F2L,0xFFFFFFFFL},{0xAA5DACA05AA80DL,0x65FB1299921A8DL,0x5EEE71A49E0CDCL,0xFFFCF0CD46E5F2L,0xFFFFFFFFL},{0xAA5DACA05AA80CL,0x65FB1299921A8DL,0x5EEE71A49E0CDCL,0xFFFCF0CD46E5F2L,0xFFFFFFFFL}},{{0x5EB8061615002L,0xD1L,0x0L,0x0L,0x0L},{0x5EB8061615001L,0xD1L,0x0L,0x0L,0x0L},{0x5EB8061615001L,0xD1L,0x0L,0x0L,0x0L},{0x5EB8061615001L,0xD1L,0x0L,0x0L,0x0L}},{{0x82F5C030B0A802L,0x68L,0x0L,0x0L,0x0L},{0xBD700C2C2A002L,0x1A2L,0x0L,0x0L,0x0L},{0x2767EC6FAA000AL,0x65FB1299921A25L,0x5EEE71A49E0CDCL,0xFFFCF0CD46E5F2L,0xFFFFFFFFL},{0x82F5C030B0A802L,0x68L,0x0L,0x0L,0x0L}}};
+
+
+
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_FP512BN.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_FP512BN.cpp
new file mode 100644
index 0000000..c9a2edf
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_FP512BN.cpp
@@ -0,0 +1,109 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "ecp_FP512BN.h"
+
+namespace FP512BN {
+
+/* Curve FP512BN - Pairing friendly BN curve */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B512_29;
+
+const int CURVE_Cof_I=1;
+const int CURVE_B_I= 3;
+const BIG CURVE_B= {0x3,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Order= {0x119A09ED,0x153252FA,0x1E68AD01,0x627C09,0x79A34A1,0x12EF5593,0x2E39231,0x3D597D3,0x45146CF,0x88D877A,0x102EF8F0,0x1196A60F,0x1C60BA1D,0x1CF63F80,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x7FFFF};
+const BIG CURVE_Gx= {0x1,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Gy= {0x2,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_HTPC= {0x1,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+
+const BIG CURVE_Bnx= {0x1E1BD80F,0x59835DA,0xC3DFC04,0x5EB8061,0x688,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Cof= {0x1,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+
+const BIG CURVE_Pxa= {0xDB646B5,0x183D4B70,0x1CBFFA3,0x11F0E632,0x1C78F221,0x1F10DE5D,0x171B715E,0xF0C6A29,0x10B02453,0xBE63C66,0xE6D5F69,0x166B1E1B,0x4BBBD29,0x179E750F,0x6E9D04,0xC912B10,0x1339E138,0x1D8B2};
+const BIG CURVE_Pxb= {0x1A8AE0E9,0xDAE5F7E,0x22446CF,0x1948239B,0x15ADCE40,0xB709C1E,0x18357943,0xE50AA4D,0x19781E22,0x12B35CA6,0x11DAA2C0,0x18D8DDE4,0x5EA656D,0x15F45A41,0xD311A02,0xCFCD913,0x13CBF850,0x240E0};
+const BIG CURVE_Pya= {0xDDE67A1,0x12401895,0x17BEE178,0x142F5AC2,0xB7BC5CD,0x92A1404,0x1A3B748C,0x17BD82A7,0x14B6CD18,0xAC34CE,0x1740FB97,0x1ECC15F9,0x17085B1D,0x1D1BA793,0x1BD6AC32,0x18F70525,0xC84C827,0x3780F};
+const BIG CURVE_Pyb= {0x84F8E8B,0xC5B8C36,0xFDD85A1,0xB84449,0x19C08DFF,0x56BF713,0x1C5290C4,0x187C5CA0,0x1DA2897F,0x24B0CA0,0x326D8F4,0x2310CF6,0x1021438C,0xFBAEC8F,0xD9030C5,0x1CF06358,0x1CEC8B04,0x28D1D};
+const BIG CURVE_W[2]= {{0x9834583,0x887C4BA,0x5A85CFC,0xBF7223A,0xF63FE96,0x1FFFFFFE,0x1FFFFFFF,0x1FFFFFFF,0xFFFFFF,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0x1C37B01F,0xB306BB5,0x187BF808,0xBD700C2,0xD10,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0}};
+const BIG CURVE_SB[2][2]= {{{0xD4B9564,0x1D575904,0xD2C64F3,0x202177,0xF63F186,0x1FFFFFFE,0x1FFFFFFF,0x1FFFFFFF,0xFFFFFF,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0x156259CE,0xA01E744,0x5ECB4F9,0x148B7B47,0x79A2790,0x12EF5593,0x2E39231,0x3D597D3,0x45146CF,0x88D877A,0x102EF8F0,0x1196A60F,0x1C60BA1D,0x1CF63F80,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x7FFFF}},{{0x1C37B01F,0xB306BB5,0x187BF808,0xBD700C2,0xD10,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0x9834583,0x887C4BA,0x5A85CFC,0xBF7223A,0xF63FE96,0x1FFFFFFE,0x1FFFFFFF,0x1FFFFFFF,0xFFFFFF,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0}}};
+const BIG CURVE_WB[4]= {{0x155A29F0,0x16D59B55,0xF4C305,0x18858C0B,0x5215FBF,0xAAAAAAA,0x15555555,0xAAAAAAA,0x555555,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},{0x2355D4B,0x1758095D,0x1FE13C5F,0x41F83FA,0xBB5E5CF,0x97D4EF1,0xB503D62,0x172C0C9B,0x16315274,0x15E1A9A8,0x859835D,0x2C3DFC0,0x105EB806,0x68,0x0,0x0,0x0,0x0},{0x289AAD,0x1E781F9C,0x60F9C31,0x1505822E,0x15DAF62B,0x4BEA778,0x15A81EB1,0xB96064D,0xB18A93A,0x1AF0D4D4,0x42CC1AE,0x161EFE0,0x82F5C03,0x34,0x0,0x0,0x0,0x0},{0x192279D1,0xBA52F9F,0x878CAFD,0xCAE8B48,0x52152AF,0xAAAAAAA,0x15555555,0xAAAAAAA,0x555555,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0}};
+const BIG CURVE_BB[4][4]= {{{0x1E1BD810,0x59835DA,0xC3DFC04,0x5EB8061,0x688,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},
+											{0x1E1BD80F,0x59835DA,0xC3DFC04,0x5EB8061,0x688,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},
+											{0x1E1BD80F,0x59835DA,0xC3DFC04,0x5EB8061,0x688,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},
+											{0x156259CF,0xA01E744,0x5ECB4F9,0x148B7B47,0x79A2790,0x12EF5593,0x2E39231,0x3D597D3,0x45146CF,0x88D877A,0x102EF8F0,0x1196A60F,0x1C60BA1D,0x1CF63F80,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x7FFFF}},
+											{{0x1C37B01F,0xB306BB5,0x187BF808,0xBD700C2,0xD10,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},
+											 {0x137E31DE,0xF9A1D1F,0x122AB0FD,0x1A76FBA8,0x79A2E18,0x12EF5593,0x2E39231,0x3D597D3,0x45146CF,0x88D877A,0x102EF8F0,0x1196A60F,0x1C60BA1D,0x1CF63F80,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x7FFFF},
+											 {0x137E31DD,0xF9A1D1F,0x122AB0FD,0x1A76FBA8,0x79A2E18,0x12EF5593,0x2E39231,0x3D597D3,0x45146CF,0x88D877A,0x102EF8F0,0x1196A60F,0x1C60BA1D,0x1CF63F80,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x7FFFF},
+											 {0x137E31DE,0xF9A1D1F,0x122AB0FD,0x1A76FBA8,0x79A2E18,0x12EF5593,0x2E39231,0x3D597D3,0x45146CF,0x88D877A,0x102EF8F0,0x1196A60F,0x1C60BA1D,0x1CF63F80,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x7FFFF}},
+											 {{0x1C37B01E,0xB306BB5,0x187BF808,0xBD700C2,0xD10,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},
+											  {0x1C37B01F,0xB306BB5,0x187BF808,0xBD700C2,0xD10,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},
+											  {0x1C37B01F,0xB306BB5,0x187BF808,0xBD700C2,0xD10,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},
+											  {0x1C37B01F,0xB306BB5,0x187BF808,0xBD700C2,0xD10,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0}},
+											   {{0x137E31DF,0xF9A1D1F,0x122AB0FD,0x1A76FBA8,0x79A2E18,0x12EF5593,0x2E39231,0x3D597D3,0x45146CF,0x88D877A,0x102EF8F0,0x1196A60F,0x1C60BA1D,0x1CF63F80,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x7FFFF},
+												{0x192AA9AF,0x1ED17B8E,0xD70BCF0,0x8B47A84,0x79A1A80,0x12EF5593,0x2E39231,0x3D597D3,0x45146CF,0x88D877A,0x102EF8F0,0x1196A60F,0x1C60BA1D,0x1CF63F80,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x7FFFF},
+												{0x1C37B01D,0xB306BB5,0x187BF808,0xBD700C2,0xD10,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0},
+												{0x137E31DF,0xF9A1D1F,0x122AB0FD,0x1A76FBA8,0x79A2E18,0x12EF5593,0x2E39231,0x3D597D3,0x45146CF,0x88D877A,0x102EF8F0,0x1196A60F,0x1C60BA1D,0x1CF63F80,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x7FFFF}}};
+
+
+
+#endif
+
+#if CHUNK==64
+
+using namespace B512_60;
+
+const int CURVE_Cof_I=1;
+const int CURVE_B_I= 3;
+const BIG CURVE_B= {0x3L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_Order= {0x6A64A5F519A09EDL,0x10313E04F9A2B40L,0xC65DEAB2679A34AL,0xCF1EACBE98B8E48L,0x3C111B0EF445146L,0xA1D8CB5307C0BBEL,0xFFFF9EC7F01C60BL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFL};
+const BIG CURVE_Gx= {0x1L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_Gy= {0x2L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_HTPC= {0x1L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+
+const BIG CURVE_Bnx= {0xB306BB5E1BD80FL,0x82F5C030B0F7F01L,0x68L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_Cof= {0x1L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+
+const BIG CURVE_Pxa= {0xF07A96E0DB646B5L,0x18F87319072FFE8L,0x7BE21BCBBC78F22L,0x537863514DC6DC5L,0xDA57CC78CD0B024L,0xD29B358F0DB9B57L,0x7412F3CEA1E4BBBL,0xE138648958801BAL,0x3B165339L};
+const BIG CURVE_Pxb= {0xDB5CBEFDA8AE0E9L,0xCA411CD88911B3L,0xD6E1383D5ADCE4L,0x227285526E0D5E5L,0xB02566B94D9781EL,0x56DC6C6EF2476A8L,0x680ABE8B4825EA6L,0xF85067E6C89B4C4L,0x481C13CBL};
+const BIG CURVE_Pya= {0x2480312ADDE67A1L,0xDA17AD615EFB85EL,0x312542808B7BC5CL,0x18BDEC153E8EDD2L,0xE5C158699D4B6CDL,0xB1DF660AFCDD03EL,0xB0CBA374F277085L,0xC827C7B8292EF5AL,0x6F01EC84L};
+const BIG CURVE_Pyb= {0x58B7186C84F8E8BL,0xF05C2224BF76168L,0x10AD7EE279C08DFL,0x7FC3E2E50714A43L,0x3D04961941DA289L,0x38C118867B0C9B6L,0xC315F75D91F0214L,0x8B04E7831AC3640L,0x51A3BCECL};
+
+
+const BIG CURVE_W[2]= {{0x110F89749834583L,0x65FB911D16A173FL,0xFFFFFFFFCF63FE9L,0xFFFFFFFFFFFFFFFL,0xFFFFL,0x0L,0x0L,0x0L,0x0L},{0x1660D76BC37B01FL,0x5EB806161EFE02L,0xD1L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L}};
+const BIG CURVE_SB[2][2]= {{{0xFAAEB208D4B9564L,0x601010BBB4B193CL,0xFFFFFFFFCF63F18L,0xFFFFFFFFFFFFFFFL,0xFFFFL,0x0L,0x0L,0x0L,0x0L},{0x5403CE8956259CEL,0xA45BDA397B2D3EL,0xC65DEAB2679A279L,0xCF1EACBE98B8E48L,0x3C111B0EF445146L,0xA1D8CB5307C0BBEL,0xFFFF9EC7F01C60BL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFL}},{{0x1660D76BC37B01FL,0x5EB806161EFE02L,0xD1L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L},{0x110F89749834583L,0x65FB911D16A173FL,0xFFFFFFFFCF63FE9L,0xFFFFFFFFFFFFFFFL,0xFFFFL,0x0L,0x0L,0x0L,0x0L}}};
+const BIG CURVE_WB[4]= {{0x6DAB36AB55A29F0L,0xFC42C60583D30C1L,0x5555555545215FBL,0x555555555555555L,0x5555L,0x0L,0x0L,0x0L,0x0L},
+	{0xEEB012BA2355D4BL,0xF20FC1FD7F84F17L,0x892FA9DE2BB5E5CL,0x74B96064DAD40F5L,0xD76BC3535163152L,0x806161EFE021660L,0xD105EBL,0x0L,0x0L},
+	{0x7CF03F380289AADL,0xBA82C117183E70CL,0xC497D4EF15DAF62L,0x3A5CB0326D6A07AL,0x6BB5E1A9A8B18A9L,0xC030B0F7F010B30L,0x6882F5L,0x0L,0x0L},
+	{0x574A5F3F92279D1L,0xF65745A421E32BFL,0x55555555452152AL,0x555555555555555L,0x5555L,0x0L,0x0L,0x0L,0x0L}};
+const BIG CURVE_BB[4][4]= {{{0xB306BB5E1BD810L,0x82F5C030B0F7F01L,0x68L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L},{0xB306BB5E1BD80FL,0x82F5C030B0F7F01L,0x68L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L},{0xB306BB5E1BD80FL,0x82F5C030B0F7F01L,0x68L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L},{0x5403CE8956259CFL,0xA45BDA397B2D3EL,0xC65DEAB2679A279L,0xCF1EACBE98B8E48L,0x3C111B0EF445146L,0xA1D8CB5307C0BBEL,0xFFFF9EC7F01C60BL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFL}},
+	{{0x1660D76BC37B01FL,0x5EB806161EFE02L,0xD1L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L},{0x5F343A3F37E31DEL,0x8D3B7DD448AAC3FL,0xC65DEAB2679A2E1L,0xCF1EACBE98B8E48L,0x3C111B0EF445146L,0xA1D8CB5307C0BBEL,0xFFFF9EC7F01C60BL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFL},{0x5F343A3F37E31DDL,0x8D3B7DD448AAC3FL,0xC65DEAB2679A2E1L,0xCF1EACBE98B8E48L,0x3C111B0EF445146L,0xA1D8CB5307C0BBEL,0xFFFF9EC7F01C60BL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFL},{0x5F343A3F37E31DEL,0x8D3B7DD448AAC3FL,0xC65DEAB2679A2E1L,0xCF1EACBE98B8E48L,0x3C111B0EF445146L,0xA1D8CB5307C0BBEL,0xFFFF9EC7F01C60BL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFL}},
+	{{0x1660D76BC37B01EL,0x5EB806161EFE02L,0xD1L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L},{0x1660D76BC37B01FL,0x5EB806161EFE02L,0xD1L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L},{0x1660D76BC37B01FL,0x5EB806161EFE02L,0xD1L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L},{0x1660D76BC37B01FL,0x5EB806161EFE02L,0xD1L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L}},
+	{{0x5F343A3F37E31DFL,0x8D3B7DD448AAC3FL,0xC65DEAB2679A2E1L,0xCF1EACBE98B8E48L,0x3C111B0EF445146L,0xA1D8CB5307C0BBEL,0xFFFF9EC7F01C60BL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFL},{0x3DA2F71D92AA9AFL,0x45A3D4235C2F3CL,0xC65DEAB2679A1A8L,0xCF1EACBE98B8E48L,0x3C111B0EF445146L,0xA1D8CB5307C0BBEL,0xFFFF9EC7F01C60BL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFL},{0x1660D76BC37B01DL,0x5EB806161EFE02L,0xD1L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L},{0x5F343A3F37E31DFL,0x8D3B7DD448AAC3FL,0xC65DEAB2679A2E1L,0xCF1EACBE98B8E48L,0x3C111B0EF445146L,0xA1D8CB5307C0BBEL,0xFFFF9EC7F01C60BL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFL}}};
+
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_HIFIVE.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_HIFIVE.cpp
new file mode 100644
index 0000000..3edc1fa
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_HIFIVE.cpp
@@ -0,0 +1,61 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "ecp_HIFIVE.h"
+
+namespace HIFIVE {
+
+/* Curve HIFIVE */
+
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B336_29;
+
+const int CURVE_Cof_I=8;
+const BIG CURVE_Cof= {0x8,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const int CURVE_B_I= 11111;
+const BIG CURVE_B= {0x2B67,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Order= {0x1E9FA805,0x197CACB9,0x1E4EEA9E,0x17AD70F,0x1FA9850C,0x38A0A,0x0,0x0,0x0,0x0,0x0,0x4000};
+const BIG CURVE_Gx= {0xC,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Gy= {0x5FE8632,0x15F63428,0xD976C4,0x1AACA194,0x35B6DB5,0x8E3F7A,0x52D1B0E,0xF0A7A36,0x1C161D00,0x8170C70,0x1185AD59,0x181B};
+const BIG CURVE_HTPC= {0x5531622,0x11FEDF60,0x182A7392,0x16BAC746,0x1A3512D9,0x49580D5,0xE77C13C,0x1AAC2086,0x1E3A6A5,0x2B61FB8,0x783F9C2,0x6C0};
+#endif
+
+#if CHUNK==64
+
+using namespace B336_60;
+
+const int CURVE_Cof_I=8;
+const BIG CURVE_Cof= {0x8L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const int CURVE_B_I= 11111;
+const BIG CURVE_B= {0x2B67L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_Order= {0xB2F95973E9FA805L,0xC0BD6B87F93BAA7L,0x71415FA9850L,0x0L,0x0L,0x200000000L};
+const BIG CURVE_Gx= {0xCL,0x0L,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_Gy= {0x2BEC68505FE8632L,0x5D5650CA0365DB1L,0x3811C7EF435B6DBL,0x7853D1B14B46CL,0x56502E18E1C161DL,0xC0DC616BL};
+const BIG CURVE_HTPC= {0xA3FDBEC05531622L,0x9B5D63A360A9CE4L,0xF092B01ABA3512DL,0xA5D56104339DF04L,0x70856C3F701E3A6L,0x3601E0FEL};
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_JUBJUB.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_JUBJUB.cpp
new file mode 100644
index 0000000..6db686a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_JUBJUB.cpp
@@ -0,0 +1,59 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "ecp_JUBJUB.h"
+
+namespace JUBJUB {
+
+/* JUBJUB Curve  */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B256_29;
+
+const int CURVE_Cof_I= 8;
+const BIG CURVE_Cof= {0x8,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const int CURVE_B_I= 0;
+const BIG CURVE_B= {0x16343EB1,0x832FEB6,0x15E74980,0x1AFEDA6E,0x17FD4292,0x903F35E,0xD23D7F6,0x1CE97F45,0x2A9318};
+const BIG CURVE_Order= {0x16F72CB7,0x4B872F6,0x120420B4,0x10412799,0x3B00A66,0x1D80809A,0x1EA4199C,0x1D4CA675,0xE7DB4};
+const BIG CURVE_Gx= {0x14F976C4,0x1A7678D3,0x1CE7B79F,0x18A8D7E5,0x4882000,0x1A6F801C,0xE329892,0x55F1DFE,0x518397};
+const BIG CURVE_Gy= {0x1349702E,0x35D6B84,0x9A0CEC5,0x190E0FFF,0x1C308096,0x62D5ECE,0x10B27A3F,0x8E5945F,0x3B43F8};
+const BIG CURVE_HTPC= {0x47BBBB6,0x83D77CF,0x1D4C82A6,0x1BFEA2A2,0xD546E25,0x1765A39E,0x7500F8F,0x168566F6,0x62FD68};
+#endif
+
+#if CHUNK==64
+
+using namespace B256_56;
+const int CURVE_Cof_I= 8;
+const BIG CURVE_Cof= {0x8L,0x0L,0x0L,0x0L,0x0L};
+const int CURVE_B_I= 0;
+const BIG CURVE_B= {0x65FD6D6343EB1L,0x7F6D37579D2601L,0x7E6BD7FD4292DL,0x4BFA2B48F5FD92L,0x2A9318E7L};
+const BIG CURVE_Order= {0x970E5ED6F72CB7L,0x2093CCC81082D0L,0x101343B00A668L,0x6533AFA906673BL,0xE7DB4EAL};
+const BIG CURVE_Gx= {0x4ECF1A74F976C4L,0x546BF2F39EDE7FL,0xDF00384882000CL,0xF8EFF38CA624B4L,0x5183972AL};
+const BIG CURVE_Gy= {0x6BAD709349702EL,0x8707FFA6833B14L,0x5ABD9DC308096CL,0x2CA2FC2C9E8FCCL,0x3B43F847L};
+const BIG CURVE_HTPC= {0x7AEF9E47BBBB6L,0xFF515175320A99L,0xCB473CD546E25DL,0x2B37B1D403E3EEL,0x62FD68B4L};
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_MDC.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_MDC.cpp
new file mode 100644
index 0000000..1da8f55
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_MDC.cpp
@@ -0,0 +1,61 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "ecp_MDC.h"
+
+
+namespace MDC {
+
+/* Million Dollar Curve */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B256_28;
+
+const int CURVE_Cof_I= 4;
+const BIG CURVE_Cof= {0x4,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const int CURVE_B_I= 0;
+const BIG CURVE_B= {0x300CF89,0x9309250,0x1F041EE,0x70F63F2,0x9625F12,0xCCFB0CB,0xA7CDFBF,0x1965B68,0x7130452,0x5};
+const BIG CURVE_Order= {0x1B0F7FB,0x8552F42,0x974BB58,0x8975FAF,0xF534FB3,0xBF75E97,0xD14CBE4,0x7515ABE,0xC4EDA2E,0x3};
+const BIG CURVE_Gx= {0xE68363B,0x2C25BFE,0x713E223,0x2ABB8D2,0xF6350D7,0x1E03CBC,0x3D85B42,0x7F903B8,0x681886A,0xB};
+const BIG CURVE_Gy= {0xD2864B5,0x73C355B,0x93A3A7E,0xBC3D81A,0xA421DA8,0xCF6563D,0x359814D,0xB59C0B0,0xA6734E1,0xC};
+const BIG CURVE_HTPC= {0x1,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+#endif
+
+#if CHUNK==64
+
+using namespace B256_56;
+
+const int CURVE_Cof_I= 4;
+const BIG CURVE_Cof= {0x4L,0x0L,0x0L,0x0L,0x0L};
+const int CURVE_B_I= 0;
+const BIG CURVE_B= {0x9309250300CF89L,0x70F63F21F041EEL,0xCCFB0CB9625F12L,0x1965B68A7CDFBFL,0x57130452L};
+const BIG CURVE_Order= {0x8552F421B0F7FBL,0x8975FAF974BB58L,0xBF75E97F534FB3L,0x7515ABED14CBE4L,0x3C4EDA2EL};
+const BIG CURVE_Gx= {0x2C25BFEE68363BL,0x2ABB8D2713E223L,0x1E03CBCF6350D7L,0x7F903B83D85B42L,0xB681886AL};
+const BIG CURVE_Gy= {0x73C355BD2864B5L,0xBC3D81A93A3A7EL,0xCF6563DA421DA8L,0xB59C0B0359814DL,0xCA6734E1L};
+const BIG CURVE_HTPC= {0x1L,0x0L,0x0L,0x0L,0x0L};
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_NIST256.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_NIST256.cpp
new file mode 100644
index 0000000..fd42dc6
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_NIST256.cpp
@@ -0,0 +1,61 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "ecp_NIST256.h"
+
+namespace NIST256 {
+
+/* Curve NIST256 */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B256_28;
+
+const int CURVE_Cof_I=1;
+const BIG CURVE_Cof= {0x1,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const int CURVE_B_I= 0;
+const BIG CURVE_B= {0x7D2604B,0xCE3C3E2,0x3B0F63B,0x6B0CC5,0x6BC651D,0x5576988,0x7B3EBBD,0xAA3A93E,0xAC635D8,0x5};
+const BIG CURVE_Order= {0xC632551,0xB9CAC2F,0x79E84F3,0xFAADA71,0xFFFBCE6,0xFFFFFFF,0xFFFFFF,0x0,0xFFFFFFF,0xF};
+const BIG CURVE_Gx= {0x898C296,0xA13945D,0xB33A0F4,0x7D812DE,0xF27703,0xE563A44,0x7F8BCE6,0xE12C424,0xB17D1F2,0x6};
+const BIG CURVE_Gy= {0x7BF51F5,0xB640683,0x15ECECB,0x33576B3,0xE162BCE,0x4A7C0F9,0xB8EE7EB,0xFE1A7F9,0xFE342E2,0x4};
+const BIG CURVE_HTPC= {0xC613926,0xB847959,0xA9DD42E,0xB001452,0x5548D3E,0x8F44A65,0x45240B3,0xB63723A,0xA2AD82C,0x6};
+
+#endif
+
+#if CHUNK==64
+
+using namespace B256_56;
+
+const int CURVE_Cof_I=1;
+const BIG CURVE_Cof= {0x1L,0x0L,0x0L,0x0L,0x0L};
+const int CURVE_B_I= 0;
+const BIG CURVE_B= {0xCE3C3E27D2604BL,0x6B0CC53B0F63BL,0x55769886BC651DL,0xAA3A93E7B3EBBDL,0x5AC635D8L};
+const BIG CURVE_Order= {0xB9CAC2FC632551L,0xFAADA7179E84F3L,0xFFFFFFFFFFBCE6L,0xFFFFFFL,0xFFFFFFFFL};
+const BIG CURVE_Gx= {0xA13945D898C296L,0x7D812DEB33A0F4L,0xE563A440F27703L,0xE12C4247F8BCE6L,0x6B17D1F2L};
+const BIG CURVE_Gy= {0xB6406837BF51F5L,0x33576B315ECECBL,0x4A7C0F9E162BCEL,0xFE1A7F9B8EE7EBL,0x4FE342E2L};
+const BIG CURVE_HTPC= {0xB847959C613926L,0xB001452A9DD42EL,0x8F44A655548D3EL,0xB63723A45240B3L,0x6A2AD82CL};
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_NIST384.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_NIST384.cpp
new file mode 100644
index 0000000..1349595
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_NIST384.cpp
@@ -0,0 +1,60 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "ecp_NIST384.h"
+
+namespace NIST384 {
+
+/* Curve NIST384 */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B384_29;
+
+const int CURVE_Cof_I=1;
+const BIG CURVE_Cof= {0x1,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const int CURVE_B_I= 0;
+const BIG CURVE_B= {0x13EC2AEF,0x142E476E,0xBB4674A,0xC731B14,0x1875AC65,0x447A809,0x4480C50,0xDDFD028,0x19181D9C,0x1F1FC168,0x623815A,0x47DCFC9,0x1312FA7E,0x59};
+const BIG CURVE_Order= {0xCC52973,0x760CB56,0xC29DEBB,0x141B6491,0x12DDF581,0x6C0FA1B,0x1FFF1D8D,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x7F};
+const BIG CURVE_Gx= {0x12760AB7,0x12A2F1C3,0x154A5B0E,0x5E4BB7E,0x2A38550,0xF0412A,0xE6167DD,0xC5174F3,0x146E1D3B,0x1799056B,0x3AC71C7,0x1D160A6F,0x87CA22B,0x55};
+const BIG CURVE_Gy= {0x10EA0E5F,0x1218EBE4,0x1FA0675E,0x1639C3A,0xB8C00A6,0x1889DAF8,0x11F3A768,0x17A51342,0x9F8F41D,0x1C9496E1,0x1767A62F,0xC4C58DE,0x17DE4A9,0x1B};
+const BIG CURVE_HTPC= {0xDCD21B,0x1213626A,0x1502B4CF,0x85A550E,0x5FEED05,0x13578422,0xED2F57D,0x16A06E8C,0x2E00897,0x1652C3E0,0x12F5A8FF,0x6E2A490,0x6EF0F22,0x5E};
+#endif
+
+#if CHUNK==64
+
+using namespace B384_56;
+
+const int CURVE_Cof_I=1;
+const BIG CURVE_Cof= {0x1L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const int CURVE_B_I= 0;
+const BIG CURVE_B= {0x85C8EDD3EC2AEFL,0x398D8A2ED19D2AL,0x8F5013875AC656L,0xFE814112031408L,0xF82D19181D9C6EL,0xE7E4988E056BE3L,0xB3312FA7E23EL};
+const BIG CURVE_Order= {0xEC196ACCC52973L,0xDB248B0A77AECL,0x81F4372DDF581AL,0xFFFFFFFFC7634DL,0xFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFL};
+const BIG CURVE_Gx= {0x545E3872760AB7L,0xF25DBF55296C3AL,0xE082542A385502L,0x8BA79B9859F741L,0x20AD746E1D3B62L,0x5378EB1C71EF3L,0xAA87CA22BE8BL};
+const BIG CURVE_Gy= {0x431D7C90EA0E5FL,0xB1CE1D7E819D7AL,0x13B5F0B8C00A60L,0x289A147CE9DA31L,0x92DC29F8F41DBDL,0x2C6F5D9E98BF92L,0x3617DE4A9626L};
+const BIG CURVE_HTPC= {0x426C4D40DCD21BL,0x2D2A87540AD33EL,0xAF08445FEED054L,0x37463B4BD5F66L,0x587C02E00897B5L,0x52484BD6A3FECAL,0xBC6EF0F22371L};
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_NIST521.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_NIST521.cpp
new file mode 100644
index 0000000..68d48ae
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_NIST521.cpp
@@ -0,0 +1,60 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "ecp_NIST521.h"
+
+namespace NIST521 {
+
+/* Curve NIST521 */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B528_28;
+
+const int CURVE_Cof_I=1;
+const BIG CURVE_Cof= {0x1,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const int CURVE_B_I= 0;
+const BIG CURVE_B= {0xB503F00,0x451FD46,0xC34F1EF,0xDF883D2,0xF073573,0xBD3BB1B,0xB1652C0,0xEC7E937,0x6193951,0xF109E15,0x489918E,0x15F3B8B,0x25B99B3,0xEEA2DA7,0xB68540,0x929A21A,0xE1C9A1F,0x3EB9618,0x5195};
+const BIG CURVE_Order= {0x1386409,0x6FB71E9,0xC47AEBB,0xC9B8899,0x5D03BB5,0x48F709A,0xB7FCC01,0xBF2F966,0x1868783,0xFFFFFA5,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0x1FFFF};
+const BIG CURVE_Gx= {0x2E5BD66,0x7E7E31C,0xA429BF9,0xB3C1856,0x8DE3348,0x27A2FFA,0x8FE1DC1,0xEFE7592,0x14B5E77,0x4D3DBAA,0x8AF606B,0xB521F82,0x139053F,0x429C648,0x62395B4,0x9E3ECB6,0x404E9CD,0x8E06B70,0xC685};
+const BIG CURVE_Gy= {0xFD16650,0xBE94769,0x2C24088,0x7086A27,0x761353C,0x13FAD0,0xC550B9,0x5EF4264,0x7EE7299,0x3E662C9,0xFBD1727,0x446817A,0x449579B,0xD998F54,0x42C7D1B,0x5C8A5FB,0xA3BC004,0x296A789,0x11839};
+const BIG CURVE_HTPC= {0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFF};
+#endif
+
+#if CHUNK==64
+
+using namespace B528_60;
+
+const int CURVE_Cof_I=1;
+const BIG CURVE_Cof= {0x1L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const int CURVE_B_I= 0;
+const BIG CURVE_B= {0xF451FD46B503F00L,0x73DF883D2C34F1EL,0x2C0BD3BB1BF0735L,0x3951EC7E937B165L,0x9918EF109E15619L,0x5B99B315F3B8B48L,0xB68540EEA2DA72L,0x8E1C9A1F929A21AL,0x51953EB961L};
+const BIG CURVE_Order= {0xB6FB71E91386409L,0xB5C9B8899C47AEBL,0xC0148F709A5D03BL,0x8783BF2F966B7FCL,0xFFFFFFFFFFA5186L,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0x1FFFFFFFFFFL};
+const BIG CURVE_Gx= {0x97E7E31C2E5BD66L,0x48B3C1856A429BFL,0xDC127A2FFA8DE33L,0x5E77EFE75928FE1L,0xF606B4D3DBAA14BL,0x39053FB521F828AL,0x62395B4429C6481L,0x404E9CD9E3ECB6L,0xC6858E06B7L};
+const BIG CURVE_Gy= {0x8BE94769FD16650L,0x3C7086A272C2408L,0xB9013FAD076135L,0x72995EF42640C55L,0xD17273E662C97EEL,0x49579B446817AFBL,0x42C7D1BD998F544L,0x9A3BC0045C8A5FBL,0x11839296A78L};
+const BIG CURVE_HTPC= {0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFL};
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_NUMS256E.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_NUMS256E.cpp
new file mode 100644
index 0000000..d35fbd1
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_NUMS256E.cpp
@@ -0,0 +1,68 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "ecp_NUMS256E.h"
+
+namespace NUMS256E {
+
+/*  NUMS 256-bit Curve - Edwards */
+
+#if CHUNK==16
+
+using namespace B256_13;
+
+const int CURVE_Cof_I=4;
+const BIG CURVE_Cof= {0x4,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const int CURVE_B_I= -15342;
+const BIG CURVE_B= {0x355,0x1FFE,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FF};
+const BIG CURVE_Order= {0xAF5,0x16EA,0x43B,0xF63,0x11A4,0x1CD,0x1D65,0x14A5,0x155A,0x20C,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x80};
+const BIG CURVE_Gx= {0x13DA,0x1768,0x40B,0x1D81,0xA0D,0x1AC3,0xC20,0x1DC,0x198A,0x1061,0x6F5,0x1241,0x15F6,0xF1E,0x1734,0x46F,0xAEA,0x7DB,0x1D45,0x114};
+const BIG CURVE_Gy= {0x9E6,0xC54,0x19DE,0xC2D,0x12FA,0x1769,0x215,0x1B02,0x1F61,0x38A,0x4,0xC97,0x1D9A,0xB32,0x1F3A,0x4B8,0x19D9,0x14FE,0x154F,0x89};
+const BIG CURVE_HTPC= {0x1,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+#endif
+
+#if CHUNK==32
+
+using namespace B256_29;
+
+const int CURVE_Cof_I=4;
+const BIG CURVE_Cof= {0x4,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const int CURVE_B_I= -15342;
+const BIG CURVE_B= {0x1FFFC355,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0xFFFFFF};
+const BIG CURVE_Order= {0xEDD4AF5,0x123D8C87,0x1650E6C6,0xAB54A5E,0x419,0x0,0x0,0x0,0x400000};
+const BIG CURVE_Gx= {0xEED13DA,0x6F60481,0x20D61A8,0x13141DC6,0x9BD60C3,0x1EAFB490,0xDF73478,0x1F6D5D44,0x8A7514};
+const BIG CURVE_Gy= {0x198A89E6,0x1D30B73B,0x15BB4CB,0x1EC3B021,0x18010715,0x12ECD325,0x171F3A59,0x13FB3B24,0x44D53E};
+const BIG CURVE_HTPC= {0x1,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+#endif
+
+#if CHUNK==64
+
+using namespace B256_56;
+
+const int CURVE_Cof_I=4;
+const BIG CURVE_Cof= {0x4L,0x0L,0x0L,0x0L,0x0L};
+const int CURVE_B_I= -15342;
+const BIG CURVE_B= {0xFFFFFFFFFFC355L,0xFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFL,0xFFFFFFFFL};
+const BIG CURVE_Order= {0x47B190EEDD4AF5L,0x5AA52F59439B1AL,0x4195L,0x0L,0x40000000L};
+const BIG CURVE_Gx= {0xDEC0902EED13DAL,0x8A0EE3083586A0L,0x5F69209BD60C39L,0x6AEA237DCD1E3DL,0x8A7514FBL};
+const BIG CURVE_Gy= {0xA616E7798A89E6L,0x61D810856ED32FL,0xD9A64B8010715FL,0xD9D925C7CE9665L,0x44D53E9FL};
+const BIG CURVE_HTPC= {0x1L,0x0L,0x0L,0x0L,0x0L};
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_NUMS256W.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_NUMS256W.cpp
new file mode 100644
index 0000000..16da170
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_NUMS256W.cpp
@@ -0,0 +1,60 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "ecp_NUMS256W.h"
+
+namespace NUMS256W {
+
+/*  NUMS 256-bit Curve - Weierstrass */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B256_28;
+
+const int CURVE_Cof_I=1;
+const BIG CURVE_Cof= {0x1,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const int CURVE_B_I= 152961;
+const BIG CURVE_B= {0x25581,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Order= {0x751A825,0xAB20294,0x65C6020,0x8275EA2,0xFFFE43C,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xF};
+const BIG CURVE_Gx= {0x21AACB1,0x52EE1EB,0x4C73ABC,0x9B0903D,0xB098357,0xA04F42C,0x1297A95,0x5AAADB6,0xC9ED6B6,0xB};
+const BIG CURVE_Gy= {0x184DE9F,0xB5B9CB2,0x10FBB80,0xC3D1153,0x35C955,0xF77E04E,0x673448B,0x3399B6A,0x8FC0F1,0xD};
+const BIG CURVE_HTPC= {0x52B84D6,0xFC6F759,0xE89E05,0x92C6204,0x6AE4640,0x70CADDC,0x5B22ED0,0x5411E3B,0xF7F44E4,0xC};
+#endif
+
+#if CHUNK==64
+
+using namespace B256_56;
+
+const int CURVE_Cof_I=1;
+const BIG CURVE_Cof= {0x1L,0x0L,0x0L,0x0L,0x0L};
+const int CURVE_B_I= 152961;
+const BIG CURVE_B= {0x25581L,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_Order= {0xAB20294751A825L,0x8275EA265C6020L,0xFFFFFFFFFFE43CL,0xFFFFFFFFFFFFFFL,0xFFFFFFFFL};
+const BIG CURVE_Gx= {0x52EE1EB21AACB1L,0x9B0903D4C73ABCL,0xA04F42CB098357L,0x5AAADB61297A95L,0xBC9ED6B6L};
+const BIG CURVE_Gy= {0xB5B9CB2184DE9FL,0xC3D115310FBB80L,0xF77E04E035C955L,0x3399B6A673448BL,0xD08FC0F1L};
+const BIG CURVE_HTPC= {0xFC6F75952B84D6L,0x92C62040E89E05L,0x70CADDC6AE4640L,0x5411E3B5B22ED0L,0xCF7F44E4L};
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_NUMS384E.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_NUMS384E.cpp
new file mode 100644
index 0000000..6f12a5b
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_NUMS384E.cpp
@@ -0,0 +1,61 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "ecp_NUMS384E.h"
+
+namespace NUMS384E {
+
+/*  NUMS 384-bit Curve - Edwards */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B384_29;
+
+const int CURVE_Cof_I=4;
+const BIG CURVE_Cof= {0x4,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const int CURVE_B_I= -11556;
+const BIG CURVE_B= {0x1FFFD19F,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x7F};
+const BIG CURVE_Order= {0x6A3897D,0x5CEE627,0xD721E48,0x8AAB556,0x1E1CF61E,0xD0E5A35,0x1FFF891C,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1F};
+const BIG CURVE_Gx= {0xC206BDE,0x6AA0723,0x116504D4,0x52562CA,0x163406FF,0x1FD47998,0x10015D8F,0x8DCB7C9,0x15B30BF4,0x14D72AED,0x102DA884,0xB524CD9,0x1B111FB4,0x30};
+const BIG CURVE_Gy= {0x10729392,0xC681F0F,0x1B123727,0x561F28D,0x1964B007,0xC7BFB22,0x1D5A0C3E,0xE9E284B,0x1716AD82,0x11D886E,0x1CE2C69,0x134DDD61,0x983E67B,0x41};
+const BIG CURVE_HTPC= {0x1,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+#endif
+
+#if CHUNK==64
+
+using namespace B384_58;
+
+const int CURVE_Cof_I= 4;
+const BIG CURVE_Cof= {0x4L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const int CURVE_B_I= -11556;
+const BIG CURVE_B= {0x3FFFFFFFFFFD19FL,0x3FFFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFFL,0xFFFFFFFFFL};
+const BIG CURVE_Order= {0xB9DCC4E6A3897DL,0x11556AACD721E48L,0x1A1CB46BE1CF61EL,0x3FFFFFFFFFF891CL,0x3FFFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFFL,0x3FFFFFFFFL};
+const BIG CURVE_Gx= {0xD540E46C206BDEL,0xA4AC59516504D4L,0x3FA8F33163406FFL,0x11B96F930015D8FL,0x29AE55DB5B30BF4L,0x16A499B302DA884L,0x61B111FB4L};
+const BIG CURVE_Gy= {0x18D03E1F0729392L,0xAC3E51BB123727L,0x18F7F645964B007L,0x1D3C5097D5A0C3EL,0x23B10DD716AD82L,0x269BBAC21CE2C69L,0x82983E67BL};
+const BIG CURVE_HTPC= {0x1L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_NUMS384W.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_NUMS384W.cpp
new file mode 100644
index 0000000..6b1741b
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_NUMS384W.cpp
@@ -0,0 +1,60 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "ecp_NUMS384W.h"
+
+namespace NUMS384W {
+
+/*  NUMS 384-bit Curve - Weierstrass */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B384_29;
+
+const int CURVE_Cof_I=1;
+const BIG CURVE_Cof= {0x1,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const int CURVE_B_I= -34568;
+const BIG CURVE_B= {0x1FFF77BB,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x7F};
+const BIG CURVE_Order= {0x1B0E61B9,0x26C0FB3,0xDF89E98,0x153A7A98,0x16881BED,0x178F75AE,0x1FFF587A,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x7F};
+const BIG CURVE_Gx= {0x98152A,0x1CE5D021,0x18711EFA,0x1DDA201E,0xC742522,0x148D9536,0x7D3CEF4,0x19BF703F,0x60225C1,0x12082F8D,0x12203288,0x2DE3038,0x17956F0B,0x3A};
+const BIG CURVE_Gy= {0x6180716,0x3A5C763,0x1D2B4997,0xD69B77F,0x837EBCD,0x1BE890D,0xE72E482,0xEFF0FEE,0x1EB00469,0x2C267B,0x15F8CF4C,0x3371C71,0xDEE368E,0x56};
+const BIG CURVE_HTPC= {0x1FFFFF61,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x3F};
+#endif
+
+#if CHUNK==64
+
+using namespace B384_58;
+
+const int CURVE_Cof_I= 1;
+const BIG CURVE_Cof= {0x1L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const int CURVE_B_I= -34568;
+const BIG CURVE_B= {0x3FFFFFFFFFF77BBL,0x3FFFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFFL,0xFFFFFFFFFL};
+const BIG CURVE_Order= {0x4D81F67B0E61B9L,0x2A74F530DF89E98L,0x2F1EEB5D6881BEDL,0x3FFFFFFFFFF587AL,0x3FFFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFFL,0xFFFFFFFFFL};
+const BIG CURVE_Gx= {0x39CBA042098152AL,0x3BB4403D8711EFAL,0x291B2A6CC742522L,0x337EE07E7D3CEF4L,0x24105F1A60225C1L,0x5BC60712203288L,0x757956F0BL};
+const BIG CURVE_Gy= {0x74B8EC66180716L,0x1AD36EFFD2B4997L,0x37D121A837EBCDL,0x1DFE1FDCE72E482L,0x584CF7EB00469L,0x66E38E35F8CF4CL,0xACDEE368EL};
+const BIG CURVE_HTPC= {0x3FFFFFFFFFFFF61L,0x3FFFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFFL,0x7FFFFFFFFL};
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_NUMS512E.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_NUMS512E.cpp
new file mode 100644
index 0000000..d9138d9
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_NUMS512E.cpp
@@ -0,0 +1,61 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "ecp_NUMS512E.h"
+
+namespace NUMS512E {
+
+/*  NUMS 512-bit Curve - Edwards */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B512_29;
+
+const int CURVE_Cof_I=4;
+const BIG CURVE_Cof= {0x4,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const int CURVE_B_I= -78296;
+const BIG CURVE_B= {0x1FFECBEF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x7FFFF};
+const BIG CURVE_Order= {0x1BEED46D,0x1A3467A8,0x1BFB3FD9,0xC0AF0DB,0x86F52A4,0xC64B85B,0x6EA78FF,0xDA5F9F2,0x1FB4F063,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFF};
+const BIG CURVE_Gx= {0x19EC57FE,0xDCD594C,0x113C0571,0xA4A84F9,0x104AD0FE,0x4C92B44,0xC3DE2F7,0x9DDC8CE,0x74621C1,0x1139DC0A,0x9E85FAF,0x1B894704,0x1D1E79F4,0x9E29997,0x32DE223,0x16D38F43,0x116D128D,0x6FC71};
+const BIG CURVE_Gy= {0x1E2F5E1,0x136EF606,0x1C7407CC,0xDA71537,0xC1FD026,0x3431576,0x15898068,0x1E5D32C6,0x120CA53,0xC84F41A,0xA4ADAE5,0x104B3A45,0x76F726D,0x1512B772,0x3D5DEA0,0x194E3316,0x1FF39D49,0x3684D};
+const BIG CURVE_HTPC= {0x1FFFFDC6,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x7FFFF};
+#endif
+
+#if CHUNK==64
+
+using namespace B512_60;
+
+const int CURVE_Cof_I= 4;
+const BIG CURVE_Cof= {0x4L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const int CURVE_B_I= -78296;
+const BIG CURVE_B= {0xFFFFFFFFFFECBEFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFL};
+const BIG CURVE_Order= {0x7468CF51BEED46DL,0x4605786DEFECFF6L,0xFD8C970B686F52AL,0x636D2FCF91BA9E3L,0xFFFFFFFFFFFB4F0L,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0x3FFFFFFFL};
+const BIG CURVE_Gx= {0x5B9AB2999EC57FEL,0xE525427CC4F015CL,0xDC992568904AD0FL,0xC14EEE46730F78BL,0xEBE273B81474621L,0x9F4DC4A38227A17L,0x888D3C5332FD1E7L,0x128DB69C7A18CB7L,0xDF8E316DL};
+const BIG CURVE_Gy= {0x26DDEC0C1E2F5E1L,0x66D38A9BF1D01F3L,0xA06862AECC1FD02L,0x53F2E9963562601L,0xB95909E834120CAL,0x26D8259D22A92B6L,0x7A82A256EE476F7L,0x9D49CA7198B0F57L,0x6D09BFF3L};
+const BIG CURVE_HTPC= {0xFFFFFFFFFFFFDC6L,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFL};
+
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_NUMS512W.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_NUMS512W.cpp
new file mode 100644
index 0000000..616f30b
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_NUMS512W.cpp
@@ -0,0 +1,60 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "ecp_NUMS512W.h"
+
+namespace NUMS512W {
+
+/*  NUMS 512-bit Curve - Weierstrass */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B512_29;
+
+const int CURVE_Cof_I=1;
+const BIG CURVE_Cof= {0x1,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const int CURVE_B_I= 121243;
+const BIG CURVE_B= {0x1D99B,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Order= {0x433555D,0x10A9F9C8,0x1F3490F3,0xD166CC0,0xBDC63B5,0xC76CBE8,0xC6D3F09,0x1F729CF0,0x1F5B3CA4,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x7FFFF};
+const BIG CURVE_Gx= {0xCABAE57,0x4143CAC,0x1BD778B7,0x1AC026FA,0x15831D5,0x14312AB,0x167A4DE5,0xA20ED66,0x195021A1,0x129836CF,0x1141B830,0xA03ED0A,0xCAD83BB,0x1E9DA94C,0xDC00A80,0x1527B45,0x1447141D,0x1D601};
+const BIG CURVE_Gy= {0x183527A6,0x1D043B01,0x1F43FA48,0x16B83C99,0x5602CF2,0x1420592D,0x17A70486,0x1B5161DD,0x14A28415,0x3DE8A78,0x3D2C983,0x17797719,0x197DBDEA,0x15D88025,0x1BBB718F,0xAD679C1,0x14CA29AD,0x4A1D2};
+const BIG CURVE_HTPC= {0x1FFFFEE3,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x3FFFF};
+#endif
+
+#if CHUNK==64
+
+using namespace B512_60;
+
+const int CURVE_Cof_I= 1;
+const BIG CURVE_Cof= {0x1L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const int CURVE_B_I= 121243;
+const BIG CURVE_B= {0x1D99BL,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_Order= {0xE153F390433555DL,0x568B36607CD243CL,0x258ED97D0BDC63BL,0xA4FB94E7831B4FCL,0xFFFFFFFFFFF5B3CL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFL};
+const BIG CURVE_Gx= {0xC8287958CABAE57L,0x5D60137D6F5DE2DL,0x94286255615831DL,0xA151076B359E937L,0xC25306D9F95021L,0x3BB501F6854506EL,0x2A03D3B5298CAD8L,0x141D0A93DA2B700L,0x3AC03447L};
+const BIG CURVE_Gy= {0x3A08760383527A6L,0x2B5C1E4CFD0FE92L,0x1A840B25A5602CFL,0x15DA8B0EEDE9C12L,0x60C7BD14F14A284L,0xDEABBCBB8C8F4B2L,0xC63EBB1004B97DBL,0x29AD56B3CE0EEEDL,0x943A54CAL};
+const BIG CURVE_HTPC= {0xFFFFFFFFFFFFEE3L,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0x7FFFFFFFL};
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_SECP160R1.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_SECP160R1.cpp
new file mode 100644
index 0000000..03ffa33
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_SECP160R1.cpp
@@ -0,0 +1,71 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "ecp_SECP160R1.h"
+
+namespace SECP160R1 {
+
+/* Curve SECP160R1 */
+
+#if CHUNK==16
+
+using namespace B160_13;
+// Base Bits= 13
+
+const int CURVE_Cof_I= 1;
+const BIG CURVE_Cof= {0x1,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const int CURVE_B_I= 0;
+const BIG CURVE_B= {0x1A45,0xB2F,0xB71,0x9A9,0x181D,0x1C4F,0x16B3,0x116C,0x1D7A,0x2A5,0xFBF,0x192F,0x1};
+const BIG CURVE_Order= {0x257,0x13A9,0x14F2,0xF5D,0xF92,0x1A64,0x7,0x0,0x0,0x0,0x0,0x0,0x10};
+const BIG CURVE_Gx= {0x1C82,0x1E5F,0xE44,0x717,0x168C,0x14C4,0x1991,0x508,0x1573,0x477,0xD5A,0x152D,0x4};
+const BIG CURVE_Gy= {0x1B32,0x162F,0xDDE,0x6A2,0x42,0x489,0x773,0xFAB,0x894,0x98B,0xA15,0x74C,0x2};
+const BIG CURVE_HTPC= {0xDA,0x12DE,0x1CE8,0x15F5,0x105D,0x1539,0xB39,0xDF,0x1A61,0x166A,0xF40,0x1CA1,0x1};
+#endif
+
+#if CHUNK==32
+
+using namespace B160_29;
+
+const int CURVE_Cof_I= 1;
+const BIG CURVE_Cof= {0x1,0x0,0x0,0x0,0x0,0x0};
+const int CURVE_B_I= 0;
+const BIG CURVE_B= {0x565FA45,0xEA6A56E,0xB3E27E0,0x1AF516CB,0x1BEFC54B,0xE4B};
+const BIG CURVE_Order= {0xA752257,0x93D769E,0x7D323E,0x0,0x0,0x8000};
+const BIG CURVE_Gx= {0x13CBFC82,0x61C5DC8,0x191A625A,0xAE6508C,0xB5688EF,0x254B};
+const BIG CURVE_Gy= {0x1AC5FB32,0x11A89BB,0x17324481,0x1128FAB3,0x2855316,0x11D3};
+const BIG CURVE_HTPC= {0x25BC0DA,0xED7D79D,0x139A9CC1,0x14C20DF5,0xBD02CD5,0xF28};
+#endif
+
+#if CHUNK==64
+
+using namespace B160_56;
+
+// Base Bits= 56
+const int CURVE_Cof_I= 1;
+const BIG CURVE_Cof= {0x1L,0x0L,0x0L};
+const int CURVE_B_I= 0;
+const BIG CURVE_B= {0xD4D4ADC565FA45L,0x7A8B65ACF89F81L,0x1C97BEFC54BDL};
+const BIG CURVE_Order= {0x27AED3CA752257L,0x1F4C8F9L,0x1000000000000L};
+const BIG CURVE_Gx= {0xC38BB913CBFC82L,0x73284664698968L,0x4A96B5688EF5L};
+const BIG CURVE_Gy= {0x2351377AC5FB32L,0x947D59DCC91204L,0x23A628553168L};
+const BIG CURVE_HTPC= {0xDAFAF3A25BC0DAL,0x6106FACE6A7305L,0x1E50BD02CD5AL};
+
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_SECP256K1.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_SECP256K1.cpp
new file mode 100644
index 0000000..5241cb1
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_SECP256K1.cpp
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "ecp_SECP256K1.h"
+
+namespace SECP256K1 {
+
+/* Curve SECP256K1 */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B256_28;
+
+const int CURVE_Cof_I=1;
+const BIG CURVE_Cof= {0x1,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const int CURVE_B_I= 7;
+const BIG CURVE_B= {0x7,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Order= {0x364141,0xD25E8CD,0x8A03BBF,0xDCE6AF4,0xFFEBAAE,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xF};
+const BIG CURVE_Gx= {0x6F81798,0xF2815B1,0xE28D959,0xFCDB2DC,0xB07029B,0x95CE870,0xC55A062,0xF9DCBBA,0x9BE667E,0x7};
+const BIG CURVE_Gy= {0xB10D4B8,0x47D08FF,0x554199C,0xB448A68,0x8A8FD17,0xFC0E110,0x55DA4FB,0x26A3C46,0x83ADA77,0x4};
+//const BIG HTPC= {0xCD5F852,0x8D27AE1,0x4ECD47D,0x6D15DA1,0x62CC61F,0xC2A7979,0xF233770,0x3507F1D,0xA2D2BA9,0x0};
+const BIG CURVE_HTPC= {0xE8624AA,0xC813789,0xF508ECD,0xCA45C23,0xD8BBBFD,0x640A39C,0xF4D5B4,0x813FFE3,0xCE8E9E8,0xC};
+
+#if HTC_ISO_SECP256K1 != 0
+const BIG CURVE_Ad= {0xA444533,0x5447C01,0xF0E5D40,0xD363CB6,0x272E953,0x58F0F5D,0xCA08A55,0xDD661AD,0xF8731AB,0x3};
+const BIG CURVE_Bd= {0x6EB,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG PC[13]= {{0xAAAA88C,0x38E38DA,0xE38E38E,0x8E38E38,0x38E38E3,0xE38E38E,0x8E38E38,0x38E38E3,0xE38E38E,0x8},{0xD9DD262,0xCBD0B53,0xC40314E,0x6144037,0xAECE450,0xDECA25C,0x6E2A413,0x23F234E,0x34C328D,0x5},{0x17C6581,0xFF1044F,0x63B92DF,0xD2FC0BF,0x4C5D595,0xCEA7FD4,0x5B9F315,0xBC321D,0x7D3D4C8,0x0},{0xAAAA8C7,0x38E38DA,0xE38E38E,0x8E38E38,0x38E38E3,0xE38E38E,0x8E38E38,0x38E38E3,0xE38E38E,0x8},{0xA8C6D14,0x2A56612,0xE41BBC5,0x6B641F5,0x25406D3,0xD51B542,0xDF7C4B2,0x4383DC1,0xDADC6F6,0xE},{0x81EB49B,0xE6B7457,0x8487D9F,0x409542F,0xDD86CD,0xCBB7B64,0xA9CA34C,0x3D94918,0x3577119,0xD},{0x8E38D84,0xBDA12F3,0xA12F684,0x2F684BD,0x684BDA1,0x4BDA12F,0xDA12F68,0x12F684B,0xF684BDA,0x2},{0xECEE931,0x65E85A9,0xE2018A7,0x30A201B,0x5767228,0xEF6512E,0x3715209,0x91F91A7,0x9A61946,0x2},{0x1D71A3,0xFC90FC2,0x6DA6FDF,0xB046D68,0x6D5647A,0x4B12A0A,0xFA9D0A5,0xD5CB7C0,0x75E0C32,0xC},{0xE38E23C,0x2F684B8,0x684BDA1,0x4BDA12F,0xDA12F68,0x12F684B,0xF684BDA,0x84BDA12,0xBDA12F6,0x4},{0xFD2A76F,0xBF8192B,0xD6299A7,0x21162F0,0x37E0A3D,0x3FA8FE3,0xCF3A70C,0x6545CA2,0x484AA71,0x6},{0x85C2573,0xB425D26,0x8D978DF,0xC1BFC8E,0x2989467,0x632722C,0xFD5E9E6,0xB8BDB49,0xA06534B,0x7},{0xFFFF93B,0xFFFFFEF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xF}};
+#endif
+
+#endif
+
+#if CHUNK==64
+
+using namespace B256_56;
+
+// Base Bits= 56
+const int CURVE_Cof_I=1;
+const BIG CURVE_Cof= {0x1L,0x0L,0x0L,0x0L,0x0L};
+const int CURVE_B_I= 7;
+const BIG CURVE_B= {0x7L,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_Order= {0xD25E8CD0364141L,0xDCE6AF48A03BBFL,0xFFFFFFFFFEBAAEL,0xFFFFFFFFFFFFFFL,0xFFFFFFFFL};
+const BIG CURVE_Gx= {0xF2815B16F81798L,0xFCDB2DCE28D959L,0x95CE870B07029BL,0xF9DCBBAC55A062L,0x79BE667EL};
+const BIG CURVE_Gy= {0x47D08FFB10D4B8L,0xB448A68554199CL,0xFC0E1108A8FD17L,0x26A3C4655DA4FBL,0x483ADA77L};
+//const BIG HTPC= {0x8D27AE1CD5F852L,0x6D15DA14ECD47DL,0xC2A797962CC61FL,0x3507F1DF233770L,0xA2D2BA9L};
+const BIG CURVE_HTPC= {0xC813789E8624AAL,0xCA45C23F508ECDL,0x640A39CD8BBBFDL,0x813FFE30F4D5B4L,0xCCE8E9E8L};
+
+#if HTC_ISO_SECP256K1 != 0
+const BIG CURVE_Ad= {0x5447C01A444533L,0xD363CB6F0E5D40L,0x58F0F5D272E953L,0xDD661ADCA08A55L,0x3F8731ABL};
+const BIG CURVE_Bd= {0x6EBL,0x0L,0x0L,0x0L,0x0L};
+const BIG PC[13]= {{0x38E38DAAAAA88CL,0x8E38E38E38E38EL,0xE38E38E38E38E3L,0x38E38E38E38E38L,0x8E38E38EL},{0xCBD0B53D9DD262L,0x6144037C40314EL,0xDECA25CAECE450L,0x23F234E6E2A413L,0x534C328DL},{0xFF1044F17C6581L,0xD2FC0BF63B92DFL,0xCEA7FD44C5D595L,0xBC321D5B9F315L,0x7D3D4C8L},{0x38E38DAAAAA8C7L,0x8E38E38E38E38EL,0xE38E38E38E38E3L,0x38E38E38E38E38L,0x8E38E38EL},{0x2A56612A8C6D14L,0x6B641F5E41BBC5L,0xD51B54225406D3L,0x4383DC1DF7C4B2L,0xEDADC6F6L},{0xE6B745781EB49BL,0x409542F8487D9FL,0xCBB7B640DD86CDL,0x3D94918A9CA34CL,0xD3577119L},{0xBDA12F38E38D84L,0x2F684BDA12F684L,0x4BDA12F684BDA1L,0x12F684BDA12F68L,0x2F684BDAL},{0x65E85A9ECEE931L,0x30A201BE2018A7L,0xEF6512E5767228L,0x91F91A73715209L,0x29A61946L},{0xFC90FC201D71A3L,0xB046D686DA6FDFL,0x4B12A0A6D5647AL,0xD5CB7C0FA9D0A5L,0xC75E0C32L},{0x2F684B8E38E23CL,0x4BDA12F684BDA1L,0x12F684BDA12F68L,0x84BDA12F684BDAL,0x4BDA12F6L},{0xBF8192BFD2A76FL,0x21162F0D6299A7L,0x3FA8FE337E0A3DL,0x6545CA2CF3A70CL,0x6484AA71L},{0xB425D2685C2573L,0xC1BFC8E8D978DFL,0x632722C2989467L,0xB8BDB49FD5E9E6L,0x7A06534BL},{0xFFFFFEFFFFF93BL,0xFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFL,0xFFFFFFFFL}};
+#endif
+
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_SM2.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_SM2.cpp
new file mode 100644
index 0000000..ddf9230
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_SM2.cpp
@@ -0,0 +1,61 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "ecp_SM2.h"
+
+namespace SM2 {
+
+/* Curve SM2 */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B256_28;
+
+const int CURVE_Cof_I= 1;
+const BIG CURVE_Cof= {0x1,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const int CURVE_B_I= 0;
+const BIG CURVE_B= {0xD940E93,0xBCBD414,0xB8F92DD,0x89F515A,0x9A7F397,0x4BCF650,0x44D5A9E,0x9D9F5E3,0x8E9FA9E,0x2};
+const BIG CURVE_Order= {0x9D54123,0xBBF4093,0x6052B53,0xDF6B21C,0xFFF7203,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFE,0xF};
+const BIG CURVE_Gx= {0x34C74C7,0x5A45893,0x60BE171,0xBBFF26,0x9948FE3,0x466A39C,0x95F9904,0x1F19811,0x2C4AE2C,0x3};
+const BIG CURVE_Gy= {0x139F0A0,0xDF32E52,0xA474002,0x877CC62,0x153D0A9,0xE36B692,0xC59BDCE,0xF4F6779,0xC3736A2,0xB};
+const BIG CURVE_HTPC= {0xFFFFFFF,0xFFFFFFF,0x55555FF,0xFFFF555,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xAAAAAA9,0xA};
+
+#endif
+
+#if CHUNK==64
+
+using namespace B256_56;
+
+const int CURVE_Cof_I= 1;
+const BIG CURVE_Cof= {0x1L,0x0L,0x0L,0x0L,0x0L};
+const int CURVE_B_I= 0;
+const BIG CURVE_B= {0xBCBD414D940E93L,0x89F515AB8F92DDL,0x4BCF6509A7F397L,0x9D9F5E344D5A9EL,0x28E9FA9EL};
+const BIG CURVE_Order= {0xBBF40939D54123L,0xDF6B21C6052B53L,0xFFFFFFFFFF7203L,0xFFFFFFFFFFFFFFL,0xFFFFFFFEL};
+const BIG CURVE_Gx= {0x5A4589334C74C7L,0xBBFF2660BE171L,0x466A39C9948FE3L,0x1F1981195F9904L,0x32C4AE2CL};
+const BIG CURVE_Gy= {0xDF32E52139F0A0L,0x877CC62A474002L,0xE36B692153D0A9L,0xF4F6779C59BDCEL,0xBC3736A2L};
+const BIG CURVE_HTPC= {0xFFFFFFFFFFFFFFL,0xFFFF55555555FFL,0xFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFL,0xAAAAAAA9L};
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_TWEEDLEDEE.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_TWEEDLEDEE.cpp
new file mode 100644
index 0000000..7e6e35a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_TWEEDLEDEE.cpp
@@ -0,0 +1,62 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "ecp_TWEEDLEDEE.h"
+
+
+namespace TWEEDLEDEE {
+/* TWEEDLEDEE Curve */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B256_29;
+
+//*** rom curve parameters *****
+const int CURVE_Cof_I= 1;
+const BIG CURVE_Cof= {0x1,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const int CURVE_B_I= 5;
+const BIG CURVE_B= {0x5,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Order= {0x1,0xA032710,0xFD66E68,0x15424ED8,0x38,0x0,0x0,0x0,0x400000};
+const BIG CURVE_Gx= {0x0,0x1657EA0,0x18A1B261,0x15424ED2,0x38,0x0,0x0,0x0,0x400000};
+const BIG CURVE_Gy= {0x2,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_HTPC= {0xD69C848,0x1C30E5ED,0xBBDA1CC,0x180EA8CE,0xE9704A,0x1172DE0D,0x1C820B1A,0x1BC54C92,0x3AC188};
+#endif
+
+#if CHUNK==64
+
+using namespace B256_56;
+
+//*** rom curve parameters *****
+const int CURVE_Cof_I= 1;
+const BIG CURVE_Cof= {0x1L,0x0L,0x0L,0x0L,0x0L};
+const int CURVE_B_I= 5;
+const BIG CURVE_B= {0x5L,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_Order= {0x4064E200000001L,0xA1276C3F59B9A1L,0x38AL,0x0L,0x40000000L};
+const BIG CURVE_Gx= {0x2CAFD400000000L,0xA127696286C984L,0x38AL,0x0L,0x40000000L};
+const BIG CURVE_Gy= {0x2L,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_HTPC= {0x861CBDAD69C848L,0x754672EF68733L,0xE5BC1A0E9704ACL,0x2A64972082C6A2L,0x3AC188DEL};
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_TWEEDLEDUM.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_TWEEDLEDUM.cpp
new file mode 100644
index 0000000..bfe803e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_TWEEDLEDUM.cpp
@@ -0,0 +1,62 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "ecp_TWEEDLEDUM.h"
+
+
+namespace TWEEDLEDUM {
+/* TWEEDLEDUM Curve */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B256_29;
+
+//*** rom curve parameters *****
+const int CURVE_Cof_I= 1;
+const BIG CURVE_Cof= {0x1,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const int CURVE_B_I= 5;
+const BIG CURVE_B= {0x5,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Order= {0x1,0x1657EA0,0x18A1B261,0x15424ED2,0x38,0x0,0x0,0x0,0x400000};
+const BIG CURVE_Gx= {0x0,0xA032710,0xFD66E68,0x15424ED8,0x38,0x0,0x0,0x0,0x400000};
+const BIG CURVE_Gy= {0x2,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_HTPC= {0x1381795,0x16B3AA9A,0xF3EF0D9,0x15DD7A0,0xBAA53E1,0xC45B655,0xFD3BC53,0x1E66E041,0x3AB46C};
+#endif
+
+#if CHUNK==64
+
+using namespace B256_56;
+
+//*** rom curve parameters *****
+const int CURVE_Cof_I= 1;
+const BIG CURVE_Cof= {0x1L,0x0L,0x0L,0x0L,0x0L};
+const int CURVE_B_I= 5;
+const BIG CURVE_B= {0x5L,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_Order= {0x2CAFD400000001L,0xA127696286C984L,0x38AL,0x0L,0x40000000L};
+const BIG CURVE_Gx= {0x4064E200000000L,0xA1276C3F59B9A1L,0x38AL,0x0L,0x40000000L};
+const BIG CURVE_Gy= {0x2L,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_HTPC= {0xD6755341381795L,0xAEEBD03CFBC366L,0x8B6CAABAA53E10L,0x37020BF4EF14D8L,0x3AB46CF3L};
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_X448.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_X448.cpp
new file mode 100644
index 0000000..52d8001
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_curve_X448.cpp
@@ -0,0 +1,55 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "ecp_X448.h"
+
+namespace X448 {
+
+/* Curve X448 */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B448_29;
+
+const int CURVE_Cof_I= 4;
+const BIG CURVE_Cof= {0x4,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG CURVE_Order= {0xB5844F3,0x1BC61495,0x1163D548,0x1984E51B,0x3690216,0xDA4D76B,0xFA7113B,0x1FEF9944,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x7FF};
+const BIG CURVE_Gx= {0x5};
+const BIG CURVE_HTPC= {0x1FFFFFFE,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FDFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFF};
+#endif
+
+#if CHUNK==64
+
+using namespace B448_58;
+
+const int CURVE_Cof_I= 4;
+const BIG CURVE_Cof= {0x4L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const BIG CURVE_Order= {0x378C292AB5844F3L,0x3309CA37163D548L,0x1B49AED63690216L,0x3FDF3288FA7113BL,0x3FFFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFFL,0xFFFFFFFFFFL};
+const BIG CURVE_Gx= {0x5L};
+const BIG CURVE_HTPC= {0x3FFFFFFFFFFFFFEL,0x3FFFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFFL,0x3FBFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFFL,0x3FFFFFFFFFFL};
+
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_ANSSI.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_ANSSI.cpp
new file mode 100644
index 0000000..e2d6f30
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_ANSSI.cpp
@@ -0,0 +1,54 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "fp_ANSSI.h"
+
+namespace ANSSI {
+
+/* ANNSI Curve */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B256_28;
+
+// Base Bits= 28
+const BIG Modulus= {0x86E9C03,0xFCF353D,0x8CA6DE8,0xADBCABC,0x35B3961,0xE8CE424,0xF10126D,0xB3AD58,0x1FD178C,0xF};
+const BIG ROI= {0x86E9C02,0xFCF353D,0x8CA6DE8,0xADBCABC,0x35B3961,0xE8CE424,0xF10126D,0xB3AD58,0x1FD178C,0xF};
+const BIG R2modp= {0x288CC9C,0x18D2374,0x646BD2B,0x4929E67,0xD6F7F2D,0x220E6C1,0xABCE02E,0x751B1FD,0x7401B78,0xE};
+const chunk MConst= 0x64E1155;
+#endif
+
+#if CHUNK==64
+
+using namespace B256_56;
+
+// Base Bits= 56
+const BIG Modulus= {0xFCF353D86E9C03L,0xADBCABC8CA6DE8L,0xE8CE42435B3961L,0xB3AD58F10126DL,0xF1FD178CL};
+const BIG ROI= {0xFCF353D86E9C02L,0xADBCABC8CA6DE8L,0xE8CE42435B3961L,0xB3AD58F10126DL,0xF1FD178CL};
+const BIG R2modp= {0x18D2374288CC9CL,0x4929E67646BD2BL,0x220E6C1D6F7F2DL,0x751B1FDABCE02EL,0xE7401B78L};
+const chunk MConst= 0x97483A164E1155L;
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_BLS12381.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_BLS12381.cpp
new file mode 100644
index 0000000..f7fbfd0
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_BLS12381.cpp
@@ -0,0 +1,61 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "fp_BLS12381.h"
+
+namespace BLS12381 {
+
+/* Curve BLS12381 - Pairing friendly BLS curve */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B384_29;
+
+// Base Bits= 29
+const BIG Modulus= {0x1FFFAAAB,0xFF7FFFF,0x14FFFFEE,0x17FFFD62,0xF6241EA,0x9507B58,0xAFD9CC3,0x109E70A2,0x1764774B,0x121A5D66,0x12C6E9ED,0x12FFCD34,0x111EA3,0xD};
+const BIG ROI= {0x1FFFAAAA,0xFF7FFFF,0x14FFFFEE,0x17FFFD62,0xF6241EA,0x9507B58,0xAFD9CC3,0x109E70A2,0x1764774B,0x121A5D66,0x12C6E9ED,0x12FFCD34,0x111EA3,0xD};
+const BIG R2modp= {0x15BEF7AE,0x1031CD0E,0x2DD93E8,0x9226323,0xE6E2CD2,0x11684DAA,0x1170E5DB,0x88E25B1,0x1B366399,0x1C536F47,0xD1F9CBC,0x278B67F,0x1EA66A2B,0xC};
+const BIG CRu= {0x1FFEFFFE,0x100FFFFF,0x280008B,0xFB026C4,0x9688DE1,0x149DF37C,0x1FAB76CE,0xED41EE,0x11BA69C6,0x1EFBB672,0x17C659CB,0x0,0x0,0x0};
+const chunk MConst= 0x1FFCFFFD;
+const BIG Fra= {0x12235FB8,0x83BAF6C,0x19E04F63,0x1D4A7AC7,0xB9C4F67,0x1EBC25D,0x1D3DEC91,0x1FA797AB,0x1F0FD603,0x1016068,0x108C6FAD,0x5760CCF,0x104D3BF0,0xC};
+const BIG Frb= {0xDDC4AF3,0x7BC5093,0x1B1FB08B,0x1AB5829A,0x3C5F282,0x764B8FB,0xDBFB032,0x10F6D8F6,0x1854A147,0x1118FCFD,0x23A7A40,0xD89C065,0xFC3E2B3,0x0};
+const BIG SQRTm3= {0x1AAAE,0xFD80000,0xFFFFED7,0x189FAFDA,0x1C912627,0x14945F,0xBA6AF26,0xEC3ECC4,0x13EFA3BF,0x1422F081,0x33A3655,0x12FFCD33,0x111EA3,0xD};
+#endif
+
+#if CHUNK==64
+
+using namespace B384_58;
+// Base Bits= 58
+const BIG Modulus= {0x1FEFFFFFFFFAAABL,0x2FFFFAC54FFFFEEL,0x12A0F6B0F6241EAL,0x213CE144AFD9CC3L,0x2434BACD764774BL,0x25FF9A692C6E9EDL,0x1A0111EA3L};
+const BIG ROI= {0x1FEFFFFFFFFAAAAL,0x2FFFFAC54FFFFEEL,0x12A0F6B0F6241EAL,0x213CE144AFD9CC3L,0x2434BACD764774BL,0x25FF9A692C6E9EDL,0x1A0111EA3L};
+const BIG R2modp= {0x20639A1D5BEF7AEL,0x1244C6462DD93E8L,0x22D09B54E6E2CD2L,0x111C4B63170E5DBL,0x38A6DE8FB366399L,0x4F16CFED1F9CBCL,0x19EA66A2BL};
+const BIG CRu= {0x201FFFFFFFEFFFEL,0x1F604D88280008BL,0x293BE6F89688DE1L,0x1DA83DDFAB76CEL,0x3DF76CE51BA69C6L,0x17C659CBL,0x0L};
+const chunk MConst= 0x1F3FFFCFFFCFFFDL;
+const BIG Fra= {0x10775ED92235FB8L,0x3A94F58F9E04F63L,0x3D784BAB9C4F67L,0x3F4F2F57D3DEC91L,0x202C0D1F0FD603L,0xAEC199F08C6FADL,0x1904D3BF0L};
+const BIG Frb= {0xF78A126DDC4AF3L,0x356B0535B1FB08BL,0xEC971F63C5F282L,0x21EDB1ECDBFB032L,0x2231F9FB854A147L,0x1B1380CA23A7A40L,0xFC3E2B3L};
+const BIG SQRTm3= {0x1FB00000001AAAEL,0x313F5FB4FFFFED7L,0x2928BFC912627L,0x1D87D988BA6AF26L,0x2845E1033EFA3BFL,0x25FF9A6633A3655L,0x1A0111EA3L};
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_BLS12383.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_BLS12383.cpp
new file mode 100644
index 0000000..a5b8849
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_BLS12383.cpp
@@ -0,0 +1,64 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "fp_BLS12383.h"
+
+namespace BLS12383 {
+
+/* Curve BLS12383 - Pairing friendly BLS curve */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B384_29;
+
+// Base Bits= 29
+const BIG Modulus= {0x5AAB0AB,0x11B8EB24,0x19214AF6,0x187E5314,0x124F47A8,0x1C00B4B0,0x1446B0C6,0x59E6CB4,0x4A0AD46,0xFF5494,0x81B6B71,0x956DD6B,0x16556956,0x2A};
+const BIG ROI= {0x5AAB0AA,0x11B8EB24,0x19214AF6,0x187E5314,0x124F47A8,0x1C00B4B0,0x1446B0C6,0x59E6CB4,0x4A0AD46,0xFF5494,0x81B6B71,0x956DD6B,0x16556956,0x2A};
+const BIG R2modp= {0x116907F4,0x405B700,0x1752AC11,0x67A9E7C,0x1941C581,0x1AEA38C4,0xB1E4D22,0xCE841AE,0xA0FC49B,0xB4B1F48,0x13852312,0x1B3FDCED,0x1FECE397,0x26};
+
+const BIG CRu= {0xEAAC2A9,0x61B3A81,0x17D974B7,0xBED0345,0xA341BC2,0x17A51A6F,0x5738948,0x69B7BAE,0x14605445,0x374A43,0x8116AD1,0x956DD69,0x16556956,0x2A};
+const chunk MConst= 0x73435FD;
+const BIG Fra= {0x1311DAC1,0x296B969,0x19DCF806,0x126901FC,0xD8C8A36,0x1A2572A8,0xA1A0959,0x1A47F743,0x110E4C6C,0x1608DA97,0xCE2E7F0,0x4FED178,0xACD5BF0,0x11};
+const BIG Frb= {0x1298D5EA,0xF2231BA,0x1F4452F0,0x6155117,0x4C2BD72,0x1DB4208,0xA2CA76D,0xB567571,0x139260D9,0xAF679FC,0x1B388380,0x4580BF2,0xB880D66,0x19};
+const BIG SQRTm3= {0x17AAD4A8,0x1A7D89DE,0x16919E77,0x1F5BB376,0x218EFDB,0x1349802E,0x16A061CA,0x7988AA7,0x41FFB44,0x1F6F3FF3,0x8076A30,0x956DD67,0x16556956,0x2A};
+#endif
+
+#if CHUNK==64
+
+using namespace B384_58;
+
+// Base Bits= 58
+const BIG Modulus= {0x2371D6485AAB0ABL,0x30FCA6299214AF6L,0x3801696124F47A8L,0xB3CD969446B0C6L,0x1FEA9284A0AD46L,0x12ADBAD681B6B71L,0x556556956L};
+const BIG ROI= {0x2371D6485AAB0AAL,0x30FCA6299214AF6L,0x3801696124F47A8L,0xB3CD969446B0C6L,0x1FEA9284A0AD46L,0x12ADBAD681B6B71L,0x556556956L};
+const BIG R2modp= {0x80B6E0116907F4L,0xCF53CF9752AC11L,0x35D47189941C581L,0x19D0835CB1E4D22L,0x16963E90A0FC49BL,0x367FB9DB3852312L,0x4DFECE397L};
+
+const BIG CRu= {0xC367502EAAC2A9L,0x17DA068B7D974B7L,0x2F4A34DEA341BC2L,0xD36F75C5738948L,0x6E94874605445L,0x12ADBAD28116AD1L,0x556556956L};
+const chunk MConst= 0x1BC0571073435FDL;
+const BIG Fra= {0x52D72D3311DAC1L,0x24D203F99DCF806L,0x344AE550D8C8A36L,0x348FEE86A1A0959L,0x2C11B52F10E4C6CL,0x9FDA2F0CE2E7F0L,0x22ACD5BF0L};
+const BIG Frb= {0x1E446375298D5EAL,0xC2AA22FF4452F0L,0x3B684104C2BD72L,0x16ACEAE2A2CA76DL,0x15ECF3F939260D9L,0x8B017E5B388380L,0x32B880D66L};
+const BIG SQRTm3= {0x34FB13BD7AAD4A8L,0x3EB766ED6919E77L,0x2693005C218EFDBL,0xF31154F6A061CAL,0x3EDE7FE641FFB44L,0x12ADBACE8076A30L,0x556556956L};
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_BLS12443.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_BLS12443.cpp
new file mode 100644
index 0000000..a63e1a0
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_BLS12443.cpp
@@ -0,0 +1,62 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "fp_BLS12443.h"
+
+namespace BLS12443 {
+
+/* Curve BLS12443 - Pairing friendly BLS curve */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B448_29;
+
+// Base Bits= 29
+const BIG Modulus= {0x10AAAAAB,0x1FD55555,0x1921AAFF,0xA59AAAA,0x1424ABF7,0x19024801,0x1C42D855,0x96E429D,0x5119FF1,0x7855CAF,0x1020B3B1,0x4B6ABA4,0x92300A8,0x1054E434,0x1694F72C,0xAE};
+const BIG R2modp= {0x1118A8F7,0x1AB7CA8,0x2333712,0x132DCAD3,0x16E13882,0x10A03200,0x5B25363,0x9C87B7C,0xB9A40C9,0x975222C,0x28F658F,0x147AD511,0xF6028F0,0xBA52E95,0x262ED53,0x69};
+const BIG ROI= {0x10AAAAAA,0x1FD55555,0x1921AAFF,0xA59AAAA,0x1424ABF7,0x19024801,0x1C42D855,0x96E429D,0x5119FF1,0x7855CAF,0x1020B3B1,0x4B6ABA4,0x92300A8,0x1054E434,0x1694F72C,0xAE};
+const BIG SQRTm3= {0x14AAAAA8,0x1ED55556,0x16F7ACFF,0x6B6AA9,0x1E4D5046,0x1413E017,0x19DD9B9D,0x1E5F53AC,0x64B9158,0x1368614B,0x1F58A387,0x96E1519,0x8A07BAD,0x1054E434,0x1694F72C,0xAE};
+const BIG CRu= {0x2AAAAA9,0x1F555556,0x80CABFF,0x15628AAA,0x1938FE1E,0x168B140C,0xB1039F9,0x3E6CB25,0x5AE98A5,0xD76DEFD,0x7BCAB9C,0x1712605F,0x8E1BE2A,0x1054E434,0x1694F72C,0xAE};
+const chunk MConst= 0x15FFFFFD;
+const BIG Fra= {0x49551C8,0x9D8A27E,0x1FACD18F,0x10236D5E,0x1D38DC4B,0xA2FCECB,0x46BF1F0,0x1C2F955E,0x1029E275,0x7D8436E,0x13DD8C0,0x1C9052A0,0x1979B8C6,0x1F97223F,0xC24C77,0x88};
+const BIG Frb= {0xC1558E3,0x15FCB2D7,0x1974D970,0x1A363D4B,0x16EBCFAB,0xED27935,0x17D6E665,0xD3EAD3F,0x14E7BD7B,0x1FAD1940,0xEE2DAF0,0x8265904,0xFA947E1,0x10BDC1F4,0x15D2AAB4,0x26};
+#endif
+
+#if CHUNK==64
+
+using namespace B448_60;
+
+// Base Bits= 60
+const BIG Modulus= {0xFFAAAAAB0AAAAABL,0x752CD5556486ABFL,0x572049003424ABFL,0xF14B7214EF10B61L,0xEC4F0AB95E5119FL,0xA825B55D24082CL,0xDCB20A9C8689230L,0x575A53L};
+const BIG R2modp= {0xF5CDA0EB0AD64E2L,0xDE66AA74FAE046BL,0x8B9229B598075AEL,0xDFAFBC5DB0E321EL,0x9AF61017ADA96A8L,0xFFAEA657DE81FE0L,0x1800170F84B9395L,0x8E3DDL};
+const BIG ROI= {0xFFAAAAAB0AAAAAAL,0x752CD5556486ABFL,0x572049003424ABFL,0xF14B7214EF10B61L,0xEC4F0AB95E5119FL,0xA825B55D24082CL,0xDCB20A9C8689230L,0x575A53L};
+const BIG SQRTm3= {0xFDAAAAAD4AAAAA8L,0x6035B554DBDEB3FL,0x76827C02FE4D504L,0x58F2FA9D667766EL,0xE1E6D0C29664B91L,0xBAD4B70A8CFD628L,0xDCB20A9C8688A07L,0x575A53L};
+const BIG CRu= {0xFEAAAAAC2AAAAA9L,0xEAB145552032AFFL,0xE6D162819938FE1L,0xA51F36592AC40E7L,0xE71AEDBDFA5AE98L,0xE2AB89302F9EF2AL,0xDCB20A9C8688E1BL,0x575A53L};
+const chunk MConst= 0xC04000035FFFFFDL;
+const BIG Fra= {0xD3B144FC49551C8L,0xB811B6AF7EB3463L,0xC145F9D97D38DC4L,0x75E17CAAF11AFC7L,0x300FB086DD029E2L,0x8C6E48295004F76L,0x31DFF2E447F979BL,0x440309L};
+const BIG Frb= {0x2BF965AEC1558E3L,0xBD1B1EA5E5D365CL,0x95DA4F26B6EBCFAL,0x7B69F569FDF5B99L,0xBC3F5A32814E7BDL,0x7E14132C823B8B6L,0xAAD217B83E8FA94L,0x13574AL};
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_BLS12461.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_BLS12461.cpp
new file mode 100644
index 0000000..2c68a27
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_BLS12461.cpp
@@ -0,0 +1,62 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "fp_BLS12461.h"
+
+namespace BLS12461 {
+
+/* Curve BLS12461 - Pairing friendly BLS curve */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B464_28;
+
+// Base Bits= 28
+const BIG Modulus= {0xAAAAAAB,0xAC0000A,0x54AAAAA,0x5555,0x400020,0x91557F0,0xF26AA,0xFA5C1CC,0xB42A8DF,0x7B14848,0x8BACCA4,0x6F1E32D,0x4935FBD,0x55D6941,0xD5A555A,0x5545554,0x1555};
+const BIG ROI= {0xAAAAAAA,0xAC0000A,0x54AAAAA,0x5555,0x400020,0x91557F0,0xF26AA,0xFA5C1CC,0xB42A8DF,0x7B14848,0x8BACCA4,0x6F1E32D,0x4935FBD,0x55D6941,0xD5A555A,0x5545554,0x1555};
+const BIG R2modp= {0xC9B6A33,0x2ECD087,0x3CCB2B1,0xCD461FE,0x8CB5AB2,0xC5B9635,0x5312E92,0xB659F64,0x3B596FA,0x8679006,0xA92E2B3,0x3CE05E3,0x363550F,0x7C07A8E,0x382C083,0x6347FEA,0xBD};
+const BIG CRu= {0xFFFFFFE,0x40001F,0xFE00000,0xFFE7FFF,0xF0FFF6F,0x7200C47,0x7BCC604,0x15796DB,0xCF47771,0x9875433,0x613F0E8,0x5000502,0xEBFFF60,0x1FFFFF,0x0,0x0,0x0};
+const chunk MConst= 0xFFFFFFD;
+const BIG Fra= {0xB812A3A,0x7117BF9,0x99C400F,0xC6308A5,0x5BF8A1,0x510E075,0x45FA5A6,0xCE4858D,0x770B31A,0xBC2CB04,0xE2FC61E,0xD073588,0x4366190,0x4DFEFA8,0x69E55E2,0x504B7F,0x12E4};
+const BIG Frb= {0xF298071,0x3AE8410,0xBAE6A9B,0x39D4CAF,0xFE4077E,0x404777A,0xBAF8104,0x2C13C3E,0x3D1F5C5,0xBEE7D44,0xA8B0685,0x9EAADA4,0x5CFE2C,0x7D7999,0x6BBFF78,0x50409D5,0x271};
+const BIG SQRTm3= {0xAAAAAAE,0xA3FFFCA,0x58AAAAA,0x35555,0x2200140,0xAD53F60,0x959AA1,0xCF69415,0x159B9FD,0x4A29FE1,0xC92EAD3,0xCF1D928,0x71360FC,0x51D6941,0xD5A555A,0x5545554,0x1555};
+#endif
+
+#if CHUNK==64
+
+using namespace B464_60;
+
+// Base Bits= 60
+const BIG Modulus= {0xAAC0000AAAAAAABL,0x20000555554AAAAL,0x6AA91557F004000L,0xA8DFFA5C1CC00F2L,0xACCA47B14848B42L,0x935FBD6F1E32D8BL,0xD5A555A55D69414L,0x15555545554L};
+const BIG ROI= {0xAAC0000AAAAAAAAL,0x20000555554AAAAL,0x6AA91557F004000L,0xA8DFFA5C1CC00F2L,0xACCA47B14848B42L,0x935FBD6F1E32D8BL,0xD5A555A55D69414L,0x15555545554L};
+const BIG R2modp= {0x96D08774614DDA8L,0xCD45F539225D5BDL,0xD712EB760C95AB1L,0xB3B687155F30B55L,0xC4E62A05C3F5B81L,0xBA1151676CA3CD0L,0x7EDD8A958F442BEL,0x12B89DD3F91L};
+const BIG CRu= {0x40001FFFFFFFEL,0x6FFFE7FFFFE0000L,0x6047200C47F0FFFL,0x777115796DB7BCCL,0x3F0E89875433CF4L,0xBFFF60500050261L,0x1FFFFFEL,0x0L};
+const chunk MConst= 0xC0005FFFFFFFDL;
+const BIG Fra= {0xF7117BF9B812A3AL,0xA1C6308A599C400L,0x5A6510E07505BF8L,0xB31ACE4858D45FAL,0xFC61EBC2CB04770L,0x366190D073588E2L,0x69E55E24DFEFA84L,0x12E40504B7FL};
+const BIG Frb= {0xB3AE8410F298071L,0x7E39D4CAFBAE6A9L,0x104404777AFE407L,0xF5C52C13C3EBAF8L,0xB0685BEE7D443D1L,0x5CFE2C9EAADA4A8L,0x6BBFF7807D79990L,0x27150409D5L};
+const BIG SQRTm3= {0xAA3FFFCAAAAAAAEL,0x40003555558AAAAL,0xAA1AD53F6022001L,0xB9FDCF694150959L,0x2EAD34A29FE1159L,0x1360FCCF1D928C9L,0xD5A555A51D69417L,0x15555545554L};
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_BLS24479.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_BLS24479.cpp
new file mode 100644
index 0000000..413382d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_BLS24479.cpp
@@ -0,0 +1,62 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "fp_BLS24479.h"
+
+namespace BLS24479 {
+
+/* Curve BLS24479 - Pairing friendly BLS curve */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B480_29;
+
+const BIG Modulus= {0xA06152B,0x2260B3A,0xB4C36BE,0x5FFC5D0,0xBDB6A64,0x5B78E2E,0x1C1A28CA,0x10E6441B,0x1F244061,0xB4704F0,0x141E5CCD,0x9837504,0x3F2E77E,0xD763740,0x1316EA0E,0xF0079,0x555C};
+const BIG ROI= {0xA06152A,0x2260B3A,0xB4C36BE,0x5FFC5D0,0xBDB6A64,0x5B78E2E,0x1C1A28CA,0x10E6441B,0x1F244061,0xB4704F0,0x141E5CCD,0x9837504,0x3F2E77E,0xD763740,0x1316EA0E,0xF0079,0x555C};
+const BIG R2modp= {0x8533EA9,0x6A02789,0x183B24DE,0x1E45ECF8,0xC8F8F37,0x10CAD209,0x4C0C4B8,0x9B1FABD,0xDEBE4C0,0xDC353F9,0x18A18E26,0x10F489BB,0x31206A5,0x19673BBF,0x6BE69F9,0xB091169,0x9CD};
+const BIG CRu= {0xDD794A9,0x1DE138A3,0x2BCCE90,0xC746127,0x15223DDC,0x1DD8890B,0xED08DB7,0xE24B9F,0xE379CE6,0x37011AC,0x11BAC820,0x1EEFAD01,0x200860F,0x147218A6,0xF16A209,0xF0079,0x555C};
+const chunk MConst= 0x95FE7D;
+const BIG Fra= {0x1BF96F1D,0xAE53A55,0x31BFEEB,0x183FF17A,0x6237469,0x12A4F4F1,0x12101FE3,0x16E79D94,0xFF59267,0x5EB4EB4,0x78CC49F,0x274BA33,0x149184F3,0x16C6DCBA,0x1C90B694,0x10F729CE,0x4BBC};
+const BIG Frb= {0xE0CA60E,0x1740D0E4,0x83037D2,0xDBFD456,0x5B7F5FA,0x1312993D,0xA0A08E6,0x19FEA687,0xF2EADF9,0x55BB63C,0xC91982E,0x70EBAD1,0xF61628B,0x16AF5A85,0x16863379,0xF17D6AA,0x99F};
+const BIG SQRTm3= {0x11A91428,0x199C660C,0x1A2D6663,0x12E8FC7D,0x1E691154,0x15F983E8,0x186F2A5,0x10DE5323,0x1D4AF96A,0x1B991E67,0xF573372,0x145BE4FE,0xE24A1,0x1B6DFA0C,0xB165A04,0xF0079,0x555C};
+const BIG TWK= {0x16EA62F3,0x52C4905,0x17CF5F35,0x13967138,0x16BCA61B,0xF766FBB,0x9B547D6,0x11625BCD,0x1AFF154D,0xDE4D18C,0xF9C3EF8,0x84619DC,0x15E18EE4,0x1D55B149,0xED04681,0x64CDD9E,0x337A};
+#endif
+
+#if CHUNK==64
+
+using namespace B480_56;
+// Base Bits= 56
+const BIG Modulus= {0x44C1674A06152BL,0xFFE2E82D30DAF8L,0x6F1C5CBDB6A642L,0x3220DF068A328BL,0xE09E1F24406187L,0xBA825079733568L,0x6E803F2E77E4C1L,0x3CCC5BA839AECL,0x555C0078L};
+const BIG ROI= {0x44C1674A06152AL,0xFFE2E82D30DAF8L,0x6F1C5CBDB6A642L,0x3220DF068A328BL,0xE09E1F24406187L,0xBA825079733568L,0x6E803F2E77E4C1L,0x3CCC5BA839AECL,0x555C0078L};
+const BIG R2modp= {0x6A4A1FE013DF5BL,0xE8E46D4D1BDE65L,0x1F841391F45C67L,0x9148A4516FB28L,0x4398524EDF4C88L,0x41C0E241B6DCE8L,0xE42C208C19411L,0xA7FE6FD73A7B1CL,0xFCCCA76L};
+const BIG CRu= {0xBC27146DD794A9L,0x3A30938AF33A43L,0xB112175223DDC6L,0x125CFBB4236DFBL,0x2358E379CE607L,0xD680C6EB20806EL,0x314C200860FF77L,0x3CBC5A88268E4L,0x555C0078L};
+const chunk MConst= 0xBD5D7D8095FE7DL;
+const BIG Fra= {0x5CA74ABBF96F1DL,0x1FF8BD0C6FFBADL,0x49E9E26237469CL,0x3CECA48407F8E5L,0x69D68FF59267B7L,0x5D199E33127CBDL,0xB97549184F313AL,0x4E77242DA52D8DL,0x4BBC87B9L};
+const BIG Frb= {0xE81A1C8E0CA60EL,0xDFEA2B20C0DF4AL,0x25327A5B7F5FA6L,0xF5343A828239A6L,0x76C78F2EADF9CFL,0x5D68B24660B8ABL,0xB50AF61628B387L,0xB555A18CDE6D5EL,0x99F78BEL};
+const BIG SQRTm3= {0x338CC191A91428L,0x747E3EE8B5998FL,0xF307D1E6911549L,0xF2991861BCA96BL,0x23CCFD4AF96A86L,0xF27F3D5CCDCB73L,0xF41800E24A1A2DL,0x3CAC5968136DBL,0x555C0078L};
+const BIG TWK= {0xA58920B6EA62F3L,0xCB389C5F3D7CD4L,0xECDF776BCA61B9L,0x12DE6A6D51F59EL,0x9A319AFF154D8BL,0xCEE3E70FBE1BCL,0x62935E18EE4423L,0xECF3B411A07AABL,0x337A3266L};
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_BLS48286.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_BLS48286.cpp
new file mode 100644
index 0000000..7966399
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_BLS48286.cpp
@@ -0,0 +1,64 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "fp_BLS48286.h"
+
+namespace BLS48286 {
+
+/* Curve BLS48286 - Pairing friendly BLS curve */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B288_29;
+
+// Base Bits= 29
+const BIG Modulus= {0x9C345B,0x13A815C9,0x38D4B67,0xC8388A5,0x4809AAF,0x63F0D60,0x516A1B2,0x16040390,0x11EC7BD7,0x14B9629};
+const BIG R2modp= {0x8484275,0x16B4A09C,0x13973525,0x19DBD350,0x188DE1C0,0x111BD51D,0x113A0F92,0x6489CAD,0xF188E5E,0xCED0C0};
+const BIG ROI= {0x9C345A,0x13A815C9,0x38D4B67,0xC8388A5,0x4809AAF,0x63F0D60,0x516A1B2,0x16040390,0x11EC7BD7,0x14B9629};
+const BIG CRu= {0x3773F7B,0xD329CB0,0xC2BB8E5,0x99D4594,0x667A6F2,0x1945AD4C,0x159AC407,0x20C33EA,0x332B8D8,0x14B921E};
+const chunk MConst= 0x16EA242D;
+const BIG Fra= {0x1FC90183,0x15434AF9,0xF4FA4DB,0xAAD7DA3,0x8F09A7C,0x81F7813,0x1F8010F6,0x9D15D85,0xC522C11,0x6CA0BF};
+const BIG Frb= {0xD332D8,0x1E64CACF,0x143DA68B,0x1D60B01,0x1B900033,0x1E1F954C,0x59690BB,0xC32A60A,0x59A4FC6,0xDEF56A};
+const BIG SQRTm3= {0x6524A9C,0x6BD2397,0x14CA2663,0x6B70283,0x84EB335,0xC4C4D38,0x61EE65D,0xE146445,0x1478F5D8,0x14B8E12};
+const BIG TWK= {0x3D05DCC,0x13ECB9AE,0x10A9C2E6,0x132E0A8A,0x1AA2C6A1,0x65E8A65,0x19C887EF,0xA33E6E6,0xF448A33,0xE9076F};
+#endif
+
+#if CHUNK==64
+
+using namespace B288_60;
+
+// Base Bits= 60
+const BIG Modulus= {0xE7502B9209C345BL,0xF641C4528E352D9L,0xC8C7E1AC04809AAL,0xD7B0201C8145A86L,0x2972C531EC7BL};
+const BIG R2modp= {0x61F9539D245AF2CL,0xA1991A6E51410D8L,0x1603A99FC661885L,0xC8A2CE485CD7822L,0xD54A6F0B25EL};
+const BIG ROI= {0xE7502B9209C345AL,0xF641C4528E352D9L,0xC8C7E1AC04809AAL,0xD7B0201C8145A86L,0x2972C531EC7BL};
+const BIG CRu= {0x5A6539603773F7BL,0x24CEA2CA30AEE39L,0x1F28B5A98667A6FL,0xD810619F5566B10L,0x297243C332B8L};
+const chunk MConst= 0x227E5D8F6EA242DL;
+const BIG Fra= {0xEA8695F3FC90183L,0xC556BED1BD3E936L,0xD903EF0268F09A7L,0x114E8AEC2FE0043L,0xD9417EC522CL};
+const BIG Frb= {0xFCC9959E0D332D8L,0x30EB0580D0F69A2L,0xEFC3F2A99B90003L,0xC66195305165A42L,0x1BDEAD459A4FL};
+const BIG SQRTm3= {0xCD7A472E6524A9CL,0x535B8141D328998L,0x758989A7084EB33L,0xD870A3222987B99L,0x2971C25478F5L};
+const BIG TWK= {0xA7D9735C3D05DCCL,0x1997054542A70B9L,0xBCCBD14CBAA2C6AL,0x33519F37367221FL,0x1D20EDEF448AL};
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_BLS48556.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_BLS48556.cpp
new file mode 100644
index 0000000..66b5331
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_BLS48556.cpp
@@ -0,0 +1,64 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "fp_BLS48556.h"
+
+namespace BLS48556 {
+
+/* Curve BLS48556 - Pairing friendly BLS curve */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B560_29;
+
+// Base Bits= 29
+const BIG Modulus= {0x1CF6AC0B,0x17B7307F,0x19877E7B,0x12CE0134,0x14228402,0x1BD4C386,0x1DACBB04,0x40410D0,0x25A415,0x980B53E,0xDE6E250,0x15D9AAD6,0x5DA950,0x1029B7A,0x54AB351,0x14AD90CE,0x3729047,0x1FE7E2D9,0x145F610B,0x1F};
+const BIG ROI= {0x1CF6AC0A,0x17B7307F,0x19877E7B,0x12CE0134,0x14228402,0x1BD4C386,0x1DACBB04,0x40410D0,0x25A415,0x980B53E,0xDE6E250,0x15D9AAD6,0x5DA950,0x1029B7A,0x54AB351,0x14AD90CE,0x3729047,0x1FE7E2D9,0x145F610B,0x1F};
+const BIG R2modp= {0xD59D0FA,0x12F01FD0,0xDE8FD41,0x35AAEE1,0xB937F48,0x50700E8,0x1F50EFCE,0x1019B13C,0x3470A2F,0x11094115,0xF9FB72D,0x6AD10E2,0x1CFD9F8,0x44F4785,0x2B48793,0x1148ED3,0xF609E61,0x1EE34BC7,0x1735D29E,0x0};
+const BIG CRu= {0xCBBA429,0x1B273F3,0xD3DD160,0x19C61452,0x308093A,0x146E1E34,0xAE0E768,0x1185948,0x1B73BC2D,0x93D855C,0x1B1A639C,0x118C919B,0xFF04AE3,0xF1CCD77,0x91318E5,0x10644780,0x3A79F7,0x1BE77919,0x145F60F3,0x1F};
+const chunk MConst= 0x9DA805D;
+const BIG Fra= {0x1325BF89,0x1311E7EC,0xCD0A56F,0x1A0FD46E,0xE83BCCA,0xCA97DD0,0x18D1D297,0x5F1E137,0x7AB9F2C,0x13FC255F,0x1C9DECEB,0x9DEF4A2,0x3C0F60B,0x1D9909E4,0x1FF27FF7,0x1DBF8208,0x89BB36C,0x40044E0,0x62E01EE,0x5};
+const BIG Frb= {0x1325BF89,0x1311E7EC,0xCD0A56F,0x1A0FD46E,0xE83BCCA,0xCA97DD0,0x18D1D297,0x5F1E137,0x7AB9F2C,0x13FC255F,0x1C9DECEB,0x9DEF4A2,0x3C0F60B,0x1D9909E4,0x1FF27FF7,0x1DBF8208,0x89BB36C,0x40044E0,0x62E01EE,0x5};
+const BIG SQRTm3= {0x1C809C48,0xBADB766,0xF42444,0xBE2770,0x11ED8E73,0xD0778E1,0x181513CC,0x1E2CA1BF,0x16C1D444,0x8FA557B,0x84DE4E8,0xD3F7861,0x1F82EC76,0x1D36FF74,0xCDB7E79,0xC1AFE32,0x1D0263A7,0x17E70F58,0x145F60DB,0x1F};
+const BIG TWK= {0x16F9937,0x9133D51,0xD89F92B,0x17A682C,0x16600368,0x1830F509,0x1531266E,0x159D972D,0x1C269C72,0x46E0687,0xCAA903,0x1EEF4D3A,0xED502F8,0x1046B2AB,0x1EC6EF4F,0xFD93805,0x1EEEDD57,0xD0AFF3F,0xC83E724,0x8};
+#endif
+
+#if CHUNK==64
+
+using namespace B560_58;
+
+// Base Bits= 58
+const BIG Modulus= {0x2F6E60FFCF6AC0BL,0x259C02699877E7BL,0x37A9870D4228402L,0x80821A1DACBB04L,0x13016A7C025A415L,0x2BB355ACDE6E250L,0x20536F405DA950L,0x295B219C54AB351L,0x3FCFC5B23729047L,0x3F45F610BL};
+const BIG ROI= {0x2F6E60FFCF6AC0AL,0x259C02699877E7BL,0x37A9870D4228402L,0x80821A1DACBB04L,0x13016A7C025A415L,0x2BB355ACDE6E250L,0x20536F405DA950L,0x295B219C54AB351L,0x3FCFC5B23729047L,0x3F45F610BL};
+const BIG R2modp= {0x25E03FA0D59D0FAL,0x6B55DC2DE8FD41L,0xA0E01D0B937F48L,0x20336279F50EFCEL,0x2212822A3470A2FL,0xD5A21C4F9FB72DL,0x89E8F0A1CFD9F8L,0x2291DA62B48793L,0x3DC6978EF609E61L,0x1735D29EL};
+const BIG CRu= {0x364E7E6CBBA429L,0x338C28A4D3DD160L,0x28DC3C68308093AL,0x230B290AE0E768L,0x127B0AB9B73BC2DL,0x23192337B1A639CL,0x1E399AEEFF04AE3L,0x20C88F0091318E5L,0x37CEF23203A79F7L,0x3F45F60F3L};
+const chunk MConst= 0x21BFCBCA9DA805DL;
+const BIG Fra= {0x2623CFD9325BF89L,0x341FA8DCCD0A56FL,0x1952FBA0E83BCCAL,0xBE3C26F8D1D297L,0x27F84ABE7AB9F2CL,0x13BDE945C9DECEBL,0x3B3213C83C0F60BL,0x3B7F0411FF27FF7L,0x80089C089BB36CL,0xA62E01EEL};
+const BIG Frb= {0x2623CFD9325BF89L,0x341FA8DCCD0A56FL,0x1952FBA0E83BCCAL,0xBE3C26F8D1D297L,0x27F84ABE7AB9F2CL,0x13BDE945C9DECEBL,0x3B3213C83C0F60BL,0x3B7F0411FF27FF7L,0x80089C089BB36CL,0xA62E01EEL};
+const BIG SQRTm3= {0x175B6ECDC809C48L,0x17C4EE00F42444L,0x1A0EF1C31ED8E73L,0x3C59437F81513CCL,0x11F4AAF76C1D444L,0x1A7EF0C284DE4E8L,0x3A6DFEE9F82EC76L,0x1835FC64CDB7E79L,0x2FCE1EB1D0263A7L,0x3F45F60DBL};
+const BIG TWK= {0x12267AA216F9937L,0x2F4D058D89F92BL,0x3061EA136600368L,0x2B3B2E5B531266EL,0x8DC0D0FC269C72L,0x3DDE9A740CAA903L,0x208D6556ED502F8L,0x1FB2700BEC6EF4FL,0x1A15FE7FEEEDD57L,0x10C83E724L};
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_BLS48581.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_BLS48581.cpp
new file mode 100644
index 0000000..f0af263
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_BLS48581.cpp
@@ -0,0 +1,64 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "fp_BLS48581.h"
+
+namespace BLS48581 {
+
+/* Curve BLS48581 - Pairing friendly BLS curve */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B584_29;
+
+// Base Bits= 29
+const BIG Modulus= {0x565912B,0x16E0AA73,0x12922B0F,0x1FBEE434,0xEE0A578,0x12A898B8,0xBDA0D9E,0x9E8E6DB,0x19CD3039,0x17041566,0x2B90EBD,0xEA88949,0xC0F1F39,0x18DD9DF3,0x1E344884,0xADD09,0x1D47012A,0x9C12718,0x1CD1DBCC,0x501EE7F,0x1};
+const BIG ROI= {0x565912A,0x16E0AA73,0x12922B0F,0x1FBEE434,0xEE0A578,0x12A898B8,0xBDA0D9E,0x9E8E6DB,0x19CD3039,0x17041566,0x2B90EBD,0xEA88949,0xC0F1F39,0x18DD9DF3,0x1E344884,0xADD09,0x1D47012A,0x9C12718,0x1CD1DBCC,0x501EE7F,0x1};
+const BIG R2modp= {0x19BCC5B0,0x126A343E,0xA46F6C0,0x29B7799,0xB758510,0x1357043D,0x1DC2D482,0x115A8C75,0x1F6CA5F6,0x9B40365,0x16E1C7DB,0x1A304684,0xA85F60F,0x16E21141,0x1D5AE21,0xD9EA745,0x1641FB69,0x249C4AC,0xA2B23E1,0x14FCE472,0x0};
+const BIG CRu= {0x1C79B90,0x6F4D62F,0x3977A09,0x19B1C7F1,0x1421A205,0x190FBA7B,0x16D758AA,0x129736C1,0x2F43166,0x115AFDC,0x1E9AA9CD,0xD508D6B,0xBED6FF4,0x1360F2FE,0x95960F5,0x709E55F,0x1F4E2096,0x2AEEAE8,0xB1A2DD4,0x0,0x0};
+const chunk MConst= 0x39D5A7D;
+const BIG Fra= {0x42AEB25,0x1175B67F,0x182B4FE5,0x1683284E,0x115ECE4D,0x1EF92B83,0x22B03E9,0x6EF6A24,0x8C41890,0x4249F0E,0x61F9A1,0xC60FC53,0x16B62F49,0x71E57E,0xF9E161D,0xFA08F30,0x1E55F606,0x1AE6BF39,0x140527E9,0x1FA61B6,0x0};
+const BIG Frb= {0x42AEB25,0x1175B67F,0x182B4FE5,0x1683284E,0x115ECE4D,0x1EF92B83,0x22B03E9,0x6EF6A24,0x8C41890,0x4249F0E,0x61F9A1,0xC60FC53,0x16B62F49,0x71E57E,0xF9E161D,0xFA08F30,0x1E55F606,0x1AE6BF39,0x140527E9,0x1FA61B6,0x0};
+const BIG SQRTm3= {0x1D65A0A,0x8F6FE15,0xB6336FD,0xC5B5452,0x69D616D,0x8923C1,0x1E2B5C49,0x4BA7957,0x13E4CD6C,0x14D8B5AE,0x583BB23,0x14076E71,0x14343F50,0x121BB7F6,0xB818699,0x11F7124B,0x1EAABFFD,0x4635146,0x69D8024,0x501EE7F,0x1};
+const BIG TWK= {0x1F426953,0x1DA19E92,0xEE618F5,0x159C8B24,0xD37E160,0x145DEFD1,0xD2F0630,0x1FF9915F,0x2C4F62,0xDA1C978,0x51E0598,0x4FD2A34,0x132462ED,0x13341DC2,0x81D59C2,0x19374271,0x1D9EAEB8,0x1ABB4E6E,0xDEF0401,0x74CB4A,0x0};
+#endif
+
+#if CHUNK==64
+
+using namespace B584_60;
+
+// Base Bits= 60
+const BIG Modulus= {0xEDC154E6565912BL,0x8FDF721A4A48AC3L,0x7A5513170EE0A57L,0x394F4736DAF6836L,0xAF6E082ACD9CD30L,0xF3975444A48AE43L,0x22131BB3BE6C0F1L,0x12A0056E84F8D1L,0x76F313824E31D47L,0x1280F73FF34L};
+const BIG ROI= {0xEDC154E6565912AL,0x8FDF721A4A48AC3L,0x7A5513170EE0A57L,0x394F4736DAF6836L,0xAF6E082ACD9CD30L,0xF3975444A48AE43L,0x22131BB3BE6C0F1L,0x12A0056E84F8D1L,0x76F313824E31D47L,0x1280F73FF34L};
+const BIG R2modp= {0x79868479F1B5833L,0xFB6EBA8FCB82D07L,0x9CC8A7F1FD84C7FL,0x402C51CF5CC3CBBL,0x3F3114F078502CL,0xFC90829BDC8336EL,0xC7BE91DE9CA8EEDL,0xD4D273BB17BFADBL,0x6EC7C9A81E792CAL,0x1DC317A6E4L};
+const BIG CRu= {0x4DE9AC5E1C79B90L,0x5CD8E3F88E5DE82L,0xAB21F74F7421A20L,0x6694B9B60DB5D62L,0x73422B5FB82F431L,0xFF46A846B5FA6AAL,0x83D66C1E5FCBED6L,0x2096384F2AFA565L,0x8B75055DD5D1F4EL,0x2C6L};
+const chunk MConst= 0x148B81FC39D5A7DL;
+const BIG Fra= {0x62EB6CFE42AEB25L,0xDB41942760AD3F9L,0xA7DF2570715ECE4L,0x90377B51208AC0FL,0x6848493E1C8C418L,0xF496307E298187EL,0x58740E3CAFD6B62L,0xF6067D047983E78L,0x49FA75CD7E73E55L,0xFD30DB501L};
+const BIG Frb= {0x62EB6CFE42AEB25L,0xDB41942760AD3F9L,0xA7DF2570715ECE4L,0x90377B51208AC0FL,0x6848493E1C8C418L,0xF496307E298187EL,0x58740E3CAFD6B62L,0xF6067D047983E78L,0x49FA75CD7E73E55L,0xFD30DB501L};
+const BIG SQRTm3= {0x51EDFC2A1D65A0AL,0xD62DAA292D8CDBFL,0x24112478269D616L,0x6C25D3CABF8AD71L,0xC8E9B16B5D3E4CDL,0xF50A03B738960EEL,0x1A664376FED4343L,0xBFFD8FB8925AE06L,0x600908C6A28DEAAL,0x1280F73F9A7L};
+const BIG TWK= {0x7B433D25F426953L,0xACE45923B9863DL,0xC28BBDFA2D37E16L,0x62FFCC8AFB4BC18L,0x661B4392F002C4FL,0x2ED27E951A14781L,0x670A6683B853246L,0xAEB8C9BA138A075L,0xC10075769CDDD9EL,0x3A65A537BL};
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_BN158.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_BN158.cpp
new file mode 100644
index 0000000..7e0d583
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_BN158.cpp
@@ -0,0 +1,63 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "fp_BN158.h"
+
+namespace BN158 {
+
+/* Curve BN158 - Pairing friendly BN curve */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B160_28;
+
+// Base Bits= 28
+const BIG Modulus= {0xB04E013,0x72280A,0xFD3FB95,0x9953CF6,0x27628C,0x24012};
+const BIG R2modp= {0x545973D,0xA60739B,0x65DB288,0x526165,0xB226C,0x17315};
+const BIG ROI= {0xB04E012,0x72280A,0xFD3FB95,0x9953CF6,0x27628C,0x24012};
+const BIG SQRTm3= {0x8018004,0x7F0E404,0x99F4CE2,0x95F35CA,0x2761FC,0x24012};
+const BIG CRu= {0x181B007,0x440A203,0x31A5759,0x1B0396,0x48,0x0};
+const chunk MConst= 0x4F615E5;
+const BIG Fra= {0x6ECE2A9,0xA167429,0x99296F2,0xE1BF21C,0xCF82A02,0xA85E};
+const BIG Frb= {0x417FD6A,0x65BB3E1,0x64164A2,0xB794ADA,0x32F3889,0x197B3};
+#endif
+
+#if CHUNK==64
+
+using namespace B160_56;
+
+// Base Bits= 56
+const BIG Modulus= {0x72280AB04E013L,0x9953CF6FD3FB95L,0x24012027628CL};
+const BIG R2modp= {0xA60739B545973DL,0x52616565DB288L,0x1731500B226CL};
+const BIG ROI= {0x72280AB04E012L,0x9953CF6FD3FB95L,0x24012027628CL};
+const BIG SQRTm3= {0x7F0E4048018004L,0x95F35CA99F4CE2L,0x2401202761FCL};
+const BIG CRu= {0x440A203181B007L,0x1B039631A5759L,0x48L};
+const chunk MConst= 0xFC609004F615E5L;
+const BIG Fra= {0xA1674296ECE2A9L,0xE1BF21C99296F2L,0xA85ECF82A02L};
+const BIG Frb= {0x65BB3E1417FD6AL,0xB794ADA64164A2L,0x197B332F3889L};
+
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_BN254.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_BN254.cpp
new file mode 100644
index 0000000..9588d4a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_BN254.cpp
@@ -0,0 +1,73 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "fp_BN254.h"
+
+namespace BN254 {
+
+/* Curve BN254 - Pairing friendly BN curve */
+
+/* Nogami's fast curve */
+
+#if CHUNK==16
+
+using namespace B256_13;
+
+// Base Bits= 13
+const BIG Modulus= {0x13,0x0,0x0,0x0,0x1A70,0x9,0x0,0x0,0x100,0x309,0x2,0x0,0x1800,0x1A26,0x6E8,0x0,0x0,0x412,0x8D9,0x4A};
+const BIG ROI= {0x12,0x0,0x0,0x0,0x1A70,0x9,0x0,0x0,0x100,0x309,0x2,0x0,0x1800,0x1A26,0x6E8,0x0,0x0,0x412,0x8D9,0x4A};
+const BIG R2modp= {0xF32,0x239,0x14DC,0xCE8,0x928,0x11B6,0x130F,0x1183,0x56E,0x1AEE,0x124F,0xD2A,0x7F8,0x1CE6,0x1B50,0x77C,0x3A,0x1A9E,0x1EFD,0x1C};
+const BIG CRu= {0x7,0x0,0x0,0x0,0xCD8,0x3,0x0,0x0,0x900,0x1248,0x0,0x0,0x400,0x19B1,0x126,0x0,0x0,0x0,0x0,0x0};
+const chunk MConst= 0x15E5;
+const BIG Fra= {0xDE9,0x1953,0x101B,0x1BCD,0xE17,0x1BE1,0x14FD,0x1249,0x974,0x1C28,0x54F,0x108D,0x150A,0x4CD,0x12D9,0xF91,0x12E,0x10C9,0xDDD,0x36};
+const BIG Frb= {0x122A,0x6AC,0xFE4,0x432,0xC58,0x428,0xB02,0xDB6,0x178B,0x6E0,0x1AB2,0xF72,0x2F5,0x1559,0x140F,0x106E,0x1ED1,0x1348,0x1AFB,0x13};
+const BIG SQRTm3= {0x4,0x0,0x0,0x0,0xC0,0x3,0x0,0x0,0xF00,0x1E78,0x0,0x0,0x1000,0x6C4,0x49B,0x0,0x0,0x412,0x8D9,0x4A};
+#endif
+
+#if CHUNK==32
+
+using namespace B256_28;
+
+// Base Bits= 28
+const BIG Modulus= {0x13,0x0,0x13A7,0x0,0x86121,0x8000000,0x1BA344D,0x4000000,0x5236482,0x2};
+const BIG ROI= {0x12,0x0,0x13A7,0x0,0x86121,0x8000000,0x1BA344D,0x4000000,0x5236482,0x2};
+const BIG R2modp= {0xF5E7E39,0x2F2A96F,0xB96F13C,0x64E8642,0xC7146,0x9926F7B,0x4DACD24,0x8321E7B,0xD127A2E,0x1};
+const BIG CRu= {0x7,0x8000000,0x6CD,0x0,0x24909,0x4000000,0x49B362,0x0,0x0,0x0};
+const chunk MConst= 0x79435E5;
+const BIG Fra= {0xF2A6DE9,0x7DE6C06,0xF77C2E1,0x74924D3,0x53F8509,0x50A8469,0xCB6499B,0x212E7C8,0xB377619,0x1};
+const BIG Frb= {0xD5922A,0x82193F9,0x8850C5,0x8B6DB2C,0xAC8DC17,0x2F57B96,0x503EAB2,0x1ED1837,0x9EBEE69,0x0};
+const BIG SQRTm3= {0x4,0x0,0x60C,0x0,0x3CF0F,0x0,0x126CD89,0x4000000,0x5236482,0x2};
+#endif
+
+#if CHUNK==64
+
+using namespace B256_56;
+
+// Base Bits= 56
+const BIG Modulus= {0x13L,0x13A7L,0x80000000086121L,0x40000001BA344DL,0x25236482L};
+const BIG ROI= {0x12L,0x13A7L,0x80000000086121L,0x40000001BA344DL,0x25236482L};
+const BIG R2modp= {0x2F2A96FF5E7E39L,0x64E8642B96F13CL,0x9926F7B00C7146L,0x8321E7B4DACD24L,0x1D127A2EL};
+const BIG CRu= {0x80000000000007L,0x6CDL,0x40000000024909L,0x49B362L,0x0L};
+const chunk MConst= 0x435E50D79435E5L;
+const BIG Fra= {0x7DE6C06F2A6DE9L,0x74924D3F77C2E1L,0x50A846953F8509L,0x212E7C8CB6499BL,0x1B377619L};
+const BIG Frb= {0x82193F90D5922AL,0x8B6DB2C08850C5L,0x2F57B96AC8DC17L,0x1ED1837503EAB2L,0x9EBEE69L};
+const BIG SQRTm3= {0x4L,0x60CL,0x3CF0FL,0x4000000126CD89L,0x25236482L};
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_BN254CX.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_BN254CX.cpp
new file mode 100644
index 0000000..6eaa2f5
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_BN254CX.cpp
@@ -0,0 +1,72 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "fp_BN254CX.h"
+
+namespace BN254CX {
+
+/* Curve BN254CX - Pairing friendly BN curve */
+
+/* CertiVox BN curve/field  */
+
+#if CHUNK==16
+
+using namespace B256_13;
+
+// Base Bits= 13
+const BIG Modulus= {0x15B3,0xDA,0x1BD7,0xC47,0x1BE6,0x1F70,0x24,0x1DC3,0x1FD6,0x1921,0x19B4,0x14C6,0x1647,0x1EEF,0x16C2,0x541,0x870,0x0,0x0,0x48};
+const BIG ROI= {0x15B2,0xDA,0x1BD7,0xC47,0x1BE6,0x1F70,0x24,0x1DC3,0x1FD6,0x1921,0x19B4,0x14C6,0x1647,0x1EEF,0x16C2,0x541,0x870,0x0,0x0,0x48};
+const BIG R2modp= {0x1527,0x146B,0x12A7,0x1A60,0x1E0A,0x1382,0x2BC,0x1D3F,0xB30,0xA8,0xD19,0x11AB,0x1D40,0x1965,0xD6D,0x643,0x10FF,0x1BC7,0x1E61,0x31};
+const BIG CRu= {0x1C97,0x11A,0x5E5,0x126,0x31E,0x3AB,0x7BE,0xC8E,0x1DDF,0x205,0xFC5,0x1950,0x0,0x0,0x120,0x0,0x0,0x0,0x0,0x0};
+const chunk MConst= 0x1E85;
+const BIG Fra= {0xEA3,0xE40,0xCD5,0x1210,0x15BD,0x1C10,0x5CF,0x4DE,0x773,0x343,0x626,0x194E,0x18AA,0x10C5,0x12BF,0x2C,0x63A,0x17D,0x1642,0x26};
+const BIG Frb= {0x710,0x129A,0xF01,0x1A37,0x628,0x360,0x1A55,0x18E4,0x1863,0x15DE,0x138E,0x1B78,0x1D9C,0xE29,0x403,0x515,0x236,0x1E83,0x9BD,0x21};
+const BIG SQRTm3= {0x1C84,0x1EA4,0x100C,0x9FB,0x15AA,0x181A,0x10A8,0x4A6,0x418,0x1516,0x1A2A,0x225,0x1646,0x1EEF,0x1482,0x541,0x870,0x0,0x0,0x48};
+#endif
+
+#if CHUNK==32
+
+using namespace B256_28;
+
+// Base Bits= 28
+const BIG Modulus= {0xC1B55B3,0x6623EF5,0x93EE1BE,0xD6EE180,0x6D3243F,0x647A636,0xDB0BDDF,0x8702A0,0x4000000,0x2};
+const BIG ROI= {0xC1B55B2,0x6623EF5,0x93EE1BE,0xD6EE180,0x6D3243F,0x647A636,0xDB0BDDF,0x8702A0,0x4000000,0x2};
+const BIG R2modp= {0x8A0800A,0x466A061,0x43056A3,0x2B3A225,0x9C6600,0x148515B,0x6BDF50,0xEC9EA56,0xC992E66,0x1};
+const chunk MConst= 0x9789E85;
+const BIG Fra= {0x5C80EA3,0xD908335,0x3F8215B,0x7326F17,0x8986867,0x8AACA71,0x4AFE18B,0xA63A016,0x359082F,0x1};
+const BIG Frb= {0x6534710,0x8D1BBC0,0x546C062,0x63C7269,0xE3ABBD8,0xD9CDBC4,0x900DC53,0x623628A,0xA6F7D0,0x1};
+const BIG SQRTm3= {0x3D49C84,0xA4FDC03,0xA30355A,0x1825342,0x8AAA2C4,0x646112E,0xD20BDDF,0x8702A0,0x4000000,0x2};
+
+#endif
+
+#if CHUNK==64
+
+using namespace B256_56;
+
+// Base Bits= 56
+const BIG Modulus= {0x6623EF5C1B55B3L,0xD6EE18093EE1BEL,0x647A6366D3243FL,0x8702A0DB0BDDFL,0x24000000L};
+const BIG ROI= {0x6623EF5C1B55B2L,0xD6EE18093EE1BEL,0x647A6366D3243FL,0x8702A0DB0BDDFL,0x24000000L};
+const BIG R2modp= {0x466A0618A0800AL,0x2B3A22543056A3L,0x148515B09C6600L,0xEC9EA5606BDF50L,0x1C992E66L};
+const chunk MConst= 0x4E205BF9789E85L;
+const BIG Fra= {0xD9083355C80EA3L,0x7326F173F8215BL,0x8AACA718986867L,0xA63A0164AFE18BL,0x1359082FL};
+const BIG Frb= {0x8D1BBC06534710L,0x63C7269546C062L,0xD9CDBC4E3ABBD8L,0x623628A900DC53L,0x10A6F7D0L};
+const BIG SQRTm3= {0xA4FDC033D49C84L,0x1825342A30355AL,0x646112E8AAA2C4L,0x8702A0D20BDDFL,0x24000000L};
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_BN462.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_BN462.cpp
new file mode 100644
index 0000000..e3af5c1
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_BN462.cpp
@@ -0,0 +1,62 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "fp_BN462.h"
+
+namespace BN462 {
+
+/* Curve BN462 - Pairing friendly BN curve */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B464_28;
+
+// Base Bits= 28
+const BIG Modulus= {0x138013,0x1B0084,0x24,0xF640000,0xC6FF687,0xF6FF66F,0xFFFFFFF,0xC8020FF,0x2908F41,0xD81,0xA000000,0xB7D9BFC,0x6FF0CF6,0xFFFFFFF,0x23FFF,0x8036012,0x2404};
+const BIG ROI= {0x138012,0x1B0084,0x24,0xF640000,0xC6FF687,0xF6FF66F,0xFFFFFFF,0xC8020FF,0x2908F41,0xD81,0xA000000,0xB7D9BFC,0x6FF0CF6,0xFFFFFFF,0x23FFF,0x8036012,0x2404};
+const BIG R2modp= {0x88F9612,0xC8B9999,0x247088C,0xDB3ACD5,0xCA792EF,0x6E92E73,0x34F5999,0x4273E13,0x6714A6A,0xCBFE239,0xA0E2617,0x2487CB3,0xBE0EA3C,0x97791E4,0x8A07DE5,0x56CFA97,0x373};
+const BIG CRu= {0x4235C97,0xE093179,0xF875631,0xDF6471E,0xF1440BD,0xCA83,0x480000,0x0,0x0,0x0};
+const chunk MConst= 0x11BB5E5;
+const BIG Fra= {0x2575D1A,0xE4BE3FF,0x659DBDE,0xFC7D89,0x93FA118,0xD45D1D,0xCC78D9,0x6217331,0xD547C05,0xC792504,0x9A87E11,0x92ED03A,0x1727085,0xB5A8CC1,0xB40BCFD,0xF4348CB,0x16F};
+const BIG Frb= {0x55FF85B,0x204AE09,0x57BEB62,0x9023886,0xD630A20,0xF94F4B,0x84FF0D0,0x14A1A7A,0xB1DBADB,0xB00D8E4,0x1E85F7,0x7493CA0,0x68325B2,0x2008E6B,0xE90EA88,0x7F80940,0x23C3};
+const BIG SQRTm3= {0x210022,0x2400CC,0x24,0xEF80000,0xB07F12F,0xF6FF4BF,0xFFFFFFF,0x7C032FF,0x440AEC2,0xD81,0x8000000,0xDFD2FFB,0x6FF03F5,0xFFFFFFF,0x23FFF,0x8036012,0x2404};
+#endif
+
+#if CHUNK==64
+
+using namespace B464_60;
+
+// Base Bits= 60
+const BIG Modulus= {0x401B00840138013L,0x87F640000000002L,0xFFFF6FF66FC6FF6L,0x8F41C8020FFFFFFL,0xD81290L,0xFF0CF6B7D9BFCA0L,0x23FFFFFFFFFF6L,0x24048036012L};
+const BIG ROI= {0x401B00840138012L,0x87F640000000002L,0xFFFF6FF66FC6FF6L,0x8F41C8020FFFFFFL,0xD81290L,0xFF0CF6B7D9BFCA0L,0x23FFFFFFFFFF6L,0x24048036012L};
+const BIG R2modp= {0x89118D28DC21038L,0x1C24CD524708896L,0x96F6AF594FD13D3L,0xFC17B3AFB34F599L,0x617CBFE0F54B3BCL,0x105034B613F1E2L,0x47E597791E4CB9L,0x12EACA995DAL};
+const BIG CRu= {0xE0931794235C97L,0xDF6471EF875631L,0xCA83F1440BDL,0x480000L,0x0L};
+const chunk MConst= 0x718CE9E711BB5E5L;
+const BIG Fra= {0xEE4BE3FF2575D1AL,0x180FC7D89659DBDL,0x8D90D45D1D93FA1L,0x7C0562173310CC7L,0x87E11C792504D54L,0x72708592ED03A9AL,0xB40BCFDB5A8CC11L,0x16FF4348CBL};
+const BIG Frb= {0x2204AE0955FF85BL,0x20902388657BEB6L,0xD00F94F4BD630AL,0xBADB14A1A7A84FFL,0xE85F7B00D8E4B1DL,0x8325B27493CA001L,0xE90EA882008E6B6L,0x23C37F80940L};
+const BIG SQRTm3= {0x402400CC0210022L,0x2FEF80000000002L,0xFFFF6FF4BFB07F1L,0xAEC27C032FFFFFFL,0xD81440L,0xFF03F5DFD2FFB80L,0x23FFFFFFFFFF6L,0x24048036012L};
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_BRAINPOOL.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_BRAINPOOL.cpp
new file mode 100644
index 0000000..008745f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_BRAINPOOL.cpp
@@ -0,0 +1,54 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "fp_BRAINPOOL.h"
+
+namespace BRAINPOOL {
+
+/* Brainpool Modulus  */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B256_28;
+
+// Base Bits= 28
+const BIG Modulus= {0xF6E5377,0x13481D1,0x6202820,0xF623D52,0xD726E3B,0x909D838,0xC3E660A,0xA1EEA9B,0x9FB57DB,0xA};
+const BIG ROI= {0xF6E5376,0x13481D1,0x6202820,0xF623D52,0xD726E3B,0x909D838,0xC3E660A,0xA1EEA9B,0x9FB57DB,0xA};
+const BIG R2modp= {0xB9A3787,0x9E04F49,0x8F3CF49,0x2931721,0xF1DBC89,0x54E8C3C,0xF7559CA,0xBB411A3,0x773E15F,0x9};
+const chunk MConst= 0xEFD89B9;
+#endif
+
+#if CHUNK==64
+
+using namespace B256_56;
+
+// Base Bits= 56
+const BIG Modulus= {0x13481D1F6E5377L,0xF623D526202820L,0x909D838D726E3BL,0xA1EEA9BC3E660AL,0xA9FB57DBL};
+const BIG ROI= {0x13481D1F6E5376L,0xF623D526202820L,0x909D838D726E3BL,0xA1EEA9BC3E660AL,0xA9FB57DBL};
+const BIG R2modp= {0x9E04F49B9A3787L,0x29317218F3CF49L,0x54E8C3CF1DBC89L,0xBB411A3F7559CAL,0x9773E15FL};
+const chunk MConst= 0xA75590CEFD89B9L;
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_C1174.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_C1174.cpp
new file mode 100644
index 0000000..dbbf0f5
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_C1174.cpp
@@ -0,0 +1,54 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "fp_C1174.h"
+
+namespace C1174 {
+
+/* Curve C1174 */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B256_29;
+
+// Base Bits= 29
+const BIG Modulus= {0x1FFFFFF7,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x7FFFF};
+const BIG R2modp= {0x5100000,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG ROI= {0x1FFFFFF6,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x7FFFF};
+const chunk MConst= 0x9;
+#endif
+
+#if CHUNK==64
+
+using namespace B256_56;
+
+// Base Bits= 56
+const BIG Modulus= {0xFFFFFFFFFFFFF7L,0xFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFL,0x7FFFFFFL};
+const BIG R2modp= {0x0L,0x144L,0x0L,0x0L,0x0L};
+const BIG ROI= {0xFFFFFFFFFFFFF6L,0xFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFL,0x7FFFFFFL};
+const chunk MConst= 0x9L;
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_C1665.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_C1665.cpp
new file mode 100644
index 0000000..1f2dea3
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_C1665.cpp
@@ -0,0 +1,54 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "fp_C1665.h"
+
+namespace C1665 {
+
+/* Curve C1665 */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B168_29;
+
+// Base Bits= 29
+const BIG Modulus= {0x1FFFFFFB,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFF};
+const BIG R2modp= {0x190000,0x0,0x0,0x0,0x0,0x0};
+const BIG ROI= {0x1FFFFFFA,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFF};
+const chunk MConst= 0x5;
+#endif
+
+#if CHUNK==64
+
+using namespace B168_60;
+
+// Base Bits= 60
+const BIG Modulus= {0xFFFFFFFFFFFFFFBL,0xFFFFFFFFFFFFFFFL,0x3FFFFFFFFFFFL};
+const BIG R2modp= {0x190000000L,0x0L,0x0L};
+const BIG ROI= {0xFFFFFFFFFFFFFFAL,0xFFFFFFFFFFFFFFFL,0x3FFFFFFFFFFFL};
+const chunk MConst= 0x5L;
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_C41417.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_C41417.cpp
new file mode 100644
index 0000000..0c03263
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_C41417.cpp
@@ -0,0 +1,54 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "fp_C41417.h"
+
+namespace C41417 {
+
+/* Curve C41417 */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B416_29;
+
+// Base Bits= 29
+const BIG Modulus= {0x1FFFFFEF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0xFF};
+const BIG ROI= {0x1FFFFFEE,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0xFF};
+const BIG R2modp= {0x0,0x242000,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const chunk MConst= 0x11;
+#endif
+
+#if CHUNK==64
+
+using namespace B416_60;
+
+// Base Bits= 60
+const BIG Modulus= {0xFFFFFFFFFFFFFEFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFL};
+const BIG ROI= {0xFFFFFFFFFFFFFEEL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFL};
+const BIG R2modp= {0x121000L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const chunk MConst= 0x11L;
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_F25519.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_F25519.cpp
new file mode 100644
index 0000000..67ae9e2
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_F25519.cpp
@@ -0,0 +1,64 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "fp_F25519.h"
+
+
+namespace F25519 {
+/* Curve 25519 */
+
+#if CHUNK==16
+
+using namespace B256_13;
+
+// Base Bits= 13
+const BIG Modulus= {0x1FED,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0xFF};
+const BIG ROI= {0xB0,0x1075,0x9D2,0x1C36,0xC4E,0x123C,0x14BF,0xD5,0x318,0x197A,0x15E9,0x1BF7,0x993,0x680,0xCAD,0x1BE1,0xFC1,0x402,0xC9,0x57};
+const BIG R2modp= {0x400,0x2D,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const chunk MConst= 0x13;
+
+#endif
+
+#if CHUNK==32
+
+using namespace B256_29;
+
+// Base Bits= 29
+const BIG Modulus= {0x1FFFFFED,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x7FFFFF};
+const BIG ROI= {0xA0EA0B0,0x770D93A,0xBF91E31,0x6300D5A,0x1D7A72F4,0x4C9EFD,0x1C2CAD34,0x1009F83B,0x2B8324};
+const BIG R2modp= {0x169000,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const chunk MConst= 0x13;
+
+
+#endif
+
+#if CHUNK==64
+
+using namespace B256_56;
+
+// Base Bits= 56
+const BIG Modulus= {0xFFFFFFFFFFFFEDL,0xFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFL,0x7FFFFFFFL};
+const BIG ROI= {0xEE1B274A0EA0B0L,0x1806AD2FE478C4L,0x993DFBD7A72F43L,0x4FC1DF0B2B4D00L,0x2B832480L};
+const BIG R2modp= {0xA4000000000000L,0x5L,0x0L,0x0L,0x0L};
+const chunk MConst= 0x13L;
+
+
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_F256PME.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_F256PME.cpp
new file mode 100644
index 0000000..4fc103f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_F256PME.cpp
@@ -0,0 +1,62 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "fp_F256PME.h"
+
+namespace F256PME {
+
+/* NUMS 256-bit modulus */
+
+
+#if CHUNK==16
+
+using namespace B256_13;
+
+// Base Bits= 13
+const BIG Modulus= {0x1F43,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FF};
+const BIG ROI= {0x1F42,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FF};
+const BIG R2modp= {0x900,0x45C,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const chunk MConst= 0xBD;
+#endif
+
+#if CHUNK==32
+
+using namespace B256_29;
+
+// Base Bits= 29
+const BIG Modulus= {0x1FFFFF43,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0xFFFFFF};
+const BIG ROI= {0x1FFFFF42,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0xFFFFFF};
+const BIG R2modp= {0x22E2400,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const chunk MConst= 0xBD;
+
+#endif
+
+#if CHUNK==64
+
+using namespace B256_56;
+
+// Base Bits= 56
+const BIG Modulus= {0xFFFFFFFFFFFF43L,0xFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFL,0xFFFFFFFFL};
+const BIG ROI= {0xFFFFFFFFFFFF42L,0xFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFL,0xFFFFFFFFL};
+const BIG R2modp= {0x89000000000000L,0x8BL,0x0L,0x0L,0x0L};
+const chunk MConst= 0xBDL;
+
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_F256PMW.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_F256PMW.cpp
new file mode 100644
index 0000000..8314087
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_F256PMW.cpp
@@ -0,0 +1,56 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "fp_F256PMW.h"
+
+namespace F256PMW {
+
+/* NUMS 256-bit modulus */
+
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B256_28;
+
+// Base Bits= 28
+const BIG Modulus= {0xFFFFF43,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xF};
+const BIG ROI= {0xFFFFF42,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xF};
+const BIG R2modp= {0x0,0x8900000,0x8B,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const chunk MConst= 0xBD;
+#endif
+
+#if CHUNK==64
+
+using namespace B256_56;
+
+// Base Bits= 56
+const BIG Modulus= {0xFFFFFFFFFFFF43L,0xFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFL,0xFFFFFFFFL};
+const BIG ROI= {0xFFFFFFFFFFFF42L,0xFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFL,0xFFFFFFFFL};
+const BIG R2modp= {0x89000000000000L,0x8BL,0x0L,0x0L,0x0L};
+const chunk MConst= 0xBDL;
+
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_F384PM.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_F384PM.cpp
new file mode 100644
index 0000000..4331717
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_F384PM.cpp
@@ -0,0 +1,55 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "fp_F384PM.h"
+
+namespace F384PM {
+
+/* NUMS 384-bit modulus */
+
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B384_29;
+
+// Base Bits= 29
+const BIG Modulus= {0x1FFFFEC3,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x7F};
+const BIG ROI= {0x1FFFFEC2,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x7F};
+const BIG R2modp= {0x0,0x4448000,0x6,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const chunk MConst= 0x13D;
+#endif
+
+#if CHUNK==64
+
+using namespace B384_58;
+
+// Base Bits= 58
+const BIG Modulus= {0x3FFFFFFFFFFFEC3L,0x3FFFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFFL,0xFFFFFFFFFL};
+const BIG R2modp= {0x88900000000000L,0x6L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const BIG ROI= {0x3FFFFFFFFFFFEC2L,0x3FFFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFFL,0xFFFFFFFFFL};
+const chunk MConst= 0x13DL;
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_F448.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_F448.cpp
new file mode 100644
index 0000000..15d291e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_F448.cpp
@@ -0,0 +1,58 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "fp_F448.h"
+
+namespace F448 {
+
+/* Curve Ed448 */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B448_29;
+
+// Base Bits= 29
+const BIG Modulus= {0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FDFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFF};
+const BIG ROI=     {0x1FFFFFFE,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FDFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFF};
+const BIG R2modp= {0x0,0x10,0x0,0x0,0x0,0x0,0x0,0x0,0x3000000,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const chunk MConst= 0x1;
+//const int BTset= 224;
+
+#endif
+
+#if CHUNK==64
+
+using namespace B448_58;
+
+// Base Bits= 58
+const BIG Modulus= {0x3FFFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFFL,0x3FBFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFFL,0x3FFFFFFFFFFL};
+const BIG ROI=     {0x3FFFFFFFFFFFFFEL,0x3FFFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFFL,0x3FBFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFFL,0x3FFFFFFFFFFFFFFL,0x3FFFFFFFFFFL};
+const BIG R2modp= {0x200000000L,0x0L,0x0L,0x0L,0x3000000L,0x0L,0x0L,0x0L};
+const chunk MConst= 0x1L;
+//const int BTset=224;
+
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_F512PM.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_F512PM.cpp
new file mode 100644
index 0000000..40388c3
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_F512PM.cpp
@@ -0,0 +1,55 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "fp_F512PM.h"
+
+namespace F512PM {
+
+/* NUMS 512-bit modulus */
+
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B512_29;
+
+// Base Bits= 29
+const BIG Modulus= {0x1FFFFDC7,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x7FFFF};
+const BIG ROI= {0x1FFFFDC6,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x7FFFF};
+const BIG R2modp= {0xB100000,0x278,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const chunk MConst= 0x239;
+#endif
+
+#if CHUNK==64
+
+using namespace B512_60;
+
+// Base Bits= 60
+const BIG Modulus= {0xFFFFFFFFFFFFDC7L,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFL};
+const BIG R2modp= {0x100000000000000L,0x4F0BL,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const BIG ROI= {0xFFFFFFFFFFFFDC6L,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFL};
+const chunk MConst= 0x239L;
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_FP256BN.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_FP256BN.cpp
new file mode 100644
index 0000000..fa66c7a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_FP256BN.cpp
@@ -0,0 +1,67 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "fp_FP256BN.h"
+
+namespace FP256BN {
+
+/* Curve FP512BN - Pairing friendly BN curve */
+
+/* ISO curve */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B256_28;
+
+// Base Bits= 28
+
+const BIG Modulus= {0xED33013,0x292DDBA,0x80A82D3,0x65FB129,0x49F0CDC,0x5EEE71A,0xD46E5F2,0xFFFCF0C,0xFFFFFFF,0xF};
+const BIG ROI= {0xED33012,0x292DDBA,0x80A82D3,0x65FB129,0x49F0CDC,0x5EEE71A,0xD46E5F2,0xFFFCF0C,0xFFFFFFF,0xF};
+const BIG R2modp= {0x3B9F8B,0xEDE3363,0xFEC54E8,0x92FFEE9,0x3C55F79,0x13C1C06,0xC0123FA,0xA12F2EA,0xE559B2A,0x8};
+const chunk MConst= 0x537E5E5;
+const BIG CRu= {0x3A1B807,0x1C0A24A,0x32D1EDB,0xD79DF19,0x8659BCD,0x4092101,0x13988E1,0x0,0x0,0x0};
+const BIG Fra= {0xF943106,0x760328A,0xAB28F74,0x71511E3,0x7CF39A1,0x8DDB086,0x52D1A6E,0xCA786F3,0xD617662,0x3};
+const BIG Frb= {0xF3EFF0D,0xB32AB2F,0xD57F35E,0xF4A9F45,0xCCFD33A,0xD113693,0x819CB83,0x3584819,0x29E899D,0xC};
+const BIG SQRTm3= {0x78FC004,0xF119926,0x1B0451C,0xB6BF2F7,0x3D3D540,0xDDCA517,0xAD3D42F,0xFFFCF0C,0xFFFFFFF,0xF};
+
+#endif
+
+#if CHUNK==64
+
+using namespace B256_56;
+
+// Base Bits= 56
+const BIG Modulus= {0x292DDBAED33013L,0x65FB12980A82D3L,0x5EEE71A49F0CDCL,0xFFFCF0CD46E5F2L,0xFFFFFFFFL};
+const BIG ROI= {0x292DDBAED33012L,0x65FB12980A82D3L,0x5EEE71A49F0CDCL,0xFFFCF0CD46E5F2L,0xFFFFFFFFL};
+const BIG R2modp= {0xEDE336303B9F8BL,0x92FFEE9FEC54E8L,0x13C1C063C55F79L,0xA12F2EAC0123FAL,0x8E559B2AL};
+const chunk MConst= 0x6C964E0537E5E5L;
+const BIG CRu= {0x1C0A24A3A1B807L,0xD79DF1932D1EDBL,0x40921018659BCDL,0x13988E1L,0x0L};
+const BIG Fra= {0x760328AF943106L,0x71511E3AB28F74L,0x8DDB0867CF39A1L,0xCA786F352D1A6EL,0x3D617662L};
+const BIG Frb= {0xB32AB2FF3EFF0DL,0xF4A9F45D57F35EL,0xD113693CCFD33AL,0x3584819819CB83L,0xC29E899DL};
+const BIG SQRTm3= {0xF11992678FC004L,0xB6BF2F71B0451CL,0xDDCA5173D3D540L,0xFFFCF0CAD3D42FL,0xFFFFFFFFL};
+
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_FP512BN.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_FP512BN.cpp
new file mode 100644
index 0000000..e26c498
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_FP512BN.cpp
@@ -0,0 +1,69 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "fp_FP512BN.h"
+
+namespace FP512BN {
+
+/* Curve FP512BN - Pairing friendly BN curve */
+
+/* ISO curve */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B512_29;
+
+// Base Bits= 29
+
+const BIG Modulus= {0x2ADEF33,0x7594049,0x131919ED,0x14AB9CBE,0x16FE1916,0x12EF5591,0x2E39231,0x3D597D3,0x55146CF,0x88D877A,0x102EF8F0,0x1196A60F,0x1C60BA1D,0x1CF63F80,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x7FFFF};
+const BIG ROI= {0x2ADEF32,0x7594049,0x131919ED,0x14AB9CBE,0x16FE1916,0x12EF5591,0x2E39231,0x3D597D3,0x55146CF,0x88D877A,0x102EF8F0,0x1196A60F,0x1C60BA1D,0x1CF63F80,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x7FFFF};
+const BIG R2modp= {0xFD68B47,0xFCF5D2C,0x437675A,0x1BBC3FBF,0x1411E413,0x13453559,0x10B5639,0x1C34CE79,0x6D476BF,0xFD05F2B,0x15D17C28,0x6C9F76E,0x1C2375B3,0x78CCE9B,0x15F0AB33,0x1960F32E,0x1A8D44E,0x57A38};
+const chunk MConst= 0x1CCC5C05;
+const BIG CRu= {0x1C79298A,0x1838B104,0x2C5F052,0x1DCCF337,0x6092AEC,0x4B35F29,0x1EB361E,0x11384EA,0x3074B20,0x17BB08FD,0x3A8B3E3,0xD70D66F,0x3D2A614,0x1CF63EE4,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x7FFFF};
+const BIG Fra= {0x14B73AB2,0x4B0BD8F,0xABB47D,0x2A29EC4,0x18681E17,0x104069DE,0x12EED67D,0x1553D0A5,0x398E9F8,0x7971034,0xAC9AF23,0x52DEF23,0x14EA18A5,0x1463E345,0x6DE465A,0x17F212B4,0x1AA9CF5B,0xF7B8};
+const BIG Frb= {0xDF6B481,0x2A882B9,0x126D6570,0x1208FDFA,0x1E95FAFF,0x2AEEBB2,0xFF4BBB4,0xE81C72D,0x1B85CD6,0xF67746,0x56549CD,0xC68B6EC,0x776A178,0x8925C3B,0x1921B9A5,0x80DED4B,0x55630A4,0x70847};
+const BIG SQRTm3= {0x164463E2,0x91821C0,0x1272C6B8,0x6EE49AF,0x15143CC3,0x167768C0,0xF2DA0A,0x1E517201,0xBD4F70,0x6E88A80,0x17226ED7,0x94B06CE,0xB44920B,0x1CF63E47,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x7FFFF};
+
+
+#endif
+
+#if CHUNK==64
+
+using namespace B512_60;
+
+// Base Bits= 60
+
+const BIG Modulus= {0x4EB280922ADEF33L,0x6A55CE5F4C6467BL,0xC65DEAB236FE191L,0xCF1EACBE98B8E48L,0x3C111B0EF455146L,0xA1D8CB5307C0BBEL,0xFFFF9EC7F01C60BL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFL};
+const BIG ROI= {0x4EB280922ADEF32L,0x6A55CE5F4C6467BL,0xC65DEAB236FE191L,0xCF1EACBE98B8E48L,0x3C111B0EF455146L,0xA1D8CB5307C0BBEL,0xFFFF9EC7F01C60BL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFL};
+const BIG R2modp= {0x1FA6DCEF99812E9L,0xAB3452895A0B74EL,0xC53EA988C079E1EL,0x1E90E033BA630B9L,0xF1EA41C0714D8B0L,0xE72785387509E28L,0xD86794F834DAB00L,0x9757C2ACCD342A1L,0x44ECB079L};
+const chunk MConst= 0x692A189FCCC5C05L;
+const BIG CRu= {0xB0716209C79298AL,0xCEE6799B8B17C14L,0x78966BE526092AEL,0x20089C27507ACD8L,0xF8EF7611FA3074BL,0x6146B86B378EA2CL,0xFFFF9EC7DC83D2AL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFL};
+const BIG Fra= {0x49617B1F4B73AB2L,0x71514F6202AED1FL,0xF6080D3BD8681E1L,0xF8AA9E852CBBB59L,0xC8CF2E2068398E9L,0x8A5296F791AB26BL,0x196A8C7C68B4EA1L,0xCF5BBF9095A1B79L,0x1EF71AA9L};
+const BIG Frb= {0x5510572DF6B481L,0xF9047EFD49B595CL,0xD055DD765E95FAFL,0xD6740E396BFD2EEL,0x7341ECEE8C1B85CL,0x1786345B7615952L,0xE695124B876776AL,0x30A4406F6A5E486L,0xE108E556L};
+const BIG SQRTm3= {0x1230438164463E2L,0x337724D7C9CB1AEL,0x2ACEED1815143CCL,0x70F28B90083CB68L,0xB5CDD115000BD4FL,0x20B4A583675C89BL,0xFFFF9EC7C8EB449L,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFL};
+
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_HIFIVE.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_HIFIVE.cpp
new file mode 100644
index 0000000..924cd1f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_HIFIVE.cpp
@@ -0,0 +1,55 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "fp_HIFIVE.h"
+
+namespace HIFIVE {
+
+/* Curve HIFIVE */
+
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B336_29;
+
+// Base Bits= 29
+const BIG Modulus= {0x1FFFFFFD,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFF};
+const BIG ROI= {0x1559D3B8,0x1C02413F,0xFAB18DA,0x128A7172,0xB95DA4C,0x16D4FE54,0x3107D87,0xAA7BEF3,0x1C38B2B4,0x1A93C08F,0x10F80C7B,0x1F27F};
+const BIG R2modp= {0x9000000,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const chunk MConst= 0x3;
+#endif
+
+#if CHUNK==64
+
+using namespace B336_60;
+
+// Base Bits= 60
+const BIG Modulus= {0xFFFFFFFFFFFFFFDL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFL};
+const BIG ROI= {0xB804827F559D3B8L,0xC94538B93EAC636L,0x1EDA9FCA8B95DA4L,0xB4553DF798C41F6L,0x1EF527811FC38B2L,0xF93FC3E03L};
+const BIG R2modp= {0x9000000000000L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const chunk MConst= 0x3L;
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_JUBJUB.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_JUBJUB.cpp
new file mode 100644
index 0000000..a20171f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_JUBJUB.cpp
@@ -0,0 +1,54 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "fp_JUBJUB.h"
+
+namespace JUBJUB {
+
+/* JUBJUB Modulus  */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B256_29;
+
+// Base Bits= 29
+const BIG Modulus= {0x1,0x1FFFFFF8,0x1F96FFBF,0x1B4805FF,0x1D80553B,0xC0404D0,0x1520CCE7,0xA6533AF,0x73EDA7};
+const BIG ROI= {0xB912F1F,0x1BC47A80,0xCF82506,0x49FE4E1,0xD6C0C40,0x16E468B4,0xDBC3F55,0x13CB682D,0x212D7};
+const BIG R2modp= {0xA71B3C0,0x1D32207E,0x1663D999,0x1C5ABC93,0x3B58C44,0xBE37438,0x829F771,0x1660139E,0x27FD91};
+const chunk MConst= 0x1FFFFFFF;
+#endif
+
+#if CHUNK==64
+
+using namespace B256_56;
+
+// Base Bits= 56
+const BIG Modulus= {0xFFFFFF00000001L,0xA402FFFE5BFEFFL,0x809A1D80553BDL,0x299D7D483339D8L,0x73EDA753L};
+const BIG ROI= {0x788F500B912F1FL,0x4FF270B3E0941BL,0xC8D168D6C0C402L,0x5B416B6F0FD56DL,0x212D79EL};
+const BIG R2modp= {0x3B3440EC31BBA9L,0x8929657E045FB0L,0x2D645CF57C6E1AL,0xEA6A1C5012ECF5L,0x3C7B9D12L};
+const chunk MConst= 0xFFFFFEFFFFFFFFL;
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_MDC.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_MDC.cpp
new file mode 100644
index 0000000..a193694
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_MDC.cpp
@@ -0,0 +1,54 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "fp_MDC.h"
+
+namespace MDC {
+
+/* Million Dollar Curve */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B256_28;
+
+// Base Bits= 28
+const BIG Modulus= {0x779EC13,0x3710405,0x7AF9EC1,0x9037EF0,0xD4F086A,0xFDD7A5F,0x4532F92,0xD456AFB,0x13B68B9,0xF};
+const BIG R2modp= {0xDA5D1FE,0xDE5B77F,0x2985975,0x3228385,0x95FA423,0xA24A9FC,0xA869FAE,0x6853D0E,0xEC4B765,0x3};
+const BIG ROI= {0x779EC12,0x3710405,0x7AF9EC1,0x9037EF0,0xD4F086A,0xFDD7A5F,0x4532F92,0xD456AFB,0x13B68B9,0xF};
+const chunk MConst= 0xAE541E5;
+#endif
+
+#if CHUNK==64
+
+using namespace B256_56;
+
+// Base Bits= 56
+const BIG Modulus= {0x3710405779EC13L,0x9037EF07AF9EC1L,0xFDD7A5FD4F086AL,0xD456AFB4532F92L,0xF13B68B9L};
+const BIG R2modp= {0xDE5B77FDA5D1FEL,0x32283852985975L,0xA24A9FC95FA423L,0x6853D0EA869FAEL,0x3EC4B765L};
+const BIG ROI= {0x3710405779EC12L,0x9037EF07AF9EC1L,0xFDD7A5FD4F086AL,0xD456AFB4532F92L,0xF13B68B9L};
+const chunk MConst= 0xF10FDDAAE541E5L;
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_NIST256.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_NIST256.cpp
new file mode 100644
index 0000000..234638e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_NIST256.cpp
@@ -0,0 +1,55 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "fp_NIST256.h"
+
+namespace NIST256 {
+
+/* Curve NIST256 */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B256_28;
+
+// Base Bits= 28
+const BIG Modulus= {0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFF,0x0,0x0,0x1000000,0x0,0xFFFFFFF,0xF};
+const BIG ROI= {0xFFFFFFE,0xFFFFFFF,0xFFFFFFF,0xFFF,0x0,0x0,0x1000000,0x0,0xFFFFFFF,0xF};
+const BIG R2modp= {0x50000,0x300000,0x0,0x0,0xFFFFFFA,0xFFFFFBF,0xFFFFEFF,0xFFFAFFF,0x2FFFF,0x0};
+const chunk MConst= 0x1;
+#endif
+
+#if CHUNK==64
+
+using namespace B256_56;
+
+// Base Bits= 56
+const BIG Modulus= {0xFFFFFFFFFFFFFFL,0xFFFFFFFFFFL,0x0L,0x1000000L,0xFFFFFFFFL};
+const BIG ROI= {0xFFFFFFFFFFFFFEL,0xFFFFFFFFFFL,0x0L,0x1000000L,0xFFFFFFFFL};
+const BIG R2modp= {0x3000000050000L,0x0L,0xFFFFFBFFFFFFFAL,0xFFFAFFFFFFFEFFL,0x2FFFFL};
+const chunk MConst= 0x1L;
+
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_NIST384.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_NIST384.cpp
new file mode 100644
index 0000000..59d5672
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_NIST384.cpp
@@ -0,0 +1,55 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "fp_NIST384.h"
+
+namespace NIST384 {
+
+/* Curve NIST384 */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B384_29;
+
+// Base Bits= 29
+const BIG Modulus= {0x1FFFFFFF,0x7,0x0,0x1FFFFE00,0x1FFFEFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x7F};
+const BIG ROI= {0x1FFFFFFE,0x7,0x0,0x1FFFFE00,0x1FFFEFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x7F};
+const BIG R2modp= {0x0,0x8000,0x1FF80000,0x1FFFFF,0x2000000,0x0,0x0,0x1FFFFFFC,0xF,0x100,0x400,0x0,0x0,0x0};
+const chunk MConst= 0x1;
+#endif
+
+#if CHUNK==64
+
+using namespace B384_56;
+
+// Base Bits= 56
+const BIG Modulus= {0xFFFFFFFFL,0xFFFF0000000000L,0xFFFFFFFFFEFFFFL,0xFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFL};
+const BIG ROI= {0xFFFFFFFEL,0xFFFF0000000000L,0xFFFFFFFFFEFFFFL,0xFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFL};
+const BIG R2modp= {0xFE000000010000L,0xFFFFFFL,0x2L,0xFFFFFFFE00L,0x1000000020000L,0x0L,0x0L};
+const chunk MConst= 0x100000001L;
+
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_NIST521.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_NIST521.cpp
new file mode 100644
index 0000000..29ce9c1
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_NIST521.cpp
@@ -0,0 +1,54 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "fp_NIST521.h"
+
+namespace NIST521 {
+
+/* Curve NIST521 */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B528_28;
+
+// Base Bits= 28
+const BIG Modulus= {0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0x1FFFF};
+const BIG ROI= {0xFFFFFFE,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0x1FFFF};
+const BIG R2modp= {0x400000,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0};
+const chunk MConst= 0x1;
+#endif
+
+#if CHUNK==64
+
+using namespace B528_60;
+
+// Base Bits= 60
+const BIG Modulus= {0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0x1FFFFFFFFFFL};
+const BIG ROI= {0xFFFFFFFFFFFFFFEL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFFL,0x1FFFFFFFFFFL};
+const BIG R2modp= {0x4000000000L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L,0x0L};
+const chunk MConst= 0x1L;
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_SECP160R1.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_SECP160R1.cpp
new file mode 100644
index 0000000..71fdf8e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_SECP160R1.cpp
@@ -0,0 +1,64 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "fp_SECP160R1.h"
+
+namespace SECP160R1 {
+
+/* Curve SECP160R1 */
+
+#if CHUNK==16
+using namespace B160_13;
+// Base Bits= 13
+const BIG Modulus= {0x1FFF,0x1FFF,0x1FDF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0xF};
+const BIG R2modp= {0x0,0x20,0x0,0x800,0x0,0x0,0x4,0x0,0x0,0x0,0x0,0x0,0x0};
+const BIG ROI= {0x1FFE,0x1FFF,0x1FDF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0x1FFF,0xF};
+const chunk MConst= 0x1;
+
+#endif
+
+#if CHUNK==32
+
+using namespace B160_29;
+
+// Base Bits= 29
+
+
+const BIG Modulus= {0x1FFFFFFF,0x1FFFFFFB,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x7FFF};
+const BIG R2modp= {0x10000000,0x0,0x4,0x8,0x0,0x0};
+const BIG ROI= {0x1FFFFFFE,0x1FFFFFFB,0x1FFFFFFF,0x1FFFFFFF,0x1FFFFFFF,0x7FFF};
+const chunk MConst= 0x1;
+
+
+#endif
+
+#if CHUNK==64
+
+using namespace B160_56;
+
+// Base Bits= 56
+const BIG Modulus= {0xFFFFFF7FFFFFFFL,0xFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFL};
+const BIG R2modp= {0x1000000010000L,0x400000L,0x0L};
+const BIG ROI= {0xFFFFFF7FFFFFFEL,0xFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFL};
+const chunk MConst= 0xFFFFFF80000001L;
+
+
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_SECP256K1.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_SECP256K1.cpp
new file mode 100644
index 0000000..5d19274
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_SECP256K1.cpp
@@ -0,0 +1,60 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "fp_SECP256K1.h"
+
+namespace SECP256K1 {
+
+/* Curve SECP256K1 */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B256_28;
+
+// Base Bits= 28
+const BIG Modulus= {0xFFFFC2F,0xFFFFFEF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xF};
+const BIG ROI= {0xFFFFC2E,0xFFFFFEF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xF};
+const BIG R2modp= {0x0,0xA100000,0x2000E90,0x7A,0x1,0x0,0x0,0x0,0x0,0x0};
+const chunk MConst= 0x2253531;
+const BIG SQRTm3= {0x4,0x0,0x60C,0x0,0x3CF0F,0x0,0x126CD89,0x4000000,0x5236482,0x2};
+
+
+#endif
+
+#if CHUNK==64
+
+using namespace B256_56;
+
+// Base Bits= 56
+const BIG Modulus= {0xFFFFFEFFFFFC2FL,0xFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFL,0xFFFFFFFFL};
+const BIG ROI= {0xFFFFFEFFFFFC2EL,0xFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFL,0xFFFFFFFFL};
+const BIG R2modp= {0xA1000000000000L,0x7A2000E90L,0x1L,0x0L,0x0L};
+const chunk MConst= 0x38091DD2253531L;
+const BIG SQRTm3= {0x8D27AE1CD5F852L,0x6D15DA14ECD47DL,0xC2A797962CC61FL,0x3507F1DF233770L,0xA2D2BA9L};
+
+
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_SM2.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_SM2.cpp
new file mode 100644
index 0000000..de85654
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_SM2.cpp
@@ -0,0 +1,55 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "fp_SM2.h"
+
+namespace SM2 {
+
+/* Curve SM2 */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B256_28;
+
+// Base Bits= 28
+const BIG Modulus= {0xFFFFFFF,0xFFFFFFF,0xFF,0xFFFF000,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFE,0xF};
+const BIG ROI= {0xFFFFFFE,0xFFFFFFF,0xFF,0xFFFF000,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFF,0xFFFFFFE,0xF};
+const BIG R2modp= {0x40000,0x300000,0xE000000,0xFFFFFFF,0x2,0x30,0x100,0x1000,0x60000,0x0};
+const chunk MConst= 0x1;
+#endif
+
+#if CHUNK==64
+
+using namespace B256_56;
+
+// Base Bits= 56
+const BIG Modulus= {0xFFFFFFFFFFFFFFL,0xFFFF00000000FFL,0xFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFL,0xFFFFFFFEL};
+const BIG ROI= {0xFFFFFFFFFFFFFEL,0xFFFF00000000FFL,0xFFFFFFFFFFFFFFL,0xFFFFFFFFFFFFFFL,0xFFFFFFFEL};
+const BIG R2modp= {0x3000000040000L,0xFFFFFFFE000000L,0x300000002L,0x10000000100L,0x60000L};
+const chunk MConst= 0x1L;
+
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_TWEEDLEDEE.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_TWEEDLEDEE.cpp
new file mode 100644
index 0000000..2b13555
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_TWEEDLEDEE.cpp
@@ -0,0 +1,57 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "fp_TWEEDLEDEE.h"
+
+namespace TWEEDLEDEE {
+
+/* TWEEDLEDEE Curve */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B256_29;
+
+// Base  bits= 29
+const BIG Modulus= {0x1,0x1657EA0,0x18A1B261,0x15424ED2,0x38,0x0,0x0,0x0,0x400000};
+const BIG R2modp= {0x3FF4,0xE8E1080,0xA9C2909,0xC128269,0x89F8301,0x19607541,0x1F4C0E6F,0x3443009,0x22B644};
+const BIG ROI= {0x69D57EC,0x5E991A4,0x213EFC7,0x10FBA370,0x72930A2,0x5B22D4C,0x102FC76F,0xA21B807,0x113EFC};
+const BIG SQRTm3= {0x91F49FA,0x17E6AD31,0x19F5AE40,0x8F54DB0,0x3FFCD01,0xB5FF973,0x12C43D6C,0xE878126,0x2D8CDA};
+const chunk MConst= 0x1FFFFFFF;
+#endif
+
+#if CHUNK==64
+
+using namespace B256_56;
+
+// Base  bits= 56
+const BIG Modulus= {0x2CAFD400000001L,0xA127696286C984L,0x38AL,0x0L,0x40000000L};
+const BIG R2modp= {0x21CA8949BBE5DFL,0x717E3D9E719200L,0xB8A93694FCEE5L,0xE6FCB03AA0A27EL,0x2013F4C0L};
+const BIG ROI= {0xBD3234869D57ECL,0x7DD1B8084FBF1CL,0x645A9872930A28L,0xDC03C0BF1DBCBL,0x113EFC51L};
+const BIG SQRTm3= {0xFCD5A6291F49FAL,0x7AA6D867D6B902L,0xBFF2E63FFCD014L,0x3C0934B10F5B16L,0x2D8CDA74L};
+const chunk MConst= 0x2CAFD3FFFFFFFFL;
+
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_TWEEDLEDUM.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_TWEEDLEDUM.cpp
new file mode 100644
index 0000000..9e9f6e5
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rom_field_TWEEDLEDUM.cpp
@@ -0,0 +1,57 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#include "arch.h"
+#include "fp_TWEEDLEDUM.h"
+
+namespace TWEEDLEDUM {
+
+/* TWEEDLEDUM Curve */
+
+#if CHUNK==16
+
+#error Not supported
+
+#endif
+
+#if CHUNK==32
+
+using namespace B256_29;
+
+// Base  bits= 29
+const BIG Modulus= {0x1,0xA032710,0xFD66E68,0x15424ED8,0x38,0x0,0x0,0x0,0x400000};
+const BIG R2modp= {0x3FF4,0x1B622B40,0x1166FB28,0x5BEEDDF,0x16646668,0x321298C,0xDD7B28E,0x3E66507,0x22B644};
+const BIG ROI= {0x188837CE,0x1EF4F98D,0x1AA67594,0xDD1E7E7,0x2D57FF4,0x197557C6,0xBF3D893,0x2F121DC,0x2AE451};
+const BIG SQRTm3= {0x17DE6C70,0x10786BD5,0x1DC95B25,0xD55C069,0x184CB128,0x16EB9107,0x1B5B20A1,0x95285A0,0x15EF7D};
+const chunk MConst= 0x1FFFFFFF;
+#endif
+
+#if CHUNK==64
+
+using namespace B256_56;
+
+// Base  bits= 56
+const BIG Modulus= {0x4064E200000001L,0xA1276C3F59B9A1L,0x38AL,0x0L,0x40000000L};
+const BIG R2modp= {0xFC85D749BBE0CDL,0x64ED6614FCA69BL,0x9925C8F6AC3D6DL,0x28E19094C65991L,0xA0EDD7BL};
+const BIG ROI= {0xDE9F31B88837CEL,0xE8F3F3EA99D653L,0xEAAF8C2D57FF46L,0x890EE2FCF624F2L,0x2AE45117L};
+const BIG SQRTm3= {0xF0D7AB7DE6C70L,0xAAE034F7256C96L,0xD7220F84CB1286L,0x942D06D6C8286DL,0x15EF7D4AL};
+const chunk MConst= 0x4064E1FFFFFFFFL;
+
+#endif
+
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rsa.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rsa.cpp
new file mode 100644
index 0000000..3665a48
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rsa.cpp
@@ -0,0 +1,184 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* RSA Functions - see main program below */
+
+#include <stdio.h>
+#include <string.h>
+#include <stdlib.h>
+#include <time.h>
+
+#include "rsa_WWW.h"
+
+using namespace XXX;
+
+/* generate an RSA key pair */
+void WWW::RSA_KEY_PAIR(csprng *RNG, sign32 e, rsa_private_key *PRIV, rsa_public_key *PUB, octet *P, octet* Q)
+{
+    /* IEEE1363 A16.11/A16.12 more or less */
+    BIG t[HFLEN_WWW], p1[HFLEN_WWW], q1[HFLEN_WWW];
+
+    if (RNG != NULL)
+    {
+
+        for (;;)
+        {
+
+            FF_random(PRIV->p, RNG, HFLEN_WWW);
+            while (FF_lastbits(PRIV->p, 2) != 3) FF_inc(PRIV->p, 1, HFLEN_WWW);
+            while (!FF_prime(PRIV->p, RNG, HFLEN_WWW))
+                FF_inc(PRIV->p, 4, HFLEN_WWW);
+
+            FF_copy(p1, PRIV->p, HFLEN_WWW);
+            FF_dec(p1, 1, HFLEN_WWW);
+
+            if (FF_cfactor(p1, e, HFLEN_WWW)) continue;
+            break;
+        }
+
+        for (;;)
+        {
+            FF_random(PRIV->q, RNG, HFLEN_WWW);
+            while (FF_lastbits(PRIV->q, 2) != 3) FF_inc(PRIV->q, 1, HFLEN_WWW);
+            while (!FF_prime(PRIV->q, RNG, HFLEN_WWW))
+                FF_inc(PRIV->q, 4, HFLEN_WWW);
+
+            FF_copy(q1, PRIV->q, HFLEN_WWW);
+            FF_dec(q1, 1, HFLEN_WWW);
+            if (FF_cfactor(q1, e, HFLEN_WWW)) continue;
+
+            break;
+        }
+
+    }
+    else
+    {
+        FF_fromOctet(PRIV->p, P, HFLEN_WWW);
+        FF_fromOctet(PRIV->q, Q, HFLEN_WWW);
+
+        FF_copy(p1, PRIV->p, HFLEN_WWW);
+        FF_dec(p1, 1, HFLEN_WWW);
+
+        FF_copy(q1, PRIV->q, HFLEN_WWW);
+        FF_dec(q1, 1, HFLEN_WWW);
+    }
+
+    FF_mul(PUB->n, PRIV->p, PRIV->q, HFLEN_WWW);
+    PUB->e = e;
+
+// Only works for 3 mod 4 primes (as always generated above)
+
+    FF_copy(t, p1, HFLEN_WWW);
+    FF_shr(t, HFLEN_WWW);
+    FF_init(PRIV->dp, e, HFLEN_WWW);
+    FF_invmodp(PRIV->dp, PRIV->dp, t, HFLEN_WWW);
+    if (FF_parity(PRIV->dp) == 0) FF_add(PRIV->dp, PRIV->dp, t, HFLEN_WWW);
+    FF_norm(PRIV->dp, HFLEN_WWW);
+
+    FF_copy(t, q1, HFLEN_WWW);
+    FF_shr(t, HFLEN_WWW);
+    FF_init(PRIV->dq, e, HFLEN_WWW);
+    FF_invmodp(PRIV->dq, PRIV->dq, t, HFLEN_WWW);
+    if (FF_parity(PRIV->dq) == 0) FF_add(PRIV->dq, PRIV->dq, t, HFLEN_WWW);
+    FF_norm(PRIV->dq, HFLEN_WWW);
+
+    FF_invmodp(PRIV->c, PRIV->p, PRIV->q, HFLEN_WWW);
+
+    return;
+}
+
+// Input private key from OpenSSL format
+// e.g as in openssl rsa -in privkey.pem -noout -text
+// Note order swap - For MIRACL c=1/p mod q, for OpenSSL c=1/q mod p
+void WWW::RSA_PRIVATE_KEY_FROM_OPENSSL(octet *P,octet* Q,octet *DP,octet *DQ,octet *C,rsa_private_key *PRIV)
+{
+    FF_fromOctet(PRIV->p,Q,HFLEN_WWW);
+    FF_fromOctet(PRIV->q,P,HFLEN_WWW);   
+    FF_fromOctet(PRIV->dp,DQ,HFLEN_WWW);
+    FF_fromOctet(PRIV->dq,DP,HFLEN_WWW);
+    FF_fromOctet(PRIV->c,C,HFLEN_WWW);
+}
+
+void WWW::RSA_KEY_PAIR_FROM_OPENSSL(sign32 e,octet *P,octet* Q,octet *DP,octet *DQ,octet *C,rsa_private_key *PRIV,rsa_public_key *PUB)
+{ 
+    RSA_PRIVATE_KEY_FROM_OPENSSL(P,Q,DP,DQ,C,PRIV);
+    FF_mul(PUB->n, PRIV->p, PRIV->q, HFLEN_WWW);
+    PUB->e = e;
+}
+
+/* destroy the Private Key structure */
+void WWW::RSA_PRIVATE_KEY_KILL(rsa_private_key *PRIV)
+{
+    FF_zero(PRIV->p, HFLEN_WWW);
+    FF_zero(PRIV->q, HFLEN_WWW);
+    FF_zero(PRIV->dp, HFLEN_WWW);
+    FF_zero(PRIV->dq, HFLEN_WWW);
+    FF_zero(PRIV->c, HFLEN_WWW);
+}
+
+void WWW::RSA_fromOctet(BIG x[], octet *w)
+{
+    FF_fromOctet(x, w, FFLEN_WWW);
+}
+
+/* RSA encryption with the public key */
+void WWW::RSA_ENCRYPT(rsa_public_key *PUB, octet *F, octet *G)
+{
+    BIG f[FFLEN_WWW];
+    FF_fromOctet(f, F, FFLEN_WWW);
+
+    FF_power(f, f, PUB->e, PUB->n, FFLEN_WWW);
+
+    FF_toOctet(G, f, FFLEN_WWW);
+}
+
+/* RSA decryption with the private key */
+void WWW::RSA_DECRYPT(rsa_private_key *PRIV, octet *G, octet *F)
+{
+    BIG g[FFLEN_WWW], t[FFLEN_WWW], jp[HFLEN_WWW], jq[HFLEN_WWW];
+
+    FF_fromOctet(g, G, FFLEN_WWW);
+
+    FF_dmod(jp, g, PRIV->p, HFLEN_WWW);
+    FF_dmod(jq, g, PRIV->q, HFLEN_WWW);
+
+    FF_skpow(jp, jp, PRIV->dp, PRIV->p, HFLEN_WWW);
+    FF_skpow(jq, jq, PRIV->dq, PRIV->q, HFLEN_WWW);
+
+
+    FF_zero(g, FFLEN_WWW);
+    FF_copy(g, jp, HFLEN_WWW);
+    FF_mod(jp, PRIV->q, HFLEN_WWW);
+    if (FF_comp(jp, jq, HFLEN_WWW) > 0)
+        FF_add(jq, jq, PRIV->q, HFLEN_WWW);
+    FF_sub(jq, jq, jp, HFLEN_WWW);
+    FF_norm(jq, HFLEN_WWW);
+
+    FF_mul(t, PRIV->c, jq, HFLEN_WWW);
+    FF_dmod(jq, t, PRIV->q, HFLEN_WWW);
+
+    FF_mul(t, jq, PRIV->p, HFLEN_WWW);
+    FF_add(g, t, g, FFLEN_WWW);
+    FF_norm(g, FFLEN_WWW);
+
+    FF_toOctet(F, g, FFLEN_WWW);
+
+    return;
+}
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rsa.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rsa.h
new file mode 100644
index 0000000..334f18e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rsa.h
@@ -0,0 +1,138 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file rsa.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief RSA Header file for implementation of RSA protocol
+ *
+ * declares functions
+ *
+ */
+
+#ifndef RSA_WWW_H
+#define RSA_WWW_H
+
+#include "ff_WWW.h"
+//#include "rsa_support.h"
+
+using namespace core;
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+#define HASH_TYPE_RSA_WWW SHA256 /**< Chosen Hash algorithm */
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define RFS_WWW MODBYTES_XXX*FFLEN_WWW /**< RSA Public Key Size in bytes */
+
+
+namespace WWW {
+
+/**
+    @brief Integer Factorisation Public Key
+*/
+
+typedef struct
+{
+    sign32 e;     /**< RSA exponent (typically 65537) */
+    XXX::BIG n[FFLEN_WWW]; /**< An array of BIGs to store public key */
+} rsa_public_key;
+
+/**
+    @brief Integer Factorisation Private Key
+*/
+
+typedef struct
+{
+    XXX::BIG p[FFLEN_WWW / 2]; /**< secret prime p  */
+    XXX::BIG q[FFLEN_WWW / 2]; /**< secret prime q  */
+    XXX::BIG dp[FFLEN_WWW / 2]; /**< decrypting exponent mod (p-1)  */
+    XXX::BIG dq[FFLEN_WWW / 2]; /**< decrypting exponent mod (q-1)  */
+    XXX::BIG c[FFLEN_WWW / 2]; /**< 1/p mod q */
+} rsa_private_key;
+
+
+/** @brief RSA Private KEy from OpenSSL 
+ *
+    @param P Input prime number
+    @param Q Input prime number
+    @param DP Input 1/e mod p-1
+    @param DQ Input 1/e mod q-1
+    @param C Input 1/p mod q
+    @param PRIV the output RSA private key
+ */
+extern void RSA_PRIVATE_KEY_FROM_OPENSSL(octet *P,octet* Q,octet *DP,octet *DQ,octet *C,rsa_private_key *PRIV);
+
+/** @brief RSA Key Pair from OpenSSL 
+ *
+    @param e the encryption exponent
+    @param P Input prime number
+    @param Q Input prime number
+    @param DP Input 1/e mod p-1
+    @param DQ Input 1/e mod q-1
+    @param C Input 1/p mod q
+    @param PRIV the output RSA private key
+    @param PUB the output RSA public key
+ */
+extern void RSA_KEY_PAIR_FROM_OPENSSL(sign32 e,octet *P,octet* Q,octet *DP,octet *DQ,octet *C,rsa_private_key *PRIV,rsa_public_key *PUB);
+
+/** @brief RSA Key Pair Generator
+ *
+    @param R is a pointer to a cryptographically secure random number generator
+    @param e the encryption exponent
+    @param PRIV the output RSA private key
+    @param PUB the output RSA public key
+    @param P Input prime number. Used when R is equal to NULL for testing
+    @param Q Input prime number. Used when R is equal to NULL for testing
+ */
+extern void RSA_KEY_PAIR(csprng *R, sign32 e, rsa_private_key* PRIV, rsa_public_key* PUB, octet *P, octet* Q);
+
+/** @brief RSA encryption of suitably padded plaintext
+ *
+    @param PUB the input RSA public key
+    @param F is input padded message
+    @param G is the output ciphertext
+ */
+extern void RSA_ENCRYPT(rsa_public_key* PUB, octet *F, octet *G);
+/** @brief RSA decryption of ciphertext
+ *
+    @param PRIV the input RSA private key
+    @param G is the input ciphertext
+    @param F is output plaintext (requires unpadding)
+
+ */
+extern void RSA_DECRYPT(rsa_private_key* PRIV, octet *G, octet *F);
+/** @brief Destroy an RSA private Key
+ *
+    @param PRIV the input RSA private key. Destroyed on output.
+ */
+extern void RSA_PRIVATE_KEY_KILL(rsa_private_key *PRIV);
+/** @brief Populates an RSA public key from an octet string
+ *
+    Creates RSA public key from big-endian base 256 form.
+    @param x FF instance to be created from an octet string
+    @param S input octet string
+ */
+extern void RSA_fromOctet(XXX::BIG *x, octet *S);
+}
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rsa_RSA2048.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rsa_RSA2048.h
new file mode 100644
index 0000000..a5c22e2
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rsa_RSA2048.h
@@ -0,0 +1,138 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file rsa.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief RSA Header file for implementation of RSA protocol
+ *
+ * declares functions
+ *
+ */
+
+#ifndef RSA_RSA2048_H
+#define RSA_RSA2048_H
+
+#include "ff_RSA2048.h"
+//#include "rsa_support.h"
+
+using namespace core;
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+#define HASH_TYPE_RSA_RSA2048 SHA256 /**< Chosen Hash algorithm */
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define RFS_RSA2048 MODBYTES_B512_60*FFLEN_RSA2048 /**< RSA Public Key Size in bytes */
+
+
+namespace RSA2048 {
+
+/**
+    @brief Integer Factorisation Public Key
+*/
+
+typedef struct
+{
+    sign32 e;     /**< RSA exponent (typically 65537) */
+    B512_60::BIG n[FFLEN_RSA2048]; /**< An array of BIGs to store public key */
+} rsa_public_key;
+
+/**
+    @brief Integer Factorisation Private Key
+*/
+
+typedef struct
+{
+    B512_60::BIG p[FFLEN_RSA2048 / 2]; /**< secret prime p  */
+    B512_60::BIG q[FFLEN_RSA2048 / 2]; /**< secret prime q  */
+    B512_60::BIG dp[FFLEN_RSA2048 / 2]; /**< decrypting exponent mod (p-1)  */
+    B512_60::BIG dq[FFLEN_RSA2048 / 2]; /**< decrypting exponent mod (q-1)  */
+    B512_60::BIG c[FFLEN_RSA2048 / 2]; /**< 1/p mod q */
+} rsa_private_key;
+
+
+/** @brief RSA Private KEy from OpenSSL 
+ *
+    @param P Input prime number
+    @param Q Input prime number
+    @param DP Input 1/e mod p-1
+    @param DQ Input 1/e mod q-1
+    @param C Input 1/p mod q
+    @param PRIV the output RSA private key
+ */
+extern void RSA_PRIVATE_KEY_FROM_OPENSSL(octet *P,octet* Q,octet *DP,octet *DQ,octet *C,rsa_private_key *PRIV);
+
+/** @brief RSA Key Pair from OpenSSL 
+ *
+    @param e the encryption exponent
+    @param P Input prime number
+    @param Q Input prime number
+    @param DP Input 1/e mod p-1
+    @param DQ Input 1/e mod q-1
+    @param C Input 1/p mod q
+    @param PRIV the output RSA private key
+    @param PUB the output RSA public key
+ */
+extern void RSA_KEY_PAIR_FROM_OPENSSL(sign32 e,octet *P,octet* Q,octet *DP,octet *DQ,octet *C,rsa_private_key *PRIV,rsa_public_key *PUB);
+
+/** @brief RSA Key Pair Generator
+ *
+    @param R is a pointer to a cryptographically secure random number generator
+    @param e the encryption exponent
+    @param PRIV the output RSA private key
+    @param PUB the output RSA public key
+    @param P Input prime number. Used when R is equal to NULL for testing
+    @param Q Input prime number. Used when R is equal to NULL for testing
+ */
+extern void RSA_KEY_PAIR(csprng *R, sign32 e, rsa_private_key* PRIV, rsa_public_key* PUB, octet *P, octet* Q);
+
+/** @brief RSA encryption of suitably padded plaintext
+ *
+    @param PUB the input RSA public key
+    @param F is input padded message
+    @param G is the output ciphertext
+ */
+extern void RSA_ENCRYPT(rsa_public_key* PUB, octet *F, octet *G);
+/** @brief RSA decryption of ciphertext
+ *
+    @param PRIV the input RSA private key
+    @param G is the input ciphertext
+    @param F is output plaintext (requires unpadding)
+
+ */
+extern void RSA_DECRYPT(rsa_private_key* PRIV, octet *G, octet *F);
+/** @brief Destroy an RSA private Key
+ *
+    @param PRIV the input RSA private key. Destroyed on output.
+ */
+extern void RSA_PRIVATE_KEY_KILL(rsa_private_key *PRIV);
+/** @brief Populates an RSA public key from an octet string
+ *
+    Creates RSA public key from big-endian base 256 form.
+    @param x FF instance to be created from an octet string
+    @param S input octet string
+ */
+extern void RSA_fromOctet(B512_60::BIG *x, octet *S);
+}
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rsa_RSA3072.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rsa_RSA3072.h
new file mode 100644
index 0000000..0be26ce
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rsa_RSA3072.h
@@ -0,0 +1,138 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file rsa.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief RSA Header file for implementation of RSA protocol
+ *
+ * declares functions
+ *
+ */
+
+#ifndef RSA_RSA3072_H
+#define RSA_RSA3072_H
+
+#include "ff_RSA3072.h"
+//#include "rsa_support.h"
+
+using namespace core;
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+#define HASH_TYPE_RSA_RSA3072 SHA256 /**< Chosen Hash algorithm */
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define RFS_RSA3072 MODBYTES_B384_56*FFLEN_RSA3072 /**< RSA Public Key Size in bytes */
+
+
+namespace RSA3072 {
+
+/**
+    @brief Integer Factorisation Public Key
+*/
+
+typedef struct
+{
+    sign32 e;     /**< RSA exponent (typically 65537) */
+    B384_56::BIG n[FFLEN_RSA3072]; /**< An array of BIGs to store public key */
+} rsa_public_key;
+
+/**
+    @brief Integer Factorisation Private Key
+*/
+
+typedef struct
+{
+    B384_56::BIG p[FFLEN_RSA3072 / 2]; /**< secret prime p  */
+    B384_56::BIG q[FFLEN_RSA3072 / 2]; /**< secret prime q  */
+    B384_56::BIG dp[FFLEN_RSA3072 / 2]; /**< decrypting exponent mod (p-1)  */
+    B384_56::BIG dq[FFLEN_RSA3072 / 2]; /**< decrypting exponent mod (q-1)  */
+    B384_56::BIG c[FFLEN_RSA3072 / 2]; /**< 1/p mod q */
+} rsa_private_key;
+
+
+/** @brief RSA Private KEy from OpenSSL 
+ *
+    @param P Input prime number
+    @param Q Input prime number
+    @param DP Input 1/e mod p-1
+    @param DQ Input 1/e mod q-1
+    @param C Input 1/p mod q
+    @param PRIV the output RSA private key
+ */
+extern void RSA_PRIVATE_KEY_FROM_OPENSSL(octet *P,octet* Q,octet *DP,octet *DQ,octet *C,rsa_private_key *PRIV);
+
+/** @brief RSA Key Pair from OpenSSL 
+ *
+    @param e the encryption exponent
+    @param P Input prime number
+    @param Q Input prime number
+    @param DP Input 1/e mod p-1
+    @param DQ Input 1/e mod q-1
+    @param C Input 1/p mod q
+    @param PRIV the output RSA private key
+    @param PUB the output RSA public key
+ */
+extern void RSA_KEY_PAIR_FROM_OPENSSL(sign32 e,octet *P,octet* Q,octet *DP,octet *DQ,octet *C,rsa_private_key *PRIV,rsa_public_key *PUB);
+
+/** @brief RSA Key Pair Generator
+ *
+    @param R is a pointer to a cryptographically secure random number generator
+    @param e the encryption exponent
+    @param PRIV the output RSA private key
+    @param PUB the output RSA public key
+    @param P Input prime number. Used when R is equal to NULL for testing
+    @param Q Input prime number. Used when R is equal to NULL for testing
+ */
+extern void RSA_KEY_PAIR(csprng *R, sign32 e, rsa_private_key* PRIV, rsa_public_key* PUB, octet *P, octet* Q);
+
+/** @brief RSA encryption of suitably padded plaintext
+ *
+    @param PUB the input RSA public key
+    @param F is input padded message
+    @param G is the output ciphertext
+ */
+extern void RSA_ENCRYPT(rsa_public_key* PUB, octet *F, octet *G);
+/** @brief RSA decryption of ciphertext
+ *
+    @param PRIV the input RSA private key
+    @param G is the input ciphertext
+    @param F is output plaintext (requires unpadding)
+
+ */
+extern void RSA_DECRYPT(rsa_private_key* PRIV, octet *G, octet *F);
+/** @brief Destroy an RSA private Key
+ *
+    @param PRIV the input RSA private key. Destroyed on output.
+ */
+extern void RSA_PRIVATE_KEY_KILL(rsa_private_key *PRIV);
+/** @brief Populates an RSA public key from an octet string
+ *
+    Creates RSA public key from big-endian base 256 form.
+    @param x FF instance to be created from an octet string
+    @param S input octet string
+ */
+extern void RSA_fromOctet(B384_56::BIG *x, octet *S);
+}
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rsa_RSA4096.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rsa_RSA4096.h
new file mode 100644
index 0000000..fbd9ff7
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/rsa_RSA4096.h
@@ -0,0 +1,138 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file rsa.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief RSA Header file for implementation of RSA protocol
+ *
+ * declares functions
+ *
+ */
+
+#ifndef RSA_RSA4096_H
+#define RSA_RSA4096_H
+
+#include "ff_RSA4096.h"
+//#include "rsa_support.h"
+
+using namespace core;
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+#define HASH_TYPE_RSA_RSA4096 SHA256 /**< Chosen Hash algorithm */
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define RFS_RSA4096 MODBYTES_B512_60*FFLEN_RSA4096 /**< RSA Public Key Size in bytes */
+
+
+namespace RSA4096 {
+
+/**
+    @brief Integer Factorisation Public Key
+*/
+
+typedef struct
+{
+    sign32 e;     /**< RSA exponent (typically 65537) */
+    B512_60::BIG n[FFLEN_RSA4096]; /**< An array of BIGs to store public key */
+} rsa_public_key;
+
+/**
+    @brief Integer Factorisation Private Key
+*/
+
+typedef struct
+{
+    B512_60::BIG p[FFLEN_RSA4096 / 2]; /**< secret prime p  */
+    B512_60::BIG q[FFLEN_RSA4096 / 2]; /**< secret prime q  */
+    B512_60::BIG dp[FFLEN_RSA4096 / 2]; /**< decrypting exponent mod (p-1)  */
+    B512_60::BIG dq[FFLEN_RSA4096 / 2]; /**< decrypting exponent mod (q-1)  */
+    B512_60::BIG c[FFLEN_RSA4096 / 2]; /**< 1/p mod q */
+} rsa_private_key;
+
+
+/** @brief RSA Private KEy from OpenSSL 
+ *
+    @param P Input prime number
+    @param Q Input prime number
+    @param DP Input 1/e mod p-1
+    @param DQ Input 1/e mod q-1
+    @param C Input 1/p mod q
+    @param PRIV the output RSA private key
+ */
+extern void RSA_PRIVATE_KEY_FROM_OPENSSL(octet *P,octet* Q,octet *DP,octet *DQ,octet *C,rsa_private_key *PRIV);
+
+/** @brief RSA Key Pair from OpenSSL 
+ *
+    @param e the encryption exponent
+    @param P Input prime number
+    @param Q Input prime number
+    @param DP Input 1/e mod p-1
+    @param DQ Input 1/e mod q-1
+    @param C Input 1/p mod q
+    @param PRIV the output RSA private key
+    @param PUB the output RSA public key
+ */
+extern void RSA_KEY_PAIR_FROM_OPENSSL(sign32 e,octet *P,octet* Q,octet *DP,octet *DQ,octet *C,rsa_private_key *PRIV,rsa_public_key *PUB);
+
+/** @brief RSA Key Pair Generator
+ *
+    @param R is a pointer to a cryptographically secure random number generator
+    @param e the encryption exponent
+    @param PRIV the output RSA private key
+    @param PUB the output RSA public key
+    @param P Input prime number. Used when R is equal to NULL for testing
+    @param Q Input prime number. Used when R is equal to NULL for testing
+ */
+extern void RSA_KEY_PAIR(csprng *R, sign32 e, rsa_private_key* PRIV, rsa_public_key* PUB, octet *P, octet* Q);
+
+/** @brief RSA encryption of suitably padded plaintext
+ *
+    @param PUB the input RSA public key
+    @param F is input padded message
+    @param G is the output ciphertext
+ */
+extern void RSA_ENCRYPT(rsa_public_key* PUB, octet *F, octet *G);
+/** @brief RSA decryption of ciphertext
+ *
+    @param PRIV the input RSA private key
+    @param G is the input ciphertext
+    @param F is output plaintext (requires unpadding)
+
+ */
+extern void RSA_DECRYPT(rsa_private_key* PRIV, octet *G, octet *F);
+/** @brief Destroy an RSA private Key
+ *
+    @param PRIV the input RSA private key. Destroyed on output.
+ */
+extern void RSA_PRIVATE_KEY_KILL(rsa_private_key *PRIV);
+/** @brief Populates an RSA public key from an octet string
+ *
+    Creates RSA public key from big-endian base 256 form.
+    @param x FF instance to be created from an octet string
+    @param S input octet string
+ */
+extern void RSA_fromOctet(B512_60::BIG *x, octet *S);
+}
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/share.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/share.cpp
new file mode 100644
index 0000000..103c7cc
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/share.cpp
@@ -0,0 +1,231 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* Shamir threshold secret sharing module */
+/* Split any octet into number of shares <256 */
+/* Specify number of shares required for recovery - nsr */
+
+/* See testmpin.cpp for an example of use */
+
+#include "arch.h"
+#include "core.h"
+
+using namespace core;
+/* Field GF(2^8) precalculated tables */
+
+static const uchar ptab[] =
+{
+    1, 3, 5, 15, 17, 51, 85, 255, 26, 46, 114, 150, 161, 248, 19, 53,
+    95, 225, 56, 72, 216, 115, 149, 164, 247, 2, 6, 10, 30, 34, 102, 170,
+    229, 52, 92, 228, 55, 89, 235, 38, 106, 190, 217, 112, 144, 171, 230, 49,
+    83, 245, 4, 12, 20, 60, 68, 204, 79, 209, 104, 184, 211, 110, 178, 205,
+    76, 212, 103, 169, 224, 59, 77, 215, 98, 166, 241, 8, 24, 40, 120, 136,
+    131, 158, 185, 208, 107, 189, 220, 127, 129, 152, 179, 206, 73, 219, 118, 154,
+    181, 196, 87, 249, 16, 48, 80, 240, 11, 29, 39, 105, 187, 214, 97, 163,
+    254, 25, 43, 125, 135, 146, 173, 236, 47, 113, 147, 174, 233, 32, 96, 160,
+    251, 22, 58, 78, 210, 109, 183, 194, 93, 231, 50, 86, 250, 21, 63, 65,
+    195, 94, 226, 61, 71, 201, 64, 192, 91, 237, 44, 116, 156, 191, 218, 117,
+    159, 186, 213, 100, 172, 239, 42, 126, 130, 157, 188, 223, 122, 142, 137, 128,
+    155, 182, 193, 88, 232, 35, 101, 175, 234, 37, 111, 177, 200, 67, 197, 84,
+    252, 31, 33, 99, 165, 244, 7, 9, 27, 45, 119, 153, 176, 203, 70, 202,
+    69, 207, 74, 222, 121, 139, 134, 145, 168, 227, 62, 66, 198, 81, 243, 14,
+    18, 54, 90, 238, 41, 123, 141, 140, 143, 138, 133, 148, 167, 242, 13, 23,
+    57, 75, 221, 124, 132, 151, 162, 253, 28, 36, 108, 180, 199, 82, 246, 1
+};
+
+static const uchar ltab[] =
+{
+    0, 255, 25, 1, 50, 2, 26, 198, 75, 199, 27, 104, 51, 238, 223, 3,
+    100, 4, 224, 14, 52, 141, 129, 239, 76, 113, 8, 200, 248, 105, 28, 193,
+    125, 194, 29, 181, 249, 185, 39, 106, 77, 228, 166, 114, 154, 201, 9, 120,
+    101, 47, 138, 5, 33, 15, 225, 36, 18, 240, 130, 69, 53, 147, 218, 142,
+    150, 143, 219, 189, 54, 208, 206, 148, 19, 92, 210, 241, 64, 70, 131, 56,
+    102, 221, 253, 48, 191, 6, 139, 98, 179, 37, 226, 152, 34, 136, 145, 16,
+    126, 110, 72, 195, 163, 182, 30, 66, 58, 107, 40, 84, 250, 133, 61, 186,
+    43, 121, 10, 21, 155, 159, 94, 202, 78, 212, 172, 229, 243, 115, 167, 87,
+    175, 88, 168, 80, 244, 234, 214, 116, 79, 174, 233, 213, 231, 230, 173, 232,
+    44, 215, 117, 122, 235, 22, 11, 245, 89, 203, 95, 176, 156, 169, 81, 160,
+    127, 12, 246, 111, 23, 196, 73, 236, 216, 67, 31, 45, 164, 118, 123, 183,
+    204, 187, 62, 90, 251, 96, 177, 134, 59, 82, 161, 108, 170, 85, 41, 157,
+    151, 178, 135, 144, 97, 190, 220, 252, 188, 149, 207, 205, 55, 63, 91, 209,
+    83, 57, 132, 60, 65, 162, 109, 71, 20, 42, 158, 93, 86, 242, 211, 171,
+    68, 17, 146, 217, 35, 32, 46, 137, 180, 124, 184, 38, 119, 153, 227, 165,
+    103, 74, 237, 222, 197, 49, 254, 24, 13, 99, 140, 128, 192, 247, 112, 7
+};
+
+/* field addition */
+static uchar add(uchar x,uchar y)
+{
+    return (x^y);
+}
+
+/* x.y= AntiLog(Log(x) + Log(y)) */
+static uchar mul(uchar x,uchar y)
+{ 
+    if (x && y) return ptab[(ltab[x]+ltab[y])%255];
+    else return 0;
+}
+
+/* multiplicative inverse */
+static uchar inv(uchar x)
+{
+    return ptab[255-ltab[x]];  
+}
+
+/* Lagrange interpolation */
+static int interpolate(int n, uchar x[], uchar y[])
+{
+    int i,j;
+    uchar p,yp=0;
+    for(i=0;i<n;i++)
+    {
+        p=1;
+        for (j=0;j<n;j++)
+            if (i!=j) p=mul(p,mul(x[j],inv(add(x[i],x[j]))));
+        yp=add(yp,mul(p,y[i]));
+    }
+    return yp;
+}
+
+/* return a share of M */
+/* input id - Unique share ID */
+/* input nsr - Number of shares required for recovery */
+/* output S - share as octet */
+/* input Message M to be shared */
+/* input Random seed R */
+/* return share structure */
+
+share core::getshare(int id,int nsr,octet *S,octet *M,octet *R)
+{
+    csprng rng;                // Crypto Strong RNG
+    share Sh;
+    int j,n,m;
+    uchar x;
+    if (id<1 || id>=256 || nsr<2 || nsr>=256)
+    {
+        Sh.id=0;
+        Sh.nsr=0;
+        Sh.B=NULL;
+        return Sh;
+    }
+    RAND_clean(&rng);
+    RAND_seed(&rng,R->len,R->val);
+    Sh.id=id;
+    Sh.nsr=nsr;
+    Sh.B=S;
+    m=M->len;
+    S->len=m;
+    for (j=0;j<m;j++)
+    {
+        x=(uchar)id;
+        S->val[j]=M->val[j];
+        for (n=1;n<nsr;n++ )
+        {
+            S->val[j]=add(S->val[j],mul(RAND_byte(&rng),x));
+            x=mul(x,(uchar)id);
+        }
+    }
+    return Sh;
+}
+
+/* Recover message from shares */
+
+int core::recover(octet *M,share S[])
+{
+    uchar x[256],y[256];
+    int i,j,res=0;
+    int len=S[0].B->len;
+    int nsr=S[0].nsr;
+    for (i=1;i<nsr;i++)
+    {
+        if (S[i].nsr!=nsr || S[i].B->len!=len)
+        {
+            res=-1;
+            break;
+        }
+    }
+    if (res) return res;
+
+    for (j=0;j<len;j++)
+    {
+        for (i=0;i<nsr;i++)
+        {
+            x[i]=S[i].id;
+            y[i]=S[i].B->val[j];
+        }
+        M->val[j]=interpolate(nsr,x,y);
+    }
+    M->len=len;
+    return res;
+}
+
+/*
+#include <stdio.h>
+#include <time.h>
+
+int main()
+{ // test driver 
+    int ii,j,k,l,m,n,nsr;
+    char mc[10],b1c[10],b2c[10],b3c[10],b4c[10],r[30];
+    octet M={0,sizeof(mc),mc};
+    octet B1={0,sizeof(b1c),b1c};
+    octet B2={0,sizeof(b2c),b2c};
+    octet B3={0,sizeof(b3c),b3c};
+    octet B4={0,sizeof(b4c),b4c};
+    octet R={0,sizeof(r),r};
+    share S[3];
+
+    nsr=3;
+
+    srand(time(NULL));
+
+    M.len=5;
+    M.val[0]=rand()%128; M.val[1]=rand()%128; M.val[2]=rand()%128; M.val[3]=rand()%128; M.val[4]=rand()%128;
+
+    printf("Message= "); OCT_output(&M);
+
+    R.len=(nsr-1)*M.len;
+    for (j=0;j<R.len;j++)
+        R.val[j]=rand()%256;
+
+// 3 out of 4
+    share S0=getshare(1,nsr,&B1,&M,&R);  // R is random number seed
+    share S1=getshare(2,nsr,&B2,&M,&R);
+    share S2=getshare(3,nsr,&B3,&M,&R);
+    share S3=getshare(4,nsr,&B4,&M,&R);
+
+    printf("Share 1= "); OCT_output(&B1);
+    printf("Share 2= "); OCT_output(&B2);
+    printf("Share 3= "); OCT_output(&B3);
+    printf("Share 4= "); OCT_output(&B4);
+
+    S[0]=S0;  // pick any 3 shares
+    S[1]=S1;
+    S[2]=S3;
+
+    OCT_clear(&M);
+
+    recover(&M,S);
+
+    printf("Message= "); OCT_output(&M);
+
+    return 0;
+}
+*/
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/testbls b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/testbls
new file mode 100644
index 0000000..4796b2d
Binary files /dev/null and b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/testbls differ
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/testbls.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/testbls.cpp
new file mode 100644
index 0000000..f9c5ac6
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/testbls.cpp
@@ -0,0 +1,322 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* Test driver and function exerciser for Boneh-Lynn-Shacham BLS Signature API Functions */
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include <time.h>
+#include "bls_BN254.h"
+
+#if CHUNK==32 || CHUNK==64
+#include "bls_BLS12383.h"
+#include "bls192_BLS24479.h"
+#include "bls256_BLS48556.h"
+#endif
+
+#include "randapi.h"
+
+/* To reverse the groups G1 and G2, edit BLS*.cpp
+
+Swap G1 <-> G2
+Swap ECP <-> ECPn
+Disable G2 precomputation
+Switch G1/G2 parameter order in pairing function calls
+
+#define REVERSE here
+
+See BLSREV*.cpp
+
+*/
+
+//#define REVERSE
+
+using namespace core;
+
+static char message[] = "This is a test message";
+
+int bls_BN254(csprng *RNG)
+{
+    using namespace BN254;
+
+    int i,res;
+    char s[BGS_BN254];
+    char ikm[64];
+#ifdef REVERSE
+    char w[BFS_BN254+1], sig[4 * BFS_BN254 + 1];        // w is 2* if not compressed else 1*. sig is 4* if not compressed, else 2*
+#else
+    char w[4 * BFS_BN254 + 1], sig[BFS_BN254 + 1];      // w is 4* if not compressed else 2*. sig is 2* if not compressed, else 1*
+#endif
+    octet S = {0, sizeof(s), s};
+    octet W = {0, sizeof(w), w};
+    octet SIG = {0, sizeof(sig), sig};
+    octet IKM = {0, sizeof(ikm), ikm};
+    octet M = {0,sizeof(message), message};
+
+    OCT_jstring(&M,message);
+
+    res = BLS_INIT();
+    if (res == BLS_FAIL)
+    {
+        printf("Failed to initialize\n");
+        return res;
+    }
+
+    OCT_rand(&IKM,RNG,32);
+    //IKM.len=32;
+    //for (i=0;i<IKM.len;i++)
+    //        IKM.val[i]=i+1;
+
+    res = BLS_KEY_PAIR_GENERATE(&IKM, &S, &W);
+    if (res == BLS_FAIL)
+    {
+        printf("Failed to generate keys\n");
+        return res;
+    }
+
+    printf("Private key= 0x");
+    OCT_output(&S);
+    printf("Public key= 0x");
+    OCT_output(&W);
+
+    BLS_CORE_SIGN(&SIG, &M, &S);
+    printf("Signature= 0x");
+    OCT_output(&SIG);
+
+    //message[7]='f'; // change the message
+
+    res = BLS_CORE_VERIFY(&SIG, &M, &W);
+    if (res == BLS_OK) printf("Signature is OK\n");
+    else printf("Signature is *NOT* OK\n");
+    return res;
+}
+
+#if CHUNK==32 || CHUNK==64
+
+int bls_BLS12383(csprng *RNG)
+{
+    using namespace BLS12383;
+
+    int i,res;
+    char s[BGS_BLS12383];
+    char ikm[64];
+#ifdef REVERSE
+    char w[BFS_BLS12383+1], sig[4 * BFS_BLS12383 + 1];
+#else
+    char w[4 * BFS_BLS12383 + 1], sig[BFS_BLS12383 + 1];
+#endif
+    octet S = {0, sizeof(s), s};
+    octet W = {0, sizeof(w), w};
+    octet SIG = {0, sizeof(sig), sig};
+    octet IKM = {0, sizeof(ikm), ikm};
+    octet M = {0,sizeof(message), message};
+
+    OCT_jstring(&M,message);
+
+    res = BLS_INIT();
+    if (res == BLS_FAIL)
+    {
+        printf("Failed to initialize\n");
+        return res;
+    }
+
+    OCT_rand(&IKM,RNG,32);
+    //IKM.len=32;
+    //for (i=0;i<IKM.len;i++)
+    //        IKM.val[i]=i+1;
+
+    res = BLS_KEY_PAIR_GENERATE(&IKM, &S, &W);
+    if (res == BLS_FAIL)
+    {
+        printf("Failed to generate keys\n");
+        return res;
+    }
+
+    printf("Private key= 0x");
+    OCT_output(&S);
+    printf("Public key= 0x");
+    OCT_output(&W);
+
+    BLS_CORE_SIGN(&SIG, &M, &S);
+    printf("Signature= 0x");
+    OCT_output(&SIG);
+
+    //message[7]='f'; // change the message
+
+    res = BLS_CORE_VERIFY(&SIG, &M, &W);
+    if (res == BLS_OK) printf("Signature is OK\n");
+    else printf("Signature is *NOT* OK\n");
+    return res;
+}
+
+int bls_BLS24479(csprng *RNG)
+{
+    using namespace BLS24479;
+
+    int i,res;
+    char s[BGS_BLS24479];
+    char ikm[64];
+#ifdef REVERSE
+    char w[BFS_BLS24479+1], sig[8 * BFS_BLS24479 + 1];
+#else
+    char w[8 * BFS_BLS24479 + 1], sig[BFS_BLS24479 + 1];
+#endif
+    octet S = {0, sizeof(s), s};
+    octet W = {0, sizeof(w), w};
+    octet SIG = {0, sizeof(sig), sig};
+    octet IKM = {0, sizeof(ikm), ikm};
+    octet M = {0,sizeof(message), message};
+
+    OCT_jstring(&M,message);
+
+    res = BLS_INIT();
+    if (res == BLS_FAIL)
+    {
+        printf("Failed to initialize\n");
+        return res;
+    }
+
+    OCT_rand(&IKM,RNG,48);
+    //IKM.len=48;
+    //for (i=0;i<IKM.len;i++)
+    //        IKM.val[i]=i+1;
+
+    res = BLS_KEY_PAIR_GENERATE(&IKM, &S, &W);
+    if (res == BLS_FAIL)
+    {
+        printf("Failed to generate keys\n");
+        return res;
+    }
+
+    printf("Private key= 0x");
+    OCT_output(&S);
+    printf("Public key= 0x");
+    OCT_output(&W);
+
+    BLS_CORE_SIGN(&SIG, &M, &S);
+    printf("Signature= 0x");
+    OCT_output(&SIG);
+
+    //message[7]='f'; // change the message
+
+    res = BLS_CORE_VERIFY(&SIG, &M, &W);
+    if (res == BLS_OK) printf("Signature is OK\n");
+    else printf("Signature is *NOT* OK\n");
+    return res;
+}
+
+int bls_BLS48556(csprng *RNG)
+{
+    using namespace BLS48556;
+
+    int i,res;
+    char s[BGS_BLS48556];
+    char ikm[64];
+#ifdef REVERSE
+    char w[BFS_BLS48556+1], sig[16 * BFS_BLS48556 + 1];
+#else
+    char w[16 * BFS_BLS48556 + 1], sig[BFS_BLS48556 + 1];
+#endif
+    octet S = {0, sizeof(s), s};
+    octet W = {0, sizeof(w), w};
+    octet SIG = {0, sizeof(sig), sig};
+    octet IKM = {0, sizeof(ikm), ikm};
+    octet M = {0,sizeof(message), message};
+
+    OCT_jstring(&M,message);
+
+    res = BLS_INIT();
+    if (res == BLS_FAIL)
+    {
+        printf("Failed to initialize\n");
+        return res;
+    }
+
+    OCT_rand(&IKM,RNG,64);
+    //IKM.len=64;
+    //for (i=0;i<IKM.len;i++)
+    //        IKM.val[i]=i+1;
+
+    res = BLS_KEY_PAIR_GENERATE(&IKM, &S, &W);
+    if (res == BLS_FAIL)
+    {
+        printf("Failed to generate keys\n");
+        return res;
+    }
+
+    printf("Private key= 0x");
+    OCT_output(&S);
+    printf("Public key= 0x");
+    OCT_output(&W);
+
+    BLS_CORE_SIGN(&SIG, &M, &S);
+    printf("Signature= 0x");
+    OCT_output(&SIG);
+
+    //message[7]='f'; // change the message
+
+    res = BLS_CORE_VERIFY(&SIG, &M, &W);
+    if (res == BLS_OK) printf("Signature is OK\n");
+    else printf("Signature is *NOT* OK\n");
+    return res;
+}
+
+#endif
+
+int main()
+{
+    int i, res;
+    unsigned long ran;
+
+    char raw[100];
+    octet RAW = {0, sizeof(raw), raw};
+    csprng RNG;                // Crypto Strong RNG
+
+    time((time_t *)&ran);
+
+    RAW.len = 100;              // fake random seed source
+    RAW.val[0] = ran;
+    RAW.val[1] = ran >> 8;
+    RAW.val[2] = ran >> 16;
+    RAW.val[3] = ran >> 24;
+    for (i = 4; i < 100; i++) RAW.val[i] = i;
+
+    CREATE_CSPRNG(&RNG, &RAW);  // initialise strong RNG
+
+    printf("%d bit build\n", CHUNK);
+
+    printf("\nTesting BLS signature for curve BN254\n");
+    bls_BN254(&RNG);
+
+#if CHUNK!=16
+    printf("\nTesting BLS signature for curve BLS12383\n");
+    bls_BLS12383(&RNG);
+
+    printf("\nTesting BLS signature for curve BLS24479\n");
+    bls_BLS24479(&RNG);
+
+    printf("\nTesting BLS signature for curve BLS48556\n");
+    bls_BLS48556(&RNG);
+#endif
+
+    KILL_CSPRNG(&RNG);
+}
+
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/testdlthm b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/testdlthm
new file mode 100644
index 0000000..a50d538
Binary files /dev/null and b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/testdlthm differ
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/testdlthm.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/testdlthm.cpp
new file mode 100644
index 0000000..f7326a0
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/testdlthm.cpp
@@ -0,0 +1,93 @@
+/*
+ * Copyright (c) 2012-2021 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* test driver and function exerciser for Dilithium functions */
+
+// See https://eprint.iacr.org/2017/633 (Ducas, Lepoint, Lyubashevsky, Schwabe, Seiler, Stehle)
+
+/* g++ -O2 testdlthm.cpp core.a -o testdlthm */
+
+#include <stdio.h>
+#include <time.h>
+#include "dilithium.h"
+
+using namespace core;
+
+#define LOOPS 100
+
+int main() {
+    int i,j,attempts;
+    unsigned long ran;
+    bool result;
+    char raw[100];
+    byte tau[32];
+    csprng RNG;
+    char sk[DL_SK_SIZE_3], pk[DL_PK_SIZE_3], sig[DL_SIG_SIZE_3],m[128];
+    octet SK = {0, sizeof(sk), sk};
+    octet PK = {0, sizeof(pk), pk};
+    octet SIG = {0, sizeof(sig), sig};
+    octet M = {0, sizeof(m), m};
+
+    time((time_t *)&ran);
+
+    raw[0] = ran;
+    raw[1] = ran >> 8;
+    raw[2] = ran >> 16;
+    raw[3] = ran >> 24;
+
+    for (i = 0; i < 100; i++) raw[i] = i + 1; // change to i = 4 to randomize
+    RAND_seed(&RNG, 100, raw);
+
+    printf("Testing Dilithium signature\n");
+    int tats=0;
+    for (i=0;i<LOOPS;i++) {
+
+        OCT_clear(&M);
+        OCT_jstring(&M,(char *)"Hello World");
+
+        for (j=0;j<32;j++)
+            tau[j]=RAND_byte(&RNG);
+
+        DLTHM_keypair_3(tau,&SK,&PK);
+
+        printf("private key %d bits\n",8*SK.len);
+        printf("public key %d bits\n",8*PK.len);
+
+        //OCT_output(&SK); printf("\n");
+        //OCT_output(&PK); printf("\n");
+
+        attempts=DLTHM_signature_3(&SK,&M,&SIG);
+
+        tats+=attempts;
+
+        printf("Signature %d bits created on attempt %d\n",8*SIG.len,attempts);
+
+        result=DLTHM_verify_3(&PK,&M,&SIG);
+        if (result) {
+            printf("Signature is verified\n");
+        } else {
+            printf("Signature is NOT verified\n"); 
+            break;
+        }
+    }
+    if (LOOPS>1)
+        printf("Average= %d\n",tats/LOOPS);
+    return 0;
+} 
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/testecc b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/testecc
new file mode 100644
index 0000000..3fbf9e6
Binary files /dev/null and b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/testecc differ
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/testecc.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/testecc.cpp
new file mode 100644
index 0000000..e3a61c3
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/testecc.cpp
@@ -0,0 +1,623 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* test driver and function exerciser for ECDH/ECIES/ECDSA API Functions */
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include <time.h>
+#include "ecdh_Ed25519.h"
+#include "rsa_RSA2048.h"
+#include "randapi.h"
+
+#if CHUNK==32 || CHUNK==64
+#include "ecdh_NIST256.h"
+#include "ecdh_Ed448.h"
+#endif
+
+using namespace core;
+
+int ecdh_Ed25519(csprng *RNG)
+{
+    using namespace Ed25519;
+
+    int i, res;
+    unsigned long ran;
+    char *pp = (char *)"M0ng00se";
+    // These octets are automatically protected against buffer overflow attacks
+    // Note salt must be big enough to include an appended word
+    // Note ECIES ciphertext C must be big enough to include at least 1 appended block
+    // Recall EFS_Ed25519 is field size in bytes. So EFS_Ed25519=32 for 256-bit curve
+    char s0[2 * EGS_Ed25519], s1[EGS_Ed25519], w0[2 * EFS_Ed25519 + 1], w1[2 * EFS_Ed25519 + 1], z0[EFS_Ed25519], z1[EFS_Ed25519], key[AESKEY_Ed25519], salt[40], pw[40];
+    octet S0 = {0, sizeof(s0), s0};
+    octet S1 = {0, sizeof(s1), s1};
+    octet W0 = {0, sizeof(w0), w0};
+    octet W1 = {0, sizeof(w1), w1};
+    octet Z0 = {0, sizeof(z0), z0};
+    octet Z1 = {0, sizeof(z1), z1};
+    octet KEY = {0, sizeof(key), key};
+    octet SALT = {0, sizeof(salt), salt};
+    octet PW = {0, sizeof(pw), pw};
+
+    SALT.len = 8;
+    for (i = 0; i < 8; i++) SALT.val[i] = i + 1; // set Salt
+
+    printf("Alice's Passphrase= %s\n", pp);
+
+    OCT_empty(&PW);
+    OCT_jstring(&PW, pp);  // set Password from string
+
+    // private key S0 of size EGS_Ed25519 bytes derived from Password and Salt
+
+    PBKDF2(MC_SHA2,HASH_TYPE_Ed25519, &S0, EGS_Ed25519, &PW, &SALT, 1000);
+
+    printf("Alices private key= 0x");
+    OCT_output(&S0);
+
+    // Generate Key pair S/W
+
+    ECP_KEY_PAIR_GENERATE(NULL, &S0, &W0);
+    printf("Alices public key= 0x");
+    OCT_output(&W0);
+
+    res = ECP_PUBLIC_KEY_VALIDATE(&W0);
+    if (res != 0)
+    {
+        printf("ECP Public Key is invalid!\n");
+        return 0;
+    }
+
+    // Random private key for other party
+    ECP_KEY_PAIR_GENERATE(RNG, &S1, &W1);
+    res = ECP_PUBLIC_KEY_VALIDATE(&W1);
+    if (res != 0)
+    {
+        printf("ECP Public Key is invalid!\n");
+        return 0;
+    }
+    printf("Servers private key= 0x");
+    OCT_output(&S1);
+    printf("Servers public key= 0x");
+    OCT_output(&W1);
+
+    // Calculate common key using DH - IEEE 1363 method
+
+    ECP_SVDP_DH(&S0, &W1, &Z0, 0);
+    ECP_SVDP_DH(&S1, &W0, &Z1, 0);
+
+    if (!OCT_comp(&Z0, &Z1))
+    {
+        printf("*** ECPSVDP-DH Failed\n");
+        return 0;
+    }
+
+    KDF2(MC_SHA2, HASH_TYPE_Ed25519, &KEY, AESKEY_Ed25519, &Z0, NULL);
+
+    printf("Alice's DH Key=  0x");
+    OCT_output(&KEY);
+    printf("Servers DH Key=  0x");
+    OCT_output(&KEY);
+
+#if CURVETYPE_Ed25519 != MONTGOMERY
+
+    char ds[EGS_Ed25519], p1[30], p2[30], v[2 * EFS_Ed25519 + 1], m[32], c[64], t[32], cs[EGS_Ed25519];
+    octet DS = {0, sizeof(ds), ds};
+    octet CS = {0, sizeof(cs), cs};
+    octet P1 = {0, sizeof(p1), p1};
+    octet P2 = {0, sizeof(p2), p2};
+    octet V = {0, sizeof(v), v};
+    octet M = {0, sizeof(m), m};
+    octet C = {0, sizeof(c), c};
+    octet T = {0, sizeof(t), t};
+
+    printf("Testing ECIES\n");
+
+    P1.len = 3;
+    P1.val[0] = 0x0;
+    P1.val[1] = 0x1;
+    P1.val[2] = 0x2;
+    P2.len = 4;
+    P2.val[0] = 0x0;
+    P2.val[1] = 0x1;
+    P2.val[2] = 0x2;
+    P2.val[3] = 0x3;
+
+    M.len = 17;
+    for (i = 0; i <= 16; i++) M.val[i] = i;
+
+    ECP_ECIES_ENCRYPT(HASH_TYPE_Ed25519, &P1, &P2, RNG, &W1, &M, 12, &V, &C, &T);
+
+    printf("Ciphertext= \n");
+    printf("V= 0x");
+    OCT_output(&V);
+    printf("C= 0x");
+    OCT_output(&C);
+    printf("T= 0x");
+    OCT_output(&T);
+
+    if (!ECP_ECIES_DECRYPT(HASH_TYPE_Ed25519, &P1, &P2, &V, &C, &T, &S1, &M))
+    {
+        printf("*** ECIES Decryption Failed\n");
+        return 0;
+    }
+    else printf("Decryption succeeded\n");
+
+    printf("Message is 0x");
+    OCT_output(&M);
+
+
+    printf("Testing ECDSA\n");
+
+    if (ECP_SP_DSA(HASH_TYPE_Ed25519, RNG, NULL, &S0, &M, &CS, &DS) != 0)
+    {
+        printf("***ECDSA Signature Failed\n");
+        return 0;
+    }
+
+    printf("Signature C = 0x");
+    OCT_output(&CS);
+    printf("Signature D = 0x");
+    OCT_output(&DS);
+
+    if (ECP_VP_DSA(HASH_TYPE_Ed25519, &W0, &M, &CS, &DS) != 0)
+    {
+        printf("***ECDSA Verification Failed\n");
+        return 0;
+    }
+    else
+    {
+        printf("ECDSA Signature/Verification succeeded\n");
+    }
+
+#endif
+
+    return 1;
+}
+
+#if CHUNK==32 || CHUNK==64
+int ecdh_NIST256(csprng *RNG)
+{
+    using namespace NIST256;
+
+    int i, res;
+    unsigned long ran;
+    char *pp = (char *)"M0ng00se";
+    // These octets are automatically protected against buffer overflow attacks
+    // Note salt must be big enough to include an appended word
+    // Note ECIES ciphertext C must be big enough to include at least 1 appended block
+    // Recall EFS_NIST256 is field size in bytes. So EFS_NIST256=32 for 256-bit curve
+    char s0[2 * EGS_NIST256], s1[EGS_NIST256], w0[2 * EFS_NIST256 + 1], w1[2 * EFS_NIST256 + 1], z0[EFS_NIST256], z1[EFS_NIST256], key[AESKEY_NIST256], salt[40], pw[40];
+    octet S0 = {0, sizeof(s0), s0};
+    octet S1 = {0, sizeof(s1), s1};
+    octet W0 = {0, sizeof(w0), w0};
+    octet W1 = {0, sizeof(w1), w1};
+    octet Z0 = {0, sizeof(z0), z0};
+    octet Z1 = {0, sizeof(z1), z1};
+    octet KEY = {0, sizeof(key), key};
+    octet SALT = {0, sizeof(salt), salt};
+    octet PW = {0, sizeof(pw), pw};
+
+    SALT.len = 8;
+    for (i = 0; i < 8; i++) SALT.val[i] = i + 1; // set Salt
+
+    printf("Alice's Passphrase= %s\n", pp);
+
+    OCT_empty(&PW);
+    OCT_jstring(&PW, pp);  // set Password from string
+
+    // private key S0 of size EGS_NIST256 bytes derived from Password and Salt
+
+    PBKDF2(MC_SHA2, HASH_TYPE_NIST256, &S0, EGS_NIST256, &PW, &SALT, 1000);
+
+    printf("Alices private key= 0x");
+    OCT_output(&S0);
+
+    // Generate Key pair S/W
+
+    ECP_KEY_PAIR_GENERATE(NULL, &S0, &W0);
+    printf("Alices public key= 0x");
+    OCT_output(&W0);
+
+    res = ECP_PUBLIC_KEY_VALIDATE(&W0);
+    if (res != 0)
+    {
+        printf("ECP Public Key is invalid!\n");
+        return 0;
+    }
+
+    // Random private key for other party
+    ECP_KEY_PAIR_GENERATE(RNG, &S1, &W1);
+    res = ECP_PUBLIC_KEY_VALIDATE(&W1);
+    if (res != 0)
+    {
+        printf("ECP Public Key is invalid!\n");
+        return 0;
+    }
+    printf("Servers private key= 0x");
+    OCT_output(&S1);
+    printf("Servers public key= 0x");
+    OCT_output(&W1);
+
+    // Calculate common key using DH - IEEE 1363 method
+
+    ECP_SVDP_DH(&S0, &W1, &Z0, 0);
+    ECP_SVDP_DH(&S1, &W0, &Z1, 0);
+
+    if (!OCT_comp(&Z0, &Z1))
+    {
+        printf("*** ECPSVDP-DH Failed\n");
+        return 0;
+    }
+
+    KDF2(MC_SHA2, HASH_TYPE_NIST256, &KEY, AESKEY_NIST256, &Z0, NULL);
+
+    printf("Alice's DH Key=  0x");
+    OCT_output(&KEY);
+    printf("Servers DH Key=  0x");
+    OCT_output(&KEY);
+
+#if CURVETYPE_NIST256 != MONTGOMERY
+
+    char ds[EGS_NIST256], p1[30], p2[30], v[2 * EFS_NIST256 + 1], m[32], c[64], t[32], cs[EGS_NIST256];
+    octet DS = {0, sizeof(ds), ds};
+    octet CS = {0, sizeof(cs), cs};
+    octet P1 = {0, sizeof(p1), p1};
+    octet P2 = {0, sizeof(p2), p2};
+    octet V = {0, sizeof(v), v};
+    octet M = {0, sizeof(m), m};
+    octet C = {0, sizeof(c), c};
+    octet T = {0, sizeof(t), t};
+
+    printf("Testing ECIES\n");
+
+    P1.len = 3;
+    P1.val[0] = 0x0;
+    P1.val[1] = 0x1;
+    P1.val[2] = 0x2;
+    P2.len = 4;
+    P2.val[0] = 0x0;
+    P2.val[1] = 0x1;
+    P2.val[2] = 0x2;
+    P2.val[3] = 0x3;
+
+    M.len = 17;
+    for (i = 0; i <= 16; i++) M.val[i] = i;
+
+    ECP_ECIES_ENCRYPT(HASH_TYPE_NIST256, &P1, &P2, RNG, &W1, &M, 12, &V, &C, &T);
+
+    printf("Ciphertext= \n");
+    printf("V= 0x");
+    OCT_output(&V);
+    printf("C= 0x");
+    OCT_output(&C);
+    printf("T= 0x");
+    OCT_output(&T);
+
+    if (!ECP_ECIES_DECRYPT(HASH_TYPE_NIST256, &P1, &P2, &V, &C, &T, &S1, &M))
+    {
+        printf("*** ECIES Decryption Failed\n");
+        return 0;
+    }
+    else printf("Decryption succeeded\n");
+
+    printf("Message is 0x");
+    OCT_output(&M);
+
+
+    printf("Testing ECDSA\n");
+
+    if (ECP_SP_DSA(HASH_TYPE_NIST256, RNG, NULL, &S0, &M, &CS, &DS) != 0)
+    {
+        printf("***ECDSA Signature Failed\n");
+        return 0;
+    }
+
+    printf("Signature C = 0x");
+    OCT_output(&CS);
+    printf("Signature D = 0x");
+    OCT_output(&DS);
+
+    if (ECP_VP_DSA(HASH_TYPE_NIST256, &W0, &M, &CS, &DS) != 0)
+    {
+        printf("***ECDSA Verification Failed\n");
+        return 0;
+    }
+    else
+    {
+        printf("ECDSA Signature/Verification succeeded\n");
+    }
+
+#endif
+
+    return 1;
+}
+
+int ecdh_Ed448(csprng *RNG)
+{
+    using namespace Ed448;
+
+    int i, res;
+    unsigned long ran;
+    char *pp = (char *)"M0ng00se";
+    // These octets are automatically protected against buffer overflow attacks
+    // Note salt must be big enough to include an appended word
+    // Note ECIES ciphertext C must be big enough to include at least 1 appended block
+    // Recall EFS_Ed448 is field size in bytes. So EFS_Ed448=32 for 256-bit curve
+    char s0[2 * EGS_Ed448], s1[EGS_Ed448], w0[2 * EFS_Ed448 + 1], w1[2 * EFS_Ed448 + 1], z0[EFS_Ed448], z1[EFS_Ed448], key[AESKEY_Ed448], salt[40], pw[40];
+    octet S0 = {0, sizeof(s0), s0};
+    octet S1 = {0, sizeof(s1), s1};
+    octet W0 = {0, sizeof(w0), w0};
+    octet W1 = {0, sizeof(w1), w1};
+    octet Z0 = {0, sizeof(z0), z0};
+    octet Z1 = {0, sizeof(z1), z1};
+    octet KEY = {0, sizeof(key), key};
+    octet SALT = {0, sizeof(salt), salt};
+    octet PW = {0, sizeof(pw), pw};
+
+    SALT.len = 8;
+    for (i = 0; i < 8; i++) SALT.val[i] = i + 1; // set Salt
+
+    printf("Alice's Passphrase= %s\n", pp);
+
+    OCT_empty(&PW);
+    OCT_jstring(&PW, pp);  // set Password from string
+
+    // private key S0 of size EGS_Ed448 bytes derived from Password and Salt
+
+    PBKDF2(MC_SHA2, HASH_TYPE_Ed448, &S0, EGS_Ed448, &PW, &SALT, 1000);
+
+    printf("Alices private key= 0x");
+    OCT_output(&S0);
+
+    // Generate Key pair S/W
+
+    ECP_KEY_PAIR_GENERATE(NULL, &S0, &W0);
+    printf("Alices public key= 0x");
+    OCT_output(&W0);
+
+    res = ECP_PUBLIC_KEY_VALIDATE(&W0);
+    if (res != 0)
+    {
+        printf("ECP Public Key is invalid!\n");
+        return 0;
+    }
+
+    // Random private key for other party
+    ECP_KEY_PAIR_GENERATE(RNG, &S1, &W1);
+    res = ECP_PUBLIC_KEY_VALIDATE(&W1);
+    if (res != 0)
+    {
+        printf("ECP Public Key is invalid!\n");
+        return 0;
+    }
+    printf("Servers private key= 0x");
+    OCT_output(&S1);
+    printf("Servers public key= 0x");
+    OCT_output(&W1);
+
+    // Calculate common key using DH - IEEE 1363 method
+
+    ECP_SVDP_DH(&S0, &W1, &Z0, 0);
+    ECP_SVDP_DH(&S1, &W0, &Z1, 0);
+
+    if (!OCT_comp(&Z0, &Z1))
+    {
+        printf("*** ECPSVDP-DH Failed\n");
+        return 0;
+    }
+
+    KDF2(MC_SHA2, HASH_TYPE_Ed448, &KEY, AESKEY_Ed448, &Z0, NULL);
+
+    printf("Alice's DH Key=  0x");
+    OCT_output(&KEY);
+    printf("Servers DH Key=  0x");
+    OCT_output(&KEY);
+
+#if CURVETYPE_Ed448 != MONTGOMERY
+
+    char ds[EGS_Ed448], p1[30], p2[30], v[2 * EFS_Ed448 + 1], m[32], c[64], t[32], cs[EGS_Ed448];
+    octet DS = {0, sizeof(ds), ds};
+    octet CS = {0, sizeof(cs), cs};
+    octet P1 = {0, sizeof(p1), p1};
+    octet P2 = {0, sizeof(p2), p2};
+    octet V = {0, sizeof(v), v};
+    octet M = {0, sizeof(m), m};
+    octet C = {0, sizeof(c), c};
+    octet T = {0, sizeof(t), t};
+
+    printf("Testing ECIES\n");
+
+    P1.len = 3;
+    P1.val[0] = 0x0;
+    P1.val[1] = 0x1;
+    P1.val[2] = 0x2;
+    P2.len = 4;
+    P2.val[0] = 0x0;
+    P2.val[1] = 0x1;
+    P2.val[2] = 0x2;
+    P2.val[3] = 0x3;
+
+    M.len = 17;
+    for (i = 0; i <= 16; i++) M.val[i] = i;
+
+    ECP_ECIES_ENCRYPT(HASH_TYPE_Ed448, &P1, &P2, RNG, &W1, &M, 12, &V, &C, &T);
+
+    printf("Ciphertext= \n");
+    printf("V= 0x");
+    OCT_output(&V);
+    printf("C= 0x");
+    OCT_output(&C);
+    printf("T= 0x");
+    OCT_output(&T);
+
+    if (!ECP_ECIES_DECRYPT(HASH_TYPE_Ed448, &P1, &P2, &V, &C, &T, &S1, &M))
+    {
+        printf("*** ECIES Decryption Failed\n");
+        return 0;
+    }
+    else printf("Decryption succeeded\n");
+
+    printf("Message is 0x");
+    OCT_output(&M);
+
+
+    printf("Testing ECDSA\n");
+
+    if (ECP_SP_DSA(HASH_TYPE_Ed448, RNG, NULL, &S0, &M, &CS, &DS) != 0)
+    {
+        printf("***ECDSA Signature Failed\n");
+        return 0;
+    }
+
+    printf("Signature C = 0x");
+    OCT_output(&CS);
+    printf("Signature D = 0x");
+    OCT_output(&DS);
+
+    if (ECP_VP_DSA(HASH_TYPE_Ed448, &W0, &M, &CS, &DS) != 0)
+    {
+        printf("***ECDSA Verification Failed\n");
+        return 0;
+    }
+    else
+    {
+        printf("ECDSA Signature/Verification succeeded\n");
+    }
+
+#endif
+
+    return 1;
+}
+#endif
+
+int rsa_2048(csprng *RNG)
+{
+    using namespace RSA2048;
+
+    int i,valid;
+    unsigned long ran;
+    char m[RFS_RSA2048], ml[RFS_RSA2048], c[RFS_RSA2048], e[RFS_RSA2048], s[RFS_RSA2048];
+    rsa_public_key pub;
+    rsa_private_key priv;
+
+    octet M = {0, sizeof(m), m};
+    octet ML = {0, sizeof(ml), ml};
+    octet C = {0, sizeof(c), c};
+    octet E = {0, sizeof(e), e};
+    octet S = {0, sizeof(s), s};
+
+    printf("Generating public/private key pair\n");
+    RSA_KEY_PAIR(RNG, 65537, &priv, &pub, NULL, NULL);
+
+    printf("Encrypting test string\n");
+    OCT_jstring(&M, (char *)"Hello World\n");
+
+    OAEP_ENCODE(HASH_TYPE_RSA_RSA2048, &M, RNG, NULL, &E); // OAEP encode message m to e
+
+    RSA_ENCRYPT(&pub, &E, &C);   // encrypt encoded message
+    printf("Ciphertext= ");
+    OCT_output(&C);
+
+    printf("Decrypting test string\n");
+    RSA_DECRYPT(&priv, &C, &ML); // ... and then decrypt it
+    printf("Decrypted\n");
+    OAEP_DECODE(HASH_TYPE_RSA_RSA2048, NULL, &ML);  // decode it
+    printf("Decoded\n");
+    OCT_output_string(&ML);
+
+
+    PSS_ENCODE(HASH_TYPE_RSA_RSA2048, &M, RNG, &C);
+    //printf("T= 0x");OCT_output(&C);
+    if (PSS_VERIFY(HASH_TYPE_RSA_RSA2048, &M, &C))
+        printf("PSS encoding OK\n");
+    else
+        printf("PSS Encoding FAILED\n");
+
+
+// Signature
+    printf("Signing message\n");
+    PKCS15(HASH_TYPE_RSA_RSA2048, &M, &C);
+
+    RSA_DECRYPT(&priv, &C, &S); // create signature in S
+
+    printf("Signature= ");
+    OCT_output(&S);
+
+
+
+// Verification
+    valid=0;
+    RSA_ENCRYPT(&pub, &S, &ML);
+    PKCS15(HASH_TYPE_RSA_RSA2048, &M, &C);
+
+    if (OCT_comp(&C, &ML)) valid=1;
+    else {
+        PKCS15b(HASH_TYPE_RSA_RSA2048, &M, &C);
+        if (OCT_comp(&C, &ML)) valid=1;
+    }
+
+    if (valid) printf("Signature is valid\n");
+    else printf("Signature is INVALID\n");
+
+    RSA_PRIVATE_KEY_KILL(&priv);
+
+    OCT_clear(&M);
+    OCT_clear(&ML);   // clean up afterwards
+    OCT_clear(&C);
+    OCT_clear(&E);
+
+    return 1;
+}
+
+
+int main()
+{
+    int i, res;
+    unsigned long ran;
+
+    char raw[100];
+    octet RAW = {0, sizeof(raw), raw};
+    csprng RNG;                // Crypto Strong RNG
+
+    time((time_t *)&ran);
+
+    RAW.len = 100;              // fake random seed source
+    RAW.val[0] = ran;
+    RAW.val[1] = ran >> 8;
+    RAW.val[2] = ran >> 16;
+    RAW.val[3] = ran >> 24;
+    for (i = 0; i < 100; i++) RAW.val[i] = i;
+
+    CREATE_CSPRNG(&RNG, &RAW);  // initialise strong RNG
+
+    printf("\nTesting ECDH protocols for curve Ed25519\n");
+    ecdh_Ed25519(&RNG);
+#if CHUNK!=16
+    printf("\nTesting ECDH protocols for curve NIST256\n");
+    ecdh_NIST256(&RNG);
+    printf("\nTesting ECDH protocols for curve Ed448\n");
+    ecdh_Ed448(&RNG);
+#endif
+    printf("\nTesting RSA protocols for 2048-bit RSA\n");
+    rsa_2048(&RNG);
+
+    KILL_CSPRNG(&RNG);
+}
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/testeddsa b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/testeddsa
new file mode 100644
index 0000000..1e577d1
Binary files /dev/null and b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/testeddsa differ
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/testeddsa.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/testeddsa.cpp
new file mode 100644
index 0000000..bd43d86
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/testeddsa.cpp
@@ -0,0 +1,191 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* test driver and function exerciser for EDDSA API Functions */
+
+// Test Vectors from RFC8032
+
+// Observe that NIST standard does not support Ed25519ctx
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include <time.h>
+#include "randapi.h"
+#include "eddsa_Ed25519.h"
+#include "eddsa_Ed448.h"
+
+
+using namespace core;
+
+// prehash message
+static void PH_Ed25519(octet *M,octet *HM) {
+    hash512 sh512;
+    HASH512_init(&sh512);
+    for (int i=0;i<M->len;i++ )
+        HASH512_process(&sh512,M->val[i]);
+    HASH512_hash(&sh512,HM->val);
+    HM->len=64;
+}
+
+static void PH_Ed448(octet *M,octet *HM) {
+    sha3 SHA3;
+    SHA3_init(&SHA3,SHAKE256);
+    for (int i=0;i<M->len;i++) 
+        SHA3_process(&SHA3,M->val[i]);
+    SHA3_shake(&SHA3,HM->val,64); 
+    HM->len=64;
+}
+
+int eddsa_Ed25519(csprng *RNG)
+{
+    using namespace Ed25519;
+
+    char d[EGS_Ed25519], q[EFS_Ed25519], m[256], sig[2*EFS_Ed25519], hm[64];
+    octet D = {0, sizeof(d), d};
+    octet Q = {0, sizeof(q), q};
+    octet M = {0, sizeof(m), m};
+    octet SIG = {0, sizeof(sig), sig};
+    octet HM={0,sizeof(hm),hm};
+    bool prehash=false;
+    bool verify;
+
+// 32 bytes
+//    OCT_fromHex(&D,(char *)"9d61b19deffd5a60ba844af492ec2cc44449c5697b326919703bac031cae7f60");
+    OCT_fromHex(&D,(char *)"c5aa8df43f9f837bedb7442f31dcb7b166d38535076f094b85ce3a2e0b4458f7");
+//    OCT_fromHex(&D,(char *)"833fe62409237b9d62ec77587520911e9a759cec1d19755b7da901b96dca3d42");
+
+    EDDSA_KEY_PAIR_GENERATE(NULL, &D, &Q);
+    printf("Secret key= 0x");
+    OCT_output(&D);
+    printf("Public key= 0x");
+    OCT_output(&Q);
+    printf("\n");
+
+    M.len=2; M.val[0]=0xaf; M.val[1]=0x82;
+//    M.len=3; M.val[0]=0x61; M.val[1]=0x62;  M.val[2]=0x63;
+
+    if (prehash) {
+        PH_Ed25519(&M,&HM);
+        EDDSA_SIGNATURE(true,&D, NULL,&HM, &SIG);
+    } else {
+        EDDSA_SIGNATURE(false,&D, NULL,&M, &SIG);
+    }
+    printf("Signature= 0x");
+    OCT_output(&SIG);
+
+
+    if (prehash) {
+        PH_Ed25519(&M,&HM);
+        verify=EDDSA_VERIFY(true,&Q, NULL ,&HM, &SIG);
+    } else {
+        verify=EDDSA_VERIFY(false,&Q, NULL ,&M, &SIG);
+    }
+    if (verify)
+        printf("Signature is verified\n");
+    else
+        printf("Signature is NOT verified\n");
+
+    return 1;
+}
+
+int eddsa_Ed448(csprng *RNG)
+{
+    using namespace Ed448;
+
+    char d[EGS_Ed448+1],  q[EFS_Ed448 + 1], m[256], sig[2*EFS_Ed448+2], ctx[256], hm[64];
+    octet D = {0, sizeof(d), d};
+    octet Q = {0, sizeof(q), q};
+    octet M = {0, sizeof(m), m};
+    octet SIG = {0, sizeof(sig), sig};
+    octet CTX = {0, sizeof(ctx), ctx};
+    octet HM={0,sizeof(hm),hm};
+    bool prehash=false;
+    bool verify;
+
+// 57 bytes
+//    OCT_fromHex(&D,(char *)"6c82a562cb808d10d632be89c8513ebf6c929f34ddfa8c9f63c9960ef6e348a3528c8a3fcc2f044e39a3fc5b94492f8f032e7549a20098f95b");
+    OCT_fromHex(&D,(char *)"c4eab05d357007c632f3dbb48489924d552b08fe0c353a0d4a1f00acda2c463afbea67c5e8d2877c5e3bc397a659949ef8021e954e0a12274e");
+//    OCT_fromHex(&D,(char *)"833fe62409237b9d62ec77587520911e9a759cec1d19755b7da901b96dca3d42ef7822e0d5104127dc05d6dbefde69e3ab2cec7c867c6e2c49");
+
+
+    EDDSA_KEY_PAIR_GENERATE(NULL, &D, &Q);
+    printf("Secret key= 0x");
+    OCT_output(&D);
+    printf("Public key= 0x");
+    OCT_output(&Q);
+    printf("\n"); 
+
+    M.len=1; M.val[0]=0x03; 
+//    M.len=3; M.val[0]=0x61; M.val[1]=0x62;  M.val[2]=0x63;
+    CTX.len=3; CTX.val[0]=0x66; CTX.val[1]=0x6F; CTX.val[2]=0x6f;
+
+
+    if (prehash) {
+        PH_Ed448(&M,&HM);
+        EDDSA_SIGNATURE(true,&D, NULL,&HM, &SIG);
+    } else {
+        EDDSA_SIGNATURE(false,&D, NULL,&M, &SIG);
+    }
+
+    printf("Signature= 0x");
+    OCT_output(&SIG);
+
+    if (prehash) {
+        PH_Ed448(&M,&HM);
+        verify=EDDSA_VERIFY(true,&Q, NULL ,&HM, &SIG);
+    } else {
+        verify=EDDSA_VERIFY(false,&Q, NULL ,&M, &SIG);
+    }
+    if (verify)
+        printf("Signature is verified\n");
+    else
+        printf("Signature is NOT verified\n");
+
+    return 1;
+}
+
+int main()
+{
+    int i, res;
+    unsigned long ran;
+
+    char raw[100];
+    octet RAW = {0, sizeof(raw), raw};
+    csprng RNG;                // Crypto Strong RNG
+
+    time((time_t *)&ran);
+
+    RAW.len = 100;              // fake random seed source
+    RAW.val[0] = ran;
+    RAW.val[1] = ran >> 8;
+    RAW.val[2] = ran >> 16;
+    RAW.val[3] = ran >> 24;
+    for (i = 4; i < 100; i++) RAW.val[i] = i;
+
+    CREATE_CSPRNG(&RNG, &RAW);  // initialise strong RNG
+
+    printf("\nTesting EDDSA protocols for curve Ed25519\n");
+    eddsa_Ed25519(&RNG);
+    printf("\nTesting EDDSA protocols for curve Ed448\n");
+    eddsa_Ed448(&RNG);
+
+    KILL_CSPRNG(&RNG);
+}
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/testhpke.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/testhpke.cpp
new file mode 100644
index 0000000..e761e3a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/testhpke.cpp
@@ -0,0 +1,590 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* test driver and function exerciser for HPKE API Functions */
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include <time.h>
+#include "hpke_C25519.h"
+#include "hpke_NIST521.h"
+#include "hpke_NIST256.h"
+
+using namespace core;
+
+int hpke_C25519()
+{
+    using namespace C25519;
+
+    int res=0;
+    int config_id=0x520; // 01|01|00100000 = 1, 1, 32
+    int i,mode;
+    char info[32];
+
+    char seede[EGS_C25519];
+    char seedr[EGS_C25519];
+    char seeds[EGS_C25519];
+    octet seedE = {0, sizeof(seede), seede};
+    octet seedR = {0, sizeof(seedr), seedr};
+    octet seedS = {0, sizeof(seeds), seeds};
+
+    char skr[EGS_C25519];
+    char sks[EGS_C25519];
+    char ske[EGS_C25519];
+    char psks[32];
+    char pskid[32];
+    char pkr[EFS_C25519];
+    char pks[EFS_C25519];
+    char pke[EFS_C25519];
+    char z[72];
+    char plain[80];
+    char cipher[80];
+    char aad[32];
+    char tag[32];
+    char exporter_secret[128];
+    
+    octet INFO = {0, sizeof(info), info};
+    octet skR = {0, sizeof(skr), skr};
+    octet skS = {0, sizeof(sks), sks};
+    octet skE = {0, sizeof(ske), ske};
+    octet psk = {0, sizeof(psks), psks};
+    octet pskID = {0,sizeof(pskid), pskid};
+    octet pkR = {0, sizeof(pkr), pkr};
+    octet pkS = {0, sizeof(pks), pks};
+    octet pkE = {0, sizeof(pke), pke};
+    octet Z = {0, sizeof(z), z};
+    octet PLAIN = {0,sizeof(plain),plain};
+    octet CIPHER = {0,sizeof(cipher),cipher};
+    octet AAD = {0,sizeof(aad),aad};
+    octet TAG = {0,sizeof(tag),tag};
+    octet EXPORTER_SECRET = {0,sizeof(exporter_secret),exporter_secret};      
+              
+    OCT_fromHex(&INFO,(char *)"4f6465206f6e2061204772656369616e2055726e");
+    OCT_fromHex(&psk,(char *)"0247fd33b913760fa1fa51e1892d9f307fbe65eb171e8132c2af18555a738b82");
+    OCT_fromHex(&pskID,(char *)"456e6e796e20447572696e206172616e204d6f726961");
+    OCT_fromHex(&PLAIN,(char *)"4265617574792069732074727574682c20747275746820626561757479");
+    OCT_fromHex(&AAD,(char *)"436f756e742d30");
+
+    char key[32];
+    char nonce[12];
+    octet KEY = {0, sizeof(key), key};
+    octet NONCE = {0, sizeof(nonce), nonce};
+
+// Mode 0
+
+    mode=0;
+    printf("\nMode 0\n");
+
+    OCT_fromHex(&seedE,(char *)"7268600d403fce431561aef583ee1613527cff655c1343f29812e66706df3234");
+    OCT_fromHex(&seedR,(char *)"6db9df30aa07dd42ee5e8181afdb977e538f5e1fec8a06223f33f7013e525037");
+
+    DeriveKeyPair(config_id,&skE,&pkE,&seedE);
+    DeriveKeyPair(config_id,&skR,&pkR,&seedR);
+
+    HPKE_Encap(config_id,&skE,&Z,&pkE,&pkR);
+
+    printf("pkE= "); OCT_output(&pkE); 
+    printf("Encapsulated Secret= "); OCT_output(&Z);
+
+    HPKE_Decap(config_id,&skR,&Z,&pkE,&pkR);
+    printf("Decapsulated Secret= "); OCT_output(&Z);
+
+    HPKE_KeySchedule(config_id,&KEY,&NONCE,&EXPORTER_SECRET,mode,&Z,&INFO,NULL,NULL);
+    
+    printf("Key=   "); OCT_output(&KEY);
+    printf("Nonce= "); OCT_output(&NONCE);
+    printf("Exporter Secret= "); OCT_output(&EXPORTER_SECRET);  
+
+    AES_GCM_ENCRYPT(&KEY,&NONCE,&AAD,&PLAIN,&CIPHER,&TAG);
+
+    printf("Cipher= "); OCT_output(&CIPHER);
+    printf("Tag= "); OCT_output(&TAG);
+
+// Mode 1
+    mode=1;
+    printf("\nMode 1\n");
+    OCT_fromHex(&seedE,(char *)"78628c354e46f3e169bd231be7b2ff1c77aa302460a26dbfa15515684c00130b");
+    OCT_fromHex(&seedR,(char *)"d4a09d09f575fef425905d2ab396c1449141463f698f8efdb7accfaff8995098");
+    DeriveKeyPair(config_id,&skE,&pkE,&seedE);
+    DeriveKeyPair(config_id,&skR,&pkR,&seedR);
+    
+    HPKE_Encap(config_id,&skE,&Z,&pkE,&pkR);
+    
+    printf("pkE= "); OCT_output(&pkE); 
+    printf("Encapsulated Z= "); OCT_output(&Z);
+
+    HPKE_Decap(config_id,&skR,&Z,&pkE,&pkR);
+    printf("Decapsulated Z= "); OCT_output(&Z);
+
+    HPKE_KeySchedule(config_id,&KEY,&NONCE,&EXPORTER_SECRET,mode,&Z,&INFO,&psk,&pskID);
+
+    printf("Key=   "); OCT_output(&KEY);
+    printf("Nonce= "); OCT_output(&NONCE);
+    printf("Exporter Secret= "); OCT_output(&EXPORTER_SECRET);    
+
+    AES_GCM_ENCRYPT(&KEY,&NONCE,&AAD,&PLAIN,&CIPHER,&TAG);
+
+    printf("Cipher= "); OCT_output(&CIPHER);
+    printf("Tag= "); OCT_output(&TAG);
+
+// Mode 2
+    mode=2;
+    printf("\nMode 2\n");
+    OCT_fromHex(&seedE,(char *)"6e6d8f200ea2fb20c30b003a8b4f433d2f4ed4c2658d5bc8ce2fef718059c9f7");
+    OCT_fromHex(&seedR,(char *)"f1d4a30a4cef8d6d4e3b016e6fd3799ea057db4f345472ed302a67ce1c20cdec");
+    OCT_fromHex(&seedS,(char *)"94b020ce91d73fca4649006c7e7329a67b40c55e9e93cc907d282bbbff386f58");
+    DeriveKeyPair(config_id,&skE,&pkE,&seedE);
+    DeriveKeyPair(config_id,&skR,&pkR,&seedR);
+    DeriveKeyPair(config_id,&skS,&pkS,&seedS);
+
+
+    HPKE_AuthEncap(config_id,&skE,&skS,&Z,&pkE,&pkR,&pkS);
+
+    printf("pkE= "); OCT_output(&pkE); 
+    printf("Encapsulated Z= "); OCT_output(&Z);
+
+    HPKE_AuthDecap(config_id,&skR,&Z,&pkE,&pkR,&pkS);
+    printf("Decapsulated Z= "); OCT_output(&Z);
+
+    HPKE_KeySchedule(config_id,&KEY,&NONCE,&EXPORTER_SECRET,mode,&Z,&INFO,NULL,NULL);
+
+    printf("Key=   "); OCT_output(&KEY);
+    printf("Nonce= "); OCT_output(&NONCE);
+    printf("Exporter Secret= "); OCT_output(&EXPORTER_SECRET);  
+    
+    AES_GCM_ENCRYPT(&KEY,&NONCE,&AAD,&PLAIN,&CIPHER,&TAG);
+
+    printf("Cipher= "); OCT_output(&CIPHER);
+    printf("Tag= "); OCT_output(&TAG);
+
+// Mode 3
+    mode=3;
+    printf("\nMode 3\n");
+
+    OCT_fromHex(&seedE,(char *)"4303619085a20ebcf18edd22782952b8a7161e1dbae6e46e143a52a96127cf84");
+    OCT_fromHex(&seedR,(char *)"4b16221f3b269a88e207270b5e1de28cb01f847841b344b8314d6a622fe5ee90");
+    OCT_fromHex(&seedS,(char *)"62f77dcf5df0dd7eac54eac9f654f426d4161ec850cc65c54f8b65d2e0b4e345");
+    DeriveKeyPair(config_id,&skE,&pkE,&seedE);
+    DeriveKeyPair(config_id,&skR,&pkR,&seedR);
+    DeriveKeyPair(config_id,&skS,&pkS,&seedS);
+
+    HPKE_AuthEncap(config_id,&skE,&skS,&Z,&pkE,&pkR,&pkS);
+
+    printf("pkE= "); OCT_output(&pkE); 
+    printf("Encapsulated Z= "); OCT_output(&Z);
+
+    HPKE_AuthDecap(config_id,&skR,&Z,&pkE,&pkR,&pkS);
+    printf("Decapsulated Z= "); OCT_output(&Z);
+
+    HPKE_KeySchedule(config_id,&KEY,&NONCE,&EXPORTER_SECRET,mode,&Z,&INFO,&psk,&pskID);
+
+    printf("Key=   "); OCT_output(&KEY);
+    printf("Nonce= "); OCT_output(&NONCE);
+    printf("Exporter Secret= "); OCT_output(&EXPORTER_SECRET);  
+    
+    AES_GCM_ENCRYPT(&KEY,&NONCE,&AAD,&PLAIN,&CIPHER,&TAG);
+
+    printf("Cipher= "); OCT_output(&CIPHER);
+    printf("Tag= "); OCT_output(&TAG);
+
+    return res;
+}
+
+int hpke_NIST521()
+{
+    using namespace NIST521;
+
+    int res=0;
+    int config_id=0xB12; // 10|11|00010010 = 2, 3, 18
+    int i,mode;
+    char info[64];
+
+    char seede[EGS_NIST521];
+    char seedr[EGS_NIST521];
+    char seeds[EGS_NIST521];
+    octet seedE = {0, sizeof(seede), seede};
+    octet seedR = {0, sizeof(seedr), seedr};
+    octet seedS = {0, sizeof(seeds), seeds};
+
+    char skr[EGS_NIST521];
+    char sks[EGS_NIST521];
+    char ske[EGS_NIST521];
+    char psks[64];
+    char pskid[64];
+    char pkr[2*EFS_NIST521+1];
+    char pks[2*EFS_NIST521+1];
+    char pke[2*EFS_NIST521+1];
+    char z[256];
+    char plain[80];
+    char cipher[80];
+    char aad[32];
+    char tag[32];
+    char exporter_secret[128];
+    
+    octet INFO = {0, sizeof(info), info};
+    octet skR = {0, sizeof(skr), skr};
+    octet skS = {0, sizeof(sks), sks};
+    octet skE = {0, sizeof(ske), ske};
+    octet psk = {0, sizeof(psks), psks};
+    octet pskID = {0,sizeof(pskid), pskid};
+    octet pkR = {0, sizeof(pkr), pkr};
+    octet pkS = {0, sizeof(pks), pks};
+    octet pkE = {0, sizeof(pke), pke};
+    octet Z = {0, sizeof(z), z};
+    octet PLAIN = {0,sizeof(plain),plain};
+    octet CIPHER = {0,sizeof(cipher),cipher};
+    octet AAD = {0,sizeof(aad),aad};
+    octet TAG = {0,sizeof(tag),tag};
+    octet EXPORTER_SECRET = {0,sizeof(exporter_secret),exporter_secret};      
+
+    OCT_fromHex(&INFO,(char *)"4f6465206f6e2061204772656369616e2055726e");
+    OCT_fromHex(&psk,(char *)"0247fd33b913760fa1fa51e1892d9f307fbe65eb171e8132c2af18555a738b82");
+    OCT_fromHex(&pskID,(char *)"456e6e796e20447572696e206172616e204d6f726961");
+    OCT_fromHex(&PLAIN,(char *)"4265617574792069732074727574682c20747275746820626561757479");
+    OCT_fromHex(&AAD,(char *)"436f756e742d30");
+
+    char key[64];
+    char nonce[24];
+    octet KEY = {0, sizeof(key), key};
+    octet NONCE = {0, sizeof(nonce), nonce};
+
+// Mode 0
+
+    mode=0;
+    printf("\nMode 0\n");
+
+    OCT_fromHex(&seedE,(char *)"7f06ab8215105fc46aceeb2e3dc5028b44364f960426eb0d8e4026c2f8b5d7e7a986688f1591abf5ab753c357a5d6f0440414b4ed4ede71317772ac98d9239f70904");
+    OCT_fromHex(&seedR,(char *)"2ad954bbe39b7122529f7dde780bff626cd97f850d0784a432784e69d86eccaade43b6c10a8ffdb94bf943c6da479db137914ec835a7e715e36e45e29b587bab3bf1");
+   
+    DeriveKeyPair(config_id,&skE,&pkE,&seedE);
+    DeriveKeyPair(config_id,&skR,&pkR,&seedR);
+
+    HPKE_Encap(config_id,&skE,&Z,&pkE,&pkR);
+
+    printf("pkE= "); OCT_output(&pkE); 
+    printf("Encapsulated Z= "); OCT_output(&Z);
+
+    HPKE_Decap(config_id,&skR,&Z,&pkE,&pkR);
+    printf("Decapsulated Z= "); OCT_output(&Z);
+
+    HPKE_KeySchedule(config_id,&KEY,&NONCE,&EXPORTER_SECRET,mode,&Z,&INFO,NULL,NULL);
+
+    printf("Key=   "); OCT_output(&KEY);
+    printf("Nonce= "); OCT_output(&NONCE);
+    printf("Exporter Secret= "); OCT_output(&EXPORTER_SECRET); 
+    
+    AES_GCM_ENCRYPT(&KEY,&NONCE,&AAD,&PLAIN,&CIPHER,&TAG);
+
+    printf("Cipher= "); OCT_output(&CIPHER);
+    printf("Tag= "); OCT_output(&TAG);
+
+// Mode 1
+    mode=1;
+    printf("\nMode 1\n");
+
+    OCT_fromHex(&seedE,(char *)"f3ebfa9a69a924e672114fcd9e06fa9559e937f7eccce4181a2b506df53dbe514be12f094bb28e01de19dd345b4f7ede5ad7eaa6b9c3019592ec68eaae9a14732ce0");
+    OCT_fromHex(&seedR,(char *)"a2a2458705e278e574f835effecd18232f8a4c459e7550a09d44348ae5d3b1ea9d95c51995e657ad6f7cae659f5e186126a471c017f8f5e41da9eba74d4e0473e179");
+    DeriveKeyPair(config_id,&skE,&pkE,&seedE);
+    DeriveKeyPair(config_id,&skR,&pkR,&seedR);
+    
+    HPKE_Encap(config_id,&skE,&Z,&pkE,&pkR);
+    
+    printf("pkE= "); OCT_output(&pkE); 
+    printf("Encapsulated Z= "); OCT_output(&Z);
+
+    HPKE_Decap(config_id,&skR,&Z,&pkE,&pkR);
+    printf("Decapsulated Z= "); OCT_output(&Z);
+
+    HPKE_KeySchedule(config_id,&KEY,&NONCE,&EXPORTER_SECRET,mode,&Z,&INFO,&psk,&pskID);
+
+    printf("Key=   "); OCT_output(&KEY);
+    printf("Nonce= "); OCT_output(&NONCE);
+    printf("Exporter Secret= "); OCT_output(&EXPORTER_SECRET); 
+    
+    AES_GCM_ENCRYPT(&KEY,&NONCE,&AAD,&PLAIN,&CIPHER,&TAG);
+
+    printf("Cipher= "); OCT_output(&CIPHER);
+    printf("Tag= "); OCT_output(&TAG);
+
+// Mode 2
+    mode=2;
+    printf("\nMode 2\n");
+
+    OCT_fromHex(&seedE,(char *)"fe1c589c2a05893895a537f38c7cb4300b5a7e8fef3d6ccb8f07a498029c61e90262e009dc254c7f6235f9c6b2fd6aeff0a714db131b09258c16e217b7bd2aa619b0");
+    OCT_fromHex(&seedR,(char *)"8feea0438481fc0ecd470d6adfcda334a759c6b8650452c5a5dd9b2dd2cc9be33d2bb7ee64605fc07ab4664a58bb9a8de80defe510b6c97d2daf85b92cd4bb0a66bf");
+    OCT_fromHex(&seedS,(char *)"2f66a68b85ef04822b054ef521838c00c64f8b6226935593b69e13a1a2461a4f1a74c10c836e87eed150c0db85d4e4f506cbb746149befac6f5c07dc48a615ef92db");
+    DeriveKeyPair(config_id,&skE,&pkE,&seedE);
+    DeriveKeyPair(config_id,&skR,&pkR,&seedR);
+    DeriveKeyPair(config_id,&skS,&pkS,&seedS);
+ 
+    HPKE_AuthEncap(config_id,&skE,&skS,&Z,&pkE,&pkR,&pkS);
+
+    printf("pkE= "); OCT_output(&pkE); 
+    printf("Encapsulated Z= "); OCT_output(&Z);
+
+    HPKE_AuthDecap(config_id,&skR,&Z,&pkE,&pkR,&pkS);
+    printf("Decapsulated Z= "); OCT_output(&Z);
+
+    HPKE_KeySchedule(config_id,&KEY,&NONCE,&EXPORTER_SECRET,mode,&Z,&INFO,NULL,NULL);
+
+    printf("Key=   "); OCT_output(&KEY);
+    printf("Nonce= "); OCT_output(&NONCE);
+    printf("Exporter Secret= "); OCT_output(&EXPORTER_SECRET); 
+    
+    AES_GCM_ENCRYPT(&KEY,&NONCE,&AAD,&PLAIN,&CIPHER,&TAG);
+
+    printf("Cipher= "); OCT_output(&CIPHER);
+    printf("Tag= "); OCT_output(&TAG);
+
+// Mode 3
+    mode=3;
+    printf("\nMode 3\n");
+
+    OCT_fromHex(&seedE,(char *)"54272797b1fbc128a6967ff1fd606e0c67868f7762ce1421439cbc9e90ce1b28d566e6c2acbce712e48eebf236696eb680849d6873e9959395b2931975d61d38bd6c");
+    OCT_fromHex(&seedR,(char *)"3db434a8bc25b27eb0c590dc64997ab1378a99f52b2cb5a5a5b2fa540888f6c0f09794c654f4468524e040e6b4eca2c9dcf229f908b9d318f960cc9e9baa92c5eee6");
+    OCT_fromHex(&seedS,(char *)"65d523d9b37e1273eb25ad0527d3a7bd33f67208dd1666d9904c6bc04969ae5831a8b849e7ff642581f2c3e56be84609600d3c6bbdaded3f6989c37d2892b1e978d5");
+    DeriveKeyPair(config_id,&skE,&pkE,&seedE);
+    DeriveKeyPair(config_id,&skR,&pkR,&seedR);
+    DeriveKeyPair(config_id,&skS,&pkS,&seedS);
+
+    HPKE_AuthEncap(config_id,&skE,&skS,&Z,&pkE,&pkR,&pkS);
+
+    printf("pkE= "); OCT_output(&pkE); 
+    printf("Encapsulated Z= "); OCT_output(&Z);
+
+    HPKE_AuthDecap(config_id,&skR,&Z,&pkE,&pkR,&pkS);
+    printf("Decapsulated Z= "); OCT_output(&Z);
+
+    HPKE_KeySchedule(config_id,&KEY,&NONCE,&EXPORTER_SECRET,mode,&Z,&INFO,&psk,&pskID);
+
+    printf("Key=   "); OCT_output(&KEY);
+    printf("Nonce= "); OCT_output(&NONCE);
+    printf("Exporter Secret= "); OCT_output(&EXPORTER_SECRET); 
+    
+    AES_GCM_ENCRYPT(&KEY,&NONCE,&AAD,&PLAIN,&CIPHER,&TAG);
+
+    printf("Cipher= "); OCT_output(&CIPHER);
+    printf("Tag= "); OCT_output(&TAG);
+
+    return res;
+}
+
+int hpke_NIST256()
+{
+    using namespace NIST256;
+
+    int res=0;
+    int config_id=0x510; // 10|11|00010010 = 2, 3, 18  // 01|01|00010000  = 1, 1, 16
+    int i,mode;
+    char info[64];
+
+    char seede[EGS_NIST256];
+    char seedr[EGS_NIST256];
+    char seeds[EGS_NIST256];
+    octet seedE = {0, sizeof(seede), seede};
+    octet seedR = {0, sizeof(seedr), seedr};
+    octet seedS = {0, sizeof(seeds), seeds};
+
+    char skr[EGS_NIST256];
+    char sks[EGS_NIST256];
+    char ske[EGS_NIST256];
+    char psks[64];
+    char pskid[64];
+    char pkr[2*EFS_NIST256+1];
+    char pks[2*EFS_NIST256+1];
+    char pke[2*EFS_NIST256+1];
+    char z[256];
+    char plain[80];
+    char cipher[80];
+    char aad[32];
+    char tag[32];
+    char exporter_secret[128];
+    
+    octet INFO = {0, sizeof(info), info};
+    octet skR = {0, sizeof(skr), skr};
+    octet skS = {0, sizeof(sks), sks};
+    octet skE = {0, sizeof(ske), ske};
+    octet psk = {0, sizeof(psks), psks};
+    octet pskID = {0,sizeof(pskid), pskid};
+    octet pkR = {0, sizeof(pkr), pkr};
+    octet pkS = {0, sizeof(pks), pks};
+    octet pkE = {0, sizeof(pke), pke};
+    octet Z = {0, sizeof(z), z};
+    octet PLAIN = {0,sizeof(plain),plain};
+    octet CIPHER = {0,sizeof(cipher),cipher};
+    octet AAD = {0,sizeof(aad),aad};
+    octet TAG = {0,sizeof(tag),tag};
+    octet EXPORTER_SECRET = {0,sizeof(exporter_secret),exporter_secret};      
+
+    OCT_fromHex(&INFO,(char *)"4f6465206f6e2061204772656369616e2055726e");
+    OCT_fromHex(&psk,(char *)"0247fd33b913760fa1fa51e1892d9f307fbe65eb171e8132c2af18555a738b82");
+    OCT_fromHex(&pskID,(char *)"456e6e796e20447572696e206172616e204d6f726961");
+    OCT_fromHex(&PLAIN,(char *)"4265617574792069732074727574682c20747275746820626561757479");
+    OCT_fromHex(&AAD,(char *)"436f756e742d30");
+
+    char key[64];
+    char nonce[24];
+    octet KEY = {0, sizeof(key), key};
+    octet NONCE = {0, sizeof(nonce), nonce};
+
+// Mode 0
+
+    mode=0;
+    printf("\nMode 0\n");
+
+    OCT_fromHex(&seedE,(char *)"4270e54ffd08d79d5928020af4686d8f6b7d35dbe470265f1f5aa22816ce860e");
+    OCT_fromHex(&seedR,(char *)"668b37171f1072f3cf12ea8a236a45df23fc13b82af3609ad1e354f6ef817550");
+
+	//printf("seedE= "); OCT_output(&seedE);
+   
+    DeriveKeyPair(config_id,&skE,&pkE,&seedE);
+
+    //printf("1. pkE= "); OCT_output(&pkE); 
+
+    DeriveKeyPair(config_id,&skR,&pkR,&seedR);
+
+    HPKE_Encap(config_id,&skE,&Z,&pkE,&pkR);
+    printf("pkE= "); OCT_output(&pkE); 
+
+
+    printf("Encapsulated Z= "); OCT_output(&Z);
+
+    HPKE_Decap(config_id,&skR,&Z,&pkE,&pkR);
+    printf("Decapsulated Z= "); OCT_output(&Z);
+
+    HPKE_KeySchedule(config_id,&KEY,&NONCE,&EXPORTER_SECRET,mode,&Z,&INFO,NULL,NULL);
+
+    printf("Key=   "); OCT_output(&KEY);
+    printf("Nonce= "); OCT_output(&NONCE);
+    printf("Exporter Secret= "); OCT_output(&EXPORTER_SECRET); 
+    
+    AES_GCM_ENCRYPT(&KEY,&NONCE,&AAD,&PLAIN,&CIPHER,&TAG);
+
+    printf("Cipher= "); OCT_output(&CIPHER);
+    printf("Tag= "); OCT_output(&TAG);
+
+// Mode 1
+    mode=1;
+    printf("\nMode 1\n");
+
+    OCT_fromHex(&seedE,(char *)"2afa611d8b1a7b321c761b483b6a053579afa4f767450d3ad0f84a39fda587a6");
+    OCT_fromHex(&seedR,(char *)"d42ef874c1913d9568c9405407c805baddaffd0898a00f1e84e154fa787b2429");
+    DeriveKeyPair(config_id,&skE,&pkE,&seedE);
+    DeriveKeyPair(config_id,&skR,&pkR,&seedR);
+    
+    HPKE_Encap(config_id,&skE,&Z,&pkE,&pkR);
+    
+    printf("pkE= "); OCT_output(&pkE); 
+    printf("Encapsulated Z= "); OCT_output(&Z);
+
+    HPKE_Decap(config_id,&skR,&Z,&pkE,&pkR);
+    printf("Decapsulated Z= "); OCT_output(&Z);
+
+    HPKE_KeySchedule(config_id,&KEY,&NONCE,&EXPORTER_SECRET,mode,&Z,&INFO,&psk,&pskID);
+
+    printf("Key=   "); OCT_output(&KEY);
+    printf("Nonce= "); OCT_output(&NONCE);
+    printf("Exporter Secret= "); OCT_output(&EXPORTER_SECRET); 
+    
+    AES_GCM_ENCRYPT(&KEY,&NONCE,&AAD,&PLAIN,&CIPHER,&TAG);
+
+    printf("Cipher= "); OCT_output(&CIPHER);
+    printf("Tag= "); OCT_output(&TAG);
+
+// Mode 2
+    mode=2;
+    printf("\nMode 2\n");
+
+    OCT_fromHex(&seedE,(char *)"798d82a8d9ea19dbc7f2c6dfa54e8a6706f7cdc119db0813dacf8440ab37c857");
+    OCT_fromHex(&seedR,(char *)"7bc93bde8890d1fb55220e7f3b0c107ae7e6eda35ca4040bb6651284bf0747ee");
+    OCT_fromHex(&seedS,(char *)"874baa0dcf93595a24a45a7f042e0d22d368747daaa7e19f80a802af19204ba8");
+    DeriveKeyPair(config_id,&skE,&pkE,&seedE);
+    DeriveKeyPair(config_id,&skR,&pkR,&seedR);
+    DeriveKeyPair(config_id,&skS,&pkS,&seedS);
+ 
+    HPKE_AuthEncap(config_id,&skE,&skS,&Z,&pkE,&pkR,&pkS);
+
+    printf("pkE= "); OCT_output(&pkE); 
+    printf("Encapsulated Z= "); OCT_output(&Z);
+
+    HPKE_AuthDecap(config_id,&skR,&Z,&pkE,&pkR,&pkS);
+    printf("Decapsulated Z= "); OCT_output(&Z);
+
+    HPKE_KeySchedule(config_id,&KEY,&NONCE,&EXPORTER_SECRET,mode,&Z,&INFO,NULL,NULL);
+
+    printf("Key=   "); OCT_output(&KEY);
+    printf("Nonce= "); OCT_output(&NONCE);
+    printf("Exporter Secret= "); OCT_output(&EXPORTER_SECRET); 
+    
+    AES_GCM_ENCRYPT(&KEY,&NONCE,&AAD,&PLAIN,&CIPHER,&TAG);
+
+    printf("Cipher= "); OCT_output(&CIPHER);
+    printf("Tag= "); OCT_output(&TAG);
+
+// Mode 3
+    mode=3;
+    printf("\nMode 3\n");
+
+    OCT_fromHex(&seedE,(char *)"3c1fceb477ec954c8d58ef3249e4bb4c38241b5925b95f7486e4d9f1d0d35fbb");
+    OCT_fromHex(&seedR,(char *)"abcc2da5b3fa81d8aabd91f7f800a8ccf60ec37b1b585a5d1d1ac77f258b6cca");
+    OCT_fromHex(&seedS,(char *)"6262031f040a9db853edd6f91d2272596eabbc78a2ed2bd643f770ecd0f19b82");
+    DeriveKeyPair(config_id,&skE,&pkE,&seedE);
+    DeriveKeyPair(config_id,&skR,&pkR,&seedR);
+    DeriveKeyPair(config_id,&skS,&pkS,&seedS);
+
+    HPKE_AuthEncap(config_id,&skE,&skS,&Z,&pkE,&pkR,&pkS);
+
+    printf("pkE= "); OCT_output(&pkE); 
+    printf("Encapsulated Z= "); OCT_output(&Z);
+
+    HPKE_AuthDecap(config_id,&skR,&Z,&pkE,&pkR,&pkS);
+    printf("Decapsulated Z= "); OCT_output(&Z);
+
+    HPKE_KeySchedule(config_id,&KEY,&NONCE,&EXPORTER_SECRET,mode,&Z,&INFO,&psk,&pskID);
+
+    printf("Key=   "); OCT_output(&KEY);
+    printf("Nonce= "); OCT_output(&NONCE);
+    printf("Exporter Secret= "); OCT_output(&EXPORTER_SECRET); 
+    
+    AES_GCM_ENCRYPT(&KEY,&NONCE,&AAD,&PLAIN,&CIPHER,&TAG);
+
+    printf("Cipher= "); OCT_output(&CIPHER);
+    printf("Tag= "); OCT_output(&TAG);
+
+    return res;
+}
+
+int main()
+{
+    printf("\n%d bit build", CHUNK);
+
+    printf("\nTesting HPKE for curve C25519\n");
+    hpke_C25519();
+
+    printf("\nTesting HPKE for curve NIST521\n");
+    hpke_NIST521();
+
+    printf("\nTesting HPKE for curve NIST256\n");
+    hpke_NIST256();
+}
+
+
+
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/testhtp.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/testhtp.cpp
new file mode 100644
index 0000000..3f21370
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/testhtp.cpp
@@ -0,0 +1,714 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* test driver and function exerciser for HTP API Functions */
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include <time.h>
+#include "core.h"
+#include "randapi.h"
+#include "ecp_NIST256.h"
+#include "ecp_Ed25519.h"
+#include "ecp_C25519.h"
+#include "ecp_Ed448.h"
+#include "ecp_SECP256K1.h"
+#include "ecp_BLS12381.h"
+#include "ecp2_BLS12381.h"
+
+using namespace core;
+
+#define CEIL(a,b) (((a)-1)/(b)+1)
+
+/* Select curves 1,2,3,7,17,29 */
+
+/* https://datatracker.ietf.org/doc/draft-irtf-cfrg-hash-to-curve/ */
+
+static void hash_to_field_Ed25519(int hash,int hlen,F25519::FP *u,octet *DST,octet *M, int ctr)
+{
+    using namespace Ed25519;
+    using namespace Ed25519_BIG;
+    using namespace Ed25519_FP;
+    
+    int i,j,L,k,m;
+    BIG q,w,r;
+    DBIG dx;
+    char okm[512],fd[256];
+    octet OKM = {0,sizeof(okm),okm};
+
+    BIG_rcopy(q, Modulus);
+    k=BIG_nbits(q);
+    BIG_rcopy(r, CURVE_Order);
+    m=BIG_nbits(r);
+    L=CEIL(k+CEIL(m,2),8);
+
+    XMD_Expand(hash,hlen,&OKM,L*ctr,DST,M);
+    for (i=0;i<ctr;i++)
+    {
+        for (j=0;j<L;j++)
+            fd[j]=OKM.val[i*L+j];
+        
+        BIG_dfromBytesLen(dx,fd,L);
+        BIG_dmod(w,dx,q);
+        FP_nres(&u[i],w);
+    }
+}
+
+int htp_Ed25519(char *mess)
+{
+    using namespace Ed25519;
+    using namespace Ed25519_BIG;
+    using namespace Ed25519_FP;
+ 
+    int res=0;
+    BIG r;
+    FP u[2];
+    ECP P,P1;
+    char dst[100];
+    char msg[2000];
+    octet MSG = {0,sizeof(msg),msg};
+    octet DST = {0,sizeof(dst),dst};
+
+    BIG_rcopy(r, CURVE_Order);
+    printf("Random oracle - message= %s\n",mess);
+    OCT_jstring(&MSG,mess);
+
+    OCT_jstring(&DST,(char *)"QUUX-V01-CS02-with-edwards25519_XMD:SHA-512_ELL2_RO_");
+
+    hash_to_field_Ed25519(MC_SHA2, SHA512,u,&DST,&MSG,2);
+    printf("u[0]= "); FP_output(&u[0]); printf("\n");
+    printf("u[1]= "); FP_output(&u[1]); printf("\n");
+    ECP_map2point(&P,&u[0]);
+    printf("Q[0]= "); ECP_output(&P);
+    ECP_map2point(&P1,&u[1]);
+    printf("Q[1]= "); ECP_output(&P1);
+    ECP_add(&P,&P1);
+    ECP_cfp(&P);
+    ECP_affine(&P);
+    printf("P= "); ECP_output(&P); printf("\n");
+    ECP_mul(&P,r);
+    if (!ECP_isinf(&P))
+        printf("Hashing failure\n");
+
+    printf("Non-Uniform\n");
+    OCT_clear(&DST);
+
+    OCT_jstring(&DST,(char *)"QUUX-V01-CS02-with-edwards25519_XMD:SHA-512_ELL2_NU_");
+
+    hash_to_field_Ed25519(MC_SHA2, SHA512,u,&DST,&MSG,1);
+    printf("u[0]= "); FP_output(&u[0]); printf("\n");
+    ECP_map2point(&P,&u[0]);
+    printf("Q= "); ECP_output(&P);
+
+    ECP_cfp(&P);
+    ECP_affine(&P);
+    printf("P= "); ECP_output(&P); printf("\n");
+
+    ECP_mul(&P,r);
+    if (!ECP_isinf(&P))
+        printf("Hashing failure\n");
+    
+    return res;
+}
+
+
+static void hash_to_field_C25519(int hash,int hlen,F25519::FP *u,octet *DST,octet *M, int ctr)
+{
+    using namespace C25519;
+    using namespace C25519_BIG;
+    using namespace C25519_FP;
+    
+    int i,j,L,k,m;
+    BIG q,w,r;
+    DBIG dx;
+    char okm[512],fd[256];
+    octet OKM = {0,sizeof(okm),okm};
+
+    BIG_rcopy(q, Modulus);
+    k=BIG_nbits(q);
+    BIG_rcopy(r, CURVE_Order);
+    m=BIG_nbits(r);
+    L=CEIL(k+CEIL(m,2),8);
+
+    XMD_Expand(hash,hlen,&OKM,L*ctr,DST,M);
+    for (i=0;i<ctr;i++)
+    {
+        for (j=0;j<L;j++)
+            fd[j]=OKM.val[i*L+j];
+        
+        BIG_dfromBytesLen(dx,fd,L);
+        BIG_dmod(w,dx,q);
+        FP_nres(&u[i],w);
+    }
+}
+
+int htp_C25519(char *mess)
+{
+    using namespace C25519;
+    using namespace C25519_BIG;
+    using namespace C25519_FP;
+ 
+    int res=0;
+    BIG r;
+    FP u[2];
+    ECP P,P1;
+    char dst[100];
+    char msg[2000];
+    octet MSG = {0,sizeof(msg),msg};
+    octet DST = {0,sizeof(dst),dst};
+    
+    OCT_jstring(&MSG,mess);
+
+    printf("Non-Uniform\n");
+    OCT_clear(&DST);
+
+    OCT_jstring(&DST,(char *)"QUUX-V01-CS02-with-curve25519_XMD:SHA-512_ELL2_NU_");
+
+    hash_to_field_C25519(MC_SHA2, SHA512,u,&DST,&MSG,1);
+    printf("u[0]= "); FP_output(&u[0]); printf("\n");
+    ECP_map2point(&P,&u[0]);
+    printf("Q= "); ECP_output(&P);
+
+    ECP_cfp(&P);
+    ECP_affine(&P);
+    printf("P= "); ECP_output(&P); printf("\n");
+
+    ECP_mul(&P,r);
+    if (!ECP_isinf(&P))
+        printf("Hashing failure\n");
+    
+    return res;
+}
+
+/* https://datatracker.ietf.org/doc/draft-irtf-cfrg-hash-to-curve/ */
+static void hash_to_field_NIST256(int hash,int hlen,NIST256::FP *u,octet *DST,octet *M, int ctr)
+{
+    using namespace NIST256;
+    using namespace NIST256_BIG;
+    using namespace NIST256_FP;
+    
+    int i,j,L,k,m;
+    BIG q,w,r;
+    DBIG dx;
+    char okm[512],fd[256];
+    octet OKM = {0,sizeof(okm),okm};
+
+    BIG_rcopy(q, Modulus);
+    k=BIG_nbits(q);
+    BIG_rcopy(r, CURVE_Order);
+    m=BIG_nbits(r);
+    L=CEIL(k+CEIL(m,2),8);
+
+    XMD_Expand(hash,hlen,&OKM,L*ctr,DST,M);
+    for (i=0;i<ctr;i++)
+    {
+        for (j=0;j<L;j++)
+            fd[j]=OKM.val[i*L+j];
+        
+        BIG_dfromBytesLen(dx,fd,L);
+        BIG_dmod(w,dx,q);
+        FP_nres(&u[i],w);
+    }
+}
+
+int htp_NIST256(char *mess)
+{
+    using namespace NIST256;
+    using namespace NIST256_BIG;
+    using namespace NIST256_FP;
+ 
+    int res=0;
+    BIG r;
+    FP u[2];
+    ECP P,P1;
+    char dst[100];
+    char msg[2000];
+    octet MSG = {0,sizeof(msg),msg};
+    octet DST = {0,sizeof(dst),dst};
+
+    BIG_rcopy(r, CURVE_Order);
+    printf("Random oracle - message= %s\n",mess);
+    OCT_jstring(&MSG,mess);
+
+    OCT_jstring(&DST,(char *)"QUUX-V01-CS02-with-P256_XMD:SHA-256_SSWU_RO_");
+
+    hash_to_field_NIST256(MC_SHA2,HASH_TYPE_NIST256,u,&DST,&MSG,2);
+    printf("u[0]= "); FP_output(&u[0]); printf("\n");
+    printf("u[1]= "); FP_output(&u[1]); printf("\n");
+    ECP_map2point(&P,&u[0]);
+    printf("Q[0]= "); ECP_output(&P);
+    ECP_map2point(&P1,&u[1]);
+    printf("Q[1]= "); ECP_output(&P1);
+    ECP_add(&P,&P1);
+    ECP_cfp(&P);
+    ECP_affine(&P);
+    printf("P= "); ECP_output(&P); printf("\n");
+    ECP_mul(&P,r);
+    if (!ECP_isinf(&P))
+        printf("Hashing failure\n");
+
+    printf("Non-Uniform\n");
+    OCT_clear(&DST);
+
+    OCT_jstring(&DST,(char *)"QUUX-V01-CS02-with-P256_XMD:SHA-256_SSWU_NU_");
+    
+    hash_to_field_NIST256(MC_SHA2,HASH_TYPE_NIST256,u,&DST,&MSG,1);
+    printf("u[0]= "); FP_output(&u[0]); printf("\n");
+    ECP_map2point(&P,&u[0]);
+    printf("Q= "); ECP_output(&P);
+    ECP_cfp(&P);
+    ECP_affine(&P);
+    printf("P= "); ECP_output(&P); printf("\n");
+    ECP_mul(&P,r);
+    if (!ECP_isinf(&P))
+        printf("Hashing failure\n");
+    return res;
+}
+
+
+/* https://datatracker.ietf.org/doc/draft-irtf-cfrg-hash-to-curve/ */
+static void hash_to_field_Ed448(int hash,int hlen,Ed448::FP *u,octet *DST,octet *M, int ctr)
+{
+    using namespace Ed448;
+    using namespace Ed448_BIG;
+    using namespace Ed448_FP;
+    
+    int i,j,L,k,m;
+    BIG q,w,r;
+    DBIG dx;
+    char okm[512],fd[256];
+    octet OKM = {0,sizeof(okm),okm};
+
+    BIG_rcopy(q, Modulus);
+    k=BIG_nbits(q);
+    BIG_rcopy(r, CURVE_Order);
+    m=BIG_nbits(r);
+    L=CEIL(k+CEIL(m,2),8);
+
+    XMD_Expand(hash,hlen,&OKM,L*ctr,DST,M);
+    for (i=0;i<ctr;i++)
+    {
+        for (j=0;j<L;j++)
+            fd[j]=OKM.val[i*L+j];
+        
+        BIG_dfromBytesLen(dx,fd,L);
+        BIG_dmod(w,dx,q);
+        FP_nres(&u[i],w);
+    }
+}
+
+int htp_Ed448(char *mess)
+{
+    using namespace Ed448;
+    using namespace Ed448_BIG;
+    using namespace Ed448_FP;
+ 
+    int res=0;
+    BIG r;
+    FP u[2];
+    ECP P,P1;
+    char dst[100];
+    char msg[2000];
+    octet MSG = {0,sizeof(msg),msg};
+    octet DST = {0,sizeof(dst),dst};
+
+    BIG_rcopy(r, CURVE_Order);
+    printf("Random oracle - message= %s\n",mess);
+    OCT_jstring(&MSG,mess);
+
+    OCT_jstring(&DST,(char *)"QUUX-V01-CS02-with-edwards448_XMD:SHA-512_ELL2_RO_");
+
+    hash_to_field_Ed448(MC_SHA2,HASH_TYPE_Ed448,u,&DST,&MSG,2);
+    printf("u[0]= "); FP_output(&u[0]); printf("\n");
+    printf("u[1]= "); FP_output(&u[1]); printf("\n");
+    ECP_map2point(&P,&u[0]);
+    printf("Q[0]= "); ECP_output(&P);
+    ECP_map2point(&P1,&u[1]);
+    printf("Q[1]= "); ECP_output(&P1);
+    ECP_add(&P,&P1);
+    ECP_cfp(&P);
+    ECP_affine(&P);
+    printf("P= "); ECP_output(&P); printf("\n");
+    ECP_mul(&P,r);
+    if (!ECP_isinf(&P))
+        printf("Hashing failure\n");
+
+    printf("Non-Uniform\n");
+    OCT_clear(&DST);
+
+    OCT_jstring(&DST,(char *)"QUUX-V01-CS02-with-edwards448_XMD:SHA-512_ELL2_NU_");
+
+    hash_to_field_Ed448(MC_SHA2,HASH_TYPE_Ed448,u,&DST,&MSG,1);
+    printf("u[0]= "); FP_output(&u[0]); printf("\n");
+    ECP_map2point(&P,&u[0]);
+    printf("Q= "); ECP_output(&P);
+
+    ECP_cfp(&P);
+    ECP_affine(&P);
+    printf("P= "); ECP_output(&P); printf("\n");
+    ECP_mul(&P,r);
+    if (!ECP_isinf(&P))
+        printf("Hashing failure\n");
+
+    return res;
+}
+
+/* https://datatracker.ietf.org/doc/draft-irtf-cfrg-hash-to-curve/ */
+static void hash_to_field_SECP256K1(int hash,int hlen,SECP256K1::FP *u,octet *DST,octet *M, int ctr)
+{
+    using namespace SECP256K1;
+    using namespace SECP256K1_BIG;
+    using namespace SECP256K1_FP;
+    
+    int i,j,L,k,m;
+    BIG q,w,r;
+    DBIG dx;
+    char okm[512],fd[256];
+    octet OKM = {0,sizeof(okm),okm};
+
+    BIG_rcopy(q, Modulus);
+    k=BIG_nbits(q);
+    BIG_rcopy(r, CURVE_Order);
+    m=BIG_nbits(r);
+    L=CEIL(k+CEIL(m,2),8);
+
+    XMD_Expand(hash,hlen,&OKM,L*ctr,DST,M);
+    for (i=0;i<ctr;i++)
+    {
+        for (j=0;j<L;j++)
+            fd[j]=OKM.val[i*L+j];
+        
+        BIG_dfromBytesLen(dx,fd,L);
+        BIG_dmod(w,dx,q);
+        FP_nres(&u[i],w);
+    }
+}
+
+int htp_SECP256K1(char *mess)
+{
+    using namespace SECP256K1;
+    using namespace SECP256K1_BIG;
+    using namespace SECP256K1_FP;
+ 
+    int res=0;
+    BIG r;
+    FP u[2];
+    ECP P,P1;
+    char dst[100];
+    char msg[2000];
+    octet MSG = {0,sizeof(msg),msg};
+    octet DST = {0,sizeof(dst),dst};
+
+    BIG_rcopy(r, CURVE_Order);
+    printf("Random oracle - message= %s\n",mess);
+    OCT_jstring(&MSG,mess);
+
+    OCT_jstring(&DST,(char *)"QUUX-V01-CS02-with-secp256k1_XMD:SHA-256_SSWU_RO_");
+    hash_to_field_SECP256K1(MC_SHA2,HASH_TYPE_SECP256K1,u,&DST,&MSG,2);
+    printf("u[0]= "); FP_output(&u[0]); printf("\n");
+    printf("u[1]= "); FP_output(&u[1]); printf("\n");
+    ECP_map2point(&P,&u[0]);
+    printf("Q[0]= "); ECP_output(&P);
+    ECP_map2point(&P1,&u[1]);
+    printf("Q[1]= "); ECP_output(&P1);
+    ECP_add(&P,&P1);
+    ECP_cfp(&P);
+    ECP_affine(&P);
+    printf("P= "); ECP_output(&P); printf("\n");
+    ECP_mul(&P,r);
+    if (!ECP_isinf(&P))
+        printf("Hashing failure\n");
+
+    printf("Non-Uniform\n");
+    OCT_clear(&DST);
+    OCT_jstring(&DST,(char *)"QUUX-V01-CS02-with-secp256k1_XMD:SHA-256_SSWU_NU_");
+    hash_to_field_SECP256K1(MC_SHA2,HASH_TYPE_SECP256K1,u,&DST,&MSG,1);
+    printf("u[0]= "); FP_output(&u[0]); printf("\n");
+    ECP_map2point(&P,&u[0]);
+    printf("Q= "); ECP_output(&P);
+
+    ECP_cfp(&P);
+    ECP_affine(&P);
+    printf("P= "); ECP_output(&P); printf("\n");
+    ECP_mul(&P,r);
+    if (!ECP_isinf(&P))
+        printf("Hashing failure\n");
+
+    return res;
+}
+
+
+/* https://datatracker.ietf.org/doc/draft-irtf-cfrg-hash-to-curve/ */
+static void hash_to_field_BLS12381(int hash,int hlen,BLS12381::FP *u,octet *DST,octet *M, int ctr)
+{
+    using namespace BLS12381;
+    using namespace BLS12381_BIG;
+    using namespace BLS12381_FP;
+    
+    int i,j,L,k,m;
+    BIG q,w,r;
+    DBIG dx;
+    char okm[512],fd[256];
+    octet OKM = {0,sizeof(okm),okm};
+
+    BIG_rcopy(q, Modulus);
+    k=BIG_nbits(q);
+    BIG_rcopy(r, CURVE_Order);
+    m=BIG_nbits(r);
+    L=CEIL(k+CEIL(m,2),8);
+
+    //printf("L= %d\n",L);
+    XMD_Expand(hash,hlen,&OKM,L*ctr,DST,M);
+    for (i=0;i<ctr;i++)
+    {
+        for (j=0;j<L;j++)
+            fd[j]=OKM.val[i*L+j];
+        
+        BIG_dfromBytesLen(dx,fd,L);
+        BIG_dmod(w,dx,q);
+        FP_nres(&u[i],w);
+    }
+}
+
+int htp_BLS12381(char *mess)
+{
+    using namespace BLS12381;
+    using namespace BLS12381_BIG;
+    using namespace BLS12381_FP;
+ 
+    int res=0;
+    BIG r;
+    FP u[2];
+    ECP P,P1;
+    char dst[100];
+    char msg[2000];
+    octet MSG = {0,sizeof(msg),msg};
+    octet DST = {0,sizeof(dst),dst};
+
+    BIG_rcopy(r, CURVE_Order);
+    printf("Random oracle - message= %s\n",mess);
+    OCT_jstring(&MSG,mess);
+
+
+    OCT_jstring(&DST,(char *)"QUUX-V01-CS02-with-BLS12381G1_XMD:SHA-256_SSWU_RO_");
+    hash_to_field_BLS12381(MC_SHA2,HASH_TYPE_BLS12381,u,&DST,&MSG,2);
+    printf("u[0]= "); FP_output(&u[0]); printf("\n");
+    printf("u[1]= "); FP_output(&u[1]); printf("\n");
+    ECP_map2point(&P,&u[0]);
+    printf("Q[0]= "); ECP_output(&P);
+
+//exit(0);
+
+    ECP_map2point(&P1,&u[1]);
+    printf("Q[1]= "); ECP_output(&P1);
+    ECP_add(&P,&P1);
+    ECP_cfp(&P);
+    ECP_affine(&P);
+    printf("P= "); ECP_output(&P); printf("\n");
+    ECP_mul(&P,r);
+    if (!ECP_isinf(&P))
+        printf("Hashing failure\n");
+
+    printf("Non-Uniform\n");
+    OCT_clear(&DST);
+    OCT_jstring(&DST,(char *)"QUUX-V01-CS02-with-BLS12381G1_XMD:SHA-256_SSWU_NU_");
+    hash_to_field_BLS12381(MC_SHA2,HASH_TYPE_BLS12381,u,&DST,&MSG,1);
+    printf("u[0]= "); FP_output(&u[0]); printf("\n");
+    ECP_map2point(&P,&u[0]);
+    printf("Q= "); ECP_output(&P);
+
+    ECP_cfp(&P);
+    ECP_affine(&P);
+    printf("P= "); ECP_output(&P); printf("\n");
+    ECP_mul(&P,r);
+    if (!ECP_isinf(&P))
+        printf("Hashing failure\n");
+
+    return res;
+}
+
+/* https://datatracker.ietf.org/doc/draft-irtf-cfrg-hash-to-curve/ */
+static void hash_to_field_BLS12381_G2(int hash,int hlen,BLS12381::FP2 *u,octet *DST,octet *M, int ctr)
+{
+    using namespace BLS12381;
+    using namespace BLS12381_BIG;
+    
+    int i,j,L,k,m;
+    BIG q,w1,w2,r;
+    DBIG dx;
+    char okm[1024],fd[256];
+    octet OKM = {0,sizeof(okm),okm};
+
+    BIG_rcopy(q, Modulus);
+    k=BIG_nbits(q);
+    BIG_rcopy(r, CURVE_Order);
+    m=BIG_nbits(r);
+    L=CEIL(k+CEIL(m,2),8);
+
+    //printf("L= %d\n",L);
+    XMD_Expand(hash,hlen,&OKM,2*L*ctr,DST,M);
+    for (i=0;i<ctr;i++)
+    {
+        for (j=0;j<L;j++)
+            fd[j]=OKM.val[2*i*L+j];
+        
+        BIG_dfromBytesLen(dx,fd,L);
+        BIG_dmod(w1,dx,q);
+        
+        for (j=0;j<L;j++)
+            fd[j]=OKM.val[(2*i+1)*L+j];
+        
+        BIG_dfromBytesLen(dx,fd,L);
+        BIG_dmod(w2,dx,q);
+
+        FP2_from_BIGs(&u[i],w1,w2);
+    }
+}
+
+int htp_BLS12381_G2(char *mess)
+{
+    using namespace BLS12381;
+    using namespace BLS12381_BIG;
+
+    int res=0;
+    BIG r;
+    FP2 u[2];
+    ECP2 P,P1;
+    char dst[100];
+    char msg[2000];
+    octet MSG = {0,sizeof(msg),msg};
+    octet DST = {0,sizeof(dst),dst};
+
+    BIG_rcopy(r, CURVE_Order);
+    printf("Random oracle - message= %s\n",mess);
+    OCT_jstring(&MSG,mess);
+
+
+    OCT_jstring(&DST,(char *)"QUUX-V01-CS02-with-BLS12381G2_XMD:SHA-256_SSWU_RO_");
+    hash_to_field_BLS12381_G2(MC_SHA2,HASH_TYPE_BLS12381,u,&DST,&MSG,2);
+    printf("u[0]= "); FP2_output(&u[0]); printf("\n");
+    printf("u[1]= "); FP2_output(&u[1]); printf("\n");
+    ECP2_map2point(&P,&u[0]);
+    printf("Q[0]= "); ECP2_output(&P);
+    ECP2_map2point(&P1,&u[1]);
+    printf("Q[1]= "); ECP2_output(&P1);
+    ECP2_add(&P,&P1);
+    ECP2_cfp(&P);
+    ECP2_affine(&P);
+    printf("P= "); ECP2_output(&P); printf("\n");
+    ECP2_mul(&P,r);
+    if (!ECP2_isinf(&P))
+        printf("Hashing failure\n");
+
+    printf("Non-Uniform\n");
+    OCT_clear(&DST);
+    OCT_jstring(&DST,(char *)"QUUX-V01-CS02-with-BLS12381G2_XMD:SHA-256_SSWU_NU_");
+    hash_to_field_BLS12381_G2(MC_SHA2,HASH_TYPE_BLS12381,u,&DST,&MSG,1);
+    printf("u[0]= "); FP2_output(&u[0]); printf("\n");
+    ECP2_map2point(&P,&u[0]);
+    printf("Q= "); ECP2_output(&P);
+
+    ECP2_cfp(&P);
+    ECP2_affine(&P);
+    printf("P= "); ECP2_output(&P); printf("\n");
+    ECP2_mul(&P,r);
+    if (!ECP2_isinf(&P))
+        printf("Hashing failure\n");
+
+    return res;
+}
+
+int main()
+{
+    int i, res;
+    unsigned long ran;
+
+    char raw[100];
+    octet RAW = {0, sizeof(raw), raw};
+    csprng RNG;                // Crypto Strong RNG
+
+    time((time_t *)&ran);
+
+    RAW.len = 100;              // fake random seed source
+    RAW.val[0] = ran;
+    RAW.val[1] = ran >> 8;
+    RAW.val[2] = ran >> 16;
+    RAW.val[3] = ran >> 24;
+    for (i = 4; i < 100; i++) RAW.val[i] = i;
+
+    CREATE_CSPRNG(&RNG, &RAW);  // initialise strong RNG
+
+    printf("%d bit build", CHUNK);
+
+    printf("\nTesting HTP for curve Ed25519\n");
+    htp_Ed25519((char *)"");
+    htp_Ed25519((char *)"abc");
+    htp_Ed25519((char *)"abcdef0123456789");
+    htp_Ed25519((char *)"q128_qqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqq");
+    htp_Ed25519((char *)"a512_aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa");
+
+    printf("\nTesting HTP for curve C25519\n");
+    htp_C25519((char *)"");
+    htp_C25519((char *)"abc");
+    htp_C25519((char *)"abcdef0123456789");
+    htp_C25519((char *)"q128_qqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqq");
+    htp_C25519((char *)"a512_aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa");
+
+
+    printf("\nTesting HTP for curve NIST256\n");
+    htp_NIST256((char *)"");
+    htp_NIST256((char *)"abc");
+    htp_NIST256((char *)"abcdef0123456789");
+    htp_NIST256((char *)"q128_qqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqq");
+    htp_NIST256((char *)"a512_aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa");
+
+    printf("\nTesting HTP for curve Ed448\n");
+    htp_Ed448((char *)"");
+    htp_Ed448((char *)"abc");
+    htp_Ed448((char *)"abcdef0123456789");
+    htp_Ed448((char *)"q128_qqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqq");
+    htp_Ed448((char *)"a512_aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa");
+
+    printf("\nTesting HTP for curve SECP256K1\n");
+    htp_SECP256K1((char *)"");
+    htp_SECP256K1((char *)"abc");
+    htp_SECP256K1((char *)"abcdef0123456789");
+    htp_SECP256K1((char *)"q128_qqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqq");
+    htp_SECP256K1((char *)"a512_aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa");
+
+    printf("\nTesting HTP for curve BLS12381_G1\n");
+    htp_BLS12381((char *)"");
+    htp_BLS12381((char *)"abc");
+    htp_BLS12381((char *)"abcdef0123456789");
+    htp_BLS12381((char *)"q128_qqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqq");
+    htp_BLS12381((char *)"a512_aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa");
+
+    printf("\nTesting HTP for curve BLS12381_G2\n");
+    htp_BLS12381_G2((char *)"");
+    htp_BLS12381_G2((char *)"abc");
+    htp_BLS12381_G2((char *)"abcdef0123456789");
+    htp_BLS12381_G2((char *)"q128_qqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqq");
+    htp_BLS12381_G2((char *)"a512_aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa");
+
+
+    KILL_CSPRNG(&RNG);
+}
+
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/testkyber b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/testkyber
new file mode 100644
index 0000000..3c75b81
Binary files /dev/null and b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/testkyber differ
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/testkyber.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/testkyber.cpp
new file mode 100644
index 0000000..ca961c9
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/testkyber.cpp
@@ -0,0 +1,101 @@
+/*
+ * Copyright (c) 2012-2021 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* test driver and function exerciser for Kyber functions */
+/* g++ -O2 testkyber.cpp core.a -o testkyber */
+
+#include <stdio.h>
+#include <time.h>
+#include "kyber.h"
+
+using namespace core;
+
+#define LOOPS 100
+
+int main() {
+    int i,j;
+    unsigned long ran;
+    bool result;
+    char raw[100];
+    csprng RNG;
+    char sk[KYBER_SECRET_CPA_SIZE_768], pk[KYBER_PUBLIC_SIZE_768],ct[KYBER_CIPHERTEXT_SIZE_768],skc[KYBER_SECRET_CCA_SIZE_768],ss[KYBER_SHARED_SECRET_768];
+    octet SKC = {0, sizeof(skc), skc};
+    octet SK = {0, sizeof(sk), sk};
+    octet PK = {0, sizeof(pk), pk};
+    octet CT = {0, sizeof(ct), ct};
+    octet SS = {0, sizeof(ss), ss};
+
+    byte tau[32],r64[64],r32[32];
+    byte coins[32];
+
+    time((time_t *)&ran);
+
+    raw[0] = ran;
+    raw[1] = ran >> 8;
+    raw[2] = ran >> 16;
+    raw[3] = ran >> 24;
+
+    for (i = 0; i < 100; i++) raw[i] = i + 1; 
+    RAND_seed(&RNG, 100, raw);
+       
+    printf("Testing Kyber Encryption\n");
+
+    for (j=0;j<LOOPS;j++) {
+
+        for (i=0;i<64;i++)
+            r64[i]=RAND_byte(&RNG); 
+  
+        KYBER768_keypair(r64,&SKC,&PK);
+
+//printf("Public key= ");
+//for (i=0;i<PK.len;i++)
+//    printf("%02x",(byte)PK.val[i]);
+//printf("\n");
+    
+//printf("Secret key= ");
+//for (i=0;i<SKC.len;i++)
+//    printf("%02x",(byte)SKC.val[i]);
+//printf("\n");
+
+
+        for (i=0;i<32;i++)
+            r32[i]=RAND_byte(&RNG); 
+
+		KYBER768_encrypt(r32,&PK,&SS,&CT); 
+
+//printf("Ciphertext= ");
+//for (i=0;i<CT.len;i++)
+//    printf("%02x",(byte)CT.val[i]);
+//printf("\n");
+
+        printf("j= %d\n",j);
+        for (i=0;i<32;i++)
+            printf("%02x",(byte)SS.val[i]);
+        printf("\n");
+
+		KYBER768_decrypt(&SKC,&CT,&SS);
+        
+        for (i=0;i<32;i++)
+            printf("%02x",(byte)SS.val[i]);
+        printf("\n");
+    }
+
+    return 0;
+} 
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/testmpin b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/testmpin
new file mode 100644
index 0000000..b8c7cc3
Binary files /dev/null and b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/testmpin differ
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/testmpin.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/testmpin.cpp
new file mode 100644
index 0000000..4aa2712
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/testmpin.cpp
@@ -0,0 +1,527 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* test driver and function exerciser for MPIN API Functions */
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include <time.h>
+#include "mpin_BN254.h"
+#include "randapi.h"
+
+#if CHUNK==32 || CHUNK==64
+#include "mpin_BLS12383.h"
+#include "mpin192_BLS24479.h"
+#include "mpin256_BLS48556.h"
+#endif
+
+using namespace core;
+
+int mpin_BN254(csprng *RNG)
+{
+
+    using namespace BN254;
+    int i, pin, rtn;
+    char x[PGS_BN254], s[PGS_BN254], y[PGS_BN254], client_id[100], sst[4 * PFS_BN254 + 1], token[2 * PFS_BN254 + 1], sec[2 * PFS_BN254 + 1], u[2 * PFS_BN254 + 1];
+    char hcid[2*PFS_BN254+1], hsid[2*PFS_BN254+1], dst[256];
+
+    octet S = {0, sizeof(s), s};
+    octet X = {0, sizeof(x), x};
+    octet Y = {0, sizeof(y), y};
+    octet CLIENT_ID = {0, sizeof(client_id), client_id};
+    octet SST = {0, sizeof(sst), sst};
+    octet TOKEN = {0, sizeof(token), token};
+    octet SEC = {0, sizeof(sec), sec};
+    octet U = {0, sizeof(u), u};
+    octet HCID = {0, sizeof(hcid), hcid};
+    octet HSID = {0, sizeof(hsid), hsid};
+    octet DST = {0, sizeof(dst), dst};
+    OCT_jstring(&DST,(char *)"BN254G1_XMD:SHA-256_SVDW_NU_MPIN"); // Domain Separation Tag
+
+    // Trusted Authority (TA) set-up
+    MPIN_RANDOM_GENERATE(RNG, &S);
+    printf("Master Secret= ");
+    OCT_output(&S);
+
+// Client Identity
+            OCT_jstring(&CLIENT_ID, (char *)"testUser@miracl.com");
+            MPIN_ENCODE_TO_CURVE(&DST,&CLIENT_ID,&HCID);
+            printf("Client ID Hashed to Curve= ");
+            OCT_output(&HCID);
+//            printf("\n");
+
+// Client approaches Trusted Authority and is issued secret
+
+    MPIN_GET_CLIENT_SECRET(&S, &HCID, &TOKEN);
+    printf("Client Secret= ");
+    OCT_output(&TOKEN);
+
+// TA sends Client secret to Client
+
+// Server is issued secret by TA
+    MPIN_GET_SERVER_SECRET(&S, &SST);
+//    printf("Server Secret= ");
+//    OCT_output(&SST);
+
+// TA sends Server secret to Server
+
+// Client extracts PIN from secret to create Token
+            //pin = 1234;
+            //printf("Client extracts PIN= %d\n", pin);
+            pin=0; printf("Client chooses PIN= ");
+            if (scanf("%d", &pin)) {}; // to avoid silly compile error
+            getchar();
+            MPIN_EXTRACT_PIN(&HCID, pin, &TOKEN);
+            printf("Client Token= ");
+            OCT_output(&TOKEN);
+
+
+// Exercise Secret Sharing
+            char s1[2 * PFS_BN254 + 1],s2[2 * PFS_BN254 + 1],s3[2 * PFS_BN254 + 1],s4[2 * PFS_BN254 + 1],r[128];
+            octet S1 = {0, sizeof(s1), s1};
+            octet S2 = {0, sizeof(s2), s2};
+            octet S3 = {0, sizeof(s3), s3};
+            octet S4 = {0, sizeof(s4), s4};
+            octet R = {0,sizeof(r),r};
+            OCT_rand(&R,RNG,128);
+
+        // create 4 unique shares of TOKEN
+            share Sh1=getshare(1,3,&S1,&TOKEN,&R);  // indicate 3 shares required for recovery
+            share Sh2=getshare(2,3,&S2,&TOKEN,&R);
+            share Sh3=getshare(3,3,&S3,&TOKEN,&R);
+            share Sh4=getshare(4,3,&S4,&TOKEN,&R);
+
+            OCT_clear(&TOKEN);  // kill token
+
+            share Shares[3];
+            Shares[0]=Sh1;  // any 3 shares to recover TOKEN
+            Shares[1]=Sh2;
+            Shares[2]=Sh4; 
+            recover(&TOKEN,Shares);  // recover token
+
+// MPin Protocol
+
+// Client enters ID and PIN
+            OCT_clear(&CLIENT_ID);
+            OCT_jstring(&CLIENT_ID, (char *)"testUser@miracl.com");
+            MPIN_ENCODE_TO_CURVE(&DST,&CLIENT_ID,&HCID);
+            pin=0; printf("Client enters PIN= ");
+            if (scanf("%d", &pin)) {}; // to avoid silly compile error
+            getchar();
+
+// Client First pass: Inputs H(CLIENT_ID), RNG, pin, and TOKEN. Output x and U = x.H(CLIENT_ID) and re-combined secret SEC
+
+            if (MPIN_CLIENT_1(&HCID, RNG, &X, pin, &TOKEN, &SEC, &U) != 0)
+            {
+                printf("Error from Client side - First Pass\n");
+                return 1;
+            }
+
+// Send CLIENT_ID and U=x.ID to server. Server hashes ID to curve.
+                    MPIN_ENCODE_TO_CURVE(&DST,&CLIENT_ID,&HSID);
+
+// Server generates Random number Y and sends it to Client
+                    MPIN_RANDOM_GENERATE(RNG, &Y);
+
+// Client Second Pass: Inputs Client secret SEC, x and y. Sends -(x+y)*SEC to Server
+            if (MPIN_CLIENT_2(&X, &Y, &SEC) != 0)
+            {
+                printf("Error from Client side - Second Pass\n");
+                return 1;
+            }
+
+// Server Second phase. Inputs H(CLIENT_ID), Y, -(x+y)*SEC, U and Server secret SST. 
+
+                    rtn = MPIN_SERVER(&HSID, &Y, &SST, &U, &SEC);
+                    if (rtn != 0)
+                    {
+                        printf("Server says - Bad Pin.\n");
+                        return 1;
+                    }
+                    else
+                    {
+                        printf("Server says - PIN is good! You really are ");
+                        OCT_output_string(&CLIENT_ID);
+                        printf(".\n");
+                    }
+    printf("\n");
+
+    return 0;
+}
+
+#if CHUNK==32 || CHUNK==64
+
+int mpin_BLS12383(csprng *RNG)
+{
+    using namespace BLS12383;
+    int pin, rtn;
+
+    char x[PGS_BLS12383], s[PGS_BLS12383], y[PGS_BLS12383], client_id[100], sst[4 * PFS_BLS12383 + 1], token[2 * PFS_BLS12383 + 1], sec[2 * PFS_BLS12383 + 1], u[2 * PFS_BLS12383 + 1];
+    char hcid[2*PFS_BLS12383+1], hsid[2*PFS_BLS12383+1], dst[256];
+
+    octet S = {0, sizeof(s), s};
+    octet X = {0, sizeof(x), x};
+    octet Y = {0, sizeof(y), y};
+    octet CLIENT_ID = {0, sizeof(client_id), client_id};
+    octet SST = {0, sizeof(sst), sst};
+    octet TOKEN = {0, sizeof(token), token};
+    octet SEC = {0, sizeof(sec), sec};
+    octet U = {0, sizeof(u), u};
+    octet HCID = {0, sizeof(hcid), hcid};
+    octet HSID = {0, sizeof(hsid), hsid};
+    octet DST = {0, sizeof(dst), dst};
+    OCT_jstring(&DST,(char *)"BLS12383G1_XMD:SHA-256_SVDW_NU_MPIN"); // Domain Separation Tag
+
+    // Trusted Authority (TA) set-up
+    MPIN_RANDOM_GENERATE(RNG, &S);
+    printf("Master Secret= ");
+    OCT_output(&S);
+
+// Client Identity
+            OCT_jstring(&CLIENT_ID, (char *)"testUser@miracl.com");
+            MPIN_ENCODE_TO_CURVE(&DST,&CLIENT_ID,&HCID);
+            printf("Client ID Hashed to Curve= ");
+            OCT_output(&HCID);
+//            printf("\n");
+
+// Client approaches Trusted Authority and is issued secret
+
+    MPIN_GET_CLIENT_SECRET(&S, &HCID, &TOKEN);
+    printf("Client Secret= ");
+    OCT_output(&TOKEN);
+
+// TA sends Client secret to Client
+
+// Server is issued secret by TA
+    MPIN_GET_SERVER_SECRET(&S, &SST);
+//    printf("Server Secret= ");
+//    OCT_output(&SST);
+
+// TA sends Server secret to Server
+
+// Client extracts PIN from secret to create Token
+            //pin = 1234;
+            //printf("Client extracts PIN= %d\n", pin);
+            pin=0; printf("Client chooses PIN= ");
+            if (scanf("%d", &pin)) {}; // to avoid silly compile error
+            getchar();
+            MPIN_EXTRACT_PIN(&HCID, pin, &TOKEN);
+            printf("Client Token= ");
+            OCT_output(&TOKEN);
+
+// MPin Protocol
+
+// Client enters ID and PIN
+            OCT_clear(&CLIENT_ID);
+            OCT_jstring(&CLIENT_ID, (char *)"testUser@miracl.com");
+            MPIN_ENCODE_TO_CURVE(&DST,&CLIENT_ID,&HCID);
+            pin=0; printf("Client enters PIN= ");
+            if (scanf("%d", &pin)) {}; // to avoid silly compile error
+            getchar();
+
+// Client First pass: Inputs H(CLIENT_ID), RNG, pin, and TOKEN. Output x and U = x.H(CLIENT_ID) and re-combined secret SEC
+
+            if (MPIN_CLIENT_1(&HCID, RNG, &X, pin, &TOKEN, &SEC, &U) != 0)
+            {
+                printf("Error from Client side - First Pass\n");
+                return 1;
+            }
+
+// Send CLIENT_ID and U=x.ID to server. Server hashes ID to curve.
+                    MPIN_ENCODE_TO_CURVE(&DST,&CLIENT_ID,&HSID);
+
+// Server generates Random number Y and sends it to Client
+                    MPIN_RANDOM_GENERATE(RNG, &Y);
+
+// Client Second Pass: Inputs Client secret SEC, x and y. Sends -(x+y)*SEC to Server
+            if (MPIN_CLIENT_2(&X, &Y, &SEC) != 0)
+            {
+                printf("Error from Client side - Second Pass\n");
+                return 1;
+            }
+
+// Server Second phase. Inputs H(CLIENT_ID), Y, -(x+y)*SEC, U and Server secret SST. 
+
+                    rtn = MPIN_SERVER(&HSID, &Y, &SST, &U, &SEC);
+                    if (rtn != 0)
+                    {
+                        printf("Server says - Bad Pin.\n");
+                        return 1;
+                    }
+                    else
+                    {
+                        printf("Server says - PIN is good! You really are ");
+                        OCT_output_string(&CLIENT_ID);
+                        printf(".\n");
+                    }
+    printf("\n");
+    return 0;
+}
+
+int mpin192_BLS24479(csprng *RNG)
+{
+    using namespace BLS24479;
+    int pin, rtn;
+    char x[PGS_BLS24479], s[PGS_BLS24479], y[PGS_BLS24479], client_id[100], sst[8 * PFS_BLS24479 + 1], token[2 * PFS_BLS24479 + 1], sec[2 * PFS_BLS24479 + 1], u[2 * PFS_BLS24479 + 1];
+    char hcid[2*PFS_BLS24479+1], hsid[2*PFS_BLS24479+1], dst[256];
+
+    octet S = {0, sizeof(s), s};
+    octet X = {0, sizeof(x), x};
+    octet Y = {0, sizeof(y), y};
+    octet CLIENT_ID = {0, sizeof(client_id), client_id};
+    octet SST = {0, sizeof(sst), sst};
+    octet TOKEN = {0, sizeof(token), token};
+    octet SEC = {0, sizeof(sec), sec};
+    octet U = {0, sizeof(u), u};
+    octet HCID = {0, sizeof(hcid), hcid};
+    octet HSID = {0, sizeof(hsid), hsid};
+    octet DST = {0, sizeof(dst), dst};
+    OCT_jstring(&DST,(char *)"BLS24479G1_XMD:SHA-384_SVDW_NU_MPIN"); // Domain Separation Tag
+
+
+    // Trusted Authority (TA) set-up
+    MPIN_RANDOM_GENERATE(RNG, &S);
+    printf("Master Secret= ");
+    OCT_output(&S);
+
+// Client Identity
+            OCT_jstring(&CLIENT_ID, (char *)"testUser@miracl.com");
+            MPIN_ENCODE_TO_CURVE(&DST,&CLIENT_ID,&HCID);
+            printf("Client ID Hashed to Curve= ");
+            OCT_output(&HCID);
+//            printf("\n");
+
+// Client approaches Trusted Authority and is issued secret
+
+    MPIN_GET_CLIENT_SECRET(&S, &HCID, &TOKEN);
+    printf("Client Secret= ");
+    OCT_output(&TOKEN);
+
+// TA sends Client secret to Client
+
+// Server is issued secret by TA
+    MPIN_GET_SERVER_SECRET(&S, &SST);
+//    printf("Server Secret= ");
+//    OCT_output(&SST);
+
+// TA sends Server secret to Server
+
+// Client extracts PIN from secret to create Token
+            //pin = 1234;
+            //printf("Client extracts PIN= %d\n", pin);
+            pin=0; printf("Client chooses PIN= ");
+            if (scanf("%d", &pin)) {}; // to avoid silly compile error
+            getchar();
+            MPIN_EXTRACT_PIN(&HCID, pin, &TOKEN);
+            printf("Client Token= ");
+            OCT_output(&TOKEN);
+
+// MPin Protocol
+
+// Client enters ID and PIN
+            OCT_clear(&CLIENT_ID);
+            OCT_jstring(&CLIENT_ID, (char *)"testUser@miracl.com");
+            MPIN_ENCODE_TO_CURVE(&DST,&CLIENT_ID,&HCID);
+            pin=0; printf("Client enters PIN= ");
+            if (scanf("%d", &pin)) {}; // to avoid silly compile error
+            getchar();
+
+// Client First pass: Inputs H(CLIENT_ID), RNG, pin, and TOKEN. Output x and U = x.H(CLIENT_ID) and re-combined secret SEC
+
+            if (MPIN_CLIENT_1(&HCID, RNG, &X, pin, &TOKEN, &SEC, &U) != 0)
+            {
+                printf("Error from Client side - First Pass\n");
+                return 1;
+            }
+
+// Send CLIENT_ID and U=x.ID to server. Server hashes ID to curve.
+                    MPIN_ENCODE_TO_CURVE(&DST,&CLIENT_ID,&HSID);
+
+// Server generates Random number Y and sends it to Client
+                    MPIN_RANDOM_GENERATE(RNG, &Y);
+
+// Client Second Pass: Inputs Client secret SEC, x and y. Sends -(x+y)*SEC to Server
+            if (MPIN_CLIENT_2(&X, &Y, &SEC) != 0)
+            {
+                printf("Error from Client side - Second Pass\n");
+                return 1;
+            }
+
+// Server Second phase. Inputs H(CLIENT_ID), Y, -(x+y)*SEC, U and Server secret SST. 
+
+                    rtn = MPIN_SERVER(&HSID, &Y, &SST, &U, &SEC);
+                    if (rtn != 0)
+                    {
+                        printf("Server says - Bad Pin.\n");
+                        return 1;
+                    }
+                    else
+                    {
+                        printf("Server says - PIN is good! You really are ");
+                        OCT_output_string(&CLIENT_ID);
+                        printf(".\n");
+                    }
+    printf("\n");
+    return 0;
+}
+
+int mpin256_BLS48556(csprng *RNG)
+{
+    using namespace BLS48556;
+    int pin, rtn;
+    char x[PGS_BLS48556], s[PGS_BLS48556], y[PGS_BLS48556], client_id[100], sst[16 * PFS_BLS48556 + 1], token[2 * PFS_BLS48556 + 1], sec[2 * PFS_BLS48556 + 1], u[2 * PFS_BLS48556 + 1];
+    char hcid[2*PFS_BLS48556+1], hsid[2*PFS_BLS48556+1], dst[256];
+
+    octet S = {0, sizeof(s), s};
+    octet X = {0, sizeof(x), x};
+    octet Y = {0, sizeof(y), y};
+    octet CLIENT_ID = {0, sizeof(client_id), client_id};
+    octet SST = {0, sizeof(sst), sst};
+    octet TOKEN = {0, sizeof(token), token};
+    octet SEC = {0, sizeof(sec), sec};
+    octet U = {0, sizeof(u), u};
+    octet HCID = {0, sizeof(hcid), hcid};
+    octet HSID = {0, sizeof(hsid), hsid};
+    octet DST = {0, sizeof(dst), dst};
+    OCT_jstring(&DST,(char *)"BLS48556G1_XMD:SHA-512_SVDW_NU_MPIN"); // Domain Separation Tag
+
+
+    // Trusted Authority (TA) set-up
+    MPIN_RANDOM_GENERATE(RNG, &S);
+    printf("Master Secret= ");
+    OCT_output(&S);
+
+// Client Identity
+            OCT_jstring(&CLIENT_ID, (char *)"testUser@miracl.com");
+            MPIN_ENCODE_TO_CURVE(&DST,&CLIENT_ID,&HCID);
+            printf("Client ID Hashed to Curve= ");
+            OCT_output(&HCID);
+//            printf("\n");
+
+// Client approaches Trusted Authority and is issued secret
+
+    MPIN_GET_CLIENT_SECRET(&S, &HCID, &TOKEN);
+    printf("Client Secret= ");
+    OCT_output(&TOKEN);
+
+// TA sends Client secret to Client
+
+// Server is issued secret by TA
+    MPIN_GET_SERVER_SECRET(&S, &SST);
+//    printf("Server Secret= ");
+//    OCT_output(&SST);
+
+// TA sends Server secret to Server
+
+// Client extracts PIN from secret to create Token
+            //pin = 1234;
+            //printf("Client extracts PIN= %d\n", pin);
+            pin=0; printf("Client chooses PIN= ");
+            if (scanf("%d", &pin)) {}; // to avoid silly compile error
+            getchar();
+            MPIN_EXTRACT_PIN(&HCID, pin, &TOKEN);
+            printf("Client Token= ");
+            OCT_output(&TOKEN);
+
+// MPin Protocol
+
+// Client enters ID and PIN
+            OCT_clear(&CLIENT_ID);
+            OCT_jstring(&CLIENT_ID, (char *)"testUser@miracl.com");
+            MPIN_ENCODE_TO_CURVE(&DST,&CLIENT_ID,&HCID);
+            pin=0; printf("Client enters PIN= ");
+            if (scanf("%d", &pin)) {}; // to avoid silly compile error
+            getchar();
+
+// Client First pass: Inputs H(CLIENT_ID), RNG, pin, and TOKEN. Output x and U = x.H(CLIENT_ID) and re-combined secret SEC
+
+            if (MPIN_CLIENT_1(&HCID, RNG, &X, pin, &TOKEN, &SEC, &U) != 0)
+            {
+                printf("Error from Client side - First Pass\n");
+                return 1;
+            }
+
+// Send CLIENT_ID and U=x.ID to server. Server hashes ID to curve.
+                    MPIN_ENCODE_TO_CURVE(&DST,&CLIENT_ID,&HSID);
+
+// Server generates Random number Y and sends it to Client
+                    MPIN_RANDOM_GENERATE(RNG, &Y);
+
+// Client Second Pass: Inputs Client secret SEC, x and y. Sends -(x+y)*SEC to Server
+            if (MPIN_CLIENT_2(&X, &Y, &SEC) != 0)
+            {
+                printf("Error from Client side - Second Pass\n");
+                return 1;
+            }
+
+// Server Second phase. Inputs H(CLIENT_ID), Y, -(x+y)*SEC, U and Server secret SST. 
+
+                    rtn = MPIN_SERVER(&HSID, &Y, &SST, &U, &SEC);
+                    if (rtn != 0)
+                    {
+                        printf("Server says - Bad Pin.\n");
+                        return 1;
+                    }
+                    else
+                    {
+                        printf("Server says - PIN is good! You really are ");
+                        OCT_output_string(&CLIENT_ID);
+                        printf(".\n");
+                    }
+    printf("\n");
+    return 0;
+}
+#endif
+
+int main()
+{
+    int i, res;
+    unsigned long ran;
+
+    char raw[100];
+    octet RAW = {0, sizeof(raw), raw};
+    csprng RNG;                // Crypto Strong RNG
+
+    time((time_t *)&ran);
+
+    RAW.len = 100;              // fake random seed source
+    RAW.val[0] = ran;
+    RAW.val[1] = ran >> 8;
+    RAW.val[2] = ran >> 16;
+    RAW.val[3] = ran >> 24;
+    for (i = 0; i < 100; i++) RAW.val[i] = i;
+
+    CREATE_CSPRNG(&RNG, &RAW);  // initialise strong RNG
+
+    printf("\nTesting MPIN 2-factor authentication protocol on curve BN254\n");
+    mpin_BN254(&RNG);
+
+#if CHUNK!=16
+    printf("\nTesting MPIN 2-factor authentication protocol on curve BLS12383\n");
+    mpin_BLS12383(&RNG);
+    printf("\nTesting MPIN 2-factor authentication protocol on curve BLS24479\n");
+    mpin192_BLS24479(&RNG);
+    printf("\nTesting MPIN 2-factor authentication protocol on curve BLS48556\n");
+    mpin256_BLS48556(&RNG);
+#endif
+
+    KILL_CSPRNG(&RNG);
+}
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/testnhs b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/testnhs
new file mode 100644
index 0000000..21270d4
Binary files /dev/null and b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/testnhs differ
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/testnhs.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/testnhs.cpp
new file mode 100644
index 0000000..31478ac
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/testnhs.cpp
@@ -0,0 +1,76 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* test driver and function exerciser for NewHope Functions */
+
+// See https://eprint.iacr.org/2016/1157 (Alkim, Ducas, Popplemann and Schwabe)
+
+/* gcc -O2 testnhs.c core.a -o testnhs.exe */
+
+#include <stdio.h>
+#include <time.h>
+#include "newhope.h"
+
+using namespace core;
+
+int main()
+{
+    int i, ii, j, err;
+    unsigned long ran;
+    char raw[100];
+    csprng SRNG, CRNG;
+    RAND_clean(&SRNG); RAND_clean(&CRNG);
+    char s[1792], sb[1824], uc[2176], keyA[32], keyB[32];
+
+    octet S = {0, sizeof(s), s};
+    octet SB = {0, sizeof(sb), sb};
+    octet UC = {0, sizeof(uc), uc};
+    octet KEYA = {0, sizeof(keyA), keyA};
+    octet KEYB = {0, sizeof(keyB), keyB};
+
+    printf("\nTesting New Hope Key Exchange\n");
+
+// initialise random number generators
+    time((time_t *)&ran);
+
+    raw[0] = ran;
+    raw[1] = ran >> 8;
+    raw[2] = ran >> 16;
+    raw[3] = ran >> 24;
+
+    for (i = 4; i < 100; i++) raw[i] = i + 1;
+    RAND_seed(&SRNG, 100, raw);
+    for (i = 4; i < 100; i++) raw[i] = i + 2;
+    RAND_seed(&CRNG, 100, raw);
+
+// NewHope Simple key exchange - see https://eprint.iacr.org/2016/1157.pdf Protocol 1
+
+    NHS_SERVER_1(&SRNG, &SB, &S);
+    NHS_CLIENT(&CRNG, &SB, &UC, &KEYB);
+    NHS_SERVER_2(&S, &UC, &KEYA);
+
+    printf("Alice key= 0x");
+    OCT_output(&KEYA);
+    printf("Bob's key= 0x");
+    OCT_output(&KEYB);
+
+    return 0;
+}
+
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/testx509.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/testx509.cpp
new file mode 100644
index 0000000..c6381e3
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/testx509.cpp
@@ -0,0 +1,504 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+// To run test program 
+// g++ -O2 testx509.cpp  core.a -o testx509
+
+#include <stdio.h>
+#include "core.h"  // for octet support only
+#include "x509.h"
+
+// assumes library support for all of these
+#include "eddsa_Ed448.h"
+#include "eddsa_Ed25519.h"
+#include "ecdh_NIST256.h"
+#include "ecdh_NIST521.h"
+#include "rsa_RSA4096.h"
+#include "rsa_RSA2048.h"
+
+/* This simple driver program is hard-wired to support just one elliptic curve and one
+   RSA bit length. To change replace the text string NIST256 in the main program to
+   another curve and 2048 to some other value, where the curve and the RSA bit length
+   are suppported by the library. Of course a more elaborate program could support
+   muliple curves simultaneously */
+
+#define CHOICE USE_NIST256
+
+/* test driver program */
+// Sample Certs. Uncomment one CA cert and one example cert. Note that CORE library must be built to support given curve.
+// Sample Certs all created using OpenSSL - see http://blog.didierstevens.com/2008/12/30/howto-make-your-own-cert-with-openssl/
+// Note - SSL currently only supports NIST curves. Howevever version 1.1.0 of OpenSSL now supports C25519
+
+#if CHOICE==USE_NIST256
+
+// ** CA is RSA 2048-bit based - for use with NIST256 build of library - assumes use of SHA256 in Certs
+// RSA 2048 Self-Signed CA cert
+char ca_b64[] = "MIIDuzCCAqOgAwIBAgIJAP44jcM1MOROMA0GCSqGSIb3DQEBCwUAMHQxCzAJBgNVBAYTAklFMRAwDgYDVQQIDAdJcmVsYW5kMQ8wDQYDVQQHDAZEdWJsaW4xITAfBgNVBAoMGEludGVybmV0IFdpZGdpdHMgUHR5IEx0ZDEfMB0GCSqGSIb3DQEJARYQbXNjb3R0QGluZGlnby5pZTAeFw0xNTExMjYwOTUwMzlaFw0yMDExMjUwOTUwMzlaMHQxCzAJBgNVBAYTAklFMRAwDgYDVQQIDAdJcmVsYW5kMQ8wDQYDVQQHDAZEdWJsaW4xITAfBgNVBAoMGEludGVybmV0IFdpZGdpdHMgUHR5IEx0ZDEfMB0GCSqGSIb3DQEJARYQbXNjb3R0QGluZGlnby5pZTCCASIwDQYJKoZIhvcNAQEBBQADggEPADCCAQoCggEBANUs7/nri9J8zw8rW8JVszXP0ZqeLoQJaq2X28ebm8x5VT3okr9rnBjFjpx0YKQCAFQf8iSOOYuNpDvtZ/YpsjPbk2rg5sLY9G0eUMqrTuZ7moPSxnrXS5evizjD9Z9HqaqeNEYD3sPouPg+lhU1oAUQjUTJVFhEr1x0EnSEYbbrWtY9ZDSuZv+d4NIeqqPOYFd1yZc+LYZyQbAAQqwRLNPZH/rnIykLa6I7w7mGT7H6SBz2O09BtgpTHhalL40ecXa4ZOEze0xwzlc+mEFIrnmdadg3vQrJt42RVbo3LN6RfDIqUZOMOtQW/53pUR1lIpCwVWJTiOpmSEIEqhhjFq0CAwEAAaNQME4wHQYDVR0OBBYEFJrz6LHeT6FcjRahpUC3hAMxKRTCMB8GA1UdIwQYMBaAFJrz6LHeT6FcjRahpUC3hAMxKRTCMAwGA1UdEwQFMAMBAf8wDQYJKoZIhvcNAQELBQADggEBADqkqCYVa3X8XO9Ufu6XIUoZafFPRjSeJXvEIWqlbm7ixJZ2FPOvf2eMc5RCZYigNKhsxru5Ojw0lPcpa8DDmEsdZDf7p0vlmf7T7xH9gtoInh4DzgI8HRHFc8R/z2/jLX7nlLoopKX5yp7F1gRACg0pd4tGpQ6EnBNcYZZghFH9UIRDmx+vDlwDCu8vyRPt35orrEiI4XGq/QkvxxAb5YWxQ4i06064ULfyCI7suu3KoobdM1aAaA8zhpOOBXKbq+Wi9IGFe/wiEMHLmfHdt9CBTjIWb//IHji4RT05kCmTVrx97pb7EHafuL3L10mM5cpTyBWKnb4kMFtx9yw+S2U=";
+// an RSA 2048 CA-signed cert
+//char cert_b64[]="MIIDcjCCAloCAQEwDQYJKoZIhvcNAQELBQAwdDELMAkGA1UEBhMCSUUxEDAOBgNVBAgMB0lyZWxhbmQxDzANBgNVBAcMBkR1YmxpbjEhMB8GA1UECgwYSW50ZXJuZXQgV2lkZ2l0cyBQdHkgTHRkMR8wHQYJKoZIhvcNAQkBFhBtc2NvdHRAaW5kaWdvLmllMB4XDTE1MTEyNjEwMzQzMFoXDTE3MTEyNTEwMzQzMFowgYkxCzAJBgNVBAYTAklFMRAwDgYDVQQIDAdJcmVsYW5kMQ8wDQYDVQQHDAZEdWJsaW4xETAPBgNVBAoMCENlcnRpVm94MQ0wCwYDVQQLDARMYWJzMQ0wCwYDVQQDDARNSUtFMSYwJAYJKoZIhvcNAQkBFhdtaWtlLnNjb3R0QGNlcnRpdm94LmNvbTCCASIwDQYJKoZIhvcNAQEBBQADggEPADCCAQoCggEBAMIoxaQHFQzfyNChrw+3i7FjRFMHZ4zspkjkAcJW21LdBCqrxU+sdjyBoSFlrlafQOHshbrEP93AKX1bfaYbuV4fzq7OlRaLxaK+b+xrOJdewMI2WZ5OwEzj3onZATISogIoB6dTdzJ41NuxuMqQ/DqOnVrRA0SoIespbQhB8FGHBLw0hJATBzUk+bqOIt0HmnMp2EbYgtuG4lYINU/lD3Qt16SunUukWRLtxqJkioie+dkhP2zm+bOlSVmeQb4Wp8AI14OKkTfkdYC8qCxb5eabg90Q33rQUhNwRQHhHwopZwD/BgodasoSrPfwUlj0awh6y87eMGcik5Q/mjkCk5MCAwEAATANBgkqhkiG9w0BAQsFAAOCAQEAFrd7R/67ClkbLhpiX++6QTOa47siUAB9v+Qil9hZfhPNeeM589ixYkD4zH5pOK2B0ea+CXEKkanQ6lXx9KV86yS7fq6Yww7wO0diecusHd0+P82i46Tq0nm8nlsnAuhYoFRUGa2m2DkB1HSsB0ts8DjzFLySonFjSSLHDU0ox9/uFbJMzipy3ijAA4XM0N4jRrUfrmxpA7DOOsbEbGkvvB7VK9+s9PHE/4dJTwhSteplUnhxVFkkDo/JwaLx4/IEQRlCF3KEQ5s3AwRHnbrIjOY2yONxHBtJEp7QN5aOHruwvMNRNheCBPiQJyLitUsFGr4voANmobkrFgYtu0tRMQ==";
+// an ECDSA 256 CA-signed cert
+char cert_b64[] = "MIICojCCAYoCAQMwDQYJKoZIhvcNAQELBQAwdDELMAkGA1UEBhMCSUUxEDAOBgNVBAgMB0lyZWxhbmQxDzANBgNVBAcMBkR1YmxpbjEhMB8GA1UECgwYSW50ZXJuZXQgV2lkZ2l0cyBQdHkgTHRkMR8wHQYJKoZIhvcNAQkBFhBtc2NvdHRAaW5kaWdvLmllMB4XDTE1MTEyNjEzNDcyOVoXDTE3MTEyNTEzNDcyOVowgYQxCzAJBgNVBAYTAklFMRAwDgYDVQQIDAdJcmVsYW5kMQ8wDQYDVQQHDAZEdWJsaW4xETAPBgNVBAoMCENlcnRpdm94MQ0wCwYDVQQLDARMYWJzMQ8wDQYDVQQDDAZtc2NvdHQxHzAdBgkqhkiG9w0BCQEWEG1zY290dEBpbmRpZ28uaWUwWTATBgcqhkjOPQIBBggqhkjOPQMBBwNCAATO2iZiQZsXxzwBKnufKfZcsctNXZ4PmfJm638PmX9DQ3Xdb+nD5VxiOakNcB9xf5im8CriiOF5Z/7yPGyzUMbdMA0GCSqGSIb3DQEBCwUAA4IBAQAK5fMgGCCiPts8hMUZvYDpu8hd7qtPKPBc10QUccHb7PGrhqf/Ex2Gpj1aaURmx7SGZG0HX97LtkdW8KQpEoyaa60r7cjVA589TznxXKSGg5ggVoFJNpuZUm7VcolLjwIgTxtGbPzrvVMiZ4cl4PwFePXVKTl4f8XkOFX5gLmVSuCf729lEBmpx3IzqGmTjmnBixaApUElOKVeL7hiUKP3TqMUxZN+QNJBq4Mh9K9h4Sks2oneLwBwhMqQvpmcOb/7SucJn5N0IgJoGaMbfX0oCJJID1NSbagUSbFD1XciR2Ng9VtvnRP+htmEQ7jtww8phFdrWt5M5zPGOHUppqDx";
+
+// ** CA is ECC 256 based  - for use with NIST256 build of library
+// ECDSA 256 Self-Signed CA cert
+//char ca_b64[]="MIIB7TCCAZOgAwIBAgIJANp4nGS/VYj2MAoGCCqGSM49BAMCMFMxCzAJBgNVBAYTAklFMRAwDgYDVQQIDAdJcmVsYW5kMQ8wDQYDVQQHDAZEdWJsaW4xITAfBgNVBAoMGEludGVybmV0IFdpZGdpdHMgUHR5IEx0ZDAeFw0xNTExMjYxMzI0MTBaFw0yMDExMjUxMzI0MTBaMFMxCzAJBgNVBAYTAklFMRAwDgYDVQQIDAdJcmVsYW5kMQ8wDQYDVQQHDAZEdWJsaW4xITAfBgNVBAoMGEludGVybmV0IFdpZGdpdHMgUHR5IEx0ZDBZMBMGByqGSM49AgEGCCqGSM49AwEHA0IABPb6IjYNKyfbEtL1aafzW1jrn6ALn3PnGm7AyX+pcvwG0GKmb3Z/uHzhT4GysNE0/GB1n4Y/mrORQIm2X98rRs6jUDBOMB0GA1UdDgQWBBSfXUNkgJVklIhuXq4DCnVYhsdzwDAfBgNVHSMEGDAWgBSfXUNkgJVklIhuXq4DCnVYhsdzwDAMBgNVHRMEBTADAQH/MAoGCCqGSM49BAMCA0gAMEUCIQDrZJ1tshwTl/jabU2i49EOgbWe0ZgE3QZywJclf5IVwwIgVmz79AAf7e098lyrOKYAqbwjHVyMZGfmkNNGIuIhp/Q=";
+// an ECDSA 256 CA-signed cert
+//char cert_b64[]="MIIBvjCCAWQCAQEwCgYIKoZIzj0EAwIwUzELMAkGA1UEBhMCSUUxEDAOBgNVBAgMB0lyZWxhbmQxDzANBgNVBAcMBkR1YmxpbjEhMB8GA1UECgwYSW50ZXJuZXQgV2lkZ2l0cyBQdHkgTHRkMB4XDTE1MTEyNjEzMjc1N1oXDTE3MTEyNTEzMjc1N1owgYIxCzAJBgNVBAYTAklFMRAwDgYDVQQIDAdJcmVsYW5kMQ8wDQYDVQQHDAZEdWJsaW4xETAPBgNVBAoMCENlcnRpdm94MQ0wCwYDVQQLDARMYWJzMQ0wCwYDVQQDDARtaWtlMR8wHQYJKoZIhvcNAQkBFhBtc2NvdHRAaW5kaWdvLmllMFkwEwYHKoZIzj0CAQYIKoZIzj0DAQcDQgAEY42H52TfWMLueKB1o2Sq8uKaKErbHJ2GRAxrnJdNxex0hxZF5FUx7664BbPUolKhpvKTnJxDq5/gMqXzpKgR6DAKBggqhkjOPQQDAgNIADBFAiEA0ew08Xg32g7BwheslVKwXo9XRRx4kygYha1+cn0tvaUCIEKCEwnosZlAckjcZt8aHN5zslE9K9Y7XxTErTstthKc";
+// an RSA 2048 CA-signed cert
+//char cert_b64[]="MIICiDCCAi4CAQIwCgYIKoZIzj0EAwIwUzELMAkGA1UEBhMCSUUxEDAOBgNVBAgMB0lyZWxhbmQxDzANBgNVBAcMBkR1YmxpbjEhMB8GA1UECgwYSW50ZXJuZXQgV2lkZ2l0cyBQdHkgTHRkMB4XDTE1MTEyNjEzMzcwNVoXDTE3MTEyNTEzMzcwNVowgYExCzAJBgNVBAYTAklFMQ8wDQYDVQQIDAZJZWxhbmQxDzANBgNVBAcMBkR1YmxpbjERMA8GA1UECgwIQ2VydGl2b3gxDTALBgNVBAsMBExhYnMxDTALBgNVBAMMBE1pa2UxHzAdBgkqhkiG9w0BCQEWEG1zY290dEBpbmRpZ28uaWUwggEiMA0GCSqGSIb3DQEBAQUAA4IBDwAwggEKAoIBAQCjPBVwmPg8Gwx0+8xekmomptA0BDwS7NUfBetqDqNMNyji0bSe8LAfpciU7NW/HWfUE1lndCqSDDwnMJmwC5e3GAl/Bus+a+z8ruEhWGbn95xrHXFkOawbRlXuS7UcEQCvPr8KQHhNsg4cyV7Hn527CPUl27n+WN8/pANo01cTN/dQaK87naU0Mid09vktlMKSN0zyJOnc5CsaTLs+vCRKJ9sUL3d4IQIA2y7gvrTe+iY/QI26nqhGpNWYyFkAdy9PdHUEnDI6JsfF7jFh37yG7XEgDDA3asp/oi1T1+ZoASj2boL++opdqCzDndeWwzDWAWuvJ9wULd80ti6x737ZAgMBAAEwCgYIKoZIzj0EAwIDSAAwRQIgCDwgl98+9moBo+etaLt8MvB/z5Ti6i9neRTZkvoFl7YCIQDq//M3OB757fepErRzIQo3aFAFYjOooi6WdSqP3XqGIg==";
+
+#endif
+
+#if CHOICE==USE_ED25519
+
+// **CA is EDDSA Ed25519 based. Self-signed cert
+char ca_b64[]= "MIIBRTCB+KADAgECAhNBrGyCRdfc0WyPpPd+LB8LEiK4MAUGAytlcDAZMRcwFQYDVQQDDA5NaWtlJ3Mgcm9vdCBDQTAeFw0yMzA1MDExNjAwMDlaFw0yNDA0MzAxNjAwMDlaMBkxFzAVBgNVBAMMDk1pa2UncyByb290IENBMCowBQYDK2VwAyEAh8YXRWdICdF8CcR1P0RCO4xD+s5i8Pzpq8KHid/TQaajUzBRMB0GA1UdDgQWBBQAS56sNYWyao4k6DS/M81i+wqjIzAfBgNVHSMEGDAWgBQAS56sNYWyao4k6DS/M81i+wqjIzAPBgNVHRMBAf8EBTADAQH/MAUGAytlcANBAJWIicxVB6ynhjjkJgNtcL/kmixU7l/V1j/N0AtenDgT+yrMhDW9n9JC+Ze5qpX3Eu3VkdkpN3G9anmBXp3LtAk=";
+// EDDSA Ed25519 CA-signed Cert
+char cert_b64[]="MIHdMIGQAgEBMAUGAytlcDAZMRcwFQYDVQQDDA5NaWtlJ3Mgcm9vdCBDQTAeFw0yMzA1MDExNjA1NDhaFw0yNDA0MzAxNjA1NDhaMB0xGzAZBgNVBAMMEk1pa2UncyBzZXJ2ZXIgY2VydDAqMAUGAytlcAMhANvhwg8UhnGMGt0bKoGt5IHkvHwyEwWj4GkLQ7XIqJeVMAUGAytlcANBAESWzTJbz/YVwLFrDKVqYxHc86YGjPa8lekAC8UciIKu9d1Xoko3ssfhNiXkYkl3M0yEnIkD2F2DfGKbt8LSmQE=";
+
+#endif
+
+#if CHOICE==USE_ED448
+
+// **CA is EDDSA Ed448 based. Self-signed cert
+char ca_b64[]= "MIIBkjCCARKgAwIBAgIUWnfFe8sR7CGIz3eN1CfyHdTz14kwBQYDK2VxMBkxFzAVBgNVBAMMDk1pa2UncyByb290IENBMB4XDTIzMDUwMTE2NDQxMloXDTI0MDQzMDE2NDQxMlowGTEXMBUGA1UEAwwOTWlrZSdzIHJvb3QgQ0EwQzAFBgMrZXEDOgACd4YB/lGYUck4KxQMJ+lshkHnBuigmwPALPQGARv26SK/EOi0DIMMpyp3oG+pnPpnqbqtDtesCYCjUzBRMB0GA1UdDgQWBBRygDXbx5h57oo1D91LitQV2PE2dzAfBgNVHSMEGDAWgBRygDXbx5h57oo1D91LitQV2PE2dzAPBgNVHRMBAf8EBTADAQH/MAUGAytlcQNzAI17NGvKrGAH5hKLUHC1+Qv5RvT4IKlWg5GnRGTccc5tCrimveoMbu2KTlNXaOHS8y/sZT1qddukAFLzR/1ehZqOnYLM7dwlgYdksAx0olo5+/MYfj3hw5noh1pMObnJREfTPTSg1gqFI+gObB1UoSsBAA=="; 
+// EDDSA Ed448 CA-signed Cert
+char cert_b64[]="MIIBIzCBpAIBATAFBgMrZXEwGTEXMBUGA1UEAwwOTWlrZSdzIHJvb3QgQ0EwHhcNMjMwNTAxMTY0NjQzWhcNMjQwNDMwMTY0NjQzWjAYMRYwFAYDVQQDDA1NaWtlJ3Mgc2VydmVyMEMwBQYDK2VxAzoAgYh3CQP+EgId5/TZjAsuxh7Y9nPYtN5CYeN8vLjPuRqQncja3MyhRJaOrUEKSnBK+zYbkdXMQQwAMAUGAytlcQNzAPcm8DVSRZA1r0QqsSsHv6xBy1ASaoz4RFyelFMUD4f6ERMaxTzs0LKQHtcx5G9vqOxvQyCgkEu2AOcUQLtEXcoOSLH8fy0+5yEbbs6uPA1hi/oGpy580SR/5K5odY35fe1kwhz9YUvT4suTRHocnpcsAA==";
+#endif
+
+char io[5000];
+octet IO = {0, sizeof(io), io};
+
+#define MAXMODBYTES 72
+#define MAXFFLEN 16
+
+char sig[MAXMODBYTES * MAXFFLEN];
+octet SIG = {0, sizeof(sig), sig};
+
+char r[MAXMODBYTES];
+octet R = {0, sizeof(r), r};
+
+char s[MAXMODBYTES];
+octet S = {0, sizeof(s), s};
+
+char cakey[MAXMODBYTES * MAXFFLEN];
+octet CAKEY = {0, sizeof(cakey), cakey};
+
+char certkey[MAXMODBYTES * MAXFFLEN];
+octet CERTKEY = {0, sizeof(certkey), certkey};
+
+char h[5000];
+octet H = {0, sizeof(h), h};
+
+char hh[5000];
+octet HH = {0, sizeof(hh), hh};
+
+char hp[RFS_RSA2048];
+octet HP = {0, sizeof(hp), hp};
+
+
+void print_out(char *des, octet *c, int index, int len)
+{
+    int i;
+    printf("%s [", des);
+    for (i = 0; i < len; i++)
+        printf("%c", c->val[index + i]);
+    printf("]\n");
+}
+
+void print_date(char *des, octet *c, int index)
+{
+    int i = index;
+    printf("%s [", des);
+    if (i == 0) printf("]\n");
+    else printf("20%c%c-%c%c-%c%c %c%c:%c%c:%c%c]\n", c->val[i], c->val[i + 1], c->val[i + 2], c->val[i + 3], c->val[i + 4], c->val[i + 5], c->val[i + 6], c->val[i + 7], c->val[i + 8], c->val[i + 9], c->val[i + 10], c->val[i + 11]);
+}
+
+int main()
+{
+    int res, len, sha;
+    int c, ic;
+    RSA2048::rsa_public_key PK;
+    pktype st, ca, pt;
+
+    printf("First check signature on self-signed cert and extract CA public key\n");
+    OCT_frombase64(&IO, ca_b64);
+    printf("CA Self-Signed Cert= \n");
+    OCT_output(&IO);
+    printf("\n");
+
+    st = X509_extract_cert_sig(&IO, &SIG); // returns signature type
+
+    if (st.type == 0)
+    {
+        printf("Unable to extract cert signature\n");
+        return 0;
+    }
+
+    if (st.type == X509_ECC)
+    {
+        OCT_chop(&SIG, &S, SIG.len / 2);
+        OCT_copy(&R, &SIG);
+        printf("ECDSA SIG= \n");
+        OCT_output(&R);
+        OCT_output(&S);
+        printf("\n");
+    }
+
+    if (st.type == X509_ECD)
+    {
+        printf("EDDSA SIG= \n");
+        OCT_output(&SIG);
+        printf("\n");
+    }
+
+    if (st.type == X509_RSA)
+    {
+        printf("RSA SIG= \n");
+        OCT_output(&SIG);
+        printf("\n");
+    }
+
+    if (st.hash == X509_H256) printf("Hashed with SHA256\n");
+    if (st.hash == X509_H384) printf("Hashed with SHA384\n");
+    if (st.hash == X509_H512) printf("Hashed with SHA512\n");
+
+// Extract Cert from signed Cert
+
+    c = X509_extract_cert(&IO, &H);
+
+    printf("\nCert= \n");
+    OCT_output(&H);
+    printf("\n");
+
+// show some details
+    printf("Issuer Details\n");
+    ic = X509_find_issuer(&H,&len);
+    c = X509_find_entity_property(&H, &X509_ON, ic, &len);
+    print_out((char *)"owner=", &H, c, len);
+    c = X509_find_entity_property(&H, &X509_CN, ic, &len);
+    print_out((char *)"country=", &H, c, len);
+    c = X509_find_entity_property(&H, &X509_EN, ic, &len);
+    print_out((char *)"email=", &H, c, len);
+    c = X509_find_entity_property(&H, &X509_MN, ic, &len);
+    print_out((char *)"Common Name=", &H, c, len);
+    printf("\n");
+
+    ca = X509_extract_public_key(&H, &CAKEY);
+
+    if (ca.type == 0)
+    {
+        printf("Not supported by library\n");
+        return 0;
+    }
+    //if (ca.type != st.type)
+    if (!X509_self_signed(&H))
+    {
+        printf("Not self-signed\n");
+    }
+
+    if (ca.type == X509_ECD)
+    {
+        printf("EXTRACTED EDDSA PUBLIC KEY= \n");
+        OCT_output(&CAKEY);
+    }
+    if (ca.type == X509_ECC)
+    {
+        printf("EXTRACTED ECDSA PUBLIC KEY= \n");
+        OCT_output(&CAKEY);
+    }
+    if (ca.type == X509_RSA)
+    {
+        printf("EXTRACTED RSA PUBLIC KEY= \n");
+        OCT_output(&CAKEY);
+    }
+    printf("\n");
+
+// Cert is self-signed - so check signature
+
+    printf("Checking Self-Signed Signature\n");
+    if (ca.type == X509_ECC)
+    {
+        if (ca.curve != CHOICE)
+        {
+            printf("Curve is not supported\n");
+            return 0;
+        }
+        res = NIST256::ECP_PUBLIC_KEY_VALIDATE(&CAKEY);
+        if (res != 0)
+        {
+            printf("ECP Public Key is invalid!\n");
+            return 0;
+        }
+        else printf("ECP Public Key is Valid\n");
+
+        sha = 0;
+
+        if (st.hash == X509_H256) sha = SHA256;
+        if (st.hash == X509_H384) sha = SHA384;
+        if (st.hash == X509_H512) sha = SHA512;
+        if (sha == 0)
+        {
+            printf("Hash Function not supported\n");
+            return 0;
+        }
+
+        if (NIST256::ECP_VP_DSA(sha, &CAKEY, &H, &R, &S) != 0)
+        {
+            printf("***ECDSA Verification Failed\n");
+            return 0;
+        }
+        else
+            printf("ECDSA Signature/Verification succeeded \n");
+    }
+
+    if (ca.type == X509_ECD)
+    {
+        if (ca.curve != CHOICE)
+        {
+            printf("Curve is not supported %d\n",ca.curve);
+            return 0;
+        }
+        if (ca.curve == USE_ED25519)
+        {
+            if (!Ed25519::EDDSA_VERIFY(false,&CAKEY,NULL,&H,&SIG))
+            {
+                printf("***EDDSA Verification Failed\n");
+                return 0;
+            }
+            else
+                printf("EDDSA Signature/Verification succeeded \n");
+        }
+        if (ca.curve == USE_ED448)
+        {
+            if (!Ed448::EDDSA_VERIFY(false,&CAKEY,NULL,&H,&SIG))
+            {
+                printf("***EDDSA Verification Failed %d\n",SIG.len);
+                return 0;
+            }
+            else
+                printf("EDDSA Signature/Verification succeeded \n");
+        }
+    }
+    if (ca.type == X509_RSA)
+    {
+        if (ca.curve != 2048)
+        {
+            printf("RSA bit size is not supported\n");
+            return 0;
+        }
+        PK.e = 65537; // assuming this!
+        RSA2048::RSA_fromOctet(PK.n, &CAKEY);
+
+        sha = 0;
+
+        if (st.hash == X509_H256) sha = SHA256;
+        if (st.hash == X509_H384) sha = SHA384;
+        if (st.hash == X509_H512) sha = SHA512;
+        if (sha == 0)
+        {
+            printf("Hash Function not supported\n");
+            return 0;
+        }
+        core::PKCS15(sha, &H, &HP);
+
+        RSA2048::RSA_ENCRYPT(&PK, &SIG, &HH);
+
+        if (OCT_comp(&HP, &HH))
+            printf("RSA Signature/Verification succeeded \n");
+        else
+        {
+            printf("***RSA Verification Failed\n");
+            return 0;
+        }
+    }
+
+    printf("\nNext check CA signature on cert, and extract public key\n");
+
+    OCT_frombase64(&IO, cert_b64);
+    printf("Example Cert= \n");
+    OCT_output(&IO);
+    printf("\n");
+
+    st = X509_extract_cert_sig(&IO, &SIG);
+
+    if (st.type == 0)
+    {
+        printf("Unable to check cert signature\n");
+        return 0;
+    }
+
+    if (st.type == X509_ECC)
+    {
+        OCT_chop(&SIG, &S, SIG.len / 2);
+        OCT_copy(&R, &SIG);
+        printf("SIG= \n");
+        OCT_output(&R);
+
+        OCT_output(&S);
+
+        printf("\n");
+    }
+
+    if (st.type == X509_ECD)
+    {
+        printf("SIG= \n");
+        OCT_output(&SIG);
+        printf("\n");
+    }
+
+    if (st.type == X509_RSA)
+    {
+        printf("SIG= \n");
+        OCT_output(&SIG);
+        printf("\n");
+    }
+
+    c = X509_extract_cert(&IO, &H);
+
+    printf("Cert= \n");
+    OCT_output(&H);
+    printf("\n");
+
+    printf("Subject Details\n");
+    ic = X509_find_subject(&H,&len);
+    c = X509_find_entity_property(&H, &X509_ON, ic, &len);
+    print_out((char *)"owner=", &H, c, len);
+    c = X509_find_entity_property(&H, &X509_CN, ic, &len);
+    print_out((char *)"country=", &H, c, len);
+    c = X509_find_entity_property(&H, &X509_EN, ic, &len);
+    print_out((char *)"email=", &H, c, len);
+    c = X509_find_entity_property(&H, &X509_MN, ic, &len);
+    print_out((char *)"Common Name=", &H, c, len);
+    printf("\n");
+
+    ic = X509_find_validity(&H);
+    c = X509_find_start_date(&H, ic);
+    print_date((char *)"start date= ", &H, c);
+    c = X509_find_expiry_date(&H, ic);
+    print_date((char *)"expiry date=", &H, c);
+    printf("\n");
+
+    pt = X509_extract_public_key(&H, &CERTKEY);
+
+    if (pt.type == 0)
+    {
+        printf("Not supported by library\n");
+        return 0;
+    }
+
+    if (pt.type == X509_ECC)
+    {
+        printf("EXTRACTED ECDSA PUBLIC KEY= \n");
+        OCT_output(&CERTKEY);
+    }
+    if (pt.type == X509_ECD)
+    {
+        printf("EXTRACTED EDDSA PUBLIC KEY= \n");
+        OCT_output(&CERTKEY);
+    }
+    if (pt.type == X509_RSA)
+    {
+        printf("EXTRACTED RSA PUBLIC KEY= \n");
+        OCT_output(&CERTKEY);
+    }
+
+    printf("\n");
+
+    /* Check CA signature */
+
+    if (ca.type == X509_ECC)
+    {
+        printf("Checking CA's ECDSA Signature on Cert\n");
+        res = NIST256::ECP_PUBLIC_KEY_VALIDATE(&CAKEY);
+        if (res != 0)
+            printf("ECP Public Key is invalid!\n");
+        else printf("ECP Public Key is Valid\n");
+
+        sha = 0;
+
+        if (st.hash == X509_H256) sha = SHA256;
+        if (st.hash == X509_H384) sha = SHA384;
+        if (st.hash == X509_H512) sha = SHA512;
+        if (sha == 0)
+        {
+            printf("Hash Function not supported\n");
+            return 0;
+        }
+
+        if (NIST256::ECP_VP_DSA(sha, &CAKEY, &H, &R, &S) != 0)
+            printf("***ECDSA Verification Failed\n");
+        else
+            printf("ECDSA Signature/Verification succeeded \n");
+    }
+
+    if (ca.type == X509_ECD)
+    {
+        printf("Checking CA's EDDSA Signature on Cert\n");
+        if (ca.curve == USE_ED25519)
+        {
+            if (!Ed25519::EDDSA_VERIFY(false,&CAKEY,NULL,&H,&SIG))
+            {
+                printf("***EDDSA Verification Failed\n");
+                return 0;
+            }
+            else
+                printf("EDDSA Signature/Verification succeeded \n");
+        } 
+        if (ca.curve == USE_ED448)
+        {
+            if (!Ed448::EDDSA_VERIFY(false,&CAKEY,NULL,&H,&SIG))
+            {
+                printf("***EDDSA Verification Failed\n");
+                return 0;
+            }
+            else
+                printf("EDDSA Signature/Verification succeeded \n");
+        } 
+    }
+
+    if (ca.type == X509_RSA)
+    {
+        printf("Checking CA's RSA Signature on Cert\n");
+        PK.e = 65537; // assuming this!
+        RSA2048::RSA_fromOctet(PK.n, &CAKEY);
+
+        sha = 0;
+
+        if (st.hash == X509_H256) sha = SHA256;
+        if (st.hash == X509_H384) sha = SHA384;
+        if (st.hash == X509_H512) sha = SHA512;
+        if (sha == 0)
+        {
+            printf("Hash Function not supported\n");
+            return 0;
+        }
+        core::PKCS15(sha, &H, &HP);
+
+        RSA_ENCRYPT(&PK, &SIG, &HH);
+
+        if (OCT_comp(&HP, &HH))
+            printf("RSA Signature/Verification succeeded \n");
+        else
+            printf("***RSA Verification Failed\n");
+
+    }
+
+    return 0;
+}
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/x509.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/x509.cpp
new file mode 100644
index 0000000..ea0d07f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/x509.cpp
@@ -0,0 +1,1170 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* CORE X.509 Functions */
+
+#include <stdio.h>
+#include "core.h"  // for octet support only
+#include "x509.h"
+
+// Some ASN.1 tags
+
+#define ANY 0x00
+#define SEQ 0x30
+#define OID 0x06
+#define INT 0x02
+#define NUL 0x05
+#define ZER 0x00
+#define UTF 0x0C
+#define UTC 0x17
+#define GTM 0x18
+#define LOG 0x01
+#define BIT 0x03
+#define OCT 0x04
+#define STR 0x13
+#define SET 0x31
+#define IA5 0x16
+#define EXT 0xA3
+#define DNS 0x82
+
+// Define some OIDs
+
+// Elliptic Curve with SHA256
+static unsigned char eccsha256[8] = {0x2a, 0x86, 0x48, 0xce, 0x3d, 0x04, 0x03, 0x02};
+static octet ECCSHA256 = {8, sizeof(eccsha256), (char *)eccsha256};
+
+// Elliptic Curve with SHA384
+static unsigned char eccsha384[8] = {0x2a, 0x86, 0x48, 0xce, 0x3d, 0x04, 0x03, 0x03};
+static octet ECCSHA384 = {8, sizeof(eccsha384), (char *)eccsha384};
+
+// Elliptic Curve with SHA512
+static unsigned char eccsha512[8] = {0x2a, 0x86, 0x48, 0xce, 0x3d, 0x04, 0x03, 0x04};
+static octet ECCSHA512 = {8, sizeof(eccsha512), (char *)eccsha512};
+
+// EC Public Key - Elliptic curve public key cryptography
+static unsigned char ecpk[7] = {0x2a, 0x86, 0x48, 0xce, 0x3d, 0x02, 0x01};
+static octet ECPK = {7, sizeof(ecpk), (char *)ecpk};
+
+// ED25519 Public Key - Elliptic curve EdDSA (Ed25519) Signature
+static unsigned char edpk25519[3] = {0x2B, 0x65, 0x70};  
+static octet EDPK25519 = {3, sizeof(edpk25519),(char *)edpk25519};
+
+// ED448 Public Key - Elliptic curve EdDSA (Ed448) Signature
+static unsigned char edpk448[3] = {0x2B, 0x65, 0x71};  
+static octet EDPK448 = {3, sizeof(edpk448),(char *)edpk448};
+
+// C25519 curve
+static unsigned char prime25519[9] = {0x2B, 0x06, 0x01, 0x04, 0x01, 0xDA, 0x47, 0x0F, 0x01}; /*****/
+static octet PRIME25519 = {9, sizeof(prime25519), (char *)prime25519};
+
+// NIST256 curve - (NIST) P-256
+static unsigned char prime256v1[8] = {0x2a, 0x86, 0x48, 0xce, 0x3d, 0x03, 0x01, 0x07};
+static octet PRIME256V1 = {8, sizeof(prime256v1), (char *)prime256v1};
+
+// NIST384 curve
+static unsigned char secp384r1[5] = {0x2B, 0x81, 0x04, 0x00, 0x22};
+static octet SECP384R1 = {5, sizeof(secp384r1), (char *)secp384r1};
+
+// NIST521 curve
+static unsigned char secp521r1[5] = {0x2B, 0x81, 0x04, 0x00, 0x23};
+static octet SECP521R1 = {5, sizeof(secp521r1), (char *)secp521r1};
+
+// RSA Public Key - RSAES-PKCS1-v1_5
+static unsigned char rsapk[9] = {0x2a, 0x86, 0x48, 0x86, 0xf7, 0x0d, 0x01, 0x01, 0x01};
+static octet RSAPK = {9, sizeof(rsapk), (char *)rsapk};
+
+// RSA with SHA256
+static unsigned char rsasha256[9] = {0x2a, 0x86, 0x48, 0x86, 0xf7, 0x0d, 0x01, 0x01, 0x0b};
+static octet RSASHA256 = {9, sizeof(rsasha256), (char *)rsasha256};
+
+// RSA with SHA384
+static unsigned char rsasha384[9] = {0x2a, 0x86, 0x48, 0x86, 0xf7, 0x0d, 0x01, 0x01, 0x0c};
+static octet RSASHA384 = {9, sizeof(rsasha384), (char *)rsasha384};
+
+// RSA with SHA512
+static unsigned char rsasha512[9] = {0x2a, 0x86, 0x48, 0x86, 0xf7, 0x0d, 0x01, 0x01, 0x0d};
+static octet RSASHA512 = {9, sizeof(rsasha512), (char *)rsasha512};
+
+// DILITHIUM3
+static unsigned char dilithium3[11] = {0x2b, 0x06, 0x01, 0x04, 0x01, 0x02, 0x82, 0x0B, 0x07, 0x06, 0x05};
+static octet DILITHIUM3 = {11, sizeof(dilithium3), (char *)dilithium3};
+
+
+// Cert details
+// countryName
+static unsigned char cn[3] = {0x55, 0x04, 0x06};
+octet X509_CN = {3, sizeof(cn), (char *)cn};
+
+// stateName
+static char sn[3]= {0x55,0x04,0x08};
+octet X509_SN= {3,sizeof(sn),sn};
+
+// localName
+static char ln[3]= {0x55,0x04,0x07};
+octet X509_LN= {3,sizeof(ln),ln};
+
+// orgName
+static unsigned char on[3] = {0x55, 0x04, 0x0A};
+octet X509_ON = {3, sizeof(on), (char *)on};
+
+// unitName
+static char un[3]= {0x55,0x04,0x0B};
+octet X509_UN= {3,sizeof(un),un};
+
+// myName
+static char mn[3]= {0x55,0x04,0x03};
+octet X509_MN= {3,sizeof(mn),mn};
+
+// emailName
+static unsigned char en[9] = {0x2a, 0x86, 0x48, 0x86, 0xf7, 0x0d, 0x01, 0x09, 0x01};
+octet X509_EN = {9, sizeof(en), (char *)en};
+
+// Extensions
+// Alt Name
+static char an[3]={0x55,0x1D,0x11};
+octet X509_AN = {3, sizeof(an),an};
+
+// Key Usage
+static char ku[3]={0x55,0x1d,0x0f};
+octet X509_KU = {3,sizeof(ku),ku};
+
+// Basic Constraints
+static char bc[3]={0x55,0x1d,0x13};
+octet X509_BC = {3,sizeof(bc),bc};
+
+/* Check expected TAG and return ASN.1 field length. If tag=0 skip check. */
+static int getalen(int tag, char *b, int j)
+{
+    int len;
+
+    if (tag != 0 && (unsigned char)b[j] != tag) return -1; // not a valid tag
+    j++;
+
+    if ((unsigned char)b[j] == 0x81)
+    {
+        j++;
+        len = (unsigned char)b[j];
+    }
+    else if ((unsigned char)b[j] == 0x82)
+    {
+        j++;
+        len = 256 * b[j++];
+        len += (unsigned char)b[j];
+    }
+    else
+    {
+        len = (unsigned char)b[j];
+        if (len > 127) return -1;
+    }
+    return len;
+}
+
+/* jump over length field */
+static int skip(int len)
+{
+    if (len < 128) return 2;
+    if (len < 256) return 3;
+    return 4;
+}
+
+/* round length up to nearest 8-byte length */
+static int bround(int len)
+{
+    if (len % 8 == 0) return len;
+    return len + (8 - len % 8);
+
+}
+
+// Input private key in PKCS#8 format
+// e.g. openssl req -x509 -nodes -newkey rsa:4096 -keyout key.pem -out cert.pem -days 365
+// e.g. openssl req -x509 -nodes -days 3650 -newkey ec:<(openssl ecparam -name prime256v1) -keyout key.pem -out ecdsacert.pem
+// extract private key from uncompressed key.pem into octet
+// For RSA octet = p|q|dp|dq|c where pk->len is multiple of 5
+// For ECC octet = k
+pktype X509_extract_private_key(octet *c,octet *pk)
+{
+    int i, j, k, fin, len, rlen, flen, tlen, sj, ex;
+    char soid[12];
+    octet SOID = {0, sizeof(soid), soid};
+    pktype ret;
+
+    ret.type = 0;
+    ret.hash = 0;
+    j=0;
+
+    len = getalen(SEQ, c->val, j); // Check for expected SEQ clause, and get length
+    if (len < 0) return ret;        // if not a SEQ clause, there is a problem, exit
+    j += skip(len);                 // skip over length to clause contents. Add len to skip clause
+
+    if (len + j != c->len) return ret;
+
+    len = getalen(INT, c->val, j);
+    if (len < 0) return ret;
+    j += skip(len) + len; // jump over serial number clause (if there is one)
+
+    len = getalen(SEQ, c->val, j); 
+    if (len < 0) return ret;        
+    j += skip(len);
+
+// extract OID
+    len = getalen(OID, c->val, j);
+    if (len < 0) return ret;
+    j += skip(len);
+
+    fin = j + len;
+    if (len>SOID.max) return ret;
+    SOID.len = len;
+    for (i = 0; j < fin; j++)
+        SOID.val[i++] = c->val[j];
+    j=fin;
+
+    if (OCT_comp(&EDPK25519, &SOID))
+    { // Its an Ed25519 key
+        len = getalen(OCT, c->val, j);
+        if (len < 0) return ret;
+        j += skip(len);
+        len = getalen(OCT, c->val, j);
+        if (len < 0) return ret;
+        j += skip(len);
+        rlen=32;
+        if (rlen>pk->max) return ret;
+        pk->len=rlen;
+        for (i=0;i<rlen-len;i++)
+            pk->val[i]=0;
+        for (i=rlen-len;i<rlen;i++)
+            pk->val[i]=c->val[j++];
+        ret.type = X509_ECD;
+        ret.curve = USE_ED25519;
+    }
+    if (OCT_comp(&EDPK448, &SOID))
+    { // Its an Ed448 key
+        len = getalen(OCT, c->val, j);
+        if (len < 0) return ret;
+        j += skip(len);
+        len = getalen(OCT, c->val, j);
+        if (len < 0) return ret;
+        j += skip(len);
+        rlen=57;
+        if (rlen>pk->max) return ret;
+        pk->len=rlen;
+        for (i=0;i<rlen-len;i++)
+            pk->val[i]=0;
+        for (i=rlen-len;i<rlen;i++)
+            pk->val[i]=c->val[j++];
+        ret.type = X509_ECD;
+        ret.curve = USE_ED448;
+    }
+    if (OCT_comp(&DILITHIUM3, &SOID))
+    { // Its a DILITHIUM3 key
+        len = getalen(OCT, c->val, j);
+        if (len < 0) return ret;
+        j += skip(len);
+        len = getalen(OCT, c->val, j);
+        if (len < 0) return ret;
+        j += skip(len);
+        tlen=len; 
+        if (tlen>pk->max)
+            tlen=pk->max;
+        for (i=0;i<tlen;i++)
+            pk->val[i]=c->val[j++];
+        pk->len=tlen;
+        ret.type=X509_PQ;
+        ret.curve=8*tlen;
+    }
+    if (OCT_comp(&ECPK, &SOID))
+    { // Its an ECC key
+        len = getalen(OID, c->val, j);
+        if (len < 0) return ret;
+        j += skip(len);
+
+        fin = j + len;
+        if (len>SOID.max) return ret;
+        SOID.len = len;
+        for (i = 0; j < fin; j++)
+            SOID.val[i++] = c->val[j];
+        j=fin;           
+        
+        len = getalen(OCT, c->val, j);
+        if (len < 0) return ret;
+        j += skip(len);
+
+        len = getalen(SEQ, c->val, j); 
+        if (len < 0) return ret; 
+        j += skip(len);
+
+        len = getalen(INT, c->val, j);
+        if (len < 0) return ret;
+        j += skip(len) + len; // jump over version
+
+        len = getalen(OCT, c->val, j);
+        if (len < 0) return ret;
+        j += skip(len);
+
+        ret.type = X509_ECC;
+        if (OCT_comp(&PRIME256V1, &SOID)) {
+            ret.curve = USE_NIST256;
+            rlen=32;
+        }
+        if (OCT_comp(&SECP384R1, &SOID)) {
+            ret.curve = USE_NIST384;
+            rlen=48;
+        }
+        if (OCT_comp(&SECP521R1, &SOID)) {
+            rlen=66;
+            ret.curve = USE_NIST521;
+        }
+        if (rlen>pk->max)
+        {
+            ret.curve=0;
+            return ret;
+        }
+        pk->len=rlen;
+        for (i=0;i<rlen-len;i++)
+            pk->val[i]=0;
+        for (i=rlen-len;i<rlen;i++)
+            pk->val[i]=c->val[j++];
+
+    }
+    if (OCT_comp(&RSAPK, &SOID))
+    { // Its an RSA key
+        len = getalen(NUL, c->val, j);
+        if (len<0) return ret;
+        j += skip(len);
+
+        len = getalen(OCT, c->val, j);
+        if (len < 0) return ret;
+        j += skip(len);
+
+        len = getalen(SEQ, c->val, j); 
+        if (len < 0) return ret; 
+        j += skip(len);
+
+        len = getalen(INT, c->val, j);
+        if (len < 0) return ret;
+        j += skip(len) + len; // jump over version
+
+        len = getalen(INT, c->val, j);
+        if (len < 0) return ret;
+        j += skip(len) + len; // jump over n
+
+        len = getalen(INT, c->val, j);
+        if (len < 0) return ret;
+        j += skip(len) + len; // jump over e
+
+        len = getalen(INT, c->val, j);
+        if (len < 0) return ret;
+        j += skip(len) + len; // jump over d
+
+
+        len = getalen(INT, c->val, j);
+        if (len < 0) return ret;
+        j += skip(len); // get p
+
+        if (c->val[j] == 0)
+        { // skip leading zero
+            j++;
+            len--;
+        }
+        rlen=bround(len);
+
+        if (5*rlen>pk->max)
+            return ret;
+       
+        for (i=0;i<rlen-len;i++)
+            pk->val[i]=0;
+
+        for (i=rlen-len;i<rlen;i++)
+            pk->val[i]=c->val[j++];
+
+        flen=rlen;          // should be same length for all
+        for (k=1;k<5;k++)
+        {
+            len = getalen(INT,c->val,j);
+            if (len<0) return ret;
+            j += skip(len);  // get q,dp,dq,c
+            if (c->val[j] == 0)
+            { // skip leading zero
+                j++;
+                len--;
+            }
+            rlen=bround(len);
+            if (rlen!=flen) return ret;
+            for (i=0;i<rlen-len;i++)
+                pk->val[i]=0;
+            for (i=rlen-len;i<rlen;i++)
+                pk->val[k*flen+i]=c->val[j++];
+        }
+        pk->len=5*flen;
+        ret.type = X509_RSA;
+        ret.curve = 16 * flen;
+    }
+    return ret;
+}
+
+//  Input signed cert as octet, and extract signature
+//  Return 0 for failure, ECC for Elliptic Curve signature, RSA for RSA signature
+//  Note that signature type is not provided here - its the type of the public key that
+//  is used to verify it that matters, and which determines for example the curve to be used!
+
+pktype X509_extract_cert_sig(octet *sc, octet *sig)
+{
+    int i, j, k, fin, len, rlen, sj, ex;
+    char soid[12];
+    octet SOID = {0, sizeof(soid), soid};
+    pktype ret;
+
+    ret.type = 0;
+    ret.hash = 0;
+
+    j = 0;
+
+    len = getalen(SEQ, sc->val, j); // Check for expected SEQ clause, and get length
+    if (len < 0) return ret;        // if not a SEQ clause, there is a problem, exit
+    j += skip(len);                 // skip over length to clause contents. Add len to skip clause
+
+    if (len + j != sc->len) return ret;
+
+    len = getalen(SEQ, sc->val, j);
+    if (len < 0) return ret;
+    j += skip(len) + len; // jump over cert to signature OID
+
+    len = getalen(SEQ, sc->val, j);
+    if (len < 0) return ret;
+    j += skip(len);
+
+    sj = j + len; // Needed to jump over signature OID
+
+// dive in to extract OID
+    len = getalen(OID, sc->val, j);
+    if (len < 0) return ret;
+    j += skip(len);
+
+    fin = j + len;
+    if (len>SOID.max) return ret;
+    SOID.len = len;
+    for (i = 0; j < fin; j++)
+        SOID.val[i++] = sc->val[j];
+
+    // check OID here..
+    if (OCT_comp(&EDPK25519, &SOID))
+    {
+        ret.type = X509_ECD;
+        ret.hash = X509_H512;
+    }
+    if (OCT_comp(&EDPK448, &SOID))
+    {
+        ret.type = X509_ECD;
+        ret.hash = X509_SHAKE256;
+    }
+    if (OCT_comp(&ECCSHA256, &SOID))
+    {
+        ret.type = X509_ECC;
+        ret.hash = X509_H256;
+    }
+    if (OCT_comp(&ECCSHA384, &SOID))
+    {
+        ret.type = X509_ECC;
+        ret.hash = X509_H384;
+    }
+    if (OCT_comp(&ECCSHA512, &SOID))
+    {
+        ret.type = X509_ECC;
+        ret.hash = X509_H512;
+    }
+    if (OCT_comp(&RSASHA256, &SOID))
+    {
+        ret.type = X509_RSA;
+        ret.hash = X509_H256;
+    }
+    if (OCT_comp(&RSASHA384, &SOID))
+    {
+        ret.type = X509_RSA;
+        ret.hash = X509_H384;
+    }
+    if (OCT_comp(&RSASHA512, &SOID))
+    {
+        ret.type = X509_RSA;
+        ret.hash = X509_H512;
+    }
+    if (OCT_comp(&DILITHIUM3, &SOID))
+    {
+        ret.type = X509_PQ;
+        ret.hash = 0; // hash type is implicit
+    }
+    if (ret.type == 0) return ret; // unsupported type
+
+    j = sj; // jump out to signature
+
+    len = getalen(BIT, sc->val, j);
+    if (len < 0)
+    {
+        ret.type = 0;
+        return ret;
+    }
+    j += skip(len);
+    j++;
+    len--; // skip bit shift (hopefully 0!)
+
+    if (ret.type==X509_ECD) 
+    {
+        if (len>sig->max)
+        {
+            ret.type=0;
+            return ret;
+        }
+        sig->len = len;
+        i = 0;
+        fin = j + len;
+        for (; j < fin; j++)
+            sig->val[i++] = sc->val[j];
+
+        if (ret.hash == X509_H512) ret.curve = USE_ED25519;
+        if (ret.hash == X509_SHAKE256) ret.curve = USE_ED448;
+    }
+    if (ret.type == X509_ECC)
+    {
+        // signature in the form (r,s)
+        len = getalen(SEQ, sc->val, j);
+        if (len < 0)
+        {
+            ret.type = 0;
+            return ret;
+        }
+        j += skip(len);
+
+        // pick up r part of signature
+        len = getalen(INT, sc->val, j);
+        if (len < 0)
+        {
+            ret.type = 0;
+            return ret;
+        }
+        j += skip(len);
+
+        if (sc->val[j] == 0)
+        {
+            // skip leading zero
+            j++;
+            len--;
+        }
+        rlen = bround(len);
+
+        ex = rlen - len;
+
+        if (2*rlen>sig->max)
+        {
+            ret.type=0;
+            return ret;
+        }
+        sig->len = 2 * rlen;
+
+        i = 0;
+        for (k = 0; k < ex; k++)
+            sig->val[i++] = 0;
+
+        fin = j + len;
+        for (; j < fin; j++)
+            sig->val[i++] = sc->val[j];
+
+        // pick up s part of signature
+        len = getalen(INT, sc->val, j);
+        if (len < 0)
+        {
+            ret.type = 0;
+            return ret;
+        }
+        j += skip(len);
+
+        if (sc->val[j] == 0)
+        {
+            // skip leading zeros
+            j++;
+            len--;
+        }
+        rlen = bround(len);
+        ex = rlen - len;
+        for (k = 0; k < ex; k++)
+            sig->val[i++] = 0;
+
+        fin = j + len;
+        for (; j < fin; j++)
+            sig->val[i++] = sc->val[j];
+
+        if (ret.hash == X509_H256) ret.curve = USE_NIST256;
+        if (ret.hash == X509_H384) ret.curve = USE_NIST384;
+        if (ret.hash == X509_H512) ret.curve = USE_NIST521;
+    }
+    if (ret.type == X509_RSA)
+    {
+        rlen = bround(len);
+        ex = rlen - len;
+
+        if (rlen>sig->max)
+        {
+            ret.type=0;
+            return ret;
+        }
+        sig->len = rlen;
+        i = 0;
+        for (k = 0; k < ex; k++)
+            sig->val[i++] = 0;
+
+        fin = j + len;
+        for (; j < fin; j++)
+            sig->val[i++] = sc->val[j];
+
+        ret.curve = 8*rlen;
+    }
+    if (ret.type == X509_PQ)
+    {
+        if (len>sig->max)
+        {
+            ret.type=0;
+            return ret;
+        }
+        sig->len = len;
+        fin = j + len;
+        for (i=0; j < fin; j++)
+            sig->val[i++] = sc->val[j];
+        ret.curve = 8*len;
+    }
+    return ret;
+}
+
+// Extract certificate from signed cert
+int X509_extract_cert(octet *sc, octet *cert)
+{
+    int i, j, fin, len, k;
+
+    j = 0;
+    len = getalen(SEQ, sc->val, j);
+
+    if (len < 0) return 0;
+    j += skip(len);
+
+    k = j;
+
+    len = getalen(SEQ, sc->val, j);
+    if (len < 0) return 0;
+    j += skip(len);
+
+    fin = j + len;
+    if (fin-k>cert->max) return 0;
+
+    cert->len = fin - k;
+
+    for (i = k; i < fin; i++) cert->val[i - k] = sc->val[i];
+
+    return 1;
+}
+
+// find index to start of ASN.1 raw public key, and return its length
+int X509_find_public_key(octet *c,int *ptr)
+{
+    int i, j, k, fin, len, sj;
+
+    j = 0;
+
+    len = getalen(SEQ, c->val, j);
+    if (len < 0) return 0;
+    j += skip(len);
+
+    if (len + j != c->len) return 0;
+
+    len = getalen(ANY, c->val, j);
+    if (len < 0) return 0;
+    j += skip(len) + len; //jump over version clause
+
+    len = getalen(INT, c->val, j);
+
+    if (len > 0) j += skip(len) + len; // jump over serial number clause (if there is one)
+
+    len = getalen(SEQ, c->val, j);
+    if (len < 0) return 0;
+    j += skip(len) + len; // jump over signature algorithm
+
+    len = getalen(SEQ, c->val, j);
+    if (len < 0) return 0;
+    j += skip(len) + len; // skip issuer
+
+    len = getalen(SEQ, c->val, j);
+    if (len < 0) return 0;
+    j += skip(len) + len; // skip validity
+
+    len = getalen(SEQ, c->val, j);
+    if (len < 0) return 0;
+    j += skip(len) + len; // skip subject
+
+    k=j;
+    len = getalen(SEQ, c->val, j); // look ahead to determine length
+    if (len < 0) return 0;
+    j += skip(len); //
+
+    fin=j+len;
+    *ptr=k;
+    return fin-k;
+}
+
+// get Public Key details from ASN.1 description
+pktype X509_get_public_key(octet *c,octet *key) 
+{
+    int i, j, fin, len, sj, ptr;
+    char koid[12];     /*****/
+    octet KOID = {0, sizeof(koid), koid};
+    pktype ret;
+
+    ret.type = ret.hash = 0;
+    ret.curve = -1;
+
+    j=0;
+
+    len = getalen(SEQ, c->val, j);
+    if (len < 0) return ret;
+    j += skip(len); //
+
+    len = getalen(SEQ, c->val, j);
+    if (len < 0) return ret;
+    j += skip(len);
+
+// ** Maybe dive in and check Public Key OIDs here?
+// ecpublicKey & prime256v1, secp384r1 or secp521r1 for ECC
+// rsapublicKey for RSA
+
+    sj = j + len;
+
+    len = getalen(OID, c->val, j);
+    if (len < 0) return ret;
+    j += skip(len);
+
+    fin = j + len;
+    if (len>KOID.max) return ret;
+    KOID.len = len;
+    for (i = 0; j < fin; j++)
+        KOID.val[i++] = c->val[j];
+
+    ret.type = 0;
+    if (OCT_comp(&ECPK, &KOID)) ret.type = X509_ECC;
+    if (OCT_comp(&EDPK25519, &KOID)) {ret.type = X509_ECD; ret.curve=USE_ED25519;}
+    if (OCT_comp(&EDPK448, &KOID)) {ret.type = X509_ECD;  ret.curve=USE_ED448;}
+    if (OCT_comp(&RSAPK, &KOID)) ret.type = X509_RSA;
+    if (OCT_comp(&DILITHIUM3, &KOID)) ret.type = X509_PQ;
+
+    if (ret.type == 0) return ret;
+
+    if (ret.type == X509_ECC)
+    {
+        // which elliptic curve?
+        len = getalen(OID, c->val, j);
+        if (len < 0)
+        {
+            ret.type = 0;
+            return ret;
+        }
+        j += skip(len);
+
+        fin = j + len;
+        if (len>KOID.max)
+        {
+            ret.type=0;
+            return ret;
+        }
+        KOID.len = len;
+        for (i = 0; j < fin; j++)
+            KOID.val[i++] = c->val[j];
+
+        if (OCT_comp(&PRIME25519, &KOID)) ret.curve = USE_ED25519; /*****/
+        if (OCT_comp(&PRIME256V1, &KOID)) ret.curve = USE_NIST256;
+        if (OCT_comp(&SECP384R1, &KOID)) ret.curve = USE_NIST384;
+        if (OCT_comp(&SECP521R1, &KOID)) ret.curve = USE_NIST521;
+    }
+
+    j = sj; // skip to actual Public Key
+
+    len = getalen(BIT, c->val, j);
+    if (len < 0)
+    {
+        ret.type = 0;
+        return ret;
+    }
+    j += skip(len); //
+    j++;
+    len--; // skip bit shift (hopefully 0!)
+
+// extract key
+    if (ret.type == X509_ECC || ret.type == X509_ECD || ret.type == X509_PQ)
+    {
+        if (len>key->max)
+        {
+            ret.type=0;
+            return ret;
+        }
+        key->len = len;
+        fin = j + len;
+        for (i = 0; j < fin; j++)
+            key->val[i++] = c->val[j];
+    }
+    if (ret.type == X509_PQ) 
+        ret.curve=8*len;
+    if (ret.type == X509_RSA)
+    {
+        // Key is (modulus,exponent) - assume exponent is 65537
+        len = getalen(SEQ, c->val, j);
+        if (len < 0)
+        {
+            ret.type = 0;
+            return ret;
+        }
+        j += skip(len); //
+
+        len = getalen(INT, c->val, j); // get modulus
+        if (len < 0)
+        {
+            ret.type = 0;
+            return ret;
+        }
+        j += skip(len); //
+        if (c->val[j] == 0)
+        {
+            j++;
+            len--; // remove leading zero
+        }
+        if (len>key->max)
+        {
+            ret.type=0;
+            return ret;
+        }
+        key->len = len;
+        fin = j + len;
+        for (i = 0; j < fin; j++)
+            key->val[i++] = c->val[j];
+
+        ret.curve = 8 * len;
+    }
+    return ret;
+}
+
+// Extract Public Key from inside Certificate
+pktype X509_extract_public_key(octet *c, octet *key)
+{
+    int ptr=0;
+    int pklen=X509_find_public_key(c,&ptr);
+    octet CC={pklen,pklen,&c->val[ptr]};
+    return X509_get_public_key(&CC,key);
+}
+
+// Find pointer to main sections of cert, before extracting individual field
+// Find index to issuer in cert, and its length
+// This is the certificate DER encoded distinguished issuer name 
+int X509_find_issuer(octet *c,int *flen)
+{
+    int j, len;
+    *flen=0;
+    j = 0;
+    len = getalen(SEQ, c->val, j);
+    if (len < 0) return 0;
+    j += skip(len);
+
+    if (len + j != c->len) return 0;
+
+    len = getalen(ANY, c->val, j);
+    if (len < 0) return 0;
+    j += skip(len) + len; //jump over version clause
+
+    len = getalen(INT, c->val, j);
+
+    if (len > 0) j += skip(len) + len; // jump over serial number clause (if there is one)
+
+    len = getalen(SEQ, c->val, j);
+    if (len < 0) return 0;
+    j += skip(len) + len; // jump over signature algorithm
+
+    len=getalen(SEQ,c->val,j);
+    *flen=len+skip(len);      // length of issuer
+
+    return j;
+}
+
+// Find index to validity period
+int X509_find_validity(octet *c)
+{
+    int j, len;
+    j = X509_find_issuer(c,&len);
+    j+=len; // skip issuer
+
+    //len = getalen(SEQ, c->val, j);
+    //if (len < 0) return 0;
+    //j += skip(len) + len; // skip issuer
+
+    return j;
+}
+
+// Find index to subject in cert, and its length
+// This is the certificate DER encoded distinguished subject name 
+int X509_find_subject(octet *c,int *flen)
+{
+    int j, len;
+    *flen=0;
+    j = X509_find_validity(c);
+
+    len = getalen(SEQ, c->val, j);
+    if (len < 0) return 0;
+    j += skip(len) + len; // skip validity
+
+    len=getalen(SEQ,c->val,j);
+    *flen=len+skip(len);
+
+    return j;
+}
+
+int X509_self_signed(octet *c)
+{
+    int i,m,slen,ilen;
+    int ksub=X509_find_subject(c,&slen);
+    int kiss=X509_find_issuer(c,&ilen);
+
+    if (slen!=ilen) return 0;
+
+    //int sublen=getalen(SEQ,c->val,ksub);
+    //int isslen=getalen(SEQ,c->val,kiss);
+    //if (isslen!=sublen) return 0;
+    //ksub+=skip(sublen);
+    //kiss+=skip(isslen);
+    for (i=m=0;i<slen;i++)
+        m|=c->val[i+ksub] - c->val[i+kiss];
+    if (m!=0) return 0;
+    return 1;
+}
+
+// NOTE: When extracting cert information, we actually return just an index to the data inside the cert, and maybe its length
+// So no memory is assigned to store cert info. It is the callers responsibility to allocate such memory if required, and copy
+// cert information into it.
+
+// Find entity property indicated by SOID, given start of issuer or subject field. Return index in cert, flen=length of field
+
+int X509_find_entity_property(octet *c, octet *SOID, int start, int *flen)
+{
+    int i, j, k, fin, len, tlen;
+    char foid[50];  /*****/
+    octet FOID = {0, sizeof(foid), foid};
+
+    j = start;
+
+    tlen = getalen(SEQ, c->val, j);
+    if (tlen < 0) return 0;
+    j += skip(tlen);
+
+    for (k = j; j < k + tlen;)
+    {
+        // search for Owner OID
+        len = getalen(SET, c->val, j);
+        if (len < 0) return 0;
+        j += skip(len);
+        len = getalen(SEQ, c->val, j);
+        if (len < 0) return 0;
+        j += skip(len);
+        len = getalen(OID, c->val, j);
+        if (len < 0) return 0;
+        j += skip(len);
+        fin = j + len; // extract OID
+        if (len>FOID.max) return 0;
+        FOID.len = len;
+        for (i = 0; j < fin; j++)
+            FOID.val[i++] = c->val[j];
+        len = getalen(ANY, c->val, j); // get text, could be any type
+        if (len < 0) return 0;
+
+        j += skip(len);
+        if (OCT_comp(&FOID, SOID))
+        {
+            // if its the right one return
+            *flen = len;
+            return j;
+        }
+        j += len; // skip over it
+    }
+    *flen = 0; /*****/
+    return 0;
+}
+
+// Find start date of certificate validity period
+int X509_find_start_date(octet *c, int start)
+{
+    int j, len;
+    j = start;
+
+    len = getalen(SEQ, c->val, j);
+    if (len < 0) return 0;
+    j += skip(len);
+
+    len = getalen(UTC, c->val, j);
+    if (len < 0) 
+    {  // could be generalised time 
+        len = getalen(GTM, c->val, j);
+        if (len<0) return 0;
+        j += skip(len);
+        j += 2; // skip century
+    }
+    else j += skip(len);
+    return j;
+}
+
+// Find expiry date of certificate validity period
+int X509_find_expiry_date(octet *c, int start)
+{
+    int j, len;
+    j = start;
+
+    len = getalen(SEQ, c->val, j);
+    if (len < 0) return 0;
+    j += skip(len);
+
+    len = getalen(UTC, c->val, j);
+    if (len < 0) 
+    {
+        len = getalen(GTM,c->val,j);
+        if (len<0) return 0;
+    }
+    j += skip(len) + len;
+
+    len = getalen(UTC, c->val, j);
+    if (len < 0) 
+    {
+        len = getalen(GTM, c->val,j);
+        if (len<0) return 0;
+        j+=skip(len);
+        j+=2; // skip century
+    }
+    else j += skip(len);
+
+    return j;
+}
+
+int X509_find_extensions(octet *c)
+{
+    int j, len;
+    j=X509_find_subject(c,&len);
+    j+=len; // skip subject
+
+    //len = getalen(SEQ, c->val, j);
+    //if (len<0) return 0;
+    //j += skip(len)+len; // skip subject
+
+    len = getalen(SEQ, c->val, j);
+    if (len<0) return 0;
+    j += skip(len)+len; // skip public key
+
+    if (j>=c->len) return 0;
+    return j;
+}
+
+int X509_find_extension(octet *c, octet *SOID, int start, int *flen)
+{
+    int i, j, k, fin, len, tlen, nj;
+    char foid[50];  /*****/
+    octet FOID = {0, sizeof(foid), foid};
+
+    j = start;
+
+    tlen = getalen(EXT, c->val, j);
+    if (tlen < 0) return 0;
+    j += skip(tlen);
+
+    tlen = getalen(SEQ, c->val, j);
+    if (tlen < 0) return 0;
+    j += skip(tlen);
+
+    for (k = j; j < k + tlen;)
+    {
+        // search for Owner OID
+        len = getalen(SEQ, c->val, j);
+        if (len < 0) return 0;
+        j += skip(len);  nj=j+len;
+        len = getalen(OID, c->val, j);
+        if (len < 0) return 0;
+        j += skip(len);
+        fin = j + len; // extract OID
+        if (len>FOID.max) return 0;
+        FOID.len = len;
+        for (i = 0; j < fin; j++)
+            FOID.val[i++] = c->val[j];
+        if (OCT_comp(&FOID, SOID))
+        {
+            // if its the right one return
+            *flen = nj-j;
+            return j;
+        }
+        j = nj; // skip over this extension
+    }
+    *flen = 0; /*****/
+    return 0;
+}
+
+// return 1 if name found, else 0, where name is URL
+// input cert, and pointer to SAN extension
+// Takes wild-card into consideration
+int X509_find_alt_name(octet *c,int start,char *name)
+{
+    int i,j,len,k,m,tlen,cmp,tag;
+
+    if (start==0) return 0;
+    j=start;
+    tlen = getalen(OCT, c->val, j);
+    if (tlen < 0) return 0;
+    j += skip(tlen);
+
+    tlen = getalen(SEQ, c->val, j);
+    if (tlen < 0) return 0;
+    j += skip(tlen);  
+    
+    for (k=j;j<k+tlen;)
+    {
+        tag=c->val[j]; tag&=0xff;
+        len = getalen(ANY, c->val, j);  
+        if (len < 0) return 0;
+        j += skip(len);               // ?? If its not dns, skip over it j+=len
+        if (tag!=DNS)
+        { // only interested in URLs
+            j+=len;
+            continue;
+        }
+        cmp=1; m=0;
+        if (c->val[j]=='*')
+        { // wildcard
+            j++; len--; // skip over *
+            while (name[m]!='.' && name[m]!=0)  // advance to first .
+                m++;
+        }
+        for (i=0;i<len;i++)
+        {
+            if (name[m]==0)
+            { // name has ended before comparison completed
+                cmp=0;
+                j++;
+                continue;
+            }
+            if (c->val[j++]!=name[m++])  // mismatch
+                cmp=0;
+        }
+        if (name[m]!=0) cmp=0; // name should have ended
+        if (cmp) return 1;
+    }
+    return 0;
+}
+
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/x509.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/x509.h
new file mode 100644
index 0000000..bcba4d3
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miraclhgj/includes/x509.h
@@ -0,0 +1,212 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* CORE x509 header file */
+
+/**
+ * @file x509.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 19th May 2015
+ * @brief X509 function Header File
+ *
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef X509_H
+#define X509_H
+
+// Supported Encryption Methods
+
+#define X509_ECC 1
+#define X509_RSA 2
+#define X509_ECD 3
+#define X509_PQ 4
+
+// Supported Hash functions
+
+#define X509_H256 2
+#define X509_H384 3
+#define X509_H512 4
+#define X509_SHAKE256 5
+
+// Supported Curves
+
+#define USE_NIST256 0    /**< For the NIST 256-bit standard curve - WEIERSTRASS only */
+#define USE_ED25519 1     /**< Bernstein's Modulus 2^255-19 - EDWARDS */
+#define USE_ED448 4     /**< Goldilocks Modulus Ed448 - EDWARDS */
+#define USE_BRAINPOOL 2  /**< For Brainpool 256-bit curve - WEIERSTRASS only */
+#define USE_ANSSI 3      /**< For French 256-bit standard curve - WEIERSTRASS only */
+#define USE_NIST384 10   /**< For the NIST 384-bit standard curve - WEIERSTRASS only */
+#define USE_NIST521 12   /**< For the NIST 521-bit standard curve - WEIERSTRASS only */
+
+using namespace core;
+
+extern octet X509_CN;  // Country Name
+extern octet X509_ON;  // organisation Name
+extern octet X509_EN;  // email
+extern octet X509_LN;  // local name
+extern octet X509_UN;  // Unit name (aka Organisation Unit OU)
+extern octet X509_MN;  // My Name (aka Common Name)
+extern octet X509_SN;  // State Name
+
+extern octet X509_AN;  // Alternate Name
+extern octet X509_KU;  // Key Usage
+extern octet X509_BC;  // Basic Constraints
+
+/**
+ * @brief Public key type
+ */
+typedef struct
+{
+    int type;  /**< signature type (ECC or RSA) */
+    int hash;  /**< hash type */
+    int curve; /**< elliptic curve used or RSA key length in bits  */
+} pktype;
+
+
+/* X.509 functions */
+
+/** @brief Extract private key
+ *
+	@param c an X.509 private key 
+	@param pk the extracted private key - for RSA octet = p|q|dp|dq|c, for ECC octet = k
+	@return private key type details 
+*/
+extern pktype X509_extract_private_key(octet *c,octet *pk);
+
+/** @brief Extract certificate signature
+ *
+	@param c an X.509 certificate
+	@param s the extracted signature
+	@return signature type details
+
+*/
+extern pktype X509_extract_cert_sig(octet *c, octet *s);
+/** @brief
+ *
+	@param sc a signed certificate
+	@param c the extracted certificate
+	@return 0 on failure
+*/
+extern int X509_extract_cert(octet *sc, octet *c);
+
+/** @brief
+ *
+	@param c an X.509 certificate
+	@param ptr pointer to ASN.1 raw public key
+	@return length of raw public key
+*/
+extern int X509_find_public_key(octet *c,int *ptr);
+
+/** @brief
+ *
+	@param c an ASN.1 encoded public key
+	@param key the extracted public key
+	@return indicator of public key type (ECC or RSA)
+*/
+extern pktype X509_get_public_key(octet *c,octet *key);
+
+/** @brief
+ *
+	@param c an X.509 certificate
+	@param k the extracted key
+	@return indicator of public key type (ECC or RSA)
+*/
+extern pktype X509_extract_public_key(octet *c, octet *k);
+/** @brief
+ *
+	@param c an X.509 certificate
+    @param len length of issuer field
+	@return 0 on failure, or pointer to issuer field in cert
+*/
+extern int X509_find_issuer(octet *c,int *len);
+/** @brief
+ *
+	@param c an X.509 certificate
+	@return 0 on failure, or pointer to validity field in cert
+*/
+extern int X509_find_validity(octet *c);
+/** @brief
+ *
+	@param c an X.509 certificate
+    @param len length of subject field
+	@return 0 on failure, or pointer to subject field in cert
+*/
+extern int X509_find_subject(octet *c,int *len);
+
+/** @brief
+ *
+	@param c an X.509 certificate
+	@return true if self-signed, else false
+*/
+extern int X509_self_signed(octet *c);
+
+/** @brief
+ *
+	@param c an X.509 certificate
+	@param S is OID of property we are looking for
+	@param s is a pointer to the section of interest in the cert
+	@param f is pointer to the length of the property
+	@return 0 on failure, or pointer to the property
+*/
+extern int X509_find_entity_property(octet *c, octet *S, int s, int *f);
+/** @brief
+ *
+	@param c an X.509 certificate
+	@param s is a pointer to the start of the validity field
+	@return 0 on failure, or pointer to the start date
+*/
+extern int X509_find_start_date(octet *c, int s);
+/** @brief
+ *
+	@param c an X.509 certificate
+	@param s is a pointer to the start of the validity field
+	@return 0 on failure, or pointer to the expiry date
+*/
+extern int X509_find_expiry_date(octet *c, int s);
+
+
+/** @brief
+ *
+	@param c an X.509 certificate
+	@return 0 on failure (or no extensions), or pointer to extensions field in cert
+*/
+extern int X509_find_extensions(octet *c);
+/** @brief
+ *
+	@param c an X.509 certificate
+	@param S is OID of particular extension we are looking for
+	@param s is a pointer to the section of interest in the cert
+	@param f is pointer to the length of the extension
+	@return 0 on failure, or pointer to the extension
+*/
+extern int X509_find_extension(octet *c, octet *S, int s, int *f);
+
+/** @brief
+ *
+	@param c an X.509 certificate
+    @param s is a pointer to certificate extension SubjectAltNames
+    @param name is a URL
+    @return 0 on failure, 1 if URL is in list of alt names
+*/
+extern int X509_find_alt_name(octet *c,int s,char *name);
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/core.a b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/core.a
new file mode 100644
index 0000000..8bff367
Binary files /dev/null and b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/core.a differ
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/arch.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/arch.h
new file mode 100644
index 0000000..db16940
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/arch.h
@@ -0,0 +1,106 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* Architecture definition header file */
+
+/**
+ * @file arch.h
+ * @author Mike Scott
+ * @date 23rd February 2016
+ * @brief Architecture Header File
+ *
+ * Specify Processor Architecture
+ *
+ */
+
+/* NOTE: There is only one user configurable section in this header - see below */
+
+#ifndef ARCH_H
+#define ARCH_H
+#include <stdint.h>
+
+#define WOULD_USE_VLAS   /* Would like to use variable length arrays? */
+
+#ifdef WOULD_USE_VLAS
+#if __cplusplus >= 201402L
+#define USE_VLAS
+#endif
+#endif
+
+namespace core {
+
+/*** START OF USER CONFIGURABLE SECTION - set architecture ***/
+
+#define CHUNK 64      /**< size of chunk in bits = wordlength of computer = 16, 32 or 64. Note not all curve options are supported on 16-bit processors */
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+/* Create Integer types */
+
+//#define byte uint8_t            /**< 8-bit unsigned integer */
+//#define sign8 int8_t            /**< 8-bit signed integer */
+//#define sign16 int16_t          /**< 16-bit signed integer */
+//#define sign32 int32_t          /**< 32-bit signed integer */
+//#define sign64 int64_t          /**< 64-bit signed integer */
+//#define unsign32 uint32_t       /**< 32-bit unsigned integer */
+//#define unsign64 uint64_t       /**< 64-bit unsigned integer */
+
+using byte = uint8_t;			/**< 8-bit unsigned integer */
+using sign8 = int8_t;			/**< 8-bit signed integer */
+using sign16 = int16_t;			/**< 16-bit signed integer */
+using sign32 = int32_t;			/**< 32-bit signed integer */
+using sign64 = int64_t;			/**< 64-bit signed integer */
+using unsign32 = uint32_t;		/**< 32-bit unsigned integer */
+using unsign64 = uint64_t;		/**< 64-bit unsigned integer */
+
+//#define uchar unsigned char  /**<  Unsigned char */
+using uchar = unsigned char;
+
+/* Don't mess with anything below this line unless you know what you are doing */
+
+#if CHUNK==16
+
+#define chunk int16_t       /**< C type corresponding to word length */
+#define dchunk int32_t      /**< Always define double length chunk type if available */
+
+#endif
+
+#if CHUNK == 32
+
+#define chunk int32_t       /**< C type corresponding to word length */
+#define dchunk int64_t      /**< Always define double length chunk type if available */
+
+#endif
+
+#if CHUNK == 64
+
+#define chunk int64_t       /**< C type corresponding to word length */
+#if defined(__SIZEOF_INT128__) && __SIZEOF_INT128__ == 16
+#define dchunk __int128
+#endif
+
+#endif
+
+#ifdef dchunk
+#define COMBA      /**< Use COMBA method for faster muls, sqrs and reductions */
+#endif
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/big.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/big.h
new file mode 100644
index 0000000..894cc57
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/big.h
@@ -0,0 +1,697 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file big.h
+ * @author Mike Scott
+ * @date 23rd February 2016
+ * @brief Big number Header File
+ *
+ *
+ */
+
+#ifndef BIG_XXX_H
+#define BIG_XXX_H
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <inttypes.h>
+#include "arch.h"
+#include "core.h"
+#include "config_big_XXX.h"
+
+using namespace core;
+
+/* could comment this out if code size is a major issue */
+#define UNWOUND
+/* Normally recommended, but may not be optimal for some architectures, for example 32-bit ARM M4 */
+#define USE_KARATSUBA
+
+#define BIGBITS_XXX (8*MODBYTES_XXX)
+#define NLEN_XXX (1+((8*MODBYTES_XXX-1)/BASEBITS_XXX))
+#define DNLEN_XXX 2*NLEN_XXX
+#define BMASK_XXX (((chunk)1<<BASEBITS_XXX)-1) /**< Mask = 2^BASEBITS-1 */
+#define NEXCESS_XXX (1<<(CHUNK-BASEBITS_XXX-1))           /**< 2^(CHUNK-BASEBITS-1) - digit cannot be multiplied by more than this before normalisation */
+
+#define HBITS_XXX (BASEBITS_XXX/2)      /**< Number of bits in number base divided by 2 */
+#define HMASK_XXX (((chunk)1<<HBITS_XXX)-1)    /**< Mask = 2^HBITS-1 */
+
+//#define DEBUG_NORM
+
+#ifdef DEBUG_NORM  /* Add an extra location to track chunk extension */
+#define MPV_XXX NLEN_XXX
+#define MNV_XXX (NLEN_XXX+1)
+#define DMPV_XXX DNLEN_XXX
+#define DMNV_XXX (DNLEN_XXX+1)
+
+#endif
+
+namespace XXX {
+
+//extern int BIGMULS;
+//extern int BIGSQRS;
+
+#ifdef DEBUG_NORM
+typedef chunk BIG[NLEN_XXX + 2]; /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_XXX + 2]; /**< Define type DBIG as array of chunks */
+#else
+typedef chunk BIG[NLEN_XXX];     /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_XXX];   /**< Define type DBIG as array of chunks */
+#endif
+
+/* BIG number prototypes */
+
+/**	@brief Tests for BIG equal to zero (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_iszilch(BIG x);
+/**	@brief Tests for BIG equal to one (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if one, else returns 0
+ */
+extern int BIG_isunity(BIG x);
+/**	@brief Tests for DBIG equal to zero (Constant Time)
+ *
+	@param x a DBIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_diszilch(DBIG x);
+/**	@brief Outputs a BIG number to the console (Variable Time)
+ *
+	@param x a BIG number
+ */
+extern void BIG_output(BIG x);
+/**	@brief Outputs a BIG number to the console in raw form (Variable Time for debugging)
+ *
+	@param x a BIG number
+ */
+extern void BIG_rawoutput(BIG x);
+/**	@brief Conditional constant time swap of two BIG numbers
+ *
+	Conditionally swaps parameters in constant time (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s swap takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cswap(BIG x, BIG y, int s);
+/**	@brief Conditional copy of BIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cmove(BIG x, BIG y, int s);
+/**	@brief Conditional copy of DBIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a DBIG number
+	@param y another DBIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_dcmove(BIG x, BIG y, int s);
+/**	@brief Convert from BIG number to byte array (Constant Time)
+ *
+	@param a byte array
+	@param x BIG number
+ */
+extern void BIG_toBytes(char *a, BIG x);
+/**	@brief Convert to BIG number from byte array (Constant Time)
+ *
+	@param x BIG number
+	@param a byte array
+ */
+extern void BIG_fromBytes(BIG x, char *a);
+/**	@brief Convert to BIG number from byte array of given length (Variable Time)
+ *
+	@param x BIG number
+	@param a byte array
+	@param s byte array length
+ */
+extern void BIG_fromBytesLen(BIG x, char *a, int s);
+/**@brief Convert to DBIG number from byte array of given length (Variable Time)
+ *
+   @param x DBIG number
+   @param a byte array
+   @param s byte array length
+ */
+extern void BIG_dfromBytesLen(DBIG x, char *a, int s);
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_doutput(DBIG x); 
+
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_drawoutput(DBIG x);
+
+/**	@brief Copy BIG from Read-Only Memory to a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number in ROM
+ */
+extern void BIG_rcopy(BIG x, const BIG y);
+/**	@brief Copy BIG to another BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_copy(BIG x, BIG y);
+/**	@brief Copy DBIG to another DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_dcopy(DBIG x, DBIG y);
+/**	@brief Copy BIG to upper half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dsucopy(DBIG x, BIG y);
+/**	@brief Copy BIG to lower half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dscopy(DBIG x, BIG y);
+/**	@brief Copy lower half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sdcopy(BIG x, DBIG y);
+/**	@brief Copy upper half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sducopy(BIG x, DBIG y);
+/**	@brief Set BIG to zero (Constant Time)
+ *
+	@param x BIG number to be set to zero  
+ */
+extern void BIG_zero(BIG x);
+/**	@brief Set DBIG to zero (Constant Time)
+ *
+	@param x DBIG number to be set to zero
+ */
+extern void BIG_dzero(DBIG x);
+/**	@brief Set BIG to one (unity) (Constant Time)
+ *
+	@param x BIG number to be set to one.
+ */
+extern void BIG_one(BIG x);
+/**	@brief Set BIG to inverse mod 2^256 (Constant Time)
+ *
+	@param x BIG number to be inverted
+ */
+extern void BIG_invmod2m(BIG x);
+/**	@brief Set BIG to sum of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, sum of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_add(BIG x, BIG y, BIG z);
+
+/**	@brief Set BIG to logical or of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, or of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_or(BIG x, BIG y, BIG z);
+
+/**	@brief Increment BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be incremented
+	@param i integer
+ */
+extern void BIG_inc(BIG x, int i);
+/**	@brief Set BIG to difference of two BIGs (Constant Time)
+ *
+	@param x BIG number, difference of other two - output not normalised
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_sub(BIG x, BIG y, BIG z);
+/**	@brief Decrement BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be decremented
+	@param i integer
+ */
+extern void BIG_dec(BIG x, int i);
+/**	@brief Set DBIG to sum of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, sum of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dadd(DBIG x, DBIG y, DBIG z);
+/**	@brief Set DBIG to difference of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, difference of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dsub(DBIG x, DBIG y, DBIG z);
+/**	@brief Multiply BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_imul(BIG x, BIG y, int i);
+/**	@brief Multiply BIG by not-so-small small integer - output normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+	@return Overflowing bits
+ */
+extern chunk BIG_pmul(BIG x, BIG y, int i);
+/**	@brief Divide BIG by 3 - output normalised (Constant Time)
+ *
+	@param x BIG number
+	@return Remainder
+ */
+extern int BIG_div3(BIG x);
+/**	@brief Multiply BIG by even bigger small integer resulting in a DBIG - output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_pxmul(DBIG x, BIG y, int i);
+/**	@brief Multiply BIG by another BIG resulting in DBIG - inputs normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_mul(DBIG x, BIG y, BIG z);
+/**	@brief Multiply BIG by another BIG resulting in another BIG - inputs normalised and output normalised (Constant Time)
+ *
+	Note that the product must fit into a BIG, and x must be distinct from y and z
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_smul(BIG x, BIG y, BIG z);
+/**	@brief Square BIG resulting in a DBIG - input normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, square of a BIG
+	@param y BIG number to be squared
+ */
+extern void BIG_sqr(DBIG x, BIG y);
+
+/**	@brief Montgomery reduction of a DBIG to a BIG  - input normalised and output normalised (Constant Time)
+ *
+	@param a BIG number, reduction of a BIG
+	@param md BIG number, the modulus
+	@param MC the Montgomery Constant
+	@param d DBIG number to be reduced
+ */
+extern void BIG_monty(BIG a, BIG md, chunk MC, DBIG d);
+
+/**	@brief Shifts a BIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shl(BIG x, int s);
+/**	@brief Fast shifts a BIG left by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Overflow bits
+ */
+extern int BIG_fshl(BIG x, int s);
+/**	@brief Shifts a DBIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshl(DBIG x, int s);
+/**	@brief Shifts a BIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shr(BIG x, int s);
+
+
+/**	@brief Fast time-critical combined shift by 1 bit, subtract and normalise (Constant Time)
+ *
+	@param r BIG number normalised output
+	@param a BIG number to be subtracted from
+	@param m BIG number to be shifted and subtracted
+	@return sign of r
+ */
+extern int BIG_ssn(BIG r, BIG a, BIG m);
+
+/**	@brief Fast shifts a BIG right by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Shifted out bits
+ */
+extern int BIG_fshr(BIG x, int s);
+/**	@brief Shifts a DBIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshr(DBIG x, int s);
+/**	@brief Splits a DBIG into two BIGs - input must be normalised, outputs normalised (Constant Time as used)
+ *
+	Internal function. The value of s must be approximately in the middle of the DBIG.
+	Typically used to extract z mod 2^MODBITS and z/2^MODBITS
+	@param x BIG number, top half of z
+	@param y BIG number, bottom half of z
+	@param z DBIG number to be split in two.
+	@param s Bit position at which to split
+	@return carry-out from top half
+ */
+extern chunk BIG_split(BIG x, BIG y, DBIG z, int s);
+/**	@brief Normalizes a BIG number - output normalised (Constant Time)
+ *
+	All digits of the input BIG are reduced mod 2^BASEBITS
+	@param x BIG number to be normalised
+ */
+extern chunk BIG_norm(BIG x);
+/**	@brief Normalizes a DBIG number - output normalised (Constant Time)
+ *
+	All digits of the input DBIG are reduced mod 2^BASEBITS
+	@param x DBIG number to be normalised
+ */
+extern void BIG_dnorm(DBIG x);
+/**	@brief Compares two BIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first BIG number to be compared
+	@param y second BIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_comp(BIG x, BIG y);
+/**	@brief Compares two DBIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first DBIG number to be compared
+	@param y second DBIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_dcomp(DBIG x, DBIG y);
+/**	@brief Calculate number of bits in a BIG - output normalised (Variable Time)
+ *
+	@param x BIG number
+	@return Number of bits in x
+ */
+extern int BIG_nbits(BIG x);
+/**	@brief Calculate number of bits in a DBIG - output normalised (Variable Time)
+ *
+	@param x DBIG number
+	@return Number of bits in x
+ */
+extern int BIG_dnbits(DBIG x);
+
+/**	@brief Reduce x mod n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctmod(BIG x, BIG n, int bd);
+
+/**	@brief  x=y mod n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctdmod(BIG x, DBIG y, BIG n, int bd);
+
+/**	@brief Divide x by n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctsdiv(BIG x,BIG n,int bd);
+
+/**	@brief  x=y/n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctddiv(BIG x, DBIG y, BIG n,int bd);
+
+
+/**	@brief Reduce x mod n - input and output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+ */
+extern void BIG_mod(BIG x, BIG n);
+/**	@brief Divide x by n - output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+ */
+extern void BIG_sdiv(BIG x, BIG n);
+/**	@brief  x=y mod n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_dmod(BIG x, DBIG y, BIG n);
+/**	@brief  x=y/n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_ddiv(BIG x, DBIG y, BIG n);
+/**	@brief  return parity of BIG, that is the least significant bit (Constant Time)
+ *
+	@param x BIG number
+	@return 0 or 1
+ */
+extern int BIG_parity(BIG x);
+/**	@brief  return i-th of BIG (Constant Time)
+ *
+	@param x BIG number
+	@param i the bit of x to be returned
+	@return 0 or 1
+ */
+extern int BIG_bit(BIG x, int i);
+/**	@brief  return least significant bits of a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param n number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int BIG_lastbits(BIG x, int n);
+/**	@brief  Create a random BIG from a random number generator (Constant Time)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_random(BIG x, csprng *r);
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randomnum(BIG x, BIG n, csprng *r);
+
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus and truncated to max bit length (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param t Maximum bit length
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randtrunc(BIG x, BIG n, int t, csprng *r);
+
+/**	brief  return NAF (Non-Adjacent-Form) value as +/- 1, 3 or 5, inputs must be normalised
+ *
+	Given x and 3*x extracts NAF value from given bit position, and returns number of bits processed, and number of trailing zeros detected if any
+	param x BIG number
+	param x3 BIG number, three times x
+	param i bit position
+	param nbs pointer to integer returning number of bits processed
+	param nzs pointer to integer returning number of trailing 0s
+	return + or - 1, 3 or 5
+*/
+
+/**	@brief  Calculate x=y*z mod n (Variable Time)
+ *
+	Slow method for modular multiplication
+	@param x BIG number, on exit = y*z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modmul(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y/z mod n (Variable Time)
+ *
+	Slow method for modular division
+	@param x BIG number, on exit = y/z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_moddiv(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y^2 mod n (Variable Time)
+ *
+	Slow method for modular squaring
+	@param x BIG number, on exit = y^2 mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modsqr(BIG x, BIG y, BIG n);
+/**	@brief  Calculate x=-y mod n (Variable Time)
+ *
+	Modular negation
+	@param x BIG number, on exit = -y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modneg(BIG x, BIG y, BIG n);
+
+/**	@brief  Calculate x=y+z mod n (Variable Time)
+ *
+	Slow method for modular addition
+	@param x BIG number, on exit = y+z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modadd(BIG x, BIG y, BIG z, BIG n);
+
+/**	@brief  Calculate jacobi Symbol (x/y) (Variable Time)
+ *
+	@param x BIG number
+	@param y BIG number
+	@return Jacobi symbol, -1,0 or 1
+ */
+extern int BIG_jacobi(BIG x, BIG y);
+/**	@brief  Calculate x=1/y mod n (Variable Time)
+ *
+	Modular Inversion - This is slow. Uses binary method.
+	@param x BIG number, on exit = 1/y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_invmodp(BIG x, BIG y, BIG n);
+/** @brief Calculate x=x mod 2^m (Variable Time)
+ *
+	Truncation
+	@param x BIG number, on reduced mod 2^m
+	@param m new truncated size
+*/
+extern void BIG_mod2m(BIG x, int m);
+
+/**	@brief Calculates a*b+c+*d
+ *
+	Calculate partial product of a.b, add in carry c, and add total to d (Constant Time)
+	@param a multiplier
+	@param b multiplicand
+	@param c carry
+	@param d pointer to accumulated bottom half of result
+	@return top half of result
+ */
+
+
+extern int step1(BIG,BIG,BIG);
+extern void step2(BIG,BIG,BIG);
+
+#ifdef dchunk
+
+/* Method required to calculate x*y+c+r, bottom half in r, top half returned */
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    dchunk prod = (dchunk)x * y + c + *r;
+    *r = (chunk)prod & BMASK_XXX;
+    return (chunk)(prod >> BASEBITS_XXX);
+}
+
+#else
+
+/* No integer type available that can store double the wordlength */
+/* accumulate partial products */
+
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    chunk x0, x1, y0, y1;
+    chunk bot, top, mid, carry;
+    x0 = x & HMASK_XXX;
+    x1 = (x >> HBITS_XXX);
+    y0 = y & HMASK_XXX;
+    y1 = (y >> HBITS_XXX);
+    bot = x0 * y0;
+    top = x1 * y1;
+    mid = x0 * y1 + x1 * y0;
+    x0 = mid & HMASK_XXX;
+    x1 = (mid >> HBITS_XXX);
+    bot += x0 << HBITS_XXX;
+    bot += *r;
+    bot += c;
+
+    top += x1;
+    carry = bot >> BASEBITS_XXX;
+    bot &= BMASK_XXX;
+    top += carry;
+
+    *r = bot;
+    return top;
+}
+
+#endif
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/big_B160_56.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/big_B160_56.h
new file mode 100644
index 0000000..369c4c1
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/big_B160_56.h
@@ -0,0 +1,697 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file big.h
+ * @author Mike Scott
+ * @date 23rd February 2016
+ * @brief Big number Header File
+ *
+ *
+ */
+
+#ifndef BIG_B160_56_H
+#define BIG_B160_56_H
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <inttypes.h>
+#include "arch.h"
+#include "core.h"
+#include "config_big_B160_56.h"
+
+using namespace core;
+
+/* could comment this out if code size is a major issue */
+#define UNWOUND
+/* Normally recommended, but may not be optimal for some architectures, for example 32-bit ARM M4 */
+#define USE_KARATSUBA
+
+#define BIGBITS_B160_56 (8*MODBYTES_B160_56)
+#define NLEN_B160_56 (1+((8*MODBYTES_B160_56-1)/BASEBITS_B160_56))
+#define DNLEN_B160_56 2*NLEN_B160_56
+#define BMASK_B160_56 (((chunk)1<<BASEBITS_B160_56)-1) /**< Mask = 2^BASEBITS-1 */
+#define NEXCESS_B160_56 (1<<(CHUNK-BASEBITS_B160_56-1))           /**< 2^(CHUNK-BASEBITS-1) - digit cannot be multiplied by more than this before normalisation */
+
+#define HBITS_B160_56 (BASEBITS_B160_56/2)      /**< Number of bits in number base divided by 2 */
+#define HMASK_B160_56 (((chunk)1<<HBITS_B160_56)-1)    /**< Mask = 2^HBITS-1 */
+
+//#define DEBUG_NORM
+
+#ifdef DEBUG_NORM  /* Add an extra location to track chunk extension */
+#define MPV_B160_56 NLEN_B160_56
+#define MNV_B160_56 (NLEN_B160_56+1)
+#define DMPV_B160_56 DNLEN_B160_56
+#define DMNV_B160_56 (DNLEN_B160_56+1)
+
+#endif
+
+namespace B160_56 {
+
+//extern int BIGMULS;
+//extern int BIGSQRS;
+
+#ifdef DEBUG_NORM
+typedef chunk BIG[NLEN_B160_56 + 2]; /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B160_56 + 2]; /**< Define type DBIG as array of chunks */
+#else
+typedef chunk BIG[NLEN_B160_56];     /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B160_56];   /**< Define type DBIG as array of chunks */
+#endif
+
+/* BIG number prototypes */
+
+/**	@brief Tests for BIG equal to zero (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_iszilch(BIG x);
+/**	@brief Tests for BIG equal to one (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if one, else returns 0
+ */
+extern int BIG_isunity(BIG x);
+/**	@brief Tests for DBIG equal to zero (Constant Time)
+ *
+	@param x a DBIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_diszilch(DBIG x);
+/**	@brief Outputs a BIG number to the console (Variable Time)
+ *
+	@param x a BIG number
+ */
+extern void BIG_output(BIG x);
+/**	@brief Outputs a BIG number to the console in raw form (Variable Time for debugging)
+ *
+	@param x a BIG number
+ */
+extern void BIG_rawoutput(BIG x);
+/**	@brief Conditional constant time swap of two BIG numbers
+ *
+	Conditionally swaps parameters in constant time (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s swap takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cswap(BIG x, BIG y, int s);
+/**	@brief Conditional copy of BIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cmove(BIG x, BIG y, int s);
+/**	@brief Conditional copy of DBIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a DBIG number
+	@param y another DBIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_dcmove(BIG x, BIG y, int s);
+/**	@brief Convert from BIG number to byte array (Constant Time)
+ *
+	@param a byte array
+	@param x BIG number
+ */
+extern void BIG_toBytes(char *a, BIG x);
+/**	@brief Convert to BIG number from byte array (Constant Time)
+ *
+	@param x BIG number
+	@param a byte array
+ */
+extern void BIG_fromBytes(BIG x, char *a);
+/**	@brief Convert to BIG number from byte array of given length (Variable Time)
+ *
+	@param x BIG number
+	@param a byte array
+	@param s byte array length
+ */
+extern void BIG_fromBytesLen(BIG x, char *a, int s);
+/**@brief Convert to DBIG number from byte array of given length (Variable Time)
+ *
+   @param x DBIG number
+   @param a byte array
+   @param s byte array length
+ */
+extern void BIG_dfromBytesLen(DBIG x, char *a, int s);
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_doutput(DBIG x); 
+
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_drawoutput(DBIG x);
+
+/**	@brief Copy BIG from Read-Only Memory to a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number in ROM
+ */
+extern void BIG_rcopy(BIG x, const BIG y);
+/**	@brief Copy BIG to another BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_copy(BIG x, BIG y);
+/**	@brief Copy DBIG to another DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_dcopy(DBIG x, DBIG y);
+/**	@brief Copy BIG to upper half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dsucopy(DBIG x, BIG y);
+/**	@brief Copy BIG to lower half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dscopy(DBIG x, BIG y);
+/**	@brief Copy lower half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sdcopy(BIG x, DBIG y);
+/**	@brief Copy upper half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sducopy(BIG x, DBIG y);
+/**	@brief Set BIG to zero (Constant Time)
+ *
+	@param x BIG number to be set to zero  
+ */
+extern void BIG_zero(BIG x);
+/**	@brief Set DBIG to zero (Constant Time)
+ *
+	@param x DBIG number to be set to zero
+ */
+extern void BIG_dzero(DBIG x);
+/**	@brief Set BIG to one (unity) (Constant Time)
+ *
+	@param x BIG number to be set to one.
+ */
+extern void BIG_one(BIG x);
+/**	@brief Set BIG to inverse mod 2^256 (Constant Time)
+ *
+	@param x BIG number to be inverted
+ */
+extern void BIG_invmod2m(BIG x);
+/**	@brief Set BIG to sum of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, sum of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_add(BIG x, BIG y, BIG z);
+
+/**	@brief Set BIG to logical or of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, or of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_or(BIG x, BIG y, BIG z);
+
+/**	@brief Increment BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be incremented
+	@param i integer
+ */
+extern void BIG_inc(BIG x, int i);
+/**	@brief Set BIG to difference of two BIGs (Constant Time)
+ *
+	@param x BIG number, difference of other two - output not normalised
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_sub(BIG x, BIG y, BIG z);
+/**	@brief Decrement BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be decremented
+	@param i integer
+ */
+extern void BIG_dec(BIG x, int i);
+/**	@brief Set DBIG to sum of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, sum of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dadd(DBIG x, DBIG y, DBIG z);
+/**	@brief Set DBIG to difference of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, difference of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dsub(DBIG x, DBIG y, DBIG z);
+/**	@brief Multiply BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_imul(BIG x, BIG y, int i);
+/**	@brief Multiply BIG by not-so-small small integer - output normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+	@return Overflowing bits
+ */
+extern chunk BIG_pmul(BIG x, BIG y, int i);
+/**	@brief Divide BIG by 3 - output normalised (Constant Time)
+ *
+	@param x BIG number
+	@return Remainder
+ */
+extern int BIG_div3(BIG x);
+/**	@brief Multiply BIG by even bigger small integer resulting in a DBIG - output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_pxmul(DBIG x, BIG y, int i);
+/**	@brief Multiply BIG by another BIG resulting in DBIG - inputs normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_mul(DBIG x, BIG y, BIG z);
+/**	@brief Multiply BIG by another BIG resulting in another BIG - inputs normalised and output normalised (Constant Time)
+ *
+	Note that the product must fit into a BIG, and x must be distinct from y and z
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_smul(BIG x, BIG y, BIG z);
+/**	@brief Square BIG resulting in a DBIG - input normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, square of a BIG
+	@param y BIG number to be squared
+ */
+extern void BIG_sqr(DBIG x, BIG y);
+
+/**	@brief Montgomery reduction of a DBIG to a BIG  - input normalised and output normalised (Constant Time)
+ *
+	@param a BIG number, reduction of a BIG
+	@param md BIG number, the modulus
+	@param MC the Montgomery Constant
+	@param d DBIG number to be reduced
+ */
+extern void BIG_monty(BIG a, BIG md, chunk MC, DBIG d);
+
+/**	@brief Shifts a BIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shl(BIG x, int s);
+/**	@brief Fast shifts a BIG left by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Overflow bits
+ */
+extern int BIG_fshl(BIG x, int s);
+/**	@brief Shifts a DBIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshl(DBIG x, int s);
+/**	@brief Shifts a BIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shr(BIG x, int s);
+
+
+/**	@brief Fast time-critical combined shift by 1 bit, subtract and normalise (Constant Time)
+ *
+	@param r BIG number normalised output
+	@param a BIG number to be subtracted from
+	@param m BIG number to be shifted and subtracted
+	@return sign of r
+ */
+extern int BIG_ssn(BIG r, BIG a, BIG m);
+
+/**	@brief Fast shifts a BIG right by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Shifted out bits
+ */
+extern int BIG_fshr(BIG x, int s);
+/**	@brief Shifts a DBIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshr(DBIG x, int s);
+/**	@brief Splits a DBIG into two BIGs - input must be normalised, outputs normalised (Constant Time as used)
+ *
+	Internal function. The value of s must be approximately in the middle of the DBIG.
+	Typically used to extract z mod 2^MODBITS and z/2^MODBITS
+	@param x BIG number, top half of z
+	@param y BIG number, bottom half of z
+	@param z DBIG number to be split in two.
+	@param s Bit position at which to split
+	@return carry-out from top half
+ */
+extern chunk BIG_split(BIG x, BIG y, DBIG z, int s);
+/**	@brief Normalizes a BIG number - output normalised (Constant Time)
+ *
+	All digits of the input BIG are reduced mod 2^BASEBITS
+	@param x BIG number to be normalised
+ */
+extern chunk BIG_norm(BIG x);
+/**	@brief Normalizes a DBIG number - output normalised (Constant Time)
+ *
+	All digits of the input DBIG are reduced mod 2^BASEBITS
+	@param x DBIG number to be normalised
+ */
+extern void BIG_dnorm(DBIG x);
+/**	@brief Compares two BIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first BIG number to be compared
+	@param y second BIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_comp(BIG x, BIG y);
+/**	@brief Compares two DBIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first DBIG number to be compared
+	@param y second DBIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_dcomp(DBIG x, DBIG y);
+/**	@brief Calculate number of bits in a BIG - output normalised (Variable Time)
+ *
+	@param x BIG number
+	@return Number of bits in x
+ */
+extern int BIG_nbits(BIG x);
+/**	@brief Calculate number of bits in a DBIG - output normalised (Variable Time)
+ *
+	@param x DBIG number
+	@return Number of bits in x
+ */
+extern int BIG_dnbits(DBIG x);
+
+/**	@brief Reduce x mod n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctmod(BIG x, BIG n, int bd);
+
+/**	@brief  x=y mod n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctdmod(BIG x, DBIG y, BIG n, int bd);
+
+/**	@brief Divide x by n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctsdiv(BIG x,BIG n,int bd);
+
+/**	@brief  x=y/n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctddiv(BIG x, DBIG y, BIG n,int bd);
+
+
+/**	@brief Reduce x mod n - input and output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+ */
+extern void BIG_mod(BIG x, BIG n);
+/**	@brief Divide x by n - output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+ */
+extern void BIG_sdiv(BIG x, BIG n);
+/**	@brief  x=y mod n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_dmod(BIG x, DBIG y, BIG n);
+/**	@brief  x=y/n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_ddiv(BIG x, DBIG y, BIG n);
+/**	@brief  return parity of BIG, that is the least significant bit (Constant Time)
+ *
+	@param x BIG number
+	@return 0 or 1
+ */
+extern int BIG_parity(BIG x);
+/**	@brief  return i-th of BIG (Constant Time)
+ *
+	@param x BIG number
+	@param i the bit of x to be returned
+	@return 0 or 1
+ */
+extern int BIG_bit(BIG x, int i);
+/**	@brief  return least significant bits of a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param n number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int BIG_lastbits(BIG x, int n);
+/**	@brief  Create a random BIG from a random number generator (Constant Time)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_random(BIG x, csprng *r);
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randomnum(BIG x, BIG n, csprng *r);
+
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus and truncated to max bit length (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param t Maximum bit length
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randtrunc(BIG x, BIG n, int t, csprng *r);
+
+/**	brief  return NAF (Non-Adjacent-Form) value as +/- 1, 3 or 5, inputs must be normalised
+ *
+	Given x and 3*x extracts NAF value from given bit position, and returns number of bits processed, and number of trailing zeros detected if any
+	param x BIG number
+	param x3 BIG number, three times x
+	param i bit position
+	param nbs pointer to integer returning number of bits processed
+	param nzs pointer to integer returning number of trailing 0s
+	return + or - 1, 3 or 5
+*/
+
+/**	@brief  Calculate x=y*z mod n (Variable Time)
+ *
+	Slow method for modular multiplication
+	@param x BIG number, on exit = y*z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modmul(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y/z mod n (Variable Time)
+ *
+	Slow method for modular division
+	@param x BIG number, on exit = y/z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_moddiv(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y^2 mod n (Variable Time)
+ *
+	Slow method for modular squaring
+	@param x BIG number, on exit = y^2 mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modsqr(BIG x, BIG y, BIG n);
+/**	@brief  Calculate x=-y mod n (Variable Time)
+ *
+	Modular negation
+	@param x BIG number, on exit = -y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modneg(BIG x, BIG y, BIG n);
+
+/**	@brief  Calculate x=y+z mod n (Variable Time)
+ *
+	Slow method for modular addition
+	@param x BIG number, on exit = y+z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modadd(BIG x, BIG y, BIG z, BIG n);
+
+/**	@brief  Calculate jacobi Symbol (x/y) (Variable Time)
+ *
+	@param x BIG number
+	@param y BIG number
+	@return Jacobi symbol, -1,0 or 1
+ */
+extern int BIG_jacobi(BIG x, BIG y);
+/**	@brief  Calculate x=1/y mod n (Variable Time)
+ *
+	Modular Inversion - This is slow. Uses binary method.
+	@param x BIG number, on exit = 1/y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_invmodp(BIG x, BIG y, BIG n);
+/** @brief Calculate x=x mod 2^m (Variable Time)
+ *
+	Truncation
+	@param x BIG number, on reduced mod 2^m
+	@param m new truncated size
+*/
+extern void BIG_mod2m(BIG x, int m);
+
+/**	@brief Calculates a*b+c+*d
+ *
+	Calculate partial product of a.b, add in carry c, and add total to d (Constant Time)
+	@param a multiplier
+	@param b multiplicand
+	@param c carry
+	@param d pointer to accumulated bottom half of result
+	@return top half of result
+ */
+
+
+extern int step1(BIG,BIG,BIG);
+extern void step2(BIG,BIG,BIG);
+
+#ifdef dchunk
+
+/* Method required to calculate x*y+c+r, bottom half in r, top half returned */
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    dchunk prod = (dchunk)x * y + c + *r;
+    *r = (chunk)prod & BMASK_B160_56;
+    return (chunk)(prod >> BASEBITS_B160_56);
+}
+
+#else
+
+/* No integer type available that can store double the wordlength */
+/* accumulate partial products */
+
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    chunk x0, x1, y0, y1;
+    chunk bot, top, mid, carry;
+    x0 = x & HMASK_B160_56;
+    x1 = (x >> HBITS_B160_56);
+    y0 = y & HMASK_B160_56;
+    y1 = (y >> HBITS_B160_56);
+    bot = x0 * y0;
+    top = x1 * y1;
+    mid = x0 * y1 + x1 * y0;
+    x0 = mid & HMASK_B160_56;
+    x1 = (mid >> HBITS_B160_56);
+    bot += x0 << HBITS_B160_56;
+    bot += *r;
+    bot += c;
+
+    top += x1;
+    carry = bot >> BASEBITS_B160_56;
+    bot &= BMASK_B160_56;
+    top += carry;
+
+    *r = bot;
+    return top;
+}
+
+#endif
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/big_B168_60.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/big_B168_60.h
new file mode 100644
index 0000000..0a57612
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/big_B168_60.h
@@ -0,0 +1,697 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file big.h
+ * @author Mike Scott
+ * @date 23rd February 2016
+ * @brief Big number Header File
+ *
+ *
+ */
+
+#ifndef BIG_B168_60_H
+#define BIG_B168_60_H
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <inttypes.h>
+#include "arch.h"
+#include "core.h"
+#include "config_big_B168_60.h"
+
+using namespace core;
+
+/* could comment this out if code size is a major issue */
+#define UNWOUND
+/* Normally recommended, but may not be optimal for some architectures, for example 32-bit ARM M4 */
+#define USE_KARATSUBA
+
+#define BIGBITS_B168_60 (8*MODBYTES_B168_60)
+#define NLEN_B168_60 (1+((8*MODBYTES_B168_60-1)/BASEBITS_B168_60))
+#define DNLEN_B168_60 2*NLEN_B168_60
+#define BMASK_B168_60 (((chunk)1<<BASEBITS_B168_60)-1) /**< Mask = 2^BASEBITS-1 */
+#define NEXCESS_B168_60 (1<<(CHUNK-BASEBITS_B168_60-1))           /**< 2^(CHUNK-BASEBITS-1) - digit cannot be multiplied by more than this before normalisation */
+
+#define HBITS_B168_60 (BASEBITS_B168_60/2)      /**< Number of bits in number base divided by 2 */
+#define HMASK_B168_60 (((chunk)1<<HBITS_B168_60)-1)    /**< Mask = 2^HBITS-1 */
+
+//#define DEBUG_NORM
+
+#ifdef DEBUG_NORM  /* Add an extra location to track chunk extension */
+#define MPV_B168_60 NLEN_B168_60
+#define MNV_B168_60 (NLEN_B168_60+1)
+#define DMPV_B168_60 DNLEN_B168_60
+#define DMNV_B168_60 (DNLEN_B168_60+1)
+
+#endif
+
+namespace B168_60 {
+
+//extern int BIGMULS;
+//extern int BIGSQRS;
+
+#ifdef DEBUG_NORM
+typedef chunk BIG[NLEN_B168_60 + 2]; /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B168_60 + 2]; /**< Define type DBIG as array of chunks */
+#else
+typedef chunk BIG[NLEN_B168_60];     /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B168_60];   /**< Define type DBIG as array of chunks */
+#endif
+
+/* BIG number prototypes */
+
+/**	@brief Tests for BIG equal to zero (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_iszilch(BIG x);
+/**	@brief Tests for BIG equal to one (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if one, else returns 0
+ */
+extern int BIG_isunity(BIG x);
+/**	@brief Tests for DBIG equal to zero (Constant Time)
+ *
+	@param x a DBIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_diszilch(DBIG x);
+/**	@brief Outputs a BIG number to the console (Variable Time)
+ *
+	@param x a BIG number
+ */
+extern void BIG_output(BIG x);
+/**	@brief Outputs a BIG number to the console in raw form (Variable Time for debugging)
+ *
+	@param x a BIG number
+ */
+extern void BIG_rawoutput(BIG x);
+/**	@brief Conditional constant time swap of two BIG numbers
+ *
+	Conditionally swaps parameters in constant time (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s swap takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cswap(BIG x, BIG y, int s);
+/**	@brief Conditional copy of BIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cmove(BIG x, BIG y, int s);
+/**	@brief Conditional copy of DBIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a DBIG number
+	@param y another DBIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_dcmove(BIG x, BIG y, int s);
+/**	@brief Convert from BIG number to byte array (Constant Time)
+ *
+	@param a byte array
+	@param x BIG number
+ */
+extern void BIG_toBytes(char *a, BIG x);
+/**	@brief Convert to BIG number from byte array (Constant Time)
+ *
+	@param x BIG number
+	@param a byte array
+ */
+extern void BIG_fromBytes(BIG x, char *a);
+/**	@brief Convert to BIG number from byte array of given length (Variable Time)
+ *
+	@param x BIG number
+	@param a byte array
+	@param s byte array length
+ */
+extern void BIG_fromBytesLen(BIG x, char *a, int s);
+/**@brief Convert to DBIG number from byte array of given length (Variable Time)
+ *
+   @param x DBIG number
+   @param a byte array
+   @param s byte array length
+ */
+extern void BIG_dfromBytesLen(DBIG x, char *a, int s);
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_doutput(DBIG x); 
+
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_drawoutput(DBIG x);
+
+/**	@brief Copy BIG from Read-Only Memory to a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number in ROM
+ */
+extern void BIG_rcopy(BIG x, const BIG y);
+/**	@brief Copy BIG to another BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_copy(BIG x, BIG y);
+/**	@brief Copy DBIG to another DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_dcopy(DBIG x, DBIG y);
+/**	@brief Copy BIG to upper half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dsucopy(DBIG x, BIG y);
+/**	@brief Copy BIG to lower half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dscopy(DBIG x, BIG y);
+/**	@brief Copy lower half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sdcopy(BIG x, DBIG y);
+/**	@brief Copy upper half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sducopy(BIG x, DBIG y);
+/**	@brief Set BIG to zero (Constant Time)
+ *
+	@param x BIG number to be set to zero  
+ */
+extern void BIG_zero(BIG x);
+/**	@brief Set DBIG to zero (Constant Time)
+ *
+	@param x DBIG number to be set to zero
+ */
+extern void BIG_dzero(DBIG x);
+/**	@brief Set BIG to one (unity) (Constant Time)
+ *
+	@param x BIG number to be set to one.
+ */
+extern void BIG_one(BIG x);
+/**	@brief Set BIG to inverse mod 2^256 (Constant Time)
+ *
+	@param x BIG number to be inverted
+ */
+extern void BIG_invmod2m(BIG x);
+/**	@brief Set BIG to sum of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, sum of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_add(BIG x, BIG y, BIG z);
+
+/**	@brief Set BIG to logical or of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, or of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_or(BIG x, BIG y, BIG z);
+
+/**	@brief Increment BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be incremented
+	@param i integer
+ */
+extern void BIG_inc(BIG x, int i);
+/**	@brief Set BIG to difference of two BIGs (Constant Time)
+ *
+	@param x BIG number, difference of other two - output not normalised
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_sub(BIG x, BIG y, BIG z);
+/**	@brief Decrement BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be decremented
+	@param i integer
+ */
+extern void BIG_dec(BIG x, int i);
+/**	@brief Set DBIG to sum of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, sum of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dadd(DBIG x, DBIG y, DBIG z);
+/**	@brief Set DBIG to difference of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, difference of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dsub(DBIG x, DBIG y, DBIG z);
+/**	@brief Multiply BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_imul(BIG x, BIG y, int i);
+/**	@brief Multiply BIG by not-so-small small integer - output normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+	@return Overflowing bits
+ */
+extern chunk BIG_pmul(BIG x, BIG y, int i);
+/**	@brief Divide BIG by 3 - output normalised (Constant Time)
+ *
+	@param x BIG number
+	@return Remainder
+ */
+extern int BIG_div3(BIG x);
+/**	@brief Multiply BIG by even bigger small integer resulting in a DBIG - output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_pxmul(DBIG x, BIG y, int i);
+/**	@brief Multiply BIG by another BIG resulting in DBIG - inputs normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_mul(DBIG x, BIG y, BIG z);
+/**	@brief Multiply BIG by another BIG resulting in another BIG - inputs normalised and output normalised (Constant Time)
+ *
+	Note that the product must fit into a BIG, and x must be distinct from y and z
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_smul(BIG x, BIG y, BIG z);
+/**	@brief Square BIG resulting in a DBIG - input normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, square of a BIG
+	@param y BIG number to be squared
+ */
+extern void BIG_sqr(DBIG x, BIG y);
+
+/**	@brief Montgomery reduction of a DBIG to a BIG  - input normalised and output normalised (Constant Time)
+ *
+	@param a BIG number, reduction of a BIG
+	@param md BIG number, the modulus
+	@param MC the Montgomery Constant
+	@param d DBIG number to be reduced
+ */
+extern void BIG_monty(BIG a, BIG md, chunk MC, DBIG d);
+
+/**	@brief Shifts a BIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shl(BIG x, int s);
+/**	@brief Fast shifts a BIG left by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Overflow bits
+ */
+extern int BIG_fshl(BIG x, int s);
+/**	@brief Shifts a DBIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshl(DBIG x, int s);
+/**	@brief Shifts a BIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shr(BIG x, int s);
+
+
+/**	@brief Fast time-critical combined shift by 1 bit, subtract and normalise (Constant Time)
+ *
+	@param r BIG number normalised output
+	@param a BIG number to be subtracted from
+	@param m BIG number to be shifted and subtracted
+	@return sign of r
+ */
+extern int BIG_ssn(BIG r, BIG a, BIG m);
+
+/**	@brief Fast shifts a BIG right by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Shifted out bits
+ */
+extern int BIG_fshr(BIG x, int s);
+/**	@brief Shifts a DBIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshr(DBIG x, int s);
+/**	@brief Splits a DBIG into two BIGs - input must be normalised, outputs normalised (Constant Time as used)
+ *
+	Internal function. The value of s must be approximately in the middle of the DBIG.
+	Typically used to extract z mod 2^MODBITS and z/2^MODBITS
+	@param x BIG number, top half of z
+	@param y BIG number, bottom half of z
+	@param z DBIG number to be split in two.
+	@param s Bit position at which to split
+	@return carry-out from top half
+ */
+extern chunk BIG_split(BIG x, BIG y, DBIG z, int s);
+/**	@brief Normalizes a BIG number - output normalised (Constant Time)
+ *
+	All digits of the input BIG are reduced mod 2^BASEBITS
+	@param x BIG number to be normalised
+ */
+extern chunk BIG_norm(BIG x);
+/**	@brief Normalizes a DBIG number - output normalised (Constant Time)
+ *
+	All digits of the input DBIG are reduced mod 2^BASEBITS
+	@param x DBIG number to be normalised
+ */
+extern void BIG_dnorm(DBIG x);
+/**	@brief Compares two BIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first BIG number to be compared
+	@param y second BIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_comp(BIG x, BIG y);
+/**	@brief Compares two DBIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first DBIG number to be compared
+	@param y second DBIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_dcomp(DBIG x, DBIG y);
+/**	@brief Calculate number of bits in a BIG - output normalised (Variable Time)
+ *
+	@param x BIG number
+	@return Number of bits in x
+ */
+extern int BIG_nbits(BIG x);
+/**	@brief Calculate number of bits in a DBIG - output normalised (Variable Time)
+ *
+	@param x DBIG number
+	@return Number of bits in x
+ */
+extern int BIG_dnbits(DBIG x);
+
+/**	@brief Reduce x mod n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctmod(BIG x, BIG n, int bd);
+
+/**	@brief  x=y mod n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctdmod(BIG x, DBIG y, BIG n, int bd);
+
+/**	@brief Divide x by n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctsdiv(BIG x,BIG n,int bd);
+
+/**	@brief  x=y/n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctddiv(BIG x, DBIG y, BIG n,int bd);
+
+
+/**	@brief Reduce x mod n - input and output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+ */
+extern void BIG_mod(BIG x, BIG n);
+/**	@brief Divide x by n - output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+ */
+extern void BIG_sdiv(BIG x, BIG n);
+/**	@brief  x=y mod n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_dmod(BIG x, DBIG y, BIG n);
+/**	@brief  x=y/n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_ddiv(BIG x, DBIG y, BIG n);
+/**	@brief  return parity of BIG, that is the least significant bit (Constant Time)
+ *
+	@param x BIG number
+	@return 0 or 1
+ */
+extern int BIG_parity(BIG x);
+/**	@brief  return i-th of BIG (Constant Time)
+ *
+	@param x BIG number
+	@param i the bit of x to be returned
+	@return 0 or 1
+ */
+extern int BIG_bit(BIG x, int i);
+/**	@brief  return least significant bits of a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param n number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int BIG_lastbits(BIG x, int n);
+/**	@brief  Create a random BIG from a random number generator (Constant Time)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_random(BIG x, csprng *r);
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randomnum(BIG x, BIG n, csprng *r);
+
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus and truncated to max bit length (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param t Maximum bit length
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randtrunc(BIG x, BIG n, int t, csprng *r);
+
+/**	brief  return NAF (Non-Adjacent-Form) value as +/- 1, 3 or 5, inputs must be normalised
+ *
+	Given x and 3*x extracts NAF value from given bit position, and returns number of bits processed, and number of trailing zeros detected if any
+	param x BIG number
+	param x3 BIG number, three times x
+	param i bit position
+	param nbs pointer to integer returning number of bits processed
+	param nzs pointer to integer returning number of trailing 0s
+	return + or - 1, 3 or 5
+*/
+
+/**	@brief  Calculate x=y*z mod n (Variable Time)
+ *
+	Slow method for modular multiplication
+	@param x BIG number, on exit = y*z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modmul(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y/z mod n (Variable Time)
+ *
+	Slow method for modular division
+	@param x BIG number, on exit = y/z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_moddiv(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y^2 mod n (Variable Time)
+ *
+	Slow method for modular squaring
+	@param x BIG number, on exit = y^2 mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modsqr(BIG x, BIG y, BIG n);
+/**	@brief  Calculate x=-y mod n (Variable Time)
+ *
+	Modular negation
+	@param x BIG number, on exit = -y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modneg(BIG x, BIG y, BIG n);
+
+/**	@brief  Calculate x=y+z mod n (Variable Time)
+ *
+	Slow method for modular addition
+	@param x BIG number, on exit = y+z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modadd(BIG x, BIG y, BIG z, BIG n);
+
+/**	@brief  Calculate jacobi Symbol (x/y) (Variable Time)
+ *
+	@param x BIG number
+	@param y BIG number
+	@return Jacobi symbol, -1,0 or 1
+ */
+extern int BIG_jacobi(BIG x, BIG y);
+/**	@brief  Calculate x=1/y mod n (Variable Time)
+ *
+	Modular Inversion - This is slow. Uses binary method.
+	@param x BIG number, on exit = 1/y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_invmodp(BIG x, BIG y, BIG n);
+/** @brief Calculate x=x mod 2^m (Variable Time)
+ *
+	Truncation
+	@param x BIG number, on reduced mod 2^m
+	@param m new truncated size
+*/
+extern void BIG_mod2m(BIG x, int m);
+
+/**	@brief Calculates a*b+c+*d
+ *
+	Calculate partial product of a.b, add in carry c, and add total to d (Constant Time)
+	@param a multiplier
+	@param b multiplicand
+	@param c carry
+	@param d pointer to accumulated bottom half of result
+	@return top half of result
+ */
+
+
+extern int step1(BIG,BIG,BIG);
+extern void step2(BIG,BIG,BIG);
+
+#ifdef dchunk
+
+/* Method required to calculate x*y+c+r, bottom half in r, top half returned */
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    dchunk prod = (dchunk)x * y + c + *r;
+    *r = (chunk)prod & BMASK_B168_60;
+    return (chunk)(prod >> BASEBITS_B168_60);
+}
+
+#else
+
+/* No integer type available that can store double the wordlength */
+/* accumulate partial products */
+
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    chunk x0, x1, y0, y1;
+    chunk bot, top, mid, carry;
+    x0 = x & HMASK_B168_60;
+    x1 = (x >> HBITS_B168_60);
+    y0 = y & HMASK_B168_60;
+    y1 = (y >> HBITS_B168_60);
+    bot = x0 * y0;
+    top = x1 * y1;
+    mid = x0 * y1 + x1 * y0;
+    x0 = mid & HMASK_B168_60;
+    x1 = (mid >> HBITS_B168_60);
+    bot += x0 << HBITS_B168_60;
+    bot += *r;
+    bot += c;
+
+    top += x1;
+    carry = bot >> BASEBITS_B168_60;
+    bot &= BMASK_B168_60;
+    top += carry;
+
+    *r = bot;
+    return top;
+}
+
+#endif
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/big_B256_56.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/big_B256_56.h
new file mode 100644
index 0000000..c16e9a1
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/big_B256_56.h
@@ -0,0 +1,697 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file big.h
+ * @author Mike Scott
+ * @date 23rd February 2016
+ * @brief Big number Header File
+ *
+ *
+ */
+
+#ifndef BIG_B256_56_H
+#define BIG_B256_56_H
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <inttypes.h>
+#include "arch.h"
+#include "core.h"
+#include "config_big_B256_56.h"
+
+using namespace core;
+
+/* could comment this out if code size is a major issue */
+#define UNWOUND
+/* Normally recommended, but may not be optimal for some architectures, for example 32-bit ARM M4 */
+#define USE_KARATSUBA
+
+#define BIGBITS_B256_56 (8*MODBYTES_B256_56)
+#define NLEN_B256_56 (1+((8*MODBYTES_B256_56-1)/BASEBITS_B256_56))
+#define DNLEN_B256_56 2*NLEN_B256_56
+#define BMASK_B256_56 (((chunk)1<<BASEBITS_B256_56)-1) /**< Mask = 2^BASEBITS-1 */
+#define NEXCESS_B256_56 (1<<(CHUNK-BASEBITS_B256_56-1))           /**< 2^(CHUNK-BASEBITS-1) - digit cannot be multiplied by more than this before normalisation */
+
+#define HBITS_B256_56 (BASEBITS_B256_56/2)      /**< Number of bits in number base divided by 2 */
+#define HMASK_B256_56 (((chunk)1<<HBITS_B256_56)-1)    /**< Mask = 2^HBITS-1 */
+
+//#define DEBUG_NORM
+
+#ifdef DEBUG_NORM  /* Add an extra location to track chunk extension */
+#define MPV_B256_56 NLEN_B256_56
+#define MNV_B256_56 (NLEN_B256_56+1)
+#define DMPV_B256_56 DNLEN_B256_56
+#define DMNV_B256_56 (DNLEN_B256_56+1)
+
+#endif
+
+namespace B256_56 {
+
+//extern int BIGMULS;
+//extern int BIGSQRS;
+
+#ifdef DEBUG_NORM
+typedef chunk BIG[NLEN_B256_56 + 2]; /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B256_56 + 2]; /**< Define type DBIG as array of chunks */
+#else
+typedef chunk BIG[NLEN_B256_56];     /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B256_56];   /**< Define type DBIG as array of chunks */
+#endif
+
+/* BIG number prototypes */
+
+/**	@brief Tests for BIG equal to zero (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_iszilch(BIG x);
+/**	@brief Tests for BIG equal to one (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if one, else returns 0
+ */
+extern int BIG_isunity(BIG x);
+/**	@brief Tests for DBIG equal to zero (Constant Time)
+ *
+	@param x a DBIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_diszilch(DBIG x);
+/**	@brief Outputs a BIG number to the console (Variable Time)
+ *
+	@param x a BIG number
+ */
+extern void BIG_output(BIG x);
+/**	@brief Outputs a BIG number to the console in raw form (Variable Time for debugging)
+ *
+	@param x a BIG number
+ */
+extern void BIG_rawoutput(BIG x);
+/**	@brief Conditional constant time swap of two BIG numbers
+ *
+	Conditionally swaps parameters in constant time (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s swap takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cswap(BIG x, BIG y, int s);
+/**	@brief Conditional copy of BIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cmove(BIG x, BIG y, int s);
+/**	@brief Conditional copy of DBIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a DBIG number
+	@param y another DBIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_dcmove(BIG x, BIG y, int s);
+/**	@brief Convert from BIG number to byte array (Constant Time)
+ *
+	@param a byte array
+	@param x BIG number
+ */
+extern void BIG_toBytes(char *a, BIG x);
+/**	@brief Convert to BIG number from byte array (Constant Time)
+ *
+	@param x BIG number
+	@param a byte array
+ */
+extern void BIG_fromBytes(BIG x, char *a);
+/**	@brief Convert to BIG number from byte array of given length (Variable Time)
+ *
+	@param x BIG number
+	@param a byte array
+	@param s byte array length
+ */
+extern void BIG_fromBytesLen(BIG x, char *a, int s);
+/**@brief Convert to DBIG number from byte array of given length (Variable Time)
+ *
+   @param x DBIG number
+   @param a byte array
+   @param s byte array length
+ */
+extern void BIG_dfromBytesLen(DBIG x, char *a, int s);
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_doutput(DBIG x); 
+
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_drawoutput(DBIG x);
+
+/**	@brief Copy BIG from Read-Only Memory to a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number in ROM
+ */
+extern void BIG_rcopy(BIG x, const BIG y);
+/**	@brief Copy BIG to another BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_copy(BIG x, BIG y);
+/**	@brief Copy DBIG to another DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_dcopy(DBIG x, DBIG y);
+/**	@brief Copy BIG to upper half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dsucopy(DBIG x, BIG y);
+/**	@brief Copy BIG to lower half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dscopy(DBIG x, BIG y);
+/**	@brief Copy lower half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sdcopy(BIG x, DBIG y);
+/**	@brief Copy upper half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sducopy(BIG x, DBIG y);
+/**	@brief Set BIG to zero (Constant Time)
+ *
+	@param x BIG number to be set to zero  
+ */
+extern void BIG_zero(BIG x);
+/**	@brief Set DBIG to zero (Constant Time)
+ *
+	@param x DBIG number to be set to zero
+ */
+extern void BIG_dzero(DBIG x);
+/**	@brief Set BIG to one (unity) (Constant Time)
+ *
+	@param x BIG number to be set to one.
+ */
+extern void BIG_one(BIG x);
+/**	@brief Set BIG to inverse mod 2^256 (Constant Time)
+ *
+	@param x BIG number to be inverted
+ */
+extern void BIG_invmod2m(BIG x);
+/**	@brief Set BIG to sum of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, sum of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_add(BIG x, BIG y, BIG z);
+
+/**	@brief Set BIG to logical or of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, or of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_or(BIG x, BIG y, BIG z);
+
+/**	@brief Increment BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be incremented
+	@param i integer
+ */
+extern void BIG_inc(BIG x, int i);
+/**	@brief Set BIG to difference of two BIGs (Constant Time)
+ *
+	@param x BIG number, difference of other two - output not normalised
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_sub(BIG x, BIG y, BIG z);
+/**	@brief Decrement BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be decremented
+	@param i integer
+ */
+extern void BIG_dec(BIG x, int i);
+/**	@brief Set DBIG to sum of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, sum of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dadd(DBIG x, DBIG y, DBIG z);
+/**	@brief Set DBIG to difference of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, difference of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dsub(DBIG x, DBIG y, DBIG z);
+/**	@brief Multiply BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_imul(BIG x, BIG y, int i);
+/**	@brief Multiply BIG by not-so-small small integer - output normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+	@return Overflowing bits
+ */
+extern chunk BIG_pmul(BIG x, BIG y, int i);
+/**	@brief Divide BIG by 3 - output normalised (Constant Time)
+ *
+	@param x BIG number
+	@return Remainder
+ */
+extern int BIG_div3(BIG x);
+/**	@brief Multiply BIG by even bigger small integer resulting in a DBIG - output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_pxmul(DBIG x, BIG y, int i);
+/**	@brief Multiply BIG by another BIG resulting in DBIG - inputs normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_mul(DBIG x, BIG y, BIG z);
+/**	@brief Multiply BIG by another BIG resulting in another BIG - inputs normalised and output normalised (Constant Time)
+ *
+	Note that the product must fit into a BIG, and x must be distinct from y and z
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_smul(BIG x, BIG y, BIG z);
+/**	@brief Square BIG resulting in a DBIG - input normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, square of a BIG
+	@param y BIG number to be squared
+ */
+extern void BIG_sqr(DBIG x, BIG y);
+
+/**	@brief Montgomery reduction of a DBIG to a BIG  - input normalised and output normalised (Constant Time)
+ *
+	@param a BIG number, reduction of a BIG
+	@param md BIG number, the modulus
+	@param MC the Montgomery Constant
+	@param d DBIG number to be reduced
+ */
+extern void BIG_monty(BIG a, BIG md, chunk MC, DBIG d);
+
+/**	@brief Shifts a BIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shl(BIG x, int s);
+/**	@brief Fast shifts a BIG left by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Overflow bits
+ */
+extern int BIG_fshl(BIG x, int s);
+/**	@brief Shifts a DBIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshl(DBIG x, int s);
+/**	@brief Shifts a BIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shr(BIG x, int s);
+
+
+/**	@brief Fast time-critical combined shift by 1 bit, subtract and normalise (Constant Time)
+ *
+	@param r BIG number normalised output
+	@param a BIG number to be subtracted from
+	@param m BIG number to be shifted and subtracted
+	@return sign of r
+ */
+extern int BIG_ssn(BIG r, BIG a, BIG m);
+
+/**	@brief Fast shifts a BIG right by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Shifted out bits
+ */
+extern int BIG_fshr(BIG x, int s);
+/**	@brief Shifts a DBIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshr(DBIG x, int s);
+/**	@brief Splits a DBIG into two BIGs - input must be normalised, outputs normalised (Constant Time as used)
+ *
+	Internal function. The value of s must be approximately in the middle of the DBIG.
+	Typically used to extract z mod 2^MODBITS and z/2^MODBITS
+	@param x BIG number, top half of z
+	@param y BIG number, bottom half of z
+	@param z DBIG number to be split in two.
+	@param s Bit position at which to split
+	@return carry-out from top half
+ */
+extern chunk BIG_split(BIG x, BIG y, DBIG z, int s);
+/**	@brief Normalizes a BIG number - output normalised (Constant Time)
+ *
+	All digits of the input BIG are reduced mod 2^BASEBITS
+	@param x BIG number to be normalised
+ */
+extern chunk BIG_norm(BIG x);
+/**	@brief Normalizes a DBIG number - output normalised (Constant Time)
+ *
+	All digits of the input DBIG are reduced mod 2^BASEBITS
+	@param x DBIG number to be normalised
+ */
+extern void BIG_dnorm(DBIG x);
+/**	@brief Compares two BIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first BIG number to be compared
+	@param y second BIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_comp(BIG x, BIG y);
+/**	@brief Compares two DBIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first DBIG number to be compared
+	@param y second DBIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_dcomp(DBIG x, DBIG y);
+/**	@brief Calculate number of bits in a BIG - output normalised (Variable Time)
+ *
+	@param x BIG number
+	@return Number of bits in x
+ */
+extern int BIG_nbits(BIG x);
+/**	@brief Calculate number of bits in a DBIG - output normalised (Variable Time)
+ *
+	@param x DBIG number
+	@return Number of bits in x
+ */
+extern int BIG_dnbits(DBIG x);
+
+/**	@brief Reduce x mod n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctmod(BIG x, BIG n, int bd);
+
+/**	@brief  x=y mod n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctdmod(BIG x, DBIG y, BIG n, int bd);
+
+/**	@brief Divide x by n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctsdiv(BIG x,BIG n,int bd);
+
+/**	@brief  x=y/n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctddiv(BIG x, DBIG y, BIG n,int bd);
+
+
+/**	@brief Reduce x mod n - input and output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+ */
+extern void BIG_mod(BIG x, BIG n);
+/**	@brief Divide x by n - output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+ */
+extern void BIG_sdiv(BIG x, BIG n);
+/**	@brief  x=y mod n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_dmod(BIG x, DBIG y, BIG n);
+/**	@brief  x=y/n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_ddiv(BIG x, DBIG y, BIG n);
+/**	@brief  return parity of BIG, that is the least significant bit (Constant Time)
+ *
+	@param x BIG number
+	@return 0 or 1
+ */
+extern int BIG_parity(BIG x);
+/**	@brief  return i-th of BIG (Constant Time)
+ *
+	@param x BIG number
+	@param i the bit of x to be returned
+	@return 0 or 1
+ */
+extern int BIG_bit(BIG x, int i);
+/**	@brief  return least significant bits of a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param n number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int BIG_lastbits(BIG x, int n);
+/**	@brief  Create a random BIG from a random number generator (Constant Time)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_random(BIG x, csprng *r);
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randomnum(BIG x, BIG n, csprng *r);
+
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus and truncated to max bit length (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param t Maximum bit length
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randtrunc(BIG x, BIG n, int t, csprng *r);
+
+/**	brief  return NAF (Non-Adjacent-Form) value as +/- 1, 3 or 5, inputs must be normalised
+ *
+	Given x and 3*x extracts NAF value from given bit position, and returns number of bits processed, and number of trailing zeros detected if any
+	param x BIG number
+	param x3 BIG number, three times x
+	param i bit position
+	param nbs pointer to integer returning number of bits processed
+	param nzs pointer to integer returning number of trailing 0s
+	return + or - 1, 3 or 5
+*/
+
+/**	@brief  Calculate x=y*z mod n (Variable Time)
+ *
+	Slow method for modular multiplication
+	@param x BIG number, on exit = y*z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modmul(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y/z mod n (Variable Time)
+ *
+	Slow method for modular division
+	@param x BIG number, on exit = y/z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_moddiv(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y^2 mod n (Variable Time)
+ *
+	Slow method for modular squaring
+	@param x BIG number, on exit = y^2 mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modsqr(BIG x, BIG y, BIG n);
+/**	@brief  Calculate x=-y mod n (Variable Time)
+ *
+	Modular negation
+	@param x BIG number, on exit = -y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modneg(BIG x, BIG y, BIG n);
+
+/**	@brief  Calculate x=y+z mod n (Variable Time)
+ *
+	Slow method for modular addition
+	@param x BIG number, on exit = y+z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modadd(BIG x, BIG y, BIG z, BIG n);
+
+/**	@brief  Calculate jacobi Symbol (x/y) (Variable Time)
+ *
+	@param x BIG number
+	@param y BIG number
+	@return Jacobi symbol, -1,0 or 1
+ */
+extern int BIG_jacobi(BIG x, BIG y);
+/**	@brief  Calculate x=1/y mod n (Variable Time)
+ *
+	Modular Inversion - This is slow. Uses binary method.
+	@param x BIG number, on exit = 1/y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_invmodp(BIG x, BIG y, BIG n);
+/** @brief Calculate x=x mod 2^m (Variable Time)
+ *
+	Truncation
+	@param x BIG number, on reduced mod 2^m
+	@param m new truncated size
+*/
+extern void BIG_mod2m(BIG x, int m);
+
+/**	@brief Calculates a*b+c+*d
+ *
+	Calculate partial product of a.b, add in carry c, and add total to d (Constant Time)
+	@param a multiplier
+	@param b multiplicand
+	@param c carry
+	@param d pointer to accumulated bottom half of result
+	@return top half of result
+ */
+
+
+extern int step1(BIG,BIG,BIG);
+extern void step2(BIG,BIG,BIG);
+
+#ifdef dchunk
+
+/* Method required to calculate x*y+c+r, bottom half in r, top half returned */
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    dchunk prod = (dchunk)x * y + c + *r;
+    *r = (chunk)prod & BMASK_B256_56;
+    return (chunk)(prod >> BASEBITS_B256_56);
+}
+
+#else
+
+/* No integer type available that can store double the wordlength */
+/* accumulate partial products */
+
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    chunk x0, x1, y0, y1;
+    chunk bot, top, mid, carry;
+    x0 = x & HMASK_B256_56;
+    x1 = (x >> HBITS_B256_56);
+    y0 = y & HMASK_B256_56;
+    y1 = (y >> HBITS_B256_56);
+    bot = x0 * y0;
+    top = x1 * y1;
+    mid = x0 * y1 + x1 * y0;
+    x0 = mid & HMASK_B256_56;
+    x1 = (mid >> HBITS_B256_56);
+    bot += x0 << HBITS_B256_56;
+    bot += *r;
+    bot += c;
+
+    top += x1;
+    carry = bot >> BASEBITS_B256_56;
+    bot &= BMASK_B256_56;
+    top += carry;
+
+    *r = bot;
+    return top;
+}
+
+#endif
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/big_B288_60.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/big_B288_60.h
new file mode 100644
index 0000000..2034bee
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/big_B288_60.h
@@ -0,0 +1,697 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file big.h
+ * @author Mike Scott
+ * @date 23rd February 2016
+ * @brief Big number Header File
+ *
+ *
+ */
+
+#ifndef BIG_B288_60_H
+#define BIG_B288_60_H
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <inttypes.h>
+#include "arch.h"
+#include "core.h"
+#include "config_big_B288_60.h"
+
+using namespace core;
+
+/* could comment this out if code size is a major issue */
+#define UNWOUND
+/* Normally recommended, but may not be optimal for some architectures, for example 32-bit ARM M4 */
+#define USE_KARATSUBA
+
+#define BIGBITS_B288_60 (8*MODBYTES_B288_60)
+#define NLEN_B288_60 (1+((8*MODBYTES_B288_60-1)/BASEBITS_B288_60))
+#define DNLEN_B288_60 2*NLEN_B288_60
+#define BMASK_B288_60 (((chunk)1<<BASEBITS_B288_60)-1) /**< Mask = 2^BASEBITS-1 */
+#define NEXCESS_B288_60 (1<<(CHUNK-BASEBITS_B288_60-1))           /**< 2^(CHUNK-BASEBITS-1) - digit cannot be multiplied by more than this before normalisation */
+
+#define HBITS_B288_60 (BASEBITS_B288_60/2)      /**< Number of bits in number base divided by 2 */
+#define HMASK_B288_60 (((chunk)1<<HBITS_B288_60)-1)    /**< Mask = 2^HBITS-1 */
+
+//#define DEBUG_NORM
+
+#ifdef DEBUG_NORM  /* Add an extra location to track chunk extension */
+#define MPV_B288_60 NLEN_B288_60
+#define MNV_B288_60 (NLEN_B288_60+1)
+#define DMPV_B288_60 DNLEN_B288_60
+#define DMNV_B288_60 (DNLEN_B288_60+1)
+
+#endif
+
+namespace B288_60 {
+
+//extern int BIGMULS;
+//extern int BIGSQRS;
+
+#ifdef DEBUG_NORM
+typedef chunk BIG[NLEN_B288_60 + 2]; /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B288_60 + 2]; /**< Define type DBIG as array of chunks */
+#else
+typedef chunk BIG[NLEN_B288_60];     /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B288_60];   /**< Define type DBIG as array of chunks */
+#endif
+
+/* BIG number prototypes */
+
+/**	@brief Tests for BIG equal to zero (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_iszilch(BIG x);
+/**	@brief Tests for BIG equal to one (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if one, else returns 0
+ */
+extern int BIG_isunity(BIG x);
+/**	@brief Tests for DBIG equal to zero (Constant Time)
+ *
+	@param x a DBIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_diszilch(DBIG x);
+/**	@brief Outputs a BIG number to the console (Variable Time)
+ *
+	@param x a BIG number
+ */
+extern void BIG_output(BIG x);
+/**	@brief Outputs a BIG number to the console in raw form (Variable Time for debugging)
+ *
+	@param x a BIG number
+ */
+extern void BIG_rawoutput(BIG x);
+/**	@brief Conditional constant time swap of two BIG numbers
+ *
+	Conditionally swaps parameters in constant time (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s swap takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cswap(BIG x, BIG y, int s);
+/**	@brief Conditional copy of BIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cmove(BIG x, BIG y, int s);
+/**	@brief Conditional copy of DBIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a DBIG number
+	@param y another DBIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_dcmove(BIG x, BIG y, int s);
+/**	@brief Convert from BIG number to byte array (Constant Time)
+ *
+	@param a byte array
+	@param x BIG number
+ */
+extern void BIG_toBytes(char *a, BIG x);
+/**	@brief Convert to BIG number from byte array (Constant Time)
+ *
+	@param x BIG number
+	@param a byte array
+ */
+extern void BIG_fromBytes(BIG x, char *a);
+/**	@brief Convert to BIG number from byte array of given length (Variable Time)
+ *
+	@param x BIG number
+	@param a byte array
+	@param s byte array length
+ */
+extern void BIG_fromBytesLen(BIG x, char *a, int s);
+/**@brief Convert to DBIG number from byte array of given length (Variable Time)
+ *
+   @param x DBIG number
+   @param a byte array
+   @param s byte array length
+ */
+extern void BIG_dfromBytesLen(DBIG x, char *a, int s);
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_doutput(DBIG x); 
+
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_drawoutput(DBIG x);
+
+/**	@brief Copy BIG from Read-Only Memory to a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number in ROM
+ */
+extern void BIG_rcopy(BIG x, const BIG y);
+/**	@brief Copy BIG to another BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_copy(BIG x, BIG y);
+/**	@brief Copy DBIG to another DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_dcopy(DBIG x, DBIG y);
+/**	@brief Copy BIG to upper half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dsucopy(DBIG x, BIG y);
+/**	@brief Copy BIG to lower half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dscopy(DBIG x, BIG y);
+/**	@brief Copy lower half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sdcopy(BIG x, DBIG y);
+/**	@brief Copy upper half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sducopy(BIG x, DBIG y);
+/**	@brief Set BIG to zero (Constant Time)
+ *
+	@param x BIG number to be set to zero  
+ */
+extern void BIG_zero(BIG x);
+/**	@brief Set DBIG to zero (Constant Time)
+ *
+	@param x DBIG number to be set to zero
+ */
+extern void BIG_dzero(DBIG x);
+/**	@brief Set BIG to one (unity) (Constant Time)
+ *
+	@param x BIG number to be set to one.
+ */
+extern void BIG_one(BIG x);
+/**	@brief Set BIG to inverse mod 2^256 (Constant Time)
+ *
+	@param x BIG number to be inverted
+ */
+extern void BIG_invmod2m(BIG x);
+/**	@brief Set BIG to sum of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, sum of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_add(BIG x, BIG y, BIG z);
+
+/**	@brief Set BIG to logical or of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, or of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_or(BIG x, BIG y, BIG z);
+
+/**	@brief Increment BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be incremented
+	@param i integer
+ */
+extern void BIG_inc(BIG x, int i);
+/**	@brief Set BIG to difference of two BIGs (Constant Time)
+ *
+	@param x BIG number, difference of other two - output not normalised
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_sub(BIG x, BIG y, BIG z);
+/**	@brief Decrement BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be decremented
+	@param i integer
+ */
+extern void BIG_dec(BIG x, int i);
+/**	@brief Set DBIG to sum of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, sum of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dadd(DBIG x, DBIG y, DBIG z);
+/**	@brief Set DBIG to difference of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, difference of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dsub(DBIG x, DBIG y, DBIG z);
+/**	@brief Multiply BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_imul(BIG x, BIG y, int i);
+/**	@brief Multiply BIG by not-so-small small integer - output normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+	@return Overflowing bits
+ */
+extern chunk BIG_pmul(BIG x, BIG y, int i);
+/**	@brief Divide BIG by 3 - output normalised (Constant Time)
+ *
+	@param x BIG number
+	@return Remainder
+ */
+extern int BIG_div3(BIG x);
+/**	@brief Multiply BIG by even bigger small integer resulting in a DBIG - output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_pxmul(DBIG x, BIG y, int i);
+/**	@brief Multiply BIG by another BIG resulting in DBIG - inputs normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_mul(DBIG x, BIG y, BIG z);
+/**	@brief Multiply BIG by another BIG resulting in another BIG - inputs normalised and output normalised (Constant Time)
+ *
+	Note that the product must fit into a BIG, and x must be distinct from y and z
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_smul(BIG x, BIG y, BIG z);
+/**	@brief Square BIG resulting in a DBIG - input normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, square of a BIG
+	@param y BIG number to be squared
+ */
+extern void BIG_sqr(DBIG x, BIG y);
+
+/**	@brief Montgomery reduction of a DBIG to a BIG  - input normalised and output normalised (Constant Time)
+ *
+	@param a BIG number, reduction of a BIG
+	@param md BIG number, the modulus
+	@param MC the Montgomery Constant
+	@param d DBIG number to be reduced
+ */
+extern void BIG_monty(BIG a, BIG md, chunk MC, DBIG d);
+
+/**	@brief Shifts a BIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shl(BIG x, int s);
+/**	@brief Fast shifts a BIG left by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Overflow bits
+ */
+extern int BIG_fshl(BIG x, int s);
+/**	@brief Shifts a DBIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshl(DBIG x, int s);
+/**	@brief Shifts a BIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shr(BIG x, int s);
+
+
+/**	@brief Fast time-critical combined shift by 1 bit, subtract and normalise (Constant Time)
+ *
+	@param r BIG number normalised output
+	@param a BIG number to be subtracted from
+	@param m BIG number to be shifted and subtracted
+	@return sign of r
+ */
+extern int BIG_ssn(BIG r, BIG a, BIG m);
+
+/**	@brief Fast shifts a BIG right by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Shifted out bits
+ */
+extern int BIG_fshr(BIG x, int s);
+/**	@brief Shifts a DBIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshr(DBIG x, int s);
+/**	@brief Splits a DBIG into two BIGs - input must be normalised, outputs normalised (Constant Time as used)
+ *
+	Internal function. The value of s must be approximately in the middle of the DBIG.
+	Typically used to extract z mod 2^MODBITS and z/2^MODBITS
+	@param x BIG number, top half of z
+	@param y BIG number, bottom half of z
+	@param z DBIG number to be split in two.
+	@param s Bit position at which to split
+	@return carry-out from top half
+ */
+extern chunk BIG_split(BIG x, BIG y, DBIG z, int s);
+/**	@brief Normalizes a BIG number - output normalised (Constant Time)
+ *
+	All digits of the input BIG are reduced mod 2^BASEBITS
+	@param x BIG number to be normalised
+ */
+extern chunk BIG_norm(BIG x);
+/**	@brief Normalizes a DBIG number - output normalised (Constant Time)
+ *
+	All digits of the input DBIG are reduced mod 2^BASEBITS
+	@param x DBIG number to be normalised
+ */
+extern void BIG_dnorm(DBIG x);
+/**	@brief Compares two BIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first BIG number to be compared
+	@param y second BIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_comp(BIG x, BIG y);
+/**	@brief Compares two DBIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first DBIG number to be compared
+	@param y second DBIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_dcomp(DBIG x, DBIG y);
+/**	@brief Calculate number of bits in a BIG - output normalised (Variable Time)
+ *
+	@param x BIG number
+	@return Number of bits in x
+ */
+extern int BIG_nbits(BIG x);
+/**	@brief Calculate number of bits in a DBIG - output normalised (Variable Time)
+ *
+	@param x DBIG number
+	@return Number of bits in x
+ */
+extern int BIG_dnbits(DBIG x);
+
+/**	@brief Reduce x mod n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctmod(BIG x, BIG n, int bd);
+
+/**	@brief  x=y mod n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctdmod(BIG x, DBIG y, BIG n, int bd);
+
+/**	@brief Divide x by n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctsdiv(BIG x,BIG n,int bd);
+
+/**	@brief  x=y/n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctddiv(BIG x, DBIG y, BIG n,int bd);
+
+
+/**	@brief Reduce x mod n - input and output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+ */
+extern void BIG_mod(BIG x, BIG n);
+/**	@brief Divide x by n - output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+ */
+extern void BIG_sdiv(BIG x, BIG n);
+/**	@brief  x=y mod n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_dmod(BIG x, DBIG y, BIG n);
+/**	@brief  x=y/n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_ddiv(BIG x, DBIG y, BIG n);
+/**	@brief  return parity of BIG, that is the least significant bit (Constant Time)
+ *
+	@param x BIG number
+	@return 0 or 1
+ */
+extern int BIG_parity(BIG x);
+/**	@brief  return i-th of BIG (Constant Time)
+ *
+	@param x BIG number
+	@param i the bit of x to be returned
+	@return 0 or 1
+ */
+extern int BIG_bit(BIG x, int i);
+/**	@brief  return least significant bits of a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param n number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int BIG_lastbits(BIG x, int n);
+/**	@brief  Create a random BIG from a random number generator (Constant Time)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_random(BIG x, csprng *r);
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randomnum(BIG x, BIG n, csprng *r);
+
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus and truncated to max bit length (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param t Maximum bit length
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randtrunc(BIG x, BIG n, int t, csprng *r);
+
+/**	brief  return NAF (Non-Adjacent-Form) value as +/- 1, 3 or 5, inputs must be normalised
+ *
+	Given x and 3*x extracts NAF value from given bit position, and returns number of bits processed, and number of trailing zeros detected if any
+	param x BIG number
+	param x3 BIG number, three times x
+	param i bit position
+	param nbs pointer to integer returning number of bits processed
+	param nzs pointer to integer returning number of trailing 0s
+	return + or - 1, 3 or 5
+*/
+
+/**	@brief  Calculate x=y*z mod n (Variable Time)
+ *
+	Slow method for modular multiplication
+	@param x BIG number, on exit = y*z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modmul(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y/z mod n (Variable Time)
+ *
+	Slow method for modular division
+	@param x BIG number, on exit = y/z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_moddiv(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y^2 mod n (Variable Time)
+ *
+	Slow method for modular squaring
+	@param x BIG number, on exit = y^2 mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modsqr(BIG x, BIG y, BIG n);
+/**	@brief  Calculate x=-y mod n (Variable Time)
+ *
+	Modular negation
+	@param x BIG number, on exit = -y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modneg(BIG x, BIG y, BIG n);
+
+/**	@brief  Calculate x=y+z mod n (Variable Time)
+ *
+	Slow method for modular addition
+	@param x BIG number, on exit = y+z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modadd(BIG x, BIG y, BIG z, BIG n);
+
+/**	@brief  Calculate jacobi Symbol (x/y) (Variable Time)
+ *
+	@param x BIG number
+	@param y BIG number
+	@return Jacobi symbol, -1,0 or 1
+ */
+extern int BIG_jacobi(BIG x, BIG y);
+/**	@brief  Calculate x=1/y mod n (Variable Time)
+ *
+	Modular Inversion - This is slow. Uses binary method.
+	@param x BIG number, on exit = 1/y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_invmodp(BIG x, BIG y, BIG n);
+/** @brief Calculate x=x mod 2^m (Variable Time)
+ *
+	Truncation
+	@param x BIG number, on reduced mod 2^m
+	@param m new truncated size
+*/
+extern void BIG_mod2m(BIG x, int m);
+
+/**	@brief Calculates a*b+c+*d
+ *
+	Calculate partial product of a.b, add in carry c, and add total to d (Constant Time)
+	@param a multiplier
+	@param b multiplicand
+	@param c carry
+	@param d pointer to accumulated bottom half of result
+	@return top half of result
+ */
+
+
+extern int step1(BIG,BIG,BIG);
+extern void step2(BIG,BIG,BIG);
+
+#ifdef dchunk
+
+/* Method required to calculate x*y+c+r, bottom half in r, top half returned */
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    dchunk prod = (dchunk)x * y + c + *r;
+    *r = (chunk)prod & BMASK_B288_60;
+    return (chunk)(prod >> BASEBITS_B288_60);
+}
+
+#else
+
+/* No integer type available that can store double the wordlength */
+/* accumulate partial products */
+
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    chunk x0, x1, y0, y1;
+    chunk bot, top, mid, carry;
+    x0 = x & HMASK_B288_60;
+    x1 = (x >> HBITS_B288_60);
+    y0 = y & HMASK_B288_60;
+    y1 = (y >> HBITS_B288_60);
+    bot = x0 * y0;
+    top = x1 * y1;
+    mid = x0 * y1 + x1 * y0;
+    x0 = mid & HMASK_B288_60;
+    x1 = (mid >> HBITS_B288_60);
+    bot += x0 << HBITS_B288_60;
+    bot += *r;
+    bot += c;
+
+    top += x1;
+    carry = bot >> BASEBITS_B288_60;
+    bot &= BMASK_B288_60;
+    top += carry;
+
+    *r = bot;
+    return top;
+}
+
+#endif
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/big_B336_60.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/big_B336_60.h
new file mode 100644
index 0000000..d4fa6c9
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/big_B336_60.h
@@ -0,0 +1,697 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file big.h
+ * @author Mike Scott
+ * @date 23rd February 2016
+ * @brief Big number Header File
+ *
+ *
+ */
+
+#ifndef BIG_B336_60_H
+#define BIG_B336_60_H
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <inttypes.h>
+#include "arch.h"
+#include "core.h"
+#include "config_big_B336_60.h"
+
+using namespace core;
+
+/* could comment this out if code size is a major issue */
+#define UNWOUND
+/* Normally recommended, but may not be optimal for some architectures, for example 32-bit ARM M4 */
+#define USE_KARATSUBA
+
+#define BIGBITS_B336_60 (8*MODBYTES_B336_60)
+#define NLEN_B336_60 (1+((8*MODBYTES_B336_60-1)/BASEBITS_B336_60))
+#define DNLEN_B336_60 2*NLEN_B336_60
+#define BMASK_B336_60 (((chunk)1<<BASEBITS_B336_60)-1) /**< Mask = 2^BASEBITS-1 */
+#define NEXCESS_B336_60 (1<<(CHUNK-BASEBITS_B336_60-1))           /**< 2^(CHUNK-BASEBITS-1) - digit cannot be multiplied by more than this before normalisation */
+
+#define HBITS_B336_60 (BASEBITS_B336_60/2)      /**< Number of bits in number base divided by 2 */
+#define HMASK_B336_60 (((chunk)1<<HBITS_B336_60)-1)    /**< Mask = 2^HBITS-1 */
+
+//#define DEBUG_NORM
+
+#ifdef DEBUG_NORM  /* Add an extra location to track chunk extension */
+#define MPV_B336_60 NLEN_B336_60
+#define MNV_B336_60 (NLEN_B336_60+1)
+#define DMPV_B336_60 DNLEN_B336_60
+#define DMNV_B336_60 (DNLEN_B336_60+1)
+
+#endif
+
+namespace B336_60 {
+
+//extern int BIGMULS;
+//extern int BIGSQRS;
+
+#ifdef DEBUG_NORM
+typedef chunk BIG[NLEN_B336_60 + 2]; /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B336_60 + 2]; /**< Define type DBIG as array of chunks */
+#else
+typedef chunk BIG[NLEN_B336_60];     /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B336_60];   /**< Define type DBIG as array of chunks */
+#endif
+
+/* BIG number prototypes */
+
+/**	@brief Tests for BIG equal to zero (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_iszilch(BIG x);
+/**	@brief Tests for BIG equal to one (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if one, else returns 0
+ */
+extern int BIG_isunity(BIG x);
+/**	@brief Tests for DBIG equal to zero (Constant Time)
+ *
+	@param x a DBIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_diszilch(DBIG x);
+/**	@brief Outputs a BIG number to the console (Variable Time)
+ *
+	@param x a BIG number
+ */
+extern void BIG_output(BIG x);
+/**	@brief Outputs a BIG number to the console in raw form (Variable Time for debugging)
+ *
+	@param x a BIG number
+ */
+extern void BIG_rawoutput(BIG x);
+/**	@brief Conditional constant time swap of two BIG numbers
+ *
+	Conditionally swaps parameters in constant time (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s swap takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cswap(BIG x, BIG y, int s);
+/**	@brief Conditional copy of BIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cmove(BIG x, BIG y, int s);
+/**	@brief Conditional copy of DBIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a DBIG number
+	@param y another DBIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_dcmove(BIG x, BIG y, int s);
+/**	@brief Convert from BIG number to byte array (Constant Time)
+ *
+	@param a byte array
+	@param x BIG number
+ */
+extern void BIG_toBytes(char *a, BIG x);
+/**	@brief Convert to BIG number from byte array (Constant Time)
+ *
+	@param x BIG number
+	@param a byte array
+ */
+extern void BIG_fromBytes(BIG x, char *a);
+/**	@brief Convert to BIG number from byte array of given length (Variable Time)
+ *
+	@param x BIG number
+	@param a byte array
+	@param s byte array length
+ */
+extern void BIG_fromBytesLen(BIG x, char *a, int s);
+/**@brief Convert to DBIG number from byte array of given length (Variable Time)
+ *
+   @param x DBIG number
+   @param a byte array
+   @param s byte array length
+ */
+extern void BIG_dfromBytesLen(DBIG x, char *a, int s);
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_doutput(DBIG x); 
+
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_drawoutput(DBIG x);
+
+/**	@brief Copy BIG from Read-Only Memory to a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number in ROM
+ */
+extern void BIG_rcopy(BIG x, const BIG y);
+/**	@brief Copy BIG to another BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_copy(BIG x, BIG y);
+/**	@brief Copy DBIG to another DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_dcopy(DBIG x, DBIG y);
+/**	@brief Copy BIG to upper half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dsucopy(DBIG x, BIG y);
+/**	@brief Copy BIG to lower half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dscopy(DBIG x, BIG y);
+/**	@brief Copy lower half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sdcopy(BIG x, DBIG y);
+/**	@brief Copy upper half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sducopy(BIG x, DBIG y);
+/**	@brief Set BIG to zero (Constant Time)
+ *
+	@param x BIG number to be set to zero  
+ */
+extern void BIG_zero(BIG x);
+/**	@brief Set DBIG to zero (Constant Time)
+ *
+	@param x DBIG number to be set to zero
+ */
+extern void BIG_dzero(DBIG x);
+/**	@brief Set BIG to one (unity) (Constant Time)
+ *
+	@param x BIG number to be set to one.
+ */
+extern void BIG_one(BIG x);
+/**	@brief Set BIG to inverse mod 2^256 (Constant Time)
+ *
+	@param x BIG number to be inverted
+ */
+extern void BIG_invmod2m(BIG x);
+/**	@brief Set BIG to sum of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, sum of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_add(BIG x, BIG y, BIG z);
+
+/**	@brief Set BIG to logical or of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, or of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_or(BIG x, BIG y, BIG z);
+
+/**	@brief Increment BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be incremented
+	@param i integer
+ */
+extern void BIG_inc(BIG x, int i);
+/**	@brief Set BIG to difference of two BIGs (Constant Time)
+ *
+	@param x BIG number, difference of other two - output not normalised
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_sub(BIG x, BIG y, BIG z);
+/**	@brief Decrement BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be decremented
+	@param i integer
+ */
+extern void BIG_dec(BIG x, int i);
+/**	@brief Set DBIG to sum of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, sum of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dadd(DBIG x, DBIG y, DBIG z);
+/**	@brief Set DBIG to difference of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, difference of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dsub(DBIG x, DBIG y, DBIG z);
+/**	@brief Multiply BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_imul(BIG x, BIG y, int i);
+/**	@brief Multiply BIG by not-so-small small integer - output normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+	@return Overflowing bits
+ */
+extern chunk BIG_pmul(BIG x, BIG y, int i);
+/**	@brief Divide BIG by 3 - output normalised (Constant Time)
+ *
+	@param x BIG number
+	@return Remainder
+ */
+extern int BIG_div3(BIG x);
+/**	@brief Multiply BIG by even bigger small integer resulting in a DBIG - output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_pxmul(DBIG x, BIG y, int i);
+/**	@brief Multiply BIG by another BIG resulting in DBIG - inputs normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_mul(DBIG x, BIG y, BIG z);
+/**	@brief Multiply BIG by another BIG resulting in another BIG - inputs normalised and output normalised (Constant Time)
+ *
+	Note that the product must fit into a BIG, and x must be distinct from y and z
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_smul(BIG x, BIG y, BIG z);
+/**	@brief Square BIG resulting in a DBIG - input normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, square of a BIG
+	@param y BIG number to be squared
+ */
+extern void BIG_sqr(DBIG x, BIG y);
+
+/**	@brief Montgomery reduction of a DBIG to a BIG  - input normalised and output normalised (Constant Time)
+ *
+	@param a BIG number, reduction of a BIG
+	@param md BIG number, the modulus
+	@param MC the Montgomery Constant
+	@param d DBIG number to be reduced
+ */
+extern void BIG_monty(BIG a, BIG md, chunk MC, DBIG d);
+
+/**	@brief Shifts a BIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shl(BIG x, int s);
+/**	@brief Fast shifts a BIG left by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Overflow bits
+ */
+extern int BIG_fshl(BIG x, int s);
+/**	@brief Shifts a DBIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshl(DBIG x, int s);
+/**	@brief Shifts a BIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shr(BIG x, int s);
+
+
+/**	@brief Fast time-critical combined shift by 1 bit, subtract and normalise (Constant Time)
+ *
+	@param r BIG number normalised output
+	@param a BIG number to be subtracted from
+	@param m BIG number to be shifted and subtracted
+	@return sign of r
+ */
+extern int BIG_ssn(BIG r, BIG a, BIG m);
+
+/**	@brief Fast shifts a BIG right by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Shifted out bits
+ */
+extern int BIG_fshr(BIG x, int s);
+/**	@brief Shifts a DBIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshr(DBIG x, int s);
+/**	@brief Splits a DBIG into two BIGs - input must be normalised, outputs normalised (Constant Time as used)
+ *
+	Internal function. The value of s must be approximately in the middle of the DBIG.
+	Typically used to extract z mod 2^MODBITS and z/2^MODBITS
+	@param x BIG number, top half of z
+	@param y BIG number, bottom half of z
+	@param z DBIG number to be split in two.
+	@param s Bit position at which to split
+	@return carry-out from top half
+ */
+extern chunk BIG_split(BIG x, BIG y, DBIG z, int s);
+/**	@brief Normalizes a BIG number - output normalised (Constant Time)
+ *
+	All digits of the input BIG are reduced mod 2^BASEBITS
+	@param x BIG number to be normalised
+ */
+extern chunk BIG_norm(BIG x);
+/**	@brief Normalizes a DBIG number - output normalised (Constant Time)
+ *
+	All digits of the input DBIG are reduced mod 2^BASEBITS
+	@param x DBIG number to be normalised
+ */
+extern void BIG_dnorm(DBIG x);
+/**	@brief Compares two BIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first BIG number to be compared
+	@param y second BIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_comp(BIG x, BIG y);
+/**	@brief Compares two DBIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first DBIG number to be compared
+	@param y second DBIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_dcomp(DBIG x, DBIG y);
+/**	@brief Calculate number of bits in a BIG - output normalised (Variable Time)
+ *
+	@param x BIG number
+	@return Number of bits in x
+ */
+extern int BIG_nbits(BIG x);
+/**	@brief Calculate number of bits in a DBIG - output normalised (Variable Time)
+ *
+	@param x DBIG number
+	@return Number of bits in x
+ */
+extern int BIG_dnbits(DBIG x);
+
+/**	@brief Reduce x mod n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctmod(BIG x, BIG n, int bd);
+
+/**	@brief  x=y mod n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctdmod(BIG x, DBIG y, BIG n, int bd);
+
+/**	@brief Divide x by n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctsdiv(BIG x,BIG n,int bd);
+
+/**	@brief  x=y/n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctddiv(BIG x, DBIG y, BIG n,int bd);
+
+
+/**	@brief Reduce x mod n - input and output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+ */
+extern void BIG_mod(BIG x, BIG n);
+/**	@brief Divide x by n - output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+ */
+extern void BIG_sdiv(BIG x, BIG n);
+/**	@brief  x=y mod n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_dmod(BIG x, DBIG y, BIG n);
+/**	@brief  x=y/n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_ddiv(BIG x, DBIG y, BIG n);
+/**	@brief  return parity of BIG, that is the least significant bit (Constant Time)
+ *
+	@param x BIG number
+	@return 0 or 1
+ */
+extern int BIG_parity(BIG x);
+/**	@brief  return i-th of BIG (Constant Time)
+ *
+	@param x BIG number
+	@param i the bit of x to be returned
+	@return 0 or 1
+ */
+extern int BIG_bit(BIG x, int i);
+/**	@brief  return least significant bits of a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param n number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int BIG_lastbits(BIG x, int n);
+/**	@brief  Create a random BIG from a random number generator (Constant Time)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_random(BIG x, csprng *r);
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randomnum(BIG x, BIG n, csprng *r);
+
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus and truncated to max bit length (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param t Maximum bit length
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randtrunc(BIG x, BIG n, int t, csprng *r);
+
+/**	brief  return NAF (Non-Adjacent-Form) value as +/- 1, 3 or 5, inputs must be normalised
+ *
+	Given x and 3*x extracts NAF value from given bit position, and returns number of bits processed, and number of trailing zeros detected if any
+	param x BIG number
+	param x3 BIG number, three times x
+	param i bit position
+	param nbs pointer to integer returning number of bits processed
+	param nzs pointer to integer returning number of trailing 0s
+	return + or - 1, 3 or 5
+*/
+
+/**	@brief  Calculate x=y*z mod n (Variable Time)
+ *
+	Slow method for modular multiplication
+	@param x BIG number, on exit = y*z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modmul(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y/z mod n (Variable Time)
+ *
+	Slow method for modular division
+	@param x BIG number, on exit = y/z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_moddiv(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y^2 mod n (Variable Time)
+ *
+	Slow method for modular squaring
+	@param x BIG number, on exit = y^2 mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modsqr(BIG x, BIG y, BIG n);
+/**	@brief  Calculate x=-y mod n (Variable Time)
+ *
+	Modular negation
+	@param x BIG number, on exit = -y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modneg(BIG x, BIG y, BIG n);
+
+/**	@brief  Calculate x=y+z mod n (Variable Time)
+ *
+	Slow method for modular addition
+	@param x BIG number, on exit = y+z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modadd(BIG x, BIG y, BIG z, BIG n);
+
+/**	@brief  Calculate jacobi Symbol (x/y) (Variable Time)
+ *
+	@param x BIG number
+	@param y BIG number
+	@return Jacobi symbol, -1,0 or 1
+ */
+extern int BIG_jacobi(BIG x, BIG y);
+/**	@brief  Calculate x=1/y mod n (Variable Time)
+ *
+	Modular Inversion - This is slow. Uses binary method.
+	@param x BIG number, on exit = 1/y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_invmodp(BIG x, BIG y, BIG n);
+/** @brief Calculate x=x mod 2^m (Variable Time)
+ *
+	Truncation
+	@param x BIG number, on reduced mod 2^m
+	@param m new truncated size
+*/
+extern void BIG_mod2m(BIG x, int m);
+
+/**	@brief Calculates a*b+c+*d
+ *
+	Calculate partial product of a.b, add in carry c, and add total to d (Constant Time)
+	@param a multiplier
+	@param b multiplicand
+	@param c carry
+	@param d pointer to accumulated bottom half of result
+	@return top half of result
+ */
+
+
+extern int step1(BIG,BIG,BIG);
+extern void step2(BIG,BIG,BIG);
+
+#ifdef dchunk
+
+/* Method required to calculate x*y+c+r, bottom half in r, top half returned */
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    dchunk prod = (dchunk)x * y + c + *r;
+    *r = (chunk)prod & BMASK_B336_60;
+    return (chunk)(prod >> BASEBITS_B336_60);
+}
+
+#else
+
+/* No integer type available that can store double the wordlength */
+/* accumulate partial products */
+
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    chunk x0, x1, y0, y1;
+    chunk bot, top, mid, carry;
+    x0 = x & HMASK_B336_60;
+    x1 = (x >> HBITS_B336_60);
+    y0 = y & HMASK_B336_60;
+    y1 = (y >> HBITS_B336_60);
+    bot = x0 * y0;
+    top = x1 * y1;
+    mid = x0 * y1 + x1 * y0;
+    x0 = mid & HMASK_B336_60;
+    x1 = (mid >> HBITS_B336_60);
+    bot += x0 << HBITS_B336_60;
+    bot += *r;
+    bot += c;
+
+    top += x1;
+    carry = bot >> BASEBITS_B336_60;
+    bot &= BMASK_B336_60;
+    top += carry;
+
+    *r = bot;
+    return top;
+}
+
+#endif
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/big_B384_56.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/big_B384_56.h
new file mode 100644
index 0000000..a5724a1
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/big_B384_56.h
@@ -0,0 +1,697 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file big.h
+ * @author Mike Scott
+ * @date 23rd February 2016
+ * @brief Big number Header File
+ *
+ *
+ */
+
+#ifndef BIG_B384_56_H
+#define BIG_B384_56_H
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <inttypes.h>
+#include "arch.h"
+#include "core.h"
+#include "config_big_B384_56.h"
+
+using namespace core;
+
+/* could comment this out if code size is a major issue */
+#define UNWOUND
+/* Normally recommended, but may not be optimal for some architectures, for example 32-bit ARM M4 */
+#define USE_KARATSUBA
+
+#define BIGBITS_B384_56 (8*MODBYTES_B384_56)
+#define NLEN_B384_56 (1+((8*MODBYTES_B384_56-1)/BASEBITS_B384_56))
+#define DNLEN_B384_56 2*NLEN_B384_56
+#define BMASK_B384_56 (((chunk)1<<BASEBITS_B384_56)-1) /**< Mask = 2^BASEBITS-1 */
+#define NEXCESS_B384_56 (1<<(CHUNK-BASEBITS_B384_56-1))           /**< 2^(CHUNK-BASEBITS-1) - digit cannot be multiplied by more than this before normalisation */
+
+#define HBITS_B384_56 (BASEBITS_B384_56/2)      /**< Number of bits in number base divided by 2 */
+#define HMASK_B384_56 (((chunk)1<<HBITS_B384_56)-1)    /**< Mask = 2^HBITS-1 */
+
+//#define DEBUG_NORM
+
+#ifdef DEBUG_NORM  /* Add an extra location to track chunk extension */
+#define MPV_B384_56 NLEN_B384_56
+#define MNV_B384_56 (NLEN_B384_56+1)
+#define DMPV_B384_56 DNLEN_B384_56
+#define DMNV_B384_56 (DNLEN_B384_56+1)
+
+#endif
+
+namespace B384_56 {
+
+//extern int BIGMULS;
+//extern int BIGSQRS;
+
+#ifdef DEBUG_NORM
+typedef chunk BIG[NLEN_B384_56 + 2]; /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B384_56 + 2]; /**< Define type DBIG as array of chunks */
+#else
+typedef chunk BIG[NLEN_B384_56];     /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B384_56];   /**< Define type DBIG as array of chunks */
+#endif
+
+/* BIG number prototypes */
+
+/**	@brief Tests for BIG equal to zero (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_iszilch(BIG x);
+/**	@brief Tests for BIG equal to one (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if one, else returns 0
+ */
+extern int BIG_isunity(BIG x);
+/**	@brief Tests for DBIG equal to zero (Constant Time)
+ *
+	@param x a DBIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_diszilch(DBIG x);
+/**	@brief Outputs a BIG number to the console (Variable Time)
+ *
+	@param x a BIG number
+ */
+extern void BIG_output(BIG x);
+/**	@brief Outputs a BIG number to the console in raw form (Variable Time for debugging)
+ *
+	@param x a BIG number
+ */
+extern void BIG_rawoutput(BIG x);
+/**	@brief Conditional constant time swap of two BIG numbers
+ *
+	Conditionally swaps parameters in constant time (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s swap takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cswap(BIG x, BIG y, int s);
+/**	@brief Conditional copy of BIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cmove(BIG x, BIG y, int s);
+/**	@brief Conditional copy of DBIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a DBIG number
+	@param y another DBIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_dcmove(BIG x, BIG y, int s);
+/**	@brief Convert from BIG number to byte array (Constant Time)
+ *
+	@param a byte array
+	@param x BIG number
+ */
+extern void BIG_toBytes(char *a, BIG x);
+/**	@brief Convert to BIG number from byte array (Constant Time)
+ *
+	@param x BIG number
+	@param a byte array
+ */
+extern void BIG_fromBytes(BIG x, char *a);
+/**	@brief Convert to BIG number from byte array of given length (Variable Time)
+ *
+	@param x BIG number
+	@param a byte array
+	@param s byte array length
+ */
+extern void BIG_fromBytesLen(BIG x, char *a, int s);
+/**@brief Convert to DBIG number from byte array of given length (Variable Time)
+ *
+   @param x DBIG number
+   @param a byte array
+   @param s byte array length
+ */
+extern void BIG_dfromBytesLen(DBIG x, char *a, int s);
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_doutput(DBIG x); 
+
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_drawoutput(DBIG x);
+
+/**	@brief Copy BIG from Read-Only Memory to a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number in ROM
+ */
+extern void BIG_rcopy(BIG x, const BIG y);
+/**	@brief Copy BIG to another BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_copy(BIG x, BIG y);
+/**	@brief Copy DBIG to another DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_dcopy(DBIG x, DBIG y);
+/**	@brief Copy BIG to upper half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dsucopy(DBIG x, BIG y);
+/**	@brief Copy BIG to lower half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dscopy(DBIG x, BIG y);
+/**	@brief Copy lower half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sdcopy(BIG x, DBIG y);
+/**	@brief Copy upper half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sducopy(BIG x, DBIG y);
+/**	@brief Set BIG to zero (Constant Time)
+ *
+	@param x BIG number to be set to zero  
+ */
+extern void BIG_zero(BIG x);
+/**	@brief Set DBIG to zero (Constant Time)
+ *
+	@param x DBIG number to be set to zero
+ */
+extern void BIG_dzero(DBIG x);
+/**	@brief Set BIG to one (unity) (Constant Time)
+ *
+	@param x BIG number to be set to one.
+ */
+extern void BIG_one(BIG x);
+/**	@brief Set BIG to inverse mod 2^256 (Constant Time)
+ *
+	@param x BIG number to be inverted
+ */
+extern void BIG_invmod2m(BIG x);
+/**	@brief Set BIG to sum of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, sum of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_add(BIG x, BIG y, BIG z);
+
+/**	@brief Set BIG to logical or of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, or of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_or(BIG x, BIG y, BIG z);
+
+/**	@brief Increment BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be incremented
+	@param i integer
+ */
+extern void BIG_inc(BIG x, int i);
+/**	@brief Set BIG to difference of two BIGs (Constant Time)
+ *
+	@param x BIG number, difference of other two - output not normalised
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_sub(BIG x, BIG y, BIG z);
+/**	@brief Decrement BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be decremented
+	@param i integer
+ */
+extern void BIG_dec(BIG x, int i);
+/**	@brief Set DBIG to sum of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, sum of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dadd(DBIG x, DBIG y, DBIG z);
+/**	@brief Set DBIG to difference of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, difference of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dsub(DBIG x, DBIG y, DBIG z);
+/**	@brief Multiply BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_imul(BIG x, BIG y, int i);
+/**	@brief Multiply BIG by not-so-small small integer - output normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+	@return Overflowing bits
+ */
+extern chunk BIG_pmul(BIG x, BIG y, int i);
+/**	@brief Divide BIG by 3 - output normalised (Constant Time)
+ *
+	@param x BIG number
+	@return Remainder
+ */
+extern int BIG_div3(BIG x);
+/**	@brief Multiply BIG by even bigger small integer resulting in a DBIG - output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_pxmul(DBIG x, BIG y, int i);
+/**	@brief Multiply BIG by another BIG resulting in DBIG - inputs normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_mul(DBIG x, BIG y, BIG z);
+/**	@brief Multiply BIG by another BIG resulting in another BIG - inputs normalised and output normalised (Constant Time)
+ *
+	Note that the product must fit into a BIG, and x must be distinct from y and z
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_smul(BIG x, BIG y, BIG z);
+/**	@brief Square BIG resulting in a DBIG - input normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, square of a BIG
+	@param y BIG number to be squared
+ */
+extern void BIG_sqr(DBIG x, BIG y);
+
+/**	@brief Montgomery reduction of a DBIG to a BIG  - input normalised and output normalised (Constant Time)
+ *
+	@param a BIG number, reduction of a BIG
+	@param md BIG number, the modulus
+	@param MC the Montgomery Constant
+	@param d DBIG number to be reduced
+ */
+extern void BIG_monty(BIG a, BIG md, chunk MC, DBIG d);
+
+/**	@brief Shifts a BIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shl(BIG x, int s);
+/**	@brief Fast shifts a BIG left by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Overflow bits
+ */
+extern int BIG_fshl(BIG x, int s);
+/**	@brief Shifts a DBIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshl(DBIG x, int s);
+/**	@brief Shifts a BIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shr(BIG x, int s);
+
+
+/**	@brief Fast time-critical combined shift by 1 bit, subtract and normalise (Constant Time)
+ *
+	@param r BIG number normalised output
+	@param a BIG number to be subtracted from
+	@param m BIG number to be shifted and subtracted
+	@return sign of r
+ */
+extern int BIG_ssn(BIG r, BIG a, BIG m);
+
+/**	@brief Fast shifts a BIG right by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Shifted out bits
+ */
+extern int BIG_fshr(BIG x, int s);
+/**	@brief Shifts a DBIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshr(DBIG x, int s);
+/**	@brief Splits a DBIG into two BIGs - input must be normalised, outputs normalised (Constant Time as used)
+ *
+	Internal function. The value of s must be approximately in the middle of the DBIG.
+	Typically used to extract z mod 2^MODBITS and z/2^MODBITS
+	@param x BIG number, top half of z
+	@param y BIG number, bottom half of z
+	@param z DBIG number to be split in two.
+	@param s Bit position at which to split
+	@return carry-out from top half
+ */
+extern chunk BIG_split(BIG x, BIG y, DBIG z, int s);
+/**	@brief Normalizes a BIG number - output normalised (Constant Time)
+ *
+	All digits of the input BIG are reduced mod 2^BASEBITS
+	@param x BIG number to be normalised
+ */
+extern chunk BIG_norm(BIG x);
+/**	@brief Normalizes a DBIG number - output normalised (Constant Time)
+ *
+	All digits of the input DBIG are reduced mod 2^BASEBITS
+	@param x DBIG number to be normalised
+ */
+extern void BIG_dnorm(DBIG x);
+/**	@brief Compares two BIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first BIG number to be compared
+	@param y second BIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_comp(BIG x, BIG y);
+/**	@brief Compares two DBIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first DBIG number to be compared
+	@param y second DBIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_dcomp(DBIG x, DBIG y);
+/**	@brief Calculate number of bits in a BIG - output normalised (Variable Time)
+ *
+	@param x BIG number
+	@return Number of bits in x
+ */
+extern int BIG_nbits(BIG x);
+/**	@brief Calculate number of bits in a DBIG - output normalised (Variable Time)
+ *
+	@param x DBIG number
+	@return Number of bits in x
+ */
+extern int BIG_dnbits(DBIG x);
+
+/**	@brief Reduce x mod n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctmod(BIG x, BIG n, int bd);
+
+/**	@brief  x=y mod n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctdmod(BIG x, DBIG y, BIG n, int bd);
+
+/**	@brief Divide x by n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctsdiv(BIG x,BIG n,int bd);
+
+/**	@brief  x=y/n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctddiv(BIG x, DBIG y, BIG n,int bd);
+
+
+/**	@brief Reduce x mod n - input and output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+ */
+extern void BIG_mod(BIG x, BIG n);
+/**	@brief Divide x by n - output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+ */
+extern void BIG_sdiv(BIG x, BIG n);
+/**	@brief  x=y mod n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_dmod(BIG x, DBIG y, BIG n);
+/**	@brief  x=y/n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_ddiv(BIG x, DBIG y, BIG n);
+/**	@brief  return parity of BIG, that is the least significant bit (Constant Time)
+ *
+	@param x BIG number
+	@return 0 or 1
+ */
+extern int BIG_parity(BIG x);
+/**	@brief  return i-th of BIG (Constant Time)
+ *
+	@param x BIG number
+	@param i the bit of x to be returned
+	@return 0 or 1
+ */
+extern int BIG_bit(BIG x, int i);
+/**	@brief  return least significant bits of a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param n number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int BIG_lastbits(BIG x, int n);
+/**	@brief  Create a random BIG from a random number generator (Constant Time)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_random(BIG x, csprng *r);
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randomnum(BIG x, BIG n, csprng *r);
+
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus and truncated to max bit length (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param t Maximum bit length
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randtrunc(BIG x, BIG n, int t, csprng *r);
+
+/**	brief  return NAF (Non-Adjacent-Form) value as +/- 1, 3 or 5, inputs must be normalised
+ *
+	Given x and 3*x extracts NAF value from given bit position, and returns number of bits processed, and number of trailing zeros detected if any
+	param x BIG number
+	param x3 BIG number, three times x
+	param i bit position
+	param nbs pointer to integer returning number of bits processed
+	param nzs pointer to integer returning number of trailing 0s
+	return + or - 1, 3 or 5
+*/
+
+/**	@brief  Calculate x=y*z mod n (Variable Time)
+ *
+	Slow method for modular multiplication
+	@param x BIG number, on exit = y*z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modmul(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y/z mod n (Variable Time)
+ *
+	Slow method for modular division
+	@param x BIG number, on exit = y/z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_moddiv(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y^2 mod n (Variable Time)
+ *
+	Slow method for modular squaring
+	@param x BIG number, on exit = y^2 mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modsqr(BIG x, BIG y, BIG n);
+/**	@brief  Calculate x=-y mod n (Variable Time)
+ *
+	Modular negation
+	@param x BIG number, on exit = -y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modneg(BIG x, BIG y, BIG n);
+
+/**	@brief  Calculate x=y+z mod n (Variable Time)
+ *
+	Slow method for modular addition
+	@param x BIG number, on exit = y+z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modadd(BIG x, BIG y, BIG z, BIG n);
+
+/**	@brief  Calculate jacobi Symbol (x/y) (Variable Time)
+ *
+	@param x BIG number
+	@param y BIG number
+	@return Jacobi symbol, -1,0 or 1
+ */
+extern int BIG_jacobi(BIG x, BIG y);
+/**	@brief  Calculate x=1/y mod n (Variable Time)
+ *
+	Modular Inversion - This is slow. Uses binary method.
+	@param x BIG number, on exit = 1/y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_invmodp(BIG x, BIG y, BIG n);
+/** @brief Calculate x=x mod 2^m (Variable Time)
+ *
+	Truncation
+	@param x BIG number, on reduced mod 2^m
+	@param m new truncated size
+*/
+extern void BIG_mod2m(BIG x, int m);
+
+/**	@brief Calculates a*b+c+*d
+ *
+	Calculate partial product of a.b, add in carry c, and add total to d (Constant Time)
+	@param a multiplier
+	@param b multiplicand
+	@param c carry
+	@param d pointer to accumulated bottom half of result
+	@return top half of result
+ */
+
+
+extern int step1(BIG,BIG,BIG);
+extern void step2(BIG,BIG,BIG);
+
+#ifdef dchunk
+
+/* Method required to calculate x*y+c+r, bottom half in r, top half returned */
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    dchunk prod = (dchunk)x * y + c + *r;
+    *r = (chunk)prod & BMASK_B384_56;
+    return (chunk)(prod >> BASEBITS_B384_56);
+}
+
+#else
+
+/* No integer type available that can store double the wordlength */
+/* accumulate partial products */
+
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    chunk x0, x1, y0, y1;
+    chunk bot, top, mid, carry;
+    x0 = x & HMASK_B384_56;
+    x1 = (x >> HBITS_B384_56);
+    y0 = y & HMASK_B384_56;
+    y1 = (y >> HBITS_B384_56);
+    bot = x0 * y0;
+    top = x1 * y1;
+    mid = x0 * y1 + x1 * y0;
+    x0 = mid & HMASK_B384_56;
+    x1 = (mid >> HBITS_B384_56);
+    bot += x0 << HBITS_B384_56;
+    bot += *r;
+    bot += c;
+
+    top += x1;
+    carry = bot >> BASEBITS_B384_56;
+    bot &= BMASK_B384_56;
+    top += carry;
+
+    *r = bot;
+    return top;
+}
+
+#endif
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/big_B384_58.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/big_B384_58.h
new file mode 100644
index 0000000..3f0c9ce
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/big_B384_58.h
@@ -0,0 +1,697 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file big.h
+ * @author Mike Scott
+ * @date 23rd February 2016
+ * @brief Big number Header File
+ *
+ *
+ */
+
+#ifndef BIG_B384_58_H
+#define BIG_B384_58_H
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <inttypes.h>
+#include "arch.h"
+#include "core.h"
+#include "config_big_B384_58.h"
+
+using namespace core;
+
+/* could comment this out if code size is a major issue */
+#define UNWOUND
+/* Normally recommended, but may not be optimal for some architectures, for example 32-bit ARM M4 */
+#define USE_KARATSUBA
+
+#define BIGBITS_B384_58 (8*MODBYTES_B384_58)
+#define NLEN_B384_58 (1+((8*MODBYTES_B384_58-1)/BASEBITS_B384_58))
+#define DNLEN_B384_58 2*NLEN_B384_58
+#define BMASK_B384_58 (((chunk)1<<BASEBITS_B384_58)-1) /**< Mask = 2^BASEBITS-1 */
+#define NEXCESS_B384_58 (1<<(CHUNK-BASEBITS_B384_58-1))           /**< 2^(CHUNK-BASEBITS-1) - digit cannot be multiplied by more than this before normalisation */
+
+#define HBITS_B384_58 (BASEBITS_B384_58/2)      /**< Number of bits in number base divided by 2 */
+#define HMASK_B384_58 (((chunk)1<<HBITS_B384_58)-1)    /**< Mask = 2^HBITS-1 */
+
+//#define DEBUG_NORM
+
+#ifdef DEBUG_NORM  /* Add an extra location to track chunk extension */
+#define MPV_B384_58 NLEN_B384_58
+#define MNV_B384_58 (NLEN_B384_58+1)
+#define DMPV_B384_58 DNLEN_B384_58
+#define DMNV_B384_58 (DNLEN_B384_58+1)
+
+#endif
+
+namespace B384_58 {
+
+//extern int BIGMULS;
+//extern int BIGSQRS;
+
+#ifdef DEBUG_NORM
+typedef chunk BIG[NLEN_B384_58 + 2]; /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B384_58 + 2]; /**< Define type DBIG as array of chunks */
+#else
+typedef chunk BIG[NLEN_B384_58];     /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B384_58];   /**< Define type DBIG as array of chunks */
+#endif
+
+/* BIG number prototypes */
+
+/**	@brief Tests for BIG equal to zero (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_iszilch(BIG x);
+/**	@brief Tests for BIG equal to one (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if one, else returns 0
+ */
+extern int BIG_isunity(BIG x);
+/**	@brief Tests for DBIG equal to zero (Constant Time)
+ *
+	@param x a DBIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_diszilch(DBIG x);
+/**	@brief Outputs a BIG number to the console (Variable Time)
+ *
+	@param x a BIG number
+ */
+extern void BIG_output(BIG x);
+/**	@brief Outputs a BIG number to the console in raw form (Variable Time for debugging)
+ *
+	@param x a BIG number
+ */
+extern void BIG_rawoutput(BIG x);
+/**	@brief Conditional constant time swap of two BIG numbers
+ *
+	Conditionally swaps parameters in constant time (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s swap takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cswap(BIG x, BIG y, int s);
+/**	@brief Conditional copy of BIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cmove(BIG x, BIG y, int s);
+/**	@brief Conditional copy of DBIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a DBIG number
+	@param y another DBIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_dcmove(BIG x, BIG y, int s);
+/**	@brief Convert from BIG number to byte array (Constant Time)
+ *
+	@param a byte array
+	@param x BIG number
+ */
+extern void BIG_toBytes(char *a, BIG x);
+/**	@brief Convert to BIG number from byte array (Constant Time)
+ *
+	@param x BIG number
+	@param a byte array
+ */
+extern void BIG_fromBytes(BIG x, char *a);
+/**	@brief Convert to BIG number from byte array of given length (Variable Time)
+ *
+	@param x BIG number
+	@param a byte array
+	@param s byte array length
+ */
+extern void BIG_fromBytesLen(BIG x, char *a, int s);
+/**@brief Convert to DBIG number from byte array of given length (Variable Time)
+ *
+   @param x DBIG number
+   @param a byte array
+   @param s byte array length
+ */
+extern void BIG_dfromBytesLen(DBIG x, char *a, int s);
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_doutput(DBIG x); 
+
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_drawoutput(DBIG x);
+
+/**	@brief Copy BIG from Read-Only Memory to a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number in ROM
+ */
+extern void BIG_rcopy(BIG x, const BIG y);
+/**	@brief Copy BIG to another BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_copy(BIG x, BIG y);
+/**	@brief Copy DBIG to another DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_dcopy(DBIG x, DBIG y);
+/**	@brief Copy BIG to upper half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dsucopy(DBIG x, BIG y);
+/**	@brief Copy BIG to lower half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dscopy(DBIG x, BIG y);
+/**	@brief Copy lower half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sdcopy(BIG x, DBIG y);
+/**	@brief Copy upper half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sducopy(BIG x, DBIG y);
+/**	@brief Set BIG to zero (Constant Time)
+ *
+	@param x BIG number to be set to zero  
+ */
+extern void BIG_zero(BIG x);
+/**	@brief Set DBIG to zero (Constant Time)
+ *
+	@param x DBIG number to be set to zero
+ */
+extern void BIG_dzero(DBIG x);
+/**	@brief Set BIG to one (unity) (Constant Time)
+ *
+	@param x BIG number to be set to one.
+ */
+extern void BIG_one(BIG x);
+/**	@brief Set BIG to inverse mod 2^256 (Constant Time)
+ *
+	@param x BIG number to be inverted
+ */
+extern void BIG_invmod2m(BIG x);
+/**	@brief Set BIG to sum of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, sum of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_add(BIG x, BIG y, BIG z);
+
+/**	@brief Set BIG to logical or of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, or of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_or(BIG x, BIG y, BIG z);
+
+/**	@brief Increment BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be incremented
+	@param i integer
+ */
+extern void BIG_inc(BIG x, int i);
+/**	@brief Set BIG to difference of two BIGs (Constant Time)
+ *
+	@param x BIG number, difference of other two - output not normalised
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_sub(BIG x, BIG y, BIG z);
+/**	@brief Decrement BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be decremented
+	@param i integer
+ */
+extern void BIG_dec(BIG x, int i);
+/**	@brief Set DBIG to sum of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, sum of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dadd(DBIG x, DBIG y, DBIG z);
+/**	@brief Set DBIG to difference of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, difference of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dsub(DBIG x, DBIG y, DBIG z);
+/**	@brief Multiply BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_imul(BIG x, BIG y, int i);
+/**	@brief Multiply BIG by not-so-small small integer - output normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+	@return Overflowing bits
+ */
+extern chunk BIG_pmul(BIG x, BIG y, int i);
+/**	@brief Divide BIG by 3 - output normalised (Constant Time)
+ *
+	@param x BIG number
+	@return Remainder
+ */
+extern int BIG_div3(BIG x);
+/**	@brief Multiply BIG by even bigger small integer resulting in a DBIG - output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_pxmul(DBIG x, BIG y, int i);
+/**	@brief Multiply BIG by another BIG resulting in DBIG - inputs normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_mul(DBIG x, BIG y, BIG z);
+/**	@brief Multiply BIG by another BIG resulting in another BIG - inputs normalised and output normalised (Constant Time)
+ *
+	Note that the product must fit into a BIG, and x must be distinct from y and z
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_smul(BIG x, BIG y, BIG z);
+/**	@brief Square BIG resulting in a DBIG - input normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, square of a BIG
+	@param y BIG number to be squared
+ */
+extern void BIG_sqr(DBIG x, BIG y);
+
+/**	@brief Montgomery reduction of a DBIG to a BIG  - input normalised and output normalised (Constant Time)
+ *
+	@param a BIG number, reduction of a BIG
+	@param md BIG number, the modulus
+	@param MC the Montgomery Constant
+	@param d DBIG number to be reduced
+ */
+extern void BIG_monty(BIG a, BIG md, chunk MC, DBIG d);
+
+/**	@brief Shifts a BIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shl(BIG x, int s);
+/**	@brief Fast shifts a BIG left by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Overflow bits
+ */
+extern int BIG_fshl(BIG x, int s);
+/**	@brief Shifts a DBIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshl(DBIG x, int s);
+/**	@brief Shifts a BIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shr(BIG x, int s);
+
+
+/**	@brief Fast time-critical combined shift by 1 bit, subtract and normalise (Constant Time)
+ *
+	@param r BIG number normalised output
+	@param a BIG number to be subtracted from
+	@param m BIG number to be shifted and subtracted
+	@return sign of r
+ */
+extern int BIG_ssn(BIG r, BIG a, BIG m);
+
+/**	@brief Fast shifts a BIG right by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Shifted out bits
+ */
+extern int BIG_fshr(BIG x, int s);
+/**	@brief Shifts a DBIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshr(DBIG x, int s);
+/**	@brief Splits a DBIG into two BIGs - input must be normalised, outputs normalised (Constant Time as used)
+ *
+	Internal function. The value of s must be approximately in the middle of the DBIG.
+	Typically used to extract z mod 2^MODBITS and z/2^MODBITS
+	@param x BIG number, top half of z
+	@param y BIG number, bottom half of z
+	@param z DBIG number to be split in two.
+	@param s Bit position at which to split
+	@return carry-out from top half
+ */
+extern chunk BIG_split(BIG x, BIG y, DBIG z, int s);
+/**	@brief Normalizes a BIG number - output normalised (Constant Time)
+ *
+	All digits of the input BIG are reduced mod 2^BASEBITS
+	@param x BIG number to be normalised
+ */
+extern chunk BIG_norm(BIG x);
+/**	@brief Normalizes a DBIG number - output normalised (Constant Time)
+ *
+	All digits of the input DBIG are reduced mod 2^BASEBITS
+	@param x DBIG number to be normalised
+ */
+extern void BIG_dnorm(DBIG x);
+/**	@brief Compares two BIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first BIG number to be compared
+	@param y second BIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_comp(BIG x, BIG y);
+/**	@brief Compares two DBIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first DBIG number to be compared
+	@param y second DBIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_dcomp(DBIG x, DBIG y);
+/**	@brief Calculate number of bits in a BIG - output normalised (Variable Time)
+ *
+	@param x BIG number
+	@return Number of bits in x
+ */
+extern int BIG_nbits(BIG x);
+/**	@brief Calculate number of bits in a DBIG - output normalised (Variable Time)
+ *
+	@param x DBIG number
+	@return Number of bits in x
+ */
+extern int BIG_dnbits(DBIG x);
+
+/**	@brief Reduce x mod n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctmod(BIG x, BIG n, int bd);
+
+/**	@brief  x=y mod n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctdmod(BIG x, DBIG y, BIG n, int bd);
+
+/**	@brief Divide x by n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctsdiv(BIG x,BIG n,int bd);
+
+/**	@brief  x=y/n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctddiv(BIG x, DBIG y, BIG n,int bd);
+
+
+/**	@brief Reduce x mod n - input and output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+ */
+extern void BIG_mod(BIG x, BIG n);
+/**	@brief Divide x by n - output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+ */
+extern void BIG_sdiv(BIG x, BIG n);
+/**	@brief  x=y mod n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_dmod(BIG x, DBIG y, BIG n);
+/**	@brief  x=y/n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_ddiv(BIG x, DBIG y, BIG n);
+/**	@brief  return parity of BIG, that is the least significant bit (Constant Time)
+ *
+	@param x BIG number
+	@return 0 or 1
+ */
+extern int BIG_parity(BIG x);
+/**	@brief  return i-th of BIG (Constant Time)
+ *
+	@param x BIG number
+	@param i the bit of x to be returned
+	@return 0 or 1
+ */
+extern int BIG_bit(BIG x, int i);
+/**	@brief  return least significant bits of a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param n number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int BIG_lastbits(BIG x, int n);
+/**	@brief  Create a random BIG from a random number generator (Constant Time)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_random(BIG x, csprng *r);
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randomnum(BIG x, BIG n, csprng *r);
+
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus and truncated to max bit length (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param t Maximum bit length
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randtrunc(BIG x, BIG n, int t, csprng *r);
+
+/**	brief  return NAF (Non-Adjacent-Form) value as +/- 1, 3 or 5, inputs must be normalised
+ *
+	Given x and 3*x extracts NAF value from given bit position, and returns number of bits processed, and number of trailing zeros detected if any
+	param x BIG number
+	param x3 BIG number, three times x
+	param i bit position
+	param nbs pointer to integer returning number of bits processed
+	param nzs pointer to integer returning number of trailing 0s
+	return + or - 1, 3 or 5
+*/
+
+/**	@brief  Calculate x=y*z mod n (Variable Time)
+ *
+	Slow method for modular multiplication
+	@param x BIG number, on exit = y*z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modmul(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y/z mod n (Variable Time)
+ *
+	Slow method for modular division
+	@param x BIG number, on exit = y/z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_moddiv(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y^2 mod n (Variable Time)
+ *
+	Slow method for modular squaring
+	@param x BIG number, on exit = y^2 mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modsqr(BIG x, BIG y, BIG n);
+/**	@brief  Calculate x=-y mod n (Variable Time)
+ *
+	Modular negation
+	@param x BIG number, on exit = -y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modneg(BIG x, BIG y, BIG n);
+
+/**	@brief  Calculate x=y+z mod n (Variable Time)
+ *
+	Slow method for modular addition
+	@param x BIG number, on exit = y+z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modadd(BIG x, BIG y, BIG z, BIG n);
+
+/**	@brief  Calculate jacobi Symbol (x/y) (Variable Time)
+ *
+	@param x BIG number
+	@param y BIG number
+	@return Jacobi symbol, -1,0 or 1
+ */
+extern int BIG_jacobi(BIG x, BIG y);
+/**	@brief  Calculate x=1/y mod n (Variable Time)
+ *
+	Modular Inversion - This is slow. Uses binary method.
+	@param x BIG number, on exit = 1/y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_invmodp(BIG x, BIG y, BIG n);
+/** @brief Calculate x=x mod 2^m (Variable Time)
+ *
+	Truncation
+	@param x BIG number, on reduced mod 2^m
+	@param m new truncated size
+*/
+extern void BIG_mod2m(BIG x, int m);
+
+/**	@brief Calculates a*b+c+*d
+ *
+	Calculate partial product of a.b, add in carry c, and add total to d (Constant Time)
+	@param a multiplier
+	@param b multiplicand
+	@param c carry
+	@param d pointer to accumulated bottom half of result
+	@return top half of result
+ */
+
+
+extern int step1(BIG,BIG,BIG);
+extern void step2(BIG,BIG,BIG);
+
+#ifdef dchunk
+
+/* Method required to calculate x*y+c+r, bottom half in r, top half returned */
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    dchunk prod = (dchunk)x * y + c + *r;
+    *r = (chunk)prod & BMASK_B384_58;
+    return (chunk)(prod >> BASEBITS_B384_58);
+}
+
+#else
+
+/* No integer type available that can store double the wordlength */
+/* accumulate partial products */
+
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    chunk x0, x1, y0, y1;
+    chunk bot, top, mid, carry;
+    x0 = x & HMASK_B384_58;
+    x1 = (x >> HBITS_B384_58);
+    y0 = y & HMASK_B384_58;
+    y1 = (y >> HBITS_B384_58);
+    bot = x0 * y0;
+    top = x1 * y1;
+    mid = x0 * y1 + x1 * y0;
+    x0 = mid & HMASK_B384_58;
+    x1 = (mid >> HBITS_B384_58);
+    bot += x0 << HBITS_B384_58;
+    bot += *r;
+    bot += c;
+
+    top += x1;
+    carry = bot >> BASEBITS_B384_58;
+    bot &= BMASK_B384_58;
+    top += carry;
+
+    *r = bot;
+    return top;
+}
+
+#endif
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/big_B416_60.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/big_B416_60.h
new file mode 100644
index 0000000..ce05134
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/big_B416_60.h
@@ -0,0 +1,697 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file big.h
+ * @author Mike Scott
+ * @date 23rd February 2016
+ * @brief Big number Header File
+ *
+ *
+ */
+
+#ifndef BIG_B416_60_H
+#define BIG_B416_60_H
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <inttypes.h>
+#include "arch.h"
+#include "core.h"
+#include "config_big_B416_60.h"
+
+using namespace core;
+
+/* could comment this out if code size is a major issue */
+#define UNWOUND
+/* Normally recommended, but may not be optimal for some architectures, for example 32-bit ARM M4 */
+#define USE_KARATSUBA
+
+#define BIGBITS_B416_60 (8*MODBYTES_B416_60)
+#define NLEN_B416_60 (1+((8*MODBYTES_B416_60-1)/BASEBITS_B416_60))
+#define DNLEN_B416_60 2*NLEN_B416_60
+#define BMASK_B416_60 (((chunk)1<<BASEBITS_B416_60)-1) /**< Mask = 2^BASEBITS-1 */
+#define NEXCESS_B416_60 (1<<(CHUNK-BASEBITS_B416_60-1))           /**< 2^(CHUNK-BASEBITS-1) - digit cannot be multiplied by more than this before normalisation */
+
+#define HBITS_B416_60 (BASEBITS_B416_60/2)      /**< Number of bits in number base divided by 2 */
+#define HMASK_B416_60 (((chunk)1<<HBITS_B416_60)-1)    /**< Mask = 2^HBITS-1 */
+
+//#define DEBUG_NORM
+
+#ifdef DEBUG_NORM  /* Add an extra location to track chunk extension */
+#define MPV_B416_60 NLEN_B416_60
+#define MNV_B416_60 (NLEN_B416_60+1)
+#define DMPV_B416_60 DNLEN_B416_60
+#define DMNV_B416_60 (DNLEN_B416_60+1)
+
+#endif
+
+namespace B416_60 {
+
+//extern int BIGMULS;
+//extern int BIGSQRS;
+
+#ifdef DEBUG_NORM
+typedef chunk BIG[NLEN_B416_60 + 2]; /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B416_60 + 2]; /**< Define type DBIG as array of chunks */
+#else
+typedef chunk BIG[NLEN_B416_60];     /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B416_60];   /**< Define type DBIG as array of chunks */
+#endif
+
+/* BIG number prototypes */
+
+/**	@brief Tests for BIG equal to zero (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_iszilch(BIG x);
+/**	@brief Tests for BIG equal to one (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if one, else returns 0
+ */
+extern int BIG_isunity(BIG x);
+/**	@brief Tests for DBIG equal to zero (Constant Time)
+ *
+	@param x a DBIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_diszilch(DBIG x);
+/**	@brief Outputs a BIG number to the console (Variable Time)
+ *
+	@param x a BIG number
+ */
+extern void BIG_output(BIG x);
+/**	@brief Outputs a BIG number to the console in raw form (Variable Time for debugging)
+ *
+	@param x a BIG number
+ */
+extern void BIG_rawoutput(BIG x);
+/**	@brief Conditional constant time swap of two BIG numbers
+ *
+	Conditionally swaps parameters in constant time (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s swap takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cswap(BIG x, BIG y, int s);
+/**	@brief Conditional copy of BIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cmove(BIG x, BIG y, int s);
+/**	@brief Conditional copy of DBIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a DBIG number
+	@param y another DBIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_dcmove(BIG x, BIG y, int s);
+/**	@brief Convert from BIG number to byte array (Constant Time)
+ *
+	@param a byte array
+	@param x BIG number
+ */
+extern void BIG_toBytes(char *a, BIG x);
+/**	@brief Convert to BIG number from byte array (Constant Time)
+ *
+	@param x BIG number
+	@param a byte array
+ */
+extern void BIG_fromBytes(BIG x, char *a);
+/**	@brief Convert to BIG number from byte array of given length (Variable Time)
+ *
+	@param x BIG number
+	@param a byte array
+	@param s byte array length
+ */
+extern void BIG_fromBytesLen(BIG x, char *a, int s);
+/**@brief Convert to DBIG number from byte array of given length (Variable Time)
+ *
+   @param x DBIG number
+   @param a byte array
+   @param s byte array length
+ */
+extern void BIG_dfromBytesLen(DBIG x, char *a, int s);
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_doutput(DBIG x); 
+
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_drawoutput(DBIG x);
+
+/**	@brief Copy BIG from Read-Only Memory to a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number in ROM
+ */
+extern void BIG_rcopy(BIG x, const BIG y);
+/**	@brief Copy BIG to another BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_copy(BIG x, BIG y);
+/**	@brief Copy DBIG to another DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_dcopy(DBIG x, DBIG y);
+/**	@brief Copy BIG to upper half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dsucopy(DBIG x, BIG y);
+/**	@brief Copy BIG to lower half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dscopy(DBIG x, BIG y);
+/**	@brief Copy lower half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sdcopy(BIG x, DBIG y);
+/**	@brief Copy upper half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sducopy(BIG x, DBIG y);
+/**	@brief Set BIG to zero (Constant Time)
+ *
+	@param x BIG number to be set to zero  
+ */
+extern void BIG_zero(BIG x);
+/**	@brief Set DBIG to zero (Constant Time)
+ *
+	@param x DBIG number to be set to zero
+ */
+extern void BIG_dzero(DBIG x);
+/**	@brief Set BIG to one (unity) (Constant Time)
+ *
+	@param x BIG number to be set to one.
+ */
+extern void BIG_one(BIG x);
+/**	@brief Set BIG to inverse mod 2^256 (Constant Time)
+ *
+	@param x BIG number to be inverted
+ */
+extern void BIG_invmod2m(BIG x);
+/**	@brief Set BIG to sum of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, sum of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_add(BIG x, BIG y, BIG z);
+
+/**	@brief Set BIG to logical or of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, or of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_or(BIG x, BIG y, BIG z);
+
+/**	@brief Increment BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be incremented
+	@param i integer
+ */
+extern void BIG_inc(BIG x, int i);
+/**	@brief Set BIG to difference of two BIGs (Constant Time)
+ *
+	@param x BIG number, difference of other two - output not normalised
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_sub(BIG x, BIG y, BIG z);
+/**	@brief Decrement BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be decremented
+	@param i integer
+ */
+extern void BIG_dec(BIG x, int i);
+/**	@brief Set DBIG to sum of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, sum of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dadd(DBIG x, DBIG y, DBIG z);
+/**	@brief Set DBIG to difference of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, difference of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dsub(DBIG x, DBIG y, DBIG z);
+/**	@brief Multiply BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_imul(BIG x, BIG y, int i);
+/**	@brief Multiply BIG by not-so-small small integer - output normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+	@return Overflowing bits
+ */
+extern chunk BIG_pmul(BIG x, BIG y, int i);
+/**	@brief Divide BIG by 3 - output normalised (Constant Time)
+ *
+	@param x BIG number
+	@return Remainder
+ */
+extern int BIG_div3(BIG x);
+/**	@brief Multiply BIG by even bigger small integer resulting in a DBIG - output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_pxmul(DBIG x, BIG y, int i);
+/**	@brief Multiply BIG by another BIG resulting in DBIG - inputs normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_mul(DBIG x, BIG y, BIG z);
+/**	@brief Multiply BIG by another BIG resulting in another BIG - inputs normalised and output normalised (Constant Time)
+ *
+	Note that the product must fit into a BIG, and x must be distinct from y and z
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_smul(BIG x, BIG y, BIG z);
+/**	@brief Square BIG resulting in a DBIG - input normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, square of a BIG
+	@param y BIG number to be squared
+ */
+extern void BIG_sqr(DBIG x, BIG y);
+
+/**	@brief Montgomery reduction of a DBIG to a BIG  - input normalised and output normalised (Constant Time)
+ *
+	@param a BIG number, reduction of a BIG
+	@param md BIG number, the modulus
+	@param MC the Montgomery Constant
+	@param d DBIG number to be reduced
+ */
+extern void BIG_monty(BIG a, BIG md, chunk MC, DBIG d);
+
+/**	@brief Shifts a BIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shl(BIG x, int s);
+/**	@brief Fast shifts a BIG left by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Overflow bits
+ */
+extern int BIG_fshl(BIG x, int s);
+/**	@brief Shifts a DBIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshl(DBIG x, int s);
+/**	@brief Shifts a BIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shr(BIG x, int s);
+
+
+/**	@brief Fast time-critical combined shift by 1 bit, subtract and normalise (Constant Time)
+ *
+	@param r BIG number normalised output
+	@param a BIG number to be subtracted from
+	@param m BIG number to be shifted and subtracted
+	@return sign of r
+ */
+extern int BIG_ssn(BIG r, BIG a, BIG m);
+
+/**	@brief Fast shifts a BIG right by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Shifted out bits
+ */
+extern int BIG_fshr(BIG x, int s);
+/**	@brief Shifts a DBIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshr(DBIG x, int s);
+/**	@brief Splits a DBIG into two BIGs - input must be normalised, outputs normalised (Constant Time as used)
+ *
+	Internal function. The value of s must be approximately in the middle of the DBIG.
+	Typically used to extract z mod 2^MODBITS and z/2^MODBITS
+	@param x BIG number, top half of z
+	@param y BIG number, bottom half of z
+	@param z DBIG number to be split in two.
+	@param s Bit position at which to split
+	@return carry-out from top half
+ */
+extern chunk BIG_split(BIG x, BIG y, DBIG z, int s);
+/**	@brief Normalizes a BIG number - output normalised (Constant Time)
+ *
+	All digits of the input BIG are reduced mod 2^BASEBITS
+	@param x BIG number to be normalised
+ */
+extern chunk BIG_norm(BIG x);
+/**	@brief Normalizes a DBIG number - output normalised (Constant Time)
+ *
+	All digits of the input DBIG are reduced mod 2^BASEBITS
+	@param x DBIG number to be normalised
+ */
+extern void BIG_dnorm(DBIG x);
+/**	@brief Compares two BIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first BIG number to be compared
+	@param y second BIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_comp(BIG x, BIG y);
+/**	@brief Compares two DBIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first DBIG number to be compared
+	@param y second DBIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_dcomp(DBIG x, DBIG y);
+/**	@brief Calculate number of bits in a BIG - output normalised (Variable Time)
+ *
+	@param x BIG number
+	@return Number of bits in x
+ */
+extern int BIG_nbits(BIG x);
+/**	@brief Calculate number of bits in a DBIG - output normalised (Variable Time)
+ *
+	@param x DBIG number
+	@return Number of bits in x
+ */
+extern int BIG_dnbits(DBIG x);
+
+/**	@brief Reduce x mod n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctmod(BIG x, BIG n, int bd);
+
+/**	@brief  x=y mod n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctdmod(BIG x, DBIG y, BIG n, int bd);
+
+/**	@brief Divide x by n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctsdiv(BIG x,BIG n,int bd);
+
+/**	@brief  x=y/n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctddiv(BIG x, DBIG y, BIG n,int bd);
+
+
+/**	@brief Reduce x mod n - input and output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+ */
+extern void BIG_mod(BIG x, BIG n);
+/**	@brief Divide x by n - output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+ */
+extern void BIG_sdiv(BIG x, BIG n);
+/**	@brief  x=y mod n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_dmod(BIG x, DBIG y, BIG n);
+/**	@brief  x=y/n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_ddiv(BIG x, DBIG y, BIG n);
+/**	@brief  return parity of BIG, that is the least significant bit (Constant Time)
+ *
+	@param x BIG number
+	@return 0 or 1
+ */
+extern int BIG_parity(BIG x);
+/**	@brief  return i-th of BIG (Constant Time)
+ *
+	@param x BIG number
+	@param i the bit of x to be returned
+	@return 0 or 1
+ */
+extern int BIG_bit(BIG x, int i);
+/**	@brief  return least significant bits of a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param n number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int BIG_lastbits(BIG x, int n);
+/**	@brief  Create a random BIG from a random number generator (Constant Time)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_random(BIG x, csprng *r);
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randomnum(BIG x, BIG n, csprng *r);
+
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus and truncated to max bit length (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param t Maximum bit length
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randtrunc(BIG x, BIG n, int t, csprng *r);
+
+/**	brief  return NAF (Non-Adjacent-Form) value as +/- 1, 3 or 5, inputs must be normalised
+ *
+	Given x and 3*x extracts NAF value from given bit position, and returns number of bits processed, and number of trailing zeros detected if any
+	param x BIG number
+	param x3 BIG number, three times x
+	param i bit position
+	param nbs pointer to integer returning number of bits processed
+	param nzs pointer to integer returning number of trailing 0s
+	return + or - 1, 3 or 5
+*/
+
+/**	@brief  Calculate x=y*z mod n (Variable Time)
+ *
+	Slow method for modular multiplication
+	@param x BIG number, on exit = y*z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modmul(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y/z mod n (Variable Time)
+ *
+	Slow method for modular division
+	@param x BIG number, on exit = y/z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_moddiv(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y^2 mod n (Variable Time)
+ *
+	Slow method for modular squaring
+	@param x BIG number, on exit = y^2 mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modsqr(BIG x, BIG y, BIG n);
+/**	@brief  Calculate x=-y mod n (Variable Time)
+ *
+	Modular negation
+	@param x BIG number, on exit = -y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modneg(BIG x, BIG y, BIG n);
+
+/**	@brief  Calculate x=y+z mod n (Variable Time)
+ *
+	Slow method for modular addition
+	@param x BIG number, on exit = y+z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modadd(BIG x, BIG y, BIG z, BIG n);
+
+/**	@brief  Calculate jacobi Symbol (x/y) (Variable Time)
+ *
+	@param x BIG number
+	@param y BIG number
+	@return Jacobi symbol, -1,0 or 1
+ */
+extern int BIG_jacobi(BIG x, BIG y);
+/**	@brief  Calculate x=1/y mod n (Variable Time)
+ *
+	Modular Inversion - This is slow. Uses binary method.
+	@param x BIG number, on exit = 1/y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_invmodp(BIG x, BIG y, BIG n);
+/** @brief Calculate x=x mod 2^m (Variable Time)
+ *
+	Truncation
+	@param x BIG number, on reduced mod 2^m
+	@param m new truncated size
+*/
+extern void BIG_mod2m(BIG x, int m);
+
+/**	@brief Calculates a*b+c+*d
+ *
+	Calculate partial product of a.b, add in carry c, and add total to d (Constant Time)
+	@param a multiplier
+	@param b multiplicand
+	@param c carry
+	@param d pointer to accumulated bottom half of result
+	@return top half of result
+ */
+
+
+extern int step1(BIG,BIG,BIG);
+extern void step2(BIG,BIG,BIG);
+
+#ifdef dchunk
+
+/* Method required to calculate x*y+c+r, bottom half in r, top half returned */
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    dchunk prod = (dchunk)x * y + c + *r;
+    *r = (chunk)prod & BMASK_B416_60;
+    return (chunk)(prod >> BASEBITS_B416_60);
+}
+
+#else
+
+/* No integer type available that can store double the wordlength */
+/* accumulate partial products */
+
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    chunk x0, x1, y0, y1;
+    chunk bot, top, mid, carry;
+    x0 = x & HMASK_B416_60;
+    x1 = (x >> HBITS_B416_60);
+    y0 = y & HMASK_B416_60;
+    y1 = (y >> HBITS_B416_60);
+    bot = x0 * y0;
+    top = x1 * y1;
+    mid = x0 * y1 + x1 * y0;
+    x0 = mid & HMASK_B416_60;
+    x1 = (mid >> HBITS_B416_60);
+    bot += x0 << HBITS_B416_60;
+    bot += *r;
+    bot += c;
+
+    top += x1;
+    carry = bot >> BASEBITS_B416_60;
+    bot &= BMASK_B416_60;
+    top += carry;
+
+    *r = bot;
+    return top;
+}
+
+#endif
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/big_B448_58.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/big_B448_58.h
new file mode 100644
index 0000000..1ad28ee
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/big_B448_58.h
@@ -0,0 +1,697 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file big.h
+ * @author Mike Scott
+ * @date 23rd February 2016
+ * @brief Big number Header File
+ *
+ *
+ */
+
+#ifndef BIG_B448_58_H
+#define BIG_B448_58_H
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <inttypes.h>
+#include "arch.h"
+#include "core.h"
+#include "config_big_B448_58.h"
+
+using namespace core;
+
+/* could comment this out if code size is a major issue */
+#define UNWOUND
+/* Normally recommended, but may not be optimal for some architectures, for example 32-bit ARM M4 */
+#define USE_KARATSUBA
+
+#define BIGBITS_B448_58 (8*MODBYTES_B448_58)
+#define NLEN_B448_58 (1+((8*MODBYTES_B448_58-1)/BASEBITS_B448_58))
+#define DNLEN_B448_58 2*NLEN_B448_58
+#define BMASK_B448_58 (((chunk)1<<BASEBITS_B448_58)-1) /**< Mask = 2^BASEBITS-1 */
+#define NEXCESS_B448_58 (1<<(CHUNK-BASEBITS_B448_58-1))           /**< 2^(CHUNK-BASEBITS-1) - digit cannot be multiplied by more than this before normalisation */
+
+#define HBITS_B448_58 (BASEBITS_B448_58/2)      /**< Number of bits in number base divided by 2 */
+#define HMASK_B448_58 (((chunk)1<<HBITS_B448_58)-1)    /**< Mask = 2^HBITS-1 */
+
+//#define DEBUG_NORM
+
+#ifdef DEBUG_NORM  /* Add an extra location to track chunk extension */
+#define MPV_B448_58 NLEN_B448_58
+#define MNV_B448_58 (NLEN_B448_58+1)
+#define DMPV_B448_58 DNLEN_B448_58
+#define DMNV_B448_58 (DNLEN_B448_58+1)
+
+#endif
+
+namespace B448_58 {
+
+//extern int BIGMULS;
+//extern int BIGSQRS;
+
+#ifdef DEBUG_NORM
+typedef chunk BIG[NLEN_B448_58 + 2]; /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B448_58 + 2]; /**< Define type DBIG as array of chunks */
+#else
+typedef chunk BIG[NLEN_B448_58];     /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B448_58];   /**< Define type DBIG as array of chunks */
+#endif
+
+/* BIG number prototypes */
+
+/**	@brief Tests for BIG equal to zero (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_iszilch(BIG x);
+/**	@brief Tests for BIG equal to one (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if one, else returns 0
+ */
+extern int BIG_isunity(BIG x);
+/**	@brief Tests for DBIG equal to zero (Constant Time)
+ *
+	@param x a DBIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_diszilch(DBIG x);
+/**	@brief Outputs a BIG number to the console (Variable Time)
+ *
+	@param x a BIG number
+ */
+extern void BIG_output(BIG x);
+/**	@brief Outputs a BIG number to the console in raw form (Variable Time for debugging)
+ *
+	@param x a BIG number
+ */
+extern void BIG_rawoutput(BIG x);
+/**	@brief Conditional constant time swap of two BIG numbers
+ *
+	Conditionally swaps parameters in constant time (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s swap takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cswap(BIG x, BIG y, int s);
+/**	@brief Conditional copy of BIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cmove(BIG x, BIG y, int s);
+/**	@brief Conditional copy of DBIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a DBIG number
+	@param y another DBIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_dcmove(BIG x, BIG y, int s);
+/**	@brief Convert from BIG number to byte array (Constant Time)
+ *
+	@param a byte array
+	@param x BIG number
+ */
+extern void BIG_toBytes(char *a, BIG x);
+/**	@brief Convert to BIG number from byte array (Constant Time)
+ *
+	@param x BIG number
+	@param a byte array
+ */
+extern void BIG_fromBytes(BIG x, char *a);
+/**	@brief Convert to BIG number from byte array of given length (Variable Time)
+ *
+	@param x BIG number
+	@param a byte array
+	@param s byte array length
+ */
+extern void BIG_fromBytesLen(BIG x, char *a, int s);
+/**@brief Convert to DBIG number from byte array of given length (Variable Time)
+ *
+   @param x DBIG number
+   @param a byte array
+   @param s byte array length
+ */
+extern void BIG_dfromBytesLen(DBIG x, char *a, int s);
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_doutput(DBIG x); 
+
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_drawoutput(DBIG x);
+
+/**	@brief Copy BIG from Read-Only Memory to a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number in ROM
+ */
+extern void BIG_rcopy(BIG x, const BIG y);
+/**	@brief Copy BIG to another BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_copy(BIG x, BIG y);
+/**	@brief Copy DBIG to another DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_dcopy(DBIG x, DBIG y);
+/**	@brief Copy BIG to upper half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dsucopy(DBIG x, BIG y);
+/**	@brief Copy BIG to lower half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dscopy(DBIG x, BIG y);
+/**	@brief Copy lower half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sdcopy(BIG x, DBIG y);
+/**	@brief Copy upper half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sducopy(BIG x, DBIG y);
+/**	@brief Set BIG to zero (Constant Time)
+ *
+	@param x BIG number to be set to zero  
+ */
+extern void BIG_zero(BIG x);
+/**	@brief Set DBIG to zero (Constant Time)
+ *
+	@param x DBIG number to be set to zero
+ */
+extern void BIG_dzero(DBIG x);
+/**	@brief Set BIG to one (unity) (Constant Time)
+ *
+	@param x BIG number to be set to one.
+ */
+extern void BIG_one(BIG x);
+/**	@brief Set BIG to inverse mod 2^256 (Constant Time)
+ *
+	@param x BIG number to be inverted
+ */
+extern void BIG_invmod2m(BIG x);
+/**	@brief Set BIG to sum of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, sum of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_add(BIG x, BIG y, BIG z);
+
+/**	@brief Set BIG to logical or of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, or of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_or(BIG x, BIG y, BIG z);
+
+/**	@brief Increment BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be incremented
+	@param i integer
+ */
+extern void BIG_inc(BIG x, int i);
+/**	@brief Set BIG to difference of two BIGs (Constant Time)
+ *
+	@param x BIG number, difference of other two - output not normalised
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_sub(BIG x, BIG y, BIG z);
+/**	@brief Decrement BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be decremented
+	@param i integer
+ */
+extern void BIG_dec(BIG x, int i);
+/**	@brief Set DBIG to sum of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, sum of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dadd(DBIG x, DBIG y, DBIG z);
+/**	@brief Set DBIG to difference of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, difference of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dsub(DBIG x, DBIG y, DBIG z);
+/**	@brief Multiply BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_imul(BIG x, BIG y, int i);
+/**	@brief Multiply BIG by not-so-small small integer - output normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+	@return Overflowing bits
+ */
+extern chunk BIG_pmul(BIG x, BIG y, int i);
+/**	@brief Divide BIG by 3 - output normalised (Constant Time)
+ *
+	@param x BIG number
+	@return Remainder
+ */
+extern int BIG_div3(BIG x);
+/**	@brief Multiply BIG by even bigger small integer resulting in a DBIG - output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_pxmul(DBIG x, BIG y, int i);
+/**	@brief Multiply BIG by another BIG resulting in DBIG - inputs normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_mul(DBIG x, BIG y, BIG z);
+/**	@brief Multiply BIG by another BIG resulting in another BIG - inputs normalised and output normalised (Constant Time)
+ *
+	Note that the product must fit into a BIG, and x must be distinct from y and z
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_smul(BIG x, BIG y, BIG z);
+/**	@brief Square BIG resulting in a DBIG - input normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, square of a BIG
+	@param y BIG number to be squared
+ */
+extern void BIG_sqr(DBIG x, BIG y);
+
+/**	@brief Montgomery reduction of a DBIG to a BIG  - input normalised and output normalised (Constant Time)
+ *
+	@param a BIG number, reduction of a BIG
+	@param md BIG number, the modulus
+	@param MC the Montgomery Constant
+	@param d DBIG number to be reduced
+ */
+extern void BIG_monty(BIG a, BIG md, chunk MC, DBIG d);
+
+/**	@brief Shifts a BIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shl(BIG x, int s);
+/**	@brief Fast shifts a BIG left by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Overflow bits
+ */
+extern int BIG_fshl(BIG x, int s);
+/**	@brief Shifts a DBIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshl(DBIG x, int s);
+/**	@brief Shifts a BIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shr(BIG x, int s);
+
+
+/**	@brief Fast time-critical combined shift by 1 bit, subtract and normalise (Constant Time)
+ *
+	@param r BIG number normalised output
+	@param a BIG number to be subtracted from
+	@param m BIG number to be shifted and subtracted
+	@return sign of r
+ */
+extern int BIG_ssn(BIG r, BIG a, BIG m);
+
+/**	@brief Fast shifts a BIG right by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Shifted out bits
+ */
+extern int BIG_fshr(BIG x, int s);
+/**	@brief Shifts a DBIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshr(DBIG x, int s);
+/**	@brief Splits a DBIG into two BIGs - input must be normalised, outputs normalised (Constant Time as used)
+ *
+	Internal function. The value of s must be approximately in the middle of the DBIG.
+	Typically used to extract z mod 2^MODBITS and z/2^MODBITS
+	@param x BIG number, top half of z
+	@param y BIG number, bottom half of z
+	@param z DBIG number to be split in two.
+	@param s Bit position at which to split
+	@return carry-out from top half
+ */
+extern chunk BIG_split(BIG x, BIG y, DBIG z, int s);
+/**	@brief Normalizes a BIG number - output normalised (Constant Time)
+ *
+	All digits of the input BIG are reduced mod 2^BASEBITS
+	@param x BIG number to be normalised
+ */
+extern chunk BIG_norm(BIG x);
+/**	@brief Normalizes a DBIG number - output normalised (Constant Time)
+ *
+	All digits of the input DBIG are reduced mod 2^BASEBITS
+	@param x DBIG number to be normalised
+ */
+extern void BIG_dnorm(DBIG x);
+/**	@brief Compares two BIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first BIG number to be compared
+	@param y second BIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_comp(BIG x, BIG y);
+/**	@brief Compares two DBIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first DBIG number to be compared
+	@param y second DBIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_dcomp(DBIG x, DBIG y);
+/**	@brief Calculate number of bits in a BIG - output normalised (Variable Time)
+ *
+	@param x BIG number
+	@return Number of bits in x
+ */
+extern int BIG_nbits(BIG x);
+/**	@brief Calculate number of bits in a DBIG - output normalised (Variable Time)
+ *
+	@param x DBIG number
+	@return Number of bits in x
+ */
+extern int BIG_dnbits(DBIG x);
+
+/**	@brief Reduce x mod n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctmod(BIG x, BIG n, int bd);
+
+/**	@brief  x=y mod n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctdmod(BIG x, DBIG y, BIG n, int bd);
+
+/**	@brief Divide x by n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctsdiv(BIG x,BIG n,int bd);
+
+/**	@brief  x=y/n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctddiv(BIG x, DBIG y, BIG n,int bd);
+
+
+/**	@brief Reduce x mod n - input and output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+ */
+extern void BIG_mod(BIG x, BIG n);
+/**	@brief Divide x by n - output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+ */
+extern void BIG_sdiv(BIG x, BIG n);
+/**	@brief  x=y mod n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_dmod(BIG x, DBIG y, BIG n);
+/**	@brief  x=y/n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_ddiv(BIG x, DBIG y, BIG n);
+/**	@brief  return parity of BIG, that is the least significant bit (Constant Time)
+ *
+	@param x BIG number
+	@return 0 or 1
+ */
+extern int BIG_parity(BIG x);
+/**	@brief  return i-th of BIG (Constant Time)
+ *
+	@param x BIG number
+	@param i the bit of x to be returned
+	@return 0 or 1
+ */
+extern int BIG_bit(BIG x, int i);
+/**	@brief  return least significant bits of a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param n number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int BIG_lastbits(BIG x, int n);
+/**	@brief  Create a random BIG from a random number generator (Constant Time)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_random(BIG x, csprng *r);
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randomnum(BIG x, BIG n, csprng *r);
+
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus and truncated to max bit length (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param t Maximum bit length
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randtrunc(BIG x, BIG n, int t, csprng *r);
+
+/**	brief  return NAF (Non-Adjacent-Form) value as +/- 1, 3 or 5, inputs must be normalised
+ *
+	Given x and 3*x extracts NAF value from given bit position, and returns number of bits processed, and number of trailing zeros detected if any
+	param x BIG number
+	param x3 BIG number, three times x
+	param i bit position
+	param nbs pointer to integer returning number of bits processed
+	param nzs pointer to integer returning number of trailing 0s
+	return + or - 1, 3 or 5
+*/
+
+/**	@brief  Calculate x=y*z mod n (Variable Time)
+ *
+	Slow method for modular multiplication
+	@param x BIG number, on exit = y*z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modmul(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y/z mod n (Variable Time)
+ *
+	Slow method for modular division
+	@param x BIG number, on exit = y/z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_moddiv(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y^2 mod n (Variable Time)
+ *
+	Slow method for modular squaring
+	@param x BIG number, on exit = y^2 mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modsqr(BIG x, BIG y, BIG n);
+/**	@brief  Calculate x=-y mod n (Variable Time)
+ *
+	Modular negation
+	@param x BIG number, on exit = -y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modneg(BIG x, BIG y, BIG n);
+
+/**	@brief  Calculate x=y+z mod n (Variable Time)
+ *
+	Slow method for modular addition
+	@param x BIG number, on exit = y+z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modadd(BIG x, BIG y, BIG z, BIG n);
+
+/**	@brief  Calculate jacobi Symbol (x/y) (Variable Time)
+ *
+	@param x BIG number
+	@param y BIG number
+	@return Jacobi symbol, -1,0 or 1
+ */
+extern int BIG_jacobi(BIG x, BIG y);
+/**	@brief  Calculate x=1/y mod n (Variable Time)
+ *
+	Modular Inversion - This is slow. Uses binary method.
+	@param x BIG number, on exit = 1/y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_invmodp(BIG x, BIG y, BIG n);
+/** @brief Calculate x=x mod 2^m (Variable Time)
+ *
+	Truncation
+	@param x BIG number, on reduced mod 2^m
+	@param m new truncated size
+*/
+extern void BIG_mod2m(BIG x, int m);
+
+/**	@brief Calculates a*b+c+*d
+ *
+	Calculate partial product of a.b, add in carry c, and add total to d (Constant Time)
+	@param a multiplier
+	@param b multiplicand
+	@param c carry
+	@param d pointer to accumulated bottom half of result
+	@return top half of result
+ */
+
+
+extern int step1(BIG,BIG,BIG);
+extern void step2(BIG,BIG,BIG);
+
+#ifdef dchunk
+
+/* Method required to calculate x*y+c+r, bottom half in r, top half returned */
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    dchunk prod = (dchunk)x * y + c + *r;
+    *r = (chunk)prod & BMASK_B448_58;
+    return (chunk)(prod >> BASEBITS_B448_58);
+}
+
+#else
+
+/* No integer type available that can store double the wordlength */
+/* accumulate partial products */
+
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    chunk x0, x1, y0, y1;
+    chunk bot, top, mid, carry;
+    x0 = x & HMASK_B448_58;
+    x1 = (x >> HBITS_B448_58);
+    y0 = y & HMASK_B448_58;
+    y1 = (y >> HBITS_B448_58);
+    bot = x0 * y0;
+    top = x1 * y1;
+    mid = x0 * y1 + x1 * y0;
+    x0 = mid & HMASK_B448_58;
+    x1 = (mid >> HBITS_B448_58);
+    bot += x0 << HBITS_B448_58;
+    bot += *r;
+    bot += c;
+
+    top += x1;
+    carry = bot >> BASEBITS_B448_58;
+    bot &= BMASK_B448_58;
+    top += carry;
+
+    *r = bot;
+    return top;
+}
+
+#endif
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/big_B448_60.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/big_B448_60.h
new file mode 100644
index 0000000..426c032
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/big_B448_60.h
@@ -0,0 +1,697 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file big.h
+ * @author Mike Scott
+ * @date 23rd February 2016
+ * @brief Big number Header File
+ *
+ *
+ */
+
+#ifndef BIG_B448_60_H
+#define BIG_B448_60_H
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <inttypes.h>
+#include "arch.h"
+#include "core.h"
+#include "config_big_B448_60.h"
+
+using namespace core;
+
+/* could comment this out if code size is a major issue */
+#define UNWOUND
+/* Normally recommended, but may not be optimal for some architectures, for example 32-bit ARM M4 */
+#define USE_KARATSUBA
+
+#define BIGBITS_B448_60 (8*MODBYTES_B448_60)
+#define NLEN_B448_60 (1+((8*MODBYTES_B448_60-1)/BASEBITS_B448_60))
+#define DNLEN_B448_60 2*NLEN_B448_60
+#define BMASK_B448_60 (((chunk)1<<BASEBITS_B448_60)-1) /**< Mask = 2^BASEBITS-1 */
+#define NEXCESS_B448_60 (1<<(CHUNK-BASEBITS_B448_60-1))           /**< 2^(CHUNK-BASEBITS-1) - digit cannot be multiplied by more than this before normalisation */
+
+#define HBITS_B448_60 (BASEBITS_B448_60/2)      /**< Number of bits in number base divided by 2 */
+#define HMASK_B448_60 (((chunk)1<<HBITS_B448_60)-1)    /**< Mask = 2^HBITS-1 */
+
+//#define DEBUG_NORM
+
+#ifdef DEBUG_NORM  /* Add an extra location to track chunk extension */
+#define MPV_B448_60 NLEN_B448_60
+#define MNV_B448_60 (NLEN_B448_60+1)
+#define DMPV_B448_60 DNLEN_B448_60
+#define DMNV_B448_60 (DNLEN_B448_60+1)
+
+#endif
+
+namespace B448_60 {
+
+//extern int BIGMULS;
+//extern int BIGSQRS;
+
+#ifdef DEBUG_NORM
+typedef chunk BIG[NLEN_B448_60 + 2]; /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B448_60 + 2]; /**< Define type DBIG as array of chunks */
+#else
+typedef chunk BIG[NLEN_B448_60];     /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B448_60];   /**< Define type DBIG as array of chunks */
+#endif
+
+/* BIG number prototypes */
+
+/**	@brief Tests for BIG equal to zero (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_iszilch(BIG x);
+/**	@brief Tests for BIG equal to one (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if one, else returns 0
+ */
+extern int BIG_isunity(BIG x);
+/**	@brief Tests for DBIG equal to zero (Constant Time)
+ *
+	@param x a DBIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_diszilch(DBIG x);
+/**	@brief Outputs a BIG number to the console (Variable Time)
+ *
+	@param x a BIG number
+ */
+extern void BIG_output(BIG x);
+/**	@brief Outputs a BIG number to the console in raw form (Variable Time for debugging)
+ *
+	@param x a BIG number
+ */
+extern void BIG_rawoutput(BIG x);
+/**	@brief Conditional constant time swap of two BIG numbers
+ *
+	Conditionally swaps parameters in constant time (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s swap takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cswap(BIG x, BIG y, int s);
+/**	@brief Conditional copy of BIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cmove(BIG x, BIG y, int s);
+/**	@brief Conditional copy of DBIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a DBIG number
+	@param y another DBIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_dcmove(BIG x, BIG y, int s);
+/**	@brief Convert from BIG number to byte array (Constant Time)
+ *
+	@param a byte array
+	@param x BIG number
+ */
+extern void BIG_toBytes(char *a, BIG x);
+/**	@brief Convert to BIG number from byte array (Constant Time)
+ *
+	@param x BIG number
+	@param a byte array
+ */
+extern void BIG_fromBytes(BIG x, char *a);
+/**	@brief Convert to BIG number from byte array of given length (Variable Time)
+ *
+	@param x BIG number
+	@param a byte array
+	@param s byte array length
+ */
+extern void BIG_fromBytesLen(BIG x, char *a, int s);
+/**@brief Convert to DBIG number from byte array of given length (Variable Time)
+ *
+   @param x DBIG number
+   @param a byte array
+   @param s byte array length
+ */
+extern void BIG_dfromBytesLen(DBIG x, char *a, int s);
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_doutput(DBIG x); 
+
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_drawoutput(DBIG x);
+
+/**	@brief Copy BIG from Read-Only Memory to a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number in ROM
+ */
+extern void BIG_rcopy(BIG x, const BIG y);
+/**	@brief Copy BIG to another BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_copy(BIG x, BIG y);
+/**	@brief Copy DBIG to another DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_dcopy(DBIG x, DBIG y);
+/**	@brief Copy BIG to upper half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dsucopy(DBIG x, BIG y);
+/**	@brief Copy BIG to lower half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dscopy(DBIG x, BIG y);
+/**	@brief Copy lower half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sdcopy(BIG x, DBIG y);
+/**	@brief Copy upper half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sducopy(BIG x, DBIG y);
+/**	@brief Set BIG to zero (Constant Time)
+ *
+	@param x BIG number to be set to zero  
+ */
+extern void BIG_zero(BIG x);
+/**	@brief Set DBIG to zero (Constant Time)
+ *
+	@param x DBIG number to be set to zero
+ */
+extern void BIG_dzero(DBIG x);
+/**	@brief Set BIG to one (unity) (Constant Time)
+ *
+	@param x BIG number to be set to one.
+ */
+extern void BIG_one(BIG x);
+/**	@brief Set BIG to inverse mod 2^256 (Constant Time)
+ *
+	@param x BIG number to be inverted
+ */
+extern void BIG_invmod2m(BIG x);
+/**	@brief Set BIG to sum of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, sum of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_add(BIG x, BIG y, BIG z);
+
+/**	@brief Set BIG to logical or of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, or of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_or(BIG x, BIG y, BIG z);
+
+/**	@brief Increment BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be incremented
+	@param i integer
+ */
+extern void BIG_inc(BIG x, int i);
+/**	@brief Set BIG to difference of two BIGs (Constant Time)
+ *
+	@param x BIG number, difference of other two - output not normalised
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_sub(BIG x, BIG y, BIG z);
+/**	@brief Decrement BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be decremented
+	@param i integer
+ */
+extern void BIG_dec(BIG x, int i);
+/**	@brief Set DBIG to sum of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, sum of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dadd(DBIG x, DBIG y, DBIG z);
+/**	@brief Set DBIG to difference of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, difference of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dsub(DBIG x, DBIG y, DBIG z);
+/**	@brief Multiply BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_imul(BIG x, BIG y, int i);
+/**	@brief Multiply BIG by not-so-small small integer - output normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+	@return Overflowing bits
+ */
+extern chunk BIG_pmul(BIG x, BIG y, int i);
+/**	@brief Divide BIG by 3 - output normalised (Constant Time)
+ *
+	@param x BIG number
+	@return Remainder
+ */
+extern int BIG_div3(BIG x);
+/**	@brief Multiply BIG by even bigger small integer resulting in a DBIG - output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_pxmul(DBIG x, BIG y, int i);
+/**	@brief Multiply BIG by another BIG resulting in DBIG - inputs normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_mul(DBIG x, BIG y, BIG z);
+/**	@brief Multiply BIG by another BIG resulting in another BIG - inputs normalised and output normalised (Constant Time)
+ *
+	Note that the product must fit into a BIG, and x must be distinct from y and z
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_smul(BIG x, BIG y, BIG z);
+/**	@brief Square BIG resulting in a DBIG - input normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, square of a BIG
+	@param y BIG number to be squared
+ */
+extern void BIG_sqr(DBIG x, BIG y);
+
+/**	@brief Montgomery reduction of a DBIG to a BIG  - input normalised and output normalised (Constant Time)
+ *
+	@param a BIG number, reduction of a BIG
+	@param md BIG number, the modulus
+	@param MC the Montgomery Constant
+	@param d DBIG number to be reduced
+ */
+extern void BIG_monty(BIG a, BIG md, chunk MC, DBIG d);
+
+/**	@brief Shifts a BIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shl(BIG x, int s);
+/**	@brief Fast shifts a BIG left by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Overflow bits
+ */
+extern int BIG_fshl(BIG x, int s);
+/**	@brief Shifts a DBIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshl(DBIG x, int s);
+/**	@brief Shifts a BIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shr(BIG x, int s);
+
+
+/**	@brief Fast time-critical combined shift by 1 bit, subtract and normalise (Constant Time)
+ *
+	@param r BIG number normalised output
+	@param a BIG number to be subtracted from
+	@param m BIG number to be shifted and subtracted
+	@return sign of r
+ */
+extern int BIG_ssn(BIG r, BIG a, BIG m);
+
+/**	@brief Fast shifts a BIG right by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Shifted out bits
+ */
+extern int BIG_fshr(BIG x, int s);
+/**	@brief Shifts a DBIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshr(DBIG x, int s);
+/**	@brief Splits a DBIG into two BIGs - input must be normalised, outputs normalised (Constant Time as used)
+ *
+	Internal function. The value of s must be approximately in the middle of the DBIG.
+	Typically used to extract z mod 2^MODBITS and z/2^MODBITS
+	@param x BIG number, top half of z
+	@param y BIG number, bottom half of z
+	@param z DBIG number to be split in two.
+	@param s Bit position at which to split
+	@return carry-out from top half
+ */
+extern chunk BIG_split(BIG x, BIG y, DBIG z, int s);
+/**	@brief Normalizes a BIG number - output normalised (Constant Time)
+ *
+	All digits of the input BIG are reduced mod 2^BASEBITS
+	@param x BIG number to be normalised
+ */
+extern chunk BIG_norm(BIG x);
+/**	@brief Normalizes a DBIG number - output normalised (Constant Time)
+ *
+	All digits of the input DBIG are reduced mod 2^BASEBITS
+	@param x DBIG number to be normalised
+ */
+extern void BIG_dnorm(DBIG x);
+/**	@brief Compares two BIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first BIG number to be compared
+	@param y second BIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_comp(BIG x, BIG y);
+/**	@brief Compares two DBIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first DBIG number to be compared
+	@param y second DBIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_dcomp(DBIG x, DBIG y);
+/**	@brief Calculate number of bits in a BIG - output normalised (Variable Time)
+ *
+	@param x BIG number
+	@return Number of bits in x
+ */
+extern int BIG_nbits(BIG x);
+/**	@brief Calculate number of bits in a DBIG - output normalised (Variable Time)
+ *
+	@param x DBIG number
+	@return Number of bits in x
+ */
+extern int BIG_dnbits(DBIG x);
+
+/**	@brief Reduce x mod n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctmod(BIG x, BIG n, int bd);
+
+/**	@brief  x=y mod n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctdmod(BIG x, DBIG y, BIG n, int bd);
+
+/**	@brief Divide x by n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctsdiv(BIG x,BIG n,int bd);
+
+/**	@brief  x=y/n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctddiv(BIG x, DBIG y, BIG n,int bd);
+
+
+/**	@brief Reduce x mod n - input and output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+ */
+extern void BIG_mod(BIG x, BIG n);
+/**	@brief Divide x by n - output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+ */
+extern void BIG_sdiv(BIG x, BIG n);
+/**	@brief  x=y mod n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_dmod(BIG x, DBIG y, BIG n);
+/**	@brief  x=y/n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_ddiv(BIG x, DBIG y, BIG n);
+/**	@brief  return parity of BIG, that is the least significant bit (Constant Time)
+ *
+	@param x BIG number
+	@return 0 or 1
+ */
+extern int BIG_parity(BIG x);
+/**	@brief  return i-th of BIG (Constant Time)
+ *
+	@param x BIG number
+	@param i the bit of x to be returned
+	@return 0 or 1
+ */
+extern int BIG_bit(BIG x, int i);
+/**	@brief  return least significant bits of a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param n number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int BIG_lastbits(BIG x, int n);
+/**	@brief  Create a random BIG from a random number generator (Constant Time)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_random(BIG x, csprng *r);
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randomnum(BIG x, BIG n, csprng *r);
+
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus and truncated to max bit length (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param t Maximum bit length
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randtrunc(BIG x, BIG n, int t, csprng *r);
+
+/**	brief  return NAF (Non-Adjacent-Form) value as +/- 1, 3 or 5, inputs must be normalised
+ *
+	Given x and 3*x extracts NAF value from given bit position, and returns number of bits processed, and number of trailing zeros detected if any
+	param x BIG number
+	param x3 BIG number, three times x
+	param i bit position
+	param nbs pointer to integer returning number of bits processed
+	param nzs pointer to integer returning number of trailing 0s
+	return + or - 1, 3 or 5
+*/
+
+/**	@brief  Calculate x=y*z mod n (Variable Time)
+ *
+	Slow method for modular multiplication
+	@param x BIG number, on exit = y*z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modmul(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y/z mod n (Variable Time)
+ *
+	Slow method for modular division
+	@param x BIG number, on exit = y/z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_moddiv(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y^2 mod n (Variable Time)
+ *
+	Slow method for modular squaring
+	@param x BIG number, on exit = y^2 mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modsqr(BIG x, BIG y, BIG n);
+/**	@brief  Calculate x=-y mod n (Variable Time)
+ *
+	Modular negation
+	@param x BIG number, on exit = -y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modneg(BIG x, BIG y, BIG n);
+
+/**	@brief  Calculate x=y+z mod n (Variable Time)
+ *
+	Slow method for modular addition
+	@param x BIG number, on exit = y+z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modadd(BIG x, BIG y, BIG z, BIG n);
+
+/**	@brief  Calculate jacobi Symbol (x/y) (Variable Time)
+ *
+	@param x BIG number
+	@param y BIG number
+	@return Jacobi symbol, -1,0 or 1
+ */
+extern int BIG_jacobi(BIG x, BIG y);
+/**	@brief  Calculate x=1/y mod n (Variable Time)
+ *
+	Modular Inversion - This is slow. Uses binary method.
+	@param x BIG number, on exit = 1/y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_invmodp(BIG x, BIG y, BIG n);
+/** @brief Calculate x=x mod 2^m (Variable Time)
+ *
+	Truncation
+	@param x BIG number, on reduced mod 2^m
+	@param m new truncated size
+*/
+extern void BIG_mod2m(BIG x, int m);
+
+/**	@brief Calculates a*b+c+*d
+ *
+	Calculate partial product of a.b, add in carry c, and add total to d (Constant Time)
+	@param a multiplier
+	@param b multiplicand
+	@param c carry
+	@param d pointer to accumulated bottom half of result
+	@return top half of result
+ */
+
+
+extern int step1(BIG,BIG,BIG);
+extern void step2(BIG,BIG,BIG);
+
+#ifdef dchunk
+
+/* Method required to calculate x*y+c+r, bottom half in r, top half returned */
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    dchunk prod = (dchunk)x * y + c + *r;
+    *r = (chunk)prod & BMASK_B448_60;
+    return (chunk)(prod >> BASEBITS_B448_60);
+}
+
+#else
+
+/* No integer type available that can store double the wordlength */
+/* accumulate partial products */
+
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    chunk x0, x1, y0, y1;
+    chunk bot, top, mid, carry;
+    x0 = x & HMASK_B448_60;
+    x1 = (x >> HBITS_B448_60);
+    y0 = y & HMASK_B448_60;
+    y1 = (y >> HBITS_B448_60);
+    bot = x0 * y0;
+    top = x1 * y1;
+    mid = x0 * y1 + x1 * y0;
+    x0 = mid & HMASK_B448_60;
+    x1 = (mid >> HBITS_B448_60);
+    bot += x0 << HBITS_B448_60;
+    bot += *r;
+    bot += c;
+
+    top += x1;
+    carry = bot >> BASEBITS_B448_60;
+    bot &= BMASK_B448_60;
+    top += carry;
+
+    *r = bot;
+    return top;
+}
+
+#endif
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/big_B464_60.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/big_B464_60.h
new file mode 100644
index 0000000..cca82be
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/big_B464_60.h
@@ -0,0 +1,697 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file big.h
+ * @author Mike Scott
+ * @date 23rd February 2016
+ * @brief Big number Header File
+ *
+ *
+ */
+
+#ifndef BIG_B464_60_H
+#define BIG_B464_60_H
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <inttypes.h>
+#include "arch.h"
+#include "core.h"
+#include "config_big_B464_60.h"
+
+using namespace core;
+
+/* could comment this out if code size is a major issue */
+#define UNWOUND
+/* Normally recommended, but may not be optimal for some architectures, for example 32-bit ARM M4 */
+#define USE_KARATSUBA
+
+#define BIGBITS_B464_60 (8*MODBYTES_B464_60)
+#define NLEN_B464_60 (1+((8*MODBYTES_B464_60-1)/BASEBITS_B464_60))
+#define DNLEN_B464_60 2*NLEN_B464_60
+#define BMASK_B464_60 (((chunk)1<<BASEBITS_B464_60)-1) /**< Mask = 2^BASEBITS-1 */
+#define NEXCESS_B464_60 (1<<(CHUNK-BASEBITS_B464_60-1))           /**< 2^(CHUNK-BASEBITS-1) - digit cannot be multiplied by more than this before normalisation */
+
+#define HBITS_B464_60 (BASEBITS_B464_60/2)      /**< Number of bits in number base divided by 2 */
+#define HMASK_B464_60 (((chunk)1<<HBITS_B464_60)-1)    /**< Mask = 2^HBITS-1 */
+
+//#define DEBUG_NORM
+
+#ifdef DEBUG_NORM  /* Add an extra location to track chunk extension */
+#define MPV_B464_60 NLEN_B464_60
+#define MNV_B464_60 (NLEN_B464_60+1)
+#define DMPV_B464_60 DNLEN_B464_60
+#define DMNV_B464_60 (DNLEN_B464_60+1)
+
+#endif
+
+namespace B464_60 {
+
+//extern int BIGMULS;
+//extern int BIGSQRS;
+
+#ifdef DEBUG_NORM
+typedef chunk BIG[NLEN_B464_60 + 2]; /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B464_60 + 2]; /**< Define type DBIG as array of chunks */
+#else
+typedef chunk BIG[NLEN_B464_60];     /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B464_60];   /**< Define type DBIG as array of chunks */
+#endif
+
+/* BIG number prototypes */
+
+/**	@brief Tests for BIG equal to zero (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_iszilch(BIG x);
+/**	@brief Tests for BIG equal to one (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if one, else returns 0
+ */
+extern int BIG_isunity(BIG x);
+/**	@brief Tests for DBIG equal to zero (Constant Time)
+ *
+	@param x a DBIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_diszilch(DBIG x);
+/**	@brief Outputs a BIG number to the console (Variable Time)
+ *
+	@param x a BIG number
+ */
+extern void BIG_output(BIG x);
+/**	@brief Outputs a BIG number to the console in raw form (Variable Time for debugging)
+ *
+	@param x a BIG number
+ */
+extern void BIG_rawoutput(BIG x);
+/**	@brief Conditional constant time swap of two BIG numbers
+ *
+	Conditionally swaps parameters in constant time (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s swap takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cswap(BIG x, BIG y, int s);
+/**	@brief Conditional copy of BIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cmove(BIG x, BIG y, int s);
+/**	@brief Conditional copy of DBIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a DBIG number
+	@param y another DBIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_dcmove(BIG x, BIG y, int s);
+/**	@brief Convert from BIG number to byte array (Constant Time)
+ *
+	@param a byte array
+	@param x BIG number
+ */
+extern void BIG_toBytes(char *a, BIG x);
+/**	@brief Convert to BIG number from byte array (Constant Time)
+ *
+	@param x BIG number
+	@param a byte array
+ */
+extern void BIG_fromBytes(BIG x, char *a);
+/**	@brief Convert to BIG number from byte array of given length (Variable Time)
+ *
+	@param x BIG number
+	@param a byte array
+	@param s byte array length
+ */
+extern void BIG_fromBytesLen(BIG x, char *a, int s);
+/**@brief Convert to DBIG number from byte array of given length (Variable Time)
+ *
+   @param x DBIG number
+   @param a byte array
+   @param s byte array length
+ */
+extern void BIG_dfromBytesLen(DBIG x, char *a, int s);
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_doutput(DBIG x); 
+
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_drawoutput(DBIG x);
+
+/**	@brief Copy BIG from Read-Only Memory to a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number in ROM
+ */
+extern void BIG_rcopy(BIG x, const BIG y);
+/**	@brief Copy BIG to another BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_copy(BIG x, BIG y);
+/**	@brief Copy DBIG to another DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_dcopy(DBIG x, DBIG y);
+/**	@brief Copy BIG to upper half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dsucopy(DBIG x, BIG y);
+/**	@brief Copy BIG to lower half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dscopy(DBIG x, BIG y);
+/**	@brief Copy lower half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sdcopy(BIG x, DBIG y);
+/**	@brief Copy upper half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sducopy(BIG x, DBIG y);
+/**	@brief Set BIG to zero (Constant Time)
+ *
+	@param x BIG number to be set to zero  
+ */
+extern void BIG_zero(BIG x);
+/**	@brief Set DBIG to zero (Constant Time)
+ *
+	@param x DBIG number to be set to zero
+ */
+extern void BIG_dzero(DBIG x);
+/**	@brief Set BIG to one (unity) (Constant Time)
+ *
+	@param x BIG number to be set to one.
+ */
+extern void BIG_one(BIG x);
+/**	@brief Set BIG to inverse mod 2^256 (Constant Time)
+ *
+	@param x BIG number to be inverted
+ */
+extern void BIG_invmod2m(BIG x);
+/**	@brief Set BIG to sum of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, sum of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_add(BIG x, BIG y, BIG z);
+
+/**	@brief Set BIG to logical or of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, or of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_or(BIG x, BIG y, BIG z);
+
+/**	@brief Increment BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be incremented
+	@param i integer
+ */
+extern void BIG_inc(BIG x, int i);
+/**	@brief Set BIG to difference of two BIGs (Constant Time)
+ *
+	@param x BIG number, difference of other two - output not normalised
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_sub(BIG x, BIG y, BIG z);
+/**	@brief Decrement BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be decremented
+	@param i integer
+ */
+extern void BIG_dec(BIG x, int i);
+/**	@brief Set DBIG to sum of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, sum of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dadd(DBIG x, DBIG y, DBIG z);
+/**	@brief Set DBIG to difference of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, difference of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dsub(DBIG x, DBIG y, DBIG z);
+/**	@brief Multiply BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_imul(BIG x, BIG y, int i);
+/**	@brief Multiply BIG by not-so-small small integer - output normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+	@return Overflowing bits
+ */
+extern chunk BIG_pmul(BIG x, BIG y, int i);
+/**	@brief Divide BIG by 3 - output normalised (Constant Time)
+ *
+	@param x BIG number
+	@return Remainder
+ */
+extern int BIG_div3(BIG x);
+/**	@brief Multiply BIG by even bigger small integer resulting in a DBIG - output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_pxmul(DBIG x, BIG y, int i);
+/**	@brief Multiply BIG by another BIG resulting in DBIG - inputs normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_mul(DBIG x, BIG y, BIG z);
+/**	@brief Multiply BIG by another BIG resulting in another BIG - inputs normalised and output normalised (Constant Time)
+ *
+	Note that the product must fit into a BIG, and x must be distinct from y and z
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_smul(BIG x, BIG y, BIG z);
+/**	@brief Square BIG resulting in a DBIG - input normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, square of a BIG
+	@param y BIG number to be squared
+ */
+extern void BIG_sqr(DBIG x, BIG y);
+
+/**	@brief Montgomery reduction of a DBIG to a BIG  - input normalised and output normalised (Constant Time)
+ *
+	@param a BIG number, reduction of a BIG
+	@param md BIG number, the modulus
+	@param MC the Montgomery Constant
+	@param d DBIG number to be reduced
+ */
+extern void BIG_monty(BIG a, BIG md, chunk MC, DBIG d);
+
+/**	@brief Shifts a BIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shl(BIG x, int s);
+/**	@brief Fast shifts a BIG left by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Overflow bits
+ */
+extern int BIG_fshl(BIG x, int s);
+/**	@brief Shifts a DBIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshl(DBIG x, int s);
+/**	@brief Shifts a BIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shr(BIG x, int s);
+
+
+/**	@brief Fast time-critical combined shift by 1 bit, subtract and normalise (Constant Time)
+ *
+	@param r BIG number normalised output
+	@param a BIG number to be subtracted from
+	@param m BIG number to be shifted and subtracted
+	@return sign of r
+ */
+extern int BIG_ssn(BIG r, BIG a, BIG m);
+
+/**	@brief Fast shifts a BIG right by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Shifted out bits
+ */
+extern int BIG_fshr(BIG x, int s);
+/**	@brief Shifts a DBIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshr(DBIG x, int s);
+/**	@brief Splits a DBIG into two BIGs - input must be normalised, outputs normalised (Constant Time as used)
+ *
+	Internal function. The value of s must be approximately in the middle of the DBIG.
+	Typically used to extract z mod 2^MODBITS and z/2^MODBITS
+	@param x BIG number, top half of z
+	@param y BIG number, bottom half of z
+	@param z DBIG number to be split in two.
+	@param s Bit position at which to split
+	@return carry-out from top half
+ */
+extern chunk BIG_split(BIG x, BIG y, DBIG z, int s);
+/**	@brief Normalizes a BIG number - output normalised (Constant Time)
+ *
+	All digits of the input BIG are reduced mod 2^BASEBITS
+	@param x BIG number to be normalised
+ */
+extern chunk BIG_norm(BIG x);
+/**	@brief Normalizes a DBIG number - output normalised (Constant Time)
+ *
+	All digits of the input DBIG are reduced mod 2^BASEBITS
+	@param x DBIG number to be normalised
+ */
+extern void BIG_dnorm(DBIG x);
+/**	@brief Compares two BIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first BIG number to be compared
+	@param y second BIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_comp(BIG x, BIG y);
+/**	@brief Compares two DBIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first DBIG number to be compared
+	@param y second DBIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_dcomp(DBIG x, DBIG y);
+/**	@brief Calculate number of bits in a BIG - output normalised (Variable Time)
+ *
+	@param x BIG number
+	@return Number of bits in x
+ */
+extern int BIG_nbits(BIG x);
+/**	@brief Calculate number of bits in a DBIG - output normalised (Variable Time)
+ *
+	@param x DBIG number
+	@return Number of bits in x
+ */
+extern int BIG_dnbits(DBIG x);
+
+/**	@brief Reduce x mod n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctmod(BIG x, BIG n, int bd);
+
+/**	@brief  x=y mod n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctdmod(BIG x, DBIG y, BIG n, int bd);
+
+/**	@brief Divide x by n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctsdiv(BIG x,BIG n,int bd);
+
+/**	@brief  x=y/n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctddiv(BIG x, DBIG y, BIG n,int bd);
+
+
+/**	@brief Reduce x mod n - input and output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+ */
+extern void BIG_mod(BIG x, BIG n);
+/**	@brief Divide x by n - output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+ */
+extern void BIG_sdiv(BIG x, BIG n);
+/**	@brief  x=y mod n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_dmod(BIG x, DBIG y, BIG n);
+/**	@brief  x=y/n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_ddiv(BIG x, DBIG y, BIG n);
+/**	@brief  return parity of BIG, that is the least significant bit (Constant Time)
+ *
+	@param x BIG number
+	@return 0 or 1
+ */
+extern int BIG_parity(BIG x);
+/**	@brief  return i-th of BIG (Constant Time)
+ *
+	@param x BIG number
+	@param i the bit of x to be returned
+	@return 0 or 1
+ */
+extern int BIG_bit(BIG x, int i);
+/**	@brief  return least significant bits of a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param n number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int BIG_lastbits(BIG x, int n);
+/**	@brief  Create a random BIG from a random number generator (Constant Time)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_random(BIG x, csprng *r);
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randomnum(BIG x, BIG n, csprng *r);
+
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus and truncated to max bit length (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param t Maximum bit length
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randtrunc(BIG x, BIG n, int t, csprng *r);
+
+/**	brief  return NAF (Non-Adjacent-Form) value as +/- 1, 3 or 5, inputs must be normalised
+ *
+	Given x and 3*x extracts NAF value from given bit position, and returns number of bits processed, and number of trailing zeros detected if any
+	param x BIG number
+	param x3 BIG number, three times x
+	param i bit position
+	param nbs pointer to integer returning number of bits processed
+	param nzs pointer to integer returning number of trailing 0s
+	return + or - 1, 3 or 5
+*/
+
+/**	@brief  Calculate x=y*z mod n (Variable Time)
+ *
+	Slow method for modular multiplication
+	@param x BIG number, on exit = y*z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modmul(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y/z mod n (Variable Time)
+ *
+	Slow method for modular division
+	@param x BIG number, on exit = y/z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_moddiv(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y^2 mod n (Variable Time)
+ *
+	Slow method for modular squaring
+	@param x BIG number, on exit = y^2 mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modsqr(BIG x, BIG y, BIG n);
+/**	@brief  Calculate x=-y mod n (Variable Time)
+ *
+	Modular negation
+	@param x BIG number, on exit = -y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modneg(BIG x, BIG y, BIG n);
+
+/**	@brief  Calculate x=y+z mod n (Variable Time)
+ *
+	Slow method for modular addition
+	@param x BIG number, on exit = y+z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modadd(BIG x, BIG y, BIG z, BIG n);
+
+/**	@brief  Calculate jacobi Symbol (x/y) (Variable Time)
+ *
+	@param x BIG number
+	@param y BIG number
+	@return Jacobi symbol, -1,0 or 1
+ */
+extern int BIG_jacobi(BIG x, BIG y);
+/**	@brief  Calculate x=1/y mod n (Variable Time)
+ *
+	Modular Inversion - This is slow. Uses binary method.
+	@param x BIG number, on exit = 1/y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_invmodp(BIG x, BIG y, BIG n);
+/** @brief Calculate x=x mod 2^m (Variable Time)
+ *
+	Truncation
+	@param x BIG number, on reduced mod 2^m
+	@param m new truncated size
+*/
+extern void BIG_mod2m(BIG x, int m);
+
+/**	@brief Calculates a*b+c+*d
+ *
+	Calculate partial product of a.b, add in carry c, and add total to d (Constant Time)
+	@param a multiplier
+	@param b multiplicand
+	@param c carry
+	@param d pointer to accumulated bottom half of result
+	@return top half of result
+ */
+
+
+extern int step1(BIG,BIG,BIG);
+extern void step2(BIG,BIG,BIG);
+
+#ifdef dchunk
+
+/* Method required to calculate x*y+c+r, bottom half in r, top half returned */
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    dchunk prod = (dchunk)x * y + c + *r;
+    *r = (chunk)prod & BMASK_B464_60;
+    return (chunk)(prod >> BASEBITS_B464_60);
+}
+
+#else
+
+/* No integer type available that can store double the wordlength */
+/* accumulate partial products */
+
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    chunk x0, x1, y0, y1;
+    chunk bot, top, mid, carry;
+    x0 = x & HMASK_B464_60;
+    x1 = (x >> HBITS_B464_60);
+    y0 = y & HMASK_B464_60;
+    y1 = (y >> HBITS_B464_60);
+    bot = x0 * y0;
+    top = x1 * y1;
+    mid = x0 * y1 + x1 * y0;
+    x0 = mid & HMASK_B464_60;
+    x1 = (mid >> HBITS_B464_60);
+    bot += x0 << HBITS_B464_60;
+    bot += *r;
+    bot += c;
+
+    top += x1;
+    carry = bot >> BASEBITS_B464_60;
+    bot &= BMASK_B464_60;
+    top += carry;
+
+    *r = bot;
+    return top;
+}
+
+#endif
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/big_B480_56.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/big_B480_56.h
new file mode 100644
index 0000000..10bb1b3
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/big_B480_56.h
@@ -0,0 +1,697 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file big.h
+ * @author Mike Scott
+ * @date 23rd February 2016
+ * @brief Big number Header File
+ *
+ *
+ */
+
+#ifndef BIG_B480_56_H
+#define BIG_B480_56_H
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <inttypes.h>
+#include "arch.h"
+#include "core.h"
+#include "config_big_B480_56.h"
+
+using namespace core;
+
+/* could comment this out if code size is a major issue */
+#define UNWOUND
+/* Normally recommended, but may not be optimal for some architectures, for example 32-bit ARM M4 */
+#define USE_KARATSUBA
+
+#define BIGBITS_B480_56 (8*MODBYTES_B480_56)
+#define NLEN_B480_56 (1+((8*MODBYTES_B480_56-1)/BASEBITS_B480_56))
+#define DNLEN_B480_56 2*NLEN_B480_56
+#define BMASK_B480_56 (((chunk)1<<BASEBITS_B480_56)-1) /**< Mask = 2^BASEBITS-1 */
+#define NEXCESS_B480_56 (1<<(CHUNK-BASEBITS_B480_56-1))           /**< 2^(CHUNK-BASEBITS-1) - digit cannot be multiplied by more than this before normalisation */
+
+#define HBITS_B480_56 (BASEBITS_B480_56/2)      /**< Number of bits in number base divided by 2 */
+#define HMASK_B480_56 (((chunk)1<<HBITS_B480_56)-1)    /**< Mask = 2^HBITS-1 */
+
+//#define DEBUG_NORM
+
+#ifdef DEBUG_NORM  /* Add an extra location to track chunk extension */
+#define MPV_B480_56 NLEN_B480_56
+#define MNV_B480_56 (NLEN_B480_56+1)
+#define DMPV_B480_56 DNLEN_B480_56
+#define DMNV_B480_56 (DNLEN_B480_56+1)
+
+#endif
+
+namespace B480_56 {
+
+//extern int BIGMULS;
+//extern int BIGSQRS;
+
+#ifdef DEBUG_NORM
+typedef chunk BIG[NLEN_B480_56 + 2]; /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B480_56 + 2]; /**< Define type DBIG as array of chunks */
+#else
+typedef chunk BIG[NLEN_B480_56];     /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B480_56];   /**< Define type DBIG as array of chunks */
+#endif
+
+/* BIG number prototypes */
+
+/**	@brief Tests for BIG equal to zero (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_iszilch(BIG x);
+/**	@brief Tests for BIG equal to one (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if one, else returns 0
+ */
+extern int BIG_isunity(BIG x);
+/**	@brief Tests for DBIG equal to zero (Constant Time)
+ *
+	@param x a DBIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_diszilch(DBIG x);
+/**	@brief Outputs a BIG number to the console (Variable Time)
+ *
+	@param x a BIG number
+ */
+extern void BIG_output(BIG x);
+/**	@brief Outputs a BIG number to the console in raw form (Variable Time for debugging)
+ *
+	@param x a BIG number
+ */
+extern void BIG_rawoutput(BIG x);
+/**	@brief Conditional constant time swap of two BIG numbers
+ *
+	Conditionally swaps parameters in constant time (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s swap takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cswap(BIG x, BIG y, int s);
+/**	@brief Conditional copy of BIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cmove(BIG x, BIG y, int s);
+/**	@brief Conditional copy of DBIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a DBIG number
+	@param y another DBIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_dcmove(BIG x, BIG y, int s);
+/**	@brief Convert from BIG number to byte array (Constant Time)
+ *
+	@param a byte array
+	@param x BIG number
+ */
+extern void BIG_toBytes(char *a, BIG x);
+/**	@brief Convert to BIG number from byte array (Constant Time)
+ *
+	@param x BIG number
+	@param a byte array
+ */
+extern void BIG_fromBytes(BIG x, char *a);
+/**	@brief Convert to BIG number from byte array of given length (Variable Time)
+ *
+	@param x BIG number
+	@param a byte array
+	@param s byte array length
+ */
+extern void BIG_fromBytesLen(BIG x, char *a, int s);
+/**@brief Convert to DBIG number from byte array of given length (Variable Time)
+ *
+   @param x DBIG number
+   @param a byte array
+   @param s byte array length
+ */
+extern void BIG_dfromBytesLen(DBIG x, char *a, int s);
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_doutput(DBIG x); 
+
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_drawoutput(DBIG x);
+
+/**	@brief Copy BIG from Read-Only Memory to a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number in ROM
+ */
+extern void BIG_rcopy(BIG x, const BIG y);
+/**	@brief Copy BIG to another BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_copy(BIG x, BIG y);
+/**	@brief Copy DBIG to another DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_dcopy(DBIG x, DBIG y);
+/**	@brief Copy BIG to upper half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dsucopy(DBIG x, BIG y);
+/**	@brief Copy BIG to lower half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dscopy(DBIG x, BIG y);
+/**	@brief Copy lower half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sdcopy(BIG x, DBIG y);
+/**	@brief Copy upper half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sducopy(BIG x, DBIG y);
+/**	@brief Set BIG to zero (Constant Time)
+ *
+	@param x BIG number to be set to zero  
+ */
+extern void BIG_zero(BIG x);
+/**	@brief Set DBIG to zero (Constant Time)
+ *
+	@param x DBIG number to be set to zero
+ */
+extern void BIG_dzero(DBIG x);
+/**	@brief Set BIG to one (unity) (Constant Time)
+ *
+	@param x BIG number to be set to one.
+ */
+extern void BIG_one(BIG x);
+/**	@brief Set BIG to inverse mod 2^256 (Constant Time)
+ *
+	@param x BIG number to be inverted
+ */
+extern void BIG_invmod2m(BIG x);
+/**	@brief Set BIG to sum of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, sum of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_add(BIG x, BIG y, BIG z);
+
+/**	@brief Set BIG to logical or of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, or of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_or(BIG x, BIG y, BIG z);
+
+/**	@brief Increment BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be incremented
+	@param i integer
+ */
+extern void BIG_inc(BIG x, int i);
+/**	@brief Set BIG to difference of two BIGs (Constant Time)
+ *
+	@param x BIG number, difference of other two - output not normalised
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_sub(BIG x, BIG y, BIG z);
+/**	@brief Decrement BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be decremented
+	@param i integer
+ */
+extern void BIG_dec(BIG x, int i);
+/**	@brief Set DBIG to sum of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, sum of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dadd(DBIG x, DBIG y, DBIG z);
+/**	@brief Set DBIG to difference of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, difference of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dsub(DBIG x, DBIG y, DBIG z);
+/**	@brief Multiply BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_imul(BIG x, BIG y, int i);
+/**	@brief Multiply BIG by not-so-small small integer - output normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+	@return Overflowing bits
+ */
+extern chunk BIG_pmul(BIG x, BIG y, int i);
+/**	@brief Divide BIG by 3 - output normalised (Constant Time)
+ *
+	@param x BIG number
+	@return Remainder
+ */
+extern int BIG_div3(BIG x);
+/**	@brief Multiply BIG by even bigger small integer resulting in a DBIG - output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_pxmul(DBIG x, BIG y, int i);
+/**	@brief Multiply BIG by another BIG resulting in DBIG - inputs normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_mul(DBIG x, BIG y, BIG z);
+/**	@brief Multiply BIG by another BIG resulting in another BIG - inputs normalised and output normalised (Constant Time)
+ *
+	Note that the product must fit into a BIG, and x must be distinct from y and z
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_smul(BIG x, BIG y, BIG z);
+/**	@brief Square BIG resulting in a DBIG - input normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, square of a BIG
+	@param y BIG number to be squared
+ */
+extern void BIG_sqr(DBIG x, BIG y);
+
+/**	@brief Montgomery reduction of a DBIG to a BIG  - input normalised and output normalised (Constant Time)
+ *
+	@param a BIG number, reduction of a BIG
+	@param md BIG number, the modulus
+	@param MC the Montgomery Constant
+	@param d DBIG number to be reduced
+ */
+extern void BIG_monty(BIG a, BIG md, chunk MC, DBIG d);
+
+/**	@brief Shifts a BIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shl(BIG x, int s);
+/**	@brief Fast shifts a BIG left by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Overflow bits
+ */
+extern int BIG_fshl(BIG x, int s);
+/**	@brief Shifts a DBIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshl(DBIG x, int s);
+/**	@brief Shifts a BIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shr(BIG x, int s);
+
+
+/**	@brief Fast time-critical combined shift by 1 bit, subtract and normalise (Constant Time)
+ *
+	@param r BIG number normalised output
+	@param a BIG number to be subtracted from
+	@param m BIG number to be shifted and subtracted
+	@return sign of r
+ */
+extern int BIG_ssn(BIG r, BIG a, BIG m);
+
+/**	@brief Fast shifts a BIG right by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Shifted out bits
+ */
+extern int BIG_fshr(BIG x, int s);
+/**	@brief Shifts a DBIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshr(DBIG x, int s);
+/**	@brief Splits a DBIG into two BIGs - input must be normalised, outputs normalised (Constant Time as used)
+ *
+	Internal function. The value of s must be approximately in the middle of the DBIG.
+	Typically used to extract z mod 2^MODBITS and z/2^MODBITS
+	@param x BIG number, top half of z
+	@param y BIG number, bottom half of z
+	@param z DBIG number to be split in two.
+	@param s Bit position at which to split
+	@return carry-out from top half
+ */
+extern chunk BIG_split(BIG x, BIG y, DBIG z, int s);
+/**	@brief Normalizes a BIG number - output normalised (Constant Time)
+ *
+	All digits of the input BIG are reduced mod 2^BASEBITS
+	@param x BIG number to be normalised
+ */
+extern chunk BIG_norm(BIG x);
+/**	@brief Normalizes a DBIG number - output normalised (Constant Time)
+ *
+	All digits of the input DBIG are reduced mod 2^BASEBITS
+	@param x DBIG number to be normalised
+ */
+extern void BIG_dnorm(DBIG x);
+/**	@brief Compares two BIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first BIG number to be compared
+	@param y second BIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_comp(BIG x, BIG y);
+/**	@brief Compares two DBIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first DBIG number to be compared
+	@param y second DBIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_dcomp(DBIG x, DBIG y);
+/**	@brief Calculate number of bits in a BIG - output normalised (Variable Time)
+ *
+	@param x BIG number
+	@return Number of bits in x
+ */
+extern int BIG_nbits(BIG x);
+/**	@brief Calculate number of bits in a DBIG - output normalised (Variable Time)
+ *
+	@param x DBIG number
+	@return Number of bits in x
+ */
+extern int BIG_dnbits(DBIG x);
+
+/**	@brief Reduce x mod n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctmod(BIG x, BIG n, int bd);
+
+/**	@brief  x=y mod n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctdmod(BIG x, DBIG y, BIG n, int bd);
+
+/**	@brief Divide x by n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctsdiv(BIG x,BIG n,int bd);
+
+/**	@brief  x=y/n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctddiv(BIG x, DBIG y, BIG n,int bd);
+
+
+/**	@brief Reduce x mod n - input and output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+ */
+extern void BIG_mod(BIG x, BIG n);
+/**	@brief Divide x by n - output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+ */
+extern void BIG_sdiv(BIG x, BIG n);
+/**	@brief  x=y mod n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_dmod(BIG x, DBIG y, BIG n);
+/**	@brief  x=y/n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_ddiv(BIG x, DBIG y, BIG n);
+/**	@brief  return parity of BIG, that is the least significant bit (Constant Time)
+ *
+	@param x BIG number
+	@return 0 or 1
+ */
+extern int BIG_parity(BIG x);
+/**	@brief  return i-th of BIG (Constant Time)
+ *
+	@param x BIG number
+	@param i the bit of x to be returned
+	@return 0 or 1
+ */
+extern int BIG_bit(BIG x, int i);
+/**	@brief  return least significant bits of a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param n number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int BIG_lastbits(BIG x, int n);
+/**	@brief  Create a random BIG from a random number generator (Constant Time)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_random(BIG x, csprng *r);
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randomnum(BIG x, BIG n, csprng *r);
+
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus and truncated to max bit length (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param t Maximum bit length
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randtrunc(BIG x, BIG n, int t, csprng *r);
+
+/**	brief  return NAF (Non-Adjacent-Form) value as +/- 1, 3 or 5, inputs must be normalised
+ *
+	Given x and 3*x extracts NAF value from given bit position, and returns number of bits processed, and number of trailing zeros detected if any
+	param x BIG number
+	param x3 BIG number, three times x
+	param i bit position
+	param nbs pointer to integer returning number of bits processed
+	param nzs pointer to integer returning number of trailing 0s
+	return + or - 1, 3 or 5
+*/
+
+/**	@brief  Calculate x=y*z mod n (Variable Time)
+ *
+	Slow method for modular multiplication
+	@param x BIG number, on exit = y*z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modmul(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y/z mod n (Variable Time)
+ *
+	Slow method for modular division
+	@param x BIG number, on exit = y/z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_moddiv(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y^2 mod n (Variable Time)
+ *
+	Slow method for modular squaring
+	@param x BIG number, on exit = y^2 mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modsqr(BIG x, BIG y, BIG n);
+/**	@brief  Calculate x=-y mod n (Variable Time)
+ *
+	Modular negation
+	@param x BIG number, on exit = -y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modneg(BIG x, BIG y, BIG n);
+
+/**	@brief  Calculate x=y+z mod n (Variable Time)
+ *
+	Slow method for modular addition
+	@param x BIG number, on exit = y+z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modadd(BIG x, BIG y, BIG z, BIG n);
+
+/**	@brief  Calculate jacobi Symbol (x/y) (Variable Time)
+ *
+	@param x BIG number
+	@param y BIG number
+	@return Jacobi symbol, -1,0 or 1
+ */
+extern int BIG_jacobi(BIG x, BIG y);
+/**	@brief  Calculate x=1/y mod n (Variable Time)
+ *
+	Modular Inversion - This is slow. Uses binary method.
+	@param x BIG number, on exit = 1/y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_invmodp(BIG x, BIG y, BIG n);
+/** @brief Calculate x=x mod 2^m (Variable Time)
+ *
+	Truncation
+	@param x BIG number, on reduced mod 2^m
+	@param m new truncated size
+*/
+extern void BIG_mod2m(BIG x, int m);
+
+/**	@brief Calculates a*b+c+*d
+ *
+	Calculate partial product of a.b, add in carry c, and add total to d (Constant Time)
+	@param a multiplier
+	@param b multiplicand
+	@param c carry
+	@param d pointer to accumulated bottom half of result
+	@return top half of result
+ */
+
+
+extern int step1(BIG,BIG,BIG);
+extern void step2(BIG,BIG,BIG);
+
+#ifdef dchunk
+
+/* Method required to calculate x*y+c+r, bottom half in r, top half returned */
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    dchunk prod = (dchunk)x * y + c + *r;
+    *r = (chunk)prod & BMASK_B480_56;
+    return (chunk)(prod >> BASEBITS_B480_56);
+}
+
+#else
+
+/* No integer type available that can store double the wordlength */
+/* accumulate partial products */
+
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    chunk x0, x1, y0, y1;
+    chunk bot, top, mid, carry;
+    x0 = x & HMASK_B480_56;
+    x1 = (x >> HBITS_B480_56);
+    y0 = y & HMASK_B480_56;
+    y1 = (y >> HBITS_B480_56);
+    bot = x0 * y0;
+    top = x1 * y1;
+    mid = x0 * y1 + x1 * y0;
+    x0 = mid & HMASK_B480_56;
+    x1 = (mid >> HBITS_B480_56);
+    bot += x0 << HBITS_B480_56;
+    bot += *r;
+    bot += c;
+
+    top += x1;
+    carry = bot >> BASEBITS_B480_56;
+    bot &= BMASK_B480_56;
+    top += carry;
+
+    *r = bot;
+    return top;
+}
+
+#endif
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/big_B512_60.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/big_B512_60.h
new file mode 100644
index 0000000..8cbbac2
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/big_B512_60.h
@@ -0,0 +1,697 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file big.h
+ * @author Mike Scott
+ * @date 23rd February 2016
+ * @brief Big number Header File
+ *
+ *
+ */
+
+#ifndef BIG_B512_60_H
+#define BIG_B512_60_H
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <inttypes.h>
+#include "arch.h"
+#include "core.h"
+#include "config_big_B512_60.h"
+
+using namespace core;
+
+/* could comment this out if code size is a major issue */
+#define UNWOUND
+/* Normally recommended, but may not be optimal for some architectures, for example 32-bit ARM M4 */
+#define USE_KARATSUBA
+
+#define BIGBITS_B512_60 (8*MODBYTES_B512_60)
+#define NLEN_B512_60 (1+((8*MODBYTES_B512_60-1)/BASEBITS_B512_60))
+#define DNLEN_B512_60 2*NLEN_B512_60
+#define BMASK_B512_60 (((chunk)1<<BASEBITS_B512_60)-1) /**< Mask = 2^BASEBITS-1 */
+#define NEXCESS_B512_60 (1<<(CHUNK-BASEBITS_B512_60-1))           /**< 2^(CHUNK-BASEBITS-1) - digit cannot be multiplied by more than this before normalisation */
+
+#define HBITS_B512_60 (BASEBITS_B512_60/2)      /**< Number of bits in number base divided by 2 */
+#define HMASK_B512_60 (((chunk)1<<HBITS_B512_60)-1)    /**< Mask = 2^HBITS-1 */
+
+//#define DEBUG_NORM
+
+#ifdef DEBUG_NORM  /* Add an extra location to track chunk extension */
+#define MPV_B512_60 NLEN_B512_60
+#define MNV_B512_60 (NLEN_B512_60+1)
+#define DMPV_B512_60 DNLEN_B512_60
+#define DMNV_B512_60 (DNLEN_B512_60+1)
+
+#endif
+
+namespace B512_60 {
+
+//extern int BIGMULS;
+//extern int BIGSQRS;
+
+#ifdef DEBUG_NORM
+typedef chunk BIG[NLEN_B512_60 + 2]; /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B512_60 + 2]; /**< Define type DBIG as array of chunks */
+#else
+typedef chunk BIG[NLEN_B512_60];     /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B512_60];   /**< Define type DBIG as array of chunks */
+#endif
+
+/* BIG number prototypes */
+
+/**	@brief Tests for BIG equal to zero (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_iszilch(BIG x);
+/**	@brief Tests for BIG equal to one (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if one, else returns 0
+ */
+extern int BIG_isunity(BIG x);
+/**	@brief Tests for DBIG equal to zero (Constant Time)
+ *
+	@param x a DBIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_diszilch(DBIG x);
+/**	@brief Outputs a BIG number to the console (Variable Time)
+ *
+	@param x a BIG number
+ */
+extern void BIG_output(BIG x);
+/**	@brief Outputs a BIG number to the console in raw form (Variable Time for debugging)
+ *
+	@param x a BIG number
+ */
+extern void BIG_rawoutput(BIG x);
+/**	@brief Conditional constant time swap of two BIG numbers
+ *
+	Conditionally swaps parameters in constant time (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s swap takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cswap(BIG x, BIG y, int s);
+/**	@brief Conditional copy of BIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cmove(BIG x, BIG y, int s);
+/**	@brief Conditional copy of DBIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a DBIG number
+	@param y another DBIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_dcmove(BIG x, BIG y, int s);
+/**	@brief Convert from BIG number to byte array (Constant Time)
+ *
+	@param a byte array
+	@param x BIG number
+ */
+extern void BIG_toBytes(char *a, BIG x);
+/**	@brief Convert to BIG number from byte array (Constant Time)
+ *
+	@param x BIG number
+	@param a byte array
+ */
+extern void BIG_fromBytes(BIG x, char *a);
+/**	@brief Convert to BIG number from byte array of given length (Variable Time)
+ *
+	@param x BIG number
+	@param a byte array
+	@param s byte array length
+ */
+extern void BIG_fromBytesLen(BIG x, char *a, int s);
+/**@brief Convert to DBIG number from byte array of given length (Variable Time)
+ *
+   @param x DBIG number
+   @param a byte array
+   @param s byte array length
+ */
+extern void BIG_dfromBytesLen(DBIG x, char *a, int s);
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_doutput(DBIG x); 
+
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_drawoutput(DBIG x);
+
+/**	@brief Copy BIG from Read-Only Memory to a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number in ROM
+ */
+extern void BIG_rcopy(BIG x, const BIG y);
+/**	@brief Copy BIG to another BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_copy(BIG x, BIG y);
+/**	@brief Copy DBIG to another DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_dcopy(DBIG x, DBIG y);
+/**	@brief Copy BIG to upper half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dsucopy(DBIG x, BIG y);
+/**	@brief Copy BIG to lower half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dscopy(DBIG x, BIG y);
+/**	@brief Copy lower half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sdcopy(BIG x, DBIG y);
+/**	@brief Copy upper half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sducopy(BIG x, DBIG y);
+/**	@brief Set BIG to zero (Constant Time)
+ *
+	@param x BIG number to be set to zero  
+ */
+extern void BIG_zero(BIG x);
+/**	@brief Set DBIG to zero (Constant Time)
+ *
+	@param x DBIG number to be set to zero
+ */
+extern void BIG_dzero(DBIG x);
+/**	@brief Set BIG to one (unity) (Constant Time)
+ *
+	@param x BIG number to be set to one.
+ */
+extern void BIG_one(BIG x);
+/**	@brief Set BIG to inverse mod 2^256 (Constant Time)
+ *
+	@param x BIG number to be inverted
+ */
+extern void BIG_invmod2m(BIG x);
+/**	@brief Set BIG to sum of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, sum of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_add(BIG x, BIG y, BIG z);
+
+/**	@brief Set BIG to logical or of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, or of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_or(BIG x, BIG y, BIG z);
+
+/**	@brief Increment BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be incremented
+	@param i integer
+ */
+extern void BIG_inc(BIG x, int i);
+/**	@brief Set BIG to difference of two BIGs (Constant Time)
+ *
+	@param x BIG number, difference of other two - output not normalised
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_sub(BIG x, BIG y, BIG z);
+/**	@brief Decrement BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be decremented
+	@param i integer
+ */
+extern void BIG_dec(BIG x, int i);
+/**	@brief Set DBIG to sum of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, sum of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dadd(DBIG x, DBIG y, DBIG z);
+/**	@brief Set DBIG to difference of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, difference of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dsub(DBIG x, DBIG y, DBIG z);
+/**	@brief Multiply BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_imul(BIG x, BIG y, int i);
+/**	@brief Multiply BIG by not-so-small small integer - output normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+	@return Overflowing bits
+ */
+extern chunk BIG_pmul(BIG x, BIG y, int i);
+/**	@brief Divide BIG by 3 - output normalised (Constant Time)
+ *
+	@param x BIG number
+	@return Remainder
+ */
+extern int BIG_div3(BIG x);
+/**	@brief Multiply BIG by even bigger small integer resulting in a DBIG - output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_pxmul(DBIG x, BIG y, int i);
+/**	@brief Multiply BIG by another BIG resulting in DBIG - inputs normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_mul(DBIG x, BIG y, BIG z);
+/**	@brief Multiply BIG by another BIG resulting in another BIG - inputs normalised and output normalised (Constant Time)
+ *
+	Note that the product must fit into a BIG, and x must be distinct from y and z
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_smul(BIG x, BIG y, BIG z);
+/**	@brief Square BIG resulting in a DBIG - input normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, square of a BIG
+	@param y BIG number to be squared
+ */
+extern void BIG_sqr(DBIG x, BIG y);
+
+/**	@brief Montgomery reduction of a DBIG to a BIG  - input normalised and output normalised (Constant Time)
+ *
+	@param a BIG number, reduction of a BIG
+	@param md BIG number, the modulus
+	@param MC the Montgomery Constant
+	@param d DBIG number to be reduced
+ */
+extern void BIG_monty(BIG a, BIG md, chunk MC, DBIG d);
+
+/**	@brief Shifts a BIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shl(BIG x, int s);
+/**	@brief Fast shifts a BIG left by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Overflow bits
+ */
+extern int BIG_fshl(BIG x, int s);
+/**	@brief Shifts a DBIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshl(DBIG x, int s);
+/**	@brief Shifts a BIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shr(BIG x, int s);
+
+
+/**	@brief Fast time-critical combined shift by 1 bit, subtract and normalise (Constant Time)
+ *
+	@param r BIG number normalised output
+	@param a BIG number to be subtracted from
+	@param m BIG number to be shifted and subtracted
+	@return sign of r
+ */
+extern int BIG_ssn(BIG r, BIG a, BIG m);
+
+/**	@brief Fast shifts a BIG right by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Shifted out bits
+ */
+extern int BIG_fshr(BIG x, int s);
+/**	@brief Shifts a DBIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshr(DBIG x, int s);
+/**	@brief Splits a DBIG into two BIGs - input must be normalised, outputs normalised (Constant Time as used)
+ *
+	Internal function. The value of s must be approximately in the middle of the DBIG.
+	Typically used to extract z mod 2^MODBITS and z/2^MODBITS
+	@param x BIG number, top half of z
+	@param y BIG number, bottom half of z
+	@param z DBIG number to be split in two.
+	@param s Bit position at which to split
+	@return carry-out from top half
+ */
+extern chunk BIG_split(BIG x, BIG y, DBIG z, int s);
+/**	@brief Normalizes a BIG number - output normalised (Constant Time)
+ *
+	All digits of the input BIG are reduced mod 2^BASEBITS
+	@param x BIG number to be normalised
+ */
+extern chunk BIG_norm(BIG x);
+/**	@brief Normalizes a DBIG number - output normalised (Constant Time)
+ *
+	All digits of the input DBIG are reduced mod 2^BASEBITS
+	@param x DBIG number to be normalised
+ */
+extern void BIG_dnorm(DBIG x);
+/**	@brief Compares two BIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first BIG number to be compared
+	@param y second BIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_comp(BIG x, BIG y);
+/**	@brief Compares two DBIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first DBIG number to be compared
+	@param y second DBIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_dcomp(DBIG x, DBIG y);
+/**	@brief Calculate number of bits in a BIG - output normalised (Variable Time)
+ *
+	@param x BIG number
+	@return Number of bits in x
+ */
+extern int BIG_nbits(BIG x);
+/**	@brief Calculate number of bits in a DBIG - output normalised (Variable Time)
+ *
+	@param x DBIG number
+	@return Number of bits in x
+ */
+extern int BIG_dnbits(DBIG x);
+
+/**	@brief Reduce x mod n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctmod(BIG x, BIG n, int bd);
+
+/**	@brief  x=y mod n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctdmod(BIG x, DBIG y, BIG n, int bd);
+
+/**	@brief Divide x by n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctsdiv(BIG x,BIG n,int bd);
+
+/**	@brief  x=y/n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctddiv(BIG x, DBIG y, BIG n,int bd);
+
+
+/**	@brief Reduce x mod n - input and output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+ */
+extern void BIG_mod(BIG x, BIG n);
+/**	@brief Divide x by n - output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+ */
+extern void BIG_sdiv(BIG x, BIG n);
+/**	@brief  x=y mod n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_dmod(BIG x, DBIG y, BIG n);
+/**	@brief  x=y/n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_ddiv(BIG x, DBIG y, BIG n);
+/**	@brief  return parity of BIG, that is the least significant bit (Constant Time)
+ *
+	@param x BIG number
+	@return 0 or 1
+ */
+extern int BIG_parity(BIG x);
+/**	@brief  return i-th of BIG (Constant Time)
+ *
+	@param x BIG number
+	@param i the bit of x to be returned
+	@return 0 or 1
+ */
+extern int BIG_bit(BIG x, int i);
+/**	@brief  return least significant bits of a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param n number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int BIG_lastbits(BIG x, int n);
+/**	@brief  Create a random BIG from a random number generator (Constant Time)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_random(BIG x, csprng *r);
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randomnum(BIG x, BIG n, csprng *r);
+
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus and truncated to max bit length (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param t Maximum bit length
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randtrunc(BIG x, BIG n, int t, csprng *r);
+
+/**	brief  return NAF (Non-Adjacent-Form) value as +/- 1, 3 or 5, inputs must be normalised
+ *
+	Given x and 3*x extracts NAF value from given bit position, and returns number of bits processed, and number of trailing zeros detected if any
+	param x BIG number
+	param x3 BIG number, three times x
+	param i bit position
+	param nbs pointer to integer returning number of bits processed
+	param nzs pointer to integer returning number of trailing 0s
+	return + or - 1, 3 or 5
+*/
+
+/**	@brief  Calculate x=y*z mod n (Variable Time)
+ *
+	Slow method for modular multiplication
+	@param x BIG number, on exit = y*z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modmul(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y/z mod n (Variable Time)
+ *
+	Slow method for modular division
+	@param x BIG number, on exit = y/z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_moddiv(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y^2 mod n (Variable Time)
+ *
+	Slow method for modular squaring
+	@param x BIG number, on exit = y^2 mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modsqr(BIG x, BIG y, BIG n);
+/**	@brief  Calculate x=-y mod n (Variable Time)
+ *
+	Modular negation
+	@param x BIG number, on exit = -y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modneg(BIG x, BIG y, BIG n);
+
+/**	@brief  Calculate x=y+z mod n (Variable Time)
+ *
+	Slow method for modular addition
+	@param x BIG number, on exit = y+z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modadd(BIG x, BIG y, BIG z, BIG n);
+
+/**	@brief  Calculate jacobi Symbol (x/y) (Variable Time)
+ *
+	@param x BIG number
+	@param y BIG number
+	@return Jacobi symbol, -1,0 or 1
+ */
+extern int BIG_jacobi(BIG x, BIG y);
+/**	@brief  Calculate x=1/y mod n (Variable Time)
+ *
+	Modular Inversion - This is slow. Uses binary method.
+	@param x BIG number, on exit = 1/y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_invmodp(BIG x, BIG y, BIG n);
+/** @brief Calculate x=x mod 2^m (Variable Time)
+ *
+	Truncation
+	@param x BIG number, on reduced mod 2^m
+	@param m new truncated size
+*/
+extern void BIG_mod2m(BIG x, int m);
+
+/**	@brief Calculates a*b+c+*d
+ *
+	Calculate partial product of a.b, add in carry c, and add total to d (Constant Time)
+	@param a multiplier
+	@param b multiplicand
+	@param c carry
+	@param d pointer to accumulated bottom half of result
+	@return top half of result
+ */
+
+
+extern int step1(BIG,BIG,BIG);
+extern void step2(BIG,BIG,BIG);
+
+#ifdef dchunk
+
+/* Method required to calculate x*y+c+r, bottom half in r, top half returned */
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    dchunk prod = (dchunk)x * y + c + *r;
+    *r = (chunk)prod & BMASK_B512_60;
+    return (chunk)(prod >> BASEBITS_B512_60);
+}
+
+#else
+
+/* No integer type available that can store double the wordlength */
+/* accumulate partial products */
+
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    chunk x0, x1, y0, y1;
+    chunk bot, top, mid, carry;
+    x0 = x & HMASK_B512_60;
+    x1 = (x >> HBITS_B512_60);
+    y0 = y & HMASK_B512_60;
+    y1 = (y >> HBITS_B512_60);
+    bot = x0 * y0;
+    top = x1 * y1;
+    mid = x0 * y1 + x1 * y0;
+    x0 = mid & HMASK_B512_60;
+    x1 = (mid >> HBITS_B512_60);
+    bot += x0 << HBITS_B512_60;
+    bot += *r;
+    bot += c;
+
+    top += x1;
+    carry = bot >> BASEBITS_B512_60;
+    bot &= BMASK_B512_60;
+    top += carry;
+
+    *r = bot;
+    return top;
+}
+
+#endif
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/big_B528_60.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/big_B528_60.h
new file mode 100644
index 0000000..b8f357a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/big_B528_60.h
@@ -0,0 +1,697 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file big.h
+ * @author Mike Scott
+ * @date 23rd February 2016
+ * @brief Big number Header File
+ *
+ *
+ */
+
+#ifndef BIG_B528_60_H
+#define BIG_B528_60_H
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <inttypes.h>
+#include "arch.h"
+#include "core.h"
+#include "config_big_B528_60.h"
+
+using namespace core;
+
+/* could comment this out if code size is a major issue */
+#define UNWOUND
+/* Normally recommended, but may not be optimal for some architectures, for example 32-bit ARM M4 */
+#define USE_KARATSUBA
+
+#define BIGBITS_B528_60 (8*MODBYTES_B528_60)
+#define NLEN_B528_60 (1+((8*MODBYTES_B528_60-1)/BASEBITS_B528_60))
+#define DNLEN_B528_60 2*NLEN_B528_60
+#define BMASK_B528_60 (((chunk)1<<BASEBITS_B528_60)-1) /**< Mask = 2^BASEBITS-1 */
+#define NEXCESS_B528_60 (1<<(CHUNK-BASEBITS_B528_60-1))           /**< 2^(CHUNK-BASEBITS-1) - digit cannot be multiplied by more than this before normalisation */
+
+#define HBITS_B528_60 (BASEBITS_B528_60/2)      /**< Number of bits in number base divided by 2 */
+#define HMASK_B528_60 (((chunk)1<<HBITS_B528_60)-1)    /**< Mask = 2^HBITS-1 */
+
+//#define DEBUG_NORM
+
+#ifdef DEBUG_NORM  /* Add an extra location to track chunk extension */
+#define MPV_B528_60 NLEN_B528_60
+#define MNV_B528_60 (NLEN_B528_60+1)
+#define DMPV_B528_60 DNLEN_B528_60
+#define DMNV_B528_60 (DNLEN_B528_60+1)
+
+#endif
+
+namespace B528_60 {
+
+//extern int BIGMULS;
+//extern int BIGSQRS;
+
+#ifdef DEBUG_NORM
+typedef chunk BIG[NLEN_B528_60 + 2]; /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B528_60 + 2]; /**< Define type DBIG as array of chunks */
+#else
+typedef chunk BIG[NLEN_B528_60];     /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B528_60];   /**< Define type DBIG as array of chunks */
+#endif
+
+/* BIG number prototypes */
+
+/**	@brief Tests for BIG equal to zero (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_iszilch(BIG x);
+/**	@brief Tests for BIG equal to one (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if one, else returns 0
+ */
+extern int BIG_isunity(BIG x);
+/**	@brief Tests for DBIG equal to zero (Constant Time)
+ *
+	@param x a DBIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_diszilch(DBIG x);
+/**	@brief Outputs a BIG number to the console (Variable Time)
+ *
+	@param x a BIG number
+ */
+extern void BIG_output(BIG x);
+/**	@brief Outputs a BIG number to the console in raw form (Variable Time for debugging)
+ *
+	@param x a BIG number
+ */
+extern void BIG_rawoutput(BIG x);
+/**	@brief Conditional constant time swap of two BIG numbers
+ *
+	Conditionally swaps parameters in constant time (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s swap takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cswap(BIG x, BIG y, int s);
+/**	@brief Conditional copy of BIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cmove(BIG x, BIG y, int s);
+/**	@brief Conditional copy of DBIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a DBIG number
+	@param y another DBIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_dcmove(BIG x, BIG y, int s);
+/**	@brief Convert from BIG number to byte array (Constant Time)
+ *
+	@param a byte array
+	@param x BIG number
+ */
+extern void BIG_toBytes(char *a, BIG x);
+/**	@brief Convert to BIG number from byte array (Constant Time)
+ *
+	@param x BIG number
+	@param a byte array
+ */
+extern void BIG_fromBytes(BIG x, char *a);
+/**	@brief Convert to BIG number from byte array of given length (Variable Time)
+ *
+	@param x BIG number
+	@param a byte array
+	@param s byte array length
+ */
+extern void BIG_fromBytesLen(BIG x, char *a, int s);
+/**@brief Convert to DBIG number from byte array of given length (Variable Time)
+ *
+   @param x DBIG number
+   @param a byte array
+   @param s byte array length
+ */
+extern void BIG_dfromBytesLen(DBIG x, char *a, int s);
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_doutput(DBIG x); 
+
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_drawoutput(DBIG x);
+
+/**	@brief Copy BIG from Read-Only Memory to a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number in ROM
+ */
+extern void BIG_rcopy(BIG x, const BIG y);
+/**	@brief Copy BIG to another BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_copy(BIG x, BIG y);
+/**	@brief Copy DBIG to another DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_dcopy(DBIG x, DBIG y);
+/**	@brief Copy BIG to upper half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dsucopy(DBIG x, BIG y);
+/**	@brief Copy BIG to lower half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dscopy(DBIG x, BIG y);
+/**	@brief Copy lower half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sdcopy(BIG x, DBIG y);
+/**	@brief Copy upper half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sducopy(BIG x, DBIG y);
+/**	@brief Set BIG to zero (Constant Time)
+ *
+	@param x BIG number to be set to zero  
+ */
+extern void BIG_zero(BIG x);
+/**	@brief Set DBIG to zero (Constant Time)
+ *
+	@param x DBIG number to be set to zero
+ */
+extern void BIG_dzero(DBIG x);
+/**	@brief Set BIG to one (unity) (Constant Time)
+ *
+	@param x BIG number to be set to one.
+ */
+extern void BIG_one(BIG x);
+/**	@brief Set BIG to inverse mod 2^256 (Constant Time)
+ *
+	@param x BIG number to be inverted
+ */
+extern void BIG_invmod2m(BIG x);
+/**	@brief Set BIG to sum of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, sum of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_add(BIG x, BIG y, BIG z);
+
+/**	@brief Set BIG to logical or of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, or of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_or(BIG x, BIG y, BIG z);
+
+/**	@brief Increment BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be incremented
+	@param i integer
+ */
+extern void BIG_inc(BIG x, int i);
+/**	@brief Set BIG to difference of two BIGs (Constant Time)
+ *
+	@param x BIG number, difference of other two - output not normalised
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_sub(BIG x, BIG y, BIG z);
+/**	@brief Decrement BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be decremented
+	@param i integer
+ */
+extern void BIG_dec(BIG x, int i);
+/**	@brief Set DBIG to sum of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, sum of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dadd(DBIG x, DBIG y, DBIG z);
+/**	@brief Set DBIG to difference of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, difference of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dsub(DBIG x, DBIG y, DBIG z);
+/**	@brief Multiply BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_imul(BIG x, BIG y, int i);
+/**	@brief Multiply BIG by not-so-small small integer - output normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+	@return Overflowing bits
+ */
+extern chunk BIG_pmul(BIG x, BIG y, int i);
+/**	@brief Divide BIG by 3 - output normalised (Constant Time)
+ *
+	@param x BIG number
+	@return Remainder
+ */
+extern int BIG_div3(BIG x);
+/**	@brief Multiply BIG by even bigger small integer resulting in a DBIG - output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_pxmul(DBIG x, BIG y, int i);
+/**	@brief Multiply BIG by another BIG resulting in DBIG - inputs normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_mul(DBIG x, BIG y, BIG z);
+/**	@brief Multiply BIG by another BIG resulting in another BIG - inputs normalised and output normalised (Constant Time)
+ *
+	Note that the product must fit into a BIG, and x must be distinct from y and z
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_smul(BIG x, BIG y, BIG z);
+/**	@brief Square BIG resulting in a DBIG - input normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, square of a BIG
+	@param y BIG number to be squared
+ */
+extern void BIG_sqr(DBIG x, BIG y);
+
+/**	@brief Montgomery reduction of a DBIG to a BIG  - input normalised and output normalised (Constant Time)
+ *
+	@param a BIG number, reduction of a BIG
+	@param md BIG number, the modulus
+	@param MC the Montgomery Constant
+	@param d DBIG number to be reduced
+ */
+extern void BIG_monty(BIG a, BIG md, chunk MC, DBIG d);
+
+/**	@brief Shifts a BIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shl(BIG x, int s);
+/**	@brief Fast shifts a BIG left by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Overflow bits
+ */
+extern int BIG_fshl(BIG x, int s);
+/**	@brief Shifts a DBIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshl(DBIG x, int s);
+/**	@brief Shifts a BIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shr(BIG x, int s);
+
+
+/**	@brief Fast time-critical combined shift by 1 bit, subtract and normalise (Constant Time)
+ *
+	@param r BIG number normalised output
+	@param a BIG number to be subtracted from
+	@param m BIG number to be shifted and subtracted
+	@return sign of r
+ */
+extern int BIG_ssn(BIG r, BIG a, BIG m);
+
+/**	@brief Fast shifts a BIG right by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Shifted out bits
+ */
+extern int BIG_fshr(BIG x, int s);
+/**	@brief Shifts a DBIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshr(DBIG x, int s);
+/**	@brief Splits a DBIG into two BIGs - input must be normalised, outputs normalised (Constant Time as used)
+ *
+	Internal function. The value of s must be approximately in the middle of the DBIG.
+	Typically used to extract z mod 2^MODBITS and z/2^MODBITS
+	@param x BIG number, top half of z
+	@param y BIG number, bottom half of z
+	@param z DBIG number to be split in two.
+	@param s Bit position at which to split
+	@return carry-out from top half
+ */
+extern chunk BIG_split(BIG x, BIG y, DBIG z, int s);
+/**	@brief Normalizes a BIG number - output normalised (Constant Time)
+ *
+	All digits of the input BIG are reduced mod 2^BASEBITS
+	@param x BIG number to be normalised
+ */
+extern chunk BIG_norm(BIG x);
+/**	@brief Normalizes a DBIG number - output normalised (Constant Time)
+ *
+	All digits of the input DBIG are reduced mod 2^BASEBITS
+	@param x DBIG number to be normalised
+ */
+extern void BIG_dnorm(DBIG x);
+/**	@brief Compares two BIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first BIG number to be compared
+	@param y second BIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_comp(BIG x, BIG y);
+/**	@brief Compares two DBIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first DBIG number to be compared
+	@param y second DBIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_dcomp(DBIG x, DBIG y);
+/**	@brief Calculate number of bits in a BIG - output normalised (Variable Time)
+ *
+	@param x BIG number
+	@return Number of bits in x
+ */
+extern int BIG_nbits(BIG x);
+/**	@brief Calculate number of bits in a DBIG - output normalised (Variable Time)
+ *
+	@param x DBIG number
+	@return Number of bits in x
+ */
+extern int BIG_dnbits(DBIG x);
+
+/**	@brief Reduce x mod n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctmod(BIG x, BIG n, int bd);
+
+/**	@brief  x=y mod n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctdmod(BIG x, DBIG y, BIG n, int bd);
+
+/**	@brief Divide x by n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctsdiv(BIG x,BIG n,int bd);
+
+/**	@brief  x=y/n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctddiv(BIG x, DBIG y, BIG n,int bd);
+
+
+/**	@brief Reduce x mod n - input and output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+ */
+extern void BIG_mod(BIG x, BIG n);
+/**	@brief Divide x by n - output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+ */
+extern void BIG_sdiv(BIG x, BIG n);
+/**	@brief  x=y mod n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_dmod(BIG x, DBIG y, BIG n);
+/**	@brief  x=y/n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_ddiv(BIG x, DBIG y, BIG n);
+/**	@brief  return parity of BIG, that is the least significant bit (Constant Time)
+ *
+	@param x BIG number
+	@return 0 or 1
+ */
+extern int BIG_parity(BIG x);
+/**	@brief  return i-th of BIG (Constant Time)
+ *
+	@param x BIG number
+	@param i the bit of x to be returned
+	@return 0 or 1
+ */
+extern int BIG_bit(BIG x, int i);
+/**	@brief  return least significant bits of a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param n number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int BIG_lastbits(BIG x, int n);
+/**	@brief  Create a random BIG from a random number generator (Constant Time)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_random(BIG x, csprng *r);
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randomnum(BIG x, BIG n, csprng *r);
+
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus and truncated to max bit length (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param t Maximum bit length
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randtrunc(BIG x, BIG n, int t, csprng *r);
+
+/**	brief  return NAF (Non-Adjacent-Form) value as +/- 1, 3 or 5, inputs must be normalised
+ *
+	Given x and 3*x extracts NAF value from given bit position, and returns number of bits processed, and number of trailing zeros detected if any
+	param x BIG number
+	param x3 BIG number, three times x
+	param i bit position
+	param nbs pointer to integer returning number of bits processed
+	param nzs pointer to integer returning number of trailing 0s
+	return + or - 1, 3 or 5
+*/
+
+/**	@brief  Calculate x=y*z mod n (Variable Time)
+ *
+	Slow method for modular multiplication
+	@param x BIG number, on exit = y*z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modmul(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y/z mod n (Variable Time)
+ *
+	Slow method for modular division
+	@param x BIG number, on exit = y/z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_moddiv(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y^2 mod n (Variable Time)
+ *
+	Slow method for modular squaring
+	@param x BIG number, on exit = y^2 mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modsqr(BIG x, BIG y, BIG n);
+/**	@brief  Calculate x=-y mod n (Variable Time)
+ *
+	Modular negation
+	@param x BIG number, on exit = -y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modneg(BIG x, BIG y, BIG n);
+
+/**	@brief  Calculate x=y+z mod n (Variable Time)
+ *
+	Slow method for modular addition
+	@param x BIG number, on exit = y+z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modadd(BIG x, BIG y, BIG z, BIG n);
+
+/**	@brief  Calculate jacobi Symbol (x/y) (Variable Time)
+ *
+	@param x BIG number
+	@param y BIG number
+	@return Jacobi symbol, -1,0 or 1
+ */
+extern int BIG_jacobi(BIG x, BIG y);
+/**	@brief  Calculate x=1/y mod n (Variable Time)
+ *
+	Modular Inversion - This is slow. Uses binary method.
+	@param x BIG number, on exit = 1/y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_invmodp(BIG x, BIG y, BIG n);
+/** @brief Calculate x=x mod 2^m (Variable Time)
+ *
+	Truncation
+	@param x BIG number, on reduced mod 2^m
+	@param m new truncated size
+*/
+extern void BIG_mod2m(BIG x, int m);
+
+/**	@brief Calculates a*b+c+*d
+ *
+	Calculate partial product of a.b, add in carry c, and add total to d (Constant Time)
+	@param a multiplier
+	@param b multiplicand
+	@param c carry
+	@param d pointer to accumulated bottom half of result
+	@return top half of result
+ */
+
+
+extern int step1(BIG,BIG,BIG);
+extern void step2(BIG,BIG,BIG);
+
+#ifdef dchunk
+
+/* Method required to calculate x*y+c+r, bottom half in r, top half returned */
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    dchunk prod = (dchunk)x * y + c + *r;
+    *r = (chunk)prod & BMASK_B528_60;
+    return (chunk)(prod >> BASEBITS_B528_60);
+}
+
+#else
+
+/* No integer type available that can store double the wordlength */
+/* accumulate partial products */
+
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    chunk x0, x1, y0, y1;
+    chunk bot, top, mid, carry;
+    x0 = x & HMASK_B528_60;
+    x1 = (x >> HBITS_B528_60);
+    y0 = y & HMASK_B528_60;
+    y1 = (y >> HBITS_B528_60);
+    bot = x0 * y0;
+    top = x1 * y1;
+    mid = x0 * y1 + x1 * y0;
+    x0 = mid & HMASK_B528_60;
+    x1 = (mid >> HBITS_B528_60);
+    bot += x0 << HBITS_B528_60;
+    bot += *r;
+    bot += c;
+
+    top += x1;
+    carry = bot >> BASEBITS_B528_60;
+    bot &= BMASK_B528_60;
+    top += carry;
+
+    *r = bot;
+    return top;
+}
+
+#endif
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/big_B560_58.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/big_B560_58.h
new file mode 100644
index 0000000..eef9fc8
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/big_B560_58.h
@@ -0,0 +1,697 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file big.h
+ * @author Mike Scott
+ * @date 23rd February 2016
+ * @brief Big number Header File
+ *
+ *
+ */
+
+#ifndef BIG_B560_58_H
+#define BIG_B560_58_H
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <inttypes.h>
+#include "arch.h"
+#include "core.h"
+#include "config_big_B560_58.h"
+
+using namespace core;
+
+/* could comment this out if code size is a major issue */
+#define UNWOUND
+/* Normally recommended, but may not be optimal for some architectures, for example 32-bit ARM M4 */
+#define USE_KARATSUBA
+
+#define BIGBITS_B560_58 (8*MODBYTES_B560_58)
+#define NLEN_B560_58 (1+((8*MODBYTES_B560_58-1)/BASEBITS_B560_58))
+#define DNLEN_B560_58 2*NLEN_B560_58
+#define BMASK_B560_58 (((chunk)1<<BASEBITS_B560_58)-1) /**< Mask = 2^BASEBITS-1 */
+#define NEXCESS_B560_58 (1<<(CHUNK-BASEBITS_B560_58-1))           /**< 2^(CHUNK-BASEBITS-1) - digit cannot be multiplied by more than this before normalisation */
+
+#define HBITS_B560_58 (BASEBITS_B560_58/2)      /**< Number of bits in number base divided by 2 */
+#define HMASK_B560_58 (((chunk)1<<HBITS_B560_58)-1)    /**< Mask = 2^HBITS-1 */
+
+//#define DEBUG_NORM
+
+#ifdef DEBUG_NORM  /* Add an extra location to track chunk extension */
+#define MPV_B560_58 NLEN_B560_58
+#define MNV_B560_58 (NLEN_B560_58+1)
+#define DMPV_B560_58 DNLEN_B560_58
+#define DMNV_B560_58 (DNLEN_B560_58+1)
+
+#endif
+
+namespace B560_58 {
+
+//extern int BIGMULS;
+//extern int BIGSQRS;
+
+#ifdef DEBUG_NORM
+typedef chunk BIG[NLEN_B560_58 + 2]; /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B560_58 + 2]; /**< Define type DBIG as array of chunks */
+#else
+typedef chunk BIG[NLEN_B560_58];     /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B560_58];   /**< Define type DBIG as array of chunks */
+#endif
+
+/* BIG number prototypes */
+
+/**	@brief Tests for BIG equal to zero (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_iszilch(BIG x);
+/**	@brief Tests for BIG equal to one (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if one, else returns 0
+ */
+extern int BIG_isunity(BIG x);
+/**	@brief Tests for DBIG equal to zero (Constant Time)
+ *
+	@param x a DBIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_diszilch(DBIG x);
+/**	@brief Outputs a BIG number to the console (Variable Time)
+ *
+	@param x a BIG number
+ */
+extern void BIG_output(BIG x);
+/**	@brief Outputs a BIG number to the console in raw form (Variable Time for debugging)
+ *
+	@param x a BIG number
+ */
+extern void BIG_rawoutput(BIG x);
+/**	@brief Conditional constant time swap of two BIG numbers
+ *
+	Conditionally swaps parameters in constant time (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s swap takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cswap(BIG x, BIG y, int s);
+/**	@brief Conditional copy of BIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cmove(BIG x, BIG y, int s);
+/**	@brief Conditional copy of DBIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a DBIG number
+	@param y another DBIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_dcmove(BIG x, BIG y, int s);
+/**	@brief Convert from BIG number to byte array (Constant Time)
+ *
+	@param a byte array
+	@param x BIG number
+ */
+extern void BIG_toBytes(char *a, BIG x);
+/**	@brief Convert to BIG number from byte array (Constant Time)
+ *
+	@param x BIG number
+	@param a byte array
+ */
+extern void BIG_fromBytes(BIG x, char *a);
+/**	@brief Convert to BIG number from byte array of given length (Variable Time)
+ *
+	@param x BIG number
+	@param a byte array
+	@param s byte array length
+ */
+extern void BIG_fromBytesLen(BIG x, char *a, int s);
+/**@brief Convert to DBIG number from byte array of given length (Variable Time)
+ *
+   @param x DBIG number
+   @param a byte array
+   @param s byte array length
+ */
+extern void BIG_dfromBytesLen(DBIG x, char *a, int s);
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_doutput(DBIG x); 
+
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_drawoutput(DBIG x);
+
+/**	@brief Copy BIG from Read-Only Memory to a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number in ROM
+ */
+extern void BIG_rcopy(BIG x, const BIG y);
+/**	@brief Copy BIG to another BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_copy(BIG x, BIG y);
+/**	@brief Copy DBIG to another DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_dcopy(DBIG x, DBIG y);
+/**	@brief Copy BIG to upper half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dsucopy(DBIG x, BIG y);
+/**	@brief Copy BIG to lower half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dscopy(DBIG x, BIG y);
+/**	@brief Copy lower half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sdcopy(BIG x, DBIG y);
+/**	@brief Copy upper half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sducopy(BIG x, DBIG y);
+/**	@brief Set BIG to zero (Constant Time)
+ *
+	@param x BIG number to be set to zero  
+ */
+extern void BIG_zero(BIG x);
+/**	@brief Set DBIG to zero (Constant Time)
+ *
+	@param x DBIG number to be set to zero
+ */
+extern void BIG_dzero(DBIG x);
+/**	@brief Set BIG to one (unity) (Constant Time)
+ *
+	@param x BIG number to be set to one.
+ */
+extern void BIG_one(BIG x);
+/**	@brief Set BIG to inverse mod 2^256 (Constant Time)
+ *
+	@param x BIG number to be inverted
+ */
+extern void BIG_invmod2m(BIG x);
+/**	@brief Set BIG to sum of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, sum of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_add(BIG x, BIG y, BIG z);
+
+/**	@brief Set BIG to logical or of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, or of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_or(BIG x, BIG y, BIG z);
+
+/**	@brief Increment BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be incremented
+	@param i integer
+ */
+extern void BIG_inc(BIG x, int i);
+/**	@brief Set BIG to difference of two BIGs (Constant Time)
+ *
+	@param x BIG number, difference of other two - output not normalised
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_sub(BIG x, BIG y, BIG z);
+/**	@brief Decrement BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be decremented
+	@param i integer
+ */
+extern void BIG_dec(BIG x, int i);
+/**	@brief Set DBIG to sum of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, sum of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dadd(DBIG x, DBIG y, DBIG z);
+/**	@brief Set DBIG to difference of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, difference of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dsub(DBIG x, DBIG y, DBIG z);
+/**	@brief Multiply BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_imul(BIG x, BIG y, int i);
+/**	@brief Multiply BIG by not-so-small small integer - output normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+	@return Overflowing bits
+ */
+extern chunk BIG_pmul(BIG x, BIG y, int i);
+/**	@brief Divide BIG by 3 - output normalised (Constant Time)
+ *
+	@param x BIG number
+	@return Remainder
+ */
+extern int BIG_div3(BIG x);
+/**	@brief Multiply BIG by even bigger small integer resulting in a DBIG - output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_pxmul(DBIG x, BIG y, int i);
+/**	@brief Multiply BIG by another BIG resulting in DBIG - inputs normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_mul(DBIG x, BIG y, BIG z);
+/**	@brief Multiply BIG by another BIG resulting in another BIG - inputs normalised and output normalised (Constant Time)
+ *
+	Note that the product must fit into a BIG, and x must be distinct from y and z
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_smul(BIG x, BIG y, BIG z);
+/**	@brief Square BIG resulting in a DBIG - input normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, square of a BIG
+	@param y BIG number to be squared
+ */
+extern void BIG_sqr(DBIG x, BIG y);
+
+/**	@brief Montgomery reduction of a DBIG to a BIG  - input normalised and output normalised (Constant Time)
+ *
+	@param a BIG number, reduction of a BIG
+	@param md BIG number, the modulus
+	@param MC the Montgomery Constant
+	@param d DBIG number to be reduced
+ */
+extern void BIG_monty(BIG a, BIG md, chunk MC, DBIG d);
+
+/**	@brief Shifts a BIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shl(BIG x, int s);
+/**	@brief Fast shifts a BIG left by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Overflow bits
+ */
+extern int BIG_fshl(BIG x, int s);
+/**	@brief Shifts a DBIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshl(DBIG x, int s);
+/**	@brief Shifts a BIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shr(BIG x, int s);
+
+
+/**	@brief Fast time-critical combined shift by 1 bit, subtract and normalise (Constant Time)
+ *
+	@param r BIG number normalised output
+	@param a BIG number to be subtracted from
+	@param m BIG number to be shifted and subtracted
+	@return sign of r
+ */
+extern int BIG_ssn(BIG r, BIG a, BIG m);
+
+/**	@brief Fast shifts a BIG right by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Shifted out bits
+ */
+extern int BIG_fshr(BIG x, int s);
+/**	@brief Shifts a DBIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshr(DBIG x, int s);
+/**	@brief Splits a DBIG into two BIGs - input must be normalised, outputs normalised (Constant Time as used)
+ *
+	Internal function. The value of s must be approximately in the middle of the DBIG.
+	Typically used to extract z mod 2^MODBITS and z/2^MODBITS
+	@param x BIG number, top half of z
+	@param y BIG number, bottom half of z
+	@param z DBIG number to be split in two.
+	@param s Bit position at which to split
+	@return carry-out from top half
+ */
+extern chunk BIG_split(BIG x, BIG y, DBIG z, int s);
+/**	@brief Normalizes a BIG number - output normalised (Constant Time)
+ *
+	All digits of the input BIG are reduced mod 2^BASEBITS
+	@param x BIG number to be normalised
+ */
+extern chunk BIG_norm(BIG x);
+/**	@brief Normalizes a DBIG number - output normalised (Constant Time)
+ *
+	All digits of the input DBIG are reduced mod 2^BASEBITS
+	@param x DBIG number to be normalised
+ */
+extern void BIG_dnorm(DBIG x);
+/**	@brief Compares two BIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first BIG number to be compared
+	@param y second BIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_comp(BIG x, BIG y);
+/**	@brief Compares two DBIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first DBIG number to be compared
+	@param y second DBIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_dcomp(DBIG x, DBIG y);
+/**	@brief Calculate number of bits in a BIG - output normalised (Variable Time)
+ *
+	@param x BIG number
+	@return Number of bits in x
+ */
+extern int BIG_nbits(BIG x);
+/**	@brief Calculate number of bits in a DBIG - output normalised (Variable Time)
+ *
+	@param x DBIG number
+	@return Number of bits in x
+ */
+extern int BIG_dnbits(DBIG x);
+
+/**	@brief Reduce x mod n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctmod(BIG x, BIG n, int bd);
+
+/**	@brief  x=y mod n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctdmod(BIG x, DBIG y, BIG n, int bd);
+
+/**	@brief Divide x by n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctsdiv(BIG x,BIG n,int bd);
+
+/**	@brief  x=y/n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctddiv(BIG x, DBIG y, BIG n,int bd);
+
+
+/**	@brief Reduce x mod n - input and output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+ */
+extern void BIG_mod(BIG x, BIG n);
+/**	@brief Divide x by n - output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+ */
+extern void BIG_sdiv(BIG x, BIG n);
+/**	@brief  x=y mod n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_dmod(BIG x, DBIG y, BIG n);
+/**	@brief  x=y/n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_ddiv(BIG x, DBIG y, BIG n);
+/**	@brief  return parity of BIG, that is the least significant bit (Constant Time)
+ *
+	@param x BIG number
+	@return 0 or 1
+ */
+extern int BIG_parity(BIG x);
+/**	@brief  return i-th of BIG (Constant Time)
+ *
+	@param x BIG number
+	@param i the bit of x to be returned
+	@return 0 or 1
+ */
+extern int BIG_bit(BIG x, int i);
+/**	@brief  return least significant bits of a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param n number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int BIG_lastbits(BIG x, int n);
+/**	@brief  Create a random BIG from a random number generator (Constant Time)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_random(BIG x, csprng *r);
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randomnum(BIG x, BIG n, csprng *r);
+
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus and truncated to max bit length (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param t Maximum bit length
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randtrunc(BIG x, BIG n, int t, csprng *r);
+
+/**	brief  return NAF (Non-Adjacent-Form) value as +/- 1, 3 or 5, inputs must be normalised
+ *
+	Given x and 3*x extracts NAF value from given bit position, and returns number of bits processed, and number of trailing zeros detected if any
+	param x BIG number
+	param x3 BIG number, three times x
+	param i bit position
+	param nbs pointer to integer returning number of bits processed
+	param nzs pointer to integer returning number of trailing 0s
+	return + or - 1, 3 or 5
+*/
+
+/**	@brief  Calculate x=y*z mod n (Variable Time)
+ *
+	Slow method for modular multiplication
+	@param x BIG number, on exit = y*z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modmul(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y/z mod n (Variable Time)
+ *
+	Slow method for modular division
+	@param x BIG number, on exit = y/z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_moddiv(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y^2 mod n (Variable Time)
+ *
+	Slow method for modular squaring
+	@param x BIG number, on exit = y^2 mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modsqr(BIG x, BIG y, BIG n);
+/**	@brief  Calculate x=-y mod n (Variable Time)
+ *
+	Modular negation
+	@param x BIG number, on exit = -y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modneg(BIG x, BIG y, BIG n);
+
+/**	@brief  Calculate x=y+z mod n (Variable Time)
+ *
+	Slow method for modular addition
+	@param x BIG number, on exit = y+z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modadd(BIG x, BIG y, BIG z, BIG n);
+
+/**	@brief  Calculate jacobi Symbol (x/y) (Variable Time)
+ *
+	@param x BIG number
+	@param y BIG number
+	@return Jacobi symbol, -1,0 or 1
+ */
+extern int BIG_jacobi(BIG x, BIG y);
+/**	@brief  Calculate x=1/y mod n (Variable Time)
+ *
+	Modular Inversion - This is slow. Uses binary method.
+	@param x BIG number, on exit = 1/y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_invmodp(BIG x, BIG y, BIG n);
+/** @brief Calculate x=x mod 2^m (Variable Time)
+ *
+	Truncation
+	@param x BIG number, on reduced mod 2^m
+	@param m new truncated size
+*/
+extern void BIG_mod2m(BIG x, int m);
+
+/**	@brief Calculates a*b+c+*d
+ *
+	Calculate partial product of a.b, add in carry c, and add total to d (Constant Time)
+	@param a multiplier
+	@param b multiplicand
+	@param c carry
+	@param d pointer to accumulated bottom half of result
+	@return top half of result
+ */
+
+
+extern int step1(BIG,BIG,BIG);
+extern void step2(BIG,BIG,BIG);
+
+#ifdef dchunk
+
+/* Method required to calculate x*y+c+r, bottom half in r, top half returned */
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    dchunk prod = (dchunk)x * y + c + *r;
+    *r = (chunk)prod & BMASK_B560_58;
+    return (chunk)(prod >> BASEBITS_B560_58);
+}
+
+#else
+
+/* No integer type available that can store double the wordlength */
+/* accumulate partial products */
+
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    chunk x0, x1, y0, y1;
+    chunk bot, top, mid, carry;
+    x0 = x & HMASK_B560_58;
+    x1 = (x >> HBITS_B560_58);
+    y0 = y & HMASK_B560_58;
+    y1 = (y >> HBITS_B560_58);
+    bot = x0 * y0;
+    top = x1 * y1;
+    mid = x0 * y1 + x1 * y0;
+    x0 = mid & HMASK_B560_58;
+    x1 = (mid >> HBITS_B560_58);
+    bot += x0 << HBITS_B560_58;
+    bot += *r;
+    bot += c;
+
+    top += x1;
+    carry = bot >> BASEBITS_B560_58;
+    bot &= BMASK_B560_58;
+    top += carry;
+
+    *r = bot;
+    return top;
+}
+
+#endif
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/big_B584_60.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/big_B584_60.h
new file mode 100644
index 0000000..3c84b90
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/big_B584_60.h
@@ -0,0 +1,697 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file big.h
+ * @author Mike Scott
+ * @date 23rd February 2016
+ * @brief Big number Header File
+ *
+ *
+ */
+
+#ifndef BIG_B584_60_H
+#define BIG_B584_60_H
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <inttypes.h>
+#include "arch.h"
+#include "core.h"
+#include "config_big_B584_60.h"
+
+using namespace core;
+
+/* could comment this out if code size is a major issue */
+#define UNWOUND
+/* Normally recommended, but may not be optimal for some architectures, for example 32-bit ARM M4 */
+#define USE_KARATSUBA
+
+#define BIGBITS_B584_60 (8*MODBYTES_B584_60)
+#define NLEN_B584_60 (1+((8*MODBYTES_B584_60-1)/BASEBITS_B584_60))
+#define DNLEN_B584_60 2*NLEN_B584_60
+#define BMASK_B584_60 (((chunk)1<<BASEBITS_B584_60)-1) /**< Mask = 2^BASEBITS-1 */
+#define NEXCESS_B584_60 (1<<(CHUNK-BASEBITS_B584_60-1))           /**< 2^(CHUNK-BASEBITS-1) - digit cannot be multiplied by more than this before normalisation */
+
+#define HBITS_B584_60 (BASEBITS_B584_60/2)      /**< Number of bits in number base divided by 2 */
+#define HMASK_B584_60 (((chunk)1<<HBITS_B584_60)-1)    /**< Mask = 2^HBITS-1 */
+
+//#define DEBUG_NORM
+
+#ifdef DEBUG_NORM  /* Add an extra location to track chunk extension */
+#define MPV_B584_60 NLEN_B584_60
+#define MNV_B584_60 (NLEN_B584_60+1)
+#define DMPV_B584_60 DNLEN_B584_60
+#define DMNV_B584_60 (DNLEN_B584_60+1)
+
+#endif
+
+namespace B584_60 {
+
+//extern int BIGMULS;
+//extern int BIGSQRS;
+
+#ifdef DEBUG_NORM
+typedef chunk BIG[NLEN_B584_60 + 2]; /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B584_60 + 2]; /**< Define type DBIG as array of chunks */
+#else
+typedef chunk BIG[NLEN_B584_60];     /**< Define type BIG as array of chunks */
+typedef chunk DBIG[DNLEN_B584_60];   /**< Define type DBIG as array of chunks */
+#endif
+
+/* BIG number prototypes */
+
+/**	@brief Tests for BIG equal to zero (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_iszilch(BIG x);
+/**	@brief Tests for BIG equal to one (Constant Time)
+ *
+	@param x a BIG number
+	@return 1 if one, else returns 0
+ */
+extern int BIG_isunity(BIG x);
+/**	@brief Tests for DBIG equal to zero (Constant Time)
+ *
+	@param x a DBIG number
+	@return 1 if zero, else returns 0
+ */
+extern int BIG_diszilch(DBIG x);
+/**	@brief Outputs a BIG number to the console (Variable Time)
+ *
+	@param x a BIG number
+ */
+extern void BIG_output(BIG x);
+/**	@brief Outputs a BIG number to the console in raw form (Variable Time for debugging)
+ *
+	@param x a BIG number
+ */
+extern void BIG_rawoutput(BIG x);
+/**	@brief Conditional constant time swap of two BIG numbers
+ *
+	Conditionally swaps parameters in constant time (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s swap takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cswap(BIG x, BIG y, int s);
+/**	@brief Conditional copy of BIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a BIG number
+	@param y another BIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_cmove(BIG x, BIG y, int s);
+/**	@brief Conditional copy of DBIG number
+ *
+	Conditionally copies second parameter to the first (Constant Time without branching)
+	@param x a DBIG number
+	@param y another DBIG number
+	@param s copy takes place if not equal to 0
+    @return ignore
+ */
+extern chunk BIG_dcmove(BIG x, BIG y, int s);
+/**	@brief Convert from BIG number to byte array (Constant Time)
+ *
+	@param a byte array
+	@param x BIG number
+ */
+extern void BIG_toBytes(char *a, BIG x);
+/**	@brief Convert to BIG number from byte array (Constant Time)
+ *
+	@param x BIG number
+	@param a byte array
+ */
+extern void BIG_fromBytes(BIG x, char *a);
+/**	@brief Convert to BIG number from byte array of given length (Variable Time)
+ *
+	@param x BIG number
+	@param a byte array
+	@param s byte array length
+ */
+extern void BIG_fromBytesLen(BIG x, char *a, int s);
+/**@brief Convert to DBIG number from byte array of given length (Variable Time)
+ *
+   @param x DBIG number
+   @param a byte array
+   @param s byte array length
+ */
+extern void BIG_dfromBytesLen(DBIG x, char *a, int s);
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_doutput(DBIG x); 
+
+/**	@brief Outputs a DBIG number to the console  (Variable Time)
+ *
+	@param x a DBIG number
+ */
+extern void BIG_drawoutput(DBIG x);
+
+/**	@brief Copy BIG from Read-Only Memory to a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number in ROM
+ */
+extern void BIG_rcopy(BIG x, const BIG y);
+/**	@brief Copy BIG to another BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_copy(BIG x, BIG y);
+/**	@brief Copy DBIG to another DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_dcopy(DBIG x, DBIG y);
+/**	@brief Copy BIG to upper half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dsucopy(DBIG x, BIG y);
+/**	@brief Copy BIG to lower half of DBIG  (Constant Time)
+ *
+	@param x DBIG number
+	@param y BIG number to be copied
+ */
+extern void BIG_dscopy(DBIG x, BIG y);
+/**	@brief Copy lower half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sdcopy(BIG x, DBIG y);
+/**	@brief Copy upper half of DBIG to a BIG  (Constant Time)
+ *
+	@param x BIG number
+	@param y DBIG number to be copied
+ */
+extern void BIG_sducopy(BIG x, DBIG y);
+/**	@brief Set BIG to zero (Constant Time)
+ *
+	@param x BIG number to be set to zero  
+ */
+extern void BIG_zero(BIG x);
+/**	@brief Set DBIG to zero (Constant Time)
+ *
+	@param x DBIG number to be set to zero
+ */
+extern void BIG_dzero(DBIG x);
+/**	@brief Set BIG to one (unity) (Constant Time)
+ *
+	@param x BIG number to be set to one.
+ */
+extern void BIG_one(BIG x);
+/**	@brief Set BIG to inverse mod 2^256 (Constant Time)
+ *
+	@param x BIG number to be inverted
+ */
+extern void BIG_invmod2m(BIG x);
+/**	@brief Set BIG to sum of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, sum of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_add(BIG x, BIG y, BIG z);
+
+/**	@brief Set BIG to logical or of two BIGs - output not normalised (Constant Time)
+ *
+	@param x BIG number, or of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_or(BIG x, BIG y, BIG z);
+
+/**	@brief Increment BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be incremented
+	@param i integer
+ */
+extern void BIG_inc(BIG x, int i);
+/**	@brief Set BIG to difference of two BIGs (Constant Time)
+ *
+	@param x BIG number, difference of other two - output not normalised
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_sub(BIG x, BIG y, BIG z);
+/**	@brief Decrement BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number to be decremented
+	@param i integer
+ */
+extern void BIG_dec(BIG x, int i);
+/**	@brief Set DBIG to sum of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, sum of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dadd(DBIG x, DBIG y, DBIG z);
+/**	@brief Set DBIG to difference of two DBIGs (Constant Time)
+ *
+	@param x DBIG number, difference of other two - output not normalised
+	@param y DBIG number
+	@param z DBIG number
+ */
+extern void BIG_dsub(DBIG x, DBIG y, DBIG z);
+/**	@brief Multiply BIG by a small integer - output not normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_imul(BIG x, BIG y, int i);
+/**	@brief Multiply BIG by not-so-small small integer - output normalised (Constant Time)
+ *
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param i small integer
+	@return Overflowing bits
+ */
+extern chunk BIG_pmul(BIG x, BIG y, int i);
+/**	@brief Divide BIG by 3 - output normalised (Constant Time)
+ *
+	@param x BIG number
+	@return Remainder
+ */
+extern int BIG_div3(BIG x);
+/**	@brief Multiply BIG by even bigger small integer resulting in a DBIG - output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param i small integer
+ */
+extern void BIG_pxmul(DBIG x, BIG y, int i);
+/**	@brief Multiply BIG by another BIG resulting in DBIG - inputs normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_mul(DBIG x, BIG y, BIG z);
+/**	@brief Multiply BIG by another BIG resulting in another BIG - inputs normalised and output normalised (Constant Time)
+ *
+	Note that the product must fit into a BIG, and x must be distinct from y and z
+	@param x BIG number, product of other two
+	@param y BIG number
+	@param z BIG number
+ */
+extern void BIG_smul(BIG x, BIG y, BIG z);
+/**	@brief Square BIG resulting in a DBIG - input normalised and output normalised (Constant Time)
+ *
+	@param x DBIG number, square of a BIG
+	@param y BIG number to be squared
+ */
+extern void BIG_sqr(DBIG x, BIG y);
+
+/**	@brief Montgomery reduction of a DBIG to a BIG  - input normalised and output normalised (Constant Time)
+ *
+	@param a BIG number, reduction of a BIG
+	@param md BIG number, the modulus
+	@param MC the Montgomery Constant
+	@param d DBIG number to be reduced
+ */
+extern void BIG_monty(BIG a, BIG md, chunk MC, DBIG d);
+
+/**	@brief Shifts a BIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shl(BIG x, int s);
+/**	@brief Fast shifts a BIG left by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Overflow bits
+ */
+extern int BIG_fshl(BIG x, int s);
+/**	@brief Shifts a DBIG left by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshl(DBIG x, int s);
+/**	@brief Shifts a BIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_shr(BIG x, int s);
+
+
+/**	@brief Fast time-critical combined shift by 1 bit, subtract and normalise (Constant Time)
+ *
+	@param r BIG number normalised output
+	@param a BIG number to be subtracted from
+	@param m BIG number to be shifted and subtracted
+	@return sign of r
+ */
+extern int BIG_ssn(BIG r, BIG a, BIG m);
+
+/**	@brief Fast shifts a BIG right by a small number of bits - input must be normalised, output will be normalised (Constant Time)
+ *
+	The number of bits to be shifted must be less than BASEBITS
+	@param x BIG number to be shifted
+	@param s Number of bits to shift
+	@return Shifted out bits
+ */
+extern int BIG_fshr(BIG x, int s);
+/**	@brief Shifts a DBIG right by any number of bits - input must be normalised, output normalised (Constant Time)
+ *
+	@param x DBIG number to be shifted
+	@param s Number of bits to shift
+ */
+extern void BIG_dshr(DBIG x, int s);
+/**	@brief Splits a DBIG into two BIGs - input must be normalised, outputs normalised (Constant Time as used)
+ *
+	Internal function. The value of s must be approximately in the middle of the DBIG.
+	Typically used to extract z mod 2^MODBITS and z/2^MODBITS
+	@param x BIG number, top half of z
+	@param y BIG number, bottom half of z
+	@param z DBIG number to be split in two.
+	@param s Bit position at which to split
+	@return carry-out from top half
+ */
+extern chunk BIG_split(BIG x, BIG y, DBIG z, int s);
+/**	@brief Normalizes a BIG number - output normalised (Constant Time)
+ *
+	All digits of the input BIG are reduced mod 2^BASEBITS
+	@param x BIG number to be normalised
+ */
+extern chunk BIG_norm(BIG x);
+/**	@brief Normalizes a DBIG number - output normalised (Constant Time)
+ *
+	All digits of the input DBIG are reduced mod 2^BASEBITS
+	@param x DBIG number to be normalised
+ */
+extern void BIG_dnorm(DBIG x);
+/**	@brief Compares two BIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first BIG number to be compared
+	@param y second BIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_comp(BIG x, BIG y);
+/**	@brief Compares two DBIG numbers. Inputs must be normalised externally (Constant Time)
+ *
+	@param x first DBIG number to be compared
+	@param y second DBIG number to be compared
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int BIG_dcomp(DBIG x, DBIG y);
+/**	@brief Calculate number of bits in a BIG - output normalised (Variable Time)
+ *
+	@param x BIG number
+	@return Number of bits in x
+ */
+extern int BIG_nbits(BIG x);
+/**	@brief Calculate number of bits in a DBIG - output normalised (Variable Time)
+ *
+	@param x DBIG number
+	@return Number of bits in x
+ */
+extern int BIG_dnbits(DBIG x);
+
+/**	@brief Reduce x mod n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctmod(BIG x, BIG n, int bd);
+
+/**	@brief  x=y mod n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctdmod(BIG x, DBIG y, BIG n, int bd);
+
+/**	@brief Divide x by n - constant time for fixed bd
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+    @param bd non-negative bit difference between maximum x and n
+ */
+extern void BIG_ctsdiv(BIG x,BIG n,int bd);
+
+/**	@brief  x=y/n - constant time for fixed bd
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+    @param bd non-negative bit difference between maximum y and n
+ */
+extern void BIG_ctddiv(BIG x, DBIG y, BIG n,int bd);
+
+
+/**	@brief Reduce x mod n - input and output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be reduced mod n
+	@param n The modulus
+ */
+extern void BIG_mod(BIG x, BIG n);
+/**	@brief Divide x by n - output normalised (Variable Time)
+ *
+	Slow but rarely used
+	@param x BIG number to be divided by n
+	@param n The Divisor
+ */
+extern void BIG_sdiv(BIG x, BIG n);
+/**	@brief  x=y mod n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y mod n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_dmod(BIG x, DBIG y, BIG n);
+/**	@brief  x=y/n - output normalised (Variable Time)
+ *
+	Slow but rarely used. y is destroyed.
+	@param x BIG number, on exit = y/n
+	@param y DBIG number
+	@param n Modulus
+ */
+extern void BIG_ddiv(BIG x, DBIG y, BIG n);
+/**	@brief  return parity of BIG, that is the least significant bit (Constant Time)
+ *
+	@param x BIG number
+	@return 0 or 1
+ */
+extern int BIG_parity(BIG x);
+/**	@brief  return i-th of BIG (Constant Time)
+ *
+	@param x BIG number
+	@param i the bit of x to be returned
+	@return 0 or 1
+ */
+extern int BIG_bit(BIG x, int i);
+/**	@brief  return least significant bits of a BIG (Constant Time)
+ *
+	@param x BIG number
+	@param n number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int BIG_lastbits(BIG x, int n);
+/**	@brief  Create a random BIG from a random number generator (Constant Time)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_random(BIG x, csprng *r);
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randomnum(BIG x, BIG n, csprng *r);
+
+/**	@brief  Create an unbiased random BIG from a random number generator, reduced with respect to a modulus and truncated to max bit length (Constant Time as used)
+ *
+	Assumes that the random number generator has been suitably initialised
+	@param x BIG number, on exit a random number
+	@param n The modulus
+	@param t Maximum bit length
+	@param r A pointer to a Cryptographically Secure Random Number Generator
+ */
+extern void BIG_randtrunc(BIG x, BIG n, int t, csprng *r);
+
+/**	brief  return NAF (Non-Adjacent-Form) value as +/- 1, 3 or 5, inputs must be normalised
+ *
+	Given x and 3*x extracts NAF value from given bit position, and returns number of bits processed, and number of trailing zeros detected if any
+	param x BIG number
+	param x3 BIG number, three times x
+	param i bit position
+	param nbs pointer to integer returning number of bits processed
+	param nzs pointer to integer returning number of trailing 0s
+	return + or - 1, 3 or 5
+*/
+
+/**	@brief  Calculate x=y*z mod n (Variable Time)
+ *
+	Slow method for modular multiplication
+	@param x BIG number, on exit = y*z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modmul(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y/z mod n (Variable Time)
+ *
+	Slow method for modular division
+	@param x BIG number, on exit = y/z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_moddiv(BIG x, BIG y, BIG z, BIG n);
+/**	@brief  Calculate x=y^2 mod n (Variable Time)
+ *
+	Slow method for modular squaring
+	@param x BIG number, on exit = y^2 mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modsqr(BIG x, BIG y, BIG n);
+/**	@brief  Calculate x=-y mod n (Variable Time)
+ *
+	Modular negation
+	@param x BIG number, on exit = -y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modneg(BIG x, BIG y, BIG n);
+
+/**	@brief  Calculate x=y+z mod n (Variable Time)
+ *
+	Slow method for modular addition
+	@param x BIG number, on exit = y+z mod n
+	@param y BIG number
+	@param z BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_modadd(BIG x, BIG y, BIG z, BIG n);
+
+/**	@brief  Calculate jacobi Symbol (x/y) (Variable Time)
+ *
+	@param x BIG number
+	@param y BIG number
+	@return Jacobi symbol, -1,0 or 1
+ */
+extern int BIG_jacobi(BIG x, BIG y);
+/**	@brief  Calculate x=1/y mod n (Variable Time)
+ *
+	Modular Inversion - This is slow. Uses binary method.
+	@param x BIG number, on exit = 1/y mod n
+	@param y BIG number
+	@param n The BIG Modulus
+ */
+extern void BIG_invmodp(BIG x, BIG y, BIG n);
+/** @brief Calculate x=x mod 2^m (Variable Time)
+ *
+	Truncation
+	@param x BIG number, on reduced mod 2^m
+	@param m new truncated size
+*/
+extern void BIG_mod2m(BIG x, int m);
+
+/**	@brief Calculates a*b+c+*d
+ *
+	Calculate partial product of a.b, add in carry c, and add total to d (Constant Time)
+	@param a multiplier
+	@param b multiplicand
+	@param c carry
+	@param d pointer to accumulated bottom half of result
+	@return top half of result
+ */
+
+
+extern int step1(BIG,BIG,BIG);
+extern void step2(BIG,BIG,BIG);
+
+#ifdef dchunk
+
+/* Method required to calculate x*y+c+r, bottom half in r, top half returned */
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    dchunk prod = (dchunk)x * y + c + *r;
+    *r = (chunk)prod & BMASK_B584_60;
+    return (chunk)(prod >> BASEBITS_B584_60);
+}
+
+#else
+
+/* No integer type available that can store double the wordlength */
+/* accumulate partial products */
+
+inline chunk muladd(chunk x, chunk y, chunk c, chunk *r)
+{
+    chunk x0, x1, y0, y1;
+    chunk bot, top, mid, carry;
+    x0 = x & HMASK_B584_60;
+    x1 = (x >> HBITS_B584_60);
+    y0 = y & HMASK_B584_60;
+    y1 = (y >> HBITS_B584_60);
+    bot = x0 * y0;
+    top = x1 * y1;
+    mid = x0 * y1 + x1 * y0;
+    x0 = mid & HMASK_B584_60;
+    x1 = (mid >> HBITS_B584_60);
+    bot += x0 << HBITS_B584_60;
+    bot += *r;
+    bot += c;
+
+    top += x1;
+    carry = bot >> BASEBITS_B584_60;
+    bot &= BMASK_B584_60;
+    top += carry;
+
+    *r = bot;
+    return top;
+}
+
+#endif
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/bls.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/bls.h
new file mode 100644
index 0000000..d91ee9d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/bls.h
@@ -0,0 +1,87 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file bls.h
+ * @author Mike Scott
+ * @date 28th Novemebr 2018
+ * @brief BLS Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef BLS_ZZZ_H
+#define BLS_ZZZ_H
+
+#include "pair_ZZZ.h"
+
+using namespace core;
+
+namespace ZZZ {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define BGS_ZZZ MODBYTES_XXX  /**< BLS Group Size */
+#define BFS_ZZZ MODBYTES_XXX  /**< BLS Field Size */
+
+#define BLS_OK           0  /**< Function completed without error */
+#define BLS_FAIL        -1  /**< Point is NOT on the curve */
+
+/* BLS API functions */
+
+
+/** @brief Initialise BLS
+ *
+    @return BLS_OK if worked, otherwise BLS_FAIL
+ */
+int BLS_INIT();
+
+/** @brief Generate Key Pair
+ *
+    @param IKM contains truly random keying material
+    @param S on output a private key
+    @param W on output a public key = S*G, where G is fixed generator
+    @return BLS_OK
+ */
+int BLS_KEY_PAIR_GENERATE(octet *IKM, octet* S, octet *W);
+
+/** @brief Calculate a signature
+ *
+    @param SIG the ouput signature
+    @param M is the message to be signed
+    @param S an input private key
+    @return BLS_OK
+ */
+int BLS_CORE_SIGN(octet *SIG, octet *M, octet *S);
+
+/** @brief Verify a signature
+ *
+    @param SIG an input signature
+    @param M is the message whose signature is to be verified.
+    @param W an public key
+    @return BLS_OK if verified, otherwise BLS_FAIL
+ */
+int BLS_CORE_VERIFY(octet *SIG, octet *M, octet *W);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/bls192.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/bls192.h
new file mode 100644
index 0000000..2432d91
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/bls192.h
@@ -0,0 +1,86 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file bls192.h
+ * @author Mike Scott
+ * @date 28th Novemebr 2018
+ * @brief BLS Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef BLS192_ZZZ_H
+#define BLS192_ZZZ_H
+
+#include "pair4_ZZZ.h"
+
+using namespace core;
+
+namespace ZZZ {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define BGS_ZZZ MODBYTES_XXX  /**< BLS Group Size */
+#define BFS_ZZZ MODBYTES_XXX  /**< BLS Field Size */
+
+#define BLS_OK           0  /**< Function completed without error */
+#define BLS_FAIL        -1  /**< Point is NOT on the curve */
+
+/* BLS API functions */
+
+/** @brief Initialise BLS
+ *
+    @return BLS_OK if worked, otherwise BLS_FAIL
+ */
+int BLS_INIT();
+
+/** @brief Generate Key Pair
+ *
+    @param IKM contains truly random keying material
+    @param S on output a private key
+    @param W on output a public key = S*G, where G is fixed generator
+    @return BLS_OK
+ */
+int BLS_KEY_PAIR_GENERATE(octet *IKM, octet* S, octet *W);
+
+/** @brief Calculate a signature
+ *
+    @param SIG the ouput signature
+    @param M is the message to be signed
+    @param S an input private key
+    @return BLS_OK
+ */
+int BLS_CORE_SIGN(octet *SIG, octet *M, octet *S);
+
+/** @brief Verify a signature
+ *
+    @param SIG an input signature
+    @param M is the message whose signature is to be verified.
+    @param W an public key
+    @return BLS_OK if verified, otherwise BLS_FAIL
+ */
+int BLS_CORE_VERIFY(octet *SIG, octet *M, octet *W);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/bls192_BLS24479.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/bls192_BLS24479.h
new file mode 100644
index 0000000..b7302de
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/bls192_BLS24479.h
@@ -0,0 +1,86 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file bls192.h
+ * @author Mike Scott
+ * @date 28th Novemebr 2018
+ * @brief BLS Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef BLS192_BLS24479_H
+#define BLS192_BLS24479_H
+
+#include "pair4_BLS24479.h"
+
+using namespace core;
+
+namespace BLS24479 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define BGS_BLS24479 MODBYTES_B480_56  /**< BLS Group Size */
+#define BFS_BLS24479 MODBYTES_B480_56  /**< BLS Field Size */
+
+#define BLS_OK           0  /**< Function completed without error */
+#define BLS_FAIL        -1  /**< Point is NOT on the curve */
+
+/* BLS API functions */
+
+/** @brief Initialise BLS
+ *
+    @return BLS_OK if worked, otherwise BLS_FAIL
+ */
+int BLS_INIT();
+
+/** @brief Generate Key Pair
+ *
+    @param IKM contains truly random keying material
+    @param S on output a private key
+    @param W on output a public key = S*G, where G is fixed generator
+    @return BLS_OK
+ */
+int BLS_KEY_PAIR_GENERATE(octet *IKM, octet* S, octet *W);
+
+/** @brief Calculate a signature
+ *
+    @param SIG the ouput signature
+    @param M is the message to be signed
+    @param S an input private key
+    @return BLS_OK
+ */
+int BLS_CORE_SIGN(octet *SIG, octet *M, octet *S);
+
+/** @brief Verify a signature
+ *
+    @param SIG an input signature
+    @param M is the message whose signature is to be verified.
+    @param W an public key
+    @return BLS_OK if verified, otherwise BLS_FAIL
+ */
+int BLS_CORE_VERIFY(octet *SIG, octet *M, octet *W);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/bls256.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/bls256.h
new file mode 100644
index 0000000..97a8031
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/bls256.h
@@ -0,0 +1,86 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file bls256.h
+ * @author Mike Scott
+ * @date 28th Novemebr 2018
+ * @brief BLS Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef BLS256_ZZZ_H
+#define BLS256_ZZZ_H
+
+#include "pair8_ZZZ.h"
+
+using namespace core;
+
+namespace ZZZ {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define BGS_ZZZ MODBYTES_XXX  /**< BLS Group Size */
+#define BFS_ZZZ MODBYTES_XXX  /**< BLS Field Size */
+
+#define BLS_OK           0  /**< Function completed without error */
+#define BLS_FAIL        -1  /**< Point is NOT on the curve */
+
+/* BLS API functions */
+
+/** @brief Initialise BLS
+ *
+    @return BLS_OK if worked, otherwise BLS_FAIL
+ */
+int BLS_INIT();
+
+/** @brief Generate Key Pair
+ *
+    @param IKM contains truly random keying material
+    @param S on output a private key
+    @param W on output a public key = S*G, where G is fixed generator
+    @return BLS_OK
+ */
+int BLS_KEY_PAIR_GENERATE(octet *IKM, octet* S, octet *W);
+
+/** @brief Calculate a signature
+ *
+    @param SIG the ouput signature
+    @param m is the message to be signed
+    @param S an input private key
+    @return BLS_OK
+ */
+int BLS_CORE_SIGN(octet *SIG, octet *M, octet *S);
+
+/** @brief Verify a signature
+ *
+    @param SIG an input signature
+    @param m is the message whose signature is to be verified.
+    @param W an public key
+    @return BLS_OK if verified, otherwise BLS_FAIL
+ */
+int BLS_CORE_VERIFY(octet *SIG, octet *M, octet *W);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/bls256_BLS48286.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/bls256_BLS48286.h
new file mode 100644
index 0000000..832a844
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/bls256_BLS48286.h
@@ -0,0 +1,86 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file bls256.h
+ * @author Mike Scott
+ * @date 28th Novemebr 2018
+ * @brief BLS Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef BLS256_BLS48286_H
+#define BLS256_BLS48286_H
+
+#include "pair8_BLS48286.h"
+
+using namespace core;
+
+namespace BLS48286 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define BGS_BLS48286 MODBYTES_B288_60  /**< BLS Group Size */
+#define BFS_BLS48286 MODBYTES_B288_60  /**< BLS Field Size */
+
+#define BLS_OK           0  /**< Function completed without error */
+#define BLS_FAIL        -1  /**< Point is NOT on the curve */
+
+/* BLS API functions */
+
+/** @brief Initialise BLS
+ *
+    @return BLS_OK if worked, otherwise BLS_FAIL
+ */
+int BLS_INIT();
+
+/** @brief Generate Key Pair
+ *
+    @param IKM contains truly random keying material
+    @param S on output a private key
+    @param W on output a public key = S*G, where G is fixed generator
+    @return BLS_OK
+ */
+int BLS_KEY_PAIR_GENERATE(octet *IKM, octet* S, octet *W);
+
+/** @brief Calculate a signature
+ *
+    @param SIG the ouput signature
+    @param m is the message to be signed
+    @param S an input private key
+    @return BLS_OK
+ */
+int BLS_CORE_SIGN(octet *SIG, octet *M, octet *S);
+
+/** @brief Verify a signature
+ *
+    @param SIG an input signature
+    @param m is the message whose signature is to be verified.
+    @param W an public key
+    @return BLS_OK if verified, otherwise BLS_FAIL
+ */
+int BLS_CORE_VERIFY(octet *SIG, octet *M, octet *W);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/bls256_BLS48556.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/bls256_BLS48556.h
new file mode 100644
index 0000000..3173645
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/bls256_BLS48556.h
@@ -0,0 +1,86 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file bls256.h
+ * @author Mike Scott
+ * @date 28th Novemebr 2018
+ * @brief BLS Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef BLS256_BLS48556_H
+#define BLS256_BLS48556_H
+
+#include "pair8_BLS48556.h"
+
+using namespace core;
+
+namespace BLS48556 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define BGS_BLS48556 MODBYTES_B560_58  /**< BLS Group Size */
+#define BFS_BLS48556 MODBYTES_B560_58  /**< BLS Field Size */
+
+#define BLS_OK           0  /**< Function completed without error */
+#define BLS_FAIL        -1  /**< Point is NOT on the curve */
+
+/* BLS API functions */
+
+/** @brief Initialise BLS
+ *
+    @return BLS_OK if worked, otherwise BLS_FAIL
+ */
+int BLS_INIT();
+
+/** @brief Generate Key Pair
+ *
+    @param IKM contains truly random keying material
+    @param S on output a private key
+    @param W on output a public key = S*G, where G is fixed generator
+    @return BLS_OK
+ */
+int BLS_KEY_PAIR_GENERATE(octet *IKM, octet* S, octet *W);
+
+/** @brief Calculate a signature
+ *
+    @param SIG the ouput signature
+    @param m is the message to be signed
+    @param S an input private key
+    @return BLS_OK
+ */
+int BLS_CORE_SIGN(octet *SIG, octet *M, octet *S);
+
+/** @brief Verify a signature
+ *
+    @param SIG an input signature
+    @param m is the message whose signature is to be verified.
+    @param W an public key
+    @return BLS_OK if verified, otherwise BLS_FAIL
+ */
+int BLS_CORE_VERIFY(octet *SIG, octet *M, octet *W);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/bls256_BLS48581.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/bls256_BLS48581.h
new file mode 100644
index 0000000..c868eae
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/bls256_BLS48581.h
@@ -0,0 +1,86 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file bls256.h
+ * @author Mike Scott
+ * @date 28th Novemebr 2018
+ * @brief BLS Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef BLS256_BLS48581_H
+#define BLS256_BLS48581_H
+
+#include "pair8_BLS48581.h"
+
+using namespace core;
+
+namespace BLS48581 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define BGS_BLS48581 MODBYTES_B584_60  /**< BLS Group Size */
+#define BFS_BLS48581 MODBYTES_B584_60  /**< BLS Field Size */
+
+#define BLS_OK           0  /**< Function completed without error */
+#define BLS_FAIL        -1  /**< Point is NOT on the curve */
+
+/* BLS API functions */
+
+/** @brief Initialise BLS
+ *
+    @return BLS_OK if worked, otherwise BLS_FAIL
+ */
+int BLS_INIT();
+
+/** @brief Generate Key Pair
+ *
+    @param IKM contains truly random keying material
+    @param S on output a private key
+    @param W on output a public key = S*G, where G is fixed generator
+    @return BLS_OK
+ */
+int BLS_KEY_PAIR_GENERATE(octet *IKM, octet* S, octet *W);
+
+/** @brief Calculate a signature
+ *
+    @param SIG the ouput signature
+    @param m is the message to be signed
+    @param S an input private key
+    @return BLS_OK
+ */
+int BLS_CORE_SIGN(octet *SIG, octet *M, octet *S);
+
+/** @brief Verify a signature
+ *
+    @param SIG an input signature
+    @param m is the message whose signature is to be verified.
+    @param W an public key
+    @return BLS_OK if verified, otherwise BLS_FAIL
+ */
+int BLS_CORE_VERIFY(octet *SIG, octet *M, octet *W);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/bls_BLS12381.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/bls_BLS12381.h
new file mode 100644
index 0000000..de31cce
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/bls_BLS12381.h
@@ -0,0 +1,87 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file bls.h
+ * @author Mike Scott
+ * @date 28th Novemebr 2018
+ * @brief BLS Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef BLS_BLS12381_H
+#define BLS_BLS12381_H
+
+#include "pair_BLS12381.h"
+
+using namespace core;
+
+namespace BLS12381 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define BGS_BLS12381 MODBYTES_B384_58  /**< BLS Group Size */
+#define BFS_BLS12381 MODBYTES_B384_58  /**< BLS Field Size */
+
+#define BLS_OK           0  /**< Function completed without error */
+#define BLS_FAIL        -1  /**< Point is NOT on the curve */
+
+/* BLS API functions */
+
+
+/** @brief Initialise BLS
+ *
+    @return BLS_OK if worked, otherwise BLS_FAIL
+ */
+int BLS_INIT();
+
+/** @brief Generate Key Pair
+ *
+    @param IKM contains truly random keying material
+    @param S on output a private key
+    @param W on output a public key = S*G, where G is fixed generator
+    @return BLS_OK
+ */
+int BLS_KEY_PAIR_GENERATE(octet *IKM, octet* S, octet *W);
+
+/** @brief Calculate a signature
+ *
+    @param SIG the ouput signature
+    @param M is the message to be signed
+    @param S an input private key
+    @return BLS_OK
+ */
+int BLS_CORE_SIGN(octet *SIG, octet *M, octet *S);
+
+/** @brief Verify a signature
+ *
+    @param SIG an input signature
+    @param M is the message whose signature is to be verified.
+    @param W an public key
+    @return BLS_OK if verified, otherwise BLS_FAIL
+ */
+int BLS_CORE_VERIFY(octet *SIG, octet *M, octet *W);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/bls_BLS12383.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/bls_BLS12383.h
new file mode 100644
index 0000000..4eda3f3
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/bls_BLS12383.h
@@ -0,0 +1,87 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file bls.h
+ * @author Mike Scott
+ * @date 28th Novemebr 2018
+ * @brief BLS Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef BLS_BLS12383_H
+#define BLS_BLS12383_H
+
+#include "pair_BLS12383.h"
+
+using namespace core;
+
+namespace BLS12383 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define BGS_BLS12383 MODBYTES_B384_58  /**< BLS Group Size */
+#define BFS_BLS12383 MODBYTES_B384_58  /**< BLS Field Size */
+
+#define BLS_OK           0  /**< Function completed without error */
+#define BLS_FAIL        -1  /**< Point is NOT on the curve */
+
+/* BLS API functions */
+
+
+/** @brief Initialise BLS
+ *
+    @return BLS_OK if worked, otherwise BLS_FAIL
+ */
+int BLS_INIT();
+
+/** @brief Generate Key Pair
+ *
+    @param IKM contains truly random keying material
+    @param S on output a private key
+    @param W on output a public key = S*G, where G is fixed generator
+    @return BLS_OK
+ */
+int BLS_KEY_PAIR_GENERATE(octet *IKM, octet* S, octet *W);
+
+/** @brief Calculate a signature
+ *
+    @param SIG the ouput signature
+    @param M is the message to be signed
+    @param S an input private key
+    @return BLS_OK
+ */
+int BLS_CORE_SIGN(octet *SIG, octet *M, octet *S);
+
+/** @brief Verify a signature
+ *
+    @param SIG an input signature
+    @param M is the message whose signature is to be verified.
+    @param W an public key
+    @return BLS_OK if verified, otherwise BLS_FAIL
+ */
+int BLS_CORE_VERIFY(octet *SIG, octet *M, octet *W);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/bls_BLS12443.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/bls_BLS12443.h
new file mode 100644
index 0000000..2d14991
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/bls_BLS12443.h
@@ -0,0 +1,87 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file bls.h
+ * @author Mike Scott
+ * @date 28th Novemebr 2018
+ * @brief BLS Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef BLS_BLS12443_H
+#define BLS_BLS12443_H
+
+#include "pair_BLS12443.h"
+
+using namespace core;
+
+namespace BLS12443 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define BGS_BLS12443 MODBYTES_B448_60  /**< BLS Group Size */
+#define BFS_BLS12443 MODBYTES_B448_60  /**< BLS Field Size */
+
+#define BLS_OK           0  /**< Function completed without error */
+#define BLS_FAIL        -1  /**< Point is NOT on the curve */
+
+/* BLS API functions */
+
+
+/** @brief Initialise BLS
+ *
+    @return BLS_OK if worked, otherwise BLS_FAIL
+ */
+int BLS_INIT();
+
+/** @brief Generate Key Pair
+ *
+    @param IKM contains truly random keying material
+    @param S on output a private key
+    @param W on output a public key = S*G, where G is fixed generator
+    @return BLS_OK
+ */
+int BLS_KEY_PAIR_GENERATE(octet *IKM, octet* S, octet *W);
+
+/** @brief Calculate a signature
+ *
+    @param SIG the ouput signature
+    @param M is the message to be signed
+    @param S an input private key
+    @return BLS_OK
+ */
+int BLS_CORE_SIGN(octet *SIG, octet *M, octet *S);
+
+/** @brief Verify a signature
+ *
+    @param SIG an input signature
+    @param M is the message whose signature is to be verified.
+    @param W an public key
+    @return BLS_OK if verified, otherwise BLS_FAIL
+ */
+int BLS_CORE_VERIFY(octet *SIG, octet *M, octet *W);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/bls_BLS12461.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/bls_BLS12461.h
new file mode 100644
index 0000000..03a7e2c
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/bls_BLS12461.h
@@ -0,0 +1,87 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file bls.h
+ * @author Mike Scott
+ * @date 28th Novemebr 2018
+ * @brief BLS Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef BLS_BLS12461_H
+#define BLS_BLS12461_H
+
+#include "pair_BLS12461.h"
+
+using namespace core;
+
+namespace BLS12461 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define BGS_BLS12461 MODBYTES_B464_60  /**< BLS Group Size */
+#define BFS_BLS12461 MODBYTES_B464_60  /**< BLS Field Size */
+
+#define BLS_OK           0  /**< Function completed without error */
+#define BLS_FAIL        -1  /**< Point is NOT on the curve */
+
+/* BLS API functions */
+
+
+/** @brief Initialise BLS
+ *
+    @return BLS_OK if worked, otherwise BLS_FAIL
+ */
+int BLS_INIT();
+
+/** @brief Generate Key Pair
+ *
+    @param IKM contains truly random keying material
+    @param S on output a private key
+    @param W on output a public key = S*G, where G is fixed generator
+    @return BLS_OK
+ */
+int BLS_KEY_PAIR_GENERATE(octet *IKM, octet* S, octet *W);
+
+/** @brief Calculate a signature
+ *
+    @param SIG the ouput signature
+    @param M is the message to be signed
+    @param S an input private key
+    @return BLS_OK
+ */
+int BLS_CORE_SIGN(octet *SIG, octet *M, octet *S);
+
+/** @brief Verify a signature
+ *
+    @param SIG an input signature
+    @param M is the message whose signature is to be verified.
+    @param W an public key
+    @return BLS_OK if verified, otherwise BLS_FAIL
+ */
+int BLS_CORE_VERIFY(octet *SIG, octet *M, octet *W);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/bls_BN158.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/bls_BN158.h
new file mode 100644
index 0000000..f19142d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/bls_BN158.h
@@ -0,0 +1,87 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file bls.h
+ * @author Mike Scott
+ * @date 28th Novemebr 2018
+ * @brief BLS Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef BLS_BN158_H
+#define BLS_BN158_H
+
+#include "pair_BN158.h"
+
+using namespace core;
+
+namespace BN158 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define BGS_BN158 MODBYTES_B160_56  /**< BLS Group Size */
+#define BFS_BN158 MODBYTES_B160_56  /**< BLS Field Size */
+
+#define BLS_OK           0  /**< Function completed without error */
+#define BLS_FAIL        -1  /**< Point is NOT on the curve */
+
+/* BLS API functions */
+
+
+/** @brief Initialise BLS
+ *
+    @return BLS_OK if worked, otherwise BLS_FAIL
+ */
+int BLS_INIT();
+
+/** @brief Generate Key Pair
+ *
+    @param IKM contains truly random keying material
+    @param S on output a private key
+    @param W on output a public key = S*G, where G is fixed generator
+    @return BLS_OK
+ */
+int BLS_KEY_PAIR_GENERATE(octet *IKM, octet* S, octet *W);
+
+/** @brief Calculate a signature
+ *
+    @param SIG the ouput signature
+    @param M is the message to be signed
+    @param S an input private key
+    @return BLS_OK
+ */
+int BLS_CORE_SIGN(octet *SIG, octet *M, octet *S);
+
+/** @brief Verify a signature
+ *
+    @param SIG an input signature
+    @param M is the message whose signature is to be verified.
+    @param W an public key
+    @return BLS_OK if verified, otherwise BLS_FAIL
+ */
+int BLS_CORE_VERIFY(octet *SIG, octet *M, octet *W);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/bls_BN254.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/bls_BN254.h
new file mode 100644
index 0000000..f331731
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/bls_BN254.h
@@ -0,0 +1,87 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file bls.h
+ * @author Mike Scott
+ * @date 28th Novemebr 2018
+ * @brief BLS Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef BLS_BN254_H
+#define BLS_BN254_H
+
+#include "pair_BN254.h"
+
+using namespace core;
+
+namespace BN254 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define BGS_BN254 MODBYTES_B256_56  /**< BLS Group Size */
+#define BFS_BN254 MODBYTES_B256_56  /**< BLS Field Size */
+
+#define BLS_OK           0  /**< Function completed without error */
+#define BLS_FAIL        -1  /**< Point is NOT on the curve */
+
+/* BLS API functions */
+
+
+/** @brief Initialise BLS
+ *
+    @return BLS_OK if worked, otherwise BLS_FAIL
+ */
+int BLS_INIT();
+
+/** @brief Generate Key Pair
+ *
+    @param IKM contains truly random keying material
+    @param S on output a private key
+    @param W on output a public key = S*G, where G is fixed generator
+    @return BLS_OK
+ */
+int BLS_KEY_PAIR_GENERATE(octet *IKM, octet* S, octet *W);
+
+/** @brief Calculate a signature
+ *
+    @param SIG the ouput signature
+    @param M is the message to be signed
+    @param S an input private key
+    @return BLS_OK
+ */
+int BLS_CORE_SIGN(octet *SIG, octet *M, octet *S);
+
+/** @brief Verify a signature
+ *
+    @param SIG an input signature
+    @param M is the message whose signature is to be verified.
+    @param W an public key
+    @return BLS_OK if verified, otherwise BLS_FAIL
+ */
+int BLS_CORE_VERIFY(octet *SIG, octet *M, octet *W);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/bls_BN254CX.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/bls_BN254CX.h
new file mode 100644
index 0000000..10b3b3d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/bls_BN254CX.h
@@ -0,0 +1,87 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file bls.h
+ * @author Mike Scott
+ * @date 28th Novemebr 2018
+ * @brief BLS Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef BLS_BN254CX_H
+#define BLS_BN254CX_H
+
+#include "pair_BN254CX.h"
+
+using namespace core;
+
+namespace BN254CX {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define BGS_BN254CX MODBYTES_B256_56  /**< BLS Group Size */
+#define BFS_BN254CX MODBYTES_B256_56  /**< BLS Field Size */
+
+#define BLS_OK           0  /**< Function completed without error */
+#define BLS_FAIL        -1  /**< Point is NOT on the curve */
+
+/* BLS API functions */
+
+
+/** @brief Initialise BLS
+ *
+    @return BLS_OK if worked, otherwise BLS_FAIL
+ */
+int BLS_INIT();
+
+/** @brief Generate Key Pair
+ *
+    @param IKM contains truly random keying material
+    @param S on output a private key
+    @param W on output a public key = S*G, where G is fixed generator
+    @return BLS_OK
+ */
+int BLS_KEY_PAIR_GENERATE(octet *IKM, octet* S, octet *W);
+
+/** @brief Calculate a signature
+ *
+    @param SIG the ouput signature
+    @param M is the message to be signed
+    @param S an input private key
+    @return BLS_OK
+ */
+int BLS_CORE_SIGN(octet *SIG, octet *M, octet *S);
+
+/** @brief Verify a signature
+ *
+    @param SIG an input signature
+    @param M is the message whose signature is to be verified.
+    @param W an public key
+    @return BLS_OK if verified, otherwise BLS_FAIL
+ */
+int BLS_CORE_VERIFY(octet *SIG, octet *M, octet *W);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/bls_BN462.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/bls_BN462.h
new file mode 100644
index 0000000..5563582
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/bls_BN462.h
@@ -0,0 +1,87 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file bls.h
+ * @author Mike Scott
+ * @date 28th Novemebr 2018
+ * @brief BLS Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef BLS_BN462_H
+#define BLS_BN462_H
+
+#include "pair_BN462.h"
+
+using namespace core;
+
+namespace BN462 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define BGS_BN462 MODBYTES_B464_60  /**< BLS Group Size */
+#define BFS_BN462 MODBYTES_B464_60  /**< BLS Field Size */
+
+#define BLS_OK           0  /**< Function completed without error */
+#define BLS_FAIL        -1  /**< Point is NOT on the curve */
+
+/* BLS API functions */
+
+
+/** @brief Initialise BLS
+ *
+    @return BLS_OK if worked, otherwise BLS_FAIL
+ */
+int BLS_INIT();
+
+/** @brief Generate Key Pair
+ *
+    @param IKM contains truly random keying material
+    @param S on output a private key
+    @param W on output a public key = S*G, where G is fixed generator
+    @return BLS_OK
+ */
+int BLS_KEY_PAIR_GENERATE(octet *IKM, octet* S, octet *W);
+
+/** @brief Calculate a signature
+ *
+    @param SIG the ouput signature
+    @param M is the message to be signed
+    @param S an input private key
+    @return BLS_OK
+ */
+int BLS_CORE_SIGN(octet *SIG, octet *M, octet *S);
+
+/** @brief Verify a signature
+ *
+    @param SIG an input signature
+    @param M is the message whose signature is to be verified.
+    @param W an public key
+    @return BLS_OK if verified, otherwise BLS_FAIL
+ */
+int BLS_CORE_VERIFY(octet *SIG, octet *M, octet *W);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/bls_FP256BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/bls_FP256BN.h
new file mode 100644
index 0000000..ab661b5
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/bls_FP256BN.h
@@ -0,0 +1,87 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file bls.h
+ * @author Mike Scott
+ * @date 28th Novemebr 2018
+ * @brief BLS Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef BLS_FP256BN_H
+#define BLS_FP256BN_H
+
+#include "pair_FP256BN.h"
+
+using namespace core;
+
+namespace FP256BN {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define BGS_FP256BN MODBYTES_B256_56  /**< BLS Group Size */
+#define BFS_FP256BN MODBYTES_B256_56  /**< BLS Field Size */
+
+#define BLS_OK           0  /**< Function completed without error */
+#define BLS_FAIL        -1  /**< Point is NOT on the curve */
+
+/* BLS API functions */
+
+
+/** @brief Initialise BLS
+ *
+    @return BLS_OK if worked, otherwise BLS_FAIL
+ */
+int BLS_INIT();
+
+/** @brief Generate Key Pair
+ *
+    @param IKM contains truly random keying material
+    @param S on output a private key
+    @param W on output a public key = S*G, where G is fixed generator
+    @return BLS_OK
+ */
+int BLS_KEY_PAIR_GENERATE(octet *IKM, octet* S, octet *W);
+
+/** @brief Calculate a signature
+ *
+    @param SIG the ouput signature
+    @param M is the message to be signed
+    @param S an input private key
+    @return BLS_OK
+ */
+int BLS_CORE_SIGN(octet *SIG, octet *M, octet *S);
+
+/** @brief Verify a signature
+ *
+    @param SIG an input signature
+    @param M is the message whose signature is to be verified.
+    @param W an public key
+    @return BLS_OK if verified, otherwise BLS_FAIL
+ */
+int BLS_CORE_VERIFY(octet *SIG, octet *M, octet *W);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/bls_FP512BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/bls_FP512BN.h
new file mode 100644
index 0000000..1459b24
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/bls_FP512BN.h
@@ -0,0 +1,87 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file bls.h
+ * @author Mike Scott
+ * @date 28th Novemebr 2018
+ * @brief BLS Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef BLS_FP512BN_H
+#define BLS_FP512BN_H
+
+#include "pair_FP512BN.h"
+
+using namespace core;
+
+namespace FP512BN {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define BGS_FP512BN MODBYTES_B512_60  /**< BLS Group Size */
+#define BFS_FP512BN MODBYTES_B512_60  /**< BLS Field Size */
+
+#define BLS_OK           0  /**< Function completed without error */
+#define BLS_FAIL        -1  /**< Point is NOT on the curve */
+
+/* BLS API functions */
+
+
+/** @brief Initialise BLS
+ *
+    @return BLS_OK if worked, otherwise BLS_FAIL
+ */
+int BLS_INIT();
+
+/** @brief Generate Key Pair
+ *
+    @param IKM contains truly random keying material
+    @param S on output a private key
+    @param W on output a public key = S*G, where G is fixed generator
+    @return BLS_OK
+ */
+int BLS_KEY_PAIR_GENERATE(octet *IKM, octet* S, octet *W);
+
+/** @brief Calculate a signature
+ *
+    @param SIG the ouput signature
+    @param M is the message to be signed
+    @param S an input private key
+    @return BLS_OK
+ */
+int BLS_CORE_SIGN(octet *SIG, octet *M, octet *S);
+
+/** @brief Verify a signature
+ *
+    @param SIG an input signature
+    @param M is the message whose signature is to be verified.
+    @param W an public key
+    @return BLS_OK if verified, otherwise BLS_FAIL
+ */
+int BLS_CORE_VERIFY(octet *SIG, octet *M, octet *W);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_big.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_big.h
new file mode 100644
index 0000000..ce262ec
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_big.h
@@ -0,0 +1,31 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_BIG_XXX_H
+#define CONFIG_BIG_XXX_H
+
+#include"core.h"
+
+// BIG stuff
+
+#define MODBYTES_XXX @NB@
+#define BASEBITS_XXX @BASE@
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_big_B160_56.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_big_B160_56.h
new file mode 100644
index 0000000..3c3e9e7
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_big_B160_56.h
@@ -0,0 +1,31 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_BIG_B160_56_H
+#define CONFIG_BIG_B160_56_H
+
+#include"core.h"
+
+// BIG stuff
+
+#define MODBYTES_B160_56 20
+#define BASEBITS_B160_56 56
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_big_B168_60.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_big_B168_60.h
new file mode 100644
index 0000000..5cc2f30
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_big_B168_60.h
@@ -0,0 +1,31 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_BIG_B168_60_H
+#define CONFIG_BIG_B168_60_H
+
+#include"core.h"
+
+// BIG stuff
+
+#define MODBYTES_B168_60 21
+#define BASEBITS_B168_60 60
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_big_B256_56.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_big_B256_56.h
new file mode 100644
index 0000000..64d8b22
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_big_B256_56.h
@@ -0,0 +1,31 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_BIG_B256_56_H
+#define CONFIG_BIG_B256_56_H
+
+#include"core.h"
+
+// BIG stuff
+
+#define MODBYTES_B256_56 32
+#define BASEBITS_B256_56 56
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_big_B288_60.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_big_B288_60.h
new file mode 100644
index 0000000..135663e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_big_B288_60.h
@@ -0,0 +1,31 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_BIG_B288_60_H
+#define CONFIG_BIG_B288_60_H
+
+#include"core.h"
+
+// BIG stuff
+
+#define MODBYTES_B288_60 36
+#define BASEBITS_B288_60 60
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_big_B336_60.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_big_B336_60.h
new file mode 100644
index 0000000..db7c7bd
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_big_B336_60.h
@@ -0,0 +1,31 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_BIG_B336_60_H
+#define CONFIG_BIG_B336_60_H
+
+#include"core.h"
+
+// BIG stuff
+
+#define MODBYTES_B336_60 42
+#define BASEBITS_B336_60 60
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_big_B384_56.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_big_B384_56.h
new file mode 100644
index 0000000..8c707de
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_big_B384_56.h
@@ -0,0 +1,31 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_BIG_B384_56_H
+#define CONFIG_BIG_B384_56_H
+
+#include"core.h"
+
+// BIG stuff
+
+#define MODBYTES_B384_56 48
+#define BASEBITS_B384_56 56
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_big_B384_58.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_big_B384_58.h
new file mode 100644
index 0000000..abc05bb
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_big_B384_58.h
@@ -0,0 +1,31 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_BIG_B384_58_H
+#define CONFIG_BIG_B384_58_H
+
+#include"core.h"
+
+// BIG stuff
+
+#define MODBYTES_B384_58 48
+#define BASEBITS_B384_58 58
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_big_B416_60.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_big_B416_60.h
new file mode 100644
index 0000000..f57fbe9
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_big_B416_60.h
@@ -0,0 +1,31 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_BIG_B416_60_H
+#define CONFIG_BIG_B416_60_H
+
+#include"core.h"
+
+// BIG stuff
+
+#define MODBYTES_B416_60 52
+#define BASEBITS_B416_60 60
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_big_B448_58.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_big_B448_58.h
new file mode 100644
index 0000000..bd3d2fa
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_big_B448_58.h
@@ -0,0 +1,31 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_BIG_B448_58_H
+#define CONFIG_BIG_B448_58_H
+
+#include"core.h"
+
+// BIG stuff
+
+#define MODBYTES_B448_58 56
+#define BASEBITS_B448_58 58
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_big_B448_60.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_big_B448_60.h
new file mode 100644
index 0000000..622ae94
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_big_B448_60.h
@@ -0,0 +1,31 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_BIG_B448_60_H
+#define CONFIG_BIG_B448_60_H
+
+#include"core.h"
+
+// BIG stuff
+
+#define MODBYTES_B448_60 56
+#define BASEBITS_B448_60 60
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_big_B464_60.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_big_B464_60.h
new file mode 100644
index 0000000..558d678
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_big_B464_60.h
@@ -0,0 +1,31 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_BIG_B464_60_H
+#define CONFIG_BIG_B464_60_H
+
+#include"core.h"
+
+// BIG stuff
+
+#define MODBYTES_B464_60 58
+#define BASEBITS_B464_60 60
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_big_B480_56.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_big_B480_56.h
new file mode 100644
index 0000000..c7e730c
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_big_B480_56.h
@@ -0,0 +1,31 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_BIG_B480_56_H
+#define CONFIG_BIG_B480_56_H
+
+#include"core.h"
+
+// BIG stuff
+
+#define MODBYTES_B480_56 60
+#define BASEBITS_B480_56 56
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_big_B512_60.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_big_B512_60.h
new file mode 100644
index 0000000..180f4ab
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_big_B512_60.h
@@ -0,0 +1,31 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_BIG_B512_60_H
+#define CONFIG_BIG_B512_60_H
+
+#include"core.h"
+
+// BIG stuff
+
+#define MODBYTES_B512_60 64
+#define BASEBITS_B512_60 60
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_big_B528_60.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_big_B528_60.h
new file mode 100644
index 0000000..334db43
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_big_B528_60.h
@@ -0,0 +1,31 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_BIG_B528_60_H
+#define CONFIG_BIG_B528_60_H
+
+#include"core.h"
+
+// BIG stuff
+
+#define MODBYTES_B528_60 66
+#define BASEBITS_B528_60 60
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_big_B560_58.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_big_B560_58.h
new file mode 100644
index 0000000..4157e14
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_big_B560_58.h
@@ -0,0 +1,31 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_BIG_B560_58_H
+#define CONFIG_BIG_B560_58_H
+
+#include"core.h"
+
+// BIG stuff
+
+#define MODBYTES_B560_58 70
+#define BASEBITS_B560_58 58
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_big_B584_60.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_big_B584_60.h
new file mode 100644
index 0000000..5e611b3
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_big_B584_60.h
@@ -0,0 +1,31 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_BIG_B584_60_H
+#define CONFIG_BIG_B584_60_H
+
+#include"core.h"
+
+// BIG stuff
+
+#define MODBYTES_B584_60 73
+#define BASEBITS_B584_60 60
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve.h
new file mode 100644
index 0000000..d7858d8
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_ZZZ_H
+#define CONFIG_CURVE_ZZZ_H
+
+#include"core.h"
+#include"config_field_YYY.h"
+
+// ECP stuff
+
+#define CURVETYPE_ZZZ @CT@
+#define CURVE_A_ZZZ @CA@
+#define PAIRING_FRIENDLY_ZZZ @PF@
+#define CURVE_SECURITY_ZZZ @CS@
+#define HTC_ISO_ZZZ @HC@
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_ZZZ
+
+#if PAIRING_FRIENDLY_ZZZ != NOT_PF
+
+#define HTC_ISO_G2_ZZZ @HC2@
+
+#define USE_GLV_ZZZ   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_ZZZ /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_ZZZ /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_ZZZ @ST@
+#define SIGN_OF_X_ZZZ @SX@
+
+#define ATE_BITS_ZZZ @AB@
+#define G2_TABLE_ZZZ @G2@
+
+#endif
+
+
+#if CURVE_SECURITY_ZZZ == 128
+#define AESKEY_ZZZ 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_ZZZ SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_ZZZ == 192
+#define AESKEY_ZZZ 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_ZZZ SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_ZZZ == 256
+#define AESKEY_ZZZ 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_ZZZ SHA512  /**< Hash type */
+#endif
+
+
+namespace ZZZ_BIG = XXX;
+namespace ZZZ_FP = YYY;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_ANSSI.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_ANSSI.h
new file mode 100644
index 0000000..5fd0554
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_ANSSI.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_ANSSI_H
+#define CONFIG_CURVE_ANSSI_H
+
+#include"core.h"
+#include"config_field_ANSSI.h"
+
+// ECP stuff
+
+#define CURVETYPE_ANSSI WEIERSTRASS
+#define CURVE_A_ANSSI -3
+#define PAIRING_FRIENDLY_ANSSI NOT_PF
+#define CURVE_SECURITY_ANSSI 128
+#define HTC_ISO_ANSSI 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_ANSSI
+
+#if PAIRING_FRIENDLY_ANSSI != NOT_PF
+
+#define HTC_ISO_G2_ANSSI 0
+
+#define USE_GLV_ANSSI   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_ANSSI /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_ANSSI /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_ANSSI 
+#define SIGN_OF_X_ANSSI 
+
+#define ATE_BITS_ANSSI 
+#define G2_TABLE_ANSSI 
+
+#endif
+
+
+#if CURVE_SECURITY_ANSSI == 128
+#define AESKEY_ANSSI 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_ANSSI SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_ANSSI == 192
+#define AESKEY_ANSSI 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_ANSSI SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_ANSSI == 256
+#define AESKEY_ANSSI 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_ANSSI SHA512  /**< Hash type */
+#endif
+
+
+namespace ANSSI_BIG = B256_56;
+namespace ANSSI_FP = ANSSI;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_BLS12381.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_BLS12381.h
new file mode 100644
index 0000000..16c7f52
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_BLS12381.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_BLS12381_H
+#define CONFIG_CURVE_BLS12381_H
+
+#include"core.h"
+#include"config_field_BLS12381.h"
+
+// ECP stuff
+
+#define CURVETYPE_BLS12381 WEIERSTRASS
+#define CURVE_A_BLS12381 0
+#define PAIRING_FRIENDLY_BLS12381 BLS12_CURVE
+#define CURVE_SECURITY_BLS12381 128
+#define HTC_ISO_BLS12381 11
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_BLS12381
+
+#if PAIRING_FRIENDLY_BLS12381 != NOT_PF
+
+#define HTC_ISO_G2_BLS12381 3
+
+#define USE_GLV_BLS12381   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_BLS12381 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_BLS12381 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_BLS12381 M_TYPE
+#define SIGN_OF_X_BLS12381 NEGATIVEX
+
+#define ATE_BITS_BLS12381 65
+#define G2_TABLE_BLS12381 69
+
+#endif
+
+
+#if CURVE_SECURITY_BLS12381 == 128
+#define AESKEY_BLS12381 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_BLS12381 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BLS12381 == 192
+#define AESKEY_BLS12381 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_BLS12381 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BLS12381 == 256
+#define AESKEY_BLS12381 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_BLS12381 SHA512  /**< Hash type */
+#endif
+
+
+namespace BLS12381_BIG = B384_58;
+namespace BLS12381_FP = BLS12381;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_BLS12383.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_BLS12383.h
new file mode 100644
index 0000000..961080b
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_BLS12383.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_BLS12383_H
+#define CONFIG_CURVE_BLS12383_H
+
+#include"core.h"
+#include"config_field_BLS12383.h"
+
+// ECP stuff
+
+#define CURVETYPE_BLS12383 WEIERSTRASS
+#define CURVE_A_BLS12383 0
+#define PAIRING_FRIENDLY_BLS12383 BLS12_CURVE
+#define CURVE_SECURITY_BLS12383 128
+#define HTC_ISO_BLS12383 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_BLS12383
+
+#if PAIRING_FRIENDLY_BLS12383 != NOT_PF
+
+#define HTC_ISO_G2_BLS12383 0
+
+#define USE_GLV_BLS12383   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_BLS12383 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_BLS12383 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_BLS12383 M_TYPE
+#define SIGN_OF_X_BLS12383 POSITIVEX
+
+#define ATE_BITS_BLS12383 65
+#define G2_TABLE_BLS12383 68
+
+#endif
+
+
+#if CURVE_SECURITY_BLS12383 == 128
+#define AESKEY_BLS12383 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_BLS12383 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BLS12383 == 192
+#define AESKEY_BLS12383 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_BLS12383 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BLS12383 == 256
+#define AESKEY_BLS12383 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_BLS12383 SHA512  /**< Hash type */
+#endif
+
+
+namespace BLS12383_BIG = B384_58;
+namespace BLS12383_FP = BLS12383;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_BLS12443.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_BLS12443.h
new file mode 100644
index 0000000..f69036f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_BLS12443.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_BLS12443_H
+#define CONFIG_CURVE_BLS12443_H
+
+#include"core.h"
+#include"config_field_BLS12443.h"
+
+// ECP stuff
+
+#define CURVETYPE_BLS12443 WEIERSTRASS
+#define CURVE_A_BLS12443 0
+#define PAIRING_FRIENDLY_BLS12443 BLS12_CURVE
+#define CURVE_SECURITY_BLS12443 128
+#define HTC_ISO_BLS12443 11
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_BLS12443
+
+#if PAIRING_FRIENDLY_BLS12443 != NOT_PF
+
+#define HTC_ISO_G2_BLS12443 3
+
+#define USE_GLV_BLS12443   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_BLS12443 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_BLS12443 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_BLS12443 M_TYPE
+#define SIGN_OF_X_BLS12443 POSITIVEX
+
+#define ATE_BITS_BLS12443 75
+#define G2_TABLE_BLS12443 78
+
+#endif
+
+
+#if CURVE_SECURITY_BLS12443 == 128
+#define AESKEY_BLS12443 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_BLS12443 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BLS12443 == 192
+#define AESKEY_BLS12443 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_BLS12443 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BLS12443 == 256
+#define AESKEY_BLS12443 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_BLS12443 SHA512  /**< Hash type */
+#endif
+
+
+namespace BLS12443_BIG = B448_60;
+namespace BLS12443_FP = BLS12443;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_BLS12461.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_BLS12461.h
new file mode 100644
index 0000000..d98a7c6
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_BLS12461.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_BLS12461_H
+#define CONFIG_CURVE_BLS12461_H
+
+#include"core.h"
+#include"config_field_BLS12461.h"
+
+// ECP stuff
+
+#define CURVETYPE_BLS12461 WEIERSTRASS
+#define CURVE_A_BLS12461 0
+#define PAIRING_FRIENDLY_BLS12461 BLS12_CURVE
+#define CURVE_SECURITY_BLS12461 128
+#define HTC_ISO_BLS12461 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_BLS12461
+
+#if PAIRING_FRIENDLY_BLS12461 != NOT_PF
+
+#define HTC_ISO_G2_BLS12461 0
+
+#define USE_GLV_BLS12461   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_BLS12461 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_BLS12461 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_BLS12461 M_TYPE
+#define SIGN_OF_X_BLS12461 NEGATIVEX
+
+#define ATE_BITS_BLS12461 78
+#define G2_TABLE_BLS12461 79
+
+#endif
+
+
+#if CURVE_SECURITY_BLS12461 == 128
+#define AESKEY_BLS12461 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_BLS12461 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BLS12461 == 192
+#define AESKEY_BLS12461 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_BLS12461 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BLS12461 == 256
+#define AESKEY_BLS12461 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_BLS12461 SHA512  /**< Hash type */
+#endif
+
+
+namespace BLS12461_BIG = B464_60;
+namespace BLS12461_FP = BLS12461;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_BLS24479.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_BLS24479.h
new file mode 100644
index 0000000..15194b7
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_BLS24479.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_BLS24479_H
+#define CONFIG_CURVE_BLS24479_H
+
+#include"core.h"
+#include"config_field_BLS24479.h"
+
+// ECP stuff
+
+#define CURVETYPE_BLS24479 WEIERSTRASS
+#define CURVE_A_BLS24479 0
+#define PAIRING_FRIENDLY_BLS24479 BLS24_CURVE
+#define CURVE_SECURITY_BLS24479 192
+#define HTC_ISO_BLS24479 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_BLS24479
+
+#if PAIRING_FRIENDLY_BLS24479 != NOT_PF
+
+#define HTC_ISO_G2_BLS24479 0
+
+#define USE_GLV_BLS24479   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_BLS24479 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_BLS24479 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_BLS24479 M_TYPE
+#define SIGN_OF_X_BLS24479 POSITIVEX
+
+#define ATE_BITS_BLS24479 49
+#define G2_TABLE_BLS24479 52
+
+#endif
+
+
+#if CURVE_SECURITY_BLS24479 == 128
+#define AESKEY_BLS24479 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_BLS24479 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BLS24479 == 192
+#define AESKEY_BLS24479 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_BLS24479 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BLS24479 == 256
+#define AESKEY_BLS24479 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_BLS24479 SHA512  /**< Hash type */
+#endif
+
+
+namespace BLS24479_BIG = B480_56;
+namespace BLS24479_FP = BLS24479;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_BLS48286.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_BLS48286.h
new file mode 100644
index 0000000..90bbad7
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_BLS48286.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_BLS48286_H
+#define CONFIG_CURVE_BLS48286_H
+
+#include"core.h"
+#include"config_field_BLS48286.h"
+
+// ECP stuff
+
+#define CURVETYPE_BLS48286 WEIERSTRASS
+#define CURVE_A_BLS48286 0
+#define PAIRING_FRIENDLY_BLS48286 BLS48_CURVE
+#define CURVE_SECURITY_BLS48286 128
+#define HTC_ISO_BLS48286 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_BLS48286
+
+#if PAIRING_FRIENDLY_BLS48286 != NOT_PF
+
+#define HTC_ISO_G2_BLS48286 0
+
+#define USE_GLV_BLS48286   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_BLS48286 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_BLS48286 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_BLS48286 M_TYPE
+#define SIGN_OF_X_BLS48286 POSITIVEX
+
+#define ATE_BITS_BLS48286 17
+#define G2_TABLE_BLS48286 20
+
+#endif
+
+
+#if CURVE_SECURITY_BLS48286 == 128
+#define AESKEY_BLS48286 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_BLS48286 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BLS48286 == 192
+#define AESKEY_BLS48286 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_BLS48286 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BLS48286 == 256
+#define AESKEY_BLS48286 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_BLS48286 SHA512  /**< Hash type */
+#endif
+
+
+namespace BLS48286_BIG = B288_60;
+namespace BLS48286_FP = BLS48286;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_BLS48556.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_BLS48556.h
new file mode 100644
index 0000000..91e026b
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_BLS48556.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_BLS48556_H
+#define CONFIG_CURVE_BLS48556_H
+
+#include"core.h"
+#include"config_field_BLS48556.h"
+
+// ECP stuff
+
+#define CURVETYPE_BLS48556 WEIERSTRASS
+#define CURVE_A_BLS48556 0
+#define PAIRING_FRIENDLY_BLS48556 BLS48_CURVE
+#define CURVE_SECURITY_BLS48556 256
+#define HTC_ISO_BLS48556 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_BLS48556
+
+#if PAIRING_FRIENDLY_BLS48556 != NOT_PF
+
+#define HTC_ISO_G2_BLS48556 0
+
+#define USE_GLV_BLS48556   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_BLS48556 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_BLS48556 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_BLS48556 M_TYPE
+#define SIGN_OF_X_BLS48556 POSITIVEX
+
+#define ATE_BITS_BLS48556 32
+#define G2_TABLE_BLS48556 35
+
+#endif
+
+
+#if CURVE_SECURITY_BLS48556 == 128
+#define AESKEY_BLS48556 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_BLS48556 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BLS48556 == 192
+#define AESKEY_BLS48556 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_BLS48556 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BLS48556 == 256
+#define AESKEY_BLS48556 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_BLS48556 SHA512  /**< Hash type */
+#endif
+
+
+namespace BLS48556_BIG = B560_58;
+namespace BLS48556_FP = BLS48556;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_BLS48581.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_BLS48581.h
new file mode 100644
index 0000000..e74b07b
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_BLS48581.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_BLS48581_H
+#define CONFIG_CURVE_BLS48581_H
+
+#include"core.h"
+#include"config_field_BLS48581.h"
+
+// ECP stuff
+
+#define CURVETYPE_BLS48581 WEIERSTRASS
+#define CURVE_A_BLS48581 0
+#define PAIRING_FRIENDLY_BLS48581 BLS48_CURVE
+#define CURVE_SECURITY_BLS48581 256
+#define HTC_ISO_BLS48581 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_BLS48581
+
+#if PAIRING_FRIENDLY_BLS48581 != NOT_PF
+
+#define HTC_ISO_G2_BLS48581 0
+
+#define USE_GLV_BLS48581   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_BLS48581 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_BLS48581 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_BLS48581 D_TYPE
+#define SIGN_OF_X_BLS48581 NEGATIVEX
+
+#define ATE_BITS_BLS48581 33
+#define G2_TABLE_BLS48581 36
+
+#endif
+
+
+#if CURVE_SECURITY_BLS48581 == 128
+#define AESKEY_BLS48581 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_BLS48581 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BLS48581 == 192
+#define AESKEY_BLS48581 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_BLS48581 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BLS48581 == 256
+#define AESKEY_BLS48581 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_BLS48581 SHA512  /**< Hash type */
+#endif
+
+
+namespace BLS48581_BIG = B584_60;
+namespace BLS48581_FP = BLS48581;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_BN158.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_BN158.h
new file mode 100644
index 0000000..5a689fe
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_BN158.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_BN158_H
+#define CONFIG_CURVE_BN158_H
+
+#include"core.h"
+#include"config_field_BN158.h"
+
+// ECP stuff
+
+#define CURVETYPE_BN158 WEIERSTRASS
+#define CURVE_A_BN158 0
+#define PAIRING_FRIENDLY_BN158 BN_CURVE
+#define CURVE_SECURITY_BN158 128
+#define HTC_ISO_BN158 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_BN158
+
+#if PAIRING_FRIENDLY_BN158 != NOT_PF
+
+#define HTC_ISO_G2_BN158 0
+
+#define USE_GLV_BN158   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_BN158 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_BN158 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_BN158 M_TYPE
+#define SIGN_OF_X_BN158 NEGATIVEX
+
+#define ATE_BITS_BN158 42
+#define G2_TABLE_BN158 49
+
+#endif
+
+
+#if CURVE_SECURITY_BN158 == 128
+#define AESKEY_BN158 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_BN158 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BN158 == 192
+#define AESKEY_BN158 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_BN158 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BN158 == 256
+#define AESKEY_BN158 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_BN158 SHA512  /**< Hash type */
+#endif
+
+
+namespace BN158_BIG = B160_56;
+namespace BN158_FP = BN158;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_BN254.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_BN254.h
new file mode 100644
index 0000000..0432c16
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_BN254.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_BN254_H
+#define CONFIG_CURVE_BN254_H
+
+#include"core.h"
+#include"config_field_BN254.h"
+
+// ECP stuff
+
+#define CURVETYPE_BN254 WEIERSTRASS
+#define CURVE_A_BN254 0
+#define PAIRING_FRIENDLY_BN254 BN_CURVE
+#define CURVE_SECURITY_BN254 128
+#define HTC_ISO_BN254 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_BN254
+
+#if PAIRING_FRIENDLY_BN254 != NOT_PF
+
+#define HTC_ISO_G2_BN254 0
+
+#define USE_GLV_BN254   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_BN254 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_BN254 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_BN254 D_TYPE
+#define SIGN_OF_X_BN254 NEGATIVEX
+
+#define ATE_BITS_BN254 66
+#define G2_TABLE_BN254 71
+
+#endif
+
+
+#if CURVE_SECURITY_BN254 == 128
+#define AESKEY_BN254 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_BN254 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BN254 == 192
+#define AESKEY_BN254 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_BN254 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BN254 == 256
+#define AESKEY_BN254 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_BN254 SHA512  /**< Hash type */
+#endif
+
+
+namespace BN254_BIG = B256_56;
+namespace BN254_FP = BN254;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_BN254CX.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_BN254CX.h
new file mode 100644
index 0000000..af24e20
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_BN254CX.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_BN254CX_H
+#define CONFIG_CURVE_BN254CX_H
+
+#include"core.h"
+#include"config_field_BN254CX.h"
+
+// ECP stuff
+
+#define CURVETYPE_BN254CX WEIERSTRASS
+#define CURVE_A_BN254CX 0
+#define PAIRING_FRIENDLY_BN254CX BN_CURVE
+#define CURVE_SECURITY_BN254CX 128
+#define HTC_ISO_BN254CX 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_BN254CX
+
+#if PAIRING_FRIENDLY_BN254CX != NOT_PF
+
+#define HTC_ISO_G2_BN254CX 0
+
+#define USE_GLV_BN254CX   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_BN254CX /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_BN254CX /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_BN254CX D_TYPE
+#define SIGN_OF_X_BN254CX NEGATIVEX
+
+#define ATE_BITS_BN254CX 66
+#define G2_TABLE_BN254CX 76
+
+#endif
+
+
+#if CURVE_SECURITY_BN254CX == 128
+#define AESKEY_BN254CX 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_BN254CX SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BN254CX == 192
+#define AESKEY_BN254CX 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_BN254CX SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BN254CX == 256
+#define AESKEY_BN254CX 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_BN254CX SHA512  /**< Hash type */
+#endif
+
+
+namespace BN254CX_BIG = B256_56;
+namespace BN254CX_FP = BN254CX;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_BN462.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_BN462.h
new file mode 100644
index 0000000..db222d6
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_BN462.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_BN462_H
+#define CONFIG_CURVE_BN462_H
+
+#include"core.h"
+#include"config_field_BN462.h"
+
+// ECP stuff
+
+#define CURVETYPE_BN462 WEIERSTRASS
+#define CURVE_A_BN462 0
+#define PAIRING_FRIENDLY_BN462 BN_CURVE
+#define CURVE_SECURITY_BN462 128
+#define HTC_ISO_BN462 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_BN462
+
+#if PAIRING_FRIENDLY_BN462 != NOT_PF
+
+#define HTC_ISO_G2_BN462 0
+
+#define USE_GLV_BN462   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_BN462 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_BN462 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_BN462 D_TYPE
+#define SIGN_OF_X_BN462 POSITIVEX
+
+#define ATE_BITS_BN462 118
+#define G2_TABLE_BN462 125
+
+#endif
+
+
+#if CURVE_SECURITY_BN462 == 128
+#define AESKEY_BN462 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_BN462 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BN462 == 192
+#define AESKEY_BN462 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_BN462 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BN462 == 256
+#define AESKEY_BN462 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_BN462 SHA512  /**< Hash type */
+#endif
+
+
+namespace BN462_BIG = B464_60;
+namespace BN462_FP = BN462;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_BRAINPOOL.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_BRAINPOOL.h
new file mode 100644
index 0000000..bb29fb8
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_BRAINPOOL.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_BRAINPOOL_H
+#define CONFIG_CURVE_BRAINPOOL_H
+
+#include"core.h"
+#include"config_field_BRAINPOOL.h"
+
+// ECP stuff
+
+#define CURVETYPE_BRAINPOOL WEIERSTRASS
+#define CURVE_A_BRAINPOOL -3
+#define PAIRING_FRIENDLY_BRAINPOOL NOT_PF
+#define CURVE_SECURITY_BRAINPOOL 128
+#define HTC_ISO_BRAINPOOL 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_BRAINPOOL
+
+#if PAIRING_FRIENDLY_BRAINPOOL != NOT_PF
+
+#define HTC_ISO_G2_BRAINPOOL 0
+
+#define USE_GLV_BRAINPOOL   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_BRAINPOOL /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_BRAINPOOL /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_BRAINPOOL 
+#define SIGN_OF_X_BRAINPOOL 
+
+#define ATE_BITS_BRAINPOOL 
+#define G2_TABLE_BRAINPOOL 
+
+#endif
+
+
+#if CURVE_SECURITY_BRAINPOOL == 128
+#define AESKEY_BRAINPOOL 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_BRAINPOOL SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BRAINPOOL == 192
+#define AESKEY_BRAINPOOL 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_BRAINPOOL SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_BRAINPOOL == 256
+#define AESKEY_BRAINPOOL 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_BRAINPOOL SHA512  /**< Hash type */
+#endif
+
+
+namespace BRAINPOOL_BIG = B256_56;
+namespace BRAINPOOL_FP = BRAINPOOL;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_C1174.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_C1174.h
new file mode 100644
index 0000000..14eb019
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_C1174.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_C1174_H
+#define CONFIG_CURVE_C1174_H
+
+#include"core.h"
+#include"config_field_C1174.h"
+
+// ECP stuff
+
+#define CURVETYPE_C1174 EDWARDS
+#define CURVE_A_C1174 1
+#define PAIRING_FRIENDLY_C1174 NOT_PF
+#define CURVE_SECURITY_C1174 128
+#define HTC_ISO_C1174 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_C1174
+
+#if PAIRING_FRIENDLY_C1174 != NOT_PF
+
+#define HTC_ISO_G2_C1174 0
+
+#define USE_GLV_C1174   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_C1174 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_C1174 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_C1174 
+#define SIGN_OF_X_C1174 
+
+#define ATE_BITS_C1174 
+#define G2_TABLE_C1174 
+
+#endif
+
+
+#if CURVE_SECURITY_C1174 == 128
+#define AESKEY_C1174 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_C1174 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_C1174 == 192
+#define AESKEY_C1174 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_C1174 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_C1174 == 256
+#define AESKEY_C1174 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_C1174 SHA512  /**< Hash type */
+#endif
+
+
+namespace C1174_BIG = B256_56;
+namespace C1174_FP = C1174;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_C13318.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_C13318.h
new file mode 100644
index 0000000..2107469
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_C13318.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_C13318_H
+#define CONFIG_CURVE_C13318_H
+
+#include"core.h"
+#include"config_field_F25519.h"
+
+// ECP stuff
+
+#define CURVETYPE_C13318 WEIERSTRASS
+#define CURVE_A_C13318 -3
+#define PAIRING_FRIENDLY_C13318 NOT_PF
+#define CURVE_SECURITY_C13318 128
+#define HTC_ISO_C13318 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_C13318
+
+#if PAIRING_FRIENDLY_C13318 != NOT_PF
+
+#define HTC_ISO_G2_C13318 0
+
+#define USE_GLV_C13318   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_C13318 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_C13318 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_C13318 
+#define SIGN_OF_X_C13318 
+
+#define ATE_BITS_C13318 
+#define G2_TABLE_C13318 
+
+#endif
+
+
+#if CURVE_SECURITY_C13318 == 128
+#define AESKEY_C13318 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_C13318 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_C13318 == 192
+#define AESKEY_C13318 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_C13318 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_C13318 == 256
+#define AESKEY_C13318 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_C13318 SHA512  /**< Hash type */
+#endif
+
+
+namespace C13318_BIG = B256_56;
+namespace C13318_FP = F25519;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_C1665.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_C1665.h
new file mode 100644
index 0000000..256fa7f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_C1665.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_C1665_H
+#define CONFIG_CURVE_C1665_H
+
+#include"core.h"
+#include"config_field_C1665.h"
+
+// ECP stuff
+
+#define CURVETYPE_C1665 EDWARDS
+#define CURVE_A_C1665 1
+#define PAIRING_FRIENDLY_C1665 NOT_PF
+#define CURVE_SECURITY_C1665 128
+#define HTC_ISO_C1665 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_C1665
+
+#if PAIRING_FRIENDLY_C1665 != NOT_PF
+
+#define HTC_ISO_G2_C1665 0
+
+#define USE_GLV_C1665   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_C1665 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_C1665 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_C1665 
+#define SIGN_OF_X_C1665 
+
+#define ATE_BITS_C1665 
+#define G2_TABLE_C1665 
+
+#endif
+
+
+#if CURVE_SECURITY_C1665 == 128
+#define AESKEY_C1665 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_C1665 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_C1665 == 192
+#define AESKEY_C1665 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_C1665 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_C1665 == 256
+#define AESKEY_C1665 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_C1665 SHA512  /**< Hash type */
+#endif
+
+
+namespace C1665_BIG = B168_60;
+namespace C1665_FP = C1665;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_C25519.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_C25519.h
new file mode 100644
index 0000000..21b6ce6
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_C25519.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_C25519_H
+#define CONFIG_CURVE_C25519_H
+
+#include"core.h"
+#include"config_field_F25519.h"
+
+// ECP stuff
+
+#define CURVETYPE_C25519 MONTGOMERY
+#define CURVE_A_C25519 486662
+#define PAIRING_FRIENDLY_C25519 NOT_PF
+#define CURVE_SECURITY_C25519 128
+#define HTC_ISO_C25519 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_C25519
+
+#if PAIRING_FRIENDLY_C25519 != NOT_PF
+
+#define HTC_ISO_G2_C25519 0
+
+#define USE_GLV_C25519   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_C25519 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_C25519 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_C25519 
+#define SIGN_OF_X_C25519 
+
+#define ATE_BITS_C25519 
+#define G2_TABLE_C25519 
+
+#endif
+
+
+#if CURVE_SECURITY_C25519 == 128
+#define AESKEY_C25519 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_C25519 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_C25519 == 192
+#define AESKEY_C25519 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_C25519 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_C25519 == 256
+#define AESKEY_C25519 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_C25519 SHA512  /**< Hash type */
+#endif
+
+
+namespace C25519_BIG = B256_56;
+namespace C25519_FP = F25519;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_C41417.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_C41417.h
new file mode 100644
index 0000000..e3ee32c
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_C41417.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_C41417_H
+#define CONFIG_CURVE_C41417_H
+
+#include"core.h"
+#include"config_field_C41417.h"
+
+// ECP stuff
+
+#define CURVETYPE_C41417 EDWARDS
+#define CURVE_A_C41417 1
+#define PAIRING_FRIENDLY_C41417 NOT_PF
+#define CURVE_SECURITY_C41417 256
+#define HTC_ISO_C41417 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_C41417
+
+#if PAIRING_FRIENDLY_C41417 != NOT_PF
+
+#define HTC_ISO_G2_C41417 0
+
+#define USE_GLV_C41417   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_C41417 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_C41417 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_C41417 
+#define SIGN_OF_X_C41417 
+
+#define ATE_BITS_C41417 
+#define G2_TABLE_C41417 
+
+#endif
+
+
+#if CURVE_SECURITY_C41417 == 128
+#define AESKEY_C41417 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_C41417 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_C41417 == 192
+#define AESKEY_C41417 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_C41417 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_C41417 == 256
+#define AESKEY_C41417 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_C41417 SHA512  /**< Hash type */
+#endif
+
+
+namespace C41417_BIG = B416_60;
+namespace C41417_FP = C41417;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_Ed25519.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_Ed25519.h
new file mode 100644
index 0000000..d619828
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_Ed25519.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_Ed25519_H
+#define CONFIG_CURVE_Ed25519_H
+
+#include"core.h"
+#include"config_field_F25519.h"
+
+// ECP stuff
+
+#define CURVETYPE_Ed25519 EDWARDS
+#define CURVE_A_Ed25519 -1
+#define PAIRING_FRIENDLY_Ed25519 NOT_PF
+#define CURVE_SECURITY_Ed25519 128
+#define HTC_ISO_Ed25519 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_Ed25519
+
+#if PAIRING_FRIENDLY_Ed25519 != NOT_PF
+
+#define HTC_ISO_G2_Ed25519 0
+
+#define USE_GLV_Ed25519   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_Ed25519 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_Ed25519 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_Ed25519 
+#define SIGN_OF_X_Ed25519 
+
+#define ATE_BITS_Ed25519 
+#define G2_TABLE_Ed25519 
+
+#endif
+
+
+#if CURVE_SECURITY_Ed25519 == 128
+#define AESKEY_Ed25519 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_Ed25519 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_Ed25519 == 192
+#define AESKEY_Ed25519 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_Ed25519 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_Ed25519 == 256
+#define AESKEY_Ed25519 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_Ed25519 SHA512  /**< Hash type */
+#endif
+
+
+namespace Ed25519_BIG = B256_56;
+namespace Ed25519_FP = F25519;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_Ed448.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_Ed448.h
new file mode 100644
index 0000000..ae385ed
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_Ed448.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_Ed448_H
+#define CONFIG_CURVE_Ed448_H
+
+#include"core.h"
+#include"config_field_F448.h"
+
+// ECP stuff
+
+#define CURVETYPE_Ed448 EDWARDS
+#define CURVE_A_Ed448 1
+#define PAIRING_FRIENDLY_Ed448 NOT_PF
+#define CURVE_SECURITY_Ed448 256
+#define HTC_ISO_Ed448 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_Ed448
+
+#if PAIRING_FRIENDLY_Ed448 != NOT_PF
+
+#define HTC_ISO_G2_Ed448 0
+
+#define USE_GLV_Ed448   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_Ed448 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_Ed448 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_Ed448 
+#define SIGN_OF_X_Ed448 
+
+#define ATE_BITS_Ed448 
+#define G2_TABLE_Ed448 
+
+#endif
+
+
+#if CURVE_SECURITY_Ed448 == 128
+#define AESKEY_Ed448 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_Ed448 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_Ed448 == 192
+#define AESKEY_Ed448 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_Ed448 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_Ed448 == 256
+#define AESKEY_Ed448 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_Ed448 SHA512  /**< Hash type */
+#endif
+
+
+namespace Ed448_BIG = B448_58;
+namespace Ed448_FP = F448;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_FP256BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_FP256BN.h
new file mode 100644
index 0000000..f0abef8
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_FP256BN.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_FP256BN_H
+#define CONFIG_CURVE_FP256BN_H
+
+#include"core.h"
+#include"config_field_FP256BN.h"
+
+// ECP stuff
+
+#define CURVETYPE_FP256BN WEIERSTRASS
+#define CURVE_A_FP256BN 0
+#define PAIRING_FRIENDLY_FP256BN BN_CURVE
+#define CURVE_SECURITY_FP256BN 128
+#define HTC_ISO_FP256BN 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_FP256BN
+
+#if PAIRING_FRIENDLY_FP256BN != NOT_PF
+
+#define HTC_ISO_G2_FP256BN 0
+
+#define USE_GLV_FP256BN   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_FP256BN /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_FP256BN /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_FP256BN M_TYPE
+#define SIGN_OF_X_FP256BN NEGATIVEX
+
+#define ATE_BITS_FP256BN 66
+#define G2_TABLE_FP256BN 83
+
+#endif
+
+
+#if CURVE_SECURITY_FP256BN == 128
+#define AESKEY_FP256BN 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_FP256BN SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_FP256BN == 192
+#define AESKEY_FP256BN 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_FP256BN SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_FP256BN == 256
+#define AESKEY_FP256BN 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_FP256BN SHA512  /**< Hash type */
+#endif
+
+
+namespace FP256BN_BIG = B256_56;
+namespace FP256BN_FP = FP256BN;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_FP512BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_FP512BN.h
new file mode 100644
index 0000000..42a1dcf
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_FP512BN.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_FP512BN_H
+#define CONFIG_CURVE_FP512BN_H
+
+#include"core.h"
+#include"config_field_FP512BN.h"
+
+// ECP stuff
+
+#define CURVETYPE_FP512BN WEIERSTRASS
+#define CURVE_A_FP512BN 0
+#define PAIRING_FRIENDLY_FP512BN BN_CURVE
+#define CURVE_SECURITY_FP512BN 128
+#define HTC_ISO_FP512BN 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_FP512BN
+
+#if PAIRING_FRIENDLY_FP512BN != NOT_PF
+
+#define HTC_ISO_G2_FP512BN 0
+
+#define USE_GLV_FP512BN   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_FP512BN /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_FP512BN /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_FP512BN M_TYPE
+#define SIGN_OF_X_FP512BN POSITIVEX
+
+#define ATE_BITS_FP512BN 130
+#define G2_TABLE_FP512BN 172
+
+#endif
+
+
+#if CURVE_SECURITY_FP512BN == 128
+#define AESKEY_FP512BN 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_FP512BN SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_FP512BN == 192
+#define AESKEY_FP512BN 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_FP512BN SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_FP512BN == 256
+#define AESKEY_FP512BN 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_FP512BN SHA512  /**< Hash type */
+#endif
+
+
+namespace FP512BN_BIG = B512_60;
+namespace FP512BN_FP = FP512BN;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_HIFIVE.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_HIFIVE.h
new file mode 100644
index 0000000..2aca8a4
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_HIFIVE.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_HIFIVE_H
+#define CONFIG_CURVE_HIFIVE_H
+
+#include"core.h"
+#include"config_field_HIFIVE.h"
+
+// ECP stuff
+
+#define CURVETYPE_HIFIVE EDWARDS
+#define CURVE_A_HIFIVE 1
+#define PAIRING_FRIENDLY_HIFIVE NOT_PF
+#define CURVE_SECURITY_HIFIVE 192
+#define HTC_ISO_HIFIVE 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_HIFIVE
+
+#if PAIRING_FRIENDLY_HIFIVE != NOT_PF
+
+#define HTC_ISO_G2_HIFIVE 0
+
+#define USE_GLV_HIFIVE   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_HIFIVE /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_HIFIVE /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_HIFIVE 
+#define SIGN_OF_X_HIFIVE 
+
+#define ATE_BITS_HIFIVE 
+#define G2_TABLE_HIFIVE 
+
+#endif
+
+
+#if CURVE_SECURITY_HIFIVE == 128
+#define AESKEY_HIFIVE 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_HIFIVE SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_HIFIVE == 192
+#define AESKEY_HIFIVE 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_HIFIVE SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_HIFIVE == 256
+#define AESKEY_HIFIVE 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_HIFIVE SHA512  /**< Hash type */
+#endif
+
+
+namespace HIFIVE_BIG = B336_60;
+namespace HIFIVE_FP = HIFIVE;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_JUBJUB.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_JUBJUB.h
new file mode 100644
index 0000000..388fd68
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_JUBJUB.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_JUBJUB_H
+#define CONFIG_CURVE_JUBJUB_H
+
+#include"core.h"
+#include"config_field_JUBJUB.h"
+
+// ECP stuff
+
+#define CURVETYPE_JUBJUB EDWARDS
+#define CURVE_A_JUBJUB -1
+#define PAIRING_FRIENDLY_JUBJUB NOT_PF
+#define CURVE_SECURITY_JUBJUB 128
+#define HTC_ISO_JUBJUB 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_JUBJUB
+
+#if PAIRING_FRIENDLY_JUBJUB != NOT_PF
+
+#define HTC_ISO_G2_JUBJUB 0
+
+#define USE_GLV_JUBJUB   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_JUBJUB /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_JUBJUB /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_JUBJUB 
+#define SIGN_OF_X_JUBJUB 
+
+#define ATE_BITS_JUBJUB 
+#define G2_TABLE_JUBJUB 
+
+#endif
+
+
+#if CURVE_SECURITY_JUBJUB == 128
+#define AESKEY_JUBJUB 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_JUBJUB SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_JUBJUB == 192
+#define AESKEY_JUBJUB 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_JUBJUB SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_JUBJUB == 256
+#define AESKEY_JUBJUB 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_JUBJUB SHA512  /**< Hash type */
+#endif
+
+
+namespace JUBJUB_BIG = B256_56;
+namespace JUBJUB_FP = JUBJUB;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_MDC.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_MDC.h
new file mode 100644
index 0000000..d526b29
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_MDC.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_MDC_H
+#define CONFIG_CURVE_MDC_H
+
+#include"core.h"
+#include"config_field_MDC.h"
+
+// ECP stuff
+
+#define CURVETYPE_MDC EDWARDS
+#define CURVE_A_MDC 1
+#define PAIRING_FRIENDLY_MDC NOT_PF
+#define CURVE_SECURITY_MDC 128
+#define HTC_ISO_MDC 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_MDC
+
+#if PAIRING_FRIENDLY_MDC != NOT_PF
+
+#define HTC_ISO_G2_MDC 0
+
+#define USE_GLV_MDC   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_MDC /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_MDC /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_MDC 
+#define SIGN_OF_X_MDC 
+
+#define ATE_BITS_MDC 
+#define G2_TABLE_MDC 
+
+#endif
+
+
+#if CURVE_SECURITY_MDC == 128
+#define AESKEY_MDC 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_MDC SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_MDC == 192
+#define AESKEY_MDC 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_MDC SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_MDC == 256
+#define AESKEY_MDC 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_MDC SHA512  /**< Hash type */
+#endif
+
+
+namespace MDC_BIG = B256_56;
+namespace MDC_FP = MDC;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_NIST256.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_NIST256.h
new file mode 100644
index 0000000..dbd4b64
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_NIST256.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_NIST256_H
+#define CONFIG_CURVE_NIST256_H
+
+#include"core.h"
+#include"config_field_NIST256.h"
+
+// ECP stuff
+
+#define CURVETYPE_NIST256 WEIERSTRASS
+#define CURVE_A_NIST256 -3
+#define PAIRING_FRIENDLY_NIST256 NOT_PF
+#define CURVE_SECURITY_NIST256 128
+#define HTC_ISO_NIST256 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_NIST256
+
+#if PAIRING_FRIENDLY_NIST256 != NOT_PF
+
+#define HTC_ISO_G2_NIST256 0
+
+#define USE_GLV_NIST256   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_NIST256 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_NIST256 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_NIST256 
+#define SIGN_OF_X_NIST256 
+
+#define ATE_BITS_NIST256 
+#define G2_TABLE_NIST256 
+
+#endif
+
+
+#if CURVE_SECURITY_NIST256 == 128
+#define AESKEY_NIST256 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_NIST256 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_NIST256 == 192
+#define AESKEY_NIST256 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_NIST256 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_NIST256 == 256
+#define AESKEY_NIST256 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_NIST256 SHA512  /**< Hash type */
+#endif
+
+
+namespace NIST256_BIG = B256_56;
+namespace NIST256_FP = NIST256;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_NIST384.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_NIST384.h
new file mode 100644
index 0000000..ed648be
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_NIST384.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_NIST384_H
+#define CONFIG_CURVE_NIST384_H
+
+#include"core.h"
+#include"config_field_NIST384.h"
+
+// ECP stuff
+
+#define CURVETYPE_NIST384 WEIERSTRASS
+#define CURVE_A_NIST384 -3
+#define PAIRING_FRIENDLY_NIST384 NOT_PF
+#define CURVE_SECURITY_NIST384 192
+#define HTC_ISO_NIST384 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_NIST384
+
+#if PAIRING_FRIENDLY_NIST384 != NOT_PF
+
+#define HTC_ISO_G2_NIST384 0
+
+#define USE_GLV_NIST384   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_NIST384 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_NIST384 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_NIST384 
+#define SIGN_OF_X_NIST384 
+
+#define ATE_BITS_NIST384 
+#define G2_TABLE_NIST384 
+
+#endif
+
+
+#if CURVE_SECURITY_NIST384 == 128
+#define AESKEY_NIST384 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_NIST384 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_NIST384 == 192
+#define AESKEY_NIST384 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_NIST384 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_NIST384 == 256
+#define AESKEY_NIST384 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_NIST384 SHA512  /**< Hash type */
+#endif
+
+
+namespace NIST384_BIG = B384_56;
+namespace NIST384_FP = NIST384;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_NIST521.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_NIST521.h
new file mode 100644
index 0000000..888a733
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_NIST521.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_NIST521_H
+#define CONFIG_CURVE_NIST521_H
+
+#include"core.h"
+#include"config_field_NIST521.h"
+
+// ECP stuff
+
+#define CURVETYPE_NIST521 WEIERSTRASS
+#define CURVE_A_NIST521 -3
+#define PAIRING_FRIENDLY_NIST521 NOT_PF
+#define CURVE_SECURITY_NIST521 256
+#define HTC_ISO_NIST521 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_NIST521
+
+#if PAIRING_FRIENDLY_NIST521 != NOT_PF
+
+#define HTC_ISO_G2_NIST521 0
+
+#define USE_GLV_NIST521   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_NIST521 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_NIST521 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_NIST521 
+#define SIGN_OF_X_NIST521 
+
+#define ATE_BITS_NIST521 
+#define G2_TABLE_NIST521 
+
+#endif
+
+
+#if CURVE_SECURITY_NIST521 == 128
+#define AESKEY_NIST521 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_NIST521 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_NIST521 == 192
+#define AESKEY_NIST521 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_NIST521 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_NIST521 == 256
+#define AESKEY_NIST521 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_NIST521 SHA512  /**< Hash type */
+#endif
+
+
+namespace NIST521_BIG = B528_60;
+namespace NIST521_FP = NIST521;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_NUMS256E.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_NUMS256E.h
new file mode 100644
index 0000000..dd5629e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_NUMS256E.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_NUMS256E_H
+#define CONFIG_CURVE_NUMS256E_H
+
+#include"core.h"
+#include"config_field_F256PME.h"
+
+// ECP stuff
+
+#define CURVETYPE_NUMS256E EDWARDS
+#define CURVE_A_NUMS256E 1
+#define PAIRING_FRIENDLY_NUMS256E NOT_PF
+#define CURVE_SECURITY_NUMS256E 128
+#define HTC_ISO_NUMS256E 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_NUMS256E
+
+#if PAIRING_FRIENDLY_NUMS256E != NOT_PF
+
+#define HTC_ISO_G2_NUMS256E 0
+
+#define USE_GLV_NUMS256E   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_NUMS256E /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_NUMS256E /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_NUMS256E 
+#define SIGN_OF_X_NUMS256E 
+
+#define ATE_BITS_NUMS256E 
+#define G2_TABLE_NUMS256E 
+
+#endif
+
+
+#if CURVE_SECURITY_NUMS256E == 128
+#define AESKEY_NUMS256E 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_NUMS256E SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_NUMS256E == 192
+#define AESKEY_NUMS256E 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_NUMS256E SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_NUMS256E == 256
+#define AESKEY_NUMS256E 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_NUMS256E SHA512  /**< Hash type */
+#endif
+
+
+namespace NUMS256E_BIG = B256_56;
+namespace NUMS256E_FP = F256PME;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_NUMS256W.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_NUMS256W.h
new file mode 100644
index 0000000..262bf4a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_NUMS256W.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_NUMS256W_H
+#define CONFIG_CURVE_NUMS256W_H
+
+#include"core.h"
+#include"config_field_F256PMW.h"
+
+// ECP stuff
+
+#define CURVETYPE_NUMS256W WEIERSTRASS
+#define CURVE_A_NUMS256W -3
+#define PAIRING_FRIENDLY_NUMS256W NOT_PF
+#define CURVE_SECURITY_NUMS256W 128
+#define HTC_ISO_NUMS256W 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_NUMS256W
+
+#if PAIRING_FRIENDLY_NUMS256W != NOT_PF
+
+#define HTC_ISO_G2_NUMS256W 0
+
+#define USE_GLV_NUMS256W   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_NUMS256W /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_NUMS256W /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_NUMS256W 
+#define SIGN_OF_X_NUMS256W 
+
+#define ATE_BITS_NUMS256W 
+#define G2_TABLE_NUMS256W 
+
+#endif
+
+
+#if CURVE_SECURITY_NUMS256W == 128
+#define AESKEY_NUMS256W 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_NUMS256W SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_NUMS256W == 192
+#define AESKEY_NUMS256W 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_NUMS256W SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_NUMS256W == 256
+#define AESKEY_NUMS256W 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_NUMS256W SHA512  /**< Hash type */
+#endif
+
+
+namespace NUMS256W_BIG = B256_56;
+namespace NUMS256W_FP = F256PMW;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_NUMS384E.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_NUMS384E.h
new file mode 100644
index 0000000..b089b3e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_NUMS384E.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_NUMS384E_H
+#define CONFIG_CURVE_NUMS384E_H
+
+#include"core.h"
+#include"config_field_F384PM.h"
+
+// ECP stuff
+
+#define CURVETYPE_NUMS384E EDWARDS
+#define CURVE_A_NUMS384E 1
+#define PAIRING_FRIENDLY_NUMS384E NOT_PF
+#define CURVE_SECURITY_NUMS384E 192
+#define HTC_ISO_NUMS384E 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_NUMS384E
+
+#if PAIRING_FRIENDLY_NUMS384E != NOT_PF
+
+#define HTC_ISO_G2_NUMS384E 0
+
+#define USE_GLV_NUMS384E   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_NUMS384E /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_NUMS384E /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_NUMS384E 
+#define SIGN_OF_X_NUMS384E 
+
+#define ATE_BITS_NUMS384E 
+#define G2_TABLE_NUMS384E 
+
+#endif
+
+
+#if CURVE_SECURITY_NUMS384E == 128
+#define AESKEY_NUMS384E 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_NUMS384E SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_NUMS384E == 192
+#define AESKEY_NUMS384E 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_NUMS384E SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_NUMS384E == 256
+#define AESKEY_NUMS384E 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_NUMS384E SHA512  /**< Hash type */
+#endif
+
+
+namespace NUMS384E_BIG = B384_58;
+namespace NUMS384E_FP = F384PM;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_NUMS384W.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_NUMS384W.h
new file mode 100644
index 0000000..9f41c39
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_NUMS384W.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_NUMS384W_H
+#define CONFIG_CURVE_NUMS384W_H
+
+#include"core.h"
+#include"config_field_F384PM.h"
+
+// ECP stuff
+
+#define CURVETYPE_NUMS384W WEIERSTRASS
+#define CURVE_A_NUMS384W -3
+#define PAIRING_FRIENDLY_NUMS384W NOT_PF
+#define CURVE_SECURITY_NUMS384W 192
+#define HTC_ISO_NUMS384W 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_NUMS384W
+
+#if PAIRING_FRIENDLY_NUMS384W != NOT_PF
+
+#define HTC_ISO_G2_NUMS384W 0
+
+#define USE_GLV_NUMS384W   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_NUMS384W /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_NUMS384W /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_NUMS384W 
+#define SIGN_OF_X_NUMS384W 
+
+#define ATE_BITS_NUMS384W 
+#define G2_TABLE_NUMS384W 
+
+#endif
+
+
+#if CURVE_SECURITY_NUMS384W == 128
+#define AESKEY_NUMS384W 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_NUMS384W SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_NUMS384W == 192
+#define AESKEY_NUMS384W 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_NUMS384W SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_NUMS384W == 256
+#define AESKEY_NUMS384W 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_NUMS384W SHA512  /**< Hash type */
+#endif
+
+
+namespace NUMS384W_BIG = B384_58;
+namespace NUMS384W_FP = F384PM;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_NUMS512E.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_NUMS512E.h
new file mode 100644
index 0000000..beacb50
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_NUMS512E.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_NUMS512E_H
+#define CONFIG_CURVE_NUMS512E_H
+
+#include"core.h"
+#include"config_field_F512PM.h"
+
+// ECP stuff
+
+#define CURVETYPE_NUMS512E EDWARDS
+#define CURVE_A_NUMS512E 1
+#define PAIRING_FRIENDLY_NUMS512E NOT_PF
+#define CURVE_SECURITY_NUMS512E 256
+#define HTC_ISO_NUMS512E 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_NUMS512E
+
+#if PAIRING_FRIENDLY_NUMS512E != NOT_PF
+
+#define HTC_ISO_G2_NUMS512E 0
+
+#define USE_GLV_NUMS512E   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_NUMS512E /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_NUMS512E /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_NUMS512E 
+#define SIGN_OF_X_NUMS512E 
+
+#define ATE_BITS_NUMS512E 
+#define G2_TABLE_NUMS512E 
+
+#endif
+
+
+#if CURVE_SECURITY_NUMS512E == 128
+#define AESKEY_NUMS512E 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_NUMS512E SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_NUMS512E == 192
+#define AESKEY_NUMS512E 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_NUMS512E SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_NUMS512E == 256
+#define AESKEY_NUMS512E 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_NUMS512E SHA512  /**< Hash type */
+#endif
+
+
+namespace NUMS512E_BIG = B512_60;
+namespace NUMS512E_FP = F512PM;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_NUMS512W.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_NUMS512W.h
new file mode 100644
index 0000000..160675e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_NUMS512W.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_NUMS512W_H
+#define CONFIG_CURVE_NUMS512W_H
+
+#include"core.h"
+#include"config_field_F512PM.h"
+
+// ECP stuff
+
+#define CURVETYPE_NUMS512W WEIERSTRASS
+#define CURVE_A_NUMS512W -3
+#define PAIRING_FRIENDLY_NUMS512W NOT_PF
+#define CURVE_SECURITY_NUMS512W 256
+#define HTC_ISO_NUMS512W 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_NUMS512W
+
+#if PAIRING_FRIENDLY_NUMS512W != NOT_PF
+
+#define HTC_ISO_G2_NUMS512W 0
+
+#define USE_GLV_NUMS512W   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_NUMS512W /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_NUMS512W /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_NUMS512W 
+#define SIGN_OF_X_NUMS512W 
+
+#define ATE_BITS_NUMS512W 
+#define G2_TABLE_NUMS512W 
+
+#endif
+
+
+#if CURVE_SECURITY_NUMS512W == 128
+#define AESKEY_NUMS512W 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_NUMS512W SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_NUMS512W == 192
+#define AESKEY_NUMS512W 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_NUMS512W SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_NUMS512W == 256
+#define AESKEY_NUMS512W 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_NUMS512W SHA512  /**< Hash type */
+#endif
+
+
+namespace NUMS512W_BIG = B512_60;
+namespace NUMS512W_FP = F512PM;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_SECP160R1.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_SECP160R1.h
new file mode 100644
index 0000000..03ebd84
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_SECP160R1.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_SECP160R1_H
+#define CONFIG_CURVE_SECP160R1_H
+
+#include"core.h"
+#include"config_field_SECP160R1.h"
+
+// ECP stuff
+
+#define CURVETYPE_SECP160R1 WEIERSTRASS
+#define CURVE_A_SECP160R1 -3
+#define PAIRING_FRIENDLY_SECP160R1 NOT_PF
+#define CURVE_SECURITY_SECP160R1 128
+#define HTC_ISO_SECP160R1 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_SECP160R1
+
+#if PAIRING_FRIENDLY_SECP160R1 != NOT_PF
+
+#define HTC_ISO_G2_SECP160R1 0
+
+#define USE_GLV_SECP160R1   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_SECP160R1 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_SECP160R1 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_SECP160R1 
+#define SIGN_OF_X_SECP160R1 
+
+#define ATE_BITS_SECP160R1 
+#define G2_TABLE_SECP160R1 
+
+#endif
+
+
+#if CURVE_SECURITY_SECP160R1 == 128
+#define AESKEY_SECP160R1 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_SECP160R1 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_SECP160R1 == 192
+#define AESKEY_SECP160R1 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_SECP160R1 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_SECP160R1 == 256
+#define AESKEY_SECP160R1 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_SECP160R1 SHA512  /**< Hash type */
+#endif
+
+
+namespace SECP160R1_BIG = B160_56;
+namespace SECP160R1_FP = SECP160R1;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_SECP256K1.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_SECP256K1.h
new file mode 100644
index 0000000..ce4468a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_SECP256K1.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_SECP256K1_H
+#define CONFIG_CURVE_SECP256K1_H
+
+#include"core.h"
+#include"config_field_SECP256K1.h"
+
+// ECP stuff
+
+#define CURVETYPE_SECP256K1 WEIERSTRASS
+#define CURVE_A_SECP256K1 0
+#define PAIRING_FRIENDLY_SECP256K1 NOT_PF
+#define CURVE_SECURITY_SECP256K1 128
+#define HTC_ISO_SECP256K1 3
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_SECP256K1
+
+#if PAIRING_FRIENDLY_SECP256K1 != NOT_PF
+
+#define HTC_ISO_G2_SECP256K1 0
+
+#define USE_GLV_SECP256K1   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_SECP256K1 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_SECP256K1 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_SECP256K1 
+#define SIGN_OF_X_SECP256K1 
+
+#define ATE_BITS_SECP256K1 
+#define G2_TABLE_SECP256K1 
+
+#endif
+
+
+#if CURVE_SECURITY_SECP256K1 == 128
+#define AESKEY_SECP256K1 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_SECP256K1 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_SECP256K1 == 192
+#define AESKEY_SECP256K1 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_SECP256K1 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_SECP256K1 == 256
+#define AESKEY_SECP256K1 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_SECP256K1 SHA512  /**< Hash type */
+#endif
+
+
+namespace SECP256K1_BIG = B256_56;
+namespace SECP256K1_FP = SECP256K1;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_SM2.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_SM2.h
new file mode 100644
index 0000000..d193948
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_SM2.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_SM2_H
+#define CONFIG_CURVE_SM2_H
+
+#include"core.h"
+#include"config_field_SM2.h"
+
+// ECP stuff
+
+#define CURVETYPE_SM2 WEIERSTRASS
+#define CURVE_A_SM2 -3
+#define PAIRING_FRIENDLY_SM2 NOT_PF
+#define CURVE_SECURITY_SM2 128
+#define HTC_ISO_SM2 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_SM2
+
+#if PAIRING_FRIENDLY_SM2 != NOT_PF
+
+#define HTC_ISO_G2_SM2 0
+
+#define USE_GLV_SM2   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_SM2 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_SM2 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_SM2 
+#define SIGN_OF_X_SM2 
+
+#define ATE_BITS_SM2 
+#define G2_TABLE_SM2 
+
+#endif
+
+
+#if CURVE_SECURITY_SM2 == 128
+#define AESKEY_SM2 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_SM2 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_SM2 == 192
+#define AESKEY_SM2 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_SM2 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_SM2 == 256
+#define AESKEY_SM2 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_SM2 SHA512  /**< Hash type */
+#endif
+
+
+namespace SM2_BIG = B256_56;
+namespace SM2_FP = SM2;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_TWEEDLEDEE.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_TWEEDLEDEE.h
new file mode 100644
index 0000000..beff313
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_TWEEDLEDEE.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_TWEEDLEDEE_H
+#define CONFIG_CURVE_TWEEDLEDEE_H
+
+#include"core.h"
+#include"config_field_TWEEDLEDEE.h"
+
+// ECP stuff
+
+#define CURVETYPE_TWEEDLEDEE WEIERSTRASS
+#define CURVE_A_TWEEDLEDEE 0
+#define PAIRING_FRIENDLY_TWEEDLEDEE NOT_PF
+#define CURVE_SECURITY_TWEEDLEDEE 128
+#define HTC_ISO_TWEEDLEDEE 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_TWEEDLEDEE
+
+#if PAIRING_FRIENDLY_TWEEDLEDEE != NOT_PF
+
+#define HTC_ISO_G2_TWEEDLEDEE 0
+
+#define USE_GLV_TWEEDLEDEE   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_TWEEDLEDEE /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_TWEEDLEDEE /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_TWEEDLEDEE 
+#define SIGN_OF_X_TWEEDLEDEE 
+
+#define ATE_BITS_TWEEDLEDEE 
+#define G2_TABLE_TWEEDLEDEE 
+
+#endif
+
+
+#if CURVE_SECURITY_TWEEDLEDEE == 128
+#define AESKEY_TWEEDLEDEE 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_TWEEDLEDEE SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_TWEEDLEDEE == 192
+#define AESKEY_TWEEDLEDEE 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_TWEEDLEDEE SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_TWEEDLEDEE == 256
+#define AESKEY_TWEEDLEDEE 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_TWEEDLEDEE SHA512  /**< Hash type */
+#endif
+
+
+namespace TWEEDLEDEE_BIG = B256_56;
+namespace TWEEDLEDEE_FP = TWEEDLEDEE;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_TWEEDLEDUM.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_TWEEDLEDUM.h
new file mode 100644
index 0000000..84ad8cd
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_TWEEDLEDUM.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_TWEEDLEDUM_H
+#define CONFIG_CURVE_TWEEDLEDUM_H
+
+#include"core.h"
+#include"config_field_TWEEDLEDUM.h"
+
+// ECP stuff
+
+#define CURVETYPE_TWEEDLEDUM WEIERSTRASS
+#define CURVE_A_TWEEDLEDUM 0
+#define PAIRING_FRIENDLY_TWEEDLEDUM NOT_PF
+#define CURVE_SECURITY_TWEEDLEDUM 128
+#define HTC_ISO_TWEEDLEDUM 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_TWEEDLEDUM
+
+#if PAIRING_FRIENDLY_TWEEDLEDUM != NOT_PF
+
+#define HTC_ISO_G2_TWEEDLEDUM 0
+
+#define USE_GLV_TWEEDLEDUM   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_TWEEDLEDUM /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_TWEEDLEDUM /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_TWEEDLEDUM 
+#define SIGN_OF_X_TWEEDLEDUM 
+
+#define ATE_BITS_TWEEDLEDUM 
+#define G2_TABLE_TWEEDLEDUM 
+
+#endif
+
+
+#if CURVE_SECURITY_TWEEDLEDUM == 128
+#define AESKEY_TWEEDLEDUM 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_TWEEDLEDUM SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_TWEEDLEDUM == 192
+#define AESKEY_TWEEDLEDUM 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_TWEEDLEDUM SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_TWEEDLEDUM == 256
+#define AESKEY_TWEEDLEDUM 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_TWEEDLEDUM SHA512  /**< Hash type */
+#endif
+
+
+namespace TWEEDLEDUM_BIG = B256_56;
+namespace TWEEDLEDUM_FP = TWEEDLEDUM;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_X448.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_X448.h
new file mode 100644
index 0000000..e12aced
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_curve_X448.h
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_CURVE_X448_H
+#define CONFIG_CURVE_X448_H
+
+#include"core.h"
+#include"config_field_F448.h"
+
+// ECP stuff
+
+#define CURVETYPE_X448 MONTGOMERY
+#define CURVE_A_X448 156326
+#define PAIRING_FRIENDLY_X448 NOT_PF
+#define CURVE_SECURITY_X448 256
+#define HTC_ISO_X448 0
+
+// Permit alternate compression method if 3 spare top bits in field representation
+// Must be set manually
+// #define ALLOW_ALT_COMPRESS_X448
+
+#if PAIRING_FRIENDLY_X448 != NOT_PF
+
+#define HTC_ISO_G2_X448 0
+
+#define USE_GLV_X448   /**< Note this method is patented (GLV), so maybe you want to comment this out */
+#define USE_GS_G2_X448 /**< Well we didn't patent it :) But may be covered by GLV patent :( */
+#define USE_GS_GT_X448 /**< Not patented, so probably safe to always use this */
+
+#define POSITIVEX 0
+#define NEGATIVEX 1
+
+#define SEXTIC_TWIST_X448 
+#define SIGN_OF_X_X448 
+
+#define ATE_BITS_X448 
+#define G2_TABLE_X448 
+
+#endif
+
+
+#if CURVE_SECURITY_X448 == 128
+#define AESKEY_X448 16 /**< Symmetric Key size - 128 bits */
+#define HASH_TYPE_X448 SHA256  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_X448 == 192
+#define AESKEY_X448 24 /**< Symmetric Key size - 192 bits */
+#define HASH_TYPE_X448 SHA384  /**< Hash type */
+#endif
+
+#if CURVE_SECURITY_X448 == 256
+#define AESKEY_X448 32 /**< Symmetric Key size - 256 bits */
+#define HASH_TYPE_X448 SHA512  /**< Hash type */
+#endif
+
+
+namespace X448_BIG = B448_58;
+namespace X448_FP = F448;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_ff.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_ff.h
new file mode 100644
index 0000000..cc6744a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_ff.h
@@ -0,0 +1,32 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_RSA_WWW_H
+#define CONFIG_RSA_WWW_H
+
+#include "core.h"
+#include "config_big_XXX.h"
+
+// FF stuff
+
+#define FFLEN_WWW @ML@ /**< 2^n multiplier of BIGBITS to specify supported Finite Field size, e.g 2048=256*2^3 where BIGBITS=256 */
+
+namespace WWW_BIG = XXX;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_ff_RSA2048.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_ff_RSA2048.h
new file mode 100644
index 0000000..69a2143
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_ff_RSA2048.h
@@ -0,0 +1,32 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_RSA_RSA2048_H
+#define CONFIG_RSA_RSA2048_H
+
+#include "core.h"
+#include "config_big_B512_60.h"
+
+// FF stuff
+
+#define FFLEN_RSA2048 4 /**< 2^n multiplier of BIGBITS to specify supported Finite Field size, e.g 2048=256*2^3 where BIGBITS=256 */
+
+namespace RSA2048_BIG = B512_60;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_ff_RSA3072.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_ff_RSA3072.h
new file mode 100644
index 0000000..5b58063
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_ff_RSA3072.h
@@ -0,0 +1,32 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_RSA_RSA3072_H
+#define CONFIG_RSA_RSA3072_H
+
+#include "core.h"
+#include "config_big_B384_56.h"
+
+// FF stuff
+
+#define FFLEN_RSA3072 8 /**< 2^n multiplier of BIGBITS to specify supported Finite Field size, e.g 2048=256*2^3 where BIGBITS=256 */
+
+namespace RSA3072_BIG = B384_56;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_ff_RSA4096.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_ff_RSA4096.h
new file mode 100644
index 0000000..605cccc
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_ff_RSA4096.h
@@ -0,0 +1,32 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_RSA_RSA4096_H
+#define CONFIG_RSA_RSA4096_H
+
+#include "core.h"
+#include "config_big_B512_60.h"
+
+// FF stuff
+
+#define FFLEN_RSA4096 8 /**< 2^n multiplier of BIGBITS to specify supported Finite Field size, e.g 2048=256*2^3 where BIGBITS=256 */
+
+namespace RSA4096_BIG = B512_60;
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field.h
new file mode 100644
index 0000000..88f4d7b
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_YYY_H
+#define CONFIG_FIELD_YYY_H
+
+#include"core.h"
+#include "config_big_XXX.h"
+
+// FP stuff
+
+#define MBITS_YYY @NBT@
+#define PM1D2_YYY @M8@
+#define MODTYPE_YYY @MT@
+#define MAXXES_YYY @SH@
+#define QNRI_YYY @QI@
+#define RIADZ_YYY @RZ@
+#define RIADZG2A_YYY @RZ2A@
+#define RIADZG2B_YYY @RZ2B@
+#define TOWER_YYY @TW@
+
+//#define BIG_ENDIAN_SIGN_YYY 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_ANSSI.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_ANSSI.h
new file mode 100644
index 0000000..a12e78a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_ANSSI.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_ANSSI_H
+#define CONFIG_FIELD_ANSSI_H
+
+#include"core.h"
+#include "config_big_B256_56.h"
+
+// FP stuff
+
+#define MBITS_ANSSI 256
+#define PM1D2_ANSSI 1
+#define MODTYPE_ANSSI NOT_SPECIAL
+#define MAXXES_ANSSI 24
+#define QNRI_ANSSI 0
+#define RIADZ_ANSSI -5
+#define RIADZG2A_ANSSI 0
+#define RIADZG2B_ANSSI 0
+#define TOWER_ANSSI NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_ANSSI 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_BLS12381.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_BLS12381.h
new file mode 100644
index 0000000..579fce1
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_BLS12381.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_BLS12381_H
+#define CONFIG_FIELD_BLS12381_H
+
+#include"core.h"
+#include "config_big_B384_58.h"
+
+// FP stuff
+
+#define MBITS_BLS12381 381
+#define PM1D2_BLS12381 1
+#define MODTYPE_BLS12381 NOT_SPECIAL
+#define MAXXES_BLS12381 25
+#define QNRI_BLS12381 0
+#define RIADZ_BLS12381 11
+#define RIADZG2A_BLS12381 -2
+#define RIADZG2B_BLS12381 -1
+#define TOWER_BLS12381 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_BLS12381 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_BLS12383.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_BLS12383.h
new file mode 100644
index 0000000..03cb9c7
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_BLS12383.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_BLS12383_H
+#define CONFIG_FIELD_BLS12383_H
+
+#include"core.h"
+#include "config_big_B384_58.h"
+
+// FP stuff
+
+#define MBITS_BLS12383 383
+#define PM1D2_BLS12383 1
+#define MODTYPE_BLS12383 NOT_SPECIAL
+#define MAXXES_BLS12383 23
+#define QNRI_BLS12383 0
+#define RIADZ_BLS12383 1
+#define RIADZG2A_BLS12383 1
+#define RIADZG2B_BLS12383 0
+#define TOWER_BLS12383 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_BLS12383 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_BLS12443.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_BLS12443.h
new file mode 100644
index 0000000..03ffae8
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_BLS12443.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_BLS12443_H
+#define CONFIG_FIELD_BLS12443_H
+
+#include"core.h"
+#include "config_big_B448_60.h"
+
+// FP stuff
+
+#define MBITS_BLS12443 443
+#define PM1D2_BLS12443 1
+#define MODTYPE_BLS12443 NOT_SPECIAL
+#define MAXXES_BLS12443 30
+#define QNRI_BLS12443 0
+#define RIADZ_BLS12443 -7
+#define RIADZG2A_BLS12443 1
+#define RIADZG2B_BLS12443 1
+#define TOWER_BLS12443 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_BLS12443 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_BLS12461.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_BLS12461.h
new file mode 100644
index 0000000..5377186
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_BLS12461.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_BLS12461_H
+#define CONFIG_FIELD_BLS12461_H
+
+#include"core.h"
+#include "config_big_B464_60.h"
+
+// FP stuff
+
+#define MBITS_BLS12461 461
+#define PM1D2_BLS12461 1
+#define MODTYPE_BLS12461 NOT_SPECIAL
+#define MAXXES_BLS12461 19
+#define QNRI_BLS12461 0
+#define RIADZ_BLS12461 1
+#define RIADZG2A_BLS12461 4
+#define RIADZG2B_BLS12461 0
+#define TOWER_BLS12461 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_BLS12461 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_BLS24479.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_BLS24479.h
new file mode 100644
index 0000000..0d7aeaf
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_BLS24479.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_BLS24479_H
+#define CONFIG_FIELD_BLS24479_H
+
+#include"core.h"
+#include "config_big_B480_56.h"
+
+// FP stuff
+
+#define MBITS_BLS24479 479
+#define PM1D2_BLS24479 1
+#define MODTYPE_BLS24479 NOT_SPECIAL
+#define MAXXES_BLS24479 25
+#define QNRI_BLS24479 0
+#define RIADZ_BLS24479 1
+#define RIADZG2A_BLS24479 4
+#define RIADZG2B_BLS24479 0
+#define TOWER_BLS24479 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_BLS24479 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_BLS48286.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_BLS48286.h
new file mode 100644
index 0000000..c34c09d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_BLS48286.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_BLS48286_H
+#define CONFIG_FIELD_BLS48286_H
+
+#include"core.h"
+#include "config_big_B288_60.h"
+
+// FP stuff
+
+#define MBITS_BLS48286 286
+#define PM1D2_BLS48286 1
+#define MODTYPE_BLS48286 NOT_SPECIAL
+#define MAXXES_BLS48286 14
+#define QNRI_BLS48286 0
+#define RIADZ_BLS48286 1
+#define RIADZG2A_BLS48286 1
+#define RIADZG2B_BLS48286 0
+#define TOWER_BLS48286 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_BLS48286 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_BLS48556.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_BLS48556.h
new file mode 100644
index 0000000..d5705c1
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_BLS48556.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_BLS48556_H
+#define CONFIG_FIELD_BLS48556_H
+
+#include"core.h"
+#include "config_big_B560_58.h"
+
+// FP stuff
+
+#define MBITS_BLS48556 556
+#define PM1D2_BLS48556 1
+#define MODTYPE_BLS48556 NOT_SPECIAL
+#define MAXXES_BLS48556 24
+#define QNRI_BLS48556 0
+#define RIADZ_BLS48556 -1
+#define RIADZG2A_BLS48556 2
+#define RIADZG2B_BLS48556 0
+#define TOWER_BLS48556 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_BLS48556 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_BLS48581.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_BLS48581.h
new file mode 100644
index 0000000..20ad904
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_BLS48581.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_BLS48581_H
+#define CONFIG_FIELD_BLS48581_H
+
+#include"core.h"
+#include "config_big_B584_60.h"
+
+// FP stuff
+
+#define MBITS_BLS48581 581
+#define PM1D2_BLS48581 1
+#define MODTYPE_BLS48581 NOT_SPECIAL
+#define MAXXES_BLS48581 19
+#define QNRI_BLS48581 0
+#define RIADZ_BLS48581 2
+#define RIADZG2A_BLS48581 2
+#define RIADZG2B_BLS48581 0
+#define TOWER_BLS48581 POSITOWER
+
+//#define BIG_ENDIAN_SIGN_BLS48581 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_BN158.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_BN158.h
new file mode 100644
index 0000000..024b195
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_BN158.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_BN158_H
+#define CONFIG_FIELD_BN158_H
+
+#include"core.h"
+#include "config_big_B160_56.h"
+
+// FP stuff
+
+#define MBITS_BN158 158
+#define PM1D2_BN158 1
+#define MODTYPE_BN158 NOT_SPECIAL
+#define MAXXES_BN158 10
+#define QNRI_BN158 0
+#define RIADZ_BN158 1
+#define RIADZG2A_BN158 1
+#define RIADZG2B_BN158 0
+#define TOWER_BN158 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_BN158 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_BN254.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_BN254.h
new file mode 100644
index 0000000..187ae79
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_BN254.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_BN254_H
+#define CONFIG_FIELD_BN254_H
+
+#include"core.h"
+#include "config_big_B256_56.h"
+
+// FP stuff
+
+#define MBITS_BN254 254
+#define PM1D2_BN254 1
+#define MODTYPE_BN254 NOT_SPECIAL
+#define MAXXES_BN254 26
+#define QNRI_BN254 0
+#define RIADZ_BN254 -1
+#define RIADZG2A_BN254 -1
+#define RIADZG2B_BN254 0
+#define TOWER_BN254 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_BN254 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_BN254CX.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_BN254CX.h
new file mode 100644
index 0000000..b3b3e26
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_BN254CX.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_BN254CX_H
+#define CONFIG_FIELD_BN254CX_H
+
+#include"core.h"
+#include "config_big_B256_56.h"
+
+// FP stuff
+
+#define MBITS_BN254CX 254
+#define PM1D2_BN254CX 1
+#define MODTYPE_BN254CX NOT_SPECIAL
+#define MAXXES_BN254CX 26
+#define QNRI_BN254CX 0
+#define RIADZ_BN254CX -1
+#define RIADZG2A_BN254CX -1
+#define RIADZG2B_BN254CX 0
+#define TOWER_BN254CX NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_BN254CX 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_BN462.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_BN462.h
new file mode 100644
index 0000000..1690105
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_BN462.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_BN462_H
+#define CONFIG_FIELD_BN462_H
+
+#include"core.h"
+#include "config_big_B464_60.h"
+
+// FP stuff
+
+#define MBITS_BN462 462
+#define PM1D2_BN462 1
+#define MODTYPE_BN462 NOT_SPECIAL
+#define MAXXES_BN462 18
+#define QNRI_BN462 1
+#define RIADZ_BN462 1
+#define RIADZG2A_BN462 1
+#define RIADZG2B_BN462 0
+#define TOWER_BN462 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_BN462 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_BRAINPOOL.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_BRAINPOOL.h
new file mode 100644
index 0000000..be6cb12
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_BRAINPOOL.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_BRAINPOOL_H
+#define CONFIG_FIELD_BRAINPOOL_H
+
+#include"core.h"
+#include "config_big_B256_56.h"
+
+// FP stuff
+
+#define MBITS_BRAINPOOL 256
+#define PM1D2_BRAINPOOL 1
+#define MODTYPE_BRAINPOOL NOT_SPECIAL
+#define MAXXES_BRAINPOOL 24
+#define QNRI_BRAINPOOL 0
+#define RIADZ_BRAINPOOL -3
+#define RIADZG2A_BRAINPOOL 0
+#define RIADZG2B_BRAINPOOL 0
+#define TOWER_BRAINPOOL NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_BRAINPOOL 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_C1174.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_C1174.h
new file mode 100644
index 0000000..79f81eb
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_C1174.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_C1174_H
+#define CONFIG_FIELD_C1174_H
+
+#include"core.h"
+#include "config_big_B256_56.h"
+
+// FP stuff
+
+#define MBITS_C1174 251
+#define PM1D2_C1174 1
+#define MODTYPE_C1174 PSEUDO_MERSENNE
+#define MAXXES_C1174 29
+#define QNRI_C1174 0
+#define RIADZ_C1174 0
+#define RIADZG2A_C1174 0
+#define RIADZG2B_C1174 0
+#define TOWER_C1174 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_C1174 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_C1665.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_C1665.h
new file mode 100644
index 0000000..8a1b1c4
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_C1665.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_C1665_H
+#define CONFIG_FIELD_C1665_H
+
+#include"core.h"
+#include "config_big_B168_60.h"
+
+// FP stuff
+
+#define MBITS_C1665 166
+#define PM1D2_C1665 1
+#define MODTYPE_C1665 PSEUDO_MERSENNE
+#define MAXXES_C1665 14
+#define QNRI_C1665 0
+#define RIADZ_C1665 0
+#define RIADZG2A_C1665 0
+#define RIADZG2B_C1665 0
+#define TOWER_C1665 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_C1665 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_C41417.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_C41417.h
new file mode 100644
index 0000000..55391bd
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_C41417.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_C41417_H
+#define CONFIG_FIELD_C41417_H
+
+#include"core.h"
+#include "config_big_B416_60.h"
+
+// FP stuff
+
+#define MBITS_C41417 414
+#define PM1D2_C41417 1
+#define MODTYPE_C41417 PSEUDO_MERSENNE
+#define MAXXES_C41417 6
+#define QNRI_C41417 0
+#define RIADZ_C41417 1
+#define RIADZG2A_C41417 0
+#define RIADZG2B_C41417 0
+#define TOWER_C41417 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_C41417 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_F25519.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_F25519.h
new file mode 100644
index 0000000..37c0fe4
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_F25519.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_F25519_H
+#define CONFIG_FIELD_F25519_H
+
+#include"core.h"
+#include "config_big_B256_56.h"
+
+// FP stuff
+
+#define MBITS_F25519 255
+#define PM1D2_F25519 2
+#define MODTYPE_F25519 PSEUDO_MERSENNE
+#define MAXXES_F25519 25
+#define QNRI_F25519 0
+#define RIADZ_F25519 2
+#define RIADZG2A_F25519 0
+#define RIADZG2B_F25519 0
+#define TOWER_F25519 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_F25519 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_F256PME.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_F256PME.h
new file mode 100644
index 0000000..1b1296e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_F256PME.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_F256PME_H
+#define CONFIG_FIELD_F256PME_H
+
+#include"core.h"
+#include "config_big_B256_56.h"
+
+// FP stuff
+
+#define MBITS_F256PME 256
+#define PM1D2_F256PME 1
+#define MODTYPE_F256PME PSEUDO_MERSENNE
+#define MAXXES_F256PME 24
+#define QNRI_F256PME 0
+#define RIADZ_F256PME 0
+#define RIADZG2A_F256PME 0
+#define RIADZG2B_F256PME 0
+#define TOWER_F256PME NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_F256PME 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_F256PMW.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_F256PMW.h
new file mode 100644
index 0000000..8f0a5f8
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_F256PMW.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_F256PMW_H
+#define CONFIG_FIELD_F256PMW_H
+
+#include"core.h"
+#include "config_big_B256_56.h"
+
+// FP stuff
+
+#define MBITS_F256PMW 256
+#define PM1D2_F256PMW 1
+#define MODTYPE_F256PMW PSEUDO_MERSENNE
+#define MAXXES_F256PMW 24
+#define QNRI_F256PMW 0
+#define RIADZ_F256PMW 7
+#define RIADZG2A_F256PMW 0
+#define RIADZG2B_F256PMW 0
+#define TOWER_F256PMW NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_F256PMW 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_F384PM.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_F384PM.h
new file mode 100644
index 0000000..176caf5
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_F384PM.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_F384PM_H
+#define CONFIG_FIELD_F384PM_H
+
+#include"core.h"
+#include "config_big_B384_58.h"
+
+// FP stuff
+
+#define MBITS_F384PM 384
+#define PM1D2_F384PM 1
+#define MODTYPE_F384PM PSEUDO_MERSENNE
+#define MAXXES_F384PM 22
+#define QNRI_F384PM 0
+#define RIADZ_F384PM 0
+#define RIADZG2A_F384PM 0
+#define RIADZG2B_F384PM 0
+#define TOWER_F384PM NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_F384PM 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_F448.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_F448.h
new file mode 100644
index 0000000..39b770e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_F448.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_F448_H
+#define CONFIG_FIELD_F448_H
+
+#include"core.h"
+#include "config_big_B448_58.h"
+
+// FP stuff
+
+#define MBITS_F448 448
+#define PM1D2_F448 1
+#define MODTYPE_F448 GENERALISED_MERSENNE
+#define MAXXES_F448 16
+#define QNRI_F448 0
+#define RIADZ_F448 0
+#define RIADZG2A_F448 0
+#define RIADZG2B_F448 0
+#define TOWER_F448 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_F448 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_F512PM.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_F512PM.h
new file mode 100644
index 0000000..81dfdc2
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_F512PM.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_F512PM_H
+#define CONFIG_FIELD_F512PM_H
+
+#include"core.h"
+#include "config_big_B512_60.h"
+
+// FP stuff
+
+#define MBITS_F512PM 512
+#define PM1D2_F512PM 1
+#define MODTYPE_F512PM PSEUDO_MERSENNE
+#define MAXXES_F512PM 28
+#define QNRI_F512PM 0
+#define RIADZ_F512PM 0
+#define RIADZG2A_F512PM 0
+#define RIADZG2B_F512PM 0
+#define TOWER_F512PM NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_F512PM 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_FP256BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_FP256BN.h
new file mode 100644
index 0000000..ab5d02a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_FP256BN.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_FP256BN_H
+#define CONFIG_FIELD_FP256BN_H
+
+#include"core.h"
+#include "config_big_B256_56.h"
+
+// FP stuff
+
+#define MBITS_FP256BN 256
+#define PM1D2_FP256BN 1
+#define MODTYPE_FP256BN NOT_SPECIAL
+#define MAXXES_FP256BN 24
+#define QNRI_FP256BN 0
+#define RIADZ_FP256BN 1
+#define RIADZG2A_FP256BN 1
+#define RIADZG2B_FP256BN 0
+#define TOWER_FP256BN NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_FP256BN 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_FP512BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_FP512BN.h
new file mode 100644
index 0000000..18c488f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_FP512BN.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_FP512BN_H
+#define CONFIG_FIELD_FP512BN_H
+
+#include"core.h"
+#include "config_big_B512_60.h"
+
+// FP stuff
+
+#define MBITS_FP512BN 512
+#define PM1D2_FP512BN 1
+#define MODTYPE_FP512BN NOT_SPECIAL
+#define MAXXES_FP512BN 28
+#define QNRI_FP512BN 0
+#define RIADZ_FP512BN 1
+#define RIADZG2A_FP512BN 1
+#define RIADZG2B_FP512BN 0
+#define TOWER_FP512BN NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_FP512BN 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_HIFIVE.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_HIFIVE.h
new file mode 100644
index 0000000..85ddf5a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_HIFIVE.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_HIFIVE_H
+#define CONFIG_FIELD_HIFIVE_H
+
+#include"core.h"
+#include "config_big_B336_60.h"
+
+// FP stuff
+
+#define MBITS_HIFIVE 336
+#define PM1D2_HIFIVE 2
+#define MODTYPE_HIFIVE PSEUDO_MERSENNE
+#define MAXXES_HIFIVE 24
+#define QNRI_HIFIVE 0
+#define RIADZ_HIFIVE 1
+#define RIADZG2A_HIFIVE 0
+#define RIADZG2B_HIFIVE 0
+#define TOWER_HIFIVE NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_HIFIVE 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_JUBJUB.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_JUBJUB.h
new file mode 100644
index 0000000..215298f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_JUBJUB.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_JUBJUB_H
+#define CONFIG_FIELD_JUBJUB_H
+
+#include"core.h"
+#include "config_big_B256_56.h"
+
+// FP stuff
+
+#define MBITS_JUBJUB 255
+#define PM1D2_JUBJUB 32
+#define MODTYPE_JUBJUB NOT_SPECIAL
+#define MAXXES_JUBJUB 25
+#define QNRI_JUBJUB 5
+#define RIADZ_JUBJUB 1
+#define RIADZG2A_JUBJUB 0
+#define RIADZG2B_JUBJUB 0
+#define TOWER_JUBJUB NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_JUBJUB 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_MDC.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_MDC.h
new file mode 100644
index 0000000..2e4e77d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_MDC.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_MDC_H
+#define CONFIG_FIELD_MDC_H
+
+#include"core.h"
+#include "config_big_B256_56.h"
+
+// FP stuff
+
+#define MBITS_MDC 256
+#define PM1D2_MDC 1
+#define MODTYPE_MDC NOT_SPECIAL
+#define MAXXES_MDC 24
+#define QNRI_MDC 0
+#define RIADZ_MDC 0
+#define RIADZG2A_MDC 0
+#define RIADZG2B_MDC 0
+#define TOWER_MDC NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_MDC 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_NIST256.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_NIST256.h
new file mode 100644
index 0000000..dc4676b
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_NIST256.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_NIST256_H
+#define CONFIG_FIELD_NIST256_H
+
+#include"core.h"
+#include "config_big_B256_56.h"
+
+// FP stuff
+
+#define MBITS_NIST256 256
+#define PM1D2_NIST256 1
+#define MODTYPE_NIST256 NOT_SPECIAL
+#define MAXXES_NIST256 24
+#define QNRI_NIST256 0
+#define RIADZ_NIST256 -10
+#define RIADZG2A_NIST256 0
+#define RIADZG2B_NIST256 0
+#define TOWER_NIST256 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_NIST256 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_NIST384.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_NIST384.h
new file mode 100644
index 0000000..50dfbb7
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_NIST384.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_NIST384_H
+#define CONFIG_FIELD_NIST384_H
+
+#include"core.h"
+#include "config_big_B384_56.h"
+
+// FP stuff
+
+#define MBITS_NIST384 384
+#define PM1D2_NIST384 1
+#define MODTYPE_NIST384 NOT_SPECIAL
+#define MAXXES_NIST384 8
+#define QNRI_NIST384 0
+#define RIADZ_NIST384 -12
+#define RIADZG2A_NIST384 0
+#define RIADZG2B_NIST384 0
+#define TOWER_NIST384 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_NIST384 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_NIST521.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_NIST521.h
new file mode 100644
index 0000000..eab05bc
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_NIST521.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_NIST521_H
+#define CONFIG_FIELD_NIST521_H
+
+#include"core.h"
+#include "config_big_B528_60.h"
+
+// FP stuff
+
+#define MBITS_NIST521 521
+#define PM1D2_NIST521 1
+#define MODTYPE_NIST521 PSEUDO_MERSENNE
+#define MAXXES_NIST521 19
+#define QNRI_NIST521 0
+#define RIADZ_NIST521 -4
+#define RIADZG2A_NIST521 0
+#define RIADZG2B_NIST521 0
+#define TOWER_NIST521 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_NIST521 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_SECP160R1.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_SECP160R1.h
new file mode 100644
index 0000000..144a7fc
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_SECP160R1.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_SECP160R1_H
+#define CONFIG_FIELD_SECP160R1_H
+
+#include"core.h"
+#include "config_big_B160_56.h"
+
+// FP stuff
+
+#define MBITS_SECP160R1 160
+#define PM1D2_SECP160R1 1
+#define MODTYPE_SECP160R1 NOT_SPECIAL
+#define MAXXES_SECP160R1 8
+#define QNRI_SECP160R1 0
+#define RIADZ_SECP160R1 3
+#define RIADZG2A_SECP160R1 0
+#define RIADZG2B_SECP160R1 0
+#define TOWER_SECP160R1 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_SECP160R1 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_SECP256K1.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_SECP256K1.h
new file mode 100644
index 0000000..dfdb516
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_SECP256K1.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_SECP256K1_H
+#define CONFIG_FIELD_SECP256K1_H
+
+#include"core.h"
+#include "config_big_B256_56.h"
+
+// FP stuff
+
+#define MBITS_SECP256K1 256
+#define PM1D2_SECP256K1 1
+#define MODTYPE_SECP256K1 NOT_SPECIAL
+#define MAXXES_SECP256K1 24
+#define QNRI_SECP256K1 0
+#define RIADZ_SECP256K1 -11
+#define RIADZG2A_SECP256K1 0
+#define RIADZG2B_SECP256K1 0
+#define TOWER_SECP256K1 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_SECP256K1 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_SM2.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_SM2.h
new file mode 100644
index 0000000..ff92883
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_SM2.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_SM2_H
+#define CONFIG_FIELD_SM2_H
+
+#include"core.h"
+#include "config_big_B256_56.h"
+
+// FP stuff
+
+#define MBITS_SM2 256
+#define PM1D2_SM2 1
+#define MODTYPE_SM2 NOT_SPECIAL
+#define MAXXES_SM2 24
+#define QNRI_SM2 0
+#define RIADZ_SM2 -9
+#define RIADZG2A_SM2 0
+#define RIADZG2B_SM2 0
+#define TOWER_SM2 NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_SM2 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_TWEEDLEDEE.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_TWEEDLEDEE.h
new file mode 100644
index 0000000..55d7fd8
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_TWEEDLEDEE.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_TWEEDLEDEE_H
+#define CONFIG_FIELD_TWEEDLEDEE_H
+
+#include"core.h"
+#include "config_big_B256_56.h"
+
+// FP stuff
+
+#define MBITS_TWEEDLEDEE 255
+#define PM1D2_TWEEDLEDEE 34
+#define MODTYPE_TWEEDLEDEE NOT_SPECIAL
+#define MAXXES_TWEEDLEDEE 25
+#define QNRI_TWEEDLEDEE 5
+#define RIADZ_TWEEDLEDEE 1
+#define RIADZG2A_TWEEDLEDEE 0
+#define RIADZG2B_TWEEDLEDEE 0
+#define TOWER_TWEEDLEDEE NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_TWEEDLEDEE 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_TWEEDLEDUM.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_TWEEDLEDUM.h
new file mode 100644
index 0000000..5f47ddc
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/config_field_TWEEDLEDUM.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CONFIG_FIELD_TWEEDLEDUM_H
+#define CONFIG_FIELD_TWEEDLEDUM_H
+
+#include"core.h"
+#include "config_big_B256_56.h"
+
+// FP stuff
+
+#define MBITS_TWEEDLEDUM 255
+#define PM1D2_TWEEDLEDUM 33
+#define MODTYPE_TWEEDLEDUM NOT_SPECIAL
+#define MAXXES_TWEEDLEDUM 25
+#define QNRI_TWEEDLEDUM 5
+#define RIADZ_TWEEDLEDUM 1
+#define RIADZG2A_TWEEDLEDUM 0
+#define RIADZG2B_TWEEDLEDUM 0
+#define TOWER_TWEEDLEDUM NEGATOWER
+
+//#define BIG_ENDIAN_SIGN_TWEEDLEDUM 
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/core.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/core.h
new file mode 100644
index 0000000..a829258
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/core.h
@@ -0,0 +1,860 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef CORE_H
+#define CORE_H
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <stdbool.h>
+#include <stdint.h>
+#include "arch.h"
+
+namespace core {
+
+//#define CORE_ARDUINO
+
+/* modulus types */
+
+#define NOT_SPECIAL 0	       /**< Modulus of no exploitable form */
+#define PSEUDO_MERSENNE 1      /**< Pseudo-mersenne modulus of form $2^n-c$  */
+#define MONTGOMERY_FRIENDLY 3  /**< Montgomery Friendly modulus of form $2^a(2^b-c)-1$  */
+#define GENERALISED_MERSENNE 2 /**< Generalised-mersenne modulus of form $2^n-2^m-1$, Ed448 only */
+
+/* Curve types */
+
+#define WEIERSTRASS 0 /**< Short Weierstrass form curve  */
+#define EDWARDS 1     /**< Edwards or Twisted Edwards curve  */
+#define MONTGOMERY 2  /**< Montgomery form curve  */
+
+/* Pairing-Friendly types */
+
+#define NOT_PF 0
+#define BN_CURVE 1
+#define BLS12_CURVE 2
+#define BLS24_CURVE 3
+#define BLS48_CURVE 4
+
+#define D_TYPE 0
+#define M_TYPE 1
+
+#define FP_ZILCH 0			// 0
+#define FP_UNITY 1			// 1
+#define FP_SPARSEST 2		// [[AB][c0][00]]
+#define FP_SPARSER 3		// [[AB][C0][00]]
+#define FP_SPARSE 4			// [[AB][CD][E0]]
+#define FP_DENSE 5			// [[AB][CD][EF]]
+
+#define NEGATOWER 0			// Extension field tower type
+#define POSITOWER 1
+
+/**
+ * @brief SHA256 hash function instance */
+typedef struct
+{
+    unsign32 length[2]; /**< 64-bit input length */
+    unsign32 h[8];      /**< Internal state */
+    unsign32 w[64];	/**< Internal state */
+    int hlen;		/**< Hash length in bytes */
+} hash256;
+
+/**
+ * @brief SHA384-512 hash function instance */
+typedef struct
+{
+    unsign64 length[2]; /**< 64-bit input length */
+    unsign64 h[8];      /**< Internal state */
+    unsign64 w[80];	/**< Internal state */
+    int hlen;           /**< Hash length in bytes */
+} hash512;
+
+/**
+ * @brief SHA384 hash function instance */
+typedef hash512 hash384;
+
+/**
+ * @brief SHA3 hash function instance */
+typedef struct {
+    int length;
+    unsign64 S[25];
+    int rate, len;
+} sha3;
+
+#define MC_SHA2 2
+#define MC_SHA3 3
+
+#define SHA256 32 /**< SHA-256 hashing */
+#define SHA384 48 /**< SHA-384 hashing */
+#define SHA512 64 /**< SHA-512 hashing */
+
+#define SHA3_HASH224 28 /**< SHA3 224 bit hash */
+#define SHA3_HASH256 32 /**< SHA3 256 bit hash */
+#define SHA3_HASH384 48 /**< SHA3 384 bit hash */
+#define SHA3_HASH512 64 /**< SHA3 512 bit hash */
+
+#define SHAKE128 16 /**< SHAKE128   hash */
+#define SHAKE256 32 /**< SHAKE256   hash */
+
+/* Symmetric Encryption AES structure */
+
+#define ECB   0  /**< Electronic Code Book */
+#define CBC   1  /**< Cipher Block Chaining */
+#define CFB1  2  /**< Cipher Feedback - 1 byte */
+#define CFB2  3  /**< Cipher Feedback - 2 bytes */
+#define CFB4  5  /**< Cipher Feedback - 4 bytes */
+#define OFB1  14 /**< Output Feedback - 1 byte */
+#define OFB2  15 /**< Output Feedback - 2 bytes */
+#define OFB4  17 /**< Output Feedback - 4 bytes */
+#define OFB8  21 /**< Output Feedback - 8 bytes */
+#define OFB16 29 /**< Output Feedback - 16 bytes */
+#define CTR1  30 /**< Counter Mode - 1 byte */
+#define CTR2  31 /**< Counter Mode - 2 bytes */
+#define CTR4  33 /**< Counter Mode - 4 bytes */
+#define CTR8  37 /**< Counter Mode - 8 bytes */
+#define CTR16 45 /**< Counter Mode - 16 bytes */
+
+#define uchar unsigned char  /**<  Unsigned char */
+
+/**
+	@brief AES instance
+*/
+
+
+typedef struct
+{
+    int Nk;            /**< AES Key Length */
+    int Nr;            /**< AES Number of rounds */
+    int mode;          /**< AES mode of operation */
+    unsign32 fkey[60]; /**< subkeys for encrypton */
+    unsign32 rkey[60]; /**< subkeys for decrypton */
+    char f[16];        /**< buffer for chaining vector */
+} aes;
+
+/* AES-GCM suppport.  */
+
+#define GCM_ACCEPTING_HEADER 0   /**< GCM status */
+#define GCM_ACCEPTING_CIPHER 1   /**< GCM status */
+#define GCM_NOT_ACCEPTING_MORE 2 /**< GCM status */
+#define GCM_FINISHED 3           /**< GCM status */
+#define GCM_ENCRYPTING 0         /**< GCM mode */
+#define GCM_DECRYPTING 1         /**< GCM mode */
+
+
+/**
+	@brief GCM mode instance, using AES internally
+*/
+
+typedef struct
+{
+    unsign32 table[128][4]; /**< 2k byte table */
+    uchar stateX[16];	    /**< GCM Internal State */
+    uchar Y_0[16];	    /**< GCM Internal State */
+    unsign32 lenA[2];	    /**< GCM 64-bit length of header */
+    unsign32 lenC[2];	    /**< GCM 64-bit length of ciphertext */
+    int status;		    /**< GCM Status */
+    aes a;		    /**< Internal Instance of aes cipher */
+} gcm;
+
+/* Marsaglia & Zaman Random number generator constants */
+
+#define NK   21 /**< PRNG constant */
+#define NJ   6  /**< PRNG constant */
+#define NV   8  /**< PRNG constant */
+
+
+/**
+	@brief Cryptographically secure pseudo-random number generator instance
+*/
+
+typedef struct
+{
+    unsign32 ira[NK]; /**< random number array   */
+    int      rndptr;  /**< pointer into array */
+    unsign32 borrow;  /**<  borrow as a result of subtraction */
+    int pool_ptr;     /**< pointer into random pool */
+    char pool[32];    /**< random pool */
+} csprng;
+
+
+/**
+	@brief Portable representation of a big positive number
+*/
+
+typedef struct
+{
+    int len;   /**< length in bytes  */
+    int max;   /**< max length allowed - enforce truncation  */
+    char *val; /**< byte array  */
+} octet;
+
+/**
+ * @brief Share instance */
+typedef struct
+{
+    int id;  /**< Unique Share ID */
+    int nsr; /**< number of shares required */
+    octet *B; /**< share as octet */
+} share;
+
+/* Octet string handlers */
+/**	@brief Formats and outputs an octet to the console in hex
+ *
+	@param O Octet to be output
+ */
+extern void OCT_output(octet *O);
+/**	@brief Formats and outputs an octet to the console as a character string
+ *
+	@param O Octet to be output
+ */
+extern void OCT_output_string(octet *O);
+/**	@brief Wipe clean an octet
+ *
+	@param O Octet to be cleaned
+ */
+extern void OCT_clear(octet *O);
+
+/**	@brief Reverse bytes in an octet
+ *
+	@param O Octet to be reversed
+ */
+extern void OCT_reverse(octet *O);
+
+/**	@brief Compare two octets
+ *
+	@param O first Octet to be compared
+	@param P second Octet to be compared
+	@return 1 if equal, else 0
+ */
+extern int  OCT_comp(octet *O, octet *P);
+
+
+/**	@brief Compare first n bytes of two octets
+ *
+	@param O first Octet to be compared
+	@param P second Octet to be compared
+	@param n number of bytes to compare
+	@return 1 if equal, else 0
+ */
+extern int  OCT_ncomp(octet *O, octet *P, int n);
+/**	@brief Join from a C string to end of an octet
+ *
+	Truncates if there is no room
+	@param O Octet to be written to
+	@param s zero terminated string to be joined to octet
+ */
+extern void OCT_jstring(octet *O, char *s);
+/**	@brief Join bytes to end of an octet
+ *
+	Truncates if there is no room
+	@param O Octet to be written to
+	@param s bytes to be joined to end of octet
+	@param n number of bytes to join
+ */
+extern void OCT_jbytes(octet *O, char *s, int n);
+/**	@brief Join single byte to end of an octet, repeated n times
+ *
+	Truncates if there is no room
+	@param O Octet to be written to
+	@param b byte to be joined to end of octet
+	@param n number of times b is to be joined
+ */
+extern void OCT_jbyte(octet *O, int b, int n);
+/**	@brief Join one octet to the end of another
+ *
+	Truncates if there is no room
+	@param O Octet to be written to
+	@param P Octet to be joined to the end of O
+ */
+extern void OCT_joctet(octet *O, octet *P);
+/**	@brief XOR common bytes of a pair of Octets
+ *
+	@param O Octet - on exit = O xor P
+	@param P Octet to be xored into O
+ */
+extern void OCT_xor(octet *O, octet *P);
+/**	@brief reset Octet to zero length
+ *
+	@param O Octet to be emptied
+ */
+extern void OCT_empty(octet *O);
+/**	@brief Pad out an Octet to the given length
+ *
+	Padding is done by inserting leading zeros, so abcd becomes 00abcd
+	@param O Octet to be padded
+	@param n new length of Octet
+ */
+extern int OCT_pad(octet *O, int n);
+/**	@brief Convert an Octet to printable base64 number
+ *
+	@param b zero terminated byte array to take base64 conversion
+	@param O Octet to be converted
+ */
+extern void OCT_tobase64(char *b, octet *O);
+/**	@brief Populate an Octet from base64 number
+ *
+ 	@param O Octet to be populated
+	@param b zero terminated base64 string
+
+ */
+extern void OCT_frombase64(octet *O, char *b);
+/**	@brief Copy one Octet into another
+ *
+ 	@param O Octet to be copied to
+	@param P Octet to be copied from
+
+ */
+extern void OCT_copy(octet *O, octet *P);
+/**	@brief XOR every byte of an octet with input m
+ *
+ 	@param O Octet
+	@param m byte to be XORed with every byte of O
+
+ */
+extern void OCT_xorbyte(octet *O, int m);
+/**	@brief Chops Octet into two, leaving first n bytes in O, moving the rest to P
+ *
+ 	@param O Octet to be chopped
+	@param P new Octet to be created
+	@param n number of bytes to chop off O
+
+ */
+extern void OCT_chop(octet *O, octet *P, int n);
+/**	@brief Join n bytes of integer m to end of Octet O (big endian)
+ *
+	Typically n is 4 for a 32-bit integer
+ 	@param O Octet to be appended to
+	@param m integer to be appended to O
+	@param n number of bytes in m
+
+ */
+extern void OCT_jint(octet *O, unsigned int m, int n);
+/**	@brief Create an Octet from bytes taken from a random number generator
+ *
+	Truncates if there is no room
+ 	@param O Octet to be populated
+	@param R an instance of a Cryptographically Secure Random Number Generator
+	@param n number of bytes to extracted from R
+
+ */
+extern void OCT_rand(octet *O, csprng *R, int n);
+/**	@brief Shifts Octet left by n bytes
+ *
+	Leftmost bytes disappear
+ 	@param O Octet to be shifted
+	@param n number of bytes to shift
+
+ */
+extern void OCT_shl(octet *O, int n);
+/**	@brief Convert a hex number to an Octet
+ *
+	@param dst Octet
+	@param src Hex string to be converted
+ */
+extern void OCT_fromHex(octet *dst, char *src);
+/**	@brief Convert an Octet to printable hex number
+ *
+	@param dst hex value
+	@param src Octet to be converted
+ */
+extern void OCT_toHex(octet *src, char *dst);
+/**	@brief Convert an Octet to string
+ *
+	@param dst string value
+	@param src Octet to be converted
+ */
+extern void OCT_toStr(octet *src, char *dst);
+
+
+
+/* Hash function */
+/**	@brief Initialise an instance of SHA256
+ *
+	@param H an instance SHA256
+ */
+extern void HASH256_init(hash256 *H);
+/**	@brief Add a byte to the hash
+ *
+	@param H an instance SHA256
+	@param b byte to be included in hash
+ */
+extern void HASH256_process(hash256 *H, int b);
+/**	@brief Generate 32-byte final hash
+ *
+	@param H an instance SHA256
+	@param h is the output 32-byte hash
+ */
+extern void HASH256_hash(hash256 *H, char *h);
+
+/**	@brief Generate 32-byte intermediate hash
+ *
+	@param H an instance SHA256
+	@param h is the output 32-byte hash
+ */
+extern void HASH256_continuing_hash(hash256 *H, char *h);
+
+/**	@brief Initialise an instance of SHA384
+ *
+	@param H an instance SHA384
+ */
+extern void HASH384_init(hash384 *H);
+/**	@brief Add a byte to the hash
+ *
+	@param H an instance SHA384
+	@param b byte to be included in hash
+ */
+extern void HASH384_process(hash384 *H, int b);
+/**	@brief Generate 48-byte final hash
+ *
+	@param H an instance SHA384
+	@param h is the output 48-byte hash
+ */
+extern void HASH384_hash(hash384 *H, char *h);
+
+/**	@brief Generate 48-byte intermediate hash
+ *
+	@param H an instance SHA384
+	@param h is the output 48-byte hash
+ */
+extern void HASH384_continuing_hash(hash384 *H, char *h);
+
+/**	@brief Initialise an instance of SHA512
+ *
+	@param H an instance SHA512
+ */
+extern void HASH512_init(hash512 *H);
+/**	@brief Add a byte to the hash
+ *
+	@param H an instance SHA512
+	@param b byte to be included in hash
+ */
+extern void HASH512_process(hash512 *H, int b);
+/**	@brief Generate 64-byte final hash
+ *
+	@param H an instance SHA512
+	@param h is the output 64-byte hash
+ */
+extern void HASH512_hash(hash512 *H, char *h);
+
+/**	@brief Generate 64-byte intermediate hash
+ *
+	@param H an instance SHA512
+	@param h is the output 64-byte hash
+ */
+extern void HASH512_continuing_hash(hash512 *H, char *h);
+
+/**	@brief Initialise an instance of SHA3
+ *
+	@param H an instance SHA3
+	@param t the instance type
+ */
+extern void  SHA3_init(sha3 *H, int t);
+/**	@brief process a byte for SHA3
+ *
+	@param H an instance SHA3
+	@param b a byte of date to be processed
+ */
+extern void  SHA3_process(sha3 *H, int b);
+/**	@brief create fixed length final hash output of SHA3
+ *
+	@param H an instance SHA3
+	@param h a byte array to take hash
+ */
+extern void  SHA3_hash(sha3 *H, char *h);
+
+/**	@brief create fixed length intermediate hash output of SHA3
+ *
+	@param H an instance SHA3
+	@param h a byte array to take hash
+ */
+extern void  SHA3_continuing_hash(sha3 *H, char *h);
+
+/**	@brief create variable length final hash output of SHA3
+ *
+	@param H an instance SHA3
+	@param h a byte array to take hash
+	@param len is the length of the hash
+ */
+extern void  SHA3_shake(sha3 *H, char *h, int len);
+
+/**	@brief create variable length intermediate hash output of SHA3
+ *
+	@param H an instance SHA3
+	@param h a byte array to take hash
+	@param len is the length of the hash
+ */
+extern void  SHA3_continuing_shake(sha3 *H, char *h, int len);
+
+/**	@brief generate further hash output of SHA3
+ *
+	@param H an instance SHA3
+	@param h a byte array to take hash
+	@param len is the length of the hash
+ */
+extern void  SHA3_squeeze(sha3 *H, char *h, int len);
+
+/* MAC functions */
+
+/**	@brief General Purpose Hashing function
+ *
+    @param hash the hash family (SHA2 or SHA3)
+	@param hlen the hash function output length (32,48 or 64)
+	@param w an output octet
+    @param olen the output length
+    @param pad zero padding
+    @param p an input octet
+    @param n an input 32-bit integer
+    @param x an optional input octet
+ */
+extern void GPhash(int hash,int hlen,octet *w,int olen,int pad,octet *p,int n,octet *x);
+
+/**	@brief Simple purpose Hashing function
+ *
+    @param hash the hash family (SHA2 or SHA3)
+	@param hlen the hash function output length (32,48 or 64)
+	@param w an output octet
+    @param p an input octet
+ */
+extern void SPhash(int hash, int hlen,octet *w, octet *p);
+
+/**	@brief HMAC function
+ *
+	@param T an output tag
+    @param len the tag length
+    @param K an input key, or salt
+    @param M an input message
+    @param hash the hash family (SHA2 or SHA3)
+	@param hlen the hash function output length (32,48 or 64)
+ */
+extern void HMAC(int hash,int hlen,octet *T,int len,octet *K,octet *M);
+
+
+/**	@brief HKDF_Extract function
+ *
+    @param hash the hash family (SHA2 or SHA3)
+	@param hlen the hash function output length (32,48 or 64)
+	@param K an output Key
+    @param P public input salt
+    @param S raw secret keying material
+ */
+extern void HKDF_Extract(int hash,int hlen,octet *K,octet *P,octet *S);
+
+/**	@brief HKDF_Expand function
+ *
+    @param hash the hash family (SHA2 or SHA3)
+	@param hlen the hash function output length (32,48 or 64)
+	@param E an expanded output Key
+    @param olen is the desired length of the expanded key
+    @param K is the fixed length input key
+    @param I is public context information
+
+ */
+extern void HKDF_Expand(int hash,int hlen,octet *E,int olen,octet *K,octet *I);
+
+/**	@brief XOF_Expand function
+ *
+	@param hlen the SHA3 output length (16 or 32)
+	@param E an expanded messsage
+    @param olen is the desired length of the expanded key
+    @param P is Domain Separator
+    @param S input message
+
+ */
+extern void XOF_Expand(int hlen,octet *E,int olen,octet *P,octet *S);
+
+/**	@brief XOF_Expand function
+ *
+    @param hash the hash family (SHA2 or SHA3)
+	@param hlen the SHA3 output length (16 or 32)
+	@param E an expanded messsage
+    @param olen is the desired length of the expanded key
+    @param P is Domain Separator
+    @param S input message
+
+ */
+extern void XMD_Expand(int hash,int hlen,octet *E,int olen,octet *P,octet *S);
+
+
+/** @brief PKCS V1.5 padding of a message prior to RSA signature
+ *
+    @param h is the hash type
+    @param M is the input message
+    @param W is the output encoding, ready for RSA signature
+    @return 1 if OK, else 0
+ */
+extern int PKCS15(int h, octet *M, octet *W);
+
+/** @brief Alternative PKCS V1.5 padding of a message prior to RSA signature
+ *
+    @param h is the hash type
+    @param M is the input message
+    @param W is the output encoding, ready for RSA signature
+    @return 1 if OK, else 0
+ */
+extern int PKCS15b(int h, octet *M, octet *W);
+
+/** @brief PSS padding of a message prior to RSA signature
+ *
+    @param h is the hash type
+    @param M is the input message
+    @param R is a pointer to a cryptographically secure random number generator
+    @param W is the output encoding, ready for RSA signature
+    @return 1 if OK, else 0
+ */
+extern int PSS_ENCODE(int h, octet *M, csprng *R, octet *W);
+
+/** @brief PSS verification
+ *
+    @param h is the hash type
+    @param M is the message
+    @param W is the message encoding
+    @return 1 if OK, else 0
+ */
+extern int PSS_VERIFY(int h, octet *M, octet *W);
+
+
+/** @brief OAEP padding of a message prior to RSA encryption
+ *
+    @param h is the hash type
+    @param M is the input message
+    @param R is a pointer to a cryptographically secure random number generator
+    @param P are input encoding parameter string (could be NULL)
+    @param F is the output encoding, ready for RSA encryption
+    @return 1 if OK, else 0
+ */
+extern int  OAEP_ENCODE(int h, octet *M, csprng *R, octet *P, octet *F);
+/** @brief OAEP unpadding of a message after RSA decryption
+ *
+    Unpadding is done in-place
+    @param h is the hash type
+    @param P are input encoding parameter string (could be NULL)
+    @param F is input padded message, unpadded on output
+    @return 1 if OK, else 0
+ */
+extern int  OAEP_DECODE(int h, octet *P, octet *F);
+
+/**	@brief Key Derivation Function - generates key K from inputs Z and P
+ *
+	IEEE-1363 KDF2 Key Derivation Function. 
+	@param hash is the hash family (SHA2 or SHA3)
+    @param hlen the hash function output length (32,48 or 64)
+	@param Z input octet
+	@param P input key derivation parameters - can be NULL
+	@param len is output desired length of key
+	@param K is the derived key
+ */
+extern void KDF2(int hash, int hlen, octet *K, int len, octet *Z, octet *P);
+/**	@brief Password Based Key Derivation Function - generates key K from password, salt and repeat counter
+ *
+	PBKDF2 Password Based Key Derivation Function. 
+	@param hash is the hash family (SHA2 or SHA3)
+    @param hlen the hash function output length (32,48 or 64)
+	@param P input password
+	@param S input salt
+	@param rep Number of times to be iterated.
+	@param len is output desired length
+	@param K is the derived key
+ */
+extern void PBKDF2(int hash, int hlen, octet *K, int len, octet *P, octet *S, int rep);
+
+/* AES functions */
+/**	@brief Reset AES mode or IV
+ *
+	@param A an instance of the aes
+	@param m is the new active mode of operation (ECB, CBC, OFB, CFB etc)
+	@param iv the new Initialisation Vector
+ */
+extern void AES_reset(aes *A, int m, char *iv);
+/**	@brief Extract chaining vector from aes instance
+ *
+	@param A an instance of the aes
+	@param f the extracted chaining vector
+ */
+extern void AES_getreg(aes *A, char * f);
+/**	@brief Initialise an instance of aes and its mode of operation
+ *
+	@param A an instance aes
+	@param m is the active mode of operation (ECB, CBC, OFB, CFB etc)
+	@param n is the key length in bytes, 16, 24 or 32
+	@param k the AES key as an array of 16 bytes
+	@param iv the Initialisation Vector
+	@return 0 for invalid n
+ */
+extern int AES_init(aes *A, int m, int n, char *k, char *iv);
+/**	@brief Encrypt a single 16 byte block in ECB mode
+ *
+	@param A an instance of the aes
+	@param b is an array of 16 plaintext bytes, on exit becomes ciphertext
+ */
+extern void AES_ecb_encrypt(aes *A, uchar * b);
+/**	@brief Decrypt a single 16 byte block in ECB mode
+ *
+	@param A an instance of the aes
+	@param b is an array of 16 cipherext bytes, on exit becomes plaintext
+ */
+extern void AES_ecb_decrypt(aes *A, uchar * b);
+/**	@brief Encrypt a single 16 byte block in active mode
+ *
+	@param A an instance of the aes
+	@param b is an array of 16 plaintext bytes, on exit becomes ciphertext
+	@return 0, or overflow bytes from CFB mode
+ */
+extern unsign32 AES_encrypt(aes *A, char *b );
+/**	@brief Decrypt a single 16 byte block in active mode
+ *
+	@param A an instance of the aes
+	@param b is an array of 16 ciphertext bytes, on exit becomes plaintext
+	@return 0, or overflow bytes from CFB mode
+ */
+extern unsign32 AES_decrypt(aes *A, char *b);
+/**	@brief Clean up after application of AES
+ *
+	@param A an instance of the aes
+ */
+extern void AES_end(aes *A);
+
+/**	@brief AES encrypts a plaintext to a ciphtertext
+ *
+	IEEE-1363 AES_CBC_IV0_ENCRYPT function. Encrypts in CBC mode with a zero IV, padding as necessary to create a full final block.
+	@param K AES key
+	@param P input plaintext octet
+	@param C output ciphertext octet
+ */
+extern void AES_CBC_IV0_ENCRYPT(octet *K, octet *P, octet *C);
+/**	@brief AES encrypts a plaintext to a ciphtertext
+ *
+	IEEE-1363 AES_CBC_IV0_DECRYPT function. Decrypts in CBC mode with a zero IV.
+	@param K AES key
+	@param C input ciphertext octet
+	@param P output plaintext octet
+	@return 0 if bad input, else 1
+ */
+extern int AES_CBC_IV0_DECRYPT(octet *K, octet *C, octet *P);
+
+/* AES-GCM functions */
+/**	@brief Initialise an instance of AES-GCM mode
+ *
+	@param G an instance AES-GCM
+	@param nk is the key length in bytes, 16, 24 or 32
+	@param k the AES key as an array of 16 bytes
+	@param n the number of bytes in the Initialisation Vector (IV)
+	@param iv the IV
+ */
+extern void GCM_init(gcm *G, int nk, char *k, int n, char *iv);
+/**	@brief Add header (material to be authenticated but not encrypted)
+ *
+	Note that this function can be called any number of times with n a multiple of 16, and then one last time with any value for n
+	@param G an instance AES-GCM
+	@param b is the header material to be added
+	@param n the number of bytes in the header
+ */
+extern int GCM_add_header(gcm *G, char *b, int n);
+/**	@brief Add plaintext and extract ciphertext
+ *
+	Note that this function can be called any number of times with n a multiple of 16, and then one last time with any value for n
+	@param G an instance AES-GCM
+	@param c is the ciphertext generated
+	@param p is the plaintext material to be added
+	@param n the number of bytes in the plaintext
+ */
+extern int GCM_add_plain(gcm *G, char *c, char *p, int n);
+/**	@brief Add ciphertext and extract plaintext
+ *
+	Note that this function can be called any number of times with n a multiple of 16, and then one last time with any value for n
+	@param G an instance AES-GCM
+	@param p is the plaintext generated
+	@param c is the ciphertext material to be added
+	@param n the number of bytes in the ciphertext
+ */
+extern int GCM_add_cipher(gcm *G, char *p, char *c, int n);
+/**	@brief Finish off and extract authentication tag (HMAC)
+ *
+	@param G is an active instance AES-GCM
+	@param t is the output 16 byte authentication tag
+ */
+extern void GCM_finish(gcm *G, char *t);
+
+/**	@brief AES-GCM Encryption
+ *
+	@param K  AES key
+	@param IV Initialization vector
+	@param H Header
+	@param P Plaintext
+	@param C Ciphertext
+	@param T Checksum
+ */
+void AES_GCM_ENCRYPT(octet *K, octet *IV, octet *H, octet *P, octet *C, octet *T);
+
+/**	@brief AES-GCM Decryption
+ *
+	@param K  AES key
+	@param IV Initialization vector
+	@param H Header
+	@param P Plaintext
+	@param C Ciphertext
+	@param T Checksum
+ */
+void AES_GCM_DECRYPT(octet *K, octet *IV, octet *H, octet *C, octet *P, octet *T);
+
+
+/* secret sharing */
+
+/**	@brief Get a share of a message
+ *
+    @param id unique share ID
+    @param nsr number of shares needed for message recovery
+    @param S the output share as an octet
+    @param M the Message octet to be shared
+	@param R an octet of random seed bytes
+	@return a share structure
+
+ */
+extern share getshare(int id,int nsr,octet *S,octet *M,octet *R);
+/**	@brief Recover message from shares
+ *
+    @param M the recovered Message octet
+    @param S an array of sufficient shares
+    @return 0 on success else -1
+ */
+extern int recover(octet *M,share *S);
+
+/* random numbers */
+/**	@brief Seed a random number generator from an array of bytes
+ *
+	The provided seed should be truly random
+	@param R an instance of a Cryptographically Secure Random Number Generator
+	@param n the number of seed bytes provided
+	@param b an array of seed bytes
+
+ */
+extern void RAND_seed(csprng *R, int n, char *b);
+/**	@brief Delete all internal state of a random number generator
+ *
+	@param R an instance of a Cryptographically Secure Random Number Generator
+ */
+extern void RAND_clean(csprng *R);
+/**	@brief Return a random byte from a random number generator
+ *
+	@param R an instance of a Cryptographically Secure Random Number Generator
+	@return a random byte
+ */
+extern int RAND_byte(csprng *R);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/dilithium.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/dilithium.h
new file mode 100644
index 0000000..73ccbb1
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/dilithium.h
@@ -0,0 +1,151 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* Dilithium API */
+
+#ifndef DILITHIUM_H
+#define DILITHIUM_H
+
+#include "core.h"
+
+/* DILITHIUM parameters */
+
+//q= 8380417
+#define DL_LGN 8
+#define DL_DEGREE (1 << DL_LGN)
+#define DL_PRIME 0x7fe001
+#define DL_D 13
+#define DL_TD (23-DL_D)
+
+#define DL_ONE 0x3FFE00    // R mod Q
+#define DL_COMBO 0xA3FA    // ONE*inv mod Q
+#define DL_R2MODP 0x2419FF // R^2 mod Q
+#define DL_ND 0xFC7FDFFF   // 1/(R-Q) mod R
+
+#define DL_MAXLG 19
+#define DL_MAXK 8     // could reduce these if not using highest security
+#define DL_MAXL 7
+#define DL_YBYTES (((DL_MAXLG+1)*DL_DEGREE)/8)
+
+#define DL_SK_SIZE_2 (32*3+DL_DEGREE*(4*13+4*3+4*3)/8)
+#define DL_PK_SIZE_2 ((4*DL_DEGREE*DL_TD)/8+32)
+#define DL_SIG_SIZE_2 ((DL_DEGREE*4*(17+1))/8+80+4+32)
+
+#define DL_SK_SIZE_3 (32*3+DL_DEGREE*(6*13+5*4+6*4)/8)
+#define DL_PK_SIZE_3 ((6*DL_DEGREE*DL_TD)/8+32)
+#define DL_SIG_SIZE_3 ((DL_DEGREE*5*(19+1))/8+55+6+32)
+
+#define DL_SK_SIZE_5 (32*3+DL_DEGREE*(8*13+7*3+8*3)/8)
+#define DL_PK_SIZE_5 ((8*DL_DEGREE*DL_TD)/8+32)
+#define DL_SIG_SIZE_5 ((DL_DEGREE*7*(19+1))/8+75+8+32)
+
+
+namespace core {
+
+/** @brief Dilithium signature key pair generation
+ *
+    @param tau Random Numbers
+    @param SK secret key
+    @param PK public key
+
+ */
+extern void DLTHM_keypair_2(byte *tau,octet *SK,octet *PK);
+
+/** @brief Dilithium create signature on a message 
+ *
+    @param SK secret key
+    @param M the message to be signed
+    @param SIG the output signature
+    @return numbers of attempts needed to create signature
+
+ */
+extern int DLTHM_signature_2(octet *SK,octet *M, octet *SIG);
+
+/** @brief Dilithium verify signature on a message 
+ *
+    @param PK public key key
+    @param M the signed message
+    @param SIG the signature
+    @return true if signature is good, else false
+
+ */
+extern bool DLTHM_verify_2(octet *PK,octet *M,octet *SIG);
+
+
+/** @brief Dilithium signature key pair generation
+ *
+    @param tau Random Numbers
+    @param SK secret key
+    @param PK public key
+
+ */
+extern void DLTHM_keypair_3(byte *tau,octet *SK,octet *PK);
+
+/** @brief Dilithium create signature on a message 
+ *
+    @param SK secret key
+    @param M the message to be signed
+    @param SIG the output signature
+    @return numbers of attempts needed to create signature
+
+ */
+extern int DLTHM_signature_3(octet *SK,octet *M, octet *SIG);
+
+/** @brief Dilithium verify signature on a message 
+ *
+    @param PK public key key
+    @param M the signed message
+    @param SIG the signature
+    @return true if signature is good, else false
+
+ */
+extern bool DLTHM_verify_3(octet *PK,octet *M,octet *SIG);
+
+
+/** @brief Dilithium signature key pair generation
+ *
+    @param tau Random Numbers
+    @param SK secret key
+    @param PK public key
+
+ */
+extern void DLTHM_keypair_5(byte *tau,octet *SK,octet *PK);
+
+/** @brief Dilithium create signature on a message 
+ *
+    @param SK secret key
+    @param M the message to be signed
+    @param SIG the output signature
+    @return numbers of attempts needed to create signature
+
+ */
+extern int DLTHM_signature_5(octet *SK,octet *M, octet *SIG);
+
+/** @brief Dilithium verify signature on a message 
+ *
+    @param PK public key key
+    @param M the signed message
+    @param SIG the signature
+    @return true if signature is good, else false
+
+ */
+extern bool DLTHM_verify_5(octet *PK,octet *M,octet *SIG);
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh.h
new file mode 100644
index 0000000..9e1bad1
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_ZZZ_H
+#define ECDH_ZZZ_H
+
+#include "ecp_ZZZ.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_ZZZ MODBYTES_XXX  /**< ECC Group Size in bytes */
+#define EFS_ZZZ MODBYTES_XXX  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace ZZZ {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_ANSSI.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_ANSSI.h
new file mode 100644
index 0000000..bcc0a86
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_ANSSI.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_ANSSI_H
+#define ECDH_ANSSI_H
+
+#include "ecp_ANSSI.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_ANSSI MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_ANSSI MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace ANSSI {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_BLS12381.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_BLS12381.h
new file mode 100644
index 0000000..41e2b14
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_BLS12381.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_BLS12381_H
+#define ECDH_BLS12381_H
+
+#include "ecp_BLS12381.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_BLS12381 MODBYTES_B384_58  /**< ECC Group Size in bytes */
+#define EFS_BLS12381 MODBYTES_B384_58  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace BLS12381 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_BLS12383.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_BLS12383.h
new file mode 100644
index 0000000..3139c0f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_BLS12383.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_BLS12383_H
+#define ECDH_BLS12383_H
+
+#include "ecp_BLS12383.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_BLS12383 MODBYTES_B384_58  /**< ECC Group Size in bytes */
+#define EFS_BLS12383 MODBYTES_B384_58  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace BLS12383 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_BLS12443.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_BLS12443.h
new file mode 100644
index 0000000..209b84c
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_BLS12443.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_BLS12443_H
+#define ECDH_BLS12443_H
+
+#include "ecp_BLS12443.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_BLS12443 MODBYTES_B448_60  /**< ECC Group Size in bytes */
+#define EFS_BLS12443 MODBYTES_B448_60  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace BLS12443 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_BLS12461.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_BLS12461.h
new file mode 100644
index 0000000..9459639
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_BLS12461.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_BLS12461_H
+#define ECDH_BLS12461_H
+
+#include "ecp_BLS12461.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_BLS12461 MODBYTES_B464_60  /**< ECC Group Size in bytes */
+#define EFS_BLS12461 MODBYTES_B464_60  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace BLS12461 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_BLS24479.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_BLS24479.h
new file mode 100644
index 0000000..982d94a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_BLS24479.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_BLS24479_H
+#define ECDH_BLS24479_H
+
+#include "ecp_BLS24479.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_BLS24479 MODBYTES_B480_56  /**< ECC Group Size in bytes */
+#define EFS_BLS24479 MODBYTES_B480_56  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace BLS24479 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_BLS48286.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_BLS48286.h
new file mode 100644
index 0000000..feb997a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_BLS48286.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_BLS48286_H
+#define ECDH_BLS48286_H
+
+#include "ecp_BLS48286.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_BLS48286 MODBYTES_B288_60  /**< ECC Group Size in bytes */
+#define EFS_BLS48286 MODBYTES_B288_60  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace BLS48286 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_BLS48556.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_BLS48556.h
new file mode 100644
index 0000000..495f289
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_BLS48556.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_BLS48556_H
+#define ECDH_BLS48556_H
+
+#include "ecp_BLS48556.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_BLS48556 MODBYTES_B560_58  /**< ECC Group Size in bytes */
+#define EFS_BLS48556 MODBYTES_B560_58  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace BLS48556 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_BLS48581.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_BLS48581.h
new file mode 100644
index 0000000..e886f34
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_BLS48581.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_BLS48581_H
+#define ECDH_BLS48581_H
+
+#include "ecp_BLS48581.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_BLS48581 MODBYTES_B584_60  /**< ECC Group Size in bytes */
+#define EFS_BLS48581 MODBYTES_B584_60  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace BLS48581 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_BN158.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_BN158.h
new file mode 100644
index 0000000..a6460f5
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_BN158.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_BN158_H
+#define ECDH_BN158_H
+
+#include "ecp_BN158.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_BN158 MODBYTES_B160_56  /**< ECC Group Size in bytes */
+#define EFS_BN158 MODBYTES_B160_56  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace BN158 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_BN254.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_BN254.h
new file mode 100644
index 0000000..4724c1c
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_BN254.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_BN254_H
+#define ECDH_BN254_H
+
+#include "ecp_BN254.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_BN254 MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_BN254 MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace BN254 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_BN254CX.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_BN254CX.h
new file mode 100644
index 0000000..8228481
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_BN254CX.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_BN254CX_H
+#define ECDH_BN254CX_H
+
+#include "ecp_BN254CX.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_BN254CX MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_BN254CX MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace BN254CX {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_BN462.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_BN462.h
new file mode 100644
index 0000000..ed1cdc4
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_BN462.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_BN462_H
+#define ECDH_BN462_H
+
+#include "ecp_BN462.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_BN462 MODBYTES_B464_60  /**< ECC Group Size in bytes */
+#define EFS_BN462 MODBYTES_B464_60  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace BN462 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_BRAINPOOL.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_BRAINPOOL.h
new file mode 100644
index 0000000..dced8db
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_BRAINPOOL.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_BRAINPOOL_H
+#define ECDH_BRAINPOOL_H
+
+#include "ecp_BRAINPOOL.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_BRAINPOOL MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_BRAINPOOL MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace BRAINPOOL {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_C1174.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_C1174.h
new file mode 100644
index 0000000..7fd24f5
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_C1174.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_C1174_H
+#define ECDH_C1174_H
+
+#include "ecp_C1174.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_C1174 MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_C1174 MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace C1174 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_C13318.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_C13318.h
new file mode 100644
index 0000000..ff6a4e2
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_C13318.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_C13318_H
+#define ECDH_C13318_H
+
+#include "ecp_C13318.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_C13318 MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_C13318 MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace C13318 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_C1665.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_C1665.h
new file mode 100644
index 0000000..57c7e48
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_C1665.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_C1665_H
+#define ECDH_C1665_H
+
+#include "ecp_C1665.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_C1665 MODBYTES_B168_60  /**< ECC Group Size in bytes */
+#define EFS_C1665 MODBYTES_B168_60  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace C1665 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_C25519.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_C25519.h
new file mode 100644
index 0000000..c760c91
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_C25519.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_C25519_H
+#define ECDH_C25519_H
+
+#include "ecp_C25519.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_C25519 MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_C25519 MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace C25519 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_C41417.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_C41417.h
new file mode 100644
index 0000000..0cecf4b
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_C41417.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_C41417_H
+#define ECDH_C41417_H
+
+#include "ecp_C41417.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_C41417 MODBYTES_B416_60  /**< ECC Group Size in bytes */
+#define EFS_C41417 MODBYTES_B416_60  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace C41417 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_Ed25519.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_Ed25519.h
new file mode 100644
index 0000000..cbbdb7a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_Ed25519.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_Ed25519_H
+#define ECDH_Ed25519_H
+
+#include "ecp_Ed25519.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_Ed25519 MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_Ed25519 MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace Ed25519 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_Ed448.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_Ed448.h
new file mode 100644
index 0000000..ea3be13
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_Ed448.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_Ed448_H
+#define ECDH_Ed448_H
+
+#include "ecp_Ed448.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_Ed448 MODBYTES_B448_58  /**< ECC Group Size in bytes */
+#define EFS_Ed448 MODBYTES_B448_58  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace Ed448 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_FP256BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_FP256BN.h
new file mode 100644
index 0000000..e94a04e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_FP256BN.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_FP256BN_H
+#define ECDH_FP256BN_H
+
+#include "ecp_FP256BN.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_FP256BN MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_FP256BN MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace FP256BN {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_FP512BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_FP512BN.h
new file mode 100644
index 0000000..737fa32
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_FP512BN.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_FP512BN_H
+#define ECDH_FP512BN_H
+
+#include "ecp_FP512BN.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_FP512BN MODBYTES_B512_60  /**< ECC Group Size in bytes */
+#define EFS_FP512BN MODBYTES_B512_60  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace FP512BN {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_HIFIVE.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_HIFIVE.h
new file mode 100644
index 0000000..99ef058
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_HIFIVE.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_HIFIVE_H
+#define ECDH_HIFIVE_H
+
+#include "ecp_HIFIVE.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_HIFIVE MODBYTES_B336_60  /**< ECC Group Size in bytes */
+#define EFS_HIFIVE MODBYTES_B336_60  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace HIFIVE {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_JUBJUB.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_JUBJUB.h
new file mode 100644
index 0000000..ff1f5c8
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_JUBJUB.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_JUBJUB_H
+#define ECDH_JUBJUB_H
+
+#include "ecp_JUBJUB.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_JUBJUB MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_JUBJUB MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace JUBJUB {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_MDC.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_MDC.h
new file mode 100644
index 0000000..b3c0849
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_MDC.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_MDC_H
+#define ECDH_MDC_H
+
+#include "ecp_MDC.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_MDC MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_MDC MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace MDC {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_NIST256.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_NIST256.h
new file mode 100644
index 0000000..b4b3129
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_NIST256.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_NIST256_H
+#define ECDH_NIST256_H
+
+#include "ecp_NIST256.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_NIST256 MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_NIST256 MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace NIST256 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_NIST384.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_NIST384.h
new file mode 100644
index 0000000..32d06b4
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_NIST384.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_NIST384_H
+#define ECDH_NIST384_H
+
+#include "ecp_NIST384.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_NIST384 MODBYTES_B384_56  /**< ECC Group Size in bytes */
+#define EFS_NIST384 MODBYTES_B384_56  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace NIST384 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_NIST521.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_NIST521.h
new file mode 100644
index 0000000..ca373ed
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_NIST521.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_NIST521_H
+#define ECDH_NIST521_H
+
+#include "ecp_NIST521.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_NIST521 MODBYTES_B528_60  /**< ECC Group Size in bytes */
+#define EFS_NIST521 MODBYTES_B528_60  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace NIST521 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_NUMS256E.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_NUMS256E.h
new file mode 100644
index 0000000..7b0440d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_NUMS256E.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_NUMS256E_H
+#define ECDH_NUMS256E_H
+
+#include "ecp_NUMS256E.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_NUMS256E MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_NUMS256E MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace NUMS256E {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_NUMS256W.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_NUMS256W.h
new file mode 100644
index 0000000..11f6aa1
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_NUMS256W.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_NUMS256W_H
+#define ECDH_NUMS256W_H
+
+#include "ecp_NUMS256W.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_NUMS256W MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_NUMS256W MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace NUMS256W {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_NUMS384E.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_NUMS384E.h
new file mode 100644
index 0000000..0d7da0c
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_NUMS384E.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_NUMS384E_H
+#define ECDH_NUMS384E_H
+
+#include "ecp_NUMS384E.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_NUMS384E MODBYTES_B384_58  /**< ECC Group Size in bytes */
+#define EFS_NUMS384E MODBYTES_B384_58  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace NUMS384E {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_NUMS384W.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_NUMS384W.h
new file mode 100644
index 0000000..23cb57f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_NUMS384W.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_NUMS384W_H
+#define ECDH_NUMS384W_H
+
+#include "ecp_NUMS384W.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_NUMS384W MODBYTES_B384_58  /**< ECC Group Size in bytes */
+#define EFS_NUMS384W MODBYTES_B384_58  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace NUMS384W {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_NUMS512E.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_NUMS512E.h
new file mode 100644
index 0000000..4562f9e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_NUMS512E.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_NUMS512E_H
+#define ECDH_NUMS512E_H
+
+#include "ecp_NUMS512E.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_NUMS512E MODBYTES_B512_60  /**< ECC Group Size in bytes */
+#define EFS_NUMS512E MODBYTES_B512_60  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace NUMS512E {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_NUMS512W.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_NUMS512W.h
new file mode 100644
index 0000000..f98c909
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_NUMS512W.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_NUMS512W_H
+#define ECDH_NUMS512W_H
+
+#include "ecp_NUMS512W.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_NUMS512W MODBYTES_B512_60  /**< ECC Group Size in bytes */
+#define EFS_NUMS512W MODBYTES_B512_60  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace NUMS512W {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_SECP160R1.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_SECP160R1.h
new file mode 100644
index 0000000..27652ae
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_SECP160R1.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_SECP160R1_H
+#define ECDH_SECP160R1_H
+
+#include "ecp_SECP160R1.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_SECP160R1 MODBYTES_B160_56  /**< ECC Group Size in bytes */
+#define EFS_SECP160R1 MODBYTES_B160_56  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace SECP160R1 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_SECP256K1.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_SECP256K1.h
new file mode 100644
index 0000000..adfc24c
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_SECP256K1.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_SECP256K1_H
+#define ECDH_SECP256K1_H
+
+#include "ecp_SECP256K1.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_SECP256K1 MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_SECP256K1 MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace SECP256K1 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_SM2.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_SM2.h
new file mode 100644
index 0000000..45a8dd2
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_SM2.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_SM2_H
+#define ECDH_SM2_H
+
+#include "ecp_SM2.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_SM2 MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_SM2 MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace SM2 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_TWEEDLEDEE.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_TWEEDLEDEE.h
new file mode 100644
index 0000000..1a416c6
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_TWEEDLEDEE.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_TWEEDLEDEE_H
+#define ECDH_TWEEDLEDEE_H
+
+#include "ecp_TWEEDLEDEE.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_TWEEDLEDEE MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_TWEEDLEDEE MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace TWEEDLEDEE {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_TWEEDLEDUM.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_TWEEDLEDUM.h
new file mode 100644
index 0000000..94a7f7e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_TWEEDLEDUM.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_TWEEDLEDUM_H
+#define ECDH_TWEEDLEDUM_H
+
+#include "ecp_TWEEDLEDUM.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_TWEEDLEDUM MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_TWEEDLEDUM MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace TWEEDLEDUM {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_X448.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_X448.h
new file mode 100644
index 0000000..1fa3876
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecdh_X448.h
@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file ecdh.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief ECDH Header file for implementation of standard EC protocols
+ *
+ * declares functions
+ *
+ */
+
+#ifndef ECDH_X448_H
+#define ECDH_X448_H
+
+#include "ecp_X448.h"
+//#include "ecdh_support.h"
+
+using namespace core;
+
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define EGS_X448 MODBYTES_B448_58  /**< ECC Group Size in bytes */
+#define EFS_X448 MODBYTES_B448_58  /**< ECC Field Size in bytes */
+
+#define ECDH_OK                     0     /**< Function completed without error */
+/*#define ECDH_DOMAIN_ERROR          -1*/
+#define ECDH_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define ECDH_ERROR                 -3	/**< ECDH Internal Error */
+//#define ECDH_INVALID               -4	/**< ECDH Internal Error */
+/*#define ECDH_DOMAIN_NOT_FOUND      -5
+#define ECDH_OUT_OF_MEMORY         -6
+#define ECDH_DIV_BY_ZERO           -7
+#define ECDH_BAD_ASSUMPTION        -8*/
+
+
+namespace X448 {
+
+/**	@brief Test if group element in correct range
+ *
+	@param s is a random number
+    @return 1 if 0<s<r where r is group order, else 0
+*/
+extern int ECP_IN_RANGE(octet *s);
+
+/* ECDH primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param s the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param W the output public key, which is s.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int  ECP_KEY_PAIR_GENERATE(csprng *R, octet *s, octet *W);
+/**	@brief Validate an ECC public key
+ *
+	@param W the input public key to be validated
+	@return 0 if public key is OK, or an error code
+ */
+extern int  ECP_PUBLIC_KEY_VALIDATE(octet *W);
+
+/* ECDH primitives */
+
+/**	@brief Generate Diffie-Hellman shared key
+ *
+	IEEE-1363 Diffie-Hellman shared secret calculation
+	@param s is the input private key,
+	@param W the input public key of the other party
+	@param K the output shared key, in fact the x-coordinate of s.W
+    @param type the output form = 0 for just x, 1 for compressed, 2 for uncompressed
+	@return 0 or an error code
+ */
+extern int ECP_SVDP_DH(octet *s, octet *W, octet *K, int type);
+/*extern int ECPSVDP_DHC(octet *,octet *,int,octet *);*/
+
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/*#if CURVETYPE!=MONTGOMERY */
+/* ECIES functions */
+/**	@brief ECIES Encryption
+ *
+	IEEE-1363 ECIES Encryption
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param R is a pointer to a cryptographically secure random number generator
+	@param W the input public key of the recieving party
+	@param M is the plaintext message to be encrypted
+	@param len the length of the HMAC tag
+	@param V component of the output ciphertext
+	@param C the output ciphertext
+	@param T the output HMAC tag, part of the ciphertext
+ */
+extern void ECP_ECIES_ENCRYPT(int hlen, octet *P1, octet *P2, csprng *R, octet *W, octet *M, int len, octet *V, octet *C, octet *T);
+/**	@brief ECIES Decryption
+ *
+	IEEE-1363 ECIES Decryption
+    @param hlen is hash output length
+	@param P1 input Key Derivation parameters
+	@param P2 input Encoding parameters
+	@param V component of the input ciphertext
+	@param C the input ciphertext
+	@param T the input HMAC tag, part of the ciphertext
+	@param U the input private key for decryption
+	@param M the output plaintext message
+	@return 1 if successful, else 0
+ */
+extern int ECP_ECIES_DECRYPT(int hlen, octet *P1, octet *P2, octet *V, octet *C, octet *T, octet *U, octet *M);
+
+/* ECDSA functions */
+/**	@brief ECDSA Signature
+ *
+	IEEE-1363 ECDSA Signature
+    @param hlen is hash output length
+	@param R is a pointer to a cryptographically secure random number generator
+    @param k Ephemeral key. This value is used when R=NULL
+	@param s the input private signing key
+	@param M the input message to be signed
+	@param c component of the output signature
+	@param d component of the output signature
+
+ */
+extern int ECP_SP_DSA(int hlen, csprng *R, octet *k, octet *s, octet *M, octet *c, octet *d);
+/**	@brief ECDSA Signature Verification
+ *
+	IEEE-1363 ECDSA Signature Verification
+    @param hlen is hash output length
+	@param W the input public key
+	@param M the input message
+	@param c component of the input signature
+	@param d component of the input signature
+	@return 0 or an error code
+ */
+extern int ECP_VP_DSA(int hlen, octet *W, octet *M, octet *c, octet *d);
+/*#endif*/
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp.h
new file mode 100644
index 0000000..a78e2c1
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_ZZZ_H
+#define ECP_ZZZ_H
+
+#include "fp_YYY.h"
+#include "config_curve_ZZZ.h"
+
+using namespace core;
+
+namespace ZZZ {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const XXX::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const XXX::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const XXX::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const XXX::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const XXX::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const XXX::BIG CURVE_Ad;
+extern const XXX::BIG CURVE_Bd;
+extern const XXX::BIG PC[];
+
+extern const XXX::BIG CURVE_Adr;
+extern const XXX::BIG CURVE_Adi;
+extern const XXX::BIG CURVE_Bdr;
+extern const XXX::BIG CURVE_Bdi;
+extern const XXX::BIG PCR[];
+extern const XXX::BIG PCI[];
+
+/* Generator point on G1 */
+extern const XXX::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const XXX::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const XXX::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const XXX::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const XXX::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const XXX::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const XXX::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const XXX::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const XXX::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const XXX::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const XXX::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const XXX::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const XXX::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    YYY::FP x; /**< x-coordinate of point */
+#if CURVETYPE_ZZZ!=MONTGOMERY
+    YYY::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    YYY::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(YYY::FP *r, YYY::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, XXX::BIG x, int s);
+
+#if CURVETYPE_ZZZ==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, XXX::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(XXX::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, XXX::BIG x, XXX::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(XXX::BIG x, XXX::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, XXX::BIG e, XXX::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, XXX::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, XXX::BIG e, XXX::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, XXX::BIG e, XXX::BIG f, XXX::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],XXX::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, YYY::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, XXX::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp2.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp2.h
new file mode 100644
index 0000000..d4daa30
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp2.h
@@ -0,0 +1,249 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP2_ZZZ_H
+#define ECP2_ZZZ_H
+
+#include "fp2_YYY.h"
+#include "config_curve_ZZZ.h"
+
+using namespace core;
+
+
+namespace YYY {
+
+extern const XXX::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const XXX::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+}
+
+namespace ZZZ {
+
+/**
+	@brief ECP2 Structure - Elliptic Curve Point over quadratic extension field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag */
+    YYY::FP2 x;   /**< x-coordinate of point */
+    YYY::FP2 y;   /**< y-coordinate of point */
+    YYY::FP2 z;   /**< z-coordinate of point */
+} ECP2;
+
+
+/* Curve Params - see rom*.cpp */
+
+extern const int CURVE_B_I;		/**< Elliptic curve B parameter */
+extern const XXX::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const XXX::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const XXX::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const XXX::BIG CURVE_Bnx;   /**< Elliptic curve parameter */
+extern const XXX::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+
+/* Generator point on G1 */
+extern const XXX::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const XXX::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const XXX::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+/* ECP2 E(Fp2) prototypes */
+/**	@brief Tests for ECP2 point equal to infinity
+ *
+	@param P ECP2 point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP2_isinf(ECP2 *P);
+/**	@brief Copy ECP2 point to another ECP2 point
+ *
+	@param P ECP2 instance, on exit = Q
+	@param Q ECP2 instance to be copied
+ */
+extern void ECP2_copy(ECP2 *P, ECP2 *Q);
+/**	@brief Set ECP2 to point-at-infinity
+ *
+	@param P ECP2 instance to be set to infinity
+ */
+extern void ECP2_inf(ECP2 *P);
+/**	@brief Tests for equality of two ECP2s
+ *
+	@param P ECP2 instance to be compared
+	@param Q ECP2 instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP2_equals(ECP2 *P, ECP2 *Q);
+/**	@brief Converts an ECP2 point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP2 instance to be converted to affine form
+ */
+extern void ECP2_affine(ECP2 *P);
+/**	@brief Extract x and y coordinates of an ECP2 point P
+ *
+	If x=y, returns only x
+	@param x FP2 on exit = x coordinate of point
+	@param y FP2 on exit = y coordinate of point (unless x=y)
+	@param P ECP2 instance (x,y)
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP2_get(YYY::FP2 *x, YYY::FP2 *y, ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, converted to affine coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_output(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, in projective coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_outputxyz(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to an octet string
+ *
+	The octet string is created in the form x|y or just x if compressed
+	Convert the real and imaginary parts of the x and y coordinates to big-endian base 256 form.
+    If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param S output octet string
+	@param P ECP2 instance to be converted to an octet string
+    @param c true for compression
+ */
+extern void ECP2_toOctet(octet *S, ECP2 *P, bool c);
+/**	@brief Creates an ECP2 point from an octet string
+ *
+	The octet string is in the form x|y
+	The real and imaginary parts of the x and y coordinates are in big-endian base 256 form.
+    If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP2 instance to be created from the octet string
+	@param S input octet string
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP2_fromOctet(ECP2 *P, octet *S);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x)=x^3+Ax+B
+	Used internally.
+	@param r FP2 value of f(x)
+	@param x FP2 instance
+ */
+extern void ECP2_rhs(YYY::FP2 *r, YYY::FP2 *x);
+/**	@brief Set ECP2 to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP2 instance to be set (x,y)
+	@param x FP2 x coordinate of point
+	@param y FP2 y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_set(ECP2 *P, YYY::FP2 *x, YYY::FP2 *y);
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Otherwise y coordinate is calculated from x.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+    @param s sign of y
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_setx(ECP2 *P, YYY::FP2 *x, int s);
+/**	@brief Negation of an ECP2 point
+ *
+	@param P ECP2 instance, on exit = -P
+ */
+extern void ECP2_neg(ECP2 *P);
+/**	@brief Doubles an ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =2*P
+ */
+extern int ECP2_dbl(ECP2 *P);
+/**	@brief Adds ECP2 instance Q to ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P+Q
+	@param Q ECP2 instance to be added to P
+ */
+extern int ECP2_add(ECP2 *P, ECP2 *Q);
+/**	@brief Subtracts ECP instance Q from ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P-Q
+	@param Q ECP2 instance to be subtracted from P
+ */
+extern void ECP2_sub(ECP2 *P, ECP2 *Q);
+/**	@brief Multiplies an ECP2 instance P by a BIG, side-channel resistant
+ *
+	Uses fixed sized windows.
+	@param P ECP2 instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP2_mul(ECP2 *P, XXX::BIG b);
+/**	@brief Multiplies an ECP2 instance P by the internal modulus p, using precalculated Frobenius constant f
+ *
+	Fast point multiplication using Frobenius
+	@param P ECP2 instance, on exit = p*P
+	@param f FP2 precalculated Frobenius constant
+
+ */
+extern void ECP2_frob(ECP2 *P, YYY::FP2 *f);
+/**	@brief Calculates P=b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+ *
+	@param P ECP2 instance, on exit = b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+	@param Q ECP2 array of 4 points
+	@param b BIG array of 4 multipliers
+ */
+extern void ECP2_mul4(ECP2 *P, ECP2 *Q, XXX::BIG *b);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP2 multiplied by co-factor
+ */
+extern void ECP2_cfp(ECP2 *Q);
+
+/**	@brief Maps random FP2 to curve point in constant time
+ *
+	@param Q ECP2 instance 
+	@param x FP2 derived from hash
+ */
+extern void ECP2_map2point(ECP2 *Q, YYY::FP2 *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP2 instance 
+	@param x Fp derived from hash
+ */
+extern void ECP2_hap2point(ECP2 *Q, XXX::BIG  x);
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param P ECP2 instance of correct order
+	@param W OCTET byte array to be mapped
+ */
+extern void ECP2_mapit(ECP2 *P, octet *w);
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP2 instance
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_generator(ECP2 *G);
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp2_BLS12381.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp2_BLS12381.h
new file mode 100644
index 0000000..fa07f8f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp2_BLS12381.h
@@ -0,0 +1,249 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP2_BLS12381_H
+#define ECP2_BLS12381_H
+
+#include "fp2_BLS12381.h"
+#include "config_curve_BLS12381.h"
+
+using namespace core;
+
+
+namespace BLS12381 {
+
+extern const B384_58::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B384_58::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+}
+
+namespace BLS12381 {
+
+/**
+	@brief ECP2 Structure - Elliptic Curve Point over quadratic extension field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag */
+    BLS12381::FP2 x;   /**< x-coordinate of point */
+    BLS12381::FP2 y;   /**< y-coordinate of point */
+    BLS12381::FP2 z;   /**< z-coordinate of point */
+} ECP2;
+
+
+/* Curve Params - see rom*.cpp */
+
+extern const int CURVE_B_I;		/**< Elliptic curve B parameter */
+extern const B384_58::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B384_58::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B384_58::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B384_58::BIG CURVE_Bnx;   /**< Elliptic curve parameter */
+extern const B384_58::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+
+/* Generator point on G1 */
+extern const B384_58::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B384_58::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B384_58::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+/* ECP2 E(Fp2) prototypes */
+/**	@brief Tests for ECP2 point equal to infinity
+ *
+	@param P ECP2 point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP2_isinf(ECP2 *P);
+/**	@brief Copy ECP2 point to another ECP2 point
+ *
+	@param P ECP2 instance, on exit = Q
+	@param Q ECP2 instance to be copied
+ */
+extern void ECP2_copy(ECP2 *P, ECP2 *Q);
+/**	@brief Set ECP2 to point-at-infinity
+ *
+	@param P ECP2 instance to be set to infinity
+ */
+extern void ECP2_inf(ECP2 *P);
+/**	@brief Tests for equality of two ECP2s
+ *
+	@param P ECP2 instance to be compared
+	@param Q ECP2 instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP2_equals(ECP2 *P, ECP2 *Q);
+/**	@brief Converts an ECP2 point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP2 instance to be converted to affine form
+ */
+extern void ECP2_affine(ECP2 *P);
+/**	@brief Extract x and y coordinates of an ECP2 point P
+ *
+	If x=y, returns only x
+	@param x FP2 on exit = x coordinate of point
+	@param y FP2 on exit = y coordinate of point (unless x=y)
+	@param P ECP2 instance (x,y)
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP2_get(BLS12381::FP2 *x, BLS12381::FP2 *y, ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, converted to affine coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_output(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, in projective coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_outputxyz(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to an octet string
+ *
+	The octet string is created in the form x|y or just x if compressed
+	Convert the real and imaginary parts of the x and y coordinates to big-endian base 256 form.
+    If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param S output octet string
+	@param P ECP2 instance to be converted to an octet string
+    @param c true for compression
+ */
+extern void ECP2_toOctet(octet *S, ECP2 *P, bool c);
+/**	@brief Creates an ECP2 point from an octet string
+ *
+	The octet string is in the form x|y
+	The real and imaginary parts of the x and y coordinates are in big-endian base 256 form.
+    If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP2 instance to be created from the octet string
+	@param S input octet string
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP2_fromOctet(ECP2 *P, octet *S);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x)=x^3+Ax+B
+	Used internally.
+	@param r FP2 value of f(x)
+	@param x FP2 instance
+ */
+extern void ECP2_rhs(BLS12381::FP2 *r, BLS12381::FP2 *x);
+/**	@brief Set ECP2 to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP2 instance to be set (x,y)
+	@param x FP2 x coordinate of point
+	@param y FP2 y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_set(ECP2 *P, BLS12381::FP2 *x, BLS12381::FP2 *y);
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Otherwise y coordinate is calculated from x.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+    @param s sign of y
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_setx(ECP2 *P, BLS12381::FP2 *x, int s);
+/**	@brief Negation of an ECP2 point
+ *
+	@param P ECP2 instance, on exit = -P
+ */
+extern void ECP2_neg(ECP2 *P);
+/**	@brief Doubles an ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =2*P
+ */
+extern int ECP2_dbl(ECP2 *P);
+/**	@brief Adds ECP2 instance Q to ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P+Q
+	@param Q ECP2 instance to be added to P
+ */
+extern int ECP2_add(ECP2 *P, ECP2 *Q);
+/**	@brief Subtracts ECP instance Q from ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P-Q
+	@param Q ECP2 instance to be subtracted from P
+ */
+extern void ECP2_sub(ECP2 *P, ECP2 *Q);
+/**	@brief Multiplies an ECP2 instance P by a BIG, side-channel resistant
+ *
+	Uses fixed sized windows.
+	@param P ECP2 instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP2_mul(ECP2 *P, B384_58::BIG b);
+/**	@brief Multiplies an ECP2 instance P by the internal modulus p, using precalculated Frobenius constant f
+ *
+	Fast point multiplication using Frobenius
+	@param P ECP2 instance, on exit = p*P
+	@param f FP2 precalculated Frobenius constant
+
+ */
+extern void ECP2_frob(ECP2 *P, BLS12381::FP2 *f);
+/**	@brief Calculates P=b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+ *
+	@param P ECP2 instance, on exit = b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+	@param Q ECP2 array of 4 points
+	@param b BIG array of 4 multipliers
+ */
+extern void ECP2_mul4(ECP2 *P, ECP2 *Q, B384_58::BIG *b);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP2 multiplied by co-factor
+ */
+extern void ECP2_cfp(ECP2 *Q);
+
+/**	@brief Maps random FP2 to curve point in constant time
+ *
+	@param Q ECP2 instance 
+	@param x FP2 derived from hash
+ */
+extern void ECP2_map2point(ECP2 *Q, BLS12381::FP2 *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP2 instance 
+	@param x Fp derived from hash
+ */
+extern void ECP2_hap2point(ECP2 *Q, B384_58::BIG  x);
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param P ECP2 instance of correct order
+	@param W OCTET byte array to be mapped
+ */
+extern void ECP2_mapit(ECP2 *P, octet *w);
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP2 instance
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_generator(ECP2 *G);
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp2_BLS12383.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp2_BLS12383.h
new file mode 100644
index 0000000..81af310
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp2_BLS12383.h
@@ -0,0 +1,249 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP2_BLS12383_H
+#define ECP2_BLS12383_H
+
+#include "fp2_BLS12383.h"
+#include "config_curve_BLS12383.h"
+
+using namespace core;
+
+
+namespace BLS12383 {
+
+extern const B384_58::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B384_58::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+}
+
+namespace BLS12383 {
+
+/**
+	@brief ECP2 Structure - Elliptic Curve Point over quadratic extension field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag */
+    BLS12383::FP2 x;   /**< x-coordinate of point */
+    BLS12383::FP2 y;   /**< y-coordinate of point */
+    BLS12383::FP2 z;   /**< z-coordinate of point */
+} ECP2;
+
+
+/* Curve Params - see rom*.cpp */
+
+extern const int CURVE_B_I;		/**< Elliptic curve B parameter */
+extern const B384_58::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B384_58::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B384_58::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B384_58::BIG CURVE_Bnx;   /**< Elliptic curve parameter */
+extern const B384_58::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+
+/* Generator point on G1 */
+extern const B384_58::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B384_58::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B384_58::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+/* ECP2 E(Fp2) prototypes */
+/**	@brief Tests for ECP2 point equal to infinity
+ *
+	@param P ECP2 point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP2_isinf(ECP2 *P);
+/**	@brief Copy ECP2 point to another ECP2 point
+ *
+	@param P ECP2 instance, on exit = Q
+	@param Q ECP2 instance to be copied
+ */
+extern void ECP2_copy(ECP2 *P, ECP2 *Q);
+/**	@brief Set ECP2 to point-at-infinity
+ *
+	@param P ECP2 instance to be set to infinity
+ */
+extern void ECP2_inf(ECP2 *P);
+/**	@brief Tests for equality of two ECP2s
+ *
+	@param P ECP2 instance to be compared
+	@param Q ECP2 instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP2_equals(ECP2 *P, ECP2 *Q);
+/**	@brief Converts an ECP2 point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP2 instance to be converted to affine form
+ */
+extern void ECP2_affine(ECP2 *P);
+/**	@brief Extract x and y coordinates of an ECP2 point P
+ *
+	If x=y, returns only x
+	@param x FP2 on exit = x coordinate of point
+	@param y FP2 on exit = y coordinate of point (unless x=y)
+	@param P ECP2 instance (x,y)
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP2_get(BLS12383::FP2 *x, BLS12383::FP2 *y, ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, converted to affine coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_output(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, in projective coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_outputxyz(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to an octet string
+ *
+	The octet string is created in the form x|y or just x if compressed
+	Convert the real and imaginary parts of the x and y coordinates to big-endian base 256 form.
+    If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param S output octet string
+	@param P ECP2 instance to be converted to an octet string
+    @param c true for compression
+ */
+extern void ECP2_toOctet(octet *S, ECP2 *P, bool c);
+/**	@brief Creates an ECP2 point from an octet string
+ *
+	The octet string is in the form x|y
+	The real and imaginary parts of the x and y coordinates are in big-endian base 256 form.
+    If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP2 instance to be created from the octet string
+	@param S input octet string
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP2_fromOctet(ECP2 *P, octet *S);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x)=x^3+Ax+B
+	Used internally.
+	@param r FP2 value of f(x)
+	@param x FP2 instance
+ */
+extern void ECP2_rhs(BLS12383::FP2 *r, BLS12383::FP2 *x);
+/**	@brief Set ECP2 to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP2 instance to be set (x,y)
+	@param x FP2 x coordinate of point
+	@param y FP2 y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_set(ECP2 *P, BLS12383::FP2 *x, BLS12383::FP2 *y);
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Otherwise y coordinate is calculated from x.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+    @param s sign of y
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_setx(ECP2 *P, BLS12383::FP2 *x, int s);
+/**	@brief Negation of an ECP2 point
+ *
+	@param P ECP2 instance, on exit = -P
+ */
+extern void ECP2_neg(ECP2 *P);
+/**	@brief Doubles an ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =2*P
+ */
+extern int ECP2_dbl(ECP2 *P);
+/**	@brief Adds ECP2 instance Q to ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P+Q
+	@param Q ECP2 instance to be added to P
+ */
+extern int ECP2_add(ECP2 *P, ECP2 *Q);
+/**	@brief Subtracts ECP instance Q from ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P-Q
+	@param Q ECP2 instance to be subtracted from P
+ */
+extern void ECP2_sub(ECP2 *P, ECP2 *Q);
+/**	@brief Multiplies an ECP2 instance P by a BIG, side-channel resistant
+ *
+	Uses fixed sized windows.
+	@param P ECP2 instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP2_mul(ECP2 *P, B384_58::BIG b);
+/**	@brief Multiplies an ECP2 instance P by the internal modulus p, using precalculated Frobenius constant f
+ *
+	Fast point multiplication using Frobenius
+	@param P ECP2 instance, on exit = p*P
+	@param f FP2 precalculated Frobenius constant
+
+ */
+extern void ECP2_frob(ECP2 *P, BLS12383::FP2 *f);
+/**	@brief Calculates P=b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+ *
+	@param P ECP2 instance, on exit = b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+	@param Q ECP2 array of 4 points
+	@param b BIG array of 4 multipliers
+ */
+extern void ECP2_mul4(ECP2 *P, ECP2 *Q, B384_58::BIG *b);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP2 multiplied by co-factor
+ */
+extern void ECP2_cfp(ECP2 *Q);
+
+/**	@brief Maps random FP2 to curve point in constant time
+ *
+	@param Q ECP2 instance 
+	@param x FP2 derived from hash
+ */
+extern void ECP2_map2point(ECP2 *Q, BLS12383::FP2 *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP2 instance 
+	@param x Fp derived from hash
+ */
+extern void ECP2_hap2point(ECP2 *Q, B384_58::BIG  x);
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param P ECP2 instance of correct order
+	@param W OCTET byte array to be mapped
+ */
+extern void ECP2_mapit(ECP2 *P, octet *w);
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP2 instance
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_generator(ECP2 *G);
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp2_BLS12443.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp2_BLS12443.h
new file mode 100644
index 0000000..cfa4d78
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp2_BLS12443.h
@@ -0,0 +1,249 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP2_BLS12443_H
+#define ECP2_BLS12443_H
+
+#include "fp2_BLS12443.h"
+#include "config_curve_BLS12443.h"
+
+using namespace core;
+
+
+namespace BLS12443 {
+
+extern const B448_60::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B448_60::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+}
+
+namespace BLS12443 {
+
+/**
+	@brief ECP2 Structure - Elliptic Curve Point over quadratic extension field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag */
+    BLS12443::FP2 x;   /**< x-coordinate of point */
+    BLS12443::FP2 y;   /**< y-coordinate of point */
+    BLS12443::FP2 z;   /**< z-coordinate of point */
+} ECP2;
+
+
+/* Curve Params - see rom*.cpp */
+
+extern const int CURVE_B_I;		/**< Elliptic curve B parameter */
+extern const B448_60::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B448_60::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B448_60::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B448_60::BIG CURVE_Bnx;   /**< Elliptic curve parameter */
+extern const B448_60::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+
+/* Generator point on G1 */
+extern const B448_60::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B448_60::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B448_60::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+/* ECP2 E(Fp2) prototypes */
+/**	@brief Tests for ECP2 point equal to infinity
+ *
+	@param P ECP2 point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP2_isinf(ECP2 *P);
+/**	@brief Copy ECP2 point to another ECP2 point
+ *
+	@param P ECP2 instance, on exit = Q
+	@param Q ECP2 instance to be copied
+ */
+extern void ECP2_copy(ECP2 *P, ECP2 *Q);
+/**	@brief Set ECP2 to point-at-infinity
+ *
+	@param P ECP2 instance to be set to infinity
+ */
+extern void ECP2_inf(ECP2 *P);
+/**	@brief Tests for equality of two ECP2s
+ *
+	@param P ECP2 instance to be compared
+	@param Q ECP2 instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP2_equals(ECP2 *P, ECP2 *Q);
+/**	@brief Converts an ECP2 point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP2 instance to be converted to affine form
+ */
+extern void ECP2_affine(ECP2 *P);
+/**	@brief Extract x and y coordinates of an ECP2 point P
+ *
+	If x=y, returns only x
+	@param x FP2 on exit = x coordinate of point
+	@param y FP2 on exit = y coordinate of point (unless x=y)
+	@param P ECP2 instance (x,y)
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP2_get(BLS12443::FP2 *x, BLS12443::FP2 *y, ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, converted to affine coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_output(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, in projective coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_outputxyz(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to an octet string
+ *
+	The octet string is created in the form x|y or just x if compressed
+	Convert the real and imaginary parts of the x and y coordinates to big-endian base 256 form.
+    If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param S output octet string
+	@param P ECP2 instance to be converted to an octet string
+    @param c true for compression
+ */
+extern void ECP2_toOctet(octet *S, ECP2 *P, bool c);
+/**	@brief Creates an ECP2 point from an octet string
+ *
+	The octet string is in the form x|y
+	The real and imaginary parts of the x and y coordinates are in big-endian base 256 form.
+    If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP2 instance to be created from the octet string
+	@param S input octet string
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP2_fromOctet(ECP2 *P, octet *S);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x)=x^3+Ax+B
+	Used internally.
+	@param r FP2 value of f(x)
+	@param x FP2 instance
+ */
+extern void ECP2_rhs(BLS12443::FP2 *r, BLS12443::FP2 *x);
+/**	@brief Set ECP2 to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP2 instance to be set (x,y)
+	@param x FP2 x coordinate of point
+	@param y FP2 y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_set(ECP2 *P, BLS12443::FP2 *x, BLS12443::FP2 *y);
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Otherwise y coordinate is calculated from x.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+    @param s sign of y
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_setx(ECP2 *P, BLS12443::FP2 *x, int s);
+/**	@brief Negation of an ECP2 point
+ *
+	@param P ECP2 instance, on exit = -P
+ */
+extern void ECP2_neg(ECP2 *P);
+/**	@brief Doubles an ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =2*P
+ */
+extern int ECP2_dbl(ECP2 *P);
+/**	@brief Adds ECP2 instance Q to ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P+Q
+	@param Q ECP2 instance to be added to P
+ */
+extern int ECP2_add(ECP2 *P, ECP2 *Q);
+/**	@brief Subtracts ECP instance Q from ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P-Q
+	@param Q ECP2 instance to be subtracted from P
+ */
+extern void ECP2_sub(ECP2 *P, ECP2 *Q);
+/**	@brief Multiplies an ECP2 instance P by a BIG, side-channel resistant
+ *
+	Uses fixed sized windows.
+	@param P ECP2 instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP2_mul(ECP2 *P, B448_60::BIG b);
+/**	@brief Multiplies an ECP2 instance P by the internal modulus p, using precalculated Frobenius constant f
+ *
+	Fast point multiplication using Frobenius
+	@param P ECP2 instance, on exit = p*P
+	@param f FP2 precalculated Frobenius constant
+
+ */
+extern void ECP2_frob(ECP2 *P, BLS12443::FP2 *f);
+/**	@brief Calculates P=b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+ *
+	@param P ECP2 instance, on exit = b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+	@param Q ECP2 array of 4 points
+	@param b BIG array of 4 multipliers
+ */
+extern void ECP2_mul4(ECP2 *P, ECP2 *Q, B448_60::BIG *b);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP2 multiplied by co-factor
+ */
+extern void ECP2_cfp(ECP2 *Q);
+
+/**	@brief Maps random FP2 to curve point in constant time
+ *
+	@param Q ECP2 instance 
+	@param x FP2 derived from hash
+ */
+extern void ECP2_map2point(ECP2 *Q, BLS12443::FP2 *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP2 instance 
+	@param x Fp derived from hash
+ */
+extern void ECP2_hap2point(ECP2 *Q, B448_60::BIG  x);
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param P ECP2 instance of correct order
+	@param W OCTET byte array to be mapped
+ */
+extern void ECP2_mapit(ECP2 *P, octet *w);
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP2 instance
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_generator(ECP2 *G);
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp2_BLS12461.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp2_BLS12461.h
new file mode 100644
index 0000000..804017e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp2_BLS12461.h
@@ -0,0 +1,249 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP2_BLS12461_H
+#define ECP2_BLS12461_H
+
+#include "fp2_BLS12461.h"
+#include "config_curve_BLS12461.h"
+
+using namespace core;
+
+
+namespace BLS12461 {
+
+extern const B464_60::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B464_60::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+}
+
+namespace BLS12461 {
+
+/**
+	@brief ECP2 Structure - Elliptic Curve Point over quadratic extension field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag */
+    BLS12461::FP2 x;   /**< x-coordinate of point */
+    BLS12461::FP2 y;   /**< y-coordinate of point */
+    BLS12461::FP2 z;   /**< z-coordinate of point */
+} ECP2;
+
+
+/* Curve Params - see rom*.cpp */
+
+extern const int CURVE_B_I;		/**< Elliptic curve B parameter */
+extern const B464_60::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B464_60::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B464_60::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B464_60::BIG CURVE_Bnx;   /**< Elliptic curve parameter */
+extern const B464_60::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+
+/* Generator point on G1 */
+extern const B464_60::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B464_60::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B464_60::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+/* ECP2 E(Fp2) prototypes */
+/**	@brief Tests for ECP2 point equal to infinity
+ *
+	@param P ECP2 point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP2_isinf(ECP2 *P);
+/**	@brief Copy ECP2 point to another ECP2 point
+ *
+	@param P ECP2 instance, on exit = Q
+	@param Q ECP2 instance to be copied
+ */
+extern void ECP2_copy(ECP2 *P, ECP2 *Q);
+/**	@brief Set ECP2 to point-at-infinity
+ *
+	@param P ECP2 instance to be set to infinity
+ */
+extern void ECP2_inf(ECP2 *P);
+/**	@brief Tests for equality of two ECP2s
+ *
+	@param P ECP2 instance to be compared
+	@param Q ECP2 instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP2_equals(ECP2 *P, ECP2 *Q);
+/**	@brief Converts an ECP2 point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP2 instance to be converted to affine form
+ */
+extern void ECP2_affine(ECP2 *P);
+/**	@brief Extract x and y coordinates of an ECP2 point P
+ *
+	If x=y, returns only x
+	@param x FP2 on exit = x coordinate of point
+	@param y FP2 on exit = y coordinate of point (unless x=y)
+	@param P ECP2 instance (x,y)
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP2_get(BLS12461::FP2 *x, BLS12461::FP2 *y, ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, converted to affine coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_output(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, in projective coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_outputxyz(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to an octet string
+ *
+	The octet string is created in the form x|y or just x if compressed
+	Convert the real and imaginary parts of the x and y coordinates to big-endian base 256 form.
+    If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param S output octet string
+	@param P ECP2 instance to be converted to an octet string
+    @param c true for compression
+ */
+extern void ECP2_toOctet(octet *S, ECP2 *P, bool c);
+/**	@brief Creates an ECP2 point from an octet string
+ *
+	The octet string is in the form x|y
+	The real and imaginary parts of the x and y coordinates are in big-endian base 256 form.
+    If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP2 instance to be created from the octet string
+	@param S input octet string
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP2_fromOctet(ECP2 *P, octet *S);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x)=x^3+Ax+B
+	Used internally.
+	@param r FP2 value of f(x)
+	@param x FP2 instance
+ */
+extern void ECP2_rhs(BLS12461::FP2 *r, BLS12461::FP2 *x);
+/**	@brief Set ECP2 to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP2 instance to be set (x,y)
+	@param x FP2 x coordinate of point
+	@param y FP2 y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_set(ECP2 *P, BLS12461::FP2 *x, BLS12461::FP2 *y);
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Otherwise y coordinate is calculated from x.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+    @param s sign of y
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_setx(ECP2 *P, BLS12461::FP2 *x, int s);
+/**	@brief Negation of an ECP2 point
+ *
+	@param P ECP2 instance, on exit = -P
+ */
+extern void ECP2_neg(ECP2 *P);
+/**	@brief Doubles an ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =2*P
+ */
+extern int ECP2_dbl(ECP2 *P);
+/**	@brief Adds ECP2 instance Q to ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P+Q
+	@param Q ECP2 instance to be added to P
+ */
+extern int ECP2_add(ECP2 *P, ECP2 *Q);
+/**	@brief Subtracts ECP instance Q from ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P-Q
+	@param Q ECP2 instance to be subtracted from P
+ */
+extern void ECP2_sub(ECP2 *P, ECP2 *Q);
+/**	@brief Multiplies an ECP2 instance P by a BIG, side-channel resistant
+ *
+	Uses fixed sized windows.
+	@param P ECP2 instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP2_mul(ECP2 *P, B464_60::BIG b);
+/**	@brief Multiplies an ECP2 instance P by the internal modulus p, using precalculated Frobenius constant f
+ *
+	Fast point multiplication using Frobenius
+	@param P ECP2 instance, on exit = p*P
+	@param f FP2 precalculated Frobenius constant
+
+ */
+extern void ECP2_frob(ECP2 *P, BLS12461::FP2 *f);
+/**	@brief Calculates P=b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+ *
+	@param P ECP2 instance, on exit = b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+	@param Q ECP2 array of 4 points
+	@param b BIG array of 4 multipliers
+ */
+extern void ECP2_mul4(ECP2 *P, ECP2 *Q, B464_60::BIG *b);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP2 multiplied by co-factor
+ */
+extern void ECP2_cfp(ECP2 *Q);
+
+/**	@brief Maps random FP2 to curve point in constant time
+ *
+	@param Q ECP2 instance 
+	@param x FP2 derived from hash
+ */
+extern void ECP2_map2point(ECP2 *Q, BLS12461::FP2 *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP2 instance 
+	@param x Fp derived from hash
+ */
+extern void ECP2_hap2point(ECP2 *Q, B464_60::BIG  x);
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param P ECP2 instance of correct order
+	@param W OCTET byte array to be mapped
+ */
+extern void ECP2_mapit(ECP2 *P, octet *w);
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP2 instance
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_generator(ECP2 *G);
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp2_BN158.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp2_BN158.h
new file mode 100644
index 0000000..a5744e3
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp2_BN158.h
@@ -0,0 +1,249 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP2_BN158_H
+#define ECP2_BN158_H
+
+#include "fp2_BN158.h"
+#include "config_curve_BN158.h"
+
+using namespace core;
+
+
+namespace BN158 {
+
+extern const B160_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B160_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+}
+
+namespace BN158 {
+
+/**
+	@brief ECP2 Structure - Elliptic Curve Point over quadratic extension field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag */
+    BN158::FP2 x;   /**< x-coordinate of point */
+    BN158::FP2 y;   /**< y-coordinate of point */
+    BN158::FP2 z;   /**< z-coordinate of point */
+} ECP2;
+
+
+/* Curve Params - see rom*.cpp */
+
+extern const int CURVE_B_I;		/**< Elliptic curve B parameter */
+extern const B160_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B160_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B160_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B160_56::BIG CURVE_Bnx;   /**< Elliptic curve parameter */
+extern const B160_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+
+/* Generator point on G1 */
+extern const B160_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B160_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B160_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+/* ECP2 E(Fp2) prototypes */
+/**	@brief Tests for ECP2 point equal to infinity
+ *
+	@param P ECP2 point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP2_isinf(ECP2 *P);
+/**	@brief Copy ECP2 point to another ECP2 point
+ *
+	@param P ECP2 instance, on exit = Q
+	@param Q ECP2 instance to be copied
+ */
+extern void ECP2_copy(ECP2 *P, ECP2 *Q);
+/**	@brief Set ECP2 to point-at-infinity
+ *
+	@param P ECP2 instance to be set to infinity
+ */
+extern void ECP2_inf(ECP2 *P);
+/**	@brief Tests for equality of two ECP2s
+ *
+	@param P ECP2 instance to be compared
+	@param Q ECP2 instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP2_equals(ECP2 *P, ECP2 *Q);
+/**	@brief Converts an ECP2 point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP2 instance to be converted to affine form
+ */
+extern void ECP2_affine(ECP2 *P);
+/**	@brief Extract x and y coordinates of an ECP2 point P
+ *
+	If x=y, returns only x
+	@param x FP2 on exit = x coordinate of point
+	@param y FP2 on exit = y coordinate of point (unless x=y)
+	@param P ECP2 instance (x,y)
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP2_get(BN158::FP2 *x, BN158::FP2 *y, ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, converted to affine coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_output(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, in projective coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_outputxyz(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to an octet string
+ *
+	The octet string is created in the form x|y or just x if compressed
+	Convert the real and imaginary parts of the x and y coordinates to big-endian base 256 form.
+    If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param S output octet string
+	@param P ECP2 instance to be converted to an octet string
+    @param c true for compression
+ */
+extern void ECP2_toOctet(octet *S, ECP2 *P, bool c);
+/**	@brief Creates an ECP2 point from an octet string
+ *
+	The octet string is in the form x|y
+	The real and imaginary parts of the x and y coordinates are in big-endian base 256 form.
+    If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP2 instance to be created from the octet string
+	@param S input octet string
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP2_fromOctet(ECP2 *P, octet *S);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x)=x^3+Ax+B
+	Used internally.
+	@param r FP2 value of f(x)
+	@param x FP2 instance
+ */
+extern void ECP2_rhs(BN158::FP2 *r, BN158::FP2 *x);
+/**	@brief Set ECP2 to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP2 instance to be set (x,y)
+	@param x FP2 x coordinate of point
+	@param y FP2 y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_set(ECP2 *P, BN158::FP2 *x, BN158::FP2 *y);
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Otherwise y coordinate is calculated from x.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+    @param s sign of y
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_setx(ECP2 *P, BN158::FP2 *x, int s);
+/**	@brief Negation of an ECP2 point
+ *
+	@param P ECP2 instance, on exit = -P
+ */
+extern void ECP2_neg(ECP2 *P);
+/**	@brief Doubles an ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =2*P
+ */
+extern int ECP2_dbl(ECP2 *P);
+/**	@brief Adds ECP2 instance Q to ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P+Q
+	@param Q ECP2 instance to be added to P
+ */
+extern int ECP2_add(ECP2 *P, ECP2 *Q);
+/**	@brief Subtracts ECP instance Q from ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P-Q
+	@param Q ECP2 instance to be subtracted from P
+ */
+extern void ECP2_sub(ECP2 *P, ECP2 *Q);
+/**	@brief Multiplies an ECP2 instance P by a BIG, side-channel resistant
+ *
+	Uses fixed sized windows.
+	@param P ECP2 instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP2_mul(ECP2 *P, B160_56::BIG b);
+/**	@brief Multiplies an ECP2 instance P by the internal modulus p, using precalculated Frobenius constant f
+ *
+	Fast point multiplication using Frobenius
+	@param P ECP2 instance, on exit = p*P
+	@param f FP2 precalculated Frobenius constant
+
+ */
+extern void ECP2_frob(ECP2 *P, BN158::FP2 *f);
+/**	@brief Calculates P=b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+ *
+	@param P ECP2 instance, on exit = b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+	@param Q ECP2 array of 4 points
+	@param b BIG array of 4 multipliers
+ */
+extern void ECP2_mul4(ECP2 *P, ECP2 *Q, B160_56::BIG *b);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP2 multiplied by co-factor
+ */
+extern void ECP2_cfp(ECP2 *Q);
+
+/**	@brief Maps random FP2 to curve point in constant time
+ *
+	@param Q ECP2 instance 
+	@param x FP2 derived from hash
+ */
+extern void ECP2_map2point(ECP2 *Q, BN158::FP2 *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP2 instance 
+	@param x Fp derived from hash
+ */
+extern void ECP2_hap2point(ECP2 *Q, B160_56::BIG  x);
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param P ECP2 instance of correct order
+	@param W OCTET byte array to be mapped
+ */
+extern void ECP2_mapit(ECP2 *P, octet *w);
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP2 instance
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_generator(ECP2 *G);
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp2_BN254.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp2_BN254.h
new file mode 100644
index 0000000..da0e4c5
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp2_BN254.h
@@ -0,0 +1,249 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP2_BN254_H
+#define ECP2_BN254_H
+
+#include "fp2_BN254.h"
+#include "config_curve_BN254.h"
+
+using namespace core;
+
+
+namespace BN254 {
+
+extern const B256_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+}
+
+namespace BN254 {
+
+/**
+	@brief ECP2 Structure - Elliptic Curve Point over quadratic extension field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag */
+    BN254::FP2 x;   /**< x-coordinate of point */
+    BN254::FP2 y;   /**< y-coordinate of point */
+    BN254::FP2 z;   /**< z-coordinate of point */
+} ECP2;
+
+
+/* Curve Params - see rom*.cpp */
+
+extern const int CURVE_B_I;		/**< Elliptic curve B parameter */
+extern const B256_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_56::BIG CURVE_Bnx;   /**< Elliptic curve parameter */
+extern const B256_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+
+/* Generator point on G1 */
+extern const B256_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+/* ECP2 E(Fp2) prototypes */
+/**	@brief Tests for ECP2 point equal to infinity
+ *
+	@param P ECP2 point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP2_isinf(ECP2 *P);
+/**	@brief Copy ECP2 point to another ECP2 point
+ *
+	@param P ECP2 instance, on exit = Q
+	@param Q ECP2 instance to be copied
+ */
+extern void ECP2_copy(ECP2 *P, ECP2 *Q);
+/**	@brief Set ECP2 to point-at-infinity
+ *
+	@param P ECP2 instance to be set to infinity
+ */
+extern void ECP2_inf(ECP2 *P);
+/**	@brief Tests for equality of two ECP2s
+ *
+	@param P ECP2 instance to be compared
+	@param Q ECP2 instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP2_equals(ECP2 *P, ECP2 *Q);
+/**	@brief Converts an ECP2 point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP2 instance to be converted to affine form
+ */
+extern void ECP2_affine(ECP2 *P);
+/**	@brief Extract x and y coordinates of an ECP2 point P
+ *
+	If x=y, returns only x
+	@param x FP2 on exit = x coordinate of point
+	@param y FP2 on exit = y coordinate of point (unless x=y)
+	@param P ECP2 instance (x,y)
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP2_get(BN254::FP2 *x, BN254::FP2 *y, ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, converted to affine coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_output(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, in projective coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_outputxyz(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to an octet string
+ *
+	The octet string is created in the form x|y or just x if compressed
+	Convert the real and imaginary parts of the x and y coordinates to big-endian base 256 form.
+    If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param S output octet string
+	@param P ECP2 instance to be converted to an octet string
+    @param c true for compression
+ */
+extern void ECP2_toOctet(octet *S, ECP2 *P, bool c);
+/**	@brief Creates an ECP2 point from an octet string
+ *
+	The octet string is in the form x|y
+	The real and imaginary parts of the x and y coordinates are in big-endian base 256 form.
+    If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP2 instance to be created from the octet string
+	@param S input octet string
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP2_fromOctet(ECP2 *P, octet *S);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x)=x^3+Ax+B
+	Used internally.
+	@param r FP2 value of f(x)
+	@param x FP2 instance
+ */
+extern void ECP2_rhs(BN254::FP2 *r, BN254::FP2 *x);
+/**	@brief Set ECP2 to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP2 instance to be set (x,y)
+	@param x FP2 x coordinate of point
+	@param y FP2 y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_set(ECP2 *P, BN254::FP2 *x, BN254::FP2 *y);
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Otherwise y coordinate is calculated from x.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+    @param s sign of y
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_setx(ECP2 *P, BN254::FP2 *x, int s);
+/**	@brief Negation of an ECP2 point
+ *
+	@param P ECP2 instance, on exit = -P
+ */
+extern void ECP2_neg(ECP2 *P);
+/**	@brief Doubles an ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =2*P
+ */
+extern int ECP2_dbl(ECP2 *P);
+/**	@brief Adds ECP2 instance Q to ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P+Q
+	@param Q ECP2 instance to be added to P
+ */
+extern int ECP2_add(ECP2 *P, ECP2 *Q);
+/**	@brief Subtracts ECP instance Q from ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P-Q
+	@param Q ECP2 instance to be subtracted from P
+ */
+extern void ECP2_sub(ECP2 *P, ECP2 *Q);
+/**	@brief Multiplies an ECP2 instance P by a BIG, side-channel resistant
+ *
+	Uses fixed sized windows.
+	@param P ECP2 instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP2_mul(ECP2 *P, B256_56::BIG b);
+/**	@brief Multiplies an ECP2 instance P by the internal modulus p, using precalculated Frobenius constant f
+ *
+	Fast point multiplication using Frobenius
+	@param P ECP2 instance, on exit = p*P
+	@param f FP2 precalculated Frobenius constant
+
+ */
+extern void ECP2_frob(ECP2 *P, BN254::FP2 *f);
+/**	@brief Calculates P=b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+ *
+	@param P ECP2 instance, on exit = b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+	@param Q ECP2 array of 4 points
+	@param b BIG array of 4 multipliers
+ */
+extern void ECP2_mul4(ECP2 *P, ECP2 *Q, B256_56::BIG *b);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP2 multiplied by co-factor
+ */
+extern void ECP2_cfp(ECP2 *Q);
+
+/**	@brief Maps random FP2 to curve point in constant time
+ *
+	@param Q ECP2 instance 
+	@param x FP2 derived from hash
+ */
+extern void ECP2_map2point(ECP2 *Q, BN254::FP2 *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP2 instance 
+	@param x Fp derived from hash
+ */
+extern void ECP2_hap2point(ECP2 *Q, B256_56::BIG  x);
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param P ECP2 instance of correct order
+	@param W OCTET byte array to be mapped
+ */
+extern void ECP2_mapit(ECP2 *P, octet *w);
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP2 instance
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_generator(ECP2 *G);
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp2_BN254CX.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp2_BN254CX.h
new file mode 100644
index 0000000..902fe59
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp2_BN254CX.h
@@ -0,0 +1,249 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP2_BN254CX_H
+#define ECP2_BN254CX_H
+
+#include "fp2_BN254CX.h"
+#include "config_curve_BN254CX.h"
+
+using namespace core;
+
+
+namespace BN254CX {
+
+extern const B256_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+}
+
+namespace BN254CX {
+
+/**
+	@brief ECP2 Structure - Elliptic Curve Point over quadratic extension field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag */
+    BN254CX::FP2 x;   /**< x-coordinate of point */
+    BN254CX::FP2 y;   /**< y-coordinate of point */
+    BN254CX::FP2 z;   /**< z-coordinate of point */
+} ECP2;
+
+
+/* Curve Params - see rom*.cpp */
+
+extern const int CURVE_B_I;		/**< Elliptic curve B parameter */
+extern const B256_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_56::BIG CURVE_Bnx;   /**< Elliptic curve parameter */
+extern const B256_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+
+/* Generator point on G1 */
+extern const B256_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+/* ECP2 E(Fp2) prototypes */
+/**	@brief Tests for ECP2 point equal to infinity
+ *
+	@param P ECP2 point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP2_isinf(ECP2 *P);
+/**	@brief Copy ECP2 point to another ECP2 point
+ *
+	@param P ECP2 instance, on exit = Q
+	@param Q ECP2 instance to be copied
+ */
+extern void ECP2_copy(ECP2 *P, ECP2 *Q);
+/**	@brief Set ECP2 to point-at-infinity
+ *
+	@param P ECP2 instance to be set to infinity
+ */
+extern void ECP2_inf(ECP2 *P);
+/**	@brief Tests for equality of two ECP2s
+ *
+	@param P ECP2 instance to be compared
+	@param Q ECP2 instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP2_equals(ECP2 *P, ECP2 *Q);
+/**	@brief Converts an ECP2 point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP2 instance to be converted to affine form
+ */
+extern void ECP2_affine(ECP2 *P);
+/**	@brief Extract x and y coordinates of an ECP2 point P
+ *
+	If x=y, returns only x
+	@param x FP2 on exit = x coordinate of point
+	@param y FP2 on exit = y coordinate of point (unless x=y)
+	@param P ECP2 instance (x,y)
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP2_get(BN254CX::FP2 *x, BN254CX::FP2 *y, ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, converted to affine coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_output(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, in projective coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_outputxyz(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to an octet string
+ *
+	The octet string is created in the form x|y or just x if compressed
+	Convert the real and imaginary parts of the x and y coordinates to big-endian base 256 form.
+    If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param S output octet string
+	@param P ECP2 instance to be converted to an octet string
+    @param c true for compression
+ */
+extern void ECP2_toOctet(octet *S, ECP2 *P, bool c);
+/**	@brief Creates an ECP2 point from an octet string
+ *
+	The octet string is in the form x|y
+	The real and imaginary parts of the x and y coordinates are in big-endian base 256 form.
+    If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP2 instance to be created from the octet string
+	@param S input octet string
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP2_fromOctet(ECP2 *P, octet *S);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x)=x^3+Ax+B
+	Used internally.
+	@param r FP2 value of f(x)
+	@param x FP2 instance
+ */
+extern void ECP2_rhs(BN254CX::FP2 *r, BN254CX::FP2 *x);
+/**	@brief Set ECP2 to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP2 instance to be set (x,y)
+	@param x FP2 x coordinate of point
+	@param y FP2 y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_set(ECP2 *P, BN254CX::FP2 *x, BN254CX::FP2 *y);
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Otherwise y coordinate is calculated from x.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+    @param s sign of y
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_setx(ECP2 *P, BN254CX::FP2 *x, int s);
+/**	@brief Negation of an ECP2 point
+ *
+	@param P ECP2 instance, on exit = -P
+ */
+extern void ECP2_neg(ECP2 *P);
+/**	@brief Doubles an ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =2*P
+ */
+extern int ECP2_dbl(ECP2 *P);
+/**	@brief Adds ECP2 instance Q to ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P+Q
+	@param Q ECP2 instance to be added to P
+ */
+extern int ECP2_add(ECP2 *P, ECP2 *Q);
+/**	@brief Subtracts ECP instance Q from ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P-Q
+	@param Q ECP2 instance to be subtracted from P
+ */
+extern void ECP2_sub(ECP2 *P, ECP2 *Q);
+/**	@brief Multiplies an ECP2 instance P by a BIG, side-channel resistant
+ *
+	Uses fixed sized windows.
+	@param P ECP2 instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP2_mul(ECP2 *P, B256_56::BIG b);
+/**	@brief Multiplies an ECP2 instance P by the internal modulus p, using precalculated Frobenius constant f
+ *
+	Fast point multiplication using Frobenius
+	@param P ECP2 instance, on exit = p*P
+	@param f FP2 precalculated Frobenius constant
+
+ */
+extern void ECP2_frob(ECP2 *P, BN254CX::FP2 *f);
+/**	@brief Calculates P=b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+ *
+	@param P ECP2 instance, on exit = b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+	@param Q ECP2 array of 4 points
+	@param b BIG array of 4 multipliers
+ */
+extern void ECP2_mul4(ECP2 *P, ECP2 *Q, B256_56::BIG *b);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP2 multiplied by co-factor
+ */
+extern void ECP2_cfp(ECP2 *Q);
+
+/**	@brief Maps random FP2 to curve point in constant time
+ *
+	@param Q ECP2 instance 
+	@param x FP2 derived from hash
+ */
+extern void ECP2_map2point(ECP2 *Q, BN254CX::FP2 *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP2 instance 
+	@param x Fp derived from hash
+ */
+extern void ECP2_hap2point(ECP2 *Q, B256_56::BIG  x);
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param P ECP2 instance of correct order
+	@param W OCTET byte array to be mapped
+ */
+extern void ECP2_mapit(ECP2 *P, octet *w);
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP2 instance
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_generator(ECP2 *G);
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp2_BN462.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp2_BN462.h
new file mode 100644
index 0000000..68bf8e8
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp2_BN462.h
@@ -0,0 +1,249 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP2_BN462_H
+#define ECP2_BN462_H
+
+#include "fp2_BN462.h"
+#include "config_curve_BN462.h"
+
+using namespace core;
+
+
+namespace BN462 {
+
+extern const B464_60::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B464_60::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+}
+
+namespace BN462 {
+
+/**
+	@brief ECP2 Structure - Elliptic Curve Point over quadratic extension field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag */
+    BN462::FP2 x;   /**< x-coordinate of point */
+    BN462::FP2 y;   /**< y-coordinate of point */
+    BN462::FP2 z;   /**< z-coordinate of point */
+} ECP2;
+
+
+/* Curve Params - see rom*.cpp */
+
+extern const int CURVE_B_I;		/**< Elliptic curve B parameter */
+extern const B464_60::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B464_60::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B464_60::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B464_60::BIG CURVE_Bnx;   /**< Elliptic curve parameter */
+extern const B464_60::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+
+/* Generator point on G1 */
+extern const B464_60::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B464_60::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B464_60::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+/* ECP2 E(Fp2) prototypes */
+/**	@brief Tests for ECP2 point equal to infinity
+ *
+	@param P ECP2 point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP2_isinf(ECP2 *P);
+/**	@brief Copy ECP2 point to another ECP2 point
+ *
+	@param P ECP2 instance, on exit = Q
+	@param Q ECP2 instance to be copied
+ */
+extern void ECP2_copy(ECP2 *P, ECP2 *Q);
+/**	@brief Set ECP2 to point-at-infinity
+ *
+	@param P ECP2 instance to be set to infinity
+ */
+extern void ECP2_inf(ECP2 *P);
+/**	@brief Tests for equality of two ECP2s
+ *
+	@param P ECP2 instance to be compared
+	@param Q ECP2 instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP2_equals(ECP2 *P, ECP2 *Q);
+/**	@brief Converts an ECP2 point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP2 instance to be converted to affine form
+ */
+extern void ECP2_affine(ECP2 *P);
+/**	@brief Extract x and y coordinates of an ECP2 point P
+ *
+	If x=y, returns only x
+	@param x FP2 on exit = x coordinate of point
+	@param y FP2 on exit = y coordinate of point (unless x=y)
+	@param P ECP2 instance (x,y)
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP2_get(BN462::FP2 *x, BN462::FP2 *y, ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, converted to affine coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_output(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, in projective coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_outputxyz(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to an octet string
+ *
+	The octet string is created in the form x|y or just x if compressed
+	Convert the real and imaginary parts of the x and y coordinates to big-endian base 256 form.
+    If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param S output octet string
+	@param P ECP2 instance to be converted to an octet string
+    @param c true for compression
+ */
+extern void ECP2_toOctet(octet *S, ECP2 *P, bool c);
+/**	@brief Creates an ECP2 point from an octet string
+ *
+	The octet string is in the form x|y
+	The real and imaginary parts of the x and y coordinates are in big-endian base 256 form.
+    If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP2 instance to be created from the octet string
+	@param S input octet string
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP2_fromOctet(ECP2 *P, octet *S);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x)=x^3+Ax+B
+	Used internally.
+	@param r FP2 value of f(x)
+	@param x FP2 instance
+ */
+extern void ECP2_rhs(BN462::FP2 *r, BN462::FP2 *x);
+/**	@brief Set ECP2 to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP2 instance to be set (x,y)
+	@param x FP2 x coordinate of point
+	@param y FP2 y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_set(ECP2 *P, BN462::FP2 *x, BN462::FP2 *y);
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Otherwise y coordinate is calculated from x.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+    @param s sign of y
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_setx(ECP2 *P, BN462::FP2 *x, int s);
+/**	@brief Negation of an ECP2 point
+ *
+	@param P ECP2 instance, on exit = -P
+ */
+extern void ECP2_neg(ECP2 *P);
+/**	@brief Doubles an ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =2*P
+ */
+extern int ECP2_dbl(ECP2 *P);
+/**	@brief Adds ECP2 instance Q to ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P+Q
+	@param Q ECP2 instance to be added to P
+ */
+extern int ECP2_add(ECP2 *P, ECP2 *Q);
+/**	@brief Subtracts ECP instance Q from ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P-Q
+	@param Q ECP2 instance to be subtracted from P
+ */
+extern void ECP2_sub(ECP2 *P, ECP2 *Q);
+/**	@brief Multiplies an ECP2 instance P by a BIG, side-channel resistant
+ *
+	Uses fixed sized windows.
+	@param P ECP2 instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP2_mul(ECP2 *P, B464_60::BIG b);
+/**	@brief Multiplies an ECP2 instance P by the internal modulus p, using precalculated Frobenius constant f
+ *
+	Fast point multiplication using Frobenius
+	@param P ECP2 instance, on exit = p*P
+	@param f FP2 precalculated Frobenius constant
+
+ */
+extern void ECP2_frob(ECP2 *P, BN462::FP2 *f);
+/**	@brief Calculates P=b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+ *
+	@param P ECP2 instance, on exit = b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+	@param Q ECP2 array of 4 points
+	@param b BIG array of 4 multipliers
+ */
+extern void ECP2_mul4(ECP2 *P, ECP2 *Q, B464_60::BIG *b);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP2 multiplied by co-factor
+ */
+extern void ECP2_cfp(ECP2 *Q);
+
+/**	@brief Maps random FP2 to curve point in constant time
+ *
+	@param Q ECP2 instance 
+	@param x FP2 derived from hash
+ */
+extern void ECP2_map2point(ECP2 *Q, BN462::FP2 *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP2 instance 
+	@param x Fp derived from hash
+ */
+extern void ECP2_hap2point(ECP2 *Q, B464_60::BIG  x);
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param P ECP2 instance of correct order
+	@param W OCTET byte array to be mapped
+ */
+extern void ECP2_mapit(ECP2 *P, octet *w);
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP2 instance
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_generator(ECP2 *G);
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp2_FP256BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp2_FP256BN.h
new file mode 100644
index 0000000..3f93480
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp2_FP256BN.h
@@ -0,0 +1,249 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP2_FP256BN_H
+#define ECP2_FP256BN_H
+
+#include "fp2_FP256BN.h"
+#include "config_curve_FP256BN.h"
+
+using namespace core;
+
+
+namespace FP256BN {
+
+extern const B256_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+}
+
+namespace FP256BN {
+
+/**
+	@brief ECP2 Structure - Elliptic Curve Point over quadratic extension field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag */
+    FP256BN::FP2 x;   /**< x-coordinate of point */
+    FP256BN::FP2 y;   /**< y-coordinate of point */
+    FP256BN::FP2 z;   /**< z-coordinate of point */
+} ECP2;
+
+
+/* Curve Params - see rom*.cpp */
+
+extern const int CURVE_B_I;		/**< Elliptic curve B parameter */
+extern const B256_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_56::BIG CURVE_Bnx;   /**< Elliptic curve parameter */
+extern const B256_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+
+/* Generator point on G1 */
+extern const B256_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+/* ECP2 E(Fp2) prototypes */
+/**	@brief Tests for ECP2 point equal to infinity
+ *
+	@param P ECP2 point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP2_isinf(ECP2 *P);
+/**	@brief Copy ECP2 point to another ECP2 point
+ *
+	@param P ECP2 instance, on exit = Q
+	@param Q ECP2 instance to be copied
+ */
+extern void ECP2_copy(ECP2 *P, ECP2 *Q);
+/**	@brief Set ECP2 to point-at-infinity
+ *
+	@param P ECP2 instance to be set to infinity
+ */
+extern void ECP2_inf(ECP2 *P);
+/**	@brief Tests for equality of two ECP2s
+ *
+	@param P ECP2 instance to be compared
+	@param Q ECP2 instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP2_equals(ECP2 *P, ECP2 *Q);
+/**	@brief Converts an ECP2 point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP2 instance to be converted to affine form
+ */
+extern void ECP2_affine(ECP2 *P);
+/**	@brief Extract x and y coordinates of an ECP2 point P
+ *
+	If x=y, returns only x
+	@param x FP2 on exit = x coordinate of point
+	@param y FP2 on exit = y coordinate of point (unless x=y)
+	@param P ECP2 instance (x,y)
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP2_get(FP256BN::FP2 *x, FP256BN::FP2 *y, ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, converted to affine coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_output(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, in projective coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_outputxyz(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to an octet string
+ *
+	The octet string is created in the form x|y or just x if compressed
+	Convert the real and imaginary parts of the x and y coordinates to big-endian base 256 form.
+    If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param S output octet string
+	@param P ECP2 instance to be converted to an octet string
+    @param c true for compression
+ */
+extern void ECP2_toOctet(octet *S, ECP2 *P, bool c);
+/**	@brief Creates an ECP2 point from an octet string
+ *
+	The octet string is in the form x|y
+	The real and imaginary parts of the x and y coordinates are in big-endian base 256 form.
+    If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP2 instance to be created from the octet string
+	@param S input octet string
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP2_fromOctet(ECP2 *P, octet *S);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x)=x^3+Ax+B
+	Used internally.
+	@param r FP2 value of f(x)
+	@param x FP2 instance
+ */
+extern void ECP2_rhs(FP256BN::FP2 *r, FP256BN::FP2 *x);
+/**	@brief Set ECP2 to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP2 instance to be set (x,y)
+	@param x FP2 x coordinate of point
+	@param y FP2 y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_set(ECP2 *P, FP256BN::FP2 *x, FP256BN::FP2 *y);
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Otherwise y coordinate is calculated from x.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+    @param s sign of y
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_setx(ECP2 *P, FP256BN::FP2 *x, int s);
+/**	@brief Negation of an ECP2 point
+ *
+	@param P ECP2 instance, on exit = -P
+ */
+extern void ECP2_neg(ECP2 *P);
+/**	@brief Doubles an ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =2*P
+ */
+extern int ECP2_dbl(ECP2 *P);
+/**	@brief Adds ECP2 instance Q to ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P+Q
+	@param Q ECP2 instance to be added to P
+ */
+extern int ECP2_add(ECP2 *P, ECP2 *Q);
+/**	@brief Subtracts ECP instance Q from ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P-Q
+	@param Q ECP2 instance to be subtracted from P
+ */
+extern void ECP2_sub(ECP2 *P, ECP2 *Q);
+/**	@brief Multiplies an ECP2 instance P by a BIG, side-channel resistant
+ *
+	Uses fixed sized windows.
+	@param P ECP2 instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP2_mul(ECP2 *P, B256_56::BIG b);
+/**	@brief Multiplies an ECP2 instance P by the internal modulus p, using precalculated Frobenius constant f
+ *
+	Fast point multiplication using Frobenius
+	@param P ECP2 instance, on exit = p*P
+	@param f FP2 precalculated Frobenius constant
+
+ */
+extern void ECP2_frob(ECP2 *P, FP256BN::FP2 *f);
+/**	@brief Calculates P=b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+ *
+	@param P ECP2 instance, on exit = b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+	@param Q ECP2 array of 4 points
+	@param b BIG array of 4 multipliers
+ */
+extern void ECP2_mul4(ECP2 *P, ECP2 *Q, B256_56::BIG *b);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP2 multiplied by co-factor
+ */
+extern void ECP2_cfp(ECP2 *Q);
+
+/**	@brief Maps random FP2 to curve point in constant time
+ *
+	@param Q ECP2 instance 
+	@param x FP2 derived from hash
+ */
+extern void ECP2_map2point(ECP2 *Q, FP256BN::FP2 *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP2 instance 
+	@param x Fp derived from hash
+ */
+extern void ECP2_hap2point(ECP2 *Q, B256_56::BIG  x);
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param P ECP2 instance of correct order
+	@param W OCTET byte array to be mapped
+ */
+extern void ECP2_mapit(ECP2 *P, octet *w);
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP2 instance
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_generator(ECP2 *G);
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp2_FP512BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp2_FP512BN.h
new file mode 100644
index 0000000..f18a652
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp2_FP512BN.h
@@ -0,0 +1,249 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP2_FP512BN_H
+#define ECP2_FP512BN_H
+
+#include "fp2_FP512BN.h"
+#include "config_curve_FP512BN.h"
+
+using namespace core;
+
+
+namespace FP512BN {
+
+extern const B512_60::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B512_60::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+}
+
+namespace FP512BN {
+
+/**
+	@brief ECP2 Structure - Elliptic Curve Point over quadratic extension field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag */
+    FP512BN::FP2 x;   /**< x-coordinate of point */
+    FP512BN::FP2 y;   /**< y-coordinate of point */
+    FP512BN::FP2 z;   /**< z-coordinate of point */
+} ECP2;
+
+
+/* Curve Params - see rom*.cpp */
+
+extern const int CURVE_B_I;		/**< Elliptic curve B parameter */
+extern const B512_60::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B512_60::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B512_60::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B512_60::BIG CURVE_Bnx;   /**< Elliptic curve parameter */
+extern const B512_60::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+
+/* Generator point on G1 */
+extern const B512_60::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B512_60::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B512_60::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+/* ECP2 E(Fp2) prototypes */
+/**	@brief Tests for ECP2 point equal to infinity
+ *
+	@param P ECP2 point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP2_isinf(ECP2 *P);
+/**	@brief Copy ECP2 point to another ECP2 point
+ *
+	@param P ECP2 instance, on exit = Q
+	@param Q ECP2 instance to be copied
+ */
+extern void ECP2_copy(ECP2 *P, ECP2 *Q);
+/**	@brief Set ECP2 to point-at-infinity
+ *
+	@param P ECP2 instance to be set to infinity
+ */
+extern void ECP2_inf(ECP2 *P);
+/**	@brief Tests for equality of two ECP2s
+ *
+	@param P ECP2 instance to be compared
+	@param Q ECP2 instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP2_equals(ECP2 *P, ECP2 *Q);
+/**	@brief Converts an ECP2 point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP2 instance to be converted to affine form
+ */
+extern void ECP2_affine(ECP2 *P);
+/**	@brief Extract x and y coordinates of an ECP2 point P
+ *
+	If x=y, returns only x
+	@param x FP2 on exit = x coordinate of point
+	@param y FP2 on exit = y coordinate of point (unless x=y)
+	@param P ECP2 instance (x,y)
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP2_get(FP512BN::FP2 *x, FP512BN::FP2 *y, ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, converted to affine coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_output(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to the console, in projective coordinates
+ *
+	@param P ECP2 instance to be printed
+ */
+extern void ECP2_outputxyz(ECP2 *P);
+/**	@brief Formats and outputs an ECP2 point to an octet string
+ *
+	The octet string is created in the form x|y or just x if compressed
+	Convert the real and imaginary parts of the x and y coordinates to big-endian base 256 form.
+    If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param S output octet string
+	@param P ECP2 instance to be converted to an octet string
+    @param c true for compression
+ */
+extern void ECP2_toOctet(octet *S, ECP2 *P, bool c);
+/**	@brief Creates an ECP2 point from an octet string
+ *
+	The octet string is in the form x|y
+	The real and imaginary parts of the x and y coordinates are in big-endian base 256 form.
+    If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP2 instance to be created from the octet string
+	@param S input octet string
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP2_fromOctet(ECP2 *P, octet *S);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x)=x^3+Ax+B
+	Used internally.
+	@param r FP2 value of f(x)
+	@param x FP2 instance
+ */
+extern void ECP2_rhs(FP512BN::FP2 *r, FP512BN::FP2 *x);
+/**	@brief Set ECP2 to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP2 instance to be set (x,y)
+	@param x FP2 x coordinate of point
+	@param y FP2 y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_set(ECP2 *P, FP512BN::FP2 *x, FP512BN::FP2 *y);
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Otherwise y coordinate is calculated from x.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+    @param s sign of y
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_setx(ECP2 *P, FP512BN::FP2 *x, int s);
+/**	@brief Negation of an ECP2 point
+ *
+	@param P ECP2 instance, on exit = -P
+ */
+extern void ECP2_neg(ECP2 *P);
+/**	@brief Doubles an ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =2*P
+ */
+extern int ECP2_dbl(ECP2 *P);
+/**	@brief Adds ECP2 instance Q to ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P+Q
+	@param Q ECP2 instance to be added to P
+ */
+extern int ECP2_add(ECP2 *P, ECP2 *Q);
+/**	@brief Subtracts ECP instance Q from ECP2 instance P
+ *
+	@param P ECP2 instance, on exit =P-Q
+	@param Q ECP2 instance to be subtracted from P
+ */
+extern void ECP2_sub(ECP2 *P, ECP2 *Q);
+/**	@brief Multiplies an ECP2 instance P by a BIG, side-channel resistant
+ *
+	Uses fixed sized windows.
+	@param P ECP2 instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP2_mul(ECP2 *P, B512_60::BIG b);
+/**	@brief Multiplies an ECP2 instance P by the internal modulus p, using precalculated Frobenius constant f
+ *
+	Fast point multiplication using Frobenius
+	@param P ECP2 instance, on exit = p*P
+	@param f FP2 precalculated Frobenius constant
+
+ */
+extern void ECP2_frob(ECP2 *P, FP512BN::FP2 *f);
+/**	@brief Calculates P=b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+ *
+	@param P ECP2 instance, on exit = b[0]*Q[0]+b[1]*Q[1]+b[2]*Q[2]+b[3]*Q[3]
+	@param Q ECP2 array of 4 points
+	@param b BIG array of 4 multipliers
+ */
+extern void ECP2_mul4(ECP2 *P, ECP2 *Q, B512_60::BIG *b);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP2 multiplied by co-factor
+ */
+extern void ECP2_cfp(ECP2 *Q);
+
+/**	@brief Maps random FP2 to curve point in constant time
+ *
+	@param Q ECP2 instance 
+	@param x FP2 derived from hash
+ */
+extern void ECP2_map2point(ECP2 *Q, FP512BN::FP2 *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP2 instance 
+	@param x Fp derived from hash
+ */
+extern void ECP2_hap2point(ECP2 *Q, B512_60::BIG  x);
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param P ECP2 instance of correct order
+	@param W OCTET byte array to be mapped
+ */
+extern void ECP2_mapit(ECP2 *P, octet *w);
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP2 instance
+	@return 1 if point exists, else 0
+ */
+extern int ECP2_generator(ECP2 *G);
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp4.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp4.h
new file mode 100644
index 0000000..27b6475
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp4.h
@@ -0,0 +1,268 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP4_ZZZ_H
+#define ECP4_ZZZ_H
+
+#include "fp4_YYY.h"
+#include "config_curve_ZZZ.h"
+
+using namespace core;
+
+namespace YYY {
+
+extern const XXX::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const XXX::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+}
+
+namespace ZZZ {
+
+/**
+	@brief ECP4 Structure - Elliptic Curve Point over quadratic extension field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag */
+    YYY::FP4 x;   /**< x-coordinate of point */
+    YYY::FP4 y;   /**< y-coordinate of point */
+    YYY::FP4 z;   /**< z-coordinate of point */
+} ECP4;
+
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;		/**< Elliptic curve B parameter */
+extern const XXX::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const XXX::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const XXX::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const XXX::BIG CURVE_Bnx;   /**< Elliptic curve parameter */
+extern const XXX::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+
+/* Generator point on G1 */
+extern const XXX::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const XXX::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const XXX::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/* ECP4 E(FP4) prototypes */
+/**	@brief Tests for ECP4 point equal to infinity
+ *
+	@param P ECP4 point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP4_isinf(ECP4 *P);
+/**	@brief Copy ECP4 point to another ECP4 point
+ *
+	@param P ECP4 instance, on exit = Q
+	@param Q ECP4 instance to be copied
+ */
+extern void ECP4_copy(ECP4 *P, ECP4 *Q);
+/**	@brief Set ECP4 to point-at-infinity
+ *
+	@param P ECP4 instance to be set to infinity
+ */
+extern void ECP4_inf(ECP4 *P);
+/**	@brief Tests for equality of two ECP4s
+ *
+	@param P ECP4 instance to be compared
+	@param Q ECP4 instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP4_equals(ECP4 *P, ECP4 *Q);
+
+/**	@brief Converts an ECP4 point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP4 instance to be converted to affine form
+ */
+extern void ECP4_affine(ECP4 *P);
+
+
+/**	@brief Extract x and y coordinates of an ECP4 point P
+ *
+	If x=y, returns only x
+	@param x FP4 on exit = x coordinate of point
+	@param y FP4 on exit = y coordinate of point (unless x=y)
+	@param P ECP4 instance (x,y)
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP4_get(YYY::FP4 *x, YYY::FP4 *y, ECP4 *P);
+/**	@brief Formats and outputs an ECP4 point to the console, converted to affine coordinates
+ *
+	@param P ECP4 instance to be printed
+ */
+extern void ECP4_output(ECP4 *P);
+
+/**	@brief Formats and outputs an ECP4 point to an octet string
+ *
+	The octet string is created in the form x|y or just x if compressed
+	Convert the real and imaginary parts of the x and y coordinates to big-endian base 256 form.
+	@param S output octet string
+	@param P ECP4 instance to be converted to an octet string
+    @param c true for compression
+ */
+extern void ECP4_toOctet(octet *S, ECP4 *P, bool c);
+/**	@brief Creates an ECP4 point from an octet string
+ *
+	The octet string is in the form x|y
+	The real and imaginary parts of the x and y coordinates are in big-endian base 256 form.
+	@param P ECP4 instance to be created from the octet string
+	@param S input octet string
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP4_fromOctet(ECP4 *P, octet *S);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x)=x^3+Ax+B
+	Used internally.
+	@param r FP4 value of f(x)
+	@param x FP4 instance
+ */
+extern void ECP4_rhs(YYY::FP4 *r, YYY::FP4 *x);
+/**	@brief Set ECP4 to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP4 instance to be set (x,y)
+	@param x FP4 x coordinate of point
+	@param y FP4 y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP4_set(ECP4 *P, YYY::FP4 *x, YYY::FP4 *y);
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Otherwise y coordinate is calculated from x.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+    @param s sign of y
+	@return 1 if point exists, else 0
+ */
+extern int ECP4_setx(ECP4 *P, YYY::FP4 *x, int s);
+/**	@brief Negation of an ECP4 point
+ *
+	@param P ECP4 instance, on exit = -P
+ */
+extern void ECP4_neg(ECP4 *P);
+
+/**	@brief Reduction of an ECP4 point
+ *
+	@param P ECP4 instance, on exit (x,y) are reduced wrt the modulus
+ */
+extern void ECP4_reduce(ECP4 *P);
+
+
+/**	@brief Doubles an ECP4 instance P
+ *
+	@param P ECP4 instance, on exit =2*P
+ */
+extern int ECP4_dbl(ECP4 *P);
+/**	@brief Adds ECP4 instance Q to ECP4 instance P
+ *
+	@param P ECP4 instance, on exit =P+Q
+	@param Q ECP4 instance to be added to P
+ */
+extern int ECP4_add(ECP4 *P, ECP4 *Q);
+/**	@brief Subtracts ECP instance Q from ECP4 instance P
+ *
+	@param P ECP4 instance, on exit =P-Q
+	@param Q ECP4 instance to be subtracted from P
+ */
+extern void ECP4_sub(ECP4 *P, ECP4 *Q);
+/**	@brief Multiplies an ECP4 instance P by a BIG, side-channel resistant
+ *
+	Uses fixed sized windows.
+	@param P ECP4 instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP4_mul(ECP4 *P, XXX::BIG b);
+
+/**	@brief Calculates required Frobenius constants
+ *
+	Calculate Frobenius constants
+	@param F array of FP2 precalculated constants
+
+ */
+extern void ECP4_frob_constants(YYY::FP2 F[3]);
+
+/**	@brief Multiplies an ECP4 instance P by the internal modulus p^n, using precalculated Frobenius constants
+ *
+	Fast point multiplication using Frobenius
+	@param P ECP4 instance, on exit = p^n*P
+	@param F array of FP2 precalculated Frobenius constant
+	@param n power of prime
+
+ */
+extern void ECP4_frob(ECP4 *P, YYY::FP2 F[3], int n);
+
+/**	@brief Calculates P=Sigma b[i]*Q[i] for i=0 to 7
+ *
+	@param P ECP4 instance, on exit = Sigma b[i]*Q[i] for i=0 to 7
+	@param Q ECP4 array of 4 points
+	@param b BIG array of 4 multipliers
+ */
+extern void ECP4_mul8(ECP4 *P, ECP4 *Q, XXX::BIG *b);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP4 multiplied by co-factor
+ */
+extern void ECP4_cfp(ECP4 *Q);
+
+/**	@brief Maps random FP4 to curve point in constant time
+ *
+	@param Q ECP4 instance 
+	@param x FP4 derived from hash
+ */
+extern void ECP4_map2point(ECP4 *Q, YYY::FP4 *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP4 instance 
+	@param x Fp derived from hash
+ */
+extern void ECP4_hap2point(ECP4 *Q, XXX::BIG  x);
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param P ECP4 instance of correct order
+	@param W OCTET byte array to be mapped
+ */
+extern void ECP4_mapit(ECP4 *P, octet *W);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP4 instance
+	@return 1 if point exists, else 0
+ */
+extern int ECP4_generator(ECP4 *G);
+
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp4_BLS24479.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp4_BLS24479.h
new file mode 100644
index 0000000..74ce8cc
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp4_BLS24479.h
@@ -0,0 +1,268 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP4_BLS24479_H
+#define ECP4_BLS24479_H
+
+#include "fp4_BLS24479.h"
+#include "config_curve_BLS24479.h"
+
+using namespace core;
+
+namespace BLS24479 {
+
+extern const B480_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B480_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+}
+
+namespace BLS24479 {
+
+/**
+	@brief ECP4 Structure - Elliptic Curve Point over quadratic extension field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag */
+    BLS24479::FP4 x;   /**< x-coordinate of point */
+    BLS24479::FP4 y;   /**< y-coordinate of point */
+    BLS24479::FP4 z;   /**< z-coordinate of point */
+} ECP4;
+
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;		/**< Elliptic curve B parameter */
+extern const B480_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B480_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B480_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B480_56::BIG CURVE_Bnx;   /**< Elliptic curve parameter */
+extern const B480_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+
+/* Generator point on G1 */
+extern const B480_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B480_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B480_56::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/* ECP4 E(FP4) prototypes */
+/**	@brief Tests for ECP4 point equal to infinity
+ *
+	@param P ECP4 point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP4_isinf(ECP4 *P);
+/**	@brief Copy ECP4 point to another ECP4 point
+ *
+	@param P ECP4 instance, on exit = Q
+	@param Q ECP4 instance to be copied
+ */
+extern void ECP4_copy(ECP4 *P, ECP4 *Q);
+/**	@brief Set ECP4 to point-at-infinity
+ *
+	@param P ECP4 instance to be set to infinity
+ */
+extern void ECP4_inf(ECP4 *P);
+/**	@brief Tests for equality of two ECP4s
+ *
+	@param P ECP4 instance to be compared
+	@param Q ECP4 instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP4_equals(ECP4 *P, ECP4 *Q);
+
+/**	@brief Converts an ECP4 point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP4 instance to be converted to affine form
+ */
+extern void ECP4_affine(ECP4 *P);
+
+
+/**	@brief Extract x and y coordinates of an ECP4 point P
+ *
+	If x=y, returns only x
+	@param x FP4 on exit = x coordinate of point
+	@param y FP4 on exit = y coordinate of point (unless x=y)
+	@param P ECP4 instance (x,y)
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP4_get(BLS24479::FP4 *x, BLS24479::FP4 *y, ECP4 *P);
+/**	@brief Formats and outputs an ECP4 point to the console, converted to affine coordinates
+ *
+	@param P ECP4 instance to be printed
+ */
+extern void ECP4_output(ECP4 *P);
+
+/**	@brief Formats and outputs an ECP4 point to an octet string
+ *
+	The octet string is created in the form x|y or just x if compressed
+	Convert the real and imaginary parts of the x and y coordinates to big-endian base 256 form.
+	@param S output octet string
+	@param P ECP4 instance to be converted to an octet string
+    @param c true for compression
+ */
+extern void ECP4_toOctet(octet *S, ECP4 *P, bool c);
+/**	@brief Creates an ECP4 point from an octet string
+ *
+	The octet string is in the form x|y
+	The real and imaginary parts of the x and y coordinates are in big-endian base 256 form.
+	@param P ECP4 instance to be created from the octet string
+	@param S input octet string
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP4_fromOctet(ECP4 *P, octet *S);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x)=x^3+Ax+B
+	Used internally.
+	@param r FP4 value of f(x)
+	@param x FP4 instance
+ */
+extern void ECP4_rhs(BLS24479::FP4 *r, BLS24479::FP4 *x);
+/**	@brief Set ECP4 to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP4 instance to be set (x,y)
+	@param x FP4 x coordinate of point
+	@param y FP4 y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP4_set(ECP4 *P, BLS24479::FP4 *x, BLS24479::FP4 *y);
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Otherwise y coordinate is calculated from x.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+    @param s sign of y
+	@return 1 if point exists, else 0
+ */
+extern int ECP4_setx(ECP4 *P, BLS24479::FP4 *x, int s);
+/**	@brief Negation of an ECP4 point
+ *
+	@param P ECP4 instance, on exit = -P
+ */
+extern void ECP4_neg(ECP4 *P);
+
+/**	@brief Reduction of an ECP4 point
+ *
+	@param P ECP4 instance, on exit (x,y) are reduced wrt the modulus
+ */
+extern void ECP4_reduce(ECP4 *P);
+
+
+/**	@brief Doubles an ECP4 instance P
+ *
+	@param P ECP4 instance, on exit =2*P
+ */
+extern int ECP4_dbl(ECP4 *P);
+/**	@brief Adds ECP4 instance Q to ECP4 instance P
+ *
+	@param P ECP4 instance, on exit =P+Q
+	@param Q ECP4 instance to be added to P
+ */
+extern int ECP4_add(ECP4 *P, ECP4 *Q);
+/**	@brief Subtracts ECP instance Q from ECP4 instance P
+ *
+	@param P ECP4 instance, on exit =P-Q
+	@param Q ECP4 instance to be subtracted from P
+ */
+extern void ECP4_sub(ECP4 *P, ECP4 *Q);
+/**	@brief Multiplies an ECP4 instance P by a BIG, side-channel resistant
+ *
+	Uses fixed sized windows.
+	@param P ECP4 instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP4_mul(ECP4 *P, B480_56::BIG b);
+
+/**	@brief Calculates required Frobenius constants
+ *
+	Calculate Frobenius constants
+	@param F array of FP2 precalculated constants
+
+ */
+extern void ECP4_frob_constants(BLS24479::FP2 F[3]);
+
+/**	@brief Multiplies an ECP4 instance P by the internal modulus p^n, using precalculated Frobenius constants
+ *
+	Fast point multiplication using Frobenius
+	@param P ECP4 instance, on exit = p^n*P
+	@param F array of FP2 precalculated Frobenius constant
+	@param n power of prime
+
+ */
+extern void ECP4_frob(ECP4 *P, BLS24479::FP2 F[3], int n);
+
+/**	@brief Calculates P=Sigma b[i]*Q[i] for i=0 to 7
+ *
+	@param P ECP4 instance, on exit = Sigma b[i]*Q[i] for i=0 to 7
+	@param Q ECP4 array of 4 points
+	@param b BIG array of 4 multipliers
+ */
+extern void ECP4_mul8(ECP4 *P, ECP4 *Q, B480_56::BIG *b);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP4 multiplied by co-factor
+ */
+extern void ECP4_cfp(ECP4 *Q);
+
+/**	@brief Maps random FP4 to curve point in constant time
+ *
+	@param Q ECP4 instance 
+	@param x FP4 derived from hash
+ */
+extern void ECP4_map2point(ECP4 *Q, BLS24479::FP4 *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP4 instance 
+	@param x Fp derived from hash
+ */
+extern void ECP4_hap2point(ECP4 *Q, B480_56::BIG  x);
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param P ECP4 instance of correct order
+	@param W OCTET byte array to be mapped
+ */
+extern void ECP4_mapit(ECP4 *P, octet *W);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP4 instance
+	@return 1 if point exists, else 0
+ */
+extern int ECP4_generator(ECP4 *G);
+
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp8.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp8.h
new file mode 100644
index 0000000..bf67972
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp8.h
@@ -0,0 +1,278 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP8_ZZZ_H
+#define ECP8_ZZZ_H
+
+#include "fp8_YYY.h"
+#include "config_curve_ZZZ.h"
+
+using namespace core;
+
+namespace YYY {
+
+extern const XXX::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const XXX::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+}
+
+namespace ZZZ {
+
+/**
+	@brief ECP8 Structure - Elliptic Curve Point over quadratic extension field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag */
+    YYY::FP8 x;   /**< x-coordinate of point */
+    YYY::FP8 y;   /**< y-coordinate of point */
+    YYY::FP8 z;   /**< z-coordinate of point */
+} ECP8;
+
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;		/**< Elliptic curve B parameter */
+extern const XXX::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const XXX::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const XXX::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const XXX::BIG CURVE_Bnx;   /**< Elliptic curve parameter */
+extern const XXX::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+
+/* Generator point on G1 */
+extern const XXX::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const XXX::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const XXX::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const XXX::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const XXX::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+/* ECP8 E(FP8) prototypes */
+/**	@brief Tests for ECP8 point equal to infinity
+ *
+	@param P ECP8 point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP8_isinf(ECP8 *P);
+/**	@brief Copy ECP8 point to another ECP8 point
+ *
+	@param P ECP8 instance, on exit = Q
+	@param Q ECP8 instance to be copied
+ */
+extern void ECP8_copy(ECP8 *P, ECP8 *Q);
+/**	@brief Set ECP8 to point-at-infinity
+ *
+	@param P ECP8 instance to be set to infinity
+ */
+extern void ECP8_inf(ECP8 *P);
+/**	@brief Tests for equality of two ECP8s
+ *
+	@param P ECP8 instance to be compared
+	@param Q ECP8 instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP8_equals(ECP8 *P, ECP8 *Q);
+
+/**	@brief Converts an ECP8 point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP8 instance to be converted to affine form
+ */
+extern void ECP8_affine(ECP8 *P);
+
+
+/**	@brief Extract x and y coordinates of an ECP8 point P
+ *
+	If x=y, returns only x
+	@param x FP8 on exit = x coordinate of point
+	@param y FP8 on exit = y coordinate of point (unless x=y)
+	@param P ECP8 instance (x,y)
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP8_get(YYY::FP8 *x, YYY::FP8 *y, ECP8 *P);
+/**	@brief Formats and outputs an ECP8 point to the console, converted to affine coordinates
+ *
+	@param P ECP8 instance to be printed
+ */
+extern void ECP8_output(ECP8 *P);
+
+/**	@brief Formats and outputs an ECP8 point to an octet string
+ *
+	The octet string is created in the form x|y or just x if compressed
+	Convert the real and imaginary parts of the x and y coordinates to big-endian base 256 form.
+	@param S output octet string
+	@param P ECP8 instance to be converted to an octet string
+    @param c true for compression
+ */
+extern void ECP8_toOctet(octet *S, ECP8 *P, bool c);
+/**	@brief Creates an ECP8 point from an octet string
+ *
+	The octet string is in the form x|y
+	The real and imaginary parts of the x and y coordinates are in big-endian base 256 form.
+	@param P ECP8 instance to be created from the octet string
+	@param S input octet string
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP8_fromOctet(ECP8 *P, octet *S);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x)=x^3+Ax+B
+	Used internally.
+	@param r FP8 value of f(x)
+	@param x FP8 instance
+ */
+extern void ECP8_rhs(YYY::FP8 *r, YYY::FP8 *x);
+/**	@brief Set ECP8 to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP8 instance to be set (x,y)
+	@param x FP8 x coordinate of point
+	@param y FP8 y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP8_set(ECP8 *P, YYY::FP8 *x, YYY::FP8 *y);
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Otherwise y coordinate is calculated from x.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+    @param s sign of y
+	@return 1 if point exists, else 0
+ */
+extern int ECP8_setx(ECP8 *P, YYY::FP8 *x,int s);
+/**	@brief Negation of an ECP8 point
+ *
+	@param P ECP8 instance, on exit = -P
+ */
+extern void ECP8_neg(ECP8 *P);
+
+/**	@brief Reduction of an ECP8 point
+ *
+	@param P ECP8 instance, on exit (x,y) are reduced wrt the modulus
+ */
+extern void ECP8_reduce(ECP8 *P);
+
+
+/**	@brief Doubles an ECP8 instance P
+ *
+	@param P ECP8 instance, on exit =2*P
+ */
+extern int ECP8_dbl(ECP8 *P);
+/**	@brief Adds ECP8 instance Q to ECP8 instance P
+ *
+	@param P ECP8 instance, on exit =P+Q
+	@param Q ECP8 instance to be added to P
+ */
+extern int ECP8_add(ECP8 *P, ECP8 *Q);
+/**	@brief Subtracts ECP instance Q from ECP8 instance P
+ *
+	@param P ECP8 instance, on exit =P-Q
+	@param Q ECP8 instance to be subtracted from P
+ */
+extern void ECP8_sub(ECP8 *P, ECP8 *Q);
+/**	@brief Multiplies an ECP8 instance P by a BIG, side-channel resistant
+ *
+	Uses fixed sized windows.
+	@param P ECP8 instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP8_mul(ECP8 *P, XXX::BIG b);
+
+/**	@brief Calculates required Frobenius constants
+ *
+	Calculate Frobenius constants
+	@param F array of FP2 precalculated constants
+
+ */
+extern void ECP8_frob_constants(YYY::FP2 F[3]);
+
+/**	@brief Multiplies an ECP8 instance P by the internal modulus p^n, using precalculated Frobenius constants
+ *
+	Fast point multiplication using Frobenius
+	@param P ECP8 instance, on exit = p^n*P
+	@param F array of FP2 precalculated Frobenius constant
+	@param n power of prime
+
+ */
+extern void ECP8_frob(ECP8 *P, YYY::FP2 F[3], int n);
+
+/**	@brief Calculates P=Sigma b[i]*Q[i] for i=0 to 7
+ *
+	@param P ECP8 instance, on exit = Sigma b[i]*Q[i] for i=0 to 7
+	@param Q ECP8 array of 4 points
+	@param b BIG array of 4 multipliers
+ */
+extern void ECP8_mul16(ECP8 *P, ECP8 *Q, XXX::BIG *b);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP8 multiplied by co-factor
+ */
+extern void ECP8_cfp(ECP8 *Q);
+
+/**	@brief Maps random FP8 to curve point in constant time
+ *
+	@param Q ECP8 instance 
+	@param x FP8 derived from hash
+ */
+extern void ECP8_map2point(ECP8 *Q, YYY::FP8 *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck 
+ *
+	@param Q ECP8 instance 
+	@param x Fp derived from hash
+ */
+extern void ECP8_hap2point(ECP8 *Q, XXX::BIG  x);
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param P ECP8 instance of correct order
+	@param W OCTET byte array to be mapped
+ */
+extern void ECP8_mapit(ECP8 *P, octet *W);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP8 instance
+	@return 1 if point exists, else 0
+ */
+extern int ECP8_generator(ECP8 *G);
+
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp8_BLS48286.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp8_BLS48286.h
new file mode 100644
index 0000000..7c7a598
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp8_BLS48286.h
@@ -0,0 +1,278 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP8_BLS48286_H
+#define ECP8_BLS48286_H
+
+#include "fp8_BLS48286.h"
+#include "config_curve_BLS48286.h"
+
+using namespace core;
+
+namespace BLS48286 {
+
+extern const B288_60::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B288_60::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+}
+
+namespace BLS48286 {
+
+/**
+	@brief ECP8 Structure - Elliptic Curve Point over quadratic extension field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag */
+    BLS48286::FP8 x;   /**< x-coordinate of point */
+    BLS48286::FP8 y;   /**< y-coordinate of point */
+    BLS48286::FP8 z;   /**< z-coordinate of point */
+} ECP8;
+
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;		/**< Elliptic curve B parameter */
+extern const B288_60::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B288_60::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B288_60::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B288_60::BIG CURVE_Bnx;   /**< Elliptic curve parameter */
+extern const B288_60::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+
+/* Generator point on G1 */
+extern const B288_60::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B288_60::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B288_60::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B288_60::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+/* ECP8 E(FP8) prototypes */
+/**	@brief Tests for ECP8 point equal to infinity
+ *
+	@param P ECP8 point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP8_isinf(ECP8 *P);
+/**	@brief Copy ECP8 point to another ECP8 point
+ *
+	@param P ECP8 instance, on exit = Q
+	@param Q ECP8 instance to be copied
+ */
+extern void ECP8_copy(ECP8 *P, ECP8 *Q);
+/**	@brief Set ECP8 to point-at-infinity
+ *
+	@param P ECP8 instance to be set to infinity
+ */
+extern void ECP8_inf(ECP8 *P);
+/**	@brief Tests for equality of two ECP8s
+ *
+	@param P ECP8 instance to be compared
+	@param Q ECP8 instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP8_equals(ECP8 *P, ECP8 *Q);
+
+/**	@brief Converts an ECP8 point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP8 instance to be converted to affine form
+ */
+extern void ECP8_affine(ECP8 *P);
+
+
+/**	@brief Extract x and y coordinates of an ECP8 point P
+ *
+	If x=y, returns only x
+	@param x FP8 on exit = x coordinate of point
+	@param y FP8 on exit = y coordinate of point (unless x=y)
+	@param P ECP8 instance (x,y)
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP8_get(BLS48286::FP8 *x, BLS48286::FP8 *y, ECP8 *P);
+/**	@brief Formats and outputs an ECP8 point to the console, converted to affine coordinates
+ *
+	@param P ECP8 instance to be printed
+ */
+extern void ECP8_output(ECP8 *P);
+
+/**	@brief Formats and outputs an ECP8 point to an octet string
+ *
+	The octet string is created in the form x|y or just x if compressed
+	Convert the real and imaginary parts of the x and y coordinates to big-endian base 256 form.
+	@param S output octet string
+	@param P ECP8 instance to be converted to an octet string
+    @param c true for compression
+ */
+extern void ECP8_toOctet(octet *S, ECP8 *P, bool c);
+/**	@brief Creates an ECP8 point from an octet string
+ *
+	The octet string is in the form x|y
+	The real and imaginary parts of the x and y coordinates are in big-endian base 256 form.
+	@param P ECP8 instance to be created from the octet string
+	@param S input octet string
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP8_fromOctet(ECP8 *P, octet *S);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x)=x^3+Ax+B
+	Used internally.
+	@param r FP8 value of f(x)
+	@param x FP8 instance
+ */
+extern void ECP8_rhs(BLS48286::FP8 *r, BLS48286::FP8 *x);
+/**	@brief Set ECP8 to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP8 instance to be set (x,y)
+	@param x FP8 x coordinate of point
+	@param y FP8 y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP8_set(ECP8 *P, BLS48286::FP8 *x, BLS48286::FP8 *y);
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Otherwise y coordinate is calculated from x.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+    @param s sign of y
+	@return 1 if point exists, else 0
+ */
+extern int ECP8_setx(ECP8 *P, BLS48286::FP8 *x,int s);
+/**	@brief Negation of an ECP8 point
+ *
+	@param P ECP8 instance, on exit = -P
+ */
+extern void ECP8_neg(ECP8 *P);
+
+/**	@brief Reduction of an ECP8 point
+ *
+	@param P ECP8 instance, on exit (x,y) are reduced wrt the modulus
+ */
+extern void ECP8_reduce(ECP8 *P);
+
+
+/**	@brief Doubles an ECP8 instance P
+ *
+	@param P ECP8 instance, on exit =2*P
+ */
+extern int ECP8_dbl(ECP8 *P);
+/**	@brief Adds ECP8 instance Q to ECP8 instance P
+ *
+	@param P ECP8 instance, on exit =P+Q
+	@param Q ECP8 instance to be added to P
+ */
+extern int ECP8_add(ECP8 *P, ECP8 *Q);
+/**	@brief Subtracts ECP instance Q from ECP8 instance P
+ *
+	@param P ECP8 instance, on exit =P-Q
+	@param Q ECP8 instance to be subtracted from P
+ */
+extern void ECP8_sub(ECP8 *P, ECP8 *Q);
+/**	@brief Multiplies an ECP8 instance P by a BIG, side-channel resistant
+ *
+	Uses fixed sized windows.
+	@param P ECP8 instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP8_mul(ECP8 *P, B288_60::BIG b);
+
+/**	@brief Calculates required Frobenius constants
+ *
+	Calculate Frobenius constants
+	@param F array of FP2 precalculated constants
+
+ */
+extern void ECP8_frob_constants(BLS48286::FP2 F[3]);
+
+/**	@brief Multiplies an ECP8 instance P by the internal modulus p^n, using precalculated Frobenius constants
+ *
+	Fast point multiplication using Frobenius
+	@param P ECP8 instance, on exit = p^n*P
+	@param F array of FP2 precalculated Frobenius constant
+	@param n power of prime
+
+ */
+extern void ECP8_frob(ECP8 *P, BLS48286::FP2 F[3], int n);
+
+/**	@brief Calculates P=Sigma b[i]*Q[i] for i=0 to 7
+ *
+	@param P ECP8 instance, on exit = Sigma b[i]*Q[i] for i=0 to 7
+	@param Q ECP8 array of 4 points
+	@param b BIG array of 4 multipliers
+ */
+extern void ECP8_mul16(ECP8 *P, ECP8 *Q, B288_60::BIG *b);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP8 multiplied by co-factor
+ */
+extern void ECP8_cfp(ECP8 *Q);
+
+/**	@brief Maps random FP8 to curve point in constant time
+ *
+	@param Q ECP8 instance 
+	@param x FP8 derived from hash
+ */
+extern void ECP8_map2point(ECP8 *Q, BLS48286::FP8 *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck 
+ *
+	@param Q ECP8 instance 
+	@param x Fp derived from hash
+ */
+extern void ECP8_hap2point(ECP8 *Q, B288_60::BIG  x);
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param P ECP8 instance of correct order
+	@param W OCTET byte array to be mapped
+ */
+extern void ECP8_mapit(ECP8 *P, octet *W);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP8 instance
+	@return 1 if point exists, else 0
+ */
+extern int ECP8_generator(ECP8 *G);
+
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp8_BLS48556.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp8_BLS48556.h
new file mode 100644
index 0000000..6652a72
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp8_BLS48556.h
@@ -0,0 +1,278 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP8_BLS48556_H
+#define ECP8_BLS48556_H
+
+#include "fp8_BLS48556.h"
+#include "config_curve_BLS48556.h"
+
+using namespace core;
+
+namespace BLS48556 {
+
+extern const B560_58::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B560_58::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+}
+
+namespace BLS48556 {
+
+/**
+	@brief ECP8 Structure - Elliptic Curve Point over quadratic extension field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag */
+    BLS48556::FP8 x;   /**< x-coordinate of point */
+    BLS48556::FP8 y;   /**< y-coordinate of point */
+    BLS48556::FP8 z;   /**< z-coordinate of point */
+} ECP8;
+
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;		/**< Elliptic curve B parameter */
+extern const B560_58::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B560_58::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B560_58::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B560_58::BIG CURVE_Bnx;   /**< Elliptic curve parameter */
+extern const B560_58::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+
+/* Generator point on G1 */
+extern const B560_58::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B560_58::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B560_58::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B560_58::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+/* ECP8 E(FP8) prototypes */
+/**	@brief Tests for ECP8 point equal to infinity
+ *
+	@param P ECP8 point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP8_isinf(ECP8 *P);
+/**	@brief Copy ECP8 point to another ECP8 point
+ *
+	@param P ECP8 instance, on exit = Q
+	@param Q ECP8 instance to be copied
+ */
+extern void ECP8_copy(ECP8 *P, ECP8 *Q);
+/**	@brief Set ECP8 to point-at-infinity
+ *
+	@param P ECP8 instance to be set to infinity
+ */
+extern void ECP8_inf(ECP8 *P);
+/**	@brief Tests for equality of two ECP8s
+ *
+	@param P ECP8 instance to be compared
+	@param Q ECP8 instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP8_equals(ECP8 *P, ECP8 *Q);
+
+/**	@brief Converts an ECP8 point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP8 instance to be converted to affine form
+ */
+extern void ECP8_affine(ECP8 *P);
+
+
+/**	@brief Extract x and y coordinates of an ECP8 point P
+ *
+	If x=y, returns only x
+	@param x FP8 on exit = x coordinate of point
+	@param y FP8 on exit = y coordinate of point (unless x=y)
+	@param P ECP8 instance (x,y)
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP8_get(BLS48556::FP8 *x, BLS48556::FP8 *y, ECP8 *P);
+/**	@brief Formats and outputs an ECP8 point to the console, converted to affine coordinates
+ *
+	@param P ECP8 instance to be printed
+ */
+extern void ECP8_output(ECP8 *P);
+
+/**	@brief Formats and outputs an ECP8 point to an octet string
+ *
+	The octet string is created in the form x|y or just x if compressed
+	Convert the real and imaginary parts of the x and y coordinates to big-endian base 256 form.
+	@param S output octet string
+	@param P ECP8 instance to be converted to an octet string
+    @param c true for compression
+ */
+extern void ECP8_toOctet(octet *S, ECP8 *P, bool c);
+/**	@brief Creates an ECP8 point from an octet string
+ *
+	The octet string is in the form x|y
+	The real and imaginary parts of the x and y coordinates are in big-endian base 256 form.
+	@param P ECP8 instance to be created from the octet string
+	@param S input octet string
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP8_fromOctet(ECP8 *P, octet *S);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x)=x^3+Ax+B
+	Used internally.
+	@param r FP8 value of f(x)
+	@param x FP8 instance
+ */
+extern void ECP8_rhs(BLS48556::FP8 *r, BLS48556::FP8 *x);
+/**	@brief Set ECP8 to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP8 instance to be set (x,y)
+	@param x FP8 x coordinate of point
+	@param y FP8 y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP8_set(ECP8 *P, BLS48556::FP8 *x, BLS48556::FP8 *y);
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Otherwise y coordinate is calculated from x.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+    @param s sign of y
+	@return 1 if point exists, else 0
+ */
+extern int ECP8_setx(ECP8 *P, BLS48556::FP8 *x,int s);
+/**	@brief Negation of an ECP8 point
+ *
+	@param P ECP8 instance, on exit = -P
+ */
+extern void ECP8_neg(ECP8 *P);
+
+/**	@brief Reduction of an ECP8 point
+ *
+	@param P ECP8 instance, on exit (x,y) are reduced wrt the modulus
+ */
+extern void ECP8_reduce(ECP8 *P);
+
+
+/**	@brief Doubles an ECP8 instance P
+ *
+	@param P ECP8 instance, on exit =2*P
+ */
+extern int ECP8_dbl(ECP8 *P);
+/**	@brief Adds ECP8 instance Q to ECP8 instance P
+ *
+	@param P ECP8 instance, on exit =P+Q
+	@param Q ECP8 instance to be added to P
+ */
+extern int ECP8_add(ECP8 *P, ECP8 *Q);
+/**	@brief Subtracts ECP instance Q from ECP8 instance P
+ *
+	@param P ECP8 instance, on exit =P-Q
+	@param Q ECP8 instance to be subtracted from P
+ */
+extern void ECP8_sub(ECP8 *P, ECP8 *Q);
+/**	@brief Multiplies an ECP8 instance P by a BIG, side-channel resistant
+ *
+	Uses fixed sized windows.
+	@param P ECP8 instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP8_mul(ECP8 *P, B560_58::BIG b);
+
+/**	@brief Calculates required Frobenius constants
+ *
+	Calculate Frobenius constants
+	@param F array of FP2 precalculated constants
+
+ */
+extern void ECP8_frob_constants(BLS48556::FP2 F[3]);
+
+/**	@brief Multiplies an ECP8 instance P by the internal modulus p^n, using precalculated Frobenius constants
+ *
+	Fast point multiplication using Frobenius
+	@param P ECP8 instance, on exit = p^n*P
+	@param F array of FP2 precalculated Frobenius constant
+	@param n power of prime
+
+ */
+extern void ECP8_frob(ECP8 *P, BLS48556::FP2 F[3], int n);
+
+/**	@brief Calculates P=Sigma b[i]*Q[i] for i=0 to 7
+ *
+	@param P ECP8 instance, on exit = Sigma b[i]*Q[i] for i=0 to 7
+	@param Q ECP8 array of 4 points
+	@param b BIG array of 4 multipliers
+ */
+extern void ECP8_mul16(ECP8 *P, ECP8 *Q, B560_58::BIG *b);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP8 multiplied by co-factor
+ */
+extern void ECP8_cfp(ECP8 *Q);
+
+/**	@brief Maps random FP8 to curve point in constant time
+ *
+	@param Q ECP8 instance 
+	@param x FP8 derived from hash
+ */
+extern void ECP8_map2point(ECP8 *Q, BLS48556::FP8 *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck 
+ *
+	@param Q ECP8 instance 
+	@param x Fp derived from hash
+ */
+extern void ECP8_hap2point(ECP8 *Q, B560_58::BIG  x);
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param P ECP8 instance of correct order
+	@param W OCTET byte array to be mapped
+ */
+extern void ECP8_mapit(ECP8 *P, octet *W);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP8 instance
+	@return 1 if point exists, else 0
+ */
+extern int ECP8_generator(ECP8 *G);
+
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp8_BLS48581.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp8_BLS48581.h
new file mode 100644
index 0000000..5cf3f97
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp8_BLS48581.h
@@ -0,0 +1,278 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP8_BLS48581_H
+#define ECP8_BLS48581_H
+
+#include "fp8_BLS48581.h"
+#include "config_curve_BLS48581.h"
+
+using namespace core;
+
+namespace BLS48581 {
+
+extern const B584_60::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B584_60::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+}
+
+namespace BLS48581 {
+
+/**
+	@brief ECP8 Structure - Elliptic Curve Point over quadratic extension field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag */
+    BLS48581::FP8 x;   /**< x-coordinate of point */
+    BLS48581::FP8 y;   /**< y-coordinate of point */
+    BLS48581::FP8 z;   /**< z-coordinate of point */
+} ECP8;
+
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;		/**< Elliptic curve B parameter */
+extern const B584_60::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B584_60::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B584_60::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B584_60::BIG CURVE_Bnx;   /**< Elliptic curve parameter */
+extern const B584_60::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+
+/* Generator point on G1 */
+extern const B584_60::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B584_60::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B584_60::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B584_60::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+/* ECP8 E(FP8) prototypes */
+/**	@brief Tests for ECP8 point equal to infinity
+ *
+	@param P ECP8 point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP8_isinf(ECP8 *P);
+/**	@brief Copy ECP8 point to another ECP8 point
+ *
+	@param P ECP8 instance, on exit = Q
+	@param Q ECP8 instance to be copied
+ */
+extern void ECP8_copy(ECP8 *P, ECP8 *Q);
+/**	@brief Set ECP8 to point-at-infinity
+ *
+	@param P ECP8 instance to be set to infinity
+ */
+extern void ECP8_inf(ECP8 *P);
+/**	@brief Tests for equality of two ECP8s
+ *
+	@param P ECP8 instance to be compared
+	@param Q ECP8 instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP8_equals(ECP8 *P, ECP8 *Q);
+
+/**	@brief Converts an ECP8 point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP8 instance to be converted to affine form
+ */
+extern void ECP8_affine(ECP8 *P);
+
+
+/**	@brief Extract x and y coordinates of an ECP8 point P
+ *
+	If x=y, returns only x
+	@param x FP8 on exit = x coordinate of point
+	@param y FP8 on exit = y coordinate of point (unless x=y)
+	@param P ECP8 instance (x,y)
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP8_get(BLS48581::FP8 *x, BLS48581::FP8 *y, ECP8 *P);
+/**	@brief Formats and outputs an ECP8 point to the console, converted to affine coordinates
+ *
+	@param P ECP8 instance to be printed
+ */
+extern void ECP8_output(ECP8 *P);
+
+/**	@brief Formats and outputs an ECP8 point to an octet string
+ *
+	The octet string is created in the form x|y or just x if compressed
+	Convert the real and imaginary parts of the x and y coordinates to big-endian base 256 form.
+	@param S output octet string
+	@param P ECP8 instance to be converted to an octet string
+    @param c true for compression
+ */
+extern void ECP8_toOctet(octet *S, ECP8 *P, bool c);
+/**	@brief Creates an ECP8 point from an octet string
+ *
+	The octet string is in the form x|y
+	The real and imaginary parts of the x and y coordinates are in big-endian base 256 form.
+	@param P ECP8 instance to be created from the octet string
+	@param S input octet string
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP8_fromOctet(ECP8 *P, octet *S);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x)=x^3+Ax+B
+	Used internally.
+	@param r FP8 value of f(x)
+	@param x FP8 instance
+ */
+extern void ECP8_rhs(BLS48581::FP8 *r, BLS48581::FP8 *x);
+/**	@brief Set ECP8 to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP8 instance to be set (x,y)
+	@param x FP8 x coordinate of point
+	@param y FP8 y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP8_set(ECP8 *P, BLS48581::FP8 *x, BLS48581::FP8 *y);
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Otherwise y coordinate is calculated from x.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+    @param s sign of y
+	@return 1 if point exists, else 0
+ */
+extern int ECP8_setx(ECP8 *P, BLS48581::FP8 *x,int s);
+/**	@brief Negation of an ECP8 point
+ *
+	@param P ECP8 instance, on exit = -P
+ */
+extern void ECP8_neg(ECP8 *P);
+
+/**	@brief Reduction of an ECP8 point
+ *
+	@param P ECP8 instance, on exit (x,y) are reduced wrt the modulus
+ */
+extern void ECP8_reduce(ECP8 *P);
+
+
+/**	@brief Doubles an ECP8 instance P
+ *
+	@param P ECP8 instance, on exit =2*P
+ */
+extern int ECP8_dbl(ECP8 *P);
+/**	@brief Adds ECP8 instance Q to ECP8 instance P
+ *
+	@param P ECP8 instance, on exit =P+Q
+	@param Q ECP8 instance to be added to P
+ */
+extern int ECP8_add(ECP8 *P, ECP8 *Q);
+/**	@brief Subtracts ECP instance Q from ECP8 instance P
+ *
+	@param P ECP8 instance, on exit =P-Q
+	@param Q ECP8 instance to be subtracted from P
+ */
+extern void ECP8_sub(ECP8 *P, ECP8 *Q);
+/**	@brief Multiplies an ECP8 instance P by a BIG, side-channel resistant
+ *
+	Uses fixed sized windows.
+	@param P ECP8 instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP8_mul(ECP8 *P, B584_60::BIG b);
+
+/**	@brief Calculates required Frobenius constants
+ *
+	Calculate Frobenius constants
+	@param F array of FP2 precalculated constants
+
+ */
+extern void ECP8_frob_constants(BLS48581::FP2 F[3]);
+
+/**	@brief Multiplies an ECP8 instance P by the internal modulus p^n, using precalculated Frobenius constants
+ *
+	Fast point multiplication using Frobenius
+	@param P ECP8 instance, on exit = p^n*P
+	@param F array of FP2 precalculated Frobenius constant
+	@param n power of prime
+
+ */
+extern void ECP8_frob(ECP8 *P, BLS48581::FP2 F[3], int n);
+
+/**	@brief Calculates P=Sigma b[i]*Q[i] for i=0 to 7
+ *
+	@param P ECP8 instance, on exit = Sigma b[i]*Q[i] for i=0 to 7
+	@param Q ECP8 array of 4 points
+	@param b BIG array of 4 multipliers
+ */
+extern void ECP8_mul16(ECP8 *P, ECP8 *Q, B584_60::BIG *b);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP8 multiplied by co-factor
+ */
+extern void ECP8_cfp(ECP8 *Q);
+
+/**	@brief Maps random FP8 to curve point in constant time
+ *
+	@param Q ECP8 instance 
+	@param x FP8 derived from hash
+ */
+extern void ECP8_map2point(ECP8 *Q, BLS48581::FP8 *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck 
+ *
+	@param Q ECP8 instance 
+	@param x Fp derived from hash
+ */
+extern void ECP8_hap2point(ECP8 *Q, B584_60::BIG  x);
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param P ECP8 instance of correct order
+	@param W OCTET byte array to be mapped
+ */
+extern void ECP8_mapit(ECP8 *P, octet *W);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP8 instance
+	@return 1 if point exists, else 0
+ */
+extern int ECP8_generator(ECP8 *G);
+
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_ANSSI.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_ANSSI.h
new file mode 100644
index 0000000..d6712ad
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_ANSSI.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_ANSSI_H
+#define ECP_ANSSI_H
+
+#include "fp_ANSSI.h"
+#include "config_curve_ANSSI.h"
+
+using namespace core;
+
+namespace ANSSI {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B256_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B256_56::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B256_56::BIG CURVE_Ad;
+extern const B256_56::BIG CURVE_Bd;
+extern const B256_56::BIG PC[];
+
+extern const B256_56::BIG CURVE_Adr;
+extern const B256_56::BIG CURVE_Adi;
+extern const B256_56::BIG CURVE_Bdr;
+extern const B256_56::BIG CURVE_Bdi;
+extern const B256_56::BIG PCR[];
+extern const B256_56::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B256_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B256_56::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B256_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B256_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B256_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    ANSSI::FP x; /**< x-coordinate of point */
+#if CURVETYPE_ANSSI!=MONTGOMERY
+    ANSSI::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    ANSSI::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(ANSSI::FP *r, ANSSI::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B256_56::BIG x, int s);
+
+#if CURVETYPE_ANSSI==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B256_56::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x, B256_56::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B256_56::BIG x, B256_56::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B256_56::BIG e, B256_56::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B256_56::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f, B256_56::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B256_56::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, ANSSI::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B256_56::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_BLS12381.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_BLS12381.h
new file mode 100644
index 0000000..e1e517c
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_BLS12381.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_BLS12381_H
+#define ECP_BLS12381_H
+
+#include "fp_BLS12381.h"
+#include "config_curve_BLS12381.h"
+
+using namespace core;
+
+namespace BLS12381 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B384_58::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B384_58::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B384_58::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B384_58::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B384_58::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B384_58::BIG CURVE_Ad;
+extern const B384_58::BIG CURVE_Bd;
+extern const B384_58::BIG PC[];
+
+extern const B384_58::BIG CURVE_Adr;
+extern const B384_58::BIG CURVE_Adi;
+extern const B384_58::BIG CURVE_Bdr;
+extern const B384_58::BIG CURVE_Bdi;
+extern const B384_58::BIG PCR[];
+extern const B384_58::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B384_58::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B384_58::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B384_58::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B384_58::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B384_58::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B384_58::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B384_58::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B384_58::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B384_58::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B384_58::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B384_58::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B384_58::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B384_58::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    BLS12381::FP x; /**< x-coordinate of point */
+#if CURVETYPE_BLS12381!=MONTGOMERY
+    BLS12381::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    BLS12381::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(BLS12381::FP *r, BLS12381::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B384_58::BIG x, int s);
+
+#if CURVETYPE_BLS12381==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B384_58::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B384_58::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B384_58::BIG x, B384_58::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B384_58::BIG x, B384_58::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B384_58::BIG e, B384_58::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B384_58::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B384_58::BIG e, B384_58::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B384_58::BIG e, B384_58::BIG f, B384_58::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B384_58::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, BLS12381::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B384_58::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_BLS12383.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_BLS12383.h
new file mode 100644
index 0000000..2fe74e0
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_BLS12383.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_BLS12383_H
+#define ECP_BLS12383_H
+
+#include "fp_BLS12383.h"
+#include "config_curve_BLS12383.h"
+
+using namespace core;
+
+namespace BLS12383 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B384_58::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B384_58::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B384_58::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B384_58::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B384_58::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B384_58::BIG CURVE_Ad;
+extern const B384_58::BIG CURVE_Bd;
+extern const B384_58::BIG PC[];
+
+extern const B384_58::BIG CURVE_Adr;
+extern const B384_58::BIG CURVE_Adi;
+extern const B384_58::BIG CURVE_Bdr;
+extern const B384_58::BIG CURVE_Bdi;
+extern const B384_58::BIG PCR[];
+extern const B384_58::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B384_58::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B384_58::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B384_58::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B384_58::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B384_58::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B384_58::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B384_58::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B384_58::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B384_58::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B384_58::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B384_58::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B384_58::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B384_58::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    BLS12383::FP x; /**< x-coordinate of point */
+#if CURVETYPE_BLS12383!=MONTGOMERY
+    BLS12383::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    BLS12383::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(BLS12383::FP *r, BLS12383::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B384_58::BIG x, int s);
+
+#if CURVETYPE_BLS12383==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B384_58::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B384_58::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B384_58::BIG x, B384_58::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B384_58::BIG x, B384_58::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B384_58::BIG e, B384_58::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B384_58::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B384_58::BIG e, B384_58::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B384_58::BIG e, B384_58::BIG f, B384_58::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B384_58::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, BLS12383::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B384_58::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_BLS12443.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_BLS12443.h
new file mode 100644
index 0000000..fb53c07
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_BLS12443.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_BLS12443_H
+#define ECP_BLS12443_H
+
+#include "fp_BLS12443.h"
+#include "config_curve_BLS12443.h"
+
+using namespace core;
+
+namespace BLS12443 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B448_60::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B448_60::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B448_60::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B448_60::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B448_60::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B448_60::BIG CURVE_Ad;
+extern const B448_60::BIG CURVE_Bd;
+extern const B448_60::BIG PC[];
+
+extern const B448_60::BIG CURVE_Adr;
+extern const B448_60::BIG CURVE_Adi;
+extern const B448_60::BIG CURVE_Bdr;
+extern const B448_60::BIG CURVE_Bdi;
+extern const B448_60::BIG PCR[];
+extern const B448_60::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B448_60::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B448_60::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B448_60::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B448_60::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B448_60::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B448_60::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_60::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B448_60::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B448_60::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B448_60::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B448_60::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B448_60::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B448_60::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B448_60::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    BLS12443::FP x; /**< x-coordinate of point */
+#if CURVETYPE_BLS12443!=MONTGOMERY
+    BLS12443::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    BLS12443::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(BLS12443::FP *r, BLS12443::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B448_60::BIG x, int s);
+
+#if CURVETYPE_BLS12443==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B448_60::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B448_60::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B448_60::BIG x, B448_60::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B448_60::BIG x, B448_60::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B448_60::BIG e, B448_60::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B448_60::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B448_60::BIG e, B448_60::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B448_60::BIG e, B448_60::BIG f, B448_60::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B448_60::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, BLS12443::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B448_60::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_BLS12461.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_BLS12461.h
new file mode 100644
index 0000000..ba041e2
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_BLS12461.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_BLS12461_H
+#define ECP_BLS12461_H
+
+#include "fp_BLS12461.h"
+#include "config_curve_BLS12461.h"
+
+using namespace core;
+
+namespace BLS12461 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B464_60::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B464_60::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B464_60::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B464_60::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B464_60::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B464_60::BIG CURVE_Ad;
+extern const B464_60::BIG CURVE_Bd;
+extern const B464_60::BIG PC[];
+
+extern const B464_60::BIG CURVE_Adr;
+extern const B464_60::BIG CURVE_Adi;
+extern const B464_60::BIG CURVE_Bdr;
+extern const B464_60::BIG CURVE_Bdi;
+extern const B464_60::BIG PCR[];
+extern const B464_60::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B464_60::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B464_60::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B464_60::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B464_60::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B464_60::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B464_60::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B464_60::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B464_60::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B464_60::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B464_60::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B464_60::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B464_60::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B464_60::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    BLS12461::FP x; /**< x-coordinate of point */
+#if CURVETYPE_BLS12461!=MONTGOMERY
+    BLS12461::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    BLS12461::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(BLS12461::FP *r, BLS12461::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B464_60::BIG x, int s);
+
+#if CURVETYPE_BLS12461==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B464_60::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B464_60::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B464_60::BIG x, B464_60::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B464_60::BIG x, B464_60::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B464_60::BIG e, B464_60::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B464_60::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B464_60::BIG e, B464_60::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B464_60::BIG e, B464_60::BIG f, B464_60::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B464_60::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, BLS12461::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B464_60::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_BLS24479.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_BLS24479.h
new file mode 100644
index 0000000..8c15a99
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_BLS24479.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_BLS24479_H
+#define ECP_BLS24479_H
+
+#include "fp_BLS24479.h"
+#include "config_curve_BLS24479.h"
+
+using namespace core;
+
+namespace BLS24479 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B480_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B480_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B480_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B480_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B480_56::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B480_56::BIG CURVE_Ad;
+extern const B480_56::BIG CURVE_Bd;
+extern const B480_56::BIG PC[];
+
+extern const B480_56::BIG CURVE_Adr;
+extern const B480_56::BIG CURVE_Adi;
+extern const B480_56::BIG CURVE_Bdr;
+extern const B480_56::BIG CURVE_Bdi;
+extern const B480_56::BIG PCR[];
+extern const B480_56::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B480_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B480_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B480_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B480_56::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B480_56::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B480_56::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B480_56::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B480_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B480_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B480_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B480_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B480_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B480_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B480_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    BLS24479::FP x; /**< x-coordinate of point */
+#if CURVETYPE_BLS24479!=MONTGOMERY
+    BLS24479::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    BLS24479::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(BLS24479::FP *r, BLS24479::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B480_56::BIG x, int s);
+
+#if CURVETYPE_BLS24479==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B480_56::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B480_56::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B480_56::BIG x, B480_56::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B480_56::BIG x, B480_56::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B480_56::BIG e, B480_56::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B480_56::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B480_56::BIG e, B480_56::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B480_56::BIG e, B480_56::BIG f, B480_56::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B480_56::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, BLS24479::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B480_56::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_BLS48286.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_BLS48286.h
new file mode 100644
index 0000000..8521f8b
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_BLS48286.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_BLS48286_H
+#define ECP_BLS48286_H
+
+#include "fp_BLS48286.h"
+#include "config_curve_BLS48286.h"
+
+using namespace core;
+
+namespace BLS48286 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B288_60::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B288_60::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B288_60::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B288_60::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B288_60::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B288_60::BIG CURVE_Ad;
+extern const B288_60::BIG CURVE_Bd;
+extern const B288_60::BIG PC[];
+
+extern const B288_60::BIG CURVE_Adr;
+extern const B288_60::BIG CURVE_Adi;
+extern const B288_60::BIG CURVE_Bdr;
+extern const B288_60::BIG CURVE_Bdi;
+extern const B288_60::BIG PCR[];
+extern const B288_60::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B288_60::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B288_60::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B288_60::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B288_60::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B288_60::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B288_60::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B288_60::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B288_60::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B288_60::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B288_60::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B288_60::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B288_60::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B288_60::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B288_60::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    BLS48286::FP x; /**< x-coordinate of point */
+#if CURVETYPE_BLS48286!=MONTGOMERY
+    BLS48286::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    BLS48286::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(BLS48286::FP *r, BLS48286::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B288_60::BIG x, int s);
+
+#if CURVETYPE_BLS48286==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B288_60::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B288_60::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B288_60::BIG x, B288_60::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B288_60::BIG x, B288_60::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B288_60::BIG e, B288_60::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B288_60::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B288_60::BIG e, B288_60::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B288_60::BIG e, B288_60::BIG f, B288_60::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B288_60::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, BLS48286::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B288_60::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_BLS48556.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_BLS48556.h
new file mode 100644
index 0000000..e295d4d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_BLS48556.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_BLS48556_H
+#define ECP_BLS48556_H
+
+#include "fp_BLS48556.h"
+#include "config_curve_BLS48556.h"
+
+using namespace core;
+
+namespace BLS48556 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B560_58::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B560_58::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B560_58::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B560_58::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B560_58::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B560_58::BIG CURVE_Ad;
+extern const B560_58::BIG CURVE_Bd;
+extern const B560_58::BIG PC[];
+
+extern const B560_58::BIG CURVE_Adr;
+extern const B560_58::BIG CURVE_Adi;
+extern const B560_58::BIG CURVE_Bdr;
+extern const B560_58::BIG CURVE_Bdi;
+extern const B560_58::BIG PCR[];
+extern const B560_58::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B560_58::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B560_58::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B560_58::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B560_58::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B560_58::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B560_58::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B560_58::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B560_58::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B560_58::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B560_58::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B560_58::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B560_58::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B560_58::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B560_58::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    BLS48556::FP x; /**< x-coordinate of point */
+#if CURVETYPE_BLS48556!=MONTGOMERY
+    BLS48556::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    BLS48556::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(BLS48556::FP *r, BLS48556::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B560_58::BIG x, int s);
+
+#if CURVETYPE_BLS48556==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B560_58::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B560_58::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B560_58::BIG x, B560_58::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B560_58::BIG x, B560_58::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B560_58::BIG e, B560_58::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B560_58::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B560_58::BIG e, B560_58::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B560_58::BIG e, B560_58::BIG f, B560_58::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B560_58::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, BLS48556::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B560_58::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_BLS48581.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_BLS48581.h
new file mode 100644
index 0000000..82421e0
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_BLS48581.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_BLS48581_H
+#define ECP_BLS48581_H
+
+#include "fp_BLS48581.h"
+#include "config_curve_BLS48581.h"
+
+using namespace core;
+
+namespace BLS48581 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B584_60::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B584_60::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B584_60::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B584_60::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B584_60::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B584_60::BIG CURVE_Ad;
+extern const B584_60::BIG CURVE_Bd;
+extern const B584_60::BIG PC[];
+
+extern const B584_60::BIG CURVE_Adr;
+extern const B584_60::BIG CURVE_Adi;
+extern const B584_60::BIG CURVE_Bdr;
+extern const B584_60::BIG CURVE_Bdi;
+extern const B584_60::BIG PCR[];
+extern const B584_60::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B584_60::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B584_60::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B584_60::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B584_60::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B584_60::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B584_60::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B584_60::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B584_60::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B584_60::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B584_60::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B584_60::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B584_60::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B584_60::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B584_60::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    BLS48581::FP x; /**< x-coordinate of point */
+#if CURVETYPE_BLS48581!=MONTGOMERY
+    BLS48581::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    BLS48581::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(BLS48581::FP *r, BLS48581::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B584_60::BIG x, int s);
+
+#if CURVETYPE_BLS48581==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B584_60::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B584_60::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B584_60::BIG x, B584_60::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B584_60::BIG x, B584_60::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B584_60::BIG e, B584_60::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B584_60::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B584_60::BIG e, B584_60::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B584_60::BIG e, B584_60::BIG f, B584_60::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B584_60::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, BLS48581::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B584_60::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_BN158.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_BN158.h
new file mode 100644
index 0000000..e185a5d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_BN158.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_BN158_H
+#define ECP_BN158_H
+
+#include "fp_BN158.h"
+#include "config_curve_BN158.h"
+
+using namespace core;
+
+namespace BN158 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B160_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B160_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B160_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B160_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B160_56::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B160_56::BIG CURVE_Ad;
+extern const B160_56::BIG CURVE_Bd;
+extern const B160_56::BIG PC[];
+
+extern const B160_56::BIG CURVE_Adr;
+extern const B160_56::BIG CURVE_Adi;
+extern const B160_56::BIG CURVE_Bdr;
+extern const B160_56::BIG CURVE_Bdi;
+extern const B160_56::BIG PCR[];
+extern const B160_56::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B160_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B160_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B160_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B160_56::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B160_56::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B160_56::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B160_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B160_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B160_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B160_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B160_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B160_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B160_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    BN158::FP x; /**< x-coordinate of point */
+#if CURVETYPE_BN158!=MONTGOMERY
+    BN158::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    BN158::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(BN158::FP *r, BN158::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B160_56::BIG x, int s);
+
+#if CURVETYPE_BN158==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B160_56::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B160_56::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B160_56::BIG x, B160_56::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B160_56::BIG x, B160_56::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B160_56::BIG e, B160_56::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B160_56::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B160_56::BIG e, B160_56::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B160_56::BIG e, B160_56::BIG f, B160_56::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B160_56::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, BN158::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B160_56::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_BN254.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_BN254.h
new file mode 100644
index 0000000..9859f91
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_BN254.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_BN254_H
+#define ECP_BN254_H
+
+#include "fp_BN254.h"
+#include "config_curve_BN254.h"
+
+using namespace core;
+
+namespace BN254 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B256_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B256_56::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B256_56::BIG CURVE_Ad;
+extern const B256_56::BIG CURVE_Bd;
+extern const B256_56::BIG PC[];
+
+extern const B256_56::BIG CURVE_Adr;
+extern const B256_56::BIG CURVE_Adi;
+extern const B256_56::BIG CURVE_Bdr;
+extern const B256_56::BIG CURVE_Bdi;
+extern const B256_56::BIG PCR[];
+extern const B256_56::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B256_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B256_56::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B256_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B256_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B256_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    BN254::FP x; /**< x-coordinate of point */
+#if CURVETYPE_BN254!=MONTGOMERY
+    BN254::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    BN254::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(BN254::FP *r, BN254::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B256_56::BIG x, int s);
+
+#if CURVETYPE_BN254==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B256_56::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x, B256_56::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B256_56::BIG x, B256_56::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B256_56::BIG e, B256_56::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B256_56::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f, B256_56::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B256_56::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, BN254::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B256_56::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_BN254CX.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_BN254CX.h
new file mode 100644
index 0000000..84ff680
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_BN254CX.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_BN254CX_H
+#define ECP_BN254CX_H
+
+#include "fp_BN254CX.h"
+#include "config_curve_BN254CX.h"
+
+using namespace core;
+
+namespace BN254CX {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B256_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B256_56::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B256_56::BIG CURVE_Ad;
+extern const B256_56::BIG CURVE_Bd;
+extern const B256_56::BIG PC[];
+
+extern const B256_56::BIG CURVE_Adr;
+extern const B256_56::BIG CURVE_Adi;
+extern const B256_56::BIG CURVE_Bdr;
+extern const B256_56::BIG CURVE_Bdi;
+extern const B256_56::BIG PCR[];
+extern const B256_56::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B256_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B256_56::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B256_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B256_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B256_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    BN254CX::FP x; /**< x-coordinate of point */
+#if CURVETYPE_BN254CX!=MONTGOMERY
+    BN254CX::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    BN254CX::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(BN254CX::FP *r, BN254CX::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B256_56::BIG x, int s);
+
+#if CURVETYPE_BN254CX==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B256_56::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x, B256_56::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B256_56::BIG x, B256_56::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B256_56::BIG e, B256_56::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B256_56::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f, B256_56::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B256_56::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, BN254CX::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B256_56::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_BN462.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_BN462.h
new file mode 100644
index 0000000..a356251
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_BN462.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_BN462_H
+#define ECP_BN462_H
+
+#include "fp_BN462.h"
+#include "config_curve_BN462.h"
+
+using namespace core;
+
+namespace BN462 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B464_60::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B464_60::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B464_60::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B464_60::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B464_60::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B464_60::BIG CURVE_Ad;
+extern const B464_60::BIG CURVE_Bd;
+extern const B464_60::BIG PC[];
+
+extern const B464_60::BIG CURVE_Adr;
+extern const B464_60::BIG CURVE_Adi;
+extern const B464_60::BIG CURVE_Bdr;
+extern const B464_60::BIG CURVE_Bdi;
+extern const B464_60::BIG PCR[];
+extern const B464_60::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B464_60::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B464_60::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B464_60::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B464_60::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B464_60::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B464_60::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B464_60::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B464_60::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B464_60::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B464_60::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B464_60::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B464_60::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B464_60::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B464_60::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    BN462::FP x; /**< x-coordinate of point */
+#if CURVETYPE_BN462!=MONTGOMERY
+    BN462::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    BN462::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(BN462::FP *r, BN462::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B464_60::BIG x, int s);
+
+#if CURVETYPE_BN462==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B464_60::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B464_60::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B464_60::BIG x, B464_60::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B464_60::BIG x, B464_60::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B464_60::BIG e, B464_60::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B464_60::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B464_60::BIG e, B464_60::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B464_60::BIG e, B464_60::BIG f, B464_60::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B464_60::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, BN462::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B464_60::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_BRAINPOOL.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_BRAINPOOL.h
new file mode 100644
index 0000000..a655093
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_BRAINPOOL.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_BRAINPOOL_H
+#define ECP_BRAINPOOL_H
+
+#include "fp_BRAINPOOL.h"
+#include "config_curve_BRAINPOOL.h"
+
+using namespace core;
+
+namespace BRAINPOOL {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B256_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B256_56::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B256_56::BIG CURVE_Ad;
+extern const B256_56::BIG CURVE_Bd;
+extern const B256_56::BIG PC[];
+
+extern const B256_56::BIG CURVE_Adr;
+extern const B256_56::BIG CURVE_Adi;
+extern const B256_56::BIG CURVE_Bdr;
+extern const B256_56::BIG CURVE_Bdi;
+extern const B256_56::BIG PCR[];
+extern const B256_56::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B256_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B256_56::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B256_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B256_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B256_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    BRAINPOOL::FP x; /**< x-coordinate of point */
+#if CURVETYPE_BRAINPOOL!=MONTGOMERY
+    BRAINPOOL::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    BRAINPOOL::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(BRAINPOOL::FP *r, BRAINPOOL::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B256_56::BIG x, int s);
+
+#if CURVETYPE_BRAINPOOL==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B256_56::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x, B256_56::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B256_56::BIG x, B256_56::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B256_56::BIG e, B256_56::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B256_56::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f, B256_56::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B256_56::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, BRAINPOOL::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B256_56::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_C1174.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_C1174.h
new file mode 100644
index 0000000..23604e5
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_C1174.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_C1174_H
+#define ECP_C1174_H
+
+#include "fp_C1174.h"
+#include "config_curve_C1174.h"
+
+using namespace core;
+
+namespace C1174 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B256_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B256_56::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B256_56::BIG CURVE_Ad;
+extern const B256_56::BIG CURVE_Bd;
+extern const B256_56::BIG PC[];
+
+extern const B256_56::BIG CURVE_Adr;
+extern const B256_56::BIG CURVE_Adi;
+extern const B256_56::BIG CURVE_Bdr;
+extern const B256_56::BIG CURVE_Bdi;
+extern const B256_56::BIG PCR[];
+extern const B256_56::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B256_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B256_56::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B256_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B256_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B256_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    C1174::FP x; /**< x-coordinate of point */
+#if CURVETYPE_C1174!=MONTGOMERY
+    C1174::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    C1174::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(C1174::FP *r, C1174::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B256_56::BIG x, int s);
+
+#if CURVETYPE_C1174==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B256_56::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x, B256_56::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B256_56::BIG x, B256_56::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B256_56::BIG e, B256_56::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B256_56::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f, B256_56::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B256_56::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, C1174::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B256_56::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_C13318.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_C13318.h
new file mode 100644
index 0000000..d76e729
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_C13318.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_C13318_H
+#define ECP_C13318_H
+
+#include "fp_F25519.h"
+#include "config_curve_C13318.h"
+
+using namespace core;
+
+namespace C13318 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B256_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B256_56::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B256_56::BIG CURVE_Ad;
+extern const B256_56::BIG CURVE_Bd;
+extern const B256_56::BIG PC[];
+
+extern const B256_56::BIG CURVE_Adr;
+extern const B256_56::BIG CURVE_Adi;
+extern const B256_56::BIG CURVE_Bdr;
+extern const B256_56::BIG CURVE_Bdi;
+extern const B256_56::BIG PCR[];
+extern const B256_56::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B256_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B256_56::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B256_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B256_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B256_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    F25519::FP x; /**< x-coordinate of point */
+#if CURVETYPE_C13318!=MONTGOMERY
+    F25519::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    F25519::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(F25519::FP *r, F25519::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B256_56::BIG x, int s);
+
+#if CURVETYPE_C13318==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B256_56::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x, B256_56::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B256_56::BIG x, B256_56::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B256_56::BIG e, B256_56::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B256_56::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f, B256_56::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B256_56::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, F25519::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B256_56::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_C1665.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_C1665.h
new file mode 100644
index 0000000..f1f4e28
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_C1665.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_C1665_H
+#define ECP_C1665_H
+
+#include "fp_C1665.h"
+#include "config_curve_C1665.h"
+
+using namespace core;
+
+namespace C1665 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B168_60::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B168_60::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B168_60::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B168_60::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B168_60::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B168_60::BIG CURVE_Ad;
+extern const B168_60::BIG CURVE_Bd;
+extern const B168_60::BIG PC[];
+
+extern const B168_60::BIG CURVE_Adr;
+extern const B168_60::BIG CURVE_Adi;
+extern const B168_60::BIG CURVE_Bdr;
+extern const B168_60::BIG CURVE_Bdi;
+extern const B168_60::BIG PCR[];
+extern const B168_60::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B168_60::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B168_60::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B168_60::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B168_60::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B168_60::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B168_60::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B168_60::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B168_60::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B168_60::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B168_60::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B168_60::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B168_60::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B168_60::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B168_60::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B168_60::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B168_60::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B168_60::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B168_60::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B168_60::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B168_60::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B168_60::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B168_60::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B168_60::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B168_60::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B168_60::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B168_60::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B168_60::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B168_60::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B168_60::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B168_60::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B168_60::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B168_60::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B168_60::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B168_60::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B168_60::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B168_60::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B168_60::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    C1665::FP x; /**< x-coordinate of point */
+#if CURVETYPE_C1665!=MONTGOMERY
+    C1665::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    C1665::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(C1665::FP *r, C1665::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B168_60::BIG x, int s);
+
+#if CURVETYPE_C1665==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B168_60::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B168_60::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B168_60::BIG x, B168_60::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B168_60::BIG x, B168_60::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B168_60::BIG e, B168_60::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B168_60::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B168_60::BIG e, B168_60::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B168_60::BIG e, B168_60::BIG f, B168_60::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B168_60::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, C1665::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B168_60::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_C25519.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_C25519.h
new file mode 100644
index 0000000..49fd43c
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_C25519.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_C25519_H
+#define ECP_C25519_H
+
+#include "fp_F25519.h"
+#include "config_curve_C25519.h"
+
+using namespace core;
+
+namespace C25519 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B256_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B256_56::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B256_56::BIG CURVE_Ad;
+extern const B256_56::BIG CURVE_Bd;
+extern const B256_56::BIG PC[];
+
+extern const B256_56::BIG CURVE_Adr;
+extern const B256_56::BIG CURVE_Adi;
+extern const B256_56::BIG CURVE_Bdr;
+extern const B256_56::BIG CURVE_Bdi;
+extern const B256_56::BIG PCR[];
+extern const B256_56::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B256_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B256_56::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B256_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B256_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B256_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    F25519::FP x; /**< x-coordinate of point */
+#if CURVETYPE_C25519!=MONTGOMERY
+    F25519::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    F25519::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(F25519::FP *r, F25519::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B256_56::BIG x, int s);
+
+#if CURVETYPE_C25519==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B256_56::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x, B256_56::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B256_56::BIG x, B256_56::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B256_56::BIG e, B256_56::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B256_56::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f, B256_56::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B256_56::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, F25519::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B256_56::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_C41417.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_C41417.h
new file mode 100644
index 0000000..b0b62f8
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_C41417.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_C41417_H
+#define ECP_C41417_H
+
+#include "fp_C41417.h"
+#include "config_curve_C41417.h"
+
+using namespace core;
+
+namespace C41417 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B416_60::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B416_60::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B416_60::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B416_60::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B416_60::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B416_60::BIG CURVE_Ad;
+extern const B416_60::BIG CURVE_Bd;
+extern const B416_60::BIG PC[];
+
+extern const B416_60::BIG CURVE_Adr;
+extern const B416_60::BIG CURVE_Adi;
+extern const B416_60::BIG CURVE_Bdr;
+extern const B416_60::BIG CURVE_Bdi;
+extern const B416_60::BIG PCR[];
+extern const B416_60::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B416_60::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B416_60::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B416_60::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B416_60::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B416_60::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B416_60::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B416_60::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B416_60::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B416_60::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B416_60::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B416_60::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B416_60::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B416_60::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B416_60::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B416_60::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B416_60::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B416_60::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B416_60::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B416_60::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B416_60::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B416_60::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B416_60::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B416_60::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B416_60::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B416_60::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B416_60::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B416_60::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B416_60::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B416_60::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B416_60::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B416_60::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B416_60::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B416_60::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B416_60::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B416_60::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B416_60::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B416_60::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    C41417::FP x; /**< x-coordinate of point */
+#if CURVETYPE_C41417!=MONTGOMERY
+    C41417::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    C41417::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(C41417::FP *r, C41417::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B416_60::BIG x, int s);
+
+#if CURVETYPE_C41417==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B416_60::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B416_60::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B416_60::BIG x, B416_60::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B416_60::BIG x, B416_60::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B416_60::BIG e, B416_60::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B416_60::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B416_60::BIG e, B416_60::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B416_60::BIG e, B416_60::BIG f, B416_60::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B416_60::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, C41417::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B416_60::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_Ed25519.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_Ed25519.h
new file mode 100644
index 0000000..a981276
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_Ed25519.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_Ed25519_H
+#define ECP_Ed25519_H
+
+#include "fp_F25519.h"
+#include "config_curve_Ed25519.h"
+
+using namespace core;
+
+namespace Ed25519 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B256_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B256_56::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B256_56::BIG CURVE_Ad;
+extern const B256_56::BIG CURVE_Bd;
+extern const B256_56::BIG PC[];
+
+extern const B256_56::BIG CURVE_Adr;
+extern const B256_56::BIG CURVE_Adi;
+extern const B256_56::BIG CURVE_Bdr;
+extern const B256_56::BIG CURVE_Bdi;
+extern const B256_56::BIG PCR[];
+extern const B256_56::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B256_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B256_56::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B256_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B256_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B256_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    F25519::FP x; /**< x-coordinate of point */
+#if CURVETYPE_Ed25519!=MONTGOMERY
+    F25519::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    F25519::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(F25519::FP *r, F25519::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B256_56::BIG x, int s);
+
+#if CURVETYPE_Ed25519==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B256_56::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x, B256_56::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B256_56::BIG x, B256_56::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B256_56::BIG e, B256_56::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B256_56::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f, B256_56::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B256_56::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, F25519::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B256_56::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_Ed448.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_Ed448.h
new file mode 100644
index 0000000..b8cb07a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_Ed448.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_Ed448_H
+#define ECP_Ed448_H
+
+#include "fp_F448.h"
+#include "config_curve_Ed448.h"
+
+using namespace core;
+
+namespace Ed448 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B448_58::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B448_58::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B448_58::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B448_58::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B448_58::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B448_58::BIG CURVE_Ad;
+extern const B448_58::BIG CURVE_Bd;
+extern const B448_58::BIG PC[];
+
+extern const B448_58::BIG CURVE_Adr;
+extern const B448_58::BIG CURVE_Adi;
+extern const B448_58::BIG CURVE_Bdr;
+extern const B448_58::BIG CURVE_Bdi;
+extern const B448_58::BIG PCR[];
+extern const B448_58::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B448_58::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B448_58::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B448_58::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B448_58::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B448_58::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B448_58::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B448_58::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B448_58::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B448_58::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B448_58::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B448_58::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B448_58::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B448_58::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    F448::FP x; /**< x-coordinate of point */
+#if CURVETYPE_Ed448!=MONTGOMERY
+    F448::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    F448::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(F448::FP *r, F448::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B448_58::BIG x, int s);
+
+#if CURVETYPE_Ed448==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B448_58::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B448_58::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B448_58::BIG x, B448_58::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B448_58::BIG x, B448_58::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B448_58::BIG e, B448_58::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B448_58::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B448_58::BIG e, B448_58::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B448_58::BIG e, B448_58::BIG f, B448_58::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B448_58::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, F448::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B448_58::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_FP256BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_FP256BN.h
new file mode 100644
index 0000000..fbecaf3
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_FP256BN.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_FP256BN_H
+#define ECP_FP256BN_H
+
+#include "fp_FP256BN.h"
+#include "config_curve_FP256BN.h"
+
+using namespace core;
+
+namespace FP256BN {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B256_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B256_56::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B256_56::BIG CURVE_Ad;
+extern const B256_56::BIG CURVE_Bd;
+extern const B256_56::BIG PC[];
+
+extern const B256_56::BIG CURVE_Adr;
+extern const B256_56::BIG CURVE_Adi;
+extern const B256_56::BIG CURVE_Bdr;
+extern const B256_56::BIG CURVE_Bdi;
+extern const B256_56::BIG PCR[];
+extern const B256_56::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B256_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B256_56::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B256_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B256_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B256_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    FP256BN::FP x; /**< x-coordinate of point */
+#if CURVETYPE_FP256BN!=MONTGOMERY
+    FP256BN::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    FP256BN::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(FP256BN::FP *r, FP256BN::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B256_56::BIG x, int s);
+
+#if CURVETYPE_FP256BN==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B256_56::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x, B256_56::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B256_56::BIG x, B256_56::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B256_56::BIG e, B256_56::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B256_56::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f, B256_56::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B256_56::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, FP256BN::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B256_56::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_FP512BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_FP512BN.h
new file mode 100644
index 0000000..e4d02d4
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_FP512BN.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_FP512BN_H
+#define ECP_FP512BN_H
+
+#include "fp_FP512BN.h"
+#include "config_curve_FP512BN.h"
+
+using namespace core;
+
+namespace FP512BN {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B512_60::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B512_60::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B512_60::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B512_60::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B512_60::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B512_60::BIG CURVE_Ad;
+extern const B512_60::BIG CURVE_Bd;
+extern const B512_60::BIG PC[];
+
+extern const B512_60::BIG CURVE_Adr;
+extern const B512_60::BIG CURVE_Adi;
+extern const B512_60::BIG CURVE_Bdr;
+extern const B512_60::BIG CURVE_Bdi;
+extern const B512_60::BIG PCR[];
+extern const B512_60::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B512_60::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B512_60::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B512_60::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B512_60::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B512_60::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B512_60::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B512_60::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B512_60::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B512_60::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B512_60::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B512_60::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B512_60::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B512_60::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    FP512BN::FP x; /**< x-coordinate of point */
+#if CURVETYPE_FP512BN!=MONTGOMERY
+    FP512BN::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    FP512BN::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(FP512BN::FP *r, FP512BN::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B512_60::BIG x, int s);
+
+#if CURVETYPE_FP512BN==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B512_60::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B512_60::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B512_60::BIG x, B512_60::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B512_60::BIG x, B512_60::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B512_60::BIG e, B512_60::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B512_60::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B512_60::BIG e, B512_60::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B512_60::BIG e, B512_60::BIG f, B512_60::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B512_60::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, FP512BN::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B512_60::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_HIFIVE.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_HIFIVE.h
new file mode 100644
index 0000000..3fcc24c
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_HIFIVE.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_HIFIVE_H
+#define ECP_HIFIVE_H
+
+#include "fp_HIFIVE.h"
+#include "config_curve_HIFIVE.h"
+
+using namespace core;
+
+namespace HIFIVE {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B336_60::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B336_60::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B336_60::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B336_60::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B336_60::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B336_60::BIG CURVE_Ad;
+extern const B336_60::BIG CURVE_Bd;
+extern const B336_60::BIG PC[];
+
+extern const B336_60::BIG CURVE_Adr;
+extern const B336_60::BIG CURVE_Adi;
+extern const B336_60::BIG CURVE_Bdr;
+extern const B336_60::BIG CURVE_Bdi;
+extern const B336_60::BIG PCR[];
+extern const B336_60::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B336_60::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B336_60::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B336_60::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B336_60::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B336_60::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B336_60::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B336_60::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B336_60::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B336_60::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B336_60::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B336_60::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B336_60::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B336_60::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B336_60::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B336_60::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B336_60::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B336_60::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B336_60::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B336_60::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B336_60::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B336_60::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B336_60::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B336_60::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B336_60::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B336_60::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B336_60::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B336_60::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B336_60::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B336_60::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B336_60::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B336_60::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B336_60::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B336_60::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B336_60::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B336_60::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B336_60::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B336_60::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    HIFIVE::FP x; /**< x-coordinate of point */
+#if CURVETYPE_HIFIVE!=MONTGOMERY
+    HIFIVE::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    HIFIVE::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(HIFIVE::FP *r, HIFIVE::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B336_60::BIG x, int s);
+
+#if CURVETYPE_HIFIVE==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B336_60::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B336_60::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B336_60::BIG x, B336_60::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B336_60::BIG x, B336_60::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B336_60::BIG e, B336_60::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B336_60::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B336_60::BIG e, B336_60::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B336_60::BIG e, B336_60::BIG f, B336_60::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B336_60::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, HIFIVE::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B336_60::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_JUBJUB.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_JUBJUB.h
new file mode 100644
index 0000000..d3eac2b
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_JUBJUB.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_JUBJUB_H
+#define ECP_JUBJUB_H
+
+#include "fp_JUBJUB.h"
+#include "config_curve_JUBJUB.h"
+
+using namespace core;
+
+namespace JUBJUB {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B256_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B256_56::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B256_56::BIG CURVE_Ad;
+extern const B256_56::BIG CURVE_Bd;
+extern const B256_56::BIG PC[];
+
+extern const B256_56::BIG CURVE_Adr;
+extern const B256_56::BIG CURVE_Adi;
+extern const B256_56::BIG CURVE_Bdr;
+extern const B256_56::BIG CURVE_Bdi;
+extern const B256_56::BIG PCR[];
+extern const B256_56::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B256_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B256_56::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B256_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B256_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B256_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    JUBJUB::FP x; /**< x-coordinate of point */
+#if CURVETYPE_JUBJUB!=MONTGOMERY
+    JUBJUB::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    JUBJUB::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(JUBJUB::FP *r, JUBJUB::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B256_56::BIG x, int s);
+
+#if CURVETYPE_JUBJUB==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B256_56::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x, B256_56::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B256_56::BIG x, B256_56::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B256_56::BIG e, B256_56::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B256_56::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f, B256_56::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B256_56::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, JUBJUB::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B256_56::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_MDC.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_MDC.h
new file mode 100644
index 0000000..e47d5e8
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_MDC.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_MDC_H
+#define ECP_MDC_H
+
+#include "fp_MDC.h"
+#include "config_curve_MDC.h"
+
+using namespace core;
+
+namespace MDC {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B256_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B256_56::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B256_56::BIG CURVE_Ad;
+extern const B256_56::BIG CURVE_Bd;
+extern const B256_56::BIG PC[];
+
+extern const B256_56::BIG CURVE_Adr;
+extern const B256_56::BIG CURVE_Adi;
+extern const B256_56::BIG CURVE_Bdr;
+extern const B256_56::BIG CURVE_Bdi;
+extern const B256_56::BIG PCR[];
+extern const B256_56::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B256_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B256_56::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B256_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B256_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B256_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    MDC::FP x; /**< x-coordinate of point */
+#if CURVETYPE_MDC!=MONTGOMERY
+    MDC::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    MDC::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(MDC::FP *r, MDC::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B256_56::BIG x, int s);
+
+#if CURVETYPE_MDC==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B256_56::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x, B256_56::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B256_56::BIG x, B256_56::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B256_56::BIG e, B256_56::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B256_56::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f, B256_56::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B256_56::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, MDC::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B256_56::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_NIST256.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_NIST256.h
new file mode 100644
index 0000000..4151ec0
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_NIST256.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_NIST256_H
+#define ECP_NIST256_H
+
+#include "fp_NIST256.h"
+#include "config_curve_NIST256.h"
+
+using namespace core;
+
+namespace NIST256 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B256_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B256_56::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B256_56::BIG CURVE_Ad;
+extern const B256_56::BIG CURVE_Bd;
+extern const B256_56::BIG PC[];
+
+extern const B256_56::BIG CURVE_Adr;
+extern const B256_56::BIG CURVE_Adi;
+extern const B256_56::BIG CURVE_Bdr;
+extern const B256_56::BIG CURVE_Bdi;
+extern const B256_56::BIG PCR[];
+extern const B256_56::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B256_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B256_56::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B256_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B256_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B256_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    NIST256::FP x; /**< x-coordinate of point */
+#if CURVETYPE_NIST256!=MONTGOMERY
+    NIST256::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    NIST256::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(NIST256::FP *r, NIST256::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B256_56::BIG x, int s);
+
+#if CURVETYPE_NIST256==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B256_56::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x, B256_56::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B256_56::BIG x, B256_56::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B256_56::BIG e, B256_56::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B256_56::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f, B256_56::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B256_56::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, NIST256::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B256_56::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_NIST384.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_NIST384.h
new file mode 100644
index 0000000..18e6373
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_NIST384.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_NIST384_H
+#define ECP_NIST384_H
+
+#include "fp_NIST384.h"
+#include "config_curve_NIST384.h"
+
+using namespace core;
+
+namespace NIST384 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B384_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B384_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B384_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B384_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B384_56::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B384_56::BIG CURVE_Ad;
+extern const B384_56::BIG CURVE_Bd;
+extern const B384_56::BIG PC[];
+
+extern const B384_56::BIG CURVE_Adr;
+extern const B384_56::BIG CURVE_Adi;
+extern const B384_56::BIG CURVE_Bdr;
+extern const B384_56::BIG CURVE_Bdi;
+extern const B384_56::BIG PCR[];
+extern const B384_56::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B384_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B384_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B384_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B384_56::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_56::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_56::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_56::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_56::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_56::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_56::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_56::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B384_56::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_56::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_56::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_56::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_56::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_56::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_56::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_56::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B384_56::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_56::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_56::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_56::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_56::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_56::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_56::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_56::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B384_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B384_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B384_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B384_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B384_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B384_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B384_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    NIST384::FP x; /**< x-coordinate of point */
+#if CURVETYPE_NIST384!=MONTGOMERY
+    NIST384::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    NIST384::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(NIST384::FP *r, NIST384::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B384_56::BIG x, int s);
+
+#if CURVETYPE_NIST384==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B384_56::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B384_56::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B384_56::BIG x, B384_56::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B384_56::BIG x, B384_56::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B384_56::BIG e, B384_56::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B384_56::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B384_56::BIG e, B384_56::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B384_56::BIG e, B384_56::BIG f, B384_56::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B384_56::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, NIST384::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B384_56::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_NIST521.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_NIST521.h
new file mode 100644
index 0000000..30ff2fc
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_NIST521.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_NIST521_H
+#define ECP_NIST521_H
+
+#include "fp_NIST521.h"
+#include "config_curve_NIST521.h"
+
+using namespace core;
+
+namespace NIST521 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B528_60::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B528_60::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B528_60::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B528_60::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B528_60::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B528_60::BIG CURVE_Ad;
+extern const B528_60::BIG CURVE_Bd;
+extern const B528_60::BIG PC[];
+
+extern const B528_60::BIG CURVE_Adr;
+extern const B528_60::BIG CURVE_Adi;
+extern const B528_60::BIG CURVE_Bdr;
+extern const B528_60::BIG CURVE_Bdi;
+extern const B528_60::BIG PCR[];
+extern const B528_60::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B528_60::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B528_60::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B528_60::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B528_60::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B528_60::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B528_60::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B528_60::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B528_60::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B528_60::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B528_60::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B528_60::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B528_60::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B528_60::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B528_60::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B528_60::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B528_60::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B528_60::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B528_60::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B528_60::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B528_60::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B528_60::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B528_60::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B528_60::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B528_60::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B528_60::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B528_60::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B528_60::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B528_60::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B528_60::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B528_60::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B528_60::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B528_60::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B528_60::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B528_60::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B528_60::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B528_60::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B528_60::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    NIST521::FP x; /**< x-coordinate of point */
+#if CURVETYPE_NIST521!=MONTGOMERY
+    NIST521::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    NIST521::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(NIST521::FP *r, NIST521::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B528_60::BIG x, int s);
+
+#if CURVETYPE_NIST521==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B528_60::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B528_60::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B528_60::BIG x, B528_60::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B528_60::BIG x, B528_60::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B528_60::BIG e, B528_60::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B528_60::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B528_60::BIG e, B528_60::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B528_60::BIG e, B528_60::BIG f, B528_60::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B528_60::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, NIST521::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B528_60::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_NUMS256E.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_NUMS256E.h
new file mode 100644
index 0000000..0cd09d8
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_NUMS256E.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_NUMS256E_H
+#define ECP_NUMS256E_H
+
+#include "fp_F256PME.h"
+#include "config_curve_NUMS256E.h"
+
+using namespace core;
+
+namespace NUMS256E {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B256_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B256_56::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B256_56::BIG CURVE_Ad;
+extern const B256_56::BIG CURVE_Bd;
+extern const B256_56::BIG PC[];
+
+extern const B256_56::BIG CURVE_Adr;
+extern const B256_56::BIG CURVE_Adi;
+extern const B256_56::BIG CURVE_Bdr;
+extern const B256_56::BIG CURVE_Bdi;
+extern const B256_56::BIG PCR[];
+extern const B256_56::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B256_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B256_56::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B256_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B256_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B256_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    F256PME::FP x; /**< x-coordinate of point */
+#if CURVETYPE_NUMS256E!=MONTGOMERY
+    F256PME::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    F256PME::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(F256PME::FP *r, F256PME::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B256_56::BIG x, int s);
+
+#if CURVETYPE_NUMS256E==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B256_56::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x, B256_56::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B256_56::BIG x, B256_56::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B256_56::BIG e, B256_56::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B256_56::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f, B256_56::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B256_56::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, F256PME::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B256_56::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_NUMS256W.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_NUMS256W.h
new file mode 100644
index 0000000..b806344
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_NUMS256W.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_NUMS256W_H
+#define ECP_NUMS256W_H
+
+#include "fp_F256PMW.h"
+#include "config_curve_NUMS256W.h"
+
+using namespace core;
+
+namespace NUMS256W {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B256_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B256_56::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B256_56::BIG CURVE_Ad;
+extern const B256_56::BIG CURVE_Bd;
+extern const B256_56::BIG PC[];
+
+extern const B256_56::BIG CURVE_Adr;
+extern const B256_56::BIG CURVE_Adi;
+extern const B256_56::BIG CURVE_Bdr;
+extern const B256_56::BIG CURVE_Bdi;
+extern const B256_56::BIG PCR[];
+extern const B256_56::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B256_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B256_56::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B256_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B256_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B256_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    F256PMW::FP x; /**< x-coordinate of point */
+#if CURVETYPE_NUMS256W!=MONTGOMERY
+    F256PMW::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    F256PMW::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(F256PMW::FP *r, F256PMW::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B256_56::BIG x, int s);
+
+#if CURVETYPE_NUMS256W==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B256_56::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x, B256_56::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B256_56::BIG x, B256_56::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B256_56::BIG e, B256_56::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B256_56::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f, B256_56::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B256_56::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, F256PMW::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B256_56::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_NUMS384E.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_NUMS384E.h
new file mode 100644
index 0000000..f3d53bb
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_NUMS384E.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_NUMS384E_H
+#define ECP_NUMS384E_H
+
+#include "fp_F384PM.h"
+#include "config_curve_NUMS384E.h"
+
+using namespace core;
+
+namespace NUMS384E {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B384_58::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B384_58::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B384_58::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B384_58::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B384_58::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B384_58::BIG CURVE_Ad;
+extern const B384_58::BIG CURVE_Bd;
+extern const B384_58::BIG PC[];
+
+extern const B384_58::BIG CURVE_Adr;
+extern const B384_58::BIG CURVE_Adi;
+extern const B384_58::BIG CURVE_Bdr;
+extern const B384_58::BIG CURVE_Bdi;
+extern const B384_58::BIG PCR[];
+extern const B384_58::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B384_58::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B384_58::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B384_58::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B384_58::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B384_58::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B384_58::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B384_58::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B384_58::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B384_58::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B384_58::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B384_58::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B384_58::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B384_58::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    F384PM::FP x; /**< x-coordinate of point */
+#if CURVETYPE_NUMS384E!=MONTGOMERY
+    F384PM::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    F384PM::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(F384PM::FP *r, F384PM::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B384_58::BIG x, int s);
+
+#if CURVETYPE_NUMS384E==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B384_58::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B384_58::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B384_58::BIG x, B384_58::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B384_58::BIG x, B384_58::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B384_58::BIG e, B384_58::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B384_58::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B384_58::BIG e, B384_58::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B384_58::BIG e, B384_58::BIG f, B384_58::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B384_58::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, F384PM::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B384_58::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_NUMS384W.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_NUMS384W.h
new file mode 100644
index 0000000..bc21c94
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_NUMS384W.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_NUMS384W_H
+#define ECP_NUMS384W_H
+
+#include "fp_F384PM.h"
+#include "config_curve_NUMS384W.h"
+
+using namespace core;
+
+namespace NUMS384W {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B384_58::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B384_58::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B384_58::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B384_58::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B384_58::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B384_58::BIG CURVE_Ad;
+extern const B384_58::BIG CURVE_Bd;
+extern const B384_58::BIG PC[];
+
+extern const B384_58::BIG CURVE_Adr;
+extern const B384_58::BIG CURVE_Adi;
+extern const B384_58::BIG CURVE_Bdr;
+extern const B384_58::BIG CURVE_Bdi;
+extern const B384_58::BIG PCR[];
+extern const B384_58::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B384_58::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B384_58::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B384_58::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B384_58::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B384_58::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B384_58::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B384_58::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B384_58::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B384_58::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B384_58::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B384_58::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B384_58::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B384_58::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B384_58::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    F384PM::FP x; /**< x-coordinate of point */
+#if CURVETYPE_NUMS384W!=MONTGOMERY
+    F384PM::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    F384PM::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(F384PM::FP *r, F384PM::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B384_58::BIG x, int s);
+
+#if CURVETYPE_NUMS384W==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B384_58::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B384_58::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B384_58::BIG x, B384_58::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B384_58::BIG x, B384_58::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B384_58::BIG e, B384_58::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B384_58::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B384_58::BIG e, B384_58::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B384_58::BIG e, B384_58::BIG f, B384_58::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B384_58::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, F384PM::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B384_58::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_NUMS512E.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_NUMS512E.h
new file mode 100644
index 0000000..3a4bf5f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_NUMS512E.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_NUMS512E_H
+#define ECP_NUMS512E_H
+
+#include "fp_F512PM.h"
+#include "config_curve_NUMS512E.h"
+
+using namespace core;
+
+namespace NUMS512E {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B512_60::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B512_60::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B512_60::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B512_60::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B512_60::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B512_60::BIG CURVE_Ad;
+extern const B512_60::BIG CURVE_Bd;
+extern const B512_60::BIG PC[];
+
+extern const B512_60::BIG CURVE_Adr;
+extern const B512_60::BIG CURVE_Adi;
+extern const B512_60::BIG CURVE_Bdr;
+extern const B512_60::BIG CURVE_Bdi;
+extern const B512_60::BIG PCR[];
+extern const B512_60::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B512_60::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B512_60::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B512_60::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B512_60::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B512_60::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B512_60::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B512_60::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B512_60::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B512_60::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B512_60::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B512_60::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B512_60::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B512_60::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    F512PM::FP x; /**< x-coordinate of point */
+#if CURVETYPE_NUMS512E!=MONTGOMERY
+    F512PM::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    F512PM::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(F512PM::FP *r, F512PM::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B512_60::BIG x, int s);
+
+#if CURVETYPE_NUMS512E==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B512_60::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B512_60::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B512_60::BIG x, B512_60::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B512_60::BIG x, B512_60::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B512_60::BIG e, B512_60::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B512_60::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B512_60::BIG e, B512_60::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B512_60::BIG e, B512_60::BIG f, B512_60::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B512_60::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, F512PM::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B512_60::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_NUMS512W.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_NUMS512W.h
new file mode 100644
index 0000000..c6ba6d8
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_NUMS512W.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_NUMS512W_H
+#define ECP_NUMS512W_H
+
+#include "fp_F512PM.h"
+#include "config_curve_NUMS512W.h"
+
+using namespace core;
+
+namespace NUMS512W {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B512_60::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B512_60::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B512_60::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B512_60::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B512_60::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B512_60::BIG CURVE_Ad;
+extern const B512_60::BIG CURVE_Bd;
+extern const B512_60::BIG PC[];
+
+extern const B512_60::BIG CURVE_Adr;
+extern const B512_60::BIG CURVE_Adi;
+extern const B512_60::BIG CURVE_Bdr;
+extern const B512_60::BIG CURVE_Bdi;
+extern const B512_60::BIG PCR[];
+extern const B512_60::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B512_60::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B512_60::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B512_60::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B512_60::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B512_60::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B512_60::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B512_60::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B512_60::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B512_60::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B512_60::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B512_60::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B512_60::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B512_60::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B512_60::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    F512PM::FP x; /**< x-coordinate of point */
+#if CURVETYPE_NUMS512W!=MONTGOMERY
+    F512PM::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    F512PM::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(F512PM::FP *r, F512PM::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B512_60::BIG x, int s);
+
+#if CURVETYPE_NUMS512W==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B512_60::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B512_60::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B512_60::BIG x, B512_60::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B512_60::BIG x, B512_60::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B512_60::BIG e, B512_60::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B512_60::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B512_60::BIG e, B512_60::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B512_60::BIG e, B512_60::BIG f, B512_60::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B512_60::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, F512PM::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B512_60::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_SECP160R1.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_SECP160R1.h
new file mode 100644
index 0000000..a404322
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_SECP160R1.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_SECP160R1_H
+#define ECP_SECP160R1_H
+
+#include "fp_SECP160R1.h"
+#include "config_curve_SECP160R1.h"
+
+using namespace core;
+
+namespace SECP160R1 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B160_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B160_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B160_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B160_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B160_56::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B160_56::BIG CURVE_Ad;
+extern const B160_56::BIG CURVE_Bd;
+extern const B160_56::BIG PC[];
+
+extern const B160_56::BIG CURVE_Adr;
+extern const B160_56::BIG CURVE_Adi;
+extern const B160_56::BIG CURVE_Bdr;
+extern const B160_56::BIG CURVE_Bdi;
+extern const B160_56::BIG PCR[];
+extern const B160_56::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B160_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B160_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B160_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B160_56::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B160_56::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B160_56::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B160_56::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B160_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B160_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B160_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B160_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B160_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B160_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B160_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    SECP160R1::FP x; /**< x-coordinate of point */
+#if CURVETYPE_SECP160R1!=MONTGOMERY
+    SECP160R1::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    SECP160R1::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(SECP160R1::FP *r, SECP160R1::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B160_56::BIG x, int s);
+
+#if CURVETYPE_SECP160R1==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B160_56::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B160_56::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B160_56::BIG x, B160_56::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B160_56::BIG x, B160_56::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B160_56::BIG e, B160_56::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B160_56::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B160_56::BIG e, B160_56::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B160_56::BIG e, B160_56::BIG f, B160_56::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B160_56::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, SECP160R1::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B160_56::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_SECP256K1.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_SECP256K1.h
new file mode 100644
index 0000000..84e9ce7
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_SECP256K1.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_SECP256K1_H
+#define ECP_SECP256K1_H
+
+#include "fp_SECP256K1.h"
+#include "config_curve_SECP256K1.h"
+
+using namespace core;
+
+namespace SECP256K1 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B256_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B256_56::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B256_56::BIG CURVE_Ad;
+extern const B256_56::BIG CURVE_Bd;
+extern const B256_56::BIG PC[];
+
+extern const B256_56::BIG CURVE_Adr;
+extern const B256_56::BIG CURVE_Adi;
+extern const B256_56::BIG CURVE_Bdr;
+extern const B256_56::BIG CURVE_Bdi;
+extern const B256_56::BIG PCR[];
+extern const B256_56::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B256_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B256_56::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B256_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B256_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B256_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    SECP256K1::FP x; /**< x-coordinate of point */
+#if CURVETYPE_SECP256K1!=MONTGOMERY
+    SECP256K1::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    SECP256K1::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(SECP256K1::FP *r, SECP256K1::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B256_56::BIG x, int s);
+
+#if CURVETYPE_SECP256K1==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B256_56::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x, B256_56::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B256_56::BIG x, B256_56::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B256_56::BIG e, B256_56::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B256_56::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f, B256_56::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B256_56::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, SECP256K1::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B256_56::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_SM2.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_SM2.h
new file mode 100644
index 0000000..3f2a35a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_SM2.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_SM2_H
+#define ECP_SM2_H
+
+#include "fp_SM2.h"
+#include "config_curve_SM2.h"
+
+using namespace core;
+
+namespace SM2 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B256_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B256_56::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B256_56::BIG CURVE_Ad;
+extern const B256_56::BIG CURVE_Bd;
+extern const B256_56::BIG PC[];
+
+extern const B256_56::BIG CURVE_Adr;
+extern const B256_56::BIG CURVE_Adi;
+extern const B256_56::BIG CURVE_Bdr;
+extern const B256_56::BIG CURVE_Bdi;
+extern const B256_56::BIG PCR[];
+extern const B256_56::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B256_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B256_56::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B256_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B256_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B256_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    SM2::FP x; /**< x-coordinate of point */
+#if CURVETYPE_SM2!=MONTGOMERY
+    SM2::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    SM2::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(SM2::FP *r, SM2::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B256_56::BIG x, int s);
+
+#if CURVETYPE_SM2==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B256_56::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x, B256_56::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B256_56::BIG x, B256_56::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B256_56::BIG e, B256_56::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B256_56::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f, B256_56::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B256_56::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, SM2::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B256_56::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_TWEEDLEDEE.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_TWEEDLEDEE.h
new file mode 100644
index 0000000..9ca458a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_TWEEDLEDEE.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_TWEEDLEDEE_H
+#define ECP_TWEEDLEDEE_H
+
+#include "fp_TWEEDLEDEE.h"
+#include "config_curve_TWEEDLEDEE.h"
+
+using namespace core;
+
+namespace TWEEDLEDEE {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B256_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B256_56::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B256_56::BIG CURVE_Ad;
+extern const B256_56::BIG CURVE_Bd;
+extern const B256_56::BIG PC[];
+
+extern const B256_56::BIG CURVE_Adr;
+extern const B256_56::BIG CURVE_Adi;
+extern const B256_56::BIG CURVE_Bdr;
+extern const B256_56::BIG CURVE_Bdi;
+extern const B256_56::BIG PCR[];
+extern const B256_56::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B256_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B256_56::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B256_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B256_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B256_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    TWEEDLEDEE::FP x; /**< x-coordinate of point */
+#if CURVETYPE_TWEEDLEDEE!=MONTGOMERY
+    TWEEDLEDEE::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    TWEEDLEDEE::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(TWEEDLEDEE::FP *r, TWEEDLEDEE::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B256_56::BIG x, int s);
+
+#if CURVETYPE_TWEEDLEDEE==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B256_56::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x, B256_56::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B256_56::BIG x, B256_56::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B256_56::BIG e, B256_56::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B256_56::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f, B256_56::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B256_56::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, TWEEDLEDEE::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B256_56::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_TWEEDLEDUM.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_TWEEDLEDUM.h
new file mode 100644
index 0000000..49010a3
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_TWEEDLEDUM.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_TWEEDLEDUM_H
+#define ECP_TWEEDLEDUM_H
+
+#include "fp_TWEEDLEDUM.h"
+#include "config_curve_TWEEDLEDUM.h"
+
+using namespace core;
+
+namespace TWEEDLEDUM {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B256_56::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B256_56::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B256_56::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B256_56::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B256_56::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B256_56::BIG CURVE_Ad;
+extern const B256_56::BIG CURVE_Bd;
+extern const B256_56::BIG PC[];
+
+extern const B256_56::BIG CURVE_Adr;
+extern const B256_56::BIG CURVE_Adi;
+extern const B256_56::BIG CURVE_Bdr;
+extern const B256_56::BIG CURVE_Bdi;
+extern const B256_56::BIG PCR[];
+extern const B256_56::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B256_56::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B256_56::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B256_56::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B256_56::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B256_56::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B256_56::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B256_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B256_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B256_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    TWEEDLEDUM::FP x; /**< x-coordinate of point */
+#if CURVETYPE_TWEEDLEDUM!=MONTGOMERY
+    TWEEDLEDUM::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    TWEEDLEDUM::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(TWEEDLEDUM::FP *r, TWEEDLEDUM::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B256_56::BIG x, int s);
+
+#if CURVETYPE_TWEEDLEDUM==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B256_56::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B256_56::BIG x, B256_56::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B256_56::BIG x, B256_56::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B256_56::BIG e, B256_56::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B256_56::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B256_56::BIG e, B256_56::BIG f, B256_56::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B256_56::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, TWEEDLEDUM::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B256_56::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_X448.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_X448.h
new file mode 100644
index 0000000..03a7fe5
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ecp_X448.h
@@ -0,0 +1,372 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef ECP_X448_H
+#define ECP_X448_H
+
+#include "fp_F448.h"
+#include "config_curve_X448.h"
+
+using namespace core;
+
+namespace X448 {
+
+/* Curve Params - see rom*.cpp */
+extern const int CURVE_B_I;
+extern const int CURVE_Cof_I;
+extern const B448_58::BIG CURVE_B;     /**< Elliptic curve B parameter */
+extern const B448_58::BIG CURVE_Order; /**< Elliptic curve group order */
+extern const B448_58::BIG CURVE_Cof;   /**< Elliptic curve cofactor */
+extern const B448_58::BIG CURVE_HTPC;  /**< Hash to Point precomputation */
+extern const B448_58::BIG CURVE_HTPC2;  /**< Hash to Point precomputation for G2 */
+
+extern const B448_58::BIG CURVE_Ad;
+extern const B448_58::BIG CURVE_Bd;
+extern const B448_58::BIG PC[];
+
+extern const B448_58::BIG CURVE_Adr;
+extern const B448_58::BIG CURVE_Adi;
+extern const B448_58::BIG CURVE_Bdr;
+extern const B448_58::BIG CURVE_Bdi;
+extern const B448_58::BIG PCR[];
+extern const B448_58::BIG PCI[];
+
+/* Generator point on G1 */
+extern const B448_58::BIG CURVE_Gx; /**< x-coordinate of generator point in group G1  */
+extern const B448_58::BIG CURVE_Gy; /**< y-coordinate of generator point in group G1  */
+
+
+/* For Pairings only */
+
+/* Generator point on G2 */
+extern const B448_58::BIG CURVE_Pxa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pxb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pya; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pyb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS24 curves ***/
+
+extern const B448_58::BIG CURVE_Pxaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pxab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pxba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pxbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pyaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pyab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pyba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pybb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+/*** needed for BLS48 curves ***/
+
+extern const B448_58::BIG CURVE_Pxaaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pxaab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pxaba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pxabb; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pxbaa; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pxbab; /**< imaginary part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pxbba; /**< real part of x-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pxbbb; /**< imaginary part of x-coordinate of generator point in group G2 */
+
+extern const B448_58::BIG CURVE_Pyaaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pyaab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pyaba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pyabb; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pybaa; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pybab; /**< imaginary part of y-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pybba; /**< real part of y-coordinate of generator point in group G2 */
+extern const B448_58::BIG CURVE_Pybbb; /**< imaginary part of y-coordinate of generator point in group G2 */
+
+
+
+extern const B448_58::BIG CURVE_Bnx; /**< BN curve x parameter */
+
+
+
+extern const B448_58::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B448_58::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+
+extern const B448_58::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B448_58::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B448_58::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B448_58::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+
+/**
+	@brief ECP structure - Elliptic Curve Point over base field
+*/
+
+typedef struct
+{
+//    int inf; /**< Infinity Flag - not needed for Edwards representation */
+
+    F448::FP x; /**< x-coordinate of point */
+#if CURVETYPE_X448!=MONTGOMERY
+    F448::FP y; /**< y-coordinate of point. Not needed for Montgomery representation */
+#endif
+    F448::FP z;/**< z-coordinate of point */
+} ECP;
+
+
+/* ECP E(Fp) prototypes */
+/**	@brief Tests for ECP point equal to infinity
+ *
+	@param P ECP point to be tested
+	@return 1 if infinity, else returns 0
+ */
+extern int ECP_isinf(ECP *P);
+/**	@brief Tests for equality of two ECPs
+ *
+	@param P ECP instance to be compared
+	@param Q ECP instance to be compared
+	@return 1 if P=Q, else returns 0
+ */
+extern int ECP_equals(ECP *P, ECP *Q);
+/**	@brief Copy ECP point to another ECP point
+ *
+	@param P ECP instance, on exit = Q
+	@param Q ECP instance to be copied
+ */
+extern void ECP_copy(ECP *P, ECP *Q);
+/**	@brief Negation of an ECP point
+ *
+	@param P ECP instance, on exit = -P
+ */
+extern void ECP_neg(ECP *P);
+/**	@brief Set ECP to point-at-infinity
+ *
+	@param P ECP instance to be set to infinity
+ */
+extern void ECP_inf(ECP *P);
+/**	@brief Calculate Right Hand Side of curve equation y^2=f(x)
+ *
+	Function f(x) depends on form of elliptic curve, Weierstrass, Edwards or Montgomery.
+	Used internally.
+	@param r BIG n-residue value of f(x)
+	@param x BIG n-residue x
+ */
+extern void ECP_rhs(F448::FP *r, F448::FP *x);
+/**	@brief Set ECP to point(x,y) given just x and sign of y
+ *
+	Point P set to infinity if no such point on the curve. If x is on the curve then y is calculated from the curve equation.
+	The correct y value (plus or minus) is selected given its sign s.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@param s an integer representing the "sign" of y, in fact its least significant bit.
+ */
+extern int ECP_setx(ECP *P, B448_58::BIG x, int s);
+
+#if CURVETYPE_X448==MONTGOMERY
+/**	@brief Set ECP to point(x,[y]) given x
+ *
+	Point P set to infinity if no such point on the curve. Note that y coordinate is not needed.
+	@param P ECP instance to be set (x,[y])
+	@param x BIG x coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B448_58::BIG x);
+/**	@brief Extract x coordinate of an ECP point P
+ *
+	@param x BIG on exit = x coordinate of point
+	@param P ECP instance (x,[y])
+	@return -1 if P is point-at-infinity, else 0
+ */
+extern int ECP_get(B448_58::BIG x, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P, given difference D=P-Q
+ *
+	Differential addition of points on a Montgomery curve
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+	@param D Difference between P and Q
+ */
+extern void ECP_add(ECP *P, ECP *Q, ECP *D);
+#else
+/**	@brief Set ECP to point(x,y) given x and y
+ *
+	Point P set to infinity if no such point on the curve.
+	@param P ECP instance to be set (x,y)
+	@param x BIG x coordinate of point
+	@param y BIG y coordinate of point
+	@return 1 if point exists, else 0
+ */
+extern int ECP_set(ECP *P, B448_58::BIG x, B448_58::BIG y);
+/**	@brief Extract x and y coordinates of an ECP point P
+ *
+	If x=y, returns only x
+	@param x BIG on exit = x coordinate of point
+	@param y BIG on exit = y coordinate of point (unless x=y)
+	@param P ECP instance (x,y)
+	@return sign of y, or -1 if P is point-at-infinity
+ */
+extern int ECP_get(B448_58::BIG x, B448_58::BIG y, ECP *P);
+/**	@brief Adds ECP instance Q to ECP instance P
+ *
+	@param P ECP instance, on exit =P+Q
+	@param Q ECP instance to be added to P
+ */
+extern void ECP_add(ECP *P, ECP *Q);
+/**	@brief Subtracts ECP instance Q from ECP instance P
+ *
+	@param P ECP instance, on exit =P-Q
+	@param Q ECP instance to be subtracted from P
+ */
+extern void ECP_sub(ECP *P, ECP *Q);
+#endif
+/**	@brief Converts an ECP point from Projective (x,y,z) coordinates to affine (x,y) coordinates
+ *
+	@param P ECP instance to be converted to affine form
+ */
+extern void ECP_affine(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, in projective coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_outputxyz(ECP *P);
+/**	@brief Formats and outputs an ECP point to the console, converted to affine coordinates
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_output(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to the console
+ *
+	@param P ECP instance to be printed
+ */
+extern void ECP_rawoutput(ECP * P);
+
+/**	@brief Formats and outputs an ECP point to an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If c is true, only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param c compression required, true or false
+	@param S output octet string
+	@param P ECP instance to be converted to an octet string
+ */
+extern void ECP_toOctet(octet *S, ECP *P, bool c);
+/**	@brief Creates an ECP point from an octet string
+ *
+	The octet string is normally in the standard form 0x04|x|y
+	Here x (and y) are the x and y coordinates in left justified big-endian base 256 form.
+	For Montgomery curve it is 0x06|x
+	If in compressed form only the x coordinate is provided as in 0x2|x if y is even, or 0x3|x if y is odd
+	@param P ECP instance to be created from the octet string
+	@param S input octet string
+    @param c true for compression
+	return 1 if octet string corresponds to a point on the curve, else 0
+ */
+extern int ECP_fromOctet(ECP *P, octet *S);
+/**	@brief Doubles an ECP instance P
+ *
+	@param P ECP instance, on exit =2*P
+ */
+extern void ECP_dbl(ECP *P);
+/**	@brief Multiplies an ECP instance P by a small integer, side-channel resistant
+ *
+	@param P ECP instance, on exit =i*P
+	@param i small integer multiplier
+	@param b maximum number of bits in multiplier
+ */
+extern void ECP_pinmul(ECP *P, int i, int b);
+
+/**	@brief Multiplies an ECP instance P by a BIG, side-channel resistant
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param e BIG number multiplier
+    @param maxe maximum e
+
+ */
+extern void ECP_clmul(ECP *P, B448_58::BIG e, B448_58::BIG maxe);
+
+/**	@brief Multiplies an ECP instance P by a BIG
+ *
+	Uses Montgomery ladder for Montgomery curves, otherwise fixed sized windows.
+	@param P ECP instance, on exit =b*P
+	@param b BIG number multiplier
+
+ */
+extern void ECP_mul(ECP *P, B448_58::BIG b);
+/**	@brief Calculates double multiplication P=e*P+f*Q
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+ */
+extern void ECP_mul2(ECP *P, ECP *Q, B448_58::BIG e, B448_58::BIG f);
+
+/**	@brief Calculates double multiplication P=e*P+f*Q, side-channel resistant
+ *
+	@param P ECP instance, on exit =e*P+f*Q
+	@param Q ECP instance
+	@param e BIG number multiplier
+	@param f BIG number multiplier
+    @param maxe maximum multiplier
+ */
+extern void ECP_clmul2(ECP *P, ECP *Q, B448_58::BIG e, B448_58::BIG f, B448_58::BIG maxe);
+
+
+/**	@brief Calculates multi-multiplication P=Sigma e_i*X_i, side-channel resistant
+ *
+	@param P ECP instance, on exit = Sigma e_i*X_i
+    @param n Number of multiplications
+	@param X array of n ECPs
+	@param e array of n BIG multipliers
+ */
+extern void ECP_muln(ECP *P,int n,ECP X[],B448_58::BIG e[]);
+
+/**	@brief Multiplies random point by co-factor
+ *
+	@param Q ECP multiplied by co-factor
+ */
+extern void ECP_cfp(ECP *Q);
+
+/**	@brief Maps random FP to curve point in constant time
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_map2point(ECP *Q, F448::FP *x);
+
+/**	@brief Maps random BIG to curve point using hunt-and-peck
+ *
+	@param Q ECP instance 
+	@param x Fp derived from hash
+ */
+extern void ECP_hap2point(ECP *Q, B448_58::BIG  x);
+
+
+/**	@brief Maps random octet to curve point of correct order
+ *
+	@param Q ECP instance of correct order
+	@param w OCTET byte array to be mapped
+ */
+extern void ECP_mapit(ECP *Q, octet *w);
+
+/**	@brief Get Group Generator from ROM
+ *
+	@param G ECP instance
+    @return true or false
+ */
+extern int ECP_generator(ECP *G);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa.h
new file mode 100644
index 0000000..a7cb9ab
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_ZZZ_H
+#define EDDSA_ZZZ_H
+
+#include "ecp_ZZZ.h"
+
+using namespace core;
+
+#define EGS_ZZZ MODBYTES_XXX  /**< ECC Group Size in bytes */
+#define EFS_ZZZ MODBYTES_XXX  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace ZZZ {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_ANSSI.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_ANSSI.h
new file mode 100644
index 0000000..45c185b
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_ANSSI.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_ANSSI_H
+#define EDDSA_ANSSI_H
+
+#include "ecp_ANSSI.h"
+
+using namespace core;
+
+#define EGS_ANSSI MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_ANSSI MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace ANSSI {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_BLS12381.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_BLS12381.h
new file mode 100644
index 0000000..369c93c
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_BLS12381.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_BLS12381_H
+#define EDDSA_BLS12381_H
+
+#include "ecp_BLS12381.h"
+
+using namespace core;
+
+#define EGS_BLS12381 MODBYTES_B384_58  /**< ECC Group Size in bytes */
+#define EFS_BLS12381 MODBYTES_B384_58  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace BLS12381 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_BLS12383.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_BLS12383.h
new file mode 100644
index 0000000..eb750e6
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_BLS12383.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_BLS12383_H
+#define EDDSA_BLS12383_H
+
+#include "ecp_BLS12383.h"
+
+using namespace core;
+
+#define EGS_BLS12383 MODBYTES_B384_58  /**< ECC Group Size in bytes */
+#define EFS_BLS12383 MODBYTES_B384_58  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace BLS12383 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_BLS12443.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_BLS12443.h
new file mode 100644
index 0000000..939d219
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_BLS12443.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_BLS12443_H
+#define EDDSA_BLS12443_H
+
+#include "ecp_BLS12443.h"
+
+using namespace core;
+
+#define EGS_BLS12443 MODBYTES_B448_60  /**< ECC Group Size in bytes */
+#define EFS_BLS12443 MODBYTES_B448_60  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace BLS12443 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_BLS12461.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_BLS12461.h
new file mode 100644
index 0000000..7297528
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_BLS12461.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_BLS12461_H
+#define EDDSA_BLS12461_H
+
+#include "ecp_BLS12461.h"
+
+using namespace core;
+
+#define EGS_BLS12461 MODBYTES_B464_60  /**< ECC Group Size in bytes */
+#define EFS_BLS12461 MODBYTES_B464_60  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace BLS12461 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_BLS24479.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_BLS24479.h
new file mode 100644
index 0000000..295d906
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_BLS24479.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_BLS24479_H
+#define EDDSA_BLS24479_H
+
+#include "ecp_BLS24479.h"
+
+using namespace core;
+
+#define EGS_BLS24479 MODBYTES_B480_56  /**< ECC Group Size in bytes */
+#define EFS_BLS24479 MODBYTES_B480_56  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace BLS24479 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_BLS48286.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_BLS48286.h
new file mode 100644
index 0000000..0a5b8c8
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_BLS48286.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_BLS48286_H
+#define EDDSA_BLS48286_H
+
+#include "ecp_BLS48286.h"
+
+using namespace core;
+
+#define EGS_BLS48286 MODBYTES_B288_60  /**< ECC Group Size in bytes */
+#define EFS_BLS48286 MODBYTES_B288_60  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace BLS48286 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_BLS48556.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_BLS48556.h
new file mode 100644
index 0000000..f67768b
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_BLS48556.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_BLS48556_H
+#define EDDSA_BLS48556_H
+
+#include "ecp_BLS48556.h"
+
+using namespace core;
+
+#define EGS_BLS48556 MODBYTES_B560_58  /**< ECC Group Size in bytes */
+#define EFS_BLS48556 MODBYTES_B560_58  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace BLS48556 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_BLS48581.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_BLS48581.h
new file mode 100644
index 0000000..ded8a7f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_BLS48581.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_BLS48581_H
+#define EDDSA_BLS48581_H
+
+#include "ecp_BLS48581.h"
+
+using namespace core;
+
+#define EGS_BLS48581 MODBYTES_B584_60  /**< ECC Group Size in bytes */
+#define EFS_BLS48581 MODBYTES_B584_60  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace BLS48581 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_BN158.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_BN158.h
new file mode 100644
index 0000000..fc83be9
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_BN158.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_BN158_H
+#define EDDSA_BN158_H
+
+#include "ecp_BN158.h"
+
+using namespace core;
+
+#define EGS_BN158 MODBYTES_B160_56  /**< ECC Group Size in bytes */
+#define EFS_BN158 MODBYTES_B160_56  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace BN158 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_BN254.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_BN254.h
new file mode 100644
index 0000000..ef2f6ad
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_BN254.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_BN254_H
+#define EDDSA_BN254_H
+
+#include "ecp_BN254.h"
+
+using namespace core;
+
+#define EGS_BN254 MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_BN254 MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace BN254 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_BN254CX.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_BN254CX.h
new file mode 100644
index 0000000..cf12594
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_BN254CX.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_BN254CX_H
+#define EDDSA_BN254CX_H
+
+#include "ecp_BN254CX.h"
+
+using namespace core;
+
+#define EGS_BN254CX MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_BN254CX MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace BN254CX {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_BN462.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_BN462.h
new file mode 100644
index 0000000..e6db4ff
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_BN462.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_BN462_H
+#define EDDSA_BN462_H
+
+#include "ecp_BN462.h"
+
+using namespace core;
+
+#define EGS_BN462 MODBYTES_B464_60  /**< ECC Group Size in bytes */
+#define EFS_BN462 MODBYTES_B464_60  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace BN462 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_BRAINPOOL.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_BRAINPOOL.h
new file mode 100644
index 0000000..55caaf1
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_BRAINPOOL.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_BRAINPOOL_H
+#define EDDSA_BRAINPOOL_H
+
+#include "ecp_BRAINPOOL.h"
+
+using namespace core;
+
+#define EGS_BRAINPOOL MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_BRAINPOOL MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace BRAINPOOL {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_C1174.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_C1174.h
new file mode 100644
index 0000000..dab2efd
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_C1174.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_C1174_H
+#define EDDSA_C1174_H
+
+#include "ecp_C1174.h"
+
+using namespace core;
+
+#define EGS_C1174 MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_C1174 MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace C1174 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_C13318.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_C13318.h
new file mode 100644
index 0000000..0865795
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_C13318.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_C13318_H
+#define EDDSA_C13318_H
+
+#include "ecp_C13318.h"
+
+using namespace core;
+
+#define EGS_C13318 MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_C13318 MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace C13318 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_C1665.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_C1665.h
new file mode 100644
index 0000000..e505f45
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_C1665.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_C1665_H
+#define EDDSA_C1665_H
+
+#include "ecp_C1665.h"
+
+using namespace core;
+
+#define EGS_C1665 MODBYTES_B168_60  /**< ECC Group Size in bytes */
+#define EFS_C1665 MODBYTES_B168_60  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace C1665 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_C25519.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_C25519.h
new file mode 100644
index 0000000..37fda37
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_C25519.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_C25519_H
+#define EDDSA_C25519_H
+
+#include "ecp_C25519.h"
+
+using namespace core;
+
+#define EGS_C25519 MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_C25519 MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace C25519 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_C41417.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_C41417.h
new file mode 100644
index 0000000..ad30290
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_C41417.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_C41417_H
+#define EDDSA_C41417_H
+
+#include "ecp_C41417.h"
+
+using namespace core;
+
+#define EGS_C41417 MODBYTES_B416_60  /**< ECC Group Size in bytes */
+#define EFS_C41417 MODBYTES_B416_60  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace C41417 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_Ed25519.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_Ed25519.h
new file mode 100644
index 0000000..4563647
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_Ed25519.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_Ed25519_H
+#define EDDSA_Ed25519_H
+
+#include "ecp_Ed25519.h"
+
+using namespace core;
+
+#define EGS_Ed25519 MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_Ed25519 MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace Ed25519 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_Ed448.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_Ed448.h
new file mode 100644
index 0000000..0e45f81
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_Ed448.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_Ed448_H
+#define EDDSA_Ed448_H
+
+#include "ecp_Ed448.h"
+
+using namespace core;
+
+#define EGS_Ed448 MODBYTES_B448_58  /**< ECC Group Size in bytes */
+#define EFS_Ed448 MODBYTES_B448_58  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace Ed448 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_FP256BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_FP256BN.h
new file mode 100644
index 0000000..53b2310
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_FP256BN.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_FP256BN_H
+#define EDDSA_FP256BN_H
+
+#include "ecp_FP256BN.h"
+
+using namespace core;
+
+#define EGS_FP256BN MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_FP256BN MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace FP256BN {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_FP512BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_FP512BN.h
new file mode 100644
index 0000000..3e45eef
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_FP512BN.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_FP512BN_H
+#define EDDSA_FP512BN_H
+
+#include "ecp_FP512BN.h"
+
+using namespace core;
+
+#define EGS_FP512BN MODBYTES_B512_60  /**< ECC Group Size in bytes */
+#define EFS_FP512BN MODBYTES_B512_60  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace FP512BN {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_HIFIVE.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_HIFIVE.h
new file mode 100644
index 0000000..fe9fda3
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_HIFIVE.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_HIFIVE_H
+#define EDDSA_HIFIVE_H
+
+#include "ecp_HIFIVE.h"
+
+using namespace core;
+
+#define EGS_HIFIVE MODBYTES_B336_60  /**< ECC Group Size in bytes */
+#define EFS_HIFIVE MODBYTES_B336_60  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace HIFIVE {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_JUBJUB.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_JUBJUB.h
new file mode 100644
index 0000000..29b8e0f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_JUBJUB.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_JUBJUB_H
+#define EDDSA_JUBJUB_H
+
+#include "ecp_JUBJUB.h"
+
+using namespace core;
+
+#define EGS_JUBJUB MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_JUBJUB MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace JUBJUB {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_MDC.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_MDC.h
new file mode 100644
index 0000000..1b55de8
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_MDC.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_MDC_H
+#define EDDSA_MDC_H
+
+#include "ecp_MDC.h"
+
+using namespace core;
+
+#define EGS_MDC MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_MDC MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace MDC {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_NIST256.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_NIST256.h
new file mode 100644
index 0000000..1cc9db7
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_NIST256.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_NIST256_H
+#define EDDSA_NIST256_H
+
+#include "ecp_NIST256.h"
+
+using namespace core;
+
+#define EGS_NIST256 MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_NIST256 MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace NIST256 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_NIST384.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_NIST384.h
new file mode 100644
index 0000000..a27b107
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_NIST384.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_NIST384_H
+#define EDDSA_NIST384_H
+
+#include "ecp_NIST384.h"
+
+using namespace core;
+
+#define EGS_NIST384 MODBYTES_B384_56  /**< ECC Group Size in bytes */
+#define EFS_NIST384 MODBYTES_B384_56  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace NIST384 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_NIST521.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_NIST521.h
new file mode 100644
index 0000000..4157d1a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_NIST521.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_NIST521_H
+#define EDDSA_NIST521_H
+
+#include "ecp_NIST521.h"
+
+using namespace core;
+
+#define EGS_NIST521 MODBYTES_B528_60  /**< ECC Group Size in bytes */
+#define EFS_NIST521 MODBYTES_B528_60  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace NIST521 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_NUMS256E.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_NUMS256E.h
new file mode 100644
index 0000000..a21c321
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_NUMS256E.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_NUMS256E_H
+#define EDDSA_NUMS256E_H
+
+#include "ecp_NUMS256E.h"
+
+using namespace core;
+
+#define EGS_NUMS256E MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_NUMS256E MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace NUMS256E {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_NUMS256W.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_NUMS256W.h
new file mode 100644
index 0000000..56dd3b5
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_NUMS256W.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_NUMS256W_H
+#define EDDSA_NUMS256W_H
+
+#include "ecp_NUMS256W.h"
+
+using namespace core;
+
+#define EGS_NUMS256W MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_NUMS256W MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace NUMS256W {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_NUMS384E.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_NUMS384E.h
new file mode 100644
index 0000000..e675376
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_NUMS384E.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_NUMS384E_H
+#define EDDSA_NUMS384E_H
+
+#include "ecp_NUMS384E.h"
+
+using namespace core;
+
+#define EGS_NUMS384E MODBYTES_B384_58  /**< ECC Group Size in bytes */
+#define EFS_NUMS384E MODBYTES_B384_58  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace NUMS384E {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_NUMS384W.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_NUMS384W.h
new file mode 100644
index 0000000..ac74813
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_NUMS384W.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_NUMS384W_H
+#define EDDSA_NUMS384W_H
+
+#include "ecp_NUMS384W.h"
+
+using namespace core;
+
+#define EGS_NUMS384W MODBYTES_B384_58  /**< ECC Group Size in bytes */
+#define EFS_NUMS384W MODBYTES_B384_58  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace NUMS384W {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_NUMS512E.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_NUMS512E.h
new file mode 100644
index 0000000..3925a33
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_NUMS512E.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_NUMS512E_H
+#define EDDSA_NUMS512E_H
+
+#include "ecp_NUMS512E.h"
+
+using namespace core;
+
+#define EGS_NUMS512E MODBYTES_B512_60  /**< ECC Group Size in bytes */
+#define EFS_NUMS512E MODBYTES_B512_60  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace NUMS512E {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_NUMS512W.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_NUMS512W.h
new file mode 100644
index 0000000..6a50c98
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_NUMS512W.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_NUMS512W_H
+#define EDDSA_NUMS512W_H
+
+#include "ecp_NUMS512W.h"
+
+using namespace core;
+
+#define EGS_NUMS512W MODBYTES_B512_60  /**< ECC Group Size in bytes */
+#define EFS_NUMS512W MODBYTES_B512_60  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace NUMS512W {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_SECP160R1.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_SECP160R1.h
new file mode 100644
index 0000000..0c2c372
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_SECP160R1.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_SECP160R1_H
+#define EDDSA_SECP160R1_H
+
+#include "ecp_SECP160R1.h"
+
+using namespace core;
+
+#define EGS_SECP160R1 MODBYTES_B160_56  /**< ECC Group Size in bytes */
+#define EFS_SECP160R1 MODBYTES_B160_56  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace SECP160R1 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_SECP256K1.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_SECP256K1.h
new file mode 100644
index 0000000..ff4a475
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_SECP256K1.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_SECP256K1_H
+#define EDDSA_SECP256K1_H
+
+#include "ecp_SECP256K1.h"
+
+using namespace core;
+
+#define EGS_SECP256K1 MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_SECP256K1 MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace SECP256K1 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_SM2.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_SM2.h
new file mode 100644
index 0000000..4b8dc7d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_SM2.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_SM2_H
+#define EDDSA_SM2_H
+
+#include "ecp_SM2.h"
+
+using namespace core;
+
+#define EGS_SM2 MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_SM2 MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace SM2 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_TWEEDLEDEE.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_TWEEDLEDEE.h
new file mode 100644
index 0000000..23e34d7
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_TWEEDLEDEE.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_TWEEDLEDEE_H
+#define EDDSA_TWEEDLEDEE_H
+
+#include "ecp_TWEEDLEDEE.h"
+
+using namespace core;
+
+#define EGS_TWEEDLEDEE MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_TWEEDLEDEE MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace TWEEDLEDEE {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_TWEEDLEDUM.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_TWEEDLEDUM.h
new file mode 100644
index 0000000..3d7e5b7
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_TWEEDLEDUM.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_TWEEDLEDUM_H
+#define EDDSA_TWEEDLEDUM_H
+
+#include "ecp_TWEEDLEDUM.h"
+
+using namespace core;
+
+#define EGS_TWEEDLEDUM MODBYTES_B256_56  /**< ECC Group Size in bytes */
+#define EFS_TWEEDLEDUM MODBYTES_B256_56  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace TWEEDLEDUM {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_X448.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_X448.h
new file mode 100644
index 0000000..ad0db71
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/eddsa_X448.h
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file eddsa.h
+ * @author Mike Scott
+ * @date 14th April 2023
+ * @brief EDDSA Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef EDDSA_X448_H
+#define EDDSA_X448_H
+
+#include "ecp_X448.h"
+
+using namespace core;
+
+#define EGS_X448 MODBYTES_B448_58  /**< ECC Group Size in bytes */
+#define EFS_X448 MODBYTES_B448_58  /**< ECC Field Size in bytes */
+
+#define EDDSA_OK                     0     /**< Function completed without error */
+#define EDDSA_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define EDDSA_ERROR                 -3	/**< ECDH Internal Error */
+
+namespace X448 {
+
+/* EDDSA primitives */
+/**	@brief Generate an ECC public/private key pair
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param D the private key, an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param Q the output public key, which is D.G, where G is a fixed generator
+	@return 0 or an error code
+ */
+extern int EDDSA_KEY_PAIR_GENERATE(csprng *R, octet *D, octet *Q);
+
+/**	@brief Generate signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param D the private key
+	@param context is an octet string (or NULL)
+	@param M is the message to be signed
+    @param SIG is the output signature
+	@return 0 or an error code
+ */
+extern int EDDSA_SIGNATURE(bool ph,octet *D, octet *context,octet *M,octet *SIG);
+
+/**	@brief Verify signature on a message
+ *
+    @param ph true for pre-hash version, default to false
+	@param Q the public key
+	@param context is an octet string (or NULL)
+	@param M is the signed message
+    @param SIG is the intput signature
+	@return true only if signature is good, else false
+ */
+extern bool EDDSA_VERIFY(bool ph,octet *Q,octet *context,octet *M,octet *SIG);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ff.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ff.h
new file mode 100644
index 0000000..8220fa0
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ff.h
@@ -0,0 +1,295 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FF_WWW_H
+#define FF_WWW_H
+
+#include "big_XXX.h"
+#include "config_ff_WWW.h"
+
+using namespace core;
+
+#define HFLEN_WWW (FFLEN_WWW/2) /**< Useful for half-size RSA private key operations */
+#define P_MBITS_WWW (MODBYTES_XXX*8)
+#define P_TBITS_WWW (P_MBITS_WWW%BASEBITS_XXX)
+#define P_EXCESS_WWW(a) (((a[NLEN_XXX-1])>>(P_TBITS_WWW))+1)
+#define P_FEXCESS_WWW ((chunk)1<<(BASEBITS_XXX*NLEN_XXX-P_MBITS_WWW-1))
+
+
+namespace WWW {
+
+/* Finite Field Prototypes */
+/**	@brief Copy one FF element of given length to another
+ *
+	@param x FF instance to be copied to, on exit = y
+	@param y FF instance to be copied from
+	@param n size of FF in BIGs
+
+ */
+extern void FF_copy(XXX::BIG *x, XXX::BIG *y, int n);
+/**	@brief Initialize an FF element of given length from a 32-bit integer m
+ *
+	@param x FF instance to be copied to, on exit = m
+	@param m integer
+	@param n size of FF in BIGs
+ */
+extern void FF_init(XXX::BIG *x, sign32 m, int n);
+/**	@brief Set FF element of given size to zero
+ *
+	@param x FF instance to be set to zero
+	@param n size of FF in BIGs
+ */
+extern void FF_zero(XXX::BIG *x, int n);
+/**	@brief Tests for FF element equal to zero
+ *
+	@param x FF number to be tested
+	@param n size of FF in BIGs
+	@return 1 if zero, else returns 0
+ */
+extern int FF_iszilch(XXX::BIG *x, int n);
+/**	@brief  return parity of an FF, that is the least significant bit
+ *
+	@param x FF number
+	@return 0 or 1
+ */
+extern int FF_parity(XXX::BIG *x);
+/**	@brief  return least significant m bits of an FF
+ *
+	@param x FF number
+	@param m number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int FF_lastbits(XXX::BIG *x, int m);
+/**	@brief Set FF element of given size to unity
+ *
+	@param x FF instance to be set to unity
+	@param n size of FF in BIGs
+ */
+extern void FF_one(XXX::BIG *x, int n);
+/**	@brief Compares two FF numbers. Inputs must be normalised externally
+ *
+	@param x first FF number to be compared
+	@param y second FF number to be compared
+	@param n size of FF in BIGs
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int FF_comp(XXX::BIG *x, XXX::BIG *y, int n);
+/**	@brief addition of two FFs
+ *
+	@param x FF instance, on exit = y+z
+	@param y FF instance
+	@param z FF instance
+	@param n size of FF in BIGs
+ */
+extern void FF_add(XXX::BIG *x, XXX::BIG *y, XXX::BIG *z, int n);
+/**	@brief subtraction of two FFs
+ *
+	@param x FF instance, on exit = y-z
+	@param y FF instance
+	@param z FF instance
+	@param n size of FF in BIGs
+ */
+extern void FF_sub(XXX::BIG *x, XXX::BIG *y, XXX::BIG *z, int n);
+/**	@brief increment an FF by an integer,and normalise
+ *
+	@param x FF instance, on exit = x+m
+	@param m an integer to be added to x
+	@param n size of FF in BIGs
+ */
+extern void FF_inc(XXX::BIG *x, int m, int n);
+/**	@brief Decrement an FF by an integer,and normalise
+ *
+	@param x FF instance, on exit = x-m
+	@param m an integer to be subtracted from x
+	@param n size of FF in BIGs
+ */
+extern void FF_dec(XXX::BIG *x, int m, int n);
+/**	@brief Normalises the components of an FF
+ *
+	@param x FF instance to be normalised
+	@param n size of FF in BIGs
+ */
+extern void FF_norm(XXX::BIG *x, int n);
+/**	@brief Shift left an FF by 1 bit
+ *
+	@param x FF instance to be shifted left
+	@param n size of FF in BIGs
+ */
+extern void FF_shl(XXX::BIG *x, int n);
+/**	@brief Shift right an FF by 1 bit
+ *
+	@param x FF instance to be shifted right
+	@param n size of FF in BIGs
+ */
+extern void FF_shr(XXX::BIG *x, int n);
+/**	@brief Formats and outputs an FF to the console
+ *
+	@param x FF instance to be printed
+	@param n size of FF in BIGs
+ */
+extern void FF_output(XXX::BIG *x, int n);
+/**	@brief Formats and outputs an FF to the console, in raw form
+ *
+ 	@param x FF instance to be printed
+ 	@param n size of FF in BIGs
+ */
+extern void FF_rawoutput(XXX::BIG *x, int n);
+/**	@brief Formats and outputs an FF instance to an octet string
+ *
+	Converts an FF to big-endian base 256 form.
+	@param S output octet string
+	@param x FF instance to be converted to an octet string
+	@param n size of FF in BIGs
+ */
+extern void FF_toOctet(octet *S, XXX::BIG *x, int n);
+/**	@brief Populates an FF instance from an octet string
+ *
+	Creates FF from big-endian base 256 form.
+	@param x FF instance to be created from an octet string
+	@param S input octet string
+	@param n size of FF in BIGs
+ */
+extern void FF_fromOctet(XXX::BIG *x, octet *S, int n);
+/**	@brief Multiplication of two FFs
+ *
+	Uses Karatsuba method internally
+	@param x FF instance, on exit = y*z
+	@param y FF instance
+	@param z FF instance
+	@param n size of FF in BIGs
+ */
+extern void FF_mul(XXX::BIG *x, XXX::BIG *y, XXX::BIG *z, int n);
+/**	@brief Reduce FF mod a modulus
+ *
+	This is slow
+	@param x FF instance to be reduced mod m - on exit = x mod m
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_mod(XXX::BIG *x, XXX::BIG *m, int n);
+/**	@brief Square an FF
+ *
+	Uses Karatsuba method internally
+	@param x FF instance, on exit = y^2
+	@param y FF instance to be squared
+	@param n size of FF in BIGs
+ */
+extern void FF_sqr(XXX::BIG *x, XXX::BIG *y, int n);
+/**	@brief Reduces a double-length FF with respect to a given modulus
+ *
+	This is slow
+	@param x FF instance, on exit = y mod z
+	@param y FF instance, of double length 2*n
+	@param z FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_dmod(XXX::BIG *x, XXX::BIG *y, XXX::BIG *z, int n);
+/**	@brief Invert an FF mod a prime modulus
+ *
+	@param x FF instance, on exit = 1/y mod z
+	@param y FF instance
+	@param z FF prime modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_invmodp(XXX::BIG *x, XXX::BIG *y, XXX::BIG *z, int n);
+/**	@brief Create an FF from a random number generator
+ *
+	@param x FF instance, on exit x is a random number of length n BIGs with most significant bit a 1
+	@param R an instance of a Cryptographically Secure Random Number Generator
+	@param n size of FF in BIGs
+ */
+extern void FF_random(XXX::BIG *x, csprng *R, int n);
+/**	@brief Create a random FF less than a given modulus from a random number generator
+ *
+	@param x FF instance, on exit x is a random number < y
+	@param y FF instance, the modulus
+	@param R an instance of a Cryptographically Secure Random Number Generator
+	@param n size of FF in BIGs
+ */
+extern void FF_randomnum(XXX::BIG *x, XXX::BIG *y, csprng *R, int n);
+/**	@brief Calculate r=x^e mod m, side channel resistant
+ *
+	@param r FF instance, on exit = x^e mod p
+	@param x FF instance
+	@param e FF exponent
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_skpow(XXX::BIG *r, XXX::BIG *x, XXX::BIG * e, XXX::BIG *m, int n);
+/**	@brief Calculate r=x^e mod m, side channel resistant
+ *
+	For short BIG exponent
+	@param r FF instance, on exit = x^e mod p
+	@param x FF instance
+	@param e BIG exponent
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_skspow(XXX::BIG *r, XXX::BIG *x, XXX::BIG e, XXX::BIG *m, int n);
+/**	@brief Calculate r=x^e mod m
+ *
+	For very short integer exponent
+	@param r FF instance, on exit = x^e mod p
+	@param x FF instance
+	@param e integer exponent
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_power(XXX::BIG *r, XXX::BIG *x, int e, XXX::BIG *m, int n);
+/**	@brief Calculate r=x^e mod m
+ *
+	@param r FF instance, on exit = x^e mod p
+	@param x FF instance
+	@param e FF exponent
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_pow(XXX::BIG *r, XXX::BIG *x, XXX::BIG *e, XXX::BIG *m, int n);
+/**	@brief Test if an FF has factor in common with integer s
+ *
+	@param x FF instance to be tested
+	@param s the supplied integer
+	@param n size of FF in BIGs
+	@return 1 if gcd(x,s)!=1, else return 0
+ */
+extern int FF_cfactor(XXX::BIG *x, sign32 s, int n);
+/**	@brief Test if an FF is prime
+ *
+	Uses Miller-Rabin Method
+	@param x FF instance to be tested
+	@param R an instance of a Cryptographically Secure Random Number Generator
+	@param n size of FF in BIGs
+	@return 1 if x is (almost certainly) prime, else return 0
+ */
+extern int FF_prime(XXX::BIG *x, csprng *R, int n);
+/**	@brief Calculate r=x^e.y^f mod m
+ *
+	@param r FF instance, on exit = x^e.y^f mod p
+	@param x FF instance
+	@param e BIG exponent
+	@param y FF instance
+	@param f BIG exponent
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_pow2(XXX::BIG *r, XXX::BIG *x, XXX::BIG e, XXX::BIG *y, XXX::BIG f, XXX::BIG *m, int n);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ff_RSA2048.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ff_RSA2048.h
new file mode 100644
index 0000000..c700bea
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ff_RSA2048.h
@@ -0,0 +1,295 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FF_RSA2048_H
+#define FF_RSA2048_H
+
+#include "big_B512_60.h"
+#include "config_ff_RSA2048.h"
+
+using namespace core;
+
+#define HFLEN_RSA2048 (FFLEN_RSA2048/2) /**< Useful for half-size RSA private key operations */
+#define P_MBITS_RSA2048 (MODBYTES_B512_60*8)
+#define P_TBITS_RSA2048 (P_MBITS_RSA2048%BASEBITS_B512_60)
+#define P_EXCESS_RSA2048(a) (((a[NLEN_B512_60-1])>>(P_TBITS_RSA2048))+1)
+#define P_FEXCESS_RSA2048 ((chunk)1<<(BASEBITS_B512_60*NLEN_B512_60-P_MBITS_RSA2048-1))
+
+
+namespace RSA2048 {
+
+/* Finite Field Prototypes */
+/**	@brief Copy one FF element of given length to another
+ *
+	@param x FF instance to be copied to, on exit = y
+	@param y FF instance to be copied from
+	@param n size of FF in BIGs
+
+ */
+extern void FF_copy(B512_60::BIG *x, B512_60::BIG *y, int n);
+/**	@brief Initialize an FF element of given length from a 32-bit integer m
+ *
+	@param x FF instance to be copied to, on exit = m
+	@param m integer
+	@param n size of FF in BIGs
+ */
+extern void FF_init(B512_60::BIG *x, sign32 m, int n);
+/**	@brief Set FF element of given size to zero
+ *
+	@param x FF instance to be set to zero
+	@param n size of FF in BIGs
+ */
+extern void FF_zero(B512_60::BIG *x, int n);
+/**	@brief Tests for FF element equal to zero
+ *
+	@param x FF number to be tested
+	@param n size of FF in BIGs
+	@return 1 if zero, else returns 0
+ */
+extern int FF_iszilch(B512_60::BIG *x, int n);
+/**	@brief  return parity of an FF, that is the least significant bit
+ *
+	@param x FF number
+	@return 0 or 1
+ */
+extern int FF_parity(B512_60::BIG *x);
+/**	@brief  return least significant m bits of an FF
+ *
+	@param x FF number
+	@param m number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int FF_lastbits(B512_60::BIG *x, int m);
+/**	@brief Set FF element of given size to unity
+ *
+	@param x FF instance to be set to unity
+	@param n size of FF in BIGs
+ */
+extern void FF_one(B512_60::BIG *x, int n);
+/**	@brief Compares two FF numbers. Inputs must be normalised externally
+ *
+	@param x first FF number to be compared
+	@param y second FF number to be compared
+	@param n size of FF in BIGs
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int FF_comp(B512_60::BIG *x, B512_60::BIG *y, int n);
+/**	@brief addition of two FFs
+ *
+	@param x FF instance, on exit = y+z
+	@param y FF instance
+	@param z FF instance
+	@param n size of FF in BIGs
+ */
+extern void FF_add(B512_60::BIG *x, B512_60::BIG *y, B512_60::BIG *z, int n);
+/**	@brief subtraction of two FFs
+ *
+	@param x FF instance, on exit = y-z
+	@param y FF instance
+	@param z FF instance
+	@param n size of FF in BIGs
+ */
+extern void FF_sub(B512_60::BIG *x, B512_60::BIG *y, B512_60::BIG *z, int n);
+/**	@brief increment an FF by an integer,and normalise
+ *
+	@param x FF instance, on exit = x+m
+	@param m an integer to be added to x
+	@param n size of FF in BIGs
+ */
+extern void FF_inc(B512_60::BIG *x, int m, int n);
+/**	@brief Decrement an FF by an integer,and normalise
+ *
+	@param x FF instance, on exit = x-m
+	@param m an integer to be subtracted from x
+	@param n size of FF in BIGs
+ */
+extern void FF_dec(B512_60::BIG *x, int m, int n);
+/**	@brief Normalises the components of an FF
+ *
+	@param x FF instance to be normalised
+	@param n size of FF in BIGs
+ */
+extern void FF_norm(B512_60::BIG *x, int n);
+/**	@brief Shift left an FF by 1 bit
+ *
+	@param x FF instance to be shifted left
+	@param n size of FF in BIGs
+ */
+extern void FF_shl(B512_60::BIG *x, int n);
+/**	@brief Shift right an FF by 1 bit
+ *
+	@param x FF instance to be shifted right
+	@param n size of FF in BIGs
+ */
+extern void FF_shr(B512_60::BIG *x, int n);
+/**	@brief Formats and outputs an FF to the console
+ *
+	@param x FF instance to be printed
+	@param n size of FF in BIGs
+ */
+extern void FF_output(B512_60::BIG *x, int n);
+/**	@brief Formats and outputs an FF to the console, in raw form
+ *
+ 	@param x FF instance to be printed
+ 	@param n size of FF in BIGs
+ */
+extern void FF_rawoutput(B512_60::BIG *x, int n);
+/**	@brief Formats and outputs an FF instance to an octet string
+ *
+	Converts an FF to big-endian base 256 form.
+	@param S output octet string
+	@param x FF instance to be converted to an octet string
+	@param n size of FF in BIGs
+ */
+extern void FF_toOctet(octet *S, B512_60::BIG *x, int n);
+/**	@brief Populates an FF instance from an octet string
+ *
+	Creates FF from big-endian base 256 form.
+	@param x FF instance to be created from an octet string
+	@param S input octet string
+	@param n size of FF in BIGs
+ */
+extern void FF_fromOctet(B512_60::BIG *x, octet *S, int n);
+/**	@brief Multiplication of two FFs
+ *
+	Uses Karatsuba method internally
+	@param x FF instance, on exit = y*z
+	@param y FF instance
+	@param z FF instance
+	@param n size of FF in BIGs
+ */
+extern void FF_mul(B512_60::BIG *x, B512_60::BIG *y, B512_60::BIG *z, int n);
+/**	@brief Reduce FF mod a modulus
+ *
+	This is slow
+	@param x FF instance to be reduced mod m - on exit = x mod m
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_mod(B512_60::BIG *x, B512_60::BIG *m, int n);
+/**	@brief Square an FF
+ *
+	Uses Karatsuba method internally
+	@param x FF instance, on exit = y^2
+	@param y FF instance to be squared
+	@param n size of FF in BIGs
+ */
+extern void FF_sqr(B512_60::BIG *x, B512_60::BIG *y, int n);
+/**	@brief Reduces a double-length FF with respect to a given modulus
+ *
+	This is slow
+	@param x FF instance, on exit = y mod z
+	@param y FF instance, of double length 2*n
+	@param z FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_dmod(B512_60::BIG *x, B512_60::BIG *y, B512_60::BIG *z, int n);
+/**	@brief Invert an FF mod a prime modulus
+ *
+	@param x FF instance, on exit = 1/y mod z
+	@param y FF instance
+	@param z FF prime modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_invmodp(B512_60::BIG *x, B512_60::BIG *y, B512_60::BIG *z, int n);
+/**	@brief Create an FF from a random number generator
+ *
+	@param x FF instance, on exit x is a random number of length n BIGs with most significant bit a 1
+	@param R an instance of a Cryptographically Secure Random Number Generator
+	@param n size of FF in BIGs
+ */
+extern void FF_random(B512_60::BIG *x, csprng *R, int n);
+/**	@brief Create a random FF less than a given modulus from a random number generator
+ *
+	@param x FF instance, on exit x is a random number < y
+	@param y FF instance, the modulus
+	@param R an instance of a Cryptographically Secure Random Number Generator
+	@param n size of FF in BIGs
+ */
+extern void FF_randomnum(B512_60::BIG *x, B512_60::BIG *y, csprng *R, int n);
+/**	@brief Calculate r=x^e mod m, side channel resistant
+ *
+	@param r FF instance, on exit = x^e mod p
+	@param x FF instance
+	@param e FF exponent
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_skpow(B512_60::BIG *r, B512_60::BIG *x, B512_60::BIG * e, B512_60::BIG *m, int n);
+/**	@brief Calculate r=x^e mod m, side channel resistant
+ *
+	For short BIG exponent
+	@param r FF instance, on exit = x^e mod p
+	@param x FF instance
+	@param e BIG exponent
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_skspow(B512_60::BIG *r, B512_60::BIG *x, B512_60::BIG e, B512_60::BIG *m, int n);
+/**	@brief Calculate r=x^e mod m
+ *
+	For very short integer exponent
+	@param r FF instance, on exit = x^e mod p
+	@param x FF instance
+	@param e integer exponent
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_power(B512_60::BIG *r, B512_60::BIG *x, int e, B512_60::BIG *m, int n);
+/**	@brief Calculate r=x^e mod m
+ *
+	@param r FF instance, on exit = x^e mod p
+	@param x FF instance
+	@param e FF exponent
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_pow(B512_60::BIG *r, B512_60::BIG *x, B512_60::BIG *e, B512_60::BIG *m, int n);
+/**	@brief Test if an FF has factor in common with integer s
+ *
+	@param x FF instance to be tested
+	@param s the supplied integer
+	@param n size of FF in BIGs
+	@return 1 if gcd(x,s)!=1, else return 0
+ */
+extern int FF_cfactor(B512_60::BIG *x, sign32 s, int n);
+/**	@brief Test if an FF is prime
+ *
+	Uses Miller-Rabin Method
+	@param x FF instance to be tested
+	@param R an instance of a Cryptographically Secure Random Number Generator
+	@param n size of FF in BIGs
+	@return 1 if x is (almost certainly) prime, else return 0
+ */
+extern int FF_prime(B512_60::BIG *x, csprng *R, int n);
+/**	@brief Calculate r=x^e.y^f mod m
+ *
+	@param r FF instance, on exit = x^e.y^f mod p
+	@param x FF instance
+	@param e BIG exponent
+	@param y FF instance
+	@param f BIG exponent
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_pow2(B512_60::BIG *r, B512_60::BIG *x, B512_60::BIG e, B512_60::BIG *y, B512_60::BIG f, B512_60::BIG *m, int n);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ff_RSA3072.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ff_RSA3072.h
new file mode 100644
index 0000000..d806bc6
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ff_RSA3072.h
@@ -0,0 +1,295 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FF_RSA3072_H
+#define FF_RSA3072_H
+
+#include "big_B384_56.h"
+#include "config_ff_RSA3072.h"
+
+using namespace core;
+
+#define HFLEN_RSA3072 (FFLEN_RSA3072/2) /**< Useful for half-size RSA private key operations */
+#define P_MBITS_RSA3072 (MODBYTES_B384_56*8)
+#define P_TBITS_RSA3072 (P_MBITS_RSA3072%BASEBITS_B384_56)
+#define P_EXCESS_RSA3072(a) (((a[NLEN_B384_56-1])>>(P_TBITS_RSA3072))+1)
+#define P_FEXCESS_RSA3072 ((chunk)1<<(BASEBITS_B384_56*NLEN_B384_56-P_MBITS_RSA3072-1))
+
+
+namespace RSA3072 {
+
+/* Finite Field Prototypes */
+/**	@brief Copy one FF element of given length to another
+ *
+	@param x FF instance to be copied to, on exit = y
+	@param y FF instance to be copied from
+	@param n size of FF in BIGs
+
+ */
+extern void FF_copy(B384_56::BIG *x, B384_56::BIG *y, int n);
+/**	@brief Initialize an FF element of given length from a 32-bit integer m
+ *
+	@param x FF instance to be copied to, on exit = m
+	@param m integer
+	@param n size of FF in BIGs
+ */
+extern void FF_init(B384_56::BIG *x, sign32 m, int n);
+/**	@brief Set FF element of given size to zero
+ *
+	@param x FF instance to be set to zero
+	@param n size of FF in BIGs
+ */
+extern void FF_zero(B384_56::BIG *x, int n);
+/**	@brief Tests for FF element equal to zero
+ *
+	@param x FF number to be tested
+	@param n size of FF in BIGs
+	@return 1 if zero, else returns 0
+ */
+extern int FF_iszilch(B384_56::BIG *x, int n);
+/**	@brief  return parity of an FF, that is the least significant bit
+ *
+	@param x FF number
+	@return 0 or 1
+ */
+extern int FF_parity(B384_56::BIG *x);
+/**	@brief  return least significant m bits of an FF
+ *
+	@param x FF number
+	@param m number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int FF_lastbits(B384_56::BIG *x, int m);
+/**	@brief Set FF element of given size to unity
+ *
+	@param x FF instance to be set to unity
+	@param n size of FF in BIGs
+ */
+extern void FF_one(B384_56::BIG *x, int n);
+/**	@brief Compares two FF numbers. Inputs must be normalised externally
+ *
+	@param x first FF number to be compared
+	@param y second FF number to be compared
+	@param n size of FF in BIGs
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int FF_comp(B384_56::BIG *x, B384_56::BIG *y, int n);
+/**	@brief addition of two FFs
+ *
+	@param x FF instance, on exit = y+z
+	@param y FF instance
+	@param z FF instance
+	@param n size of FF in BIGs
+ */
+extern void FF_add(B384_56::BIG *x, B384_56::BIG *y, B384_56::BIG *z, int n);
+/**	@brief subtraction of two FFs
+ *
+	@param x FF instance, on exit = y-z
+	@param y FF instance
+	@param z FF instance
+	@param n size of FF in BIGs
+ */
+extern void FF_sub(B384_56::BIG *x, B384_56::BIG *y, B384_56::BIG *z, int n);
+/**	@brief increment an FF by an integer,and normalise
+ *
+	@param x FF instance, on exit = x+m
+	@param m an integer to be added to x
+	@param n size of FF in BIGs
+ */
+extern void FF_inc(B384_56::BIG *x, int m, int n);
+/**	@brief Decrement an FF by an integer,and normalise
+ *
+	@param x FF instance, on exit = x-m
+	@param m an integer to be subtracted from x
+	@param n size of FF in BIGs
+ */
+extern void FF_dec(B384_56::BIG *x, int m, int n);
+/**	@brief Normalises the components of an FF
+ *
+	@param x FF instance to be normalised
+	@param n size of FF in BIGs
+ */
+extern void FF_norm(B384_56::BIG *x, int n);
+/**	@brief Shift left an FF by 1 bit
+ *
+	@param x FF instance to be shifted left
+	@param n size of FF in BIGs
+ */
+extern void FF_shl(B384_56::BIG *x, int n);
+/**	@brief Shift right an FF by 1 bit
+ *
+	@param x FF instance to be shifted right
+	@param n size of FF in BIGs
+ */
+extern void FF_shr(B384_56::BIG *x, int n);
+/**	@brief Formats and outputs an FF to the console
+ *
+	@param x FF instance to be printed
+	@param n size of FF in BIGs
+ */
+extern void FF_output(B384_56::BIG *x, int n);
+/**	@brief Formats and outputs an FF to the console, in raw form
+ *
+ 	@param x FF instance to be printed
+ 	@param n size of FF in BIGs
+ */
+extern void FF_rawoutput(B384_56::BIG *x, int n);
+/**	@brief Formats and outputs an FF instance to an octet string
+ *
+	Converts an FF to big-endian base 256 form.
+	@param S output octet string
+	@param x FF instance to be converted to an octet string
+	@param n size of FF in BIGs
+ */
+extern void FF_toOctet(octet *S, B384_56::BIG *x, int n);
+/**	@brief Populates an FF instance from an octet string
+ *
+	Creates FF from big-endian base 256 form.
+	@param x FF instance to be created from an octet string
+	@param S input octet string
+	@param n size of FF in BIGs
+ */
+extern void FF_fromOctet(B384_56::BIG *x, octet *S, int n);
+/**	@brief Multiplication of two FFs
+ *
+	Uses Karatsuba method internally
+	@param x FF instance, on exit = y*z
+	@param y FF instance
+	@param z FF instance
+	@param n size of FF in BIGs
+ */
+extern void FF_mul(B384_56::BIG *x, B384_56::BIG *y, B384_56::BIG *z, int n);
+/**	@brief Reduce FF mod a modulus
+ *
+	This is slow
+	@param x FF instance to be reduced mod m - on exit = x mod m
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_mod(B384_56::BIG *x, B384_56::BIG *m, int n);
+/**	@brief Square an FF
+ *
+	Uses Karatsuba method internally
+	@param x FF instance, on exit = y^2
+	@param y FF instance to be squared
+	@param n size of FF in BIGs
+ */
+extern void FF_sqr(B384_56::BIG *x, B384_56::BIG *y, int n);
+/**	@brief Reduces a double-length FF with respect to a given modulus
+ *
+	This is slow
+	@param x FF instance, on exit = y mod z
+	@param y FF instance, of double length 2*n
+	@param z FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_dmod(B384_56::BIG *x, B384_56::BIG *y, B384_56::BIG *z, int n);
+/**	@brief Invert an FF mod a prime modulus
+ *
+	@param x FF instance, on exit = 1/y mod z
+	@param y FF instance
+	@param z FF prime modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_invmodp(B384_56::BIG *x, B384_56::BIG *y, B384_56::BIG *z, int n);
+/**	@brief Create an FF from a random number generator
+ *
+	@param x FF instance, on exit x is a random number of length n BIGs with most significant bit a 1
+	@param R an instance of a Cryptographically Secure Random Number Generator
+	@param n size of FF in BIGs
+ */
+extern void FF_random(B384_56::BIG *x, csprng *R, int n);
+/**	@brief Create a random FF less than a given modulus from a random number generator
+ *
+	@param x FF instance, on exit x is a random number < y
+	@param y FF instance, the modulus
+	@param R an instance of a Cryptographically Secure Random Number Generator
+	@param n size of FF in BIGs
+ */
+extern void FF_randomnum(B384_56::BIG *x, B384_56::BIG *y, csprng *R, int n);
+/**	@brief Calculate r=x^e mod m, side channel resistant
+ *
+	@param r FF instance, on exit = x^e mod p
+	@param x FF instance
+	@param e FF exponent
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_skpow(B384_56::BIG *r, B384_56::BIG *x, B384_56::BIG * e, B384_56::BIG *m, int n);
+/**	@brief Calculate r=x^e mod m, side channel resistant
+ *
+	For short BIG exponent
+	@param r FF instance, on exit = x^e mod p
+	@param x FF instance
+	@param e BIG exponent
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_skspow(B384_56::BIG *r, B384_56::BIG *x, B384_56::BIG e, B384_56::BIG *m, int n);
+/**	@brief Calculate r=x^e mod m
+ *
+	For very short integer exponent
+	@param r FF instance, on exit = x^e mod p
+	@param x FF instance
+	@param e integer exponent
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_power(B384_56::BIG *r, B384_56::BIG *x, int e, B384_56::BIG *m, int n);
+/**	@brief Calculate r=x^e mod m
+ *
+	@param r FF instance, on exit = x^e mod p
+	@param x FF instance
+	@param e FF exponent
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_pow(B384_56::BIG *r, B384_56::BIG *x, B384_56::BIG *e, B384_56::BIG *m, int n);
+/**	@brief Test if an FF has factor in common with integer s
+ *
+	@param x FF instance to be tested
+	@param s the supplied integer
+	@param n size of FF in BIGs
+	@return 1 if gcd(x,s)!=1, else return 0
+ */
+extern int FF_cfactor(B384_56::BIG *x, sign32 s, int n);
+/**	@brief Test if an FF is prime
+ *
+	Uses Miller-Rabin Method
+	@param x FF instance to be tested
+	@param R an instance of a Cryptographically Secure Random Number Generator
+	@param n size of FF in BIGs
+	@return 1 if x is (almost certainly) prime, else return 0
+ */
+extern int FF_prime(B384_56::BIG *x, csprng *R, int n);
+/**	@brief Calculate r=x^e.y^f mod m
+ *
+	@param r FF instance, on exit = x^e.y^f mod p
+	@param x FF instance
+	@param e BIG exponent
+	@param y FF instance
+	@param f BIG exponent
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_pow2(B384_56::BIG *r, B384_56::BIG *x, B384_56::BIG e, B384_56::BIG *y, B384_56::BIG f, B384_56::BIG *m, int n);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ff_RSA4096.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ff_RSA4096.h
new file mode 100644
index 0000000..4c49058
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/ff_RSA4096.h
@@ -0,0 +1,295 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FF_RSA4096_H
+#define FF_RSA4096_H
+
+#include "big_B512_60.h"
+#include "config_ff_RSA4096.h"
+
+using namespace core;
+
+#define HFLEN_RSA4096 (FFLEN_RSA4096/2) /**< Useful for half-size RSA private key operations */
+#define P_MBITS_RSA4096 (MODBYTES_B512_60*8)
+#define P_TBITS_RSA4096 (P_MBITS_RSA4096%BASEBITS_B512_60)
+#define P_EXCESS_RSA4096(a) (((a[NLEN_B512_60-1])>>(P_TBITS_RSA4096))+1)
+#define P_FEXCESS_RSA4096 ((chunk)1<<(BASEBITS_B512_60*NLEN_B512_60-P_MBITS_RSA4096-1))
+
+
+namespace RSA4096 {
+
+/* Finite Field Prototypes */
+/**	@brief Copy one FF element of given length to another
+ *
+	@param x FF instance to be copied to, on exit = y
+	@param y FF instance to be copied from
+	@param n size of FF in BIGs
+
+ */
+extern void FF_copy(B512_60::BIG *x, B512_60::BIG *y, int n);
+/**	@brief Initialize an FF element of given length from a 32-bit integer m
+ *
+	@param x FF instance to be copied to, on exit = m
+	@param m integer
+	@param n size of FF in BIGs
+ */
+extern void FF_init(B512_60::BIG *x, sign32 m, int n);
+/**	@brief Set FF element of given size to zero
+ *
+	@param x FF instance to be set to zero
+	@param n size of FF in BIGs
+ */
+extern void FF_zero(B512_60::BIG *x, int n);
+/**	@brief Tests for FF element equal to zero
+ *
+	@param x FF number to be tested
+	@param n size of FF in BIGs
+	@return 1 if zero, else returns 0
+ */
+extern int FF_iszilch(B512_60::BIG *x, int n);
+/**	@brief  return parity of an FF, that is the least significant bit
+ *
+	@param x FF number
+	@return 0 or 1
+ */
+extern int FF_parity(B512_60::BIG *x);
+/**	@brief  return least significant m bits of an FF
+ *
+	@param x FF number
+	@param m number of bits to return. Assumed to be less than BASEBITS.
+	@return least significant n bits as an integer
+ */
+extern int FF_lastbits(B512_60::BIG *x, int m);
+/**	@brief Set FF element of given size to unity
+ *
+	@param x FF instance to be set to unity
+	@param n size of FF in BIGs
+ */
+extern void FF_one(B512_60::BIG *x, int n);
+/**	@brief Compares two FF numbers. Inputs must be normalised externally
+ *
+	@param x first FF number to be compared
+	@param y second FF number to be compared
+	@param n size of FF in BIGs
+	@return -1 is x<y, 0 if x=y, 1 if x>y
+ */
+extern int FF_comp(B512_60::BIG *x, B512_60::BIG *y, int n);
+/**	@brief addition of two FFs
+ *
+	@param x FF instance, on exit = y+z
+	@param y FF instance
+	@param z FF instance
+	@param n size of FF in BIGs
+ */
+extern void FF_add(B512_60::BIG *x, B512_60::BIG *y, B512_60::BIG *z, int n);
+/**	@brief subtraction of two FFs
+ *
+	@param x FF instance, on exit = y-z
+	@param y FF instance
+	@param z FF instance
+	@param n size of FF in BIGs
+ */
+extern void FF_sub(B512_60::BIG *x, B512_60::BIG *y, B512_60::BIG *z, int n);
+/**	@brief increment an FF by an integer,and normalise
+ *
+	@param x FF instance, on exit = x+m
+	@param m an integer to be added to x
+	@param n size of FF in BIGs
+ */
+extern void FF_inc(B512_60::BIG *x, int m, int n);
+/**	@brief Decrement an FF by an integer,and normalise
+ *
+	@param x FF instance, on exit = x-m
+	@param m an integer to be subtracted from x
+	@param n size of FF in BIGs
+ */
+extern void FF_dec(B512_60::BIG *x, int m, int n);
+/**	@brief Normalises the components of an FF
+ *
+	@param x FF instance to be normalised
+	@param n size of FF in BIGs
+ */
+extern void FF_norm(B512_60::BIG *x, int n);
+/**	@brief Shift left an FF by 1 bit
+ *
+	@param x FF instance to be shifted left
+	@param n size of FF in BIGs
+ */
+extern void FF_shl(B512_60::BIG *x, int n);
+/**	@brief Shift right an FF by 1 bit
+ *
+	@param x FF instance to be shifted right
+	@param n size of FF in BIGs
+ */
+extern void FF_shr(B512_60::BIG *x, int n);
+/**	@brief Formats and outputs an FF to the console
+ *
+	@param x FF instance to be printed
+	@param n size of FF in BIGs
+ */
+extern void FF_output(B512_60::BIG *x, int n);
+/**	@brief Formats and outputs an FF to the console, in raw form
+ *
+ 	@param x FF instance to be printed
+ 	@param n size of FF in BIGs
+ */
+extern void FF_rawoutput(B512_60::BIG *x, int n);
+/**	@brief Formats and outputs an FF instance to an octet string
+ *
+	Converts an FF to big-endian base 256 form.
+	@param S output octet string
+	@param x FF instance to be converted to an octet string
+	@param n size of FF in BIGs
+ */
+extern void FF_toOctet(octet *S, B512_60::BIG *x, int n);
+/**	@brief Populates an FF instance from an octet string
+ *
+	Creates FF from big-endian base 256 form.
+	@param x FF instance to be created from an octet string
+	@param S input octet string
+	@param n size of FF in BIGs
+ */
+extern void FF_fromOctet(B512_60::BIG *x, octet *S, int n);
+/**	@brief Multiplication of two FFs
+ *
+	Uses Karatsuba method internally
+	@param x FF instance, on exit = y*z
+	@param y FF instance
+	@param z FF instance
+	@param n size of FF in BIGs
+ */
+extern void FF_mul(B512_60::BIG *x, B512_60::BIG *y, B512_60::BIG *z, int n);
+/**	@brief Reduce FF mod a modulus
+ *
+	This is slow
+	@param x FF instance to be reduced mod m - on exit = x mod m
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_mod(B512_60::BIG *x, B512_60::BIG *m, int n);
+/**	@brief Square an FF
+ *
+	Uses Karatsuba method internally
+	@param x FF instance, on exit = y^2
+	@param y FF instance to be squared
+	@param n size of FF in BIGs
+ */
+extern void FF_sqr(B512_60::BIG *x, B512_60::BIG *y, int n);
+/**	@brief Reduces a double-length FF with respect to a given modulus
+ *
+	This is slow
+	@param x FF instance, on exit = y mod z
+	@param y FF instance, of double length 2*n
+	@param z FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_dmod(B512_60::BIG *x, B512_60::BIG *y, B512_60::BIG *z, int n);
+/**	@brief Invert an FF mod a prime modulus
+ *
+	@param x FF instance, on exit = 1/y mod z
+	@param y FF instance
+	@param z FF prime modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_invmodp(B512_60::BIG *x, B512_60::BIG *y, B512_60::BIG *z, int n);
+/**	@brief Create an FF from a random number generator
+ *
+	@param x FF instance, on exit x is a random number of length n BIGs with most significant bit a 1
+	@param R an instance of a Cryptographically Secure Random Number Generator
+	@param n size of FF in BIGs
+ */
+extern void FF_random(B512_60::BIG *x, csprng *R, int n);
+/**	@brief Create a random FF less than a given modulus from a random number generator
+ *
+	@param x FF instance, on exit x is a random number < y
+	@param y FF instance, the modulus
+	@param R an instance of a Cryptographically Secure Random Number Generator
+	@param n size of FF in BIGs
+ */
+extern void FF_randomnum(B512_60::BIG *x, B512_60::BIG *y, csprng *R, int n);
+/**	@brief Calculate r=x^e mod m, side channel resistant
+ *
+	@param r FF instance, on exit = x^e mod p
+	@param x FF instance
+	@param e FF exponent
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_skpow(B512_60::BIG *r, B512_60::BIG *x, B512_60::BIG * e, B512_60::BIG *m, int n);
+/**	@brief Calculate r=x^e mod m, side channel resistant
+ *
+	For short BIG exponent
+	@param r FF instance, on exit = x^e mod p
+	@param x FF instance
+	@param e BIG exponent
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_skspow(B512_60::BIG *r, B512_60::BIG *x, B512_60::BIG e, B512_60::BIG *m, int n);
+/**	@brief Calculate r=x^e mod m
+ *
+	For very short integer exponent
+	@param r FF instance, on exit = x^e mod p
+	@param x FF instance
+	@param e integer exponent
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_power(B512_60::BIG *r, B512_60::BIG *x, int e, B512_60::BIG *m, int n);
+/**	@brief Calculate r=x^e mod m
+ *
+	@param r FF instance, on exit = x^e mod p
+	@param x FF instance
+	@param e FF exponent
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_pow(B512_60::BIG *r, B512_60::BIG *x, B512_60::BIG *e, B512_60::BIG *m, int n);
+/**	@brief Test if an FF has factor in common with integer s
+ *
+	@param x FF instance to be tested
+	@param s the supplied integer
+	@param n size of FF in BIGs
+	@return 1 if gcd(x,s)!=1, else return 0
+ */
+extern int FF_cfactor(B512_60::BIG *x, sign32 s, int n);
+/**	@brief Test if an FF is prime
+ *
+	Uses Miller-Rabin Method
+	@param x FF instance to be tested
+	@param R an instance of a Cryptographically Secure Random Number Generator
+	@param n size of FF in BIGs
+	@return 1 if x is (almost certainly) prime, else return 0
+ */
+extern int FF_prime(B512_60::BIG *x, csprng *R, int n);
+/**	@brief Calculate r=x^e.y^f mod m
+ *
+	@param r FF instance, on exit = x^e.y^f mod p
+	@param x FF instance
+	@param e BIG exponent
+	@param y FF instance
+	@param f BIG exponent
+	@param m FF modulus
+	@param n size of FF in BIGs
+ */
+extern void FF_pow2(B512_60::BIG *r, B512_60::BIG *x, B512_60::BIG e, B512_60::BIG *y, B512_60::BIG f, B512_60::BIG *m, int n);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp.h
new file mode 100644
index 0000000..4392395
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_YYY_H
+#define FP_YYY_H
+
+#include "big_XXX.h"
+#include "config_field_YYY.h"
+
+using namespace core;
+
+#define MODBITS_YYY MBITS_YYY
+#define TBITS_YYY (MBITS_YYY%BASEBITS_XXX)              /**< Number of active bits in top word */
+#define TMASK_YYY (((chunk)1<<TBITS_YYY)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_YYY (((sign32)1<<MAXXES_YYY)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_YYY (-((chunk)(1)<<TBITS_YYY))            /**<  for masking out overflow bits */
+
+namespace YYY {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    XXX::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const XXX::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const XXX::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const XXX::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const XXX::BIG SQRTm3;      /**< Square root of -3 */
+extern const XXX::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const XXX::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const XXX::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const XXX::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const XXX::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, XXX::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(XXX::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(XXX::BIG r, XXX::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(XXX::BIG, XXX::BIG, XXX::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, XXX::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp12.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp12.h
new file mode 100644
index 0000000..5bd7b69
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp12.h
@@ -0,0 +1,230 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP12_YYY_H
+#define FP12_YYY_H
+
+#include "fp4_YYY.h"
+
+using namespace core;
+
+namespace YYY {
+/**
+	@brief FP12 Structure - towered over three FP4
+*/
+
+typedef struct
+{
+    FP4 a; /**< first part of FP12 */
+    FP4 b; /**< second part of FP12 */
+    FP4 c; /**< third part of FP12 */
+    int type;
+} FP12;
+
+extern const XXX::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const XXX::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+/* FP12 prototypes */
+/**	@brief Tests for FP12 equal to zero
+ *
+	@param x FP12 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP12_iszilch(FP12 *x);
+/**	@brief Tests for FP12 equal to unity
+ *
+	@param x FP12 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP12_isunity(FP12 *x);
+/**	@brief Copy FP12 to another FP12
+ *
+	@param x FP12 instance, on exit = y
+	@param y FP12 instance to be copied
+ */
+extern void FP12_copy(FP12 *x, FP12 *y);
+/**	@brief Set FP12 to unity
+ *
+	@param x FP12 instance to be set to one
+ */
+extern void FP12_one(FP12 *x);
+
+/**	@brief Set FP12 to zero
+ *
+	@param x FP12 instance to be set to zero
+ */
+extern void FP12_zero(FP12 *x);
+
+/**	@brief Tests for equality of two FP12s
+ *
+	@param x FP12 instance to be compared
+	@param y FP12 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP12_equals(FP12 *x, FP12 *y);
+/**	@brief Conjugation of FP12
+ *
+	If y=(a,b,c) (where a,b,c are its three FP4 components) on exit x=(conj(a),-conj(b),conj(c))
+	@param x FP12 instance, on exit = conj(y)
+	@param y FP12 instance
+ */
+extern void FP12_conj(FP12 *x, FP12 *y);
+/**	@brief Initialise FP12 from single FP4
+ *
+	Sets first FP4 component of an FP12, other components set to zero
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP4
+ */
+extern void FP12_from_FP4(FP12 *x, FP4 *a);
+/**	@brief Initialise FP12 from three FP4s
+ *
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP12
+	@param b FP4 to form second part of FP12
+	@param c FP4 to form third part of FP12
+ */
+extern void FP12_from_FP4s(FP12 *x, FP4 *a, FP4* b, FP4 *c);
+/**	@brief Fast Squaring of an FP12 in "unitary" form
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP4 instance, must be unitary
+ */
+extern void FP12_usqr(FP12 *x, FP12 *y);
+/**	@brief Squaring an FP12
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP12 instance
+ */
+extern void FP12_sqr(FP12 *x, FP12 *y);
+/**	@brief Fast multiplication of two sparse FP12s that arises from ATE pairing line functions
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_smul(FP12 *x, FP12 *y);
+
+/**	@brief Fast multiplication of what may be sparse multiplicands
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_ssmul(FP12 *x, FP12 *y);
+
+
+/**	@brief Full unconditional Multiplication of two FP12s
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, the multiplier
+ */
+extern void FP12_mul(FP12 *x, FP12 *y);
+
+/**	@brief Inverting an FP12
+ *
+	@param x FP12 instance, on exit = 1/y
+	@param y FP12 instance
+	@param t D_TYPE or M_TYPE twist
+ */
+extern void FP12_inv(FP12 *x, FP12 *y);
+/**	@brief Raises an FP12 to the power of a BIG
+ *
+	@param r FP12 instance, on exit = y^b
+	@param x FP12 instance
+	@param b BIG number
+ */
+extern void FP12_pow(FP12 *r, FP12 *x, XXX::BIG b);
+/**	@brief Raises an FP12 instance x to a small integer power, side-channel resistant
+ *
+	@param x FP12 instance, on exit = x^i
+	@param i small integer exponent
+	@param b maximum number of bits in exponent
+ */
+extern void FP12_pinpow(FP12 *x, int i, int b);
+
+/**	@brief Raises an FP12 instance x to a BIG power, compressed to FP4
+ *
+	@param c FP4 instance, on exit = x^(e mod r) as FP4
+	@param x FP12 input
+	@param e BIG exponent
+	@param r BIG group order
+ */
+extern void FP12_compow(FP4 *c, FP12 *x, XXX::BIG e, XXX::BIG r);
+
+/**	@brief Calculate x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3], side-channel resistant
+ *
+	@param r FP12 instance, on exit = x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3]
+	@param x FP12 array with 4 FP12s
+	@param b BIG array of 4 exponents
+ */
+extern void FP12_pow4(FP12 *r, FP12 *x, XXX::BIG *b);
+/**	@brief Raises an FP12 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP12 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP12_frob(FP12 *x, FP2 *f);
+/**	@brief Reduces all components of possibly unreduced FP12 mod Modulus
+ *
+	@param x FP12 instance, on exit reduced mod Modulus
+ */
+extern void FP12_reduce(FP12 *x);
+/**	@brief Normalises the components of an FP12
+ *
+	@param x FP12 instance to be normalised
+ */
+extern void FP12_norm(FP12 *x);
+/**	@brief Formats and outputs an FP12 to the console
+ *
+	@param x FP12 instance to be printed
+ */
+extern void FP12_output(FP12 *x);
+/**	@brief Formats and outputs an FP12 instance to an octet string
+ *
+	Serializes the components of an FP12 to big-endian base 256 form.
+	@param S output octet string
+	@param x FP12 instance to be converted to an octet string
+ */
+extern void FP12_toOctet(octet *S, FP12 *x);
+/**	@brief Creates an FP12 instance from an octet string
+ *
+	De-serializes the components of an FP12 to create an FP12 from big-endian base 256 components.
+	@param x FP12 instance to be created from an octet string
+	@param S input octet string
+
+ */
+extern void FP12_fromOctet(FP12 *x, octet *S);
+/**	@brief Calculate the trace of an FP12
+ *
+	@param t FP4 trace of x, on exit = tr(x)
+	@param x FP12 instance
+
+ */
+extern void FP12_trace(FP4 *t, FP12 *x);
+
+/**	@brief Conditional copy of FP12 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP12 instance, set to y if s!=0
+	@param y another FP12 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP12_cmove(FP12 *x, FP12 *y, int s);
+
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp12_BLS12381.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp12_BLS12381.h
new file mode 100644
index 0000000..36bd83d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp12_BLS12381.h
@@ -0,0 +1,230 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP12_BLS12381_H
+#define FP12_BLS12381_H
+
+#include "fp4_BLS12381.h"
+
+using namespace core;
+
+namespace BLS12381 {
+/**
+	@brief FP12 Structure - towered over three FP4
+*/
+
+typedef struct
+{
+    FP4 a; /**< first part of FP12 */
+    FP4 b; /**< second part of FP12 */
+    FP4 c; /**< third part of FP12 */
+    int type;
+} FP12;
+
+extern const B384_58::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B384_58::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+/* FP12 prototypes */
+/**	@brief Tests for FP12 equal to zero
+ *
+	@param x FP12 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP12_iszilch(FP12 *x);
+/**	@brief Tests for FP12 equal to unity
+ *
+	@param x FP12 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP12_isunity(FP12 *x);
+/**	@brief Copy FP12 to another FP12
+ *
+	@param x FP12 instance, on exit = y
+	@param y FP12 instance to be copied
+ */
+extern void FP12_copy(FP12 *x, FP12 *y);
+/**	@brief Set FP12 to unity
+ *
+	@param x FP12 instance to be set to one
+ */
+extern void FP12_one(FP12 *x);
+
+/**	@brief Set FP12 to zero
+ *
+	@param x FP12 instance to be set to zero
+ */
+extern void FP12_zero(FP12 *x);
+
+/**	@brief Tests for equality of two FP12s
+ *
+	@param x FP12 instance to be compared
+	@param y FP12 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP12_equals(FP12 *x, FP12 *y);
+/**	@brief Conjugation of FP12
+ *
+	If y=(a,b,c) (where a,b,c are its three FP4 components) on exit x=(conj(a),-conj(b),conj(c))
+	@param x FP12 instance, on exit = conj(y)
+	@param y FP12 instance
+ */
+extern void FP12_conj(FP12 *x, FP12 *y);
+/**	@brief Initialise FP12 from single FP4
+ *
+	Sets first FP4 component of an FP12, other components set to zero
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP4
+ */
+extern void FP12_from_FP4(FP12 *x, FP4 *a);
+/**	@brief Initialise FP12 from three FP4s
+ *
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP12
+	@param b FP4 to form second part of FP12
+	@param c FP4 to form third part of FP12
+ */
+extern void FP12_from_FP4s(FP12 *x, FP4 *a, FP4* b, FP4 *c);
+/**	@brief Fast Squaring of an FP12 in "unitary" form
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP4 instance, must be unitary
+ */
+extern void FP12_usqr(FP12 *x, FP12 *y);
+/**	@brief Squaring an FP12
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP12 instance
+ */
+extern void FP12_sqr(FP12 *x, FP12 *y);
+/**	@brief Fast multiplication of two sparse FP12s that arises from ATE pairing line functions
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_smul(FP12 *x, FP12 *y);
+
+/**	@brief Fast multiplication of what may be sparse multiplicands
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_ssmul(FP12 *x, FP12 *y);
+
+
+/**	@brief Full unconditional Multiplication of two FP12s
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, the multiplier
+ */
+extern void FP12_mul(FP12 *x, FP12 *y);
+
+/**	@brief Inverting an FP12
+ *
+	@param x FP12 instance, on exit = 1/y
+	@param y FP12 instance
+	@param t D_TYPE or M_TYPE twist
+ */
+extern void FP12_inv(FP12 *x, FP12 *y);
+/**	@brief Raises an FP12 to the power of a BIG
+ *
+	@param r FP12 instance, on exit = y^b
+	@param x FP12 instance
+	@param b BIG number
+ */
+extern void FP12_pow(FP12 *r, FP12 *x, B384_58::BIG b);
+/**	@brief Raises an FP12 instance x to a small integer power, side-channel resistant
+ *
+	@param x FP12 instance, on exit = x^i
+	@param i small integer exponent
+	@param b maximum number of bits in exponent
+ */
+extern void FP12_pinpow(FP12 *x, int i, int b);
+
+/**	@brief Raises an FP12 instance x to a BIG power, compressed to FP4
+ *
+	@param c FP4 instance, on exit = x^(e mod r) as FP4
+	@param x FP12 input
+	@param e BIG exponent
+	@param r BIG group order
+ */
+extern void FP12_compow(FP4 *c, FP12 *x, B384_58::BIG e, B384_58::BIG r);
+
+/**	@brief Calculate x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3], side-channel resistant
+ *
+	@param r FP12 instance, on exit = x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3]
+	@param x FP12 array with 4 FP12s
+	@param b BIG array of 4 exponents
+ */
+extern void FP12_pow4(FP12 *r, FP12 *x, B384_58::BIG *b);
+/**	@brief Raises an FP12 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP12 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP12_frob(FP12 *x, FP2 *f);
+/**	@brief Reduces all components of possibly unreduced FP12 mod Modulus
+ *
+	@param x FP12 instance, on exit reduced mod Modulus
+ */
+extern void FP12_reduce(FP12 *x);
+/**	@brief Normalises the components of an FP12
+ *
+	@param x FP12 instance to be normalised
+ */
+extern void FP12_norm(FP12 *x);
+/**	@brief Formats and outputs an FP12 to the console
+ *
+	@param x FP12 instance to be printed
+ */
+extern void FP12_output(FP12 *x);
+/**	@brief Formats and outputs an FP12 instance to an octet string
+ *
+	Serializes the components of an FP12 to big-endian base 256 form.
+	@param S output octet string
+	@param x FP12 instance to be converted to an octet string
+ */
+extern void FP12_toOctet(octet *S, FP12 *x);
+/**	@brief Creates an FP12 instance from an octet string
+ *
+	De-serializes the components of an FP12 to create an FP12 from big-endian base 256 components.
+	@param x FP12 instance to be created from an octet string
+	@param S input octet string
+
+ */
+extern void FP12_fromOctet(FP12 *x, octet *S);
+/**	@brief Calculate the trace of an FP12
+ *
+	@param t FP4 trace of x, on exit = tr(x)
+	@param x FP12 instance
+
+ */
+extern void FP12_trace(FP4 *t, FP12 *x);
+
+/**	@brief Conditional copy of FP12 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP12 instance, set to y if s!=0
+	@param y another FP12 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP12_cmove(FP12 *x, FP12 *y, int s);
+
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp12_BLS12383.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp12_BLS12383.h
new file mode 100644
index 0000000..be0a1d6
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp12_BLS12383.h
@@ -0,0 +1,230 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP12_BLS12383_H
+#define FP12_BLS12383_H
+
+#include "fp4_BLS12383.h"
+
+using namespace core;
+
+namespace BLS12383 {
+/**
+	@brief FP12 Structure - towered over three FP4
+*/
+
+typedef struct
+{
+    FP4 a; /**< first part of FP12 */
+    FP4 b; /**< second part of FP12 */
+    FP4 c; /**< third part of FP12 */
+    int type;
+} FP12;
+
+extern const B384_58::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B384_58::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+/* FP12 prototypes */
+/**	@brief Tests for FP12 equal to zero
+ *
+	@param x FP12 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP12_iszilch(FP12 *x);
+/**	@brief Tests for FP12 equal to unity
+ *
+	@param x FP12 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP12_isunity(FP12 *x);
+/**	@brief Copy FP12 to another FP12
+ *
+	@param x FP12 instance, on exit = y
+	@param y FP12 instance to be copied
+ */
+extern void FP12_copy(FP12 *x, FP12 *y);
+/**	@brief Set FP12 to unity
+ *
+	@param x FP12 instance to be set to one
+ */
+extern void FP12_one(FP12 *x);
+
+/**	@brief Set FP12 to zero
+ *
+	@param x FP12 instance to be set to zero
+ */
+extern void FP12_zero(FP12 *x);
+
+/**	@brief Tests for equality of two FP12s
+ *
+	@param x FP12 instance to be compared
+	@param y FP12 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP12_equals(FP12 *x, FP12 *y);
+/**	@brief Conjugation of FP12
+ *
+	If y=(a,b,c) (where a,b,c are its three FP4 components) on exit x=(conj(a),-conj(b),conj(c))
+	@param x FP12 instance, on exit = conj(y)
+	@param y FP12 instance
+ */
+extern void FP12_conj(FP12 *x, FP12 *y);
+/**	@brief Initialise FP12 from single FP4
+ *
+	Sets first FP4 component of an FP12, other components set to zero
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP4
+ */
+extern void FP12_from_FP4(FP12 *x, FP4 *a);
+/**	@brief Initialise FP12 from three FP4s
+ *
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP12
+	@param b FP4 to form second part of FP12
+	@param c FP4 to form third part of FP12
+ */
+extern void FP12_from_FP4s(FP12 *x, FP4 *a, FP4* b, FP4 *c);
+/**	@brief Fast Squaring of an FP12 in "unitary" form
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP4 instance, must be unitary
+ */
+extern void FP12_usqr(FP12 *x, FP12 *y);
+/**	@brief Squaring an FP12
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP12 instance
+ */
+extern void FP12_sqr(FP12 *x, FP12 *y);
+/**	@brief Fast multiplication of two sparse FP12s that arises from ATE pairing line functions
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_smul(FP12 *x, FP12 *y);
+
+/**	@brief Fast multiplication of what may be sparse multiplicands
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_ssmul(FP12 *x, FP12 *y);
+
+
+/**	@brief Full unconditional Multiplication of two FP12s
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, the multiplier
+ */
+extern void FP12_mul(FP12 *x, FP12 *y);
+
+/**	@brief Inverting an FP12
+ *
+	@param x FP12 instance, on exit = 1/y
+	@param y FP12 instance
+	@param t D_TYPE or M_TYPE twist
+ */
+extern void FP12_inv(FP12 *x, FP12 *y);
+/**	@brief Raises an FP12 to the power of a BIG
+ *
+	@param r FP12 instance, on exit = y^b
+	@param x FP12 instance
+	@param b BIG number
+ */
+extern void FP12_pow(FP12 *r, FP12 *x, B384_58::BIG b);
+/**	@brief Raises an FP12 instance x to a small integer power, side-channel resistant
+ *
+	@param x FP12 instance, on exit = x^i
+	@param i small integer exponent
+	@param b maximum number of bits in exponent
+ */
+extern void FP12_pinpow(FP12 *x, int i, int b);
+
+/**	@brief Raises an FP12 instance x to a BIG power, compressed to FP4
+ *
+	@param c FP4 instance, on exit = x^(e mod r) as FP4
+	@param x FP12 input
+	@param e BIG exponent
+	@param r BIG group order
+ */
+extern void FP12_compow(FP4 *c, FP12 *x, B384_58::BIG e, B384_58::BIG r);
+
+/**	@brief Calculate x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3], side-channel resistant
+ *
+	@param r FP12 instance, on exit = x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3]
+	@param x FP12 array with 4 FP12s
+	@param b BIG array of 4 exponents
+ */
+extern void FP12_pow4(FP12 *r, FP12 *x, B384_58::BIG *b);
+/**	@brief Raises an FP12 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP12 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP12_frob(FP12 *x, FP2 *f);
+/**	@brief Reduces all components of possibly unreduced FP12 mod Modulus
+ *
+	@param x FP12 instance, on exit reduced mod Modulus
+ */
+extern void FP12_reduce(FP12 *x);
+/**	@brief Normalises the components of an FP12
+ *
+	@param x FP12 instance to be normalised
+ */
+extern void FP12_norm(FP12 *x);
+/**	@brief Formats and outputs an FP12 to the console
+ *
+	@param x FP12 instance to be printed
+ */
+extern void FP12_output(FP12 *x);
+/**	@brief Formats and outputs an FP12 instance to an octet string
+ *
+	Serializes the components of an FP12 to big-endian base 256 form.
+	@param S output octet string
+	@param x FP12 instance to be converted to an octet string
+ */
+extern void FP12_toOctet(octet *S, FP12 *x);
+/**	@brief Creates an FP12 instance from an octet string
+ *
+	De-serializes the components of an FP12 to create an FP12 from big-endian base 256 components.
+	@param x FP12 instance to be created from an octet string
+	@param S input octet string
+
+ */
+extern void FP12_fromOctet(FP12 *x, octet *S);
+/**	@brief Calculate the trace of an FP12
+ *
+	@param t FP4 trace of x, on exit = tr(x)
+	@param x FP12 instance
+
+ */
+extern void FP12_trace(FP4 *t, FP12 *x);
+
+/**	@brief Conditional copy of FP12 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP12 instance, set to y if s!=0
+	@param y another FP12 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP12_cmove(FP12 *x, FP12 *y, int s);
+
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp12_BLS12443.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp12_BLS12443.h
new file mode 100644
index 0000000..a441462
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp12_BLS12443.h
@@ -0,0 +1,230 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP12_BLS12443_H
+#define FP12_BLS12443_H
+
+#include "fp4_BLS12443.h"
+
+using namespace core;
+
+namespace BLS12443 {
+/**
+	@brief FP12 Structure - towered over three FP4
+*/
+
+typedef struct
+{
+    FP4 a; /**< first part of FP12 */
+    FP4 b; /**< second part of FP12 */
+    FP4 c; /**< third part of FP12 */
+    int type;
+} FP12;
+
+extern const B448_60::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B448_60::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+/* FP12 prototypes */
+/**	@brief Tests for FP12 equal to zero
+ *
+	@param x FP12 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP12_iszilch(FP12 *x);
+/**	@brief Tests for FP12 equal to unity
+ *
+	@param x FP12 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP12_isunity(FP12 *x);
+/**	@brief Copy FP12 to another FP12
+ *
+	@param x FP12 instance, on exit = y
+	@param y FP12 instance to be copied
+ */
+extern void FP12_copy(FP12 *x, FP12 *y);
+/**	@brief Set FP12 to unity
+ *
+	@param x FP12 instance to be set to one
+ */
+extern void FP12_one(FP12 *x);
+
+/**	@brief Set FP12 to zero
+ *
+	@param x FP12 instance to be set to zero
+ */
+extern void FP12_zero(FP12 *x);
+
+/**	@brief Tests for equality of two FP12s
+ *
+	@param x FP12 instance to be compared
+	@param y FP12 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP12_equals(FP12 *x, FP12 *y);
+/**	@brief Conjugation of FP12
+ *
+	If y=(a,b,c) (where a,b,c are its three FP4 components) on exit x=(conj(a),-conj(b),conj(c))
+	@param x FP12 instance, on exit = conj(y)
+	@param y FP12 instance
+ */
+extern void FP12_conj(FP12 *x, FP12 *y);
+/**	@brief Initialise FP12 from single FP4
+ *
+	Sets first FP4 component of an FP12, other components set to zero
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP4
+ */
+extern void FP12_from_FP4(FP12 *x, FP4 *a);
+/**	@brief Initialise FP12 from three FP4s
+ *
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP12
+	@param b FP4 to form second part of FP12
+	@param c FP4 to form third part of FP12
+ */
+extern void FP12_from_FP4s(FP12 *x, FP4 *a, FP4* b, FP4 *c);
+/**	@brief Fast Squaring of an FP12 in "unitary" form
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP4 instance, must be unitary
+ */
+extern void FP12_usqr(FP12 *x, FP12 *y);
+/**	@brief Squaring an FP12
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP12 instance
+ */
+extern void FP12_sqr(FP12 *x, FP12 *y);
+/**	@brief Fast multiplication of two sparse FP12s that arises from ATE pairing line functions
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_smul(FP12 *x, FP12 *y);
+
+/**	@brief Fast multiplication of what may be sparse multiplicands
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_ssmul(FP12 *x, FP12 *y);
+
+
+/**	@brief Full unconditional Multiplication of two FP12s
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, the multiplier
+ */
+extern void FP12_mul(FP12 *x, FP12 *y);
+
+/**	@brief Inverting an FP12
+ *
+	@param x FP12 instance, on exit = 1/y
+	@param y FP12 instance
+	@param t D_TYPE or M_TYPE twist
+ */
+extern void FP12_inv(FP12 *x, FP12 *y);
+/**	@brief Raises an FP12 to the power of a BIG
+ *
+	@param r FP12 instance, on exit = y^b
+	@param x FP12 instance
+	@param b BIG number
+ */
+extern void FP12_pow(FP12 *r, FP12 *x, B448_60::BIG b);
+/**	@brief Raises an FP12 instance x to a small integer power, side-channel resistant
+ *
+	@param x FP12 instance, on exit = x^i
+	@param i small integer exponent
+	@param b maximum number of bits in exponent
+ */
+extern void FP12_pinpow(FP12 *x, int i, int b);
+
+/**	@brief Raises an FP12 instance x to a BIG power, compressed to FP4
+ *
+	@param c FP4 instance, on exit = x^(e mod r) as FP4
+	@param x FP12 input
+	@param e BIG exponent
+	@param r BIG group order
+ */
+extern void FP12_compow(FP4 *c, FP12 *x, B448_60::BIG e, B448_60::BIG r);
+
+/**	@brief Calculate x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3], side-channel resistant
+ *
+	@param r FP12 instance, on exit = x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3]
+	@param x FP12 array with 4 FP12s
+	@param b BIG array of 4 exponents
+ */
+extern void FP12_pow4(FP12 *r, FP12 *x, B448_60::BIG *b);
+/**	@brief Raises an FP12 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP12 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP12_frob(FP12 *x, FP2 *f);
+/**	@brief Reduces all components of possibly unreduced FP12 mod Modulus
+ *
+	@param x FP12 instance, on exit reduced mod Modulus
+ */
+extern void FP12_reduce(FP12 *x);
+/**	@brief Normalises the components of an FP12
+ *
+	@param x FP12 instance to be normalised
+ */
+extern void FP12_norm(FP12 *x);
+/**	@brief Formats and outputs an FP12 to the console
+ *
+	@param x FP12 instance to be printed
+ */
+extern void FP12_output(FP12 *x);
+/**	@brief Formats and outputs an FP12 instance to an octet string
+ *
+	Serializes the components of an FP12 to big-endian base 256 form.
+	@param S output octet string
+	@param x FP12 instance to be converted to an octet string
+ */
+extern void FP12_toOctet(octet *S, FP12 *x);
+/**	@brief Creates an FP12 instance from an octet string
+ *
+	De-serializes the components of an FP12 to create an FP12 from big-endian base 256 components.
+	@param x FP12 instance to be created from an octet string
+	@param S input octet string
+
+ */
+extern void FP12_fromOctet(FP12 *x, octet *S);
+/**	@brief Calculate the trace of an FP12
+ *
+	@param t FP4 trace of x, on exit = tr(x)
+	@param x FP12 instance
+
+ */
+extern void FP12_trace(FP4 *t, FP12 *x);
+
+/**	@brief Conditional copy of FP12 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP12 instance, set to y if s!=0
+	@param y another FP12 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP12_cmove(FP12 *x, FP12 *y, int s);
+
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp12_BLS12461.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp12_BLS12461.h
new file mode 100644
index 0000000..76901af
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp12_BLS12461.h
@@ -0,0 +1,230 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP12_BLS12461_H
+#define FP12_BLS12461_H
+
+#include "fp4_BLS12461.h"
+
+using namespace core;
+
+namespace BLS12461 {
+/**
+	@brief FP12 Structure - towered over three FP4
+*/
+
+typedef struct
+{
+    FP4 a; /**< first part of FP12 */
+    FP4 b; /**< second part of FP12 */
+    FP4 c; /**< third part of FP12 */
+    int type;
+} FP12;
+
+extern const B464_60::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B464_60::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+/* FP12 prototypes */
+/**	@brief Tests for FP12 equal to zero
+ *
+	@param x FP12 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP12_iszilch(FP12 *x);
+/**	@brief Tests for FP12 equal to unity
+ *
+	@param x FP12 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP12_isunity(FP12 *x);
+/**	@brief Copy FP12 to another FP12
+ *
+	@param x FP12 instance, on exit = y
+	@param y FP12 instance to be copied
+ */
+extern void FP12_copy(FP12 *x, FP12 *y);
+/**	@brief Set FP12 to unity
+ *
+	@param x FP12 instance to be set to one
+ */
+extern void FP12_one(FP12 *x);
+
+/**	@brief Set FP12 to zero
+ *
+	@param x FP12 instance to be set to zero
+ */
+extern void FP12_zero(FP12 *x);
+
+/**	@brief Tests for equality of two FP12s
+ *
+	@param x FP12 instance to be compared
+	@param y FP12 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP12_equals(FP12 *x, FP12 *y);
+/**	@brief Conjugation of FP12
+ *
+	If y=(a,b,c) (where a,b,c are its three FP4 components) on exit x=(conj(a),-conj(b),conj(c))
+	@param x FP12 instance, on exit = conj(y)
+	@param y FP12 instance
+ */
+extern void FP12_conj(FP12 *x, FP12 *y);
+/**	@brief Initialise FP12 from single FP4
+ *
+	Sets first FP4 component of an FP12, other components set to zero
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP4
+ */
+extern void FP12_from_FP4(FP12 *x, FP4 *a);
+/**	@brief Initialise FP12 from three FP4s
+ *
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP12
+	@param b FP4 to form second part of FP12
+	@param c FP4 to form third part of FP12
+ */
+extern void FP12_from_FP4s(FP12 *x, FP4 *a, FP4* b, FP4 *c);
+/**	@brief Fast Squaring of an FP12 in "unitary" form
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP4 instance, must be unitary
+ */
+extern void FP12_usqr(FP12 *x, FP12 *y);
+/**	@brief Squaring an FP12
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP12 instance
+ */
+extern void FP12_sqr(FP12 *x, FP12 *y);
+/**	@brief Fast multiplication of two sparse FP12s that arises from ATE pairing line functions
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_smul(FP12 *x, FP12 *y);
+
+/**	@brief Fast multiplication of what may be sparse multiplicands
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_ssmul(FP12 *x, FP12 *y);
+
+
+/**	@brief Full unconditional Multiplication of two FP12s
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, the multiplier
+ */
+extern void FP12_mul(FP12 *x, FP12 *y);
+
+/**	@brief Inverting an FP12
+ *
+	@param x FP12 instance, on exit = 1/y
+	@param y FP12 instance
+	@param t D_TYPE or M_TYPE twist
+ */
+extern void FP12_inv(FP12 *x, FP12 *y);
+/**	@brief Raises an FP12 to the power of a BIG
+ *
+	@param r FP12 instance, on exit = y^b
+	@param x FP12 instance
+	@param b BIG number
+ */
+extern void FP12_pow(FP12 *r, FP12 *x, B464_60::BIG b);
+/**	@brief Raises an FP12 instance x to a small integer power, side-channel resistant
+ *
+	@param x FP12 instance, on exit = x^i
+	@param i small integer exponent
+	@param b maximum number of bits in exponent
+ */
+extern void FP12_pinpow(FP12 *x, int i, int b);
+
+/**	@brief Raises an FP12 instance x to a BIG power, compressed to FP4
+ *
+	@param c FP4 instance, on exit = x^(e mod r) as FP4
+	@param x FP12 input
+	@param e BIG exponent
+	@param r BIG group order
+ */
+extern void FP12_compow(FP4 *c, FP12 *x, B464_60::BIG e, B464_60::BIG r);
+
+/**	@brief Calculate x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3], side-channel resistant
+ *
+	@param r FP12 instance, on exit = x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3]
+	@param x FP12 array with 4 FP12s
+	@param b BIG array of 4 exponents
+ */
+extern void FP12_pow4(FP12 *r, FP12 *x, B464_60::BIG *b);
+/**	@brief Raises an FP12 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP12 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP12_frob(FP12 *x, FP2 *f);
+/**	@brief Reduces all components of possibly unreduced FP12 mod Modulus
+ *
+	@param x FP12 instance, on exit reduced mod Modulus
+ */
+extern void FP12_reduce(FP12 *x);
+/**	@brief Normalises the components of an FP12
+ *
+	@param x FP12 instance to be normalised
+ */
+extern void FP12_norm(FP12 *x);
+/**	@brief Formats and outputs an FP12 to the console
+ *
+	@param x FP12 instance to be printed
+ */
+extern void FP12_output(FP12 *x);
+/**	@brief Formats and outputs an FP12 instance to an octet string
+ *
+	Serializes the components of an FP12 to big-endian base 256 form.
+	@param S output octet string
+	@param x FP12 instance to be converted to an octet string
+ */
+extern void FP12_toOctet(octet *S, FP12 *x);
+/**	@brief Creates an FP12 instance from an octet string
+ *
+	De-serializes the components of an FP12 to create an FP12 from big-endian base 256 components.
+	@param x FP12 instance to be created from an octet string
+	@param S input octet string
+
+ */
+extern void FP12_fromOctet(FP12 *x, octet *S);
+/**	@brief Calculate the trace of an FP12
+ *
+	@param t FP4 trace of x, on exit = tr(x)
+	@param x FP12 instance
+
+ */
+extern void FP12_trace(FP4 *t, FP12 *x);
+
+/**	@brief Conditional copy of FP12 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP12 instance, set to y if s!=0
+	@param y another FP12 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP12_cmove(FP12 *x, FP12 *y, int s);
+
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp12_BN158.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp12_BN158.h
new file mode 100644
index 0000000..1a68a7a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp12_BN158.h
@@ -0,0 +1,230 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP12_BN158_H
+#define FP12_BN158_H
+
+#include "fp4_BN158.h"
+
+using namespace core;
+
+namespace BN158 {
+/**
+	@brief FP12 Structure - towered over three FP4
+*/
+
+typedef struct
+{
+    FP4 a; /**< first part of FP12 */
+    FP4 b; /**< second part of FP12 */
+    FP4 c; /**< third part of FP12 */
+    int type;
+} FP12;
+
+extern const B160_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B160_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+/* FP12 prototypes */
+/**	@brief Tests for FP12 equal to zero
+ *
+	@param x FP12 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP12_iszilch(FP12 *x);
+/**	@brief Tests for FP12 equal to unity
+ *
+	@param x FP12 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP12_isunity(FP12 *x);
+/**	@brief Copy FP12 to another FP12
+ *
+	@param x FP12 instance, on exit = y
+	@param y FP12 instance to be copied
+ */
+extern void FP12_copy(FP12 *x, FP12 *y);
+/**	@brief Set FP12 to unity
+ *
+	@param x FP12 instance to be set to one
+ */
+extern void FP12_one(FP12 *x);
+
+/**	@brief Set FP12 to zero
+ *
+	@param x FP12 instance to be set to zero
+ */
+extern void FP12_zero(FP12 *x);
+
+/**	@brief Tests for equality of two FP12s
+ *
+	@param x FP12 instance to be compared
+	@param y FP12 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP12_equals(FP12 *x, FP12 *y);
+/**	@brief Conjugation of FP12
+ *
+	If y=(a,b,c) (where a,b,c are its three FP4 components) on exit x=(conj(a),-conj(b),conj(c))
+	@param x FP12 instance, on exit = conj(y)
+	@param y FP12 instance
+ */
+extern void FP12_conj(FP12 *x, FP12 *y);
+/**	@brief Initialise FP12 from single FP4
+ *
+	Sets first FP4 component of an FP12, other components set to zero
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP4
+ */
+extern void FP12_from_FP4(FP12 *x, FP4 *a);
+/**	@brief Initialise FP12 from three FP4s
+ *
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP12
+	@param b FP4 to form second part of FP12
+	@param c FP4 to form third part of FP12
+ */
+extern void FP12_from_FP4s(FP12 *x, FP4 *a, FP4* b, FP4 *c);
+/**	@brief Fast Squaring of an FP12 in "unitary" form
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP4 instance, must be unitary
+ */
+extern void FP12_usqr(FP12 *x, FP12 *y);
+/**	@brief Squaring an FP12
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP12 instance
+ */
+extern void FP12_sqr(FP12 *x, FP12 *y);
+/**	@brief Fast multiplication of two sparse FP12s that arises from ATE pairing line functions
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_smul(FP12 *x, FP12 *y);
+
+/**	@brief Fast multiplication of what may be sparse multiplicands
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_ssmul(FP12 *x, FP12 *y);
+
+
+/**	@brief Full unconditional Multiplication of two FP12s
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, the multiplier
+ */
+extern void FP12_mul(FP12 *x, FP12 *y);
+
+/**	@brief Inverting an FP12
+ *
+	@param x FP12 instance, on exit = 1/y
+	@param y FP12 instance
+	@param t D_TYPE or M_TYPE twist
+ */
+extern void FP12_inv(FP12 *x, FP12 *y);
+/**	@brief Raises an FP12 to the power of a BIG
+ *
+	@param r FP12 instance, on exit = y^b
+	@param x FP12 instance
+	@param b BIG number
+ */
+extern void FP12_pow(FP12 *r, FP12 *x, B160_56::BIG b);
+/**	@brief Raises an FP12 instance x to a small integer power, side-channel resistant
+ *
+	@param x FP12 instance, on exit = x^i
+	@param i small integer exponent
+	@param b maximum number of bits in exponent
+ */
+extern void FP12_pinpow(FP12 *x, int i, int b);
+
+/**	@brief Raises an FP12 instance x to a BIG power, compressed to FP4
+ *
+	@param c FP4 instance, on exit = x^(e mod r) as FP4
+	@param x FP12 input
+	@param e BIG exponent
+	@param r BIG group order
+ */
+extern void FP12_compow(FP4 *c, FP12 *x, B160_56::BIG e, B160_56::BIG r);
+
+/**	@brief Calculate x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3], side-channel resistant
+ *
+	@param r FP12 instance, on exit = x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3]
+	@param x FP12 array with 4 FP12s
+	@param b BIG array of 4 exponents
+ */
+extern void FP12_pow4(FP12 *r, FP12 *x, B160_56::BIG *b);
+/**	@brief Raises an FP12 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP12 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP12_frob(FP12 *x, FP2 *f);
+/**	@brief Reduces all components of possibly unreduced FP12 mod Modulus
+ *
+	@param x FP12 instance, on exit reduced mod Modulus
+ */
+extern void FP12_reduce(FP12 *x);
+/**	@brief Normalises the components of an FP12
+ *
+	@param x FP12 instance to be normalised
+ */
+extern void FP12_norm(FP12 *x);
+/**	@brief Formats and outputs an FP12 to the console
+ *
+	@param x FP12 instance to be printed
+ */
+extern void FP12_output(FP12 *x);
+/**	@brief Formats and outputs an FP12 instance to an octet string
+ *
+	Serializes the components of an FP12 to big-endian base 256 form.
+	@param S output octet string
+	@param x FP12 instance to be converted to an octet string
+ */
+extern void FP12_toOctet(octet *S, FP12 *x);
+/**	@brief Creates an FP12 instance from an octet string
+ *
+	De-serializes the components of an FP12 to create an FP12 from big-endian base 256 components.
+	@param x FP12 instance to be created from an octet string
+	@param S input octet string
+
+ */
+extern void FP12_fromOctet(FP12 *x, octet *S);
+/**	@brief Calculate the trace of an FP12
+ *
+	@param t FP4 trace of x, on exit = tr(x)
+	@param x FP12 instance
+
+ */
+extern void FP12_trace(FP4 *t, FP12 *x);
+
+/**	@brief Conditional copy of FP12 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP12 instance, set to y if s!=0
+	@param y another FP12 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP12_cmove(FP12 *x, FP12 *y, int s);
+
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp12_BN254.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp12_BN254.h
new file mode 100644
index 0000000..9d34371
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp12_BN254.h
@@ -0,0 +1,230 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP12_BN254_H
+#define FP12_BN254_H
+
+#include "fp4_BN254.h"
+
+using namespace core;
+
+namespace BN254 {
+/**
+	@brief FP12 Structure - towered over three FP4
+*/
+
+typedef struct
+{
+    FP4 a; /**< first part of FP12 */
+    FP4 b; /**< second part of FP12 */
+    FP4 c; /**< third part of FP12 */
+    int type;
+} FP12;
+
+extern const B256_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+/* FP12 prototypes */
+/**	@brief Tests for FP12 equal to zero
+ *
+	@param x FP12 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP12_iszilch(FP12 *x);
+/**	@brief Tests for FP12 equal to unity
+ *
+	@param x FP12 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP12_isunity(FP12 *x);
+/**	@brief Copy FP12 to another FP12
+ *
+	@param x FP12 instance, on exit = y
+	@param y FP12 instance to be copied
+ */
+extern void FP12_copy(FP12 *x, FP12 *y);
+/**	@brief Set FP12 to unity
+ *
+	@param x FP12 instance to be set to one
+ */
+extern void FP12_one(FP12 *x);
+
+/**	@brief Set FP12 to zero
+ *
+	@param x FP12 instance to be set to zero
+ */
+extern void FP12_zero(FP12 *x);
+
+/**	@brief Tests for equality of two FP12s
+ *
+	@param x FP12 instance to be compared
+	@param y FP12 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP12_equals(FP12 *x, FP12 *y);
+/**	@brief Conjugation of FP12
+ *
+	If y=(a,b,c) (where a,b,c are its three FP4 components) on exit x=(conj(a),-conj(b),conj(c))
+	@param x FP12 instance, on exit = conj(y)
+	@param y FP12 instance
+ */
+extern void FP12_conj(FP12 *x, FP12 *y);
+/**	@brief Initialise FP12 from single FP4
+ *
+	Sets first FP4 component of an FP12, other components set to zero
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP4
+ */
+extern void FP12_from_FP4(FP12 *x, FP4 *a);
+/**	@brief Initialise FP12 from three FP4s
+ *
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP12
+	@param b FP4 to form second part of FP12
+	@param c FP4 to form third part of FP12
+ */
+extern void FP12_from_FP4s(FP12 *x, FP4 *a, FP4* b, FP4 *c);
+/**	@brief Fast Squaring of an FP12 in "unitary" form
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP4 instance, must be unitary
+ */
+extern void FP12_usqr(FP12 *x, FP12 *y);
+/**	@brief Squaring an FP12
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP12 instance
+ */
+extern void FP12_sqr(FP12 *x, FP12 *y);
+/**	@brief Fast multiplication of two sparse FP12s that arises from ATE pairing line functions
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_smul(FP12 *x, FP12 *y);
+
+/**	@brief Fast multiplication of what may be sparse multiplicands
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_ssmul(FP12 *x, FP12 *y);
+
+
+/**	@brief Full unconditional Multiplication of two FP12s
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, the multiplier
+ */
+extern void FP12_mul(FP12 *x, FP12 *y);
+
+/**	@brief Inverting an FP12
+ *
+	@param x FP12 instance, on exit = 1/y
+	@param y FP12 instance
+	@param t D_TYPE or M_TYPE twist
+ */
+extern void FP12_inv(FP12 *x, FP12 *y);
+/**	@brief Raises an FP12 to the power of a BIG
+ *
+	@param r FP12 instance, on exit = y^b
+	@param x FP12 instance
+	@param b BIG number
+ */
+extern void FP12_pow(FP12 *r, FP12 *x, B256_56::BIG b);
+/**	@brief Raises an FP12 instance x to a small integer power, side-channel resistant
+ *
+	@param x FP12 instance, on exit = x^i
+	@param i small integer exponent
+	@param b maximum number of bits in exponent
+ */
+extern void FP12_pinpow(FP12 *x, int i, int b);
+
+/**	@brief Raises an FP12 instance x to a BIG power, compressed to FP4
+ *
+	@param c FP4 instance, on exit = x^(e mod r) as FP4
+	@param x FP12 input
+	@param e BIG exponent
+	@param r BIG group order
+ */
+extern void FP12_compow(FP4 *c, FP12 *x, B256_56::BIG e, B256_56::BIG r);
+
+/**	@brief Calculate x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3], side-channel resistant
+ *
+	@param r FP12 instance, on exit = x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3]
+	@param x FP12 array with 4 FP12s
+	@param b BIG array of 4 exponents
+ */
+extern void FP12_pow4(FP12 *r, FP12 *x, B256_56::BIG *b);
+/**	@brief Raises an FP12 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP12 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP12_frob(FP12 *x, FP2 *f);
+/**	@brief Reduces all components of possibly unreduced FP12 mod Modulus
+ *
+	@param x FP12 instance, on exit reduced mod Modulus
+ */
+extern void FP12_reduce(FP12 *x);
+/**	@brief Normalises the components of an FP12
+ *
+	@param x FP12 instance to be normalised
+ */
+extern void FP12_norm(FP12 *x);
+/**	@brief Formats and outputs an FP12 to the console
+ *
+	@param x FP12 instance to be printed
+ */
+extern void FP12_output(FP12 *x);
+/**	@brief Formats and outputs an FP12 instance to an octet string
+ *
+	Serializes the components of an FP12 to big-endian base 256 form.
+	@param S output octet string
+	@param x FP12 instance to be converted to an octet string
+ */
+extern void FP12_toOctet(octet *S, FP12 *x);
+/**	@brief Creates an FP12 instance from an octet string
+ *
+	De-serializes the components of an FP12 to create an FP12 from big-endian base 256 components.
+	@param x FP12 instance to be created from an octet string
+	@param S input octet string
+
+ */
+extern void FP12_fromOctet(FP12 *x, octet *S);
+/**	@brief Calculate the trace of an FP12
+ *
+	@param t FP4 trace of x, on exit = tr(x)
+	@param x FP12 instance
+
+ */
+extern void FP12_trace(FP4 *t, FP12 *x);
+
+/**	@brief Conditional copy of FP12 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP12 instance, set to y if s!=0
+	@param y another FP12 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP12_cmove(FP12 *x, FP12 *y, int s);
+
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp12_BN254CX.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp12_BN254CX.h
new file mode 100644
index 0000000..bcdb4b8
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp12_BN254CX.h
@@ -0,0 +1,230 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP12_BN254CX_H
+#define FP12_BN254CX_H
+
+#include "fp4_BN254CX.h"
+
+using namespace core;
+
+namespace BN254CX {
+/**
+	@brief FP12 Structure - towered over three FP4
+*/
+
+typedef struct
+{
+    FP4 a; /**< first part of FP12 */
+    FP4 b; /**< second part of FP12 */
+    FP4 c; /**< third part of FP12 */
+    int type;
+} FP12;
+
+extern const B256_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+/* FP12 prototypes */
+/**	@brief Tests for FP12 equal to zero
+ *
+	@param x FP12 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP12_iszilch(FP12 *x);
+/**	@brief Tests for FP12 equal to unity
+ *
+	@param x FP12 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP12_isunity(FP12 *x);
+/**	@brief Copy FP12 to another FP12
+ *
+	@param x FP12 instance, on exit = y
+	@param y FP12 instance to be copied
+ */
+extern void FP12_copy(FP12 *x, FP12 *y);
+/**	@brief Set FP12 to unity
+ *
+	@param x FP12 instance to be set to one
+ */
+extern void FP12_one(FP12 *x);
+
+/**	@brief Set FP12 to zero
+ *
+	@param x FP12 instance to be set to zero
+ */
+extern void FP12_zero(FP12 *x);
+
+/**	@brief Tests for equality of two FP12s
+ *
+	@param x FP12 instance to be compared
+	@param y FP12 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP12_equals(FP12 *x, FP12 *y);
+/**	@brief Conjugation of FP12
+ *
+	If y=(a,b,c) (where a,b,c are its three FP4 components) on exit x=(conj(a),-conj(b),conj(c))
+	@param x FP12 instance, on exit = conj(y)
+	@param y FP12 instance
+ */
+extern void FP12_conj(FP12 *x, FP12 *y);
+/**	@brief Initialise FP12 from single FP4
+ *
+	Sets first FP4 component of an FP12, other components set to zero
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP4
+ */
+extern void FP12_from_FP4(FP12 *x, FP4 *a);
+/**	@brief Initialise FP12 from three FP4s
+ *
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP12
+	@param b FP4 to form second part of FP12
+	@param c FP4 to form third part of FP12
+ */
+extern void FP12_from_FP4s(FP12 *x, FP4 *a, FP4* b, FP4 *c);
+/**	@brief Fast Squaring of an FP12 in "unitary" form
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP4 instance, must be unitary
+ */
+extern void FP12_usqr(FP12 *x, FP12 *y);
+/**	@brief Squaring an FP12
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP12 instance
+ */
+extern void FP12_sqr(FP12 *x, FP12 *y);
+/**	@brief Fast multiplication of two sparse FP12s that arises from ATE pairing line functions
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_smul(FP12 *x, FP12 *y);
+
+/**	@brief Fast multiplication of what may be sparse multiplicands
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_ssmul(FP12 *x, FP12 *y);
+
+
+/**	@brief Full unconditional Multiplication of two FP12s
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, the multiplier
+ */
+extern void FP12_mul(FP12 *x, FP12 *y);
+
+/**	@brief Inverting an FP12
+ *
+	@param x FP12 instance, on exit = 1/y
+	@param y FP12 instance
+	@param t D_TYPE or M_TYPE twist
+ */
+extern void FP12_inv(FP12 *x, FP12 *y);
+/**	@brief Raises an FP12 to the power of a BIG
+ *
+	@param r FP12 instance, on exit = y^b
+	@param x FP12 instance
+	@param b BIG number
+ */
+extern void FP12_pow(FP12 *r, FP12 *x, B256_56::BIG b);
+/**	@brief Raises an FP12 instance x to a small integer power, side-channel resistant
+ *
+	@param x FP12 instance, on exit = x^i
+	@param i small integer exponent
+	@param b maximum number of bits in exponent
+ */
+extern void FP12_pinpow(FP12 *x, int i, int b);
+
+/**	@brief Raises an FP12 instance x to a BIG power, compressed to FP4
+ *
+	@param c FP4 instance, on exit = x^(e mod r) as FP4
+	@param x FP12 input
+	@param e BIG exponent
+	@param r BIG group order
+ */
+extern void FP12_compow(FP4 *c, FP12 *x, B256_56::BIG e, B256_56::BIG r);
+
+/**	@brief Calculate x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3], side-channel resistant
+ *
+	@param r FP12 instance, on exit = x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3]
+	@param x FP12 array with 4 FP12s
+	@param b BIG array of 4 exponents
+ */
+extern void FP12_pow4(FP12 *r, FP12 *x, B256_56::BIG *b);
+/**	@brief Raises an FP12 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP12 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP12_frob(FP12 *x, FP2 *f);
+/**	@brief Reduces all components of possibly unreduced FP12 mod Modulus
+ *
+	@param x FP12 instance, on exit reduced mod Modulus
+ */
+extern void FP12_reduce(FP12 *x);
+/**	@brief Normalises the components of an FP12
+ *
+	@param x FP12 instance to be normalised
+ */
+extern void FP12_norm(FP12 *x);
+/**	@brief Formats and outputs an FP12 to the console
+ *
+	@param x FP12 instance to be printed
+ */
+extern void FP12_output(FP12 *x);
+/**	@brief Formats and outputs an FP12 instance to an octet string
+ *
+	Serializes the components of an FP12 to big-endian base 256 form.
+	@param S output octet string
+	@param x FP12 instance to be converted to an octet string
+ */
+extern void FP12_toOctet(octet *S, FP12 *x);
+/**	@brief Creates an FP12 instance from an octet string
+ *
+	De-serializes the components of an FP12 to create an FP12 from big-endian base 256 components.
+	@param x FP12 instance to be created from an octet string
+	@param S input octet string
+
+ */
+extern void FP12_fromOctet(FP12 *x, octet *S);
+/**	@brief Calculate the trace of an FP12
+ *
+	@param t FP4 trace of x, on exit = tr(x)
+	@param x FP12 instance
+
+ */
+extern void FP12_trace(FP4 *t, FP12 *x);
+
+/**	@brief Conditional copy of FP12 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP12 instance, set to y if s!=0
+	@param y another FP12 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP12_cmove(FP12 *x, FP12 *y, int s);
+
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp12_BN462.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp12_BN462.h
new file mode 100644
index 0000000..2fcd719
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp12_BN462.h
@@ -0,0 +1,230 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP12_BN462_H
+#define FP12_BN462_H
+
+#include "fp4_BN462.h"
+
+using namespace core;
+
+namespace BN462 {
+/**
+	@brief FP12 Structure - towered over three FP4
+*/
+
+typedef struct
+{
+    FP4 a; /**< first part of FP12 */
+    FP4 b; /**< second part of FP12 */
+    FP4 c; /**< third part of FP12 */
+    int type;
+} FP12;
+
+extern const B464_60::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B464_60::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+/* FP12 prototypes */
+/**	@brief Tests for FP12 equal to zero
+ *
+	@param x FP12 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP12_iszilch(FP12 *x);
+/**	@brief Tests for FP12 equal to unity
+ *
+	@param x FP12 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP12_isunity(FP12 *x);
+/**	@brief Copy FP12 to another FP12
+ *
+	@param x FP12 instance, on exit = y
+	@param y FP12 instance to be copied
+ */
+extern void FP12_copy(FP12 *x, FP12 *y);
+/**	@brief Set FP12 to unity
+ *
+	@param x FP12 instance to be set to one
+ */
+extern void FP12_one(FP12 *x);
+
+/**	@brief Set FP12 to zero
+ *
+	@param x FP12 instance to be set to zero
+ */
+extern void FP12_zero(FP12 *x);
+
+/**	@brief Tests for equality of two FP12s
+ *
+	@param x FP12 instance to be compared
+	@param y FP12 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP12_equals(FP12 *x, FP12 *y);
+/**	@brief Conjugation of FP12
+ *
+	If y=(a,b,c) (where a,b,c are its three FP4 components) on exit x=(conj(a),-conj(b),conj(c))
+	@param x FP12 instance, on exit = conj(y)
+	@param y FP12 instance
+ */
+extern void FP12_conj(FP12 *x, FP12 *y);
+/**	@brief Initialise FP12 from single FP4
+ *
+	Sets first FP4 component of an FP12, other components set to zero
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP4
+ */
+extern void FP12_from_FP4(FP12 *x, FP4 *a);
+/**	@brief Initialise FP12 from three FP4s
+ *
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP12
+	@param b FP4 to form second part of FP12
+	@param c FP4 to form third part of FP12
+ */
+extern void FP12_from_FP4s(FP12 *x, FP4 *a, FP4* b, FP4 *c);
+/**	@brief Fast Squaring of an FP12 in "unitary" form
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP4 instance, must be unitary
+ */
+extern void FP12_usqr(FP12 *x, FP12 *y);
+/**	@brief Squaring an FP12
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP12 instance
+ */
+extern void FP12_sqr(FP12 *x, FP12 *y);
+/**	@brief Fast multiplication of two sparse FP12s that arises from ATE pairing line functions
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_smul(FP12 *x, FP12 *y);
+
+/**	@brief Fast multiplication of what may be sparse multiplicands
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_ssmul(FP12 *x, FP12 *y);
+
+
+/**	@brief Full unconditional Multiplication of two FP12s
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, the multiplier
+ */
+extern void FP12_mul(FP12 *x, FP12 *y);
+
+/**	@brief Inverting an FP12
+ *
+	@param x FP12 instance, on exit = 1/y
+	@param y FP12 instance
+	@param t D_TYPE or M_TYPE twist
+ */
+extern void FP12_inv(FP12 *x, FP12 *y);
+/**	@brief Raises an FP12 to the power of a BIG
+ *
+	@param r FP12 instance, on exit = y^b
+	@param x FP12 instance
+	@param b BIG number
+ */
+extern void FP12_pow(FP12 *r, FP12 *x, B464_60::BIG b);
+/**	@brief Raises an FP12 instance x to a small integer power, side-channel resistant
+ *
+	@param x FP12 instance, on exit = x^i
+	@param i small integer exponent
+	@param b maximum number of bits in exponent
+ */
+extern void FP12_pinpow(FP12 *x, int i, int b);
+
+/**	@brief Raises an FP12 instance x to a BIG power, compressed to FP4
+ *
+	@param c FP4 instance, on exit = x^(e mod r) as FP4
+	@param x FP12 input
+	@param e BIG exponent
+	@param r BIG group order
+ */
+extern void FP12_compow(FP4 *c, FP12 *x, B464_60::BIG e, B464_60::BIG r);
+
+/**	@brief Calculate x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3], side-channel resistant
+ *
+	@param r FP12 instance, on exit = x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3]
+	@param x FP12 array with 4 FP12s
+	@param b BIG array of 4 exponents
+ */
+extern void FP12_pow4(FP12 *r, FP12 *x, B464_60::BIG *b);
+/**	@brief Raises an FP12 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP12 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP12_frob(FP12 *x, FP2 *f);
+/**	@brief Reduces all components of possibly unreduced FP12 mod Modulus
+ *
+	@param x FP12 instance, on exit reduced mod Modulus
+ */
+extern void FP12_reduce(FP12 *x);
+/**	@brief Normalises the components of an FP12
+ *
+	@param x FP12 instance to be normalised
+ */
+extern void FP12_norm(FP12 *x);
+/**	@brief Formats and outputs an FP12 to the console
+ *
+	@param x FP12 instance to be printed
+ */
+extern void FP12_output(FP12 *x);
+/**	@brief Formats and outputs an FP12 instance to an octet string
+ *
+	Serializes the components of an FP12 to big-endian base 256 form.
+	@param S output octet string
+	@param x FP12 instance to be converted to an octet string
+ */
+extern void FP12_toOctet(octet *S, FP12 *x);
+/**	@brief Creates an FP12 instance from an octet string
+ *
+	De-serializes the components of an FP12 to create an FP12 from big-endian base 256 components.
+	@param x FP12 instance to be created from an octet string
+	@param S input octet string
+
+ */
+extern void FP12_fromOctet(FP12 *x, octet *S);
+/**	@brief Calculate the trace of an FP12
+ *
+	@param t FP4 trace of x, on exit = tr(x)
+	@param x FP12 instance
+
+ */
+extern void FP12_trace(FP4 *t, FP12 *x);
+
+/**	@brief Conditional copy of FP12 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP12 instance, set to y if s!=0
+	@param y another FP12 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP12_cmove(FP12 *x, FP12 *y, int s);
+
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp12_FP256BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp12_FP256BN.h
new file mode 100644
index 0000000..7fb19c8
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp12_FP256BN.h
@@ -0,0 +1,230 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP12_FP256BN_H
+#define FP12_FP256BN_H
+
+#include "fp4_FP256BN.h"
+
+using namespace core;
+
+namespace FP256BN {
+/**
+	@brief FP12 Structure - towered over three FP4
+*/
+
+typedef struct
+{
+    FP4 a; /**< first part of FP12 */
+    FP4 b; /**< second part of FP12 */
+    FP4 c; /**< third part of FP12 */
+    int type;
+} FP12;
+
+extern const B256_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+/* FP12 prototypes */
+/**	@brief Tests for FP12 equal to zero
+ *
+	@param x FP12 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP12_iszilch(FP12 *x);
+/**	@brief Tests for FP12 equal to unity
+ *
+	@param x FP12 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP12_isunity(FP12 *x);
+/**	@brief Copy FP12 to another FP12
+ *
+	@param x FP12 instance, on exit = y
+	@param y FP12 instance to be copied
+ */
+extern void FP12_copy(FP12 *x, FP12 *y);
+/**	@brief Set FP12 to unity
+ *
+	@param x FP12 instance to be set to one
+ */
+extern void FP12_one(FP12 *x);
+
+/**	@brief Set FP12 to zero
+ *
+	@param x FP12 instance to be set to zero
+ */
+extern void FP12_zero(FP12 *x);
+
+/**	@brief Tests for equality of two FP12s
+ *
+	@param x FP12 instance to be compared
+	@param y FP12 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP12_equals(FP12 *x, FP12 *y);
+/**	@brief Conjugation of FP12
+ *
+	If y=(a,b,c) (where a,b,c are its three FP4 components) on exit x=(conj(a),-conj(b),conj(c))
+	@param x FP12 instance, on exit = conj(y)
+	@param y FP12 instance
+ */
+extern void FP12_conj(FP12 *x, FP12 *y);
+/**	@brief Initialise FP12 from single FP4
+ *
+	Sets first FP4 component of an FP12, other components set to zero
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP4
+ */
+extern void FP12_from_FP4(FP12 *x, FP4 *a);
+/**	@brief Initialise FP12 from three FP4s
+ *
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP12
+	@param b FP4 to form second part of FP12
+	@param c FP4 to form third part of FP12
+ */
+extern void FP12_from_FP4s(FP12 *x, FP4 *a, FP4* b, FP4 *c);
+/**	@brief Fast Squaring of an FP12 in "unitary" form
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP4 instance, must be unitary
+ */
+extern void FP12_usqr(FP12 *x, FP12 *y);
+/**	@brief Squaring an FP12
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP12 instance
+ */
+extern void FP12_sqr(FP12 *x, FP12 *y);
+/**	@brief Fast multiplication of two sparse FP12s that arises from ATE pairing line functions
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_smul(FP12 *x, FP12 *y);
+
+/**	@brief Fast multiplication of what may be sparse multiplicands
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_ssmul(FP12 *x, FP12 *y);
+
+
+/**	@brief Full unconditional Multiplication of two FP12s
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, the multiplier
+ */
+extern void FP12_mul(FP12 *x, FP12 *y);
+
+/**	@brief Inverting an FP12
+ *
+	@param x FP12 instance, on exit = 1/y
+	@param y FP12 instance
+	@param t D_TYPE or M_TYPE twist
+ */
+extern void FP12_inv(FP12 *x, FP12 *y);
+/**	@brief Raises an FP12 to the power of a BIG
+ *
+	@param r FP12 instance, on exit = y^b
+	@param x FP12 instance
+	@param b BIG number
+ */
+extern void FP12_pow(FP12 *r, FP12 *x, B256_56::BIG b);
+/**	@brief Raises an FP12 instance x to a small integer power, side-channel resistant
+ *
+	@param x FP12 instance, on exit = x^i
+	@param i small integer exponent
+	@param b maximum number of bits in exponent
+ */
+extern void FP12_pinpow(FP12 *x, int i, int b);
+
+/**	@brief Raises an FP12 instance x to a BIG power, compressed to FP4
+ *
+	@param c FP4 instance, on exit = x^(e mod r) as FP4
+	@param x FP12 input
+	@param e BIG exponent
+	@param r BIG group order
+ */
+extern void FP12_compow(FP4 *c, FP12 *x, B256_56::BIG e, B256_56::BIG r);
+
+/**	@brief Calculate x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3], side-channel resistant
+ *
+	@param r FP12 instance, on exit = x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3]
+	@param x FP12 array with 4 FP12s
+	@param b BIG array of 4 exponents
+ */
+extern void FP12_pow4(FP12 *r, FP12 *x, B256_56::BIG *b);
+/**	@brief Raises an FP12 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP12 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP12_frob(FP12 *x, FP2 *f);
+/**	@brief Reduces all components of possibly unreduced FP12 mod Modulus
+ *
+	@param x FP12 instance, on exit reduced mod Modulus
+ */
+extern void FP12_reduce(FP12 *x);
+/**	@brief Normalises the components of an FP12
+ *
+	@param x FP12 instance to be normalised
+ */
+extern void FP12_norm(FP12 *x);
+/**	@brief Formats and outputs an FP12 to the console
+ *
+	@param x FP12 instance to be printed
+ */
+extern void FP12_output(FP12 *x);
+/**	@brief Formats and outputs an FP12 instance to an octet string
+ *
+	Serializes the components of an FP12 to big-endian base 256 form.
+	@param S output octet string
+	@param x FP12 instance to be converted to an octet string
+ */
+extern void FP12_toOctet(octet *S, FP12 *x);
+/**	@brief Creates an FP12 instance from an octet string
+ *
+	De-serializes the components of an FP12 to create an FP12 from big-endian base 256 components.
+	@param x FP12 instance to be created from an octet string
+	@param S input octet string
+
+ */
+extern void FP12_fromOctet(FP12 *x, octet *S);
+/**	@brief Calculate the trace of an FP12
+ *
+	@param t FP4 trace of x, on exit = tr(x)
+	@param x FP12 instance
+
+ */
+extern void FP12_trace(FP4 *t, FP12 *x);
+
+/**	@brief Conditional copy of FP12 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP12 instance, set to y if s!=0
+	@param y another FP12 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP12_cmove(FP12 *x, FP12 *y, int s);
+
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp12_FP512BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp12_FP512BN.h
new file mode 100644
index 0000000..2fc1921
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp12_FP512BN.h
@@ -0,0 +1,230 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP12_FP512BN_H
+#define FP12_FP512BN_H
+
+#include "fp4_FP512BN.h"
+
+using namespace core;
+
+namespace FP512BN {
+/**
+	@brief FP12 Structure - towered over three FP4
+*/
+
+typedef struct
+{
+    FP4 a; /**< first part of FP12 */
+    FP4 b; /**< second part of FP12 */
+    FP4 c; /**< third part of FP12 */
+    int type;
+} FP12;
+
+extern const B512_60::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B512_60::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+/* FP12 prototypes */
+/**	@brief Tests for FP12 equal to zero
+ *
+	@param x FP12 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP12_iszilch(FP12 *x);
+/**	@brief Tests for FP12 equal to unity
+ *
+	@param x FP12 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP12_isunity(FP12 *x);
+/**	@brief Copy FP12 to another FP12
+ *
+	@param x FP12 instance, on exit = y
+	@param y FP12 instance to be copied
+ */
+extern void FP12_copy(FP12 *x, FP12 *y);
+/**	@brief Set FP12 to unity
+ *
+	@param x FP12 instance to be set to one
+ */
+extern void FP12_one(FP12 *x);
+
+/**	@brief Set FP12 to zero
+ *
+	@param x FP12 instance to be set to zero
+ */
+extern void FP12_zero(FP12 *x);
+
+/**	@brief Tests for equality of two FP12s
+ *
+	@param x FP12 instance to be compared
+	@param y FP12 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP12_equals(FP12 *x, FP12 *y);
+/**	@brief Conjugation of FP12
+ *
+	If y=(a,b,c) (where a,b,c are its three FP4 components) on exit x=(conj(a),-conj(b),conj(c))
+	@param x FP12 instance, on exit = conj(y)
+	@param y FP12 instance
+ */
+extern void FP12_conj(FP12 *x, FP12 *y);
+/**	@brief Initialise FP12 from single FP4
+ *
+	Sets first FP4 component of an FP12, other components set to zero
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP4
+ */
+extern void FP12_from_FP4(FP12 *x, FP4 *a);
+/**	@brief Initialise FP12 from three FP4s
+ *
+	@param x FP12 instance to be initialised
+	@param a FP4 to form first part of FP12
+	@param b FP4 to form second part of FP12
+	@param c FP4 to form third part of FP12
+ */
+extern void FP12_from_FP4s(FP12 *x, FP4 *a, FP4* b, FP4 *c);
+/**	@brief Fast Squaring of an FP12 in "unitary" form
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP4 instance, must be unitary
+ */
+extern void FP12_usqr(FP12 *x, FP12 *y);
+/**	@brief Squaring an FP12
+ *
+	@param x FP12 instance, on exit = y^2
+	@param y FP12 instance
+ */
+extern void FP12_sqr(FP12 *x, FP12 *y);
+/**	@brief Fast multiplication of two sparse FP12s that arises from ATE pairing line functions
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_smul(FP12 *x, FP12 *y);
+
+/**	@brief Fast multiplication of what may be sparse multiplicands
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, of special form
+ */
+extern void FP12_ssmul(FP12 *x, FP12 *y);
+
+
+/**	@brief Full unconditional Multiplication of two FP12s
+ *
+	@param x FP12 instance, on exit = x*y
+	@param y FP12 instance, the multiplier
+ */
+extern void FP12_mul(FP12 *x, FP12 *y);
+
+/**	@brief Inverting an FP12
+ *
+	@param x FP12 instance, on exit = 1/y
+	@param y FP12 instance
+	@param t D_TYPE or M_TYPE twist
+ */
+extern void FP12_inv(FP12 *x, FP12 *y);
+/**	@brief Raises an FP12 to the power of a BIG
+ *
+	@param r FP12 instance, on exit = y^b
+	@param x FP12 instance
+	@param b BIG number
+ */
+extern void FP12_pow(FP12 *r, FP12 *x, B512_60::BIG b);
+/**	@brief Raises an FP12 instance x to a small integer power, side-channel resistant
+ *
+	@param x FP12 instance, on exit = x^i
+	@param i small integer exponent
+	@param b maximum number of bits in exponent
+ */
+extern void FP12_pinpow(FP12 *x, int i, int b);
+
+/**	@brief Raises an FP12 instance x to a BIG power, compressed to FP4
+ *
+	@param c FP4 instance, on exit = x^(e mod r) as FP4
+	@param x FP12 input
+	@param e BIG exponent
+	@param r BIG group order
+ */
+extern void FP12_compow(FP4 *c, FP12 *x, B512_60::BIG e, B512_60::BIG r);
+
+/**	@brief Calculate x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3], side-channel resistant
+ *
+	@param r FP12 instance, on exit = x[0]^b[0].x[1]^b[1].x[2]^b[2].x[3]^b[3]
+	@param x FP12 array with 4 FP12s
+	@param b BIG array of 4 exponents
+ */
+extern void FP12_pow4(FP12 *r, FP12 *x, B512_60::BIG *b);
+/**	@brief Raises an FP12 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP12 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP12_frob(FP12 *x, FP2 *f);
+/**	@brief Reduces all components of possibly unreduced FP12 mod Modulus
+ *
+	@param x FP12 instance, on exit reduced mod Modulus
+ */
+extern void FP12_reduce(FP12 *x);
+/**	@brief Normalises the components of an FP12
+ *
+	@param x FP12 instance to be normalised
+ */
+extern void FP12_norm(FP12 *x);
+/**	@brief Formats and outputs an FP12 to the console
+ *
+	@param x FP12 instance to be printed
+ */
+extern void FP12_output(FP12 *x);
+/**	@brief Formats and outputs an FP12 instance to an octet string
+ *
+	Serializes the components of an FP12 to big-endian base 256 form.
+	@param S output octet string
+	@param x FP12 instance to be converted to an octet string
+ */
+extern void FP12_toOctet(octet *S, FP12 *x);
+/**	@brief Creates an FP12 instance from an octet string
+ *
+	De-serializes the components of an FP12 to create an FP12 from big-endian base 256 components.
+	@param x FP12 instance to be created from an octet string
+	@param S input octet string
+
+ */
+extern void FP12_fromOctet(FP12 *x, octet *S);
+/**	@brief Calculate the trace of an FP12
+ *
+	@param t FP4 trace of x, on exit = tr(x)
+	@param x FP12 instance
+
+ */
+extern void FP12_trace(FP4 *t, FP12 *x);
+
+/**	@brief Conditional copy of FP12 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP12 instance, set to y if s!=0
+	@param y another FP12 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP12_cmove(FP12 *x, FP12 *y, int s);
+
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp16.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp16.h
new file mode 100644
index 0000000..348ac92
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp16.h
@@ -0,0 +1,308 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP16_YYY_H
+#define FP16_YYY_H
+
+#include "fp8_YYY.h"
+#include "config_curve_ZZZ.h"
+
+using namespace core;
+
+namespace YYY {
+
+/**
+	@brief FP16 Structure - towered over two FP4
+*/
+
+typedef struct
+{
+    FP8 a; /**< real part of FP16 */
+    FP8 b; /**< imaginary part of FP16 */
+} FP16;
+
+
+/* FP16 prototypes */
+/**	@brief Tests for FP16 equal to zero
+ *
+	@param x FP16 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP16_iszilch(FP16 *x);
+/**	@brief Tests for FP16 equal to unity
+ *
+	@param x FP16 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP16_isunity(FP16 *x);
+/**	@brief Tests for equality of two FP16s
+ *
+	@param x FP16 instance to be compared
+	@param y FP16 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP16_equals(FP16 *x, FP16 *y);
+
+/**	@brief Serialize in FP16  
+ *
+    @param b buffer for output
+	@param x FP16 number to be serialized
+ */
+extern void FP16_toBytes(char *b,FP16 *x);
+/**	@brief Serialize out FP16  
+ *
+	@param x FP16 number to be serialized
+    @param b buffer for input
+ */
+extern void FP16_fromBytes(FP16 *x,char *b);
+
+/**	@brief Tests for FP16 having only a real part and no imaginary part
+ *
+	@param x FP16 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP16_isreal(FP16 *x);
+/**	@brief Initialise FP16 from two FP8s
+ *
+	@param x FP16 instance to be initialised
+	@param a FP8 to form real part of FP16
+	@param b FP8 to form imaginary part of FP16
+ */
+extern void FP16_from_FP8s(FP16 *x, FP8 *a, FP8 *b);
+/**	@brief Initialise FP16 from single FP8
+ *
+	Imaginary part is set to zero
+	@param x FP16 instance to be initialised
+	@param a FP8 to form real part of FP16
+ */
+extern void FP16_from_FP8(FP16 *x, FP8 *a);
+
+/**	@brief Initialise FP16 from single FP8
+ *
+	real part is set to zero
+	@param x FP16 instance to be initialised
+	@param a FP8 to form imaginary part of FP16
+ */
+extern void FP16_from_FP8H(FP16 *x, FP8 *a);
+
+
+/**	@brief Copy FP16 to another FP16
+ *
+	@param x FP16 instance, on exit = y
+	@param y FP16 instance to be copied
+ */
+extern void FP16_copy(FP16 *x, FP16 *y);
+/**	@brief Set FP16 to zero
+ *
+	@param x FP16 instance to be set to zero
+ */
+extern void FP16_zero(FP16 *x);
+/**	@brief Set FP16 to unity
+ *
+	@param x FP16 instance to be set to one
+ */
+extern void FP16_one(FP16 *x);
+/**	@brief Negation of FP16
+ *
+	@param x FP16 instance, on exit = -y
+	@param y FP16 instance
+ */
+extern void FP16_neg(FP16 *x, FP16 *y);
+/**	@brief Conjugation of FP16
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP16 instance, on exit = conj(y)
+	@param y FP16 instance
+ */
+extern void FP16_conj(FP16 *x, FP16 *y);
+/**	@brief Negative conjugation of FP16
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP16 instance, on exit = -conj(y)
+	@param y FP16 instance
+ */
+extern void FP16_nconj(FP16 *x, FP16 *y);
+/**	@brief addition of two FP16s
+ *
+	@param x FP16 instance, on exit = y+z
+	@param y FP16 instance
+	@param z FP16 instance
+ */
+extern void FP16_add(FP16 *x, FP16 *y, FP16 *z);
+/**	@brief subtraction of two FP16s
+ *
+	@param x FP16 instance, on exit = y-z
+	@param y FP16 instance
+	@param z FP16 instance
+ */
+extern void FP16_sub(FP16 *x, FP16 *y, FP16 *z);
+/**	@brief Multiplication of an FP16 by an FP8
+ *
+	@param x FP16 instance, on exit = y*a
+	@param y FP16 instance
+	@param a FP4 multiplier
+ */
+extern void FP16_pmul(FP16 *x, FP16 *y, FP8 *a);
+
+/**	@brief Multiplication of an FP16 by an FP2
+ *
+	@param x FP16 instance, on exit = y*a
+	@param y FP16 instance
+	@param a FP2 multiplier
+ */
+extern void FP16_qmul(FP16 *x, FP16 *y, FP2 *a);
+
+
+/**	@brief Multiplication of an FP16 by an FP
+ *
+	@param x FP16 instance, on exit = y*a
+	@param y FP16 instance
+	@param a FP multiplier
+ */
+extern void FP16_tmul(FP16 *x, FP16 *y, FP *a);
+
+
+
+/**	@brief Multiplication of an FP16 by a small integer
+ *
+	@param x FP16 instance, on exit = y*i
+	@param y FP16 instance
+	@param i an integer
+ */
+extern void FP16_imul(FP16 *x, FP16 *y, int i);
+/**	@brief Squaring an FP16
+ *
+	@param x FP16 instance, on exit = y^2
+	@param y FP16 instance
+ */
+extern void FP16_sqr(FP16 *x, FP16 *y);
+/**	@brief Multiplication of two FP16s
+ *
+	@param x FP16 instance, on exit = y*z
+	@param y FP16 instance
+	@param z FP16 instance
+ */
+extern void FP16_mul(FP16 *x, FP16 *y, FP16 *z);
+/**	@brief Inverting an FP16
+ *
+	@param x FP16 instance, on exit = 1/y
+	@param y FP16 instance
+ */
+extern void FP16_inv(FP16 *x, FP16 *y);
+/**	@brief Formats and outputs an FP16 to the console
+ *
+	@param x FP16 instance to be printed
+ */
+extern void FP16_output(FP16 *x);
+/**	@brief Formats and outputs an FP16 to the console in raw form (for debugging)
+ *
+	@param x FP16 instance to be printed
+ */
+extern void FP16_rawoutput(FP16 *x);
+/**	@brief multiplies an FP16 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP16 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP16_times_i(FP16 *x);
+/**	@brief multiplies an FP16 instance by irreducible polynomial (1+sqrt(-1))
+ *
+	@param x FP16 instance, on exit = sqrt(1+sqrt(-1))^2*x
+ */
+extern void FP16_times_i2(FP16 *x);
+
+/**	@brief multiplies an FP16 instance by irreducible polynomial (1+sqrt(-1))
+ *
+	@param x FP16 instance, on exit = sqrt(1+sqrt(-1))^4*x
+ */
+extern void FP16_times_i4(FP16 *x);
+
+
+/**	@brief Normalises the components of an FP16
+ *
+	@param x FP16 instance to be normalised
+ */
+extern void FP16_norm(FP16 *x);
+/**	@brief Reduces all components of possibly unreduced FP16 mod Modulus
+ *
+	@param x FP16 instance, on exit reduced mod Modulus
+ */
+extern void FP16_reduce(FP16 *x);
+/**	@brief Raises an FP16 to the power of a BIG
+ *
+	@param x FP16 instance, on exit = y^b
+	@param y FP16 instance
+	@param b BIG number
+ */
+extern void FP16_pow(FP16 *x, FP16 *y, XXX::BIG b);
+/**	@brief Raises an FP16 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP16 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP16_frob(FP16 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP16 instance, on exit = w*x-conj(x)*y+z
+	@param w FP16 instance
+	@param x FP16 instance
+	@param y FP16 instance
+	@param z FP16 instance
+ */
+extern void FP16_xtr_A(FP16 *r, FP16 *w, FP16 *x, FP16 *y, FP16 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP16 instance, on exit = x^2-2*conj(x)
+	@param x FP16 instance
+ */
+extern void FP16_xtr_D(FP16 *r, FP16 *x);
+/**	@brief Calculates FP16 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP16 instance, on exit = trace(w^b)
+	@param x FP16 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP16_xtr_pow(FP16 *r, FP16 *x, XXX::BIG b);
+/**	@brief Calculates FP16 trace of c^a.d^b, where c and d are derived from FP16 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP16 instance, on exit = trace(c^a.d^b)
+	@param c FP16 instance, trace of an FP12
+	@param d FP16 instance, trace of an FP12
+	@param e FP16 instance, trace of an FP12
+	@param f FP16 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP16_xtr_pow2(FP16 *r, FP16 *c, FP16 *d, FP16 *e, FP16 *f, XXX::BIG a, XXX::BIG b);
+
+/**	@brief Conditional copy of FP16 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP16 instance, set to y if s!=0
+	@param y another FP16 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP16_cmove(FP16 *x, FP16 *y, int s);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp16_BLS48286.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp16_BLS48286.h
new file mode 100644
index 0000000..13fcccb
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp16_BLS48286.h
@@ -0,0 +1,308 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP16_BLS48286_H
+#define FP16_BLS48286_H
+
+#include "fp8_BLS48286.h"
+#include "config_curve_BLS48286.h"
+
+using namespace core;
+
+namespace BLS48286 {
+
+/**
+	@brief FP16 Structure - towered over two FP4
+*/
+
+typedef struct
+{
+    FP8 a; /**< real part of FP16 */
+    FP8 b; /**< imaginary part of FP16 */
+} FP16;
+
+
+/* FP16 prototypes */
+/**	@brief Tests for FP16 equal to zero
+ *
+	@param x FP16 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP16_iszilch(FP16 *x);
+/**	@brief Tests for FP16 equal to unity
+ *
+	@param x FP16 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP16_isunity(FP16 *x);
+/**	@brief Tests for equality of two FP16s
+ *
+	@param x FP16 instance to be compared
+	@param y FP16 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP16_equals(FP16 *x, FP16 *y);
+
+/**	@brief Serialize in FP16  
+ *
+    @param b buffer for output
+	@param x FP16 number to be serialized
+ */
+extern void FP16_toBytes(char *b,FP16 *x);
+/**	@brief Serialize out FP16  
+ *
+	@param x FP16 number to be serialized
+    @param b buffer for input
+ */
+extern void FP16_fromBytes(FP16 *x,char *b);
+
+/**	@brief Tests for FP16 having only a real part and no imaginary part
+ *
+	@param x FP16 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP16_isreal(FP16 *x);
+/**	@brief Initialise FP16 from two FP8s
+ *
+	@param x FP16 instance to be initialised
+	@param a FP8 to form real part of FP16
+	@param b FP8 to form imaginary part of FP16
+ */
+extern void FP16_from_FP8s(FP16 *x, FP8 *a, FP8 *b);
+/**	@brief Initialise FP16 from single FP8
+ *
+	Imaginary part is set to zero
+	@param x FP16 instance to be initialised
+	@param a FP8 to form real part of FP16
+ */
+extern void FP16_from_FP8(FP16 *x, FP8 *a);
+
+/**	@brief Initialise FP16 from single FP8
+ *
+	real part is set to zero
+	@param x FP16 instance to be initialised
+	@param a FP8 to form imaginary part of FP16
+ */
+extern void FP16_from_FP8H(FP16 *x, FP8 *a);
+
+
+/**	@brief Copy FP16 to another FP16
+ *
+	@param x FP16 instance, on exit = y
+	@param y FP16 instance to be copied
+ */
+extern void FP16_copy(FP16 *x, FP16 *y);
+/**	@brief Set FP16 to zero
+ *
+	@param x FP16 instance to be set to zero
+ */
+extern void FP16_zero(FP16 *x);
+/**	@brief Set FP16 to unity
+ *
+	@param x FP16 instance to be set to one
+ */
+extern void FP16_one(FP16 *x);
+/**	@brief Negation of FP16
+ *
+	@param x FP16 instance, on exit = -y
+	@param y FP16 instance
+ */
+extern void FP16_neg(FP16 *x, FP16 *y);
+/**	@brief Conjugation of FP16
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP16 instance, on exit = conj(y)
+	@param y FP16 instance
+ */
+extern void FP16_conj(FP16 *x, FP16 *y);
+/**	@brief Negative conjugation of FP16
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP16 instance, on exit = -conj(y)
+	@param y FP16 instance
+ */
+extern void FP16_nconj(FP16 *x, FP16 *y);
+/**	@brief addition of two FP16s
+ *
+	@param x FP16 instance, on exit = y+z
+	@param y FP16 instance
+	@param z FP16 instance
+ */
+extern void FP16_add(FP16 *x, FP16 *y, FP16 *z);
+/**	@brief subtraction of two FP16s
+ *
+	@param x FP16 instance, on exit = y-z
+	@param y FP16 instance
+	@param z FP16 instance
+ */
+extern void FP16_sub(FP16 *x, FP16 *y, FP16 *z);
+/**	@brief Multiplication of an FP16 by an FP8
+ *
+	@param x FP16 instance, on exit = y*a
+	@param y FP16 instance
+	@param a FP4 multiplier
+ */
+extern void FP16_pmul(FP16 *x, FP16 *y, FP8 *a);
+
+/**	@brief Multiplication of an FP16 by an FP2
+ *
+	@param x FP16 instance, on exit = y*a
+	@param y FP16 instance
+	@param a FP2 multiplier
+ */
+extern void FP16_qmul(FP16 *x, FP16 *y, FP2 *a);
+
+
+/**	@brief Multiplication of an FP16 by an FP
+ *
+	@param x FP16 instance, on exit = y*a
+	@param y FP16 instance
+	@param a FP multiplier
+ */
+extern void FP16_tmul(FP16 *x, FP16 *y, FP *a);
+
+
+
+/**	@brief Multiplication of an FP16 by a small integer
+ *
+	@param x FP16 instance, on exit = y*i
+	@param y FP16 instance
+	@param i an integer
+ */
+extern void FP16_imul(FP16 *x, FP16 *y, int i);
+/**	@brief Squaring an FP16
+ *
+	@param x FP16 instance, on exit = y^2
+	@param y FP16 instance
+ */
+extern void FP16_sqr(FP16 *x, FP16 *y);
+/**	@brief Multiplication of two FP16s
+ *
+	@param x FP16 instance, on exit = y*z
+	@param y FP16 instance
+	@param z FP16 instance
+ */
+extern void FP16_mul(FP16 *x, FP16 *y, FP16 *z);
+/**	@brief Inverting an FP16
+ *
+	@param x FP16 instance, on exit = 1/y
+	@param y FP16 instance
+ */
+extern void FP16_inv(FP16 *x, FP16 *y);
+/**	@brief Formats and outputs an FP16 to the console
+ *
+	@param x FP16 instance to be printed
+ */
+extern void FP16_output(FP16 *x);
+/**	@brief Formats and outputs an FP16 to the console in raw form (for debugging)
+ *
+	@param x FP16 instance to be printed
+ */
+extern void FP16_rawoutput(FP16 *x);
+/**	@brief multiplies an FP16 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP16 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP16_times_i(FP16 *x);
+/**	@brief multiplies an FP16 instance by irreducible polynomial (1+sqrt(-1))
+ *
+	@param x FP16 instance, on exit = sqrt(1+sqrt(-1))^2*x
+ */
+extern void FP16_times_i2(FP16 *x);
+
+/**	@brief multiplies an FP16 instance by irreducible polynomial (1+sqrt(-1))
+ *
+	@param x FP16 instance, on exit = sqrt(1+sqrt(-1))^4*x
+ */
+extern void FP16_times_i4(FP16 *x);
+
+
+/**	@brief Normalises the components of an FP16
+ *
+	@param x FP16 instance to be normalised
+ */
+extern void FP16_norm(FP16 *x);
+/**	@brief Reduces all components of possibly unreduced FP16 mod Modulus
+ *
+	@param x FP16 instance, on exit reduced mod Modulus
+ */
+extern void FP16_reduce(FP16 *x);
+/**	@brief Raises an FP16 to the power of a BIG
+ *
+	@param x FP16 instance, on exit = y^b
+	@param y FP16 instance
+	@param b BIG number
+ */
+extern void FP16_pow(FP16 *x, FP16 *y, B288_60::BIG b);
+/**	@brief Raises an FP16 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP16 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP16_frob(FP16 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP16 instance, on exit = w*x-conj(x)*y+z
+	@param w FP16 instance
+	@param x FP16 instance
+	@param y FP16 instance
+	@param z FP16 instance
+ */
+extern void FP16_xtr_A(FP16 *r, FP16 *w, FP16 *x, FP16 *y, FP16 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP16 instance, on exit = x^2-2*conj(x)
+	@param x FP16 instance
+ */
+extern void FP16_xtr_D(FP16 *r, FP16 *x);
+/**	@brief Calculates FP16 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP16 instance, on exit = trace(w^b)
+	@param x FP16 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP16_xtr_pow(FP16 *r, FP16 *x, B288_60::BIG b);
+/**	@brief Calculates FP16 trace of c^a.d^b, where c and d are derived from FP16 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP16 instance, on exit = trace(c^a.d^b)
+	@param c FP16 instance, trace of an FP12
+	@param d FP16 instance, trace of an FP12
+	@param e FP16 instance, trace of an FP12
+	@param f FP16 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP16_xtr_pow2(FP16 *r, FP16 *c, FP16 *d, FP16 *e, FP16 *f, B288_60::BIG a, B288_60::BIG b);
+
+/**	@brief Conditional copy of FP16 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP16 instance, set to y if s!=0
+	@param y another FP16 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP16_cmove(FP16 *x, FP16 *y, int s);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp16_BLS48556.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp16_BLS48556.h
new file mode 100644
index 0000000..7fde212
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp16_BLS48556.h
@@ -0,0 +1,308 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP16_BLS48556_H
+#define FP16_BLS48556_H
+
+#include "fp8_BLS48556.h"
+#include "config_curve_BLS48556.h"
+
+using namespace core;
+
+namespace BLS48556 {
+
+/**
+	@brief FP16 Structure - towered over two FP4
+*/
+
+typedef struct
+{
+    FP8 a; /**< real part of FP16 */
+    FP8 b; /**< imaginary part of FP16 */
+} FP16;
+
+
+/* FP16 prototypes */
+/**	@brief Tests for FP16 equal to zero
+ *
+	@param x FP16 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP16_iszilch(FP16 *x);
+/**	@brief Tests for FP16 equal to unity
+ *
+	@param x FP16 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP16_isunity(FP16 *x);
+/**	@brief Tests for equality of two FP16s
+ *
+	@param x FP16 instance to be compared
+	@param y FP16 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP16_equals(FP16 *x, FP16 *y);
+
+/**	@brief Serialize in FP16  
+ *
+    @param b buffer for output
+	@param x FP16 number to be serialized
+ */
+extern void FP16_toBytes(char *b,FP16 *x);
+/**	@brief Serialize out FP16  
+ *
+	@param x FP16 number to be serialized
+    @param b buffer for input
+ */
+extern void FP16_fromBytes(FP16 *x,char *b);
+
+/**	@brief Tests for FP16 having only a real part and no imaginary part
+ *
+	@param x FP16 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP16_isreal(FP16 *x);
+/**	@brief Initialise FP16 from two FP8s
+ *
+	@param x FP16 instance to be initialised
+	@param a FP8 to form real part of FP16
+	@param b FP8 to form imaginary part of FP16
+ */
+extern void FP16_from_FP8s(FP16 *x, FP8 *a, FP8 *b);
+/**	@brief Initialise FP16 from single FP8
+ *
+	Imaginary part is set to zero
+	@param x FP16 instance to be initialised
+	@param a FP8 to form real part of FP16
+ */
+extern void FP16_from_FP8(FP16 *x, FP8 *a);
+
+/**	@brief Initialise FP16 from single FP8
+ *
+	real part is set to zero
+	@param x FP16 instance to be initialised
+	@param a FP8 to form imaginary part of FP16
+ */
+extern void FP16_from_FP8H(FP16 *x, FP8 *a);
+
+
+/**	@brief Copy FP16 to another FP16
+ *
+	@param x FP16 instance, on exit = y
+	@param y FP16 instance to be copied
+ */
+extern void FP16_copy(FP16 *x, FP16 *y);
+/**	@brief Set FP16 to zero
+ *
+	@param x FP16 instance to be set to zero
+ */
+extern void FP16_zero(FP16 *x);
+/**	@brief Set FP16 to unity
+ *
+	@param x FP16 instance to be set to one
+ */
+extern void FP16_one(FP16 *x);
+/**	@brief Negation of FP16
+ *
+	@param x FP16 instance, on exit = -y
+	@param y FP16 instance
+ */
+extern void FP16_neg(FP16 *x, FP16 *y);
+/**	@brief Conjugation of FP16
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP16 instance, on exit = conj(y)
+	@param y FP16 instance
+ */
+extern void FP16_conj(FP16 *x, FP16 *y);
+/**	@brief Negative conjugation of FP16
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP16 instance, on exit = -conj(y)
+	@param y FP16 instance
+ */
+extern void FP16_nconj(FP16 *x, FP16 *y);
+/**	@brief addition of two FP16s
+ *
+	@param x FP16 instance, on exit = y+z
+	@param y FP16 instance
+	@param z FP16 instance
+ */
+extern void FP16_add(FP16 *x, FP16 *y, FP16 *z);
+/**	@brief subtraction of two FP16s
+ *
+	@param x FP16 instance, on exit = y-z
+	@param y FP16 instance
+	@param z FP16 instance
+ */
+extern void FP16_sub(FP16 *x, FP16 *y, FP16 *z);
+/**	@brief Multiplication of an FP16 by an FP8
+ *
+	@param x FP16 instance, on exit = y*a
+	@param y FP16 instance
+	@param a FP4 multiplier
+ */
+extern void FP16_pmul(FP16 *x, FP16 *y, FP8 *a);
+
+/**	@brief Multiplication of an FP16 by an FP2
+ *
+	@param x FP16 instance, on exit = y*a
+	@param y FP16 instance
+	@param a FP2 multiplier
+ */
+extern void FP16_qmul(FP16 *x, FP16 *y, FP2 *a);
+
+
+/**	@brief Multiplication of an FP16 by an FP
+ *
+	@param x FP16 instance, on exit = y*a
+	@param y FP16 instance
+	@param a FP multiplier
+ */
+extern void FP16_tmul(FP16 *x, FP16 *y, FP *a);
+
+
+
+/**	@brief Multiplication of an FP16 by a small integer
+ *
+	@param x FP16 instance, on exit = y*i
+	@param y FP16 instance
+	@param i an integer
+ */
+extern void FP16_imul(FP16 *x, FP16 *y, int i);
+/**	@brief Squaring an FP16
+ *
+	@param x FP16 instance, on exit = y^2
+	@param y FP16 instance
+ */
+extern void FP16_sqr(FP16 *x, FP16 *y);
+/**	@brief Multiplication of two FP16s
+ *
+	@param x FP16 instance, on exit = y*z
+	@param y FP16 instance
+	@param z FP16 instance
+ */
+extern void FP16_mul(FP16 *x, FP16 *y, FP16 *z);
+/**	@brief Inverting an FP16
+ *
+	@param x FP16 instance, on exit = 1/y
+	@param y FP16 instance
+ */
+extern void FP16_inv(FP16 *x, FP16 *y);
+/**	@brief Formats and outputs an FP16 to the console
+ *
+	@param x FP16 instance to be printed
+ */
+extern void FP16_output(FP16 *x);
+/**	@brief Formats and outputs an FP16 to the console in raw form (for debugging)
+ *
+	@param x FP16 instance to be printed
+ */
+extern void FP16_rawoutput(FP16 *x);
+/**	@brief multiplies an FP16 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP16 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP16_times_i(FP16 *x);
+/**	@brief multiplies an FP16 instance by irreducible polynomial (1+sqrt(-1))
+ *
+	@param x FP16 instance, on exit = sqrt(1+sqrt(-1))^2*x
+ */
+extern void FP16_times_i2(FP16 *x);
+
+/**	@brief multiplies an FP16 instance by irreducible polynomial (1+sqrt(-1))
+ *
+	@param x FP16 instance, on exit = sqrt(1+sqrt(-1))^4*x
+ */
+extern void FP16_times_i4(FP16 *x);
+
+
+/**	@brief Normalises the components of an FP16
+ *
+	@param x FP16 instance to be normalised
+ */
+extern void FP16_norm(FP16 *x);
+/**	@brief Reduces all components of possibly unreduced FP16 mod Modulus
+ *
+	@param x FP16 instance, on exit reduced mod Modulus
+ */
+extern void FP16_reduce(FP16 *x);
+/**	@brief Raises an FP16 to the power of a BIG
+ *
+	@param x FP16 instance, on exit = y^b
+	@param y FP16 instance
+	@param b BIG number
+ */
+extern void FP16_pow(FP16 *x, FP16 *y, B560_58::BIG b);
+/**	@brief Raises an FP16 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP16 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP16_frob(FP16 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP16 instance, on exit = w*x-conj(x)*y+z
+	@param w FP16 instance
+	@param x FP16 instance
+	@param y FP16 instance
+	@param z FP16 instance
+ */
+extern void FP16_xtr_A(FP16 *r, FP16 *w, FP16 *x, FP16 *y, FP16 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP16 instance, on exit = x^2-2*conj(x)
+	@param x FP16 instance
+ */
+extern void FP16_xtr_D(FP16 *r, FP16 *x);
+/**	@brief Calculates FP16 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP16 instance, on exit = trace(w^b)
+	@param x FP16 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP16_xtr_pow(FP16 *r, FP16 *x, B560_58::BIG b);
+/**	@brief Calculates FP16 trace of c^a.d^b, where c and d are derived from FP16 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP16 instance, on exit = trace(c^a.d^b)
+	@param c FP16 instance, trace of an FP12
+	@param d FP16 instance, trace of an FP12
+	@param e FP16 instance, trace of an FP12
+	@param f FP16 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP16_xtr_pow2(FP16 *r, FP16 *c, FP16 *d, FP16 *e, FP16 *f, B560_58::BIG a, B560_58::BIG b);
+
+/**	@brief Conditional copy of FP16 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP16 instance, set to y if s!=0
+	@param y another FP16 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP16_cmove(FP16 *x, FP16 *y, int s);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp16_BLS48581.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp16_BLS48581.h
new file mode 100644
index 0000000..dbad664
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp16_BLS48581.h
@@ -0,0 +1,308 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP16_BLS48581_H
+#define FP16_BLS48581_H
+
+#include "fp8_BLS48581.h"
+#include "config_curve_BLS48581.h"
+
+using namespace core;
+
+namespace BLS48581 {
+
+/**
+	@brief FP16 Structure - towered over two FP4
+*/
+
+typedef struct
+{
+    FP8 a; /**< real part of FP16 */
+    FP8 b; /**< imaginary part of FP16 */
+} FP16;
+
+
+/* FP16 prototypes */
+/**	@brief Tests for FP16 equal to zero
+ *
+	@param x FP16 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP16_iszilch(FP16 *x);
+/**	@brief Tests for FP16 equal to unity
+ *
+	@param x FP16 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP16_isunity(FP16 *x);
+/**	@brief Tests for equality of two FP16s
+ *
+	@param x FP16 instance to be compared
+	@param y FP16 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP16_equals(FP16 *x, FP16 *y);
+
+/**	@brief Serialize in FP16  
+ *
+    @param b buffer for output
+	@param x FP16 number to be serialized
+ */
+extern void FP16_toBytes(char *b,FP16 *x);
+/**	@brief Serialize out FP16  
+ *
+	@param x FP16 number to be serialized
+    @param b buffer for input
+ */
+extern void FP16_fromBytes(FP16 *x,char *b);
+
+/**	@brief Tests for FP16 having only a real part and no imaginary part
+ *
+	@param x FP16 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP16_isreal(FP16 *x);
+/**	@brief Initialise FP16 from two FP8s
+ *
+	@param x FP16 instance to be initialised
+	@param a FP8 to form real part of FP16
+	@param b FP8 to form imaginary part of FP16
+ */
+extern void FP16_from_FP8s(FP16 *x, FP8 *a, FP8 *b);
+/**	@brief Initialise FP16 from single FP8
+ *
+	Imaginary part is set to zero
+	@param x FP16 instance to be initialised
+	@param a FP8 to form real part of FP16
+ */
+extern void FP16_from_FP8(FP16 *x, FP8 *a);
+
+/**	@brief Initialise FP16 from single FP8
+ *
+	real part is set to zero
+	@param x FP16 instance to be initialised
+	@param a FP8 to form imaginary part of FP16
+ */
+extern void FP16_from_FP8H(FP16 *x, FP8 *a);
+
+
+/**	@brief Copy FP16 to another FP16
+ *
+	@param x FP16 instance, on exit = y
+	@param y FP16 instance to be copied
+ */
+extern void FP16_copy(FP16 *x, FP16 *y);
+/**	@brief Set FP16 to zero
+ *
+	@param x FP16 instance to be set to zero
+ */
+extern void FP16_zero(FP16 *x);
+/**	@brief Set FP16 to unity
+ *
+	@param x FP16 instance to be set to one
+ */
+extern void FP16_one(FP16 *x);
+/**	@brief Negation of FP16
+ *
+	@param x FP16 instance, on exit = -y
+	@param y FP16 instance
+ */
+extern void FP16_neg(FP16 *x, FP16 *y);
+/**	@brief Conjugation of FP16
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP16 instance, on exit = conj(y)
+	@param y FP16 instance
+ */
+extern void FP16_conj(FP16 *x, FP16 *y);
+/**	@brief Negative conjugation of FP16
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP16 instance, on exit = -conj(y)
+	@param y FP16 instance
+ */
+extern void FP16_nconj(FP16 *x, FP16 *y);
+/**	@brief addition of two FP16s
+ *
+	@param x FP16 instance, on exit = y+z
+	@param y FP16 instance
+	@param z FP16 instance
+ */
+extern void FP16_add(FP16 *x, FP16 *y, FP16 *z);
+/**	@brief subtraction of two FP16s
+ *
+	@param x FP16 instance, on exit = y-z
+	@param y FP16 instance
+	@param z FP16 instance
+ */
+extern void FP16_sub(FP16 *x, FP16 *y, FP16 *z);
+/**	@brief Multiplication of an FP16 by an FP8
+ *
+	@param x FP16 instance, on exit = y*a
+	@param y FP16 instance
+	@param a FP4 multiplier
+ */
+extern void FP16_pmul(FP16 *x, FP16 *y, FP8 *a);
+
+/**	@brief Multiplication of an FP16 by an FP2
+ *
+	@param x FP16 instance, on exit = y*a
+	@param y FP16 instance
+	@param a FP2 multiplier
+ */
+extern void FP16_qmul(FP16 *x, FP16 *y, FP2 *a);
+
+
+/**	@brief Multiplication of an FP16 by an FP
+ *
+	@param x FP16 instance, on exit = y*a
+	@param y FP16 instance
+	@param a FP multiplier
+ */
+extern void FP16_tmul(FP16 *x, FP16 *y, FP *a);
+
+
+
+/**	@brief Multiplication of an FP16 by a small integer
+ *
+	@param x FP16 instance, on exit = y*i
+	@param y FP16 instance
+	@param i an integer
+ */
+extern void FP16_imul(FP16 *x, FP16 *y, int i);
+/**	@brief Squaring an FP16
+ *
+	@param x FP16 instance, on exit = y^2
+	@param y FP16 instance
+ */
+extern void FP16_sqr(FP16 *x, FP16 *y);
+/**	@brief Multiplication of two FP16s
+ *
+	@param x FP16 instance, on exit = y*z
+	@param y FP16 instance
+	@param z FP16 instance
+ */
+extern void FP16_mul(FP16 *x, FP16 *y, FP16 *z);
+/**	@brief Inverting an FP16
+ *
+	@param x FP16 instance, on exit = 1/y
+	@param y FP16 instance
+ */
+extern void FP16_inv(FP16 *x, FP16 *y);
+/**	@brief Formats and outputs an FP16 to the console
+ *
+	@param x FP16 instance to be printed
+ */
+extern void FP16_output(FP16 *x);
+/**	@brief Formats and outputs an FP16 to the console in raw form (for debugging)
+ *
+	@param x FP16 instance to be printed
+ */
+extern void FP16_rawoutput(FP16 *x);
+/**	@brief multiplies an FP16 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP16 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP16_times_i(FP16 *x);
+/**	@brief multiplies an FP16 instance by irreducible polynomial (1+sqrt(-1))
+ *
+	@param x FP16 instance, on exit = sqrt(1+sqrt(-1))^2*x
+ */
+extern void FP16_times_i2(FP16 *x);
+
+/**	@brief multiplies an FP16 instance by irreducible polynomial (1+sqrt(-1))
+ *
+	@param x FP16 instance, on exit = sqrt(1+sqrt(-1))^4*x
+ */
+extern void FP16_times_i4(FP16 *x);
+
+
+/**	@brief Normalises the components of an FP16
+ *
+	@param x FP16 instance to be normalised
+ */
+extern void FP16_norm(FP16 *x);
+/**	@brief Reduces all components of possibly unreduced FP16 mod Modulus
+ *
+	@param x FP16 instance, on exit reduced mod Modulus
+ */
+extern void FP16_reduce(FP16 *x);
+/**	@brief Raises an FP16 to the power of a BIG
+ *
+	@param x FP16 instance, on exit = y^b
+	@param y FP16 instance
+	@param b BIG number
+ */
+extern void FP16_pow(FP16 *x, FP16 *y, B584_60::BIG b);
+/**	@brief Raises an FP16 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP16 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP16_frob(FP16 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP16 instance, on exit = w*x-conj(x)*y+z
+	@param w FP16 instance
+	@param x FP16 instance
+	@param y FP16 instance
+	@param z FP16 instance
+ */
+extern void FP16_xtr_A(FP16 *r, FP16 *w, FP16 *x, FP16 *y, FP16 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP16 instance, on exit = x^2-2*conj(x)
+	@param x FP16 instance
+ */
+extern void FP16_xtr_D(FP16 *r, FP16 *x);
+/**	@brief Calculates FP16 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP16 instance, on exit = trace(w^b)
+	@param x FP16 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP16_xtr_pow(FP16 *r, FP16 *x, B584_60::BIG b);
+/**	@brief Calculates FP16 trace of c^a.d^b, where c and d are derived from FP16 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP16 instance, on exit = trace(c^a.d^b)
+	@param c FP16 instance, trace of an FP12
+	@param d FP16 instance, trace of an FP12
+	@param e FP16 instance, trace of an FP12
+	@param f FP16 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP16_xtr_pow2(FP16 *r, FP16 *c, FP16 *d, FP16 *e, FP16 *f, B584_60::BIG a, B584_60::BIG b);
+
+/**	@brief Conditional copy of FP16 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP16 instance, set to y if s!=0
+	@param y another FP16 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP16_cmove(FP16 *x, FP16 *y, int s);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp2.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp2.h
new file mode 100644
index 0000000..58c03fd
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp2.h
@@ -0,0 +1,306 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP2_YYY_H
+#define FP2_YYY_H
+
+#include "fp_YYY.h"
+
+using namespace core;
+
+namespace YYY {
+
+/**
+	@brief FP2 Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    FP a; /**< real part of FP2 */
+    FP b; /**< imaginary part of FP2 */
+} FP2;
+
+/* FP2 prototypes */
+
+/**	@brief Tests for FP2 equal to zero
+ *
+	@param x FP2 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP2_iszilch(FP2 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP2 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP2_islarger(FP2 *x);
+
+
+/**	@brief Serialize out FP2  
+ *
+    @param b buffer for output
+	@param x FP2 number to be serialized
+ */
+extern void FP2_toBytes(char *b,FP2 *x);
+
+/**	@brief Serialize in FP2  
+ *
+	@param x FP2 number to be serialized
+    @param b buffer for input
+ */
+extern void FP2_fromBytes(FP2 *x,char *b);
+
+/**	@brief Conditional copy of FP2 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP2 instance, set to y if s!=0
+	@param y another FP2 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP2_cmove(FP2 *x, FP2 *y, int s);
+/**	@brief Tests for FP2 equal to one
+ *
+	@param x FP2 instance to be tested
+	@return 1 if x=1, else returns 0
+ */
+extern int FP2_isunity(FP2 *x);
+/**	@brief Tests for equality of two FP2s
+ *
+	@param x FP2 instance to be compared
+	@param y FP2 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP2_equals(FP2 *x, FP2 *y);
+/**	@brief Initialise FP2 from two FP numbers
+ *
+	@param x FP2 instance to be initialised
+	@param a FP to form real part of FP2
+	@param b FP to form imaginary part of FP2
+ */
+extern void FP2_from_FPs(FP2 *x, FP *a, FP *b);
+/**	@brief Initialise FP2 from two BIG integers
+ *
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+	@param b BIG to form imaginary part of FP2
+ */
+extern void FP2_from_BIGs(FP2 *x, XXX::BIG a, XXX::BIG b);
+
+
+/**	@brief Initialise FP2 from two integers
+ *
+	@param x FP2 instance to be initialised
+	@param a int to form real part of FP2
+	@param b int to form imaginary part of FP2
+ */
+extern void FP2_from_ints(FP2 *x, int a, int b);
+
+
+
+/**	@brief Initialise FP2 from single FP
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param an FP to form real part of FP2
+ */
+extern void FP2_from_FP(FP2 *x, FP *a);
+/**	@brief Initialise FP2 from single BIG
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+ */
+extern void FP2_from_BIG(FP2 *x, XXX::BIG a);
+/**	@brief Copy FP2 to another FP2
+ *
+	@param x FP2 instance, on exit = y
+	@param y FP2 instance to be copied
+ */
+extern void FP2_copy(FP2 *x, FP2 *y);
+/**	@brief Set FP2 to zero
+ *
+	@param x FP2 instance to be set to zero
+ */
+extern void FP2_zero(FP2 *x);
+/**	@brief Set FP2 to unity
+ *
+	@param x FP2 instance to be set to one
+ */
+extern void FP2_one(FP2 *x);
+
+/**	@brief Copy from ROM to an FP2
+ *
+	@param w FP2 number to be copied to
+	@param a BIG real part to be copied from ROM
+	@param b BIG imag part to be copied from ROM
+ */
+extern void FP2_rcopy(FP2 *w,const XXX::BIG a,const XXX::BIG b);
+
+/**	@brief Sign of FP2
+ *
+	@param x FP2 instance
+	@return "sign" of FP2
+ */
+extern int FP2_sign(FP2 *x);
+
+/**	@brief Negation of FP2
+ *
+	@param x FP2 instance, on exit = -y
+	@param y FP2 instance
+ */
+extern void FP2_neg(FP2 *x, FP2 *y);
+
+
+/**	@brief Conjugation of FP2
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP2 instance, on exit = conj(y)
+	@param y FP2 instance
+ */
+extern void FP2_conj(FP2 *x, FP2 *y);
+/**	@brief addition of two FP2s
+ *
+	@param x FP2 instance, on exit = y+z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_add(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief subtraction of two FP2s
+ *
+	@param x FP2 instance, on exit = y-z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_sub(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Multiplication of an FP2 by an FP
+ *
+	@param x FP2 instance, on exit = y*b
+	@param y FP2 instance
+	@param b FP residue
+ */
+extern void FP2_pmul(FP2 *x, FP2 *y, FP *b);
+/**	@brief Multiplication of an FP2 by a small integer
+ *
+	@param x FP2 instance, on exit = y*i
+	@param y FP2 instance
+	@param i an integer
+ */
+extern void FP2_imul(FP2 *x, FP2 *y, int i);
+/**	@brief Squaring an FP2
+ *
+	@param x FP2 instance, on exit = y^2
+	@param y FP2 instance
+ */
+extern void FP2_sqr(FP2 *x, FP2 *y);
+/**	@brief Multiplication of two FP2s
+ *
+	@param x FP2 instance, on exit = y*z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_mul(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Formats and outputs an FP2 to the console
+ *
+	@param x FP2 instance
+ */
+extern void FP2_output(FP2 *x);
+/**	@brief Formats and outputs an FP2 to the console in raw form (for debugging)
+ *
+	@param x FP2 instance
+ */
+extern void FP2_rawoutput(FP2 *x);
+/**	@brief Inverting an FP2
+ *
+	@param x FP2 instance, on exit = 1/y
+	@param y FP2 instance
+ */
+extern void FP2_inv(FP2 *x, FP2 *y, FP *h);
+/**	@brief Divide an FP2 by 2
+ *
+	@param x FP2 instance, on exit = y/2
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_div2(FP2 *x, FP2 *y);
+/**	@brief Multiply an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x*(1+sqrt(-1))
+ */
+extern void FP2_mul_ip(FP2 *x);
+
+/**	@brief Divide an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x/(1+sqrt(-1))
+ */
+extern void FP2_div_ip(FP2 *x);
+/**	@brief Normalises the components of an FP2
+ *
+	@param x FP2 instance to be normalised
+ */
+extern void FP2_norm(FP2 *x);
+/**	@brief Reduces all components of possibly unreduced FP2 mod Modulus
+ *
+	@param x FP2 instance, on exit reduced mod Modulus
+ */
+extern void FP2_reduce(FP2 *x);
+/**	@brief Raises an FP2 to the power of a BIG
+ *
+	@param x FP2 instance, on exit = y^b
+	@param y FP2 instance
+	@param b BIG number
+ */
+extern void FP2_pow(FP2 *x, FP2 *y, XXX::BIG b);
+
+/**	@brief Test FP2 for QR
+ *
+	@param x FP2 instance
+    @param h optional generated hint
+	@return true or false
+ */
+extern int FP2_qr(FP2 *x,FP *h);
+
+
+/**	@brief Square root of an FP2
+ *
+	@param x FP2 instance, on exit = sqrt(y)
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_sqrt(FP2 *x, FP2 *y, FP *h);
+
+/**	@brief Multiply an FP2 by sqrt(-1)
+ *
+	Note that -1 is QNR
+	@param x FP2 instance, on exit = x*sqrt(-1)
+ */
+extern void FP2_times_i(FP2 *x);
+
+/**	@brief Generate random FP2
+ *
+	@param x random FP2 number
+	@param rng random number generator
+ */
+extern void FP2_rand(FP2 *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp24.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp24.h
new file mode 100644
index 0000000..1b4b3c9
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp24.h
@@ -0,0 +1,236 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP24_YYY_H
+#define FP24_YYY_H
+
+#include "fp8_YYY.h"
+
+using namespace core;
+
+namespace YYY {
+/**
+	@brief FP12 Structure - towered over three FP8
+*/
+
+
+typedef struct
+{
+    FP8 a; /**< first part of FP12 */
+    FP8 b; /**< second part of FP12 */
+    FP8 c; /**< third part of FP12 */
+    int type;
+} FP24;
+
+extern const XXX::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const XXX::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+/* FP24 prototypes */
+/**	@brief Tests for FP24 equal to zero
+ *
+	@param x FP24 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP24_iszilch(FP24 *x);
+/**	@brief Tests for FP24 equal to unity
+ *
+	@param x FP24 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP24_isunity(FP24 *x);
+/**	@brief Copy FP24 to another FP24
+ *
+	@param x FP24 instance, on exit = y
+	@param y FP24 instance to be copied
+ */
+extern void FP24_copy(FP24 *x, FP24 *y);
+/**	@brief Set FP24 to unity
+ *
+	@param x FP24 instance to be set to one
+ */
+extern void FP24_one(FP24 *x);
+
+/**	@brief Set FP24 to zero
+ *
+	@param x FP24 instance to be set to zero
+ */
+extern void FP24_zero(FP24 *x);
+
+
+/**	@brief Tests for equality of two FP24s
+ *
+	@param x FP24 instance to be compared
+	@param y FP24 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP24_equals(FP24 *x, FP24 *y);
+/**	@brief Conjugation of FP24
+ *
+	If y=(a,b,c) (where a,b,c are its three FP8 components) on exit x=(conj(a),-conj(b),conj(c))
+	@param x FP24 instance, on exit = conj(y)
+	@param y FP24 instance
+ */
+extern void FP24_conj(FP24 *x, FP24 *y);
+/**	@brief Initialise FP24 from single FP8
+ *
+	Sets first FP8 component of an FP24, other components set to zero
+	@param x FP24 instance to be initialised
+	@param a FP8 to form first part of FP8
+ */
+extern void FP24_from_FP8(FP24 *x, FP8 *a);
+/**	@brief Initialise FP24 from three FP8s
+ *
+	@param x FP24 instance to be initialised
+	@param a FP8 to form first part of FP24
+	@param b FP8 to form second part of FP24
+	@param c FP8 to form third part of FP24
+ */
+extern void FP24_from_FP8s(FP24 *x, FP8 *a, FP8* b, FP8 *c);
+/**	@brief Fast Squaring of an FP24 in "unitary" form
+ *
+	@param x FP24 instance, on exit = y^2
+	@param y FP8 instance, must be unitary
+ */
+extern void FP24_usqr(FP24 *x, FP24 *y);
+/**	@brief Squaring an FP24
+ *
+	@param x FP24 instance, on exit = y^2
+	@param y FP24 instance
+ */
+extern void FP24_sqr(FP24 *x, FP24 *y);
+
+/**	@brief Fast multiplication of two sparse FP24s that arises from ATE pairing line functions
+ *
+	@param x FP24 instance, on exit = x*y
+	@param y FP24 instance, of special form
+ */
+extern void FP24_smul(FP24 *x, FP24 *y);
+
+/**	@brief Fast multiplication of what may be sparse multiplicands
+ *
+	@param x FP24 instance, on exit = x*y
+	@param y FP24 instance, of special form
+ */
+extern void FP24_ssmul(FP24 *x, FP24 *y);
+/**	@brief Full unconditional Multiplication of two FP24s
+ *
+	@param x FP24 instance, on exit = x*y
+	@param y FP24 instance, the multiplier
+ */
+extern void FP24_mul(FP24 *x, FP24 *y);
+
+/**	@brief Inverting an FP24
+ *
+	@param x FP24 instance, on exit = 1/y
+	@param y FP24 instance
+ */
+extern void FP24_inv(FP24 *x, FP24 *y);
+/**	@brief Raises an FP24 to the power of a BIG
+ *
+	@param r FP24 instance, on exit = y^b
+	@param x FP24 instance
+	@param b BIG number
+ */
+extern void FP24_pow(FP24 *r, FP24 *x, XXX::BIG b);
+
+//extern void FP24_ppow(FP24 *r,FP24 *x,XXX::BIG b);
+
+/**	@brief Raises an FP24 instance x to a small integer power, side-channel resistant
+ *
+	@param x FP24 instance, on exit = x^i
+	@param i small integer exponent
+	@param b maximum number of bits in exponent
+ */
+extern void FP24_pinpow(FP24 *x, int i, int b);
+
+/**	@brief Raises an FP24 instance x to a BIG power, compressed to FP8
+ *
+	@param c FP8 instance, on exit = x^(e mod r) as FP8
+	@param x FP24 input
+	@param e BIG exponent
+	@param r BIG group order
+ */
+extern void FP24_compow(FP8 *c, FP24 *x, XXX::BIG e, XXX::BIG r);
+
+/**	@brief Calculate Pi x[i]^b[i] for i=0 to 7, side-channel resistant
+ *
+	@param r FP24 instance, on exit = Pi x[i]^b[i] for i=0 to 7
+	@param x FP24 array with 4 FP24s
+	@param b BIG array of 4 exponents
+ */
+extern void FP24_pow8(FP24 *r, FP24 *x, XXX::BIG *b);
+
+
+/**	@brief Raises an FP24 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP24 instance, on exit = x^p^n
+	@param f FP2 precalculated Frobenius constant
+	@param n power of p
+ */
+extern void FP24_frob(FP24 *x, FP2 *f, int n);
+
+/**	@brief Reduces all components of possibly unreduced FP24 mod Modulus
+ *
+	@param x FP24 instance, on exit reduced mod Modulus
+ */
+extern void FP24_reduce(FP24 *x);
+/**	@brief Normalises the components of an FP24
+ *
+	@param x FP24 instance to be normalised
+ */
+extern void FP24_norm(FP24 *x);
+/**	@brief Formats and outputs an FP24 to the console
+ *
+	@param x FP24 instance to be printed
+ */
+extern void FP24_output(FP24 *x);
+/**	@brief Formats and outputs an FP24 instance to an octet string
+ *
+	Serializes the components of an FP24 to big-endian base 256 form.
+	@param S output octet string
+	@param x FP24 instance to be converted to an octet string
+ */
+extern void FP24_toOctet(octet *S, FP24 *x);
+/**	@brief Creates an FP24 instance from an octet string
+ *
+	De-serializes the components of an FP24 to create an FP24 from big-endian base 256 components.
+	@param x FP24 instance to be created from an octet string
+	@param S input octet string
+
+ */
+extern void FP24_fromOctet(FP24 *x, octet *S);
+/**	@brief Calculate the trace of an FP24
+ *
+	@param t FP8 trace of x, on exit = tr(x)
+	@param x FP24 instance
+
+ */
+extern void FP24_trace(FP8 *t, FP24 *x);
+
+/**	@brief Conditional copy of FP24 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP24 instance, set to y if s!=0
+	@param y another FP24 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP24_cmove(FP24 *x, FP24 *y, int s);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp24_BLS24479.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp24_BLS24479.h
new file mode 100644
index 0000000..4b62f54
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp24_BLS24479.h
@@ -0,0 +1,236 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP24_BLS24479_H
+#define FP24_BLS24479_H
+
+#include "fp8_BLS24479.h"
+
+using namespace core;
+
+namespace BLS24479 {
+/**
+	@brief FP12 Structure - towered over three FP8
+*/
+
+
+typedef struct
+{
+    FP8 a; /**< first part of FP12 */
+    FP8 b; /**< second part of FP12 */
+    FP8 c; /**< third part of FP12 */
+    int type;
+} FP24;
+
+extern const B480_56::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B480_56::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+/* FP24 prototypes */
+/**	@brief Tests for FP24 equal to zero
+ *
+	@param x FP24 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP24_iszilch(FP24 *x);
+/**	@brief Tests for FP24 equal to unity
+ *
+	@param x FP24 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP24_isunity(FP24 *x);
+/**	@brief Copy FP24 to another FP24
+ *
+	@param x FP24 instance, on exit = y
+	@param y FP24 instance to be copied
+ */
+extern void FP24_copy(FP24 *x, FP24 *y);
+/**	@brief Set FP24 to unity
+ *
+	@param x FP24 instance to be set to one
+ */
+extern void FP24_one(FP24 *x);
+
+/**	@brief Set FP24 to zero
+ *
+	@param x FP24 instance to be set to zero
+ */
+extern void FP24_zero(FP24 *x);
+
+
+/**	@brief Tests for equality of two FP24s
+ *
+	@param x FP24 instance to be compared
+	@param y FP24 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP24_equals(FP24 *x, FP24 *y);
+/**	@brief Conjugation of FP24
+ *
+	If y=(a,b,c) (where a,b,c are its three FP8 components) on exit x=(conj(a),-conj(b),conj(c))
+	@param x FP24 instance, on exit = conj(y)
+	@param y FP24 instance
+ */
+extern void FP24_conj(FP24 *x, FP24 *y);
+/**	@brief Initialise FP24 from single FP8
+ *
+	Sets first FP8 component of an FP24, other components set to zero
+	@param x FP24 instance to be initialised
+	@param a FP8 to form first part of FP8
+ */
+extern void FP24_from_FP8(FP24 *x, FP8 *a);
+/**	@brief Initialise FP24 from three FP8s
+ *
+	@param x FP24 instance to be initialised
+	@param a FP8 to form first part of FP24
+	@param b FP8 to form second part of FP24
+	@param c FP8 to form third part of FP24
+ */
+extern void FP24_from_FP8s(FP24 *x, FP8 *a, FP8* b, FP8 *c);
+/**	@brief Fast Squaring of an FP24 in "unitary" form
+ *
+	@param x FP24 instance, on exit = y^2
+	@param y FP8 instance, must be unitary
+ */
+extern void FP24_usqr(FP24 *x, FP24 *y);
+/**	@brief Squaring an FP24
+ *
+	@param x FP24 instance, on exit = y^2
+	@param y FP24 instance
+ */
+extern void FP24_sqr(FP24 *x, FP24 *y);
+
+/**	@brief Fast multiplication of two sparse FP24s that arises from ATE pairing line functions
+ *
+	@param x FP24 instance, on exit = x*y
+	@param y FP24 instance, of special form
+ */
+extern void FP24_smul(FP24 *x, FP24 *y);
+
+/**	@brief Fast multiplication of what may be sparse multiplicands
+ *
+	@param x FP24 instance, on exit = x*y
+	@param y FP24 instance, of special form
+ */
+extern void FP24_ssmul(FP24 *x, FP24 *y);
+/**	@brief Full unconditional Multiplication of two FP24s
+ *
+	@param x FP24 instance, on exit = x*y
+	@param y FP24 instance, the multiplier
+ */
+extern void FP24_mul(FP24 *x, FP24 *y);
+
+/**	@brief Inverting an FP24
+ *
+	@param x FP24 instance, on exit = 1/y
+	@param y FP24 instance
+ */
+extern void FP24_inv(FP24 *x, FP24 *y);
+/**	@brief Raises an FP24 to the power of a BIG
+ *
+	@param r FP24 instance, on exit = y^b
+	@param x FP24 instance
+	@param b BIG number
+ */
+extern void FP24_pow(FP24 *r, FP24 *x, B480_56::BIG b);
+
+//extern void FP24_ppow(FP24 *r,FP24 *x,B480_56::BIG b);
+
+/**	@brief Raises an FP24 instance x to a small integer power, side-channel resistant
+ *
+	@param x FP24 instance, on exit = x^i
+	@param i small integer exponent
+	@param b maximum number of bits in exponent
+ */
+extern void FP24_pinpow(FP24 *x, int i, int b);
+
+/**	@brief Raises an FP24 instance x to a BIG power, compressed to FP8
+ *
+	@param c FP8 instance, on exit = x^(e mod r) as FP8
+	@param x FP24 input
+	@param e BIG exponent
+	@param r BIG group order
+ */
+extern void FP24_compow(FP8 *c, FP24 *x, B480_56::BIG e, B480_56::BIG r);
+
+/**	@brief Calculate Pi x[i]^b[i] for i=0 to 7, side-channel resistant
+ *
+	@param r FP24 instance, on exit = Pi x[i]^b[i] for i=0 to 7
+	@param x FP24 array with 4 FP24s
+	@param b BIG array of 4 exponents
+ */
+extern void FP24_pow8(FP24 *r, FP24 *x, B480_56::BIG *b);
+
+
+/**	@brief Raises an FP24 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP24 instance, on exit = x^p^n
+	@param f FP2 precalculated Frobenius constant
+	@param n power of p
+ */
+extern void FP24_frob(FP24 *x, FP2 *f, int n);
+
+/**	@brief Reduces all components of possibly unreduced FP24 mod Modulus
+ *
+	@param x FP24 instance, on exit reduced mod Modulus
+ */
+extern void FP24_reduce(FP24 *x);
+/**	@brief Normalises the components of an FP24
+ *
+	@param x FP24 instance to be normalised
+ */
+extern void FP24_norm(FP24 *x);
+/**	@brief Formats and outputs an FP24 to the console
+ *
+	@param x FP24 instance to be printed
+ */
+extern void FP24_output(FP24 *x);
+/**	@brief Formats and outputs an FP24 instance to an octet string
+ *
+	Serializes the components of an FP24 to big-endian base 256 form.
+	@param S output octet string
+	@param x FP24 instance to be converted to an octet string
+ */
+extern void FP24_toOctet(octet *S, FP24 *x);
+/**	@brief Creates an FP24 instance from an octet string
+ *
+	De-serializes the components of an FP24 to create an FP24 from big-endian base 256 components.
+	@param x FP24 instance to be created from an octet string
+	@param S input octet string
+
+ */
+extern void FP24_fromOctet(FP24 *x, octet *S);
+/**	@brief Calculate the trace of an FP24
+ *
+	@param t FP8 trace of x, on exit = tr(x)
+	@param x FP24 instance
+
+ */
+extern void FP24_trace(FP8 *t, FP24 *x);
+
+/**	@brief Conditional copy of FP24 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP24 instance, set to y if s!=0
+	@param y another FP24 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP24_cmove(FP24 *x, FP24 *y, int s);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp2_BLS12381.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp2_BLS12381.h
new file mode 100644
index 0000000..4843c4a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp2_BLS12381.h
@@ -0,0 +1,306 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP2_BLS12381_H
+#define FP2_BLS12381_H
+
+#include "fp_BLS12381.h"
+
+using namespace core;
+
+namespace BLS12381 {
+
+/**
+	@brief FP2 Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    FP a; /**< real part of FP2 */
+    FP b; /**< imaginary part of FP2 */
+} FP2;
+
+/* FP2 prototypes */
+
+/**	@brief Tests for FP2 equal to zero
+ *
+	@param x FP2 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP2_iszilch(FP2 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP2 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP2_islarger(FP2 *x);
+
+
+/**	@brief Serialize out FP2  
+ *
+    @param b buffer for output
+	@param x FP2 number to be serialized
+ */
+extern void FP2_toBytes(char *b,FP2 *x);
+
+/**	@brief Serialize in FP2  
+ *
+	@param x FP2 number to be serialized
+    @param b buffer for input
+ */
+extern void FP2_fromBytes(FP2 *x,char *b);
+
+/**	@brief Conditional copy of FP2 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP2 instance, set to y if s!=0
+	@param y another FP2 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP2_cmove(FP2 *x, FP2 *y, int s);
+/**	@brief Tests for FP2 equal to one
+ *
+	@param x FP2 instance to be tested
+	@return 1 if x=1, else returns 0
+ */
+extern int FP2_isunity(FP2 *x);
+/**	@brief Tests for equality of two FP2s
+ *
+	@param x FP2 instance to be compared
+	@param y FP2 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP2_equals(FP2 *x, FP2 *y);
+/**	@brief Initialise FP2 from two FP numbers
+ *
+	@param x FP2 instance to be initialised
+	@param a FP to form real part of FP2
+	@param b FP to form imaginary part of FP2
+ */
+extern void FP2_from_FPs(FP2 *x, FP *a, FP *b);
+/**	@brief Initialise FP2 from two BIG integers
+ *
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+	@param b BIG to form imaginary part of FP2
+ */
+extern void FP2_from_BIGs(FP2 *x, B384_58::BIG a, B384_58::BIG b);
+
+
+/**	@brief Initialise FP2 from two integers
+ *
+	@param x FP2 instance to be initialised
+	@param a int to form real part of FP2
+	@param b int to form imaginary part of FP2
+ */
+extern void FP2_from_ints(FP2 *x, int a, int b);
+
+
+
+/**	@brief Initialise FP2 from single FP
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param an FP to form real part of FP2
+ */
+extern void FP2_from_FP(FP2 *x, FP *a);
+/**	@brief Initialise FP2 from single BIG
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+ */
+extern void FP2_from_BIG(FP2 *x, B384_58::BIG a);
+/**	@brief Copy FP2 to another FP2
+ *
+	@param x FP2 instance, on exit = y
+	@param y FP2 instance to be copied
+ */
+extern void FP2_copy(FP2 *x, FP2 *y);
+/**	@brief Set FP2 to zero
+ *
+	@param x FP2 instance to be set to zero
+ */
+extern void FP2_zero(FP2 *x);
+/**	@brief Set FP2 to unity
+ *
+	@param x FP2 instance to be set to one
+ */
+extern void FP2_one(FP2 *x);
+
+/**	@brief Copy from ROM to an FP2
+ *
+	@param w FP2 number to be copied to
+	@param a BIG real part to be copied from ROM
+	@param b BIG imag part to be copied from ROM
+ */
+extern void FP2_rcopy(FP2 *w,const B384_58::BIG a,const B384_58::BIG b);
+
+/**	@brief Sign of FP2
+ *
+	@param x FP2 instance
+	@return "sign" of FP2
+ */
+extern int FP2_sign(FP2 *x);
+
+/**	@brief Negation of FP2
+ *
+	@param x FP2 instance, on exit = -y
+	@param y FP2 instance
+ */
+extern void FP2_neg(FP2 *x, FP2 *y);
+
+
+/**	@brief Conjugation of FP2
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP2 instance, on exit = conj(y)
+	@param y FP2 instance
+ */
+extern void FP2_conj(FP2 *x, FP2 *y);
+/**	@brief addition of two FP2s
+ *
+	@param x FP2 instance, on exit = y+z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_add(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief subtraction of two FP2s
+ *
+	@param x FP2 instance, on exit = y-z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_sub(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Multiplication of an FP2 by an FP
+ *
+	@param x FP2 instance, on exit = y*b
+	@param y FP2 instance
+	@param b FP residue
+ */
+extern void FP2_pmul(FP2 *x, FP2 *y, FP *b);
+/**	@brief Multiplication of an FP2 by a small integer
+ *
+	@param x FP2 instance, on exit = y*i
+	@param y FP2 instance
+	@param i an integer
+ */
+extern void FP2_imul(FP2 *x, FP2 *y, int i);
+/**	@brief Squaring an FP2
+ *
+	@param x FP2 instance, on exit = y^2
+	@param y FP2 instance
+ */
+extern void FP2_sqr(FP2 *x, FP2 *y);
+/**	@brief Multiplication of two FP2s
+ *
+	@param x FP2 instance, on exit = y*z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_mul(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Formats and outputs an FP2 to the console
+ *
+	@param x FP2 instance
+ */
+extern void FP2_output(FP2 *x);
+/**	@brief Formats and outputs an FP2 to the console in raw form (for debugging)
+ *
+	@param x FP2 instance
+ */
+extern void FP2_rawoutput(FP2 *x);
+/**	@brief Inverting an FP2
+ *
+	@param x FP2 instance, on exit = 1/y
+	@param y FP2 instance
+ */
+extern void FP2_inv(FP2 *x, FP2 *y, FP *h);
+/**	@brief Divide an FP2 by 2
+ *
+	@param x FP2 instance, on exit = y/2
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_div2(FP2 *x, FP2 *y);
+/**	@brief Multiply an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x*(1+sqrt(-1))
+ */
+extern void FP2_mul_ip(FP2 *x);
+
+/**	@brief Divide an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x/(1+sqrt(-1))
+ */
+extern void FP2_div_ip(FP2 *x);
+/**	@brief Normalises the components of an FP2
+ *
+	@param x FP2 instance to be normalised
+ */
+extern void FP2_norm(FP2 *x);
+/**	@brief Reduces all components of possibly unreduced FP2 mod Modulus
+ *
+	@param x FP2 instance, on exit reduced mod Modulus
+ */
+extern void FP2_reduce(FP2 *x);
+/**	@brief Raises an FP2 to the power of a BIG
+ *
+	@param x FP2 instance, on exit = y^b
+	@param y FP2 instance
+	@param b BIG number
+ */
+extern void FP2_pow(FP2 *x, FP2 *y, B384_58::BIG b);
+
+/**	@brief Test FP2 for QR
+ *
+	@param x FP2 instance
+    @param h optional generated hint
+	@return true or false
+ */
+extern int FP2_qr(FP2 *x,FP *h);
+
+
+/**	@brief Square root of an FP2
+ *
+	@param x FP2 instance, on exit = sqrt(y)
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_sqrt(FP2 *x, FP2 *y, FP *h);
+
+/**	@brief Multiply an FP2 by sqrt(-1)
+ *
+	Note that -1 is QNR
+	@param x FP2 instance, on exit = x*sqrt(-1)
+ */
+extern void FP2_times_i(FP2 *x);
+
+/**	@brief Generate random FP2
+ *
+	@param x random FP2 number
+	@param rng random number generator
+ */
+extern void FP2_rand(FP2 *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp2_BLS12383.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp2_BLS12383.h
new file mode 100644
index 0000000..5d9f2c9
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp2_BLS12383.h
@@ -0,0 +1,306 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP2_BLS12383_H
+#define FP2_BLS12383_H
+
+#include "fp_BLS12383.h"
+
+using namespace core;
+
+namespace BLS12383 {
+
+/**
+	@brief FP2 Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    FP a; /**< real part of FP2 */
+    FP b; /**< imaginary part of FP2 */
+} FP2;
+
+/* FP2 prototypes */
+
+/**	@brief Tests for FP2 equal to zero
+ *
+	@param x FP2 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP2_iszilch(FP2 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP2 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP2_islarger(FP2 *x);
+
+
+/**	@brief Serialize out FP2  
+ *
+    @param b buffer for output
+	@param x FP2 number to be serialized
+ */
+extern void FP2_toBytes(char *b,FP2 *x);
+
+/**	@brief Serialize in FP2  
+ *
+	@param x FP2 number to be serialized
+    @param b buffer for input
+ */
+extern void FP2_fromBytes(FP2 *x,char *b);
+
+/**	@brief Conditional copy of FP2 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP2 instance, set to y if s!=0
+	@param y another FP2 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP2_cmove(FP2 *x, FP2 *y, int s);
+/**	@brief Tests for FP2 equal to one
+ *
+	@param x FP2 instance to be tested
+	@return 1 if x=1, else returns 0
+ */
+extern int FP2_isunity(FP2 *x);
+/**	@brief Tests for equality of two FP2s
+ *
+	@param x FP2 instance to be compared
+	@param y FP2 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP2_equals(FP2 *x, FP2 *y);
+/**	@brief Initialise FP2 from two FP numbers
+ *
+	@param x FP2 instance to be initialised
+	@param a FP to form real part of FP2
+	@param b FP to form imaginary part of FP2
+ */
+extern void FP2_from_FPs(FP2 *x, FP *a, FP *b);
+/**	@brief Initialise FP2 from two BIG integers
+ *
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+	@param b BIG to form imaginary part of FP2
+ */
+extern void FP2_from_BIGs(FP2 *x, B384_58::BIG a, B384_58::BIG b);
+
+
+/**	@brief Initialise FP2 from two integers
+ *
+	@param x FP2 instance to be initialised
+	@param a int to form real part of FP2
+	@param b int to form imaginary part of FP2
+ */
+extern void FP2_from_ints(FP2 *x, int a, int b);
+
+
+
+/**	@brief Initialise FP2 from single FP
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param an FP to form real part of FP2
+ */
+extern void FP2_from_FP(FP2 *x, FP *a);
+/**	@brief Initialise FP2 from single BIG
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+ */
+extern void FP2_from_BIG(FP2 *x, B384_58::BIG a);
+/**	@brief Copy FP2 to another FP2
+ *
+	@param x FP2 instance, on exit = y
+	@param y FP2 instance to be copied
+ */
+extern void FP2_copy(FP2 *x, FP2 *y);
+/**	@brief Set FP2 to zero
+ *
+	@param x FP2 instance to be set to zero
+ */
+extern void FP2_zero(FP2 *x);
+/**	@brief Set FP2 to unity
+ *
+	@param x FP2 instance to be set to one
+ */
+extern void FP2_one(FP2 *x);
+
+/**	@brief Copy from ROM to an FP2
+ *
+	@param w FP2 number to be copied to
+	@param a BIG real part to be copied from ROM
+	@param b BIG imag part to be copied from ROM
+ */
+extern void FP2_rcopy(FP2 *w,const B384_58::BIG a,const B384_58::BIG b);
+
+/**	@brief Sign of FP2
+ *
+	@param x FP2 instance
+	@return "sign" of FP2
+ */
+extern int FP2_sign(FP2 *x);
+
+/**	@brief Negation of FP2
+ *
+	@param x FP2 instance, on exit = -y
+	@param y FP2 instance
+ */
+extern void FP2_neg(FP2 *x, FP2 *y);
+
+
+/**	@brief Conjugation of FP2
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP2 instance, on exit = conj(y)
+	@param y FP2 instance
+ */
+extern void FP2_conj(FP2 *x, FP2 *y);
+/**	@brief addition of two FP2s
+ *
+	@param x FP2 instance, on exit = y+z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_add(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief subtraction of two FP2s
+ *
+	@param x FP2 instance, on exit = y-z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_sub(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Multiplication of an FP2 by an FP
+ *
+	@param x FP2 instance, on exit = y*b
+	@param y FP2 instance
+	@param b FP residue
+ */
+extern void FP2_pmul(FP2 *x, FP2 *y, FP *b);
+/**	@brief Multiplication of an FP2 by a small integer
+ *
+	@param x FP2 instance, on exit = y*i
+	@param y FP2 instance
+	@param i an integer
+ */
+extern void FP2_imul(FP2 *x, FP2 *y, int i);
+/**	@brief Squaring an FP2
+ *
+	@param x FP2 instance, on exit = y^2
+	@param y FP2 instance
+ */
+extern void FP2_sqr(FP2 *x, FP2 *y);
+/**	@brief Multiplication of two FP2s
+ *
+	@param x FP2 instance, on exit = y*z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_mul(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Formats and outputs an FP2 to the console
+ *
+	@param x FP2 instance
+ */
+extern void FP2_output(FP2 *x);
+/**	@brief Formats and outputs an FP2 to the console in raw form (for debugging)
+ *
+	@param x FP2 instance
+ */
+extern void FP2_rawoutput(FP2 *x);
+/**	@brief Inverting an FP2
+ *
+	@param x FP2 instance, on exit = 1/y
+	@param y FP2 instance
+ */
+extern void FP2_inv(FP2 *x, FP2 *y, FP *h);
+/**	@brief Divide an FP2 by 2
+ *
+	@param x FP2 instance, on exit = y/2
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_div2(FP2 *x, FP2 *y);
+/**	@brief Multiply an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x*(1+sqrt(-1))
+ */
+extern void FP2_mul_ip(FP2 *x);
+
+/**	@brief Divide an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x/(1+sqrt(-1))
+ */
+extern void FP2_div_ip(FP2 *x);
+/**	@brief Normalises the components of an FP2
+ *
+	@param x FP2 instance to be normalised
+ */
+extern void FP2_norm(FP2 *x);
+/**	@brief Reduces all components of possibly unreduced FP2 mod Modulus
+ *
+	@param x FP2 instance, on exit reduced mod Modulus
+ */
+extern void FP2_reduce(FP2 *x);
+/**	@brief Raises an FP2 to the power of a BIG
+ *
+	@param x FP2 instance, on exit = y^b
+	@param y FP2 instance
+	@param b BIG number
+ */
+extern void FP2_pow(FP2 *x, FP2 *y, B384_58::BIG b);
+
+/**	@brief Test FP2 for QR
+ *
+	@param x FP2 instance
+    @param h optional generated hint
+	@return true or false
+ */
+extern int FP2_qr(FP2 *x,FP *h);
+
+
+/**	@brief Square root of an FP2
+ *
+	@param x FP2 instance, on exit = sqrt(y)
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_sqrt(FP2 *x, FP2 *y, FP *h);
+
+/**	@brief Multiply an FP2 by sqrt(-1)
+ *
+	Note that -1 is QNR
+	@param x FP2 instance, on exit = x*sqrt(-1)
+ */
+extern void FP2_times_i(FP2 *x);
+
+/**	@brief Generate random FP2
+ *
+	@param x random FP2 number
+	@param rng random number generator
+ */
+extern void FP2_rand(FP2 *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp2_BLS12443.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp2_BLS12443.h
new file mode 100644
index 0000000..78f88e3
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp2_BLS12443.h
@@ -0,0 +1,306 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP2_BLS12443_H
+#define FP2_BLS12443_H
+
+#include "fp_BLS12443.h"
+
+using namespace core;
+
+namespace BLS12443 {
+
+/**
+	@brief FP2 Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    FP a; /**< real part of FP2 */
+    FP b; /**< imaginary part of FP2 */
+} FP2;
+
+/* FP2 prototypes */
+
+/**	@brief Tests for FP2 equal to zero
+ *
+	@param x FP2 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP2_iszilch(FP2 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP2 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP2_islarger(FP2 *x);
+
+
+/**	@brief Serialize out FP2  
+ *
+    @param b buffer for output
+	@param x FP2 number to be serialized
+ */
+extern void FP2_toBytes(char *b,FP2 *x);
+
+/**	@brief Serialize in FP2  
+ *
+	@param x FP2 number to be serialized
+    @param b buffer for input
+ */
+extern void FP2_fromBytes(FP2 *x,char *b);
+
+/**	@brief Conditional copy of FP2 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP2 instance, set to y if s!=0
+	@param y another FP2 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP2_cmove(FP2 *x, FP2 *y, int s);
+/**	@brief Tests for FP2 equal to one
+ *
+	@param x FP2 instance to be tested
+	@return 1 if x=1, else returns 0
+ */
+extern int FP2_isunity(FP2 *x);
+/**	@brief Tests for equality of two FP2s
+ *
+	@param x FP2 instance to be compared
+	@param y FP2 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP2_equals(FP2 *x, FP2 *y);
+/**	@brief Initialise FP2 from two FP numbers
+ *
+	@param x FP2 instance to be initialised
+	@param a FP to form real part of FP2
+	@param b FP to form imaginary part of FP2
+ */
+extern void FP2_from_FPs(FP2 *x, FP *a, FP *b);
+/**	@brief Initialise FP2 from two BIG integers
+ *
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+	@param b BIG to form imaginary part of FP2
+ */
+extern void FP2_from_BIGs(FP2 *x, B448_60::BIG a, B448_60::BIG b);
+
+
+/**	@brief Initialise FP2 from two integers
+ *
+	@param x FP2 instance to be initialised
+	@param a int to form real part of FP2
+	@param b int to form imaginary part of FP2
+ */
+extern void FP2_from_ints(FP2 *x, int a, int b);
+
+
+
+/**	@brief Initialise FP2 from single FP
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param an FP to form real part of FP2
+ */
+extern void FP2_from_FP(FP2 *x, FP *a);
+/**	@brief Initialise FP2 from single BIG
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+ */
+extern void FP2_from_BIG(FP2 *x, B448_60::BIG a);
+/**	@brief Copy FP2 to another FP2
+ *
+	@param x FP2 instance, on exit = y
+	@param y FP2 instance to be copied
+ */
+extern void FP2_copy(FP2 *x, FP2 *y);
+/**	@brief Set FP2 to zero
+ *
+	@param x FP2 instance to be set to zero
+ */
+extern void FP2_zero(FP2 *x);
+/**	@brief Set FP2 to unity
+ *
+	@param x FP2 instance to be set to one
+ */
+extern void FP2_one(FP2 *x);
+
+/**	@brief Copy from ROM to an FP2
+ *
+	@param w FP2 number to be copied to
+	@param a BIG real part to be copied from ROM
+	@param b BIG imag part to be copied from ROM
+ */
+extern void FP2_rcopy(FP2 *w,const B448_60::BIG a,const B448_60::BIG b);
+
+/**	@brief Sign of FP2
+ *
+	@param x FP2 instance
+	@return "sign" of FP2
+ */
+extern int FP2_sign(FP2 *x);
+
+/**	@brief Negation of FP2
+ *
+	@param x FP2 instance, on exit = -y
+	@param y FP2 instance
+ */
+extern void FP2_neg(FP2 *x, FP2 *y);
+
+
+/**	@brief Conjugation of FP2
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP2 instance, on exit = conj(y)
+	@param y FP2 instance
+ */
+extern void FP2_conj(FP2 *x, FP2 *y);
+/**	@brief addition of two FP2s
+ *
+	@param x FP2 instance, on exit = y+z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_add(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief subtraction of two FP2s
+ *
+	@param x FP2 instance, on exit = y-z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_sub(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Multiplication of an FP2 by an FP
+ *
+	@param x FP2 instance, on exit = y*b
+	@param y FP2 instance
+	@param b FP residue
+ */
+extern void FP2_pmul(FP2 *x, FP2 *y, FP *b);
+/**	@brief Multiplication of an FP2 by a small integer
+ *
+	@param x FP2 instance, on exit = y*i
+	@param y FP2 instance
+	@param i an integer
+ */
+extern void FP2_imul(FP2 *x, FP2 *y, int i);
+/**	@brief Squaring an FP2
+ *
+	@param x FP2 instance, on exit = y^2
+	@param y FP2 instance
+ */
+extern void FP2_sqr(FP2 *x, FP2 *y);
+/**	@brief Multiplication of two FP2s
+ *
+	@param x FP2 instance, on exit = y*z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_mul(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Formats and outputs an FP2 to the console
+ *
+	@param x FP2 instance
+ */
+extern void FP2_output(FP2 *x);
+/**	@brief Formats and outputs an FP2 to the console in raw form (for debugging)
+ *
+	@param x FP2 instance
+ */
+extern void FP2_rawoutput(FP2 *x);
+/**	@brief Inverting an FP2
+ *
+	@param x FP2 instance, on exit = 1/y
+	@param y FP2 instance
+ */
+extern void FP2_inv(FP2 *x, FP2 *y, FP *h);
+/**	@brief Divide an FP2 by 2
+ *
+	@param x FP2 instance, on exit = y/2
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_div2(FP2 *x, FP2 *y);
+/**	@brief Multiply an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x*(1+sqrt(-1))
+ */
+extern void FP2_mul_ip(FP2 *x);
+
+/**	@brief Divide an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x/(1+sqrt(-1))
+ */
+extern void FP2_div_ip(FP2 *x);
+/**	@brief Normalises the components of an FP2
+ *
+	@param x FP2 instance to be normalised
+ */
+extern void FP2_norm(FP2 *x);
+/**	@brief Reduces all components of possibly unreduced FP2 mod Modulus
+ *
+	@param x FP2 instance, on exit reduced mod Modulus
+ */
+extern void FP2_reduce(FP2 *x);
+/**	@brief Raises an FP2 to the power of a BIG
+ *
+	@param x FP2 instance, on exit = y^b
+	@param y FP2 instance
+	@param b BIG number
+ */
+extern void FP2_pow(FP2 *x, FP2 *y, B448_60::BIG b);
+
+/**	@brief Test FP2 for QR
+ *
+	@param x FP2 instance
+    @param h optional generated hint
+	@return true or false
+ */
+extern int FP2_qr(FP2 *x,FP *h);
+
+
+/**	@brief Square root of an FP2
+ *
+	@param x FP2 instance, on exit = sqrt(y)
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_sqrt(FP2 *x, FP2 *y, FP *h);
+
+/**	@brief Multiply an FP2 by sqrt(-1)
+ *
+	Note that -1 is QNR
+	@param x FP2 instance, on exit = x*sqrt(-1)
+ */
+extern void FP2_times_i(FP2 *x);
+
+/**	@brief Generate random FP2
+ *
+	@param x random FP2 number
+	@param rng random number generator
+ */
+extern void FP2_rand(FP2 *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp2_BLS12461.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp2_BLS12461.h
new file mode 100644
index 0000000..9487af4
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp2_BLS12461.h
@@ -0,0 +1,306 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP2_BLS12461_H
+#define FP2_BLS12461_H
+
+#include "fp_BLS12461.h"
+
+using namespace core;
+
+namespace BLS12461 {
+
+/**
+	@brief FP2 Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    FP a; /**< real part of FP2 */
+    FP b; /**< imaginary part of FP2 */
+} FP2;
+
+/* FP2 prototypes */
+
+/**	@brief Tests for FP2 equal to zero
+ *
+	@param x FP2 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP2_iszilch(FP2 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP2 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP2_islarger(FP2 *x);
+
+
+/**	@brief Serialize out FP2  
+ *
+    @param b buffer for output
+	@param x FP2 number to be serialized
+ */
+extern void FP2_toBytes(char *b,FP2 *x);
+
+/**	@brief Serialize in FP2  
+ *
+	@param x FP2 number to be serialized
+    @param b buffer for input
+ */
+extern void FP2_fromBytes(FP2 *x,char *b);
+
+/**	@brief Conditional copy of FP2 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP2 instance, set to y if s!=0
+	@param y another FP2 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP2_cmove(FP2 *x, FP2 *y, int s);
+/**	@brief Tests for FP2 equal to one
+ *
+	@param x FP2 instance to be tested
+	@return 1 if x=1, else returns 0
+ */
+extern int FP2_isunity(FP2 *x);
+/**	@brief Tests for equality of two FP2s
+ *
+	@param x FP2 instance to be compared
+	@param y FP2 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP2_equals(FP2 *x, FP2 *y);
+/**	@brief Initialise FP2 from two FP numbers
+ *
+	@param x FP2 instance to be initialised
+	@param a FP to form real part of FP2
+	@param b FP to form imaginary part of FP2
+ */
+extern void FP2_from_FPs(FP2 *x, FP *a, FP *b);
+/**	@brief Initialise FP2 from two BIG integers
+ *
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+	@param b BIG to form imaginary part of FP2
+ */
+extern void FP2_from_BIGs(FP2 *x, B464_60::BIG a, B464_60::BIG b);
+
+
+/**	@brief Initialise FP2 from two integers
+ *
+	@param x FP2 instance to be initialised
+	@param a int to form real part of FP2
+	@param b int to form imaginary part of FP2
+ */
+extern void FP2_from_ints(FP2 *x, int a, int b);
+
+
+
+/**	@brief Initialise FP2 from single FP
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param an FP to form real part of FP2
+ */
+extern void FP2_from_FP(FP2 *x, FP *a);
+/**	@brief Initialise FP2 from single BIG
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+ */
+extern void FP2_from_BIG(FP2 *x, B464_60::BIG a);
+/**	@brief Copy FP2 to another FP2
+ *
+	@param x FP2 instance, on exit = y
+	@param y FP2 instance to be copied
+ */
+extern void FP2_copy(FP2 *x, FP2 *y);
+/**	@brief Set FP2 to zero
+ *
+	@param x FP2 instance to be set to zero
+ */
+extern void FP2_zero(FP2 *x);
+/**	@brief Set FP2 to unity
+ *
+	@param x FP2 instance to be set to one
+ */
+extern void FP2_one(FP2 *x);
+
+/**	@brief Copy from ROM to an FP2
+ *
+	@param w FP2 number to be copied to
+	@param a BIG real part to be copied from ROM
+	@param b BIG imag part to be copied from ROM
+ */
+extern void FP2_rcopy(FP2 *w,const B464_60::BIG a,const B464_60::BIG b);
+
+/**	@brief Sign of FP2
+ *
+	@param x FP2 instance
+	@return "sign" of FP2
+ */
+extern int FP2_sign(FP2 *x);
+
+/**	@brief Negation of FP2
+ *
+	@param x FP2 instance, on exit = -y
+	@param y FP2 instance
+ */
+extern void FP2_neg(FP2 *x, FP2 *y);
+
+
+/**	@brief Conjugation of FP2
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP2 instance, on exit = conj(y)
+	@param y FP2 instance
+ */
+extern void FP2_conj(FP2 *x, FP2 *y);
+/**	@brief addition of two FP2s
+ *
+	@param x FP2 instance, on exit = y+z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_add(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief subtraction of two FP2s
+ *
+	@param x FP2 instance, on exit = y-z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_sub(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Multiplication of an FP2 by an FP
+ *
+	@param x FP2 instance, on exit = y*b
+	@param y FP2 instance
+	@param b FP residue
+ */
+extern void FP2_pmul(FP2 *x, FP2 *y, FP *b);
+/**	@brief Multiplication of an FP2 by a small integer
+ *
+	@param x FP2 instance, on exit = y*i
+	@param y FP2 instance
+	@param i an integer
+ */
+extern void FP2_imul(FP2 *x, FP2 *y, int i);
+/**	@brief Squaring an FP2
+ *
+	@param x FP2 instance, on exit = y^2
+	@param y FP2 instance
+ */
+extern void FP2_sqr(FP2 *x, FP2 *y);
+/**	@brief Multiplication of two FP2s
+ *
+	@param x FP2 instance, on exit = y*z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_mul(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Formats and outputs an FP2 to the console
+ *
+	@param x FP2 instance
+ */
+extern void FP2_output(FP2 *x);
+/**	@brief Formats and outputs an FP2 to the console in raw form (for debugging)
+ *
+	@param x FP2 instance
+ */
+extern void FP2_rawoutput(FP2 *x);
+/**	@brief Inverting an FP2
+ *
+	@param x FP2 instance, on exit = 1/y
+	@param y FP2 instance
+ */
+extern void FP2_inv(FP2 *x, FP2 *y, FP *h);
+/**	@brief Divide an FP2 by 2
+ *
+	@param x FP2 instance, on exit = y/2
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_div2(FP2 *x, FP2 *y);
+/**	@brief Multiply an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x*(1+sqrt(-1))
+ */
+extern void FP2_mul_ip(FP2 *x);
+
+/**	@brief Divide an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x/(1+sqrt(-1))
+ */
+extern void FP2_div_ip(FP2 *x);
+/**	@brief Normalises the components of an FP2
+ *
+	@param x FP2 instance to be normalised
+ */
+extern void FP2_norm(FP2 *x);
+/**	@brief Reduces all components of possibly unreduced FP2 mod Modulus
+ *
+	@param x FP2 instance, on exit reduced mod Modulus
+ */
+extern void FP2_reduce(FP2 *x);
+/**	@brief Raises an FP2 to the power of a BIG
+ *
+	@param x FP2 instance, on exit = y^b
+	@param y FP2 instance
+	@param b BIG number
+ */
+extern void FP2_pow(FP2 *x, FP2 *y, B464_60::BIG b);
+
+/**	@brief Test FP2 for QR
+ *
+	@param x FP2 instance
+    @param h optional generated hint
+	@return true or false
+ */
+extern int FP2_qr(FP2 *x,FP *h);
+
+
+/**	@brief Square root of an FP2
+ *
+	@param x FP2 instance, on exit = sqrt(y)
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_sqrt(FP2 *x, FP2 *y, FP *h);
+
+/**	@brief Multiply an FP2 by sqrt(-1)
+ *
+	Note that -1 is QNR
+	@param x FP2 instance, on exit = x*sqrt(-1)
+ */
+extern void FP2_times_i(FP2 *x);
+
+/**	@brief Generate random FP2
+ *
+	@param x random FP2 number
+	@param rng random number generator
+ */
+extern void FP2_rand(FP2 *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp2_BLS24479.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp2_BLS24479.h
new file mode 100644
index 0000000..c4dde22
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp2_BLS24479.h
@@ -0,0 +1,306 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP2_BLS24479_H
+#define FP2_BLS24479_H
+
+#include "fp_BLS24479.h"
+
+using namespace core;
+
+namespace BLS24479 {
+
+/**
+	@brief FP2 Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    FP a; /**< real part of FP2 */
+    FP b; /**< imaginary part of FP2 */
+} FP2;
+
+/* FP2 prototypes */
+
+/**	@brief Tests for FP2 equal to zero
+ *
+	@param x FP2 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP2_iszilch(FP2 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP2 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP2_islarger(FP2 *x);
+
+
+/**	@brief Serialize out FP2  
+ *
+    @param b buffer for output
+	@param x FP2 number to be serialized
+ */
+extern void FP2_toBytes(char *b,FP2 *x);
+
+/**	@brief Serialize in FP2  
+ *
+	@param x FP2 number to be serialized
+    @param b buffer for input
+ */
+extern void FP2_fromBytes(FP2 *x,char *b);
+
+/**	@brief Conditional copy of FP2 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP2 instance, set to y if s!=0
+	@param y another FP2 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP2_cmove(FP2 *x, FP2 *y, int s);
+/**	@brief Tests for FP2 equal to one
+ *
+	@param x FP2 instance to be tested
+	@return 1 if x=1, else returns 0
+ */
+extern int FP2_isunity(FP2 *x);
+/**	@brief Tests for equality of two FP2s
+ *
+	@param x FP2 instance to be compared
+	@param y FP2 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP2_equals(FP2 *x, FP2 *y);
+/**	@brief Initialise FP2 from two FP numbers
+ *
+	@param x FP2 instance to be initialised
+	@param a FP to form real part of FP2
+	@param b FP to form imaginary part of FP2
+ */
+extern void FP2_from_FPs(FP2 *x, FP *a, FP *b);
+/**	@brief Initialise FP2 from two BIG integers
+ *
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+	@param b BIG to form imaginary part of FP2
+ */
+extern void FP2_from_BIGs(FP2 *x, B480_56::BIG a, B480_56::BIG b);
+
+
+/**	@brief Initialise FP2 from two integers
+ *
+	@param x FP2 instance to be initialised
+	@param a int to form real part of FP2
+	@param b int to form imaginary part of FP2
+ */
+extern void FP2_from_ints(FP2 *x, int a, int b);
+
+
+
+/**	@brief Initialise FP2 from single FP
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param an FP to form real part of FP2
+ */
+extern void FP2_from_FP(FP2 *x, FP *a);
+/**	@brief Initialise FP2 from single BIG
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+ */
+extern void FP2_from_BIG(FP2 *x, B480_56::BIG a);
+/**	@brief Copy FP2 to another FP2
+ *
+	@param x FP2 instance, on exit = y
+	@param y FP2 instance to be copied
+ */
+extern void FP2_copy(FP2 *x, FP2 *y);
+/**	@brief Set FP2 to zero
+ *
+	@param x FP2 instance to be set to zero
+ */
+extern void FP2_zero(FP2 *x);
+/**	@brief Set FP2 to unity
+ *
+	@param x FP2 instance to be set to one
+ */
+extern void FP2_one(FP2 *x);
+
+/**	@brief Copy from ROM to an FP2
+ *
+	@param w FP2 number to be copied to
+	@param a BIG real part to be copied from ROM
+	@param b BIG imag part to be copied from ROM
+ */
+extern void FP2_rcopy(FP2 *w,const B480_56::BIG a,const B480_56::BIG b);
+
+/**	@brief Sign of FP2
+ *
+	@param x FP2 instance
+	@return "sign" of FP2
+ */
+extern int FP2_sign(FP2 *x);
+
+/**	@brief Negation of FP2
+ *
+	@param x FP2 instance, on exit = -y
+	@param y FP2 instance
+ */
+extern void FP2_neg(FP2 *x, FP2 *y);
+
+
+/**	@brief Conjugation of FP2
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP2 instance, on exit = conj(y)
+	@param y FP2 instance
+ */
+extern void FP2_conj(FP2 *x, FP2 *y);
+/**	@brief addition of two FP2s
+ *
+	@param x FP2 instance, on exit = y+z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_add(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief subtraction of two FP2s
+ *
+	@param x FP2 instance, on exit = y-z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_sub(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Multiplication of an FP2 by an FP
+ *
+	@param x FP2 instance, on exit = y*b
+	@param y FP2 instance
+	@param b FP residue
+ */
+extern void FP2_pmul(FP2 *x, FP2 *y, FP *b);
+/**	@brief Multiplication of an FP2 by a small integer
+ *
+	@param x FP2 instance, on exit = y*i
+	@param y FP2 instance
+	@param i an integer
+ */
+extern void FP2_imul(FP2 *x, FP2 *y, int i);
+/**	@brief Squaring an FP2
+ *
+	@param x FP2 instance, on exit = y^2
+	@param y FP2 instance
+ */
+extern void FP2_sqr(FP2 *x, FP2 *y);
+/**	@brief Multiplication of two FP2s
+ *
+	@param x FP2 instance, on exit = y*z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_mul(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Formats and outputs an FP2 to the console
+ *
+	@param x FP2 instance
+ */
+extern void FP2_output(FP2 *x);
+/**	@brief Formats and outputs an FP2 to the console in raw form (for debugging)
+ *
+	@param x FP2 instance
+ */
+extern void FP2_rawoutput(FP2 *x);
+/**	@brief Inverting an FP2
+ *
+	@param x FP2 instance, on exit = 1/y
+	@param y FP2 instance
+ */
+extern void FP2_inv(FP2 *x, FP2 *y, FP *h);
+/**	@brief Divide an FP2 by 2
+ *
+	@param x FP2 instance, on exit = y/2
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_div2(FP2 *x, FP2 *y);
+/**	@brief Multiply an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x*(1+sqrt(-1))
+ */
+extern void FP2_mul_ip(FP2 *x);
+
+/**	@brief Divide an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x/(1+sqrt(-1))
+ */
+extern void FP2_div_ip(FP2 *x);
+/**	@brief Normalises the components of an FP2
+ *
+	@param x FP2 instance to be normalised
+ */
+extern void FP2_norm(FP2 *x);
+/**	@brief Reduces all components of possibly unreduced FP2 mod Modulus
+ *
+	@param x FP2 instance, on exit reduced mod Modulus
+ */
+extern void FP2_reduce(FP2 *x);
+/**	@brief Raises an FP2 to the power of a BIG
+ *
+	@param x FP2 instance, on exit = y^b
+	@param y FP2 instance
+	@param b BIG number
+ */
+extern void FP2_pow(FP2 *x, FP2 *y, B480_56::BIG b);
+
+/**	@brief Test FP2 for QR
+ *
+	@param x FP2 instance
+    @param h optional generated hint
+	@return true or false
+ */
+extern int FP2_qr(FP2 *x,FP *h);
+
+
+/**	@brief Square root of an FP2
+ *
+	@param x FP2 instance, on exit = sqrt(y)
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_sqrt(FP2 *x, FP2 *y, FP *h);
+
+/**	@brief Multiply an FP2 by sqrt(-1)
+ *
+	Note that -1 is QNR
+	@param x FP2 instance, on exit = x*sqrt(-1)
+ */
+extern void FP2_times_i(FP2 *x);
+
+/**	@brief Generate random FP2
+ *
+	@param x random FP2 number
+	@param rng random number generator
+ */
+extern void FP2_rand(FP2 *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp2_BLS48286.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp2_BLS48286.h
new file mode 100644
index 0000000..7e15f39
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp2_BLS48286.h
@@ -0,0 +1,306 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP2_BLS48286_H
+#define FP2_BLS48286_H
+
+#include "fp_BLS48286.h"
+
+using namespace core;
+
+namespace BLS48286 {
+
+/**
+	@brief FP2 Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    FP a; /**< real part of FP2 */
+    FP b; /**< imaginary part of FP2 */
+} FP2;
+
+/* FP2 prototypes */
+
+/**	@brief Tests for FP2 equal to zero
+ *
+	@param x FP2 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP2_iszilch(FP2 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP2 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP2_islarger(FP2 *x);
+
+
+/**	@brief Serialize out FP2  
+ *
+    @param b buffer for output
+	@param x FP2 number to be serialized
+ */
+extern void FP2_toBytes(char *b,FP2 *x);
+
+/**	@brief Serialize in FP2  
+ *
+	@param x FP2 number to be serialized
+    @param b buffer for input
+ */
+extern void FP2_fromBytes(FP2 *x,char *b);
+
+/**	@brief Conditional copy of FP2 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP2 instance, set to y if s!=0
+	@param y another FP2 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP2_cmove(FP2 *x, FP2 *y, int s);
+/**	@brief Tests for FP2 equal to one
+ *
+	@param x FP2 instance to be tested
+	@return 1 if x=1, else returns 0
+ */
+extern int FP2_isunity(FP2 *x);
+/**	@brief Tests for equality of two FP2s
+ *
+	@param x FP2 instance to be compared
+	@param y FP2 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP2_equals(FP2 *x, FP2 *y);
+/**	@brief Initialise FP2 from two FP numbers
+ *
+	@param x FP2 instance to be initialised
+	@param a FP to form real part of FP2
+	@param b FP to form imaginary part of FP2
+ */
+extern void FP2_from_FPs(FP2 *x, FP *a, FP *b);
+/**	@brief Initialise FP2 from two BIG integers
+ *
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+	@param b BIG to form imaginary part of FP2
+ */
+extern void FP2_from_BIGs(FP2 *x, B288_60::BIG a, B288_60::BIG b);
+
+
+/**	@brief Initialise FP2 from two integers
+ *
+	@param x FP2 instance to be initialised
+	@param a int to form real part of FP2
+	@param b int to form imaginary part of FP2
+ */
+extern void FP2_from_ints(FP2 *x, int a, int b);
+
+
+
+/**	@brief Initialise FP2 from single FP
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param an FP to form real part of FP2
+ */
+extern void FP2_from_FP(FP2 *x, FP *a);
+/**	@brief Initialise FP2 from single BIG
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+ */
+extern void FP2_from_BIG(FP2 *x, B288_60::BIG a);
+/**	@brief Copy FP2 to another FP2
+ *
+	@param x FP2 instance, on exit = y
+	@param y FP2 instance to be copied
+ */
+extern void FP2_copy(FP2 *x, FP2 *y);
+/**	@brief Set FP2 to zero
+ *
+	@param x FP2 instance to be set to zero
+ */
+extern void FP2_zero(FP2 *x);
+/**	@brief Set FP2 to unity
+ *
+	@param x FP2 instance to be set to one
+ */
+extern void FP2_one(FP2 *x);
+
+/**	@brief Copy from ROM to an FP2
+ *
+	@param w FP2 number to be copied to
+	@param a BIG real part to be copied from ROM
+	@param b BIG imag part to be copied from ROM
+ */
+extern void FP2_rcopy(FP2 *w,const B288_60::BIG a,const B288_60::BIG b);
+
+/**	@brief Sign of FP2
+ *
+	@param x FP2 instance
+	@return "sign" of FP2
+ */
+extern int FP2_sign(FP2 *x);
+
+/**	@brief Negation of FP2
+ *
+	@param x FP2 instance, on exit = -y
+	@param y FP2 instance
+ */
+extern void FP2_neg(FP2 *x, FP2 *y);
+
+
+/**	@brief Conjugation of FP2
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP2 instance, on exit = conj(y)
+	@param y FP2 instance
+ */
+extern void FP2_conj(FP2 *x, FP2 *y);
+/**	@brief addition of two FP2s
+ *
+	@param x FP2 instance, on exit = y+z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_add(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief subtraction of two FP2s
+ *
+	@param x FP2 instance, on exit = y-z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_sub(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Multiplication of an FP2 by an FP
+ *
+	@param x FP2 instance, on exit = y*b
+	@param y FP2 instance
+	@param b FP residue
+ */
+extern void FP2_pmul(FP2 *x, FP2 *y, FP *b);
+/**	@brief Multiplication of an FP2 by a small integer
+ *
+	@param x FP2 instance, on exit = y*i
+	@param y FP2 instance
+	@param i an integer
+ */
+extern void FP2_imul(FP2 *x, FP2 *y, int i);
+/**	@brief Squaring an FP2
+ *
+	@param x FP2 instance, on exit = y^2
+	@param y FP2 instance
+ */
+extern void FP2_sqr(FP2 *x, FP2 *y);
+/**	@brief Multiplication of two FP2s
+ *
+	@param x FP2 instance, on exit = y*z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_mul(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Formats and outputs an FP2 to the console
+ *
+	@param x FP2 instance
+ */
+extern void FP2_output(FP2 *x);
+/**	@brief Formats and outputs an FP2 to the console in raw form (for debugging)
+ *
+	@param x FP2 instance
+ */
+extern void FP2_rawoutput(FP2 *x);
+/**	@brief Inverting an FP2
+ *
+	@param x FP2 instance, on exit = 1/y
+	@param y FP2 instance
+ */
+extern void FP2_inv(FP2 *x, FP2 *y, FP *h);
+/**	@brief Divide an FP2 by 2
+ *
+	@param x FP2 instance, on exit = y/2
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_div2(FP2 *x, FP2 *y);
+/**	@brief Multiply an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x*(1+sqrt(-1))
+ */
+extern void FP2_mul_ip(FP2 *x);
+
+/**	@brief Divide an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x/(1+sqrt(-1))
+ */
+extern void FP2_div_ip(FP2 *x);
+/**	@brief Normalises the components of an FP2
+ *
+	@param x FP2 instance to be normalised
+ */
+extern void FP2_norm(FP2 *x);
+/**	@brief Reduces all components of possibly unreduced FP2 mod Modulus
+ *
+	@param x FP2 instance, on exit reduced mod Modulus
+ */
+extern void FP2_reduce(FP2 *x);
+/**	@brief Raises an FP2 to the power of a BIG
+ *
+	@param x FP2 instance, on exit = y^b
+	@param y FP2 instance
+	@param b BIG number
+ */
+extern void FP2_pow(FP2 *x, FP2 *y, B288_60::BIG b);
+
+/**	@brief Test FP2 for QR
+ *
+	@param x FP2 instance
+    @param h optional generated hint
+	@return true or false
+ */
+extern int FP2_qr(FP2 *x,FP *h);
+
+
+/**	@brief Square root of an FP2
+ *
+	@param x FP2 instance, on exit = sqrt(y)
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_sqrt(FP2 *x, FP2 *y, FP *h);
+
+/**	@brief Multiply an FP2 by sqrt(-1)
+ *
+	Note that -1 is QNR
+	@param x FP2 instance, on exit = x*sqrt(-1)
+ */
+extern void FP2_times_i(FP2 *x);
+
+/**	@brief Generate random FP2
+ *
+	@param x random FP2 number
+	@param rng random number generator
+ */
+extern void FP2_rand(FP2 *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp2_BLS48556.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp2_BLS48556.h
new file mode 100644
index 0000000..665019b
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp2_BLS48556.h
@@ -0,0 +1,306 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP2_BLS48556_H
+#define FP2_BLS48556_H
+
+#include "fp_BLS48556.h"
+
+using namespace core;
+
+namespace BLS48556 {
+
+/**
+	@brief FP2 Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    FP a; /**< real part of FP2 */
+    FP b; /**< imaginary part of FP2 */
+} FP2;
+
+/* FP2 prototypes */
+
+/**	@brief Tests for FP2 equal to zero
+ *
+	@param x FP2 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP2_iszilch(FP2 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP2 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP2_islarger(FP2 *x);
+
+
+/**	@brief Serialize out FP2  
+ *
+    @param b buffer for output
+	@param x FP2 number to be serialized
+ */
+extern void FP2_toBytes(char *b,FP2 *x);
+
+/**	@brief Serialize in FP2  
+ *
+	@param x FP2 number to be serialized
+    @param b buffer for input
+ */
+extern void FP2_fromBytes(FP2 *x,char *b);
+
+/**	@brief Conditional copy of FP2 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP2 instance, set to y if s!=0
+	@param y another FP2 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP2_cmove(FP2 *x, FP2 *y, int s);
+/**	@brief Tests for FP2 equal to one
+ *
+	@param x FP2 instance to be tested
+	@return 1 if x=1, else returns 0
+ */
+extern int FP2_isunity(FP2 *x);
+/**	@brief Tests for equality of two FP2s
+ *
+	@param x FP2 instance to be compared
+	@param y FP2 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP2_equals(FP2 *x, FP2 *y);
+/**	@brief Initialise FP2 from two FP numbers
+ *
+	@param x FP2 instance to be initialised
+	@param a FP to form real part of FP2
+	@param b FP to form imaginary part of FP2
+ */
+extern void FP2_from_FPs(FP2 *x, FP *a, FP *b);
+/**	@brief Initialise FP2 from two BIG integers
+ *
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+	@param b BIG to form imaginary part of FP2
+ */
+extern void FP2_from_BIGs(FP2 *x, B560_58::BIG a, B560_58::BIG b);
+
+
+/**	@brief Initialise FP2 from two integers
+ *
+	@param x FP2 instance to be initialised
+	@param a int to form real part of FP2
+	@param b int to form imaginary part of FP2
+ */
+extern void FP2_from_ints(FP2 *x, int a, int b);
+
+
+
+/**	@brief Initialise FP2 from single FP
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param an FP to form real part of FP2
+ */
+extern void FP2_from_FP(FP2 *x, FP *a);
+/**	@brief Initialise FP2 from single BIG
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+ */
+extern void FP2_from_BIG(FP2 *x, B560_58::BIG a);
+/**	@brief Copy FP2 to another FP2
+ *
+	@param x FP2 instance, on exit = y
+	@param y FP2 instance to be copied
+ */
+extern void FP2_copy(FP2 *x, FP2 *y);
+/**	@brief Set FP2 to zero
+ *
+	@param x FP2 instance to be set to zero
+ */
+extern void FP2_zero(FP2 *x);
+/**	@brief Set FP2 to unity
+ *
+	@param x FP2 instance to be set to one
+ */
+extern void FP2_one(FP2 *x);
+
+/**	@brief Copy from ROM to an FP2
+ *
+	@param w FP2 number to be copied to
+	@param a BIG real part to be copied from ROM
+	@param b BIG imag part to be copied from ROM
+ */
+extern void FP2_rcopy(FP2 *w,const B560_58::BIG a,const B560_58::BIG b);
+
+/**	@brief Sign of FP2
+ *
+	@param x FP2 instance
+	@return "sign" of FP2
+ */
+extern int FP2_sign(FP2 *x);
+
+/**	@brief Negation of FP2
+ *
+	@param x FP2 instance, on exit = -y
+	@param y FP2 instance
+ */
+extern void FP2_neg(FP2 *x, FP2 *y);
+
+
+/**	@brief Conjugation of FP2
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP2 instance, on exit = conj(y)
+	@param y FP2 instance
+ */
+extern void FP2_conj(FP2 *x, FP2 *y);
+/**	@brief addition of two FP2s
+ *
+	@param x FP2 instance, on exit = y+z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_add(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief subtraction of two FP2s
+ *
+	@param x FP2 instance, on exit = y-z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_sub(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Multiplication of an FP2 by an FP
+ *
+	@param x FP2 instance, on exit = y*b
+	@param y FP2 instance
+	@param b FP residue
+ */
+extern void FP2_pmul(FP2 *x, FP2 *y, FP *b);
+/**	@brief Multiplication of an FP2 by a small integer
+ *
+	@param x FP2 instance, on exit = y*i
+	@param y FP2 instance
+	@param i an integer
+ */
+extern void FP2_imul(FP2 *x, FP2 *y, int i);
+/**	@brief Squaring an FP2
+ *
+	@param x FP2 instance, on exit = y^2
+	@param y FP2 instance
+ */
+extern void FP2_sqr(FP2 *x, FP2 *y);
+/**	@brief Multiplication of two FP2s
+ *
+	@param x FP2 instance, on exit = y*z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_mul(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Formats and outputs an FP2 to the console
+ *
+	@param x FP2 instance
+ */
+extern void FP2_output(FP2 *x);
+/**	@brief Formats and outputs an FP2 to the console in raw form (for debugging)
+ *
+	@param x FP2 instance
+ */
+extern void FP2_rawoutput(FP2 *x);
+/**	@brief Inverting an FP2
+ *
+	@param x FP2 instance, on exit = 1/y
+	@param y FP2 instance
+ */
+extern void FP2_inv(FP2 *x, FP2 *y, FP *h);
+/**	@brief Divide an FP2 by 2
+ *
+	@param x FP2 instance, on exit = y/2
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_div2(FP2 *x, FP2 *y);
+/**	@brief Multiply an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x*(1+sqrt(-1))
+ */
+extern void FP2_mul_ip(FP2 *x);
+
+/**	@brief Divide an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x/(1+sqrt(-1))
+ */
+extern void FP2_div_ip(FP2 *x);
+/**	@brief Normalises the components of an FP2
+ *
+	@param x FP2 instance to be normalised
+ */
+extern void FP2_norm(FP2 *x);
+/**	@brief Reduces all components of possibly unreduced FP2 mod Modulus
+ *
+	@param x FP2 instance, on exit reduced mod Modulus
+ */
+extern void FP2_reduce(FP2 *x);
+/**	@brief Raises an FP2 to the power of a BIG
+ *
+	@param x FP2 instance, on exit = y^b
+	@param y FP2 instance
+	@param b BIG number
+ */
+extern void FP2_pow(FP2 *x, FP2 *y, B560_58::BIG b);
+
+/**	@brief Test FP2 for QR
+ *
+	@param x FP2 instance
+    @param h optional generated hint
+	@return true or false
+ */
+extern int FP2_qr(FP2 *x,FP *h);
+
+
+/**	@brief Square root of an FP2
+ *
+	@param x FP2 instance, on exit = sqrt(y)
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_sqrt(FP2 *x, FP2 *y, FP *h);
+
+/**	@brief Multiply an FP2 by sqrt(-1)
+ *
+	Note that -1 is QNR
+	@param x FP2 instance, on exit = x*sqrt(-1)
+ */
+extern void FP2_times_i(FP2 *x);
+
+/**	@brief Generate random FP2
+ *
+	@param x random FP2 number
+	@param rng random number generator
+ */
+extern void FP2_rand(FP2 *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp2_BLS48581.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp2_BLS48581.h
new file mode 100644
index 0000000..b410455
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp2_BLS48581.h
@@ -0,0 +1,306 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP2_BLS48581_H
+#define FP2_BLS48581_H
+
+#include "fp_BLS48581.h"
+
+using namespace core;
+
+namespace BLS48581 {
+
+/**
+	@brief FP2 Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    FP a; /**< real part of FP2 */
+    FP b; /**< imaginary part of FP2 */
+} FP2;
+
+/* FP2 prototypes */
+
+/**	@brief Tests for FP2 equal to zero
+ *
+	@param x FP2 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP2_iszilch(FP2 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP2 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP2_islarger(FP2 *x);
+
+
+/**	@brief Serialize out FP2  
+ *
+    @param b buffer for output
+	@param x FP2 number to be serialized
+ */
+extern void FP2_toBytes(char *b,FP2 *x);
+
+/**	@brief Serialize in FP2  
+ *
+	@param x FP2 number to be serialized
+    @param b buffer for input
+ */
+extern void FP2_fromBytes(FP2 *x,char *b);
+
+/**	@brief Conditional copy of FP2 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP2 instance, set to y if s!=0
+	@param y another FP2 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP2_cmove(FP2 *x, FP2 *y, int s);
+/**	@brief Tests for FP2 equal to one
+ *
+	@param x FP2 instance to be tested
+	@return 1 if x=1, else returns 0
+ */
+extern int FP2_isunity(FP2 *x);
+/**	@brief Tests for equality of two FP2s
+ *
+	@param x FP2 instance to be compared
+	@param y FP2 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP2_equals(FP2 *x, FP2 *y);
+/**	@brief Initialise FP2 from two FP numbers
+ *
+	@param x FP2 instance to be initialised
+	@param a FP to form real part of FP2
+	@param b FP to form imaginary part of FP2
+ */
+extern void FP2_from_FPs(FP2 *x, FP *a, FP *b);
+/**	@brief Initialise FP2 from two BIG integers
+ *
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+	@param b BIG to form imaginary part of FP2
+ */
+extern void FP2_from_BIGs(FP2 *x, B584_60::BIG a, B584_60::BIG b);
+
+
+/**	@brief Initialise FP2 from two integers
+ *
+	@param x FP2 instance to be initialised
+	@param a int to form real part of FP2
+	@param b int to form imaginary part of FP2
+ */
+extern void FP2_from_ints(FP2 *x, int a, int b);
+
+
+
+/**	@brief Initialise FP2 from single FP
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param an FP to form real part of FP2
+ */
+extern void FP2_from_FP(FP2 *x, FP *a);
+/**	@brief Initialise FP2 from single BIG
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+ */
+extern void FP2_from_BIG(FP2 *x, B584_60::BIG a);
+/**	@brief Copy FP2 to another FP2
+ *
+	@param x FP2 instance, on exit = y
+	@param y FP2 instance to be copied
+ */
+extern void FP2_copy(FP2 *x, FP2 *y);
+/**	@brief Set FP2 to zero
+ *
+	@param x FP2 instance to be set to zero
+ */
+extern void FP2_zero(FP2 *x);
+/**	@brief Set FP2 to unity
+ *
+	@param x FP2 instance to be set to one
+ */
+extern void FP2_one(FP2 *x);
+
+/**	@brief Copy from ROM to an FP2
+ *
+	@param w FP2 number to be copied to
+	@param a BIG real part to be copied from ROM
+	@param b BIG imag part to be copied from ROM
+ */
+extern void FP2_rcopy(FP2 *w,const B584_60::BIG a,const B584_60::BIG b);
+
+/**	@brief Sign of FP2
+ *
+	@param x FP2 instance
+	@return "sign" of FP2
+ */
+extern int FP2_sign(FP2 *x);
+
+/**	@brief Negation of FP2
+ *
+	@param x FP2 instance, on exit = -y
+	@param y FP2 instance
+ */
+extern void FP2_neg(FP2 *x, FP2 *y);
+
+
+/**	@brief Conjugation of FP2
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP2 instance, on exit = conj(y)
+	@param y FP2 instance
+ */
+extern void FP2_conj(FP2 *x, FP2 *y);
+/**	@brief addition of two FP2s
+ *
+	@param x FP2 instance, on exit = y+z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_add(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief subtraction of two FP2s
+ *
+	@param x FP2 instance, on exit = y-z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_sub(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Multiplication of an FP2 by an FP
+ *
+	@param x FP2 instance, on exit = y*b
+	@param y FP2 instance
+	@param b FP residue
+ */
+extern void FP2_pmul(FP2 *x, FP2 *y, FP *b);
+/**	@brief Multiplication of an FP2 by a small integer
+ *
+	@param x FP2 instance, on exit = y*i
+	@param y FP2 instance
+	@param i an integer
+ */
+extern void FP2_imul(FP2 *x, FP2 *y, int i);
+/**	@brief Squaring an FP2
+ *
+	@param x FP2 instance, on exit = y^2
+	@param y FP2 instance
+ */
+extern void FP2_sqr(FP2 *x, FP2 *y);
+/**	@brief Multiplication of two FP2s
+ *
+	@param x FP2 instance, on exit = y*z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_mul(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Formats and outputs an FP2 to the console
+ *
+	@param x FP2 instance
+ */
+extern void FP2_output(FP2 *x);
+/**	@brief Formats and outputs an FP2 to the console in raw form (for debugging)
+ *
+	@param x FP2 instance
+ */
+extern void FP2_rawoutput(FP2 *x);
+/**	@brief Inverting an FP2
+ *
+	@param x FP2 instance, on exit = 1/y
+	@param y FP2 instance
+ */
+extern void FP2_inv(FP2 *x, FP2 *y, FP *h);
+/**	@brief Divide an FP2 by 2
+ *
+	@param x FP2 instance, on exit = y/2
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_div2(FP2 *x, FP2 *y);
+/**	@brief Multiply an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x*(1+sqrt(-1))
+ */
+extern void FP2_mul_ip(FP2 *x);
+
+/**	@brief Divide an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x/(1+sqrt(-1))
+ */
+extern void FP2_div_ip(FP2 *x);
+/**	@brief Normalises the components of an FP2
+ *
+	@param x FP2 instance to be normalised
+ */
+extern void FP2_norm(FP2 *x);
+/**	@brief Reduces all components of possibly unreduced FP2 mod Modulus
+ *
+	@param x FP2 instance, on exit reduced mod Modulus
+ */
+extern void FP2_reduce(FP2 *x);
+/**	@brief Raises an FP2 to the power of a BIG
+ *
+	@param x FP2 instance, on exit = y^b
+	@param y FP2 instance
+	@param b BIG number
+ */
+extern void FP2_pow(FP2 *x, FP2 *y, B584_60::BIG b);
+
+/**	@brief Test FP2 for QR
+ *
+	@param x FP2 instance
+    @param h optional generated hint
+	@return true or false
+ */
+extern int FP2_qr(FP2 *x,FP *h);
+
+
+/**	@brief Square root of an FP2
+ *
+	@param x FP2 instance, on exit = sqrt(y)
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_sqrt(FP2 *x, FP2 *y, FP *h);
+
+/**	@brief Multiply an FP2 by sqrt(-1)
+ *
+	Note that -1 is QNR
+	@param x FP2 instance, on exit = x*sqrt(-1)
+ */
+extern void FP2_times_i(FP2 *x);
+
+/**	@brief Generate random FP2
+ *
+	@param x random FP2 number
+	@param rng random number generator
+ */
+extern void FP2_rand(FP2 *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp2_BN158.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp2_BN158.h
new file mode 100644
index 0000000..3a289b5
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp2_BN158.h
@@ -0,0 +1,306 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP2_BN158_H
+#define FP2_BN158_H
+
+#include "fp_BN158.h"
+
+using namespace core;
+
+namespace BN158 {
+
+/**
+	@brief FP2 Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    FP a; /**< real part of FP2 */
+    FP b; /**< imaginary part of FP2 */
+} FP2;
+
+/* FP2 prototypes */
+
+/**	@brief Tests for FP2 equal to zero
+ *
+	@param x FP2 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP2_iszilch(FP2 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP2 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP2_islarger(FP2 *x);
+
+
+/**	@brief Serialize out FP2  
+ *
+    @param b buffer for output
+	@param x FP2 number to be serialized
+ */
+extern void FP2_toBytes(char *b,FP2 *x);
+
+/**	@brief Serialize in FP2  
+ *
+	@param x FP2 number to be serialized
+    @param b buffer for input
+ */
+extern void FP2_fromBytes(FP2 *x,char *b);
+
+/**	@brief Conditional copy of FP2 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP2 instance, set to y if s!=0
+	@param y another FP2 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP2_cmove(FP2 *x, FP2 *y, int s);
+/**	@brief Tests for FP2 equal to one
+ *
+	@param x FP2 instance to be tested
+	@return 1 if x=1, else returns 0
+ */
+extern int FP2_isunity(FP2 *x);
+/**	@brief Tests for equality of two FP2s
+ *
+	@param x FP2 instance to be compared
+	@param y FP2 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP2_equals(FP2 *x, FP2 *y);
+/**	@brief Initialise FP2 from two FP numbers
+ *
+	@param x FP2 instance to be initialised
+	@param a FP to form real part of FP2
+	@param b FP to form imaginary part of FP2
+ */
+extern void FP2_from_FPs(FP2 *x, FP *a, FP *b);
+/**	@brief Initialise FP2 from two BIG integers
+ *
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+	@param b BIG to form imaginary part of FP2
+ */
+extern void FP2_from_BIGs(FP2 *x, B160_56::BIG a, B160_56::BIG b);
+
+
+/**	@brief Initialise FP2 from two integers
+ *
+	@param x FP2 instance to be initialised
+	@param a int to form real part of FP2
+	@param b int to form imaginary part of FP2
+ */
+extern void FP2_from_ints(FP2 *x, int a, int b);
+
+
+
+/**	@brief Initialise FP2 from single FP
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param an FP to form real part of FP2
+ */
+extern void FP2_from_FP(FP2 *x, FP *a);
+/**	@brief Initialise FP2 from single BIG
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+ */
+extern void FP2_from_BIG(FP2 *x, B160_56::BIG a);
+/**	@brief Copy FP2 to another FP2
+ *
+	@param x FP2 instance, on exit = y
+	@param y FP2 instance to be copied
+ */
+extern void FP2_copy(FP2 *x, FP2 *y);
+/**	@brief Set FP2 to zero
+ *
+	@param x FP2 instance to be set to zero
+ */
+extern void FP2_zero(FP2 *x);
+/**	@brief Set FP2 to unity
+ *
+	@param x FP2 instance to be set to one
+ */
+extern void FP2_one(FP2 *x);
+
+/**	@brief Copy from ROM to an FP2
+ *
+	@param w FP2 number to be copied to
+	@param a BIG real part to be copied from ROM
+	@param b BIG imag part to be copied from ROM
+ */
+extern void FP2_rcopy(FP2 *w,const B160_56::BIG a,const B160_56::BIG b);
+
+/**	@brief Sign of FP2
+ *
+	@param x FP2 instance
+	@return "sign" of FP2
+ */
+extern int FP2_sign(FP2 *x);
+
+/**	@brief Negation of FP2
+ *
+	@param x FP2 instance, on exit = -y
+	@param y FP2 instance
+ */
+extern void FP2_neg(FP2 *x, FP2 *y);
+
+
+/**	@brief Conjugation of FP2
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP2 instance, on exit = conj(y)
+	@param y FP2 instance
+ */
+extern void FP2_conj(FP2 *x, FP2 *y);
+/**	@brief addition of two FP2s
+ *
+	@param x FP2 instance, on exit = y+z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_add(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief subtraction of two FP2s
+ *
+	@param x FP2 instance, on exit = y-z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_sub(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Multiplication of an FP2 by an FP
+ *
+	@param x FP2 instance, on exit = y*b
+	@param y FP2 instance
+	@param b FP residue
+ */
+extern void FP2_pmul(FP2 *x, FP2 *y, FP *b);
+/**	@brief Multiplication of an FP2 by a small integer
+ *
+	@param x FP2 instance, on exit = y*i
+	@param y FP2 instance
+	@param i an integer
+ */
+extern void FP2_imul(FP2 *x, FP2 *y, int i);
+/**	@brief Squaring an FP2
+ *
+	@param x FP2 instance, on exit = y^2
+	@param y FP2 instance
+ */
+extern void FP2_sqr(FP2 *x, FP2 *y);
+/**	@brief Multiplication of two FP2s
+ *
+	@param x FP2 instance, on exit = y*z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_mul(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Formats and outputs an FP2 to the console
+ *
+	@param x FP2 instance
+ */
+extern void FP2_output(FP2 *x);
+/**	@brief Formats and outputs an FP2 to the console in raw form (for debugging)
+ *
+	@param x FP2 instance
+ */
+extern void FP2_rawoutput(FP2 *x);
+/**	@brief Inverting an FP2
+ *
+	@param x FP2 instance, on exit = 1/y
+	@param y FP2 instance
+ */
+extern void FP2_inv(FP2 *x, FP2 *y, FP *h);
+/**	@brief Divide an FP2 by 2
+ *
+	@param x FP2 instance, on exit = y/2
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_div2(FP2 *x, FP2 *y);
+/**	@brief Multiply an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x*(1+sqrt(-1))
+ */
+extern void FP2_mul_ip(FP2 *x);
+
+/**	@brief Divide an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x/(1+sqrt(-1))
+ */
+extern void FP2_div_ip(FP2 *x);
+/**	@brief Normalises the components of an FP2
+ *
+	@param x FP2 instance to be normalised
+ */
+extern void FP2_norm(FP2 *x);
+/**	@brief Reduces all components of possibly unreduced FP2 mod Modulus
+ *
+	@param x FP2 instance, on exit reduced mod Modulus
+ */
+extern void FP2_reduce(FP2 *x);
+/**	@brief Raises an FP2 to the power of a BIG
+ *
+	@param x FP2 instance, on exit = y^b
+	@param y FP2 instance
+	@param b BIG number
+ */
+extern void FP2_pow(FP2 *x, FP2 *y, B160_56::BIG b);
+
+/**	@brief Test FP2 for QR
+ *
+	@param x FP2 instance
+    @param h optional generated hint
+	@return true or false
+ */
+extern int FP2_qr(FP2 *x,FP *h);
+
+
+/**	@brief Square root of an FP2
+ *
+	@param x FP2 instance, on exit = sqrt(y)
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_sqrt(FP2 *x, FP2 *y, FP *h);
+
+/**	@brief Multiply an FP2 by sqrt(-1)
+ *
+	Note that -1 is QNR
+	@param x FP2 instance, on exit = x*sqrt(-1)
+ */
+extern void FP2_times_i(FP2 *x);
+
+/**	@brief Generate random FP2
+ *
+	@param x random FP2 number
+	@param rng random number generator
+ */
+extern void FP2_rand(FP2 *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp2_BN254.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp2_BN254.h
new file mode 100644
index 0000000..e548c25
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp2_BN254.h
@@ -0,0 +1,306 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP2_BN254_H
+#define FP2_BN254_H
+
+#include "fp_BN254.h"
+
+using namespace core;
+
+namespace BN254 {
+
+/**
+	@brief FP2 Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    FP a; /**< real part of FP2 */
+    FP b; /**< imaginary part of FP2 */
+} FP2;
+
+/* FP2 prototypes */
+
+/**	@brief Tests for FP2 equal to zero
+ *
+	@param x FP2 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP2_iszilch(FP2 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP2 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP2_islarger(FP2 *x);
+
+
+/**	@brief Serialize out FP2  
+ *
+    @param b buffer for output
+	@param x FP2 number to be serialized
+ */
+extern void FP2_toBytes(char *b,FP2 *x);
+
+/**	@brief Serialize in FP2  
+ *
+	@param x FP2 number to be serialized
+    @param b buffer for input
+ */
+extern void FP2_fromBytes(FP2 *x,char *b);
+
+/**	@brief Conditional copy of FP2 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP2 instance, set to y if s!=0
+	@param y another FP2 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP2_cmove(FP2 *x, FP2 *y, int s);
+/**	@brief Tests for FP2 equal to one
+ *
+	@param x FP2 instance to be tested
+	@return 1 if x=1, else returns 0
+ */
+extern int FP2_isunity(FP2 *x);
+/**	@brief Tests for equality of two FP2s
+ *
+	@param x FP2 instance to be compared
+	@param y FP2 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP2_equals(FP2 *x, FP2 *y);
+/**	@brief Initialise FP2 from two FP numbers
+ *
+	@param x FP2 instance to be initialised
+	@param a FP to form real part of FP2
+	@param b FP to form imaginary part of FP2
+ */
+extern void FP2_from_FPs(FP2 *x, FP *a, FP *b);
+/**	@brief Initialise FP2 from two BIG integers
+ *
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+	@param b BIG to form imaginary part of FP2
+ */
+extern void FP2_from_BIGs(FP2 *x, B256_56::BIG a, B256_56::BIG b);
+
+
+/**	@brief Initialise FP2 from two integers
+ *
+	@param x FP2 instance to be initialised
+	@param a int to form real part of FP2
+	@param b int to form imaginary part of FP2
+ */
+extern void FP2_from_ints(FP2 *x, int a, int b);
+
+
+
+/**	@brief Initialise FP2 from single FP
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param an FP to form real part of FP2
+ */
+extern void FP2_from_FP(FP2 *x, FP *a);
+/**	@brief Initialise FP2 from single BIG
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+ */
+extern void FP2_from_BIG(FP2 *x, B256_56::BIG a);
+/**	@brief Copy FP2 to another FP2
+ *
+	@param x FP2 instance, on exit = y
+	@param y FP2 instance to be copied
+ */
+extern void FP2_copy(FP2 *x, FP2 *y);
+/**	@brief Set FP2 to zero
+ *
+	@param x FP2 instance to be set to zero
+ */
+extern void FP2_zero(FP2 *x);
+/**	@brief Set FP2 to unity
+ *
+	@param x FP2 instance to be set to one
+ */
+extern void FP2_one(FP2 *x);
+
+/**	@brief Copy from ROM to an FP2
+ *
+	@param w FP2 number to be copied to
+	@param a BIG real part to be copied from ROM
+	@param b BIG imag part to be copied from ROM
+ */
+extern void FP2_rcopy(FP2 *w,const B256_56::BIG a,const B256_56::BIG b);
+
+/**	@brief Sign of FP2
+ *
+	@param x FP2 instance
+	@return "sign" of FP2
+ */
+extern int FP2_sign(FP2 *x);
+
+/**	@brief Negation of FP2
+ *
+	@param x FP2 instance, on exit = -y
+	@param y FP2 instance
+ */
+extern void FP2_neg(FP2 *x, FP2 *y);
+
+
+/**	@brief Conjugation of FP2
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP2 instance, on exit = conj(y)
+	@param y FP2 instance
+ */
+extern void FP2_conj(FP2 *x, FP2 *y);
+/**	@brief addition of two FP2s
+ *
+	@param x FP2 instance, on exit = y+z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_add(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief subtraction of two FP2s
+ *
+	@param x FP2 instance, on exit = y-z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_sub(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Multiplication of an FP2 by an FP
+ *
+	@param x FP2 instance, on exit = y*b
+	@param y FP2 instance
+	@param b FP residue
+ */
+extern void FP2_pmul(FP2 *x, FP2 *y, FP *b);
+/**	@brief Multiplication of an FP2 by a small integer
+ *
+	@param x FP2 instance, on exit = y*i
+	@param y FP2 instance
+	@param i an integer
+ */
+extern void FP2_imul(FP2 *x, FP2 *y, int i);
+/**	@brief Squaring an FP2
+ *
+	@param x FP2 instance, on exit = y^2
+	@param y FP2 instance
+ */
+extern void FP2_sqr(FP2 *x, FP2 *y);
+/**	@brief Multiplication of two FP2s
+ *
+	@param x FP2 instance, on exit = y*z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_mul(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Formats and outputs an FP2 to the console
+ *
+	@param x FP2 instance
+ */
+extern void FP2_output(FP2 *x);
+/**	@brief Formats and outputs an FP2 to the console in raw form (for debugging)
+ *
+	@param x FP2 instance
+ */
+extern void FP2_rawoutput(FP2 *x);
+/**	@brief Inverting an FP2
+ *
+	@param x FP2 instance, on exit = 1/y
+	@param y FP2 instance
+ */
+extern void FP2_inv(FP2 *x, FP2 *y, FP *h);
+/**	@brief Divide an FP2 by 2
+ *
+	@param x FP2 instance, on exit = y/2
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_div2(FP2 *x, FP2 *y);
+/**	@brief Multiply an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x*(1+sqrt(-1))
+ */
+extern void FP2_mul_ip(FP2 *x);
+
+/**	@brief Divide an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x/(1+sqrt(-1))
+ */
+extern void FP2_div_ip(FP2 *x);
+/**	@brief Normalises the components of an FP2
+ *
+	@param x FP2 instance to be normalised
+ */
+extern void FP2_norm(FP2 *x);
+/**	@brief Reduces all components of possibly unreduced FP2 mod Modulus
+ *
+	@param x FP2 instance, on exit reduced mod Modulus
+ */
+extern void FP2_reduce(FP2 *x);
+/**	@brief Raises an FP2 to the power of a BIG
+ *
+	@param x FP2 instance, on exit = y^b
+	@param y FP2 instance
+	@param b BIG number
+ */
+extern void FP2_pow(FP2 *x, FP2 *y, B256_56::BIG b);
+
+/**	@brief Test FP2 for QR
+ *
+	@param x FP2 instance
+    @param h optional generated hint
+	@return true or false
+ */
+extern int FP2_qr(FP2 *x,FP *h);
+
+
+/**	@brief Square root of an FP2
+ *
+	@param x FP2 instance, on exit = sqrt(y)
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_sqrt(FP2 *x, FP2 *y, FP *h);
+
+/**	@brief Multiply an FP2 by sqrt(-1)
+ *
+	Note that -1 is QNR
+	@param x FP2 instance, on exit = x*sqrt(-1)
+ */
+extern void FP2_times_i(FP2 *x);
+
+/**	@brief Generate random FP2
+ *
+	@param x random FP2 number
+	@param rng random number generator
+ */
+extern void FP2_rand(FP2 *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp2_BN254CX.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp2_BN254CX.h
new file mode 100644
index 0000000..3b84e46
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp2_BN254CX.h
@@ -0,0 +1,306 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP2_BN254CX_H
+#define FP2_BN254CX_H
+
+#include "fp_BN254CX.h"
+
+using namespace core;
+
+namespace BN254CX {
+
+/**
+	@brief FP2 Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    FP a; /**< real part of FP2 */
+    FP b; /**< imaginary part of FP2 */
+} FP2;
+
+/* FP2 prototypes */
+
+/**	@brief Tests for FP2 equal to zero
+ *
+	@param x FP2 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP2_iszilch(FP2 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP2 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP2_islarger(FP2 *x);
+
+
+/**	@brief Serialize out FP2  
+ *
+    @param b buffer for output
+	@param x FP2 number to be serialized
+ */
+extern void FP2_toBytes(char *b,FP2 *x);
+
+/**	@brief Serialize in FP2  
+ *
+	@param x FP2 number to be serialized
+    @param b buffer for input
+ */
+extern void FP2_fromBytes(FP2 *x,char *b);
+
+/**	@brief Conditional copy of FP2 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP2 instance, set to y if s!=0
+	@param y another FP2 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP2_cmove(FP2 *x, FP2 *y, int s);
+/**	@brief Tests for FP2 equal to one
+ *
+	@param x FP2 instance to be tested
+	@return 1 if x=1, else returns 0
+ */
+extern int FP2_isunity(FP2 *x);
+/**	@brief Tests for equality of two FP2s
+ *
+	@param x FP2 instance to be compared
+	@param y FP2 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP2_equals(FP2 *x, FP2 *y);
+/**	@brief Initialise FP2 from two FP numbers
+ *
+	@param x FP2 instance to be initialised
+	@param a FP to form real part of FP2
+	@param b FP to form imaginary part of FP2
+ */
+extern void FP2_from_FPs(FP2 *x, FP *a, FP *b);
+/**	@brief Initialise FP2 from two BIG integers
+ *
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+	@param b BIG to form imaginary part of FP2
+ */
+extern void FP2_from_BIGs(FP2 *x, B256_56::BIG a, B256_56::BIG b);
+
+
+/**	@brief Initialise FP2 from two integers
+ *
+	@param x FP2 instance to be initialised
+	@param a int to form real part of FP2
+	@param b int to form imaginary part of FP2
+ */
+extern void FP2_from_ints(FP2 *x, int a, int b);
+
+
+
+/**	@brief Initialise FP2 from single FP
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param an FP to form real part of FP2
+ */
+extern void FP2_from_FP(FP2 *x, FP *a);
+/**	@brief Initialise FP2 from single BIG
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+ */
+extern void FP2_from_BIG(FP2 *x, B256_56::BIG a);
+/**	@brief Copy FP2 to another FP2
+ *
+	@param x FP2 instance, on exit = y
+	@param y FP2 instance to be copied
+ */
+extern void FP2_copy(FP2 *x, FP2 *y);
+/**	@brief Set FP2 to zero
+ *
+	@param x FP2 instance to be set to zero
+ */
+extern void FP2_zero(FP2 *x);
+/**	@brief Set FP2 to unity
+ *
+	@param x FP2 instance to be set to one
+ */
+extern void FP2_one(FP2 *x);
+
+/**	@brief Copy from ROM to an FP2
+ *
+	@param w FP2 number to be copied to
+	@param a BIG real part to be copied from ROM
+	@param b BIG imag part to be copied from ROM
+ */
+extern void FP2_rcopy(FP2 *w,const B256_56::BIG a,const B256_56::BIG b);
+
+/**	@brief Sign of FP2
+ *
+	@param x FP2 instance
+	@return "sign" of FP2
+ */
+extern int FP2_sign(FP2 *x);
+
+/**	@brief Negation of FP2
+ *
+	@param x FP2 instance, on exit = -y
+	@param y FP2 instance
+ */
+extern void FP2_neg(FP2 *x, FP2 *y);
+
+
+/**	@brief Conjugation of FP2
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP2 instance, on exit = conj(y)
+	@param y FP2 instance
+ */
+extern void FP2_conj(FP2 *x, FP2 *y);
+/**	@brief addition of two FP2s
+ *
+	@param x FP2 instance, on exit = y+z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_add(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief subtraction of two FP2s
+ *
+	@param x FP2 instance, on exit = y-z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_sub(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Multiplication of an FP2 by an FP
+ *
+	@param x FP2 instance, on exit = y*b
+	@param y FP2 instance
+	@param b FP residue
+ */
+extern void FP2_pmul(FP2 *x, FP2 *y, FP *b);
+/**	@brief Multiplication of an FP2 by a small integer
+ *
+	@param x FP2 instance, on exit = y*i
+	@param y FP2 instance
+	@param i an integer
+ */
+extern void FP2_imul(FP2 *x, FP2 *y, int i);
+/**	@brief Squaring an FP2
+ *
+	@param x FP2 instance, on exit = y^2
+	@param y FP2 instance
+ */
+extern void FP2_sqr(FP2 *x, FP2 *y);
+/**	@brief Multiplication of two FP2s
+ *
+	@param x FP2 instance, on exit = y*z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_mul(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Formats and outputs an FP2 to the console
+ *
+	@param x FP2 instance
+ */
+extern void FP2_output(FP2 *x);
+/**	@brief Formats and outputs an FP2 to the console in raw form (for debugging)
+ *
+	@param x FP2 instance
+ */
+extern void FP2_rawoutput(FP2 *x);
+/**	@brief Inverting an FP2
+ *
+	@param x FP2 instance, on exit = 1/y
+	@param y FP2 instance
+ */
+extern void FP2_inv(FP2 *x, FP2 *y, FP *h);
+/**	@brief Divide an FP2 by 2
+ *
+	@param x FP2 instance, on exit = y/2
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_div2(FP2 *x, FP2 *y);
+/**	@brief Multiply an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x*(1+sqrt(-1))
+ */
+extern void FP2_mul_ip(FP2 *x);
+
+/**	@brief Divide an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x/(1+sqrt(-1))
+ */
+extern void FP2_div_ip(FP2 *x);
+/**	@brief Normalises the components of an FP2
+ *
+	@param x FP2 instance to be normalised
+ */
+extern void FP2_norm(FP2 *x);
+/**	@brief Reduces all components of possibly unreduced FP2 mod Modulus
+ *
+	@param x FP2 instance, on exit reduced mod Modulus
+ */
+extern void FP2_reduce(FP2 *x);
+/**	@brief Raises an FP2 to the power of a BIG
+ *
+	@param x FP2 instance, on exit = y^b
+	@param y FP2 instance
+	@param b BIG number
+ */
+extern void FP2_pow(FP2 *x, FP2 *y, B256_56::BIG b);
+
+/**	@brief Test FP2 for QR
+ *
+	@param x FP2 instance
+    @param h optional generated hint
+	@return true or false
+ */
+extern int FP2_qr(FP2 *x,FP *h);
+
+
+/**	@brief Square root of an FP2
+ *
+	@param x FP2 instance, on exit = sqrt(y)
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_sqrt(FP2 *x, FP2 *y, FP *h);
+
+/**	@brief Multiply an FP2 by sqrt(-1)
+ *
+	Note that -1 is QNR
+	@param x FP2 instance, on exit = x*sqrt(-1)
+ */
+extern void FP2_times_i(FP2 *x);
+
+/**	@brief Generate random FP2
+ *
+	@param x random FP2 number
+	@param rng random number generator
+ */
+extern void FP2_rand(FP2 *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp2_BN462.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp2_BN462.h
new file mode 100644
index 0000000..b1cf3c5
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp2_BN462.h
@@ -0,0 +1,306 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP2_BN462_H
+#define FP2_BN462_H
+
+#include "fp_BN462.h"
+
+using namespace core;
+
+namespace BN462 {
+
+/**
+	@brief FP2 Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    FP a; /**< real part of FP2 */
+    FP b; /**< imaginary part of FP2 */
+} FP2;
+
+/* FP2 prototypes */
+
+/**	@brief Tests for FP2 equal to zero
+ *
+	@param x FP2 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP2_iszilch(FP2 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP2 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP2_islarger(FP2 *x);
+
+
+/**	@brief Serialize out FP2  
+ *
+    @param b buffer for output
+	@param x FP2 number to be serialized
+ */
+extern void FP2_toBytes(char *b,FP2 *x);
+
+/**	@brief Serialize in FP2  
+ *
+	@param x FP2 number to be serialized
+    @param b buffer for input
+ */
+extern void FP2_fromBytes(FP2 *x,char *b);
+
+/**	@brief Conditional copy of FP2 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP2 instance, set to y if s!=0
+	@param y another FP2 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP2_cmove(FP2 *x, FP2 *y, int s);
+/**	@brief Tests for FP2 equal to one
+ *
+	@param x FP2 instance to be tested
+	@return 1 if x=1, else returns 0
+ */
+extern int FP2_isunity(FP2 *x);
+/**	@brief Tests for equality of two FP2s
+ *
+	@param x FP2 instance to be compared
+	@param y FP2 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP2_equals(FP2 *x, FP2 *y);
+/**	@brief Initialise FP2 from two FP numbers
+ *
+	@param x FP2 instance to be initialised
+	@param a FP to form real part of FP2
+	@param b FP to form imaginary part of FP2
+ */
+extern void FP2_from_FPs(FP2 *x, FP *a, FP *b);
+/**	@brief Initialise FP2 from two BIG integers
+ *
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+	@param b BIG to form imaginary part of FP2
+ */
+extern void FP2_from_BIGs(FP2 *x, B464_60::BIG a, B464_60::BIG b);
+
+
+/**	@brief Initialise FP2 from two integers
+ *
+	@param x FP2 instance to be initialised
+	@param a int to form real part of FP2
+	@param b int to form imaginary part of FP2
+ */
+extern void FP2_from_ints(FP2 *x, int a, int b);
+
+
+
+/**	@brief Initialise FP2 from single FP
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param an FP to form real part of FP2
+ */
+extern void FP2_from_FP(FP2 *x, FP *a);
+/**	@brief Initialise FP2 from single BIG
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+ */
+extern void FP2_from_BIG(FP2 *x, B464_60::BIG a);
+/**	@brief Copy FP2 to another FP2
+ *
+	@param x FP2 instance, on exit = y
+	@param y FP2 instance to be copied
+ */
+extern void FP2_copy(FP2 *x, FP2 *y);
+/**	@brief Set FP2 to zero
+ *
+	@param x FP2 instance to be set to zero
+ */
+extern void FP2_zero(FP2 *x);
+/**	@brief Set FP2 to unity
+ *
+	@param x FP2 instance to be set to one
+ */
+extern void FP2_one(FP2 *x);
+
+/**	@brief Copy from ROM to an FP2
+ *
+	@param w FP2 number to be copied to
+	@param a BIG real part to be copied from ROM
+	@param b BIG imag part to be copied from ROM
+ */
+extern void FP2_rcopy(FP2 *w,const B464_60::BIG a,const B464_60::BIG b);
+
+/**	@brief Sign of FP2
+ *
+	@param x FP2 instance
+	@return "sign" of FP2
+ */
+extern int FP2_sign(FP2 *x);
+
+/**	@brief Negation of FP2
+ *
+	@param x FP2 instance, on exit = -y
+	@param y FP2 instance
+ */
+extern void FP2_neg(FP2 *x, FP2 *y);
+
+
+/**	@brief Conjugation of FP2
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP2 instance, on exit = conj(y)
+	@param y FP2 instance
+ */
+extern void FP2_conj(FP2 *x, FP2 *y);
+/**	@brief addition of two FP2s
+ *
+	@param x FP2 instance, on exit = y+z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_add(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief subtraction of two FP2s
+ *
+	@param x FP2 instance, on exit = y-z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_sub(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Multiplication of an FP2 by an FP
+ *
+	@param x FP2 instance, on exit = y*b
+	@param y FP2 instance
+	@param b FP residue
+ */
+extern void FP2_pmul(FP2 *x, FP2 *y, FP *b);
+/**	@brief Multiplication of an FP2 by a small integer
+ *
+	@param x FP2 instance, on exit = y*i
+	@param y FP2 instance
+	@param i an integer
+ */
+extern void FP2_imul(FP2 *x, FP2 *y, int i);
+/**	@brief Squaring an FP2
+ *
+	@param x FP2 instance, on exit = y^2
+	@param y FP2 instance
+ */
+extern void FP2_sqr(FP2 *x, FP2 *y);
+/**	@brief Multiplication of two FP2s
+ *
+	@param x FP2 instance, on exit = y*z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_mul(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Formats and outputs an FP2 to the console
+ *
+	@param x FP2 instance
+ */
+extern void FP2_output(FP2 *x);
+/**	@brief Formats and outputs an FP2 to the console in raw form (for debugging)
+ *
+	@param x FP2 instance
+ */
+extern void FP2_rawoutput(FP2 *x);
+/**	@brief Inverting an FP2
+ *
+	@param x FP2 instance, on exit = 1/y
+	@param y FP2 instance
+ */
+extern void FP2_inv(FP2 *x, FP2 *y, FP *h);
+/**	@brief Divide an FP2 by 2
+ *
+	@param x FP2 instance, on exit = y/2
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_div2(FP2 *x, FP2 *y);
+/**	@brief Multiply an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x*(1+sqrt(-1))
+ */
+extern void FP2_mul_ip(FP2 *x);
+
+/**	@brief Divide an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x/(1+sqrt(-1))
+ */
+extern void FP2_div_ip(FP2 *x);
+/**	@brief Normalises the components of an FP2
+ *
+	@param x FP2 instance to be normalised
+ */
+extern void FP2_norm(FP2 *x);
+/**	@brief Reduces all components of possibly unreduced FP2 mod Modulus
+ *
+	@param x FP2 instance, on exit reduced mod Modulus
+ */
+extern void FP2_reduce(FP2 *x);
+/**	@brief Raises an FP2 to the power of a BIG
+ *
+	@param x FP2 instance, on exit = y^b
+	@param y FP2 instance
+	@param b BIG number
+ */
+extern void FP2_pow(FP2 *x, FP2 *y, B464_60::BIG b);
+
+/**	@brief Test FP2 for QR
+ *
+	@param x FP2 instance
+    @param h optional generated hint
+	@return true or false
+ */
+extern int FP2_qr(FP2 *x,FP *h);
+
+
+/**	@brief Square root of an FP2
+ *
+	@param x FP2 instance, on exit = sqrt(y)
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_sqrt(FP2 *x, FP2 *y, FP *h);
+
+/**	@brief Multiply an FP2 by sqrt(-1)
+ *
+	Note that -1 is QNR
+	@param x FP2 instance, on exit = x*sqrt(-1)
+ */
+extern void FP2_times_i(FP2 *x);
+
+/**	@brief Generate random FP2
+ *
+	@param x random FP2 number
+	@param rng random number generator
+ */
+extern void FP2_rand(FP2 *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp2_FP256BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp2_FP256BN.h
new file mode 100644
index 0000000..e997b97
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp2_FP256BN.h
@@ -0,0 +1,306 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP2_FP256BN_H
+#define FP2_FP256BN_H
+
+#include "fp_FP256BN.h"
+
+using namespace core;
+
+namespace FP256BN {
+
+/**
+	@brief FP2 Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    FP a; /**< real part of FP2 */
+    FP b; /**< imaginary part of FP2 */
+} FP2;
+
+/* FP2 prototypes */
+
+/**	@brief Tests for FP2 equal to zero
+ *
+	@param x FP2 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP2_iszilch(FP2 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP2 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP2_islarger(FP2 *x);
+
+
+/**	@brief Serialize out FP2  
+ *
+    @param b buffer for output
+	@param x FP2 number to be serialized
+ */
+extern void FP2_toBytes(char *b,FP2 *x);
+
+/**	@brief Serialize in FP2  
+ *
+	@param x FP2 number to be serialized
+    @param b buffer for input
+ */
+extern void FP2_fromBytes(FP2 *x,char *b);
+
+/**	@brief Conditional copy of FP2 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP2 instance, set to y if s!=0
+	@param y another FP2 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP2_cmove(FP2 *x, FP2 *y, int s);
+/**	@brief Tests for FP2 equal to one
+ *
+	@param x FP2 instance to be tested
+	@return 1 if x=1, else returns 0
+ */
+extern int FP2_isunity(FP2 *x);
+/**	@brief Tests for equality of two FP2s
+ *
+	@param x FP2 instance to be compared
+	@param y FP2 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP2_equals(FP2 *x, FP2 *y);
+/**	@brief Initialise FP2 from two FP numbers
+ *
+	@param x FP2 instance to be initialised
+	@param a FP to form real part of FP2
+	@param b FP to form imaginary part of FP2
+ */
+extern void FP2_from_FPs(FP2 *x, FP *a, FP *b);
+/**	@brief Initialise FP2 from two BIG integers
+ *
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+	@param b BIG to form imaginary part of FP2
+ */
+extern void FP2_from_BIGs(FP2 *x, B256_56::BIG a, B256_56::BIG b);
+
+
+/**	@brief Initialise FP2 from two integers
+ *
+	@param x FP2 instance to be initialised
+	@param a int to form real part of FP2
+	@param b int to form imaginary part of FP2
+ */
+extern void FP2_from_ints(FP2 *x, int a, int b);
+
+
+
+/**	@brief Initialise FP2 from single FP
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param an FP to form real part of FP2
+ */
+extern void FP2_from_FP(FP2 *x, FP *a);
+/**	@brief Initialise FP2 from single BIG
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+ */
+extern void FP2_from_BIG(FP2 *x, B256_56::BIG a);
+/**	@brief Copy FP2 to another FP2
+ *
+	@param x FP2 instance, on exit = y
+	@param y FP2 instance to be copied
+ */
+extern void FP2_copy(FP2 *x, FP2 *y);
+/**	@brief Set FP2 to zero
+ *
+	@param x FP2 instance to be set to zero
+ */
+extern void FP2_zero(FP2 *x);
+/**	@brief Set FP2 to unity
+ *
+	@param x FP2 instance to be set to one
+ */
+extern void FP2_one(FP2 *x);
+
+/**	@brief Copy from ROM to an FP2
+ *
+	@param w FP2 number to be copied to
+	@param a BIG real part to be copied from ROM
+	@param b BIG imag part to be copied from ROM
+ */
+extern void FP2_rcopy(FP2 *w,const B256_56::BIG a,const B256_56::BIG b);
+
+/**	@brief Sign of FP2
+ *
+	@param x FP2 instance
+	@return "sign" of FP2
+ */
+extern int FP2_sign(FP2 *x);
+
+/**	@brief Negation of FP2
+ *
+	@param x FP2 instance, on exit = -y
+	@param y FP2 instance
+ */
+extern void FP2_neg(FP2 *x, FP2 *y);
+
+
+/**	@brief Conjugation of FP2
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP2 instance, on exit = conj(y)
+	@param y FP2 instance
+ */
+extern void FP2_conj(FP2 *x, FP2 *y);
+/**	@brief addition of two FP2s
+ *
+	@param x FP2 instance, on exit = y+z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_add(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief subtraction of two FP2s
+ *
+	@param x FP2 instance, on exit = y-z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_sub(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Multiplication of an FP2 by an FP
+ *
+	@param x FP2 instance, on exit = y*b
+	@param y FP2 instance
+	@param b FP residue
+ */
+extern void FP2_pmul(FP2 *x, FP2 *y, FP *b);
+/**	@brief Multiplication of an FP2 by a small integer
+ *
+	@param x FP2 instance, on exit = y*i
+	@param y FP2 instance
+	@param i an integer
+ */
+extern void FP2_imul(FP2 *x, FP2 *y, int i);
+/**	@brief Squaring an FP2
+ *
+	@param x FP2 instance, on exit = y^2
+	@param y FP2 instance
+ */
+extern void FP2_sqr(FP2 *x, FP2 *y);
+/**	@brief Multiplication of two FP2s
+ *
+	@param x FP2 instance, on exit = y*z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_mul(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Formats and outputs an FP2 to the console
+ *
+	@param x FP2 instance
+ */
+extern void FP2_output(FP2 *x);
+/**	@brief Formats and outputs an FP2 to the console in raw form (for debugging)
+ *
+	@param x FP2 instance
+ */
+extern void FP2_rawoutput(FP2 *x);
+/**	@brief Inverting an FP2
+ *
+	@param x FP2 instance, on exit = 1/y
+	@param y FP2 instance
+ */
+extern void FP2_inv(FP2 *x, FP2 *y, FP *h);
+/**	@brief Divide an FP2 by 2
+ *
+	@param x FP2 instance, on exit = y/2
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_div2(FP2 *x, FP2 *y);
+/**	@brief Multiply an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x*(1+sqrt(-1))
+ */
+extern void FP2_mul_ip(FP2 *x);
+
+/**	@brief Divide an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x/(1+sqrt(-1))
+ */
+extern void FP2_div_ip(FP2 *x);
+/**	@brief Normalises the components of an FP2
+ *
+	@param x FP2 instance to be normalised
+ */
+extern void FP2_norm(FP2 *x);
+/**	@brief Reduces all components of possibly unreduced FP2 mod Modulus
+ *
+	@param x FP2 instance, on exit reduced mod Modulus
+ */
+extern void FP2_reduce(FP2 *x);
+/**	@brief Raises an FP2 to the power of a BIG
+ *
+	@param x FP2 instance, on exit = y^b
+	@param y FP2 instance
+	@param b BIG number
+ */
+extern void FP2_pow(FP2 *x, FP2 *y, B256_56::BIG b);
+
+/**	@brief Test FP2 for QR
+ *
+	@param x FP2 instance
+    @param h optional generated hint
+	@return true or false
+ */
+extern int FP2_qr(FP2 *x,FP *h);
+
+
+/**	@brief Square root of an FP2
+ *
+	@param x FP2 instance, on exit = sqrt(y)
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_sqrt(FP2 *x, FP2 *y, FP *h);
+
+/**	@brief Multiply an FP2 by sqrt(-1)
+ *
+	Note that -1 is QNR
+	@param x FP2 instance, on exit = x*sqrt(-1)
+ */
+extern void FP2_times_i(FP2 *x);
+
+/**	@brief Generate random FP2
+ *
+	@param x random FP2 number
+	@param rng random number generator
+ */
+extern void FP2_rand(FP2 *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp2_FP512BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp2_FP512BN.h
new file mode 100644
index 0000000..afdd0ff
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp2_FP512BN.h
@@ -0,0 +1,306 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP2_FP512BN_H
+#define FP2_FP512BN_H
+
+#include "fp_FP512BN.h"
+
+using namespace core;
+
+namespace FP512BN {
+
+/**
+	@brief FP2 Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    FP a; /**< real part of FP2 */
+    FP b; /**< imaginary part of FP2 */
+} FP2;
+
+/* FP2 prototypes */
+
+/**	@brief Tests for FP2 equal to zero
+ *
+	@param x FP2 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP2_iszilch(FP2 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP2 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP2_islarger(FP2 *x);
+
+
+/**	@brief Serialize out FP2  
+ *
+    @param b buffer for output
+	@param x FP2 number to be serialized
+ */
+extern void FP2_toBytes(char *b,FP2 *x);
+
+/**	@brief Serialize in FP2  
+ *
+	@param x FP2 number to be serialized
+    @param b buffer for input
+ */
+extern void FP2_fromBytes(FP2 *x,char *b);
+
+/**	@brief Conditional copy of FP2 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP2 instance, set to y if s!=0
+	@param y another FP2 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP2_cmove(FP2 *x, FP2 *y, int s);
+/**	@brief Tests for FP2 equal to one
+ *
+	@param x FP2 instance to be tested
+	@return 1 if x=1, else returns 0
+ */
+extern int FP2_isunity(FP2 *x);
+/**	@brief Tests for equality of two FP2s
+ *
+	@param x FP2 instance to be compared
+	@param y FP2 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP2_equals(FP2 *x, FP2 *y);
+/**	@brief Initialise FP2 from two FP numbers
+ *
+	@param x FP2 instance to be initialised
+	@param a FP to form real part of FP2
+	@param b FP to form imaginary part of FP2
+ */
+extern void FP2_from_FPs(FP2 *x, FP *a, FP *b);
+/**	@brief Initialise FP2 from two BIG integers
+ *
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+	@param b BIG to form imaginary part of FP2
+ */
+extern void FP2_from_BIGs(FP2 *x, B512_60::BIG a, B512_60::BIG b);
+
+
+/**	@brief Initialise FP2 from two integers
+ *
+	@param x FP2 instance to be initialised
+	@param a int to form real part of FP2
+	@param b int to form imaginary part of FP2
+ */
+extern void FP2_from_ints(FP2 *x, int a, int b);
+
+
+
+/**	@brief Initialise FP2 from single FP
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param an FP to form real part of FP2
+ */
+extern void FP2_from_FP(FP2 *x, FP *a);
+/**	@brief Initialise FP2 from single BIG
+ *
+	Imaginary part is set to zero
+	@param x FP2 instance to be initialised
+	@param a BIG to form real part of FP2
+ */
+extern void FP2_from_BIG(FP2 *x, B512_60::BIG a);
+/**	@brief Copy FP2 to another FP2
+ *
+	@param x FP2 instance, on exit = y
+	@param y FP2 instance to be copied
+ */
+extern void FP2_copy(FP2 *x, FP2 *y);
+/**	@brief Set FP2 to zero
+ *
+	@param x FP2 instance to be set to zero
+ */
+extern void FP2_zero(FP2 *x);
+/**	@brief Set FP2 to unity
+ *
+	@param x FP2 instance to be set to one
+ */
+extern void FP2_one(FP2 *x);
+
+/**	@brief Copy from ROM to an FP2
+ *
+	@param w FP2 number to be copied to
+	@param a BIG real part to be copied from ROM
+	@param b BIG imag part to be copied from ROM
+ */
+extern void FP2_rcopy(FP2 *w,const B512_60::BIG a,const B512_60::BIG b);
+
+/**	@brief Sign of FP2
+ *
+	@param x FP2 instance
+	@return "sign" of FP2
+ */
+extern int FP2_sign(FP2 *x);
+
+/**	@brief Negation of FP2
+ *
+	@param x FP2 instance, on exit = -y
+	@param y FP2 instance
+ */
+extern void FP2_neg(FP2 *x, FP2 *y);
+
+
+/**	@brief Conjugation of FP2
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP2 instance, on exit = conj(y)
+	@param y FP2 instance
+ */
+extern void FP2_conj(FP2 *x, FP2 *y);
+/**	@brief addition of two FP2s
+ *
+	@param x FP2 instance, on exit = y+z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_add(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief subtraction of two FP2s
+ *
+	@param x FP2 instance, on exit = y-z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_sub(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Multiplication of an FP2 by an FP
+ *
+	@param x FP2 instance, on exit = y*b
+	@param y FP2 instance
+	@param b FP residue
+ */
+extern void FP2_pmul(FP2 *x, FP2 *y, FP *b);
+/**	@brief Multiplication of an FP2 by a small integer
+ *
+	@param x FP2 instance, on exit = y*i
+	@param y FP2 instance
+	@param i an integer
+ */
+extern void FP2_imul(FP2 *x, FP2 *y, int i);
+/**	@brief Squaring an FP2
+ *
+	@param x FP2 instance, on exit = y^2
+	@param y FP2 instance
+ */
+extern void FP2_sqr(FP2 *x, FP2 *y);
+/**	@brief Multiplication of two FP2s
+ *
+	@param x FP2 instance, on exit = y*z
+	@param y FP2 instance
+	@param z FP2 instance
+ */
+extern void FP2_mul(FP2 *x, FP2 *y, FP2 *z);
+/**	@brief Formats and outputs an FP2 to the console
+ *
+	@param x FP2 instance
+ */
+extern void FP2_output(FP2 *x);
+/**	@brief Formats and outputs an FP2 to the console in raw form (for debugging)
+ *
+	@param x FP2 instance
+ */
+extern void FP2_rawoutput(FP2 *x);
+/**	@brief Inverting an FP2
+ *
+	@param x FP2 instance, on exit = 1/y
+	@param y FP2 instance
+ */
+extern void FP2_inv(FP2 *x, FP2 *y, FP *h);
+/**	@brief Divide an FP2 by 2
+ *
+	@param x FP2 instance, on exit = y/2
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_div2(FP2 *x, FP2 *y);
+/**	@brief Multiply an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x*(1+sqrt(-1))
+ */
+extern void FP2_mul_ip(FP2 *x);
+
+/**	@brief Divide an FP2 by (1+sqrt(-1))
+ *
+	Note that (1+sqrt(-1)) is irreducible for FP4
+	@param x FP2 instance, on exit = x/(1+sqrt(-1))
+ */
+extern void FP2_div_ip(FP2 *x);
+/**	@brief Normalises the components of an FP2
+ *
+	@param x FP2 instance to be normalised
+ */
+extern void FP2_norm(FP2 *x);
+/**	@brief Reduces all components of possibly unreduced FP2 mod Modulus
+ *
+	@param x FP2 instance, on exit reduced mod Modulus
+ */
+extern void FP2_reduce(FP2 *x);
+/**	@brief Raises an FP2 to the power of a BIG
+ *
+	@param x FP2 instance, on exit = y^b
+	@param y FP2 instance
+	@param b BIG number
+ */
+extern void FP2_pow(FP2 *x, FP2 *y, B512_60::BIG b);
+
+/**	@brief Test FP2 for QR
+ *
+	@param x FP2 instance
+    @param h optional generated hint
+	@return true or false
+ */
+extern int FP2_qr(FP2 *x,FP *h);
+
+
+/**	@brief Square root of an FP2
+ *
+	@param x FP2 instance, on exit = sqrt(y)
+	@param y FP2 instance
+    @param h optional input hint
+ */
+extern void FP2_sqrt(FP2 *x, FP2 *y, FP *h);
+
+/**	@brief Multiply an FP2 by sqrt(-1)
+ *
+	Note that -1 is QNR
+	@param x FP2 instance, on exit = x*sqrt(-1)
+ */
+extern void FP2_times_i(FP2 *x);
+
+/**	@brief Generate random FP2
+ *
+	@param x random FP2 number
+	@param rng random number generator
+ */
+extern void FP2_rand(FP2 *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp4.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp4.h
new file mode 100644
index 0000000..b889fa3
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp4.h
@@ -0,0 +1,349 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP4_YYY_H
+#define FP4_YYY_H
+
+#include "fp2_YYY.h"
+#include "config_curve_ZZZ.h"
+
+using namespace core;
+
+namespace YYY {
+
+/**
+	@brief FP4 Structure - towered over two FP2
+*/
+
+typedef struct
+{
+    FP2 a; /**< real part of FP4 */
+    FP2 b; /**< imaginary part of FP4 */
+} FP4;
+
+
+/* FP4 prototypes */
+/**	@brief Tests for FP4 equal to zero
+ *
+	@param x FP4 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP4_iszilch(FP4 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP4 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP4_islarger(FP4 *x);
+
+/**	@brief Serialize out FP4  
+ *
+    @param b buffer for output
+	@param x FP4 number to be serialized
+ */
+extern void FP4_toBytes(char *b,FP4 *x);
+
+/**	@brief Serialize in FP4  
+ *
+	@param x FP4 number to be serialized
+    @param b buffer for input
+ */
+extern void FP4_fromBytes(FP4 *x,char *b);
+
+/**	@brief Tests for FP4 equal to unity
+ *
+	@param x FP4 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP4_isunity(FP4 *x);
+/**	@brief Tests for equality of two FP4s
+ *
+	@param x FP4 instance to be compared
+	@param y FP4 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP4_equals(FP4 *x, FP4 *y);
+/**	@brief Tests for FP4 having only a real part and no imaginary part
+ *
+	@param x FP4 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP4_isreal(FP4 *x);
+/**	@brief Initialise FP4 from two FP2s
+ *
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+	@param b FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2s(FP4 *x, FP2 *a, FP2 *b);
+/**	@brief Initialise FP4 from single FP2
+ *
+	Imaginary part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+ */
+extern void FP4_from_FP2(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP2
+ *
+	real part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2H(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP
+ *
+	@param x FP4 instance to be initialised
+	@param a FP to form real part of FP4
+ */
+extern void FP4_from_FP(FP4 *x, FP *a);
+
+/**	@brief Copy FP4 to another FP4
+ *
+	@param x FP4 instance, on exit = y
+	@param y FP4 instance to be copied
+ */
+extern void FP4_copy(FP4 *x, FP4 *y);
+/**	@brief Set FP4 to zero
+ *
+	@param x FP4 instance to be set to zero
+ */
+extern void FP4_zero(FP4 *x);
+/**	@brief Set FP4 to unity
+ *
+	@param x FP4 instance to be set to one
+ */
+extern void FP4_one(FP4 *x);
+
+/**	@brief Sign of FP4
+ *
+	@param x FP4 instance
+	@return "sign" of FP4
+ */
+extern int FP4_sign(FP4 *x);
+
+/**	@brief Negation of FP4
+ *
+	@param x FP4 instance, on exit = -y
+	@param y FP4 instance
+ */
+extern void FP4_neg(FP4 *x, FP4 *y);
+/**	@brief Conjugation of FP4
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP4 instance, on exit = conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_conj(FP4 *x, FP4 *y);
+/**	@brief Negative conjugation of FP4
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP4 instance, on exit = -conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_nconj(FP4 *x, FP4 *y);
+/**	@brief addition of two FP4s
+ *
+	@param x FP4 instance, on exit = y+z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_add(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief subtraction of two FP4s
+ *
+	@param x FP4 instance, on exit = y-z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_sub(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Multiplication of an FP4 by an FP2
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP2 multiplier
+ */
+extern void FP4_pmul(FP4 *x, FP4 *y, FP2 *a);
+
+
+/**	@brief Multiplication of an FP4 by an FP
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP multiplier
+ */
+extern void FP4_qmul(FP4 *x, FP4 *y, FP *a);
+
+/**	@brief Multiplication of an FP4 by a small integer
+ *
+	@param x FP4 instance, on exit = y*i
+	@param y FP4 instance
+	@param i an integer
+ */
+extern void FP4_imul(FP4 *x, FP4 *y, int i);
+/**	@brief Squaring an FP4
+ *
+	@param x FP4 instance, on exit = y^2
+	@param y FP4 instance
+ */
+extern void FP4_sqr(FP4 *x, FP4 *y);
+/**	@brief Multiplication of two FP4s
+ *
+	@param x FP4 instance, on exit = y*z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_mul(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Inverting an FP4
+ *
+	@param x FP4 instance, on exit = 1/y
+	@param y FP4 instance
+    @param h optional input hint
+ */
+extern void FP4_inv(FP4 *x, FP4 *y, FP *h);
+
+/**	@brief Divide an FP4 by 2
+ *
+	@param x FP4 instance, on exit = y/2
+	@param y FP4 instance
+ */
+extern void FP4_div2(FP4 *x, FP4 *y);
+
+
+/**	@brief Formats and outputs an FP4 to the console
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_output(FP4 *x);
+/**	@brief Formats and outputs an FP4 to the console in raw form (for debugging)
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_rawoutput(FP4 *x);
+/**	@brief multiplies an FP4 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP4 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP4_times_i(FP4 *x);
+/**	@brief Normalises the components of an FP4
+ *
+	@param x FP4 instance to be normalised
+ */
+extern void FP4_norm(FP4 *x);
+/**	@brief Reduces all components of possibly unreduced FP4 mod Modulus
+ *
+	@param x FP4 instance, on exit reduced mod Modulus
+ */
+extern void FP4_reduce(FP4 *x);
+/**	@brief Raises an FP4 to the power of a BIG
+ *
+	@param x FP4 instance, on exit = y^b
+	@param y FP4 instance
+	@param b BIG number
+ */
+extern void FP4_pow(FP4 *x, FP4 *y, XXX::BIG b);
+/**	@brief Raises an FP4 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP4 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP4_frob(FP4 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP4 instance, on exit = w*x-conj(x)*y+z
+	@param w FP4 instance
+	@param x FP4 instance
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_xtr_A(FP4 *r, FP4 *w, FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP4 instance, on exit = x^2-2*conj(x)
+	@param x FP4 instance
+ */
+extern void FP4_xtr_D(FP4 *r, FP4 *x);
+/**	@brief Calculates FP4 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP4 instance, on exit = trace(w^b)
+	@param x FP4 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP4_xtr_pow(FP4 *r, FP4 *x, XXX::BIG b);
+/**	@brief Calculates FP4 trace of c^a.d^b, where c and d are derived from FP4 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP4 instance, on exit = trace(c^a.d^b)
+	@param c FP4 instance, trace of an FP12
+	@param d FP4 instance, trace of an FP12
+	@param e FP4 instance, trace of an FP12
+	@param f FP4 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP4_xtr_pow2(FP4 *r, FP4 *c, FP4 *d, FP4 *e, FP4 *f, XXX::BIG a, XXX::BIG b);
+
+/**	@brief Test FP4 for QR
+ * 
+	@param r FP4 instance
+    @param h optional generated hint
+	@return 1 x is a QR, otherwise 0
+ */
+extern int  FP4_qr(FP4 *r, FP *h);
+
+/**	@brief Calculate square root of an FP4
+ *
+	Square root
+	@param r FP4 instance, on exit = sqrt(x)
+	@param x FP4 instance
+    @param h optional input hint
+ */
+extern void  FP4_sqrt(FP4 *r, FP4 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP4 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP4 instance, set to y if s!=0
+	@param y another FP4 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP4_cmove(FP4 *x, FP4 *y, int s);
+
+
+/**	@brief Divide FP4 number by QNR
+ *
+	Divide FP4 by the QNR
+	@param x FP4 instance
+ */
+extern void FP4_div_i(FP4 *x);
+
+/**	@brief Generate random FP4
+ *
+	@param x random FP4 number
+	@param rng random number generator
+ */
+extern void FP4_rand(FP4 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp48.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp48.h
new file mode 100644
index 0000000..b1095f9
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp48.h
@@ -0,0 +1,231 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP48_YYY_H
+#define FP48_YYY_H
+
+#include "fp16_YYY.h"
+
+using namespace core;
+
+namespace YYY {
+/**
+	@brief FP12 Structure - towered over three FP16
+*/
+
+typedef struct
+{
+    FP16 a; /**< first part of FP12 */
+    FP16 b; /**< second part of FP12 */
+    FP16 c; /**< third part of FP12 */
+    int type;
+} FP48;
+
+extern const XXX::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const XXX::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+/* FP48 prototypes */
+/**	@brief Tests for FP48 equal to zero
+ *
+	@param x FP48 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP48_iszilch(FP48 *x);
+/**	@brief Tests for FP48 equal to unity
+ *
+	@param x FP48 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP48_isunity(FP48 *x);
+/**	@brief Copy FP48 to another FP48
+ *
+	@param x FP48 instance, on exit = y
+	@param y FP48 instance to be copied
+ */
+extern void FP48_copy(FP48 *x, FP48 *y);
+/**	@brief Set FP48 to unity
+ *
+	@param x FP48 instance to be set to one
+ */
+extern void FP48_one(FP48 *x);
+
+/**	@brief Set FP48 to zero
+ *
+	@param x FP48 instance to be set to zero
+ */
+extern void FP48_zero(FP48 *x);
+
+/**	@brief Tests for equality of two FP48s
+ *
+	@param x FP48 instance to be compared
+	@param y FP48 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP48_equals(FP48 *x, FP48 *y);
+/**	@brief Conjugation of FP48
+ *
+	If y=(a,b,c) (where a,b,c are its three FP16 components) on exit x=(conj(a),-conj(b),conj(c))
+	@param x FP48 instance, on exit = conj(y)
+	@param y FP48 instance
+ */
+extern void FP48_conj(FP48 *x, FP48 *y);
+/**	@brief Initialise FP48 from single FP16
+ *
+	Sets first FP16 component of an FP48, other components set to zero
+	@param x FP48 instance to be initialised
+	@param a FP16 to form first part of FP48
+ */
+extern void FP48_from_FP16(FP48 *x, FP16 *a);
+/**	@brief Initialise FP48 from three FP16s
+ *
+	@param x FP48 instance to be initialised
+	@param a FP16 to form first part of FP48
+	@param b FP16 to form second part of FP48
+	@param c FP16 to form third part of FP48
+ */
+extern void FP48_from_FP16s(FP48 *x, FP16 *a, FP16* b, FP16 *c);
+/**	@brief Fast Squaring of an FP48 in "unitary" form
+ *
+	@param x FP48 instance, on exit = y^2
+	@param y FP16 instance, must be unitary
+ */
+extern void FP48_usqr(FP48 *x, FP48 *y);
+/**	@brief Squaring an FP48
+ *
+	@param x FP48 instance, on exit = y^2
+	@param y FP48 instance
+ */
+extern void FP48_sqr(FP48 *x, FP48 *y);
+/**	@brief Fast multiplication of two sparse FP24s that arises from ATE pairing line functions
+ *
+	@param x FP48 instance, on exit = x*y
+	@param y FP48 instance, of special form
+ */
+extern void FP48_smul(FP48 *x, FP48 *y);
+
+/**	@brief Fast multiplication of what may be sparse multiplicands
+ *
+	@param x FP48 instance, on exit = x*y
+	@param y FP48 instance, of special form
+ */
+extern void FP48_ssmul(FP48 *x, FP48 *y);
+/**	@brief Full unconditional Multiplication of two FP24s
+ *
+	@param x FP48 instance, on exit = x*y
+	@param y FP48 instance, the multiplier
+ */
+extern void FP48_mul(FP48 *x, FP48 *y);
+/**	@brief Inverting an FP48
+ *
+	@param x FP48 instance, on exit = 1/y
+	@param y FP48 instance
+ */
+extern void FP48_inv(FP48 *x, FP48 *y);
+/**	@brief Raises an FP48 to the power of a BIG
+ *
+	@param r FP48 instance, on exit = y^b
+	@param x FP48 instance
+	@param b BIG number
+ */
+extern void FP48_pow(FP48 *r, FP48 *x, XXX::BIG b);
+
+//extern void FP48_ppow(FP48 *r,FP48 *x,XXX::BIG b);
+
+/**	@brief Raises an FP48 instance x to a small integer power, side-channel resistant
+ *
+	@param x FP48 instance, on exit = x^i
+	@param i small integer exponent
+	@param b maximum number of bits in exponent
+ */
+extern void FP48_pinpow(FP48 *x, int i, int b);
+
+/**	@brief Raises an FP48 instance x to a BIG power, compressed to FP16
+ *
+	@param c FP16 instance, on exit = x^(e mod r) as FP16
+	@param x FP48 input
+	@param e BIG exponent
+	@param r BIG group order
+ */
+extern void FP48_compow(FP16 *c, FP48 *x, XXX::BIG e, XXX::BIG r);
+
+/**	@brief Calculate Pi x[i]^b[i] for i=0 to 15, side-channel resistant
+ *
+	@param r FP48 instance, on exit = Pi x[i]^b[i] for i=0 to 15
+	@param x FP48 array with 16 FP48s
+	@param b BIG array of 16 exponents
+ */
+extern void FP48_pow16(FP48 *r, FP48 *x, XXX::BIG *b);
+
+
+/**	@brief Raises an FP48 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP48 instance, on exit = x^p^n
+	@param f FP2 precalculated Frobenius constant
+	@param n power of p
+ */
+extern void FP48_frob(FP48 *x, FP2 *f, int n);
+
+/**	@brief Reduces all components of possibly unreduced FP48 mod Modulus
+ *
+	@param x FP48 instance, on exit reduced mod Modulus
+ */
+extern void FP48_reduce(FP48 *x);
+/**	@brief Normalises the components of an FP48
+ *
+	@param x FP48 instance to be normalised
+ */
+extern void FP48_norm(FP48 *x);
+/**	@brief Formats and outputs an FP48 to the console
+ *
+	@param x FP48 instance to be printed
+ */
+extern void FP48_output(FP48 *x);
+/**	@brief Formats and outputs an FP48 instance to an octet string
+ *
+	Serializes the components of an FP48 to big-endian base 256 form.
+	@param S output octet string
+	@param x FP48 instance to be converted to an octet string
+ */
+extern void FP48_toOctet(octet *S, FP48 *x);
+/**	@brief Creates an FP48 instance from an octet string
+ *
+	De-serializes the components of an FP48 to create an FP48 from big-endian base 256 components.
+	@param x FP48 instance to be created from an octet string
+	@param S input octet string
+
+ */
+extern void FP48_fromOctet(FP48 *x, octet *S);
+/**	@brief Calculate the trace of an FP48
+ *
+	@param t FP16 trace of x, on exit = tr(x)
+	@param x FP48 instance
+
+ */
+extern void FP48_trace(FP16 *t, FP48 *x);
+
+/**	@brief Conditional copy of FP48 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP48 instance, set to y if s!=0
+	@param y another FP48 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP48_cmove(FP48 *x, FP48 *y, int s);
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp48_BLS48286.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp48_BLS48286.h
new file mode 100644
index 0000000..194fcb0
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp48_BLS48286.h
@@ -0,0 +1,231 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP48_BLS48286_H
+#define FP48_BLS48286_H
+
+#include "fp16_BLS48286.h"
+
+using namespace core;
+
+namespace BLS48286 {
+/**
+	@brief FP12 Structure - towered over three FP16
+*/
+
+typedef struct
+{
+    FP16 a; /**< first part of FP12 */
+    FP16 b; /**< second part of FP12 */
+    FP16 c; /**< third part of FP12 */
+    int type;
+} FP48;
+
+extern const B288_60::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B288_60::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+/* FP48 prototypes */
+/**	@brief Tests for FP48 equal to zero
+ *
+	@param x FP48 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP48_iszilch(FP48 *x);
+/**	@brief Tests for FP48 equal to unity
+ *
+	@param x FP48 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP48_isunity(FP48 *x);
+/**	@brief Copy FP48 to another FP48
+ *
+	@param x FP48 instance, on exit = y
+	@param y FP48 instance to be copied
+ */
+extern void FP48_copy(FP48 *x, FP48 *y);
+/**	@brief Set FP48 to unity
+ *
+	@param x FP48 instance to be set to one
+ */
+extern void FP48_one(FP48 *x);
+
+/**	@brief Set FP48 to zero
+ *
+	@param x FP48 instance to be set to zero
+ */
+extern void FP48_zero(FP48 *x);
+
+/**	@brief Tests for equality of two FP48s
+ *
+	@param x FP48 instance to be compared
+	@param y FP48 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP48_equals(FP48 *x, FP48 *y);
+/**	@brief Conjugation of FP48
+ *
+	If y=(a,b,c) (where a,b,c are its three FP16 components) on exit x=(conj(a),-conj(b),conj(c))
+	@param x FP48 instance, on exit = conj(y)
+	@param y FP48 instance
+ */
+extern void FP48_conj(FP48 *x, FP48 *y);
+/**	@brief Initialise FP48 from single FP16
+ *
+	Sets first FP16 component of an FP48, other components set to zero
+	@param x FP48 instance to be initialised
+	@param a FP16 to form first part of FP48
+ */
+extern void FP48_from_FP16(FP48 *x, FP16 *a);
+/**	@brief Initialise FP48 from three FP16s
+ *
+	@param x FP48 instance to be initialised
+	@param a FP16 to form first part of FP48
+	@param b FP16 to form second part of FP48
+	@param c FP16 to form third part of FP48
+ */
+extern void FP48_from_FP16s(FP48 *x, FP16 *a, FP16* b, FP16 *c);
+/**	@brief Fast Squaring of an FP48 in "unitary" form
+ *
+	@param x FP48 instance, on exit = y^2
+	@param y FP16 instance, must be unitary
+ */
+extern void FP48_usqr(FP48 *x, FP48 *y);
+/**	@brief Squaring an FP48
+ *
+	@param x FP48 instance, on exit = y^2
+	@param y FP48 instance
+ */
+extern void FP48_sqr(FP48 *x, FP48 *y);
+/**	@brief Fast multiplication of two sparse FP24s that arises from ATE pairing line functions
+ *
+	@param x FP48 instance, on exit = x*y
+	@param y FP48 instance, of special form
+ */
+extern void FP48_smul(FP48 *x, FP48 *y);
+
+/**	@brief Fast multiplication of what may be sparse multiplicands
+ *
+	@param x FP48 instance, on exit = x*y
+	@param y FP48 instance, of special form
+ */
+extern void FP48_ssmul(FP48 *x, FP48 *y);
+/**	@brief Full unconditional Multiplication of two FP24s
+ *
+	@param x FP48 instance, on exit = x*y
+	@param y FP48 instance, the multiplier
+ */
+extern void FP48_mul(FP48 *x, FP48 *y);
+/**	@brief Inverting an FP48
+ *
+	@param x FP48 instance, on exit = 1/y
+	@param y FP48 instance
+ */
+extern void FP48_inv(FP48 *x, FP48 *y);
+/**	@brief Raises an FP48 to the power of a BIG
+ *
+	@param r FP48 instance, on exit = y^b
+	@param x FP48 instance
+	@param b BIG number
+ */
+extern void FP48_pow(FP48 *r, FP48 *x, B288_60::BIG b);
+
+//extern void FP48_ppow(FP48 *r,FP48 *x,B288_60::BIG b);
+
+/**	@brief Raises an FP48 instance x to a small integer power, side-channel resistant
+ *
+	@param x FP48 instance, on exit = x^i
+	@param i small integer exponent
+	@param b maximum number of bits in exponent
+ */
+extern void FP48_pinpow(FP48 *x, int i, int b);
+
+/**	@brief Raises an FP48 instance x to a BIG power, compressed to FP16
+ *
+	@param c FP16 instance, on exit = x^(e mod r) as FP16
+	@param x FP48 input
+	@param e BIG exponent
+	@param r BIG group order
+ */
+extern void FP48_compow(FP16 *c, FP48 *x, B288_60::BIG e, B288_60::BIG r);
+
+/**	@brief Calculate Pi x[i]^b[i] for i=0 to 15, side-channel resistant
+ *
+	@param r FP48 instance, on exit = Pi x[i]^b[i] for i=0 to 15
+	@param x FP48 array with 16 FP48s
+	@param b BIG array of 16 exponents
+ */
+extern void FP48_pow16(FP48 *r, FP48 *x, B288_60::BIG *b);
+
+
+/**	@brief Raises an FP48 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP48 instance, on exit = x^p^n
+	@param f FP2 precalculated Frobenius constant
+	@param n power of p
+ */
+extern void FP48_frob(FP48 *x, FP2 *f, int n);
+
+/**	@brief Reduces all components of possibly unreduced FP48 mod Modulus
+ *
+	@param x FP48 instance, on exit reduced mod Modulus
+ */
+extern void FP48_reduce(FP48 *x);
+/**	@brief Normalises the components of an FP48
+ *
+	@param x FP48 instance to be normalised
+ */
+extern void FP48_norm(FP48 *x);
+/**	@brief Formats and outputs an FP48 to the console
+ *
+	@param x FP48 instance to be printed
+ */
+extern void FP48_output(FP48 *x);
+/**	@brief Formats and outputs an FP48 instance to an octet string
+ *
+	Serializes the components of an FP48 to big-endian base 256 form.
+	@param S output octet string
+	@param x FP48 instance to be converted to an octet string
+ */
+extern void FP48_toOctet(octet *S, FP48 *x);
+/**	@brief Creates an FP48 instance from an octet string
+ *
+	De-serializes the components of an FP48 to create an FP48 from big-endian base 256 components.
+	@param x FP48 instance to be created from an octet string
+	@param S input octet string
+
+ */
+extern void FP48_fromOctet(FP48 *x, octet *S);
+/**	@brief Calculate the trace of an FP48
+ *
+	@param t FP16 trace of x, on exit = tr(x)
+	@param x FP48 instance
+
+ */
+extern void FP48_trace(FP16 *t, FP48 *x);
+
+/**	@brief Conditional copy of FP48 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP48 instance, set to y if s!=0
+	@param y another FP48 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP48_cmove(FP48 *x, FP48 *y, int s);
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp48_BLS48556.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp48_BLS48556.h
new file mode 100644
index 0000000..cca9e44
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp48_BLS48556.h
@@ -0,0 +1,231 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP48_BLS48556_H
+#define FP48_BLS48556_H
+
+#include "fp16_BLS48556.h"
+
+using namespace core;
+
+namespace BLS48556 {
+/**
+	@brief FP12 Structure - towered over three FP16
+*/
+
+typedef struct
+{
+    FP16 a; /**< first part of FP12 */
+    FP16 b; /**< second part of FP12 */
+    FP16 c; /**< third part of FP12 */
+    int type;
+} FP48;
+
+extern const B560_58::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B560_58::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+/* FP48 prototypes */
+/**	@brief Tests for FP48 equal to zero
+ *
+	@param x FP48 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP48_iszilch(FP48 *x);
+/**	@brief Tests for FP48 equal to unity
+ *
+	@param x FP48 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP48_isunity(FP48 *x);
+/**	@brief Copy FP48 to another FP48
+ *
+	@param x FP48 instance, on exit = y
+	@param y FP48 instance to be copied
+ */
+extern void FP48_copy(FP48 *x, FP48 *y);
+/**	@brief Set FP48 to unity
+ *
+	@param x FP48 instance to be set to one
+ */
+extern void FP48_one(FP48 *x);
+
+/**	@brief Set FP48 to zero
+ *
+	@param x FP48 instance to be set to zero
+ */
+extern void FP48_zero(FP48 *x);
+
+/**	@brief Tests for equality of two FP48s
+ *
+	@param x FP48 instance to be compared
+	@param y FP48 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP48_equals(FP48 *x, FP48 *y);
+/**	@brief Conjugation of FP48
+ *
+	If y=(a,b,c) (where a,b,c are its three FP16 components) on exit x=(conj(a),-conj(b),conj(c))
+	@param x FP48 instance, on exit = conj(y)
+	@param y FP48 instance
+ */
+extern void FP48_conj(FP48 *x, FP48 *y);
+/**	@brief Initialise FP48 from single FP16
+ *
+	Sets first FP16 component of an FP48, other components set to zero
+	@param x FP48 instance to be initialised
+	@param a FP16 to form first part of FP48
+ */
+extern void FP48_from_FP16(FP48 *x, FP16 *a);
+/**	@brief Initialise FP48 from three FP16s
+ *
+	@param x FP48 instance to be initialised
+	@param a FP16 to form first part of FP48
+	@param b FP16 to form second part of FP48
+	@param c FP16 to form third part of FP48
+ */
+extern void FP48_from_FP16s(FP48 *x, FP16 *a, FP16* b, FP16 *c);
+/**	@brief Fast Squaring of an FP48 in "unitary" form
+ *
+	@param x FP48 instance, on exit = y^2
+	@param y FP16 instance, must be unitary
+ */
+extern void FP48_usqr(FP48 *x, FP48 *y);
+/**	@brief Squaring an FP48
+ *
+	@param x FP48 instance, on exit = y^2
+	@param y FP48 instance
+ */
+extern void FP48_sqr(FP48 *x, FP48 *y);
+/**	@brief Fast multiplication of two sparse FP24s that arises from ATE pairing line functions
+ *
+	@param x FP48 instance, on exit = x*y
+	@param y FP48 instance, of special form
+ */
+extern void FP48_smul(FP48 *x, FP48 *y);
+
+/**	@brief Fast multiplication of what may be sparse multiplicands
+ *
+	@param x FP48 instance, on exit = x*y
+	@param y FP48 instance, of special form
+ */
+extern void FP48_ssmul(FP48 *x, FP48 *y);
+/**	@brief Full unconditional Multiplication of two FP24s
+ *
+	@param x FP48 instance, on exit = x*y
+	@param y FP48 instance, the multiplier
+ */
+extern void FP48_mul(FP48 *x, FP48 *y);
+/**	@brief Inverting an FP48
+ *
+	@param x FP48 instance, on exit = 1/y
+	@param y FP48 instance
+ */
+extern void FP48_inv(FP48 *x, FP48 *y);
+/**	@brief Raises an FP48 to the power of a BIG
+ *
+	@param r FP48 instance, on exit = y^b
+	@param x FP48 instance
+	@param b BIG number
+ */
+extern void FP48_pow(FP48 *r, FP48 *x, B560_58::BIG b);
+
+//extern void FP48_ppow(FP48 *r,FP48 *x,B560_58::BIG b);
+
+/**	@brief Raises an FP48 instance x to a small integer power, side-channel resistant
+ *
+	@param x FP48 instance, on exit = x^i
+	@param i small integer exponent
+	@param b maximum number of bits in exponent
+ */
+extern void FP48_pinpow(FP48 *x, int i, int b);
+
+/**	@brief Raises an FP48 instance x to a BIG power, compressed to FP16
+ *
+	@param c FP16 instance, on exit = x^(e mod r) as FP16
+	@param x FP48 input
+	@param e BIG exponent
+	@param r BIG group order
+ */
+extern void FP48_compow(FP16 *c, FP48 *x, B560_58::BIG e, B560_58::BIG r);
+
+/**	@brief Calculate Pi x[i]^b[i] for i=0 to 15, side-channel resistant
+ *
+	@param r FP48 instance, on exit = Pi x[i]^b[i] for i=0 to 15
+	@param x FP48 array with 16 FP48s
+	@param b BIG array of 16 exponents
+ */
+extern void FP48_pow16(FP48 *r, FP48 *x, B560_58::BIG *b);
+
+
+/**	@brief Raises an FP48 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP48 instance, on exit = x^p^n
+	@param f FP2 precalculated Frobenius constant
+	@param n power of p
+ */
+extern void FP48_frob(FP48 *x, FP2 *f, int n);
+
+/**	@brief Reduces all components of possibly unreduced FP48 mod Modulus
+ *
+	@param x FP48 instance, on exit reduced mod Modulus
+ */
+extern void FP48_reduce(FP48 *x);
+/**	@brief Normalises the components of an FP48
+ *
+	@param x FP48 instance to be normalised
+ */
+extern void FP48_norm(FP48 *x);
+/**	@brief Formats and outputs an FP48 to the console
+ *
+	@param x FP48 instance to be printed
+ */
+extern void FP48_output(FP48 *x);
+/**	@brief Formats and outputs an FP48 instance to an octet string
+ *
+	Serializes the components of an FP48 to big-endian base 256 form.
+	@param S output octet string
+	@param x FP48 instance to be converted to an octet string
+ */
+extern void FP48_toOctet(octet *S, FP48 *x);
+/**	@brief Creates an FP48 instance from an octet string
+ *
+	De-serializes the components of an FP48 to create an FP48 from big-endian base 256 components.
+	@param x FP48 instance to be created from an octet string
+	@param S input octet string
+
+ */
+extern void FP48_fromOctet(FP48 *x, octet *S);
+/**	@brief Calculate the trace of an FP48
+ *
+	@param t FP16 trace of x, on exit = tr(x)
+	@param x FP48 instance
+
+ */
+extern void FP48_trace(FP16 *t, FP48 *x);
+
+/**	@brief Conditional copy of FP48 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP48 instance, set to y if s!=0
+	@param y another FP48 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP48_cmove(FP48 *x, FP48 *y, int s);
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp48_BLS48581.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp48_BLS48581.h
new file mode 100644
index 0000000..fdf7627
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp48_BLS48581.h
@@ -0,0 +1,231 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP48_BLS48581_H
+#define FP48_BLS48581_H
+
+#include "fp16_BLS48581.h"
+
+using namespace core;
+
+namespace BLS48581 {
+/**
+	@brief FP12 Structure - towered over three FP16
+*/
+
+typedef struct
+{
+    FP16 a; /**< first part of FP12 */
+    FP16 b; /**< second part of FP12 */
+    FP16 c; /**< third part of FP12 */
+    int type;
+} FP48;
+
+extern const B584_60::BIG Fra; /**< real part of BN curve Frobenius Constant */
+extern const B584_60::BIG Frb; /**< imaginary part of BN curve Frobenius Constant */
+
+/* FP48 prototypes */
+/**	@brief Tests for FP48 equal to zero
+ *
+	@param x FP48 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP48_iszilch(FP48 *x);
+/**	@brief Tests for FP48 equal to unity
+ *
+	@param x FP48 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP48_isunity(FP48 *x);
+/**	@brief Copy FP48 to another FP48
+ *
+	@param x FP48 instance, on exit = y
+	@param y FP48 instance to be copied
+ */
+extern void FP48_copy(FP48 *x, FP48 *y);
+/**	@brief Set FP48 to unity
+ *
+	@param x FP48 instance to be set to one
+ */
+extern void FP48_one(FP48 *x);
+
+/**	@brief Set FP48 to zero
+ *
+	@param x FP48 instance to be set to zero
+ */
+extern void FP48_zero(FP48 *x);
+
+/**	@brief Tests for equality of two FP48s
+ *
+	@param x FP48 instance to be compared
+	@param y FP48 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP48_equals(FP48 *x, FP48 *y);
+/**	@brief Conjugation of FP48
+ *
+	If y=(a,b,c) (where a,b,c are its three FP16 components) on exit x=(conj(a),-conj(b),conj(c))
+	@param x FP48 instance, on exit = conj(y)
+	@param y FP48 instance
+ */
+extern void FP48_conj(FP48 *x, FP48 *y);
+/**	@brief Initialise FP48 from single FP16
+ *
+	Sets first FP16 component of an FP48, other components set to zero
+	@param x FP48 instance to be initialised
+	@param a FP16 to form first part of FP48
+ */
+extern void FP48_from_FP16(FP48 *x, FP16 *a);
+/**	@brief Initialise FP48 from three FP16s
+ *
+	@param x FP48 instance to be initialised
+	@param a FP16 to form first part of FP48
+	@param b FP16 to form second part of FP48
+	@param c FP16 to form third part of FP48
+ */
+extern void FP48_from_FP16s(FP48 *x, FP16 *a, FP16* b, FP16 *c);
+/**	@brief Fast Squaring of an FP48 in "unitary" form
+ *
+	@param x FP48 instance, on exit = y^2
+	@param y FP16 instance, must be unitary
+ */
+extern void FP48_usqr(FP48 *x, FP48 *y);
+/**	@brief Squaring an FP48
+ *
+	@param x FP48 instance, on exit = y^2
+	@param y FP48 instance
+ */
+extern void FP48_sqr(FP48 *x, FP48 *y);
+/**	@brief Fast multiplication of two sparse FP24s that arises from ATE pairing line functions
+ *
+	@param x FP48 instance, on exit = x*y
+	@param y FP48 instance, of special form
+ */
+extern void FP48_smul(FP48 *x, FP48 *y);
+
+/**	@brief Fast multiplication of what may be sparse multiplicands
+ *
+	@param x FP48 instance, on exit = x*y
+	@param y FP48 instance, of special form
+ */
+extern void FP48_ssmul(FP48 *x, FP48 *y);
+/**	@brief Full unconditional Multiplication of two FP24s
+ *
+	@param x FP48 instance, on exit = x*y
+	@param y FP48 instance, the multiplier
+ */
+extern void FP48_mul(FP48 *x, FP48 *y);
+/**	@brief Inverting an FP48
+ *
+	@param x FP48 instance, on exit = 1/y
+	@param y FP48 instance
+ */
+extern void FP48_inv(FP48 *x, FP48 *y);
+/**	@brief Raises an FP48 to the power of a BIG
+ *
+	@param r FP48 instance, on exit = y^b
+	@param x FP48 instance
+	@param b BIG number
+ */
+extern void FP48_pow(FP48 *r, FP48 *x, B584_60::BIG b);
+
+//extern void FP48_ppow(FP48 *r,FP48 *x,B584_60::BIG b);
+
+/**	@brief Raises an FP48 instance x to a small integer power, side-channel resistant
+ *
+	@param x FP48 instance, on exit = x^i
+	@param i small integer exponent
+	@param b maximum number of bits in exponent
+ */
+extern void FP48_pinpow(FP48 *x, int i, int b);
+
+/**	@brief Raises an FP48 instance x to a BIG power, compressed to FP16
+ *
+	@param c FP16 instance, on exit = x^(e mod r) as FP16
+	@param x FP48 input
+	@param e BIG exponent
+	@param r BIG group order
+ */
+extern void FP48_compow(FP16 *c, FP48 *x, B584_60::BIG e, B584_60::BIG r);
+
+/**	@brief Calculate Pi x[i]^b[i] for i=0 to 15, side-channel resistant
+ *
+	@param r FP48 instance, on exit = Pi x[i]^b[i] for i=0 to 15
+	@param x FP48 array with 16 FP48s
+	@param b BIG array of 16 exponents
+ */
+extern void FP48_pow16(FP48 *r, FP48 *x, B584_60::BIG *b);
+
+
+/**	@brief Raises an FP48 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP48 instance, on exit = x^p^n
+	@param f FP2 precalculated Frobenius constant
+	@param n power of p
+ */
+extern void FP48_frob(FP48 *x, FP2 *f, int n);
+
+/**	@brief Reduces all components of possibly unreduced FP48 mod Modulus
+ *
+	@param x FP48 instance, on exit reduced mod Modulus
+ */
+extern void FP48_reduce(FP48 *x);
+/**	@brief Normalises the components of an FP48
+ *
+	@param x FP48 instance to be normalised
+ */
+extern void FP48_norm(FP48 *x);
+/**	@brief Formats and outputs an FP48 to the console
+ *
+	@param x FP48 instance to be printed
+ */
+extern void FP48_output(FP48 *x);
+/**	@brief Formats and outputs an FP48 instance to an octet string
+ *
+	Serializes the components of an FP48 to big-endian base 256 form.
+	@param S output octet string
+	@param x FP48 instance to be converted to an octet string
+ */
+extern void FP48_toOctet(octet *S, FP48 *x);
+/**	@brief Creates an FP48 instance from an octet string
+ *
+	De-serializes the components of an FP48 to create an FP48 from big-endian base 256 components.
+	@param x FP48 instance to be created from an octet string
+	@param S input octet string
+
+ */
+extern void FP48_fromOctet(FP48 *x, octet *S);
+/**	@brief Calculate the trace of an FP48
+ *
+	@param t FP16 trace of x, on exit = tr(x)
+	@param x FP48 instance
+
+ */
+extern void FP48_trace(FP16 *t, FP48 *x);
+
+/**	@brief Conditional copy of FP48 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP48 instance, set to y if s!=0
+	@param y another FP48 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP48_cmove(FP48 *x, FP48 *y, int s);
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp4_BLS12381.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp4_BLS12381.h
new file mode 100644
index 0000000..7d84be6
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp4_BLS12381.h
@@ -0,0 +1,349 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP4_BLS12381_H
+#define FP4_BLS12381_H
+
+#include "fp2_BLS12381.h"
+#include "config_curve_BLS12381.h"
+
+using namespace core;
+
+namespace BLS12381 {
+
+/**
+	@brief FP4 Structure - towered over two FP2
+*/
+
+typedef struct
+{
+    FP2 a; /**< real part of FP4 */
+    FP2 b; /**< imaginary part of FP4 */
+} FP4;
+
+
+/* FP4 prototypes */
+/**	@brief Tests for FP4 equal to zero
+ *
+	@param x FP4 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP4_iszilch(FP4 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP4 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP4_islarger(FP4 *x);
+
+/**	@brief Serialize out FP4  
+ *
+    @param b buffer for output
+	@param x FP4 number to be serialized
+ */
+extern void FP4_toBytes(char *b,FP4 *x);
+
+/**	@brief Serialize in FP4  
+ *
+	@param x FP4 number to be serialized
+    @param b buffer for input
+ */
+extern void FP4_fromBytes(FP4 *x,char *b);
+
+/**	@brief Tests for FP4 equal to unity
+ *
+	@param x FP4 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP4_isunity(FP4 *x);
+/**	@brief Tests for equality of two FP4s
+ *
+	@param x FP4 instance to be compared
+	@param y FP4 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP4_equals(FP4 *x, FP4 *y);
+/**	@brief Tests for FP4 having only a real part and no imaginary part
+ *
+	@param x FP4 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP4_isreal(FP4 *x);
+/**	@brief Initialise FP4 from two FP2s
+ *
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+	@param b FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2s(FP4 *x, FP2 *a, FP2 *b);
+/**	@brief Initialise FP4 from single FP2
+ *
+	Imaginary part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+ */
+extern void FP4_from_FP2(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP2
+ *
+	real part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2H(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP
+ *
+	@param x FP4 instance to be initialised
+	@param a FP to form real part of FP4
+ */
+extern void FP4_from_FP(FP4 *x, FP *a);
+
+/**	@brief Copy FP4 to another FP4
+ *
+	@param x FP4 instance, on exit = y
+	@param y FP4 instance to be copied
+ */
+extern void FP4_copy(FP4 *x, FP4 *y);
+/**	@brief Set FP4 to zero
+ *
+	@param x FP4 instance to be set to zero
+ */
+extern void FP4_zero(FP4 *x);
+/**	@brief Set FP4 to unity
+ *
+	@param x FP4 instance to be set to one
+ */
+extern void FP4_one(FP4 *x);
+
+/**	@brief Sign of FP4
+ *
+	@param x FP4 instance
+	@return "sign" of FP4
+ */
+extern int FP4_sign(FP4 *x);
+
+/**	@brief Negation of FP4
+ *
+	@param x FP4 instance, on exit = -y
+	@param y FP4 instance
+ */
+extern void FP4_neg(FP4 *x, FP4 *y);
+/**	@brief Conjugation of FP4
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP4 instance, on exit = conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_conj(FP4 *x, FP4 *y);
+/**	@brief Negative conjugation of FP4
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP4 instance, on exit = -conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_nconj(FP4 *x, FP4 *y);
+/**	@brief addition of two FP4s
+ *
+	@param x FP4 instance, on exit = y+z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_add(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief subtraction of two FP4s
+ *
+	@param x FP4 instance, on exit = y-z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_sub(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Multiplication of an FP4 by an FP2
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP2 multiplier
+ */
+extern void FP4_pmul(FP4 *x, FP4 *y, FP2 *a);
+
+
+/**	@brief Multiplication of an FP4 by an FP
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP multiplier
+ */
+extern void FP4_qmul(FP4 *x, FP4 *y, FP *a);
+
+/**	@brief Multiplication of an FP4 by a small integer
+ *
+	@param x FP4 instance, on exit = y*i
+	@param y FP4 instance
+	@param i an integer
+ */
+extern void FP4_imul(FP4 *x, FP4 *y, int i);
+/**	@brief Squaring an FP4
+ *
+	@param x FP4 instance, on exit = y^2
+	@param y FP4 instance
+ */
+extern void FP4_sqr(FP4 *x, FP4 *y);
+/**	@brief Multiplication of two FP4s
+ *
+	@param x FP4 instance, on exit = y*z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_mul(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Inverting an FP4
+ *
+	@param x FP4 instance, on exit = 1/y
+	@param y FP4 instance
+    @param h optional input hint
+ */
+extern void FP4_inv(FP4 *x, FP4 *y, FP *h);
+
+/**	@brief Divide an FP4 by 2
+ *
+	@param x FP4 instance, on exit = y/2
+	@param y FP4 instance
+ */
+extern void FP4_div2(FP4 *x, FP4 *y);
+
+
+/**	@brief Formats and outputs an FP4 to the console
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_output(FP4 *x);
+/**	@brief Formats and outputs an FP4 to the console in raw form (for debugging)
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_rawoutput(FP4 *x);
+/**	@brief multiplies an FP4 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP4 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP4_times_i(FP4 *x);
+/**	@brief Normalises the components of an FP4
+ *
+	@param x FP4 instance to be normalised
+ */
+extern void FP4_norm(FP4 *x);
+/**	@brief Reduces all components of possibly unreduced FP4 mod Modulus
+ *
+	@param x FP4 instance, on exit reduced mod Modulus
+ */
+extern void FP4_reduce(FP4 *x);
+/**	@brief Raises an FP4 to the power of a BIG
+ *
+	@param x FP4 instance, on exit = y^b
+	@param y FP4 instance
+	@param b BIG number
+ */
+extern void FP4_pow(FP4 *x, FP4 *y, B384_58::BIG b);
+/**	@brief Raises an FP4 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP4 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP4_frob(FP4 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP4 instance, on exit = w*x-conj(x)*y+z
+	@param w FP4 instance
+	@param x FP4 instance
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_xtr_A(FP4 *r, FP4 *w, FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP4 instance, on exit = x^2-2*conj(x)
+	@param x FP4 instance
+ */
+extern void FP4_xtr_D(FP4 *r, FP4 *x);
+/**	@brief Calculates FP4 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP4 instance, on exit = trace(w^b)
+	@param x FP4 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP4_xtr_pow(FP4 *r, FP4 *x, B384_58::BIG b);
+/**	@brief Calculates FP4 trace of c^a.d^b, where c and d are derived from FP4 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP4 instance, on exit = trace(c^a.d^b)
+	@param c FP4 instance, trace of an FP12
+	@param d FP4 instance, trace of an FP12
+	@param e FP4 instance, trace of an FP12
+	@param f FP4 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP4_xtr_pow2(FP4 *r, FP4 *c, FP4 *d, FP4 *e, FP4 *f, B384_58::BIG a, B384_58::BIG b);
+
+/**	@brief Test FP4 for QR
+ * 
+	@param r FP4 instance
+    @param h optional generated hint
+	@return 1 x is a QR, otherwise 0
+ */
+extern int  FP4_qr(FP4 *r, FP *h);
+
+/**	@brief Calculate square root of an FP4
+ *
+	Square root
+	@param r FP4 instance, on exit = sqrt(x)
+	@param x FP4 instance
+    @param h optional input hint
+ */
+extern void  FP4_sqrt(FP4 *r, FP4 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP4 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP4 instance, set to y if s!=0
+	@param y another FP4 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP4_cmove(FP4 *x, FP4 *y, int s);
+
+
+/**	@brief Divide FP4 number by QNR
+ *
+	Divide FP4 by the QNR
+	@param x FP4 instance
+ */
+extern void FP4_div_i(FP4 *x);
+
+/**	@brief Generate random FP4
+ *
+	@param x random FP4 number
+	@param rng random number generator
+ */
+extern void FP4_rand(FP4 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp4_BLS12383.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp4_BLS12383.h
new file mode 100644
index 0000000..d8c77ca
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp4_BLS12383.h
@@ -0,0 +1,349 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP4_BLS12383_H
+#define FP4_BLS12383_H
+
+#include "fp2_BLS12383.h"
+#include "config_curve_BLS12383.h"
+
+using namespace core;
+
+namespace BLS12383 {
+
+/**
+	@brief FP4 Structure - towered over two FP2
+*/
+
+typedef struct
+{
+    FP2 a; /**< real part of FP4 */
+    FP2 b; /**< imaginary part of FP4 */
+} FP4;
+
+
+/* FP4 prototypes */
+/**	@brief Tests for FP4 equal to zero
+ *
+	@param x FP4 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP4_iszilch(FP4 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP4 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP4_islarger(FP4 *x);
+
+/**	@brief Serialize out FP4  
+ *
+    @param b buffer for output
+	@param x FP4 number to be serialized
+ */
+extern void FP4_toBytes(char *b,FP4 *x);
+
+/**	@brief Serialize in FP4  
+ *
+	@param x FP4 number to be serialized
+    @param b buffer for input
+ */
+extern void FP4_fromBytes(FP4 *x,char *b);
+
+/**	@brief Tests for FP4 equal to unity
+ *
+	@param x FP4 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP4_isunity(FP4 *x);
+/**	@brief Tests for equality of two FP4s
+ *
+	@param x FP4 instance to be compared
+	@param y FP4 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP4_equals(FP4 *x, FP4 *y);
+/**	@brief Tests for FP4 having only a real part and no imaginary part
+ *
+	@param x FP4 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP4_isreal(FP4 *x);
+/**	@brief Initialise FP4 from two FP2s
+ *
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+	@param b FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2s(FP4 *x, FP2 *a, FP2 *b);
+/**	@brief Initialise FP4 from single FP2
+ *
+	Imaginary part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+ */
+extern void FP4_from_FP2(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP2
+ *
+	real part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2H(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP
+ *
+	@param x FP4 instance to be initialised
+	@param a FP to form real part of FP4
+ */
+extern void FP4_from_FP(FP4 *x, FP *a);
+
+/**	@brief Copy FP4 to another FP4
+ *
+	@param x FP4 instance, on exit = y
+	@param y FP4 instance to be copied
+ */
+extern void FP4_copy(FP4 *x, FP4 *y);
+/**	@brief Set FP4 to zero
+ *
+	@param x FP4 instance to be set to zero
+ */
+extern void FP4_zero(FP4 *x);
+/**	@brief Set FP4 to unity
+ *
+	@param x FP4 instance to be set to one
+ */
+extern void FP4_one(FP4 *x);
+
+/**	@brief Sign of FP4
+ *
+	@param x FP4 instance
+	@return "sign" of FP4
+ */
+extern int FP4_sign(FP4 *x);
+
+/**	@brief Negation of FP4
+ *
+	@param x FP4 instance, on exit = -y
+	@param y FP4 instance
+ */
+extern void FP4_neg(FP4 *x, FP4 *y);
+/**	@brief Conjugation of FP4
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP4 instance, on exit = conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_conj(FP4 *x, FP4 *y);
+/**	@brief Negative conjugation of FP4
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP4 instance, on exit = -conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_nconj(FP4 *x, FP4 *y);
+/**	@brief addition of two FP4s
+ *
+	@param x FP4 instance, on exit = y+z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_add(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief subtraction of two FP4s
+ *
+	@param x FP4 instance, on exit = y-z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_sub(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Multiplication of an FP4 by an FP2
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP2 multiplier
+ */
+extern void FP4_pmul(FP4 *x, FP4 *y, FP2 *a);
+
+
+/**	@brief Multiplication of an FP4 by an FP
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP multiplier
+ */
+extern void FP4_qmul(FP4 *x, FP4 *y, FP *a);
+
+/**	@brief Multiplication of an FP4 by a small integer
+ *
+	@param x FP4 instance, on exit = y*i
+	@param y FP4 instance
+	@param i an integer
+ */
+extern void FP4_imul(FP4 *x, FP4 *y, int i);
+/**	@brief Squaring an FP4
+ *
+	@param x FP4 instance, on exit = y^2
+	@param y FP4 instance
+ */
+extern void FP4_sqr(FP4 *x, FP4 *y);
+/**	@brief Multiplication of two FP4s
+ *
+	@param x FP4 instance, on exit = y*z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_mul(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Inverting an FP4
+ *
+	@param x FP4 instance, on exit = 1/y
+	@param y FP4 instance
+    @param h optional input hint
+ */
+extern void FP4_inv(FP4 *x, FP4 *y, FP *h);
+
+/**	@brief Divide an FP4 by 2
+ *
+	@param x FP4 instance, on exit = y/2
+	@param y FP4 instance
+ */
+extern void FP4_div2(FP4 *x, FP4 *y);
+
+
+/**	@brief Formats and outputs an FP4 to the console
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_output(FP4 *x);
+/**	@brief Formats and outputs an FP4 to the console in raw form (for debugging)
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_rawoutput(FP4 *x);
+/**	@brief multiplies an FP4 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP4 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP4_times_i(FP4 *x);
+/**	@brief Normalises the components of an FP4
+ *
+	@param x FP4 instance to be normalised
+ */
+extern void FP4_norm(FP4 *x);
+/**	@brief Reduces all components of possibly unreduced FP4 mod Modulus
+ *
+	@param x FP4 instance, on exit reduced mod Modulus
+ */
+extern void FP4_reduce(FP4 *x);
+/**	@brief Raises an FP4 to the power of a BIG
+ *
+	@param x FP4 instance, on exit = y^b
+	@param y FP4 instance
+	@param b BIG number
+ */
+extern void FP4_pow(FP4 *x, FP4 *y, B384_58::BIG b);
+/**	@brief Raises an FP4 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP4 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP4_frob(FP4 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP4 instance, on exit = w*x-conj(x)*y+z
+	@param w FP4 instance
+	@param x FP4 instance
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_xtr_A(FP4 *r, FP4 *w, FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP4 instance, on exit = x^2-2*conj(x)
+	@param x FP4 instance
+ */
+extern void FP4_xtr_D(FP4 *r, FP4 *x);
+/**	@brief Calculates FP4 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP4 instance, on exit = trace(w^b)
+	@param x FP4 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP4_xtr_pow(FP4 *r, FP4 *x, B384_58::BIG b);
+/**	@brief Calculates FP4 trace of c^a.d^b, where c and d are derived from FP4 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP4 instance, on exit = trace(c^a.d^b)
+	@param c FP4 instance, trace of an FP12
+	@param d FP4 instance, trace of an FP12
+	@param e FP4 instance, trace of an FP12
+	@param f FP4 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP4_xtr_pow2(FP4 *r, FP4 *c, FP4 *d, FP4 *e, FP4 *f, B384_58::BIG a, B384_58::BIG b);
+
+/**	@brief Test FP4 for QR
+ * 
+	@param r FP4 instance
+    @param h optional generated hint
+	@return 1 x is a QR, otherwise 0
+ */
+extern int  FP4_qr(FP4 *r, FP *h);
+
+/**	@brief Calculate square root of an FP4
+ *
+	Square root
+	@param r FP4 instance, on exit = sqrt(x)
+	@param x FP4 instance
+    @param h optional input hint
+ */
+extern void  FP4_sqrt(FP4 *r, FP4 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP4 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP4 instance, set to y if s!=0
+	@param y another FP4 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP4_cmove(FP4 *x, FP4 *y, int s);
+
+
+/**	@brief Divide FP4 number by QNR
+ *
+	Divide FP4 by the QNR
+	@param x FP4 instance
+ */
+extern void FP4_div_i(FP4 *x);
+
+/**	@brief Generate random FP4
+ *
+	@param x random FP4 number
+	@param rng random number generator
+ */
+extern void FP4_rand(FP4 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp4_BLS12443.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp4_BLS12443.h
new file mode 100644
index 0000000..34dee30
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp4_BLS12443.h
@@ -0,0 +1,349 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP4_BLS12443_H
+#define FP4_BLS12443_H
+
+#include "fp2_BLS12443.h"
+#include "config_curve_BLS12443.h"
+
+using namespace core;
+
+namespace BLS12443 {
+
+/**
+	@brief FP4 Structure - towered over two FP2
+*/
+
+typedef struct
+{
+    FP2 a; /**< real part of FP4 */
+    FP2 b; /**< imaginary part of FP4 */
+} FP4;
+
+
+/* FP4 prototypes */
+/**	@brief Tests for FP4 equal to zero
+ *
+	@param x FP4 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP4_iszilch(FP4 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP4 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP4_islarger(FP4 *x);
+
+/**	@brief Serialize out FP4  
+ *
+    @param b buffer for output
+	@param x FP4 number to be serialized
+ */
+extern void FP4_toBytes(char *b,FP4 *x);
+
+/**	@brief Serialize in FP4  
+ *
+	@param x FP4 number to be serialized
+    @param b buffer for input
+ */
+extern void FP4_fromBytes(FP4 *x,char *b);
+
+/**	@brief Tests for FP4 equal to unity
+ *
+	@param x FP4 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP4_isunity(FP4 *x);
+/**	@brief Tests for equality of two FP4s
+ *
+	@param x FP4 instance to be compared
+	@param y FP4 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP4_equals(FP4 *x, FP4 *y);
+/**	@brief Tests for FP4 having only a real part and no imaginary part
+ *
+	@param x FP4 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP4_isreal(FP4 *x);
+/**	@brief Initialise FP4 from two FP2s
+ *
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+	@param b FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2s(FP4 *x, FP2 *a, FP2 *b);
+/**	@brief Initialise FP4 from single FP2
+ *
+	Imaginary part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+ */
+extern void FP4_from_FP2(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP2
+ *
+	real part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2H(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP
+ *
+	@param x FP4 instance to be initialised
+	@param a FP to form real part of FP4
+ */
+extern void FP4_from_FP(FP4 *x, FP *a);
+
+/**	@brief Copy FP4 to another FP4
+ *
+	@param x FP4 instance, on exit = y
+	@param y FP4 instance to be copied
+ */
+extern void FP4_copy(FP4 *x, FP4 *y);
+/**	@brief Set FP4 to zero
+ *
+	@param x FP4 instance to be set to zero
+ */
+extern void FP4_zero(FP4 *x);
+/**	@brief Set FP4 to unity
+ *
+	@param x FP4 instance to be set to one
+ */
+extern void FP4_one(FP4 *x);
+
+/**	@brief Sign of FP4
+ *
+	@param x FP4 instance
+	@return "sign" of FP4
+ */
+extern int FP4_sign(FP4 *x);
+
+/**	@brief Negation of FP4
+ *
+	@param x FP4 instance, on exit = -y
+	@param y FP4 instance
+ */
+extern void FP4_neg(FP4 *x, FP4 *y);
+/**	@brief Conjugation of FP4
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP4 instance, on exit = conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_conj(FP4 *x, FP4 *y);
+/**	@brief Negative conjugation of FP4
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP4 instance, on exit = -conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_nconj(FP4 *x, FP4 *y);
+/**	@brief addition of two FP4s
+ *
+	@param x FP4 instance, on exit = y+z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_add(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief subtraction of two FP4s
+ *
+	@param x FP4 instance, on exit = y-z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_sub(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Multiplication of an FP4 by an FP2
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP2 multiplier
+ */
+extern void FP4_pmul(FP4 *x, FP4 *y, FP2 *a);
+
+
+/**	@brief Multiplication of an FP4 by an FP
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP multiplier
+ */
+extern void FP4_qmul(FP4 *x, FP4 *y, FP *a);
+
+/**	@brief Multiplication of an FP4 by a small integer
+ *
+	@param x FP4 instance, on exit = y*i
+	@param y FP4 instance
+	@param i an integer
+ */
+extern void FP4_imul(FP4 *x, FP4 *y, int i);
+/**	@brief Squaring an FP4
+ *
+	@param x FP4 instance, on exit = y^2
+	@param y FP4 instance
+ */
+extern void FP4_sqr(FP4 *x, FP4 *y);
+/**	@brief Multiplication of two FP4s
+ *
+	@param x FP4 instance, on exit = y*z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_mul(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Inverting an FP4
+ *
+	@param x FP4 instance, on exit = 1/y
+	@param y FP4 instance
+    @param h optional input hint
+ */
+extern void FP4_inv(FP4 *x, FP4 *y, FP *h);
+
+/**	@brief Divide an FP4 by 2
+ *
+	@param x FP4 instance, on exit = y/2
+	@param y FP4 instance
+ */
+extern void FP4_div2(FP4 *x, FP4 *y);
+
+
+/**	@brief Formats and outputs an FP4 to the console
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_output(FP4 *x);
+/**	@brief Formats and outputs an FP4 to the console in raw form (for debugging)
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_rawoutput(FP4 *x);
+/**	@brief multiplies an FP4 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP4 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP4_times_i(FP4 *x);
+/**	@brief Normalises the components of an FP4
+ *
+	@param x FP4 instance to be normalised
+ */
+extern void FP4_norm(FP4 *x);
+/**	@brief Reduces all components of possibly unreduced FP4 mod Modulus
+ *
+	@param x FP4 instance, on exit reduced mod Modulus
+ */
+extern void FP4_reduce(FP4 *x);
+/**	@brief Raises an FP4 to the power of a BIG
+ *
+	@param x FP4 instance, on exit = y^b
+	@param y FP4 instance
+	@param b BIG number
+ */
+extern void FP4_pow(FP4 *x, FP4 *y, B448_60::BIG b);
+/**	@brief Raises an FP4 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP4 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP4_frob(FP4 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP4 instance, on exit = w*x-conj(x)*y+z
+	@param w FP4 instance
+	@param x FP4 instance
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_xtr_A(FP4 *r, FP4 *w, FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP4 instance, on exit = x^2-2*conj(x)
+	@param x FP4 instance
+ */
+extern void FP4_xtr_D(FP4 *r, FP4 *x);
+/**	@brief Calculates FP4 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP4 instance, on exit = trace(w^b)
+	@param x FP4 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP4_xtr_pow(FP4 *r, FP4 *x, B448_60::BIG b);
+/**	@brief Calculates FP4 trace of c^a.d^b, where c and d are derived from FP4 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP4 instance, on exit = trace(c^a.d^b)
+	@param c FP4 instance, trace of an FP12
+	@param d FP4 instance, trace of an FP12
+	@param e FP4 instance, trace of an FP12
+	@param f FP4 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP4_xtr_pow2(FP4 *r, FP4 *c, FP4 *d, FP4 *e, FP4 *f, B448_60::BIG a, B448_60::BIG b);
+
+/**	@brief Test FP4 for QR
+ * 
+	@param r FP4 instance
+    @param h optional generated hint
+	@return 1 x is a QR, otherwise 0
+ */
+extern int  FP4_qr(FP4 *r, FP *h);
+
+/**	@brief Calculate square root of an FP4
+ *
+	Square root
+	@param r FP4 instance, on exit = sqrt(x)
+	@param x FP4 instance
+    @param h optional input hint
+ */
+extern void  FP4_sqrt(FP4 *r, FP4 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP4 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP4 instance, set to y if s!=0
+	@param y another FP4 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP4_cmove(FP4 *x, FP4 *y, int s);
+
+
+/**	@brief Divide FP4 number by QNR
+ *
+	Divide FP4 by the QNR
+	@param x FP4 instance
+ */
+extern void FP4_div_i(FP4 *x);
+
+/**	@brief Generate random FP4
+ *
+	@param x random FP4 number
+	@param rng random number generator
+ */
+extern void FP4_rand(FP4 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp4_BLS12461.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp4_BLS12461.h
new file mode 100644
index 0000000..203a67c
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp4_BLS12461.h
@@ -0,0 +1,349 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP4_BLS12461_H
+#define FP4_BLS12461_H
+
+#include "fp2_BLS12461.h"
+#include "config_curve_BLS12461.h"
+
+using namespace core;
+
+namespace BLS12461 {
+
+/**
+	@brief FP4 Structure - towered over two FP2
+*/
+
+typedef struct
+{
+    FP2 a; /**< real part of FP4 */
+    FP2 b; /**< imaginary part of FP4 */
+} FP4;
+
+
+/* FP4 prototypes */
+/**	@brief Tests for FP4 equal to zero
+ *
+	@param x FP4 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP4_iszilch(FP4 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP4 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP4_islarger(FP4 *x);
+
+/**	@brief Serialize out FP4  
+ *
+    @param b buffer for output
+	@param x FP4 number to be serialized
+ */
+extern void FP4_toBytes(char *b,FP4 *x);
+
+/**	@brief Serialize in FP4  
+ *
+	@param x FP4 number to be serialized
+    @param b buffer for input
+ */
+extern void FP4_fromBytes(FP4 *x,char *b);
+
+/**	@brief Tests for FP4 equal to unity
+ *
+	@param x FP4 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP4_isunity(FP4 *x);
+/**	@brief Tests for equality of two FP4s
+ *
+	@param x FP4 instance to be compared
+	@param y FP4 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP4_equals(FP4 *x, FP4 *y);
+/**	@brief Tests for FP4 having only a real part and no imaginary part
+ *
+	@param x FP4 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP4_isreal(FP4 *x);
+/**	@brief Initialise FP4 from two FP2s
+ *
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+	@param b FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2s(FP4 *x, FP2 *a, FP2 *b);
+/**	@brief Initialise FP4 from single FP2
+ *
+	Imaginary part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+ */
+extern void FP4_from_FP2(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP2
+ *
+	real part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2H(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP
+ *
+	@param x FP4 instance to be initialised
+	@param a FP to form real part of FP4
+ */
+extern void FP4_from_FP(FP4 *x, FP *a);
+
+/**	@brief Copy FP4 to another FP4
+ *
+	@param x FP4 instance, on exit = y
+	@param y FP4 instance to be copied
+ */
+extern void FP4_copy(FP4 *x, FP4 *y);
+/**	@brief Set FP4 to zero
+ *
+	@param x FP4 instance to be set to zero
+ */
+extern void FP4_zero(FP4 *x);
+/**	@brief Set FP4 to unity
+ *
+	@param x FP4 instance to be set to one
+ */
+extern void FP4_one(FP4 *x);
+
+/**	@brief Sign of FP4
+ *
+	@param x FP4 instance
+	@return "sign" of FP4
+ */
+extern int FP4_sign(FP4 *x);
+
+/**	@brief Negation of FP4
+ *
+	@param x FP4 instance, on exit = -y
+	@param y FP4 instance
+ */
+extern void FP4_neg(FP4 *x, FP4 *y);
+/**	@brief Conjugation of FP4
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP4 instance, on exit = conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_conj(FP4 *x, FP4 *y);
+/**	@brief Negative conjugation of FP4
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP4 instance, on exit = -conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_nconj(FP4 *x, FP4 *y);
+/**	@brief addition of two FP4s
+ *
+	@param x FP4 instance, on exit = y+z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_add(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief subtraction of two FP4s
+ *
+	@param x FP4 instance, on exit = y-z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_sub(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Multiplication of an FP4 by an FP2
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP2 multiplier
+ */
+extern void FP4_pmul(FP4 *x, FP4 *y, FP2 *a);
+
+
+/**	@brief Multiplication of an FP4 by an FP
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP multiplier
+ */
+extern void FP4_qmul(FP4 *x, FP4 *y, FP *a);
+
+/**	@brief Multiplication of an FP4 by a small integer
+ *
+	@param x FP4 instance, on exit = y*i
+	@param y FP4 instance
+	@param i an integer
+ */
+extern void FP4_imul(FP4 *x, FP4 *y, int i);
+/**	@brief Squaring an FP4
+ *
+	@param x FP4 instance, on exit = y^2
+	@param y FP4 instance
+ */
+extern void FP4_sqr(FP4 *x, FP4 *y);
+/**	@brief Multiplication of two FP4s
+ *
+	@param x FP4 instance, on exit = y*z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_mul(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Inverting an FP4
+ *
+	@param x FP4 instance, on exit = 1/y
+	@param y FP4 instance
+    @param h optional input hint
+ */
+extern void FP4_inv(FP4 *x, FP4 *y, FP *h);
+
+/**	@brief Divide an FP4 by 2
+ *
+	@param x FP4 instance, on exit = y/2
+	@param y FP4 instance
+ */
+extern void FP4_div2(FP4 *x, FP4 *y);
+
+
+/**	@brief Formats and outputs an FP4 to the console
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_output(FP4 *x);
+/**	@brief Formats and outputs an FP4 to the console in raw form (for debugging)
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_rawoutput(FP4 *x);
+/**	@brief multiplies an FP4 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP4 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP4_times_i(FP4 *x);
+/**	@brief Normalises the components of an FP4
+ *
+	@param x FP4 instance to be normalised
+ */
+extern void FP4_norm(FP4 *x);
+/**	@brief Reduces all components of possibly unreduced FP4 mod Modulus
+ *
+	@param x FP4 instance, on exit reduced mod Modulus
+ */
+extern void FP4_reduce(FP4 *x);
+/**	@brief Raises an FP4 to the power of a BIG
+ *
+	@param x FP4 instance, on exit = y^b
+	@param y FP4 instance
+	@param b BIG number
+ */
+extern void FP4_pow(FP4 *x, FP4 *y, B464_60::BIG b);
+/**	@brief Raises an FP4 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP4 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP4_frob(FP4 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP4 instance, on exit = w*x-conj(x)*y+z
+	@param w FP4 instance
+	@param x FP4 instance
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_xtr_A(FP4 *r, FP4 *w, FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP4 instance, on exit = x^2-2*conj(x)
+	@param x FP4 instance
+ */
+extern void FP4_xtr_D(FP4 *r, FP4 *x);
+/**	@brief Calculates FP4 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP4 instance, on exit = trace(w^b)
+	@param x FP4 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP4_xtr_pow(FP4 *r, FP4 *x, B464_60::BIG b);
+/**	@brief Calculates FP4 trace of c^a.d^b, where c and d are derived from FP4 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP4 instance, on exit = trace(c^a.d^b)
+	@param c FP4 instance, trace of an FP12
+	@param d FP4 instance, trace of an FP12
+	@param e FP4 instance, trace of an FP12
+	@param f FP4 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP4_xtr_pow2(FP4 *r, FP4 *c, FP4 *d, FP4 *e, FP4 *f, B464_60::BIG a, B464_60::BIG b);
+
+/**	@brief Test FP4 for QR
+ * 
+	@param r FP4 instance
+    @param h optional generated hint
+	@return 1 x is a QR, otherwise 0
+ */
+extern int  FP4_qr(FP4 *r, FP *h);
+
+/**	@brief Calculate square root of an FP4
+ *
+	Square root
+	@param r FP4 instance, on exit = sqrt(x)
+	@param x FP4 instance
+    @param h optional input hint
+ */
+extern void  FP4_sqrt(FP4 *r, FP4 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP4 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP4 instance, set to y if s!=0
+	@param y another FP4 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP4_cmove(FP4 *x, FP4 *y, int s);
+
+
+/**	@brief Divide FP4 number by QNR
+ *
+	Divide FP4 by the QNR
+	@param x FP4 instance
+ */
+extern void FP4_div_i(FP4 *x);
+
+/**	@brief Generate random FP4
+ *
+	@param x random FP4 number
+	@param rng random number generator
+ */
+extern void FP4_rand(FP4 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp4_BLS24479.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp4_BLS24479.h
new file mode 100644
index 0000000..e6a193c
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp4_BLS24479.h
@@ -0,0 +1,349 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP4_BLS24479_H
+#define FP4_BLS24479_H
+
+#include "fp2_BLS24479.h"
+#include "config_curve_BLS24479.h"
+
+using namespace core;
+
+namespace BLS24479 {
+
+/**
+	@brief FP4 Structure - towered over two FP2
+*/
+
+typedef struct
+{
+    FP2 a; /**< real part of FP4 */
+    FP2 b; /**< imaginary part of FP4 */
+} FP4;
+
+
+/* FP4 prototypes */
+/**	@brief Tests for FP4 equal to zero
+ *
+	@param x FP4 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP4_iszilch(FP4 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP4 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP4_islarger(FP4 *x);
+
+/**	@brief Serialize out FP4  
+ *
+    @param b buffer for output
+	@param x FP4 number to be serialized
+ */
+extern void FP4_toBytes(char *b,FP4 *x);
+
+/**	@brief Serialize in FP4  
+ *
+	@param x FP4 number to be serialized
+    @param b buffer for input
+ */
+extern void FP4_fromBytes(FP4 *x,char *b);
+
+/**	@brief Tests for FP4 equal to unity
+ *
+	@param x FP4 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP4_isunity(FP4 *x);
+/**	@brief Tests for equality of two FP4s
+ *
+	@param x FP4 instance to be compared
+	@param y FP4 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP4_equals(FP4 *x, FP4 *y);
+/**	@brief Tests for FP4 having only a real part and no imaginary part
+ *
+	@param x FP4 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP4_isreal(FP4 *x);
+/**	@brief Initialise FP4 from two FP2s
+ *
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+	@param b FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2s(FP4 *x, FP2 *a, FP2 *b);
+/**	@brief Initialise FP4 from single FP2
+ *
+	Imaginary part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+ */
+extern void FP4_from_FP2(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP2
+ *
+	real part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2H(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP
+ *
+	@param x FP4 instance to be initialised
+	@param a FP to form real part of FP4
+ */
+extern void FP4_from_FP(FP4 *x, FP *a);
+
+/**	@brief Copy FP4 to another FP4
+ *
+	@param x FP4 instance, on exit = y
+	@param y FP4 instance to be copied
+ */
+extern void FP4_copy(FP4 *x, FP4 *y);
+/**	@brief Set FP4 to zero
+ *
+	@param x FP4 instance to be set to zero
+ */
+extern void FP4_zero(FP4 *x);
+/**	@brief Set FP4 to unity
+ *
+	@param x FP4 instance to be set to one
+ */
+extern void FP4_one(FP4 *x);
+
+/**	@brief Sign of FP4
+ *
+	@param x FP4 instance
+	@return "sign" of FP4
+ */
+extern int FP4_sign(FP4 *x);
+
+/**	@brief Negation of FP4
+ *
+	@param x FP4 instance, on exit = -y
+	@param y FP4 instance
+ */
+extern void FP4_neg(FP4 *x, FP4 *y);
+/**	@brief Conjugation of FP4
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP4 instance, on exit = conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_conj(FP4 *x, FP4 *y);
+/**	@brief Negative conjugation of FP4
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP4 instance, on exit = -conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_nconj(FP4 *x, FP4 *y);
+/**	@brief addition of two FP4s
+ *
+	@param x FP4 instance, on exit = y+z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_add(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief subtraction of two FP4s
+ *
+	@param x FP4 instance, on exit = y-z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_sub(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Multiplication of an FP4 by an FP2
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP2 multiplier
+ */
+extern void FP4_pmul(FP4 *x, FP4 *y, FP2 *a);
+
+
+/**	@brief Multiplication of an FP4 by an FP
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP multiplier
+ */
+extern void FP4_qmul(FP4 *x, FP4 *y, FP *a);
+
+/**	@brief Multiplication of an FP4 by a small integer
+ *
+	@param x FP4 instance, on exit = y*i
+	@param y FP4 instance
+	@param i an integer
+ */
+extern void FP4_imul(FP4 *x, FP4 *y, int i);
+/**	@brief Squaring an FP4
+ *
+	@param x FP4 instance, on exit = y^2
+	@param y FP4 instance
+ */
+extern void FP4_sqr(FP4 *x, FP4 *y);
+/**	@brief Multiplication of two FP4s
+ *
+	@param x FP4 instance, on exit = y*z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_mul(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Inverting an FP4
+ *
+	@param x FP4 instance, on exit = 1/y
+	@param y FP4 instance
+    @param h optional input hint
+ */
+extern void FP4_inv(FP4 *x, FP4 *y, FP *h);
+
+/**	@brief Divide an FP4 by 2
+ *
+	@param x FP4 instance, on exit = y/2
+	@param y FP4 instance
+ */
+extern void FP4_div2(FP4 *x, FP4 *y);
+
+
+/**	@brief Formats and outputs an FP4 to the console
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_output(FP4 *x);
+/**	@brief Formats and outputs an FP4 to the console in raw form (for debugging)
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_rawoutput(FP4 *x);
+/**	@brief multiplies an FP4 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP4 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP4_times_i(FP4 *x);
+/**	@brief Normalises the components of an FP4
+ *
+	@param x FP4 instance to be normalised
+ */
+extern void FP4_norm(FP4 *x);
+/**	@brief Reduces all components of possibly unreduced FP4 mod Modulus
+ *
+	@param x FP4 instance, on exit reduced mod Modulus
+ */
+extern void FP4_reduce(FP4 *x);
+/**	@brief Raises an FP4 to the power of a BIG
+ *
+	@param x FP4 instance, on exit = y^b
+	@param y FP4 instance
+	@param b BIG number
+ */
+extern void FP4_pow(FP4 *x, FP4 *y, B480_56::BIG b);
+/**	@brief Raises an FP4 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP4 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP4_frob(FP4 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP4 instance, on exit = w*x-conj(x)*y+z
+	@param w FP4 instance
+	@param x FP4 instance
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_xtr_A(FP4 *r, FP4 *w, FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP4 instance, on exit = x^2-2*conj(x)
+	@param x FP4 instance
+ */
+extern void FP4_xtr_D(FP4 *r, FP4 *x);
+/**	@brief Calculates FP4 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP4 instance, on exit = trace(w^b)
+	@param x FP4 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP4_xtr_pow(FP4 *r, FP4 *x, B480_56::BIG b);
+/**	@brief Calculates FP4 trace of c^a.d^b, where c and d are derived from FP4 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP4 instance, on exit = trace(c^a.d^b)
+	@param c FP4 instance, trace of an FP12
+	@param d FP4 instance, trace of an FP12
+	@param e FP4 instance, trace of an FP12
+	@param f FP4 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP4_xtr_pow2(FP4 *r, FP4 *c, FP4 *d, FP4 *e, FP4 *f, B480_56::BIG a, B480_56::BIG b);
+
+/**	@brief Test FP4 for QR
+ * 
+	@param r FP4 instance
+    @param h optional generated hint
+	@return 1 x is a QR, otherwise 0
+ */
+extern int  FP4_qr(FP4 *r, FP *h);
+
+/**	@brief Calculate square root of an FP4
+ *
+	Square root
+	@param r FP4 instance, on exit = sqrt(x)
+	@param x FP4 instance
+    @param h optional input hint
+ */
+extern void  FP4_sqrt(FP4 *r, FP4 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP4 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP4 instance, set to y if s!=0
+	@param y another FP4 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP4_cmove(FP4 *x, FP4 *y, int s);
+
+
+/**	@brief Divide FP4 number by QNR
+ *
+	Divide FP4 by the QNR
+	@param x FP4 instance
+ */
+extern void FP4_div_i(FP4 *x);
+
+/**	@brief Generate random FP4
+ *
+	@param x random FP4 number
+	@param rng random number generator
+ */
+extern void FP4_rand(FP4 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp4_BLS48286.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp4_BLS48286.h
new file mode 100644
index 0000000..aad06f8
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp4_BLS48286.h
@@ -0,0 +1,349 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP4_BLS48286_H
+#define FP4_BLS48286_H
+
+#include "fp2_BLS48286.h"
+#include "config_curve_BLS48286.h"
+
+using namespace core;
+
+namespace BLS48286 {
+
+/**
+	@brief FP4 Structure - towered over two FP2
+*/
+
+typedef struct
+{
+    FP2 a; /**< real part of FP4 */
+    FP2 b; /**< imaginary part of FP4 */
+} FP4;
+
+
+/* FP4 prototypes */
+/**	@brief Tests for FP4 equal to zero
+ *
+	@param x FP4 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP4_iszilch(FP4 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP4 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP4_islarger(FP4 *x);
+
+/**	@brief Serialize out FP4  
+ *
+    @param b buffer for output
+	@param x FP4 number to be serialized
+ */
+extern void FP4_toBytes(char *b,FP4 *x);
+
+/**	@brief Serialize in FP4  
+ *
+	@param x FP4 number to be serialized
+    @param b buffer for input
+ */
+extern void FP4_fromBytes(FP4 *x,char *b);
+
+/**	@brief Tests for FP4 equal to unity
+ *
+	@param x FP4 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP4_isunity(FP4 *x);
+/**	@brief Tests for equality of two FP4s
+ *
+	@param x FP4 instance to be compared
+	@param y FP4 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP4_equals(FP4 *x, FP4 *y);
+/**	@brief Tests for FP4 having only a real part and no imaginary part
+ *
+	@param x FP4 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP4_isreal(FP4 *x);
+/**	@brief Initialise FP4 from two FP2s
+ *
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+	@param b FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2s(FP4 *x, FP2 *a, FP2 *b);
+/**	@brief Initialise FP4 from single FP2
+ *
+	Imaginary part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+ */
+extern void FP4_from_FP2(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP2
+ *
+	real part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2H(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP
+ *
+	@param x FP4 instance to be initialised
+	@param a FP to form real part of FP4
+ */
+extern void FP4_from_FP(FP4 *x, FP *a);
+
+/**	@brief Copy FP4 to another FP4
+ *
+	@param x FP4 instance, on exit = y
+	@param y FP4 instance to be copied
+ */
+extern void FP4_copy(FP4 *x, FP4 *y);
+/**	@brief Set FP4 to zero
+ *
+	@param x FP4 instance to be set to zero
+ */
+extern void FP4_zero(FP4 *x);
+/**	@brief Set FP4 to unity
+ *
+	@param x FP4 instance to be set to one
+ */
+extern void FP4_one(FP4 *x);
+
+/**	@brief Sign of FP4
+ *
+	@param x FP4 instance
+	@return "sign" of FP4
+ */
+extern int FP4_sign(FP4 *x);
+
+/**	@brief Negation of FP4
+ *
+	@param x FP4 instance, on exit = -y
+	@param y FP4 instance
+ */
+extern void FP4_neg(FP4 *x, FP4 *y);
+/**	@brief Conjugation of FP4
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP4 instance, on exit = conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_conj(FP4 *x, FP4 *y);
+/**	@brief Negative conjugation of FP4
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP4 instance, on exit = -conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_nconj(FP4 *x, FP4 *y);
+/**	@brief addition of two FP4s
+ *
+	@param x FP4 instance, on exit = y+z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_add(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief subtraction of two FP4s
+ *
+	@param x FP4 instance, on exit = y-z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_sub(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Multiplication of an FP4 by an FP2
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP2 multiplier
+ */
+extern void FP4_pmul(FP4 *x, FP4 *y, FP2 *a);
+
+
+/**	@brief Multiplication of an FP4 by an FP
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP multiplier
+ */
+extern void FP4_qmul(FP4 *x, FP4 *y, FP *a);
+
+/**	@brief Multiplication of an FP4 by a small integer
+ *
+	@param x FP4 instance, on exit = y*i
+	@param y FP4 instance
+	@param i an integer
+ */
+extern void FP4_imul(FP4 *x, FP4 *y, int i);
+/**	@brief Squaring an FP4
+ *
+	@param x FP4 instance, on exit = y^2
+	@param y FP4 instance
+ */
+extern void FP4_sqr(FP4 *x, FP4 *y);
+/**	@brief Multiplication of two FP4s
+ *
+	@param x FP4 instance, on exit = y*z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_mul(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Inverting an FP4
+ *
+	@param x FP4 instance, on exit = 1/y
+	@param y FP4 instance
+    @param h optional input hint
+ */
+extern void FP4_inv(FP4 *x, FP4 *y, FP *h);
+
+/**	@brief Divide an FP4 by 2
+ *
+	@param x FP4 instance, on exit = y/2
+	@param y FP4 instance
+ */
+extern void FP4_div2(FP4 *x, FP4 *y);
+
+
+/**	@brief Formats and outputs an FP4 to the console
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_output(FP4 *x);
+/**	@brief Formats and outputs an FP4 to the console in raw form (for debugging)
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_rawoutput(FP4 *x);
+/**	@brief multiplies an FP4 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP4 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP4_times_i(FP4 *x);
+/**	@brief Normalises the components of an FP4
+ *
+	@param x FP4 instance to be normalised
+ */
+extern void FP4_norm(FP4 *x);
+/**	@brief Reduces all components of possibly unreduced FP4 mod Modulus
+ *
+	@param x FP4 instance, on exit reduced mod Modulus
+ */
+extern void FP4_reduce(FP4 *x);
+/**	@brief Raises an FP4 to the power of a BIG
+ *
+	@param x FP4 instance, on exit = y^b
+	@param y FP4 instance
+	@param b BIG number
+ */
+extern void FP4_pow(FP4 *x, FP4 *y, B288_60::BIG b);
+/**	@brief Raises an FP4 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP4 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP4_frob(FP4 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP4 instance, on exit = w*x-conj(x)*y+z
+	@param w FP4 instance
+	@param x FP4 instance
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_xtr_A(FP4 *r, FP4 *w, FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP4 instance, on exit = x^2-2*conj(x)
+	@param x FP4 instance
+ */
+extern void FP4_xtr_D(FP4 *r, FP4 *x);
+/**	@brief Calculates FP4 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP4 instance, on exit = trace(w^b)
+	@param x FP4 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP4_xtr_pow(FP4 *r, FP4 *x, B288_60::BIG b);
+/**	@brief Calculates FP4 trace of c^a.d^b, where c and d are derived from FP4 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP4 instance, on exit = trace(c^a.d^b)
+	@param c FP4 instance, trace of an FP12
+	@param d FP4 instance, trace of an FP12
+	@param e FP4 instance, trace of an FP12
+	@param f FP4 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP4_xtr_pow2(FP4 *r, FP4 *c, FP4 *d, FP4 *e, FP4 *f, B288_60::BIG a, B288_60::BIG b);
+
+/**	@brief Test FP4 for QR
+ * 
+	@param r FP4 instance
+    @param h optional generated hint
+	@return 1 x is a QR, otherwise 0
+ */
+extern int  FP4_qr(FP4 *r, FP *h);
+
+/**	@brief Calculate square root of an FP4
+ *
+	Square root
+	@param r FP4 instance, on exit = sqrt(x)
+	@param x FP4 instance
+    @param h optional input hint
+ */
+extern void  FP4_sqrt(FP4 *r, FP4 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP4 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP4 instance, set to y if s!=0
+	@param y another FP4 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP4_cmove(FP4 *x, FP4 *y, int s);
+
+
+/**	@brief Divide FP4 number by QNR
+ *
+	Divide FP4 by the QNR
+	@param x FP4 instance
+ */
+extern void FP4_div_i(FP4 *x);
+
+/**	@brief Generate random FP4
+ *
+	@param x random FP4 number
+	@param rng random number generator
+ */
+extern void FP4_rand(FP4 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp4_BLS48556.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp4_BLS48556.h
new file mode 100644
index 0000000..1f6d4f9
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp4_BLS48556.h
@@ -0,0 +1,349 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP4_BLS48556_H
+#define FP4_BLS48556_H
+
+#include "fp2_BLS48556.h"
+#include "config_curve_BLS48556.h"
+
+using namespace core;
+
+namespace BLS48556 {
+
+/**
+	@brief FP4 Structure - towered over two FP2
+*/
+
+typedef struct
+{
+    FP2 a; /**< real part of FP4 */
+    FP2 b; /**< imaginary part of FP4 */
+} FP4;
+
+
+/* FP4 prototypes */
+/**	@brief Tests for FP4 equal to zero
+ *
+	@param x FP4 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP4_iszilch(FP4 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP4 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP4_islarger(FP4 *x);
+
+/**	@brief Serialize out FP4  
+ *
+    @param b buffer for output
+	@param x FP4 number to be serialized
+ */
+extern void FP4_toBytes(char *b,FP4 *x);
+
+/**	@brief Serialize in FP4  
+ *
+	@param x FP4 number to be serialized
+    @param b buffer for input
+ */
+extern void FP4_fromBytes(FP4 *x,char *b);
+
+/**	@brief Tests for FP4 equal to unity
+ *
+	@param x FP4 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP4_isunity(FP4 *x);
+/**	@brief Tests for equality of two FP4s
+ *
+	@param x FP4 instance to be compared
+	@param y FP4 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP4_equals(FP4 *x, FP4 *y);
+/**	@brief Tests for FP4 having only a real part and no imaginary part
+ *
+	@param x FP4 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP4_isreal(FP4 *x);
+/**	@brief Initialise FP4 from two FP2s
+ *
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+	@param b FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2s(FP4 *x, FP2 *a, FP2 *b);
+/**	@brief Initialise FP4 from single FP2
+ *
+	Imaginary part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+ */
+extern void FP4_from_FP2(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP2
+ *
+	real part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2H(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP
+ *
+	@param x FP4 instance to be initialised
+	@param a FP to form real part of FP4
+ */
+extern void FP4_from_FP(FP4 *x, FP *a);
+
+/**	@brief Copy FP4 to another FP4
+ *
+	@param x FP4 instance, on exit = y
+	@param y FP4 instance to be copied
+ */
+extern void FP4_copy(FP4 *x, FP4 *y);
+/**	@brief Set FP4 to zero
+ *
+	@param x FP4 instance to be set to zero
+ */
+extern void FP4_zero(FP4 *x);
+/**	@brief Set FP4 to unity
+ *
+	@param x FP4 instance to be set to one
+ */
+extern void FP4_one(FP4 *x);
+
+/**	@brief Sign of FP4
+ *
+	@param x FP4 instance
+	@return "sign" of FP4
+ */
+extern int FP4_sign(FP4 *x);
+
+/**	@brief Negation of FP4
+ *
+	@param x FP4 instance, on exit = -y
+	@param y FP4 instance
+ */
+extern void FP4_neg(FP4 *x, FP4 *y);
+/**	@brief Conjugation of FP4
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP4 instance, on exit = conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_conj(FP4 *x, FP4 *y);
+/**	@brief Negative conjugation of FP4
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP4 instance, on exit = -conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_nconj(FP4 *x, FP4 *y);
+/**	@brief addition of two FP4s
+ *
+	@param x FP4 instance, on exit = y+z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_add(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief subtraction of two FP4s
+ *
+	@param x FP4 instance, on exit = y-z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_sub(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Multiplication of an FP4 by an FP2
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP2 multiplier
+ */
+extern void FP4_pmul(FP4 *x, FP4 *y, FP2 *a);
+
+
+/**	@brief Multiplication of an FP4 by an FP
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP multiplier
+ */
+extern void FP4_qmul(FP4 *x, FP4 *y, FP *a);
+
+/**	@brief Multiplication of an FP4 by a small integer
+ *
+	@param x FP4 instance, on exit = y*i
+	@param y FP4 instance
+	@param i an integer
+ */
+extern void FP4_imul(FP4 *x, FP4 *y, int i);
+/**	@brief Squaring an FP4
+ *
+	@param x FP4 instance, on exit = y^2
+	@param y FP4 instance
+ */
+extern void FP4_sqr(FP4 *x, FP4 *y);
+/**	@brief Multiplication of two FP4s
+ *
+	@param x FP4 instance, on exit = y*z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_mul(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Inverting an FP4
+ *
+	@param x FP4 instance, on exit = 1/y
+	@param y FP4 instance
+    @param h optional input hint
+ */
+extern void FP4_inv(FP4 *x, FP4 *y, FP *h);
+
+/**	@brief Divide an FP4 by 2
+ *
+	@param x FP4 instance, on exit = y/2
+	@param y FP4 instance
+ */
+extern void FP4_div2(FP4 *x, FP4 *y);
+
+
+/**	@brief Formats and outputs an FP4 to the console
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_output(FP4 *x);
+/**	@brief Formats and outputs an FP4 to the console in raw form (for debugging)
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_rawoutput(FP4 *x);
+/**	@brief multiplies an FP4 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP4 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP4_times_i(FP4 *x);
+/**	@brief Normalises the components of an FP4
+ *
+	@param x FP4 instance to be normalised
+ */
+extern void FP4_norm(FP4 *x);
+/**	@brief Reduces all components of possibly unreduced FP4 mod Modulus
+ *
+	@param x FP4 instance, on exit reduced mod Modulus
+ */
+extern void FP4_reduce(FP4 *x);
+/**	@brief Raises an FP4 to the power of a BIG
+ *
+	@param x FP4 instance, on exit = y^b
+	@param y FP4 instance
+	@param b BIG number
+ */
+extern void FP4_pow(FP4 *x, FP4 *y, B560_58::BIG b);
+/**	@brief Raises an FP4 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP4 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP4_frob(FP4 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP4 instance, on exit = w*x-conj(x)*y+z
+	@param w FP4 instance
+	@param x FP4 instance
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_xtr_A(FP4 *r, FP4 *w, FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP4 instance, on exit = x^2-2*conj(x)
+	@param x FP4 instance
+ */
+extern void FP4_xtr_D(FP4 *r, FP4 *x);
+/**	@brief Calculates FP4 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP4 instance, on exit = trace(w^b)
+	@param x FP4 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP4_xtr_pow(FP4 *r, FP4 *x, B560_58::BIG b);
+/**	@brief Calculates FP4 trace of c^a.d^b, where c and d are derived from FP4 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP4 instance, on exit = trace(c^a.d^b)
+	@param c FP4 instance, trace of an FP12
+	@param d FP4 instance, trace of an FP12
+	@param e FP4 instance, trace of an FP12
+	@param f FP4 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP4_xtr_pow2(FP4 *r, FP4 *c, FP4 *d, FP4 *e, FP4 *f, B560_58::BIG a, B560_58::BIG b);
+
+/**	@brief Test FP4 for QR
+ * 
+	@param r FP4 instance
+    @param h optional generated hint
+	@return 1 x is a QR, otherwise 0
+ */
+extern int  FP4_qr(FP4 *r, FP *h);
+
+/**	@brief Calculate square root of an FP4
+ *
+	Square root
+	@param r FP4 instance, on exit = sqrt(x)
+	@param x FP4 instance
+    @param h optional input hint
+ */
+extern void  FP4_sqrt(FP4 *r, FP4 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP4 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP4 instance, set to y if s!=0
+	@param y another FP4 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP4_cmove(FP4 *x, FP4 *y, int s);
+
+
+/**	@brief Divide FP4 number by QNR
+ *
+	Divide FP4 by the QNR
+	@param x FP4 instance
+ */
+extern void FP4_div_i(FP4 *x);
+
+/**	@brief Generate random FP4
+ *
+	@param x random FP4 number
+	@param rng random number generator
+ */
+extern void FP4_rand(FP4 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp4_BLS48581.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp4_BLS48581.h
new file mode 100644
index 0000000..181ffb4
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp4_BLS48581.h
@@ -0,0 +1,349 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP4_BLS48581_H
+#define FP4_BLS48581_H
+
+#include "fp2_BLS48581.h"
+#include "config_curve_BLS48581.h"
+
+using namespace core;
+
+namespace BLS48581 {
+
+/**
+	@brief FP4 Structure - towered over two FP2
+*/
+
+typedef struct
+{
+    FP2 a; /**< real part of FP4 */
+    FP2 b; /**< imaginary part of FP4 */
+} FP4;
+
+
+/* FP4 prototypes */
+/**	@brief Tests for FP4 equal to zero
+ *
+	@param x FP4 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP4_iszilch(FP4 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP4 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP4_islarger(FP4 *x);
+
+/**	@brief Serialize out FP4  
+ *
+    @param b buffer for output
+	@param x FP4 number to be serialized
+ */
+extern void FP4_toBytes(char *b,FP4 *x);
+
+/**	@brief Serialize in FP4  
+ *
+	@param x FP4 number to be serialized
+    @param b buffer for input
+ */
+extern void FP4_fromBytes(FP4 *x,char *b);
+
+/**	@brief Tests for FP4 equal to unity
+ *
+	@param x FP4 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP4_isunity(FP4 *x);
+/**	@brief Tests for equality of two FP4s
+ *
+	@param x FP4 instance to be compared
+	@param y FP4 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP4_equals(FP4 *x, FP4 *y);
+/**	@brief Tests for FP4 having only a real part and no imaginary part
+ *
+	@param x FP4 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP4_isreal(FP4 *x);
+/**	@brief Initialise FP4 from two FP2s
+ *
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+	@param b FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2s(FP4 *x, FP2 *a, FP2 *b);
+/**	@brief Initialise FP4 from single FP2
+ *
+	Imaginary part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+ */
+extern void FP4_from_FP2(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP2
+ *
+	real part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2H(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP
+ *
+	@param x FP4 instance to be initialised
+	@param a FP to form real part of FP4
+ */
+extern void FP4_from_FP(FP4 *x, FP *a);
+
+/**	@brief Copy FP4 to another FP4
+ *
+	@param x FP4 instance, on exit = y
+	@param y FP4 instance to be copied
+ */
+extern void FP4_copy(FP4 *x, FP4 *y);
+/**	@brief Set FP4 to zero
+ *
+	@param x FP4 instance to be set to zero
+ */
+extern void FP4_zero(FP4 *x);
+/**	@brief Set FP4 to unity
+ *
+	@param x FP4 instance to be set to one
+ */
+extern void FP4_one(FP4 *x);
+
+/**	@brief Sign of FP4
+ *
+	@param x FP4 instance
+	@return "sign" of FP4
+ */
+extern int FP4_sign(FP4 *x);
+
+/**	@brief Negation of FP4
+ *
+	@param x FP4 instance, on exit = -y
+	@param y FP4 instance
+ */
+extern void FP4_neg(FP4 *x, FP4 *y);
+/**	@brief Conjugation of FP4
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP4 instance, on exit = conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_conj(FP4 *x, FP4 *y);
+/**	@brief Negative conjugation of FP4
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP4 instance, on exit = -conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_nconj(FP4 *x, FP4 *y);
+/**	@brief addition of two FP4s
+ *
+	@param x FP4 instance, on exit = y+z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_add(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief subtraction of two FP4s
+ *
+	@param x FP4 instance, on exit = y-z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_sub(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Multiplication of an FP4 by an FP2
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP2 multiplier
+ */
+extern void FP4_pmul(FP4 *x, FP4 *y, FP2 *a);
+
+
+/**	@brief Multiplication of an FP4 by an FP
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP multiplier
+ */
+extern void FP4_qmul(FP4 *x, FP4 *y, FP *a);
+
+/**	@brief Multiplication of an FP4 by a small integer
+ *
+	@param x FP4 instance, on exit = y*i
+	@param y FP4 instance
+	@param i an integer
+ */
+extern void FP4_imul(FP4 *x, FP4 *y, int i);
+/**	@brief Squaring an FP4
+ *
+	@param x FP4 instance, on exit = y^2
+	@param y FP4 instance
+ */
+extern void FP4_sqr(FP4 *x, FP4 *y);
+/**	@brief Multiplication of two FP4s
+ *
+	@param x FP4 instance, on exit = y*z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_mul(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Inverting an FP4
+ *
+	@param x FP4 instance, on exit = 1/y
+	@param y FP4 instance
+    @param h optional input hint
+ */
+extern void FP4_inv(FP4 *x, FP4 *y, FP *h);
+
+/**	@brief Divide an FP4 by 2
+ *
+	@param x FP4 instance, on exit = y/2
+	@param y FP4 instance
+ */
+extern void FP4_div2(FP4 *x, FP4 *y);
+
+
+/**	@brief Formats and outputs an FP4 to the console
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_output(FP4 *x);
+/**	@brief Formats and outputs an FP4 to the console in raw form (for debugging)
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_rawoutput(FP4 *x);
+/**	@brief multiplies an FP4 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP4 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP4_times_i(FP4 *x);
+/**	@brief Normalises the components of an FP4
+ *
+	@param x FP4 instance to be normalised
+ */
+extern void FP4_norm(FP4 *x);
+/**	@brief Reduces all components of possibly unreduced FP4 mod Modulus
+ *
+	@param x FP4 instance, on exit reduced mod Modulus
+ */
+extern void FP4_reduce(FP4 *x);
+/**	@brief Raises an FP4 to the power of a BIG
+ *
+	@param x FP4 instance, on exit = y^b
+	@param y FP4 instance
+	@param b BIG number
+ */
+extern void FP4_pow(FP4 *x, FP4 *y, B584_60::BIG b);
+/**	@brief Raises an FP4 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP4 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP4_frob(FP4 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP4 instance, on exit = w*x-conj(x)*y+z
+	@param w FP4 instance
+	@param x FP4 instance
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_xtr_A(FP4 *r, FP4 *w, FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP4 instance, on exit = x^2-2*conj(x)
+	@param x FP4 instance
+ */
+extern void FP4_xtr_D(FP4 *r, FP4 *x);
+/**	@brief Calculates FP4 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP4 instance, on exit = trace(w^b)
+	@param x FP4 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP4_xtr_pow(FP4 *r, FP4 *x, B584_60::BIG b);
+/**	@brief Calculates FP4 trace of c^a.d^b, where c and d are derived from FP4 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP4 instance, on exit = trace(c^a.d^b)
+	@param c FP4 instance, trace of an FP12
+	@param d FP4 instance, trace of an FP12
+	@param e FP4 instance, trace of an FP12
+	@param f FP4 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP4_xtr_pow2(FP4 *r, FP4 *c, FP4 *d, FP4 *e, FP4 *f, B584_60::BIG a, B584_60::BIG b);
+
+/**	@brief Test FP4 for QR
+ * 
+	@param r FP4 instance
+    @param h optional generated hint
+	@return 1 x is a QR, otherwise 0
+ */
+extern int  FP4_qr(FP4 *r, FP *h);
+
+/**	@brief Calculate square root of an FP4
+ *
+	Square root
+	@param r FP4 instance, on exit = sqrt(x)
+	@param x FP4 instance
+    @param h optional input hint
+ */
+extern void  FP4_sqrt(FP4 *r, FP4 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP4 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP4 instance, set to y if s!=0
+	@param y another FP4 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP4_cmove(FP4 *x, FP4 *y, int s);
+
+
+/**	@brief Divide FP4 number by QNR
+ *
+	Divide FP4 by the QNR
+	@param x FP4 instance
+ */
+extern void FP4_div_i(FP4 *x);
+
+/**	@brief Generate random FP4
+ *
+	@param x random FP4 number
+	@param rng random number generator
+ */
+extern void FP4_rand(FP4 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp4_BN158.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp4_BN158.h
new file mode 100644
index 0000000..a60edb5
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp4_BN158.h
@@ -0,0 +1,349 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP4_BN158_H
+#define FP4_BN158_H
+
+#include "fp2_BN158.h"
+#include "config_curve_BN158.h"
+
+using namespace core;
+
+namespace BN158 {
+
+/**
+	@brief FP4 Structure - towered over two FP2
+*/
+
+typedef struct
+{
+    FP2 a; /**< real part of FP4 */
+    FP2 b; /**< imaginary part of FP4 */
+} FP4;
+
+
+/* FP4 prototypes */
+/**	@brief Tests for FP4 equal to zero
+ *
+	@param x FP4 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP4_iszilch(FP4 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP4 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP4_islarger(FP4 *x);
+
+/**	@brief Serialize out FP4  
+ *
+    @param b buffer for output
+	@param x FP4 number to be serialized
+ */
+extern void FP4_toBytes(char *b,FP4 *x);
+
+/**	@brief Serialize in FP4  
+ *
+	@param x FP4 number to be serialized
+    @param b buffer for input
+ */
+extern void FP4_fromBytes(FP4 *x,char *b);
+
+/**	@brief Tests for FP4 equal to unity
+ *
+	@param x FP4 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP4_isunity(FP4 *x);
+/**	@brief Tests for equality of two FP4s
+ *
+	@param x FP4 instance to be compared
+	@param y FP4 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP4_equals(FP4 *x, FP4 *y);
+/**	@brief Tests for FP4 having only a real part and no imaginary part
+ *
+	@param x FP4 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP4_isreal(FP4 *x);
+/**	@brief Initialise FP4 from two FP2s
+ *
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+	@param b FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2s(FP4 *x, FP2 *a, FP2 *b);
+/**	@brief Initialise FP4 from single FP2
+ *
+	Imaginary part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+ */
+extern void FP4_from_FP2(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP2
+ *
+	real part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2H(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP
+ *
+	@param x FP4 instance to be initialised
+	@param a FP to form real part of FP4
+ */
+extern void FP4_from_FP(FP4 *x, FP *a);
+
+/**	@brief Copy FP4 to another FP4
+ *
+	@param x FP4 instance, on exit = y
+	@param y FP4 instance to be copied
+ */
+extern void FP4_copy(FP4 *x, FP4 *y);
+/**	@brief Set FP4 to zero
+ *
+	@param x FP4 instance to be set to zero
+ */
+extern void FP4_zero(FP4 *x);
+/**	@brief Set FP4 to unity
+ *
+	@param x FP4 instance to be set to one
+ */
+extern void FP4_one(FP4 *x);
+
+/**	@brief Sign of FP4
+ *
+	@param x FP4 instance
+	@return "sign" of FP4
+ */
+extern int FP4_sign(FP4 *x);
+
+/**	@brief Negation of FP4
+ *
+	@param x FP4 instance, on exit = -y
+	@param y FP4 instance
+ */
+extern void FP4_neg(FP4 *x, FP4 *y);
+/**	@brief Conjugation of FP4
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP4 instance, on exit = conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_conj(FP4 *x, FP4 *y);
+/**	@brief Negative conjugation of FP4
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP4 instance, on exit = -conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_nconj(FP4 *x, FP4 *y);
+/**	@brief addition of two FP4s
+ *
+	@param x FP4 instance, on exit = y+z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_add(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief subtraction of two FP4s
+ *
+	@param x FP4 instance, on exit = y-z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_sub(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Multiplication of an FP4 by an FP2
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP2 multiplier
+ */
+extern void FP4_pmul(FP4 *x, FP4 *y, FP2 *a);
+
+
+/**	@brief Multiplication of an FP4 by an FP
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP multiplier
+ */
+extern void FP4_qmul(FP4 *x, FP4 *y, FP *a);
+
+/**	@brief Multiplication of an FP4 by a small integer
+ *
+	@param x FP4 instance, on exit = y*i
+	@param y FP4 instance
+	@param i an integer
+ */
+extern void FP4_imul(FP4 *x, FP4 *y, int i);
+/**	@brief Squaring an FP4
+ *
+	@param x FP4 instance, on exit = y^2
+	@param y FP4 instance
+ */
+extern void FP4_sqr(FP4 *x, FP4 *y);
+/**	@brief Multiplication of two FP4s
+ *
+	@param x FP4 instance, on exit = y*z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_mul(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Inverting an FP4
+ *
+	@param x FP4 instance, on exit = 1/y
+	@param y FP4 instance
+    @param h optional input hint
+ */
+extern void FP4_inv(FP4 *x, FP4 *y, FP *h);
+
+/**	@brief Divide an FP4 by 2
+ *
+	@param x FP4 instance, on exit = y/2
+	@param y FP4 instance
+ */
+extern void FP4_div2(FP4 *x, FP4 *y);
+
+
+/**	@brief Formats and outputs an FP4 to the console
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_output(FP4 *x);
+/**	@brief Formats and outputs an FP4 to the console in raw form (for debugging)
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_rawoutput(FP4 *x);
+/**	@brief multiplies an FP4 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP4 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP4_times_i(FP4 *x);
+/**	@brief Normalises the components of an FP4
+ *
+	@param x FP4 instance to be normalised
+ */
+extern void FP4_norm(FP4 *x);
+/**	@brief Reduces all components of possibly unreduced FP4 mod Modulus
+ *
+	@param x FP4 instance, on exit reduced mod Modulus
+ */
+extern void FP4_reduce(FP4 *x);
+/**	@brief Raises an FP4 to the power of a BIG
+ *
+	@param x FP4 instance, on exit = y^b
+	@param y FP4 instance
+	@param b BIG number
+ */
+extern void FP4_pow(FP4 *x, FP4 *y, B160_56::BIG b);
+/**	@brief Raises an FP4 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP4 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP4_frob(FP4 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP4 instance, on exit = w*x-conj(x)*y+z
+	@param w FP4 instance
+	@param x FP4 instance
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_xtr_A(FP4 *r, FP4 *w, FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP4 instance, on exit = x^2-2*conj(x)
+	@param x FP4 instance
+ */
+extern void FP4_xtr_D(FP4 *r, FP4 *x);
+/**	@brief Calculates FP4 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP4 instance, on exit = trace(w^b)
+	@param x FP4 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP4_xtr_pow(FP4 *r, FP4 *x, B160_56::BIG b);
+/**	@brief Calculates FP4 trace of c^a.d^b, where c and d are derived from FP4 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP4 instance, on exit = trace(c^a.d^b)
+	@param c FP4 instance, trace of an FP12
+	@param d FP4 instance, trace of an FP12
+	@param e FP4 instance, trace of an FP12
+	@param f FP4 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP4_xtr_pow2(FP4 *r, FP4 *c, FP4 *d, FP4 *e, FP4 *f, B160_56::BIG a, B160_56::BIG b);
+
+/**	@brief Test FP4 for QR
+ * 
+	@param r FP4 instance
+    @param h optional generated hint
+	@return 1 x is a QR, otherwise 0
+ */
+extern int  FP4_qr(FP4 *r, FP *h);
+
+/**	@brief Calculate square root of an FP4
+ *
+	Square root
+	@param r FP4 instance, on exit = sqrt(x)
+	@param x FP4 instance
+    @param h optional input hint
+ */
+extern void  FP4_sqrt(FP4 *r, FP4 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP4 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP4 instance, set to y if s!=0
+	@param y another FP4 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP4_cmove(FP4 *x, FP4 *y, int s);
+
+
+/**	@brief Divide FP4 number by QNR
+ *
+	Divide FP4 by the QNR
+	@param x FP4 instance
+ */
+extern void FP4_div_i(FP4 *x);
+
+/**	@brief Generate random FP4
+ *
+	@param x random FP4 number
+	@param rng random number generator
+ */
+extern void FP4_rand(FP4 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp4_BN254.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp4_BN254.h
new file mode 100644
index 0000000..f5ef40b
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp4_BN254.h
@@ -0,0 +1,349 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP4_BN254_H
+#define FP4_BN254_H
+
+#include "fp2_BN254.h"
+#include "config_curve_BN254.h"
+
+using namespace core;
+
+namespace BN254 {
+
+/**
+	@brief FP4 Structure - towered over two FP2
+*/
+
+typedef struct
+{
+    FP2 a; /**< real part of FP4 */
+    FP2 b; /**< imaginary part of FP4 */
+} FP4;
+
+
+/* FP4 prototypes */
+/**	@brief Tests for FP4 equal to zero
+ *
+	@param x FP4 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP4_iszilch(FP4 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP4 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP4_islarger(FP4 *x);
+
+/**	@brief Serialize out FP4  
+ *
+    @param b buffer for output
+	@param x FP4 number to be serialized
+ */
+extern void FP4_toBytes(char *b,FP4 *x);
+
+/**	@brief Serialize in FP4  
+ *
+	@param x FP4 number to be serialized
+    @param b buffer for input
+ */
+extern void FP4_fromBytes(FP4 *x,char *b);
+
+/**	@brief Tests for FP4 equal to unity
+ *
+	@param x FP4 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP4_isunity(FP4 *x);
+/**	@brief Tests for equality of two FP4s
+ *
+	@param x FP4 instance to be compared
+	@param y FP4 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP4_equals(FP4 *x, FP4 *y);
+/**	@brief Tests for FP4 having only a real part and no imaginary part
+ *
+	@param x FP4 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP4_isreal(FP4 *x);
+/**	@brief Initialise FP4 from two FP2s
+ *
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+	@param b FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2s(FP4 *x, FP2 *a, FP2 *b);
+/**	@brief Initialise FP4 from single FP2
+ *
+	Imaginary part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+ */
+extern void FP4_from_FP2(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP2
+ *
+	real part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2H(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP
+ *
+	@param x FP4 instance to be initialised
+	@param a FP to form real part of FP4
+ */
+extern void FP4_from_FP(FP4 *x, FP *a);
+
+/**	@brief Copy FP4 to another FP4
+ *
+	@param x FP4 instance, on exit = y
+	@param y FP4 instance to be copied
+ */
+extern void FP4_copy(FP4 *x, FP4 *y);
+/**	@brief Set FP4 to zero
+ *
+	@param x FP4 instance to be set to zero
+ */
+extern void FP4_zero(FP4 *x);
+/**	@brief Set FP4 to unity
+ *
+	@param x FP4 instance to be set to one
+ */
+extern void FP4_one(FP4 *x);
+
+/**	@brief Sign of FP4
+ *
+	@param x FP4 instance
+	@return "sign" of FP4
+ */
+extern int FP4_sign(FP4 *x);
+
+/**	@brief Negation of FP4
+ *
+	@param x FP4 instance, on exit = -y
+	@param y FP4 instance
+ */
+extern void FP4_neg(FP4 *x, FP4 *y);
+/**	@brief Conjugation of FP4
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP4 instance, on exit = conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_conj(FP4 *x, FP4 *y);
+/**	@brief Negative conjugation of FP4
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP4 instance, on exit = -conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_nconj(FP4 *x, FP4 *y);
+/**	@brief addition of two FP4s
+ *
+	@param x FP4 instance, on exit = y+z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_add(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief subtraction of two FP4s
+ *
+	@param x FP4 instance, on exit = y-z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_sub(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Multiplication of an FP4 by an FP2
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP2 multiplier
+ */
+extern void FP4_pmul(FP4 *x, FP4 *y, FP2 *a);
+
+
+/**	@brief Multiplication of an FP4 by an FP
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP multiplier
+ */
+extern void FP4_qmul(FP4 *x, FP4 *y, FP *a);
+
+/**	@brief Multiplication of an FP4 by a small integer
+ *
+	@param x FP4 instance, on exit = y*i
+	@param y FP4 instance
+	@param i an integer
+ */
+extern void FP4_imul(FP4 *x, FP4 *y, int i);
+/**	@brief Squaring an FP4
+ *
+	@param x FP4 instance, on exit = y^2
+	@param y FP4 instance
+ */
+extern void FP4_sqr(FP4 *x, FP4 *y);
+/**	@brief Multiplication of two FP4s
+ *
+	@param x FP4 instance, on exit = y*z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_mul(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Inverting an FP4
+ *
+	@param x FP4 instance, on exit = 1/y
+	@param y FP4 instance
+    @param h optional input hint
+ */
+extern void FP4_inv(FP4 *x, FP4 *y, FP *h);
+
+/**	@brief Divide an FP4 by 2
+ *
+	@param x FP4 instance, on exit = y/2
+	@param y FP4 instance
+ */
+extern void FP4_div2(FP4 *x, FP4 *y);
+
+
+/**	@brief Formats and outputs an FP4 to the console
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_output(FP4 *x);
+/**	@brief Formats and outputs an FP4 to the console in raw form (for debugging)
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_rawoutput(FP4 *x);
+/**	@brief multiplies an FP4 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP4 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP4_times_i(FP4 *x);
+/**	@brief Normalises the components of an FP4
+ *
+	@param x FP4 instance to be normalised
+ */
+extern void FP4_norm(FP4 *x);
+/**	@brief Reduces all components of possibly unreduced FP4 mod Modulus
+ *
+	@param x FP4 instance, on exit reduced mod Modulus
+ */
+extern void FP4_reduce(FP4 *x);
+/**	@brief Raises an FP4 to the power of a BIG
+ *
+	@param x FP4 instance, on exit = y^b
+	@param y FP4 instance
+	@param b BIG number
+ */
+extern void FP4_pow(FP4 *x, FP4 *y, B256_56::BIG b);
+/**	@brief Raises an FP4 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP4 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP4_frob(FP4 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP4 instance, on exit = w*x-conj(x)*y+z
+	@param w FP4 instance
+	@param x FP4 instance
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_xtr_A(FP4 *r, FP4 *w, FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP4 instance, on exit = x^2-2*conj(x)
+	@param x FP4 instance
+ */
+extern void FP4_xtr_D(FP4 *r, FP4 *x);
+/**	@brief Calculates FP4 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP4 instance, on exit = trace(w^b)
+	@param x FP4 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP4_xtr_pow(FP4 *r, FP4 *x, B256_56::BIG b);
+/**	@brief Calculates FP4 trace of c^a.d^b, where c and d are derived from FP4 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP4 instance, on exit = trace(c^a.d^b)
+	@param c FP4 instance, trace of an FP12
+	@param d FP4 instance, trace of an FP12
+	@param e FP4 instance, trace of an FP12
+	@param f FP4 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP4_xtr_pow2(FP4 *r, FP4 *c, FP4 *d, FP4 *e, FP4 *f, B256_56::BIG a, B256_56::BIG b);
+
+/**	@brief Test FP4 for QR
+ * 
+	@param r FP4 instance
+    @param h optional generated hint
+	@return 1 x is a QR, otherwise 0
+ */
+extern int  FP4_qr(FP4 *r, FP *h);
+
+/**	@brief Calculate square root of an FP4
+ *
+	Square root
+	@param r FP4 instance, on exit = sqrt(x)
+	@param x FP4 instance
+    @param h optional input hint
+ */
+extern void  FP4_sqrt(FP4 *r, FP4 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP4 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP4 instance, set to y if s!=0
+	@param y another FP4 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP4_cmove(FP4 *x, FP4 *y, int s);
+
+
+/**	@brief Divide FP4 number by QNR
+ *
+	Divide FP4 by the QNR
+	@param x FP4 instance
+ */
+extern void FP4_div_i(FP4 *x);
+
+/**	@brief Generate random FP4
+ *
+	@param x random FP4 number
+	@param rng random number generator
+ */
+extern void FP4_rand(FP4 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp4_BN254CX.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp4_BN254CX.h
new file mode 100644
index 0000000..f3b36de
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp4_BN254CX.h
@@ -0,0 +1,349 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP4_BN254CX_H
+#define FP4_BN254CX_H
+
+#include "fp2_BN254CX.h"
+#include "config_curve_BN254CX.h"
+
+using namespace core;
+
+namespace BN254CX {
+
+/**
+	@brief FP4 Structure - towered over two FP2
+*/
+
+typedef struct
+{
+    FP2 a; /**< real part of FP4 */
+    FP2 b; /**< imaginary part of FP4 */
+} FP4;
+
+
+/* FP4 prototypes */
+/**	@brief Tests for FP4 equal to zero
+ *
+	@param x FP4 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP4_iszilch(FP4 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP4 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP4_islarger(FP4 *x);
+
+/**	@brief Serialize out FP4  
+ *
+    @param b buffer for output
+	@param x FP4 number to be serialized
+ */
+extern void FP4_toBytes(char *b,FP4 *x);
+
+/**	@brief Serialize in FP4  
+ *
+	@param x FP4 number to be serialized
+    @param b buffer for input
+ */
+extern void FP4_fromBytes(FP4 *x,char *b);
+
+/**	@brief Tests for FP4 equal to unity
+ *
+	@param x FP4 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP4_isunity(FP4 *x);
+/**	@brief Tests for equality of two FP4s
+ *
+	@param x FP4 instance to be compared
+	@param y FP4 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP4_equals(FP4 *x, FP4 *y);
+/**	@brief Tests for FP4 having only a real part and no imaginary part
+ *
+	@param x FP4 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP4_isreal(FP4 *x);
+/**	@brief Initialise FP4 from two FP2s
+ *
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+	@param b FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2s(FP4 *x, FP2 *a, FP2 *b);
+/**	@brief Initialise FP4 from single FP2
+ *
+	Imaginary part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+ */
+extern void FP4_from_FP2(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP2
+ *
+	real part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2H(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP
+ *
+	@param x FP4 instance to be initialised
+	@param a FP to form real part of FP4
+ */
+extern void FP4_from_FP(FP4 *x, FP *a);
+
+/**	@brief Copy FP4 to another FP4
+ *
+	@param x FP4 instance, on exit = y
+	@param y FP4 instance to be copied
+ */
+extern void FP4_copy(FP4 *x, FP4 *y);
+/**	@brief Set FP4 to zero
+ *
+	@param x FP4 instance to be set to zero
+ */
+extern void FP4_zero(FP4 *x);
+/**	@brief Set FP4 to unity
+ *
+	@param x FP4 instance to be set to one
+ */
+extern void FP4_one(FP4 *x);
+
+/**	@brief Sign of FP4
+ *
+	@param x FP4 instance
+	@return "sign" of FP4
+ */
+extern int FP4_sign(FP4 *x);
+
+/**	@brief Negation of FP4
+ *
+	@param x FP4 instance, on exit = -y
+	@param y FP4 instance
+ */
+extern void FP4_neg(FP4 *x, FP4 *y);
+/**	@brief Conjugation of FP4
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP4 instance, on exit = conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_conj(FP4 *x, FP4 *y);
+/**	@brief Negative conjugation of FP4
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP4 instance, on exit = -conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_nconj(FP4 *x, FP4 *y);
+/**	@brief addition of two FP4s
+ *
+	@param x FP4 instance, on exit = y+z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_add(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief subtraction of two FP4s
+ *
+	@param x FP4 instance, on exit = y-z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_sub(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Multiplication of an FP4 by an FP2
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP2 multiplier
+ */
+extern void FP4_pmul(FP4 *x, FP4 *y, FP2 *a);
+
+
+/**	@brief Multiplication of an FP4 by an FP
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP multiplier
+ */
+extern void FP4_qmul(FP4 *x, FP4 *y, FP *a);
+
+/**	@brief Multiplication of an FP4 by a small integer
+ *
+	@param x FP4 instance, on exit = y*i
+	@param y FP4 instance
+	@param i an integer
+ */
+extern void FP4_imul(FP4 *x, FP4 *y, int i);
+/**	@brief Squaring an FP4
+ *
+	@param x FP4 instance, on exit = y^2
+	@param y FP4 instance
+ */
+extern void FP4_sqr(FP4 *x, FP4 *y);
+/**	@brief Multiplication of two FP4s
+ *
+	@param x FP4 instance, on exit = y*z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_mul(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Inverting an FP4
+ *
+	@param x FP4 instance, on exit = 1/y
+	@param y FP4 instance
+    @param h optional input hint
+ */
+extern void FP4_inv(FP4 *x, FP4 *y, FP *h);
+
+/**	@brief Divide an FP4 by 2
+ *
+	@param x FP4 instance, on exit = y/2
+	@param y FP4 instance
+ */
+extern void FP4_div2(FP4 *x, FP4 *y);
+
+
+/**	@brief Formats and outputs an FP4 to the console
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_output(FP4 *x);
+/**	@brief Formats and outputs an FP4 to the console in raw form (for debugging)
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_rawoutput(FP4 *x);
+/**	@brief multiplies an FP4 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP4 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP4_times_i(FP4 *x);
+/**	@brief Normalises the components of an FP4
+ *
+	@param x FP4 instance to be normalised
+ */
+extern void FP4_norm(FP4 *x);
+/**	@brief Reduces all components of possibly unreduced FP4 mod Modulus
+ *
+	@param x FP4 instance, on exit reduced mod Modulus
+ */
+extern void FP4_reduce(FP4 *x);
+/**	@brief Raises an FP4 to the power of a BIG
+ *
+	@param x FP4 instance, on exit = y^b
+	@param y FP4 instance
+	@param b BIG number
+ */
+extern void FP4_pow(FP4 *x, FP4 *y, B256_56::BIG b);
+/**	@brief Raises an FP4 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP4 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP4_frob(FP4 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP4 instance, on exit = w*x-conj(x)*y+z
+	@param w FP4 instance
+	@param x FP4 instance
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_xtr_A(FP4 *r, FP4 *w, FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP4 instance, on exit = x^2-2*conj(x)
+	@param x FP4 instance
+ */
+extern void FP4_xtr_D(FP4 *r, FP4 *x);
+/**	@brief Calculates FP4 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP4 instance, on exit = trace(w^b)
+	@param x FP4 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP4_xtr_pow(FP4 *r, FP4 *x, B256_56::BIG b);
+/**	@brief Calculates FP4 trace of c^a.d^b, where c and d are derived from FP4 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP4 instance, on exit = trace(c^a.d^b)
+	@param c FP4 instance, trace of an FP12
+	@param d FP4 instance, trace of an FP12
+	@param e FP4 instance, trace of an FP12
+	@param f FP4 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP4_xtr_pow2(FP4 *r, FP4 *c, FP4 *d, FP4 *e, FP4 *f, B256_56::BIG a, B256_56::BIG b);
+
+/**	@brief Test FP4 for QR
+ * 
+	@param r FP4 instance
+    @param h optional generated hint
+	@return 1 x is a QR, otherwise 0
+ */
+extern int  FP4_qr(FP4 *r, FP *h);
+
+/**	@brief Calculate square root of an FP4
+ *
+	Square root
+	@param r FP4 instance, on exit = sqrt(x)
+	@param x FP4 instance
+    @param h optional input hint
+ */
+extern void  FP4_sqrt(FP4 *r, FP4 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP4 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP4 instance, set to y if s!=0
+	@param y another FP4 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP4_cmove(FP4 *x, FP4 *y, int s);
+
+
+/**	@brief Divide FP4 number by QNR
+ *
+	Divide FP4 by the QNR
+	@param x FP4 instance
+ */
+extern void FP4_div_i(FP4 *x);
+
+/**	@brief Generate random FP4
+ *
+	@param x random FP4 number
+	@param rng random number generator
+ */
+extern void FP4_rand(FP4 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp4_BN462.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp4_BN462.h
new file mode 100644
index 0000000..4d81f9f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp4_BN462.h
@@ -0,0 +1,349 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP4_BN462_H
+#define FP4_BN462_H
+
+#include "fp2_BN462.h"
+#include "config_curve_BN462.h"
+
+using namespace core;
+
+namespace BN462 {
+
+/**
+	@brief FP4 Structure - towered over two FP2
+*/
+
+typedef struct
+{
+    FP2 a; /**< real part of FP4 */
+    FP2 b; /**< imaginary part of FP4 */
+} FP4;
+
+
+/* FP4 prototypes */
+/**	@brief Tests for FP4 equal to zero
+ *
+	@param x FP4 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP4_iszilch(FP4 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP4 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP4_islarger(FP4 *x);
+
+/**	@brief Serialize out FP4  
+ *
+    @param b buffer for output
+	@param x FP4 number to be serialized
+ */
+extern void FP4_toBytes(char *b,FP4 *x);
+
+/**	@brief Serialize in FP4  
+ *
+	@param x FP4 number to be serialized
+    @param b buffer for input
+ */
+extern void FP4_fromBytes(FP4 *x,char *b);
+
+/**	@brief Tests for FP4 equal to unity
+ *
+	@param x FP4 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP4_isunity(FP4 *x);
+/**	@brief Tests for equality of two FP4s
+ *
+	@param x FP4 instance to be compared
+	@param y FP4 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP4_equals(FP4 *x, FP4 *y);
+/**	@brief Tests for FP4 having only a real part and no imaginary part
+ *
+	@param x FP4 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP4_isreal(FP4 *x);
+/**	@brief Initialise FP4 from two FP2s
+ *
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+	@param b FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2s(FP4 *x, FP2 *a, FP2 *b);
+/**	@brief Initialise FP4 from single FP2
+ *
+	Imaginary part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+ */
+extern void FP4_from_FP2(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP2
+ *
+	real part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2H(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP
+ *
+	@param x FP4 instance to be initialised
+	@param a FP to form real part of FP4
+ */
+extern void FP4_from_FP(FP4 *x, FP *a);
+
+/**	@brief Copy FP4 to another FP4
+ *
+	@param x FP4 instance, on exit = y
+	@param y FP4 instance to be copied
+ */
+extern void FP4_copy(FP4 *x, FP4 *y);
+/**	@brief Set FP4 to zero
+ *
+	@param x FP4 instance to be set to zero
+ */
+extern void FP4_zero(FP4 *x);
+/**	@brief Set FP4 to unity
+ *
+	@param x FP4 instance to be set to one
+ */
+extern void FP4_one(FP4 *x);
+
+/**	@brief Sign of FP4
+ *
+	@param x FP4 instance
+	@return "sign" of FP4
+ */
+extern int FP4_sign(FP4 *x);
+
+/**	@brief Negation of FP4
+ *
+	@param x FP4 instance, on exit = -y
+	@param y FP4 instance
+ */
+extern void FP4_neg(FP4 *x, FP4 *y);
+/**	@brief Conjugation of FP4
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP4 instance, on exit = conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_conj(FP4 *x, FP4 *y);
+/**	@brief Negative conjugation of FP4
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP4 instance, on exit = -conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_nconj(FP4 *x, FP4 *y);
+/**	@brief addition of two FP4s
+ *
+	@param x FP4 instance, on exit = y+z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_add(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief subtraction of two FP4s
+ *
+	@param x FP4 instance, on exit = y-z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_sub(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Multiplication of an FP4 by an FP2
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP2 multiplier
+ */
+extern void FP4_pmul(FP4 *x, FP4 *y, FP2 *a);
+
+
+/**	@brief Multiplication of an FP4 by an FP
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP multiplier
+ */
+extern void FP4_qmul(FP4 *x, FP4 *y, FP *a);
+
+/**	@brief Multiplication of an FP4 by a small integer
+ *
+	@param x FP4 instance, on exit = y*i
+	@param y FP4 instance
+	@param i an integer
+ */
+extern void FP4_imul(FP4 *x, FP4 *y, int i);
+/**	@brief Squaring an FP4
+ *
+	@param x FP4 instance, on exit = y^2
+	@param y FP4 instance
+ */
+extern void FP4_sqr(FP4 *x, FP4 *y);
+/**	@brief Multiplication of two FP4s
+ *
+	@param x FP4 instance, on exit = y*z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_mul(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Inverting an FP4
+ *
+	@param x FP4 instance, on exit = 1/y
+	@param y FP4 instance
+    @param h optional input hint
+ */
+extern void FP4_inv(FP4 *x, FP4 *y, FP *h);
+
+/**	@brief Divide an FP4 by 2
+ *
+	@param x FP4 instance, on exit = y/2
+	@param y FP4 instance
+ */
+extern void FP4_div2(FP4 *x, FP4 *y);
+
+
+/**	@brief Formats and outputs an FP4 to the console
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_output(FP4 *x);
+/**	@brief Formats and outputs an FP4 to the console in raw form (for debugging)
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_rawoutput(FP4 *x);
+/**	@brief multiplies an FP4 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP4 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP4_times_i(FP4 *x);
+/**	@brief Normalises the components of an FP4
+ *
+	@param x FP4 instance to be normalised
+ */
+extern void FP4_norm(FP4 *x);
+/**	@brief Reduces all components of possibly unreduced FP4 mod Modulus
+ *
+	@param x FP4 instance, on exit reduced mod Modulus
+ */
+extern void FP4_reduce(FP4 *x);
+/**	@brief Raises an FP4 to the power of a BIG
+ *
+	@param x FP4 instance, on exit = y^b
+	@param y FP4 instance
+	@param b BIG number
+ */
+extern void FP4_pow(FP4 *x, FP4 *y, B464_60::BIG b);
+/**	@brief Raises an FP4 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP4 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP4_frob(FP4 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP4 instance, on exit = w*x-conj(x)*y+z
+	@param w FP4 instance
+	@param x FP4 instance
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_xtr_A(FP4 *r, FP4 *w, FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP4 instance, on exit = x^2-2*conj(x)
+	@param x FP4 instance
+ */
+extern void FP4_xtr_D(FP4 *r, FP4 *x);
+/**	@brief Calculates FP4 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP4 instance, on exit = trace(w^b)
+	@param x FP4 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP4_xtr_pow(FP4 *r, FP4 *x, B464_60::BIG b);
+/**	@brief Calculates FP4 trace of c^a.d^b, where c and d are derived from FP4 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP4 instance, on exit = trace(c^a.d^b)
+	@param c FP4 instance, trace of an FP12
+	@param d FP4 instance, trace of an FP12
+	@param e FP4 instance, trace of an FP12
+	@param f FP4 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP4_xtr_pow2(FP4 *r, FP4 *c, FP4 *d, FP4 *e, FP4 *f, B464_60::BIG a, B464_60::BIG b);
+
+/**	@brief Test FP4 for QR
+ * 
+	@param r FP4 instance
+    @param h optional generated hint
+	@return 1 x is a QR, otherwise 0
+ */
+extern int  FP4_qr(FP4 *r, FP *h);
+
+/**	@brief Calculate square root of an FP4
+ *
+	Square root
+	@param r FP4 instance, on exit = sqrt(x)
+	@param x FP4 instance
+    @param h optional input hint
+ */
+extern void  FP4_sqrt(FP4 *r, FP4 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP4 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP4 instance, set to y if s!=0
+	@param y another FP4 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP4_cmove(FP4 *x, FP4 *y, int s);
+
+
+/**	@brief Divide FP4 number by QNR
+ *
+	Divide FP4 by the QNR
+	@param x FP4 instance
+ */
+extern void FP4_div_i(FP4 *x);
+
+/**	@brief Generate random FP4
+ *
+	@param x random FP4 number
+	@param rng random number generator
+ */
+extern void FP4_rand(FP4 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp4_FP256BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp4_FP256BN.h
new file mode 100644
index 0000000..0b0ddb1
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp4_FP256BN.h
@@ -0,0 +1,349 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP4_FP256BN_H
+#define FP4_FP256BN_H
+
+#include "fp2_FP256BN.h"
+#include "config_curve_FP256BN.h"
+
+using namespace core;
+
+namespace FP256BN {
+
+/**
+	@brief FP4 Structure - towered over two FP2
+*/
+
+typedef struct
+{
+    FP2 a; /**< real part of FP4 */
+    FP2 b; /**< imaginary part of FP4 */
+} FP4;
+
+
+/* FP4 prototypes */
+/**	@brief Tests for FP4 equal to zero
+ *
+	@param x FP4 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP4_iszilch(FP4 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP4 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP4_islarger(FP4 *x);
+
+/**	@brief Serialize out FP4  
+ *
+    @param b buffer for output
+	@param x FP4 number to be serialized
+ */
+extern void FP4_toBytes(char *b,FP4 *x);
+
+/**	@brief Serialize in FP4  
+ *
+	@param x FP4 number to be serialized
+    @param b buffer for input
+ */
+extern void FP4_fromBytes(FP4 *x,char *b);
+
+/**	@brief Tests for FP4 equal to unity
+ *
+	@param x FP4 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP4_isunity(FP4 *x);
+/**	@brief Tests for equality of two FP4s
+ *
+	@param x FP4 instance to be compared
+	@param y FP4 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP4_equals(FP4 *x, FP4 *y);
+/**	@brief Tests for FP4 having only a real part and no imaginary part
+ *
+	@param x FP4 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP4_isreal(FP4 *x);
+/**	@brief Initialise FP4 from two FP2s
+ *
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+	@param b FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2s(FP4 *x, FP2 *a, FP2 *b);
+/**	@brief Initialise FP4 from single FP2
+ *
+	Imaginary part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+ */
+extern void FP4_from_FP2(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP2
+ *
+	real part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2H(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP
+ *
+	@param x FP4 instance to be initialised
+	@param a FP to form real part of FP4
+ */
+extern void FP4_from_FP(FP4 *x, FP *a);
+
+/**	@brief Copy FP4 to another FP4
+ *
+	@param x FP4 instance, on exit = y
+	@param y FP4 instance to be copied
+ */
+extern void FP4_copy(FP4 *x, FP4 *y);
+/**	@brief Set FP4 to zero
+ *
+	@param x FP4 instance to be set to zero
+ */
+extern void FP4_zero(FP4 *x);
+/**	@brief Set FP4 to unity
+ *
+	@param x FP4 instance to be set to one
+ */
+extern void FP4_one(FP4 *x);
+
+/**	@brief Sign of FP4
+ *
+	@param x FP4 instance
+	@return "sign" of FP4
+ */
+extern int FP4_sign(FP4 *x);
+
+/**	@brief Negation of FP4
+ *
+	@param x FP4 instance, on exit = -y
+	@param y FP4 instance
+ */
+extern void FP4_neg(FP4 *x, FP4 *y);
+/**	@brief Conjugation of FP4
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP4 instance, on exit = conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_conj(FP4 *x, FP4 *y);
+/**	@brief Negative conjugation of FP4
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP4 instance, on exit = -conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_nconj(FP4 *x, FP4 *y);
+/**	@brief addition of two FP4s
+ *
+	@param x FP4 instance, on exit = y+z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_add(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief subtraction of two FP4s
+ *
+	@param x FP4 instance, on exit = y-z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_sub(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Multiplication of an FP4 by an FP2
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP2 multiplier
+ */
+extern void FP4_pmul(FP4 *x, FP4 *y, FP2 *a);
+
+
+/**	@brief Multiplication of an FP4 by an FP
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP multiplier
+ */
+extern void FP4_qmul(FP4 *x, FP4 *y, FP *a);
+
+/**	@brief Multiplication of an FP4 by a small integer
+ *
+	@param x FP4 instance, on exit = y*i
+	@param y FP4 instance
+	@param i an integer
+ */
+extern void FP4_imul(FP4 *x, FP4 *y, int i);
+/**	@brief Squaring an FP4
+ *
+	@param x FP4 instance, on exit = y^2
+	@param y FP4 instance
+ */
+extern void FP4_sqr(FP4 *x, FP4 *y);
+/**	@brief Multiplication of two FP4s
+ *
+	@param x FP4 instance, on exit = y*z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_mul(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Inverting an FP4
+ *
+	@param x FP4 instance, on exit = 1/y
+	@param y FP4 instance
+    @param h optional input hint
+ */
+extern void FP4_inv(FP4 *x, FP4 *y, FP *h);
+
+/**	@brief Divide an FP4 by 2
+ *
+	@param x FP4 instance, on exit = y/2
+	@param y FP4 instance
+ */
+extern void FP4_div2(FP4 *x, FP4 *y);
+
+
+/**	@brief Formats and outputs an FP4 to the console
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_output(FP4 *x);
+/**	@brief Formats and outputs an FP4 to the console in raw form (for debugging)
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_rawoutput(FP4 *x);
+/**	@brief multiplies an FP4 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP4 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP4_times_i(FP4 *x);
+/**	@brief Normalises the components of an FP4
+ *
+	@param x FP4 instance to be normalised
+ */
+extern void FP4_norm(FP4 *x);
+/**	@brief Reduces all components of possibly unreduced FP4 mod Modulus
+ *
+	@param x FP4 instance, on exit reduced mod Modulus
+ */
+extern void FP4_reduce(FP4 *x);
+/**	@brief Raises an FP4 to the power of a BIG
+ *
+	@param x FP4 instance, on exit = y^b
+	@param y FP4 instance
+	@param b BIG number
+ */
+extern void FP4_pow(FP4 *x, FP4 *y, B256_56::BIG b);
+/**	@brief Raises an FP4 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP4 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP4_frob(FP4 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP4 instance, on exit = w*x-conj(x)*y+z
+	@param w FP4 instance
+	@param x FP4 instance
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_xtr_A(FP4 *r, FP4 *w, FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP4 instance, on exit = x^2-2*conj(x)
+	@param x FP4 instance
+ */
+extern void FP4_xtr_D(FP4 *r, FP4 *x);
+/**	@brief Calculates FP4 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP4 instance, on exit = trace(w^b)
+	@param x FP4 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP4_xtr_pow(FP4 *r, FP4 *x, B256_56::BIG b);
+/**	@brief Calculates FP4 trace of c^a.d^b, where c and d are derived from FP4 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP4 instance, on exit = trace(c^a.d^b)
+	@param c FP4 instance, trace of an FP12
+	@param d FP4 instance, trace of an FP12
+	@param e FP4 instance, trace of an FP12
+	@param f FP4 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP4_xtr_pow2(FP4 *r, FP4 *c, FP4 *d, FP4 *e, FP4 *f, B256_56::BIG a, B256_56::BIG b);
+
+/**	@brief Test FP4 for QR
+ * 
+	@param r FP4 instance
+    @param h optional generated hint
+	@return 1 x is a QR, otherwise 0
+ */
+extern int  FP4_qr(FP4 *r, FP *h);
+
+/**	@brief Calculate square root of an FP4
+ *
+	Square root
+	@param r FP4 instance, on exit = sqrt(x)
+	@param x FP4 instance
+    @param h optional input hint
+ */
+extern void  FP4_sqrt(FP4 *r, FP4 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP4 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP4 instance, set to y if s!=0
+	@param y another FP4 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP4_cmove(FP4 *x, FP4 *y, int s);
+
+
+/**	@brief Divide FP4 number by QNR
+ *
+	Divide FP4 by the QNR
+	@param x FP4 instance
+ */
+extern void FP4_div_i(FP4 *x);
+
+/**	@brief Generate random FP4
+ *
+	@param x random FP4 number
+	@param rng random number generator
+ */
+extern void FP4_rand(FP4 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp4_FP512BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp4_FP512BN.h
new file mode 100644
index 0000000..d266dc7
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp4_FP512BN.h
@@ -0,0 +1,349 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP4_FP512BN_H
+#define FP4_FP512BN_H
+
+#include "fp2_FP512BN.h"
+#include "config_curve_FP512BN.h"
+
+using namespace core;
+
+namespace FP512BN {
+
+/**
+	@brief FP4 Structure - towered over two FP2
+*/
+
+typedef struct
+{
+    FP2 a; /**< real part of FP4 */
+    FP2 b; /**< imaginary part of FP4 */
+} FP4;
+
+
+/* FP4 prototypes */
+/**	@brief Tests for FP4 equal to zero
+ *
+	@param x FP4 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP4_iszilch(FP4 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP4 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP4_islarger(FP4 *x);
+
+/**	@brief Serialize out FP4  
+ *
+    @param b buffer for output
+	@param x FP4 number to be serialized
+ */
+extern void FP4_toBytes(char *b,FP4 *x);
+
+/**	@brief Serialize in FP4  
+ *
+	@param x FP4 number to be serialized
+    @param b buffer for input
+ */
+extern void FP4_fromBytes(FP4 *x,char *b);
+
+/**	@brief Tests for FP4 equal to unity
+ *
+	@param x FP4 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP4_isunity(FP4 *x);
+/**	@brief Tests for equality of two FP4s
+ *
+	@param x FP4 instance to be compared
+	@param y FP4 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP4_equals(FP4 *x, FP4 *y);
+/**	@brief Tests for FP4 having only a real part and no imaginary part
+ *
+	@param x FP4 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP4_isreal(FP4 *x);
+/**	@brief Initialise FP4 from two FP2s
+ *
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+	@param b FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2s(FP4 *x, FP2 *a, FP2 *b);
+/**	@brief Initialise FP4 from single FP2
+ *
+	Imaginary part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form real part of FP4
+ */
+extern void FP4_from_FP2(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP2
+ *
+	real part is set to zero
+	@param x FP4 instance to be initialised
+	@param a FP2 to form imaginary part of FP4
+ */
+extern void FP4_from_FP2H(FP4 *x, FP2 *a);
+
+/**	@brief Initialise FP4 from single FP
+ *
+	@param x FP4 instance to be initialised
+	@param a FP to form real part of FP4
+ */
+extern void FP4_from_FP(FP4 *x, FP *a);
+
+/**	@brief Copy FP4 to another FP4
+ *
+	@param x FP4 instance, on exit = y
+	@param y FP4 instance to be copied
+ */
+extern void FP4_copy(FP4 *x, FP4 *y);
+/**	@brief Set FP4 to zero
+ *
+	@param x FP4 instance to be set to zero
+ */
+extern void FP4_zero(FP4 *x);
+/**	@brief Set FP4 to unity
+ *
+	@param x FP4 instance to be set to one
+ */
+extern void FP4_one(FP4 *x);
+
+/**	@brief Sign of FP4
+ *
+	@param x FP4 instance
+	@return "sign" of FP4
+ */
+extern int FP4_sign(FP4 *x);
+
+/**	@brief Negation of FP4
+ *
+	@param x FP4 instance, on exit = -y
+	@param y FP4 instance
+ */
+extern void FP4_neg(FP4 *x, FP4 *y);
+/**	@brief Conjugation of FP4
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP4 instance, on exit = conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_conj(FP4 *x, FP4 *y);
+/**	@brief Negative conjugation of FP4
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP4 instance, on exit = -conj(y)
+	@param y FP4 instance
+ */
+extern void FP4_nconj(FP4 *x, FP4 *y);
+/**	@brief addition of two FP4s
+ *
+	@param x FP4 instance, on exit = y+z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_add(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief subtraction of two FP4s
+ *
+	@param x FP4 instance, on exit = y-z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_sub(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Multiplication of an FP4 by an FP2
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP2 multiplier
+ */
+extern void FP4_pmul(FP4 *x, FP4 *y, FP2 *a);
+
+
+/**	@brief Multiplication of an FP4 by an FP
+ *
+	@param x FP4 instance, on exit = y*a
+	@param y FP4 instance
+	@param a FP multiplier
+ */
+extern void FP4_qmul(FP4 *x, FP4 *y, FP *a);
+
+/**	@brief Multiplication of an FP4 by a small integer
+ *
+	@param x FP4 instance, on exit = y*i
+	@param y FP4 instance
+	@param i an integer
+ */
+extern void FP4_imul(FP4 *x, FP4 *y, int i);
+/**	@brief Squaring an FP4
+ *
+	@param x FP4 instance, on exit = y^2
+	@param y FP4 instance
+ */
+extern void FP4_sqr(FP4 *x, FP4 *y);
+/**	@brief Multiplication of two FP4s
+ *
+	@param x FP4 instance, on exit = y*z
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_mul(FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Inverting an FP4
+ *
+	@param x FP4 instance, on exit = 1/y
+	@param y FP4 instance
+    @param h optional input hint
+ */
+extern void FP4_inv(FP4 *x, FP4 *y, FP *h);
+
+/**	@brief Divide an FP4 by 2
+ *
+	@param x FP4 instance, on exit = y/2
+	@param y FP4 instance
+ */
+extern void FP4_div2(FP4 *x, FP4 *y);
+
+
+/**	@brief Formats and outputs an FP4 to the console
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_output(FP4 *x);
+/**	@brief Formats and outputs an FP4 to the console in raw form (for debugging)
+ *
+	@param x FP4 instance to be printed
+ */
+extern void FP4_rawoutput(FP4 *x);
+/**	@brief multiplies an FP4 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP4 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP4_times_i(FP4 *x);
+/**	@brief Normalises the components of an FP4
+ *
+	@param x FP4 instance to be normalised
+ */
+extern void FP4_norm(FP4 *x);
+/**	@brief Reduces all components of possibly unreduced FP4 mod Modulus
+ *
+	@param x FP4 instance, on exit reduced mod Modulus
+ */
+extern void FP4_reduce(FP4 *x);
+/**	@brief Raises an FP4 to the power of a BIG
+ *
+	@param x FP4 instance, on exit = y^b
+	@param y FP4 instance
+	@param b BIG number
+ */
+extern void FP4_pow(FP4 *x, FP4 *y, B512_60::BIG b);
+/**	@brief Raises an FP4 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP4 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP4_frob(FP4 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP4 instance, on exit = w*x-conj(x)*y+z
+	@param w FP4 instance
+	@param x FP4 instance
+	@param y FP4 instance
+	@param z FP4 instance
+ */
+extern void FP4_xtr_A(FP4 *r, FP4 *w, FP4 *x, FP4 *y, FP4 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP4 instance, on exit = x^2-2*conj(x)
+	@param x FP4 instance
+ */
+extern void FP4_xtr_D(FP4 *r, FP4 *x);
+/**	@brief Calculates FP4 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP4 instance, on exit = trace(w^b)
+	@param x FP4 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP4_xtr_pow(FP4 *r, FP4 *x, B512_60::BIG b);
+/**	@brief Calculates FP4 trace of c^a.d^b, where c and d are derived from FP4 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP4 instance, on exit = trace(c^a.d^b)
+	@param c FP4 instance, trace of an FP12
+	@param d FP4 instance, trace of an FP12
+	@param e FP4 instance, trace of an FP12
+	@param f FP4 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP4_xtr_pow2(FP4 *r, FP4 *c, FP4 *d, FP4 *e, FP4 *f, B512_60::BIG a, B512_60::BIG b);
+
+/**	@brief Test FP4 for QR
+ * 
+	@param r FP4 instance
+    @param h optional generated hint
+	@return 1 x is a QR, otherwise 0
+ */
+extern int  FP4_qr(FP4 *r, FP *h);
+
+/**	@brief Calculate square root of an FP4
+ *
+	Square root
+	@param r FP4 instance, on exit = sqrt(x)
+	@param x FP4 instance
+    @param h optional input hint
+ */
+extern void  FP4_sqrt(FP4 *r, FP4 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP4 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP4 instance, set to y if s!=0
+	@param y another FP4 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP4_cmove(FP4 *x, FP4 *y, int s);
+
+
+/**	@brief Divide FP4 number by QNR
+ *
+	Divide FP4 by the QNR
+	@param x FP4 instance
+ */
+extern void FP4_div_i(FP4 *x);
+
+/**	@brief Generate random FP4
+ *
+	@param x random FP4 number
+	@param rng random number generator
+ */
+extern void FP4_rand(FP4 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp8.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp8.h
new file mode 100644
index 0000000..e9ed770
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp8.h
@@ -0,0 +1,365 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP8_YYY_H
+#define FP8_YYY_H
+
+#include "fp4_YYY.h"
+#include "config_curve_ZZZ.h"
+
+using namespace core;
+
+namespace YYY {
+
+/**
+	@brief FP8 Structure - towered over two FP4
+*/
+
+typedef struct
+{
+    FP4 a; /**< real part of FP8 */
+    FP4 b; /**< imaginary part of FP8 */
+} FP8;
+
+
+/* FP8 prototypes */
+/**	@brief Tests for FP8 equal to zero
+ *
+	@param x FP8 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP8_iszilch(FP8 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP8 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP8_islarger(FP8 *x);
+
+/**	@brief Serialize in FP8  
+ *
+    @param b buffer for output
+	@param x FP8 number to be serialized
+ */
+extern void FP8_toBytes(char *b,FP8 *x);
+/**	@brief Serialize out FP8  
+ *
+	@param x FP8 number to be serialized
+    @param b buffer for input
+ */
+extern void FP8_fromBytes(FP8 *x,char *b);
+
+
+/**	@brief Tests for FP8 equal to unity
+ *
+	@param x FP8 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP8_isunity(FP8 *x);
+/**	@brief Tests for equality of two FP8s
+ *
+	@param x FP8 instance to be compared
+	@param y FP8 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP8_equals(FP8 *x, FP8 *y);
+/**	@brief Tests for FP8 having only a real part and no imaginary part
+ *
+	@param x FP8 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP8_isreal(FP8 *x);
+/**	@brief Initialise FP8 from two FP4s
+ *
+	@param x FP8 instance to be initialised
+	@param a FP4 to form real part of FP8
+	@param b FP4 to form imaginary part of FP8
+ */
+extern void FP8_from_FP4s(FP8 *x, FP4 *a, FP4 *b);
+/**	@brief Initialise FP8 from single FP4
+ *
+	Imaginary part is set to zero
+	@param x FP8 instance to be initialised
+	@param a FP4 to form real part of FP8
+ */
+extern void FP8_from_FP4(FP8 *x, FP4 *a);
+
+/**	@brief Initialise FP8 from single FP4
+ *
+	real part is set to zero
+	@param x FP8 instance to be initialised
+	@param a FP4 to form imaginary part of FP8
+ */
+extern void FP8_from_FP4H(FP8 *x, FP4 *a);
+
+/**	@brief Initialise FP8 from single FP
+ *
+	@param x FP8 instance to be initialised
+	@param a FP to form real part of FP8
+ */
+extern void FP8_from_FP(FP8 *x, FP *a);
+
+/**	@brief Copy FP8 to another FP8
+ *
+	@param x FP8 instance, on exit = y
+	@param y FP8 instance to be copied
+ */
+extern void FP8_copy(FP8 *x, FP8 *y);
+
+/**	@brief Set FP8 to zero
+ *
+	@param x FP8 instance to be set to zero
+ */
+extern void FP8_zero(FP8 *x);
+/**	@brief Set FP8 to unity
+ *
+	@param x FP8 instance to be set to one
+ */
+extern void FP8_one(FP8 *x);
+
+/**	@brief Sign of FP8
+ *
+	@param x FP8 instance
+	@return "sign" of FP8
+ */
+extern int FP8_sign(FP8 *x);
+
+/**	@brief Negation of FP8
+ *
+	@param x FP8 instance, on exit = -y
+	@param y FP8 instance
+ */
+extern void FP8_neg(FP8 *x, FP8 *y);
+/**	@brief Conjugation of FP8
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP8 instance, on exit = conj(y)
+	@param y FP8 instance
+ */
+extern void FP8_conj(FP8 *x, FP8 *y);
+/**	@brief Negative conjugation of FP8
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP8 instance, on exit = -conj(y)
+	@param y FP8 instance
+ */
+extern void FP8_nconj(FP8 *x, FP8 *y);
+/**	@brief addition of two FP8s
+ *
+	@param x FP8 instance, on exit = y+z
+	@param y FP8 instance
+	@param z FP8 instance
+ */
+extern void FP8_add(FP8 *x, FP8 *y, FP8 *z);
+/**	@brief subtraction of two FP8s
+ *
+	@param x FP8 instance, on exit = y-z
+	@param y FP8 instance
+	@param z FP8 instance
+ */
+extern void FP8_sub(FP8 *x, FP8 *y, FP8 *z);
+/**	@brief Multiplication of an FP8 by an FP4
+ *
+	@param x FP8 instance, on exit = y*a
+	@param y FP8 instance
+	@param a FP4 multiplier
+ */
+extern void FP8_pmul(FP8 *x, FP8 *y, FP4 *a);
+
+/**	@brief Multiplication of an FP8 by an FP2
+ *
+	@param x FP8 instance, on exit = y*a
+	@param y FP8 instance
+	@param a FP2 multiplier
+ */
+extern void FP8_qmul(FP8 *x, FP8 *y, FP2 *a);
+
+/**	@brief Multiplication of an FP8 by an FP
+ *
+	@param x FP8 instance, on exit = y*a
+	@param y FP8 instance
+	@param a FP multiplier
+ */
+extern void FP8_tmul(FP8 *x, FP8 *y, FP *a);
+
+
+
+/**	@brief Multiplication of an FP8 by a small integer
+ *
+	@param x FP8 instance, on exit = y*i
+	@param y FP8 instance
+	@param i an integer
+ */
+extern void FP8_imul(FP8 *x, FP8 *y, int i);
+/**	@brief Squaring an FP8
+ *
+	@param x FP8 instance, on exit = y^2
+	@param y FP8 instance
+ */
+extern void FP8_sqr(FP8 *x, FP8 *y);
+/**	@brief Multiplication of two FP8s
+ *
+	@param x FP8 instance, on exit = y*z
+	@param y FP8 instance
+	@param z FP8 instance
+ */
+extern void FP8_mul(FP8 *x, FP8 *y, FP8 *z);
+/**	@brief Inverting an FP8
+ *
+	@param x FP8 instance, on exit = 1/y
+	@param y FP8 instance
+    @param h optional input hint
+ */
+extern void FP8_inv(FP8 *x, FP8 *y, FP *h);
+/**	@brief Formats and outputs an FP8 to the console
+ *
+	@param x FP8 instance to be printed
+ */
+extern void FP8_output(FP8 *x);
+/**	@brief Divide an FP8 by 2
+ *
+	@param x FP8 instance, on exit = y/2
+	@param y FP8 instance
+ */
+extern void FP8_div2(FP8 *x, FP8 *y);
+
+/**	@brief Formats and outputs an FP8 to the console in raw form (for debugging)
+ *
+	@param x FP8 instance to be printed
+ */
+extern void FP8_rawoutput(FP8 *x);
+/**	@brief multiplies an FP8 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP8 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP8_times_i(FP8 *x);
+/**	@brief multiplies an FP8 instance by irreducible polynomial (1+sqrt(-1))
+ *
+	@param x FP8 instance, on exit = (1+sqrt(-1)*x
+ */
+extern void FP8_times_i2(FP8 *x);
+
+/**	@brief Normalises the components of an FP8
+ *
+	@param x FP8 instance to be normalised
+ */
+extern void FP8_norm(FP8 *x);
+/**	@brief Reduces all components of possibly unreduced FP8 mod Modulus
+ *
+	@param x FP8 instance, on exit reduced mod Modulus
+ */
+extern void FP8_reduce(FP8 *x);
+/**	@brief Raises an FP8 to the power of a BIG
+ *
+	@param x FP8 instance, on exit = y^b
+	@param y FP8 instance
+	@param b BIG number
+ */
+extern void FP8_pow(FP8 *x, FP8 *y, XXX::BIG b);
+/**	@brief Raises an FP8 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP8 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP8_frob(FP8 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP8 instance, on exit = w*x-conj(x)*y+z
+	@param w FP8 instance
+	@param x FP8 instance
+	@param y FP8 instance
+	@param z FP8 instance
+ */
+extern void FP8_xtr_A(FP8 *r, FP8 *w, FP8 *x, FP8 *y, FP8 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP8 instance, on exit = x^2-2*conj(x)
+	@param x FP8 instance
+ */
+extern void FP8_xtr_D(FP8 *r, FP8 *x);
+/**	@brief Calculates FP8 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP8 instance, on exit = trace(w^b)
+	@param x FP8 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP8_xtr_pow(FP8 *r, FP8 *x, XXX::BIG b);
+/**	@brief Calculates FP8 trace of c^a.d^b, where c and d are derived from FP8 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP8 instance, on exit = trace(c^a.d^b)
+	@param c FP8 instance, trace of an FP12
+	@param d FP8 instance, trace of an FP12
+	@param e FP8 instance, trace of an FP12
+	@param f FP8 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP8_xtr_pow2(FP8 *r, FP8 *c, FP8 *d, FP8 *e, FP8 *f, XXX::BIG a, XXX::BIG b);
+
+/**	@brief Test FP8 for QR
+ *
+	Square root
+	@param r FP8 instance
+    @param h optional generated hint
+	@return 1 r is a QR, otherwise 0
+ */
+extern int  FP8_qr(FP8 *r, FP *h);
+
+
+/**	@brief Calculate square root of an FP8
+ *
+	Square root
+	@param r FP8 instance, on exit = sqrt(x)
+	@param x FP8 instance
+    @param h optional input hint
+ */
+extern void  FP8_sqrt(FP8 *r, FP8 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP8 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP8 instance, set to y if s!=0
+	@param y another FP8 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP8_cmove(FP8 *x, FP8 *y, int s);
+
+
+/**	@brief Divide FP8 number by QNR
+ *
+	Divide FP8 by the QNR
+	@param x FP8 instance
+ */
+extern void FP8_div_i(FP8 *x);
+
+/**	@brief Generate random FP8
+ *
+	@param x random FP8 number
+	@param rng random number generator
+ */
+extern void FP8_rand(FP8 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp8_BLS24479.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp8_BLS24479.h
new file mode 100644
index 0000000..d383a0f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp8_BLS24479.h
@@ -0,0 +1,365 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP8_BLS24479_H
+#define FP8_BLS24479_H
+
+#include "fp4_BLS24479.h"
+#include "config_curve_BLS24479.h"
+
+using namespace core;
+
+namespace BLS24479 {
+
+/**
+	@brief FP8 Structure - towered over two FP4
+*/
+
+typedef struct
+{
+    FP4 a; /**< real part of FP8 */
+    FP4 b; /**< imaginary part of FP8 */
+} FP8;
+
+
+/* FP8 prototypes */
+/**	@brief Tests for FP8 equal to zero
+ *
+	@param x FP8 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP8_iszilch(FP8 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP8 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP8_islarger(FP8 *x);
+
+/**	@brief Serialize in FP8  
+ *
+    @param b buffer for output
+	@param x FP8 number to be serialized
+ */
+extern void FP8_toBytes(char *b,FP8 *x);
+/**	@brief Serialize out FP8  
+ *
+	@param x FP8 number to be serialized
+    @param b buffer for input
+ */
+extern void FP8_fromBytes(FP8 *x,char *b);
+
+
+/**	@brief Tests for FP8 equal to unity
+ *
+	@param x FP8 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP8_isunity(FP8 *x);
+/**	@brief Tests for equality of two FP8s
+ *
+	@param x FP8 instance to be compared
+	@param y FP8 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP8_equals(FP8 *x, FP8 *y);
+/**	@brief Tests for FP8 having only a real part and no imaginary part
+ *
+	@param x FP8 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP8_isreal(FP8 *x);
+/**	@brief Initialise FP8 from two FP4s
+ *
+	@param x FP8 instance to be initialised
+	@param a FP4 to form real part of FP8
+	@param b FP4 to form imaginary part of FP8
+ */
+extern void FP8_from_FP4s(FP8 *x, FP4 *a, FP4 *b);
+/**	@brief Initialise FP8 from single FP4
+ *
+	Imaginary part is set to zero
+	@param x FP8 instance to be initialised
+	@param a FP4 to form real part of FP8
+ */
+extern void FP8_from_FP4(FP8 *x, FP4 *a);
+
+/**	@brief Initialise FP8 from single FP4
+ *
+	real part is set to zero
+	@param x FP8 instance to be initialised
+	@param a FP4 to form imaginary part of FP8
+ */
+extern void FP8_from_FP4H(FP8 *x, FP4 *a);
+
+/**	@brief Initialise FP8 from single FP
+ *
+	@param x FP8 instance to be initialised
+	@param a FP to form real part of FP8
+ */
+extern void FP8_from_FP(FP8 *x, FP *a);
+
+/**	@brief Copy FP8 to another FP8
+ *
+	@param x FP8 instance, on exit = y
+	@param y FP8 instance to be copied
+ */
+extern void FP8_copy(FP8 *x, FP8 *y);
+
+/**	@brief Set FP8 to zero
+ *
+	@param x FP8 instance to be set to zero
+ */
+extern void FP8_zero(FP8 *x);
+/**	@brief Set FP8 to unity
+ *
+	@param x FP8 instance to be set to one
+ */
+extern void FP8_one(FP8 *x);
+
+/**	@brief Sign of FP8
+ *
+	@param x FP8 instance
+	@return "sign" of FP8
+ */
+extern int FP8_sign(FP8 *x);
+
+/**	@brief Negation of FP8
+ *
+	@param x FP8 instance, on exit = -y
+	@param y FP8 instance
+ */
+extern void FP8_neg(FP8 *x, FP8 *y);
+/**	@brief Conjugation of FP8
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP8 instance, on exit = conj(y)
+	@param y FP8 instance
+ */
+extern void FP8_conj(FP8 *x, FP8 *y);
+/**	@brief Negative conjugation of FP8
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP8 instance, on exit = -conj(y)
+	@param y FP8 instance
+ */
+extern void FP8_nconj(FP8 *x, FP8 *y);
+/**	@brief addition of two FP8s
+ *
+	@param x FP8 instance, on exit = y+z
+	@param y FP8 instance
+	@param z FP8 instance
+ */
+extern void FP8_add(FP8 *x, FP8 *y, FP8 *z);
+/**	@brief subtraction of two FP8s
+ *
+	@param x FP8 instance, on exit = y-z
+	@param y FP8 instance
+	@param z FP8 instance
+ */
+extern void FP8_sub(FP8 *x, FP8 *y, FP8 *z);
+/**	@brief Multiplication of an FP8 by an FP4
+ *
+	@param x FP8 instance, on exit = y*a
+	@param y FP8 instance
+	@param a FP4 multiplier
+ */
+extern void FP8_pmul(FP8 *x, FP8 *y, FP4 *a);
+
+/**	@brief Multiplication of an FP8 by an FP2
+ *
+	@param x FP8 instance, on exit = y*a
+	@param y FP8 instance
+	@param a FP2 multiplier
+ */
+extern void FP8_qmul(FP8 *x, FP8 *y, FP2 *a);
+
+/**	@brief Multiplication of an FP8 by an FP
+ *
+	@param x FP8 instance, on exit = y*a
+	@param y FP8 instance
+	@param a FP multiplier
+ */
+extern void FP8_tmul(FP8 *x, FP8 *y, FP *a);
+
+
+
+/**	@brief Multiplication of an FP8 by a small integer
+ *
+	@param x FP8 instance, on exit = y*i
+	@param y FP8 instance
+	@param i an integer
+ */
+extern void FP8_imul(FP8 *x, FP8 *y, int i);
+/**	@brief Squaring an FP8
+ *
+	@param x FP8 instance, on exit = y^2
+	@param y FP8 instance
+ */
+extern void FP8_sqr(FP8 *x, FP8 *y);
+/**	@brief Multiplication of two FP8s
+ *
+	@param x FP8 instance, on exit = y*z
+	@param y FP8 instance
+	@param z FP8 instance
+ */
+extern void FP8_mul(FP8 *x, FP8 *y, FP8 *z);
+/**	@brief Inverting an FP8
+ *
+	@param x FP8 instance, on exit = 1/y
+	@param y FP8 instance
+    @param h optional input hint
+ */
+extern void FP8_inv(FP8 *x, FP8 *y, FP *h);
+/**	@brief Formats and outputs an FP8 to the console
+ *
+	@param x FP8 instance to be printed
+ */
+extern void FP8_output(FP8 *x);
+/**	@brief Divide an FP8 by 2
+ *
+	@param x FP8 instance, on exit = y/2
+	@param y FP8 instance
+ */
+extern void FP8_div2(FP8 *x, FP8 *y);
+
+/**	@brief Formats and outputs an FP8 to the console in raw form (for debugging)
+ *
+	@param x FP8 instance to be printed
+ */
+extern void FP8_rawoutput(FP8 *x);
+/**	@brief multiplies an FP8 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP8 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP8_times_i(FP8 *x);
+/**	@brief multiplies an FP8 instance by irreducible polynomial (1+sqrt(-1))
+ *
+	@param x FP8 instance, on exit = (1+sqrt(-1)*x
+ */
+extern void FP8_times_i2(FP8 *x);
+
+/**	@brief Normalises the components of an FP8
+ *
+	@param x FP8 instance to be normalised
+ */
+extern void FP8_norm(FP8 *x);
+/**	@brief Reduces all components of possibly unreduced FP8 mod Modulus
+ *
+	@param x FP8 instance, on exit reduced mod Modulus
+ */
+extern void FP8_reduce(FP8 *x);
+/**	@brief Raises an FP8 to the power of a BIG
+ *
+	@param x FP8 instance, on exit = y^b
+	@param y FP8 instance
+	@param b BIG number
+ */
+extern void FP8_pow(FP8 *x, FP8 *y, B480_56::BIG b);
+/**	@brief Raises an FP8 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP8 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP8_frob(FP8 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP8 instance, on exit = w*x-conj(x)*y+z
+	@param w FP8 instance
+	@param x FP8 instance
+	@param y FP8 instance
+	@param z FP8 instance
+ */
+extern void FP8_xtr_A(FP8 *r, FP8 *w, FP8 *x, FP8 *y, FP8 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP8 instance, on exit = x^2-2*conj(x)
+	@param x FP8 instance
+ */
+extern void FP8_xtr_D(FP8 *r, FP8 *x);
+/**	@brief Calculates FP8 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP8 instance, on exit = trace(w^b)
+	@param x FP8 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP8_xtr_pow(FP8 *r, FP8 *x, B480_56::BIG b);
+/**	@brief Calculates FP8 trace of c^a.d^b, where c and d are derived from FP8 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP8 instance, on exit = trace(c^a.d^b)
+	@param c FP8 instance, trace of an FP12
+	@param d FP8 instance, trace of an FP12
+	@param e FP8 instance, trace of an FP12
+	@param f FP8 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP8_xtr_pow2(FP8 *r, FP8 *c, FP8 *d, FP8 *e, FP8 *f, B480_56::BIG a, B480_56::BIG b);
+
+/**	@brief Test FP8 for QR
+ *
+	Square root
+	@param r FP8 instance
+    @param h optional generated hint
+	@return 1 r is a QR, otherwise 0
+ */
+extern int  FP8_qr(FP8 *r, FP *h);
+
+
+/**	@brief Calculate square root of an FP8
+ *
+	Square root
+	@param r FP8 instance, on exit = sqrt(x)
+	@param x FP8 instance
+    @param h optional input hint
+ */
+extern void  FP8_sqrt(FP8 *r, FP8 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP8 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP8 instance, set to y if s!=0
+	@param y another FP8 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP8_cmove(FP8 *x, FP8 *y, int s);
+
+
+/**	@brief Divide FP8 number by QNR
+ *
+	Divide FP8 by the QNR
+	@param x FP8 instance
+ */
+extern void FP8_div_i(FP8 *x);
+
+/**	@brief Generate random FP8
+ *
+	@param x random FP8 number
+	@param rng random number generator
+ */
+extern void FP8_rand(FP8 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp8_BLS48286.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp8_BLS48286.h
new file mode 100644
index 0000000..f68fe7a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp8_BLS48286.h
@@ -0,0 +1,365 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP8_BLS48286_H
+#define FP8_BLS48286_H
+
+#include "fp4_BLS48286.h"
+#include "config_curve_BLS48286.h"
+
+using namespace core;
+
+namespace BLS48286 {
+
+/**
+	@brief FP8 Structure - towered over two FP4
+*/
+
+typedef struct
+{
+    FP4 a; /**< real part of FP8 */
+    FP4 b; /**< imaginary part of FP8 */
+} FP8;
+
+
+/* FP8 prototypes */
+/**	@brief Tests for FP8 equal to zero
+ *
+	@param x FP8 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP8_iszilch(FP8 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP8 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP8_islarger(FP8 *x);
+
+/**	@brief Serialize in FP8  
+ *
+    @param b buffer for output
+	@param x FP8 number to be serialized
+ */
+extern void FP8_toBytes(char *b,FP8 *x);
+/**	@brief Serialize out FP8  
+ *
+	@param x FP8 number to be serialized
+    @param b buffer for input
+ */
+extern void FP8_fromBytes(FP8 *x,char *b);
+
+
+/**	@brief Tests for FP8 equal to unity
+ *
+	@param x FP8 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP8_isunity(FP8 *x);
+/**	@brief Tests for equality of two FP8s
+ *
+	@param x FP8 instance to be compared
+	@param y FP8 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP8_equals(FP8 *x, FP8 *y);
+/**	@brief Tests for FP8 having only a real part and no imaginary part
+ *
+	@param x FP8 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP8_isreal(FP8 *x);
+/**	@brief Initialise FP8 from two FP4s
+ *
+	@param x FP8 instance to be initialised
+	@param a FP4 to form real part of FP8
+	@param b FP4 to form imaginary part of FP8
+ */
+extern void FP8_from_FP4s(FP8 *x, FP4 *a, FP4 *b);
+/**	@brief Initialise FP8 from single FP4
+ *
+	Imaginary part is set to zero
+	@param x FP8 instance to be initialised
+	@param a FP4 to form real part of FP8
+ */
+extern void FP8_from_FP4(FP8 *x, FP4 *a);
+
+/**	@brief Initialise FP8 from single FP4
+ *
+	real part is set to zero
+	@param x FP8 instance to be initialised
+	@param a FP4 to form imaginary part of FP8
+ */
+extern void FP8_from_FP4H(FP8 *x, FP4 *a);
+
+/**	@brief Initialise FP8 from single FP
+ *
+	@param x FP8 instance to be initialised
+	@param a FP to form real part of FP8
+ */
+extern void FP8_from_FP(FP8 *x, FP *a);
+
+/**	@brief Copy FP8 to another FP8
+ *
+	@param x FP8 instance, on exit = y
+	@param y FP8 instance to be copied
+ */
+extern void FP8_copy(FP8 *x, FP8 *y);
+
+/**	@brief Set FP8 to zero
+ *
+	@param x FP8 instance to be set to zero
+ */
+extern void FP8_zero(FP8 *x);
+/**	@brief Set FP8 to unity
+ *
+	@param x FP8 instance to be set to one
+ */
+extern void FP8_one(FP8 *x);
+
+/**	@brief Sign of FP8
+ *
+	@param x FP8 instance
+	@return "sign" of FP8
+ */
+extern int FP8_sign(FP8 *x);
+
+/**	@brief Negation of FP8
+ *
+	@param x FP8 instance, on exit = -y
+	@param y FP8 instance
+ */
+extern void FP8_neg(FP8 *x, FP8 *y);
+/**	@brief Conjugation of FP8
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP8 instance, on exit = conj(y)
+	@param y FP8 instance
+ */
+extern void FP8_conj(FP8 *x, FP8 *y);
+/**	@brief Negative conjugation of FP8
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP8 instance, on exit = -conj(y)
+	@param y FP8 instance
+ */
+extern void FP8_nconj(FP8 *x, FP8 *y);
+/**	@brief addition of two FP8s
+ *
+	@param x FP8 instance, on exit = y+z
+	@param y FP8 instance
+	@param z FP8 instance
+ */
+extern void FP8_add(FP8 *x, FP8 *y, FP8 *z);
+/**	@brief subtraction of two FP8s
+ *
+	@param x FP8 instance, on exit = y-z
+	@param y FP8 instance
+	@param z FP8 instance
+ */
+extern void FP8_sub(FP8 *x, FP8 *y, FP8 *z);
+/**	@brief Multiplication of an FP8 by an FP4
+ *
+	@param x FP8 instance, on exit = y*a
+	@param y FP8 instance
+	@param a FP4 multiplier
+ */
+extern void FP8_pmul(FP8 *x, FP8 *y, FP4 *a);
+
+/**	@brief Multiplication of an FP8 by an FP2
+ *
+	@param x FP8 instance, on exit = y*a
+	@param y FP8 instance
+	@param a FP2 multiplier
+ */
+extern void FP8_qmul(FP8 *x, FP8 *y, FP2 *a);
+
+/**	@brief Multiplication of an FP8 by an FP
+ *
+	@param x FP8 instance, on exit = y*a
+	@param y FP8 instance
+	@param a FP multiplier
+ */
+extern void FP8_tmul(FP8 *x, FP8 *y, FP *a);
+
+
+
+/**	@brief Multiplication of an FP8 by a small integer
+ *
+	@param x FP8 instance, on exit = y*i
+	@param y FP8 instance
+	@param i an integer
+ */
+extern void FP8_imul(FP8 *x, FP8 *y, int i);
+/**	@brief Squaring an FP8
+ *
+	@param x FP8 instance, on exit = y^2
+	@param y FP8 instance
+ */
+extern void FP8_sqr(FP8 *x, FP8 *y);
+/**	@brief Multiplication of two FP8s
+ *
+	@param x FP8 instance, on exit = y*z
+	@param y FP8 instance
+	@param z FP8 instance
+ */
+extern void FP8_mul(FP8 *x, FP8 *y, FP8 *z);
+/**	@brief Inverting an FP8
+ *
+	@param x FP8 instance, on exit = 1/y
+	@param y FP8 instance
+    @param h optional input hint
+ */
+extern void FP8_inv(FP8 *x, FP8 *y, FP *h);
+/**	@brief Formats and outputs an FP8 to the console
+ *
+	@param x FP8 instance to be printed
+ */
+extern void FP8_output(FP8 *x);
+/**	@brief Divide an FP8 by 2
+ *
+	@param x FP8 instance, on exit = y/2
+	@param y FP8 instance
+ */
+extern void FP8_div2(FP8 *x, FP8 *y);
+
+/**	@brief Formats and outputs an FP8 to the console in raw form (for debugging)
+ *
+	@param x FP8 instance to be printed
+ */
+extern void FP8_rawoutput(FP8 *x);
+/**	@brief multiplies an FP8 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP8 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP8_times_i(FP8 *x);
+/**	@brief multiplies an FP8 instance by irreducible polynomial (1+sqrt(-1))
+ *
+	@param x FP8 instance, on exit = (1+sqrt(-1)*x
+ */
+extern void FP8_times_i2(FP8 *x);
+
+/**	@brief Normalises the components of an FP8
+ *
+	@param x FP8 instance to be normalised
+ */
+extern void FP8_norm(FP8 *x);
+/**	@brief Reduces all components of possibly unreduced FP8 mod Modulus
+ *
+	@param x FP8 instance, on exit reduced mod Modulus
+ */
+extern void FP8_reduce(FP8 *x);
+/**	@brief Raises an FP8 to the power of a BIG
+ *
+	@param x FP8 instance, on exit = y^b
+	@param y FP8 instance
+	@param b BIG number
+ */
+extern void FP8_pow(FP8 *x, FP8 *y, B288_60::BIG b);
+/**	@brief Raises an FP8 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP8 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP8_frob(FP8 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP8 instance, on exit = w*x-conj(x)*y+z
+	@param w FP8 instance
+	@param x FP8 instance
+	@param y FP8 instance
+	@param z FP8 instance
+ */
+extern void FP8_xtr_A(FP8 *r, FP8 *w, FP8 *x, FP8 *y, FP8 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP8 instance, on exit = x^2-2*conj(x)
+	@param x FP8 instance
+ */
+extern void FP8_xtr_D(FP8 *r, FP8 *x);
+/**	@brief Calculates FP8 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP8 instance, on exit = trace(w^b)
+	@param x FP8 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP8_xtr_pow(FP8 *r, FP8 *x, B288_60::BIG b);
+/**	@brief Calculates FP8 trace of c^a.d^b, where c and d are derived from FP8 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP8 instance, on exit = trace(c^a.d^b)
+	@param c FP8 instance, trace of an FP12
+	@param d FP8 instance, trace of an FP12
+	@param e FP8 instance, trace of an FP12
+	@param f FP8 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP8_xtr_pow2(FP8 *r, FP8 *c, FP8 *d, FP8 *e, FP8 *f, B288_60::BIG a, B288_60::BIG b);
+
+/**	@brief Test FP8 for QR
+ *
+	Square root
+	@param r FP8 instance
+    @param h optional generated hint
+	@return 1 r is a QR, otherwise 0
+ */
+extern int  FP8_qr(FP8 *r, FP *h);
+
+
+/**	@brief Calculate square root of an FP8
+ *
+	Square root
+	@param r FP8 instance, on exit = sqrt(x)
+	@param x FP8 instance
+    @param h optional input hint
+ */
+extern void  FP8_sqrt(FP8 *r, FP8 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP8 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP8 instance, set to y if s!=0
+	@param y another FP8 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP8_cmove(FP8 *x, FP8 *y, int s);
+
+
+/**	@brief Divide FP8 number by QNR
+ *
+	Divide FP8 by the QNR
+	@param x FP8 instance
+ */
+extern void FP8_div_i(FP8 *x);
+
+/**	@brief Generate random FP8
+ *
+	@param x random FP8 number
+	@param rng random number generator
+ */
+extern void FP8_rand(FP8 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp8_BLS48556.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp8_BLS48556.h
new file mode 100644
index 0000000..30eda14
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp8_BLS48556.h
@@ -0,0 +1,365 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP8_BLS48556_H
+#define FP8_BLS48556_H
+
+#include "fp4_BLS48556.h"
+#include "config_curve_BLS48556.h"
+
+using namespace core;
+
+namespace BLS48556 {
+
+/**
+	@brief FP8 Structure - towered over two FP4
+*/
+
+typedef struct
+{
+    FP4 a; /**< real part of FP8 */
+    FP4 b; /**< imaginary part of FP8 */
+} FP8;
+
+
+/* FP8 prototypes */
+/**	@brief Tests for FP8 equal to zero
+ *
+	@param x FP8 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP8_iszilch(FP8 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP8 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP8_islarger(FP8 *x);
+
+/**	@brief Serialize in FP8  
+ *
+    @param b buffer for output
+	@param x FP8 number to be serialized
+ */
+extern void FP8_toBytes(char *b,FP8 *x);
+/**	@brief Serialize out FP8  
+ *
+	@param x FP8 number to be serialized
+    @param b buffer for input
+ */
+extern void FP8_fromBytes(FP8 *x,char *b);
+
+
+/**	@brief Tests for FP8 equal to unity
+ *
+	@param x FP8 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP8_isunity(FP8 *x);
+/**	@brief Tests for equality of two FP8s
+ *
+	@param x FP8 instance to be compared
+	@param y FP8 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP8_equals(FP8 *x, FP8 *y);
+/**	@brief Tests for FP8 having only a real part and no imaginary part
+ *
+	@param x FP8 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP8_isreal(FP8 *x);
+/**	@brief Initialise FP8 from two FP4s
+ *
+	@param x FP8 instance to be initialised
+	@param a FP4 to form real part of FP8
+	@param b FP4 to form imaginary part of FP8
+ */
+extern void FP8_from_FP4s(FP8 *x, FP4 *a, FP4 *b);
+/**	@brief Initialise FP8 from single FP4
+ *
+	Imaginary part is set to zero
+	@param x FP8 instance to be initialised
+	@param a FP4 to form real part of FP8
+ */
+extern void FP8_from_FP4(FP8 *x, FP4 *a);
+
+/**	@brief Initialise FP8 from single FP4
+ *
+	real part is set to zero
+	@param x FP8 instance to be initialised
+	@param a FP4 to form imaginary part of FP8
+ */
+extern void FP8_from_FP4H(FP8 *x, FP4 *a);
+
+/**	@brief Initialise FP8 from single FP
+ *
+	@param x FP8 instance to be initialised
+	@param a FP to form real part of FP8
+ */
+extern void FP8_from_FP(FP8 *x, FP *a);
+
+/**	@brief Copy FP8 to another FP8
+ *
+	@param x FP8 instance, on exit = y
+	@param y FP8 instance to be copied
+ */
+extern void FP8_copy(FP8 *x, FP8 *y);
+
+/**	@brief Set FP8 to zero
+ *
+	@param x FP8 instance to be set to zero
+ */
+extern void FP8_zero(FP8 *x);
+/**	@brief Set FP8 to unity
+ *
+	@param x FP8 instance to be set to one
+ */
+extern void FP8_one(FP8 *x);
+
+/**	@brief Sign of FP8
+ *
+	@param x FP8 instance
+	@return "sign" of FP8
+ */
+extern int FP8_sign(FP8 *x);
+
+/**	@brief Negation of FP8
+ *
+	@param x FP8 instance, on exit = -y
+	@param y FP8 instance
+ */
+extern void FP8_neg(FP8 *x, FP8 *y);
+/**	@brief Conjugation of FP8
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP8 instance, on exit = conj(y)
+	@param y FP8 instance
+ */
+extern void FP8_conj(FP8 *x, FP8 *y);
+/**	@brief Negative conjugation of FP8
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP8 instance, on exit = -conj(y)
+	@param y FP8 instance
+ */
+extern void FP8_nconj(FP8 *x, FP8 *y);
+/**	@brief addition of two FP8s
+ *
+	@param x FP8 instance, on exit = y+z
+	@param y FP8 instance
+	@param z FP8 instance
+ */
+extern void FP8_add(FP8 *x, FP8 *y, FP8 *z);
+/**	@brief subtraction of two FP8s
+ *
+	@param x FP8 instance, on exit = y-z
+	@param y FP8 instance
+	@param z FP8 instance
+ */
+extern void FP8_sub(FP8 *x, FP8 *y, FP8 *z);
+/**	@brief Multiplication of an FP8 by an FP4
+ *
+	@param x FP8 instance, on exit = y*a
+	@param y FP8 instance
+	@param a FP4 multiplier
+ */
+extern void FP8_pmul(FP8 *x, FP8 *y, FP4 *a);
+
+/**	@brief Multiplication of an FP8 by an FP2
+ *
+	@param x FP8 instance, on exit = y*a
+	@param y FP8 instance
+	@param a FP2 multiplier
+ */
+extern void FP8_qmul(FP8 *x, FP8 *y, FP2 *a);
+
+/**	@brief Multiplication of an FP8 by an FP
+ *
+	@param x FP8 instance, on exit = y*a
+	@param y FP8 instance
+	@param a FP multiplier
+ */
+extern void FP8_tmul(FP8 *x, FP8 *y, FP *a);
+
+
+
+/**	@brief Multiplication of an FP8 by a small integer
+ *
+	@param x FP8 instance, on exit = y*i
+	@param y FP8 instance
+	@param i an integer
+ */
+extern void FP8_imul(FP8 *x, FP8 *y, int i);
+/**	@brief Squaring an FP8
+ *
+	@param x FP8 instance, on exit = y^2
+	@param y FP8 instance
+ */
+extern void FP8_sqr(FP8 *x, FP8 *y);
+/**	@brief Multiplication of two FP8s
+ *
+	@param x FP8 instance, on exit = y*z
+	@param y FP8 instance
+	@param z FP8 instance
+ */
+extern void FP8_mul(FP8 *x, FP8 *y, FP8 *z);
+/**	@brief Inverting an FP8
+ *
+	@param x FP8 instance, on exit = 1/y
+	@param y FP8 instance
+    @param h optional input hint
+ */
+extern void FP8_inv(FP8 *x, FP8 *y, FP *h);
+/**	@brief Formats and outputs an FP8 to the console
+ *
+	@param x FP8 instance to be printed
+ */
+extern void FP8_output(FP8 *x);
+/**	@brief Divide an FP8 by 2
+ *
+	@param x FP8 instance, on exit = y/2
+	@param y FP8 instance
+ */
+extern void FP8_div2(FP8 *x, FP8 *y);
+
+/**	@brief Formats and outputs an FP8 to the console in raw form (for debugging)
+ *
+	@param x FP8 instance to be printed
+ */
+extern void FP8_rawoutput(FP8 *x);
+/**	@brief multiplies an FP8 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP8 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP8_times_i(FP8 *x);
+/**	@brief multiplies an FP8 instance by irreducible polynomial (1+sqrt(-1))
+ *
+	@param x FP8 instance, on exit = (1+sqrt(-1)*x
+ */
+extern void FP8_times_i2(FP8 *x);
+
+/**	@brief Normalises the components of an FP8
+ *
+	@param x FP8 instance to be normalised
+ */
+extern void FP8_norm(FP8 *x);
+/**	@brief Reduces all components of possibly unreduced FP8 mod Modulus
+ *
+	@param x FP8 instance, on exit reduced mod Modulus
+ */
+extern void FP8_reduce(FP8 *x);
+/**	@brief Raises an FP8 to the power of a BIG
+ *
+	@param x FP8 instance, on exit = y^b
+	@param y FP8 instance
+	@param b BIG number
+ */
+extern void FP8_pow(FP8 *x, FP8 *y, B560_58::BIG b);
+/**	@brief Raises an FP8 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP8 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP8_frob(FP8 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP8 instance, on exit = w*x-conj(x)*y+z
+	@param w FP8 instance
+	@param x FP8 instance
+	@param y FP8 instance
+	@param z FP8 instance
+ */
+extern void FP8_xtr_A(FP8 *r, FP8 *w, FP8 *x, FP8 *y, FP8 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP8 instance, on exit = x^2-2*conj(x)
+	@param x FP8 instance
+ */
+extern void FP8_xtr_D(FP8 *r, FP8 *x);
+/**	@brief Calculates FP8 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP8 instance, on exit = trace(w^b)
+	@param x FP8 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP8_xtr_pow(FP8 *r, FP8 *x, B560_58::BIG b);
+/**	@brief Calculates FP8 trace of c^a.d^b, where c and d are derived from FP8 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP8 instance, on exit = trace(c^a.d^b)
+	@param c FP8 instance, trace of an FP12
+	@param d FP8 instance, trace of an FP12
+	@param e FP8 instance, trace of an FP12
+	@param f FP8 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP8_xtr_pow2(FP8 *r, FP8 *c, FP8 *d, FP8 *e, FP8 *f, B560_58::BIG a, B560_58::BIG b);
+
+/**	@brief Test FP8 for QR
+ *
+	Square root
+	@param r FP8 instance
+    @param h optional generated hint
+	@return 1 r is a QR, otherwise 0
+ */
+extern int  FP8_qr(FP8 *r, FP *h);
+
+
+/**	@brief Calculate square root of an FP8
+ *
+	Square root
+	@param r FP8 instance, on exit = sqrt(x)
+	@param x FP8 instance
+    @param h optional input hint
+ */
+extern void  FP8_sqrt(FP8 *r, FP8 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP8 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP8 instance, set to y if s!=0
+	@param y another FP8 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP8_cmove(FP8 *x, FP8 *y, int s);
+
+
+/**	@brief Divide FP8 number by QNR
+ *
+	Divide FP8 by the QNR
+	@param x FP8 instance
+ */
+extern void FP8_div_i(FP8 *x);
+
+/**	@brief Generate random FP8
+ *
+	@param x random FP8 number
+	@param rng random number generator
+ */
+extern void FP8_rand(FP8 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp8_BLS48581.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp8_BLS48581.h
new file mode 100644
index 0000000..3a56ea4
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp8_BLS48581.h
@@ -0,0 +1,365 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP8_BLS48581_H
+#define FP8_BLS48581_H
+
+#include "fp4_BLS48581.h"
+#include "config_curve_BLS48581.h"
+
+using namespace core;
+
+namespace BLS48581 {
+
+/**
+	@brief FP8 Structure - towered over two FP4
+*/
+
+typedef struct
+{
+    FP4 a; /**< real part of FP8 */
+    FP4 b; /**< imaginary part of FP8 */
+} FP8;
+
+
+/* FP8 prototypes */
+/**	@brief Tests for FP8 equal to zero
+ *
+	@param x FP8 number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP8_iszilch(FP8 *x);
+
+/**	@brief Tests for lexically larger 
+ *
+	@param x FP8 number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP8_islarger(FP8 *x);
+
+/**	@brief Serialize in FP8  
+ *
+    @param b buffer for output
+	@param x FP8 number to be serialized
+ */
+extern void FP8_toBytes(char *b,FP8 *x);
+/**	@brief Serialize out FP8  
+ *
+	@param x FP8 number to be serialized
+    @param b buffer for input
+ */
+extern void FP8_fromBytes(FP8 *x,char *b);
+
+
+/**	@brief Tests for FP8 equal to unity
+ *
+	@param x FP8 number to be tested
+	@return 1 if unity, else returns 0
+ */
+extern int FP8_isunity(FP8 *x);
+/**	@brief Tests for equality of two FP8s
+ *
+	@param x FP8 instance to be compared
+	@param y FP8 instance to be compared
+	@return 1 if x=y, else returns 0
+ */
+extern int FP8_equals(FP8 *x, FP8 *y);
+/**	@brief Tests for FP8 having only a real part and no imaginary part
+ *
+	@param x FP8 number to be tested
+	@return 1 if real, else returns 0
+ */
+extern int FP8_isreal(FP8 *x);
+/**	@brief Initialise FP8 from two FP4s
+ *
+	@param x FP8 instance to be initialised
+	@param a FP4 to form real part of FP8
+	@param b FP4 to form imaginary part of FP8
+ */
+extern void FP8_from_FP4s(FP8 *x, FP4 *a, FP4 *b);
+/**	@brief Initialise FP8 from single FP4
+ *
+	Imaginary part is set to zero
+	@param x FP8 instance to be initialised
+	@param a FP4 to form real part of FP8
+ */
+extern void FP8_from_FP4(FP8 *x, FP4 *a);
+
+/**	@brief Initialise FP8 from single FP4
+ *
+	real part is set to zero
+	@param x FP8 instance to be initialised
+	@param a FP4 to form imaginary part of FP8
+ */
+extern void FP8_from_FP4H(FP8 *x, FP4 *a);
+
+/**	@brief Initialise FP8 from single FP
+ *
+	@param x FP8 instance to be initialised
+	@param a FP to form real part of FP8
+ */
+extern void FP8_from_FP(FP8 *x, FP *a);
+
+/**	@brief Copy FP8 to another FP8
+ *
+	@param x FP8 instance, on exit = y
+	@param y FP8 instance to be copied
+ */
+extern void FP8_copy(FP8 *x, FP8 *y);
+
+/**	@brief Set FP8 to zero
+ *
+	@param x FP8 instance to be set to zero
+ */
+extern void FP8_zero(FP8 *x);
+/**	@brief Set FP8 to unity
+ *
+	@param x FP8 instance to be set to one
+ */
+extern void FP8_one(FP8 *x);
+
+/**	@brief Sign of FP8
+ *
+	@param x FP8 instance
+	@return "sign" of FP8
+ */
+extern int FP8_sign(FP8 *x);
+
+/**	@brief Negation of FP8
+ *
+	@param x FP8 instance, on exit = -y
+	@param y FP8 instance
+ */
+extern void FP8_neg(FP8 *x, FP8 *y);
+/**	@brief Conjugation of FP8
+ *
+	If y=(a,b) on exit x=(a,-b)
+	@param x FP8 instance, on exit = conj(y)
+	@param y FP8 instance
+ */
+extern void FP8_conj(FP8 *x, FP8 *y);
+/**	@brief Negative conjugation of FP8
+ *
+	If y=(a,b) on exit x=(-a,b)
+	@param x FP8 instance, on exit = -conj(y)
+	@param y FP8 instance
+ */
+extern void FP8_nconj(FP8 *x, FP8 *y);
+/**	@brief addition of two FP8s
+ *
+	@param x FP8 instance, on exit = y+z
+	@param y FP8 instance
+	@param z FP8 instance
+ */
+extern void FP8_add(FP8 *x, FP8 *y, FP8 *z);
+/**	@brief subtraction of two FP8s
+ *
+	@param x FP8 instance, on exit = y-z
+	@param y FP8 instance
+	@param z FP8 instance
+ */
+extern void FP8_sub(FP8 *x, FP8 *y, FP8 *z);
+/**	@brief Multiplication of an FP8 by an FP4
+ *
+	@param x FP8 instance, on exit = y*a
+	@param y FP8 instance
+	@param a FP4 multiplier
+ */
+extern void FP8_pmul(FP8 *x, FP8 *y, FP4 *a);
+
+/**	@brief Multiplication of an FP8 by an FP2
+ *
+	@param x FP8 instance, on exit = y*a
+	@param y FP8 instance
+	@param a FP2 multiplier
+ */
+extern void FP8_qmul(FP8 *x, FP8 *y, FP2 *a);
+
+/**	@brief Multiplication of an FP8 by an FP
+ *
+	@param x FP8 instance, on exit = y*a
+	@param y FP8 instance
+	@param a FP multiplier
+ */
+extern void FP8_tmul(FP8 *x, FP8 *y, FP *a);
+
+
+
+/**	@brief Multiplication of an FP8 by a small integer
+ *
+	@param x FP8 instance, on exit = y*i
+	@param y FP8 instance
+	@param i an integer
+ */
+extern void FP8_imul(FP8 *x, FP8 *y, int i);
+/**	@brief Squaring an FP8
+ *
+	@param x FP8 instance, on exit = y^2
+	@param y FP8 instance
+ */
+extern void FP8_sqr(FP8 *x, FP8 *y);
+/**	@brief Multiplication of two FP8s
+ *
+	@param x FP8 instance, on exit = y*z
+	@param y FP8 instance
+	@param z FP8 instance
+ */
+extern void FP8_mul(FP8 *x, FP8 *y, FP8 *z);
+/**	@brief Inverting an FP8
+ *
+	@param x FP8 instance, on exit = 1/y
+	@param y FP8 instance
+    @param h optional input hint
+ */
+extern void FP8_inv(FP8 *x, FP8 *y, FP *h);
+/**	@brief Formats and outputs an FP8 to the console
+ *
+	@param x FP8 instance to be printed
+ */
+extern void FP8_output(FP8 *x);
+/**	@brief Divide an FP8 by 2
+ *
+	@param x FP8 instance, on exit = y/2
+	@param y FP8 instance
+ */
+extern void FP8_div2(FP8 *x, FP8 *y);
+
+/**	@brief Formats and outputs an FP8 to the console in raw form (for debugging)
+ *
+	@param x FP8 instance to be printed
+ */
+extern void FP8_rawoutput(FP8 *x);
+/**	@brief multiplies an FP8 instance by irreducible polynomial sqrt(1+sqrt(-1))
+ *
+	@param x FP8 instance, on exit = sqrt(1+sqrt(-1)*x
+ */
+extern void FP8_times_i(FP8 *x);
+/**	@brief multiplies an FP8 instance by irreducible polynomial (1+sqrt(-1))
+ *
+	@param x FP8 instance, on exit = (1+sqrt(-1)*x
+ */
+extern void FP8_times_i2(FP8 *x);
+
+/**	@brief Normalises the components of an FP8
+ *
+	@param x FP8 instance to be normalised
+ */
+extern void FP8_norm(FP8 *x);
+/**	@brief Reduces all components of possibly unreduced FP8 mod Modulus
+ *
+	@param x FP8 instance, on exit reduced mod Modulus
+ */
+extern void FP8_reduce(FP8 *x);
+/**	@brief Raises an FP8 to the power of a BIG
+ *
+	@param x FP8 instance, on exit = y^b
+	@param y FP8 instance
+	@param b BIG number
+ */
+extern void FP8_pow(FP8 *x, FP8 *y, B584_60::BIG b);
+/**	@brief Raises an FP8 to the power of the internal modulus p, using the Frobenius
+ *
+	@param x FP8 instance, on exit = x^p
+	@param f FP2 precalculated Frobenius constant
+ */
+extern void FP8_frob(FP8 *x, FP2 *f);
+/**	@brief Calculates the XTR addition function r=w*x-conj(x)*y+z
+ *
+	@param r FP8 instance, on exit = w*x-conj(x)*y+z
+	@param w FP8 instance
+	@param x FP8 instance
+	@param y FP8 instance
+	@param z FP8 instance
+ */
+extern void FP8_xtr_A(FP8 *r, FP8 *w, FP8 *x, FP8 *y, FP8 *z);
+/**	@brief Calculates the XTR doubling function r=x^2-2*conj(x)
+ *
+	@param r FP8 instance, on exit = x^2-2*conj(x)
+	@param x FP8 instance
+ */
+extern void FP8_xtr_D(FP8 *r, FP8 *x);
+/**	@brief Calculates FP8 trace of an FP12 raised to the power of a BIG number
+ *
+	XTR single exponentiation
+	@param r FP8 instance, on exit = trace(w^b)
+	@param x FP8 instance, trace of an FP12 w
+	@param b BIG number
+ */
+extern void FP8_xtr_pow(FP8 *r, FP8 *x, B584_60::BIG b);
+/**	@brief Calculates FP8 trace of c^a.d^b, where c and d are derived from FP8 traces of FP12s
+ *
+	XTR double exponentiation
+	Assumes c=tr(x^m), d=tr(x^n), e=tr(x^(m-n)), f=tr(x^(m-2n))
+	@param r FP8 instance, on exit = trace(c^a.d^b)
+	@param c FP8 instance, trace of an FP12
+	@param d FP8 instance, trace of an FP12
+	@param e FP8 instance, trace of an FP12
+	@param f FP8 instance, trace of an FP12
+	@param a BIG number
+	@param b BIG number
+ */
+extern void FP8_xtr_pow2(FP8 *r, FP8 *c, FP8 *d, FP8 *e, FP8 *f, B584_60::BIG a, B584_60::BIG b);
+
+/**	@brief Test FP8 for QR
+ *
+	Square root
+	@param r FP8 instance
+    @param h optional generated hint
+	@return 1 r is a QR, otherwise 0
+ */
+extern int  FP8_qr(FP8 *r, FP *h);
+
+
+/**	@brief Calculate square root of an FP8
+ *
+	Square root
+	@param r FP8 instance, on exit = sqrt(x)
+	@param x FP8 instance
+    @param h optional input hint
+ */
+extern void  FP8_sqrt(FP8 *r, FP8 *x, FP *h);
+
+
+/**	@brief Conditional copy of FP8 number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x FP8 instance, set to y if s!=0
+	@param y another FP8 instance
+	@param s copy only takes place if not equal to 0
+ */
+extern void FP8_cmove(FP8 *x, FP8 *y, int s);
+
+
+/**	@brief Divide FP8 number by QNR
+ *
+	Divide FP8 by the QNR
+	@param x FP8 instance
+ */
+extern void FP8_div_i(FP8 *x);
+
+/**	@brief Generate random FP8
+ *
+	@param x random FP8 number
+	@param rng random number generator
+ */
+extern void FP8_rand(FP8 *x, core::csprng *rng);
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_ANSSI.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_ANSSI.h
new file mode 100644
index 0000000..f5731e5
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_ANSSI.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_ANSSI_H
+#define FP_ANSSI_H
+
+#include "big_B256_56.h"
+#include "config_field_ANSSI.h"
+
+using namespace core;
+
+#define MODBITS_ANSSI MBITS_ANSSI
+#define TBITS_ANSSI (MBITS_ANSSI%BASEBITS_B256_56)              /**< Number of active bits in top word */
+#define TMASK_ANSSI (((chunk)1<<TBITS_ANSSI)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_ANSSI (((sign32)1<<MAXXES_ANSSI)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_ANSSI (-((chunk)(1)<<TBITS_ANSSI))            /**<  for masking out overflow bits */
+
+namespace ANSSI {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B256_56::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B256_56::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B256_56::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B256_56::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B256_56::BIG SQRTm3;      /**< Square root of -3 */
+extern const B256_56::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B256_56::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B256_56::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B256_56::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B256_56::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B256_56::BIG r, B256_56::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B256_56::BIG, B256_56::BIG, B256_56::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B256_56::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_BLS12381.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_BLS12381.h
new file mode 100644
index 0000000..456c1c7
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_BLS12381.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_BLS12381_H
+#define FP_BLS12381_H
+
+#include "big_B384_58.h"
+#include "config_field_BLS12381.h"
+
+using namespace core;
+
+#define MODBITS_BLS12381 MBITS_BLS12381
+#define TBITS_BLS12381 (MBITS_BLS12381%BASEBITS_B384_58)              /**< Number of active bits in top word */
+#define TMASK_BLS12381 (((chunk)1<<TBITS_BLS12381)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_BLS12381 (((sign32)1<<MAXXES_BLS12381)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_BLS12381 (-((chunk)(1)<<TBITS_BLS12381))            /**<  for masking out overflow bits */
+
+namespace BLS12381 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B384_58::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B384_58::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B384_58::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B384_58::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B384_58::BIG SQRTm3;      /**< Square root of -3 */
+extern const B384_58::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B384_58::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B384_58::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B384_58::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B384_58::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B384_58::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B384_58::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B384_58::BIG r, B384_58::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B384_58::BIG, B384_58::BIG, B384_58::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B384_58::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_BLS12383.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_BLS12383.h
new file mode 100644
index 0000000..335a69c
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_BLS12383.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_BLS12383_H
+#define FP_BLS12383_H
+
+#include "big_B384_58.h"
+#include "config_field_BLS12383.h"
+
+using namespace core;
+
+#define MODBITS_BLS12383 MBITS_BLS12383
+#define TBITS_BLS12383 (MBITS_BLS12383%BASEBITS_B384_58)              /**< Number of active bits in top word */
+#define TMASK_BLS12383 (((chunk)1<<TBITS_BLS12383)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_BLS12383 (((sign32)1<<MAXXES_BLS12383)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_BLS12383 (-((chunk)(1)<<TBITS_BLS12383))            /**<  for masking out overflow bits */
+
+namespace BLS12383 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B384_58::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B384_58::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B384_58::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B384_58::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B384_58::BIG SQRTm3;      /**< Square root of -3 */
+extern const B384_58::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B384_58::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B384_58::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B384_58::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B384_58::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B384_58::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B384_58::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B384_58::BIG r, B384_58::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B384_58::BIG, B384_58::BIG, B384_58::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B384_58::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_BLS12443.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_BLS12443.h
new file mode 100644
index 0000000..87362be
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_BLS12443.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_BLS12443_H
+#define FP_BLS12443_H
+
+#include "big_B448_60.h"
+#include "config_field_BLS12443.h"
+
+using namespace core;
+
+#define MODBITS_BLS12443 MBITS_BLS12443
+#define TBITS_BLS12443 (MBITS_BLS12443%BASEBITS_B448_60)              /**< Number of active bits in top word */
+#define TMASK_BLS12443 (((chunk)1<<TBITS_BLS12443)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_BLS12443 (((sign32)1<<MAXXES_BLS12443)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_BLS12443 (-((chunk)(1)<<TBITS_BLS12443))            /**<  for masking out overflow bits */
+
+namespace BLS12443 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B448_60::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B448_60::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B448_60::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B448_60::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B448_60::BIG SQRTm3;      /**< Square root of -3 */
+extern const B448_60::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B448_60::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B448_60::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B448_60::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B448_60::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B448_60::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B448_60::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B448_60::BIG r, B448_60::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B448_60::BIG, B448_60::BIG, B448_60::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B448_60::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_BLS12461.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_BLS12461.h
new file mode 100644
index 0000000..4bdcd80
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_BLS12461.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_BLS12461_H
+#define FP_BLS12461_H
+
+#include "big_B464_60.h"
+#include "config_field_BLS12461.h"
+
+using namespace core;
+
+#define MODBITS_BLS12461 MBITS_BLS12461
+#define TBITS_BLS12461 (MBITS_BLS12461%BASEBITS_B464_60)              /**< Number of active bits in top word */
+#define TMASK_BLS12461 (((chunk)1<<TBITS_BLS12461)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_BLS12461 (((sign32)1<<MAXXES_BLS12461)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_BLS12461 (-((chunk)(1)<<TBITS_BLS12461))            /**<  for masking out overflow bits */
+
+namespace BLS12461 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B464_60::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B464_60::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B464_60::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B464_60::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B464_60::BIG SQRTm3;      /**< Square root of -3 */
+extern const B464_60::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B464_60::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B464_60::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B464_60::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B464_60::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B464_60::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B464_60::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B464_60::BIG r, B464_60::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B464_60::BIG, B464_60::BIG, B464_60::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B464_60::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_BLS24479.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_BLS24479.h
new file mode 100644
index 0000000..2d00fa9
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_BLS24479.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_BLS24479_H
+#define FP_BLS24479_H
+
+#include "big_B480_56.h"
+#include "config_field_BLS24479.h"
+
+using namespace core;
+
+#define MODBITS_BLS24479 MBITS_BLS24479
+#define TBITS_BLS24479 (MBITS_BLS24479%BASEBITS_B480_56)              /**< Number of active bits in top word */
+#define TMASK_BLS24479 (((chunk)1<<TBITS_BLS24479)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_BLS24479 (((sign32)1<<MAXXES_BLS24479)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_BLS24479 (-((chunk)(1)<<TBITS_BLS24479))            /**<  for masking out overflow bits */
+
+namespace BLS24479 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B480_56::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B480_56::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B480_56::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B480_56::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B480_56::BIG SQRTm3;      /**< Square root of -3 */
+extern const B480_56::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B480_56::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B480_56::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B480_56::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B480_56::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B480_56::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B480_56::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B480_56::BIG r, B480_56::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B480_56::BIG, B480_56::BIG, B480_56::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B480_56::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_BLS48286.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_BLS48286.h
new file mode 100644
index 0000000..f165d34
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_BLS48286.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_BLS48286_H
+#define FP_BLS48286_H
+
+#include "big_B288_60.h"
+#include "config_field_BLS48286.h"
+
+using namespace core;
+
+#define MODBITS_BLS48286 MBITS_BLS48286
+#define TBITS_BLS48286 (MBITS_BLS48286%BASEBITS_B288_60)              /**< Number of active bits in top word */
+#define TMASK_BLS48286 (((chunk)1<<TBITS_BLS48286)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_BLS48286 (((sign32)1<<MAXXES_BLS48286)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_BLS48286 (-((chunk)(1)<<TBITS_BLS48286))            /**<  for masking out overflow bits */
+
+namespace BLS48286 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B288_60::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B288_60::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B288_60::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B288_60::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B288_60::BIG SQRTm3;      /**< Square root of -3 */
+extern const B288_60::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B288_60::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B288_60::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B288_60::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B288_60::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B288_60::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B288_60::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B288_60::BIG r, B288_60::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B288_60::BIG, B288_60::BIG, B288_60::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B288_60::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_BLS48556.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_BLS48556.h
new file mode 100644
index 0000000..3a39d17
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_BLS48556.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_BLS48556_H
+#define FP_BLS48556_H
+
+#include "big_B560_58.h"
+#include "config_field_BLS48556.h"
+
+using namespace core;
+
+#define MODBITS_BLS48556 MBITS_BLS48556
+#define TBITS_BLS48556 (MBITS_BLS48556%BASEBITS_B560_58)              /**< Number of active bits in top word */
+#define TMASK_BLS48556 (((chunk)1<<TBITS_BLS48556)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_BLS48556 (((sign32)1<<MAXXES_BLS48556)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_BLS48556 (-((chunk)(1)<<TBITS_BLS48556))            /**<  for masking out overflow bits */
+
+namespace BLS48556 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B560_58::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B560_58::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B560_58::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B560_58::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B560_58::BIG SQRTm3;      /**< Square root of -3 */
+extern const B560_58::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B560_58::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B560_58::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B560_58::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B560_58::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B560_58::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B560_58::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B560_58::BIG r, B560_58::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B560_58::BIG, B560_58::BIG, B560_58::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B560_58::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_BLS48581.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_BLS48581.h
new file mode 100644
index 0000000..eb941f0
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_BLS48581.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_BLS48581_H
+#define FP_BLS48581_H
+
+#include "big_B584_60.h"
+#include "config_field_BLS48581.h"
+
+using namespace core;
+
+#define MODBITS_BLS48581 MBITS_BLS48581
+#define TBITS_BLS48581 (MBITS_BLS48581%BASEBITS_B584_60)              /**< Number of active bits in top word */
+#define TMASK_BLS48581 (((chunk)1<<TBITS_BLS48581)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_BLS48581 (((sign32)1<<MAXXES_BLS48581)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_BLS48581 (-((chunk)(1)<<TBITS_BLS48581))            /**<  for masking out overflow bits */
+
+namespace BLS48581 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B584_60::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B584_60::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B584_60::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B584_60::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B584_60::BIG SQRTm3;      /**< Square root of -3 */
+extern const B584_60::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B584_60::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B584_60::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B584_60::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B584_60::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B584_60::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B584_60::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B584_60::BIG r, B584_60::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B584_60::BIG, B584_60::BIG, B584_60::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B584_60::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_BN158.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_BN158.h
new file mode 100644
index 0000000..8278f85
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_BN158.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_BN158_H
+#define FP_BN158_H
+
+#include "big_B160_56.h"
+#include "config_field_BN158.h"
+
+using namespace core;
+
+#define MODBITS_BN158 MBITS_BN158
+#define TBITS_BN158 (MBITS_BN158%BASEBITS_B160_56)              /**< Number of active bits in top word */
+#define TMASK_BN158 (((chunk)1<<TBITS_BN158)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_BN158 (((sign32)1<<MAXXES_BN158)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_BN158 (-((chunk)(1)<<TBITS_BN158))            /**<  for masking out overflow bits */
+
+namespace BN158 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B160_56::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B160_56::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B160_56::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B160_56::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B160_56::BIG SQRTm3;      /**< Square root of -3 */
+extern const B160_56::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B160_56::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B160_56::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B160_56::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B160_56::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B160_56::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B160_56::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B160_56::BIG r, B160_56::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B160_56::BIG, B160_56::BIG, B160_56::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B160_56::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_BN254.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_BN254.h
new file mode 100644
index 0000000..5992a0e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_BN254.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_BN254_H
+#define FP_BN254_H
+
+#include "big_B256_56.h"
+#include "config_field_BN254.h"
+
+using namespace core;
+
+#define MODBITS_BN254 MBITS_BN254
+#define TBITS_BN254 (MBITS_BN254%BASEBITS_B256_56)              /**< Number of active bits in top word */
+#define TMASK_BN254 (((chunk)1<<TBITS_BN254)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_BN254 (((sign32)1<<MAXXES_BN254)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_BN254 (-((chunk)(1)<<TBITS_BN254))            /**<  for masking out overflow bits */
+
+namespace BN254 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B256_56::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B256_56::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B256_56::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B256_56::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B256_56::BIG SQRTm3;      /**< Square root of -3 */
+extern const B256_56::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B256_56::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B256_56::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B256_56::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B256_56::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B256_56::BIG r, B256_56::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B256_56::BIG, B256_56::BIG, B256_56::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B256_56::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_BN254CX.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_BN254CX.h
new file mode 100644
index 0000000..5c02527
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_BN254CX.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_BN254CX_H
+#define FP_BN254CX_H
+
+#include "big_B256_56.h"
+#include "config_field_BN254CX.h"
+
+using namespace core;
+
+#define MODBITS_BN254CX MBITS_BN254CX
+#define TBITS_BN254CX (MBITS_BN254CX%BASEBITS_B256_56)              /**< Number of active bits in top word */
+#define TMASK_BN254CX (((chunk)1<<TBITS_BN254CX)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_BN254CX (((sign32)1<<MAXXES_BN254CX)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_BN254CX (-((chunk)(1)<<TBITS_BN254CX))            /**<  for masking out overflow bits */
+
+namespace BN254CX {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B256_56::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B256_56::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B256_56::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B256_56::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B256_56::BIG SQRTm3;      /**< Square root of -3 */
+extern const B256_56::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B256_56::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B256_56::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B256_56::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B256_56::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B256_56::BIG r, B256_56::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B256_56::BIG, B256_56::BIG, B256_56::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B256_56::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_BN462.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_BN462.h
new file mode 100644
index 0000000..3d71e61
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_BN462.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_BN462_H
+#define FP_BN462_H
+
+#include "big_B464_60.h"
+#include "config_field_BN462.h"
+
+using namespace core;
+
+#define MODBITS_BN462 MBITS_BN462
+#define TBITS_BN462 (MBITS_BN462%BASEBITS_B464_60)              /**< Number of active bits in top word */
+#define TMASK_BN462 (((chunk)1<<TBITS_BN462)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_BN462 (((sign32)1<<MAXXES_BN462)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_BN462 (-((chunk)(1)<<TBITS_BN462))            /**<  for masking out overflow bits */
+
+namespace BN462 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B464_60::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B464_60::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B464_60::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B464_60::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B464_60::BIG SQRTm3;      /**< Square root of -3 */
+extern const B464_60::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B464_60::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B464_60::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B464_60::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B464_60::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B464_60::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B464_60::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B464_60::BIG r, B464_60::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B464_60::BIG, B464_60::BIG, B464_60::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B464_60::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_BRAINPOOL.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_BRAINPOOL.h
new file mode 100644
index 0000000..11d7739
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_BRAINPOOL.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_BRAINPOOL_H
+#define FP_BRAINPOOL_H
+
+#include "big_B256_56.h"
+#include "config_field_BRAINPOOL.h"
+
+using namespace core;
+
+#define MODBITS_BRAINPOOL MBITS_BRAINPOOL
+#define TBITS_BRAINPOOL (MBITS_BRAINPOOL%BASEBITS_B256_56)              /**< Number of active bits in top word */
+#define TMASK_BRAINPOOL (((chunk)1<<TBITS_BRAINPOOL)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_BRAINPOOL (((sign32)1<<MAXXES_BRAINPOOL)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_BRAINPOOL (-((chunk)(1)<<TBITS_BRAINPOOL))            /**<  for masking out overflow bits */
+
+namespace BRAINPOOL {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B256_56::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B256_56::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B256_56::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B256_56::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B256_56::BIG SQRTm3;      /**< Square root of -3 */
+extern const B256_56::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B256_56::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B256_56::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B256_56::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B256_56::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B256_56::BIG r, B256_56::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B256_56::BIG, B256_56::BIG, B256_56::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B256_56::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_C1174.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_C1174.h
new file mode 100644
index 0000000..3b576bd
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_C1174.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_C1174_H
+#define FP_C1174_H
+
+#include "big_B256_56.h"
+#include "config_field_C1174.h"
+
+using namespace core;
+
+#define MODBITS_C1174 MBITS_C1174
+#define TBITS_C1174 (MBITS_C1174%BASEBITS_B256_56)              /**< Number of active bits in top word */
+#define TMASK_C1174 (((chunk)1<<TBITS_C1174)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_C1174 (((sign32)1<<MAXXES_C1174)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_C1174 (-((chunk)(1)<<TBITS_C1174))            /**<  for masking out overflow bits */
+
+namespace C1174 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B256_56::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B256_56::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B256_56::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B256_56::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B256_56::BIG SQRTm3;      /**< Square root of -3 */
+extern const B256_56::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B256_56::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B256_56::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B256_56::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B256_56::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B256_56::BIG r, B256_56::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B256_56::BIG, B256_56::BIG, B256_56::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B256_56::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_C1665.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_C1665.h
new file mode 100644
index 0000000..a878bf0
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_C1665.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_C1665_H
+#define FP_C1665_H
+
+#include "big_B168_60.h"
+#include "config_field_C1665.h"
+
+using namespace core;
+
+#define MODBITS_C1665 MBITS_C1665
+#define TBITS_C1665 (MBITS_C1665%BASEBITS_B168_60)              /**< Number of active bits in top word */
+#define TMASK_C1665 (((chunk)1<<TBITS_C1665)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_C1665 (((sign32)1<<MAXXES_C1665)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_C1665 (-((chunk)(1)<<TBITS_C1665))            /**<  for masking out overflow bits */
+
+namespace C1665 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B168_60::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B168_60::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B168_60::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B168_60::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B168_60::BIG SQRTm3;      /**< Square root of -3 */
+extern const B168_60::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B168_60::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B168_60::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B168_60::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B168_60::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B168_60::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B168_60::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B168_60::BIG r, B168_60::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B168_60::BIG, B168_60::BIG, B168_60::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B168_60::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_C41417.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_C41417.h
new file mode 100644
index 0000000..3511b39
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_C41417.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_C41417_H
+#define FP_C41417_H
+
+#include "big_B416_60.h"
+#include "config_field_C41417.h"
+
+using namespace core;
+
+#define MODBITS_C41417 MBITS_C41417
+#define TBITS_C41417 (MBITS_C41417%BASEBITS_B416_60)              /**< Number of active bits in top word */
+#define TMASK_C41417 (((chunk)1<<TBITS_C41417)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_C41417 (((sign32)1<<MAXXES_C41417)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_C41417 (-((chunk)(1)<<TBITS_C41417))            /**<  for masking out overflow bits */
+
+namespace C41417 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B416_60::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B416_60::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B416_60::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B416_60::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B416_60::BIG SQRTm3;      /**< Square root of -3 */
+extern const B416_60::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B416_60::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B416_60::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B416_60::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B416_60::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B416_60::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B416_60::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B416_60::BIG r, B416_60::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B416_60::BIG, B416_60::BIG, B416_60::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B416_60::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_F25519.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_F25519.h
new file mode 100644
index 0000000..11acd30
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_F25519.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_F25519_H
+#define FP_F25519_H
+
+#include "big_B256_56.h"
+#include "config_field_F25519.h"
+
+using namespace core;
+
+#define MODBITS_F25519 MBITS_F25519
+#define TBITS_F25519 (MBITS_F25519%BASEBITS_B256_56)              /**< Number of active bits in top word */
+#define TMASK_F25519 (((chunk)1<<TBITS_F25519)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_F25519 (((sign32)1<<MAXXES_F25519)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_F25519 (-((chunk)(1)<<TBITS_F25519))            /**<  for masking out overflow bits */
+
+namespace F25519 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B256_56::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B256_56::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B256_56::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B256_56::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B256_56::BIG SQRTm3;      /**< Square root of -3 */
+extern const B256_56::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B256_56::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B256_56::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B256_56::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B256_56::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B256_56::BIG r, B256_56::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B256_56::BIG, B256_56::BIG, B256_56::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B256_56::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_F256PME.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_F256PME.h
new file mode 100644
index 0000000..8cfee23
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_F256PME.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_F256PME_H
+#define FP_F256PME_H
+
+#include "big_B256_56.h"
+#include "config_field_F256PME.h"
+
+using namespace core;
+
+#define MODBITS_F256PME MBITS_F256PME
+#define TBITS_F256PME (MBITS_F256PME%BASEBITS_B256_56)              /**< Number of active bits in top word */
+#define TMASK_F256PME (((chunk)1<<TBITS_F256PME)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_F256PME (((sign32)1<<MAXXES_F256PME)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_F256PME (-((chunk)(1)<<TBITS_F256PME))            /**<  for masking out overflow bits */
+
+namespace F256PME {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B256_56::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B256_56::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B256_56::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B256_56::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B256_56::BIG SQRTm3;      /**< Square root of -3 */
+extern const B256_56::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B256_56::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B256_56::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B256_56::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B256_56::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B256_56::BIG r, B256_56::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B256_56::BIG, B256_56::BIG, B256_56::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B256_56::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_F256PMW.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_F256PMW.h
new file mode 100644
index 0000000..ad0fb22
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_F256PMW.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_F256PMW_H
+#define FP_F256PMW_H
+
+#include "big_B256_56.h"
+#include "config_field_F256PMW.h"
+
+using namespace core;
+
+#define MODBITS_F256PMW MBITS_F256PMW
+#define TBITS_F256PMW (MBITS_F256PMW%BASEBITS_B256_56)              /**< Number of active bits in top word */
+#define TMASK_F256PMW (((chunk)1<<TBITS_F256PMW)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_F256PMW (((sign32)1<<MAXXES_F256PMW)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_F256PMW (-((chunk)(1)<<TBITS_F256PMW))            /**<  for masking out overflow bits */
+
+namespace F256PMW {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B256_56::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B256_56::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B256_56::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B256_56::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B256_56::BIG SQRTm3;      /**< Square root of -3 */
+extern const B256_56::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B256_56::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B256_56::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B256_56::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B256_56::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B256_56::BIG r, B256_56::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B256_56::BIG, B256_56::BIG, B256_56::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B256_56::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_F384PM.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_F384PM.h
new file mode 100644
index 0000000..9cdcbb4
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_F384PM.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_F384PM_H
+#define FP_F384PM_H
+
+#include "big_B384_58.h"
+#include "config_field_F384PM.h"
+
+using namespace core;
+
+#define MODBITS_F384PM MBITS_F384PM
+#define TBITS_F384PM (MBITS_F384PM%BASEBITS_B384_58)              /**< Number of active bits in top word */
+#define TMASK_F384PM (((chunk)1<<TBITS_F384PM)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_F384PM (((sign32)1<<MAXXES_F384PM)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_F384PM (-((chunk)(1)<<TBITS_F384PM))            /**<  for masking out overflow bits */
+
+namespace F384PM {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B384_58::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B384_58::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B384_58::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B384_58::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B384_58::BIG SQRTm3;      /**< Square root of -3 */
+extern const B384_58::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B384_58::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B384_58::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B384_58::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B384_58::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B384_58::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B384_58::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B384_58::BIG r, B384_58::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B384_58::BIG, B384_58::BIG, B384_58::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B384_58::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_F448.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_F448.h
new file mode 100644
index 0000000..f95f03f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_F448.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_F448_H
+#define FP_F448_H
+
+#include "big_B448_58.h"
+#include "config_field_F448.h"
+
+using namespace core;
+
+#define MODBITS_F448 MBITS_F448
+#define TBITS_F448 (MBITS_F448%BASEBITS_B448_58)              /**< Number of active bits in top word */
+#define TMASK_F448 (((chunk)1<<TBITS_F448)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_F448 (((sign32)1<<MAXXES_F448)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_F448 (-((chunk)(1)<<TBITS_F448))            /**<  for masking out overflow bits */
+
+namespace F448 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B448_58::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B448_58::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B448_58::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B448_58::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B448_58::BIG SQRTm3;      /**< Square root of -3 */
+extern const B448_58::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B448_58::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B448_58::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B448_58::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B448_58::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B448_58::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B448_58::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B448_58::BIG r, B448_58::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B448_58::BIG, B448_58::BIG, B448_58::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B448_58::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_F512PM.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_F512PM.h
new file mode 100644
index 0000000..77c3add
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_F512PM.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_F512PM_H
+#define FP_F512PM_H
+
+#include "big_B512_60.h"
+#include "config_field_F512PM.h"
+
+using namespace core;
+
+#define MODBITS_F512PM MBITS_F512PM
+#define TBITS_F512PM (MBITS_F512PM%BASEBITS_B512_60)              /**< Number of active bits in top word */
+#define TMASK_F512PM (((chunk)1<<TBITS_F512PM)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_F512PM (((sign32)1<<MAXXES_F512PM)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_F512PM (-((chunk)(1)<<TBITS_F512PM))            /**<  for masking out overflow bits */
+
+namespace F512PM {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B512_60::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B512_60::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B512_60::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B512_60::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B512_60::BIG SQRTm3;      /**< Square root of -3 */
+extern const B512_60::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B512_60::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B512_60::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B512_60::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B512_60::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B512_60::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B512_60::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B512_60::BIG r, B512_60::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B512_60::BIG, B512_60::BIG, B512_60::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B512_60::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_FP256BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_FP256BN.h
new file mode 100644
index 0000000..3da61bb
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_FP256BN.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_FP256BN_H
+#define FP_FP256BN_H
+
+#include "big_B256_56.h"
+#include "config_field_FP256BN.h"
+
+using namespace core;
+
+#define MODBITS_FP256BN MBITS_FP256BN
+#define TBITS_FP256BN (MBITS_FP256BN%BASEBITS_B256_56)              /**< Number of active bits in top word */
+#define TMASK_FP256BN (((chunk)1<<TBITS_FP256BN)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_FP256BN (((sign32)1<<MAXXES_FP256BN)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_FP256BN (-((chunk)(1)<<TBITS_FP256BN))            /**<  for masking out overflow bits */
+
+namespace FP256BN {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B256_56::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B256_56::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B256_56::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B256_56::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B256_56::BIG SQRTm3;      /**< Square root of -3 */
+extern const B256_56::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B256_56::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B256_56::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B256_56::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B256_56::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B256_56::BIG r, B256_56::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B256_56::BIG, B256_56::BIG, B256_56::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B256_56::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_FP512BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_FP512BN.h
new file mode 100644
index 0000000..bb1429a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_FP512BN.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_FP512BN_H
+#define FP_FP512BN_H
+
+#include "big_B512_60.h"
+#include "config_field_FP512BN.h"
+
+using namespace core;
+
+#define MODBITS_FP512BN MBITS_FP512BN
+#define TBITS_FP512BN (MBITS_FP512BN%BASEBITS_B512_60)              /**< Number of active bits in top word */
+#define TMASK_FP512BN (((chunk)1<<TBITS_FP512BN)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_FP512BN (((sign32)1<<MAXXES_FP512BN)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_FP512BN (-((chunk)(1)<<TBITS_FP512BN))            /**<  for masking out overflow bits */
+
+namespace FP512BN {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B512_60::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B512_60::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B512_60::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B512_60::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B512_60::BIG SQRTm3;      /**< Square root of -3 */
+extern const B512_60::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B512_60::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B512_60::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B512_60::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B512_60::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B512_60::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B512_60::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B512_60::BIG r, B512_60::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B512_60::BIG, B512_60::BIG, B512_60::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B512_60::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_HIFIVE.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_HIFIVE.h
new file mode 100644
index 0000000..a1824fb
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_HIFIVE.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_HIFIVE_H
+#define FP_HIFIVE_H
+
+#include "big_B336_60.h"
+#include "config_field_HIFIVE.h"
+
+using namespace core;
+
+#define MODBITS_HIFIVE MBITS_HIFIVE
+#define TBITS_HIFIVE (MBITS_HIFIVE%BASEBITS_B336_60)              /**< Number of active bits in top word */
+#define TMASK_HIFIVE (((chunk)1<<TBITS_HIFIVE)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_HIFIVE (((sign32)1<<MAXXES_HIFIVE)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_HIFIVE (-((chunk)(1)<<TBITS_HIFIVE))            /**<  for masking out overflow bits */
+
+namespace HIFIVE {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B336_60::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B336_60::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B336_60::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B336_60::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B336_60::BIG SQRTm3;      /**< Square root of -3 */
+extern const B336_60::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B336_60::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B336_60::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B336_60::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B336_60::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B336_60::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B336_60::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B336_60::BIG r, B336_60::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B336_60::BIG, B336_60::BIG, B336_60::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B336_60::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_JUBJUB.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_JUBJUB.h
new file mode 100644
index 0000000..e5f48a3
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_JUBJUB.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_JUBJUB_H
+#define FP_JUBJUB_H
+
+#include "big_B256_56.h"
+#include "config_field_JUBJUB.h"
+
+using namespace core;
+
+#define MODBITS_JUBJUB MBITS_JUBJUB
+#define TBITS_JUBJUB (MBITS_JUBJUB%BASEBITS_B256_56)              /**< Number of active bits in top word */
+#define TMASK_JUBJUB (((chunk)1<<TBITS_JUBJUB)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_JUBJUB (((sign32)1<<MAXXES_JUBJUB)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_JUBJUB (-((chunk)(1)<<TBITS_JUBJUB))            /**<  for masking out overflow bits */
+
+namespace JUBJUB {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B256_56::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B256_56::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B256_56::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B256_56::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B256_56::BIG SQRTm3;      /**< Square root of -3 */
+extern const B256_56::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B256_56::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B256_56::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B256_56::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B256_56::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B256_56::BIG r, B256_56::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B256_56::BIG, B256_56::BIG, B256_56::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B256_56::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_MDC.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_MDC.h
new file mode 100644
index 0000000..738617e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_MDC.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_MDC_H
+#define FP_MDC_H
+
+#include "big_B256_56.h"
+#include "config_field_MDC.h"
+
+using namespace core;
+
+#define MODBITS_MDC MBITS_MDC
+#define TBITS_MDC (MBITS_MDC%BASEBITS_B256_56)              /**< Number of active bits in top word */
+#define TMASK_MDC (((chunk)1<<TBITS_MDC)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_MDC (((sign32)1<<MAXXES_MDC)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_MDC (-((chunk)(1)<<TBITS_MDC))            /**<  for masking out overflow bits */
+
+namespace MDC {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B256_56::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B256_56::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B256_56::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B256_56::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B256_56::BIG SQRTm3;      /**< Square root of -3 */
+extern const B256_56::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B256_56::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B256_56::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B256_56::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B256_56::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B256_56::BIG r, B256_56::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B256_56::BIG, B256_56::BIG, B256_56::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B256_56::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_NIST256.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_NIST256.h
new file mode 100644
index 0000000..9cedbb7
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_NIST256.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_NIST256_H
+#define FP_NIST256_H
+
+#include "big_B256_56.h"
+#include "config_field_NIST256.h"
+
+using namespace core;
+
+#define MODBITS_NIST256 MBITS_NIST256
+#define TBITS_NIST256 (MBITS_NIST256%BASEBITS_B256_56)              /**< Number of active bits in top word */
+#define TMASK_NIST256 (((chunk)1<<TBITS_NIST256)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_NIST256 (((sign32)1<<MAXXES_NIST256)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_NIST256 (-((chunk)(1)<<TBITS_NIST256))            /**<  for masking out overflow bits */
+
+namespace NIST256 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B256_56::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B256_56::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B256_56::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B256_56::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B256_56::BIG SQRTm3;      /**< Square root of -3 */
+extern const B256_56::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B256_56::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B256_56::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B256_56::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B256_56::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B256_56::BIG r, B256_56::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B256_56::BIG, B256_56::BIG, B256_56::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B256_56::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_NIST384.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_NIST384.h
new file mode 100644
index 0000000..c6f6700
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_NIST384.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_NIST384_H
+#define FP_NIST384_H
+
+#include "big_B384_56.h"
+#include "config_field_NIST384.h"
+
+using namespace core;
+
+#define MODBITS_NIST384 MBITS_NIST384
+#define TBITS_NIST384 (MBITS_NIST384%BASEBITS_B384_56)              /**< Number of active bits in top word */
+#define TMASK_NIST384 (((chunk)1<<TBITS_NIST384)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_NIST384 (((sign32)1<<MAXXES_NIST384)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_NIST384 (-((chunk)(1)<<TBITS_NIST384))            /**<  for masking out overflow bits */
+
+namespace NIST384 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B384_56::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B384_56::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B384_56::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B384_56::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B384_56::BIG SQRTm3;      /**< Square root of -3 */
+extern const B384_56::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B384_56::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B384_56::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B384_56::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B384_56::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B384_56::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B384_56::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B384_56::BIG r, B384_56::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B384_56::BIG, B384_56::BIG, B384_56::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B384_56::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_NIST521.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_NIST521.h
new file mode 100644
index 0000000..5d51463
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_NIST521.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_NIST521_H
+#define FP_NIST521_H
+
+#include "big_B528_60.h"
+#include "config_field_NIST521.h"
+
+using namespace core;
+
+#define MODBITS_NIST521 MBITS_NIST521
+#define TBITS_NIST521 (MBITS_NIST521%BASEBITS_B528_60)              /**< Number of active bits in top word */
+#define TMASK_NIST521 (((chunk)1<<TBITS_NIST521)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_NIST521 (((sign32)1<<MAXXES_NIST521)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_NIST521 (-((chunk)(1)<<TBITS_NIST521))            /**<  for masking out overflow bits */
+
+namespace NIST521 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B528_60::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B528_60::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B528_60::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B528_60::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B528_60::BIG SQRTm3;      /**< Square root of -3 */
+extern const B528_60::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B528_60::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B528_60::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B528_60::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B528_60::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B528_60::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B528_60::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B528_60::BIG r, B528_60::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B528_60::BIG, B528_60::BIG, B528_60::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B528_60::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_SECP160R1.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_SECP160R1.h
new file mode 100644
index 0000000..8dc19b5
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_SECP160R1.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_SECP160R1_H
+#define FP_SECP160R1_H
+
+#include "big_B160_56.h"
+#include "config_field_SECP160R1.h"
+
+using namespace core;
+
+#define MODBITS_SECP160R1 MBITS_SECP160R1
+#define TBITS_SECP160R1 (MBITS_SECP160R1%BASEBITS_B160_56)              /**< Number of active bits in top word */
+#define TMASK_SECP160R1 (((chunk)1<<TBITS_SECP160R1)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_SECP160R1 (((sign32)1<<MAXXES_SECP160R1)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_SECP160R1 (-((chunk)(1)<<TBITS_SECP160R1))            /**<  for masking out overflow bits */
+
+namespace SECP160R1 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B160_56::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B160_56::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B160_56::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B160_56::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B160_56::BIG SQRTm3;      /**< Square root of -3 */
+extern const B160_56::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B160_56::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B160_56::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B160_56::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B160_56::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B160_56::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B160_56::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B160_56::BIG r, B160_56::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B160_56::BIG, B160_56::BIG, B160_56::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B160_56::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_SECP256K1.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_SECP256K1.h
new file mode 100644
index 0000000..c283745
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_SECP256K1.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_SECP256K1_H
+#define FP_SECP256K1_H
+
+#include "big_B256_56.h"
+#include "config_field_SECP256K1.h"
+
+using namespace core;
+
+#define MODBITS_SECP256K1 MBITS_SECP256K1
+#define TBITS_SECP256K1 (MBITS_SECP256K1%BASEBITS_B256_56)              /**< Number of active bits in top word */
+#define TMASK_SECP256K1 (((chunk)1<<TBITS_SECP256K1)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_SECP256K1 (((sign32)1<<MAXXES_SECP256K1)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_SECP256K1 (-((chunk)(1)<<TBITS_SECP256K1))            /**<  for masking out overflow bits */
+
+namespace SECP256K1 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B256_56::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B256_56::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B256_56::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B256_56::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B256_56::BIG SQRTm3;      /**< Square root of -3 */
+extern const B256_56::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B256_56::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B256_56::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B256_56::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B256_56::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B256_56::BIG r, B256_56::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B256_56::BIG, B256_56::BIG, B256_56::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B256_56::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_SM2.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_SM2.h
new file mode 100644
index 0000000..968a50a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_SM2.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_SM2_H
+#define FP_SM2_H
+
+#include "big_B256_56.h"
+#include "config_field_SM2.h"
+
+using namespace core;
+
+#define MODBITS_SM2 MBITS_SM2
+#define TBITS_SM2 (MBITS_SM2%BASEBITS_B256_56)              /**< Number of active bits in top word */
+#define TMASK_SM2 (((chunk)1<<TBITS_SM2)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_SM2 (((sign32)1<<MAXXES_SM2)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_SM2 (-((chunk)(1)<<TBITS_SM2))            /**<  for masking out overflow bits */
+
+namespace SM2 {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B256_56::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B256_56::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B256_56::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B256_56::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B256_56::BIG SQRTm3;      /**< Square root of -3 */
+extern const B256_56::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B256_56::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B256_56::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B256_56::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B256_56::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B256_56::BIG r, B256_56::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B256_56::BIG, B256_56::BIG, B256_56::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B256_56::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_TWEEDLEDEE.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_TWEEDLEDEE.h
new file mode 100644
index 0000000..ecd0a04
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_TWEEDLEDEE.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_TWEEDLEDEE_H
+#define FP_TWEEDLEDEE_H
+
+#include "big_B256_56.h"
+#include "config_field_TWEEDLEDEE.h"
+
+using namespace core;
+
+#define MODBITS_TWEEDLEDEE MBITS_TWEEDLEDEE
+#define TBITS_TWEEDLEDEE (MBITS_TWEEDLEDEE%BASEBITS_B256_56)              /**< Number of active bits in top word */
+#define TMASK_TWEEDLEDEE (((chunk)1<<TBITS_TWEEDLEDEE)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_TWEEDLEDEE (((sign32)1<<MAXXES_TWEEDLEDEE)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_TWEEDLEDEE (-((chunk)(1)<<TBITS_TWEEDLEDEE))            /**<  for masking out overflow bits */
+
+namespace TWEEDLEDEE {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B256_56::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B256_56::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B256_56::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B256_56::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B256_56::BIG SQRTm3;      /**< Square root of -3 */
+extern const B256_56::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B256_56::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B256_56::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B256_56::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B256_56::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B256_56::BIG r, B256_56::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B256_56::BIG, B256_56::BIG, B256_56::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B256_56::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_TWEEDLEDUM.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_TWEEDLEDUM.h
new file mode 100644
index 0000000..72a1f55
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/fp_TWEEDLEDUM.h
@@ -0,0 +1,334 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef FP_TWEEDLEDUM_H
+#define FP_TWEEDLEDUM_H
+
+#include "big_B256_56.h"
+#include "config_field_TWEEDLEDUM.h"
+
+using namespace core;
+
+#define MODBITS_TWEEDLEDUM MBITS_TWEEDLEDUM
+#define TBITS_TWEEDLEDUM (MBITS_TWEEDLEDUM%BASEBITS_B256_56)              /**< Number of active bits in top word */
+#define TMASK_TWEEDLEDUM (((chunk)1<<TBITS_TWEEDLEDUM)-1)             /**< Mask for active bits in top word */
+#define FEXCESS_TWEEDLEDUM (((sign32)1<<MAXXES_TWEEDLEDUM)-1)		    /**< 2^(BASEBITS*NLEN-MODBITS) - normalised BIG can be multiplied by less than this before reduction */
+#define OMASK_TWEEDLEDUM (-((chunk)(1)<<TBITS_TWEEDLEDUM))            /**<  for masking out overflow bits */
+
+namespace TWEEDLEDUM {
+
+/**
+	@brief FP Structure - quadratic extension field
+*/
+
+typedef struct
+{
+    B256_56::BIG g;	/**< Big representation of field element */
+    sign32 XES;	/**< Excess */
+} FP;
+
+/* Field Params - see rom.c */
+extern const B256_56::BIG Modulus;	/**< Actual Modulus set in rom_field*.c */
+extern const B256_56::BIG ROI;	    /**< Root of Unity  set in rom_field*.c */
+extern const B256_56::BIG R2modp;	/**< Montgomery constant */
+extern const chunk MConst;		/**< Constant associated with Modulus - for Montgomery = 1/p mod 2^BASEBITS */
+extern const B256_56::BIG SQRTm3;      /**< Square root of -3 */
+extern const B256_56::BIG CRu;    /**< Cube Root of Unity */
+//extern const int BTset;			/**< Set Bit in Generalised Mersenne */
+extern const B256_56::BIG Fra; /**< real part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG Frb; /**< imaginary part of Pairing-friendly curve Frobenius Constant */
+extern const B256_56::BIG TWK; /**< Tweak for square roots, pre-calculated from field norm */
+//#define FUSED_MODMUL
+//#define DEBUG_REDUCE
+
+/* FP prototypes */
+
+/**	@brief Create FP from integer
+ *
+	@param x FP to be initialised
+	@param a integer
+ */
+extern void FP_from_int(FP *x,int a);
+
+
+/**	@brief Tests for FP equal to zero mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if zero, else returns 0
+ */
+extern int FP_iszilch(FP *x);
+
+/**	@brief Tests for lexically largest 
+ *
+	@param x FP number to be tested if larger than -x
+	@return 1 if larger, else returns 0
+ */
+extern int FP_islarger(FP *x);
+
+/**	@brief Serialize out FP  
+ *
+    @param b buffer for output
+	@param x FP number to be serialized
+ */
+extern void FP_toBytes(char *b,FP *x);
+
+/**	@brief Serialize in FP  
+ *
+	@param x FP number to be serialized
+    @param b buffer for input
+ */
+extern void FP_fromBytes(FP *x,char *b);
+
+/**	@brief Tests for FP equal to one mod Modulus
+ *
+	@param x FP number to be tested
+	@return 1 if one, else returns 0
+ */
+extern int FP_isunity(FP *x);
+
+/**	@brief Set FP to zero
+ *
+	@param x FP number to be set to 0
+ */
+extern void FP_zero(FP *x);
+
+/**	@brief Copy an FP
+ *
+	@param y FP number to be copied to
+	@param x FP to be copied from
+ */
+extern void FP_copy(FP *y, FP *x);
+
+/**	@brief Copy from ROM to an FP
+ *
+	@param y FP number to be copied to
+	@param x BIG to be copied from ROM
+ */
+extern void FP_rcopy(FP *y, const B256_56::BIG x);
+
+
+/**	@brief Compares two FPs
+ *
+	@param x FP number
+	@param y FP number
+	@return 1 if equal, else returns 0
+ */
+extern int FP_equals(FP *x, FP *y);
+
+
+/**	@brief Conditional constant time swap of two FP numbers
+ *
+	Conditionally swaps parameters in constant time (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s swap takes place if not equal to 0
+ */
+extern void FP_cswap(FP *x, FP *y, int s);
+/**	@brief Conditional copy of FP number
+ *
+	Conditionally copies second parameter to the first (without branching)
+	@param x an FP number
+	@param y another FP number
+	@param s copy takes place if not equal to 0
+ */
+extern void FP_cmove(FP *x, FP *y, int s);
+/**	@brief Converts from BIG integer to residue form mod Modulus
+ *
+	@param x BIG number to be converted
+	@param y FP result
+ */
+extern void FP_nres(FP *y, B256_56::BIG x);
+/**	@brief Converts from residue form back to BIG integer form
+ *
+	@param y FP number to be converted to BIG
+	@param x BIG result
+ */
+extern void FP_redc(B256_56::BIG x, FP *y);
+/**	@brief Sets FP to representation of unity in residue form
+ *
+	@param x FP number to be set equal to unity.
+ */
+extern void FP_one(FP *x);
+
+/**	@brief returns "sign" of an FP
+ *
+	@param x FP number
+    @return 0 for positive, 1 for negative
+ */
+extern int FP_sign(FP *x);
+
+
+/**	@brief Reduces DBIG to BIG exploiting special form of the modulus
+ *
+	This function comes in different flavours depending on the form of Modulus that is currently in use.
+	@param r BIG number, on exit = d mod Modulus
+	@param d DBIG number to be reduced
+ */
+extern void FP_mod(B256_56::BIG r, B256_56::DBIG d);
+
+#ifdef FUSED_MODMUL
+extern void FP_modmul(B256_56::BIG, B256_56::BIG, B256_56::BIG);
+#endif
+
+/**	@brief Fast Modular multiplication of two FPs, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y*z mod Modulus
+	@param y FP number, the multiplicand
+	@param z FP number, the multiplier
+ */
+extern void FP_mul(FP *x, FP *y, FP *z);
+/**	@brief Fast Modular multiplication of an FP, by a small integer, mod Modulus
+ *
+	@param x FP number, on exit the modular product = y*i mod Modulus
+	@param y FP number, the multiplicand
+	@param i a small number, the multiplier
+ */
+extern void FP_imul(FP *x, FP *y, int i);
+/**	@brief Fast Modular squaring of an FP, mod Modulus
+ *
+	Uses appropriate fast modular reduction method
+	@param x FP number, on exit the modular product = y^2 mod Modulus
+	@param y FP number, the number to be squared
+
+ */
+extern void FP_sqr(FP *x, FP *y);
+/**	@brief Modular addition of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular sum = y+z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_add(FP *x, FP *y, FP *z);
+/**	@brief Modular subtraction of two FPs, mod Modulus
+ *
+	@param x FP number, on exit the modular difference = y-z mod Modulus
+	@param y FP number
+	@param z FP number
+ */
+extern void FP_sub(FP *x, FP *y, FP *z);
+/**	@brief Modular division by 2 of an FP, mod Modulus
+ *
+	@param x FP number, on exit =y/2 mod Modulus
+	@param y FP number
+ */
+extern void FP_div2(FP *x, FP *y);
+/**	@brief Fast Modular exponentiation of an FP, to the power of a BIG, mod Modulus
+ *
+	@param x FP number, on exit  = y^z mod Modulus
+	@param y FP number
+	@param z BIG number exponent
+ */
+extern void FP_pow(FP *x, FP *y, B256_56::BIG z);
+
+/**	@brief Inverse square root precalculation
+ *
+	@param r FP number, on exit  = x^(p-2*e-1)/2^(e+1) mod Modulus
+	@param x FP number
+ */
+extern void FP_progen(FP *r,FP *x);
+
+/**	@brief Fast Modular square root of a an FP, mod Modulus
+ *
+	@param x FP number, on exit  = sqrt(y) mod Modulus
+	@param y FP number, the number whose square root is calculated
+    @param h an optional input precalculation
+ */
+extern void FP_sqrt(FP *x, FP *y, FP *h);
+
+/**	@brief Modular negation of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = -y mod Modulus
+	@param y FP number
+
+ */
+extern void FP_neg(FP *x, FP *y);
+/**	@brief Outputs an FP number to the console
+ *
+	Converts from residue form before output
+	@param x an FP number
+ */
+extern void FP_output(FP *x);
+/**	@brief Outputs an FP number to the console, in raw form
+ *
+	@param x a BIG number
+ */
+extern void FP_rawoutput(FP *x);
+/**	@brief Reduces possibly unreduced FP mod Modulus
+ *
+	@param x FP number, on exit reduced mod Modulus
+ */
+extern void FP_reduce(FP *x);
+/**	@brief normalizes FP
+ *
+	@param x FP number, on exit normalized
+ */
+extern void FP_norm(FP *x);
+/**	@brief Tests for FP a quadratic residue mod Modulus
+ *
+	@param x FP number to be tested
+    @param h an optional output precalculation
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_qr(FP *x,FP *h);
+
+
+/**	@brief Simultaneous Inverse and Square root
+ *
+	@param i FP number, on exit = 1/x mod Modulus
+	@param s FP number, on exit = sqrt(x) mod Modulus
+	@param x FP number
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_invsqrt(FP *i,FP *s,FP *x);
+
+/**	@brief Simultaneous Inverse and Square root of different numbers
+ *
+	@param i FP number, on exit = 1/i mod Modulus
+	@param s FP number, on exit = sqrt(s) mod Modulus
+	@return 1 if quadratic residue, else returns 0 if quadratic non-residue
+ */
+extern int FP_tpo(FP* i, FP* s);
+
+
+/**	@brief Modular inverse of a an FP, mod Modulus
+ *
+	@param x FP number, on exit = 1/y mod Modulus
+	@param y FP number
+    @param h an optional input precalculation
+ */
+extern void FP_inv(FP *x, FP *y, FP *h);
+
+/**	@brief Special exponent of an FP, mod Modulus
+ *
+	@param x FP number, on exit = x^s mod Modulus
+	@param y FP number
+ */
+extern void FP_fpow(FP *x, FP *y);
+
+/**	@brief Generate random FP
+ *
+	@param x random FP number
+	@param rng random number generator
+ */
+extern void FP_rand(FP *x, core::csprng *rng);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke.h
new file mode 100644
index 0000000..db21187
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_ZZZ_H
+#define HPKE_ZZZ_H
+
+#include "ecdh_ZZZ.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace ZZZ {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_ANSSI.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_ANSSI.h
new file mode 100644
index 0000000..4109afe
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_ANSSI.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_ANSSI_H
+#define HPKE_ANSSI_H
+
+#include "ecdh_ANSSI.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace ANSSI {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_BLS12381.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_BLS12381.h
new file mode 100644
index 0000000..5f5e935
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_BLS12381.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_BLS12381_H
+#define HPKE_BLS12381_H
+
+#include "ecdh_BLS12381.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace BLS12381 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_BLS12383.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_BLS12383.h
new file mode 100644
index 0000000..3263597
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_BLS12383.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_BLS12383_H
+#define HPKE_BLS12383_H
+
+#include "ecdh_BLS12383.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace BLS12383 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_BLS12443.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_BLS12443.h
new file mode 100644
index 0000000..c23b2dc
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_BLS12443.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_BLS12443_H
+#define HPKE_BLS12443_H
+
+#include "ecdh_BLS12443.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace BLS12443 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_BLS12461.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_BLS12461.h
new file mode 100644
index 0000000..c5bd396
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_BLS12461.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_BLS12461_H
+#define HPKE_BLS12461_H
+
+#include "ecdh_BLS12461.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace BLS12461 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_BLS24479.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_BLS24479.h
new file mode 100644
index 0000000..17ec022
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_BLS24479.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_BLS24479_H
+#define HPKE_BLS24479_H
+
+#include "ecdh_BLS24479.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace BLS24479 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_BLS48286.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_BLS48286.h
new file mode 100644
index 0000000..dc98820
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_BLS48286.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_BLS48286_H
+#define HPKE_BLS48286_H
+
+#include "ecdh_BLS48286.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace BLS48286 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_BLS48556.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_BLS48556.h
new file mode 100644
index 0000000..582c973
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_BLS48556.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_BLS48556_H
+#define HPKE_BLS48556_H
+
+#include "ecdh_BLS48556.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace BLS48556 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_BLS48581.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_BLS48581.h
new file mode 100644
index 0000000..3de857d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_BLS48581.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_BLS48581_H
+#define HPKE_BLS48581_H
+
+#include "ecdh_BLS48581.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace BLS48581 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_BN158.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_BN158.h
new file mode 100644
index 0000000..63594e0
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_BN158.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_BN158_H
+#define HPKE_BN158_H
+
+#include "ecdh_BN158.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace BN158 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_BN254.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_BN254.h
new file mode 100644
index 0000000..df37ad5
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_BN254.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_BN254_H
+#define HPKE_BN254_H
+
+#include "ecdh_BN254.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace BN254 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_BN254CX.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_BN254CX.h
new file mode 100644
index 0000000..7f05bab
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_BN254CX.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_BN254CX_H
+#define HPKE_BN254CX_H
+
+#include "ecdh_BN254CX.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace BN254CX {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_BN462.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_BN462.h
new file mode 100644
index 0000000..c089594
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_BN462.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_BN462_H
+#define HPKE_BN462_H
+
+#include "ecdh_BN462.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace BN462 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_BRAINPOOL.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_BRAINPOOL.h
new file mode 100644
index 0000000..98cb67e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_BRAINPOOL.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_BRAINPOOL_H
+#define HPKE_BRAINPOOL_H
+
+#include "ecdh_BRAINPOOL.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace BRAINPOOL {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_C1174.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_C1174.h
new file mode 100644
index 0000000..2b8deea
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_C1174.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_C1174_H
+#define HPKE_C1174_H
+
+#include "ecdh_C1174.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace C1174 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_C13318.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_C13318.h
new file mode 100644
index 0000000..abeb21d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_C13318.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_C13318_H
+#define HPKE_C13318_H
+
+#include "ecdh_C13318.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace C13318 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_C1665.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_C1665.h
new file mode 100644
index 0000000..7a4a1ce
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_C1665.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_C1665_H
+#define HPKE_C1665_H
+
+#include "ecdh_C1665.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace C1665 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_C25519.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_C25519.h
new file mode 100644
index 0000000..921525a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_C25519.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_C25519_H
+#define HPKE_C25519_H
+
+#include "ecdh_C25519.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace C25519 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_C41417.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_C41417.h
new file mode 100644
index 0000000..8c703e0
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_C41417.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_C41417_H
+#define HPKE_C41417_H
+
+#include "ecdh_C41417.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace C41417 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_Ed25519.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_Ed25519.h
new file mode 100644
index 0000000..d5f32f5
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_Ed25519.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_Ed25519_H
+#define HPKE_Ed25519_H
+
+#include "ecdh_Ed25519.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace Ed25519 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_Ed448.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_Ed448.h
new file mode 100644
index 0000000..ca3df8c
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_Ed448.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_Ed448_H
+#define HPKE_Ed448_H
+
+#include "ecdh_Ed448.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace Ed448 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_FP256BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_FP256BN.h
new file mode 100644
index 0000000..57c15fa
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_FP256BN.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_FP256BN_H
+#define HPKE_FP256BN_H
+
+#include "ecdh_FP256BN.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace FP256BN {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_FP512BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_FP512BN.h
new file mode 100644
index 0000000..cc61f29
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_FP512BN.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_FP512BN_H
+#define HPKE_FP512BN_H
+
+#include "ecdh_FP512BN.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace FP512BN {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_HIFIVE.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_HIFIVE.h
new file mode 100644
index 0000000..ffb422d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_HIFIVE.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_HIFIVE_H
+#define HPKE_HIFIVE_H
+
+#include "ecdh_HIFIVE.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace HIFIVE {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_JUBJUB.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_JUBJUB.h
new file mode 100644
index 0000000..a70d73e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_JUBJUB.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_JUBJUB_H
+#define HPKE_JUBJUB_H
+
+#include "ecdh_JUBJUB.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace JUBJUB {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_MDC.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_MDC.h
new file mode 100644
index 0000000..1efff71
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_MDC.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_MDC_H
+#define HPKE_MDC_H
+
+#include "ecdh_MDC.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace MDC {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_NIST256.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_NIST256.h
new file mode 100644
index 0000000..52b958c
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_NIST256.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_NIST256_H
+#define HPKE_NIST256_H
+
+#include "ecdh_NIST256.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace NIST256 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_NIST384.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_NIST384.h
new file mode 100644
index 0000000..35d738a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_NIST384.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_NIST384_H
+#define HPKE_NIST384_H
+
+#include "ecdh_NIST384.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace NIST384 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_NIST521.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_NIST521.h
new file mode 100644
index 0000000..dd337ef
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_NIST521.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_NIST521_H
+#define HPKE_NIST521_H
+
+#include "ecdh_NIST521.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace NIST521 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_NUMS256E.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_NUMS256E.h
new file mode 100644
index 0000000..5fe75c8
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_NUMS256E.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_NUMS256E_H
+#define HPKE_NUMS256E_H
+
+#include "ecdh_NUMS256E.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace NUMS256E {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_NUMS256W.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_NUMS256W.h
new file mode 100644
index 0000000..f3df68a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_NUMS256W.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_NUMS256W_H
+#define HPKE_NUMS256W_H
+
+#include "ecdh_NUMS256W.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace NUMS256W {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_NUMS384E.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_NUMS384E.h
new file mode 100644
index 0000000..5b7eb9e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_NUMS384E.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_NUMS384E_H
+#define HPKE_NUMS384E_H
+
+#include "ecdh_NUMS384E.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace NUMS384E {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_NUMS384W.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_NUMS384W.h
new file mode 100644
index 0000000..c4de95e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_NUMS384W.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_NUMS384W_H
+#define HPKE_NUMS384W_H
+
+#include "ecdh_NUMS384W.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace NUMS384W {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_NUMS512E.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_NUMS512E.h
new file mode 100644
index 0000000..b193440
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_NUMS512E.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_NUMS512E_H
+#define HPKE_NUMS512E_H
+
+#include "ecdh_NUMS512E.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace NUMS512E {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_NUMS512W.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_NUMS512W.h
new file mode 100644
index 0000000..d70a9aa
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_NUMS512W.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_NUMS512W_H
+#define HPKE_NUMS512W_H
+
+#include "ecdh_NUMS512W.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace NUMS512W {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_SECP160R1.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_SECP160R1.h
new file mode 100644
index 0000000..521a895
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_SECP160R1.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_SECP160R1_H
+#define HPKE_SECP160R1_H
+
+#include "ecdh_SECP160R1.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace SECP160R1 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_SECP256K1.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_SECP256K1.h
new file mode 100644
index 0000000..9d85466
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_SECP256K1.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_SECP256K1_H
+#define HPKE_SECP256K1_H
+
+#include "ecdh_SECP256K1.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace SECP256K1 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_SM2.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_SM2.h
new file mode 100644
index 0000000..7237e51
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_SM2.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_SM2_H
+#define HPKE_SM2_H
+
+#include "ecdh_SM2.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace SM2 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_TWEEDLEDEE.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_TWEEDLEDEE.h
new file mode 100644
index 0000000..dbaa1e8
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_TWEEDLEDEE.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_TWEEDLEDEE_H
+#define HPKE_TWEEDLEDEE_H
+
+#include "ecdh_TWEEDLEDEE.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace TWEEDLEDEE {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_TWEEDLEDUM.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_TWEEDLEDUM.h
new file mode 100644
index 0000000..b9f8b40
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_TWEEDLEDUM.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_TWEEDLEDUM_H
+#define HPKE_TWEEDLEDUM_H
+
+#include "ecdh_TWEEDLEDUM.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace TWEEDLEDUM {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_X448.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_X448.h
new file mode 100644
index 0000000..05a934c
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/hpke_X448.h
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file hpke.h
+ * @author Mike Scott 
+ * @date 2nd December 2019
+ * @brief HPKE Header file
+ *
+ * declares functions
+ *
+ */
+
+#ifndef HPKE_X448_H
+#define HPKE_X448_H
+
+#include "ecdh_X448.h"
+
+using namespace core;
+
+//#define CONFIG_ID 0x2A // 01|01|010 = 1, 1, 2
+//#define KEM_ID 2  // Curve X25519
+//#define KEM_ID 3  // Curve X448
+//#define KDF_ID 1  // HKDF-SHA256
+//#define AEAD_ID 1 // AES-GCM-128
+
+#define HPKE_OK                     0   /**< Function completed without error */
+#define HPKE_INVALID_PUBLIC_KEY    -2	/**< Public Key is Invalid */
+#define HPKE_ERROR                 -3	/**< HPKE Internal Error */
+
+namespace X448 {
+
+static void LabeledExtract(octet *PRK,octet *SALT,octet *SUITE_ID,char *label,octet *IKM);
+static void LabeledExpand(octet *OKM,octet *PRK,octet *SUITE_ID,char *label,octet *INFO,int L);
+static void ExtractAndExpand(int config_id,octet *OKM,octet *DH,octet *CONTEXT);
+
+/* HPKE DHKEM primitives */
+
+/**	@brief Derive a Key Pair from a seed
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the output secret key
+    @param PK is the output public key
+    @param SEED is the input random seed
+    @return 1 if OK, 0 if failed
+ */
+extern int DeriveKeyPair(int config_id,octet *SK,octet *PK,octet *SEED);
+
+/**	@brief Encapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param SK is the input ephemeral secret
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the respondents public key
+ */
+extern void HPKE_Encap(int config_id,octet *SK,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR the respondents private key
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the respondents public key
+ */
+extern void HPKE_Decap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR);
+
+/**	@brief Encapsulate/Authenticate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skE is the input ephemeral secret 
+    @param skS is the Initiators private key 
+    @param Z is a pointer to a shared secret DH(skE,pkR)
+	@param pkE the ephemeral public key, which is skE.G, where G is a fixed generator
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthEncap(int config_id,octet *sKE,octet *skS,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief Decapsulate function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param skR is the Respondents private key 
+    @param Z is a pointer to a shared secret DH(skR,pkE)
+	@param pkE the ephemeral public key
+	@param pkR the Respondents public key
+    @param pkS the Initiators public key
+ */
+extern void HPKE_AuthDecap(int config_id,octet *skR,octet *Z,octet *pkE,octet *pkR,octet *pkS);
+
+/**	@brief KeyScheduler function
+ *
+    @param config_id is the configuration KEM/KDF/AEAD
+    @param key  the output key for aead encryption
+    @param nonce  the output nonce for aead encryption
+    @param exp_secret the exporter secret
+	@param mode  the mode of operation
+    @param Z the shared key
+    @param info application dependent info
+    @param psk pre-shared key
+    @param pskID identifier for the psk
+ */
+extern void HPKE_KeySchedule(int config_id,octet *key,octet *nonce,octet *exp_secret,int mode,octet *Z,octet *info,octet *psk,octet *pskID);
+
+}
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/kyber.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/kyber.h
new file mode 100644
index 0000000..08da3b8
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/kyber.h
@@ -0,0 +1,139 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* Kyber API */
+
+#ifndef KYBER_H
+#define KYBER_H
+
+#include "core.h"
+
+//q= 3329
+#define KY_LGN 8
+#define KY_DEGREE (1 << KY_LGN)
+#define KY_PRIME 0xD01
+
+#define KY_ONE 0x549		// R mod Q
+#define KY_QINV 62209   // q^(-1) mod 2^16
+
+#define KYBER_SECRET_CPA_SIZE_512 (2*(KY_DEGREE*3)/2)
+#define KYBER_PUBLIC_SIZE_512 (32+2*(KY_DEGREE*3)/2)
+#define KYBER_CIPHERTEXT_SIZE_512  ((10*2+4)*KY_DEGREE/8)
+#define KYBER_SECRET_CCA_SIZE_512 (KYBER_SECRET_CPA_SIZE_512+KYBER_PUBLIC_SIZE_512+64)
+#define KYBER_SHARED_SECRET_512 32
+
+#define KYBER_SECRET_CPA_SIZE_768 (3*(KY_DEGREE*3)/2)
+#define KYBER_PUBLIC_SIZE_768 (32+3*(KY_DEGREE*3)/2)
+#define KYBER_CIPHERTEXT_SIZE_768  ((10*3+4)*KY_DEGREE/8)
+#define KYBER_SECRET_CCA_SIZE_768 (KYBER_SECRET_CPA_SIZE_768+KYBER_PUBLIC_SIZE_768+64)
+#define KYBER_SHARED_SECRET_768 32
+
+#define KYBER_SECRET_CPA_SIZE_1024 (4*(KY_DEGREE*3)/2)
+#define KYBER_PUBLIC_SIZE_1024 (32+4*(KY_DEGREE*3)/2)
+#define KYBER_CIPHERTEXT_SIZE_1024  ((11*4+5)*KY_DEGREE/8)
+#define KYBER_SECRET_CCA_SIZE_1024 (KYBER_SECRET_CPA_SIZE_1024+KYBER_PUBLIC_SIZE_1024+64)
+#define KYBER_SHARED_SECRET_1024 32
+
+#define KY_MAXK 4
+
+namespace core {
+
+/** @brief Kyber KEM CCA key pair generation
+ *
+    @param r64 64 random bytes
+    @param SK secret key
+    @param PK public key
+
+ */
+extern void KYBER512_keypair(byte *r64,octet *SK,octet *PK);
+
+/** @brief Kyber KEM CCA encrypt
+ *
+    @param r32 32 random bytes
+    @param PK public key
+	@param SS random session key generated
+	@param CT ciphertext
+
+ */
+extern void KYBER512_encrypt(byte *r32,octet *PK,octet *SS,octet *CT);
+
+/** @brief Kyber KEM CCA decrypt
+ *
+    @param SK secret key
+	@param CT ciphertext
+	@param SS output session key 
+ */
+extern void KYBER512_decrypt(octet *SK,octet *CT,octet *SS);
+
+/** @brief Kyber KEM CCA key pair generation
+ *
+    @param r64 64 random bytes
+    @param SK secret key
+    @param PK public key
+
+ */
+extern void KYBER768_keypair(byte *r64,octet *SK,octet *PK);
+
+/** @brief Kyber KEM CCA encrypt
+ *
+    @param r32 32 random bytes
+    @param PK public key
+	@param SS random session key generated
+	@param CT ciphertext
+
+ */
+extern void KYBER768_encrypt(byte *r32,octet *PK,octet *SS,octet *CT);
+
+/** @brief Kyber KEM CCA decrypt
+ *
+    @param SK secret key
+	@param CT ciphertext
+	@param SS output session key 
+ */
+extern void KYBER768_decrypt(octet *SK,octet *CT,octet *SS);
+
+/** @brief Kyber KEM CCA key pair generation
+ *
+    @param r64 64 random bytes
+    @param SK secret key
+    @param PK public key
+
+ */
+extern void KYBER1024_keypair(byte *r64,octet *SK,octet *PK);
+
+/** @brief Kyber KEM CCA encrypt
+ *
+    @param r32 32 random bytes
+    @param PK public key
+	@param SS random session key generated
+	@param CT ciphertext
+
+ */
+extern void KYBER1024_encrypt(byte *r32,octet *PK,octet *SS,octet *CT);
+
+/** @brief Kyber KEM CCA decrypt
+ *
+    @param SK secret key
+	@param CT ciphertext
+	@param SS output session key 
+ */
+extern void KYBER1024_decrypt(octet *SK,octet *CT,octet *SS);
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/mpin.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/mpin.h
new file mode 100644
index 0000000..2ed645d
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/mpin.h
@@ -0,0 +1,136 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file mpin.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief M-Pin Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef MPIN_ZZZ_H
+#define MPIN_ZZZ_H
+
+#include "pair_ZZZ.h"
+//#include "pbc_support.h"
+
+using namespace core;
+
+
+namespace ZZZ {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define PGS_ZZZ MODBYTES_XXX  /**< MPIN Group Size */
+#define PFS_ZZZ MODBYTES_XXX  /**< MPIN Field Size */
+
+#define MPIN_OK             0   /**< Function completed without error */
+#define MPIN_INVALID_POINT  -14	/**< Point is NOT on the curve */
+#define MPIN_BAD_PIN        -19 /**< Bad PIN number entered */
+
+#define MAXPIN 10000         /**< max PIN */
+#define PBLEN 14             /**< max length of PIN in bits */
+
+//#define PAS_ZZZ 16        /**< MPIN Symmetric Key Size 128 bits */
+//#define HASH_TYPE_MPIN_ZZZ SHA256   /**< Choose Hash function */
+
+/* MPIN support functions */
+
+/* MPIN primitives */
+
+/**	@brief Encode a string to a curve point (in constant time)
+ *
+	@param DST is the Domain Separation Tag
+    @param ID is the input string
+    @param HID is the output point in G1
+*/
+void MPIN_ENCODE_TO_CURVE(octet *DST,octet *ID,octet *HID);
+
+/**	@brief Extract a PIN number from a client secret
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param pin is an input PIN number
+	@param CS is the client secret from which the PIN is to be extracted
+	@return 0 or an error code
+ */
+int MPIN_EXTRACT_PIN(octet *HID, int pin, octet *CS);
+
+/**	@brief Perform first pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param R is a pointer to a cryptographically secure random number generator
+	@param x an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param pin is the input PIN number
+	@param T is the input M-Pin token (the client secret with PIN portion removed)
+	@param S is the reconstructed client secret
+	@param U is output = x.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_1(octet *HID, csprng *R, octet *x, int pin, octet *T, octet *S, octet *U);
+/**	@brief Generate a random group element
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param S is the output random octet
+	@return 0 or an error code
+ */
+int MPIN_RANDOM_GENERATE(csprng *R, octet *S);
+/**	@brief Perform second pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param x an input, a locally generated random number
+	@param y an input random challenge from the server
+	@param V on output = -(x+y).V
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_2(octet *x, octet *y, octet *V);
+
+/**	@brief Perform final pass on the server side of the M-Pin protocol
+
+	@param HID is input H(ID), a hash of the client ID
+	@param y is the input server's randomly generated challenge
+	@param SS is the input server secret
+	@param U is input from the client = x.H(ID)
+	@param V is an input from the client
+	@return 0 or an error code
+ */
+int MPIN_SERVER(octet *HID, octet *y, octet *SS, octet *U, octet *V);
+
+/**	@brief Create a client secret in G1 from a master secret and the client ID
+ *
+	@param S is an input master secret
+	@param HID is the input client identity hashed to curve
+	@param CS is the full client secret = s.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_GET_CLIENT_SECRET(octet *S, octet *HID, octet *CS);
+
+/**	@brief Create a server secret in G2 from a master secret
+ *
+	@param S is an input master secret
+	@param SS is the server secret = s.Q where Q is a fixed generator of G2
+	@return 0 or an error code
+ */
+int MPIN_GET_SERVER_SECRET(octet *S, octet *SS);
+}
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/mpin192.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/mpin192.h
new file mode 100644
index 0000000..6aac781
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/mpin192.h
@@ -0,0 +1,136 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file mpin.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief M-Pin Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef MPIN_ZZZ_H
+#define MPIN_ZZZ_H
+
+#include "pair4_ZZZ.h"
+//#include "pbc_support.h"
+
+using namespace core;
+
+
+namespace ZZZ {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define PGS_ZZZ MODBYTES_XXX  /**< MPIN Group Size */
+#define PFS_ZZZ MODBYTES_XXX  /**< MPIN Field Size */
+
+#define MPIN_OK             0   /**< Function completed without error */
+#define MPIN_INVALID_POINT  -14	/**< Point is NOT on the curve */
+#define MPIN_BAD_PIN        -19 /**< Bad PIN number entered */
+
+#define MAXPIN 10000         /**< max PIN */
+#define PBLEN 14             /**< max length of PIN in bits */
+
+//#define PAS_ZZZ 24        /**< MPIN Symmetric Key Size 192 bits  */
+//#define HASH_TYPE_MPIN_ZZZ SHA384   /**< Choose Hash function */
+
+/* MPIN support functions */
+
+/* MPIN primitives */
+
+/**	@brief Encode a string to a curve point (in constant time)
+ *
+	@param DST is the Domain Separation Tag
+    @param ID is the input string
+    @param HID is the output point in G1
+*/
+void MPIN_ENCODE_TO_CURVE(octet *DST,octet *ID,octet *HID);
+
+/**	@brief Extract a PIN number from a client secret
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param pin is an input PIN number
+	@param CS is the client secret from which the PIN is to be extracted
+	@return 0 or an error code
+ */
+int MPIN_EXTRACT_PIN(octet *HID, int pin, octet *CS);
+
+/**	@brief Perform first pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param R is a pointer to a cryptographically secure random number generator
+	@param x an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param pin is the input PIN number
+	@param T is the input M-Pin token (the client secret with PIN portion removed)
+	@param S is the reconstructed client secret
+	@param U is output = x.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_1(octet *HID, csprng *R, octet *x, int pin, octet *T, octet *S, octet *U);
+/**	@brief Generate a random group element
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param S is the output random octet
+	@return 0 or an error code
+ */
+int MPIN_RANDOM_GENERATE(csprng *R, octet *S);
+/**	@brief Perform second pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param x an input, a locally generated random number
+	@param y an input random challenge from the server
+	@param V on output = -(x+y).V
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_2(octet *x, octet *y, octet *V);
+
+/**	@brief Perform third pass on the server side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is input H(ID), a hash of the client ID
+	@param y is the input server's randomly generated challenge
+	@param SS is the input server secret
+	@param U is input from the client = x.H(ID)
+	@param V is an input from the client
+	@return 0 or an error code
+ */
+int MPIN_SERVER(octet *HID, octet *y, octet *SS, octet *U, octet *V);
+
+/**	@brief Create a client secret in G1 from a master secret and the client ID
+ *
+	@param S is an input master secret
+	@param HID is the input client identity hashed to point
+	@param CS is the full client secret = s.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_GET_CLIENT_SECRET(octet *S, octet *HID, octet *CS);
+
+/**	@brief Create a server secret in G2 from a master secret
+ *
+	@param S is an input master secret
+	@param SS is the server secret = s.Q where Q is a fixed generator of G2
+	@return 0 or an error code
+ */
+int MPIN_GET_SERVER_SECRET(octet *S, octet *SS);
+}
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/mpin192_BLS24479.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/mpin192_BLS24479.h
new file mode 100644
index 0000000..8201b3a
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/mpin192_BLS24479.h
@@ -0,0 +1,136 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file mpin.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief M-Pin Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef MPIN_BLS24479_H
+#define MPIN_BLS24479_H
+
+#include "pair4_BLS24479.h"
+//#include "pbc_support.h"
+
+using namespace core;
+
+
+namespace BLS24479 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define PGS_BLS24479 MODBYTES_B480_56  /**< MPIN Group Size */
+#define PFS_BLS24479 MODBYTES_B480_56  /**< MPIN Field Size */
+
+#define MPIN_OK             0   /**< Function completed without error */
+#define MPIN_INVALID_POINT  -14	/**< Point is NOT on the curve */
+#define MPIN_BAD_PIN        -19 /**< Bad PIN number entered */
+
+#define MAXPIN 10000         /**< max PIN */
+#define PBLEN 14             /**< max length of PIN in bits */
+
+//#define PAS_BLS24479 24        /**< MPIN Symmetric Key Size 192 bits  */
+//#define HASH_TYPE_MPIN_BLS24479 SHA384   /**< Choose Hash function */
+
+/* MPIN support functions */
+
+/* MPIN primitives */
+
+/**	@brief Encode a string to a curve point (in constant time)
+ *
+	@param DST is the Domain Separation Tag
+    @param ID is the input string
+    @param HID is the output point in G1
+*/
+void MPIN_ENCODE_TO_CURVE(octet *DST,octet *ID,octet *HID);
+
+/**	@brief Extract a PIN number from a client secret
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param pin is an input PIN number
+	@param CS is the client secret from which the PIN is to be extracted
+	@return 0 or an error code
+ */
+int MPIN_EXTRACT_PIN(octet *HID, int pin, octet *CS);
+
+/**	@brief Perform first pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param R is a pointer to a cryptographically secure random number generator
+	@param x an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param pin is the input PIN number
+	@param T is the input M-Pin token (the client secret with PIN portion removed)
+	@param S is the reconstructed client secret
+	@param U is output = x.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_1(octet *HID, csprng *R, octet *x, int pin, octet *T, octet *S, octet *U);
+/**	@brief Generate a random group element
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param S is the output random octet
+	@return 0 or an error code
+ */
+int MPIN_RANDOM_GENERATE(csprng *R, octet *S);
+/**	@brief Perform second pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param x an input, a locally generated random number
+	@param y an input random challenge from the server
+	@param V on output = -(x+y).V
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_2(octet *x, octet *y, octet *V);
+
+/**	@brief Perform third pass on the server side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is input H(ID), a hash of the client ID
+	@param y is the input server's randomly generated challenge
+	@param SS is the input server secret
+	@param U is input from the client = x.H(ID)
+	@param V is an input from the client
+	@return 0 or an error code
+ */
+int MPIN_SERVER(octet *HID, octet *y, octet *SS, octet *U, octet *V);
+
+/**	@brief Create a client secret in G1 from a master secret and the client ID
+ *
+	@param S is an input master secret
+	@param HID is the input client identity hashed to point
+	@param CS is the full client secret = s.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_GET_CLIENT_SECRET(octet *S, octet *HID, octet *CS);
+
+/**	@brief Create a server secret in G2 from a master secret
+ *
+	@param S is an input master secret
+	@param SS is the server secret = s.Q where Q is a fixed generator of G2
+	@return 0 or an error code
+ */
+int MPIN_GET_SERVER_SECRET(octet *S, octet *SS);
+}
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/mpin256.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/mpin256.h
new file mode 100644
index 0000000..0dfbbbb
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/mpin256.h
@@ -0,0 +1,133 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file mpin.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief M-Pin Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef MPIN_ZZZ_H
+#define MPIN_ZZZ_H
+
+#include "pair8_ZZZ.h"
+//#include "pbc_support.h"
+
+using namespace core;
+
+
+namespace ZZZ {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define PGS_ZZZ MODBYTES_XXX  /**< MPIN Group Size */
+#define PFS_ZZZ MODBYTES_XXX  /**< MPIN Field Size */
+
+#define MPIN_OK             0   /**< Function completed without error */
+#define MPIN_INVALID_POINT  -14	/**< Point is NOT on the curve */
+#define MPIN_BAD_PIN        -19 /**< Bad PIN number entered */
+
+#define MAXPIN 10000         /**< max PIN */
+#define PBLEN 14             /**< max length of PIN in bits */
+
+//#define PAS_ZZZ 24        /**< MPIN Symmetric Key Size 192 bits  */
+//#define HASH_TYPE_MPIN_ZZZ SHA384   /**< Choose Hash function */
+
+/* MPIN support functions */
+/* MPIN primitives */
+
+/**	@brief Encode a string to a curve point (in constant time)
+ *
+	@param DST is the Domain Separation Tag
+    @param ID is the input string
+    @param HCID is the output point in G1
+*/
+void MPIN_ENCODE_TO_CURVE(octet *DST,octet *ID,octet *HCID);
+
+/**	@brief Extract a PIN number from a client secret
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param pin is an input PIN number
+	@param CS is the client secret from which the PIN is to be extracted
+	@return 0 or an error code
+ */
+int MPIN_EXTRACT_PIN(octet *HID, int pin, octet *CS);
+
+/**	@brief Perform first pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param R is a pointer to a cryptographically secure random number generator
+	@param x an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param pin is the input PIN number
+	@param T is the input M-Pin token (the client secret with PIN portion removed)
+	@param S is output = CS+TP, where CS=is the reconstructed client secret, and TP is the time permit
+	@param U is output = x.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_1(octet *HID, csprng *R, octet *x, int pin, octet *T, octet *S, octet *U);
+/**	@brief Generate a random group element
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param S is the output random octet
+	@return 0 or an error code
+ */
+int MPIN_RANDOM_GENERATE(csprng *R, octet *S);
+/**	@brief Perform second pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param x an input, a locally generated random number
+	@param y an input random challenge from the server
+	@param V on output = -(x+y).V
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_2(octet *x, octet *y, octet *V);
+/**	@brief Perform third pass on the server side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is input H(ID), a hash of the client ID
+	@param y is the input server's randomly generated challenge
+	@param SS is the input server secret
+	@param U is input from the client = x.H(ID)
+	@param V is an input from the client
+	@return 0 or an error code
+ */
+int MPIN_SERVER(octet *HID, octet *y, octet *SS, octet *U, octet *V);
+/**	@brief Create a client secret in G1 from a master secret and the client ID
+ *
+	@param S is an input master secret
+	@param HID is the input client identity hashed to point
+	@param CS is the full client secret = s.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_GET_CLIENT_SECRET(octet *S, octet *HID, octet *CS);
+
+/**	@brief Create a server secret in G2 from a master secret
+ *
+	@param S is an input master secret
+	@param SS is the server secret = s.Q where Q is a fixed generator of G2
+	@return 0 or an error code
+ */
+int MPIN_GET_SERVER_SECRET(octet *S, octet *SS);
+}
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/mpin256_BLS48286.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/mpin256_BLS48286.h
new file mode 100644
index 0000000..7a860fb
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/mpin256_BLS48286.h
@@ -0,0 +1,133 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file mpin.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief M-Pin Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef MPIN_BLS48286_H
+#define MPIN_BLS48286_H
+
+#include "pair8_BLS48286.h"
+//#include "pbc_support.h"
+
+using namespace core;
+
+
+namespace BLS48286 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define PGS_BLS48286 MODBYTES_B288_60  /**< MPIN Group Size */
+#define PFS_BLS48286 MODBYTES_B288_60  /**< MPIN Field Size */
+
+#define MPIN_OK             0   /**< Function completed without error */
+#define MPIN_INVALID_POINT  -14	/**< Point is NOT on the curve */
+#define MPIN_BAD_PIN        -19 /**< Bad PIN number entered */
+
+#define MAXPIN 10000         /**< max PIN */
+#define PBLEN 14             /**< max length of PIN in bits */
+
+//#define PAS_BLS48286 24        /**< MPIN Symmetric Key Size 192 bits  */
+//#define HASH_TYPE_MPIN_BLS48286 SHA384   /**< Choose Hash function */
+
+/* MPIN support functions */
+/* MPIN primitives */
+
+/**	@brief Encode a string to a curve point (in constant time)
+ *
+	@param DST is the Domain Separation Tag
+    @param ID is the input string
+    @param HCID is the output point in G1
+*/
+void MPIN_ENCODE_TO_CURVE(octet *DST,octet *ID,octet *HCID);
+
+/**	@brief Extract a PIN number from a client secret
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param pin is an input PIN number
+	@param CS is the client secret from which the PIN is to be extracted
+	@return 0 or an error code
+ */
+int MPIN_EXTRACT_PIN(octet *HID, int pin, octet *CS);
+
+/**	@brief Perform first pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param R is a pointer to a cryptographically secure random number generator
+	@param x an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param pin is the input PIN number
+	@param T is the input M-Pin token (the client secret with PIN portion removed)
+	@param S is output = CS+TP, where CS=is the reconstructed client secret, and TP is the time permit
+	@param U is output = x.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_1(octet *HID, csprng *R, octet *x, int pin, octet *T, octet *S, octet *U);
+/**	@brief Generate a random group element
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param S is the output random octet
+	@return 0 or an error code
+ */
+int MPIN_RANDOM_GENERATE(csprng *R, octet *S);
+/**	@brief Perform second pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param x an input, a locally generated random number
+	@param y an input random challenge from the server
+	@param V on output = -(x+y).V
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_2(octet *x, octet *y, octet *V);
+/**	@brief Perform third pass on the server side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is input H(ID), a hash of the client ID
+	@param y is the input server's randomly generated challenge
+	@param SS is the input server secret
+	@param U is input from the client = x.H(ID)
+	@param V is an input from the client
+	@return 0 or an error code
+ */
+int MPIN_SERVER(octet *HID, octet *y, octet *SS, octet *U, octet *V);
+/**	@brief Create a client secret in G1 from a master secret and the client ID
+ *
+	@param S is an input master secret
+	@param HID is the input client identity hashed to point
+	@param CS is the full client secret = s.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_GET_CLIENT_SECRET(octet *S, octet *HID, octet *CS);
+
+/**	@brief Create a server secret in G2 from a master secret
+ *
+	@param S is an input master secret
+	@param SS is the server secret = s.Q where Q is a fixed generator of G2
+	@return 0 or an error code
+ */
+int MPIN_GET_SERVER_SECRET(octet *S, octet *SS);
+}
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/mpin256_BLS48556.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/mpin256_BLS48556.h
new file mode 100644
index 0000000..90c88aa
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/mpin256_BLS48556.h
@@ -0,0 +1,133 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file mpin.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief M-Pin Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef MPIN_BLS48556_H
+#define MPIN_BLS48556_H
+
+#include "pair8_BLS48556.h"
+//#include "pbc_support.h"
+
+using namespace core;
+
+
+namespace BLS48556 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define PGS_BLS48556 MODBYTES_B560_58  /**< MPIN Group Size */
+#define PFS_BLS48556 MODBYTES_B560_58  /**< MPIN Field Size */
+
+#define MPIN_OK             0   /**< Function completed without error */
+#define MPIN_INVALID_POINT  -14	/**< Point is NOT on the curve */
+#define MPIN_BAD_PIN        -19 /**< Bad PIN number entered */
+
+#define MAXPIN 10000         /**< max PIN */
+#define PBLEN 14             /**< max length of PIN in bits */
+
+//#define PAS_BLS48556 24        /**< MPIN Symmetric Key Size 192 bits  */
+//#define HASH_TYPE_MPIN_BLS48556 SHA384   /**< Choose Hash function */
+
+/* MPIN support functions */
+/* MPIN primitives */
+
+/**	@brief Encode a string to a curve point (in constant time)
+ *
+	@param DST is the Domain Separation Tag
+    @param ID is the input string
+    @param HCID is the output point in G1
+*/
+void MPIN_ENCODE_TO_CURVE(octet *DST,octet *ID,octet *HCID);
+
+/**	@brief Extract a PIN number from a client secret
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param pin is an input PIN number
+	@param CS is the client secret from which the PIN is to be extracted
+	@return 0 or an error code
+ */
+int MPIN_EXTRACT_PIN(octet *HID, int pin, octet *CS);
+
+/**	@brief Perform first pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param R is a pointer to a cryptographically secure random number generator
+	@param x an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param pin is the input PIN number
+	@param T is the input M-Pin token (the client secret with PIN portion removed)
+	@param S is output = CS+TP, where CS=is the reconstructed client secret, and TP is the time permit
+	@param U is output = x.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_1(octet *HID, csprng *R, octet *x, int pin, octet *T, octet *S, octet *U);
+/**	@brief Generate a random group element
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param S is the output random octet
+	@return 0 or an error code
+ */
+int MPIN_RANDOM_GENERATE(csprng *R, octet *S);
+/**	@brief Perform second pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param x an input, a locally generated random number
+	@param y an input random challenge from the server
+	@param V on output = -(x+y).V
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_2(octet *x, octet *y, octet *V);
+/**	@brief Perform third pass on the server side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is input H(ID), a hash of the client ID
+	@param y is the input server's randomly generated challenge
+	@param SS is the input server secret
+	@param U is input from the client = x.H(ID)
+	@param V is an input from the client
+	@return 0 or an error code
+ */
+int MPIN_SERVER(octet *HID, octet *y, octet *SS, octet *U, octet *V);
+/**	@brief Create a client secret in G1 from a master secret and the client ID
+ *
+	@param S is an input master secret
+	@param HID is the input client identity hashed to point
+	@param CS is the full client secret = s.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_GET_CLIENT_SECRET(octet *S, octet *HID, octet *CS);
+
+/**	@brief Create a server secret in G2 from a master secret
+ *
+	@param S is an input master secret
+	@param SS is the server secret = s.Q where Q is a fixed generator of G2
+	@return 0 or an error code
+ */
+int MPIN_GET_SERVER_SECRET(octet *S, octet *SS);
+}
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/mpin256_BLS48581.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/mpin256_BLS48581.h
new file mode 100644
index 0000000..c78b696
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/mpin256_BLS48581.h
@@ -0,0 +1,133 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file mpin.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief M-Pin Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef MPIN_BLS48581_H
+#define MPIN_BLS48581_H
+
+#include "pair8_BLS48581.h"
+//#include "pbc_support.h"
+
+using namespace core;
+
+
+namespace BLS48581 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define PGS_BLS48581 MODBYTES_B584_60  /**< MPIN Group Size */
+#define PFS_BLS48581 MODBYTES_B584_60  /**< MPIN Field Size */
+
+#define MPIN_OK             0   /**< Function completed without error */
+#define MPIN_INVALID_POINT  -14	/**< Point is NOT on the curve */
+#define MPIN_BAD_PIN        -19 /**< Bad PIN number entered */
+
+#define MAXPIN 10000         /**< max PIN */
+#define PBLEN 14             /**< max length of PIN in bits */
+
+//#define PAS_BLS48581 24        /**< MPIN Symmetric Key Size 192 bits  */
+//#define HASH_TYPE_MPIN_BLS48581 SHA384   /**< Choose Hash function */
+
+/* MPIN support functions */
+/* MPIN primitives */
+
+/**	@brief Encode a string to a curve point (in constant time)
+ *
+	@param DST is the Domain Separation Tag
+    @param ID is the input string
+    @param HCID is the output point in G1
+*/
+void MPIN_ENCODE_TO_CURVE(octet *DST,octet *ID,octet *HCID);
+
+/**	@brief Extract a PIN number from a client secret
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param pin is an input PIN number
+	@param CS is the client secret from which the PIN is to be extracted
+	@return 0 or an error code
+ */
+int MPIN_EXTRACT_PIN(octet *HID, int pin, octet *CS);
+
+/**	@brief Perform first pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param R is a pointer to a cryptographically secure random number generator
+	@param x an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param pin is the input PIN number
+	@param T is the input M-Pin token (the client secret with PIN portion removed)
+	@param S is output = CS+TP, where CS=is the reconstructed client secret, and TP is the time permit
+	@param U is output = x.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_1(octet *HID, csprng *R, octet *x, int pin, octet *T, octet *S, octet *U);
+/**	@brief Generate a random group element
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param S is the output random octet
+	@return 0 or an error code
+ */
+int MPIN_RANDOM_GENERATE(csprng *R, octet *S);
+/**	@brief Perform second pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param x an input, a locally generated random number
+	@param y an input random challenge from the server
+	@param V on output = -(x+y).V
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_2(octet *x, octet *y, octet *V);
+/**	@brief Perform third pass on the server side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is input H(ID), a hash of the client ID
+	@param y is the input server's randomly generated challenge
+	@param SS is the input server secret
+	@param U is input from the client = x.H(ID)
+	@param V is an input from the client
+	@return 0 or an error code
+ */
+int MPIN_SERVER(octet *HID, octet *y, octet *SS, octet *U, octet *V);
+/**	@brief Create a client secret in G1 from a master secret and the client ID
+ *
+	@param S is an input master secret
+	@param HID is the input client identity hashed to point
+	@param CS is the full client secret = s.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_GET_CLIENT_SECRET(octet *S, octet *HID, octet *CS);
+
+/**	@brief Create a server secret in G2 from a master secret
+ *
+	@param S is an input master secret
+	@param SS is the server secret = s.Q where Q is a fixed generator of G2
+	@return 0 or an error code
+ */
+int MPIN_GET_SERVER_SECRET(octet *S, octet *SS);
+}
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/mpin_BLS12381.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/mpin_BLS12381.h
new file mode 100644
index 0000000..600637e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/mpin_BLS12381.h
@@ -0,0 +1,136 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file mpin.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief M-Pin Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef MPIN_BLS12381_H
+#define MPIN_BLS12381_H
+
+#include "pair_BLS12381.h"
+//#include "pbc_support.h"
+
+using namespace core;
+
+
+namespace BLS12381 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define PGS_BLS12381 MODBYTES_B384_58  /**< MPIN Group Size */
+#define PFS_BLS12381 MODBYTES_B384_58  /**< MPIN Field Size */
+
+#define MPIN_OK             0   /**< Function completed without error */
+#define MPIN_INVALID_POINT  -14	/**< Point is NOT on the curve */
+#define MPIN_BAD_PIN        -19 /**< Bad PIN number entered */
+
+#define MAXPIN 10000         /**< max PIN */
+#define PBLEN 14             /**< max length of PIN in bits */
+
+//#define PAS_BLS12381 16        /**< MPIN Symmetric Key Size 128 bits */
+//#define HASH_TYPE_MPIN_BLS12381 SHA256   /**< Choose Hash function */
+
+/* MPIN support functions */
+
+/* MPIN primitives */
+
+/**	@brief Encode a string to a curve point (in constant time)
+ *
+	@param DST is the Domain Separation Tag
+    @param ID is the input string
+    @param HID is the output point in G1
+*/
+void MPIN_ENCODE_TO_CURVE(octet *DST,octet *ID,octet *HID);
+
+/**	@brief Extract a PIN number from a client secret
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param pin is an input PIN number
+	@param CS is the client secret from which the PIN is to be extracted
+	@return 0 or an error code
+ */
+int MPIN_EXTRACT_PIN(octet *HID, int pin, octet *CS);
+
+/**	@brief Perform first pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param R is a pointer to a cryptographically secure random number generator
+	@param x an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param pin is the input PIN number
+	@param T is the input M-Pin token (the client secret with PIN portion removed)
+	@param S is the reconstructed client secret
+	@param U is output = x.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_1(octet *HID, csprng *R, octet *x, int pin, octet *T, octet *S, octet *U);
+/**	@brief Generate a random group element
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param S is the output random octet
+	@return 0 or an error code
+ */
+int MPIN_RANDOM_GENERATE(csprng *R, octet *S);
+/**	@brief Perform second pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param x an input, a locally generated random number
+	@param y an input random challenge from the server
+	@param V on output = -(x+y).V
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_2(octet *x, octet *y, octet *V);
+
+/**	@brief Perform final pass on the server side of the M-Pin protocol
+
+	@param HID is input H(ID), a hash of the client ID
+	@param y is the input server's randomly generated challenge
+	@param SS is the input server secret
+	@param U is input from the client = x.H(ID)
+	@param V is an input from the client
+	@return 0 or an error code
+ */
+int MPIN_SERVER(octet *HID, octet *y, octet *SS, octet *U, octet *V);
+
+/**	@brief Create a client secret in G1 from a master secret and the client ID
+ *
+	@param S is an input master secret
+	@param HID is the input client identity hashed to curve
+	@param CS is the full client secret = s.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_GET_CLIENT_SECRET(octet *S, octet *HID, octet *CS);
+
+/**	@brief Create a server secret in G2 from a master secret
+ *
+	@param S is an input master secret
+	@param SS is the server secret = s.Q where Q is a fixed generator of G2
+	@return 0 or an error code
+ */
+int MPIN_GET_SERVER_SECRET(octet *S, octet *SS);
+}
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/mpin_BLS12383.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/mpin_BLS12383.h
new file mode 100644
index 0000000..4cd8dfe
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/mpin_BLS12383.h
@@ -0,0 +1,136 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file mpin.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief M-Pin Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef MPIN_BLS12383_H
+#define MPIN_BLS12383_H
+
+#include "pair_BLS12383.h"
+//#include "pbc_support.h"
+
+using namespace core;
+
+
+namespace BLS12383 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define PGS_BLS12383 MODBYTES_B384_58  /**< MPIN Group Size */
+#define PFS_BLS12383 MODBYTES_B384_58  /**< MPIN Field Size */
+
+#define MPIN_OK             0   /**< Function completed without error */
+#define MPIN_INVALID_POINT  -14	/**< Point is NOT on the curve */
+#define MPIN_BAD_PIN        -19 /**< Bad PIN number entered */
+
+#define MAXPIN 10000         /**< max PIN */
+#define PBLEN 14             /**< max length of PIN in bits */
+
+//#define PAS_BLS12383 16        /**< MPIN Symmetric Key Size 128 bits */
+//#define HASH_TYPE_MPIN_BLS12383 SHA256   /**< Choose Hash function */
+
+/* MPIN support functions */
+
+/* MPIN primitives */
+
+/**	@brief Encode a string to a curve point (in constant time)
+ *
+	@param DST is the Domain Separation Tag
+    @param ID is the input string
+    @param HID is the output point in G1
+*/
+void MPIN_ENCODE_TO_CURVE(octet *DST,octet *ID,octet *HID);
+
+/**	@brief Extract a PIN number from a client secret
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param pin is an input PIN number
+	@param CS is the client secret from which the PIN is to be extracted
+	@return 0 or an error code
+ */
+int MPIN_EXTRACT_PIN(octet *HID, int pin, octet *CS);
+
+/**	@brief Perform first pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param R is a pointer to a cryptographically secure random number generator
+	@param x an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param pin is the input PIN number
+	@param T is the input M-Pin token (the client secret with PIN portion removed)
+	@param S is the reconstructed client secret
+	@param U is output = x.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_1(octet *HID, csprng *R, octet *x, int pin, octet *T, octet *S, octet *U);
+/**	@brief Generate a random group element
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param S is the output random octet
+	@return 0 or an error code
+ */
+int MPIN_RANDOM_GENERATE(csprng *R, octet *S);
+/**	@brief Perform second pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param x an input, a locally generated random number
+	@param y an input random challenge from the server
+	@param V on output = -(x+y).V
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_2(octet *x, octet *y, octet *V);
+
+/**	@brief Perform final pass on the server side of the M-Pin protocol
+
+	@param HID is input H(ID), a hash of the client ID
+	@param y is the input server's randomly generated challenge
+	@param SS is the input server secret
+	@param U is input from the client = x.H(ID)
+	@param V is an input from the client
+	@return 0 or an error code
+ */
+int MPIN_SERVER(octet *HID, octet *y, octet *SS, octet *U, octet *V);
+
+/**	@brief Create a client secret in G1 from a master secret and the client ID
+ *
+	@param S is an input master secret
+	@param HID is the input client identity hashed to curve
+	@param CS is the full client secret = s.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_GET_CLIENT_SECRET(octet *S, octet *HID, octet *CS);
+
+/**	@brief Create a server secret in G2 from a master secret
+ *
+	@param S is an input master secret
+	@param SS is the server secret = s.Q where Q is a fixed generator of G2
+	@return 0 or an error code
+ */
+int MPIN_GET_SERVER_SECRET(octet *S, octet *SS);
+}
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/mpin_BLS12443.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/mpin_BLS12443.h
new file mode 100644
index 0000000..38626f1
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/mpin_BLS12443.h
@@ -0,0 +1,136 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file mpin.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief M-Pin Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef MPIN_BLS12443_H
+#define MPIN_BLS12443_H
+
+#include "pair_BLS12443.h"
+//#include "pbc_support.h"
+
+using namespace core;
+
+
+namespace BLS12443 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define PGS_BLS12443 MODBYTES_B448_60  /**< MPIN Group Size */
+#define PFS_BLS12443 MODBYTES_B448_60  /**< MPIN Field Size */
+
+#define MPIN_OK             0   /**< Function completed without error */
+#define MPIN_INVALID_POINT  -14	/**< Point is NOT on the curve */
+#define MPIN_BAD_PIN        -19 /**< Bad PIN number entered */
+
+#define MAXPIN 10000         /**< max PIN */
+#define PBLEN 14             /**< max length of PIN in bits */
+
+//#define PAS_BLS12443 16        /**< MPIN Symmetric Key Size 128 bits */
+//#define HASH_TYPE_MPIN_BLS12443 SHA256   /**< Choose Hash function */
+
+/* MPIN support functions */
+
+/* MPIN primitives */
+
+/**	@brief Encode a string to a curve point (in constant time)
+ *
+	@param DST is the Domain Separation Tag
+    @param ID is the input string
+    @param HID is the output point in G1
+*/
+void MPIN_ENCODE_TO_CURVE(octet *DST,octet *ID,octet *HID);
+
+/**	@brief Extract a PIN number from a client secret
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param pin is an input PIN number
+	@param CS is the client secret from which the PIN is to be extracted
+	@return 0 or an error code
+ */
+int MPIN_EXTRACT_PIN(octet *HID, int pin, octet *CS);
+
+/**	@brief Perform first pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param R is a pointer to a cryptographically secure random number generator
+	@param x an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param pin is the input PIN number
+	@param T is the input M-Pin token (the client secret with PIN portion removed)
+	@param S is the reconstructed client secret
+	@param U is output = x.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_1(octet *HID, csprng *R, octet *x, int pin, octet *T, octet *S, octet *U);
+/**	@brief Generate a random group element
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param S is the output random octet
+	@return 0 or an error code
+ */
+int MPIN_RANDOM_GENERATE(csprng *R, octet *S);
+/**	@brief Perform second pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param x an input, a locally generated random number
+	@param y an input random challenge from the server
+	@param V on output = -(x+y).V
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_2(octet *x, octet *y, octet *V);
+
+/**	@brief Perform final pass on the server side of the M-Pin protocol
+
+	@param HID is input H(ID), a hash of the client ID
+	@param y is the input server's randomly generated challenge
+	@param SS is the input server secret
+	@param U is input from the client = x.H(ID)
+	@param V is an input from the client
+	@return 0 or an error code
+ */
+int MPIN_SERVER(octet *HID, octet *y, octet *SS, octet *U, octet *V);
+
+/**	@brief Create a client secret in G1 from a master secret and the client ID
+ *
+	@param S is an input master secret
+	@param HID is the input client identity hashed to curve
+	@param CS is the full client secret = s.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_GET_CLIENT_SECRET(octet *S, octet *HID, octet *CS);
+
+/**	@brief Create a server secret in G2 from a master secret
+ *
+	@param S is an input master secret
+	@param SS is the server secret = s.Q where Q is a fixed generator of G2
+	@return 0 or an error code
+ */
+int MPIN_GET_SERVER_SECRET(octet *S, octet *SS);
+}
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/mpin_BLS12461.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/mpin_BLS12461.h
new file mode 100644
index 0000000..3753906
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/mpin_BLS12461.h
@@ -0,0 +1,136 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file mpin.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief M-Pin Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef MPIN_BLS12461_H
+#define MPIN_BLS12461_H
+
+#include "pair_BLS12461.h"
+//#include "pbc_support.h"
+
+using namespace core;
+
+
+namespace BLS12461 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define PGS_BLS12461 MODBYTES_B464_60  /**< MPIN Group Size */
+#define PFS_BLS12461 MODBYTES_B464_60  /**< MPIN Field Size */
+
+#define MPIN_OK             0   /**< Function completed without error */
+#define MPIN_INVALID_POINT  -14	/**< Point is NOT on the curve */
+#define MPIN_BAD_PIN        -19 /**< Bad PIN number entered */
+
+#define MAXPIN 10000         /**< max PIN */
+#define PBLEN 14             /**< max length of PIN in bits */
+
+//#define PAS_BLS12461 16        /**< MPIN Symmetric Key Size 128 bits */
+//#define HASH_TYPE_MPIN_BLS12461 SHA256   /**< Choose Hash function */
+
+/* MPIN support functions */
+
+/* MPIN primitives */
+
+/**	@brief Encode a string to a curve point (in constant time)
+ *
+	@param DST is the Domain Separation Tag
+    @param ID is the input string
+    @param HID is the output point in G1
+*/
+void MPIN_ENCODE_TO_CURVE(octet *DST,octet *ID,octet *HID);
+
+/**	@brief Extract a PIN number from a client secret
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param pin is an input PIN number
+	@param CS is the client secret from which the PIN is to be extracted
+	@return 0 or an error code
+ */
+int MPIN_EXTRACT_PIN(octet *HID, int pin, octet *CS);
+
+/**	@brief Perform first pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param R is a pointer to a cryptographically secure random number generator
+	@param x an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param pin is the input PIN number
+	@param T is the input M-Pin token (the client secret with PIN portion removed)
+	@param S is the reconstructed client secret
+	@param U is output = x.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_1(octet *HID, csprng *R, octet *x, int pin, octet *T, octet *S, octet *U);
+/**	@brief Generate a random group element
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param S is the output random octet
+	@return 0 or an error code
+ */
+int MPIN_RANDOM_GENERATE(csprng *R, octet *S);
+/**	@brief Perform second pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param x an input, a locally generated random number
+	@param y an input random challenge from the server
+	@param V on output = -(x+y).V
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_2(octet *x, octet *y, octet *V);
+
+/**	@brief Perform final pass on the server side of the M-Pin protocol
+
+	@param HID is input H(ID), a hash of the client ID
+	@param y is the input server's randomly generated challenge
+	@param SS is the input server secret
+	@param U is input from the client = x.H(ID)
+	@param V is an input from the client
+	@return 0 or an error code
+ */
+int MPIN_SERVER(octet *HID, octet *y, octet *SS, octet *U, octet *V);
+
+/**	@brief Create a client secret in G1 from a master secret and the client ID
+ *
+	@param S is an input master secret
+	@param HID is the input client identity hashed to curve
+	@param CS is the full client secret = s.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_GET_CLIENT_SECRET(octet *S, octet *HID, octet *CS);
+
+/**	@brief Create a server secret in G2 from a master secret
+ *
+	@param S is an input master secret
+	@param SS is the server secret = s.Q where Q is a fixed generator of G2
+	@return 0 or an error code
+ */
+int MPIN_GET_SERVER_SECRET(octet *S, octet *SS);
+}
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/mpin_BN158.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/mpin_BN158.h
new file mode 100644
index 0000000..da89da4
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/mpin_BN158.h
@@ -0,0 +1,136 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file mpin.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief M-Pin Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef MPIN_BN158_H
+#define MPIN_BN158_H
+
+#include "pair_BN158.h"
+//#include "pbc_support.h"
+
+using namespace core;
+
+
+namespace BN158 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define PGS_BN158 MODBYTES_B160_56  /**< MPIN Group Size */
+#define PFS_BN158 MODBYTES_B160_56  /**< MPIN Field Size */
+
+#define MPIN_OK             0   /**< Function completed without error */
+#define MPIN_INVALID_POINT  -14	/**< Point is NOT on the curve */
+#define MPIN_BAD_PIN        -19 /**< Bad PIN number entered */
+
+#define MAXPIN 10000         /**< max PIN */
+#define PBLEN 14             /**< max length of PIN in bits */
+
+//#define PAS_BN158 16        /**< MPIN Symmetric Key Size 128 bits */
+//#define HASH_TYPE_MPIN_BN158 SHA256   /**< Choose Hash function */
+
+/* MPIN support functions */
+
+/* MPIN primitives */
+
+/**	@brief Encode a string to a curve point (in constant time)
+ *
+	@param DST is the Domain Separation Tag
+    @param ID is the input string
+    @param HID is the output point in G1
+*/
+void MPIN_ENCODE_TO_CURVE(octet *DST,octet *ID,octet *HID);
+
+/**	@brief Extract a PIN number from a client secret
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param pin is an input PIN number
+	@param CS is the client secret from which the PIN is to be extracted
+	@return 0 or an error code
+ */
+int MPIN_EXTRACT_PIN(octet *HID, int pin, octet *CS);
+
+/**	@brief Perform first pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param R is a pointer to a cryptographically secure random number generator
+	@param x an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param pin is the input PIN number
+	@param T is the input M-Pin token (the client secret with PIN portion removed)
+	@param S is the reconstructed client secret
+	@param U is output = x.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_1(octet *HID, csprng *R, octet *x, int pin, octet *T, octet *S, octet *U);
+/**	@brief Generate a random group element
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param S is the output random octet
+	@return 0 or an error code
+ */
+int MPIN_RANDOM_GENERATE(csprng *R, octet *S);
+/**	@brief Perform second pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param x an input, a locally generated random number
+	@param y an input random challenge from the server
+	@param V on output = -(x+y).V
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_2(octet *x, octet *y, octet *V);
+
+/**	@brief Perform final pass on the server side of the M-Pin protocol
+
+	@param HID is input H(ID), a hash of the client ID
+	@param y is the input server's randomly generated challenge
+	@param SS is the input server secret
+	@param U is input from the client = x.H(ID)
+	@param V is an input from the client
+	@return 0 or an error code
+ */
+int MPIN_SERVER(octet *HID, octet *y, octet *SS, octet *U, octet *V);
+
+/**	@brief Create a client secret in G1 from a master secret and the client ID
+ *
+	@param S is an input master secret
+	@param HID is the input client identity hashed to curve
+	@param CS is the full client secret = s.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_GET_CLIENT_SECRET(octet *S, octet *HID, octet *CS);
+
+/**	@brief Create a server secret in G2 from a master secret
+ *
+	@param S is an input master secret
+	@param SS is the server secret = s.Q where Q is a fixed generator of G2
+	@return 0 or an error code
+ */
+int MPIN_GET_SERVER_SECRET(octet *S, octet *SS);
+}
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/mpin_BN254.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/mpin_BN254.h
new file mode 100644
index 0000000..e7ee74f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/mpin_BN254.h
@@ -0,0 +1,136 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file mpin.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief M-Pin Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef MPIN_BN254_H
+#define MPIN_BN254_H
+
+#include "pair_BN254.h"
+//#include "pbc_support.h"
+
+using namespace core;
+
+
+namespace BN254 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define PGS_BN254 MODBYTES_B256_56  /**< MPIN Group Size */
+#define PFS_BN254 MODBYTES_B256_56  /**< MPIN Field Size */
+
+#define MPIN_OK             0   /**< Function completed without error */
+#define MPIN_INVALID_POINT  -14	/**< Point is NOT on the curve */
+#define MPIN_BAD_PIN        -19 /**< Bad PIN number entered */
+
+#define MAXPIN 10000         /**< max PIN */
+#define PBLEN 14             /**< max length of PIN in bits */
+
+//#define PAS_BN254 16        /**< MPIN Symmetric Key Size 128 bits */
+//#define HASH_TYPE_MPIN_BN254 SHA256   /**< Choose Hash function */
+
+/* MPIN support functions */
+
+/* MPIN primitives */
+
+/**	@brief Encode a string to a curve point (in constant time)
+ *
+	@param DST is the Domain Separation Tag
+    @param ID is the input string
+    @param HID is the output point in G1
+*/
+void MPIN_ENCODE_TO_CURVE(octet *DST,octet *ID,octet *HID);
+
+/**	@brief Extract a PIN number from a client secret
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param pin is an input PIN number
+	@param CS is the client secret from which the PIN is to be extracted
+	@return 0 or an error code
+ */
+int MPIN_EXTRACT_PIN(octet *HID, int pin, octet *CS);
+
+/**	@brief Perform first pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param R is a pointer to a cryptographically secure random number generator
+	@param x an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param pin is the input PIN number
+	@param T is the input M-Pin token (the client secret with PIN portion removed)
+	@param S is the reconstructed client secret
+	@param U is output = x.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_1(octet *HID, csprng *R, octet *x, int pin, octet *T, octet *S, octet *U);
+/**	@brief Generate a random group element
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param S is the output random octet
+	@return 0 or an error code
+ */
+int MPIN_RANDOM_GENERATE(csprng *R, octet *S);
+/**	@brief Perform second pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param x an input, a locally generated random number
+	@param y an input random challenge from the server
+	@param V on output = -(x+y).V
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_2(octet *x, octet *y, octet *V);
+
+/**	@brief Perform final pass on the server side of the M-Pin protocol
+
+	@param HID is input H(ID), a hash of the client ID
+	@param y is the input server's randomly generated challenge
+	@param SS is the input server secret
+	@param U is input from the client = x.H(ID)
+	@param V is an input from the client
+	@return 0 or an error code
+ */
+int MPIN_SERVER(octet *HID, octet *y, octet *SS, octet *U, octet *V);
+
+/**	@brief Create a client secret in G1 from a master secret and the client ID
+ *
+	@param S is an input master secret
+	@param HID is the input client identity hashed to curve
+	@param CS is the full client secret = s.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_GET_CLIENT_SECRET(octet *S, octet *HID, octet *CS);
+
+/**	@brief Create a server secret in G2 from a master secret
+ *
+	@param S is an input master secret
+	@param SS is the server secret = s.Q where Q is a fixed generator of G2
+	@return 0 or an error code
+ */
+int MPIN_GET_SERVER_SECRET(octet *S, octet *SS);
+}
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/mpin_BN254CX.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/mpin_BN254CX.h
new file mode 100644
index 0000000..0e35280
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/mpin_BN254CX.h
@@ -0,0 +1,136 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file mpin.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief M-Pin Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef MPIN_BN254CX_H
+#define MPIN_BN254CX_H
+
+#include "pair_BN254CX.h"
+//#include "pbc_support.h"
+
+using namespace core;
+
+
+namespace BN254CX {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define PGS_BN254CX MODBYTES_B256_56  /**< MPIN Group Size */
+#define PFS_BN254CX MODBYTES_B256_56  /**< MPIN Field Size */
+
+#define MPIN_OK             0   /**< Function completed without error */
+#define MPIN_INVALID_POINT  -14	/**< Point is NOT on the curve */
+#define MPIN_BAD_PIN        -19 /**< Bad PIN number entered */
+
+#define MAXPIN 10000         /**< max PIN */
+#define PBLEN 14             /**< max length of PIN in bits */
+
+//#define PAS_BN254CX 16        /**< MPIN Symmetric Key Size 128 bits */
+//#define HASH_TYPE_MPIN_BN254CX SHA256   /**< Choose Hash function */
+
+/* MPIN support functions */
+
+/* MPIN primitives */
+
+/**	@brief Encode a string to a curve point (in constant time)
+ *
+	@param DST is the Domain Separation Tag
+    @param ID is the input string
+    @param HID is the output point in G1
+*/
+void MPIN_ENCODE_TO_CURVE(octet *DST,octet *ID,octet *HID);
+
+/**	@brief Extract a PIN number from a client secret
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param pin is an input PIN number
+	@param CS is the client secret from which the PIN is to be extracted
+	@return 0 or an error code
+ */
+int MPIN_EXTRACT_PIN(octet *HID, int pin, octet *CS);
+
+/**	@brief Perform first pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param R is a pointer to a cryptographically secure random number generator
+	@param x an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param pin is the input PIN number
+	@param T is the input M-Pin token (the client secret with PIN portion removed)
+	@param S is the reconstructed client secret
+	@param U is output = x.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_1(octet *HID, csprng *R, octet *x, int pin, octet *T, octet *S, octet *U);
+/**	@brief Generate a random group element
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param S is the output random octet
+	@return 0 or an error code
+ */
+int MPIN_RANDOM_GENERATE(csprng *R, octet *S);
+/**	@brief Perform second pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param x an input, a locally generated random number
+	@param y an input random challenge from the server
+	@param V on output = -(x+y).V
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_2(octet *x, octet *y, octet *V);
+
+/**	@brief Perform final pass on the server side of the M-Pin protocol
+
+	@param HID is input H(ID), a hash of the client ID
+	@param y is the input server's randomly generated challenge
+	@param SS is the input server secret
+	@param U is input from the client = x.H(ID)
+	@param V is an input from the client
+	@return 0 or an error code
+ */
+int MPIN_SERVER(octet *HID, octet *y, octet *SS, octet *U, octet *V);
+
+/**	@brief Create a client secret in G1 from a master secret and the client ID
+ *
+	@param S is an input master secret
+	@param HID is the input client identity hashed to curve
+	@param CS is the full client secret = s.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_GET_CLIENT_SECRET(octet *S, octet *HID, octet *CS);
+
+/**	@brief Create a server secret in G2 from a master secret
+ *
+	@param S is an input master secret
+	@param SS is the server secret = s.Q where Q is a fixed generator of G2
+	@return 0 or an error code
+ */
+int MPIN_GET_SERVER_SECRET(octet *S, octet *SS);
+}
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/mpin_BN462.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/mpin_BN462.h
new file mode 100644
index 0000000..31976bd
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/mpin_BN462.h
@@ -0,0 +1,136 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file mpin.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief M-Pin Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef MPIN_BN462_H
+#define MPIN_BN462_H
+
+#include "pair_BN462.h"
+//#include "pbc_support.h"
+
+using namespace core;
+
+
+namespace BN462 {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define PGS_BN462 MODBYTES_B464_60  /**< MPIN Group Size */
+#define PFS_BN462 MODBYTES_B464_60  /**< MPIN Field Size */
+
+#define MPIN_OK             0   /**< Function completed without error */
+#define MPIN_INVALID_POINT  -14	/**< Point is NOT on the curve */
+#define MPIN_BAD_PIN        -19 /**< Bad PIN number entered */
+
+#define MAXPIN 10000         /**< max PIN */
+#define PBLEN 14             /**< max length of PIN in bits */
+
+//#define PAS_BN462 16        /**< MPIN Symmetric Key Size 128 bits */
+//#define HASH_TYPE_MPIN_BN462 SHA256   /**< Choose Hash function */
+
+/* MPIN support functions */
+
+/* MPIN primitives */
+
+/**	@brief Encode a string to a curve point (in constant time)
+ *
+	@param DST is the Domain Separation Tag
+    @param ID is the input string
+    @param HID is the output point in G1
+*/
+void MPIN_ENCODE_TO_CURVE(octet *DST,octet *ID,octet *HID);
+
+/**	@brief Extract a PIN number from a client secret
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param pin is an input PIN number
+	@param CS is the client secret from which the PIN is to be extracted
+	@return 0 or an error code
+ */
+int MPIN_EXTRACT_PIN(octet *HID, int pin, octet *CS);
+
+/**	@brief Perform first pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param R is a pointer to a cryptographically secure random number generator
+	@param x an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param pin is the input PIN number
+	@param T is the input M-Pin token (the client secret with PIN portion removed)
+	@param S is the reconstructed client secret
+	@param U is output = x.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_1(octet *HID, csprng *R, octet *x, int pin, octet *T, octet *S, octet *U);
+/**	@brief Generate a random group element
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param S is the output random octet
+	@return 0 or an error code
+ */
+int MPIN_RANDOM_GENERATE(csprng *R, octet *S);
+/**	@brief Perform second pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param x an input, a locally generated random number
+	@param y an input random challenge from the server
+	@param V on output = -(x+y).V
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_2(octet *x, octet *y, octet *V);
+
+/**	@brief Perform final pass on the server side of the M-Pin protocol
+
+	@param HID is input H(ID), a hash of the client ID
+	@param y is the input server's randomly generated challenge
+	@param SS is the input server secret
+	@param U is input from the client = x.H(ID)
+	@param V is an input from the client
+	@return 0 or an error code
+ */
+int MPIN_SERVER(octet *HID, octet *y, octet *SS, octet *U, octet *V);
+
+/**	@brief Create a client secret in G1 from a master secret and the client ID
+ *
+	@param S is an input master secret
+	@param HID is the input client identity hashed to curve
+	@param CS is the full client secret = s.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_GET_CLIENT_SECRET(octet *S, octet *HID, octet *CS);
+
+/**	@brief Create a server secret in G2 from a master secret
+ *
+	@param S is an input master secret
+	@param SS is the server secret = s.Q where Q is a fixed generator of G2
+	@return 0 or an error code
+ */
+int MPIN_GET_SERVER_SECRET(octet *S, octet *SS);
+}
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/mpin_FP256BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/mpin_FP256BN.h
new file mode 100644
index 0000000..987ab95
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/mpin_FP256BN.h
@@ -0,0 +1,136 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file mpin.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief M-Pin Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef MPIN_FP256BN_H
+#define MPIN_FP256BN_H
+
+#include "pair_FP256BN.h"
+//#include "pbc_support.h"
+
+using namespace core;
+
+
+namespace FP256BN {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define PGS_FP256BN MODBYTES_B256_56  /**< MPIN Group Size */
+#define PFS_FP256BN MODBYTES_B256_56  /**< MPIN Field Size */
+
+#define MPIN_OK             0   /**< Function completed without error */
+#define MPIN_INVALID_POINT  -14	/**< Point is NOT on the curve */
+#define MPIN_BAD_PIN        -19 /**< Bad PIN number entered */
+
+#define MAXPIN 10000         /**< max PIN */
+#define PBLEN 14             /**< max length of PIN in bits */
+
+//#define PAS_FP256BN 16        /**< MPIN Symmetric Key Size 128 bits */
+//#define HASH_TYPE_MPIN_FP256BN SHA256   /**< Choose Hash function */
+
+/* MPIN support functions */
+
+/* MPIN primitives */
+
+/**	@brief Encode a string to a curve point (in constant time)
+ *
+	@param DST is the Domain Separation Tag
+    @param ID is the input string
+    @param HID is the output point in G1
+*/
+void MPIN_ENCODE_TO_CURVE(octet *DST,octet *ID,octet *HID);
+
+/**	@brief Extract a PIN number from a client secret
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param pin is an input PIN number
+	@param CS is the client secret from which the PIN is to be extracted
+	@return 0 or an error code
+ */
+int MPIN_EXTRACT_PIN(octet *HID, int pin, octet *CS);
+
+/**	@brief Perform first pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param R is a pointer to a cryptographically secure random number generator
+	@param x an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param pin is the input PIN number
+	@param T is the input M-Pin token (the client secret with PIN portion removed)
+	@param S is the reconstructed client secret
+	@param U is output = x.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_1(octet *HID, csprng *R, octet *x, int pin, octet *T, octet *S, octet *U);
+/**	@brief Generate a random group element
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param S is the output random octet
+	@return 0 or an error code
+ */
+int MPIN_RANDOM_GENERATE(csprng *R, octet *S);
+/**	@brief Perform second pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param x an input, a locally generated random number
+	@param y an input random challenge from the server
+	@param V on output = -(x+y).V
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_2(octet *x, octet *y, octet *V);
+
+/**	@brief Perform final pass on the server side of the M-Pin protocol
+
+	@param HID is input H(ID), a hash of the client ID
+	@param y is the input server's randomly generated challenge
+	@param SS is the input server secret
+	@param U is input from the client = x.H(ID)
+	@param V is an input from the client
+	@return 0 or an error code
+ */
+int MPIN_SERVER(octet *HID, octet *y, octet *SS, octet *U, octet *V);
+
+/**	@brief Create a client secret in G1 from a master secret and the client ID
+ *
+	@param S is an input master secret
+	@param HID is the input client identity hashed to curve
+	@param CS is the full client secret = s.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_GET_CLIENT_SECRET(octet *S, octet *HID, octet *CS);
+
+/**	@brief Create a server secret in G2 from a master secret
+ *
+	@param S is an input master secret
+	@param SS is the server secret = s.Q where Q is a fixed generator of G2
+	@return 0 or an error code
+ */
+int MPIN_GET_SERVER_SECRET(octet *S, octet *SS);
+}
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/mpin_FP512BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/mpin_FP512BN.h
new file mode 100644
index 0000000..aa209a1
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/mpin_FP512BN.h
@@ -0,0 +1,136 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file mpin.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief M-Pin Header file
+ *
+ * Allows some user configuration
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef MPIN_FP512BN_H
+#define MPIN_FP512BN_H
+
+#include "pair_FP512BN.h"
+//#include "pbc_support.h"
+
+using namespace core;
+
+
+namespace FP512BN {
+
+/* Field size is assumed to be greater than or equal to group size */
+
+#define PGS_FP512BN MODBYTES_B512_60  /**< MPIN Group Size */
+#define PFS_FP512BN MODBYTES_B512_60  /**< MPIN Field Size */
+
+#define MPIN_OK             0   /**< Function completed without error */
+#define MPIN_INVALID_POINT  -14	/**< Point is NOT on the curve */
+#define MPIN_BAD_PIN        -19 /**< Bad PIN number entered */
+
+#define MAXPIN 10000         /**< max PIN */
+#define PBLEN 14             /**< max length of PIN in bits */
+
+//#define PAS_FP512BN 16        /**< MPIN Symmetric Key Size 128 bits */
+//#define HASH_TYPE_MPIN_FP512BN SHA256   /**< Choose Hash function */
+
+/* MPIN support functions */
+
+/* MPIN primitives */
+
+/**	@brief Encode a string to a curve point (in constant time)
+ *
+	@param DST is the Domain Separation Tag
+    @param ID is the input string
+    @param HID is the output point in G1
+*/
+void MPIN_ENCODE_TO_CURVE(octet *DST,octet *ID,octet *HID);
+
+/**	@brief Extract a PIN number from a client secret
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param pin is an input PIN number
+	@param CS is the client secret from which the PIN is to be extracted
+	@return 0 or an error code
+ */
+int MPIN_EXTRACT_PIN(octet *HID, int pin, octet *CS);
+
+/**	@brief Perform first pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param HID is the hashed-to-curve input client identity
+	@param R is a pointer to a cryptographically secure random number generator
+	@param x an output internally randomly generated if R!=NULL, otherwise must be provided as an input
+	@param pin is the input PIN number
+	@param T is the input M-Pin token (the client secret with PIN portion removed)
+	@param S is the reconstructed client secret
+	@param U is output = x.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_1(octet *HID, csprng *R, octet *x, int pin, octet *T, octet *S, octet *U);
+/**	@brief Generate a random group element
+ *
+	@param R is a pointer to a cryptographically secure random number generator
+	@param S is the output random octet
+	@return 0 or an error code
+ */
+int MPIN_RANDOM_GENERATE(csprng *R, octet *S);
+/**	@brief Perform second pass of the client side of the 3-pass version of the M-Pin protocol
+ *
+	@param x an input, a locally generated random number
+	@param y an input random challenge from the server
+	@param V on output = -(x+y).V
+	@return 0 or an error code
+ */
+int MPIN_CLIENT_2(octet *x, octet *y, octet *V);
+
+/**	@brief Perform final pass on the server side of the M-Pin protocol
+
+	@param HID is input H(ID), a hash of the client ID
+	@param y is the input server's randomly generated challenge
+	@param SS is the input server secret
+	@param U is input from the client = x.H(ID)
+	@param V is an input from the client
+	@return 0 or an error code
+ */
+int MPIN_SERVER(octet *HID, octet *y, octet *SS, octet *U, octet *V);
+
+/**	@brief Create a client secret in G1 from a master secret and the client ID
+ *
+	@param S is an input master secret
+	@param HID is the input client identity hashed to curve
+	@param CS is the full client secret = s.H(ID)
+	@return 0 or an error code
+ */
+int MPIN_GET_CLIENT_SECRET(octet *S, octet *HID, octet *CS);
+
+/**	@brief Create a server secret in G2 from a master secret
+ *
+	@param S is an input master secret
+	@param SS is the server secret = s.Q where Q is a fixed generator of G2
+	@return 0 or an error code
+ */
+int MPIN_GET_SERVER_SECRET(octet *S, octet *SS);
+}
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/newhope.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/newhope.h
new file mode 100644
index 0000000..d7d6ee1
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/newhope.h
@@ -0,0 +1,64 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* NewHope Simple API */
+
+#ifndef NHS_H
+#define NHS_H
+
+#include "core.h"
+
+/* NewHope parameters */
+
+//q= 12289
+
+#define RLWE_PRIME 0x3001	// q in Hex
+#define RLWE_LGN 10			// Degree n=2^LGN
+#define RLWE_ND 0xF7002FFF	// 1/(R-q) mod R
+#define RLWE_ONE 0x2AC8		// R mod q
+#define RLWE_R2MODP 0x1620	// R^2 mod q
+
+namespace core {
+/** @brief NHS server first pass
+ *
+    @param RNG Random Number Generator handle
+    @param SB seed and polynomial B concatenated - output
+    @param S server secret - output
+
+ */
+extern void NHS_SERVER_1(csprng *RNG, octet *SB, octet *S);
+/** @brief NHS client pass
+ *
+    @param RNG Random Number Generator handle
+    @param SB seed and polynomial B concatenated - input
+    @param UC polynomial U and compressed polynomial c - output
+    @param KEY client key
+ */
+extern void NHS_CLIENT(csprng *RNG, octet *SB, octet *UC, octet *KEY);
+/** @brief NHS server second pass
+ *
+    @param S server secret - input
+    @param UC polynomial U and compressed polynomial c - input
+    @param KEY server key
+ */
+extern void NHS_SERVER_2(octet *S, octet *UC, octet *KEY);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/pair.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/pair.h
new file mode 100644
index 0000000..e7e445f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/pair.h
@@ -0,0 +1,183 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef PAIR_ZZZ_H
+#define PAIR_ZZZ_H
+
+#include "fp12_YYY.h"
+#include "ecp2_ZZZ.h"
+#include "ecp_ZZZ.h"
+
+using namespace core;
+
+namespace ZZZ {
+/* Pairing constants */
+
+extern const XXX::BIG CURVE_Bnx; /**< BN curve x parameter */
+extern const XXX::BIG CURVE_Cru; /**< BN curve Cube Root of Unity */
+
+extern const XXX::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const XXX::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const XXX::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const XXX::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+/* Pairing function prototypes */
+
+
+/**	@brief Precompute line functions details for fixed G2 value
+ *
+	@param T array of precomputed FP4 partial line functions
+	@param GV a fixed ECP2 instance
+ */
+extern void PAIR_precomp(YYY::FP4 T[], ECP2* GV);
+
+/**	@brief Compute line functions for n-pairing
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param PV ECP2 instance, an element of G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another(YYY::FP12 r[], ECP2* PV, ECP* QV);
+
+
+/**	@brief Compute line functions for n-pairing, assuming precomputation on G2
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param T array contains precomputed partial line fucntions from G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another_pc(YYY::FP12 r[], YYY::FP4 T[], ECP *QV);
+
+
+
+/**	@brief Calculate Miller loop for Optimal ATE pairing e(P,Q)
+ *
+	@param r FP12 result of the pairing calculation e(P,Q)
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+
+ */
+extern void PAIR_ate(YYY::FP12 *r, ECP2 *P, ECP *Q);
+/**	@brief Calculate Miller loop for Optimal ATE double-pairing e(P,Q).e(R,S)
+ *
+	Faster than calculating two separate pairings
+	@param r FP12 result of the pairing calculation e(P,Q).e(R,S), an element of GT
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+	@param R ECP2 instance, an element of G2
+	@param S ECP instance, an element of G1
+ */
+extern void PAIR_double_ate(YYY::FP12 *r, ECP2 *P, ECP *Q, ECP2 *R, ECP *S);
+/**	@brief Final exponentiation of pairing, converts output of Miller loop to element in GT
+ *
+	Here p is the internal modulus, and r is the group order
+	@param x FP12, on exit = x^((p^12-1)/r)
+ */
+extern void PAIR_fexp(YYY::FP12 *x);
+/**	@brief Fast point multiplication of a member of the group G1 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param Q ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G1mul(ECP *Q, XXX::BIG b);
+/**	@brief Fast point multiplication of a member of the group G2 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param P ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G2mul(ECP2 *P, XXX::BIG b);
+
+
+
+/**	@brief Fast raising of a member of GT to a BIG power
+ *
+	May exploit endomorphism for speed.
+	@param x FP12 member of GT.
+	@param b BIG exponent
+
+ */
+extern void PAIR_GTpow(YYY::FP12 *x, XXX::BIG b);
+
+
+/**	@brief Tests ECP for membership of G1
+ *
+	@param P ECP member of G1
+	@return true or false
+
+ */
+extern int PAIR_G1member(ZZZ::ECP *P);
+
+/**	@brief Tests ECP2 for membership of G2
+ *
+	@param P ECP2 member of G2
+	@return true or false
+
+ */
+extern int PAIR_G2member(ZZZ::ECP2 *P);
+
+/**	@brief Tests FP12 for membership of cyclotomic sub-group
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTcyclotomic(YYY::FP12 *x);
+
+/**	@brief Tests FP12 for membership of GT
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTmember(YYY::FP12 *x);
+
+/**	@brief Prepare Ate parameter
+ *
+	@param n BIG parameter
+	@param n3 BIG paramter = 3*n
+	@return number of nits in n3
+
+ */
+extern int PAIR_nbits(XXX::BIG n3, XXX::BIG n);
+
+/**	@brief Initialise structure for multi-pairing
+ *
+	@param r FP12 array, to be initialised to 1
+
+ */
+extern void PAIR_initmp(YYY::FP12 r[]);
+
+
+/**	@brief Miller loop
+ *
+ 	@param res FP12 result
+	@param r FP12 precomputed array of accumulated line functions
+
+ */
+extern void PAIR_miller(YYY::FP12 *res, YYY::FP12 r[]);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/pair4.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/pair4.h
new file mode 100644
index 0000000..c9b9571
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/pair4.h
@@ -0,0 +1,180 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef PAIR4_ZZZ_H
+#define PAIR4_ZZZ_H
+
+#include "fp24_YYY.h"
+#include "ecp4_ZZZ.h"
+#include "ecp_ZZZ.h"
+
+using namespace core;
+
+namespace ZZZ {
+/* Pairing constants */
+
+extern const XXX::BIG CURVE_Bnx; /**< BN curve x parameter */
+extern const XXX::BIG CURVE_Cru; /**< BN curve Cube Root of Unity */
+
+extern const XXX::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const XXX::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const XXX::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const XXX::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+/* Pairing function prototypes */
+
+/**	@brief Precompute line functions details for fixed G2 value
+ *
+	@param T array of precomputed FP8 partial line functions
+	@param GV a fixed ECP4 instance
+ */
+extern void PAIR_precomp(YYY::FP8 T[], ECP4* GV);
+
+
+/**	@brief Calculate Miller loop for Optimal ATE pairing e(P,Q)
+ *
+	@param r FP24 result of the pairing calculation e(P,Q)
+	@param P ECP4 instance, an element of G2
+	@param Q ECP instance, an element of G1
+
+ */
+extern void PAIR_ate(YYY::FP24 *r, ECP4 *P, ECP *Q);
+/**	@brief Calculate Miller loop for Optimal ATE double-pairing e(P,Q).e(R,S)
+ *
+	Faster than calculating two separate pairings
+	@param r FP24 result of the pairing calculation e(P,Q).e(R,S), an element of GT
+	@param P ECP4 instance, an element of G2
+	@param Q ECP instance, an element of G1
+	@param R ECP4 instance, an element of G2
+	@param S ECP instance, an element of G1
+ */
+extern void PAIR_double_ate(YYY::FP24 *r, ECP4 *P, ECP *Q, ECP4 *R, ECP *S);
+/**	@brief Final exponentiation of pairing, converts output of Miller loop to element in GT
+ *
+	Here p is the internal modulus, and r is the group order
+	@param x FP24, on exit = x^((p^12-1)/r)
+ */
+extern void PAIR_fexp(YYY::FP24 *x);
+/**	@brief Fast point multiplication of a member of the group G1 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param Q ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G1mul(ECP *Q, XXX::BIG b);
+/**	@brief Fast point multiplication of a member of the group G2 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param P ECP4 member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G2mul(ECP4 *P, XXX::BIG b);
+/**	@brief Fast raising of a member of GT to a BIG power
+ *
+	May exploit endomorphism for speed.
+	@param x FP24 member of GT.
+	@param b BIG exponent
+
+ */
+extern void PAIR_GTpow(YYY::FP24 *x, XXX::BIG b);
+
+/**	@brief Tests ECP for membership of G1
+ *
+	@param P ECP member of G1
+	@return true or false
+
+ */
+extern int PAIR_G1member(ZZZ::ECP *P);
+
+/**	@brief Tests ECP4 for membership of G2
+ *
+	@param P ECP4 member of G2
+	@return true or false
+
+ */
+extern int PAIR_G2member(ZZZ::ECP4 *P);
+
+
+/**	@brief Tests FP24 for membership of cyclotomic subgroup
+ *
+	@param x FP24 instance
+	@return 1 if x is cyclotomic, else return 0
+
+ */
+extern int PAIR_GTcyclotomic(YYY::FP24 *x);
+
+
+/**	@brief Tests FP24 for full membership of GT
+ *
+	@param x FP24 instance
+	@return 1 if x is in GT, else return 0
+
+ */
+extern int PAIR_GTmember(YYY::FP24 *x);
+
+
+/**	@brief Precompute line functions for n-pairing
+ *
+	@param r array of precomputed FP24 products of line functions
+	@param PV ECP4 instance, an element of G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another(YYY::FP24 r[], ECP4* PV, ECP* QV);
+
+/**	@brief Compute line functions for n-pairing, assuming precomputation on G2
+ *
+	@param r array of precomputed FP24 products of line functions
+	@param T array contains precomputed partial line fucntions from G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another_pc(YYY::FP24 r[], YYY::FP8 T[], ECP *QV);
+
+
+/**	@brief Prepare Ate parameter
+ *
+	@param n BIG parameter
+	@param n3 BIG paramter = 3*n
+	@return number of nits in n3
+
+ */
+extern int PAIR_nbits(XXX::BIG n3, XXX::BIG n);
+
+/**	@brief Initialise structure for multi-pairing
+ *
+	@param r FP24 array, to be initialised to 1
+
+ */
+extern void PAIR_initmp(YYY::FP24 r[]);
+
+
+/**	@brief Miller loop
+ *
+ 	@param res FP24 result
+	@param r FP24 precomputed array of accumulated line functions
+
+ */
+extern void PAIR_miller(YYY::FP24 *res, YYY::FP24 r[]);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/pair4_BLS24479.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/pair4_BLS24479.h
new file mode 100644
index 0000000..c9b57cd
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/pair4_BLS24479.h
@@ -0,0 +1,180 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef PAIR4_BLS24479_H
+#define PAIR4_BLS24479_H
+
+#include "fp24_BLS24479.h"
+#include "ecp4_BLS24479.h"
+#include "ecp_BLS24479.h"
+
+using namespace core;
+
+namespace BLS24479 {
+/* Pairing constants */
+
+extern const B480_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+extern const B480_56::BIG CURVE_Cru; /**< BN curve Cube Root of Unity */
+
+extern const B480_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B480_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B480_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B480_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+/* Pairing function prototypes */
+
+/**	@brief Precompute line functions details for fixed G2 value
+ *
+	@param T array of precomputed FP8 partial line functions
+	@param GV a fixed ECP4 instance
+ */
+extern void PAIR_precomp(BLS24479::FP8 T[], ECP4* GV);
+
+
+/**	@brief Calculate Miller loop for Optimal ATE pairing e(P,Q)
+ *
+	@param r FP24 result of the pairing calculation e(P,Q)
+	@param P ECP4 instance, an element of G2
+	@param Q ECP instance, an element of G1
+
+ */
+extern void PAIR_ate(BLS24479::FP24 *r, ECP4 *P, ECP *Q);
+/**	@brief Calculate Miller loop for Optimal ATE double-pairing e(P,Q).e(R,S)
+ *
+	Faster than calculating two separate pairings
+	@param r FP24 result of the pairing calculation e(P,Q).e(R,S), an element of GT
+	@param P ECP4 instance, an element of G2
+	@param Q ECP instance, an element of G1
+	@param R ECP4 instance, an element of G2
+	@param S ECP instance, an element of G1
+ */
+extern void PAIR_double_ate(BLS24479::FP24 *r, ECP4 *P, ECP *Q, ECP4 *R, ECP *S);
+/**	@brief Final exponentiation of pairing, converts output of Miller loop to element in GT
+ *
+	Here p is the internal modulus, and r is the group order
+	@param x FP24, on exit = x^((p^12-1)/r)
+ */
+extern void PAIR_fexp(BLS24479::FP24 *x);
+/**	@brief Fast point multiplication of a member of the group G1 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param Q ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G1mul(ECP *Q, B480_56::BIG b);
+/**	@brief Fast point multiplication of a member of the group G2 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param P ECP4 member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G2mul(ECP4 *P, B480_56::BIG b);
+/**	@brief Fast raising of a member of GT to a BIG power
+ *
+	May exploit endomorphism for speed.
+	@param x FP24 member of GT.
+	@param b BIG exponent
+
+ */
+extern void PAIR_GTpow(BLS24479::FP24 *x, B480_56::BIG b);
+
+/**	@brief Tests ECP for membership of G1
+ *
+	@param P ECP member of G1
+	@return true or false
+
+ */
+extern int PAIR_G1member(BLS24479::ECP *P);
+
+/**	@brief Tests ECP4 for membership of G2
+ *
+	@param P ECP4 member of G2
+	@return true or false
+
+ */
+extern int PAIR_G2member(BLS24479::ECP4 *P);
+
+
+/**	@brief Tests FP24 for membership of cyclotomic subgroup
+ *
+	@param x FP24 instance
+	@return 1 if x is cyclotomic, else return 0
+
+ */
+extern int PAIR_GTcyclotomic(BLS24479::FP24 *x);
+
+
+/**	@brief Tests FP24 for full membership of GT
+ *
+	@param x FP24 instance
+	@return 1 if x is in GT, else return 0
+
+ */
+extern int PAIR_GTmember(BLS24479::FP24 *x);
+
+
+/**	@brief Precompute line functions for n-pairing
+ *
+	@param r array of precomputed FP24 products of line functions
+	@param PV ECP4 instance, an element of G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another(BLS24479::FP24 r[], ECP4* PV, ECP* QV);
+
+/**	@brief Compute line functions for n-pairing, assuming precomputation on G2
+ *
+	@param r array of precomputed FP24 products of line functions
+	@param T array contains precomputed partial line fucntions from G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another_pc(BLS24479::FP24 r[], BLS24479::FP8 T[], ECP *QV);
+
+
+/**	@brief Prepare Ate parameter
+ *
+	@param n BIG parameter
+	@param n3 BIG paramter = 3*n
+	@return number of nits in n3
+
+ */
+extern int PAIR_nbits(B480_56::BIG n3, B480_56::BIG n);
+
+/**	@brief Initialise structure for multi-pairing
+ *
+	@param r FP24 array, to be initialised to 1
+
+ */
+extern void PAIR_initmp(BLS24479::FP24 r[]);
+
+
+/**	@brief Miller loop
+ *
+ 	@param res FP24 result
+	@param r FP24 precomputed array of accumulated line functions
+
+ */
+extern void PAIR_miller(BLS24479::FP24 *res, BLS24479::FP24 r[]);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/pair8.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/pair8.h
new file mode 100644
index 0000000..cfd12ee
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/pair8.h
@@ -0,0 +1,179 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef PAIR8_ZZZ_H
+#define PAIR8_ZZZ_H
+
+#include "fp48_YYY.h"
+#include "ecp8_ZZZ.h"
+#include "ecp_ZZZ.h"
+
+using namespace core;
+
+namespace ZZZ {
+/* Pairing constants */
+
+extern const XXX::BIG CURVE_Bnx; /**< BN curve x parameter */
+extern const XXX::BIG CURVE_Cru; /**< BN curve Cube Root of Unity */
+
+extern const XXX::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const XXX::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const XXX::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const XXX::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+/* Pairing function prototypes */
+
+/**	@brief Precompute line functions details for fixed G2 value
+ *
+	@param T array of precomputed FP16 partial line functions
+	@param GV a fixed ECP8 instance
+ */
+extern void PAIR_precomp(YYY::FP16 T[], ECP8* GV);
+
+
+/**	@brief Calculate Miller loop for Optimal ATE pairing e(P,Q)
+ *
+	@param r FP48 result of the pairing calculation e(P,Q)
+	@param P ECP8 instance, an element of G2
+	@param Q ECP instance, an element of G1
+
+ */
+extern void PAIR_ate(YYY::FP48 *r, ECP8 *P, ECP *Q);
+/**	@brief Calculate Miller loop for Optimal ATE double-pairing e(P,Q).e(R,S)
+ *
+	Faster than calculating two separate pairings
+	@param r FP48 result of the pairing calculation e(P,Q).e(R,S), an element of GT
+	@param P ECP8 instance, an element of G2
+	@param Q ECP instance, an element of G1
+	@param R ECP8 instance, an element of G2
+	@param S ECP instance, an element of G1
+ */
+extern void PAIR_double_ate(YYY::FP48 *r, ECP8 *P, ECP *Q, ECP8 *R, ECP *S);
+/**	@brief Final exponentiation of pairing, converts output of Miller loop to element in GT
+ *
+	Here p is the internal modulus, and r is the group order
+	@param x FP48, on exit = x^((p^12-1)/r)
+ */
+extern void PAIR_fexp(YYY::FP48 *x);
+/**	@brief Fast point multiplication of a member of the group G1 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param Q ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G1mul(ECP *Q, XXX::BIG b);
+/**	@brief Fast point multiplication of a member of the group G2 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param P ECP8 member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G2mul(ECP8 *P, XXX::BIG b);
+/**	@brief Fast raising of a member of GT to a BIG power
+ *
+	May exploit endomorphism for speed.
+	@param x FP48 member of GT.
+	@param b BIG exponent
+
+ */
+extern void PAIR_GTpow(YYY::FP48 *x, XXX::BIG b);
+
+/**	@brief Tests ECP for membership of G1
+ *
+	@param P ECP member of G1
+	@return true or false
+
+ */
+extern int PAIR_G1member(ZZZ::ECP *P);
+
+/**	@brief Tests ECP8 for membership of G2
+ *
+	@param P ECP8 member of G2
+	@return true or false
+
+ */
+extern int PAIR_G2member(ZZZ::ECP8 *P);
+
+/**	@brief Tests FP48 for membership of cyclotomic subgroup
+ *
+	@param x FP48 instance
+	@return 1 if x is cyclotomic, else return 0
+
+ */
+extern int PAIR_GTcyclotomic(YYY::FP48 *x);
+
+/**	@brief Tests FP48 for full membership of GT
+ *
+	@param x FP48 instance
+	@return 1 if x is in GT, else return 0
+
+ */
+extern int PAIR_GTmember(YYY::FP48 *x);
+
+/**	@brief Precompute line functions for n-pairing
+ *
+	@param r array of precomputed FP48 products of line functions
+	@param PV ECP8 instance, an element of G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another(YYY::FP48 r[], ECP8* PV, ECP* QV);
+
+
+/**	@brief Compute line functions for n-pairing, assuming precomputation on G2
+ *
+	@param r array of precomputed FP48 products of line functions
+	@param T array contains precomputed partial line fucntions from G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another_pc(YYY::FP48 r[], YYY::FP16 T[], ECP *QV);
+
+
+
+/**	@brief Prepare Ate parameter
+ *
+	@param n BIG parameter
+	@param n3 BIG paramter = 3*n
+	@return number of nits in n3
+
+ */
+extern int PAIR_nbits(XXX::BIG n3, XXX::BIG n);
+
+/**	@brief Initialise structure for multi-pairing
+ *
+	@param r FP48 array, to be initialised to 1
+
+ */
+extern void PAIR_initmp(YYY::FP48 r[]);
+
+
+/**	@brief Miller loop
+ *
+ 	@param res FP48 result
+	@param r FP48 precomputed array of accumulated line functions
+
+ */
+extern void PAIR_miller(YYY::FP48 *res, YYY::FP48 r[]);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/pair8_BLS48286.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/pair8_BLS48286.h
new file mode 100644
index 0000000..69d8655
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/pair8_BLS48286.h
@@ -0,0 +1,179 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef PAIR8_BLS48286_H
+#define PAIR8_BLS48286_H
+
+#include "fp48_BLS48286.h"
+#include "ecp8_BLS48286.h"
+#include "ecp_BLS48286.h"
+
+using namespace core;
+
+namespace BLS48286 {
+/* Pairing constants */
+
+extern const B288_60::BIG CURVE_Bnx; /**< BN curve x parameter */
+extern const B288_60::BIG CURVE_Cru; /**< BN curve Cube Root of Unity */
+
+extern const B288_60::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B288_60::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B288_60::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B288_60::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+/* Pairing function prototypes */
+
+/**	@brief Precompute line functions details for fixed G2 value
+ *
+	@param T array of precomputed FP16 partial line functions
+	@param GV a fixed ECP8 instance
+ */
+extern void PAIR_precomp(BLS48286::FP16 T[], ECP8* GV);
+
+
+/**	@brief Calculate Miller loop for Optimal ATE pairing e(P,Q)
+ *
+	@param r FP48 result of the pairing calculation e(P,Q)
+	@param P ECP8 instance, an element of G2
+	@param Q ECP instance, an element of G1
+
+ */
+extern void PAIR_ate(BLS48286::FP48 *r, ECP8 *P, ECP *Q);
+/**	@brief Calculate Miller loop for Optimal ATE double-pairing e(P,Q).e(R,S)
+ *
+	Faster than calculating two separate pairings
+	@param r FP48 result of the pairing calculation e(P,Q).e(R,S), an element of GT
+	@param P ECP8 instance, an element of G2
+	@param Q ECP instance, an element of G1
+	@param R ECP8 instance, an element of G2
+	@param S ECP instance, an element of G1
+ */
+extern void PAIR_double_ate(BLS48286::FP48 *r, ECP8 *P, ECP *Q, ECP8 *R, ECP *S);
+/**	@brief Final exponentiation of pairing, converts output of Miller loop to element in GT
+ *
+	Here p is the internal modulus, and r is the group order
+	@param x FP48, on exit = x^((p^12-1)/r)
+ */
+extern void PAIR_fexp(BLS48286::FP48 *x);
+/**	@brief Fast point multiplication of a member of the group G1 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param Q ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G1mul(ECP *Q, B288_60::BIG b);
+/**	@brief Fast point multiplication of a member of the group G2 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param P ECP8 member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G2mul(ECP8 *P, B288_60::BIG b);
+/**	@brief Fast raising of a member of GT to a BIG power
+ *
+	May exploit endomorphism for speed.
+	@param x FP48 member of GT.
+	@param b BIG exponent
+
+ */
+extern void PAIR_GTpow(BLS48286::FP48 *x, B288_60::BIG b);
+
+/**	@brief Tests ECP for membership of G1
+ *
+	@param P ECP member of G1
+	@return true or false
+
+ */
+extern int PAIR_G1member(BLS48286::ECP *P);
+
+/**	@brief Tests ECP8 for membership of G2
+ *
+	@param P ECP8 member of G2
+	@return true or false
+
+ */
+extern int PAIR_G2member(BLS48286::ECP8 *P);
+
+/**	@brief Tests FP48 for membership of cyclotomic subgroup
+ *
+	@param x FP48 instance
+	@return 1 if x is cyclotomic, else return 0
+
+ */
+extern int PAIR_GTcyclotomic(BLS48286::FP48 *x);
+
+/**	@brief Tests FP48 for full membership of GT
+ *
+	@param x FP48 instance
+	@return 1 if x is in GT, else return 0
+
+ */
+extern int PAIR_GTmember(BLS48286::FP48 *x);
+
+/**	@brief Precompute line functions for n-pairing
+ *
+	@param r array of precomputed FP48 products of line functions
+	@param PV ECP8 instance, an element of G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another(BLS48286::FP48 r[], ECP8* PV, ECP* QV);
+
+
+/**	@brief Compute line functions for n-pairing, assuming precomputation on G2
+ *
+	@param r array of precomputed FP48 products of line functions
+	@param T array contains precomputed partial line fucntions from G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another_pc(BLS48286::FP48 r[], BLS48286::FP16 T[], ECP *QV);
+
+
+
+/**	@brief Prepare Ate parameter
+ *
+	@param n BIG parameter
+	@param n3 BIG paramter = 3*n
+	@return number of nits in n3
+
+ */
+extern int PAIR_nbits(B288_60::BIG n3, B288_60::BIG n);
+
+/**	@brief Initialise structure for multi-pairing
+ *
+	@param r FP48 array, to be initialised to 1
+
+ */
+extern void PAIR_initmp(BLS48286::FP48 r[]);
+
+
+/**	@brief Miller loop
+ *
+ 	@param res FP48 result
+	@param r FP48 precomputed array of accumulated line functions
+
+ */
+extern void PAIR_miller(BLS48286::FP48 *res, BLS48286::FP48 r[]);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/pair8_BLS48556.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/pair8_BLS48556.h
new file mode 100644
index 0000000..ce7ca73
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/pair8_BLS48556.h
@@ -0,0 +1,179 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef PAIR8_BLS48556_H
+#define PAIR8_BLS48556_H
+
+#include "fp48_BLS48556.h"
+#include "ecp8_BLS48556.h"
+#include "ecp_BLS48556.h"
+
+using namespace core;
+
+namespace BLS48556 {
+/* Pairing constants */
+
+extern const B560_58::BIG CURVE_Bnx; /**< BN curve x parameter */
+extern const B560_58::BIG CURVE_Cru; /**< BN curve Cube Root of Unity */
+
+extern const B560_58::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B560_58::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B560_58::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B560_58::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+/* Pairing function prototypes */
+
+/**	@brief Precompute line functions details for fixed G2 value
+ *
+	@param T array of precomputed FP16 partial line functions
+	@param GV a fixed ECP8 instance
+ */
+extern void PAIR_precomp(BLS48556::FP16 T[], ECP8* GV);
+
+
+/**	@brief Calculate Miller loop for Optimal ATE pairing e(P,Q)
+ *
+	@param r FP48 result of the pairing calculation e(P,Q)
+	@param P ECP8 instance, an element of G2
+	@param Q ECP instance, an element of G1
+
+ */
+extern void PAIR_ate(BLS48556::FP48 *r, ECP8 *P, ECP *Q);
+/**	@brief Calculate Miller loop for Optimal ATE double-pairing e(P,Q).e(R,S)
+ *
+	Faster than calculating two separate pairings
+	@param r FP48 result of the pairing calculation e(P,Q).e(R,S), an element of GT
+	@param P ECP8 instance, an element of G2
+	@param Q ECP instance, an element of G1
+	@param R ECP8 instance, an element of G2
+	@param S ECP instance, an element of G1
+ */
+extern void PAIR_double_ate(BLS48556::FP48 *r, ECP8 *P, ECP *Q, ECP8 *R, ECP *S);
+/**	@brief Final exponentiation of pairing, converts output of Miller loop to element in GT
+ *
+	Here p is the internal modulus, and r is the group order
+	@param x FP48, on exit = x^((p^12-1)/r)
+ */
+extern void PAIR_fexp(BLS48556::FP48 *x);
+/**	@brief Fast point multiplication of a member of the group G1 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param Q ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G1mul(ECP *Q, B560_58::BIG b);
+/**	@brief Fast point multiplication of a member of the group G2 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param P ECP8 member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G2mul(ECP8 *P, B560_58::BIG b);
+/**	@brief Fast raising of a member of GT to a BIG power
+ *
+	May exploit endomorphism for speed.
+	@param x FP48 member of GT.
+	@param b BIG exponent
+
+ */
+extern void PAIR_GTpow(BLS48556::FP48 *x, B560_58::BIG b);
+
+/**	@brief Tests ECP for membership of G1
+ *
+	@param P ECP member of G1
+	@return true or false
+
+ */
+extern int PAIR_G1member(BLS48556::ECP *P);
+
+/**	@brief Tests ECP8 for membership of G2
+ *
+	@param P ECP8 member of G2
+	@return true or false
+
+ */
+extern int PAIR_G2member(BLS48556::ECP8 *P);
+
+/**	@brief Tests FP48 for membership of cyclotomic subgroup
+ *
+	@param x FP48 instance
+	@return 1 if x is cyclotomic, else return 0
+
+ */
+extern int PAIR_GTcyclotomic(BLS48556::FP48 *x);
+
+/**	@brief Tests FP48 for full membership of GT
+ *
+	@param x FP48 instance
+	@return 1 if x is in GT, else return 0
+
+ */
+extern int PAIR_GTmember(BLS48556::FP48 *x);
+
+/**	@brief Precompute line functions for n-pairing
+ *
+	@param r array of precomputed FP48 products of line functions
+	@param PV ECP8 instance, an element of G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another(BLS48556::FP48 r[], ECP8* PV, ECP* QV);
+
+
+/**	@brief Compute line functions for n-pairing, assuming precomputation on G2
+ *
+	@param r array of precomputed FP48 products of line functions
+	@param T array contains precomputed partial line fucntions from G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another_pc(BLS48556::FP48 r[], BLS48556::FP16 T[], ECP *QV);
+
+
+
+/**	@brief Prepare Ate parameter
+ *
+	@param n BIG parameter
+	@param n3 BIG paramter = 3*n
+	@return number of nits in n3
+
+ */
+extern int PAIR_nbits(B560_58::BIG n3, B560_58::BIG n);
+
+/**	@brief Initialise structure for multi-pairing
+ *
+	@param r FP48 array, to be initialised to 1
+
+ */
+extern void PAIR_initmp(BLS48556::FP48 r[]);
+
+
+/**	@brief Miller loop
+ *
+ 	@param res FP48 result
+	@param r FP48 precomputed array of accumulated line functions
+
+ */
+extern void PAIR_miller(BLS48556::FP48 *res, BLS48556::FP48 r[]);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/pair8_BLS48581.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/pair8_BLS48581.h
new file mode 100644
index 0000000..eadd78b
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/pair8_BLS48581.h
@@ -0,0 +1,179 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef PAIR8_BLS48581_H
+#define PAIR8_BLS48581_H
+
+#include "fp48_BLS48581.h"
+#include "ecp8_BLS48581.h"
+#include "ecp_BLS48581.h"
+
+using namespace core;
+
+namespace BLS48581 {
+/* Pairing constants */
+
+extern const B584_60::BIG CURVE_Bnx; /**< BN curve x parameter */
+extern const B584_60::BIG CURVE_Cru; /**< BN curve Cube Root of Unity */
+
+extern const B584_60::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B584_60::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B584_60::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B584_60::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+/* Pairing function prototypes */
+
+/**	@brief Precompute line functions details for fixed G2 value
+ *
+	@param T array of precomputed FP16 partial line functions
+	@param GV a fixed ECP8 instance
+ */
+extern void PAIR_precomp(BLS48581::FP16 T[], ECP8* GV);
+
+
+/**	@brief Calculate Miller loop for Optimal ATE pairing e(P,Q)
+ *
+	@param r FP48 result of the pairing calculation e(P,Q)
+	@param P ECP8 instance, an element of G2
+	@param Q ECP instance, an element of G1
+
+ */
+extern void PAIR_ate(BLS48581::FP48 *r, ECP8 *P, ECP *Q);
+/**	@brief Calculate Miller loop for Optimal ATE double-pairing e(P,Q).e(R,S)
+ *
+	Faster than calculating two separate pairings
+	@param r FP48 result of the pairing calculation e(P,Q).e(R,S), an element of GT
+	@param P ECP8 instance, an element of G2
+	@param Q ECP instance, an element of G1
+	@param R ECP8 instance, an element of G2
+	@param S ECP instance, an element of G1
+ */
+extern void PAIR_double_ate(BLS48581::FP48 *r, ECP8 *P, ECP *Q, ECP8 *R, ECP *S);
+/**	@brief Final exponentiation of pairing, converts output of Miller loop to element in GT
+ *
+	Here p is the internal modulus, and r is the group order
+	@param x FP48, on exit = x^((p^12-1)/r)
+ */
+extern void PAIR_fexp(BLS48581::FP48 *x);
+/**	@brief Fast point multiplication of a member of the group G1 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param Q ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G1mul(ECP *Q, B584_60::BIG b);
+/**	@brief Fast point multiplication of a member of the group G2 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param P ECP8 member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G2mul(ECP8 *P, B584_60::BIG b);
+/**	@brief Fast raising of a member of GT to a BIG power
+ *
+	May exploit endomorphism for speed.
+	@param x FP48 member of GT.
+	@param b BIG exponent
+
+ */
+extern void PAIR_GTpow(BLS48581::FP48 *x, B584_60::BIG b);
+
+/**	@brief Tests ECP for membership of G1
+ *
+	@param P ECP member of G1
+	@return true or false
+
+ */
+extern int PAIR_G1member(BLS48581::ECP *P);
+
+/**	@brief Tests ECP8 for membership of G2
+ *
+	@param P ECP8 member of G2
+	@return true or false
+
+ */
+extern int PAIR_G2member(BLS48581::ECP8 *P);
+
+/**	@brief Tests FP48 for membership of cyclotomic subgroup
+ *
+	@param x FP48 instance
+	@return 1 if x is cyclotomic, else return 0
+
+ */
+extern int PAIR_GTcyclotomic(BLS48581::FP48 *x);
+
+/**	@brief Tests FP48 for full membership of GT
+ *
+	@param x FP48 instance
+	@return 1 if x is in GT, else return 0
+
+ */
+extern int PAIR_GTmember(BLS48581::FP48 *x);
+
+/**	@brief Precompute line functions for n-pairing
+ *
+	@param r array of precomputed FP48 products of line functions
+	@param PV ECP8 instance, an element of G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another(BLS48581::FP48 r[], ECP8* PV, ECP* QV);
+
+
+/**	@brief Compute line functions for n-pairing, assuming precomputation on G2
+ *
+	@param r array of precomputed FP48 products of line functions
+	@param T array contains precomputed partial line fucntions from G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another_pc(BLS48581::FP48 r[], BLS48581::FP16 T[], ECP *QV);
+
+
+
+/**	@brief Prepare Ate parameter
+ *
+	@param n BIG parameter
+	@param n3 BIG paramter = 3*n
+	@return number of nits in n3
+
+ */
+extern int PAIR_nbits(B584_60::BIG n3, B584_60::BIG n);
+
+/**	@brief Initialise structure for multi-pairing
+ *
+	@param r FP48 array, to be initialised to 1
+
+ */
+extern void PAIR_initmp(BLS48581::FP48 r[]);
+
+
+/**	@brief Miller loop
+ *
+ 	@param res FP48 result
+	@param r FP48 precomputed array of accumulated line functions
+
+ */
+extern void PAIR_miller(BLS48581::FP48 *res, BLS48581::FP48 r[]);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/pair_BLS12381.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/pair_BLS12381.h
new file mode 100644
index 0000000..cc610c4
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/pair_BLS12381.h
@@ -0,0 +1,183 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef PAIR_BLS12381_H
+#define PAIR_BLS12381_H
+
+#include "fp12_BLS12381.h"
+#include "ecp2_BLS12381.h"
+#include "ecp_BLS12381.h"
+
+using namespace core;
+
+namespace BLS12381 {
+/* Pairing constants */
+
+extern const B384_58::BIG CURVE_Bnx; /**< BN curve x parameter */
+extern const B384_58::BIG CURVE_Cru; /**< BN curve Cube Root of Unity */
+
+extern const B384_58::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B384_58::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B384_58::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B384_58::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+/* Pairing function prototypes */
+
+
+/**	@brief Precompute line functions details for fixed G2 value
+ *
+	@param T array of precomputed FP4 partial line functions
+	@param GV a fixed ECP2 instance
+ */
+extern void PAIR_precomp(BLS12381::FP4 T[], ECP2* GV);
+
+/**	@brief Compute line functions for n-pairing
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param PV ECP2 instance, an element of G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another(BLS12381::FP12 r[], ECP2* PV, ECP* QV);
+
+
+/**	@brief Compute line functions for n-pairing, assuming precomputation on G2
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param T array contains precomputed partial line fucntions from G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another_pc(BLS12381::FP12 r[], BLS12381::FP4 T[], ECP *QV);
+
+
+
+/**	@brief Calculate Miller loop for Optimal ATE pairing e(P,Q)
+ *
+	@param r FP12 result of the pairing calculation e(P,Q)
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+
+ */
+extern void PAIR_ate(BLS12381::FP12 *r, ECP2 *P, ECP *Q);
+/**	@brief Calculate Miller loop for Optimal ATE double-pairing e(P,Q).e(R,S)
+ *
+	Faster than calculating two separate pairings
+	@param r FP12 result of the pairing calculation e(P,Q).e(R,S), an element of GT
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+	@param R ECP2 instance, an element of G2
+	@param S ECP instance, an element of G1
+ */
+extern void PAIR_double_ate(BLS12381::FP12 *r, ECP2 *P, ECP *Q, ECP2 *R, ECP *S);
+/**	@brief Final exponentiation of pairing, converts output of Miller loop to element in GT
+ *
+	Here p is the internal modulus, and r is the group order
+	@param x FP12, on exit = x^((p^12-1)/r)
+ */
+extern void PAIR_fexp(BLS12381::FP12 *x);
+/**	@brief Fast point multiplication of a member of the group G1 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param Q ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G1mul(ECP *Q, B384_58::BIG b);
+/**	@brief Fast point multiplication of a member of the group G2 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param P ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G2mul(ECP2 *P, B384_58::BIG b);
+
+
+
+/**	@brief Fast raising of a member of GT to a BIG power
+ *
+	May exploit endomorphism for speed.
+	@param x FP12 member of GT.
+	@param b BIG exponent
+
+ */
+extern void PAIR_GTpow(BLS12381::FP12 *x, B384_58::BIG b);
+
+
+/**	@brief Tests ECP for membership of G1
+ *
+	@param P ECP member of G1
+	@return true or false
+
+ */
+extern int PAIR_G1member(BLS12381::ECP *P);
+
+/**	@brief Tests ECP2 for membership of G2
+ *
+	@param P ECP2 member of G2
+	@return true or false
+
+ */
+extern int PAIR_G2member(BLS12381::ECP2 *P);
+
+/**	@brief Tests FP12 for membership of cyclotomic sub-group
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTcyclotomic(BLS12381::FP12 *x);
+
+/**	@brief Tests FP12 for membership of GT
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTmember(BLS12381::FP12 *x);
+
+/**	@brief Prepare Ate parameter
+ *
+	@param n BIG parameter
+	@param n3 BIG paramter = 3*n
+	@return number of nits in n3
+
+ */
+extern int PAIR_nbits(B384_58::BIG n3, B384_58::BIG n);
+
+/**	@brief Initialise structure for multi-pairing
+ *
+	@param r FP12 array, to be initialised to 1
+
+ */
+extern void PAIR_initmp(BLS12381::FP12 r[]);
+
+
+/**	@brief Miller loop
+ *
+ 	@param res FP12 result
+	@param r FP12 precomputed array of accumulated line functions
+
+ */
+extern void PAIR_miller(BLS12381::FP12 *res, BLS12381::FP12 r[]);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/pair_BLS12383.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/pair_BLS12383.h
new file mode 100644
index 0000000..be751af
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/pair_BLS12383.h
@@ -0,0 +1,183 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef PAIR_BLS12383_H
+#define PAIR_BLS12383_H
+
+#include "fp12_BLS12383.h"
+#include "ecp2_BLS12383.h"
+#include "ecp_BLS12383.h"
+
+using namespace core;
+
+namespace BLS12383 {
+/* Pairing constants */
+
+extern const B384_58::BIG CURVE_Bnx; /**< BN curve x parameter */
+extern const B384_58::BIG CURVE_Cru; /**< BN curve Cube Root of Unity */
+
+extern const B384_58::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B384_58::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B384_58::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B384_58::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+/* Pairing function prototypes */
+
+
+/**	@brief Precompute line functions details for fixed G2 value
+ *
+	@param T array of precomputed FP4 partial line functions
+	@param GV a fixed ECP2 instance
+ */
+extern void PAIR_precomp(BLS12383::FP4 T[], ECP2* GV);
+
+/**	@brief Compute line functions for n-pairing
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param PV ECP2 instance, an element of G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another(BLS12383::FP12 r[], ECP2* PV, ECP* QV);
+
+
+/**	@brief Compute line functions for n-pairing, assuming precomputation on G2
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param T array contains precomputed partial line fucntions from G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another_pc(BLS12383::FP12 r[], BLS12383::FP4 T[], ECP *QV);
+
+
+
+/**	@brief Calculate Miller loop for Optimal ATE pairing e(P,Q)
+ *
+	@param r FP12 result of the pairing calculation e(P,Q)
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+
+ */
+extern void PAIR_ate(BLS12383::FP12 *r, ECP2 *P, ECP *Q);
+/**	@brief Calculate Miller loop for Optimal ATE double-pairing e(P,Q).e(R,S)
+ *
+	Faster than calculating two separate pairings
+	@param r FP12 result of the pairing calculation e(P,Q).e(R,S), an element of GT
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+	@param R ECP2 instance, an element of G2
+	@param S ECP instance, an element of G1
+ */
+extern void PAIR_double_ate(BLS12383::FP12 *r, ECP2 *P, ECP *Q, ECP2 *R, ECP *S);
+/**	@brief Final exponentiation of pairing, converts output of Miller loop to element in GT
+ *
+	Here p is the internal modulus, and r is the group order
+	@param x FP12, on exit = x^((p^12-1)/r)
+ */
+extern void PAIR_fexp(BLS12383::FP12 *x);
+/**	@brief Fast point multiplication of a member of the group G1 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param Q ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G1mul(ECP *Q, B384_58::BIG b);
+/**	@brief Fast point multiplication of a member of the group G2 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param P ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G2mul(ECP2 *P, B384_58::BIG b);
+
+
+
+/**	@brief Fast raising of a member of GT to a BIG power
+ *
+	May exploit endomorphism for speed.
+	@param x FP12 member of GT.
+	@param b BIG exponent
+
+ */
+extern void PAIR_GTpow(BLS12383::FP12 *x, B384_58::BIG b);
+
+
+/**	@brief Tests ECP for membership of G1
+ *
+	@param P ECP member of G1
+	@return true or false
+
+ */
+extern int PAIR_G1member(BLS12383::ECP *P);
+
+/**	@brief Tests ECP2 for membership of G2
+ *
+	@param P ECP2 member of G2
+	@return true or false
+
+ */
+extern int PAIR_G2member(BLS12383::ECP2 *P);
+
+/**	@brief Tests FP12 for membership of cyclotomic sub-group
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTcyclotomic(BLS12383::FP12 *x);
+
+/**	@brief Tests FP12 for membership of GT
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTmember(BLS12383::FP12 *x);
+
+/**	@brief Prepare Ate parameter
+ *
+	@param n BIG parameter
+	@param n3 BIG paramter = 3*n
+	@return number of nits in n3
+
+ */
+extern int PAIR_nbits(B384_58::BIG n3, B384_58::BIG n);
+
+/**	@brief Initialise structure for multi-pairing
+ *
+	@param r FP12 array, to be initialised to 1
+
+ */
+extern void PAIR_initmp(BLS12383::FP12 r[]);
+
+
+/**	@brief Miller loop
+ *
+ 	@param res FP12 result
+	@param r FP12 precomputed array of accumulated line functions
+
+ */
+extern void PAIR_miller(BLS12383::FP12 *res, BLS12383::FP12 r[]);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/pair_BLS12443.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/pair_BLS12443.h
new file mode 100644
index 0000000..ace34c4
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/pair_BLS12443.h
@@ -0,0 +1,183 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef PAIR_BLS12443_H
+#define PAIR_BLS12443_H
+
+#include "fp12_BLS12443.h"
+#include "ecp2_BLS12443.h"
+#include "ecp_BLS12443.h"
+
+using namespace core;
+
+namespace BLS12443 {
+/* Pairing constants */
+
+extern const B448_60::BIG CURVE_Bnx; /**< BN curve x parameter */
+extern const B448_60::BIG CURVE_Cru; /**< BN curve Cube Root of Unity */
+
+extern const B448_60::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B448_60::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B448_60::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B448_60::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+/* Pairing function prototypes */
+
+
+/**	@brief Precompute line functions details for fixed G2 value
+ *
+	@param T array of precomputed FP4 partial line functions
+	@param GV a fixed ECP2 instance
+ */
+extern void PAIR_precomp(BLS12443::FP4 T[], ECP2* GV);
+
+/**	@brief Compute line functions for n-pairing
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param PV ECP2 instance, an element of G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another(BLS12443::FP12 r[], ECP2* PV, ECP* QV);
+
+
+/**	@brief Compute line functions for n-pairing, assuming precomputation on G2
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param T array contains precomputed partial line fucntions from G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another_pc(BLS12443::FP12 r[], BLS12443::FP4 T[], ECP *QV);
+
+
+
+/**	@brief Calculate Miller loop for Optimal ATE pairing e(P,Q)
+ *
+	@param r FP12 result of the pairing calculation e(P,Q)
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+
+ */
+extern void PAIR_ate(BLS12443::FP12 *r, ECP2 *P, ECP *Q);
+/**	@brief Calculate Miller loop for Optimal ATE double-pairing e(P,Q).e(R,S)
+ *
+	Faster than calculating two separate pairings
+	@param r FP12 result of the pairing calculation e(P,Q).e(R,S), an element of GT
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+	@param R ECP2 instance, an element of G2
+	@param S ECP instance, an element of G1
+ */
+extern void PAIR_double_ate(BLS12443::FP12 *r, ECP2 *P, ECP *Q, ECP2 *R, ECP *S);
+/**	@brief Final exponentiation of pairing, converts output of Miller loop to element in GT
+ *
+	Here p is the internal modulus, and r is the group order
+	@param x FP12, on exit = x^((p^12-1)/r)
+ */
+extern void PAIR_fexp(BLS12443::FP12 *x);
+/**	@brief Fast point multiplication of a member of the group G1 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param Q ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G1mul(ECP *Q, B448_60::BIG b);
+/**	@brief Fast point multiplication of a member of the group G2 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param P ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G2mul(ECP2 *P, B448_60::BIG b);
+
+
+
+/**	@brief Fast raising of a member of GT to a BIG power
+ *
+	May exploit endomorphism for speed.
+	@param x FP12 member of GT.
+	@param b BIG exponent
+
+ */
+extern void PAIR_GTpow(BLS12443::FP12 *x, B448_60::BIG b);
+
+
+/**	@brief Tests ECP for membership of G1
+ *
+	@param P ECP member of G1
+	@return true or false
+
+ */
+extern int PAIR_G1member(BLS12443::ECP *P);
+
+/**	@brief Tests ECP2 for membership of G2
+ *
+	@param P ECP2 member of G2
+	@return true or false
+
+ */
+extern int PAIR_G2member(BLS12443::ECP2 *P);
+
+/**	@brief Tests FP12 for membership of cyclotomic sub-group
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTcyclotomic(BLS12443::FP12 *x);
+
+/**	@brief Tests FP12 for membership of GT
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTmember(BLS12443::FP12 *x);
+
+/**	@brief Prepare Ate parameter
+ *
+	@param n BIG parameter
+	@param n3 BIG paramter = 3*n
+	@return number of nits in n3
+
+ */
+extern int PAIR_nbits(B448_60::BIG n3, B448_60::BIG n);
+
+/**	@brief Initialise structure for multi-pairing
+ *
+	@param r FP12 array, to be initialised to 1
+
+ */
+extern void PAIR_initmp(BLS12443::FP12 r[]);
+
+
+/**	@brief Miller loop
+ *
+ 	@param res FP12 result
+	@param r FP12 precomputed array of accumulated line functions
+
+ */
+extern void PAIR_miller(BLS12443::FP12 *res, BLS12443::FP12 r[]);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/pair_BLS12461.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/pair_BLS12461.h
new file mode 100644
index 0000000..9fa4c97
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/pair_BLS12461.h
@@ -0,0 +1,183 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef PAIR_BLS12461_H
+#define PAIR_BLS12461_H
+
+#include "fp12_BLS12461.h"
+#include "ecp2_BLS12461.h"
+#include "ecp_BLS12461.h"
+
+using namespace core;
+
+namespace BLS12461 {
+/* Pairing constants */
+
+extern const B464_60::BIG CURVE_Bnx; /**< BN curve x parameter */
+extern const B464_60::BIG CURVE_Cru; /**< BN curve Cube Root of Unity */
+
+extern const B464_60::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B464_60::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B464_60::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B464_60::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+/* Pairing function prototypes */
+
+
+/**	@brief Precompute line functions details for fixed G2 value
+ *
+	@param T array of precomputed FP4 partial line functions
+	@param GV a fixed ECP2 instance
+ */
+extern void PAIR_precomp(BLS12461::FP4 T[], ECP2* GV);
+
+/**	@brief Compute line functions for n-pairing
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param PV ECP2 instance, an element of G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another(BLS12461::FP12 r[], ECP2* PV, ECP* QV);
+
+
+/**	@brief Compute line functions for n-pairing, assuming precomputation on G2
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param T array contains precomputed partial line fucntions from G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another_pc(BLS12461::FP12 r[], BLS12461::FP4 T[], ECP *QV);
+
+
+
+/**	@brief Calculate Miller loop for Optimal ATE pairing e(P,Q)
+ *
+	@param r FP12 result of the pairing calculation e(P,Q)
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+
+ */
+extern void PAIR_ate(BLS12461::FP12 *r, ECP2 *P, ECP *Q);
+/**	@brief Calculate Miller loop for Optimal ATE double-pairing e(P,Q).e(R,S)
+ *
+	Faster than calculating two separate pairings
+	@param r FP12 result of the pairing calculation e(P,Q).e(R,S), an element of GT
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+	@param R ECP2 instance, an element of G2
+	@param S ECP instance, an element of G1
+ */
+extern void PAIR_double_ate(BLS12461::FP12 *r, ECP2 *P, ECP *Q, ECP2 *R, ECP *S);
+/**	@brief Final exponentiation of pairing, converts output of Miller loop to element in GT
+ *
+	Here p is the internal modulus, and r is the group order
+	@param x FP12, on exit = x^((p^12-1)/r)
+ */
+extern void PAIR_fexp(BLS12461::FP12 *x);
+/**	@brief Fast point multiplication of a member of the group G1 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param Q ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G1mul(ECP *Q, B464_60::BIG b);
+/**	@brief Fast point multiplication of a member of the group G2 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param P ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G2mul(ECP2 *P, B464_60::BIG b);
+
+
+
+/**	@brief Fast raising of a member of GT to a BIG power
+ *
+	May exploit endomorphism for speed.
+	@param x FP12 member of GT.
+	@param b BIG exponent
+
+ */
+extern void PAIR_GTpow(BLS12461::FP12 *x, B464_60::BIG b);
+
+
+/**	@brief Tests ECP for membership of G1
+ *
+	@param P ECP member of G1
+	@return true or false
+
+ */
+extern int PAIR_G1member(BLS12461::ECP *P);
+
+/**	@brief Tests ECP2 for membership of G2
+ *
+	@param P ECP2 member of G2
+	@return true or false
+
+ */
+extern int PAIR_G2member(BLS12461::ECP2 *P);
+
+/**	@brief Tests FP12 for membership of cyclotomic sub-group
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTcyclotomic(BLS12461::FP12 *x);
+
+/**	@brief Tests FP12 for membership of GT
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTmember(BLS12461::FP12 *x);
+
+/**	@brief Prepare Ate parameter
+ *
+	@param n BIG parameter
+	@param n3 BIG paramter = 3*n
+	@return number of nits in n3
+
+ */
+extern int PAIR_nbits(B464_60::BIG n3, B464_60::BIG n);
+
+/**	@brief Initialise structure for multi-pairing
+ *
+	@param r FP12 array, to be initialised to 1
+
+ */
+extern void PAIR_initmp(BLS12461::FP12 r[]);
+
+
+/**	@brief Miller loop
+ *
+ 	@param res FP12 result
+	@param r FP12 precomputed array of accumulated line functions
+
+ */
+extern void PAIR_miller(BLS12461::FP12 *res, BLS12461::FP12 r[]);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/pair_BN158.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/pair_BN158.h
new file mode 100644
index 0000000..8068aac
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/pair_BN158.h
@@ -0,0 +1,183 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef PAIR_BN158_H
+#define PAIR_BN158_H
+
+#include "fp12_BN158.h"
+#include "ecp2_BN158.h"
+#include "ecp_BN158.h"
+
+using namespace core;
+
+namespace BN158 {
+/* Pairing constants */
+
+extern const B160_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+extern const B160_56::BIG CURVE_Cru; /**< BN curve Cube Root of Unity */
+
+extern const B160_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B160_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B160_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B160_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+/* Pairing function prototypes */
+
+
+/**	@brief Precompute line functions details for fixed G2 value
+ *
+	@param T array of precomputed FP4 partial line functions
+	@param GV a fixed ECP2 instance
+ */
+extern void PAIR_precomp(BN158::FP4 T[], ECP2* GV);
+
+/**	@brief Compute line functions for n-pairing
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param PV ECP2 instance, an element of G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another(BN158::FP12 r[], ECP2* PV, ECP* QV);
+
+
+/**	@brief Compute line functions for n-pairing, assuming precomputation on G2
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param T array contains precomputed partial line fucntions from G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another_pc(BN158::FP12 r[], BN158::FP4 T[], ECP *QV);
+
+
+
+/**	@brief Calculate Miller loop for Optimal ATE pairing e(P,Q)
+ *
+	@param r FP12 result of the pairing calculation e(P,Q)
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+
+ */
+extern void PAIR_ate(BN158::FP12 *r, ECP2 *P, ECP *Q);
+/**	@brief Calculate Miller loop for Optimal ATE double-pairing e(P,Q).e(R,S)
+ *
+	Faster than calculating two separate pairings
+	@param r FP12 result of the pairing calculation e(P,Q).e(R,S), an element of GT
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+	@param R ECP2 instance, an element of G2
+	@param S ECP instance, an element of G1
+ */
+extern void PAIR_double_ate(BN158::FP12 *r, ECP2 *P, ECP *Q, ECP2 *R, ECP *S);
+/**	@brief Final exponentiation of pairing, converts output of Miller loop to element in GT
+ *
+	Here p is the internal modulus, and r is the group order
+	@param x FP12, on exit = x^((p^12-1)/r)
+ */
+extern void PAIR_fexp(BN158::FP12 *x);
+/**	@brief Fast point multiplication of a member of the group G1 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param Q ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G1mul(ECP *Q, B160_56::BIG b);
+/**	@brief Fast point multiplication of a member of the group G2 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param P ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G2mul(ECP2 *P, B160_56::BIG b);
+
+
+
+/**	@brief Fast raising of a member of GT to a BIG power
+ *
+	May exploit endomorphism for speed.
+	@param x FP12 member of GT.
+	@param b BIG exponent
+
+ */
+extern void PAIR_GTpow(BN158::FP12 *x, B160_56::BIG b);
+
+
+/**	@brief Tests ECP for membership of G1
+ *
+	@param P ECP member of G1
+	@return true or false
+
+ */
+extern int PAIR_G1member(BN158::ECP *P);
+
+/**	@brief Tests ECP2 for membership of G2
+ *
+	@param P ECP2 member of G2
+	@return true or false
+
+ */
+extern int PAIR_G2member(BN158::ECP2 *P);
+
+/**	@brief Tests FP12 for membership of cyclotomic sub-group
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTcyclotomic(BN158::FP12 *x);
+
+/**	@brief Tests FP12 for membership of GT
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTmember(BN158::FP12 *x);
+
+/**	@brief Prepare Ate parameter
+ *
+	@param n BIG parameter
+	@param n3 BIG paramter = 3*n
+	@return number of nits in n3
+
+ */
+extern int PAIR_nbits(B160_56::BIG n3, B160_56::BIG n);
+
+/**	@brief Initialise structure for multi-pairing
+ *
+	@param r FP12 array, to be initialised to 1
+
+ */
+extern void PAIR_initmp(BN158::FP12 r[]);
+
+
+/**	@brief Miller loop
+ *
+ 	@param res FP12 result
+	@param r FP12 precomputed array of accumulated line functions
+
+ */
+extern void PAIR_miller(BN158::FP12 *res, BN158::FP12 r[]);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/pair_BN254.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/pair_BN254.h
new file mode 100644
index 0000000..a7cee7f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/pair_BN254.h
@@ -0,0 +1,183 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef PAIR_BN254_H
+#define PAIR_BN254_H
+
+#include "fp12_BN254.h"
+#include "ecp2_BN254.h"
+#include "ecp_BN254.h"
+
+using namespace core;
+
+namespace BN254 {
+/* Pairing constants */
+
+extern const B256_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+extern const B256_56::BIG CURVE_Cru; /**< BN curve Cube Root of Unity */
+
+extern const B256_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+/* Pairing function prototypes */
+
+
+/**	@brief Precompute line functions details for fixed G2 value
+ *
+	@param T array of precomputed FP4 partial line functions
+	@param GV a fixed ECP2 instance
+ */
+extern void PAIR_precomp(BN254::FP4 T[], ECP2* GV);
+
+/**	@brief Compute line functions for n-pairing
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param PV ECP2 instance, an element of G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another(BN254::FP12 r[], ECP2* PV, ECP* QV);
+
+
+/**	@brief Compute line functions for n-pairing, assuming precomputation on G2
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param T array contains precomputed partial line fucntions from G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another_pc(BN254::FP12 r[], BN254::FP4 T[], ECP *QV);
+
+
+
+/**	@brief Calculate Miller loop for Optimal ATE pairing e(P,Q)
+ *
+	@param r FP12 result of the pairing calculation e(P,Q)
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+
+ */
+extern void PAIR_ate(BN254::FP12 *r, ECP2 *P, ECP *Q);
+/**	@brief Calculate Miller loop for Optimal ATE double-pairing e(P,Q).e(R,S)
+ *
+	Faster than calculating two separate pairings
+	@param r FP12 result of the pairing calculation e(P,Q).e(R,S), an element of GT
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+	@param R ECP2 instance, an element of G2
+	@param S ECP instance, an element of G1
+ */
+extern void PAIR_double_ate(BN254::FP12 *r, ECP2 *P, ECP *Q, ECP2 *R, ECP *S);
+/**	@brief Final exponentiation of pairing, converts output of Miller loop to element in GT
+ *
+	Here p is the internal modulus, and r is the group order
+	@param x FP12, on exit = x^((p^12-1)/r)
+ */
+extern void PAIR_fexp(BN254::FP12 *x);
+/**	@brief Fast point multiplication of a member of the group G1 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param Q ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G1mul(ECP *Q, B256_56::BIG b);
+/**	@brief Fast point multiplication of a member of the group G2 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param P ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G2mul(ECP2 *P, B256_56::BIG b);
+
+
+
+/**	@brief Fast raising of a member of GT to a BIG power
+ *
+	May exploit endomorphism for speed.
+	@param x FP12 member of GT.
+	@param b BIG exponent
+
+ */
+extern void PAIR_GTpow(BN254::FP12 *x, B256_56::BIG b);
+
+
+/**	@brief Tests ECP for membership of G1
+ *
+	@param P ECP member of G1
+	@return true or false
+
+ */
+extern int PAIR_G1member(BN254::ECP *P);
+
+/**	@brief Tests ECP2 for membership of G2
+ *
+	@param P ECP2 member of G2
+	@return true or false
+
+ */
+extern int PAIR_G2member(BN254::ECP2 *P);
+
+/**	@brief Tests FP12 for membership of cyclotomic sub-group
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTcyclotomic(BN254::FP12 *x);
+
+/**	@brief Tests FP12 for membership of GT
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTmember(BN254::FP12 *x);
+
+/**	@brief Prepare Ate parameter
+ *
+	@param n BIG parameter
+	@param n3 BIG paramter = 3*n
+	@return number of nits in n3
+
+ */
+extern int PAIR_nbits(B256_56::BIG n3, B256_56::BIG n);
+
+/**	@brief Initialise structure for multi-pairing
+ *
+	@param r FP12 array, to be initialised to 1
+
+ */
+extern void PAIR_initmp(BN254::FP12 r[]);
+
+
+/**	@brief Miller loop
+ *
+ 	@param res FP12 result
+	@param r FP12 precomputed array of accumulated line functions
+
+ */
+extern void PAIR_miller(BN254::FP12 *res, BN254::FP12 r[]);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/pair_BN254CX.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/pair_BN254CX.h
new file mode 100644
index 0000000..5f5a0ec
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/pair_BN254CX.h
@@ -0,0 +1,183 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef PAIR_BN254CX_H
+#define PAIR_BN254CX_H
+
+#include "fp12_BN254CX.h"
+#include "ecp2_BN254CX.h"
+#include "ecp_BN254CX.h"
+
+using namespace core;
+
+namespace BN254CX {
+/* Pairing constants */
+
+extern const B256_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+extern const B256_56::BIG CURVE_Cru; /**< BN curve Cube Root of Unity */
+
+extern const B256_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+/* Pairing function prototypes */
+
+
+/**	@brief Precompute line functions details for fixed G2 value
+ *
+	@param T array of precomputed FP4 partial line functions
+	@param GV a fixed ECP2 instance
+ */
+extern void PAIR_precomp(BN254CX::FP4 T[], ECP2* GV);
+
+/**	@brief Compute line functions for n-pairing
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param PV ECP2 instance, an element of G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another(BN254CX::FP12 r[], ECP2* PV, ECP* QV);
+
+
+/**	@brief Compute line functions for n-pairing, assuming precomputation on G2
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param T array contains precomputed partial line fucntions from G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another_pc(BN254CX::FP12 r[], BN254CX::FP4 T[], ECP *QV);
+
+
+
+/**	@brief Calculate Miller loop for Optimal ATE pairing e(P,Q)
+ *
+	@param r FP12 result of the pairing calculation e(P,Q)
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+
+ */
+extern void PAIR_ate(BN254CX::FP12 *r, ECP2 *P, ECP *Q);
+/**	@brief Calculate Miller loop for Optimal ATE double-pairing e(P,Q).e(R,S)
+ *
+	Faster than calculating two separate pairings
+	@param r FP12 result of the pairing calculation e(P,Q).e(R,S), an element of GT
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+	@param R ECP2 instance, an element of G2
+	@param S ECP instance, an element of G1
+ */
+extern void PAIR_double_ate(BN254CX::FP12 *r, ECP2 *P, ECP *Q, ECP2 *R, ECP *S);
+/**	@brief Final exponentiation of pairing, converts output of Miller loop to element in GT
+ *
+	Here p is the internal modulus, and r is the group order
+	@param x FP12, on exit = x^((p^12-1)/r)
+ */
+extern void PAIR_fexp(BN254CX::FP12 *x);
+/**	@brief Fast point multiplication of a member of the group G1 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param Q ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G1mul(ECP *Q, B256_56::BIG b);
+/**	@brief Fast point multiplication of a member of the group G2 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param P ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G2mul(ECP2 *P, B256_56::BIG b);
+
+
+
+/**	@brief Fast raising of a member of GT to a BIG power
+ *
+	May exploit endomorphism for speed.
+	@param x FP12 member of GT.
+	@param b BIG exponent
+
+ */
+extern void PAIR_GTpow(BN254CX::FP12 *x, B256_56::BIG b);
+
+
+/**	@brief Tests ECP for membership of G1
+ *
+	@param P ECP member of G1
+	@return true or false
+
+ */
+extern int PAIR_G1member(BN254CX::ECP *P);
+
+/**	@brief Tests ECP2 for membership of G2
+ *
+	@param P ECP2 member of G2
+	@return true or false
+
+ */
+extern int PAIR_G2member(BN254CX::ECP2 *P);
+
+/**	@brief Tests FP12 for membership of cyclotomic sub-group
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTcyclotomic(BN254CX::FP12 *x);
+
+/**	@brief Tests FP12 for membership of GT
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTmember(BN254CX::FP12 *x);
+
+/**	@brief Prepare Ate parameter
+ *
+	@param n BIG parameter
+	@param n3 BIG paramter = 3*n
+	@return number of nits in n3
+
+ */
+extern int PAIR_nbits(B256_56::BIG n3, B256_56::BIG n);
+
+/**	@brief Initialise structure for multi-pairing
+ *
+	@param r FP12 array, to be initialised to 1
+
+ */
+extern void PAIR_initmp(BN254CX::FP12 r[]);
+
+
+/**	@brief Miller loop
+ *
+ 	@param res FP12 result
+	@param r FP12 precomputed array of accumulated line functions
+
+ */
+extern void PAIR_miller(BN254CX::FP12 *res, BN254CX::FP12 r[]);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/pair_BN462.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/pair_BN462.h
new file mode 100644
index 0000000..8f83745
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/pair_BN462.h
@@ -0,0 +1,183 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef PAIR_BN462_H
+#define PAIR_BN462_H
+
+#include "fp12_BN462.h"
+#include "ecp2_BN462.h"
+#include "ecp_BN462.h"
+
+using namespace core;
+
+namespace BN462 {
+/* Pairing constants */
+
+extern const B464_60::BIG CURVE_Bnx; /**< BN curve x parameter */
+extern const B464_60::BIG CURVE_Cru; /**< BN curve Cube Root of Unity */
+
+extern const B464_60::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B464_60::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B464_60::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B464_60::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+/* Pairing function prototypes */
+
+
+/**	@brief Precompute line functions details for fixed G2 value
+ *
+	@param T array of precomputed FP4 partial line functions
+	@param GV a fixed ECP2 instance
+ */
+extern void PAIR_precomp(BN462::FP4 T[], ECP2* GV);
+
+/**	@brief Compute line functions for n-pairing
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param PV ECP2 instance, an element of G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another(BN462::FP12 r[], ECP2* PV, ECP* QV);
+
+
+/**	@brief Compute line functions for n-pairing, assuming precomputation on G2
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param T array contains precomputed partial line fucntions from G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another_pc(BN462::FP12 r[], BN462::FP4 T[], ECP *QV);
+
+
+
+/**	@brief Calculate Miller loop for Optimal ATE pairing e(P,Q)
+ *
+	@param r FP12 result of the pairing calculation e(P,Q)
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+
+ */
+extern void PAIR_ate(BN462::FP12 *r, ECP2 *P, ECP *Q);
+/**	@brief Calculate Miller loop for Optimal ATE double-pairing e(P,Q).e(R,S)
+ *
+	Faster than calculating two separate pairings
+	@param r FP12 result of the pairing calculation e(P,Q).e(R,S), an element of GT
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+	@param R ECP2 instance, an element of G2
+	@param S ECP instance, an element of G1
+ */
+extern void PAIR_double_ate(BN462::FP12 *r, ECP2 *P, ECP *Q, ECP2 *R, ECP *S);
+/**	@brief Final exponentiation of pairing, converts output of Miller loop to element in GT
+ *
+	Here p is the internal modulus, and r is the group order
+	@param x FP12, on exit = x^((p^12-1)/r)
+ */
+extern void PAIR_fexp(BN462::FP12 *x);
+/**	@brief Fast point multiplication of a member of the group G1 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param Q ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G1mul(ECP *Q, B464_60::BIG b);
+/**	@brief Fast point multiplication of a member of the group G2 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param P ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G2mul(ECP2 *P, B464_60::BIG b);
+
+
+
+/**	@brief Fast raising of a member of GT to a BIG power
+ *
+	May exploit endomorphism for speed.
+	@param x FP12 member of GT.
+	@param b BIG exponent
+
+ */
+extern void PAIR_GTpow(BN462::FP12 *x, B464_60::BIG b);
+
+
+/**	@brief Tests ECP for membership of G1
+ *
+	@param P ECP member of G1
+	@return true or false
+
+ */
+extern int PAIR_G1member(BN462::ECP *P);
+
+/**	@brief Tests ECP2 for membership of G2
+ *
+	@param P ECP2 member of G2
+	@return true or false
+
+ */
+extern int PAIR_G2member(BN462::ECP2 *P);
+
+/**	@brief Tests FP12 for membership of cyclotomic sub-group
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTcyclotomic(BN462::FP12 *x);
+
+/**	@brief Tests FP12 for membership of GT
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTmember(BN462::FP12 *x);
+
+/**	@brief Prepare Ate parameter
+ *
+	@param n BIG parameter
+	@param n3 BIG paramter = 3*n
+	@return number of nits in n3
+
+ */
+extern int PAIR_nbits(B464_60::BIG n3, B464_60::BIG n);
+
+/**	@brief Initialise structure for multi-pairing
+ *
+	@param r FP12 array, to be initialised to 1
+
+ */
+extern void PAIR_initmp(BN462::FP12 r[]);
+
+
+/**	@brief Miller loop
+ *
+ 	@param res FP12 result
+	@param r FP12 precomputed array of accumulated line functions
+
+ */
+extern void PAIR_miller(BN462::FP12 *res, BN462::FP12 r[]);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/pair_FP256BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/pair_FP256BN.h
new file mode 100644
index 0000000..ea5b589
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/pair_FP256BN.h
@@ -0,0 +1,183 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef PAIR_FP256BN_H
+#define PAIR_FP256BN_H
+
+#include "fp12_FP256BN.h"
+#include "ecp2_FP256BN.h"
+#include "ecp_FP256BN.h"
+
+using namespace core;
+
+namespace FP256BN {
+/* Pairing constants */
+
+extern const B256_56::BIG CURVE_Bnx; /**< BN curve x parameter */
+extern const B256_56::BIG CURVE_Cru; /**< BN curve Cube Root of Unity */
+
+extern const B256_56::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B256_56::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B256_56::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+/* Pairing function prototypes */
+
+
+/**	@brief Precompute line functions details for fixed G2 value
+ *
+	@param T array of precomputed FP4 partial line functions
+	@param GV a fixed ECP2 instance
+ */
+extern void PAIR_precomp(FP256BN::FP4 T[], ECP2* GV);
+
+/**	@brief Compute line functions for n-pairing
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param PV ECP2 instance, an element of G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another(FP256BN::FP12 r[], ECP2* PV, ECP* QV);
+
+
+/**	@brief Compute line functions for n-pairing, assuming precomputation on G2
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param T array contains precomputed partial line fucntions from G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another_pc(FP256BN::FP12 r[], FP256BN::FP4 T[], ECP *QV);
+
+
+
+/**	@brief Calculate Miller loop for Optimal ATE pairing e(P,Q)
+ *
+	@param r FP12 result of the pairing calculation e(P,Q)
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+
+ */
+extern void PAIR_ate(FP256BN::FP12 *r, ECP2 *P, ECP *Q);
+/**	@brief Calculate Miller loop for Optimal ATE double-pairing e(P,Q).e(R,S)
+ *
+	Faster than calculating two separate pairings
+	@param r FP12 result of the pairing calculation e(P,Q).e(R,S), an element of GT
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+	@param R ECP2 instance, an element of G2
+	@param S ECP instance, an element of G1
+ */
+extern void PAIR_double_ate(FP256BN::FP12 *r, ECP2 *P, ECP *Q, ECP2 *R, ECP *S);
+/**	@brief Final exponentiation of pairing, converts output of Miller loop to element in GT
+ *
+	Here p is the internal modulus, and r is the group order
+	@param x FP12, on exit = x^((p^12-1)/r)
+ */
+extern void PAIR_fexp(FP256BN::FP12 *x);
+/**	@brief Fast point multiplication of a member of the group G1 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param Q ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G1mul(ECP *Q, B256_56::BIG b);
+/**	@brief Fast point multiplication of a member of the group G2 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param P ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G2mul(ECP2 *P, B256_56::BIG b);
+
+
+
+/**	@brief Fast raising of a member of GT to a BIG power
+ *
+	May exploit endomorphism for speed.
+	@param x FP12 member of GT.
+	@param b BIG exponent
+
+ */
+extern void PAIR_GTpow(FP256BN::FP12 *x, B256_56::BIG b);
+
+
+/**	@brief Tests ECP for membership of G1
+ *
+	@param P ECP member of G1
+	@return true or false
+
+ */
+extern int PAIR_G1member(FP256BN::ECP *P);
+
+/**	@brief Tests ECP2 for membership of G2
+ *
+	@param P ECP2 member of G2
+	@return true or false
+
+ */
+extern int PAIR_G2member(FP256BN::ECP2 *P);
+
+/**	@brief Tests FP12 for membership of cyclotomic sub-group
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTcyclotomic(FP256BN::FP12 *x);
+
+/**	@brief Tests FP12 for membership of GT
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTmember(FP256BN::FP12 *x);
+
+/**	@brief Prepare Ate parameter
+ *
+	@param n BIG parameter
+	@param n3 BIG paramter = 3*n
+	@return number of nits in n3
+
+ */
+extern int PAIR_nbits(B256_56::BIG n3, B256_56::BIG n);
+
+/**	@brief Initialise structure for multi-pairing
+ *
+	@param r FP12 array, to be initialised to 1
+
+ */
+extern void PAIR_initmp(FP256BN::FP12 r[]);
+
+
+/**	@brief Miller loop
+ *
+ 	@param res FP12 result
+	@param r FP12 precomputed array of accumulated line functions
+
+ */
+extern void PAIR_miller(FP256BN::FP12 *res, FP256BN::FP12 r[]);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/pair_FP512BN.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/pair_FP512BN.h
new file mode 100644
index 0000000..8de8e9f
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/pair_FP512BN.h
@@ -0,0 +1,183 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef PAIR_FP512BN_H
+#define PAIR_FP512BN_H
+
+#include "fp12_FP512BN.h"
+#include "ecp2_FP512BN.h"
+#include "ecp_FP512BN.h"
+
+using namespace core;
+
+namespace FP512BN {
+/* Pairing constants */
+
+extern const B512_60::BIG CURVE_Bnx; /**< BN curve x parameter */
+extern const B512_60::BIG CURVE_Cru; /**< BN curve Cube Root of Unity */
+
+extern const B512_60::BIG CURVE_W[2];	 /**< BN curve constant for GLV decomposition */
+extern const B512_60::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */
+extern const B512_60::BIG CURVE_WB[4];	 /**< BN curve constant for GS decomposition */
+extern const B512_60::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */
+
+/* Pairing function prototypes */
+
+
+/**	@brief Precompute line functions details for fixed G2 value
+ *
+	@param T array of precomputed FP4 partial line functions
+	@param GV a fixed ECP2 instance
+ */
+extern void PAIR_precomp(FP512BN::FP4 T[], ECP2* GV);
+
+/**	@brief Compute line functions for n-pairing
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param PV ECP2 instance, an element of G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another(FP512BN::FP12 r[], ECP2* PV, ECP* QV);
+
+
+/**	@brief Compute line functions for n-pairing, assuming precomputation on G2
+ *
+	@param r array of precomputed FP12 products of line functions
+	@param T array contains precomputed partial line fucntions from G2
+	@param QV ECP instance, an element of G1
+
+ */
+extern void PAIR_another_pc(FP512BN::FP12 r[], FP512BN::FP4 T[], ECP *QV);
+
+
+
+/**	@brief Calculate Miller loop for Optimal ATE pairing e(P,Q)
+ *
+	@param r FP12 result of the pairing calculation e(P,Q)
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+
+ */
+extern void PAIR_ate(FP512BN::FP12 *r, ECP2 *P, ECP *Q);
+/**	@brief Calculate Miller loop for Optimal ATE double-pairing e(P,Q).e(R,S)
+ *
+	Faster than calculating two separate pairings
+	@param r FP12 result of the pairing calculation e(P,Q).e(R,S), an element of GT
+	@param P ECP2 instance, an element of G2
+	@param Q ECP instance, an element of G1
+	@param R ECP2 instance, an element of G2
+	@param S ECP instance, an element of G1
+ */
+extern void PAIR_double_ate(FP512BN::FP12 *r, ECP2 *P, ECP *Q, ECP2 *R, ECP *S);
+/**	@brief Final exponentiation of pairing, converts output of Miller loop to element in GT
+ *
+	Here p is the internal modulus, and r is the group order
+	@param x FP12, on exit = x^((p^12-1)/r)
+ */
+extern void PAIR_fexp(FP512BN::FP12 *x);
+/**	@brief Fast point multiplication of a member of the group G1 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param Q ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G1mul(ECP *Q, B512_60::BIG b);
+/**	@brief Fast point multiplication of a member of the group G2 by a BIG number
+ *
+	May exploit endomorphism for speed.
+	@param P ECP member of G1.
+	@param b BIG multiplier
+
+ */
+extern void PAIR_G2mul(ECP2 *P, B512_60::BIG b);
+
+
+
+/**	@brief Fast raising of a member of GT to a BIG power
+ *
+	May exploit endomorphism for speed.
+	@param x FP12 member of GT.
+	@param b BIG exponent
+
+ */
+extern void PAIR_GTpow(FP512BN::FP12 *x, B512_60::BIG b);
+
+
+/**	@brief Tests ECP for membership of G1
+ *
+	@param P ECP member of G1
+	@return true or false
+
+ */
+extern int PAIR_G1member(FP512BN::ECP *P);
+
+/**	@brief Tests ECP2 for membership of G2
+ *
+	@param P ECP2 member of G2
+	@return true or false
+
+ */
+extern int PAIR_G2member(FP512BN::ECP2 *P);
+
+/**	@brief Tests FP12 for membership of cyclotomic sub-group
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTcyclotomic(FP512BN::FP12 *x);
+
+/**	@brief Tests FP12 for membership of GT
+ *
+	@param x FP12 instance
+	@return true or false
+
+ */
+extern int PAIR_GTmember(FP512BN::FP12 *x);
+
+/**	@brief Prepare Ate parameter
+ *
+	@param n BIG parameter
+	@param n3 BIG paramter = 3*n
+	@return number of nits in n3
+
+ */
+extern int PAIR_nbits(B512_60::BIG n3, B512_60::BIG n);
+
+/**	@brief Initialise structure for multi-pairing
+ *
+	@param r FP12 array, to be initialised to 1
+
+ */
+extern void PAIR_initmp(FP512BN::FP12 r[]);
+
+
+/**	@brief Miller loop
+ *
+ 	@param res FP12 result
+	@param r FP12 precomputed array of accumulated line functions
+
+ */
+extern void PAIR_miller(FP512BN::FP12 *res, FP512BN::FP12 r[]);
+
+}
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/randapi.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/randapi.h
new file mode 100644
index 0000000..4038228
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/randapi.h
@@ -0,0 +1,43 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef RANDOM_H
+#define RANDOM_H
+
+#include "core.h"
+
+namespace core {
+
+/** @brief Initialise a random number generator
+ *
+    @param R is a pointer to a cryptographically secure random number generator
+    @param S is an input truly random seed value
+ */
+extern void CREATE_CSPRNG(csprng *R, octet *S);
+/** @brief Kill a random number generator
+ *
+    Deletes all internal state
+    @param R is a pointer to a cryptographically secure random number generator
+ */
+extern void KILL_CSPRNG(csprng *R);
+
+}
+
+#endif
+
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/rsa.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/rsa.h
new file mode 100644
index 0000000..334f18e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/rsa.h
@@ -0,0 +1,138 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file rsa.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief RSA Header file for implementation of RSA protocol
+ *
+ * declares functions
+ *
+ */
+
+#ifndef RSA_WWW_H
+#define RSA_WWW_H
+
+#include "ff_WWW.h"
+//#include "rsa_support.h"
+
+using namespace core;
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+#define HASH_TYPE_RSA_WWW SHA256 /**< Chosen Hash algorithm */
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define RFS_WWW MODBYTES_XXX*FFLEN_WWW /**< RSA Public Key Size in bytes */
+
+
+namespace WWW {
+
+/**
+    @brief Integer Factorisation Public Key
+*/
+
+typedef struct
+{
+    sign32 e;     /**< RSA exponent (typically 65537) */
+    XXX::BIG n[FFLEN_WWW]; /**< An array of BIGs to store public key */
+} rsa_public_key;
+
+/**
+    @brief Integer Factorisation Private Key
+*/
+
+typedef struct
+{
+    XXX::BIG p[FFLEN_WWW / 2]; /**< secret prime p  */
+    XXX::BIG q[FFLEN_WWW / 2]; /**< secret prime q  */
+    XXX::BIG dp[FFLEN_WWW / 2]; /**< decrypting exponent mod (p-1)  */
+    XXX::BIG dq[FFLEN_WWW / 2]; /**< decrypting exponent mod (q-1)  */
+    XXX::BIG c[FFLEN_WWW / 2]; /**< 1/p mod q */
+} rsa_private_key;
+
+
+/** @brief RSA Private KEy from OpenSSL 
+ *
+    @param P Input prime number
+    @param Q Input prime number
+    @param DP Input 1/e mod p-1
+    @param DQ Input 1/e mod q-1
+    @param C Input 1/p mod q
+    @param PRIV the output RSA private key
+ */
+extern void RSA_PRIVATE_KEY_FROM_OPENSSL(octet *P,octet* Q,octet *DP,octet *DQ,octet *C,rsa_private_key *PRIV);
+
+/** @brief RSA Key Pair from OpenSSL 
+ *
+    @param e the encryption exponent
+    @param P Input prime number
+    @param Q Input prime number
+    @param DP Input 1/e mod p-1
+    @param DQ Input 1/e mod q-1
+    @param C Input 1/p mod q
+    @param PRIV the output RSA private key
+    @param PUB the output RSA public key
+ */
+extern void RSA_KEY_PAIR_FROM_OPENSSL(sign32 e,octet *P,octet* Q,octet *DP,octet *DQ,octet *C,rsa_private_key *PRIV,rsa_public_key *PUB);
+
+/** @brief RSA Key Pair Generator
+ *
+    @param R is a pointer to a cryptographically secure random number generator
+    @param e the encryption exponent
+    @param PRIV the output RSA private key
+    @param PUB the output RSA public key
+    @param P Input prime number. Used when R is equal to NULL for testing
+    @param Q Input prime number. Used when R is equal to NULL for testing
+ */
+extern void RSA_KEY_PAIR(csprng *R, sign32 e, rsa_private_key* PRIV, rsa_public_key* PUB, octet *P, octet* Q);
+
+/** @brief RSA encryption of suitably padded plaintext
+ *
+    @param PUB the input RSA public key
+    @param F is input padded message
+    @param G is the output ciphertext
+ */
+extern void RSA_ENCRYPT(rsa_public_key* PUB, octet *F, octet *G);
+/** @brief RSA decryption of ciphertext
+ *
+    @param PRIV the input RSA private key
+    @param G is the input ciphertext
+    @param F is output plaintext (requires unpadding)
+
+ */
+extern void RSA_DECRYPT(rsa_private_key* PRIV, octet *G, octet *F);
+/** @brief Destroy an RSA private Key
+ *
+    @param PRIV the input RSA private key. Destroyed on output.
+ */
+extern void RSA_PRIVATE_KEY_KILL(rsa_private_key *PRIV);
+/** @brief Populates an RSA public key from an octet string
+ *
+    Creates RSA public key from big-endian base 256 form.
+    @param x FF instance to be created from an octet string
+    @param S input octet string
+ */
+extern void RSA_fromOctet(XXX::BIG *x, octet *S);
+}
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/rsa_RSA2048.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/rsa_RSA2048.h
new file mode 100644
index 0000000..77600f1
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/rsa_RSA2048.h
@@ -0,0 +1,138 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file rsa.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief RSA Header file for implementation of RSA protocol
+ *
+ * declares functions
+ *
+ */
+
+#ifndef RSA_RSA2048_H
+#define RSA_RSA2048_H
+
+#include "ff_RSA2048.h"
+//#include "rsa_support.h"
+
+using namespace core;
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+#define HASH_TYPE_RSA_RSA2048 SHA256 /**< Chosen Hash algorithm */
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define RFS_RSA2048 MODBYTES_B512_60*FFLEN_RSA2048 /**< RSA Public Key Size in bytes */
+
+
+namespace RSA2048 {
+
+/**
+    @brief Integer Factorisation Public Key
+*/
+
+typedef struct
+{
+    sign32 e;     /**< RSA exponent (typically 65537) */
+    B512_60::BIG n[FFLEN_RSA2048]; /**< An array of BIGs to store public key */
+} rsa_public_key;
+
+/**
+    @brief Integer Factorisation Private Key
+*/
+
+typedef struct
+{
+    B512_60::BIG p[FFLEN_RSA2048 / 2]; /**< secret prime p  */
+    B512_60::BIG q[FFLEN_RSA2048 / 2]; /**< secret prime q  */
+    B512_60::BIG dp[FFLEN_RSA2048 / 2]; /**< decrypting exponent mod (p-1)  */
+    B512_60::BIG dq[FFLEN_RSA2048 / 2]; /**< decrypting exponent mod (q-1)  */
+    B512_60::BIG c[FFLEN_RSA2048 / 2]; /**< 1/p mod q */
+} rsa_private_key;
+
+
+/** @brief RSA Private KEy from OpenSSL 
+ *
+    @param P Input prime number
+    @param Q Input prime number
+    @param DP Input 1/e mod p-1
+    @param DQ Input 1/e mod q-1
+    @param C Input 1/p mod q
+    @param PRIV the output RSA private key
+ */
+extern void RSA_PRIVATE_KEY_FROM_OPENSSL(octet *P,octet* Q,octet *DP,octet *DQ,octet *C,rsa_private_key *PRIV);
+
+/** @brief RSA Key Pair from OpenSSL 
+ *
+    @param e the encryption exponent
+    @param P Input prime number
+    @param Q Input prime number
+    @param DP Input 1/e mod p-1
+    @param DQ Input 1/e mod q-1
+    @param C Input 1/p mod q
+    @param PRIV the output RSA private key
+    @param PUB the output RSA public key
+ */
+extern void RSA_KEY_PAIR_FROM_OPENSSL(sign32 e,octet *P,octet* Q,octet *DP,octet *DQ,octet *C,rsa_private_key *PRIV,rsa_public_key *PUB);
+
+/** @brief RSA Key Pair Generator
+ *
+    @param R is a pointer to a cryptographically secure random number generator
+    @param e the encryption exponent
+    @param PRIV the output RSA private key
+    @param PUB the output RSA public key
+    @param P Input prime number. Used when R is equal to NULL for testing
+    @param Q Input prime number. Used when R is equal to NULL for testing
+ */
+extern void RSA_KEY_PAIR(csprng *R, sign32 e, rsa_private_key* PRIV, rsa_public_key* PUB, octet *P, octet* Q);
+
+/** @brief RSA encryption of suitably padded plaintext
+ *
+    @param PUB the input RSA public key
+    @param F is input padded message
+    @param G is the output ciphertext
+ */
+extern void RSA_ENCRYPT(rsa_public_key* PUB, octet *F, octet *G);
+/** @brief RSA decryption of ciphertext
+ *
+    @param PRIV the input RSA private key
+    @param G is the input ciphertext
+    @param F is output plaintext (requires unpadding)
+
+ */
+extern void RSA_DECRYPT(rsa_private_key* PRIV, octet *G, octet *F);
+/** @brief Destroy an RSA private Key
+ *
+    @param PRIV the input RSA private key. Destroyed on output.
+ */
+extern void RSA_PRIVATE_KEY_KILL(rsa_private_key *PRIV);
+/** @brief Populates an RSA public key from an octet string
+ *
+    Creates RSA public key from big-endian base 256 form.
+    @param x FF instance to be created from an octet string
+    @param S input octet string
+ */
+extern void RSA_fromOctet(B512_60::BIG *x, octet *S);
+}
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/rsa_RSA3072.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/rsa_RSA3072.h
new file mode 100644
index 0000000..4bf0658
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/rsa_RSA3072.h
@@ -0,0 +1,138 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file rsa.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief RSA Header file for implementation of RSA protocol
+ *
+ * declares functions
+ *
+ */
+
+#ifndef RSA_RSA3072_H
+#define RSA_RSA3072_H
+
+#include "ff_RSA3072.h"
+//#include "rsa_support.h"
+
+using namespace core;
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+#define HASH_TYPE_RSA_RSA3072 SHA256 /**< Chosen Hash algorithm */
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define RFS_RSA3072 MODBYTES_B384_56*FFLEN_RSA3072 /**< RSA Public Key Size in bytes */
+
+
+namespace RSA3072 {
+
+/**
+    @brief Integer Factorisation Public Key
+*/
+
+typedef struct
+{
+    sign32 e;     /**< RSA exponent (typically 65537) */
+    B384_56::BIG n[FFLEN_RSA3072]; /**< An array of BIGs to store public key */
+} rsa_public_key;
+
+/**
+    @brief Integer Factorisation Private Key
+*/
+
+typedef struct
+{
+    B384_56::BIG p[FFLEN_RSA3072 / 2]; /**< secret prime p  */
+    B384_56::BIG q[FFLEN_RSA3072 / 2]; /**< secret prime q  */
+    B384_56::BIG dp[FFLEN_RSA3072 / 2]; /**< decrypting exponent mod (p-1)  */
+    B384_56::BIG dq[FFLEN_RSA3072 / 2]; /**< decrypting exponent mod (q-1)  */
+    B384_56::BIG c[FFLEN_RSA3072 / 2]; /**< 1/p mod q */
+} rsa_private_key;
+
+
+/** @brief RSA Private KEy from OpenSSL 
+ *
+    @param P Input prime number
+    @param Q Input prime number
+    @param DP Input 1/e mod p-1
+    @param DQ Input 1/e mod q-1
+    @param C Input 1/p mod q
+    @param PRIV the output RSA private key
+ */
+extern void RSA_PRIVATE_KEY_FROM_OPENSSL(octet *P,octet* Q,octet *DP,octet *DQ,octet *C,rsa_private_key *PRIV);
+
+/** @brief RSA Key Pair from OpenSSL 
+ *
+    @param e the encryption exponent
+    @param P Input prime number
+    @param Q Input prime number
+    @param DP Input 1/e mod p-1
+    @param DQ Input 1/e mod q-1
+    @param C Input 1/p mod q
+    @param PRIV the output RSA private key
+    @param PUB the output RSA public key
+ */
+extern void RSA_KEY_PAIR_FROM_OPENSSL(sign32 e,octet *P,octet* Q,octet *DP,octet *DQ,octet *C,rsa_private_key *PRIV,rsa_public_key *PUB);
+
+/** @brief RSA Key Pair Generator
+ *
+    @param R is a pointer to a cryptographically secure random number generator
+    @param e the encryption exponent
+    @param PRIV the output RSA private key
+    @param PUB the output RSA public key
+    @param P Input prime number. Used when R is equal to NULL for testing
+    @param Q Input prime number. Used when R is equal to NULL for testing
+ */
+extern void RSA_KEY_PAIR(csprng *R, sign32 e, rsa_private_key* PRIV, rsa_public_key* PUB, octet *P, octet* Q);
+
+/** @brief RSA encryption of suitably padded plaintext
+ *
+    @param PUB the input RSA public key
+    @param F is input padded message
+    @param G is the output ciphertext
+ */
+extern void RSA_ENCRYPT(rsa_public_key* PUB, octet *F, octet *G);
+/** @brief RSA decryption of ciphertext
+ *
+    @param PRIV the input RSA private key
+    @param G is the input ciphertext
+    @param F is output plaintext (requires unpadding)
+
+ */
+extern void RSA_DECRYPT(rsa_private_key* PRIV, octet *G, octet *F);
+/** @brief Destroy an RSA private Key
+ *
+    @param PRIV the input RSA private key. Destroyed on output.
+ */
+extern void RSA_PRIVATE_KEY_KILL(rsa_private_key *PRIV);
+/** @brief Populates an RSA public key from an octet string
+ *
+    Creates RSA public key from big-endian base 256 form.
+    @param x FF instance to be created from an octet string
+    @param S input octet string
+ */
+extern void RSA_fromOctet(B384_56::BIG *x, octet *S);
+}
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/rsa_RSA4096.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/rsa_RSA4096.h
new file mode 100644
index 0000000..093db57
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/rsa_RSA4096.h
@@ -0,0 +1,138 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @file rsa.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 2nd June 2015
+ * @brief RSA Header file for implementation of RSA protocol
+ *
+ * declares functions
+ *
+ */
+
+#ifndef RSA_RSA4096_H
+#define RSA_RSA4096_H
+
+#include "ff_RSA4096.h"
+//#include "rsa_support.h"
+
+using namespace core;
+
+/*** START OF USER CONFIGURABLE SECTION -  ***/
+
+#define HASH_TYPE_RSA_RSA4096 SHA256 /**< Chosen Hash algorithm */
+
+/*** END OF USER CONFIGURABLE SECTION ***/
+
+#define RFS_RSA4096 MODBYTES_B512_60*FFLEN_RSA4096 /**< RSA Public Key Size in bytes */
+
+
+namespace RSA4096 {
+
+/**
+    @brief Integer Factorisation Public Key
+*/
+
+typedef struct
+{
+    sign32 e;     /**< RSA exponent (typically 65537) */
+    B512_60::BIG n[FFLEN_RSA4096]; /**< An array of BIGs to store public key */
+} rsa_public_key;
+
+/**
+    @brief Integer Factorisation Private Key
+*/
+
+typedef struct
+{
+    B512_60::BIG p[FFLEN_RSA4096 / 2]; /**< secret prime p  */
+    B512_60::BIG q[FFLEN_RSA4096 / 2]; /**< secret prime q  */
+    B512_60::BIG dp[FFLEN_RSA4096 / 2]; /**< decrypting exponent mod (p-1)  */
+    B512_60::BIG dq[FFLEN_RSA4096 / 2]; /**< decrypting exponent mod (q-1)  */
+    B512_60::BIG c[FFLEN_RSA4096 / 2]; /**< 1/p mod q */
+} rsa_private_key;
+
+
+/** @brief RSA Private KEy from OpenSSL 
+ *
+    @param P Input prime number
+    @param Q Input prime number
+    @param DP Input 1/e mod p-1
+    @param DQ Input 1/e mod q-1
+    @param C Input 1/p mod q
+    @param PRIV the output RSA private key
+ */
+extern void RSA_PRIVATE_KEY_FROM_OPENSSL(octet *P,octet* Q,octet *DP,octet *DQ,octet *C,rsa_private_key *PRIV);
+
+/** @brief RSA Key Pair from OpenSSL 
+ *
+    @param e the encryption exponent
+    @param P Input prime number
+    @param Q Input prime number
+    @param DP Input 1/e mod p-1
+    @param DQ Input 1/e mod q-1
+    @param C Input 1/p mod q
+    @param PRIV the output RSA private key
+    @param PUB the output RSA public key
+ */
+extern void RSA_KEY_PAIR_FROM_OPENSSL(sign32 e,octet *P,octet* Q,octet *DP,octet *DQ,octet *C,rsa_private_key *PRIV,rsa_public_key *PUB);
+
+/** @brief RSA Key Pair Generator
+ *
+    @param R is a pointer to a cryptographically secure random number generator
+    @param e the encryption exponent
+    @param PRIV the output RSA private key
+    @param PUB the output RSA public key
+    @param P Input prime number. Used when R is equal to NULL for testing
+    @param Q Input prime number. Used when R is equal to NULL for testing
+ */
+extern void RSA_KEY_PAIR(csprng *R, sign32 e, rsa_private_key* PRIV, rsa_public_key* PUB, octet *P, octet* Q);
+
+/** @brief RSA encryption of suitably padded plaintext
+ *
+    @param PUB the input RSA public key
+    @param F is input padded message
+    @param G is the output ciphertext
+ */
+extern void RSA_ENCRYPT(rsa_public_key* PUB, octet *F, octet *G);
+/** @brief RSA decryption of ciphertext
+ *
+    @param PRIV the input RSA private key
+    @param G is the input ciphertext
+    @param F is output plaintext (requires unpadding)
+
+ */
+extern void RSA_DECRYPT(rsa_private_key* PRIV, octet *G, octet *F);
+/** @brief Destroy an RSA private Key
+ *
+    @param PRIV the input RSA private key. Destroyed on output.
+ */
+extern void RSA_PRIVATE_KEY_KILL(rsa_private_key *PRIV);
+/** @brief Populates an RSA public key from an octet string
+ *
+    Creates RSA public key from big-endian base 256 form.
+    @param x FF instance to be created from an octet string
+    @param S input octet string
+ */
+extern void RSA_fromOctet(B512_60::BIG *x, octet *S);
+}
+
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/x509.h b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/x509.h
new file mode 100644
index 0000000..bcba4d3
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/miracllll/includes/x509.h
@@ -0,0 +1,212 @@
+/*
+ * Copyright (c) 2012-2020 MIRACL UK Ltd.
+ *
+ * This file is part of MIRACL Core
+ * (see https://github.com/miracl/core).
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/* CORE x509 header file */
+
+/**
+ * @file x509.h
+ * @author Mike Scott and Kealan McCusker
+ * @date 19th May 2015
+ * @brief X509 function Header File
+ *
+ * defines structures
+ * declares functions
+ *
+ */
+
+#ifndef X509_H
+#define X509_H
+
+// Supported Encryption Methods
+
+#define X509_ECC 1
+#define X509_RSA 2
+#define X509_ECD 3
+#define X509_PQ 4
+
+// Supported Hash functions
+
+#define X509_H256 2
+#define X509_H384 3
+#define X509_H512 4
+#define X509_SHAKE256 5
+
+// Supported Curves
+
+#define USE_NIST256 0    /**< For the NIST 256-bit standard curve - WEIERSTRASS only */
+#define USE_ED25519 1     /**< Bernstein's Modulus 2^255-19 - EDWARDS */
+#define USE_ED448 4     /**< Goldilocks Modulus Ed448 - EDWARDS */
+#define USE_BRAINPOOL 2  /**< For Brainpool 256-bit curve - WEIERSTRASS only */
+#define USE_ANSSI 3      /**< For French 256-bit standard curve - WEIERSTRASS only */
+#define USE_NIST384 10   /**< For the NIST 384-bit standard curve - WEIERSTRASS only */
+#define USE_NIST521 12   /**< For the NIST 521-bit standard curve - WEIERSTRASS only */
+
+using namespace core;
+
+extern octet X509_CN;  // Country Name
+extern octet X509_ON;  // organisation Name
+extern octet X509_EN;  // email
+extern octet X509_LN;  // local name
+extern octet X509_UN;  // Unit name (aka Organisation Unit OU)
+extern octet X509_MN;  // My Name (aka Common Name)
+extern octet X509_SN;  // State Name
+
+extern octet X509_AN;  // Alternate Name
+extern octet X509_KU;  // Key Usage
+extern octet X509_BC;  // Basic Constraints
+
+/**
+ * @brief Public key type
+ */
+typedef struct
+{
+    int type;  /**< signature type (ECC or RSA) */
+    int hash;  /**< hash type */
+    int curve; /**< elliptic curve used or RSA key length in bits  */
+} pktype;
+
+
+/* X.509 functions */
+
+/** @brief Extract private key
+ *
+	@param c an X.509 private key 
+	@param pk the extracted private key - for RSA octet = p|q|dp|dq|c, for ECC octet = k
+	@return private key type details 
+*/
+extern pktype X509_extract_private_key(octet *c,octet *pk);
+
+/** @brief Extract certificate signature
+ *
+	@param c an X.509 certificate
+	@param s the extracted signature
+	@return signature type details
+
+*/
+extern pktype X509_extract_cert_sig(octet *c, octet *s);
+/** @brief
+ *
+	@param sc a signed certificate
+	@param c the extracted certificate
+	@return 0 on failure
+*/
+extern int X509_extract_cert(octet *sc, octet *c);
+
+/** @brief
+ *
+	@param c an X.509 certificate
+	@param ptr pointer to ASN.1 raw public key
+	@return length of raw public key
+*/
+extern int X509_find_public_key(octet *c,int *ptr);
+
+/** @brief
+ *
+	@param c an ASN.1 encoded public key
+	@param key the extracted public key
+	@return indicator of public key type (ECC or RSA)
+*/
+extern pktype X509_get_public_key(octet *c,octet *key);
+
+/** @brief
+ *
+	@param c an X.509 certificate
+	@param k the extracted key
+	@return indicator of public key type (ECC or RSA)
+*/
+extern pktype X509_extract_public_key(octet *c, octet *k);
+/** @brief
+ *
+	@param c an X.509 certificate
+    @param len length of issuer field
+	@return 0 on failure, or pointer to issuer field in cert
+*/
+extern int X509_find_issuer(octet *c,int *len);
+/** @brief
+ *
+	@param c an X.509 certificate
+	@return 0 on failure, or pointer to validity field in cert
+*/
+extern int X509_find_validity(octet *c);
+/** @brief
+ *
+	@param c an X.509 certificate
+    @param len length of subject field
+	@return 0 on failure, or pointer to subject field in cert
+*/
+extern int X509_find_subject(octet *c,int *len);
+
+/** @brief
+ *
+	@param c an X.509 certificate
+	@return true if self-signed, else false
+*/
+extern int X509_self_signed(octet *c);
+
+/** @brief
+ *
+	@param c an X.509 certificate
+	@param S is OID of property we are looking for
+	@param s is a pointer to the section of interest in the cert
+	@param f is pointer to the length of the property
+	@return 0 on failure, or pointer to the property
+*/
+extern int X509_find_entity_property(octet *c, octet *S, int s, int *f);
+/** @brief
+ *
+	@param c an X.509 certificate
+	@param s is a pointer to the start of the validity field
+	@return 0 on failure, or pointer to the start date
+*/
+extern int X509_find_start_date(octet *c, int s);
+/** @brief
+ *
+	@param c an X.509 certificate
+	@param s is a pointer to the start of the validity field
+	@return 0 on failure, or pointer to the expiry date
+*/
+extern int X509_find_expiry_date(octet *c, int s);
+
+
+/** @brief
+ *
+	@param c an X.509 certificate
+	@return 0 on failure (or no extensions), or pointer to extensions field in cert
+*/
+extern int X509_find_extensions(octet *c);
+/** @brief
+ *
+	@param c an X.509 certificate
+	@param S is OID of particular extension we are looking for
+	@param s is a pointer to the section of interest in the cert
+	@param f is pointer to the length of the extension
+	@return 0 on failure, or pointer to the extension
+*/
+extern int X509_find_extension(octet *c, octet *S, int s, int *f);
+
+/** @brief
+ *
+	@param c an X.509 certificate
+    @param s is a pointer to certificate extension SubjectAltNames
+    @param name is a URL
+    @return 0 on failure, 1 if URL is in list of alt names
+*/
+extern int X509_find_alt_name(octet *c,int s,char *name);
+
+#endif
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/sal.pdf b/TIIGER_TLS/PQ_TIIGER_TLS/sal/sal.pdf
new file mode 100644
index 0000000..ac71191
Binary files /dev/null and b/TIIGER_TLS/PQ_TIIGER_TLS/sal/sal.pdf differ
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/sal/tls_sal_m.xpp b/TIIGER_TLS/PQ_TIIGER_TLS/sal/tls_sal_m.xpp
new file mode 100644
index 0000000..34eac1e
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/sal/tls_sal_m.xpp
@@ -0,0 +1,1707 @@
+/*
+* JS update 14.04.2024
+* Pridana podpora pre algoritmy ML-KEM a ML-DSA
+* Testovane s novou verziou liboqs 0.10.0
+*/
+
+/*
+* JS update 29.02.2024
+* Pridanie kniznice liboqs, nahradenie funkcii z miracl core
+* Pouzitie generatoru (pseudo)nahodnych cisel z kniznice liboqs
+* Uprava funkcii, ktore priamo vyuzivaju pole s vygenerovanymi cislami
+* Definovanie novych PQ KEM algoritmov do zoznamu
+* Pridane nove PQ algoritmy pre certifikaty a podpis
+* Pridane funkcie pre generovanie sukromneho a verejneho kluca pre KEM protokoly
+* Pridane funkcie na decapsulaciu pre KEM protokoly
+* Pridane funkcii na overenie a podpis novymi PQ algoritmami
+*/
+
+// JS update
+// Cryptographic Security Abstraction Layer API - this version uses MIRACL core & liboqs functions
+//
+
+#include "tls_sal.h"
+
+// Pull in MIRACL core code
+
+#include "core.h"
+#include "ecdh_NIST256.h"  
+#include "ecdh_NIST384.h"
+#include "ecdh_C25519.h"
+#include "rsa_RSA2048.h"
+#include "rsa_RSA4096.h"
+#include "eddsa_Ed25519.h"
+#include "eddsa_Ed448.h"
+#if CRYPTO_SETTING>=POST_QUANTUM
+// JS post-kvantove algoritmy pridane z kniznice liboqs
+#include <oqs/oqs.h>
+#include <oqs/oqsconfig.h>
+#endif
+
+using namespace core;
+
+csprng RNG;    // Global miracl core Crypto Strong RNG - could be a hardware source
+
+// JS definovanie pola pre vygenerovanie 64 nahodnych cisel pouzitych ako seed pre RNG
+uint8_t RNGseed[64];
+
+// JS pridanie liboqs do vypisu
+char* SAL_name()
+{
+    return (char *)"MIRACL Core + liboqs"; 
+}
+
+// JS pole naplnene nahodne vygenerovanymi cislami a pouzite ako seed pre RNG generator
+bool SAL_initLib()
+{ // Initialise library
+    OQS_randombytes(RNGseed, 64);
+    RAND_seed(&RNG, 64, (char*) RNGseed);    
+    return true;
+}
+
+void SAL_endLib()
+{
+}
+
+int SAL_ciphers(int *ciphers)
+{
+    int n=2;
+    ciphers[0]=TLS_AES_128_GCM_SHA256;
+    ciphers[1]=TLS_AES_256_GCM_SHA384;
+    return n;
+}
+
+// IMPORTANT - Favourite group (as used in client Hello) must be placed first in list
+int SAL_groups(int *groups)
+{
+    int n=0;
+
+#if CRYPTO_SETTING==TINY_ECC || CRYPTO_SETTING==EDDSA
+    n=3;
+    groups[0]=X25519;
+    groups[1]=SECP256R1;
+    groups[2]=SECP384R1;
+#endif
+
+#if CRYPTO_SETTING==TYPICAL
+    n=3;
+    groups[0]=X25519;
+    groups[1]=SECP256R1;
+    groups[2]=SECP384R1;
+#endif
+
+// JS doplnene PQ KEM algoritmy
+// BIKE nefunguje na Windowse, preto je jeho pridanie do zoznamu podmienene linuxovym prostredim
+#if CRYPTO_SETTING==POST_QUANTUM
+    n=0;
+   	groups[n]=KYBER512; n++;
+	groups[n]=KYBER768; n++;
+	groups[n]=KYBER1024; n++;
+    groups[n]=MLKEM512; n++;
+    groups[n]=MLKEM768; n++;
+    groups[n]=MLKEM1024; n++;
+	groups[n]=HQC128; n++;
+	groups[n]=HQC192; n++;
+	groups[n]=HQC256; n++;
+	groups[n]=FRODO640AES; n++;
+	groups[n]=FRODO640SHAKE; n++;
+	groups[n]=FRODO976AES; n++;
+	groups[n]=FRODO976SHAKE; n++;
+	groups[n]=FRODO1344AES; n++;
+	groups[n]=FRODO1344SHAKE; n++;
+#ifdef __linux__
+	groups[n]=BIKEL1; n++;
+	groups[n]=BIKEL3; n++;
+	groups[n]=BIKEL5; n++;
+#endif
+
+#endif
+
+    return n;
+}
+
+int SAL_sigs(int *sigAlgs)
+{
+    int n=4;
+    sigAlgs[0]=ECDSA_SECP256R1_SHA256;
+    sigAlgs[1]=ECDSA_SECP384R1_SHA384;
+    sigAlgs[2]=ED25519;
+    sigAlgs[3]=ED448;
+#if CRYPTO_SETTING>TINY_ECC
+    sigAlgs[n]=RSA_PSS_RSAE_SHA256; n++;
+#endif
+
+// JS doplnene PQ algoritmy
+#if CRYPTO_SETTING>=POST_QUANTUM
+	sigAlgs[n]=DILITHIUM2; n++;
+    sigAlgs[n]=DILITHIUM3; n++;
+	sigAlgs[n]=DILITHIUM5; n++;
+    sigAlgs[n]=MLDSA44; n++;
+    sigAlgs[n]=MLDSA65; n++;
+    sigAlgs[n]=MLDSA87; n++;
+    sigAlgs[n]=FALCON512; n++;
+    sigAlgs[n]=FALCON1024; n++;
+    sigAlgs[n]=SPHINCSSHA2128FSIMPLE; n++;
+    sigAlgs[n]=SPHINCSSHA2128SSIMPLE; n++; 
+    sigAlgs[n]=SPHINCSSHAKE128FSIMPLE; n++;
+    //sigAlgs[n]=SPHINCSSHA2192FSIMPLE; n++;
+#endif
+    return n;
+}
+
+int SAL_sigCerts(int *sigAlgsCert)
+{
+    int n=4;
+    sigAlgsCert[0]=ECDSA_SECP256R1_SHA256;
+    sigAlgsCert[1]=ECDSA_SECP384R1_SHA384;
+    sigAlgsCert[2]=ED25519;
+    sigAlgsCert[3]=ED448;
+#if CRYPTO_SETTING>TINY_ECC
+    sigAlgsCert[n]=RSA_PKCS1_SHA256; n++;
+    sigAlgsCert[n]=RSA_PKCS1_SHA384; n++;
+    sigAlgsCert[n]=RSA_PKCS1_SHA512; n++;
+#endif
+
+// JS doplnene PQ algoritmy
+#if CRYPTO_SETTING>=POST_QUANTUM
+    sigAlgsCert[n]=DILITHIUM2; n++;
+    sigAlgsCert[n]=DILITHIUM3; n++;
+    sigAlgsCert[n]=DILITHIUM5; n++;
+    sigAlgsCert[n]=MLDSA44; n++;
+    sigAlgsCert[n]=MLDSA65; n++;
+    sigAlgsCert[n]=MLDSA87; n++;
+    sigAlgsCert[n]=FALCON512; n++;
+    sigAlgsCert[n]=FALCON1024; n++;
+    sigAlgsCert[n]=SPHINCSSHA2128FSIMPLE; n++;
+    sigAlgsCert[n]=SPHINCSSHA2128SSIMPLE; n++;
+    sigAlgsCert[n]=SPHINCSSHAKE128FSIMPLE; n++;
+    //sigAlgsCert[n]=SPHINCSSHA2192FSIMPLE; n++;
+#endif
+    return n;
+}
+
+// return hashtype from cipher_suite
+int SAL_hashType(int cipher_suite)
+{
+    int htype=0;  
+    if (cipher_suite==TLS_AES_128_GCM_SHA256) htype=TLS_SHA256_T;
+    if (cipher_suite==TLS_AES_256_GCM_SHA384) htype=TLS_SHA384_T;
+    if (cipher_suite==TLS_CHACHA20_POLY1305_SHA256) htype=TLS_SHA256_T;
+    return htype;
+}
+
+/*
+// return hashtype from signature algorithm
+int SAL_hashTypeSig(int sigAlg)
+{
+    int htype=0;  
+    if (sigAlg==ECDSA_SECP256R1_SHA256) htype=TLS_SHA256_T;
+    if (sigAlg==ECDSA_SECP384R1_SHA384) htype=TLS_SHA384_T;
+    if (sigAlg==RSA_PSS_RSAE_SHA256) htype=TLS_SHA256_T;
+    if (sigAlg==RSA_PSS_RSAE_SHA384) htype=TLS_SHA384_T;
+    if (sigAlg==RSA_PSS_RSAE_SHA512) htype=TLS_SHA512_T;
+    if (sigAlg==RSA_PKCS1_SHA256) htype=TLS_SHA256_T;
+    if (sigAlg==RSA_PKCS1_SHA384) htype=TLS_SHA384_T;
+    if (sigAlg==RSA_PKCS1_SHA512) htype=TLS_SHA512_T;
+    return htype;
+}
+*/ 
+// return hash length from hash type
+int SAL_hashLen(int hash_type)
+{
+    int hlen=0;
+    if (hash_type==TLS_SHA256_T) hlen=32;
+    if (hash_type==TLS_SHA384_T) hlen=48;
+    if (hash_type==TLS_SHA512_T) hlen=64;
+    return hlen;
+}
+
+int SAL_aeadKeylen(int cipher_suite)
+{
+    int klen=0;
+    if (cipher_suite==TLS_AES_128_GCM_SHA256) klen=16;
+    if (cipher_suite==TLS_AES_256_GCM_SHA384) klen=32;
+    if (cipher_suite==TLS_CHACHA20_POLY1305_SHA256) klen=32;
+    return klen;
+}
+
+int SAL_aeadTaglen(int cipher_suite)
+{
+    int tlen=0;
+    if (cipher_suite==TLS_AES_128_GCM_SHA256) tlen=16;
+    if (cipher_suite==TLS_AES_256_GCM_SHA384) tlen=16;
+    if (cipher_suite==TLS_CHACHA20_POLY1305_SHA256) tlen=16;
+    return tlen;
+}
+
+// convert TLS octad to MIRACL core octet
+static octet octad_to_octet(octad *x)
+{
+    octet y;
+    if (x!=NULL) {
+        y.len=x->len;
+        y.max=x->max;
+        y.val=x->val;
+    } else {
+        y.len=y.max=0;
+        y.val=NULL;
+    }
+    return y;
+}
+
+// Return a random byte
+int SAL_randomByte()
+{
+    return RAND_byte(&RNG);
+}
+
+// Fill an octad with random values
+void SAL_randomOctad(int len,octad *R)
+{
+    for (int i=0;i<len;i++)
+        R->val[i]=SAL_randomByte();
+    R->len=len;
+}
+
+// HKDF - Extract secret from raw input
+void SAL_hkdfExtract(int htype,octad *PRK,octad *SALT,octad *IKM)
+{
+    int hlen=SAL_hashLen(htype);
+    octet MC_PRK=octad_to_octet(PRK);   // Make it MIRACL core compatible
+    octet MC_SALT=octad_to_octet(SALT);
+    octet MC_IKM=octad_to_octet(IKM);
+
+    HKDF_Extract(MC_SHA2,hlen,&MC_PRK,&MC_SALT,&MC_IKM);
+
+    IKM->len=MC_IKM.len;              // restore length
+    SALT->len=MC_SALT.len;
+    PRK->len=MC_PRK.len;
+}
+
+void SAL_hkdfExpand(int htype, int olen, octad *OKM,octad *PRK, octad *INFO)
+{
+    int hlen=SAL_hashLen(htype);
+    octet MC_OKM=octad_to_octet(OKM); 
+    octet MC_INFO=octad_to_octet(INFO);
+    octet MC_PRK=octad_to_octet(PRK);
+
+    HKDF_Expand(MC_SHA2,hlen,&MC_OKM,olen,&MC_PRK,&MC_INFO);
+
+    OKM->len=MC_OKM.len;
+    INFO->len=MC_INFO.len;
+    PRK->len=MC_PRK.len;
+}
+
+// HMAC
+void SAL_hmac(int htype,octad *T,octad *K,octad *M)
+{
+    int hlen=SAL_hashLen(htype);
+    octet MC_T=octad_to_octet(T);
+    octet MC_K=octad_to_octet(K);
+    octet MC_M=octad_to_octet(M);
+
+    HMAC(MC_SHA2,hlen,&MC_T,hlen,&MC_K,&MC_M);
+
+    T->len=MC_T.len;
+    K->len=MC_K.len;
+    M->len=MC_M.len;
+}
+
+// HASH of NULL
+void SAL_hashNull(int htype,octad *H)
+{
+    if (htype==TLS_SHA256_T)
+    {
+        core::hash256 sh;
+        HASH256_init(&sh);
+        HASH256_hash(&sh,H->val);
+    } 
+    if (htype==TLS_SHA384_T)
+    {
+        core::hash384 sh;
+        HASH384_init(&sh);
+        HASH384_hash(&sh,H->val);
+    }     
+    if (htype==TLS_SHA512_T)
+    {
+        core::hash512 sh;
+        HASH512_init(&sh);
+        HASH512_hash(&sh,H->val);
+
+    }     
+    H->len=SAL_hashLen(htype);
+    return;    
+}
+
+// Unified hashing. Hash type type indicate by htype.
+void SAL_hashInit(int htype,unihash *h)
+{
+    if (htype==TLS_SHA256_T) 
+        HASH256_init((core::hash256*)&(h->state));
+    if (htype==TLS_SHA384_T)
+        HASH384_init((core::hash512*)&(h->state));
+    if (htype==TLS_SHA512_T)
+        HASH512_init((core::hash512*)&(h->state));
+    h->htype=htype;
+}
+
+// Process a byte array
+void SAL_hashProcessArray(unihash *h,char *b,int len)
+{
+    int i;
+    if (h->htype==TLS_SHA256_T)
+    {
+        for (i=0;i<len;i++)
+            HASH256_process((core::hash256*)&(h->state),b[i]);   
+    }   
+    if (h->htype==TLS_SHA384_T)
+    {
+        for (i=0;i<len;i++)
+            HASH384_process((core::hash512*)&(h->state),b[i]);   
+    }  
+    if (h->htype==TLS_SHA512_T)
+    {
+        for (i=0;i<len;i++)
+            HASH512_process((core::hash512*)&(h->state),b[i]);   
+    }     
+}
+
+// output digest
+int SAL_hashOutput(unihash *h,char *d)
+{
+    int hlen=SAL_hashLen(h->htype);
+    if (h->htype==TLS_SHA256_T)
+        HASH256_continuing_hash((core::hash256*)&(h->state),d);
+    if (h->htype==TLS_SHA384_T)
+        HASH384_continuing_hash((core::hash384*)&(h->state),d);
+    if (h->htype==TLS_SHA512_T)
+        HASH512_continuing_hash((core::hash512*)&(h->state),d);
+    return hlen;
+}
+
+void SAL_aeadEncrypt(crypto *send,int hdrlen,char *hdr,int ptlen,char *pt,octad *TAG)
+{ // AEAD encryption
+  // its AES-GCM
+    gcm g;
+    GCM_init(&g,send->K.len,send->K.val,12,send->IV.val);  // Encrypt with Key and IV
+    GCM_add_header(&g,hdr,hdrlen);
+    GCM_add_plain(&g,pt,pt,ptlen);
+//create and append TA
+    GCM_finish(&g,TAG->val); 
+    TAG->len=16;
+}
+
+bool SAL_aeadDecrypt(crypto *recv,int hdrlen,char *hdr,int ctlen,char *ct,octad *TAG)
+{ // AEAD decryption
+  // its AES-GCM
+    char ctag[TLS_MAX_TAG_SIZE];   // calculated TAG
+    octad CTAG={0,sizeof(ctag),ctag};
+    gcm g;
+    GCM_init(&g,recv->K.len,recv->K.val,12,recv->IV.val);  // Decrypt with Key and IV
+    GCM_add_header(&g,hdr,hdrlen);
+    GCM_add_cipher(&g,ct,ct,ctlen);
+//create and append TA
+    GCM_finish(&g,CTAG.val); CTAG.len=16;
+    if (!OCT_compare(TAG,&CTAG))
+        return false;
+    return true;
+}
+
+// generate a public/private key pair in an approved group for a key exchange
+void SAL_generateKeyPair(int group,octad *SK,octad *PK)
+{
+    octet MC_SK=octad_to_octet(SK);
+    octet MC_PK=octad_to_octet(PK);
+
+    if (group==X25519)
+    { // Note that this program maintains the private key in big-endian format
+      // But X25519 assumes private and public keys are all in little-endian form (and are transmitted/received in that form)
+        SAL_randomOctad(32,SK);
+        SK->val[31]&=248;  
+        SK->val[0]&=127;
+        SK->val[0]|=64;
+        C25519::ECP_KEY_PAIR_GENERATE(NULL, &MC_SK, &MC_PK);
+        OCT_reverse(&MC_PK);  // public key must be transmitted in little-endian form
+    }
+    if (group==SECP256R1)
+    {
+        SAL_randomOctad(32,SK);
+        NIST256::ECP_KEY_PAIR_GENERATE(NULL, &MC_SK, &MC_PK);
+    }
+    if (group==SECP384R1)
+    {
+        SAL_randomOctad(48,SK);
+        NIST384::ECP_KEY_PAIR_GENERATE(NULL, &MC_SK, &MC_PK);
+    }
+	SK->len=MC_SK.len;
+    	PK->len=MC_PK.len;
+
+//--------------------------------------------------------------------------
+// JS doplnene PQ KEM algoritmy 
+#if CRYPTO_SETTING>=POST_QUANTUM
+    if (group==KYBER768){
+        OQS_STATUS rc = OQS_KEM_kyber_768_keypair((uint8_t*) PK->val, (uint8_t*) SK->val);
+	    if (rc != OQS_SUCCESS) {
+		    fprintf(stderr, "ERROR: OQS_KEM_kyber_768_keypair failed!\n");
+            SK->len=0;
+            PK->len=0;
+        }
+        else{
+            SK->len=OQS_KEM_kyber_768_length_secret_key;
+            PK->len=OQS_KEM_kyber_768_length_public_key;
+        }
+    }
+
+    if (group==KYBER512){
+        OQS_STATUS rc = OQS_KEM_kyber_512_keypair((uint8_t*) PK->val, (uint8_t*) SK->val);
+	    if (rc != OQS_SUCCESS) {
+		    fprintf(stderr, "ERROR: OQS_KEM_kyber_512_keypair failed!\n");
+            SK->len=0;
+            PK->len=0;
+        }
+        else{
+            SK->len=OQS_KEM_kyber_512_length_secret_key;
+            PK->len=OQS_KEM_kyber_512_length_public_key;
+        }
+    }
+
+    if (group==KYBER1024){
+        OQS_STATUS rc = OQS_KEM_kyber_1024_keypair((uint8_t*) PK->val, (uint8_t*) SK->val);
+	    if (rc != OQS_SUCCESS) {
+		    fprintf(stderr, "ERROR: OQS_KEM_kyber_1024_keypair failed!\n");
+            SK->len=0;
+            PK->len=0;
+        }
+        else{
+            SK->len=OQS_KEM_kyber_1024_length_secret_key;
+            PK->len=OQS_KEM_kyber_1024_length_public_key;
+        }
+    }
+
+    if (group==MLKEM512){
+        OQS_STATUS rc = OQS_KEM_ml_kem_512_keypair((uint8_t*) PK->val, (uint8_t*) SK->val);
+	    if (rc != OQS_SUCCESS) {
+		    fprintf(stderr, "ERROR: OQS_KEM_ml_kem_512_keypair failed!\n");
+            SK->len=0;
+            PK->len=0;
+        }
+        else{
+            SK->len=OQS_KEM_ml_kem_512_length_secret_key;
+            PK->len=OQS_KEM_ml_kem_512_length_public_key;
+        }
+    }
+
+    if (group==MLKEM768){
+        OQS_STATUS rc = OQS_KEM_ml_kem_768_keypair((uint8_t*) PK->val, (uint8_t*) SK->val);
+	    if (rc != OQS_SUCCESS) {
+		    fprintf(stderr, "ERROR: OQS_KEM_ml_kem_768_keypair failed!\n");
+            SK->len=0;
+            PK->len=0;
+        }
+        else{
+            SK->len=OQS_KEM_ml_kem_768_length_secret_key;
+            PK->len=OQS_KEM_ml_kem_768_length_public_key;
+        }
+    }
+
+    if (group==MLKEM1024){
+        OQS_STATUS rc = OQS_KEM_ml_kem_1024_keypair((uint8_t*) PK->val, (uint8_t*) SK->val);
+	    if (rc != OQS_SUCCESS) {
+		    fprintf(stderr, "ERROR: OQS_KEM_ml_kem_1024_keypair failed!\n");
+            SK->len=0;
+            PK->len=0;
+        }
+        else{
+            SK->len=OQS_KEM_ml_kem_1024_length_secret_key;
+            PK->len=OQS_KEM_ml_kem_1024_length_public_key;
+        }
+    }
+
+// JS Protokol BIKE nie je podporovany na Windowse, preto je definovany len pre linuxove prostredie
+// Bez podmienky aplikacia na Windowse padne, pretoze liboqs na Windowse neobsahuje funkcie pre BIKE
+#ifdef __linux__
+    if (group==BIKEL1){
+        OQS_STATUS rc = OQS_KEM_bike_l1_keypair((uint8_t*) PK->val, (uint8_t*) SK->val);
+	    if (rc != OQS_SUCCESS) {
+		    fprintf(stderr, "ERROR: OQS_KEM_bike_l1_keypair failed!\n");
+            SK->len=0;
+            PK->len=0;
+        }
+        else{
+            SK->len=OQS_KEM_bike_l1_length_secret_key;
+            PK->len=OQS_KEM_bike_l1_length_public_key;
+        }
+    }
+
+    if (group==BIKEL3){
+        OQS_STATUS rc = OQS_KEM_bike_l3_keypair((uint8_t*) PK->val, (uint8_t*) SK->val);
+	    if (rc != OQS_SUCCESS) {
+		    fprintf(stderr, "ERROR: OQS_KEM_bike_l3_keypair failed!\n");
+            SK->len=0;
+            PK->len=0;
+        }
+        else{
+            SK->len=OQS_KEM_bike_l3_length_secret_key;
+            PK->len=OQS_KEM_bike_l3_length_public_key;
+        }
+    }
+
+    if (group==BIKEL5){
+        OQS_STATUS rc = OQS_KEM_bike_l5_keypair((uint8_t*) PK->val, (uint8_t*) SK->val);
+	    if (rc != OQS_SUCCESS) {
+		    fprintf(stderr, "ERROR: OQS_KEM_bike_l5_keypair failed!\n");
+            SK->len=0;
+            PK->len=0;
+        }
+        else{
+            SK->len=OQS_KEM_bike_l5_length_secret_key;
+            PK->len=OQS_KEM_bike_l5_length_public_key;
+        }
+    }
+#endif
+
+    if (group==HQC128){
+        OQS_STATUS rc = OQS_KEM_hqc_128_keypair((uint8_t*) PK->val, (uint8_t*) SK->val);
+	    if (rc != OQS_SUCCESS) {
+		    fprintf(stderr, "ERROR: OQS_KEM_hqc_128_keypair failed!\n");
+            SK->len=0;
+            PK->len=0;
+        }
+        else{
+            SK->len=OQS_KEM_hqc_128_length_secret_key;
+            PK->len=OQS_KEM_hqc_128_length_public_key;
+        }
+    }
+
+    if (group==HQC192){
+        OQS_STATUS rc = OQS_KEM_hqc_192_keypair((uint8_t*) PK->val, (uint8_t*) SK->val);
+	    if (rc != OQS_SUCCESS) {
+		    fprintf(stderr, "ERROR: OQS_KEM_hqc_192_keypair failed!\n");
+            SK->len=0;
+            PK->len=0;
+        }
+        else{
+            SK->len=OQS_KEM_hqc_192_length_secret_key;
+            PK->len=OQS_KEM_hqc_192_length_public_key;
+        }
+    }
+
+   if (group==HQC256){
+        OQS_STATUS rc = OQS_KEM_hqc_256_keypair((uint8_t*) PK->val, (uint8_t*) SK->val);
+	    if (rc != OQS_SUCCESS) {
+		    fprintf(stderr, "ERROR: OQS_KEM_hqc_256_keypair failed!\n");
+            SK->len=0;
+            PK->len=0;
+        }
+        else{
+            SK->len=OQS_KEM_hqc_256_length_secret_key;
+            PK->len=OQS_KEM_hqc_256_length_public_key;
+        }
+    }
+
+   if (group==FRODO640AES){
+        OQS_STATUS rc = OQS_KEM_frodokem_640_aes_keypair((uint8_t*) PK->val, (uint8_t*) SK->val);
+	    if (rc != OQS_SUCCESS) {
+		    fprintf(stderr, "ERROR: OQS_KEM_frodokem_640_aes_keypair failed!\n");
+            SK->len=0;
+            PK->len=0;
+        }
+        else{
+            SK->len=OQS_KEM_frodokem_640_aes_length_secret_key;
+            PK->len=OQS_KEM_frodokem_640_aes_length_public_key;
+        }
+    }
+
+   if (group==FRODO976AES){
+        OQS_STATUS rc = OQS_KEM_frodokem_976_aes_keypair((uint8_t*) PK->val, (uint8_t*) SK->val);
+	    if (rc != OQS_SUCCESS) {
+		    fprintf(stderr, "ERROR: OQS_KEM_frodokem_976_aes_keypair failed!\n");
+            SK->len=0;
+            PK->len=0;
+        }
+        else{
+            SK->len=OQS_KEM_frodokem_976_aes_length_secret_key;
+            PK->len=OQS_KEM_frodokem_976_aes_length_public_key;
+        }
+    }
+
+   if (group==FRODO1344AES){
+        OQS_STATUS rc = OQS_KEM_frodokem_1344_aes_keypair((uint8_t*) PK->val, (uint8_t*) SK->val);
+	    if (rc != OQS_SUCCESS) {
+		    fprintf(stderr, "ERROR: OQS_KEM_frodokem_1344_aes_keypair failed!\n");
+            SK->len=0;
+            PK->len=0;
+        }
+        else{
+            SK->len=OQS_KEM_frodokem_1344_aes_length_secret_key;
+            PK->len=OQS_KEM_frodokem_1344_aes_length_public_key;
+        }
+    }
+
+
+   if (group==FRODO640SHAKE){
+        OQS_STATUS rc = OQS_KEM_frodokem_640_shake_keypair((uint8_t*) PK->val, (uint8_t*) SK->val);
+	    if (rc != OQS_SUCCESS) {
+		    fprintf(stderr, "ERROR: OQS_KEM_frodokem_640_shake_keypair failed!\n");
+            SK->len=0;
+            PK->len=0;
+        }
+        else{
+            SK->len=OQS_KEM_frodokem_640_shake_length_secret_key;
+            PK->len=OQS_KEM_frodokem_640_shake_length_public_key;
+        }
+    }
+
+   if (group==FRODO976SHAKE){
+        OQS_STATUS rc = OQS_KEM_frodokem_976_shake_keypair((uint8_t*) PK->val, (uint8_t*) SK->val);
+	    if (rc != OQS_SUCCESS) {
+		    fprintf(stderr, "ERROR: OQS_KEM_frodokem_976_shake_keypair failed!\n");
+            SK->len=0;
+            PK->len=0;
+        }
+        else{
+            SK->len=OQS_KEM_frodokem_976_shake_length_secret_key;
+            PK->len=OQS_KEM_frodokem_976_shake_length_public_key;
+        }
+    }
+
+   if (group==FRODO1344SHAKE){
+        OQS_STATUS rc = OQS_KEM_frodokem_1344_shake_keypair((uint8_t*) PK->val, (uint8_t*) SK->val);
+	    if (rc != OQS_SUCCESS) {
+		    fprintf(stderr, "ERROR: OQS_KEM_frodokem_1344_shake_keypair failed!\n");
+            SK->len=0;
+            PK->len=0;
+        }
+        else{
+            SK->len=OQS_KEM_frodokem_1344_shake_length_secret_key;
+            PK->len=OQS_KEM_frodokem_1344_shake_length_public_key;		
+        }
+    }
+//--------------------------------------------------------------------------
+
+#endif
+}
+
+// generate shared secret SS from secret key SK and public key PK
+bool SAL_generateSharedSecret(int group,octad *SK,octad *PK,octad *SS)
+{
+    octet MC_SK=octad_to_octet(SK);
+    octet MC_PK=octad_to_octet(PK);
+    octet MC_SS=octad_to_octet(SS);
+    int res=0;
+
+    if (group==X25519) {
+        OCT_reverse(&MC_PK); // to big endian
+        res=C25519::ECP_SVDP_DH(&MC_SK, &MC_PK, &MC_SS,0);
+        OCT_reverse(&MC_PK); // back again
+        OCT_reverse(&MC_SS);
+    }
+    if (group==SECP256R1) {
+        res=NIST256::ECP_SVDP_DH(&MC_SK, &MC_PK, &MC_SS,0);
+    }
+    if (group==SECP384R1) {
+        res=NIST384::ECP_SVDP_DH(&MC_SK, &MC_PK, &MC_SS,0);
+    }
+    SK->len=MC_SK.len;
+    PK->len=MC_PK.len;
+    SS->len=MC_SS.len;
+
+//--------------------------------------------------------------------------
+// JS doplnene PQ KEM algoritmy
+// Zo strany klienta je pri KEM protokole realizovana len decapsulacia
+#if CRYPTO_SETTING>=POST_QUANTUM
+    if (group==KYBER768) {
+        OQS_STATUS rc = OQS_KEM_kyber_768_decaps( (uint8_t*) SS->val, (uint8_t*) PK->val, (uint8_t*) SK->val);
+    	if (rc != OQS_SUCCESS) {
+	    	fprintf(stderr, "ERROR: OQS_KEM_kyber_768_decaps failed!\n");
+            SS->len=0;
+        }
+        else{
+            SK->len=OQS_KEM_kyber_768_length_secret_key;
+            PK->len=OQS_KEM_kyber_768_length_ciphertext;
+            SS->len=OQS_KEM_kyber_768_length_shared_secret;
+        }
+    }
+if (group==KYBER512) {
+        OQS_STATUS rc = OQS_KEM_kyber_512_decaps( (uint8_t*) SS->val, (uint8_t*) PK->val, (uint8_t*) SK->val);
+    	if (rc != OQS_SUCCESS) {
+	    	fprintf(stderr, "ERROR: OQS_KEM_kyber_512_decaps failed!\n");
+            SS->len=0;
+        }
+        else{
+            SK->len=OQS_KEM_kyber_512_length_secret_key;
+            PK->len=OQS_KEM_kyber_512_length_ciphertext;
+            SS->len=OQS_KEM_kyber_512_length_shared_secret;
+        }
+    }
+if (group==KYBER1024) {
+        OQS_STATUS rc = OQS_KEM_kyber_1024_decaps( (uint8_t*) SS->val, (uint8_t*) PK->val, (uint8_t*) SK->val);
+    	if (rc != OQS_SUCCESS) {
+	    	fprintf(stderr, "ERROR: OQS_KEM_kyber_1024_decaps failed!\n");
+            SS->len=0;
+        }
+        else{
+            SK->len=OQS_KEM_kyber_1024_length_secret_key;
+            PK->len=OQS_KEM_kyber_1024_length_ciphertext;
+            SS->len=OQS_KEM_kyber_1024_length_shared_secret;
+        }
+    }
+
+if (group==MLKEM512) {
+        OQS_STATUS rc = OQS_KEM_ml_kem_512_decaps( (uint8_t*) SS->val, (uint8_t*) PK->val, (uint8_t*) SK->val);
+    	if (rc != OQS_SUCCESS) {
+	    	fprintf(stderr, "ERROR: OQS_KEM_ml_kem_512_decaps failed!\n");
+            SS->len=0;
+        }
+        else{
+            SK->len=OQS_KEM_ml_kem_512_length_secret_key;
+            PK->len=OQS_KEM_ml_kem_512_length_ciphertext;
+            SS->len=OQS_KEM_ml_kem_512_length_shared_secret;
+        }
+    }
+
+if (group==MLKEM768) {
+        OQS_STATUS rc = OQS_KEM_ml_kem_768_decaps( (uint8_t*) SS->val, (uint8_t*) PK->val, (uint8_t*) SK->val);
+    	if (rc != OQS_SUCCESS) {
+	    	fprintf(stderr, "ERROR: OQS_KEM_ml_kem_768_decaps failed!\n");
+            SS->len=0;
+        }
+        else{
+            SK->len=OQS_KEM_ml_kem_768_length_secret_key;
+            PK->len=OQS_KEM_ml_kem_768_length_ciphertext;
+            SS->len=OQS_KEM_ml_kem_768_length_shared_secret;
+        }
+    }
+
+if (group==MLKEM1024) {
+        OQS_STATUS rc = OQS_KEM_ml_kem_1024_decaps( (uint8_t*) SS->val, (uint8_t*) PK->val, (uint8_t*) SK->val);
+    	if (rc != OQS_SUCCESS) {
+	    	fprintf(stderr, "ERROR: OQS_KEM_ml_kem_1024_decaps failed!\n");
+            SS->len=0;
+        }
+        else{
+            SK->len=OQS_KEM_ml_kem_1024_length_secret_key;
+            PK->len=OQS_KEM_ml_kem_1024_length_ciphertext;
+            SS->len=OQS_KEM_ml_kem_1024_length_shared_secret;
+        }
+    }
+
+// JS Protokol BIKE nie je podporovany na Windowse, preto je definovany len pre linuxove prostredie
+// Bez podmienky aplikacia na Windowse padne, pretoze liboqs na Windowse neobsahuje funkcie pre BIKE
+#ifdef __linux__
+if (group==BIKEL1) {
+        OQS_STATUS rc = OQS_KEM_bike_l1_decaps( (uint8_t*) SS->val, (uint8_t*) PK->val, (uint8_t*) SK->val);
+    	if (rc != OQS_SUCCESS) {
+	    	fprintf(stderr, "ERROR: OQS_KEM_bike_l1_decaps failed!\n");
+            SS->len=0;
+        }
+        else{
+            SK->len=OQS_KEM_bike_l1_length_secret_key;
+            PK->len=OQS_KEM_bike_l1_length_ciphertext;
+            SS->len=OQS_KEM_bike_l1_length_shared_secret;
+        }
+    }
+
+if (group==BIKEL3) {
+        OQS_STATUS rc = OQS_KEM_bike_l3_decaps( (uint8_t*) SS->val, (uint8_t*) PK->val, (uint8_t*) SK->val);
+    	if (rc != OQS_SUCCESS) {
+	    	fprintf(stderr, "ERROR: OQS_KEM_bike_l3_decaps failed!\n");
+            SS->len=0;
+        }
+        else{
+            SK->len=OQS_KEM_bike_l3_length_secret_key;
+            PK->len=OQS_KEM_bike_l3_length_ciphertext;
+            SS->len=OQS_KEM_bike_l3_length_shared_secret;
+        }
+    }
+
+if (group==BIKEL5) {
+        OQS_STATUS rc = OQS_KEM_bike_l5_decaps( (uint8_t*) SS->val, (uint8_t*) PK->val, (uint8_t*) SK->val);
+    	if (rc != OQS_SUCCESS) {
+	    	fprintf(stderr, "ERROR: OQS_KEM_bike_l5_decaps failed!\n");
+            SS->len=0;
+        }
+        else{
+            SK->len=OQS_KEM_bike_l5_length_secret_key;
+            PK->len=OQS_KEM_bike_l5_length_ciphertext;
+            SS->len=OQS_KEM_bike_l5_length_shared_secret;
+        }
+    }
+#endif
+
+if (group==HQC128) {
+        OQS_STATUS rc = OQS_KEM_hqc_128_decaps( (uint8_t*) SS->val, (uint8_t*) PK->val, (uint8_t*) SK->val);
+    	if (rc != OQS_SUCCESS) {
+	    	fprintf(stderr, "ERROR: OQS_KEM_hqc_128_decaps failed!\n");
+            SS->len=0;
+        }
+        else{
+            SK->len=OQS_KEM_hqc_128_length_secret_key;
+            PK->len=OQS_KEM_hqc_128_length_ciphertext;
+            SS->len=OQS_KEM_hqc_128_length_shared_secret;
+        }
+    }
+
+if (group==HQC192) {
+        OQS_STATUS rc = OQS_KEM_hqc_192_decaps( (uint8_t*) SS->val, (uint8_t*) PK->val, (uint8_t*) SK->val);
+    	if (rc != OQS_SUCCESS) {
+	    	fprintf(stderr, "ERROR: OQS_KEM_hqc_192_decaps failed!\n");
+            SS->len=0;
+        }
+        else{
+            SK->len=OQS_KEM_hqc_192_length_secret_key;
+            PK->len=OQS_KEM_hqc_192_length_ciphertext;
+            SS->len=OQS_KEM_hqc_192_length_shared_secret;
+        }
+    }
+
+if (group==HQC256) {
+        OQS_STATUS rc = OQS_KEM_hqc_256_decaps( (uint8_t*) SS->val, (uint8_t*) PK->val, (uint8_t*) SK->val);
+    	if (rc != OQS_SUCCESS) {
+	    	fprintf(stderr, "ERROR: OQS_KEM_hqc_256_decaps failed!\n");
+            SS->len=0;
+        }
+        else{
+            SK->len=OQS_KEM_hqc_256_length_secret_key;
+            PK->len=OQS_KEM_hqc_256_length_ciphertext;
+            SS->len=OQS_KEM_hqc_256_length_shared_secret;
+        }
+    }
+
+if (group==FRODO640AES) {
+        OQS_STATUS rc = OQS_KEM_frodokem_640_aes_decaps( (uint8_t*) SS->val, (uint8_t*) PK->val, (uint8_t*) SK->val);
+    	if (rc != OQS_SUCCESS) {
+	    	fprintf(stderr, "ERROR: OQS_KEM_frodokem_640_aes_decaps failed!\n");
+            SS->len=0;
+        }
+        else{
+            SK->len=OQS_KEM_frodokem_640_aes_length_secret_key;
+            PK->len=OQS_KEM_frodokem_640_aes_length_ciphertext;
+            SS->len=OQS_KEM_frodokem_640_aes_length_shared_secret;
+        }
+    }
+
+if (group==FRODO976AES) {
+        OQS_STATUS rc = OQS_KEM_frodokem_976_aes_decaps( (uint8_t*) SS->val, (uint8_t*) PK->val, (uint8_t*) SK->val);
+    	if (rc != OQS_SUCCESS) {
+	    	fprintf(stderr, "ERROR: OQS_KEM_frodokem_976_aes_decaps failed!\n");
+            SS->len=0;
+        }
+        else{
+            SK->len=OQS_KEM_frodokem_976_aes_length_secret_key;
+            PK->len=OQS_KEM_frodokem_976_aes_length_ciphertext;
+            SS->len=OQS_KEM_frodokem_976_aes_length_shared_secret;
+        }
+    }
+
+if (group==FRODO1344AES) {
+        OQS_STATUS rc = OQS_KEM_frodokem_1344_aes_decaps( (uint8_t*) SS->val, (uint8_t*) PK->val, (uint8_t*) SK->val);
+    	if (rc != OQS_SUCCESS) {
+	    	fprintf(stderr, "ERROR: OQS_KEM_frodokem_1344_aes_decaps failed!\n");
+            SS->len=0;
+        }
+        else{
+            SK->len=OQS_KEM_frodokem_1344_aes_length_secret_key;
+            PK->len=OQS_KEM_frodokem_1344_aes_length_ciphertext;
+            SS->len=OQS_KEM_frodokem_1344_aes_length_shared_secret;
+        }
+    }
+
+if (group==FRODO640SHAKE) {
+        OQS_STATUS rc = OQS_KEM_frodokem_640_shake_decaps( (uint8_t*) SS->val, (uint8_t*) PK->val, (uint8_t*) SK->val);
+    	if (rc != OQS_SUCCESS) {
+	    	fprintf(stderr, "ERROR: OQS_KEM_frodokem_640_shake_decaps failed!\n");
+            SS->len=0;
+        }
+        else{
+            SK->len=OQS_KEM_frodokem_640_shake_length_secret_key;
+            PK->len=OQS_KEM_frodokem_640_shake_length_ciphertext;
+            SS->len=OQS_KEM_frodokem_640_shake_length_shared_secret;
+        }
+    }
+
+if (group==FRODO976SHAKE) {
+        OQS_STATUS rc = OQS_KEM_frodokem_976_shake_decaps( (uint8_t*) SS->val, (uint8_t*) PK->val, (uint8_t*) SK->val);
+    	if (rc != OQS_SUCCESS) {
+	    	fprintf(stderr, "ERROR: OQS_KEM_frodokem_976_shake_decaps failed!\n");
+            SS->len=0;
+        }
+        else{
+            SK->len=OQS_KEM_frodokem_976_shake_length_secret_key;
+            PK->len=OQS_KEM_frodokem_976_shake_length_ciphertext;
+            SS->len=OQS_KEM_frodokem_976_shake_length_shared_secret;
+        }
+    }
+
+if (group==FRODO1344SHAKE) {
+        OQS_STATUS rc = OQS_KEM_frodokem_1344_shake_decaps( (uint8_t*) SS->val, (uint8_t*) PK->val, (uint8_t*) SK->val);
+    	if (rc != OQS_SUCCESS) {
+	    	fprintf(stderr, "ERROR: OQS_KEM_frodokem_1344_shake_decaps failed!\n");
+            SS->len=0;
+        }
+        else{
+            SK->len=OQS_KEM_frodokem_1344_shake_length_secret_key;
+            PK->len=OQS_KEM_frodokem_1344_shake_length_ciphertext;
+            SS->len=OQS_KEM_frodokem_1344_shake_length_shared_secret;
+        }
+    }
+//--------------------------------------------------------------------------
+#endif
+    
+// all zeros is suspect...
+    char ors=0;
+    for (int i=0;i<SS->len;i++) ors|=SS->val[i];
+    if (ors==0 || res!=0) return false;
+    return true;
+}
+
+//--------------------------------------------------------------------------
+// JS funkcie pre nove PQ algoritmy
+// Najprv funkcia pre overenie, potom funkcia pre podpis
+#if CRYPTO_SETTING>=POST_QUANTUM
+static bool DILITHIUM3_VERIFY(octad *CERT,octad *SIG,octad *PUBKEY)
+{
+    OQS_STATUS rc = OQS_SIG_dilithium_3_verify((uint8_t*) CERT->val, CERT->len, (uint8_t*) SIG->val, SIG->len, (uint8_t*) PUBKEY->val);
+	if (rc != OQS_SUCCESS) {
+		fprintf(stderr, "ERROR: OQS_SIG_dilithium_3_verify failed!\n");
+        return false;
+    }
+    return true;  
+}
+
+static void DILITHIUM3_SIGN(octad *KEY,octad *MESS,octad *SIG)
+{
+    OQS_STATUS rc = OQS_SIG_dilithium_3_sign( (uint8_t*) SIG->val, (size_t*) SIG->len, (uint8_t*) MESS->val, (size_t) MESS->len, (uint8_t*) KEY->val);
+	if (rc != OQS_SUCCESS) {
+		fprintf(stderr, "ERROR: OQS_SIG_dilithium_3_sign failed!\n");
+        SIG->len=0;
+    }
+    else{
+        SIG->len=OQS_SIG_dilithium_3_length_signature;
+    }    
+}
+
+static bool DILITHIUM2_VERIFY(octad *CERT,octad *SIG,octad *PUBKEY)
+{
+    OQS_STATUS rc = OQS_SIG_dilithium_2_verify((uint8_t*) CERT->val, CERT->len, (uint8_t*) SIG->val, SIG->len, (uint8_t*) PUBKEY->val);
+	if (rc != OQS_SUCCESS) {
+		fprintf(stderr, "ERROR: OQS_SIG_dilithium_2_verify failed!\n");
+        return false;
+    }
+    return true;  
+}
+
+static void DILITHIUM2_SIGN(octad *KEY,octad *MESS,octad *SIG)
+{
+    OQS_STATUS rc = OQS_SIG_dilithium_2_sign( (uint8_t*) SIG->val, (size_t*) SIG->len, (uint8_t*) MESS->val, (size_t) MESS->len, (uint8_t*) KEY->val);
+	if (rc != OQS_SUCCESS) {
+		fprintf(stderr, "ERROR: OQS_SIG_dilithium_2_sign failed!\n");
+        SIG->len=0;
+    }
+    else{
+        SIG->len=OQS_SIG_dilithium_2_length_signature;
+    }    
+}
+
+
+static bool DILITHIUM5_VERIFY(octad *CERT,octad *SIG,octad *PUBKEY)
+{
+    OQS_STATUS rc = OQS_SIG_dilithium_5_verify((uint8_t*) CERT->val, CERT->len, (uint8_t*) SIG->val, SIG->len, (uint8_t*) PUBKEY->val);
+	if (rc != OQS_SUCCESS) {
+		fprintf(stderr, "ERROR: OQS_SIG_dilithium_5_verify failed!\n");
+        return false;
+    }
+    return true;  
+}
+
+static void DILITHIUM5_SIGN(octad *KEY,octad *MESS,octad *SIG)
+{
+    OQS_STATUS rc = OQS_SIG_dilithium_5_sign( (uint8_t*) SIG->val, (size_t*) SIG->len, (uint8_t*) MESS->val, (size_t) MESS->len, (uint8_t*) KEY->val);
+	if (rc != OQS_SUCCESS) {
+		fprintf(stderr, "ERROR: OQS_SIG_dilithium_5_sign failed!\n");
+        SIG->len=0;
+    }
+    else{
+        SIG->len=OQS_SIG_dilithium_5_length_signature;
+    }    
+}
+
+//-----
+
+static bool MLDSA44_VERIFY(octad *CERT,octad *SIG,octad *PUBKEY)
+{
+    OQS_STATUS rc = OQS_SIG_ml_dsa_44_ipd_verify((uint8_t*) CERT->val, CERT->len, (uint8_t*) SIG->val, SIG->len, (uint8_t*) PUBKEY->val);
+	if (rc != OQS_SUCCESS) {
+		fprintf(stderr, "ERROR: OQS_SIG_ml_dsa_44_ipd_verify failed!\n");
+        return false;
+    }
+    return true;  
+}
+
+static void MLDSA44_SIGN(octad *KEY,octad *MESS,octad *SIG)
+{
+    OQS_STATUS rc = OQS_SIG_ml_dsa_44_ipd_sign( (uint8_t*) SIG->val, (size_t*) SIG->len, (uint8_t*) MESS->val, (size_t) MESS->len, (uint8_t*) KEY->val);
+	if (rc != OQS_SUCCESS) {
+		fprintf(stderr, "ERROR: OQS_SIG_ml_dsa_44_ipd_sign failed!\n");
+        SIG->len=0;
+    }
+    else{
+        SIG->len=OQS_SIG_ml_dsa_44_ipd_length_signature;
+    }    
+}
+
+static bool MLDSA65_VERIFY(octad *CERT,octad *SIG,octad *PUBKEY)
+{
+    OQS_STATUS rc = OQS_SIG_ml_dsa_65_ipd_verify((uint8_t*) CERT->val, CERT->len, (uint8_t*) SIG->val, SIG->len, (uint8_t*) PUBKEY->val);
+	if (rc != OQS_SUCCESS) {
+		fprintf(stderr, "ERROR: OQS_SIG_ml_dsa_65_ipd_verify failed!\n");
+        return false;
+    }
+    return true;  
+}
+
+static void MLDSA65_SIGN(octad *KEY,octad *MESS,octad *SIG)
+{
+    OQS_STATUS rc = OQS_SIG_ml_dsa_65_ipd_sign( (uint8_t*) SIG->val, (size_t*) SIG->len, (uint8_t*) MESS->val, (size_t) MESS->len, (uint8_t*) KEY->val);
+	if (rc != OQS_SUCCESS) {
+		fprintf(stderr, "ERROR: OQS_SIG_ml_dsa_65_ipd_sign failed!\n");
+        SIG->len=0;
+    }
+    else{
+        SIG->len=OQS_SIG_ml_dsa_65_ipd_length_signature;
+    }    
+}
+
+static bool MLDSA87_VERIFY(octad *CERT,octad *SIG,octad *PUBKEY)
+{
+    OQS_STATUS rc = OQS_SIG_ml_dsa_87_ipd_verify((uint8_t*) CERT->val, CERT->len, (uint8_t*) SIG->val, SIG->len, (uint8_t*) PUBKEY->val);
+	if (rc != OQS_SUCCESS) {
+		fprintf(stderr, "ERROR: OQS_SIG_ml_dsa_87_ipd_verify failed!\n");
+        return false;
+    }
+    return true;  
+}
+
+static void MLDSA87_SIGN(octad *KEY,octad *MESS,octad *SIG)
+{
+    OQS_STATUS rc = OQS_SIG_ml_dsa_87_ipd_sign( (uint8_t*) SIG->val, (size_t*) SIG->len, (uint8_t*) MESS->val, (size_t) MESS->len, (uint8_t*) KEY->val);
+	if (rc != OQS_SUCCESS) {
+		fprintf(stderr, "ERROR: OQS_SIG_ml_dsa_87_ipd_sign failed!\n");
+        SIG->len=0;
+    }
+    else{
+        SIG->len=OQS_SIG_ml_dsa_87_ipd_length_signature;
+    }    
+}
+
+
+// ------
+static bool FALCON512_VERIFY(octad *CERT,octad *SIG,octad *PUBKEY)
+{
+    OQS_STATUS rc = OQS_SIG_falcon_512_verify((uint8_t*) CERT->val, CERT->len, (uint8_t*) SIG->val, SIG->len, (uint8_t*) PUBKEY->val);
+	if (rc != OQS_SUCCESS) {
+		fprintf(stderr, "ERROR: OQS_SIG_falcon_512_verify failed!\n");
+        return false;
+    }
+    return true;  
+}
+
+static void FALCON512_SIGN(octad *KEY,octad *MESS,octad *SIG)
+{
+    OQS_STATUS rc = OQS_SIG_falcon_512_sign( (uint8_t*) SIG->val, (size_t*) SIG->len, (uint8_t*) MESS->val, (size_t) MESS->len, (uint8_t*) KEY->val);
+	if (rc != OQS_SUCCESS) {
+		fprintf(stderr, "ERROR: OQS_SIG_falcon_512_sign failed!\n");
+        SIG->len=0;
+    }
+    else{
+        SIG->len=OQS_SIG_falcon_512_length_signature;
+    }    
+}
+
+static bool FALCON1024_VERIFY(octad *CERT,octad *SIG,octad *PUBKEY)
+{
+    OQS_STATUS rc = OQS_SIG_falcon_1024_verify((uint8_t*) CERT->val, CERT->len, (uint8_t*) SIG->val, SIG->len, (uint8_t*) PUBKEY->val);
+	if (rc != OQS_SUCCESS) {
+		fprintf(stderr, "ERROR: OQS_SIG_falcon_1024_verify failed!\n");
+        return false;
+    }
+    return true;  
+}
+
+static void FALCON1024_SIGN(octad *KEY,octad *MESS,octad *SIG)
+{
+    OQS_STATUS rc = OQS_SIG_falcon_1024_sign( (uint8_t*) SIG->val, (size_t*) SIG->len, (uint8_t*) MESS->val, (size_t) MESS->len, (uint8_t*) KEY->val);
+	if (rc != OQS_SUCCESS) {
+		fprintf(stderr, "ERROR: OQS_SIG_falcon_1024_sign failed!\n");
+        SIG->len=0;
+    }
+    else{
+        SIG->len=OQS_SIG_falcon_1024_length_signature;
+    }    
+}
+
+static bool SPHINCSSHA2128FSIMPLE_VERIFY(octad *CERT,octad *SIG,octad *PUBKEY)
+{
+    OQS_STATUS rc = OQS_SIG_sphincs_sha2_128f_simple_verify((uint8_t*) CERT->val, CERT->len, (uint8_t*) SIG->val, SIG->len, (uint8_t*) PUBKEY->val);
+	if (rc != OQS_SUCCESS) {
+        return false;
+    }
+    return true;  
+}
+
+static void SPHINCSSHA2128FSIMPLE_SIGN(octad *KEY,octad *MESS,octad *SIG)
+{
+    OQS_STATUS rc = OQS_SIG_sphincs_sha2_128f_simple_sign( (uint8_t*) SIG->val, (size_t*) SIG->len, (uint8_t*) MESS->val, (size_t) MESS->len, (uint8_t*) KEY->val);
+	if (rc != OQS_SUCCESS) {
+        SIG->len=0;
+    }
+    else{
+        SIG->len=OQS_SIG_sphincs_sha2_128f_simple_length_signature;
+    }    
+}
+
+static bool SPHINCSSHA2128SSIMPLE_VERIFY(octad *CERT,octad *SIG,octad *PUBKEY)
+{
+    OQS_STATUS rc = OQS_SIG_sphincs_sha2_128s_simple_verify((uint8_t*) CERT->val, CERT->len, (uint8_t*) SIG->val, SIG->len, (uint8_t*) PUBKEY->val);
+	if (rc != OQS_SUCCESS) {
+        return false;
+    }
+    return true;  
+}
+
+static void SPHINCSSHA2128SSIMPLE_SIGN(octad *KEY,octad *MESS,octad *SIG)
+{
+    OQS_STATUS rc = OQS_SIG_sphincs_sha2_128s_simple_sign( (uint8_t*) SIG->val, (size_t*) SIG->len, (uint8_t*) MESS->val, (size_t) MESS->len, (uint8_t*) KEY->val);
+	if (rc != OQS_SUCCESS) {
+        SIG->len=0;
+    }
+    else{
+        SIG->len=OQS_SIG_sphincs_sha2_128s_simple_length_signature;
+    }    
+}
+
+static bool SPHINCSSHAKE128FSIMPLE_VERIFY(octad *CERT,octad *SIG,octad *PUBKEY)
+{
+    OQS_STATUS rc = OQS_SIG_sphincs_shake_128f_simple_verify((uint8_t*) CERT->val, CERT->len, (uint8_t*) SIG->val, SIG->len, (uint8_t*) PUBKEY->val);
+	if (rc != OQS_SUCCESS) {
+        return false;
+    }
+    return true;  
+}
+
+static void SPHINCSSHAKE128FSIMPLE_SIGN(octad *KEY,octad *MESS,octad *SIG)
+{
+    OQS_STATUS rc = OQS_SIG_sphincs_shake_128f_simple_sign( (uint8_t*) SIG->val, (size_t*) SIG->len, (uint8_t*) MESS->val, (size_t) MESS->len, (uint8_t*) KEY->val);
+	if (rc != OQS_SUCCESS) {
+        SIG->len=0;
+    }
+    else{
+        SIG->len=OQS_SIG_sphincs_shake_128f_simple_length_signature;
+    }    
+}
+/*
+static bool SPHINCSSHA2192FSIMPLE_VERIFY(octad *CERT,octad *SIG,octad *PUBKEY)
+{
+    OQS_STATUS rc = OQS_SIG_sphincs_sha2_192f_simple_verify((uint8_t*) CERT->val, CERT->len, (uint8_t*) SIG->val, SIG->len, (uint8_t*) PUBKEY->val);
+	if (rc != OQS_SUCCESS) {
+        return false;
+    }
+    return true;  
+}
+
+static void SPHINCSSHA2192FSIMPLE_SIGN(octad *KEY,octad *MESS,octad *SIG)
+{
+    OQS_STATUS rc = OQS_SIG_sphincs_sha2_192f_simple_sign( (uint8_t*) SIG->val, (size_t*) SIG->len, (uint8_t*) MESS->val, (size_t) MESS->len, (uint8_t*) KEY->val);
+	if (rc != OQS_SUCCESS) {
+        SIG->len=0;
+    }
+    else{
+        SIG->len=OQS_SIG_sphincs_sha2_192s_simple_length_signature;
+    }    
+}
+*/
+//--------------------------------------------------------------------------
+#endif
+
+// RSA 2048-bit PKCS1.5 signature verification
+static bool RSA_2048_PKCS15_VERIFY(int sha,octad *CERT,octad *SIG,octad *PUBKEY)
+{
+    bool res;
+    char p1[RFS_RSA2048];
+    octet P1={0,sizeof(p1),p1};
+    char p2[RFS_RSA2048];
+    octet P2={0,sizeof(p2),p2};
+
+    octet MC_CERT=octad_to_octet(CERT);
+    octet MC_SIG=octad_to_octet(SIG);
+    octet MC_PUBKEY=octad_to_octet(PUBKEY);
+
+    RSA2048::rsa_public_key PK;
+    PK.e = 65537; // assuming this!
+    RSA2048::RSA_fromOctet(PK.n, &MC_PUBKEY);
+    RSA2048::RSA_ENCRYPT(&PK, &MC_SIG, &P2);
+    PKCS15(sha, &MC_CERT, &P1);
+    res=OCT_comp(&P1, &P2);
+    if (!res)
+    { // check alternate PKCS1.5 encoding
+        PKCS15b(sha, &MC_CERT, &P1);
+        res=OCT_comp(&P1, &P2);
+    }
+    return res;
+}
+
+// RSA 4096-bit PKCS1.5 signature verification
+static bool RSA_4096_PKCS15_VERIFY(int sha,octad *CERT,octad *SIG,octad *PUBKEY)
+{
+    bool res;
+    char p1[RFS_RSA4096];
+    octet P1={0,sizeof(p1),p1};
+    char p2[RFS_RSA4096];
+    octet P2={0,sizeof(p2),p2};
+
+    octet MC_CERT=octad_to_octet(CERT);
+    octet MC_SIG=octad_to_octet(SIG);
+    octet MC_PUBKEY=octad_to_octet(PUBKEY);
+
+    RSA4096::rsa_public_key PK;
+    PK.e = 65537; // assuming this!
+    RSA4096::RSA_fromOctet(PK.n, &MC_PUBKEY);
+    RSA4096::RSA_ENCRYPT(&PK, &MC_SIG, &P2);
+    PKCS15(sha, &MC_CERT, &P1);
+    res=OCT_comp(&P1, &P2);
+    if (!res)
+    { // check alternate PKCS1.5 encoding
+        PKCS15b(sha, &MC_CERT, &P1);
+        res=OCT_comp(&P1, &P2);
+    }
+    return res;
+}
+
+static bool RSA_PKCS15_VERIFY(int sha,octad *CERT,octad *SIG,octad *PUBKEY)
+{
+    if (PUBKEY->len==RFS_RSA2048)
+        return RSA_2048_PKCS15_VERIFY(sha,CERT,SIG,PUBKEY);
+    if (PUBKEY->len==RFS_RSA4096)
+        return RSA_4096_PKCS15_VERIFY(sha,CERT,SIG,PUBKEY);
+    return false;
+}
+
+// RSA 2048-bit PSS-RSAE signature verification
+static bool RSA_2048_PSS_RSAE_VERIFY(int sha,octad *MESS,octad *SIG,octad *PUBKEY)
+{
+    char p[RFS_RSA2048];
+    octet P={0,sizeof(p),p};
+
+    octet MC_MESS=octad_to_octet(MESS);
+    octet MC_SIG=octad_to_octet(SIG);
+    octet MC_PUBKEY=octad_to_octet(PUBKEY);
+
+    RSA2048::rsa_public_key PK;
+    PK.e = 65537;
+    RSA2048::RSA_fromOctet(PK.n, &MC_PUBKEY);
+    RSA2048::RSA_ENCRYPT(&PK, &MC_SIG, &P);
+    if (PSS_VERIFY(sha,&MC_MESS,&P)) 
+        return true;
+    return false;
+}
+
+// RSA 4096-bit PSS-RSAE signature verification
+static bool RSA_4096_PSS_RSAE_VERIFY(int sha,octad *MESS,octad *SIG,octad *PUBKEY)
+{
+    char p[RFS_RSA4096];
+    octet P={0,sizeof(p),p};
+
+    octet MC_MESS=octad_to_octet(MESS);
+    octet MC_SIG=octad_to_octet(SIG);
+    octet MC_PUBKEY=octad_to_octet(PUBKEY);
+
+    RSA4096::rsa_public_key PK;
+    PK.e = 65537;
+    RSA4096::RSA_fromOctet(PK.n, &MC_PUBKEY);
+    RSA4096::RSA_ENCRYPT(&PK, &MC_SIG, &P);
+    if (PSS_VERIFY(sha,&MC_MESS,&P)) 
+        return true;
+    return false;
+}
+
+static bool RSA_PSS_RSAE_VERIFY(int sha,octad *MESS,octad *SIG,octad *PUBKEY)
+{
+    if (PUBKEY->len==RFS_RSA2048)
+        return RSA_2048_PSS_RSAE_VERIFY(sha,MESS,SIG,PUBKEY);
+    if (PUBKEY->len==RFS_RSA4096)
+        return RSA_4096_PSS_RSAE_VERIFY(sha,MESS,SIG,PUBKEY);
+    return false;
+}
+
+// Curve SECP256R1 elliptic curve ECDSA verification
+static bool SECP256R1_ECDSA_VERIFY(int sha,octad *CERT,octad *SIG,octad *PUBKEY)
+{
+    int res;
+
+    octet MC_CERT=octad_to_octet(CERT);
+    octet MC_SIG=octad_to_octet(SIG);
+    octet MC_PUBKEY=octad_to_octet(PUBKEY);
+
+    res=NIST256::ECP_PUBLIC_KEY_VALIDATE(&MC_PUBKEY);
+    if (res!=0) return false;
+
+    char r[32];
+    octet R={0,sizeof(r),r};
+    char s[32];
+    octet S={0,sizeof(s),s};
+    int siglen=SIG->len/2;
+    for (int i=0;i<siglen;i++)
+    {
+        OCT_jbyte(&R,MC_SIG.val[i],1);
+        OCT_jbyte(&S,MC_SIG.val[i+siglen],1);
+    }    
+
+    res=NIST256::ECP_VP_DSA(sha, &MC_PUBKEY, &MC_CERT, &R, &S);
+    if (res!=0) return false;
+
+    return true;
+}
+
+// Curve SECP384R1 elliptic curve ECDSA verification
+
+static bool SECP384R1_ECDSA_VERIFY(int sha,octad *CERT,octad *SIG,octad *PUBKEY)
+{
+    int res;
+
+    octet MC_CERT=octad_to_octet(CERT);
+    octet MC_SIG=octad_to_octet(SIG);
+    octet MC_PUBKEY=octad_to_octet(PUBKEY);
+
+    res=NIST384::ECP_PUBLIC_KEY_VALIDATE(&MC_PUBKEY);
+    if (res!=0) return false;
+
+    char r[48];
+    octet R={0,sizeof(r),r};
+    char s[48];
+    octet S={0,sizeof(s),s};
+    int siglen=SIG->len/2;
+    for (int i=0;i<siglen;i++)
+    {
+        OCT_jbyte(&R,MC_SIG.val[i],1);
+        OCT_jbyte(&S,MC_SIG.val[i+siglen],1);
+    }    
+
+    res=NIST384::ECP_VP_DSA(sha, &MC_PUBKEY, &MC_CERT, &R, &S);
+    if (res!=0) return false;
+
+    return true;
+}
+
+static bool Ed25519_VERIFY(octad *CERT,octad *SIG,octad *PUBKEY)
+{ 
+    octet MC_CERT=octad_to_octet(CERT);
+    octet MC_SIG=octad_to_octet(SIG);
+    octet MC_PUBKEY=octad_to_octet(PUBKEY);
+    return Ed25519::EDDSA_VERIFY(false,&MC_PUBKEY,NULL,&MC_CERT,&MC_SIG);
+}
+
+static bool Ed448_VERIFY(octad *CERT,octad *SIG,octad *PUBKEY)
+{ 
+    octet MC_CERT=octad_to_octet(CERT);
+    octet MC_SIG=octad_to_octet(SIG);
+    octet MC_PUBKEY=octad_to_octet(PUBKEY);
+    return Ed448::EDDSA_VERIFY(false,&MC_PUBKEY,NULL,&MC_CERT,&MC_SIG);
+}
+
+// Use Curve SECP256R1 ECDSA to digitally sign a message using a private key 
+static void SECP256R1_ECDSA_SIGN(int sha,octad *KEY,octad *MESS,octad *SIG)
+{
+    octet MC_MESS=octad_to_octet(MESS);
+    octet MC_KEY=octad_to_octet(KEY);
+    octet MC_SIG=octad_to_octet(SIG);
+
+    char r[32];
+    octet R={0,sizeof(r),r};
+    char s[32];
+    octet S={0,sizeof(s),s};
+
+    NIST256::ECP_SP_DSA(sha, &RNG, NULL, &MC_KEY, &MC_MESS, &R, &S);
+
+    OCT_copy(&MC_SIG,&R);
+    OCT_joctet(&MC_SIG,&S);
+
+    SIG->len=MC_SIG.len;
+}
+
+// Use Curve SECP384R1 ECDSA to digitally sign a message using a private key 
+static void SECP384R1_ECDSA_SIGN(int sha,octad *KEY,octad *MESS,octad *SIG)
+{
+    octet MC_MESS=octad_to_octet(MESS);
+    octet MC_KEY=octad_to_octet(KEY);
+    octet MC_SIG=octad_to_octet(SIG);
+
+    char r[48];
+    octet R={0,sizeof(r),r};
+    char s[48];
+    octet S={0,sizeof(s),s};
+
+    NIST384::ECP_SP_DSA(sha, &RNG, NULL, &MC_KEY, &MC_MESS, &R, &S);
+
+    OCT_copy(&MC_SIG,&R);
+    OCT_joctet(&MC_SIG,&S);
+
+    SIG->len=MC_SIG.len;
+}
+
+static void Ed25519_SIGN(octad *KEY,octad *MESS,octad *SIG)
+{ 
+    octet MC_MESS=octad_to_octet(MESS);
+    octet MC_KEY=octad_to_octet(KEY);
+    octet MC_SIG=octad_to_octet(SIG);
+    Ed25519::EDDSA_SIGNATURE(false,&MC_KEY,NULL,&MC_MESS,&MC_SIG);
+    SIG->len=MC_SIG.len;
+}
+
+static void Ed448_SIGN(octad *KEY,octad *MESS,octad *SIG)
+{ 
+    octet MC_MESS=octad_to_octet(MESS);
+    octet MC_KEY=octad_to_octet(KEY);
+    octet MC_SIG=octad_to_octet(SIG);
+    Ed448::EDDSA_SIGNATURE(false,&MC_KEY,NULL,&MC_MESS,&MC_SIG);
+    SIG->len=MC_SIG.len;
+}
+
+// Use RSA-2048 PSS-RSAE to digitally sign a message using a private key
+static void RSA_2048_PSS_RSAE_SIGN(int sha,octad *KEY,octad *MESS,octad *SIG)
+{
+    int len=KEY->len/5;   // length of p and q
+    if (len!=128) return;
+    char p[128];
+    octet P={len,sizeof(p),p};
+    char q[128];
+    octet Q={len,sizeof(q),q};
+    char dp[128];
+    octet DP={len,sizeof(dp),dp};
+    char dq[128];
+    octet DQ={len,sizeof(dq),dq};
+    char c[128];
+    octet C={len,sizeof(c),c}; 
+    for (int i=0;i<len;i++)
+    {
+        p[i]=KEY->val[i];
+        q[i]=KEY->val[i+len];
+        dp[i]=KEY->val[i+2*len];
+        dq[i]=KEY->val[i+3*len];
+        c[i]=KEY->val[i+4*len];
+    }
+    RSA2048::rsa_private_key SK;
+    char enc[256];
+    octet ENC={0,sizeof(enc),enc};
+    RSA2048::RSA_PRIVATE_KEY_FROM_OPENSSL(&P,&Q,&DP,&DQ,&C,&SK);
+
+    octet MC_MESS=octad_to_octet(MESS);
+    octet MC_SIG=octad_to_octet(SIG);
+
+    PSS_ENCODE(sha, &MC_MESS, &RNG, &ENC);
+    RSA2048::RSA_DECRYPT(&SK,&ENC,&MC_SIG);
+    SIG->len=MC_SIG.len;
+}
+
+// Use RSA-4096 PSS-RSAE to digitally sign a message using a private key
+static void RSA_4096_PSS_RSAE_SIGN(int sha,octad *KEY,octad *MESS,octad *SIG)
+{
+    int len=KEY->len/5;   // length of p and q
+    if (len!=256) return;
+    char p[256];
+    octet P={len,sizeof(p),p};
+    char q[256];
+    octet Q={len,sizeof(q),q};
+    char dp[256];
+    octet DP={len,sizeof(dp),dp};
+    char dq[256];
+    octet DQ={len,sizeof(dq),dq};
+    char c[256];
+    octet C={len,sizeof(c),c}; 
+    for (int i=0;i<len;i++)
+    {
+        p[i]=KEY->val[i];
+        q[i]=KEY->val[i+len];
+        dp[i]=KEY->val[i+2*len];
+        dq[i]=KEY->val[i+3*len];
+        c[i]=KEY->val[i+4*len];
+    }
+    RSA4096::rsa_private_key SK;
+    char enc[512];
+    octet ENC={0,sizeof(enc),enc};
+
+    octet MC_MESS=octad_to_octet(MESS);
+    octet MC_SIG=octad_to_octet(SIG);
+
+    RSA4096::RSA_PRIVATE_KEY_FROM_OPENSSL(&P,&Q,&DP,&DQ,&C,&SK);
+
+    PSS_ENCODE(sha, &MC_MESS, &RNG, &ENC);
+    RSA4096::RSA_DECRYPT(&SK,&ENC,&MC_SIG);
+    SIG->len=MC_SIG.len;
+}
+
+static void RSA_PSS_RSAE_SIGN(int sha,octad *KEY,octad *MESS,octad *SIG)
+{
+    int len=KEY->len/5;
+    if (len==128) RSA_2048_PSS_RSAE_SIGN(sha,KEY,MESS,SIG);
+    if (len==256) RSA_4096_PSS_RSAE_SIGN(sha,KEY,MESS,SIG);
+}
+
+// RFC8446:     "A TLS-compliant application MUST support digital signatures with
+//              rsa_pkcs1_sha256 (for certificates), rsa_pss_rsae_sha256 (for
+//              CertificateVerify and certificates), and ecdsa_secp256r1_sha256."
+
+// SAL signature verification
+bool SAL_tlsSignatureVerify(int sigAlg,octad *BUFF,octad *SIG,octad *PUBKEY)
+{
+    bool result;
+    //double start,elapsed;
+    //start = millis();
+    switch (sigAlg) {
+        case RSA_PKCS1_SHA256 :
+            result= RSA_PKCS15_VERIFY(32,BUFF,SIG,PUBKEY);
+            break;
+        case ECDSA_SECP256R1_SHA256 :
+            result= SECP256R1_ECDSA_VERIFY(32,BUFF,SIG,PUBKEY); 
+            break;
+        case ECDSA_SECP256R1_SHA384 :
+            result= SECP256R1_ECDSA_VERIFY(48,BUFF,SIG,PUBKEY); 
+            break;
+        case RSA_PKCS1_SHA384 :
+            result= RSA_PKCS15_VERIFY(48,BUFF,SIG,PUBKEY);
+            break;        
+        case ECDSA_SECP384R1_SHA384 :
+            result= SECP384R1_ECDSA_VERIFY(48,BUFF,SIG,PUBKEY);
+            break;
+        case RSA_PKCS1_SHA512 :
+            result= RSA_PKCS15_VERIFY(64,BUFF,SIG,PUBKEY);
+            break;        
+        case RSA_PSS_RSAE_SHA256:
+            result= RSA_PSS_RSAE_VERIFY(32,BUFF,SIG,PUBKEY);
+            break;
+        case ED25519:
+            result= Ed25519_VERIFY(BUFF,SIG,PUBKEY);
+            break;
+        case ED448:
+            result= Ed448_VERIFY(BUFF,SIG,PUBKEY);
+            break;
+
+// JS doplnenie novych PQ algoritmov
+#if CRYPTO_SETTING>=POST_QUANTUM
+        case DILITHIUM2:
+            result= DILITHIUM2_VERIFY(BUFF,SIG,PUBKEY);
+            break;
+        case DILITHIUM3:
+            result= DILITHIUM3_VERIFY(BUFF,SIG,PUBKEY);
+            break;
+        case DILITHIUM5:
+            result= DILITHIUM5_VERIFY(BUFF,SIG,PUBKEY);
+            break;
+        case MLDSA44:
+            result= MLDSA44_VERIFY(BUFF,SIG,PUBKEY);
+            break;
+        case MLDSA65:
+            result= MLDSA65_VERIFY(BUFF,SIG,PUBKEY);
+            break;
+        case MLDSA87:
+            result= MLDSA87_VERIFY(BUFF,SIG,PUBKEY);
+            break;
+        case FALCON512:
+            result= FALCON512_VERIFY(BUFF,SIG,PUBKEY);
+            break;
+        case FALCON1024:
+            result= FALCON1024_VERIFY(BUFF,SIG,PUBKEY);
+            break;
+        case SPHINCSSHA2128FSIMPLE:
+            result= SPHINCSSHA2128FSIMPLE_VERIFY(BUFF,SIG,PUBKEY);
+            break;
+        case SPHINCSSHA2128SSIMPLE:
+            result= SPHINCSSHA2128SSIMPLE_VERIFY(BUFF,SIG,PUBKEY);
+            break;
+        case SPHINCSSHAKE128FSIMPLE:
+            result= SPHINCSSHAKE128FSIMPLE_VERIFY(BUFF,SIG,PUBKEY);
+            break;
+        /*
+        case SPHINCSSHA2192FSIMPLE:
+            result= SPHINCSSHA2192FSIMPLE_VERIFY(BUFF,SIG,PUBKEY);
+            break;
+        */
+#endif
+        default:
+            result=false;
+    }
+    //elapsed=(millis()-start);
+    //printf("        Verification= %.2lf ms\n", elapsed);
+    return result;
+}
+
+// Form Transcript Signature 
+void SAL_tlsSignature(int sigAlg,octad *KEY,octad *TRANS,octad *SIG)
+{ // probably need to support more cases
+    //int start,elapsed;
+    //start = millis();
+    switch (sigAlg)
+    {
+    case RSA_PSS_RSAE_SHA256:
+        RSA_PSS_RSAE_SIGN(32,KEY,TRANS,SIG);
+        break;
+    case ED25519:
+        Ed25519_SIGN(KEY,TRANS,SIG);
+        break;
+    case ED448:
+        Ed448_SIGN(KEY,TRANS,SIG);
+        break;
+    case ECDSA_SECP256R1_SHA256:
+        SECP256R1_ECDSA_SIGN(32,KEY,TRANS,SIG);
+        break;
+    case ECDSA_SECP256R1_SHA384:
+        SECP256R1_ECDSA_SIGN(48,KEY,TRANS,SIG);
+        break;
+    case ECDSA_SECP384R1_SHA384:
+        SECP384R1_ECDSA_SIGN(48,KEY,TRANS,SIG);
+        break;
+
+// JS doplnenie novych PQ algoritmov
+#if CRYPTO_SETTING>=POST_QUANTUM
+    case DILITHIUM2:
+        DILITHIUM2_SIGN(KEY,TRANS,SIG);
+        break;
+    case DILITHIUM3:
+        DILITHIUM3_SIGN(KEY,TRANS,SIG);
+        break;
+    case DILITHIUM5:
+        DILITHIUM5_SIGN(KEY,TRANS,SIG);
+        break;
+    case MLDSA44:
+        MLDSA44_SIGN(KEY,TRANS,SIG);
+        break;
+    case MLDSA65:
+        MLDSA65_SIGN(KEY,TRANS,SIG);
+        break;
+    case MLDSA87:
+        MLDSA87_SIGN(KEY,TRANS,SIG);
+        break;
+    case FALCON512:
+        FALCON512_SIGN(KEY,TRANS,SIG);
+            break;
+    case FALCON1024:
+        FALCON1024_SIGN(KEY,TRANS,SIG);
+        break;
+    case SPHINCSSHA2128FSIMPLE:
+        SPHINCSSHA2128FSIMPLE_SIGN(KEY,TRANS,SIG);
+        break;
+    case SPHINCSSHA2128SSIMPLE:
+        SPHINCSSHA2128SSIMPLE_SIGN(KEY,TRANS,SIG);
+        break;
+    case SPHINCSSHAKE128FSIMPLE:
+        SPHINCSSHAKE128FSIMPLE_SIGN(KEY,TRANS,SIG);
+        break;
+    /* 
+    case SPHINCSSHA2192FSIMPLE:
+        SPHINCSSHA2192FSIMPLE_SIGN(KEY,TRANS,SIG);
+        break;  
+    */
+#endif
+    }
+    //elapsed=(millis()-start);
+    //printf("        Signature= %d\n", elapsed);
+}
\ No newline at end of file
diff --git a/TIIGER_TLS/PQ_TIIGER_TLS/src/client.cpp b/TIIGER_TLS/PQ_TIIGER_TLS/src/client.cpp
new file mode 100644
index 0000000..66b1300
--- /dev/null
+++ b/TIIGER_TLS/PQ_TIIGER_TLS/src/client.cpp
@@ -0,0 +1,643 @@
+/*
+* JS update 14.04.2024
+* Doplneny vypis pre algoritmy ML-KEM a ML-DSA
+*/
+
+/*
+* JS update 29.02.2024
+* Doplnene vypisy pre doplnene PQ algoritmy
+* Inicializacia WSA struktury pre kompatibilitu na Windowse + uvolnenie struktury pri ukonceni programu
+* Pridanie vypisu velkosti sukromnych a verejnych klucov generovanych PQ KEM protokolmi
+*/
+
+// Client side test C++ program to demonstrate TLS1.3 
+// Linux version
+// ./client www.bbc.co.uk
+
+#include <time.h>
+#include "tls_sal.h"
+#include "tls_protocol.h"
+#include "tls_bfibe.h"
+#include "tls_pqibe.h"
+
+#define MIN_TIME 1.0
+#define MIN_ITERS 1000
+
+// Extract ticket from cookie file, and attach to session
+static void storeTicket(TLS_session *session)
+{
+    FILE *fp;
+    fp=fopen("cookie.txt","wt");
+    char line[2050];
+    fprintf(fp,"%s\n",session->hostname);
+    OCT_output_hex(&session->T.TICK,2048,line);
+    fprintf(fp,"%s\n",line);
+    OCT_output_hex(&session->T.PSK,2048,line);
+    fprintf(fp,"%s\n",line);
+    fprintf(fp,"%x\n",session->T.age_obfuscator); 
+    fprintf(fp,"%x\n",session->T.max_early_data);
+    fprintf(fp,"%x\n",session->T.birth);
+    fprintf(fp,"%x\n",session->T.lifetime);
+    fprintf(fp,"%x\n",session->T.cipher_suite);
+    fprintf(fp,"%x\n",session->T.favourite_group);
+    fprintf(fp,"%x\n",session->T.origin);
+    fclose(fp);
+}
+
+// restore ticket into session from cookie file
+static bool recoverTicket(TLS_session *session)
+{
+    FILE *fp;
+    char line[2050];
+    initTicketContext(&session->T); 
+
+    fp=fopen("cookie.txt","rt");
+    if (fp==NULL)
+        return false;  
+    
+    if (fscanf(fp,"%s\n",line)) {};
+
+    if (strcmp(line,session->hostname)!=0)  // Is it a ticket for this host?
+        return false;
+
+    if (fscanf(fp,"%s\n",line)) {};
+    OCT_from_hex(&session->T.TICK,line);
+    if (fscanf(fp,"%s\n",line)) {};
+    OCT_from_hex(&session->T.PSK,line);
+    if (fscanf(fp,"%x",&session->T.age_obfuscator)) {};
+    if (fscanf(fp,"%x",&session->T.max_early_data)) {};
+    if (fscanf(fp,"%x",&session->T.birth)) {};
+    if (fscanf(fp,"%x",&session->T.lifetime)) {};
+    if (fscanf(fp,"%x",&session->T.cipher_suite)) {};
+    if (fscanf(fp,"%x",&session->T.favourite_group)) {};
+    if (fscanf(fp,"%x",&session->T.origin)) {};
+    fclose(fp);
+
+    session->T.valid=true;
+    return true;
+}
+
+static void removeTicket()
+{
+    remove("cookie.txt");
+}
+
+// Construct an HTML GET command
+void make_client_message(octad *GET,char *hostname)
+{
+    OCT_kill(GET);
+    OCT_append_string(GET,(char *)"GET / HTTP/1.1"); // standard HTTP GET command  
+    OCT_append_byte(GET,0x0d,1); OCT_append_byte(GET,0x0a,1);      
+    OCT_append_string(GET,(char *)"Host: ");  
+    OCT_append_string(GET,hostname); //OCT_append_string(&PT,(char *)":443");
+    OCT_append_byte(GET,0x0d,1); OCT_append_byte(GET,0x0a,1);        // CRLF
+    OCT_append_byte(GET,0x0d,1); OCT_append_byte(GET,0x0a,1);        // empty line CRLF    
+}
+
+enum SocketType{
+    SOCKET_TYPE_AF_UNIX,
+    SOCKET_TYPE_AF_INET
+};
+
+static void bad_input()
+{
+    printf("Incorrect Usage\n");
+    printf("client <flags> <hostname>\n");
+    printf("client <flags> <hostname:port>\n");
+    printf("(hostname may be localhost)\n");
+    printf("(port defaults to 443, or 4433 on localhost)\n");
+    printf("Resumption automatically attempted if recent ticket found\n");
+    printf("Valid flags:- \n");
+    printf("    -r remove stored ticket\n");
+    printf("    -r <hostname> remove stored ticket and connect to hostname\n");
+    printf("    -s show SAL capabilities\n");
+	printf("    -i <hostname> try IBE connection\n");
+    printf("    -p <n> hostname (where <n> is preshared key identity - here must be 42)\n");
+    printf("Example:- client www.bbc.co.uk\n");
+}
+
+// JS doplnene nazvy PQ algoritmov
+static void nameGroup(int kex)
+{
+    switch (kex)
+    {
+    case X25519:
+        printf("X25519\n");
+        break;
+    case SECP256R1:
+        printf("SECP256R1\n");   
+        break;
+    case SECP384R1:
+        printf("SECP384R1\n");   
+        break;
+    case KYBER768:
+        printf("KYBER768\n");
+        break;
+    case KYBER512:
+        printf("KYBER512\n");
+        break;
+    case KYBER1024:
+        printf("KYBER1024\n");
+        break;
+    case MLKEM512:
+        printf("MLKEM512\n");
+        break;
+    case MLKEM768:
+        printf("MLKEM768\n");
+        break;
+    case MLKEM1024:
+        printf("MLKEM1024\n");
+        break;
+    case BIKEL1:
+        printf("BIKEL1\n");
+        break;
+    case BIKEL3:
+        printf("BIKEL3\n");
+        break;
+    case BIKEL5:
+        printf("BIKEL5\n");
+        break;
+    case HQC128:
+        printf("HQC128\n");
+        break;
+    case HQC192:
+        printf("HQC192\n");
+        break;
+    case HQC256:
+        printf("HQC256\n");
+        break;
+    case FRODO640AES:
+        printf("FRODO640AES\n");
+        break;
+    case FRODO640SHAKE:
+        printf("FRODO640SHAKE\n");
+        break;
+    case FRODO976AES:
+        printf("FRODO976AES\n");
+        break;
+    case FRODO976SHAKE:
+        printf("FRODO976SHAKE\n");
+        break;
+    case FRODO1344AES:
+        printf("FRODO1344AES\n");
+        break;
+    case FRODO1344SHAKE:
+        printf("FRODO1344SHAKE\n");
+        break;
+    case HYBRID_KX:
+        printf("KYBER + X25519\n");
+        break;
+    default:
+        printf("Non-standard\n");   
+        break;
+    }
+
+}
+
+static void nameCipher(int cipher_suite)
+{
+    switch (cipher_suite)
+    {
+    case TLS_AES_128_GCM_SHA256:
+		printf("TLS_AES_128_GCM_SHA256\n");
+        break;
+    case TLS_AES_256_GCM_SHA384:
+        printf("TLS_AES_256_GCM_SHA384\n");   
+        break;
+    case TLS_CHACHA20_POLY1305_SHA256:
+        printf("TLS_CHACHA20_POLY1305_SHA256\n");   
+        break;
+    default:
+        printf("Non-standard\n");   
+        break;
+    }
+}
+
+// JS doplnene nazvy PQ algoritmov
+static void nameSigAlg(int sigAlg)
+{
+    switch (sigAlg)
+    {
+    case ECDSA_SECP256R1_SHA256:
+        printf("ECDSA_SECP256R1_SHA256\n");
+        break;
+    case RSA_PSS_RSAE_SHA256:
+        printf("RSA_PSS_RSAE_SHA256\n");   
+        break;
+    case RSA_PKCS1_SHA256:
+        printf("RSA_PKCS1_SHA256\n");   
+        break;
+    case ECDSA_SECP384R1_SHA384:
+        printf("ECDSA_SECP384R1_SHA384\n");
+        break;
+    case RSA_PSS_RSAE_SHA384:
+        printf("RSA_PSS_RSAE_SHA384\n");   
+        break;
+    case RSA_PKCS1_SHA384:
+        printf("RSA_PKCS1_SHA384\n");   
+        break;
+    case RSA_PSS_RSAE_SHA512:
+        printf("RSA_PSS_RSAE_SHA512\n");   
+        break;
+    case RSA_PKCS1_SHA512:
+        printf("RSA_PKCS1_SHA512\n");   
+        break;
+    case ED25519:
+        printf("ED25519\n");   
+        break;
+    case DILITHIUM2:
+        printf("DILITHIUM2\n");   
+        break;
+    case DILITHIUM3:
+        printf("DILITHIUM3\n");   
+        break;
+    case DILITHIUM5:
+        printf("DILITHIUM5\n");   
+        break;
+    case MLDSA44:
+        printf("MLDSA44\n");   
+        break;
+    case MLDSA65:
+        printf("MLDSA65\n");   
+        break;
+    case MLDSA87:
+        printf("MLDSA87\n");   
+        break;
+    case FALCON512:
+        printf("FALCON512\n");   
+        break;
+    case FALCON1024:
+        printf("FALCON1024\n");   
+        break;
+    case SPHINCSSHA2128FSIMPLE:
+        printf("SPHINCSSHA2128FSIMPLE\n");   
+        break;
+    case SPHINCSSHA2128SSIMPLE:
+        printf("SPHINCSSHA2128SSIMPLE\n");   
+        break;
+    case SPHINCSSHAKE128FSIMPLE:
+        printf("SPHINCSSHAKE128FSIMPLE\n");   
+        break;
+    case DILITHIUM2_P256:
+        printf("DILITHIUM2 + P256\n");   
+        break;
+    default:
+        printf("Non-standard\n");   
+        break;
+    }
+}
+
+// convert TLS octad to MIRACL core octet
+static octet octad_to_octet(octad *x)
+{
+    octet y;
+    if (x!=NULL) {
+        y.len=x->len;
+        y.max=x->max;
+        y.val=x->val;
+    } else {
+        y.len=y.max=0;
+        y.val=NULL;
+    }
+    return y;
+}
+
+//extern int BYTES_READ;
+//extern int BYTES_WRITTEN;
+
+int main(int argc, char const *argv[])
+{
+    char get[256];
+    octad GET={0,sizeof(get),get};     // initial message
+    char resp[40];
+    octad RESP={0,sizeof(resp),resp};  // response (will be truncated)
+    char hostname[TLS_MAX_SERVER_NAME];
+    char myhostname[TLS_MAX_SERVER_NAME];
+    char psk[TLS_MAX_KEY];
+    octad PSK = {0,sizeof(psk),psk};    // Pre-Shared Key   
+    char psk_label[32];
+    octad PSK_label={0,sizeof(psk_label),psk_label};
+    char r32[32];
+    octad R32={0,sizeof(r32),r32};
+    bool HAVE_PSK=false;
+    bool HAVE_TICKET=false;
+    bool TICKET_FAILED=false;
+
+    int psk_type=PSK_NOT;
+
+    // JS inicializacia WSA struktury nevyhnutnu pre socketovu komunikaciu na Windowse
+    // struktura musi byt uvolnena funkciou WSACleanup();
+    #ifdef __WIN32
+        WSADATA wsaData;
+        int iResult = WSAStartup(MAKEWORD(2, 2), &wsaData);
+        if (iResult != 0){
+                log(IO_PROTOCOL,(char *)"WSASturtup() failed\n",NULL,0,NULL);
+                exit(EXIT_FAILURE);
+        }  
+    #endif
+
+    int port=443;
+    SocketType socketType = SocketType::SOCKET_TYPE_AF_INET;
+    Socket client = (socketType == SocketType::SOCKET_TYPE_AF_UNIX) ?
+                    Socket::UnixSocket():
+                    Socket::InetSocket();
+    argv++; argc--;
+    int ip=0;
+
+    if (ip>=argc)
+    {
+        bad_input();
+        exit(EXIT_FAILURE);
+    }
+
+// Initialise Security Abstraction Layer
+    bool retn=SAL_initLib();
+    if (!retn)
+    {
+        log(IO_PROTOCOL,(char *)"Security Abstraction Layer failed to start\n",NULL,0,NULL);
+        exit(EXIT_FAILURE);
+    }
+
+    if (strcmp(argv[ip],"-p")==0)
+    {
+        if (ip<argc)
+        {
+            printf("PSK mode selected - have a shared key\n");
+            ip++;
+ 
+            psk_type=PSK_KEY;
+
+            OCT_append_string(&PSK_label,(char *)argv[1]);
+            PSK.len=16;
+            for (int i=0;i<16;i++)
+                PSK.val[i]=i+1;                // Fake a 128-bit pre-shared key
+			ip++;
+            HAVE_PSK=true;
+        }
+    }
+
+    else if (strcmp(argv[ip],"-i")==0)
+    {
+        if (ip<argc)
+        {
+            printf("PSK mode selected\n");
+            ip++;
+            psk_type=PSK_IBE;
+            HAVE_PSK=true;
+        }
+    }
+
+    else if (strcmp(argv[ip],"-r")==0)
+    {
+        printf("Ticket removed\n");
+        removeTicket(); ip++;
+		if (ip>=argc) exit(0);
+        //exit(0);
+    }
+
+    else if (strcmp(argv[ip],"-s")==0)
+    { // interrogate SAL
+        int i,ns,iterations;
+        int nt[20];
+        clock_t start;
+        double elapsed;
+        printf("Cryptography by %s\n",SAL_name());
+        ns=SAL_groups(nt);
+        printf("SAL supported Key Exchange groups\n");
+        for (i=0;i<ns;i++ )
+        {
+            printf("    ");
+            nameGroup(nt[i]);
+
+            char sk[TLS_MAX_KEX_SECRET_KEY_SIZE];
+            octad SK={0,sizeof(sk),sk};
+            char pk[TLS_MAX_KEX_PUB_KEY_SIZE];
+            octad PK={0,sizeof(pk),pk};
+
+            iterations=0;
+            start = clock();
+            do {
+                SAL_generateKeyPair(nt[i],&SK,&PK);
+                iterations++;
+                elapsed = (clock() - start) / (double)CLOCKS_PER_SEC;
+            } while (elapsed < MIN_TIME || iterations < MIN_ITERS);
+            elapsed = 1000.0 * elapsed / iterations;
+            printf("        Key Generation %8.2lf ms\n", elapsed);
+
+            // JS doplneny vypis pre velkosti klucov
+            printf("        Public key size: %d bytes\n", PK.len);
+            printf("        Secret key size: %d bytes\n", SK.len);
+
+        }
+        ns=SAL_ciphers(nt);
+        printf("SAL supported Cipher suites\n");
+        for (i=0;i<ns;i++ )
+        {
+            printf("    ");
+            nameCipher(nt[i]);
+        }
+        ns=SAL_sigs(nt);
+        printf("SAL supported TLS signatures\n");
+        for (i=0;i<ns;i++ )
+        {
+            printf("    ");
+            nameSigAlg(nt[i]);
+        }
+        ns=SAL_sigCerts(nt);
+        printf("SAL supported Certificate signatures\n");
+        for (i=0;i<ns;i++ )
+        {
+            printf("    ");
+            nameSigAlg(nt[i]);
+        }
+        exit(0);
+    }
+    if (strcmp(argv[ip],"localhost")==0)
+    {
+        strcpy(hostname, "localhost");
+        port = 4433;
+    } else {
+        int i;
+        bool contains_colon = false;
+        size_t argv_len = strlen(argv[ip]);
+        for(i=0; i < argv_len; ++i)
+        {
+            if(argv[ip][i] == ':')
+            {
+                contains_colon = true;
+                break;
+            }
+        }
+        if (contains_colon)
+        {
+            strncpy(hostname, argv[ip], i);
+            hostname[i]=0;
+            char port_part[5];
+            strncpy(port_part, argv[ip]+sizeof(char)*(i+1), (argv_len - i));
+            port = atoi(port_part);
+
+            //char ipaddr[20];
+            //getIPaddress(ipaddr,hostname);
+            //printf("ip address= %s\n",ipaddr);
+        } else {
+            strcpy(hostname, argv[ip]);
+            port = 443;
+        }
+    }
+    log(IO_PROTOCOL,(char *)"Hostname= ",hostname,0,NULL);
+
+    make_client_message(&GET,hostname);
+
+    if (ip>=argc)
+    {
+        bad_input();
+        exit(EXIT_FAILURE);
+    }
+
+    if (!client.connect(hostname,port))
+    {
+        log(IO_PROTOCOL,(char *)"Unable to access ",hostname,0,NULL);
+ 		exit(EXIT_FAILURE);
+    }
+
+    printf("Local Port= %d\n",client.getport());
+
+// create new session
+    TLS_session state=TLS13_start(&client,hostname);
+    TLS_session *session=&state;
+
+    HAVE_TICKET=true;
+    if (HAVE_PSK)
+    {
+        strcpy(myhostname, "localhost"); // for now assume its only for use with localhost
+        if (psk_type==PSK_KEY)
+        {
+            OCT_copy(&session->T.TICK,&PSK_label);      // Insert a special ticket into session 
+            OCT_copy(&session->T.PSK,&PSK);
+            session->T.favourite_group=X25519;
+        }
+        if (psk_type==PSK_IBE)	// Use IBE shared key
+        {
+#if CRYPTO_SETTING == TINY_ECC || CRYPTO_SETTING == TYPICAL
+            log(IO_PROTOCOL,(char *)"Using Pairing-Based IBE\n",NULL,0,NULL);
+            SAL_randomOctad(32,&R32);
+            octet MC_R32=octad_to_octet(&R32);
+            octet MC_PSK=octad_to_octet(&session->T.PSK);
+            octet MC_TICK=octad_to_octet(&session->T.TICK);
+            BFIBE_CCA_ENCRYPT(myhostname,&MC_R32,&MC_PSK,&MC_TICK);
+            session->T.PSK.len=MC_PSK.len;
+            session->T.TICK.len=MC_TICK.len;
+            session->T.favourite_group=X25519;
+#endif
+#if CRYPTO_SETTING == POST_QUANTUM
+            log(IO_PROTOCOL,(char *)"Using Post Quantum IBE\n",NULL,0,NULL);
+            SAL_randomOctad(32,&R32);
+            octet MC_R32=octad_to_octet(&R32);
+            octet MC_PSK=octad_to_octet(&session->T.PSK);
+            octet MC_TICK=octad_to_octet(&session->T.TICK);
+            PQIBE_CCA_ENCRYPT(myhostname,&MC_R32,&MC_PSK,&MC_TICK);
+            session->T.PSK.len=MC_PSK.len;
+            session->T.TICK.len=MC_TICK.len;
+            session->T.favourite_group=KYBER768;
+#endif
+#if CRYPTO_SETTING == HYBRID
+            log(IO_PROTOCOL,(char *)"Using Hybrid Pairing based/Post Quantum IBE\n",NULL,0,NULL);
+            char psk2[32];
+            octad PSK2={0,sizeof(psk2),psk2};
+            char tick2[256];
+            octad TICK2={0,sizeof(tick2),tick2};
+
+            SAL_randomOctad(32,&R32);
+            octet MC_R32=octad_to_octet(&R32);
+            octet MC_PSK=octad_to_octet(&session->T.PSK);
+            octet MC_TICK=octad_to_octet(&session->T.TICK);
+            PQIBE_CCA_ENCRYPT(myhostname,&MC_R32,&MC_PSK,&MC_TICK);
+            session->T.PSK.len=MC_PSK.len;
+            session->T.TICK.len=MC_TICK.len;
+
+            SAL_randomOctad(32,&R32);
+            MC_PSK=octad_to_octet(&PSK2);
+            MC_TICK=octad_to_octet(&TICK2);
+            BFIBE_CCA_ENCRYPT(myhostname,&MC_R32,&MC_PSK,&MC_TICK);
+            PSK2.len=MC_PSK.len;
+            TICK2.len=MC_TICK.len;
+
+            OCT_append_octad(&session->T.PSK,&PSK2);
+            OCT_append_octad(&session->T.TICK,&TICK2);
+            session->T.favourite_group=HYBRID_KX;
+#endif
+        }
+        session->T.max_early_data=1024;
+        session->T.cipher_suite=TLS_AES_128_GCM_SHA256;
+        session->T.origin=TLS_EXTERNAL_PSK;
+        session->T.valid=true;
+        removeTicket();  // delete any stored ticket - fall into resumption mode
+    } else {
+        if (!recoverTicket(session))
+            HAVE_TICKET=false;
+    }
+
+//    removeTicket();    // old tickets MAY be re-used, so don't remove
+
+// Make TLS connection, and try to send early data. 
+// If early data not allowed, early data will still be sent internally after handshake completes
+ 
+    if (!TLS13_connect(session,&GET))
+    { 
+        if (HAVE_TICKET)
+        { // ticket didn't work !?
+            TICKET_FAILED=true;
+            removeTicket();
+            TLS13_stop(session);
+            client.stop();  // reconnect
+            client.connect(hostname,port);
+            if (!TLS13_connect(session,&GET)) // try again, this time fall back to a FULL handshake
+            {  
+                log(IO_APPLICATION,(char *)"TLS Handshake failed\n",NULL,0,NULL);
+                TLS13_stop(session);
+                TLS13_end(session);
+                client.stop();
+                // JS uvolenie struktury pri ukonceni programu
+                #ifdef __WIN32
+	                WSACleanup();
+                #endif
+                return 0;
+            }
+        } else {
+            log(IO_APPLICATION,(char *)"TLS Handshake failed\n",NULL,0,NULL);
+            TLS13_stop(session);
+            TLS13_end(session);
+            client.stop();
+            // JS uvolenie struktury pri ukonceni programu
+            #ifdef __WIN32
+	                WSACleanup();
+            #endif
+            return 0;
+        }
+    }
+    
+// printf("BYTES_READ= %d BYTES_WRITTEN= %d\n",BYTES_READ,BYTES_WRITTEN);
+
+// Get server response, may attach resumption ticket to session
+// Wait for some HTML from website, then send an alert to close it
+
+//    sendZeroRecord(session);  // to bewilder the enemy
+
+    int rtn=TLS13_recv(session,&RESP);
+    if (rtn>0) {
+        log(IO_APPLICATION,(char *)"Receiving application data (truncated HTML) = ",NULL,0,&RESP);
+        TLS13_stop(session);
+    }
+
+// If session collected a Ticket, store it somewhere for next time
+    if (session->T.valid && !TICKET_FAILED)
+        storeTicket(session);
+
+    TLS13_end(session);
+    client.stop();
+    // JS uvolenie struktury pri ukonceni programu
+    #ifdef __WIN32
+	    WSACleanup();
+    #endif
+    return 0;
+}